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 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 #ifndef SYSTEM_MALLOC
194 /* Amount of spare memory to keep in large reserve block. */
196 #define SPARE_MEMORY (1 << 14)
199 /* Number of extra blocks malloc should get when it needs more core. */
201 static int malloc_hysteresis
;
203 /* Initialize it to a nonzero value to force it into data space
204 (rather than bss space). That way unexec will remap it into text
205 space (pure), on some systems. We have not implemented the
206 remapping on more recent systems because this is less important
207 nowadays than in the days of small memories and timesharing. */
209 #ifndef VIRT_ADDR_VARIES
212 EMACS_INT pure
[(PURESIZE
+ sizeof (EMACS_INT
) - 1) / sizeof (EMACS_INT
)] = {1,};
213 #define PUREBEG (char *) pure
215 /* Pointer to the pure area, and its size. */
217 static char *purebeg
;
218 static size_t pure_size
;
220 /* Number of bytes of pure storage used before pure storage overflowed.
221 If this is non-zero, this implies that an overflow occurred. */
223 static size_t pure_bytes_used_before_overflow
;
225 /* Value is non-zero if P points into pure space. */
227 #define PURE_POINTER_P(P) \
228 (((PNTR_COMPARISON_TYPE) (P) \
229 < (PNTR_COMPARISON_TYPE) ((char *) purebeg + pure_size)) \
230 && ((PNTR_COMPARISON_TYPE) (P) \
231 >= (PNTR_COMPARISON_TYPE) purebeg))
233 /* Index in pure at which next pure Lisp object will be allocated.. */
235 static EMACS_INT pure_bytes_used_lisp
;
237 /* Number of bytes allocated for non-Lisp objects in pure storage. */
239 static EMACS_INT pure_bytes_used_non_lisp
;
241 /* If nonzero, this is a warning delivered by malloc and not yet
244 const char *pending_malloc_warning
;
246 /* Maximum amount of C stack to save when a GC happens. */
248 #ifndef MAX_SAVE_STACK
249 #define MAX_SAVE_STACK 16000
252 /* Buffer in which we save a copy of the C stack at each GC. */
254 #if MAX_SAVE_STACK > 0
255 static char *stack_copy
;
256 static size_t stack_copy_size
;
259 /* Non-zero means ignore malloc warnings. Set during initialization.
260 Currently not used. */
262 static int ignore_warnings
;
264 static Lisp_Object Qgc_cons_threshold
;
265 Lisp_Object Qchar_table_extra_slots
;
267 /* Hook run after GC has finished. */
269 static Lisp_Object Qpost_gc_hook
;
271 static void mark_buffer (Lisp_Object
);
272 static void mark_terminals (void);
273 static void gc_sweep (void);
274 static void mark_glyph_matrix (struct glyph_matrix
*);
275 static void mark_face_cache (struct face_cache
*);
277 #if !defined REL_ALLOC || defined SYSTEM_MALLOC
278 static void refill_memory_reserve (void);
280 static struct Lisp_String
*allocate_string (void);
281 static void compact_small_strings (void);
282 static void free_large_strings (void);
283 static void sweep_strings (void);
284 static void free_misc (Lisp_Object
);
286 /* When scanning the C stack for live Lisp objects, Emacs keeps track
287 of what memory allocated via lisp_malloc is intended for what
288 purpose. This enumeration specifies the type of memory. */
299 /* We used to keep separate mem_types for subtypes of vectors such as
300 process, hash_table, frame, terminal, and window, but we never made
301 use of the distinction, so it only caused source-code complexity
302 and runtime slowdown. Minor but pointless. */
306 static POINTER_TYPE
*lisp_align_malloc (size_t, enum mem_type
);
307 static POINTER_TYPE
*lisp_malloc (size_t, enum mem_type
);
310 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
312 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
313 #include <stdio.h> /* For fprintf. */
316 /* A unique object in pure space used to make some Lisp objects
317 on free lists recognizable in O(1). */
319 static Lisp_Object Vdead
;
321 #ifdef GC_MALLOC_CHECK
323 enum mem_type allocated_mem_type
;
324 static int dont_register_blocks
;
326 #endif /* GC_MALLOC_CHECK */
328 /* A node in the red-black tree describing allocated memory containing
329 Lisp data. Each such block is recorded with its start and end
330 address when it is allocated, and removed from the tree when it
333 A red-black tree is a balanced binary tree with the following
336 1. Every node is either red or black.
337 2. Every leaf is black.
338 3. If a node is red, then both of its children are black.
339 4. Every simple path from a node to a descendant leaf contains
340 the same number of black nodes.
341 5. The root is always black.
343 When nodes are inserted into the tree, or deleted from the tree,
344 the tree is "fixed" so that these properties are always true.
346 A red-black tree with N internal nodes has height at most 2
347 log(N+1). Searches, insertions and deletions are done in O(log N).
348 Please see a text book about data structures for a detailed
349 description of red-black trees. Any book worth its salt should
354 /* Children of this node. These pointers are never NULL. When there
355 is no child, the value is MEM_NIL, which points to a dummy node. */
356 struct mem_node
*left
, *right
;
358 /* The parent of this node. In the root node, this is NULL. */
359 struct mem_node
*parent
;
361 /* Start and end of allocated region. */
365 enum {MEM_BLACK
, MEM_RED
} color
;
371 /* Base address of stack. Set in main. */
373 Lisp_Object
*stack_base
;
375 /* Root of the tree describing allocated Lisp memory. */
377 static struct mem_node
*mem_root
;
379 /* Lowest and highest known address in the heap. */
381 static void *min_heap_address
, *max_heap_address
;
383 /* Sentinel node of the tree. */
385 static struct mem_node mem_z
;
386 #define MEM_NIL &mem_z
388 static struct Lisp_Vector
*allocate_vectorlike (EMACS_INT
);
389 static void lisp_free (POINTER_TYPE
*);
390 static void mark_stack (void);
391 static int live_vector_p (struct mem_node
*, void *);
392 static int live_buffer_p (struct mem_node
*, void *);
393 static int live_string_p (struct mem_node
*, void *);
394 static int live_cons_p (struct mem_node
*, void *);
395 static int live_symbol_p (struct mem_node
*, void *);
396 static int live_float_p (struct mem_node
*, void *);
397 static int live_misc_p (struct mem_node
*, void *);
398 static void mark_maybe_object (Lisp_Object
);
399 static void mark_memory (void *, void *, int);
400 static void mem_init (void);
401 static struct mem_node
*mem_insert (void *, void *, enum mem_type
);
402 static void mem_insert_fixup (struct mem_node
*);
403 static void mem_rotate_left (struct mem_node
*);
404 static void mem_rotate_right (struct mem_node
*);
405 static void mem_delete (struct mem_node
*);
406 static void mem_delete_fixup (struct mem_node
*);
407 static inline struct mem_node
*mem_find (void *);
410 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
411 static void check_gcpros (void);
414 #endif /* GC_MARK_STACK || GC_MALLOC_CHECK */
416 /* Recording what needs to be marked for gc. */
418 struct gcpro
*gcprolist
;
420 /* Addresses of staticpro'd variables. Initialize it to a nonzero
421 value; otherwise some compilers put it into BSS. */
423 #define NSTATICS 0x640
424 static Lisp_Object
*staticvec
[NSTATICS
] = {&Vpurify_flag
};
426 /* Index of next unused slot in staticvec. */
428 static int staticidx
= 0;
430 static POINTER_TYPE
*pure_alloc (size_t, int);
433 /* Value is SZ rounded up to the next multiple of ALIGNMENT.
434 ALIGNMENT must be a power of 2. */
436 #define ALIGN(ptr, ALIGNMENT) \
437 ((POINTER_TYPE *) ((((uintptr_t) (ptr)) + (ALIGNMENT) - 1) \
438 & ~((ALIGNMENT) - 1)))
442 /************************************************************************
444 ************************************************************************/
446 /* Function malloc calls this if it finds we are near exhausting storage. */
449 malloc_warning (const char *str
)
451 pending_malloc_warning
= str
;
455 /* Display an already-pending malloc warning. */
458 display_malloc_warning (void)
460 call3 (intern ("display-warning"),
462 build_string (pending_malloc_warning
),
463 intern ("emergency"));
464 pending_malloc_warning
= 0;
467 /* Called if we can't allocate relocatable space for a buffer. */
470 buffer_memory_full (void)
472 /* If buffers use the relocating allocator, no need to free
473 spare_memory, because we may have plenty of malloc space left
474 that we could get, and if we don't, the malloc that fails will
475 itself cause spare_memory to be freed. If buffers don't use the
476 relocating allocator, treat this like any other failing
483 /* This used to call error, but if we've run out of memory, we could
484 get infinite recursion trying to build the string. */
485 xsignal (Qnil
, Vmemory_signal_data
);
489 #ifdef XMALLOC_OVERRUN_CHECK
491 /* Check for overrun in malloc'ed buffers by wrapping a 16 byte header
492 and a 16 byte trailer around each block.
494 The header consists of 12 fixed bytes + a 4 byte integer contaning the
495 original block size, while the trailer consists of 16 fixed bytes.
497 The header is used to detect whether this block has been allocated
498 through these functions -- as it seems that some low-level libc
499 functions may bypass the malloc hooks.
503 #define XMALLOC_OVERRUN_CHECK_SIZE 16
505 static char xmalloc_overrun_check_header
[XMALLOC_OVERRUN_CHECK_SIZE
-4] =
506 { 0x9a, 0x9b, 0xae, 0xaf,
507 0xbf, 0xbe, 0xce, 0xcf,
508 0xea, 0xeb, 0xec, 0xed };
510 static char xmalloc_overrun_check_trailer
[XMALLOC_OVERRUN_CHECK_SIZE
] =
511 { 0xaa, 0xab, 0xac, 0xad,
512 0xba, 0xbb, 0xbc, 0xbd,
513 0xca, 0xcb, 0xcc, 0xcd,
514 0xda, 0xdb, 0xdc, 0xdd };
516 /* Macros to insert and extract the block size in the header. */
518 #define XMALLOC_PUT_SIZE(ptr, size) \
519 (ptr[-1] = (size & 0xff), \
520 ptr[-2] = ((size >> 8) & 0xff), \
521 ptr[-3] = ((size >> 16) & 0xff), \
522 ptr[-4] = ((size >> 24) & 0xff))
524 #define XMALLOC_GET_SIZE(ptr) \
525 (size_t)((unsigned)(ptr[-1]) | \
526 ((unsigned)(ptr[-2]) << 8) | \
527 ((unsigned)(ptr[-3]) << 16) | \
528 ((unsigned)(ptr[-4]) << 24))
531 /* The call depth in overrun_check functions. For example, this might happen:
533 overrun_check_malloc()
534 -> malloc -> (via hook)_-> emacs_blocked_malloc
535 -> overrun_check_malloc
536 call malloc (hooks are NULL, so real malloc is called).
537 malloc returns 10000.
538 add overhead, return 10016.
539 <- (back in overrun_check_malloc)
540 add overhead again, return 10032
541 xmalloc returns 10032.
546 overrun_check_free(10032)
548 free(10016) <- crash, because 10000 is the original pointer. */
550 static int check_depth
;
552 /* Like malloc, but wraps allocated block with header and trailer. */
554 static POINTER_TYPE
*
555 overrun_check_malloc (size_t size
)
557 register unsigned char *val
;
558 size_t overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_SIZE
*2 : 0;
560 val
= (unsigned char *) malloc (size
+ overhead
);
561 if (val
&& check_depth
== 1)
563 memcpy (val
, xmalloc_overrun_check_header
,
564 XMALLOC_OVERRUN_CHECK_SIZE
- 4);
565 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
566 XMALLOC_PUT_SIZE(val
, size
);
567 memcpy (val
+ size
, xmalloc_overrun_check_trailer
,
568 XMALLOC_OVERRUN_CHECK_SIZE
);
571 return (POINTER_TYPE
*)val
;
575 /* Like realloc, but checks old block for overrun, and wraps new block
576 with header and trailer. */
578 static POINTER_TYPE
*
579 overrun_check_realloc (POINTER_TYPE
*block
, size_t size
)
581 register unsigned char *val
= (unsigned char *) block
;
582 size_t overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_SIZE
*2 : 0;
586 && memcmp (xmalloc_overrun_check_header
,
587 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
588 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
590 size_t osize
= XMALLOC_GET_SIZE (val
);
591 if (memcmp (xmalloc_overrun_check_trailer
, val
+ osize
,
592 XMALLOC_OVERRUN_CHECK_SIZE
))
594 memset (val
+ osize
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
595 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
596 memset (val
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
599 val
= (unsigned char *) realloc ((POINTER_TYPE
*)val
, size
+ overhead
);
601 if (val
&& check_depth
== 1)
603 memcpy (val
, xmalloc_overrun_check_header
,
604 XMALLOC_OVERRUN_CHECK_SIZE
- 4);
605 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
606 XMALLOC_PUT_SIZE(val
, size
);
607 memcpy (val
+ size
, xmalloc_overrun_check_trailer
,
608 XMALLOC_OVERRUN_CHECK_SIZE
);
611 return (POINTER_TYPE
*)val
;
614 /* Like free, but checks block for overrun. */
617 overrun_check_free (POINTER_TYPE
*block
)
619 unsigned char *val
= (unsigned char *) block
;
624 && memcmp (xmalloc_overrun_check_header
,
625 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
626 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
628 size_t osize
= XMALLOC_GET_SIZE (val
);
629 if (memcmp (xmalloc_overrun_check_trailer
, val
+ osize
,
630 XMALLOC_OVERRUN_CHECK_SIZE
))
632 #ifdef XMALLOC_CLEAR_FREE_MEMORY
633 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
634 memset (val
, 0xff, osize
+ XMALLOC_OVERRUN_CHECK_SIZE
*2);
636 memset (val
+ osize
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
637 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
638 memset (val
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
649 #define malloc overrun_check_malloc
650 #define realloc overrun_check_realloc
651 #define free overrun_check_free
655 /* When using SYNC_INPUT, we don't call malloc from a signal handler, so
656 there's no need to block input around malloc. */
657 #define MALLOC_BLOCK_INPUT ((void)0)
658 #define MALLOC_UNBLOCK_INPUT ((void)0)
660 #define MALLOC_BLOCK_INPUT BLOCK_INPUT
661 #define MALLOC_UNBLOCK_INPUT UNBLOCK_INPUT
664 /* Like malloc but check for no memory and block interrupt input.. */
667 xmalloc (size_t size
)
669 register POINTER_TYPE
*val
;
672 val
= (POINTER_TYPE
*) malloc (size
);
673 MALLOC_UNBLOCK_INPUT
;
681 /* Like realloc but check for no memory and block interrupt input.. */
684 xrealloc (POINTER_TYPE
*block
, size_t size
)
686 register POINTER_TYPE
*val
;
689 /* We must call malloc explicitly when BLOCK is 0, since some
690 reallocs don't do this. */
692 val
= (POINTER_TYPE
*) malloc (size
);
694 val
= (POINTER_TYPE
*) realloc (block
, size
);
695 MALLOC_UNBLOCK_INPUT
;
697 if (!val
&& size
) memory_full ();
702 /* Like free but block interrupt input. */
705 xfree (POINTER_TYPE
*block
)
711 MALLOC_UNBLOCK_INPUT
;
712 /* We don't call refill_memory_reserve here
713 because that duplicates doing so in emacs_blocked_free
714 and the criterion should go there. */
718 /* Like strdup, but uses xmalloc. */
721 xstrdup (const char *s
)
723 size_t len
= strlen (s
) + 1;
724 char *p
= (char *) xmalloc (len
);
730 /* Unwind for SAFE_ALLOCA */
733 safe_alloca_unwind (Lisp_Object arg
)
735 register struct Lisp_Save_Value
*p
= XSAVE_VALUE (arg
);
745 /* Like malloc but used for allocating Lisp data. NBYTES is the
746 number of bytes to allocate, TYPE describes the intended use of the
747 allcated memory block (for strings, for conses, ...). */
750 static void *lisp_malloc_loser
;
753 static POINTER_TYPE
*
754 lisp_malloc (size_t nbytes
, enum mem_type type
)
760 #ifdef GC_MALLOC_CHECK
761 allocated_mem_type
= type
;
764 val
= (void *) malloc (nbytes
);
767 /* If the memory just allocated cannot be addressed thru a Lisp
768 object's pointer, and it needs to be,
769 that's equivalent to running out of memory. */
770 if (val
&& type
!= MEM_TYPE_NON_LISP
)
773 XSETCONS (tem
, (char *) val
+ nbytes
- 1);
774 if ((char *) XCONS (tem
) != (char *) val
+ nbytes
- 1)
776 lisp_malloc_loser
= val
;
783 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
784 if (val
&& type
!= MEM_TYPE_NON_LISP
)
785 mem_insert (val
, (char *) val
+ nbytes
, type
);
788 MALLOC_UNBLOCK_INPUT
;
794 /* Free BLOCK. This must be called to free memory allocated with a
795 call to lisp_malloc. */
798 lisp_free (POINTER_TYPE
*block
)
802 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
803 mem_delete (mem_find (block
));
805 MALLOC_UNBLOCK_INPUT
;
808 /* Allocation of aligned blocks of memory to store Lisp data. */
809 /* The entry point is lisp_align_malloc which returns blocks of at most */
810 /* BLOCK_BYTES and guarantees they are aligned on a BLOCK_ALIGN boundary. */
812 /* Use posix_memalloc if the system has it and we're using the system's
813 malloc (because our gmalloc.c routines don't have posix_memalign although
814 its memalloc could be used). */
815 #if defined (HAVE_POSIX_MEMALIGN) && defined (SYSTEM_MALLOC)
816 #define USE_POSIX_MEMALIGN 1
819 /* BLOCK_ALIGN has to be a power of 2. */
820 #define BLOCK_ALIGN (1 << 10)
822 /* Padding to leave at the end of a malloc'd block. This is to give
823 malloc a chance to minimize the amount of memory wasted to alignment.
824 It should be tuned to the particular malloc library used.
825 On glibc-2.3.2, malloc never tries to align, so a padding of 0 is best.
826 posix_memalign on the other hand would ideally prefer a value of 4
827 because otherwise, there's 1020 bytes wasted between each ablocks.
828 In Emacs, testing shows that those 1020 can most of the time be
829 efficiently used by malloc to place other objects, so a value of 0 can
830 still preferable unless you have a lot of aligned blocks and virtually
832 #define BLOCK_PADDING 0
833 #define BLOCK_BYTES \
834 (BLOCK_ALIGN - sizeof (struct ablocks *) - BLOCK_PADDING)
836 /* Internal data structures and constants. */
838 #define ABLOCKS_SIZE 16
840 /* An aligned block of memory. */
845 char payload
[BLOCK_BYTES
];
846 struct ablock
*next_free
;
848 /* `abase' is the aligned base of the ablocks. */
849 /* It is overloaded to hold the virtual `busy' field that counts
850 the number of used ablock in the parent ablocks.
851 The first ablock has the `busy' field, the others have the `abase'
852 field. To tell the difference, we assume that pointers will have
853 integer values larger than 2 * ABLOCKS_SIZE. The lowest bit of `busy'
854 is used to tell whether the real base of the parent ablocks is `abase'
855 (if not, the word before the first ablock holds a pointer to the
857 struct ablocks
*abase
;
858 /* The padding of all but the last ablock is unused. The padding of
859 the last ablock in an ablocks is not allocated. */
861 char padding
[BLOCK_PADDING
];
865 /* A bunch of consecutive aligned blocks. */
868 struct ablock blocks
[ABLOCKS_SIZE
];
871 /* Size of the block requested from malloc or memalign. */
872 #define ABLOCKS_BYTES (sizeof (struct ablocks) - BLOCK_PADDING)
874 #define ABLOCK_ABASE(block) \
875 (((uintptr_t) (block)->abase) <= (1 + 2 * ABLOCKS_SIZE) \
876 ? (struct ablocks *)(block) \
879 /* Virtual `busy' field. */
880 #define ABLOCKS_BUSY(abase) ((abase)->blocks[0].abase)
882 /* Pointer to the (not necessarily aligned) malloc block. */
883 #ifdef USE_POSIX_MEMALIGN
884 #define ABLOCKS_BASE(abase) (abase)
886 #define ABLOCKS_BASE(abase) \
887 (1 & (intptr_t) ABLOCKS_BUSY (abase) ? abase : ((void**)abase)[-1])
890 /* The list of free ablock. */
891 static struct ablock
*free_ablock
;
893 /* Allocate an aligned block of nbytes.
894 Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be
895 smaller or equal to BLOCK_BYTES. */
896 static POINTER_TYPE
*
897 lisp_align_malloc (size_t nbytes
, enum mem_type type
)
900 struct ablocks
*abase
;
902 eassert (nbytes
<= BLOCK_BYTES
);
906 #ifdef GC_MALLOC_CHECK
907 allocated_mem_type
= type
;
913 intptr_t aligned
; /* int gets warning casting to 64-bit pointer. */
915 #ifdef DOUG_LEA_MALLOC
916 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
917 because mapped region contents are not preserved in
919 mallopt (M_MMAP_MAX
, 0);
922 #ifdef USE_POSIX_MEMALIGN
924 int err
= posix_memalign (&base
, BLOCK_ALIGN
, ABLOCKS_BYTES
);
930 base
= malloc (ABLOCKS_BYTES
);
931 abase
= ALIGN (base
, BLOCK_ALIGN
);
936 MALLOC_UNBLOCK_INPUT
;
940 aligned
= (base
== abase
);
942 ((void**)abase
)[-1] = base
;
944 #ifdef DOUG_LEA_MALLOC
945 /* Back to a reasonable maximum of mmap'ed areas. */
946 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
950 /* If the memory just allocated cannot be addressed thru a Lisp
951 object's pointer, and it needs to be, that's equivalent to
952 running out of memory. */
953 if (type
!= MEM_TYPE_NON_LISP
)
956 char *end
= (char *) base
+ ABLOCKS_BYTES
- 1;
958 if ((char *) XCONS (tem
) != end
)
960 lisp_malloc_loser
= base
;
962 MALLOC_UNBLOCK_INPUT
;
968 /* Initialize the blocks and put them on the free list.
969 Is `base' was not properly aligned, we can't use the last block. */
970 for (i
= 0; i
< (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1); i
++)
972 abase
->blocks
[i
].abase
= abase
;
973 abase
->blocks
[i
].x
.next_free
= free_ablock
;
974 free_ablock
= &abase
->blocks
[i
];
976 ABLOCKS_BUSY (abase
) = (struct ablocks
*) aligned
;
978 eassert (0 == ((uintptr_t) abase
) % BLOCK_ALIGN
);
979 eassert (ABLOCK_ABASE (&abase
->blocks
[3]) == abase
); /* 3 is arbitrary */
980 eassert (ABLOCK_ABASE (&abase
->blocks
[0]) == abase
);
981 eassert (ABLOCKS_BASE (abase
) == base
);
982 eassert (aligned
== (intptr_t) ABLOCKS_BUSY (abase
));
985 abase
= ABLOCK_ABASE (free_ablock
);
986 ABLOCKS_BUSY (abase
) =
987 (struct ablocks
*) (2 + (intptr_t) ABLOCKS_BUSY (abase
));
989 free_ablock
= free_ablock
->x
.next_free
;
991 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
992 if (val
&& type
!= MEM_TYPE_NON_LISP
)
993 mem_insert (val
, (char *) val
+ nbytes
, type
);
996 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 /* Initialize string allocation. Called from init_alloc_once. */
1669 total_strings
= total_free_strings
= total_string_size
= 0;
1670 oldest_sblock
= current_sblock
= large_sblocks
= NULL
;
1671 string_blocks
= NULL
;
1672 n_string_blocks
= 0;
1673 string_free_list
= NULL
;
1674 empty_unibyte_string
= make_pure_string ("", 0, 0, 0);
1675 empty_multibyte_string
= make_pure_string ("", 0, 0, 1);
1679 #ifdef GC_CHECK_STRING_BYTES
1681 static int check_string_bytes_count
;
1683 #define CHECK_STRING_BYTES(S) STRING_BYTES (S)
1686 /* Like GC_STRING_BYTES, but with debugging check. */
1689 string_bytes (struct Lisp_String
*s
)
1692 (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1694 if (!PURE_POINTER_P (s
)
1696 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1701 /* Check validity of Lisp strings' string_bytes member in B. */
1704 check_sblock (struct sblock
*b
)
1706 struct sdata
*from
, *end
, *from_end
;
1710 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1712 /* Compute the next FROM here because copying below may
1713 overwrite data we need to compute it. */
1716 /* Check that the string size recorded in the string is the
1717 same as the one recorded in the sdata structure. */
1719 CHECK_STRING_BYTES (from
->string
);
1722 nbytes
= GC_STRING_BYTES (from
->string
);
1724 nbytes
= SDATA_NBYTES (from
);
1726 nbytes
= SDATA_SIZE (nbytes
);
1727 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
1732 /* Check validity of Lisp strings' string_bytes member. ALL_P
1733 non-zero means check all strings, otherwise check only most
1734 recently allocated strings. Used for hunting a bug. */
1737 check_string_bytes (int all_p
)
1743 for (b
= large_sblocks
; b
; b
= b
->next
)
1745 struct Lisp_String
*s
= b
->first_data
.string
;
1747 CHECK_STRING_BYTES (s
);
1750 for (b
= oldest_sblock
; b
; b
= b
->next
)
1754 check_sblock (current_sblock
);
1757 #endif /* GC_CHECK_STRING_BYTES */
1759 #ifdef GC_CHECK_STRING_FREE_LIST
1761 /* Walk through the string free list looking for bogus next pointers.
1762 This may catch buffer overrun from a previous string. */
1765 check_string_free_list (void)
1767 struct Lisp_String
*s
;
1769 /* Pop a Lisp_String off the free-list. */
1770 s
= string_free_list
;
1773 if ((uintptr_t) s
< 1024)
1775 s
= NEXT_FREE_LISP_STRING (s
);
1779 #define check_string_free_list()
1782 /* Return a new Lisp_String. */
1784 static struct Lisp_String
*
1785 allocate_string (void)
1787 struct Lisp_String
*s
;
1789 /* eassert (!handling_signal); */
1793 /* If the free-list is empty, allocate a new string_block, and
1794 add all the Lisp_Strings in it to the free-list. */
1795 if (string_free_list
== NULL
)
1797 struct string_block
*b
;
1800 b
= (struct string_block
*) lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1801 memset (b
, 0, sizeof *b
);
1802 b
->next
= string_blocks
;
1806 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1809 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1810 string_free_list
= s
;
1813 total_free_strings
+= STRING_BLOCK_SIZE
;
1816 check_string_free_list ();
1818 /* Pop a Lisp_String off the free-list. */
1819 s
= string_free_list
;
1820 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1822 MALLOC_UNBLOCK_INPUT
;
1824 /* Probably not strictly necessary, but play it safe. */
1825 memset (s
, 0, sizeof *s
);
1827 --total_free_strings
;
1830 consing_since_gc
+= sizeof *s
;
1832 #ifdef GC_CHECK_STRING_BYTES
1833 if (!noninteractive
)
1835 if (++check_string_bytes_count
== 200)
1837 check_string_bytes_count
= 0;
1838 check_string_bytes (1);
1841 check_string_bytes (0);
1843 #endif /* GC_CHECK_STRING_BYTES */
1849 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1850 plus a NUL byte at the end. Allocate an sdata structure for S, and
1851 set S->data to its `u.data' member. Store a NUL byte at the end of
1852 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1853 S->data if it was initially non-null. */
1856 allocate_string_data (struct Lisp_String
*s
,
1857 EMACS_INT nchars
, EMACS_INT nbytes
)
1859 struct sdata
*data
, *old_data
;
1861 EMACS_INT needed
, old_nbytes
;
1863 /* Determine the number of bytes needed to store NBYTES bytes
1865 needed
= SDATA_SIZE (nbytes
);
1866 old_data
= s
->data
? SDATA_OF_STRING (s
) : NULL
;
1867 old_nbytes
= GC_STRING_BYTES (s
);
1871 if (nbytes
> LARGE_STRING_BYTES
)
1873 size_t size
= offsetof (struct sblock
, first_data
) + needed
;
1875 #ifdef DOUG_LEA_MALLOC
1876 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1877 because mapped region contents are not preserved in
1880 In case you think of allowing it in a dumped Emacs at the
1881 cost of not being able to re-dump, there's another reason:
1882 mmap'ed data typically have an address towards the top of the
1883 address space, which won't fit into an EMACS_INT (at least on
1884 32-bit systems with the current tagging scheme). --fx */
1885 mallopt (M_MMAP_MAX
, 0);
1888 b
= (struct sblock
*) lisp_malloc (size
+ GC_STRING_EXTRA
, MEM_TYPE_NON_LISP
);
1890 #ifdef DOUG_LEA_MALLOC
1891 /* Back to a reasonable maximum of mmap'ed areas. */
1892 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1895 b
->next_free
= &b
->first_data
;
1896 b
->first_data
.string
= NULL
;
1897 b
->next
= large_sblocks
;
1900 else if (current_sblock
== NULL
1901 || (((char *) current_sblock
+ SBLOCK_SIZE
1902 - (char *) current_sblock
->next_free
)
1903 < (needed
+ GC_STRING_EXTRA
)))
1905 /* Not enough room in the current sblock. */
1906 b
= (struct sblock
*) lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
1907 b
->next_free
= &b
->first_data
;
1908 b
->first_data
.string
= NULL
;
1912 current_sblock
->next
= b
;
1920 data
= b
->next_free
;
1921 b
->next_free
= (struct sdata
*) ((char *) data
+ needed
+ GC_STRING_EXTRA
);
1923 MALLOC_UNBLOCK_INPUT
;
1926 s
->data
= SDATA_DATA (data
);
1927 #ifdef GC_CHECK_STRING_BYTES
1928 SDATA_NBYTES (data
) = nbytes
;
1931 s
->size_byte
= nbytes
;
1932 s
->data
[nbytes
] = '\0';
1933 #ifdef GC_CHECK_STRING_OVERRUN
1934 memcpy ((char *) data
+ needed
, string_overrun_cookie
,
1935 GC_STRING_OVERRUN_COOKIE_SIZE
);
1938 /* If S had already data assigned, mark that as free by setting its
1939 string back-pointer to null, and recording the size of the data
1943 SDATA_NBYTES (old_data
) = old_nbytes
;
1944 old_data
->string
= NULL
;
1947 consing_since_gc
+= needed
;
1951 /* Sweep and compact strings. */
1954 sweep_strings (void)
1956 struct string_block
*b
, *next
;
1957 struct string_block
*live_blocks
= NULL
;
1959 string_free_list
= NULL
;
1960 total_strings
= total_free_strings
= 0;
1961 total_string_size
= 0;
1963 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
1964 for (b
= string_blocks
; b
; b
= next
)
1967 struct Lisp_String
*free_list_before
= string_free_list
;
1971 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
1973 struct Lisp_String
*s
= b
->strings
+ i
;
1977 /* String was not on free-list before. */
1978 if (STRING_MARKED_P (s
))
1980 /* String is live; unmark it and its intervals. */
1983 if (!NULL_INTERVAL_P (s
->intervals
))
1984 UNMARK_BALANCE_INTERVALS (s
->intervals
);
1987 total_string_size
+= STRING_BYTES (s
);
1991 /* String is dead. Put it on the free-list. */
1992 struct sdata
*data
= SDATA_OF_STRING (s
);
1994 /* Save the size of S in its sdata so that we know
1995 how large that is. Reset the sdata's string
1996 back-pointer so that we know it's free. */
1997 #ifdef GC_CHECK_STRING_BYTES
1998 if (GC_STRING_BYTES (s
) != SDATA_NBYTES (data
))
2001 data
->u
.nbytes
= GC_STRING_BYTES (s
);
2003 data
->string
= NULL
;
2005 /* Reset the strings's `data' member so that we
2009 /* Put the string on the free-list. */
2010 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2011 string_free_list
= s
;
2017 /* S was on the free-list before. Put it there again. */
2018 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2019 string_free_list
= s
;
2024 /* Free blocks that contain free Lisp_Strings only, except
2025 the first two of them. */
2026 if (nfree
== STRING_BLOCK_SIZE
2027 && total_free_strings
> STRING_BLOCK_SIZE
)
2031 string_free_list
= free_list_before
;
2035 total_free_strings
+= nfree
;
2036 b
->next
= live_blocks
;
2041 check_string_free_list ();
2043 string_blocks
= live_blocks
;
2044 free_large_strings ();
2045 compact_small_strings ();
2047 check_string_free_list ();
2051 /* Free dead large strings. */
2054 free_large_strings (void)
2056 struct sblock
*b
, *next
;
2057 struct sblock
*live_blocks
= NULL
;
2059 for (b
= large_sblocks
; b
; b
= next
)
2063 if (b
->first_data
.string
== NULL
)
2067 b
->next
= live_blocks
;
2072 large_sblocks
= live_blocks
;
2076 /* Compact data of small strings. Free sblocks that don't contain
2077 data of live strings after compaction. */
2080 compact_small_strings (void)
2082 struct sblock
*b
, *tb
, *next
;
2083 struct sdata
*from
, *to
, *end
, *tb_end
;
2084 struct sdata
*to_end
, *from_end
;
2086 /* TB is the sblock we copy to, TO is the sdata within TB we copy
2087 to, and TB_END is the end of TB. */
2089 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2090 to
= &tb
->first_data
;
2092 /* Step through the blocks from the oldest to the youngest. We
2093 expect that old blocks will stabilize over time, so that less
2094 copying will happen this way. */
2095 for (b
= oldest_sblock
; b
; b
= b
->next
)
2098 xassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
2100 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
2102 /* Compute the next FROM here because copying below may
2103 overwrite data we need to compute it. */
2106 #ifdef GC_CHECK_STRING_BYTES
2107 /* Check that the string size recorded in the string is the
2108 same as the one recorded in the sdata structure. */
2110 && GC_STRING_BYTES (from
->string
) != SDATA_NBYTES (from
))
2112 #endif /* GC_CHECK_STRING_BYTES */
2115 nbytes
= GC_STRING_BYTES (from
->string
);
2117 nbytes
= SDATA_NBYTES (from
);
2119 if (nbytes
> LARGE_STRING_BYTES
)
2122 nbytes
= SDATA_SIZE (nbytes
);
2123 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
2125 #ifdef GC_CHECK_STRING_OVERRUN
2126 if (memcmp (string_overrun_cookie
,
2127 (char *) from_end
- GC_STRING_OVERRUN_COOKIE_SIZE
,
2128 GC_STRING_OVERRUN_COOKIE_SIZE
))
2132 /* FROM->string non-null means it's alive. Copy its data. */
2135 /* If TB is full, proceed with the next sblock. */
2136 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2137 if (to_end
> tb_end
)
2141 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2142 to
= &tb
->first_data
;
2143 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2146 /* Copy, and update the string's `data' pointer. */
2149 xassert (tb
!= b
|| to
< from
);
2150 memmove (to
, from
, nbytes
+ GC_STRING_EXTRA
);
2151 to
->string
->data
= SDATA_DATA (to
);
2154 /* Advance past the sdata we copied to. */
2160 /* The rest of the sblocks following TB don't contain live data, so
2161 we can free them. */
2162 for (b
= tb
->next
; b
; b
= next
)
2170 current_sblock
= tb
;
2174 string_overflow (void)
2176 error ("Maximum string size exceeded");
2179 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
2180 doc
: /* Return a newly created string of length LENGTH, with INIT in each element.
2181 LENGTH must be an integer.
2182 INIT must be an integer that represents a character. */)
2183 (Lisp_Object length
, Lisp_Object init
)
2185 register Lisp_Object val
;
2186 register unsigned char *p
, *end
;
2190 CHECK_NATNUM (length
);
2191 CHECK_NUMBER (init
);
2194 if (ASCII_CHAR_P (c
))
2196 nbytes
= XINT (length
);
2197 val
= make_uninit_string (nbytes
);
2199 end
= p
+ SCHARS (val
);
2205 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
2206 int len
= CHAR_STRING (c
, str
);
2207 EMACS_INT string_len
= XINT (length
);
2209 if (string_len
> MOST_POSITIVE_FIXNUM
/ len
)
2211 nbytes
= len
* string_len
;
2212 val
= make_uninit_multibyte_string (string_len
, nbytes
);
2217 memcpy (p
, str
, len
);
2227 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
2228 doc
: /* Return a new bool-vector of length LENGTH, using INIT for each element.
2229 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
2230 (Lisp_Object length
, Lisp_Object init
)
2232 register Lisp_Object val
;
2233 struct Lisp_Bool_Vector
*p
;
2235 EMACS_INT length_in_chars
, length_in_elts
;
2238 CHECK_NATNUM (length
);
2240 bits_per_value
= sizeof (EMACS_INT
) * BOOL_VECTOR_BITS_PER_CHAR
;
2242 length_in_elts
= (XFASTINT (length
) + bits_per_value
- 1) / bits_per_value
;
2243 length_in_chars
= ((XFASTINT (length
) + BOOL_VECTOR_BITS_PER_CHAR
- 1)
2244 / BOOL_VECTOR_BITS_PER_CHAR
);
2246 /* We must allocate one more elements than LENGTH_IN_ELTS for the
2247 slot `size' of the struct Lisp_Bool_Vector. */
2248 val
= Fmake_vector (make_number (length_in_elts
+ 1), Qnil
);
2250 /* No Lisp_Object to trace in there. */
2251 XSETPVECTYPESIZE (XVECTOR (val
), PVEC_BOOL_VECTOR
, 0);
2253 p
= XBOOL_VECTOR (val
);
2254 p
->size
= XFASTINT (length
);
2256 real_init
= (NILP (init
) ? 0 : -1);
2257 for (i
= 0; i
< length_in_chars
; i
++)
2258 p
->data
[i
] = real_init
;
2260 /* Clear the extraneous bits in the last byte. */
2261 if (XINT (length
) != length_in_chars
* BOOL_VECTOR_BITS_PER_CHAR
)
2262 p
->data
[length_in_chars
- 1]
2263 &= (1 << (XINT (length
) % BOOL_VECTOR_BITS_PER_CHAR
)) - 1;
2269 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
2270 of characters from the contents. This string may be unibyte or
2271 multibyte, depending on the contents. */
2274 make_string (const char *contents
, EMACS_INT nbytes
)
2276 register Lisp_Object val
;
2277 EMACS_INT nchars
, multibyte_nbytes
;
2279 parse_str_as_multibyte ((const unsigned char *) contents
, nbytes
,
2280 &nchars
, &multibyte_nbytes
);
2281 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
2282 /* CONTENTS contains no multibyte sequences or contains an invalid
2283 multibyte sequence. We must make unibyte string. */
2284 val
= make_unibyte_string (contents
, nbytes
);
2286 val
= make_multibyte_string (contents
, nchars
, nbytes
);
2291 /* Make an unibyte string from LENGTH bytes at CONTENTS. */
2294 make_unibyte_string (const char *contents
, EMACS_INT length
)
2296 register Lisp_Object val
;
2297 val
= make_uninit_string (length
);
2298 memcpy (SDATA (val
), contents
, length
);
2303 /* Make a multibyte string from NCHARS characters occupying NBYTES
2304 bytes at CONTENTS. */
2307 make_multibyte_string (const char *contents
,
2308 EMACS_INT nchars
, EMACS_INT nbytes
)
2310 register Lisp_Object val
;
2311 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2312 memcpy (SDATA (val
), contents
, nbytes
);
2317 /* Make a string from NCHARS characters occupying NBYTES bytes at
2318 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2321 make_string_from_bytes (const char *contents
,
2322 EMACS_INT nchars
, EMACS_INT nbytes
)
2324 register Lisp_Object val
;
2325 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2326 memcpy (SDATA (val
), contents
, nbytes
);
2327 if (SBYTES (val
) == SCHARS (val
))
2328 STRING_SET_UNIBYTE (val
);
2333 /* Make a string from NCHARS characters occupying NBYTES bytes at
2334 CONTENTS. The argument MULTIBYTE controls whether to label the
2335 string as multibyte. If NCHARS is negative, it counts the number of
2336 characters by itself. */
2339 make_specified_string (const char *contents
,
2340 EMACS_INT nchars
, EMACS_INT nbytes
, int multibyte
)
2342 register Lisp_Object val
;
2347 nchars
= multibyte_chars_in_text ((const unsigned char *) contents
,
2352 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2353 memcpy (SDATA (val
), contents
, nbytes
);
2355 STRING_SET_UNIBYTE (val
);
2360 /* Make a string from the data at STR, treating it as multibyte if the
2364 build_string (const char *str
)
2366 return make_string (str
, strlen (str
));
2370 /* Return an unibyte Lisp_String set up to hold LENGTH characters
2371 occupying LENGTH bytes. */
2374 make_uninit_string (EMACS_INT length
)
2379 return empty_unibyte_string
;
2380 val
= make_uninit_multibyte_string (length
, length
);
2381 STRING_SET_UNIBYTE (val
);
2386 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2387 which occupy NBYTES bytes. */
2390 make_uninit_multibyte_string (EMACS_INT nchars
, EMACS_INT nbytes
)
2393 struct Lisp_String
*s
;
2398 return empty_multibyte_string
;
2400 s
= allocate_string ();
2401 allocate_string_data (s
, nchars
, nbytes
);
2402 XSETSTRING (string
, s
);
2403 string_chars_consed
+= nbytes
;
2409 /***********************************************************************
2411 ***********************************************************************/
2413 /* We store float cells inside of float_blocks, allocating a new
2414 float_block with malloc whenever necessary. Float cells reclaimed
2415 by GC are put on a free list to be reallocated before allocating
2416 any new float cells from the latest float_block. */
2418 #define FLOAT_BLOCK_SIZE \
2419 (((BLOCK_BYTES - sizeof (struct float_block *) \
2420 /* The compiler might add padding at the end. */ \
2421 - (sizeof (struct Lisp_Float) - sizeof (int))) * CHAR_BIT) \
2422 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2424 #define GETMARKBIT(block,n) \
2425 (((block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2426 >> ((n) % (sizeof(int) * CHAR_BIT))) \
2429 #define SETMARKBIT(block,n) \
2430 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2431 |= 1 << ((n) % (sizeof(int) * CHAR_BIT))
2433 #define UNSETMARKBIT(block,n) \
2434 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2435 &= ~(1 << ((n) % (sizeof(int) * CHAR_BIT)))
2437 #define FLOAT_BLOCK(fptr) \
2438 ((struct float_block *) (((uintptr_t) (fptr)) & ~(BLOCK_ALIGN - 1)))
2440 #define FLOAT_INDEX(fptr) \
2441 ((((uintptr_t) (fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2445 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2446 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2447 int gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2448 struct float_block
*next
;
2451 #define FLOAT_MARKED_P(fptr) \
2452 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2454 #define FLOAT_MARK(fptr) \
2455 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2457 #define FLOAT_UNMARK(fptr) \
2458 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2460 /* Current float_block. */
2462 static struct float_block
*float_block
;
2464 /* Index of first unused Lisp_Float in the current float_block. */
2466 static int float_block_index
;
2468 /* Total number of float blocks now in use. */
2470 static int n_float_blocks
;
2472 /* Free-list of Lisp_Floats. */
2474 static struct Lisp_Float
*float_free_list
;
2477 /* Initialize float allocation. */
2483 float_block_index
= FLOAT_BLOCK_SIZE
; /* Force alloc of new float_block. */
2484 float_free_list
= 0;
2489 /* Return a new float object with value FLOAT_VALUE. */
2492 make_float (double float_value
)
2494 register Lisp_Object val
;
2496 /* eassert (!handling_signal); */
2500 if (float_free_list
)
2502 /* We use the data field for chaining the free list
2503 so that we won't use the same field that has the mark bit. */
2504 XSETFLOAT (val
, float_free_list
);
2505 float_free_list
= float_free_list
->u
.chain
;
2509 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2511 register struct float_block
*new;
2513 new = (struct float_block
*) lisp_align_malloc (sizeof *new,
2515 new->next
= float_block
;
2516 memset (new->gcmarkbits
, 0, sizeof new->gcmarkbits
);
2518 float_block_index
= 0;
2521 XSETFLOAT (val
, &float_block
->floats
[float_block_index
]);
2522 float_block_index
++;
2525 MALLOC_UNBLOCK_INPUT
;
2527 XFLOAT_INIT (val
, float_value
);
2528 eassert (!FLOAT_MARKED_P (XFLOAT (val
)));
2529 consing_since_gc
+= sizeof (struct Lisp_Float
);
2536 /***********************************************************************
2538 ***********************************************************************/
2540 /* We store cons cells inside of cons_blocks, allocating a new
2541 cons_block with malloc whenever necessary. Cons cells reclaimed by
2542 GC are put on a free list to be reallocated before allocating
2543 any new cons cells from the latest cons_block. */
2545 #define CONS_BLOCK_SIZE \
2546 (((BLOCK_BYTES - sizeof (struct cons_block *)) * CHAR_BIT) \
2547 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2549 #define CONS_BLOCK(fptr) \
2550 ((struct cons_block *) ((uintptr_t) (fptr) & ~(BLOCK_ALIGN - 1)))
2552 #define CONS_INDEX(fptr) \
2553 (((uintptr_t) (fptr) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2557 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2558 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2559 int gcmarkbits
[1 + CONS_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2560 struct cons_block
*next
;
2563 #define CONS_MARKED_P(fptr) \
2564 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2566 #define CONS_MARK(fptr) \
2567 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2569 #define CONS_UNMARK(fptr) \
2570 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2572 /* Current cons_block. */
2574 static struct cons_block
*cons_block
;
2576 /* Index of first unused Lisp_Cons in the current block. */
2578 static int cons_block_index
;
2580 /* Free-list of Lisp_Cons structures. */
2582 static struct Lisp_Cons
*cons_free_list
;
2584 /* Total number of cons blocks now in use. */
2586 static int n_cons_blocks
;
2589 /* Initialize cons allocation. */
2595 cons_block_index
= CONS_BLOCK_SIZE
; /* Force alloc of new cons_block. */
2601 /* Explicitly free a cons cell by putting it on the free-list. */
2604 free_cons (struct Lisp_Cons
*ptr
)
2606 ptr
->u
.chain
= cons_free_list
;
2610 cons_free_list
= ptr
;
2613 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
2614 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2615 (Lisp_Object car
, Lisp_Object cdr
)
2617 register Lisp_Object val
;
2619 /* eassert (!handling_signal); */
2625 /* We use the cdr for chaining the free list
2626 so that we won't use the same field that has the mark bit. */
2627 XSETCONS (val
, cons_free_list
);
2628 cons_free_list
= cons_free_list
->u
.chain
;
2632 if (cons_block_index
== CONS_BLOCK_SIZE
)
2634 register struct cons_block
*new;
2635 new = (struct cons_block
*) lisp_align_malloc (sizeof *new,
2637 memset (new->gcmarkbits
, 0, sizeof new->gcmarkbits
);
2638 new->next
= cons_block
;
2640 cons_block_index
= 0;
2643 XSETCONS (val
, &cons_block
->conses
[cons_block_index
]);
2647 MALLOC_UNBLOCK_INPUT
;
2651 eassert (!CONS_MARKED_P (XCONS (val
)));
2652 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2653 cons_cells_consed
++;
2657 #ifdef GC_CHECK_CONS_LIST
2658 /* Get an error now if there's any junk in the cons free list. */
2660 check_cons_list (void)
2662 struct Lisp_Cons
*tail
= cons_free_list
;
2665 tail
= tail
->u
.chain
;
2669 /* Make a list of 1, 2, 3, 4 or 5 specified objects. */
2672 list1 (Lisp_Object arg1
)
2674 return Fcons (arg1
, Qnil
);
2678 list2 (Lisp_Object arg1
, Lisp_Object arg2
)
2680 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2685 list3 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
)
2687 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2692 list4 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
, Lisp_Object arg4
)
2694 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2699 list5 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
, Lisp_Object arg4
, Lisp_Object arg5
)
2701 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2702 Fcons (arg5
, Qnil
)))));
2706 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
2707 doc
: /* Return a newly created list with specified arguments as elements.
2708 Any number of arguments, even zero arguments, are allowed.
2709 usage: (list &rest OBJECTS) */)
2710 (size_t nargs
, register Lisp_Object
*args
)
2712 register Lisp_Object val
;
2718 val
= Fcons (args
[nargs
], val
);
2724 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2725 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2726 (register Lisp_Object length
, Lisp_Object init
)
2728 register Lisp_Object val
;
2729 register EMACS_INT size
;
2731 CHECK_NATNUM (length
);
2732 size
= XFASTINT (length
);
2737 val
= Fcons (init
, val
);
2742 val
= Fcons (init
, val
);
2747 val
= Fcons (init
, val
);
2752 val
= Fcons (init
, val
);
2757 val
= Fcons (init
, val
);
2772 /***********************************************************************
2774 ***********************************************************************/
2776 /* Singly-linked list of all vectors. */
2778 static struct Lisp_Vector
*all_vectors
;
2780 /* Total number of vector-like objects now in use. */
2782 static int n_vectors
;
2785 /* Value is a pointer to a newly allocated Lisp_Vector structure
2786 with room for LEN Lisp_Objects. */
2788 static struct Lisp_Vector
*
2789 allocate_vectorlike (EMACS_INT len
)
2791 struct Lisp_Vector
*p
;
2796 #ifdef DOUG_LEA_MALLOC
2797 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
2798 because mapped region contents are not preserved in
2800 mallopt (M_MMAP_MAX
, 0);
2803 /* This gets triggered by code which I haven't bothered to fix. --Stef */
2804 /* eassert (!handling_signal); */
2806 nbytes
= (offsetof (struct Lisp_Vector
, contents
)
2807 + len
* sizeof p
->contents
[0]);
2808 p
= (struct Lisp_Vector
*) lisp_malloc (nbytes
, MEM_TYPE_VECTORLIKE
);
2810 #ifdef DOUG_LEA_MALLOC
2811 /* Back to a reasonable maximum of mmap'ed areas. */
2812 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2815 consing_since_gc
+= nbytes
;
2816 vector_cells_consed
+= len
;
2818 p
->header
.next
.vector
= all_vectors
;
2821 MALLOC_UNBLOCK_INPUT
;
2828 /* Allocate a vector with NSLOTS slots. */
2830 struct Lisp_Vector
*
2831 allocate_vector (EMACS_INT nslots
)
2833 struct Lisp_Vector
*v
= allocate_vectorlike (nslots
);
2834 v
->header
.size
= nslots
;
2839 /* Allocate other vector-like structures. */
2841 struct Lisp_Vector
*
2842 allocate_pseudovector (int memlen
, int lisplen
, EMACS_INT tag
)
2844 struct Lisp_Vector
*v
= allocate_vectorlike (memlen
);
2847 /* Only the first lisplen slots will be traced normally by the GC. */
2848 for (i
= 0; i
< lisplen
; ++i
)
2849 v
->contents
[i
] = Qnil
;
2851 XSETPVECTYPESIZE (v
, tag
, lisplen
);
2855 struct Lisp_Hash_Table
*
2856 allocate_hash_table (void)
2858 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Hash_Table
, count
, PVEC_HASH_TABLE
);
2863 allocate_window (void)
2865 return ALLOCATE_PSEUDOVECTOR(struct window
, current_matrix
, PVEC_WINDOW
);
2870 allocate_terminal (void)
2872 struct terminal
*t
= ALLOCATE_PSEUDOVECTOR (struct terminal
,
2873 next_terminal
, PVEC_TERMINAL
);
2874 /* Zero out the non-GC'd fields. FIXME: This should be made unnecessary. */
2875 memset (&t
->next_terminal
, 0,
2876 (char*) (t
+ 1) - (char*) &t
->next_terminal
);
2882 allocate_frame (void)
2884 struct frame
*f
= ALLOCATE_PSEUDOVECTOR (struct frame
,
2885 face_cache
, PVEC_FRAME
);
2886 /* Zero out the non-GC'd fields. FIXME: This should be made unnecessary. */
2887 memset (&f
->face_cache
, 0,
2888 (char *) (f
+ 1) - (char *) &f
->face_cache
);
2893 struct Lisp_Process
*
2894 allocate_process (void)
2896 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Process
, pid
, PVEC_PROCESS
);
2900 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
2901 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
2902 See also the function `vector'. */)
2903 (register Lisp_Object length
, Lisp_Object init
)
2906 register EMACS_INT sizei
;
2907 register EMACS_INT i
;
2908 register struct Lisp_Vector
*p
;
2910 CHECK_NATNUM (length
);
2911 sizei
= XFASTINT (length
);
2913 p
= allocate_vector (sizei
);
2914 for (i
= 0; i
< sizei
; i
++)
2915 p
->contents
[i
] = init
;
2917 XSETVECTOR (vector
, p
);
2922 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
2923 doc
: /* Return a newly created vector with specified arguments as elements.
2924 Any number of arguments, even zero arguments, are allowed.
2925 usage: (vector &rest OBJECTS) */)
2926 (register size_t nargs
, Lisp_Object
*args
)
2928 register Lisp_Object len
, val
;
2930 register struct Lisp_Vector
*p
;
2932 XSETFASTINT (len
, nargs
);
2933 val
= Fmake_vector (len
, Qnil
);
2935 for (i
= 0; i
< nargs
; i
++)
2936 p
->contents
[i
] = args
[i
];
2941 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
2942 doc
: /* Create a byte-code object with specified arguments as elements.
2943 The arguments should be the ARGLIST, bytecode-string BYTE-CODE, constant
2944 vector CONSTANTS, maximum stack size DEPTH, (optional) DOCSTRING,
2945 and (optional) INTERACTIVE-SPEC.
2946 The first four arguments are required; at most six have any
2948 The ARGLIST can be either like the one of `lambda', in which case the arguments
2949 will be dynamically bound before executing the byte code, or it can be an
2950 integer of the form NNNNNNNRMMMMMMM where the 7bit MMMMMMM specifies the
2951 minimum number of arguments, the 7-bit NNNNNNN specifies the maximum number
2952 of arguments (ignoring &rest) and the R bit specifies whether there is a &rest
2953 argument to catch the left-over arguments. If such an integer is used, the
2954 arguments will not be dynamically bound but will be instead pushed on the
2955 stack before executing the byte-code.
2956 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
2957 (register size_t nargs
, Lisp_Object
*args
)
2959 register Lisp_Object len
, val
;
2961 register struct Lisp_Vector
*p
;
2963 XSETFASTINT (len
, nargs
);
2964 if (!NILP (Vpurify_flag
))
2965 val
= make_pure_vector ((EMACS_INT
) nargs
);
2967 val
= Fmake_vector (len
, Qnil
);
2969 if (nargs
> 1 && STRINGP (args
[1]) && STRING_MULTIBYTE (args
[1]))
2970 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
2971 earlier because they produced a raw 8-bit string for byte-code
2972 and now such a byte-code string is loaded as multibyte while
2973 raw 8-bit characters converted to multibyte form. Thus, now we
2974 must convert them back to the original unibyte form. */
2975 args
[1] = Fstring_as_unibyte (args
[1]);
2978 for (i
= 0; i
< nargs
; i
++)
2980 if (!NILP (Vpurify_flag
))
2981 args
[i
] = Fpurecopy (args
[i
]);
2982 p
->contents
[i
] = args
[i
];
2984 XSETPVECTYPE (p
, PVEC_COMPILED
);
2985 XSETCOMPILED (val
, p
);
2991 /***********************************************************************
2993 ***********************************************************************/
2995 /* Each symbol_block is just under 1020 bytes long, since malloc
2996 really allocates in units of powers of two and uses 4 bytes for its
2999 #define SYMBOL_BLOCK_SIZE \
3000 ((1020 - sizeof (struct symbol_block *)) / sizeof (struct Lisp_Symbol))
3004 /* Place `symbols' first, to preserve alignment. */
3005 struct Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
3006 struct symbol_block
*next
;
3009 /* Current symbol block and index of first unused Lisp_Symbol
3012 static struct symbol_block
*symbol_block
;
3013 static int symbol_block_index
;
3015 /* List of free symbols. */
3017 static struct Lisp_Symbol
*symbol_free_list
;
3019 /* Total number of symbol blocks now in use. */
3021 static int n_symbol_blocks
;
3024 /* Initialize symbol allocation. */
3029 symbol_block
= NULL
;
3030 symbol_block_index
= SYMBOL_BLOCK_SIZE
;
3031 symbol_free_list
= 0;
3032 n_symbol_blocks
= 0;
3036 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
3037 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
3038 Its value and function definition are void, and its property list is nil. */)
3041 register Lisp_Object val
;
3042 register struct Lisp_Symbol
*p
;
3044 CHECK_STRING (name
);
3046 /* eassert (!handling_signal); */
3050 if (symbol_free_list
)
3052 XSETSYMBOL (val
, symbol_free_list
);
3053 symbol_free_list
= symbol_free_list
->next
;
3057 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
3059 struct symbol_block
*new;
3060 new = (struct symbol_block
*) lisp_malloc (sizeof *new,
3062 new->next
= symbol_block
;
3064 symbol_block_index
= 0;
3067 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
]);
3068 symbol_block_index
++;
3071 MALLOC_UNBLOCK_INPUT
;
3076 p
->redirect
= SYMBOL_PLAINVAL
;
3077 SET_SYMBOL_VAL (p
, Qunbound
);
3078 p
->function
= Qunbound
;
3081 p
->interned
= SYMBOL_UNINTERNED
;
3083 p
->declared_special
= 0;
3084 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
3091 /***********************************************************************
3092 Marker (Misc) Allocation
3093 ***********************************************************************/
3095 /* Allocation of markers and other objects that share that structure.
3096 Works like allocation of conses. */
3098 #define MARKER_BLOCK_SIZE \
3099 ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc))
3103 /* Place `markers' first, to preserve alignment. */
3104 union Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
3105 struct marker_block
*next
;
3108 static struct marker_block
*marker_block
;
3109 static int marker_block_index
;
3111 static union Lisp_Misc
*marker_free_list
;
3113 /* Total number of marker blocks now in use. */
3115 static int n_marker_blocks
;
3120 marker_block
= NULL
;
3121 marker_block_index
= MARKER_BLOCK_SIZE
;
3122 marker_free_list
= 0;
3123 n_marker_blocks
= 0;
3126 /* Return a newly allocated Lisp_Misc object, with no substructure. */
3129 allocate_misc (void)
3133 /* eassert (!handling_signal); */
3137 if (marker_free_list
)
3139 XSETMISC (val
, marker_free_list
);
3140 marker_free_list
= marker_free_list
->u_free
.chain
;
3144 if (marker_block_index
== MARKER_BLOCK_SIZE
)
3146 struct marker_block
*new;
3147 new = (struct marker_block
*) lisp_malloc (sizeof *new,
3149 new->next
= marker_block
;
3151 marker_block_index
= 0;
3153 total_free_markers
+= MARKER_BLOCK_SIZE
;
3155 XSETMISC (val
, &marker_block
->markers
[marker_block_index
]);
3156 marker_block_index
++;
3159 MALLOC_UNBLOCK_INPUT
;
3161 --total_free_markers
;
3162 consing_since_gc
+= sizeof (union Lisp_Misc
);
3163 misc_objects_consed
++;
3164 XMISCANY (val
)->gcmarkbit
= 0;
3168 /* Free a Lisp_Misc object */
3171 free_misc (Lisp_Object misc
)
3173 XMISCTYPE (misc
) = Lisp_Misc_Free
;
3174 XMISC (misc
)->u_free
.chain
= marker_free_list
;
3175 marker_free_list
= XMISC (misc
);
3177 total_free_markers
++;
3180 /* Return a Lisp_Misc_Save_Value object containing POINTER and
3181 INTEGER. This is used to package C values to call record_unwind_protect.
3182 The unwind function can get the C values back using XSAVE_VALUE. */
3185 make_save_value (void *pointer
, int integer
)
3187 register Lisp_Object val
;
3188 register struct Lisp_Save_Value
*p
;
3190 val
= allocate_misc ();
3191 XMISCTYPE (val
) = Lisp_Misc_Save_Value
;
3192 p
= XSAVE_VALUE (val
);
3193 p
->pointer
= pointer
;
3194 p
->integer
= integer
;
3199 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
3200 doc
: /* Return a newly allocated marker which does not point at any place. */)
3203 register Lisp_Object val
;
3204 register struct Lisp_Marker
*p
;
3206 val
= allocate_misc ();
3207 XMISCTYPE (val
) = Lisp_Misc_Marker
;
3213 p
->insertion_type
= 0;
3217 /* Put MARKER back on the free list after using it temporarily. */
3220 free_marker (Lisp_Object marker
)
3222 unchain_marker (XMARKER (marker
));
3227 /* Return a newly created vector or string with specified arguments as
3228 elements. If all the arguments are characters that can fit
3229 in a string of events, make a string; otherwise, make a vector.
3231 Any number of arguments, even zero arguments, are allowed. */
3234 make_event_array (register int nargs
, Lisp_Object
*args
)
3238 for (i
= 0; i
< nargs
; i
++)
3239 /* The things that fit in a string
3240 are characters that are in 0...127,
3241 after discarding the meta bit and all the bits above it. */
3242 if (!INTEGERP (args
[i
])
3243 || (XINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
3244 return Fvector (nargs
, args
);
3246 /* Since the loop exited, we know that all the things in it are
3247 characters, so we can make a string. */
3251 result
= Fmake_string (make_number (nargs
), make_number (0));
3252 for (i
= 0; i
< nargs
; i
++)
3254 SSET (result
, i
, XINT (args
[i
]));
3255 /* Move the meta bit to the right place for a string char. */
3256 if (XINT (args
[i
]) & CHAR_META
)
3257 SSET (result
, i
, SREF (result
, i
) | 0x80);
3266 /************************************************************************
3267 Memory Full Handling
3268 ************************************************************************/
3271 /* Called if malloc returns zero. */
3280 memory_full_cons_threshold
= sizeof (struct cons_block
);
3282 /* The first time we get here, free the spare memory. */
3283 for (i
= 0; i
< sizeof (spare_memory
) / sizeof (char *); i
++)
3284 if (spare_memory
[i
])
3287 free (spare_memory
[i
]);
3288 else if (i
>= 1 && i
<= 4)
3289 lisp_align_free (spare_memory
[i
]);
3291 lisp_free (spare_memory
[i
]);
3292 spare_memory
[i
] = 0;
3295 /* Record the space now used. When it decreases substantially,
3296 we can refill the memory reserve. */
3297 #if !defined SYSTEM_MALLOC && !defined SYNC_INPUT
3298 bytes_used_when_full
= BYTES_USED
;
3301 /* This used to call error, but if we've run out of memory, we could
3302 get infinite recursion trying to build the string. */
3303 xsignal (Qnil
, Vmemory_signal_data
);
3306 /* If we released our reserve (due to running out of memory),
3307 and we have a fair amount free once again,
3308 try to set aside another reserve in case we run out once more.
3310 This is called when a relocatable block is freed in ralloc.c,
3311 and also directly from this file, in case we're not using ralloc.c. */
3314 refill_memory_reserve (void)
3316 #ifndef SYSTEM_MALLOC
3317 if (spare_memory
[0] == 0)
3318 spare_memory
[0] = (char *) malloc ((size_t) SPARE_MEMORY
);
3319 if (spare_memory
[1] == 0)
3320 spare_memory
[1] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3322 if (spare_memory
[2] == 0)
3323 spare_memory
[2] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3325 if (spare_memory
[3] == 0)
3326 spare_memory
[3] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3328 if (spare_memory
[4] == 0)
3329 spare_memory
[4] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3331 if (spare_memory
[5] == 0)
3332 spare_memory
[5] = (char *) lisp_malloc (sizeof (struct string_block
),
3334 if (spare_memory
[6] == 0)
3335 spare_memory
[6] = (char *) lisp_malloc (sizeof (struct string_block
),
3337 if (spare_memory
[0] && spare_memory
[1] && spare_memory
[5])
3338 Vmemory_full
= Qnil
;
3342 /************************************************************************
3344 ************************************************************************/
3346 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
3348 /* Conservative C stack marking requires a method to identify possibly
3349 live Lisp objects given a pointer value. We do this by keeping
3350 track of blocks of Lisp data that are allocated in a red-black tree
3351 (see also the comment of mem_node which is the type of nodes in
3352 that tree). Function lisp_malloc adds information for an allocated
3353 block to the red-black tree with calls to mem_insert, and function
3354 lisp_free removes it with mem_delete. Functions live_string_p etc
3355 call mem_find to lookup information about a given pointer in the
3356 tree, and use that to determine if the pointer points to a Lisp
3359 /* Initialize this part of alloc.c. */
3364 mem_z
.left
= mem_z
.right
= MEM_NIL
;
3365 mem_z
.parent
= NULL
;
3366 mem_z
.color
= MEM_BLACK
;
3367 mem_z
.start
= mem_z
.end
= NULL
;
3372 /* Value is a pointer to the mem_node containing START. Value is
3373 MEM_NIL if there is no node in the tree containing START. */
3375 static inline struct mem_node
*
3376 mem_find (void *start
)
3380 if (start
< min_heap_address
|| start
> max_heap_address
)
3383 /* Make the search always successful to speed up the loop below. */
3384 mem_z
.start
= start
;
3385 mem_z
.end
= (char *) start
+ 1;
3388 while (start
< p
->start
|| start
>= p
->end
)
3389 p
= start
< p
->start
? p
->left
: p
->right
;
3394 /* Insert a new node into the tree for a block of memory with start
3395 address START, end address END, and type TYPE. Value is a
3396 pointer to the node that was inserted. */
3398 static struct mem_node
*
3399 mem_insert (void *start
, void *end
, enum mem_type type
)
3401 struct mem_node
*c
, *parent
, *x
;
3403 if (min_heap_address
== NULL
|| start
< min_heap_address
)
3404 min_heap_address
= start
;
3405 if (max_heap_address
== NULL
|| end
> max_heap_address
)
3406 max_heap_address
= end
;
3408 /* See where in the tree a node for START belongs. In this
3409 particular application, it shouldn't happen that a node is already
3410 present. For debugging purposes, let's check that. */
3414 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3416 while (c
!= MEM_NIL
)
3418 if (start
>= c
->start
&& start
< c
->end
)
3421 c
= start
< c
->start
? c
->left
: c
->right
;
3424 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3426 while (c
!= MEM_NIL
)
3429 c
= start
< c
->start
? c
->left
: c
->right
;
3432 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3434 /* Create a new node. */
3435 #ifdef GC_MALLOC_CHECK
3436 x
= (struct mem_node
*) _malloc_internal (sizeof *x
);
3440 x
= (struct mem_node
*) xmalloc (sizeof *x
);
3446 x
->left
= x
->right
= MEM_NIL
;
3449 /* Insert it as child of PARENT or install it as root. */
3452 if (start
< parent
->start
)
3460 /* Re-establish red-black tree properties. */
3461 mem_insert_fixup (x
);
3467 /* Re-establish the red-black properties of the tree, and thereby
3468 balance the tree, after node X has been inserted; X is always red. */
3471 mem_insert_fixup (struct mem_node
*x
)
3473 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3475 /* X is red and its parent is red. This is a violation of
3476 red-black tree property #3. */
3478 if (x
->parent
== x
->parent
->parent
->left
)
3480 /* We're on the left side of our grandparent, and Y is our
3482 struct mem_node
*y
= x
->parent
->parent
->right
;
3484 if (y
->color
== MEM_RED
)
3486 /* Uncle and parent are red but should be black because
3487 X is red. Change the colors accordingly and proceed
3488 with the grandparent. */
3489 x
->parent
->color
= MEM_BLACK
;
3490 y
->color
= MEM_BLACK
;
3491 x
->parent
->parent
->color
= MEM_RED
;
3492 x
= x
->parent
->parent
;
3496 /* Parent and uncle have different colors; parent is
3497 red, uncle is black. */
3498 if (x
== x
->parent
->right
)
3501 mem_rotate_left (x
);
3504 x
->parent
->color
= MEM_BLACK
;
3505 x
->parent
->parent
->color
= MEM_RED
;
3506 mem_rotate_right (x
->parent
->parent
);
3511 /* This is the symmetrical case of above. */
3512 struct mem_node
*y
= x
->parent
->parent
->left
;
3514 if (y
->color
== MEM_RED
)
3516 x
->parent
->color
= MEM_BLACK
;
3517 y
->color
= MEM_BLACK
;
3518 x
->parent
->parent
->color
= MEM_RED
;
3519 x
= x
->parent
->parent
;
3523 if (x
== x
->parent
->left
)
3526 mem_rotate_right (x
);
3529 x
->parent
->color
= MEM_BLACK
;
3530 x
->parent
->parent
->color
= MEM_RED
;
3531 mem_rotate_left (x
->parent
->parent
);
3536 /* The root may have been changed to red due to the algorithm. Set
3537 it to black so that property #5 is satisfied. */
3538 mem_root
->color
= MEM_BLACK
;
3549 mem_rotate_left (struct mem_node
*x
)
3553 /* Turn y's left sub-tree into x's right sub-tree. */
3556 if (y
->left
!= MEM_NIL
)
3557 y
->left
->parent
= x
;
3559 /* Y's parent was x's parent. */
3561 y
->parent
= x
->parent
;
3563 /* Get the parent to point to y instead of x. */
3566 if (x
== x
->parent
->left
)
3567 x
->parent
->left
= y
;
3569 x
->parent
->right
= y
;
3574 /* Put x on y's left. */
3588 mem_rotate_right (struct mem_node
*x
)
3590 struct mem_node
*y
= x
->left
;
3593 if (y
->right
!= MEM_NIL
)
3594 y
->right
->parent
= x
;
3597 y
->parent
= x
->parent
;
3600 if (x
== x
->parent
->right
)
3601 x
->parent
->right
= y
;
3603 x
->parent
->left
= y
;
3614 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
3617 mem_delete (struct mem_node
*z
)
3619 struct mem_node
*x
, *y
;
3621 if (!z
|| z
== MEM_NIL
)
3624 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
3629 while (y
->left
!= MEM_NIL
)
3633 if (y
->left
!= MEM_NIL
)
3638 x
->parent
= y
->parent
;
3641 if (y
== y
->parent
->left
)
3642 y
->parent
->left
= x
;
3644 y
->parent
->right
= x
;
3651 z
->start
= y
->start
;
3656 if (y
->color
== MEM_BLACK
)
3657 mem_delete_fixup (x
);
3659 #ifdef GC_MALLOC_CHECK
3667 /* Re-establish the red-black properties of the tree, after a
3671 mem_delete_fixup (struct mem_node
*x
)
3673 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
3675 if (x
== x
->parent
->left
)
3677 struct mem_node
*w
= x
->parent
->right
;
3679 if (w
->color
== MEM_RED
)
3681 w
->color
= MEM_BLACK
;
3682 x
->parent
->color
= MEM_RED
;
3683 mem_rotate_left (x
->parent
);
3684 w
= x
->parent
->right
;
3687 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
3694 if (w
->right
->color
== MEM_BLACK
)
3696 w
->left
->color
= MEM_BLACK
;
3698 mem_rotate_right (w
);
3699 w
= x
->parent
->right
;
3701 w
->color
= x
->parent
->color
;
3702 x
->parent
->color
= MEM_BLACK
;
3703 w
->right
->color
= MEM_BLACK
;
3704 mem_rotate_left (x
->parent
);
3710 struct mem_node
*w
= x
->parent
->left
;
3712 if (w
->color
== MEM_RED
)
3714 w
->color
= MEM_BLACK
;
3715 x
->parent
->color
= MEM_RED
;
3716 mem_rotate_right (x
->parent
);
3717 w
= x
->parent
->left
;
3720 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
3727 if (w
->left
->color
== MEM_BLACK
)
3729 w
->right
->color
= MEM_BLACK
;
3731 mem_rotate_left (w
);
3732 w
= x
->parent
->left
;
3735 w
->color
= x
->parent
->color
;
3736 x
->parent
->color
= MEM_BLACK
;
3737 w
->left
->color
= MEM_BLACK
;
3738 mem_rotate_right (x
->parent
);
3744 x
->color
= MEM_BLACK
;
3748 /* Value is non-zero if P is a pointer to a live Lisp string on
3749 the heap. M is a pointer to the mem_block for P. */
3752 live_string_p (struct mem_node
*m
, void *p
)
3754 if (m
->type
== MEM_TYPE_STRING
)
3756 struct string_block
*b
= (struct string_block
*) m
->start
;
3757 ptrdiff_t offset
= (char *) p
- (char *) &b
->strings
[0];
3759 /* P must point to the start of a Lisp_String structure, and it
3760 must not be on the free-list. */
3762 && offset
% sizeof b
->strings
[0] == 0
3763 && offset
< (STRING_BLOCK_SIZE
* sizeof b
->strings
[0])
3764 && ((struct Lisp_String
*) p
)->data
!= NULL
);
3771 /* Value is non-zero if P is a pointer to a live Lisp cons on
3772 the heap. M is a pointer to the mem_block for P. */
3775 live_cons_p (struct mem_node
*m
, void *p
)
3777 if (m
->type
== MEM_TYPE_CONS
)
3779 struct cons_block
*b
= (struct cons_block
*) m
->start
;
3780 ptrdiff_t offset
= (char *) p
- (char *) &b
->conses
[0];
3782 /* P must point to the start of a Lisp_Cons, not be
3783 one of the unused cells in the current cons block,
3784 and not be on the free-list. */
3786 && offset
% sizeof b
->conses
[0] == 0
3787 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
3789 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
3790 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
3797 /* Value is non-zero if P is a pointer to a live Lisp symbol on
3798 the heap. M is a pointer to the mem_block for P. */
3801 live_symbol_p (struct mem_node
*m
, void *p
)
3803 if (m
->type
== MEM_TYPE_SYMBOL
)
3805 struct symbol_block
*b
= (struct symbol_block
*) m
->start
;
3806 ptrdiff_t offset
= (char *) p
- (char *) &b
->symbols
[0];
3808 /* P must point to the start of a Lisp_Symbol, not be
3809 one of the unused cells in the current symbol block,
3810 and not be on the free-list. */
3812 && offset
% sizeof b
->symbols
[0] == 0
3813 && offset
< (SYMBOL_BLOCK_SIZE
* sizeof b
->symbols
[0])
3814 && (b
!= symbol_block
3815 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
3816 && !EQ (((struct Lisp_Symbol
*) p
)->function
, Vdead
));
3823 /* Value is non-zero if P is a pointer to a live Lisp float on
3824 the heap. M is a pointer to the mem_block for P. */
3827 live_float_p (struct mem_node
*m
, void *p
)
3829 if (m
->type
== MEM_TYPE_FLOAT
)
3831 struct float_block
*b
= (struct float_block
*) m
->start
;
3832 ptrdiff_t offset
= (char *) p
- (char *) &b
->floats
[0];
3834 /* P must point to the start of a Lisp_Float and not be
3835 one of the unused cells in the current float block. */
3837 && offset
% sizeof b
->floats
[0] == 0
3838 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
3839 && (b
!= float_block
3840 || offset
/ sizeof b
->floats
[0] < float_block_index
));
3847 /* Value is non-zero if P is a pointer to a live Lisp Misc on
3848 the heap. M is a pointer to the mem_block for P. */
3851 live_misc_p (struct mem_node
*m
, void *p
)
3853 if (m
->type
== MEM_TYPE_MISC
)
3855 struct marker_block
*b
= (struct marker_block
*) m
->start
;
3856 ptrdiff_t offset
= (char *) p
- (char *) &b
->markers
[0];
3858 /* P must point to the start of a Lisp_Misc, not be
3859 one of the unused cells in the current misc block,
3860 and not be on the free-list. */
3862 && offset
% sizeof b
->markers
[0] == 0
3863 && offset
< (MARKER_BLOCK_SIZE
* sizeof b
->markers
[0])
3864 && (b
!= marker_block
3865 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
3866 && ((union Lisp_Misc
*) p
)->u_any
.type
!= Lisp_Misc_Free
);
3873 /* Value is non-zero if P is a pointer to a live vector-like object.
3874 M is a pointer to the mem_block for P. */
3877 live_vector_p (struct mem_node
*m
, void *p
)
3879 return (p
== m
->start
&& m
->type
== MEM_TYPE_VECTORLIKE
);
3883 /* Value is non-zero if P is a pointer to a live buffer. M is a
3884 pointer to the mem_block for P. */
3887 live_buffer_p (struct mem_node
*m
, void *p
)
3889 /* P must point to the start of the block, and the buffer
3890 must not have been killed. */
3891 return (m
->type
== MEM_TYPE_BUFFER
3893 && !NILP (((struct buffer
*) p
)->BUFFER_INTERNAL_FIELD (name
)));
3896 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
3900 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3902 /* Array of objects that are kept alive because the C stack contains
3903 a pattern that looks like a reference to them . */
3905 #define MAX_ZOMBIES 10
3906 static Lisp_Object zombies
[MAX_ZOMBIES
];
3908 /* Number of zombie objects. */
3910 static int nzombies
;
3912 /* Number of garbage collections. */
3916 /* Average percentage of zombies per collection. */
3918 static double avg_zombies
;
3920 /* Max. number of live and zombie objects. */
3922 static int max_live
, max_zombies
;
3924 /* Average number of live objects per GC. */
3926 static double avg_live
;
3928 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
3929 doc
: /* Show information about live and zombie objects. */)
3932 Lisp_Object args
[8], zombie_list
= Qnil
;
3934 for (i
= 0; i
< nzombies
; i
++)
3935 zombie_list
= Fcons (zombies
[i
], zombie_list
);
3936 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
3937 args
[1] = make_number (ngcs
);
3938 args
[2] = make_float (avg_live
);
3939 args
[3] = make_float (avg_zombies
);
3940 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
3941 args
[5] = make_number (max_live
);
3942 args
[6] = make_number (max_zombies
);
3943 args
[7] = zombie_list
;
3944 return Fmessage (8, args
);
3947 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
3950 /* Mark OBJ if we can prove it's a Lisp_Object. */
3953 mark_maybe_object (Lisp_Object obj
)
3961 po
= (void *) XPNTR (obj
);
3968 switch (XTYPE (obj
))
3971 mark_p
= (live_string_p (m
, po
)
3972 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
3976 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
3980 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
3984 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
3987 case Lisp_Vectorlike
:
3988 /* Note: can't check BUFFERP before we know it's a
3989 buffer because checking that dereferences the pointer
3990 PO which might point anywhere. */
3991 if (live_vector_p (m
, po
))
3992 mark_p
= !SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
3993 else if (live_buffer_p (m
, po
))
3994 mark_p
= BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
3998 mark_p
= (live_misc_p (m
, po
) && !XMISCANY (obj
)->gcmarkbit
);
4007 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4008 if (nzombies
< MAX_ZOMBIES
)
4009 zombies
[nzombies
] = obj
;
4018 /* If P points to Lisp data, mark that as live if it isn't already
4022 mark_maybe_pointer (void *p
)
4026 /* Quickly rule out some values which can't point to Lisp data. */
4029 8 /* USE_LSB_TAG needs Lisp data to be aligned on multiples of 8. */
4031 2 /* We assume that Lisp data is aligned on even addresses. */
4039 Lisp_Object obj
= Qnil
;
4043 case MEM_TYPE_NON_LISP
:
4044 /* Nothing to do; not a pointer to Lisp memory. */
4047 case MEM_TYPE_BUFFER
:
4048 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P((struct buffer
*)p
))
4049 XSETVECTOR (obj
, p
);
4053 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
4057 case MEM_TYPE_STRING
:
4058 if (live_string_p (m
, p
)
4059 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
4060 XSETSTRING (obj
, p
);
4064 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
4068 case MEM_TYPE_SYMBOL
:
4069 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
4070 XSETSYMBOL (obj
, p
);
4073 case MEM_TYPE_FLOAT
:
4074 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
4078 case MEM_TYPE_VECTORLIKE
:
4079 if (live_vector_p (m
, p
))
4082 XSETVECTOR (tem
, p
);
4083 if (!SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
4098 /* Mark Lisp objects referenced from the address range START+OFFSET..END
4099 or END+OFFSET..START. */
4102 mark_memory (void *start
, void *end
, int offset
)
4107 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4111 /* Make START the pointer to the start of the memory region,
4112 if it isn't already. */
4120 /* Mark Lisp_Objects. */
4121 for (p
= (Lisp_Object
*) ((char *) start
+ offset
); (void *) p
< end
; ++p
)
4122 mark_maybe_object (*p
);
4124 /* Mark Lisp data pointed to. This is necessary because, in some
4125 situations, the C compiler optimizes Lisp objects away, so that
4126 only a pointer to them remains. Example:
4128 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
4131 Lisp_Object obj = build_string ("test");
4132 struct Lisp_String *s = XSTRING (obj);
4133 Fgarbage_collect ();
4134 fprintf (stderr, "test `%s'\n", s->data);
4138 Here, `obj' isn't really used, and the compiler optimizes it
4139 away. The only reference to the life string is through the
4142 for (pp
= (void **) ((char *) start
+ offset
); (void *) pp
< end
; ++pp
)
4143 mark_maybe_pointer (*pp
);
4146 /* setjmp will work with GCC unless NON_SAVING_SETJMP is defined in
4147 the GCC system configuration. In gcc 3.2, the only systems for
4148 which this is so are i386-sco5 non-ELF, i386-sysv3 (maybe included
4149 by others?) and ns32k-pc532-min. */
4151 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
4153 static int setjmp_tested_p
, longjmps_done
;
4155 #define SETJMP_WILL_LIKELY_WORK "\
4157 Emacs garbage collector has been changed to use conservative stack\n\
4158 marking. Emacs has determined that the method it uses to do the\n\
4159 marking will likely work on your system, but this isn't sure.\n\
4161 If you are a system-programmer, or can get the help of a local wizard\n\
4162 who is, please take a look at the function mark_stack in alloc.c, and\n\
4163 verify that the methods used are appropriate for your system.\n\
4165 Please mail the result to <emacs-devel@gnu.org>.\n\
4168 #define SETJMP_WILL_NOT_WORK "\
4170 Emacs garbage collector has been changed to use conservative stack\n\
4171 marking. Emacs has determined that the default method it uses to do the\n\
4172 marking will not work on your system. We will need a system-dependent\n\
4173 solution for your system.\n\
4175 Please take a look at the function mark_stack in alloc.c, and\n\
4176 try to find a way to make it work on your system.\n\
4178 Note that you may get false negatives, depending on the compiler.\n\
4179 In particular, you need to use -O with GCC for this test.\n\
4181 Please mail the result to <emacs-devel@gnu.org>.\n\
4185 /* Perform a quick check if it looks like setjmp saves registers in a
4186 jmp_buf. Print a message to stderr saying so. When this test
4187 succeeds, this is _not_ a proof that setjmp is sufficient for
4188 conservative stack marking. Only the sources or a disassembly
4199 /* Arrange for X to be put in a register. */
4205 if (longjmps_done
== 1)
4207 /* Came here after the longjmp at the end of the function.
4209 If x == 1, the longjmp has restored the register to its
4210 value before the setjmp, and we can hope that setjmp
4211 saves all such registers in the jmp_buf, although that
4214 For other values of X, either something really strange is
4215 taking place, or the setjmp just didn't save the register. */
4218 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
4221 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
4228 if (longjmps_done
== 1)
4232 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
4235 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4237 /* Abort if anything GCPRO'd doesn't survive the GC. */
4245 for (p
= gcprolist
; p
; p
= p
->next
)
4246 for (i
= 0; i
< p
->nvars
; ++i
)
4247 if (!survives_gc_p (p
->var
[i
]))
4248 /* FIXME: It's not necessarily a bug. It might just be that the
4249 GCPRO is unnecessary or should release the object sooner. */
4253 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4260 fprintf (stderr
, "\nZombies kept alive = %d:\n", nzombies
);
4261 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
4263 fprintf (stderr
, " %d = ", i
);
4264 debug_print (zombies
[i
]);
4268 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4271 /* Mark live Lisp objects on the C stack.
4273 There are several system-dependent problems to consider when
4274 porting this to new architectures:
4278 We have to mark Lisp objects in CPU registers that can hold local
4279 variables or are used to pass parameters.
4281 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
4282 something that either saves relevant registers on the stack, or
4283 calls mark_maybe_object passing it each register's contents.
4285 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
4286 implementation assumes that calling setjmp saves registers we need
4287 to see in a jmp_buf which itself lies on the stack. This doesn't
4288 have to be true! It must be verified for each system, possibly
4289 by taking a look at the source code of setjmp.
4291 If __builtin_unwind_init is available (defined by GCC >= 2.8) we
4292 can use it as a machine independent method to store all registers
4293 to the stack. In this case the macros described in the previous
4294 two paragraphs are not used.
4298 Architectures differ in the way their processor stack is organized.
4299 For example, the stack might look like this
4302 | Lisp_Object | size = 4
4304 | something else | size = 2
4306 | Lisp_Object | size = 4
4310 In such a case, not every Lisp_Object will be aligned equally. To
4311 find all Lisp_Object on the stack it won't be sufficient to walk
4312 the stack in steps of 4 bytes. Instead, two passes will be
4313 necessary, one starting at the start of the stack, and a second
4314 pass starting at the start of the stack + 2. Likewise, if the
4315 minimal alignment of Lisp_Objects on the stack is 1, four passes
4316 would be necessary, each one starting with one byte more offset
4317 from the stack start.
4319 The current code assumes by default that Lisp_Objects are aligned
4320 equally on the stack. */
4328 #ifdef HAVE___BUILTIN_UNWIND_INIT
4329 /* Force callee-saved registers and register windows onto the stack.
4330 This is the preferred method if available, obviating the need for
4331 machine dependent methods. */
4332 __builtin_unwind_init ();
4334 #else /* not HAVE___BUILTIN_UNWIND_INIT */
4335 #ifndef GC_SAVE_REGISTERS_ON_STACK
4336 /* jmp_buf may not be aligned enough on darwin-ppc64 */
4337 union aligned_jmpbuf
{
4341 volatile int stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
4343 /* This trick flushes the register windows so that all the state of
4344 the process is contained in the stack. */
4345 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
4346 needed on ia64 too. See mach_dep.c, where it also says inline
4347 assembler doesn't work with relevant proprietary compilers. */
4349 #if defined (__sparc64__) && defined (__FreeBSD__)
4350 /* FreeBSD does not have a ta 3 handler. */
4357 /* Save registers that we need to see on the stack. We need to see
4358 registers used to hold register variables and registers used to
4360 #ifdef GC_SAVE_REGISTERS_ON_STACK
4361 GC_SAVE_REGISTERS_ON_STACK (end
);
4362 #else /* not GC_SAVE_REGISTERS_ON_STACK */
4364 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
4365 setjmp will definitely work, test it
4366 and print a message with the result
4368 if (!setjmp_tested_p
)
4370 setjmp_tested_p
= 1;
4373 #endif /* GC_SETJMP_WORKS */
4376 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
4377 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
4378 #endif /* not HAVE___BUILTIN_UNWIND_INIT */
4380 /* This assumes that the stack is a contiguous region in memory. If
4381 that's not the case, something has to be done here to iterate
4382 over the stack segments. */
4383 #ifndef GC_LISP_OBJECT_ALIGNMENT
4385 #define GC_LISP_OBJECT_ALIGNMENT __alignof__ (Lisp_Object)
4387 #define GC_LISP_OBJECT_ALIGNMENT sizeof (Lisp_Object)
4390 for (i
= 0; i
< sizeof (Lisp_Object
); i
+= GC_LISP_OBJECT_ALIGNMENT
)
4391 mark_memory (stack_base
, end
, i
);
4392 /* Allow for marking a secondary stack, like the register stack on the
4394 #ifdef GC_MARK_SECONDARY_STACK
4395 GC_MARK_SECONDARY_STACK ();
4398 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4403 #endif /* GC_MARK_STACK != 0 */
4406 /* Determine whether it is safe to access memory at address P. */
4408 valid_pointer_p (void *p
)
4411 return w32_valid_pointer_p (p
, 16);
4415 /* Obviously, we cannot just access it (we would SEGV trying), so we
4416 trick the o/s to tell us whether p is a valid pointer.
4417 Unfortunately, we cannot use NULL_DEVICE here, as emacs_write may
4418 not validate p in that case. */
4420 if ((fd
= emacs_open ("__Valid__Lisp__Object__", O_CREAT
| O_WRONLY
| O_TRUNC
, 0666)) >= 0)
4422 int valid
= (emacs_write (fd
, (char *)p
, 16) == 16);
4424 unlink ("__Valid__Lisp__Object__");
4432 /* Return 1 if OBJ is a valid lisp object.
4433 Return 0 if OBJ is NOT a valid lisp object.
4434 Return -1 if we cannot validate OBJ.
4435 This function can be quite slow,
4436 so it should only be used in code for manual debugging. */
4439 valid_lisp_object_p (Lisp_Object obj
)
4449 p
= (void *) XPNTR (obj
);
4450 if (PURE_POINTER_P (p
))
4454 return valid_pointer_p (p
);
4461 int valid
= valid_pointer_p (p
);
4473 case MEM_TYPE_NON_LISP
:
4476 case MEM_TYPE_BUFFER
:
4477 return live_buffer_p (m
, p
);
4480 return live_cons_p (m
, p
);
4482 case MEM_TYPE_STRING
:
4483 return live_string_p (m
, p
);
4486 return live_misc_p (m
, p
);
4488 case MEM_TYPE_SYMBOL
:
4489 return live_symbol_p (m
, p
);
4491 case MEM_TYPE_FLOAT
:
4492 return live_float_p (m
, p
);
4494 case MEM_TYPE_VECTORLIKE
:
4495 return live_vector_p (m
, p
);
4508 /***********************************************************************
4509 Pure Storage Management
4510 ***********************************************************************/
4512 /* Allocate room for SIZE bytes from pure Lisp storage and return a
4513 pointer to it. TYPE is the Lisp type for which the memory is
4514 allocated. TYPE < 0 means it's not used for a Lisp object. */
4516 static POINTER_TYPE
*
4517 pure_alloc (size_t size
, int type
)
4519 POINTER_TYPE
*result
;
4521 size_t alignment
= (1 << GCTYPEBITS
);
4523 size_t alignment
= sizeof (EMACS_INT
);
4525 /* Give Lisp_Floats an extra alignment. */
4526 if (type
== Lisp_Float
)
4528 #if defined __GNUC__ && __GNUC__ >= 2
4529 alignment
= __alignof (struct Lisp_Float
);
4531 alignment
= sizeof (struct Lisp_Float
);
4539 /* Allocate space for a Lisp object from the beginning of the free
4540 space with taking account of alignment. */
4541 result
= ALIGN (purebeg
+ pure_bytes_used_lisp
, alignment
);
4542 pure_bytes_used_lisp
= ((char *)result
- (char *)purebeg
) + size
;
4546 /* Allocate space for a non-Lisp object from the end of the free
4548 pure_bytes_used_non_lisp
+= size
;
4549 result
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4551 pure_bytes_used
= pure_bytes_used_lisp
+ pure_bytes_used_non_lisp
;
4553 if (pure_bytes_used
<= pure_size
)
4556 /* Don't allocate a large amount here,
4557 because it might get mmap'd and then its address
4558 might not be usable. */
4559 purebeg
= (char *) xmalloc (10000);
4561 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
4562 pure_bytes_used
= 0;
4563 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
4568 /* Print a warning if PURESIZE is too small. */
4571 check_pure_size (void)
4573 if (pure_bytes_used_before_overflow
)
4574 message (("emacs:0:Pure Lisp storage overflow (approx. %"pI
"d"
4576 pure_bytes_used
+ pure_bytes_used_before_overflow
);
4580 /* Find the byte sequence {DATA[0], ..., DATA[NBYTES-1], '\0'} from
4581 the non-Lisp data pool of the pure storage, and return its start
4582 address. Return NULL if not found. */
4585 find_string_data_in_pure (const char *data
, EMACS_INT nbytes
)
4588 EMACS_INT skip
, bm_skip
[256], last_char_skip
, infinity
, start
, start_max
;
4589 const unsigned char *p
;
4592 if (pure_bytes_used_non_lisp
< nbytes
+ 1)
4595 /* Set up the Boyer-Moore table. */
4597 for (i
= 0; i
< 256; i
++)
4600 p
= (const unsigned char *) data
;
4602 bm_skip
[*p
++] = skip
;
4604 last_char_skip
= bm_skip
['\0'];
4606 non_lisp_beg
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4607 start_max
= pure_bytes_used_non_lisp
- (nbytes
+ 1);
4609 /* See the comments in the function `boyer_moore' (search.c) for the
4610 use of `infinity'. */
4611 infinity
= pure_bytes_used_non_lisp
+ 1;
4612 bm_skip
['\0'] = infinity
;
4614 p
= (const unsigned char *) non_lisp_beg
+ nbytes
;
4618 /* Check the last character (== '\0'). */
4621 start
+= bm_skip
[*(p
+ start
)];
4623 while (start
<= start_max
);
4625 if (start
< infinity
)
4626 /* Couldn't find the last character. */
4629 /* No less than `infinity' means we could find the last
4630 character at `p[start - infinity]'. */
4633 /* Check the remaining characters. */
4634 if (memcmp (data
, non_lisp_beg
+ start
, nbytes
) == 0)
4636 return non_lisp_beg
+ start
;
4638 start
+= last_char_skip
;
4640 while (start
<= start_max
);
4646 /* Return a string allocated in pure space. DATA is a buffer holding
4647 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
4648 non-zero means make the result string multibyte.
4650 Must get an error if pure storage is full, since if it cannot hold
4651 a large string it may be able to hold conses that point to that
4652 string; then the string is not protected from gc. */
4655 make_pure_string (const char *data
,
4656 EMACS_INT nchars
, EMACS_INT nbytes
, int multibyte
)
4659 struct Lisp_String
*s
;
4661 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4662 s
->data
= (unsigned char *) find_string_data_in_pure (data
, nbytes
);
4663 if (s
->data
== NULL
)
4665 s
->data
= (unsigned char *) pure_alloc (nbytes
+ 1, -1);
4666 memcpy (s
->data
, data
, nbytes
);
4667 s
->data
[nbytes
] = '\0';
4670 s
->size_byte
= multibyte
? nbytes
: -1;
4671 s
->intervals
= NULL_INTERVAL
;
4672 XSETSTRING (string
, s
);
4676 /* Return a string a string allocated in pure space. Do not allocate
4677 the string data, just point to DATA. */
4680 make_pure_c_string (const char *data
)
4683 struct Lisp_String
*s
;
4684 EMACS_INT nchars
= strlen (data
);
4686 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4689 s
->data
= (unsigned char *) data
;
4690 s
->intervals
= NULL_INTERVAL
;
4691 XSETSTRING (string
, s
);
4695 /* Return a cons allocated from pure space. Give it pure copies
4696 of CAR as car and CDR as cdr. */
4699 pure_cons (Lisp_Object car
, Lisp_Object cdr
)
4701 register Lisp_Object
new;
4702 struct Lisp_Cons
*p
;
4704 p
= (struct Lisp_Cons
*) pure_alloc (sizeof *p
, Lisp_Cons
);
4706 XSETCAR (new, Fpurecopy (car
));
4707 XSETCDR (new, Fpurecopy (cdr
));
4712 /* Value is a float object with value NUM allocated from pure space. */
4715 make_pure_float (double num
)
4717 register Lisp_Object
new;
4718 struct Lisp_Float
*p
;
4720 p
= (struct Lisp_Float
*) pure_alloc (sizeof *p
, Lisp_Float
);
4722 XFLOAT_INIT (new, num
);
4727 /* Return a vector with room for LEN Lisp_Objects allocated from
4731 make_pure_vector (EMACS_INT len
)
4734 struct Lisp_Vector
*p
;
4735 size_t size
= (offsetof (struct Lisp_Vector
, contents
)
4736 + len
* sizeof (Lisp_Object
));
4738 p
= (struct Lisp_Vector
*) pure_alloc (size
, Lisp_Vectorlike
);
4739 XSETVECTOR (new, p
);
4740 XVECTOR (new)->header
.size
= len
;
4745 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
4746 doc
: /* Make a copy of object OBJ in pure storage.
4747 Recursively copies contents of vectors and cons cells.
4748 Does not copy symbols. Copies strings without text properties. */)
4749 (register Lisp_Object obj
)
4751 if (NILP (Vpurify_flag
))
4754 if (PURE_POINTER_P (XPNTR (obj
)))
4757 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
4759 Lisp_Object tmp
= Fgethash (obj
, Vpurify_flag
, Qnil
);
4765 obj
= pure_cons (XCAR (obj
), XCDR (obj
));
4766 else if (FLOATP (obj
))
4767 obj
= make_pure_float (XFLOAT_DATA (obj
));
4768 else if (STRINGP (obj
))
4769 obj
= make_pure_string (SSDATA (obj
), SCHARS (obj
),
4771 STRING_MULTIBYTE (obj
));
4772 else if (COMPILEDP (obj
) || VECTORP (obj
))
4774 register struct Lisp_Vector
*vec
;
4775 register EMACS_INT i
;
4779 if (size
& PSEUDOVECTOR_FLAG
)
4780 size
&= PSEUDOVECTOR_SIZE_MASK
;
4781 vec
= XVECTOR (make_pure_vector (size
));
4782 for (i
= 0; i
< size
; i
++)
4783 vec
->contents
[i
] = Fpurecopy (XVECTOR (obj
)->contents
[i
]);
4784 if (COMPILEDP (obj
))
4786 XSETPVECTYPE (vec
, PVEC_COMPILED
);
4787 XSETCOMPILED (obj
, vec
);
4790 XSETVECTOR (obj
, vec
);
4792 else if (MARKERP (obj
))
4793 error ("Attempt to copy a marker to pure storage");
4795 /* Not purified, don't hash-cons. */
4798 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
4799 Fputhash (obj
, obj
, Vpurify_flag
);
4806 /***********************************************************************
4808 ***********************************************************************/
4810 /* Put an entry in staticvec, pointing at the variable with address
4814 staticpro (Lisp_Object
*varaddress
)
4816 staticvec
[staticidx
++] = varaddress
;
4817 if (staticidx
>= NSTATICS
)
4822 /***********************************************************************
4824 ***********************************************************************/
4826 /* Temporarily prevent garbage collection. */
4829 inhibit_garbage_collection (void)
4831 int count
= SPECPDL_INDEX ();
4832 int nbits
= min (VALBITS
, BITS_PER_INT
);
4834 specbind (Qgc_cons_threshold
, make_number (((EMACS_INT
) 1 << (nbits
- 1)) - 1));
4839 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
4840 doc
: /* Reclaim storage for Lisp objects no longer needed.
4841 Garbage collection happens automatically if you cons more than
4842 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
4843 `garbage-collect' normally returns a list with info on amount of space in use:
4844 ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)
4845 (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS
4846 (USED-FLOATS . FREE-FLOATS) (USED-INTERVALS . FREE-INTERVALS)
4847 (USED-STRINGS . FREE-STRINGS))
4848 However, if there was overflow in pure space, `garbage-collect'
4849 returns nil, because real GC can't be done. */)
4852 register struct specbinding
*bind
;
4853 char stack_top_variable
;
4856 Lisp_Object total
[8];
4857 int count
= SPECPDL_INDEX ();
4858 EMACS_TIME t1
, t2
, t3
;
4863 /* Can't GC if pure storage overflowed because we can't determine
4864 if something is a pure object or not. */
4865 if (pure_bytes_used_before_overflow
)
4870 /* Don't keep undo information around forever.
4871 Do this early on, so it is no problem if the user quits. */
4873 register struct buffer
*nextb
= all_buffers
;
4877 /* If a buffer's undo list is Qt, that means that undo is
4878 turned off in that buffer. Calling truncate_undo_list on
4879 Qt tends to return NULL, which effectively turns undo back on.
4880 So don't call truncate_undo_list if undo_list is Qt. */
4881 if (! NILP (nextb
->BUFFER_INTERNAL_FIELD (name
)) && ! EQ (nextb
->BUFFER_INTERNAL_FIELD (undo_list
), Qt
))
4882 truncate_undo_list (nextb
);
4884 /* Shrink buffer gaps, but skip indirect and dead buffers. */
4885 if (nextb
->base_buffer
== 0 && !NILP (nextb
->BUFFER_INTERNAL_FIELD (name
))
4886 && ! nextb
->text
->inhibit_shrinking
)
4888 /* If a buffer's gap size is more than 10% of the buffer
4889 size, or larger than 2000 bytes, then shrink it
4890 accordingly. Keep a minimum size of 20 bytes. */
4891 int size
= min (2000, max (20, (nextb
->text
->z_byte
/ 10)));
4893 if (nextb
->text
->gap_size
> size
)
4895 struct buffer
*save_current
= current_buffer
;
4896 current_buffer
= nextb
;
4897 make_gap (-(nextb
->text
->gap_size
- size
));
4898 current_buffer
= save_current
;
4902 nextb
= nextb
->header
.next
.buffer
;
4906 EMACS_GET_TIME (t1
);
4908 /* In case user calls debug_print during GC,
4909 don't let that cause a recursive GC. */
4910 consing_since_gc
= 0;
4912 /* Save what's currently displayed in the echo area. */
4913 message_p
= push_message ();
4914 record_unwind_protect (pop_message_unwind
, Qnil
);
4916 /* Save a copy of the contents of the stack, for debugging. */
4917 #if MAX_SAVE_STACK > 0
4918 if (NILP (Vpurify_flag
))
4922 if (&stack_top_variable
< stack_bottom
)
4924 stack
= &stack_top_variable
;
4925 stack_size
= stack_bottom
- &stack_top_variable
;
4929 stack
= stack_bottom
;
4930 stack_size
= &stack_top_variable
- stack_bottom
;
4932 if (stack_size
<= MAX_SAVE_STACK
)
4934 if (stack_copy_size
< stack_size
)
4936 stack_copy
= (char *) xrealloc (stack_copy
, stack_size
);
4937 stack_copy_size
= stack_size
;
4939 memcpy (stack_copy
, stack
, stack_size
);
4942 #endif /* MAX_SAVE_STACK > 0 */
4944 if (garbage_collection_messages
)
4945 message1_nolog ("Garbage collecting...");
4949 shrink_regexp_cache ();
4953 /* clear_marks (); */
4955 /* Mark all the special slots that serve as the roots of accessibility. */
4957 for (i
= 0; i
< staticidx
; i
++)
4958 mark_object (*staticvec
[i
]);
4960 for (bind
= specpdl
; bind
!= specpdl_ptr
; bind
++)
4962 mark_object (bind
->symbol
);
4963 mark_object (bind
->old_value
);
4971 extern void xg_mark_data (void);
4976 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
4977 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
4981 register struct gcpro
*tail
;
4982 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
4983 for (i
= 0; i
< tail
->nvars
; i
++)
4984 mark_object (tail
->var
[i
]);
4988 struct catchtag
*catch;
4989 struct handler
*handler
;
4991 for (catch = catchlist
; catch; catch = catch->next
)
4993 mark_object (catch->tag
);
4994 mark_object (catch->val
);
4996 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
4998 mark_object (handler
->handler
);
4999 mark_object (handler
->var
);
5005 #ifdef HAVE_WINDOW_SYSTEM
5006 mark_fringe_data ();
5009 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5013 /* Everything is now marked, except for the things that require special
5014 finalization, i.e. the undo_list.
5015 Look thru every buffer's undo list
5016 for elements that update markers that were not marked,
5019 register struct buffer
*nextb
= all_buffers
;
5023 /* If a buffer's undo list is Qt, that means that undo is
5024 turned off in that buffer. Calling truncate_undo_list on
5025 Qt tends to return NULL, which effectively turns undo back on.
5026 So don't call truncate_undo_list if undo_list is Qt. */
5027 if (! EQ (nextb
->BUFFER_INTERNAL_FIELD (undo_list
), Qt
))
5029 Lisp_Object tail
, prev
;
5030 tail
= nextb
->BUFFER_INTERNAL_FIELD (undo_list
);
5032 while (CONSP (tail
))
5034 if (CONSP (XCAR (tail
))
5035 && MARKERP (XCAR (XCAR (tail
)))
5036 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
5039 nextb
->BUFFER_INTERNAL_FIELD (undo_list
) = tail
= XCDR (tail
);
5043 XSETCDR (prev
, tail
);
5053 /* Now that we have stripped the elements that need not be in the
5054 undo_list any more, we can finally mark the list. */
5055 mark_object (nextb
->BUFFER_INTERNAL_FIELD (undo_list
));
5057 nextb
= nextb
->header
.next
.buffer
;
5063 /* Clear the mark bits that we set in certain root slots. */
5065 unmark_byte_stack ();
5066 VECTOR_UNMARK (&buffer_defaults
);
5067 VECTOR_UNMARK (&buffer_local_symbols
);
5069 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
5077 /* clear_marks (); */
5080 consing_since_gc
= 0;
5081 if (gc_cons_threshold
< 10000)
5082 gc_cons_threshold
= 10000;
5084 if (FLOATP (Vgc_cons_percentage
))
5085 { /* Set gc_cons_combined_threshold. */
5088 tot
+= total_conses
* sizeof (struct Lisp_Cons
);
5089 tot
+= total_symbols
* sizeof (struct Lisp_Symbol
);
5090 tot
+= total_markers
* sizeof (union Lisp_Misc
);
5091 tot
+= total_string_size
;
5092 tot
+= total_vector_size
* sizeof (Lisp_Object
);
5093 tot
+= total_floats
* sizeof (struct Lisp_Float
);
5094 tot
+= total_intervals
* sizeof (struct interval
);
5095 tot
+= total_strings
* sizeof (struct Lisp_String
);
5097 gc_relative_threshold
= tot
* XFLOAT_DATA (Vgc_cons_percentage
);
5100 gc_relative_threshold
= 0;
5102 if (garbage_collection_messages
)
5104 if (message_p
|| minibuf_level
> 0)
5107 message1_nolog ("Garbage collecting...done");
5110 unbind_to (count
, Qnil
);
5112 total
[0] = Fcons (make_number (total_conses
),
5113 make_number (total_free_conses
));
5114 total
[1] = Fcons (make_number (total_symbols
),
5115 make_number (total_free_symbols
));
5116 total
[2] = Fcons (make_number (total_markers
),
5117 make_number (total_free_markers
));
5118 total
[3] = make_number (total_string_size
);
5119 total
[4] = make_number (total_vector_size
);
5120 total
[5] = Fcons (make_number (total_floats
),
5121 make_number (total_free_floats
));
5122 total
[6] = Fcons (make_number (total_intervals
),
5123 make_number (total_free_intervals
));
5124 total
[7] = Fcons (make_number (total_strings
),
5125 make_number (total_free_strings
));
5127 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5129 /* Compute average percentage of zombies. */
5132 for (i
= 0; i
< 7; ++i
)
5133 if (CONSP (total
[i
]))
5134 nlive
+= XFASTINT (XCAR (total
[i
]));
5136 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
5137 max_live
= max (nlive
, max_live
);
5138 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
5139 max_zombies
= max (nzombies
, max_zombies
);
5144 if (!NILP (Vpost_gc_hook
))
5146 int gc_count
= inhibit_garbage_collection ();
5147 safe_run_hooks (Qpost_gc_hook
);
5148 unbind_to (gc_count
, Qnil
);
5151 /* Accumulate statistics. */
5152 EMACS_GET_TIME (t2
);
5153 EMACS_SUB_TIME (t3
, t2
, t1
);
5154 if (FLOATP (Vgc_elapsed
))
5155 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
) +
5157 EMACS_USECS (t3
) * 1.0e-6);
5160 return Flist (sizeof total
/ sizeof *total
, total
);
5164 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
5165 only interesting objects referenced from glyphs are strings. */
5168 mark_glyph_matrix (struct glyph_matrix
*matrix
)
5170 struct glyph_row
*row
= matrix
->rows
;
5171 struct glyph_row
*end
= row
+ matrix
->nrows
;
5173 for (; row
< end
; ++row
)
5177 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
5179 struct glyph
*glyph
= row
->glyphs
[area
];
5180 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
5182 for (; glyph
< end_glyph
; ++glyph
)
5183 if (STRINGP (glyph
->object
)
5184 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
5185 mark_object (glyph
->object
);
5191 /* Mark Lisp faces in the face cache C. */
5194 mark_face_cache (struct face_cache
*c
)
5199 for (i
= 0; i
< c
->used
; ++i
)
5201 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
5205 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
5206 mark_object (face
->lface
[j
]);
5214 /* Mark reference to a Lisp_Object.
5215 If the object referred to has not been seen yet, recursively mark
5216 all the references contained in it. */
5218 #define LAST_MARKED_SIZE 500
5219 static Lisp_Object last_marked
[LAST_MARKED_SIZE
];
5220 static int last_marked_index
;
5222 /* For debugging--call abort when we cdr down this many
5223 links of a list, in mark_object. In debugging,
5224 the call to abort will hit a breakpoint.
5225 Normally this is zero and the check never goes off. */
5226 static size_t mark_object_loop_halt
;
5229 mark_vectorlike (struct Lisp_Vector
*ptr
)
5231 register EMACS_UINT size
= ptr
->header
.size
;
5232 register EMACS_UINT i
;
5234 eassert (!VECTOR_MARKED_P (ptr
));
5235 VECTOR_MARK (ptr
); /* Else mark it */
5236 if (size
& PSEUDOVECTOR_FLAG
)
5237 size
&= PSEUDOVECTOR_SIZE_MASK
;
5239 /* Note that this size is not the memory-footprint size, but only
5240 the number of Lisp_Object fields that we should trace.
5241 The distinction is used e.g. by Lisp_Process which places extra
5242 non-Lisp_Object fields at the end of the structure. */
5243 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5244 mark_object (ptr
->contents
[i
]);
5247 /* Like mark_vectorlike but optimized for char-tables (and
5248 sub-char-tables) assuming that the contents are mostly integers or
5252 mark_char_table (struct Lisp_Vector
*ptr
)
5254 register EMACS_UINT size
= ptr
->header
.size
& PSEUDOVECTOR_SIZE_MASK
;
5255 register EMACS_UINT i
;
5257 eassert (!VECTOR_MARKED_P (ptr
));
5259 for (i
= 0; i
< size
; i
++)
5261 Lisp_Object val
= ptr
->contents
[i
];
5263 if (INTEGERP (val
) || (SYMBOLP (val
) && XSYMBOL (val
)->gcmarkbit
))
5265 if (SUB_CHAR_TABLE_P (val
))
5267 if (! VECTOR_MARKED_P (XVECTOR (val
)))
5268 mark_char_table (XVECTOR (val
));
5276 mark_object (Lisp_Object arg
)
5278 register Lisp_Object obj
= arg
;
5279 #ifdef GC_CHECK_MARKED_OBJECTS
5283 size_t cdr_count
= 0;
5287 if (PURE_POINTER_P (XPNTR (obj
)))
5290 last_marked
[last_marked_index
++] = obj
;
5291 if (last_marked_index
== LAST_MARKED_SIZE
)
5292 last_marked_index
= 0;
5294 /* Perform some sanity checks on the objects marked here. Abort if
5295 we encounter an object we know is bogus. This increases GC time
5296 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
5297 #ifdef GC_CHECK_MARKED_OBJECTS
5299 po
= (void *) XPNTR (obj
);
5301 /* Check that the object pointed to by PO is known to be a Lisp
5302 structure allocated from the heap. */
5303 #define CHECK_ALLOCATED() \
5305 m = mem_find (po); \
5310 /* Check that the object pointed to by PO is live, using predicate
5312 #define CHECK_LIVE(LIVEP) \
5314 if (!LIVEP (m, po)) \
5318 /* Check both of the above conditions. */
5319 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
5321 CHECK_ALLOCATED (); \
5322 CHECK_LIVE (LIVEP); \
5325 #else /* not GC_CHECK_MARKED_OBJECTS */
5327 #define CHECK_LIVE(LIVEP) (void) 0
5328 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
5330 #endif /* not GC_CHECK_MARKED_OBJECTS */
5332 switch (SWITCH_ENUM_CAST (XTYPE (obj
)))
5336 register struct Lisp_String
*ptr
= XSTRING (obj
);
5337 if (STRING_MARKED_P (ptr
))
5339 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
5340 MARK_INTERVAL_TREE (ptr
->intervals
);
5342 #ifdef GC_CHECK_STRING_BYTES
5343 /* Check that the string size recorded in the string is the
5344 same as the one recorded in the sdata structure. */
5345 CHECK_STRING_BYTES (ptr
);
5346 #endif /* GC_CHECK_STRING_BYTES */
5350 case Lisp_Vectorlike
:
5351 if (VECTOR_MARKED_P (XVECTOR (obj
)))
5353 #ifdef GC_CHECK_MARKED_OBJECTS
5355 if (m
== MEM_NIL
&& !SUBRP (obj
)
5356 && po
!= &buffer_defaults
5357 && po
!= &buffer_local_symbols
)
5359 #endif /* GC_CHECK_MARKED_OBJECTS */
5363 #ifdef GC_CHECK_MARKED_OBJECTS
5364 if (po
!= &buffer_defaults
&& po
!= &buffer_local_symbols
)
5367 for (b
= all_buffers
; b
&& b
!= po
; b
= b
->header
.next
.buffer
)
5372 #endif /* GC_CHECK_MARKED_OBJECTS */
5375 else if (SUBRP (obj
))
5377 else if (COMPILEDP (obj
))
5378 /* We could treat this just like a vector, but it is better to
5379 save the COMPILED_CONSTANTS element for last and avoid
5382 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5383 register EMACS_UINT size
= ptr
->header
.size
;
5384 register EMACS_UINT i
;
5386 CHECK_LIVE (live_vector_p
);
5387 VECTOR_MARK (ptr
); /* Else mark it */
5388 size
&= PSEUDOVECTOR_SIZE_MASK
;
5389 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5391 if (i
!= COMPILED_CONSTANTS
)
5392 mark_object (ptr
->contents
[i
]);
5394 obj
= ptr
->contents
[COMPILED_CONSTANTS
];
5397 else if (FRAMEP (obj
))
5399 register struct frame
*ptr
= XFRAME (obj
);
5400 mark_vectorlike (XVECTOR (obj
));
5401 mark_face_cache (ptr
->face_cache
);
5403 else if (WINDOWP (obj
))
5405 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5406 struct window
*w
= XWINDOW (obj
);
5407 mark_vectorlike (ptr
);
5408 /* Mark glyphs for leaf windows. Marking window matrices is
5409 sufficient because frame matrices use the same glyph
5411 if (NILP (w
->hchild
)
5413 && w
->current_matrix
)
5415 mark_glyph_matrix (w
->current_matrix
);
5416 mark_glyph_matrix (w
->desired_matrix
);
5419 else if (HASH_TABLE_P (obj
))
5421 struct Lisp_Hash_Table
*h
= XHASH_TABLE (obj
);
5422 mark_vectorlike ((struct Lisp_Vector
*)h
);
5423 /* If hash table is not weak, mark all keys and values.
5424 For weak tables, mark only the vector. */
5426 mark_object (h
->key_and_value
);
5428 VECTOR_MARK (XVECTOR (h
->key_and_value
));
5430 else if (CHAR_TABLE_P (obj
))
5431 mark_char_table (XVECTOR (obj
));
5433 mark_vectorlike (XVECTOR (obj
));
5438 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
5439 struct Lisp_Symbol
*ptrx
;
5443 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
5445 mark_object (ptr
->function
);
5446 mark_object (ptr
->plist
);
5447 switch (ptr
->redirect
)
5449 case SYMBOL_PLAINVAL
: mark_object (SYMBOL_VAL (ptr
)); break;
5450 case SYMBOL_VARALIAS
:
5453 XSETSYMBOL (tem
, SYMBOL_ALIAS (ptr
));
5457 case SYMBOL_LOCALIZED
:
5459 struct Lisp_Buffer_Local_Value
*blv
= SYMBOL_BLV (ptr
);
5460 /* If the value is forwarded to a buffer or keyboard field,
5461 these are marked when we see the corresponding object.
5462 And if it's forwarded to a C variable, either it's not
5463 a Lisp_Object var, or it's staticpro'd already. */
5464 mark_object (blv
->where
);
5465 mark_object (blv
->valcell
);
5466 mark_object (blv
->defcell
);
5469 case SYMBOL_FORWARDED
:
5470 /* If the value is forwarded to a buffer or keyboard field,
5471 these are marked when we see the corresponding object.
5472 And if it's forwarded to a C variable, either it's not
5473 a Lisp_Object var, or it's staticpro'd already. */
5477 if (!PURE_POINTER_P (XSTRING (ptr
->xname
)))
5478 MARK_STRING (XSTRING (ptr
->xname
));
5479 MARK_INTERVAL_TREE (STRING_INTERVALS (ptr
->xname
));
5484 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun */
5485 XSETSYMBOL (obj
, ptrx
);
5492 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
5493 if (XMISCANY (obj
)->gcmarkbit
)
5495 XMISCANY (obj
)->gcmarkbit
= 1;
5497 switch (XMISCTYPE (obj
))
5500 case Lisp_Misc_Marker
:
5501 /* DO NOT mark thru the marker's chain.
5502 The buffer's markers chain does not preserve markers from gc;
5503 instead, markers are removed from the chain when freed by gc. */
5506 case Lisp_Misc_Save_Value
:
5509 register struct Lisp_Save_Value
*ptr
= XSAVE_VALUE (obj
);
5510 /* If DOGC is set, POINTER is the address of a memory
5511 area containing INTEGER potential Lisp_Objects. */
5514 Lisp_Object
*p
= (Lisp_Object
*) ptr
->pointer
;
5516 for (nelt
= ptr
->integer
; nelt
> 0; nelt
--, p
++)
5517 mark_maybe_object (*p
);
5523 case Lisp_Misc_Overlay
:
5525 struct Lisp_Overlay
*ptr
= XOVERLAY (obj
);
5526 mark_object (ptr
->start
);
5527 mark_object (ptr
->end
);
5528 mark_object (ptr
->plist
);
5531 XSETMISC (obj
, ptr
->next
);
5544 register struct Lisp_Cons
*ptr
= XCONS (obj
);
5545 if (CONS_MARKED_P (ptr
))
5547 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
5549 /* If the cdr is nil, avoid recursion for the car. */
5550 if (EQ (ptr
->u
.cdr
, Qnil
))
5556 mark_object (ptr
->car
);
5559 if (cdr_count
== mark_object_loop_halt
)
5565 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
5566 FLOAT_MARK (XFLOAT (obj
));
5577 #undef CHECK_ALLOCATED
5578 #undef CHECK_ALLOCATED_AND_LIVE
5581 /* Mark the pointers in a buffer structure. */
5584 mark_buffer (Lisp_Object buf
)
5586 register struct buffer
*buffer
= XBUFFER (buf
);
5587 register Lisp_Object
*ptr
, tmp
;
5588 Lisp_Object base_buffer
;
5590 eassert (!VECTOR_MARKED_P (buffer
));
5591 VECTOR_MARK (buffer
);
5593 MARK_INTERVAL_TREE (BUF_INTERVALS (buffer
));
5595 /* For now, we just don't mark the undo_list. It's done later in
5596 a special way just before the sweep phase, and after stripping
5597 some of its elements that are not needed any more. */
5599 if (buffer
->overlays_before
)
5601 XSETMISC (tmp
, buffer
->overlays_before
);
5604 if (buffer
->overlays_after
)
5606 XSETMISC (tmp
, buffer
->overlays_after
);
5610 /* buffer-local Lisp variables start at `undo_list',
5611 tho only the ones from `name' on are GC'd normally. */
5612 for (ptr
= &buffer
->BUFFER_INTERNAL_FIELD (name
);
5613 (char *)ptr
< (char *)buffer
+ sizeof (struct buffer
);
5617 /* If this is an indirect buffer, mark its base buffer. */
5618 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
5620 XSETBUFFER (base_buffer
, buffer
->base_buffer
);
5621 mark_buffer (base_buffer
);
5625 /* Mark the Lisp pointers in the terminal objects.
5626 Called by the Fgarbage_collector. */
5629 mark_terminals (void)
5632 for (t
= terminal_list
; t
; t
= t
->next_terminal
)
5634 eassert (t
->name
!= NULL
);
5635 #ifdef HAVE_WINDOW_SYSTEM
5636 /* If a terminal object is reachable from a stacpro'ed object,
5637 it might have been marked already. Make sure the image cache
5639 mark_image_cache (t
->image_cache
);
5640 #endif /* HAVE_WINDOW_SYSTEM */
5641 if (!VECTOR_MARKED_P (t
))
5642 mark_vectorlike ((struct Lisp_Vector
*)t
);
5648 /* Value is non-zero if OBJ will survive the current GC because it's
5649 either marked or does not need to be marked to survive. */
5652 survives_gc_p (Lisp_Object obj
)
5656 switch (XTYPE (obj
))
5663 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
5667 survives_p
= XMISCANY (obj
)->gcmarkbit
;
5671 survives_p
= STRING_MARKED_P (XSTRING (obj
));
5674 case Lisp_Vectorlike
:
5675 survives_p
= SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
5679 survives_p
= CONS_MARKED_P (XCONS (obj
));
5683 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
5690 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
5695 /* Sweep: find all structures not marked, and free them. */
5700 /* Remove or mark entries in weak hash tables.
5701 This must be done before any object is unmarked. */
5702 sweep_weak_hash_tables ();
5705 #ifdef GC_CHECK_STRING_BYTES
5706 if (!noninteractive
)
5707 check_string_bytes (1);
5710 /* Put all unmarked conses on free list */
5712 register struct cons_block
*cblk
;
5713 struct cons_block
**cprev
= &cons_block
;
5714 register int lim
= cons_block_index
;
5715 register int num_free
= 0, num_used
= 0;
5719 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
5723 int ilim
= (lim
+ BITS_PER_INT
- 1) / BITS_PER_INT
;
5725 /* Scan the mark bits an int at a time. */
5726 for (i
= 0; i
<= ilim
; i
++)
5728 if (cblk
->gcmarkbits
[i
] == -1)
5730 /* Fast path - all cons cells for this int are marked. */
5731 cblk
->gcmarkbits
[i
] = 0;
5732 num_used
+= BITS_PER_INT
;
5736 /* Some cons cells for this int are not marked.
5737 Find which ones, and free them. */
5738 int start
, pos
, stop
;
5740 start
= i
* BITS_PER_INT
;
5742 if (stop
> BITS_PER_INT
)
5743 stop
= BITS_PER_INT
;
5746 for (pos
= start
; pos
< stop
; pos
++)
5748 if (!CONS_MARKED_P (&cblk
->conses
[pos
]))
5751 cblk
->conses
[pos
].u
.chain
= cons_free_list
;
5752 cons_free_list
= &cblk
->conses
[pos
];
5754 cons_free_list
->car
= Vdead
;
5760 CONS_UNMARK (&cblk
->conses
[pos
]);
5766 lim
= CONS_BLOCK_SIZE
;
5767 /* If this block contains only free conses and we have already
5768 seen more than two blocks worth of free conses then deallocate
5770 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
5772 *cprev
= cblk
->next
;
5773 /* Unhook from the free list. */
5774 cons_free_list
= cblk
->conses
[0].u
.chain
;
5775 lisp_align_free (cblk
);
5780 num_free
+= this_free
;
5781 cprev
= &cblk
->next
;
5784 total_conses
= num_used
;
5785 total_free_conses
= num_free
;
5788 /* Put all unmarked floats on free list */
5790 register struct float_block
*fblk
;
5791 struct float_block
**fprev
= &float_block
;
5792 register int lim
= float_block_index
;
5793 register int num_free
= 0, num_used
= 0;
5795 float_free_list
= 0;
5797 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
5801 for (i
= 0; i
< lim
; i
++)
5802 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
5805 fblk
->floats
[i
].u
.chain
= float_free_list
;
5806 float_free_list
= &fblk
->floats
[i
];
5811 FLOAT_UNMARK (&fblk
->floats
[i
]);
5813 lim
= FLOAT_BLOCK_SIZE
;
5814 /* If this block contains only free floats and we have already
5815 seen more than two blocks worth of free floats then deallocate
5817 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
5819 *fprev
= fblk
->next
;
5820 /* Unhook from the free list. */
5821 float_free_list
= fblk
->floats
[0].u
.chain
;
5822 lisp_align_free (fblk
);
5827 num_free
+= this_free
;
5828 fprev
= &fblk
->next
;
5831 total_floats
= num_used
;
5832 total_free_floats
= num_free
;
5835 /* Put all unmarked intervals on free list */
5837 register struct interval_block
*iblk
;
5838 struct interval_block
**iprev
= &interval_block
;
5839 register int lim
= interval_block_index
;
5840 register int num_free
= 0, num_used
= 0;
5842 interval_free_list
= 0;
5844 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
5849 for (i
= 0; i
< lim
; i
++)
5851 if (!iblk
->intervals
[i
].gcmarkbit
)
5853 SET_INTERVAL_PARENT (&iblk
->intervals
[i
], interval_free_list
);
5854 interval_free_list
= &iblk
->intervals
[i
];
5860 iblk
->intervals
[i
].gcmarkbit
= 0;
5863 lim
= INTERVAL_BLOCK_SIZE
;
5864 /* If this block contains only free intervals and we have already
5865 seen more than two blocks worth of free intervals then
5866 deallocate this block. */
5867 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
5869 *iprev
= iblk
->next
;
5870 /* Unhook from the free list. */
5871 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
5873 n_interval_blocks
--;
5877 num_free
+= this_free
;
5878 iprev
= &iblk
->next
;
5881 total_intervals
= num_used
;
5882 total_free_intervals
= num_free
;
5885 /* Put all unmarked symbols on free list */
5887 register struct symbol_block
*sblk
;
5888 struct symbol_block
**sprev
= &symbol_block
;
5889 register int lim
= symbol_block_index
;
5890 register int num_free
= 0, num_used
= 0;
5892 symbol_free_list
= NULL
;
5894 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
5897 struct Lisp_Symbol
*sym
= sblk
->symbols
;
5898 struct Lisp_Symbol
*end
= sym
+ lim
;
5900 for (; sym
< end
; ++sym
)
5902 /* Check if the symbol was created during loadup. In such a case
5903 it might be pointed to by pure bytecode which we don't trace,
5904 so we conservatively assume that it is live. */
5905 int pure_p
= PURE_POINTER_P (XSTRING (sym
->xname
));
5907 if (!sym
->gcmarkbit
&& !pure_p
)
5909 if (sym
->redirect
== SYMBOL_LOCALIZED
)
5910 xfree (SYMBOL_BLV (sym
));
5911 sym
->next
= symbol_free_list
;
5912 symbol_free_list
= sym
;
5914 symbol_free_list
->function
= Vdead
;
5922 UNMARK_STRING (XSTRING (sym
->xname
));
5927 lim
= SYMBOL_BLOCK_SIZE
;
5928 /* If this block contains only free symbols and we have already
5929 seen more than two blocks worth of free symbols then deallocate
5931 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
5933 *sprev
= sblk
->next
;
5934 /* Unhook from the free list. */
5935 symbol_free_list
= sblk
->symbols
[0].next
;
5941 num_free
+= this_free
;
5942 sprev
= &sblk
->next
;
5945 total_symbols
= num_used
;
5946 total_free_symbols
= num_free
;
5949 /* Put all unmarked misc's on free list.
5950 For a marker, first unchain it from the buffer it points into. */
5952 register struct marker_block
*mblk
;
5953 struct marker_block
**mprev
= &marker_block
;
5954 register int lim
= marker_block_index
;
5955 register int num_free
= 0, num_used
= 0;
5957 marker_free_list
= 0;
5959 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
5964 for (i
= 0; i
< lim
; i
++)
5966 if (!mblk
->markers
[i
].u_any
.gcmarkbit
)
5968 if (mblk
->markers
[i
].u_any
.type
== Lisp_Misc_Marker
)
5969 unchain_marker (&mblk
->markers
[i
].u_marker
);
5970 /* Set the type of the freed object to Lisp_Misc_Free.
5971 We could leave the type alone, since nobody checks it,
5972 but this might catch bugs faster. */
5973 mblk
->markers
[i
].u_marker
.type
= Lisp_Misc_Free
;
5974 mblk
->markers
[i
].u_free
.chain
= marker_free_list
;
5975 marker_free_list
= &mblk
->markers
[i
];
5981 mblk
->markers
[i
].u_any
.gcmarkbit
= 0;
5984 lim
= MARKER_BLOCK_SIZE
;
5985 /* If this block contains only free markers and we have already
5986 seen more than two blocks worth of free markers then deallocate
5988 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
5990 *mprev
= mblk
->next
;
5991 /* Unhook from the free list. */
5992 marker_free_list
= mblk
->markers
[0].u_free
.chain
;
5998 num_free
+= this_free
;
5999 mprev
= &mblk
->next
;
6003 total_markers
= num_used
;
6004 total_free_markers
= num_free
;
6007 /* Free all unmarked buffers */
6009 register struct buffer
*buffer
= all_buffers
, *prev
= 0, *next
;
6012 if (!VECTOR_MARKED_P (buffer
))
6015 prev
->header
.next
= buffer
->header
.next
;
6017 all_buffers
= buffer
->header
.next
.buffer
;
6018 next
= buffer
->header
.next
.buffer
;
6024 VECTOR_UNMARK (buffer
);
6025 UNMARK_BALANCE_INTERVALS (BUF_INTERVALS (buffer
));
6026 prev
= buffer
, buffer
= buffer
->header
.next
.buffer
;
6030 /* Free all unmarked vectors */
6032 register struct Lisp_Vector
*vector
= all_vectors
, *prev
= 0, *next
;
6033 total_vector_size
= 0;
6036 if (!VECTOR_MARKED_P (vector
))
6039 prev
->header
.next
= vector
->header
.next
;
6041 all_vectors
= vector
->header
.next
.vector
;
6042 next
= vector
->header
.next
.vector
;
6050 VECTOR_UNMARK (vector
);
6051 if (vector
->header
.size
& PSEUDOVECTOR_FLAG
)
6052 total_vector_size
+= PSEUDOVECTOR_SIZE_MASK
& vector
->header
.size
;
6054 total_vector_size
+= vector
->header
.size
;
6055 prev
= vector
, vector
= vector
->header
.next
.vector
;
6059 #ifdef GC_CHECK_STRING_BYTES
6060 if (!noninteractive
)
6061 check_string_bytes (1);
6068 /* Debugging aids. */
6070 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
6071 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
6072 This may be helpful in debugging Emacs's memory usage.
6073 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
6078 XSETINT (end
, (intptr_t) (char *) sbrk (0) / 1024);
6083 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
6084 doc
: /* Return a list of counters that measure how much consing there has been.
6085 Each of these counters increments for a certain kind of object.
6086 The counters wrap around from the largest positive integer to zero.
6087 Garbage collection does not decrease them.
6088 The elements of the value are as follows:
6089 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
6090 All are in units of 1 = one object consed
6091 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
6093 MISCS include overlays, markers, and some internal types.
6094 Frames, windows, buffers, and subprocesses count as vectors
6095 (but the contents of a buffer's text do not count here). */)
6098 Lisp_Object consed
[8];
6100 consed
[0] = make_number (min (MOST_POSITIVE_FIXNUM
, cons_cells_consed
));
6101 consed
[1] = make_number (min (MOST_POSITIVE_FIXNUM
, floats_consed
));
6102 consed
[2] = make_number (min (MOST_POSITIVE_FIXNUM
, vector_cells_consed
));
6103 consed
[3] = make_number (min (MOST_POSITIVE_FIXNUM
, symbols_consed
));
6104 consed
[4] = make_number (min (MOST_POSITIVE_FIXNUM
, string_chars_consed
));
6105 consed
[5] = make_number (min (MOST_POSITIVE_FIXNUM
, misc_objects_consed
));
6106 consed
[6] = make_number (min (MOST_POSITIVE_FIXNUM
, intervals_consed
));
6107 consed
[7] = make_number (min (MOST_POSITIVE_FIXNUM
, strings_consed
));
6109 return Flist (8, consed
);
6112 #ifdef ENABLE_CHECKING
6113 int suppress_checking
;
6116 die (const char *msg
, const char *file
, int line
)
6118 fprintf (stderr
, "\r\n%s:%d: Emacs fatal error: %s\r\n",
6124 /* Initialization */
6127 init_alloc_once (void)
6129 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
6131 pure_size
= PURESIZE
;
6132 pure_bytes_used
= 0;
6133 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
6134 pure_bytes_used_before_overflow
= 0;
6136 /* Initialize the list of free aligned blocks. */
6139 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
6141 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
6145 ignore_warnings
= 1;
6146 #ifdef DOUG_LEA_MALLOC
6147 mallopt (M_TRIM_THRESHOLD
, 128*1024); /* trim threshold */
6148 mallopt (M_MMAP_THRESHOLD
, 64*1024); /* mmap threshold */
6149 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* max. number of mmap'ed areas */
6157 init_weak_hash_tables ();
6160 malloc_hysteresis
= 32;
6162 malloc_hysteresis
= 0;
6165 refill_memory_reserve ();
6167 ignore_warnings
= 0;
6169 byte_stack_list
= 0;
6171 consing_since_gc
= 0;
6172 gc_cons_threshold
= 100000 * sizeof (Lisp_Object
);
6173 gc_relative_threshold
= 0;
6180 byte_stack_list
= 0;
6182 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
6183 setjmp_tested_p
= longjmps_done
= 0;
6186 Vgc_elapsed
= make_float (0.0);
6191 syms_of_alloc (void)
6193 DEFVAR_INT ("gc-cons-threshold", gc_cons_threshold
,
6194 doc
: /* *Number of bytes of consing between garbage collections.
6195 Garbage collection can happen automatically once this many bytes have been
6196 allocated since the last garbage collection. All data types count.
6198 Garbage collection happens automatically only when `eval' is called.
6200 By binding this temporarily to a large number, you can effectively
6201 prevent garbage collection during a part of the program.
6202 See also `gc-cons-percentage'. */);
6204 DEFVAR_LISP ("gc-cons-percentage", Vgc_cons_percentage
,
6205 doc
: /* *Portion of the heap used for allocation.
6206 Garbage collection can happen automatically once this portion of the heap
6207 has been allocated since the last garbage collection.
6208 If this portion is smaller than `gc-cons-threshold', this is ignored. */);
6209 Vgc_cons_percentage
= make_float (0.1);
6211 DEFVAR_INT ("pure-bytes-used", pure_bytes_used
,
6212 doc
: /* Number of bytes of sharable Lisp data allocated so far. */);
6214 DEFVAR_INT ("cons-cells-consed", cons_cells_consed
,
6215 doc
: /* Number of cons cells that have been consed so far. */);
6217 DEFVAR_INT ("floats-consed", floats_consed
,
6218 doc
: /* Number of floats that have been consed so far. */);
6220 DEFVAR_INT ("vector-cells-consed", vector_cells_consed
,
6221 doc
: /* Number of vector cells that have been consed so far. */);
6223 DEFVAR_INT ("symbols-consed", symbols_consed
,
6224 doc
: /* Number of symbols that have been consed so far. */);
6226 DEFVAR_INT ("string-chars-consed", string_chars_consed
,
6227 doc
: /* Number of string characters that have been consed so far. */);
6229 DEFVAR_INT ("misc-objects-consed", misc_objects_consed
,
6230 doc
: /* Number of miscellaneous objects that have been consed so far. */);
6232 DEFVAR_INT ("intervals-consed", intervals_consed
,
6233 doc
: /* Number of intervals that have been consed so far. */);
6235 DEFVAR_INT ("strings-consed", strings_consed
,
6236 doc
: /* Number of strings that have been consed so far. */);
6238 DEFVAR_LISP ("purify-flag", Vpurify_flag
,
6239 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
6240 This means that certain objects should be allocated in shared (pure) space.
6241 It can also be set to a hash-table, in which case this table is used to
6242 do hash-consing of the objects allocated to pure space. */);
6244 DEFVAR_BOOL ("garbage-collection-messages", garbage_collection_messages
,
6245 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
6246 garbage_collection_messages
= 0;
6248 DEFVAR_LISP ("post-gc-hook", Vpost_gc_hook
,
6249 doc
: /* Hook run after garbage collection has finished. */);
6250 Vpost_gc_hook
= Qnil
;
6251 Qpost_gc_hook
= intern_c_string ("post-gc-hook");
6252 staticpro (&Qpost_gc_hook
);
6254 DEFVAR_LISP ("memory-signal-data", Vmemory_signal_data
,
6255 doc
: /* Precomputed `signal' argument for memory-full error. */);
6256 /* We build this in advance because if we wait until we need it, we might
6257 not be able to allocate the memory to hold it. */
6259 = pure_cons (Qerror
,
6260 pure_cons (make_pure_c_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"), Qnil
));
6262 DEFVAR_LISP ("memory-full", Vmemory_full
,
6263 doc
: /* Non-nil means Emacs cannot get much more Lisp memory. */);
6264 Vmemory_full
= Qnil
;
6266 staticpro (&Qgc_cons_threshold
);
6267 Qgc_cons_threshold
= intern_c_string ("gc-cons-threshold");
6269 staticpro (&Qchar_table_extra_slots
);
6270 Qchar_table_extra_slots
= intern_c_string ("char-table-extra-slots");
6272 DEFVAR_LISP ("gc-elapsed", Vgc_elapsed
,
6273 doc
: /* Accumulated time elapsed in garbage collections.
6274 The time is in seconds as a floating point value. */);
6275 DEFVAR_INT ("gcs-done", gcs_done
,
6276 doc
: /* Accumulated number of garbage collections done. */);
6281 defsubr (&Smake_byte_code
);
6282 defsubr (&Smake_list
);
6283 defsubr (&Smake_vector
);
6284 defsubr (&Smake_string
);
6285 defsubr (&Smake_bool_vector
);
6286 defsubr (&Smake_symbol
);
6287 defsubr (&Smake_marker
);
6288 defsubr (&Spurecopy
);
6289 defsubr (&Sgarbage_collect
);
6290 defsubr (&Smemory_limit
);
6291 defsubr (&Smemory_use_counts
);
6293 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
6294 defsubr (&Sgc_status
);