1 /* Storage allocation and gc for GNU Emacs Lisp interpreter.
2 Copyright (C) 1985, 86, 88, 93, 94, 95, 97, 98, 1999, 2000, 2001, 2002, 2003
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 /* GC_MALLOC_CHECK defined means perform validity checks of malloc'd
35 memory. Can do this only if using gmalloc.c. */
37 #if defined SYSTEM_MALLOC || defined DOUG_LEA_MALLOC
38 #undef GC_MALLOC_CHECK
41 /* This file is part of the core Lisp implementation, and thus must
42 deal with the real data structures. If the Lisp implementation is
43 replaced, this file likely will not be used. */
45 #undef HIDE_LISP_IMPLEMENTATION
48 #include "intervals.h"
54 #include "blockinput.h"
55 #include "character.h"
56 #include "syssignal.h"
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
);
601 /* If the memory just allocated cannot be addressed thru a Lisp
602 object's pointer, and it needs to be,
603 that's equivalent to running out of memory. */
604 if (val
&& type
!= MEM_TYPE_NON_LISP
)
607 XSETCONS (tem
, (char *) val
+ nbytes
- 1);
608 if ((char *) XCONS (tem
) != (char *) val
+ nbytes
- 1)
610 lisp_malloc_loser
= val
;
616 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
617 if (val
&& type
!= MEM_TYPE_NON_LISP
)
618 mem_insert (val
, (char *) val
+ nbytes
, type
);
627 /* Free BLOCK. This must be called to free memory allocated with a
628 call to lisp_malloc. */
636 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
637 mem_delete (mem_find (block
));
642 /* Allocation of aligned blocks of memory to store Lisp data. */
643 /* The entry point is lisp_align_malloc which returns blocks of at most */
644 /* BLOCK_BYTES and guarantees they are aligned on a BLOCK_ALIGN boundary. */
647 /* BLOCK_ALIGN has to be a power of 2. */
648 #define BLOCK_ALIGN (1 << 10)
650 /* Padding to leave at the end of a malloc'd block. This is to give
651 malloc a chance to minimize the amount of memory wasted to alignment.
652 It should be tuned to the particular malloc library used.
653 On glibc-2.3.2, malloc never tries to align, so a padding of 0 is best.
654 posix_memalign on the other hand would ideally prefer a value of 4
655 because otherwise, there's 1020 bytes wasted between each ablocks.
656 But testing shows that those 1020 will most of the time be efficiently
657 used by malloc to place other objects, so a value of 0 is still preferable
658 unless you have a lot of cons&floats and virtually nothing else. */
659 #define BLOCK_PADDING 0
660 #define BLOCK_BYTES \
661 (BLOCK_ALIGN - sizeof (struct aligned_block *) - BLOCK_PADDING)
663 /* Internal data structures and constants. */
665 #define ABLOCKS_SIZE 16
667 /* An aligned block of memory. */
672 char payload
[BLOCK_BYTES
];
673 struct ablock
*next_free
;
675 /* `abase' is the aligned base of the ablocks. */
676 /* It is overloaded to hold the virtual `busy' field that counts
677 the number of used ablock in the parent ablocks.
678 The first ablock has the `busy' field, the others have the `abase'
679 field. To tell the difference, we assume that pointers will have
680 integer values larger than 2 * ABLOCKS_SIZE. The lowest bit of `busy'
681 is used to tell whether the real base of the parent ablocks is `abase'
682 (if not, the word before the first ablock holds a pointer to the
684 struct ablocks
*abase
;
685 /* The padding of all but the last ablock is unused. The padding of
686 the last ablock in an ablocks is not allocated. */
688 char padding
[BLOCK_PADDING
];
692 /* A bunch of consecutive aligned blocks. */
695 struct ablock blocks
[ABLOCKS_SIZE
];
698 /* Size of the block requested from malloc or memalign. */
699 #define ABLOCKS_BYTES (sizeof (struct ablocks) - BLOCK_PADDING)
701 #define ABLOCK_ABASE(block) \
702 (((unsigned long) (block)->abase) <= (1 + 2 * ABLOCKS_SIZE) \
703 ? (struct ablocks *)(block) \
706 /* Virtual `busy' field. */
707 #define ABLOCKS_BUSY(abase) ((abase)->blocks[0].abase)
709 /* Pointer to the (not necessarily aligned) malloc block. */
710 #ifdef HAVE_POSIX_MEMALIGN
711 #define ABLOCKS_BASE(abase) (abase)
713 #define ABLOCKS_BASE(abase) \
714 (1 & (int) ABLOCKS_BUSY (abase) ? abase : ((void**)abase)[-1])
717 /* The list of free ablock. */
718 static struct ablock
*free_ablock
;
720 /* Allocate an aligned block of nbytes.
721 Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be
722 smaller or equal to BLOCK_BYTES. */
723 static POINTER_TYPE
*
724 lisp_align_malloc (nbytes
, type
)
729 struct ablocks
*abase
;
731 eassert (nbytes
<= BLOCK_BYTES
);
735 #ifdef GC_MALLOC_CHECK
736 allocated_mem_type
= type
;
743 #ifdef DOUG_LEA_MALLOC
744 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
745 because mapped region contents are not preserved in
747 mallopt (M_MMAP_MAX
, 0);
750 #ifdef HAVE_POSIX_MEMALIGN
752 int err
= posix_memalign (&base
, BLOCK_ALIGN
, ABLOCKS_BYTES
);
753 abase
= err
? (base
= NULL
) : base
;
756 base
= malloc (ABLOCKS_BYTES
);
757 abase
= ALIGN (base
, BLOCK_ALIGN
);
760 aligned
= (base
== abase
);
762 ((void**)abase
)[-1] = base
;
764 #ifdef DOUG_LEA_MALLOC
765 /* Back to a reasonable maximum of mmap'ed areas. */
766 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
769 /* If the memory just allocated cannot be addressed thru a Lisp
770 object's pointer, and it needs to be, that's equivalent to
771 running out of memory. */
772 if (type
!= MEM_TYPE_NON_LISP
)
775 char *end
= (char *) base
+ ABLOCKS_BYTES
- 1;
777 if ((char *) XCONS (tem
) != end
)
779 lisp_malloc_loser
= base
;
786 /* Initialize the blocks and put them on the free list.
787 Is `base' was not properly aligned, we can't use the last block. */
788 for (i
= 0; i
< (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1); i
++)
790 abase
->blocks
[i
].abase
= abase
;
791 abase
->blocks
[i
].x
.next_free
= free_ablock
;
792 free_ablock
= &abase
->blocks
[i
];
794 ABLOCKS_BUSY (abase
) = (struct ablocks
*) aligned
;
796 eassert (0 == ((EMACS_UINT
)abase
) % BLOCK_ALIGN
);
797 eassert (ABLOCK_ABASE (&abase
->blocks
[3]) == abase
); /* 3 is arbitrary */
798 eassert (ABLOCK_ABASE (&abase
->blocks
[0]) == abase
);
799 eassert (ABLOCKS_BASE (abase
) == base
);
800 eassert (aligned
== (int)ABLOCKS_BUSY (abase
));
803 abase
= ABLOCK_ABASE (free_ablock
);
804 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (2 + (int) ABLOCKS_BUSY (abase
));
806 free_ablock
= free_ablock
->x
.next_free
;
808 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
809 if (val
&& type
!= MEM_TYPE_NON_LISP
)
810 mem_insert (val
, (char *) val
+ nbytes
, type
);
817 eassert (0 == ((EMACS_UINT
)val
) % BLOCK_ALIGN
);
822 lisp_align_free (block
)
825 struct ablock
*ablock
= block
;
826 struct ablocks
*abase
= ABLOCK_ABASE (ablock
);
829 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
830 mem_delete (mem_find (block
));
832 /* Put on free list. */
833 ablock
->x
.next_free
= free_ablock
;
834 free_ablock
= ablock
;
835 /* Update busy count. */
836 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (-2 + (int) ABLOCKS_BUSY (abase
));
838 if (2 > (int) ABLOCKS_BUSY (abase
))
839 { /* All the blocks are free. */
840 int i
= 0, aligned
= (int) ABLOCKS_BUSY (abase
);
841 struct ablock
**tem
= &free_ablock
;
842 struct ablock
*atop
= &abase
->blocks
[aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1];
846 if (*tem
>= (struct ablock
*) abase
&& *tem
< atop
)
849 *tem
= (*tem
)->x
.next_free
;
852 tem
= &(*tem
)->x
.next_free
;
854 eassert ((aligned
& 1) == aligned
);
855 eassert (i
== (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1));
856 free (ABLOCKS_BASE (abase
));
861 /* Return a new buffer structure allocated from the heap with
862 a call to lisp_malloc. */
868 = (struct buffer
*) lisp_malloc (sizeof (struct buffer
),
874 /* Arranging to disable input signals while we're in malloc.
876 This only works with GNU malloc. To help out systems which can't
877 use GNU malloc, all the calls to malloc, realloc, and free
878 elsewhere in the code should be inside a BLOCK_INPUT/UNBLOCK_INPUT
879 pairs; unfortunately, we have no idea what C library functions
880 might call malloc, so we can't really protect them unless you're
881 using GNU malloc. Fortunately, most of the major operating systems
882 can use GNU malloc. */
884 #ifndef SYSTEM_MALLOC
885 #ifndef DOUG_LEA_MALLOC
886 extern void * (*__malloc_hook
) P_ ((size_t));
887 extern void * (*__realloc_hook
) P_ ((void *, size_t));
888 extern void (*__free_hook
) P_ ((void *));
889 /* Else declared in malloc.h, perhaps with an extra arg. */
890 #endif /* DOUG_LEA_MALLOC */
891 static void * (*old_malloc_hook
) ();
892 static void * (*old_realloc_hook
) ();
893 static void (*old_free_hook
) ();
895 /* This function is used as the hook for free to call. */
898 emacs_blocked_free (ptr
)
903 #ifdef GC_MALLOC_CHECK
909 if (m
== MEM_NIL
|| m
->start
!= ptr
)
912 "Freeing `%p' which wasn't allocated with malloc\n", ptr
);
917 /* fprintf (stderr, "free %p...%p (%p)\n", m->start, m->end, ptr); */
921 #endif /* GC_MALLOC_CHECK */
923 __free_hook
= old_free_hook
;
926 /* If we released our reserve (due to running out of memory),
927 and we have a fair amount free once again,
928 try to set aside another reserve in case we run out once more. */
929 if (spare_memory
== 0
930 /* Verify there is enough space that even with the malloc
931 hysteresis this call won't run out again.
932 The code here is correct as long as SPARE_MEMORY
933 is substantially larger than the block size malloc uses. */
934 && (bytes_used_when_full
935 > BYTES_USED
+ max (malloc_hysteresis
, 4) * SPARE_MEMORY
))
936 spare_memory
= (char *) malloc ((size_t) SPARE_MEMORY
);
938 __free_hook
= emacs_blocked_free
;
943 /* If we released our reserve (due to running out of memory),
944 and we have a fair amount free once again,
945 try to set aside another reserve in case we run out once more.
947 This is called when a relocatable block is freed in ralloc.c. */
950 refill_memory_reserve ()
952 if (spare_memory
== 0)
953 spare_memory
= (char *) malloc ((size_t) SPARE_MEMORY
);
957 /* This function is the malloc hook that Emacs uses. */
960 emacs_blocked_malloc (size
)
966 __malloc_hook
= old_malloc_hook
;
967 #ifdef DOUG_LEA_MALLOC
968 mallopt (M_TOP_PAD
, malloc_hysteresis
* 4096);
970 __malloc_extra_blocks
= malloc_hysteresis
;
973 value
= (void *) malloc (size
);
975 #ifdef GC_MALLOC_CHECK
977 struct mem_node
*m
= mem_find (value
);
980 fprintf (stderr
, "Malloc returned %p which is already in use\n",
982 fprintf (stderr
, "Region in use is %p...%p, %u bytes, type %d\n",
983 m
->start
, m
->end
, (char *) m
->end
- (char *) m
->start
,
988 if (!dont_register_blocks
)
990 mem_insert (value
, (char *) value
+ max (1, size
), allocated_mem_type
);
991 allocated_mem_type
= MEM_TYPE_NON_LISP
;
994 #endif /* GC_MALLOC_CHECK */
996 __malloc_hook
= emacs_blocked_malloc
;
999 /* fprintf (stderr, "%p malloc\n", value); */
1004 /* This function is the realloc hook that Emacs uses. */
1007 emacs_blocked_realloc (ptr
, size
)
1014 __realloc_hook
= old_realloc_hook
;
1016 #ifdef GC_MALLOC_CHECK
1019 struct mem_node
*m
= mem_find (ptr
);
1020 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1023 "Realloc of %p which wasn't allocated with malloc\n",
1031 /* fprintf (stderr, "%p -> realloc\n", ptr); */
1033 /* Prevent malloc from registering blocks. */
1034 dont_register_blocks
= 1;
1035 #endif /* GC_MALLOC_CHECK */
1037 value
= (void *) realloc (ptr
, size
);
1039 #ifdef GC_MALLOC_CHECK
1040 dont_register_blocks
= 0;
1043 struct mem_node
*m
= mem_find (value
);
1046 fprintf (stderr
, "Realloc returns memory that is already in use\n");
1050 /* Can't handle zero size regions in the red-black tree. */
1051 mem_insert (value
, (char *) value
+ max (size
, 1), MEM_TYPE_NON_LISP
);
1054 /* fprintf (stderr, "%p <- realloc\n", value); */
1055 #endif /* GC_MALLOC_CHECK */
1057 __realloc_hook
= emacs_blocked_realloc
;
1064 /* Called from main to set up malloc to use our hooks. */
1067 uninterrupt_malloc ()
1069 if (__free_hook
!= emacs_blocked_free
)
1070 old_free_hook
= __free_hook
;
1071 __free_hook
= emacs_blocked_free
;
1073 if (__malloc_hook
!= emacs_blocked_malloc
)
1074 old_malloc_hook
= __malloc_hook
;
1075 __malloc_hook
= emacs_blocked_malloc
;
1077 if (__realloc_hook
!= emacs_blocked_realloc
)
1078 old_realloc_hook
= __realloc_hook
;
1079 __realloc_hook
= emacs_blocked_realloc
;
1082 #endif /* not SYSTEM_MALLOC */
1086 /***********************************************************************
1088 ***********************************************************************/
1090 /* Number of intervals allocated in an interval_block structure.
1091 The 1020 is 1024 minus malloc overhead. */
1093 #define INTERVAL_BLOCK_SIZE \
1094 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
1096 /* Intervals are allocated in chunks in form of an interval_block
1099 struct interval_block
1101 struct interval_block
*next
;
1102 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
1105 /* Current interval block. Its `next' pointer points to older
1108 struct interval_block
*interval_block
;
1110 /* Index in interval_block above of the next unused interval
1113 static int interval_block_index
;
1115 /* Number of free and live intervals. */
1117 static int total_free_intervals
, total_intervals
;
1119 /* List of free intervals. */
1121 INTERVAL interval_free_list
;
1123 /* Total number of interval blocks now in use. */
1125 int n_interval_blocks
;
1128 /* Initialize interval allocation. */
1134 = (struct interval_block
*) lisp_malloc (sizeof *interval_block
,
1136 interval_block
->next
= 0;
1137 bzero ((char *) interval_block
->intervals
, sizeof interval_block
->intervals
);
1138 interval_block_index
= 0;
1139 interval_free_list
= 0;
1140 n_interval_blocks
= 1;
1144 /* Return a new interval. */
1151 if (interval_free_list
)
1153 val
= interval_free_list
;
1154 interval_free_list
= INTERVAL_PARENT (interval_free_list
);
1158 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
1160 register struct interval_block
*newi
;
1162 newi
= (struct interval_block
*) lisp_malloc (sizeof *newi
,
1165 newi
->next
= interval_block
;
1166 interval_block
= newi
;
1167 interval_block_index
= 0;
1168 n_interval_blocks
++;
1170 val
= &interval_block
->intervals
[interval_block_index
++];
1172 consing_since_gc
+= sizeof (struct interval
);
1174 RESET_INTERVAL (val
);
1180 /* Mark Lisp objects in interval I. */
1183 mark_interval (i
, dummy
)
1184 register INTERVAL i
;
1187 eassert (!i
->gcmarkbit
); /* Intervals are never shared. */
1189 mark_object (i
->plist
);
1193 /* Mark the interval tree rooted in TREE. Don't call this directly;
1194 use the macro MARK_INTERVAL_TREE instead. */
1197 mark_interval_tree (tree
)
1198 register INTERVAL tree
;
1200 /* No need to test if this tree has been marked already; this
1201 function is always called through the MARK_INTERVAL_TREE macro,
1202 which takes care of that. */
1204 traverse_intervals_noorder (tree
, mark_interval
, Qnil
);
1208 /* Mark the interval tree rooted in I. */
1210 #define MARK_INTERVAL_TREE(i) \
1212 if (!NULL_INTERVAL_P (i) && !i->gcmarkbit) \
1213 mark_interval_tree (i); \
1217 #define UNMARK_BALANCE_INTERVALS(i) \
1219 if (! NULL_INTERVAL_P (i)) \
1220 (i) = balance_intervals (i); \
1224 /* Number support. If NO_UNION_TYPE isn't in effect, we
1225 can't create number objects in macros. */
1233 obj
.s
.type
= Lisp_Int
;
1238 /***********************************************************************
1240 ***********************************************************************/
1242 /* Lisp_Strings are allocated in string_block structures. When a new
1243 string_block is allocated, all the Lisp_Strings it contains are
1244 added to a free-list string_free_list. When a new Lisp_String is
1245 needed, it is taken from that list. During the sweep phase of GC,
1246 string_blocks that are entirely free are freed, except two which
1249 String data is allocated from sblock structures. Strings larger
1250 than LARGE_STRING_BYTES, get their own sblock, data for smaller
1251 strings is sub-allocated out of sblocks of size SBLOCK_SIZE.
1253 Sblocks consist internally of sdata structures, one for each
1254 Lisp_String. The sdata structure points to the Lisp_String it
1255 belongs to. The Lisp_String points back to the `u.data' member of
1256 its sdata structure.
1258 When a Lisp_String is freed during GC, it is put back on
1259 string_free_list, and its `data' member and its sdata's `string'
1260 pointer is set to null. The size of the string is recorded in the
1261 `u.nbytes' member of the sdata. So, sdata structures that are no
1262 longer used, can be easily recognized, and it's easy to compact the
1263 sblocks of small strings which we do in compact_small_strings. */
1265 /* Size in bytes of an sblock structure used for small strings. This
1266 is 8192 minus malloc overhead. */
1268 #define SBLOCK_SIZE 8188
1270 /* Strings larger than this are considered large strings. String data
1271 for large strings is allocated from individual sblocks. */
1273 #define LARGE_STRING_BYTES 1024
1275 /* Structure describing string memory sub-allocated from an sblock.
1276 This is where the contents of Lisp strings are stored. */
1280 /* Back-pointer to the string this sdata belongs to. If null, this
1281 structure is free, and the NBYTES member of the union below
1282 contains the string's byte size (the same value that STRING_BYTES
1283 would return if STRING were non-null). If non-null, STRING_BYTES
1284 (STRING) is the size of the data, and DATA contains the string's
1286 struct Lisp_String
*string
;
1288 #ifdef GC_CHECK_STRING_BYTES
1291 unsigned char data
[1];
1293 #define SDATA_NBYTES(S) (S)->nbytes
1294 #define SDATA_DATA(S) (S)->data
1296 #else /* not GC_CHECK_STRING_BYTES */
1300 /* When STRING in non-null. */
1301 unsigned char data
[1];
1303 /* When STRING is null. */
1308 #define SDATA_NBYTES(S) (S)->u.nbytes
1309 #define SDATA_DATA(S) (S)->u.data
1311 #endif /* not GC_CHECK_STRING_BYTES */
1315 /* Structure describing a block of memory which is sub-allocated to
1316 obtain string data memory for strings. Blocks for small strings
1317 are of fixed size SBLOCK_SIZE. Blocks for large strings are made
1318 as large as needed. */
1323 struct sblock
*next
;
1325 /* Pointer to the next free sdata block. This points past the end
1326 of the sblock if there isn't any space left in this block. */
1327 struct sdata
*next_free
;
1329 /* Start of data. */
1330 struct sdata first_data
;
1333 /* Number of Lisp strings in a string_block structure. The 1020 is
1334 1024 minus malloc overhead. */
1336 #define STRING_BLOCK_SIZE \
1337 ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String))
1339 /* Structure describing a block from which Lisp_String structures
1344 struct string_block
*next
;
1345 struct Lisp_String strings
[STRING_BLOCK_SIZE
];
1348 /* Head and tail of the list of sblock structures holding Lisp string
1349 data. We always allocate from current_sblock. The NEXT pointers
1350 in the sblock structures go from oldest_sblock to current_sblock. */
1352 static struct sblock
*oldest_sblock
, *current_sblock
;
1354 /* List of sblocks for large strings. */
1356 static struct sblock
*large_sblocks
;
1358 /* List of string_block structures, and how many there are. */
1360 static struct string_block
*string_blocks
;
1361 static int n_string_blocks
;
1363 /* Free-list of Lisp_Strings. */
1365 static struct Lisp_String
*string_free_list
;
1367 /* Number of live and free Lisp_Strings. */
1369 static int total_strings
, total_free_strings
;
1371 /* Number of bytes used by live strings. */
1373 static int total_string_size
;
1375 /* Given a pointer to a Lisp_String S which is on the free-list
1376 string_free_list, return a pointer to its successor in the
1379 #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S))
1381 /* Return a pointer to the sdata structure belonging to Lisp string S.
1382 S must be live, i.e. S->data must not be null. S->data is actually
1383 a pointer to the `u.data' member of its sdata structure; the
1384 structure starts at a constant offset in front of that. */
1386 #ifdef GC_CHECK_STRING_BYTES
1388 #define SDATA_OF_STRING(S) \
1389 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *) \
1390 - sizeof (EMACS_INT)))
1392 #else /* not GC_CHECK_STRING_BYTES */
1394 #define SDATA_OF_STRING(S) \
1395 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *)))
1397 #endif /* not GC_CHECK_STRING_BYTES */
1399 /* Value is the size of an sdata structure large enough to hold NBYTES
1400 bytes of string data. The value returned includes a terminating
1401 NUL byte, the size of the sdata structure, and padding. */
1403 #ifdef GC_CHECK_STRING_BYTES
1405 #define SDATA_SIZE(NBYTES) \
1406 ((sizeof (struct Lisp_String *) \
1408 + sizeof (EMACS_INT) \
1409 + sizeof (EMACS_INT) - 1) \
1410 & ~(sizeof (EMACS_INT) - 1))
1412 #else /* not GC_CHECK_STRING_BYTES */
1414 #define SDATA_SIZE(NBYTES) \
1415 ((sizeof (struct Lisp_String *) \
1417 + sizeof (EMACS_INT) - 1) \
1418 & ~(sizeof (EMACS_INT) - 1))
1420 #endif /* not GC_CHECK_STRING_BYTES */
1422 /* Initialize string allocation. Called from init_alloc_once. */
1427 total_strings
= total_free_strings
= total_string_size
= 0;
1428 oldest_sblock
= current_sblock
= large_sblocks
= NULL
;
1429 string_blocks
= NULL
;
1430 n_string_blocks
= 0;
1431 string_free_list
= NULL
;
1435 #ifdef GC_CHECK_STRING_BYTES
1437 static int check_string_bytes_count
;
1439 void check_string_bytes
P_ ((int));
1440 void check_sblock
P_ ((struct sblock
*));
1442 #define CHECK_STRING_BYTES(S) STRING_BYTES (S)
1445 /* Like GC_STRING_BYTES, but with debugging check. */
1449 struct Lisp_String
*s
;
1451 int nbytes
= (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1452 if (!PURE_POINTER_P (s
)
1454 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1459 /* Check validity of Lisp strings' string_bytes member in B. */
1465 struct sdata
*from
, *end
, *from_end
;
1469 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1471 /* Compute the next FROM here because copying below may
1472 overwrite data we need to compute it. */
1475 /* Check that the string size recorded in the string is the
1476 same as the one recorded in the sdata structure. */
1478 CHECK_STRING_BYTES (from
->string
);
1481 nbytes
= GC_STRING_BYTES (from
->string
);
1483 nbytes
= SDATA_NBYTES (from
);
1485 nbytes
= SDATA_SIZE (nbytes
);
1486 from_end
= (struct sdata
*) ((char *) from
+ nbytes
);
1491 /* Check validity of Lisp strings' string_bytes member. ALL_P
1492 non-zero means check all strings, otherwise check only most
1493 recently allocated strings. Used for hunting a bug. */
1496 check_string_bytes (all_p
)
1503 for (b
= large_sblocks
; b
; b
= b
->next
)
1505 struct Lisp_String
*s
= b
->first_data
.string
;
1507 CHECK_STRING_BYTES (s
);
1510 for (b
= oldest_sblock
; b
; b
= b
->next
)
1514 check_sblock (current_sblock
);
1517 #endif /* GC_CHECK_STRING_BYTES */
1520 /* Return a new Lisp_String. */
1522 static struct Lisp_String
*
1525 struct Lisp_String
*s
;
1527 /* If the free-list is empty, allocate a new string_block, and
1528 add all the Lisp_Strings in it to the free-list. */
1529 if (string_free_list
== NULL
)
1531 struct string_block
*b
;
1534 b
= (struct string_block
*) lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1535 bzero (b
, sizeof *b
);
1536 b
->next
= string_blocks
;
1540 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1543 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1544 string_free_list
= s
;
1547 total_free_strings
+= STRING_BLOCK_SIZE
;
1550 /* Pop a Lisp_String off the free-list. */
1551 s
= string_free_list
;
1552 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1554 /* Probably not strictly necessary, but play it safe. */
1555 bzero (s
, sizeof *s
);
1557 --total_free_strings
;
1560 consing_since_gc
+= sizeof *s
;
1562 #ifdef GC_CHECK_STRING_BYTES
1569 if (++check_string_bytes_count
== 200)
1571 check_string_bytes_count
= 0;
1572 check_string_bytes (1);
1575 check_string_bytes (0);
1577 #endif /* GC_CHECK_STRING_BYTES */
1583 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1584 plus a NUL byte at the end. Allocate an sdata structure for S, and
1585 set S->data to its `u.data' member. Store a NUL byte at the end of
1586 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1587 S->data if it was initially non-null. */
1590 allocate_string_data (s
, nchars
, nbytes
)
1591 struct Lisp_String
*s
;
1594 struct sdata
*data
, *old_data
;
1596 int needed
, old_nbytes
;
1598 /* Determine the number of bytes needed to store NBYTES bytes
1600 needed
= SDATA_SIZE (nbytes
);
1602 if (nbytes
> LARGE_STRING_BYTES
)
1604 size_t size
= sizeof *b
- sizeof (struct sdata
) + needed
;
1606 #ifdef DOUG_LEA_MALLOC
1607 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1608 because mapped region contents are not preserved in
1611 In case you think of allowing it in a dumped Emacs at the
1612 cost of not being able to re-dump, there's another reason:
1613 mmap'ed data typically have an address towards the top of the
1614 address space, which won't fit into an EMACS_INT (at least on
1615 32-bit systems with the current tagging scheme). --fx */
1616 mallopt (M_MMAP_MAX
, 0);
1619 b
= (struct sblock
*) lisp_malloc (size
, MEM_TYPE_NON_LISP
);
1621 #ifdef DOUG_LEA_MALLOC
1622 /* Back to a reasonable maximum of mmap'ed areas. */
1623 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1626 b
->next_free
= &b
->first_data
;
1627 b
->first_data
.string
= NULL
;
1628 b
->next
= large_sblocks
;
1631 else if (current_sblock
== NULL
1632 || (((char *) current_sblock
+ SBLOCK_SIZE
1633 - (char *) current_sblock
->next_free
)
1636 /* Not enough room in the current sblock. */
1637 b
= (struct sblock
*) lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
1638 b
->next_free
= &b
->first_data
;
1639 b
->first_data
.string
= NULL
;
1643 current_sblock
->next
= b
;
1651 old_data
= s
->data
? SDATA_OF_STRING (s
) : NULL
;
1652 old_nbytes
= GC_STRING_BYTES (s
);
1654 data
= b
->next_free
;
1656 s
->data
= SDATA_DATA (data
);
1657 #ifdef GC_CHECK_STRING_BYTES
1658 SDATA_NBYTES (data
) = nbytes
;
1661 s
->size_byte
= nbytes
;
1662 s
->data
[nbytes
] = '\0';
1663 b
->next_free
= (struct sdata
*) ((char *) data
+ needed
);
1665 /* If S had already data assigned, mark that as free by setting its
1666 string back-pointer to null, and recording the size of the data
1670 SDATA_NBYTES (old_data
) = old_nbytes
;
1671 old_data
->string
= NULL
;
1674 consing_since_gc
+= needed
;
1678 /* Sweep and compact strings. */
1683 struct string_block
*b
, *next
;
1684 struct string_block
*live_blocks
= NULL
;
1686 string_free_list
= NULL
;
1687 total_strings
= total_free_strings
= 0;
1688 total_string_size
= 0;
1690 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
1691 for (b
= string_blocks
; b
; b
= next
)
1694 struct Lisp_String
*free_list_before
= string_free_list
;
1698 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
1700 struct Lisp_String
*s
= b
->strings
+ i
;
1704 /* String was not on free-list before. */
1705 if (STRING_MARKED_P (s
))
1707 /* String is live; unmark it and its intervals. */
1710 if (!NULL_INTERVAL_P (s
->intervals
))
1711 UNMARK_BALANCE_INTERVALS (s
->intervals
);
1714 total_string_size
+= STRING_BYTES (s
);
1718 /* String is dead. Put it on the free-list. */
1719 struct sdata
*data
= SDATA_OF_STRING (s
);
1721 /* Save the size of S in its sdata so that we know
1722 how large that is. Reset the sdata's string
1723 back-pointer so that we know it's free. */
1724 #ifdef GC_CHECK_STRING_BYTES
1725 if (GC_STRING_BYTES (s
) != SDATA_NBYTES (data
))
1728 data
->u
.nbytes
= GC_STRING_BYTES (s
);
1730 data
->string
= NULL
;
1732 /* Reset the strings's `data' member so that we
1736 /* Put the string on the free-list. */
1737 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1738 string_free_list
= s
;
1744 /* S was on the free-list before. Put it there again. */
1745 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1746 string_free_list
= s
;
1751 /* Free blocks that contain free Lisp_Strings only, except
1752 the first two of them. */
1753 if (nfree
== STRING_BLOCK_SIZE
1754 && total_free_strings
> STRING_BLOCK_SIZE
)
1758 string_free_list
= free_list_before
;
1762 total_free_strings
+= nfree
;
1763 b
->next
= live_blocks
;
1768 string_blocks
= live_blocks
;
1769 free_large_strings ();
1770 compact_small_strings ();
1774 /* Free dead large strings. */
1777 free_large_strings ()
1779 struct sblock
*b
, *next
;
1780 struct sblock
*live_blocks
= NULL
;
1782 for (b
= large_sblocks
; b
; b
= next
)
1786 if (b
->first_data
.string
== NULL
)
1790 b
->next
= live_blocks
;
1795 large_sblocks
= live_blocks
;
1799 /* Compact data of small strings. Free sblocks that don't contain
1800 data of live strings after compaction. */
1803 compact_small_strings ()
1805 struct sblock
*b
, *tb
, *next
;
1806 struct sdata
*from
, *to
, *end
, *tb_end
;
1807 struct sdata
*to_end
, *from_end
;
1809 /* TB is the sblock we copy to, TO is the sdata within TB we copy
1810 to, and TB_END is the end of TB. */
1812 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
1813 to
= &tb
->first_data
;
1815 /* Step through the blocks from the oldest to the youngest. We
1816 expect that old blocks will stabilize over time, so that less
1817 copying will happen this way. */
1818 for (b
= oldest_sblock
; b
; b
= b
->next
)
1821 xassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
1823 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1825 /* Compute the next FROM here because copying below may
1826 overwrite data we need to compute it. */
1829 #ifdef GC_CHECK_STRING_BYTES
1830 /* Check that the string size recorded in the string is the
1831 same as the one recorded in the sdata structure. */
1833 && GC_STRING_BYTES (from
->string
) != SDATA_NBYTES (from
))
1835 #endif /* GC_CHECK_STRING_BYTES */
1838 nbytes
= GC_STRING_BYTES (from
->string
);
1840 nbytes
= SDATA_NBYTES (from
);
1842 nbytes
= SDATA_SIZE (nbytes
);
1843 from_end
= (struct sdata
*) ((char *) from
+ nbytes
);
1845 /* FROM->string non-null means it's alive. Copy its data. */
1848 /* If TB is full, proceed with the next sblock. */
1849 to_end
= (struct sdata
*) ((char *) to
+ nbytes
);
1850 if (to_end
> tb_end
)
1854 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
1855 to
= &tb
->first_data
;
1856 to_end
= (struct sdata
*) ((char *) to
+ nbytes
);
1859 /* Copy, and update the string's `data' pointer. */
1862 xassert (tb
!= b
|| to
<= from
);
1863 safe_bcopy ((char *) from
, (char *) to
, nbytes
);
1864 to
->string
->data
= SDATA_DATA (to
);
1867 /* Advance past the sdata we copied to. */
1873 /* The rest of the sblocks following TB don't contain live data, so
1874 we can free them. */
1875 for (b
= tb
->next
; b
; b
= next
)
1883 current_sblock
= tb
;
1887 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
1888 doc
: /* Return a newly created string of length LENGTH, with each element being INIT.
1889 Both LENGTH and INIT must be numbers. */)
1891 Lisp_Object length
, init
;
1893 register Lisp_Object val
;
1894 register unsigned char *p
, *end
;
1897 CHECK_NATNUM (length
);
1898 CHECK_NUMBER (init
);
1901 if (ASCII_CHAR_P (c
))
1903 nbytes
= XINT (length
);
1904 val
= make_uninit_string (nbytes
);
1906 end
= p
+ SCHARS (val
);
1912 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
1913 int len
= CHAR_STRING (c
, str
);
1915 nbytes
= len
* XINT (length
);
1916 val
= make_uninit_multibyte_string (XINT (length
), nbytes
);
1921 bcopy (str
, p
, len
);
1931 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
1932 doc
: /* Return a new bool-vector of length LENGTH, using INIT for as each element.
1933 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
1935 Lisp_Object length
, init
;
1937 register Lisp_Object val
;
1938 struct Lisp_Bool_Vector
*p
;
1940 int length_in_chars
, length_in_elts
, bits_per_value
;
1942 CHECK_NATNUM (length
);
1944 bits_per_value
= sizeof (EMACS_INT
) * BITS_PER_CHAR
;
1946 length_in_elts
= (XFASTINT (length
) + bits_per_value
- 1) / bits_per_value
;
1947 length_in_chars
= ((XFASTINT (length
) + BITS_PER_CHAR
- 1) / BITS_PER_CHAR
);
1949 /* We must allocate one more elements than LENGTH_IN_ELTS for the
1950 slot `size' of the struct Lisp_Bool_Vector. */
1951 val
= Fmake_vector (make_number (length_in_elts
+ 1), Qnil
);
1952 p
= XBOOL_VECTOR (val
);
1954 /* Get rid of any bits that would cause confusion. */
1956 XSETBOOL_VECTOR (val
, p
);
1957 p
->size
= XFASTINT (length
);
1959 real_init
= (NILP (init
) ? 0 : -1);
1960 for (i
= 0; i
< length_in_chars
; i
++)
1961 p
->data
[i
] = real_init
;
1963 /* Clear the extraneous bits in the last byte. */
1964 if (XINT (length
) != length_in_chars
* BITS_PER_CHAR
)
1965 XBOOL_VECTOR (val
)->data
[length_in_chars
- 1]
1966 &= (1 << (XINT (length
) % BITS_PER_CHAR
)) - 1;
1972 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
1973 of characters from the contents. This string may be unibyte or
1974 multibyte, depending on the contents. */
1977 make_string (contents
, nbytes
)
1978 const char *contents
;
1981 register Lisp_Object val
;
1982 int nchars
, multibyte_nbytes
;
1984 parse_str_as_multibyte (contents
, nbytes
, &nchars
, &multibyte_nbytes
);
1985 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
1986 /* CONTENTS contains no multibyte sequences or contains an invalid
1987 multibyte sequence. We must make unibyte string. */
1988 val
= make_unibyte_string (contents
, nbytes
);
1990 val
= make_multibyte_string (contents
, nchars
, nbytes
);
1995 /* Make an unibyte string from LENGTH bytes at CONTENTS. */
1998 make_unibyte_string (contents
, length
)
1999 const char *contents
;
2002 register Lisp_Object val
;
2003 val
= make_uninit_string (length
);
2004 bcopy (contents
, SDATA (val
), length
);
2005 STRING_SET_UNIBYTE (val
);
2010 /* Make a multibyte string from NCHARS characters occupying NBYTES
2011 bytes at CONTENTS. */
2014 make_multibyte_string (contents
, nchars
, nbytes
)
2015 const char *contents
;
2018 register Lisp_Object val
;
2019 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2020 bcopy (contents
, SDATA (val
), nbytes
);
2025 /* Make a string from NCHARS characters occupying NBYTES bytes at
2026 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2029 make_string_from_bytes (contents
, nchars
, nbytes
)
2030 const char *contents
;
2033 register Lisp_Object val
;
2034 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2035 bcopy (contents
, SDATA (val
), nbytes
);
2036 if (SBYTES (val
) == SCHARS (val
))
2037 STRING_SET_UNIBYTE (val
);
2042 /* Make a string from NCHARS characters occupying NBYTES bytes at
2043 CONTENTS. The argument MULTIBYTE controls whether to label the
2044 string as multibyte. If NCHARS is negative, it counts the number of
2045 characters by itself. */
2048 make_specified_string (contents
, nchars
, nbytes
, multibyte
)
2049 const char *contents
;
2053 register Lisp_Object val
;
2058 nchars
= multibyte_chars_in_text (contents
, nbytes
);
2062 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2063 bcopy (contents
, SDATA (val
), nbytes
);
2065 STRING_SET_UNIBYTE (val
);
2070 /* Make a string from the data at STR, treating it as multibyte if the
2077 return make_string (str
, strlen (str
));
2081 /* Return an unibyte Lisp_String set up to hold LENGTH characters
2082 occupying LENGTH bytes. */
2085 make_uninit_string (length
)
2089 val
= make_uninit_multibyte_string (length
, length
);
2090 STRING_SET_UNIBYTE (val
);
2095 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2096 which occupy NBYTES bytes. */
2099 make_uninit_multibyte_string (nchars
, nbytes
)
2103 struct Lisp_String
*s
;
2108 s
= allocate_string ();
2109 allocate_string_data (s
, nchars
, nbytes
);
2110 XSETSTRING (string
, s
);
2111 string_chars_consed
+= nbytes
;
2117 /***********************************************************************
2119 ***********************************************************************/
2121 /* We store float cells inside of float_blocks, allocating a new
2122 float_block with malloc whenever necessary. Float cells reclaimed
2123 by GC are put on a free list to be reallocated before allocating
2124 any new float cells from the latest float_block. */
2126 #define FLOAT_BLOCK_SIZE \
2127 (((BLOCK_BYTES - sizeof (struct float_block *)) * CHAR_BIT) \
2128 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2130 #define GETMARKBIT(block,n) \
2131 (((block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2132 >> ((n) % (sizeof(int) * CHAR_BIT))) \
2135 #define SETMARKBIT(block,n) \
2136 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2137 |= 1 << ((n) % (sizeof(int) * CHAR_BIT))
2139 #define UNSETMARKBIT(block,n) \
2140 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2141 &= ~(1 << ((n) % (sizeof(int) * CHAR_BIT)))
2143 #define FLOAT_BLOCK(fptr) \
2144 ((struct float_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2146 #define FLOAT_INDEX(fptr) \
2147 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2151 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2152 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2153 int gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2154 struct float_block
*next
;
2157 #define FLOAT_MARKED_P(fptr) \
2158 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2160 #define FLOAT_MARK(fptr) \
2161 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2163 #define FLOAT_UNMARK(fptr) \
2164 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2166 /* Current float_block. */
2168 struct float_block
*float_block
;
2170 /* Index of first unused Lisp_Float in the current float_block. */
2172 int float_block_index
;
2174 /* Total number of float blocks now in use. */
2178 /* Free-list of Lisp_Floats. */
2180 struct Lisp_Float
*float_free_list
;
2183 /* Initialize float allocation. */
2189 float_block_index
= FLOAT_BLOCK_SIZE
; /* Force alloc of new float_block. */
2190 float_free_list
= 0;
2195 /* Explicitly free a float cell by putting it on the free-list. */
2199 struct Lisp_Float
*ptr
;
2201 *(struct Lisp_Float
**)&ptr
->data
= float_free_list
;
2202 float_free_list
= ptr
;
2206 /* Return a new float object with value FLOAT_VALUE. */
2209 make_float (float_value
)
2212 register Lisp_Object val
;
2214 if (float_free_list
)
2216 /* We use the data field for chaining the free list
2217 so that we won't use the same field that has the mark bit. */
2218 XSETFLOAT (val
, float_free_list
);
2219 float_free_list
= *(struct Lisp_Float
**)&float_free_list
->data
;
2223 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2225 register struct float_block
*new;
2227 new = (struct float_block
*) lisp_align_malloc (sizeof *new,
2229 new->next
= float_block
;
2231 float_block_index
= 0;
2234 XSETFLOAT (val
, &float_block
->floats
[float_block_index
++]);
2237 XFLOAT_DATA (val
) = float_value
;
2238 FLOAT_UNMARK (XFLOAT (val
));
2239 consing_since_gc
+= sizeof (struct Lisp_Float
);
2246 /***********************************************************************
2248 ***********************************************************************/
2250 /* We store cons cells inside of cons_blocks, allocating a new
2251 cons_block with malloc whenever necessary. Cons cells reclaimed by
2252 GC are put on a free list to be reallocated before allocating
2253 any new cons cells from the latest cons_block. */
2255 #define CONS_BLOCK_SIZE \
2256 (((BLOCK_BYTES - sizeof (struct cons_block *)) * CHAR_BIT) \
2257 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2259 #define CONS_BLOCK(fptr) \
2260 ((struct cons_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2262 #define CONS_INDEX(fptr) \
2263 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2267 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2268 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2269 int gcmarkbits
[1 + CONS_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2270 struct cons_block
*next
;
2273 #define CONS_MARKED_P(fptr) \
2274 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2276 #define CONS_MARK(fptr) \
2277 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2279 #define CONS_UNMARK(fptr) \
2280 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2282 /* Current cons_block. */
2284 struct cons_block
*cons_block
;
2286 /* Index of first unused Lisp_Cons in the current block. */
2288 int cons_block_index
;
2290 /* Free-list of Lisp_Cons structures. */
2292 struct Lisp_Cons
*cons_free_list
;
2294 /* Total number of cons blocks now in use. */
2299 /* Initialize cons allocation. */
2305 cons_block_index
= CONS_BLOCK_SIZE
; /* Force alloc of new cons_block. */
2311 /* Explicitly free a cons cell by putting it on the free-list. */
2315 struct Lisp_Cons
*ptr
;
2317 *(struct Lisp_Cons
**)&ptr
->cdr
= cons_free_list
;
2321 cons_free_list
= ptr
;
2325 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
2326 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2328 Lisp_Object car
, cdr
;
2330 register Lisp_Object val
;
2334 /* We use the cdr for chaining the free list
2335 so that we won't use the same field that has the mark bit. */
2336 XSETCONS (val
, cons_free_list
);
2337 cons_free_list
= *(struct Lisp_Cons
**)&cons_free_list
->cdr
;
2341 if (cons_block_index
== CONS_BLOCK_SIZE
)
2343 register struct cons_block
*new;
2344 new = (struct cons_block
*) lisp_align_malloc (sizeof *new,
2346 new->next
= cons_block
;
2348 cons_block_index
= 0;
2351 XSETCONS (val
, &cons_block
->conses
[cons_block_index
++]);
2356 CONS_UNMARK (XCONS (val
));
2357 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2358 cons_cells_consed
++;
2363 /* Make a list of 2, 3, 4 or 5 specified objects. */
2367 Lisp_Object arg1
, arg2
;
2369 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2374 list3 (arg1
, arg2
, arg3
)
2375 Lisp_Object arg1
, arg2
, arg3
;
2377 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2382 list4 (arg1
, arg2
, arg3
, arg4
)
2383 Lisp_Object arg1
, arg2
, arg3
, arg4
;
2385 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2390 list5 (arg1
, arg2
, arg3
, arg4
, arg5
)
2391 Lisp_Object arg1
, arg2
, arg3
, arg4
, arg5
;
2393 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2394 Fcons (arg5
, Qnil
)))));
2398 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
2399 doc
: /* Return a newly created list with specified arguments as elements.
2400 Any number of arguments, even zero arguments, are allowed.
2401 usage: (list &rest OBJECTS) */)
2404 register Lisp_Object
*args
;
2406 register Lisp_Object val
;
2412 val
= Fcons (args
[nargs
], val
);
2418 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2419 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2421 register Lisp_Object length
, init
;
2423 register Lisp_Object val
;
2426 CHECK_NATNUM (length
);
2427 size
= XFASTINT (length
);
2432 val
= Fcons (init
, val
);
2437 val
= Fcons (init
, val
);
2442 val
= Fcons (init
, val
);
2447 val
= Fcons (init
, val
);
2452 val
= Fcons (init
, val
);
2467 /***********************************************************************
2469 ***********************************************************************/
2471 /* Singly-linked list of all vectors. */
2473 struct Lisp_Vector
*all_vectors
;
2475 /* Total number of vector-like objects now in use. */
2480 /* Value is a pointer to a newly allocated Lisp_Vector structure
2481 with room for LEN Lisp_Objects. */
2483 static struct Lisp_Vector
*
2484 allocate_vectorlike (len
, type
)
2488 struct Lisp_Vector
*p
;
2491 #ifdef DOUG_LEA_MALLOC
2492 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
2493 because mapped region contents are not preserved in
2495 mallopt (M_MMAP_MAX
, 0);
2498 nbytes
= sizeof *p
+ (len
- 1) * sizeof p
->contents
[0];
2499 p
= (struct Lisp_Vector
*) lisp_malloc (nbytes
, type
);
2501 #ifdef DOUG_LEA_MALLOC
2502 /* Back to a reasonable maximum of mmap'ed areas. */
2503 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2506 consing_since_gc
+= nbytes
;
2507 vector_cells_consed
+= len
;
2509 p
->next
= all_vectors
;
2516 /* Allocate a vector with NSLOTS slots. */
2518 struct Lisp_Vector
*
2519 allocate_vector (nslots
)
2522 struct Lisp_Vector
*v
= allocate_vectorlike (nslots
, MEM_TYPE_VECTOR
);
2528 /* Allocate other vector-like structures. */
2530 struct Lisp_Hash_Table
*
2531 allocate_hash_table ()
2533 EMACS_INT len
= VECSIZE (struct Lisp_Hash_Table
);
2534 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_HASH_TABLE
);
2538 for (i
= 0; i
< len
; ++i
)
2539 v
->contents
[i
] = Qnil
;
2541 return (struct Lisp_Hash_Table
*) v
;
2548 EMACS_INT len
= VECSIZE (struct window
);
2549 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_WINDOW
);
2552 for (i
= 0; i
< len
; ++i
)
2553 v
->contents
[i
] = Qnil
;
2556 return (struct window
*) v
;
2563 EMACS_INT len
= VECSIZE (struct frame
);
2564 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_FRAME
);
2567 for (i
= 0; i
< len
; ++i
)
2568 v
->contents
[i
] = make_number (0);
2570 return (struct frame
*) v
;
2574 struct Lisp_Process
*
2577 EMACS_INT len
= VECSIZE (struct Lisp_Process
);
2578 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_PROCESS
);
2581 for (i
= 0; i
< len
; ++i
)
2582 v
->contents
[i
] = Qnil
;
2585 return (struct Lisp_Process
*) v
;
2589 struct Lisp_Vector
*
2590 allocate_other_vector (len
)
2593 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_VECTOR
);
2596 for (i
= 0; i
< len
; ++i
)
2597 v
->contents
[i
] = Qnil
;
2604 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
2605 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
2606 See also the function `vector'. */)
2608 register Lisp_Object length
, init
;
2611 register EMACS_INT sizei
;
2613 register struct Lisp_Vector
*p
;
2615 CHECK_NATNUM (length
);
2616 sizei
= XFASTINT (length
);
2618 p
= allocate_vector (sizei
);
2619 for (index
= 0; index
< sizei
; index
++)
2620 p
->contents
[index
] = init
;
2622 XSETVECTOR (vector
, p
);
2627 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
2628 doc
: /* Return a newly created vector with specified arguments as elements.
2629 Any number of arguments, even zero arguments, are allowed.
2630 usage: (vector &rest OBJECTS) */)
2635 register Lisp_Object len
, val
;
2637 register struct Lisp_Vector
*p
;
2639 XSETFASTINT (len
, nargs
);
2640 val
= Fmake_vector (len
, Qnil
);
2642 for (index
= 0; index
< nargs
; index
++)
2643 p
->contents
[index
] = args
[index
];
2648 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
2649 doc
: /* Create a byte-code object with specified arguments as elements.
2650 The arguments should be the arglist, bytecode-string, constant vector,
2651 stack size, (optional) doc string, and (optional) interactive spec.
2652 The first four arguments are required; at most six have any
2654 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
2659 register Lisp_Object len
, val
;
2661 register struct Lisp_Vector
*p
;
2663 XSETFASTINT (len
, nargs
);
2664 if (!NILP (Vpurify_flag
))
2665 val
= make_pure_vector ((EMACS_INT
) nargs
);
2667 val
= Fmake_vector (len
, Qnil
);
2669 if (STRINGP (args
[1]) && STRING_MULTIBYTE (args
[1]))
2670 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
2671 earlier because they produced a raw 8-bit string for byte-code
2672 and now such a byte-code string is loaded as multibyte while
2673 raw 8-bit characters converted to multibyte form. Thus, now we
2674 must convert them back to the original unibyte form. */
2675 args
[1] = Fstring_as_unibyte (args
[1]);
2678 for (index
= 0; index
< nargs
; index
++)
2680 if (!NILP (Vpurify_flag
))
2681 args
[index
] = Fpurecopy (args
[index
]);
2682 p
->contents
[index
] = args
[index
];
2684 XSETCOMPILED (val
, p
);
2690 /***********************************************************************
2692 ***********************************************************************/
2694 /* Each symbol_block is just under 1020 bytes long, since malloc
2695 really allocates in units of powers of two and uses 4 bytes for its
2698 #define SYMBOL_BLOCK_SIZE \
2699 ((1020 - sizeof (struct symbol_block *)) / sizeof (struct Lisp_Symbol))
2703 struct symbol_block
*next
;
2704 struct Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
2707 /* Current symbol block and index of first unused Lisp_Symbol
2710 struct symbol_block
*symbol_block
;
2711 int symbol_block_index
;
2713 /* List of free symbols. */
2715 struct Lisp_Symbol
*symbol_free_list
;
2717 /* Total number of symbol blocks now in use. */
2719 int n_symbol_blocks
;
2722 /* Initialize symbol allocation. */
2727 symbol_block
= (struct symbol_block
*) lisp_malloc (sizeof *symbol_block
,
2729 symbol_block
->next
= 0;
2730 bzero ((char *) symbol_block
->symbols
, sizeof symbol_block
->symbols
);
2731 symbol_block_index
= 0;
2732 symbol_free_list
= 0;
2733 n_symbol_blocks
= 1;
2737 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
2738 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
2739 Its value and function definition are void, and its property list is nil. */)
2743 register Lisp_Object val
;
2744 register struct Lisp_Symbol
*p
;
2746 CHECK_STRING (name
);
2748 if (symbol_free_list
)
2750 XSETSYMBOL (val
, symbol_free_list
);
2751 symbol_free_list
= *(struct Lisp_Symbol
**)&symbol_free_list
->value
;
2755 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
2757 struct symbol_block
*new;
2758 new = (struct symbol_block
*) lisp_malloc (sizeof *new,
2760 new->next
= symbol_block
;
2762 symbol_block_index
= 0;
2765 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
++]);
2771 p
->value
= Qunbound
;
2772 p
->function
= Qunbound
;
2775 p
->interned
= SYMBOL_UNINTERNED
;
2777 p
->indirect_variable
= 0;
2778 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
2785 /***********************************************************************
2786 Marker (Misc) Allocation
2787 ***********************************************************************/
2789 /* Allocation of markers and other objects that share that structure.
2790 Works like allocation of conses. */
2792 #define MARKER_BLOCK_SIZE \
2793 ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc))
2797 struct marker_block
*next
;
2798 union Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
2801 struct marker_block
*marker_block
;
2802 int marker_block_index
;
2804 union Lisp_Misc
*marker_free_list
;
2806 /* Total number of marker blocks now in use. */
2808 int n_marker_blocks
;
2813 marker_block
= (struct marker_block
*) lisp_malloc (sizeof *marker_block
,
2815 marker_block
->next
= 0;
2816 bzero ((char *) marker_block
->markers
, sizeof marker_block
->markers
);
2817 marker_block_index
= 0;
2818 marker_free_list
= 0;
2819 n_marker_blocks
= 1;
2822 /* Return a newly allocated Lisp_Misc object, with no substructure. */
2829 if (marker_free_list
)
2831 XSETMISC (val
, marker_free_list
);
2832 marker_free_list
= marker_free_list
->u_free
.chain
;
2836 if (marker_block_index
== MARKER_BLOCK_SIZE
)
2838 struct marker_block
*new;
2839 new = (struct marker_block
*) lisp_malloc (sizeof *new,
2841 new->next
= marker_block
;
2843 marker_block_index
= 0;
2846 XSETMISC (val
, &marker_block
->markers
[marker_block_index
++]);
2849 consing_since_gc
+= sizeof (union Lisp_Misc
);
2850 misc_objects_consed
++;
2851 XMARKER (val
)->gcmarkbit
= 0;
2855 /* Return a Lisp_Misc_Save_Value object containing POINTER and
2856 INTEGER. This is used to package C values to call record_unwind_protect.
2857 The unwind function can get the C values back using XSAVE_VALUE. */
2860 make_save_value (pointer
, integer
)
2864 register Lisp_Object val
;
2865 register struct Lisp_Save_Value
*p
;
2867 val
= allocate_misc ();
2868 XMISCTYPE (val
) = Lisp_Misc_Save_Value
;
2869 p
= XSAVE_VALUE (val
);
2870 p
->pointer
= pointer
;
2871 p
->integer
= integer
;
2875 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
2876 doc
: /* Return a newly allocated marker which does not point at any place. */)
2879 register Lisp_Object val
;
2880 register struct Lisp_Marker
*p
;
2882 val
= allocate_misc ();
2883 XMISCTYPE (val
) = Lisp_Misc_Marker
;
2889 p
->insertion_type
= 0;
2893 /* Put MARKER back on the free list after using it temporarily. */
2896 free_marker (marker
)
2899 unchain_marker (XMARKER (marker
));
2901 XMISC (marker
)->u_marker
.type
= Lisp_Misc_Free
;
2902 XMISC (marker
)->u_free
.chain
= marker_free_list
;
2903 marker_free_list
= XMISC (marker
);
2905 total_free_markers
++;
2909 /* Return a newly created vector or string with specified arguments as
2910 elements. If all the arguments are characters that can fit
2911 in a string of events, make a string; otherwise, make a vector.
2913 Any number of arguments, even zero arguments, are allowed. */
2916 make_event_array (nargs
, args
)
2922 for (i
= 0; i
< nargs
; i
++)
2923 /* The things that fit in a string
2924 are characters that are in 0...127,
2925 after discarding the meta bit and all the bits above it. */
2926 if (!INTEGERP (args
[i
])
2927 || (XUINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
2928 return Fvector (nargs
, args
);
2930 /* Since the loop exited, we know that all the things in it are
2931 characters, so we can make a string. */
2935 result
= Fmake_string (make_number (nargs
), make_number (0));
2936 for (i
= 0; i
< nargs
; i
++)
2938 SSET (result
, i
, XINT (args
[i
]));
2939 /* Move the meta bit to the right place for a string char. */
2940 if (XINT (args
[i
]) & CHAR_META
)
2941 SSET (result
, i
, SREF (result
, i
) | 0x80);
2950 /************************************************************************
2952 ************************************************************************/
2954 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
2956 /* Conservative C stack marking requires a method to identify possibly
2957 live Lisp objects given a pointer value. We do this by keeping
2958 track of blocks of Lisp data that are allocated in a red-black tree
2959 (see also the comment of mem_node which is the type of nodes in
2960 that tree). Function lisp_malloc adds information for an allocated
2961 block to the red-black tree with calls to mem_insert, and function
2962 lisp_free removes it with mem_delete. Functions live_string_p etc
2963 call mem_find to lookup information about a given pointer in the
2964 tree, and use that to determine if the pointer points to a Lisp
2967 /* Initialize this part of alloc.c. */
2972 mem_z
.left
= mem_z
.right
= MEM_NIL
;
2973 mem_z
.parent
= NULL
;
2974 mem_z
.color
= MEM_BLACK
;
2975 mem_z
.start
= mem_z
.end
= NULL
;
2980 /* Value is a pointer to the mem_node containing START. Value is
2981 MEM_NIL if there is no node in the tree containing START. */
2983 static INLINE
struct mem_node
*
2989 if (start
< min_heap_address
|| start
> max_heap_address
)
2992 /* Make the search always successful to speed up the loop below. */
2993 mem_z
.start
= start
;
2994 mem_z
.end
= (char *) start
+ 1;
2997 while (start
< p
->start
|| start
>= p
->end
)
2998 p
= start
< p
->start
? p
->left
: p
->right
;
3003 /* Insert a new node into the tree for a block of memory with start
3004 address START, end address END, and type TYPE. Value is a
3005 pointer to the node that was inserted. */
3007 static struct mem_node
*
3008 mem_insert (start
, end
, type
)
3012 struct mem_node
*c
, *parent
, *x
;
3014 if (start
< min_heap_address
)
3015 min_heap_address
= start
;
3016 if (end
> max_heap_address
)
3017 max_heap_address
= end
;
3019 /* See where in the tree a node for START belongs. In this
3020 particular application, it shouldn't happen that a node is already
3021 present. For debugging purposes, let's check that. */
3025 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3027 while (c
!= MEM_NIL
)
3029 if (start
>= c
->start
&& start
< c
->end
)
3032 c
= start
< c
->start
? c
->left
: c
->right
;
3035 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3037 while (c
!= MEM_NIL
)
3040 c
= start
< c
->start
? c
->left
: c
->right
;
3043 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3045 /* Create a new node. */
3046 #ifdef GC_MALLOC_CHECK
3047 x
= (struct mem_node
*) _malloc_internal (sizeof *x
);
3051 x
= (struct mem_node
*) xmalloc (sizeof *x
);
3057 x
->left
= x
->right
= MEM_NIL
;
3060 /* Insert it as child of PARENT or install it as root. */
3063 if (start
< parent
->start
)
3071 /* Re-establish red-black tree properties. */
3072 mem_insert_fixup (x
);
3078 /* Re-establish the red-black properties of the tree, and thereby
3079 balance the tree, after node X has been inserted; X is always red. */
3082 mem_insert_fixup (x
)
3085 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3087 /* X is red and its parent is red. This is a violation of
3088 red-black tree property #3. */
3090 if (x
->parent
== x
->parent
->parent
->left
)
3092 /* We're on the left side of our grandparent, and Y is our
3094 struct mem_node
*y
= x
->parent
->parent
->right
;
3096 if (y
->color
== MEM_RED
)
3098 /* Uncle and parent are red but should be black because
3099 X is red. Change the colors accordingly and proceed
3100 with the grandparent. */
3101 x
->parent
->color
= MEM_BLACK
;
3102 y
->color
= MEM_BLACK
;
3103 x
->parent
->parent
->color
= MEM_RED
;
3104 x
= x
->parent
->parent
;
3108 /* Parent and uncle have different colors; parent is
3109 red, uncle is black. */
3110 if (x
== x
->parent
->right
)
3113 mem_rotate_left (x
);
3116 x
->parent
->color
= MEM_BLACK
;
3117 x
->parent
->parent
->color
= MEM_RED
;
3118 mem_rotate_right (x
->parent
->parent
);
3123 /* This is the symmetrical case of above. */
3124 struct mem_node
*y
= x
->parent
->parent
->left
;
3126 if (y
->color
== MEM_RED
)
3128 x
->parent
->color
= MEM_BLACK
;
3129 y
->color
= MEM_BLACK
;
3130 x
->parent
->parent
->color
= MEM_RED
;
3131 x
= x
->parent
->parent
;
3135 if (x
== x
->parent
->left
)
3138 mem_rotate_right (x
);
3141 x
->parent
->color
= MEM_BLACK
;
3142 x
->parent
->parent
->color
= MEM_RED
;
3143 mem_rotate_left (x
->parent
->parent
);
3148 /* The root may have been changed to red due to the algorithm. Set
3149 it to black so that property #5 is satisfied. */
3150 mem_root
->color
= MEM_BLACK
;
3166 /* Turn y's left sub-tree into x's right sub-tree. */
3169 if (y
->left
!= MEM_NIL
)
3170 y
->left
->parent
= x
;
3172 /* Y's parent was x's parent. */
3174 y
->parent
= x
->parent
;
3176 /* Get the parent to point to y instead of x. */
3179 if (x
== x
->parent
->left
)
3180 x
->parent
->left
= y
;
3182 x
->parent
->right
= y
;
3187 /* Put x on y's left. */
3201 mem_rotate_right (x
)
3204 struct mem_node
*y
= x
->left
;
3207 if (y
->right
!= MEM_NIL
)
3208 y
->right
->parent
= x
;
3211 y
->parent
= x
->parent
;
3214 if (x
== x
->parent
->right
)
3215 x
->parent
->right
= y
;
3217 x
->parent
->left
= y
;
3228 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
3234 struct mem_node
*x
, *y
;
3236 if (!z
|| z
== MEM_NIL
)
3239 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
3244 while (y
->left
!= MEM_NIL
)
3248 if (y
->left
!= MEM_NIL
)
3253 x
->parent
= y
->parent
;
3256 if (y
== y
->parent
->left
)
3257 y
->parent
->left
= x
;
3259 y
->parent
->right
= x
;
3266 z
->start
= y
->start
;
3271 if (y
->color
== MEM_BLACK
)
3272 mem_delete_fixup (x
);
3274 #ifdef GC_MALLOC_CHECK
3282 /* Re-establish the red-black properties of the tree, after a
3286 mem_delete_fixup (x
)
3289 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
3291 if (x
== x
->parent
->left
)
3293 struct mem_node
*w
= x
->parent
->right
;
3295 if (w
->color
== MEM_RED
)
3297 w
->color
= MEM_BLACK
;
3298 x
->parent
->color
= MEM_RED
;
3299 mem_rotate_left (x
->parent
);
3300 w
= x
->parent
->right
;
3303 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
3310 if (w
->right
->color
== MEM_BLACK
)
3312 w
->left
->color
= MEM_BLACK
;
3314 mem_rotate_right (w
);
3315 w
= x
->parent
->right
;
3317 w
->color
= x
->parent
->color
;
3318 x
->parent
->color
= MEM_BLACK
;
3319 w
->right
->color
= MEM_BLACK
;
3320 mem_rotate_left (x
->parent
);
3326 struct mem_node
*w
= x
->parent
->left
;
3328 if (w
->color
== MEM_RED
)
3330 w
->color
= MEM_BLACK
;
3331 x
->parent
->color
= MEM_RED
;
3332 mem_rotate_right (x
->parent
);
3333 w
= x
->parent
->left
;
3336 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
3343 if (w
->left
->color
== MEM_BLACK
)
3345 w
->right
->color
= MEM_BLACK
;
3347 mem_rotate_left (w
);
3348 w
= x
->parent
->left
;
3351 w
->color
= x
->parent
->color
;
3352 x
->parent
->color
= MEM_BLACK
;
3353 w
->left
->color
= MEM_BLACK
;
3354 mem_rotate_right (x
->parent
);
3360 x
->color
= MEM_BLACK
;
3364 /* Value is non-zero if P is a pointer to a live Lisp string on
3365 the heap. M is a pointer to the mem_block for P. */
3368 live_string_p (m
, p
)
3372 if (m
->type
== MEM_TYPE_STRING
)
3374 struct string_block
*b
= (struct string_block
*) m
->start
;
3375 int offset
= (char *) p
- (char *) &b
->strings
[0];
3377 /* P must point to the start of a Lisp_String structure, and it
3378 must not be on the free-list. */
3380 && offset
% sizeof b
->strings
[0] == 0
3381 && ((struct Lisp_String
*) p
)->data
!= NULL
);
3388 /* Value is non-zero if P is a pointer to a live Lisp cons on
3389 the heap. M is a pointer to the mem_block for P. */
3396 if (m
->type
== MEM_TYPE_CONS
)
3398 struct cons_block
*b
= (struct cons_block
*) m
->start
;
3399 int offset
= (char *) p
- (char *) &b
->conses
[0];
3401 /* P must point to the start of a Lisp_Cons, not be
3402 one of the unused cells in the current cons block,
3403 and not be on the free-list. */
3405 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
3406 && offset
% sizeof b
->conses
[0] == 0
3408 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
3409 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
3416 /* Value is non-zero if P is a pointer to a live Lisp symbol on
3417 the heap. M is a pointer to the mem_block for P. */
3420 live_symbol_p (m
, p
)
3424 if (m
->type
== MEM_TYPE_SYMBOL
)
3426 struct symbol_block
*b
= (struct symbol_block
*) m
->start
;
3427 int offset
= (char *) p
- (char *) &b
->symbols
[0];
3429 /* P must point to the start of a Lisp_Symbol, not be
3430 one of the unused cells in the current symbol block,
3431 and not be on the free-list. */
3433 && offset
% sizeof b
->symbols
[0] == 0
3434 && (b
!= symbol_block
3435 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
3436 && !EQ (((struct Lisp_Symbol
*) p
)->function
, Vdead
));
3443 /* Value is non-zero if P is a pointer to a live Lisp float on
3444 the heap. M is a pointer to the mem_block for P. */
3451 if (m
->type
== MEM_TYPE_FLOAT
)
3453 struct float_block
*b
= (struct float_block
*) m
->start
;
3454 int offset
= (char *) p
- (char *) &b
->floats
[0];
3456 /* P must point to the start of a Lisp_Float and not be
3457 one of the unused cells in the current float block. */
3459 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
3460 && offset
% sizeof b
->floats
[0] == 0
3461 && (b
!= float_block
3462 || offset
/ sizeof b
->floats
[0] < float_block_index
));
3469 /* Value is non-zero if P is a pointer to a live Lisp Misc on
3470 the heap. M is a pointer to the mem_block for P. */
3477 if (m
->type
== MEM_TYPE_MISC
)
3479 struct marker_block
*b
= (struct marker_block
*) m
->start
;
3480 int offset
= (char *) p
- (char *) &b
->markers
[0];
3482 /* P must point to the start of a Lisp_Misc, not be
3483 one of the unused cells in the current misc block,
3484 and not be on the free-list. */
3486 && offset
% sizeof b
->markers
[0] == 0
3487 && (b
!= marker_block
3488 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
3489 && ((union Lisp_Misc
*) p
)->u_marker
.type
!= Lisp_Misc_Free
);
3496 /* Value is non-zero if P is a pointer to a live vector-like object.
3497 M is a pointer to the mem_block for P. */
3500 live_vector_p (m
, p
)
3504 return (p
== m
->start
3505 && m
->type
>= MEM_TYPE_VECTOR
3506 && m
->type
<= MEM_TYPE_WINDOW
);
3510 /* Value is non-zero if P is a pointer to a live buffer. M is a
3511 pointer to the mem_block for P. */
3514 live_buffer_p (m
, p
)
3518 /* P must point to the start of the block, and the buffer
3519 must not have been killed. */
3520 return (m
->type
== MEM_TYPE_BUFFER
3522 && !NILP (((struct buffer
*) p
)->name
));
3525 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
3529 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3531 /* Array of objects that are kept alive because the C stack contains
3532 a pattern that looks like a reference to them . */
3534 #define MAX_ZOMBIES 10
3535 static Lisp_Object zombies
[MAX_ZOMBIES
];
3537 /* Number of zombie objects. */
3539 static int nzombies
;
3541 /* Number of garbage collections. */
3545 /* Average percentage of zombies per collection. */
3547 static double avg_zombies
;
3549 /* Max. number of live and zombie objects. */
3551 static int max_live
, max_zombies
;
3553 /* Average number of live objects per GC. */
3555 static double avg_live
;
3557 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
3558 doc
: /* Show information about live and zombie objects. */)
3561 Lisp_Object args
[8], zombie_list
= Qnil
;
3563 for (i
= 0; i
< nzombies
; i
++)
3564 zombie_list
= Fcons (zombies
[i
], zombie_list
);
3565 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
3566 args
[1] = make_number (ngcs
);
3567 args
[2] = make_float (avg_live
);
3568 args
[3] = make_float (avg_zombies
);
3569 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
3570 args
[5] = make_number (max_live
);
3571 args
[6] = make_number (max_zombies
);
3572 args
[7] = zombie_list
;
3573 return Fmessage (8, args
);
3576 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
3579 /* Mark OBJ if we can prove it's a Lisp_Object. */
3582 mark_maybe_object (obj
)
3585 void *po
= (void *) XPNTR (obj
);
3586 struct mem_node
*m
= mem_find (po
);
3592 switch (XGCTYPE (obj
))
3595 mark_p
= (live_string_p (m
, po
)
3596 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
3600 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
3604 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
3608 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
3611 case Lisp_Vectorlike
:
3612 /* Note: can't check GC_BUFFERP before we know it's a
3613 buffer because checking that dereferences the pointer
3614 PO which might point anywhere. */
3615 if (live_vector_p (m
, po
))
3616 mark_p
= !GC_SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
3617 else if (live_buffer_p (m
, po
))
3618 mark_p
= GC_BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
3622 mark_p
= (live_misc_p (m
, po
) && !XMARKER (obj
)->gcmarkbit
);
3626 case Lisp_Type_Limit
:
3632 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3633 if (nzombies
< MAX_ZOMBIES
)
3634 zombies
[nzombies
] = obj
;
3643 /* If P points to Lisp data, mark that as live if it isn't already
3647 mark_maybe_pointer (p
)
3652 /* Quickly rule out some values which can't point to Lisp data. We
3653 assume that Lisp data is aligned on even addresses. */
3654 if ((EMACS_INT
) p
& 1)
3660 Lisp_Object obj
= Qnil
;
3664 case MEM_TYPE_NON_LISP
:
3665 /* Nothing to do; not a pointer to Lisp memory. */
3668 case MEM_TYPE_BUFFER
:
3669 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P((struct buffer
*)p
))
3670 XSETVECTOR (obj
, p
);
3674 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
3678 case MEM_TYPE_STRING
:
3679 if (live_string_p (m
, p
)
3680 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
3681 XSETSTRING (obj
, p
);
3685 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
3689 case MEM_TYPE_SYMBOL
:
3690 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
3691 XSETSYMBOL (obj
, p
);
3694 case MEM_TYPE_FLOAT
:
3695 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
3699 case MEM_TYPE_VECTOR
:
3700 case MEM_TYPE_PROCESS
:
3701 case MEM_TYPE_HASH_TABLE
:
3702 case MEM_TYPE_FRAME
:
3703 case MEM_TYPE_WINDOW
:
3704 if (live_vector_p (m
, p
))
3707 XSETVECTOR (tem
, p
);
3708 if (!GC_SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
3723 /* Mark Lisp objects referenced from the address range START..END. */
3726 mark_memory (start
, end
)
3732 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3736 /* Make START the pointer to the start of the memory region,
3737 if it isn't already. */
3745 /* Mark Lisp_Objects. */
3746 for (p
= (Lisp_Object
*) start
; (void *) p
< end
; ++p
)
3747 mark_maybe_object (*p
);
3749 /* Mark Lisp data pointed to. This is necessary because, in some
3750 situations, the C compiler optimizes Lisp objects away, so that
3751 only a pointer to them remains. Example:
3753 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
3756 Lisp_Object obj = build_string ("test");
3757 struct Lisp_String *s = XSTRING (obj);
3758 Fgarbage_collect ();
3759 fprintf (stderr, "test `%s'\n", s->data);
3763 Here, `obj' isn't really used, and the compiler optimizes it
3764 away. The only reference to the life string is through the
3767 for (pp
= (void **) start
; (void *) pp
< end
; ++pp
)
3768 mark_maybe_pointer (*pp
);
3771 /* setjmp will work with GCC unless NON_SAVING_SETJMP is defined in
3772 the GCC system configuration. In gcc 3.2, the only systems for
3773 which this is so are i386-sco5 non-ELF, i386-sysv3 (maybe included
3774 by others?) and ns32k-pc532-min. */
3776 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
3778 static int setjmp_tested_p
, longjmps_done
;
3780 #define SETJMP_WILL_LIKELY_WORK "\
3782 Emacs garbage collector has been changed to use conservative stack\n\
3783 marking. Emacs has determined that the method it uses to do the\n\
3784 marking will likely work on your system, but this isn't sure.\n\
3786 If you are a system-programmer, or can get the help of a local wizard\n\
3787 who is, please take a look at the function mark_stack in alloc.c, and\n\
3788 verify that the methods used are appropriate for your system.\n\
3790 Please mail the result to <emacs-devel@gnu.org>.\n\
3793 #define SETJMP_WILL_NOT_WORK "\
3795 Emacs garbage collector has been changed to use conservative stack\n\
3796 marking. Emacs has determined that the default method it uses to do the\n\
3797 marking will not work on your system. We will need a system-dependent\n\
3798 solution for your system.\n\
3800 Please take a look at the function mark_stack in alloc.c, and\n\
3801 try to find a way to make it work on your system.\n\
3803 Note that you may get false negatives, depending on the compiler.\n\
3804 In particular, you need to use -O with GCC for this test.\n\
3806 Please mail the result to <emacs-devel@gnu.org>.\n\
3810 /* Perform a quick check if it looks like setjmp saves registers in a
3811 jmp_buf. Print a message to stderr saying so. When this test
3812 succeeds, this is _not_ a proof that setjmp is sufficient for
3813 conservative stack marking. Only the sources or a disassembly
3824 /* Arrange for X to be put in a register. */
3830 if (longjmps_done
== 1)
3832 /* Came here after the longjmp at the end of the function.
3834 If x == 1, the longjmp has restored the register to its
3835 value before the setjmp, and we can hope that setjmp
3836 saves all such registers in the jmp_buf, although that
3839 For other values of X, either something really strange is
3840 taking place, or the setjmp just didn't save the register. */
3843 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
3846 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
3853 if (longjmps_done
== 1)
3857 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
3860 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
3862 /* Abort if anything GCPRO'd doesn't survive the GC. */
3870 for (p
= gcprolist
; p
; p
= p
->next
)
3871 for (i
= 0; i
< p
->nvars
; ++i
)
3872 if (!survives_gc_p (p
->var
[i
]))
3873 /* FIXME: It's not necessarily a bug. It might just be that the
3874 GCPRO is unnecessary or should release the object sooner. */
3878 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3885 fprintf (stderr
, "\nZombies kept alive = %d:\n", nzombies
);
3886 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
3888 fprintf (stderr
, " %d = ", i
);
3889 debug_print (zombies
[i
]);
3893 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
3896 /* Mark live Lisp objects on the C stack.
3898 There are several system-dependent problems to consider when
3899 porting this to new architectures:
3903 We have to mark Lisp objects in CPU registers that can hold local
3904 variables or are used to pass parameters.
3906 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
3907 something that either saves relevant registers on the stack, or
3908 calls mark_maybe_object passing it each register's contents.
3910 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
3911 implementation assumes that calling setjmp saves registers we need
3912 to see in a jmp_buf which itself lies on the stack. This doesn't
3913 have to be true! It must be verified for each system, possibly
3914 by taking a look at the source code of setjmp.
3918 Architectures differ in the way their processor stack is organized.
3919 For example, the stack might look like this
3922 | Lisp_Object | size = 4
3924 | something else | size = 2
3926 | Lisp_Object | size = 4
3930 In such a case, not every Lisp_Object will be aligned equally. To
3931 find all Lisp_Object on the stack it won't be sufficient to walk
3932 the stack in steps of 4 bytes. Instead, two passes will be
3933 necessary, one starting at the start of the stack, and a second
3934 pass starting at the start of the stack + 2. Likewise, if the
3935 minimal alignment of Lisp_Objects on the stack is 1, four passes
3936 would be necessary, each one starting with one byte more offset
3937 from the stack start.
3939 The current code assumes by default that Lisp_Objects are aligned
3940 equally on the stack. */
3947 volatile int stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
3950 /* This trick flushes the register windows so that all the state of
3951 the process is contained in the stack. */
3952 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
3953 needed on ia64 too. See mach_dep.c, where it also says inline
3954 assembler doesn't work with relevant proprietary compilers. */
3959 /* Save registers that we need to see on the stack. We need to see
3960 registers used to hold register variables and registers used to
3962 #ifdef GC_SAVE_REGISTERS_ON_STACK
3963 GC_SAVE_REGISTERS_ON_STACK (end
);
3964 #else /* not GC_SAVE_REGISTERS_ON_STACK */
3966 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
3967 setjmp will definitely work, test it
3968 and print a message with the result
3970 if (!setjmp_tested_p
)
3972 setjmp_tested_p
= 1;
3975 #endif /* GC_SETJMP_WORKS */
3978 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
3979 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
3981 /* This assumes that the stack is a contiguous region in memory. If
3982 that's not the case, something has to be done here to iterate
3983 over the stack segments. */
3984 #ifndef GC_LISP_OBJECT_ALIGNMENT
3986 #define GC_LISP_OBJECT_ALIGNMENT __alignof__ (Lisp_Object)
3988 #define GC_LISP_OBJECT_ALIGNMENT sizeof (Lisp_Object)
3991 for (i
= 0; i
< sizeof (Lisp_Object
); i
+= GC_LISP_OBJECT_ALIGNMENT
)
3992 mark_memory ((char *) stack_base
+ i
, end
);
3994 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4000 #endif /* GC_MARK_STACK != 0 */
4004 /***********************************************************************
4005 Pure Storage Management
4006 ***********************************************************************/
4008 /* Allocate room for SIZE bytes from pure Lisp storage and return a
4009 pointer to it. TYPE is the Lisp type for which the memory is
4010 allocated. TYPE < 0 means it's not used for a Lisp object.
4012 If store_pure_type_info is set and TYPE is >= 0, the type of
4013 the allocated object is recorded in pure_types. */
4015 static POINTER_TYPE
*
4016 pure_alloc (size
, type
)
4020 POINTER_TYPE
*result
;
4021 size_t alignment
= sizeof (EMACS_INT
);
4023 /* Give Lisp_Floats an extra alignment. */
4024 if (type
== Lisp_Float
)
4026 #if defined __GNUC__ && __GNUC__ >= 2
4027 alignment
= __alignof (struct Lisp_Float
);
4029 alignment
= sizeof (struct Lisp_Float
);
4034 result
= ALIGN (purebeg
+ pure_bytes_used
, alignment
);
4035 pure_bytes_used
= ((char *)result
- (char *)purebeg
) + size
;
4037 if (pure_bytes_used
<= pure_size
)
4040 /* Don't allocate a large amount here,
4041 because it might get mmap'd and then its address
4042 might not be usable. */
4043 purebeg
= (char *) xmalloc (10000);
4045 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
4046 pure_bytes_used
= 0;
4051 /* Print a warning if PURESIZE is too small. */
4056 if (pure_bytes_used_before_overflow
)
4057 message ("Pure Lisp storage overflow (approx. %d bytes needed)",
4058 (int) (pure_bytes_used
+ pure_bytes_used_before_overflow
));
4062 /* Return a string allocated in pure space. DATA is a buffer holding
4063 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
4064 non-zero means make the result string multibyte.
4066 Must get an error if pure storage is full, since if it cannot hold
4067 a large string it may be able to hold conses that point to that
4068 string; then the string is not protected from gc. */
4071 make_pure_string (data
, nchars
, nbytes
, multibyte
)
4077 struct Lisp_String
*s
;
4079 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4080 s
->data
= (unsigned char *) pure_alloc (nbytes
+ 1, -1);
4082 s
->size_byte
= multibyte
? nbytes
: -1;
4083 bcopy (data
, s
->data
, nbytes
);
4084 s
->data
[nbytes
] = '\0';
4085 s
->intervals
= NULL_INTERVAL
;
4086 XSETSTRING (string
, s
);
4091 /* Return a cons allocated from pure space. Give it pure copies
4092 of CAR as car and CDR as cdr. */
4095 pure_cons (car
, cdr
)
4096 Lisp_Object car
, cdr
;
4098 register Lisp_Object
new;
4099 struct Lisp_Cons
*p
;
4101 p
= (struct Lisp_Cons
*) pure_alloc (sizeof *p
, Lisp_Cons
);
4103 XSETCAR (new, Fpurecopy (car
));
4104 XSETCDR (new, Fpurecopy (cdr
));
4109 /* Value is a float object with value NUM allocated from pure space. */
4112 make_pure_float (num
)
4115 register Lisp_Object
new;
4116 struct Lisp_Float
*p
;
4118 p
= (struct Lisp_Float
*) pure_alloc (sizeof *p
, Lisp_Float
);
4120 XFLOAT_DATA (new) = num
;
4125 /* Return a vector with room for LEN Lisp_Objects allocated from
4129 make_pure_vector (len
)
4133 struct Lisp_Vector
*p
;
4134 size_t size
= sizeof *p
+ (len
- 1) * sizeof (Lisp_Object
);
4136 p
= (struct Lisp_Vector
*) pure_alloc (size
, Lisp_Vectorlike
);
4137 XSETVECTOR (new, p
);
4138 XVECTOR (new)->size
= len
;
4143 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
4144 doc
: /* Make a copy of OBJECT in pure storage.
4145 Recursively copies contents of vectors and cons cells.
4146 Does not copy symbols. Copies strings without text properties. */)
4148 register Lisp_Object obj
;
4150 if (NILP (Vpurify_flag
))
4153 if (PURE_POINTER_P (XPNTR (obj
)))
4157 return pure_cons (XCAR (obj
), XCDR (obj
));
4158 else if (FLOATP (obj
))
4159 return make_pure_float (XFLOAT_DATA (obj
));
4160 else if (STRINGP (obj
))
4161 return make_pure_string (SDATA (obj
), SCHARS (obj
),
4163 STRING_MULTIBYTE (obj
));
4164 else if (COMPILEDP (obj
) || VECTORP (obj
))
4166 register struct Lisp_Vector
*vec
;
4167 register int i
, size
;
4169 size
= XVECTOR (obj
)->size
;
4170 if (size
& PSEUDOVECTOR_FLAG
)
4171 size
&= PSEUDOVECTOR_SIZE_MASK
;
4172 vec
= XVECTOR (make_pure_vector ((EMACS_INT
) size
));
4173 for (i
= 0; i
< size
; i
++)
4174 vec
->contents
[i
] = Fpurecopy (XVECTOR (obj
)->contents
[i
]);
4175 if (COMPILEDP (obj
))
4176 XSETCOMPILED (obj
, vec
);
4178 XSETVECTOR (obj
, vec
);
4181 else if (MARKERP (obj
))
4182 error ("Attempt to copy a marker to pure storage");
4189 /***********************************************************************
4191 ***********************************************************************/
4193 /* Put an entry in staticvec, pointing at the variable with address
4197 staticpro (varaddress
)
4198 Lisp_Object
*varaddress
;
4200 staticvec
[staticidx
++] = varaddress
;
4201 if (staticidx
>= NSTATICS
)
4209 struct catchtag
*next
;
4214 struct backtrace
*next
;
4215 Lisp_Object
*function
;
4216 Lisp_Object
*args
; /* Points to vector of args. */
4217 int nargs
; /* Length of vector. */
4218 /* If nargs is UNEVALLED, args points to slot holding list of
4225 /***********************************************************************
4227 ***********************************************************************/
4229 /* Temporarily prevent garbage collection. */
4232 inhibit_garbage_collection ()
4234 int count
= SPECPDL_INDEX ();
4235 int nbits
= min (VALBITS
, BITS_PER_INT
);
4237 specbind (Qgc_cons_threshold
, make_number (((EMACS_INT
) 1 << (nbits
- 1)) - 1));
4242 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
4243 doc
: /* Reclaim storage for Lisp objects no longer needed.
4244 Garbage collection happens automatically if you cons more than
4245 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
4246 `garbage-collect' normally returns a list with info on amount of space in use:
4247 ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)
4248 (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS
4249 (USED-FLOATS . FREE-FLOATS) (USED-INTERVALS . FREE-INTERVALS)
4250 (USED-STRINGS . FREE-STRINGS))
4251 However, if there was overflow in pure space, `garbage-collect'
4252 returns nil, because real GC can't be done. */)
4255 register struct specbinding
*bind
;
4256 struct catchtag
*catch;
4257 struct handler
*handler
;
4258 register struct backtrace
*backlist
;
4259 char stack_top_variable
;
4262 Lisp_Object total
[8];
4263 int count
= SPECPDL_INDEX ();
4264 EMACS_TIME t1
, t2
, t3
;
4269 EMACS_GET_TIME (t1
);
4271 /* Can't GC if pure storage overflowed because we can't determine
4272 if something is a pure object or not. */
4273 if (pure_bytes_used_before_overflow
)
4276 /* In case user calls debug_print during GC,
4277 don't let that cause a recursive GC. */
4278 consing_since_gc
= 0;
4280 /* Save what's currently displayed in the echo area. */
4281 message_p
= push_message ();
4282 record_unwind_protect (pop_message_unwind
, Qnil
);
4284 /* Save a copy of the contents of the stack, for debugging. */
4285 #if MAX_SAVE_STACK > 0
4286 if (NILP (Vpurify_flag
))
4288 i
= &stack_top_variable
- stack_bottom
;
4290 if (i
< MAX_SAVE_STACK
)
4292 if (stack_copy
== 0)
4293 stack_copy
= (char *) xmalloc (stack_copy_size
= i
);
4294 else if (stack_copy_size
< i
)
4295 stack_copy
= (char *) xrealloc (stack_copy
, (stack_copy_size
= i
));
4298 if ((EMACS_INT
) (&stack_top_variable
- stack_bottom
) > 0)
4299 bcopy (stack_bottom
, stack_copy
, i
);
4301 bcopy (&stack_top_variable
, stack_copy
, i
);
4305 #endif /* MAX_SAVE_STACK > 0 */
4307 if (garbage_collection_messages
)
4308 message1_nolog ("Garbage collecting...");
4312 shrink_regexp_cache ();
4314 /* Don't keep undo information around forever. */
4316 register struct buffer
*nextb
= all_buffers
;
4320 /* If a buffer's undo list is Qt, that means that undo is
4321 turned off in that buffer. Calling truncate_undo_list on
4322 Qt tends to return NULL, which effectively turns undo back on.
4323 So don't call truncate_undo_list if undo_list is Qt. */
4324 if (! EQ (nextb
->undo_list
, Qt
))
4326 = truncate_undo_list (nextb
->undo_list
, undo_limit
,
4329 /* Shrink buffer gaps, but skip indirect and dead buffers. */
4330 if (nextb
->base_buffer
== 0 && !NILP (nextb
->name
))
4332 /* If a buffer's gap size is more than 10% of the buffer
4333 size, or larger than 2000 bytes, then shrink it
4334 accordingly. Keep a minimum size of 20 bytes. */
4335 int size
= min (2000, max (20, (nextb
->text
->z_byte
/ 10)));
4337 if (nextb
->text
->gap_size
> size
)
4339 struct buffer
*save_current
= current_buffer
;
4340 current_buffer
= nextb
;
4341 make_gap (-(nextb
->text
->gap_size
- size
));
4342 current_buffer
= save_current
;
4346 nextb
= nextb
->next
;
4352 /* clear_marks (); */
4354 /* Mark all the special slots that serve as the roots of accessibility.
4356 Usually the special slots to mark are contained in particular structures.
4357 Then we know no slot is marked twice because the structures don't overlap.
4358 In some cases, the structures point to the slots to be marked.
4359 For these, we use MARKBIT to avoid double marking of the slot. */
4361 for (i
= 0; i
< staticidx
; i
++)
4362 mark_object (*staticvec
[i
]);
4364 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
4365 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
4369 register struct gcpro
*tail
;
4370 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
4371 for (i
= 0; i
< tail
->nvars
; i
++)
4372 if (!XMARKBIT (tail
->var
[i
]))
4374 mark_object (tail
->var
[i
]);
4375 XMARK (tail
->var
[i
]);
4381 for (bind
= specpdl
; bind
!= specpdl_ptr
; bind
++)
4383 mark_object (bind
->symbol
);
4384 mark_object (bind
->old_value
);
4386 for (catch = catchlist
; catch; catch = catch->next
)
4388 mark_object (catch->tag
);
4389 mark_object (catch->val
);
4391 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
4393 mark_object (handler
->handler
);
4394 mark_object (handler
->var
);
4396 for (backlist
= backtrace_list
; backlist
; backlist
= backlist
->next
)
4398 if (!XMARKBIT (*backlist
->function
))
4400 mark_object (*backlist
->function
);
4401 XMARK (*backlist
->function
);
4403 if (backlist
->nargs
== UNEVALLED
|| backlist
->nargs
== MANY
)
4406 i
= backlist
->nargs
- 1;
4408 if (!XMARKBIT (backlist
->args
[i
]))
4410 mark_object (backlist
->args
[i
]);
4411 XMARK (backlist
->args
[i
]);
4416 /* Look thru every buffer's undo list
4417 for elements that update markers that were not marked,
4420 register struct buffer
*nextb
= all_buffers
;
4424 /* If a buffer's undo list is Qt, that means that undo is
4425 turned off in that buffer. Calling truncate_undo_list on
4426 Qt tends to return NULL, which effectively turns undo back on.
4427 So don't call truncate_undo_list if undo_list is Qt. */
4428 if (! EQ (nextb
->undo_list
, Qt
))
4430 Lisp_Object tail
, prev
;
4431 tail
= nextb
->undo_list
;
4433 while (CONSP (tail
))
4435 if (GC_CONSP (XCAR (tail
))
4436 && GC_MARKERP (XCAR (XCAR (tail
)))
4437 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
4440 nextb
->undo_list
= tail
= XCDR (tail
);
4444 XSETCDR (prev
, tail
);
4455 nextb
= nextb
->next
;
4459 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4465 extern void xg_mark_data ();
4472 /* Clear the mark bits that we set in certain root slots. */
4474 #if (GC_MARK_STACK == GC_USE_GCPROS_AS_BEFORE \
4475 || GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES)
4477 register struct gcpro
*tail
;
4479 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
4480 for (i
= 0; i
< tail
->nvars
; i
++)
4481 XUNMARK (tail
->var
[i
]);
4485 unmark_byte_stack ();
4486 for (backlist
= backtrace_list
; backlist
; backlist
= backlist
->next
)
4488 XUNMARK (*backlist
->function
);
4489 if (backlist
->nargs
== UNEVALLED
|| backlist
->nargs
== MANY
)
4492 i
= backlist
->nargs
- 1;
4494 XUNMARK (backlist
->args
[i
]);
4496 VECTOR_UNMARK (&buffer_defaults
);
4497 VECTOR_UNMARK (&buffer_local_symbols
);
4499 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
4505 /* clear_marks (); */
4508 consing_since_gc
= 0;
4509 if (gc_cons_threshold
< 10000)
4510 gc_cons_threshold
= 10000;
4512 if (garbage_collection_messages
)
4514 if (message_p
|| minibuf_level
> 0)
4517 message1_nolog ("Garbage collecting...done");
4520 unbind_to (count
, Qnil
);
4522 total
[0] = Fcons (make_number (total_conses
),
4523 make_number (total_free_conses
));
4524 total
[1] = Fcons (make_number (total_symbols
),
4525 make_number (total_free_symbols
));
4526 total
[2] = Fcons (make_number (total_markers
),
4527 make_number (total_free_markers
));
4528 total
[3] = make_number (total_string_size
);
4529 total
[4] = make_number (total_vector_size
);
4530 total
[5] = Fcons (make_number (total_floats
),
4531 make_number (total_free_floats
));
4532 total
[6] = Fcons (make_number (total_intervals
),
4533 make_number (total_free_intervals
));
4534 total
[7] = Fcons (make_number (total_strings
),
4535 make_number (total_free_strings
));
4537 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4539 /* Compute average percentage of zombies. */
4542 for (i
= 0; i
< 7; ++i
)
4543 if (CONSP (total
[i
]))
4544 nlive
+= XFASTINT (XCAR (total
[i
]));
4546 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
4547 max_live
= max (nlive
, max_live
);
4548 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
4549 max_zombies
= max (nzombies
, max_zombies
);
4554 if (!NILP (Vpost_gc_hook
))
4556 int count
= inhibit_garbage_collection ();
4557 safe_run_hooks (Qpost_gc_hook
);
4558 unbind_to (count
, Qnil
);
4561 /* Accumulate statistics. */
4562 EMACS_GET_TIME (t2
);
4563 EMACS_SUB_TIME (t3
, t2
, t1
);
4564 if (FLOATP (Vgc_elapsed
))
4565 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
) +
4567 EMACS_USECS (t3
) * 1.0e-6);
4570 return Flist (sizeof total
/ sizeof *total
, total
);
4574 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
4575 only interesting objects referenced from glyphs are strings. */
4578 mark_glyph_matrix (matrix
)
4579 struct glyph_matrix
*matrix
;
4581 struct glyph_row
*row
= matrix
->rows
;
4582 struct glyph_row
*end
= row
+ matrix
->nrows
;
4584 for (; row
< end
; ++row
)
4588 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
4590 struct glyph
*glyph
= row
->glyphs
[area
];
4591 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
4593 for (; glyph
< end_glyph
; ++glyph
)
4594 if (GC_STRINGP (glyph
->object
)
4595 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
4596 mark_object (glyph
->object
);
4602 /* Mark Lisp faces in the face cache C. */
4606 struct face_cache
*c
;
4611 for (i
= 0; i
< c
->used
; ++i
)
4613 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
4617 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
4618 mark_object (face
->lface
[j
]);
4625 #ifdef HAVE_WINDOW_SYSTEM
4627 /* Mark Lisp objects in image IMG. */
4633 mark_object (img
->spec
);
4635 if (!NILP (img
->data
.lisp_val
))
4636 mark_object (img
->data
.lisp_val
);
4640 /* Mark Lisp objects in image cache of frame F. It's done this way so
4641 that we don't have to include xterm.h here. */
4644 mark_image_cache (f
)
4647 forall_images_in_image_cache (f
, mark_image
);
4650 #endif /* HAVE_X_WINDOWS */
4654 /* Mark reference to a Lisp_Object.
4655 If the object referred to has not been seen yet, recursively mark
4656 all the references contained in it. */
4658 #define LAST_MARKED_SIZE 500
4659 Lisp_Object last_marked
[LAST_MARKED_SIZE
];
4660 int last_marked_index
;
4662 /* For debugging--call abort when we cdr down this many
4663 links of a list, in mark_object. In debugging,
4664 the call to abort will hit a breakpoint.
4665 Normally this is zero and the check never goes off. */
4666 int mark_object_loop_halt
;
4672 register Lisp_Object obj
= arg
;
4673 #ifdef GC_CHECK_MARKED_OBJECTS
4682 if (PURE_POINTER_P (XPNTR (obj
)))
4685 last_marked
[last_marked_index
++] = obj
;
4686 if (last_marked_index
== LAST_MARKED_SIZE
)
4687 last_marked_index
= 0;
4689 /* Perform some sanity checks on the objects marked here. Abort if
4690 we encounter an object we know is bogus. This increases GC time
4691 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
4692 #ifdef GC_CHECK_MARKED_OBJECTS
4694 po
= (void *) XPNTR (obj
);
4696 /* Check that the object pointed to by PO is known to be a Lisp
4697 structure allocated from the heap. */
4698 #define CHECK_ALLOCATED() \
4700 m = mem_find (po); \
4705 /* Check that the object pointed to by PO is live, using predicate
4707 #define CHECK_LIVE(LIVEP) \
4709 if (!LIVEP (m, po)) \
4713 /* Check both of the above conditions. */
4714 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
4716 CHECK_ALLOCATED (); \
4717 CHECK_LIVE (LIVEP); \
4720 #else /* not GC_CHECK_MARKED_OBJECTS */
4722 #define CHECK_ALLOCATED() (void) 0
4723 #define CHECK_LIVE(LIVEP) (void) 0
4724 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
4726 #endif /* not GC_CHECK_MARKED_OBJECTS */
4728 switch (SWITCH_ENUM_CAST (XGCTYPE (obj
)))
4732 register struct Lisp_String
*ptr
= XSTRING (obj
);
4733 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
4734 MARK_INTERVAL_TREE (ptr
->intervals
);
4736 #ifdef GC_CHECK_STRING_BYTES
4737 /* Check that the string size recorded in the string is the
4738 same as the one recorded in the sdata structure. */
4739 CHECK_STRING_BYTES (ptr
);
4740 #endif /* GC_CHECK_STRING_BYTES */
4744 case Lisp_Vectorlike
:
4745 #ifdef GC_CHECK_MARKED_OBJECTS
4747 if (m
== MEM_NIL
&& !GC_SUBRP (obj
)
4748 && po
!= &buffer_defaults
4749 && po
!= &buffer_local_symbols
)
4751 #endif /* GC_CHECK_MARKED_OBJECTS */
4753 if (GC_BUFFERP (obj
))
4755 if (!VECTOR_MARKED_P (XBUFFER (obj
)))
4757 #ifdef GC_CHECK_MARKED_OBJECTS
4758 if (po
!= &buffer_defaults
&& po
!= &buffer_local_symbols
)
4761 for (b
= all_buffers
; b
&& b
!= po
; b
= b
->next
)
4766 #endif /* GC_CHECK_MARKED_OBJECTS */
4770 else if (GC_SUBRP (obj
))
4772 else if (GC_COMPILEDP (obj
))
4773 /* We could treat this just like a vector, but it is better to
4774 save the COMPILED_CONSTANTS element for last and avoid
4777 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
4778 register EMACS_INT size
= ptr
->size
;
4781 if (VECTOR_MARKED_P (ptr
))
4782 break; /* Already marked */
4784 CHECK_LIVE (live_vector_p
);
4785 VECTOR_MARK (ptr
); /* Else mark it */
4786 size
&= PSEUDOVECTOR_SIZE_MASK
;
4787 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
4789 if (i
!= COMPILED_CONSTANTS
)
4790 mark_object (ptr
->contents
[i
]);
4792 obj
= ptr
->contents
[COMPILED_CONSTANTS
];
4795 else if (GC_FRAMEP (obj
))
4797 register struct frame
*ptr
= XFRAME (obj
);
4799 if (VECTOR_MARKED_P (ptr
)) break; /* Already marked */
4800 VECTOR_MARK (ptr
); /* Else mark it */
4802 CHECK_LIVE (live_vector_p
);
4803 mark_object (ptr
->name
);
4804 mark_object (ptr
->icon_name
);
4805 mark_object (ptr
->title
);
4806 mark_object (ptr
->focus_frame
);
4807 mark_object (ptr
->selected_window
);
4808 mark_object (ptr
->minibuffer_window
);
4809 mark_object (ptr
->param_alist
);
4810 mark_object (ptr
->scroll_bars
);
4811 mark_object (ptr
->condemned_scroll_bars
);
4812 mark_object (ptr
->menu_bar_items
);
4813 mark_object (ptr
->face_alist
);
4814 mark_object (ptr
->menu_bar_vector
);
4815 mark_object (ptr
->buffer_predicate
);
4816 mark_object (ptr
->buffer_list
);
4817 mark_object (ptr
->menu_bar_window
);
4818 mark_object (ptr
->tool_bar_window
);
4819 mark_face_cache (ptr
->face_cache
);
4820 #ifdef HAVE_WINDOW_SYSTEM
4821 mark_image_cache (ptr
);
4822 mark_object (ptr
->tool_bar_items
);
4823 mark_object (ptr
->desired_tool_bar_string
);
4824 mark_object (ptr
->current_tool_bar_string
);
4825 #endif /* HAVE_WINDOW_SYSTEM */
4827 else if (GC_BOOL_VECTOR_P (obj
))
4829 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
4831 if (VECTOR_MARKED_P (ptr
))
4832 break; /* Already marked */
4833 CHECK_LIVE (live_vector_p
);
4834 VECTOR_MARK (ptr
); /* Else mark it */
4836 else if (GC_WINDOWP (obj
))
4838 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
4839 struct window
*w
= XWINDOW (obj
);
4842 /* Stop if already marked. */
4843 if (VECTOR_MARKED_P (ptr
))
4847 CHECK_LIVE (live_vector_p
);
4850 /* There is no Lisp data above The member CURRENT_MATRIX in
4851 struct WINDOW. Stop marking when that slot is reached. */
4853 (char *) &ptr
->contents
[i
] < (char *) &w
->current_matrix
;
4855 mark_object (ptr
->contents
[i
]);
4857 /* Mark glyphs for leaf windows. Marking window matrices is
4858 sufficient because frame matrices use the same glyph
4860 if (NILP (w
->hchild
)
4862 && w
->current_matrix
)
4864 mark_glyph_matrix (w
->current_matrix
);
4865 mark_glyph_matrix (w
->desired_matrix
);
4868 else if (GC_HASH_TABLE_P (obj
))
4870 struct Lisp_Hash_Table
*h
= XHASH_TABLE (obj
);
4872 /* Stop if already marked. */
4873 if (VECTOR_MARKED_P (h
))
4877 CHECK_LIVE (live_vector_p
);
4880 /* Mark contents. */
4881 /* Do not mark next_free or next_weak.
4882 Being in the next_weak chain
4883 should not keep the hash table alive.
4884 No need to mark `count' since it is an integer. */
4885 mark_object (h
->test
);
4886 mark_object (h
->weak
);
4887 mark_object (h
->rehash_size
);
4888 mark_object (h
->rehash_threshold
);
4889 mark_object (h
->hash
);
4890 mark_object (h
->next
);
4891 mark_object (h
->index
);
4892 mark_object (h
->user_hash_function
);
4893 mark_object (h
->user_cmp_function
);
4895 /* If hash table is not weak, mark all keys and values.
4896 For weak tables, mark only the vector. */
4897 if (GC_NILP (h
->weak
))
4898 mark_object (h
->key_and_value
);
4900 VECTOR_MARK (XVECTOR (h
->key_and_value
));
4904 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
4905 register EMACS_INT size
= ptr
->size
;
4908 if (VECTOR_MARKED_P (ptr
)) break; /* Already marked */
4909 CHECK_LIVE (live_vector_p
);
4910 VECTOR_MARK (ptr
); /* Else mark it */
4911 if (size
& PSEUDOVECTOR_FLAG
)
4912 size
&= PSEUDOVECTOR_SIZE_MASK
;
4914 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
4915 mark_object (ptr
->contents
[i
]);
4921 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
4922 struct Lisp_Symbol
*ptrx
;
4924 if (ptr
->gcmarkbit
) break;
4925 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
4927 mark_object (ptr
->value
);
4928 mark_object (ptr
->function
);
4929 mark_object (ptr
->plist
);
4931 if (!PURE_POINTER_P (XSTRING (ptr
->xname
)))
4932 MARK_STRING (XSTRING (ptr
->xname
));
4933 MARK_INTERVAL_TREE (STRING_INTERVALS (ptr
->xname
));
4935 /* Note that we do not mark the obarray of the symbol.
4936 It is safe not to do so because nothing accesses that
4937 slot except to check whether it is nil. */
4941 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun */
4942 XSETSYMBOL (obj
, ptrx
);
4949 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
4950 if (XMARKER (obj
)->gcmarkbit
)
4952 XMARKER (obj
)->gcmarkbit
= 1;
4953 switch (XMISCTYPE (obj
))
4955 case Lisp_Misc_Buffer_Local_Value
:
4956 case Lisp_Misc_Some_Buffer_Local_Value
:
4958 register struct Lisp_Buffer_Local_Value
*ptr
4959 = XBUFFER_LOCAL_VALUE (obj
);
4960 /* If the cdr is nil, avoid recursion for the car. */
4961 if (EQ (ptr
->cdr
, Qnil
))
4963 obj
= ptr
->realvalue
;
4966 mark_object (ptr
->realvalue
);
4967 mark_object (ptr
->buffer
);
4968 mark_object (ptr
->frame
);
4973 case Lisp_Misc_Marker
:
4974 /* DO NOT mark thru the marker's chain.
4975 The buffer's markers chain does not preserve markers from gc;
4976 instead, markers are removed from the chain when freed by gc. */
4977 case Lisp_Misc_Intfwd
:
4978 case Lisp_Misc_Boolfwd
:
4979 case Lisp_Misc_Objfwd
:
4980 case Lisp_Misc_Buffer_Objfwd
:
4981 case Lisp_Misc_Kboard_Objfwd
:
4982 /* Don't bother with Lisp_Buffer_Objfwd,
4983 since all markable slots in current buffer marked anyway. */
4984 /* Don't need to do Lisp_Objfwd, since the places they point
4985 are protected with staticpro. */
4986 case Lisp_Misc_Save_Value
:
4989 case Lisp_Misc_Overlay
:
4991 struct Lisp_Overlay
*ptr
= XOVERLAY (obj
);
4992 mark_object (ptr
->start
);
4993 mark_object (ptr
->end
);
4994 mark_object (ptr
->plist
);
4997 XSETMISC (obj
, ptr
->next
);
5010 register struct Lisp_Cons
*ptr
= XCONS (obj
);
5011 if (CONS_MARKED_P (ptr
)) break;
5012 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
5014 /* If the cdr is nil, avoid recursion for the car. */
5015 if (EQ (ptr
->cdr
, Qnil
))
5021 mark_object (ptr
->car
);
5024 if (cdr_count
== mark_object_loop_halt
)
5030 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
5031 FLOAT_MARK (XFLOAT (obj
));
5042 #undef CHECK_ALLOCATED
5043 #undef CHECK_ALLOCATED_AND_LIVE
5046 /* Mark the pointers in a buffer structure. */
5052 register struct buffer
*buffer
= XBUFFER (buf
);
5053 register Lisp_Object
*ptr
, tmp
;
5054 Lisp_Object base_buffer
;
5056 VECTOR_MARK (buffer
);
5058 MARK_INTERVAL_TREE (BUF_INTERVALS (buffer
));
5060 if (CONSP (buffer
->undo_list
))
5063 tail
= buffer
->undo_list
;
5065 /* We mark the undo list specially because
5066 its pointers to markers should be weak. */
5068 while (CONSP (tail
))
5070 register struct Lisp_Cons
*ptr
= XCONS (tail
);
5072 if (CONS_MARKED_P (ptr
))
5075 if (GC_CONSP (ptr
->car
)
5076 && !CONS_MARKED_P (XCONS (ptr
->car
))
5077 && GC_MARKERP (XCAR (ptr
->car
)))
5079 CONS_MARK (XCONS (ptr
->car
));
5080 mark_object (XCDR (ptr
->car
));
5083 mark_object (ptr
->car
);
5085 if (CONSP (ptr
->cdr
))
5091 mark_object (XCDR (tail
));
5094 mark_object (buffer
->undo_list
);
5096 if (buffer
->overlays_before
)
5098 XSETMISC (tmp
, buffer
->overlays_before
);
5101 if (buffer
->overlays_after
)
5103 XSETMISC (tmp
, buffer
->overlays_after
);
5107 for (ptr
= &buffer
->name
;
5108 (char *)ptr
< (char *)buffer
+ sizeof (struct buffer
);
5112 /* If this is an indirect buffer, mark its base buffer. */
5113 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
5115 XSETBUFFER (base_buffer
, buffer
->base_buffer
);
5116 mark_buffer (base_buffer
);
5121 /* Value is non-zero if OBJ will survive the current GC because it's
5122 either marked or does not need to be marked to survive. */
5130 switch (XGCTYPE (obj
))
5137 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
5141 survives_p
= XMARKER (obj
)->gcmarkbit
;
5145 survives_p
= STRING_MARKED_P (XSTRING (obj
));
5148 case Lisp_Vectorlike
:
5149 survives_p
= GC_SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
5153 survives_p
= CONS_MARKED_P (XCONS (obj
));
5157 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
5164 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
5169 /* Sweep: find all structures not marked, and free them. */
5174 /* Remove or mark entries in weak hash tables.
5175 This must be done before any object is unmarked. */
5176 sweep_weak_hash_tables ();
5179 #ifdef GC_CHECK_STRING_BYTES
5180 if (!noninteractive
)
5181 check_string_bytes (1);
5184 /* Put all unmarked conses on free list */
5186 register struct cons_block
*cblk
;
5187 struct cons_block
**cprev
= &cons_block
;
5188 register int lim
= cons_block_index
;
5189 register int num_free
= 0, num_used
= 0;
5193 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
5197 for (i
= 0; i
< lim
; i
++)
5198 if (!CONS_MARKED_P (&cblk
->conses
[i
]))
5201 *(struct Lisp_Cons
**)&cblk
->conses
[i
].cdr
= cons_free_list
;
5202 cons_free_list
= &cblk
->conses
[i
];
5204 cons_free_list
->car
= Vdead
;
5210 CONS_UNMARK (&cblk
->conses
[i
]);
5212 lim
= CONS_BLOCK_SIZE
;
5213 /* If this block contains only free conses and we have already
5214 seen more than two blocks worth of free conses then deallocate
5216 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
5218 *cprev
= cblk
->next
;
5219 /* Unhook from the free list. */
5220 cons_free_list
= *(struct Lisp_Cons
**) &cblk
->conses
[0].cdr
;
5221 lisp_align_free (cblk
);
5226 num_free
+= this_free
;
5227 cprev
= &cblk
->next
;
5230 total_conses
= num_used
;
5231 total_free_conses
= num_free
;
5234 /* Put all unmarked floats on free list */
5236 register struct float_block
*fblk
;
5237 struct float_block
**fprev
= &float_block
;
5238 register int lim
= float_block_index
;
5239 register int num_free
= 0, num_used
= 0;
5241 float_free_list
= 0;
5243 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
5247 for (i
= 0; i
< lim
; i
++)
5248 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
5251 *(struct Lisp_Float
**)&fblk
->floats
[i
].data
= float_free_list
;
5252 float_free_list
= &fblk
->floats
[i
];
5257 FLOAT_UNMARK (&fblk
->floats
[i
]);
5259 lim
= FLOAT_BLOCK_SIZE
;
5260 /* If this block contains only free floats and we have already
5261 seen more than two blocks worth of free floats then deallocate
5263 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
5265 *fprev
= fblk
->next
;
5266 /* Unhook from the free list. */
5267 float_free_list
= *(struct Lisp_Float
**) &fblk
->floats
[0].data
;
5268 lisp_align_free (fblk
);
5273 num_free
+= this_free
;
5274 fprev
= &fblk
->next
;
5277 total_floats
= num_used
;
5278 total_free_floats
= num_free
;
5281 /* Put all unmarked intervals on free list */
5283 register struct interval_block
*iblk
;
5284 struct interval_block
**iprev
= &interval_block
;
5285 register int lim
= interval_block_index
;
5286 register int num_free
= 0, num_used
= 0;
5288 interval_free_list
= 0;
5290 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
5295 for (i
= 0; i
< lim
; i
++)
5297 if (!iblk
->intervals
[i
].gcmarkbit
)
5299 SET_INTERVAL_PARENT (&iblk
->intervals
[i
], interval_free_list
);
5300 interval_free_list
= &iblk
->intervals
[i
];
5306 iblk
->intervals
[i
].gcmarkbit
= 0;
5309 lim
= INTERVAL_BLOCK_SIZE
;
5310 /* If this block contains only free intervals and we have already
5311 seen more than two blocks worth of free intervals then
5312 deallocate this block. */
5313 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
5315 *iprev
= iblk
->next
;
5316 /* Unhook from the free list. */
5317 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
5319 n_interval_blocks
--;
5323 num_free
+= this_free
;
5324 iprev
= &iblk
->next
;
5327 total_intervals
= num_used
;
5328 total_free_intervals
= num_free
;
5331 /* Put all unmarked symbols on free list */
5333 register struct symbol_block
*sblk
;
5334 struct symbol_block
**sprev
= &symbol_block
;
5335 register int lim
= symbol_block_index
;
5336 register int num_free
= 0, num_used
= 0;
5338 symbol_free_list
= NULL
;
5340 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
5343 struct Lisp_Symbol
*sym
= sblk
->symbols
;
5344 struct Lisp_Symbol
*end
= sym
+ lim
;
5346 for (; sym
< end
; ++sym
)
5348 /* Check if the symbol was created during loadup. In such a case
5349 it might be pointed to by pure bytecode which we don't trace,
5350 so we conservatively assume that it is live. */
5351 int pure_p
= PURE_POINTER_P (XSTRING (sym
->xname
));
5353 if (!sym
->gcmarkbit
&& !pure_p
)
5355 *(struct Lisp_Symbol
**) &sym
->value
= symbol_free_list
;
5356 symbol_free_list
= sym
;
5358 symbol_free_list
->function
= Vdead
;
5366 UNMARK_STRING (XSTRING (sym
->xname
));
5371 lim
= SYMBOL_BLOCK_SIZE
;
5372 /* If this block contains only free symbols and we have already
5373 seen more than two blocks worth of free symbols then deallocate
5375 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
5377 *sprev
= sblk
->next
;
5378 /* Unhook from the free list. */
5379 symbol_free_list
= *(struct Lisp_Symbol
**)&sblk
->symbols
[0].value
;
5385 num_free
+= this_free
;
5386 sprev
= &sblk
->next
;
5389 total_symbols
= num_used
;
5390 total_free_symbols
= num_free
;
5393 /* Put all unmarked misc's on free list.
5394 For a marker, first unchain it from the buffer it points into. */
5396 register struct marker_block
*mblk
;
5397 struct marker_block
**mprev
= &marker_block
;
5398 register int lim
= marker_block_index
;
5399 register int num_free
= 0, num_used
= 0;
5401 marker_free_list
= 0;
5403 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
5408 for (i
= 0; i
< lim
; i
++)
5410 if (!mblk
->markers
[i
].u_marker
.gcmarkbit
)
5412 if (mblk
->markers
[i
].u_marker
.type
== Lisp_Misc_Marker
)
5413 unchain_marker (&mblk
->markers
[i
].u_marker
);
5414 /* Set the type of the freed object to Lisp_Misc_Free.
5415 We could leave the type alone, since nobody checks it,
5416 but this might catch bugs faster. */
5417 mblk
->markers
[i
].u_marker
.type
= Lisp_Misc_Free
;
5418 mblk
->markers
[i
].u_free
.chain
= marker_free_list
;
5419 marker_free_list
= &mblk
->markers
[i
];
5425 mblk
->markers
[i
].u_marker
.gcmarkbit
= 0;
5428 lim
= MARKER_BLOCK_SIZE
;
5429 /* If this block contains only free markers and we have already
5430 seen more than two blocks worth of free markers then deallocate
5432 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
5434 *mprev
= mblk
->next
;
5435 /* Unhook from the free list. */
5436 marker_free_list
= mblk
->markers
[0].u_free
.chain
;
5442 num_free
+= this_free
;
5443 mprev
= &mblk
->next
;
5447 total_markers
= num_used
;
5448 total_free_markers
= num_free
;
5451 /* Free all unmarked buffers */
5453 register struct buffer
*buffer
= all_buffers
, *prev
= 0, *next
;
5456 if (!VECTOR_MARKED_P (buffer
))
5459 prev
->next
= buffer
->next
;
5461 all_buffers
= buffer
->next
;
5462 next
= buffer
->next
;
5468 VECTOR_UNMARK (buffer
);
5469 UNMARK_BALANCE_INTERVALS (BUF_INTERVALS (buffer
));
5470 prev
= buffer
, buffer
= buffer
->next
;
5474 /* Free all unmarked vectors */
5476 register struct Lisp_Vector
*vector
= all_vectors
, *prev
= 0, *next
;
5477 total_vector_size
= 0;
5480 if (!VECTOR_MARKED_P (vector
))
5483 prev
->next
= vector
->next
;
5485 all_vectors
= vector
->next
;
5486 next
= vector
->next
;
5494 VECTOR_UNMARK (vector
);
5495 if (vector
->size
& PSEUDOVECTOR_FLAG
)
5496 total_vector_size
+= (PSEUDOVECTOR_SIZE_MASK
& vector
->size
);
5498 total_vector_size
+= vector
->size
;
5499 prev
= vector
, vector
= vector
->next
;
5503 #ifdef GC_CHECK_STRING_BYTES
5504 if (!noninteractive
)
5505 check_string_bytes (1);
5512 /* Debugging aids. */
5514 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
5515 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
5516 This may be helpful in debugging Emacs's memory usage.
5517 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
5522 XSETINT (end
, (EMACS_INT
) sbrk (0) / 1024);
5527 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
5528 doc
: /* Return a list of counters that measure how much consing there has been.
5529 Each of these counters increments for a certain kind of object.
5530 The counters wrap around from the largest positive integer to zero.
5531 Garbage collection does not decrease them.
5532 The elements of the value are as follows:
5533 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
5534 All are in units of 1 = one object consed
5535 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
5537 MISCS include overlays, markers, and some internal types.
5538 Frames, windows, buffers, and subprocesses count as vectors
5539 (but the contents of a buffer's text do not count here). */)
5542 Lisp_Object consed
[8];
5544 consed
[0] = make_number (min (MOST_POSITIVE_FIXNUM
, cons_cells_consed
));
5545 consed
[1] = make_number (min (MOST_POSITIVE_FIXNUM
, floats_consed
));
5546 consed
[2] = make_number (min (MOST_POSITIVE_FIXNUM
, vector_cells_consed
));
5547 consed
[3] = make_number (min (MOST_POSITIVE_FIXNUM
, symbols_consed
));
5548 consed
[4] = make_number (min (MOST_POSITIVE_FIXNUM
, string_chars_consed
));
5549 consed
[5] = make_number (min (MOST_POSITIVE_FIXNUM
, misc_objects_consed
));
5550 consed
[6] = make_number (min (MOST_POSITIVE_FIXNUM
, intervals_consed
));
5551 consed
[7] = make_number (min (MOST_POSITIVE_FIXNUM
, strings_consed
));
5553 return Flist (8, consed
);
5556 int suppress_checking
;
5558 die (msg
, file
, line
)
5563 fprintf (stderr
, "\r\nEmacs fatal error: %s:%d: %s\r\n",
5568 /* Initialization */
5573 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
5575 pure_size
= PURESIZE
;
5576 pure_bytes_used
= 0;
5577 pure_bytes_used_before_overflow
= 0;
5579 /* Initialize the list of free aligned blocks. */
5582 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
5584 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
5588 ignore_warnings
= 1;
5589 #ifdef DOUG_LEA_MALLOC
5590 mallopt (M_TRIM_THRESHOLD
, 128*1024); /* trim threshold */
5591 mallopt (M_MMAP_THRESHOLD
, 64*1024); /* mmap threshold */
5592 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* max. number of mmap'ed areas */
5602 malloc_hysteresis
= 32;
5604 malloc_hysteresis
= 0;
5607 spare_memory
= (char *) malloc (SPARE_MEMORY
);
5609 ignore_warnings
= 0;
5611 byte_stack_list
= 0;
5613 consing_since_gc
= 0;
5614 gc_cons_threshold
= 100000 * sizeof (Lisp_Object
);
5615 #ifdef VIRT_ADDR_VARIES
5616 malloc_sbrk_unused
= 1<<22; /* A large number */
5617 malloc_sbrk_used
= 100000; /* as reasonable as any number */
5618 #endif /* VIRT_ADDR_VARIES */
5625 byte_stack_list
= 0;
5627 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
5628 setjmp_tested_p
= longjmps_done
= 0;
5631 Vgc_elapsed
= make_float (0.0);
5638 DEFVAR_INT ("gc-cons-threshold", &gc_cons_threshold
,
5639 doc
: /* *Number of bytes of consing between garbage collections.
5640 Garbage collection can happen automatically once this many bytes have been
5641 allocated since the last garbage collection. All data types count.
5643 Garbage collection happens automatically only when `eval' is called.
5645 By binding this temporarily to a large number, you can effectively
5646 prevent garbage collection during a part of the program. */);
5648 DEFVAR_INT ("pure-bytes-used", &pure_bytes_used
,
5649 doc
: /* Number of bytes of sharable Lisp data allocated so far. */);
5651 DEFVAR_INT ("cons-cells-consed", &cons_cells_consed
,
5652 doc
: /* Number of cons cells that have been consed so far. */);
5654 DEFVAR_INT ("floats-consed", &floats_consed
,
5655 doc
: /* Number of floats that have been consed so far. */);
5657 DEFVAR_INT ("vector-cells-consed", &vector_cells_consed
,
5658 doc
: /* Number of vector cells that have been consed so far. */);
5660 DEFVAR_INT ("symbols-consed", &symbols_consed
,
5661 doc
: /* Number of symbols that have been consed so far. */);
5663 DEFVAR_INT ("string-chars-consed", &string_chars_consed
,
5664 doc
: /* Number of string characters that have been consed so far. */);
5666 DEFVAR_INT ("misc-objects-consed", &misc_objects_consed
,
5667 doc
: /* Number of miscellaneous objects that have been consed so far. */);
5669 DEFVAR_INT ("intervals-consed", &intervals_consed
,
5670 doc
: /* Number of intervals that have been consed so far. */);
5672 DEFVAR_INT ("strings-consed", &strings_consed
,
5673 doc
: /* Number of strings that have been consed so far. */);
5675 DEFVAR_LISP ("purify-flag", &Vpurify_flag
,
5676 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
5677 This means that certain objects should be allocated in shared (pure) space. */);
5679 DEFVAR_INT ("undo-limit", &undo_limit
,
5680 doc
: /* Keep no more undo information once it exceeds this size.
5681 This limit is applied when garbage collection happens.
5682 The size is counted as the number of bytes occupied,
5683 which includes both saved text and other data. */);
5686 DEFVAR_INT ("undo-strong-limit", &undo_strong_limit
,
5687 doc
: /* Don't keep more than this much size of undo information.
5688 A command which pushes past this size is itself forgotten.
5689 This limit is applied when garbage collection happens.
5690 The size is counted as the number of bytes occupied,
5691 which includes both saved text and other data. */);
5692 undo_strong_limit
= 30000;
5694 DEFVAR_BOOL ("garbage-collection-messages", &garbage_collection_messages
,
5695 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
5696 garbage_collection_messages
= 0;
5698 DEFVAR_LISP ("post-gc-hook", &Vpost_gc_hook
,
5699 doc
: /* Hook run after garbage collection has finished. */);
5700 Vpost_gc_hook
= Qnil
;
5701 Qpost_gc_hook
= intern ("post-gc-hook");
5702 staticpro (&Qpost_gc_hook
);
5704 DEFVAR_LISP ("memory-signal-data", &Vmemory_signal_data
,
5705 doc
: /* Precomputed `signal' argument for memory-full error. */);
5706 /* We build this in advance because if we wait until we need it, we might
5707 not be able to allocate the memory to hold it. */
5710 build_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"));
5712 DEFVAR_LISP ("memory-full", &Vmemory_full
,
5713 doc
: /* Non-nil means we are handling a memory-full error. */);
5714 Vmemory_full
= Qnil
;
5716 staticpro (&Qgc_cons_threshold
);
5717 Qgc_cons_threshold
= intern ("gc-cons-threshold");
5719 staticpro (&Qchar_table_extra_slots
);
5720 Qchar_table_extra_slots
= intern ("char-table-extra-slots");
5722 DEFVAR_LISP ("gc-elapsed", &Vgc_elapsed
,
5723 doc
: /* Accumulated time elapsed in garbage collections.
5724 The time is in seconds as a floating point value. */);
5725 DEFVAR_INT ("gcs-done", &gcs_done
,
5726 doc
: /* Accumulated number of garbage collections done. */);
5731 defsubr (&Smake_byte_code
);
5732 defsubr (&Smake_list
);
5733 defsubr (&Smake_vector
);
5734 defsubr (&Smake_string
);
5735 defsubr (&Smake_bool_vector
);
5736 defsubr (&Smake_symbol
);
5737 defsubr (&Smake_marker
);
5738 defsubr (&Spurecopy
);
5739 defsubr (&Sgarbage_collect
);
5740 defsubr (&Smemory_limit
);
5741 defsubr (&Smemory_use_counts
);
5743 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5744 defsubr (&Sgc_status
);