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)->size |= ARRAY_MARK_FLAG)
150 #define VECTOR_UNMARK(V) ((V)->size &= ~ARRAY_MARK_FLAG)
151 #define VECTOR_MARKED_P(V) (((V)->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 *) ((((EMACS_UINT)(ptr)) + (ALIGNMENT) - 1) \
442 & ~((ALIGNMENT) - 1)))
446 /************************************************************************
448 ************************************************************************/
450 /* Function malloc calls this if it finds we are near exhausting storage. */
453 malloc_warning (const char *str
)
455 pending_malloc_warning
= str
;
459 /* Display an already-pending malloc warning. */
462 display_malloc_warning (void)
464 call3 (intern ("display-warning"),
466 build_string (pending_malloc_warning
),
467 intern ("emergency"));
468 pending_malloc_warning
= 0;
471 /* Called if we can't allocate relocatable space for a buffer. */
474 buffer_memory_full (void)
476 /* If buffers use the relocating allocator, no need to free
477 spare_memory, because we may have plenty of malloc space left
478 that we could get, and if we don't, the malloc that fails will
479 itself cause spare_memory to be freed. If buffers don't use the
480 relocating allocator, treat this like any other failing
487 /* This used to call error, but if we've run out of memory, we could
488 get infinite recursion trying to build the string. */
489 xsignal (Qnil
, Vmemory_signal_data
);
493 #ifdef XMALLOC_OVERRUN_CHECK
495 /* Check for overrun in malloc'ed buffers by wrapping a 16 byte header
496 and a 16 byte trailer around each block.
498 The header consists of 12 fixed bytes + a 4 byte integer contaning the
499 original block size, while the trailer consists of 16 fixed bytes.
501 The header is used to detect whether this block has been allocated
502 through these functions -- as it seems that some low-level libc
503 functions may bypass the malloc hooks.
507 #define XMALLOC_OVERRUN_CHECK_SIZE 16
509 static char xmalloc_overrun_check_header
[XMALLOC_OVERRUN_CHECK_SIZE
-4] =
510 { 0x9a, 0x9b, 0xae, 0xaf,
511 0xbf, 0xbe, 0xce, 0xcf,
512 0xea, 0xeb, 0xec, 0xed };
514 static char xmalloc_overrun_check_trailer
[XMALLOC_OVERRUN_CHECK_SIZE
] =
515 { 0xaa, 0xab, 0xac, 0xad,
516 0xba, 0xbb, 0xbc, 0xbd,
517 0xca, 0xcb, 0xcc, 0xcd,
518 0xda, 0xdb, 0xdc, 0xdd };
520 /* Macros to insert and extract the block size in the header. */
522 #define XMALLOC_PUT_SIZE(ptr, size) \
523 (ptr[-1] = (size & 0xff), \
524 ptr[-2] = ((size >> 8) & 0xff), \
525 ptr[-3] = ((size >> 16) & 0xff), \
526 ptr[-4] = ((size >> 24) & 0xff))
528 #define XMALLOC_GET_SIZE(ptr) \
529 (size_t)((unsigned)(ptr[-1]) | \
530 ((unsigned)(ptr[-2]) << 8) | \
531 ((unsigned)(ptr[-3]) << 16) | \
532 ((unsigned)(ptr[-4]) << 24))
535 /* The call depth in overrun_check functions. For example, this might happen:
537 overrun_check_malloc()
538 -> malloc -> (via hook)_-> emacs_blocked_malloc
539 -> overrun_check_malloc
540 call malloc (hooks are NULL, so real malloc is called).
541 malloc returns 10000.
542 add overhead, return 10016.
543 <- (back in overrun_check_malloc)
544 add overhead again, return 10032
545 xmalloc returns 10032.
550 overrun_check_free(10032)
552 free(10016) <- crash, because 10000 is the original pointer. */
554 static int check_depth
;
556 /* Like malloc, but wraps allocated block with header and trailer. */
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. */
583 overrun_check_realloc (POINTER_TYPE
*block
, size_t size
)
585 register unsigned char *val
= (unsigned char *) block
;
586 size_t overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_SIZE
*2 : 0;
590 && memcmp (xmalloc_overrun_check_header
,
591 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
592 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
594 size_t osize
= XMALLOC_GET_SIZE (val
);
595 if (memcmp (xmalloc_overrun_check_trailer
, val
+ osize
,
596 XMALLOC_OVERRUN_CHECK_SIZE
))
598 memset (val
+ osize
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
599 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
600 memset (val
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
603 val
= (unsigned char *) realloc ((POINTER_TYPE
*)val
, size
+ overhead
);
605 if (val
&& check_depth
== 1)
607 memcpy (val
, xmalloc_overrun_check_header
,
608 XMALLOC_OVERRUN_CHECK_SIZE
- 4);
609 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
610 XMALLOC_PUT_SIZE(val
, size
);
611 memcpy (val
+ size
, xmalloc_overrun_check_trailer
,
612 XMALLOC_OVERRUN_CHECK_SIZE
);
615 return (POINTER_TYPE
*)val
;
618 /* Like free, but checks block for overrun. */
621 overrun_check_free (POINTER_TYPE
*block
)
623 unsigned char *val
= (unsigned char *) block
;
628 && memcmp (xmalloc_overrun_check_header
,
629 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
630 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
632 size_t osize
= XMALLOC_GET_SIZE (val
);
633 if (memcmp (xmalloc_overrun_check_trailer
, val
+ osize
,
634 XMALLOC_OVERRUN_CHECK_SIZE
))
636 #ifdef XMALLOC_CLEAR_FREE_MEMORY
637 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
638 memset (val
, 0xff, osize
+ XMALLOC_OVERRUN_CHECK_SIZE
*2);
640 memset (val
+ osize
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
641 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
642 memset (val
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
653 #define malloc overrun_check_malloc
654 #define realloc overrun_check_realloc
655 #define free overrun_check_free
659 /* When using SYNC_INPUT, we don't call malloc from a signal handler, so
660 there's no need to block input around malloc. */
661 #define MALLOC_BLOCK_INPUT ((void)0)
662 #define MALLOC_UNBLOCK_INPUT ((void)0)
664 #define MALLOC_BLOCK_INPUT BLOCK_INPUT
665 #define MALLOC_UNBLOCK_INPUT UNBLOCK_INPUT
668 /* Like malloc but check for no memory and block interrupt input.. */
671 xmalloc (size_t size
)
673 register POINTER_TYPE
*val
;
676 val
= (POINTER_TYPE
*) malloc (size
);
677 MALLOC_UNBLOCK_INPUT
;
685 /* Like realloc but check for no memory and block interrupt input.. */
688 xrealloc (POINTER_TYPE
*block
, size_t size
)
690 register POINTER_TYPE
*val
;
693 /* We must call malloc explicitly when BLOCK is 0, since some
694 reallocs don't do this. */
696 val
= (POINTER_TYPE
*) malloc (size
);
698 val
= (POINTER_TYPE
*) realloc (block
, size
);
699 MALLOC_UNBLOCK_INPUT
;
701 if (!val
&& size
) memory_full ();
706 /* Like free but block interrupt input. */
709 xfree (POINTER_TYPE
*block
)
715 MALLOC_UNBLOCK_INPUT
;
716 /* We don't call refill_memory_reserve here
717 because that duplicates doing so in emacs_blocked_free
718 and the criterion should go there. */
722 /* Like strdup, but uses xmalloc. */
725 xstrdup (const char *s
)
727 size_t len
= strlen (s
) + 1;
728 char *p
= (char *) xmalloc (len
);
734 /* Unwind for SAFE_ALLOCA */
737 safe_alloca_unwind (Lisp_Object arg
)
739 register struct Lisp_Save_Value
*p
= XSAVE_VALUE (arg
);
749 /* Like malloc but used for allocating Lisp data. NBYTES is the
750 number of bytes to allocate, TYPE describes the intended use of the
751 allcated memory block (for strings, for conses, ...). */
754 static void *lisp_malloc_loser
;
757 static POINTER_TYPE
*
758 lisp_malloc (size_t nbytes
, enum mem_type type
)
764 #ifdef GC_MALLOC_CHECK
765 allocated_mem_type
= type
;
768 val
= (void *) malloc (nbytes
);
771 /* If the memory just allocated cannot be addressed thru a Lisp
772 object's pointer, and it needs to be,
773 that's equivalent to running out of memory. */
774 if (val
&& type
!= MEM_TYPE_NON_LISP
)
777 XSETCONS (tem
, (char *) val
+ nbytes
- 1);
778 if ((char *) XCONS (tem
) != (char *) val
+ nbytes
- 1)
780 lisp_malloc_loser
= val
;
787 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
788 if (val
&& type
!= MEM_TYPE_NON_LISP
)
789 mem_insert (val
, (char *) val
+ nbytes
, type
);
792 MALLOC_UNBLOCK_INPUT
;
798 /* Free BLOCK. This must be called to free memory allocated with a
799 call to lisp_malloc. */
802 lisp_free (POINTER_TYPE
*block
)
806 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
807 mem_delete (mem_find (block
));
809 MALLOC_UNBLOCK_INPUT
;
812 /* Allocation of aligned blocks of memory to store Lisp data. */
813 /* The entry point is lisp_align_malloc which returns blocks of at most */
814 /* BLOCK_BYTES and guarantees they are aligned on a BLOCK_ALIGN boundary. */
816 /* Use posix_memalloc if the system has it and we're using the system's
817 malloc (because our gmalloc.c routines don't have posix_memalign although
818 its memalloc could be used). */
819 #if defined (HAVE_POSIX_MEMALIGN) && defined (SYSTEM_MALLOC)
820 #define USE_POSIX_MEMALIGN 1
823 /* BLOCK_ALIGN has to be a power of 2. */
824 #define BLOCK_ALIGN (1 << 10)
826 /* Padding to leave at the end of a malloc'd block. This is to give
827 malloc a chance to minimize the amount of memory wasted to alignment.
828 It should be tuned to the particular malloc library used.
829 On glibc-2.3.2, malloc never tries to align, so a padding of 0 is best.
830 posix_memalign on the other hand would ideally prefer a value of 4
831 because otherwise, there's 1020 bytes wasted between each ablocks.
832 In Emacs, testing shows that those 1020 can most of the time be
833 efficiently used by malloc to place other objects, so a value of 0 can
834 still preferable unless you have a lot of aligned blocks and virtually
836 #define BLOCK_PADDING 0
837 #define BLOCK_BYTES \
838 (BLOCK_ALIGN - sizeof (struct ablocks *) - BLOCK_PADDING)
840 /* Internal data structures and constants. */
842 #define ABLOCKS_SIZE 16
844 /* An aligned block of memory. */
849 char payload
[BLOCK_BYTES
];
850 struct ablock
*next_free
;
852 /* `abase' is the aligned base of the ablocks. */
853 /* It is overloaded to hold the virtual `busy' field that counts
854 the number of used ablock in the parent ablocks.
855 The first ablock has the `busy' field, the others have the `abase'
856 field. To tell the difference, we assume that pointers will have
857 integer values larger than 2 * ABLOCKS_SIZE. The lowest bit of `busy'
858 is used to tell whether the real base of the parent ablocks is `abase'
859 (if not, the word before the first ablock holds a pointer to the
861 struct ablocks
*abase
;
862 /* The padding of all but the last ablock is unused. The padding of
863 the last ablock in an ablocks is not allocated. */
865 char padding
[BLOCK_PADDING
];
869 /* A bunch of consecutive aligned blocks. */
872 struct ablock blocks
[ABLOCKS_SIZE
];
875 /* Size of the block requested from malloc or memalign. */
876 #define ABLOCKS_BYTES (sizeof (struct ablocks) - BLOCK_PADDING)
878 #define ABLOCK_ABASE(block) \
879 (((unsigned long) (block)->abase) <= (1 + 2 * ABLOCKS_SIZE) \
880 ? (struct ablocks *)(block) \
883 /* Virtual `busy' field. */
884 #define ABLOCKS_BUSY(abase) ((abase)->blocks[0].abase)
886 /* Pointer to the (not necessarily aligned) malloc block. */
887 #ifdef USE_POSIX_MEMALIGN
888 #define ABLOCKS_BASE(abase) (abase)
890 #define ABLOCKS_BASE(abase) \
891 (1 & (long) ABLOCKS_BUSY (abase) ? abase : ((void**)abase)[-1])
894 /* The list of free ablock. */
895 static struct ablock
*free_ablock
;
897 /* Allocate an aligned block of nbytes.
898 Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be
899 smaller or equal to BLOCK_BYTES. */
900 static POINTER_TYPE
*
901 lisp_align_malloc (size_t nbytes
, enum mem_type type
)
904 struct ablocks
*abase
;
906 eassert (nbytes
<= BLOCK_BYTES
);
910 #ifdef GC_MALLOC_CHECK
911 allocated_mem_type
= type
;
917 EMACS_INT aligned
; /* int gets warning casting to 64-bit pointer. */
919 #ifdef DOUG_LEA_MALLOC
920 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
921 because mapped region contents are not preserved in
923 mallopt (M_MMAP_MAX
, 0);
926 #ifdef USE_POSIX_MEMALIGN
928 int err
= posix_memalign (&base
, BLOCK_ALIGN
, ABLOCKS_BYTES
);
934 base
= malloc (ABLOCKS_BYTES
);
935 abase
= ALIGN (base
, BLOCK_ALIGN
);
940 MALLOC_UNBLOCK_INPUT
;
944 aligned
= (base
== abase
);
946 ((void**)abase
)[-1] = base
;
948 #ifdef DOUG_LEA_MALLOC
949 /* Back to a reasonable maximum of mmap'ed areas. */
950 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
954 /* If the memory just allocated cannot be addressed thru a Lisp
955 object's pointer, and it needs to be, that's equivalent to
956 running out of memory. */
957 if (type
!= MEM_TYPE_NON_LISP
)
960 char *end
= (char *) base
+ ABLOCKS_BYTES
- 1;
962 if ((char *) XCONS (tem
) != end
)
964 lisp_malloc_loser
= base
;
966 MALLOC_UNBLOCK_INPUT
;
972 /* Initialize the blocks and put them on the free list.
973 Is `base' was not properly aligned, we can't use the last block. */
974 for (i
= 0; i
< (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1); i
++)
976 abase
->blocks
[i
].abase
= abase
;
977 abase
->blocks
[i
].x
.next_free
= free_ablock
;
978 free_ablock
= &abase
->blocks
[i
];
980 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (long) aligned
;
982 eassert (0 == ((EMACS_UINT
)abase
) % BLOCK_ALIGN
);
983 eassert (ABLOCK_ABASE (&abase
->blocks
[3]) == abase
); /* 3 is arbitrary */
984 eassert (ABLOCK_ABASE (&abase
->blocks
[0]) == abase
);
985 eassert (ABLOCKS_BASE (abase
) == base
);
986 eassert (aligned
== (long) ABLOCKS_BUSY (abase
));
989 abase
= ABLOCK_ABASE (free_ablock
);
990 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (2 + (long) ABLOCKS_BUSY (abase
));
992 free_ablock
= free_ablock
->x
.next_free
;
994 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
995 if (val
&& type
!= MEM_TYPE_NON_LISP
)
996 mem_insert (val
, (char *) val
+ nbytes
, type
);
999 MALLOC_UNBLOCK_INPUT
;
1003 eassert (0 == ((EMACS_UINT
)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
) = (struct ablocks
*) (-2 + (long) ABLOCKS_BUSY (abase
));
1023 if (2 > (long) ABLOCKS_BUSY (abase
))
1024 { /* All the blocks are free. */
1025 int i
= 0, aligned
= (long) ABLOCKS_BUSY (abase
);
1026 struct ablock
**tem
= &free_ablock
;
1027 struct ablock
*atop
= &abase
->blocks
[aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1];
1031 if (*tem
>= (struct ablock
*) abase
&& *tem
< atop
)
1034 *tem
= (*tem
)->x
.next_free
;
1037 tem
= &(*tem
)->x
.next_free
;
1039 eassert ((aligned
& 1) == aligned
);
1040 eassert (i
== (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1));
1041 #ifdef USE_POSIX_MEMALIGN
1042 eassert ((unsigned long)ABLOCKS_BASE (abase
) % BLOCK_ALIGN
== 0);
1044 free (ABLOCKS_BASE (abase
));
1046 MALLOC_UNBLOCK_INPUT
;
1049 /* Return a new buffer structure allocated from the heap with
1050 a call to lisp_malloc. */
1053 allocate_buffer (void)
1056 = (struct buffer
*) lisp_malloc (sizeof (struct buffer
),
1058 b
->size
= ((sizeof (struct buffer
) + sizeof (EMACS_INT
) - 1)
1059 / sizeof (EMACS_INT
));
1060 XSETPVECTYPE (b
, PVEC_BUFFER
);
1065 #ifndef SYSTEM_MALLOC
1067 /* Arranging to disable input signals while we're in malloc.
1069 This only works with GNU malloc. To help out systems which can't
1070 use GNU malloc, all the calls to malloc, realloc, and free
1071 elsewhere in the code should be inside a BLOCK_INPUT/UNBLOCK_INPUT
1072 pair; unfortunately, we have no idea what C library functions
1073 might call malloc, so we can't really protect them unless you're
1074 using GNU malloc. Fortunately, most of the major operating systems
1075 can use GNU malloc. */
1078 /* When using SYNC_INPUT, we don't call malloc from a signal handler, so
1079 there's no need to block input around malloc. */
1081 #ifndef DOUG_LEA_MALLOC
1082 extern void * (*__malloc_hook
) (size_t, const void *);
1083 extern void * (*__realloc_hook
) (void *, size_t, const void *);
1084 extern void (*__free_hook
) (void *, const void *);
1085 /* Else declared in malloc.h, perhaps with an extra arg. */
1086 #endif /* DOUG_LEA_MALLOC */
1087 static void * (*old_malloc_hook
) (size_t, const void *);
1088 static void * (*old_realloc_hook
) (void *, size_t, const void*);
1089 static void (*old_free_hook
) (void*, const void*);
1091 #ifdef DOUG_LEA_MALLOC
1092 # define BYTES_USED (mallinfo ().uordblks)
1094 # define BYTES_USED _bytes_used
1097 static __malloc_size_t bytes_used_when_reconsidered
;
1099 /* Value of _bytes_used, when spare_memory was freed. */
1101 static __malloc_size_t bytes_used_when_full
;
1103 /* This function is used as the hook for free to call. */
1106 emacs_blocked_free (void *ptr
, const void *ptr2
)
1110 #ifdef GC_MALLOC_CHECK
1116 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1119 "Freeing `%p' which wasn't allocated with malloc\n", ptr
);
1124 /* fprintf (stderr, "free %p...%p (%p)\n", m->start, m->end, ptr); */
1128 #endif /* GC_MALLOC_CHECK */
1130 __free_hook
= old_free_hook
;
1133 /* If we released our reserve (due to running out of memory),
1134 and we have a fair amount free once again,
1135 try to set aside another reserve in case we run out once more. */
1136 if (! NILP (Vmemory_full
)
1137 /* Verify there is enough space that even with the malloc
1138 hysteresis this call won't run out again.
1139 The code here is correct as long as SPARE_MEMORY
1140 is substantially larger than the block size malloc uses. */
1141 && (bytes_used_when_full
1142 > ((bytes_used_when_reconsidered
= BYTES_USED
)
1143 + max (malloc_hysteresis
, 4) * SPARE_MEMORY
)))
1144 refill_memory_reserve ();
1146 __free_hook
= emacs_blocked_free
;
1147 UNBLOCK_INPUT_ALLOC
;
1151 /* This function is the malloc hook that Emacs uses. */
1154 emacs_blocked_malloc (size_t size
, const void *ptr
)
1159 __malloc_hook
= old_malloc_hook
;
1160 #ifdef DOUG_LEA_MALLOC
1161 /* Segfaults on my system. --lorentey */
1162 /* mallopt (M_TOP_PAD, malloc_hysteresis * 4096); */
1164 __malloc_extra_blocks
= malloc_hysteresis
;
1167 value
= (void *) malloc (size
);
1169 #ifdef GC_MALLOC_CHECK
1171 struct mem_node
*m
= mem_find (value
);
1174 fprintf (stderr
, "Malloc returned %p which is already in use\n",
1176 fprintf (stderr
, "Region in use is %p...%p, %u bytes, type %d\n",
1177 m
->start
, m
->end
, (char *) m
->end
- (char *) m
->start
,
1182 if (!dont_register_blocks
)
1184 mem_insert (value
, (char *) value
+ max (1, size
), allocated_mem_type
);
1185 allocated_mem_type
= MEM_TYPE_NON_LISP
;
1188 #endif /* GC_MALLOC_CHECK */
1190 __malloc_hook
= emacs_blocked_malloc
;
1191 UNBLOCK_INPUT_ALLOC
;
1193 /* fprintf (stderr, "%p malloc\n", value); */
1198 /* This function is the realloc hook that Emacs uses. */
1201 emacs_blocked_realloc (void *ptr
, size_t size
, const void *ptr2
)
1206 __realloc_hook
= old_realloc_hook
;
1208 #ifdef GC_MALLOC_CHECK
1211 struct mem_node
*m
= mem_find (ptr
);
1212 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1215 "Realloc of %p which wasn't allocated with malloc\n",
1223 /* fprintf (stderr, "%p -> realloc\n", ptr); */
1225 /* Prevent malloc from registering blocks. */
1226 dont_register_blocks
= 1;
1227 #endif /* GC_MALLOC_CHECK */
1229 value
= (void *) realloc (ptr
, size
);
1231 #ifdef GC_MALLOC_CHECK
1232 dont_register_blocks
= 0;
1235 struct mem_node
*m
= mem_find (value
);
1238 fprintf (stderr
, "Realloc returns memory that is already in use\n");
1242 /* Can't handle zero size regions in the red-black tree. */
1243 mem_insert (value
, (char *) value
+ max (size
, 1), MEM_TYPE_NON_LISP
);
1246 /* fprintf (stderr, "%p <- realloc\n", value); */
1247 #endif /* GC_MALLOC_CHECK */
1249 __realloc_hook
= emacs_blocked_realloc
;
1250 UNBLOCK_INPUT_ALLOC
;
1256 #ifdef HAVE_GTK_AND_PTHREAD
1257 /* Called from Fdump_emacs so that when the dumped Emacs starts, it has a
1258 normal malloc. Some thread implementations need this as they call
1259 malloc before main. The pthread_self call in BLOCK_INPUT_ALLOC then
1260 calls malloc because it is the first call, and we have an endless loop. */
1263 reset_malloc_hooks ()
1265 __free_hook
= old_free_hook
;
1266 __malloc_hook
= old_malloc_hook
;
1267 __realloc_hook
= old_realloc_hook
;
1269 #endif /* HAVE_GTK_AND_PTHREAD */
1272 /* Called from main to set up malloc to use our hooks. */
1275 uninterrupt_malloc (void)
1277 #ifdef HAVE_GTK_AND_PTHREAD
1278 #ifdef DOUG_LEA_MALLOC
1279 pthread_mutexattr_t attr
;
1281 /* GLIBC has a faster way to do this, but lets keep it portable.
1282 This is according to the Single UNIX Specification. */
1283 pthread_mutexattr_init (&attr
);
1284 pthread_mutexattr_settype (&attr
, PTHREAD_MUTEX_RECURSIVE
);
1285 pthread_mutex_init (&alloc_mutex
, &attr
);
1286 #else /* !DOUG_LEA_MALLOC */
1287 /* Some systems such as Solaris 2.6 don't have a recursive mutex,
1288 and the bundled gmalloc.c doesn't require it. */
1289 pthread_mutex_init (&alloc_mutex
, NULL
);
1290 #endif /* !DOUG_LEA_MALLOC */
1291 #endif /* HAVE_GTK_AND_PTHREAD */
1293 if (__free_hook
!= emacs_blocked_free
)
1294 old_free_hook
= __free_hook
;
1295 __free_hook
= emacs_blocked_free
;
1297 if (__malloc_hook
!= emacs_blocked_malloc
)
1298 old_malloc_hook
= __malloc_hook
;
1299 __malloc_hook
= emacs_blocked_malloc
;
1301 if (__realloc_hook
!= emacs_blocked_realloc
)
1302 old_realloc_hook
= __realloc_hook
;
1303 __realloc_hook
= emacs_blocked_realloc
;
1306 #endif /* not SYNC_INPUT */
1307 #endif /* not SYSTEM_MALLOC */
1311 /***********************************************************************
1313 ***********************************************************************/
1315 /* Number of intervals allocated in an interval_block structure.
1316 The 1020 is 1024 minus malloc overhead. */
1318 #define INTERVAL_BLOCK_SIZE \
1319 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
1321 /* Intervals are allocated in chunks in form of an interval_block
1324 struct interval_block
1326 /* Place `intervals' first, to preserve alignment. */
1327 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
1328 struct interval_block
*next
;
1331 /* Current interval block. Its `next' pointer points to older
1334 static struct interval_block
*interval_block
;
1336 /* Index in interval_block above of the next unused interval
1339 static int interval_block_index
;
1341 /* Number of free and live intervals. */
1343 static int total_free_intervals
, total_intervals
;
1345 /* List of free intervals. */
1347 static INTERVAL interval_free_list
;
1349 /* Total number of interval blocks now in use. */
1351 static int n_interval_blocks
;
1354 /* Initialize interval allocation. */
1357 init_intervals (void)
1359 interval_block
= NULL
;
1360 interval_block_index
= INTERVAL_BLOCK_SIZE
;
1361 interval_free_list
= 0;
1362 n_interval_blocks
= 0;
1366 /* Return a new interval. */
1369 make_interval (void)
1373 /* eassert (!handling_signal); */
1377 if (interval_free_list
)
1379 val
= interval_free_list
;
1380 interval_free_list
= INTERVAL_PARENT (interval_free_list
);
1384 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
1386 register struct interval_block
*newi
;
1388 newi
= (struct interval_block
*) lisp_malloc (sizeof *newi
,
1391 newi
->next
= interval_block
;
1392 interval_block
= newi
;
1393 interval_block_index
= 0;
1394 n_interval_blocks
++;
1396 val
= &interval_block
->intervals
[interval_block_index
++];
1399 MALLOC_UNBLOCK_INPUT
;
1401 consing_since_gc
+= sizeof (struct interval
);
1403 RESET_INTERVAL (val
);
1409 /* Mark Lisp objects in interval I. */
1412 mark_interval (register INTERVAL i
, Lisp_Object dummy
)
1414 eassert (!i
->gcmarkbit
); /* Intervals are never shared. */
1416 mark_object (i
->plist
);
1420 /* Mark the interval tree rooted in TREE. Don't call this directly;
1421 use the macro MARK_INTERVAL_TREE instead. */
1424 mark_interval_tree (register INTERVAL tree
)
1426 /* No need to test if this tree has been marked already; this
1427 function is always called through the MARK_INTERVAL_TREE macro,
1428 which takes care of that. */
1430 traverse_intervals_noorder (tree
, mark_interval
, Qnil
);
1434 /* Mark the interval tree rooted in I. */
1436 #define MARK_INTERVAL_TREE(i) \
1438 if (!NULL_INTERVAL_P (i) && !i->gcmarkbit) \
1439 mark_interval_tree (i); \
1443 #define UNMARK_BALANCE_INTERVALS(i) \
1445 if (! NULL_INTERVAL_P (i)) \
1446 (i) = balance_intervals (i); \
1450 /* Number support. If USE_LISP_UNION_TYPE is in effect, we
1451 can't create number objects in macros. */
1454 make_number (EMACS_INT n
)
1458 obj
.s
.type
= Lisp_Int
;
1463 /***********************************************************************
1465 ***********************************************************************/
1467 /* Lisp_Strings are allocated in string_block structures. When a new
1468 string_block is allocated, all the Lisp_Strings it contains are
1469 added to a free-list string_free_list. When a new Lisp_String is
1470 needed, it is taken from that list. During the sweep phase of GC,
1471 string_blocks that are entirely free are freed, except two which
1474 String data is allocated from sblock structures. Strings larger
1475 than LARGE_STRING_BYTES, get their own sblock, data for smaller
1476 strings is sub-allocated out of sblocks of size SBLOCK_SIZE.
1478 Sblocks consist internally of sdata structures, one for each
1479 Lisp_String. The sdata structure points to the Lisp_String it
1480 belongs to. The Lisp_String points back to the `u.data' member of
1481 its sdata structure.
1483 When a Lisp_String is freed during GC, it is put back on
1484 string_free_list, and its `data' member and its sdata's `string'
1485 pointer is set to null. The size of the string is recorded in the
1486 `u.nbytes' member of the sdata. So, sdata structures that are no
1487 longer used, can be easily recognized, and it's easy to compact the
1488 sblocks of small strings which we do in compact_small_strings. */
1490 /* Size in bytes of an sblock structure used for small strings. This
1491 is 8192 minus malloc overhead. */
1493 #define SBLOCK_SIZE 8188
1495 /* Strings larger than this are considered large strings. String data
1496 for large strings is allocated from individual sblocks. */
1498 #define LARGE_STRING_BYTES 1024
1500 /* Structure describing string memory sub-allocated from an sblock.
1501 This is where the contents of Lisp strings are stored. */
1505 /* Back-pointer to the string this sdata belongs to. If null, this
1506 structure is free, and the NBYTES member of the union below
1507 contains the string's byte size (the same value that STRING_BYTES
1508 would return if STRING were non-null). If non-null, STRING_BYTES
1509 (STRING) is the size of the data, and DATA contains the string's
1511 struct Lisp_String
*string
;
1513 #ifdef GC_CHECK_STRING_BYTES
1516 unsigned char data
[1];
1518 #define SDATA_NBYTES(S) (S)->nbytes
1519 #define SDATA_DATA(S) (S)->data
1520 #define SDATA_SELECTOR(member) member
1522 #else /* not GC_CHECK_STRING_BYTES */
1526 /* When STRING is non-null. */
1527 unsigned char data
[1];
1529 /* When STRING is null. */
1533 #define SDATA_NBYTES(S) (S)->u.nbytes
1534 #define SDATA_DATA(S) (S)->u.data
1535 #define SDATA_SELECTOR(member) u.member
1537 #endif /* not GC_CHECK_STRING_BYTES */
1539 #define SDATA_DATA_OFFSET offsetof (struct sdata, SDATA_SELECTOR (data))
1543 /* Structure describing a block of memory which is sub-allocated to
1544 obtain string data memory for strings. Blocks for small strings
1545 are of fixed size SBLOCK_SIZE. Blocks for large strings are made
1546 as large as needed. */
1551 struct sblock
*next
;
1553 /* Pointer to the next free sdata block. This points past the end
1554 of the sblock if there isn't any space left in this block. */
1555 struct sdata
*next_free
;
1557 /* Start of data. */
1558 struct sdata first_data
;
1561 /* Number of Lisp strings in a string_block structure. The 1020 is
1562 1024 minus malloc overhead. */
1564 #define STRING_BLOCK_SIZE \
1565 ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String))
1567 /* Structure describing a block from which Lisp_String structures
1572 /* Place `strings' first, to preserve alignment. */
1573 struct Lisp_String strings
[STRING_BLOCK_SIZE
];
1574 struct string_block
*next
;
1577 /* Head and tail of the list of sblock structures holding Lisp string
1578 data. We always allocate from current_sblock. The NEXT pointers
1579 in the sblock structures go from oldest_sblock to current_sblock. */
1581 static struct sblock
*oldest_sblock
, *current_sblock
;
1583 /* List of sblocks for large strings. */
1585 static struct sblock
*large_sblocks
;
1587 /* List of string_block structures, and how many there are. */
1589 static struct string_block
*string_blocks
;
1590 static int n_string_blocks
;
1592 /* Free-list of Lisp_Strings. */
1594 static struct Lisp_String
*string_free_list
;
1596 /* Number of live and free Lisp_Strings. */
1598 static int total_strings
, total_free_strings
;
1600 /* Number of bytes used by live strings. */
1602 static EMACS_INT total_string_size
;
1604 /* Given a pointer to a Lisp_String S which is on the free-list
1605 string_free_list, return a pointer to its successor in the
1608 #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S))
1610 /* Return a pointer to the sdata structure belonging to Lisp string S.
1611 S must be live, i.e. S->data must not be null. S->data is actually
1612 a pointer to the `u.data' member of its sdata structure; the
1613 structure starts at a constant offset in front of that. */
1615 #define SDATA_OF_STRING(S) ((struct sdata *) ((S)->data - SDATA_DATA_OFFSET))
1618 #ifdef GC_CHECK_STRING_OVERRUN
1620 /* We check for overrun in string data blocks by appending a small
1621 "cookie" after each allocated string data block, and check for the
1622 presence of this cookie during GC. */
1624 #define GC_STRING_OVERRUN_COOKIE_SIZE 4
1625 static char const string_overrun_cookie
[GC_STRING_OVERRUN_COOKIE_SIZE
] =
1626 { '\xde', '\xad', '\xbe', '\xef' };
1629 #define GC_STRING_OVERRUN_COOKIE_SIZE 0
1632 /* Value is the size of an sdata structure large enough to hold NBYTES
1633 bytes of string data. The value returned includes a terminating
1634 NUL byte, the size of the sdata structure, and padding. */
1636 #ifdef GC_CHECK_STRING_BYTES
1638 #define SDATA_SIZE(NBYTES) \
1639 ((SDATA_DATA_OFFSET \
1641 + sizeof (EMACS_INT) - 1) \
1642 & ~(sizeof (EMACS_INT) - 1))
1644 #else /* not GC_CHECK_STRING_BYTES */
1646 #define SDATA_SIZE(NBYTES) \
1647 ((SDATA_DATA_OFFSET \
1648 + max (NBYTES, sizeof (EMACS_INT) - 1) + 1 \
1649 + sizeof (EMACS_INT) - 1) \
1650 & ~(sizeof (EMACS_INT) - 1))
1652 #endif /* not GC_CHECK_STRING_BYTES */
1654 /* Extra bytes to allocate for each string. */
1656 #define GC_STRING_EXTRA (GC_STRING_OVERRUN_COOKIE_SIZE)
1658 /* Initialize string allocation. Called from init_alloc_once. */
1663 total_strings
= total_free_strings
= total_string_size
= 0;
1664 oldest_sblock
= current_sblock
= large_sblocks
= NULL
;
1665 string_blocks
= NULL
;
1666 n_string_blocks
= 0;
1667 string_free_list
= NULL
;
1668 empty_unibyte_string
= make_pure_string ("", 0, 0, 0);
1669 empty_multibyte_string
= make_pure_string ("", 0, 0, 1);
1673 #ifdef GC_CHECK_STRING_BYTES
1675 static int check_string_bytes_count
;
1677 #define CHECK_STRING_BYTES(S) STRING_BYTES (S)
1680 /* Like GC_STRING_BYTES, but with debugging check. */
1683 string_bytes (struct Lisp_String
*s
)
1686 (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1688 if (!PURE_POINTER_P (s
)
1690 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1695 /* Check validity of Lisp strings' string_bytes member in B. */
1698 check_sblock (struct sblock
*b
)
1700 struct sdata
*from
, *end
, *from_end
;
1704 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1706 /* Compute the next FROM here because copying below may
1707 overwrite data we need to compute it. */
1710 /* Check that the string size recorded in the string is the
1711 same as the one recorded in the sdata structure. */
1713 CHECK_STRING_BYTES (from
->string
);
1716 nbytes
= GC_STRING_BYTES (from
->string
);
1718 nbytes
= SDATA_NBYTES (from
);
1720 nbytes
= SDATA_SIZE (nbytes
);
1721 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
1726 /* Check validity of Lisp strings' string_bytes member. ALL_P
1727 non-zero means check all strings, otherwise check only most
1728 recently allocated strings. Used for hunting a bug. */
1731 check_string_bytes (int all_p
)
1737 for (b
= large_sblocks
; b
; b
= b
->next
)
1739 struct Lisp_String
*s
= b
->first_data
.string
;
1741 CHECK_STRING_BYTES (s
);
1744 for (b
= oldest_sblock
; b
; b
= b
->next
)
1748 check_sblock (current_sblock
);
1751 #endif /* GC_CHECK_STRING_BYTES */
1753 #ifdef GC_CHECK_STRING_FREE_LIST
1755 /* Walk through the string free list looking for bogus next pointers.
1756 This may catch buffer overrun from a previous string. */
1759 check_string_free_list (void)
1761 struct Lisp_String
*s
;
1763 /* Pop a Lisp_String off the free-list. */
1764 s
= string_free_list
;
1767 if ((unsigned long)s
< 1024)
1769 s
= NEXT_FREE_LISP_STRING (s
);
1773 #define check_string_free_list()
1776 /* Return a new Lisp_String. */
1778 static struct Lisp_String
*
1779 allocate_string (void)
1781 struct Lisp_String
*s
;
1783 /* eassert (!handling_signal); */
1787 /* If the free-list is empty, allocate a new string_block, and
1788 add all the Lisp_Strings in it to the free-list. */
1789 if (string_free_list
== NULL
)
1791 struct string_block
*b
;
1794 b
= (struct string_block
*) lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1795 memset (b
, 0, sizeof *b
);
1796 b
->next
= string_blocks
;
1800 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1803 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1804 string_free_list
= s
;
1807 total_free_strings
+= STRING_BLOCK_SIZE
;
1810 check_string_free_list ();
1812 /* Pop a Lisp_String off the free-list. */
1813 s
= string_free_list
;
1814 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1816 MALLOC_UNBLOCK_INPUT
;
1818 /* Probably not strictly necessary, but play it safe. */
1819 memset (s
, 0, sizeof *s
);
1821 --total_free_strings
;
1824 consing_since_gc
+= sizeof *s
;
1826 #ifdef GC_CHECK_STRING_BYTES
1827 if (!noninteractive
)
1829 if (++check_string_bytes_count
== 200)
1831 check_string_bytes_count
= 0;
1832 check_string_bytes (1);
1835 check_string_bytes (0);
1837 #endif /* GC_CHECK_STRING_BYTES */
1843 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1844 plus a NUL byte at the end. Allocate an sdata structure for S, and
1845 set S->data to its `u.data' member. Store a NUL byte at the end of
1846 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1847 S->data if it was initially non-null. */
1850 allocate_string_data (struct Lisp_String
*s
,
1851 EMACS_INT nchars
, EMACS_INT nbytes
)
1853 struct sdata
*data
, *old_data
;
1855 EMACS_INT needed
, old_nbytes
;
1857 /* Determine the number of bytes needed to store NBYTES bytes
1859 needed
= SDATA_SIZE (nbytes
);
1860 old_data
= s
->data
? SDATA_OF_STRING (s
) : NULL
;
1861 old_nbytes
= GC_STRING_BYTES (s
);
1865 if (nbytes
> LARGE_STRING_BYTES
)
1867 size_t size
= offsetof (struct sblock
, first_data
) + needed
;
1869 #ifdef DOUG_LEA_MALLOC
1870 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1871 because mapped region contents are not preserved in
1874 In case you think of allowing it in a dumped Emacs at the
1875 cost of not being able to re-dump, there's another reason:
1876 mmap'ed data typically have an address towards the top of the
1877 address space, which won't fit into an EMACS_INT (at least on
1878 32-bit systems with the current tagging scheme). --fx */
1879 mallopt (M_MMAP_MAX
, 0);
1882 b
= (struct sblock
*) lisp_malloc (size
+ GC_STRING_EXTRA
, MEM_TYPE_NON_LISP
);
1884 #ifdef DOUG_LEA_MALLOC
1885 /* Back to a reasonable maximum of mmap'ed areas. */
1886 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1889 b
->next_free
= &b
->first_data
;
1890 b
->first_data
.string
= NULL
;
1891 b
->next
= large_sblocks
;
1894 else if (current_sblock
== NULL
1895 || (((char *) current_sblock
+ SBLOCK_SIZE
1896 - (char *) current_sblock
->next_free
)
1897 < (needed
+ GC_STRING_EXTRA
)))
1899 /* Not enough room in the current sblock. */
1900 b
= (struct sblock
*) lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
1901 b
->next_free
= &b
->first_data
;
1902 b
->first_data
.string
= NULL
;
1906 current_sblock
->next
= b
;
1914 data
= b
->next_free
;
1915 b
->next_free
= (struct sdata
*) ((char *) data
+ needed
+ GC_STRING_EXTRA
);
1917 MALLOC_UNBLOCK_INPUT
;
1920 s
->data
= SDATA_DATA (data
);
1921 #ifdef GC_CHECK_STRING_BYTES
1922 SDATA_NBYTES (data
) = nbytes
;
1925 s
->size_byte
= nbytes
;
1926 s
->data
[nbytes
] = '\0';
1927 #ifdef GC_CHECK_STRING_OVERRUN
1928 memcpy ((char *) data
+ needed
, string_overrun_cookie
,
1929 GC_STRING_OVERRUN_COOKIE_SIZE
);
1932 /* If S had already data assigned, mark that as free by setting its
1933 string back-pointer to null, and recording the size of the data
1937 SDATA_NBYTES (old_data
) = old_nbytes
;
1938 old_data
->string
= NULL
;
1941 consing_since_gc
+= needed
;
1945 /* Sweep and compact strings. */
1948 sweep_strings (void)
1950 struct string_block
*b
, *next
;
1951 struct string_block
*live_blocks
= NULL
;
1953 string_free_list
= NULL
;
1954 total_strings
= total_free_strings
= 0;
1955 total_string_size
= 0;
1957 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
1958 for (b
= string_blocks
; b
; b
= next
)
1961 struct Lisp_String
*free_list_before
= string_free_list
;
1965 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
1967 struct Lisp_String
*s
= b
->strings
+ i
;
1971 /* String was not on free-list before. */
1972 if (STRING_MARKED_P (s
))
1974 /* String is live; unmark it and its intervals. */
1977 if (!NULL_INTERVAL_P (s
->intervals
))
1978 UNMARK_BALANCE_INTERVALS (s
->intervals
);
1981 total_string_size
+= STRING_BYTES (s
);
1985 /* String is dead. Put it on the free-list. */
1986 struct sdata
*data
= SDATA_OF_STRING (s
);
1988 /* Save the size of S in its sdata so that we know
1989 how large that is. Reset the sdata's string
1990 back-pointer so that we know it's free. */
1991 #ifdef GC_CHECK_STRING_BYTES
1992 if (GC_STRING_BYTES (s
) != SDATA_NBYTES (data
))
1995 data
->u
.nbytes
= GC_STRING_BYTES (s
);
1997 data
->string
= NULL
;
1999 /* Reset the strings's `data' member so that we
2003 /* Put the string on the free-list. */
2004 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2005 string_free_list
= s
;
2011 /* S was on the free-list before. Put it there again. */
2012 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2013 string_free_list
= s
;
2018 /* Free blocks that contain free Lisp_Strings only, except
2019 the first two of them. */
2020 if (nfree
== STRING_BLOCK_SIZE
2021 && total_free_strings
> STRING_BLOCK_SIZE
)
2025 string_free_list
= free_list_before
;
2029 total_free_strings
+= nfree
;
2030 b
->next
= live_blocks
;
2035 check_string_free_list ();
2037 string_blocks
= live_blocks
;
2038 free_large_strings ();
2039 compact_small_strings ();
2041 check_string_free_list ();
2045 /* Free dead large strings. */
2048 free_large_strings (void)
2050 struct sblock
*b
, *next
;
2051 struct sblock
*live_blocks
= NULL
;
2053 for (b
= large_sblocks
; b
; b
= next
)
2057 if (b
->first_data
.string
== NULL
)
2061 b
->next
= live_blocks
;
2066 large_sblocks
= live_blocks
;
2070 /* Compact data of small strings. Free sblocks that don't contain
2071 data of live strings after compaction. */
2074 compact_small_strings (void)
2076 struct sblock
*b
, *tb
, *next
;
2077 struct sdata
*from
, *to
, *end
, *tb_end
;
2078 struct sdata
*to_end
, *from_end
;
2080 /* TB is the sblock we copy to, TO is the sdata within TB we copy
2081 to, and TB_END is the end of TB. */
2083 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2084 to
= &tb
->first_data
;
2086 /* Step through the blocks from the oldest to the youngest. We
2087 expect that old blocks will stabilize over time, so that less
2088 copying will happen this way. */
2089 for (b
= oldest_sblock
; b
; b
= b
->next
)
2092 xassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
2094 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
2096 /* Compute the next FROM here because copying below may
2097 overwrite data we need to compute it. */
2100 #ifdef GC_CHECK_STRING_BYTES
2101 /* Check that the string size recorded in the string is the
2102 same as the one recorded in the sdata structure. */
2104 && GC_STRING_BYTES (from
->string
) != SDATA_NBYTES (from
))
2106 #endif /* GC_CHECK_STRING_BYTES */
2109 nbytes
= GC_STRING_BYTES (from
->string
);
2111 nbytes
= SDATA_NBYTES (from
);
2113 if (nbytes
> LARGE_STRING_BYTES
)
2116 nbytes
= SDATA_SIZE (nbytes
);
2117 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
2119 #ifdef GC_CHECK_STRING_OVERRUN
2120 if (memcmp (string_overrun_cookie
,
2121 (char *) from_end
- GC_STRING_OVERRUN_COOKIE_SIZE
,
2122 GC_STRING_OVERRUN_COOKIE_SIZE
))
2126 /* FROM->string non-null means it's alive. Copy its data. */
2129 /* If TB is full, proceed with the next sblock. */
2130 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2131 if (to_end
> tb_end
)
2135 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2136 to
= &tb
->first_data
;
2137 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2140 /* Copy, and update the string's `data' pointer. */
2143 xassert (tb
!= b
|| to
<= from
);
2144 memmove (to
, from
, nbytes
+ GC_STRING_EXTRA
);
2145 to
->string
->data
= SDATA_DATA (to
);
2148 /* Advance past the sdata we copied to. */
2154 /* The rest of the sblocks following TB don't contain live data, so
2155 we can free them. */
2156 for (b
= tb
->next
; b
; b
= next
)
2164 current_sblock
= tb
;
2168 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
2169 doc
: /* Return a newly created string of length LENGTH, with INIT in each element.
2170 LENGTH must be an integer.
2171 INIT must be an integer that represents a character. */)
2172 (Lisp_Object length
, Lisp_Object init
)
2174 register Lisp_Object val
;
2175 register unsigned char *p
, *end
;
2179 CHECK_NATNUM (length
);
2180 CHECK_NUMBER (init
);
2183 if (ASCII_CHAR_P (c
))
2185 nbytes
= XINT (length
);
2186 val
= make_uninit_string (nbytes
);
2188 end
= p
+ SCHARS (val
);
2194 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
2195 int len
= CHAR_STRING (c
, str
);
2196 EMACS_INT string_len
= XINT (length
);
2198 if (string_len
> MOST_POSITIVE_FIXNUM
/ len
)
2199 error ("Maximum string size exceeded");
2200 nbytes
= len
* string_len
;
2201 val
= make_uninit_multibyte_string (string_len
, nbytes
);
2206 memcpy (p
, str
, len
);
2216 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
2217 doc
: /* Return a new bool-vector of length LENGTH, using INIT for each element.
2218 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
2219 (Lisp_Object length
, Lisp_Object init
)
2221 register Lisp_Object val
;
2222 struct Lisp_Bool_Vector
*p
;
2224 EMACS_INT length_in_chars
, length_in_elts
;
2227 CHECK_NATNUM (length
);
2229 bits_per_value
= sizeof (EMACS_INT
) * BOOL_VECTOR_BITS_PER_CHAR
;
2231 length_in_elts
= (XFASTINT (length
) + bits_per_value
- 1) / bits_per_value
;
2232 length_in_chars
= ((XFASTINT (length
) + BOOL_VECTOR_BITS_PER_CHAR
- 1)
2233 / BOOL_VECTOR_BITS_PER_CHAR
);
2235 /* We must allocate one more elements than LENGTH_IN_ELTS for the
2236 slot `size' of the struct Lisp_Bool_Vector. */
2237 val
= Fmake_vector (make_number (length_in_elts
+ 1), Qnil
);
2239 /* Get rid of any bits that would cause confusion. */
2240 XVECTOR (val
)->size
= 0; /* No Lisp_Object to trace in there. */
2241 /* Use XVECTOR (val) rather than `p' because p->size is not TRT. */
2242 XSETPVECTYPE (XVECTOR (val
), PVEC_BOOL_VECTOR
);
2244 p
= XBOOL_VECTOR (val
);
2245 p
->size
= XFASTINT (length
);
2247 real_init
= (NILP (init
) ? 0 : -1);
2248 for (i
= 0; i
< length_in_chars
; i
++)
2249 p
->data
[i
] = real_init
;
2251 /* Clear the extraneous bits in the last byte. */
2252 if (XINT (length
) != length_in_chars
* BOOL_VECTOR_BITS_PER_CHAR
)
2253 p
->data
[length_in_chars
- 1]
2254 &= (1 << (XINT (length
) % BOOL_VECTOR_BITS_PER_CHAR
)) - 1;
2260 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
2261 of characters from the contents. This string may be unibyte or
2262 multibyte, depending on the contents. */
2265 make_string (const char *contents
, EMACS_INT nbytes
)
2267 register Lisp_Object val
;
2268 EMACS_INT nchars
, multibyte_nbytes
;
2270 parse_str_as_multibyte ((const unsigned char *) contents
, nbytes
,
2271 &nchars
, &multibyte_nbytes
);
2272 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
2273 /* CONTENTS contains no multibyte sequences or contains an invalid
2274 multibyte sequence. We must make unibyte string. */
2275 val
= make_unibyte_string (contents
, nbytes
);
2277 val
= make_multibyte_string (contents
, nchars
, nbytes
);
2282 /* Make an unibyte string from LENGTH bytes at CONTENTS. */
2285 make_unibyte_string (const char *contents
, EMACS_INT length
)
2287 register Lisp_Object val
;
2288 val
= make_uninit_string (length
);
2289 memcpy (SDATA (val
), contents
, length
);
2294 /* Make a multibyte string from NCHARS characters occupying NBYTES
2295 bytes at CONTENTS. */
2298 make_multibyte_string (const char *contents
,
2299 EMACS_INT nchars
, EMACS_INT nbytes
)
2301 register Lisp_Object val
;
2302 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2303 memcpy (SDATA (val
), contents
, nbytes
);
2308 /* Make a string from NCHARS characters occupying NBYTES bytes at
2309 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2312 make_string_from_bytes (const char *contents
,
2313 EMACS_INT nchars
, EMACS_INT nbytes
)
2315 register Lisp_Object val
;
2316 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2317 memcpy (SDATA (val
), contents
, nbytes
);
2318 if (SBYTES (val
) == SCHARS (val
))
2319 STRING_SET_UNIBYTE (val
);
2324 /* Make a string from NCHARS characters occupying NBYTES bytes at
2325 CONTENTS. The argument MULTIBYTE controls whether to label the
2326 string as multibyte. If NCHARS is negative, it counts the number of
2327 characters by itself. */
2330 make_specified_string (const char *contents
,
2331 EMACS_INT nchars
, EMACS_INT nbytes
, int multibyte
)
2333 register Lisp_Object val
;
2338 nchars
= multibyte_chars_in_text ((const unsigned char *) contents
,
2343 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2344 memcpy (SDATA (val
), contents
, nbytes
);
2346 STRING_SET_UNIBYTE (val
);
2351 /* Make a string from the data at STR, treating it as multibyte if the
2355 build_string (const char *str
)
2357 return make_string (str
, strlen (str
));
2361 /* Return an unibyte Lisp_String set up to hold LENGTH characters
2362 occupying LENGTH bytes. */
2365 make_uninit_string (EMACS_INT length
)
2370 return empty_unibyte_string
;
2371 val
= make_uninit_multibyte_string (length
, length
);
2372 STRING_SET_UNIBYTE (val
);
2377 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2378 which occupy NBYTES bytes. */
2381 make_uninit_multibyte_string (EMACS_INT nchars
, EMACS_INT nbytes
)
2384 struct Lisp_String
*s
;
2389 return empty_multibyte_string
;
2391 s
= allocate_string ();
2392 allocate_string_data (s
, nchars
, nbytes
);
2393 XSETSTRING (string
, s
);
2394 string_chars_consed
+= nbytes
;
2400 /***********************************************************************
2402 ***********************************************************************/
2404 /* We store float cells inside of float_blocks, allocating a new
2405 float_block with malloc whenever necessary. Float cells reclaimed
2406 by GC are put on a free list to be reallocated before allocating
2407 any new float cells from the latest float_block. */
2409 #define FLOAT_BLOCK_SIZE \
2410 (((BLOCK_BYTES - sizeof (struct float_block *) \
2411 /* The compiler might add padding at the end. */ \
2412 - (sizeof (struct Lisp_Float) - sizeof (int))) * CHAR_BIT) \
2413 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2415 #define GETMARKBIT(block,n) \
2416 (((block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2417 >> ((n) % (sizeof(int) * CHAR_BIT))) \
2420 #define SETMARKBIT(block,n) \
2421 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2422 |= 1 << ((n) % (sizeof(int) * CHAR_BIT))
2424 #define UNSETMARKBIT(block,n) \
2425 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2426 &= ~(1 << ((n) % (sizeof(int) * CHAR_BIT)))
2428 #define FLOAT_BLOCK(fptr) \
2429 ((struct float_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2431 #define FLOAT_INDEX(fptr) \
2432 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2436 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2437 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2438 int gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2439 struct float_block
*next
;
2442 #define FLOAT_MARKED_P(fptr) \
2443 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2445 #define FLOAT_MARK(fptr) \
2446 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2448 #define FLOAT_UNMARK(fptr) \
2449 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2451 /* Current float_block. */
2453 static struct float_block
*float_block
;
2455 /* Index of first unused Lisp_Float in the current float_block. */
2457 static int float_block_index
;
2459 /* Total number of float blocks now in use. */
2461 static int n_float_blocks
;
2463 /* Free-list of Lisp_Floats. */
2465 static struct Lisp_Float
*float_free_list
;
2468 /* Initialize float allocation. */
2474 float_block_index
= FLOAT_BLOCK_SIZE
; /* Force alloc of new float_block. */
2475 float_free_list
= 0;
2480 /* Return a new float object with value FLOAT_VALUE. */
2483 make_float (double float_value
)
2485 register Lisp_Object val
;
2487 /* eassert (!handling_signal); */
2491 if (float_free_list
)
2493 /* We use the data field for chaining the free list
2494 so that we won't use the same field that has the mark bit. */
2495 XSETFLOAT (val
, float_free_list
);
2496 float_free_list
= float_free_list
->u
.chain
;
2500 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2502 register struct float_block
*new;
2504 new = (struct float_block
*) lisp_align_malloc (sizeof *new,
2506 new->next
= float_block
;
2507 memset (new->gcmarkbits
, 0, sizeof new->gcmarkbits
);
2509 float_block_index
= 0;
2512 XSETFLOAT (val
, &float_block
->floats
[float_block_index
]);
2513 float_block_index
++;
2516 MALLOC_UNBLOCK_INPUT
;
2518 XFLOAT_INIT (val
, float_value
);
2519 eassert (!FLOAT_MARKED_P (XFLOAT (val
)));
2520 consing_since_gc
+= sizeof (struct Lisp_Float
);
2527 /***********************************************************************
2529 ***********************************************************************/
2531 /* We store cons cells inside of cons_blocks, allocating a new
2532 cons_block with malloc whenever necessary. Cons cells reclaimed by
2533 GC are put on a free list to be reallocated before allocating
2534 any new cons cells from the latest cons_block. */
2536 #define CONS_BLOCK_SIZE \
2537 (((BLOCK_BYTES - sizeof (struct cons_block *)) * CHAR_BIT) \
2538 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2540 #define CONS_BLOCK(fptr) \
2541 ((struct cons_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2543 #define CONS_INDEX(fptr) \
2544 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2548 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2549 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2550 int gcmarkbits
[1 + CONS_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2551 struct cons_block
*next
;
2554 #define CONS_MARKED_P(fptr) \
2555 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2557 #define CONS_MARK(fptr) \
2558 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2560 #define CONS_UNMARK(fptr) \
2561 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2563 /* Current cons_block. */
2565 static struct cons_block
*cons_block
;
2567 /* Index of first unused Lisp_Cons in the current block. */
2569 static int cons_block_index
;
2571 /* Free-list of Lisp_Cons structures. */
2573 static struct Lisp_Cons
*cons_free_list
;
2575 /* Total number of cons blocks now in use. */
2577 static int n_cons_blocks
;
2580 /* Initialize cons allocation. */
2586 cons_block_index
= CONS_BLOCK_SIZE
; /* Force alloc of new cons_block. */
2592 /* Explicitly free a cons cell by putting it on the free-list. */
2595 free_cons (struct Lisp_Cons
*ptr
)
2597 ptr
->u
.chain
= cons_free_list
;
2601 cons_free_list
= ptr
;
2604 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
2605 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2606 (Lisp_Object car
, Lisp_Object cdr
)
2608 register Lisp_Object val
;
2610 /* eassert (!handling_signal); */
2616 /* We use the cdr for chaining the free list
2617 so that we won't use the same field that has the mark bit. */
2618 XSETCONS (val
, cons_free_list
);
2619 cons_free_list
= cons_free_list
->u
.chain
;
2623 if (cons_block_index
== CONS_BLOCK_SIZE
)
2625 register struct cons_block
*new;
2626 new = (struct cons_block
*) lisp_align_malloc (sizeof *new,
2628 memset (new->gcmarkbits
, 0, sizeof new->gcmarkbits
);
2629 new->next
= cons_block
;
2631 cons_block_index
= 0;
2634 XSETCONS (val
, &cons_block
->conses
[cons_block_index
]);
2638 MALLOC_UNBLOCK_INPUT
;
2642 eassert (!CONS_MARKED_P (XCONS (val
)));
2643 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2644 cons_cells_consed
++;
2648 #ifdef GC_CHECK_CONS_LIST
2649 /* Get an error now if there's any junk in the cons free list. */
2651 check_cons_list (void)
2653 struct Lisp_Cons
*tail
= cons_free_list
;
2656 tail
= tail
->u
.chain
;
2660 /* Make a list of 1, 2, 3, 4 or 5 specified objects. */
2663 list1 (Lisp_Object arg1
)
2665 return Fcons (arg1
, Qnil
);
2669 list2 (Lisp_Object arg1
, Lisp_Object arg2
)
2671 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2676 list3 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
)
2678 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2683 list4 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
, Lisp_Object arg4
)
2685 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2690 list5 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
, Lisp_Object arg4
, Lisp_Object arg5
)
2692 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2693 Fcons (arg5
, Qnil
)))));
2697 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
2698 doc
: /* Return a newly created list with specified arguments as elements.
2699 Any number of arguments, even zero arguments, are allowed.
2700 usage: (list &rest OBJECTS) */)
2701 (size_t nargs
, register Lisp_Object
*args
)
2703 register Lisp_Object val
;
2709 val
= Fcons (args
[nargs
], val
);
2715 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2716 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2717 (register Lisp_Object length
, Lisp_Object init
)
2719 register Lisp_Object val
;
2720 register EMACS_INT size
;
2722 CHECK_NATNUM (length
);
2723 size
= XFASTINT (length
);
2728 val
= Fcons (init
, val
);
2733 val
= Fcons (init
, val
);
2738 val
= Fcons (init
, val
);
2743 val
= Fcons (init
, val
);
2748 val
= Fcons (init
, val
);
2763 /***********************************************************************
2765 ***********************************************************************/
2767 /* Singly-linked list of all vectors. */
2769 static struct Lisp_Vector
*all_vectors
;
2771 /* Total number of vector-like objects now in use. */
2773 static int n_vectors
;
2776 /* Value is a pointer to a newly allocated Lisp_Vector structure
2777 with room for LEN Lisp_Objects. */
2779 static struct Lisp_Vector
*
2780 allocate_vectorlike (EMACS_INT len
)
2782 struct Lisp_Vector
*p
;
2787 #ifdef DOUG_LEA_MALLOC
2788 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
2789 because mapped region contents are not preserved in
2791 mallopt (M_MMAP_MAX
, 0);
2794 /* This gets triggered by code which I haven't bothered to fix. --Stef */
2795 /* eassert (!handling_signal); */
2797 nbytes
= (offsetof (struct Lisp_Vector
, contents
)
2798 + len
* sizeof p
->contents
[0]);
2799 p
= (struct Lisp_Vector
*) lisp_malloc (nbytes
, MEM_TYPE_VECTORLIKE
);
2801 #ifdef DOUG_LEA_MALLOC
2802 /* Back to a reasonable maximum of mmap'ed areas. */
2803 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2806 consing_since_gc
+= nbytes
;
2807 vector_cells_consed
+= len
;
2809 p
->next
= all_vectors
;
2812 MALLOC_UNBLOCK_INPUT
;
2819 /* Allocate a vector with NSLOTS slots. */
2821 struct Lisp_Vector
*
2822 allocate_vector (EMACS_INT nslots
)
2824 struct Lisp_Vector
*v
= allocate_vectorlike (nslots
);
2830 /* Allocate other vector-like structures. */
2832 struct Lisp_Vector
*
2833 allocate_pseudovector (int memlen
, int lisplen
, EMACS_INT tag
)
2835 struct Lisp_Vector
*v
= allocate_vectorlike (memlen
);
2838 /* Only the first lisplen slots will be traced normally by the GC. */
2840 for (i
= 0; i
< lisplen
; ++i
)
2841 v
->contents
[i
] = Qnil
;
2843 XSETPVECTYPE (v
, tag
); /* Add the appropriate tag. */
2847 struct Lisp_Hash_Table
*
2848 allocate_hash_table (void)
2850 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Hash_Table
, count
, PVEC_HASH_TABLE
);
2855 allocate_window (void)
2857 return ALLOCATE_PSEUDOVECTOR(struct window
, current_matrix
, PVEC_WINDOW
);
2862 allocate_terminal (void)
2864 struct terminal
*t
= ALLOCATE_PSEUDOVECTOR (struct terminal
,
2865 next_terminal
, PVEC_TERMINAL
);
2866 /* Zero out the non-GC'd fields. FIXME: This should be made unnecessary. */
2867 memset (&t
->next_terminal
, 0,
2868 (char*) (t
+ 1) - (char*) &t
->next_terminal
);
2874 allocate_frame (void)
2876 struct frame
*f
= ALLOCATE_PSEUDOVECTOR (struct frame
,
2877 face_cache
, PVEC_FRAME
);
2878 /* Zero out the non-GC'd fields. FIXME: This should be made unnecessary. */
2879 memset (&f
->face_cache
, 0,
2880 (char *) (f
+ 1) - (char *) &f
->face_cache
);
2885 struct Lisp_Process
*
2886 allocate_process (void)
2888 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Process
, pid
, PVEC_PROCESS
);
2892 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
2893 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
2894 See also the function `vector'. */)
2895 (register Lisp_Object length
, Lisp_Object init
)
2898 register EMACS_INT sizei
;
2899 register EMACS_INT i
;
2900 register struct Lisp_Vector
*p
;
2902 CHECK_NATNUM (length
);
2903 sizei
= XFASTINT (length
);
2905 p
= allocate_vector (sizei
);
2906 for (i
= 0; i
< sizei
; i
++)
2907 p
->contents
[i
] = init
;
2909 XSETVECTOR (vector
, p
);
2914 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
2915 doc
: /* Return a newly created vector with specified arguments as elements.
2916 Any number of arguments, even zero arguments, are allowed.
2917 usage: (vector &rest OBJECTS) */)
2918 (register size_t nargs
, Lisp_Object
*args
)
2920 register Lisp_Object len
, val
;
2922 register struct Lisp_Vector
*p
;
2924 XSETFASTINT (len
, nargs
);
2925 val
= Fmake_vector (len
, Qnil
);
2927 for (i
= 0; i
< nargs
; i
++)
2928 p
->contents
[i
] = args
[i
];
2933 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
2934 doc
: /* Create a byte-code object with specified arguments as elements.
2935 The arguments should be the ARGLIST, bytecode-string BYTE-CODE, constant
2936 vector CONSTANTS, maximum stack size DEPTH, (optional) DOCSTRING,
2937 and (optional) INTERACTIVE-SPEC.
2938 The first four arguments are required; at most six have any
2940 The ARGLIST can be either like the one of `lambda', in which case the arguments
2941 will be dynamically bound before executing the byte code, or it can be an
2942 integer of the form NNNNNNNRMMMMMMM where the 7bit MMMMMMM specifies the
2943 minimum number of arguments, the 7-bit NNNNNNN specifies the maximum number
2944 of arguments (ignoring &rest) and the R bit specifies whether there is a &rest
2945 argument to catch the left-over arguments. If such an integer is used, the
2946 arguments will not be dynamically bound but will be instead pushed on the
2947 stack before executing the byte-code.
2948 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
2949 (register size_t nargs
, Lisp_Object
*args
)
2951 register Lisp_Object len
, val
;
2953 register struct Lisp_Vector
*p
;
2955 XSETFASTINT (len
, nargs
);
2956 if (!NILP (Vpurify_flag
))
2957 val
= make_pure_vector ((EMACS_INT
) nargs
);
2959 val
= Fmake_vector (len
, Qnil
);
2961 if (nargs
> 1 && STRINGP (args
[1]) && STRING_MULTIBYTE (args
[1]))
2962 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
2963 earlier because they produced a raw 8-bit string for byte-code
2964 and now such a byte-code string is loaded as multibyte while
2965 raw 8-bit characters converted to multibyte form. Thus, now we
2966 must convert them back to the original unibyte form. */
2967 args
[1] = Fstring_as_unibyte (args
[1]);
2970 for (i
= 0; i
< nargs
; i
++)
2972 if (!NILP (Vpurify_flag
))
2973 args
[i
] = Fpurecopy (args
[i
]);
2974 p
->contents
[i
] = args
[i
];
2976 XSETPVECTYPE (p
, PVEC_COMPILED
);
2977 XSETCOMPILED (val
, p
);
2983 /***********************************************************************
2985 ***********************************************************************/
2987 /* Each symbol_block is just under 1020 bytes long, since malloc
2988 really allocates in units of powers of two and uses 4 bytes for its
2991 #define SYMBOL_BLOCK_SIZE \
2992 ((1020 - sizeof (struct symbol_block *)) / sizeof (struct Lisp_Symbol))
2996 /* Place `symbols' first, to preserve alignment. */
2997 struct Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
2998 struct symbol_block
*next
;
3001 /* Current symbol block and index of first unused Lisp_Symbol
3004 static struct symbol_block
*symbol_block
;
3005 static int symbol_block_index
;
3007 /* List of free symbols. */
3009 static struct Lisp_Symbol
*symbol_free_list
;
3011 /* Total number of symbol blocks now in use. */
3013 static int n_symbol_blocks
;
3016 /* Initialize symbol allocation. */
3021 symbol_block
= NULL
;
3022 symbol_block_index
= SYMBOL_BLOCK_SIZE
;
3023 symbol_free_list
= 0;
3024 n_symbol_blocks
= 0;
3028 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
3029 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
3030 Its value and function definition are void, and its property list is nil. */)
3033 register Lisp_Object val
;
3034 register struct Lisp_Symbol
*p
;
3036 CHECK_STRING (name
);
3038 /* eassert (!handling_signal); */
3042 if (symbol_free_list
)
3044 XSETSYMBOL (val
, symbol_free_list
);
3045 symbol_free_list
= symbol_free_list
->next
;
3049 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
3051 struct symbol_block
*new;
3052 new = (struct symbol_block
*) lisp_malloc (sizeof *new,
3054 new->next
= symbol_block
;
3056 symbol_block_index
= 0;
3059 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
]);
3060 symbol_block_index
++;
3063 MALLOC_UNBLOCK_INPUT
;
3068 p
->redirect
= SYMBOL_PLAINVAL
;
3069 SET_SYMBOL_VAL (p
, Qunbound
);
3070 p
->function
= Qunbound
;
3073 p
->interned
= SYMBOL_UNINTERNED
;
3075 p
->declared_special
= 0;
3076 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
3083 /***********************************************************************
3084 Marker (Misc) Allocation
3085 ***********************************************************************/
3087 /* Allocation of markers and other objects that share that structure.
3088 Works like allocation of conses. */
3090 #define MARKER_BLOCK_SIZE \
3091 ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc))
3095 /* Place `markers' first, to preserve alignment. */
3096 union Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
3097 struct marker_block
*next
;
3100 static struct marker_block
*marker_block
;
3101 static int marker_block_index
;
3103 static union Lisp_Misc
*marker_free_list
;
3105 /* Total number of marker blocks now in use. */
3107 static int n_marker_blocks
;
3112 marker_block
= NULL
;
3113 marker_block_index
= MARKER_BLOCK_SIZE
;
3114 marker_free_list
= 0;
3115 n_marker_blocks
= 0;
3118 /* Return a newly allocated Lisp_Misc object, with no substructure. */
3121 allocate_misc (void)
3125 /* eassert (!handling_signal); */
3129 if (marker_free_list
)
3131 XSETMISC (val
, marker_free_list
);
3132 marker_free_list
= marker_free_list
->u_free
.chain
;
3136 if (marker_block_index
== MARKER_BLOCK_SIZE
)
3138 struct marker_block
*new;
3139 new = (struct marker_block
*) lisp_malloc (sizeof *new,
3141 new->next
= marker_block
;
3143 marker_block_index
= 0;
3145 total_free_markers
+= MARKER_BLOCK_SIZE
;
3147 XSETMISC (val
, &marker_block
->markers
[marker_block_index
]);
3148 marker_block_index
++;
3151 MALLOC_UNBLOCK_INPUT
;
3153 --total_free_markers
;
3154 consing_since_gc
+= sizeof (union Lisp_Misc
);
3155 misc_objects_consed
++;
3156 XMISCANY (val
)->gcmarkbit
= 0;
3160 /* Free a Lisp_Misc object */
3163 free_misc (Lisp_Object misc
)
3165 XMISCTYPE (misc
) = Lisp_Misc_Free
;
3166 XMISC (misc
)->u_free
.chain
= marker_free_list
;
3167 marker_free_list
= XMISC (misc
);
3169 total_free_markers
++;
3172 /* Return a Lisp_Misc_Save_Value object containing POINTER and
3173 INTEGER. This is used to package C values to call record_unwind_protect.
3174 The unwind function can get the C values back using XSAVE_VALUE. */
3177 make_save_value (void *pointer
, int integer
)
3179 register Lisp_Object val
;
3180 register struct Lisp_Save_Value
*p
;
3182 val
= allocate_misc ();
3183 XMISCTYPE (val
) = Lisp_Misc_Save_Value
;
3184 p
= XSAVE_VALUE (val
);
3185 p
->pointer
= pointer
;
3186 p
->integer
= integer
;
3191 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
3192 doc
: /* Return a newly allocated marker which does not point at any place. */)
3195 register Lisp_Object val
;
3196 register struct Lisp_Marker
*p
;
3198 val
= allocate_misc ();
3199 XMISCTYPE (val
) = Lisp_Misc_Marker
;
3205 p
->insertion_type
= 0;
3209 /* Put MARKER back on the free list after using it temporarily. */
3212 free_marker (Lisp_Object marker
)
3214 unchain_marker (XMARKER (marker
));
3219 /* Return a newly created vector or string with specified arguments as
3220 elements. If all the arguments are characters that can fit
3221 in a string of events, make a string; otherwise, make a vector.
3223 Any number of arguments, even zero arguments, are allowed. */
3226 make_event_array (register int nargs
, Lisp_Object
*args
)
3230 for (i
= 0; i
< nargs
; i
++)
3231 /* The things that fit in a string
3232 are characters that are in 0...127,
3233 after discarding the meta bit and all the bits above it. */
3234 if (!INTEGERP (args
[i
])
3235 || (XUINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
3236 return Fvector (nargs
, args
);
3238 /* Since the loop exited, we know that all the things in it are
3239 characters, so we can make a string. */
3243 result
= Fmake_string (make_number (nargs
), make_number (0));
3244 for (i
= 0; i
< nargs
; i
++)
3246 SSET (result
, i
, XINT (args
[i
]));
3247 /* Move the meta bit to the right place for a string char. */
3248 if (XINT (args
[i
]) & CHAR_META
)
3249 SSET (result
, i
, SREF (result
, i
) | 0x80);
3258 /************************************************************************
3259 Memory Full Handling
3260 ************************************************************************/
3263 /* Called if malloc returns zero. */
3272 memory_full_cons_threshold
= sizeof (struct cons_block
);
3274 /* The first time we get here, free the spare memory. */
3275 for (i
= 0; i
< sizeof (spare_memory
) / sizeof (char *); i
++)
3276 if (spare_memory
[i
])
3279 free (spare_memory
[i
]);
3280 else if (i
>= 1 && i
<= 4)
3281 lisp_align_free (spare_memory
[i
]);
3283 lisp_free (spare_memory
[i
]);
3284 spare_memory
[i
] = 0;
3287 /* Record the space now used. When it decreases substantially,
3288 we can refill the memory reserve. */
3289 #if !defined SYSTEM_MALLOC && !defined SYNC_INPUT
3290 bytes_used_when_full
= BYTES_USED
;
3293 /* This used to call error, but if we've run out of memory, we could
3294 get infinite recursion trying to build the string. */
3295 xsignal (Qnil
, Vmemory_signal_data
);
3298 /* If we released our reserve (due to running out of memory),
3299 and we have a fair amount free once again,
3300 try to set aside another reserve in case we run out once more.
3302 This is called when a relocatable block is freed in ralloc.c,
3303 and also directly from this file, in case we're not using ralloc.c. */
3306 refill_memory_reserve (void)
3308 #ifndef SYSTEM_MALLOC
3309 if (spare_memory
[0] == 0)
3310 spare_memory
[0] = (char *) malloc ((size_t) SPARE_MEMORY
);
3311 if (spare_memory
[1] == 0)
3312 spare_memory
[1] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3314 if (spare_memory
[2] == 0)
3315 spare_memory
[2] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3317 if (spare_memory
[3] == 0)
3318 spare_memory
[3] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3320 if (spare_memory
[4] == 0)
3321 spare_memory
[4] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3323 if (spare_memory
[5] == 0)
3324 spare_memory
[5] = (char *) lisp_malloc (sizeof (struct string_block
),
3326 if (spare_memory
[6] == 0)
3327 spare_memory
[6] = (char *) lisp_malloc (sizeof (struct string_block
),
3329 if (spare_memory
[0] && spare_memory
[1] && spare_memory
[5])
3330 Vmemory_full
= Qnil
;
3334 /************************************************************************
3336 ************************************************************************/
3338 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
3340 /* Conservative C stack marking requires a method to identify possibly
3341 live Lisp objects given a pointer value. We do this by keeping
3342 track of blocks of Lisp data that are allocated in a red-black tree
3343 (see also the comment of mem_node which is the type of nodes in
3344 that tree). Function lisp_malloc adds information for an allocated
3345 block to the red-black tree with calls to mem_insert, and function
3346 lisp_free removes it with mem_delete. Functions live_string_p etc
3347 call mem_find to lookup information about a given pointer in the
3348 tree, and use that to determine if the pointer points to a Lisp
3351 /* Initialize this part of alloc.c. */
3356 mem_z
.left
= mem_z
.right
= MEM_NIL
;
3357 mem_z
.parent
= NULL
;
3358 mem_z
.color
= MEM_BLACK
;
3359 mem_z
.start
= mem_z
.end
= NULL
;
3364 /* Value is a pointer to the mem_node containing START. Value is
3365 MEM_NIL if there is no node in the tree containing START. */
3367 static INLINE
struct mem_node
*
3368 mem_find (void *start
)
3372 if (start
< min_heap_address
|| start
> max_heap_address
)
3375 /* Make the search always successful to speed up the loop below. */
3376 mem_z
.start
= start
;
3377 mem_z
.end
= (char *) start
+ 1;
3380 while (start
< p
->start
|| start
>= p
->end
)
3381 p
= start
< p
->start
? p
->left
: p
->right
;
3386 /* Insert a new node into the tree for a block of memory with start
3387 address START, end address END, and type TYPE. Value is a
3388 pointer to the node that was inserted. */
3390 static struct mem_node
*
3391 mem_insert (void *start
, void *end
, enum mem_type type
)
3393 struct mem_node
*c
, *parent
, *x
;
3395 if (min_heap_address
== NULL
|| start
< min_heap_address
)
3396 min_heap_address
= start
;
3397 if (max_heap_address
== NULL
|| end
> max_heap_address
)
3398 max_heap_address
= end
;
3400 /* See where in the tree a node for START belongs. In this
3401 particular application, it shouldn't happen that a node is already
3402 present. For debugging purposes, let's check that. */
3406 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3408 while (c
!= MEM_NIL
)
3410 if (start
>= c
->start
&& start
< c
->end
)
3413 c
= start
< c
->start
? c
->left
: c
->right
;
3416 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3418 while (c
!= MEM_NIL
)
3421 c
= start
< c
->start
? c
->left
: c
->right
;
3424 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3426 /* Create a new node. */
3427 #ifdef GC_MALLOC_CHECK
3428 x
= (struct mem_node
*) _malloc_internal (sizeof *x
);
3432 x
= (struct mem_node
*) xmalloc (sizeof *x
);
3438 x
->left
= x
->right
= MEM_NIL
;
3441 /* Insert it as child of PARENT or install it as root. */
3444 if (start
< parent
->start
)
3452 /* Re-establish red-black tree properties. */
3453 mem_insert_fixup (x
);
3459 /* Re-establish the red-black properties of the tree, and thereby
3460 balance the tree, after node X has been inserted; X is always red. */
3463 mem_insert_fixup (struct mem_node
*x
)
3465 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3467 /* X is red and its parent is red. This is a violation of
3468 red-black tree property #3. */
3470 if (x
->parent
== x
->parent
->parent
->left
)
3472 /* We're on the left side of our grandparent, and Y is our
3474 struct mem_node
*y
= x
->parent
->parent
->right
;
3476 if (y
->color
== MEM_RED
)
3478 /* Uncle and parent are red but should be black because
3479 X is red. Change the colors accordingly and proceed
3480 with the grandparent. */
3481 x
->parent
->color
= MEM_BLACK
;
3482 y
->color
= MEM_BLACK
;
3483 x
->parent
->parent
->color
= MEM_RED
;
3484 x
= x
->parent
->parent
;
3488 /* Parent and uncle have different colors; parent is
3489 red, uncle is black. */
3490 if (x
== x
->parent
->right
)
3493 mem_rotate_left (x
);
3496 x
->parent
->color
= MEM_BLACK
;
3497 x
->parent
->parent
->color
= MEM_RED
;
3498 mem_rotate_right (x
->parent
->parent
);
3503 /* This is the symmetrical case of above. */
3504 struct mem_node
*y
= x
->parent
->parent
->left
;
3506 if (y
->color
== MEM_RED
)
3508 x
->parent
->color
= MEM_BLACK
;
3509 y
->color
= MEM_BLACK
;
3510 x
->parent
->parent
->color
= MEM_RED
;
3511 x
= x
->parent
->parent
;
3515 if (x
== x
->parent
->left
)
3518 mem_rotate_right (x
);
3521 x
->parent
->color
= MEM_BLACK
;
3522 x
->parent
->parent
->color
= MEM_RED
;
3523 mem_rotate_left (x
->parent
->parent
);
3528 /* The root may have been changed to red due to the algorithm. Set
3529 it to black so that property #5 is satisfied. */
3530 mem_root
->color
= MEM_BLACK
;
3541 mem_rotate_left (struct mem_node
*x
)
3545 /* Turn y's left sub-tree into x's right sub-tree. */
3548 if (y
->left
!= MEM_NIL
)
3549 y
->left
->parent
= x
;
3551 /* Y's parent was x's parent. */
3553 y
->parent
= x
->parent
;
3555 /* Get the parent to point to y instead of x. */
3558 if (x
== x
->parent
->left
)
3559 x
->parent
->left
= y
;
3561 x
->parent
->right
= y
;
3566 /* Put x on y's left. */
3580 mem_rotate_right (struct mem_node
*x
)
3582 struct mem_node
*y
= x
->left
;
3585 if (y
->right
!= MEM_NIL
)
3586 y
->right
->parent
= x
;
3589 y
->parent
= x
->parent
;
3592 if (x
== x
->parent
->right
)
3593 x
->parent
->right
= y
;
3595 x
->parent
->left
= y
;
3606 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
3609 mem_delete (struct mem_node
*z
)
3611 struct mem_node
*x
, *y
;
3613 if (!z
|| z
== MEM_NIL
)
3616 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
3621 while (y
->left
!= MEM_NIL
)
3625 if (y
->left
!= MEM_NIL
)
3630 x
->parent
= y
->parent
;
3633 if (y
== y
->parent
->left
)
3634 y
->parent
->left
= x
;
3636 y
->parent
->right
= x
;
3643 z
->start
= y
->start
;
3648 if (y
->color
== MEM_BLACK
)
3649 mem_delete_fixup (x
);
3651 #ifdef GC_MALLOC_CHECK
3659 /* Re-establish the red-black properties of the tree, after a
3663 mem_delete_fixup (struct mem_node
*x
)
3665 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
3667 if (x
== x
->parent
->left
)
3669 struct mem_node
*w
= x
->parent
->right
;
3671 if (w
->color
== MEM_RED
)
3673 w
->color
= MEM_BLACK
;
3674 x
->parent
->color
= MEM_RED
;
3675 mem_rotate_left (x
->parent
);
3676 w
= x
->parent
->right
;
3679 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
3686 if (w
->right
->color
== MEM_BLACK
)
3688 w
->left
->color
= MEM_BLACK
;
3690 mem_rotate_right (w
);
3691 w
= x
->parent
->right
;
3693 w
->color
= x
->parent
->color
;
3694 x
->parent
->color
= MEM_BLACK
;
3695 w
->right
->color
= MEM_BLACK
;
3696 mem_rotate_left (x
->parent
);
3702 struct mem_node
*w
= x
->parent
->left
;
3704 if (w
->color
== MEM_RED
)
3706 w
->color
= MEM_BLACK
;
3707 x
->parent
->color
= MEM_RED
;
3708 mem_rotate_right (x
->parent
);
3709 w
= x
->parent
->left
;
3712 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
3719 if (w
->left
->color
== MEM_BLACK
)
3721 w
->right
->color
= MEM_BLACK
;
3723 mem_rotate_left (w
);
3724 w
= x
->parent
->left
;
3727 w
->color
= x
->parent
->color
;
3728 x
->parent
->color
= MEM_BLACK
;
3729 w
->left
->color
= MEM_BLACK
;
3730 mem_rotate_right (x
->parent
);
3736 x
->color
= MEM_BLACK
;
3740 /* Value is non-zero if P is a pointer to a live Lisp string on
3741 the heap. M is a pointer to the mem_block for P. */
3744 live_string_p (struct mem_node
*m
, void *p
)
3746 if (m
->type
== MEM_TYPE_STRING
)
3748 struct string_block
*b
= (struct string_block
*) m
->start
;
3749 ptrdiff_t offset
= (char *) p
- (char *) &b
->strings
[0];
3751 /* P must point to the start of a Lisp_String structure, and it
3752 must not be on the free-list. */
3754 && offset
% sizeof b
->strings
[0] == 0
3755 && offset
< (STRING_BLOCK_SIZE
* sizeof b
->strings
[0])
3756 && ((struct Lisp_String
*) p
)->data
!= NULL
);
3763 /* Value is non-zero if P is a pointer to a live Lisp cons on
3764 the heap. M is a pointer to the mem_block for P. */
3767 live_cons_p (struct mem_node
*m
, void *p
)
3769 if (m
->type
== MEM_TYPE_CONS
)
3771 struct cons_block
*b
= (struct cons_block
*) m
->start
;
3772 ptrdiff_t offset
= (char *) p
- (char *) &b
->conses
[0];
3774 /* P must point to the start of a Lisp_Cons, not be
3775 one of the unused cells in the current cons block,
3776 and not be on the free-list. */
3778 && offset
% sizeof b
->conses
[0] == 0
3779 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
3781 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
3782 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
3789 /* Value is non-zero if P is a pointer to a live Lisp symbol on
3790 the heap. M is a pointer to the mem_block for P. */
3793 live_symbol_p (struct mem_node
*m
, void *p
)
3795 if (m
->type
== MEM_TYPE_SYMBOL
)
3797 struct symbol_block
*b
= (struct symbol_block
*) m
->start
;
3798 ptrdiff_t offset
= (char *) p
- (char *) &b
->symbols
[0];
3800 /* P must point to the start of a Lisp_Symbol, not be
3801 one of the unused cells in the current symbol block,
3802 and not be on the free-list. */
3804 && offset
% sizeof b
->symbols
[0] == 0
3805 && offset
< (SYMBOL_BLOCK_SIZE
* sizeof b
->symbols
[0])
3806 && (b
!= symbol_block
3807 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
3808 && !EQ (((struct Lisp_Symbol
*) p
)->function
, Vdead
));
3815 /* Value is non-zero if P is a pointer to a live Lisp float on
3816 the heap. M is a pointer to the mem_block for P. */
3819 live_float_p (struct mem_node
*m
, void *p
)
3821 if (m
->type
== MEM_TYPE_FLOAT
)
3823 struct float_block
*b
= (struct float_block
*) m
->start
;
3824 ptrdiff_t offset
= (char *) p
- (char *) &b
->floats
[0];
3826 /* P must point to the start of a Lisp_Float and not be
3827 one of the unused cells in the current float block. */
3829 && offset
% sizeof b
->floats
[0] == 0
3830 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
3831 && (b
!= float_block
3832 || offset
/ sizeof b
->floats
[0] < float_block_index
));
3839 /* Value is non-zero if P is a pointer to a live Lisp Misc on
3840 the heap. M is a pointer to the mem_block for P. */
3843 live_misc_p (struct mem_node
*m
, void *p
)
3845 if (m
->type
== MEM_TYPE_MISC
)
3847 struct marker_block
*b
= (struct marker_block
*) m
->start
;
3848 ptrdiff_t offset
= (char *) p
- (char *) &b
->markers
[0];
3850 /* P must point to the start of a Lisp_Misc, not be
3851 one of the unused cells in the current misc block,
3852 and not be on the free-list. */
3854 && offset
% sizeof b
->markers
[0] == 0
3855 && offset
< (MARKER_BLOCK_SIZE
* sizeof b
->markers
[0])
3856 && (b
!= marker_block
3857 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
3858 && ((union Lisp_Misc
*) p
)->u_any
.type
!= Lisp_Misc_Free
);
3865 /* Value is non-zero if P is a pointer to a live vector-like object.
3866 M is a pointer to the mem_block for P. */
3869 live_vector_p (struct mem_node
*m
, void *p
)
3871 return (p
== m
->start
&& m
->type
== MEM_TYPE_VECTORLIKE
);
3875 /* Value is non-zero if P is a pointer to a live buffer. M is a
3876 pointer to the mem_block for P. */
3879 live_buffer_p (struct mem_node
*m
, void *p
)
3881 /* P must point to the start of the block, and the buffer
3882 must not have been killed. */
3883 return (m
->type
== MEM_TYPE_BUFFER
3885 && !NILP (((struct buffer
*) p
)->BUFFER_INTERNAL_FIELD (name
)));
3888 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
3892 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3894 /* Array of objects that are kept alive because the C stack contains
3895 a pattern that looks like a reference to them . */
3897 #define MAX_ZOMBIES 10
3898 static Lisp_Object zombies
[MAX_ZOMBIES
];
3900 /* Number of zombie objects. */
3902 static int nzombies
;
3904 /* Number of garbage collections. */
3908 /* Average percentage of zombies per collection. */
3910 static double avg_zombies
;
3912 /* Max. number of live and zombie objects. */
3914 static int max_live
, max_zombies
;
3916 /* Average number of live objects per GC. */
3918 static double avg_live
;
3920 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
3921 doc
: /* Show information about live and zombie objects. */)
3924 Lisp_Object args
[8], zombie_list
= Qnil
;
3926 for (i
= 0; i
< nzombies
; i
++)
3927 zombie_list
= Fcons (zombies
[i
], zombie_list
);
3928 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
3929 args
[1] = make_number (ngcs
);
3930 args
[2] = make_float (avg_live
);
3931 args
[3] = make_float (avg_zombies
);
3932 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
3933 args
[5] = make_number (max_live
);
3934 args
[6] = make_number (max_zombies
);
3935 args
[7] = zombie_list
;
3936 return Fmessage (8, args
);
3939 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
3942 /* Mark OBJ if we can prove it's a Lisp_Object. */
3945 mark_maybe_object (Lisp_Object obj
)
3953 po
= (void *) XPNTR (obj
);
3960 switch (XTYPE (obj
))
3963 mark_p
= (live_string_p (m
, po
)
3964 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
3968 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
3972 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
3976 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
3979 case Lisp_Vectorlike
:
3980 /* Note: can't check BUFFERP before we know it's a
3981 buffer because checking that dereferences the pointer
3982 PO which might point anywhere. */
3983 if (live_vector_p (m
, po
))
3984 mark_p
= !SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
3985 else if (live_buffer_p (m
, po
))
3986 mark_p
= BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
3990 mark_p
= (live_misc_p (m
, po
) && !XMISCANY (obj
)->gcmarkbit
);
3999 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4000 if (nzombies
< MAX_ZOMBIES
)
4001 zombies
[nzombies
] = obj
;
4010 /* If P points to Lisp data, mark that as live if it isn't already
4014 mark_maybe_pointer (void *p
)
4018 /* Quickly rule out some values which can't point to Lisp data. */
4021 8 /* USE_LSB_TAG needs Lisp data to be aligned on multiples of 8. */
4023 2 /* We assume that Lisp data is aligned on even addresses. */
4031 Lisp_Object obj
= Qnil
;
4035 case MEM_TYPE_NON_LISP
:
4036 /* Nothing to do; not a pointer to Lisp memory. */
4039 case MEM_TYPE_BUFFER
:
4040 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P((struct buffer
*)p
))
4041 XSETVECTOR (obj
, p
);
4045 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
4049 case MEM_TYPE_STRING
:
4050 if (live_string_p (m
, p
)
4051 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
4052 XSETSTRING (obj
, p
);
4056 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
4060 case MEM_TYPE_SYMBOL
:
4061 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
4062 XSETSYMBOL (obj
, p
);
4065 case MEM_TYPE_FLOAT
:
4066 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
4070 case MEM_TYPE_VECTORLIKE
:
4071 if (live_vector_p (m
, p
))
4074 XSETVECTOR (tem
, p
);
4075 if (!SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
4090 /* Mark Lisp objects referenced from the address range START+OFFSET..END
4091 or END+OFFSET..START. */
4094 mark_memory (void *start
, void *end
, int offset
)
4099 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4103 /* Make START the pointer to the start of the memory region,
4104 if it isn't already. */
4112 /* Mark Lisp_Objects. */
4113 for (p
= (Lisp_Object
*) ((char *) start
+ offset
); (void *) p
< end
; ++p
)
4114 mark_maybe_object (*p
);
4116 /* Mark Lisp data pointed to. This is necessary because, in some
4117 situations, the C compiler optimizes Lisp objects away, so that
4118 only a pointer to them remains. Example:
4120 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
4123 Lisp_Object obj = build_string ("test");
4124 struct Lisp_String *s = XSTRING (obj);
4125 Fgarbage_collect ();
4126 fprintf (stderr, "test `%s'\n", s->data);
4130 Here, `obj' isn't really used, and the compiler optimizes it
4131 away. The only reference to the life string is through the
4134 for (pp
= (void **) ((char *) start
+ offset
); (void *) pp
< end
; ++pp
)
4135 mark_maybe_pointer (*pp
);
4138 /* setjmp will work with GCC unless NON_SAVING_SETJMP is defined in
4139 the GCC system configuration. In gcc 3.2, the only systems for
4140 which this is so are i386-sco5 non-ELF, i386-sysv3 (maybe included
4141 by others?) and ns32k-pc532-min. */
4143 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
4145 static int setjmp_tested_p
, longjmps_done
;
4147 #define SETJMP_WILL_LIKELY_WORK "\
4149 Emacs garbage collector has been changed to use conservative stack\n\
4150 marking. Emacs has determined that the method it uses to do the\n\
4151 marking will likely work on your system, but this isn't sure.\n\
4153 If you are a system-programmer, or can get the help of a local wizard\n\
4154 who is, please take a look at the function mark_stack in alloc.c, and\n\
4155 verify that the methods used are appropriate for your system.\n\
4157 Please mail the result to <emacs-devel@gnu.org>.\n\
4160 #define SETJMP_WILL_NOT_WORK "\
4162 Emacs garbage collector has been changed to use conservative stack\n\
4163 marking. Emacs has determined that the default method it uses to do the\n\
4164 marking will not work on your system. We will need a system-dependent\n\
4165 solution for your system.\n\
4167 Please take a look at the function mark_stack in alloc.c, and\n\
4168 try to find a way to make it work on your system.\n\
4170 Note that you may get false negatives, depending on the compiler.\n\
4171 In particular, you need to use -O with GCC for this test.\n\
4173 Please mail the result to <emacs-devel@gnu.org>.\n\
4177 /* Perform a quick check if it looks like setjmp saves registers in a
4178 jmp_buf. Print a message to stderr saying so. When this test
4179 succeeds, this is _not_ a proof that setjmp is sufficient for
4180 conservative stack marking. Only the sources or a disassembly
4191 /* Arrange for X to be put in a register. */
4197 if (longjmps_done
== 1)
4199 /* Came here after the longjmp at the end of the function.
4201 If x == 1, the longjmp has restored the register to its
4202 value before the setjmp, and we can hope that setjmp
4203 saves all such registers in the jmp_buf, although that
4206 For other values of X, either something really strange is
4207 taking place, or the setjmp just didn't save the register. */
4210 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
4213 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
4220 if (longjmps_done
== 1)
4224 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
4227 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4229 /* Abort if anything GCPRO'd doesn't survive the GC. */
4237 for (p
= gcprolist
; p
; p
= p
->next
)
4238 for (i
= 0; i
< p
->nvars
; ++i
)
4239 if (!survives_gc_p (p
->var
[i
]))
4240 /* FIXME: It's not necessarily a bug. It might just be that the
4241 GCPRO is unnecessary or should release the object sooner. */
4245 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4252 fprintf (stderr
, "\nZombies kept alive = %d:\n", nzombies
);
4253 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
4255 fprintf (stderr
, " %d = ", i
);
4256 debug_print (zombies
[i
]);
4260 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4263 /* Mark live Lisp objects on the C stack.
4265 There are several system-dependent problems to consider when
4266 porting this to new architectures:
4270 We have to mark Lisp objects in CPU registers that can hold local
4271 variables or are used to pass parameters.
4273 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
4274 something that either saves relevant registers on the stack, or
4275 calls mark_maybe_object passing it each register's contents.
4277 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
4278 implementation assumes that calling setjmp saves registers we need
4279 to see in a jmp_buf which itself lies on the stack. This doesn't
4280 have to be true! It must be verified for each system, possibly
4281 by taking a look at the source code of setjmp.
4283 If __builtin_unwind_init is available (defined by GCC >= 2.8) we
4284 can use it as a machine independent method to store all registers
4285 to the stack. In this case the macros described in the previous
4286 two paragraphs are not used.
4290 Architectures differ in the way their processor stack is organized.
4291 For example, the stack might look like this
4294 | Lisp_Object | size = 4
4296 | something else | size = 2
4298 | Lisp_Object | size = 4
4302 In such a case, not every Lisp_Object will be aligned equally. To
4303 find all Lisp_Object on the stack it won't be sufficient to walk
4304 the stack in steps of 4 bytes. Instead, two passes will be
4305 necessary, one starting at the start of the stack, and a second
4306 pass starting at the start of the stack + 2. Likewise, if the
4307 minimal alignment of Lisp_Objects on the stack is 1, four passes
4308 would be necessary, each one starting with one byte more offset
4309 from the stack start.
4311 The current code assumes by default that Lisp_Objects are aligned
4312 equally on the stack. */
4320 #ifdef HAVE___BUILTIN_UNWIND_INIT
4321 /* Force callee-saved registers and register windows onto the stack.
4322 This is the preferred method if available, obviating the need for
4323 machine dependent methods. */
4324 __builtin_unwind_init ();
4326 #else /* not HAVE___BUILTIN_UNWIND_INIT */
4327 #ifndef GC_SAVE_REGISTERS_ON_STACK
4328 /* jmp_buf may not be aligned enough on darwin-ppc64 */
4329 union aligned_jmpbuf
{
4333 volatile int stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
4335 /* This trick flushes the register windows so that all the state of
4336 the process is contained in the stack. */
4337 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
4338 needed on ia64 too. See mach_dep.c, where it also says inline
4339 assembler doesn't work with relevant proprietary compilers. */
4341 #if defined (__sparc64__) && defined (__FreeBSD__)
4342 /* FreeBSD does not have a ta 3 handler. */
4349 /* Save registers that we need to see on the stack. We need to see
4350 registers used to hold register variables and registers used to
4352 #ifdef GC_SAVE_REGISTERS_ON_STACK
4353 GC_SAVE_REGISTERS_ON_STACK (end
);
4354 #else /* not GC_SAVE_REGISTERS_ON_STACK */
4356 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
4357 setjmp will definitely work, test it
4358 and print a message with the result
4360 if (!setjmp_tested_p
)
4362 setjmp_tested_p
= 1;
4365 #endif /* GC_SETJMP_WORKS */
4368 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
4369 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
4370 #endif /* not HAVE___BUILTIN_UNWIND_INIT */
4372 /* This assumes that the stack is a contiguous region in memory. If
4373 that's not the case, something has to be done here to iterate
4374 over the stack segments. */
4375 #ifndef GC_LISP_OBJECT_ALIGNMENT
4377 #define GC_LISP_OBJECT_ALIGNMENT __alignof__ (Lisp_Object)
4379 #define GC_LISP_OBJECT_ALIGNMENT sizeof (Lisp_Object)
4382 for (i
= 0; i
< sizeof (Lisp_Object
); i
+= GC_LISP_OBJECT_ALIGNMENT
)
4383 mark_memory (stack_base
, end
, i
);
4384 /* Allow for marking a secondary stack, like the register stack on the
4386 #ifdef GC_MARK_SECONDARY_STACK
4387 GC_MARK_SECONDARY_STACK ();
4390 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4395 #endif /* GC_MARK_STACK != 0 */
4398 /* Determine whether it is safe to access memory at address P. */
4400 valid_pointer_p (void *p
)
4403 return w32_valid_pointer_p (p
, 16);
4407 /* Obviously, we cannot just access it (we would SEGV trying), so we
4408 trick the o/s to tell us whether p is a valid pointer.
4409 Unfortunately, we cannot use NULL_DEVICE here, as emacs_write may
4410 not validate p in that case. */
4412 if ((fd
= emacs_open ("__Valid__Lisp__Object__", O_CREAT
| O_WRONLY
| O_TRUNC
, 0666)) >= 0)
4414 int valid
= (emacs_write (fd
, (char *)p
, 16) == 16);
4416 unlink ("__Valid__Lisp__Object__");
4424 /* Return 1 if OBJ is a valid lisp object.
4425 Return 0 if OBJ is NOT a valid lisp object.
4426 Return -1 if we cannot validate OBJ.
4427 This function can be quite slow,
4428 so it should only be used in code for manual debugging. */
4431 valid_lisp_object_p (Lisp_Object obj
)
4441 p
= (void *) XPNTR (obj
);
4442 if (PURE_POINTER_P (p
))
4446 return valid_pointer_p (p
);
4453 int valid
= valid_pointer_p (p
);
4465 case MEM_TYPE_NON_LISP
:
4468 case MEM_TYPE_BUFFER
:
4469 return live_buffer_p (m
, p
);
4472 return live_cons_p (m
, p
);
4474 case MEM_TYPE_STRING
:
4475 return live_string_p (m
, p
);
4478 return live_misc_p (m
, p
);
4480 case MEM_TYPE_SYMBOL
:
4481 return live_symbol_p (m
, p
);
4483 case MEM_TYPE_FLOAT
:
4484 return live_float_p (m
, p
);
4486 case MEM_TYPE_VECTORLIKE
:
4487 return live_vector_p (m
, p
);
4500 /***********************************************************************
4501 Pure Storage Management
4502 ***********************************************************************/
4504 /* Allocate room for SIZE bytes from pure Lisp storage and return a
4505 pointer to it. TYPE is the Lisp type for which the memory is
4506 allocated. TYPE < 0 means it's not used for a Lisp object. */
4508 static POINTER_TYPE
*
4509 pure_alloc (size_t size
, int type
)
4511 POINTER_TYPE
*result
;
4513 size_t alignment
= (1 << GCTYPEBITS
);
4515 size_t alignment
= sizeof (EMACS_INT
);
4517 /* Give Lisp_Floats an extra alignment. */
4518 if (type
== Lisp_Float
)
4520 #if defined __GNUC__ && __GNUC__ >= 2
4521 alignment
= __alignof (struct Lisp_Float
);
4523 alignment
= sizeof (struct Lisp_Float
);
4531 /* Allocate space for a Lisp object from the beginning of the free
4532 space with taking account of alignment. */
4533 result
= ALIGN (purebeg
+ pure_bytes_used_lisp
, alignment
);
4534 pure_bytes_used_lisp
= ((char *)result
- (char *)purebeg
) + size
;
4538 /* Allocate space for a non-Lisp object from the end of the free
4540 pure_bytes_used_non_lisp
+= size
;
4541 result
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4543 pure_bytes_used
= pure_bytes_used_lisp
+ pure_bytes_used_non_lisp
;
4545 if (pure_bytes_used
<= pure_size
)
4548 /* Don't allocate a large amount here,
4549 because it might get mmap'd and then its address
4550 might not be usable. */
4551 purebeg
= (char *) xmalloc (10000);
4553 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
4554 pure_bytes_used
= 0;
4555 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
4560 /* Print a warning if PURESIZE is too small. */
4563 check_pure_size (void)
4565 if (pure_bytes_used_before_overflow
)
4566 message (("emacs:0:Pure Lisp storage overflow (approx. %"pI
"d"
4568 pure_bytes_used
+ pure_bytes_used_before_overflow
);
4572 /* Find the byte sequence {DATA[0], ..., DATA[NBYTES-1], '\0'} from
4573 the non-Lisp data pool of the pure storage, and return its start
4574 address. Return NULL if not found. */
4577 find_string_data_in_pure (const char *data
, EMACS_INT nbytes
)
4580 EMACS_INT skip
, bm_skip
[256], last_char_skip
, infinity
, start
, start_max
;
4581 const unsigned char *p
;
4584 if (pure_bytes_used_non_lisp
< nbytes
+ 1)
4587 /* Set up the Boyer-Moore table. */
4589 for (i
= 0; i
< 256; i
++)
4592 p
= (const unsigned char *) data
;
4594 bm_skip
[*p
++] = skip
;
4596 last_char_skip
= bm_skip
['\0'];
4598 non_lisp_beg
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4599 start_max
= pure_bytes_used_non_lisp
- (nbytes
+ 1);
4601 /* See the comments in the function `boyer_moore' (search.c) for the
4602 use of `infinity'. */
4603 infinity
= pure_bytes_used_non_lisp
+ 1;
4604 bm_skip
['\0'] = infinity
;
4606 p
= (const unsigned char *) non_lisp_beg
+ nbytes
;
4610 /* Check the last character (== '\0'). */
4613 start
+= bm_skip
[*(p
+ start
)];
4615 while (start
<= start_max
);
4617 if (start
< infinity
)
4618 /* Couldn't find the last character. */
4621 /* No less than `infinity' means we could find the last
4622 character at `p[start - infinity]'. */
4625 /* Check the remaining characters. */
4626 if (memcmp (data
, non_lisp_beg
+ start
, nbytes
) == 0)
4628 return non_lisp_beg
+ start
;
4630 start
+= last_char_skip
;
4632 while (start
<= start_max
);
4638 /* Return a string allocated in pure space. DATA is a buffer holding
4639 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
4640 non-zero means make the result string multibyte.
4642 Must get an error if pure storage is full, since if it cannot hold
4643 a large string it may be able to hold conses that point to that
4644 string; then the string is not protected from gc. */
4647 make_pure_string (const char *data
,
4648 EMACS_INT nchars
, EMACS_INT nbytes
, int multibyte
)
4651 struct Lisp_String
*s
;
4653 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4654 s
->data
= (unsigned char *) find_string_data_in_pure (data
, nbytes
);
4655 if (s
->data
== NULL
)
4657 s
->data
= (unsigned char *) pure_alloc (nbytes
+ 1, -1);
4658 memcpy (s
->data
, data
, nbytes
);
4659 s
->data
[nbytes
] = '\0';
4662 s
->size_byte
= multibyte
? nbytes
: -1;
4663 s
->intervals
= NULL_INTERVAL
;
4664 XSETSTRING (string
, s
);
4668 /* Return a string a string allocated in pure space. Do not allocate
4669 the string data, just point to DATA. */
4672 make_pure_c_string (const char *data
)
4675 struct Lisp_String
*s
;
4676 EMACS_INT nchars
= strlen (data
);
4678 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4681 s
->data
= (unsigned char *) data
;
4682 s
->intervals
= NULL_INTERVAL
;
4683 XSETSTRING (string
, s
);
4687 /* Return a cons allocated from pure space. Give it pure copies
4688 of CAR as car and CDR as cdr. */
4691 pure_cons (Lisp_Object car
, Lisp_Object cdr
)
4693 register Lisp_Object
new;
4694 struct Lisp_Cons
*p
;
4696 p
= (struct Lisp_Cons
*) pure_alloc (sizeof *p
, Lisp_Cons
);
4698 XSETCAR (new, Fpurecopy (car
));
4699 XSETCDR (new, Fpurecopy (cdr
));
4704 /* Value is a float object with value NUM allocated from pure space. */
4707 make_pure_float (double num
)
4709 register Lisp_Object
new;
4710 struct Lisp_Float
*p
;
4712 p
= (struct Lisp_Float
*) pure_alloc (sizeof *p
, Lisp_Float
);
4714 XFLOAT_INIT (new, num
);
4719 /* Return a vector with room for LEN Lisp_Objects allocated from
4723 make_pure_vector (EMACS_INT len
)
4726 struct Lisp_Vector
*p
;
4727 size_t size
= (offsetof (struct Lisp_Vector
, contents
)
4728 + len
* sizeof (Lisp_Object
));
4730 p
= (struct Lisp_Vector
*) pure_alloc (size
, Lisp_Vectorlike
);
4731 XSETVECTOR (new, p
);
4732 XVECTOR (new)->size
= len
;
4737 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
4738 doc
: /* Make a copy of object OBJ in pure storage.
4739 Recursively copies contents of vectors and cons cells.
4740 Does not copy symbols. Copies strings without text properties. */)
4741 (register Lisp_Object obj
)
4743 if (NILP (Vpurify_flag
))
4746 if (PURE_POINTER_P (XPNTR (obj
)))
4749 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
4751 Lisp_Object tmp
= Fgethash (obj
, Vpurify_flag
, Qnil
);
4757 obj
= pure_cons (XCAR (obj
), XCDR (obj
));
4758 else if (FLOATP (obj
))
4759 obj
= make_pure_float (XFLOAT_DATA (obj
));
4760 else if (STRINGP (obj
))
4761 obj
= make_pure_string (SSDATA (obj
), SCHARS (obj
),
4763 STRING_MULTIBYTE (obj
));
4764 else if (COMPILEDP (obj
) || VECTORP (obj
))
4766 register struct Lisp_Vector
*vec
;
4767 register EMACS_INT i
;
4770 size
= XVECTOR (obj
)->size
;
4771 if (size
& PSEUDOVECTOR_FLAG
)
4772 size
&= PSEUDOVECTOR_SIZE_MASK
;
4773 vec
= XVECTOR (make_pure_vector (size
));
4774 for (i
= 0; i
< size
; i
++)
4775 vec
->contents
[i
] = Fpurecopy (XVECTOR (obj
)->contents
[i
]);
4776 if (COMPILEDP (obj
))
4778 XSETPVECTYPE (vec
, PVEC_COMPILED
);
4779 XSETCOMPILED (obj
, vec
);
4782 XSETVECTOR (obj
, vec
);
4784 else if (MARKERP (obj
))
4785 error ("Attempt to copy a marker to pure storage");
4787 /* Not purified, don't hash-cons. */
4790 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
4791 Fputhash (obj
, obj
, Vpurify_flag
);
4798 /***********************************************************************
4800 ***********************************************************************/
4802 /* Put an entry in staticvec, pointing at the variable with address
4806 staticpro (Lisp_Object
*varaddress
)
4808 staticvec
[staticidx
++] = varaddress
;
4809 if (staticidx
>= NSTATICS
)
4814 /***********************************************************************
4816 ***********************************************************************/
4818 /* Temporarily prevent garbage collection. */
4821 inhibit_garbage_collection (void)
4823 int count
= SPECPDL_INDEX ();
4824 int nbits
= min (VALBITS
, BITS_PER_INT
);
4826 specbind (Qgc_cons_threshold
, make_number (((EMACS_INT
) 1 << (nbits
- 1)) - 1));
4831 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
4832 doc
: /* Reclaim storage for Lisp objects no longer needed.
4833 Garbage collection happens automatically if you cons more than
4834 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
4835 `garbage-collect' normally returns a list with info on amount of space in use:
4836 ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)
4837 (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS
4838 (USED-FLOATS . FREE-FLOATS) (USED-INTERVALS . FREE-INTERVALS)
4839 (USED-STRINGS . FREE-STRINGS))
4840 However, if there was overflow in pure space, `garbage-collect'
4841 returns nil, because real GC can't be done. */)
4844 register struct specbinding
*bind
;
4845 char stack_top_variable
;
4848 Lisp_Object total
[8];
4849 int count
= SPECPDL_INDEX ();
4850 EMACS_TIME t1
, t2
, t3
;
4855 /* Can't GC if pure storage overflowed because we can't determine
4856 if something is a pure object or not. */
4857 if (pure_bytes_used_before_overflow
)
4862 /* Don't keep undo information around forever.
4863 Do this early on, so it is no problem if the user quits. */
4865 register struct buffer
*nextb
= all_buffers
;
4869 /* If a buffer's undo list is Qt, that means that undo is
4870 turned off in that buffer. Calling truncate_undo_list on
4871 Qt tends to return NULL, which effectively turns undo back on.
4872 So don't call truncate_undo_list if undo_list is Qt. */
4873 if (! NILP (nextb
->BUFFER_INTERNAL_FIELD (name
)) && ! EQ (nextb
->BUFFER_INTERNAL_FIELD (undo_list
), Qt
))
4874 truncate_undo_list (nextb
);
4876 /* Shrink buffer gaps, but skip indirect and dead buffers. */
4877 if (nextb
->base_buffer
== 0 && !NILP (nextb
->BUFFER_INTERNAL_FIELD (name
))
4878 && ! nextb
->text
->inhibit_shrinking
)
4880 /* If a buffer's gap size is more than 10% of the buffer
4881 size, or larger than 2000 bytes, then shrink it
4882 accordingly. Keep a minimum size of 20 bytes. */
4883 int size
= min (2000, max (20, (nextb
->text
->z_byte
/ 10)));
4885 if (nextb
->text
->gap_size
> size
)
4887 struct buffer
*save_current
= current_buffer
;
4888 current_buffer
= nextb
;
4889 make_gap (-(nextb
->text
->gap_size
- size
));
4890 current_buffer
= save_current
;
4894 nextb
= nextb
->next
;
4898 EMACS_GET_TIME (t1
);
4900 /* In case user calls debug_print during GC,
4901 don't let that cause a recursive GC. */
4902 consing_since_gc
= 0;
4904 /* Save what's currently displayed in the echo area. */
4905 message_p
= push_message ();
4906 record_unwind_protect (pop_message_unwind
, Qnil
);
4908 /* Save a copy of the contents of the stack, for debugging. */
4909 #if MAX_SAVE_STACK > 0
4910 if (NILP (Vpurify_flag
))
4914 if (&stack_top_variable
< stack_bottom
)
4916 stack
= &stack_top_variable
;
4917 stack_size
= stack_bottom
- &stack_top_variable
;
4921 stack
= stack_bottom
;
4922 stack_size
= &stack_top_variable
- stack_bottom
;
4924 if (stack_size
<= MAX_SAVE_STACK
)
4926 if (stack_copy_size
< stack_size
)
4928 stack_copy
= (char *) xrealloc (stack_copy
, stack_size
);
4929 stack_copy_size
= stack_size
;
4931 memcpy (stack_copy
, stack
, stack_size
);
4934 #endif /* MAX_SAVE_STACK > 0 */
4936 if (garbage_collection_messages
)
4937 message1_nolog ("Garbage collecting...");
4941 shrink_regexp_cache ();
4945 /* clear_marks (); */
4947 /* Mark all the special slots that serve as the roots of accessibility. */
4949 for (i
= 0; i
< staticidx
; i
++)
4950 mark_object (*staticvec
[i
]);
4952 for (bind
= specpdl
; bind
!= specpdl_ptr
; bind
++)
4954 mark_object (bind
->symbol
);
4955 mark_object (bind
->old_value
);
4963 extern void xg_mark_data (void);
4968 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
4969 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
4973 register struct gcpro
*tail
;
4974 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
4975 for (i
= 0; i
< tail
->nvars
; i
++)
4976 mark_object (tail
->var
[i
]);
4980 struct catchtag
*catch;
4981 struct handler
*handler
;
4983 for (catch = catchlist
; catch; catch = catch->next
)
4985 mark_object (catch->tag
);
4986 mark_object (catch->val
);
4988 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
4990 mark_object (handler
->handler
);
4991 mark_object (handler
->var
);
4997 #ifdef HAVE_WINDOW_SYSTEM
4998 mark_fringe_data ();
5001 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5005 /* Everything is now marked, except for the things that require special
5006 finalization, i.e. the undo_list.
5007 Look thru every buffer's undo list
5008 for elements that update markers that were not marked,
5011 register struct buffer
*nextb
= all_buffers
;
5015 /* If a buffer's undo list is Qt, that means that undo is
5016 turned off in that buffer. Calling truncate_undo_list on
5017 Qt tends to return NULL, which effectively turns undo back on.
5018 So don't call truncate_undo_list if undo_list is Qt. */
5019 if (! EQ (nextb
->BUFFER_INTERNAL_FIELD (undo_list
), Qt
))
5021 Lisp_Object tail
, prev
;
5022 tail
= nextb
->BUFFER_INTERNAL_FIELD (undo_list
);
5024 while (CONSP (tail
))
5026 if (CONSP (XCAR (tail
))
5027 && MARKERP (XCAR (XCAR (tail
)))
5028 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
5031 nextb
->BUFFER_INTERNAL_FIELD (undo_list
) = tail
= XCDR (tail
);
5035 XSETCDR (prev
, tail
);
5045 /* Now that we have stripped the elements that need not be in the
5046 undo_list any more, we can finally mark the list. */
5047 mark_object (nextb
->BUFFER_INTERNAL_FIELD (undo_list
));
5049 nextb
= nextb
->next
;
5055 /* Clear the mark bits that we set in certain root slots. */
5057 unmark_byte_stack ();
5058 VECTOR_UNMARK (&buffer_defaults
);
5059 VECTOR_UNMARK (&buffer_local_symbols
);
5061 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
5069 /* clear_marks (); */
5072 consing_since_gc
= 0;
5073 if (gc_cons_threshold
< 10000)
5074 gc_cons_threshold
= 10000;
5076 if (FLOATP (Vgc_cons_percentage
))
5077 { /* Set gc_cons_combined_threshold. */
5080 tot
+= total_conses
* sizeof (struct Lisp_Cons
);
5081 tot
+= total_symbols
* sizeof (struct Lisp_Symbol
);
5082 tot
+= total_markers
* sizeof (union Lisp_Misc
);
5083 tot
+= total_string_size
;
5084 tot
+= total_vector_size
* sizeof (Lisp_Object
);
5085 tot
+= total_floats
* sizeof (struct Lisp_Float
);
5086 tot
+= total_intervals
* sizeof (struct interval
);
5087 tot
+= total_strings
* sizeof (struct Lisp_String
);
5089 gc_relative_threshold
= tot
* XFLOAT_DATA (Vgc_cons_percentage
);
5092 gc_relative_threshold
= 0;
5094 if (garbage_collection_messages
)
5096 if (message_p
|| minibuf_level
> 0)
5099 message1_nolog ("Garbage collecting...done");
5102 unbind_to (count
, Qnil
);
5104 total
[0] = Fcons (make_number (total_conses
),
5105 make_number (total_free_conses
));
5106 total
[1] = Fcons (make_number (total_symbols
),
5107 make_number (total_free_symbols
));
5108 total
[2] = Fcons (make_number (total_markers
),
5109 make_number (total_free_markers
));
5110 total
[3] = make_number (total_string_size
);
5111 total
[4] = make_number (total_vector_size
);
5112 total
[5] = Fcons (make_number (total_floats
),
5113 make_number (total_free_floats
));
5114 total
[6] = Fcons (make_number (total_intervals
),
5115 make_number (total_free_intervals
));
5116 total
[7] = Fcons (make_number (total_strings
),
5117 make_number (total_free_strings
));
5119 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5121 /* Compute average percentage of zombies. */
5124 for (i
= 0; i
< 7; ++i
)
5125 if (CONSP (total
[i
]))
5126 nlive
+= XFASTINT (XCAR (total
[i
]));
5128 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
5129 max_live
= max (nlive
, max_live
);
5130 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
5131 max_zombies
= max (nzombies
, max_zombies
);
5136 if (!NILP (Vpost_gc_hook
))
5138 int gc_count
= inhibit_garbage_collection ();
5139 safe_run_hooks (Qpost_gc_hook
);
5140 unbind_to (gc_count
, Qnil
);
5143 /* Accumulate statistics. */
5144 EMACS_GET_TIME (t2
);
5145 EMACS_SUB_TIME (t3
, t2
, t1
);
5146 if (FLOATP (Vgc_elapsed
))
5147 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
) +
5149 EMACS_USECS (t3
) * 1.0e-6);
5152 return Flist (sizeof total
/ sizeof *total
, total
);
5156 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
5157 only interesting objects referenced from glyphs are strings. */
5160 mark_glyph_matrix (struct glyph_matrix
*matrix
)
5162 struct glyph_row
*row
= matrix
->rows
;
5163 struct glyph_row
*end
= row
+ matrix
->nrows
;
5165 for (; row
< end
; ++row
)
5169 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
5171 struct glyph
*glyph
= row
->glyphs
[area
];
5172 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
5174 for (; glyph
< end_glyph
; ++glyph
)
5175 if (STRINGP (glyph
->object
)
5176 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
5177 mark_object (glyph
->object
);
5183 /* Mark Lisp faces in the face cache C. */
5186 mark_face_cache (struct face_cache
*c
)
5191 for (i
= 0; i
< c
->used
; ++i
)
5193 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
5197 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
5198 mark_object (face
->lface
[j
]);
5206 /* Mark reference to a Lisp_Object.
5207 If the object referred to has not been seen yet, recursively mark
5208 all the references contained in it. */
5210 #define LAST_MARKED_SIZE 500
5211 static Lisp_Object last_marked
[LAST_MARKED_SIZE
];
5212 static int last_marked_index
;
5214 /* For debugging--call abort when we cdr down this many
5215 links of a list, in mark_object. In debugging,
5216 the call to abort will hit a breakpoint.
5217 Normally this is zero and the check never goes off. */
5218 static size_t mark_object_loop_halt
;
5221 mark_vectorlike (struct Lisp_Vector
*ptr
)
5223 register EMACS_UINT size
= ptr
->size
;
5224 register EMACS_UINT i
;
5226 eassert (!VECTOR_MARKED_P (ptr
));
5227 VECTOR_MARK (ptr
); /* Else mark it */
5228 if (size
& PSEUDOVECTOR_FLAG
)
5229 size
&= PSEUDOVECTOR_SIZE_MASK
;
5231 /* Note that this size is not the memory-footprint size, but only
5232 the number of Lisp_Object fields that we should trace.
5233 The distinction is used e.g. by Lisp_Process which places extra
5234 non-Lisp_Object fields at the end of the structure. */
5235 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5236 mark_object (ptr
->contents
[i
]);
5239 /* Like mark_vectorlike but optimized for char-tables (and
5240 sub-char-tables) assuming that the contents are mostly integers or
5244 mark_char_table (struct Lisp_Vector
*ptr
)
5246 register EMACS_UINT size
= ptr
->size
& PSEUDOVECTOR_SIZE_MASK
;
5247 register EMACS_UINT i
;
5249 eassert (!VECTOR_MARKED_P (ptr
));
5251 for (i
= 0; i
< size
; i
++)
5253 Lisp_Object val
= ptr
->contents
[i
];
5255 if (INTEGERP (val
) || (SYMBOLP (val
) && XSYMBOL (val
)->gcmarkbit
))
5257 if (SUB_CHAR_TABLE_P (val
))
5259 if (! VECTOR_MARKED_P (XVECTOR (val
)))
5260 mark_char_table (XVECTOR (val
));
5268 mark_object (Lisp_Object arg
)
5270 register Lisp_Object obj
= arg
;
5271 #ifdef GC_CHECK_MARKED_OBJECTS
5275 size_t cdr_count
= 0;
5279 if (PURE_POINTER_P (XPNTR (obj
)))
5282 last_marked
[last_marked_index
++] = obj
;
5283 if (last_marked_index
== LAST_MARKED_SIZE
)
5284 last_marked_index
= 0;
5286 /* Perform some sanity checks on the objects marked here. Abort if
5287 we encounter an object we know is bogus. This increases GC time
5288 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
5289 #ifdef GC_CHECK_MARKED_OBJECTS
5291 po
= (void *) XPNTR (obj
);
5293 /* Check that the object pointed to by PO is known to be a Lisp
5294 structure allocated from the heap. */
5295 #define CHECK_ALLOCATED() \
5297 m = mem_find (po); \
5302 /* Check that the object pointed to by PO is live, using predicate
5304 #define CHECK_LIVE(LIVEP) \
5306 if (!LIVEP (m, po)) \
5310 /* Check both of the above conditions. */
5311 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
5313 CHECK_ALLOCATED (); \
5314 CHECK_LIVE (LIVEP); \
5317 #else /* not GC_CHECK_MARKED_OBJECTS */
5319 #define CHECK_LIVE(LIVEP) (void) 0
5320 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
5322 #endif /* not GC_CHECK_MARKED_OBJECTS */
5324 switch (SWITCH_ENUM_CAST (XTYPE (obj
)))
5328 register struct Lisp_String
*ptr
= XSTRING (obj
);
5329 if (STRING_MARKED_P (ptr
))
5331 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
5332 MARK_INTERVAL_TREE (ptr
->intervals
);
5334 #ifdef GC_CHECK_STRING_BYTES
5335 /* Check that the string size recorded in the string is the
5336 same as the one recorded in the sdata structure. */
5337 CHECK_STRING_BYTES (ptr
);
5338 #endif /* GC_CHECK_STRING_BYTES */
5342 case Lisp_Vectorlike
:
5343 if (VECTOR_MARKED_P (XVECTOR (obj
)))
5345 #ifdef GC_CHECK_MARKED_OBJECTS
5347 if (m
== MEM_NIL
&& !SUBRP (obj
)
5348 && po
!= &buffer_defaults
5349 && po
!= &buffer_local_symbols
)
5351 #endif /* GC_CHECK_MARKED_OBJECTS */
5355 #ifdef GC_CHECK_MARKED_OBJECTS
5356 if (po
!= &buffer_defaults
&& po
!= &buffer_local_symbols
)
5359 for (b
= all_buffers
; b
&& b
!= po
; b
= b
->next
)
5364 #endif /* GC_CHECK_MARKED_OBJECTS */
5367 else if (SUBRP (obj
))
5369 else if (COMPILEDP (obj
))
5370 /* We could treat this just like a vector, but it is better to
5371 save the COMPILED_CONSTANTS element for last and avoid
5374 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5375 register EMACS_UINT size
= ptr
->size
;
5376 register EMACS_UINT i
;
5378 CHECK_LIVE (live_vector_p
);
5379 VECTOR_MARK (ptr
); /* Else mark it */
5380 size
&= PSEUDOVECTOR_SIZE_MASK
;
5381 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5383 if (i
!= COMPILED_CONSTANTS
)
5384 mark_object (ptr
->contents
[i
]);
5386 obj
= ptr
->contents
[COMPILED_CONSTANTS
];
5389 else if (FRAMEP (obj
))
5391 register struct frame
*ptr
= XFRAME (obj
);
5392 mark_vectorlike (XVECTOR (obj
));
5393 mark_face_cache (ptr
->face_cache
);
5395 else if (WINDOWP (obj
))
5397 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5398 struct window
*w
= XWINDOW (obj
);
5399 mark_vectorlike (ptr
);
5400 /* Mark glyphs for leaf windows. Marking window matrices is
5401 sufficient because frame matrices use the same glyph
5403 if (NILP (w
->hchild
)
5405 && w
->current_matrix
)
5407 mark_glyph_matrix (w
->current_matrix
);
5408 mark_glyph_matrix (w
->desired_matrix
);
5411 else if (HASH_TABLE_P (obj
))
5413 struct Lisp_Hash_Table
*h
= XHASH_TABLE (obj
);
5414 mark_vectorlike ((struct Lisp_Vector
*)h
);
5415 /* If hash table is not weak, mark all keys and values.
5416 For weak tables, mark only the vector. */
5418 mark_object (h
->key_and_value
);
5420 VECTOR_MARK (XVECTOR (h
->key_and_value
));
5422 else if (CHAR_TABLE_P (obj
))
5423 mark_char_table (XVECTOR (obj
));
5425 mark_vectorlike (XVECTOR (obj
));
5430 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
5431 struct Lisp_Symbol
*ptrx
;
5435 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
5437 mark_object (ptr
->function
);
5438 mark_object (ptr
->plist
);
5439 switch (ptr
->redirect
)
5441 case SYMBOL_PLAINVAL
: mark_object (SYMBOL_VAL (ptr
)); break;
5442 case SYMBOL_VARALIAS
:
5445 XSETSYMBOL (tem
, SYMBOL_ALIAS (ptr
));
5449 case SYMBOL_LOCALIZED
:
5451 struct Lisp_Buffer_Local_Value
*blv
= SYMBOL_BLV (ptr
);
5452 /* If the value is forwarded to a buffer or keyboard field,
5453 these are marked when we see the corresponding object.
5454 And if it's forwarded to a C variable, either it's not
5455 a Lisp_Object var, or it's staticpro'd already. */
5456 mark_object (blv
->where
);
5457 mark_object (blv
->valcell
);
5458 mark_object (blv
->defcell
);
5461 case SYMBOL_FORWARDED
:
5462 /* If the value is forwarded to a buffer or keyboard field,
5463 these are marked when we see the corresponding object.
5464 And if it's forwarded to a C variable, either it's not
5465 a Lisp_Object var, or it's staticpro'd already. */
5469 if (!PURE_POINTER_P (XSTRING (ptr
->xname
)))
5470 MARK_STRING (XSTRING (ptr
->xname
));
5471 MARK_INTERVAL_TREE (STRING_INTERVALS (ptr
->xname
));
5476 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun */
5477 XSETSYMBOL (obj
, ptrx
);
5484 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
5485 if (XMISCANY (obj
)->gcmarkbit
)
5487 XMISCANY (obj
)->gcmarkbit
= 1;
5489 switch (XMISCTYPE (obj
))
5492 case Lisp_Misc_Marker
:
5493 /* DO NOT mark thru the marker's chain.
5494 The buffer's markers chain does not preserve markers from gc;
5495 instead, markers are removed from the chain when freed by gc. */
5498 case Lisp_Misc_Save_Value
:
5501 register struct Lisp_Save_Value
*ptr
= XSAVE_VALUE (obj
);
5502 /* If DOGC is set, POINTER is the address of a memory
5503 area containing INTEGER potential Lisp_Objects. */
5506 Lisp_Object
*p
= (Lisp_Object
*) ptr
->pointer
;
5508 for (nelt
= ptr
->integer
; nelt
> 0; nelt
--, p
++)
5509 mark_maybe_object (*p
);
5515 case Lisp_Misc_Overlay
:
5517 struct Lisp_Overlay
*ptr
= XOVERLAY (obj
);
5518 mark_object (ptr
->start
);
5519 mark_object (ptr
->end
);
5520 mark_object (ptr
->plist
);
5523 XSETMISC (obj
, ptr
->next
);
5536 register struct Lisp_Cons
*ptr
= XCONS (obj
);
5537 if (CONS_MARKED_P (ptr
))
5539 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
5541 /* If the cdr is nil, avoid recursion for the car. */
5542 if (EQ (ptr
->u
.cdr
, Qnil
))
5548 mark_object (ptr
->car
);
5551 if (cdr_count
== mark_object_loop_halt
)
5557 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
5558 FLOAT_MARK (XFLOAT (obj
));
5569 #undef CHECK_ALLOCATED
5570 #undef CHECK_ALLOCATED_AND_LIVE
5573 /* Mark the pointers in a buffer structure. */
5576 mark_buffer (Lisp_Object buf
)
5578 register struct buffer
*buffer
= XBUFFER (buf
);
5579 register Lisp_Object
*ptr
, tmp
;
5580 Lisp_Object base_buffer
;
5582 eassert (!VECTOR_MARKED_P (buffer
));
5583 VECTOR_MARK (buffer
);
5585 MARK_INTERVAL_TREE (BUF_INTERVALS (buffer
));
5587 /* For now, we just don't mark the undo_list. It's done later in
5588 a special way just before the sweep phase, and after stripping
5589 some of its elements that are not needed any more. */
5591 if (buffer
->overlays_before
)
5593 XSETMISC (tmp
, buffer
->overlays_before
);
5596 if (buffer
->overlays_after
)
5598 XSETMISC (tmp
, buffer
->overlays_after
);
5602 /* buffer-local Lisp variables start at `undo_list',
5603 tho only the ones from `name' on are GC'd normally. */
5604 for (ptr
= &buffer
->BUFFER_INTERNAL_FIELD (name
);
5605 (char *)ptr
< (char *)buffer
+ sizeof (struct buffer
);
5609 /* If this is an indirect buffer, mark its base buffer. */
5610 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
5612 XSETBUFFER (base_buffer
, buffer
->base_buffer
);
5613 mark_buffer (base_buffer
);
5617 /* Mark the Lisp pointers in the terminal objects.
5618 Called by the Fgarbage_collector. */
5621 mark_terminals (void)
5624 for (t
= terminal_list
; t
; t
= t
->next_terminal
)
5626 eassert (t
->name
!= NULL
);
5627 #ifdef HAVE_WINDOW_SYSTEM
5628 /* If a terminal object is reachable from a stacpro'ed object,
5629 it might have been marked already. Make sure the image cache
5631 mark_image_cache (t
->image_cache
);
5632 #endif /* HAVE_WINDOW_SYSTEM */
5633 if (!VECTOR_MARKED_P (t
))
5634 mark_vectorlike ((struct Lisp_Vector
*)t
);
5640 /* Value is non-zero if OBJ will survive the current GC because it's
5641 either marked or does not need to be marked to survive. */
5644 survives_gc_p (Lisp_Object obj
)
5648 switch (XTYPE (obj
))
5655 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
5659 survives_p
= XMISCANY (obj
)->gcmarkbit
;
5663 survives_p
= STRING_MARKED_P (XSTRING (obj
));
5666 case Lisp_Vectorlike
:
5667 survives_p
= SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
5671 survives_p
= CONS_MARKED_P (XCONS (obj
));
5675 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
5682 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
5687 /* Sweep: find all structures not marked, and free them. */
5692 /* Remove or mark entries in weak hash tables.
5693 This must be done before any object is unmarked. */
5694 sweep_weak_hash_tables ();
5697 #ifdef GC_CHECK_STRING_BYTES
5698 if (!noninteractive
)
5699 check_string_bytes (1);
5702 /* Put all unmarked conses on free list */
5704 register struct cons_block
*cblk
;
5705 struct cons_block
**cprev
= &cons_block
;
5706 register int lim
= cons_block_index
;
5707 register int num_free
= 0, num_used
= 0;
5711 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
5715 int ilim
= (lim
+ BITS_PER_INT
- 1) / BITS_PER_INT
;
5717 /* Scan the mark bits an int at a time. */
5718 for (i
= 0; i
<= ilim
; i
++)
5720 if (cblk
->gcmarkbits
[i
] == -1)
5722 /* Fast path - all cons cells for this int are marked. */
5723 cblk
->gcmarkbits
[i
] = 0;
5724 num_used
+= BITS_PER_INT
;
5728 /* Some cons cells for this int are not marked.
5729 Find which ones, and free them. */
5730 int start
, pos
, stop
;
5732 start
= i
* BITS_PER_INT
;
5734 if (stop
> BITS_PER_INT
)
5735 stop
= BITS_PER_INT
;
5738 for (pos
= start
; pos
< stop
; pos
++)
5740 if (!CONS_MARKED_P (&cblk
->conses
[pos
]))
5743 cblk
->conses
[pos
].u
.chain
= cons_free_list
;
5744 cons_free_list
= &cblk
->conses
[pos
];
5746 cons_free_list
->car
= Vdead
;
5752 CONS_UNMARK (&cblk
->conses
[pos
]);
5758 lim
= CONS_BLOCK_SIZE
;
5759 /* If this block contains only free conses and we have already
5760 seen more than two blocks worth of free conses then deallocate
5762 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
5764 *cprev
= cblk
->next
;
5765 /* Unhook from the free list. */
5766 cons_free_list
= cblk
->conses
[0].u
.chain
;
5767 lisp_align_free (cblk
);
5772 num_free
+= this_free
;
5773 cprev
= &cblk
->next
;
5776 total_conses
= num_used
;
5777 total_free_conses
= num_free
;
5780 /* Put all unmarked floats on free list */
5782 register struct float_block
*fblk
;
5783 struct float_block
**fprev
= &float_block
;
5784 register int lim
= float_block_index
;
5785 register int num_free
= 0, num_used
= 0;
5787 float_free_list
= 0;
5789 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
5793 for (i
= 0; i
< lim
; i
++)
5794 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
5797 fblk
->floats
[i
].u
.chain
= float_free_list
;
5798 float_free_list
= &fblk
->floats
[i
];
5803 FLOAT_UNMARK (&fblk
->floats
[i
]);
5805 lim
= FLOAT_BLOCK_SIZE
;
5806 /* If this block contains only free floats and we have already
5807 seen more than two blocks worth of free floats then deallocate
5809 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
5811 *fprev
= fblk
->next
;
5812 /* Unhook from the free list. */
5813 float_free_list
= fblk
->floats
[0].u
.chain
;
5814 lisp_align_free (fblk
);
5819 num_free
+= this_free
;
5820 fprev
= &fblk
->next
;
5823 total_floats
= num_used
;
5824 total_free_floats
= num_free
;
5827 /* Put all unmarked intervals on free list */
5829 register struct interval_block
*iblk
;
5830 struct interval_block
**iprev
= &interval_block
;
5831 register int lim
= interval_block_index
;
5832 register int num_free
= 0, num_used
= 0;
5834 interval_free_list
= 0;
5836 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
5841 for (i
= 0; i
< lim
; i
++)
5843 if (!iblk
->intervals
[i
].gcmarkbit
)
5845 SET_INTERVAL_PARENT (&iblk
->intervals
[i
], interval_free_list
);
5846 interval_free_list
= &iblk
->intervals
[i
];
5852 iblk
->intervals
[i
].gcmarkbit
= 0;
5855 lim
= INTERVAL_BLOCK_SIZE
;
5856 /* If this block contains only free intervals and we have already
5857 seen more than two blocks worth of free intervals then
5858 deallocate this block. */
5859 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
5861 *iprev
= iblk
->next
;
5862 /* Unhook from the free list. */
5863 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
5865 n_interval_blocks
--;
5869 num_free
+= this_free
;
5870 iprev
= &iblk
->next
;
5873 total_intervals
= num_used
;
5874 total_free_intervals
= num_free
;
5877 /* Put all unmarked symbols on free list */
5879 register struct symbol_block
*sblk
;
5880 struct symbol_block
**sprev
= &symbol_block
;
5881 register int lim
= symbol_block_index
;
5882 register int num_free
= 0, num_used
= 0;
5884 symbol_free_list
= NULL
;
5886 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
5889 struct Lisp_Symbol
*sym
= sblk
->symbols
;
5890 struct Lisp_Symbol
*end
= sym
+ lim
;
5892 for (; sym
< end
; ++sym
)
5894 /* Check if the symbol was created during loadup. In such a case
5895 it might be pointed to by pure bytecode which we don't trace,
5896 so we conservatively assume that it is live. */
5897 int pure_p
= PURE_POINTER_P (XSTRING (sym
->xname
));
5899 if (!sym
->gcmarkbit
&& !pure_p
)
5901 if (sym
->redirect
== SYMBOL_LOCALIZED
)
5902 xfree (SYMBOL_BLV (sym
));
5903 sym
->next
= symbol_free_list
;
5904 symbol_free_list
= sym
;
5906 symbol_free_list
->function
= Vdead
;
5914 UNMARK_STRING (XSTRING (sym
->xname
));
5919 lim
= SYMBOL_BLOCK_SIZE
;
5920 /* If this block contains only free symbols and we have already
5921 seen more than two blocks worth of free symbols then deallocate
5923 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
5925 *sprev
= sblk
->next
;
5926 /* Unhook from the free list. */
5927 symbol_free_list
= sblk
->symbols
[0].next
;
5933 num_free
+= this_free
;
5934 sprev
= &sblk
->next
;
5937 total_symbols
= num_used
;
5938 total_free_symbols
= num_free
;
5941 /* Put all unmarked misc's on free list.
5942 For a marker, first unchain it from the buffer it points into. */
5944 register struct marker_block
*mblk
;
5945 struct marker_block
**mprev
= &marker_block
;
5946 register int lim
= marker_block_index
;
5947 register int num_free
= 0, num_used
= 0;
5949 marker_free_list
= 0;
5951 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
5956 for (i
= 0; i
< lim
; i
++)
5958 if (!mblk
->markers
[i
].u_any
.gcmarkbit
)
5960 if (mblk
->markers
[i
].u_any
.type
== Lisp_Misc_Marker
)
5961 unchain_marker (&mblk
->markers
[i
].u_marker
);
5962 /* Set the type of the freed object to Lisp_Misc_Free.
5963 We could leave the type alone, since nobody checks it,
5964 but this might catch bugs faster. */
5965 mblk
->markers
[i
].u_marker
.type
= Lisp_Misc_Free
;
5966 mblk
->markers
[i
].u_free
.chain
= marker_free_list
;
5967 marker_free_list
= &mblk
->markers
[i
];
5973 mblk
->markers
[i
].u_any
.gcmarkbit
= 0;
5976 lim
= MARKER_BLOCK_SIZE
;
5977 /* If this block contains only free markers and we have already
5978 seen more than two blocks worth of free markers then deallocate
5980 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
5982 *mprev
= mblk
->next
;
5983 /* Unhook from the free list. */
5984 marker_free_list
= mblk
->markers
[0].u_free
.chain
;
5990 num_free
+= this_free
;
5991 mprev
= &mblk
->next
;
5995 total_markers
= num_used
;
5996 total_free_markers
= num_free
;
5999 /* Free all unmarked buffers */
6001 register struct buffer
*buffer
= all_buffers
, *prev
= 0, *next
;
6004 if (!VECTOR_MARKED_P (buffer
))
6007 prev
->next
= buffer
->next
;
6009 all_buffers
= buffer
->next
;
6010 next
= buffer
->next
;
6016 VECTOR_UNMARK (buffer
);
6017 UNMARK_BALANCE_INTERVALS (BUF_INTERVALS (buffer
));
6018 prev
= buffer
, buffer
= buffer
->next
;
6022 /* Free all unmarked vectors */
6024 register struct Lisp_Vector
*vector
= all_vectors
, *prev
= 0, *next
;
6025 total_vector_size
= 0;
6028 if (!VECTOR_MARKED_P (vector
))
6031 prev
->next
= vector
->next
;
6033 all_vectors
= vector
->next
;
6034 next
= vector
->next
;
6042 VECTOR_UNMARK (vector
);
6043 if (vector
->size
& PSEUDOVECTOR_FLAG
)
6044 total_vector_size
+= (PSEUDOVECTOR_SIZE_MASK
& vector
->size
);
6046 total_vector_size
+= vector
->size
;
6047 prev
= vector
, vector
= vector
->next
;
6051 #ifdef GC_CHECK_STRING_BYTES
6052 if (!noninteractive
)
6053 check_string_bytes (1);
6060 /* Debugging aids. */
6062 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
6063 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
6064 This may be helpful in debugging Emacs's memory usage.
6065 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
6070 XSETINT (end
, (EMACS_INT
) (char *) sbrk (0) / 1024);
6075 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
6076 doc
: /* Return a list of counters that measure how much consing there has been.
6077 Each of these counters increments for a certain kind of object.
6078 The counters wrap around from the largest positive integer to zero.
6079 Garbage collection does not decrease them.
6080 The elements of the value are as follows:
6081 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
6082 All are in units of 1 = one object consed
6083 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
6085 MISCS include overlays, markers, and some internal types.
6086 Frames, windows, buffers, and subprocesses count as vectors
6087 (but the contents of a buffer's text do not count here). */)
6090 Lisp_Object consed
[8];
6092 consed
[0] = make_number (min (MOST_POSITIVE_FIXNUM
, cons_cells_consed
));
6093 consed
[1] = make_number (min (MOST_POSITIVE_FIXNUM
, floats_consed
));
6094 consed
[2] = make_number (min (MOST_POSITIVE_FIXNUM
, vector_cells_consed
));
6095 consed
[3] = make_number (min (MOST_POSITIVE_FIXNUM
, symbols_consed
));
6096 consed
[4] = make_number (min (MOST_POSITIVE_FIXNUM
, string_chars_consed
));
6097 consed
[5] = make_number (min (MOST_POSITIVE_FIXNUM
, misc_objects_consed
));
6098 consed
[6] = make_number (min (MOST_POSITIVE_FIXNUM
, intervals_consed
));
6099 consed
[7] = make_number (min (MOST_POSITIVE_FIXNUM
, strings_consed
));
6101 return Flist (8, consed
);
6104 #ifdef ENABLE_CHECKING
6105 int suppress_checking
;
6108 die (const char *msg
, const char *file
, int line
)
6110 fprintf (stderr
, "\r\n%s:%d: Emacs fatal error: %s\r\n",
6116 /* Initialization */
6119 init_alloc_once (void)
6121 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
6123 pure_size
= PURESIZE
;
6124 pure_bytes_used
= 0;
6125 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
6126 pure_bytes_used_before_overflow
= 0;
6128 /* Initialize the list of free aligned blocks. */
6131 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
6133 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
6137 ignore_warnings
= 1;
6138 #ifdef DOUG_LEA_MALLOC
6139 mallopt (M_TRIM_THRESHOLD
, 128*1024); /* trim threshold */
6140 mallopt (M_MMAP_THRESHOLD
, 64*1024); /* mmap threshold */
6141 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* max. number of mmap'ed areas */
6149 init_weak_hash_tables ();
6152 malloc_hysteresis
= 32;
6154 malloc_hysteresis
= 0;
6157 refill_memory_reserve ();
6159 ignore_warnings
= 0;
6161 byte_stack_list
= 0;
6163 consing_since_gc
= 0;
6164 gc_cons_threshold
= 100000 * sizeof (Lisp_Object
);
6165 gc_relative_threshold
= 0;
6172 byte_stack_list
= 0;
6174 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
6175 setjmp_tested_p
= longjmps_done
= 0;
6178 Vgc_elapsed
= make_float (0.0);
6183 syms_of_alloc (void)
6185 DEFVAR_INT ("gc-cons-threshold", gc_cons_threshold
,
6186 doc
: /* *Number of bytes of consing between garbage collections.
6187 Garbage collection can happen automatically once this many bytes have been
6188 allocated since the last garbage collection. All data types count.
6190 Garbage collection happens automatically only when `eval' is called.
6192 By binding this temporarily to a large number, you can effectively
6193 prevent garbage collection during a part of the program.
6194 See also `gc-cons-percentage'. */);
6196 DEFVAR_LISP ("gc-cons-percentage", Vgc_cons_percentage
,
6197 doc
: /* *Portion of the heap used for allocation.
6198 Garbage collection can happen automatically once this portion of the heap
6199 has been allocated since the last garbage collection.
6200 If this portion is smaller than `gc-cons-threshold', this is ignored. */);
6201 Vgc_cons_percentage
= make_float (0.1);
6203 DEFVAR_INT ("pure-bytes-used", pure_bytes_used
,
6204 doc
: /* Number of bytes of sharable Lisp data allocated so far. */);
6206 DEFVAR_INT ("cons-cells-consed", cons_cells_consed
,
6207 doc
: /* Number of cons cells that have been consed so far. */);
6209 DEFVAR_INT ("floats-consed", floats_consed
,
6210 doc
: /* Number of floats that have been consed so far. */);
6212 DEFVAR_INT ("vector-cells-consed", vector_cells_consed
,
6213 doc
: /* Number of vector cells that have been consed so far. */);
6215 DEFVAR_INT ("symbols-consed", symbols_consed
,
6216 doc
: /* Number of symbols that have been consed so far. */);
6218 DEFVAR_INT ("string-chars-consed", string_chars_consed
,
6219 doc
: /* Number of string characters that have been consed so far. */);
6221 DEFVAR_INT ("misc-objects-consed", misc_objects_consed
,
6222 doc
: /* Number of miscellaneous objects that have been consed so far. */);
6224 DEFVAR_INT ("intervals-consed", intervals_consed
,
6225 doc
: /* Number of intervals that have been consed so far. */);
6227 DEFVAR_INT ("strings-consed", strings_consed
,
6228 doc
: /* Number of strings that have been consed so far. */);
6230 DEFVAR_LISP ("purify-flag", Vpurify_flag
,
6231 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
6232 This means that certain objects should be allocated in shared (pure) space.
6233 It can also be set to a hash-table, in which case this table is used to
6234 do hash-consing of the objects allocated to pure space. */);
6236 DEFVAR_BOOL ("garbage-collection-messages", garbage_collection_messages
,
6237 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
6238 garbage_collection_messages
= 0;
6240 DEFVAR_LISP ("post-gc-hook", Vpost_gc_hook
,
6241 doc
: /* Hook run after garbage collection has finished. */);
6242 Vpost_gc_hook
= Qnil
;
6243 Qpost_gc_hook
= intern_c_string ("post-gc-hook");
6244 staticpro (&Qpost_gc_hook
);
6246 DEFVAR_LISP ("memory-signal-data", Vmemory_signal_data
,
6247 doc
: /* Precomputed `signal' argument for memory-full error. */);
6248 /* We build this in advance because if we wait until we need it, we might
6249 not be able to allocate the memory to hold it. */
6251 = pure_cons (Qerror
,
6252 pure_cons (make_pure_c_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"), Qnil
));
6254 DEFVAR_LISP ("memory-full", Vmemory_full
,
6255 doc
: /* Non-nil means Emacs cannot get much more Lisp memory. */);
6256 Vmemory_full
= Qnil
;
6258 staticpro (&Qgc_cons_threshold
);
6259 Qgc_cons_threshold
= intern_c_string ("gc-cons-threshold");
6261 staticpro (&Qchar_table_extra_slots
);
6262 Qchar_table_extra_slots
= intern_c_string ("char-table-extra-slots");
6264 DEFVAR_LISP ("gc-elapsed", Vgc_elapsed
,
6265 doc
: /* Accumulated time elapsed in garbage collections.
6266 The time is in seconds as a floating point value. */);
6267 DEFVAR_INT ("gcs-done", gcs_done
,
6268 doc
: /* Accumulated number of garbage collections done. */);
6273 defsubr (&Smake_byte_code
);
6274 defsubr (&Smake_list
);
6275 defsubr (&Smake_vector
);
6276 defsubr (&Smake_string
);
6277 defsubr (&Smake_bool_vector
);
6278 defsubr (&Smake_symbol
);
6279 defsubr (&Smake_marker
);
6280 defsubr (&Spurecopy
);
6281 defsubr (&Sgarbage_collect
);
6282 defsubr (&Smemory_limit
);
6283 defsubr (&Smemory_use_counts
);
6285 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
6286 defsubr (&Sgc_status
);