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
;
158 EMACS_INT undo_outer_limit
;
160 /* Number of live and free conses etc. */
162 static int total_conses
, total_markers
, total_symbols
, total_vector_size
;
163 static int total_free_conses
, total_free_markers
, total_free_symbols
;
164 static int total_free_floats
, total_floats
;
166 /* Points to memory space allocated as "spare", to be freed if we run
169 static char *spare_memory
;
171 /* Amount of spare memory to keep in reserve. */
173 #define SPARE_MEMORY (1 << 14)
175 /* Number of extra blocks malloc should get when it needs more core. */
177 static int malloc_hysteresis
;
179 /* Non-nil means defun should do purecopy on the function definition. */
181 Lisp_Object Vpurify_flag
;
183 /* Non-nil means we are handling a memory-full error. */
185 Lisp_Object Vmemory_full
;
189 /* Force it into data space! Initialize it to a nonzero value;
190 otherwise some compilers put it into BSS. */
192 EMACS_INT pure
[PURESIZE
/ sizeof (EMACS_INT
)] = {1,};
193 #define PUREBEG (char *) pure
197 #define pure PURE_SEG_BITS /* Use shared memory segment */
198 #define PUREBEG (char *)PURE_SEG_BITS
200 #endif /* HAVE_SHM */
202 /* Pointer to the pure area, and its size. */
204 static char *purebeg
;
205 static size_t pure_size
;
207 /* Number of bytes of pure storage used before pure storage overflowed.
208 If this is non-zero, this implies that an overflow occurred. */
210 static size_t pure_bytes_used_before_overflow
;
212 /* Value is non-zero if P points into pure space. */
214 #define PURE_POINTER_P(P) \
215 (((PNTR_COMPARISON_TYPE) (P) \
216 < (PNTR_COMPARISON_TYPE) ((char *) purebeg + pure_size)) \
217 && ((PNTR_COMPARISON_TYPE) (P) \
218 >= (PNTR_COMPARISON_TYPE) purebeg))
220 /* Index in pure at which next pure object will be allocated.. */
222 EMACS_INT pure_bytes_used
;
224 /* If nonzero, this is a warning delivered by malloc and not yet
227 char *pending_malloc_warning
;
229 /* Pre-computed signal argument for use when memory is exhausted. */
231 Lisp_Object Vmemory_signal_data
;
233 /* Maximum amount of C stack to save when a GC happens. */
235 #ifndef MAX_SAVE_STACK
236 #define MAX_SAVE_STACK 16000
239 /* Buffer in which we save a copy of the C stack at each GC. */
244 /* Non-zero means ignore malloc warnings. Set during initialization.
245 Currently not used. */
249 Lisp_Object Qgc_cons_threshold
, Qchar_table_extra_slots
;
251 /* Hook run after GC has finished. */
253 Lisp_Object Vpost_gc_hook
, Qpost_gc_hook
;
255 Lisp_Object Vgc_elapsed
; /* accumulated elapsed time in GC */
256 EMACS_INT gcs_done
; /* accumulated GCs */
258 static void mark_buffer
P_ ((Lisp_Object
));
259 extern void mark_kboards
P_ ((void));
260 extern void mark_ttys
P_ ((void));
261 extern void mark_backtrace
P_ ((void));
262 static void gc_sweep
P_ ((void));
263 static void mark_glyph_matrix
P_ ((struct glyph_matrix
*));
264 static void mark_face_cache
P_ ((struct face_cache
*));
266 #ifdef HAVE_WINDOW_SYSTEM
267 static void mark_image
P_ ((struct image
*));
268 static void mark_image_cache
P_ ((struct frame
*));
269 #endif /* HAVE_WINDOW_SYSTEM */
271 static struct Lisp_String
*allocate_string
P_ ((void));
272 static void compact_small_strings
P_ ((void));
273 static void free_large_strings
P_ ((void));
274 static void sweep_strings
P_ ((void));
276 extern int message_enable_multibyte
;
278 /* When scanning the C stack for live Lisp objects, Emacs keeps track
279 of what memory allocated via lisp_malloc is intended for what
280 purpose. This enumeration specifies the type of memory. */
291 /* Keep the following vector-like types together, with
292 MEM_TYPE_WINDOW being the last, and MEM_TYPE_VECTOR the
293 first. Or change the code of live_vector_p, for instance. */
301 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
303 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
304 #include <stdio.h> /* For fprintf. */
307 /* A unique object in pure space used to make some Lisp objects
308 on free lists recognizable in O(1). */
312 #ifdef GC_MALLOC_CHECK
314 enum mem_type allocated_mem_type
;
315 int dont_register_blocks
;
317 #endif /* GC_MALLOC_CHECK */
319 /* A node in the red-black tree describing allocated memory containing
320 Lisp data. Each such block is recorded with its start and end
321 address when it is allocated, and removed from the tree when it
324 A red-black tree is a balanced binary tree with the following
327 1. Every node is either red or black.
328 2. Every leaf is black.
329 3. If a node is red, then both of its children are black.
330 4. Every simple path from a node to a descendant leaf contains
331 the same number of black nodes.
332 5. The root is always black.
334 When nodes are inserted into the tree, or deleted from the tree,
335 the tree is "fixed" so that these properties are always true.
337 A red-black tree with N internal nodes has height at most 2
338 log(N+1). Searches, insertions and deletions are done in O(log N).
339 Please see a text book about data structures for a detailed
340 description of red-black trees. Any book worth its salt should
345 /* Children of this node. These pointers are never NULL. When there
346 is no child, the value is MEM_NIL, which points to a dummy node. */
347 struct mem_node
*left
, *right
;
349 /* The parent of this node. In the root node, this is NULL. */
350 struct mem_node
*parent
;
352 /* Start and end of allocated region. */
356 enum {MEM_BLACK
, MEM_RED
} color
;
362 /* Base address of stack. Set in main. */
364 Lisp_Object
*stack_base
;
366 /* Root of the tree describing allocated Lisp memory. */
368 static struct mem_node
*mem_root
;
370 /* Lowest and highest known address in the heap. */
372 static void *min_heap_address
, *max_heap_address
;
374 /* Sentinel node of the tree. */
376 static struct mem_node mem_z
;
377 #define MEM_NIL &mem_z
379 static POINTER_TYPE
*lisp_malloc
P_ ((size_t, enum mem_type
));
380 static struct Lisp_Vector
*allocate_vectorlike
P_ ((EMACS_INT
, enum mem_type
));
381 static void lisp_free
P_ ((POINTER_TYPE
*));
382 static void mark_stack
P_ ((void));
383 static int live_vector_p
P_ ((struct mem_node
*, void *));
384 static int live_buffer_p
P_ ((struct mem_node
*, void *));
385 static int live_string_p
P_ ((struct mem_node
*, void *));
386 static int live_cons_p
P_ ((struct mem_node
*, void *));
387 static int live_symbol_p
P_ ((struct mem_node
*, void *));
388 static int live_float_p
P_ ((struct mem_node
*, void *));
389 static int live_misc_p
P_ ((struct mem_node
*, void *));
390 static void mark_maybe_object
P_ ((Lisp_Object
));
391 static void mark_memory
P_ ((void *, void *));
392 static void mem_init
P_ ((void));
393 static struct mem_node
*mem_insert
P_ ((void *, void *, enum mem_type
));
394 static void mem_insert_fixup
P_ ((struct mem_node
*));
395 static void mem_rotate_left
P_ ((struct mem_node
*));
396 static void mem_rotate_right
P_ ((struct mem_node
*));
397 static void mem_delete
P_ ((struct mem_node
*));
398 static void mem_delete_fixup
P_ ((struct mem_node
*));
399 static INLINE
struct mem_node
*mem_find
P_ ((void *));
401 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
402 static void check_gcpros
P_ ((void));
405 #endif /* GC_MARK_STACK || GC_MALLOC_CHECK */
407 /* Recording what needs to be marked for gc. */
409 struct gcpro
*gcprolist
;
411 /* Addresses of staticpro'd variables. Initialize it to a nonzero
412 value; otherwise some compilers put it into BSS. */
414 #define NSTATICS 1280
415 Lisp_Object
*staticvec
[NSTATICS
] = {&Vpurify_flag
};
417 /* Index of next unused slot in staticvec. */
421 static POINTER_TYPE
*pure_alloc
P_ ((size_t, int));
424 /* Value is SZ rounded up to the next multiple of ALIGNMENT.
425 ALIGNMENT must be a power of 2. */
427 #define ALIGN(ptr, ALIGNMENT) \
428 ((POINTER_TYPE *) ((((EMACS_UINT)(ptr)) + (ALIGNMENT) - 1) \
429 & ~((ALIGNMENT) - 1)))
433 /************************************************************************
435 ************************************************************************/
437 /* Function malloc calls this if it finds we are near exhausting storage. */
443 pending_malloc_warning
= str
;
447 /* Display an already-pending malloc warning. */
450 display_malloc_warning ()
452 call3 (intern ("display-warning"),
454 build_string (pending_malloc_warning
),
455 intern ("emergency"));
456 pending_malloc_warning
= 0;
460 #ifdef DOUG_LEA_MALLOC
461 # define BYTES_USED (mallinfo ().arena)
463 # define BYTES_USED _bytes_used
467 /* Called if malloc returns zero. */
474 #ifndef SYSTEM_MALLOC
475 bytes_used_when_full
= BYTES_USED
;
478 /* The first time we get here, free the spare memory. */
485 /* This used to call error, but if we've run out of memory, we could
486 get infinite recursion trying to build the string. */
488 Fsignal (Qnil
, Vmemory_signal_data
);
492 /* Called if we can't allocate relocatable space for a buffer. */
495 buffer_memory_full ()
497 /* If buffers use the relocating allocator, no need to free
498 spare_memory, because we may have plenty of malloc space left
499 that we could get, and if we don't, the malloc that fails will
500 itself cause spare_memory to be freed. If buffers don't use the
501 relocating allocator, treat this like any other failing
510 /* This used to call error, but if we've run out of memory, we could
511 get infinite recursion trying to build the string. */
513 Fsignal (Qnil
, Vmemory_signal_data
);
517 /* Like malloc but check for no memory and block interrupt input.. */
523 register POINTER_TYPE
*val
;
526 val
= (POINTER_TYPE
*) malloc (size
);
535 /* Like realloc but check for no memory and block interrupt input.. */
538 xrealloc (block
, size
)
542 register POINTER_TYPE
*val
;
545 /* We must call malloc explicitly when BLOCK is 0, since some
546 reallocs don't do this. */
548 val
= (POINTER_TYPE
*) malloc (size
);
550 val
= (POINTER_TYPE
*) realloc (block
, size
);
553 if (!val
&& size
) memory_full ();
558 /* Like free but block interrupt input. */
570 /* Like strdup, but uses xmalloc. */
576 size_t len
= strlen (s
) + 1;
577 char *p
= (char *) xmalloc (len
);
583 /* Unwind for SAFE_ALLOCA */
586 safe_alloca_unwind (arg
)
589 register struct Lisp_Save_Value
*p
= XSAVE_VALUE (arg
);
599 /* Like malloc but used for allocating Lisp data. NBYTES is the
600 number of bytes to allocate, TYPE describes the intended use of the
601 allcated memory block (for strings, for conses, ...). */
603 static void *lisp_malloc_loser
;
605 static POINTER_TYPE
*
606 lisp_malloc (nbytes
, type
)
614 #ifdef GC_MALLOC_CHECK
615 allocated_mem_type
= type
;
618 val
= (void *) malloc (nbytes
);
621 /* If the memory just allocated cannot be addressed thru a Lisp
622 object's pointer, and it needs to be,
623 that's equivalent to running out of memory. */
624 if (val
&& type
!= MEM_TYPE_NON_LISP
)
627 XSETCONS (tem
, (char *) val
+ nbytes
- 1);
628 if ((char *) XCONS (tem
) != (char *) val
+ nbytes
- 1)
630 lisp_malloc_loser
= val
;
637 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
638 if (val
&& type
!= MEM_TYPE_NON_LISP
)
639 mem_insert (val
, (char *) val
+ nbytes
, type
);
648 /* Free BLOCK. This must be called to free memory allocated with a
649 call to lisp_malloc. */
657 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
658 mem_delete (mem_find (block
));
663 /* Allocation of aligned blocks of memory to store Lisp data. */
664 /* The entry point is lisp_align_malloc which returns blocks of at most */
665 /* BLOCK_BYTES and guarantees they are aligned on a BLOCK_ALIGN boundary. */
668 /* BLOCK_ALIGN has to be a power of 2. */
669 #define BLOCK_ALIGN (1 << 10)
671 /* Padding to leave at the end of a malloc'd block. This is to give
672 malloc a chance to minimize the amount of memory wasted to alignment.
673 It should be tuned to the particular malloc library used.
674 On glibc-2.3.2, malloc never tries to align, so a padding of 0 is best.
675 posix_memalign on the other hand would ideally prefer a value of 4
676 because otherwise, there's 1020 bytes wasted between each ablocks.
677 But testing shows that those 1020 will most of the time be efficiently
678 used by malloc to place other objects, so a value of 0 is still preferable
679 unless you have a lot of cons&floats and virtually nothing else. */
680 #define BLOCK_PADDING 0
681 #define BLOCK_BYTES \
682 (BLOCK_ALIGN - sizeof (struct aligned_block *) - BLOCK_PADDING)
684 /* Internal data structures and constants. */
686 #define ABLOCKS_SIZE 16
688 /* An aligned block of memory. */
693 char payload
[BLOCK_BYTES
];
694 struct ablock
*next_free
;
696 /* `abase' is the aligned base of the ablocks. */
697 /* It is overloaded to hold the virtual `busy' field that counts
698 the number of used ablock in the parent ablocks.
699 The first ablock has the `busy' field, the others have the `abase'
700 field. To tell the difference, we assume that pointers will have
701 integer values larger than 2 * ABLOCKS_SIZE. The lowest bit of `busy'
702 is used to tell whether the real base of the parent ablocks is `abase'
703 (if not, the word before the first ablock holds a pointer to the
705 struct ablocks
*abase
;
706 /* The padding of all but the last ablock is unused. The padding of
707 the last ablock in an ablocks is not allocated. */
709 char padding
[BLOCK_PADDING
];
713 /* A bunch of consecutive aligned blocks. */
716 struct ablock blocks
[ABLOCKS_SIZE
];
719 /* Size of the block requested from malloc or memalign. */
720 #define ABLOCKS_BYTES (sizeof (struct ablocks) - BLOCK_PADDING)
722 #define ABLOCK_ABASE(block) \
723 (((unsigned long) (block)->abase) <= (1 + 2 * ABLOCKS_SIZE) \
724 ? (struct ablocks *)(block) \
727 /* Virtual `busy' field. */
728 #define ABLOCKS_BUSY(abase) ((abase)->blocks[0].abase)
730 /* Pointer to the (not necessarily aligned) malloc block. */
731 #ifdef HAVE_POSIX_MEMALIGN
732 #define ABLOCKS_BASE(abase) (abase)
734 #define ABLOCKS_BASE(abase) \
735 (1 & (long) ABLOCKS_BUSY (abase) ? abase : ((void**)abase)[-1])
738 /* The list of free ablock. */
739 static struct ablock
*free_ablock
;
741 /* Allocate an aligned block of nbytes.
742 Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be
743 smaller or equal to BLOCK_BYTES. */
744 static POINTER_TYPE
*
745 lisp_align_malloc (nbytes
, type
)
750 struct ablocks
*abase
;
752 eassert (nbytes
<= BLOCK_BYTES
);
756 #ifdef GC_MALLOC_CHECK
757 allocated_mem_type
= type
;
763 EMACS_INT aligned
; /* int gets warning casting to 64-bit pointer. */
765 #ifdef DOUG_LEA_MALLOC
766 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
767 because mapped region contents are not preserved in
769 mallopt (M_MMAP_MAX
, 0);
772 #ifdef HAVE_POSIX_MEMALIGN
774 int err
= posix_memalign (&base
, BLOCK_ALIGN
, ABLOCKS_BYTES
);
780 base
= malloc (ABLOCKS_BYTES
);
781 abase
= ALIGN (base
, BLOCK_ALIGN
);
790 aligned
= (base
== abase
);
792 ((void**)abase
)[-1] = base
;
794 #ifdef DOUG_LEA_MALLOC
795 /* Back to a reasonable maximum of mmap'ed areas. */
796 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
800 /* If the memory just allocated cannot be addressed thru a Lisp
801 object's pointer, and it needs to be, that's equivalent to
802 running out of memory. */
803 if (type
!= MEM_TYPE_NON_LISP
)
806 char *end
= (char *) base
+ ABLOCKS_BYTES
- 1;
808 if ((char *) XCONS (tem
) != end
)
810 lisp_malloc_loser
= base
;
818 /* Initialize the blocks and put them on the free list.
819 Is `base' was not properly aligned, we can't use the last block. */
820 for (i
= 0; i
< (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1); i
++)
822 abase
->blocks
[i
].abase
= abase
;
823 abase
->blocks
[i
].x
.next_free
= free_ablock
;
824 free_ablock
= &abase
->blocks
[i
];
826 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (long) aligned
;
828 eassert (0 == ((EMACS_UINT
)abase
) % BLOCK_ALIGN
);
829 eassert (ABLOCK_ABASE (&abase
->blocks
[3]) == abase
); /* 3 is arbitrary */
830 eassert (ABLOCK_ABASE (&abase
->blocks
[0]) == abase
);
831 eassert (ABLOCKS_BASE (abase
) == base
);
832 eassert (aligned
== (long) ABLOCKS_BUSY (abase
));
835 abase
= ABLOCK_ABASE (free_ablock
);
836 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (2 + (long) ABLOCKS_BUSY (abase
));
838 free_ablock
= free_ablock
->x
.next_free
;
840 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
841 if (val
&& type
!= MEM_TYPE_NON_LISP
)
842 mem_insert (val
, (char *) val
+ nbytes
, type
);
849 eassert (0 == ((EMACS_UINT
)val
) % BLOCK_ALIGN
);
854 lisp_align_free (block
)
857 struct ablock
*ablock
= block
;
858 struct ablocks
*abase
= ABLOCK_ABASE (ablock
);
861 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
862 mem_delete (mem_find (block
));
864 /* Put on free list. */
865 ablock
->x
.next_free
= free_ablock
;
866 free_ablock
= ablock
;
867 /* Update busy count. */
868 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (-2 + (long) ABLOCKS_BUSY (abase
));
870 if (2 > (long) ABLOCKS_BUSY (abase
))
871 { /* All the blocks are free. */
872 int i
= 0, aligned
= (long) ABLOCKS_BUSY (abase
);
873 struct ablock
**tem
= &free_ablock
;
874 struct ablock
*atop
= &abase
->blocks
[aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1];
878 if (*tem
>= (struct ablock
*) abase
&& *tem
< atop
)
881 *tem
= (*tem
)->x
.next_free
;
884 tem
= &(*tem
)->x
.next_free
;
886 eassert ((aligned
& 1) == aligned
);
887 eassert (i
== (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1));
888 free (ABLOCKS_BASE (abase
));
893 /* Return a new buffer structure allocated from the heap with
894 a call to lisp_malloc. */
900 = (struct buffer
*) lisp_malloc (sizeof (struct buffer
),
906 /* Arranging to disable input signals while we're in malloc.
908 This only works with GNU malloc. To help out systems which can't
909 use GNU malloc, all the calls to malloc, realloc, and free
910 elsewhere in the code should be inside a BLOCK_INPUT/UNBLOCK_INPUT
911 pairs; unfortunately, we have no idea what C library functions
912 might call malloc, so we can't really protect them unless you're
913 using GNU malloc. Fortunately, most of the major operating systems
914 can use GNU malloc. */
916 #ifndef SYSTEM_MALLOC
917 #ifndef DOUG_LEA_MALLOC
918 extern void * (*__malloc_hook
) P_ ((size_t));
919 extern void * (*__realloc_hook
) P_ ((void *, size_t));
920 extern void (*__free_hook
) P_ ((void *));
921 /* Else declared in malloc.h, perhaps with an extra arg. */
922 #endif /* DOUG_LEA_MALLOC */
923 static void * (*old_malloc_hook
) ();
924 static void * (*old_realloc_hook
) ();
925 static void (*old_free_hook
) ();
927 /* This function is used as the hook for free to call. */
930 emacs_blocked_free (ptr
)
935 #ifdef GC_MALLOC_CHECK
941 if (m
== MEM_NIL
|| m
->start
!= ptr
)
944 "Freeing `%p' which wasn't allocated with malloc\n", ptr
);
949 /* fprintf (stderr, "free %p...%p (%p)\n", m->start, m->end, ptr); */
953 #endif /* GC_MALLOC_CHECK */
955 __free_hook
= old_free_hook
;
958 /* If we released our reserve (due to running out of memory),
959 and we have a fair amount free once again,
960 try to set aside another reserve in case we run out once more. */
961 if (spare_memory
== 0
962 /* Verify there is enough space that even with the malloc
963 hysteresis this call won't run out again.
964 The code here is correct as long as SPARE_MEMORY
965 is substantially larger than the block size malloc uses. */
966 && (bytes_used_when_full
967 > BYTES_USED
+ max (malloc_hysteresis
, 4) * SPARE_MEMORY
))
968 spare_memory
= (char *) malloc ((size_t) SPARE_MEMORY
);
970 __free_hook
= emacs_blocked_free
;
975 /* If we released our reserve (due to running out of memory),
976 and we have a fair amount free once again,
977 try to set aside another reserve in case we run out once more.
979 This is called when a relocatable block is freed in ralloc.c. */
982 refill_memory_reserve ()
984 if (spare_memory
== 0)
985 spare_memory
= (char *) malloc ((size_t) SPARE_MEMORY
);
989 /* This function is the malloc hook that Emacs uses. */
992 emacs_blocked_malloc (size
)
998 __malloc_hook
= old_malloc_hook
;
999 #ifdef DOUG_LEA_MALLOC
1000 mallopt (M_TOP_PAD
, malloc_hysteresis
* 4096);
1002 __malloc_extra_blocks
= malloc_hysteresis
;
1005 value
= (void *) malloc (size
);
1007 #ifdef GC_MALLOC_CHECK
1009 struct mem_node
*m
= mem_find (value
);
1012 fprintf (stderr
, "Malloc returned %p which is already in use\n",
1014 fprintf (stderr
, "Region in use is %p...%p, %u bytes, type %d\n",
1015 m
->start
, m
->end
, (char *) m
->end
- (char *) m
->start
,
1020 if (!dont_register_blocks
)
1022 mem_insert (value
, (char *) value
+ max (1, size
), allocated_mem_type
);
1023 allocated_mem_type
= MEM_TYPE_NON_LISP
;
1026 #endif /* GC_MALLOC_CHECK */
1028 __malloc_hook
= emacs_blocked_malloc
;
1031 /* fprintf (stderr, "%p malloc\n", value); */
1036 /* This function is the realloc hook that Emacs uses. */
1039 emacs_blocked_realloc (ptr
, size
)
1046 __realloc_hook
= old_realloc_hook
;
1048 #ifdef GC_MALLOC_CHECK
1051 struct mem_node
*m
= mem_find (ptr
);
1052 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1055 "Realloc of %p which wasn't allocated with malloc\n",
1063 /* fprintf (stderr, "%p -> realloc\n", ptr); */
1065 /* Prevent malloc from registering blocks. */
1066 dont_register_blocks
= 1;
1067 #endif /* GC_MALLOC_CHECK */
1069 value
= (void *) realloc (ptr
, size
);
1071 #ifdef GC_MALLOC_CHECK
1072 dont_register_blocks
= 0;
1075 struct mem_node
*m
= mem_find (value
);
1078 fprintf (stderr
, "Realloc returns memory that is already in use\n");
1082 /* Can't handle zero size regions in the red-black tree. */
1083 mem_insert (value
, (char *) value
+ max (size
, 1), MEM_TYPE_NON_LISP
);
1086 /* fprintf (stderr, "%p <- realloc\n", value); */
1087 #endif /* GC_MALLOC_CHECK */
1089 __realloc_hook
= emacs_blocked_realloc
;
1096 /* Called from main to set up malloc to use our hooks. */
1099 uninterrupt_malloc ()
1101 if (__free_hook
!= emacs_blocked_free
)
1102 old_free_hook
= __free_hook
;
1103 __free_hook
= emacs_blocked_free
;
1105 if (__malloc_hook
!= emacs_blocked_malloc
)
1106 old_malloc_hook
= __malloc_hook
;
1107 __malloc_hook
= emacs_blocked_malloc
;
1109 if (__realloc_hook
!= emacs_blocked_realloc
)
1110 old_realloc_hook
= __realloc_hook
;
1111 __realloc_hook
= emacs_blocked_realloc
;
1114 #endif /* not SYSTEM_MALLOC */
1118 /***********************************************************************
1120 ***********************************************************************/
1122 /* Number of intervals allocated in an interval_block structure.
1123 The 1020 is 1024 minus malloc overhead. */
1125 #define INTERVAL_BLOCK_SIZE \
1126 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
1128 /* Intervals are allocated in chunks in form of an interval_block
1131 struct interval_block
1133 /* Place `intervals' first, to preserve alignment. */
1134 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
1135 struct interval_block
*next
;
1138 /* Current interval block. Its `next' pointer points to older
1141 struct interval_block
*interval_block
;
1143 /* Index in interval_block above of the next unused interval
1146 static int interval_block_index
;
1148 /* Number of free and live intervals. */
1150 static int total_free_intervals
, total_intervals
;
1152 /* List of free intervals. */
1154 INTERVAL interval_free_list
;
1156 /* Total number of interval blocks now in use. */
1158 int n_interval_blocks
;
1161 /* Initialize interval allocation. */
1166 interval_block
= NULL
;
1167 interval_block_index
= INTERVAL_BLOCK_SIZE
;
1168 interval_free_list
= 0;
1169 n_interval_blocks
= 0;
1173 /* Return a new interval. */
1180 if (interval_free_list
)
1182 val
= interval_free_list
;
1183 interval_free_list
= INTERVAL_PARENT (interval_free_list
);
1187 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
1189 register struct interval_block
*newi
;
1191 newi
= (struct interval_block
*) lisp_malloc (sizeof *newi
,
1194 newi
->next
= interval_block
;
1195 interval_block
= newi
;
1196 interval_block_index
= 0;
1197 n_interval_blocks
++;
1199 val
= &interval_block
->intervals
[interval_block_index
++];
1201 consing_since_gc
+= sizeof (struct interval
);
1203 RESET_INTERVAL (val
);
1209 /* Mark Lisp objects in interval I. */
1212 mark_interval (i
, dummy
)
1213 register INTERVAL i
;
1216 eassert (!i
->gcmarkbit
); /* Intervals are never shared. */
1218 mark_object (i
->plist
);
1222 /* Mark the interval tree rooted in TREE. Don't call this directly;
1223 use the macro MARK_INTERVAL_TREE instead. */
1226 mark_interval_tree (tree
)
1227 register INTERVAL tree
;
1229 /* No need to test if this tree has been marked already; this
1230 function is always called through the MARK_INTERVAL_TREE macro,
1231 which takes care of that. */
1233 traverse_intervals_noorder (tree
, mark_interval
, Qnil
);
1237 /* Mark the interval tree rooted in I. */
1239 #define MARK_INTERVAL_TREE(i) \
1241 if (!NULL_INTERVAL_P (i) && !i->gcmarkbit) \
1242 mark_interval_tree (i); \
1246 #define UNMARK_BALANCE_INTERVALS(i) \
1248 if (! NULL_INTERVAL_P (i)) \
1249 (i) = balance_intervals (i); \
1253 /* Number support. If NO_UNION_TYPE isn't in effect, we
1254 can't create number objects in macros. */
1262 obj
.s
.type
= Lisp_Int
;
1267 /***********************************************************************
1269 ***********************************************************************/
1271 /* Lisp_Strings are allocated in string_block structures. When a new
1272 string_block is allocated, all the Lisp_Strings it contains are
1273 added to a free-list string_free_list. When a new Lisp_String is
1274 needed, it is taken from that list. During the sweep phase of GC,
1275 string_blocks that are entirely free are freed, except two which
1278 String data is allocated from sblock structures. Strings larger
1279 than LARGE_STRING_BYTES, get their own sblock, data for smaller
1280 strings is sub-allocated out of sblocks of size SBLOCK_SIZE.
1282 Sblocks consist internally of sdata structures, one for each
1283 Lisp_String. The sdata structure points to the Lisp_String it
1284 belongs to. The Lisp_String points back to the `u.data' member of
1285 its sdata structure.
1287 When a Lisp_String is freed during GC, it is put back on
1288 string_free_list, and its `data' member and its sdata's `string'
1289 pointer is set to null. The size of the string is recorded in the
1290 `u.nbytes' member of the sdata. So, sdata structures that are no
1291 longer used, can be easily recognized, and it's easy to compact the
1292 sblocks of small strings which we do in compact_small_strings. */
1294 /* Size in bytes of an sblock structure used for small strings. This
1295 is 8192 minus malloc overhead. */
1297 #define SBLOCK_SIZE 8188
1299 /* Strings larger than this are considered large strings. String data
1300 for large strings is allocated from individual sblocks. */
1302 #define LARGE_STRING_BYTES 1024
1304 /* Structure describing string memory sub-allocated from an sblock.
1305 This is where the contents of Lisp strings are stored. */
1309 /* Back-pointer to the string this sdata belongs to. If null, this
1310 structure is free, and the NBYTES member of the union below
1311 contains the string's byte size (the same value that STRING_BYTES
1312 would return if STRING were non-null). If non-null, STRING_BYTES
1313 (STRING) is the size of the data, and DATA contains the string's
1315 struct Lisp_String
*string
;
1317 #ifdef GC_CHECK_STRING_BYTES
1320 unsigned char data
[1];
1322 #define SDATA_NBYTES(S) (S)->nbytes
1323 #define SDATA_DATA(S) (S)->data
1325 #else /* not GC_CHECK_STRING_BYTES */
1329 /* When STRING in non-null. */
1330 unsigned char data
[1];
1332 /* When STRING is null. */
1337 #define SDATA_NBYTES(S) (S)->u.nbytes
1338 #define SDATA_DATA(S) (S)->u.data
1340 #endif /* not GC_CHECK_STRING_BYTES */
1344 /* Structure describing a block of memory which is sub-allocated to
1345 obtain string data memory for strings. Blocks for small strings
1346 are of fixed size SBLOCK_SIZE. Blocks for large strings are made
1347 as large as needed. */
1352 struct sblock
*next
;
1354 /* Pointer to the next free sdata block. This points past the end
1355 of the sblock if there isn't any space left in this block. */
1356 struct sdata
*next_free
;
1358 /* Start of data. */
1359 struct sdata first_data
;
1362 /* Number of Lisp strings in a string_block structure. The 1020 is
1363 1024 minus malloc overhead. */
1365 #define STRING_BLOCK_SIZE \
1366 ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String))
1368 /* Structure describing a block from which Lisp_String structures
1373 /* Place `strings' first, to preserve alignment. */
1374 struct Lisp_String strings
[STRING_BLOCK_SIZE
];
1375 struct string_block
*next
;
1378 /* Head and tail of the list of sblock structures holding Lisp string
1379 data. We always allocate from current_sblock. The NEXT pointers
1380 in the sblock structures go from oldest_sblock to current_sblock. */
1382 static struct sblock
*oldest_sblock
, *current_sblock
;
1384 /* List of sblocks for large strings. */
1386 static struct sblock
*large_sblocks
;
1388 /* List of string_block structures, and how many there are. */
1390 static struct string_block
*string_blocks
;
1391 static int n_string_blocks
;
1393 /* Free-list of Lisp_Strings. */
1395 static struct Lisp_String
*string_free_list
;
1397 /* Number of live and free Lisp_Strings. */
1399 static int total_strings
, total_free_strings
;
1401 /* Number of bytes used by live strings. */
1403 static int total_string_size
;
1405 /* Given a pointer to a Lisp_String S which is on the free-list
1406 string_free_list, return a pointer to its successor in the
1409 #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S))
1411 /* Return a pointer to the sdata structure belonging to Lisp string S.
1412 S must be live, i.e. S->data must not be null. S->data is actually
1413 a pointer to the `u.data' member of its sdata structure; the
1414 structure starts at a constant offset in front of that. */
1416 #ifdef GC_CHECK_STRING_BYTES
1418 #define SDATA_OF_STRING(S) \
1419 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *) \
1420 - sizeof (EMACS_INT)))
1422 #else /* not GC_CHECK_STRING_BYTES */
1424 #define SDATA_OF_STRING(S) \
1425 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *)))
1427 #endif /* not GC_CHECK_STRING_BYTES */
1429 /* Value is the size of an sdata structure large enough to hold NBYTES
1430 bytes of string data. The value returned includes a terminating
1431 NUL byte, the size of the sdata structure, and padding. */
1433 #ifdef GC_CHECK_STRING_BYTES
1435 #define SDATA_SIZE(NBYTES) \
1436 ((sizeof (struct Lisp_String *) \
1438 + sizeof (EMACS_INT) \
1439 + sizeof (EMACS_INT) - 1) \
1440 & ~(sizeof (EMACS_INT) - 1))
1442 #else /* not GC_CHECK_STRING_BYTES */
1444 #define SDATA_SIZE(NBYTES) \
1445 ((sizeof (struct Lisp_String *) \
1447 + sizeof (EMACS_INT) - 1) \
1448 & ~(sizeof (EMACS_INT) - 1))
1450 #endif /* not GC_CHECK_STRING_BYTES */
1452 /* Initialize string allocation. Called from init_alloc_once. */
1457 total_strings
= total_free_strings
= total_string_size
= 0;
1458 oldest_sblock
= current_sblock
= large_sblocks
= NULL
;
1459 string_blocks
= NULL
;
1460 n_string_blocks
= 0;
1461 string_free_list
= NULL
;
1465 #ifdef GC_CHECK_STRING_BYTES
1467 static int check_string_bytes_count
;
1469 void check_string_bytes
P_ ((int));
1470 void check_sblock
P_ ((struct sblock
*));
1472 #define CHECK_STRING_BYTES(S) STRING_BYTES (S)
1475 /* Like GC_STRING_BYTES, but with debugging check. */
1479 struct Lisp_String
*s
;
1481 int nbytes
= (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1482 if (!PURE_POINTER_P (s
)
1484 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1489 /* Check validity of Lisp strings' string_bytes member in B. */
1495 struct sdata
*from
, *end
, *from_end
;
1499 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1501 /* Compute the next FROM here because copying below may
1502 overwrite data we need to compute it. */
1505 /* Check that the string size recorded in the string is the
1506 same as the one recorded in the sdata structure. */
1508 CHECK_STRING_BYTES (from
->string
);
1511 nbytes
= GC_STRING_BYTES (from
->string
);
1513 nbytes
= SDATA_NBYTES (from
);
1515 nbytes
= SDATA_SIZE (nbytes
);
1516 from_end
= (struct sdata
*) ((char *) from
+ nbytes
);
1521 /* Check validity of Lisp strings' string_bytes member. ALL_P
1522 non-zero means check all strings, otherwise check only most
1523 recently allocated strings. Used for hunting a bug. */
1526 check_string_bytes (all_p
)
1533 for (b
= large_sblocks
; b
; b
= b
->next
)
1535 struct Lisp_String
*s
= b
->first_data
.string
;
1537 CHECK_STRING_BYTES (s
);
1540 for (b
= oldest_sblock
; b
; b
= b
->next
)
1544 check_sblock (current_sblock
);
1547 #endif /* GC_CHECK_STRING_BYTES */
1550 /* Return a new Lisp_String. */
1552 static struct Lisp_String
*
1555 struct Lisp_String
*s
;
1557 /* If the free-list is empty, allocate a new string_block, and
1558 add all the Lisp_Strings in it to the free-list. */
1559 if (string_free_list
== NULL
)
1561 struct string_block
*b
;
1564 b
= (struct string_block
*) lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1565 bzero (b
, sizeof *b
);
1566 b
->next
= string_blocks
;
1570 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1573 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1574 string_free_list
= s
;
1577 total_free_strings
+= STRING_BLOCK_SIZE
;
1580 /* Pop a Lisp_String off the free-list. */
1581 s
= string_free_list
;
1582 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1584 /* Probably not strictly necessary, but play it safe. */
1585 bzero (s
, sizeof *s
);
1587 --total_free_strings
;
1590 consing_since_gc
+= sizeof *s
;
1592 #ifdef GC_CHECK_STRING_BYTES
1599 if (++check_string_bytes_count
== 200)
1601 check_string_bytes_count
= 0;
1602 check_string_bytes (1);
1605 check_string_bytes (0);
1607 #endif /* GC_CHECK_STRING_BYTES */
1613 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1614 plus a NUL byte at the end. Allocate an sdata structure for S, and
1615 set S->data to its `u.data' member. Store a NUL byte at the end of
1616 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1617 S->data if it was initially non-null. */
1620 allocate_string_data (s
, nchars
, nbytes
)
1621 struct Lisp_String
*s
;
1624 struct sdata
*data
, *old_data
;
1626 int needed
, old_nbytes
;
1628 /* Determine the number of bytes needed to store NBYTES bytes
1630 needed
= SDATA_SIZE (nbytes
);
1632 if (nbytes
> LARGE_STRING_BYTES
)
1634 size_t size
= sizeof *b
- sizeof (struct sdata
) + needed
;
1636 #ifdef DOUG_LEA_MALLOC
1637 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1638 because mapped region contents are not preserved in
1641 In case you think of allowing it in a dumped Emacs at the
1642 cost of not being able to re-dump, there's another reason:
1643 mmap'ed data typically have an address towards the top of the
1644 address space, which won't fit into an EMACS_INT (at least on
1645 32-bit systems with the current tagging scheme). --fx */
1646 mallopt (M_MMAP_MAX
, 0);
1649 b
= (struct sblock
*) lisp_malloc (size
, MEM_TYPE_NON_LISP
);
1651 #ifdef DOUG_LEA_MALLOC
1652 /* Back to a reasonable maximum of mmap'ed areas. */
1653 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1656 b
->next_free
= &b
->first_data
;
1657 b
->first_data
.string
= NULL
;
1658 b
->next
= large_sblocks
;
1661 else if (current_sblock
== NULL
1662 || (((char *) current_sblock
+ SBLOCK_SIZE
1663 - (char *) current_sblock
->next_free
)
1666 /* Not enough room in the current sblock. */
1667 b
= (struct sblock
*) lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
1668 b
->next_free
= &b
->first_data
;
1669 b
->first_data
.string
= NULL
;
1673 current_sblock
->next
= b
;
1681 old_data
= s
->data
? SDATA_OF_STRING (s
) : NULL
;
1682 old_nbytes
= GC_STRING_BYTES (s
);
1684 data
= b
->next_free
;
1686 s
->data
= SDATA_DATA (data
);
1687 #ifdef GC_CHECK_STRING_BYTES
1688 SDATA_NBYTES (data
) = nbytes
;
1691 s
->size_byte
= nbytes
;
1692 s
->data
[nbytes
] = '\0';
1693 b
->next_free
= (struct sdata
*) ((char *) data
+ needed
);
1695 /* If S had already data assigned, mark that as free by setting its
1696 string back-pointer to null, and recording the size of the data
1700 SDATA_NBYTES (old_data
) = old_nbytes
;
1701 old_data
->string
= NULL
;
1704 consing_since_gc
+= needed
;
1708 /* Sweep and compact strings. */
1713 struct string_block
*b
, *next
;
1714 struct string_block
*live_blocks
= NULL
;
1716 string_free_list
= NULL
;
1717 total_strings
= total_free_strings
= 0;
1718 total_string_size
= 0;
1720 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
1721 for (b
= string_blocks
; b
; b
= next
)
1724 struct Lisp_String
*free_list_before
= string_free_list
;
1728 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
1730 struct Lisp_String
*s
= b
->strings
+ i
;
1734 /* String was not on free-list before. */
1735 if (STRING_MARKED_P (s
))
1737 /* String is live; unmark it and its intervals. */
1740 if (!NULL_INTERVAL_P (s
->intervals
))
1741 UNMARK_BALANCE_INTERVALS (s
->intervals
);
1744 total_string_size
+= STRING_BYTES (s
);
1748 /* String is dead. Put it on the free-list. */
1749 struct sdata
*data
= SDATA_OF_STRING (s
);
1751 /* Save the size of S in its sdata so that we know
1752 how large that is. Reset the sdata's string
1753 back-pointer so that we know it's free. */
1754 #ifdef GC_CHECK_STRING_BYTES
1755 if (GC_STRING_BYTES (s
) != SDATA_NBYTES (data
))
1758 data
->u
.nbytes
= GC_STRING_BYTES (s
);
1760 data
->string
= NULL
;
1762 /* Reset the strings's `data' member so that we
1766 /* Put the string on the free-list. */
1767 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1768 string_free_list
= s
;
1774 /* S was on the free-list before. Put it there again. */
1775 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1776 string_free_list
= s
;
1781 /* Free blocks that contain free Lisp_Strings only, except
1782 the first two of them. */
1783 if (nfree
== STRING_BLOCK_SIZE
1784 && total_free_strings
> STRING_BLOCK_SIZE
)
1788 string_free_list
= free_list_before
;
1792 total_free_strings
+= nfree
;
1793 b
->next
= live_blocks
;
1798 string_blocks
= live_blocks
;
1799 free_large_strings ();
1800 compact_small_strings ();
1804 /* Free dead large strings. */
1807 free_large_strings ()
1809 struct sblock
*b
, *next
;
1810 struct sblock
*live_blocks
= NULL
;
1812 for (b
= large_sblocks
; b
; b
= next
)
1816 if (b
->first_data
.string
== NULL
)
1820 b
->next
= live_blocks
;
1825 large_sblocks
= live_blocks
;
1829 /* Compact data of small strings. Free sblocks that don't contain
1830 data of live strings after compaction. */
1833 compact_small_strings ()
1835 struct sblock
*b
, *tb
, *next
;
1836 struct sdata
*from
, *to
, *end
, *tb_end
;
1837 struct sdata
*to_end
, *from_end
;
1839 /* TB is the sblock we copy to, TO is the sdata within TB we copy
1840 to, and TB_END is the end of TB. */
1842 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
1843 to
= &tb
->first_data
;
1845 /* Step through the blocks from the oldest to the youngest. We
1846 expect that old blocks will stabilize over time, so that less
1847 copying will happen this way. */
1848 for (b
= oldest_sblock
; b
; b
= b
->next
)
1851 xassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
1853 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1855 /* Compute the next FROM here because copying below may
1856 overwrite data we need to compute it. */
1859 #ifdef GC_CHECK_STRING_BYTES
1860 /* Check that the string size recorded in the string is the
1861 same as the one recorded in the sdata structure. */
1863 && GC_STRING_BYTES (from
->string
) != SDATA_NBYTES (from
))
1865 #endif /* GC_CHECK_STRING_BYTES */
1868 nbytes
= GC_STRING_BYTES (from
->string
);
1870 nbytes
= SDATA_NBYTES (from
);
1872 nbytes
= SDATA_SIZE (nbytes
);
1873 from_end
= (struct sdata
*) ((char *) from
+ nbytes
);
1875 /* FROM->string non-null means it's alive. Copy its data. */
1878 /* If TB is full, proceed with the next sblock. */
1879 to_end
= (struct sdata
*) ((char *) to
+ nbytes
);
1880 if (to_end
> tb_end
)
1884 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
1885 to
= &tb
->first_data
;
1886 to_end
= (struct sdata
*) ((char *) to
+ nbytes
);
1889 /* Copy, and update the string's `data' pointer. */
1892 xassert (tb
!= b
|| to
<= from
);
1893 safe_bcopy ((char *) from
, (char *) to
, nbytes
);
1894 to
->string
->data
= SDATA_DATA (to
);
1897 /* Advance past the sdata we copied to. */
1903 /* The rest of the sblocks following TB don't contain live data, so
1904 we can free them. */
1905 for (b
= tb
->next
; b
; b
= next
)
1913 current_sblock
= tb
;
1917 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
1918 doc
: /* Return a newly created string of length LENGTH, with INIT in each element.
1919 LENGTH must be an integer.
1920 INIT must be an integer that represents a character. */)
1922 Lisp_Object length
, init
;
1924 register Lisp_Object val
;
1925 register unsigned char *p
, *end
;
1928 CHECK_NATNUM (length
);
1929 CHECK_NUMBER (init
);
1932 if (SINGLE_BYTE_CHAR_P (c
))
1934 nbytes
= XINT (length
);
1935 val
= make_uninit_string (nbytes
);
1937 end
= p
+ SCHARS (val
);
1943 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
1944 int len
= CHAR_STRING (c
, str
);
1946 nbytes
= len
* XINT (length
);
1947 val
= make_uninit_multibyte_string (XINT (length
), nbytes
);
1952 bcopy (str
, p
, len
);
1962 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
1963 doc
: /* Return a new bool-vector of length LENGTH, using INIT for as each element.
1964 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
1966 Lisp_Object length
, init
;
1968 register Lisp_Object val
;
1969 struct Lisp_Bool_Vector
*p
;
1971 int length_in_chars
, length_in_elts
, bits_per_value
;
1973 CHECK_NATNUM (length
);
1975 bits_per_value
= sizeof (EMACS_INT
) * BOOL_VECTOR_BITS_PER_CHAR
;
1977 length_in_elts
= (XFASTINT (length
) + bits_per_value
- 1) / bits_per_value
;
1978 length_in_chars
= ((XFASTINT (length
) + BOOL_VECTOR_BITS_PER_CHAR
- 1)
1979 / BOOL_VECTOR_BITS_PER_CHAR
);
1981 /* We must allocate one more elements than LENGTH_IN_ELTS for the
1982 slot `size' of the struct Lisp_Bool_Vector. */
1983 val
= Fmake_vector (make_number (length_in_elts
+ 1), Qnil
);
1984 p
= XBOOL_VECTOR (val
);
1986 /* Get rid of any bits that would cause confusion. */
1988 XSETBOOL_VECTOR (val
, p
);
1989 p
->size
= XFASTINT (length
);
1991 real_init
= (NILP (init
) ? 0 : -1);
1992 for (i
= 0; i
< length_in_chars
; i
++)
1993 p
->data
[i
] = real_init
;
1995 /* Clear the extraneous bits in the last byte. */
1996 if (XINT (length
) != length_in_chars
* BOOL_VECTOR_BITS_PER_CHAR
)
1997 XBOOL_VECTOR (val
)->data
[length_in_chars
- 1]
1998 &= (1 << (XINT (length
) % BOOL_VECTOR_BITS_PER_CHAR
)) - 1;
2004 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
2005 of characters from the contents. This string may be unibyte or
2006 multibyte, depending on the contents. */
2009 make_string (contents
, nbytes
)
2010 const char *contents
;
2013 register Lisp_Object val
;
2014 int nchars
, multibyte_nbytes
;
2016 parse_str_as_multibyte (contents
, nbytes
, &nchars
, &multibyte_nbytes
);
2017 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
2018 /* CONTENTS contains no multibyte sequences or contains an invalid
2019 multibyte sequence. We must make unibyte string. */
2020 val
= make_unibyte_string (contents
, nbytes
);
2022 val
= make_multibyte_string (contents
, nchars
, nbytes
);
2027 /* Make an unibyte string from LENGTH bytes at CONTENTS. */
2030 make_unibyte_string (contents
, length
)
2031 const char *contents
;
2034 register Lisp_Object val
;
2035 val
= make_uninit_string (length
);
2036 bcopy (contents
, SDATA (val
), length
);
2037 STRING_SET_UNIBYTE (val
);
2042 /* Make a multibyte string from NCHARS characters occupying NBYTES
2043 bytes at CONTENTS. */
2046 make_multibyte_string (contents
, nchars
, nbytes
)
2047 const char *contents
;
2050 register Lisp_Object val
;
2051 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2052 bcopy (contents
, SDATA (val
), nbytes
);
2057 /* Make a string from NCHARS characters occupying NBYTES bytes at
2058 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2061 make_string_from_bytes (contents
, nchars
, nbytes
)
2062 const char *contents
;
2065 register Lisp_Object val
;
2066 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2067 bcopy (contents
, SDATA (val
), nbytes
);
2068 if (SBYTES (val
) == SCHARS (val
))
2069 STRING_SET_UNIBYTE (val
);
2074 /* Make a string from NCHARS characters occupying NBYTES bytes at
2075 CONTENTS. The argument MULTIBYTE controls whether to label the
2076 string as multibyte. If NCHARS is negative, it counts the number of
2077 characters by itself. */
2080 make_specified_string (contents
, nchars
, nbytes
, multibyte
)
2081 const char *contents
;
2085 register Lisp_Object val
;
2090 nchars
= multibyte_chars_in_text (contents
, nbytes
);
2094 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2095 bcopy (contents
, SDATA (val
), nbytes
);
2097 STRING_SET_UNIBYTE (val
);
2102 /* Make a string from the data at STR, treating it as multibyte if the
2109 return make_string (str
, strlen (str
));
2113 /* Return an unibyte Lisp_String set up to hold LENGTH characters
2114 occupying LENGTH bytes. */
2117 make_uninit_string (length
)
2121 val
= make_uninit_multibyte_string (length
, length
);
2122 STRING_SET_UNIBYTE (val
);
2127 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2128 which occupy NBYTES bytes. */
2131 make_uninit_multibyte_string (nchars
, nbytes
)
2135 struct Lisp_String
*s
;
2140 s
= allocate_string ();
2141 allocate_string_data (s
, nchars
, nbytes
);
2142 XSETSTRING (string
, s
);
2143 string_chars_consed
+= nbytes
;
2149 /***********************************************************************
2151 ***********************************************************************/
2153 /* We store float cells inside of float_blocks, allocating a new
2154 float_block with malloc whenever necessary. Float cells reclaimed
2155 by GC are put on a free list to be reallocated before allocating
2156 any new float cells from the latest float_block. */
2158 #define FLOAT_BLOCK_SIZE \
2159 (((BLOCK_BYTES - sizeof (struct float_block *) \
2160 /* The compiler might add padding at the end. */ \
2161 - (sizeof (struct Lisp_Float) - sizeof (int))) * CHAR_BIT) \
2162 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2164 #define GETMARKBIT(block,n) \
2165 (((block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2166 >> ((n) % (sizeof(int) * CHAR_BIT))) \
2169 #define SETMARKBIT(block,n) \
2170 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2171 |= 1 << ((n) % (sizeof(int) * CHAR_BIT))
2173 #define UNSETMARKBIT(block,n) \
2174 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2175 &= ~(1 << ((n) % (sizeof(int) * CHAR_BIT)))
2177 #define FLOAT_BLOCK(fptr) \
2178 ((struct float_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2180 #define FLOAT_INDEX(fptr) \
2181 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2185 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2186 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2187 int gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2188 struct float_block
*next
;
2191 #define FLOAT_MARKED_P(fptr) \
2192 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2194 #define FLOAT_MARK(fptr) \
2195 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2197 #define FLOAT_UNMARK(fptr) \
2198 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2200 /* Current float_block. */
2202 struct float_block
*float_block
;
2204 /* Index of first unused Lisp_Float in the current float_block. */
2206 int float_block_index
;
2208 /* Total number of float blocks now in use. */
2212 /* Free-list of Lisp_Floats. */
2214 struct Lisp_Float
*float_free_list
;
2217 /* Initialize float allocation. */
2223 float_block_index
= FLOAT_BLOCK_SIZE
; /* Force alloc of new float_block. */
2224 float_free_list
= 0;
2229 /* Explicitly free a float cell by putting it on the free-list. */
2233 struct Lisp_Float
*ptr
;
2235 *(struct Lisp_Float
**)&ptr
->data
= float_free_list
;
2236 float_free_list
= ptr
;
2240 /* Return a new float object with value FLOAT_VALUE. */
2243 make_float (float_value
)
2246 register Lisp_Object val
;
2248 if (float_free_list
)
2250 /* We use the data field for chaining the free list
2251 so that we won't use the same field that has the mark bit. */
2252 XSETFLOAT (val
, float_free_list
);
2253 float_free_list
= *(struct Lisp_Float
**)&float_free_list
->data
;
2257 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2259 register struct float_block
*new;
2261 new = (struct float_block
*) lisp_align_malloc (sizeof *new,
2263 new->next
= float_block
;
2264 bzero ((char *) new->gcmarkbits
, sizeof new->gcmarkbits
);
2266 float_block_index
= 0;
2269 XSETFLOAT (val
, &float_block
->floats
[float_block_index
]);
2270 float_block_index
++;
2273 XFLOAT_DATA (val
) = float_value
;
2274 eassert (!FLOAT_MARKED_P (XFLOAT (val
)));
2275 consing_since_gc
+= sizeof (struct Lisp_Float
);
2282 /***********************************************************************
2284 ***********************************************************************/
2286 /* We store cons cells inside of cons_blocks, allocating a new
2287 cons_block with malloc whenever necessary. Cons cells reclaimed by
2288 GC are put on a free list to be reallocated before allocating
2289 any new cons cells from the latest cons_block. */
2291 #define CONS_BLOCK_SIZE \
2292 (((BLOCK_BYTES - sizeof (struct cons_block *)) * CHAR_BIT) \
2293 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2295 #define CONS_BLOCK(fptr) \
2296 ((struct cons_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2298 #define CONS_INDEX(fptr) \
2299 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2303 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2304 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2305 int gcmarkbits
[1 + CONS_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2306 struct cons_block
*next
;
2309 #define CONS_MARKED_P(fptr) \
2310 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2312 #define CONS_MARK(fptr) \
2313 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2315 #define CONS_UNMARK(fptr) \
2316 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2318 /* Current cons_block. */
2320 struct cons_block
*cons_block
;
2322 /* Index of first unused Lisp_Cons in the current block. */
2324 int cons_block_index
;
2326 /* Free-list of Lisp_Cons structures. */
2328 struct Lisp_Cons
*cons_free_list
;
2330 /* Total number of cons blocks now in use. */
2335 /* Initialize cons allocation. */
2341 cons_block_index
= CONS_BLOCK_SIZE
; /* Force alloc of new cons_block. */
2347 /* Explicitly free a cons cell by putting it on the free-list. */
2351 struct Lisp_Cons
*ptr
;
2353 *(struct Lisp_Cons
**)&ptr
->cdr
= cons_free_list
;
2357 cons_free_list
= ptr
;
2360 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
2361 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2363 Lisp_Object car
, cdr
;
2365 register Lisp_Object val
;
2369 /* We use the cdr for chaining the free list
2370 so that we won't use the same field that has the mark bit. */
2371 XSETCONS (val
, cons_free_list
);
2372 cons_free_list
= *(struct Lisp_Cons
**)&cons_free_list
->cdr
;
2376 if (cons_block_index
== CONS_BLOCK_SIZE
)
2378 register struct cons_block
*new;
2379 new = (struct cons_block
*) lisp_align_malloc (sizeof *new,
2381 bzero ((char *) new->gcmarkbits
, sizeof new->gcmarkbits
);
2382 new->next
= cons_block
;
2384 cons_block_index
= 0;
2387 XSETCONS (val
, &cons_block
->conses
[cons_block_index
]);
2393 eassert (!CONS_MARKED_P (XCONS (val
)));
2394 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2395 cons_cells_consed
++;
2399 /* Get an error now if there's any junk in the cons free list. */
2403 struct Lisp_Cons
*tail
= cons_free_list
;
2407 tail
= *(struct Lisp_Cons
**)&tail
->cdr
;
2411 /* Make a list of 2, 3, 4 or 5 specified objects. */
2415 Lisp_Object arg1
, arg2
;
2417 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2422 list3 (arg1
, arg2
, arg3
)
2423 Lisp_Object arg1
, arg2
, arg3
;
2425 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2430 list4 (arg1
, arg2
, arg3
, arg4
)
2431 Lisp_Object arg1
, arg2
, arg3
, arg4
;
2433 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2438 list5 (arg1
, arg2
, arg3
, arg4
, arg5
)
2439 Lisp_Object arg1
, arg2
, arg3
, arg4
, arg5
;
2441 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2442 Fcons (arg5
, Qnil
)))));
2446 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
2447 doc
: /* Return a newly created list with specified arguments as elements.
2448 Any number of arguments, even zero arguments, are allowed.
2449 usage: (list &rest OBJECTS) */)
2452 register Lisp_Object
*args
;
2454 register Lisp_Object val
;
2460 val
= Fcons (args
[nargs
], val
);
2466 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2467 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2469 register Lisp_Object length
, init
;
2471 register Lisp_Object val
;
2474 CHECK_NATNUM (length
);
2475 size
= XFASTINT (length
);
2480 val
= Fcons (init
, val
);
2485 val
= Fcons (init
, val
);
2490 val
= Fcons (init
, val
);
2495 val
= Fcons (init
, val
);
2500 val
= Fcons (init
, val
);
2515 /***********************************************************************
2517 ***********************************************************************/
2519 /* Singly-linked list of all vectors. */
2521 struct Lisp_Vector
*all_vectors
;
2523 /* Total number of vector-like objects now in use. */
2528 /* Value is a pointer to a newly allocated Lisp_Vector structure
2529 with room for LEN Lisp_Objects. */
2531 static struct Lisp_Vector
*
2532 allocate_vectorlike (len
, type
)
2536 struct Lisp_Vector
*p
;
2539 #ifdef DOUG_LEA_MALLOC
2540 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
2541 because mapped region contents are not preserved in
2544 mallopt (M_MMAP_MAX
, 0);
2548 nbytes
= sizeof *p
+ (len
- 1) * sizeof p
->contents
[0];
2549 p
= (struct Lisp_Vector
*) lisp_malloc (nbytes
, type
);
2551 #ifdef DOUG_LEA_MALLOC
2552 /* Back to a reasonable maximum of mmap'ed areas. */
2554 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2558 consing_since_gc
+= nbytes
;
2559 vector_cells_consed
+= len
;
2561 p
->next
= all_vectors
;
2568 /* Allocate a vector with NSLOTS slots. */
2570 struct Lisp_Vector
*
2571 allocate_vector (nslots
)
2574 struct Lisp_Vector
*v
= allocate_vectorlike (nslots
, MEM_TYPE_VECTOR
);
2580 /* Allocate other vector-like structures. */
2582 struct Lisp_Hash_Table
*
2583 allocate_hash_table ()
2585 EMACS_INT len
= VECSIZE (struct Lisp_Hash_Table
);
2586 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_HASH_TABLE
);
2590 for (i
= 0; i
< len
; ++i
)
2591 v
->contents
[i
] = Qnil
;
2593 return (struct Lisp_Hash_Table
*) v
;
2600 EMACS_INT len
= VECSIZE (struct window
);
2601 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_WINDOW
);
2604 for (i
= 0; i
< len
; ++i
)
2605 v
->contents
[i
] = Qnil
;
2608 return (struct window
*) v
;
2615 EMACS_INT len
= VECSIZE (struct frame
);
2616 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_FRAME
);
2619 for (i
= 0; i
< len
; ++i
)
2620 v
->contents
[i
] = make_number (0);
2622 return (struct frame
*) v
;
2626 struct Lisp_Process
*
2629 EMACS_INT len
= VECSIZE (struct Lisp_Process
);
2630 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_PROCESS
);
2633 for (i
= 0; i
< len
; ++i
)
2634 v
->contents
[i
] = Qnil
;
2637 return (struct Lisp_Process
*) v
;
2641 struct Lisp_Vector
*
2642 allocate_other_vector (len
)
2645 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_VECTOR
);
2648 for (i
= 0; i
< len
; ++i
)
2649 v
->contents
[i
] = Qnil
;
2656 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
2657 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
2658 See also the function `vector'. */)
2660 register Lisp_Object length
, init
;
2663 register EMACS_INT sizei
;
2665 register struct Lisp_Vector
*p
;
2667 CHECK_NATNUM (length
);
2668 sizei
= XFASTINT (length
);
2670 p
= allocate_vector (sizei
);
2671 for (index
= 0; index
< sizei
; index
++)
2672 p
->contents
[index
] = init
;
2674 XSETVECTOR (vector
, p
);
2679 DEFUN ("make-char-table", Fmake_char_table
, Smake_char_table
, 1, 2, 0,
2680 doc
: /* Return a newly created char-table, with purpose PURPOSE.
2681 Each element is initialized to INIT, which defaults to nil.
2682 PURPOSE should be a symbol which has a `char-table-extra-slots' property.
2683 The property's value should be an integer between 0 and 10. */)
2685 register Lisp_Object purpose
, init
;
2689 CHECK_SYMBOL (purpose
);
2690 n
= Fget (purpose
, Qchar_table_extra_slots
);
2692 if (XINT (n
) < 0 || XINT (n
) > 10)
2693 args_out_of_range (n
, Qnil
);
2694 /* Add 2 to the size for the defalt and parent slots. */
2695 vector
= Fmake_vector (make_number (CHAR_TABLE_STANDARD_SLOTS
+ XINT (n
)),
2697 XCHAR_TABLE (vector
)->top
= Qt
;
2698 XCHAR_TABLE (vector
)->parent
= Qnil
;
2699 XCHAR_TABLE (vector
)->purpose
= purpose
;
2700 XSETCHAR_TABLE (vector
, XCHAR_TABLE (vector
));
2705 /* Return a newly created sub char table with default value DEFALT.
2706 Since a sub char table does not appear as a top level Emacs Lisp
2707 object, we don't need a Lisp interface to make it. */
2710 make_sub_char_table (defalt
)
2714 = Fmake_vector (make_number (SUB_CHAR_TABLE_STANDARD_SLOTS
), Qnil
);
2715 XCHAR_TABLE (vector
)->top
= Qnil
;
2716 XCHAR_TABLE (vector
)->defalt
= defalt
;
2717 XSETCHAR_TABLE (vector
, XCHAR_TABLE (vector
));
2722 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
2723 doc
: /* Return a newly created vector with specified arguments as elements.
2724 Any number of arguments, even zero arguments, are allowed.
2725 usage: (vector &rest OBJECTS) */)
2730 register Lisp_Object len
, val
;
2732 register struct Lisp_Vector
*p
;
2734 XSETFASTINT (len
, nargs
);
2735 val
= Fmake_vector (len
, Qnil
);
2737 for (index
= 0; index
< nargs
; index
++)
2738 p
->contents
[index
] = args
[index
];
2743 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
2744 doc
: /* Create a byte-code object with specified arguments as elements.
2745 The arguments should be the arglist, bytecode-string, constant vector,
2746 stack size, (optional) doc string, and (optional) interactive spec.
2747 The first four arguments are required; at most six have any
2749 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
2754 register Lisp_Object len
, val
;
2756 register struct Lisp_Vector
*p
;
2758 XSETFASTINT (len
, nargs
);
2759 if (!NILP (Vpurify_flag
))
2760 val
= make_pure_vector ((EMACS_INT
) nargs
);
2762 val
= Fmake_vector (len
, Qnil
);
2764 if (STRINGP (args
[1]) && STRING_MULTIBYTE (args
[1]))
2765 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
2766 earlier because they produced a raw 8-bit string for byte-code
2767 and now such a byte-code string is loaded as multibyte while
2768 raw 8-bit characters converted to multibyte form. Thus, now we
2769 must convert them back to the original unibyte form. */
2770 args
[1] = Fstring_as_unibyte (args
[1]);
2773 for (index
= 0; index
< nargs
; index
++)
2775 if (!NILP (Vpurify_flag
))
2776 args
[index
] = Fpurecopy (args
[index
]);
2777 p
->contents
[index
] = args
[index
];
2779 XSETCOMPILED (val
, p
);
2785 /***********************************************************************
2787 ***********************************************************************/
2789 /* Each symbol_block is just under 1020 bytes long, since malloc
2790 really allocates in units of powers of two and uses 4 bytes for its
2793 #define SYMBOL_BLOCK_SIZE \
2794 ((1020 - sizeof (struct symbol_block *)) / sizeof (struct Lisp_Symbol))
2798 /* Place `symbols' first, to preserve alignment. */
2799 struct Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
2800 struct symbol_block
*next
;
2803 /* Current symbol block and index of first unused Lisp_Symbol
2806 struct symbol_block
*symbol_block
;
2807 int symbol_block_index
;
2809 /* List of free symbols. */
2811 struct Lisp_Symbol
*symbol_free_list
;
2813 /* Total number of symbol blocks now in use. */
2815 int n_symbol_blocks
;
2818 /* Initialize symbol allocation. */
2823 symbol_block
= NULL
;
2824 symbol_block_index
= SYMBOL_BLOCK_SIZE
;
2825 symbol_free_list
= 0;
2826 n_symbol_blocks
= 0;
2830 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
2831 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
2832 Its value and function definition are void, and its property list is nil. */)
2836 register Lisp_Object val
;
2837 register struct Lisp_Symbol
*p
;
2839 CHECK_STRING (name
);
2841 if (symbol_free_list
)
2843 XSETSYMBOL (val
, symbol_free_list
);
2844 symbol_free_list
= *(struct Lisp_Symbol
**)&symbol_free_list
->value
;
2848 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
2850 struct symbol_block
*new;
2851 new = (struct symbol_block
*) lisp_malloc (sizeof *new,
2853 new->next
= symbol_block
;
2855 symbol_block_index
= 0;
2858 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
]);
2859 symbol_block_index
++;
2865 p
->value
= Qunbound
;
2866 p
->function
= Qunbound
;
2869 p
->interned
= SYMBOL_UNINTERNED
;
2871 p
->indirect_variable
= 0;
2872 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
2879 /***********************************************************************
2880 Marker (Misc) Allocation
2881 ***********************************************************************/
2883 /* Allocation of markers and other objects that share that structure.
2884 Works like allocation of conses. */
2886 #define MARKER_BLOCK_SIZE \
2887 ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc))
2891 /* Place `markers' first, to preserve alignment. */
2892 union Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
2893 struct marker_block
*next
;
2896 struct marker_block
*marker_block
;
2897 int marker_block_index
;
2899 union Lisp_Misc
*marker_free_list
;
2901 /* Total number of marker blocks now in use. */
2903 int n_marker_blocks
;
2908 marker_block
= NULL
;
2909 marker_block_index
= MARKER_BLOCK_SIZE
;
2910 marker_free_list
= 0;
2911 n_marker_blocks
= 0;
2914 /* Return a newly allocated Lisp_Misc object, with no substructure. */
2921 if (marker_free_list
)
2923 XSETMISC (val
, marker_free_list
);
2924 marker_free_list
= marker_free_list
->u_free
.chain
;
2928 if (marker_block_index
== MARKER_BLOCK_SIZE
)
2930 struct marker_block
*new;
2931 new = (struct marker_block
*) lisp_malloc (sizeof *new,
2933 new->next
= marker_block
;
2935 marker_block_index
= 0;
2937 total_free_markers
+= MARKER_BLOCK_SIZE
;
2939 XSETMISC (val
, &marker_block
->markers
[marker_block_index
]);
2940 marker_block_index
++;
2943 --total_free_markers
;
2944 consing_since_gc
+= sizeof (union Lisp_Misc
);
2945 misc_objects_consed
++;
2946 XMARKER (val
)->gcmarkbit
= 0;
2950 /* Free a Lisp_Misc object */
2956 XMISC (misc
)->u_marker
.type
= Lisp_Misc_Free
;
2957 XMISC (misc
)->u_free
.chain
= marker_free_list
;
2958 marker_free_list
= XMISC (misc
);
2960 total_free_markers
++;
2963 /* Return a Lisp_Misc_Save_Value object containing POINTER and
2964 INTEGER. This is used to package C values to call record_unwind_protect.
2965 The unwind function can get the C values back using XSAVE_VALUE. */
2968 make_save_value (pointer
, integer
)
2972 register Lisp_Object val
;
2973 register struct Lisp_Save_Value
*p
;
2975 val
= allocate_misc ();
2976 XMISCTYPE (val
) = Lisp_Misc_Save_Value
;
2977 p
= XSAVE_VALUE (val
);
2978 p
->pointer
= pointer
;
2979 p
->integer
= integer
;
2984 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
2985 doc
: /* Return a newly allocated marker which does not point at any place. */)
2988 register Lisp_Object val
;
2989 register struct Lisp_Marker
*p
;
2991 val
= allocate_misc ();
2992 XMISCTYPE (val
) = Lisp_Misc_Marker
;
2998 p
->insertion_type
= 0;
3002 /* Put MARKER back on the free list after using it temporarily. */
3005 free_marker (marker
)
3008 unchain_marker (XMARKER (marker
));
3013 /* Return a newly created vector or string with specified arguments as
3014 elements. If all the arguments are characters that can fit
3015 in a string of events, make a string; otherwise, make a vector.
3017 Any number of arguments, even zero arguments, are allowed. */
3020 make_event_array (nargs
, args
)
3026 for (i
= 0; i
< nargs
; i
++)
3027 /* The things that fit in a string
3028 are characters that are in 0...127,
3029 after discarding the meta bit and all the bits above it. */
3030 if (!INTEGERP (args
[i
])
3031 || (XUINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
3032 return Fvector (nargs
, args
);
3034 /* Since the loop exited, we know that all the things in it are
3035 characters, so we can make a string. */
3039 result
= Fmake_string (make_number (nargs
), make_number (0));
3040 for (i
= 0; i
< nargs
; i
++)
3042 SSET (result
, i
, XINT (args
[i
]));
3043 /* Move the meta bit to the right place for a string char. */
3044 if (XINT (args
[i
]) & CHAR_META
)
3045 SSET (result
, i
, SREF (result
, i
) | 0x80);
3054 /************************************************************************
3056 ************************************************************************/
3058 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
3060 /* Conservative C stack marking requires a method to identify possibly
3061 live Lisp objects given a pointer value. We do this by keeping
3062 track of blocks of Lisp data that are allocated in a red-black tree
3063 (see also the comment of mem_node which is the type of nodes in
3064 that tree). Function lisp_malloc adds information for an allocated
3065 block to the red-black tree with calls to mem_insert, and function
3066 lisp_free removes it with mem_delete. Functions live_string_p etc
3067 call mem_find to lookup information about a given pointer in the
3068 tree, and use that to determine if the pointer points to a Lisp
3071 /* Initialize this part of alloc.c. */
3076 mem_z
.left
= mem_z
.right
= MEM_NIL
;
3077 mem_z
.parent
= NULL
;
3078 mem_z
.color
= MEM_BLACK
;
3079 mem_z
.start
= mem_z
.end
= NULL
;
3084 /* Value is a pointer to the mem_node containing START. Value is
3085 MEM_NIL if there is no node in the tree containing START. */
3087 static INLINE
struct mem_node
*
3093 if (start
< min_heap_address
|| start
> max_heap_address
)
3096 /* Make the search always successful to speed up the loop below. */
3097 mem_z
.start
= start
;
3098 mem_z
.end
= (char *) start
+ 1;
3101 while (start
< p
->start
|| start
>= p
->end
)
3102 p
= start
< p
->start
? p
->left
: p
->right
;
3107 /* Insert a new node into the tree for a block of memory with start
3108 address START, end address END, and type TYPE. Value is a
3109 pointer to the node that was inserted. */
3111 static struct mem_node
*
3112 mem_insert (start
, end
, type
)
3116 struct mem_node
*c
, *parent
, *x
;
3118 if (start
< min_heap_address
)
3119 min_heap_address
= start
;
3120 if (end
> max_heap_address
)
3121 max_heap_address
= end
;
3123 /* See where in the tree a node for START belongs. In this
3124 particular application, it shouldn't happen that a node is already
3125 present. For debugging purposes, let's check that. */
3129 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3131 while (c
!= MEM_NIL
)
3133 if (start
>= c
->start
&& start
< c
->end
)
3136 c
= start
< c
->start
? c
->left
: c
->right
;
3139 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3141 while (c
!= MEM_NIL
)
3144 c
= start
< c
->start
? c
->left
: c
->right
;
3147 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3149 /* Create a new node. */
3150 #ifdef GC_MALLOC_CHECK
3151 x
= (struct mem_node
*) _malloc_internal (sizeof *x
);
3155 x
= (struct mem_node
*) xmalloc (sizeof *x
);
3161 x
->left
= x
->right
= MEM_NIL
;
3164 /* Insert it as child of PARENT or install it as root. */
3167 if (start
< parent
->start
)
3175 /* Re-establish red-black tree properties. */
3176 mem_insert_fixup (x
);
3182 /* Re-establish the red-black properties of the tree, and thereby
3183 balance the tree, after node X has been inserted; X is always red. */
3186 mem_insert_fixup (x
)
3189 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3191 /* X is red and its parent is red. This is a violation of
3192 red-black tree property #3. */
3194 if (x
->parent
== x
->parent
->parent
->left
)
3196 /* We're on the left side of our grandparent, and Y is our
3198 struct mem_node
*y
= x
->parent
->parent
->right
;
3200 if (y
->color
== MEM_RED
)
3202 /* Uncle and parent are red but should be black because
3203 X is red. Change the colors accordingly and proceed
3204 with the grandparent. */
3205 x
->parent
->color
= MEM_BLACK
;
3206 y
->color
= MEM_BLACK
;
3207 x
->parent
->parent
->color
= MEM_RED
;
3208 x
= x
->parent
->parent
;
3212 /* Parent and uncle have different colors; parent is
3213 red, uncle is black. */
3214 if (x
== x
->parent
->right
)
3217 mem_rotate_left (x
);
3220 x
->parent
->color
= MEM_BLACK
;
3221 x
->parent
->parent
->color
= MEM_RED
;
3222 mem_rotate_right (x
->parent
->parent
);
3227 /* This is the symmetrical case of above. */
3228 struct mem_node
*y
= x
->parent
->parent
->left
;
3230 if (y
->color
== MEM_RED
)
3232 x
->parent
->color
= MEM_BLACK
;
3233 y
->color
= MEM_BLACK
;
3234 x
->parent
->parent
->color
= MEM_RED
;
3235 x
= x
->parent
->parent
;
3239 if (x
== x
->parent
->left
)
3242 mem_rotate_right (x
);
3245 x
->parent
->color
= MEM_BLACK
;
3246 x
->parent
->parent
->color
= MEM_RED
;
3247 mem_rotate_left (x
->parent
->parent
);
3252 /* The root may have been changed to red due to the algorithm. Set
3253 it to black so that property #5 is satisfied. */
3254 mem_root
->color
= MEM_BLACK
;
3270 /* Turn y's left sub-tree into x's right sub-tree. */
3273 if (y
->left
!= MEM_NIL
)
3274 y
->left
->parent
= x
;
3276 /* Y's parent was x's parent. */
3278 y
->parent
= x
->parent
;
3280 /* Get the parent to point to y instead of x. */
3283 if (x
== x
->parent
->left
)
3284 x
->parent
->left
= y
;
3286 x
->parent
->right
= y
;
3291 /* Put x on y's left. */
3305 mem_rotate_right (x
)
3308 struct mem_node
*y
= x
->left
;
3311 if (y
->right
!= MEM_NIL
)
3312 y
->right
->parent
= x
;
3315 y
->parent
= x
->parent
;
3318 if (x
== x
->parent
->right
)
3319 x
->parent
->right
= y
;
3321 x
->parent
->left
= y
;
3332 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
3338 struct mem_node
*x
, *y
;
3340 if (!z
|| z
== MEM_NIL
)
3343 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
3348 while (y
->left
!= MEM_NIL
)
3352 if (y
->left
!= MEM_NIL
)
3357 x
->parent
= y
->parent
;
3360 if (y
== y
->parent
->left
)
3361 y
->parent
->left
= x
;
3363 y
->parent
->right
= x
;
3370 z
->start
= y
->start
;
3375 if (y
->color
== MEM_BLACK
)
3376 mem_delete_fixup (x
);
3378 #ifdef GC_MALLOC_CHECK
3386 /* Re-establish the red-black properties of the tree, after a
3390 mem_delete_fixup (x
)
3393 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
3395 if (x
== x
->parent
->left
)
3397 struct mem_node
*w
= x
->parent
->right
;
3399 if (w
->color
== MEM_RED
)
3401 w
->color
= MEM_BLACK
;
3402 x
->parent
->color
= MEM_RED
;
3403 mem_rotate_left (x
->parent
);
3404 w
= x
->parent
->right
;
3407 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
3414 if (w
->right
->color
== MEM_BLACK
)
3416 w
->left
->color
= MEM_BLACK
;
3418 mem_rotate_right (w
);
3419 w
= x
->parent
->right
;
3421 w
->color
= x
->parent
->color
;
3422 x
->parent
->color
= MEM_BLACK
;
3423 w
->right
->color
= MEM_BLACK
;
3424 mem_rotate_left (x
->parent
);
3430 struct mem_node
*w
= x
->parent
->left
;
3432 if (w
->color
== MEM_RED
)
3434 w
->color
= MEM_BLACK
;
3435 x
->parent
->color
= MEM_RED
;
3436 mem_rotate_right (x
->parent
);
3437 w
= x
->parent
->left
;
3440 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
3447 if (w
->left
->color
== MEM_BLACK
)
3449 w
->right
->color
= MEM_BLACK
;
3451 mem_rotate_left (w
);
3452 w
= x
->parent
->left
;
3455 w
->color
= x
->parent
->color
;
3456 x
->parent
->color
= MEM_BLACK
;
3457 w
->left
->color
= MEM_BLACK
;
3458 mem_rotate_right (x
->parent
);
3464 x
->color
= MEM_BLACK
;
3468 /* Value is non-zero if P is a pointer to a live Lisp string on
3469 the heap. M is a pointer to the mem_block for P. */
3472 live_string_p (m
, p
)
3476 if (m
->type
== MEM_TYPE_STRING
)
3478 struct string_block
*b
= (struct string_block
*) m
->start
;
3479 int offset
= (char *) p
- (char *) &b
->strings
[0];
3481 /* P must point to the start of a Lisp_String structure, and it
3482 must not be on the free-list. */
3484 && offset
% sizeof b
->strings
[0] == 0
3485 && offset
< (STRING_BLOCK_SIZE
* sizeof b
->strings
[0])
3486 && ((struct Lisp_String
*) p
)->data
!= NULL
);
3493 /* Value is non-zero if P is a pointer to a live Lisp cons on
3494 the heap. M is a pointer to the mem_block for P. */
3501 if (m
->type
== MEM_TYPE_CONS
)
3503 struct cons_block
*b
= (struct cons_block
*) m
->start
;
3504 int offset
= (char *) p
- (char *) &b
->conses
[0];
3506 /* P must point to the start of a Lisp_Cons, not be
3507 one of the unused cells in the current cons block,
3508 and not be on the free-list. */
3510 && offset
% sizeof b
->conses
[0] == 0
3511 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
3513 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
3514 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
3521 /* Value is non-zero if P is a pointer to a live Lisp symbol on
3522 the heap. M is a pointer to the mem_block for P. */
3525 live_symbol_p (m
, p
)
3529 if (m
->type
== MEM_TYPE_SYMBOL
)
3531 struct symbol_block
*b
= (struct symbol_block
*) m
->start
;
3532 int offset
= (char *) p
- (char *) &b
->symbols
[0];
3534 /* P must point to the start of a Lisp_Symbol, not be
3535 one of the unused cells in the current symbol block,
3536 and not be on the free-list. */
3538 && offset
% sizeof b
->symbols
[0] == 0
3539 && offset
< (SYMBOL_BLOCK_SIZE
* sizeof b
->symbols
[0])
3540 && (b
!= symbol_block
3541 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
3542 && !EQ (((struct Lisp_Symbol
*) p
)->function
, Vdead
));
3549 /* Value is non-zero if P is a pointer to a live Lisp float on
3550 the heap. M is a pointer to the mem_block for P. */
3557 if (m
->type
== MEM_TYPE_FLOAT
)
3559 struct float_block
*b
= (struct float_block
*) m
->start
;
3560 int offset
= (char *) p
- (char *) &b
->floats
[0];
3562 /* P must point to the start of a Lisp_Float and not be
3563 one of the unused cells in the current float block. */
3565 && offset
% sizeof b
->floats
[0] == 0
3566 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
3567 && (b
!= float_block
3568 || offset
/ sizeof b
->floats
[0] < float_block_index
));
3575 /* Value is non-zero if P is a pointer to a live Lisp Misc on
3576 the heap. M is a pointer to the mem_block for P. */
3583 if (m
->type
== MEM_TYPE_MISC
)
3585 struct marker_block
*b
= (struct marker_block
*) m
->start
;
3586 int offset
= (char *) p
- (char *) &b
->markers
[0];
3588 /* P must point to the start of a Lisp_Misc, not be
3589 one of the unused cells in the current misc block,
3590 and not be on the free-list. */
3592 && offset
% sizeof b
->markers
[0] == 0
3593 && offset
< (MARKER_BLOCK_SIZE
* sizeof b
->markers
[0])
3594 && (b
!= marker_block
3595 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
3596 && ((union Lisp_Misc
*) p
)->u_marker
.type
!= Lisp_Misc_Free
);
3603 /* Value is non-zero if P is a pointer to a live vector-like object.
3604 M is a pointer to the mem_block for P. */
3607 live_vector_p (m
, p
)
3611 return (p
== m
->start
3612 && m
->type
>= MEM_TYPE_VECTOR
3613 && m
->type
<= MEM_TYPE_WINDOW
);
3617 /* Value is non-zero if P is a pointer to a live buffer. M is a
3618 pointer to the mem_block for P. */
3621 live_buffer_p (m
, p
)
3625 /* P must point to the start of the block, and the buffer
3626 must not have been killed. */
3627 return (m
->type
== MEM_TYPE_BUFFER
3629 && !NILP (((struct buffer
*) p
)->name
));
3632 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
3636 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3638 /* Array of objects that are kept alive because the C stack contains
3639 a pattern that looks like a reference to them . */
3641 #define MAX_ZOMBIES 10
3642 static Lisp_Object zombies
[MAX_ZOMBIES
];
3644 /* Number of zombie objects. */
3646 static int nzombies
;
3648 /* Number of garbage collections. */
3652 /* Average percentage of zombies per collection. */
3654 static double avg_zombies
;
3656 /* Max. number of live and zombie objects. */
3658 static int max_live
, max_zombies
;
3660 /* Average number of live objects per GC. */
3662 static double avg_live
;
3664 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
3665 doc
: /* Show information about live and zombie objects. */)
3668 Lisp_Object args
[8], zombie_list
= Qnil
;
3670 for (i
= 0; i
< nzombies
; i
++)
3671 zombie_list
= Fcons (zombies
[i
], zombie_list
);
3672 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
3673 args
[1] = make_number (ngcs
);
3674 args
[2] = make_float (avg_live
);
3675 args
[3] = make_float (avg_zombies
);
3676 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
3677 args
[5] = make_number (max_live
);
3678 args
[6] = make_number (max_zombies
);
3679 args
[7] = zombie_list
;
3680 return Fmessage (8, args
);
3683 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
3686 /* Mark OBJ if we can prove it's a Lisp_Object. */
3689 mark_maybe_object (obj
)
3692 void *po
= (void *) XPNTR (obj
);
3693 struct mem_node
*m
= mem_find (po
);
3699 switch (XGCTYPE (obj
))
3702 mark_p
= (live_string_p (m
, po
)
3703 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
3707 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
3711 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
3715 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
3718 case Lisp_Vectorlike
:
3719 /* Note: can't check GC_BUFFERP before we know it's a
3720 buffer because checking that dereferences the pointer
3721 PO which might point anywhere. */
3722 if (live_vector_p (m
, po
))
3723 mark_p
= !GC_SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
3724 else if (live_buffer_p (m
, po
))
3725 mark_p
= GC_BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
3729 mark_p
= (live_misc_p (m
, po
) && !XMARKER (obj
)->gcmarkbit
);
3733 case Lisp_Type_Limit
:
3739 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3740 if (nzombies
< MAX_ZOMBIES
)
3741 zombies
[nzombies
] = obj
;
3750 /* If P points to Lisp data, mark that as live if it isn't already
3754 mark_maybe_pointer (p
)
3759 /* Quickly rule out some values which can't point to Lisp data. We
3760 assume that Lisp data is aligned on even addresses. */
3761 if ((EMACS_INT
) p
& 1)
3767 Lisp_Object obj
= Qnil
;
3771 case MEM_TYPE_NON_LISP
:
3772 /* Nothing to do; not a pointer to Lisp memory. */
3775 case MEM_TYPE_BUFFER
:
3776 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P((struct buffer
*)p
))
3777 XSETVECTOR (obj
, p
);
3781 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
3785 case MEM_TYPE_STRING
:
3786 if (live_string_p (m
, p
)
3787 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
3788 XSETSTRING (obj
, p
);
3792 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
3796 case MEM_TYPE_SYMBOL
:
3797 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
3798 XSETSYMBOL (obj
, p
);
3801 case MEM_TYPE_FLOAT
:
3802 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
3806 case MEM_TYPE_VECTOR
:
3807 case MEM_TYPE_PROCESS
:
3808 case MEM_TYPE_HASH_TABLE
:
3809 case MEM_TYPE_FRAME
:
3810 case MEM_TYPE_WINDOW
:
3811 if (live_vector_p (m
, p
))
3814 XSETVECTOR (tem
, p
);
3815 if (!GC_SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
3830 /* Mark Lisp objects referenced from the address range START..END. */
3833 mark_memory (start
, end
)
3839 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3843 /* Make START the pointer to the start of the memory region,
3844 if it isn't already. */
3852 /* Mark Lisp_Objects. */
3853 for (p
= (Lisp_Object
*) start
; (void *) p
< end
; ++p
)
3854 mark_maybe_object (*p
);
3856 /* Mark Lisp data pointed to. This is necessary because, in some
3857 situations, the C compiler optimizes Lisp objects away, so that
3858 only a pointer to them remains. Example:
3860 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
3863 Lisp_Object obj = build_string ("test");
3864 struct Lisp_String *s = XSTRING (obj);
3865 Fgarbage_collect ();
3866 fprintf (stderr, "test `%s'\n", s->data);
3870 Here, `obj' isn't really used, and the compiler optimizes it
3871 away. The only reference to the life string is through the
3874 for (pp
= (void **) start
; (void *) pp
< end
; ++pp
)
3875 mark_maybe_pointer (*pp
);
3878 /* setjmp will work with GCC unless NON_SAVING_SETJMP is defined in
3879 the GCC system configuration. In gcc 3.2, the only systems for
3880 which this is so are i386-sco5 non-ELF, i386-sysv3 (maybe included
3881 by others?) and ns32k-pc532-min. */
3883 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
3885 static int setjmp_tested_p
, longjmps_done
;
3887 #define SETJMP_WILL_LIKELY_WORK "\
3889 Emacs garbage collector has been changed to use conservative stack\n\
3890 marking. Emacs has determined that the method it uses to do the\n\
3891 marking will likely work on your system, but this isn't sure.\n\
3893 If you are a system-programmer, or can get the help of a local wizard\n\
3894 who is, please take a look at the function mark_stack in alloc.c, and\n\
3895 verify that the methods used are appropriate for your system.\n\
3897 Please mail the result to <emacs-devel@gnu.org>.\n\
3900 #define SETJMP_WILL_NOT_WORK "\
3902 Emacs garbage collector has been changed to use conservative stack\n\
3903 marking. Emacs has determined that the default method it uses to do the\n\
3904 marking will not work on your system. We will need a system-dependent\n\
3905 solution for your system.\n\
3907 Please take a look at the function mark_stack in alloc.c, and\n\
3908 try to find a way to make it work on your system.\n\
3910 Note that you may get false negatives, depending on the compiler.\n\
3911 In particular, you need to use -O with GCC for this test.\n\
3913 Please mail the result to <emacs-devel@gnu.org>.\n\
3917 /* Perform a quick check if it looks like setjmp saves registers in a
3918 jmp_buf. Print a message to stderr saying so. When this test
3919 succeeds, this is _not_ a proof that setjmp is sufficient for
3920 conservative stack marking. Only the sources or a disassembly
3931 /* Arrange for X to be put in a register. */
3937 if (longjmps_done
== 1)
3939 /* Came here after the longjmp at the end of the function.
3941 If x == 1, the longjmp has restored the register to its
3942 value before the setjmp, and we can hope that setjmp
3943 saves all such registers in the jmp_buf, although that
3946 For other values of X, either something really strange is
3947 taking place, or the setjmp just didn't save the register. */
3950 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
3953 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
3960 if (longjmps_done
== 1)
3964 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
3967 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
3969 /* Abort if anything GCPRO'd doesn't survive the GC. */
3977 for (p
= gcprolist
; p
; p
= p
->next
)
3978 for (i
= 0; i
< p
->nvars
; ++i
)
3979 if (!survives_gc_p (p
->var
[i
]))
3980 /* FIXME: It's not necessarily a bug. It might just be that the
3981 GCPRO is unnecessary or should release the object sooner. */
3985 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3992 fprintf (stderr
, "\nZombies kept alive = %d:\n", nzombies
);
3993 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
3995 fprintf (stderr
, " %d = ", i
);
3996 debug_print (zombies
[i
]);
4000 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4003 /* Mark live Lisp objects on the C stack.
4005 There are several system-dependent problems to consider when
4006 porting this to new architectures:
4010 We have to mark Lisp objects in CPU registers that can hold local
4011 variables or are used to pass parameters.
4013 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
4014 something that either saves relevant registers on the stack, or
4015 calls mark_maybe_object passing it each register's contents.
4017 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
4018 implementation assumes that calling setjmp saves registers we need
4019 to see in a jmp_buf which itself lies on the stack. This doesn't
4020 have to be true! It must be verified for each system, possibly
4021 by taking a look at the source code of setjmp.
4025 Architectures differ in the way their processor stack is organized.
4026 For example, the stack might look like this
4029 | Lisp_Object | size = 4
4031 | something else | size = 2
4033 | Lisp_Object | size = 4
4037 In such a case, not every Lisp_Object will be aligned equally. To
4038 find all Lisp_Object on the stack it won't be sufficient to walk
4039 the stack in steps of 4 bytes. Instead, two passes will be
4040 necessary, one starting at the start of the stack, and a second
4041 pass starting at the start of the stack + 2. Likewise, if the
4042 minimal alignment of Lisp_Objects on the stack is 1, four passes
4043 would be necessary, each one starting with one byte more offset
4044 from the stack start.
4046 The current code assumes by default that Lisp_Objects are aligned
4047 equally on the stack. */
4054 volatile int stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
4057 /* This trick flushes the register windows so that all the state of
4058 the process is contained in the stack. */
4059 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
4060 needed on ia64 too. See mach_dep.c, where it also says inline
4061 assembler doesn't work with relevant proprietary compilers. */
4066 /* Save registers that we need to see on the stack. We need to see
4067 registers used to hold register variables and registers used to
4069 #ifdef GC_SAVE_REGISTERS_ON_STACK
4070 GC_SAVE_REGISTERS_ON_STACK (end
);
4071 #else /* not GC_SAVE_REGISTERS_ON_STACK */
4073 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
4074 setjmp will definitely work, test it
4075 and print a message with the result
4077 if (!setjmp_tested_p
)
4079 setjmp_tested_p
= 1;
4082 #endif /* GC_SETJMP_WORKS */
4085 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
4086 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
4088 /* This assumes that the stack is a contiguous region in memory. If
4089 that's not the case, something has to be done here to iterate
4090 over the stack segments. */
4091 #ifndef GC_LISP_OBJECT_ALIGNMENT
4093 #define GC_LISP_OBJECT_ALIGNMENT __alignof__ (Lisp_Object)
4095 #define GC_LISP_OBJECT_ALIGNMENT sizeof (Lisp_Object)
4098 for (i
= 0; i
< sizeof (Lisp_Object
); i
+= GC_LISP_OBJECT_ALIGNMENT
)
4099 mark_memory ((char *) stack_base
+ i
, end
);
4101 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4107 #endif /* GC_MARK_STACK != 0 */
4111 /***********************************************************************
4112 Pure Storage Management
4113 ***********************************************************************/
4115 /* Allocate room for SIZE bytes from pure Lisp storage and return a
4116 pointer to it. TYPE is the Lisp type for which the memory is
4117 allocated. TYPE < 0 means it's not used for a Lisp object.
4119 If store_pure_type_info is set and TYPE is >= 0, the type of
4120 the allocated object is recorded in pure_types. */
4122 static POINTER_TYPE
*
4123 pure_alloc (size
, type
)
4127 POINTER_TYPE
*result
;
4129 size_t alignment
= (1 << GCTYPEBITS
);
4131 size_t alignment
= sizeof (EMACS_INT
);
4133 /* Give Lisp_Floats an extra alignment. */
4134 if (type
== Lisp_Float
)
4136 #if defined __GNUC__ && __GNUC__ >= 2
4137 alignment
= __alignof (struct Lisp_Float
);
4139 alignment
= sizeof (struct Lisp_Float
);
4145 result
= ALIGN (purebeg
+ pure_bytes_used
, alignment
);
4146 pure_bytes_used
= ((char *)result
- (char *)purebeg
) + size
;
4148 if (pure_bytes_used
<= pure_size
)
4151 /* Don't allocate a large amount here,
4152 because it might get mmap'd and then its address
4153 might not be usable. */
4154 purebeg
= (char *) xmalloc (10000);
4156 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
4157 pure_bytes_used
= 0;
4162 /* Print a warning if PURESIZE is too small. */
4167 if (pure_bytes_used_before_overflow
)
4168 message ("Pure Lisp storage overflow (approx. %d bytes needed)",
4169 (int) (pure_bytes_used
+ pure_bytes_used_before_overflow
));
4173 /* Return a string allocated in pure space. DATA is a buffer holding
4174 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
4175 non-zero means make the result string multibyte.
4177 Must get an error if pure storage is full, since if it cannot hold
4178 a large string it may be able to hold conses that point to that
4179 string; then the string is not protected from gc. */
4182 make_pure_string (data
, nchars
, nbytes
, multibyte
)
4188 struct Lisp_String
*s
;
4190 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4191 s
->data
= (unsigned char *) pure_alloc (nbytes
+ 1, -1);
4193 s
->size_byte
= multibyte
? nbytes
: -1;
4194 bcopy (data
, s
->data
, nbytes
);
4195 s
->data
[nbytes
] = '\0';
4196 s
->intervals
= NULL_INTERVAL
;
4197 XSETSTRING (string
, s
);
4202 /* Return a cons allocated from pure space. Give it pure copies
4203 of CAR as car and CDR as cdr. */
4206 pure_cons (car
, cdr
)
4207 Lisp_Object car
, cdr
;
4209 register Lisp_Object
new;
4210 struct Lisp_Cons
*p
;
4212 p
= (struct Lisp_Cons
*) pure_alloc (sizeof *p
, Lisp_Cons
);
4214 XSETCAR (new, Fpurecopy (car
));
4215 XSETCDR (new, Fpurecopy (cdr
));
4220 /* Value is a float object with value NUM allocated from pure space. */
4223 make_pure_float (num
)
4226 register Lisp_Object
new;
4227 struct Lisp_Float
*p
;
4229 p
= (struct Lisp_Float
*) pure_alloc (sizeof *p
, Lisp_Float
);
4231 XFLOAT_DATA (new) = num
;
4236 /* Return a vector with room for LEN Lisp_Objects allocated from
4240 make_pure_vector (len
)
4244 struct Lisp_Vector
*p
;
4245 size_t size
= sizeof *p
+ (len
- 1) * sizeof (Lisp_Object
);
4247 p
= (struct Lisp_Vector
*) pure_alloc (size
, Lisp_Vectorlike
);
4248 XSETVECTOR (new, p
);
4249 XVECTOR (new)->size
= len
;
4254 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
4255 doc
: /* Make a copy of OBJECT in pure storage.
4256 Recursively copies contents of vectors and cons cells.
4257 Does not copy symbols. Copies strings without text properties. */)
4259 register Lisp_Object obj
;
4261 if (NILP (Vpurify_flag
))
4264 if (PURE_POINTER_P (XPNTR (obj
)))
4268 return pure_cons (XCAR (obj
), XCDR (obj
));
4269 else if (FLOATP (obj
))
4270 return make_pure_float (XFLOAT_DATA (obj
));
4271 else if (STRINGP (obj
))
4272 return make_pure_string (SDATA (obj
), SCHARS (obj
),
4274 STRING_MULTIBYTE (obj
));
4275 else if (COMPILEDP (obj
) || VECTORP (obj
))
4277 register struct Lisp_Vector
*vec
;
4281 size
= XVECTOR (obj
)->size
;
4282 if (size
& PSEUDOVECTOR_FLAG
)
4283 size
&= PSEUDOVECTOR_SIZE_MASK
;
4284 vec
= XVECTOR (make_pure_vector (size
));
4285 for (i
= 0; i
< size
; i
++)
4286 vec
->contents
[i
] = Fpurecopy (XVECTOR (obj
)->contents
[i
]);
4287 if (COMPILEDP (obj
))
4288 XSETCOMPILED (obj
, vec
);
4290 XSETVECTOR (obj
, vec
);
4293 else if (MARKERP (obj
))
4294 error ("Attempt to copy a marker to pure storage");
4301 /***********************************************************************
4303 ***********************************************************************/
4305 /* Put an entry in staticvec, pointing at the variable with address
4309 staticpro (varaddress
)
4310 Lisp_Object
*varaddress
;
4312 staticvec
[staticidx
++] = varaddress
;
4313 if (staticidx
>= NSTATICS
)
4321 struct catchtag
*next
;
4325 /***********************************************************************
4327 ***********************************************************************/
4329 /* Temporarily prevent garbage collection. */
4332 inhibit_garbage_collection ()
4334 int count
= SPECPDL_INDEX ();
4335 int nbits
= min (VALBITS
, BITS_PER_INT
);
4337 specbind (Qgc_cons_threshold
, make_number (((EMACS_INT
) 1 << (nbits
- 1)) - 1));
4342 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
4343 doc
: /* Reclaim storage for Lisp objects no longer needed.
4344 Garbage collection happens automatically if you cons more than
4345 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
4346 `garbage-collect' normally returns a list with info on amount of space in use:
4347 ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)
4348 (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS
4349 (USED-FLOATS . FREE-FLOATS) (USED-INTERVALS . FREE-INTERVALS)
4350 (USED-STRINGS . FREE-STRINGS))
4351 However, if there was overflow in pure space, `garbage-collect'
4352 returns nil, because real GC can't be done. */)
4355 register struct specbinding
*bind
;
4356 struct catchtag
*catch;
4357 struct handler
*handler
;
4358 char stack_top_variable
;
4361 Lisp_Object total
[8];
4362 int count
= SPECPDL_INDEX ();
4363 EMACS_TIME t1
, t2
, t3
;
4368 EMACS_GET_TIME (t1
);
4370 /* Can't GC if pure storage overflowed because we can't determine
4371 if something is a pure object or not. */
4372 if (pure_bytes_used_before_overflow
)
4375 /* In case user calls debug_print during GC,
4376 don't let that cause a recursive GC. */
4377 consing_since_gc
= 0;
4379 /* Save what's currently displayed in the echo area. */
4380 message_p
= push_message ();
4381 record_unwind_protect (pop_message_unwind
, Qnil
);
4383 /* Save a copy of the contents of the stack, for debugging. */
4384 #if MAX_SAVE_STACK > 0
4385 if (NILP (Vpurify_flag
))
4387 i
= &stack_top_variable
- stack_bottom
;
4389 if (i
< MAX_SAVE_STACK
)
4391 if (stack_copy
== 0)
4392 stack_copy
= (char *) xmalloc (stack_copy_size
= i
);
4393 else if (stack_copy_size
< i
)
4394 stack_copy
= (char *) xrealloc (stack_copy
, (stack_copy_size
= i
));
4397 if ((EMACS_INT
) (&stack_top_variable
- stack_bottom
) > 0)
4398 bcopy (stack_bottom
, stack_copy
, i
);
4400 bcopy (&stack_top_variable
, stack_copy
, i
);
4404 #endif /* MAX_SAVE_STACK > 0 */
4406 if (garbage_collection_messages
)
4407 message1_nolog ("Garbage collecting...");
4411 shrink_regexp_cache ();
4413 /* Don't keep undo information around forever. */
4415 register struct buffer
*nextb
= all_buffers
;
4419 /* If a buffer's undo list is Qt, that means that undo is
4420 turned off in that buffer. Calling truncate_undo_list on
4421 Qt tends to return NULL, which effectively turns undo back on.
4422 So don't call truncate_undo_list if undo_list is Qt. */
4423 if (! EQ (nextb
->undo_list
, Qt
))
4425 = truncate_undo_list (nextb
->undo_list
, undo_limit
,
4426 undo_strong_limit
, undo_outer_limit
);
4428 /* Shrink buffer gaps, but skip indirect and dead buffers. */
4429 if (nextb
->base_buffer
== 0 && !NILP (nextb
->name
))
4431 /* If a buffer's gap size is more than 10% of the buffer
4432 size, or larger than 2000 bytes, then shrink it
4433 accordingly. Keep a minimum size of 20 bytes. */
4434 int size
= min (2000, max (20, (nextb
->text
->z_byte
/ 10)));
4436 if (nextb
->text
->gap_size
> size
)
4438 struct buffer
*save_current
= current_buffer
;
4439 current_buffer
= nextb
;
4440 make_gap (-(nextb
->text
->gap_size
- size
));
4441 current_buffer
= save_current
;
4445 nextb
= nextb
->next
;
4451 /* clear_marks (); */
4453 /* Mark all the special slots that serve as the roots of accessibility. */
4455 for (i
= 0; i
< staticidx
; i
++)
4456 mark_object (*staticvec
[i
]);
4458 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
4459 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
4463 register struct gcpro
*tail
;
4464 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
4465 for (i
= 0; i
< tail
->nvars
; i
++)
4466 mark_object (tail
->var
[i
]);
4471 for (bind
= specpdl
; bind
!= specpdl_ptr
; bind
++)
4473 mark_object (bind
->symbol
);
4474 mark_object (bind
->old_value
);
4476 for (catch = catchlist
; catch; catch = catch->next
)
4478 mark_object (catch->tag
);
4479 mark_object (catch->val
);
4481 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
4483 mark_object (handler
->handler
);
4484 mark_object (handler
->var
);
4490 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4496 extern void xg_mark_data ();
4501 /* Everything is now marked, except for the things that require special
4502 finalization, i.e. the undo_list.
4503 Look thru every buffer's undo list
4504 for elements that update markers that were not marked,
4507 register struct buffer
*nextb
= all_buffers
;
4511 /* If a buffer's undo list is Qt, that means that undo is
4512 turned off in that buffer. Calling truncate_undo_list on
4513 Qt tends to return NULL, which effectively turns undo back on.
4514 So don't call truncate_undo_list if undo_list is Qt. */
4515 if (! EQ (nextb
->undo_list
, Qt
))
4517 Lisp_Object tail
, prev
;
4518 tail
= nextb
->undo_list
;
4520 while (CONSP (tail
))
4522 if (GC_CONSP (XCAR (tail
))
4523 && GC_MARKERP (XCAR (XCAR (tail
)))
4524 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
4527 nextb
->undo_list
= tail
= XCDR (tail
);
4531 XSETCDR (prev
, tail
);
4541 /* Now that we have stripped the elements that need not be in the
4542 undo_list any more, we can finally mark the list. */
4543 mark_object (nextb
->undo_list
);
4545 nextb
= nextb
->next
;
4551 /* Clear the mark bits that we set in certain root slots. */
4553 unmark_byte_stack ();
4554 VECTOR_UNMARK (&buffer_defaults
);
4555 VECTOR_UNMARK (&buffer_local_symbols
);
4557 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
4563 /* clear_marks (); */
4566 consing_since_gc
= 0;
4567 if (gc_cons_threshold
< 10000)
4568 gc_cons_threshold
= 10000;
4570 if (garbage_collection_messages
)
4572 if (message_p
|| minibuf_level
> 0)
4575 message1_nolog ("Garbage collecting...done");
4578 unbind_to (count
, Qnil
);
4580 total
[0] = Fcons (make_number (total_conses
),
4581 make_number (total_free_conses
));
4582 total
[1] = Fcons (make_number (total_symbols
),
4583 make_number (total_free_symbols
));
4584 total
[2] = Fcons (make_number (total_markers
),
4585 make_number (total_free_markers
));
4586 total
[3] = make_number (total_string_size
);
4587 total
[4] = make_number (total_vector_size
);
4588 total
[5] = Fcons (make_number (total_floats
),
4589 make_number (total_free_floats
));
4590 total
[6] = Fcons (make_number (total_intervals
),
4591 make_number (total_free_intervals
));
4592 total
[7] = Fcons (make_number (total_strings
),
4593 make_number (total_free_strings
));
4595 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4597 /* Compute average percentage of zombies. */
4600 for (i
= 0; i
< 7; ++i
)
4601 if (CONSP (total
[i
]))
4602 nlive
+= XFASTINT (XCAR (total
[i
]));
4604 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
4605 max_live
= max (nlive
, max_live
);
4606 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
4607 max_zombies
= max (nzombies
, max_zombies
);
4612 if (!NILP (Vpost_gc_hook
))
4614 int count
= inhibit_garbage_collection ();
4615 safe_run_hooks (Qpost_gc_hook
);
4616 unbind_to (count
, Qnil
);
4619 /* Accumulate statistics. */
4620 EMACS_GET_TIME (t2
);
4621 EMACS_SUB_TIME (t3
, t2
, t1
);
4622 if (FLOATP (Vgc_elapsed
))
4623 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
) +
4625 EMACS_USECS (t3
) * 1.0e-6);
4628 return Flist (sizeof total
/ sizeof *total
, total
);
4632 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
4633 only interesting objects referenced from glyphs are strings. */
4636 mark_glyph_matrix (matrix
)
4637 struct glyph_matrix
*matrix
;
4639 struct glyph_row
*row
= matrix
->rows
;
4640 struct glyph_row
*end
= row
+ matrix
->nrows
;
4642 for (; row
< end
; ++row
)
4646 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
4648 struct glyph
*glyph
= row
->glyphs
[area
];
4649 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
4651 for (; glyph
< end_glyph
; ++glyph
)
4652 if (GC_STRINGP (glyph
->object
)
4653 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
4654 mark_object (glyph
->object
);
4660 /* Mark Lisp faces in the face cache C. */
4664 struct face_cache
*c
;
4669 for (i
= 0; i
< c
->used
; ++i
)
4671 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
4675 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
4676 mark_object (face
->lface
[j
]);
4683 #ifdef HAVE_WINDOW_SYSTEM
4685 /* Mark Lisp objects in image IMG. */
4691 mark_object (img
->spec
);
4693 if (!NILP (img
->data
.lisp_val
))
4694 mark_object (img
->data
.lisp_val
);
4698 /* Mark Lisp objects in image cache of frame F. It's done this way so
4699 that we don't have to include xterm.h here. */
4702 mark_image_cache (f
)
4705 forall_images_in_image_cache (f
, mark_image
);
4708 #endif /* HAVE_X_WINDOWS */
4712 /* Mark reference to a Lisp_Object.
4713 If the object referred to has not been seen yet, recursively mark
4714 all the references contained in it. */
4716 #define LAST_MARKED_SIZE 500
4717 Lisp_Object last_marked
[LAST_MARKED_SIZE
];
4718 int last_marked_index
;
4720 /* For debugging--call abort when we cdr down this many
4721 links of a list, in mark_object. In debugging,
4722 the call to abort will hit a breakpoint.
4723 Normally this is zero and the check never goes off. */
4724 int mark_object_loop_halt
;
4730 register Lisp_Object obj
= arg
;
4731 #ifdef GC_CHECK_MARKED_OBJECTS
4739 if (PURE_POINTER_P (XPNTR (obj
)))
4742 last_marked
[last_marked_index
++] = obj
;
4743 if (last_marked_index
== LAST_MARKED_SIZE
)
4744 last_marked_index
= 0;
4746 /* Perform some sanity checks on the objects marked here. Abort if
4747 we encounter an object we know is bogus. This increases GC time
4748 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
4749 #ifdef GC_CHECK_MARKED_OBJECTS
4751 po
= (void *) XPNTR (obj
);
4753 /* Check that the object pointed to by PO is known to be a Lisp
4754 structure allocated from the heap. */
4755 #define CHECK_ALLOCATED() \
4757 m = mem_find (po); \
4762 /* Check that the object pointed to by PO is live, using predicate
4764 #define CHECK_LIVE(LIVEP) \
4766 if (!LIVEP (m, po)) \
4770 /* Check both of the above conditions. */
4771 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
4773 CHECK_ALLOCATED (); \
4774 CHECK_LIVE (LIVEP); \
4777 #else /* not GC_CHECK_MARKED_OBJECTS */
4779 #define CHECK_ALLOCATED() (void) 0
4780 #define CHECK_LIVE(LIVEP) (void) 0
4781 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
4783 #endif /* not GC_CHECK_MARKED_OBJECTS */
4785 switch (SWITCH_ENUM_CAST (XGCTYPE (obj
)))
4789 register struct Lisp_String
*ptr
= XSTRING (obj
);
4790 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
4791 MARK_INTERVAL_TREE (ptr
->intervals
);
4793 #ifdef GC_CHECK_STRING_BYTES
4794 /* Check that the string size recorded in the string is the
4795 same as the one recorded in the sdata structure. */
4796 CHECK_STRING_BYTES (ptr
);
4797 #endif /* GC_CHECK_STRING_BYTES */
4801 case Lisp_Vectorlike
:
4802 #ifdef GC_CHECK_MARKED_OBJECTS
4804 if (m
== MEM_NIL
&& !GC_SUBRP (obj
)
4805 && po
!= &buffer_defaults
4806 && po
!= &buffer_local_symbols
)
4808 #endif /* GC_CHECK_MARKED_OBJECTS */
4810 if (GC_BUFFERP (obj
))
4812 if (!VECTOR_MARKED_P (XBUFFER (obj
)))
4814 #ifdef GC_CHECK_MARKED_OBJECTS
4815 if (po
!= &buffer_defaults
&& po
!= &buffer_local_symbols
)
4818 for (b
= all_buffers
; b
&& b
!= po
; b
= b
->next
)
4823 #endif /* GC_CHECK_MARKED_OBJECTS */
4827 else if (GC_SUBRP (obj
))
4829 else if (GC_COMPILEDP (obj
))
4830 /* We could treat this just like a vector, but it is better to
4831 save the COMPILED_CONSTANTS element for last and avoid
4834 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
4835 register EMACS_INT size
= ptr
->size
;
4838 if (VECTOR_MARKED_P (ptr
))
4839 break; /* Already marked */
4841 CHECK_LIVE (live_vector_p
);
4842 VECTOR_MARK (ptr
); /* Else mark it */
4843 size
&= PSEUDOVECTOR_SIZE_MASK
;
4844 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
4846 if (i
!= COMPILED_CONSTANTS
)
4847 mark_object (ptr
->contents
[i
]);
4849 obj
= ptr
->contents
[COMPILED_CONSTANTS
];
4852 else if (GC_FRAMEP (obj
))
4854 register struct frame
*ptr
= XFRAME (obj
);
4856 if (VECTOR_MARKED_P (ptr
)) break; /* Already marked */
4857 VECTOR_MARK (ptr
); /* Else mark it */
4859 CHECK_LIVE (live_vector_p
);
4860 mark_object (ptr
->name
);
4861 mark_object (ptr
->icon_name
);
4862 mark_object (ptr
->title
);
4863 mark_object (ptr
->focus_frame
);
4864 mark_object (ptr
->selected_window
);
4865 mark_object (ptr
->minibuffer_window
);
4866 mark_object (ptr
->param_alist
);
4867 mark_object (ptr
->scroll_bars
);
4868 mark_object (ptr
->condemned_scroll_bars
);
4869 mark_object (ptr
->menu_bar_items
);
4870 mark_object (ptr
->face_alist
);
4871 mark_object (ptr
->menu_bar_vector
);
4872 mark_object (ptr
->buffer_predicate
);
4873 mark_object (ptr
->buffer_list
);
4874 mark_object (ptr
->menu_bar_window
);
4875 mark_object (ptr
->tool_bar_window
);
4876 mark_face_cache (ptr
->face_cache
);
4877 #ifdef HAVE_WINDOW_SYSTEM
4878 mark_image_cache (ptr
);
4879 mark_object (ptr
->tool_bar_items
);
4880 mark_object (ptr
->desired_tool_bar_string
);
4881 mark_object (ptr
->current_tool_bar_string
);
4882 #endif /* HAVE_WINDOW_SYSTEM */
4884 else if (GC_BOOL_VECTOR_P (obj
))
4886 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
4888 if (VECTOR_MARKED_P (ptr
))
4889 break; /* Already marked */
4890 CHECK_LIVE (live_vector_p
);
4891 VECTOR_MARK (ptr
); /* Else mark it */
4893 else if (GC_WINDOWP (obj
))
4895 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
4896 struct window
*w
= XWINDOW (obj
);
4899 /* Stop if already marked. */
4900 if (VECTOR_MARKED_P (ptr
))
4904 CHECK_LIVE (live_vector_p
);
4907 /* There is no Lisp data above The member CURRENT_MATRIX in
4908 struct WINDOW. Stop marking when that slot is reached. */
4910 (char *) &ptr
->contents
[i
] < (char *) &w
->current_matrix
;
4912 mark_object (ptr
->contents
[i
]);
4914 /* Mark glyphs for leaf windows. Marking window matrices is
4915 sufficient because frame matrices use the same glyph
4917 if (NILP (w
->hchild
)
4919 && w
->current_matrix
)
4921 mark_glyph_matrix (w
->current_matrix
);
4922 mark_glyph_matrix (w
->desired_matrix
);
4925 else if (GC_HASH_TABLE_P (obj
))
4927 struct Lisp_Hash_Table
*h
= XHASH_TABLE (obj
);
4929 /* Stop if already marked. */
4930 if (VECTOR_MARKED_P (h
))
4934 CHECK_LIVE (live_vector_p
);
4937 /* Mark contents. */
4938 /* Do not mark next_free or next_weak.
4939 Being in the next_weak chain
4940 should not keep the hash table alive.
4941 No need to mark `count' since it is an integer. */
4942 mark_object (h
->test
);
4943 mark_object (h
->weak
);
4944 mark_object (h
->rehash_size
);
4945 mark_object (h
->rehash_threshold
);
4946 mark_object (h
->hash
);
4947 mark_object (h
->next
);
4948 mark_object (h
->index
);
4949 mark_object (h
->user_hash_function
);
4950 mark_object (h
->user_cmp_function
);
4952 /* If hash table is not weak, mark all keys and values.
4953 For weak tables, mark only the vector. */
4954 if (GC_NILP (h
->weak
))
4955 mark_object (h
->key_and_value
);
4957 VECTOR_MARK (XVECTOR (h
->key_and_value
));
4961 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
4962 register EMACS_INT size
= ptr
->size
;
4965 if (VECTOR_MARKED_P (ptr
)) break; /* Already marked */
4966 CHECK_LIVE (live_vector_p
);
4967 VECTOR_MARK (ptr
); /* Else mark it */
4968 if (size
& PSEUDOVECTOR_FLAG
)
4969 size
&= PSEUDOVECTOR_SIZE_MASK
;
4971 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
4972 mark_object (ptr
->contents
[i
]);
4978 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
4979 struct Lisp_Symbol
*ptrx
;
4981 if (ptr
->gcmarkbit
) break;
4982 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
4984 mark_object (ptr
->value
);
4985 mark_object (ptr
->function
);
4986 mark_object (ptr
->plist
);
4988 if (!PURE_POINTER_P (XSTRING (ptr
->xname
)))
4989 MARK_STRING (XSTRING (ptr
->xname
));
4990 MARK_INTERVAL_TREE (STRING_INTERVALS (ptr
->xname
));
4992 /* Note that we do not mark the obarray of the symbol.
4993 It is safe not to do so because nothing accesses that
4994 slot except to check whether it is nil. */
4998 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun */
4999 XSETSYMBOL (obj
, ptrx
);
5006 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
5007 if (XMARKER (obj
)->gcmarkbit
)
5009 XMARKER (obj
)->gcmarkbit
= 1;
5011 switch (XMISCTYPE (obj
))
5013 case Lisp_Misc_Buffer_Local_Value
:
5014 case Lisp_Misc_Some_Buffer_Local_Value
:
5016 register struct Lisp_Buffer_Local_Value
*ptr
5017 = XBUFFER_LOCAL_VALUE (obj
);
5018 /* If the cdr is nil, avoid recursion for the car. */
5019 if (EQ (ptr
->cdr
, Qnil
))
5021 obj
= ptr
->realvalue
;
5024 mark_object (ptr
->realvalue
);
5025 mark_object (ptr
->buffer
);
5026 mark_object (ptr
->frame
);
5031 case Lisp_Misc_Marker
:
5032 /* DO NOT mark thru the marker's chain.
5033 The buffer's markers chain does not preserve markers from gc;
5034 instead, markers are removed from the chain when freed by gc. */
5037 case Lisp_Misc_Intfwd
:
5038 case Lisp_Misc_Boolfwd
:
5039 case Lisp_Misc_Objfwd
:
5040 case Lisp_Misc_Buffer_Objfwd
:
5041 case Lisp_Misc_Kboard_Objfwd
:
5042 /* Don't bother with Lisp_Buffer_Objfwd,
5043 since all markable slots in current buffer marked anyway. */
5044 /* Don't need to do Lisp_Objfwd, since the places they point
5045 are protected with staticpro. */
5048 case Lisp_Misc_Save_Value
:
5051 register struct Lisp_Save_Value
*ptr
= XSAVE_VALUE (obj
);
5052 /* If DOGC is set, POINTER is the address of a memory
5053 area containing INTEGER potential Lisp_Objects. */
5056 Lisp_Object
*p
= (Lisp_Object
*) ptr
->pointer
;
5058 for (nelt
= ptr
->integer
; nelt
> 0; nelt
--, p
++)
5059 mark_maybe_object (*p
);
5065 case Lisp_Misc_Overlay
:
5067 struct Lisp_Overlay
*ptr
= XOVERLAY (obj
);
5068 mark_object (ptr
->start
);
5069 mark_object (ptr
->end
);
5070 mark_object (ptr
->plist
);
5073 XSETMISC (obj
, ptr
->next
);
5086 register struct Lisp_Cons
*ptr
= XCONS (obj
);
5087 if (CONS_MARKED_P (ptr
)) break;
5088 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
5090 /* If the cdr is nil, avoid recursion for the car. */
5091 if (EQ (ptr
->cdr
, Qnil
))
5097 mark_object (ptr
->car
);
5100 if (cdr_count
== mark_object_loop_halt
)
5106 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
5107 FLOAT_MARK (XFLOAT (obj
));
5118 #undef CHECK_ALLOCATED
5119 #undef CHECK_ALLOCATED_AND_LIVE
5122 /* Mark the pointers in a buffer structure. */
5128 register struct buffer
*buffer
= XBUFFER (buf
);
5129 register Lisp_Object
*ptr
, tmp
;
5130 Lisp_Object base_buffer
;
5132 VECTOR_MARK (buffer
);
5134 MARK_INTERVAL_TREE (BUF_INTERVALS (buffer
));
5136 /* For now, we just don't mark the undo_list. It's done later in
5137 a special way just before the sweep phase, and after stripping
5138 some of its elements that are not needed any more. */
5140 if (buffer
->overlays_before
)
5142 XSETMISC (tmp
, buffer
->overlays_before
);
5145 if (buffer
->overlays_after
)
5147 XSETMISC (tmp
, buffer
->overlays_after
);
5151 for (ptr
= &buffer
->name
;
5152 (char *)ptr
< (char *)buffer
+ sizeof (struct buffer
);
5156 /* If this is an indirect buffer, mark its base buffer. */
5157 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
5159 XSETBUFFER (base_buffer
, buffer
->base_buffer
);
5160 mark_buffer (base_buffer
);
5165 /* Value is non-zero if OBJ will survive the current GC because it's
5166 either marked or does not need to be marked to survive. */
5174 switch (XGCTYPE (obj
))
5181 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
5185 survives_p
= XMARKER (obj
)->gcmarkbit
;
5189 survives_p
= STRING_MARKED_P (XSTRING (obj
));
5192 case Lisp_Vectorlike
:
5193 survives_p
= GC_SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
5197 survives_p
= CONS_MARKED_P (XCONS (obj
));
5201 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
5208 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
5213 /* Sweep: find all structures not marked, and free them. */
5218 /* Remove or mark entries in weak hash tables.
5219 This must be done before any object is unmarked. */
5220 sweep_weak_hash_tables ();
5223 #ifdef GC_CHECK_STRING_BYTES
5224 if (!noninteractive
)
5225 check_string_bytes (1);
5228 /* Put all unmarked conses on free list */
5230 register struct cons_block
*cblk
;
5231 struct cons_block
**cprev
= &cons_block
;
5232 register int lim
= cons_block_index
;
5233 register int num_free
= 0, num_used
= 0;
5237 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
5241 for (i
= 0; i
< lim
; i
++)
5242 if (!CONS_MARKED_P (&cblk
->conses
[i
]))
5245 *(struct Lisp_Cons
**)&cblk
->conses
[i
].cdr
= cons_free_list
;
5246 cons_free_list
= &cblk
->conses
[i
];
5248 cons_free_list
->car
= Vdead
;
5254 CONS_UNMARK (&cblk
->conses
[i
]);
5256 lim
= CONS_BLOCK_SIZE
;
5257 /* If this block contains only free conses and we have already
5258 seen more than two blocks worth of free conses then deallocate
5260 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
5262 *cprev
= cblk
->next
;
5263 /* Unhook from the free list. */
5264 cons_free_list
= *(struct Lisp_Cons
**) &cblk
->conses
[0].cdr
;
5265 lisp_align_free (cblk
);
5270 num_free
+= this_free
;
5271 cprev
= &cblk
->next
;
5274 total_conses
= num_used
;
5275 total_free_conses
= num_free
;
5278 /* Put all unmarked floats on free list */
5280 register struct float_block
*fblk
;
5281 struct float_block
**fprev
= &float_block
;
5282 register int lim
= float_block_index
;
5283 register int num_free
= 0, num_used
= 0;
5285 float_free_list
= 0;
5287 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
5291 for (i
= 0; i
< lim
; i
++)
5292 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
5295 *(struct Lisp_Float
**)&fblk
->floats
[i
].data
= float_free_list
;
5296 float_free_list
= &fblk
->floats
[i
];
5301 FLOAT_UNMARK (&fblk
->floats
[i
]);
5303 lim
= FLOAT_BLOCK_SIZE
;
5304 /* If this block contains only free floats and we have already
5305 seen more than two blocks worth of free floats then deallocate
5307 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
5309 *fprev
= fblk
->next
;
5310 /* Unhook from the free list. */
5311 float_free_list
= *(struct Lisp_Float
**) &fblk
->floats
[0].data
;
5312 lisp_align_free (fblk
);
5317 num_free
+= this_free
;
5318 fprev
= &fblk
->next
;
5321 total_floats
= num_used
;
5322 total_free_floats
= num_free
;
5325 /* Put all unmarked intervals on free list */
5327 register struct interval_block
*iblk
;
5328 struct interval_block
**iprev
= &interval_block
;
5329 register int lim
= interval_block_index
;
5330 register int num_free
= 0, num_used
= 0;
5332 interval_free_list
= 0;
5334 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
5339 for (i
= 0; i
< lim
; i
++)
5341 if (!iblk
->intervals
[i
].gcmarkbit
)
5343 SET_INTERVAL_PARENT (&iblk
->intervals
[i
], interval_free_list
);
5344 interval_free_list
= &iblk
->intervals
[i
];
5350 iblk
->intervals
[i
].gcmarkbit
= 0;
5353 lim
= INTERVAL_BLOCK_SIZE
;
5354 /* If this block contains only free intervals and we have already
5355 seen more than two blocks worth of free intervals then
5356 deallocate this block. */
5357 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
5359 *iprev
= iblk
->next
;
5360 /* Unhook from the free list. */
5361 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
5363 n_interval_blocks
--;
5367 num_free
+= this_free
;
5368 iprev
= &iblk
->next
;
5371 total_intervals
= num_used
;
5372 total_free_intervals
= num_free
;
5375 /* Put all unmarked symbols on free list */
5377 register struct symbol_block
*sblk
;
5378 struct symbol_block
**sprev
= &symbol_block
;
5379 register int lim
= symbol_block_index
;
5380 register int num_free
= 0, num_used
= 0;
5382 symbol_free_list
= NULL
;
5384 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
5387 struct Lisp_Symbol
*sym
= sblk
->symbols
;
5388 struct Lisp_Symbol
*end
= sym
+ lim
;
5390 for (; sym
< end
; ++sym
)
5392 /* Check if the symbol was created during loadup. In such a case
5393 it might be pointed to by pure bytecode which we don't trace,
5394 so we conservatively assume that it is live. */
5395 int pure_p
= PURE_POINTER_P (XSTRING (sym
->xname
));
5397 if (!sym
->gcmarkbit
&& !pure_p
)
5399 *(struct Lisp_Symbol
**) &sym
->value
= symbol_free_list
;
5400 symbol_free_list
= sym
;
5402 symbol_free_list
->function
= Vdead
;
5410 UNMARK_STRING (XSTRING (sym
->xname
));
5415 lim
= SYMBOL_BLOCK_SIZE
;
5416 /* If this block contains only free symbols and we have already
5417 seen more than two blocks worth of free symbols then deallocate
5419 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
5421 *sprev
= sblk
->next
;
5422 /* Unhook from the free list. */
5423 symbol_free_list
= *(struct Lisp_Symbol
**)&sblk
->symbols
[0].value
;
5429 num_free
+= this_free
;
5430 sprev
= &sblk
->next
;
5433 total_symbols
= num_used
;
5434 total_free_symbols
= num_free
;
5437 /* Put all unmarked misc's on free list.
5438 For a marker, first unchain it from the buffer it points into. */
5440 register struct marker_block
*mblk
;
5441 struct marker_block
**mprev
= &marker_block
;
5442 register int lim
= marker_block_index
;
5443 register int num_free
= 0, num_used
= 0;
5445 marker_free_list
= 0;
5447 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
5452 for (i
= 0; i
< lim
; i
++)
5454 if (!mblk
->markers
[i
].u_marker
.gcmarkbit
)
5456 if (mblk
->markers
[i
].u_marker
.type
== Lisp_Misc_Marker
)
5457 unchain_marker (&mblk
->markers
[i
].u_marker
);
5458 /* Set the type of the freed object to Lisp_Misc_Free.
5459 We could leave the type alone, since nobody checks it,
5460 but this might catch bugs faster. */
5461 mblk
->markers
[i
].u_marker
.type
= Lisp_Misc_Free
;
5462 mblk
->markers
[i
].u_free
.chain
= marker_free_list
;
5463 marker_free_list
= &mblk
->markers
[i
];
5469 mblk
->markers
[i
].u_marker
.gcmarkbit
= 0;
5472 lim
= MARKER_BLOCK_SIZE
;
5473 /* If this block contains only free markers and we have already
5474 seen more than two blocks worth of free markers then deallocate
5476 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
5478 *mprev
= mblk
->next
;
5479 /* Unhook from the free list. */
5480 marker_free_list
= mblk
->markers
[0].u_free
.chain
;
5486 num_free
+= this_free
;
5487 mprev
= &mblk
->next
;
5491 total_markers
= num_used
;
5492 total_free_markers
= num_free
;
5495 /* Free all unmarked buffers */
5497 register struct buffer
*buffer
= all_buffers
, *prev
= 0, *next
;
5500 if (!VECTOR_MARKED_P (buffer
))
5503 prev
->next
= buffer
->next
;
5505 all_buffers
= buffer
->next
;
5506 next
= buffer
->next
;
5512 VECTOR_UNMARK (buffer
);
5513 UNMARK_BALANCE_INTERVALS (BUF_INTERVALS (buffer
));
5514 prev
= buffer
, buffer
= buffer
->next
;
5518 /* Free all unmarked vectors */
5520 register struct Lisp_Vector
*vector
= all_vectors
, *prev
= 0, *next
;
5521 total_vector_size
= 0;
5524 if (!VECTOR_MARKED_P (vector
))
5527 prev
->next
= vector
->next
;
5529 all_vectors
= vector
->next
;
5530 next
= vector
->next
;
5538 VECTOR_UNMARK (vector
);
5539 if (vector
->size
& PSEUDOVECTOR_FLAG
)
5540 total_vector_size
+= (PSEUDOVECTOR_SIZE_MASK
& vector
->size
);
5542 total_vector_size
+= vector
->size
;
5543 prev
= vector
, vector
= vector
->next
;
5547 #ifdef GC_CHECK_STRING_BYTES
5548 if (!noninteractive
)
5549 check_string_bytes (1);
5556 /* Debugging aids. */
5558 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
5559 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
5560 This may be helpful in debugging Emacs's memory usage.
5561 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
5566 XSETINT (end
, (EMACS_INT
) sbrk (0) / 1024);
5571 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
5572 doc
: /* Return a list of counters that measure how much consing there has been.
5573 Each of these counters increments for a certain kind of object.
5574 The counters wrap around from the largest positive integer to zero.
5575 Garbage collection does not decrease them.
5576 The elements of the value are as follows:
5577 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
5578 All are in units of 1 = one object consed
5579 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
5581 MISCS include overlays, markers, and some internal types.
5582 Frames, windows, buffers, and subprocesses count as vectors
5583 (but the contents of a buffer's text do not count here). */)
5586 Lisp_Object consed
[8];
5588 consed
[0] = make_number (min (MOST_POSITIVE_FIXNUM
, cons_cells_consed
));
5589 consed
[1] = make_number (min (MOST_POSITIVE_FIXNUM
, floats_consed
));
5590 consed
[2] = make_number (min (MOST_POSITIVE_FIXNUM
, vector_cells_consed
));
5591 consed
[3] = make_number (min (MOST_POSITIVE_FIXNUM
, symbols_consed
));
5592 consed
[4] = make_number (min (MOST_POSITIVE_FIXNUM
, string_chars_consed
));
5593 consed
[5] = make_number (min (MOST_POSITIVE_FIXNUM
, misc_objects_consed
));
5594 consed
[6] = make_number (min (MOST_POSITIVE_FIXNUM
, intervals_consed
));
5595 consed
[7] = make_number (min (MOST_POSITIVE_FIXNUM
, strings_consed
));
5597 return Flist (8, consed
);
5600 int suppress_checking
;
5602 die (msg
, file
, line
)
5607 fprintf (stderr
, "\r\nEmacs fatal error: %s:%d: %s\r\n",
5612 /* Initialization */
5617 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
5619 pure_size
= PURESIZE
;
5620 pure_bytes_used
= 0;
5621 pure_bytes_used_before_overflow
= 0;
5623 /* Initialize the list of free aligned blocks. */
5626 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
5628 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
5632 ignore_warnings
= 1;
5633 #ifdef DOUG_LEA_MALLOC
5634 mallopt (M_TRIM_THRESHOLD
, 128*1024); /* trim threshold */
5635 mallopt (M_MMAP_THRESHOLD
, 64*1024); /* mmap threshold */
5636 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* max. number of mmap'ed areas */
5646 malloc_hysteresis
= 32;
5648 malloc_hysteresis
= 0;
5651 spare_memory
= (char *) malloc (SPARE_MEMORY
);
5653 ignore_warnings
= 0;
5655 byte_stack_list
= 0;
5657 consing_since_gc
= 0;
5658 gc_cons_threshold
= 100000 * sizeof (Lisp_Object
);
5659 #ifdef VIRT_ADDR_VARIES
5660 malloc_sbrk_unused
= 1<<22; /* A large number */
5661 malloc_sbrk_used
= 100000; /* as reasonable as any number */
5662 #endif /* VIRT_ADDR_VARIES */
5669 byte_stack_list
= 0;
5671 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
5672 setjmp_tested_p
= longjmps_done
= 0;
5675 Vgc_elapsed
= make_float (0.0);
5682 DEFVAR_INT ("gc-cons-threshold", &gc_cons_threshold
,
5683 doc
: /* *Number of bytes of consing between garbage collections.
5684 Garbage collection can happen automatically once this many bytes have been
5685 allocated since the last garbage collection. All data types count.
5687 Garbage collection happens automatically only when `eval' is called.
5689 By binding this temporarily to a large number, you can effectively
5690 prevent garbage collection during a part of the program. */);
5692 DEFVAR_INT ("pure-bytes-used", &pure_bytes_used
,
5693 doc
: /* Number of bytes of sharable Lisp data allocated so far. */);
5695 DEFVAR_INT ("cons-cells-consed", &cons_cells_consed
,
5696 doc
: /* Number of cons cells that have been consed so far. */);
5698 DEFVAR_INT ("floats-consed", &floats_consed
,
5699 doc
: /* Number of floats that have been consed so far. */);
5701 DEFVAR_INT ("vector-cells-consed", &vector_cells_consed
,
5702 doc
: /* Number of vector cells that have been consed so far. */);
5704 DEFVAR_INT ("symbols-consed", &symbols_consed
,
5705 doc
: /* Number of symbols that have been consed so far. */);
5707 DEFVAR_INT ("string-chars-consed", &string_chars_consed
,
5708 doc
: /* Number of string characters that have been consed so far. */);
5710 DEFVAR_INT ("misc-objects-consed", &misc_objects_consed
,
5711 doc
: /* Number of miscellaneous objects that have been consed so far. */);
5713 DEFVAR_INT ("intervals-consed", &intervals_consed
,
5714 doc
: /* Number of intervals that have been consed so far. */);
5716 DEFVAR_INT ("strings-consed", &strings_consed
,
5717 doc
: /* Number of strings that have been consed so far. */);
5719 DEFVAR_LISP ("purify-flag", &Vpurify_flag
,
5720 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
5721 This means that certain objects should be allocated in shared (pure) space. */);
5723 DEFVAR_INT ("undo-limit", &undo_limit
,
5724 doc
: /* Keep no more undo information once it exceeds this size.
5725 This limit is applied when garbage collection happens.
5726 The size is counted as the number of bytes occupied,
5727 which includes both saved text and other data. */);
5730 DEFVAR_INT ("undo-strong-limit", &undo_strong_limit
,
5731 doc
: /* Don't keep more than this much size of undo information.
5732 A previous command which pushes the undo list past this size
5733 is entirely forgotten when GC happens.
5734 The size is counted as the number of bytes occupied,
5735 which includes both saved text and other data. */);
5736 undo_strong_limit
= 30000;
5738 DEFVAR_INT ("undo-outer-limit", &undo_outer_limit
,
5739 doc
: /* Don't keep more than this much size of undo information.
5740 If the current command has produced more than this much undo information,
5741 GC discards it. This is a last-ditch limit to prevent memory overflow.
5742 The size is counted as the number of bytes occupied,
5743 which includes both saved text and other data. */);
5744 undo_outer_limit
= 300000;
5746 DEFVAR_BOOL ("garbage-collection-messages", &garbage_collection_messages
,
5747 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
5748 garbage_collection_messages
= 0;
5750 DEFVAR_LISP ("post-gc-hook", &Vpost_gc_hook
,
5751 doc
: /* Hook run after garbage collection has finished. */);
5752 Vpost_gc_hook
= Qnil
;
5753 Qpost_gc_hook
= intern ("post-gc-hook");
5754 staticpro (&Qpost_gc_hook
);
5756 DEFVAR_LISP ("memory-signal-data", &Vmemory_signal_data
,
5757 doc
: /* Precomputed `signal' argument for memory-full error. */);
5758 /* We build this in advance because if we wait until we need it, we might
5759 not be able to allocate the memory to hold it. */
5762 build_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"));
5764 DEFVAR_LISP ("memory-full", &Vmemory_full
,
5765 doc
: /* Non-nil means we are handling a memory-full error. */);
5766 Vmemory_full
= Qnil
;
5768 staticpro (&Qgc_cons_threshold
);
5769 Qgc_cons_threshold
= intern ("gc-cons-threshold");
5771 staticpro (&Qchar_table_extra_slots
);
5772 Qchar_table_extra_slots
= intern ("char-table-extra-slots");
5774 DEFVAR_LISP ("gc-elapsed", &Vgc_elapsed
,
5775 doc
: /* Accumulated time elapsed in garbage collections.
5776 The time is in seconds as a floating point value. */);
5777 DEFVAR_INT ("gcs-done", &gcs_done
,
5778 doc
: /* Accumulated number of garbage collections done. */);
5783 defsubr (&Smake_byte_code
);
5784 defsubr (&Smake_list
);
5785 defsubr (&Smake_vector
);
5786 defsubr (&Smake_char_table
);
5787 defsubr (&Smake_string
);
5788 defsubr (&Smake_bool_vector
);
5789 defsubr (&Smake_symbol
);
5790 defsubr (&Smake_marker
);
5791 defsubr (&Spurecopy
);
5792 defsubr (&Sgarbage_collect
);
5793 defsubr (&Smemory_limit
);
5794 defsubr (&Smemory_use_counts
);
5796 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5797 defsubr (&Sgc_status
);
5801 /* arch-tag: 6695ca10-e3c5-4c2c-8bc3-ed26a7dda857
5802 (do not change this comment) */