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 (EMACS_INT nbytes
)
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
484 memory_full (nbytes
);
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
;
707 /* Like free but block interrupt input. */
710 xfree (POINTER_TYPE
*block
)
716 MALLOC_UNBLOCK_INPUT
;
717 /* We don't call refill_memory_reserve here
718 because that duplicates doing so in emacs_blocked_free
719 and the criterion should go there. */
723 /* Like strdup, but uses xmalloc. */
726 xstrdup (const char *s
)
728 size_t len
= strlen (s
) + 1;
729 char *p
= (char *) xmalloc (len
);
735 /* Unwind for SAFE_ALLOCA */
738 safe_alloca_unwind (Lisp_Object arg
)
740 register struct Lisp_Save_Value
*p
= XSAVE_VALUE (arg
);
750 /* Like malloc but used for allocating Lisp data. NBYTES is the
751 number of bytes to allocate, TYPE describes the intended use of the
752 allcated memory block (for strings, for conses, ...). */
755 static void *lisp_malloc_loser
;
758 static POINTER_TYPE
*
759 lisp_malloc (size_t nbytes
, enum mem_type type
)
765 #ifdef GC_MALLOC_CHECK
766 allocated_mem_type
= type
;
769 val
= (void *) malloc (nbytes
);
772 /* If the memory just allocated cannot be addressed thru a Lisp
773 object's pointer, and it needs to be,
774 that's equivalent to running out of memory. */
775 if (val
&& type
!= MEM_TYPE_NON_LISP
)
778 XSETCONS (tem
, (char *) val
+ nbytes
- 1);
779 if ((char *) XCONS (tem
) != (char *) val
+ nbytes
- 1)
781 lisp_malloc_loser
= val
;
788 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
789 if (val
&& type
!= MEM_TYPE_NON_LISP
)
790 mem_insert (val
, (char *) val
+ nbytes
, type
);
793 MALLOC_UNBLOCK_INPUT
;
795 memory_full (nbytes
);
799 /* Free BLOCK. This must be called to free memory allocated with a
800 call to lisp_malloc. */
803 lisp_free (POINTER_TYPE
*block
)
807 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
808 mem_delete (mem_find (block
));
810 MALLOC_UNBLOCK_INPUT
;
813 /* Allocation of aligned blocks of memory to store Lisp data. */
814 /* The entry point is lisp_align_malloc which returns blocks of at most */
815 /* BLOCK_BYTES and guarantees they are aligned on a BLOCK_ALIGN boundary. */
817 /* Use posix_memalloc if the system has it and we're using the system's
818 malloc (because our gmalloc.c routines don't have posix_memalign although
819 its memalloc could be used). */
820 #if defined (HAVE_POSIX_MEMALIGN) && defined (SYSTEM_MALLOC)
821 #define USE_POSIX_MEMALIGN 1
824 /* BLOCK_ALIGN has to be a power of 2. */
825 #define BLOCK_ALIGN (1 << 10)
827 /* Padding to leave at the end of a malloc'd block. This is to give
828 malloc a chance to minimize the amount of memory wasted to alignment.
829 It should be tuned to the particular malloc library used.
830 On glibc-2.3.2, malloc never tries to align, so a padding of 0 is best.
831 posix_memalign on the other hand would ideally prefer a value of 4
832 because otherwise, there's 1020 bytes wasted between each ablocks.
833 In Emacs, testing shows that those 1020 can most of the time be
834 efficiently used by malloc to place other objects, so a value of 0 can
835 still preferable unless you have a lot of aligned blocks and virtually
837 #define BLOCK_PADDING 0
838 #define BLOCK_BYTES \
839 (BLOCK_ALIGN - sizeof (struct ablocks *) - BLOCK_PADDING)
841 /* Internal data structures and constants. */
843 #define ABLOCKS_SIZE 16
845 /* An aligned block of memory. */
850 char payload
[BLOCK_BYTES
];
851 struct ablock
*next_free
;
853 /* `abase' is the aligned base of the ablocks. */
854 /* It is overloaded to hold the virtual `busy' field that counts
855 the number of used ablock in the parent ablocks.
856 The first ablock has the `busy' field, the others have the `abase'
857 field. To tell the difference, we assume that pointers will have
858 integer values larger than 2 * ABLOCKS_SIZE. The lowest bit of `busy'
859 is used to tell whether the real base of the parent ablocks is `abase'
860 (if not, the word before the first ablock holds a pointer to the
862 struct ablocks
*abase
;
863 /* The padding of all but the last ablock is unused. The padding of
864 the last ablock in an ablocks is not allocated. */
866 char padding
[BLOCK_PADDING
];
870 /* A bunch of consecutive aligned blocks. */
873 struct ablock blocks
[ABLOCKS_SIZE
];
876 /* Size of the block requested from malloc or memalign. */
877 #define ABLOCKS_BYTES (sizeof (struct ablocks) - BLOCK_PADDING)
879 #define ABLOCK_ABASE(block) \
880 (((uintptr_t) (block)->abase) <= (1 + 2 * ABLOCKS_SIZE) \
881 ? (struct ablocks *)(block) \
884 /* Virtual `busy' field. */
885 #define ABLOCKS_BUSY(abase) ((abase)->blocks[0].abase)
887 /* Pointer to the (not necessarily aligned) malloc block. */
888 #ifdef USE_POSIX_MEMALIGN
889 #define ABLOCKS_BASE(abase) (abase)
891 #define ABLOCKS_BASE(abase) \
892 (1 & (intptr_t) ABLOCKS_BUSY (abase) ? abase : ((void**)abase)[-1])
895 /* The list of free ablock. */
896 static struct ablock
*free_ablock
;
898 /* Allocate an aligned block of nbytes.
899 Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be
900 smaller or equal to BLOCK_BYTES. */
901 static POINTER_TYPE
*
902 lisp_align_malloc (size_t nbytes
, enum mem_type type
)
905 struct ablocks
*abase
;
907 eassert (nbytes
<= BLOCK_BYTES
);
911 #ifdef GC_MALLOC_CHECK
912 allocated_mem_type
= type
;
918 intptr_t aligned
; /* int gets warning casting to 64-bit pointer. */
920 #ifdef DOUG_LEA_MALLOC
921 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
922 because mapped region contents are not preserved in
924 mallopt (M_MMAP_MAX
, 0);
927 #ifdef USE_POSIX_MEMALIGN
929 int err
= posix_memalign (&base
, BLOCK_ALIGN
, ABLOCKS_BYTES
);
935 base
= malloc (ABLOCKS_BYTES
);
936 abase
= ALIGN (base
, BLOCK_ALIGN
);
941 MALLOC_UNBLOCK_INPUT
;
942 memory_full (ABLOCKS_BYTES
);
945 aligned
= (base
== abase
);
947 ((void**)abase
)[-1] = base
;
949 #ifdef DOUG_LEA_MALLOC
950 /* Back to a reasonable maximum of mmap'ed areas. */
951 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
955 /* If the memory just allocated cannot be addressed thru a Lisp
956 object's pointer, and it needs to be, that's equivalent to
957 running out of memory. */
958 if (type
!= MEM_TYPE_NON_LISP
)
961 char *end
= (char *) base
+ ABLOCKS_BYTES
- 1;
963 if ((char *) XCONS (tem
) != end
)
965 lisp_malloc_loser
= base
;
967 MALLOC_UNBLOCK_INPUT
;
968 memory_full (SIZE_MAX
);
973 /* Initialize the blocks and put them on the free list.
974 Is `base' was not properly aligned, we can't use the last block. */
975 for (i
= 0; i
< (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1); i
++)
977 abase
->blocks
[i
].abase
= abase
;
978 abase
->blocks
[i
].x
.next_free
= free_ablock
;
979 free_ablock
= &abase
->blocks
[i
];
981 ABLOCKS_BUSY (abase
) = (struct ablocks
*) aligned
;
983 eassert (0 == ((uintptr_t) abase
) % BLOCK_ALIGN
);
984 eassert (ABLOCK_ABASE (&abase
->blocks
[3]) == abase
); /* 3 is arbitrary */
985 eassert (ABLOCK_ABASE (&abase
->blocks
[0]) == abase
);
986 eassert (ABLOCKS_BASE (abase
) == base
);
987 eassert (aligned
== (intptr_t) ABLOCKS_BUSY (abase
));
990 abase
= ABLOCK_ABASE (free_ablock
);
991 ABLOCKS_BUSY (abase
) =
992 (struct ablocks
*) (2 + (intptr_t) ABLOCKS_BUSY (abase
));
994 free_ablock
= free_ablock
->x
.next_free
;
996 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
997 if (type
!= MEM_TYPE_NON_LISP
)
998 mem_insert (val
, (char *) val
+ nbytes
, type
);
1001 MALLOC_UNBLOCK_INPUT
;
1003 eassert (0 == ((uintptr_t) val
) % BLOCK_ALIGN
);
1008 lisp_align_free (POINTER_TYPE
*block
)
1010 struct ablock
*ablock
= block
;
1011 struct ablocks
*abase
= ABLOCK_ABASE (ablock
);
1014 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1015 mem_delete (mem_find (block
));
1017 /* Put on free list. */
1018 ablock
->x
.next_free
= free_ablock
;
1019 free_ablock
= ablock
;
1020 /* Update busy count. */
1021 ABLOCKS_BUSY (abase
) =
1022 (struct ablocks
*) (-2 + (intptr_t) ABLOCKS_BUSY (abase
));
1024 if (2 > (intptr_t) ABLOCKS_BUSY (abase
))
1025 { /* All the blocks are free. */
1026 int i
= 0, aligned
= (intptr_t) ABLOCKS_BUSY (abase
);
1027 struct ablock
**tem
= &free_ablock
;
1028 struct ablock
*atop
= &abase
->blocks
[aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1];
1032 if (*tem
>= (struct ablock
*) abase
&& *tem
< atop
)
1035 *tem
= (*tem
)->x
.next_free
;
1038 tem
= &(*tem
)->x
.next_free
;
1040 eassert ((aligned
& 1) == aligned
);
1041 eassert (i
== (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1));
1042 #ifdef USE_POSIX_MEMALIGN
1043 eassert ((uintptr_t) ABLOCKS_BASE (abase
) % BLOCK_ALIGN
== 0);
1045 free (ABLOCKS_BASE (abase
));
1047 MALLOC_UNBLOCK_INPUT
;
1050 /* Return a new buffer structure allocated from the heap with
1051 a call to lisp_malloc. */
1054 allocate_buffer (void)
1057 = (struct buffer
*) lisp_malloc (sizeof (struct buffer
),
1059 XSETPVECTYPESIZE (b
, PVEC_BUFFER
,
1060 ((sizeof (struct buffer
) + sizeof (EMACS_INT
) - 1)
1061 / sizeof (EMACS_INT
)));
1066 #ifndef SYSTEM_MALLOC
1068 /* Arranging to disable input signals while we're in malloc.
1070 This only works with GNU malloc. To help out systems which can't
1071 use GNU malloc, all the calls to malloc, realloc, and free
1072 elsewhere in the code should be inside a BLOCK_INPUT/UNBLOCK_INPUT
1073 pair; unfortunately, we have no idea what C library functions
1074 might call malloc, so we can't really protect them unless you're
1075 using GNU malloc. Fortunately, most of the major operating systems
1076 can use GNU malloc. */
1079 /* When using SYNC_INPUT, we don't call malloc from a signal handler, so
1080 there's no need to block input around malloc. */
1082 #ifndef DOUG_LEA_MALLOC
1083 extern void * (*__malloc_hook
) (size_t, const void *);
1084 extern void * (*__realloc_hook
) (void *, size_t, const void *);
1085 extern void (*__free_hook
) (void *, const void *);
1086 /* Else declared in malloc.h, perhaps with an extra arg. */
1087 #endif /* DOUG_LEA_MALLOC */
1088 static void * (*old_malloc_hook
) (size_t, const void *);
1089 static void * (*old_realloc_hook
) (void *, size_t, const void*);
1090 static void (*old_free_hook
) (void*, const void*);
1092 #ifdef DOUG_LEA_MALLOC
1093 # define BYTES_USED (mallinfo ().uordblks)
1095 # define BYTES_USED _bytes_used
1098 static __malloc_size_t bytes_used_when_reconsidered
;
1100 /* Value of _bytes_used, when spare_memory was freed. */
1102 static __malloc_size_t bytes_used_when_full
;
1104 /* This function is used as the hook for free to call. */
1107 emacs_blocked_free (void *ptr
, const void *ptr2
)
1111 #ifdef GC_MALLOC_CHECK
1117 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1120 "Freeing `%p' which wasn't allocated with malloc\n", ptr
);
1125 /* fprintf (stderr, "free %p...%p (%p)\n", m->start, m->end, ptr); */
1129 #endif /* GC_MALLOC_CHECK */
1131 __free_hook
= old_free_hook
;
1134 /* If we released our reserve (due to running out of memory),
1135 and we have a fair amount free once again,
1136 try to set aside another reserve in case we run out once more. */
1137 if (! NILP (Vmemory_full
)
1138 /* Verify there is enough space that even with the malloc
1139 hysteresis this call won't run out again.
1140 The code here is correct as long as SPARE_MEMORY
1141 is substantially larger than the block size malloc uses. */
1142 && (bytes_used_when_full
1143 > ((bytes_used_when_reconsidered
= BYTES_USED
)
1144 + max (malloc_hysteresis
, 4) * SPARE_MEMORY
)))
1145 refill_memory_reserve ();
1147 __free_hook
= emacs_blocked_free
;
1148 UNBLOCK_INPUT_ALLOC
;
1152 /* This function is the malloc hook that Emacs uses. */
1155 emacs_blocked_malloc (size_t size
, const void *ptr
)
1160 __malloc_hook
= old_malloc_hook
;
1161 #ifdef DOUG_LEA_MALLOC
1162 /* Segfaults on my system. --lorentey */
1163 /* mallopt (M_TOP_PAD, malloc_hysteresis * 4096); */
1165 __malloc_extra_blocks
= malloc_hysteresis
;
1168 value
= (void *) malloc (size
);
1170 #ifdef GC_MALLOC_CHECK
1172 struct mem_node
*m
= mem_find (value
);
1175 fprintf (stderr
, "Malloc returned %p which is already in use\n",
1177 fprintf (stderr
, "Region in use is %p...%p, %u bytes, type %d\n",
1178 m
->start
, m
->end
, (char *) m
->end
- (char *) m
->start
,
1183 if (!dont_register_blocks
)
1185 mem_insert (value
, (char *) value
+ max (1, size
), allocated_mem_type
);
1186 allocated_mem_type
= MEM_TYPE_NON_LISP
;
1189 #endif /* GC_MALLOC_CHECK */
1191 __malloc_hook
= emacs_blocked_malloc
;
1192 UNBLOCK_INPUT_ALLOC
;
1194 /* fprintf (stderr, "%p malloc\n", value); */
1199 /* This function is the realloc hook that Emacs uses. */
1202 emacs_blocked_realloc (void *ptr
, size_t size
, const void *ptr2
)
1207 __realloc_hook
= old_realloc_hook
;
1209 #ifdef GC_MALLOC_CHECK
1212 struct mem_node
*m
= mem_find (ptr
);
1213 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1216 "Realloc of %p which wasn't allocated with malloc\n",
1224 /* fprintf (stderr, "%p -> realloc\n", ptr); */
1226 /* Prevent malloc from registering blocks. */
1227 dont_register_blocks
= 1;
1228 #endif /* GC_MALLOC_CHECK */
1230 value
= (void *) realloc (ptr
, size
);
1232 #ifdef GC_MALLOC_CHECK
1233 dont_register_blocks
= 0;
1236 struct mem_node
*m
= mem_find (value
);
1239 fprintf (stderr
, "Realloc returns memory that is already in use\n");
1243 /* Can't handle zero size regions in the red-black tree. */
1244 mem_insert (value
, (char *) value
+ max (size
, 1), MEM_TYPE_NON_LISP
);
1247 /* fprintf (stderr, "%p <- realloc\n", value); */
1248 #endif /* GC_MALLOC_CHECK */
1250 __realloc_hook
= emacs_blocked_realloc
;
1251 UNBLOCK_INPUT_ALLOC
;
1257 #ifdef HAVE_GTK_AND_PTHREAD
1258 /* Called from Fdump_emacs so that when the dumped Emacs starts, it has a
1259 normal malloc. Some thread implementations need this as they call
1260 malloc before main. The pthread_self call in BLOCK_INPUT_ALLOC then
1261 calls malloc because it is the first call, and we have an endless loop. */
1264 reset_malloc_hooks ()
1266 __free_hook
= old_free_hook
;
1267 __malloc_hook
= old_malloc_hook
;
1268 __realloc_hook
= old_realloc_hook
;
1270 #endif /* HAVE_GTK_AND_PTHREAD */
1273 /* Called from main to set up malloc to use our hooks. */
1276 uninterrupt_malloc (void)
1278 #ifdef HAVE_GTK_AND_PTHREAD
1279 #ifdef DOUG_LEA_MALLOC
1280 pthread_mutexattr_t attr
;
1282 /* GLIBC has a faster way to do this, but lets keep it portable.
1283 This is according to the Single UNIX Specification. */
1284 pthread_mutexattr_init (&attr
);
1285 pthread_mutexattr_settype (&attr
, PTHREAD_MUTEX_RECURSIVE
);
1286 pthread_mutex_init (&alloc_mutex
, &attr
);
1287 #else /* !DOUG_LEA_MALLOC */
1288 /* Some systems such as Solaris 2.6 don't have a recursive mutex,
1289 and the bundled gmalloc.c doesn't require it. */
1290 pthread_mutex_init (&alloc_mutex
, NULL
);
1291 #endif /* !DOUG_LEA_MALLOC */
1292 #endif /* HAVE_GTK_AND_PTHREAD */
1294 if (__free_hook
!= emacs_blocked_free
)
1295 old_free_hook
= __free_hook
;
1296 __free_hook
= emacs_blocked_free
;
1298 if (__malloc_hook
!= emacs_blocked_malloc
)
1299 old_malloc_hook
= __malloc_hook
;
1300 __malloc_hook
= emacs_blocked_malloc
;
1302 if (__realloc_hook
!= emacs_blocked_realloc
)
1303 old_realloc_hook
= __realloc_hook
;
1304 __realloc_hook
= emacs_blocked_realloc
;
1307 #endif /* not SYNC_INPUT */
1308 #endif /* not SYSTEM_MALLOC */
1312 /***********************************************************************
1314 ***********************************************************************/
1316 /* Number of intervals allocated in an interval_block structure.
1317 The 1020 is 1024 minus malloc overhead. */
1319 #define INTERVAL_BLOCK_SIZE \
1320 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
1322 /* Intervals are allocated in chunks in form of an interval_block
1325 struct interval_block
1327 /* Place `intervals' first, to preserve alignment. */
1328 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
1329 struct interval_block
*next
;
1332 /* Current interval block. Its `next' pointer points to older
1335 static struct interval_block
*interval_block
;
1337 /* Index in interval_block above of the next unused interval
1340 static int interval_block_index
;
1342 /* Number of free and live intervals. */
1344 static int total_free_intervals
, total_intervals
;
1346 /* List of free intervals. */
1348 static INTERVAL interval_free_list
;
1350 /* Total number of interval blocks now in use. */
1352 static int n_interval_blocks
;
1355 /* Initialize interval allocation. */
1358 init_intervals (void)
1360 interval_block
= NULL
;
1361 interval_block_index
= INTERVAL_BLOCK_SIZE
;
1362 interval_free_list
= 0;
1363 n_interval_blocks
= 0;
1367 /* Return a new interval. */
1370 make_interval (void)
1374 /* eassert (!handling_signal); */
1378 if (interval_free_list
)
1380 val
= interval_free_list
;
1381 interval_free_list
= INTERVAL_PARENT (interval_free_list
);
1385 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
1387 register struct interval_block
*newi
;
1389 newi
= (struct interval_block
*) lisp_malloc (sizeof *newi
,
1392 newi
->next
= interval_block
;
1393 interval_block
= newi
;
1394 interval_block_index
= 0;
1395 n_interval_blocks
++;
1397 val
= &interval_block
->intervals
[interval_block_index
++];
1400 MALLOC_UNBLOCK_INPUT
;
1402 consing_since_gc
+= sizeof (struct interval
);
1404 RESET_INTERVAL (val
);
1410 /* Mark Lisp objects in interval I. */
1413 mark_interval (register INTERVAL i
, Lisp_Object dummy
)
1415 eassert (!i
->gcmarkbit
); /* Intervals are never shared. */
1417 mark_object (i
->plist
);
1421 /* Mark the interval tree rooted in TREE. Don't call this directly;
1422 use the macro MARK_INTERVAL_TREE instead. */
1425 mark_interval_tree (register INTERVAL tree
)
1427 /* No need to test if this tree has been marked already; this
1428 function is always called through the MARK_INTERVAL_TREE macro,
1429 which takes care of that. */
1431 traverse_intervals_noorder (tree
, mark_interval
, Qnil
);
1435 /* Mark the interval tree rooted in I. */
1437 #define MARK_INTERVAL_TREE(i) \
1439 if (!NULL_INTERVAL_P (i) && !i->gcmarkbit) \
1440 mark_interval_tree (i); \
1444 #define UNMARK_BALANCE_INTERVALS(i) \
1446 if (! NULL_INTERVAL_P (i)) \
1447 (i) = balance_intervals (i); \
1451 /* Number support. If USE_LISP_UNION_TYPE is in effect, we
1452 can't create number objects in macros. */
1455 make_number (EMACS_INT n
)
1459 obj
.s
.type
= Lisp_Int
;
1464 /***********************************************************************
1466 ***********************************************************************/
1468 /* Lisp_Strings are allocated in string_block structures. When a new
1469 string_block is allocated, all the Lisp_Strings it contains are
1470 added to a free-list string_free_list. When a new Lisp_String is
1471 needed, it is taken from that list. During the sweep phase of GC,
1472 string_blocks that are entirely free are freed, except two which
1475 String data is allocated from sblock structures. Strings larger
1476 than LARGE_STRING_BYTES, get their own sblock, data for smaller
1477 strings is sub-allocated out of sblocks of size SBLOCK_SIZE.
1479 Sblocks consist internally of sdata structures, one for each
1480 Lisp_String. The sdata structure points to the Lisp_String it
1481 belongs to. The Lisp_String points back to the `u.data' member of
1482 its sdata structure.
1484 When a Lisp_String is freed during GC, it is put back on
1485 string_free_list, and its `data' member and its sdata's `string'
1486 pointer is set to null. The size of the string is recorded in the
1487 `u.nbytes' member of the sdata. So, sdata structures that are no
1488 longer used, can be easily recognized, and it's easy to compact the
1489 sblocks of small strings which we do in compact_small_strings. */
1491 /* Size in bytes of an sblock structure used for small strings. This
1492 is 8192 minus malloc overhead. */
1494 #define SBLOCK_SIZE 8188
1496 /* Strings larger than this are considered large strings. String data
1497 for large strings is allocated from individual sblocks. */
1499 #define LARGE_STRING_BYTES 1024
1501 /* Structure describing string memory sub-allocated from an sblock.
1502 This is where the contents of Lisp strings are stored. */
1506 /* Back-pointer to the string this sdata belongs to. If null, this
1507 structure is free, and the NBYTES member of the union below
1508 contains the string's byte size (the same value that STRING_BYTES
1509 would return if STRING were non-null). If non-null, STRING_BYTES
1510 (STRING) is the size of the data, and DATA contains the string's
1512 struct Lisp_String
*string
;
1514 #ifdef GC_CHECK_STRING_BYTES
1517 unsigned char data
[1];
1519 #define SDATA_NBYTES(S) (S)->nbytes
1520 #define SDATA_DATA(S) (S)->data
1521 #define SDATA_SELECTOR(member) member
1523 #else /* not GC_CHECK_STRING_BYTES */
1527 /* When STRING is non-null. */
1528 unsigned char data
[1];
1530 /* When STRING is null. */
1534 #define SDATA_NBYTES(S) (S)->u.nbytes
1535 #define SDATA_DATA(S) (S)->u.data
1536 #define SDATA_SELECTOR(member) u.member
1538 #endif /* not GC_CHECK_STRING_BYTES */
1540 #define SDATA_DATA_OFFSET offsetof (struct sdata, SDATA_SELECTOR (data))
1544 /* Structure describing a block of memory which is sub-allocated to
1545 obtain string data memory for strings. Blocks for small strings
1546 are of fixed size SBLOCK_SIZE. Blocks for large strings are made
1547 as large as needed. */
1552 struct sblock
*next
;
1554 /* Pointer to the next free sdata block. This points past the end
1555 of the sblock if there isn't any space left in this block. */
1556 struct sdata
*next_free
;
1558 /* Start of data. */
1559 struct sdata first_data
;
1562 /* Number of Lisp strings in a string_block structure. The 1020 is
1563 1024 minus malloc overhead. */
1565 #define STRING_BLOCK_SIZE \
1566 ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String))
1568 /* Structure describing a block from which Lisp_String structures
1573 /* Place `strings' first, to preserve alignment. */
1574 struct Lisp_String strings
[STRING_BLOCK_SIZE
];
1575 struct string_block
*next
;
1578 /* Head and tail of the list of sblock structures holding Lisp string
1579 data. We always allocate from current_sblock. The NEXT pointers
1580 in the sblock structures go from oldest_sblock to current_sblock. */
1582 static struct sblock
*oldest_sblock
, *current_sblock
;
1584 /* List of sblocks for large strings. */
1586 static struct sblock
*large_sblocks
;
1588 /* List of string_block structures, and how many there are. */
1590 static struct string_block
*string_blocks
;
1591 static int n_string_blocks
;
1593 /* Free-list of Lisp_Strings. */
1595 static struct Lisp_String
*string_free_list
;
1597 /* Number of live and free Lisp_Strings. */
1599 static int total_strings
, total_free_strings
;
1601 /* Number of bytes used by live strings. */
1603 static EMACS_INT total_string_size
;
1605 /* Given a pointer to a Lisp_String S which is on the free-list
1606 string_free_list, return a pointer to its successor in the
1609 #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S))
1611 /* Return a pointer to the sdata structure belonging to Lisp string S.
1612 S must be live, i.e. S->data must not be null. S->data is actually
1613 a pointer to the `u.data' member of its sdata structure; the
1614 structure starts at a constant offset in front of that. */
1616 #define SDATA_OF_STRING(S) ((struct sdata *) ((S)->data - SDATA_DATA_OFFSET))
1619 #ifdef GC_CHECK_STRING_OVERRUN
1621 /* We check for overrun in string data blocks by appending a small
1622 "cookie" after each allocated string data block, and check for the
1623 presence of this cookie during GC. */
1625 #define GC_STRING_OVERRUN_COOKIE_SIZE 4
1626 static char const string_overrun_cookie
[GC_STRING_OVERRUN_COOKIE_SIZE
] =
1627 { '\xde', '\xad', '\xbe', '\xef' };
1630 #define GC_STRING_OVERRUN_COOKIE_SIZE 0
1633 /* Value is the size of an sdata structure large enough to hold NBYTES
1634 bytes of string data. The value returned includes a terminating
1635 NUL byte, the size of the sdata structure, and padding. */
1637 #ifdef GC_CHECK_STRING_BYTES
1639 #define SDATA_SIZE(NBYTES) \
1640 ((SDATA_DATA_OFFSET \
1642 + sizeof (EMACS_INT) - 1) \
1643 & ~(sizeof (EMACS_INT) - 1))
1645 #else /* not GC_CHECK_STRING_BYTES */
1647 /* The 'max' reserves space for the nbytes union member even when NBYTES + 1 is
1648 less than the size of that member. The 'max' is not needed when
1649 SDATA_DATA_OFFSET is a multiple of sizeof (EMACS_INT), because then the
1650 alignment code reserves enough space. */
1652 #define SDATA_SIZE(NBYTES) \
1653 ((SDATA_DATA_OFFSET \
1654 + (SDATA_DATA_OFFSET % sizeof (EMACS_INT) == 0 \
1656 : max (NBYTES, sizeof (EMACS_INT) - 1)) \
1658 + sizeof (EMACS_INT) - 1) \
1659 & ~(sizeof (EMACS_INT) - 1))
1661 #endif /* not GC_CHECK_STRING_BYTES */
1663 /* Extra bytes to allocate for each string. */
1665 #define GC_STRING_EXTRA (GC_STRING_OVERRUN_COOKIE_SIZE)
1667 /* Initialize string allocation. Called from init_alloc_once. */
1672 total_strings
= total_free_strings
= total_string_size
= 0;
1673 oldest_sblock
= current_sblock
= large_sblocks
= NULL
;
1674 string_blocks
= NULL
;
1675 n_string_blocks
= 0;
1676 string_free_list
= NULL
;
1677 empty_unibyte_string
= make_pure_string ("", 0, 0, 0);
1678 empty_multibyte_string
= make_pure_string ("", 0, 0, 1);
1682 #ifdef GC_CHECK_STRING_BYTES
1684 static int check_string_bytes_count
;
1686 #define CHECK_STRING_BYTES(S) STRING_BYTES (S)
1689 /* Like GC_STRING_BYTES, but with debugging check. */
1692 string_bytes (struct Lisp_String
*s
)
1695 (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1697 if (!PURE_POINTER_P (s
)
1699 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1704 /* Check validity of Lisp strings' string_bytes member in B. */
1707 check_sblock (struct sblock
*b
)
1709 struct sdata
*from
, *end
, *from_end
;
1713 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1715 /* Compute the next FROM here because copying below may
1716 overwrite data we need to compute it. */
1719 /* Check that the string size recorded in the string is the
1720 same as the one recorded in the sdata structure. */
1722 CHECK_STRING_BYTES (from
->string
);
1725 nbytes
= GC_STRING_BYTES (from
->string
);
1727 nbytes
= SDATA_NBYTES (from
);
1729 nbytes
= SDATA_SIZE (nbytes
);
1730 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
1735 /* Check validity of Lisp strings' string_bytes member. ALL_P
1736 non-zero means check all strings, otherwise check only most
1737 recently allocated strings. Used for hunting a bug. */
1740 check_string_bytes (int all_p
)
1746 for (b
= large_sblocks
; b
; b
= b
->next
)
1748 struct Lisp_String
*s
= b
->first_data
.string
;
1750 CHECK_STRING_BYTES (s
);
1753 for (b
= oldest_sblock
; b
; b
= b
->next
)
1757 check_sblock (current_sblock
);
1760 #endif /* GC_CHECK_STRING_BYTES */
1762 #ifdef GC_CHECK_STRING_FREE_LIST
1764 /* Walk through the string free list looking for bogus next pointers.
1765 This may catch buffer overrun from a previous string. */
1768 check_string_free_list (void)
1770 struct Lisp_String
*s
;
1772 /* Pop a Lisp_String off the free-list. */
1773 s
= string_free_list
;
1776 if ((uintptr_t) s
< 1024)
1778 s
= NEXT_FREE_LISP_STRING (s
);
1782 #define check_string_free_list()
1785 /* Return a new Lisp_String. */
1787 static struct Lisp_String
*
1788 allocate_string (void)
1790 struct Lisp_String
*s
;
1792 /* eassert (!handling_signal); */
1796 /* If the free-list is empty, allocate a new string_block, and
1797 add all the Lisp_Strings in it to the free-list. */
1798 if (string_free_list
== NULL
)
1800 struct string_block
*b
;
1803 b
= (struct string_block
*) lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1804 memset (b
, 0, sizeof *b
);
1805 b
->next
= string_blocks
;
1809 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1812 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1813 string_free_list
= s
;
1816 total_free_strings
+= STRING_BLOCK_SIZE
;
1819 check_string_free_list ();
1821 /* Pop a Lisp_String off the free-list. */
1822 s
= string_free_list
;
1823 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1825 MALLOC_UNBLOCK_INPUT
;
1827 /* Probably not strictly necessary, but play it safe. */
1828 memset (s
, 0, sizeof *s
);
1830 --total_free_strings
;
1833 consing_since_gc
+= sizeof *s
;
1835 #ifdef GC_CHECK_STRING_BYTES
1836 if (!noninteractive
)
1838 if (++check_string_bytes_count
== 200)
1840 check_string_bytes_count
= 0;
1841 check_string_bytes (1);
1844 check_string_bytes (0);
1846 #endif /* GC_CHECK_STRING_BYTES */
1852 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1853 plus a NUL byte at the end. Allocate an sdata structure for S, and
1854 set S->data to its `u.data' member. Store a NUL byte at the end of
1855 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1856 S->data if it was initially non-null. */
1859 allocate_string_data (struct Lisp_String
*s
,
1860 EMACS_INT nchars
, EMACS_INT nbytes
)
1862 struct sdata
*data
, *old_data
;
1864 EMACS_INT needed
, old_nbytes
;
1866 /* Determine the number of bytes needed to store NBYTES bytes
1868 needed
= SDATA_SIZE (nbytes
);
1869 old_data
= s
->data
? SDATA_OF_STRING (s
) : NULL
;
1870 old_nbytes
= GC_STRING_BYTES (s
);
1874 if (nbytes
> LARGE_STRING_BYTES
)
1876 size_t size
= offsetof (struct sblock
, first_data
) + needed
;
1878 #ifdef DOUG_LEA_MALLOC
1879 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1880 because mapped region contents are not preserved in
1883 In case you think of allowing it in a dumped Emacs at the
1884 cost of not being able to re-dump, there's another reason:
1885 mmap'ed data typically have an address towards the top of the
1886 address space, which won't fit into an EMACS_INT (at least on
1887 32-bit systems with the current tagging scheme). --fx */
1888 mallopt (M_MMAP_MAX
, 0);
1891 b
= (struct sblock
*) lisp_malloc (size
+ GC_STRING_EXTRA
, MEM_TYPE_NON_LISP
);
1893 #ifdef DOUG_LEA_MALLOC
1894 /* Back to a reasonable maximum of mmap'ed areas. */
1895 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1898 b
->next_free
= &b
->first_data
;
1899 b
->first_data
.string
= NULL
;
1900 b
->next
= large_sblocks
;
1903 else if (current_sblock
== NULL
1904 || (((char *) current_sblock
+ SBLOCK_SIZE
1905 - (char *) current_sblock
->next_free
)
1906 < (needed
+ GC_STRING_EXTRA
)))
1908 /* Not enough room in the current sblock. */
1909 b
= (struct sblock
*) lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
1910 b
->next_free
= &b
->first_data
;
1911 b
->first_data
.string
= NULL
;
1915 current_sblock
->next
= b
;
1923 data
= b
->next_free
;
1924 b
->next_free
= (struct sdata
*) ((char *) data
+ needed
+ GC_STRING_EXTRA
);
1926 MALLOC_UNBLOCK_INPUT
;
1929 s
->data
= SDATA_DATA (data
);
1930 #ifdef GC_CHECK_STRING_BYTES
1931 SDATA_NBYTES (data
) = nbytes
;
1934 s
->size_byte
= nbytes
;
1935 s
->data
[nbytes
] = '\0';
1936 #ifdef GC_CHECK_STRING_OVERRUN
1937 memcpy ((char *) data
+ needed
, string_overrun_cookie
,
1938 GC_STRING_OVERRUN_COOKIE_SIZE
);
1941 /* If S had already data assigned, mark that as free by setting its
1942 string back-pointer to null, and recording the size of the data
1946 SDATA_NBYTES (old_data
) = old_nbytes
;
1947 old_data
->string
= NULL
;
1950 consing_since_gc
+= needed
;
1954 /* Sweep and compact strings. */
1957 sweep_strings (void)
1959 struct string_block
*b
, *next
;
1960 struct string_block
*live_blocks
= NULL
;
1962 string_free_list
= NULL
;
1963 total_strings
= total_free_strings
= 0;
1964 total_string_size
= 0;
1966 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
1967 for (b
= string_blocks
; b
; b
= next
)
1970 struct Lisp_String
*free_list_before
= string_free_list
;
1974 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
1976 struct Lisp_String
*s
= b
->strings
+ i
;
1980 /* String was not on free-list before. */
1981 if (STRING_MARKED_P (s
))
1983 /* String is live; unmark it and its intervals. */
1986 if (!NULL_INTERVAL_P (s
->intervals
))
1987 UNMARK_BALANCE_INTERVALS (s
->intervals
);
1990 total_string_size
+= STRING_BYTES (s
);
1994 /* String is dead. Put it on the free-list. */
1995 struct sdata
*data
= SDATA_OF_STRING (s
);
1997 /* Save the size of S in its sdata so that we know
1998 how large that is. Reset the sdata's string
1999 back-pointer so that we know it's free. */
2000 #ifdef GC_CHECK_STRING_BYTES
2001 if (GC_STRING_BYTES (s
) != SDATA_NBYTES (data
))
2004 data
->u
.nbytes
= GC_STRING_BYTES (s
);
2006 data
->string
= NULL
;
2008 /* Reset the strings's `data' member so that we
2012 /* Put the string on the free-list. */
2013 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2014 string_free_list
= s
;
2020 /* S was on the free-list before. Put it there again. */
2021 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2022 string_free_list
= s
;
2027 /* Free blocks that contain free Lisp_Strings only, except
2028 the first two of them. */
2029 if (nfree
== STRING_BLOCK_SIZE
2030 && total_free_strings
> STRING_BLOCK_SIZE
)
2034 string_free_list
= free_list_before
;
2038 total_free_strings
+= nfree
;
2039 b
->next
= live_blocks
;
2044 check_string_free_list ();
2046 string_blocks
= live_blocks
;
2047 free_large_strings ();
2048 compact_small_strings ();
2050 check_string_free_list ();
2054 /* Free dead large strings. */
2057 free_large_strings (void)
2059 struct sblock
*b
, *next
;
2060 struct sblock
*live_blocks
= NULL
;
2062 for (b
= large_sblocks
; b
; b
= next
)
2066 if (b
->first_data
.string
== NULL
)
2070 b
->next
= live_blocks
;
2075 large_sblocks
= live_blocks
;
2079 /* Compact data of small strings. Free sblocks that don't contain
2080 data of live strings after compaction. */
2083 compact_small_strings (void)
2085 struct sblock
*b
, *tb
, *next
;
2086 struct sdata
*from
, *to
, *end
, *tb_end
;
2087 struct sdata
*to_end
, *from_end
;
2089 /* TB is the sblock we copy to, TO is the sdata within TB we copy
2090 to, and TB_END is the end of TB. */
2092 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2093 to
= &tb
->first_data
;
2095 /* Step through the blocks from the oldest to the youngest. We
2096 expect that old blocks will stabilize over time, so that less
2097 copying will happen this way. */
2098 for (b
= oldest_sblock
; b
; b
= b
->next
)
2101 xassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
2103 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
2105 /* Compute the next FROM here because copying below may
2106 overwrite data we need to compute it. */
2109 #ifdef GC_CHECK_STRING_BYTES
2110 /* Check that the string size recorded in the string is the
2111 same as the one recorded in the sdata structure. */
2113 && GC_STRING_BYTES (from
->string
) != SDATA_NBYTES (from
))
2115 #endif /* GC_CHECK_STRING_BYTES */
2118 nbytes
= GC_STRING_BYTES (from
->string
);
2120 nbytes
= SDATA_NBYTES (from
);
2122 if (nbytes
> LARGE_STRING_BYTES
)
2125 nbytes
= SDATA_SIZE (nbytes
);
2126 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
2128 #ifdef GC_CHECK_STRING_OVERRUN
2129 if (memcmp (string_overrun_cookie
,
2130 (char *) from_end
- GC_STRING_OVERRUN_COOKIE_SIZE
,
2131 GC_STRING_OVERRUN_COOKIE_SIZE
))
2135 /* FROM->string non-null means it's alive. Copy its data. */
2138 /* If TB is full, proceed with the next sblock. */
2139 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2140 if (to_end
> tb_end
)
2144 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2145 to
= &tb
->first_data
;
2146 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2149 /* Copy, and update the string's `data' pointer. */
2152 xassert (tb
!= b
|| to
< from
);
2153 memmove (to
, from
, nbytes
+ GC_STRING_EXTRA
);
2154 to
->string
->data
= SDATA_DATA (to
);
2157 /* Advance past the sdata we copied to. */
2163 /* The rest of the sblocks following TB don't contain live data, so
2164 we can free them. */
2165 for (b
= tb
->next
; b
; b
= next
)
2173 current_sblock
= tb
;
2177 string_overflow (void)
2179 error ("Maximum string size exceeded");
2182 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
2183 doc
: /* Return a newly created string of length LENGTH, with INIT in each element.
2184 LENGTH must be an integer.
2185 INIT must be an integer that represents a character. */)
2186 (Lisp_Object length
, Lisp_Object init
)
2188 register Lisp_Object val
;
2189 register unsigned char *p
, *end
;
2193 CHECK_NATNUM (length
);
2194 CHECK_NUMBER (init
);
2197 if (ASCII_CHAR_P (c
))
2199 nbytes
= XINT (length
);
2200 val
= make_uninit_string (nbytes
);
2202 end
= p
+ SCHARS (val
);
2208 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
2209 int len
= CHAR_STRING (c
, str
);
2210 EMACS_INT string_len
= XINT (length
);
2212 if (string_len
> MOST_POSITIVE_FIXNUM
/ len
)
2214 nbytes
= len
* string_len
;
2215 val
= make_uninit_multibyte_string (string_len
, nbytes
);
2220 memcpy (p
, str
, len
);
2230 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
2231 doc
: /* Return a new bool-vector of length LENGTH, using INIT for each element.
2232 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
2233 (Lisp_Object length
, Lisp_Object init
)
2235 register Lisp_Object val
;
2236 struct Lisp_Bool_Vector
*p
;
2238 EMACS_INT length_in_chars
, length_in_elts
;
2241 CHECK_NATNUM (length
);
2243 bits_per_value
= sizeof (EMACS_INT
) * BOOL_VECTOR_BITS_PER_CHAR
;
2245 length_in_elts
= (XFASTINT (length
) + bits_per_value
- 1) / bits_per_value
;
2246 length_in_chars
= ((XFASTINT (length
) + BOOL_VECTOR_BITS_PER_CHAR
- 1)
2247 / BOOL_VECTOR_BITS_PER_CHAR
);
2249 /* We must allocate one more elements than LENGTH_IN_ELTS for the
2250 slot `size' of the struct Lisp_Bool_Vector. */
2251 val
= Fmake_vector (make_number (length_in_elts
+ 1), Qnil
);
2253 /* No Lisp_Object to trace in there. */
2254 XSETPVECTYPESIZE (XVECTOR (val
), PVEC_BOOL_VECTOR
, 0);
2256 p
= XBOOL_VECTOR (val
);
2257 p
->size
= XFASTINT (length
);
2259 real_init
= (NILP (init
) ? 0 : -1);
2260 for (i
= 0; i
< length_in_chars
; i
++)
2261 p
->data
[i
] = real_init
;
2263 /* Clear the extraneous bits in the last byte. */
2264 if (XINT (length
) != length_in_chars
* BOOL_VECTOR_BITS_PER_CHAR
)
2265 p
->data
[length_in_chars
- 1]
2266 &= (1 << (XINT (length
) % BOOL_VECTOR_BITS_PER_CHAR
)) - 1;
2272 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
2273 of characters from the contents. This string may be unibyte or
2274 multibyte, depending on the contents. */
2277 make_string (const char *contents
, EMACS_INT nbytes
)
2279 register Lisp_Object val
;
2280 EMACS_INT nchars
, multibyte_nbytes
;
2282 parse_str_as_multibyte ((const unsigned char *) contents
, nbytes
,
2283 &nchars
, &multibyte_nbytes
);
2284 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
2285 /* CONTENTS contains no multibyte sequences or contains an invalid
2286 multibyte sequence. We must make unibyte string. */
2287 val
= make_unibyte_string (contents
, nbytes
);
2289 val
= make_multibyte_string (contents
, nchars
, nbytes
);
2294 /* Make an unibyte string from LENGTH bytes at CONTENTS. */
2297 make_unibyte_string (const char *contents
, EMACS_INT length
)
2299 register Lisp_Object val
;
2300 val
= make_uninit_string (length
);
2301 memcpy (SDATA (val
), contents
, length
);
2306 /* Make a multibyte string from NCHARS characters occupying NBYTES
2307 bytes at CONTENTS. */
2310 make_multibyte_string (const char *contents
,
2311 EMACS_INT nchars
, EMACS_INT nbytes
)
2313 register Lisp_Object val
;
2314 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2315 memcpy (SDATA (val
), contents
, nbytes
);
2320 /* Make a string from NCHARS characters occupying NBYTES bytes at
2321 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2324 make_string_from_bytes (const char *contents
,
2325 EMACS_INT nchars
, EMACS_INT nbytes
)
2327 register Lisp_Object val
;
2328 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2329 memcpy (SDATA (val
), contents
, nbytes
);
2330 if (SBYTES (val
) == SCHARS (val
))
2331 STRING_SET_UNIBYTE (val
);
2336 /* Make a string from NCHARS characters occupying NBYTES bytes at
2337 CONTENTS. The argument MULTIBYTE controls whether to label the
2338 string as multibyte. If NCHARS is negative, it counts the number of
2339 characters by itself. */
2342 make_specified_string (const char *contents
,
2343 EMACS_INT nchars
, EMACS_INT nbytes
, int multibyte
)
2345 register Lisp_Object val
;
2350 nchars
= multibyte_chars_in_text ((const unsigned char *) contents
,
2355 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2356 memcpy (SDATA (val
), contents
, nbytes
);
2358 STRING_SET_UNIBYTE (val
);
2363 /* Make a string from the data at STR, treating it as multibyte if the
2367 build_string (const char *str
)
2369 return make_string (str
, strlen (str
));
2373 /* Return an unibyte Lisp_String set up to hold LENGTH characters
2374 occupying LENGTH bytes. */
2377 make_uninit_string (EMACS_INT length
)
2382 return empty_unibyte_string
;
2383 val
= make_uninit_multibyte_string (length
, length
);
2384 STRING_SET_UNIBYTE (val
);
2389 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2390 which occupy NBYTES bytes. */
2393 make_uninit_multibyte_string (EMACS_INT nchars
, EMACS_INT nbytes
)
2396 struct Lisp_String
*s
;
2401 return empty_multibyte_string
;
2403 s
= allocate_string ();
2404 allocate_string_data (s
, nchars
, nbytes
);
2405 XSETSTRING (string
, s
);
2406 string_chars_consed
+= nbytes
;
2412 /***********************************************************************
2414 ***********************************************************************/
2416 /* We store float cells inside of float_blocks, allocating a new
2417 float_block with malloc whenever necessary. Float cells reclaimed
2418 by GC are put on a free list to be reallocated before allocating
2419 any new float cells from the latest float_block. */
2421 #define FLOAT_BLOCK_SIZE \
2422 (((BLOCK_BYTES - sizeof (struct float_block *) \
2423 /* The compiler might add padding at the end. */ \
2424 - (sizeof (struct Lisp_Float) - sizeof (int))) * CHAR_BIT) \
2425 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2427 #define GETMARKBIT(block,n) \
2428 (((block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2429 >> ((n) % (sizeof(int) * CHAR_BIT))) \
2432 #define SETMARKBIT(block,n) \
2433 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2434 |= 1 << ((n) % (sizeof(int) * CHAR_BIT))
2436 #define UNSETMARKBIT(block,n) \
2437 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2438 &= ~(1 << ((n) % (sizeof(int) * CHAR_BIT)))
2440 #define FLOAT_BLOCK(fptr) \
2441 ((struct float_block *) (((uintptr_t) (fptr)) & ~(BLOCK_ALIGN - 1)))
2443 #define FLOAT_INDEX(fptr) \
2444 ((((uintptr_t) (fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2448 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2449 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2450 int gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2451 struct float_block
*next
;
2454 #define FLOAT_MARKED_P(fptr) \
2455 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2457 #define FLOAT_MARK(fptr) \
2458 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2460 #define FLOAT_UNMARK(fptr) \
2461 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2463 /* Current float_block. */
2465 static struct float_block
*float_block
;
2467 /* Index of first unused Lisp_Float in the current float_block. */
2469 static int float_block_index
;
2471 /* Total number of float blocks now in use. */
2473 static int n_float_blocks
;
2475 /* Free-list of Lisp_Floats. */
2477 static struct Lisp_Float
*float_free_list
;
2480 /* Initialize float allocation. */
2486 float_block_index
= FLOAT_BLOCK_SIZE
; /* Force alloc of new float_block. */
2487 float_free_list
= 0;
2492 /* Return a new float object with value FLOAT_VALUE. */
2495 make_float (double float_value
)
2497 register Lisp_Object val
;
2499 /* eassert (!handling_signal); */
2503 if (float_free_list
)
2505 /* We use the data field for chaining the free list
2506 so that we won't use the same field that has the mark bit. */
2507 XSETFLOAT (val
, float_free_list
);
2508 float_free_list
= float_free_list
->u
.chain
;
2512 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2514 register struct float_block
*new;
2516 new = (struct float_block
*) lisp_align_malloc (sizeof *new,
2518 new->next
= float_block
;
2519 memset (new->gcmarkbits
, 0, sizeof new->gcmarkbits
);
2521 float_block_index
= 0;
2524 XSETFLOAT (val
, &float_block
->floats
[float_block_index
]);
2525 float_block_index
++;
2528 MALLOC_UNBLOCK_INPUT
;
2530 XFLOAT_INIT (val
, float_value
);
2531 eassert (!FLOAT_MARKED_P (XFLOAT (val
)));
2532 consing_since_gc
+= sizeof (struct Lisp_Float
);
2539 /***********************************************************************
2541 ***********************************************************************/
2543 /* We store cons cells inside of cons_blocks, allocating a new
2544 cons_block with malloc whenever necessary. Cons cells reclaimed by
2545 GC are put on a free list to be reallocated before allocating
2546 any new cons cells from the latest cons_block. */
2548 #define CONS_BLOCK_SIZE \
2549 (((BLOCK_BYTES - sizeof (struct cons_block *)) * CHAR_BIT) \
2550 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2552 #define CONS_BLOCK(fptr) \
2553 ((struct cons_block *) ((uintptr_t) (fptr) & ~(BLOCK_ALIGN - 1)))
2555 #define CONS_INDEX(fptr) \
2556 (((uintptr_t) (fptr) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2560 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2561 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2562 int gcmarkbits
[1 + CONS_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2563 struct cons_block
*next
;
2566 #define CONS_MARKED_P(fptr) \
2567 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2569 #define CONS_MARK(fptr) \
2570 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2572 #define CONS_UNMARK(fptr) \
2573 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2575 /* Current cons_block. */
2577 static struct cons_block
*cons_block
;
2579 /* Index of first unused Lisp_Cons in the current block. */
2581 static int cons_block_index
;
2583 /* Free-list of Lisp_Cons structures. */
2585 static struct Lisp_Cons
*cons_free_list
;
2587 /* Total number of cons blocks now in use. */
2589 static int n_cons_blocks
;
2592 /* Initialize cons allocation. */
2598 cons_block_index
= CONS_BLOCK_SIZE
; /* Force alloc of new cons_block. */
2604 /* Explicitly free a cons cell by putting it on the free-list. */
2607 free_cons (struct Lisp_Cons
*ptr
)
2609 ptr
->u
.chain
= cons_free_list
;
2613 cons_free_list
= ptr
;
2616 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
2617 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2618 (Lisp_Object car
, Lisp_Object cdr
)
2620 register Lisp_Object val
;
2622 /* eassert (!handling_signal); */
2628 /* We use the cdr for chaining the free list
2629 so that we won't use the same field that has the mark bit. */
2630 XSETCONS (val
, cons_free_list
);
2631 cons_free_list
= cons_free_list
->u
.chain
;
2635 if (cons_block_index
== CONS_BLOCK_SIZE
)
2637 register struct cons_block
*new;
2638 new = (struct cons_block
*) lisp_align_malloc (sizeof *new,
2640 memset (new->gcmarkbits
, 0, sizeof new->gcmarkbits
);
2641 new->next
= cons_block
;
2643 cons_block_index
= 0;
2646 XSETCONS (val
, &cons_block
->conses
[cons_block_index
]);
2650 MALLOC_UNBLOCK_INPUT
;
2654 eassert (!CONS_MARKED_P (XCONS (val
)));
2655 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2656 cons_cells_consed
++;
2660 #ifdef GC_CHECK_CONS_LIST
2661 /* Get an error now if there's any junk in the cons free list. */
2663 check_cons_list (void)
2665 struct Lisp_Cons
*tail
= cons_free_list
;
2668 tail
= tail
->u
.chain
;
2672 /* Make a list of 1, 2, 3, 4 or 5 specified objects. */
2675 list1 (Lisp_Object arg1
)
2677 return Fcons (arg1
, Qnil
);
2681 list2 (Lisp_Object arg1
, Lisp_Object arg2
)
2683 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2688 list3 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
)
2690 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2695 list4 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
, Lisp_Object arg4
)
2697 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2702 list5 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
, Lisp_Object arg4
, Lisp_Object arg5
)
2704 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2705 Fcons (arg5
, Qnil
)))));
2709 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
2710 doc
: /* Return a newly created list with specified arguments as elements.
2711 Any number of arguments, even zero arguments, are allowed.
2712 usage: (list &rest OBJECTS) */)
2713 (size_t nargs
, register Lisp_Object
*args
)
2715 register Lisp_Object val
;
2721 val
= Fcons (args
[nargs
], val
);
2727 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2728 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2729 (register Lisp_Object length
, Lisp_Object init
)
2731 register Lisp_Object val
;
2732 register EMACS_INT size
;
2734 CHECK_NATNUM (length
);
2735 size
= XFASTINT (length
);
2740 val
= Fcons (init
, val
);
2745 val
= Fcons (init
, val
);
2750 val
= Fcons (init
, val
);
2755 val
= Fcons (init
, val
);
2760 val
= Fcons (init
, val
);
2775 /***********************************************************************
2777 ***********************************************************************/
2779 /* Singly-linked list of all vectors. */
2781 static struct Lisp_Vector
*all_vectors
;
2783 /* Total number of vector-like objects now in use. */
2785 static int n_vectors
;
2788 /* Value is a pointer to a newly allocated Lisp_Vector structure
2789 with room for LEN Lisp_Objects. */
2791 static struct Lisp_Vector
*
2792 allocate_vectorlike (EMACS_INT len
)
2794 struct Lisp_Vector
*p
;
2799 #ifdef DOUG_LEA_MALLOC
2800 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
2801 because mapped region contents are not preserved in
2803 mallopt (M_MMAP_MAX
, 0);
2806 /* This gets triggered by code which I haven't bothered to fix. --Stef */
2807 /* eassert (!handling_signal); */
2809 nbytes
= (offsetof (struct Lisp_Vector
, contents
)
2810 + len
* sizeof p
->contents
[0]);
2811 p
= (struct Lisp_Vector
*) lisp_malloc (nbytes
, MEM_TYPE_VECTORLIKE
);
2813 #ifdef DOUG_LEA_MALLOC
2814 /* Back to a reasonable maximum of mmap'ed areas. */
2815 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2818 consing_since_gc
+= nbytes
;
2819 vector_cells_consed
+= len
;
2821 p
->header
.next
.vector
= all_vectors
;
2824 MALLOC_UNBLOCK_INPUT
;
2831 /* Allocate a vector with NSLOTS slots. */
2833 struct Lisp_Vector
*
2834 allocate_vector (EMACS_INT nslots
)
2836 struct Lisp_Vector
*v
= allocate_vectorlike (nslots
);
2837 v
->header
.size
= nslots
;
2842 /* Allocate other vector-like structures. */
2844 struct Lisp_Vector
*
2845 allocate_pseudovector (int memlen
, int lisplen
, EMACS_INT tag
)
2847 struct Lisp_Vector
*v
= allocate_vectorlike (memlen
);
2850 /* Only the first lisplen slots will be traced normally by the GC. */
2851 for (i
= 0; i
< lisplen
; ++i
)
2852 v
->contents
[i
] = Qnil
;
2854 XSETPVECTYPESIZE (v
, tag
, lisplen
);
2858 struct Lisp_Hash_Table
*
2859 allocate_hash_table (void)
2861 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Hash_Table
, count
, PVEC_HASH_TABLE
);
2866 allocate_window (void)
2868 return ALLOCATE_PSEUDOVECTOR(struct window
, current_matrix
, PVEC_WINDOW
);
2873 allocate_terminal (void)
2875 struct terminal
*t
= ALLOCATE_PSEUDOVECTOR (struct terminal
,
2876 next_terminal
, PVEC_TERMINAL
);
2877 /* Zero out the non-GC'd fields. FIXME: This should be made unnecessary. */
2878 memset (&t
->next_terminal
, 0,
2879 (char*) (t
+ 1) - (char*) &t
->next_terminal
);
2885 allocate_frame (void)
2887 struct frame
*f
= ALLOCATE_PSEUDOVECTOR (struct frame
,
2888 face_cache
, PVEC_FRAME
);
2889 /* Zero out the non-GC'd fields. FIXME: This should be made unnecessary. */
2890 memset (&f
->face_cache
, 0,
2891 (char *) (f
+ 1) - (char *) &f
->face_cache
);
2896 struct Lisp_Process
*
2897 allocate_process (void)
2899 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Process
, pid
, PVEC_PROCESS
);
2903 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
2904 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
2905 See also the function `vector'. */)
2906 (register Lisp_Object length
, Lisp_Object init
)
2909 register EMACS_INT sizei
;
2910 register EMACS_INT i
;
2911 register struct Lisp_Vector
*p
;
2913 CHECK_NATNUM (length
);
2914 sizei
= XFASTINT (length
);
2916 p
= allocate_vector (sizei
);
2917 for (i
= 0; i
< sizei
; i
++)
2918 p
->contents
[i
] = init
;
2920 XSETVECTOR (vector
, p
);
2925 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
2926 doc
: /* Return a newly created vector with specified arguments as elements.
2927 Any number of arguments, even zero arguments, are allowed.
2928 usage: (vector &rest OBJECTS) */)
2929 (register size_t nargs
, Lisp_Object
*args
)
2931 register Lisp_Object len
, val
;
2933 register struct Lisp_Vector
*p
;
2935 XSETFASTINT (len
, nargs
);
2936 val
= Fmake_vector (len
, Qnil
);
2938 for (i
= 0; i
< nargs
; i
++)
2939 p
->contents
[i
] = args
[i
];
2944 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
2945 doc
: /* Create a byte-code object with specified arguments as elements.
2946 The arguments should be the ARGLIST, bytecode-string BYTE-CODE, constant
2947 vector CONSTANTS, maximum stack size DEPTH, (optional) DOCSTRING,
2948 and (optional) INTERACTIVE-SPEC.
2949 The first four arguments are required; at most six have any
2951 The ARGLIST can be either like the one of `lambda', in which case the arguments
2952 will be dynamically bound before executing the byte code, or it can be an
2953 integer of the form NNNNNNNRMMMMMMM where the 7bit MMMMMMM specifies the
2954 minimum number of arguments, the 7-bit NNNNNNN specifies the maximum number
2955 of arguments (ignoring &rest) and the R bit specifies whether there is a &rest
2956 argument to catch the left-over arguments. If such an integer is used, the
2957 arguments will not be dynamically bound but will be instead pushed on the
2958 stack before executing the byte-code.
2959 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
2960 (register size_t nargs
, Lisp_Object
*args
)
2962 register Lisp_Object len
, val
;
2964 register struct Lisp_Vector
*p
;
2966 XSETFASTINT (len
, nargs
);
2967 if (!NILP (Vpurify_flag
))
2968 val
= make_pure_vector ((EMACS_INT
) nargs
);
2970 val
= Fmake_vector (len
, Qnil
);
2972 if (nargs
> 1 && STRINGP (args
[1]) && STRING_MULTIBYTE (args
[1]))
2973 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
2974 earlier because they produced a raw 8-bit string for byte-code
2975 and now such a byte-code string is loaded as multibyte while
2976 raw 8-bit characters converted to multibyte form. Thus, now we
2977 must convert them back to the original unibyte form. */
2978 args
[1] = Fstring_as_unibyte (args
[1]);
2981 for (i
= 0; i
< nargs
; i
++)
2983 if (!NILP (Vpurify_flag
))
2984 args
[i
] = Fpurecopy (args
[i
]);
2985 p
->contents
[i
] = args
[i
];
2987 XSETPVECTYPE (p
, PVEC_COMPILED
);
2988 XSETCOMPILED (val
, p
);
2994 /***********************************************************************
2996 ***********************************************************************/
2998 /* Each symbol_block is just under 1020 bytes long, since malloc
2999 really allocates in units of powers of two and uses 4 bytes for its
3002 #define SYMBOL_BLOCK_SIZE \
3003 ((1020 - sizeof (struct symbol_block *)) / sizeof (struct Lisp_Symbol))
3007 /* Place `symbols' first, to preserve alignment. */
3008 struct Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
3009 struct symbol_block
*next
;
3012 /* Current symbol block and index of first unused Lisp_Symbol
3015 static struct symbol_block
*symbol_block
;
3016 static int symbol_block_index
;
3018 /* List of free symbols. */
3020 static struct Lisp_Symbol
*symbol_free_list
;
3022 /* Total number of symbol blocks now in use. */
3024 static int n_symbol_blocks
;
3027 /* Initialize symbol allocation. */
3032 symbol_block
= NULL
;
3033 symbol_block_index
= SYMBOL_BLOCK_SIZE
;
3034 symbol_free_list
= 0;
3035 n_symbol_blocks
= 0;
3039 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
3040 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
3041 Its value and function definition are void, and its property list is nil. */)
3044 register Lisp_Object val
;
3045 register struct Lisp_Symbol
*p
;
3047 CHECK_STRING (name
);
3049 /* eassert (!handling_signal); */
3053 if (symbol_free_list
)
3055 XSETSYMBOL (val
, symbol_free_list
);
3056 symbol_free_list
= symbol_free_list
->next
;
3060 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
3062 struct symbol_block
*new;
3063 new = (struct symbol_block
*) lisp_malloc (sizeof *new,
3065 new->next
= symbol_block
;
3067 symbol_block_index
= 0;
3070 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
]);
3071 symbol_block_index
++;
3074 MALLOC_UNBLOCK_INPUT
;
3079 p
->redirect
= SYMBOL_PLAINVAL
;
3080 SET_SYMBOL_VAL (p
, Qunbound
);
3081 p
->function
= Qunbound
;
3084 p
->interned
= SYMBOL_UNINTERNED
;
3086 p
->declared_special
= 0;
3087 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
3094 /***********************************************************************
3095 Marker (Misc) Allocation
3096 ***********************************************************************/
3098 /* Allocation of markers and other objects that share that structure.
3099 Works like allocation of conses. */
3101 #define MARKER_BLOCK_SIZE \
3102 ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc))
3106 /* Place `markers' first, to preserve alignment. */
3107 union Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
3108 struct marker_block
*next
;
3111 static struct marker_block
*marker_block
;
3112 static int marker_block_index
;
3114 static union Lisp_Misc
*marker_free_list
;
3116 /* Total number of marker blocks now in use. */
3118 static int n_marker_blocks
;
3123 marker_block
= NULL
;
3124 marker_block_index
= MARKER_BLOCK_SIZE
;
3125 marker_free_list
= 0;
3126 n_marker_blocks
= 0;
3129 /* Return a newly allocated Lisp_Misc object, with no substructure. */
3132 allocate_misc (void)
3136 /* eassert (!handling_signal); */
3140 if (marker_free_list
)
3142 XSETMISC (val
, marker_free_list
);
3143 marker_free_list
= marker_free_list
->u_free
.chain
;
3147 if (marker_block_index
== MARKER_BLOCK_SIZE
)
3149 struct marker_block
*new;
3150 new = (struct marker_block
*) lisp_malloc (sizeof *new,
3152 new->next
= marker_block
;
3154 marker_block_index
= 0;
3156 total_free_markers
+= MARKER_BLOCK_SIZE
;
3158 XSETMISC (val
, &marker_block
->markers
[marker_block_index
]);
3159 marker_block_index
++;
3162 MALLOC_UNBLOCK_INPUT
;
3164 --total_free_markers
;
3165 consing_since_gc
+= sizeof (union Lisp_Misc
);
3166 misc_objects_consed
++;
3167 XMISCANY (val
)->gcmarkbit
= 0;
3171 /* Free a Lisp_Misc object */
3174 free_misc (Lisp_Object misc
)
3176 XMISCTYPE (misc
) = Lisp_Misc_Free
;
3177 XMISC (misc
)->u_free
.chain
= marker_free_list
;
3178 marker_free_list
= XMISC (misc
);
3180 total_free_markers
++;
3183 /* Return a Lisp_Misc_Save_Value object containing POINTER and
3184 INTEGER. This is used to package C values to call record_unwind_protect.
3185 The unwind function can get the C values back using XSAVE_VALUE. */
3188 make_save_value (void *pointer
, int integer
)
3190 register Lisp_Object val
;
3191 register struct Lisp_Save_Value
*p
;
3193 val
= allocate_misc ();
3194 XMISCTYPE (val
) = Lisp_Misc_Save_Value
;
3195 p
= XSAVE_VALUE (val
);
3196 p
->pointer
= pointer
;
3197 p
->integer
= integer
;
3202 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
3203 doc
: /* Return a newly allocated marker which does not point at any place. */)
3206 register Lisp_Object val
;
3207 register struct Lisp_Marker
*p
;
3209 val
= allocate_misc ();
3210 XMISCTYPE (val
) = Lisp_Misc_Marker
;
3216 p
->insertion_type
= 0;
3220 /* Put MARKER back on the free list after using it temporarily. */
3223 free_marker (Lisp_Object marker
)
3225 unchain_marker (XMARKER (marker
));
3230 /* Return a newly created vector or string with specified arguments as
3231 elements. If all the arguments are characters that can fit
3232 in a string of events, make a string; otherwise, make a vector.
3234 Any number of arguments, even zero arguments, are allowed. */
3237 make_event_array (register int nargs
, Lisp_Object
*args
)
3241 for (i
= 0; i
< nargs
; i
++)
3242 /* The things that fit in a string
3243 are characters that are in 0...127,
3244 after discarding the meta bit and all the bits above it. */
3245 if (!INTEGERP (args
[i
])
3246 || (XINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
3247 return Fvector (nargs
, args
);
3249 /* Since the loop exited, we know that all the things in it are
3250 characters, so we can make a string. */
3254 result
= Fmake_string (make_number (nargs
), make_number (0));
3255 for (i
= 0; i
< nargs
; i
++)
3257 SSET (result
, i
, XINT (args
[i
]));
3258 /* Move the meta bit to the right place for a string char. */
3259 if (XINT (args
[i
]) & CHAR_META
)
3260 SSET (result
, i
, SREF (result
, i
) | 0x80);
3269 /************************************************************************
3270 Memory Full Handling
3271 ************************************************************************/
3274 /* Called if malloc (NBYTES) returns zero. If NBYTES == SIZE_MAX,
3275 there may have been size_t overflow so that malloc was never
3276 called, or perhaps malloc was invoked successfully but the
3277 resulting pointer had problems fitting into a tagged EMACS_INT. In
3278 either case this counts as memory being full even though malloc did
3282 memory_full (size_t nbytes
)
3284 /* Do not go into hysterics merely because a large request failed. */
3285 int enough_free_memory
= 0;
3286 if (SPARE_MEMORY
< nbytes
)
3288 void *p
= malloc (SPARE_MEMORY
);
3291 if (spare_memory
[0])
3294 spare_memory
[0] = p
;
3295 enough_free_memory
= 1;
3299 if (! enough_free_memory
)
3305 memory_full_cons_threshold
= sizeof (struct cons_block
);
3307 /* The first time we get here, free the spare memory. */
3308 for (i
= 0; i
< sizeof (spare_memory
) / sizeof (char *); i
++)
3309 if (spare_memory
[i
])
3312 free (spare_memory
[i
]);
3313 else if (i
>= 1 && i
<= 4)
3314 lisp_align_free (spare_memory
[i
]);
3316 lisp_free (spare_memory
[i
]);
3317 spare_memory
[i
] = 0;
3320 /* Record the space now used. When it decreases substantially,
3321 we can refill the memory reserve. */
3322 #if !defined SYSTEM_MALLOC && !defined SYNC_INPUT
3323 bytes_used_when_full
= BYTES_USED
;
3327 /* This used to call error, but if we've run out of memory, we could
3328 get infinite recursion trying to build the string. */
3329 xsignal (Qnil
, Vmemory_signal_data
);
3332 /* If we released our reserve (due to running out of memory),
3333 and we have a fair amount free once again,
3334 try to set aside another reserve in case we run out once more.
3336 This is called when a relocatable block is freed in ralloc.c,
3337 and also directly from this file, in case we're not using ralloc.c. */
3340 refill_memory_reserve (void)
3342 #ifndef SYSTEM_MALLOC
3343 if (spare_memory
[0] == 0)
3344 spare_memory
[0] = (char *) malloc ((size_t) SPARE_MEMORY
);
3345 if (spare_memory
[1] == 0)
3346 spare_memory
[1] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3348 if (spare_memory
[2] == 0)
3349 spare_memory
[2] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3351 if (spare_memory
[3] == 0)
3352 spare_memory
[3] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3354 if (spare_memory
[4] == 0)
3355 spare_memory
[4] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3357 if (spare_memory
[5] == 0)
3358 spare_memory
[5] = (char *) lisp_malloc (sizeof (struct string_block
),
3360 if (spare_memory
[6] == 0)
3361 spare_memory
[6] = (char *) lisp_malloc (sizeof (struct string_block
),
3363 if (spare_memory
[0] && spare_memory
[1] && spare_memory
[5])
3364 Vmemory_full
= Qnil
;
3368 /************************************************************************
3370 ************************************************************************/
3372 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
3374 /* Conservative C stack marking requires a method to identify possibly
3375 live Lisp objects given a pointer value. We do this by keeping
3376 track of blocks of Lisp data that are allocated in a red-black tree
3377 (see also the comment of mem_node which is the type of nodes in
3378 that tree). Function lisp_malloc adds information for an allocated
3379 block to the red-black tree with calls to mem_insert, and function
3380 lisp_free removes it with mem_delete. Functions live_string_p etc
3381 call mem_find to lookup information about a given pointer in the
3382 tree, and use that to determine if the pointer points to a Lisp
3385 /* Initialize this part of alloc.c. */
3390 mem_z
.left
= mem_z
.right
= MEM_NIL
;
3391 mem_z
.parent
= NULL
;
3392 mem_z
.color
= MEM_BLACK
;
3393 mem_z
.start
= mem_z
.end
= NULL
;
3398 /* Value is a pointer to the mem_node containing START. Value is
3399 MEM_NIL if there is no node in the tree containing START. */
3401 static INLINE
struct mem_node
*
3402 mem_find (void *start
)
3406 if (start
< min_heap_address
|| start
> max_heap_address
)
3409 /* Make the search always successful to speed up the loop below. */
3410 mem_z
.start
= start
;
3411 mem_z
.end
= (char *) start
+ 1;
3414 while (start
< p
->start
|| start
>= p
->end
)
3415 p
= start
< p
->start
? p
->left
: p
->right
;
3420 /* Insert a new node into the tree for a block of memory with start
3421 address START, end address END, and type TYPE. Value is a
3422 pointer to the node that was inserted. */
3424 static struct mem_node
*
3425 mem_insert (void *start
, void *end
, enum mem_type type
)
3427 struct mem_node
*c
, *parent
, *x
;
3429 if (min_heap_address
== NULL
|| start
< min_heap_address
)
3430 min_heap_address
= start
;
3431 if (max_heap_address
== NULL
|| end
> max_heap_address
)
3432 max_heap_address
= end
;
3434 /* See where in the tree a node for START belongs. In this
3435 particular application, it shouldn't happen that a node is already
3436 present. For debugging purposes, let's check that. */
3440 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3442 while (c
!= MEM_NIL
)
3444 if (start
>= c
->start
&& start
< c
->end
)
3447 c
= start
< c
->start
? c
->left
: c
->right
;
3450 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3452 while (c
!= MEM_NIL
)
3455 c
= start
< c
->start
? c
->left
: c
->right
;
3458 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3460 /* Create a new node. */
3461 #ifdef GC_MALLOC_CHECK
3462 x
= (struct mem_node
*) _malloc_internal (sizeof *x
);
3466 x
= (struct mem_node
*) xmalloc (sizeof *x
);
3472 x
->left
= x
->right
= MEM_NIL
;
3475 /* Insert it as child of PARENT or install it as root. */
3478 if (start
< parent
->start
)
3486 /* Re-establish red-black tree properties. */
3487 mem_insert_fixup (x
);
3493 /* Re-establish the red-black properties of the tree, and thereby
3494 balance the tree, after node X has been inserted; X is always red. */
3497 mem_insert_fixup (struct mem_node
*x
)
3499 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3501 /* X is red and its parent is red. This is a violation of
3502 red-black tree property #3. */
3504 if (x
->parent
== x
->parent
->parent
->left
)
3506 /* We're on the left side of our grandparent, and Y is our
3508 struct mem_node
*y
= x
->parent
->parent
->right
;
3510 if (y
->color
== MEM_RED
)
3512 /* Uncle and parent are red but should be black because
3513 X is red. Change the colors accordingly and proceed
3514 with the grandparent. */
3515 x
->parent
->color
= MEM_BLACK
;
3516 y
->color
= MEM_BLACK
;
3517 x
->parent
->parent
->color
= MEM_RED
;
3518 x
= x
->parent
->parent
;
3522 /* Parent and uncle have different colors; parent is
3523 red, uncle is black. */
3524 if (x
== x
->parent
->right
)
3527 mem_rotate_left (x
);
3530 x
->parent
->color
= MEM_BLACK
;
3531 x
->parent
->parent
->color
= MEM_RED
;
3532 mem_rotate_right (x
->parent
->parent
);
3537 /* This is the symmetrical case of above. */
3538 struct mem_node
*y
= x
->parent
->parent
->left
;
3540 if (y
->color
== MEM_RED
)
3542 x
->parent
->color
= MEM_BLACK
;
3543 y
->color
= MEM_BLACK
;
3544 x
->parent
->parent
->color
= MEM_RED
;
3545 x
= x
->parent
->parent
;
3549 if (x
== x
->parent
->left
)
3552 mem_rotate_right (x
);
3555 x
->parent
->color
= MEM_BLACK
;
3556 x
->parent
->parent
->color
= MEM_RED
;
3557 mem_rotate_left (x
->parent
->parent
);
3562 /* The root may have been changed to red due to the algorithm. Set
3563 it to black so that property #5 is satisfied. */
3564 mem_root
->color
= MEM_BLACK
;
3575 mem_rotate_left (struct mem_node
*x
)
3579 /* Turn y's left sub-tree into x's right sub-tree. */
3582 if (y
->left
!= MEM_NIL
)
3583 y
->left
->parent
= x
;
3585 /* Y's parent was x's parent. */
3587 y
->parent
= x
->parent
;
3589 /* Get the parent to point to y instead of x. */
3592 if (x
== x
->parent
->left
)
3593 x
->parent
->left
= y
;
3595 x
->parent
->right
= y
;
3600 /* Put x on y's left. */
3614 mem_rotate_right (struct mem_node
*x
)
3616 struct mem_node
*y
= x
->left
;
3619 if (y
->right
!= MEM_NIL
)
3620 y
->right
->parent
= x
;
3623 y
->parent
= x
->parent
;
3626 if (x
== x
->parent
->right
)
3627 x
->parent
->right
= y
;
3629 x
->parent
->left
= y
;
3640 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
3643 mem_delete (struct mem_node
*z
)
3645 struct mem_node
*x
, *y
;
3647 if (!z
|| z
== MEM_NIL
)
3650 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
3655 while (y
->left
!= MEM_NIL
)
3659 if (y
->left
!= MEM_NIL
)
3664 x
->parent
= y
->parent
;
3667 if (y
== y
->parent
->left
)
3668 y
->parent
->left
= x
;
3670 y
->parent
->right
= x
;
3677 z
->start
= y
->start
;
3682 if (y
->color
== MEM_BLACK
)
3683 mem_delete_fixup (x
);
3685 #ifdef GC_MALLOC_CHECK
3693 /* Re-establish the red-black properties of the tree, after a
3697 mem_delete_fixup (struct mem_node
*x
)
3699 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
3701 if (x
== x
->parent
->left
)
3703 struct mem_node
*w
= x
->parent
->right
;
3705 if (w
->color
== MEM_RED
)
3707 w
->color
= MEM_BLACK
;
3708 x
->parent
->color
= MEM_RED
;
3709 mem_rotate_left (x
->parent
);
3710 w
= x
->parent
->right
;
3713 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
3720 if (w
->right
->color
== MEM_BLACK
)
3722 w
->left
->color
= MEM_BLACK
;
3724 mem_rotate_right (w
);
3725 w
= x
->parent
->right
;
3727 w
->color
= x
->parent
->color
;
3728 x
->parent
->color
= MEM_BLACK
;
3729 w
->right
->color
= MEM_BLACK
;
3730 mem_rotate_left (x
->parent
);
3736 struct mem_node
*w
= x
->parent
->left
;
3738 if (w
->color
== MEM_RED
)
3740 w
->color
= MEM_BLACK
;
3741 x
->parent
->color
= MEM_RED
;
3742 mem_rotate_right (x
->parent
);
3743 w
= x
->parent
->left
;
3746 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
3753 if (w
->left
->color
== MEM_BLACK
)
3755 w
->right
->color
= MEM_BLACK
;
3757 mem_rotate_left (w
);
3758 w
= x
->parent
->left
;
3761 w
->color
= x
->parent
->color
;
3762 x
->parent
->color
= MEM_BLACK
;
3763 w
->left
->color
= MEM_BLACK
;
3764 mem_rotate_right (x
->parent
);
3770 x
->color
= MEM_BLACK
;
3774 /* Value is non-zero if P is a pointer to a live Lisp string on
3775 the heap. M is a pointer to the mem_block for P. */
3778 live_string_p (struct mem_node
*m
, void *p
)
3780 if (m
->type
== MEM_TYPE_STRING
)
3782 struct string_block
*b
= (struct string_block
*) m
->start
;
3783 ptrdiff_t offset
= (char *) p
- (char *) &b
->strings
[0];
3785 /* P must point to the start of a Lisp_String structure, and it
3786 must not be on the free-list. */
3788 && offset
% sizeof b
->strings
[0] == 0
3789 && offset
< (STRING_BLOCK_SIZE
* sizeof b
->strings
[0])
3790 && ((struct Lisp_String
*) p
)->data
!= NULL
);
3797 /* Value is non-zero if P is a pointer to a live Lisp cons on
3798 the heap. M is a pointer to the mem_block for P. */
3801 live_cons_p (struct mem_node
*m
, void *p
)
3803 if (m
->type
== MEM_TYPE_CONS
)
3805 struct cons_block
*b
= (struct cons_block
*) m
->start
;
3806 ptrdiff_t offset
= (char *) p
- (char *) &b
->conses
[0];
3808 /* P must point to the start of a Lisp_Cons, not be
3809 one of the unused cells in the current cons block,
3810 and not be on the free-list. */
3812 && offset
% sizeof b
->conses
[0] == 0
3813 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
3815 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
3816 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
3823 /* Value is non-zero if P is a pointer to a live Lisp symbol on
3824 the heap. M is a pointer to the mem_block for P. */
3827 live_symbol_p (struct mem_node
*m
, void *p
)
3829 if (m
->type
== MEM_TYPE_SYMBOL
)
3831 struct symbol_block
*b
= (struct symbol_block
*) m
->start
;
3832 ptrdiff_t offset
= (char *) p
- (char *) &b
->symbols
[0];
3834 /* P must point to the start of a Lisp_Symbol, not be
3835 one of the unused cells in the current symbol block,
3836 and not be on the free-list. */
3838 && offset
% sizeof b
->symbols
[0] == 0
3839 && offset
< (SYMBOL_BLOCK_SIZE
* sizeof b
->symbols
[0])
3840 && (b
!= symbol_block
3841 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
3842 && !EQ (((struct Lisp_Symbol
*) p
)->function
, Vdead
));
3849 /* Value is non-zero if P is a pointer to a live Lisp float on
3850 the heap. M is a pointer to the mem_block for P. */
3853 live_float_p (struct mem_node
*m
, void *p
)
3855 if (m
->type
== MEM_TYPE_FLOAT
)
3857 struct float_block
*b
= (struct float_block
*) m
->start
;
3858 ptrdiff_t offset
= (char *) p
- (char *) &b
->floats
[0];
3860 /* P must point to the start of a Lisp_Float and not be
3861 one of the unused cells in the current float block. */
3863 && offset
% sizeof b
->floats
[0] == 0
3864 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
3865 && (b
!= float_block
3866 || offset
/ sizeof b
->floats
[0] < float_block_index
));
3873 /* Value is non-zero if P is a pointer to a live Lisp Misc on
3874 the heap. M is a pointer to the mem_block for P. */
3877 live_misc_p (struct mem_node
*m
, void *p
)
3879 if (m
->type
== MEM_TYPE_MISC
)
3881 struct marker_block
*b
= (struct marker_block
*) m
->start
;
3882 ptrdiff_t offset
= (char *) p
- (char *) &b
->markers
[0];
3884 /* P must point to the start of a Lisp_Misc, not be
3885 one of the unused cells in the current misc block,
3886 and not be on the free-list. */
3888 && offset
% sizeof b
->markers
[0] == 0
3889 && offset
< (MARKER_BLOCK_SIZE
* sizeof b
->markers
[0])
3890 && (b
!= marker_block
3891 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
3892 && ((union Lisp_Misc
*) p
)->u_any
.type
!= Lisp_Misc_Free
);
3899 /* Value is non-zero if P is a pointer to a live vector-like object.
3900 M is a pointer to the mem_block for P. */
3903 live_vector_p (struct mem_node
*m
, void *p
)
3905 return (p
== m
->start
&& m
->type
== MEM_TYPE_VECTORLIKE
);
3909 /* Value is non-zero if P is a pointer to a live buffer. M is a
3910 pointer to the mem_block for P. */
3913 live_buffer_p (struct mem_node
*m
, void *p
)
3915 /* P must point to the start of the block, and the buffer
3916 must not have been killed. */
3917 return (m
->type
== MEM_TYPE_BUFFER
3919 && !NILP (((struct buffer
*) p
)->BUFFER_INTERNAL_FIELD (name
)));
3922 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
3926 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3928 /* Array of objects that are kept alive because the C stack contains
3929 a pattern that looks like a reference to them . */
3931 #define MAX_ZOMBIES 10
3932 static Lisp_Object zombies
[MAX_ZOMBIES
];
3934 /* Number of zombie objects. */
3936 static int nzombies
;
3938 /* Number of garbage collections. */
3942 /* Average percentage of zombies per collection. */
3944 static double avg_zombies
;
3946 /* Max. number of live and zombie objects. */
3948 static int max_live
, max_zombies
;
3950 /* Average number of live objects per GC. */
3952 static double avg_live
;
3954 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
3955 doc
: /* Show information about live and zombie objects. */)
3958 Lisp_Object args
[8], zombie_list
= Qnil
;
3960 for (i
= 0; i
< nzombies
; i
++)
3961 zombie_list
= Fcons (zombies
[i
], zombie_list
);
3962 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
3963 args
[1] = make_number (ngcs
);
3964 args
[2] = make_float (avg_live
);
3965 args
[3] = make_float (avg_zombies
);
3966 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
3967 args
[5] = make_number (max_live
);
3968 args
[6] = make_number (max_zombies
);
3969 args
[7] = zombie_list
;
3970 return Fmessage (8, args
);
3973 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
3976 /* Mark OBJ if we can prove it's a Lisp_Object. */
3979 mark_maybe_object (Lisp_Object obj
)
3987 po
= (void *) XPNTR (obj
);
3994 switch (XTYPE (obj
))
3997 mark_p
= (live_string_p (m
, po
)
3998 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
4002 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
4006 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
4010 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
4013 case Lisp_Vectorlike
:
4014 /* Note: can't check BUFFERP before we know it's a
4015 buffer because checking that dereferences the pointer
4016 PO which might point anywhere. */
4017 if (live_vector_p (m
, po
))
4018 mark_p
= !SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
4019 else if (live_buffer_p (m
, po
))
4020 mark_p
= BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
4024 mark_p
= (live_misc_p (m
, po
) && !XMISCANY (obj
)->gcmarkbit
);
4033 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4034 if (nzombies
< MAX_ZOMBIES
)
4035 zombies
[nzombies
] = obj
;
4044 /* If P points to Lisp data, mark that as live if it isn't already
4048 mark_maybe_pointer (void *p
)
4052 /* Quickly rule out some values which can't point to Lisp data. */
4055 8 /* USE_LSB_TAG needs Lisp data to be aligned on multiples of 8. */
4057 2 /* We assume that Lisp data is aligned on even addresses. */
4065 Lisp_Object obj
= Qnil
;
4069 case MEM_TYPE_NON_LISP
:
4070 /* Nothing to do; not a pointer to Lisp memory. */
4073 case MEM_TYPE_BUFFER
:
4074 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P((struct buffer
*)p
))
4075 XSETVECTOR (obj
, p
);
4079 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
4083 case MEM_TYPE_STRING
:
4084 if (live_string_p (m
, p
)
4085 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
4086 XSETSTRING (obj
, p
);
4090 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
4094 case MEM_TYPE_SYMBOL
:
4095 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
4096 XSETSYMBOL (obj
, p
);
4099 case MEM_TYPE_FLOAT
:
4100 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
4104 case MEM_TYPE_VECTORLIKE
:
4105 if (live_vector_p (m
, p
))
4108 XSETVECTOR (tem
, p
);
4109 if (!SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
4124 /* Mark Lisp objects referenced from the address range START+OFFSET..END
4125 or END+OFFSET..START. */
4128 mark_memory (void *start
, void *end
, int offset
)
4133 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4137 /* Make START the pointer to the start of the memory region,
4138 if it isn't already. */
4146 /* Mark Lisp_Objects. */
4147 for (p
= (Lisp_Object
*) ((char *) start
+ offset
); (void *) p
< end
; ++p
)
4148 mark_maybe_object (*p
);
4150 /* Mark Lisp data pointed to. This is necessary because, in some
4151 situations, the C compiler optimizes Lisp objects away, so that
4152 only a pointer to them remains. Example:
4154 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
4157 Lisp_Object obj = build_string ("test");
4158 struct Lisp_String *s = XSTRING (obj);
4159 Fgarbage_collect ();
4160 fprintf (stderr, "test `%s'\n", s->data);
4164 Here, `obj' isn't really used, and the compiler optimizes it
4165 away. The only reference to the life string is through the
4168 for (pp
= (void **) ((char *) start
+ offset
); (void *) pp
< end
; ++pp
)
4169 mark_maybe_pointer (*pp
);
4172 /* setjmp will work with GCC unless NON_SAVING_SETJMP is defined in
4173 the GCC system configuration. In gcc 3.2, the only systems for
4174 which this is so are i386-sco5 non-ELF, i386-sysv3 (maybe included
4175 by others?) and ns32k-pc532-min. */
4177 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
4179 static int setjmp_tested_p
, longjmps_done
;
4181 #define SETJMP_WILL_LIKELY_WORK "\
4183 Emacs garbage collector has been changed to use conservative stack\n\
4184 marking. Emacs has determined that the method it uses to do the\n\
4185 marking will likely work on your system, but this isn't sure.\n\
4187 If you are a system-programmer, or can get the help of a local wizard\n\
4188 who is, please take a look at the function mark_stack in alloc.c, and\n\
4189 verify that the methods used are appropriate for your system.\n\
4191 Please mail the result to <emacs-devel@gnu.org>.\n\
4194 #define SETJMP_WILL_NOT_WORK "\
4196 Emacs garbage collector has been changed to use conservative stack\n\
4197 marking. Emacs has determined that the default method it uses to do the\n\
4198 marking will not work on your system. We will need a system-dependent\n\
4199 solution for your system.\n\
4201 Please take a look at the function mark_stack in alloc.c, and\n\
4202 try to find a way to make it work on your system.\n\
4204 Note that you may get false negatives, depending on the compiler.\n\
4205 In particular, you need to use -O with GCC for this test.\n\
4207 Please mail the result to <emacs-devel@gnu.org>.\n\
4211 /* Perform a quick check if it looks like setjmp saves registers in a
4212 jmp_buf. Print a message to stderr saying so. When this test
4213 succeeds, this is _not_ a proof that setjmp is sufficient for
4214 conservative stack marking. Only the sources or a disassembly
4225 /* Arrange for X to be put in a register. */
4231 if (longjmps_done
== 1)
4233 /* Came here after the longjmp at the end of the function.
4235 If x == 1, the longjmp has restored the register to its
4236 value before the setjmp, and we can hope that setjmp
4237 saves all such registers in the jmp_buf, although that
4240 For other values of X, either something really strange is
4241 taking place, or the setjmp just didn't save the register. */
4244 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
4247 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
4254 if (longjmps_done
== 1)
4258 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
4261 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4263 /* Abort if anything GCPRO'd doesn't survive the GC. */
4271 for (p
= gcprolist
; p
; p
= p
->next
)
4272 for (i
= 0; i
< p
->nvars
; ++i
)
4273 if (!survives_gc_p (p
->var
[i
]))
4274 /* FIXME: It's not necessarily a bug. It might just be that the
4275 GCPRO is unnecessary or should release the object sooner. */
4279 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4286 fprintf (stderr
, "\nZombies kept alive = %d:\n", nzombies
);
4287 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
4289 fprintf (stderr
, " %d = ", i
);
4290 debug_print (zombies
[i
]);
4294 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4297 /* Mark live Lisp objects on the C stack.
4299 There are several system-dependent problems to consider when
4300 porting this to new architectures:
4304 We have to mark Lisp objects in CPU registers that can hold local
4305 variables or are used to pass parameters.
4307 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
4308 something that either saves relevant registers on the stack, or
4309 calls mark_maybe_object passing it each register's contents.
4311 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
4312 implementation assumes that calling setjmp saves registers we need
4313 to see in a jmp_buf which itself lies on the stack. This doesn't
4314 have to be true! It must be verified for each system, possibly
4315 by taking a look at the source code of setjmp.
4317 If __builtin_unwind_init is available (defined by GCC >= 2.8) we
4318 can use it as a machine independent method to store all registers
4319 to the stack. In this case the macros described in the previous
4320 two paragraphs are not used.
4324 Architectures differ in the way their processor stack is organized.
4325 For example, the stack might look like this
4328 | Lisp_Object | size = 4
4330 | something else | size = 2
4332 | Lisp_Object | size = 4
4336 In such a case, not every Lisp_Object will be aligned equally. To
4337 find all Lisp_Object on the stack it won't be sufficient to walk
4338 the stack in steps of 4 bytes. Instead, two passes will be
4339 necessary, one starting at the start of the stack, and a second
4340 pass starting at the start of the stack + 2. Likewise, if the
4341 minimal alignment of Lisp_Objects on the stack is 1, four passes
4342 would be necessary, each one starting with one byte more offset
4343 from the stack start.
4345 The current code assumes by default that Lisp_Objects are aligned
4346 equally on the stack. */
4354 #ifdef HAVE___BUILTIN_UNWIND_INIT
4355 /* Force callee-saved registers and register windows onto the stack.
4356 This is the preferred method if available, obviating the need for
4357 machine dependent methods. */
4358 __builtin_unwind_init ();
4360 #else /* not HAVE___BUILTIN_UNWIND_INIT */
4361 #ifndef GC_SAVE_REGISTERS_ON_STACK
4362 /* jmp_buf may not be aligned enough on darwin-ppc64 */
4363 union aligned_jmpbuf
{
4367 volatile int stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
4369 /* This trick flushes the register windows so that all the state of
4370 the process is contained in the stack. */
4371 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
4372 needed on ia64 too. See mach_dep.c, where it also says inline
4373 assembler doesn't work with relevant proprietary compilers. */
4375 #if defined (__sparc64__) && defined (__FreeBSD__)
4376 /* FreeBSD does not have a ta 3 handler. */
4383 /* Save registers that we need to see on the stack. We need to see
4384 registers used to hold register variables and registers used to
4386 #ifdef GC_SAVE_REGISTERS_ON_STACK
4387 GC_SAVE_REGISTERS_ON_STACK (end
);
4388 #else /* not GC_SAVE_REGISTERS_ON_STACK */
4390 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
4391 setjmp will definitely work, test it
4392 and print a message with the result
4394 if (!setjmp_tested_p
)
4396 setjmp_tested_p
= 1;
4399 #endif /* GC_SETJMP_WORKS */
4402 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
4403 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
4404 #endif /* not HAVE___BUILTIN_UNWIND_INIT */
4406 /* This assumes that the stack is a contiguous region in memory. If
4407 that's not the case, something has to be done here to iterate
4408 over the stack segments. */
4409 #ifndef GC_LISP_OBJECT_ALIGNMENT
4411 #define GC_LISP_OBJECT_ALIGNMENT __alignof__ (Lisp_Object)
4413 #define GC_LISP_OBJECT_ALIGNMENT sizeof (Lisp_Object)
4416 for (i
= 0; i
< sizeof (Lisp_Object
); i
+= GC_LISP_OBJECT_ALIGNMENT
)
4417 mark_memory (stack_base
, end
, i
);
4418 /* Allow for marking a secondary stack, like the register stack on the
4420 #ifdef GC_MARK_SECONDARY_STACK
4421 GC_MARK_SECONDARY_STACK ();
4424 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4429 #endif /* GC_MARK_STACK != 0 */
4432 /* Determine whether it is safe to access memory at address P. */
4434 valid_pointer_p (void *p
)
4437 return w32_valid_pointer_p (p
, 16);
4441 /* Obviously, we cannot just access it (we would SEGV trying), so we
4442 trick the o/s to tell us whether p is a valid pointer.
4443 Unfortunately, we cannot use NULL_DEVICE here, as emacs_write may
4444 not validate p in that case. */
4446 if ((fd
= emacs_open ("__Valid__Lisp__Object__", O_CREAT
| O_WRONLY
| O_TRUNC
, 0666)) >= 0)
4448 int valid
= (emacs_write (fd
, (char *)p
, 16) == 16);
4450 unlink ("__Valid__Lisp__Object__");
4458 /* Return 1 if OBJ is a valid lisp object.
4459 Return 0 if OBJ is NOT a valid lisp object.
4460 Return -1 if we cannot validate OBJ.
4461 This function can be quite slow,
4462 so it should only be used in code for manual debugging. */
4465 valid_lisp_object_p (Lisp_Object obj
)
4475 p
= (void *) XPNTR (obj
);
4476 if (PURE_POINTER_P (p
))
4480 return valid_pointer_p (p
);
4487 int valid
= valid_pointer_p (p
);
4499 case MEM_TYPE_NON_LISP
:
4502 case MEM_TYPE_BUFFER
:
4503 return live_buffer_p (m
, p
);
4506 return live_cons_p (m
, p
);
4508 case MEM_TYPE_STRING
:
4509 return live_string_p (m
, p
);
4512 return live_misc_p (m
, p
);
4514 case MEM_TYPE_SYMBOL
:
4515 return live_symbol_p (m
, p
);
4517 case MEM_TYPE_FLOAT
:
4518 return live_float_p (m
, p
);
4520 case MEM_TYPE_VECTORLIKE
:
4521 return live_vector_p (m
, p
);
4534 /***********************************************************************
4535 Pure Storage Management
4536 ***********************************************************************/
4538 /* Allocate room for SIZE bytes from pure Lisp storage and return a
4539 pointer to it. TYPE is the Lisp type for which the memory is
4540 allocated. TYPE < 0 means it's not used for a Lisp object. */
4542 static POINTER_TYPE
*
4543 pure_alloc (size_t size
, int type
)
4545 POINTER_TYPE
*result
;
4547 size_t alignment
= (1 << GCTYPEBITS
);
4549 size_t alignment
= sizeof (EMACS_INT
);
4551 /* Give Lisp_Floats an extra alignment. */
4552 if (type
== Lisp_Float
)
4554 #if defined __GNUC__ && __GNUC__ >= 2
4555 alignment
= __alignof (struct Lisp_Float
);
4557 alignment
= sizeof (struct Lisp_Float
);
4565 /* Allocate space for a Lisp object from the beginning of the free
4566 space with taking account of alignment. */
4567 result
= ALIGN (purebeg
+ pure_bytes_used_lisp
, alignment
);
4568 pure_bytes_used_lisp
= ((char *)result
- (char *)purebeg
) + size
;
4572 /* Allocate space for a non-Lisp object from the end of the free
4574 pure_bytes_used_non_lisp
+= size
;
4575 result
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4577 pure_bytes_used
= pure_bytes_used_lisp
+ pure_bytes_used_non_lisp
;
4579 if (pure_bytes_used
<= pure_size
)
4582 /* Don't allocate a large amount here,
4583 because it might get mmap'd and then its address
4584 might not be usable. */
4585 purebeg
= (char *) xmalloc (10000);
4587 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
4588 pure_bytes_used
= 0;
4589 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
4594 /* Print a warning if PURESIZE is too small. */
4597 check_pure_size (void)
4599 if (pure_bytes_used_before_overflow
)
4600 message (("emacs:0:Pure Lisp storage overflow (approx. %"pI
"d"
4602 pure_bytes_used
+ pure_bytes_used_before_overflow
);
4606 /* Find the byte sequence {DATA[0], ..., DATA[NBYTES-1], '\0'} from
4607 the non-Lisp data pool of the pure storage, and return its start
4608 address. Return NULL if not found. */
4611 find_string_data_in_pure (const char *data
, EMACS_INT nbytes
)
4614 EMACS_INT skip
, bm_skip
[256], last_char_skip
, infinity
, start
, start_max
;
4615 const unsigned char *p
;
4618 if (pure_bytes_used_non_lisp
< nbytes
+ 1)
4621 /* Set up the Boyer-Moore table. */
4623 for (i
= 0; i
< 256; i
++)
4626 p
= (const unsigned char *) data
;
4628 bm_skip
[*p
++] = skip
;
4630 last_char_skip
= bm_skip
['\0'];
4632 non_lisp_beg
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4633 start_max
= pure_bytes_used_non_lisp
- (nbytes
+ 1);
4635 /* See the comments in the function `boyer_moore' (search.c) for the
4636 use of `infinity'. */
4637 infinity
= pure_bytes_used_non_lisp
+ 1;
4638 bm_skip
['\0'] = infinity
;
4640 p
= (const unsigned char *) non_lisp_beg
+ nbytes
;
4644 /* Check the last character (== '\0'). */
4647 start
+= bm_skip
[*(p
+ start
)];
4649 while (start
<= start_max
);
4651 if (start
< infinity
)
4652 /* Couldn't find the last character. */
4655 /* No less than `infinity' means we could find the last
4656 character at `p[start - infinity]'. */
4659 /* Check the remaining characters. */
4660 if (memcmp (data
, non_lisp_beg
+ start
, nbytes
) == 0)
4662 return non_lisp_beg
+ start
;
4664 start
+= last_char_skip
;
4666 while (start
<= start_max
);
4672 /* Return a string allocated in pure space. DATA is a buffer holding
4673 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
4674 non-zero means make the result string multibyte.
4676 Must get an error if pure storage is full, since if it cannot hold
4677 a large string it may be able to hold conses that point to that
4678 string; then the string is not protected from gc. */
4681 make_pure_string (const char *data
,
4682 EMACS_INT nchars
, EMACS_INT nbytes
, int multibyte
)
4685 struct Lisp_String
*s
;
4687 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4688 s
->data
= (unsigned char *) find_string_data_in_pure (data
, nbytes
);
4689 if (s
->data
== NULL
)
4691 s
->data
= (unsigned char *) pure_alloc (nbytes
+ 1, -1);
4692 memcpy (s
->data
, data
, nbytes
);
4693 s
->data
[nbytes
] = '\0';
4696 s
->size_byte
= multibyte
? nbytes
: -1;
4697 s
->intervals
= NULL_INTERVAL
;
4698 XSETSTRING (string
, s
);
4702 /* Return a string a string allocated in pure space. Do not allocate
4703 the string data, just point to DATA. */
4706 make_pure_c_string (const char *data
)
4709 struct Lisp_String
*s
;
4710 EMACS_INT nchars
= strlen (data
);
4712 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4715 s
->data
= (unsigned char *) data
;
4716 s
->intervals
= NULL_INTERVAL
;
4717 XSETSTRING (string
, s
);
4721 /* Return a cons allocated from pure space. Give it pure copies
4722 of CAR as car and CDR as cdr. */
4725 pure_cons (Lisp_Object car
, Lisp_Object cdr
)
4727 register Lisp_Object
new;
4728 struct Lisp_Cons
*p
;
4730 p
= (struct Lisp_Cons
*) pure_alloc (sizeof *p
, Lisp_Cons
);
4732 XSETCAR (new, Fpurecopy (car
));
4733 XSETCDR (new, Fpurecopy (cdr
));
4738 /* Value is a float object with value NUM allocated from pure space. */
4741 make_pure_float (double num
)
4743 register Lisp_Object
new;
4744 struct Lisp_Float
*p
;
4746 p
= (struct Lisp_Float
*) pure_alloc (sizeof *p
, Lisp_Float
);
4748 XFLOAT_INIT (new, num
);
4753 /* Return a vector with room for LEN Lisp_Objects allocated from
4757 make_pure_vector (EMACS_INT len
)
4760 struct Lisp_Vector
*p
;
4761 size_t size
= (offsetof (struct Lisp_Vector
, contents
)
4762 + len
* sizeof (Lisp_Object
));
4764 p
= (struct Lisp_Vector
*) pure_alloc (size
, Lisp_Vectorlike
);
4765 XSETVECTOR (new, p
);
4766 XVECTOR (new)->header
.size
= len
;
4771 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
4772 doc
: /* Make a copy of object OBJ in pure storage.
4773 Recursively copies contents of vectors and cons cells.
4774 Does not copy symbols. Copies strings without text properties. */)
4775 (register Lisp_Object obj
)
4777 if (NILP (Vpurify_flag
))
4780 if (PURE_POINTER_P (XPNTR (obj
)))
4783 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
4785 Lisp_Object tmp
= Fgethash (obj
, Vpurify_flag
, Qnil
);
4791 obj
= pure_cons (XCAR (obj
), XCDR (obj
));
4792 else if (FLOATP (obj
))
4793 obj
= make_pure_float (XFLOAT_DATA (obj
));
4794 else if (STRINGP (obj
))
4795 obj
= make_pure_string (SSDATA (obj
), SCHARS (obj
),
4797 STRING_MULTIBYTE (obj
));
4798 else if (COMPILEDP (obj
) || VECTORP (obj
))
4800 register struct Lisp_Vector
*vec
;
4801 register EMACS_INT i
;
4805 if (size
& PSEUDOVECTOR_FLAG
)
4806 size
&= PSEUDOVECTOR_SIZE_MASK
;
4807 vec
= XVECTOR (make_pure_vector (size
));
4808 for (i
= 0; i
< size
; i
++)
4809 vec
->contents
[i
] = Fpurecopy (XVECTOR (obj
)->contents
[i
]);
4810 if (COMPILEDP (obj
))
4812 XSETPVECTYPE (vec
, PVEC_COMPILED
);
4813 XSETCOMPILED (obj
, vec
);
4816 XSETVECTOR (obj
, vec
);
4818 else if (MARKERP (obj
))
4819 error ("Attempt to copy a marker to pure storage");
4821 /* Not purified, don't hash-cons. */
4824 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
4825 Fputhash (obj
, obj
, Vpurify_flag
);
4832 /***********************************************************************
4834 ***********************************************************************/
4836 /* Put an entry in staticvec, pointing at the variable with address
4840 staticpro (Lisp_Object
*varaddress
)
4842 staticvec
[staticidx
++] = varaddress
;
4843 if (staticidx
>= NSTATICS
)
4848 /***********************************************************************
4850 ***********************************************************************/
4852 /* Temporarily prevent garbage collection. */
4855 inhibit_garbage_collection (void)
4857 int count
= SPECPDL_INDEX ();
4858 int nbits
= min (VALBITS
, BITS_PER_INT
);
4860 specbind (Qgc_cons_threshold
, make_number (((EMACS_INT
) 1 << (nbits
- 1)) - 1));
4865 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
4866 doc
: /* Reclaim storage for Lisp objects no longer needed.
4867 Garbage collection happens automatically if you cons more than
4868 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
4869 `garbage-collect' normally returns a list with info on amount of space in use:
4870 ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)
4871 (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS
4872 (USED-FLOATS . FREE-FLOATS) (USED-INTERVALS . FREE-INTERVALS)
4873 (USED-STRINGS . FREE-STRINGS))
4874 However, if there was overflow in pure space, `garbage-collect'
4875 returns nil, because real GC can't be done. */)
4878 register struct specbinding
*bind
;
4879 char stack_top_variable
;
4882 Lisp_Object total
[8];
4883 int count
= SPECPDL_INDEX ();
4884 EMACS_TIME t1
, t2
, t3
;
4889 /* Can't GC if pure storage overflowed because we can't determine
4890 if something is a pure object or not. */
4891 if (pure_bytes_used_before_overflow
)
4896 /* Don't keep undo information around forever.
4897 Do this early on, so it is no problem if the user quits. */
4899 register struct buffer
*nextb
= all_buffers
;
4903 /* If a buffer's undo list is Qt, that means that undo is
4904 turned off in that buffer. Calling truncate_undo_list on
4905 Qt tends to return NULL, which effectively turns undo back on.
4906 So don't call truncate_undo_list if undo_list is Qt. */
4907 if (! NILP (nextb
->BUFFER_INTERNAL_FIELD (name
)) && ! EQ (nextb
->BUFFER_INTERNAL_FIELD (undo_list
), Qt
))
4908 truncate_undo_list (nextb
);
4910 /* Shrink buffer gaps, but skip indirect and dead buffers. */
4911 if (nextb
->base_buffer
== 0 && !NILP (nextb
->BUFFER_INTERNAL_FIELD (name
))
4912 && ! nextb
->text
->inhibit_shrinking
)
4914 /* If a buffer's gap size is more than 10% of the buffer
4915 size, or larger than 2000 bytes, then shrink it
4916 accordingly. Keep a minimum size of 20 bytes. */
4917 int size
= min (2000, max (20, (nextb
->text
->z_byte
/ 10)));
4919 if (nextb
->text
->gap_size
> size
)
4921 struct buffer
*save_current
= current_buffer
;
4922 current_buffer
= nextb
;
4923 make_gap (-(nextb
->text
->gap_size
- size
));
4924 current_buffer
= save_current
;
4928 nextb
= nextb
->header
.next
.buffer
;
4932 EMACS_GET_TIME (t1
);
4934 /* In case user calls debug_print during GC,
4935 don't let that cause a recursive GC. */
4936 consing_since_gc
= 0;
4938 /* Save what's currently displayed in the echo area. */
4939 message_p
= push_message ();
4940 record_unwind_protect (pop_message_unwind
, Qnil
);
4942 /* Save a copy of the contents of the stack, for debugging. */
4943 #if MAX_SAVE_STACK > 0
4944 if (NILP (Vpurify_flag
))
4948 if (&stack_top_variable
< stack_bottom
)
4950 stack
= &stack_top_variable
;
4951 stack_size
= stack_bottom
- &stack_top_variable
;
4955 stack
= stack_bottom
;
4956 stack_size
= &stack_top_variable
- stack_bottom
;
4958 if (stack_size
<= MAX_SAVE_STACK
)
4960 if (stack_copy_size
< stack_size
)
4962 stack_copy
= (char *) xrealloc (stack_copy
, stack_size
);
4963 stack_copy_size
= stack_size
;
4965 memcpy (stack_copy
, stack
, stack_size
);
4968 #endif /* MAX_SAVE_STACK > 0 */
4970 if (garbage_collection_messages
)
4971 message1_nolog ("Garbage collecting...");
4975 shrink_regexp_cache ();
4979 /* clear_marks (); */
4981 /* Mark all the special slots that serve as the roots of accessibility. */
4983 for (i
= 0; i
< staticidx
; i
++)
4984 mark_object (*staticvec
[i
]);
4986 for (bind
= specpdl
; bind
!= specpdl_ptr
; bind
++)
4988 mark_object (bind
->symbol
);
4989 mark_object (bind
->old_value
);
4997 extern void xg_mark_data (void);
5002 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
5003 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
5007 register struct gcpro
*tail
;
5008 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
5009 for (i
= 0; i
< tail
->nvars
; i
++)
5010 mark_object (tail
->var
[i
]);
5014 struct catchtag
*catch;
5015 struct handler
*handler
;
5017 for (catch = catchlist
; catch; catch = catch->next
)
5019 mark_object (catch->tag
);
5020 mark_object (catch->val
);
5022 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
5024 mark_object (handler
->handler
);
5025 mark_object (handler
->var
);
5031 #ifdef HAVE_WINDOW_SYSTEM
5032 mark_fringe_data ();
5035 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5039 /* Everything is now marked, except for the things that require special
5040 finalization, i.e. the undo_list.
5041 Look thru every buffer's undo list
5042 for elements that update markers that were not marked,
5045 register struct buffer
*nextb
= all_buffers
;
5049 /* If a buffer's undo list is Qt, that means that undo is
5050 turned off in that buffer. Calling truncate_undo_list on
5051 Qt tends to return NULL, which effectively turns undo back on.
5052 So don't call truncate_undo_list if undo_list is Qt. */
5053 if (! EQ (nextb
->BUFFER_INTERNAL_FIELD (undo_list
), Qt
))
5055 Lisp_Object tail
, prev
;
5056 tail
= nextb
->BUFFER_INTERNAL_FIELD (undo_list
);
5058 while (CONSP (tail
))
5060 if (CONSP (XCAR (tail
))
5061 && MARKERP (XCAR (XCAR (tail
)))
5062 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
5065 nextb
->BUFFER_INTERNAL_FIELD (undo_list
) = tail
= XCDR (tail
);
5069 XSETCDR (prev
, tail
);
5079 /* Now that we have stripped the elements that need not be in the
5080 undo_list any more, we can finally mark the list. */
5081 mark_object (nextb
->BUFFER_INTERNAL_FIELD (undo_list
));
5083 nextb
= nextb
->header
.next
.buffer
;
5089 /* Clear the mark bits that we set in certain root slots. */
5091 unmark_byte_stack ();
5092 VECTOR_UNMARK (&buffer_defaults
);
5093 VECTOR_UNMARK (&buffer_local_symbols
);
5095 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
5103 /* clear_marks (); */
5106 consing_since_gc
= 0;
5107 if (gc_cons_threshold
< 10000)
5108 gc_cons_threshold
= 10000;
5110 if (FLOATP (Vgc_cons_percentage
))
5111 { /* Set gc_cons_combined_threshold. */
5114 tot
+= total_conses
* sizeof (struct Lisp_Cons
);
5115 tot
+= total_symbols
* sizeof (struct Lisp_Symbol
);
5116 tot
+= total_markers
* sizeof (union Lisp_Misc
);
5117 tot
+= total_string_size
;
5118 tot
+= total_vector_size
* sizeof (Lisp_Object
);
5119 tot
+= total_floats
* sizeof (struct Lisp_Float
);
5120 tot
+= total_intervals
* sizeof (struct interval
);
5121 tot
+= total_strings
* sizeof (struct Lisp_String
);
5123 gc_relative_threshold
= tot
* XFLOAT_DATA (Vgc_cons_percentage
);
5126 gc_relative_threshold
= 0;
5128 if (garbage_collection_messages
)
5130 if (message_p
|| minibuf_level
> 0)
5133 message1_nolog ("Garbage collecting...done");
5136 unbind_to (count
, Qnil
);
5138 total
[0] = Fcons (make_number (total_conses
),
5139 make_number (total_free_conses
));
5140 total
[1] = Fcons (make_number (total_symbols
),
5141 make_number (total_free_symbols
));
5142 total
[2] = Fcons (make_number (total_markers
),
5143 make_number (total_free_markers
));
5144 total
[3] = make_number (total_string_size
);
5145 total
[4] = make_number (total_vector_size
);
5146 total
[5] = Fcons (make_number (total_floats
),
5147 make_number (total_free_floats
));
5148 total
[6] = Fcons (make_number (total_intervals
),
5149 make_number (total_free_intervals
));
5150 total
[7] = Fcons (make_number (total_strings
),
5151 make_number (total_free_strings
));
5153 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5155 /* Compute average percentage of zombies. */
5158 for (i
= 0; i
< 7; ++i
)
5159 if (CONSP (total
[i
]))
5160 nlive
+= XFASTINT (XCAR (total
[i
]));
5162 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
5163 max_live
= max (nlive
, max_live
);
5164 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
5165 max_zombies
= max (nzombies
, max_zombies
);
5170 if (!NILP (Vpost_gc_hook
))
5172 int gc_count
= inhibit_garbage_collection ();
5173 safe_run_hooks (Qpost_gc_hook
);
5174 unbind_to (gc_count
, Qnil
);
5177 /* Accumulate statistics. */
5178 EMACS_GET_TIME (t2
);
5179 EMACS_SUB_TIME (t3
, t2
, t1
);
5180 if (FLOATP (Vgc_elapsed
))
5181 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
) +
5183 EMACS_USECS (t3
) * 1.0e-6);
5186 return Flist (sizeof total
/ sizeof *total
, total
);
5190 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
5191 only interesting objects referenced from glyphs are strings. */
5194 mark_glyph_matrix (struct glyph_matrix
*matrix
)
5196 struct glyph_row
*row
= matrix
->rows
;
5197 struct glyph_row
*end
= row
+ matrix
->nrows
;
5199 for (; row
< end
; ++row
)
5203 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
5205 struct glyph
*glyph
= row
->glyphs
[area
];
5206 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
5208 for (; glyph
< end_glyph
; ++glyph
)
5209 if (STRINGP (glyph
->object
)
5210 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
5211 mark_object (glyph
->object
);
5217 /* Mark Lisp faces in the face cache C. */
5220 mark_face_cache (struct face_cache
*c
)
5225 for (i
= 0; i
< c
->used
; ++i
)
5227 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
5231 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
5232 mark_object (face
->lface
[j
]);
5240 /* Mark reference to a Lisp_Object.
5241 If the object referred to has not been seen yet, recursively mark
5242 all the references contained in it. */
5244 #define LAST_MARKED_SIZE 500
5245 static Lisp_Object last_marked
[LAST_MARKED_SIZE
];
5246 static int last_marked_index
;
5248 /* For debugging--call abort when we cdr down this many
5249 links of a list, in mark_object. In debugging,
5250 the call to abort will hit a breakpoint.
5251 Normally this is zero and the check never goes off. */
5252 static size_t mark_object_loop_halt
;
5255 mark_vectorlike (struct Lisp_Vector
*ptr
)
5257 register EMACS_UINT size
= ptr
->header
.size
;
5258 register EMACS_UINT i
;
5260 eassert (!VECTOR_MARKED_P (ptr
));
5261 VECTOR_MARK (ptr
); /* Else mark it */
5262 if (size
& PSEUDOVECTOR_FLAG
)
5263 size
&= PSEUDOVECTOR_SIZE_MASK
;
5265 /* Note that this size is not the memory-footprint size, but only
5266 the number of Lisp_Object fields that we should trace.
5267 The distinction is used e.g. by Lisp_Process which places extra
5268 non-Lisp_Object fields at the end of the structure. */
5269 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5270 mark_object (ptr
->contents
[i
]);
5273 /* Like mark_vectorlike but optimized for char-tables (and
5274 sub-char-tables) assuming that the contents are mostly integers or
5278 mark_char_table (struct Lisp_Vector
*ptr
)
5280 register EMACS_UINT size
= ptr
->header
.size
& PSEUDOVECTOR_SIZE_MASK
;
5281 register EMACS_UINT i
;
5283 eassert (!VECTOR_MARKED_P (ptr
));
5285 for (i
= 0; i
< size
; i
++)
5287 Lisp_Object val
= ptr
->contents
[i
];
5289 if (INTEGERP (val
) || (SYMBOLP (val
) && XSYMBOL (val
)->gcmarkbit
))
5291 if (SUB_CHAR_TABLE_P (val
))
5293 if (! VECTOR_MARKED_P (XVECTOR (val
)))
5294 mark_char_table (XVECTOR (val
));
5302 mark_object (Lisp_Object arg
)
5304 register Lisp_Object obj
= arg
;
5305 #ifdef GC_CHECK_MARKED_OBJECTS
5309 size_t cdr_count
= 0;
5313 if (PURE_POINTER_P (XPNTR (obj
)))
5316 last_marked
[last_marked_index
++] = obj
;
5317 if (last_marked_index
== LAST_MARKED_SIZE
)
5318 last_marked_index
= 0;
5320 /* Perform some sanity checks on the objects marked here. Abort if
5321 we encounter an object we know is bogus. This increases GC time
5322 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
5323 #ifdef GC_CHECK_MARKED_OBJECTS
5325 po
= (void *) XPNTR (obj
);
5327 /* Check that the object pointed to by PO is known to be a Lisp
5328 structure allocated from the heap. */
5329 #define CHECK_ALLOCATED() \
5331 m = mem_find (po); \
5336 /* Check that the object pointed to by PO is live, using predicate
5338 #define CHECK_LIVE(LIVEP) \
5340 if (!LIVEP (m, po)) \
5344 /* Check both of the above conditions. */
5345 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
5347 CHECK_ALLOCATED (); \
5348 CHECK_LIVE (LIVEP); \
5351 #else /* not GC_CHECK_MARKED_OBJECTS */
5353 #define CHECK_LIVE(LIVEP) (void) 0
5354 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
5356 #endif /* not GC_CHECK_MARKED_OBJECTS */
5358 switch (SWITCH_ENUM_CAST (XTYPE (obj
)))
5362 register struct Lisp_String
*ptr
= XSTRING (obj
);
5363 if (STRING_MARKED_P (ptr
))
5365 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
5366 MARK_INTERVAL_TREE (ptr
->intervals
);
5368 #ifdef GC_CHECK_STRING_BYTES
5369 /* Check that the string size recorded in the string is the
5370 same as the one recorded in the sdata structure. */
5371 CHECK_STRING_BYTES (ptr
);
5372 #endif /* GC_CHECK_STRING_BYTES */
5376 case Lisp_Vectorlike
:
5377 if (VECTOR_MARKED_P (XVECTOR (obj
)))
5379 #ifdef GC_CHECK_MARKED_OBJECTS
5381 if (m
== MEM_NIL
&& !SUBRP (obj
)
5382 && po
!= &buffer_defaults
5383 && po
!= &buffer_local_symbols
)
5385 #endif /* GC_CHECK_MARKED_OBJECTS */
5389 #ifdef GC_CHECK_MARKED_OBJECTS
5390 if (po
!= &buffer_defaults
&& po
!= &buffer_local_symbols
)
5393 for (b
= all_buffers
; b
&& b
!= po
; b
= b
->header
.next
.buffer
)
5398 #endif /* GC_CHECK_MARKED_OBJECTS */
5401 else if (SUBRP (obj
))
5403 else if (COMPILEDP (obj
))
5404 /* We could treat this just like a vector, but it is better to
5405 save the COMPILED_CONSTANTS element for last and avoid
5408 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5409 register EMACS_UINT size
= ptr
->header
.size
;
5410 register EMACS_UINT i
;
5412 CHECK_LIVE (live_vector_p
);
5413 VECTOR_MARK (ptr
); /* Else mark it */
5414 size
&= PSEUDOVECTOR_SIZE_MASK
;
5415 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5417 if (i
!= COMPILED_CONSTANTS
)
5418 mark_object (ptr
->contents
[i
]);
5420 obj
= ptr
->contents
[COMPILED_CONSTANTS
];
5423 else if (FRAMEP (obj
))
5425 register struct frame
*ptr
= XFRAME (obj
);
5426 mark_vectorlike (XVECTOR (obj
));
5427 mark_face_cache (ptr
->face_cache
);
5429 else if (WINDOWP (obj
))
5431 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5432 struct window
*w
= XWINDOW (obj
);
5433 mark_vectorlike (ptr
);
5434 /* Mark glyphs for leaf windows. Marking window matrices is
5435 sufficient because frame matrices use the same glyph
5437 if (NILP (w
->hchild
)
5439 && w
->current_matrix
)
5441 mark_glyph_matrix (w
->current_matrix
);
5442 mark_glyph_matrix (w
->desired_matrix
);
5445 else if (HASH_TABLE_P (obj
))
5447 struct Lisp_Hash_Table
*h
= XHASH_TABLE (obj
);
5448 mark_vectorlike ((struct Lisp_Vector
*)h
);
5449 /* If hash table is not weak, mark all keys and values.
5450 For weak tables, mark only the vector. */
5452 mark_object (h
->key_and_value
);
5454 VECTOR_MARK (XVECTOR (h
->key_and_value
));
5456 else if (CHAR_TABLE_P (obj
))
5457 mark_char_table (XVECTOR (obj
));
5459 mark_vectorlike (XVECTOR (obj
));
5464 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
5465 struct Lisp_Symbol
*ptrx
;
5469 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
5471 mark_object (ptr
->function
);
5472 mark_object (ptr
->plist
);
5473 switch (ptr
->redirect
)
5475 case SYMBOL_PLAINVAL
: mark_object (SYMBOL_VAL (ptr
)); break;
5476 case SYMBOL_VARALIAS
:
5479 XSETSYMBOL (tem
, SYMBOL_ALIAS (ptr
));
5483 case SYMBOL_LOCALIZED
:
5485 struct Lisp_Buffer_Local_Value
*blv
= SYMBOL_BLV (ptr
);
5486 /* If the value is forwarded to a buffer or keyboard field,
5487 these are marked when we see the corresponding object.
5488 And if it's forwarded to a C variable, either it's not
5489 a Lisp_Object var, or it's staticpro'd already. */
5490 mark_object (blv
->where
);
5491 mark_object (blv
->valcell
);
5492 mark_object (blv
->defcell
);
5495 case SYMBOL_FORWARDED
:
5496 /* If the value is forwarded to a buffer or keyboard field,
5497 these are marked when we see the corresponding object.
5498 And if it's forwarded to a C variable, either it's not
5499 a Lisp_Object var, or it's staticpro'd already. */
5503 if (!PURE_POINTER_P (XSTRING (ptr
->xname
)))
5504 MARK_STRING (XSTRING (ptr
->xname
));
5505 MARK_INTERVAL_TREE (STRING_INTERVALS (ptr
->xname
));
5510 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun */
5511 XSETSYMBOL (obj
, ptrx
);
5518 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
5519 if (XMISCANY (obj
)->gcmarkbit
)
5521 XMISCANY (obj
)->gcmarkbit
= 1;
5523 switch (XMISCTYPE (obj
))
5526 case Lisp_Misc_Marker
:
5527 /* DO NOT mark thru the marker's chain.
5528 The buffer's markers chain does not preserve markers from gc;
5529 instead, markers are removed from the chain when freed by gc. */
5532 case Lisp_Misc_Save_Value
:
5535 register struct Lisp_Save_Value
*ptr
= XSAVE_VALUE (obj
);
5536 /* If DOGC is set, POINTER is the address of a memory
5537 area containing INTEGER potential Lisp_Objects. */
5540 Lisp_Object
*p
= (Lisp_Object
*) ptr
->pointer
;
5542 for (nelt
= ptr
->integer
; nelt
> 0; nelt
--, p
++)
5543 mark_maybe_object (*p
);
5549 case Lisp_Misc_Overlay
:
5551 struct Lisp_Overlay
*ptr
= XOVERLAY (obj
);
5552 mark_object (ptr
->start
);
5553 mark_object (ptr
->end
);
5554 mark_object (ptr
->plist
);
5557 XSETMISC (obj
, ptr
->next
);
5570 register struct Lisp_Cons
*ptr
= XCONS (obj
);
5571 if (CONS_MARKED_P (ptr
))
5573 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
5575 /* If the cdr is nil, avoid recursion for the car. */
5576 if (EQ (ptr
->u
.cdr
, Qnil
))
5582 mark_object (ptr
->car
);
5585 if (cdr_count
== mark_object_loop_halt
)
5591 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
5592 FLOAT_MARK (XFLOAT (obj
));
5603 #undef CHECK_ALLOCATED
5604 #undef CHECK_ALLOCATED_AND_LIVE
5607 /* Mark the pointers in a buffer structure. */
5610 mark_buffer (Lisp_Object buf
)
5612 register struct buffer
*buffer
= XBUFFER (buf
);
5613 register Lisp_Object
*ptr
, tmp
;
5614 Lisp_Object base_buffer
;
5616 eassert (!VECTOR_MARKED_P (buffer
));
5617 VECTOR_MARK (buffer
);
5619 MARK_INTERVAL_TREE (BUF_INTERVALS (buffer
));
5621 /* For now, we just don't mark the undo_list. It's done later in
5622 a special way just before the sweep phase, and after stripping
5623 some of its elements that are not needed any more. */
5625 if (buffer
->overlays_before
)
5627 XSETMISC (tmp
, buffer
->overlays_before
);
5630 if (buffer
->overlays_after
)
5632 XSETMISC (tmp
, buffer
->overlays_after
);
5636 /* buffer-local Lisp variables start at `undo_list',
5637 tho only the ones from `name' on are GC'd normally. */
5638 for (ptr
= &buffer
->BUFFER_INTERNAL_FIELD (name
);
5639 (char *)ptr
< (char *)buffer
+ sizeof (struct buffer
);
5643 /* If this is an indirect buffer, mark its base buffer. */
5644 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
5646 XSETBUFFER (base_buffer
, buffer
->base_buffer
);
5647 mark_buffer (base_buffer
);
5651 /* Mark the Lisp pointers in the terminal objects.
5652 Called by the Fgarbage_collector. */
5655 mark_terminals (void)
5658 for (t
= terminal_list
; t
; t
= t
->next_terminal
)
5660 eassert (t
->name
!= NULL
);
5661 #ifdef HAVE_WINDOW_SYSTEM
5662 /* If a terminal object is reachable from a stacpro'ed object,
5663 it might have been marked already. Make sure the image cache
5665 mark_image_cache (t
->image_cache
);
5666 #endif /* HAVE_WINDOW_SYSTEM */
5667 if (!VECTOR_MARKED_P (t
))
5668 mark_vectorlike ((struct Lisp_Vector
*)t
);
5674 /* Value is non-zero if OBJ will survive the current GC because it's
5675 either marked or does not need to be marked to survive. */
5678 survives_gc_p (Lisp_Object obj
)
5682 switch (XTYPE (obj
))
5689 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
5693 survives_p
= XMISCANY (obj
)->gcmarkbit
;
5697 survives_p
= STRING_MARKED_P (XSTRING (obj
));
5700 case Lisp_Vectorlike
:
5701 survives_p
= SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
5705 survives_p
= CONS_MARKED_P (XCONS (obj
));
5709 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
5716 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
5721 /* Sweep: find all structures not marked, and free them. */
5726 /* Remove or mark entries in weak hash tables.
5727 This must be done before any object is unmarked. */
5728 sweep_weak_hash_tables ();
5731 #ifdef GC_CHECK_STRING_BYTES
5732 if (!noninteractive
)
5733 check_string_bytes (1);
5736 /* Put all unmarked conses on free list */
5738 register struct cons_block
*cblk
;
5739 struct cons_block
**cprev
= &cons_block
;
5740 register int lim
= cons_block_index
;
5741 register int num_free
= 0, num_used
= 0;
5745 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
5749 int ilim
= (lim
+ BITS_PER_INT
- 1) / BITS_PER_INT
;
5751 /* Scan the mark bits an int at a time. */
5752 for (i
= 0; i
<= ilim
; i
++)
5754 if (cblk
->gcmarkbits
[i
] == -1)
5756 /* Fast path - all cons cells for this int are marked. */
5757 cblk
->gcmarkbits
[i
] = 0;
5758 num_used
+= BITS_PER_INT
;
5762 /* Some cons cells for this int are not marked.
5763 Find which ones, and free them. */
5764 int start
, pos
, stop
;
5766 start
= i
* BITS_PER_INT
;
5768 if (stop
> BITS_PER_INT
)
5769 stop
= BITS_PER_INT
;
5772 for (pos
= start
; pos
< stop
; pos
++)
5774 if (!CONS_MARKED_P (&cblk
->conses
[pos
]))
5777 cblk
->conses
[pos
].u
.chain
= cons_free_list
;
5778 cons_free_list
= &cblk
->conses
[pos
];
5780 cons_free_list
->car
= Vdead
;
5786 CONS_UNMARK (&cblk
->conses
[pos
]);
5792 lim
= CONS_BLOCK_SIZE
;
5793 /* If this block contains only free conses and we have already
5794 seen more than two blocks worth of free conses then deallocate
5796 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
5798 *cprev
= cblk
->next
;
5799 /* Unhook from the free list. */
5800 cons_free_list
= cblk
->conses
[0].u
.chain
;
5801 lisp_align_free (cblk
);
5806 num_free
+= this_free
;
5807 cprev
= &cblk
->next
;
5810 total_conses
= num_used
;
5811 total_free_conses
= num_free
;
5814 /* Put all unmarked floats on free list */
5816 register struct float_block
*fblk
;
5817 struct float_block
**fprev
= &float_block
;
5818 register int lim
= float_block_index
;
5819 register int num_free
= 0, num_used
= 0;
5821 float_free_list
= 0;
5823 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
5827 for (i
= 0; i
< lim
; i
++)
5828 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
5831 fblk
->floats
[i
].u
.chain
= float_free_list
;
5832 float_free_list
= &fblk
->floats
[i
];
5837 FLOAT_UNMARK (&fblk
->floats
[i
]);
5839 lim
= FLOAT_BLOCK_SIZE
;
5840 /* If this block contains only free floats and we have already
5841 seen more than two blocks worth of free floats then deallocate
5843 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
5845 *fprev
= fblk
->next
;
5846 /* Unhook from the free list. */
5847 float_free_list
= fblk
->floats
[0].u
.chain
;
5848 lisp_align_free (fblk
);
5853 num_free
+= this_free
;
5854 fprev
= &fblk
->next
;
5857 total_floats
= num_used
;
5858 total_free_floats
= num_free
;
5861 /* Put all unmarked intervals on free list */
5863 register struct interval_block
*iblk
;
5864 struct interval_block
**iprev
= &interval_block
;
5865 register int lim
= interval_block_index
;
5866 register int num_free
= 0, num_used
= 0;
5868 interval_free_list
= 0;
5870 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
5875 for (i
= 0; i
< lim
; i
++)
5877 if (!iblk
->intervals
[i
].gcmarkbit
)
5879 SET_INTERVAL_PARENT (&iblk
->intervals
[i
], interval_free_list
);
5880 interval_free_list
= &iblk
->intervals
[i
];
5886 iblk
->intervals
[i
].gcmarkbit
= 0;
5889 lim
= INTERVAL_BLOCK_SIZE
;
5890 /* If this block contains only free intervals and we have already
5891 seen more than two blocks worth of free intervals then
5892 deallocate this block. */
5893 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
5895 *iprev
= iblk
->next
;
5896 /* Unhook from the free list. */
5897 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
5899 n_interval_blocks
--;
5903 num_free
+= this_free
;
5904 iprev
= &iblk
->next
;
5907 total_intervals
= num_used
;
5908 total_free_intervals
= num_free
;
5911 /* Put all unmarked symbols on free list */
5913 register struct symbol_block
*sblk
;
5914 struct symbol_block
**sprev
= &symbol_block
;
5915 register int lim
= symbol_block_index
;
5916 register int num_free
= 0, num_used
= 0;
5918 symbol_free_list
= NULL
;
5920 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
5923 struct Lisp_Symbol
*sym
= sblk
->symbols
;
5924 struct Lisp_Symbol
*end
= sym
+ lim
;
5926 for (; sym
< end
; ++sym
)
5928 /* Check if the symbol was created during loadup. In such a case
5929 it might be pointed to by pure bytecode which we don't trace,
5930 so we conservatively assume that it is live. */
5931 int pure_p
= PURE_POINTER_P (XSTRING (sym
->xname
));
5933 if (!sym
->gcmarkbit
&& !pure_p
)
5935 if (sym
->redirect
== SYMBOL_LOCALIZED
)
5936 xfree (SYMBOL_BLV (sym
));
5937 sym
->next
= symbol_free_list
;
5938 symbol_free_list
= sym
;
5940 symbol_free_list
->function
= Vdead
;
5948 UNMARK_STRING (XSTRING (sym
->xname
));
5953 lim
= SYMBOL_BLOCK_SIZE
;
5954 /* If this block contains only free symbols and we have already
5955 seen more than two blocks worth of free symbols then deallocate
5957 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
5959 *sprev
= sblk
->next
;
5960 /* Unhook from the free list. */
5961 symbol_free_list
= sblk
->symbols
[0].next
;
5967 num_free
+= this_free
;
5968 sprev
= &sblk
->next
;
5971 total_symbols
= num_used
;
5972 total_free_symbols
= num_free
;
5975 /* Put all unmarked misc's on free list.
5976 For a marker, first unchain it from the buffer it points into. */
5978 register struct marker_block
*mblk
;
5979 struct marker_block
**mprev
= &marker_block
;
5980 register int lim
= marker_block_index
;
5981 register int num_free
= 0, num_used
= 0;
5983 marker_free_list
= 0;
5985 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
5990 for (i
= 0; i
< lim
; i
++)
5992 if (!mblk
->markers
[i
].u_any
.gcmarkbit
)
5994 if (mblk
->markers
[i
].u_any
.type
== Lisp_Misc_Marker
)
5995 unchain_marker (&mblk
->markers
[i
].u_marker
);
5996 /* Set the type of the freed object to Lisp_Misc_Free.
5997 We could leave the type alone, since nobody checks it,
5998 but this might catch bugs faster. */
5999 mblk
->markers
[i
].u_marker
.type
= Lisp_Misc_Free
;
6000 mblk
->markers
[i
].u_free
.chain
= marker_free_list
;
6001 marker_free_list
= &mblk
->markers
[i
];
6007 mblk
->markers
[i
].u_any
.gcmarkbit
= 0;
6010 lim
= MARKER_BLOCK_SIZE
;
6011 /* If this block contains only free markers and we have already
6012 seen more than two blocks worth of free markers then deallocate
6014 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
6016 *mprev
= mblk
->next
;
6017 /* Unhook from the free list. */
6018 marker_free_list
= mblk
->markers
[0].u_free
.chain
;
6024 num_free
+= this_free
;
6025 mprev
= &mblk
->next
;
6029 total_markers
= num_used
;
6030 total_free_markers
= num_free
;
6033 /* Free all unmarked buffers */
6035 register struct buffer
*buffer
= all_buffers
, *prev
= 0, *next
;
6038 if (!VECTOR_MARKED_P (buffer
))
6041 prev
->header
.next
= buffer
->header
.next
;
6043 all_buffers
= buffer
->header
.next
.buffer
;
6044 next
= buffer
->header
.next
.buffer
;
6050 VECTOR_UNMARK (buffer
);
6051 UNMARK_BALANCE_INTERVALS (BUF_INTERVALS (buffer
));
6052 prev
= buffer
, buffer
= buffer
->header
.next
.buffer
;
6056 /* Free all unmarked vectors */
6058 register struct Lisp_Vector
*vector
= all_vectors
, *prev
= 0, *next
;
6059 total_vector_size
= 0;
6062 if (!VECTOR_MARKED_P (vector
))
6065 prev
->header
.next
= vector
->header
.next
;
6067 all_vectors
= vector
->header
.next
.vector
;
6068 next
= vector
->header
.next
.vector
;
6076 VECTOR_UNMARK (vector
);
6077 if (vector
->header
.size
& PSEUDOVECTOR_FLAG
)
6078 total_vector_size
+= PSEUDOVECTOR_SIZE_MASK
& vector
->header
.size
;
6080 total_vector_size
+= vector
->header
.size
;
6081 prev
= vector
, vector
= vector
->header
.next
.vector
;
6085 #ifdef GC_CHECK_STRING_BYTES
6086 if (!noninteractive
)
6087 check_string_bytes (1);
6094 /* Debugging aids. */
6096 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
6097 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
6098 This may be helpful in debugging Emacs's memory usage.
6099 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
6104 XSETINT (end
, (intptr_t) (char *) sbrk (0) / 1024);
6109 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
6110 doc
: /* Return a list of counters that measure how much consing there has been.
6111 Each of these counters increments for a certain kind of object.
6112 The counters wrap around from the largest positive integer to zero.
6113 Garbage collection does not decrease them.
6114 The elements of the value are as follows:
6115 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
6116 All are in units of 1 = one object consed
6117 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
6119 MISCS include overlays, markers, and some internal types.
6120 Frames, windows, buffers, and subprocesses count as vectors
6121 (but the contents of a buffer's text do not count here). */)
6124 Lisp_Object consed
[8];
6126 consed
[0] = make_number (min (MOST_POSITIVE_FIXNUM
, cons_cells_consed
));
6127 consed
[1] = make_number (min (MOST_POSITIVE_FIXNUM
, floats_consed
));
6128 consed
[2] = make_number (min (MOST_POSITIVE_FIXNUM
, vector_cells_consed
));
6129 consed
[3] = make_number (min (MOST_POSITIVE_FIXNUM
, symbols_consed
));
6130 consed
[4] = make_number (min (MOST_POSITIVE_FIXNUM
, string_chars_consed
));
6131 consed
[5] = make_number (min (MOST_POSITIVE_FIXNUM
, misc_objects_consed
));
6132 consed
[6] = make_number (min (MOST_POSITIVE_FIXNUM
, intervals_consed
));
6133 consed
[7] = make_number (min (MOST_POSITIVE_FIXNUM
, strings_consed
));
6135 return Flist (8, consed
);
6138 #ifdef ENABLE_CHECKING
6139 int suppress_checking
;
6142 die (const char *msg
, const char *file
, int line
)
6144 fprintf (stderr
, "\r\n%s:%d: Emacs fatal error: %s\r\n",
6150 /* Initialization */
6153 init_alloc_once (void)
6155 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
6157 pure_size
= PURESIZE
;
6158 pure_bytes_used
= 0;
6159 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
6160 pure_bytes_used_before_overflow
= 0;
6162 /* Initialize the list of free aligned blocks. */
6165 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
6167 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
6171 ignore_warnings
= 1;
6172 #ifdef DOUG_LEA_MALLOC
6173 mallopt (M_TRIM_THRESHOLD
, 128*1024); /* trim threshold */
6174 mallopt (M_MMAP_THRESHOLD
, 64*1024); /* mmap threshold */
6175 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* max. number of mmap'ed areas */
6183 init_weak_hash_tables ();
6186 malloc_hysteresis
= 32;
6188 malloc_hysteresis
= 0;
6191 refill_memory_reserve ();
6193 ignore_warnings
= 0;
6195 byte_stack_list
= 0;
6197 consing_since_gc
= 0;
6198 gc_cons_threshold
= 100000 * sizeof (Lisp_Object
);
6199 gc_relative_threshold
= 0;
6206 byte_stack_list
= 0;
6208 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
6209 setjmp_tested_p
= longjmps_done
= 0;
6212 Vgc_elapsed
= make_float (0.0);
6217 syms_of_alloc (void)
6219 DEFVAR_INT ("gc-cons-threshold", gc_cons_threshold
,
6220 doc
: /* *Number of bytes of consing between garbage collections.
6221 Garbage collection can happen automatically once this many bytes have been
6222 allocated since the last garbage collection. All data types count.
6224 Garbage collection happens automatically only when `eval' is called.
6226 By binding this temporarily to a large number, you can effectively
6227 prevent garbage collection during a part of the program.
6228 See also `gc-cons-percentage'. */);
6230 DEFVAR_LISP ("gc-cons-percentage", Vgc_cons_percentage
,
6231 doc
: /* *Portion of the heap used for allocation.
6232 Garbage collection can happen automatically once this portion of the heap
6233 has been allocated since the last garbage collection.
6234 If this portion is smaller than `gc-cons-threshold', this is ignored. */);
6235 Vgc_cons_percentage
= make_float (0.1);
6237 DEFVAR_INT ("pure-bytes-used", pure_bytes_used
,
6238 doc
: /* Number of bytes of sharable Lisp data allocated so far. */);
6240 DEFVAR_INT ("cons-cells-consed", cons_cells_consed
,
6241 doc
: /* Number of cons cells that have been consed so far. */);
6243 DEFVAR_INT ("floats-consed", floats_consed
,
6244 doc
: /* Number of floats that have been consed so far. */);
6246 DEFVAR_INT ("vector-cells-consed", vector_cells_consed
,
6247 doc
: /* Number of vector cells that have been consed so far. */);
6249 DEFVAR_INT ("symbols-consed", symbols_consed
,
6250 doc
: /* Number of symbols that have been consed so far. */);
6252 DEFVAR_INT ("string-chars-consed", string_chars_consed
,
6253 doc
: /* Number of string characters that have been consed so far. */);
6255 DEFVAR_INT ("misc-objects-consed", misc_objects_consed
,
6256 doc
: /* Number of miscellaneous objects that have been consed so far. */);
6258 DEFVAR_INT ("intervals-consed", intervals_consed
,
6259 doc
: /* Number of intervals that have been consed so far. */);
6261 DEFVAR_INT ("strings-consed", strings_consed
,
6262 doc
: /* Number of strings that have been consed so far. */);
6264 DEFVAR_LISP ("purify-flag", Vpurify_flag
,
6265 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
6266 This means that certain objects should be allocated in shared (pure) space.
6267 It can also be set to a hash-table, in which case this table is used to
6268 do hash-consing of the objects allocated to pure space. */);
6270 DEFVAR_BOOL ("garbage-collection-messages", garbage_collection_messages
,
6271 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
6272 garbage_collection_messages
= 0;
6274 DEFVAR_LISP ("post-gc-hook", Vpost_gc_hook
,
6275 doc
: /* Hook run after garbage collection has finished. */);
6276 Vpost_gc_hook
= Qnil
;
6277 Qpost_gc_hook
= intern_c_string ("post-gc-hook");
6278 staticpro (&Qpost_gc_hook
);
6280 DEFVAR_LISP ("memory-signal-data", Vmemory_signal_data
,
6281 doc
: /* Precomputed `signal' argument for memory-full error. */);
6282 /* We build this in advance because if we wait until we need it, we might
6283 not be able to allocate the memory to hold it. */
6285 = pure_cons (Qerror
,
6286 pure_cons (make_pure_c_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"), Qnil
));
6288 DEFVAR_LISP ("memory-full", Vmemory_full
,
6289 doc
: /* Non-nil means Emacs cannot get much more Lisp memory. */);
6290 Vmemory_full
= Qnil
;
6292 staticpro (&Qgc_cons_threshold
);
6293 Qgc_cons_threshold
= intern_c_string ("gc-cons-threshold");
6295 staticpro (&Qchar_table_extra_slots
);
6296 Qchar_table_extra_slots
= intern_c_string ("char-table-extra-slots");
6298 DEFVAR_LISP ("gc-elapsed", Vgc_elapsed
,
6299 doc
: /* Accumulated time elapsed in garbage collections.
6300 The time is in seconds as a floating point value. */);
6301 DEFVAR_INT ("gcs-done", gcs_done
,
6302 doc
: /* Accumulated number of garbage collections done. */);
6307 defsubr (&Smake_byte_code
);
6308 defsubr (&Smake_list
);
6309 defsubr (&Smake_vector
);
6310 defsubr (&Smake_string
);
6311 defsubr (&Smake_bool_vector
);
6312 defsubr (&Smake_symbol
);
6313 defsubr (&Smake_marker
);
6314 defsubr (&Spurecopy
);
6315 defsubr (&Sgarbage_collect
);
6316 defsubr (&Smemory_limit
);
6317 defsubr (&Smemory_use_counts
);
6319 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
6320 defsubr (&Sgc_status
);