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 #ifndef XMALLOC_OVERRUN_CHECK
489 #define XMALLOC_OVERRUN_CHECK_SIZE 0
492 /* Check for overrun in malloc'ed buffers by wrapping a 16 byte header
493 and a 16 byte trailer around each block.
495 The header consists of 12 fixed bytes + a 4 byte integer contaning the
496 original block size, while the trailer consists of 16 fixed bytes.
498 The header is used to detect whether this block has been allocated
499 through these functions -- as it seems that some low-level libc
500 functions may bypass the malloc hooks.
504 #define XMALLOC_OVERRUN_CHECK_SIZE 16
506 static char xmalloc_overrun_check_header
[XMALLOC_OVERRUN_CHECK_SIZE
-4] =
507 { 0x9a, 0x9b, 0xae, 0xaf,
508 0xbf, 0xbe, 0xce, 0xcf,
509 0xea, 0xeb, 0xec, 0xed };
511 static char xmalloc_overrun_check_trailer
[XMALLOC_OVERRUN_CHECK_SIZE
] =
512 { 0xaa, 0xab, 0xac, 0xad,
513 0xba, 0xbb, 0xbc, 0xbd,
514 0xca, 0xcb, 0xcc, 0xcd,
515 0xda, 0xdb, 0xdc, 0xdd };
517 /* Macros to insert and extract the block size in the header. */
519 #define XMALLOC_PUT_SIZE(ptr, size) \
520 (ptr[-1] = (size & 0xff), \
521 ptr[-2] = ((size >> 8) & 0xff), \
522 ptr[-3] = ((size >> 16) & 0xff), \
523 ptr[-4] = ((size >> 24) & 0xff))
525 #define XMALLOC_GET_SIZE(ptr) \
526 (size_t)((unsigned)(ptr[-1]) | \
527 ((unsigned)(ptr[-2]) << 8) | \
528 ((unsigned)(ptr[-3]) << 16) | \
529 ((unsigned)(ptr[-4]) << 24))
532 /* The call depth in overrun_check functions. For example, this might happen:
534 overrun_check_malloc()
535 -> malloc -> (via hook)_-> emacs_blocked_malloc
536 -> overrun_check_malloc
537 call malloc (hooks are NULL, so real malloc is called).
538 malloc returns 10000.
539 add overhead, return 10016.
540 <- (back in overrun_check_malloc)
541 add overhead again, return 10032
542 xmalloc returns 10032.
547 overrun_check_free(10032)
549 free(10016) <- crash, because 10000 is the original pointer. */
551 static int check_depth
;
553 /* Like malloc, but wraps allocated block with header and trailer. */
555 static POINTER_TYPE
*
556 overrun_check_malloc (size_t size
)
558 register unsigned char *val
;
559 size_t overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_SIZE
*2 : 0;
561 val
= (unsigned char *) malloc (size
+ overhead
);
562 if (val
&& check_depth
== 1)
564 memcpy (val
, xmalloc_overrun_check_header
,
565 XMALLOC_OVERRUN_CHECK_SIZE
- 4);
566 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
567 XMALLOC_PUT_SIZE(val
, size
);
568 memcpy (val
+ size
, xmalloc_overrun_check_trailer
,
569 XMALLOC_OVERRUN_CHECK_SIZE
);
572 return (POINTER_TYPE
*)val
;
576 /* Like realloc, but checks old block for overrun, and wraps new block
577 with header and trailer. */
579 static POINTER_TYPE
*
580 overrun_check_realloc (POINTER_TYPE
*block
, size_t size
)
582 register unsigned char *val
= (unsigned char *) block
;
583 size_t overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_SIZE
*2 : 0;
587 && memcmp (xmalloc_overrun_check_header
,
588 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
589 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
591 size_t osize
= XMALLOC_GET_SIZE (val
);
592 if (memcmp (xmalloc_overrun_check_trailer
, val
+ osize
,
593 XMALLOC_OVERRUN_CHECK_SIZE
))
595 memset (val
+ osize
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
596 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
597 memset (val
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
600 val
= (unsigned char *) realloc ((POINTER_TYPE
*)val
, size
+ overhead
);
602 if (val
&& check_depth
== 1)
604 memcpy (val
, xmalloc_overrun_check_header
,
605 XMALLOC_OVERRUN_CHECK_SIZE
- 4);
606 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
607 XMALLOC_PUT_SIZE(val
, size
);
608 memcpy (val
+ size
, xmalloc_overrun_check_trailer
,
609 XMALLOC_OVERRUN_CHECK_SIZE
);
612 return (POINTER_TYPE
*)val
;
615 /* Like free, but checks block for overrun. */
618 overrun_check_free (POINTER_TYPE
*block
)
620 unsigned char *val
= (unsigned char *) block
;
625 && memcmp (xmalloc_overrun_check_header
,
626 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
627 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
629 size_t osize
= XMALLOC_GET_SIZE (val
);
630 if (memcmp (xmalloc_overrun_check_trailer
, val
+ osize
,
631 XMALLOC_OVERRUN_CHECK_SIZE
))
633 #ifdef XMALLOC_CLEAR_FREE_MEMORY
634 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
635 memset (val
, 0xff, osize
+ XMALLOC_OVERRUN_CHECK_SIZE
*2);
637 memset (val
+ osize
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
638 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
639 memset (val
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
650 #define malloc overrun_check_malloc
651 #define realloc overrun_check_realloc
652 #define free overrun_check_free
656 /* When using SYNC_INPUT, we don't call malloc from a signal handler, so
657 there's no need to block input around malloc. */
658 #define MALLOC_BLOCK_INPUT ((void)0)
659 #define MALLOC_UNBLOCK_INPUT ((void)0)
661 #define MALLOC_BLOCK_INPUT BLOCK_INPUT
662 #define MALLOC_UNBLOCK_INPUT UNBLOCK_INPUT
665 /* Like malloc but check for no memory and block interrupt input.. */
668 xmalloc (size_t size
)
670 register POINTER_TYPE
*val
;
673 val
= (POINTER_TYPE
*) malloc (size
);
674 MALLOC_UNBLOCK_INPUT
;
682 /* Like realloc but check for no memory and block interrupt input.. */
685 xrealloc (POINTER_TYPE
*block
, size_t size
)
687 register POINTER_TYPE
*val
;
690 /* We must call malloc explicitly when BLOCK is 0, since some
691 reallocs don't do this. */
693 val
= (POINTER_TYPE
*) malloc (size
);
695 val
= (POINTER_TYPE
*) realloc (block
, size
);
696 MALLOC_UNBLOCK_INPUT
;
704 /* Like free but block interrupt input. */
707 xfree (POINTER_TYPE
*block
)
713 MALLOC_UNBLOCK_INPUT
;
714 /* We don't call refill_memory_reserve here
715 because that duplicates doing so in emacs_blocked_free
716 and the criterion should go there. */
720 /* Like strdup, but uses xmalloc. */
723 xstrdup (const char *s
)
725 size_t len
= strlen (s
) + 1;
726 char *p
= (char *) xmalloc (len
);
732 /* Unwind for SAFE_ALLOCA */
735 safe_alloca_unwind (Lisp_Object arg
)
737 register struct Lisp_Save_Value
*p
= XSAVE_VALUE (arg
);
747 /* Like malloc but used for allocating Lisp data. NBYTES is the
748 number of bytes to allocate, TYPE describes the intended use of the
749 allcated memory block (for strings, for conses, ...). */
752 static void *lisp_malloc_loser
;
755 static POINTER_TYPE
*
756 lisp_malloc (size_t nbytes
, enum mem_type type
)
762 #ifdef GC_MALLOC_CHECK
763 allocated_mem_type
= type
;
766 val
= (void *) malloc (nbytes
);
769 /* If the memory just allocated cannot be addressed thru a Lisp
770 object's pointer, and it needs to be,
771 that's equivalent to running out of memory. */
772 if (val
&& type
!= MEM_TYPE_NON_LISP
)
775 XSETCONS (tem
, (char *) val
+ nbytes
- 1);
776 if ((char *) XCONS (tem
) != (char *) val
+ nbytes
- 1)
778 lisp_malloc_loser
= val
;
785 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
786 if (val
&& type
!= MEM_TYPE_NON_LISP
)
787 mem_insert (val
, (char *) val
+ nbytes
, type
);
790 MALLOC_UNBLOCK_INPUT
;
792 memory_full (nbytes
);
796 /* Free BLOCK. This must be called to free memory allocated with a
797 call to lisp_malloc. */
800 lisp_free (POINTER_TYPE
*block
)
804 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
805 mem_delete (mem_find (block
));
807 MALLOC_UNBLOCK_INPUT
;
810 /* Allocation of aligned blocks of memory to store Lisp data. */
811 /* The entry point is lisp_align_malloc which returns blocks of at most */
812 /* BLOCK_BYTES and guarantees they are aligned on a BLOCK_ALIGN boundary. */
814 /* Use posix_memalloc if the system has it and we're using the system's
815 malloc (because our gmalloc.c routines don't have posix_memalign although
816 its memalloc could be used). */
817 #if defined (HAVE_POSIX_MEMALIGN) && defined (SYSTEM_MALLOC)
818 #define USE_POSIX_MEMALIGN 1
821 /* BLOCK_ALIGN has to be a power of 2. */
822 #define BLOCK_ALIGN (1 << 10)
824 /* Padding to leave at the end of a malloc'd block. This is to give
825 malloc a chance to minimize the amount of memory wasted to alignment.
826 It should be tuned to the particular malloc library used.
827 On glibc-2.3.2, malloc never tries to align, so a padding of 0 is best.
828 posix_memalign on the other hand would ideally prefer a value of 4
829 because otherwise, there's 1020 bytes wasted between each ablocks.
830 In Emacs, testing shows that those 1020 can most of the time be
831 efficiently used by malloc to place other objects, so a value of 0 can
832 still preferable unless you have a lot of aligned blocks and virtually
834 #define BLOCK_PADDING 0
835 #define BLOCK_BYTES \
836 (BLOCK_ALIGN - sizeof (struct ablocks *) - BLOCK_PADDING)
838 /* Internal data structures and constants. */
840 #define ABLOCKS_SIZE 16
842 /* An aligned block of memory. */
847 char payload
[BLOCK_BYTES
];
848 struct ablock
*next_free
;
850 /* `abase' is the aligned base of the ablocks. */
851 /* It is overloaded to hold the virtual `busy' field that counts
852 the number of used ablock in the parent ablocks.
853 The first ablock has the `busy' field, the others have the `abase'
854 field. To tell the difference, we assume that pointers will have
855 integer values larger than 2 * ABLOCKS_SIZE. The lowest bit of `busy'
856 is used to tell whether the real base of the parent ablocks is `abase'
857 (if not, the word before the first ablock holds a pointer to the
859 struct ablocks
*abase
;
860 /* The padding of all but the last ablock is unused. The padding of
861 the last ablock in an ablocks is not allocated. */
863 char padding
[BLOCK_PADDING
];
867 /* A bunch of consecutive aligned blocks. */
870 struct ablock blocks
[ABLOCKS_SIZE
];
873 /* Size of the block requested from malloc or memalign. */
874 #define ABLOCKS_BYTES (sizeof (struct ablocks) - BLOCK_PADDING)
876 #define ABLOCK_ABASE(block) \
877 (((uintptr_t) (block)->abase) <= (1 + 2 * ABLOCKS_SIZE) \
878 ? (struct ablocks *)(block) \
881 /* Virtual `busy' field. */
882 #define ABLOCKS_BUSY(abase) ((abase)->blocks[0].abase)
884 /* Pointer to the (not necessarily aligned) malloc block. */
885 #ifdef USE_POSIX_MEMALIGN
886 #define ABLOCKS_BASE(abase) (abase)
888 #define ABLOCKS_BASE(abase) \
889 (1 & (intptr_t) ABLOCKS_BUSY (abase) ? abase : ((void**)abase)[-1])
892 /* The list of free ablock. */
893 static struct ablock
*free_ablock
;
895 /* Allocate an aligned block of nbytes.
896 Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be
897 smaller or equal to BLOCK_BYTES. */
898 static POINTER_TYPE
*
899 lisp_align_malloc (size_t nbytes
, enum mem_type type
)
902 struct ablocks
*abase
;
904 eassert (nbytes
<= BLOCK_BYTES
);
908 #ifdef GC_MALLOC_CHECK
909 allocated_mem_type
= type
;
915 intptr_t aligned
; /* int gets warning casting to 64-bit pointer. */
917 #ifdef DOUG_LEA_MALLOC
918 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
919 because mapped region contents are not preserved in
921 mallopt (M_MMAP_MAX
, 0);
924 #ifdef USE_POSIX_MEMALIGN
926 int err
= posix_memalign (&base
, BLOCK_ALIGN
, ABLOCKS_BYTES
);
932 base
= malloc (ABLOCKS_BYTES
);
933 abase
= ALIGN (base
, BLOCK_ALIGN
);
938 MALLOC_UNBLOCK_INPUT
;
939 memory_full (ABLOCKS_BYTES
);
942 aligned
= (base
== abase
);
944 ((void**)abase
)[-1] = base
;
946 #ifdef DOUG_LEA_MALLOC
947 /* Back to a reasonable maximum of mmap'ed areas. */
948 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
952 /* If the memory just allocated cannot be addressed thru a Lisp
953 object's pointer, and it needs to be, that's equivalent to
954 running out of memory. */
955 if (type
!= MEM_TYPE_NON_LISP
)
958 char *end
= (char *) base
+ ABLOCKS_BYTES
- 1;
960 if ((char *) XCONS (tem
) != end
)
962 lisp_malloc_loser
= base
;
964 MALLOC_UNBLOCK_INPUT
;
965 memory_full (SIZE_MAX
);
970 /* Initialize the blocks and put them on the free list.
971 Is `base' was not properly aligned, we can't use the last block. */
972 for (i
= 0; i
< (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1); i
++)
974 abase
->blocks
[i
].abase
= abase
;
975 abase
->blocks
[i
].x
.next_free
= free_ablock
;
976 free_ablock
= &abase
->blocks
[i
];
978 ABLOCKS_BUSY (abase
) = (struct ablocks
*) aligned
;
980 eassert (0 == ((uintptr_t) abase
) % BLOCK_ALIGN
);
981 eassert (ABLOCK_ABASE (&abase
->blocks
[3]) == abase
); /* 3 is arbitrary */
982 eassert (ABLOCK_ABASE (&abase
->blocks
[0]) == abase
);
983 eassert (ABLOCKS_BASE (abase
) == base
);
984 eassert (aligned
== (intptr_t) ABLOCKS_BUSY (abase
));
987 abase
= ABLOCK_ABASE (free_ablock
);
988 ABLOCKS_BUSY (abase
) =
989 (struct ablocks
*) (2 + (intptr_t) ABLOCKS_BUSY (abase
));
991 free_ablock
= free_ablock
->x
.next_free
;
993 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
994 if (type
!= MEM_TYPE_NON_LISP
)
995 mem_insert (val
, (char *) val
+ nbytes
, type
);
998 MALLOC_UNBLOCK_INPUT
;
1000 eassert (0 == ((uintptr_t) val
) % BLOCK_ALIGN
);
1005 lisp_align_free (POINTER_TYPE
*block
)
1007 struct ablock
*ablock
= block
;
1008 struct ablocks
*abase
= ABLOCK_ABASE (ablock
);
1011 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1012 mem_delete (mem_find (block
));
1014 /* Put on free list. */
1015 ablock
->x
.next_free
= free_ablock
;
1016 free_ablock
= ablock
;
1017 /* Update busy count. */
1018 ABLOCKS_BUSY (abase
) =
1019 (struct ablocks
*) (-2 + (intptr_t) ABLOCKS_BUSY (abase
));
1021 if (2 > (intptr_t) ABLOCKS_BUSY (abase
))
1022 { /* All the blocks are free. */
1023 int i
= 0, aligned
= (intptr_t) ABLOCKS_BUSY (abase
);
1024 struct ablock
**tem
= &free_ablock
;
1025 struct ablock
*atop
= &abase
->blocks
[aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1];
1029 if (*tem
>= (struct ablock
*) abase
&& *tem
< atop
)
1032 *tem
= (*tem
)->x
.next_free
;
1035 tem
= &(*tem
)->x
.next_free
;
1037 eassert ((aligned
& 1) == aligned
);
1038 eassert (i
== (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1));
1039 #ifdef USE_POSIX_MEMALIGN
1040 eassert ((uintptr_t) ABLOCKS_BASE (abase
) % BLOCK_ALIGN
== 0);
1042 free (ABLOCKS_BASE (abase
));
1044 MALLOC_UNBLOCK_INPUT
;
1047 /* Return a new buffer structure allocated from the heap with
1048 a call to lisp_malloc. */
1051 allocate_buffer (void)
1054 = (struct buffer
*) lisp_malloc (sizeof (struct buffer
),
1056 XSETPVECTYPESIZE (b
, PVEC_BUFFER
,
1057 ((sizeof (struct buffer
) + sizeof (EMACS_INT
) - 1)
1058 / sizeof (EMACS_INT
)));
1063 #ifndef SYSTEM_MALLOC
1065 /* Arranging to disable input signals while we're in malloc.
1067 This only works with GNU malloc. To help out systems which can't
1068 use GNU malloc, all the calls to malloc, realloc, and free
1069 elsewhere in the code should be inside a BLOCK_INPUT/UNBLOCK_INPUT
1070 pair; unfortunately, we have no idea what C library functions
1071 might call malloc, so we can't really protect them unless you're
1072 using GNU malloc. Fortunately, most of the major operating systems
1073 can use GNU malloc. */
1076 /* When using SYNC_INPUT, we don't call malloc from a signal handler, so
1077 there's no need to block input around malloc. */
1079 #ifndef DOUG_LEA_MALLOC
1080 extern void * (*__malloc_hook
) (size_t, const void *);
1081 extern void * (*__realloc_hook
) (void *, size_t, const void *);
1082 extern void (*__free_hook
) (void *, const void *);
1083 /* Else declared in malloc.h, perhaps with an extra arg. */
1084 #endif /* DOUG_LEA_MALLOC */
1085 static void * (*old_malloc_hook
) (size_t, const void *);
1086 static void * (*old_realloc_hook
) (void *, size_t, const void*);
1087 static void (*old_free_hook
) (void*, const void*);
1089 #ifdef DOUG_LEA_MALLOC
1090 # define BYTES_USED (mallinfo ().uordblks)
1092 # define BYTES_USED _bytes_used
1095 static __malloc_size_t bytes_used_when_reconsidered
;
1097 /* Value of _bytes_used, when spare_memory was freed. */
1099 static __malloc_size_t bytes_used_when_full
;
1101 /* This function is used as the hook for free to call. */
1104 emacs_blocked_free (void *ptr
, const void *ptr2
)
1108 #ifdef GC_MALLOC_CHECK
1114 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1117 "Freeing `%p' which wasn't allocated with malloc\n", ptr
);
1122 /* fprintf (stderr, "free %p...%p (%p)\n", m->start, m->end, ptr); */
1126 #endif /* GC_MALLOC_CHECK */
1128 __free_hook
= old_free_hook
;
1131 /* If we released our reserve (due to running out of memory),
1132 and we have a fair amount free once again,
1133 try to set aside another reserve in case we run out once more. */
1134 if (! NILP (Vmemory_full
)
1135 /* Verify there is enough space that even with the malloc
1136 hysteresis this call won't run out again.
1137 The code here is correct as long as SPARE_MEMORY
1138 is substantially larger than the block size malloc uses. */
1139 && (bytes_used_when_full
1140 > ((bytes_used_when_reconsidered
= BYTES_USED
)
1141 + max (malloc_hysteresis
, 4) * SPARE_MEMORY
)))
1142 refill_memory_reserve ();
1144 __free_hook
= emacs_blocked_free
;
1145 UNBLOCK_INPUT_ALLOC
;
1149 /* This function is the malloc hook that Emacs uses. */
1152 emacs_blocked_malloc (size_t size
, const void *ptr
)
1157 __malloc_hook
= old_malloc_hook
;
1158 #ifdef DOUG_LEA_MALLOC
1159 /* Segfaults on my system. --lorentey */
1160 /* mallopt (M_TOP_PAD, malloc_hysteresis * 4096); */
1162 __malloc_extra_blocks
= malloc_hysteresis
;
1165 value
= (void *) malloc (size
);
1167 #ifdef GC_MALLOC_CHECK
1169 struct mem_node
*m
= mem_find (value
);
1172 fprintf (stderr
, "Malloc returned %p which is already in use\n",
1174 fprintf (stderr
, "Region in use is %p...%p, %u bytes, type %d\n",
1175 m
->start
, m
->end
, (char *) m
->end
- (char *) m
->start
,
1180 if (!dont_register_blocks
)
1182 mem_insert (value
, (char *) value
+ max (1, size
), allocated_mem_type
);
1183 allocated_mem_type
= MEM_TYPE_NON_LISP
;
1186 #endif /* GC_MALLOC_CHECK */
1188 __malloc_hook
= emacs_blocked_malloc
;
1189 UNBLOCK_INPUT_ALLOC
;
1191 /* fprintf (stderr, "%p malloc\n", value); */
1196 /* This function is the realloc hook that Emacs uses. */
1199 emacs_blocked_realloc (void *ptr
, size_t size
, const void *ptr2
)
1204 __realloc_hook
= old_realloc_hook
;
1206 #ifdef GC_MALLOC_CHECK
1209 struct mem_node
*m
= mem_find (ptr
);
1210 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1213 "Realloc of %p which wasn't allocated with malloc\n",
1221 /* fprintf (stderr, "%p -> realloc\n", ptr); */
1223 /* Prevent malloc from registering blocks. */
1224 dont_register_blocks
= 1;
1225 #endif /* GC_MALLOC_CHECK */
1227 value
= (void *) realloc (ptr
, size
);
1229 #ifdef GC_MALLOC_CHECK
1230 dont_register_blocks
= 0;
1233 struct mem_node
*m
= mem_find (value
);
1236 fprintf (stderr
, "Realloc returns memory that is already in use\n");
1240 /* Can't handle zero size regions in the red-black tree. */
1241 mem_insert (value
, (char *) value
+ max (size
, 1), MEM_TYPE_NON_LISP
);
1244 /* fprintf (stderr, "%p <- realloc\n", value); */
1245 #endif /* GC_MALLOC_CHECK */
1247 __realloc_hook
= emacs_blocked_realloc
;
1248 UNBLOCK_INPUT_ALLOC
;
1254 #ifdef HAVE_GTK_AND_PTHREAD
1255 /* Called from Fdump_emacs so that when the dumped Emacs starts, it has a
1256 normal malloc. Some thread implementations need this as they call
1257 malloc before main. The pthread_self call in BLOCK_INPUT_ALLOC then
1258 calls malloc because it is the first call, and we have an endless loop. */
1261 reset_malloc_hooks ()
1263 __free_hook
= old_free_hook
;
1264 __malloc_hook
= old_malloc_hook
;
1265 __realloc_hook
= old_realloc_hook
;
1267 #endif /* HAVE_GTK_AND_PTHREAD */
1270 /* Called from main to set up malloc to use our hooks. */
1273 uninterrupt_malloc (void)
1275 #ifdef HAVE_GTK_AND_PTHREAD
1276 #ifdef DOUG_LEA_MALLOC
1277 pthread_mutexattr_t attr
;
1279 /* GLIBC has a faster way to do this, but lets keep it portable.
1280 This is according to the Single UNIX Specification. */
1281 pthread_mutexattr_init (&attr
);
1282 pthread_mutexattr_settype (&attr
, PTHREAD_MUTEX_RECURSIVE
);
1283 pthread_mutex_init (&alloc_mutex
, &attr
);
1284 #else /* !DOUG_LEA_MALLOC */
1285 /* Some systems such as Solaris 2.6 don't have a recursive mutex,
1286 and the bundled gmalloc.c doesn't require it. */
1287 pthread_mutex_init (&alloc_mutex
, NULL
);
1288 #endif /* !DOUG_LEA_MALLOC */
1289 #endif /* HAVE_GTK_AND_PTHREAD */
1291 if (__free_hook
!= emacs_blocked_free
)
1292 old_free_hook
= __free_hook
;
1293 __free_hook
= emacs_blocked_free
;
1295 if (__malloc_hook
!= emacs_blocked_malloc
)
1296 old_malloc_hook
= __malloc_hook
;
1297 __malloc_hook
= emacs_blocked_malloc
;
1299 if (__realloc_hook
!= emacs_blocked_realloc
)
1300 old_realloc_hook
= __realloc_hook
;
1301 __realloc_hook
= emacs_blocked_realloc
;
1304 #endif /* not SYNC_INPUT */
1305 #endif /* not SYSTEM_MALLOC */
1309 /***********************************************************************
1311 ***********************************************************************/
1313 /* Number of intervals allocated in an interval_block structure.
1314 The 1020 is 1024 minus malloc overhead. */
1316 #define INTERVAL_BLOCK_SIZE \
1317 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
1319 /* Intervals are allocated in chunks in form of an interval_block
1322 struct interval_block
1324 /* Place `intervals' first, to preserve alignment. */
1325 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
1326 struct interval_block
*next
;
1329 /* Current interval block. Its `next' pointer points to older
1332 static struct interval_block
*interval_block
;
1334 /* Index in interval_block above of the next unused interval
1337 static int interval_block_index
;
1339 /* Number of free and live intervals. */
1341 static int total_free_intervals
, total_intervals
;
1343 /* List of free intervals. */
1345 static INTERVAL interval_free_list
;
1347 /* Total number of interval blocks now in use. */
1349 static int n_interval_blocks
;
1352 /* Initialize interval allocation. */
1355 init_intervals (void)
1357 interval_block
= NULL
;
1358 interval_block_index
= INTERVAL_BLOCK_SIZE
;
1359 interval_free_list
= 0;
1360 n_interval_blocks
= 0;
1364 /* Return a new interval. */
1367 make_interval (void)
1371 /* eassert (!handling_signal); */
1375 if (interval_free_list
)
1377 val
= interval_free_list
;
1378 interval_free_list
= INTERVAL_PARENT (interval_free_list
);
1382 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
1384 register struct interval_block
*newi
;
1386 newi
= (struct interval_block
*) lisp_malloc (sizeof *newi
,
1389 newi
->next
= interval_block
;
1390 interval_block
= newi
;
1391 interval_block_index
= 0;
1392 n_interval_blocks
++;
1394 val
= &interval_block
->intervals
[interval_block_index
++];
1397 MALLOC_UNBLOCK_INPUT
;
1399 consing_since_gc
+= sizeof (struct interval
);
1401 RESET_INTERVAL (val
);
1407 /* Mark Lisp objects in interval I. */
1410 mark_interval (register INTERVAL i
, Lisp_Object dummy
)
1412 eassert (!i
->gcmarkbit
); /* Intervals are never shared. */
1414 mark_object (i
->plist
);
1418 /* Mark the interval tree rooted in TREE. Don't call this directly;
1419 use the macro MARK_INTERVAL_TREE instead. */
1422 mark_interval_tree (register INTERVAL tree
)
1424 /* No need to test if this tree has been marked already; this
1425 function is always called through the MARK_INTERVAL_TREE macro,
1426 which takes care of that. */
1428 traverse_intervals_noorder (tree
, mark_interval
, Qnil
);
1432 /* Mark the interval tree rooted in I. */
1434 #define MARK_INTERVAL_TREE(i) \
1436 if (!NULL_INTERVAL_P (i) && !i->gcmarkbit) \
1437 mark_interval_tree (i); \
1441 #define UNMARK_BALANCE_INTERVALS(i) \
1443 if (! NULL_INTERVAL_P (i)) \
1444 (i) = balance_intervals (i); \
1448 /* Number support. If USE_LISP_UNION_TYPE is in effect, we
1449 can't create number objects in macros. */
1452 make_number (EMACS_INT n
)
1456 obj
.s
.type
= Lisp_Int
;
1461 /***********************************************************************
1463 ***********************************************************************/
1465 /* Lisp_Strings are allocated in string_block structures. When a new
1466 string_block is allocated, all the Lisp_Strings it contains are
1467 added to a free-list string_free_list. When a new Lisp_String is
1468 needed, it is taken from that list. During the sweep phase of GC,
1469 string_blocks that are entirely free are freed, except two which
1472 String data is allocated from sblock structures. Strings larger
1473 than LARGE_STRING_BYTES, get their own sblock, data for smaller
1474 strings is sub-allocated out of sblocks of size SBLOCK_SIZE.
1476 Sblocks consist internally of sdata structures, one for each
1477 Lisp_String. The sdata structure points to the Lisp_String it
1478 belongs to. The Lisp_String points back to the `u.data' member of
1479 its sdata structure.
1481 When a Lisp_String is freed during GC, it is put back on
1482 string_free_list, and its `data' member and its sdata's `string'
1483 pointer is set to null. The size of the string is recorded in the
1484 `u.nbytes' member of the sdata. So, sdata structures that are no
1485 longer used, can be easily recognized, and it's easy to compact the
1486 sblocks of small strings which we do in compact_small_strings. */
1488 /* Size in bytes of an sblock structure used for small strings. This
1489 is 8192 minus malloc overhead. */
1491 #define SBLOCK_SIZE 8188
1493 /* Strings larger than this are considered large strings. String data
1494 for large strings is allocated from individual sblocks. */
1496 #define LARGE_STRING_BYTES 1024
1498 /* Structure describing string memory sub-allocated from an sblock.
1499 This is where the contents of Lisp strings are stored. */
1503 /* Back-pointer to the string this sdata belongs to. If null, this
1504 structure is free, and the NBYTES member of the union below
1505 contains the string's byte size (the same value that STRING_BYTES
1506 would return if STRING were non-null). If non-null, STRING_BYTES
1507 (STRING) is the size of the data, and DATA contains the string's
1509 struct Lisp_String
*string
;
1511 #ifdef GC_CHECK_STRING_BYTES
1514 unsigned char data
[1];
1516 #define SDATA_NBYTES(S) (S)->nbytes
1517 #define SDATA_DATA(S) (S)->data
1518 #define SDATA_SELECTOR(member) member
1520 #else /* not GC_CHECK_STRING_BYTES */
1524 /* When STRING is non-null. */
1525 unsigned char data
[1];
1527 /* When STRING is null. */
1531 #define SDATA_NBYTES(S) (S)->u.nbytes
1532 #define SDATA_DATA(S) (S)->u.data
1533 #define SDATA_SELECTOR(member) u.member
1535 #endif /* not GC_CHECK_STRING_BYTES */
1537 #define SDATA_DATA_OFFSET offsetof (struct sdata, SDATA_SELECTOR (data))
1541 /* Structure describing a block of memory which is sub-allocated to
1542 obtain string data memory for strings. Blocks for small strings
1543 are of fixed size SBLOCK_SIZE. Blocks for large strings are made
1544 as large as needed. */
1549 struct sblock
*next
;
1551 /* Pointer to the next free sdata block. This points past the end
1552 of the sblock if there isn't any space left in this block. */
1553 struct sdata
*next_free
;
1555 /* Start of data. */
1556 struct sdata first_data
;
1559 /* Number of Lisp strings in a string_block structure. The 1020 is
1560 1024 minus malloc overhead. */
1562 #define STRING_BLOCK_SIZE \
1563 ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String))
1565 /* Structure describing a block from which Lisp_String structures
1570 /* Place `strings' first, to preserve alignment. */
1571 struct Lisp_String strings
[STRING_BLOCK_SIZE
];
1572 struct string_block
*next
;
1575 /* Head and tail of the list of sblock structures holding Lisp string
1576 data. We always allocate from current_sblock. The NEXT pointers
1577 in the sblock structures go from oldest_sblock to current_sblock. */
1579 static struct sblock
*oldest_sblock
, *current_sblock
;
1581 /* List of sblocks for large strings. */
1583 static struct sblock
*large_sblocks
;
1585 /* List of string_block structures, and how many there are. */
1587 static struct string_block
*string_blocks
;
1588 static int n_string_blocks
;
1590 /* Free-list of Lisp_Strings. */
1592 static struct Lisp_String
*string_free_list
;
1594 /* Number of live and free Lisp_Strings. */
1596 static int total_strings
, total_free_strings
;
1598 /* Number of bytes used by live strings. */
1600 static EMACS_INT total_string_size
;
1602 /* Given a pointer to a Lisp_String S which is on the free-list
1603 string_free_list, return a pointer to its successor in the
1606 #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S))
1608 /* Return a pointer to the sdata structure belonging to Lisp string S.
1609 S must be live, i.e. S->data must not be null. S->data is actually
1610 a pointer to the `u.data' member of its sdata structure; the
1611 structure starts at a constant offset in front of that. */
1613 #define SDATA_OF_STRING(S) ((struct sdata *) ((S)->data - SDATA_DATA_OFFSET))
1616 #ifdef GC_CHECK_STRING_OVERRUN
1618 /* We check for overrun in string data blocks by appending a small
1619 "cookie" after each allocated string data block, and check for the
1620 presence of this cookie during GC. */
1622 #define GC_STRING_OVERRUN_COOKIE_SIZE 4
1623 static char const string_overrun_cookie
[GC_STRING_OVERRUN_COOKIE_SIZE
] =
1624 { '\xde', '\xad', '\xbe', '\xef' };
1627 #define GC_STRING_OVERRUN_COOKIE_SIZE 0
1630 /* Value is the size of an sdata structure large enough to hold NBYTES
1631 bytes of string data. The value returned includes a terminating
1632 NUL byte, the size of the sdata structure, and padding. */
1634 #ifdef GC_CHECK_STRING_BYTES
1636 #define SDATA_SIZE(NBYTES) \
1637 ((SDATA_DATA_OFFSET \
1639 + sizeof (EMACS_INT) - 1) \
1640 & ~(sizeof (EMACS_INT) - 1))
1642 #else /* not GC_CHECK_STRING_BYTES */
1644 /* The 'max' reserves space for the nbytes union member even when NBYTES + 1 is
1645 less than the size of that member. The 'max' is not needed when
1646 SDATA_DATA_OFFSET is a multiple of sizeof (EMACS_INT), because then the
1647 alignment code reserves enough space. */
1649 #define SDATA_SIZE(NBYTES) \
1650 ((SDATA_DATA_OFFSET \
1651 + (SDATA_DATA_OFFSET % sizeof (EMACS_INT) == 0 \
1653 : max (NBYTES, sizeof (EMACS_INT) - 1)) \
1655 + sizeof (EMACS_INT) - 1) \
1656 & ~(sizeof (EMACS_INT) - 1))
1658 #endif /* not GC_CHECK_STRING_BYTES */
1660 /* Extra bytes to allocate for each string. */
1662 #define GC_STRING_EXTRA (GC_STRING_OVERRUN_COOKIE_SIZE)
1664 /* Exact bound on the number of bytes in a string, not counting the
1665 terminating null. A string cannot contain more bytes than
1666 STRING_BYTES_BOUND, nor can it be so long that the size_t
1667 arithmetic in allocate_string_data would overflow while it is
1668 calculating a value to be passed to malloc. */
1669 #define STRING_BYTES_MAX \
1670 min (STRING_BYTES_BOUND, \
1671 ((SIZE_MAX - XMALLOC_OVERRUN_CHECK_SIZE - GC_STRING_EXTRA \
1672 - offsetof (struct sblock, first_data) \
1673 - SDATA_DATA_OFFSET) \
1674 & ~(sizeof (EMACS_INT) - 1)))
1676 /* Initialize string allocation. Called from init_alloc_once. */
1681 total_strings
= total_free_strings
= total_string_size
= 0;
1682 oldest_sblock
= current_sblock
= large_sblocks
= NULL
;
1683 string_blocks
= NULL
;
1684 n_string_blocks
= 0;
1685 string_free_list
= NULL
;
1686 empty_unibyte_string
= make_pure_string ("", 0, 0, 0);
1687 empty_multibyte_string
= make_pure_string ("", 0, 0, 1);
1691 #ifdef GC_CHECK_STRING_BYTES
1693 static int check_string_bytes_count
;
1695 #define CHECK_STRING_BYTES(S) STRING_BYTES (S)
1698 /* Like GC_STRING_BYTES, but with debugging check. */
1701 string_bytes (struct Lisp_String
*s
)
1704 (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1706 if (!PURE_POINTER_P (s
)
1708 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1713 /* Check validity of Lisp strings' string_bytes member in B. */
1716 check_sblock (struct sblock
*b
)
1718 struct sdata
*from
, *end
, *from_end
;
1722 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1724 /* Compute the next FROM here because copying below may
1725 overwrite data we need to compute it. */
1728 /* Check that the string size recorded in the string is the
1729 same as the one recorded in the sdata structure. */
1731 CHECK_STRING_BYTES (from
->string
);
1734 nbytes
= GC_STRING_BYTES (from
->string
);
1736 nbytes
= SDATA_NBYTES (from
);
1738 nbytes
= SDATA_SIZE (nbytes
);
1739 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
1744 /* Check validity of Lisp strings' string_bytes member. ALL_P
1745 non-zero means check all strings, otherwise check only most
1746 recently allocated strings. Used for hunting a bug. */
1749 check_string_bytes (int all_p
)
1755 for (b
= large_sblocks
; b
; b
= b
->next
)
1757 struct Lisp_String
*s
= b
->first_data
.string
;
1759 CHECK_STRING_BYTES (s
);
1762 for (b
= oldest_sblock
; b
; b
= b
->next
)
1766 check_sblock (current_sblock
);
1769 #endif /* GC_CHECK_STRING_BYTES */
1771 #ifdef GC_CHECK_STRING_FREE_LIST
1773 /* Walk through the string free list looking for bogus next pointers.
1774 This may catch buffer overrun from a previous string. */
1777 check_string_free_list (void)
1779 struct Lisp_String
*s
;
1781 /* Pop a Lisp_String off the free-list. */
1782 s
= string_free_list
;
1785 if ((uintptr_t) s
< 1024)
1787 s
= NEXT_FREE_LISP_STRING (s
);
1791 #define check_string_free_list()
1794 /* Return a new Lisp_String. */
1796 static struct Lisp_String
*
1797 allocate_string (void)
1799 struct Lisp_String
*s
;
1801 /* eassert (!handling_signal); */
1805 /* If the free-list is empty, allocate a new string_block, and
1806 add all the Lisp_Strings in it to the free-list. */
1807 if (string_free_list
== NULL
)
1809 struct string_block
*b
;
1812 b
= (struct string_block
*) lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1813 memset (b
, 0, sizeof *b
);
1814 b
->next
= string_blocks
;
1818 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1821 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1822 string_free_list
= s
;
1825 total_free_strings
+= STRING_BLOCK_SIZE
;
1828 check_string_free_list ();
1830 /* Pop a Lisp_String off the free-list. */
1831 s
= string_free_list
;
1832 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1834 MALLOC_UNBLOCK_INPUT
;
1836 /* Probably not strictly necessary, but play it safe. */
1837 memset (s
, 0, sizeof *s
);
1839 --total_free_strings
;
1842 consing_since_gc
+= sizeof *s
;
1844 #ifdef GC_CHECK_STRING_BYTES
1845 if (!noninteractive
)
1847 if (++check_string_bytes_count
== 200)
1849 check_string_bytes_count
= 0;
1850 check_string_bytes (1);
1853 check_string_bytes (0);
1855 #endif /* GC_CHECK_STRING_BYTES */
1861 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1862 plus a NUL byte at the end. Allocate an sdata structure for S, and
1863 set S->data to its `u.data' member. Store a NUL byte at the end of
1864 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1865 S->data if it was initially non-null. */
1868 allocate_string_data (struct Lisp_String
*s
,
1869 EMACS_INT nchars
, EMACS_INT nbytes
)
1871 struct sdata
*data
, *old_data
;
1873 EMACS_INT needed
, old_nbytes
;
1875 if (STRING_BYTES_MAX
< nbytes
)
1878 /* Determine the number of bytes needed to store NBYTES bytes
1880 needed
= SDATA_SIZE (nbytes
);
1881 old_data
= s
->data
? SDATA_OF_STRING (s
) : NULL
;
1882 old_nbytes
= GC_STRING_BYTES (s
);
1886 if (nbytes
> LARGE_STRING_BYTES
)
1888 size_t size
= offsetof (struct sblock
, first_data
) + needed
;
1890 #ifdef DOUG_LEA_MALLOC
1891 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1892 because mapped region contents are not preserved in
1895 In case you think of allowing it in a dumped Emacs at the
1896 cost of not being able to re-dump, there's another reason:
1897 mmap'ed data typically have an address towards the top of the
1898 address space, which won't fit into an EMACS_INT (at least on
1899 32-bit systems with the current tagging scheme). --fx */
1900 mallopt (M_MMAP_MAX
, 0);
1903 b
= (struct sblock
*) lisp_malloc (size
+ GC_STRING_EXTRA
, MEM_TYPE_NON_LISP
);
1905 #ifdef DOUG_LEA_MALLOC
1906 /* Back to a reasonable maximum of mmap'ed areas. */
1907 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1910 b
->next_free
= &b
->first_data
;
1911 b
->first_data
.string
= NULL
;
1912 b
->next
= large_sblocks
;
1915 else if (current_sblock
== NULL
1916 || (((char *) current_sblock
+ SBLOCK_SIZE
1917 - (char *) current_sblock
->next_free
)
1918 < (needed
+ GC_STRING_EXTRA
)))
1920 /* Not enough room in the current sblock. */
1921 b
= (struct sblock
*) lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
1922 b
->next_free
= &b
->first_data
;
1923 b
->first_data
.string
= NULL
;
1927 current_sblock
->next
= b
;
1935 data
= b
->next_free
;
1936 b
->next_free
= (struct sdata
*) ((char *) data
+ needed
+ GC_STRING_EXTRA
);
1938 MALLOC_UNBLOCK_INPUT
;
1941 s
->data
= SDATA_DATA (data
);
1942 #ifdef GC_CHECK_STRING_BYTES
1943 SDATA_NBYTES (data
) = nbytes
;
1946 s
->size_byte
= nbytes
;
1947 s
->data
[nbytes
] = '\0';
1948 #ifdef GC_CHECK_STRING_OVERRUN
1949 memcpy ((char *) data
+ needed
, string_overrun_cookie
,
1950 GC_STRING_OVERRUN_COOKIE_SIZE
);
1953 /* If S had already data assigned, mark that as free by setting its
1954 string back-pointer to null, and recording the size of the data
1958 SDATA_NBYTES (old_data
) = old_nbytes
;
1959 old_data
->string
= NULL
;
1962 consing_since_gc
+= needed
;
1966 /* Sweep and compact strings. */
1969 sweep_strings (void)
1971 struct string_block
*b
, *next
;
1972 struct string_block
*live_blocks
= NULL
;
1974 string_free_list
= NULL
;
1975 total_strings
= total_free_strings
= 0;
1976 total_string_size
= 0;
1978 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
1979 for (b
= string_blocks
; b
; b
= next
)
1982 struct Lisp_String
*free_list_before
= string_free_list
;
1986 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
1988 struct Lisp_String
*s
= b
->strings
+ i
;
1992 /* String was not on free-list before. */
1993 if (STRING_MARKED_P (s
))
1995 /* String is live; unmark it and its intervals. */
1998 if (!NULL_INTERVAL_P (s
->intervals
))
1999 UNMARK_BALANCE_INTERVALS (s
->intervals
);
2002 total_string_size
+= STRING_BYTES (s
);
2006 /* String is dead. Put it on the free-list. */
2007 struct sdata
*data
= SDATA_OF_STRING (s
);
2009 /* Save the size of S in its sdata so that we know
2010 how large that is. Reset the sdata's string
2011 back-pointer so that we know it's free. */
2012 #ifdef GC_CHECK_STRING_BYTES
2013 if (GC_STRING_BYTES (s
) != SDATA_NBYTES (data
))
2016 data
->u
.nbytes
= GC_STRING_BYTES (s
);
2018 data
->string
= NULL
;
2020 /* Reset the strings's `data' member so that we
2024 /* Put the string on the free-list. */
2025 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2026 string_free_list
= s
;
2032 /* S was on the free-list before. Put it there again. */
2033 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2034 string_free_list
= s
;
2039 /* Free blocks that contain free Lisp_Strings only, except
2040 the first two of them. */
2041 if (nfree
== STRING_BLOCK_SIZE
2042 && total_free_strings
> STRING_BLOCK_SIZE
)
2046 string_free_list
= free_list_before
;
2050 total_free_strings
+= nfree
;
2051 b
->next
= live_blocks
;
2056 check_string_free_list ();
2058 string_blocks
= live_blocks
;
2059 free_large_strings ();
2060 compact_small_strings ();
2062 check_string_free_list ();
2066 /* Free dead large strings. */
2069 free_large_strings (void)
2071 struct sblock
*b
, *next
;
2072 struct sblock
*live_blocks
= NULL
;
2074 for (b
= large_sblocks
; b
; b
= next
)
2078 if (b
->first_data
.string
== NULL
)
2082 b
->next
= live_blocks
;
2087 large_sblocks
= live_blocks
;
2091 /* Compact data of small strings. Free sblocks that don't contain
2092 data of live strings after compaction. */
2095 compact_small_strings (void)
2097 struct sblock
*b
, *tb
, *next
;
2098 struct sdata
*from
, *to
, *end
, *tb_end
;
2099 struct sdata
*to_end
, *from_end
;
2101 /* TB is the sblock we copy to, TO is the sdata within TB we copy
2102 to, and TB_END is the end of TB. */
2104 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2105 to
= &tb
->first_data
;
2107 /* Step through the blocks from the oldest to the youngest. We
2108 expect that old blocks will stabilize over time, so that less
2109 copying will happen this way. */
2110 for (b
= oldest_sblock
; b
; b
= b
->next
)
2113 xassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
2115 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
2117 /* Compute the next FROM here because copying below may
2118 overwrite data we need to compute it. */
2121 #ifdef GC_CHECK_STRING_BYTES
2122 /* Check that the string size recorded in the string is the
2123 same as the one recorded in the sdata structure. */
2125 && GC_STRING_BYTES (from
->string
) != SDATA_NBYTES (from
))
2127 #endif /* GC_CHECK_STRING_BYTES */
2130 nbytes
= GC_STRING_BYTES (from
->string
);
2132 nbytes
= SDATA_NBYTES (from
);
2134 if (nbytes
> LARGE_STRING_BYTES
)
2137 nbytes
= SDATA_SIZE (nbytes
);
2138 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
2140 #ifdef GC_CHECK_STRING_OVERRUN
2141 if (memcmp (string_overrun_cookie
,
2142 (char *) from_end
- GC_STRING_OVERRUN_COOKIE_SIZE
,
2143 GC_STRING_OVERRUN_COOKIE_SIZE
))
2147 /* FROM->string non-null means it's alive. Copy its data. */
2150 /* If TB is full, proceed with the next sblock. */
2151 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2152 if (to_end
> tb_end
)
2156 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2157 to
= &tb
->first_data
;
2158 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2161 /* Copy, and update the string's `data' pointer. */
2164 xassert (tb
!= b
|| to
< from
);
2165 memmove (to
, from
, nbytes
+ GC_STRING_EXTRA
);
2166 to
->string
->data
= SDATA_DATA (to
);
2169 /* Advance past the sdata we copied to. */
2175 /* The rest of the sblocks following TB don't contain live data, so
2176 we can free them. */
2177 for (b
= tb
->next
; b
; b
= next
)
2185 current_sblock
= tb
;
2189 string_overflow (void)
2191 error ("Maximum string size exceeded");
2194 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
2195 doc
: /* Return a newly created string of length LENGTH, with INIT in each element.
2196 LENGTH must be an integer.
2197 INIT must be an integer that represents a character. */)
2198 (Lisp_Object length
, Lisp_Object init
)
2200 register Lisp_Object val
;
2201 register unsigned char *p
, *end
;
2205 CHECK_NATNUM (length
);
2206 CHECK_CHARACTER (init
);
2208 c
= XFASTINT (init
);
2209 if (ASCII_CHAR_P (c
))
2211 nbytes
= XINT (length
);
2212 val
= make_uninit_string (nbytes
);
2214 end
= p
+ SCHARS (val
);
2220 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
2221 int len
= CHAR_STRING (c
, str
);
2222 EMACS_INT string_len
= XINT (length
);
2224 if (string_len
> STRING_BYTES_MAX
/ len
)
2226 nbytes
= len
* string_len
;
2227 val
= make_uninit_multibyte_string (string_len
, nbytes
);
2232 memcpy (p
, str
, len
);
2242 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
2243 doc
: /* Return a new bool-vector of length LENGTH, using INIT for each element.
2244 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
2245 (Lisp_Object length
, Lisp_Object init
)
2247 register Lisp_Object val
;
2248 struct Lisp_Bool_Vector
*p
;
2250 EMACS_INT length_in_chars
, length_in_elts
;
2253 CHECK_NATNUM (length
);
2255 bits_per_value
= sizeof (EMACS_INT
) * BOOL_VECTOR_BITS_PER_CHAR
;
2257 length_in_elts
= (XFASTINT (length
) + bits_per_value
- 1) / bits_per_value
;
2258 length_in_chars
= ((XFASTINT (length
) + BOOL_VECTOR_BITS_PER_CHAR
- 1)
2259 / BOOL_VECTOR_BITS_PER_CHAR
);
2261 /* We must allocate one more elements than LENGTH_IN_ELTS for the
2262 slot `size' of the struct Lisp_Bool_Vector. */
2263 val
= Fmake_vector (make_number (length_in_elts
+ 1), Qnil
);
2265 /* No Lisp_Object to trace in there. */
2266 XSETPVECTYPESIZE (XVECTOR (val
), PVEC_BOOL_VECTOR
, 0);
2268 p
= XBOOL_VECTOR (val
);
2269 p
->size
= XFASTINT (length
);
2271 real_init
= (NILP (init
) ? 0 : -1);
2272 for (i
= 0; i
< length_in_chars
; i
++)
2273 p
->data
[i
] = real_init
;
2275 /* Clear the extraneous bits in the last byte. */
2276 if (XINT (length
) != length_in_chars
* BOOL_VECTOR_BITS_PER_CHAR
)
2277 p
->data
[length_in_chars
- 1]
2278 &= (1 << (XINT (length
) % BOOL_VECTOR_BITS_PER_CHAR
)) - 1;
2284 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
2285 of characters from the contents. This string may be unibyte or
2286 multibyte, depending on the contents. */
2289 make_string (const char *contents
, EMACS_INT nbytes
)
2291 register Lisp_Object val
;
2292 EMACS_INT nchars
, multibyte_nbytes
;
2294 parse_str_as_multibyte ((const unsigned char *) contents
, nbytes
,
2295 &nchars
, &multibyte_nbytes
);
2296 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
2297 /* CONTENTS contains no multibyte sequences or contains an invalid
2298 multibyte sequence. We must make unibyte string. */
2299 val
= make_unibyte_string (contents
, nbytes
);
2301 val
= make_multibyte_string (contents
, nchars
, nbytes
);
2306 /* Make an unibyte string from LENGTH bytes at CONTENTS. */
2309 make_unibyte_string (const char *contents
, EMACS_INT length
)
2311 register Lisp_Object val
;
2312 val
= make_uninit_string (length
);
2313 memcpy (SDATA (val
), contents
, length
);
2318 /* Make a multibyte string from NCHARS characters occupying NBYTES
2319 bytes at CONTENTS. */
2322 make_multibyte_string (const char *contents
,
2323 EMACS_INT nchars
, EMACS_INT nbytes
)
2325 register Lisp_Object val
;
2326 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2327 memcpy (SDATA (val
), contents
, nbytes
);
2332 /* Make a string from NCHARS characters occupying NBYTES bytes at
2333 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2336 make_string_from_bytes (const char *contents
,
2337 EMACS_INT nchars
, EMACS_INT nbytes
)
2339 register Lisp_Object val
;
2340 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2341 memcpy (SDATA (val
), contents
, nbytes
);
2342 if (SBYTES (val
) == SCHARS (val
))
2343 STRING_SET_UNIBYTE (val
);
2348 /* Make a string from NCHARS characters occupying NBYTES bytes at
2349 CONTENTS. The argument MULTIBYTE controls whether to label the
2350 string as multibyte. If NCHARS is negative, it counts the number of
2351 characters by itself. */
2354 make_specified_string (const char *contents
,
2355 EMACS_INT nchars
, EMACS_INT nbytes
, int multibyte
)
2357 register Lisp_Object val
;
2362 nchars
= multibyte_chars_in_text ((const unsigned char *) contents
,
2367 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2368 memcpy (SDATA (val
), contents
, nbytes
);
2370 STRING_SET_UNIBYTE (val
);
2375 /* Make a string from the data at STR, treating it as multibyte if the
2379 build_string (const char *str
)
2381 return make_string (str
, strlen (str
));
2385 /* Return an unibyte Lisp_String set up to hold LENGTH characters
2386 occupying LENGTH bytes. */
2389 make_uninit_string (EMACS_INT length
)
2394 return empty_unibyte_string
;
2395 val
= make_uninit_multibyte_string (length
, length
);
2396 STRING_SET_UNIBYTE (val
);
2401 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2402 which occupy NBYTES bytes. */
2405 make_uninit_multibyte_string (EMACS_INT nchars
, EMACS_INT nbytes
)
2408 struct Lisp_String
*s
;
2413 return empty_multibyte_string
;
2415 s
= allocate_string ();
2416 allocate_string_data (s
, nchars
, nbytes
);
2417 XSETSTRING (string
, s
);
2418 string_chars_consed
+= nbytes
;
2424 /***********************************************************************
2426 ***********************************************************************/
2428 /* We store float cells inside of float_blocks, allocating a new
2429 float_block with malloc whenever necessary. Float cells reclaimed
2430 by GC are put on a free list to be reallocated before allocating
2431 any new float cells from the latest float_block. */
2433 #define FLOAT_BLOCK_SIZE \
2434 (((BLOCK_BYTES - sizeof (struct float_block *) \
2435 /* The compiler might add padding at the end. */ \
2436 - (sizeof (struct Lisp_Float) - sizeof (int))) * CHAR_BIT) \
2437 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2439 #define GETMARKBIT(block,n) \
2440 (((block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2441 >> ((n) % (sizeof(int) * CHAR_BIT))) \
2444 #define SETMARKBIT(block,n) \
2445 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2446 |= 1 << ((n) % (sizeof(int) * CHAR_BIT))
2448 #define UNSETMARKBIT(block,n) \
2449 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2450 &= ~(1 << ((n) % (sizeof(int) * CHAR_BIT)))
2452 #define FLOAT_BLOCK(fptr) \
2453 ((struct float_block *) (((uintptr_t) (fptr)) & ~(BLOCK_ALIGN - 1)))
2455 #define FLOAT_INDEX(fptr) \
2456 ((((uintptr_t) (fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2460 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2461 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2462 int gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2463 struct float_block
*next
;
2466 #define FLOAT_MARKED_P(fptr) \
2467 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2469 #define FLOAT_MARK(fptr) \
2470 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2472 #define FLOAT_UNMARK(fptr) \
2473 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2475 /* Current float_block. */
2477 static struct float_block
*float_block
;
2479 /* Index of first unused Lisp_Float in the current float_block. */
2481 static int float_block_index
;
2483 /* Total number of float blocks now in use. */
2485 static int n_float_blocks
;
2487 /* Free-list of Lisp_Floats. */
2489 static struct Lisp_Float
*float_free_list
;
2492 /* Initialize float allocation. */
2498 float_block_index
= FLOAT_BLOCK_SIZE
; /* Force alloc of new float_block. */
2499 float_free_list
= 0;
2504 /* Return a new float object with value FLOAT_VALUE. */
2507 make_float (double float_value
)
2509 register Lisp_Object val
;
2511 /* eassert (!handling_signal); */
2515 if (float_free_list
)
2517 /* We use the data field for chaining the free list
2518 so that we won't use the same field that has the mark bit. */
2519 XSETFLOAT (val
, float_free_list
);
2520 float_free_list
= float_free_list
->u
.chain
;
2524 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2526 register struct float_block
*new;
2528 new = (struct float_block
*) lisp_align_malloc (sizeof *new,
2530 new->next
= float_block
;
2531 memset (new->gcmarkbits
, 0, sizeof new->gcmarkbits
);
2533 float_block_index
= 0;
2536 XSETFLOAT (val
, &float_block
->floats
[float_block_index
]);
2537 float_block_index
++;
2540 MALLOC_UNBLOCK_INPUT
;
2542 XFLOAT_INIT (val
, float_value
);
2543 eassert (!FLOAT_MARKED_P (XFLOAT (val
)));
2544 consing_since_gc
+= sizeof (struct Lisp_Float
);
2551 /***********************************************************************
2553 ***********************************************************************/
2555 /* We store cons cells inside of cons_blocks, allocating a new
2556 cons_block with malloc whenever necessary. Cons cells reclaimed by
2557 GC are put on a free list to be reallocated before allocating
2558 any new cons cells from the latest cons_block. */
2560 #define CONS_BLOCK_SIZE \
2561 (((BLOCK_BYTES - sizeof (struct cons_block *)) * CHAR_BIT) \
2562 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2564 #define CONS_BLOCK(fptr) \
2565 ((struct cons_block *) ((uintptr_t) (fptr) & ~(BLOCK_ALIGN - 1)))
2567 #define CONS_INDEX(fptr) \
2568 (((uintptr_t) (fptr) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2572 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2573 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2574 int gcmarkbits
[1 + CONS_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2575 struct cons_block
*next
;
2578 #define CONS_MARKED_P(fptr) \
2579 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2581 #define CONS_MARK(fptr) \
2582 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2584 #define CONS_UNMARK(fptr) \
2585 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2587 /* Current cons_block. */
2589 static struct cons_block
*cons_block
;
2591 /* Index of first unused Lisp_Cons in the current block. */
2593 static int cons_block_index
;
2595 /* Free-list of Lisp_Cons structures. */
2597 static struct Lisp_Cons
*cons_free_list
;
2599 /* Total number of cons blocks now in use. */
2601 static int n_cons_blocks
;
2604 /* Initialize cons allocation. */
2610 cons_block_index
= CONS_BLOCK_SIZE
; /* Force alloc of new cons_block. */
2616 /* Explicitly free a cons cell by putting it on the free-list. */
2619 free_cons (struct Lisp_Cons
*ptr
)
2621 ptr
->u
.chain
= cons_free_list
;
2625 cons_free_list
= ptr
;
2628 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
2629 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2630 (Lisp_Object car
, Lisp_Object cdr
)
2632 register Lisp_Object val
;
2634 /* eassert (!handling_signal); */
2640 /* We use the cdr for chaining the free list
2641 so that we won't use the same field that has the mark bit. */
2642 XSETCONS (val
, cons_free_list
);
2643 cons_free_list
= cons_free_list
->u
.chain
;
2647 if (cons_block_index
== CONS_BLOCK_SIZE
)
2649 register struct cons_block
*new;
2650 new = (struct cons_block
*) lisp_align_malloc (sizeof *new,
2652 memset (new->gcmarkbits
, 0, sizeof new->gcmarkbits
);
2653 new->next
= cons_block
;
2655 cons_block_index
= 0;
2658 XSETCONS (val
, &cons_block
->conses
[cons_block_index
]);
2662 MALLOC_UNBLOCK_INPUT
;
2666 eassert (!CONS_MARKED_P (XCONS (val
)));
2667 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2668 cons_cells_consed
++;
2672 #ifdef GC_CHECK_CONS_LIST
2673 /* Get an error now if there's any junk in the cons free list. */
2675 check_cons_list (void)
2677 struct Lisp_Cons
*tail
= cons_free_list
;
2680 tail
= tail
->u
.chain
;
2684 /* Make a list of 1, 2, 3, 4 or 5 specified objects. */
2687 list1 (Lisp_Object arg1
)
2689 return Fcons (arg1
, Qnil
);
2693 list2 (Lisp_Object arg1
, Lisp_Object arg2
)
2695 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2700 list3 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
)
2702 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2707 list4 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
, Lisp_Object arg4
)
2709 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2714 list5 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
, Lisp_Object arg4
, Lisp_Object arg5
)
2716 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2717 Fcons (arg5
, Qnil
)))));
2721 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
2722 doc
: /* Return a newly created list with specified arguments as elements.
2723 Any number of arguments, even zero arguments, are allowed.
2724 usage: (list &rest OBJECTS) */)
2725 (size_t nargs
, register Lisp_Object
*args
)
2727 register Lisp_Object val
;
2733 val
= Fcons (args
[nargs
], val
);
2739 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2740 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2741 (register Lisp_Object length
, Lisp_Object init
)
2743 register Lisp_Object val
;
2744 register EMACS_INT size
;
2746 CHECK_NATNUM (length
);
2747 size
= XFASTINT (length
);
2752 val
= Fcons (init
, val
);
2757 val
= Fcons (init
, val
);
2762 val
= Fcons (init
, val
);
2767 val
= Fcons (init
, val
);
2772 val
= Fcons (init
, val
);
2787 /***********************************************************************
2789 ***********************************************************************/
2791 /* Singly-linked list of all vectors. */
2793 static struct Lisp_Vector
*all_vectors
;
2795 /* Total number of vector-like objects now in use. */
2797 static int n_vectors
;
2800 /* Value is a pointer to a newly allocated Lisp_Vector structure
2801 with room for LEN Lisp_Objects. */
2803 static struct Lisp_Vector
*
2804 allocate_vectorlike (EMACS_INT len
)
2806 struct Lisp_Vector
*p
;
2808 int header_size
= offsetof (struct Lisp_Vector
, contents
);
2809 int word_size
= sizeof p
->contents
[0];
2811 if ((SIZE_MAX
- header_size
) / word_size
< len
)
2812 memory_full (SIZE_MAX
);
2816 #ifdef DOUG_LEA_MALLOC
2817 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
2818 because mapped region contents are not preserved in
2820 mallopt (M_MMAP_MAX
, 0);
2823 /* This gets triggered by code which I haven't bothered to fix. --Stef */
2824 /* eassert (!handling_signal); */
2826 nbytes
= header_size
+ len
* word_size
;
2827 p
= (struct Lisp_Vector
*) lisp_malloc (nbytes
, MEM_TYPE_VECTORLIKE
);
2829 #ifdef DOUG_LEA_MALLOC
2830 /* Back to a reasonable maximum of mmap'ed areas. */
2831 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2834 consing_since_gc
+= nbytes
;
2835 vector_cells_consed
+= len
;
2837 p
->header
.next
.vector
= all_vectors
;
2840 MALLOC_UNBLOCK_INPUT
;
2847 /* Allocate a vector with NSLOTS slots. */
2849 struct Lisp_Vector
*
2850 allocate_vector (EMACS_INT nslots
)
2852 struct Lisp_Vector
*v
= allocate_vectorlike (nslots
);
2853 v
->header
.size
= nslots
;
2858 /* Allocate other vector-like structures. */
2860 struct Lisp_Vector
*
2861 allocate_pseudovector (int memlen
, int lisplen
, EMACS_INT tag
)
2863 struct Lisp_Vector
*v
= allocate_vectorlike (memlen
);
2866 /* Only the first lisplen slots will be traced normally by the GC. */
2867 for (i
= 0; i
< lisplen
; ++i
)
2868 v
->contents
[i
] = Qnil
;
2870 XSETPVECTYPESIZE (v
, tag
, lisplen
);
2874 struct Lisp_Hash_Table
*
2875 allocate_hash_table (void)
2877 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Hash_Table
, count
, PVEC_HASH_TABLE
);
2882 allocate_window (void)
2884 return ALLOCATE_PSEUDOVECTOR(struct window
, current_matrix
, PVEC_WINDOW
);
2889 allocate_terminal (void)
2891 struct terminal
*t
= ALLOCATE_PSEUDOVECTOR (struct terminal
,
2892 next_terminal
, PVEC_TERMINAL
);
2893 /* Zero out the non-GC'd fields. FIXME: This should be made unnecessary. */
2894 memset (&t
->next_terminal
, 0,
2895 (char*) (t
+ 1) - (char*) &t
->next_terminal
);
2901 allocate_frame (void)
2903 struct frame
*f
= ALLOCATE_PSEUDOVECTOR (struct frame
,
2904 face_cache
, PVEC_FRAME
);
2905 /* Zero out the non-GC'd fields. FIXME: This should be made unnecessary. */
2906 memset (&f
->face_cache
, 0,
2907 (char *) (f
+ 1) - (char *) &f
->face_cache
);
2912 struct Lisp_Process
*
2913 allocate_process (void)
2915 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Process
, pid
, PVEC_PROCESS
);
2919 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
2920 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
2921 See also the function `vector'. */)
2922 (register Lisp_Object length
, Lisp_Object init
)
2925 register EMACS_INT sizei
;
2926 register EMACS_INT i
;
2927 register struct Lisp_Vector
*p
;
2929 CHECK_NATNUM (length
);
2930 sizei
= XFASTINT (length
);
2932 p
= allocate_vector (sizei
);
2933 for (i
= 0; i
< sizei
; i
++)
2934 p
->contents
[i
] = init
;
2936 XSETVECTOR (vector
, p
);
2941 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
2942 doc
: /* Return a newly created vector with specified arguments as elements.
2943 Any number of arguments, even zero arguments, are allowed.
2944 usage: (vector &rest OBJECTS) */)
2945 (register size_t nargs
, Lisp_Object
*args
)
2947 register Lisp_Object len
, val
;
2949 register struct Lisp_Vector
*p
;
2951 XSETFASTINT (len
, nargs
);
2952 val
= Fmake_vector (len
, Qnil
);
2954 for (i
= 0; i
< nargs
; i
++)
2955 p
->contents
[i
] = args
[i
];
2960 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
2961 doc
: /* Create a byte-code object with specified arguments as elements.
2962 The arguments should be the ARGLIST, bytecode-string BYTE-CODE, constant
2963 vector CONSTANTS, maximum stack size DEPTH, (optional) DOCSTRING,
2964 and (optional) INTERACTIVE-SPEC.
2965 The first four arguments are required; at most six have any
2967 The ARGLIST can be either like the one of `lambda', in which case the arguments
2968 will be dynamically bound before executing the byte code, or it can be an
2969 integer of the form NNNNNNNRMMMMMMM where the 7bit MMMMMMM specifies the
2970 minimum number of arguments, the 7-bit NNNNNNN specifies the maximum number
2971 of arguments (ignoring &rest) and the R bit specifies whether there is a &rest
2972 argument to catch the left-over arguments. If such an integer is used, the
2973 arguments will not be dynamically bound but will be instead pushed on the
2974 stack before executing the byte-code.
2975 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
2976 (register size_t nargs
, Lisp_Object
*args
)
2978 register Lisp_Object len
, val
;
2980 register struct Lisp_Vector
*p
;
2982 XSETFASTINT (len
, nargs
);
2983 if (!NILP (Vpurify_flag
))
2984 val
= make_pure_vector ((EMACS_INT
) nargs
);
2986 val
= Fmake_vector (len
, Qnil
);
2988 if (nargs
> 1 && STRINGP (args
[1]) && STRING_MULTIBYTE (args
[1]))
2989 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
2990 earlier because they produced a raw 8-bit string for byte-code
2991 and now such a byte-code string is loaded as multibyte while
2992 raw 8-bit characters converted to multibyte form. Thus, now we
2993 must convert them back to the original unibyte form. */
2994 args
[1] = Fstring_as_unibyte (args
[1]);
2997 for (i
= 0; i
< nargs
; i
++)
2999 if (!NILP (Vpurify_flag
))
3000 args
[i
] = Fpurecopy (args
[i
]);
3001 p
->contents
[i
] = args
[i
];
3003 XSETPVECTYPE (p
, PVEC_COMPILED
);
3004 XSETCOMPILED (val
, p
);
3010 /***********************************************************************
3012 ***********************************************************************/
3014 /* Each symbol_block is just under 1020 bytes long, since malloc
3015 really allocates in units of powers of two and uses 4 bytes for its
3018 #define SYMBOL_BLOCK_SIZE \
3019 ((1020 - sizeof (struct symbol_block *)) / sizeof (struct Lisp_Symbol))
3023 /* Place `symbols' first, to preserve alignment. */
3024 struct Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
3025 struct symbol_block
*next
;
3028 /* Current symbol block and index of first unused Lisp_Symbol
3031 static struct symbol_block
*symbol_block
;
3032 static int symbol_block_index
;
3034 /* List of free symbols. */
3036 static struct Lisp_Symbol
*symbol_free_list
;
3038 /* Total number of symbol blocks now in use. */
3040 static int n_symbol_blocks
;
3043 /* Initialize symbol allocation. */
3048 symbol_block
= NULL
;
3049 symbol_block_index
= SYMBOL_BLOCK_SIZE
;
3050 symbol_free_list
= 0;
3051 n_symbol_blocks
= 0;
3055 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
3056 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
3057 Its value and function definition are void, and its property list is nil. */)
3060 register Lisp_Object val
;
3061 register struct Lisp_Symbol
*p
;
3063 CHECK_STRING (name
);
3065 /* eassert (!handling_signal); */
3069 if (symbol_free_list
)
3071 XSETSYMBOL (val
, symbol_free_list
);
3072 symbol_free_list
= symbol_free_list
->next
;
3076 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
3078 struct symbol_block
*new;
3079 new = (struct symbol_block
*) lisp_malloc (sizeof *new,
3081 new->next
= symbol_block
;
3083 symbol_block_index
= 0;
3086 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
]);
3087 symbol_block_index
++;
3090 MALLOC_UNBLOCK_INPUT
;
3095 p
->redirect
= SYMBOL_PLAINVAL
;
3096 SET_SYMBOL_VAL (p
, Qunbound
);
3097 p
->function
= Qunbound
;
3100 p
->interned
= SYMBOL_UNINTERNED
;
3102 p
->declared_special
= 0;
3103 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
3110 /***********************************************************************
3111 Marker (Misc) Allocation
3112 ***********************************************************************/
3114 /* Allocation of markers and other objects that share that structure.
3115 Works like allocation of conses. */
3117 #define MARKER_BLOCK_SIZE \
3118 ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc))
3122 /* Place `markers' first, to preserve alignment. */
3123 union Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
3124 struct marker_block
*next
;
3127 static struct marker_block
*marker_block
;
3128 static int marker_block_index
;
3130 static union Lisp_Misc
*marker_free_list
;
3132 /* Total number of marker blocks now in use. */
3134 static int n_marker_blocks
;
3139 marker_block
= NULL
;
3140 marker_block_index
= MARKER_BLOCK_SIZE
;
3141 marker_free_list
= 0;
3142 n_marker_blocks
= 0;
3145 /* Return a newly allocated Lisp_Misc object, with no substructure. */
3148 allocate_misc (void)
3152 /* eassert (!handling_signal); */
3156 if (marker_free_list
)
3158 XSETMISC (val
, marker_free_list
);
3159 marker_free_list
= marker_free_list
->u_free
.chain
;
3163 if (marker_block_index
== MARKER_BLOCK_SIZE
)
3165 struct marker_block
*new;
3166 new = (struct marker_block
*) lisp_malloc (sizeof *new,
3168 new->next
= marker_block
;
3170 marker_block_index
= 0;
3172 total_free_markers
+= MARKER_BLOCK_SIZE
;
3174 XSETMISC (val
, &marker_block
->markers
[marker_block_index
]);
3175 marker_block_index
++;
3178 MALLOC_UNBLOCK_INPUT
;
3180 --total_free_markers
;
3181 consing_since_gc
+= sizeof (union Lisp_Misc
);
3182 misc_objects_consed
++;
3183 XMISCANY (val
)->gcmarkbit
= 0;
3187 /* Free a Lisp_Misc object */
3190 free_misc (Lisp_Object misc
)
3192 XMISCTYPE (misc
) = Lisp_Misc_Free
;
3193 XMISC (misc
)->u_free
.chain
= marker_free_list
;
3194 marker_free_list
= XMISC (misc
);
3196 total_free_markers
++;
3199 /* Return a Lisp_Misc_Save_Value object containing POINTER and
3200 INTEGER. This is used to package C values to call record_unwind_protect.
3201 The unwind function can get the C values back using XSAVE_VALUE. */
3204 make_save_value (void *pointer
, int integer
)
3206 register Lisp_Object val
;
3207 register struct Lisp_Save_Value
*p
;
3209 val
= allocate_misc ();
3210 XMISCTYPE (val
) = Lisp_Misc_Save_Value
;
3211 p
= XSAVE_VALUE (val
);
3212 p
->pointer
= pointer
;
3213 p
->integer
= integer
;
3218 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
3219 doc
: /* Return a newly allocated marker which does not point at any place. */)
3222 register Lisp_Object val
;
3223 register struct Lisp_Marker
*p
;
3225 val
= allocate_misc ();
3226 XMISCTYPE (val
) = Lisp_Misc_Marker
;
3232 p
->insertion_type
= 0;
3236 /* Put MARKER back on the free list after using it temporarily. */
3239 free_marker (Lisp_Object marker
)
3241 unchain_marker (XMARKER (marker
));
3246 /* Return a newly created vector or string with specified arguments as
3247 elements. If all the arguments are characters that can fit
3248 in a string of events, make a string; otherwise, make a vector.
3250 Any number of arguments, even zero arguments, are allowed. */
3253 make_event_array (register int nargs
, Lisp_Object
*args
)
3257 for (i
= 0; i
< nargs
; i
++)
3258 /* The things that fit in a string
3259 are characters that are in 0...127,
3260 after discarding the meta bit and all the bits above it. */
3261 if (!INTEGERP (args
[i
])
3262 || (XINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
3263 return Fvector (nargs
, args
);
3265 /* Since the loop exited, we know that all the things in it are
3266 characters, so we can make a string. */
3270 result
= Fmake_string (make_number (nargs
), make_number (0));
3271 for (i
= 0; i
< nargs
; i
++)
3273 SSET (result
, i
, XINT (args
[i
]));
3274 /* Move the meta bit to the right place for a string char. */
3275 if (XINT (args
[i
]) & CHAR_META
)
3276 SSET (result
, i
, SREF (result
, i
) | 0x80);
3285 /************************************************************************
3286 Memory Full Handling
3287 ************************************************************************/
3290 /* Called if malloc (NBYTES) returns zero. If NBYTES == SIZE_MAX,
3291 there may have been size_t overflow so that malloc was never
3292 called, or perhaps malloc was invoked successfully but the
3293 resulting pointer had problems fitting into a tagged EMACS_INT. In
3294 either case this counts as memory being full even though malloc did
3298 memory_full (size_t nbytes
)
3300 /* Do not go into hysterics merely because a large request failed. */
3301 int enough_free_memory
= 0;
3302 if (SPARE_MEMORY
< nbytes
)
3304 void *p
= malloc (SPARE_MEMORY
);
3308 enough_free_memory
= 1;
3312 if (! enough_free_memory
)
3318 memory_full_cons_threshold
= sizeof (struct cons_block
);
3320 /* The first time we get here, free the spare memory. */
3321 for (i
= 0; i
< sizeof (spare_memory
) / sizeof (char *); i
++)
3322 if (spare_memory
[i
])
3325 free (spare_memory
[i
]);
3326 else if (i
>= 1 && i
<= 4)
3327 lisp_align_free (spare_memory
[i
]);
3329 lisp_free (spare_memory
[i
]);
3330 spare_memory
[i
] = 0;
3333 /* Record the space now used. When it decreases substantially,
3334 we can refill the memory reserve. */
3335 #if !defined SYSTEM_MALLOC && !defined SYNC_INPUT
3336 bytes_used_when_full
= BYTES_USED
;
3340 /* This used to call error, but if we've run out of memory, we could
3341 get infinite recursion trying to build the string. */
3342 xsignal (Qnil
, Vmemory_signal_data
);
3345 /* If we released our reserve (due to running out of memory),
3346 and we have a fair amount free once again,
3347 try to set aside another reserve in case we run out once more.
3349 This is called when a relocatable block is freed in ralloc.c,
3350 and also directly from this file, in case we're not using ralloc.c. */
3353 refill_memory_reserve (void)
3355 #ifndef SYSTEM_MALLOC
3356 if (spare_memory
[0] == 0)
3357 spare_memory
[0] = (char *) malloc ((size_t) SPARE_MEMORY
);
3358 if (spare_memory
[1] == 0)
3359 spare_memory
[1] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3361 if (spare_memory
[2] == 0)
3362 spare_memory
[2] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3364 if (spare_memory
[3] == 0)
3365 spare_memory
[3] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3367 if (spare_memory
[4] == 0)
3368 spare_memory
[4] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3370 if (spare_memory
[5] == 0)
3371 spare_memory
[5] = (char *) lisp_malloc (sizeof (struct string_block
),
3373 if (spare_memory
[6] == 0)
3374 spare_memory
[6] = (char *) lisp_malloc (sizeof (struct string_block
),
3376 if (spare_memory
[0] && spare_memory
[1] && spare_memory
[5])
3377 Vmemory_full
= Qnil
;
3381 /************************************************************************
3383 ************************************************************************/
3385 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
3387 /* Conservative C stack marking requires a method to identify possibly
3388 live Lisp objects given a pointer value. We do this by keeping
3389 track of blocks of Lisp data that are allocated in a red-black tree
3390 (see also the comment of mem_node which is the type of nodes in
3391 that tree). Function lisp_malloc adds information for an allocated
3392 block to the red-black tree with calls to mem_insert, and function
3393 lisp_free removes it with mem_delete. Functions live_string_p etc
3394 call mem_find to lookup information about a given pointer in the
3395 tree, and use that to determine if the pointer points to a Lisp
3398 /* Initialize this part of alloc.c. */
3403 mem_z
.left
= mem_z
.right
= MEM_NIL
;
3404 mem_z
.parent
= NULL
;
3405 mem_z
.color
= MEM_BLACK
;
3406 mem_z
.start
= mem_z
.end
= NULL
;
3411 /* Value is a pointer to the mem_node containing START. Value is
3412 MEM_NIL if there is no node in the tree containing START. */
3414 static inline struct mem_node
*
3415 mem_find (void *start
)
3419 if (start
< min_heap_address
|| start
> max_heap_address
)
3422 /* Make the search always successful to speed up the loop below. */
3423 mem_z
.start
= start
;
3424 mem_z
.end
= (char *) start
+ 1;
3427 while (start
< p
->start
|| start
>= p
->end
)
3428 p
= start
< p
->start
? p
->left
: p
->right
;
3433 /* Insert a new node into the tree for a block of memory with start
3434 address START, end address END, and type TYPE. Value is a
3435 pointer to the node that was inserted. */
3437 static struct mem_node
*
3438 mem_insert (void *start
, void *end
, enum mem_type type
)
3440 struct mem_node
*c
, *parent
, *x
;
3442 if (min_heap_address
== NULL
|| start
< min_heap_address
)
3443 min_heap_address
= start
;
3444 if (max_heap_address
== NULL
|| end
> max_heap_address
)
3445 max_heap_address
= end
;
3447 /* See where in the tree a node for START belongs. In this
3448 particular application, it shouldn't happen that a node is already
3449 present. For debugging purposes, let's check that. */
3453 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3455 while (c
!= MEM_NIL
)
3457 if (start
>= c
->start
&& start
< c
->end
)
3460 c
= start
< c
->start
? c
->left
: c
->right
;
3463 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3465 while (c
!= MEM_NIL
)
3468 c
= start
< c
->start
? c
->left
: c
->right
;
3471 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3473 /* Create a new node. */
3474 #ifdef GC_MALLOC_CHECK
3475 x
= (struct mem_node
*) _malloc_internal (sizeof *x
);
3479 x
= (struct mem_node
*) xmalloc (sizeof *x
);
3485 x
->left
= x
->right
= MEM_NIL
;
3488 /* Insert it as child of PARENT or install it as root. */
3491 if (start
< parent
->start
)
3499 /* Re-establish red-black tree properties. */
3500 mem_insert_fixup (x
);
3506 /* Re-establish the red-black properties of the tree, and thereby
3507 balance the tree, after node X has been inserted; X is always red. */
3510 mem_insert_fixup (struct mem_node
*x
)
3512 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3514 /* X is red and its parent is red. This is a violation of
3515 red-black tree property #3. */
3517 if (x
->parent
== x
->parent
->parent
->left
)
3519 /* We're on the left side of our grandparent, and Y is our
3521 struct mem_node
*y
= x
->parent
->parent
->right
;
3523 if (y
->color
== MEM_RED
)
3525 /* Uncle and parent are red but should be black because
3526 X is red. Change the colors accordingly and proceed
3527 with the grandparent. */
3528 x
->parent
->color
= MEM_BLACK
;
3529 y
->color
= MEM_BLACK
;
3530 x
->parent
->parent
->color
= MEM_RED
;
3531 x
= x
->parent
->parent
;
3535 /* Parent and uncle have different colors; parent is
3536 red, uncle is black. */
3537 if (x
== x
->parent
->right
)
3540 mem_rotate_left (x
);
3543 x
->parent
->color
= MEM_BLACK
;
3544 x
->parent
->parent
->color
= MEM_RED
;
3545 mem_rotate_right (x
->parent
->parent
);
3550 /* This is the symmetrical case of above. */
3551 struct mem_node
*y
= x
->parent
->parent
->left
;
3553 if (y
->color
== MEM_RED
)
3555 x
->parent
->color
= MEM_BLACK
;
3556 y
->color
= MEM_BLACK
;
3557 x
->parent
->parent
->color
= MEM_RED
;
3558 x
= x
->parent
->parent
;
3562 if (x
== x
->parent
->left
)
3565 mem_rotate_right (x
);
3568 x
->parent
->color
= MEM_BLACK
;
3569 x
->parent
->parent
->color
= MEM_RED
;
3570 mem_rotate_left (x
->parent
->parent
);
3575 /* The root may have been changed to red due to the algorithm. Set
3576 it to black so that property #5 is satisfied. */
3577 mem_root
->color
= MEM_BLACK
;
3588 mem_rotate_left (struct mem_node
*x
)
3592 /* Turn y's left sub-tree into x's right sub-tree. */
3595 if (y
->left
!= MEM_NIL
)
3596 y
->left
->parent
= x
;
3598 /* Y's parent was x's parent. */
3600 y
->parent
= x
->parent
;
3602 /* Get the parent to point to y instead of x. */
3605 if (x
== x
->parent
->left
)
3606 x
->parent
->left
= y
;
3608 x
->parent
->right
= y
;
3613 /* Put x on y's left. */
3627 mem_rotate_right (struct mem_node
*x
)
3629 struct mem_node
*y
= x
->left
;
3632 if (y
->right
!= MEM_NIL
)
3633 y
->right
->parent
= x
;
3636 y
->parent
= x
->parent
;
3639 if (x
== x
->parent
->right
)
3640 x
->parent
->right
= y
;
3642 x
->parent
->left
= y
;
3653 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
3656 mem_delete (struct mem_node
*z
)
3658 struct mem_node
*x
, *y
;
3660 if (!z
|| z
== MEM_NIL
)
3663 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
3668 while (y
->left
!= MEM_NIL
)
3672 if (y
->left
!= MEM_NIL
)
3677 x
->parent
= y
->parent
;
3680 if (y
== y
->parent
->left
)
3681 y
->parent
->left
= x
;
3683 y
->parent
->right
= x
;
3690 z
->start
= y
->start
;
3695 if (y
->color
== MEM_BLACK
)
3696 mem_delete_fixup (x
);
3698 #ifdef GC_MALLOC_CHECK
3706 /* Re-establish the red-black properties of the tree, after a
3710 mem_delete_fixup (struct mem_node
*x
)
3712 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
3714 if (x
== x
->parent
->left
)
3716 struct mem_node
*w
= x
->parent
->right
;
3718 if (w
->color
== MEM_RED
)
3720 w
->color
= MEM_BLACK
;
3721 x
->parent
->color
= MEM_RED
;
3722 mem_rotate_left (x
->parent
);
3723 w
= x
->parent
->right
;
3726 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
3733 if (w
->right
->color
== MEM_BLACK
)
3735 w
->left
->color
= MEM_BLACK
;
3737 mem_rotate_right (w
);
3738 w
= x
->parent
->right
;
3740 w
->color
= x
->parent
->color
;
3741 x
->parent
->color
= MEM_BLACK
;
3742 w
->right
->color
= MEM_BLACK
;
3743 mem_rotate_left (x
->parent
);
3749 struct mem_node
*w
= x
->parent
->left
;
3751 if (w
->color
== MEM_RED
)
3753 w
->color
= MEM_BLACK
;
3754 x
->parent
->color
= MEM_RED
;
3755 mem_rotate_right (x
->parent
);
3756 w
= x
->parent
->left
;
3759 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
3766 if (w
->left
->color
== MEM_BLACK
)
3768 w
->right
->color
= MEM_BLACK
;
3770 mem_rotate_left (w
);
3771 w
= x
->parent
->left
;
3774 w
->color
= x
->parent
->color
;
3775 x
->parent
->color
= MEM_BLACK
;
3776 w
->left
->color
= MEM_BLACK
;
3777 mem_rotate_right (x
->parent
);
3783 x
->color
= MEM_BLACK
;
3787 /* Value is non-zero if P is a pointer to a live Lisp string on
3788 the heap. M is a pointer to the mem_block for P. */
3791 live_string_p (struct mem_node
*m
, void *p
)
3793 if (m
->type
== MEM_TYPE_STRING
)
3795 struct string_block
*b
= (struct string_block
*) m
->start
;
3796 ptrdiff_t offset
= (char *) p
- (char *) &b
->strings
[0];
3798 /* P must point to the start of a Lisp_String structure, and it
3799 must not be on the free-list. */
3801 && offset
% sizeof b
->strings
[0] == 0
3802 && offset
< (STRING_BLOCK_SIZE
* sizeof b
->strings
[0])
3803 && ((struct Lisp_String
*) p
)->data
!= NULL
);
3810 /* Value is non-zero if P is a pointer to a live Lisp cons on
3811 the heap. M is a pointer to the mem_block for P. */
3814 live_cons_p (struct mem_node
*m
, void *p
)
3816 if (m
->type
== MEM_TYPE_CONS
)
3818 struct cons_block
*b
= (struct cons_block
*) m
->start
;
3819 ptrdiff_t offset
= (char *) p
- (char *) &b
->conses
[0];
3821 /* P must point to the start of a Lisp_Cons, not be
3822 one of the unused cells in the current cons block,
3823 and not be on the free-list. */
3825 && offset
% sizeof b
->conses
[0] == 0
3826 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
3828 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
3829 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
3836 /* Value is non-zero if P is a pointer to a live Lisp symbol on
3837 the heap. M is a pointer to the mem_block for P. */
3840 live_symbol_p (struct mem_node
*m
, void *p
)
3842 if (m
->type
== MEM_TYPE_SYMBOL
)
3844 struct symbol_block
*b
= (struct symbol_block
*) m
->start
;
3845 ptrdiff_t offset
= (char *) p
- (char *) &b
->symbols
[0];
3847 /* P must point to the start of a Lisp_Symbol, not be
3848 one of the unused cells in the current symbol block,
3849 and not be on the free-list. */
3851 && offset
% sizeof b
->symbols
[0] == 0
3852 && offset
< (SYMBOL_BLOCK_SIZE
* sizeof b
->symbols
[0])
3853 && (b
!= symbol_block
3854 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
3855 && !EQ (((struct Lisp_Symbol
*) p
)->function
, Vdead
));
3862 /* Value is non-zero if P is a pointer to a live Lisp float on
3863 the heap. M is a pointer to the mem_block for P. */
3866 live_float_p (struct mem_node
*m
, void *p
)
3868 if (m
->type
== MEM_TYPE_FLOAT
)
3870 struct float_block
*b
= (struct float_block
*) m
->start
;
3871 ptrdiff_t offset
= (char *) p
- (char *) &b
->floats
[0];
3873 /* P must point to the start of a Lisp_Float and not be
3874 one of the unused cells in the current float block. */
3876 && offset
% sizeof b
->floats
[0] == 0
3877 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
3878 && (b
!= float_block
3879 || offset
/ sizeof b
->floats
[0] < float_block_index
));
3886 /* Value is non-zero if P is a pointer to a live Lisp Misc on
3887 the heap. M is a pointer to the mem_block for P. */
3890 live_misc_p (struct mem_node
*m
, void *p
)
3892 if (m
->type
== MEM_TYPE_MISC
)
3894 struct marker_block
*b
= (struct marker_block
*) m
->start
;
3895 ptrdiff_t offset
= (char *) p
- (char *) &b
->markers
[0];
3897 /* P must point to the start of a Lisp_Misc, not be
3898 one of the unused cells in the current misc block,
3899 and not be on the free-list. */
3901 && offset
% sizeof b
->markers
[0] == 0
3902 && offset
< (MARKER_BLOCK_SIZE
* sizeof b
->markers
[0])
3903 && (b
!= marker_block
3904 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
3905 && ((union Lisp_Misc
*) p
)->u_any
.type
!= Lisp_Misc_Free
);
3912 /* Value is non-zero if P is a pointer to a live vector-like object.
3913 M is a pointer to the mem_block for P. */
3916 live_vector_p (struct mem_node
*m
, void *p
)
3918 return (p
== m
->start
&& m
->type
== MEM_TYPE_VECTORLIKE
);
3922 /* Value is non-zero if P is a pointer to a live buffer. M is a
3923 pointer to the mem_block for P. */
3926 live_buffer_p (struct mem_node
*m
, void *p
)
3928 /* P must point to the start of the block, and the buffer
3929 must not have been killed. */
3930 return (m
->type
== MEM_TYPE_BUFFER
3932 && !NILP (((struct buffer
*) p
)->BUFFER_INTERNAL_FIELD (name
)));
3935 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
3939 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3941 /* Array of objects that are kept alive because the C stack contains
3942 a pattern that looks like a reference to them . */
3944 #define MAX_ZOMBIES 10
3945 static Lisp_Object zombies
[MAX_ZOMBIES
];
3947 /* Number of zombie objects. */
3949 static int nzombies
;
3951 /* Number of garbage collections. */
3955 /* Average percentage of zombies per collection. */
3957 static double avg_zombies
;
3959 /* Max. number of live and zombie objects. */
3961 static int max_live
, max_zombies
;
3963 /* Average number of live objects per GC. */
3965 static double avg_live
;
3967 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
3968 doc
: /* Show information about live and zombie objects. */)
3971 Lisp_Object args
[8], zombie_list
= Qnil
;
3973 for (i
= 0; i
< nzombies
; i
++)
3974 zombie_list
= Fcons (zombies
[i
], zombie_list
);
3975 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
3976 args
[1] = make_number (ngcs
);
3977 args
[2] = make_float (avg_live
);
3978 args
[3] = make_float (avg_zombies
);
3979 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
3980 args
[5] = make_number (max_live
);
3981 args
[6] = make_number (max_zombies
);
3982 args
[7] = zombie_list
;
3983 return Fmessage (8, args
);
3986 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
3989 /* Mark OBJ if we can prove it's a Lisp_Object. */
3992 mark_maybe_object (Lisp_Object obj
)
4000 po
= (void *) XPNTR (obj
);
4007 switch (XTYPE (obj
))
4010 mark_p
= (live_string_p (m
, po
)
4011 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
4015 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
4019 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
4023 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
4026 case Lisp_Vectorlike
:
4027 /* Note: can't check BUFFERP before we know it's a
4028 buffer because checking that dereferences the pointer
4029 PO which might point anywhere. */
4030 if (live_vector_p (m
, po
))
4031 mark_p
= !SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
4032 else if (live_buffer_p (m
, po
))
4033 mark_p
= BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
4037 mark_p
= (live_misc_p (m
, po
) && !XMISCANY (obj
)->gcmarkbit
);
4046 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4047 if (nzombies
< MAX_ZOMBIES
)
4048 zombies
[nzombies
] = obj
;
4057 /* If P points to Lisp data, mark that as live if it isn't already
4061 mark_maybe_pointer (void *p
)
4065 /* Quickly rule out some values which can't point to Lisp data. */
4068 8 /* USE_LSB_TAG needs Lisp data to be aligned on multiples of 8. */
4070 2 /* We assume that Lisp data is aligned on even addresses. */
4078 Lisp_Object obj
= Qnil
;
4082 case MEM_TYPE_NON_LISP
:
4083 /* Nothing to do; not a pointer to Lisp memory. */
4086 case MEM_TYPE_BUFFER
:
4087 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P((struct buffer
*)p
))
4088 XSETVECTOR (obj
, p
);
4092 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
4096 case MEM_TYPE_STRING
:
4097 if (live_string_p (m
, p
)
4098 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
4099 XSETSTRING (obj
, p
);
4103 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
4107 case MEM_TYPE_SYMBOL
:
4108 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
4109 XSETSYMBOL (obj
, p
);
4112 case MEM_TYPE_FLOAT
:
4113 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
4117 case MEM_TYPE_VECTORLIKE
:
4118 if (live_vector_p (m
, p
))
4121 XSETVECTOR (tem
, p
);
4122 if (!SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
4137 /* Mark Lisp objects referenced from the address range START+OFFSET..END
4138 or END+OFFSET..START. */
4141 mark_memory (void *start
, void *end
, int offset
)
4146 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4150 /* Make START the pointer to the start of the memory region,
4151 if it isn't already. */
4159 /* Mark Lisp_Objects. */
4160 for (p
= (Lisp_Object
*) ((char *) start
+ offset
); (void *) p
< end
; ++p
)
4161 mark_maybe_object (*p
);
4163 /* Mark Lisp data pointed to. This is necessary because, in some
4164 situations, the C compiler optimizes Lisp objects away, so that
4165 only a pointer to them remains. Example:
4167 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
4170 Lisp_Object obj = build_string ("test");
4171 struct Lisp_String *s = XSTRING (obj);
4172 Fgarbage_collect ();
4173 fprintf (stderr, "test `%s'\n", s->data);
4177 Here, `obj' isn't really used, and the compiler optimizes it
4178 away. The only reference to the life string is through the
4181 for (pp
= (void **) ((char *) start
+ offset
); (void *) pp
< end
; ++pp
)
4182 mark_maybe_pointer (*pp
);
4185 /* setjmp will work with GCC unless NON_SAVING_SETJMP is defined in
4186 the GCC system configuration. In gcc 3.2, the only systems for
4187 which this is so are i386-sco5 non-ELF, i386-sysv3 (maybe included
4188 by others?) and ns32k-pc532-min. */
4190 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
4192 static int setjmp_tested_p
, longjmps_done
;
4194 #define SETJMP_WILL_LIKELY_WORK "\
4196 Emacs garbage collector has been changed to use conservative stack\n\
4197 marking. Emacs has determined that the method it uses to do the\n\
4198 marking will likely work on your system, but this isn't sure.\n\
4200 If you are a system-programmer, or can get the help of a local wizard\n\
4201 who is, please take a look at the function mark_stack in alloc.c, and\n\
4202 verify that the methods used are appropriate for your system.\n\
4204 Please mail the result to <emacs-devel@gnu.org>.\n\
4207 #define SETJMP_WILL_NOT_WORK "\
4209 Emacs garbage collector has been changed to use conservative stack\n\
4210 marking. Emacs has determined that the default method it uses to do the\n\
4211 marking will not work on your system. We will need a system-dependent\n\
4212 solution for your system.\n\
4214 Please take a look at the function mark_stack in alloc.c, and\n\
4215 try to find a way to make it work on your system.\n\
4217 Note that you may get false negatives, depending on the compiler.\n\
4218 In particular, you need to use -O with GCC for this test.\n\
4220 Please mail the result to <emacs-devel@gnu.org>.\n\
4224 /* Perform a quick check if it looks like setjmp saves registers in a
4225 jmp_buf. Print a message to stderr saying so. When this test
4226 succeeds, this is _not_ a proof that setjmp is sufficient for
4227 conservative stack marking. Only the sources or a disassembly
4238 /* Arrange for X to be put in a register. */
4244 if (longjmps_done
== 1)
4246 /* Came here after the longjmp at the end of the function.
4248 If x == 1, the longjmp has restored the register to its
4249 value before the setjmp, and we can hope that setjmp
4250 saves all such registers in the jmp_buf, although that
4253 For other values of X, either something really strange is
4254 taking place, or the setjmp just didn't save the register. */
4257 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
4260 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
4267 if (longjmps_done
== 1)
4271 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
4274 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4276 /* Abort if anything GCPRO'd doesn't survive the GC. */
4284 for (p
= gcprolist
; p
; p
= p
->next
)
4285 for (i
= 0; i
< p
->nvars
; ++i
)
4286 if (!survives_gc_p (p
->var
[i
]))
4287 /* FIXME: It's not necessarily a bug. It might just be that the
4288 GCPRO is unnecessary or should release the object sooner. */
4292 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4299 fprintf (stderr
, "\nZombies kept alive = %d:\n", nzombies
);
4300 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
4302 fprintf (stderr
, " %d = ", i
);
4303 debug_print (zombies
[i
]);
4307 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4310 /* Mark live Lisp objects on the C stack.
4312 There are several system-dependent problems to consider when
4313 porting this to new architectures:
4317 We have to mark Lisp objects in CPU registers that can hold local
4318 variables or are used to pass parameters.
4320 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
4321 something that either saves relevant registers on the stack, or
4322 calls mark_maybe_object passing it each register's contents.
4324 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
4325 implementation assumes that calling setjmp saves registers we need
4326 to see in a jmp_buf which itself lies on the stack. This doesn't
4327 have to be true! It must be verified for each system, possibly
4328 by taking a look at the source code of setjmp.
4330 If __builtin_unwind_init is available (defined by GCC >= 2.8) we
4331 can use it as a machine independent method to store all registers
4332 to the stack. In this case the macros described in the previous
4333 two paragraphs are not used.
4337 Architectures differ in the way their processor stack is organized.
4338 For example, the stack might look like this
4341 | Lisp_Object | size = 4
4343 | something else | size = 2
4345 | Lisp_Object | size = 4
4349 In such a case, not every Lisp_Object will be aligned equally. To
4350 find all Lisp_Object on the stack it won't be sufficient to walk
4351 the stack in steps of 4 bytes. Instead, two passes will be
4352 necessary, one starting at the start of the stack, and a second
4353 pass starting at the start of the stack + 2. Likewise, if the
4354 minimal alignment of Lisp_Objects on the stack is 1, four passes
4355 would be necessary, each one starting with one byte more offset
4356 from the stack start.
4358 The current code assumes by default that Lisp_Objects are aligned
4359 equally on the stack. */
4367 #ifdef HAVE___BUILTIN_UNWIND_INIT
4368 /* Force callee-saved registers and register windows onto the stack.
4369 This is the preferred method if available, obviating the need for
4370 machine dependent methods. */
4371 __builtin_unwind_init ();
4373 #else /* not HAVE___BUILTIN_UNWIND_INIT */
4374 #ifndef GC_SAVE_REGISTERS_ON_STACK
4375 /* jmp_buf may not be aligned enough on darwin-ppc64 */
4376 union aligned_jmpbuf
{
4380 volatile int stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
4382 /* This trick flushes the register windows so that all the state of
4383 the process is contained in the stack. */
4384 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
4385 needed on ia64 too. See mach_dep.c, where it also says inline
4386 assembler doesn't work with relevant proprietary compilers. */
4388 #if defined (__sparc64__) && defined (__FreeBSD__)
4389 /* FreeBSD does not have a ta 3 handler. */
4396 /* Save registers that we need to see on the stack. We need to see
4397 registers used to hold register variables and registers used to
4399 #ifdef GC_SAVE_REGISTERS_ON_STACK
4400 GC_SAVE_REGISTERS_ON_STACK (end
);
4401 #else /* not GC_SAVE_REGISTERS_ON_STACK */
4403 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
4404 setjmp will definitely work, test it
4405 and print a message with the result
4407 if (!setjmp_tested_p
)
4409 setjmp_tested_p
= 1;
4412 #endif /* GC_SETJMP_WORKS */
4415 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
4416 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
4417 #endif /* not HAVE___BUILTIN_UNWIND_INIT */
4419 /* This assumes that the stack is a contiguous region in memory. If
4420 that's not the case, something has to be done here to iterate
4421 over the stack segments. */
4422 #ifndef GC_LISP_OBJECT_ALIGNMENT
4424 #define GC_LISP_OBJECT_ALIGNMENT __alignof__ (Lisp_Object)
4426 #define GC_LISP_OBJECT_ALIGNMENT sizeof (Lisp_Object)
4429 for (i
= 0; i
< sizeof (Lisp_Object
); i
+= GC_LISP_OBJECT_ALIGNMENT
)
4430 mark_memory (stack_base
, end
, i
);
4431 /* Allow for marking a secondary stack, like the register stack on the
4433 #ifdef GC_MARK_SECONDARY_STACK
4434 GC_MARK_SECONDARY_STACK ();
4437 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4442 #endif /* GC_MARK_STACK != 0 */
4445 /* Determine whether it is safe to access memory at address P. */
4447 valid_pointer_p (void *p
)
4450 return w32_valid_pointer_p (p
, 16);
4454 /* Obviously, we cannot just access it (we would SEGV trying), so we
4455 trick the o/s to tell us whether p is a valid pointer.
4456 Unfortunately, we cannot use NULL_DEVICE here, as emacs_write may
4457 not validate p in that case. */
4459 if ((fd
= emacs_open ("__Valid__Lisp__Object__", O_CREAT
| O_WRONLY
| O_TRUNC
, 0666)) >= 0)
4461 int valid
= (emacs_write (fd
, (char *)p
, 16) == 16);
4463 unlink ("__Valid__Lisp__Object__");
4471 /* Return 1 if OBJ is a valid lisp object.
4472 Return 0 if OBJ is NOT a valid lisp object.
4473 Return -1 if we cannot validate OBJ.
4474 This function can be quite slow,
4475 so it should only be used in code for manual debugging. */
4478 valid_lisp_object_p (Lisp_Object obj
)
4488 p
= (void *) XPNTR (obj
);
4489 if (PURE_POINTER_P (p
))
4493 return valid_pointer_p (p
);
4500 int valid
= valid_pointer_p (p
);
4512 case MEM_TYPE_NON_LISP
:
4515 case MEM_TYPE_BUFFER
:
4516 return live_buffer_p (m
, p
);
4519 return live_cons_p (m
, p
);
4521 case MEM_TYPE_STRING
:
4522 return live_string_p (m
, p
);
4525 return live_misc_p (m
, p
);
4527 case MEM_TYPE_SYMBOL
:
4528 return live_symbol_p (m
, p
);
4530 case MEM_TYPE_FLOAT
:
4531 return live_float_p (m
, p
);
4533 case MEM_TYPE_VECTORLIKE
:
4534 return live_vector_p (m
, p
);
4547 /***********************************************************************
4548 Pure Storage Management
4549 ***********************************************************************/
4551 /* Allocate room for SIZE bytes from pure Lisp storage and return a
4552 pointer to it. TYPE is the Lisp type for which the memory is
4553 allocated. TYPE < 0 means it's not used for a Lisp object. */
4555 static POINTER_TYPE
*
4556 pure_alloc (size_t size
, int type
)
4558 POINTER_TYPE
*result
;
4560 size_t alignment
= (1 << GCTYPEBITS
);
4562 size_t alignment
= sizeof (EMACS_INT
);
4564 /* Give Lisp_Floats an extra alignment. */
4565 if (type
== Lisp_Float
)
4567 #if defined __GNUC__ && __GNUC__ >= 2
4568 alignment
= __alignof (struct Lisp_Float
);
4570 alignment
= sizeof (struct Lisp_Float
);
4578 /* Allocate space for a Lisp object from the beginning of the free
4579 space with taking account of alignment. */
4580 result
= ALIGN (purebeg
+ pure_bytes_used_lisp
, alignment
);
4581 pure_bytes_used_lisp
= ((char *)result
- (char *)purebeg
) + size
;
4585 /* Allocate space for a non-Lisp object from the end of the free
4587 pure_bytes_used_non_lisp
+= size
;
4588 result
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4590 pure_bytes_used
= pure_bytes_used_lisp
+ pure_bytes_used_non_lisp
;
4592 if (pure_bytes_used
<= pure_size
)
4595 /* Don't allocate a large amount here,
4596 because it might get mmap'd and then its address
4597 might not be usable. */
4598 purebeg
= (char *) xmalloc (10000);
4600 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
4601 pure_bytes_used
= 0;
4602 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
4607 /* Print a warning if PURESIZE is too small. */
4610 check_pure_size (void)
4612 if (pure_bytes_used_before_overflow
)
4613 message (("emacs:0:Pure Lisp storage overflow (approx. %"pI
"d"
4615 pure_bytes_used
+ pure_bytes_used_before_overflow
);
4619 /* Find the byte sequence {DATA[0], ..., DATA[NBYTES-1], '\0'} from
4620 the non-Lisp data pool of the pure storage, and return its start
4621 address. Return NULL if not found. */
4624 find_string_data_in_pure (const char *data
, EMACS_INT nbytes
)
4627 EMACS_INT skip
, bm_skip
[256], last_char_skip
, infinity
, start
, start_max
;
4628 const unsigned char *p
;
4631 if (pure_bytes_used_non_lisp
< nbytes
+ 1)
4634 /* Set up the Boyer-Moore table. */
4636 for (i
= 0; i
< 256; i
++)
4639 p
= (const unsigned char *) data
;
4641 bm_skip
[*p
++] = skip
;
4643 last_char_skip
= bm_skip
['\0'];
4645 non_lisp_beg
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4646 start_max
= pure_bytes_used_non_lisp
- (nbytes
+ 1);
4648 /* See the comments in the function `boyer_moore' (search.c) for the
4649 use of `infinity'. */
4650 infinity
= pure_bytes_used_non_lisp
+ 1;
4651 bm_skip
['\0'] = infinity
;
4653 p
= (const unsigned char *) non_lisp_beg
+ nbytes
;
4657 /* Check the last character (== '\0'). */
4660 start
+= bm_skip
[*(p
+ start
)];
4662 while (start
<= start_max
);
4664 if (start
< infinity
)
4665 /* Couldn't find the last character. */
4668 /* No less than `infinity' means we could find the last
4669 character at `p[start - infinity]'. */
4672 /* Check the remaining characters. */
4673 if (memcmp (data
, non_lisp_beg
+ start
, nbytes
) == 0)
4675 return non_lisp_beg
+ start
;
4677 start
+= last_char_skip
;
4679 while (start
<= start_max
);
4685 /* Return a string allocated in pure space. DATA is a buffer holding
4686 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
4687 non-zero means make the result string multibyte.
4689 Must get an error if pure storage is full, since if it cannot hold
4690 a large string it may be able to hold conses that point to that
4691 string; then the string is not protected from gc. */
4694 make_pure_string (const char *data
,
4695 EMACS_INT nchars
, EMACS_INT nbytes
, int multibyte
)
4698 struct Lisp_String
*s
;
4700 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4701 s
->data
= (unsigned char *) find_string_data_in_pure (data
, nbytes
);
4702 if (s
->data
== NULL
)
4704 s
->data
= (unsigned char *) pure_alloc (nbytes
+ 1, -1);
4705 memcpy (s
->data
, data
, nbytes
);
4706 s
->data
[nbytes
] = '\0';
4709 s
->size_byte
= multibyte
? nbytes
: -1;
4710 s
->intervals
= NULL_INTERVAL
;
4711 XSETSTRING (string
, s
);
4715 /* Return a string a string allocated in pure space. Do not allocate
4716 the string data, just point to DATA. */
4719 make_pure_c_string (const char *data
)
4722 struct Lisp_String
*s
;
4723 EMACS_INT nchars
= strlen (data
);
4725 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4728 s
->data
= (unsigned char *) data
;
4729 s
->intervals
= NULL_INTERVAL
;
4730 XSETSTRING (string
, s
);
4734 /* Return a cons allocated from pure space. Give it pure copies
4735 of CAR as car and CDR as cdr. */
4738 pure_cons (Lisp_Object car
, Lisp_Object cdr
)
4740 register Lisp_Object
new;
4741 struct Lisp_Cons
*p
;
4743 p
= (struct Lisp_Cons
*) pure_alloc (sizeof *p
, Lisp_Cons
);
4745 XSETCAR (new, Fpurecopy (car
));
4746 XSETCDR (new, Fpurecopy (cdr
));
4751 /* Value is a float object with value NUM allocated from pure space. */
4754 make_pure_float (double num
)
4756 register Lisp_Object
new;
4757 struct Lisp_Float
*p
;
4759 p
= (struct Lisp_Float
*) pure_alloc (sizeof *p
, Lisp_Float
);
4761 XFLOAT_INIT (new, num
);
4766 /* Return a vector with room for LEN Lisp_Objects allocated from
4770 make_pure_vector (EMACS_INT len
)
4773 struct Lisp_Vector
*p
;
4774 size_t size
= (offsetof (struct Lisp_Vector
, contents
)
4775 + len
* sizeof (Lisp_Object
));
4777 p
= (struct Lisp_Vector
*) pure_alloc (size
, Lisp_Vectorlike
);
4778 XSETVECTOR (new, p
);
4779 XVECTOR (new)->header
.size
= len
;
4784 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
4785 doc
: /* Make a copy of object OBJ in pure storage.
4786 Recursively copies contents of vectors and cons cells.
4787 Does not copy symbols. Copies strings without text properties. */)
4788 (register Lisp_Object obj
)
4790 if (NILP (Vpurify_flag
))
4793 if (PURE_POINTER_P (XPNTR (obj
)))
4796 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
4798 Lisp_Object tmp
= Fgethash (obj
, Vpurify_flag
, Qnil
);
4804 obj
= pure_cons (XCAR (obj
), XCDR (obj
));
4805 else if (FLOATP (obj
))
4806 obj
= make_pure_float (XFLOAT_DATA (obj
));
4807 else if (STRINGP (obj
))
4808 obj
= make_pure_string (SSDATA (obj
), SCHARS (obj
),
4810 STRING_MULTIBYTE (obj
));
4811 else if (COMPILEDP (obj
) || VECTORP (obj
))
4813 register struct Lisp_Vector
*vec
;
4814 register EMACS_INT i
;
4818 if (size
& PSEUDOVECTOR_FLAG
)
4819 size
&= PSEUDOVECTOR_SIZE_MASK
;
4820 vec
= XVECTOR (make_pure_vector (size
));
4821 for (i
= 0; i
< size
; i
++)
4822 vec
->contents
[i
] = Fpurecopy (XVECTOR (obj
)->contents
[i
]);
4823 if (COMPILEDP (obj
))
4825 XSETPVECTYPE (vec
, PVEC_COMPILED
);
4826 XSETCOMPILED (obj
, vec
);
4829 XSETVECTOR (obj
, vec
);
4831 else if (MARKERP (obj
))
4832 error ("Attempt to copy a marker to pure storage");
4834 /* Not purified, don't hash-cons. */
4837 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
4838 Fputhash (obj
, obj
, Vpurify_flag
);
4845 /***********************************************************************
4847 ***********************************************************************/
4849 /* Put an entry in staticvec, pointing at the variable with address
4853 staticpro (Lisp_Object
*varaddress
)
4855 staticvec
[staticidx
++] = varaddress
;
4856 if (staticidx
>= NSTATICS
)
4861 /***********************************************************************
4863 ***********************************************************************/
4865 /* Temporarily prevent garbage collection. */
4868 inhibit_garbage_collection (void)
4870 int count
= SPECPDL_INDEX ();
4871 int nbits
= min (VALBITS
, BITS_PER_INT
);
4873 specbind (Qgc_cons_threshold
, make_number (((EMACS_INT
) 1 << (nbits
- 1)) - 1));
4878 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
4879 doc
: /* Reclaim storage for Lisp objects no longer needed.
4880 Garbage collection happens automatically if you cons more than
4881 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
4882 `garbage-collect' normally returns a list with info on amount of space in use:
4883 ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)
4884 (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS
4885 (USED-FLOATS . FREE-FLOATS) (USED-INTERVALS . FREE-INTERVALS)
4886 (USED-STRINGS . FREE-STRINGS))
4887 However, if there was overflow in pure space, `garbage-collect'
4888 returns nil, because real GC can't be done. */)
4891 register struct specbinding
*bind
;
4892 char stack_top_variable
;
4895 Lisp_Object total
[8];
4896 int count
= SPECPDL_INDEX ();
4897 EMACS_TIME t1
, t2
, t3
;
4902 /* Can't GC if pure storage overflowed because we can't determine
4903 if something is a pure object or not. */
4904 if (pure_bytes_used_before_overflow
)
4909 /* Don't keep undo information around forever.
4910 Do this early on, so it is no problem if the user quits. */
4912 register struct buffer
*nextb
= all_buffers
;
4916 /* If a buffer's undo list is Qt, that means that undo is
4917 turned off in that buffer. Calling truncate_undo_list on
4918 Qt tends to return NULL, which effectively turns undo back on.
4919 So don't call truncate_undo_list if undo_list is Qt. */
4920 if (! NILP (nextb
->BUFFER_INTERNAL_FIELD (name
)) && ! EQ (nextb
->BUFFER_INTERNAL_FIELD (undo_list
), Qt
))
4921 truncate_undo_list (nextb
);
4923 /* Shrink buffer gaps, but skip indirect and dead buffers. */
4924 if (nextb
->base_buffer
== 0 && !NILP (nextb
->BUFFER_INTERNAL_FIELD (name
))
4925 && ! nextb
->text
->inhibit_shrinking
)
4927 /* If a buffer's gap size is more than 10% of the buffer
4928 size, or larger than 2000 bytes, then shrink it
4929 accordingly. Keep a minimum size of 20 bytes. */
4930 int size
= min (2000, max (20, (nextb
->text
->z_byte
/ 10)));
4932 if (nextb
->text
->gap_size
> size
)
4934 struct buffer
*save_current
= current_buffer
;
4935 current_buffer
= nextb
;
4936 make_gap (-(nextb
->text
->gap_size
- size
));
4937 current_buffer
= save_current
;
4941 nextb
= nextb
->header
.next
.buffer
;
4945 EMACS_GET_TIME (t1
);
4947 /* In case user calls debug_print during GC,
4948 don't let that cause a recursive GC. */
4949 consing_since_gc
= 0;
4951 /* Save what's currently displayed in the echo area. */
4952 message_p
= push_message ();
4953 record_unwind_protect (pop_message_unwind
, Qnil
);
4955 /* Save a copy of the contents of the stack, for debugging. */
4956 #if MAX_SAVE_STACK > 0
4957 if (NILP (Vpurify_flag
))
4961 if (&stack_top_variable
< stack_bottom
)
4963 stack
= &stack_top_variable
;
4964 stack_size
= stack_bottom
- &stack_top_variable
;
4968 stack
= stack_bottom
;
4969 stack_size
= &stack_top_variable
- stack_bottom
;
4971 if (stack_size
<= MAX_SAVE_STACK
)
4973 if (stack_copy_size
< stack_size
)
4975 stack_copy
= (char *) xrealloc (stack_copy
, stack_size
);
4976 stack_copy_size
= stack_size
;
4978 memcpy (stack_copy
, stack
, stack_size
);
4981 #endif /* MAX_SAVE_STACK > 0 */
4983 if (garbage_collection_messages
)
4984 message1_nolog ("Garbage collecting...");
4988 shrink_regexp_cache ();
4992 /* clear_marks (); */
4994 /* Mark all the special slots that serve as the roots of accessibility. */
4996 for (i
= 0; i
< staticidx
; i
++)
4997 mark_object (*staticvec
[i
]);
4999 for (bind
= specpdl
; bind
!= specpdl_ptr
; bind
++)
5001 mark_object (bind
->symbol
);
5002 mark_object (bind
->old_value
);
5010 extern void xg_mark_data (void);
5015 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
5016 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
5020 register struct gcpro
*tail
;
5021 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
5022 for (i
= 0; i
< tail
->nvars
; i
++)
5023 mark_object (tail
->var
[i
]);
5027 struct catchtag
*catch;
5028 struct handler
*handler
;
5030 for (catch = catchlist
; catch; catch = catch->next
)
5032 mark_object (catch->tag
);
5033 mark_object (catch->val
);
5035 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
5037 mark_object (handler
->handler
);
5038 mark_object (handler
->var
);
5044 #ifdef HAVE_WINDOW_SYSTEM
5045 mark_fringe_data ();
5048 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5052 /* Everything is now marked, except for the things that require special
5053 finalization, i.e. the undo_list.
5054 Look thru every buffer's undo list
5055 for elements that update markers that were not marked,
5058 register struct buffer
*nextb
= all_buffers
;
5062 /* If a buffer's undo list is Qt, that means that undo is
5063 turned off in that buffer. Calling truncate_undo_list on
5064 Qt tends to return NULL, which effectively turns undo back on.
5065 So don't call truncate_undo_list if undo_list is Qt. */
5066 if (! EQ (nextb
->BUFFER_INTERNAL_FIELD (undo_list
), Qt
))
5068 Lisp_Object tail
, prev
;
5069 tail
= nextb
->BUFFER_INTERNAL_FIELD (undo_list
);
5071 while (CONSP (tail
))
5073 if (CONSP (XCAR (tail
))
5074 && MARKERP (XCAR (XCAR (tail
)))
5075 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
5078 nextb
->BUFFER_INTERNAL_FIELD (undo_list
) = tail
= XCDR (tail
);
5082 XSETCDR (prev
, tail
);
5092 /* Now that we have stripped the elements that need not be in the
5093 undo_list any more, we can finally mark the list. */
5094 mark_object (nextb
->BUFFER_INTERNAL_FIELD (undo_list
));
5096 nextb
= nextb
->header
.next
.buffer
;
5102 /* Clear the mark bits that we set in certain root slots. */
5104 unmark_byte_stack ();
5105 VECTOR_UNMARK (&buffer_defaults
);
5106 VECTOR_UNMARK (&buffer_local_symbols
);
5108 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
5116 /* clear_marks (); */
5119 consing_since_gc
= 0;
5120 if (gc_cons_threshold
< 10000)
5121 gc_cons_threshold
= 10000;
5123 if (FLOATP (Vgc_cons_percentage
))
5124 { /* Set gc_cons_combined_threshold. */
5127 tot
+= total_conses
* sizeof (struct Lisp_Cons
);
5128 tot
+= total_symbols
* sizeof (struct Lisp_Symbol
);
5129 tot
+= total_markers
* sizeof (union Lisp_Misc
);
5130 tot
+= total_string_size
;
5131 tot
+= total_vector_size
* sizeof (Lisp_Object
);
5132 tot
+= total_floats
* sizeof (struct Lisp_Float
);
5133 tot
+= total_intervals
* sizeof (struct interval
);
5134 tot
+= total_strings
* sizeof (struct Lisp_String
);
5136 gc_relative_threshold
= tot
* XFLOAT_DATA (Vgc_cons_percentage
);
5139 gc_relative_threshold
= 0;
5141 if (garbage_collection_messages
)
5143 if (message_p
|| minibuf_level
> 0)
5146 message1_nolog ("Garbage collecting...done");
5149 unbind_to (count
, Qnil
);
5151 total
[0] = Fcons (make_number (total_conses
),
5152 make_number (total_free_conses
));
5153 total
[1] = Fcons (make_number (total_symbols
),
5154 make_number (total_free_symbols
));
5155 total
[2] = Fcons (make_number (total_markers
),
5156 make_number (total_free_markers
));
5157 total
[3] = make_number (total_string_size
);
5158 total
[4] = make_number (total_vector_size
);
5159 total
[5] = Fcons (make_number (total_floats
),
5160 make_number (total_free_floats
));
5161 total
[6] = Fcons (make_number (total_intervals
),
5162 make_number (total_free_intervals
));
5163 total
[7] = Fcons (make_number (total_strings
),
5164 make_number (total_free_strings
));
5166 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5168 /* Compute average percentage of zombies. */
5171 for (i
= 0; i
< 7; ++i
)
5172 if (CONSP (total
[i
]))
5173 nlive
+= XFASTINT (XCAR (total
[i
]));
5175 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
5176 max_live
= max (nlive
, max_live
);
5177 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
5178 max_zombies
= max (nzombies
, max_zombies
);
5183 if (!NILP (Vpost_gc_hook
))
5185 int gc_count
= inhibit_garbage_collection ();
5186 safe_run_hooks (Qpost_gc_hook
);
5187 unbind_to (gc_count
, Qnil
);
5190 /* Accumulate statistics. */
5191 EMACS_GET_TIME (t2
);
5192 EMACS_SUB_TIME (t3
, t2
, t1
);
5193 if (FLOATP (Vgc_elapsed
))
5194 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
) +
5196 EMACS_USECS (t3
) * 1.0e-6);
5199 return Flist (sizeof total
/ sizeof *total
, total
);
5203 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
5204 only interesting objects referenced from glyphs are strings. */
5207 mark_glyph_matrix (struct glyph_matrix
*matrix
)
5209 struct glyph_row
*row
= matrix
->rows
;
5210 struct glyph_row
*end
= row
+ matrix
->nrows
;
5212 for (; row
< end
; ++row
)
5216 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
5218 struct glyph
*glyph
= row
->glyphs
[area
];
5219 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
5221 for (; glyph
< end_glyph
; ++glyph
)
5222 if (STRINGP (glyph
->object
)
5223 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
5224 mark_object (glyph
->object
);
5230 /* Mark Lisp faces in the face cache C. */
5233 mark_face_cache (struct face_cache
*c
)
5238 for (i
= 0; i
< c
->used
; ++i
)
5240 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
5244 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
5245 mark_object (face
->lface
[j
]);
5253 /* Mark reference to a Lisp_Object.
5254 If the object referred to has not been seen yet, recursively mark
5255 all the references contained in it. */
5257 #define LAST_MARKED_SIZE 500
5258 static Lisp_Object last_marked
[LAST_MARKED_SIZE
];
5259 static int last_marked_index
;
5261 /* For debugging--call abort when we cdr down this many
5262 links of a list, in mark_object. In debugging,
5263 the call to abort will hit a breakpoint.
5264 Normally this is zero and the check never goes off. */
5265 static size_t mark_object_loop_halt
;
5268 mark_vectorlike (struct Lisp_Vector
*ptr
)
5270 register EMACS_UINT size
= ptr
->header
.size
;
5271 register EMACS_UINT i
;
5273 eassert (!VECTOR_MARKED_P (ptr
));
5274 VECTOR_MARK (ptr
); /* Else mark it */
5275 if (size
& PSEUDOVECTOR_FLAG
)
5276 size
&= PSEUDOVECTOR_SIZE_MASK
;
5278 /* Note that this size is not the memory-footprint size, but only
5279 the number of Lisp_Object fields that we should trace.
5280 The distinction is used e.g. by Lisp_Process which places extra
5281 non-Lisp_Object fields at the end of the structure. */
5282 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5283 mark_object (ptr
->contents
[i
]);
5286 /* Like mark_vectorlike but optimized for char-tables (and
5287 sub-char-tables) assuming that the contents are mostly integers or
5291 mark_char_table (struct Lisp_Vector
*ptr
)
5293 register EMACS_UINT size
= ptr
->header
.size
& PSEUDOVECTOR_SIZE_MASK
;
5294 register EMACS_UINT i
;
5296 eassert (!VECTOR_MARKED_P (ptr
));
5298 for (i
= 0; i
< size
; i
++)
5300 Lisp_Object val
= ptr
->contents
[i
];
5302 if (INTEGERP (val
) || (SYMBOLP (val
) && XSYMBOL (val
)->gcmarkbit
))
5304 if (SUB_CHAR_TABLE_P (val
))
5306 if (! VECTOR_MARKED_P (XVECTOR (val
)))
5307 mark_char_table (XVECTOR (val
));
5315 mark_object (Lisp_Object arg
)
5317 register Lisp_Object obj
= arg
;
5318 #ifdef GC_CHECK_MARKED_OBJECTS
5322 size_t cdr_count
= 0;
5326 if (PURE_POINTER_P (XPNTR (obj
)))
5329 last_marked
[last_marked_index
++] = obj
;
5330 if (last_marked_index
== LAST_MARKED_SIZE
)
5331 last_marked_index
= 0;
5333 /* Perform some sanity checks on the objects marked here. Abort if
5334 we encounter an object we know is bogus. This increases GC time
5335 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
5336 #ifdef GC_CHECK_MARKED_OBJECTS
5338 po
= (void *) XPNTR (obj
);
5340 /* Check that the object pointed to by PO is known to be a Lisp
5341 structure allocated from the heap. */
5342 #define CHECK_ALLOCATED() \
5344 m = mem_find (po); \
5349 /* Check that the object pointed to by PO is live, using predicate
5351 #define CHECK_LIVE(LIVEP) \
5353 if (!LIVEP (m, po)) \
5357 /* Check both of the above conditions. */
5358 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
5360 CHECK_ALLOCATED (); \
5361 CHECK_LIVE (LIVEP); \
5364 #else /* not GC_CHECK_MARKED_OBJECTS */
5366 #define CHECK_LIVE(LIVEP) (void) 0
5367 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
5369 #endif /* not GC_CHECK_MARKED_OBJECTS */
5371 switch (SWITCH_ENUM_CAST (XTYPE (obj
)))
5375 register struct Lisp_String
*ptr
= XSTRING (obj
);
5376 if (STRING_MARKED_P (ptr
))
5378 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
5379 MARK_INTERVAL_TREE (ptr
->intervals
);
5381 #ifdef GC_CHECK_STRING_BYTES
5382 /* Check that the string size recorded in the string is the
5383 same as the one recorded in the sdata structure. */
5384 CHECK_STRING_BYTES (ptr
);
5385 #endif /* GC_CHECK_STRING_BYTES */
5389 case Lisp_Vectorlike
:
5390 if (VECTOR_MARKED_P (XVECTOR (obj
)))
5392 #ifdef GC_CHECK_MARKED_OBJECTS
5394 if (m
== MEM_NIL
&& !SUBRP (obj
)
5395 && po
!= &buffer_defaults
5396 && po
!= &buffer_local_symbols
)
5398 #endif /* GC_CHECK_MARKED_OBJECTS */
5402 #ifdef GC_CHECK_MARKED_OBJECTS
5403 if (po
!= &buffer_defaults
&& po
!= &buffer_local_symbols
)
5406 for (b
= all_buffers
; b
&& b
!= po
; b
= b
->header
.next
.buffer
)
5411 #endif /* GC_CHECK_MARKED_OBJECTS */
5414 else if (SUBRP (obj
))
5416 else if (COMPILEDP (obj
))
5417 /* We could treat this just like a vector, but it is better to
5418 save the COMPILED_CONSTANTS element for last and avoid
5421 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5422 register EMACS_UINT size
= ptr
->header
.size
;
5423 register EMACS_UINT i
;
5425 CHECK_LIVE (live_vector_p
);
5426 VECTOR_MARK (ptr
); /* Else mark it */
5427 size
&= PSEUDOVECTOR_SIZE_MASK
;
5428 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5430 if (i
!= COMPILED_CONSTANTS
)
5431 mark_object (ptr
->contents
[i
]);
5433 obj
= ptr
->contents
[COMPILED_CONSTANTS
];
5436 else if (FRAMEP (obj
))
5438 register struct frame
*ptr
= XFRAME (obj
);
5439 mark_vectorlike (XVECTOR (obj
));
5440 mark_face_cache (ptr
->face_cache
);
5442 else if (WINDOWP (obj
))
5444 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5445 struct window
*w
= XWINDOW (obj
);
5446 mark_vectorlike (ptr
);
5447 /* Mark glyphs for leaf windows. Marking window matrices is
5448 sufficient because frame matrices use the same glyph
5450 if (NILP (w
->hchild
)
5452 && w
->current_matrix
)
5454 mark_glyph_matrix (w
->current_matrix
);
5455 mark_glyph_matrix (w
->desired_matrix
);
5458 else if (HASH_TABLE_P (obj
))
5460 struct Lisp_Hash_Table
*h
= XHASH_TABLE (obj
);
5461 mark_vectorlike ((struct Lisp_Vector
*)h
);
5462 /* If hash table is not weak, mark all keys and values.
5463 For weak tables, mark only the vector. */
5465 mark_object (h
->key_and_value
);
5467 VECTOR_MARK (XVECTOR (h
->key_and_value
));
5469 else if (CHAR_TABLE_P (obj
))
5470 mark_char_table (XVECTOR (obj
));
5472 mark_vectorlike (XVECTOR (obj
));
5477 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
5478 struct Lisp_Symbol
*ptrx
;
5482 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
5484 mark_object (ptr
->function
);
5485 mark_object (ptr
->plist
);
5486 switch (ptr
->redirect
)
5488 case SYMBOL_PLAINVAL
: mark_object (SYMBOL_VAL (ptr
)); break;
5489 case SYMBOL_VARALIAS
:
5492 XSETSYMBOL (tem
, SYMBOL_ALIAS (ptr
));
5496 case SYMBOL_LOCALIZED
:
5498 struct Lisp_Buffer_Local_Value
*blv
= SYMBOL_BLV (ptr
);
5499 /* If the value is forwarded to a buffer or keyboard field,
5500 these are marked when we see the corresponding object.
5501 And if it's forwarded to a C variable, either it's not
5502 a Lisp_Object var, or it's staticpro'd already. */
5503 mark_object (blv
->where
);
5504 mark_object (blv
->valcell
);
5505 mark_object (blv
->defcell
);
5508 case SYMBOL_FORWARDED
:
5509 /* If the value is forwarded to a buffer or keyboard field,
5510 these are marked when we see the corresponding object.
5511 And if it's forwarded to a C variable, either it's not
5512 a Lisp_Object var, or it's staticpro'd already. */
5516 if (!PURE_POINTER_P (XSTRING (ptr
->xname
)))
5517 MARK_STRING (XSTRING (ptr
->xname
));
5518 MARK_INTERVAL_TREE (STRING_INTERVALS (ptr
->xname
));
5523 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun */
5524 XSETSYMBOL (obj
, ptrx
);
5531 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
5532 if (XMISCANY (obj
)->gcmarkbit
)
5534 XMISCANY (obj
)->gcmarkbit
= 1;
5536 switch (XMISCTYPE (obj
))
5539 case Lisp_Misc_Marker
:
5540 /* DO NOT mark thru the marker's chain.
5541 The buffer's markers chain does not preserve markers from gc;
5542 instead, markers are removed from the chain when freed by gc. */
5545 case Lisp_Misc_Save_Value
:
5548 register struct Lisp_Save_Value
*ptr
= XSAVE_VALUE (obj
);
5549 /* If DOGC is set, POINTER is the address of a memory
5550 area containing INTEGER potential Lisp_Objects. */
5553 Lisp_Object
*p
= (Lisp_Object
*) ptr
->pointer
;
5555 for (nelt
= ptr
->integer
; nelt
> 0; nelt
--, p
++)
5556 mark_maybe_object (*p
);
5562 case Lisp_Misc_Overlay
:
5564 struct Lisp_Overlay
*ptr
= XOVERLAY (obj
);
5565 mark_object (ptr
->start
);
5566 mark_object (ptr
->end
);
5567 mark_object (ptr
->plist
);
5570 XSETMISC (obj
, ptr
->next
);
5583 register struct Lisp_Cons
*ptr
= XCONS (obj
);
5584 if (CONS_MARKED_P (ptr
))
5586 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
5588 /* If the cdr is nil, avoid recursion for the car. */
5589 if (EQ (ptr
->u
.cdr
, Qnil
))
5595 mark_object (ptr
->car
);
5598 if (cdr_count
== mark_object_loop_halt
)
5604 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
5605 FLOAT_MARK (XFLOAT (obj
));
5616 #undef CHECK_ALLOCATED
5617 #undef CHECK_ALLOCATED_AND_LIVE
5620 /* Mark the pointers in a buffer structure. */
5623 mark_buffer (Lisp_Object buf
)
5625 register struct buffer
*buffer
= XBUFFER (buf
);
5626 register Lisp_Object
*ptr
, tmp
;
5627 Lisp_Object base_buffer
;
5629 eassert (!VECTOR_MARKED_P (buffer
));
5630 VECTOR_MARK (buffer
);
5632 MARK_INTERVAL_TREE (BUF_INTERVALS (buffer
));
5634 /* For now, we just don't mark the undo_list. It's done later in
5635 a special way just before the sweep phase, and after stripping
5636 some of its elements that are not needed any more. */
5638 if (buffer
->overlays_before
)
5640 XSETMISC (tmp
, buffer
->overlays_before
);
5643 if (buffer
->overlays_after
)
5645 XSETMISC (tmp
, buffer
->overlays_after
);
5649 /* buffer-local Lisp variables start at `undo_list',
5650 tho only the ones from `name' on are GC'd normally. */
5651 for (ptr
= &buffer
->BUFFER_INTERNAL_FIELD (name
);
5652 (char *)ptr
< (char *)buffer
+ sizeof (struct buffer
);
5656 /* If this is an indirect buffer, mark its base buffer. */
5657 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
5659 XSETBUFFER (base_buffer
, buffer
->base_buffer
);
5660 mark_buffer (base_buffer
);
5664 /* Mark the Lisp pointers in the terminal objects.
5665 Called by the Fgarbage_collector. */
5668 mark_terminals (void)
5671 for (t
= terminal_list
; t
; t
= t
->next_terminal
)
5673 eassert (t
->name
!= NULL
);
5674 #ifdef HAVE_WINDOW_SYSTEM
5675 /* If a terminal object is reachable from a stacpro'ed object,
5676 it might have been marked already. Make sure the image cache
5678 mark_image_cache (t
->image_cache
);
5679 #endif /* HAVE_WINDOW_SYSTEM */
5680 if (!VECTOR_MARKED_P (t
))
5681 mark_vectorlike ((struct Lisp_Vector
*)t
);
5687 /* Value is non-zero if OBJ will survive the current GC because it's
5688 either marked or does not need to be marked to survive. */
5691 survives_gc_p (Lisp_Object obj
)
5695 switch (XTYPE (obj
))
5702 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
5706 survives_p
= XMISCANY (obj
)->gcmarkbit
;
5710 survives_p
= STRING_MARKED_P (XSTRING (obj
));
5713 case Lisp_Vectorlike
:
5714 survives_p
= SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
5718 survives_p
= CONS_MARKED_P (XCONS (obj
));
5722 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
5729 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
5734 /* Sweep: find all structures not marked, and free them. */
5739 /* Remove or mark entries in weak hash tables.
5740 This must be done before any object is unmarked. */
5741 sweep_weak_hash_tables ();
5744 #ifdef GC_CHECK_STRING_BYTES
5745 if (!noninteractive
)
5746 check_string_bytes (1);
5749 /* Put all unmarked conses on free list */
5751 register struct cons_block
*cblk
;
5752 struct cons_block
**cprev
= &cons_block
;
5753 register int lim
= cons_block_index
;
5754 register int num_free
= 0, num_used
= 0;
5758 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
5762 int ilim
= (lim
+ BITS_PER_INT
- 1) / BITS_PER_INT
;
5764 /* Scan the mark bits an int at a time. */
5765 for (i
= 0; i
<= ilim
; i
++)
5767 if (cblk
->gcmarkbits
[i
] == -1)
5769 /* Fast path - all cons cells for this int are marked. */
5770 cblk
->gcmarkbits
[i
] = 0;
5771 num_used
+= BITS_PER_INT
;
5775 /* Some cons cells for this int are not marked.
5776 Find which ones, and free them. */
5777 int start
, pos
, stop
;
5779 start
= i
* BITS_PER_INT
;
5781 if (stop
> BITS_PER_INT
)
5782 stop
= BITS_PER_INT
;
5785 for (pos
= start
; pos
< stop
; pos
++)
5787 if (!CONS_MARKED_P (&cblk
->conses
[pos
]))
5790 cblk
->conses
[pos
].u
.chain
= cons_free_list
;
5791 cons_free_list
= &cblk
->conses
[pos
];
5793 cons_free_list
->car
= Vdead
;
5799 CONS_UNMARK (&cblk
->conses
[pos
]);
5805 lim
= CONS_BLOCK_SIZE
;
5806 /* If this block contains only free conses and we have already
5807 seen more than two blocks worth of free conses then deallocate
5809 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
5811 *cprev
= cblk
->next
;
5812 /* Unhook from the free list. */
5813 cons_free_list
= cblk
->conses
[0].u
.chain
;
5814 lisp_align_free (cblk
);
5819 num_free
+= this_free
;
5820 cprev
= &cblk
->next
;
5823 total_conses
= num_used
;
5824 total_free_conses
= num_free
;
5827 /* Put all unmarked floats on free list */
5829 register struct float_block
*fblk
;
5830 struct float_block
**fprev
= &float_block
;
5831 register int lim
= float_block_index
;
5832 register int num_free
= 0, num_used
= 0;
5834 float_free_list
= 0;
5836 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
5840 for (i
= 0; i
< lim
; i
++)
5841 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
5844 fblk
->floats
[i
].u
.chain
= float_free_list
;
5845 float_free_list
= &fblk
->floats
[i
];
5850 FLOAT_UNMARK (&fblk
->floats
[i
]);
5852 lim
= FLOAT_BLOCK_SIZE
;
5853 /* If this block contains only free floats and we have already
5854 seen more than two blocks worth of free floats then deallocate
5856 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
5858 *fprev
= fblk
->next
;
5859 /* Unhook from the free list. */
5860 float_free_list
= fblk
->floats
[0].u
.chain
;
5861 lisp_align_free (fblk
);
5866 num_free
+= this_free
;
5867 fprev
= &fblk
->next
;
5870 total_floats
= num_used
;
5871 total_free_floats
= num_free
;
5874 /* Put all unmarked intervals on free list */
5876 register struct interval_block
*iblk
;
5877 struct interval_block
**iprev
= &interval_block
;
5878 register int lim
= interval_block_index
;
5879 register int num_free
= 0, num_used
= 0;
5881 interval_free_list
= 0;
5883 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
5888 for (i
= 0; i
< lim
; i
++)
5890 if (!iblk
->intervals
[i
].gcmarkbit
)
5892 SET_INTERVAL_PARENT (&iblk
->intervals
[i
], interval_free_list
);
5893 interval_free_list
= &iblk
->intervals
[i
];
5899 iblk
->intervals
[i
].gcmarkbit
= 0;
5902 lim
= INTERVAL_BLOCK_SIZE
;
5903 /* If this block contains only free intervals and we have already
5904 seen more than two blocks worth of free intervals then
5905 deallocate this block. */
5906 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
5908 *iprev
= iblk
->next
;
5909 /* Unhook from the free list. */
5910 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
5912 n_interval_blocks
--;
5916 num_free
+= this_free
;
5917 iprev
= &iblk
->next
;
5920 total_intervals
= num_used
;
5921 total_free_intervals
= num_free
;
5924 /* Put all unmarked symbols on free list */
5926 register struct symbol_block
*sblk
;
5927 struct symbol_block
**sprev
= &symbol_block
;
5928 register int lim
= symbol_block_index
;
5929 register int num_free
= 0, num_used
= 0;
5931 symbol_free_list
= NULL
;
5933 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
5936 struct Lisp_Symbol
*sym
= sblk
->symbols
;
5937 struct Lisp_Symbol
*end
= sym
+ lim
;
5939 for (; sym
< end
; ++sym
)
5941 /* Check if the symbol was created during loadup. In such a case
5942 it might be pointed to by pure bytecode which we don't trace,
5943 so we conservatively assume that it is live. */
5944 int pure_p
= PURE_POINTER_P (XSTRING (sym
->xname
));
5946 if (!sym
->gcmarkbit
&& !pure_p
)
5948 if (sym
->redirect
== SYMBOL_LOCALIZED
)
5949 xfree (SYMBOL_BLV (sym
));
5950 sym
->next
= symbol_free_list
;
5951 symbol_free_list
= sym
;
5953 symbol_free_list
->function
= Vdead
;
5961 UNMARK_STRING (XSTRING (sym
->xname
));
5966 lim
= SYMBOL_BLOCK_SIZE
;
5967 /* If this block contains only free symbols and we have already
5968 seen more than two blocks worth of free symbols then deallocate
5970 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
5972 *sprev
= sblk
->next
;
5973 /* Unhook from the free list. */
5974 symbol_free_list
= sblk
->symbols
[0].next
;
5980 num_free
+= this_free
;
5981 sprev
= &sblk
->next
;
5984 total_symbols
= num_used
;
5985 total_free_symbols
= num_free
;
5988 /* Put all unmarked misc's on free list.
5989 For a marker, first unchain it from the buffer it points into. */
5991 register struct marker_block
*mblk
;
5992 struct marker_block
**mprev
= &marker_block
;
5993 register int lim
= marker_block_index
;
5994 register int num_free
= 0, num_used
= 0;
5996 marker_free_list
= 0;
5998 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
6003 for (i
= 0; i
< lim
; i
++)
6005 if (!mblk
->markers
[i
].u_any
.gcmarkbit
)
6007 if (mblk
->markers
[i
].u_any
.type
== Lisp_Misc_Marker
)
6008 unchain_marker (&mblk
->markers
[i
].u_marker
);
6009 /* Set the type of the freed object to Lisp_Misc_Free.
6010 We could leave the type alone, since nobody checks it,
6011 but this might catch bugs faster. */
6012 mblk
->markers
[i
].u_marker
.type
= Lisp_Misc_Free
;
6013 mblk
->markers
[i
].u_free
.chain
= marker_free_list
;
6014 marker_free_list
= &mblk
->markers
[i
];
6020 mblk
->markers
[i
].u_any
.gcmarkbit
= 0;
6023 lim
= MARKER_BLOCK_SIZE
;
6024 /* If this block contains only free markers and we have already
6025 seen more than two blocks worth of free markers then deallocate
6027 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
6029 *mprev
= mblk
->next
;
6030 /* Unhook from the free list. */
6031 marker_free_list
= mblk
->markers
[0].u_free
.chain
;
6037 num_free
+= this_free
;
6038 mprev
= &mblk
->next
;
6042 total_markers
= num_used
;
6043 total_free_markers
= num_free
;
6046 /* Free all unmarked buffers */
6048 register struct buffer
*buffer
= all_buffers
, *prev
= 0, *next
;
6051 if (!VECTOR_MARKED_P (buffer
))
6054 prev
->header
.next
= buffer
->header
.next
;
6056 all_buffers
= buffer
->header
.next
.buffer
;
6057 next
= buffer
->header
.next
.buffer
;
6063 VECTOR_UNMARK (buffer
);
6064 UNMARK_BALANCE_INTERVALS (BUF_INTERVALS (buffer
));
6065 prev
= buffer
, buffer
= buffer
->header
.next
.buffer
;
6069 /* Free all unmarked vectors */
6071 register struct Lisp_Vector
*vector
= all_vectors
, *prev
= 0, *next
;
6072 total_vector_size
= 0;
6075 if (!VECTOR_MARKED_P (vector
))
6078 prev
->header
.next
= vector
->header
.next
;
6080 all_vectors
= vector
->header
.next
.vector
;
6081 next
= vector
->header
.next
.vector
;
6089 VECTOR_UNMARK (vector
);
6090 if (vector
->header
.size
& PSEUDOVECTOR_FLAG
)
6091 total_vector_size
+= PSEUDOVECTOR_SIZE_MASK
& vector
->header
.size
;
6093 total_vector_size
+= vector
->header
.size
;
6094 prev
= vector
, vector
= vector
->header
.next
.vector
;
6098 #ifdef GC_CHECK_STRING_BYTES
6099 if (!noninteractive
)
6100 check_string_bytes (1);
6107 /* Debugging aids. */
6109 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
6110 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
6111 This may be helpful in debugging Emacs's memory usage.
6112 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
6117 XSETINT (end
, (intptr_t) (char *) sbrk (0) / 1024);
6122 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
6123 doc
: /* Return a list of counters that measure how much consing there has been.
6124 Each of these counters increments for a certain kind of object.
6125 The counters wrap around from the largest positive integer to zero.
6126 Garbage collection does not decrease them.
6127 The elements of the value are as follows:
6128 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
6129 All are in units of 1 = one object consed
6130 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
6132 MISCS include overlays, markers, and some internal types.
6133 Frames, windows, buffers, and subprocesses count as vectors
6134 (but the contents of a buffer's text do not count here). */)
6137 Lisp_Object consed
[8];
6139 consed
[0] = make_number (min (MOST_POSITIVE_FIXNUM
, cons_cells_consed
));
6140 consed
[1] = make_number (min (MOST_POSITIVE_FIXNUM
, floats_consed
));
6141 consed
[2] = make_number (min (MOST_POSITIVE_FIXNUM
, vector_cells_consed
));
6142 consed
[3] = make_number (min (MOST_POSITIVE_FIXNUM
, symbols_consed
));
6143 consed
[4] = make_number (min (MOST_POSITIVE_FIXNUM
, string_chars_consed
));
6144 consed
[5] = make_number (min (MOST_POSITIVE_FIXNUM
, misc_objects_consed
));
6145 consed
[6] = make_number (min (MOST_POSITIVE_FIXNUM
, intervals_consed
));
6146 consed
[7] = make_number (min (MOST_POSITIVE_FIXNUM
, strings_consed
));
6148 return Flist (8, consed
);
6151 #ifdef ENABLE_CHECKING
6152 int suppress_checking
;
6155 die (const char *msg
, const char *file
, int line
)
6157 fprintf (stderr
, "\r\n%s:%d: Emacs fatal error: %s\r\n",
6163 /* Initialization */
6166 init_alloc_once (void)
6168 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
6170 pure_size
= PURESIZE
;
6171 pure_bytes_used
= 0;
6172 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
6173 pure_bytes_used_before_overflow
= 0;
6175 /* Initialize the list of free aligned blocks. */
6178 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
6180 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
6184 ignore_warnings
= 1;
6185 #ifdef DOUG_LEA_MALLOC
6186 mallopt (M_TRIM_THRESHOLD
, 128*1024); /* trim threshold */
6187 mallopt (M_MMAP_THRESHOLD
, 64*1024); /* mmap threshold */
6188 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* max. number of mmap'ed areas */
6196 init_weak_hash_tables ();
6199 malloc_hysteresis
= 32;
6201 malloc_hysteresis
= 0;
6204 refill_memory_reserve ();
6206 ignore_warnings
= 0;
6208 byte_stack_list
= 0;
6210 consing_since_gc
= 0;
6211 gc_cons_threshold
= 100000 * sizeof (Lisp_Object
);
6212 gc_relative_threshold
= 0;
6219 byte_stack_list
= 0;
6221 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
6222 setjmp_tested_p
= longjmps_done
= 0;
6225 Vgc_elapsed
= make_float (0.0);
6230 syms_of_alloc (void)
6232 DEFVAR_INT ("gc-cons-threshold", gc_cons_threshold
,
6233 doc
: /* *Number of bytes of consing between garbage collections.
6234 Garbage collection can happen automatically once this many bytes have been
6235 allocated since the last garbage collection. All data types count.
6237 Garbage collection happens automatically only when `eval' is called.
6239 By binding this temporarily to a large number, you can effectively
6240 prevent garbage collection during a part of the program.
6241 See also `gc-cons-percentage'. */);
6243 DEFVAR_LISP ("gc-cons-percentage", Vgc_cons_percentage
,
6244 doc
: /* *Portion of the heap used for allocation.
6245 Garbage collection can happen automatically once this portion of the heap
6246 has been allocated since the last garbage collection.
6247 If this portion is smaller than `gc-cons-threshold', this is ignored. */);
6248 Vgc_cons_percentage
= make_float (0.1);
6250 DEFVAR_INT ("pure-bytes-used", pure_bytes_used
,
6251 doc
: /* Number of bytes of sharable Lisp data allocated so far. */);
6253 DEFVAR_INT ("cons-cells-consed", cons_cells_consed
,
6254 doc
: /* Number of cons cells that have been consed so far. */);
6256 DEFVAR_INT ("floats-consed", floats_consed
,
6257 doc
: /* Number of floats that have been consed so far. */);
6259 DEFVAR_INT ("vector-cells-consed", vector_cells_consed
,
6260 doc
: /* Number of vector cells that have been consed so far. */);
6262 DEFVAR_INT ("symbols-consed", symbols_consed
,
6263 doc
: /* Number of symbols that have been consed so far. */);
6265 DEFVAR_INT ("string-chars-consed", string_chars_consed
,
6266 doc
: /* Number of string characters that have been consed so far. */);
6268 DEFVAR_INT ("misc-objects-consed", misc_objects_consed
,
6269 doc
: /* Number of miscellaneous objects that have been consed so far. */);
6271 DEFVAR_INT ("intervals-consed", intervals_consed
,
6272 doc
: /* Number of intervals that have been consed so far. */);
6274 DEFVAR_INT ("strings-consed", strings_consed
,
6275 doc
: /* Number of strings that have been consed so far. */);
6277 DEFVAR_LISP ("purify-flag", Vpurify_flag
,
6278 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
6279 This means that certain objects should be allocated in shared (pure) space.
6280 It can also be set to a hash-table, in which case this table is used to
6281 do hash-consing of the objects allocated to pure space. */);
6283 DEFVAR_BOOL ("garbage-collection-messages", garbage_collection_messages
,
6284 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
6285 garbage_collection_messages
= 0;
6287 DEFVAR_LISP ("post-gc-hook", Vpost_gc_hook
,
6288 doc
: /* Hook run after garbage collection has finished. */);
6289 Vpost_gc_hook
= Qnil
;
6290 Qpost_gc_hook
= intern_c_string ("post-gc-hook");
6291 staticpro (&Qpost_gc_hook
);
6293 DEFVAR_LISP ("memory-signal-data", Vmemory_signal_data
,
6294 doc
: /* Precomputed `signal' argument for memory-full error. */);
6295 /* We build this in advance because if we wait until we need it, we might
6296 not be able to allocate the memory to hold it. */
6298 = pure_cons (Qerror
,
6299 pure_cons (make_pure_c_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"), Qnil
));
6301 DEFVAR_LISP ("memory-full", Vmemory_full
,
6302 doc
: /* Non-nil means Emacs cannot get much more Lisp memory. */);
6303 Vmemory_full
= Qnil
;
6305 staticpro (&Qgc_cons_threshold
);
6306 Qgc_cons_threshold
= intern_c_string ("gc-cons-threshold");
6308 staticpro (&Qchar_table_extra_slots
);
6309 Qchar_table_extra_slots
= intern_c_string ("char-table-extra-slots");
6311 DEFVAR_LISP ("gc-elapsed", Vgc_elapsed
,
6312 doc
: /* Accumulated time elapsed in garbage collections.
6313 The time is in seconds as a floating point value. */);
6314 DEFVAR_INT ("gcs-done", gcs_done
,
6315 doc
: /* Accumulated number of garbage collections done. */);
6320 defsubr (&Smake_byte_code
);
6321 defsubr (&Smake_list
);
6322 defsubr (&Smake_vector
);
6323 defsubr (&Smake_string
);
6324 defsubr (&Smake_bool_vector
);
6325 defsubr (&Smake_symbol
);
6326 defsubr (&Smake_marker
);
6327 defsubr (&Spurecopy
);
6328 defsubr (&Sgarbage_collect
);
6329 defsubr (&Smemory_limit
);
6330 defsubr (&Smemory_use_counts
);
6332 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
6333 defsubr (&Sgc_status
);