1 /* Storage allocation and gc for GNU Emacs Lisp interpreter.
2 Copyright (C) 1985,86,88,93,94,95,97,98,1999,2000,01,02,03,2004
3 Free Software Foundation, Inc.
5 This file is part of GNU Emacs.
7 GNU Emacs is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU Emacs is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU Emacs; see the file COPYING. If not, write to
19 the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
24 #include <limits.h> /* For CHAR_BIT. */
30 /* Note that this declares bzero on OSF/1. How dumb. */
34 /* This file is part of the core Lisp implementation, and thus must
35 deal with the real data structures. If the Lisp implementation is
36 replaced, this file likely will not be used. */
38 #undef HIDE_LISP_IMPLEMENTATION
41 #include "intervals.h"
47 #include "blockinput.h"
49 #include "syssignal.h"
52 /* GC_MALLOC_CHECK defined means perform validity checks of malloc'd
53 memory. Can do this only if using gmalloc.c. */
55 #if defined SYSTEM_MALLOC || defined DOUG_LEA_MALLOC
56 #undef GC_MALLOC_CHECK
62 extern POINTER_TYPE
*sbrk ();
65 #ifdef DOUG_LEA_MALLOC
68 /* malloc.h #defines this as size_t, at least in glibc2. */
69 #ifndef __malloc_size_t
70 #define __malloc_size_t int
73 /* Specify maximum number of areas to mmap. It would be nice to use a
74 value that explicitly means "no limit". */
76 #define MMAP_MAX_AREAS 100000000
78 #else /* not DOUG_LEA_MALLOC */
80 /* The following come from gmalloc.c. */
82 #define __malloc_size_t size_t
83 extern __malloc_size_t _bytes_used
;
84 extern __malloc_size_t __malloc_extra_blocks
;
86 #endif /* not DOUG_LEA_MALLOC */
88 /* Value of _bytes_used, when spare_memory was freed. */
90 static __malloc_size_t bytes_used_when_full
;
92 /* Mark, unmark, query mark bit of a Lisp string. S must be a pointer
93 to a struct Lisp_String. */
95 #define MARK_STRING(S) ((S)->size |= ARRAY_MARK_FLAG)
96 #define UNMARK_STRING(S) ((S)->size &= ~ARRAY_MARK_FLAG)
97 #define STRING_MARKED_P(S) ((S)->size & ARRAY_MARK_FLAG)
99 #define VECTOR_MARK(V) ((V)->size |= ARRAY_MARK_FLAG)
100 #define VECTOR_UNMARK(V) ((V)->size &= ~ARRAY_MARK_FLAG)
101 #define VECTOR_MARKED_P(V) ((V)->size & ARRAY_MARK_FLAG)
103 /* Value is the number of bytes/chars of S, a pointer to a struct
104 Lisp_String. This must be used instead of STRING_BYTES (S) or
105 S->size during GC, because S->size contains the mark bit for
108 #define GC_STRING_BYTES(S) (STRING_BYTES (S))
109 #define GC_STRING_CHARS(S) ((S)->size & ~ARRAY_MARK_FLAG)
111 /* Number of bytes of consing done since the last gc. */
113 int consing_since_gc
;
115 /* Count the amount of consing of various sorts of space. */
117 EMACS_INT cons_cells_consed
;
118 EMACS_INT floats_consed
;
119 EMACS_INT vector_cells_consed
;
120 EMACS_INT symbols_consed
;
121 EMACS_INT string_chars_consed
;
122 EMACS_INT misc_objects_consed
;
123 EMACS_INT intervals_consed
;
124 EMACS_INT strings_consed
;
126 /* Number of bytes of consing since GC before another GC should be done. */
128 EMACS_INT gc_cons_threshold
;
130 /* Nonzero during GC. */
134 /* Nonzero means abort if try to GC.
135 This is for code which is written on the assumption that
136 no GC will happen, so as to verify that assumption. */
140 /* Nonzero means display messages at beginning and end of GC. */
142 int garbage_collection_messages
;
144 #ifndef VIRT_ADDR_VARIES
146 #endif /* VIRT_ADDR_VARIES */
147 int malloc_sbrk_used
;
149 #ifndef VIRT_ADDR_VARIES
151 #endif /* VIRT_ADDR_VARIES */
152 int malloc_sbrk_unused
;
154 /* Two limits controlling how much undo information to keep. */
156 EMACS_INT undo_limit
;
157 EMACS_INT undo_strong_limit
;
159 /* Number of live and free conses etc. */
161 static int total_conses
, total_markers
, total_symbols
, total_vector_size
;
162 static int total_free_conses
, total_free_markers
, total_free_symbols
;
163 static int total_free_floats
, total_floats
;
165 /* Points to memory space allocated as "spare", to be freed if we run
168 static char *spare_memory
;
170 /* Amount of spare memory to keep in reserve. */
172 #define SPARE_MEMORY (1 << 14)
174 /* Number of extra blocks malloc should get when it needs more core. */
176 static int malloc_hysteresis
;
178 /* Non-nil means defun should do purecopy on the function definition. */
180 Lisp_Object Vpurify_flag
;
182 /* Non-nil means we are handling a memory-full error. */
184 Lisp_Object Vmemory_full
;
188 /* Force it into data space! Initialize it to a nonzero value;
189 otherwise some compilers put it into BSS. */
191 EMACS_INT pure
[PURESIZE
/ sizeof (EMACS_INT
)] = {1,};
192 #define PUREBEG (char *) pure
196 #define pure PURE_SEG_BITS /* Use shared memory segment */
197 #define PUREBEG (char *)PURE_SEG_BITS
199 #endif /* HAVE_SHM */
201 /* Pointer to the pure area, and its size. */
203 static char *purebeg
;
204 static size_t pure_size
;
206 /* Number of bytes of pure storage used before pure storage overflowed.
207 If this is non-zero, this implies that an overflow occurred. */
209 static size_t pure_bytes_used_before_overflow
;
211 /* Value is non-zero if P points into pure space. */
213 #define PURE_POINTER_P(P) \
214 (((PNTR_COMPARISON_TYPE) (P) \
215 < (PNTR_COMPARISON_TYPE) ((char *) purebeg + pure_size)) \
216 && ((PNTR_COMPARISON_TYPE) (P) \
217 >= (PNTR_COMPARISON_TYPE) purebeg))
219 /* Index in pure at which next pure object will be allocated.. */
221 EMACS_INT pure_bytes_used
;
223 /* If nonzero, this is a warning delivered by malloc and not yet
226 char *pending_malloc_warning
;
228 /* Pre-computed signal argument for use when memory is exhausted. */
230 Lisp_Object Vmemory_signal_data
;
232 /* Maximum amount of C stack to save when a GC happens. */
234 #ifndef MAX_SAVE_STACK
235 #define MAX_SAVE_STACK 16000
238 /* Buffer in which we save a copy of the C stack at each GC. */
243 /* Non-zero means ignore malloc warnings. Set during initialization.
244 Currently not used. */
248 Lisp_Object Qgc_cons_threshold
, Qchar_table_extra_slots
;
250 /* Hook run after GC has finished. */
252 Lisp_Object Vpost_gc_hook
, Qpost_gc_hook
;
254 Lisp_Object Vgc_elapsed
; /* accumulated elapsed time in GC */
255 EMACS_INT gcs_done
; /* accumulated GCs */
257 static void mark_buffer
P_ ((Lisp_Object
));
258 extern void mark_kboards
P_ ((void));
259 extern void mark_backtrace
P_ ((void));
260 static void gc_sweep
P_ ((void));
261 static void mark_glyph_matrix
P_ ((struct glyph_matrix
*));
262 static void mark_face_cache
P_ ((struct face_cache
*));
264 #ifdef HAVE_WINDOW_SYSTEM
265 static void mark_image
P_ ((struct image
*));
266 static void mark_image_cache
P_ ((struct frame
*));
267 #endif /* HAVE_WINDOW_SYSTEM */
269 static struct Lisp_String
*allocate_string
P_ ((void));
270 static void compact_small_strings
P_ ((void));
271 static void free_large_strings
P_ ((void));
272 static void sweep_strings
P_ ((void));
274 extern int message_enable_multibyte
;
276 /* When scanning the C stack for live Lisp objects, Emacs keeps track
277 of what memory allocated via lisp_malloc is intended for what
278 purpose. This enumeration specifies the type of memory. */
289 /* Keep the following vector-like types together, with
290 MEM_TYPE_WINDOW being the last, and MEM_TYPE_VECTOR the
291 first. Or change the code of live_vector_p, for instance. */
299 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
301 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
302 #include <stdio.h> /* For fprintf. */
305 /* A unique object in pure space used to make some Lisp objects
306 on free lists recognizable in O(1). */
310 #ifdef GC_MALLOC_CHECK
312 enum mem_type allocated_mem_type
;
313 int dont_register_blocks
;
315 #endif /* GC_MALLOC_CHECK */
317 /* A node in the red-black tree describing allocated memory containing
318 Lisp data. Each such block is recorded with its start and end
319 address when it is allocated, and removed from the tree when it
322 A red-black tree is a balanced binary tree with the following
325 1. Every node is either red or black.
326 2. Every leaf is black.
327 3. If a node is red, then both of its children are black.
328 4. Every simple path from a node to a descendant leaf contains
329 the same number of black nodes.
330 5. The root is always black.
332 When nodes are inserted into the tree, or deleted from the tree,
333 the tree is "fixed" so that these properties are always true.
335 A red-black tree with N internal nodes has height at most 2
336 log(N+1). Searches, insertions and deletions are done in O(log N).
337 Please see a text book about data structures for a detailed
338 description of red-black trees. Any book worth its salt should
343 /* Children of this node. These pointers are never NULL. When there
344 is no child, the value is MEM_NIL, which points to a dummy node. */
345 struct mem_node
*left
, *right
;
347 /* The parent of this node. In the root node, this is NULL. */
348 struct mem_node
*parent
;
350 /* Start and end of allocated region. */
354 enum {MEM_BLACK
, MEM_RED
} color
;
360 /* Base address of stack. Set in main. */
362 Lisp_Object
*stack_base
;
364 /* Root of the tree describing allocated Lisp memory. */
366 static struct mem_node
*mem_root
;
368 /* Lowest and highest known address in the heap. */
370 static void *min_heap_address
, *max_heap_address
;
372 /* Sentinel node of the tree. */
374 static struct mem_node mem_z
;
375 #define MEM_NIL &mem_z
377 static POINTER_TYPE
*lisp_malloc
P_ ((size_t, enum mem_type
));
378 static struct Lisp_Vector
*allocate_vectorlike
P_ ((EMACS_INT
, enum mem_type
));
379 static void lisp_free
P_ ((POINTER_TYPE
*));
380 static void mark_stack
P_ ((void));
381 static int live_vector_p
P_ ((struct mem_node
*, void *));
382 static int live_buffer_p
P_ ((struct mem_node
*, void *));
383 static int live_string_p
P_ ((struct mem_node
*, void *));
384 static int live_cons_p
P_ ((struct mem_node
*, void *));
385 static int live_symbol_p
P_ ((struct mem_node
*, void *));
386 static int live_float_p
P_ ((struct mem_node
*, void *));
387 static int live_misc_p
P_ ((struct mem_node
*, void *));
388 static void mark_maybe_object
P_ ((Lisp_Object
));
389 static void mark_memory
P_ ((void *, void *));
390 static void mem_init
P_ ((void));
391 static struct mem_node
*mem_insert
P_ ((void *, void *, enum mem_type
));
392 static void mem_insert_fixup
P_ ((struct mem_node
*));
393 static void mem_rotate_left
P_ ((struct mem_node
*));
394 static void mem_rotate_right
P_ ((struct mem_node
*));
395 static void mem_delete
P_ ((struct mem_node
*));
396 static void mem_delete_fixup
P_ ((struct mem_node
*));
397 static INLINE
struct mem_node
*mem_find
P_ ((void *));
399 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
400 static void check_gcpros
P_ ((void));
403 #endif /* GC_MARK_STACK || GC_MALLOC_CHECK */
405 /* Recording what needs to be marked for gc. */
407 struct gcpro
*gcprolist
;
409 /* Addresses of staticpro'd variables. Initialize it to a nonzero
410 value; otherwise some compilers put it into BSS. */
412 #define NSTATICS 1280
413 Lisp_Object
*staticvec
[NSTATICS
] = {&Vpurify_flag
};
415 /* Index of next unused slot in staticvec. */
419 static POINTER_TYPE
*pure_alloc
P_ ((size_t, int));
422 /* Value is SZ rounded up to the next multiple of ALIGNMENT.
423 ALIGNMENT must be a power of 2. */
425 #define ALIGN(ptr, ALIGNMENT) \
426 ((POINTER_TYPE *) ((((EMACS_UINT)(ptr)) + (ALIGNMENT) - 1) \
427 & ~((ALIGNMENT) - 1)))
431 /************************************************************************
433 ************************************************************************/
435 /* Function malloc calls this if it finds we are near exhausting storage. */
441 pending_malloc_warning
= str
;
445 /* Display an already-pending malloc warning. */
448 display_malloc_warning ()
450 call3 (intern ("display-warning"),
452 build_string (pending_malloc_warning
),
453 intern ("emergency"));
454 pending_malloc_warning
= 0;
458 #ifdef DOUG_LEA_MALLOC
459 # define BYTES_USED (mallinfo ().arena)
461 # define BYTES_USED _bytes_used
465 /* Called if malloc returns zero. */
472 #ifndef SYSTEM_MALLOC
473 bytes_used_when_full
= BYTES_USED
;
476 /* The first time we get here, free the spare memory. */
483 /* This used to call error, but if we've run out of memory, we could
484 get infinite recursion trying to build the string. */
486 Fsignal (Qnil
, Vmemory_signal_data
);
490 /* Called if we can't allocate relocatable space for a buffer. */
493 buffer_memory_full ()
495 /* If buffers use the relocating allocator, no need to free
496 spare_memory, because we may have plenty of malloc space left
497 that we could get, and if we don't, the malloc that fails will
498 itself cause spare_memory to be freed. If buffers don't use the
499 relocating allocator, treat this like any other failing
508 /* This used to call error, but if we've run out of memory, we could
509 get infinite recursion trying to build the string. */
511 Fsignal (Qnil
, Vmemory_signal_data
);
515 /* Like malloc but check for no memory and block interrupt input.. */
521 register POINTER_TYPE
*val
;
524 val
= (POINTER_TYPE
*) malloc (size
);
533 /* Like realloc but check for no memory and block interrupt input.. */
536 xrealloc (block
, size
)
540 register POINTER_TYPE
*val
;
543 /* We must call malloc explicitly when BLOCK is 0, since some
544 reallocs don't do this. */
546 val
= (POINTER_TYPE
*) malloc (size
);
548 val
= (POINTER_TYPE
*) realloc (block
, size
);
551 if (!val
&& size
) memory_full ();
556 /* Like free but block interrupt input. */
568 /* Like strdup, but uses xmalloc. */
574 size_t len
= strlen (s
) + 1;
575 char *p
= (char *) xmalloc (len
);
581 /* Like malloc but used for allocating Lisp data. NBYTES is the
582 number of bytes to allocate, TYPE describes the intended use of the
583 allcated memory block (for strings, for conses, ...). */
585 static void *lisp_malloc_loser
;
587 static POINTER_TYPE
*
588 lisp_malloc (nbytes
, type
)
596 #ifdef GC_MALLOC_CHECK
597 allocated_mem_type
= type
;
600 val
= (void *) malloc (nbytes
);
603 /* If the memory just allocated cannot be addressed thru a Lisp
604 object's pointer, and it needs to be,
605 that's equivalent to running out of memory. */
606 if (val
&& type
!= MEM_TYPE_NON_LISP
)
609 XSETCONS (tem
, (char *) val
+ nbytes
- 1);
610 if ((char *) XCONS (tem
) != (char *) val
+ nbytes
- 1)
612 lisp_malloc_loser
= val
;
619 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
620 if (val
&& type
!= MEM_TYPE_NON_LISP
)
621 mem_insert (val
, (char *) val
+ nbytes
, type
);
630 /* Free BLOCK. This must be called to free memory allocated with a
631 call to lisp_malloc. */
639 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
640 mem_delete (mem_find (block
));
645 /* Allocation of aligned blocks of memory to store Lisp data. */
646 /* The entry point is lisp_align_malloc which returns blocks of at most */
647 /* BLOCK_BYTES and guarantees they are aligned on a BLOCK_ALIGN boundary. */
650 /* BLOCK_ALIGN has to be a power of 2. */
651 #define BLOCK_ALIGN (1 << 10)
653 /* Padding to leave at the end of a malloc'd block. This is to give
654 malloc a chance to minimize the amount of memory wasted to alignment.
655 It should be tuned to the particular malloc library used.
656 On glibc-2.3.2, malloc never tries to align, so a padding of 0 is best.
657 posix_memalign on the other hand would ideally prefer a value of 4
658 because otherwise, there's 1020 bytes wasted between each ablocks.
659 But testing shows that those 1020 will most of the time be efficiently
660 used by malloc to place other objects, so a value of 0 is still preferable
661 unless you have a lot of cons&floats and virtually nothing else. */
662 #define BLOCK_PADDING 0
663 #define BLOCK_BYTES \
664 (BLOCK_ALIGN - sizeof (struct aligned_block *) - BLOCK_PADDING)
666 /* Internal data structures and constants. */
668 #define ABLOCKS_SIZE 16
670 /* An aligned block of memory. */
675 char payload
[BLOCK_BYTES
];
676 struct ablock
*next_free
;
678 /* `abase' is the aligned base of the ablocks. */
679 /* It is overloaded to hold the virtual `busy' field that counts
680 the number of used ablock in the parent ablocks.
681 The first ablock has the `busy' field, the others have the `abase'
682 field. To tell the difference, we assume that pointers will have
683 integer values larger than 2 * ABLOCKS_SIZE. The lowest bit of `busy'
684 is used to tell whether the real base of the parent ablocks is `abase'
685 (if not, the word before the first ablock holds a pointer to the
687 struct ablocks
*abase
;
688 /* The padding of all but the last ablock is unused. The padding of
689 the last ablock in an ablocks is not allocated. */
691 char padding
[BLOCK_PADDING
];
695 /* A bunch of consecutive aligned blocks. */
698 struct ablock blocks
[ABLOCKS_SIZE
];
701 /* Size of the block requested from malloc or memalign. */
702 #define ABLOCKS_BYTES (sizeof (struct ablocks) - BLOCK_PADDING)
704 #define ABLOCK_ABASE(block) \
705 (((unsigned long) (block)->abase) <= (1 + 2 * ABLOCKS_SIZE) \
706 ? (struct ablocks *)(block) \
709 /* Virtual `busy' field. */
710 #define ABLOCKS_BUSY(abase) ((abase)->blocks[0].abase)
712 /* Pointer to the (not necessarily aligned) malloc block. */
713 #ifdef HAVE_POSIX_MEMALIGN
714 #define ABLOCKS_BASE(abase) (abase)
716 #define ABLOCKS_BASE(abase) \
717 (1 & (long) ABLOCKS_BUSY (abase) ? abase : ((void**)abase)[-1])
720 /* The list of free ablock. */
721 static struct ablock
*free_ablock
;
723 /* Allocate an aligned block of nbytes.
724 Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be
725 smaller or equal to BLOCK_BYTES. */
726 static POINTER_TYPE
*
727 lisp_align_malloc (nbytes
, type
)
732 struct ablocks
*abase
;
734 eassert (nbytes
<= BLOCK_BYTES
);
738 #ifdef GC_MALLOC_CHECK
739 allocated_mem_type
= type
;
745 EMACS_INT aligned
; /* int gets warning casting to 64-bit pointer. */
747 #ifdef DOUG_LEA_MALLOC
748 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
749 because mapped region contents are not preserved in
751 mallopt (M_MMAP_MAX
, 0);
754 #ifdef HAVE_POSIX_MEMALIGN
756 int err
= posix_memalign (&base
, BLOCK_ALIGN
, ABLOCKS_BYTES
);
757 abase
= err
? (base
= NULL
) : base
;
760 base
= malloc (ABLOCKS_BYTES
);
761 abase
= ALIGN (base
, BLOCK_ALIGN
);
769 aligned
= (base
== abase
);
771 ((void**)abase
)[-1] = base
;
773 #ifdef DOUG_LEA_MALLOC
774 /* Back to a reasonable maximum of mmap'ed areas. */
775 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
779 /* If the memory just allocated cannot be addressed thru a Lisp
780 object's pointer, and it needs to be, that's equivalent to
781 running out of memory. */
782 if (type
!= MEM_TYPE_NON_LISP
)
785 char *end
= (char *) base
+ ABLOCKS_BYTES
- 1;
787 if ((char *) XCONS (tem
) != end
)
789 lisp_malloc_loser
= base
;
797 /* Initialize the blocks and put them on the free list.
798 Is `base' was not properly aligned, we can't use the last block. */
799 for (i
= 0; i
< (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1); i
++)
801 abase
->blocks
[i
].abase
= abase
;
802 abase
->blocks
[i
].x
.next_free
= free_ablock
;
803 free_ablock
= &abase
->blocks
[i
];
805 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (long) aligned
;
807 eassert (0 == ((EMACS_UINT
)abase
) % BLOCK_ALIGN
);
808 eassert (ABLOCK_ABASE (&abase
->blocks
[3]) == abase
); /* 3 is arbitrary */
809 eassert (ABLOCK_ABASE (&abase
->blocks
[0]) == abase
);
810 eassert (ABLOCKS_BASE (abase
) == base
);
811 eassert (aligned
== (long) ABLOCKS_BUSY (abase
));
814 abase
= ABLOCK_ABASE (free_ablock
);
815 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (2 + (long) ABLOCKS_BUSY (abase
));
817 free_ablock
= free_ablock
->x
.next_free
;
819 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
820 if (val
&& type
!= MEM_TYPE_NON_LISP
)
821 mem_insert (val
, (char *) val
+ nbytes
, type
);
828 eassert (0 == ((EMACS_UINT
)val
) % BLOCK_ALIGN
);
833 lisp_align_free (block
)
836 struct ablock
*ablock
= block
;
837 struct ablocks
*abase
= ABLOCK_ABASE (ablock
);
840 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
841 mem_delete (mem_find (block
));
843 /* Put on free list. */
844 ablock
->x
.next_free
= free_ablock
;
845 free_ablock
= ablock
;
846 /* Update busy count. */
847 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (-2 + (long) ABLOCKS_BUSY (abase
));
849 if (2 > (long) ABLOCKS_BUSY (abase
))
850 { /* All the blocks are free. */
851 int i
= 0, aligned
= (long) ABLOCKS_BUSY (abase
);
852 struct ablock
**tem
= &free_ablock
;
853 struct ablock
*atop
= &abase
->blocks
[aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1];
857 if (*tem
>= (struct ablock
*) abase
&& *tem
< atop
)
860 *tem
= (*tem
)->x
.next_free
;
863 tem
= &(*tem
)->x
.next_free
;
865 eassert ((aligned
& 1) == aligned
);
866 eassert (i
== (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1));
867 free (ABLOCKS_BASE (abase
));
872 /* Return a new buffer structure allocated from the heap with
873 a call to lisp_malloc. */
879 = (struct buffer
*) lisp_malloc (sizeof (struct buffer
),
885 /* Arranging to disable input signals while we're in malloc.
887 This only works with GNU malloc. To help out systems which can't
888 use GNU malloc, all the calls to malloc, realloc, and free
889 elsewhere in the code should be inside a BLOCK_INPUT/UNBLOCK_INPUT
890 pairs; unfortunately, we have no idea what C library functions
891 might call malloc, so we can't really protect them unless you're
892 using GNU malloc. Fortunately, most of the major operating systems
893 can use GNU malloc. */
895 #ifndef SYSTEM_MALLOC
896 #ifndef DOUG_LEA_MALLOC
897 extern void * (*__malloc_hook
) P_ ((size_t));
898 extern void * (*__realloc_hook
) P_ ((void *, size_t));
899 extern void (*__free_hook
) P_ ((void *));
900 /* Else declared in malloc.h, perhaps with an extra arg. */
901 #endif /* DOUG_LEA_MALLOC */
902 static void * (*old_malloc_hook
) ();
903 static void * (*old_realloc_hook
) ();
904 static void (*old_free_hook
) ();
906 /* This function is used as the hook for free to call. */
909 emacs_blocked_free (ptr
)
914 #ifdef GC_MALLOC_CHECK
920 if (m
== MEM_NIL
|| m
->start
!= ptr
)
923 "Freeing `%p' which wasn't allocated with malloc\n", ptr
);
928 /* fprintf (stderr, "free %p...%p (%p)\n", m->start, m->end, ptr); */
932 #endif /* GC_MALLOC_CHECK */
934 __free_hook
= old_free_hook
;
937 /* If we released our reserve (due to running out of memory),
938 and we have a fair amount free once again,
939 try to set aside another reserve in case we run out once more. */
940 if (spare_memory
== 0
941 /* Verify there is enough space that even with the malloc
942 hysteresis this call won't run out again.
943 The code here is correct as long as SPARE_MEMORY
944 is substantially larger than the block size malloc uses. */
945 && (bytes_used_when_full
946 > BYTES_USED
+ max (malloc_hysteresis
, 4) * SPARE_MEMORY
))
947 spare_memory
= (char *) malloc ((size_t) SPARE_MEMORY
);
949 __free_hook
= emacs_blocked_free
;
954 /* If we released our reserve (due to running out of memory),
955 and we have a fair amount free once again,
956 try to set aside another reserve in case we run out once more.
958 This is called when a relocatable block is freed in ralloc.c. */
961 refill_memory_reserve ()
963 if (spare_memory
== 0)
964 spare_memory
= (char *) malloc ((size_t) SPARE_MEMORY
);
968 /* This function is the malloc hook that Emacs uses. */
971 emacs_blocked_malloc (size
)
977 __malloc_hook
= old_malloc_hook
;
978 #ifdef DOUG_LEA_MALLOC
979 mallopt (M_TOP_PAD
, malloc_hysteresis
* 4096);
981 __malloc_extra_blocks
= malloc_hysteresis
;
984 value
= (void *) malloc (size
);
986 #ifdef GC_MALLOC_CHECK
988 struct mem_node
*m
= mem_find (value
);
991 fprintf (stderr
, "Malloc returned %p which is already in use\n",
993 fprintf (stderr
, "Region in use is %p...%p, %u bytes, type %d\n",
994 m
->start
, m
->end
, (char *) m
->end
- (char *) m
->start
,
999 if (!dont_register_blocks
)
1001 mem_insert (value
, (char *) value
+ max (1, size
), allocated_mem_type
);
1002 allocated_mem_type
= MEM_TYPE_NON_LISP
;
1005 #endif /* GC_MALLOC_CHECK */
1007 __malloc_hook
= emacs_blocked_malloc
;
1010 /* fprintf (stderr, "%p malloc\n", value); */
1015 /* This function is the realloc hook that Emacs uses. */
1018 emacs_blocked_realloc (ptr
, size
)
1025 __realloc_hook
= old_realloc_hook
;
1027 #ifdef GC_MALLOC_CHECK
1030 struct mem_node
*m
= mem_find (ptr
);
1031 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1034 "Realloc of %p which wasn't allocated with malloc\n",
1042 /* fprintf (stderr, "%p -> realloc\n", ptr); */
1044 /* Prevent malloc from registering blocks. */
1045 dont_register_blocks
= 1;
1046 #endif /* GC_MALLOC_CHECK */
1048 value
= (void *) realloc (ptr
, size
);
1050 #ifdef GC_MALLOC_CHECK
1051 dont_register_blocks
= 0;
1054 struct mem_node
*m
= mem_find (value
);
1057 fprintf (stderr
, "Realloc returns memory that is already in use\n");
1061 /* Can't handle zero size regions in the red-black tree. */
1062 mem_insert (value
, (char *) value
+ max (size
, 1), MEM_TYPE_NON_LISP
);
1065 /* fprintf (stderr, "%p <- realloc\n", value); */
1066 #endif /* GC_MALLOC_CHECK */
1068 __realloc_hook
= emacs_blocked_realloc
;
1075 /* Called from main to set up malloc to use our hooks. */
1078 uninterrupt_malloc ()
1080 if (__free_hook
!= emacs_blocked_free
)
1081 old_free_hook
= __free_hook
;
1082 __free_hook
= emacs_blocked_free
;
1084 if (__malloc_hook
!= emacs_blocked_malloc
)
1085 old_malloc_hook
= __malloc_hook
;
1086 __malloc_hook
= emacs_blocked_malloc
;
1088 if (__realloc_hook
!= emacs_blocked_realloc
)
1089 old_realloc_hook
= __realloc_hook
;
1090 __realloc_hook
= emacs_blocked_realloc
;
1093 #endif /* not SYSTEM_MALLOC */
1097 /***********************************************************************
1099 ***********************************************************************/
1101 /* Number of intervals allocated in an interval_block structure.
1102 The 1020 is 1024 minus malloc overhead. */
1104 #define INTERVAL_BLOCK_SIZE \
1105 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
1107 /* Intervals are allocated in chunks in form of an interval_block
1110 struct interval_block
1112 /* Place `intervals' first, to preserve alignment. */
1113 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
1114 struct interval_block
*next
;
1117 /* Current interval block. Its `next' pointer points to older
1120 struct interval_block
*interval_block
;
1122 /* Index in interval_block above of the next unused interval
1125 static int interval_block_index
;
1127 /* Number of free and live intervals. */
1129 static int total_free_intervals
, total_intervals
;
1131 /* List of free intervals. */
1133 INTERVAL interval_free_list
;
1135 /* Total number of interval blocks now in use. */
1137 int n_interval_blocks
;
1140 /* Initialize interval allocation. */
1145 interval_block
= NULL
;
1146 interval_block_index
= INTERVAL_BLOCK_SIZE
;
1147 interval_free_list
= 0;
1148 n_interval_blocks
= 0;
1152 /* Return a new interval. */
1159 if (interval_free_list
)
1161 val
= interval_free_list
;
1162 interval_free_list
= INTERVAL_PARENT (interval_free_list
);
1166 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
1168 register struct interval_block
*newi
;
1170 newi
= (struct interval_block
*) lisp_malloc (sizeof *newi
,
1173 newi
->next
= interval_block
;
1174 interval_block
= newi
;
1175 interval_block_index
= 0;
1176 n_interval_blocks
++;
1178 val
= &interval_block
->intervals
[interval_block_index
++];
1180 consing_since_gc
+= sizeof (struct interval
);
1182 RESET_INTERVAL (val
);
1188 /* Mark Lisp objects in interval I. */
1191 mark_interval (i
, dummy
)
1192 register INTERVAL i
;
1195 eassert (!i
->gcmarkbit
); /* Intervals are never shared. */
1197 mark_object (i
->plist
);
1201 /* Mark the interval tree rooted in TREE. Don't call this directly;
1202 use the macro MARK_INTERVAL_TREE instead. */
1205 mark_interval_tree (tree
)
1206 register INTERVAL tree
;
1208 /* No need to test if this tree has been marked already; this
1209 function is always called through the MARK_INTERVAL_TREE macro,
1210 which takes care of that. */
1212 traverse_intervals_noorder (tree
, mark_interval
, Qnil
);
1216 /* Mark the interval tree rooted in I. */
1218 #define MARK_INTERVAL_TREE(i) \
1220 if (!NULL_INTERVAL_P (i) && !i->gcmarkbit) \
1221 mark_interval_tree (i); \
1225 #define UNMARK_BALANCE_INTERVALS(i) \
1227 if (! NULL_INTERVAL_P (i)) \
1228 (i) = balance_intervals (i); \
1232 /* Number support. If NO_UNION_TYPE isn't in effect, we
1233 can't create number objects in macros. */
1241 obj
.s
.type
= Lisp_Int
;
1246 /***********************************************************************
1248 ***********************************************************************/
1250 /* Lisp_Strings are allocated in string_block structures. When a new
1251 string_block is allocated, all the Lisp_Strings it contains are
1252 added to a free-list string_free_list. When a new Lisp_String is
1253 needed, it is taken from that list. During the sweep phase of GC,
1254 string_blocks that are entirely free are freed, except two which
1257 String data is allocated from sblock structures. Strings larger
1258 than LARGE_STRING_BYTES, get their own sblock, data for smaller
1259 strings is sub-allocated out of sblocks of size SBLOCK_SIZE.
1261 Sblocks consist internally of sdata structures, one for each
1262 Lisp_String. The sdata structure points to the Lisp_String it
1263 belongs to. The Lisp_String points back to the `u.data' member of
1264 its sdata structure.
1266 When a Lisp_String is freed during GC, it is put back on
1267 string_free_list, and its `data' member and its sdata's `string'
1268 pointer is set to null. The size of the string is recorded in the
1269 `u.nbytes' member of the sdata. So, sdata structures that are no
1270 longer used, can be easily recognized, and it's easy to compact the
1271 sblocks of small strings which we do in compact_small_strings. */
1273 /* Size in bytes of an sblock structure used for small strings. This
1274 is 8192 minus malloc overhead. */
1276 #define SBLOCK_SIZE 8188
1278 /* Strings larger than this are considered large strings. String data
1279 for large strings is allocated from individual sblocks. */
1281 #define LARGE_STRING_BYTES 1024
1283 /* Structure describing string memory sub-allocated from an sblock.
1284 This is where the contents of Lisp strings are stored. */
1288 /* Back-pointer to the string this sdata belongs to. If null, this
1289 structure is free, and the NBYTES member of the union below
1290 contains the string's byte size (the same value that STRING_BYTES
1291 would return if STRING were non-null). If non-null, STRING_BYTES
1292 (STRING) is the size of the data, and DATA contains the string's
1294 struct Lisp_String
*string
;
1296 #ifdef GC_CHECK_STRING_BYTES
1299 unsigned char data
[1];
1301 #define SDATA_NBYTES(S) (S)->nbytes
1302 #define SDATA_DATA(S) (S)->data
1304 #else /* not GC_CHECK_STRING_BYTES */
1308 /* When STRING in non-null. */
1309 unsigned char data
[1];
1311 /* When STRING is null. */
1316 #define SDATA_NBYTES(S) (S)->u.nbytes
1317 #define SDATA_DATA(S) (S)->u.data
1319 #endif /* not GC_CHECK_STRING_BYTES */
1323 /* Structure describing a block of memory which is sub-allocated to
1324 obtain string data memory for strings. Blocks for small strings
1325 are of fixed size SBLOCK_SIZE. Blocks for large strings are made
1326 as large as needed. */
1331 struct sblock
*next
;
1333 /* Pointer to the next free sdata block. This points past the end
1334 of the sblock if there isn't any space left in this block. */
1335 struct sdata
*next_free
;
1337 /* Start of data. */
1338 struct sdata first_data
;
1341 /* Number of Lisp strings in a string_block structure. The 1020 is
1342 1024 minus malloc overhead. */
1344 #define STRING_BLOCK_SIZE \
1345 ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String))
1347 /* Structure describing a block from which Lisp_String structures
1352 /* Place `strings' first, to preserve alignment. */
1353 struct Lisp_String strings
[STRING_BLOCK_SIZE
];
1354 struct string_block
*next
;
1357 /* Head and tail of the list of sblock structures holding Lisp string
1358 data. We always allocate from current_sblock. The NEXT pointers
1359 in the sblock structures go from oldest_sblock to current_sblock. */
1361 static struct sblock
*oldest_sblock
, *current_sblock
;
1363 /* List of sblocks for large strings. */
1365 static struct sblock
*large_sblocks
;
1367 /* List of string_block structures, and how many there are. */
1369 static struct string_block
*string_blocks
;
1370 static int n_string_blocks
;
1372 /* Free-list of Lisp_Strings. */
1374 static struct Lisp_String
*string_free_list
;
1376 /* Number of live and free Lisp_Strings. */
1378 static int total_strings
, total_free_strings
;
1380 /* Number of bytes used by live strings. */
1382 static int total_string_size
;
1384 /* Given a pointer to a Lisp_String S which is on the free-list
1385 string_free_list, return a pointer to its successor in the
1388 #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S))
1390 /* Return a pointer to the sdata structure belonging to Lisp string S.
1391 S must be live, i.e. S->data must not be null. S->data is actually
1392 a pointer to the `u.data' member of its sdata structure; the
1393 structure starts at a constant offset in front of that. */
1395 #ifdef GC_CHECK_STRING_BYTES
1397 #define SDATA_OF_STRING(S) \
1398 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *) \
1399 - sizeof (EMACS_INT)))
1401 #else /* not GC_CHECK_STRING_BYTES */
1403 #define SDATA_OF_STRING(S) \
1404 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *)))
1406 #endif /* not GC_CHECK_STRING_BYTES */
1408 /* Value is the size of an sdata structure large enough to hold NBYTES
1409 bytes of string data. The value returned includes a terminating
1410 NUL byte, the size of the sdata structure, and padding. */
1412 #ifdef GC_CHECK_STRING_BYTES
1414 #define SDATA_SIZE(NBYTES) \
1415 ((sizeof (struct Lisp_String *) \
1417 + sizeof (EMACS_INT) \
1418 + sizeof (EMACS_INT) - 1) \
1419 & ~(sizeof (EMACS_INT) - 1))
1421 #else /* not GC_CHECK_STRING_BYTES */
1423 #define SDATA_SIZE(NBYTES) \
1424 ((sizeof (struct Lisp_String *) \
1426 + sizeof (EMACS_INT) - 1) \
1427 & ~(sizeof (EMACS_INT) - 1))
1429 #endif /* not GC_CHECK_STRING_BYTES */
1431 /* Initialize string allocation. Called from init_alloc_once. */
1436 total_strings
= total_free_strings
= total_string_size
= 0;
1437 oldest_sblock
= current_sblock
= large_sblocks
= NULL
;
1438 string_blocks
= NULL
;
1439 n_string_blocks
= 0;
1440 string_free_list
= NULL
;
1444 #ifdef GC_CHECK_STRING_BYTES
1446 static int check_string_bytes_count
;
1448 void check_string_bytes
P_ ((int));
1449 void check_sblock
P_ ((struct sblock
*));
1451 #define CHECK_STRING_BYTES(S) STRING_BYTES (S)
1454 /* Like GC_STRING_BYTES, but with debugging check. */
1458 struct Lisp_String
*s
;
1460 int nbytes
= (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1461 if (!PURE_POINTER_P (s
)
1463 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1468 /* Check validity of Lisp strings' string_bytes member in B. */
1474 struct sdata
*from
, *end
, *from_end
;
1478 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1480 /* Compute the next FROM here because copying below may
1481 overwrite data we need to compute it. */
1484 /* Check that the string size recorded in the string is the
1485 same as the one recorded in the sdata structure. */
1487 CHECK_STRING_BYTES (from
->string
);
1490 nbytes
= GC_STRING_BYTES (from
->string
);
1492 nbytes
= SDATA_NBYTES (from
);
1494 nbytes
= SDATA_SIZE (nbytes
);
1495 from_end
= (struct sdata
*) ((char *) from
+ nbytes
);
1500 /* Check validity of Lisp strings' string_bytes member. ALL_P
1501 non-zero means check all strings, otherwise check only most
1502 recently allocated strings. Used for hunting a bug. */
1505 check_string_bytes (all_p
)
1512 for (b
= large_sblocks
; b
; b
= b
->next
)
1514 struct Lisp_String
*s
= b
->first_data
.string
;
1516 CHECK_STRING_BYTES (s
);
1519 for (b
= oldest_sblock
; b
; b
= b
->next
)
1523 check_sblock (current_sblock
);
1526 #endif /* GC_CHECK_STRING_BYTES */
1529 /* Return a new Lisp_String. */
1531 static struct Lisp_String
*
1534 struct Lisp_String
*s
;
1536 /* If the free-list is empty, allocate a new string_block, and
1537 add all the Lisp_Strings in it to the free-list. */
1538 if (string_free_list
== NULL
)
1540 struct string_block
*b
;
1543 b
= (struct string_block
*) lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1544 bzero (b
, sizeof *b
);
1545 b
->next
= string_blocks
;
1549 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1552 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1553 string_free_list
= s
;
1556 total_free_strings
+= STRING_BLOCK_SIZE
;
1559 /* Pop a Lisp_String off the free-list. */
1560 s
= string_free_list
;
1561 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1563 /* Probably not strictly necessary, but play it safe. */
1564 bzero (s
, sizeof *s
);
1566 --total_free_strings
;
1569 consing_since_gc
+= sizeof *s
;
1571 #ifdef GC_CHECK_STRING_BYTES
1578 if (++check_string_bytes_count
== 200)
1580 check_string_bytes_count
= 0;
1581 check_string_bytes (1);
1584 check_string_bytes (0);
1586 #endif /* GC_CHECK_STRING_BYTES */
1592 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1593 plus a NUL byte at the end. Allocate an sdata structure for S, and
1594 set S->data to its `u.data' member. Store a NUL byte at the end of
1595 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1596 S->data if it was initially non-null. */
1599 allocate_string_data (s
, nchars
, nbytes
)
1600 struct Lisp_String
*s
;
1603 struct sdata
*data
, *old_data
;
1605 int needed
, old_nbytes
;
1607 /* Determine the number of bytes needed to store NBYTES bytes
1609 needed
= SDATA_SIZE (nbytes
);
1611 if (nbytes
> LARGE_STRING_BYTES
)
1613 size_t size
= sizeof *b
- sizeof (struct sdata
) + needed
;
1615 #ifdef DOUG_LEA_MALLOC
1616 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1617 because mapped region contents are not preserved in
1620 In case you think of allowing it in a dumped Emacs at the
1621 cost of not being able to re-dump, there's another reason:
1622 mmap'ed data typically have an address towards the top of the
1623 address space, which won't fit into an EMACS_INT (at least on
1624 32-bit systems with the current tagging scheme). --fx */
1625 mallopt (M_MMAP_MAX
, 0);
1628 b
= (struct sblock
*) lisp_malloc (size
, MEM_TYPE_NON_LISP
);
1630 #ifdef DOUG_LEA_MALLOC
1631 /* Back to a reasonable maximum of mmap'ed areas. */
1632 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1635 b
->next_free
= &b
->first_data
;
1636 b
->first_data
.string
= NULL
;
1637 b
->next
= large_sblocks
;
1640 else if (current_sblock
== NULL
1641 || (((char *) current_sblock
+ SBLOCK_SIZE
1642 - (char *) current_sblock
->next_free
)
1645 /* Not enough room in the current sblock. */
1646 b
= (struct sblock
*) lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
1647 b
->next_free
= &b
->first_data
;
1648 b
->first_data
.string
= NULL
;
1652 current_sblock
->next
= b
;
1660 old_data
= s
->data
? SDATA_OF_STRING (s
) : NULL
;
1661 old_nbytes
= GC_STRING_BYTES (s
);
1663 data
= b
->next_free
;
1665 s
->data
= SDATA_DATA (data
);
1666 #ifdef GC_CHECK_STRING_BYTES
1667 SDATA_NBYTES (data
) = nbytes
;
1670 s
->size_byte
= nbytes
;
1671 s
->data
[nbytes
] = '\0';
1672 b
->next_free
= (struct sdata
*) ((char *) data
+ needed
);
1674 /* If S had already data assigned, mark that as free by setting its
1675 string back-pointer to null, and recording the size of the data
1679 SDATA_NBYTES (old_data
) = old_nbytes
;
1680 old_data
->string
= NULL
;
1683 consing_since_gc
+= needed
;
1687 /* Sweep and compact strings. */
1692 struct string_block
*b
, *next
;
1693 struct string_block
*live_blocks
= NULL
;
1695 string_free_list
= NULL
;
1696 total_strings
= total_free_strings
= 0;
1697 total_string_size
= 0;
1699 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
1700 for (b
= string_blocks
; b
; b
= next
)
1703 struct Lisp_String
*free_list_before
= string_free_list
;
1707 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
1709 struct Lisp_String
*s
= b
->strings
+ i
;
1713 /* String was not on free-list before. */
1714 if (STRING_MARKED_P (s
))
1716 /* String is live; unmark it and its intervals. */
1719 if (!NULL_INTERVAL_P (s
->intervals
))
1720 UNMARK_BALANCE_INTERVALS (s
->intervals
);
1723 total_string_size
+= STRING_BYTES (s
);
1727 /* String is dead. Put it on the free-list. */
1728 struct sdata
*data
= SDATA_OF_STRING (s
);
1730 /* Save the size of S in its sdata so that we know
1731 how large that is. Reset the sdata's string
1732 back-pointer so that we know it's free. */
1733 #ifdef GC_CHECK_STRING_BYTES
1734 if (GC_STRING_BYTES (s
) != SDATA_NBYTES (data
))
1737 data
->u
.nbytes
= GC_STRING_BYTES (s
);
1739 data
->string
= NULL
;
1741 /* Reset the strings's `data' member so that we
1745 /* Put the string on the free-list. */
1746 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1747 string_free_list
= s
;
1753 /* S was on the free-list before. Put it there again. */
1754 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1755 string_free_list
= s
;
1760 /* Free blocks that contain free Lisp_Strings only, except
1761 the first two of them. */
1762 if (nfree
== STRING_BLOCK_SIZE
1763 && total_free_strings
> STRING_BLOCK_SIZE
)
1767 string_free_list
= free_list_before
;
1771 total_free_strings
+= nfree
;
1772 b
->next
= live_blocks
;
1777 string_blocks
= live_blocks
;
1778 free_large_strings ();
1779 compact_small_strings ();
1783 /* Free dead large strings. */
1786 free_large_strings ()
1788 struct sblock
*b
, *next
;
1789 struct sblock
*live_blocks
= NULL
;
1791 for (b
= large_sblocks
; b
; b
= next
)
1795 if (b
->first_data
.string
== NULL
)
1799 b
->next
= live_blocks
;
1804 large_sblocks
= live_blocks
;
1808 /* Compact data of small strings. Free sblocks that don't contain
1809 data of live strings after compaction. */
1812 compact_small_strings ()
1814 struct sblock
*b
, *tb
, *next
;
1815 struct sdata
*from
, *to
, *end
, *tb_end
;
1816 struct sdata
*to_end
, *from_end
;
1818 /* TB is the sblock we copy to, TO is the sdata within TB we copy
1819 to, and TB_END is the end of TB. */
1821 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
1822 to
= &tb
->first_data
;
1824 /* Step through the blocks from the oldest to the youngest. We
1825 expect that old blocks will stabilize over time, so that less
1826 copying will happen this way. */
1827 for (b
= oldest_sblock
; b
; b
= b
->next
)
1830 xassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
1832 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1834 /* Compute the next FROM here because copying below may
1835 overwrite data we need to compute it. */
1838 #ifdef GC_CHECK_STRING_BYTES
1839 /* Check that the string size recorded in the string is the
1840 same as the one recorded in the sdata structure. */
1842 && GC_STRING_BYTES (from
->string
) != SDATA_NBYTES (from
))
1844 #endif /* GC_CHECK_STRING_BYTES */
1847 nbytes
= GC_STRING_BYTES (from
->string
);
1849 nbytes
= SDATA_NBYTES (from
);
1851 nbytes
= SDATA_SIZE (nbytes
);
1852 from_end
= (struct sdata
*) ((char *) from
+ nbytes
);
1854 /* FROM->string non-null means it's alive. Copy its data. */
1857 /* If TB is full, proceed with the next sblock. */
1858 to_end
= (struct sdata
*) ((char *) to
+ nbytes
);
1859 if (to_end
> tb_end
)
1863 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
1864 to
= &tb
->first_data
;
1865 to_end
= (struct sdata
*) ((char *) to
+ nbytes
);
1868 /* Copy, and update the string's `data' pointer. */
1871 xassert (tb
!= b
|| to
<= from
);
1872 safe_bcopy ((char *) from
, (char *) to
, nbytes
);
1873 to
->string
->data
= SDATA_DATA (to
);
1876 /* Advance past the sdata we copied to. */
1882 /* The rest of the sblocks following TB don't contain live data, so
1883 we can free them. */
1884 for (b
= tb
->next
; b
; b
= next
)
1892 current_sblock
= tb
;
1896 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
1897 doc
: /* Return a newly created string of length LENGTH, with INIT in each element.
1898 LENGTH must be an integer.
1899 INIT must be an integer that represents a character. */)
1901 Lisp_Object length
, init
;
1903 register Lisp_Object val
;
1904 register unsigned char *p
, *end
;
1907 CHECK_NATNUM (length
);
1908 CHECK_NUMBER (init
);
1911 if (SINGLE_BYTE_CHAR_P (c
))
1913 nbytes
= XINT (length
);
1914 val
= make_uninit_string (nbytes
);
1916 end
= p
+ SCHARS (val
);
1922 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
1923 int len
= CHAR_STRING (c
, str
);
1925 nbytes
= len
* XINT (length
);
1926 val
= make_uninit_multibyte_string (XINT (length
), nbytes
);
1931 bcopy (str
, p
, len
);
1941 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
1942 doc
: /* Return a new bool-vector of length LENGTH, using INIT for as each element.
1943 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
1945 Lisp_Object length
, init
;
1947 register Lisp_Object val
;
1948 struct Lisp_Bool_Vector
*p
;
1950 int length_in_chars
, length_in_elts
, bits_per_value
;
1952 CHECK_NATNUM (length
);
1954 bits_per_value
= sizeof (EMACS_INT
) * BOOL_VECTOR_BITS_PER_CHAR
;
1956 length_in_elts
= (XFASTINT (length
) + bits_per_value
- 1) / bits_per_value
;
1957 length_in_chars
= ((XFASTINT (length
) + BOOL_VECTOR_BITS_PER_CHAR
- 1)
1958 / BOOL_VECTOR_BITS_PER_CHAR
);
1960 /* We must allocate one more elements than LENGTH_IN_ELTS for the
1961 slot `size' of the struct Lisp_Bool_Vector. */
1962 val
= Fmake_vector (make_number (length_in_elts
+ 1), Qnil
);
1963 p
= XBOOL_VECTOR (val
);
1965 /* Get rid of any bits that would cause confusion. */
1967 XSETBOOL_VECTOR (val
, p
);
1968 p
->size
= XFASTINT (length
);
1970 real_init
= (NILP (init
) ? 0 : -1);
1971 for (i
= 0; i
< length_in_chars
; i
++)
1972 p
->data
[i
] = real_init
;
1974 /* Clear the extraneous bits in the last byte. */
1975 if (XINT (length
) != length_in_chars
* BOOL_VECTOR_BITS_PER_CHAR
)
1976 XBOOL_VECTOR (val
)->data
[length_in_chars
- 1]
1977 &= (1 << (XINT (length
) % BOOL_VECTOR_BITS_PER_CHAR
)) - 1;
1983 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
1984 of characters from the contents. This string may be unibyte or
1985 multibyte, depending on the contents. */
1988 make_string (contents
, nbytes
)
1989 const char *contents
;
1992 register Lisp_Object val
;
1993 int nchars
, multibyte_nbytes
;
1995 parse_str_as_multibyte (contents
, nbytes
, &nchars
, &multibyte_nbytes
);
1996 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
1997 /* CONTENTS contains no multibyte sequences or contains an invalid
1998 multibyte sequence. We must make unibyte string. */
1999 val
= make_unibyte_string (contents
, nbytes
);
2001 val
= make_multibyte_string (contents
, nchars
, nbytes
);
2006 /* Make an unibyte string from LENGTH bytes at CONTENTS. */
2009 make_unibyte_string (contents
, length
)
2010 const char *contents
;
2013 register Lisp_Object val
;
2014 val
= make_uninit_string (length
);
2015 bcopy (contents
, SDATA (val
), length
);
2016 STRING_SET_UNIBYTE (val
);
2021 /* Make a multibyte string from NCHARS characters occupying NBYTES
2022 bytes at CONTENTS. */
2025 make_multibyte_string (contents
, nchars
, nbytes
)
2026 const char *contents
;
2029 register Lisp_Object val
;
2030 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2031 bcopy (contents
, SDATA (val
), nbytes
);
2036 /* Make a string from NCHARS characters occupying NBYTES bytes at
2037 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2040 make_string_from_bytes (contents
, nchars
, nbytes
)
2041 const char *contents
;
2044 register Lisp_Object val
;
2045 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2046 bcopy (contents
, SDATA (val
), nbytes
);
2047 if (SBYTES (val
) == SCHARS (val
))
2048 STRING_SET_UNIBYTE (val
);
2053 /* Make a string from NCHARS characters occupying NBYTES bytes at
2054 CONTENTS. The argument MULTIBYTE controls whether to label the
2055 string as multibyte. If NCHARS is negative, it counts the number of
2056 characters by itself. */
2059 make_specified_string (contents
, nchars
, nbytes
, multibyte
)
2060 const char *contents
;
2064 register Lisp_Object val
;
2069 nchars
= multibyte_chars_in_text (contents
, nbytes
);
2073 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2074 bcopy (contents
, SDATA (val
), nbytes
);
2076 STRING_SET_UNIBYTE (val
);
2081 /* Make a string from the data at STR, treating it as multibyte if the
2088 return make_string (str
, strlen (str
));
2092 /* Return an unibyte Lisp_String set up to hold LENGTH characters
2093 occupying LENGTH bytes. */
2096 make_uninit_string (length
)
2100 val
= make_uninit_multibyte_string (length
, length
);
2101 STRING_SET_UNIBYTE (val
);
2106 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2107 which occupy NBYTES bytes. */
2110 make_uninit_multibyte_string (nchars
, nbytes
)
2114 struct Lisp_String
*s
;
2119 s
= allocate_string ();
2120 allocate_string_data (s
, nchars
, nbytes
);
2121 XSETSTRING (string
, s
);
2122 string_chars_consed
+= nbytes
;
2128 /***********************************************************************
2130 ***********************************************************************/
2132 /* We store float cells inside of float_blocks, allocating a new
2133 float_block with malloc whenever necessary. Float cells reclaimed
2134 by GC are put on a free list to be reallocated before allocating
2135 any new float cells from the latest float_block. */
2137 #define FLOAT_BLOCK_SIZE \
2138 (((BLOCK_BYTES - sizeof (struct float_block *) \
2139 /* The compiler might add padding at the end. */ \
2140 - (sizeof (struct Lisp_Float) - sizeof (int))) * CHAR_BIT) \
2141 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2143 #define GETMARKBIT(block,n) \
2144 (((block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2145 >> ((n) % (sizeof(int) * CHAR_BIT))) \
2148 #define SETMARKBIT(block,n) \
2149 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2150 |= 1 << ((n) % (sizeof(int) * CHAR_BIT))
2152 #define UNSETMARKBIT(block,n) \
2153 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2154 &= ~(1 << ((n) % (sizeof(int) * CHAR_BIT)))
2156 #define FLOAT_BLOCK(fptr) \
2157 ((struct float_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2159 #define FLOAT_INDEX(fptr) \
2160 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2164 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2165 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2166 int gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2167 struct float_block
*next
;
2170 #define FLOAT_MARKED_P(fptr) \
2171 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2173 #define FLOAT_MARK(fptr) \
2174 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2176 #define FLOAT_UNMARK(fptr) \
2177 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2179 /* Current float_block. */
2181 struct float_block
*float_block
;
2183 /* Index of first unused Lisp_Float in the current float_block. */
2185 int float_block_index
;
2187 /* Total number of float blocks now in use. */
2191 /* Free-list of Lisp_Floats. */
2193 struct Lisp_Float
*float_free_list
;
2196 /* Initialize float allocation. */
2202 float_block_index
= FLOAT_BLOCK_SIZE
; /* Force alloc of new float_block. */
2203 float_free_list
= 0;
2208 /* Explicitly free a float cell by putting it on the free-list. */
2212 struct Lisp_Float
*ptr
;
2214 *(struct Lisp_Float
**)&ptr
->data
= float_free_list
;
2215 float_free_list
= ptr
;
2219 /* Return a new float object with value FLOAT_VALUE. */
2222 make_float (float_value
)
2225 register Lisp_Object val
;
2227 if (float_free_list
)
2229 /* We use the data field for chaining the free list
2230 so that we won't use the same field that has the mark bit. */
2231 XSETFLOAT (val
, float_free_list
);
2232 float_free_list
= *(struct Lisp_Float
**)&float_free_list
->data
;
2236 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2238 register struct float_block
*new;
2240 new = (struct float_block
*) lisp_align_malloc (sizeof *new,
2242 new->next
= float_block
;
2243 bzero ((char *) new->gcmarkbits
, sizeof new->gcmarkbits
);
2245 float_block_index
= 0;
2248 XSETFLOAT (val
, &float_block
->floats
[float_block_index
]);
2249 float_block_index
++;
2252 XFLOAT_DATA (val
) = float_value
;
2253 eassert (!FLOAT_MARKED_P (XFLOAT (val
)));
2254 consing_since_gc
+= sizeof (struct Lisp_Float
);
2261 /***********************************************************************
2263 ***********************************************************************/
2265 /* We store cons cells inside of cons_blocks, allocating a new
2266 cons_block with malloc whenever necessary. Cons cells reclaimed by
2267 GC are put on a free list to be reallocated before allocating
2268 any new cons cells from the latest cons_block. */
2270 #define CONS_BLOCK_SIZE \
2271 (((BLOCK_BYTES - sizeof (struct cons_block *)) * CHAR_BIT) \
2272 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2274 #define CONS_BLOCK(fptr) \
2275 ((struct cons_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2277 #define CONS_INDEX(fptr) \
2278 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2282 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2283 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2284 int gcmarkbits
[1 + CONS_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2285 struct cons_block
*next
;
2288 #define CONS_MARKED_P(fptr) \
2289 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2291 #define CONS_MARK(fptr) \
2292 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2294 #define CONS_UNMARK(fptr) \
2295 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2297 /* Current cons_block. */
2299 struct cons_block
*cons_block
;
2301 /* Index of first unused Lisp_Cons in the current block. */
2303 int cons_block_index
;
2305 /* Free-list of Lisp_Cons structures. */
2307 struct Lisp_Cons
*cons_free_list
;
2309 /* Total number of cons blocks now in use. */
2314 /* Initialize cons allocation. */
2320 cons_block_index
= CONS_BLOCK_SIZE
; /* Force alloc of new cons_block. */
2326 /* Explicitly free a cons cell by putting it on the free-list. */
2330 struct Lisp_Cons
*ptr
;
2332 *(struct Lisp_Cons
**)&ptr
->cdr
= cons_free_list
;
2336 cons_free_list
= ptr
;
2339 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
2340 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2342 Lisp_Object car
, cdr
;
2344 register Lisp_Object val
;
2348 /* We use the cdr for chaining the free list
2349 so that we won't use the same field that has the mark bit. */
2350 XSETCONS (val
, cons_free_list
);
2351 cons_free_list
= *(struct Lisp_Cons
**)&cons_free_list
->cdr
;
2355 if (cons_block_index
== CONS_BLOCK_SIZE
)
2357 register struct cons_block
*new;
2358 new = (struct cons_block
*) lisp_align_malloc (sizeof *new,
2360 bzero ((char *) new->gcmarkbits
, sizeof new->gcmarkbits
);
2361 new->next
= cons_block
;
2363 cons_block_index
= 0;
2366 XSETCONS (val
, &cons_block
->conses
[cons_block_index
]);
2372 eassert (!CONS_MARKED_P (XCONS (val
)));
2373 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2374 cons_cells_consed
++;
2379 /* Make a list of 2, 3, 4 or 5 specified objects. */
2383 Lisp_Object arg1
, arg2
;
2385 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2390 list3 (arg1
, arg2
, arg3
)
2391 Lisp_Object arg1
, arg2
, arg3
;
2393 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2398 list4 (arg1
, arg2
, arg3
, arg4
)
2399 Lisp_Object arg1
, arg2
, arg3
, arg4
;
2401 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2406 list5 (arg1
, arg2
, arg3
, arg4
, arg5
)
2407 Lisp_Object arg1
, arg2
, arg3
, arg4
, arg5
;
2409 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2410 Fcons (arg5
, Qnil
)))));
2414 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
2415 doc
: /* Return a newly created list with specified arguments as elements.
2416 Any number of arguments, even zero arguments, are allowed.
2417 usage: (list &rest OBJECTS) */)
2420 register Lisp_Object
*args
;
2422 register Lisp_Object val
;
2428 val
= Fcons (args
[nargs
], val
);
2434 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2435 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2437 register Lisp_Object length
, init
;
2439 register Lisp_Object val
;
2442 CHECK_NATNUM (length
);
2443 size
= XFASTINT (length
);
2448 val
= Fcons (init
, val
);
2453 val
= Fcons (init
, val
);
2458 val
= Fcons (init
, val
);
2463 val
= Fcons (init
, val
);
2468 val
= Fcons (init
, val
);
2483 /***********************************************************************
2485 ***********************************************************************/
2487 /* Singly-linked list of all vectors. */
2489 struct Lisp_Vector
*all_vectors
;
2491 /* Total number of vector-like objects now in use. */
2496 /* Value is a pointer to a newly allocated Lisp_Vector structure
2497 with room for LEN Lisp_Objects. */
2499 static struct Lisp_Vector
*
2500 allocate_vectorlike (len
, type
)
2504 struct Lisp_Vector
*p
;
2507 #ifdef DOUG_LEA_MALLOC
2508 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
2509 because mapped region contents are not preserved in
2512 mallopt (M_MMAP_MAX
, 0);
2516 nbytes
= sizeof *p
+ (len
- 1) * sizeof p
->contents
[0];
2517 p
= (struct Lisp_Vector
*) lisp_malloc (nbytes
, type
);
2519 #ifdef DOUG_LEA_MALLOC
2520 /* Back to a reasonable maximum of mmap'ed areas. */
2522 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2526 consing_since_gc
+= nbytes
;
2527 vector_cells_consed
+= len
;
2529 p
->next
= all_vectors
;
2536 /* Allocate a vector with NSLOTS slots. */
2538 struct Lisp_Vector
*
2539 allocate_vector (nslots
)
2542 struct Lisp_Vector
*v
= allocate_vectorlike (nslots
, MEM_TYPE_VECTOR
);
2548 /* Allocate other vector-like structures. */
2550 struct Lisp_Hash_Table
*
2551 allocate_hash_table ()
2553 EMACS_INT len
= VECSIZE (struct Lisp_Hash_Table
);
2554 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_HASH_TABLE
);
2558 for (i
= 0; i
< len
; ++i
)
2559 v
->contents
[i
] = Qnil
;
2561 return (struct Lisp_Hash_Table
*) v
;
2568 EMACS_INT len
= VECSIZE (struct window
);
2569 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_WINDOW
);
2572 for (i
= 0; i
< len
; ++i
)
2573 v
->contents
[i
] = Qnil
;
2576 return (struct window
*) v
;
2583 EMACS_INT len
= VECSIZE (struct frame
);
2584 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_FRAME
);
2587 for (i
= 0; i
< len
; ++i
)
2588 v
->contents
[i
] = make_number (0);
2590 return (struct frame
*) v
;
2594 struct Lisp_Process
*
2597 EMACS_INT len
= VECSIZE (struct Lisp_Process
);
2598 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_PROCESS
);
2601 for (i
= 0; i
< len
; ++i
)
2602 v
->contents
[i
] = Qnil
;
2605 return (struct Lisp_Process
*) v
;
2609 struct Lisp_Vector
*
2610 allocate_other_vector (len
)
2613 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_VECTOR
);
2616 for (i
= 0; i
< len
; ++i
)
2617 v
->contents
[i
] = Qnil
;
2624 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
2625 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
2626 See also the function `vector'. */)
2628 register Lisp_Object length
, init
;
2631 register EMACS_INT sizei
;
2633 register struct Lisp_Vector
*p
;
2635 CHECK_NATNUM (length
);
2636 sizei
= XFASTINT (length
);
2638 p
= allocate_vector (sizei
);
2639 for (index
= 0; index
< sizei
; index
++)
2640 p
->contents
[index
] = init
;
2642 XSETVECTOR (vector
, p
);
2647 DEFUN ("make-char-table", Fmake_char_table
, Smake_char_table
, 1, 2, 0,
2648 doc
: /* Return a newly created char-table, with purpose PURPOSE.
2649 Each element is initialized to INIT, which defaults to nil.
2650 PURPOSE should be a symbol which has a `char-table-extra-slots' property.
2651 The property's value should be an integer between 0 and 10. */)
2653 register Lisp_Object purpose
, init
;
2657 CHECK_SYMBOL (purpose
);
2658 n
= Fget (purpose
, Qchar_table_extra_slots
);
2660 if (XINT (n
) < 0 || XINT (n
) > 10)
2661 args_out_of_range (n
, Qnil
);
2662 /* Add 2 to the size for the defalt and parent slots. */
2663 vector
= Fmake_vector (make_number (CHAR_TABLE_STANDARD_SLOTS
+ XINT (n
)),
2665 XCHAR_TABLE (vector
)->top
= Qt
;
2666 XCHAR_TABLE (vector
)->parent
= Qnil
;
2667 XCHAR_TABLE (vector
)->purpose
= purpose
;
2668 XSETCHAR_TABLE (vector
, XCHAR_TABLE (vector
));
2673 /* Return a newly created sub char table with default value DEFALT.
2674 Since a sub char table does not appear as a top level Emacs Lisp
2675 object, we don't need a Lisp interface to make it. */
2678 make_sub_char_table (defalt
)
2682 = Fmake_vector (make_number (SUB_CHAR_TABLE_STANDARD_SLOTS
), Qnil
);
2683 XCHAR_TABLE (vector
)->top
= Qnil
;
2684 XCHAR_TABLE (vector
)->defalt
= defalt
;
2685 XSETCHAR_TABLE (vector
, XCHAR_TABLE (vector
));
2690 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
2691 doc
: /* Return a newly created vector with specified arguments as elements.
2692 Any number of arguments, even zero arguments, are allowed.
2693 usage: (vector &rest OBJECTS) */)
2698 register Lisp_Object len
, val
;
2700 register struct Lisp_Vector
*p
;
2702 XSETFASTINT (len
, nargs
);
2703 val
= Fmake_vector (len
, Qnil
);
2705 for (index
= 0; index
< nargs
; index
++)
2706 p
->contents
[index
] = args
[index
];
2711 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
2712 doc
: /* Create a byte-code object with specified arguments as elements.
2713 The arguments should be the arglist, bytecode-string, constant vector,
2714 stack size, (optional) doc string, and (optional) interactive spec.
2715 The first four arguments are required; at most six have any
2717 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
2722 register Lisp_Object len
, val
;
2724 register struct Lisp_Vector
*p
;
2726 XSETFASTINT (len
, nargs
);
2727 if (!NILP (Vpurify_flag
))
2728 val
= make_pure_vector ((EMACS_INT
) nargs
);
2730 val
= Fmake_vector (len
, Qnil
);
2732 if (STRINGP (args
[1]) && STRING_MULTIBYTE (args
[1]))
2733 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
2734 earlier because they produced a raw 8-bit string for byte-code
2735 and now such a byte-code string is loaded as multibyte while
2736 raw 8-bit characters converted to multibyte form. Thus, now we
2737 must convert them back to the original unibyte form. */
2738 args
[1] = Fstring_as_unibyte (args
[1]);
2741 for (index
= 0; index
< nargs
; index
++)
2743 if (!NILP (Vpurify_flag
))
2744 args
[index
] = Fpurecopy (args
[index
]);
2745 p
->contents
[index
] = args
[index
];
2747 XSETCOMPILED (val
, p
);
2753 /***********************************************************************
2755 ***********************************************************************/
2757 /* Each symbol_block is just under 1020 bytes long, since malloc
2758 really allocates in units of powers of two and uses 4 bytes for its
2761 #define SYMBOL_BLOCK_SIZE \
2762 ((1020 - sizeof (struct symbol_block *)) / sizeof (struct Lisp_Symbol))
2766 /* Place `symbols' first, to preserve alignment. */
2767 struct Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
2768 struct symbol_block
*next
;
2771 /* Current symbol block and index of first unused Lisp_Symbol
2774 struct symbol_block
*symbol_block
;
2775 int symbol_block_index
;
2777 /* List of free symbols. */
2779 struct Lisp_Symbol
*symbol_free_list
;
2781 /* Total number of symbol blocks now in use. */
2783 int n_symbol_blocks
;
2786 /* Initialize symbol allocation. */
2791 symbol_block
= NULL
;
2792 symbol_block_index
= SYMBOL_BLOCK_SIZE
;
2793 symbol_free_list
= 0;
2794 n_symbol_blocks
= 0;
2798 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
2799 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
2800 Its value and function definition are void, and its property list is nil. */)
2804 register Lisp_Object val
;
2805 register struct Lisp_Symbol
*p
;
2807 CHECK_STRING (name
);
2809 if (symbol_free_list
)
2811 XSETSYMBOL (val
, symbol_free_list
);
2812 symbol_free_list
= *(struct Lisp_Symbol
**)&symbol_free_list
->value
;
2816 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
2818 struct symbol_block
*new;
2819 new = (struct symbol_block
*) lisp_malloc (sizeof *new,
2821 new->next
= symbol_block
;
2823 symbol_block_index
= 0;
2826 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
]);
2827 symbol_block_index
++;
2833 p
->value
= Qunbound
;
2834 p
->function
= Qunbound
;
2837 p
->interned
= SYMBOL_UNINTERNED
;
2839 p
->indirect_variable
= 0;
2840 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
2847 /***********************************************************************
2848 Marker (Misc) Allocation
2849 ***********************************************************************/
2851 /* Allocation of markers and other objects that share that structure.
2852 Works like allocation of conses. */
2854 #define MARKER_BLOCK_SIZE \
2855 ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc))
2859 /* Place `markers' first, to preserve alignment. */
2860 union Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
2861 struct marker_block
*next
;
2864 struct marker_block
*marker_block
;
2865 int marker_block_index
;
2867 union Lisp_Misc
*marker_free_list
;
2869 /* Marker blocks which should be freed at end of GC. */
2871 struct marker_block
*marker_blocks_pending_free
;
2873 /* Total number of marker blocks now in use. */
2875 int n_marker_blocks
;
2880 marker_block
= NULL
;
2881 marker_block_index
= MARKER_BLOCK_SIZE
;
2882 marker_free_list
= 0;
2883 marker_blocks_pending_free
= 0;
2884 n_marker_blocks
= 0;
2887 /* Return a newly allocated Lisp_Misc object, with no substructure. */
2894 if (marker_free_list
)
2896 XSETMISC (val
, marker_free_list
);
2897 marker_free_list
= marker_free_list
->u_free
.chain
;
2901 if (marker_block_index
== MARKER_BLOCK_SIZE
)
2903 struct marker_block
*new;
2904 new = (struct marker_block
*) lisp_malloc (sizeof *new,
2906 new->next
= marker_block
;
2908 marker_block_index
= 0;
2911 XSETMISC (val
, &marker_block
->markers
[marker_block_index
]);
2912 marker_block_index
++;
2915 consing_since_gc
+= sizeof (union Lisp_Misc
);
2916 misc_objects_consed
++;
2917 XMARKER (val
)->gcmarkbit
= 0;
2921 /* Return a Lisp_Misc_Save_Value object containing POINTER and
2922 INTEGER. This is used to package C values to call record_unwind_protect.
2923 The unwind function can get the C values back using XSAVE_VALUE. */
2926 make_save_value (pointer
, integer
)
2930 register Lisp_Object val
;
2931 register struct Lisp_Save_Value
*p
;
2933 val
= allocate_misc ();
2934 XMISCTYPE (val
) = Lisp_Misc_Save_Value
;
2935 p
= XSAVE_VALUE (val
);
2936 p
->pointer
= pointer
;
2937 p
->integer
= integer
;
2941 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
2942 doc
: /* Return a newly allocated marker which does not point at any place. */)
2945 register Lisp_Object val
;
2946 register struct Lisp_Marker
*p
;
2948 val
= allocate_misc ();
2949 XMISCTYPE (val
) = Lisp_Misc_Marker
;
2955 p
->insertion_type
= 0;
2959 /* Put MARKER back on the free list after using it temporarily. */
2962 free_marker (marker
)
2965 unchain_marker (XMARKER (marker
));
2967 XMISC (marker
)->u_marker
.type
= Lisp_Misc_Free
;
2968 XMISC (marker
)->u_free
.chain
= marker_free_list
;
2969 marker_free_list
= XMISC (marker
);
2971 total_free_markers
++;
2975 /* Return a newly created vector or string with specified arguments as
2976 elements. If all the arguments are characters that can fit
2977 in a string of events, make a string; otherwise, make a vector.
2979 Any number of arguments, even zero arguments, are allowed. */
2982 make_event_array (nargs
, args
)
2988 for (i
= 0; i
< nargs
; i
++)
2989 /* The things that fit in a string
2990 are characters that are in 0...127,
2991 after discarding the meta bit and all the bits above it. */
2992 if (!INTEGERP (args
[i
])
2993 || (XUINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
2994 return Fvector (nargs
, args
);
2996 /* Since the loop exited, we know that all the things in it are
2997 characters, so we can make a string. */
3001 result
= Fmake_string (make_number (nargs
), make_number (0));
3002 for (i
= 0; i
< nargs
; i
++)
3004 SSET (result
, i
, XINT (args
[i
]));
3005 /* Move the meta bit to the right place for a string char. */
3006 if (XINT (args
[i
]) & CHAR_META
)
3007 SSET (result
, i
, SREF (result
, i
) | 0x80);
3016 /************************************************************************
3018 ************************************************************************/
3020 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
3022 /* Conservative C stack marking requires a method to identify possibly
3023 live Lisp objects given a pointer value. We do this by keeping
3024 track of blocks of Lisp data that are allocated in a red-black tree
3025 (see also the comment of mem_node which is the type of nodes in
3026 that tree). Function lisp_malloc adds information for an allocated
3027 block to the red-black tree with calls to mem_insert, and function
3028 lisp_free removes it with mem_delete. Functions live_string_p etc
3029 call mem_find to lookup information about a given pointer in the
3030 tree, and use that to determine if the pointer points to a Lisp
3033 /* Initialize this part of alloc.c. */
3038 mem_z
.left
= mem_z
.right
= MEM_NIL
;
3039 mem_z
.parent
= NULL
;
3040 mem_z
.color
= MEM_BLACK
;
3041 mem_z
.start
= mem_z
.end
= NULL
;
3046 /* Value is a pointer to the mem_node containing START. Value is
3047 MEM_NIL if there is no node in the tree containing START. */
3049 static INLINE
struct mem_node
*
3055 if (start
< min_heap_address
|| start
> max_heap_address
)
3058 /* Make the search always successful to speed up the loop below. */
3059 mem_z
.start
= start
;
3060 mem_z
.end
= (char *) start
+ 1;
3063 while (start
< p
->start
|| start
>= p
->end
)
3064 p
= start
< p
->start
? p
->left
: p
->right
;
3069 /* Insert a new node into the tree for a block of memory with start
3070 address START, end address END, and type TYPE. Value is a
3071 pointer to the node that was inserted. */
3073 static struct mem_node
*
3074 mem_insert (start
, end
, type
)
3078 struct mem_node
*c
, *parent
, *x
;
3080 if (start
< min_heap_address
)
3081 min_heap_address
= start
;
3082 if (end
> max_heap_address
)
3083 max_heap_address
= end
;
3085 /* See where in the tree a node for START belongs. In this
3086 particular application, it shouldn't happen that a node is already
3087 present. For debugging purposes, let's check that. */
3091 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3093 while (c
!= MEM_NIL
)
3095 if (start
>= c
->start
&& start
< c
->end
)
3098 c
= start
< c
->start
? c
->left
: c
->right
;
3101 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3103 while (c
!= MEM_NIL
)
3106 c
= start
< c
->start
? c
->left
: c
->right
;
3109 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3111 /* Create a new node. */
3112 #ifdef GC_MALLOC_CHECK
3113 x
= (struct mem_node
*) _malloc_internal (sizeof *x
);
3117 x
= (struct mem_node
*) xmalloc (sizeof *x
);
3123 x
->left
= x
->right
= MEM_NIL
;
3126 /* Insert it as child of PARENT or install it as root. */
3129 if (start
< parent
->start
)
3137 /* Re-establish red-black tree properties. */
3138 mem_insert_fixup (x
);
3144 /* Re-establish the red-black properties of the tree, and thereby
3145 balance the tree, after node X has been inserted; X is always red. */
3148 mem_insert_fixup (x
)
3151 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3153 /* X is red and its parent is red. This is a violation of
3154 red-black tree property #3. */
3156 if (x
->parent
== x
->parent
->parent
->left
)
3158 /* We're on the left side of our grandparent, and Y is our
3160 struct mem_node
*y
= x
->parent
->parent
->right
;
3162 if (y
->color
== MEM_RED
)
3164 /* Uncle and parent are red but should be black because
3165 X is red. Change the colors accordingly and proceed
3166 with the grandparent. */
3167 x
->parent
->color
= MEM_BLACK
;
3168 y
->color
= MEM_BLACK
;
3169 x
->parent
->parent
->color
= MEM_RED
;
3170 x
= x
->parent
->parent
;
3174 /* Parent and uncle have different colors; parent is
3175 red, uncle is black. */
3176 if (x
== x
->parent
->right
)
3179 mem_rotate_left (x
);
3182 x
->parent
->color
= MEM_BLACK
;
3183 x
->parent
->parent
->color
= MEM_RED
;
3184 mem_rotate_right (x
->parent
->parent
);
3189 /* This is the symmetrical case of above. */
3190 struct mem_node
*y
= x
->parent
->parent
->left
;
3192 if (y
->color
== MEM_RED
)
3194 x
->parent
->color
= MEM_BLACK
;
3195 y
->color
= MEM_BLACK
;
3196 x
->parent
->parent
->color
= MEM_RED
;
3197 x
= x
->parent
->parent
;
3201 if (x
== x
->parent
->left
)
3204 mem_rotate_right (x
);
3207 x
->parent
->color
= MEM_BLACK
;
3208 x
->parent
->parent
->color
= MEM_RED
;
3209 mem_rotate_left (x
->parent
->parent
);
3214 /* The root may have been changed to red due to the algorithm. Set
3215 it to black so that property #5 is satisfied. */
3216 mem_root
->color
= MEM_BLACK
;
3232 /* Turn y's left sub-tree into x's right sub-tree. */
3235 if (y
->left
!= MEM_NIL
)
3236 y
->left
->parent
= x
;
3238 /* Y's parent was x's parent. */
3240 y
->parent
= x
->parent
;
3242 /* Get the parent to point to y instead of x. */
3245 if (x
== x
->parent
->left
)
3246 x
->parent
->left
= y
;
3248 x
->parent
->right
= y
;
3253 /* Put x on y's left. */
3267 mem_rotate_right (x
)
3270 struct mem_node
*y
= x
->left
;
3273 if (y
->right
!= MEM_NIL
)
3274 y
->right
->parent
= x
;
3277 y
->parent
= x
->parent
;
3280 if (x
== x
->parent
->right
)
3281 x
->parent
->right
= y
;
3283 x
->parent
->left
= y
;
3294 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
3300 struct mem_node
*x
, *y
;
3302 if (!z
|| z
== MEM_NIL
)
3305 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
3310 while (y
->left
!= MEM_NIL
)
3314 if (y
->left
!= MEM_NIL
)
3319 x
->parent
= y
->parent
;
3322 if (y
== y
->parent
->left
)
3323 y
->parent
->left
= x
;
3325 y
->parent
->right
= x
;
3332 z
->start
= y
->start
;
3337 if (y
->color
== MEM_BLACK
)
3338 mem_delete_fixup (x
);
3340 #ifdef GC_MALLOC_CHECK
3348 /* Re-establish the red-black properties of the tree, after a
3352 mem_delete_fixup (x
)
3355 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
3357 if (x
== x
->parent
->left
)
3359 struct mem_node
*w
= x
->parent
->right
;
3361 if (w
->color
== MEM_RED
)
3363 w
->color
= MEM_BLACK
;
3364 x
->parent
->color
= MEM_RED
;
3365 mem_rotate_left (x
->parent
);
3366 w
= x
->parent
->right
;
3369 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
3376 if (w
->right
->color
== MEM_BLACK
)
3378 w
->left
->color
= MEM_BLACK
;
3380 mem_rotate_right (w
);
3381 w
= x
->parent
->right
;
3383 w
->color
= x
->parent
->color
;
3384 x
->parent
->color
= MEM_BLACK
;
3385 w
->right
->color
= MEM_BLACK
;
3386 mem_rotate_left (x
->parent
);
3392 struct mem_node
*w
= x
->parent
->left
;
3394 if (w
->color
== MEM_RED
)
3396 w
->color
= MEM_BLACK
;
3397 x
->parent
->color
= MEM_RED
;
3398 mem_rotate_right (x
->parent
);
3399 w
= x
->parent
->left
;
3402 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
3409 if (w
->left
->color
== MEM_BLACK
)
3411 w
->right
->color
= MEM_BLACK
;
3413 mem_rotate_left (w
);
3414 w
= x
->parent
->left
;
3417 w
->color
= x
->parent
->color
;
3418 x
->parent
->color
= MEM_BLACK
;
3419 w
->left
->color
= MEM_BLACK
;
3420 mem_rotate_right (x
->parent
);
3426 x
->color
= MEM_BLACK
;
3430 /* Value is non-zero if P is a pointer to a live Lisp string on
3431 the heap. M is a pointer to the mem_block for P. */
3434 live_string_p (m
, p
)
3438 if (m
->type
== MEM_TYPE_STRING
)
3440 struct string_block
*b
= (struct string_block
*) m
->start
;
3441 int offset
= (char *) p
- (char *) &b
->strings
[0];
3443 /* P must point to the start of a Lisp_String structure, and it
3444 must not be on the free-list. */
3446 && offset
% sizeof b
->strings
[0] == 0
3447 && offset
< (STRING_BLOCK_SIZE
* sizeof b
->strings
[0])
3448 && ((struct Lisp_String
*) p
)->data
!= NULL
);
3455 /* Value is non-zero if P is a pointer to a live Lisp cons on
3456 the heap. M is a pointer to the mem_block for P. */
3463 if (m
->type
== MEM_TYPE_CONS
)
3465 struct cons_block
*b
= (struct cons_block
*) m
->start
;
3466 int offset
= (char *) p
- (char *) &b
->conses
[0];
3468 /* P must point to the start of a Lisp_Cons, not be
3469 one of the unused cells in the current cons block,
3470 and not be on the free-list. */
3472 && offset
% sizeof b
->conses
[0] == 0
3473 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
3475 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
3476 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
3483 /* Value is non-zero if P is a pointer to a live Lisp symbol on
3484 the heap. M is a pointer to the mem_block for P. */
3487 live_symbol_p (m
, p
)
3491 if (m
->type
== MEM_TYPE_SYMBOL
)
3493 struct symbol_block
*b
= (struct symbol_block
*) m
->start
;
3494 int offset
= (char *) p
- (char *) &b
->symbols
[0];
3496 /* P must point to the start of a Lisp_Symbol, not be
3497 one of the unused cells in the current symbol block,
3498 and not be on the free-list. */
3500 && offset
% sizeof b
->symbols
[0] == 0
3501 && offset
< (SYMBOL_BLOCK_SIZE
* sizeof b
->symbols
[0])
3502 && (b
!= symbol_block
3503 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
3504 && !EQ (((struct Lisp_Symbol
*) p
)->function
, Vdead
));
3511 /* Value is non-zero if P is a pointer to a live Lisp float on
3512 the heap. M is a pointer to the mem_block for P. */
3519 if (m
->type
== MEM_TYPE_FLOAT
)
3521 struct float_block
*b
= (struct float_block
*) m
->start
;
3522 int offset
= (char *) p
- (char *) &b
->floats
[0];
3524 /* P must point to the start of a Lisp_Float and not be
3525 one of the unused cells in the current float block. */
3527 && offset
% sizeof b
->floats
[0] == 0
3528 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
3529 && (b
!= float_block
3530 || offset
/ sizeof b
->floats
[0] < float_block_index
));
3537 /* Value is non-zero if P is a pointer to a live Lisp Misc on
3538 the heap. M is a pointer to the mem_block for P. */
3545 if (m
->type
== MEM_TYPE_MISC
)
3547 struct marker_block
*b
= (struct marker_block
*) m
->start
;
3548 int offset
= (char *) p
- (char *) &b
->markers
[0];
3550 /* P must point to the start of a Lisp_Misc, not be
3551 one of the unused cells in the current misc block,
3552 and not be on the free-list. */
3554 && offset
% sizeof b
->markers
[0] == 0
3555 && offset
< (MARKER_BLOCK_SIZE
* sizeof b
->markers
[0])
3556 && (b
!= marker_block
3557 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
3558 && ((union Lisp_Misc
*) p
)->u_marker
.type
!= Lisp_Misc_Free
);
3565 /* Value is non-zero if P is a pointer to a live vector-like object.
3566 M is a pointer to the mem_block for P. */
3569 live_vector_p (m
, p
)
3573 return (p
== m
->start
3574 && m
->type
>= MEM_TYPE_VECTOR
3575 && m
->type
<= MEM_TYPE_WINDOW
);
3579 /* Value is non-zero if P is a pointer to a live buffer. M is a
3580 pointer to the mem_block for P. */
3583 live_buffer_p (m
, p
)
3587 /* P must point to the start of the block, and the buffer
3588 must not have been killed. */
3589 return (m
->type
== MEM_TYPE_BUFFER
3591 && !NILP (((struct buffer
*) p
)->name
));
3594 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
3598 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3600 /* Array of objects that are kept alive because the C stack contains
3601 a pattern that looks like a reference to them . */
3603 #define MAX_ZOMBIES 10
3604 static Lisp_Object zombies
[MAX_ZOMBIES
];
3606 /* Number of zombie objects. */
3608 static int nzombies
;
3610 /* Number of garbage collections. */
3614 /* Average percentage of zombies per collection. */
3616 static double avg_zombies
;
3618 /* Max. number of live and zombie objects. */
3620 static int max_live
, max_zombies
;
3622 /* Average number of live objects per GC. */
3624 static double avg_live
;
3626 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
3627 doc
: /* Show information about live and zombie objects. */)
3630 Lisp_Object args
[8], zombie_list
= Qnil
;
3632 for (i
= 0; i
< nzombies
; i
++)
3633 zombie_list
= Fcons (zombies
[i
], zombie_list
);
3634 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
3635 args
[1] = make_number (ngcs
);
3636 args
[2] = make_float (avg_live
);
3637 args
[3] = make_float (avg_zombies
);
3638 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
3639 args
[5] = make_number (max_live
);
3640 args
[6] = make_number (max_zombies
);
3641 args
[7] = zombie_list
;
3642 return Fmessage (8, args
);
3645 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
3648 /* Mark OBJ if we can prove it's a Lisp_Object. */
3651 mark_maybe_object (obj
)
3654 void *po
= (void *) XPNTR (obj
);
3655 struct mem_node
*m
= mem_find (po
);
3661 switch (XGCTYPE (obj
))
3664 mark_p
= (live_string_p (m
, po
)
3665 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
3669 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
3673 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
3677 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
3680 case Lisp_Vectorlike
:
3681 /* Note: can't check GC_BUFFERP before we know it's a
3682 buffer because checking that dereferences the pointer
3683 PO which might point anywhere. */
3684 if (live_vector_p (m
, po
))
3685 mark_p
= !GC_SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
3686 else if (live_buffer_p (m
, po
))
3687 mark_p
= GC_BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
3691 mark_p
= (live_misc_p (m
, po
) && !XMARKER (obj
)->gcmarkbit
);
3695 case Lisp_Type_Limit
:
3701 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3702 if (nzombies
< MAX_ZOMBIES
)
3703 zombies
[nzombies
] = obj
;
3712 /* If P points to Lisp data, mark that as live if it isn't already
3716 mark_maybe_pointer (p
)
3721 /* Quickly rule out some values which can't point to Lisp data. We
3722 assume that Lisp data is aligned on even addresses. */
3723 if ((EMACS_INT
) p
& 1)
3729 Lisp_Object obj
= Qnil
;
3733 case MEM_TYPE_NON_LISP
:
3734 /* Nothing to do; not a pointer to Lisp memory. */
3737 case MEM_TYPE_BUFFER
:
3738 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P((struct buffer
*)p
))
3739 XSETVECTOR (obj
, p
);
3743 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
3747 case MEM_TYPE_STRING
:
3748 if (live_string_p (m
, p
)
3749 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
3750 XSETSTRING (obj
, p
);
3754 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
3758 case MEM_TYPE_SYMBOL
:
3759 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
3760 XSETSYMBOL (obj
, p
);
3763 case MEM_TYPE_FLOAT
:
3764 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
3768 case MEM_TYPE_VECTOR
:
3769 case MEM_TYPE_PROCESS
:
3770 case MEM_TYPE_HASH_TABLE
:
3771 case MEM_TYPE_FRAME
:
3772 case MEM_TYPE_WINDOW
:
3773 if (live_vector_p (m
, p
))
3776 XSETVECTOR (tem
, p
);
3777 if (!GC_SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
3792 /* Mark Lisp objects referenced from the address range START..END. */
3795 mark_memory (start
, end
)
3801 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3805 /* Make START the pointer to the start of the memory region,
3806 if it isn't already. */
3814 /* Mark Lisp_Objects. */
3815 for (p
= (Lisp_Object
*) start
; (void *) p
< end
; ++p
)
3816 mark_maybe_object (*p
);
3818 /* Mark Lisp data pointed to. This is necessary because, in some
3819 situations, the C compiler optimizes Lisp objects away, so that
3820 only a pointer to them remains. Example:
3822 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
3825 Lisp_Object obj = build_string ("test");
3826 struct Lisp_String *s = XSTRING (obj);
3827 Fgarbage_collect ();
3828 fprintf (stderr, "test `%s'\n", s->data);
3832 Here, `obj' isn't really used, and the compiler optimizes it
3833 away. The only reference to the life string is through the
3836 for (pp
= (void **) start
; (void *) pp
< end
; ++pp
)
3837 mark_maybe_pointer (*pp
);
3840 /* setjmp will work with GCC unless NON_SAVING_SETJMP is defined in
3841 the GCC system configuration. In gcc 3.2, the only systems for
3842 which this is so are i386-sco5 non-ELF, i386-sysv3 (maybe included
3843 by others?) and ns32k-pc532-min. */
3845 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
3847 static int setjmp_tested_p
, longjmps_done
;
3849 #define SETJMP_WILL_LIKELY_WORK "\
3851 Emacs garbage collector has been changed to use conservative stack\n\
3852 marking. Emacs has determined that the method it uses to do the\n\
3853 marking will likely work on your system, but this isn't sure.\n\
3855 If you are a system-programmer, or can get the help of a local wizard\n\
3856 who is, please take a look at the function mark_stack in alloc.c, and\n\
3857 verify that the methods used are appropriate for your system.\n\
3859 Please mail the result to <emacs-devel@gnu.org>.\n\
3862 #define SETJMP_WILL_NOT_WORK "\
3864 Emacs garbage collector has been changed to use conservative stack\n\
3865 marking. Emacs has determined that the default method it uses to do the\n\
3866 marking will not work on your system. We will need a system-dependent\n\
3867 solution for your system.\n\
3869 Please take a look at the function mark_stack in alloc.c, and\n\
3870 try to find a way to make it work on your system.\n\
3872 Note that you may get false negatives, depending on the compiler.\n\
3873 In particular, you need to use -O with GCC for this test.\n\
3875 Please mail the result to <emacs-devel@gnu.org>.\n\
3879 /* Perform a quick check if it looks like setjmp saves registers in a
3880 jmp_buf. Print a message to stderr saying so. When this test
3881 succeeds, this is _not_ a proof that setjmp is sufficient for
3882 conservative stack marking. Only the sources or a disassembly
3893 /* Arrange for X to be put in a register. */
3899 if (longjmps_done
== 1)
3901 /* Came here after the longjmp at the end of the function.
3903 If x == 1, the longjmp has restored the register to its
3904 value before the setjmp, and we can hope that setjmp
3905 saves all such registers in the jmp_buf, although that
3908 For other values of X, either something really strange is
3909 taking place, or the setjmp just didn't save the register. */
3912 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
3915 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
3922 if (longjmps_done
== 1)
3926 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
3929 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
3931 /* Abort if anything GCPRO'd doesn't survive the GC. */
3939 for (p
= gcprolist
; p
; p
= p
->next
)
3940 for (i
= 0; i
< p
->nvars
; ++i
)
3941 if (!survives_gc_p (p
->var
[i
]))
3942 /* FIXME: It's not necessarily a bug. It might just be that the
3943 GCPRO is unnecessary or should release the object sooner. */
3947 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3954 fprintf (stderr
, "\nZombies kept alive = %d:\n", nzombies
);
3955 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
3957 fprintf (stderr
, " %d = ", i
);
3958 debug_print (zombies
[i
]);
3962 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
3965 /* Mark live Lisp objects on the C stack.
3967 There are several system-dependent problems to consider when
3968 porting this to new architectures:
3972 We have to mark Lisp objects in CPU registers that can hold local
3973 variables or are used to pass parameters.
3975 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
3976 something that either saves relevant registers on the stack, or
3977 calls mark_maybe_object passing it each register's contents.
3979 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
3980 implementation assumes that calling setjmp saves registers we need
3981 to see in a jmp_buf which itself lies on the stack. This doesn't
3982 have to be true! It must be verified for each system, possibly
3983 by taking a look at the source code of setjmp.
3987 Architectures differ in the way their processor stack is organized.
3988 For example, the stack might look like this
3991 | Lisp_Object | size = 4
3993 | something else | size = 2
3995 | Lisp_Object | size = 4
3999 In such a case, not every Lisp_Object will be aligned equally. To
4000 find all Lisp_Object on the stack it won't be sufficient to walk
4001 the stack in steps of 4 bytes. Instead, two passes will be
4002 necessary, one starting at the start of the stack, and a second
4003 pass starting at the start of the stack + 2. Likewise, if the
4004 minimal alignment of Lisp_Objects on the stack is 1, four passes
4005 would be necessary, each one starting with one byte more offset
4006 from the stack start.
4008 The current code assumes by default that Lisp_Objects are aligned
4009 equally on the stack. */
4016 volatile int stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
4019 /* This trick flushes the register windows so that all the state of
4020 the process is contained in the stack. */
4021 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
4022 needed on ia64 too. See mach_dep.c, where it also says inline
4023 assembler doesn't work with relevant proprietary compilers. */
4028 /* Save registers that we need to see on the stack. We need to see
4029 registers used to hold register variables and registers used to
4031 #ifdef GC_SAVE_REGISTERS_ON_STACK
4032 GC_SAVE_REGISTERS_ON_STACK (end
);
4033 #else /* not GC_SAVE_REGISTERS_ON_STACK */
4035 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
4036 setjmp will definitely work, test it
4037 and print a message with the result
4039 if (!setjmp_tested_p
)
4041 setjmp_tested_p
= 1;
4044 #endif /* GC_SETJMP_WORKS */
4047 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
4048 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
4050 /* This assumes that the stack is a contiguous region in memory. If
4051 that's not the case, something has to be done here to iterate
4052 over the stack segments. */
4053 #ifndef GC_LISP_OBJECT_ALIGNMENT
4055 #define GC_LISP_OBJECT_ALIGNMENT __alignof__ (Lisp_Object)
4057 #define GC_LISP_OBJECT_ALIGNMENT sizeof (Lisp_Object)
4060 for (i
= 0; i
< sizeof (Lisp_Object
); i
+= GC_LISP_OBJECT_ALIGNMENT
)
4061 mark_memory ((char *) stack_base
+ i
, end
);
4063 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4069 #endif /* GC_MARK_STACK != 0 */
4073 /***********************************************************************
4074 Pure Storage Management
4075 ***********************************************************************/
4077 /* Allocate room for SIZE bytes from pure Lisp storage and return a
4078 pointer to it. TYPE is the Lisp type for which the memory is
4079 allocated. TYPE < 0 means it's not used for a Lisp object.
4081 If store_pure_type_info is set and TYPE is >= 0, the type of
4082 the allocated object is recorded in pure_types. */
4084 static POINTER_TYPE
*
4085 pure_alloc (size
, type
)
4089 POINTER_TYPE
*result
;
4091 size_t alignment
= (1 << GCTYPEBITS
);
4093 size_t alignment
= sizeof (EMACS_INT
);
4095 /* Give Lisp_Floats an extra alignment. */
4096 if (type
== Lisp_Float
)
4098 #if defined __GNUC__ && __GNUC__ >= 2
4099 alignment
= __alignof (struct Lisp_Float
);
4101 alignment
= sizeof (struct Lisp_Float
);
4107 result
= ALIGN (purebeg
+ pure_bytes_used
, alignment
);
4108 pure_bytes_used
= ((char *)result
- (char *)purebeg
) + size
;
4110 if (pure_bytes_used
<= pure_size
)
4113 /* Don't allocate a large amount here,
4114 because it might get mmap'd and then its address
4115 might not be usable. */
4116 purebeg
= (char *) xmalloc (10000);
4118 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
4119 pure_bytes_used
= 0;
4124 /* Print a warning if PURESIZE is too small. */
4129 if (pure_bytes_used_before_overflow
)
4130 message ("Pure Lisp storage overflow (approx. %d bytes needed)",
4131 (int) (pure_bytes_used
+ pure_bytes_used_before_overflow
));
4135 /* Return a string allocated in pure space. DATA is a buffer holding
4136 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
4137 non-zero means make the result string multibyte.
4139 Must get an error if pure storage is full, since if it cannot hold
4140 a large string it may be able to hold conses that point to that
4141 string; then the string is not protected from gc. */
4144 make_pure_string (data
, nchars
, nbytes
, multibyte
)
4150 struct Lisp_String
*s
;
4152 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4153 s
->data
= (unsigned char *) pure_alloc (nbytes
+ 1, -1);
4155 s
->size_byte
= multibyte
? nbytes
: -1;
4156 bcopy (data
, s
->data
, nbytes
);
4157 s
->data
[nbytes
] = '\0';
4158 s
->intervals
= NULL_INTERVAL
;
4159 XSETSTRING (string
, s
);
4164 /* Return a cons allocated from pure space. Give it pure copies
4165 of CAR as car and CDR as cdr. */
4168 pure_cons (car
, cdr
)
4169 Lisp_Object car
, cdr
;
4171 register Lisp_Object
new;
4172 struct Lisp_Cons
*p
;
4174 p
= (struct Lisp_Cons
*) pure_alloc (sizeof *p
, Lisp_Cons
);
4176 XSETCAR (new, Fpurecopy (car
));
4177 XSETCDR (new, Fpurecopy (cdr
));
4182 /* Value is a float object with value NUM allocated from pure space. */
4185 make_pure_float (num
)
4188 register Lisp_Object
new;
4189 struct Lisp_Float
*p
;
4191 p
= (struct Lisp_Float
*) pure_alloc (sizeof *p
, Lisp_Float
);
4193 XFLOAT_DATA (new) = num
;
4198 /* Return a vector with room for LEN Lisp_Objects allocated from
4202 make_pure_vector (len
)
4206 struct Lisp_Vector
*p
;
4207 size_t size
= sizeof *p
+ (len
- 1) * sizeof (Lisp_Object
);
4209 p
= (struct Lisp_Vector
*) pure_alloc (size
, Lisp_Vectorlike
);
4210 XSETVECTOR (new, p
);
4211 XVECTOR (new)->size
= len
;
4216 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
4217 doc
: /* Make a copy of OBJECT in pure storage.
4218 Recursively copies contents of vectors and cons cells.
4219 Does not copy symbols. Copies strings without text properties. */)
4221 register Lisp_Object obj
;
4223 if (NILP (Vpurify_flag
))
4226 if (PURE_POINTER_P (XPNTR (obj
)))
4230 return pure_cons (XCAR (obj
), XCDR (obj
));
4231 else if (FLOATP (obj
))
4232 return make_pure_float (XFLOAT_DATA (obj
));
4233 else if (STRINGP (obj
))
4234 return make_pure_string (SDATA (obj
), SCHARS (obj
),
4236 STRING_MULTIBYTE (obj
));
4237 else if (COMPILEDP (obj
) || VECTORP (obj
))
4239 register struct Lisp_Vector
*vec
;
4243 size
= XVECTOR (obj
)->size
;
4244 if (size
& PSEUDOVECTOR_FLAG
)
4245 size
&= PSEUDOVECTOR_SIZE_MASK
;
4246 vec
= XVECTOR (make_pure_vector (size
));
4247 for (i
= 0; i
< size
; i
++)
4248 vec
->contents
[i
] = Fpurecopy (XVECTOR (obj
)->contents
[i
]);
4249 if (COMPILEDP (obj
))
4250 XSETCOMPILED (obj
, vec
);
4252 XSETVECTOR (obj
, vec
);
4255 else if (MARKERP (obj
))
4256 error ("Attempt to copy a marker to pure storage");
4263 /***********************************************************************
4265 ***********************************************************************/
4267 /* Put an entry in staticvec, pointing at the variable with address
4271 staticpro (varaddress
)
4272 Lisp_Object
*varaddress
;
4274 staticvec
[staticidx
++] = varaddress
;
4275 if (staticidx
>= NSTATICS
)
4283 struct catchtag
*next
;
4287 /***********************************************************************
4289 ***********************************************************************/
4291 /* Temporarily prevent garbage collection. */
4294 inhibit_garbage_collection ()
4296 int count
= SPECPDL_INDEX ();
4297 int nbits
= min (VALBITS
, BITS_PER_INT
);
4299 specbind (Qgc_cons_threshold
, make_number (((EMACS_INT
) 1 << (nbits
- 1)) - 1));
4304 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
4305 doc
: /* Reclaim storage for Lisp objects no longer needed.
4306 Garbage collection happens automatically if you cons more than
4307 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
4308 `garbage-collect' normally returns a list with info on amount of space in use:
4309 ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)
4310 (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS
4311 (USED-FLOATS . FREE-FLOATS) (USED-INTERVALS . FREE-INTERVALS)
4312 (USED-STRINGS . FREE-STRINGS))
4313 However, if there was overflow in pure space, `garbage-collect'
4314 returns nil, because real GC can't be done. */)
4317 register struct specbinding
*bind
;
4318 struct catchtag
*catch;
4319 struct handler
*handler
;
4320 char stack_top_variable
;
4323 Lisp_Object total
[8];
4324 int count
= SPECPDL_INDEX ();
4325 EMACS_TIME t1
, t2
, t3
;
4330 EMACS_GET_TIME (t1
);
4332 /* Can't GC if pure storage overflowed because we can't determine
4333 if something is a pure object or not. */
4334 if (pure_bytes_used_before_overflow
)
4337 /* In case user calls debug_print during GC,
4338 don't let that cause a recursive GC. */
4339 consing_since_gc
= 0;
4341 /* Save what's currently displayed in the echo area. */
4342 message_p
= push_message ();
4343 record_unwind_protect (pop_message_unwind
, Qnil
);
4345 /* Save a copy of the contents of the stack, for debugging. */
4346 #if MAX_SAVE_STACK > 0
4347 if (NILP (Vpurify_flag
))
4349 i
= &stack_top_variable
- stack_bottom
;
4351 if (i
< MAX_SAVE_STACK
)
4353 if (stack_copy
== 0)
4354 stack_copy
= (char *) xmalloc (stack_copy_size
= i
);
4355 else if (stack_copy_size
< i
)
4356 stack_copy
= (char *) xrealloc (stack_copy
, (stack_copy_size
= i
));
4359 if ((EMACS_INT
) (&stack_top_variable
- stack_bottom
) > 0)
4360 bcopy (stack_bottom
, stack_copy
, i
);
4362 bcopy (&stack_top_variable
, stack_copy
, i
);
4366 #endif /* MAX_SAVE_STACK > 0 */
4368 if (garbage_collection_messages
)
4369 message1_nolog ("Garbage collecting...");
4373 shrink_regexp_cache ();
4375 /* Don't keep undo information around forever. */
4377 register struct buffer
*nextb
= all_buffers
;
4381 /* If a buffer's undo list is Qt, that means that undo is
4382 turned off in that buffer. Calling truncate_undo_list on
4383 Qt tends to return NULL, which effectively turns undo back on.
4384 So don't call truncate_undo_list if undo_list is Qt. */
4385 if (! EQ (nextb
->undo_list
, Qt
))
4387 = truncate_undo_list (nextb
->undo_list
, undo_limit
,
4390 /* Shrink buffer gaps, but skip indirect and dead buffers. */
4391 if (nextb
->base_buffer
== 0 && !NILP (nextb
->name
))
4393 /* If a buffer's gap size is more than 10% of the buffer
4394 size, or larger than 2000 bytes, then shrink it
4395 accordingly. Keep a minimum size of 20 bytes. */
4396 int size
= min (2000, max (20, (nextb
->text
->z_byte
/ 10)));
4398 if (nextb
->text
->gap_size
> size
)
4400 struct buffer
*save_current
= current_buffer
;
4401 current_buffer
= nextb
;
4402 make_gap (-(nextb
->text
->gap_size
- size
));
4403 current_buffer
= save_current
;
4407 nextb
= nextb
->next
;
4413 /* clear_marks (); */
4415 /* Mark all the special slots that serve as the roots of accessibility. */
4417 for (i
= 0; i
< staticidx
; i
++)
4418 mark_object (*staticvec
[i
]);
4420 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
4421 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
4425 register struct gcpro
*tail
;
4426 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
4427 for (i
= 0; i
< tail
->nvars
; i
++)
4428 mark_object (tail
->var
[i
]);
4433 for (bind
= specpdl
; bind
!= specpdl_ptr
; bind
++)
4435 mark_object (bind
->symbol
);
4436 mark_object (bind
->old_value
);
4438 for (catch = catchlist
; catch; catch = catch->next
)
4440 mark_object (catch->tag
);
4441 mark_object (catch->val
);
4443 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
4445 mark_object (handler
->handler
);
4446 mark_object (handler
->var
);
4451 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4457 extern void xg_mark_data ();
4464 /* Look thru every buffer's undo list for elements that used to
4465 contain update markers that were changed to Lisp_Misc_Free
4466 objects and delete them. This may leave a few cons cells
4467 unchained, but we will get those on the next sweep. */
4469 register struct buffer
*nextb
= all_buffers
;
4473 /* If a buffer's undo list is Qt, that means that undo is
4474 turned off in that buffer. */
4475 if (! EQ (nextb
->undo_list
, Qt
))
4477 Lisp_Object tail
, prev
, elt
, car
;
4478 tail
= nextb
->undo_list
;
4480 while (CONSP (tail
))
4482 if ((elt
= XCAR (tail
), GC_CONSP (elt
))
4483 && (car
= XCAR (elt
), GC_MISCP (car
))
4484 && XMISCTYPE (car
) == Lisp_Misc_Free
)
4486 Lisp_Object cdr
= XCDR (tail
);
4487 /* Do not use free_cons here, as we don't know if
4488 anybody else has a pointer to these conses. */
4489 XSETCAR (elt
, Qnil
);
4490 XSETCDR (elt
, Qnil
);
4491 XSETCAR (tail
, Qnil
);
4492 XSETCDR (tail
, Qnil
);
4494 nextb
->undo_list
= tail
= cdr
;
4498 XSETCDR (prev
, tail
);
4509 nextb
= nextb
->next
;
4513 /* Undo lists have been cleaned up, so we can free marker blocks now. */
4516 struct marker_block
*mblk
;
4518 while ((mblk
= marker_blocks_pending_free
) != 0)
4520 marker_blocks_pending_free
= mblk
->next
;
4525 /* Clear the mark bits that we set in certain root slots. */
4527 unmark_byte_stack ();
4528 VECTOR_UNMARK (&buffer_defaults
);
4529 VECTOR_UNMARK (&buffer_local_symbols
);
4531 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
4537 /* clear_marks (); */
4540 consing_since_gc
= 0;
4541 if (gc_cons_threshold
< 10000)
4542 gc_cons_threshold
= 10000;
4544 if (garbage_collection_messages
)
4546 if (message_p
|| minibuf_level
> 0)
4549 message1_nolog ("Garbage collecting...done");
4552 unbind_to (count
, Qnil
);
4554 total
[0] = Fcons (make_number (total_conses
),
4555 make_number (total_free_conses
));
4556 total
[1] = Fcons (make_number (total_symbols
),
4557 make_number (total_free_symbols
));
4558 total
[2] = Fcons (make_number (total_markers
),
4559 make_number (total_free_markers
));
4560 total
[3] = make_number (total_string_size
);
4561 total
[4] = make_number (total_vector_size
);
4562 total
[5] = Fcons (make_number (total_floats
),
4563 make_number (total_free_floats
));
4564 total
[6] = Fcons (make_number (total_intervals
),
4565 make_number (total_free_intervals
));
4566 total
[7] = Fcons (make_number (total_strings
),
4567 make_number (total_free_strings
));
4569 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4571 /* Compute average percentage of zombies. */
4574 for (i
= 0; i
< 7; ++i
)
4575 if (CONSP (total
[i
]))
4576 nlive
+= XFASTINT (XCAR (total
[i
]));
4578 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
4579 max_live
= max (nlive
, max_live
);
4580 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
4581 max_zombies
= max (nzombies
, max_zombies
);
4586 if (!NILP (Vpost_gc_hook
))
4588 int count
= inhibit_garbage_collection ();
4589 safe_run_hooks (Qpost_gc_hook
);
4590 unbind_to (count
, Qnil
);
4593 /* Accumulate statistics. */
4594 EMACS_GET_TIME (t2
);
4595 EMACS_SUB_TIME (t3
, t2
, t1
);
4596 if (FLOATP (Vgc_elapsed
))
4597 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
) +
4599 EMACS_USECS (t3
) * 1.0e-6);
4602 return Flist (sizeof total
/ sizeof *total
, total
);
4606 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
4607 only interesting objects referenced from glyphs are strings. */
4610 mark_glyph_matrix (matrix
)
4611 struct glyph_matrix
*matrix
;
4613 struct glyph_row
*row
= matrix
->rows
;
4614 struct glyph_row
*end
= row
+ matrix
->nrows
;
4616 for (; row
< end
; ++row
)
4620 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
4622 struct glyph
*glyph
= row
->glyphs
[area
];
4623 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
4625 for (; glyph
< end_glyph
; ++glyph
)
4626 if (GC_STRINGP (glyph
->object
)
4627 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
4628 mark_object (glyph
->object
);
4634 /* Mark Lisp faces in the face cache C. */
4638 struct face_cache
*c
;
4643 for (i
= 0; i
< c
->used
; ++i
)
4645 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
4649 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
4650 mark_object (face
->lface
[j
]);
4657 #ifdef HAVE_WINDOW_SYSTEM
4659 /* Mark Lisp objects in image IMG. */
4665 mark_object (img
->spec
);
4667 if (!NILP (img
->data
.lisp_val
))
4668 mark_object (img
->data
.lisp_val
);
4672 /* Mark Lisp objects in image cache of frame F. It's done this way so
4673 that we don't have to include xterm.h here. */
4676 mark_image_cache (f
)
4679 forall_images_in_image_cache (f
, mark_image
);
4682 #endif /* HAVE_X_WINDOWS */
4686 /* Mark reference to a Lisp_Object.
4687 If the object referred to has not been seen yet, recursively mark
4688 all the references contained in it. */
4690 #define LAST_MARKED_SIZE 500
4691 Lisp_Object last_marked
[LAST_MARKED_SIZE
];
4692 int last_marked_index
;
4694 /* For debugging--call abort when we cdr down this many
4695 links of a list, in mark_object. In debugging,
4696 the call to abort will hit a breakpoint.
4697 Normally this is zero and the check never goes off. */
4698 int mark_object_loop_halt
;
4704 register Lisp_Object obj
= arg
;
4705 #ifdef GC_CHECK_MARKED_OBJECTS
4713 if (PURE_POINTER_P (XPNTR (obj
)))
4716 last_marked
[last_marked_index
++] = obj
;
4717 if (last_marked_index
== LAST_MARKED_SIZE
)
4718 last_marked_index
= 0;
4720 /* Perform some sanity checks on the objects marked here. Abort if
4721 we encounter an object we know is bogus. This increases GC time
4722 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
4723 #ifdef GC_CHECK_MARKED_OBJECTS
4725 po
= (void *) XPNTR (obj
);
4727 /* Check that the object pointed to by PO is known to be a Lisp
4728 structure allocated from the heap. */
4729 #define CHECK_ALLOCATED() \
4731 m = mem_find (po); \
4736 /* Check that the object pointed to by PO is live, using predicate
4738 #define CHECK_LIVE(LIVEP) \
4740 if (!LIVEP (m, po)) \
4744 /* Check both of the above conditions. */
4745 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
4747 CHECK_ALLOCATED (); \
4748 CHECK_LIVE (LIVEP); \
4751 #else /* not GC_CHECK_MARKED_OBJECTS */
4753 #define CHECK_ALLOCATED() (void) 0
4754 #define CHECK_LIVE(LIVEP) (void) 0
4755 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
4757 #endif /* not GC_CHECK_MARKED_OBJECTS */
4759 switch (SWITCH_ENUM_CAST (XGCTYPE (obj
)))
4763 register struct Lisp_String
*ptr
= XSTRING (obj
);
4764 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
4765 MARK_INTERVAL_TREE (ptr
->intervals
);
4767 #ifdef GC_CHECK_STRING_BYTES
4768 /* Check that the string size recorded in the string is the
4769 same as the one recorded in the sdata structure. */
4770 CHECK_STRING_BYTES (ptr
);
4771 #endif /* GC_CHECK_STRING_BYTES */
4775 case Lisp_Vectorlike
:
4776 #ifdef GC_CHECK_MARKED_OBJECTS
4778 if (m
== MEM_NIL
&& !GC_SUBRP (obj
)
4779 && po
!= &buffer_defaults
4780 && po
!= &buffer_local_symbols
)
4782 #endif /* GC_CHECK_MARKED_OBJECTS */
4784 if (GC_BUFFERP (obj
))
4786 if (!VECTOR_MARKED_P (XBUFFER (obj
)))
4788 #ifdef GC_CHECK_MARKED_OBJECTS
4789 if (po
!= &buffer_defaults
&& po
!= &buffer_local_symbols
)
4792 for (b
= all_buffers
; b
&& b
!= po
; b
= b
->next
)
4797 #endif /* GC_CHECK_MARKED_OBJECTS */
4801 else if (GC_SUBRP (obj
))
4803 else if (GC_COMPILEDP (obj
))
4804 /* We could treat this just like a vector, but it is better to
4805 save the COMPILED_CONSTANTS element for last and avoid
4808 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
4809 register EMACS_INT size
= ptr
->size
;
4812 if (VECTOR_MARKED_P (ptr
))
4813 break; /* Already marked */
4815 CHECK_LIVE (live_vector_p
);
4816 VECTOR_MARK (ptr
); /* Else mark it */
4817 size
&= PSEUDOVECTOR_SIZE_MASK
;
4818 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
4820 if (i
!= COMPILED_CONSTANTS
)
4821 mark_object (ptr
->contents
[i
]);
4823 obj
= ptr
->contents
[COMPILED_CONSTANTS
];
4826 else if (GC_FRAMEP (obj
))
4828 register struct frame
*ptr
= XFRAME (obj
);
4830 if (VECTOR_MARKED_P (ptr
)) break; /* Already marked */
4831 VECTOR_MARK (ptr
); /* Else mark it */
4833 CHECK_LIVE (live_vector_p
);
4834 mark_object (ptr
->name
);
4835 mark_object (ptr
->icon_name
);
4836 mark_object (ptr
->title
);
4837 mark_object (ptr
->focus_frame
);
4838 mark_object (ptr
->selected_window
);
4839 mark_object (ptr
->minibuffer_window
);
4840 mark_object (ptr
->param_alist
);
4841 mark_object (ptr
->scroll_bars
);
4842 mark_object (ptr
->condemned_scroll_bars
);
4843 mark_object (ptr
->menu_bar_items
);
4844 mark_object (ptr
->face_alist
);
4845 mark_object (ptr
->menu_bar_vector
);
4846 mark_object (ptr
->buffer_predicate
);
4847 mark_object (ptr
->buffer_list
);
4848 mark_object (ptr
->menu_bar_window
);
4849 mark_object (ptr
->tool_bar_window
);
4850 mark_face_cache (ptr
->face_cache
);
4851 #ifdef HAVE_WINDOW_SYSTEM
4852 mark_image_cache (ptr
);
4853 mark_object (ptr
->tool_bar_items
);
4854 mark_object (ptr
->desired_tool_bar_string
);
4855 mark_object (ptr
->current_tool_bar_string
);
4856 #endif /* HAVE_WINDOW_SYSTEM */
4858 else if (GC_BOOL_VECTOR_P (obj
))
4860 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
4862 if (VECTOR_MARKED_P (ptr
))
4863 break; /* Already marked */
4864 CHECK_LIVE (live_vector_p
);
4865 VECTOR_MARK (ptr
); /* Else mark it */
4867 else if (GC_WINDOWP (obj
))
4869 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
4870 struct window
*w
= XWINDOW (obj
);
4873 /* Stop if already marked. */
4874 if (VECTOR_MARKED_P (ptr
))
4878 CHECK_LIVE (live_vector_p
);
4881 /* There is no Lisp data above The member CURRENT_MATRIX in
4882 struct WINDOW. Stop marking when that slot is reached. */
4884 (char *) &ptr
->contents
[i
] < (char *) &w
->current_matrix
;
4886 mark_object (ptr
->contents
[i
]);
4888 /* Mark glyphs for leaf windows. Marking window matrices is
4889 sufficient because frame matrices use the same glyph
4891 if (NILP (w
->hchild
)
4893 && w
->current_matrix
)
4895 mark_glyph_matrix (w
->current_matrix
);
4896 mark_glyph_matrix (w
->desired_matrix
);
4899 else if (GC_HASH_TABLE_P (obj
))
4901 struct Lisp_Hash_Table
*h
= XHASH_TABLE (obj
);
4903 /* Stop if already marked. */
4904 if (VECTOR_MARKED_P (h
))
4908 CHECK_LIVE (live_vector_p
);
4911 /* Mark contents. */
4912 /* Do not mark next_free or next_weak.
4913 Being in the next_weak chain
4914 should not keep the hash table alive.
4915 No need to mark `count' since it is an integer. */
4916 mark_object (h
->test
);
4917 mark_object (h
->weak
);
4918 mark_object (h
->rehash_size
);
4919 mark_object (h
->rehash_threshold
);
4920 mark_object (h
->hash
);
4921 mark_object (h
->next
);
4922 mark_object (h
->index
);
4923 mark_object (h
->user_hash_function
);
4924 mark_object (h
->user_cmp_function
);
4926 /* If hash table is not weak, mark all keys and values.
4927 For weak tables, mark only the vector. */
4928 if (GC_NILP (h
->weak
))
4929 mark_object (h
->key_and_value
);
4931 VECTOR_MARK (XVECTOR (h
->key_and_value
));
4935 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
4936 register EMACS_INT size
= ptr
->size
;
4939 if (VECTOR_MARKED_P (ptr
)) break; /* Already marked */
4940 CHECK_LIVE (live_vector_p
);
4941 VECTOR_MARK (ptr
); /* Else mark it */
4942 if (size
& PSEUDOVECTOR_FLAG
)
4943 size
&= PSEUDOVECTOR_SIZE_MASK
;
4945 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
4946 mark_object (ptr
->contents
[i
]);
4952 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
4953 struct Lisp_Symbol
*ptrx
;
4955 if (ptr
->gcmarkbit
) break;
4956 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
4958 mark_object (ptr
->value
);
4959 mark_object (ptr
->function
);
4960 mark_object (ptr
->plist
);
4962 if (!PURE_POINTER_P (XSTRING (ptr
->xname
)))
4963 MARK_STRING (XSTRING (ptr
->xname
));
4964 MARK_INTERVAL_TREE (STRING_INTERVALS (ptr
->xname
));
4966 /* Note that we do not mark the obarray of the symbol.
4967 It is safe not to do so because nothing accesses that
4968 slot except to check whether it is nil. */
4972 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun */
4973 XSETSYMBOL (obj
, ptrx
);
4980 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
4981 if (XMARKER (obj
)->gcmarkbit
)
4983 XMARKER (obj
)->gcmarkbit
= 1;
4984 switch (XMISCTYPE (obj
))
4986 case Lisp_Misc_Buffer_Local_Value
:
4987 case Lisp_Misc_Some_Buffer_Local_Value
:
4989 register struct Lisp_Buffer_Local_Value
*ptr
4990 = XBUFFER_LOCAL_VALUE (obj
);
4991 /* If the cdr is nil, avoid recursion for the car. */
4992 if (EQ (ptr
->cdr
, Qnil
))
4994 obj
= ptr
->realvalue
;
4997 mark_object (ptr
->realvalue
);
4998 mark_object (ptr
->buffer
);
4999 mark_object (ptr
->frame
);
5004 case Lisp_Misc_Marker
:
5005 /* DO NOT mark thru the marker's chain.
5006 The buffer's markers chain does not preserve markers from gc;
5007 instead, markers are removed from the chain when freed by gc. */
5008 case Lisp_Misc_Intfwd
:
5009 case Lisp_Misc_Boolfwd
:
5010 case Lisp_Misc_Objfwd
:
5011 case Lisp_Misc_Buffer_Objfwd
:
5012 case Lisp_Misc_Kboard_Objfwd
:
5013 /* Don't bother with Lisp_Buffer_Objfwd,
5014 since all markable slots in current buffer marked anyway. */
5015 /* Don't need to do Lisp_Objfwd, since the places they point
5016 are protected with staticpro. */
5017 case Lisp_Misc_Save_Value
:
5020 case Lisp_Misc_Overlay
:
5022 struct Lisp_Overlay
*ptr
= XOVERLAY (obj
);
5023 mark_object (ptr
->start
);
5024 mark_object (ptr
->end
);
5025 mark_object (ptr
->plist
);
5028 XSETMISC (obj
, ptr
->next
);
5041 register struct Lisp_Cons
*ptr
= XCONS (obj
);
5042 if (CONS_MARKED_P (ptr
)) break;
5043 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
5045 /* If the cdr is nil, avoid recursion for the car. */
5046 if (EQ (ptr
->cdr
, Qnil
))
5052 mark_object (ptr
->car
);
5055 if (cdr_count
== mark_object_loop_halt
)
5061 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
5062 FLOAT_MARK (XFLOAT (obj
));
5073 #undef CHECK_ALLOCATED
5074 #undef CHECK_ALLOCATED_AND_LIVE
5077 /* Mark the pointers in a buffer structure. */
5083 register struct buffer
*buffer
= XBUFFER (buf
);
5084 register Lisp_Object
*ptr
, tmp
;
5085 Lisp_Object base_buffer
;
5087 VECTOR_MARK (buffer
);
5089 MARK_INTERVAL_TREE (BUF_INTERVALS (buffer
));
5091 if (CONSP (buffer
->undo_list
))
5094 tail
= buffer
->undo_list
;
5096 /* We mark the undo list specially because
5097 its pointers to markers should be weak. */
5099 while (CONSP (tail
))
5101 register struct Lisp_Cons
*ptr
= XCONS (tail
);
5103 if (CONS_MARKED_P (ptr
))
5106 if (GC_CONSP (ptr
->car
)
5107 && !CONS_MARKED_P (XCONS (ptr
->car
))
5108 && GC_MARKERP (XCAR (ptr
->car
)))
5110 CONS_MARK (XCONS (ptr
->car
));
5111 mark_object (XCDR (ptr
->car
));
5114 mark_object (ptr
->car
);
5116 if (CONSP (ptr
->cdr
))
5122 mark_object (XCDR (tail
));
5125 mark_object (buffer
->undo_list
);
5127 if (buffer
->overlays_before
)
5129 XSETMISC (tmp
, buffer
->overlays_before
);
5132 if (buffer
->overlays_after
)
5134 XSETMISC (tmp
, buffer
->overlays_after
);
5138 for (ptr
= &buffer
->name
;
5139 (char *)ptr
< (char *)buffer
+ sizeof (struct buffer
);
5143 /* If this is an indirect buffer, mark its base buffer. */
5144 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
5146 XSETBUFFER (base_buffer
, buffer
->base_buffer
);
5147 mark_buffer (base_buffer
);
5152 /* Value is non-zero if OBJ will survive the current GC because it's
5153 either marked or does not need to be marked to survive. */
5161 switch (XGCTYPE (obj
))
5168 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
5172 survives_p
= XMARKER (obj
)->gcmarkbit
;
5176 survives_p
= STRING_MARKED_P (XSTRING (obj
));
5179 case Lisp_Vectorlike
:
5180 survives_p
= GC_SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
5184 survives_p
= CONS_MARKED_P (XCONS (obj
));
5188 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
5195 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
5200 /* Sweep: find all structures not marked, and free them. */
5205 /* Put all unmarked conses on free list */
5207 register struct cons_block
*cblk
;
5208 struct cons_block
**cprev
= &cons_block
;
5209 register int lim
= cons_block_index
;
5210 register int num_free
= 0, num_used
= 0;
5214 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
5218 for (i
= 0; i
< lim
; i
++)
5219 if (!CONS_MARKED_P (&cblk
->conses
[i
]))
5222 *(struct Lisp_Cons
**)&cblk
->conses
[i
].cdr
= cons_free_list
;
5223 cons_free_list
= &cblk
->conses
[i
];
5225 cons_free_list
->car
= Vdead
;
5231 CONS_UNMARK (&cblk
->conses
[i
]);
5233 lim
= CONS_BLOCK_SIZE
;
5234 /* If this block contains only free conses and we have already
5235 seen more than two blocks worth of free conses then deallocate
5237 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
5239 *cprev
= cblk
->next
;
5240 /* Unhook from the free list. */
5241 cons_free_list
= *(struct Lisp_Cons
**) &cblk
->conses
[0].cdr
;
5242 lisp_align_free (cblk
);
5247 num_free
+= this_free
;
5248 cprev
= &cblk
->next
;
5251 total_conses
= num_used
;
5252 total_free_conses
= num_free
;
5255 /* Remove or mark entries in weak hash tables.
5256 This must be done before any object is unmarked. */
5257 sweep_weak_hash_tables ();
5260 #ifdef GC_CHECK_STRING_BYTES
5261 if (!noninteractive
)
5262 check_string_bytes (1);
5265 /* Put all unmarked floats on free list */
5267 register struct float_block
*fblk
;
5268 struct float_block
**fprev
= &float_block
;
5269 register int lim
= float_block_index
;
5270 register int num_free
= 0, num_used
= 0;
5272 float_free_list
= 0;
5274 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
5278 for (i
= 0; i
< lim
; i
++)
5279 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
5282 *(struct Lisp_Float
**)&fblk
->floats
[i
].data
= float_free_list
;
5283 float_free_list
= &fblk
->floats
[i
];
5288 FLOAT_UNMARK (&fblk
->floats
[i
]);
5290 lim
= FLOAT_BLOCK_SIZE
;
5291 /* If this block contains only free floats and we have already
5292 seen more than two blocks worth of free floats then deallocate
5294 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
5296 *fprev
= fblk
->next
;
5297 /* Unhook from the free list. */
5298 float_free_list
= *(struct Lisp_Float
**) &fblk
->floats
[0].data
;
5299 lisp_align_free (fblk
);
5304 num_free
+= this_free
;
5305 fprev
= &fblk
->next
;
5308 total_floats
= num_used
;
5309 total_free_floats
= num_free
;
5312 /* Put all unmarked intervals on free list */
5314 register struct interval_block
*iblk
;
5315 struct interval_block
**iprev
= &interval_block
;
5316 register int lim
= interval_block_index
;
5317 register int num_free
= 0, num_used
= 0;
5319 interval_free_list
= 0;
5321 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
5326 for (i
= 0; i
< lim
; i
++)
5328 if (!iblk
->intervals
[i
].gcmarkbit
)
5330 SET_INTERVAL_PARENT (&iblk
->intervals
[i
], interval_free_list
);
5331 interval_free_list
= &iblk
->intervals
[i
];
5337 iblk
->intervals
[i
].gcmarkbit
= 0;
5340 lim
= INTERVAL_BLOCK_SIZE
;
5341 /* If this block contains only free intervals and we have already
5342 seen more than two blocks worth of free intervals then
5343 deallocate this block. */
5344 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
5346 *iprev
= iblk
->next
;
5347 /* Unhook from the free list. */
5348 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
5350 n_interval_blocks
--;
5354 num_free
+= this_free
;
5355 iprev
= &iblk
->next
;
5358 total_intervals
= num_used
;
5359 total_free_intervals
= num_free
;
5362 /* Put all unmarked symbols on free list */
5364 register struct symbol_block
*sblk
;
5365 struct symbol_block
**sprev
= &symbol_block
;
5366 register int lim
= symbol_block_index
;
5367 register int num_free
= 0, num_used
= 0;
5369 symbol_free_list
= NULL
;
5371 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
5374 struct Lisp_Symbol
*sym
= sblk
->symbols
;
5375 struct Lisp_Symbol
*end
= sym
+ lim
;
5377 for (; sym
< end
; ++sym
)
5379 /* Check if the symbol was created during loadup. In such a case
5380 it might be pointed to by pure bytecode which we don't trace,
5381 so we conservatively assume that it is live. */
5382 int pure_p
= PURE_POINTER_P (XSTRING (sym
->xname
));
5384 if (!sym
->gcmarkbit
&& !pure_p
)
5386 *(struct Lisp_Symbol
**) &sym
->value
= symbol_free_list
;
5387 symbol_free_list
= sym
;
5389 symbol_free_list
->function
= Vdead
;
5397 UNMARK_STRING (XSTRING (sym
->xname
));
5402 lim
= SYMBOL_BLOCK_SIZE
;
5403 /* If this block contains only free symbols and we have already
5404 seen more than two blocks worth of free symbols then deallocate
5406 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
5408 *sprev
= sblk
->next
;
5409 /* Unhook from the free list. */
5410 symbol_free_list
= *(struct Lisp_Symbol
**)&sblk
->symbols
[0].value
;
5416 num_free
+= this_free
;
5417 sprev
= &sblk
->next
;
5420 total_symbols
= num_used
;
5421 total_free_symbols
= num_free
;
5424 /* Put all unmarked misc's on free list.
5425 For a marker, first unchain it from the buffer it points into. */
5427 register struct marker_block
*mblk
;
5428 struct marker_block
**mprev
= &marker_block
;
5429 register int lim
= marker_block_index
;
5430 register int num_free
= 0, num_used
= 0;
5432 marker_free_list
= 0;
5433 marker_blocks_pending_free
= 0;
5435 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
5440 for (i
= 0; i
< lim
; i
++)
5442 if (!mblk
->markers
[i
].u_marker
.gcmarkbit
)
5444 if (mblk
->markers
[i
].u_marker
.type
== Lisp_Misc_Marker
)
5445 unchain_marker (&mblk
->markers
[i
].u_marker
);
5446 /* Set the type of the freed object to Lisp_Misc_Free.
5447 We could leave the type alone, since nobody checks it,
5448 but this might catch bugs faster. */
5449 mblk
->markers
[i
].u_marker
.type
= Lisp_Misc_Free
;
5450 mblk
->markers
[i
].u_free
.chain
= marker_free_list
;
5451 marker_free_list
= &mblk
->markers
[i
];
5457 mblk
->markers
[i
].u_marker
.gcmarkbit
= 0;
5460 lim
= MARKER_BLOCK_SIZE
;
5461 /* If this block contains only free markers and we have already
5462 seen more than two blocks worth of free markers then deallocate
5464 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
5466 *mprev
= mblk
->next
;
5467 /* Unhook from the free list. */
5468 marker_free_list
= mblk
->markers
[0].u_free
.chain
;
5471 /* It is not safe to free the marker block at this stage,
5472 since there may still be pointers to these markers from
5473 a buffer's undo list. KFS 2004-05-25. */
5474 mblk
->next
= marker_blocks_pending_free
;
5475 marker_blocks_pending_free
= mblk
;
5479 num_free
+= this_free
;
5480 mprev
= &mblk
->next
;
5484 total_markers
= num_used
;
5485 total_free_markers
= num_free
;
5488 /* Free all unmarked buffers */
5490 register struct buffer
*buffer
= all_buffers
, *prev
= 0, *next
;
5493 if (!VECTOR_MARKED_P (buffer
))
5496 prev
->next
= buffer
->next
;
5498 all_buffers
= buffer
->next
;
5499 next
= buffer
->next
;
5505 VECTOR_UNMARK (buffer
);
5506 UNMARK_BALANCE_INTERVALS (BUF_INTERVALS (buffer
));
5507 prev
= buffer
, buffer
= buffer
->next
;
5511 /* Free all unmarked vectors */
5513 register struct Lisp_Vector
*vector
= all_vectors
, *prev
= 0, *next
;
5514 total_vector_size
= 0;
5517 if (!VECTOR_MARKED_P (vector
))
5520 prev
->next
= vector
->next
;
5522 all_vectors
= vector
->next
;
5523 next
= vector
->next
;
5531 VECTOR_UNMARK (vector
);
5532 if (vector
->size
& PSEUDOVECTOR_FLAG
)
5533 total_vector_size
+= (PSEUDOVECTOR_SIZE_MASK
& vector
->size
);
5535 total_vector_size
+= vector
->size
;
5536 prev
= vector
, vector
= vector
->next
;
5540 #ifdef GC_CHECK_STRING_BYTES
5541 if (!noninteractive
)
5542 check_string_bytes (1);
5549 /* Debugging aids. */
5551 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
5552 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
5553 This may be helpful in debugging Emacs's memory usage.
5554 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
5559 XSETINT (end
, (EMACS_INT
) sbrk (0) / 1024);
5564 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
5565 doc
: /* Return a list of counters that measure how much consing there has been.
5566 Each of these counters increments for a certain kind of object.
5567 The counters wrap around from the largest positive integer to zero.
5568 Garbage collection does not decrease them.
5569 The elements of the value are as follows:
5570 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
5571 All are in units of 1 = one object consed
5572 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
5574 MISCS include overlays, markers, and some internal types.
5575 Frames, windows, buffers, and subprocesses count as vectors
5576 (but the contents of a buffer's text do not count here). */)
5579 Lisp_Object consed
[8];
5581 consed
[0] = make_number (min (MOST_POSITIVE_FIXNUM
, cons_cells_consed
));
5582 consed
[1] = make_number (min (MOST_POSITIVE_FIXNUM
, floats_consed
));
5583 consed
[2] = make_number (min (MOST_POSITIVE_FIXNUM
, vector_cells_consed
));
5584 consed
[3] = make_number (min (MOST_POSITIVE_FIXNUM
, symbols_consed
));
5585 consed
[4] = make_number (min (MOST_POSITIVE_FIXNUM
, string_chars_consed
));
5586 consed
[5] = make_number (min (MOST_POSITIVE_FIXNUM
, misc_objects_consed
));
5587 consed
[6] = make_number (min (MOST_POSITIVE_FIXNUM
, intervals_consed
));
5588 consed
[7] = make_number (min (MOST_POSITIVE_FIXNUM
, strings_consed
));
5590 return Flist (8, consed
);
5593 int suppress_checking
;
5595 die (msg
, file
, line
)
5600 fprintf (stderr
, "\r\nEmacs fatal error: %s:%d: %s\r\n",
5605 /* Initialization */
5610 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
5612 pure_size
= PURESIZE
;
5613 pure_bytes_used
= 0;
5614 pure_bytes_used_before_overflow
= 0;
5616 /* Initialize the list of free aligned blocks. */
5619 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
5621 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
5625 ignore_warnings
= 1;
5626 #ifdef DOUG_LEA_MALLOC
5627 mallopt (M_TRIM_THRESHOLD
, 128*1024); /* trim threshold */
5628 mallopt (M_MMAP_THRESHOLD
, 64*1024); /* mmap threshold */
5629 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* max. number of mmap'ed areas */
5639 malloc_hysteresis
= 32;
5641 malloc_hysteresis
= 0;
5644 spare_memory
= (char *) malloc (SPARE_MEMORY
);
5646 ignore_warnings
= 0;
5648 byte_stack_list
= 0;
5650 consing_since_gc
= 0;
5651 gc_cons_threshold
= 100000 * sizeof (Lisp_Object
);
5652 #ifdef VIRT_ADDR_VARIES
5653 malloc_sbrk_unused
= 1<<22; /* A large number */
5654 malloc_sbrk_used
= 100000; /* as reasonable as any number */
5655 #endif /* VIRT_ADDR_VARIES */
5662 byte_stack_list
= 0;
5664 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
5665 setjmp_tested_p
= longjmps_done
= 0;
5668 Vgc_elapsed
= make_float (0.0);
5675 DEFVAR_INT ("gc-cons-threshold", &gc_cons_threshold
,
5676 doc
: /* *Number of bytes of consing between garbage collections.
5677 Garbage collection can happen automatically once this many bytes have been
5678 allocated since the last garbage collection. All data types count.
5680 Garbage collection happens automatically only when `eval' is called.
5682 By binding this temporarily to a large number, you can effectively
5683 prevent garbage collection during a part of the program. */);
5685 DEFVAR_INT ("pure-bytes-used", &pure_bytes_used
,
5686 doc
: /* Number of bytes of sharable Lisp data allocated so far. */);
5688 DEFVAR_INT ("cons-cells-consed", &cons_cells_consed
,
5689 doc
: /* Number of cons cells that have been consed so far. */);
5691 DEFVAR_INT ("floats-consed", &floats_consed
,
5692 doc
: /* Number of floats that have been consed so far. */);
5694 DEFVAR_INT ("vector-cells-consed", &vector_cells_consed
,
5695 doc
: /* Number of vector cells that have been consed so far. */);
5697 DEFVAR_INT ("symbols-consed", &symbols_consed
,
5698 doc
: /* Number of symbols that have been consed so far. */);
5700 DEFVAR_INT ("string-chars-consed", &string_chars_consed
,
5701 doc
: /* Number of string characters that have been consed so far. */);
5703 DEFVAR_INT ("misc-objects-consed", &misc_objects_consed
,
5704 doc
: /* Number of miscellaneous objects that have been consed so far. */);
5706 DEFVAR_INT ("intervals-consed", &intervals_consed
,
5707 doc
: /* Number of intervals that have been consed so far. */);
5709 DEFVAR_INT ("strings-consed", &strings_consed
,
5710 doc
: /* Number of strings that have been consed so far. */);
5712 DEFVAR_LISP ("purify-flag", &Vpurify_flag
,
5713 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
5714 This means that certain objects should be allocated in shared (pure) space. */);
5716 DEFVAR_INT ("undo-limit", &undo_limit
,
5717 doc
: /* Keep no more undo information once it exceeds this size.
5718 This limit is applied when garbage collection happens.
5719 The size is counted as the number of bytes occupied,
5720 which includes both saved text and other data. */);
5723 DEFVAR_INT ("undo-strong-limit", &undo_strong_limit
,
5724 doc
: /* Don't keep more than this much size of undo information.
5725 A command which pushes past this size is itself forgotten.
5726 This limit is applied when garbage collection happens.
5727 The size is counted as the number of bytes occupied,
5728 which includes both saved text and other data. */);
5729 undo_strong_limit
= 30000;
5731 DEFVAR_BOOL ("garbage-collection-messages", &garbage_collection_messages
,
5732 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
5733 garbage_collection_messages
= 0;
5735 DEFVAR_LISP ("post-gc-hook", &Vpost_gc_hook
,
5736 doc
: /* Hook run after garbage collection has finished. */);
5737 Vpost_gc_hook
= Qnil
;
5738 Qpost_gc_hook
= intern ("post-gc-hook");
5739 staticpro (&Qpost_gc_hook
);
5741 DEFVAR_LISP ("memory-signal-data", &Vmemory_signal_data
,
5742 doc
: /* Precomputed `signal' argument for memory-full error. */);
5743 /* We build this in advance because if we wait until we need it, we might
5744 not be able to allocate the memory to hold it. */
5747 build_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"));
5749 DEFVAR_LISP ("memory-full", &Vmemory_full
,
5750 doc
: /* Non-nil means we are handling a memory-full error. */);
5751 Vmemory_full
= Qnil
;
5753 staticpro (&Qgc_cons_threshold
);
5754 Qgc_cons_threshold
= intern ("gc-cons-threshold");
5756 staticpro (&Qchar_table_extra_slots
);
5757 Qchar_table_extra_slots
= intern ("char-table-extra-slots");
5759 DEFVAR_LISP ("gc-elapsed", &Vgc_elapsed
,
5760 doc
: /* Accumulated time elapsed in garbage collections.
5761 The time is in seconds as a floating point value. */);
5762 DEFVAR_INT ("gcs-done", &gcs_done
,
5763 doc
: /* Accumulated number of garbage collections done. */);
5768 defsubr (&Smake_byte_code
);
5769 defsubr (&Smake_list
);
5770 defsubr (&Smake_vector
);
5771 defsubr (&Smake_char_table
);
5772 defsubr (&Smake_string
);
5773 defsubr (&Smake_bool_vector
);
5774 defsubr (&Smake_symbol
);
5775 defsubr (&Smake_marker
);
5776 defsubr (&Spurecopy
);
5777 defsubr (&Sgarbage_collect
);
5778 defsubr (&Smemory_limit
);
5779 defsubr (&Smemory_use_counts
);
5781 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5782 defsubr (&Sgc_status
);
5786 /* arch-tag: 6695ca10-e3c5-4c2c-8bc3-ed26a7dda857
5787 (do not change this comment) */