1 /* Storage allocation and gc for GNU Emacs Lisp interpreter.
2 Copyright (C) 1985,86,88,93,94,95,97,98,1999,2000,01,02,03,2004
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 2, or (at your option)
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; see the file COPYING. If not, write to
19 the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
24 #include <limits.h> /* For CHAR_BIT. */
30 /* Note that this declares bzero on OSF/1. How dumb. */
34 /* This file is part of the core Lisp implementation, and thus must
35 deal with the real data structures. If the Lisp implementation is
36 replaced, this file likely will not be used. */
38 #undef HIDE_LISP_IMPLEMENTATION
41 #include "intervals.h"
47 #include "blockinput.h"
48 #include "character.h"
49 #include "syssignal.h"
52 /* GC_MALLOC_CHECK defined means perform validity checks of malloc'd
53 memory. Can do this only if using gmalloc.c. */
55 #if defined SYSTEM_MALLOC || defined DOUG_LEA_MALLOC
56 #undef GC_MALLOC_CHECK
62 extern POINTER_TYPE
*sbrk ();
65 #ifdef DOUG_LEA_MALLOC
68 /* malloc.h #defines this as size_t, at least in glibc2. */
69 #ifndef __malloc_size_t
70 #define __malloc_size_t int
73 /* Specify maximum number of areas to mmap. It would be nice to use a
74 value that explicitly means "no limit". */
76 #define MMAP_MAX_AREAS 100000000
78 #else /* not DOUG_LEA_MALLOC */
80 /* The following come from gmalloc.c. */
82 #define __malloc_size_t size_t
83 extern __malloc_size_t _bytes_used
;
84 extern __malloc_size_t __malloc_extra_blocks
;
86 #endif /* not DOUG_LEA_MALLOC */
88 /* Value of _bytes_used, when spare_memory was freed. */
90 static __malloc_size_t bytes_used_when_full
;
92 /* Mark, unmark, query mark bit of a Lisp string. S must be a pointer
93 to a struct Lisp_String. */
95 #define MARK_STRING(S) ((S)->size |= ARRAY_MARK_FLAG)
96 #define UNMARK_STRING(S) ((S)->size &= ~ARRAY_MARK_FLAG)
97 #define STRING_MARKED_P(S) ((S)->size & ARRAY_MARK_FLAG)
99 #define VECTOR_MARK(V) ((V)->size |= ARRAY_MARK_FLAG)
100 #define VECTOR_UNMARK(V) ((V)->size &= ~ARRAY_MARK_FLAG)
101 #define VECTOR_MARKED_P(V) ((V)->size & ARRAY_MARK_FLAG)
103 /* Value is the number of bytes/chars of S, a pointer to a struct
104 Lisp_String. This must be used instead of STRING_BYTES (S) or
105 S->size during GC, because S->size contains the mark bit for
108 #define GC_STRING_BYTES(S) (STRING_BYTES (S))
109 #define GC_STRING_CHARS(S) ((S)->size & ~ARRAY_MARK_FLAG)
111 /* Number of bytes of consing done since the last gc. */
113 int consing_since_gc
;
115 /* Count the amount of consing of various sorts of space. */
117 EMACS_INT cons_cells_consed
;
118 EMACS_INT floats_consed
;
119 EMACS_INT vector_cells_consed
;
120 EMACS_INT symbols_consed
;
121 EMACS_INT string_chars_consed
;
122 EMACS_INT misc_objects_consed
;
123 EMACS_INT intervals_consed
;
124 EMACS_INT strings_consed
;
126 /* Number of bytes of consing since GC before another GC should be done. */
128 EMACS_INT gc_cons_threshold
;
130 /* Nonzero during GC. */
134 /* Nonzero means abort if try to GC.
135 This is for code which is written on the assumption that
136 no GC will happen, so as to verify that assumption. */
140 /* Nonzero means display messages at beginning and end of GC. */
142 int garbage_collection_messages
;
144 #ifndef VIRT_ADDR_VARIES
146 #endif /* VIRT_ADDR_VARIES */
147 int malloc_sbrk_used
;
149 #ifndef VIRT_ADDR_VARIES
151 #endif /* VIRT_ADDR_VARIES */
152 int malloc_sbrk_unused
;
154 /* Two limits controlling how much undo information to keep. */
156 EMACS_INT undo_limit
;
157 EMACS_INT undo_strong_limit
;
159 /* Number of live and free conses etc. */
161 static int total_conses
, total_markers
, total_symbols
, total_vector_size
;
162 static int total_free_conses
, total_free_markers
, total_free_symbols
;
163 static int total_free_floats
, total_floats
;
165 /* Points to memory space allocated as "spare", to be freed if we run
168 static char *spare_memory
;
170 /* Amount of spare memory to keep in reserve. */
172 #define SPARE_MEMORY (1 << 14)
174 /* Number of extra blocks malloc should get when it needs more core. */
176 static int malloc_hysteresis
;
178 /* Non-nil means defun should do purecopy on the function definition. */
180 Lisp_Object Vpurify_flag
;
182 /* Non-nil means we are handling a memory-full error. */
184 Lisp_Object Vmemory_full
;
188 /* Force it into data space! Initialize it to a nonzero value;
189 otherwise some compilers put it into BSS. */
191 EMACS_INT pure
[PURESIZE
/ sizeof (EMACS_INT
)] = {1,};
192 #define PUREBEG (char *) pure
196 #define pure PURE_SEG_BITS /* Use shared memory segment */
197 #define PUREBEG (char *)PURE_SEG_BITS
199 #endif /* HAVE_SHM */
201 /* Pointer to the pure area, and its size. */
203 static char *purebeg
;
204 static size_t pure_size
;
206 /* Number of bytes of pure storage used before pure storage overflowed.
207 If this is non-zero, this implies that an overflow occurred. */
209 static size_t pure_bytes_used_before_overflow
;
211 /* Value is non-zero if P points into pure space. */
213 #define PURE_POINTER_P(P) \
214 (((PNTR_COMPARISON_TYPE) (P) \
215 < (PNTR_COMPARISON_TYPE) ((char *) purebeg + pure_size)) \
216 && ((PNTR_COMPARISON_TYPE) (P) \
217 >= (PNTR_COMPARISON_TYPE) purebeg))
219 /* Index in pure at which next pure object will be allocated.. */
221 EMACS_INT pure_bytes_used
;
223 /* If nonzero, this is a warning delivered by malloc and not yet
226 char *pending_malloc_warning
;
228 /* Pre-computed signal argument for use when memory is exhausted. */
230 Lisp_Object Vmemory_signal_data
;
232 /* Maximum amount of C stack to save when a GC happens. */
234 #ifndef MAX_SAVE_STACK
235 #define MAX_SAVE_STACK 16000
238 /* Buffer in which we save a copy of the C stack at each GC. */
243 /* Non-zero means ignore malloc warnings. Set during initialization.
244 Currently not used. */
248 Lisp_Object Qgc_cons_threshold
, Qchar_table_extra_slots
;
250 /* Hook run after GC has finished. */
252 Lisp_Object Vpost_gc_hook
, Qpost_gc_hook
;
254 Lisp_Object Vgc_elapsed
; /* accumulated elapsed time in GC */
255 EMACS_INT gcs_done
; /* accumulated GCs */
257 static void mark_buffer
P_ ((Lisp_Object
));
258 extern void mark_kboards
P_ ((void));
259 static void gc_sweep
P_ ((void));
260 static void mark_glyph_matrix
P_ ((struct glyph_matrix
*));
261 static void mark_face_cache
P_ ((struct face_cache
*));
263 #ifdef HAVE_WINDOW_SYSTEM
264 static void mark_image
P_ ((struct image
*));
265 static void mark_image_cache
P_ ((struct frame
*));
266 #endif /* HAVE_WINDOW_SYSTEM */
268 static struct Lisp_String
*allocate_string
P_ ((void));
269 static void compact_small_strings
P_ ((void));
270 static void free_large_strings
P_ ((void));
271 static void sweep_strings
P_ ((void));
273 extern int message_enable_multibyte
;
275 /* When scanning the C stack for live Lisp objects, Emacs keeps track
276 of what memory allocated via lisp_malloc is intended for what
277 purpose. This enumeration specifies the type of memory. */
288 /* Keep the following vector-like types together, with
289 MEM_TYPE_WINDOW being the last, and MEM_TYPE_VECTOR the
290 first. Or change the code of live_vector_p, for instance. */
298 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
300 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
301 #include <stdio.h> /* For fprintf. */
304 /* A unique object in pure space used to make some Lisp objects
305 on free lists recognizable in O(1). */
309 #ifdef GC_MALLOC_CHECK
311 enum mem_type allocated_mem_type
;
312 int dont_register_blocks
;
314 #endif /* GC_MALLOC_CHECK */
316 /* A node in the red-black tree describing allocated memory containing
317 Lisp data. Each such block is recorded with its start and end
318 address when it is allocated, and removed from the tree when it
321 A red-black tree is a balanced binary tree with the following
324 1. Every node is either red or black.
325 2. Every leaf is black.
326 3. If a node is red, then both of its children are black.
327 4. Every simple path from a node to a descendant leaf contains
328 the same number of black nodes.
329 5. The root is always black.
331 When nodes are inserted into the tree, or deleted from the tree,
332 the tree is "fixed" so that these properties are always true.
334 A red-black tree with N internal nodes has height at most 2
335 log(N+1). Searches, insertions and deletions are done in O(log N).
336 Please see a text book about data structures for a detailed
337 description of red-black trees. Any book worth its salt should
342 /* Children of this node. These pointers are never NULL. When there
343 is no child, the value is MEM_NIL, which points to a dummy node. */
344 struct mem_node
*left
, *right
;
346 /* The parent of this node. In the root node, this is NULL. */
347 struct mem_node
*parent
;
349 /* Start and end of allocated region. */
353 enum {MEM_BLACK
, MEM_RED
} color
;
359 /* Base address of stack. Set in main. */
361 Lisp_Object
*stack_base
;
363 /* Root of the tree describing allocated Lisp memory. */
365 static struct mem_node
*mem_root
;
367 /* Lowest and highest known address in the heap. */
369 static void *min_heap_address
, *max_heap_address
;
371 /* Sentinel node of the tree. */
373 static struct mem_node mem_z
;
374 #define MEM_NIL &mem_z
376 static POINTER_TYPE
*lisp_malloc
P_ ((size_t, enum mem_type
));
377 static struct Lisp_Vector
*allocate_vectorlike
P_ ((EMACS_INT
, enum mem_type
));
378 static void lisp_free
P_ ((POINTER_TYPE
*));
379 static void mark_stack
P_ ((void));
380 static int live_vector_p
P_ ((struct mem_node
*, void *));
381 static int live_buffer_p
P_ ((struct mem_node
*, void *));
382 static int live_string_p
P_ ((struct mem_node
*, void *));
383 static int live_cons_p
P_ ((struct mem_node
*, void *));
384 static int live_symbol_p
P_ ((struct mem_node
*, void *));
385 static int live_float_p
P_ ((struct mem_node
*, void *));
386 static int live_misc_p
P_ ((struct mem_node
*, void *));
387 static void mark_maybe_object
P_ ((Lisp_Object
));
388 static void mark_memory
P_ ((void *, void *));
389 static void mem_init
P_ ((void));
390 static struct mem_node
*mem_insert
P_ ((void *, void *, enum mem_type
));
391 static void mem_insert_fixup
P_ ((struct mem_node
*));
392 static void mem_rotate_left
P_ ((struct mem_node
*));
393 static void mem_rotate_right
P_ ((struct mem_node
*));
394 static void mem_delete
P_ ((struct mem_node
*));
395 static void mem_delete_fixup
P_ ((struct mem_node
*));
396 static INLINE
struct mem_node
*mem_find
P_ ((void *));
398 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
399 static void check_gcpros
P_ ((void));
402 #endif /* GC_MARK_STACK || GC_MALLOC_CHECK */
404 /* Recording what needs to be marked for gc. */
406 struct gcpro
*gcprolist
;
408 /* Addresses of staticpro'd variables. Initialize it to a nonzero
409 value; otherwise some compilers put it into BSS. */
411 #define NSTATICS 1280
412 Lisp_Object
*staticvec
[NSTATICS
] = {&Vpurify_flag
};
414 /* Index of next unused slot in staticvec. */
418 static POINTER_TYPE
*pure_alloc
P_ ((size_t, int));
421 /* Value is SZ rounded up to the next multiple of ALIGNMENT.
422 ALIGNMENT must be a power of 2. */
424 #define ALIGN(ptr, ALIGNMENT) \
425 ((POINTER_TYPE *) ((((EMACS_UINT)(ptr)) + (ALIGNMENT) - 1) \
426 & ~((ALIGNMENT) - 1)))
430 /************************************************************************
432 ************************************************************************/
434 /* Function malloc calls this if it finds we are near exhausting storage. */
440 pending_malloc_warning
= str
;
444 /* Display an already-pending malloc warning. */
447 display_malloc_warning ()
449 call3 (intern ("display-warning"),
451 build_string (pending_malloc_warning
),
452 intern ("emergency"));
453 pending_malloc_warning
= 0;
457 #ifdef DOUG_LEA_MALLOC
458 # define BYTES_USED (mallinfo ().arena)
460 # define BYTES_USED _bytes_used
464 /* Called if malloc returns zero. */
471 #ifndef SYSTEM_MALLOC
472 bytes_used_when_full
= BYTES_USED
;
475 /* The first time we get here, free the spare memory. */
482 /* This used to call error, but if we've run out of memory, we could
483 get infinite recursion trying to build the string. */
485 Fsignal (Qnil
, Vmemory_signal_data
);
489 /* Called if we can't allocate relocatable space for a buffer. */
492 buffer_memory_full ()
494 /* If buffers use the relocating allocator, no need to free
495 spare_memory, because we may have plenty of malloc space left
496 that we could get, and if we don't, the malloc that fails will
497 itself cause spare_memory to be freed. If buffers don't use the
498 relocating allocator, treat this like any other failing
507 /* This used to call error, but if we've run out of memory, we could
508 get infinite recursion trying to build the string. */
510 Fsignal (Qnil
, Vmemory_signal_data
);
514 /* Like malloc but check for no memory and block interrupt input.. */
520 register POINTER_TYPE
*val
;
523 val
= (POINTER_TYPE
*) malloc (size
);
532 /* Like realloc but check for no memory and block interrupt input.. */
535 xrealloc (block
, size
)
539 register POINTER_TYPE
*val
;
542 /* We must call malloc explicitly when BLOCK is 0, since some
543 reallocs don't do this. */
545 val
= (POINTER_TYPE
*) malloc (size
);
547 val
= (POINTER_TYPE
*) realloc (block
, size
);
550 if (!val
&& size
) memory_full ();
555 /* Like free but block interrupt input. */
567 /* Like strdup, but uses xmalloc. */
573 size_t len
= strlen (s
) + 1;
574 char *p
= (char *) xmalloc (len
);
580 /* Like malloc but used for allocating Lisp data. NBYTES is the
581 number of bytes to allocate, TYPE describes the intended use of the
582 allcated memory block (for strings, for conses, ...). */
584 static void *lisp_malloc_loser
;
586 static POINTER_TYPE
*
587 lisp_malloc (nbytes
, type
)
595 #ifdef GC_MALLOC_CHECK
596 allocated_mem_type
= type
;
599 val
= (void *) malloc (nbytes
);
602 /* If the memory just allocated cannot be addressed thru a Lisp
603 object's pointer, and it needs to be,
604 that's equivalent to running out of memory. */
605 if (val
&& type
!= MEM_TYPE_NON_LISP
)
608 XSETCONS (tem
, (char *) val
+ nbytes
- 1);
609 if ((char *) XCONS (tem
) != (char *) val
+ nbytes
- 1)
611 lisp_malloc_loser
= val
;
618 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
619 if (val
&& type
!= MEM_TYPE_NON_LISP
)
620 mem_insert (val
, (char *) val
+ nbytes
, type
);
629 /* Free BLOCK. This must be called to free memory allocated with a
630 call to lisp_malloc. */
638 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
639 mem_delete (mem_find (block
));
644 /* Allocation of aligned blocks of memory to store Lisp data. */
645 /* The entry point is lisp_align_malloc which returns blocks of at most */
646 /* BLOCK_BYTES and guarantees they are aligned on a BLOCK_ALIGN boundary. */
649 /* BLOCK_ALIGN has to be a power of 2. */
650 #define BLOCK_ALIGN (1 << 10)
652 /* Padding to leave at the end of a malloc'd block. This is to give
653 malloc a chance to minimize the amount of memory wasted to alignment.
654 It should be tuned to the particular malloc library used.
655 On glibc-2.3.2, malloc never tries to align, so a padding of 0 is best.
656 posix_memalign on the other hand would ideally prefer a value of 4
657 because otherwise, there's 1020 bytes wasted between each ablocks.
658 But testing shows that those 1020 will most of the time be efficiently
659 used by malloc to place other objects, so a value of 0 is still preferable
660 unless you have a lot of cons&floats and virtually nothing else. */
661 #define BLOCK_PADDING 0
662 #define BLOCK_BYTES \
663 (BLOCK_ALIGN - sizeof (struct aligned_block *) - BLOCK_PADDING)
665 /* Internal data structures and constants. */
667 #define ABLOCKS_SIZE 16
669 /* An aligned block of memory. */
674 char payload
[BLOCK_BYTES
];
675 struct ablock
*next_free
;
677 /* `abase' is the aligned base of the ablocks. */
678 /* It is overloaded to hold the virtual `busy' field that counts
679 the number of used ablock in the parent ablocks.
680 The first ablock has the `busy' field, the others have the `abase'
681 field. To tell the difference, we assume that pointers will have
682 integer values larger than 2 * ABLOCKS_SIZE. The lowest bit of `busy'
683 is used to tell whether the real base of the parent ablocks is `abase'
684 (if not, the word before the first ablock holds a pointer to the
686 struct ablocks
*abase
;
687 /* The padding of all but the last ablock is unused. The padding of
688 the last ablock in an ablocks is not allocated. */
690 char padding
[BLOCK_PADDING
];
694 /* A bunch of consecutive aligned blocks. */
697 struct ablock blocks
[ABLOCKS_SIZE
];
700 /* Size of the block requested from malloc or memalign. */
701 #define ABLOCKS_BYTES (sizeof (struct ablocks) - BLOCK_PADDING)
703 #define ABLOCK_ABASE(block) \
704 (((unsigned long) (block)->abase) <= (1 + 2 * ABLOCKS_SIZE) \
705 ? (struct ablocks *)(block) \
708 /* Virtual `busy' field. */
709 #define ABLOCKS_BUSY(abase) ((abase)->blocks[0].abase)
711 /* Pointer to the (not necessarily aligned) malloc block. */
712 #ifdef HAVE_POSIX_MEMALIGN
713 #define ABLOCKS_BASE(abase) (abase)
715 #define ABLOCKS_BASE(abase) \
716 (1 & (long) ABLOCKS_BUSY (abase) ? abase : ((void**)abase)[-1])
719 /* The list of free ablock. */
720 static struct ablock
*free_ablock
;
722 /* Allocate an aligned block of nbytes.
723 Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be
724 smaller or equal to BLOCK_BYTES. */
725 static POINTER_TYPE
*
726 lisp_align_malloc (nbytes
, type
)
731 struct ablocks
*abase
;
733 eassert (nbytes
<= BLOCK_BYTES
);
737 #ifdef GC_MALLOC_CHECK
738 allocated_mem_type
= type
;
744 EMACS_INT aligned
; /* int gets warning casting to 64-bit pointer. */
746 #ifdef DOUG_LEA_MALLOC
747 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
748 because mapped region contents are not preserved in
750 mallopt (M_MMAP_MAX
, 0);
753 #ifdef HAVE_POSIX_MEMALIGN
755 int err
= posix_memalign (&base
, BLOCK_ALIGN
, ABLOCKS_BYTES
);
756 abase
= err
? (base
= NULL
) : base
;
759 base
= malloc (ABLOCKS_BYTES
);
760 abase
= ALIGN (base
, BLOCK_ALIGN
);
768 aligned
= (base
== abase
);
770 ((void**)abase
)[-1] = base
;
772 #ifdef DOUG_LEA_MALLOC
773 /* Back to a reasonable maximum of mmap'ed areas. */
774 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
778 /* If the memory just allocated cannot be addressed thru a Lisp
779 object's pointer, and it needs to be, that's equivalent to
780 running out of memory. */
781 if (type
!= MEM_TYPE_NON_LISP
)
784 char *end
= (char *) base
+ ABLOCKS_BYTES
- 1;
786 if ((char *) XCONS (tem
) != end
)
788 lisp_malloc_loser
= base
;
796 /* Initialize the blocks and put them on the free list.
797 Is `base' was not properly aligned, we can't use the last block. */
798 for (i
= 0; i
< (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1); i
++)
800 abase
->blocks
[i
].abase
= abase
;
801 abase
->blocks
[i
].x
.next_free
= free_ablock
;
802 free_ablock
= &abase
->blocks
[i
];
804 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (long) aligned
;
806 eassert (0 == ((EMACS_UINT
)abase
) % BLOCK_ALIGN
);
807 eassert (ABLOCK_ABASE (&abase
->blocks
[3]) == abase
); /* 3 is arbitrary */
808 eassert (ABLOCK_ABASE (&abase
->blocks
[0]) == abase
);
809 eassert (ABLOCKS_BASE (abase
) == base
);
810 eassert (aligned
== (long) ABLOCKS_BUSY (abase
));
813 abase
= ABLOCK_ABASE (free_ablock
);
814 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (2 + (long) ABLOCKS_BUSY (abase
));
816 free_ablock
= free_ablock
->x
.next_free
;
818 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
819 if (val
&& type
!= MEM_TYPE_NON_LISP
)
820 mem_insert (val
, (char *) val
+ nbytes
, type
);
827 eassert (0 == ((EMACS_UINT
)val
) % BLOCK_ALIGN
);
832 lisp_align_free (block
)
835 struct ablock
*ablock
= block
;
836 struct ablocks
*abase
= ABLOCK_ABASE (ablock
);
839 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
840 mem_delete (mem_find (block
));
842 /* Put on free list. */
843 ablock
->x
.next_free
= free_ablock
;
844 free_ablock
= ablock
;
845 /* Update busy count. */
846 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (-2 + (long) ABLOCKS_BUSY (abase
));
848 if (2 > (long) ABLOCKS_BUSY (abase
))
849 { /* All the blocks are free. */
850 int i
= 0, aligned
= (long) ABLOCKS_BUSY (abase
);
851 struct ablock
**tem
= &free_ablock
;
852 struct ablock
*atop
= &abase
->blocks
[aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1];
856 if (*tem
>= (struct ablock
*) abase
&& *tem
< atop
)
859 *tem
= (*tem
)->x
.next_free
;
862 tem
= &(*tem
)->x
.next_free
;
864 eassert ((aligned
& 1) == aligned
);
865 eassert (i
== (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1));
866 free (ABLOCKS_BASE (abase
));
871 /* Return a new buffer structure allocated from the heap with
872 a call to lisp_malloc. */
878 = (struct buffer
*) lisp_malloc (sizeof (struct buffer
),
884 /* Arranging to disable input signals while we're in malloc.
886 This only works with GNU malloc. To help out systems which can't
887 use GNU malloc, all the calls to malloc, realloc, and free
888 elsewhere in the code should be inside a BLOCK_INPUT/UNBLOCK_INPUT
889 pairs; unfortunately, we have no idea what C library functions
890 might call malloc, so we can't really protect them unless you're
891 using GNU malloc. Fortunately, most of the major operating systems
892 can use GNU malloc. */
894 #ifndef SYSTEM_MALLOC
895 #ifndef DOUG_LEA_MALLOC
896 extern void * (*__malloc_hook
) P_ ((size_t));
897 extern void * (*__realloc_hook
) P_ ((void *, size_t));
898 extern void (*__free_hook
) P_ ((void *));
899 /* Else declared in malloc.h, perhaps with an extra arg. */
900 #endif /* DOUG_LEA_MALLOC */
901 static void * (*old_malloc_hook
) ();
902 static void * (*old_realloc_hook
) ();
903 static void (*old_free_hook
) ();
905 /* This function is used as the hook for free to call. */
908 emacs_blocked_free (ptr
)
913 #ifdef GC_MALLOC_CHECK
919 if (m
== MEM_NIL
|| m
->start
!= ptr
)
922 "Freeing `%p' which wasn't allocated with malloc\n", ptr
);
927 /* fprintf (stderr, "free %p...%p (%p)\n", m->start, m->end, ptr); */
931 #endif /* GC_MALLOC_CHECK */
933 __free_hook
= old_free_hook
;
936 /* If we released our reserve (due to running out of memory),
937 and we have a fair amount free once again,
938 try to set aside another reserve in case we run out once more. */
939 if (spare_memory
== 0
940 /* Verify there is enough space that even with the malloc
941 hysteresis this call won't run out again.
942 The code here is correct as long as SPARE_MEMORY
943 is substantially larger than the block size malloc uses. */
944 && (bytes_used_when_full
945 > BYTES_USED
+ max (malloc_hysteresis
, 4) * SPARE_MEMORY
))
946 spare_memory
= (char *) malloc ((size_t) SPARE_MEMORY
);
948 __free_hook
= emacs_blocked_free
;
953 /* If we released our reserve (due to running out of memory),
954 and we have a fair amount free once again,
955 try to set aside another reserve in case we run out once more.
957 This is called when a relocatable block is freed in ralloc.c. */
960 refill_memory_reserve ()
962 if (spare_memory
== 0)
963 spare_memory
= (char *) malloc ((size_t) SPARE_MEMORY
);
967 /* This function is the malloc hook that Emacs uses. */
970 emacs_blocked_malloc (size
)
976 __malloc_hook
= old_malloc_hook
;
977 #ifdef DOUG_LEA_MALLOC
978 mallopt (M_TOP_PAD
, malloc_hysteresis
* 4096);
980 __malloc_extra_blocks
= malloc_hysteresis
;
983 value
= (void *) malloc (size
);
985 #ifdef GC_MALLOC_CHECK
987 struct mem_node
*m
= mem_find (value
);
990 fprintf (stderr
, "Malloc returned %p which is already in use\n",
992 fprintf (stderr
, "Region in use is %p...%p, %u bytes, type %d\n",
993 m
->start
, m
->end
, (char *) m
->end
- (char *) m
->start
,
998 if (!dont_register_blocks
)
1000 mem_insert (value
, (char *) value
+ max (1, size
), allocated_mem_type
);
1001 allocated_mem_type
= MEM_TYPE_NON_LISP
;
1004 #endif /* GC_MALLOC_CHECK */
1006 __malloc_hook
= emacs_blocked_malloc
;
1009 /* fprintf (stderr, "%p malloc\n", value); */
1014 /* This function is the realloc hook that Emacs uses. */
1017 emacs_blocked_realloc (ptr
, size
)
1024 __realloc_hook
= old_realloc_hook
;
1026 #ifdef GC_MALLOC_CHECK
1029 struct mem_node
*m
= mem_find (ptr
);
1030 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1033 "Realloc of %p which wasn't allocated with malloc\n",
1041 /* fprintf (stderr, "%p -> realloc\n", ptr); */
1043 /* Prevent malloc from registering blocks. */
1044 dont_register_blocks
= 1;
1045 #endif /* GC_MALLOC_CHECK */
1047 value
= (void *) realloc (ptr
, size
);
1049 #ifdef GC_MALLOC_CHECK
1050 dont_register_blocks
= 0;
1053 struct mem_node
*m
= mem_find (value
);
1056 fprintf (stderr
, "Realloc returns memory that is already in use\n");
1060 /* Can't handle zero size regions in the red-black tree. */
1061 mem_insert (value
, (char *) value
+ max (size
, 1), MEM_TYPE_NON_LISP
);
1064 /* fprintf (stderr, "%p <- realloc\n", value); */
1065 #endif /* GC_MALLOC_CHECK */
1067 __realloc_hook
= emacs_blocked_realloc
;
1074 /* Called from main to set up malloc to use our hooks. */
1077 uninterrupt_malloc ()
1079 if (__free_hook
!= emacs_blocked_free
)
1080 old_free_hook
= __free_hook
;
1081 __free_hook
= emacs_blocked_free
;
1083 if (__malloc_hook
!= emacs_blocked_malloc
)
1084 old_malloc_hook
= __malloc_hook
;
1085 __malloc_hook
= emacs_blocked_malloc
;
1087 if (__realloc_hook
!= emacs_blocked_realloc
)
1088 old_realloc_hook
= __realloc_hook
;
1089 __realloc_hook
= emacs_blocked_realloc
;
1092 #endif /* not SYSTEM_MALLOC */
1096 /***********************************************************************
1098 ***********************************************************************/
1100 /* Number of intervals allocated in an interval_block structure.
1101 The 1020 is 1024 minus malloc overhead. */
1103 #define INTERVAL_BLOCK_SIZE \
1104 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
1106 /* Intervals are allocated in chunks in form of an interval_block
1109 struct interval_block
1111 /* Place `intervals' first, to preserve alignment. */
1112 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
1113 struct interval_block
*next
;
1116 /* Current interval block. Its `next' pointer points to older
1119 struct interval_block
*interval_block
;
1121 /* Index in interval_block above of the next unused interval
1124 static int interval_block_index
;
1126 /* Number of free and live intervals. */
1128 static int total_free_intervals
, total_intervals
;
1130 /* List of free intervals. */
1132 INTERVAL interval_free_list
;
1134 /* Total number of interval blocks now in use. */
1136 int n_interval_blocks
;
1139 /* Initialize interval allocation. */
1144 interval_block
= NULL
;
1145 interval_block_index
= INTERVAL_BLOCK_SIZE
;
1146 interval_free_list
= 0;
1147 n_interval_blocks
= 0;
1151 /* Return a new interval. */
1158 if (interval_free_list
)
1160 val
= interval_free_list
;
1161 interval_free_list
= INTERVAL_PARENT (interval_free_list
);
1165 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
1167 register struct interval_block
*newi
;
1169 newi
= (struct interval_block
*) lisp_malloc (sizeof *newi
,
1172 newi
->next
= interval_block
;
1173 interval_block
= newi
;
1174 interval_block_index
= 0;
1175 n_interval_blocks
++;
1177 val
= &interval_block
->intervals
[interval_block_index
++];
1179 consing_since_gc
+= sizeof (struct interval
);
1181 RESET_INTERVAL (val
);
1187 /* Mark Lisp objects in interval I. */
1190 mark_interval (i
, dummy
)
1191 register INTERVAL i
;
1194 eassert (!i
->gcmarkbit
); /* Intervals are never shared. */
1196 mark_object (i
->plist
);
1200 /* Mark the interval tree rooted in TREE. Don't call this directly;
1201 use the macro MARK_INTERVAL_TREE instead. */
1204 mark_interval_tree (tree
)
1205 register INTERVAL tree
;
1207 /* No need to test if this tree has been marked already; this
1208 function is always called through the MARK_INTERVAL_TREE macro,
1209 which takes care of that. */
1211 traverse_intervals_noorder (tree
, mark_interval
, Qnil
);
1215 /* Mark the interval tree rooted in I. */
1217 #define MARK_INTERVAL_TREE(i) \
1219 if (!NULL_INTERVAL_P (i) && !i->gcmarkbit) \
1220 mark_interval_tree (i); \
1224 #define UNMARK_BALANCE_INTERVALS(i) \
1226 if (! NULL_INTERVAL_P (i)) \
1227 (i) = balance_intervals (i); \
1231 /* Number support. If NO_UNION_TYPE isn't in effect, we
1232 can't create number objects in macros. */
1240 obj
.s
.type
= Lisp_Int
;
1245 /***********************************************************************
1247 ***********************************************************************/
1249 /* Lisp_Strings are allocated in string_block structures. When a new
1250 string_block is allocated, all the Lisp_Strings it contains are
1251 added to a free-list string_free_list. When a new Lisp_String is
1252 needed, it is taken from that list. During the sweep phase of GC,
1253 string_blocks that are entirely free are freed, except two which
1256 String data is allocated from sblock structures. Strings larger
1257 than LARGE_STRING_BYTES, get their own sblock, data for smaller
1258 strings is sub-allocated out of sblocks of size SBLOCK_SIZE.
1260 Sblocks consist internally of sdata structures, one for each
1261 Lisp_String. The sdata structure points to the Lisp_String it
1262 belongs to. The Lisp_String points back to the `u.data' member of
1263 its sdata structure.
1265 When a Lisp_String is freed during GC, it is put back on
1266 string_free_list, and its `data' member and its sdata's `string'
1267 pointer is set to null. The size of the string is recorded in the
1268 `u.nbytes' member of the sdata. So, sdata structures that are no
1269 longer used, can be easily recognized, and it's easy to compact the
1270 sblocks of small strings which we do in compact_small_strings. */
1272 /* Size in bytes of an sblock structure used for small strings. This
1273 is 8192 minus malloc overhead. */
1275 #define SBLOCK_SIZE 8188
1277 /* Strings larger than this are considered large strings. String data
1278 for large strings is allocated from individual sblocks. */
1280 #define LARGE_STRING_BYTES 1024
1282 /* Structure describing string memory sub-allocated from an sblock.
1283 This is where the contents of Lisp strings are stored. */
1287 /* Back-pointer to the string this sdata belongs to. If null, this
1288 structure is free, and the NBYTES member of the union below
1289 contains the string's byte size (the same value that STRING_BYTES
1290 would return if STRING were non-null). If non-null, STRING_BYTES
1291 (STRING) is the size of the data, and DATA contains the string's
1293 struct Lisp_String
*string
;
1295 #ifdef GC_CHECK_STRING_BYTES
1298 unsigned char data
[1];
1300 #define SDATA_NBYTES(S) (S)->nbytes
1301 #define SDATA_DATA(S) (S)->data
1303 #else /* not GC_CHECK_STRING_BYTES */
1307 /* When STRING in non-null. */
1308 unsigned char data
[1];
1310 /* When STRING is null. */
1315 #define SDATA_NBYTES(S) (S)->u.nbytes
1316 #define SDATA_DATA(S) (S)->u.data
1318 #endif /* not GC_CHECK_STRING_BYTES */
1322 /* Structure describing a block of memory which is sub-allocated to
1323 obtain string data memory for strings. Blocks for small strings
1324 are of fixed size SBLOCK_SIZE. Blocks for large strings are made
1325 as large as needed. */
1330 struct sblock
*next
;
1332 /* Pointer to the next free sdata block. This points past the end
1333 of the sblock if there isn't any space left in this block. */
1334 struct sdata
*next_free
;
1336 /* Start of data. */
1337 struct sdata first_data
;
1340 /* Number of Lisp strings in a string_block structure. The 1020 is
1341 1024 minus malloc overhead. */
1343 #define STRING_BLOCK_SIZE \
1344 ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String))
1346 /* Structure describing a block from which Lisp_String structures
1351 /* Place `strings' first, to preserve alignment. */
1352 struct Lisp_String strings
[STRING_BLOCK_SIZE
];
1353 struct string_block
*next
;
1356 /* Head and tail of the list of sblock structures holding Lisp string
1357 data. We always allocate from current_sblock. The NEXT pointers
1358 in the sblock structures go from oldest_sblock to current_sblock. */
1360 static struct sblock
*oldest_sblock
, *current_sblock
;
1362 /* List of sblocks for large strings. */
1364 static struct sblock
*large_sblocks
;
1366 /* List of string_block structures, and how many there are. */
1368 static struct string_block
*string_blocks
;
1369 static int n_string_blocks
;
1371 /* Free-list of Lisp_Strings. */
1373 static struct Lisp_String
*string_free_list
;
1375 /* Number of live and free Lisp_Strings. */
1377 static int total_strings
, total_free_strings
;
1379 /* Number of bytes used by live strings. */
1381 static int total_string_size
;
1383 /* Given a pointer to a Lisp_String S which is on the free-list
1384 string_free_list, return a pointer to its successor in the
1387 #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S))
1389 /* Return a pointer to the sdata structure belonging to Lisp string S.
1390 S must be live, i.e. S->data must not be null. S->data is actually
1391 a pointer to the `u.data' member of its sdata structure; the
1392 structure starts at a constant offset in front of that. */
1394 #ifdef GC_CHECK_STRING_BYTES
1396 #define SDATA_OF_STRING(S) \
1397 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *) \
1398 - sizeof (EMACS_INT)))
1400 #else /* not GC_CHECK_STRING_BYTES */
1402 #define SDATA_OF_STRING(S) \
1403 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *)))
1405 #endif /* not GC_CHECK_STRING_BYTES */
1407 /* Value is the size of an sdata structure large enough to hold NBYTES
1408 bytes of string data. The value returned includes a terminating
1409 NUL byte, the size of the sdata structure, and padding. */
1411 #ifdef GC_CHECK_STRING_BYTES
1413 #define SDATA_SIZE(NBYTES) \
1414 ((sizeof (struct Lisp_String *) \
1416 + sizeof (EMACS_INT) \
1417 + sizeof (EMACS_INT) - 1) \
1418 & ~(sizeof (EMACS_INT) - 1))
1420 #else /* not GC_CHECK_STRING_BYTES */
1422 #define SDATA_SIZE(NBYTES) \
1423 ((sizeof (struct Lisp_String *) \
1425 + sizeof (EMACS_INT) - 1) \
1426 & ~(sizeof (EMACS_INT) - 1))
1428 #endif /* not GC_CHECK_STRING_BYTES */
1430 /* Initialize string allocation. Called from init_alloc_once. */
1435 total_strings
= total_free_strings
= total_string_size
= 0;
1436 oldest_sblock
= current_sblock
= large_sblocks
= NULL
;
1437 string_blocks
= NULL
;
1438 n_string_blocks
= 0;
1439 string_free_list
= NULL
;
1443 #ifdef GC_CHECK_STRING_BYTES
1445 static int check_string_bytes_count
;
1447 void check_string_bytes
P_ ((int));
1448 void check_sblock
P_ ((struct sblock
*));
1450 #define CHECK_STRING_BYTES(S) STRING_BYTES (S)
1453 /* Like GC_STRING_BYTES, but with debugging check. */
1457 struct Lisp_String
*s
;
1459 int nbytes
= (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1460 if (!PURE_POINTER_P (s
)
1462 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1467 /* Check validity of Lisp strings' string_bytes member in B. */
1473 struct sdata
*from
, *end
, *from_end
;
1477 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1479 /* Compute the next FROM here because copying below may
1480 overwrite data we need to compute it. */
1483 /* Check that the string size recorded in the string is the
1484 same as the one recorded in the sdata structure. */
1486 CHECK_STRING_BYTES (from
->string
);
1489 nbytes
= GC_STRING_BYTES (from
->string
);
1491 nbytes
= SDATA_NBYTES (from
);
1493 nbytes
= SDATA_SIZE (nbytes
);
1494 from_end
= (struct sdata
*) ((char *) from
+ nbytes
);
1499 /* Check validity of Lisp strings' string_bytes member. ALL_P
1500 non-zero means check all strings, otherwise check only most
1501 recently allocated strings. Used for hunting a bug. */
1504 check_string_bytes (all_p
)
1511 for (b
= large_sblocks
; b
; b
= b
->next
)
1513 struct Lisp_String
*s
= b
->first_data
.string
;
1515 CHECK_STRING_BYTES (s
);
1518 for (b
= oldest_sblock
; b
; b
= b
->next
)
1522 check_sblock (current_sblock
);
1525 #endif /* GC_CHECK_STRING_BYTES */
1528 /* Return a new Lisp_String. */
1530 static struct Lisp_String
*
1533 struct Lisp_String
*s
;
1535 /* If the free-list is empty, allocate a new string_block, and
1536 add all the Lisp_Strings in it to the free-list. */
1537 if (string_free_list
== NULL
)
1539 struct string_block
*b
;
1542 b
= (struct string_block
*) lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1543 bzero (b
, sizeof *b
);
1544 b
->next
= string_blocks
;
1548 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1551 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1552 string_free_list
= s
;
1555 total_free_strings
+= STRING_BLOCK_SIZE
;
1558 /* Pop a Lisp_String off the free-list. */
1559 s
= string_free_list
;
1560 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1562 /* Probably not strictly necessary, but play it safe. */
1563 bzero (s
, sizeof *s
);
1565 --total_free_strings
;
1568 consing_since_gc
+= sizeof *s
;
1570 #ifdef GC_CHECK_STRING_BYTES
1577 if (++check_string_bytes_count
== 200)
1579 check_string_bytes_count
= 0;
1580 check_string_bytes (1);
1583 check_string_bytes (0);
1585 #endif /* GC_CHECK_STRING_BYTES */
1591 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1592 plus a NUL byte at the end. Allocate an sdata structure for S, and
1593 set S->data to its `u.data' member. Store a NUL byte at the end of
1594 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1595 S->data if it was initially non-null. */
1598 allocate_string_data (s
, nchars
, nbytes
)
1599 struct Lisp_String
*s
;
1602 struct sdata
*data
, *old_data
;
1604 int needed
, old_nbytes
;
1606 /* Determine the number of bytes needed to store NBYTES bytes
1608 needed
= SDATA_SIZE (nbytes
);
1610 if (nbytes
> LARGE_STRING_BYTES
)
1612 size_t size
= sizeof *b
- sizeof (struct sdata
) + needed
;
1614 #ifdef DOUG_LEA_MALLOC
1615 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1616 because mapped region contents are not preserved in
1619 In case you think of allowing it in a dumped Emacs at the
1620 cost of not being able to re-dump, there's another reason:
1621 mmap'ed data typically have an address towards the top of the
1622 address space, which won't fit into an EMACS_INT (at least on
1623 32-bit systems with the current tagging scheme). --fx */
1624 mallopt (M_MMAP_MAX
, 0);
1627 b
= (struct sblock
*) lisp_malloc (size
, MEM_TYPE_NON_LISP
);
1629 #ifdef DOUG_LEA_MALLOC
1630 /* Back to a reasonable maximum of mmap'ed areas. */
1631 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1634 b
->next_free
= &b
->first_data
;
1635 b
->first_data
.string
= NULL
;
1636 b
->next
= large_sblocks
;
1639 else if (current_sblock
== NULL
1640 || (((char *) current_sblock
+ SBLOCK_SIZE
1641 - (char *) current_sblock
->next_free
)
1644 /* Not enough room in the current sblock. */
1645 b
= (struct sblock
*) lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
1646 b
->next_free
= &b
->first_data
;
1647 b
->first_data
.string
= NULL
;
1651 current_sblock
->next
= b
;
1659 old_data
= s
->data
? SDATA_OF_STRING (s
) : NULL
;
1660 old_nbytes
= GC_STRING_BYTES (s
);
1662 data
= b
->next_free
;
1664 s
->data
= SDATA_DATA (data
);
1665 #ifdef GC_CHECK_STRING_BYTES
1666 SDATA_NBYTES (data
) = nbytes
;
1669 s
->size_byte
= nbytes
;
1670 s
->data
[nbytes
] = '\0';
1671 b
->next_free
= (struct sdata
*) ((char *) data
+ needed
);
1673 /* If S had already data assigned, mark that as free by setting its
1674 string back-pointer to null, and recording the size of the data
1678 SDATA_NBYTES (old_data
) = old_nbytes
;
1679 old_data
->string
= NULL
;
1682 consing_since_gc
+= needed
;
1686 /* Sweep and compact strings. */
1691 struct string_block
*b
, *next
;
1692 struct string_block
*live_blocks
= NULL
;
1694 string_free_list
= NULL
;
1695 total_strings
= total_free_strings
= 0;
1696 total_string_size
= 0;
1698 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
1699 for (b
= string_blocks
; b
; b
= next
)
1702 struct Lisp_String
*free_list_before
= string_free_list
;
1706 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
1708 struct Lisp_String
*s
= b
->strings
+ i
;
1712 /* String was not on free-list before. */
1713 if (STRING_MARKED_P (s
))
1715 /* String is live; unmark it and its intervals. */
1718 if (!NULL_INTERVAL_P (s
->intervals
))
1719 UNMARK_BALANCE_INTERVALS (s
->intervals
);
1722 total_string_size
+= STRING_BYTES (s
);
1726 /* String is dead. Put it on the free-list. */
1727 struct sdata
*data
= SDATA_OF_STRING (s
);
1729 /* Save the size of S in its sdata so that we know
1730 how large that is. Reset the sdata's string
1731 back-pointer so that we know it's free. */
1732 #ifdef GC_CHECK_STRING_BYTES
1733 if (GC_STRING_BYTES (s
) != SDATA_NBYTES (data
))
1736 data
->u
.nbytes
= GC_STRING_BYTES (s
);
1738 data
->string
= NULL
;
1740 /* Reset the strings's `data' member so that we
1744 /* Put the string on the free-list. */
1745 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1746 string_free_list
= s
;
1752 /* S was on the free-list before. Put it there again. */
1753 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1754 string_free_list
= s
;
1759 /* Free blocks that contain free Lisp_Strings only, except
1760 the first two of them. */
1761 if (nfree
== STRING_BLOCK_SIZE
1762 && total_free_strings
> STRING_BLOCK_SIZE
)
1766 string_free_list
= free_list_before
;
1770 total_free_strings
+= nfree
;
1771 b
->next
= live_blocks
;
1776 string_blocks
= live_blocks
;
1777 free_large_strings ();
1778 compact_small_strings ();
1782 /* Free dead large strings. */
1785 free_large_strings ()
1787 struct sblock
*b
, *next
;
1788 struct sblock
*live_blocks
= NULL
;
1790 for (b
= large_sblocks
; b
; b
= next
)
1794 if (b
->first_data
.string
== NULL
)
1798 b
->next
= live_blocks
;
1803 large_sblocks
= live_blocks
;
1807 /* Compact data of small strings. Free sblocks that don't contain
1808 data of live strings after compaction. */
1811 compact_small_strings ()
1813 struct sblock
*b
, *tb
, *next
;
1814 struct sdata
*from
, *to
, *end
, *tb_end
;
1815 struct sdata
*to_end
, *from_end
;
1817 /* TB is the sblock we copy to, TO is the sdata within TB we copy
1818 to, and TB_END is the end of TB. */
1820 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
1821 to
= &tb
->first_data
;
1823 /* Step through the blocks from the oldest to the youngest. We
1824 expect that old blocks will stabilize over time, so that less
1825 copying will happen this way. */
1826 for (b
= oldest_sblock
; b
; b
= b
->next
)
1829 xassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
1831 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1833 /* Compute the next FROM here because copying below may
1834 overwrite data we need to compute it. */
1837 #ifdef GC_CHECK_STRING_BYTES
1838 /* Check that the string size recorded in the string is the
1839 same as the one recorded in the sdata structure. */
1841 && GC_STRING_BYTES (from
->string
) != SDATA_NBYTES (from
))
1843 #endif /* GC_CHECK_STRING_BYTES */
1846 nbytes
= GC_STRING_BYTES (from
->string
);
1848 nbytes
= SDATA_NBYTES (from
);
1850 nbytes
= SDATA_SIZE (nbytes
);
1851 from_end
= (struct sdata
*) ((char *) from
+ nbytes
);
1853 /* FROM->string non-null means it's alive. Copy its data. */
1856 /* If TB is full, proceed with the next sblock. */
1857 to_end
= (struct sdata
*) ((char *) to
+ nbytes
);
1858 if (to_end
> tb_end
)
1862 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
1863 to
= &tb
->first_data
;
1864 to_end
= (struct sdata
*) ((char *) to
+ nbytes
);
1867 /* Copy, and update the string's `data' pointer. */
1870 xassert (tb
!= b
|| to
<= from
);
1871 safe_bcopy ((char *) from
, (char *) to
, nbytes
);
1872 to
->string
->data
= SDATA_DATA (to
);
1875 /* Advance past the sdata we copied to. */
1881 /* The rest of the sblocks following TB don't contain live data, so
1882 we can free them. */
1883 for (b
= tb
->next
; b
; b
= next
)
1891 current_sblock
= tb
;
1895 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
1896 doc
: /* Return a newly created string of length LENGTH, with each element being INIT.
1897 Both LENGTH and INIT must be numbers. */)
1899 Lisp_Object length
, init
;
1901 register Lisp_Object val
;
1902 register unsigned char *p
, *end
;
1905 CHECK_NATNUM (length
);
1906 CHECK_NUMBER (init
);
1909 if (ASCII_CHAR_P (c
))
1911 nbytes
= XINT (length
);
1912 val
= make_uninit_string (nbytes
);
1914 end
= p
+ SCHARS (val
);
1920 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
1921 int len
= CHAR_STRING (c
, str
);
1923 nbytes
= len
* XINT (length
);
1924 val
= make_uninit_multibyte_string (XINT (length
), nbytes
);
1929 bcopy (str
, p
, len
);
1939 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
1940 doc
: /* Return a new bool-vector of length LENGTH, using INIT for as each element.
1941 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
1943 Lisp_Object length
, init
;
1945 register Lisp_Object val
;
1946 struct Lisp_Bool_Vector
*p
;
1948 int length_in_chars
, length_in_elts
, bits_per_value
;
1950 CHECK_NATNUM (length
);
1952 bits_per_value
= sizeof (EMACS_INT
) * BITS_PER_CHAR
;
1954 length_in_elts
= (XFASTINT (length
) + bits_per_value
- 1) / bits_per_value
;
1955 length_in_chars
= ((XFASTINT (length
) + BITS_PER_CHAR
- 1) / BITS_PER_CHAR
);
1957 /* We must allocate one more elements than LENGTH_IN_ELTS for the
1958 slot `size' of the struct Lisp_Bool_Vector. */
1959 val
= Fmake_vector (make_number (length_in_elts
+ 1), Qnil
);
1960 p
= XBOOL_VECTOR (val
);
1962 /* Get rid of any bits that would cause confusion. */
1964 XSETBOOL_VECTOR (val
, p
);
1965 p
->size
= XFASTINT (length
);
1967 real_init
= (NILP (init
) ? 0 : -1);
1968 for (i
= 0; i
< length_in_chars
; i
++)
1969 p
->data
[i
] = real_init
;
1971 /* Clear the extraneous bits in the last byte. */
1972 if (XINT (length
) != length_in_chars
* BITS_PER_CHAR
)
1973 XBOOL_VECTOR (val
)->data
[length_in_chars
- 1]
1974 &= (1 << (XINT (length
) % BITS_PER_CHAR
)) - 1;
1980 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
1981 of characters from the contents. This string may be unibyte or
1982 multibyte, depending on the contents. */
1985 make_string (contents
, nbytes
)
1986 const char *contents
;
1989 register Lisp_Object val
;
1990 int nchars
, multibyte_nbytes
;
1992 parse_str_as_multibyte (contents
, nbytes
, &nchars
, &multibyte_nbytes
);
1993 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
1994 /* CONTENTS contains no multibyte sequences or contains an invalid
1995 multibyte sequence. We must make unibyte string. */
1996 val
= make_unibyte_string (contents
, nbytes
);
1998 val
= make_multibyte_string (contents
, nchars
, nbytes
);
2003 /* Make an unibyte string from LENGTH bytes at CONTENTS. */
2006 make_unibyte_string (contents
, length
)
2007 const char *contents
;
2010 register Lisp_Object val
;
2011 val
= make_uninit_string (length
);
2012 bcopy (contents
, SDATA (val
), length
);
2013 STRING_SET_UNIBYTE (val
);
2018 /* Make a multibyte string from NCHARS characters occupying NBYTES
2019 bytes at CONTENTS. */
2022 make_multibyte_string (contents
, nchars
, nbytes
)
2023 const char *contents
;
2026 register Lisp_Object val
;
2027 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2028 bcopy (contents
, SDATA (val
), nbytes
);
2033 /* Make a string from NCHARS characters occupying NBYTES bytes at
2034 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2037 make_string_from_bytes (contents
, nchars
, nbytes
)
2038 const char *contents
;
2041 register Lisp_Object val
;
2042 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2043 bcopy (contents
, SDATA (val
), nbytes
);
2044 if (SBYTES (val
) == SCHARS (val
))
2045 STRING_SET_UNIBYTE (val
);
2050 /* Make a string from NCHARS characters occupying NBYTES bytes at
2051 CONTENTS. The argument MULTIBYTE controls whether to label the
2052 string as multibyte. If NCHARS is negative, it counts the number of
2053 characters by itself. */
2056 make_specified_string (contents
, nchars
, nbytes
, multibyte
)
2057 const char *contents
;
2061 register Lisp_Object val
;
2066 nchars
= multibyte_chars_in_text (contents
, nbytes
);
2070 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2071 bcopy (contents
, SDATA (val
), nbytes
);
2073 STRING_SET_UNIBYTE (val
);
2078 /* Make a string from the data at STR, treating it as multibyte if the
2085 return make_string (str
, strlen (str
));
2089 /* Return an unibyte Lisp_String set up to hold LENGTH characters
2090 occupying LENGTH bytes. */
2093 make_uninit_string (length
)
2097 val
= make_uninit_multibyte_string (length
, length
);
2098 STRING_SET_UNIBYTE (val
);
2103 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2104 which occupy NBYTES bytes. */
2107 make_uninit_multibyte_string (nchars
, nbytes
)
2111 struct Lisp_String
*s
;
2116 s
= allocate_string ();
2117 allocate_string_data (s
, nchars
, nbytes
);
2118 XSETSTRING (string
, s
);
2119 string_chars_consed
+= nbytes
;
2125 /***********************************************************************
2127 ***********************************************************************/
2129 /* We store float cells inside of float_blocks, allocating a new
2130 float_block with malloc whenever necessary. Float cells reclaimed
2131 by GC are put on a free list to be reallocated before allocating
2132 any new float cells from the latest float_block. */
2134 #define FLOAT_BLOCK_SIZE \
2135 (((BLOCK_BYTES - sizeof (struct float_block *) \
2136 /* The compiler might add padding at the end. */ \
2137 - (sizeof (struct Lisp_Float) - sizeof (int))) * CHAR_BIT) \
2138 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2140 #define GETMARKBIT(block,n) \
2141 (((block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2142 >> ((n) % (sizeof(int) * CHAR_BIT))) \
2145 #define SETMARKBIT(block,n) \
2146 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2147 |= 1 << ((n) % (sizeof(int) * CHAR_BIT))
2149 #define UNSETMARKBIT(block,n) \
2150 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2151 &= ~(1 << ((n) % (sizeof(int) * CHAR_BIT)))
2153 #define FLOAT_BLOCK(fptr) \
2154 ((struct float_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2156 #define FLOAT_INDEX(fptr) \
2157 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2161 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2162 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2163 int gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2164 struct float_block
*next
;
2167 #define FLOAT_MARKED_P(fptr) \
2168 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2170 #define FLOAT_MARK(fptr) \
2171 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2173 #define FLOAT_UNMARK(fptr) \
2174 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2176 /* Current float_block. */
2178 struct float_block
*float_block
;
2180 /* Index of first unused Lisp_Float in the current float_block. */
2182 int float_block_index
;
2184 /* Total number of float blocks now in use. */
2188 /* Free-list of Lisp_Floats. */
2190 struct Lisp_Float
*float_free_list
;
2193 /* Initialize float allocation. */
2199 float_block_index
= FLOAT_BLOCK_SIZE
; /* Force alloc of new float_block. */
2200 float_free_list
= 0;
2205 /* Explicitly free a float cell by putting it on the free-list. */
2209 struct Lisp_Float
*ptr
;
2211 *(struct Lisp_Float
**)&ptr
->data
= float_free_list
;
2212 float_free_list
= ptr
;
2216 /* Return a new float object with value FLOAT_VALUE. */
2219 make_float (float_value
)
2222 register Lisp_Object val
;
2224 if (float_free_list
)
2226 /* We use the data field for chaining the free list
2227 so that we won't use the same field that has the mark bit. */
2228 XSETFLOAT (val
, float_free_list
);
2229 float_free_list
= *(struct Lisp_Float
**)&float_free_list
->data
;
2233 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2235 register struct float_block
*new;
2237 new = (struct float_block
*) lisp_align_malloc (sizeof *new,
2239 new->next
= float_block
;
2240 bzero ((char *) new->gcmarkbits
, sizeof new->gcmarkbits
);
2242 float_block_index
= 0;
2245 XSETFLOAT (val
, &float_block
->floats
[float_block_index
]);
2246 float_block_index
++;
2249 XFLOAT_DATA (val
) = float_value
;
2250 eassert (!FLOAT_MARKED_P (XFLOAT (val
)));
2251 consing_since_gc
+= sizeof (struct Lisp_Float
);
2258 /***********************************************************************
2260 ***********************************************************************/
2262 /* We store cons cells inside of cons_blocks, allocating a new
2263 cons_block with malloc whenever necessary. Cons cells reclaimed by
2264 GC are put on a free list to be reallocated before allocating
2265 any new cons cells from the latest cons_block. */
2267 #define CONS_BLOCK_SIZE \
2268 (((BLOCK_BYTES - sizeof (struct cons_block *)) * CHAR_BIT) \
2269 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2271 #define CONS_BLOCK(fptr) \
2272 ((struct cons_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2274 #define CONS_INDEX(fptr) \
2275 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2279 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2280 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2281 int gcmarkbits
[1 + CONS_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2282 struct cons_block
*next
;
2285 #define CONS_MARKED_P(fptr) \
2286 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2288 #define CONS_MARK(fptr) \
2289 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2291 #define CONS_UNMARK(fptr) \
2292 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2294 /* Current cons_block. */
2296 struct cons_block
*cons_block
;
2298 /* Index of first unused Lisp_Cons in the current block. */
2300 int cons_block_index
;
2302 /* Free-list of Lisp_Cons structures. */
2304 struct Lisp_Cons
*cons_free_list
;
2306 /* Total number of cons blocks now in use. */
2311 /* Initialize cons allocation. */
2317 cons_block_index
= CONS_BLOCK_SIZE
; /* Force alloc of new cons_block. */
2323 /* Explicitly free a cons cell by putting it on the free-list. */
2327 struct Lisp_Cons
*ptr
;
2329 *(struct Lisp_Cons
**)&ptr
->cdr
= cons_free_list
;
2333 cons_free_list
= ptr
;
2337 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
2338 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2340 Lisp_Object car
, cdr
;
2342 register Lisp_Object val
;
2346 /* We use the cdr for chaining the free list
2347 so that we won't use the same field that has the mark bit. */
2348 XSETCONS (val
, cons_free_list
);
2349 cons_free_list
= *(struct Lisp_Cons
**)&cons_free_list
->cdr
;
2353 if (cons_block_index
== CONS_BLOCK_SIZE
)
2355 register struct cons_block
*new;
2356 new = (struct cons_block
*) lisp_align_malloc (sizeof *new,
2358 bzero ((char *) new->gcmarkbits
, sizeof new->gcmarkbits
);
2359 new->next
= cons_block
;
2361 cons_block_index
= 0;
2364 XSETCONS (val
, &cons_block
->conses
[cons_block_index
]);
2370 eassert (!CONS_MARKED_P (XCONS (val
)));
2371 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2372 cons_cells_consed
++;
2377 /* Make a list of 2, 3, 4 or 5 specified objects. */
2381 Lisp_Object arg1
, arg2
;
2383 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2388 list3 (arg1
, arg2
, arg3
)
2389 Lisp_Object arg1
, arg2
, arg3
;
2391 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2396 list4 (arg1
, arg2
, arg3
, arg4
)
2397 Lisp_Object arg1
, arg2
, arg3
, arg4
;
2399 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2404 list5 (arg1
, arg2
, arg3
, arg4
, arg5
)
2405 Lisp_Object arg1
, arg2
, arg3
, arg4
, arg5
;
2407 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2408 Fcons (arg5
, Qnil
)))));
2412 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
2413 doc
: /* Return a newly created list with specified arguments as elements.
2414 Any number of arguments, even zero arguments, are allowed.
2415 usage: (list &rest OBJECTS) */)
2418 register Lisp_Object
*args
;
2420 register Lisp_Object val
;
2426 val
= Fcons (args
[nargs
], val
);
2432 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2433 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2435 register Lisp_Object length
, init
;
2437 register Lisp_Object val
;
2440 CHECK_NATNUM (length
);
2441 size
= XFASTINT (length
);
2446 val
= Fcons (init
, val
);
2451 val
= Fcons (init
, val
);
2456 val
= Fcons (init
, val
);
2461 val
= Fcons (init
, val
);
2466 val
= Fcons (init
, val
);
2481 /***********************************************************************
2483 ***********************************************************************/
2485 /* Singly-linked list of all vectors. */
2487 struct Lisp_Vector
*all_vectors
;
2489 /* Total number of vector-like objects now in use. */
2494 /* Value is a pointer to a newly allocated Lisp_Vector structure
2495 with room for LEN Lisp_Objects. */
2497 static struct Lisp_Vector
*
2498 allocate_vectorlike (len
, type
)
2502 struct Lisp_Vector
*p
;
2505 #ifdef DOUG_LEA_MALLOC
2506 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
2507 because mapped region contents are not preserved in
2510 mallopt (M_MMAP_MAX
, 0);
2514 nbytes
= sizeof *p
+ (len
- 1) * sizeof p
->contents
[0];
2515 p
= (struct Lisp_Vector
*) lisp_malloc (nbytes
, type
);
2517 #ifdef DOUG_LEA_MALLOC
2518 /* Back to a reasonable maximum of mmap'ed areas. */
2520 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2524 consing_since_gc
+= nbytes
;
2525 vector_cells_consed
+= len
;
2527 p
->next
= all_vectors
;
2534 /* Allocate a vector with NSLOTS slots. */
2536 struct Lisp_Vector
*
2537 allocate_vector (nslots
)
2540 struct Lisp_Vector
*v
= allocate_vectorlike (nslots
, MEM_TYPE_VECTOR
);
2546 /* Allocate other vector-like structures. */
2548 struct Lisp_Hash_Table
*
2549 allocate_hash_table ()
2551 EMACS_INT len
= VECSIZE (struct Lisp_Hash_Table
);
2552 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_HASH_TABLE
);
2556 for (i
= 0; i
< len
; ++i
)
2557 v
->contents
[i
] = Qnil
;
2559 return (struct Lisp_Hash_Table
*) v
;
2566 EMACS_INT len
= VECSIZE (struct window
);
2567 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_WINDOW
);
2570 for (i
= 0; i
< len
; ++i
)
2571 v
->contents
[i
] = Qnil
;
2574 return (struct window
*) v
;
2581 EMACS_INT len
= VECSIZE (struct frame
);
2582 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_FRAME
);
2585 for (i
= 0; i
< len
; ++i
)
2586 v
->contents
[i
] = make_number (0);
2588 return (struct frame
*) v
;
2592 struct Lisp_Process
*
2595 EMACS_INT len
= VECSIZE (struct Lisp_Process
);
2596 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_PROCESS
);
2599 for (i
= 0; i
< len
; ++i
)
2600 v
->contents
[i
] = Qnil
;
2603 return (struct Lisp_Process
*) v
;
2607 struct Lisp_Vector
*
2608 allocate_other_vector (len
)
2611 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_VECTOR
);
2614 for (i
= 0; i
< len
; ++i
)
2615 v
->contents
[i
] = Qnil
;
2622 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
2623 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
2624 See also the function `vector'. */)
2626 register Lisp_Object length
, init
;
2629 register EMACS_INT sizei
;
2631 register struct Lisp_Vector
*p
;
2633 CHECK_NATNUM (length
);
2634 sizei
= XFASTINT (length
);
2636 p
= allocate_vector (sizei
);
2637 for (index
= 0; index
< sizei
; index
++)
2638 p
->contents
[index
] = init
;
2640 XSETVECTOR (vector
, p
);
2645 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
2646 doc
: /* Return a newly created vector with specified arguments as elements.
2647 Any number of arguments, even zero arguments, are allowed.
2648 usage: (vector &rest OBJECTS) */)
2653 register Lisp_Object len
, val
;
2655 register struct Lisp_Vector
*p
;
2657 XSETFASTINT (len
, nargs
);
2658 val
= Fmake_vector (len
, Qnil
);
2660 for (index
= 0; index
< nargs
; index
++)
2661 p
->contents
[index
] = args
[index
];
2666 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
2667 doc
: /* Create a byte-code object with specified arguments as elements.
2668 The arguments should be the arglist, bytecode-string, constant vector,
2669 stack size, (optional) doc string, and (optional) interactive spec.
2670 The first four arguments are required; at most six have any
2672 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
2677 register Lisp_Object len
, val
;
2679 register struct Lisp_Vector
*p
;
2681 XSETFASTINT (len
, nargs
);
2682 if (!NILP (Vpurify_flag
))
2683 val
= make_pure_vector ((EMACS_INT
) nargs
);
2685 val
= Fmake_vector (len
, Qnil
);
2687 if (STRINGP (args
[1]) && STRING_MULTIBYTE (args
[1]))
2688 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
2689 earlier because they produced a raw 8-bit string for byte-code
2690 and now such a byte-code string is loaded as multibyte while
2691 raw 8-bit characters converted to multibyte form. Thus, now we
2692 must convert them back to the original unibyte form. */
2693 args
[1] = Fstring_as_unibyte (args
[1]);
2696 for (index
= 0; index
< nargs
; index
++)
2698 if (!NILP (Vpurify_flag
))
2699 args
[index
] = Fpurecopy (args
[index
]);
2700 p
->contents
[index
] = args
[index
];
2702 XSETCOMPILED (val
, p
);
2708 /***********************************************************************
2710 ***********************************************************************/
2712 /* Each symbol_block is just under 1020 bytes long, since malloc
2713 really allocates in units of powers of two and uses 4 bytes for its
2716 #define SYMBOL_BLOCK_SIZE \
2717 ((1020 - sizeof (struct symbol_block *)) / sizeof (struct Lisp_Symbol))
2721 /* Place `symbols' first, to preserve alignment. */
2722 struct Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
2723 struct symbol_block
*next
;
2726 /* Current symbol block and index of first unused Lisp_Symbol
2729 struct symbol_block
*symbol_block
;
2730 int symbol_block_index
;
2732 /* List of free symbols. */
2734 struct Lisp_Symbol
*symbol_free_list
;
2736 /* Total number of symbol blocks now in use. */
2738 int n_symbol_blocks
;
2741 /* Initialize symbol allocation. */
2746 symbol_block
= NULL
;
2747 symbol_block_index
= SYMBOL_BLOCK_SIZE
;
2748 symbol_free_list
= 0;
2749 n_symbol_blocks
= 0;
2753 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
2754 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
2755 Its value and function definition are void, and its property list is nil. */)
2759 register Lisp_Object val
;
2760 register struct Lisp_Symbol
*p
;
2762 CHECK_STRING (name
);
2764 if (symbol_free_list
)
2766 XSETSYMBOL (val
, symbol_free_list
);
2767 symbol_free_list
= *(struct Lisp_Symbol
**)&symbol_free_list
->value
;
2771 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
2773 struct symbol_block
*new;
2774 new = (struct symbol_block
*) lisp_malloc (sizeof *new,
2776 new->next
= symbol_block
;
2778 symbol_block_index
= 0;
2781 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
]);
2782 symbol_block_index
++;
2788 p
->value
= Qunbound
;
2789 p
->function
= Qunbound
;
2792 p
->interned
= SYMBOL_UNINTERNED
;
2794 p
->indirect_variable
= 0;
2795 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
2802 /***********************************************************************
2803 Marker (Misc) Allocation
2804 ***********************************************************************/
2806 /* Allocation of markers and other objects that share that structure.
2807 Works like allocation of conses. */
2809 #define MARKER_BLOCK_SIZE \
2810 ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc))
2814 /* Place `markers' first, to preserve alignment. */
2815 union Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
2816 struct marker_block
*next
;
2819 struct marker_block
*marker_block
;
2820 int marker_block_index
;
2822 union Lisp_Misc
*marker_free_list
;
2824 /* Total number of marker blocks now in use. */
2826 int n_marker_blocks
;
2831 marker_block
= NULL
;
2832 marker_block_index
= MARKER_BLOCK_SIZE
;
2833 marker_free_list
= 0;
2834 n_marker_blocks
= 0;
2837 /* Return a newly allocated Lisp_Misc object, with no substructure. */
2844 if (marker_free_list
)
2846 XSETMISC (val
, marker_free_list
);
2847 marker_free_list
= marker_free_list
->u_free
.chain
;
2851 if (marker_block_index
== MARKER_BLOCK_SIZE
)
2853 struct marker_block
*new;
2854 new = (struct marker_block
*) lisp_malloc (sizeof *new,
2856 new->next
= marker_block
;
2858 marker_block_index
= 0;
2861 XSETMISC (val
, &marker_block
->markers
[marker_block_index
]);
2862 marker_block_index
++;
2865 consing_since_gc
+= sizeof (union Lisp_Misc
);
2866 misc_objects_consed
++;
2867 XMARKER (val
)->gcmarkbit
= 0;
2871 /* Return a Lisp_Misc_Save_Value object containing POINTER and
2872 INTEGER. This is used to package C values to call record_unwind_protect.
2873 The unwind function can get the C values back using XSAVE_VALUE. */
2876 make_save_value (pointer
, integer
)
2880 register Lisp_Object val
;
2881 register struct Lisp_Save_Value
*p
;
2883 val
= allocate_misc ();
2884 XMISCTYPE (val
) = Lisp_Misc_Save_Value
;
2885 p
= XSAVE_VALUE (val
);
2886 p
->pointer
= pointer
;
2887 p
->integer
= integer
;
2891 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
2892 doc
: /* Return a newly allocated marker which does not point at any place. */)
2895 register Lisp_Object val
;
2896 register struct Lisp_Marker
*p
;
2898 val
= allocate_misc ();
2899 XMISCTYPE (val
) = Lisp_Misc_Marker
;
2905 p
->insertion_type
= 0;
2909 /* Put MARKER back on the free list after using it temporarily. */
2912 free_marker (marker
)
2915 unchain_marker (XMARKER (marker
));
2917 XMISC (marker
)->u_marker
.type
= Lisp_Misc_Free
;
2918 XMISC (marker
)->u_free
.chain
= marker_free_list
;
2919 marker_free_list
= XMISC (marker
);
2921 total_free_markers
++;
2925 /* Return a newly created vector or string with specified arguments as
2926 elements. If all the arguments are characters that can fit
2927 in a string of events, make a string; otherwise, make a vector.
2929 Any number of arguments, even zero arguments, are allowed. */
2932 make_event_array (nargs
, args
)
2938 for (i
= 0; i
< nargs
; i
++)
2939 /* The things that fit in a string
2940 are characters that are in 0...127,
2941 after discarding the meta bit and all the bits above it. */
2942 if (!INTEGERP (args
[i
])
2943 || (XUINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
2944 return Fvector (nargs
, args
);
2946 /* Since the loop exited, we know that all the things in it are
2947 characters, so we can make a string. */
2951 result
= Fmake_string (make_number (nargs
), make_number (0));
2952 for (i
= 0; i
< nargs
; i
++)
2954 SSET (result
, i
, XINT (args
[i
]));
2955 /* Move the meta bit to the right place for a string char. */
2956 if (XINT (args
[i
]) & CHAR_META
)
2957 SSET (result
, i
, SREF (result
, i
) | 0x80);
2966 /************************************************************************
2968 ************************************************************************/
2970 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
2972 /* Conservative C stack marking requires a method to identify possibly
2973 live Lisp objects given a pointer value. We do this by keeping
2974 track of blocks of Lisp data that are allocated in a red-black tree
2975 (see also the comment of mem_node which is the type of nodes in
2976 that tree). Function lisp_malloc adds information for an allocated
2977 block to the red-black tree with calls to mem_insert, and function
2978 lisp_free removes it with mem_delete. Functions live_string_p etc
2979 call mem_find to lookup information about a given pointer in the
2980 tree, and use that to determine if the pointer points to a Lisp
2983 /* Initialize this part of alloc.c. */
2988 mem_z
.left
= mem_z
.right
= MEM_NIL
;
2989 mem_z
.parent
= NULL
;
2990 mem_z
.color
= MEM_BLACK
;
2991 mem_z
.start
= mem_z
.end
= NULL
;
2996 /* Value is a pointer to the mem_node containing START. Value is
2997 MEM_NIL if there is no node in the tree containing START. */
2999 static INLINE
struct mem_node
*
3005 if (start
< min_heap_address
|| start
> max_heap_address
)
3008 /* Make the search always successful to speed up the loop below. */
3009 mem_z
.start
= start
;
3010 mem_z
.end
= (char *) start
+ 1;
3013 while (start
< p
->start
|| start
>= p
->end
)
3014 p
= start
< p
->start
? p
->left
: p
->right
;
3019 /* Insert a new node into the tree for a block of memory with start
3020 address START, end address END, and type TYPE. Value is a
3021 pointer to the node that was inserted. */
3023 static struct mem_node
*
3024 mem_insert (start
, end
, type
)
3028 struct mem_node
*c
, *parent
, *x
;
3030 if (start
< min_heap_address
)
3031 min_heap_address
= start
;
3032 if (end
> max_heap_address
)
3033 max_heap_address
= end
;
3035 /* See where in the tree a node for START belongs. In this
3036 particular application, it shouldn't happen that a node is already
3037 present. For debugging purposes, let's check that. */
3041 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3043 while (c
!= MEM_NIL
)
3045 if (start
>= c
->start
&& start
< c
->end
)
3048 c
= start
< c
->start
? c
->left
: c
->right
;
3051 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3053 while (c
!= MEM_NIL
)
3056 c
= start
< c
->start
? c
->left
: c
->right
;
3059 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3061 /* Create a new node. */
3062 #ifdef GC_MALLOC_CHECK
3063 x
= (struct mem_node
*) _malloc_internal (sizeof *x
);
3067 x
= (struct mem_node
*) xmalloc (sizeof *x
);
3073 x
->left
= x
->right
= MEM_NIL
;
3076 /* Insert it as child of PARENT or install it as root. */
3079 if (start
< parent
->start
)
3087 /* Re-establish red-black tree properties. */
3088 mem_insert_fixup (x
);
3094 /* Re-establish the red-black properties of the tree, and thereby
3095 balance the tree, after node X has been inserted; X is always red. */
3098 mem_insert_fixup (x
)
3101 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3103 /* X is red and its parent is red. This is a violation of
3104 red-black tree property #3. */
3106 if (x
->parent
== x
->parent
->parent
->left
)
3108 /* We're on the left side of our grandparent, and Y is our
3110 struct mem_node
*y
= x
->parent
->parent
->right
;
3112 if (y
->color
== MEM_RED
)
3114 /* Uncle and parent are red but should be black because
3115 X is red. Change the colors accordingly and proceed
3116 with the grandparent. */
3117 x
->parent
->color
= MEM_BLACK
;
3118 y
->color
= MEM_BLACK
;
3119 x
->parent
->parent
->color
= MEM_RED
;
3120 x
= x
->parent
->parent
;
3124 /* Parent and uncle have different colors; parent is
3125 red, uncle is black. */
3126 if (x
== x
->parent
->right
)
3129 mem_rotate_left (x
);
3132 x
->parent
->color
= MEM_BLACK
;
3133 x
->parent
->parent
->color
= MEM_RED
;
3134 mem_rotate_right (x
->parent
->parent
);
3139 /* This is the symmetrical case of above. */
3140 struct mem_node
*y
= x
->parent
->parent
->left
;
3142 if (y
->color
== MEM_RED
)
3144 x
->parent
->color
= MEM_BLACK
;
3145 y
->color
= MEM_BLACK
;
3146 x
->parent
->parent
->color
= MEM_RED
;
3147 x
= x
->parent
->parent
;
3151 if (x
== x
->parent
->left
)
3154 mem_rotate_right (x
);
3157 x
->parent
->color
= MEM_BLACK
;
3158 x
->parent
->parent
->color
= MEM_RED
;
3159 mem_rotate_left (x
->parent
->parent
);
3164 /* The root may have been changed to red due to the algorithm. Set
3165 it to black so that property #5 is satisfied. */
3166 mem_root
->color
= MEM_BLACK
;
3182 /* Turn y's left sub-tree into x's right sub-tree. */
3185 if (y
->left
!= MEM_NIL
)
3186 y
->left
->parent
= x
;
3188 /* Y's parent was x's parent. */
3190 y
->parent
= x
->parent
;
3192 /* Get the parent to point to y instead of x. */
3195 if (x
== x
->parent
->left
)
3196 x
->parent
->left
= y
;
3198 x
->parent
->right
= y
;
3203 /* Put x on y's left. */
3217 mem_rotate_right (x
)
3220 struct mem_node
*y
= x
->left
;
3223 if (y
->right
!= MEM_NIL
)
3224 y
->right
->parent
= x
;
3227 y
->parent
= x
->parent
;
3230 if (x
== x
->parent
->right
)
3231 x
->parent
->right
= y
;
3233 x
->parent
->left
= y
;
3244 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
3250 struct mem_node
*x
, *y
;
3252 if (!z
|| z
== MEM_NIL
)
3255 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
3260 while (y
->left
!= MEM_NIL
)
3264 if (y
->left
!= MEM_NIL
)
3269 x
->parent
= y
->parent
;
3272 if (y
== y
->parent
->left
)
3273 y
->parent
->left
= x
;
3275 y
->parent
->right
= x
;
3282 z
->start
= y
->start
;
3287 if (y
->color
== MEM_BLACK
)
3288 mem_delete_fixup (x
);
3290 #ifdef GC_MALLOC_CHECK
3298 /* Re-establish the red-black properties of the tree, after a
3302 mem_delete_fixup (x
)
3305 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
3307 if (x
== x
->parent
->left
)
3309 struct mem_node
*w
= x
->parent
->right
;
3311 if (w
->color
== MEM_RED
)
3313 w
->color
= MEM_BLACK
;
3314 x
->parent
->color
= MEM_RED
;
3315 mem_rotate_left (x
->parent
);
3316 w
= x
->parent
->right
;
3319 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
3326 if (w
->right
->color
== MEM_BLACK
)
3328 w
->left
->color
= MEM_BLACK
;
3330 mem_rotate_right (w
);
3331 w
= x
->parent
->right
;
3333 w
->color
= x
->parent
->color
;
3334 x
->parent
->color
= MEM_BLACK
;
3335 w
->right
->color
= MEM_BLACK
;
3336 mem_rotate_left (x
->parent
);
3342 struct mem_node
*w
= x
->parent
->left
;
3344 if (w
->color
== MEM_RED
)
3346 w
->color
= MEM_BLACK
;
3347 x
->parent
->color
= MEM_RED
;
3348 mem_rotate_right (x
->parent
);
3349 w
= x
->parent
->left
;
3352 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
3359 if (w
->left
->color
== MEM_BLACK
)
3361 w
->right
->color
= MEM_BLACK
;
3363 mem_rotate_left (w
);
3364 w
= x
->parent
->left
;
3367 w
->color
= x
->parent
->color
;
3368 x
->parent
->color
= MEM_BLACK
;
3369 w
->left
->color
= MEM_BLACK
;
3370 mem_rotate_right (x
->parent
);
3376 x
->color
= MEM_BLACK
;
3380 /* Value is non-zero if P is a pointer to a live Lisp string on
3381 the heap. M is a pointer to the mem_block for P. */
3384 live_string_p (m
, p
)
3388 if (m
->type
== MEM_TYPE_STRING
)
3390 struct string_block
*b
= (struct string_block
*) m
->start
;
3391 int offset
= (char *) p
- (char *) &b
->strings
[0];
3393 /* P must point to the start of a Lisp_String structure, and it
3394 must not be on the free-list. */
3396 && offset
% sizeof b
->strings
[0] == 0
3397 && offset
< (STRING_BLOCK_SIZE
* sizeof b
->strings
[0])
3398 && ((struct Lisp_String
*) p
)->data
!= NULL
);
3405 /* Value is non-zero if P is a pointer to a live Lisp cons on
3406 the heap. M is a pointer to the mem_block for P. */
3413 if (m
->type
== MEM_TYPE_CONS
)
3415 struct cons_block
*b
= (struct cons_block
*) m
->start
;
3416 int offset
= (char *) p
- (char *) &b
->conses
[0];
3418 /* P must point to the start of a Lisp_Cons, not be
3419 one of the unused cells in the current cons block,
3420 and not be on the free-list. */
3422 && offset
% sizeof b
->conses
[0] == 0
3423 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
3425 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
3426 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
3433 /* Value is non-zero if P is a pointer to a live Lisp symbol on
3434 the heap. M is a pointer to the mem_block for P. */
3437 live_symbol_p (m
, p
)
3441 if (m
->type
== MEM_TYPE_SYMBOL
)
3443 struct symbol_block
*b
= (struct symbol_block
*) m
->start
;
3444 int offset
= (char *) p
- (char *) &b
->symbols
[0];
3446 /* P must point to the start of a Lisp_Symbol, not be
3447 one of the unused cells in the current symbol block,
3448 and not be on the free-list. */
3450 && offset
% sizeof b
->symbols
[0] == 0
3451 && offset
< (SYMBOL_BLOCK_SIZE
* sizeof b
->symbols
[0])
3452 && (b
!= symbol_block
3453 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
3454 && !EQ (((struct Lisp_Symbol
*) p
)->function
, Vdead
));
3461 /* Value is non-zero if P is a pointer to a live Lisp float on
3462 the heap. M is a pointer to the mem_block for P. */
3469 if (m
->type
== MEM_TYPE_FLOAT
)
3471 struct float_block
*b
= (struct float_block
*) m
->start
;
3472 int offset
= (char *) p
- (char *) &b
->floats
[0];
3474 /* P must point to the start of a Lisp_Float and not be
3475 one of the unused cells in the current float block. */
3477 && offset
% sizeof b
->floats
[0] == 0
3478 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
3479 && (b
!= float_block
3480 || offset
/ sizeof b
->floats
[0] < float_block_index
));
3487 /* Value is non-zero if P is a pointer to a live Lisp Misc on
3488 the heap. M is a pointer to the mem_block for P. */
3495 if (m
->type
== MEM_TYPE_MISC
)
3497 struct marker_block
*b
= (struct marker_block
*) m
->start
;
3498 int offset
= (char *) p
- (char *) &b
->markers
[0];
3500 /* P must point to the start of a Lisp_Misc, not be
3501 one of the unused cells in the current misc block,
3502 and not be on the free-list. */
3504 && offset
% sizeof b
->markers
[0] == 0
3505 && offset
< (MARKER_BLOCK_SIZE
* sizeof b
->markers
[0])
3506 && (b
!= marker_block
3507 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
3508 && ((union Lisp_Misc
*) p
)->u_marker
.type
!= Lisp_Misc_Free
);
3515 /* Value is non-zero if P is a pointer to a live vector-like object.
3516 M is a pointer to the mem_block for P. */
3519 live_vector_p (m
, p
)
3523 return (p
== m
->start
3524 && m
->type
>= MEM_TYPE_VECTOR
3525 && m
->type
<= MEM_TYPE_WINDOW
);
3529 /* Value is non-zero if P is a pointer to a live buffer. M is a
3530 pointer to the mem_block for P. */
3533 live_buffer_p (m
, p
)
3537 /* P must point to the start of the block, and the buffer
3538 must not have been killed. */
3539 return (m
->type
== MEM_TYPE_BUFFER
3541 && !NILP (((struct buffer
*) p
)->name
));
3544 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
3548 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3550 /* Array of objects that are kept alive because the C stack contains
3551 a pattern that looks like a reference to them . */
3553 #define MAX_ZOMBIES 10
3554 static Lisp_Object zombies
[MAX_ZOMBIES
];
3556 /* Number of zombie objects. */
3558 static int nzombies
;
3560 /* Number of garbage collections. */
3564 /* Average percentage of zombies per collection. */
3566 static double avg_zombies
;
3568 /* Max. number of live and zombie objects. */
3570 static int max_live
, max_zombies
;
3572 /* Average number of live objects per GC. */
3574 static double avg_live
;
3576 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
3577 doc
: /* Show information about live and zombie objects. */)
3580 Lisp_Object args
[8], zombie_list
= Qnil
;
3582 for (i
= 0; i
< nzombies
; i
++)
3583 zombie_list
= Fcons (zombies
[i
], zombie_list
);
3584 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
3585 args
[1] = make_number (ngcs
);
3586 args
[2] = make_float (avg_live
);
3587 args
[3] = make_float (avg_zombies
);
3588 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
3589 args
[5] = make_number (max_live
);
3590 args
[6] = make_number (max_zombies
);
3591 args
[7] = zombie_list
;
3592 return Fmessage (8, args
);
3595 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
3598 /* Mark OBJ if we can prove it's a Lisp_Object. */
3601 mark_maybe_object (obj
)
3604 void *po
= (void *) XPNTR (obj
);
3605 struct mem_node
*m
= mem_find (po
);
3611 switch (XGCTYPE (obj
))
3614 mark_p
= (live_string_p (m
, po
)
3615 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
3619 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
3623 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
3627 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
3630 case Lisp_Vectorlike
:
3631 /* Note: can't check GC_BUFFERP before we know it's a
3632 buffer because checking that dereferences the pointer
3633 PO which might point anywhere. */
3634 if (live_vector_p (m
, po
))
3635 mark_p
= !GC_SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
3636 else if (live_buffer_p (m
, po
))
3637 mark_p
= GC_BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
3641 mark_p
= (live_misc_p (m
, po
) && !XMARKER (obj
)->gcmarkbit
);
3645 case Lisp_Type_Limit
:
3651 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3652 if (nzombies
< MAX_ZOMBIES
)
3653 zombies
[nzombies
] = obj
;
3662 /* If P points to Lisp data, mark that as live if it isn't already
3666 mark_maybe_pointer (p
)
3671 /* Quickly rule out some values which can't point to Lisp data. We
3672 assume that Lisp data is aligned on even addresses. */
3673 if ((EMACS_INT
) p
& 1)
3679 Lisp_Object obj
= Qnil
;
3683 case MEM_TYPE_NON_LISP
:
3684 /* Nothing to do; not a pointer to Lisp memory. */
3687 case MEM_TYPE_BUFFER
:
3688 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P((struct buffer
*)p
))
3689 XSETVECTOR (obj
, p
);
3693 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
3697 case MEM_TYPE_STRING
:
3698 if (live_string_p (m
, p
)
3699 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
3700 XSETSTRING (obj
, p
);
3704 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
3708 case MEM_TYPE_SYMBOL
:
3709 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
3710 XSETSYMBOL (obj
, p
);
3713 case MEM_TYPE_FLOAT
:
3714 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
3718 case MEM_TYPE_VECTOR
:
3719 case MEM_TYPE_PROCESS
:
3720 case MEM_TYPE_HASH_TABLE
:
3721 case MEM_TYPE_FRAME
:
3722 case MEM_TYPE_WINDOW
:
3723 if (live_vector_p (m
, p
))
3726 XSETVECTOR (tem
, p
);
3727 if (!GC_SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
3742 /* Mark Lisp objects referenced from the address range START..END. */
3745 mark_memory (start
, end
)
3751 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3755 /* Make START the pointer to the start of the memory region,
3756 if it isn't already. */
3764 /* Mark Lisp_Objects. */
3765 for (p
= (Lisp_Object
*) start
; (void *) p
< end
; ++p
)
3766 mark_maybe_object (*p
);
3768 /* Mark Lisp data pointed to. This is necessary because, in some
3769 situations, the C compiler optimizes Lisp objects away, so that
3770 only a pointer to them remains. Example:
3772 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
3775 Lisp_Object obj = build_string ("test");
3776 struct Lisp_String *s = XSTRING (obj);
3777 Fgarbage_collect ();
3778 fprintf (stderr, "test `%s'\n", s->data);
3782 Here, `obj' isn't really used, and the compiler optimizes it
3783 away. The only reference to the life string is through the
3786 for (pp
= (void **) start
; (void *) pp
< end
; ++pp
)
3787 mark_maybe_pointer (*pp
);
3790 /* setjmp will work with GCC unless NON_SAVING_SETJMP is defined in
3791 the GCC system configuration. In gcc 3.2, the only systems for
3792 which this is so are i386-sco5 non-ELF, i386-sysv3 (maybe included
3793 by others?) and ns32k-pc532-min. */
3795 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
3797 static int setjmp_tested_p
, longjmps_done
;
3799 #define SETJMP_WILL_LIKELY_WORK "\
3801 Emacs garbage collector has been changed to use conservative stack\n\
3802 marking. Emacs has determined that the method it uses to do the\n\
3803 marking will likely work on your system, but this isn't sure.\n\
3805 If you are a system-programmer, or can get the help of a local wizard\n\
3806 who is, please take a look at the function mark_stack in alloc.c, and\n\
3807 verify that the methods used are appropriate for your system.\n\
3809 Please mail the result to <emacs-devel@gnu.org>.\n\
3812 #define SETJMP_WILL_NOT_WORK "\
3814 Emacs garbage collector has been changed to use conservative stack\n\
3815 marking. Emacs has determined that the default method it uses to do the\n\
3816 marking will not work on your system. We will need a system-dependent\n\
3817 solution for your system.\n\
3819 Please take a look at the function mark_stack in alloc.c, and\n\
3820 try to find a way to make it work on your system.\n\
3822 Note that you may get false negatives, depending on the compiler.\n\
3823 In particular, you need to use -O with GCC for this test.\n\
3825 Please mail the result to <emacs-devel@gnu.org>.\n\
3829 /* Perform a quick check if it looks like setjmp saves registers in a
3830 jmp_buf. Print a message to stderr saying so. When this test
3831 succeeds, this is _not_ a proof that setjmp is sufficient for
3832 conservative stack marking. Only the sources or a disassembly
3843 /* Arrange for X to be put in a register. */
3849 if (longjmps_done
== 1)
3851 /* Came here after the longjmp at the end of the function.
3853 If x == 1, the longjmp has restored the register to its
3854 value before the setjmp, and we can hope that setjmp
3855 saves all such registers in the jmp_buf, although that
3858 For other values of X, either something really strange is
3859 taking place, or the setjmp just didn't save the register. */
3862 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
3865 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
3872 if (longjmps_done
== 1)
3876 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
3879 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
3881 /* Abort if anything GCPRO'd doesn't survive the GC. */
3889 for (p
= gcprolist
; p
; p
= p
->next
)
3890 for (i
= 0; i
< p
->nvars
; ++i
)
3891 if (!survives_gc_p (p
->var
[i
]))
3892 /* FIXME: It's not necessarily a bug. It might just be that the
3893 GCPRO is unnecessary or should release the object sooner. */
3897 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3904 fprintf (stderr
, "\nZombies kept alive = %d:\n", nzombies
);
3905 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
3907 fprintf (stderr
, " %d = ", i
);
3908 debug_print (zombies
[i
]);
3912 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
3915 /* Mark live Lisp objects on the C stack.
3917 There are several system-dependent problems to consider when
3918 porting this to new architectures:
3922 We have to mark Lisp objects in CPU registers that can hold local
3923 variables or are used to pass parameters.
3925 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
3926 something that either saves relevant registers on the stack, or
3927 calls mark_maybe_object passing it each register's contents.
3929 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
3930 implementation assumes that calling setjmp saves registers we need
3931 to see in a jmp_buf which itself lies on the stack. This doesn't
3932 have to be true! It must be verified for each system, possibly
3933 by taking a look at the source code of setjmp.
3937 Architectures differ in the way their processor stack is organized.
3938 For example, the stack might look like this
3941 | Lisp_Object | size = 4
3943 | something else | size = 2
3945 | Lisp_Object | size = 4
3949 In such a case, not every Lisp_Object will be aligned equally. To
3950 find all Lisp_Object on the stack it won't be sufficient to walk
3951 the stack in steps of 4 bytes. Instead, two passes will be
3952 necessary, one starting at the start of the stack, and a second
3953 pass starting at the start of the stack + 2. Likewise, if the
3954 minimal alignment of Lisp_Objects on the stack is 1, four passes
3955 would be necessary, each one starting with one byte more offset
3956 from the stack start.
3958 The current code assumes by default that Lisp_Objects are aligned
3959 equally on the stack. */
3966 volatile int stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
3969 /* This trick flushes the register windows so that all the state of
3970 the process is contained in the stack. */
3971 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
3972 needed on ia64 too. See mach_dep.c, where it also says inline
3973 assembler doesn't work with relevant proprietary compilers. */
3978 /* Save registers that we need to see on the stack. We need to see
3979 registers used to hold register variables and registers used to
3981 #ifdef GC_SAVE_REGISTERS_ON_STACK
3982 GC_SAVE_REGISTERS_ON_STACK (end
);
3983 #else /* not GC_SAVE_REGISTERS_ON_STACK */
3985 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
3986 setjmp will definitely work, test it
3987 and print a message with the result
3989 if (!setjmp_tested_p
)
3991 setjmp_tested_p
= 1;
3994 #endif /* GC_SETJMP_WORKS */
3997 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
3998 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
4000 /* This assumes that the stack is a contiguous region in memory. If
4001 that's not the case, something has to be done here to iterate
4002 over the stack segments. */
4003 #ifndef GC_LISP_OBJECT_ALIGNMENT
4005 #define GC_LISP_OBJECT_ALIGNMENT __alignof__ (Lisp_Object)
4007 #define GC_LISP_OBJECT_ALIGNMENT sizeof (Lisp_Object)
4010 for (i
= 0; i
< sizeof (Lisp_Object
); i
+= GC_LISP_OBJECT_ALIGNMENT
)
4011 mark_memory ((char *) stack_base
+ i
, end
);
4013 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4019 #endif /* GC_MARK_STACK != 0 */
4023 /***********************************************************************
4024 Pure Storage Management
4025 ***********************************************************************/
4027 /* Allocate room for SIZE bytes from pure Lisp storage and return a
4028 pointer to it. TYPE is the Lisp type for which the memory is
4029 allocated. TYPE < 0 means it's not used for a Lisp object.
4031 If store_pure_type_info is set and TYPE is >= 0, the type of
4032 the allocated object is recorded in pure_types. */
4034 static POINTER_TYPE
*
4035 pure_alloc (size
, type
)
4039 POINTER_TYPE
*result
;
4041 size_t alignment
= (1 << GCTYPEBITS
);
4043 size_t alignment
= sizeof (EMACS_INT
);
4045 /* Give Lisp_Floats an extra alignment. */
4046 if (type
== Lisp_Float
)
4048 #if defined __GNUC__ && __GNUC__ >= 2
4049 alignment
= __alignof (struct Lisp_Float
);
4051 alignment
= sizeof (struct Lisp_Float
);
4057 result
= ALIGN (purebeg
+ pure_bytes_used
, alignment
);
4058 pure_bytes_used
= ((char *)result
- (char *)purebeg
) + size
;
4060 if (pure_bytes_used
<= pure_size
)
4063 /* Don't allocate a large amount here,
4064 because it might get mmap'd and then its address
4065 might not be usable. */
4066 purebeg
= (char *) xmalloc (10000);
4068 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
4069 pure_bytes_used
= 0;
4074 /* Print a warning if PURESIZE is too small. */
4079 if (pure_bytes_used_before_overflow
)
4080 message ("Pure Lisp storage overflow (approx. %d bytes needed)",
4081 (int) (pure_bytes_used
+ pure_bytes_used_before_overflow
));
4085 /* Return a string allocated in pure space. DATA is a buffer holding
4086 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
4087 non-zero means make the result string multibyte.
4089 Must get an error if pure storage is full, since if it cannot hold
4090 a large string it may be able to hold conses that point to that
4091 string; then the string is not protected from gc. */
4094 make_pure_string (data
, nchars
, nbytes
, multibyte
)
4100 struct Lisp_String
*s
;
4102 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4103 s
->data
= (unsigned char *) pure_alloc (nbytes
+ 1, -1);
4105 s
->size_byte
= multibyte
? nbytes
: -1;
4106 bcopy (data
, s
->data
, nbytes
);
4107 s
->data
[nbytes
] = '\0';
4108 s
->intervals
= NULL_INTERVAL
;
4109 XSETSTRING (string
, s
);
4114 /* Return a cons allocated from pure space. Give it pure copies
4115 of CAR as car and CDR as cdr. */
4118 pure_cons (car
, cdr
)
4119 Lisp_Object car
, cdr
;
4121 register Lisp_Object
new;
4122 struct Lisp_Cons
*p
;
4124 p
= (struct Lisp_Cons
*) pure_alloc (sizeof *p
, Lisp_Cons
);
4126 XSETCAR (new, Fpurecopy (car
));
4127 XSETCDR (new, Fpurecopy (cdr
));
4132 /* Value is a float object with value NUM allocated from pure space. */
4135 make_pure_float (num
)
4138 register Lisp_Object
new;
4139 struct Lisp_Float
*p
;
4141 p
= (struct Lisp_Float
*) pure_alloc (sizeof *p
, Lisp_Float
);
4143 XFLOAT_DATA (new) = num
;
4148 /* Return a vector with room for LEN Lisp_Objects allocated from
4152 make_pure_vector (len
)
4156 struct Lisp_Vector
*p
;
4157 size_t size
= sizeof *p
+ (len
- 1) * sizeof (Lisp_Object
);
4159 p
= (struct Lisp_Vector
*) pure_alloc (size
, Lisp_Vectorlike
);
4160 XSETVECTOR (new, p
);
4161 XVECTOR (new)->size
= len
;
4166 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
4167 doc
: /* Make a copy of OBJECT in pure storage.
4168 Recursively copies contents of vectors and cons cells.
4169 Does not copy symbols. Copies strings without text properties. */)
4171 register Lisp_Object obj
;
4173 if (NILP (Vpurify_flag
))
4176 if (PURE_POINTER_P (XPNTR (obj
)))
4180 return pure_cons (XCAR (obj
), XCDR (obj
));
4181 else if (FLOATP (obj
))
4182 return make_pure_float (XFLOAT_DATA (obj
));
4183 else if (STRINGP (obj
))
4184 return make_pure_string (SDATA (obj
), SCHARS (obj
),
4186 STRING_MULTIBYTE (obj
));
4187 else if (COMPILEDP (obj
) || VECTORP (obj
))
4189 register struct Lisp_Vector
*vec
;
4193 size
= XVECTOR (obj
)->size
;
4194 if (size
& PSEUDOVECTOR_FLAG
)
4195 size
&= PSEUDOVECTOR_SIZE_MASK
;
4196 vec
= XVECTOR (make_pure_vector (size
));
4197 for (i
= 0; i
< size
; i
++)
4198 vec
->contents
[i
] = Fpurecopy (XVECTOR (obj
)->contents
[i
]);
4199 if (COMPILEDP (obj
))
4200 XSETCOMPILED (obj
, vec
);
4202 XSETVECTOR (obj
, vec
);
4205 else if (MARKERP (obj
))
4206 error ("Attempt to copy a marker to pure storage");
4213 /***********************************************************************
4215 ***********************************************************************/
4217 /* Put an entry in staticvec, pointing at the variable with address
4221 staticpro (varaddress
)
4222 Lisp_Object
*varaddress
;
4224 staticvec
[staticidx
++] = varaddress
;
4225 if (staticidx
>= NSTATICS
)
4233 struct catchtag
*next
;
4238 struct backtrace
*next
;
4239 Lisp_Object
*function
;
4240 Lisp_Object
*args
; /* Points to vector of args. */
4241 int nargs
; /* Length of vector. */
4242 /* If nargs is UNEVALLED, args points to slot holding list of
4249 /***********************************************************************
4251 ***********************************************************************/
4253 /* Temporarily prevent garbage collection. */
4256 inhibit_garbage_collection ()
4258 int count
= SPECPDL_INDEX ();
4259 int nbits
= min (VALBITS
, BITS_PER_INT
);
4261 specbind (Qgc_cons_threshold
, make_number (((EMACS_INT
) 1 << (nbits
- 1)) - 1));
4266 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
4267 doc
: /* Reclaim storage for Lisp objects no longer needed.
4268 Garbage collection happens automatically if you cons more than
4269 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
4270 `garbage-collect' normally returns a list with info on amount of space in use:
4271 ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)
4272 (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS
4273 (USED-FLOATS . FREE-FLOATS) (USED-INTERVALS . FREE-INTERVALS)
4274 (USED-STRINGS . FREE-STRINGS))
4275 However, if there was overflow in pure space, `garbage-collect'
4276 returns nil, because real GC can't be done. */)
4279 register struct specbinding
*bind
;
4280 struct catchtag
*catch;
4281 struct handler
*handler
;
4282 register struct backtrace
*backlist
;
4283 char stack_top_variable
;
4286 Lisp_Object total
[8];
4287 int count
= SPECPDL_INDEX ();
4288 EMACS_TIME t1
, t2
, t3
;
4293 EMACS_GET_TIME (t1
);
4295 /* Can't GC if pure storage overflowed because we can't determine
4296 if something is a pure object or not. */
4297 if (pure_bytes_used_before_overflow
)
4300 /* In case user calls debug_print during GC,
4301 don't let that cause a recursive GC. */
4302 consing_since_gc
= 0;
4304 /* Save what's currently displayed in the echo area. */
4305 message_p
= push_message ();
4306 record_unwind_protect (pop_message_unwind
, Qnil
);
4308 /* Save a copy of the contents of the stack, for debugging. */
4309 #if MAX_SAVE_STACK > 0
4310 if (NILP (Vpurify_flag
))
4312 i
= &stack_top_variable
- stack_bottom
;
4314 if (i
< MAX_SAVE_STACK
)
4316 if (stack_copy
== 0)
4317 stack_copy
= (char *) xmalloc (stack_copy_size
= i
);
4318 else if (stack_copy_size
< i
)
4319 stack_copy
= (char *) xrealloc (stack_copy
, (stack_copy_size
= i
));
4322 if ((EMACS_INT
) (&stack_top_variable
- stack_bottom
) > 0)
4323 bcopy (stack_bottom
, stack_copy
, i
);
4325 bcopy (&stack_top_variable
, stack_copy
, i
);
4329 #endif /* MAX_SAVE_STACK > 0 */
4331 if (garbage_collection_messages
)
4332 message1_nolog ("Garbage collecting...");
4336 shrink_regexp_cache ();
4338 /* Don't keep undo information around forever. */
4340 register struct buffer
*nextb
= all_buffers
;
4344 /* If a buffer's undo list is Qt, that means that undo is
4345 turned off in that buffer. Calling truncate_undo_list on
4346 Qt tends to return NULL, which effectively turns undo back on.
4347 So don't call truncate_undo_list if undo_list is Qt. */
4348 if (! EQ (nextb
->undo_list
, Qt
))
4350 = truncate_undo_list (nextb
->undo_list
, undo_limit
,
4353 /* Shrink buffer gaps, but skip indirect and dead buffers. */
4354 if (nextb
->base_buffer
== 0 && !NILP (nextb
->name
))
4356 /* If a buffer's gap size is more than 10% of the buffer
4357 size, or larger than 2000 bytes, then shrink it
4358 accordingly. Keep a minimum size of 20 bytes. */
4359 int size
= min (2000, max (20, (nextb
->text
->z_byte
/ 10)));
4361 if (nextb
->text
->gap_size
> size
)
4363 struct buffer
*save_current
= current_buffer
;
4364 current_buffer
= nextb
;
4365 make_gap (-(nextb
->text
->gap_size
- size
));
4366 current_buffer
= save_current
;
4370 nextb
= nextb
->next
;
4376 /* clear_marks (); */
4378 /* Mark all the special slots that serve as the roots of accessibility. */
4380 for (i
= 0; i
< staticidx
; i
++)
4381 mark_object (*staticvec
[i
]);
4383 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
4384 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
4388 register struct gcpro
*tail
;
4389 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
4390 for (i
= 0; i
< tail
->nvars
; i
++)
4391 mark_object (tail
->var
[i
]);
4396 for (bind
= specpdl
; bind
!= specpdl_ptr
; bind
++)
4398 mark_object (bind
->symbol
);
4399 mark_object (bind
->old_value
);
4401 for (catch = catchlist
; catch; catch = catch->next
)
4403 mark_object (catch->tag
);
4404 mark_object (catch->val
);
4406 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
4408 mark_object (handler
->handler
);
4409 mark_object (handler
->var
);
4411 for (backlist
= backtrace_list
; backlist
; backlist
= backlist
->next
)
4413 mark_object (*backlist
->function
);
4415 if (backlist
->nargs
== UNEVALLED
|| backlist
->nargs
== MANY
)
4418 i
= backlist
->nargs
- 1;
4420 mark_object (backlist
->args
[i
]);
4424 /* Look thru every buffer's undo list
4425 for elements that update markers that were not marked,
4428 register struct buffer
*nextb
= all_buffers
;
4432 /* If a buffer's undo list is Qt, that means that undo is
4433 turned off in that buffer. Calling truncate_undo_list on
4434 Qt tends to return NULL, which effectively turns undo back on.
4435 So don't call truncate_undo_list if undo_list is Qt. */
4436 if (! EQ (nextb
->undo_list
, Qt
))
4438 Lisp_Object tail
, prev
;
4439 tail
= nextb
->undo_list
;
4441 while (CONSP (tail
))
4443 if (GC_CONSP (XCAR (tail
))
4444 && GC_MARKERP (XCAR (XCAR (tail
)))
4445 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
4448 nextb
->undo_list
= tail
= XCDR (tail
);
4452 XSETCDR (prev
, tail
);
4463 nextb
= nextb
->next
;
4467 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4473 extern void xg_mark_data ();
4480 /* Clear the mark bits that we set in certain root slots. */
4482 unmark_byte_stack ();
4483 VECTOR_UNMARK (&buffer_defaults
);
4484 VECTOR_UNMARK (&buffer_local_symbols
);
4486 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
4492 /* clear_marks (); */
4495 consing_since_gc
= 0;
4496 if (gc_cons_threshold
< 10000)
4497 gc_cons_threshold
= 10000;
4499 if (garbage_collection_messages
)
4501 if (message_p
|| minibuf_level
> 0)
4504 message1_nolog ("Garbage collecting...done");
4507 unbind_to (count
, Qnil
);
4509 total
[0] = Fcons (make_number (total_conses
),
4510 make_number (total_free_conses
));
4511 total
[1] = Fcons (make_number (total_symbols
),
4512 make_number (total_free_symbols
));
4513 total
[2] = Fcons (make_number (total_markers
),
4514 make_number (total_free_markers
));
4515 total
[3] = make_number (total_string_size
);
4516 total
[4] = make_number (total_vector_size
);
4517 total
[5] = Fcons (make_number (total_floats
),
4518 make_number (total_free_floats
));
4519 total
[6] = Fcons (make_number (total_intervals
),
4520 make_number (total_free_intervals
));
4521 total
[7] = Fcons (make_number (total_strings
),
4522 make_number (total_free_strings
));
4524 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4526 /* Compute average percentage of zombies. */
4529 for (i
= 0; i
< 7; ++i
)
4530 if (CONSP (total
[i
]))
4531 nlive
+= XFASTINT (XCAR (total
[i
]));
4533 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
4534 max_live
= max (nlive
, max_live
);
4535 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
4536 max_zombies
= max (nzombies
, max_zombies
);
4541 if (!NILP (Vpost_gc_hook
))
4543 int count
= inhibit_garbage_collection ();
4544 safe_run_hooks (Qpost_gc_hook
);
4545 unbind_to (count
, Qnil
);
4548 /* Accumulate statistics. */
4549 EMACS_GET_TIME (t2
);
4550 EMACS_SUB_TIME (t3
, t2
, t1
);
4551 if (FLOATP (Vgc_elapsed
))
4552 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
) +
4554 EMACS_USECS (t3
) * 1.0e-6);
4557 return Flist (sizeof total
/ sizeof *total
, total
);
4561 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
4562 only interesting objects referenced from glyphs are strings. */
4565 mark_glyph_matrix (matrix
)
4566 struct glyph_matrix
*matrix
;
4568 struct glyph_row
*row
= matrix
->rows
;
4569 struct glyph_row
*end
= row
+ matrix
->nrows
;
4571 for (; row
< end
; ++row
)
4575 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
4577 struct glyph
*glyph
= row
->glyphs
[area
];
4578 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
4580 for (; glyph
< end_glyph
; ++glyph
)
4581 if (GC_STRINGP (glyph
->object
)
4582 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
4583 mark_object (glyph
->object
);
4589 /* Mark Lisp faces in the face cache C. */
4593 struct face_cache
*c
;
4598 for (i
= 0; i
< c
->used
; ++i
)
4600 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
4604 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
4605 mark_object (face
->lface
[j
]);
4612 #ifdef HAVE_WINDOW_SYSTEM
4614 /* Mark Lisp objects in image IMG. */
4620 mark_object (img
->spec
);
4622 if (!NILP (img
->data
.lisp_val
))
4623 mark_object (img
->data
.lisp_val
);
4627 /* Mark Lisp objects in image cache of frame F. It's done this way so
4628 that we don't have to include xterm.h here. */
4631 mark_image_cache (f
)
4634 forall_images_in_image_cache (f
, mark_image
);
4637 #endif /* HAVE_X_WINDOWS */
4641 /* Mark reference to a Lisp_Object.
4642 If the object referred to has not been seen yet, recursively mark
4643 all the references contained in it. */
4645 #define LAST_MARKED_SIZE 500
4646 Lisp_Object last_marked
[LAST_MARKED_SIZE
];
4647 int last_marked_index
;
4649 /* For debugging--call abort when we cdr down this many
4650 links of a list, in mark_object. In debugging,
4651 the call to abort will hit a breakpoint.
4652 Normally this is zero and the check never goes off. */
4653 int mark_object_loop_halt
;
4659 register Lisp_Object obj
= arg
;
4660 #ifdef GC_CHECK_MARKED_OBJECTS
4668 if (PURE_POINTER_P (XPNTR (obj
)))
4671 last_marked
[last_marked_index
++] = obj
;
4672 if (last_marked_index
== LAST_MARKED_SIZE
)
4673 last_marked_index
= 0;
4675 /* Perform some sanity checks on the objects marked here. Abort if
4676 we encounter an object we know is bogus. This increases GC time
4677 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
4678 #ifdef GC_CHECK_MARKED_OBJECTS
4680 po
= (void *) XPNTR (obj
);
4682 /* Check that the object pointed to by PO is known to be a Lisp
4683 structure allocated from the heap. */
4684 #define CHECK_ALLOCATED() \
4686 m = mem_find (po); \
4691 /* Check that the object pointed to by PO is live, using predicate
4693 #define CHECK_LIVE(LIVEP) \
4695 if (!LIVEP (m, po)) \
4699 /* Check both of the above conditions. */
4700 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
4702 CHECK_ALLOCATED (); \
4703 CHECK_LIVE (LIVEP); \
4706 #else /* not GC_CHECK_MARKED_OBJECTS */
4708 #define CHECK_ALLOCATED() (void) 0
4709 #define CHECK_LIVE(LIVEP) (void) 0
4710 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
4712 #endif /* not GC_CHECK_MARKED_OBJECTS */
4714 switch (SWITCH_ENUM_CAST (XGCTYPE (obj
)))
4718 register struct Lisp_String
*ptr
= XSTRING (obj
);
4719 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
4720 MARK_INTERVAL_TREE (ptr
->intervals
);
4722 #ifdef GC_CHECK_STRING_BYTES
4723 /* Check that the string size recorded in the string is the
4724 same as the one recorded in the sdata structure. */
4725 CHECK_STRING_BYTES (ptr
);
4726 #endif /* GC_CHECK_STRING_BYTES */
4730 case Lisp_Vectorlike
:
4731 #ifdef GC_CHECK_MARKED_OBJECTS
4733 if (m
== MEM_NIL
&& !GC_SUBRP (obj
)
4734 && po
!= &buffer_defaults
4735 && po
!= &buffer_local_symbols
)
4737 #endif /* GC_CHECK_MARKED_OBJECTS */
4739 if (GC_BUFFERP (obj
))
4741 if (!VECTOR_MARKED_P (XBUFFER (obj
)))
4743 #ifdef GC_CHECK_MARKED_OBJECTS
4744 if (po
!= &buffer_defaults
&& po
!= &buffer_local_symbols
)
4747 for (b
= all_buffers
; b
&& b
!= po
; b
= b
->next
)
4752 #endif /* GC_CHECK_MARKED_OBJECTS */
4756 else if (GC_SUBRP (obj
))
4758 else if (GC_COMPILEDP (obj
))
4759 /* We could treat this just like a vector, but it is better to
4760 save the COMPILED_CONSTANTS element for last and avoid
4763 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
4764 register EMACS_INT size
= ptr
->size
;
4767 if (VECTOR_MARKED_P (ptr
))
4768 break; /* Already marked */
4770 CHECK_LIVE (live_vector_p
);
4771 VECTOR_MARK (ptr
); /* Else mark it */
4772 size
&= PSEUDOVECTOR_SIZE_MASK
;
4773 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
4775 if (i
!= COMPILED_CONSTANTS
)
4776 mark_object (ptr
->contents
[i
]);
4778 obj
= ptr
->contents
[COMPILED_CONSTANTS
];
4781 else if (GC_FRAMEP (obj
))
4783 register struct frame
*ptr
= XFRAME (obj
);
4785 if (VECTOR_MARKED_P (ptr
)) break; /* Already marked */
4786 VECTOR_MARK (ptr
); /* Else mark it */
4788 CHECK_LIVE (live_vector_p
);
4789 mark_object (ptr
->name
);
4790 mark_object (ptr
->icon_name
);
4791 mark_object (ptr
->title
);
4792 mark_object (ptr
->focus_frame
);
4793 mark_object (ptr
->selected_window
);
4794 mark_object (ptr
->minibuffer_window
);
4795 mark_object (ptr
->param_alist
);
4796 mark_object (ptr
->scroll_bars
);
4797 mark_object (ptr
->condemned_scroll_bars
);
4798 mark_object (ptr
->menu_bar_items
);
4799 mark_object (ptr
->face_alist
);
4800 mark_object (ptr
->menu_bar_vector
);
4801 mark_object (ptr
->buffer_predicate
);
4802 mark_object (ptr
->buffer_list
);
4803 mark_object (ptr
->menu_bar_window
);
4804 mark_object (ptr
->tool_bar_window
);
4805 mark_face_cache (ptr
->face_cache
);
4806 #ifdef HAVE_WINDOW_SYSTEM
4807 mark_image_cache (ptr
);
4808 mark_object (ptr
->tool_bar_items
);
4809 mark_object (ptr
->desired_tool_bar_string
);
4810 mark_object (ptr
->current_tool_bar_string
);
4811 #endif /* HAVE_WINDOW_SYSTEM */
4813 else if (GC_BOOL_VECTOR_P (obj
))
4815 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
4817 if (VECTOR_MARKED_P (ptr
))
4818 break; /* Already marked */
4819 CHECK_LIVE (live_vector_p
);
4820 VECTOR_MARK (ptr
); /* Else mark it */
4822 else if (GC_WINDOWP (obj
))
4824 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
4825 struct window
*w
= XWINDOW (obj
);
4828 /* Stop if already marked. */
4829 if (VECTOR_MARKED_P (ptr
))
4833 CHECK_LIVE (live_vector_p
);
4836 /* There is no Lisp data above The member CURRENT_MATRIX in
4837 struct WINDOW. Stop marking when that slot is reached. */
4839 (char *) &ptr
->contents
[i
] < (char *) &w
->current_matrix
;
4841 mark_object (ptr
->contents
[i
]);
4843 /* Mark glyphs for leaf windows. Marking window matrices is
4844 sufficient because frame matrices use the same glyph
4846 if (NILP (w
->hchild
)
4848 && w
->current_matrix
)
4850 mark_glyph_matrix (w
->current_matrix
);
4851 mark_glyph_matrix (w
->desired_matrix
);
4854 else if (GC_HASH_TABLE_P (obj
))
4856 struct Lisp_Hash_Table
*h
= XHASH_TABLE (obj
);
4858 /* Stop if already marked. */
4859 if (VECTOR_MARKED_P (h
))
4863 CHECK_LIVE (live_vector_p
);
4866 /* Mark contents. */
4867 /* Do not mark next_free or next_weak.
4868 Being in the next_weak chain
4869 should not keep the hash table alive.
4870 No need to mark `count' since it is an integer. */
4871 mark_object (h
->test
);
4872 mark_object (h
->weak
);
4873 mark_object (h
->rehash_size
);
4874 mark_object (h
->rehash_threshold
);
4875 mark_object (h
->hash
);
4876 mark_object (h
->next
);
4877 mark_object (h
->index
);
4878 mark_object (h
->user_hash_function
);
4879 mark_object (h
->user_cmp_function
);
4881 /* If hash table is not weak, mark all keys and values.
4882 For weak tables, mark only the vector. */
4883 if (GC_NILP (h
->weak
))
4884 mark_object (h
->key_and_value
);
4886 VECTOR_MARK (XVECTOR (h
->key_and_value
));
4890 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
4891 register EMACS_INT size
= ptr
->size
;
4894 if (VECTOR_MARKED_P (ptr
)) break; /* Already marked */
4895 CHECK_LIVE (live_vector_p
);
4896 VECTOR_MARK (ptr
); /* Else mark it */
4897 if (size
& PSEUDOVECTOR_FLAG
)
4898 size
&= PSEUDOVECTOR_SIZE_MASK
;
4900 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
4901 mark_object (ptr
->contents
[i
]);
4907 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
4908 struct Lisp_Symbol
*ptrx
;
4910 if (ptr
->gcmarkbit
) break;
4911 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
4913 mark_object (ptr
->value
);
4914 mark_object (ptr
->function
);
4915 mark_object (ptr
->plist
);
4917 if (!PURE_POINTER_P (XSTRING (ptr
->xname
)))
4918 MARK_STRING (XSTRING (ptr
->xname
));
4919 MARK_INTERVAL_TREE (STRING_INTERVALS (ptr
->xname
));
4921 /* Note that we do not mark the obarray of the symbol.
4922 It is safe not to do so because nothing accesses that
4923 slot except to check whether it is nil. */
4927 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun */
4928 XSETSYMBOL (obj
, ptrx
);
4935 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
4936 if (XMARKER (obj
)->gcmarkbit
)
4938 XMARKER (obj
)->gcmarkbit
= 1;
4939 switch (XMISCTYPE (obj
))
4941 case Lisp_Misc_Buffer_Local_Value
:
4942 case Lisp_Misc_Some_Buffer_Local_Value
:
4944 register struct Lisp_Buffer_Local_Value
*ptr
4945 = XBUFFER_LOCAL_VALUE (obj
);
4946 /* If the cdr is nil, avoid recursion for the car. */
4947 if (EQ (ptr
->cdr
, Qnil
))
4949 obj
= ptr
->realvalue
;
4952 mark_object (ptr
->realvalue
);
4953 mark_object (ptr
->buffer
);
4954 mark_object (ptr
->frame
);
4959 case Lisp_Misc_Marker
:
4960 /* DO NOT mark thru the marker's chain.
4961 The buffer's markers chain does not preserve markers from gc;
4962 instead, markers are removed from the chain when freed by gc. */
4963 case Lisp_Misc_Intfwd
:
4964 case Lisp_Misc_Boolfwd
:
4965 case Lisp_Misc_Objfwd
:
4966 case Lisp_Misc_Buffer_Objfwd
:
4967 case Lisp_Misc_Kboard_Objfwd
:
4968 /* Don't bother with Lisp_Buffer_Objfwd,
4969 since all markable slots in current buffer marked anyway. */
4970 /* Don't need to do Lisp_Objfwd, since the places they point
4971 are protected with staticpro. */
4972 case Lisp_Misc_Save_Value
:
4975 case Lisp_Misc_Overlay
:
4977 struct Lisp_Overlay
*ptr
= XOVERLAY (obj
);
4978 mark_object (ptr
->start
);
4979 mark_object (ptr
->end
);
4980 mark_object (ptr
->plist
);
4983 XSETMISC (obj
, ptr
->next
);
4996 register struct Lisp_Cons
*ptr
= XCONS (obj
);
4997 if (CONS_MARKED_P (ptr
)) break;
4998 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
5000 /* If the cdr is nil, avoid recursion for the car. */
5001 if (EQ (ptr
->cdr
, Qnil
))
5007 mark_object (ptr
->car
);
5010 if (cdr_count
== mark_object_loop_halt
)
5016 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
5017 FLOAT_MARK (XFLOAT (obj
));
5028 #undef CHECK_ALLOCATED
5029 #undef CHECK_ALLOCATED_AND_LIVE
5032 /* Mark the pointers in a buffer structure. */
5038 register struct buffer
*buffer
= XBUFFER (buf
);
5039 register Lisp_Object
*ptr
, tmp
;
5040 Lisp_Object base_buffer
;
5042 VECTOR_MARK (buffer
);
5044 MARK_INTERVAL_TREE (BUF_INTERVALS (buffer
));
5046 if (CONSP (buffer
->undo_list
))
5049 tail
= buffer
->undo_list
;
5051 /* We mark the undo list specially because
5052 its pointers to markers should be weak. */
5054 while (CONSP (tail
))
5056 register struct Lisp_Cons
*ptr
= XCONS (tail
);
5058 if (CONS_MARKED_P (ptr
))
5061 if (GC_CONSP (ptr
->car
)
5062 && !CONS_MARKED_P (XCONS (ptr
->car
))
5063 && GC_MARKERP (XCAR (ptr
->car
)))
5065 CONS_MARK (XCONS (ptr
->car
));
5066 mark_object (XCDR (ptr
->car
));
5069 mark_object (ptr
->car
);
5071 if (CONSP (ptr
->cdr
))
5077 mark_object (XCDR (tail
));
5080 mark_object (buffer
->undo_list
);
5082 if (buffer
->overlays_before
)
5084 XSETMISC (tmp
, buffer
->overlays_before
);
5087 if (buffer
->overlays_after
)
5089 XSETMISC (tmp
, buffer
->overlays_after
);
5093 for (ptr
= &buffer
->name
;
5094 (char *)ptr
< (char *)buffer
+ sizeof (struct buffer
);
5098 /* If this is an indirect buffer, mark its base buffer. */
5099 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
5101 XSETBUFFER (base_buffer
, buffer
->base_buffer
);
5102 mark_buffer (base_buffer
);
5107 /* Value is non-zero if OBJ will survive the current GC because it's
5108 either marked or does not need to be marked to survive. */
5116 switch (XGCTYPE (obj
))
5123 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
5127 survives_p
= XMARKER (obj
)->gcmarkbit
;
5131 survives_p
= STRING_MARKED_P (XSTRING (obj
));
5134 case Lisp_Vectorlike
:
5135 survives_p
= GC_SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
5139 survives_p
= CONS_MARKED_P (XCONS (obj
));
5143 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
5150 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
5155 /* Sweep: find all structures not marked, and free them. */
5160 /* Remove or mark entries in weak hash tables.
5161 This must be done before any object is unmarked. */
5162 sweep_weak_hash_tables ();
5165 #ifdef GC_CHECK_STRING_BYTES
5166 if (!noninteractive
)
5167 check_string_bytes (1);
5170 /* Put all unmarked conses on free list */
5172 register struct cons_block
*cblk
;
5173 struct cons_block
**cprev
= &cons_block
;
5174 register int lim
= cons_block_index
;
5175 register int num_free
= 0, num_used
= 0;
5179 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
5183 for (i
= 0; i
< lim
; i
++)
5184 if (!CONS_MARKED_P (&cblk
->conses
[i
]))
5187 *(struct Lisp_Cons
**)&cblk
->conses
[i
].cdr
= cons_free_list
;
5188 cons_free_list
= &cblk
->conses
[i
];
5190 cons_free_list
->car
= Vdead
;
5196 CONS_UNMARK (&cblk
->conses
[i
]);
5198 lim
= CONS_BLOCK_SIZE
;
5199 /* If this block contains only free conses and we have already
5200 seen more than two blocks worth of free conses then deallocate
5202 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
5204 *cprev
= cblk
->next
;
5205 /* Unhook from the free list. */
5206 cons_free_list
= *(struct Lisp_Cons
**) &cblk
->conses
[0].cdr
;
5207 lisp_align_free (cblk
);
5212 num_free
+= this_free
;
5213 cprev
= &cblk
->next
;
5216 total_conses
= num_used
;
5217 total_free_conses
= num_free
;
5220 /* Put all unmarked floats on free list */
5222 register struct float_block
*fblk
;
5223 struct float_block
**fprev
= &float_block
;
5224 register int lim
= float_block_index
;
5225 register int num_free
= 0, num_used
= 0;
5227 float_free_list
= 0;
5229 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
5233 for (i
= 0; i
< lim
; i
++)
5234 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
5237 *(struct Lisp_Float
**)&fblk
->floats
[i
].data
= float_free_list
;
5238 float_free_list
= &fblk
->floats
[i
];
5243 FLOAT_UNMARK (&fblk
->floats
[i
]);
5245 lim
= FLOAT_BLOCK_SIZE
;
5246 /* If this block contains only free floats and we have already
5247 seen more than two blocks worth of free floats then deallocate
5249 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
5251 *fprev
= fblk
->next
;
5252 /* Unhook from the free list. */
5253 float_free_list
= *(struct Lisp_Float
**) &fblk
->floats
[0].data
;
5254 lisp_align_free (fblk
);
5259 num_free
+= this_free
;
5260 fprev
= &fblk
->next
;
5263 total_floats
= num_used
;
5264 total_free_floats
= num_free
;
5267 /* Put all unmarked intervals on free list */
5269 register struct interval_block
*iblk
;
5270 struct interval_block
**iprev
= &interval_block
;
5271 register int lim
= interval_block_index
;
5272 register int num_free
= 0, num_used
= 0;
5274 interval_free_list
= 0;
5276 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
5281 for (i
= 0; i
< lim
; i
++)
5283 if (!iblk
->intervals
[i
].gcmarkbit
)
5285 SET_INTERVAL_PARENT (&iblk
->intervals
[i
], interval_free_list
);
5286 interval_free_list
= &iblk
->intervals
[i
];
5292 iblk
->intervals
[i
].gcmarkbit
= 0;
5295 lim
= INTERVAL_BLOCK_SIZE
;
5296 /* If this block contains only free intervals and we have already
5297 seen more than two blocks worth of free intervals then
5298 deallocate this block. */
5299 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
5301 *iprev
= iblk
->next
;
5302 /* Unhook from the free list. */
5303 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
5305 n_interval_blocks
--;
5309 num_free
+= this_free
;
5310 iprev
= &iblk
->next
;
5313 total_intervals
= num_used
;
5314 total_free_intervals
= num_free
;
5317 /* Put all unmarked symbols on free list */
5319 register struct symbol_block
*sblk
;
5320 struct symbol_block
**sprev
= &symbol_block
;
5321 register int lim
= symbol_block_index
;
5322 register int num_free
= 0, num_used
= 0;
5324 symbol_free_list
= NULL
;
5326 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
5329 struct Lisp_Symbol
*sym
= sblk
->symbols
;
5330 struct Lisp_Symbol
*end
= sym
+ lim
;
5332 for (; sym
< end
; ++sym
)
5334 /* Check if the symbol was created during loadup. In such a case
5335 it might be pointed to by pure bytecode which we don't trace,
5336 so we conservatively assume that it is live. */
5337 int pure_p
= PURE_POINTER_P (XSTRING (sym
->xname
));
5339 if (!sym
->gcmarkbit
&& !pure_p
)
5341 *(struct Lisp_Symbol
**) &sym
->value
= symbol_free_list
;
5342 symbol_free_list
= sym
;
5344 symbol_free_list
->function
= Vdead
;
5352 UNMARK_STRING (XSTRING (sym
->xname
));
5357 lim
= SYMBOL_BLOCK_SIZE
;
5358 /* If this block contains only free symbols and we have already
5359 seen more than two blocks worth of free symbols then deallocate
5361 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
5363 *sprev
= sblk
->next
;
5364 /* Unhook from the free list. */
5365 symbol_free_list
= *(struct Lisp_Symbol
**)&sblk
->symbols
[0].value
;
5371 num_free
+= this_free
;
5372 sprev
= &sblk
->next
;
5375 total_symbols
= num_used
;
5376 total_free_symbols
= num_free
;
5379 /* Put all unmarked misc's on free list.
5380 For a marker, first unchain it from the buffer it points into. */
5382 register struct marker_block
*mblk
;
5383 struct marker_block
**mprev
= &marker_block
;
5384 register int lim
= marker_block_index
;
5385 register int num_free
= 0, num_used
= 0;
5387 marker_free_list
= 0;
5389 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
5394 for (i
= 0; i
< lim
; i
++)
5396 if (!mblk
->markers
[i
].u_marker
.gcmarkbit
)
5398 if (mblk
->markers
[i
].u_marker
.type
== Lisp_Misc_Marker
)
5399 unchain_marker (&mblk
->markers
[i
].u_marker
);
5400 /* Set the type of the freed object to Lisp_Misc_Free.
5401 We could leave the type alone, since nobody checks it,
5402 but this might catch bugs faster. */
5403 mblk
->markers
[i
].u_marker
.type
= Lisp_Misc_Free
;
5404 mblk
->markers
[i
].u_free
.chain
= marker_free_list
;
5405 marker_free_list
= &mblk
->markers
[i
];
5411 mblk
->markers
[i
].u_marker
.gcmarkbit
= 0;
5414 lim
= MARKER_BLOCK_SIZE
;
5415 /* If this block contains only free markers and we have already
5416 seen more than two blocks worth of free markers then deallocate
5418 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
5420 *mprev
= mblk
->next
;
5421 /* Unhook from the free list. */
5422 marker_free_list
= mblk
->markers
[0].u_free
.chain
;
5428 num_free
+= this_free
;
5429 mprev
= &mblk
->next
;
5433 total_markers
= num_used
;
5434 total_free_markers
= num_free
;
5437 /* Free all unmarked buffers */
5439 register struct buffer
*buffer
= all_buffers
, *prev
= 0, *next
;
5442 if (!VECTOR_MARKED_P (buffer
))
5445 prev
->next
= buffer
->next
;
5447 all_buffers
= buffer
->next
;
5448 next
= buffer
->next
;
5454 VECTOR_UNMARK (buffer
);
5455 UNMARK_BALANCE_INTERVALS (BUF_INTERVALS (buffer
));
5456 prev
= buffer
, buffer
= buffer
->next
;
5460 /* Free all unmarked vectors */
5462 register struct Lisp_Vector
*vector
= all_vectors
, *prev
= 0, *next
;
5463 total_vector_size
= 0;
5466 if (!VECTOR_MARKED_P (vector
))
5469 prev
->next
= vector
->next
;
5471 all_vectors
= vector
->next
;
5472 next
= vector
->next
;
5480 VECTOR_UNMARK (vector
);
5481 if (vector
->size
& PSEUDOVECTOR_FLAG
)
5482 total_vector_size
+= (PSEUDOVECTOR_SIZE_MASK
& vector
->size
);
5484 total_vector_size
+= vector
->size
;
5485 prev
= vector
, vector
= vector
->next
;
5489 #ifdef GC_CHECK_STRING_BYTES
5490 if (!noninteractive
)
5491 check_string_bytes (1);
5498 /* Debugging aids. */
5500 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
5501 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
5502 This may be helpful in debugging Emacs's memory usage.
5503 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
5508 XSETINT (end
, (EMACS_INT
) sbrk (0) / 1024);
5513 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
5514 doc
: /* Return a list of counters that measure how much consing there has been.
5515 Each of these counters increments for a certain kind of object.
5516 The counters wrap around from the largest positive integer to zero.
5517 Garbage collection does not decrease them.
5518 The elements of the value are as follows:
5519 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
5520 All are in units of 1 = one object consed
5521 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
5523 MISCS include overlays, markers, and some internal types.
5524 Frames, windows, buffers, and subprocesses count as vectors
5525 (but the contents of a buffer's text do not count here). */)
5528 Lisp_Object consed
[8];
5530 consed
[0] = make_number (min (MOST_POSITIVE_FIXNUM
, cons_cells_consed
));
5531 consed
[1] = make_number (min (MOST_POSITIVE_FIXNUM
, floats_consed
));
5532 consed
[2] = make_number (min (MOST_POSITIVE_FIXNUM
, vector_cells_consed
));
5533 consed
[3] = make_number (min (MOST_POSITIVE_FIXNUM
, symbols_consed
));
5534 consed
[4] = make_number (min (MOST_POSITIVE_FIXNUM
, string_chars_consed
));
5535 consed
[5] = make_number (min (MOST_POSITIVE_FIXNUM
, misc_objects_consed
));
5536 consed
[6] = make_number (min (MOST_POSITIVE_FIXNUM
, intervals_consed
));
5537 consed
[7] = make_number (min (MOST_POSITIVE_FIXNUM
, strings_consed
));
5539 return Flist (8, consed
);
5542 int suppress_checking
;
5544 die (msg
, file
, line
)
5549 fprintf (stderr
, "\r\nEmacs fatal error: %s:%d: %s\r\n",
5554 /* Initialization */
5559 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
5561 pure_size
= PURESIZE
;
5562 pure_bytes_used
= 0;
5563 pure_bytes_used_before_overflow
= 0;
5565 /* Initialize the list of free aligned blocks. */
5568 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
5570 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
5574 ignore_warnings
= 1;
5575 #ifdef DOUG_LEA_MALLOC
5576 mallopt (M_TRIM_THRESHOLD
, 128*1024); /* trim threshold */
5577 mallopt (M_MMAP_THRESHOLD
, 64*1024); /* mmap threshold */
5578 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* max. number of mmap'ed areas */
5588 malloc_hysteresis
= 32;
5590 malloc_hysteresis
= 0;
5593 spare_memory
= (char *) malloc (SPARE_MEMORY
);
5595 ignore_warnings
= 0;
5597 byte_stack_list
= 0;
5599 consing_since_gc
= 0;
5600 gc_cons_threshold
= 100000 * sizeof (Lisp_Object
);
5601 #ifdef VIRT_ADDR_VARIES
5602 malloc_sbrk_unused
= 1<<22; /* A large number */
5603 malloc_sbrk_used
= 100000; /* as reasonable as any number */
5604 #endif /* VIRT_ADDR_VARIES */
5611 byte_stack_list
= 0;
5613 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
5614 setjmp_tested_p
= longjmps_done
= 0;
5617 Vgc_elapsed
= make_float (0.0);
5624 DEFVAR_INT ("gc-cons-threshold", &gc_cons_threshold
,
5625 doc
: /* *Number of bytes of consing between garbage collections.
5626 Garbage collection can happen automatically once this many bytes have been
5627 allocated since the last garbage collection. All data types count.
5629 Garbage collection happens automatically only when `eval' is called.
5631 By binding this temporarily to a large number, you can effectively
5632 prevent garbage collection during a part of the program. */);
5634 DEFVAR_INT ("pure-bytes-used", &pure_bytes_used
,
5635 doc
: /* Number of bytes of sharable Lisp data allocated so far. */);
5637 DEFVAR_INT ("cons-cells-consed", &cons_cells_consed
,
5638 doc
: /* Number of cons cells that have been consed so far. */);
5640 DEFVAR_INT ("floats-consed", &floats_consed
,
5641 doc
: /* Number of floats that have been consed so far. */);
5643 DEFVAR_INT ("vector-cells-consed", &vector_cells_consed
,
5644 doc
: /* Number of vector cells that have been consed so far. */);
5646 DEFVAR_INT ("symbols-consed", &symbols_consed
,
5647 doc
: /* Number of symbols that have been consed so far. */);
5649 DEFVAR_INT ("string-chars-consed", &string_chars_consed
,
5650 doc
: /* Number of string characters that have been consed so far. */);
5652 DEFVAR_INT ("misc-objects-consed", &misc_objects_consed
,
5653 doc
: /* Number of miscellaneous objects that have been consed so far. */);
5655 DEFVAR_INT ("intervals-consed", &intervals_consed
,
5656 doc
: /* Number of intervals that have been consed so far. */);
5658 DEFVAR_INT ("strings-consed", &strings_consed
,
5659 doc
: /* Number of strings that have been consed so far. */);
5661 DEFVAR_LISP ("purify-flag", &Vpurify_flag
,
5662 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
5663 This means that certain objects should be allocated in shared (pure) space. */);
5665 DEFVAR_INT ("undo-limit", &undo_limit
,
5666 doc
: /* Keep no more undo information once it exceeds this size.
5667 This limit is applied when garbage collection happens.
5668 The size is counted as the number of bytes occupied,
5669 which includes both saved text and other data. */);
5672 DEFVAR_INT ("undo-strong-limit", &undo_strong_limit
,
5673 doc
: /* Don't keep more than this much size of undo information.
5674 A command which pushes past this size is itself forgotten.
5675 This limit is applied when garbage collection happens.
5676 The size is counted as the number of bytes occupied,
5677 which includes both saved text and other data. */);
5678 undo_strong_limit
= 30000;
5680 DEFVAR_BOOL ("garbage-collection-messages", &garbage_collection_messages
,
5681 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
5682 garbage_collection_messages
= 0;
5684 DEFVAR_LISP ("post-gc-hook", &Vpost_gc_hook
,
5685 doc
: /* Hook run after garbage collection has finished. */);
5686 Vpost_gc_hook
= Qnil
;
5687 Qpost_gc_hook
= intern ("post-gc-hook");
5688 staticpro (&Qpost_gc_hook
);
5690 DEFVAR_LISP ("memory-signal-data", &Vmemory_signal_data
,
5691 doc
: /* Precomputed `signal' argument for memory-full error. */);
5692 /* We build this in advance because if we wait until we need it, we might
5693 not be able to allocate the memory to hold it. */
5696 build_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"));
5698 DEFVAR_LISP ("memory-full", &Vmemory_full
,
5699 doc
: /* Non-nil means we are handling a memory-full error. */);
5700 Vmemory_full
= Qnil
;
5702 staticpro (&Qgc_cons_threshold
);
5703 Qgc_cons_threshold
= intern ("gc-cons-threshold");
5705 staticpro (&Qchar_table_extra_slots
);
5706 Qchar_table_extra_slots
= intern ("char-table-extra-slots");
5708 DEFVAR_LISP ("gc-elapsed", &Vgc_elapsed
,
5709 doc
: /* Accumulated time elapsed in garbage collections.
5710 The time is in seconds as a floating point value. */);
5711 DEFVAR_INT ("gcs-done", &gcs_done
,
5712 doc
: /* Accumulated number of garbage collections done. */);
5717 defsubr (&Smake_byte_code
);
5718 defsubr (&Smake_list
);
5719 defsubr (&Smake_vector
);
5720 defsubr (&Smake_string
);
5721 defsubr (&Smake_bool_vector
);
5722 defsubr (&Smake_symbol
);
5723 defsubr (&Smake_marker
);
5724 defsubr (&Spurecopy
);
5725 defsubr (&Sgarbage_collect
);
5726 defsubr (&Smemory_limit
);
5727 defsubr (&Smemory_use_counts
);
5729 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5730 defsubr (&Sgc_status
);
5734 /* arch-tag: 6695ca10-e3c5-4c2c-8bc3-ed26a7dda857
5735 (do not change this comment) */