1 /* Storage allocation and gc for GNU Emacs Lisp interpreter.
2 Copyright (C) 1985,86,88,93,94,95,97,98,1999,2000,01,02,03,2004
3 Free Software Foundation, Inc.
5 This file is part of GNU Emacs.
7 GNU Emacs is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU Emacs is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU Emacs; see the file COPYING. If not, write to
19 the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
24 #include <limits.h> /* For CHAR_BIT. */
30 /* Note that this declares bzero on OSF/1. How dumb. */
34 /* This file is part of the core Lisp implementation, and thus must
35 deal with the real data structures. If the Lisp implementation is
36 replaced, this file likely will not be used. */
38 #undef HIDE_LISP_IMPLEMENTATION
41 #include "intervals.h"
47 #include "blockinput.h"
49 #include "syssignal.h"
52 /* GC_MALLOC_CHECK defined means perform validity checks of malloc'd
53 memory. Can do this only if using gmalloc.c. */
55 #if defined SYSTEM_MALLOC || defined DOUG_LEA_MALLOC
56 #undef GC_MALLOC_CHECK
62 extern POINTER_TYPE
*sbrk ();
65 #ifdef DOUG_LEA_MALLOC
68 /* malloc.h #defines this as size_t, at least in glibc2. */
69 #ifndef __malloc_size_t
70 #define __malloc_size_t int
73 /* Specify maximum number of areas to mmap. It would be nice to use a
74 value that explicitly means "no limit". */
76 #define MMAP_MAX_AREAS 100000000
78 #else /* not DOUG_LEA_MALLOC */
80 /* The following come from gmalloc.c. */
82 #define __malloc_size_t size_t
83 extern __malloc_size_t _bytes_used
;
84 extern __malloc_size_t __malloc_extra_blocks
;
86 #endif /* not DOUG_LEA_MALLOC */
88 /* Value of _bytes_used, when spare_memory was freed. */
90 static __malloc_size_t bytes_used_when_full
;
92 /* Mark, unmark, query mark bit of a Lisp string. S must be a pointer
93 to a struct Lisp_String. */
95 #define MARK_STRING(S) ((S)->size |= ARRAY_MARK_FLAG)
96 #define UNMARK_STRING(S) ((S)->size &= ~ARRAY_MARK_FLAG)
97 #define STRING_MARKED_P(S) ((S)->size & ARRAY_MARK_FLAG)
99 #define VECTOR_MARK(V) ((V)->size |= ARRAY_MARK_FLAG)
100 #define VECTOR_UNMARK(V) ((V)->size &= ~ARRAY_MARK_FLAG)
101 #define VECTOR_MARKED_P(V) ((V)->size & ARRAY_MARK_FLAG)
103 /* Value is the number of bytes/chars of S, a pointer to a struct
104 Lisp_String. This must be used instead of STRING_BYTES (S) or
105 S->size during GC, because S->size contains the mark bit for
108 #define GC_STRING_BYTES(S) (STRING_BYTES (S))
109 #define GC_STRING_CHARS(S) ((S)->size & ~ARRAY_MARK_FLAG)
111 /* Number of bytes of consing done since the last gc. */
113 int consing_since_gc
;
115 /* Count the amount of consing of various sorts of space. */
117 EMACS_INT cons_cells_consed
;
118 EMACS_INT floats_consed
;
119 EMACS_INT vector_cells_consed
;
120 EMACS_INT symbols_consed
;
121 EMACS_INT string_chars_consed
;
122 EMACS_INT misc_objects_consed
;
123 EMACS_INT intervals_consed
;
124 EMACS_INT strings_consed
;
126 /* Number of bytes of consing since GC before another GC should be done. */
128 EMACS_INT gc_cons_threshold
;
130 /* Nonzero during GC. */
134 /* Nonzero means abort if try to GC.
135 This is for code which is written on the assumption that
136 no GC will happen, so as to verify that assumption. */
140 /* Nonzero means display messages at beginning and end of GC. */
142 int garbage_collection_messages
;
144 #ifndef VIRT_ADDR_VARIES
146 #endif /* VIRT_ADDR_VARIES */
147 int malloc_sbrk_used
;
149 #ifndef VIRT_ADDR_VARIES
151 #endif /* VIRT_ADDR_VARIES */
152 int malloc_sbrk_unused
;
154 /* Two limits controlling how much undo information to keep. */
156 EMACS_INT undo_limit
;
157 EMACS_INT undo_strong_limit
;
159 /* Number of live and free conses etc. */
161 static int total_conses
, total_markers
, total_symbols
, total_vector_size
;
162 static int total_free_conses
, total_free_markers
, total_free_symbols
;
163 static int total_free_floats
, total_floats
;
165 /* Points to memory space allocated as "spare", to be freed if we run
168 static char *spare_memory
;
170 /* Amount of spare memory to keep in reserve. */
172 #define SPARE_MEMORY (1 << 14)
174 /* Number of extra blocks malloc should get when it needs more core. */
176 static int malloc_hysteresis
;
178 /* Non-nil means defun should do purecopy on the function definition. */
180 Lisp_Object Vpurify_flag
;
182 /* Non-nil means we are handling a memory-full error. */
184 Lisp_Object Vmemory_full
;
188 /* Force it into data space! Initialize it to a nonzero value;
189 otherwise some compilers put it into BSS. */
191 EMACS_INT pure
[PURESIZE
/ sizeof (EMACS_INT
)] = {1,};
192 #define PUREBEG (char *) pure
196 #define pure PURE_SEG_BITS /* Use shared memory segment */
197 #define PUREBEG (char *)PURE_SEG_BITS
199 #endif /* HAVE_SHM */
201 /* Pointer to the pure area, and its size. */
203 static char *purebeg
;
204 static size_t pure_size
;
206 /* Number of bytes of pure storage used before pure storage overflowed.
207 If this is non-zero, this implies that an overflow occurred. */
209 static size_t pure_bytes_used_before_overflow
;
211 /* Value is non-zero if P points into pure space. */
213 #define PURE_POINTER_P(P) \
214 (((PNTR_COMPARISON_TYPE) (P) \
215 < (PNTR_COMPARISON_TYPE) ((char *) purebeg + pure_size)) \
216 && ((PNTR_COMPARISON_TYPE) (P) \
217 >= (PNTR_COMPARISON_TYPE) purebeg))
219 /* Index in pure at which next pure object will be allocated.. */
221 EMACS_INT pure_bytes_used
;
223 /* If nonzero, this is a warning delivered by malloc and not yet
226 char *pending_malloc_warning
;
228 /* Pre-computed signal argument for use when memory is exhausted. */
230 Lisp_Object Vmemory_signal_data
;
232 /* Maximum amount of C stack to save when a GC happens. */
234 #ifndef MAX_SAVE_STACK
235 #define MAX_SAVE_STACK 16000
238 /* Buffer in which we save a copy of the C stack at each GC. */
243 /* Non-zero means ignore malloc warnings. Set during initialization.
244 Currently not used. */
248 Lisp_Object Qgc_cons_threshold
, Qchar_table_extra_slots
;
250 /* Hook run after GC has finished. */
252 Lisp_Object Vpost_gc_hook
, Qpost_gc_hook
;
254 Lisp_Object Vgc_elapsed
; /* accumulated elapsed time in GC */
255 EMACS_INT gcs_done
; /* accumulated GCs */
257 static void mark_buffer
P_ ((Lisp_Object
));
258 extern void mark_kboards
P_ ((void));
259 static void gc_sweep
P_ ((void));
260 static void mark_glyph_matrix
P_ ((struct glyph_matrix
*));
261 static void mark_face_cache
P_ ((struct face_cache
*));
263 #ifdef HAVE_WINDOW_SYSTEM
264 static void mark_image
P_ ((struct image
*));
265 static void mark_image_cache
P_ ((struct frame
*));
266 #endif /* HAVE_WINDOW_SYSTEM */
268 static struct Lisp_String
*allocate_string
P_ ((void));
269 static void compact_small_strings
P_ ((void));
270 static void free_large_strings
P_ ((void));
271 static void sweep_strings
P_ ((void));
273 extern int message_enable_multibyte
;
275 /* When scanning the C stack for live Lisp objects, Emacs keeps track
276 of what memory allocated via lisp_malloc is intended for what
277 purpose. This enumeration specifies the type of memory. */
288 /* Keep the following vector-like types together, with
289 MEM_TYPE_WINDOW being the last, and MEM_TYPE_VECTOR the
290 first. Or change the code of live_vector_p, for instance. */
298 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
300 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
301 #include <stdio.h> /* For fprintf. */
304 /* A unique object in pure space used to make some Lisp objects
305 on free lists recognizable in O(1). */
309 #ifdef GC_MALLOC_CHECK
311 enum mem_type allocated_mem_type
;
312 int dont_register_blocks
;
314 #endif /* GC_MALLOC_CHECK */
316 /* A node in the red-black tree describing allocated memory containing
317 Lisp data. Each such block is recorded with its start and end
318 address when it is allocated, and removed from the tree when it
321 A red-black tree is a balanced binary tree with the following
324 1. Every node is either red or black.
325 2. Every leaf is black.
326 3. If a node is red, then both of its children are black.
327 4. Every simple path from a node to a descendant leaf contains
328 the same number of black nodes.
329 5. The root is always black.
331 When nodes are inserted into the tree, or deleted from the tree,
332 the tree is "fixed" so that these properties are always true.
334 A red-black tree with N internal nodes has height at most 2
335 log(N+1). Searches, insertions and deletions are done in O(log N).
336 Please see a text book about data structures for a detailed
337 description of red-black trees. Any book worth its salt should
342 /* Children of this node. These pointers are never NULL. When there
343 is no child, the value is MEM_NIL, which points to a dummy node. */
344 struct mem_node
*left
, *right
;
346 /* The parent of this node. In the root node, this is NULL. */
347 struct mem_node
*parent
;
349 /* Start and end of allocated region. */
353 enum {MEM_BLACK
, MEM_RED
} color
;
359 /* Base address of stack. Set in main. */
361 Lisp_Object
*stack_base
;
363 /* Root of the tree describing allocated Lisp memory. */
365 static struct mem_node
*mem_root
;
367 /* Lowest and highest known address in the heap. */
369 static void *min_heap_address
, *max_heap_address
;
371 /* Sentinel node of the tree. */
373 static struct mem_node mem_z
;
374 #define MEM_NIL &mem_z
376 static POINTER_TYPE
*lisp_malloc
P_ ((size_t, enum mem_type
));
377 static struct Lisp_Vector
*allocate_vectorlike
P_ ((EMACS_INT
, enum mem_type
));
378 static void lisp_free
P_ ((POINTER_TYPE
*));
379 static void mark_stack
P_ ((void));
380 static int live_vector_p
P_ ((struct mem_node
*, void *));
381 static int live_buffer_p
P_ ((struct mem_node
*, void *));
382 static int live_string_p
P_ ((struct mem_node
*, void *));
383 static int live_cons_p
P_ ((struct mem_node
*, void *));
384 static int live_symbol_p
P_ ((struct mem_node
*, void *));
385 static int live_float_p
P_ ((struct mem_node
*, void *));
386 static int live_misc_p
P_ ((struct mem_node
*, void *));
387 static void mark_maybe_object
P_ ((Lisp_Object
));
388 static void mark_memory
P_ ((void *, void *));
389 static void mem_init
P_ ((void));
390 static struct mem_node
*mem_insert
P_ ((void *, void *, enum mem_type
));
391 static void mem_insert_fixup
P_ ((struct mem_node
*));
392 static void mem_rotate_left
P_ ((struct mem_node
*));
393 static void mem_rotate_right
P_ ((struct mem_node
*));
394 static void mem_delete
P_ ((struct mem_node
*));
395 static void mem_delete_fixup
P_ ((struct mem_node
*));
396 static INLINE
struct mem_node
*mem_find
P_ ((void *));
398 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
399 static void check_gcpros
P_ ((void));
402 #endif /* GC_MARK_STACK || GC_MALLOC_CHECK */
404 /* Recording what needs to be marked for gc. */
406 struct gcpro
*gcprolist
;
408 /* Addresses of staticpro'd variables. Initialize it to a nonzero
409 value; otherwise some compilers put it into BSS. */
411 #define NSTATICS 1280
412 Lisp_Object
*staticvec
[NSTATICS
] = {&Vpurify_flag
};
414 /* Index of next unused slot in staticvec. */
418 static POINTER_TYPE
*pure_alloc
P_ ((size_t, int));
421 /* Value is SZ rounded up to the next multiple of ALIGNMENT.
422 ALIGNMENT must be a power of 2. */
424 #define ALIGN(ptr, ALIGNMENT) \
425 ((POINTER_TYPE *) ((((EMACS_UINT)(ptr)) + (ALIGNMENT) - 1) \
426 & ~((ALIGNMENT) - 1)))
430 /************************************************************************
432 ************************************************************************/
434 /* Function malloc calls this if it finds we are near exhausting storage. */
440 pending_malloc_warning
= str
;
444 /* Display an already-pending malloc warning. */
447 display_malloc_warning ()
449 call3 (intern ("display-warning"),
451 build_string (pending_malloc_warning
),
452 intern ("emergency"));
453 pending_malloc_warning
= 0;
457 #ifdef DOUG_LEA_MALLOC
458 # define BYTES_USED (mallinfo ().arena)
460 # define BYTES_USED _bytes_used
464 /* Called if malloc returns zero. */
471 #ifndef SYSTEM_MALLOC
472 bytes_used_when_full
= BYTES_USED
;
475 /* The first time we get here, free the spare memory. */
482 /* This used to call error, but if we've run out of memory, we could
483 get infinite recursion trying to build the string. */
485 Fsignal (Qnil
, Vmemory_signal_data
);
489 /* Called if we can't allocate relocatable space for a buffer. */
492 buffer_memory_full ()
494 /* If buffers use the relocating allocator, no need to free
495 spare_memory, because we may have plenty of malloc space left
496 that we could get, and if we don't, the malloc that fails will
497 itself cause spare_memory to be freed. If buffers don't use the
498 relocating allocator, treat this like any other failing
507 /* This used to call error, but if we've run out of memory, we could
508 get infinite recursion trying to build the string. */
510 Fsignal (Qnil
, Vmemory_signal_data
);
514 /* Like malloc but check for no memory and block interrupt input.. */
520 register POINTER_TYPE
*val
;
523 val
= (POINTER_TYPE
*) malloc (size
);
532 /* Like realloc but check for no memory and block interrupt input.. */
535 xrealloc (block
, size
)
539 register POINTER_TYPE
*val
;
542 /* We must call malloc explicitly when BLOCK is 0, since some
543 reallocs don't do this. */
545 val
= (POINTER_TYPE
*) malloc (size
);
547 val
= (POINTER_TYPE
*) realloc (block
, size
);
550 if (!val
&& size
) memory_full ();
555 /* Like free but block interrupt input. */
567 /* Like strdup, but uses xmalloc. */
573 size_t len
= strlen (s
) + 1;
574 char *p
= (char *) xmalloc (len
);
580 /* Like malloc but used for allocating Lisp data. NBYTES is the
581 number of bytes to allocate, TYPE describes the intended use of the
582 allcated memory block (for strings, for conses, ...). */
584 static void *lisp_malloc_loser
;
586 static POINTER_TYPE
*
587 lisp_malloc (nbytes
, type
)
595 #ifdef GC_MALLOC_CHECK
596 allocated_mem_type
= type
;
599 val
= (void *) malloc (nbytes
);
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 & (long) 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
;
742 EMACS_INT aligned
; /* int gets warning casting to 64-bit pointer. */
744 #ifdef DOUG_LEA_MALLOC
745 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
746 because mapped region contents are not preserved in
748 mallopt (M_MMAP_MAX
, 0);
751 #ifdef HAVE_POSIX_MEMALIGN
753 int err
= posix_memalign (&base
, BLOCK_ALIGN
, ABLOCKS_BYTES
);
754 abase
= err
? (base
= NULL
) : base
;
757 base
= malloc (ABLOCKS_BYTES
);
758 abase
= ALIGN (base
, BLOCK_ALIGN
);
766 aligned
= (base
== abase
);
768 ((void**)abase
)[-1] = base
;
770 #ifdef DOUG_LEA_MALLOC
771 /* Back to a reasonable maximum of mmap'ed areas. */
772 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
775 /* If the memory just allocated cannot be addressed thru a Lisp
776 object's pointer, and it needs to be, that's equivalent to
777 running out of memory. */
778 if (type
!= MEM_TYPE_NON_LISP
)
781 char *end
= (char *) base
+ ABLOCKS_BYTES
- 1;
783 if ((char *) XCONS (tem
) != end
)
785 lisp_malloc_loser
= base
;
792 /* Initialize the blocks and put them on the free list.
793 Is `base' was not properly aligned, we can't use the last block. */
794 for (i
= 0; i
< (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1); i
++)
796 abase
->blocks
[i
].abase
= abase
;
797 abase
->blocks
[i
].x
.next_free
= free_ablock
;
798 free_ablock
= &abase
->blocks
[i
];
800 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (long) aligned
;
802 eassert (0 == ((EMACS_UINT
)abase
) % BLOCK_ALIGN
);
803 eassert (ABLOCK_ABASE (&abase
->blocks
[3]) == abase
); /* 3 is arbitrary */
804 eassert (ABLOCK_ABASE (&abase
->blocks
[0]) == abase
);
805 eassert (ABLOCKS_BASE (abase
) == base
);
806 eassert (aligned
== (long) ABLOCKS_BUSY (abase
));
809 abase
= ABLOCK_ABASE (free_ablock
);
810 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (2 + (long) ABLOCKS_BUSY (abase
));
812 free_ablock
= free_ablock
->x
.next_free
;
814 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
815 if (val
&& type
!= MEM_TYPE_NON_LISP
)
816 mem_insert (val
, (char *) val
+ nbytes
, type
);
823 eassert (0 == ((EMACS_UINT
)val
) % BLOCK_ALIGN
);
828 lisp_align_free (block
)
831 struct ablock
*ablock
= block
;
832 struct ablocks
*abase
= ABLOCK_ABASE (ablock
);
835 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
836 mem_delete (mem_find (block
));
838 /* Put on free list. */
839 ablock
->x
.next_free
= free_ablock
;
840 free_ablock
= ablock
;
841 /* Update busy count. */
842 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (-2 + (long) ABLOCKS_BUSY (abase
));
844 if (2 > (long) ABLOCKS_BUSY (abase
))
845 { /* All the blocks are free. */
846 int i
= 0, aligned
= (long) ABLOCKS_BUSY (abase
);
847 struct ablock
**tem
= &free_ablock
;
848 struct ablock
*atop
= &abase
->blocks
[aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1];
852 if (*tem
>= (struct ablock
*) abase
&& *tem
< atop
)
855 *tem
= (*tem
)->x
.next_free
;
858 tem
= &(*tem
)->x
.next_free
;
860 eassert ((aligned
& 1) == aligned
);
861 eassert (i
== (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1));
862 free (ABLOCKS_BASE (abase
));
867 /* Return a new buffer structure allocated from the heap with
868 a call to lisp_malloc. */
874 = (struct buffer
*) lisp_malloc (sizeof (struct buffer
),
880 /* Arranging to disable input signals while we're in malloc.
882 This only works with GNU malloc. To help out systems which can't
883 use GNU malloc, all the calls to malloc, realloc, and free
884 elsewhere in the code should be inside a BLOCK_INPUT/UNBLOCK_INPUT
885 pairs; unfortunately, we have no idea what C library functions
886 might call malloc, so we can't really protect them unless you're
887 using GNU malloc. Fortunately, most of the major operating systems
888 can use GNU malloc. */
890 #ifndef SYSTEM_MALLOC
891 #ifndef DOUG_LEA_MALLOC
892 extern void * (*__malloc_hook
) P_ ((size_t));
893 extern void * (*__realloc_hook
) P_ ((void *, size_t));
894 extern void (*__free_hook
) P_ ((void *));
895 /* Else declared in malloc.h, perhaps with an extra arg. */
896 #endif /* DOUG_LEA_MALLOC */
897 static void * (*old_malloc_hook
) ();
898 static void * (*old_realloc_hook
) ();
899 static void (*old_free_hook
) ();
901 /* This function is used as the hook for free to call. */
904 emacs_blocked_free (ptr
)
909 #ifdef GC_MALLOC_CHECK
915 if (m
== MEM_NIL
|| m
->start
!= ptr
)
918 "Freeing `%p' which wasn't allocated with malloc\n", ptr
);
923 /* fprintf (stderr, "free %p...%p (%p)\n", m->start, m->end, ptr); */
927 #endif /* GC_MALLOC_CHECK */
929 __free_hook
= old_free_hook
;
932 /* If we released our reserve (due to running out of memory),
933 and we have a fair amount free once again,
934 try to set aside another reserve in case we run out once more. */
935 if (spare_memory
== 0
936 /* Verify there is enough space that even with the malloc
937 hysteresis this call won't run out again.
938 The code here is correct as long as SPARE_MEMORY
939 is substantially larger than the block size malloc uses. */
940 && (bytes_used_when_full
941 > BYTES_USED
+ max (malloc_hysteresis
, 4) * SPARE_MEMORY
))
942 spare_memory
= (char *) malloc ((size_t) SPARE_MEMORY
);
944 __free_hook
= emacs_blocked_free
;
949 /* If we released our reserve (due to running out of memory),
950 and we have a fair amount free once again,
951 try to set aside another reserve in case we run out once more.
953 This is called when a relocatable block is freed in ralloc.c. */
956 refill_memory_reserve ()
958 if (spare_memory
== 0)
959 spare_memory
= (char *) malloc ((size_t) SPARE_MEMORY
);
963 /* This function is the malloc hook that Emacs uses. */
966 emacs_blocked_malloc (size
)
972 __malloc_hook
= old_malloc_hook
;
973 #ifdef DOUG_LEA_MALLOC
974 mallopt (M_TOP_PAD
, malloc_hysteresis
* 4096);
976 __malloc_extra_blocks
= malloc_hysteresis
;
979 value
= (void *) malloc (size
);
981 #ifdef GC_MALLOC_CHECK
983 struct mem_node
*m
= mem_find (value
);
986 fprintf (stderr
, "Malloc returned %p which is already in use\n",
988 fprintf (stderr
, "Region in use is %p...%p, %u bytes, type %d\n",
989 m
->start
, m
->end
, (char *) m
->end
- (char *) m
->start
,
994 if (!dont_register_blocks
)
996 mem_insert (value
, (char *) value
+ max (1, size
), allocated_mem_type
);
997 allocated_mem_type
= MEM_TYPE_NON_LISP
;
1000 #endif /* GC_MALLOC_CHECK */
1002 __malloc_hook
= emacs_blocked_malloc
;
1005 /* fprintf (stderr, "%p malloc\n", value); */
1010 /* This function is the realloc hook that Emacs uses. */
1013 emacs_blocked_realloc (ptr
, size
)
1020 __realloc_hook
= old_realloc_hook
;
1022 #ifdef GC_MALLOC_CHECK
1025 struct mem_node
*m
= mem_find (ptr
);
1026 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1029 "Realloc of %p which wasn't allocated with malloc\n",
1037 /* fprintf (stderr, "%p -> realloc\n", ptr); */
1039 /* Prevent malloc from registering blocks. */
1040 dont_register_blocks
= 1;
1041 #endif /* GC_MALLOC_CHECK */
1043 value
= (void *) realloc (ptr
, size
);
1045 #ifdef GC_MALLOC_CHECK
1046 dont_register_blocks
= 0;
1049 struct mem_node
*m
= mem_find (value
);
1052 fprintf (stderr
, "Realloc returns memory that is already in use\n");
1056 /* Can't handle zero size regions in the red-black tree. */
1057 mem_insert (value
, (char *) value
+ max (size
, 1), MEM_TYPE_NON_LISP
);
1060 /* fprintf (stderr, "%p <- realloc\n", value); */
1061 #endif /* GC_MALLOC_CHECK */
1063 __realloc_hook
= emacs_blocked_realloc
;
1070 /* Called from main to set up malloc to use our hooks. */
1073 uninterrupt_malloc ()
1075 if (__free_hook
!= emacs_blocked_free
)
1076 old_free_hook
= __free_hook
;
1077 __free_hook
= emacs_blocked_free
;
1079 if (__malloc_hook
!= emacs_blocked_malloc
)
1080 old_malloc_hook
= __malloc_hook
;
1081 __malloc_hook
= emacs_blocked_malloc
;
1083 if (__realloc_hook
!= emacs_blocked_realloc
)
1084 old_realloc_hook
= __realloc_hook
;
1085 __realloc_hook
= emacs_blocked_realloc
;
1088 #endif /* not SYSTEM_MALLOC */
1092 /***********************************************************************
1094 ***********************************************************************/
1096 /* Number of intervals allocated in an interval_block structure.
1097 The 1020 is 1024 minus malloc overhead. */
1099 #define INTERVAL_BLOCK_SIZE \
1100 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
1102 /* Intervals are allocated in chunks in form of an interval_block
1105 struct interval_block
1107 /* Place `intervals' first, to preserve alignment. */
1108 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
1109 struct interval_block
*next
;
1112 /* Current interval block. Its `next' pointer points to older
1115 struct interval_block
*interval_block
;
1117 /* Index in interval_block above of the next unused interval
1120 static int interval_block_index
;
1122 /* Number of free and live intervals. */
1124 static int total_free_intervals
, total_intervals
;
1126 /* List of free intervals. */
1128 INTERVAL interval_free_list
;
1130 /* Total number of interval blocks now in use. */
1132 int n_interval_blocks
;
1135 /* Initialize interval allocation. */
1140 interval_block
= NULL
;
1141 interval_block_index
= INTERVAL_BLOCK_SIZE
;
1142 interval_free_list
= 0;
1143 n_interval_blocks
= 0;
1147 /* Return a new interval. */
1154 if (interval_free_list
)
1156 val
= interval_free_list
;
1157 interval_free_list
= INTERVAL_PARENT (interval_free_list
);
1161 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
1163 register struct interval_block
*newi
;
1165 newi
= (struct interval_block
*) lisp_malloc (sizeof *newi
,
1168 newi
->next
= interval_block
;
1169 interval_block
= newi
;
1170 interval_block_index
= 0;
1171 n_interval_blocks
++;
1173 val
= &interval_block
->intervals
[interval_block_index
++];
1175 consing_since_gc
+= sizeof (struct interval
);
1177 RESET_INTERVAL (val
);
1183 /* Mark Lisp objects in interval I. */
1186 mark_interval (i
, dummy
)
1187 register INTERVAL i
;
1190 eassert (!i
->gcmarkbit
); /* Intervals are never shared. */
1192 mark_object (i
->plist
);
1196 /* Mark the interval tree rooted in TREE. Don't call this directly;
1197 use the macro MARK_INTERVAL_TREE instead. */
1200 mark_interval_tree (tree
)
1201 register INTERVAL tree
;
1203 /* No need to test if this tree has been marked already; this
1204 function is always called through the MARK_INTERVAL_TREE macro,
1205 which takes care of that. */
1207 traverse_intervals_noorder (tree
, mark_interval
, Qnil
);
1211 /* Mark the interval tree rooted in I. */
1213 #define MARK_INTERVAL_TREE(i) \
1215 if (!NULL_INTERVAL_P (i) && !i->gcmarkbit) \
1216 mark_interval_tree (i); \
1220 #define UNMARK_BALANCE_INTERVALS(i) \
1222 if (! NULL_INTERVAL_P (i)) \
1223 (i) = balance_intervals (i); \
1227 /* Number support. If NO_UNION_TYPE isn't in effect, we
1228 can't create number objects in macros. */
1236 obj
.s
.type
= Lisp_Int
;
1241 /***********************************************************************
1243 ***********************************************************************/
1245 /* Lisp_Strings are allocated in string_block structures. When a new
1246 string_block is allocated, all the Lisp_Strings it contains are
1247 added to a free-list string_free_list. When a new Lisp_String is
1248 needed, it is taken from that list. During the sweep phase of GC,
1249 string_blocks that are entirely free are freed, except two which
1252 String data is allocated from sblock structures. Strings larger
1253 than LARGE_STRING_BYTES, get their own sblock, data for smaller
1254 strings is sub-allocated out of sblocks of size SBLOCK_SIZE.
1256 Sblocks consist internally of sdata structures, one for each
1257 Lisp_String. The sdata structure points to the Lisp_String it
1258 belongs to. The Lisp_String points back to the `u.data' member of
1259 its sdata structure.
1261 When a Lisp_String is freed during GC, it is put back on
1262 string_free_list, and its `data' member and its sdata's `string'
1263 pointer is set to null. The size of the string is recorded in the
1264 `u.nbytes' member of the sdata. So, sdata structures that are no
1265 longer used, can be easily recognized, and it's easy to compact the
1266 sblocks of small strings which we do in compact_small_strings. */
1268 /* Size in bytes of an sblock structure used for small strings. This
1269 is 8192 minus malloc overhead. */
1271 #define SBLOCK_SIZE 8188
1273 /* Strings larger than this are considered large strings. String data
1274 for large strings is allocated from individual sblocks. */
1276 #define LARGE_STRING_BYTES 1024
1278 /* Structure describing string memory sub-allocated from an sblock.
1279 This is where the contents of Lisp strings are stored. */
1283 /* Back-pointer to the string this sdata belongs to. If null, this
1284 structure is free, and the NBYTES member of the union below
1285 contains the string's byte size (the same value that STRING_BYTES
1286 would return if STRING were non-null). If non-null, STRING_BYTES
1287 (STRING) is the size of the data, and DATA contains the string's
1289 struct Lisp_String
*string
;
1291 #ifdef GC_CHECK_STRING_BYTES
1294 unsigned char data
[1];
1296 #define SDATA_NBYTES(S) (S)->nbytes
1297 #define SDATA_DATA(S) (S)->data
1299 #else /* not GC_CHECK_STRING_BYTES */
1303 /* When STRING in non-null. */
1304 unsigned char data
[1];
1306 /* When STRING is null. */
1311 #define SDATA_NBYTES(S) (S)->u.nbytes
1312 #define SDATA_DATA(S) (S)->u.data
1314 #endif /* not GC_CHECK_STRING_BYTES */
1318 /* Structure describing a block of memory which is sub-allocated to
1319 obtain string data memory for strings. Blocks for small strings
1320 are of fixed size SBLOCK_SIZE. Blocks for large strings are made
1321 as large as needed. */
1326 struct sblock
*next
;
1328 /* Pointer to the next free sdata block. This points past the end
1329 of the sblock if there isn't any space left in this block. */
1330 struct sdata
*next_free
;
1332 /* Start of data. */
1333 struct sdata first_data
;
1336 /* Number of Lisp strings in a string_block structure. The 1020 is
1337 1024 minus malloc overhead. */
1339 #define STRING_BLOCK_SIZE \
1340 ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String))
1342 /* Structure describing a block from which Lisp_String structures
1347 /* Place `strings' first, to preserve alignment. */
1348 struct Lisp_String strings
[STRING_BLOCK_SIZE
];
1349 struct string_block
*next
;
1352 /* Head and tail of the list of sblock structures holding Lisp string
1353 data. We always allocate from current_sblock. The NEXT pointers
1354 in the sblock structures go from oldest_sblock to current_sblock. */
1356 static struct sblock
*oldest_sblock
, *current_sblock
;
1358 /* List of sblocks for large strings. */
1360 static struct sblock
*large_sblocks
;
1362 /* List of string_block structures, and how many there are. */
1364 static struct string_block
*string_blocks
;
1365 static int n_string_blocks
;
1367 /* Free-list of Lisp_Strings. */
1369 static struct Lisp_String
*string_free_list
;
1371 /* Number of live and free Lisp_Strings. */
1373 static int total_strings
, total_free_strings
;
1375 /* Number of bytes used by live strings. */
1377 static int total_string_size
;
1379 /* Given a pointer to a Lisp_String S which is on the free-list
1380 string_free_list, return a pointer to its successor in the
1383 #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S))
1385 /* Return a pointer to the sdata structure belonging to Lisp string S.
1386 S must be live, i.e. S->data must not be null. S->data is actually
1387 a pointer to the `u.data' member of its sdata structure; the
1388 structure starts at a constant offset in front of that. */
1390 #ifdef GC_CHECK_STRING_BYTES
1392 #define SDATA_OF_STRING(S) \
1393 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *) \
1394 - sizeof (EMACS_INT)))
1396 #else /* not GC_CHECK_STRING_BYTES */
1398 #define SDATA_OF_STRING(S) \
1399 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *)))
1401 #endif /* not GC_CHECK_STRING_BYTES */
1403 /* Value is the size of an sdata structure large enough to hold NBYTES
1404 bytes of string data. The value returned includes a terminating
1405 NUL byte, the size of the sdata structure, and padding. */
1407 #ifdef GC_CHECK_STRING_BYTES
1409 #define SDATA_SIZE(NBYTES) \
1410 ((sizeof (struct Lisp_String *) \
1412 + sizeof (EMACS_INT) \
1413 + sizeof (EMACS_INT) - 1) \
1414 & ~(sizeof (EMACS_INT) - 1))
1416 #else /* not GC_CHECK_STRING_BYTES */
1418 #define SDATA_SIZE(NBYTES) \
1419 ((sizeof (struct Lisp_String *) \
1421 + sizeof (EMACS_INT) - 1) \
1422 & ~(sizeof (EMACS_INT) - 1))
1424 #endif /* not GC_CHECK_STRING_BYTES */
1426 /* Initialize string allocation. Called from init_alloc_once. */
1431 total_strings
= total_free_strings
= total_string_size
= 0;
1432 oldest_sblock
= current_sblock
= large_sblocks
= NULL
;
1433 string_blocks
= NULL
;
1434 n_string_blocks
= 0;
1435 string_free_list
= NULL
;
1439 #ifdef GC_CHECK_STRING_BYTES
1441 static int check_string_bytes_count
;
1443 void check_string_bytes
P_ ((int));
1444 void check_sblock
P_ ((struct sblock
*));
1446 #define CHECK_STRING_BYTES(S) STRING_BYTES (S)
1449 /* Like GC_STRING_BYTES, but with debugging check. */
1453 struct Lisp_String
*s
;
1455 int nbytes
= (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1456 if (!PURE_POINTER_P (s
)
1458 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1463 /* Check validity of Lisp strings' string_bytes member in B. */
1469 struct sdata
*from
, *end
, *from_end
;
1473 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1475 /* Compute the next FROM here because copying below may
1476 overwrite data we need to compute it. */
1479 /* Check that the string size recorded in the string is the
1480 same as the one recorded in the sdata structure. */
1482 CHECK_STRING_BYTES (from
->string
);
1485 nbytes
= GC_STRING_BYTES (from
->string
);
1487 nbytes
= SDATA_NBYTES (from
);
1489 nbytes
= SDATA_SIZE (nbytes
);
1490 from_end
= (struct sdata
*) ((char *) from
+ nbytes
);
1495 /* Check validity of Lisp strings' string_bytes member. ALL_P
1496 non-zero means check all strings, otherwise check only most
1497 recently allocated strings. Used for hunting a bug. */
1500 check_string_bytes (all_p
)
1507 for (b
= large_sblocks
; b
; b
= b
->next
)
1509 struct Lisp_String
*s
= b
->first_data
.string
;
1511 CHECK_STRING_BYTES (s
);
1514 for (b
= oldest_sblock
; b
; b
= b
->next
)
1518 check_sblock (current_sblock
);
1521 #endif /* GC_CHECK_STRING_BYTES */
1524 /* Return a new Lisp_String. */
1526 static struct Lisp_String
*
1529 struct Lisp_String
*s
;
1531 /* If the free-list is empty, allocate a new string_block, and
1532 add all the Lisp_Strings in it to the free-list. */
1533 if (string_free_list
== NULL
)
1535 struct string_block
*b
;
1538 b
= (struct string_block
*) lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1539 bzero (b
, sizeof *b
);
1540 b
->next
= string_blocks
;
1544 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1547 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1548 string_free_list
= s
;
1551 total_free_strings
+= STRING_BLOCK_SIZE
;
1554 /* Pop a Lisp_String off the free-list. */
1555 s
= string_free_list
;
1556 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1558 /* Probably not strictly necessary, but play it safe. */
1559 bzero (s
, sizeof *s
);
1561 --total_free_strings
;
1564 consing_since_gc
+= sizeof *s
;
1566 #ifdef GC_CHECK_STRING_BYTES
1573 if (++check_string_bytes_count
== 200)
1575 check_string_bytes_count
= 0;
1576 check_string_bytes (1);
1579 check_string_bytes (0);
1581 #endif /* GC_CHECK_STRING_BYTES */
1587 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1588 plus a NUL byte at the end. Allocate an sdata structure for S, and
1589 set S->data to its `u.data' member. Store a NUL byte at the end of
1590 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1591 S->data if it was initially non-null. */
1594 allocate_string_data (s
, nchars
, nbytes
)
1595 struct Lisp_String
*s
;
1598 struct sdata
*data
, *old_data
;
1600 int needed
, old_nbytes
;
1602 /* Determine the number of bytes needed to store NBYTES bytes
1604 needed
= SDATA_SIZE (nbytes
);
1606 if (nbytes
> LARGE_STRING_BYTES
)
1608 size_t size
= sizeof *b
- sizeof (struct sdata
) + needed
;
1610 #ifdef DOUG_LEA_MALLOC
1611 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1612 because mapped region contents are not preserved in
1615 In case you think of allowing it in a dumped Emacs at the
1616 cost of not being able to re-dump, there's another reason:
1617 mmap'ed data typically have an address towards the top of the
1618 address space, which won't fit into an EMACS_INT (at least on
1619 32-bit systems with the current tagging scheme). --fx */
1620 mallopt (M_MMAP_MAX
, 0);
1623 b
= (struct sblock
*) lisp_malloc (size
, MEM_TYPE_NON_LISP
);
1625 #ifdef DOUG_LEA_MALLOC
1626 /* Back to a reasonable maximum of mmap'ed areas. */
1627 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1630 b
->next_free
= &b
->first_data
;
1631 b
->first_data
.string
= NULL
;
1632 b
->next
= large_sblocks
;
1635 else if (current_sblock
== NULL
1636 || (((char *) current_sblock
+ SBLOCK_SIZE
1637 - (char *) current_sblock
->next_free
)
1640 /* Not enough room in the current sblock. */
1641 b
= (struct sblock
*) lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
1642 b
->next_free
= &b
->first_data
;
1643 b
->first_data
.string
= NULL
;
1647 current_sblock
->next
= b
;
1655 old_data
= s
->data
? SDATA_OF_STRING (s
) : NULL
;
1656 old_nbytes
= GC_STRING_BYTES (s
);
1658 data
= b
->next_free
;
1660 s
->data
= SDATA_DATA (data
);
1661 #ifdef GC_CHECK_STRING_BYTES
1662 SDATA_NBYTES (data
) = nbytes
;
1665 s
->size_byte
= nbytes
;
1666 s
->data
[nbytes
] = '\0';
1667 b
->next_free
= (struct sdata
*) ((char *) data
+ needed
);
1669 /* If S had already data assigned, mark that as free by setting its
1670 string back-pointer to null, and recording the size of the data
1674 SDATA_NBYTES (old_data
) = old_nbytes
;
1675 old_data
->string
= NULL
;
1678 consing_since_gc
+= needed
;
1682 /* Sweep and compact strings. */
1687 struct string_block
*b
, *next
;
1688 struct string_block
*live_blocks
= NULL
;
1690 string_free_list
= NULL
;
1691 total_strings
= total_free_strings
= 0;
1692 total_string_size
= 0;
1694 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
1695 for (b
= string_blocks
; b
; b
= next
)
1698 struct Lisp_String
*free_list_before
= string_free_list
;
1702 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
1704 struct Lisp_String
*s
= b
->strings
+ i
;
1708 /* String was not on free-list before. */
1709 if (STRING_MARKED_P (s
))
1711 /* String is live; unmark it and its intervals. */
1714 if (!NULL_INTERVAL_P (s
->intervals
))
1715 UNMARK_BALANCE_INTERVALS (s
->intervals
);
1718 total_string_size
+= STRING_BYTES (s
);
1722 /* String is dead. Put it on the free-list. */
1723 struct sdata
*data
= SDATA_OF_STRING (s
);
1725 /* Save the size of S in its sdata so that we know
1726 how large that is. Reset the sdata's string
1727 back-pointer so that we know it's free. */
1728 #ifdef GC_CHECK_STRING_BYTES
1729 if (GC_STRING_BYTES (s
) != SDATA_NBYTES (data
))
1732 data
->u
.nbytes
= GC_STRING_BYTES (s
);
1734 data
->string
= NULL
;
1736 /* Reset the strings's `data' member so that we
1740 /* Put the string on the free-list. */
1741 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1742 string_free_list
= s
;
1748 /* S was on the free-list before. Put it there again. */
1749 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1750 string_free_list
= s
;
1755 /* Free blocks that contain free Lisp_Strings only, except
1756 the first two of them. */
1757 if (nfree
== STRING_BLOCK_SIZE
1758 && total_free_strings
> STRING_BLOCK_SIZE
)
1762 string_free_list
= free_list_before
;
1766 total_free_strings
+= nfree
;
1767 b
->next
= live_blocks
;
1772 string_blocks
= live_blocks
;
1773 free_large_strings ();
1774 compact_small_strings ();
1778 /* Free dead large strings. */
1781 free_large_strings ()
1783 struct sblock
*b
, *next
;
1784 struct sblock
*live_blocks
= NULL
;
1786 for (b
= large_sblocks
; b
; b
= next
)
1790 if (b
->first_data
.string
== NULL
)
1794 b
->next
= live_blocks
;
1799 large_sblocks
= live_blocks
;
1803 /* Compact data of small strings. Free sblocks that don't contain
1804 data of live strings after compaction. */
1807 compact_small_strings ()
1809 struct sblock
*b
, *tb
, *next
;
1810 struct sdata
*from
, *to
, *end
, *tb_end
;
1811 struct sdata
*to_end
, *from_end
;
1813 /* TB is the sblock we copy to, TO is the sdata within TB we copy
1814 to, and TB_END is the end of TB. */
1816 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
1817 to
= &tb
->first_data
;
1819 /* Step through the blocks from the oldest to the youngest. We
1820 expect that old blocks will stabilize over time, so that less
1821 copying will happen this way. */
1822 for (b
= oldest_sblock
; b
; b
= b
->next
)
1825 xassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
1827 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1829 /* Compute the next FROM here because copying below may
1830 overwrite data we need to compute it. */
1833 #ifdef GC_CHECK_STRING_BYTES
1834 /* Check that the string size recorded in the string is the
1835 same as the one recorded in the sdata structure. */
1837 && GC_STRING_BYTES (from
->string
) != SDATA_NBYTES (from
))
1839 #endif /* GC_CHECK_STRING_BYTES */
1842 nbytes
= GC_STRING_BYTES (from
->string
);
1844 nbytes
= SDATA_NBYTES (from
);
1846 nbytes
= SDATA_SIZE (nbytes
);
1847 from_end
= (struct sdata
*) ((char *) from
+ nbytes
);
1849 /* FROM->string non-null means it's alive. Copy its data. */
1852 /* If TB is full, proceed with the next sblock. */
1853 to_end
= (struct sdata
*) ((char *) to
+ nbytes
);
1854 if (to_end
> tb_end
)
1858 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
1859 to
= &tb
->first_data
;
1860 to_end
= (struct sdata
*) ((char *) to
+ nbytes
);
1863 /* Copy, and update the string's `data' pointer. */
1866 xassert (tb
!= b
|| to
<= from
);
1867 safe_bcopy ((char *) from
, (char *) to
, nbytes
);
1868 to
->string
->data
= SDATA_DATA (to
);
1871 /* Advance past the sdata we copied to. */
1877 /* The rest of the sblocks following TB don't contain live data, so
1878 we can free them. */
1879 for (b
= tb
->next
; b
; b
= next
)
1887 current_sblock
= tb
;
1891 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
1892 doc
: /* Return a newly created string of length LENGTH, with each element being INIT.
1893 Both LENGTH and INIT must be numbers. */)
1895 Lisp_Object length
, init
;
1897 register Lisp_Object val
;
1898 register unsigned char *p
, *end
;
1901 CHECK_NATNUM (length
);
1902 CHECK_NUMBER (init
);
1905 if (SINGLE_BYTE_CHAR_P (c
))
1907 nbytes
= XINT (length
);
1908 val
= make_uninit_string (nbytes
);
1910 end
= p
+ SCHARS (val
);
1916 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
1917 int len
= CHAR_STRING (c
, str
);
1919 nbytes
= len
* XINT (length
);
1920 val
= make_uninit_multibyte_string (XINT (length
), nbytes
);
1925 bcopy (str
, p
, len
);
1935 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
1936 doc
: /* Return a new bool-vector of length LENGTH, using INIT for as each element.
1937 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
1939 Lisp_Object length
, init
;
1941 register Lisp_Object val
;
1942 struct Lisp_Bool_Vector
*p
;
1944 int length_in_chars
, length_in_elts
, bits_per_value
;
1946 CHECK_NATNUM (length
);
1948 bits_per_value
= sizeof (EMACS_INT
) * BITS_PER_CHAR
;
1950 length_in_elts
= (XFASTINT (length
) + bits_per_value
- 1) / bits_per_value
;
1951 length_in_chars
= ((XFASTINT (length
) + BITS_PER_CHAR
- 1) / BITS_PER_CHAR
);
1953 /* We must allocate one more elements than LENGTH_IN_ELTS for the
1954 slot `size' of the struct Lisp_Bool_Vector. */
1955 val
= Fmake_vector (make_number (length_in_elts
+ 1), Qnil
);
1956 p
= XBOOL_VECTOR (val
);
1958 /* Get rid of any bits that would cause confusion. */
1960 XSETBOOL_VECTOR (val
, p
);
1961 p
->size
= XFASTINT (length
);
1963 real_init
= (NILP (init
) ? 0 : -1);
1964 for (i
= 0; i
< length_in_chars
; i
++)
1965 p
->data
[i
] = real_init
;
1967 /* Clear the extraneous bits in the last byte. */
1968 if (XINT (length
) != length_in_chars
* BITS_PER_CHAR
)
1969 XBOOL_VECTOR (val
)->data
[length_in_chars
- 1]
1970 &= (1 << (XINT (length
) % BITS_PER_CHAR
)) - 1;
1976 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
1977 of characters from the contents. This string may be unibyte or
1978 multibyte, depending on the contents. */
1981 make_string (contents
, nbytes
)
1982 const char *contents
;
1985 register Lisp_Object val
;
1986 int nchars
, multibyte_nbytes
;
1988 parse_str_as_multibyte (contents
, nbytes
, &nchars
, &multibyte_nbytes
);
1989 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
1990 /* CONTENTS contains no multibyte sequences or contains an invalid
1991 multibyte sequence. We must make unibyte string. */
1992 val
= make_unibyte_string (contents
, nbytes
);
1994 val
= make_multibyte_string (contents
, nchars
, nbytes
);
1999 /* Make an unibyte string from LENGTH bytes at CONTENTS. */
2002 make_unibyte_string (contents
, length
)
2003 const char *contents
;
2006 register Lisp_Object val
;
2007 val
= make_uninit_string (length
);
2008 bcopy (contents
, SDATA (val
), length
);
2009 STRING_SET_UNIBYTE (val
);
2014 /* Make a multibyte string from NCHARS characters occupying NBYTES
2015 bytes at CONTENTS. */
2018 make_multibyte_string (contents
, nchars
, nbytes
)
2019 const char *contents
;
2022 register Lisp_Object val
;
2023 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2024 bcopy (contents
, SDATA (val
), nbytes
);
2029 /* Make a string from NCHARS characters occupying NBYTES bytes at
2030 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2033 make_string_from_bytes (contents
, nchars
, nbytes
)
2034 const char *contents
;
2037 register Lisp_Object val
;
2038 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2039 bcopy (contents
, SDATA (val
), nbytes
);
2040 if (SBYTES (val
) == SCHARS (val
))
2041 STRING_SET_UNIBYTE (val
);
2046 /* Make a string from NCHARS characters occupying NBYTES bytes at
2047 CONTENTS. The argument MULTIBYTE controls whether to label the
2048 string as multibyte. If NCHARS is negative, it counts the number of
2049 characters by itself. */
2052 make_specified_string (contents
, nchars
, nbytes
, multibyte
)
2053 const char *contents
;
2057 register Lisp_Object val
;
2062 nchars
= multibyte_chars_in_text (contents
, nbytes
);
2066 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2067 bcopy (contents
, SDATA (val
), nbytes
);
2069 STRING_SET_UNIBYTE (val
);
2074 /* Make a string from the data at STR, treating it as multibyte if the
2081 return make_string (str
, strlen (str
));
2085 /* Return an unibyte Lisp_String set up to hold LENGTH characters
2086 occupying LENGTH bytes. */
2089 make_uninit_string (length
)
2093 val
= make_uninit_multibyte_string (length
, length
);
2094 STRING_SET_UNIBYTE (val
);
2099 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2100 which occupy NBYTES bytes. */
2103 make_uninit_multibyte_string (nchars
, nbytes
)
2107 struct Lisp_String
*s
;
2112 s
= allocate_string ();
2113 allocate_string_data (s
, nchars
, nbytes
);
2114 XSETSTRING (string
, s
);
2115 string_chars_consed
+= nbytes
;
2121 /***********************************************************************
2123 ***********************************************************************/
2125 /* We store float cells inside of float_blocks, allocating a new
2126 float_block with malloc whenever necessary. Float cells reclaimed
2127 by GC are put on a free list to be reallocated before allocating
2128 any new float cells from the latest float_block. */
2130 #define FLOAT_BLOCK_SIZE \
2131 (((BLOCK_BYTES - sizeof (struct float_block *) \
2132 /* The compiler might add padding at the end. */ \
2133 - (sizeof (struct Lisp_Float) - sizeof (int))) * CHAR_BIT) \
2134 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2136 #define GETMARKBIT(block,n) \
2137 (((block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2138 >> ((n) % (sizeof(int) * CHAR_BIT))) \
2141 #define SETMARKBIT(block,n) \
2142 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2143 |= 1 << ((n) % (sizeof(int) * CHAR_BIT))
2145 #define UNSETMARKBIT(block,n) \
2146 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2147 &= ~(1 << ((n) % (sizeof(int) * CHAR_BIT)))
2149 #define FLOAT_BLOCK(fptr) \
2150 ((struct float_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2152 #define FLOAT_INDEX(fptr) \
2153 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2157 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2158 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2159 int gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2160 struct float_block
*next
;
2163 #define FLOAT_MARKED_P(fptr) \
2164 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2166 #define FLOAT_MARK(fptr) \
2167 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2169 #define FLOAT_UNMARK(fptr) \
2170 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2172 /* Current float_block. */
2174 struct float_block
*float_block
;
2176 /* Index of first unused Lisp_Float in the current float_block. */
2178 int float_block_index
;
2180 /* Total number of float blocks now in use. */
2184 /* Free-list of Lisp_Floats. */
2186 struct Lisp_Float
*float_free_list
;
2189 /* Initialize float allocation. */
2195 float_block_index
= FLOAT_BLOCK_SIZE
; /* Force alloc of new float_block. */
2196 float_free_list
= 0;
2201 /* Explicitly free a float cell by putting it on the free-list. */
2205 struct Lisp_Float
*ptr
;
2207 *(struct Lisp_Float
**)&ptr
->data
= float_free_list
;
2208 float_free_list
= ptr
;
2212 /* Return a new float object with value FLOAT_VALUE. */
2215 make_float (float_value
)
2218 register Lisp_Object val
;
2220 if (float_free_list
)
2222 /* We use the data field for chaining the free list
2223 so that we won't use the same field that has the mark bit. */
2224 XSETFLOAT (val
, float_free_list
);
2225 float_free_list
= *(struct Lisp_Float
**)&float_free_list
->data
;
2229 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2231 register struct float_block
*new;
2233 new = (struct float_block
*) lisp_align_malloc (sizeof *new,
2235 new->next
= float_block
;
2236 bzero ((char *) new->gcmarkbits
, sizeof new->gcmarkbits
);
2238 float_block_index
= 0;
2241 XSETFLOAT (val
, &float_block
->floats
[float_block_index
]);
2242 float_block_index
++;
2245 XFLOAT_DATA (val
) = float_value
;
2246 eassert (!FLOAT_MARKED_P (XFLOAT (val
)));
2247 consing_since_gc
+= sizeof (struct Lisp_Float
);
2254 /***********************************************************************
2256 ***********************************************************************/
2258 /* We store cons cells inside of cons_blocks, allocating a new
2259 cons_block with malloc whenever necessary. Cons cells reclaimed by
2260 GC are put on a free list to be reallocated before allocating
2261 any new cons cells from the latest cons_block. */
2263 #define CONS_BLOCK_SIZE \
2264 (((BLOCK_BYTES - sizeof (struct cons_block *)) * CHAR_BIT) \
2265 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2267 #define CONS_BLOCK(fptr) \
2268 ((struct cons_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2270 #define CONS_INDEX(fptr) \
2271 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2275 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2276 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2277 int gcmarkbits
[1 + CONS_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2278 struct cons_block
*next
;
2281 #define CONS_MARKED_P(fptr) \
2282 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2284 #define CONS_MARK(fptr) \
2285 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2287 #define CONS_UNMARK(fptr) \
2288 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2290 /* Current cons_block. */
2292 struct cons_block
*cons_block
;
2294 /* Index of first unused Lisp_Cons in the current block. */
2296 int cons_block_index
;
2298 /* Free-list of Lisp_Cons structures. */
2300 struct Lisp_Cons
*cons_free_list
;
2302 /* Total number of cons blocks now in use. */
2307 /* Initialize cons allocation. */
2313 cons_block_index
= CONS_BLOCK_SIZE
; /* Force alloc of new cons_block. */
2319 /* Explicitly free a cons cell by putting it on the free-list. */
2323 struct Lisp_Cons
*ptr
;
2325 *(struct Lisp_Cons
**)&ptr
->cdr
= cons_free_list
;
2329 cons_free_list
= ptr
;
2333 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
2334 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2336 Lisp_Object car
, cdr
;
2338 register Lisp_Object val
;
2342 /* We use the cdr for chaining the free list
2343 so that we won't use the same field that has the mark bit. */
2344 XSETCONS (val
, cons_free_list
);
2345 cons_free_list
= *(struct Lisp_Cons
**)&cons_free_list
->cdr
;
2349 if (cons_block_index
== CONS_BLOCK_SIZE
)
2351 register struct cons_block
*new;
2352 new = (struct cons_block
*) lisp_align_malloc (sizeof *new,
2354 bzero ((char *) new->gcmarkbits
, sizeof new->gcmarkbits
);
2355 new->next
= cons_block
;
2357 cons_block_index
= 0;
2360 XSETCONS (val
, &cons_block
->conses
[cons_block_index
]);
2366 eassert (!CONS_MARKED_P (XCONS (val
)));
2367 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2368 cons_cells_consed
++;
2373 /* Make a list of 2, 3, 4 or 5 specified objects. */
2377 Lisp_Object arg1
, arg2
;
2379 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2384 list3 (arg1
, arg2
, arg3
)
2385 Lisp_Object arg1
, arg2
, arg3
;
2387 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2392 list4 (arg1
, arg2
, arg3
, arg4
)
2393 Lisp_Object arg1
, arg2
, arg3
, arg4
;
2395 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2400 list5 (arg1
, arg2
, arg3
, arg4
, arg5
)
2401 Lisp_Object arg1
, arg2
, arg3
, arg4
, arg5
;
2403 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2404 Fcons (arg5
, Qnil
)))));
2408 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
2409 doc
: /* Return a newly created list with specified arguments as elements.
2410 Any number of arguments, even zero arguments, are allowed.
2411 usage: (list &rest OBJECTS) */)
2414 register Lisp_Object
*args
;
2416 register Lisp_Object val
;
2422 val
= Fcons (args
[nargs
], val
);
2428 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2429 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2431 register Lisp_Object length
, init
;
2433 register Lisp_Object val
;
2436 CHECK_NATNUM (length
);
2437 size
= XFASTINT (length
);
2442 val
= Fcons (init
, val
);
2447 val
= Fcons (init
, val
);
2452 val
= Fcons (init
, val
);
2457 val
= Fcons (init
, val
);
2462 val
= Fcons (init
, val
);
2477 /***********************************************************************
2479 ***********************************************************************/
2481 /* Singly-linked list of all vectors. */
2483 struct Lisp_Vector
*all_vectors
;
2485 /* Total number of vector-like objects now in use. */
2490 /* Value is a pointer to a newly allocated Lisp_Vector structure
2491 with room for LEN Lisp_Objects. */
2493 static struct Lisp_Vector
*
2494 allocate_vectorlike (len
, type
)
2498 struct Lisp_Vector
*p
;
2501 #ifdef DOUG_LEA_MALLOC
2502 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
2503 because mapped region contents are not preserved in
2506 mallopt (M_MMAP_MAX
, 0);
2510 nbytes
= sizeof *p
+ (len
- 1) * sizeof p
->contents
[0];
2511 p
= (struct Lisp_Vector
*) lisp_malloc (nbytes
, type
);
2513 #ifdef DOUG_LEA_MALLOC
2514 /* Back to a reasonable maximum of mmap'ed areas. */
2516 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2520 consing_since_gc
+= nbytes
;
2521 vector_cells_consed
+= len
;
2523 p
->next
= all_vectors
;
2530 /* Allocate a vector with NSLOTS slots. */
2532 struct Lisp_Vector
*
2533 allocate_vector (nslots
)
2536 struct Lisp_Vector
*v
= allocate_vectorlike (nslots
, MEM_TYPE_VECTOR
);
2542 /* Allocate other vector-like structures. */
2544 struct Lisp_Hash_Table
*
2545 allocate_hash_table ()
2547 EMACS_INT len
= VECSIZE (struct Lisp_Hash_Table
);
2548 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_HASH_TABLE
);
2552 for (i
= 0; i
< len
; ++i
)
2553 v
->contents
[i
] = Qnil
;
2555 return (struct Lisp_Hash_Table
*) v
;
2562 EMACS_INT len
= VECSIZE (struct window
);
2563 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_WINDOW
);
2566 for (i
= 0; i
< len
; ++i
)
2567 v
->contents
[i
] = Qnil
;
2570 return (struct window
*) v
;
2577 EMACS_INT len
= VECSIZE (struct frame
);
2578 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_FRAME
);
2581 for (i
= 0; i
< len
; ++i
)
2582 v
->contents
[i
] = make_number (0);
2584 return (struct frame
*) v
;
2588 struct Lisp_Process
*
2591 EMACS_INT len
= VECSIZE (struct Lisp_Process
);
2592 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_PROCESS
);
2595 for (i
= 0; i
< len
; ++i
)
2596 v
->contents
[i
] = Qnil
;
2599 return (struct Lisp_Process
*) v
;
2603 struct Lisp_Vector
*
2604 allocate_other_vector (len
)
2607 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_VECTOR
);
2610 for (i
= 0; i
< len
; ++i
)
2611 v
->contents
[i
] = Qnil
;
2618 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
2619 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
2620 See also the function `vector'. */)
2622 register Lisp_Object length
, init
;
2625 register EMACS_INT sizei
;
2627 register struct Lisp_Vector
*p
;
2629 CHECK_NATNUM (length
);
2630 sizei
= XFASTINT (length
);
2632 p
= allocate_vector (sizei
);
2633 for (index
= 0; index
< sizei
; index
++)
2634 p
->contents
[index
] = init
;
2636 XSETVECTOR (vector
, p
);
2641 DEFUN ("make-char-table", Fmake_char_table
, Smake_char_table
, 1, 2, 0,
2642 doc
: /* Return a newly created char-table, with purpose PURPOSE.
2643 Each element is initialized to INIT, which defaults to nil.
2644 PURPOSE should be a symbol which has a `char-table-extra-slots' property.
2645 The property's value should be an integer between 0 and 10. */)
2647 register Lisp_Object purpose
, init
;
2651 CHECK_SYMBOL (purpose
);
2652 n
= Fget (purpose
, Qchar_table_extra_slots
);
2654 if (XINT (n
) < 0 || XINT (n
) > 10)
2655 args_out_of_range (n
, Qnil
);
2656 /* Add 2 to the size for the defalt and parent slots. */
2657 vector
= Fmake_vector (make_number (CHAR_TABLE_STANDARD_SLOTS
+ XINT (n
)),
2659 XCHAR_TABLE (vector
)->top
= Qt
;
2660 XCHAR_TABLE (vector
)->parent
= Qnil
;
2661 XCHAR_TABLE (vector
)->purpose
= purpose
;
2662 XSETCHAR_TABLE (vector
, XCHAR_TABLE (vector
));
2667 /* Return a newly created sub char table with default value DEFALT.
2668 Since a sub char table does not appear as a top level Emacs Lisp
2669 object, we don't need a Lisp interface to make it. */
2672 make_sub_char_table (defalt
)
2676 = Fmake_vector (make_number (SUB_CHAR_TABLE_STANDARD_SLOTS
), Qnil
);
2677 XCHAR_TABLE (vector
)->top
= Qnil
;
2678 XCHAR_TABLE (vector
)->defalt
= defalt
;
2679 XSETCHAR_TABLE (vector
, XCHAR_TABLE (vector
));
2684 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
2685 doc
: /* Return a newly created vector with specified arguments as elements.
2686 Any number of arguments, even zero arguments, are allowed.
2687 usage: (vector &rest OBJECTS) */)
2692 register Lisp_Object len
, val
;
2694 register struct Lisp_Vector
*p
;
2696 XSETFASTINT (len
, nargs
);
2697 val
= Fmake_vector (len
, Qnil
);
2699 for (index
= 0; index
< nargs
; index
++)
2700 p
->contents
[index
] = args
[index
];
2705 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
2706 doc
: /* Create a byte-code object with specified arguments as elements.
2707 The arguments should be the arglist, bytecode-string, constant vector,
2708 stack size, (optional) doc string, and (optional) interactive spec.
2709 The first four arguments are required; at most six have any
2711 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
2716 register Lisp_Object len
, val
;
2718 register struct Lisp_Vector
*p
;
2720 XSETFASTINT (len
, nargs
);
2721 if (!NILP (Vpurify_flag
))
2722 val
= make_pure_vector ((EMACS_INT
) nargs
);
2724 val
= Fmake_vector (len
, Qnil
);
2726 if (STRINGP (args
[1]) && STRING_MULTIBYTE (args
[1]))
2727 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
2728 earlier because they produced a raw 8-bit string for byte-code
2729 and now such a byte-code string is loaded as multibyte while
2730 raw 8-bit characters converted to multibyte form. Thus, now we
2731 must convert them back to the original unibyte form. */
2732 args
[1] = Fstring_as_unibyte (args
[1]);
2735 for (index
= 0; index
< nargs
; index
++)
2737 if (!NILP (Vpurify_flag
))
2738 args
[index
] = Fpurecopy (args
[index
]);
2739 p
->contents
[index
] = args
[index
];
2741 XSETCOMPILED (val
, p
);
2747 /***********************************************************************
2749 ***********************************************************************/
2751 /* Each symbol_block is just under 1020 bytes long, since malloc
2752 really allocates in units of powers of two and uses 4 bytes for its
2755 #define SYMBOL_BLOCK_SIZE \
2756 ((1020 - sizeof (struct symbol_block *)) / sizeof (struct Lisp_Symbol))
2760 /* Place `symbols' first, to preserve alignment. */
2761 struct Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
2762 struct symbol_block
*next
;
2765 /* Current symbol block and index of first unused Lisp_Symbol
2768 struct symbol_block
*symbol_block
;
2769 int symbol_block_index
;
2771 /* List of free symbols. */
2773 struct Lisp_Symbol
*symbol_free_list
;
2775 /* Total number of symbol blocks now in use. */
2777 int n_symbol_blocks
;
2780 /* Initialize symbol allocation. */
2785 symbol_block
= NULL
;
2786 symbol_block_index
= SYMBOL_BLOCK_SIZE
;
2787 symbol_free_list
= 0;
2788 n_symbol_blocks
= 0;
2792 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
2793 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
2794 Its value and function definition are void, and its property list is nil. */)
2798 register Lisp_Object val
;
2799 register struct Lisp_Symbol
*p
;
2801 CHECK_STRING (name
);
2803 if (symbol_free_list
)
2805 XSETSYMBOL (val
, symbol_free_list
);
2806 symbol_free_list
= *(struct Lisp_Symbol
**)&symbol_free_list
->value
;
2810 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
2812 struct symbol_block
*new;
2813 new = (struct symbol_block
*) lisp_malloc (sizeof *new,
2815 new->next
= symbol_block
;
2817 symbol_block_index
= 0;
2820 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
]);
2821 symbol_block_index
++;
2827 p
->value
= Qunbound
;
2828 p
->function
= Qunbound
;
2831 p
->interned
= SYMBOL_UNINTERNED
;
2833 p
->indirect_variable
= 0;
2834 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
2841 /***********************************************************************
2842 Marker (Misc) Allocation
2843 ***********************************************************************/
2845 /* Allocation of markers and other objects that share that structure.
2846 Works like allocation of conses. */
2848 #define MARKER_BLOCK_SIZE \
2849 ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc))
2853 /* Place `markers' first, to preserve alignment. */
2854 union Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
2855 struct marker_block
*next
;
2858 struct marker_block
*marker_block
;
2859 int marker_block_index
;
2861 union Lisp_Misc
*marker_free_list
;
2863 /* Total number of marker blocks now in use. */
2865 int n_marker_blocks
;
2870 marker_block
= NULL
;
2871 marker_block_index
= MARKER_BLOCK_SIZE
;
2872 marker_free_list
= 0;
2873 n_marker_blocks
= 0;
2876 /* Return a newly allocated Lisp_Misc object, with no substructure. */
2883 if (marker_free_list
)
2885 XSETMISC (val
, marker_free_list
);
2886 marker_free_list
= marker_free_list
->u_free
.chain
;
2890 if (marker_block_index
== MARKER_BLOCK_SIZE
)
2892 struct marker_block
*new;
2893 new = (struct marker_block
*) lisp_malloc (sizeof *new,
2895 new->next
= marker_block
;
2897 marker_block_index
= 0;
2900 XSETMISC (val
, &marker_block
->markers
[marker_block_index
]);
2901 marker_block_index
++;
2904 consing_since_gc
+= sizeof (union Lisp_Misc
);
2905 misc_objects_consed
++;
2906 XMARKER (val
)->gcmarkbit
= 0;
2910 /* Return a Lisp_Misc_Save_Value object containing POINTER and
2911 INTEGER. This is used to package C values to call record_unwind_protect.
2912 The unwind function can get the C values back using XSAVE_VALUE. */
2915 make_save_value (pointer
, integer
)
2919 register Lisp_Object val
;
2920 register struct Lisp_Save_Value
*p
;
2922 val
= allocate_misc ();
2923 XMISCTYPE (val
) = Lisp_Misc_Save_Value
;
2924 p
= XSAVE_VALUE (val
);
2925 p
->pointer
= pointer
;
2926 p
->integer
= integer
;
2930 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
2931 doc
: /* Return a newly allocated marker which does not point at any place. */)
2934 register Lisp_Object val
;
2935 register struct Lisp_Marker
*p
;
2937 val
= allocate_misc ();
2938 XMISCTYPE (val
) = Lisp_Misc_Marker
;
2944 p
->insertion_type
= 0;
2948 /* Put MARKER back on the free list after using it temporarily. */
2951 free_marker (marker
)
2954 unchain_marker (XMARKER (marker
));
2956 XMISC (marker
)->u_marker
.type
= Lisp_Misc_Free
;
2957 XMISC (marker
)->u_free
.chain
= marker_free_list
;
2958 marker_free_list
= XMISC (marker
);
2960 total_free_markers
++;
2964 /* Return a newly created vector or string with specified arguments as
2965 elements. If all the arguments are characters that can fit
2966 in a string of events, make a string; otherwise, make a vector.
2968 Any number of arguments, even zero arguments, are allowed. */
2971 make_event_array (nargs
, args
)
2977 for (i
= 0; i
< nargs
; i
++)
2978 /* The things that fit in a string
2979 are characters that are in 0...127,
2980 after discarding the meta bit and all the bits above it. */
2981 if (!INTEGERP (args
[i
])
2982 || (XUINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
2983 return Fvector (nargs
, args
);
2985 /* Since the loop exited, we know that all the things in it are
2986 characters, so we can make a string. */
2990 result
= Fmake_string (make_number (nargs
), make_number (0));
2991 for (i
= 0; i
< nargs
; i
++)
2993 SSET (result
, i
, XINT (args
[i
]));
2994 /* Move the meta bit to the right place for a string char. */
2995 if (XINT (args
[i
]) & CHAR_META
)
2996 SSET (result
, i
, SREF (result
, i
) | 0x80);
3005 /************************************************************************
3007 ************************************************************************/
3009 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
3011 /* Conservative C stack marking requires a method to identify possibly
3012 live Lisp objects given a pointer value. We do this by keeping
3013 track of blocks of Lisp data that are allocated in a red-black tree
3014 (see also the comment of mem_node which is the type of nodes in
3015 that tree). Function lisp_malloc adds information for an allocated
3016 block to the red-black tree with calls to mem_insert, and function
3017 lisp_free removes it with mem_delete. Functions live_string_p etc
3018 call mem_find to lookup information about a given pointer in the
3019 tree, and use that to determine if the pointer points to a Lisp
3022 /* Initialize this part of alloc.c. */
3027 mem_z
.left
= mem_z
.right
= MEM_NIL
;
3028 mem_z
.parent
= NULL
;
3029 mem_z
.color
= MEM_BLACK
;
3030 mem_z
.start
= mem_z
.end
= NULL
;
3035 /* Value is a pointer to the mem_node containing START. Value is
3036 MEM_NIL if there is no node in the tree containing START. */
3038 static INLINE
struct mem_node
*
3044 if (start
< min_heap_address
|| start
> max_heap_address
)
3047 /* Make the search always successful to speed up the loop below. */
3048 mem_z
.start
= start
;
3049 mem_z
.end
= (char *) start
+ 1;
3052 while (start
< p
->start
|| start
>= p
->end
)
3053 p
= start
< p
->start
? p
->left
: p
->right
;
3058 /* Insert a new node into the tree for a block of memory with start
3059 address START, end address END, and type TYPE. Value is a
3060 pointer to the node that was inserted. */
3062 static struct mem_node
*
3063 mem_insert (start
, end
, type
)
3067 struct mem_node
*c
, *parent
, *x
;
3069 if (start
< min_heap_address
)
3070 min_heap_address
= start
;
3071 if (end
> max_heap_address
)
3072 max_heap_address
= end
;
3074 /* See where in the tree a node for START belongs. In this
3075 particular application, it shouldn't happen that a node is already
3076 present. For debugging purposes, let's check that. */
3080 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3082 while (c
!= MEM_NIL
)
3084 if (start
>= c
->start
&& start
< c
->end
)
3087 c
= start
< c
->start
? c
->left
: c
->right
;
3090 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3092 while (c
!= MEM_NIL
)
3095 c
= start
< c
->start
? c
->left
: c
->right
;
3098 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3100 /* Create a new node. */
3101 #ifdef GC_MALLOC_CHECK
3102 x
= (struct mem_node
*) _malloc_internal (sizeof *x
);
3106 x
= (struct mem_node
*) xmalloc (sizeof *x
);
3112 x
->left
= x
->right
= MEM_NIL
;
3115 /* Insert it as child of PARENT or install it as root. */
3118 if (start
< parent
->start
)
3126 /* Re-establish red-black tree properties. */
3127 mem_insert_fixup (x
);
3133 /* Re-establish the red-black properties of the tree, and thereby
3134 balance the tree, after node X has been inserted; X is always red. */
3137 mem_insert_fixup (x
)
3140 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3142 /* X is red and its parent is red. This is a violation of
3143 red-black tree property #3. */
3145 if (x
->parent
== x
->parent
->parent
->left
)
3147 /* We're on the left side of our grandparent, and Y is our
3149 struct mem_node
*y
= x
->parent
->parent
->right
;
3151 if (y
->color
== MEM_RED
)
3153 /* Uncle and parent are red but should be black because
3154 X is red. Change the colors accordingly and proceed
3155 with the grandparent. */
3156 x
->parent
->color
= MEM_BLACK
;
3157 y
->color
= MEM_BLACK
;
3158 x
->parent
->parent
->color
= MEM_RED
;
3159 x
= x
->parent
->parent
;
3163 /* Parent and uncle have different colors; parent is
3164 red, uncle is black. */
3165 if (x
== x
->parent
->right
)
3168 mem_rotate_left (x
);
3171 x
->parent
->color
= MEM_BLACK
;
3172 x
->parent
->parent
->color
= MEM_RED
;
3173 mem_rotate_right (x
->parent
->parent
);
3178 /* This is the symmetrical case of above. */
3179 struct mem_node
*y
= x
->parent
->parent
->left
;
3181 if (y
->color
== MEM_RED
)
3183 x
->parent
->color
= MEM_BLACK
;
3184 y
->color
= MEM_BLACK
;
3185 x
->parent
->parent
->color
= MEM_RED
;
3186 x
= x
->parent
->parent
;
3190 if (x
== x
->parent
->left
)
3193 mem_rotate_right (x
);
3196 x
->parent
->color
= MEM_BLACK
;
3197 x
->parent
->parent
->color
= MEM_RED
;
3198 mem_rotate_left (x
->parent
->parent
);
3203 /* The root may have been changed to red due to the algorithm. Set
3204 it to black so that property #5 is satisfied. */
3205 mem_root
->color
= MEM_BLACK
;
3221 /* Turn y's left sub-tree into x's right sub-tree. */
3224 if (y
->left
!= MEM_NIL
)
3225 y
->left
->parent
= x
;
3227 /* Y's parent was x's parent. */
3229 y
->parent
= x
->parent
;
3231 /* Get the parent to point to y instead of x. */
3234 if (x
== x
->parent
->left
)
3235 x
->parent
->left
= y
;
3237 x
->parent
->right
= y
;
3242 /* Put x on y's left. */
3256 mem_rotate_right (x
)
3259 struct mem_node
*y
= x
->left
;
3262 if (y
->right
!= MEM_NIL
)
3263 y
->right
->parent
= x
;
3266 y
->parent
= x
->parent
;
3269 if (x
== x
->parent
->right
)
3270 x
->parent
->right
= y
;
3272 x
->parent
->left
= y
;
3283 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
3289 struct mem_node
*x
, *y
;
3291 if (!z
|| z
== MEM_NIL
)
3294 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
3299 while (y
->left
!= MEM_NIL
)
3303 if (y
->left
!= MEM_NIL
)
3308 x
->parent
= y
->parent
;
3311 if (y
== y
->parent
->left
)
3312 y
->parent
->left
= x
;
3314 y
->parent
->right
= x
;
3321 z
->start
= y
->start
;
3326 if (y
->color
== MEM_BLACK
)
3327 mem_delete_fixup (x
);
3329 #ifdef GC_MALLOC_CHECK
3337 /* Re-establish the red-black properties of the tree, after a
3341 mem_delete_fixup (x
)
3344 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
3346 if (x
== x
->parent
->left
)
3348 struct mem_node
*w
= x
->parent
->right
;
3350 if (w
->color
== MEM_RED
)
3352 w
->color
= MEM_BLACK
;
3353 x
->parent
->color
= MEM_RED
;
3354 mem_rotate_left (x
->parent
);
3355 w
= x
->parent
->right
;
3358 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
3365 if (w
->right
->color
== MEM_BLACK
)
3367 w
->left
->color
= MEM_BLACK
;
3369 mem_rotate_right (w
);
3370 w
= x
->parent
->right
;
3372 w
->color
= x
->parent
->color
;
3373 x
->parent
->color
= MEM_BLACK
;
3374 w
->right
->color
= MEM_BLACK
;
3375 mem_rotate_left (x
->parent
);
3381 struct mem_node
*w
= x
->parent
->left
;
3383 if (w
->color
== MEM_RED
)
3385 w
->color
= MEM_BLACK
;
3386 x
->parent
->color
= MEM_RED
;
3387 mem_rotate_right (x
->parent
);
3388 w
= x
->parent
->left
;
3391 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
3398 if (w
->left
->color
== MEM_BLACK
)
3400 w
->right
->color
= MEM_BLACK
;
3402 mem_rotate_left (w
);
3403 w
= x
->parent
->left
;
3406 w
->color
= x
->parent
->color
;
3407 x
->parent
->color
= MEM_BLACK
;
3408 w
->left
->color
= MEM_BLACK
;
3409 mem_rotate_right (x
->parent
);
3415 x
->color
= MEM_BLACK
;
3419 /* Value is non-zero if P is a pointer to a live Lisp string on
3420 the heap. M is a pointer to the mem_block for P. */
3423 live_string_p (m
, p
)
3427 if (m
->type
== MEM_TYPE_STRING
)
3429 struct string_block
*b
= (struct string_block
*) m
->start
;
3430 int offset
= (char *) p
- (char *) &b
->strings
[0];
3432 /* P must point to the start of a Lisp_String structure, and it
3433 must not be on the free-list. */
3435 && offset
% sizeof b
->strings
[0] == 0
3436 && offset
< (STRING_BLOCK_SIZE
* sizeof b
->strings
[0])
3437 && ((struct Lisp_String
*) p
)->data
!= NULL
);
3444 /* Value is non-zero if P is a pointer to a live Lisp cons on
3445 the heap. M is a pointer to the mem_block for P. */
3452 if (m
->type
== MEM_TYPE_CONS
)
3454 struct cons_block
*b
= (struct cons_block
*) m
->start
;
3455 int offset
= (char *) p
- (char *) &b
->conses
[0];
3457 /* P must point to the start of a Lisp_Cons, not be
3458 one of the unused cells in the current cons block,
3459 and not be on the free-list. */
3461 && offset
% sizeof b
->conses
[0] == 0
3462 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
3464 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
3465 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
3472 /* Value is non-zero if P is a pointer to a live Lisp symbol on
3473 the heap. M is a pointer to the mem_block for P. */
3476 live_symbol_p (m
, p
)
3480 if (m
->type
== MEM_TYPE_SYMBOL
)
3482 struct symbol_block
*b
= (struct symbol_block
*) m
->start
;
3483 int offset
= (char *) p
- (char *) &b
->symbols
[0];
3485 /* P must point to the start of a Lisp_Symbol, not be
3486 one of the unused cells in the current symbol block,
3487 and not be on the free-list. */
3489 && offset
% sizeof b
->symbols
[0] == 0
3490 && offset
< (SYMBOL_BLOCK_SIZE
* sizeof b
->symbols
[0])
3491 && (b
!= symbol_block
3492 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
3493 && !EQ (((struct Lisp_Symbol
*) p
)->function
, Vdead
));
3500 /* Value is non-zero if P is a pointer to a live Lisp float on
3501 the heap. M is a pointer to the mem_block for P. */
3508 if (m
->type
== MEM_TYPE_FLOAT
)
3510 struct float_block
*b
= (struct float_block
*) m
->start
;
3511 int offset
= (char *) p
- (char *) &b
->floats
[0];
3513 /* P must point to the start of a Lisp_Float and not be
3514 one of the unused cells in the current float block. */
3516 && offset
% sizeof b
->floats
[0] == 0
3517 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
3518 && (b
!= float_block
3519 || offset
/ sizeof b
->floats
[0] < float_block_index
));
3526 /* Value is non-zero if P is a pointer to a live Lisp Misc on
3527 the heap. M is a pointer to the mem_block for P. */
3534 if (m
->type
== MEM_TYPE_MISC
)
3536 struct marker_block
*b
= (struct marker_block
*) m
->start
;
3537 int offset
= (char *) p
- (char *) &b
->markers
[0];
3539 /* P must point to the start of a Lisp_Misc, not be
3540 one of the unused cells in the current misc block,
3541 and not be on the free-list. */
3543 && offset
% sizeof b
->markers
[0] == 0
3544 && offset
< (MARKER_BLOCK_SIZE
* sizeof b
->markers
[0])
3545 && (b
!= marker_block
3546 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
3547 && ((union Lisp_Misc
*) p
)->u_marker
.type
!= Lisp_Misc_Free
);
3554 /* Value is non-zero if P is a pointer to a live vector-like object.
3555 M is a pointer to the mem_block for P. */
3558 live_vector_p (m
, p
)
3562 return (p
== m
->start
3563 && m
->type
>= MEM_TYPE_VECTOR
3564 && m
->type
<= MEM_TYPE_WINDOW
);
3568 /* Value is non-zero if P is a pointer to a live buffer. M is a
3569 pointer to the mem_block for P. */
3572 live_buffer_p (m
, p
)
3576 /* P must point to the start of the block, and the buffer
3577 must not have been killed. */
3578 return (m
->type
== MEM_TYPE_BUFFER
3580 && !NILP (((struct buffer
*) p
)->name
));
3583 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
3587 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3589 /* Array of objects that are kept alive because the C stack contains
3590 a pattern that looks like a reference to them . */
3592 #define MAX_ZOMBIES 10
3593 static Lisp_Object zombies
[MAX_ZOMBIES
];
3595 /* Number of zombie objects. */
3597 static int nzombies
;
3599 /* Number of garbage collections. */
3603 /* Average percentage of zombies per collection. */
3605 static double avg_zombies
;
3607 /* Max. number of live and zombie objects. */
3609 static int max_live
, max_zombies
;
3611 /* Average number of live objects per GC. */
3613 static double avg_live
;
3615 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
3616 doc
: /* Show information about live and zombie objects. */)
3619 Lisp_Object args
[8], zombie_list
= Qnil
;
3621 for (i
= 0; i
< nzombies
; i
++)
3622 zombie_list
= Fcons (zombies
[i
], zombie_list
);
3623 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
3624 args
[1] = make_number (ngcs
);
3625 args
[2] = make_float (avg_live
);
3626 args
[3] = make_float (avg_zombies
);
3627 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
3628 args
[5] = make_number (max_live
);
3629 args
[6] = make_number (max_zombies
);
3630 args
[7] = zombie_list
;
3631 return Fmessage (8, args
);
3634 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
3637 /* Mark OBJ if we can prove it's a Lisp_Object. */
3640 mark_maybe_object (obj
)
3643 void *po
= (void *) XPNTR (obj
);
3644 struct mem_node
*m
= mem_find (po
);
3650 switch (XGCTYPE (obj
))
3653 mark_p
= (live_string_p (m
, po
)
3654 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
3658 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
3662 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
3666 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
3669 case Lisp_Vectorlike
:
3670 /* Note: can't check GC_BUFFERP before we know it's a
3671 buffer because checking that dereferences the pointer
3672 PO which might point anywhere. */
3673 if (live_vector_p (m
, po
))
3674 mark_p
= !GC_SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
3675 else if (live_buffer_p (m
, po
))
3676 mark_p
= GC_BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
3680 mark_p
= (live_misc_p (m
, po
) && !XMARKER (obj
)->gcmarkbit
);
3684 case Lisp_Type_Limit
:
3690 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3691 if (nzombies
< MAX_ZOMBIES
)
3692 zombies
[nzombies
] = obj
;
3701 /* If P points to Lisp data, mark that as live if it isn't already
3705 mark_maybe_pointer (p
)
3710 /* Quickly rule out some values which can't point to Lisp data. We
3711 assume that Lisp data is aligned on even addresses. */
3712 if ((EMACS_INT
) p
& 1)
3718 Lisp_Object obj
= Qnil
;
3722 case MEM_TYPE_NON_LISP
:
3723 /* Nothing to do; not a pointer to Lisp memory. */
3726 case MEM_TYPE_BUFFER
:
3727 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P((struct buffer
*)p
))
3728 XSETVECTOR (obj
, p
);
3732 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
3736 case MEM_TYPE_STRING
:
3737 if (live_string_p (m
, p
)
3738 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
3739 XSETSTRING (obj
, p
);
3743 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
3747 case MEM_TYPE_SYMBOL
:
3748 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
3749 XSETSYMBOL (obj
, p
);
3752 case MEM_TYPE_FLOAT
:
3753 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
3757 case MEM_TYPE_VECTOR
:
3758 case MEM_TYPE_PROCESS
:
3759 case MEM_TYPE_HASH_TABLE
:
3760 case MEM_TYPE_FRAME
:
3761 case MEM_TYPE_WINDOW
:
3762 if (live_vector_p (m
, p
))
3765 XSETVECTOR (tem
, p
);
3766 if (!GC_SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
3781 /* Mark Lisp objects referenced from the address range START..END. */
3784 mark_memory (start
, end
)
3790 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3794 /* Make START the pointer to the start of the memory region,
3795 if it isn't already. */
3803 /* Mark Lisp_Objects. */
3804 for (p
= (Lisp_Object
*) start
; (void *) p
< end
; ++p
)
3805 mark_maybe_object (*p
);
3807 /* Mark Lisp data pointed to. This is necessary because, in some
3808 situations, the C compiler optimizes Lisp objects away, so that
3809 only a pointer to them remains. Example:
3811 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
3814 Lisp_Object obj = build_string ("test");
3815 struct Lisp_String *s = XSTRING (obj);
3816 Fgarbage_collect ();
3817 fprintf (stderr, "test `%s'\n", s->data);
3821 Here, `obj' isn't really used, and the compiler optimizes it
3822 away. The only reference to the life string is through the
3825 for (pp
= (void **) start
; (void *) pp
< end
; ++pp
)
3826 mark_maybe_pointer (*pp
);
3829 /* setjmp will work with GCC unless NON_SAVING_SETJMP is defined in
3830 the GCC system configuration. In gcc 3.2, the only systems for
3831 which this is so are i386-sco5 non-ELF, i386-sysv3 (maybe included
3832 by others?) and ns32k-pc532-min. */
3834 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
3836 static int setjmp_tested_p
, longjmps_done
;
3838 #define SETJMP_WILL_LIKELY_WORK "\
3840 Emacs garbage collector has been changed to use conservative stack\n\
3841 marking. Emacs has determined that the method it uses to do the\n\
3842 marking will likely work on your system, but this isn't sure.\n\
3844 If you are a system-programmer, or can get the help of a local wizard\n\
3845 who is, please take a look at the function mark_stack in alloc.c, and\n\
3846 verify that the methods used are appropriate for your system.\n\
3848 Please mail the result to <emacs-devel@gnu.org>.\n\
3851 #define SETJMP_WILL_NOT_WORK "\
3853 Emacs garbage collector has been changed to use conservative stack\n\
3854 marking. Emacs has determined that the default method it uses to do the\n\
3855 marking will not work on your system. We will need a system-dependent\n\
3856 solution for your system.\n\
3858 Please take a look at the function mark_stack in alloc.c, and\n\
3859 try to find a way to make it work on your system.\n\
3861 Note that you may get false negatives, depending on the compiler.\n\
3862 In particular, you need to use -O with GCC for this test.\n\
3864 Please mail the result to <emacs-devel@gnu.org>.\n\
3868 /* Perform a quick check if it looks like setjmp saves registers in a
3869 jmp_buf. Print a message to stderr saying so. When this test
3870 succeeds, this is _not_ a proof that setjmp is sufficient for
3871 conservative stack marking. Only the sources or a disassembly
3882 /* Arrange for X to be put in a register. */
3888 if (longjmps_done
== 1)
3890 /* Came here after the longjmp at the end of the function.
3892 If x == 1, the longjmp has restored the register to its
3893 value before the setjmp, and we can hope that setjmp
3894 saves all such registers in the jmp_buf, although that
3897 For other values of X, either something really strange is
3898 taking place, or the setjmp just didn't save the register. */
3901 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
3904 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
3911 if (longjmps_done
== 1)
3915 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
3918 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
3920 /* Abort if anything GCPRO'd doesn't survive the GC. */
3928 for (p
= gcprolist
; p
; p
= p
->next
)
3929 for (i
= 0; i
< p
->nvars
; ++i
)
3930 if (!survives_gc_p (p
->var
[i
]))
3931 /* FIXME: It's not necessarily a bug. It might just be that the
3932 GCPRO is unnecessary or should release the object sooner. */
3936 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3943 fprintf (stderr
, "\nZombies kept alive = %d:\n", nzombies
);
3944 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
3946 fprintf (stderr
, " %d = ", i
);
3947 debug_print (zombies
[i
]);
3951 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
3954 /* Mark live Lisp objects on the C stack.
3956 There are several system-dependent problems to consider when
3957 porting this to new architectures:
3961 We have to mark Lisp objects in CPU registers that can hold local
3962 variables or are used to pass parameters.
3964 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
3965 something that either saves relevant registers on the stack, or
3966 calls mark_maybe_object passing it each register's contents.
3968 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
3969 implementation assumes that calling setjmp saves registers we need
3970 to see in a jmp_buf which itself lies on the stack. This doesn't
3971 have to be true! It must be verified for each system, possibly
3972 by taking a look at the source code of setjmp.
3976 Architectures differ in the way their processor stack is organized.
3977 For example, the stack might look like this
3980 | Lisp_Object | size = 4
3982 | something else | size = 2
3984 | Lisp_Object | size = 4
3988 In such a case, not every Lisp_Object will be aligned equally. To
3989 find all Lisp_Object on the stack it won't be sufficient to walk
3990 the stack in steps of 4 bytes. Instead, two passes will be
3991 necessary, one starting at the start of the stack, and a second
3992 pass starting at the start of the stack + 2. Likewise, if the
3993 minimal alignment of Lisp_Objects on the stack is 1, four passes
3994 would be necessary, each one starting with one byte more offset
3995 from the stack start.
3997 The current code assumes by default that Lisp_Objects are aligned
3998 equally on the stack. */
4005 volatile int stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
4008 /* This trick flushes the register windows so that all the state of
4009 the process is contained in the stack. */
4010 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
4011 needed on ia64 too. See mach_dep.c, where it also says inline
4012 assembler doesn't work with relevant proprietary compilers. */
4017 /* Save registers that we need to see on the stack. We need to see
4018 registers used to hold register variables and registers used to
4020 #ifdef GC_SAVE_REGISTERS_ON_STACK
4021 GC_SAVE_REGISTERS_ON_STACK (end
);
4022 #else /* not GC_SAVE_REGISTERS_ON_STACK */
4024 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
4025 setjmp will definitely work, test it
4026 and print a message with the result
4028 if (!setjmp_tested_p
)
4030 setjmp_tested_p
= 1;
4033 #endif /* GC_SETJMP_WORKS */
4036 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
4037 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
4039 /* This assumes that the stack is a contiguous region in memory. If
4040 that's not the case, something has to be done here to iterate
4041 over the stack segments. */
4042 #ifndef GC_LISP_OBJECT_ALIGNMENT
4044 #define GC_LISP_OBJECT_ALIGNMENT __alignof__ (Lisp_Object)
4046 #define GC_LISP_OBJECT_ALIGNMENT sizeof (Lisp_Object)
4049 for (i
= 0; i
< sizeof (Lisp_Object
); i
+= GC_LISP_OBJECT_ALIGNMENT
)
4050 mark_memory ((char *) stack_base
+ i
, end
);
4052 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4058 #endif /* GC_MARK_STACK != 0 */
4062 /***********************************************************************
4063 Pure Storage Management
4064 ***********************************************************************/
4066 /* Allocate room for SIZE bytes from pure Lisp storage and return a
4067 pointer to it. TYPE is the Lisp type for which the memory is
4068 allocated. TYPE < 0 means it's not used for a Lisp object.
4070 If store_pure_type_info is set and TYPE is >= 0, the type of
4071 the allocated object is recorded in pure_types. */
4073 static POINTER_TYPE
*
4074 pure_alloc (size
, type
)
4078 POINTER_TYPE
*result
;
4079 size_t alignment
= sizeof (EMACS_INT
);
4081 /* Give Lisp_Floats an extra alignment. */
4082 if (type
== Lisp_Float
)
4084 #if defined __GNUC__ && __GNUC__ >= 2
4085 alignment
= __alignof (struct Lisp_Float
);
4087 alignment
= sizeof (struct Lisp_Float
);
4092 result
= ALIGN (purebeg
+ pure_bytes_used
, alignment
);
4093 pure_bytes_used
= ((char *)result
- (char *)purebeg
) + size
;
4095 if (pure_bytes_used
<= pure_size
)
4098 /* Don't allocate a large amount here,
4099 because it might get mmap'd and then its address
4100 might not be usable. */
4101 purebeg
= (char *) xmalloc (10000);
4103 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
4104 pure_bytes_used
= 0;
4109 /* Print a warning if PURESIZE is too small. */
4114 if (pure_bytes_used_before_overflow
)
4115 message ("Pure Lisp storage overflow (approx. %d bytes needed)",
4116 (int) (pure_bytes_used
+ pure_bytes_used_before_overflow
));
4120 /* Return a string allocated in pure space. DATA is a buffer holding
4121 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
4122 non-zero means make the result string multibyte.
4124 Must get an error if pure storage is full, since if it cannot hold
4125 a large string it may be able to hold conses that point to that
4126 string; then the string is not protected from gc. */
4129 make_pure_string (data
, nchars
, nbytes
, multibyte
)
4135 struct Lisp_String
*s
;
4137 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4138 s
->data
= (unsigned char *) pure_alloc (nbytes
+ 1, -1);
4140 s
->size_byte
= multibyte
? nbytes
: -1;
4141 bcopy (data
, s
->data
, nbytes
);
4142 s
->data
[nbytes
] = '\0';
4143 s
->intervals
= NULL_INTERVAL
;
4144 XSETSTRING (string
, s
);
4149 /* Return a cons allocated from pure space. Give it pure copies
4150 of CAR as car and CDR as cdr. */
4153 pure_cons (car
, cdr
)
4154 Lisp_Object car
, cdr
;
4156 register Lisp_Object
new;
4157 struct Lisp_Cons
*p
;
4159 p
= (struct Lisp_Cons
*) pure_alloc (sizeof *p
, Lisp_Cons
);
4161 XSETCAR (new, Fpurecopy (car
));
4162 XSETCDR (new, Fpurecopy (cdr
));
4167 /* Value is a float object with value NUM allocated from pure space. */
4170 make_pure_float (num
)
4173 register Lisp_Object
new;
4174 struct Lisp_Float
*p
;
4176 p
= (struct Lisp_Float
*) pure_alloc (sizeof *p
, Lisp_Float
);
4178 XFLOAT_DATA (new) = num
;
4183 /* Return a vector with room for LEN Lisp_Objects allocated from
4187 make_pure_vector (len
)
4191 struct Lisp_Vector
*p
;
4192 size_t size
= sizeof *p
+ (len
- 1) * sizeof (Lisp_Object
);
4194 p
= (struct Lisp_Vector
*) pure_alloc (size
, Lisp_Vectorlike
);
4195 XSETVECTOR (new, p
);
4196 XVECTOR (new)->size
= len
;
4201 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
4202 doc
: /* Make a copy of OBJECT in pure storage.
4203 Recursively copies contents of vectors and cons cells.
4204 Does not copy symbols. Copies strings without text properties. */)
4206 register Lisp_Object obj
;
4208 if (NILP (Vpurify_flag
))
4211 if (PURE_POINTER_P (XPNTR (obj
)))
4215 return pure_cons (XCAR (obj
), XCDR (obj
));
4216 else if (FLOATP (obj
))
4217 return make_pure_float (XFLOAT_DATA (obj
));
4218 else if (STRINGP (obj
))
4219 return make_pure_string (SDATA (obj
), SCHARS (obj
),
4221 STRING_MULTIBYTE (obj
));
4222 else if (COMPILEDP (obj
) || VECTORP (obj
))
4224 register struct Lisp_Vector
*vec
;
4225 register int i
, size
;
4227 size
= XVECTOR (obj
)->size
;
4228 if (size
& PSEUDOVECTOR_FLAG
)
4229 size
&= PSEUDOVECTOR_SIZE_MASK
;
4230 vec
= XVECTOR (make_pure_vector ((EMACS_INT
) size
));
4231 for (i
= 0; i
< size
; i
++)
4232 vec
->contents
[i
] = Fpurecopy (XVECTOR (obj
)->contents
[i
]);
4233 if (COMPILEDP (obj
))
4234 XSETCOMPILED (obj
, vec
);
4236 XSETVECTOR (obj
, vec
);
4239 else if (MARKERP (obj
))
4240 error ("Attempt to copy a marker to pure storage");
4247 /***********************************************************************
4249 ***********************************************************************/
4251 /* Put an entry in staticvec, pointing at the variable with address
4255 staticpro (varaddress
)
4256 Lisp_Object
*varaddress
;
4258 staticvec
[staticidx
++] = varaddress
;
4259 if (staticidx
>= NSTATICS
)
4267 struct catchtag
*next
;
4272 struct backtrace
*next
;
4273 Lisp_Object
*function
;
4274 Lisp_Object
*args
; /* Points to vector of args. */
4275 int nargs
; /* Length of vector. */
4276 /* If nargs is UNEVALLED, args points to slot holding list of
4283 /***********************************************************************
4285 ***********************************************************************/
4287 /* Temporarily prevent garbage collection. */
4290 inhibit_garbage_collection ()
4292 int count
= SPECPDL_INDEX ();
4293 int nbits
= min (VALBITS
, BITS_PER_INT
);
4295 specbind (Qgc_cons_threshold
, make_number (((EMACS_INT
) 1 << (nbits
- 1)) - 1));
4300 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
4301 doc
: /* Reclaim storage for Lisp objects no longer needed.
4302 Garbage collection happens automatically if you cons more than
4303 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
4304 `garbage-collect' normally returns a list with info on amount of space in use:
4305 ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)
4306 (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS
4307 (USED-FLOATS . FREE-FLOATS) (USED-INTERVALS . FREE-INTERVALS)
4308 (USED-STRINGS . FREE-STRINGS))
4309 However, if there was overflow in pure space, `garbage-collect'
4310 returns nil, because real GC can't be done. */)
4313 register struct specbinding
*bind
;
4314 struct catchtag
*catch;
4315 struct handler
*handler
;
4316 register struct backtrace
*backlist
;
4317 char stack_top_variable
;
4320 Lisp_Object total
[8];
4321 int count
= SPECPDL_INDEX ();
4322 EMACS_TIME t1
, t2
, t3
;
4327 EMACS_GET_TIME (t1
);
4329 /* Can't GC if pure storage overflowed because we can't determine
4330 if something is a pure object or not. */
4331 if (pure_bytes_used_before_overflow
)
4334 /* In case user calls debug_print during GC,
4335 don't let that cause a recursive GC. */
4336 consing_since_gc
= 0;
4338 /* Save what's currently displayed in the echo area. */
4339 message_p
= push_message ();
4340 record_unwind_protect (pop_message_unwind
, Qnil
);
4342 /* Save a copy of the contents of the stack, for debugging. */
4343 #if MAX_SAVE_STACK > 0
4344 if (NILP (Vpurify_flag
))
4346 i
= &stack_top_variable
- stack_bottom
;
4348 if (i
< MAX_SAVE_STACK
)
4350 if (stack_copy
== 0)
4351 stack_copy
= (char *) xmalloc (stack_copy_size
= i
);
4352 else if (stack_copy_size
< i
)
4353 stack_copy
= (char *) xrealloc (stack_copy
, (stack_copy_size
= i
));
4356 if ((EMACS_INT
) (&stack_top_variable
- stack_bottom
) > 0)
4357 bcopy (stack_bottom
, stack_copy
, i
);
4359 bcopy (&stack_top_variable
, stack_copy
, i
);
4363 #endif /* MAX_SAVE_STACK > 0 */
4365 if (garbage_collection_messages
)
4366 message1_nolog ("Garbage collecting...");
4370 shrink_regexp_cache ();
4372 /* Don't keep undo information around forever. */
4374 register struct buffer
*nextb
= all_buffers
;
4378 /* If a buffer's undo list is Qt, that means that undo is
4379 turned off in that buffer. Calling truncate_undo_list on
4380 Qt tends to return NULL, which effectively turns undo back on.
4381 So don't call truncate_undo_list if undo_list is Qt. */
4382 if (! EQ (nextb
->undo_list
, Qt
))
4384 = truncate_undo_list (nextb
->undo_list
, undo_limit
,
4387 /* Shrink buffer gaps, but skip indirect and dead buffers. */
4388 if (nextb
->base_buffer
== 0 && !NILP (nextb
->name
))
4390 /* If a buffer's gap size is more than 10% of the buffer
4391 size, or larger than 2000 bytes, then shrink it
4392 accordingly. Keep a minimum size of 20 bytes. */
4393 int size
= min (2000, max (20, (nextb
->text
->z_byte
/ 10)));
4395 if (nextb
->text
->gap_size
> size
)
4397 struct buffer
*save_current
= current_buffer
;
4398 current_buffer
= nextb
;
4399 make_gap (-(nextb
->text
->gap_size
- size
));
4400 current_buffer
= save_current
;
4404 nextb
= nextb
->next
;
4410 /* clear_marks (); */
4412 /* Mark all the special slots that serve as the roots of accessibility. */
4414 for (i
= 0; i
< staticidx
; i
++)
4415 mark_object (*staticvec
[i
]);
4417 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
4418 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
4422 register struct gcpro
*tail
;
4423 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
4424 for (i
= 0; i
< tail
->nvars
; i
++)
4425 mark_object (tail
->var
[i
]);
4430 for (bind
= specpdl
; bind
!= specpdl_ptr
; bind
++)
4432 mark_object (bind
->symbol
);
4433 mark_object (bind
->old_value
);
4435 for (catch = catchlist
; catch; catch = catch->next
)
4437 mark_object (catch->tag
);
4438 mark_object (catch->val
);
4440 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
4442 mark_object (handler
->handler
);
4443 mark_object (handler
->var
);
4445 for (backlist
= backtrace_list
; backlist
; backlist
= backlist
->next
)
4447 mark_object (*backlist
->function
);
4449 if (backlist
->nargs
== UNEVALLED
|| backlist
->nargs
== MANY
)
4452 i
= backlist
->nargs
- 1;
4454 mark_object (backlist
->args
[i
]);
4458 /* Look thru every buffer's undo list
4459 for elements that update markers that were not marked,
4462 register struct buffer
*nextb
= all_buffers
;
4466 /* If a buffer's undo list is Qt, that means that undo is
4467 turned off in that buffer. Calling truncate_undo_list on
4468 Qt tends to return NULL, which effectively turns undo back on.
4469 So don't call truncate_undo_list if undo_list is Qt. */
4470 if (! EQ (nextb
->undo_list
, Qt
))
4472 Lisp_Object tail
, prev
;
4473 tail
= nextb
->undo_list
;
4475 while (CONSP (tail
))
4477 if (GC_CONSP (XCAR (tail
))
4478 && GC_MARKERP (XCAR (XCAR (tail
)))
4479 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
4482 nextb
->undo_list
= tail
= XCDR (tail
);
4486 XSETCDR (prev
, tail
);
4497 nextb
= nextb
->next
;
4501 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4507 extern void xg_mark_data ();
4514 /* Clear the mark bits that we set in certain root slots. */
4516 unmark_byte_stack ();
4517 VECTOR_UNMARK (&buffer_defaults
);
4518 VECTOR_UNMARK (&buffer_local_symbols
);
4520 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
4526 /* clear_marks (); */
4529 consing_since_gc
= 0;
4530 if (gc_cons_threshold
< 10000)
4531 gc_cons_threshold
= 10000;
4533 if (garbage_collection_messages
)
4535 if (message_p
|| minibuf_level
> 0)
4538 message1_nolog ("Garbage collecting...done");
4541 unbind_to (count
, Qnil
);
4543 total
[0] = Fcons (make_number (total_conses
),
4544 make_number (total_free_conses
));
4545 total
[1] = Fcons (make_number (total_symbols
),
4546 make_number (total_free_symbols
));
4547 total
[2] = Fcons (make_number (total_markers
),
4548 make_number (total_free_markers
));
4549 total
[3] = make_number (total_string_size
);
4550 total
[4] = make_number (total_vector_size
);
4551 total
[5] = Fcons (make_number (total_floats
),
4552 make_number (total_free_floats
));
4553 total
[6] = Fcons (make_number (total_intervals
),
4554 make_number (total_free_intervals
));
4555 total
[7] = Fcons (make_number (total_strings
),
4556 make_number (total_free_strings
));
4558 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4560 /* Compute average percentage of zombies. */
4563 for (i
= 0; i
< 7; ++i
)
4564 if (CONSP (total
[i
]))
4565 nlive
+= XFASTINT (XCAR (total
[i
]));
4567 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
4568 max_live
= max (nlive
, max_live
);
4569 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
4570 max_zombies
= max (nzombies
, max_zombies
);
4575 if (!NILP (Vpost_gc_hook
))
4577 int count
= inhibit_garbage_collection ();
4578 safe_run_hooks (Qpost_gc_hook
);
4579 unbind_to (count
, Qnil
);
4582 /* Accumulate statistics. */
4583 EMACS_GET_TIME (t2
);
4584 EMACS_SUB_TIME (t3
, t2
, t1
);
4585 if (FLOATP (Vgc_elapsed
))
4586 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
) +
4588 EMACS_USECS (t3
) * 1.0e-6);
4591 return Flist (sizeof total
/ sizeof *total
, total
);
4595 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
4596 only interesting objects referenced from glyphs are strings. */
4599 mark_glyph_matrix (matrix
)
4600 struct glyph_matrix
*matrix
;
4602 struct glyph_row
*row
= matrix
->rows
;
4603 struct glyph_row
*end
= row
+ matrix
->nrows
;
4605 for (; row
< end
; ++row
)
4609 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
4611 struct glyph
*glyph
= row
->glyphs
[area
];
4612 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
4614 for (; glyph
< end_glyph
; ++glyph
)
4615 if (GC_STRINGP (glyph
->object
)
4616 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
4617 mark_object (glyph
->object
);
4623 /* Mark Lisp faces in the face cache C. */
4627 struct face_cache
*c
;
4632 for (i
= 0; i
< c
->used
; ++i
)
4634 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
4638 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
4639 mark_object (face
->lface
[j
]);
4646 #ifdef HAVE_WINDOW_SYSTEM
4648 /* Mark Lisp objects in image IMG. */
4654 mark_object (img
->spec
);
4656 if (!NILP (img
->data
.lisp_val
))
4657 mark_object (img
->data
.lisp_val
);
4661 /* Mark Lisp objects in image cache of frame F. It's done this way so
4662 that we don't have to include xterm.h here. */
4665 mark_image_cache (f
)
4668 forall_images_in_image_cache (f
, mark_image
);
4671 #endif /* HAVE_X_WINDOWS */
4675 /* Mark reference to a Lisp_Object.
4676 If the object referred to has not been seen yet, recursively mark
4677 all the references contained in it. */
4679 #define LAST_MARKED_SIZE 500
4680 Lisp_Object last_marked
[LAST_MARKED_SIZE
];
4681 int last_marked_index
;
4683 /* For debugging--call abort when we cdr down this many
4684 links of a list, in mark_object. In debugging,
4685 the call to abort will hit a breakpoint.
4686 Normally this is zero and the check never goes off. */
4687 int mark_object_loop_halt
;
4693 register Lisp_Object obj
= arg
;
4694 #ifdef GC_CHECK_MARKED_OBJECTS
4702 if (PURE_POINTER_P (XPNTR (obj
)))
4705 last_marked
[last_marked_index
++] = obj
;
4706 if (last_marked_index
== LAST_MARKED_SIZE
)
4707 last_marked_index
= 0;
4709 /* Perform some sanity checks on the objects marked here. Abort if
4710 we encounter an object we know is bogus. This increases GC time
4711 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
4712 #ifdef GC_CHECK_MARKED_OBJECTS
4714 po
= (void *) XPNTR (obj
);
4716 /* Check that the object pointed to by PO is known to be a Lisp
4717 structure allocated from the heap. */
4718 #define CHECK_ALLOCATED() \
4720 m = mem_find (po); \
4725 /* Check that the object pointed to by PO is live, using predicate
4727 #define CHECK_LIVE(LIVEP) \
4729 if (!LIVEP (m, po)) \
4733 /* Check both of the above conditions. */
4734 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
4736 CHECK_ALLOCATED (); \
4737 CHECK_LIVE (LIVEP); \
4740 #else /* not GC_CHECK_MARKED_OBJECTS */
4742 #define CHECK_ALLOCATED() (void) 0
4743 #define CHECK_LIVE(LIVEP) (void) 0
4744 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
4746 #endif /* not GC_CHECK_MARKED_OBJECTS */
4748 switch (SWITCH_ENUM_CAST (XGCTYPE (obj
)))
4752 register struct Lisp_String
*ptr
= XSTRING (obj
);
4753 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
4754 MARK_INTERVAL_TREE (ptr
->intervals
);
4756 #ifdef GC_CHECK_STRING_BYTES
4757 /* Check that the string size recorded in the string is the
4758 same as the one recorded in the sdata structure. */
4759 CHECK_STRING_BYTES (ptr
);
4760 #endif /* GC_CHECK_STRING_BYTES */
4764 case Lisp_Vectorlike
:
4765 #ifdef GC_CHECK_MARKED_OBJECTS
4767 if (m
== MEM_NIL
&& !GC_SUBRP (obj
)
4768 && po
!= &buffer_defaults
4769 && po
!= &buffer_local_symbols
)
4771 #endif /* GC_CHECK_MARKED_OBJECTS */
4773 if (GC_BUFFERP (obj
))
4775 if (!VECTOR_MARKED_P (XBUFFER (obj
)))
4777 #ifdef GC_CHECK_MARKED_OBJECTS
4778 if (po
!= &buffer_defaults
&& po
!= &buffer_local_symbols
)
4781 for (b
= all_buffers
; b
&& b
!= po
; b
= b
->next
)
4786 #endif /* GC_CHECK_MARKED_OBJECTS */
4790 else if (GC_SUBRP (obj
))
4792 else if (GC_COMPILEDP (obj
))
4793 /* We could treat this just like a vector, but it is better to
4794 save the COMPILED_CONSTANTS element for last and avoid
4797 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
4798 register EMACS_INT size
= ptr
->size
;
4801 if (VECTOR_MARKED_P (ptr
))
4802 break; /* Already marked */
4804 CHECK_LIVE (live_vector_p
);
4805 VECTOR_MARK (ptr
); /* Else mark it */
4806 size
&= PSEUDOVECTOR_SIZE_MASK
;
4807 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
4809 if (i
!= COMPILED_CONSTANTS
)
4810 mark_object (ptr
->contents
[i
]);
4812 obj
= ptr
->contents
[COMPILED_CONSTANTS
];
4815 else if (GC_FRAMEP (obj
))
4817 register struct frame
*ptr
= XFRAME (obj
);
4819 if (VECTOR_MARKED_P (ptr
)) break; /* Already marked */
4820 VECTOR_MARK (ptr
); /* Else mark it */
4822 CHECK_LIVE (live_vector_p
);
4823 mark_object (ptr
->name
);
4824 mark_object (ptr
->icon_name
);
4825 mark_object (ptr
->title
);
4826 mark_object (ptr
->focus_frame
);
4827 mark_object (ptr
->selected_window
);
4828 mark_object (ptr
->minibuffer_window
);
4829 mark_object (ptr
->param_alist
);
4830 mark_object (ptr
->scroll_bars
);
4831 mark_object (ptr
->condemned_scroll_bars
);
4832 mark_object (ptr
->menu_bar_items
);
4833 mark_object (ptr
->face_alist
);
4834 mark_object (ptr
->menu_bar_vector
);
4835 mark_object (ptr
->buffer_predicate
);
4836 mark_object (ptr
->buffer_list
);
4837 mark_object (ptr
->menu_bar_window
);
4838 mark_object (ptr
->tool_bar_window
);
4839 mark_face_cache (ptr
->face_cache
);
4840 #ifdef HAVE_WINDOW_SYSTEM
4841 mark_image_cache (ptr
);
4842 mark_object (ptr
->tool_bar_items
);
4843 mark_object (ptr
->desired_tool_bar_string
);
4844 mark_object (ptr
->current_tool_bar_string
);
4845 #endif /* HAVE_WINDOW_SYSTEM */
4847 else if (GC_BOOL_VECTOR_P (obj
))
4849 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
4851 if (VECTOR_MARKED_P (ptr
))
4852 break; /* Already marked */
4853 CHECK_LIVE (live_vector_p
);
4854 VECTOR_MARK (ptr
); /* Else mark it */
4856 else if (GC_WINDOWP (obj
))
4858 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
4859 struct window
*w
= XWINDOW (obj
);
4862 /* Stop if already marked. */
4863 if (VECTOR_MARKED_P (ptr
))
4867 CHECK_LIVE (live_vector_p
);
4870 /* There is no Lisp data above The member CURRENT_MATRIX in
4871 struct WINDOW. Stop marking when that slot is reached. */
4873 (char *) &ptr
->contents
[i
] < (char *) &w
->current_matrix
;
4875 mark_object (ptr
->contents
[i
]);
4877 /* Mark glyphs for leaf windows. Marking window matrices is
4878 sufficient because frame matrices use the same glyph
4880 if (NILP (w
->hchild
)
4882 && w
->current_matrix
)
4884 mark_glyph_matrix (w
->current_matrix
);
4885 mark_glyph_matrix (w
->desired_matrix
);
4888 else if (GC_HASH_TABLE_P (obj
))
4890 struct Lisp_Hash_Table
*h
= XHASH_TABLE (obj
);
4892 /* Stop if already marked. */
4893 if (VECTOR_MARKED_P (h
))
4897 CHECK_LIVE (live_vector_p
);
4900 /* Mark contents. */
4901 /* Do not mark next_free or next_weak.
4902 Being in the next_weak chain
4903 should not keep the hash table alive.
4904 No need to mark `count' since it is an integer. */
4905 mark_object (h
->test
);
4906 mark_object (h
->weak
);
4907 mark_object (h
->rehash_size
);
4908 mark_object (h
->rehash_threshold
);
4909 mark_object (h
->hash
);
4910 mark_object (h
->next
);
4911 mark_object (h
->index
);
4912 mark_object (h
->user_hash_function
);
4913 mark_object (h
->user_cmp_function
);
4915 /* If hash table is not weak, mark all keys and values.
4916 For weak tables, mark only the vector. */
4917 if (GC_NILP (h
->weak
))
4918 mark_object (h
->key_and_value
);
4920 VECTOR_MARK (XVECTOR (h
->key_and_value
));
4924 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
4925 register EMACS_INT size
= ptr
->size
;
4928 if (VECTOR_MARKED_P (ptr
)) break; /* Already marked */
4929 CHECK_LIVE (live_vector_p
);
4930 VECTOR_MARK (ptr
); /* Else mark it */
4931 if (size
& PSEUDOVECTOR_FLAG
)
4932 size
&= PSEUDOVECTOR_SIZE_MASK
;
4934 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
4935 mark_object (ptr
->contents
[i
]);
4941 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
4942 struct Lisp_Symbol
*ptrx
;
4944 if (ptr
->gcmarkbit
) break;
4945 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
4947 mark_object (ptr
->value
);
4948 mark_object (ptr
->function
);
4949 mark_object (ptr
->plist
);
4951 if (!PURE_POINTER_P (XSTRING (ptr
->xname
)))
4952 MARK_STRING (XSTRING (ptr
->xname
));
4953 MARK_INTERVAL_TREE (STRING_INTERVALS (ptr
->xname
));
4955 /* Note that we do not mark the obarray of the symbol.
4956 It is safe not to do so because nothing accesses that
4957 slot except to check whether it is nil. */
4961 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun */
4962 XSETSYMBOL (obj
, ptrx
);
4969 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
4970 if (XMARKER (obj
)->gcmarkbit
)
4972 XMARKER (obj
)->gcmarkbit
= 1;
4973 switch (XMISCTYPE (obj
))
4975 case Lisp_Misc_Buffer_Local_Value
:
4976 case Lisp_Misc_Some_Buffer_Local_Value
:
4978 register struct Lisp_Buffer_Local_Value
*ptr
4979 = XBUFFER_LOCAL_VALUE (obj
);
4980 /* If the cdr is nil, avoid recursion for the car. */
4981 if (EQ (ptr
->cdr
, Qnil
))
4983 obj
= ptr
->realvalue
;
4986 mark_object (ptr
->realvalue
);
4987 mark_object (ptr
->buffer
);
4988 mark_object (ptr
->frame
);
4993 case Lisp_Misc_Marker
:
4994 /* DO NOT mark thru the marker's chain.
4995 The buffer's markers chain does not preserve markers from gc;
4996 instead, markers are removed from the chain when freed by gc. */
4997 case Lisp_Misc_Intfwd
:
4998 case Lisp_Misc_Boolfwd
:
4999 case Lisp_Misc_Objfwd
:
5000 case Lisp_Misc_Buffer_Objfwd
:
5001 case Lisp_Misc_Kboard_Objfwd
:
5002 /* Don't bother with Lisp_Buffer_Objfwd,
5003 since all markable slots in current buffer marked anyway. */
5004 /* Don't need to do Lisp_Objfwd, since the places they point
5005 are protected with staticpro. */
5006 case Lisp_Misc_Save_Value
:
5009 case Lisp_Misc_Overlay
:
5011 struct Lisp_Overlay
*ptr
= XOVERLAY (obj
);
5012 mark_object (ptr
->start
);
5013 mark_object (ptr
->end
);
5014 mark_object (ptr
->plist
);
5017 XSETMISC (obj
, ptr
->next
);
5030 register struct Lisp_Cons
*ptr
= XCONS (obj
);
5031 if (CONS_MARKED_P (ptr
)) break;
5032 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
5034 /* If the cdr is nil, avoid recursion for the car. */
5035 if (EQ (ptr
->cdr
, Qnil
))
5041 mark_object (ptr
->car
);
5044 if (cdr_count
== mark_object_loop_halt
)
5050 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
5051 FLOAT_MARK (XFLOAT (obj
));
5062 #undef CHECK_ALLOCATED
5063 #undef CHECK_ALLOCATED_AND_LIVE
5066 /* Mark the pointers in a buffer structure. */
5072 register struct buffer
*buffer
= XBUFFER (buf
);
5073 register Lisp_Object
*ptr
, tmp
;
5074 Lisp_Object base_buffer
;
5076 VECTOR_MARK (buffer
);
5078 MARK_INTERVAL_TREE (BUF_INTERVALS (buffer
));
5080 if (CONSP (buffer
->undo_list
))
5083 tail
= buffer
->undo_list
;
5085 /* We mark the undo list specially because
5086 its pointers to markers should be weak. */
5088 while (CONSP (tail
))
5090 register struct Lisp_Cons
*ptr
= XCONS (tail
);
5092 if (CONS_MARKED_P (ptr
))
5095 if (GC_CONSP (ptr
->car
)
5096 && !CONS_MARKED_P (XCONS (ptr
->car
))
5097 && GC_MARKERP (XCAR (ptr
->car
)))
5099 CONS_MARK (XCONS (ptr
->car
));
5100 mark_object (XCDR (ptr
->car
));
5103 mark_object (ptr
->car
);
5105 if (CONSP (ptr
->cdr
))
5111 mark_object (XCDR (tail
));
5114 mark_object (buffer
->undo_list
);
5116 if (buffer
->overlays_before
)
5118 XSETMISC (tmp
, buffer
->overlays_before
);
5121 if (buffer
->overlays_after
)
5123 XSETMISC (tmp
, buffer
->overlays_after
);
5127 for (ptr
= &buffer
->name
;
5128 (char *)ptr
< (char *)buffer
+ sizeof (struct buffer
);
5132 /* If this is an indirect buffer, mark its base buffer. */
5133 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
5135 XSETBUFFER (base_buffer
, buffer
->base_buffer
);
5136 mark_buffer (base_buffer
);
5141 /* Value is non-zero if OBJ will survive the current GC because it's
5142 either marked or does not need to be marked to survive. */
5150 switch (XGCTYPE (obj
))
5157 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
5161 survives_p
= XMARKER (obj
)->gcmarkbit
;
5165 survives_p
= STRING_MARKED_P (XSTRING (obj
));
5168 case Lisp_Vectorlike
:
5169 survives_p
= GC_SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
5173 survives_p
= CONS_MARKED_P (XCONS (obj
));
5177 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
5184 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
5189 /* Sweep: find all structures not marked, and free them. */
5194 /* Remove or mark entries in weak hash tables.
5195 This must be done before any object is unmarked. */
5196 sweep_weak_hash_tables ();
5199 #ifdef GC_CHECK_STRING_BYTES
5200 if (!noninteractive
)
5201 check_string_bytes (1);
5204 /* Put all unmarked conses on free list */
5206 register struct cons_block
*cblk
;
5207 struct cons_block
**cprev
= &cons_block
;
5208 register int lim
= cons_block_index
;
5209 register int num_free
= 0, num_used
= 0;
5213 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
5217 for (i
= 0; i
< lim
; i
++)
5218 if (!CONS_MARKED_P (&cblk
->conses
[i
]))
5221 *(struct Lisp_Cons
**)&cblk
->conses
[i
].cdr
= cons_free_list
;
5222 cons_free_list
= &cblk
->conses
[i
];
5224 cons_free_list
->car
= Vdead
;
5230 CONS_UNMARK (&cblk
->conses
[i
]);
5232 lim
= CONS_BLOCK_SIZE
;
5233 /* If this block contains only free conses and we have already
5234 seen more than two blocks worth of free conses then deallocate
5236 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
5238 *cprev
= cblk
->next
;
5239 /* Unhook from the free list. */
5240 cons_free_list
= *(struct Lisp_Cons
**) &cblk
->conses
[0].cdr
;
5241 lisp_align_free (cblk
);
5246 num_free
+= this_free
;
5247 cprev
= &cblk
->next
;
5250 total_conses
= num_used
;
5251 total_free_conses
= num_free
;
5254 /* Put all unmarked floats on free list */
5256 register struct float_block
*fblk
;
5257 struct float_block
**fprev
= &float_block
;
5258 register int lim
= float_block_index
;
5259 register int num_free
= 0, num_used
= 0;
5261 float_free_list
= 0;
5263 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
5267 for (i
= 0; i
< lim
; i
++)
5268 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
5271 *(struct Lisp_Float
**)&fblk
->floats
[i
].data
= float_free_list
;
5272 float_free_list
= &fblk
->floats
[i
];
5277 FLOAT_UNMARK (&fblk
->floats
[i
]);
5279 lim
= FLOAT_BLOCK_SIZE
;
5280 /* If this block contains only free floats and we have already
5281 seen more than two blocks worth of free floats then deallocate
5283 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
5285 *fprev
= fblk
->next
;
5286 /* Unhook from the free list. */
5287 float_free_list
= *(struct Lisp_Float
**) &fblk
->floats
[0].data
;
5288 lisp_align_free (fblk
);
5293 num_free
+= this_free
;
5294 fprev
= &fblk
->next
;
5297 total_floats
= num_used
;
5298 total_free_floats
= num_free
;
5301 /* Put all unmarked intervals on free list */
5303 register struct interval_block
*iblk
;
5304 struct interval_block
**iprev
= &interval_block
;
5305 register int lim
= interval_block_index
;
5306 register int num_free
= 0, num_used
= 0;
5308 interval_free_list
= 0;
5310 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
5315 for (i
= 0; i
< lim
; i
++)
5317 if (!iblk
->intervals
[i
].gcmarkbit
)
5319 SET_INTERVAL_PARENT (&iblk
->intervals
[i
], interval_free_list
);
5320 interval_free_list
= &iblk
->intervals
[i
];
5326 iblk
->intervals
[i
].gcmarkbit
= 0;
5329 lim
= INTERVAL_BLOCK_SIZE
;
5330 /* If this block contains only free intervals and we have already
5331 seen more than two blocks worth of free intervals then
5332 deallocate this block. */
5333 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
5335 *iprev
= iblk
->next
;
5336 /* Unhook from the free list. */
5337 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
5339 n_interval_blocks
--;
5343 num_free
+= this_free
;
5344 iprev
= &iblk
->next
;
5347 total_intervals
= num_used
;
5348 total_free_intervals
= num_free
;
5351 /* Put all unmarked symbols on free list */
5353 register struct symbol_block
*sblk
;
5354 struct symbol_block
**sprev
= &symbol_block
;
5355 register int lim
= symbol_block_index
;
5356 register int num_free
= 0, num_used
= 0;
5358 symbol_free_list
= NULL
;
5360 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
5363 struct Lisp_Symbol
*sym
= sblk
->symbols
;
5364 struct Lisp_Symbol
*end
= sym
+ lim
;
5366 for (; sym
< end
; ++sym
)
5368 /* Check if the symbol was created during loadup. In such a case
5369 it might be pointed to by pure bytecode which we don't trace,
5370 so we conservatively assume that it is live. */
5371 int pure_p
= PURE_POINTER_P (XSTRING (sym
->xname
));
5373 if (!sym
->gcmarkbit
&& !pure_p
)
5375 *(struct Lisp_Symbol
**) &sym
->value
= symbol_free_list
;
5376 symbol_free_list
= sym
;
5378 symbol_free_list
->function
= Vdead
;
5386 UNMARK_STRING (XSTRING (sym
->xname
));
5391 lim
= SYMBOL_BLOCK_SIZE
;
5392 /* If this block contains only free symbols and we have already
5393 seen more than two blocks worth of free symbols then deallocate
5395 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
5397 *sprev
= sblk
->next
;
5398 /* Unhook from the free list. */
5399 symbol_free_list
= *(struct Lisp_Symbol
**)&sblk
->symbols
[0].value
;
5405 num_free
+= this_free
;
5406 sprev
= &sblk
->next
;
5409 total_symbols
= num_used
;
5410 total_free_symbols
= num_free
;
5413 /* Put all unmarked misc's on free list.
5414 For a marker, first unchain it from the buffer it points into. */
5416 register struct marker_block
*mblk
;
5417 struct marker_block
**mprev
= &marker_block
;
5418 register int lim
= marker_block_index
;
5419 register int num_free
= 0, num_used
= 0;
5421 marker_free_list
= 0;
5423 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
5428 for (i
= 0; i
< lim
; i
++)
5430 if (!mblk
->markers
[i
].u_marker
.gcmarkbit
)
5432 if (mblk
->markers
[i
].u_marker
.type
== Lisp_Misc_Marker
)
5433 unchain_marker (&mblk
->markers
[i
].u_marker
);
5434 /* Set the type of the freed object to Lisp_Misc_Free.
5435 We could leave the type alone, since nobody checks it,
5436 but this might catch bugs faster. */
5437 mblk
->markers
[i
].u_marker
.type
= Lisp_Misc_Free
;
5438 mblk
->markers
[i
].u_free
.chain
= marker_free_list
;
5439 marker_free_list
= &mblk
->markers
[i
];
5445 mblk
->markers
[i
].u_marker
.gcmarkbit
= 0;
5448 lim
= MARKER_BLOCK_SIZE
;
5449 /* If this block contains only free markers and we have already
5450 seen more than two blocks worth of free markers then deallocate
5452 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
5454 *mprev
= mblk
->next
;
5455 /* Unhook from the free list. */
5456 marker_free_list
= mblk
->markers
[0].u_free
.chain
;
5462 num_free
+= this_free
;
5463 mprev
= &mblk
->next
;
5467 total_markers
= num_used
;
5468 total_free_markers
= num_free
;
5471 /* Free all unmarked buffers */
5473 register struct buffer
*buffer
= all_buffers
, *prev
= 0, *next
;
5476 if (!VECTOR_MARKED_P (buffer
))
5479 prev
->next
= buffer
->next
;
5481 all_buffers
= buffer
->next
;
5482 next
= buffer
->next
;
5488 VECTOR_UNMARK (buffer
);
5489 UNMARK_BALANCE_INTERVALS (BUF_INTERVALS (buffer
));
5490 prev
= buffer
, buffer
= buffer
->next
;
5494 /* Free all unmarked vectors */
5496 register struct Lisp_Vector
*vector
= all_vectors
, *prev
= 0, *next
;
5497 total_vector_size
= 0;
5500 if (!VECTOR_MARKED_P (vector
))
5503 prev
->next
= vector
->next
;
5505 all_vectors
= vector
->next
;
5506 next
= vector
->next
;
5514 VECTOR_UNMARK (vector
);
5515 if (vector
->size
& PSEUDOVECTOR_FLAG
)
5516 total_vector_size
+= (PSEUDOVECTOR_SIZE_MASK
& vector
->size
);
5518 total_vector_size
+= vector
->size
;
5519 prev
= vector
, vector
= vector
->next
;
5523 #ifdef GC_CHECK_STRING_BYTES
5524 if (!noninteractive
)
5525 check_string_bytes (1);
5532 /* Debugging aids. */
5534 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
5535 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
5536 This may be helpful in debugging Emacs's memory usage.
5537 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
5542 XSETINT (end
, (EMACS_INT
) sbrk (0) / 1024);
5547 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
5548 doc
: /* Return a list of counters that measure how much consing there has been.
5549 Each of these counters increments for a certain kind of object.
5550 The counters wrap around from the largest positive integer to zero.
5551 Garbage collection does not decrease them.
5552 The elements of the value are as follows:
5553 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
5554 All are in units of 1 = one object consed
5555 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
5557 MISCS include overlays, markers, and some internal types.
5558 Frames, windows, buffers, and subprocesses count as vectors
5559 (but the contents of a buffer's text do not count here). */)
5562 Lisp_Object consed
[8];
5564 consed
[0] = make_number (min (MOST_POSITIVE_FIXNUM
, cons_cells_consed
));
5565 consed
[1] = make_number (min (MOST_POSITIVE_FIXNUM
, floats_consed
));
5566 consed
[2] = make_number (min (MOST_POSITIVE_FIXNUM
, vector_cells_consed
));
5567 consed
[3] = make_number (min (MOST_POSITIVE_FIXNUM
, symbols_consed
));
5568 consed
[4] = make_number (min (MOST_POSITIVE_FIXNUM
, string_chars_consed
));
5569 consed
[5] = make_number (min (MOST_POSITIVE_FIXNUM
, misc_objects_consed
));
5570 consed
[6] = make_number (min (MOST_POSITIVE_FIXNUM
, intervals_consed
));
5571 consed
[7] = make_number (min (MOST_POSITIVE_FIXNUM
, strings_consed
));
5573 return Flist (8, consed
);
5576 int suppress_checking
;
5578 die (msg
, file
, line
)
5583 fprintf (stderr
, "\r\nEmacs fatal error: %s:%d: %s\r\n",
5588 /* Initialization */
5593 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
5595 pure_size
= PURESIZE
;
5596 pure_bytes_used
= 0;
5597 pure_bytes_used_before_overflow
= 0;
5599 /* Initialize the list of free aligned blocks. */
5602 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
5604 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
5608 ignore_warnings
= 1;
5609 #ifdef DOUG_LEA_MALLOC
5610 mallopt (M_TRIM_THRESHOLD
, 128*1024); /* trim threshold */
5611 mallopt (M_MMAP_THRESHOLD
, 64*1024); /* mmap threshold */
5612 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* max. number of mmap'ed areas */
5622 malloc_hysteresis
= 32;
5624 malloc_hysteresis
= 0;
5627 spare_memory
= (char *) malloc (SPARE_MEMORY
);
5629 ignore_warnings
= 0;
5631 byte_stack_list
= 0;
5633 consing_since_gc
= 0;
5634 gc_cons_threshold
= 100000 * sizeof (Lisp_Object
);
5635 #ifdef VIRT_ADDR_VARIES
5636 malloc_sbrk_unused
= 1<<22; /* A large number */
5637 malloc_sbrk_used
= 100000; /* as reasonable as any number */
5638 #endif /* VIRT_ADDR_VARIES */
5645 byte_stack_list
= 0;
5647 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
5648 setjmp_tested_p
= longjmps_done
= 0;
5651 Vgc_elapsed
= make_float (0.0);
5658 DEFVAR_INT ("gc-cons-threshold", &gc_cons_threshold
,
5659 doc
: /* *Number of bytes of consing between garbage collections.
5660 Garbage collection can happen automatically once this many bytes have been
5661 allocated since the last garbage collection. All data types count.
5663 Garbage collection happens automatically only when `eval' is called.
5665 By binding this temporarily to a large number, you can effectively
5666 prevent garbage collection during a part of the program. */);
5668 DEFVAR_INT ("pure-bytes-used", &pure_bytes_used
,
5669 doc
: /* Number of bytes of sharable Lisp data allocated so far. */);
5671 DEFVAR_INT ("cons-cells-consed", &cons_cells_consed
,
5672 doc
: /* Number of cons cells that have been consed so far. */);
5674 DEFVAR_INT ("floats-consed", &floats_consed
,
5675 doc
: /* Number of floats that have been consed so far. */);
5677 DEFVAR_INT ("vector-cells-consed", &vector_cells_consed
,
5678 doc
: /* Number of vector cells that have been consed so far. */);
5680 DEFVAR_INT ("symbols-consed", &symbols_consed
,
5681 doc
: /* Number of symbols that have been consed so far. */);
5683 DEFVAR_INT ("string-chars-consed", &string_chars_consed
,
5684 doc
: /* Number of string characters that have been consed so far. */);
5686 DEFVAR_INT ("misc-objects-consed", &misc_objects_consed
,
5687 doc
: /* Number of miscellaneous objects that have been consed so far. */);
5689 DEFVAR_INT ("intervals-consed", &intervals_consed
,
5690 doc
: /* Number of intervals that have been consed so far. */);
5692 DEFVAR_INT ("strings-consed", &strings_consed
,
5693 doc
: /* Number of strings that have been consed so far. */);
5695 DEFVAR_LISP ("purify-flag", &Vpurify_flag
,
5696 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
5697 This means that certain objects should be allocated in shared (pure) space. */);
5699 DEFVAR_INT ("undo-limit", &undo_limit
,
5700 doc
: /* Keep no more undo information once it exceeds this size.
5701 This limit is applied when garbage collection happens.
5702 The size is counted as the number of bytes occupied,
5703 which includes both saved text and other data. */);
5706 DEFVAR_INT ("undo-strong-limit", &undo_strong_limit
,
5707 doc
: /* Don't keep more than this much size of undo information.
5708 A command which pushes past this size is itself forgotten.
5709 This limit is applied when garbage collection happens.
5710 The size is counted as the number of bytes occupied,
5711 which includes both saved text and other data. */);
5712 undo_strong_limit
= 30000;
5714 DEFVAR_BOOL ("garbage-collection-messages", &garbage_collection_messages
,
5715 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
5716 garbage_collection_messages
= 0;
5718 DEFVAR_LISP ("post-gc-hook", &Vpost_gc_hook
,
5719 doc
: /* Hook run after garbage collection has finished. */);
5720 Vpost_gc_hook
= Qnil
;
5721 Qpost_gc_hook
= intern ("post-gc-hook");
5722 staticpro (&Qpost_gc_hook
);
5724 DEFVAR_LISP ("memory-signal-data", &Vmemory_signal_data
,
5725 doc
: /* Precomputed `signal' argument for memory-full error. */);
5726 /* We build this in advance because if we wait until we need it, we might
5727 not be able to allocate the memory to hold it. */
5730 build_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"));
5732 DEFVAR_LISP ("memory-full", &Vmemory_full
,
5733 doc
: /* Non-nil means we are handling a memory-full error. */);
5734 Vmemory_full
= Qnil
;
5736 staticpro (&Qgc_cons_threshold
);
5737 Qgc_cons_threshold
= intern ("gc-cons-threshold");
5739 staticpro (&Qchar_table_extra_slots
);
5740 Qchar_table_extra_slots
= intern ("char-table-extra-slots");
5742 DEFVAR_LISP ("gc-elapsed", &Vgc_elapsed
,
5743 doc
: /* Accumulated time elapsed in garbage collections.
5744 The time is in seconds as a floating point value. */);
5745 DEFVAR_INT ("gcs-done", &gcs_done
,
5746 doc
: /* Accumulated number of garbage collections done. */);
5751 defsubr (&Smake_byte_code
);
5752 defsubr (&Smake_list
);
5753 defsubr (&Smake_vector
);
5754 defsubr (&Smake_char_table
);
5755 defsubr (&Smake_string
);
5756 defsubr (&Smake_bool_vector
);
5757 defsubr (&Smake_symbol
);
5758 defsubr (&Smake_marker
);
5759 defsubr (&Spurecopy
);
5760 defsubr (&Sgarbage_collect
);
5761 defsubr (&Smemory_limit
);
5762 defsubr (&Smemory_use_counts
);
5764 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5765 defsubr (&Sgc_status
);
5769 /* arch-tag: 6695ca10-e3c5-4c2c-8bc3-ed26a7dda857
5770 (do not change this comment) */