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. */
27 #ifdef HAVE_GTK_AND_PTHREAD
31 /* This file is part of the core Lisp implementation, and thus must
32 deal with the real data structures. If the Lisp implementation is
33 replaced, this file likely will not be used. */
35 #undef HIDE_LISP_IMPLEMENTATION
38 #include "intervals.h"
44 #include "blockinput.h"
45 #include "character.h"
46 #include "syssignal.h"
47 #include "termhooks.h" /* For struct terminal. */
50 /* GC_MALLOC_CHECK defined means perform validity checks of malloc'd
51 memory. Can do this only if using gmalloc.c. */
53 #if defined SYSTEM_MALLOC || defined DOUG_LEA_MALLOC
54 #undef GC_MALLOC_CHECK
59 extern POINTER_TYPE
*sbrk ();
68 #ifdef DOUG_LEA_MALLOC
71 /* malloc.h #defines this as size_t, at least in glibc2. */
72 #ifndef __malloc_size_t
73 #define __malloc_size_t int
76 /* Specify maximum number of areas to mmap. It would be nice to use a
77 value that explicitly means "no limit". */
79 #define MMAP_MAX_AREAS 100000000
81 #else /* not DOUG_LEA_MALLOC */
83 /* The following come from gmalloc.c. */
85 #define __malloc_size_t size_t
86 extern __malloc_size_t _bytes_used
;
87 extern __malloc_size_t __malloc_extra_blocks
;
89 #endif /* not DOUG_LEA_MALLOC */
91 #if ! defined SYSTEM_MALLOC && ! defined SYNC_INPUT
92 #ifdef HAVE_GTK_AND_PTHREAD
94 /* When GTK uses the file chooser dialog, different backends can be loaded
95 dynamically. One such a backend is the Gnome VFS backend that gets loaded
96 if you run Gnome. That backend creates several threads and also allocates
99 If Emacs sets malloc hooks (! SYSTEM_MALLOC) and the emacs_blocked_*
100 functions below are called from malloc, there is a chance that one
101 of these threads preempts the Emacs main thread and the hook variables
102 end up in an inconsistent state. So we have a mutex to prevent that (note
103 that the backend handles concurrent access to malloc within its own threads
104 but Emacs code running in the main thread is not included in that control).
106 When UNBLOCK_INPUT is called, reinvoke_input_signal may be called. If this
107 happens in one of the backend threads we will have two threads that tries
108 to run Emacs code at once, and the code is not prepared for that.
109 To prevent that, we only call BLOCK/UNBLOCK from the main thread. */
111 static pthread_mutex_t alloc_mutex
;
113 #define BLOCK_INPUT_ALLOC \
116 if (pthread_equal (pthread_self (), main_thread)) \
118 pthread_mutex_lock (&alloc_mutex); \
121 #define UNBLOCK_INPUT_ALLOC \
124 pthread_mutex_unlock (&alloc_mutex); \
125 if (pthread_equal (pthread_self (), main_thread)) \
130 #else /* ! defined HAVE_GTK_AND_PTHREAD */
132 #define BLOCK_INPUT_ALLOC BLOCK_INPUT
133 #define UNBLOCK_INPUT_ALLOC UNBLOCK_INPUT
135 #endif /* ! defined HAVE_GTK_AND_PTHREAD */
136 #endif /* ! defined SYSTEM_MALLOC && ! defined SYNC_INPUT */
138 /* Mark, unmark, query mark bit of a Lisp string. S must be a pointer
139 to a struct Lisp_String. */
141 #define MARK_STRING(S) ((S)->size |= ARRAY_MARK_FLAG)
142 #define UNMARK_STRING(S) ((S)->size &= ~ARRAY_MARK_FLAG)
143 #define STRING_MARKED_P(S) (((S)->size & ARRAY_MARK_FLAG) != 0)
145 #define VECTOR_MARK(V) ((V)->header.size |= ARRAY_MARK_FLAG)
146 #define VECTOR_UNMARK(V) ((V)->header.size &= ~ARRAY_MARK_FLAG)
147 #define VECTOR_MARKED_P(V) (((V)->header.size & ARRAY_MARK_FLAG) != 0)
149 /* Value is the number of bytes of S, a pointer to a struct Lisp_String.
150 Be careful during GC, because S->size contains the mark bit for
153 #define GC_STRING_BYTES(S) (STRING_BYTES (S))
155 /* Global variables. */
156 struct emacs_globals globals
;
158 /* Number of bytes of consing done since the last gc. */
160 EMACS_INT consing_since_gc
;
162 /* Similar minimum, computed from Vgc_cons_percentage. */
164 EMACS_INT gc_relative_threshold
;
166 /* Minimum number of bytes of consing since GC before next GC,
167 when memory is full. */
169 EMACS_INT memory_full_cons_threshold
;
171 /* Nonzero during GC. */
175 /* Nonzero means abort if try to GC.
176 This is for code which is written on the assumption that
177 no GC will happen, so as to verify that assumption. */
181 /* Number of live and free conses etc. */
183 static int total_conses
, total_markers
, total_symbols
, total_vector_size
;
184 static int total_free_conses
, total_free_markers
, total_free_symbols
;
185 static int total_free_floats
, total_floats
;
187 /* Points to memory space allocated as "spare", to be freed if we run
188 out of memory. We keep one large block, four cons-blocks, and
189 two string blocks. */
191 static char *spare_memory
[7];
193 /* Amount of spare memory to keep in large reserve block, or to see
194 whether this much is available when malloc fails on a larger request. */
196 #define SPARE_MEMORY (1 << 14)
198 /* Number of extra blocks malloc should get when it needs more core. */
200 static int malloc_hysteresis
;
202 /* Initialize it to a nonzero value to force it into data space
203 (rather than bss space). That way unexec will remap it into text
204 space (pure), on some systems. We have not implemented the
205 remapping on more recent systems because this is less important
206 nowadays than in the days of small memories and timesharing. */
208 #ifndef VIRT_ADDR_VARIES
211 EMACS_INT pure
[(PURESIZE
+ sizeof (EMACS_INT
) - 1) / sizeof (EMACS_INT
)] = {1,};
212 #define PUREBEG (char *) pure
214 /* Pointer to the pure area, and its size. */
216 static char *purebeg
;
217 static size_t pure_size
;
219 /* Number of bytes of pure storage used before pure storage overflowed.
220 If this is non-zero, this implies that an overflow occurred. */
222 static size_t pure_bytes_used_before_overflow
;
224 /* Value is non-zero if P points into pure space. */
226 #define PURE_POINTER_P(P) \
227 (((PNTR_COMPARISON_TYPE) (P) \
228 < (PNTR_COMPARISON_TYPE) ((char *) purebeg + pure_size)) \
229 && ((PNTR_COMPARISON_TYPE) (P) \
230 >= (PNTR_COMPARISON_TYPE) purebeg))
232 /* Index in pure at which next pure Lisp object will be allocated.. */
234 static EMACS_INT pure_bytes_used_lisp
;
236 /* Number of bytes allocated for non-Lisp objects in pure storage. */
238 static EMACS_INT pure_bytes_used_non_lisp
;
240 /* If nonzero, this is a warning delivered by malloc and not yet
243 const char *pending_malloc_warning
;
245 /* Maximum amount of C stack to save when a GC happens. */
247 #ifndef MAX_SAVE_STACK
248 #define MAX_SAVE_STACK 16000
251 /* Buffer in which we save a copy of the C stack at each GC. */
253 #if MAX_SAVE_STACK > 0
254 static char *stack_copy
;
255 static size_t stack_copy_size
;
258 /* Non-zero means ignore malloc warnings. Set during initialization.
259 Currently not used. */
261 static int ignore_warnings
;
263 static Lisp_Object Qgc_cons_threshold
;
264 Lisp_Object Qchar_table_extra_slots
;
266 /* Hook run after GC has finished. */
268 static Lisp_Object Qpost_gc_hook
;
270 static void mark_buffer (Lisp_Object
);
271 static void mark_terminals (void);
272 static void gc_sweep (void);
273 static void mark_glyph_matrix (struct glyph_matrix
*);
274 static void mark_face_cache (struct face_cache
*);
276 #if !defined REL_ALLOC || defined SYSTEM_MALLOC
277 static void refill_memory_reserve (void);
279 static struct Lisp_String
*allocate_string (void);
280 static void compact_small_strings (void);
281 static void free_large_strings (void);
282 static void sweep_strings (void);
283 static void free_misc (Lisp_Object
);
285 /* When scanning the C stack for live Lisp objects, Emacs keeps track
286 of what memory allocated via lisp_malloc is intended for what
287 purpose. This enumeration specifies the type of memory. */
298 /* We used to keep separate mem_types for subtypes of vectors such as
299 process, hash_table, frame, terminal, and window, but we never made
300 use of the distinction, so it only caused source-code complexity
301 and runtime slowdown. Minor but pointless. */
305 static POINTER_TYPE
*lisp_align_malloc (size_t, enum mem_type
);
306 static POINTER_TYPE
*lisp_malloc (size_t, enum mem_type
);
309 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
311 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
312 #include <stdio.h> /* For fprintf. */
315 /* A unique object in pure space used to make some Lisp objects
316 on free lists recognizable in O(1). */
318 static Lisp_Object Vdead
;
320 #ifdef GC_MALLOC_CHECK
322 enum mem_type allocated_mem_type
;
323 static int dont_register_blocks
;
325 #endif /* GC_MALLOC_CHECK */
327 /* A node in the red-black tree describing allocated memory containing
328 Lisp data. Each such block is recorded with its start and end
329 address when it is allocated, and removed from the tree when it
332 A red-black tree is a balanced binary tree with the following
335 1. Every node is either red or black.
336 2. Every leaf is black.
337 3. If a node is red, then both of its children are black.
338 4. Every simple path from a node to a descendant leaf contains
339 the same number of black nodes.
340 5. The root is always black.
342 When nodes are inserted into the tree, or deleted from the tree,
343 the tree is "fixed" so that these properties are always true.
345 A red-black tree with N internal nodes has height at most 2
346 log(N+1). Searches, insertions and deletions are done in O(log N).
347 Please see a text book about data structures for a detailed
348 description of red-black trees. Any book worth its salt should
353 /* Children of this node. These pointers are never NULL. When there
354 is no child, the value is MEM_NIL, which points to a dummy node. */
355 struct mem_node
*left
, *right
;
357 /* The parent of this node. In the root node, this is NULL. */
358 struct mem_node
*parent
;
360 /* Start and end of allocated region. */
364 enum {MEM_BLACK
, MEM_RED
} color
;
370 /* Base address of stack. Set in main. */
372 Lisp_Object
*stack_base
;
374 /* Root of the tree describing allocated Lisp memory. */
376 static struct mem_node
*mem_root
;
378 /* Lowest and highest known address in the heap. */
380 static void *min_heap_address
, *max_heap_address
;
382 /* Sentinel node of the tree. */
384 static struct mem_node mem_z
;
385 #define MEM_NIL &mem_z
387 static struct Lisp_Vector
*allocate_vectorlike (EMACS_INT
);
388 static void lisp_free (POINTER_TYPE
*);
389 static void mark_stack (void);
390 static int live_vector_p (struct mem_node
*, void *);
391 static int live_buffer_p (struct mem_node
*, void *);
392 static int live_string_p (struct mem_node
*, void *);
393 static int live_cons_p (struct mem_node
*, void *);
394 static int live_symbol_p (struct mem_node
*, void *);
395 static int live_float_p (struct mem_node
*, void *);
396 static int live_misc_p (struct mem_node
*, void *);
397 static void mark_maybe_object (Lisp_Object
);
398 static void mark_memory (void *, void *, int);
399 static void mem_init (void);
400 static struct mem_node
*mem_insert (void *, void *, enum mem_type
);
401 static void mem_insert_fixup (struct mem_node
*);
402 static void mem_rotate_left (struct mem_node
*);
403 static void mem_rotate_right (struct mem_node
*);
404 static void mem_delete (struct mem_node
*);
405 static void mem_delete_fixup (struct mem_node
*);
406 static inline struct mem_node
*mem_find (void *);
409 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
410 static void check_gcpros (void);
413 #endif /* GC_MARK_STACK || GC_MALLOC_CHECK */
415 /* Recording what needs to be marked for gc. */
417 struct gcpro
*gcprolist
;
419 /* Addresses of staticpro'd variables. Initialize it to a nonzero
420 value; otherwise some compilers put it into BSS. */
422 #define NSTATICS 0x640
423 static Lisp_Object
*staticvec
[NSTATICS
] = {&Vpurify_flag
};
425 /* Index of next unused slot in staticvec. */
427 static int staticidx
= 0;
429 static POINTER_TYPE
*pure_alloc (size_t, int);
432 /* Value is SZ rounded up to the next multiple of ALIGNMENT.
433 ALIGNMENT must be a power of 2. */
435 #define ALIGN(ptr, ALIGNMENT) \
436 ((POINTER_TYPE *) ((((uintptr_t) (ptr)) + (ALIGNMENT) - 1) \
437 & ~((ALIGNMENT) - 1)))
441 /************************************************************************
443 ************************************************************************/
445 /* Function malloc calls this if it finds we are near exhausting storage. */
448 malloc_warning (const char *str
)
450 pending_malloc_warning
= str
;
454 /* Display an already-pending malloc warning. */
457 display_malloc_warning (void)
459 call3 (intern ("display-warning"),
461 build_string (pending_malloc_warning
),
462 intern ("emergency"));
463 pending_malloc_warning
= 0;
466 /* Called if we can't allocate relocatable space for a buffer. */
469 buffer_memory_full (EMACS_INT nbytes
)
471 /* If buffers use the relocating allocator, no need to free
472 spare_memory, because we may have plenty of malloc space left
473 that we could get, and if we don't, the malloc that fails will
474 itself cause spare_memory to be freed. If buffers don't use the
475 relocating allocator, treat this like any other failing
479 memory_full (nbytes
);
482 /* This used to call error, but if we've run out of memory, we could
483 get infinite recursion trying to build the string. */
484 xsignal (Qnil
, Vmemory_signal_data
);
488 #ifdef XMALLOC_OVERRUN_CHECK
490 /* Check for overrun in malloc'ed buffers by wrapping a 16 byte header
491 and a 16 byte trailer around each block.
493 The header consists of 12 fixed bytes + a 4 byte integer contaning the
494 original block size, while the trailer consists of 16 fixed bytes.
496 The header is used to detect whether this block has been allocated
497 through these functions -- as it seems that some low-level libc
498 functions may bypass the malloc hooks.
502 #define XMALLOC_OVERRUN_CHECK_SIZE 16
504 static char xmalloc_overrun_check_header
[XMALLOC_OVERRUN_CHECK_SIZE
-4] =
505 { 0x9a, 0x9b, 0xae, 0xaf,
506 0xbf, 0xbe, 0xce, 0xcf,
507 0xea, 0xeb, 0xec, 0xed };
509 static char xmalloc_overrun_check_trailer
[XMALLOC_OVERRUN_CHECK_SIZE
] =
510 { 0xaa, 0xab, 0xac, 0xad,
511 0xba, 0xbb, 0xbc, 0xbd,
512 0xca, 0xcb, 0xcc, 0xcd,
513 0xda, 0xdb, 0xdc, 0xdd };
515 /* Macros to insert and extract the block size in the header. */
517 #define XMALLOC_PUT_SIZE(ptr, size) \
518 (ptr[-1] = (size & 0xff), \
519 ptr[-2] = ((size >> 8) & 0xff), \
520 ptr[-3] = ((size >> 16) & 0xff), \
521 ptr[-4] = ((size >> 24) & 0xff))
523 #define XMALLOC_GET_SIZE(ptr) \
524 (size_t)((unsigned)(ptr[-1]) | \
525 ((unsigned)(ptr[-2]) << 8) | \
526 ((unsigned)(ptr[-3]) << 16) | \
527 ((unsigned)(ptr[-4]) << 24))
530 /* The call depth in overrun_check functions. For example, this might happen:
532 overrun_check_malloc()
533 -> malloc -> (via hook)_-> emacs_blocked_malloc
534 -> overrun_check_malloc
535 call malloc (hooks are NULL, so real malloc is called).
536 malloc returns 10000.
537 add overhead, return 10016.
538 <- (back in overrun_check_malloc)
539 add overhead again, return 10032
540 xmalloc returns 10032.
545 overrun_check_free(10032)
547 free(10016) <- crash, because 10000 is the original pointer. */
549 static int check_depth
;
551 /* Like malloc, but wraps allocated block with header and trailer. */
553 static POINTER_TYPE
*
554 overrun_check_malloc (size_t size
)
556 register unsigned char *val
;
557 size_t overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_SIZE
*2 : 0;
559 val
= (unsigned char *) malloc (size
+ overhead
);
560 if (val
&& check_depth
== 1)
562 memcpy (val
, xmalloc_overrun_check_header
,
563 XMALLOC_OVERRUN_CHECK_SIZE
- 4);
564 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
565 XMALLOC_PUT_SIZE(val
, size
);
566 memcpy (val
+ size
, xmalloc_overrun_check_trailer
,
567 XMALLOC_OVERRUN_CHECK_SIZE
);
570 return (POINTER_TYPE
*)val
;
574 /* Like realloc, but checks old block for overrun, and wraps new block
575 with header and trailer. */
577 static POINTER_TYPE
*
578 overrun_check_realloc (POINTER_TYPE
*block
, size_t size
)
580 register unsigned char *val
= (unsigned char *) block
;
581 size_t overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_SIZE
*2 : 0;
585 && memcmp (xmalloc_overrun_check_header
,
586 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
587 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
589 size_t osize
= XMALLOC_GET_SIZE (val
);
590 if (memcmp (xmalloc_overrun_check_trailer
, val
+ osize
,
591 XMALLOC_OVERRUN_CHECK_SIZE
))
593 memset (val
+ osize
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
594 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
595 memset (val
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
598 val
= (unsigned char *) realloc ((POINTER_TYPE
*)val
, size
+ overhead
);
600 if (val
&& check_depth
== 1)
602 memcpy (val
, xmalloc_overrun_check_header
,
603 XMALLOC_OVERRUN_CHECK_SIZE
- 4);
604 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
605 XMALLOC_PUT_SIZE(val
, size
);
606 memcpy (val
+ size
, xmalloc_overrun_check_trailer
,
607 XMALLOC_OVERRUN_CHECK_SIZE
);
610 return (POINTER_TYPE
*)val
;
613 /* Like free, but checks block for overrun. */
616 overrun_check_free (POINTER_TYPE
*block
)
618 unsigned char *val
= (unsigned char *) block
;
623 && memcmp (xmalloc_overrun_check_header
,
624 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
625 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
627 size_t osize
= XMALLOC_GET_SIZE (val
);
628 if (memcmp (xmalloc_overrun_check_trailer
, val
+ osize
,
629 XMALLOC_OVERRUN_CHECK_SIZE
))
631 #ifdef XMALLOC_CLEAR_FREE_MEMORY
632 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
633 memset (val
, 0xff, osize
+ XMALLOC_OVERRUN_CHECK_SIZE
*2);
635 memset (val
+ osize
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
636 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
637 memset (val
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
648 #define malloc overrun_check_malloc
649 #define realloc overrun_check_realloc
650 #define free overrun_check_free
654 /* When using SYNC_INPUT, we don't call malloc from a signal handler, so
655 there's no need to block input around malloc. */
656 #define MALLOC_BLOCK_INPUT ((void)0)
657 #define MALLOC_UNBLOCK_INPUT ((void)0)
659 #define MALLOC_BLOCK_INPUT BLOCK_INPUT
660 #define MALLOC_UNBLOCK_INPUT UNBLOCK_INPUT
663 /* Like malloc but check for no memory and block interrupt input.. */
666 xmalloc (size_t size
)
668 register POINTER_TYPE
*val
;
671 val
= (POINTER_TYPE
*) malloc (size
);
672 MALLOC_UNBLOCK_INPUT
;
680 /* Like realloc but check for no memory and block interrupt input.. */
683 xrealloc (POINTER_TYPE
*block
, size_t size
)
685 register POINTER_TYPE
*val
;
688 /* We must call malloc explicitly when BLOCK is 0, since some
689 reallocs don't do this. */
691 val
= (POINTER_TYPE
*) malloc (size
);
693 val
= (POINTER_TYPE
*) realloc (block
, size
);
694 MALLOC_UNBLOCK_INPUT
;
702 /* Like free but block interrupt input. */
705 xfree (POINTER_TYPE
*block
)
711 MALLOC_UNBLOCK_INPUT
;
712 /* We don't call refill_memory_reserve here
713 because that duplicates doing so in emacs_blocked_free
714 and the criterion should go there. */
718 /* Like strdup, but uses xmalloc. */
721 xstrdup (const char *s
)
723 size_t len
= strlen (s
) + 1;
724 char *p
= (char *) xmalloc (len
);
730 /* Unwind for SAFE_ALLOCA */
733 safe_alloca_unwind (Lisp_Object arg
)
735 register struct Lisp_Save_Value
*p
= XSAVE_VALUE (arg
);
745 /* Like malloc but used for allocating Lisp data. NBYTES is the
746 number of bytes to allocate, TYPE describes the intended use of the
747 allcated memory block (for strings, for conses, ...). */
750 static void *lisp_malloc_loser
;
753 static POINTER_TYPE
*
754 lisp_malloc (size_t nbytes
, enum mem_type type
)
760 #ifdef GC_MALLOC_CHECK
761 allocated_mem_type
= type
;
764 val
= (void *) malloc (nbytes
);
767 /* If the memory just allocated cannot be addressed thru a Lisp
768 object's pointer, and it needs to be,
769 that's equivalent to running out of memory. */
770 if (val
&& type
!= MEM_TYPE_NON_LISP
)
773 XSETCONS (tem
, (char *) val
+ nbytes
- 1);
774 if ((char *) XCONS (tem
) != (char *) val
+ nbytes
- 1)
776 lisp_malloc_loser
= val
;
783 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
784 if (val
&& type
!= MEM_TYPE_NON_LISP
)
785 mem_insert (val
, (char *) val
+ nbytes
, type
);
788 MALLOC_UNBLOCK_INPUT
;
790 memory_full (nbytes
);
794 /* Free BLOCK. This must be called to free memory allocated with a
795 call to lisp_malloc. */
798 lisp_free (POINTER_TYPE
*block
)
802 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
803 mem_delete (mem_find (block
));
805 MALLOC_UNBLOCK_INPUT
;
808 /* Allocation of aligned blocks of memory to store Lisp data. */
809 /* The entry point is lisp_align_malloc which returns blocks of at most */
810 /* BLOCK_BYTES and guarantees they are aligned on a BLOCK_ALIGN boundary. */
812 /* Use posix_memalloc if the system has it and we're using the system's
813 malloc (because our gmalloc.c routines don't have posix_memalign although
814 its memalloc could be used). */
815 #if defined (HAVE_POSIX_MEMALIGN) && defined (SYSTEM_MALLOC)
816 #define USE_POSIX_MEMALIGN 1
819 /* BLOCK_ALIGN has to be a power of 2. */
820 #define BLOCK_ALIGN (1 << 10)
822 /* Padding to leave at the end of a malloc'd block. This is to give
823 malloc a chance to minimize the amount of memory wasted to alignment.
824 It should be tuned to the particular malloc library used.
825 On glibc-2.3.2, malloc never tries to align, so a padding of 0 is best.
826 posix_memalign on the other hand would ideally prefer a value of 4
827 because otherwise, there's 1020 bytes wasted between each ablocks.
828 In Emacs, testing shows that those 1020 can most of the time be
829 efficiently used by malloc to place other objects, so a value of 0 can
830 still preferable unless you have a lot of aligned blocks and virtually
832 #define BLOCK_PADDING 0
833 #define BLOCK_BYTES \
834 (BLOCK_ALIGN - sizeof (struct ablocks *) - BLOCK_PADDING)
836 /* Internal data structures and constants. */
838 #define ABLOCKS_SIZE 16
840 /* An aligned block of memory. */
845 char payload
[BLOCK_BYTES
];
846 struct ablock
*next_free
;
848 /* `abase' is the aligned base of the ablocks. */
849 /* It is overloaded to hold the virtual `busy' field that counts
850 the number of used ablock in the parent ablocks.
851 The first ablock has the `busy' field, the others have the `abase'
852 field. To tell the difference, we assume that pointers will have
853 integer values larger than 2 * ABLOCKS_SIZE. The lowest bit of `busy'
854 is used to tell whether the real base of the parent ablocks is `abase'
855 (if not, the word before the first ablock holds a pointer to the
857 struct ablocks
*abase
;
858 /* The padding of all but the last ablock is unused. The padding of
859 the last ablock in an ablocks is not allocated. */
861 char padding
[BLOCK_PADDING
];
865 /* A bunch of consecutive aligned blocks. */
868 struct ablock blocks
[ABLOCKS_SIZE
];
871 /* Size of the block requested from malloc or memalign. */
872 #define ABLOCKS_BYTES (sizeof (struct ablocks) - BLOCK_PADDING)
874 #define ABLOCK_ABASE(block) \
875 (((uintptr_t) (block)->abase) <= (1 + 2 * ABLOCKS_SIZE) \
876 ? (struct ablocks *)(block) \
879 /* Virtual `busy' field. */
880 #define ABLOCKS_BUSY(abase) ((abase)->blocks[0].abase)
882 /* Pointer to the (not necessarily aligned) malloc block. */
883 #ifdef USE_POSIX_MEMALIGN
884 #define ABLOCKS_BASE(abase) (abase)
886 #define ABLOCKS_BASE(abase) \
887 (1 & (intptr_t) ABLOCKS_BUSY (abase) ? abase : ((void**)abase)[-1])
890 /* The list of free ablock. */
891 static struct ablock
*free_ablock
;
893 /* Allocate an aligned block of nbytes.
894 Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be
895 smaller or equal to BLOCK_BYTES. */
896 static POINTER_TYPE
*
897 lisp_align_malloc (size_t nbytes
, enum mem_type type
)
900 struct ablocks
*abase
;
902 eassert (nbytes
<= BLOCK_BYTES
);
906 #ifdef GC_MALLOC_CHECK
907 allocated_mem_type
= type
;
913 intptr_t aligned
; /* int gets warning casting to 64-bit pointer. */
915 #ifdef DOUG_LEA_MALLOC
916 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
917 because mapped region contents are not preserved in
919 mallopt (M_MMAP_MAX
, 0);
922 #ifdef USE_POSIX_MEMALIGN
924 int err
= posix_memalign (&base
, BLOCK_ALIGN
, ABLOCKS_BYTES
);
930 base
= malloc (ABLOCKS_BYTES
);
931 abase
= ALIGN (base
, BLOCK_ALIGN
);
936 MALLOC_UNBLOCK_INPUT
;
937 memory_full (ABLOCKS_BYTES
);
940 aligned
= (base
== abase
);
942 ((void**)abase
)[-1] = base
;
944 #ifdef DOUG_LEA_MALLOC
945 /* Back to a reasonable maximum of mmap'ed areas. */
946 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
950 /* If the memory just allocated cannot be addressed thru a Lisp
951 object's pointer, and it needs to be, that's equivalent to
952 running out of memory. */
953 if (type
!= MEM_TYPE_NON_LISP
)
956 char *end
= (char *) base
+ ABLOCKS_BYTES
- 1;
958 if ((char *) XCONS (tem
) != end
)
960 lisp_malloc_loser
= base
;
962 MALLOC_UNBLOCK_INPUT
;
963 memory_full (SIZE_MAX
);
968 /* Initialize the blocks and put them on the free list.
969 Is `base' was not properly aligned, we can't use the last block. */
970 for (i
= 0; i
< (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1); i
++)
972 abase
->blocks
[i
].abase
= abase
;
973 abase
->blocks
[i
].x
.next_free
= free_ablock
;
974 free_ablock
= &abase
->blocks
[i
];
976 ABLOCKS_BUSY (abase
) = (struct ablocks
*) aligned
;
978 eassert (0 == ((uintptr_t) abase
) % BLOCK_ALIGN
);
979 eassert (ABLOCK_ABASE (&abase
->blocks
[3]) == abase
); /* 3 is arbitrary */
980 eassert (ABLOCK_ABASE (&abase
->blocks
[0]) == abase
);
981 eassert (ABLOCKS_BASE (abase
) == base
);
982 eassert (aligned
== (intptr_t) ABLOCKS_BUSY (abase
));
985 abase
= ABLOCK_ABASE (free_ablock
);
986 ABLOCKS_BUSY (abase
) =
987 (struct ablocks
*) (2 + (intptr_t) ABLOCKS_BUSY (abase
));
989 free_ablock
= free_ablock
->x
.next_free
;
991 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
992 if (type
!= MEM_TYPE_NON_LISP
)
993 mem_insert (val
, (char *) val
+ nbytes
, type
);
996 MALLOC_UNBLOCK_INPUT
;
998 eassert (0 == ((uintptr_t) val
) % BLOCK_ALIGN
);
1003 lisp_align_free (POINTER_TYPE
*block
)
1005 struct ablock
*ablock
= block
;
1006 struct ablocks
*abase
= ABLOCK_ABASE (ablock
);
1009 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1010 mem_delete (mem_find (block
));
1012 /* Put on free list. */
1013 ablock
->x
.next_free
= free_ablock
;
1014 free_ablock
= ablock
;
1015 /* Update busy count. */
1016 ABLOCKS_BUSY (abase
) =
1017 (struct ablocks
*) (-2 + (intptr_t) ABLOCKS_BUSY (abase
));
1019 if (2 > (intptr_t) ABLOCKS_BUSY (abase
))
1020 { /* All the blocks are free. */
1021 int i
= 0, aligned
= (intptr_t) ABLOCKS_BUSY (abase
);
1022 struct ablock
**tem
= &free_ablock
;
1023 struct ablock
*atop
= &abase
->blocks
[aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1];
1027 if (*tem
>= (struct ablock
*) abase
&& *tem
< atop
)
1030 *tem
= (*tem
)->x
.next_free
;
1033 tem
= &(*tem
)->x
.next_free
;
1035 eassert ((aligned
& 1) == aligned
);
1036 eassert (i
== (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1));
1037 #ifdef USE_POSIX_MEMALIGN
1038 eassert ((uintptr_t) ABLOCKS_BASE (abase
) % BLOCK_ALIGN
== 0);
1040 free (ABLOCKS_BASE (abase
));
1042 MALLOC_UNBLOCK_INPUT
;
1045 /* Return a new buffer structure allocated from the heap with
1046 a call to lisp_malloc. */
1049 allocate_buffer (void)
1052 = (struct buffer
*) lisp_malloc (sizeof (struct buffer
),
1054 XSETPVECTYPESIZE (b
, PVEC_BUFFER
,
1055 ((sizeof (struct buffer
) + sizeof (EMACS_INT
) - 1)
1056 / sizeof (EMACS_INT
)));
1061 #ifndef SYSTEM_MALLOC
1063 /* Arranging to disable input signals while we're in malloc.
1065 This only works with GNU malloc. To help out systems which can't
1066 use GNU malloc, all the calls to malloc, realloc, and free
1067 elsewhere in the code should be inside a BLOCK_INPUT/UNBLOCK_INPUT
1068 pair; unfortunately, we have no idea what C library functions
1069 might call malloc, so we can't really protect them unless you're
1070 using GNU malloc. Fortunately, most of the major operating systems
1071 can use GNU malloc. */
1074 /* When using SYNC_INPUT, we don't call malloc from a signal handler, so
1075 there's no need to block input around malloc. */
1077 #ifndef DOUG_LEA_MALLOC
1078 extern void * (*__malloc_hook
) (size_t, const void *);
1079 extern void * (*__realloc_hook
) (void *, size_t, const void *);
1080 extern void (*__free_hook
) (void *, const void *);
1081 /* Else declared in malloc.h, perhaps with an extra arg. */
1082 #endif /* DOUG_LEA_MALLOC */
1083 static void * (*old_malloc_hook
) (size_t, const void *);
1084 static void * (*old_realloc_hook
) (void *, size_t, const void*);
1085 static void (*old_free_hook
) (void*, const void*);
1087 #ifdef DOUG_LEA_MALLOC
1088 # define BYTES_USED (mallinfo ().uordblks)
1090 # define BYTES_USED _bytes_used
1093 static __malloc_size_t bytes_used_when_reconsidered
;
1095 /* Value of _bytes_used, when spare_memory was freed. */
1097 static __malloc_size_t bytes_used_when_full
;
1099 /* This function is used as the hook for free to call. */
1102 emacs_blocked_free (void *ptr
, const void *ptr2
)
1106 #ifdef GC_MALLOC_CHECK
1112 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1115 "Freeing `%p' which wasn't allocated with malloc\n", ptr
);
1120 /* fprintf (stderr, "free %p...%p (%p)\n", m->start, m->end, ptr); */
1124 #endif /* GC_MALLOC_CHECK */
1126 __free_hook
= old_free_hook
;
1129 /* If we released our reserve (due to running out of memory),
1130 and we have a fair amount free once again,
1131 try to set aside another reserve in case we run out once more. */
1132 if (! NILP (Vmemory_full
)
1133 /* Verify there is enough space that even with the malloc
1134 hysteresis this call won't run out again.
1135 The code here is correct as long as SPARE_MEMORY
1136 is substantially larger than the block size malloc uses. */
1137 && (bytes_used_when_full
1138 > ((bytes_used_when_reconsidered
= BYTES_USED
)
1139 + max (malloc_hysteresis
, 4) * SPARE_MEMORY
)))
1140 refill_memory_reserve ();
1142 __free_hook
= emacs_blocked_free
;
1143 UNBLOCK_INPUT_ALLOC
;
1147 /* This function is the malloc hook that Emacs uses. */
1150 emacs_blocked_malloc (size_t size
, const void *ptr
)
1155 __malloc_hook
= old_malloc_hook
;
1156 #ifdef DOUG_LEA_MALLOC
1157 /* Segfaults on my system. --lorentey */
1158 /* mallopt (M_TOP_PAD, malloc_hysteresis * 4096); */
1160 __malloc_extra_blocks
= malloc_hysteresis
;
1163 value
= (void *) malloc (size
);
1165 #ifdef GC_MALLOC_CHECK
1167 struct mem_node
*m
= mem_find (value
);
1170 fprintf (stderr
, "Malloc returned %p which is already in use\n",
1172 fprintf (stderr
, "Region in use is %p...%p, %u bytes, type %d\n",
1173 m
->start
, m
->end
, (char *) m
->end
- (char *) m
->start
,
1178 if (!dont_register_blocks
)
1180 mem_insert (value
, (char *) value
+ max (1, size
), allocated_mem_type
);
1181 allocated_mem_type
= MEM_TYPE_NON_LISP
;
1184 #endif /* GC_MALLOC_CHECK */
1186 __malloc_hook
= emacs_blocked_malloc
;
1187 UNBLOCK_INPUT_ALLOC
;
1189 /* fprintf (stderr, "%p malloc\n", value); */
1194 /* This function is the realloc hook that Emacs uses. */
1197 emacs_blocked_realloc (void *ptr
, size_t size
, const void *ptr2
)
1202 __realloc_hook
= old_realloc_hook
;
1204 #ifdef GC_MALLOC_CHECK
1207 struct mem_node
*m
= mem_find (ptr
);
1208 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1211 "Realloc of %p which wasn't allocated with malloc\n",
1219 /* fprintf (stderr, "%p -> realloc\n", ptr); */
1221 /* Prevent malloc from registering blocks. */
1222 dont_register_blocks
= 1;
1223 #endif /* GC_MALLOC_CHECK */
1225 value
= (void *) realloc (ptr
, size
);
1227 #ifdef GC_MALLOC_CHECK
1228 dont_register_blocks
= 0;
1231 struct mem_node
*m
= mem_find (value
);
1234 fprintf (stderr
, "Realloc returns memory that is already in use\n");
1238 /* Can't handle zero size regions in the red-black tree. */
1239 mem_insert (value
, (char *) value
+ max (size
, 1), MEM_TYPE_NON_LISP
);
1242 /* fprintf (stderr, "%p <- realloc\n", value); */
1243 #endif /* GC_MALLOC_CHECK */
1245 __realloc_hook
= emacs_blocked_realloc
;
1246 UNBLOCK_INPUT_ALLOC
;
1252 #ifdef HAVE_GTK_AND_PTHREAD
1253 /* Called from Fdump_emacs so that when the dumped Emacs starts, it has a
1254 normal malloc. Some thread implementations need this as they call
1255 malloc before main. The pthread_self call in BLOCK_INPUT_ALLOC then
1256 calls malloc because it is the first call, and we have an endless loop. */
1259 reset_malloc_hooks ()
1261 __free_hook
= old_free_hook
;
1262 __malloc_hook
= old_malloc_hook
;
1263 __realloc_hook
= old_realloc_hook
;
1265 #endif /* HAVE_GTK_AND_PTHREAD */
1268 /* Called from main to set up malloc to use our hooks. */
1271 uninterrupt_malloc (void)
1273 #ifdef HAVE_GTK_AND_PTHREAD
1274 #ifdef DOUG_LEA_MALLOC
1275 pthread_mutexattr_t attr
;
1277 /* GLIBC has a faster way to do this, but lets keep it portable.
1278 This is according to the Single UNIX Specification. */
1279 pthread_mutexattr_init (&attr
);
1280 pthread_mutexattr_settype (&attr
, PTHREAD_MUTEX_RECURSIVE
);
1281 pthread_mutex_init (&alloc_mutex
, &attr
);
1282 #else /* !DOUG_LEA_MALLOC */
1283 /* Some systems such as Solaris 2.6 don't have a recursive mutex,
1284 and the bundled gmalloc.c doesn't require it. */
1285 pthread_mutex_init (&alloc_mutex
, NULL
);
1286 #endif /* !DOUG_LEA_MALLOC */
1287 #endif /* HAVE_GTK_AND_PTHREAD */
1289 if (__free_hook
!= emacs_blocked_free
)
1290 old_free_hook
= __free_hook
;
1291 __free_hook
= emacs_blocked_free
;
1293 if (__malloc_hook
!= emacs_blocked_malloc
)
1294 old_malloc_hook
= __malloc_hook
;
1295 __malloc_hook
= emacs_blocked_malloc
;
1297 if (__realloc_hook
!= emacs_blocked_realloc
)
1298 old_realloc_hook
= __realloc_hook
;
1299 __realloc_hook
= emacs_blocked_realloc
;
1302 #endif /* not SYNC_INPUT */
1303 #endif /* not SYSTEM_MALLOC */
1307 /***********************************************************************
1309 ***********************************************************************/
1311 /* Number of intervals allocated in an interval_block structure.
1312 The 1020 is 1024 minus malloc overhead. */
1314 #define INTERVAL_BLOCK_SIZE \
1315 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
1317 /* Intervals are allocated in chunks in form of an interval_block
1320 struct interval_block
1322 /* Place `intervals' first, to preserve alignment. */
1323 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
1324 struct interval_block
*next
;
1327 /* Current interval block. Its `next' pointer points to older
1330 static struct interval_block
*interval_block
;
1332 /* Index in interval_block above of the next unused interval
1335 static int interval_block_index
;
1337 /* Number of free and live intervals. */
1339 static int total_free_intervals
, total_intervals
;
1341 /* List of free intervals. */
1343 static INTERVAL interval_free_list
;
1345 /* Total number of interval blocks now in use. */
1347 static int n_interval_blocks
;
1350 /* Initialize interval allocation. */
1353 init_intervals (void)
1355 interval_block
= NULL
;
1356 interval_block_index
= INTERVAL_BLOCK_SIZE
;
1357 interval_free_list
= 0;
1358 n_interval_blocks
= 0;
1362 /* Return a new interval. */
1365 make_interval (void)
1369 /* eassert (!handling_signal); */
1373 if (interval_free_list
)
1375 val
= interval_free_list
;
1376 interval_free_list
= INTERVAL_PARENT (interval_free_list
);
1380 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
1382 register struct interval_block
*newi
;
1384 newi
= (struct interval_block
*) lisp_malloc (sizeof *newi
,
1387 newi
->next
= interval_block
;
1388 interval_block
= newi
;
1389 interval_block_index
= 0;
1390 n_interval_blocks
++;
1392 val
= &interval_block
->intervals
[interval_block_index
++];
1395 MALLOC_UNBLOCK_INPUT
;
1397 consing_since_gc
+= sizeof (struct interval
);
1399 RESET_INTERVAL (val
);
1405 /* Mark Lisp objects in interval I. */
1408 mark_interval (register INTERVAL i
, Lisp_Object dummy
)
1410 eassert (!i
->gcmarkbit
); /* Intervals are never shared. */
1412 mark_object (i
->plist
);
1416 /* Mark the interval tree rooted in TREE. Don't call this directly;
1417 use the macro MARK_INTERVAL_TREE instead. */
1420 mark_interval_tree (register INTERVAL tree
)
1422 /* No need to test if this tree has been marked already; this
1423 function is always called through the MARK_INTERVAL_TREE macro,
1424 which takes care of that. */
1426 traverse_intervals_noorder (tree
, mark_interval
, Qnil
);
1430 /* Mark the interval tree rooted in I. */
1432 #define MARK_INTERVAL_TREE(i) \
1434 if (!NULL_INTERVAL_P (i) && !i->gcmarkbit) \
1435 mark_interval_tree (i); \
1439 #define UNMARK_BALANCE_INTERVALS(i) \
1441 if (! NULL_INTERVAL_P (i)) \
1442 (i) = balance_intervals (i); \
1446 /* Number support. If USE_LISP_UNION_TYPE is in effect, we
1447 can't create number objects in macros. */
1450 make_number (EMACS_INT n
)
1454 obj
.s
.type
= Lisp_Int
;
1459 /***********************************************************************
1461 ***********************************************************************/
1463 /* Lisp_Strings are allocated in string_block structures. When a new
1464 string_block is allocated, all the Lisp_Strings it contains are
1465 added to a free-list string_free_list. When a new Lisp_String is
1466 needed, it is taken from that list. During the sweep phase of GC,
1467 string_blocks that are entirely free are freed, except two which
1470 String data is allocated from sblock structures. Strings larger
1471 than LARGE_STRING_BYTES, get their own sblock, data for smaller
1472 strings is sub-allocated out of sblocks of size SBLOCK_SIZE.
1474 Sblocks consist internally of sdata structures, one for each
1475 Lisp_String. The sdata structure points to the Lisp_String it
1476 belongs to. The Lisp_String points back to the `u.data' member of
1477 its sdata structure.
1479 When a Lisp_String is freed during GC, it is put back on
1480 string_free_list, and its `data' member and its sdata's `string'
1481 pointer is set to null. The size of the string is recorded in the
1482 `u.nbytes' member of the sdata. So, sdata structures that are no
1483 longer used, can be easily recognized, and it's easy to compact the
1484 sblocks of small strings which we do in compact_small_strings. */
1486 /* Size in bytes of an sblock structure used for small strings. This
1487 is 8192 minus malloc overhead. */
1489 #define SBLOCK_SIZE 8188
1491 /* Strings larger than this are considered large strings. String data
1492 for large strings is allocated from individual sblocks. */
1494 #define LARGE_STRING_BYTES 1024
1496 /* Structure describing string memory sub-allocated from an sblock.
1497 This is where the contents of Lisp strings are stored. */
1501 /* Back-pointer to the string this sdata belongs to. If null, this
1502 structure is free, and the NBYTES member of the union below
1503 contains the string's byte size (the same value that STRING_BYTES
1504 would return if STRING were non-null). If non-null, STRING_BYTES
1505 (STRING) is the size of the data, and DATA contains the string's
1507 struct Lisp_String
*string
;
1509 #ifdef GC_CHECK_STRING_BYTES
1512 unsigned char data
[1];
1514 #define SDATA_NBYTES(S) (S)->nbytes
1515 #define SDATA_DATA(S) (S)->data
1516 #define SDATA_SELECTOR(member) member
1518 #else /* not GC_CHECK_STRING_BYTES */
1522 /* When STRING is non-null. */
1523 unsigned char data
[1];
1525 /* When STRING is null. */
1529 #define SDATA_NBYTES(S) (S)->u.nbytes
1530 #define SDATA_DATA(S) (S)->u.data
1531 #define SDATA_SELECTOR(member) u.member
1533 #endif /* not GC_CHECK_STRING_BYTES */
1535 #define SDATA_DATA_OFFSET offsetof (struct sdata, SDATA_SELECTOR (data))
1539 /* Structure describing a block of memory which is sub-allocated to
1540 obtain string data memory for strings. Blocks for small strings
1541 are of fixed size SBLOCK_SIZE. Blocks for large strings are made
1542 as large as needed. */
1547 struct sblock
*next
;
1549 /* Pointer to the next free sdata block. This points past the end
1550 of the sblock if there isn't any space left in this block. */
1551 struct sdata
*next_free
;
1553 /* Start of data. */
1554 struct sdata first_data
;
1557 /* Number of Lisp strings in a string_block structure. The 1020 is
1558 1024 minus malloc overhead. */
1560 #define STRING_BLOCK_SIZE \
1561 ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String))
1563 /* Structure describing a block from which Lisp_String structures
1568 /* Place `strings' first, to preserve alignment. */
1569 struct Lisp_String strings
[STRING_BLOCK_SIZE
];
1570 struct string_block
*next
;
1573 /* Head and tail of the list of sblock structures holding Lisp string
1574 data. We always allocate from current_sblock. The NEXT pointers
1575 in the sblock structures go from oldest_sblock to current_sblock. */
1577 static struct sblock
*oldest_sblock
, *current_sblock
;
1579 /* List of sblocks for large strings. */
1581 static struct sblock
*large_sblocks
;
1583 /* List of string_block structures, and how many there are. */
1585 static struct string_block
*string_blocks
;
1586 static int n_string_blocks
;
1588 /* Free-list of Lisp_Strings. */
1590 static struct Lisp_String
*string_free_list
;
1592 /* Number of live and free Lisp_Strings. */
1594 static int total_strings
, total_free_strings
;
1596 /* Number of bytes used by live strings. */
1598 static EMACS_INT total_string_size
;
1600 /* Given a pointer to a Lisp_String S which is on the free-list
1601 string_free_list, return a pointer to its successor in the
1604 #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S))
1606 /* Return a pointer to the sdata structure belonging to Lisp string S.
1607 S must be live, i.e. S->data must not be null. S->data is actually
1608 a pointer to the `u.data' member of its sdata structure; the
1609 structure starts at a constant offset in front of that. */
1611 #define SDATA_OF_STRING(S) ((struct sdata *) ((S)->data - SDATA_DATA_OFFSET))
1614 #ifdef GC_CHECK_STRING_OVERRUN
1616 /* We check for overrun in string data blocks by appending a small
1617 "cookie" after each allocated string data block, and check for the
1618 presence of this cookie during GC. */
1620 #define GC_STRING_OVERRUN_COOKIE_SIZE 4
1621 static char const string_overrun_cookie
[GC_STRING_OVERRUN_COOKIE_SIZE
] =
1622 { '\xde', '\xad', '\xbe', '\xef' };
1625 #define GC_STRING_OVERRUN_COOKIE_SIZE 0
1628 /* Value is the size of an sdata structure large enough to hold NBYTES
1629 bytes of string data. The value returned includes a terminating
1630 NUL byte, the size of the sdata structure, and padding. */
1632 #ifdef GC_CHECK_STRING_BYTES
1634 #define SDATA_SIZE(NBYTES) \
1635 ((SDATA_DATA_OFFSET \
1637 + sizeof (EMACS_INT) - 1) \
1638 & ~(sizeof (EMACS_INT) - 1))
1640 #else /* not GC_CHECK_STRING_BYTES */
1642 /* The 'max' reserves space for the nbytes union member even when NBYTES + 1 is
1643 less than the size of that member. The 'max' is not needed when
1644 SDATA_DATA_OFFSET is a multiple of sizeof (EMACS_INT), because then the
1645 alignment code reserves enough space. */
1647 #define SDATA_SIZE(NBYTES) \
1648 ((SDATA_DATA_OFFSET \
1649 + (SDATA_DATA_OFFSET % sizeof (EMACS_INT) == 0 \
1651 : max (NBYTES, sizeof (EMACS_INT) - 1)) \
1653 + sizeof (EMACS_INT) - 1) \
1654 & ~(sizeof (EMACS_INT) - 1))
1656 #endif /* not GC_CHECK_STRING_BYTES */
1658 /* Extra bytes to allocate for each string. */
1660 #define GC_STRING_EXTRA (GC_STRING_OVERRUN_COOKIE_SIZE)
1662 /* Initialize string allocation. Called from init_alloc_once. */
1667 total_strings
= total_free_strings
= total_string_size
= 0;
1668 oldest_sblock
= current_sblock
= large_sblocks
= NULL
;
1669 string_blocks
= NULL
;
1670 n_string_blocks
= 0;
1671 string_free_list
= NULL
;
1672 empty_unibyte_string
= make_pure_string ("", 0, 0, 0);
1673 empty_multibyte_string
= make_pure_string ("", 0, 0, 1);
1677 #ifdef GC_CHECK_STRING_BYTES
1679 static int check_string_bytes_count
;
1681 #define CHECK_STRING_BYTES(S) STRING_BYTES (S)
1684 /* Like GC_STRING_BYTES, but with debugging check. */
1687 string_bytes (struct Lisp_String
*s
)
1690 (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1692 if (!PURE_POINTER_P (s
)
1694 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1699 /* Check validity of Lisp strings' string_bytes member in B. */
1702 check_sblock (struct sblock
*b
)
1704 struct sdata
*from
, *end
, *from_end
;
1708 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1710 /* Compute the next FROM here because copying below may
1711 overwrite data we need to compute it. */
1714 /* Check that the string size recorded in the string is the
1715 same as the one recorded in the sdata structure. */
1717 CHECK_STRING_BYTES (from
->string
);
1720 nbytes
= GC_STRING_BYTES (from
->string
);
1722 nbytes
= SDATA_NBYTES (from
);
1724 nbytes
= SDATA_SIZE (nbytes
);
1725 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
1730 /* Check validity of Lisp strings' string_bytes member. ALL_P
1731 non-zero means check all strings, otherwise check only most
1732 recently allocated strings. Used for hunting a bug. */
1735 check_string_bytes (int all_p
)
1741 for (b
= large_sblocks
; b
; b
= b
->next
)
1743 struct Lisp_String
*s
= b
->first_data
.string
;
1745 CHECK_STRING_BYTES (s
);
1748 for (b
= oldest_sblock
; b
; b
= b
->next
)
1752 check_sblock (current_sblock
);
1755 #endif /* GC_CHECK_STRING_BYTES */
1757 #ifdef GC_CHECK_STRING_FREE_LIST
1759 /* Walk through the string free list looking for bogus next pointers.
1760 This may catch buffer overrun from a previous string. */
1763 check_string_free_list (void)
1765 struct Lisp_String
*s
;
1767 /* Pop a Lisp_String off the free-list. */
1768 s
= string_free_list
;
1771 if ((uintptr_t) s
< 1024)
1773 s
= NEXT_FREE_LISP_STRING (s
);
1777 #define check_string_free_list()
1780 /* Return a new Lisp_String. */
1782 static struct Lisp_String
*
1783 allocate_string (void)
1785 struct Lisp_String
*s
;
1787 /* eassert (!handling_signal); */
1791 /* If the free-list is empty, allocate a new string_block, and
1792 add all the Lisp_Strings in it to the free-list. */
1793 if (string_free_list
== NULL
)
1795 struct string_block
*b
;
1798 b
= (struct string_block
*) lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1799 memset (b
, 0, sizeof *b
);
1800 b
->next
= string_blocks
;
1804 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1807 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1808 string_free_list
= s
;
1811 total_free_strings
+= STRING_BLOCK_SIZE
;
1814 check_string_free_list ();
1816 /* Pop a Lisp_String off the free-list. */
1817 s
= string_free_list
;
1818 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1820 MALLOC_UNBLOCK_INPUT
;
1822 /* Probably not strictly necessary, but play it safe. */
1823 memset (s
, 0, sizeof *s
);
1825 --total_free_strings
;
1828 consing_since_gc
+= sizeof *s
;
1830 #ifdef GC_CHECK_STRING_BYTES
1831 if (!noninteractive
)
1833 if (++check_string_bytes_count
== 200)
1835 check_string_bytes_count
= 0;
1836 check_string_bytes (1);
1839 check_string_bytes (0);
1841 #endif /* GC_CHECK_STRING_BYTES */
1847 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1848 plus a NUL byte at the end. Allocate an sdata structure for S, and
1849 set S->data to its `u.data' member. Store a NUL byte at the end of
1850 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1851 S->data if it was initially non-null. */
1854 allocate_string_data (struct Lisp_String
*s
,
1855 EMACS_INT nchars
, EMACS_INT nbytes
)
1857 struct sdata
*data
, *old_data
;
1859 EMACS_INT needed
, old_nbytes
;
1861 /* Determine the number of bytes needed to store NBYTES bytes
1863 needed
= SDATA_SIZE (nbytes
);
1864 old_data
= s
->data
? SDATA_OF_STRING (s
) : NULL
;
1865 old_nbytes
= GC_STRING_BYTES (s
);
1869 if (nbytes
> LARGE_STRING_BYTES
)
1871 size_t size
= offsetof (struct sblock
, first_data
) + needed
;
1873 #ifdef DOUG_LEA_MALLOC
1874 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1875 because mapped region contents are not preserved in
1878 In case you think of allowing it in a dumped Emacs at the
1879 cost of not being able to re-dump, there's another reason:
1880 mmap'ed data typically have an address towards the top of the
1881 address space, which won't fit into an EMACS_INT (at least on
1882 32-bit systems with the current tagging scheme). --fx */
1883 mallopt (M_MMAP_MAX
, 0);
1886 b
= (struct sblock
*) lisp_malloc (size
+ GC_STRING_EXTRA
, MEM_TYPE_NON_LISP
);
1888 #ifdef DOUG_LEA_MALLOC
1889 /* Back to a reasonable maximum of mmap'ed areas. */
1890 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1893 b
->next_free
= &b
->first_data
;
1894 b
->first_data
.string
= NULL
;
1895 b
->next
= large_sblocks
;
1898 else if (current_sblock
== NULL
1899 || (((char *) current_sblock
+ SBLOCK_SIZE
1900 - (char *) current_sblock
->next_free
)
1901 < (needed
+ GC_STRING_EXTRA
)))
1903 /* Not enough room in the current sblock. */
1904 b
= (struct sblock
*) lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
1905 b
->next_free
= &b
->first_data
;
1906 b
->first_data
.string
= NULL
;
1910 current_sblock
->next
= b
;
1918 data
= b
->next_free
;
1919 b
->next_free
= (struct sdata
*) ((char *) data
+ needed
+ GC_STRING_EXTRA
);
1921 MALLOC_UNBLOCK_INPUT
;
1924 s
->data
= SDATA_DATA (data
);
1925 #ifdef GC_CHECK_STRING_BYTES
1926 SDATA_NBYTES (data
) = nbytes
;
1929 s
->size_byte
= nbytes
;
1930 s
->data
[nbytes
] = '\0';
1931 #ifdef GC_CHECK_STRING_OVERRUN
1932 memcpy ((char *) data
+ needed
, string_overrun_cookie
,
1933 GC_STRING_OVERRUN_COOKIE_SIZE
);
1936 /* If S had already data assigned, mark that as free by setting its
1937 string back-pointer to null, and recording the size of the data
1941 SDATA_NBYTES (old_data
) = old_nbytes
;
1942 old_data
->string
= NULL
;
1945 consing_since_gc
+= needed
;
1949 /* Sweep and compact strings. */
1952 sweep_strings (void)
1954 struct string_block
*b
, *next
;
1955 struct string_block
*live_blocks
= NULL
;
1957 string_free_list
= NULL
;
1958 total_strings
= total_free_strings
= 0;
1959 total_string_size
= 0;
1961 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
1962 for (b
= string_blocks
; b
; b
= next
)
1965 struct Lisp_String
*free_list_before
= string_free_list
;
1969 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
1971 struct Lisp_String
*s
= b
->strings
+ i
;
1975 /* String was not on free-list before. */
1976 if (STRING_MARKED_P (s
))
1978 /* String is live; unmark it and its intervals. */
1981 if (!NULL_INTERVAL_P (s
->intervals
))
1982 UNMARK_BALANCE_INTERVALS (s
->intervals
);
1985 total_string_size
+= STRING_BYTES (s
);
1989 /* String is dead. Put it on the free-list. */
1990 struct sdata
*data
= SDATA_OF_STRING (s
);
1992 /* Save the size of S in its sdata so that we know
1993 how large that is. Reset the sdata's string
1994 back-pointer so that we know it's free. */
1995 #ifdef GC_CHECK_STRING_BYTES
1996 if (GC_STRING_BYTES (s
) != SDATA_NBYTES (data
))
1999 data
->u
.nbytes
= GC_STRING_BYTES (s
);
2001 data
->string
= NULL
;
2003 /* Reset the strings's `data' member so that we
2007 /* Put the string on the free-list. */
2008 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2009 string_free_list
= s
;
2015 /* S was on the free-list before. Put it there again. */
2016 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2017 string_free_list
= s
;
2022 /* Free blocks that contain free Lisp_Strings only, except
2023 the first two of them. */
2024 if (nfree
== STRING_BLOCK_SIZE
2025 && total_free_strings
> STRING_BLOCK_SIZE
)
2029 string_free_list
= free_list_before
;
2033 total_free_strings
+= nfree
;
2034 b
->next
= live_blocks
;
2039 check_string_free_list ();
2041 string_blocks
= live_blocks
;
2042 free_large_strings ();
2043 compact_small_strings ();
2045 check_string_free_list ();
2049 /* Free dead large strings. */
2052 free_large_strings (void)
2054 struct sblock
*b
, *next
;
2055 struct sblock
*live_blocks
= NULL
;
2057 for (b
= large_sblocks
; b
; b
= next
)
2061 if (b
->first_data
.string
== NULL
)
2065 b
->next
= live_blocks
;
2070 large_sblocks
= live_blocks
;
2074 /* Compact data of small strings. Free sblocks that don't contain
2075 data of live strings after compaction. */
2078 compact_small_strings (void)
2080 struct sblock
*b
, *tb
, *next
;
2081 struct sdata
*from
, *to
, *end
, *tb_end
;
2082 struct sdata
*to_end
, *from_end
;
2084 /* TB is the sblock we copy to, TO is the sdata within TB we copy
2085 to, and TB_END is the end of TB. */
2087 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2088 to
= &tb
->first_data
;
2090 /* Step through the blocks from the oldest to the youngest. We
2091 expect that old blocks will stabilize over time, so that less
2092 copying will happen this way. */
2093 for (b
= oldest_sblock
; b
; b
= b
->next
)
2096 xassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
2098 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
2100 /* Compute the next FROM here because copying below may
2101 overwrite data we need to compute it. */
2104 #ifdef GC_CHECK_STRING_BYTES
2105 /* Check that the string size recorded in the string is the
2106 same as the one recorded in the sdata structure. */
2108 && GC_STRING_BYTES (from
->string
) != SDATA_NBYTES (from
))
2110 #endif /* GC_CHECK_STRING_BYTES */
2113 nbytes
= GC_STRING_BYTES (from
->string
);
2115 nbytes
= SDATA_NBYTES (from
);
2117 if (nbytes
> LARGE_STRING_BYTES
)
2120 nbytes
= SDATA_SIZE (nbytes
);
2121 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
2123 #ifdef GC_CHECK_STRING_OVERRUN
2124 if (memcmp (string_overrun_cookie
,
2125 (char *) from_end
- GC_STRING_OVERRUN_COOKIE_SIZE
,
2126 GC_STRING_OVERRUN_COOKIE_SIZE
))
2130 /* FROM->string non-null means it's alive. Copy its data. */
2133 /* If TB is full, proceed with the next sblock. */
2134 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2135 if (to_end
> tb_end
)
2139 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2140 to
= &tb
->first_data
;
2141 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2144 /* Copy, and update the string's `data' pointer. */
2147 xassert (tb
!= b
|| to
< from
);
2148 memmove (to
, from
, nbytes
+ GC_STRING_EXTRA
);
2149 to
->string
->data
= SDATA_DATA (to
);
2152 /* Advance past the sdata we copied to. */
2158 /* The rest of the sblocks following TB don't contain live data, so
2159 we can free them. */
2160 for (b
= tb
->next
; b
; b
= next
)
2168 current_sblock
= tb
;
2172 string_overflow (void)
2174 error ("Maximum string size exceeded");
2177 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
2178 doc
: /* Return a newly created string of length LENGTH, with INIT in each element.
2179 LENGTH must be an integer.
2180 INIT must be an integer that represents a character. */)
2181 (Lisp_Object length
, Lisp_Object init
)
2183 register Lisp_Object val
;
2184 register unsigned char *p
, *end
;
2188 CHECK_NATNUM (length
);
2189 CHECK_NUMBER (init
);
2192 if (ASCII_CHAR_P (c
))
2194 nbytes
= XINT (length
);
2195 val
= make_uninit_string (nbytes
);
2197 end
= p
+ SCHARS (val
);
2203 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
2204 int len
= CHAR_STRING (c
, str
);
2205 EMACS_INT string_len
= XINT (length
);
2207 if (string_len
> STRING_BYTES_MAX
/ len
)
2209 nbytes
= len
* string_len
;
2210 val
= make_uninit_multibyte_string (string_len
, nbytes
);
2215 memcpy (p
, str
, len
);
2225 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
2226 doc
: /* Return a new bool-vector of length LENGTH, using INIT for each element.
2227 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
2228 (Lisp_Object length
, Lisp_Object init
)
2230 register Lisp_Object val
;
2231 struct Lisp_Bool_Vector
*p
;
2233 EMACS_INT length_in_chars
, length_in_elts
;
2236 CHECK_NATNUM (length
);
2238 bits_per_value
= sizeof (EMACS_INT
) * BOOL_VECTOR_BITS_PER_CHAR
;
2240 length_in_elts
= (XFASTINT (length
) + bits_per_value
- 1) / bits_per_value
;
2241 length_in_chars
= ((XFASTINT (length
) + BOOL_VECTOR_BITS_PER_CHAR
- 1)
2242 / BOOL_VECTOR_BITS_PER_CHAR
);
2244 /* We must allocate one more elements than LENGTH_IN_ELTS for the
2245 slot `size' of the struct Lisp_Bool_Vector. */
2246 val
= Fmake_vector (make_number (length_in_elts
+ 1), Qnil
);
2248 /* No Lisp_Object to trace in there. */
2249 XSETPVECTYPESIZE (XVECTOR (val
), PVEC_BOOL_VECTOR
, 0);
2251 p
= XBOOL_VECTOR (val
);
2252 p
->size
= XFASTINT (length
);
2254 real_init
= (NILP (init
) ? 0 : -1);
2255 for (i
= 0; i
< length_in_chars
; i
++)
2256 p
->data
[i
] = real_init
;
2258 /* Clear the extraneous bits in the last byte. */
2259 if (XINT (length
) != length_in_chars
* BOOL_VECTOR_BITS_PER_CHAR
)
2260 p
->data
[length_in_chars
- 1]
2261 &= (1 << (XINT (length
) % BOOL_VECTOR_BITS_PER_CHAR
)) - 1;
2267 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
2268 of characters from the contents. This string may be unibyte or
2269 multibyte, depending on the contents. */
2272 make_string (const char *contents
, EMACS_INT nbytes
)
2274 register Lisp_Object val
;
2275 EMACS_INT nchars
, multibyte_nbytes
;
2277 parse_str_as_multibyte ((const unsigned char *) contents
, nbytes
,
2278 &nchars
, &multibyte_nbytes
);
2279 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
2280 /* CONTENTS contains no multibyte sequences or contains an invalid
2281 multibyte sequence. We must make unibyte string. */
2282 val
= make_unibyte_string (contents
, nbytes
);
2284 val
= make_multibyte_string (contents
, nchars
, nbytes
);
2289 /* Make an unibyte string from LENGTH bytes at CONTENTS. */
2292 make_unibyte_string (const char *contents
, EMACS_INT length
)
2294 register Lisp_Object val
;
2295 val
= make_uninit_string (length
);
2296 memcpy (SDATA (val
), contents
, length
);
2301 /* Make a multibyte string from NCHARS characters occupying NBYTES
2302 bytes at CONTENTS. */
2305 make_multibyte_string (const char *contents
,
2306 EMACS_INT nchars
, EMACS_INT nbytes
)
2308 register Lisp_Object val
;
2309 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2310 memcpy (SDATA (val
), contents
, nbytes
);
2315 /* Make a string from NCHARS characters occupying NBYTES bytes at
2316 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2319 make_string_from_bytes (const char *contents
,
2320 EMACS_INT nchars
, EMACS_INT nbytes
)
2322 register Lisp_Object val
;
2323 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2324 memcpy (SDATA (val
), contents
, nbytes
);
2325 if (SBYTES (val
) == SCHARS (val
))
2326 STRING_SET_UNIBYTE (val
);
2331 /* Make a string from NCHARS characters occupying NBYTES bytes at
2332 CONTENTS. The argument MULTIBYTE controls whether to label the
2333 string as multibyte. If NCHARS is negative, it counts the number of
2334 characters by itself. */
2337 make_specified_string (const char *contents
,
2338 EMACS_INT nchars
, EMACS_INT nbytes
, int multibyte
)
2340 register Lisp_Object val
;
2345 nchars
= multibyte_chars_in_text ((const unsigned char *) contents
,
2350 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2351 memcpy (SDATA (val
), contents
, nbytes
);
2353 STRING_SET_UNIBYTE (val
);
2358 /* Make a string from the data at STR, treating it as multibyte if the
2362 build_string (const char *str
)
2364 return make_string (str
, strlen (str
));
2368 /* Return an unibyte Lisp_String set up to hold LENGTH characters
2369 occupying LENGTH bytes. */
2372 make_uninit_string (EMACS_INT length
)
2377 return empty_unibyte_string
;
2378 val
= make_uninit_multibyte_string (length
, length
);
2379 STRING_SET_UNIBYTE (val
);
2384 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2385 which occupy NBYTES bytes. */
2388 make_uninit_multibyte_string (EMACS_INT nchars
, EMACS_INT nbytes
)
2391 struct Lisp_String
*s
;
2396 return empty_multibyte_string
;
2398 s
= allocate_string ();
2399 allocate_string_data (s
, nchars
, nbytes
);
2400 XSETSTRING (string
, s
);
2401 string_chars_consed
+= nbytes
;
2407 /***********************************************************************
2409 ***********************************************************************/
2411 /* We store float cells inside of float_blocks, allocating a new
2412 float_block with malloc whenever necessary. Float cells reclaimed
2413 by GC are put on a free list to be reallocated before allocating
2414 any new float cells from the latest float_block. */
2416 #define FLOAT_BLOCK_SIZE \
2417 (((BLOCK_BYTES - sizeof (struct float_block *) \
2418 /* The compiler might add padding at the end. */ \
2419 - (sizeof (struct Lisp_Float) - sizeof (int))) * CHAR_BIT) \
2420 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2422 #define GETMARKBIT(block,n) \
2423 (((block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2424 >> ((n) % (sizeof(int) * CHAR_BIT))) \
2427 #define SETMARKBIT(block,n) \
2428 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2429 |= 1 << ((n) % (sizeof(int) * CHAR_BIT))
2431 #define UNSETMARKBIT(block,n) \
2432 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2433 &= ~(1 << ((n) % (sizeof(int) * CHAR_BIT)))
2435 #define FLOAT_BLOCK(fptr) \
2436 ((struct float_block *) (((uintptr_t) (fptr)) & ~(BLOCK_ALIGN - 1)))
2438 #define FLOAT_INDEX(fptr) \
2439 ((((uintptr_t) (fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2443 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2444 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2445 int gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2446 struct float_block
*next
;
2449 #define FLOAT_MARKED_P(fptr) \
2450 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2452 #define FLOAT_MARK(fptr) \
2453 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2455 #define FLOAT_UNMARK(fptr) \
2456 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2458 /* Current float_block. */
2460 static struct float_block
*float_block
;
2462 /* Index of first unused Lisp_Float in the current float_block. */
2464 static int float_block_index
;
2466 /* Total number of float blocks now in use. */
2468 static int n_float_blocks
;
2470 /* Free-list of Lisp_Floats. */
2472 static struct Lisp_Float
*float_free_list
;
2475 /* Initialize float allocation. */
2481 float_block_index
= FLOAT_BLOCK_SIZE
; /* Force alloc of new float_block. */
2482 float_free_list
= 0;
2487 /* Return a new float object with value FLOAT_VALUE. */
2490 make_float (double float_value
)
2492 register Lisp_Object val
;
2494 /* eassert (!handling_signal); */
2498 if (float_free_list
)
2500 /* We use the data field for chaining the free list
2501 so that we won't use the same field that has the mark bit. */
2502 XSETFLOAT (val
, float_free_list
);
2503 float_free_list
= float_free_list
->u
.chain
;
2507 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2509 register struct float_block
*new;
2511 new = (struct float_block
*) lisp_align_malloc (sizeof *new,
2513 new->next
= float_block
;
2514 memset (new->gcmarkbits
, 0, sizeof new->gcmarkbits
);
2516 float_block_index
= 0;
2519 XSETFLOAT (val
, &float_block
->floats
[float_block_index
]);
2520 float_block_index
++;
2523 MALLOC_UNBLOCK_INPUT
;
2525 XFLOAT_INIT (val
, float_value
);
2526 eassert (!FLOAT_MARKED_P (XFLOAT (val
)));
2527 consing_since_gc
+= sizeof (struct Lisp_Float
);
2534 /***********************************************************************
2536 ***********************************************************************/
2538 /* We store cons cells inside of cons_blocks, allocating a new
2539 cons_block with malloc whenever necessary. Cons cells reclaimed by
2540 GC are put on a free list to be reallocated before allocating
2541 any new cons cells from the latest cons_block. */
2543 #define CONS_BLOCK_SIZE \
2544 (((BLOCK_BYTES - sizeof (struct cons_block *)) * CHAR_BIT) \
2545 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2547 #define CONS_BLOCK(fptr) \
2548 ((struct cons_block *) ((uintptr_t) (fptr) & ~(BLOCK_ALIGN - 1)))
2550 #define CONS_INDEX(fptr) \
2551 (((uintptr_t) (fptr) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2555 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2556 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2557 int gcmarkbits
[1 + CONS_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2558 struct cons_block
*next
;
2561 #define CONS_MARKED_P(fptr) \
2562 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2564 #define CONS_MARK(fptr) \
2565 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2567 #define CONS_UNMARK(fptr) \
2568 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2570 /* Current cons_block. */
2572 static struct cons_block
*cons_block
;
2574 /* Index of first unused Lisp_Cons in the current block. */
2576 static int cons_block_index
;
2578 /* Free-list of Lisp_Cons structures. */
2580 static struct Lisp_Cons
*cons_free_list
;
2582 /* Total number of cons blocks now in use. */
2584 static int n_cons_blocks
;
2587 /* Initialize cons allocation. */
2593 cons_block_index
= CONS_BLOCK_SIZE
; /* Force alloc of new cons_block. */
2599 /* Explicitly free a cons cell by putting it on the free-list. */
2602 free_cons (struct Lisp_Cons
*ptr
)
2604 ptr
->u
.chain
= cons_free_list
;
2608 cons_free_list
= ptr
;
2611 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
2612 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2613 (Lisp_Object car
, Lisp_Object cdr
)
2615 register Lisp_Object val
;
2617 /* eassert (!handling_signal); */
2623 /* We use the cdr for chaining the free list
2624 so that we won't use the same field that has the mark bit. */
2625 XSETCONS (val
, cons_free_list
);
2626 cons_free_list
= cons_free_list
->u
.chain
;
2630 if (cons_block_index
== CONS_BLOCK_SIZE
)
2632 register struct cons_block
*new;
2633 new = (struct cons_block
*) lisp_align_malloc (sizeof *new,
2635 memset (new->gcmarkbits
, 0, sizeof new->gcmarkbits
);
2636 new->next
= cons_block
;
2638 cons_block_index
= 0;
2641 XSETCONS (val
, &cons_block
->conses
[cons_block_index
]);
2645 MALLOC_UNBLOCK_INPUT
;
2649 eassert (!CONS_MARKED_P (XCONS (val
)));
2650 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2651 cons_cells_consed
++;
2655 #ifdef GC_CHECK_CONS_LIST
2656 /* Get an error now if there's any junk in the cons free list. */
2658 check_cons_list (void)
2660 struct Lisp_Cons
*tail
= cons_free_list
;
2663 tail
= tail
->u
.chain
;
2667 /* Make a list of 1, 2, 3, 4 or 5 specified objects. */
2670 list1 (Lisp_Object arg1
)
2672 return Fcons (arg1
, Qnil
);
2676 list2 (Lisp_Object arg1
, Lisp_Object arg2
)
2678 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2683 list3 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
)
2685 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2690 list4 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
, Lisp_Object arg4
)
2692 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2697 list5 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
, Lisp_Object arg4
, Lisp_Object arg5
)
2699 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2700 Fcons (arg5
, Qnil
)))));
2704 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
2705 doc
: /* Return a newly created list with specified arguments as elements.
2706 Any number of arguments, even zero arguments, are allowed.
2707 usage: (list &rest OBJECTS) */)
2708 (size_t nargs
, register Lisp_Object
*args
)
2710 register Lisp_Object val
;
2716 val
= Fcons (args
[nargs
], val
);
2722 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2723 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2724 (register Lisp_Object length
, Lisp_Object init
)
2726 register Lisp_Object val
;
2727 register EMACS_INT size
;
2729 CHECK_NATNUM (length
);
2730 size
= XFASTINT (length
);
2735 val
= Fcons (init
, val
);
2740 val
= Fcons (init
, val
);
2745 val
= Fcons (init
, val
);
2750 val
= Fcons (init
, val
);
2755 val
= Fcons (init
, val
);
2770 /***********************************************************************
2772 ***********************************************************************/
2774 /* Singly-linked list of all vectors. */
2776 static struct Lisp_Vector
*all_vectors
;
2778 /* Total number of vector-like objects now in use. */
2780 static int n_vectors
;
2783 /* Value is a pointer to a newly allocated Lisp_Vector structure
2784 with room for LEN Lisp_Objects. */
2786 static struct Lisp_Vector
*
2787 allocate_vectorlike (EMACS_INT len
)
2789 struct Lisp_Vector
*p
;
2791 int header_size
= offsetof (struct Lisp_Vector
, contents
);
2792 int word_size
= sizeof p
->contents
[0];
2794 if ((SIZE_MAX
- header_size
) / word_size
< len
)
2795 memory_full (SIZE_MAX
);
2799 #ifdef DOUG_LEA_MALLOC
2800 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
2801 because mapped region contents are not preserved in
2803 mallopt (M_MMAP_MAX
, 0);
2806 /* This gets triggered by code which I haven't bothered to fix. --Stef */
2807 /* eassert (!handling_signal); */
2809 nbytes
= header_size
+ len
* word_size
;
2810 p
= (struct Lisp_Vector
*) lisp_malloc (nbytes
, MEM_TYPE_VECTORLIKE
);
2812 #ifdef DOUG_LEA_MALLOC
2813 /* Back to a reasonable maximum of mmap'ed areas. */
2814 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2817 consing_since_gc
+= nbytes
;
2818 vector_cells_consed
+= len
;
2820 p
->header
.next
.vector
= all_vectors
;
2823 MALLOC_UNBLOCK_INPUT
;
2830 /* Allocate a vector with NSLOTS slots. */
2832 struct Lisp_Vector
*
2833 allocate_vector (EMACS_INT nslots
)
2835 struct Lisp_Vector
*v
= allocate_vectorlike (nslots
);
2836 v
->header
.size
= nslots
;
2841 /* Allocate other vector-like structures. */
2843 struct Lisp_Vector
*
2844 allocate_pseudovector (int memlen
, int lisplen
, EMACS_INT tag
)
2846 struct Lisp_Vector
*v
= allocate_vectorlike (memlen
);
2849 /* Only the first lisplen slots will be traced normally by the GC. */
2850 for (i
= 0; i
< lisplen
; ++i
)
2851 v
->contents
[i
] = Qnil
;
2853 XSETPVECTYPESIZE (v
, tag
, lisplen
);
2857 struct Lisp_Hash_Table
*
2858 allocate_hash_table (void)
2860 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Hash_Table
, count
, PVEC_HASH_TABLE
);
2865 allocate_window (void)
2867 return ALLOCATE_PSEUDOVECTOR(struct window
, current_matrix
, PVEC_WINDOW
);
2872 allocate_terminal (void)
2874 struct terminal
*t
= ALLOCATE_PSEUDOVECTOR (struct terminal
,
2875 next_terminal
, PVEC_TERMINAL
);
2876 /* Zero out the non-GC'd fields. FIXME: This should be made unnecessary. */
2877 memset (&t
->next_terminal
, 0,
2878 (char*) (t
+ 1) - (char*) &t
->next_terminal
);
2884 allocate_frame (void)
2886 struct frame
*f
= ALLOCATE_PSEUDOVECTOR (struct frame
,
2887 face_cache
, PVEC_FRAME
);
2888 /* Zero out the non-GC'd fields. FIXME: This should be made unnecessary. */
2889 memset (&f
->face_cache
, 0,
2890 (char *) (f
+ 1) - (char *) &f
->face_cache
);
2895 struct Lisp_Process
*
2896 allocate_process (void)
2898 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Process
, pid
, PVEC_PROCESS
);
2902 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
2903 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
2904 See also the function `vector'. */)
2905 (register Lisp_Object length
, Lisp_Object init
)
2908 register EMACS_INT sizei
;
2909 register EMACS_INT i
;
2910 register struct Lisp_Vector
*p
;
2912 CHECK_NATNUM (length
);
2913 sizei
= XFASTINT (length
);
2915 p
= allocate_vector (sizei
);
2916 for (i
= 0; i
< sizei
; i
++)
2917 p
->contents
[i
] = init
;
2919 XSETVECTOR (vector
, p
);
2924 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
2925 doc
: /* Return a newly created vector with specified arguments as elements.
2926 Any number of arguments, even zero arguments, are allowed.
2927 usage: (vector &rest OBJECTS) */)
2928 (register size_t nargs
, Lisp_Object
*args
)
2930 register Lisp_Object len
, val
;
2932 register struct Lisp_Vector
*p
;
2934 XSETFASTINT (len
, nargs
);
2935 val
= Fmake_vector (len
, Qnil
);
2937 for (i
= 0; i
< nargs
; i
++)
2938 p
->contents
[i
] = args
[i
];
2943 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
2944 doc
: /* Create a byte-code object with specified arguments as elements.
2945 The arguments should be the ARGLIST, bytecode-string BYTE-CODE, constant
2946 vector CONSTANTS, maximum stack size DEPTH, (optional) DOCSTRING,
2947 and (optional) INTERACTIVE-SPEC.
2948 The first four arguments are required; at most six have any
2950 The ARGLIST can be either like the one of `lambda', in which case the arguments
2951 will be dynamically bound before executing the byte code, or it can be an
2952 integer of the form NNNNNNNRMMMMMMM where the 7bit MMMMMMM specifies the
2953 minimum number of arguments, the 7-bit NNNNNNN specifies the maximum number
2954 of arguments (ignoring &rest) and the R bit specifies whether there is a &rest
2955 argument to catch the left-over arguments. If such an integer is used, the
2956 arguments will not be dynamically bound but will be instead pushed on the
2957 stack before executing the byte-code.
2958 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
2959 (register size_t nargs
, Lisp_Object
*args
)
2961 register Lisp_Object len
, val
;
2963 register struct Lisp_Vector
*p
;
2965 XSETFASTINT (len
, nargs
);
2966 if (!NILP (Vpurify_flag
))
2967 val
= make_pure_vector ((EMACS_INT
) nargs
);
2969 val
= Fmake_vector (len
, Qnil
);
2971 if (nargs
> 1 && STRINGP (args
[1]) && STRING_MULTIBYTE (args
[1]))
2972 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
2973 earlier because they produced a raw 8-bit string for byte-code
2974 and now such a byte-code string is loaded as multibyte while
2975 raw 8-bit characters converted to multibyte form. Thus, now we
2976 must convert them back to the original unibyte form. */
2977 args
[1] = Fstring_as_unibyte (args
[1]);
2980 for (i
= 0; i
< nargs
; i
++)
2982 if (!NILP (Vpurify_flag
))
2983 args
[i
] = Fpurecopy (args
[i
]);
2984 p
->contents
[i
] = args
[i
];
2986 XSETPVECTYPE (p
, PVEC_COMPILED
);
2987 XSETCOMPILED (val
, p
);
2993 /***********************************************************************
2995 ***********************************************************************/
2997 /* Each symbol_block is just under 1020 bytes long, since malloc
2998 really allocates in units of powers of two and uses 4 bytes for its
3001 #define SYMBOL_BLOCK_SIZE \
3002 ((1020 - sizeof (struct symbol_block *)) / sizeof (struct Lisp_Symbol))
3006 /* Place `symbols' first, to preserve alignment. */
3007 struct Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
3008 struct symbol_block
*next
;
3011 /* Current symbol block and index of first unused Lisp_Symbol
3014 static struct symbol_block
*symbol_block
;
3015 static int symbol_block_index
;
3017 /* List of free symbols. */
3019 static struct Lisp_Symbol
*symbol_free_list
;
3021 /* Total number of symbol blocks now in use. */
3023 static int n_symbol_blocks
;
3026 /* Initialize symbol allocation. */
3031 symbol_block
= NULL
;
3032 symbol_block_index
= SYMBOL_BLOCK_SIZE
;
3033 symbol_free_list
= 0;
3034 n_symbol_blocks
= 0;
3038 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
3039 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
3040 Its value and function definition are void, and its property list is nil. */)
3043 register Lisp_Object val
;
3044 register struct Lisp_Symbol
*p
;
3046 CHECK_STRING (name
);
3048 /* eassert (!handling_signal); */
3052 if (symbol_free_list
)
3054 XSETSYMBOL (val
, symbol_free_list
);
3055 symbol_free_list
= symbol_free_list
->next
;
3059 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
3061 struct symbol_block
*new;
3062 new = (struct symbol_block
*) lisp_malloc (sizeof *new,
3064 new->next
= symbol_block
;
3066 symbol_block_index
= 0;
3069 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
]);
3070 symbol_block_index
++;
3073 MALLOC_UNBLOCK_INPUT
;
3078 p
->redirect
= SYMBOL_PLAINVAL
;
3079 SET_SYMBOL_VAL (p
, Qunbound
);
3080 p
->function
= Qunbound
;
3083 p
->interned
= SYMBOL_UNINTERNED
;
3085 p
->declared_special
= 0;
3086 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
3093 /***********************************************************************
3094 Marker (Misc) Allocation
3095 ***********************************************************************/
3097 /* Allocation of markers and other objects that share that structure.
3098 Works like allocation of conses. */
3100 #define MARKER_BLOCK_SIZE \
3101 ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc))
3105 /* Place `markers' first, to preserve alignment. */
3106 union Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
3107 struct marker_block
*next
;
3110 static struct marker_block
*marker_block
;
3111 static int marker_block_index
;
3113 static union Lisp_Misc
*marker_free_list
;
3115 /* Total number of marker blocks now in use. */
3117 static int n_marker_blocks
;
3122 marker_block
= NULL
;
3123 marker_block_index
= MARKER_BLOCK_SIZE
;
3124 marker_free_list
= 0;
3125 n_marker_blocks
= 0;
3128 /* Return a newly allocated Lisp_Misc object, with no substructure. */
3131 allocate_misc (void)
3135 /* eassert (!handling_signal); */
3139 if (marker_free_list
)
3141 XSETMISC (val
, marker_free_list
);
3142 marker_free_list
= marker_free_list
->u_free
.chain
;
3146 if (marker_block_index
== MARKER_BLOCK_SIZE
)
3148 struct marker_block
*new;
3149 new = (struct marker_block
*) lisp_malloc (sizeof *new,
3151 new->next
= marker_block
;
3153 marker_block_index
= 0;
3155 total_free_markers
+= MARKER_BLOCK_SIZE
;
3157 XSETMISC (val
, &marker_block
->markers
[marker_block_index
]);
3158 marker_block_index
++;
3161 MALLOC_UNBLOCK_INPUT
;
3163 --total_free_markers
;
3164 consing_since_gc
+= sizeof (union Lisp_Misc
);
3165 misc_objects_consed
++;
3166 XMISCANY (val
)->gcmarkbit
= 0;
3170 /* Free a Lisp_Misc object */
3173 free_misc (Lisp_Object misc
)
3175 XMISCTYPE (misc
) = Lisp_Misc_Free
;
3176 XMISC (misc
)->u_free
.chain
= marker_free_list
;
3177 marker_free_list
= XMISC (misc
);
3179 total_free_markers
++;
3182 /* Return a Lisp_Misc_Save_Value object containing POINTER and
3183 INTEGER. This is used to package C values to call record_unwind_protect.
3184 The unwind function can get the C values back using XSAVE_VALUE. */
3187 make_save_value (void *pointer
, int integer
)
3189 register Lisp_Object val
;
3190 register struct Lisp_Save_Value
*p
;
3192 val
= allocate_misc ();
3193 XMISCTYPE (val
) = Lisp_Misc_Save_Value
;
3194 p
= XSAVE_VALUE (val
);
3195 p
->pointer
= pointer
;
3196 p
->integer
= integer
;
3201 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
3202 doc
: /* Return a newly allocated marker which does not point at any place. */)
3205 register Lisp_Object val
;
3206 register struct Lisp_Marker
*p
;
3208 val
= allocate_misc ();
3209 XMISCTYPE (val
) = Lisp_Misc_Marker
;
3215 p
->insertion_type
= 0;
3219 /* Put MARKER back on the free list after using it temporarily. */
3222 free_marker (Lisp_Object marker
)
3224 unchain_marker (XMARKER (marker
));
3229 /* Return a newly created vector or string with specified arguments as
3230 elements. If all the arguments are characters that can fit
3231 in a string of events, make a string; otherwise, make a vector.
3233 Any number of arguments, even zero arguments, are allowed. */
3236 make_event_array (register int nargs
, Lisp_Object
*args
)
3240 for (i
= 0; i
< nargs
; i
++)
3241 /* The things that fit in a string
3242 are characters that are in 0...127,
3243 after discarding the meta bit and all the bits above it. */
3244 if (!INTEGERP (args
[i
])
3245 || (XINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
3246 return Fvector (nargs
, args
);
3248 /* Since the loop exited, we know that all the things in it are
3249 characters, so we can make a string. */
3253 result
= Fmake_string (make_number (nargs
), make_number (0));
3254 for (i
= 0; i
< nargs
; i
++)
3256 SSET (result
, i
, XINT (args
[i
]));
3257 /* Move the meta bit to the right place for a string char. */
3258 if (XINT (args
[i
]) & CHAR_META
)
3259 SSET (result
, i
, SREF (result
, i
) | 0x80);
3268 /************************************************************************
3269 Memory Full Handling
3270 ************************************************************************/
3273 /* Called if malloc (NBYTES) returns zero. If NBYTES == SIZE_MAX,
3274 there may have been size_t overflow so that malloc was never
3275 called, or perhaps malloc was invoked successfully but the
3276 resulting pointer had problems fitting into a tagged EMACS_INT. In
3277 either case this counts as memory being full even though malloc did
3281 memory_full (size_t nbytes
)
3283 /* Do not go into hysterics merely because a large request failed. */
3284 int enough_free_memory
= 0;
3285 if (SPARE_MEMORY
< nbytes
)
3287 void *p
= malloc (SPARE_MEMORY
);
3291 enough_free_memory
= 1;
3295 if (! enough_free_memory
)
3301 memory_full_cons_threshold
= sizeof (struct cons_block
);
3303 /* The first time we get here, free the spare memory. */
3304 for (i
= 0; i
< sizeof (spare_memory
) / sizeof (char *); i
++)
3305 if (spare_memory
[i
])
3308 free (spare_memory
[i
]);
3309 else if (i
>= 1 && i
<= 4)
3310 lisp_align_free (spare_memory
[i
]);
3312 lisp_free (spare_memory
[i
]);
3313 spare_memory
[i
] = 0;
3316 /* Record the space now used. When it decreases substantially,
3317 we can refill the memory reserve. */
3318 #if !defined SYSTEM_MALLOC && !defined SYNC_INPUT
3319 bytes_used_when_full
= BYTES_USED
;
3323 /* This used to call error, but if we've run out of memory, we could
3324 get infinite recursion trying to build the string. */
3325 xsignal (Qnil
, Vmemory_signal_data
);
3328 /* If we released our reserve (due to running out of memory),
3329 and we have a fair amount free once again,
3330 try to set aside another reserve in case we run out once more.
3332 This is called when a relocatable block is freed in ralloc.c,
3333 and also directly from this file, in case we're not using ralloc.c. */
3336 refill_memory_reserve (void)
3338 #ifndef SYSTEM_MALLOC
3339 if (spare_memory
[0] == 0)
3340 spare_memory
[0] = (char *) malloc ((size_t) SPARE_MEMORY
);
3341 if (spare_memory
[1] == 0)
3342 spare_memory
[1] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3344 if (spare_memory
[2] == 0)
3345 spare_memory
[2] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3347 if (spare_memory
[3] == 0)
3348 spare_memory
[3] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3350 if (spare_memory
[4] == 0)
3351 spare_memory
[4] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3353 if (spare_memory
[5] == 0)
3354 spare_memory
[5] = (char *) lisp_malloc (sizeof (struct string_block
),
3356 if (spare_memory
[6] == 0)
3357 spare_memory
[6] = (char *) lisp_malloc (sizeof (struct string_block
),
3359 if (spare_memory
[0] && spare_memory
[1] && spare_memory
[5])
3360 Vmemory_full
= Qnil
;
3364 /************************************************************************
3366 ************************************************************************/
3368 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
3370 /* Conservative C stack marking requires a method to identify possibly
3371 live Lisp objects given a pointer value. We do this by keeping
3372 track of blocks of Lisp data that are allocated in a red-black tree
3373 (see also the comment of mem_node which is the type of nodes in
3374 that tree). Function lisp_malloc adds information for an allocated
3375 block to the red-black tree with calls to mem_insert, and function
3376 lisp_free removes it with mem_delete. Functions live_string_p etc
3377 call mem_find to lookup information about a given pointer in the
3378 tree, and use that to determine if the pointer points to a Lisp
3381 /* Initialize this part of alloc.c. */
3386 mem_z
.left
= mem_z
.right
= MEM_NIL
;
3387 mem_z
.parent
= NULL
;
3388 mem_z
.color
= MEM_BLACK
;
3389 mem_z
.start
= mem_z
.end
= NULL
;
3394 /* Value is a pointer to the mem_node containing START. Value is
3395 MEM_NIL if there is no node in the tree containing START. */
3397 static inline struct mem_node
*
3398 mem_find (void *start
)
3402 if (start
< min_heap_address
|| start
> max_heap_address
)
3405 /* Make the search always successful to speed up the loop below. */
3406 mem_z
.start
= start
;
3407 mem_z
.end
= (char *) start
+ 1;
3410 while (start
< p
->start
|| start
>= p
->end
)
3411 p
= start
< p
->start
? p
->left
: p
->right
;
3416 /* Insert a new node into the tree for a block of memory with start
3417 address START, end address END, and type TYPE. Value is a
3418 pointer to the node that was inserted. */
3420 static struct mem_node
*
3421 mem_insert (void *start
, void *end
, enum mem_type type
)
3423 struct mem_node
*c
, *parent
, *x
;
3425 if (min_heap_address
== NULL
|| start
< min_heap_address
)
3426 min_heap_address
= start
;
3427 if (max_heap_address
== NULL
|| end
> max_heap_address
)
3428 max_heap_address
= end
;
3430 /* See where in the tree a node for START belongs. In this
3431 particular application, it shouldn't happen that a node is already
3432 present. For debugging purposes, let's check that. */
3436 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3438 while (c
!= MEM_NIL
)
3440 if (start
>= c
->start
&& start
< c
->end
)
3443 c
= start
< c
->start
? c
->left
: c
->right
;
3446 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3448 while (c
!= MEM_NIL
)
3451 c
= start
< c
->start
? c
->left
: c
->right
;
3454 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3456 /* Create a new node. */
3457 #ifdef GC_MALLOC_CHECK
3458 x
= (struct mem_node
*) _malloc_internal (sizeof *x
);
3462 x
= (struct mem_node
*) xmalloc (sizeof *x
);
3468 x
->left
= x
->right
= MEM_NIL
;
3471 /* Insert it as child of PARENT or install it as root. */
3474 if (start
< parent
->start
)
3482 /* Re-establish red-black tree properties. */
3483 mem_insert_fixup (x
);
3489 /* Re-establish the red-black properties of the tree, and thereby
3490 balance the tree, after node X has been inserted; X is always red. */
3493 mem_insert_fixup (struct mem_node
*x
)
3495 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3497 /* X is red and its parent is red. This is a violation of
3498 red-black tree property #3. */
3500 if (x
->parent
== x
->parent
->parent
->left
)
3502 /* We're on the left side of our grandparent, and Y is our
3504 struct mem_node
*y
= x
->parent
->parent
->right
;
3506 if (y
->color
== MEM_RED
)
3508 /* Uncle and parent are red but should be black because
3509 X is red. Change the colors accordingly and proceed
3510 with the grandparent. */
3511 x
->parent
->color
= MEM_BLACK
;
3512 y
->color
= MEM_BLACK
;
3513 x
->parent
->parent
->color
= MEM_RED
;
3514 x
= x
->parent
->parent
;
3518 /* Parent and uncle have different colors; parent is
3519 red, uncle is black. */
3520 if (x
== x
->parent
->right
)
3523 mem_rotate_left (x
);
3526 x
->parent
->color
= MEM_BLACK
;
3527 x
->parent
->parent
->color
= MEM_RED
;
3528 mem_rotate_right (x
->parent
->parent
);
3533 /* This is the symmetrical case of above. */
3534 struct mem_node
*y
= x
->parent
->parent
->left
;
3536 if (y
->color
== MEM_RED
)
3538 x
->parent
->color
= MEM_BLACK
;
3539 y
->color
= MEM_BLACK
;
3540 x
->parent
->parent
->color
= MEM_RED
;
3541 x
= x
->parent
->parent
;
3545 if (x
== x
->parent
->left
)
3548 mem_rotate_right (x
);
3551 x
->parent
->color
= MEM_BLACK
;
3552 x
->parent
->parent
->color
= MEM_RED
;
3553 mem_rotate_left (x
->parent
->parent
);
3558 /* The root may have been changed to red due to the algorithm. Set
3559 it to black so that property #5 is satisfied. */
3560 mem_root
->color
= MEM_BLACK
;
3571 mem_rotate_left (struct mem_node
*x
)
3575 /* Turn y's left sub-tree into x's right sub-tree. */
3578 if (y
->left
!= MEM_NIL
)
3579 y
->left
->parent
= x
;
3581 /* Y's parent was x's parent. */
3583 y
->parent
= x
->parent
;
3585 /* Get the parent to point to y instead of x. */
3588 if (x
== x
->parent
->left
)
3589 x
->parent
->left
= y
;
3591 x
->parent
->right
= y
;
3596 /* Put x on y's left. */
3610 mem_rotate_right (struct mem_node
*x
)
3612 struct mem_node
*y
= x
->left
;
3615 if (y
->right
!= MEM_NIL
)
3616 y
->right
->parent
= x
;
3619 y
->parent
= x
->parent
;
3622 if (x
== x
->parent
->right
)
3623 x
->parent
->right
= y
;
3625 x
->parent
->left
= y
;
3636 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
3639 mem_delete (struct mem_node
*z
)
3641 struct mem_node
*x
, *y
;
3643 if (!z
|| z
== MEM_NIL
)
3646 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
3651 while (y
->left
!= MEM_NIL
)
3655 if (y
->left
!= MEM_NIL
)
3660 x
->parent
= y
->parent
;
3663 if (y
== y
->parent
->left
)
3664 y
->parent
->left
= x
;
3666 y
->parent
->right
= x
;
3673 z
->start
= y
->start
;
3678 if (y
->color
== MEM_BLACK
)
3679 mem_delete_fixup (x
);
3681 #ifdef GC_MALLOC_CHECK
3689 /* Re-establish the red-black properties of the tree, after a
3693 mem_delete_fixup (struct mem_node
*x
)
3695 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
3697 if (x
== x
->parent
->left
)
3699 struct mem_node
*w
= x
->parent
->right
;
3701 if (w
->color
== MEM_RED
)
3703 w
->color
= MEM_BLACK
;
3704 x
->parent
->color
= MEM_RED
;
3705 mem_rotate_left (x
->parent
);
3706 w
= x
->parent
->right
;
3709 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
3716 if (w
->right
->color
== MEM_BLACK
)
3718 w
->left
->color
= MEM_BLACK
;
3720 mem_rotate_right (w
);
3721 w
= x
->parent
->right
;
3723 w
->color
= x
->parent
->color
;
3724 x
->parent
->color
= MEM_BLACK
;
3725 w
->right
->color
= MEM_BLACK
;
3726 mem_rotate_left (x
->parent
);
3732 struct mem_node
*w
= x
->parent
->left
;
3734 if (w
->color
== MEM_RED
)
3736 w
->color
= MEM_BLACK
;
3737 x
->parent
->color
= MEM_RED
;
3738 mem_rotate_right (x
->parent
);
3739 w
= x
->parent
->left
;
3742 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
3749 if (w
->left
->color
== MEM_BLACK
)
3751 w
->right
->color
= MEM_BLACK
;
3753 mem_rotate_left (w
);
3754 w
= x
->parent
->left
;
3757 w
->color
= x
->parent
->color
;
3758 x
->parent
->color
= MEM_BLACK
;
3759 w
->left
->color
= MEM_BLACK
;
3760 mem_rotate_right (x
->parent
);
3766 x
->color
= MEM_BLACK
;
3770 /* Value is non-zero if P is a pointer to a live Lisp string on
3771 the heap. M is a pointer to the mem_block for P. */
3774 live_string_p (struct mem_node
*m
, void *p
)
3776 if (m
->type
== MEM_TYPE_STRING
)
3778 struct string_block
*b
= (struct string_block
*) m
->start
;
3779 ptrdiff_t offset
= (char *) p
- (char *) &b
->strings
[0];
3781 /* P must point to the start of a Lisp_String structure, and it
3782 must not be on the free-list. */
3784 && offset
% sizeof b
->strings
[0] == 0
3785 && offset
< (STRING_BLOCK_SIZE
* sizeof b
->strings
[0])
3786 && ((struct Lisp_String
*) p
)->data
!= NULL
);
3793 /* Value is non-zero if P is a pointer to a live Lisp cons on
3794 the heap. M is a pointer to the mem_block for P. */
3797 live_cons_p (struct mem_node
*m
, void *p
)
3799 if (m
->type
== MEM_TYPE_CONS
)
3801 struct cons_block
*b
= (struct cons_block
*) m
->start
;
3802 ptrdiff_t offset
= (char *) p
- (char *) &b
->conses
[0];
3804 /* P must point to the start of a Lisp_Cons, not be
3805 one of the unused cells in the current cons block,
3806 and not be on the free-list. */
3808 && offset
% sizeof b
->conses
[0] == 0
3809 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
3811 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
3812 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
3819 /* Value is non-zero if P is a pointer to a live Lisp symbol on
3820 the heap. M is a pointer to the mem_block for P. */
3823 live_symbol_p (struct mem_node
*m
, void *p
)
3825 if (m
->type
== MEM_TYPE_SYMBOL
)
3827 struct symbol_block
*b
= (struct symbol_block
*) m
->start
;
3828 ptrdiff_t offset
= (char *) p
- (char *) &b
->symbols
[0];
3830 /* P must point to the start of a Lisp_Symbol, not be
3831 one of the unused cells in the current symbol block,
3832 and not be on the free-list. */
3834 && offset
% sizeof b
->symbols
[0] == 0
3835 && offset
< (SYMBOL_BLOCK_SIZE
* sizeof b
->symbols
[0])
3836 && (b
!= symbol_block
3837 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
3838 && !EQ (((struct Lisp_Symbol
*) p
)->function
, Vdead
));
3845 /* Value is non-zero if P is a pointer to a live Lisp float on
3846 the heap. M is a pointer to the mem_block for P. */
3849 live_float_p (struct mem_node
*m
, void *p
)
3851 if (m
->type
== MEM_TYPE_FLOAT
)
3853 struct float_block
*b
= (struct float_block
*) m
->start
;
3854 ptrdiff_t offset
= (char *) p
- (char *) &b
->floats
[0];
3856 /* P must point to the start of a Lisp_Float and not be
3857 one of the unused cells in the current float block. */
3859 && offset
% sizeof b
->floats
[0] == 0
3860 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
3861 && (b
!= float_block
3862 || offset
/ sizeof b
->floats
[0] < float_block_index
));
3869 /* Value is non-zero if P is a pointer to a live Lisp Misc on
3870 the heap. M is a pointer to the mem_block for P. */
3873 live_misc_p (struct mem_node
*m
, void *p
)
3875 if (m
->type
== MEM_TYPE_MISC
)
3877 struct marker_block
*b
= (struct marker_block
*) m
->start
;
3878 ptrdiff_t offset
= (char *) p
- (char *) &b
->markers
[0];
3880 /* P must point to the start of a Lisp_Misc, not be
3881 one of the unused cells in the current misc block,
3882 and not be on the free-list. */
3884 && offset
% sizeof b
->markers
[0] == 0
3885 && offset
< (MARKER_BLOCK_SIZE
* sizeof b
->markers
[0])
3886 && (b
!= marker_block
3887 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
3888 && ((union Lisp_Misc
*) p
)->u_any
.type
!= Lisp_Misc_Free
);
3895 /* Value is non-zero if P is a pointer to a live vector-like object.
3896 M is a pointer to the mem_block for P. */
3899 live_vector_p (struct mem_node
*m
, void *p
)
3901 return (p
== m
->start
&& m
->type
== MEM_TYPE_VECTORLIKE
);
3905 /* Value is non-zero if P is a pointer to a live buffer. M is a
3906 pointer to the mem_block for P. */
3909 live_buffer_p (struct mem_node
*m
, void *p
)
3911 /* P must point to the start of the block, and the buffer
3912 must not have been killed. */
3913 return (m
->type
== MEM_TYPE_BUFFER
3915 && !NILP (((struct buffer
*) p
)->BUFFER_INTERNAL_FIELD (name
)));
3918 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
3922 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3924 /* Array of objects that are kept alive because the C stack contains
3925 a pattern that looks like a reference to them . */
3927 #define MAX_ZOMBIES 10
3928 static Lisp_Object zombies
[MAX_ZOMBIES
];
3930 /* Number of zombie objects. */
3932 static int nzombies
;
3934 /* Number of garbage collections. */
3938 /* Average percentage of zombies per collection. */
3940 static double avg_zombies
;
3942 /* Max. number of live and zombie objects. */
3944 static int max_live
, max_zombies
;
3946 /* Average number of live objects per GC. */
3948 static double avg_live
;
3950 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
3951 doc
: /* Show information about live and zombie objects. */)
3954 Lisp_Object args
[8], zombie_list
= Qnil
;
3956 for (i
= 0; i
< nzombies
; i
++)
3957 zombie_list
= Fcons (zombies
[i
], zombie_list
);
3958 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
3959 args
[1] = make_number (ngcs
);
3960 args
[2] = make_float (avg_live
);
3961 args
[3] = make_float (avg_zombies
);
3962 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
3963 args
[5] = make_number (max_live
);
3964 args
[6] = make_number (max_zombies
);
3965 args
[7] = zombie_list
;
3966 return Fmessage (8, args
);
3969 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
3972 /* Mark OBJ if we can prove it's a Lisp_Object. */
3975 mark_maybe_object (Lisp_Object obj
)
3983 po
= (void *) XPNTR (obj
);
3990 switch (XTYPE (obj
))
3993 mark_p
= (live_string_p (m
, po
)
3994 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
3998 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
4002 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
4006 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
4009 case Lisp_Vectorlike
:
4010 /* Note: can't check BUFFERP before we know it's a
4011 buffer because checking that dereferences the pointer
4012 PO which might point anywhere. */
4013 if (live_vector_p (m
, po
))
4014 mark_p
= !SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
4015 else if (live_buffer_p (m
, po
))
4016 mark_p
= BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
4020 mark_p
= (live_misc_p (m
, po
) && !XMISCANY (obj
)->gcmarkbit
);
4029 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4030 if (nzombies
< MAX_ZOMBIES
)
4031 zombies
[nzombies
] = obj
;
4040 /* If P points to Lisp data, mark that as live if it isn't already
4044 mark_maybe_pointer (void *p
)
4048 /* Quickly rule out some values which can't point to Lisp data. */
4051 8 /* USE_LSB_TAG needs Lisp data to be aligned on multiples of 8. */
4053 2 /* We assume that Lisp data is aligned on even addresses. */
4061 Lisp_Object obj
= Qnil
;
4065 case MEM_TYPE_NON_LISP
:
4066 /* Nothing to do; not a pointer to Lisp memory. */
4069 case MEM_TYPE_BUFFER
:
4070 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P((struct buffer
*)p
))
4071 XSETVECTOR (obj
, p
);
4075 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
4079 case MEM_TYPE_STRING
:
4080 if (live_string_p (m
, p
)
4081 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
4082 XSETSTRING (obj
, p
);
4086 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
4090 case MEM_TYPE_SYMBOL
:
4091 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
4092 XSETSYMBOL (obj
, p
);
4095 case MEM_TYPE_FLOAT
:
4096 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
4100 case MEM_TYPE_VECTORLIKE
:
4101 if (live_vector_p (m
, p
))
4104 XSETVECTOR (tem
, p
);
4105 if (!SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
4120 /* Mark Lisp objects referenced from the address range START+OFFSET..END
4121 or END+OFFSET..START. */
4124 mark_memory (void *start
, void *end
, int offset
)
4129 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4133 /* Make START the pointer to the start of the memory region,
4134 if it isn't already. */
4142 /* Mark Lisp_Objects. */
4143 for (p
= (Lisp_Object
*) ((char *) start
+ offset
); (void *) p
< end
; ++p
)
4144 mark_maybe_object (*p
);
4146 /* Mark Lisp data pointed to. This is necessary because, in some
4147 situations, the C compiler optimizes Lisp objects away, so that
4148 only a pointer to them remains. Example:
4150 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
4153 Lisp_Object obj = build_string ("test");
4154 struct Lisp_String *s = XSTRING (obj);
4155 Fgarbage_collect ();
4156 fprintf (stderr, "test `%s'\n", s->data);
4160 Here, `obj' isn't really used, and the compiler optimizes it
4161 away. The only reference to the life string is through the
4164 for (pp
= (void **) ((char *) start
+ offset
); (void *) pp
< end
; ++pp
)
4165 mark_maybe_pointer (*pp
);
4168 /* setjmp will work with GCC unless NON_SAVING_SETJMP is defined in
4169 the GCC system configuration. In gcc 3.2, the only systems for
4170 which this is so are i386-sco5 non-ELF, i386-sysv3 (maybe included
4171 by others?) and ns32k-pc532-min. */
4173 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
4175 static int setjmp_tested_p
, longjmps_done
;
4177 #define SETJMP_WILL_LIKELY_WORK "\
4179 Emacs garbage collector has been changed to use conservative stack\n\
4180 marking. Emacs has determined that the method it uses to do the\n\
4181 marking will likely work on your system, but this isn't sure.\n\
4183 If you are a system-programmer, or can get the help of a local wizard\n\
4184 who is, please take a look at the function mark_stack in alloc.c, and\n\
4185 verify that the methods used are appropriate for your system.\n\
4187 Please mail the result to <emacs-devel@gnu.org>.\n\
4190 #define SETJMP_WILL_NOT_WORK "\
4192 Emacs garbage collector has been changed to use conservative stack\n\
4193 marking. Emacs has determined that the default method it uses to do the\n\
4194 marking will not work on your system. We will need a system-dependent\n\
4195 solution for your system.\n\
4197 Please take a look at the function mark_stack in alloc.c, and\n\
4198 try to find a way to make it work on your system.\n\
4200 Note that you may get false negatives, depending on the compiler.\n\
4201 In particular, you need to use -O with GCC for this test.\n\
4203 Please mail the result to <emacs-devel@gnu.org>.\n\
4207 /* Perform a quick check if it looks like setjmp saves registers in a
4208 jmp_buf. Print a message to stderr saying so. When this test
4209 succeeds, this is _not_ a proof that setjmp is sufficient for
4210 conservative stack marking. Only the sources or a disassembly
4221 /* Arrange for X to be put in a register. */
4227 if (longjmps_done
== 1)
4229 /* Came here after the longjmp at the end of the function.
4231 If x == 1, the longjmp has restored the register to its
4232 value before the setjmp, and we can hope that setjmp
4233 saves all such registers in the jmp_buf, although that
4236 For other values of X, either something really strange is
4237 taking place, or the setjmp just didn't save the register. */
4240 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
4243 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
4250 if (longjmps_done
== 1)
4254 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
4257 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4259 /* Abort if anything GCPRO'd doesn't survive the GC. */
4267 for (p
= gcprolist
; p
; p
= p
->next
)
4268 for (i
= 0; i
< p
->nvars
; ++i
)
4269 if (!survives_gc_p (p
->var
[i
]))
4270 /* FIXME: It's not necessarily a bug. It might just be that the
4271 GCPRO is unnecessary or should release the object sooner. */
4275 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4282 fprintf (stderr
, "\nZombies kept alive = %d:\n", nzombies
);
4283 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
4285 fprintf (stderr
, " %d = ", i
);
4286 debug_print (zombies
[i
]);
4290 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4293 /* Mark live Lisp objects on the C stack.
4295 There are several system-dependent problems to consider when
4296 porting this to new architectures:
4300 We have to mark Lisp objects in CPU registers that can hold local
4301 variables or are used to pass parameters.
4303 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
4304 something that either saves relevant registers on the stack, or
4305 calls mark_maybe_object passing it each register's contents.
4307 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
4308 implementation assumes that calling setjmp saves registers we need
4309 to see in a jmp_buf which itself lies on the stack. This doesn't
4310 have to be true! It must be verified for each system, possibly
4311 by taking a look at the source code of setjmp.
4313 If __builtin_unwind_init is available (defined by GCC >= 2.8) we
4314 can use it as a machine independent method to store all registers
4315 to the stack. In this case the macros described in the previous
4316 two paragraphs are not used.
4320 Architectures differ in the way their processor stack is organized.
4321 For example, the stack might look like this
4324 | Lisp_Object | size = 4
4326 | something else | size = 2
4328 | Lisp_Object | size = 4
4332 In such a case, not every Lisp_Object will be aligned equally. To
4333 find all Lisp_Object on the stack it won't be sufficient to walk
4334 the stack in steps of 4 bytes. Instead, two passes will be
4335 necessary, one starting at the start of the stack, and a second
4336 pass starting at the start of the stack + 2. Likewise, if the
4337 minimal alignment of Lisp_Objects on the stack is 1, four passes
4338 would be necessary, each one starting with one byte more offset
4339 from the stack start.
4341 The current code assumes by default that Lisp_Objects are aligned
4342 equally on the stack. */
4350 #ifdef HAVE___BUILTIN_UNWIND_INIT
4351 /* Force callee-saved registers and register windows onto the stack.
4352 This is the preferred method if available, obviating the need for
4353 machine dependent methods. */
4354 __builtin_unwind_init ();
4356 #else /* not HAVE___BUILTIN_UNWIND_INIT */
4357 #ifndef GC_SAVE_REGISTERS_ON_STACK
4358 /* jmp_buf may not be aligned enough on darwin-ppc64 */
4359 union aligned_jmpbuf
{
4363 volatile int stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
4365 /* This trick flushes the register windows so that all the state of
4366 the process is contained in the stack. */
4367 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
4368 needed on ia64 too. See mach_dep.c, where it also says inline
4369 assembler doesn't work with relevant proprietary compilers. */
4371 #if defined (__sparc64__) && defined (__FreeBSD__)
4372 /* FreeBSD does not have a ta 3 handler. */
4379 /* Save registers that we need to see on the stack. We need to see
4380 registers used to hold register variables and registers used to
4382 #ifdef GC_SAVE_REGISTERS_ON_STACK
4383 GC_SAVE_REGISTERS_ON_STACK (end
);
4384 #else /* not GC_SAVE_REGISTERS_ON_STACK */
4386 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
4387 setjmp will definitely work, test it
4388 and print a message with the result
4390 if (!setjmp_tested_p
)
4392 setjmp_tested_p
= 1;
4395 #endif /* GC_SETJMP_WORKS */
4398 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
4399 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
4400 #endif /* not HAVE___BUILTIN_UNWIND_INIT */
4402 /* This assumes that the stack is a contiguous region in memory. If
4403 that's not the case, something has to be done here to iterate
4404 over the stack segments. */
4405 #ifndef GC_LISP_OBJECT_ALIGNMENT
4407 #define GC_LISP_OBJECT_ALIGNMENT __alignof__ (Lisp_Object)
4409 #define GC_LISP_OBJECT_ALIGNMENT sizeof (Lisp_Object)
4412 for (i
= 0; i
< sizeof (Lisp_Object
); i
+= GC_LISP_OBJECT_ALIGNMENT
)
4413 mark_memory (stack_base
, end
, i
);
4414 /* Allow for marking a secondary stack, like the register stack on the
4416 #ifdef GC_MARK_SECONDARY_STACK
4417 GC_MARK_SECONDARY_STACK ();
4420 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4425 #endif /* GC_MARK_STACK != 0 */
4428 /* Determine whether it is safe to access memory at address P. */
4430 valid_pointer_p (void *p
)
4433 return w32_valid_pointer_p (p
, 16);
4437 /* Obviously, we cannot just access it (we would SEGV trying), so we
4438 trick the o/s to tell us whether p is a valid pointer.
4439 Unfortunately, we cannot use NULL_DEVICE here, as emacs_write may
4440 not validate p in that case. */
4442 if ((fd
= emacs_open ("__Valid__Lisp__Object__", O_CREAT
| O_WRONLY
| O_TRUNC
, 0666)) >= 0)
4444 int valid
= (emacs_write (fd
, (char *)p
, 16) == 16);
4446 unlink ("__Valid__Lisp__Object__");
4454 /* Return 1 if OBJ is a valid lisp object.
4455 Return 0 if OBJ is NOT a valid lisp object.
4456 Return -1 if we cannot validate OBJ.
4457 This function can be quite slow,
4458 so it should only be used in code for manual debugging. */
4461 valid_lisp_object_p (Lisp_Object obj
)
4471 p
= (void *) XPNTR (obj
);
4472 if (PURE_POINTER_P (p
))
4476 return valid_pointer_p (p
);
4483 int valid
= valid_pointer_p (p
);
4495 case MEM_TYPE_NON_LISP
:
4498 case MEM_TYPE_BUFFER
:
4499 return live_buffer_p (m
, p
);
4502 return live_cons_p (m
, p
);
4504 case MEM_TYPE_STRING
:
4505 return live_string_p (m
, p
);
4508 return live_misc_p (m
, p
);
4510 case MEM_TYPE_SYMBOL
:
4511 return live_symbol_p (m
, p
);
4513 case MEM_TYPE_FLOAT
:
4514 return live_float_p (m
, p
);
4516 case MEM_TYPE_VECTORLIKE
:
4517 return live_vector_p (m
, p
);
4530 /***********************************************************************
4531 Pure Storage Management
4532 ***********************************************************************/
4534 /* Allocate room for SIZE bytes from pure Lisp storage and return a
4535 pointer to it. TYPE is the Lisp type for which the memory is
4536 allocated. TYPE < 0 means it's not used for a Lisp object. */
4538 static POINTER_TYPE
*
4539 pure_alloc (size_t size
, int type
)
4541 POINTER_TYPE
*result
;
4543 size_t alignment
= (1 << GCTYPEBITS
);
4545 size_t alignment
= sizeof (EMACS_INT
);
4547 /* Give Lisp_Floats an extra alignment. */
4548 if (type
== Lisp_Float
)
4550 #if defined __GNUC__ && __GNUC__ >= 2
4551 alignment
= __alignof (struct Lisp_Float
);
4553 alignment
= sizeof (struct Lisp_Float
);
4561 /* Allocate space for a Lisp object from the beginning of the free
4562 space with taking account of alignment. */
4563 result
= ALIGN (purebeg
+ pure_bytes_used_lisp
, alignment
);
4564 pure_bytes_used_lisp
= ((char *)result
- (char *)purebeg
) + size
;
4568 /* Allocate space for a non-Lisp object from the end of the free
4570 pure_bytes_used_non_lisp
+= size
;
4571 result
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4573 pure_bytes_used
= pure_bytes_used_lisp
+ pure_bytes_used_non_lisp
;
4575 if (pure_bytes_used
<= pure_size
)
4578 /* Don't allocate a large amount here,
4579 because it might get mmap'd and then its address
4580 might not be usable. */
4581 purebeg
= (char *) xmalloc (10000);
4583 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
4584 pure_bytes_used
= 0;
4585 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
4590 /* Print a warning if PURESIZE is too small. */
4593 check_pure_size (void)
4595 if (pure_bytes_used_before_overflow
)
4596 message (("emacs:0:Pure Lisp storage overflow (approx. %"pI
"d"
4598 pure_bytes_used
+ pure_bytes_used_before_overflow
);
4602 /* Find the byte sequence {DATA[0], ..., DATA[NBYTES-1], '\0'} from
4603 the non-Lisp data pool of the pure storage, and return its start
4604 address. Return NULL if not found. */
4607 find_string_data_in_pure (const char *data
, EMACS_INT nbytes
)
4610 EMACS_INT skip
, bm_skip
[256], last_char_skip
, infinity
, start
, start_max
;
4611 const unsigned char *p
;
4614 if (pure_bytes_used_non_lisp
< nbytes
+ 1)
4617 /* Set up the Boyer-Moore table. */
4619 for (i
= 0; i
< 256; i
++)
4622 p
= (const unsigned char *) data
;
4624 bm_skip
[*p
++] = skip
;
4626 last_char_skip
= bm_skip
['\0'];
4628 non_lisp_beg
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4629 start_max
= pure_bytes_used_non_lisp
- (nbytes
+ 1);
4631 /* See the comments in the function `boyer_moore' (search.c) for the
4632 use of `infinity'. */
4633 infinity
= pure_bytes_used_non_lisp
+ 1;
4634 bm_skip
['\0'] = infinity
;
4636 p
= (const unsigned char *) non_lisp_beg
+ nbytes
;
4640 /* Check the last character (== '\0'). */
4643 start
+= bm_skip
[*(p
+ start
)];
4645 while (start
<= start_max
);
4647 if (start
< infinity
)
4648 /* Couldn't find the last character. */
4651 /* No less than `infinity' means we could find the last
4652 character at `p[start - infinity]'. */
4655 /* Check the remaining characters. */
4656 if (memcmp (data
, non_lisp_beg
+ start
, nbytes
) == 0)
4658 return non_lisp_beg
+ start
;
4660 start
+= last_char_skip
;
4662 while (start
<= start_max
);
4668 /* Return a string allocated in pure space. DATA is a buffer holding
4669 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
4670 non-zero means make the result string multibyte.
4672 Must get an error if pure storage is full, since if it cannot hold
4673 a large string it may be able to hold conses that point to that
4674 string; then the string is not protected from gc. */
4677 make_pure_string (const char *data
,
4678 EMACS_INT nchars
, EMACS_INT nbytes
, int multibyte
)
4681 struct Lisp_String
*s
;
4683 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4684 s
->data
= (unsigned char *) find_string_data_in_pure (data
, nbytes
);
4685 if (s
->data
== NULL
)
4687 s
->data
= (unsigned char *) pure_alloc (nbytes
+ 1, -1);
4688 memcpy (s
->data
, data
, nbytes
);
4689 s
->data
[nbytes
] = '\0';
4692 s
->size_byte
= multibyte
? nbytes
: -1;
4693 s
->intervals
= NULL_INTERVAL
;
4694 XSETSTRING (string
, s
);
4698 /* Return a string a string allocated in pure space. Do not allocate
4699 the string data, just point to DATA. */
4702 make_pure_c_string (const char *data
)
4705 struct Lisp_String
*s
;
4706 EMACS_INT nchars
= strlen (data
);
4708 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4711 s
->data
= (unsigned char *) data
;
4712 s
->intervals
= NULL_INTERVAL
;
4713 XSETSTRING (string
, s
);
4717 /* Return a cons allocated from pure space. Give it pure copies
4718 of CAR as car and CDR as cdr. */
4721 pure_cons (Lisp_Object car
, Lisp_Object cdr
)
4723 register Lisp_Object
new;
4724 struct Lisp_Cons
*p
;
4726 p
= (struct Lisp_Cons
*) pure_alloc (sizeof *p
, Lisp_Cons
);
4728 XSETCAR (new, Fpurecopy (car
));
4729 XSETCDR (new, Fpurecopy (cdr
));
4734 /* Value is a float object with value NUM allocated from pure space. */
4737 make_pure_float (double num
)
4739 register Lisp_Object
new;
4740 struct Lisp_Float
*p
;
4742 p
= (struct Lisp_Float
*) pure_alloc (sizeof *p
, Lisp_Float
);
4744 XFLOAT_INIT (new, num
);
4749 /* Return a vector with room for LEN Lisp_Objects allocated from
4753 make_pure_vector (EMACS_INT len
)
4756 struct Lisp_Vector
*p
;
4757 size_t size
= (offsetof (struct Lisp_Vector
, contents
)
4758 + len
* sizeof (Lisp_Object
));
4760 p
= (struct Lisp_Vector
*) pure_alloc (size
, Lisp_Vectorlike
);
4761 XSETVECTOR (new, p
);
4762 XVECTOR (new)->header
.size
= len
;
4767 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
4768 doc
: /* Make a copy of object OBJ in pure storage.
4769 Recursively copies contents of vectors and cons cells.
4770 Does not copy symbols. Copies strings without text properties. */)
4771 (register Lisp_Object obj
)
4773 if (NILP (Vpurify_flag
))
4776 if (PURE_POINTER_P (XPNTR (obj
)))
4779 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
4781 Lisp_Object tmp
= Fgethash (obj
, Vpurify_flag
, Qnil
);
4787 obj
= pure_cons (XCAR (obj
), XCDR (obj
));
4788 else if (FLOATP (obj
))
4789 obj
= make_pure_float (XFLOAT_DATA (obj
));
4790 else if (STRINGP (obj
))
4791 obj
= make_pure_string (SSDATA (obj
), SCHARS (obj
),
4793 STRING_MULTIBYTE (obj
));
4794 else if (COMPILEDP (obj
) || VECTORP (obj
))
4796 register struct Lisp_Vector
*vec
;
4797 register EMACS_INT i
;
4801 if (size
& PSEUDOVECTOR_FLAG
)
4802 size
&= PSEUDOVECTOR_SIZE_MASK
;
4803 vec
= XVECTOR (make_pure_vector (size
));
4804 for (i
= 0; i
< size
; i
++)
4805 vec
->contents
[i
] = Fpurecopy (XVECTOR (obj
)->contents
[i
]);
4806 if (COMPILEDP (obj
))
4808 XSETPVECTYPE (vec
, PVEC_COMPILED
);
4809 XSETCOMPILED (obj
, vec
);
4812 XSETVECTOR (obj
, vec
);
4814 else if (MARKERP (obj
))
4815 error ("Attempt to copy a marker to pure storage");
4817 /* Not purified, don't hash-cons. */
4820 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
4821 Fputhash (obj
, obj
, Vpurify_flag
);
4828 /***********************************************************************
4830 ***********************************************************************/
4832 /* Put an entry in staticvec, pointing at the variable with address
4836 staticpro (Lisp_Object
*varaddress
)
4838 staticvec
[staticidx
++] = varaddress
;
4839 if (staticidx
>= NSTATICS
)
4844 /***********************************************************************
4846 ***********************************************************************/
4848 /* Temporarily prevent garbage collection. */
4851 inhibit_garbage_collection (void)
4853 int count
= SPECPDL_INDEX ();
4854 int nbits
= min (VALBITS
, BITS_PER_INT
);
4856 specbind (Qgc_cons_threshold
, make_number (((EMACS_INT
) 1 << (nbits
- 1)) - 1));
4861 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
4862 doc
: /* Reclaim storage for Lisp objects no longer needed.
4863 Garbage collection happens automatically if you cons more than
4864 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
4865 `garbage-collect' normally returns a list with info on amount of space in use:
4866 ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)
4867 (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS
4868 (USED-FLOATS . FREE-FLOATS) (USED-INTERVALS . FREE-INTERVALS)
4869 (USED-STRINGS . FREE-STRINGS))
4870 However, if there was overflow in pure space, `garbage-collect'
4871 returns nil, because real GC can't be done. */)
4874 register struct specbinding
*bind
;
4875 char stack_top_variable
;
4878 Lisp_Object total
[8];
4879 int count
= SPECPDL_INDEX ();
4880 EMACS_TIME t1
, t2
, t3
;
4885 /* Can't GC if pure storage overflowed because we can't determine
4886 if something is a pure object or not. */
4887 if (pure_bytes_used_before_overflow
)
4892 /* Don't keep undo information around forever.
4893 Do this early on, so it is no problem if the user quits. */
4895 register struct buffer
*nextb
= all_buffers
;
4899 /* If a buffer's undo list is Qt, that means that undo is
4900 turned off in that buffer. Calling truncate_undo_list on
4901 Qt tends to return NULL, which effectively turns undo back on.
4902 So don't call truncate_undo_list if undo_list is Qt. */
4903 if (! NILP (nextb
->BUFFER_INTERNAL_FIELD (name
)) && ! EQ (nextb
->BUFFER_INTERNAL_FIELD (undo_list
), Qt
))
4904 truncate_undo_list (nextb
);
4906 /* Shrink buffer gaps, but skip indirect and dead buffers. */
4907 if (nextb
->base_buffer
== 0 && !NILP (nextb
->BUFFER_INTERNAL_FIELD (name
))
4908 && ! nextb
->text
->inhibit_shrinking
)
4910 /* If a buffer's gap size is more than 10% of the buffer
4911 size, or larger than 2000 bytes, then shrink it
4912 accordingly. Keep a minimum size of 20 bytes. */
4913 int size
= min (2000, max (20, (nextb
->text
->z_byte
/ 10)));
4915 if (nextb
->text
->gap_size
> size
)
4917 struct buffer
*save_current
= current_buffer
;
4918 current_buffer
= nextb
;
4919 make_gap (-(nextb
->text
->gap_size
- size
));
4920 current_buffer
= save_current
;
4924 nextb
= nextb
->header
.next
.buffer
;
4928 EMACS_GET_TIME (t1
);
4930 /* In case user calls debug_print during GC,
4931 don't let that cause a recursive GC. */
4932 consing_since_gc
= 0;
4934 /* Save what's currently displayed in the echo area. */
4935 message_p
= push_message ();
4936 record_unwind_protect (pop_message_unwind
, Qnil
);
4938 /* Save a copy of the contents of the stack, for debugging. */
4939 #if MAX_SAVE_STACK > 0
4940 if (NILP (Vpurify_flag
))
4944 if (&stack_top_variable
< stack_bottom
)
4946 stack
= &stack_top_variable
;
4947 stack_size
= stack_bottom
- &stack_top_variable
;
4951 stack
= stack_bottom
;
4952 stack_size
= &stack_top_variable
- stack_bottom
;
4954 if (stack_size
<= MAX_SAVE_STACK
)
4956 if (stack_copy_size
< stack_size
)
4958 stack_copy
= (char *) xrealloc (stack_copy
, stack_size
);
4959 stack_copy_size
= stack_size
;
4961 memcpy (stack_copy
, stack
, stack_size
);
4964 #endif /* MAX_SAVE_STACK > 0 */
4966 if (garbage_collection_messages
)
4967 message1_nolog ("Garbage collecting...");
4971 shrink_regexp_cache ();
4975 /* clear_marks (); */
4977 /* Mark all the special slots that serve as the roots of accessibility. */
4979 for (i
= 0; i
< staticidx
; i
++)
4980 mark_object (*staticvec
[i
]);
4982 for (bind
= specpdl
; bind
!= specpdl_ptr
; bind
++)
4984 mark_object (bind
->symbol
);
4985 mark_object (bind
->old_value
);
4993 extern void xg_mark_data (void);
4998 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
4999 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
5003 register struct gcpro
*tail
;
5004 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
5005 for (i
= 0; i
< tail
->nvars
; i
++)
5006 mark_object (tail
->var
[i
]);
5010 struct catchtag
*catch;
5011 struct handler
*handler
;
5013 for (catch = catchlist
; catch; catch = catch->next
)
5015 mark_object (catch->tag
);
5016 mark_object (catch->val
);
5018 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
5020 mark_object (handler
->handler
);
5021 mark_object (handler
->var
);
5027 #ifdef HAVE_WINDOW_SYSTEM
5028 mark_fringe_data ();
5031 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5035 /* Everything is now marked, except for the things that require special
5036 finalization, i.e. the undo_list.
5037 Look thru every buffer's undo list
5038 for elements that update markers that were not marked,
5041 register struct buffer
*nextb
= all_buffers
;
5045 /* If a buffer's undo list is Qt, that means that undo is
5046 turned off in that buffer. Calling truncate_undo_list on
5047 Qt tends to return NULL, which effectively turns undo back on.
5048 So don't call truncate_undo_list if undo_list is Qt. */
5049 if (! EQ (nextb
->BUFFER_INTERNAL_FIELD (undo_list
), Qt
))
5051 Lisp_Object tail
, prev
;
5052 tail
= nextb
->BUFFER_INTERNAL_FIELD (undo_list
);
5054 while (CONSP (tail
))
5056 if (CONSP (XCAR (tail
))
5057 && MARKERP (XCAR (XCAR (tail
)))
5058 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
5061 nextb
->BUFFER_INTERNAL_FIELD (undo_list
) = tail
= XCDR (tail
);
5065 XSETCDR (prev
, tail
);
5075 /* Now that we have stripped the elements that need not be in the
5076 undo_list any more, we can finally mark the list. */
5077 mark_object (nextb
->BUFFER_INTERNAL_FIELD (undo_list
));
5079 nextb
= nextb
->header
.next
.buffer
;
5085 /* Clear the mark bits that we set in certain root slots. */
5087 unmark_byte_stack ();
5088 VECTOR_UNMARK (&buffer_defaults
);
5089 VECTOR_UNMARK (&buffer_local_symbols
);
5091 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
5099 /* clear_marks (); */
5102 consing_since_gc
= 0;
5103 if (gc_cons_threshold
< 10000)
5104 gc_cons_threshold
= 10000;
5106 if (FLOATP (Vgc_cons_percentage
))
5107 { /* Set gc_cons_combined_threshold. */
5110 tot
+= total_conses
* sizeof (struct Lisp_Cons
);
5111 tot
+= total_symbols
* sizeof (struct Lisp_Symbol
);
5112 tot
+= total_markers
* sizeof (union Lisp_Misc
);
5113 tot
+= total_string_size
;
5114 tot
+= total_vector_size
* sizeof (Lisp_Object
);
5115 tot
+= total_floats
* sizeof (struct Lisp_Float
);
5116 tot
+= total_intervals
* sizeof (struct interval
);
5117 tot
+= total_strings
* sizeof (struct Lisp_String
);
5119 gc_relative_threshold
= tot
* XFLOAT_DATA (Vgc_cons_percentage
);
5122 gc_relative_threshold
= 0;
5124 if (garbage_collection_messages
)
5126 if (message_p
|| minibuf_level
> 0)
5129 message1_nolog ("Garbage collecting...done");
5132 unbind_to (count
, Qnil
);
5134 total
[0] = Fcons (make_number (total_conses
),
5135 make_number (total_free_conses
));
5136 total
[1] = Fcons (make_number (total_symbols
),
5137 make_number (total_free_symbols
));
5138 total
[2] = Fcons (make_number (total_markers
),
5139 make_number (total_free_markers
));
5140 total
[3] = make_number (total_string_size
);
5141 total
[4] = make_number (total_vector_size
);
5142 total
[5] = Fcons (make_number (total_floats
),
5143 make_number (total_free_floats
));
5144 total
[6] = Fcons (make_number (total_intervals
),
5145 make_number (total_free_intervals
));
5146 total
[7] = Fcons (make_number (total_strings
),
5147 make_number (total_free_strings
));
5149 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5151 /* Compute average percentage of zombies. */
5154 for (i
= 0; i
< 7; ++i
)
5155 if (CONSP (total
[i
]))
5156 nlive
+= XFASTINT (XCAR (total
[i
]));
5158 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
5159 max_live
= max (nlive
, max_live
);
5160 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
5161 max_zombies
= max (nzombies
, max_zombies
);
5166 if (!NILP (Vpost_gc_hook
))
5168 int gc_count
= inhibit_garbage_collection ();
5169 safe_run_hooks (Qpost_gc_hook
);
5170 unbind_to (gc_count
, Qnil
);
5173 /* Accumulate statistics. */
5174 EMACS_GET_TIME (t2
);
5175 EMACS_SUB_TIME (t3
, t2
, t1
);
5176 if (FLOATP (Vgc_elapsed
))
5177 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
) +
5179 EMACS_USECS (t3
) * 1.0e-6);
5182 return Flist (sizeof total
/ sizeof *total
, total
);
5186 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
5187 only interesting objects referenced from glyphs are strings. */
5190 mark_glyph_matrix (struct glyph_matrix
*matrix
)
5192 struct glyph_row
*row
= matrix
->rows
;
5193 struct glyph_row
*end
= row
+ matrix
->nrows
;
5195 for (; row
< end
; ++row
)
5199 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
5201 struct glyph
*glyph
= row
->glyphs
[area
];
5202 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
5204 for (; glyph
< end_glyph
; ++glyph
)
5205 if (STRINGP (glyph
->object
)
5206 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
5207 mark_object (glyph
->object
);
5213 /* Mark Lisp faces in the face cache C. */
5216 mark_face_cache (struct face_cache
*c
)
5221 for (i
= 0; i
< c
->used
; ++i
)
5223 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
5227 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
5228 mark_object (face
->lface
[j
]);
5236 /* Mark reference to a Lisp_Object.
5237 If the object referred to has not been seen yet, recursively mark
5238 all the references contained in it. */
5240 #define LAST_MARKED_SIZE 500
5241 static Lisp_Object last_marked
[LAST_MARKED_SIZE
];
5242 static int last_marked_index
;
5244 /* For debugging--call abort when we cdr down this many
5245 links of a list, in mark_object. In debugging,
5246 the call to abort will hit a breakpoint.
5247 Normally this is zero and the check never goes off. */
5248 static size_t mark_object_loop_halt
;
5251 mark_vectorlike (struct Lisp_Vector
*ptr
)
5253 register EMACS_UINT size
= ptr
->header
.size
;
5254 register EMACS_UINT i
;
5256 eassert (!VECTOR_MARKED_P (ptr
));
5257 VECTOR_MARK (ptr
); /* Else mark it */
5258 if (size
& PSEUDOVECTOR_FLAG
)
5259 size
&= PSEUDOVECTOR_SIZE_MASK
;
5261 /* Note that this size is not the memory-footprint size, but only
5262 the number of Lisp_Object fields that we should trace.
5263 The distinction is used e.g. by Lisp_Process which places extra
5264 non-Lisp_Object fields at the end of the structure. */
5265 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5266 mark_object (ptr
->contents
[i
]);
5269 /* Like mark_vectorlike but optimized for char-tables (and
5270 sub-char-tables) assuming that the contents are mostly integers or
5274 mark_char_table (struct Lisp_Vector
*ptr
)
5276 register EMACS_UINT size
= ptr
->header
.size
& PSEUDOVECTOR_SIZE_MASK
;
5277 register EMACS_UINT i
;
5279 eassert (!VECTOR_MARKED_P (ptr
));
5281 for (i
= 0; i
< size
; i
++)
5283 Lisp_Object val
= ptr
->contents
[i
];
5285 if (INTEGERP (val
) || (SYMBOLP (val
) && XSYMBOL (val
)->gcmarkbit
))
5287 if (SUB_CHAR_TABLE_P (val
))
5289 if (! VECTOR_MARKED_P (XVECTOR (val
)))
5290 mark_char_table (XVECTOR (val
));
5298 mark_object (Lisp_Object arg
)
5300 register Lisp_Object obj
= arg
;
5301 #ifdef GC_CHECK_MARKED_OBJECTS
5305 size_t cdr_count
= 0;
5309 if (PURE_POINTER_P (XPNTR (obj
)))
5312 last_marked
[last_marked_index
++] = obj
;
5313 if (last_marked_index
== LAST_MARKED_SIZE
)
5314 last_marked_index
= 0;
5316 /* Perform some sanity checks on the objects marked here. Abort if
5317 we encounter an object we know is bogus. This increases GC time
5318 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
5319 #ifdef GC_CHECK_MARKED_OBJECTS
5321 po
= (void *) XPNTR (obj
);
5323 /* Check that the object pointed to by PO is known to be a Lisp
5324 structure allocated from the heap. */
5325 #define CHECK_ALLOCATED() \
5327 m = mem_find (po); \
5332 /* Check that the object pointed to by PO is live, using predicate
5334 #define CHECK_LIVE(LIVEP) \
5336 if (!LIVEP (m, po)) \
5340 /* Check both of the above conditions. */
5341 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
5343 CHECK_ALLOCATED (); \
5344 CHECK_LIVE (LIVEP); \
5347 #else /* not GC_CHECK_MARKED_OBJECTS */
5349 #define CHECK_LIVE(LIVEP) (void) 0
5350 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
5352 #endif /* not GC_CHECK_MARKED_OBJECTS */
5354 switch (SWITCH_ENUM_CAST (XTYPE (obj
)))
5358 register struct Lisp_String
*ptr
= XSTRING (obj
);
5359 if (STRING_MARKED_P (ptr
))
5361 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
5362 MARK_INTERVAL_TREE (ptr
->intervals
);
5364 #ifdef GC_CHECK_STRING_BYTES
5365 /* Check that the string size recorded in the string is the
5366 same as the one recorded in the sdata structure. */
5367 CHECK_STRING_BYTES (ptr
);
5368 #endif /* GC_CHECK_STRING_BYTES */
5372 case Lisp_Vectorlike
:
5373 if (VECTOR_MARKED_P (XVECTOR (obj
)))
5375 #ifdef GC_CHECK_MARKED_OBJECTS
5377 if (m
== MEM_NIL
&& !SUBRP (obj
)
5378 && po
!= &buffer_defaults
5379 && po
!= &buffer_local_symbols
)
5381 #endif /* GC_CHECK_MARKED_OBJECTS */
5385 #ifdef GC_CHECK_MARKED_OBJECTS
5386 if (po
!= &buffer_defaults
&& po
!= &buffer_local_symbols
)
5389 for (b
= all_buffers
; b
&& b
!= po
; b
= b
->header
.next
.buffer
)
5394 #endif /* GC_CHECK_MARKED_OBJECTS */
5397 else if (SUBRP (obj
))
5399 else if (COMPILEDP (obj
))
5400 /* We could treat this just like a vector, but it is better to
5401 save the COMPILED_CONSTANTS element for last and avoid
5404 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5405 register EMACS_UINT size
= ptr
->header
.size
;
5406 register EMACS_UINT i
;
5408 CHECK_LIVE (live_vector_p
);
5409 VECTOR_MARK (ptr
); /* Else mark it */
5410 size
&= PSEUDOVECTOR_SIZE_MASK
;
5411 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5413 if (i
!= COMPILED_CONSTANTS
)
5414 mark_object (ptr
->contents
[i
]);
5416 obj
= ptr
->contents
[COMPILED_CONSTANTS
];
5419 else if (FRAMEP (obj
))
5421 register struct frame
*ptr
= XFRAME (obj
);
5422 mark_vectorlike (XVECTOR (obj
));
5423 mark_face_cache (ptr
->face_cache
);
5425 else if (WINDOWP (obj
))
5427 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5428 struct window
*w
= XWINDOW (obj
);
5429 mark_vectorlike (ptr
);
5430 /* Mark glyphs for leaf windows. Marking window matrices is
5431 sufficient because frame matrices use the same glyph
5433 if (NILP (w
->hchild
)
5435 && w
->current_matrix
)
5437 mark_glyph_matrix (w
->current_matrix
);
5438 mark_glyph_matrix (w
->desired_matrix
);
5441 else if (HASH_TABLE_P (obj
))
5443 struct Lisp_Hash_Table
*h
= XHASH_TABLE (obj
);
5444 mark_vectorlike ((struct Lisp_Vector
*)h
);
5445 /* If hash table is not weak, mark all keys and values.
5446 For weak tables, mark only the vector. */
5448 mark_object (h
->key_and_value
);
5450 VECTOR_MARK (XVECTOR (h
->key_and_value
));
5452 else if (CHAR_TABLE_P (obj
))
5453 mark_char_table (XVECTOR (obj
));
5455 mark_vectorlike (XVECTOR (obj
));
5460 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
5461 struct Lisp_Symbol
*ptrx
;
5465 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
5467 mark_object (ptr
->function
);
5468 mark_object (ptr
->plist
);
5469 switch (ptr
->redirect
)
5471 case SYMBOL_PLAINVAL
: mark_object (SYMBOL_VAL (ptr
)); break;
5472 case SYMBOL_VARALIAS
:
5475 XSETSYMBOL (tem
, SYMBOL_ALIAS (ptr
));
5479 case SYMBOL_LOCALIZED
:
5481 struct Lisp_Buffer_Local_Value
*blv
= SYMBOL_BLV (ptr
);
5482 /* If the value is forwarded to a buffer or keyboard field,
5483 these are marked when we see the corresponding object.
5484 And if it's forwarded to a C variable, either it's not
5485 a Lisp_Object var, or it's staticpro'd already. */
5486 mark_object (blv
->where
);
5487 mark_object (blv
->valcell
);
5488 mark_object (blv
->defcell
);
5491 case SYMBOL_FORWARDED
:
5492 /* If the value is forwarded to a buffer or keyboard field,
5493 these are marked when we see the corresponding object.
5494 And if it's forwarded to a C variable, either it's not
5495 a Lisp_Object var, or it's staticpro'd already. */
5499 if (!PURE_POINTER_P (XSTRING (ptr
->xname
)))
5500 MARK_STRING (XSTRING (ptr
->xname
));
5501 MARK_INTERVAL_TREE (STRING_INTERVALS (ptr
->xname
));
5506 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun */
5507 XSETSYMBOL (obj
, ptrx
);
5514 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
5515 if (XMISCANY (obj
)->gcmarkbit
)
5517 XMISCANY (obj
)->gcmarkbit
= 1;
5519 switch (XMISCTYPE (obj
))
5522 case Lisp_Misc_Marker
:
5523 /* DO NOT mark thru the marker's chain.
5524 The buffer's markers chain does not preserve markers from gc;
5525 instead, markers are removed from the chain when freed by gc. */
5528 case Lisp_Misc_Save_Value
:
5531 register struct Lisp_Save_Value
*ptr
= XSAVE_VALUE (obj
);
5532 /* If DOGC is set, POINTER is the address of a memory
5533 area containing INTEGER potential Lisp_Objects. */
5536 Lisp_Object
*p
= (Lisp_Object
*) ptr
->pointer
;
5538 for (nelt
= ptr
->integer
; nelt
> 0; nelt
--, p
++)
5539 mark_maybe_object (*p
);
5545 case Lisp_Misc_Overlay
:
5547 struct Lisp_Overlay
*ptr
= XOVERLAY (obj
);
5548 mark_object (ptr
->start
);
5549 mark_object (ptr
->end
);
5550 mark_object (ptr
->plist
);
5553 XSETMISC (obj
, ptr
->next
);
5566 register struct Lisp_Cons
*ptr
= XCONS (obj
);
5567 if (CONS_MARKED_P (ptr
))
5569 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
5571 /* If the cdr is nil, avoid recursion for the car. */
5572 if (EQ (ptr
->u
.cdr
, Qnil
))
5578 mark_object (ptr
->car
);
5581 if (cdr_count
== mark_object_loop_halt
)
5587 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
5588 FLOAT_MARK (XFLOAT (obj
));
5599 #undef CHECK_ALLOCATED
5600 #undef CHECK_ALLOCATED_AND_LIVE
5603 /* Mark the pointers in a buffer structure. */
5606 mark_buffer (Lisp_Object buf
)
5608 register struct buffer
*buffer
= XBUFFER (buf
);
5609 register Lisp_Object
*ptr
, tmp
;
5610 Lisp_Object base_buffer
;
5612 eassert (!VECTOR_MARKED_P (buffer
));
5613 VECTOR_MARK (buffer
);
5615 MARK_INTERVAL_TREE (BUF_INTERVALS (buffer
));
5617 /* For now, we just don't mark the undo_list. It's done later in
5618 a special way just before the sweep phase, and after stripping
5619 some of its elements that are not needed any more. */
5621 if (buffer
->overlays_before
)
5623 XSETMISC (tmp
, buffer
->overlays_before
);
5626 if (buffer
->overlays_after
)
5628 XSETMISC (tmp
, buffer
->overlays_after
);
5632 /* buffer-local Lisp variables start at `undo_list',
5633 tho only the ones from `name' on are GC'd normally. */
5634 for (ptr
= &buffer
->BUFFER_INTERNAL_FIELD (name
);
5635 (char *)ptr
< (char *)buffer
+ sizeof (struct buffer
);
5639 /* If this is an indirect buffer, mark its base buffer. */
5640 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
5642 XSETBUFFER (base_buffer
, buffer
->base_buffer
);
5643 mark_buffer (base_buffer
);
5647 /* Mark the Lisp pointers in the terminal objects.
5648 Called by the Fgarbage_collector. */
5651 mark_terminals (void)
5654 for (t
= terminal_list
; t
; t
= t
->next_terminal
)
5656 eassert (t
->name
!= NULL
);
5657 #ifdef HAVE_WINDOW_SYSTEM
5658 /* If a terminal object is reachable from a stacpro'ed object,
5659 it might have been marked already. Make sure the image cache
5661 mark_image_cache (t
->image_cache
);
5662 #endif /* HAVE_WINDOW_SYSTEM */
5663 if (!VECTOR_MARKED_P (t
))
5664 mark_vectorlike ((struct Lisp_Vector
*)t
);
5670 /* Value is non-zero if OBJ will survive the current GC because it's
5671 either marked or does not need to be marked to survive. */
5674 survives_gc_p (Lisp_Object obj
)
5678 switch (XTYPE (obj
))
5685 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
5689 survives_p
= XMISCANY (obj
)->gcmarkbit
;
5693 survives_p
= STRING_MARKED_P (XSTRING (obj
));
5696 case Lisp_Vectorlike
:
5697 survives_p
= SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
5701 survives_p
= CONS_MARKED_P (XCONS (obj
));
5705 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
5712 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
5717 /* Sweep: find all structures not marked, and free them. */
5722 /* Remove or mark entries in weak hash tables.
5723 This must be done before any object is unmarked. */
5724 sweep_weak_hash_tables ();
5727 #ifdef GC_CHECK_STRING_BYTES
5728 if (!noninteractive
)
5729 check_string_bytes (1);
5732 /* Put all unmarked conses on free list */
5734 register struct cons_block
*cblk
;
5735 struct cons_block
**cprev
= &cons_block
;
5736 register int lim
= cons_block_index
;
5737 register int num_free
= 0, num_used
= 0;
5741 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
5745 int ilim
= (lim
+ BITS_PER_INT
- 1) / BITS_PER_INT
;
5747 /* Scan the mark bits an int at a time. */
5748 for (i
= 0; i
<= ilim
; i
++)
5750 if (cblk
->gcmarkbits
[i
] == -1)
5752 /* Fast path - all cons cells for this int are marked. */
5753 cblk
->gcmarkbits
[i
] = 0;
5754 num_used
+= BITS_PER_INT
;
5758 /* Some cons cells for this int are not marked.
5759 Find which ones, and free them. */
5760 int start
, pos
, stop
;
5762 start
= i
* BITS_PER_INT
;
5764 if (stop
> BITS_PER_INT
)
5765 stop
= BITS_PER_INT
;
5768 for (pos
= start
; pos
< stop
; pos
++)
5770 if (!CONS_MARKED_P (&cblk
->conses
[pos
]))
5773 cblk
->conses
[pos
].u
.chain
= cons_free_list
;
5774 cons_free_list
= &cblk
->conses
[pos
];
5776 cons_free_list
->car
= Vdead
;
5782 CONS_UNMARK (&cblk
->conses
[pos
]);
5788 lim
= CONS_BLOCK_SIZE
;
5789 /* If this block contains only free conses and we have already
5790 seen more than two blocks worth of free conses then deallocate
5792 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
5794 *cprev
= cblk
->next
;
5795 /* Unhook from the free list. */
5796 cons_free_list
= cblk
->conses
[0].u
.chain
;
5797 lisp_align_free (cblk
);
5802 num_free
+= this_free
;
5803 cprev
= &cblk
->next
;
5806 total_conses
= num_used
;
5807 total_free_conses
= num_free
;
5810 /* Put all unmarked floats on free list */
5812 register struct float_block
*fblk
;
5813 struct float_block
**fprev
= &float_block
;
5814 register int lim
= float_block_index
;
5815 register int num_free
= 0, num_used
= 0;
5817 float_free_list
= 0;
5819 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
5823 for (i
= 0; i
< lim
; i
++)
5824 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
5827 fblk
->floats
[i
].u
.chain
= float_free_list
;
5828 float_free_list
= &fblk
->floats
[i
];
5833 FLOAT_UNMARK (&fblk
->floats
[i
]);
5835 lim
= FLOAT_BLOCK_SIZE
;
5836 /* If this block contains only free floats and we have already
5837 seen more than two blocks worth of free floats then deallocate
5839 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
5841 *fprev
= fblk
->next
;
5842 /* Unhook from the free list. */
5843 float_free_list
= fblk
->floats
[0].u
.chain
;
5844 lisp_align_free (fblk
);
5849 num_free
+= this_free
;
5850 fprev
= &fblk
->next
;
5853 total_floats
= num_used
;
5854 total_free_floats
= num_free
;
5857 /* Put all unmarked intervals on free list */
5859 register struct interval_block
*iblk
;
5860 struct interval_block
**iprev
= &interval_block
;
5861 register int lim
= interval_block_index
;
5862 register int num_free
= 0, num_used
= 0;
5864 interval_free_list
= 0;
5866 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
5871 for (i
= 0; i
< lim
; i
++)
5873 if (!iblk
->intervals
[i
].gcmarkbit
)
5875 SET_INTERVAL_PARENT (&iblk
->intervals
[i
], interval_free_list
);
5876 interval_free_list
= &iblk
->intervals
[i
];
5882 iblk
->intervals
[i
].gcmarkbit
= 0;
5885 lim
= INTERVAL_BLOCK_SIZE
;
5886 /* If this block contains only free intervals and we have already
5887 seen more than two blocks worth of free intervals then
5888 deallocate this block. */
5889 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
5891 *iprev
= iblk
->next
;
5892 /* Unhook from the free list. */
5893 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
5895 n_interval_blocks
--;
5899 num_free
+= this_free
;
5900 iprev
= &iblk
->next
;
5903 total_intervals
= num_used
;
5904 total_free_intervals
= num_free
;
5907 /* Put all unmarked symbols on free list */
5909 register struct symbol_block
*sblk
;
5910 struct symbol_block
**sprev
= &symbol_block
;
5911 register int lim
= symbol_block_index
;
5912 register int num_free
= 0, num_used
= 0;
5914 symbol_free_list
= NULL
;
5916 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
5919 struct Lisp_Symbol
*sym
= sblk
->symbols
;
5920 struct Lisp_Symbol
*end
= sym
+ lim
;
5922 for (; sym
< end
; ++sym
)
5924 /* Check if the symbol was created during loadup. In such a case
5925 it might be pointed to by pure bytecode which we don't trace,
5926 so we conservatively assume that it is live. */
5927 int pure_p
= PURE_POINTER_P (XSTRING (sym
->xname
));
5929 if (!sym
->gcmarkbit
&& !pure_p
)
5931 if (sym
->redirect
== SYMBOL_LOCALIZED
)
5932 xfree (SYMBOL_BLV (sym
));
5933 sym
->next
= symbol_free_list
;
5934 symbol_free_list
= sym
;
5936 symbol_free_list
->function
= Vdead
;
5944 UNMARK_STRING (XSTRING (sym
->xname
));
5949 lim
= SYMBOL_BLOCK_SIZE
;
5950 /* If this block contains only free symbols and we have already
5951 seen more than two blocks worth of free symbols then deallocate
5953 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
5955 *sprev
= sblk
->next
;
5956 /* Unhook from the free list. */
5957 symbol_free_list
= sblk
->symbols
[0].next
;
5963 num_free
+= this_free
;
5964 sprev
= &sblk
->next
;
5967 total_symbols
= num_used
;
5968 total_free_symbols
= num_free
;
5971 /* Put all unmarked misc's on free list.
5972 For a marker, first unchain it from the buffer it points into. */
5974 register struct marker_block
*mblk
;
5975 struct marker_block
**mprev
= &marker_block
;
5976 register int lim
= marker_block_index
;
5977 register int num_free
= 0, num_used
= 0;
5979 marker_free_list
= 0;
5981 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
5986 for (i
= 0; i
< lim
; i
++)
5988 if (!mblk
->markers
[i
].u_any
.gcmarkbit
)
5990 if (mblk
->markers
[i
].u_any
.type
== Lisp_Misc_Marker
)
5991 unchain_marker (&mblk
->markers
[i
].u_marker
);
5992 /* Set the type of the freed object to Lisp_Misc_Free.
5993 We could leave the type alone, since nobody checks it,
5994 but this might catch bugs faster. */
5995 mblk
->markers
[i
].u_marker
.type
= Lisp_Misc_Free
;
5996 mblk
->markers
[i
].u_free
.chain
= marker_free_list
;
5997 marker_free_list
= &mblk
->markers
[i
];
6003 mblk
->markers
[i
].u_any
.gcmarkbit
= 0;
6006 lim
= MARKER_BLOCK_SIZE
;
6007 /* If this block contains only free markers and we have already
6008 seen more than two blocks worth of free markers then deallocate
6010 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
6012 *mprev
= mblk
->next
;
6013 /* Unhook from the free list. */
6014 marker_free_list
= mblk
->markers
[0].u_free
.chain
;
6020 num_free
+= this_free
;
6021 mprev
= &mblk
->next
;
6025 total_markers
= num_used
;
6026 total_free_markers
= num_free
;
6029 /* Free all unmarked buffers */
6031 register struct buffer
*buffer
= all_buffers
, *prev
= 0, *next
;
6034 if (!VECTOR_MARKED_P (buffer
))
6037 prev
->header
.next
= buffer
->header
.next
;
6039 all_buffers
= buffer
->header
.next
.buffer
;
6040 next
= buffer
->header
.next
.buffer
;
6046 VECTOR_UNMARK (buffer
);
6047 UNMARK_BALANCE_INTERVALS (BUF_INTERVALS (buffer
));
6048 prev
= buffer
, buffer
= buffer
->header
.next
.buffer
;
6052 /* Free all unmarked vectors */
6054 register struct Lisp_Vector
*vector
= all_vectors
, *prev
= 0, *next
;
6055 total_vector_size
= 0;
6058 if (!VECTOR_MARKED_P (vector
))
6061 prev
->header
.next
= vector
->header
.next
;
6063 all_vectors
= vector
->header
.next
.vector
;
6064 next
= vector
->header
.next
.vector
;
6072 VECTOR_UNMARK (vector
);
6073 if (vector
->header
.size
& PSEUDOVECTOR_FLAG
)
6074 total_vector_size
+= PSEUDOVECTOR_SIZE_MASK
& vector
->header
.size
;
6076 total_vector_size
+= vector
->header
.size
;
6077 prev
= vector
, vector
= vector
->header
.next
.vector
;
6081 #ifdef GC_CHECK_STRING_BYTES
6082 if (!noninteractive
)
6083 check_string_bytes (1);
6090 /* Debugging aids. */
6092 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
6093 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
6094 This may be helpful in debugging Emacs's memory usage.
6095 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
6100 XSETINT (end
, (intptr_t) (char *) sbrk (0) / 1024);
6105 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
6106 doc
: /* Return a list of counters that measure how much consing there has been.
6107 Each of these counters increments for a certain kind of object.
6108 The counters wrap around from the largest positive integer to zero.
6109 Garbage collection does not decrease them.
6110 The elements of the value are as follows:
6111 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
6112 All are in units of 1 = one object consed
6113 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
6115 MISCS include overlays, markers, and some internal types.
6116 Frames, windows, buffers, and subprocesses count as vectors
6117 (but the contents of a buffer's text do not count here). */)
6120 Lisp_Object consed
[8];
6122 consed
[0] = make_number (min (MOST_POSITIVE_FIXNUM
, cons_cells_consed
));
6123 consed
[1] = make_number (min (MOST_POSITIVE_FIXNUM
, floats_consed
));
6124 consed
[2] = make_number (min (MOST_POSITIVE_FIXNUM
, vector_cells_consed
));
6125 consed
[3] = make_number (min (MOST_POSITIVE_FIXNUM
, symbols_consed
));
6126 consed
[4] = make_number (min (MOST_POSITIVE_FIXNUM
, string_chars_consed
));
6127 consed
[5] = make_number (min (MOST_POSITIVE_FIXNUM
, misc_objects_consed
));
6128 consed
[6] = make_number (min (MOST_POSITIVE_FIXNUM
, intervals_consed
));
6129 consed
[7] = make_number (min (MOST_POSITIVE_FIXNUM
, strings_consed
));
6131 return Flist (8, consed
);
6134 #ifdef ENABLE_CHECKING
6135 int suppress_checking
;
6138 die (const char *msg
, const char *file
, int line
)
6140 fprintf (stderr
, "\r\n%s:%d: Emacs fatal error: %s\r\n",
6146 /* Initialization */
6149 init_alloc_once (void)
6151 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
6153 pure_size
= PURESIZE
;
6154 pure_bytes_used
= 0;
6155 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
6156 pure_bytes_used_before_overflow
= 0;
6158 /* Initialize the list of free aligned blocks. */
6161 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
6163 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
6167 ignore_warnings
= 1;
6168 #ifdef DOUG_LEA_MALLOC
6169 mallopt (M_TRIM_THRESHOLD
, 128*1024); /* trim threshold */
6170 mallopt (M_MMAP_THRESHOLD
, 64*1024); /* mmap threshold */
6171 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* max. number of mmap'ed areas */
6179 init_weak_hash_tables ();
6182 malloc_hysteresis
= 32;
6184 malloc_hysteresis
= 0;
6187 refill_memory_reserve ();
6189 ignore_warnings
= 0;
6191 byte_stack_list
= 0;
6193 consing_since_gc
= 0;
6194 gc_cons_threshold
= 100000 * sizeof (Lisp_Object
);
6195 gc_relative_threshold
= 0;
6202 byte_stack_list
= 0;
6204 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
6205 setjmp_tested_p
= longjmps_done
= 0;
6208 Vgc_elapsed
= make_float (0.0);
6213 syms_of_alloc (void)
6215 DEFVAR_INT ("gc-cons-threshold", gc_cons_threshold
,
6216 doc
: /* *Number of bytes of consing between garbage collections.
6217 Garbage collection can happen automatically once this many bytes have been
6218 allocated since the last garbage collection. All data types count.
6220 Garbage collection happens automatically only when `eval' is called.
6222 By binding this temporarily to a large number, you can effectively
6223 prevent garbage collection during a part of the program.
6224 See also `gc-cons-percentage'. */);
6226 DEFVAR_LISP ("gc-cons-percentage", Vgc_cons_percentage
,
6227 doc
: /* *Portion of the heap used for allocation.
6228 Garbage collection can happen automatically once this portion of the heap
6229 has been allocated since the last garbage collection.
6230 If this portion is smaller than `gc-cons-threshold', this is ignored. */);
6231 Vgc_cons_percentage
= make_float (0.1);
6233 DEFVAR_INT ("pure-bytes-used", pure_bytes_used
,
6234 doc
: /* Number of bytes of sharable Lisp data allocated so far. */);
6236 DEFVAR_INT ("cons-cells-consed", cons_cells_consed
,
6237 doc
: /* Number of cons cells that have been consed so far. */);
6239 DEFVAR_INT ("floats-consed", floats_consed
,
6240 doc
: /* Number of floats that have been consed so far. */);
6242 DEFVAR_INT ("vector-cells-consed", vector_cells_consed
,
6243 doc
: /* Number of vector cells that have been consed so far. */);
6245 DEFVAR_INT ("symbols-consed", symbols_consed
,
6246 doc
: /* Number of symbols that have been consed so far. */);
6248 DEFVAR_INT ("string-chars-consed", string_chars_consed
,
6249 doc
: /* Number of string characters that have been consed so far. */);
6251 DEFVAR_INT ("misc-objects-consed", misc_objects_consed
,
6252 doc
: /* Number of miscellaneous objects that have been consed so far. */);
6254 DEFVAR_INT ("intervals-consed", intervals_consed
,
6255 doc
: /* Number of intervals that have been consed so far. */);
6257 DEFVAR_INT ("strings-consed", strings_consed
,
6258 doc
: /* Number of strings that have been consed so far. */);
6260 DEFVAR_LISP ("purify-flag", Vpurify_flag
,
6261 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
6262 This means that certain objects should be allocated in shared (pure) space.
6263 It can also be set to a hash-table, in which case this table is used to
6264 do hash-consing of the objects allocated to pure space. */);
6266 DEFVAR_BOOL ("garbage-collection-messages", garbage_collection_messages
,
6267 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
6268 garbage_collection_messages
= 0;
6270 DEFVAR_LISP ("post-gc-hook", Vpost_gc_hook
,
6271 doc
: /* Hook run after garbage collection has finished. */);
6272 Vpost_gc_hook
= Qnil
;
6273 Qpost_gc_hook
= intern_c_string ("post-gc-hook");
6274 staticpro (&Qpost_gc_hook
);
6276 DEFVAR_LISP ("memory-signal-data", Vmemory_signal_data
,
6277 doc
: /* Precomputed `signal' argument for memory-full error. */);
6278 /* We build this in advance because if we wait until we need it, we might
6279 not be able to allocate the memory to hold it. */
6281 = pure_cons (Qerror
,
6282 pure_cons (make_pure_c_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"), Qnil
));
6284 DEFVAR_LISP ("memory-full", Vmemory_full
,
6285 doc
: /* Non-nil means Emacs cannot get much more Lisp memory. */);
6286 Vmemory_full
= Qnil
;
6288 staticpro (&Qgc_cons_threshold
);
6289 Qgc_cons_threshold
= intern_c_string ("gc-cons-threshold");
6291 staticpro (&Qchar_table_extra_slots
);
6292 Qchar_table_extra_slots
= intern_c_string ("char-table-extra-slots");
6294 DEFVAR_LISP ("gc-elapsed", Vgc_elapsed
,
6295 doc
: /* Accumulated time elapsed in garbage collections.
6296 The time is in seconds as a floating point value. */);
6297 DEFVAR_INT ("gcs-done", gcs_done
,
6298 doc
: /* Accumulated number of garbage collections done. */);
6303 defsubr (&Smake_byte_code
);
6304 defsubr (&Smake_list
);
6305 defsubr (&Smake_vector
);
6306 defsubr (&Smake_string
);
6307 defsubr (&Smake_bool_vector
);
6308 defsubr (&Smake_symbol
);
6309 defsubr (&Smake_marker
);
6310 defsubr (&Spurecopy
);
6311 defsubr (&Sgarbage_collect
);
6312 defsubr (&Smemory_limit
);
6313 defsubr (&Smemory_use_counts
);
6315 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
6316 defsubr (&Sgc_status
);