1 /* Storage allocation and gc for GNU Emacs Lisp interpreter.
2 Copyright (C) 1985,86,88,93,94,95,97,98,1999,2000,01,02,03,2004
3 Free Software Foundation, Inc.
5 This file is part of GNU Emacs.
7 GNU Emacs is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU Emacs is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU Emacs; see the file COPYING. If not, write to
19 the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
24 #include <limits.h> /* For CHAR_BIT. */
30 /* Note that this declares bzero on OSF/1. How dumb. */
34 /* This file is part of the core Lisp implementation, and thus must
35 deal with the real data structures. If the Lisp implementation is
36 replaced, this file likely will not be used. */
38 #undef HIDE_LISP_IMPLEMENTATION
41 #include "intervals.h"
47 #include "blockinput.h"
48 #include "character.h"
49 #include "syssignal.h"
52 /* GC_MALLOC_CHECK defined means perform validity checks of malloc'd
53 memory. Can do this only if using gmalloc.c. */
55 #if defined SYSTEM_MALLOC || defined DOUG_LEA_MALLOC
56 #undef GC_MALLOC_CHECK
62 extern POINTER_TYPE
*sbrk ();
65 #ifdef DOUG_LEA_MALLOC
68 /* malloc.h #defines this as size_t, at least in glibc2. */
69 #ifndef __malloc_size_t
70 #define __malloc_size_t int
73 /* Specify maximum number of areas to mmap. It would be nice to use a
74 value that explicitly means "no limit". */
76 #define MMAP_MAX_AREAS 100000000
78 #else /* not DOUG_LEA_MALLOC */
80 /* The following come from gmalloc.c. */
82 #define __malloc_size_t size_t
83 extern __malloc_size_t _bytes_used
;
84 extern __malloc_size_t __malloc_extra_blocks
;
86 #endif /* not DOUG_LEA_MALLOC */
88 /* Value of _bytes_used, when spare_memory was freed. */
90 static __malloc_size_t bytes_used_when_full
;
92 /* Mark, unmark, query mark bit of a Lisp string. S must be a pointer
93 to a struct Lisp_String. */
95 #define MARK_STRING(S) ((S)->size |= ARRAY_MARK_FLAG)
96 #define UNMARK_STRING(S) ((S)->size &= ~ARRAY_MARK_FLAG)
97 #define STRING_MARKED_P(S) ((S)->size & ARRAY_MARK_FLAG)
99 #define VECTOR_MARK(V) ((V)->size |= ARRAY_MARK_FLAG)
100 #define VECTOR_UNMARK(V) ((V)->size &= ~ARRAY_MARK_FLAG)
101 #define VECTOR_MARKED_P(V) ((V)->size & ARRAY_MARK_FLAG)
103 /* Value is the number of bytes/chars of S, a pointer to a struct
104 Lisp_String. This must be used instead of STRING_BYTES (S) or
105 S->size during GC, because S->size contains the mark bit for
108 #define GC_STRING_BYTES(S) (STRING_BYTES (S))
109 #define GC_STRING_CHARS(S) ((S)->size & ~ARRAY_MARK_FLAG)
111 /* Number of bytes of consing done since the last gc. */
113 int consing_since_gc
;
115 /* Count the amount of consing of various sorts of space. */
117 EMACS_INT cons_cells_consed
;
118 EMACS_INT floats_consed
;
119 EMACS_INT vector_cells_consed
;
120 EMACS_INT symbols_consed
;
121 EMACS_INT string_chars_consed
;
122 EMACS_INT misc_objects_consed
;
123 EMACS_INT intervals_consed
;
124 EMACS_INT strings_consed
;
126 /* Number of bytes of consing since GC before another GC should be done. */
128 EMACS_INT gc_cons_threshold
;
130 /* Nonzero during GC. */
134 /* Nonzero means abort if try to GC.
135 This is for code which is written on the assumption that
136 no GC will happen, so as to verify that assumption. */
140 /* Nonzero means display messages at beginning and end of GC. */
142 int garbage_collection_messages
;
144 #ifndef VIRT_ADDR_VARIES
146 #endif /* VIRT_ADDR_VARIES */
147 int malloc_sbrk_used
;
149 #ifndef VIRT_ADDR_VARIES
151 #endif /* VIRT_ADDR_VARIES */
152 int malloc_sbrk_unused
;
154 /* Two limits controlling how much undo information to keep. */
156 EMACS_INT undo_limit
;
157 EMACS_INT undo_strong_limit
;
158 EMACS_INT undo_outer_limit
;
160 /* Number of live and free conses etc. */
162 static int total_conses
, total_markers
, total_symbols
, total_vector_size
;
163 static int total_free_conses
, total_free_markers
, total_free_symbols
;
164 static int total_free_floats
, total_floats
;
166 /* Points to memory space allocated as "spare", to be freed if we run
169 static char *spare_memory
;
171 /* Amount of spare memory to keep in reserve. */
173 #define SPARE_MEMORY (1 << 14)
175 /* Number of extra blocks malloc should get when it needs more core. */
177 static int malloc_hysteresis
;
179 /* Non-nil means defun should do purecopy on the function definition. */
181 Lisp_Object Vpurify_flag
;
183 /* Non-nil means we are handling a memory-full error. */
185 Lisp_Object Vmemory_full
;
189 /* Force it into data space! Initialize it to a nonzero value;
190 otherwise some compilers put it into BSS. */
192 EMACS_INT pure
[PURESIZE
/ sizeof (EMACS_INT
)] = {1,};
193 #define PUREBEG (char *) pure
197 #define pure PURE_SEG_BITS /* Use shared memory segment */
198 #define PUREBEG (char *)PURE_SEG_BITS
200 #endif /* HAVE_SHM */
202 /* Pointer to the pure area, and its size. */
204 static char *purebeg
;
205 static size_t pure_size
;
207 /* Number of bytes of pure storage used before pure storage overflowed.
208 If this is non-zero, this implies that an overflow occurred. */
210 static size_t pure_bytes_used_before_overflow
;
212 /* Value is non-zero if P points into pure space. */
214 #define PURE_POINTER_P(P) \
215 (((PNTR_COMPARISON_TYPE) (P) \
216 < (PNTR_COMPARISON_TYPE) ((char *) purebeg + pure_size)) \
217 && ((PNTR_COMPARISON_TYPE) (P) \
218 >= (PNTR_COMPARISON_TYPE) purebeg))
220 /* Index in pure at which next pure object will be allocated.. */
222 EMACS_INT pure_bytes_used
;
224 /* If nonzero, this is a warning delivered by malloc and not yet
227 char *pending_malloc_warning
;
229 /* Pre-computed signal argument for use when memory is exhausted. */
231 Lisp_Object Vmemory_signal_data
;
233 /* Maximum amount of C stack to save when a GC happens. */
235 #ifndef MAX_SAVE_STACK
236 #define MAX_SAVE_STACK 16000
239 /* Buffer in which we save a copy of the C stack at each GC. */
244 /* Non-zero means ignore malloc warnings. Set during initialization.
245 Currently not used. */
249 Lisp_Object Qgc_cons_threshold
, Qchar_table_extra_slots
;
251 /* Hook run after GC has finished. */
253 Lisp_Object Vpost_gc_hook
, Qpost_gc_hook
;
255 Lisp_Object Vgc_elapsed
; /* accumulated elapsed time in GC */
256 EMACS_INT gcs_done
; /* accumulated GCs */
258 static void mark_buffer
P_ ((Lisp_Object
));
259 extern void mark_kboards
P_ ((void));
260 extern void mark_backtrace
P_ ((void));
261 static void gc_sweep
P_ ((void));
262 static void mark_glyph_matrix
P_ ((struct glyph_matrix
*));
263 static void mark_face_cache
P_ ((struct face_cache
*));
265 #ifdef HAVE_WINDOW_SYSTEM
266 static void mark_image
P_ ((struct image
*));
267 static void mark_image_cache
P_ ((struct frame
*));
268 #endif /* HAVE_WINDOW_SYSTEM */
270 static struct Lisp_String
*allocate_string
P_ ((void));
271 static void compact_small_strings
P_ ((void));
272 static void free_large_strings
P_ ((void));
273 static void sweep_strings
P_ ((void));
275 extern int message_enable_multibyte
;
277 /* When scanning the C stack for live Lisp objects, Emacs keeps track
278 of what memory allocated via lisp_malloc is intended for what
279 purpose. This enumeration specifies the type of memory. */
290 /* Keep the following vector-like types together, with
291 MEM_TYPE_WINDOW being the last, and MEM_TYPE_VECTOR the
292 first. Or change the code of live_vector_p, for instance. */
300 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
302 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
303 #include <stdio.h> /* For fprintf. */
306 /* A unique object in pure space used to make some Lisp objects
307 on free lists recognizable in O(1). */
311 #ifdef GC_MALLOC_CHECK
313 enum mem_type allocated_mem_type
;
314 int dont_register_blocks
;
316 #endif /* GC_MALLOC_CHECK */
318 /* A node in the red-black tree describing allocated memory containing
319 Lisp data. Each such block is recorded with its start and end
320 address when it is allocated, and removed from the tree when it
323 A red-black tree is a balanced binary tree with the following
326 1. Every node is either red or black.
327 2. Every leaf is black.
328 3. If a node is red, then both of its children are black.
329 4. Every simple path from a node to a descendant leaf contains
330 the same number of black nodes.
331 5. The root is always black.
333 When nodes are inserted into the tree, or deleted from the tree,
334 the tree is "fixed" so that these properties are always true.
336 A red-black tree with N internal nodes has height at most 2
337 log(N+1). Searches, insertions and deletions are done in O(log N).
338 Please see a text book about data structures for a detailed
339 description of red-black trees. Any book worth its salt should
344 /* Children of this node. These pointers are never NULL. When there
345 is no child, the value is MEM_NIL, which points to a dummy node. */
346 struct mem_node
*left
, *right
;
348 /* The parent of this node. In the root node, this is NULL. */
349 struct mem_node
*parent
;
351 /* Start and end of allocated region. */
355 enum {MEM_BLACK
, MEM_RED
} color
;
361 /* Base address of stack. Set in main. */
363 Lisp_Object
*stack_base
;
365 /* Root of the tree describing allocated Lisp memory. */
367 static struct mem_node
*mem_root
;
369 /* Lowest and highest known address in the heap. */
371 static void *min_heap_address
, *max_heap_address
;
373 /* Sentinel node of the tree. */
375 static struct mem_node mem_z
;
376 #define MEM_NIL &mem_z
378 static POINTER_TYPE
*lisp_malloc
P_ ((size_t, enum mem_type
));
379 static struct Lisp_Vector
*allocate_vectorlike
P_ ((EMACS_INT
, enum mem_type
));
380 static void lisp_free
P_ ((POINTER_TYPE
*));
381 static void mark_stack
P_ ((void));
382 static int live_vector_p
P_ ((struct mem_node
*, void *));
383 static int live_buffer_p
P_ ((struct mem_node
*, void *));
384 static int live_string_p
P_ ((struct mem_node
*, void *));
385 static int live_cons_p
P_ ((struct mem_node
*, void *));
386 static int live_symbol_p
P_ ((struct mem_node
*, void *));
387 static int live_float_p
P_ ((struct mem_node
*, void *));
388 static int live_misc_p
P_ ((struct mem_node
*, void *));
389 static void mark_maybe_object
P_ ((Lisp_Object
));
390 static void mark_memory
P_ ((void *, void *));
391 static void mem_init
P_ ((void));
392 static struct mem_node
*mem_insert
P_ ((void *, void *, enum mem_type
));
393 static void mem_insert_fixup
P_ ((struct mem_node
*));
394 static void mem_rotate_left
P_ ((struct mem_node
*));
395 static void mem_rotate_right
P_ ((struct mem_node
*));
396 static void mem_delete
P_ ((struct mem_node
*));
397 static void mem_delete_fixup
P_ ((struct mem_node
*));
398 static INLINE
struct mem_node
*mem_find
P_ ((void *));
400 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
401 static void check_gcpros
P_ ((void));
404 #endif /* GC_MARK_STACK || GC_MALLOC_CHECK */
406 /* Recording what needs to be marked for gc. */
408 struct gcpro
*gcprolist
;
410 /* Addresses of staticpro'd variables. Initialize it to a nonzero
411 value; otherwise some compilers put it into BSS. */
413 #define NSTATICS 1280
414 Lisp_Object
*staticvec
[NSTATICS
] = {&Vpurify_flag
};
416 /* Index of next unused slot in staticvec. */
420 static POINTER_TYPE
*pure_alloc
P_ ((size_t, int));
423 /* Value is SZ rounded up to the next multiple of ALIGNMENT.
424 ALIGNMENT must be a power of 2. */
426 #define ALIGN(ptr, ALIGNMENT) \
427 ((POINTER_TYPE *) ((((EMACS_UINT)(ptr)) + (ALIGNMENT) - 1) \
428 & ~((ALIGNMENT) - 1)))
432 /************************************************************************
434 ************************************************************************/
436 /* Function malloc calls this if it finds we are near exhausting storage. */
442 pending_malloc_warning
= str
;
446 /* Display an already-pending malloc warning. */
449 display_malloc_warning ()
451 call3 (intern ("display-warning"),
453 build_string (pending_malloc_warning
),
454 intern ("emergency"));
455 pending_malloc_warning
= 0;
459 #ifdef DOUG_LEA_MALLOC
460 # define BYTES_USED (mallinfo ().arena)
462 # define BYTES_USED _bytes_used
466 /* Called if malloc returns zero. */
473 #ifndef SYSTEM_MALLOC
474 bytes_used_when_full
= BYTES_USED
;
477 /* The first time we get here, free the spare memory. */
484 /* This used to call error, but if we've run out of memory, we could
485 get infinite recursion trying to build the string. */
487 Fsignal (Qnil
, Vmemory_signal_data
);
491 /* Called if we can't allocate relocatable space for a buffer. */
494 buffer_memory_full ()
496 /* If buffers use the relocating allocator, no need to free
497 spare_memory, because we may have plenty of malloc space left
498 that we could get, and if we don't, the malloc that fails will
499 itself cause spare_memory to be freed. If buffers don't use the
500 relocating allocator, treat this like any other failing
509 /* This used to call error, but if we've run out of memory, we could
510 get infinite recursion trying to build the string. */
512 Fsignal (Qnil
, Vmemory_signal_data
);
516 /* Like malloc but check for no memory and block interrupt input.. */
522 register POINTER_TYPE
*val
;
525 val
= (POINTER_TYPE
*) malloc (size
);
534 /* Like realloc but check for no memory and block interrupt input.. */
537 xrealloc (block
, size
)
541 register POINTER_TYPE
*val
;
544 /* We must call malloc explicitly when BLOCK is 0, since some
545 reallocs don't do this. */
547 val
= (POINTER_TYPE
*) malloc (size
);
549 val
= (POINTER_TYPE
*) realloc (block
, size
);
552 if (!val
&& size
) memory_full ();
557 /* Like free but block interrupt input. */
569 /* Like strdup, but uses xmalloc. */
575 size_t len
= strlen (s
) + 1;
576 char *p
= (char *) xmalloc (len
);
582 /* Like malloc but used for allocating Lisp data. NBYTES is the
583 number of bytes to allocate, TYPE describes the intended use of the
584 allcated memory block (for strings, for conses, ...). */
586 static void *lisp_malloc_loser
;
588 static POINTER_TYPE
*
589 lisp_malloc (nbytes
, type
)
597 #ifdef GC_MALLOC_CHECK
598 allocated_mem_type
= type
;
601 val
= (void *) malloc (nbytes
);
604 /* If the memory just allocated cannot be addressed thru a Lisp
605 object's pointer, and it needs to be,
606 that's equivalent to running out of memory. */
607 if (val
&& type
!= MEM_TYPE_NON_LISP
)
610 XSETCONS (tem
, (char *) val
+ nbytes
- 1);
611 if ((char *) XCONS (tem
) != (char *) val
+ nbytes
- 1)
613 lisp_malloc_loser
= val
;
620 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
621 if (val
&& type
!= MEM_TYPE_NON_LISP
)
622 mem_insert (val
, (char *) val
+ nbytes
, type
);
631 /* Free BLOCK. This must be called to free memory allocated with a
632 call to lisp_malloc. */
640 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
641 mem_delete (mem_find (block
));
646 /* Allocation of aligned blocks of memory to store Lisp data. */
647 /* The entry point is lisp_align_malloc which returns blocks of at most */
648 /* BLOCK_BYTES and guarantees they are aligned on a BLOCK_ALIGN boundary. */
651 /* BLOCK_ALIGN has to be a power of 2. */
652 #define BLOCK_ALIGN (1 << 10)
654 /* Padding to leave at the end of a malloc'd block. This is to give
655 malloc a chance to minimize the amount of memory wasted to alignment.
656 It should be tuned to the particular malloc library used.
657 On glibc-2.3.2, malloc never tries to align, so a padding of 0 is best.
658 posix_memalign on the other hand would ideally prefer a value of 4
659 because otherwise, there's 1020 bytes wasted between each ablocks.
660 But testing shows that those 1020 will most of the time be efficiently
661 used by malloc to place other objects, so a value of 0 is still preferable
662 unless you have a lot of cons&floats and virtually nothing else. */
663 #define BLOCK_PADDING 0
664 #define BLOCK_BYTES \
665 (BLOCK_ALIGN - sizeof (struct aligned_block *) - BLOCK_PADDING)
667 /* Internal data structures and constants. */
669 #define ABLOCKS_SIZE 16
671 /* An aligned block of memory. */
676 char payload
[BLOCK_BYTES
];
677 struct ablock
*next_free
;
679 /* `abase' is the aligned base of the ablocks. */
680 /* It is overloaded to hold the virtual `busy' field that counts
681 the number of used ablock in the parent ablocks.
682 The first ablock has the `busy' field, the others have the `abase'
683 field. To tell the difference, we assume that pointers will have
684 integer values larger than 2 * ABLOCKS_SIZE. The lowest bit of `busy'
685 is used to tell whether the real base of the parent ablocks is `abase'
686 (if not, the word before the first ablock holds a pointer to the
688 struct ablocks
*abase
;
689 /* The padding of all but the last ablock is unused. The padding of
690 the last ablock in an ablocks is not allocated. */
692 char padding
[BLOCK_PADDING
];
696 /* A bunch of consecutive aligned blocks. */
699 struct ablock blocks
[ABLOCKS_SIZE
];
702 /* Size of the block requested from malloc or memalign. */
703 #define ABLOCKS_BYTES (sizeof (struct ablocks) - BLOCK_PADDING)
705 #define ABLOCK_ABASE(block) \
706 (((unsigned long) (block)->abase) <= (1 + 2 * ABLOCKS_SIZE) \
707 ? (struct ablocks *)(block) \
710 /* Virtual `busy' field. */
711 #define ABLOCKS_BUSY(abase) ((abase)->blocks[0].abase)
713 /* Pointer to the (not necessarily aligned) malloc block. */
714 #ifdef HAVE_POSIX_MEMALIGN
715 #define ABLOCKS_BASE(abase) (abase)
717 #define ABLOCKS_BASE(abase) \
718 (1 & (long) ABLOCKS_BUSY (abase) ? abase : ((void**)abase)[-1])
721 /* The list of free ablock. */
722 static struct ablock
*free_ablock
;
724 /* Allocate an aligned block of nbytes.
725 Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be
726 smaller or equal to BLOCK_BYTES. */
727 static POINTER_TYPE
*
728 lisp_align_malloc (nbytes
, type
)
733 struct ablocks
*abase
;
735 eassert (nbytes
<= BLOCK_BYTES
);
739 #ifdef GC_MALLOC_CHECK
740 allocated_mem_type
= type
;
746 EMACS_INT aligned
; /* int gets warning casting to 64-bit pointer. */
748 #ifdef DOUG_LEA_MALLOC
749 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
750 because mapped region contents are not preserved in
752 mallopt (M_MMAP_MAX
, 0);
755 #ifdef HAVE_POSIX_MEMALIGN
757 int err
= posix_memalign (&base
, BLOCK_ALIGN
, ABLOCKS_BYTES
);
763 base
= malloc (ABLOCKS_BYTES
);
764 abase
= ALIGN (base
, BLOCK_ALIGN
);
773 aligned
= (base
== abase
);
775 ((void**)abase
)[-1] = base
;
777 #ifdef DOUG_LEA_MALLOC
778 /* Back to a reasonable maximum of mmap'ed areas. */
779 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
783 /* If the memory just allocated cannot be addressed thru a Lisp
784 object's pointer, and it needs to be, that's equivalent to
785 running out of memory. */
786 if (type
!= MEM_TYPE_NON_LISP
)
789 char *end
= (char *) base
+ ABLOCKS_BYTES
- 1;
791 if ((char *) XCONS (tem
) != end
)
793 lisp_malloc_loser
= base
;
801 /* Initialize the blocks and put them on the free list.
802 Is `base' was not properly aligned, we can't use the last block. */
803 for (i
= 0; i
< (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1); i
++)
805 abase
->blocks
[i
].abase
= abase
;
806 abase
->blocks
[i
].x
.next_free
= free_ablock
;
807 free_ablock
= &abase
->blocks
[i
];
809 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (long) aligned
;
811 eassert (0 == ((EMACS_UINT
)abase
) % BLOCK_ALIGN
);
812 eassert (ABLOCK_ABASE (&abase
->blocks
[3]) == abase
); /* 3 is arbitrary */
813 eassert (ABLOCK_ABASE (&abase
->blocks
[0]) == abase
);
814 eassert (ABLOCKS_BASE (abase
) == base
);
815 eassert (aligned
== (long) ABLOCKS_BUSY (abase
));
818 abase
= ABLOCK_ABASE (free_ablock
);
819 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (2 + (long) ABLOCKS_BUSY (abase
));
821 free_ablock
= free_ablock
->x
.next_free
;
823 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
824 if (val
&& type
!= MEM_TYPE_NON_LISP
)
825 mem_insert (val
, (char *) val
+ nbytes
, type
);
832 eassert (0 == ((EMACS_UINT
)val
) % BLOCK_ALIGN
);
837 lisp_align_free (block
)
840 struct ablock
*ablock
= block
;
841 struct ablocks
*abase
= ABLOCK_ABASE (ablock
);
844 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
845 mem_delete (mem_find (block
));
847 /* Put on free list. */
848 ablock
->x
.next_free
= free_ablock
;
849 free_ablock
= ablock
;
850 /* Update busy count. */
851 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (-2 + (long) ABLOCKS_BUSY (abase
));
853 if (2 > (long) ABLOCKS_BUSY (abase
))
854 { /* All the blocks are free. */
855 int i
= 0, aligned
= (long) ABLOCKS_BUSY (abase
);
856 struct ablock
**tem
= &free_ablock
;
857 struct ablock
*atop
= &abase
->blocks
[aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1];
861 if (*tem
>= (struct ablock
*) abase
&& *tem
< atop
)
864 *tem
= (*tem
)->x
.next_free
;
867 tem
= &(*tem
)->x
.next_free
;
869 eassert ((aligned
& 1) == aligned
);
870 eassert (i
== (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1));
871 free (ABLOCKS_BASE (abase
));
876 /* Return a new buffer structure allocated from the heap with
877 a call to lisp_malloc. */
883 = (struct buffer
*) lisp_malloc (sizeof (struct buffer
),
889 /* Arranging to disable input signals while we're in malloc.
891 This only works with GNU malloc. To help out systems which can't
892 use GNU malloc, all the calls to malloc, realloc, and free
893 elsewhere in the code should be inside a BLOCK_INPUT/UNBLOCK_INPUT
894 pairs; unfortunately, we have no idea what C library functions
895 might call malloc, so we can't really protect them unless you're
896 using GNU malloc. Fortunately, most of the major operating systems
897 can use GNU malloc. */
899 #ifndef SYSTEM_MALLOC
900 #ifndef DOUG_LEA_MALLOC
901 extern void * (*__malloc_hook
) P_ ((size_t));
902 extern void * (*__realloc_hook
) P_ ((void *, size_t));
903 extern void (*__free_hook
) P_ ((void *));
904 /* Else declared in malloc.h, perhaps with an extra arg. */
905 #endif /* DOUG_LEA_MALLOC */
906 static void * (*old_malloc_hook
) ();
907 static void * (*old_realloc_hook
) ();
908 static void (*old_free_hook
) ();
910 /* This function is used as the hook for free to call. */
913 emacs_blocked_free (ptr
)
918 #ifdef GC_MALLOC_CHECK
924 if (m
== MEM_NIL
|| m
->start
!= ptr
)
927 "Freeing `%p' which wasn't allocated with malloc\n", ptr
);
932 /* fprintf (stderr, "free %p...%p (%p)\n", m->start, m->end, ptr); */
936 #endif /* GC_MALLOC_CHECK */
938 __free_hook
= old_free_hook
;
941 /* If we released our reserve (due to running out of memory),
942 and we have a fair amount free once again,
943 try to set aside another reserve in case we run out once more. */
944 if (spare_memory
== 0
945 /* Verify there is enough space that even with the malloc
946 hysteresis this call won't run out again.
947 The code here is correct as long as SPARE_MEMORY
948 is substantially larger than the block size malloc uses. */
949 && (bytes_used_when_full
950 > BYTES_USED
+ max (malloc_hysteresis
, 4) * SPARE_MEMORY
))
951 spare_memory
= (char *) malloc ((size_t) SPARE_MEMORY
);
953 __free_hook
= emacs_blocked_free
;
958 /* If we released our reserve (due to running out of memory),
959 and we have a fair amount free once again,
960 try to set aside another reserve in case we run out once more.
962 This is called when a relocatable block is freed in ralloc.c. */
965 refill_memory_reserve ()
967 if (spare_memory
== 0)
968 spare_memory
= (char *) malloc ((size_t) SPARE_MEMORY
);
972 /* This function is the malloc hook that Emacs uses. */
975 emacs_blocked_malloc (size
)
981 __malloc_hook
= old_malloc_hook
;
982 #ifdef DOUG_LEA_MALLOC
983 mallopt (M_TOP_PAD
, malloc_hysteresis
* 4096);
985 __malloc_extra_blocks
= malloc_hysteresis
;
988 value
= (void *) malloc (size
);
990 #ifdef GC_MALLOC_CHECK
992 struct mem_node
*m
= mem_find (value
);
995 fprintf (stderr
, "Malloc returned %p which is already in use\n",
997 fprintf (stderr
, "Region in use is %p...%p, %u bytes, type %d\n",
998 m
->start
, m
->end
, (char *) m
->end
- (char *) m
->start
,
1003 if (!dont_register_blocks
)
1005 mem_insert (value
, (char *) value
+ max (1, size
), allocated_mem_type
);
1006 allocated_mem_type
= MEM_TYPE_NON_LISP
;
1009 #endif /* GC_MALLOC_CHECK */
1011 __malloc_hook
= emacs_blocked_malloc
;
1014 /* fprintf (stderr, "%p malloc\n", value); */
1019 /* This function is the realloc hook that Emacs uses. */
1022 emacs_blocked_realloc (ptr
, size
)
1029 __realloc_hook
= old_realloc_hook
;
1031 #ifdef GC_MALLOC_CHECK
1034 struct mem_node
*m
= mem_find (ptr
);
1035 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1038 "Realloc of %p which wasn't allocated with malloc\n",
1046 /* fprintf (stderr, "%p -> realloc\n", ptr); */
1048 /* Prevent malloc from registering blocks. */
1049 dont_register_blocks
= 1;
1050 #endif /* GC_MALLOC_CHECK */
1052 value
= (void *) realloc (ptr
, size
);
1054 #ifdef GC_MALLOC_CHECK
1055 dont_register_blocks
= 0;
1058 struct mem_node
*m
= mem_find (value
);
1061 fprintf (stderr
, "Realloc returns memory that is already in use\n");
1065 /* Can't handle zero size regions in the red-black tree. */
1066 mem_insert (value
, (char *) value
+ max (size
, 1), MEM_TYPE_NON_LISP
);
1069 /* fprintf (stderr, "%p <- realloc\n", value); */
1070 #endif /* GC_MALLOC_CHECK */
1072 __realloc_hook
= emacs_blocked_realloc
;
1079 /* Called from main to set up malloc to use our hooks. */
1082 uninterrupt_malloc ()
1084 if (__free_hook
!= emacs_blocked_free
)
1085 old_free_hook
= __free_hook
;
1086 __free_hook
= emacs_blocked_free
;
1088 if (__malloc_hook
!= emacs_blocked_malloc
)
1089 old_malloc_hook
= __malloc_hook
;
1090 __malloc_hook
= emacs_blocked_malloc
;
1092 if (__realloc_hook
!= emacs_blocked_realloc
)
1093 old_realloc_hook
= __realloc_hook
;
1094 __realloc_hook
= emacs_blocked_realloc
;
1097 #endif /* not SYSTEM_MALLOC */
1101 /***********************************************************************
1103 ***********************************************************************/
1105 /* Number of intervals allocated in an interval_block structure.
1106 The 1020 is 1024 minus malloc overhead. */
1108 #define INTERVAL_BLOCK_SIZE \
1109 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
1111 /* Intervals are allocated in chunks in form of an interval_block
1114 struct interval_block
1116 /* Place `intervals' first, to preserve alignment. */
1117 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
1118 struct interval_block
*next
;
1121 /* Current interval block. Its `next' pointer points to older
1124 struct interval_block
*interval_block
;
1126 /* Index in interval_block above of the next unused interval
1129 static int interval_block_index
;
1131 /* Number of free and live intervals. */
1133 static int total_free_intervals
, total_intervals
;
1135 /* List of free intervals. */
1137 INTERVAL interval_free_list
;
1139 /* Total number of interval blocks now in use. */
1141 int n_interval_blocks
;
1144 /* Initialize interval allocation. */
1149 interval_block
= NULL
;
1150 interval_block_index
= INTERVAL_BLOCK_SIZE
;
1151 interval_free_list
= 0;
1152 n_interval_blocks
= 0;
1156 /* Return a new interval. */
1163 if (interval_free_list
)
1165 val
= interval_free_list
;
1166 interval_free_list
= INTERVAL_PARENT (interval_free_list
);
1170 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
1172 register struct interval_block
*newi
;
1174 newi
= (struct interval_block
*) lisp_malloc (sizeof *newi
,
1177 newi
->next
= interval_block
;
1178 interval_block
= newi
;
1179 interval_block_index
= 0;
1180 n_interval_blocks
++;
1182 val
= &interval_block
->intervals
[interval_block_index
++];
1184 consing_since_gc
+= sizeof (struct interval
);
1186 RESET_INTERVAL (val
);
1192 /* Mark Lisp objects in interval I. */
1195 mark_interval (i
, dummy
)
1196 register INTERVAL i
;
1199 eassert (!i
->gcmarkbit
); /* Intervals are never shared. */
1201 mark_object (i
->plist
);
1205 /* Mark the interval tree rooted in TREE. Don't call this directly;
1206 use the macro MARK_INTERVAL_TREE instead. */
1209 mark_interval_tree (tree
)
1210 register INTERVAL tree
;
1212 /* No need to test if this tree has been marked already; this
1213 function is always called through the MARK_INTERVAL_TREE macro,
1214 which takes care of that. */
1216 traverse_intervals_noorder (tree
, mark_interval
, Qnil
);
1220 /* Mark the interval tree rooted in I. */
1222 #define MARK_INTERVAL_TREE(i) \
1224 if (!NULL_INTERVAL_P (i) && !i->gcmarkbit) \
1225 mark_interval_tree (i); \
1229 #define UNMARK_BALANCE_INTERVALS(i) \
1231 if (! NULL_INTERVAL_P (i)) \
1232 (i) = balance_intervals (i); \
1236 /* Number support. If NO_UNION_TYPE isn't in effect, we
1237 can't create number objects in macros. */
1245 obj
.s
.type
= Lisp_Int
;
1250 /***********************************************************************
1252 ***********************************************************************/
1254 /* Lisp_Strings are allocated in string_block structures. When a new
1255 string_block is allocated, all the Lisp_Strings it contains are
1256 added to a free-list string_free_list. When a new Lisp_String is
1257 needed, it is taken from that list. During the sweep phase of GC,
1258 string_blocks that are entirely free are freed, except two which
1261 String data is allocated from sblock structures. Strings larger
1262 than LARGE_STRING_BYTES, get their own sblock, data for smaller
1263 strings is sub-allocated out of sblocks of size SBLOCK_SIZE.
1265 Sblocks consist internally of sdata structures, one for each
1266 Lisp_String. The sdata structure points to the Lisp_String it
1267 belongs to. The Lisp_String points back to the `u.data' member of
1268 its sdata structure.
1270 When a Lisp_String is freed during GC, it is put back on
1271 string_free_list, and its `data' member and its sdata's `string'
1272 pointer is set to null. The size of the string is recorded in the
1273 `u.nbytes' member of the sdata. So, sdata structures that are no
1274 longer used, can be easily recognized, and it's easy to compact the
1275 sblocks of small strings which we do in compact_small_strings. */
1277 /* Size in bytes of an sblock structure used for small strings. This
1278 is 8192 minus malloc overhead. */
1280 #define SBLOCK_SIZE 8188
1282 /* Strings larger than this are considered large strings. String data
1283 for large strings is allocated from individual sblocks. */
1285 #define LARGE_STRING_BYTES 1024
1287 /* Structure describing string memory sub-allocated from an sblock.
1288 This is where the contents of Lisp strings are stored. */
1292 /* Back-pointer to the string this sdata belongs to. If null, this
1293 structure is free, and the NBYTES member of the union below
1294 contains the string's byte size (the same value that STRING_BYTES
1295 would return if STRING were non-null). If non-null, STRING_BYTES
1296 (STRING) is the size of the data, and DATA contains the string's
1298 struct Lisp_String
*string
;
1300 #ifdef GC_CHECK_STRING_BYTES
1303 unsigned char data
[1];
1305 #define SDATA_NBYTES(S) (S)->nbytes
1306 #define SDATA_DATA(S) (S)->data
1308 #else /* not GC_CHECK_STRING_BYTES */
1312 /* When STRING in non-null. */
1313 unsigned char data
[1];
1315 /* When STRING is null. */
1320 #define SDATA_NBYTES(S) (S)->u.nbytes
1321 #define SDATA_DATA(S) (S)->u.data
1323 #endif /* not GC_CHECK_STRING_BYTES */
1327 /* Structure describing a block of memory which is sub-allocated to
1328 obtain string data memory for strings. Blocks for small strings
1329 are of fixed size SBLOCK_SIZE. Blocks for large strings are made
1330 as large as needed. */
1335 struct sblock
*next
;
1337 /* Pointer to the next free sdata block. This points past the end
1338 of the sblock if there isn't any space left in this block. */
1339 struct sdata
*next_free
;
1341 /* Start of data. */
1342 struct sdata first_data
;
1345 /* Number of Lisp strings in a string_block structure. The 1020 is
1346 1024 minus malloc overhead. */
1348 #define STRING_BLOCK_SIZE \
1349 ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String))
1351 /* Structure describing a block from which Lisp_String structures
1356 /* Place `strings' first, to preserve alignment. */
1357 struct Lisp_String strings
[STRING_BLOCK_SIZE
];
1358 struct string_block
*next
;
1361 /* Head and tail of the list of sblock structures holding Lisp string
1362 data. We always allocate from current_sblock. The NEXT pointers
1363 in the sblock structures go from oldest_sblock to current_sblock. */
1365 static struct sblock
*oldest_sblock
, *current_sblock
;
1367 /* List of sblocks for large strings. */
1369 static struct sblock
*large_sblocks
;
1371 /* List of string_block structures, and how many there are. */
1373 static struct string_block
*string_blocks
;
1374 static int n_string_blocks
;
1376 /* Free-list of Lisp_Strings. */
1378 static struct Lisp_String
*string_free_list
;
1380 /* Number of live and free Lisp_Strings. */
1382 static int total_strings
, total_free_strings
;
1384 /* Number of bytes used by live strings. */
1386 static int total_string_size
;
1388 /* Given a pointer to a Lisp_String S which is on the free-list
1389 string_free_list, return a pointer to its successor in the
1392 #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S))
1394 /* Return a pointer to the sdata structure belonging to Lisp string S.
1395 S must be live, i.e. S->data must not be null. S->data is actually
1396 a pointer to the `u.data' member of its sdata structure; the
1397 structure starts at a constant offset in front of that. */
1399 #ifdef GC_CHECK_STRING_BYTES
1401 #define SDATA_OF_STRING(S) \
1402 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *) \
1403 - sizeof (EMACS_INT)))
1405 #else /* not GC_CHECK_STRING_BYTES */
1407 #define SDATA_OF_STRING(S) \
1408 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *)))
1410 #endif /* not GC_CHECK_STRING_BYTES */
1412 /* Value is the size of an sdata structure large enough to hold NBYTES
1413 bytes of string data. The value returned includes a terminating
1414 NUL byte, the size of the sdata structure, and padding. */
1416 #ifdef GC_CHECK_STRING_BYTES
1418 #define SDATA_SIZE(NBYTES) \
1419 ((sizeof (struct Lisp_String *) \
1421 + sizeof (EMACS_INT) \
1422 + sizeof (EMACS_INT) - 1) \
1423 & ~(sizeof (EMACS_INT) - 1))
1425 #else /* not GC_CHECK_STRING_BYTES */
1427 #define SDATA_SIZE(NBYTES) \
1428 ((sizeof (struct Lisp_String *) \
1430 + sizeof (EMACS_INT) - 1) \
1431 & ~(sizeof (EMACS_INT) - 1))
1433 #endif /* not GC_CHECK_STRING_BYTES */
1435 /* Initialize string allocation. Called from init_alloc_once. */
1440 total_strings
= total_free_strings
= total_string_size
= 0;
1441 oldest_sblock
= current_sblock
= large_sblocks
= NULL
;
1442 string_blocks
= NULL
;
1443 n_string_blocks
= 0;
1444 string_free_list
= NULL
;
1448 #ifdef GC_CHECK_STRING_BYTES
1450 static int check_string_bytes_count
;
1452 void check_string_bytes
P_ ((int));
1453 void check_sblock
P_ ((struct sblock
*));
1455 #define CHECK_STRING_BYTES(S) STRING_BYTES (S)
1458 /* Like GC_STRING_BYTES, but with debugging check. */
1462 struct Lisp_String
*s
;
1464 int nbytes
= (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1465 if (!PURE_POINTER_P (s
)
1467 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1472 /* Check validity of Lisp strings' string_bytes member in B. */
1478 struct sdata
*from
, *end
, *from_end
;
1482 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1484 /* Compute the next FROM here because copying below may
1485 overwrite data we need to compute it. */
1488 /* Check that the string size recorded in the string is the
1489 same as the one recorded in the sdata structure. */
1491 CHECK_STRING_BYTES (from
->string
);
1494 nbytes
= GC_STRING_BYTES (from
->string
);
1496 nbytes
= SDATA_NBYTES (from
);
1498 nbytes
= SDATA_SIZE (nbytes
);
1499 from_end
= (struct sdata
*) ((char *) from
+ nbytes
);
1504 /* Check validity of Lisp strings' string_bytes member. ALL_P
1505 non-zero means check all strings, otherwise check only most
1506 recently allocated strings. Used for hunting a bug. */
1509 check_string_bytes (all_p
)
1516 for (b
= large_sblocks
; b
; b
= b
->next
)
1518 struct Lisp_String
*s
= b
->first_data
.string
;
1520 CHECK_STRING_BYTES (s
);
1523 for (b
= oldest_sblock
; b
; b
= b
->next
)
1527 check_sblock (current_sblock
);
1530 #endif /* GC_CHECK_STRING_BYTES */
1533 /* Return a new Lisp_String. */
1535 static struct Lisp_String
*
1538 struct Lisp_String
*s
;
1540 /* If the free-list is empty, allocate a new string_block, and
1541 add all the Lisp_Strings in it to the free-list. */
1542 if (string_free_list
== NULL
)
1544 struct string_block
*b
;
1547 b
= (struct string_block
*) lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1548 bzero (b
, sizeof *b
);
1549 b
->next
= string_blocks
;
1553 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1556 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1557 string_free_list
= s
;
1560 total_free_strings
+= STRING_BLOCK_SIZE
;
1563 /* Pop a Lisp_String off the free-list. */
1564 s
= string_free_list
;
1565 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1567 /* Probably not strictly necessary, but play it safe. */
1568 bzero (s
, sizeof *s
);
1570 --total_free_strings
;
1573 consing_since_gc
+= sizeof *s
;
1575 #ifdef GC_CHECK_STRING_BYTES
1582 if (++check_string_bytes_count
== 200)
1584 check_string_bytes_count
= 0;
1585 check_string_bytes (1);
1588 check_string_bytes (0);
1590 #endif /* GC_CHECK_STRING_BYTES */
1596 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1597 plus a NUL byte at the end. Allocate an sdata structure for S, and
1598 set S->data to its `u.data' member. Store a NUL byte at the end of
1599 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1600 S->data if it was initially non-null. */
1603 allocate_string_data (s
, nchars
, nbytes
)
1604 struct Lisp_String
*s
;
1607 struct sdata
*data
, *old_data
;
1609 int needed
, old_nbytes
;
1611 /* Determine the number of bytes needed to store NBYTES bytes
1613 needed
= SDATA_SIZE (nbytes
);
1615 if (nbytes
> LARGE_STRING_BYTES
)
1617 size_t size
= sizeof *b
- sizeof (struct sdata
) + needed
;
1619 #ifdef DOUG_LEA_MALLOC
1620 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1621 because mapped region contents are not preserved in
1624 In case you think of allowing it in a dumped Emacs at the
1625 cost of not being able to re-dump, there's another reason:
1626 mmap'ed data typically have an address towards the top of the
1627 address space, which won't fit into an EMACS_INT (at least on
1628 32-bit systems with the current tagging scheme). --fx */
1629 mallopt (M_MMAP_MAX
, 0);
1632 b
= (struct sblock
*) lisp_malloc (size
, MEM_TYPE_NON_LISP
);
1634 #ifdef DOUG_LEA_MALLOC
1635 /* Back to a reasonable maximum of mmap'ed areas. */
1636 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1639 b
->next_free
= &b
->first_data
;
1640 b
->first_data
.string
= NULL
;
1641 b
->next
= large_sblocks
;
1644 else if (current_sblock
== NULL
1645 || (((char *) current_sblock
+ SBLOCK_SIZE
1646 - (char *) current_sblock
->next_free
)
1649 /* Not enough room in the current sblock. */
1650 b
= (struct sblock
*) lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
1651 b
->next_free
= &b
->first_data
;
1652 b
->first_data
.string
= NULL
;
1656 current_sblock
->next
= b
;
1664 old_data
= s
->data
? SDATA_OF_STRING (s
) : NULL
;
1665 old_nbytes
= GC_STRING_BYTES (s
);
1667 data
= b
->next_free
;
1669 s
->data
= SDATA_DATA (data
);
1670 #ifdef GC_CHECK_STRING_BYTES
1671 SDATA_NBYTES (data
) = nbytes
;
1674 s
->size_byte
= nbytes
;
1675 s
->data
[nbytes
] = '\0';
1676 b
->next_free
= (struct sdata
*) ((char *) data
+ needed
);
1678 /* If S had already data assigned, mark that as free by setting its
1679 string back-pointer to null, and recording the size of the data
1683 SDATA_NBYTES (old_data
) = old_nbytes
;
1684 old_data
->string
= NULL
;
1687 consing_since_gc
+= needed
;
1691 /* Sweep and compact strings. */
1696 struct string_block
*b
, *next
;
1697 struct string_block
*live_blocks
= NULL
;
1699 string_free_list
= NULL
;
1700 total_strings
= total_free_strings
= 0;
1701 total_string_size
= 0;
1703 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
1704 for (b
= string_blocks
; b
; b
= next
)
1707 struct Lisp_String
*free_list_before
= string_free_list
;
1711 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
1713 struct Lisp_String
*s
= b
->strings
+ i
;
1717 /* String was not on free-list before. */
1718 if (STRING_MARKED_P (s
))
1720 /* String is live; unmark it and its intervals. */
1723 if (!NULL_INTERVAL_P (s
->intervals
))
1724 UNMARK_BALANCE_INTERVALS (s
->intervals
);
1727 total_string_size
+= STRING_BYTES (s
);
1731 /* String is dead. Put it on the free-list. */
1732 struct sdata
*data
= SDATA_OF_STRING (s
);
1734 /* Save the size of S in its sdata so that we know
1735 how large that is. Reset the sdata's string
1736 back-pointer so that we know it's free. */
1737 #ifdef GC_CHECK_STRING_BYTES
1738 if (GC_STRING_BYTES (s
) != SDATA_NBYTES (data
))
1741 data
->u
.nbytes
= GC_STRING_BYTES (s
);
1743 data
->string
= NULL
;
1745 /* Reset the strings's `data' member so that we
1749 /* Put the string on the free-list. */
1750 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1751 string_free_list
= s
;
1757 /* S was on the free-list before. Put it there again. */
1758 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1759 string_free_list
= s
;
1764 /* Free blocks that contain free Lisp_Strings only, except
1765 the first two of them. */
1766 if (nfree
== STRING_BLOCK_SIZE
1767 && total_free_strings
> STRING_BLOCK_SIZE
)
1771 string_free_list
= free_list_before
;
1775 total_free_strings
+= nfree
;
1776 b
->next
= live_blocks
;
1781 string_blocks
= live_blocks
;
1782 free_large_strings ();
1783 compact_small_strings ();
1787 /* Free dead large strings. */
1790 free_large_strings ()
1792 struct sblock
*b
, *next
;
1793 struct sblock
*live_blocks
= NULL
;
1795 for (b
= large_sblocks
; b
; b
= next
)
1799 if (b
->first_data
.string
== NULL
)
1803 b
->next
= live_blocks
;
1808 large_sblocks
= live_blocks
;
1812 /* Compact data of small strings. Free sblocks that don't contain
1813 data of live strings after compaction. */
1816 compact_small_strings ()
1818 struct sblock
*b
, *tb
, *next
;
1819 struct sdata
*from
, *to
, *end
, *tb_end
;
1820 struct sdata
*to_end
, *from_end
;
1822 /* TB is the sblock we copy to, TO is the sdata within TB we copy
1823 to, and TB_END is the end of TB. */
1825 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
1826 to
= &tb
->first_data
;
1828 /* Step through the blocks from the oldest to the youngest. We
1829 expect that old blocks will stabilize over time, so that less
1830 copying will happen this way. */
1831 for (b
= oldest_sblock
; b
; b
= b
->next
)
1834 xassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
1836 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1838 /* Compute the next FROM here because copying below may
1839 overwrite data we need to compute it. */
1842 #ifdef GC_CHECK_STRING_BYTES
1843 /* Check that the string size recorded in the string is the
1844 same as the one recorded in the sdata structure. */
1846 && GC_STRING_BYTES (from
->string
) != SDATA_NBYTES (from
))
1848 #endif /* GC_CHECK_STRING_BYTES */
1851 nbytes
= GC_STRING_BYTES (from
->string
);
1853 nbytes
= SDATA_NBYTES (from
);
1855 nbytes
= SDATA_SIZE (nbytes
);
1856 from_end
= (struct sdata
*) ((char *) from
+ nbytes
);
1858 /* FROM->string non-null means it's alive. Copy its data. */
1861 /* If TB is full, proceed with the next sblock. */
1862 to_end
= (struct sdata
*) ((char *) to
+ nbytes
);
1863 if (to_end
> tb_end
)
1867 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
1868 to
= &tb
->first_data
;
1869 to_end
= (struct sdata
*) ((char *) to
+ nbytes
);
1872 /* Copy, and update the string's `data' pointer. */
1875 xassert (tb
!= b
|| to
<= from
);
1876 safe_bcopy ((char *) from
, (char *) to
, nbytes
);
1877 to
->string
->data
= SDATA_DATA (to
);
1880 /* Advance past the sdata we copied to. */
1886 /* The rest of the sblocks following TB don't contain live data, so
1887 we can free them. */
1888 for (b
= tb
->next
; b
; b
= next
)
1896 current_sblock
= tb
;
1900 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
1901 doc
: /* Return a newly created string of length LENGTH, with INIT in each element.
1902 LENGTH must be an integer.
1903 INIT must be an integer that represents a character. */)
1905 Lisp_Object length
, init
;
1907 register Lisp_Object val
;
1908 register unsigned char *p
, *end
;
1911 CHECK_NATNUM (length
);
1912 CHECK_NUMBER (init
);
1915 if (ASCII_CHAR_P (c
))
1917 nbytes
= XINT (length
);
1918 val
= make_uninit_string (nbytes
);
1920 end
= p
+ SCHARS (val
);
1926 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
1927 int len
= CHAR_STRING (c
, str
);
1929 nbytes
= len
* XINT (length
);
1930 val
= make_uninit_multibyte_string (XINT (length
), nbytes
);
1935 bcopy (str
, p
, len
);
1945 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
1946 doc
: /* Return a new bool-vector of length LENGTH, using INIT for as each element.
1947 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
1949 Lisp_Object length
, init
;
1951 register Lisp_Object val
;
1952 struct Lisp_Bool_Vector
*p
;
1954 int length_in_chars
, length_in_elts
, bits_per_value
;
1956 CHECK_NATNUM (length
);
1958 bits_per_value
= sizeof (EMACS_INT
) * BOOL_VECTOR_BITS_PER_CHAR
;
1960 length_in_elts
= (XFASTINT (length
) + bits_per_value
- 1) / bits_per_value
;
1961 length_in_chars
= ((XFASTINT (length
) + BOOL_VECTOR_BITS_PER_CHAR
- 1)
1962 / BOOL_VECTOR_BITS_PER_CHAR
);
1964 /* We must allocate one more elements than LENGTH_IN_ELTS for the
1965 slot `size' of the struct Lisp_Bool_Vector. */
1966 val
= Fmake_vector (make_number (length_in_elts
+ 1), Qnil
);
1967 p
= XBOOL_VECTOR (val
);
1969 /* Get rid of any bits that would cause confusion. */
1971 XSETBOOL_VECTOR (val
, p
);
1972 p
->size
= XFASTINT (length
);
1974 real_init
= (NILP (init
) ? 0 : -1);
1975 for (i
= 0; i
< length_in_chars
; i
++)
1976 p
->data
[i
] = real_init
;
1978 /* Clear the extraneous bits in the last byte. */
1979 if (XINT (length
) != length_in_chars
* BOOL_VECTOR_BITS_PER_CHAR
)
1980 XBOOL_VECTOR (val
)->data
[length_in_chars
- 1]
1981 &= (1 << (XINT (length
) % BOOL_VECTOR_BITS_PER_CHAR
)) - 1;
1987 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
1988 of characters from the contents. This string may be unibyte or
1989 multibyte, depending on the contents. */
1992 make_string (contents
, nbytes
)
1993 const char *contents
;
1996 register Lisp_Object val
;
1997 int nchars
, multibyte_nbytes
;
1999 parse_str_as_multibyte (contents
, nbytes
, &nchars
, &multibyte_nbytes
);
2000 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
2001 /* CONTENTS contains no multibyte sequences or contains an invalid
2002 multibyte sequence. We must make unibyte string. */
2003 val
= make_unibyte_string (contents
, nbytes
);
2005 val
= make_multibyte_string (contents
, nchars
, nbytes
);
2010 /* Make an unibyte string from LENGTH bytes at CONTENTS. */
2013 make_unibyte_string (contents
, length
)
2014 const char *contents
;
2017 register Lisp_Object val
;
2018 val
= make_uninit_string (length
);
2019 bcopy (contents
, SDATA (val
), length
);
2020 STRING_SET_UNIBYTE (val
);
2025 /* Make a multibyte string from NCHARS characters occupying NBYTES
2026 bytes at CONTENTS. */
2029 make_multibyte_string (contents
, nchars
, nbytes
)
2030 const char *contents
;
2033 register Lisp_Object val
;
2034 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2035 bcopy (contents
, SDATA (val
), nbytes
);
2040 /* Make a string from NCHARS characters occupying NBYTES bytes at
2041 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2044 make_string_from_bytes (contents
, nchars
, nbytes
)
2045 const char *contents
;
2048 register Lisp_Object val
;
2049 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2050 bcopy (contents
, SDATA (val
), nbytes
);
2051 if (SBYTES (val
) == SCHARS (val
))
2052 STRING_SET_UNIBYTE (val
);
2057 /* Make a string from NCHARS characters occupying NBYTES bytes at
2058 CONTENTS. The argument MULTIBYTE controls whether to label the
2059 string as multibyte. If NCHARS is negative, it counts the number of
2060 characters by itself. */
2063 make_specified_string (contents
, nchars
, nbytes
, multibyte
)
2064 const char *contents
;
2068 register Lisp_Object val
;
2073 nchars
= multibyte_chars_in_text (contents
, nbytes
);
2077 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2078 bcopy (contents
, SDATA (val
), nbytes
);
2080 STRING_SET_UNIBYTE (val
);
2085 /* Make a string from the data at STR, treating it as multibyte if the
2092 return make_string (str
, strlen (str
));
2096 /* Return an unibyte Lisp_String set up to hold LENGTH characters
2097 occupying LENGTH bytes. */
2100 make_uninit_string (length
)
2104 val
= make_uninit_multibyte_string (length
, length
);
2105 STRING_SET_UNIBYTE (val
);
2110 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2111 which occupy NBYTES bytes. */
2114 make_uninit_multibyte_string (nchars
, nbytes
)
2118 struct Lisp_String
*s
;
2123 s
= allocate_string ();
2124 allocate_string_data (s
, nchars
, nbytes
);
2125 XSETSTRING (string
, s
);
2126 string_chars_consed
+= nbytes
;
2132 /***********************************************************************
2134 ***********************************************************************/
2136 /* We store float cells inside of float_blocks, allocating a new
2137 float_block with malloc whenever necessary. Float cells reclaimed
2138 by GC are put on a free list to be reallocated before allocating
2139 any new float cells from the latest float_block. */
2141 #define FLOAT_BLOCK_SIZE \
2142 (((BLOCK_BYTES - sizeof (struct float_block *) \
2143 /* The compiler might add padding at the end. */ \
2144 - (sizeof (struct Lisp_Float) - sizeof (int))) * CHAR_BIT) \
2145 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2147 #define GETMARKBIT(block,n) \
2148 (((block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2149 >> ((n) % (sizeof(int) * CHAR_BIT))) \
2152 #define SETMARKBIT(block,n) \
2153 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2154 |= 1 << ((n) % (sizeof(int) * CHAR_BIT))
2156 #define UNSETMARKBIT(block,n) \
2157 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2158 &= ~(1 << ((n) % (sizeof(int) * CHAR_BIT)))
2160 #define FLOAT_BLOCK(fptr) \
2161 ((struct float_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2163 #define FLOAT_INDEX(fptr) \
2164 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2168 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2169 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2170 int gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2171 struct float_block
*next
;
2174 #define FLOAT_MARKED_P(fptr) \
2175 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2177 #define FLOAT_MARK(fptr) \
2178 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2180 #define FLOAT_UNMARK(fptr) \
2181 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2183 /* Current float_block. */
2185 struct float_block
*float_block
;
2187 /* Index of first unused Lisp_Float in the current float_block. */
2189 int float_block_index
;
2191 /* Total number of float blocks now in use. */
2195 /* Free-list of Lisp_Floats. */
2197 struct Lisp_Float
*float_free_list
;
2200 /* Initialize float allocation. */
2206 float_block_index
= FLOAT_BLOCK_SIZE
; /* Force alloc of new float_block. */
2207 float_free_list
= 0;
2212 /* Explicitly free a float cell by putting it on the free-list. */
2216 struct Lisp_Float
*ptr
;
2218 *(struct Lisp_Float
**)&ptr
->data
= float_free_list
;
2219 float_free_list
= ptr
;
2223 /* Return a new float object with value FLOAT_VALUE. */
2226 make_float (float_value
)
2229 register Lisp_Object val
;
2231 if (float_free_list
)
2233 /* We use the data field for chaining the free list
2234 so that we won't use the same field that has the mark bit. */
2235 XSETFLOAT (val
, float_free_list
);
2236 float_free_list
= *(struct Lisp_Float
**)&float_free_list
->data
;
2240 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2242 register struct float_block
*new;
2244 new = (struct float_block
*) lisp_align_malloc (sizeof *new,
2246 new->next
= float_block
;
2247 bzero ((char *) new->gcmarkbits
, sizeof new->gcmarkbits
);
2249 float_block_index
= 0;
2252 XSETFLOAT (val
, &float_block
->floats
[float_block_index
]);
2253 float_block_index
++;
2256 XFLOAT_DATA (val
) = float_value
;
2257 eassert (!FLOAT_MARKED_P (XFLOAT (val
)));
2258 consing_since_gc
+= sizeof (struct Lisp_Float
);
2265 /***********************************************************************
2267 ***********************************************************************/
2269 /* We store cons cells inside of cons_blocks, allocating a new
2270 cons_block with malloc whenever necessary. Cons cells reclaimed by
2271 GC are put on a free list to be reallocated before allocating
2272 any new cons cells from the latest cons_block. */
2274 #define CONS_BLOCK_SIZE \
2275 (((BLOCK_BYTES - sizeof (struct cons_block *)) * CHAR_BIT) \
2276 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2278 #define CONS_BLOCK(fptr) \
2279 ((struct cons_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2281 #define CONS_INDEX(fptr) \
2282 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2286 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2287 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2288 int gcmarkbits
[1 + CONS_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2289 struct cons_block
*next
;
2292 #define CONS_MARKED_P(fptr) \
2293 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2295 #define CONS_MARK(fptr) \
2296 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2298 #define CONS_UNMARK(fptr) \
2299 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2301 /* Current cons_block. */
2303 struct cons_block
*cons_block
;
2305 /* Index of first unused Lisp_Cons in the current block. */
2307 int cons_block_index
;
2309 /* Free-list of Lisp_Cons structures. */
2311 struct Lisp_Cons
*cons_free_list
;
2313 /* Total number of cons blocks now in use. */
2318 /* Initialize cons allocation. */
2324 cons_block_index
= CONS_BLOCK_SIZE
; /* Force alloc of new cons_block. */
2330 /* Explicitly free a cons cell by putting it on the free-list. */
2334 struct Lisp_Cons
*ptr
;
2336 *(struct Lisp_Cons
**)&ptr
->cdr
= cons_free_list
;
2340 cons_free_list
= ptr
;
2343 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
2344 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2346 Lisp_Object car
, cdr
;
2348 register Lisp_Object val
;
2352 /* We use the cdr for chaining the free list
2353 so that we won't use the same field that has the mark bit. */
2354 XSETCONS (val
, cons_free_list
);
2355 cons_free_list
= *(struct Lisp_Cons
**)&cons_free_list
->cdr
;
2359 if (cons_block_index
== CONS_BLOCK_SIZE
)
2361 register struct cons_block
*new;
2362 new = (struct cons_block
*) lisp_align_malloc (sizeof *new,
2364 bzero ((char *) new->gcmarkbits
, sizeof new->gcmarkbits
);
2365 new->next
= cons_block
;
2367 cons_block_index
= 0;
2370 XSETCONS (val
, &cons_block
->conses
[cons_block_index
]);
2376 eassert (!CONS_MARKED_P (XCONS (val
)));
2377 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2378 cons_cells_consed
++;
2383 /* Make a list of 2, 3, 4 or 5 specified objects. */
2387 Lisp_Object arg1
, arg2
;
2389 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2394 list3 (arg1
, arg2
, arg3
)
2395 Lisp_Object arg1
, arg2
, arg3
;
2397 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2402 list4 (arg1
, arg2
, arg3
, arg4
)
2403 Lisp_Object arg1
, arg2
, arg3
, arg4
;
2405 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2410 list5 (arg1
, arg2
, arg3
, arg4
, arg5
)
2411 Lisp_Object arg1
, arg2
, arg3
, arg4
, arg5
;
2413 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2414 Fcons (arg5
, Qnil
)))));
2418 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
2419 doc
: /* Return a newly created list with specified arguments as elements.
2420 Any number of arguments, even zero arguments, are allowed.
2421 usage: (list &rest OBJECTS) */)
2424 register Lisp_Object
*args
;
2426 register Lisp_Object val
;
2432 val
= Fcons (args
[nargs
], val
);
2438 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2439 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2441 register Lisp_Object length
, init
;
2443 register Lisp_Object val
;
2446 CHECK_NATNUM (length
);
2447 size
= XFASTINT (length
);
2452 val
= Fcons (init
, val
);
2457 val
= Fcons (init
, val
);
2462 val
= Fcons (init
, val
);
2467 val
= Fcons (init
, val
);
2472 val
= Fcons (init
, val
);
2487 /***********************************************************************
2489 ***********************************************************************/
2491 /* Singly-linked list of all vectors. */
2493 struct Lisp_Vector
*all_vectors
;
2495 /* Total number of vector-like objects now in use. */
2500 /* Value is a pointer to a newly allocated Lisp_Vector structure
2501 with room for LEN Lisp_Objects. */
2503 static struct Lisp_Vector
*
2504 allocate_vectorlike (len
, type
)
2508 struct Lisp_Vector
*p
;
2511 #ifdef DOUG_LEA_MALLOC
2512 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
2513 because mapped region contents are not preserved in
2516 mallopt (M_MMAP_MAX
, 0);
2520 nbytes
= sizeof *p
+ (len
- 1) * sizeof p
->contents
[0];
2521 p
= (struct Lisp_Vector
*) lisp_malloc (nbytes
, type
);
2523 #ifdef DOUG_LEA_MALLOC
2524 /* Back to a reasonable maximum of mmap'ed areas. */
2526 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2530 consing_since_gc
+= nbytes
;
2531 vector_cells_consed
+= len
;
2533 p
->next
= all_vectors
;
2540 /* Allocate a vector with NSLOTS slots. */
2542 struct Lisp_Vector
*
2543 allocate_vector (nslots
)
2546 struct Lisp_Vector
*v
= allocate_vectorlike (nslots
, MEM_TYPE_VECTOR
);
2552 /* Allocate other vector-like structures. */
2554 struct Lisp_Hash_Table
*
2555 allocate_hash_table ()
2557 EMACS_INT len
= VECSIZE (struct Lisp_Hash_Table
);
2558 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_HASH_TABLE
);
2562 for (i
= 0; i
< len
; ++i
)
2563 v
->contents
[i
] = Qnil
;
2565 return (struct Lisp_Hash_Table
*) v
;
2572 EMACS_INT len
= VECSIZE (struct window
);
2573 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_WINDOW
);
2576 for (i
= 0; i
< len
; ++i
)
2577 v
->contents
[i
] = Qnil
;
2580 return (struct window
*) v
;
2587 EMACS_INT len
= VECSIZE (struct frame
);
2588 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_FRAME
);
2591 for (i
= 0; i
< len
; ++i
)
2592 v
->contents
[i
] = make_number (0);
2594 return (struct frame
*) v
;
2598 struct Lisp_Process
*
2601 EMACS_INT len
= VECSIZE (struct Lisp_Process
);
2602 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_PROCESS
);
2605 for (i
= 0; i
< len
; ++i
)
2606 v
->contents
[i
] = Qnil
;
2609 return (struct Lisp_Process
*) v
;
2613 struct Lisp_Vector
*
2614 allocate_other_vector (len
)
2617 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_VECTOR
);
2620 for (i
= 0; i
< len
; ++i
)
2621 v
->contents
[i
] = Qnil
;
2628 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
2629 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
2630 See also the function `vector'. */)
2632 register Lisp_Object length
, init
;
2635 register EMACS_INT sizei
;
2637 register struct Lisp_Vector
*p
;
2639 CHECK_NATNUM (length
);
2640 sizei
= XFASTINT (length
);
2642 p
= allocate_vector (sizei
);
2643 for (index
= 0; index
< sizei
; index
++)
2644 p
->contents
[index
] = init
;
2646 XSETVECTOR (vector
, p
);
2651 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
2652 doc
: /* Return a newly created vector with specified arguments as elements.
2653 Any number of arguments, even zero arguments, are allowed.
2654 usage: (vector &rest OBJECTS) */)
2659 register Lisp_Object len
, val
;
2661 register struct Lisp_Vector
*p
;
2663 XSETFASTINT (len
, nargs
);
2664 val
= Fmake_vector (len
, Qnil
);
2666 for (index
= 0; index
< nargs
; index
++)
2667 p
->contents
[index
] = args
[index
];
2672 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
2673 doc
: /* Create a byte-code object with specified arguments as elements.
2674 The arguments should be the arglist, bytecode-string, constant vector,
2675 stack size, (optional) doc string, and (optional) interactive spec.
2676 The first four arguments are required; at most six have any
2678 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
2683 register Lisp_Object len
, val
;
2685 register struct Lisp_Vector
*p
;
2687 XSETFASTINT (len
, nargs
);
2688 if (!NILP (Vpurify_flag
))
2689 val
= make_pure_vector ((EMACS_INT
) nargs
);
2691 val
= Fmake_vector (len
, Qnil
);
2693 if (STRINGP (args
[1]) && STRING_MULTIBYTE (args
[1]))
2694 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
2695 earlier because they produced a raw 8-bit string for byte-code
2696 and now such a byte-code string is loaded as multibyte while
2697 raw 8-bit characters converted to multibyte form. Thus, now we
2698 must convert them back to the original unibyte form. */
2699 args
[1] = Fstring_as_unibyte (args
[1]);
2702 for (index
= 0; index
< nargs
; index
++)
2704 if (!NILP (Vpurify_flag
))
2705 args
[index
] = Fpurecopy (args
[index
]);
2706 p
->contents
[index
] = args
[index
];
2708 XSETCOMPILED (val
, p
);
2714 /***********************************************************************
2716 ***********************************************************************/
2718 /* Each symbol_block is just under 1020 bytes long, since malloc
2719 really allocates in units of powers of two and uses 4 bytes for its
2722 #define SYMBOL_BLOCK_SIZE \
2723 ((1020 - sizeof (struct symbol_block *)) / sizeof (struct Lisp_Symbol))
2727 /* Place `symbols' first, to preserve alignment. */
2728 struct Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
2729 struct symbol_block
*next
;
2732 /* Current symbol block and index of first unused Lisp_Symbol
2735 struct symbol_block
*symbol_block
;
2736 int symbol_block_index
;
2738 /* List of free symbols. */
2740 struct Lisp_Symbol
*symbol_free_list
;
2742 /* Total number of symbol blocks now in use. */
2744 int n_symbol_blocks
;
2747 /* Initialize symbol allocation. */
2752 symbol_block
= NULL
;
2753 symbol_block_index
= SYMBOL_BLOCK_SIZE
;
2754 symbol_free_list
= 0;
2755 n_symbol_blocks
= 0;
2759 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
2760 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
2761 Its value and function definition are void, and its property list is nil. */)
2765 register Lisp_Object val
;
2766 register struct Lisp_Symbol
*p
;
2768 CHECK_STRING (name
);
2770 if (symbol_free_list
)
2772 XSETSYMBOL (val
, symbol_free_list
);
2773 symbol_free_list
= *(struct Lisp_Symbol
**)&symbol_free_list
->value
;
2777 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
2779 struct symbol_block
*new;
2780 new = (struct symbol_block
*) lisp_malloc (sizeof *new,
2782 new->next
= symbol_block
;
2784 symbol_block_index
= 0;
2787 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
]);
2788 symbol_block_index
++;
2794 p
->value
= Qunbound
;
2795 p
->function
= Qunbound
;
2798 p
->interned
= SYMBOL_UNINTERNED
;
2800 p
->indirect_variable
= 0;
2801 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
2808 /***********************************************************************
2809 Marker (Misc) Allocation
2810 ***********************************************************************/
2812 /* Allocation of markers and other objects that share that structure.
2813 Works like allocation of conses. */
2815 #define MARKER_BLOCK_SIZE \
2816 ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc))
2820 /* Place `markers' first, to preserve alignment. */
2821 union Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
2822 struct marker_block
*next
;
2825 struct marker_block
*marker_block
;
2826 int marker_block_index
;
2828 union Lisp_Misc
*marker_free_list
;
2830 /* Total number of marker blocks now in use. */
2832 int n_marker_blocks
;
2837 marker_block
= NULL
;
2838 marker_block_index
= MARKER_BLOCK_SIZE
;
2839 marker_free_list
= 0;
2840 n_marker_blocks
= 0;
2843 /* Return a newly allocated Lisp_Misc object, with no substructure. */
2850 if (marker_free_list
)
2852 XSETMISC (val
, marker_free_list
);
2853 marker_free_list
= marker_free_list
->u_free
.chain
;
2857 if (marker_block_index
== MARKER_BLOCK_SIZE
)
2859 struct marker_block
*new;
2860 new = (struct marker_block
*) lisp_malloc (sizeof *new,
2862 new->next
= marker_block
;
2864 marker_block_index
= 0;
2867 XSETMISC (val
, &marker_block
->markers
[marker_block_index
]);
2868 marker_block_index
++;
2871 consing_since_gc
+= sizeof (union Lisp_Misc
);
2872 misc_objects_consed
++;
2873 XMARKER (val
)->gcmarkbit
= 0;
2877 /* Return a Lisp_Misc_Save_Value object containing POINTER and
2878 INTEGER. This is used to package C values to call record_unwind_protect.
2879 The unwind function can get the C values back using XSAVE_VALUE. */
2882 make_save_value (pointer
, integer
)
2886 register Lisp_Object val
;
2887 register struct Lisp_Save_Value
*p
;
2889 val
= allocate_misc ();
2890 XMISCTYPE (val
) = Lisp_Misc_Save_Value
;
2891 p
= XSAVE_VALUE (val
);
2892 p
->pointer
= pointer
;
2893 p
->integer
= integer
;
2897 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
2898 doc
: /* Return a newly allocated marker which does not point at any place. */)
2901 register Lisp_Object val
;
2902 register struct Lisp_Marker
*p
;
2904 val
= allocate_misc ();
2905 XMISCTYPE (val
) = Lisp_Misc_Marker
;
2911 p
->insertion_type
= 0;
2915 /* Put MARKER back on the free list after using it temporarily. */
2918 free_marker (marker
)
2921 unchain_marker (XMARKER (marker
));
2923 XMISC (marker
)->u_marker
.type
= Lisp_Misc_Free
;
2924 XMISC (marker
)->u_free
.chain
= marker_free_list
;
2925 marker_free_list
= XMISC (marker
);
2927 total_free_markers
++;
2931 /* Return a newly created vector or string with specified arguments as
2932 elements. If all the arguments are characters that can fit
2933 in a string of events, make a string; otherwise, make a vector.
2935 Any number of arguments, even zero arguments, are allowed. */
2938 make_event_array (nargs
, args
)
2944 for (i
= 0; i
< nargs
; i
++)
2945 /* The things that fit in a string
2946 are characters that are in 0...127,
2947 after discarding the meta bit and all the bits above it. */
2948 if (!INTEGERP (args
[i
])
2949 || (XUINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
2950 return Fvector (nargs
, args
);
2952 /* Since the loop exited, we know that all the things in it are
2953 characters, so we can make a string. */
2957 result
= Fmake_string (make_number (nargs
), make_number (0));
2958 for (i
= 0; i
< nargs
; i
++)
2960 SSET (result
, i
, XINT (args
[i
]));
2961 /* Move the meta bit to the right place for a string char. */
2962 if (XINT (args
[i
]) & CHAR_META
)
2963 SSET (result
, i
, SREF (result
, i
) | 0x80);
2972 /************************************************************************
2974 ************************************************************************/
2976 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
2978 /* Conservative C stack marking requires a method to identify possibly
2979 live Lisp objects given a pointer value. We do this by keeping
2980 track of blocks of Lisp data that are allocated in a red-black tree
2981 (see also the comment of mem_node which is the type of nodes in
2982 that tree). Function lisp_malloc adds information for an allocated
2983 block to the red-black tree with calls to mem_insert, and function
2984 lisp_free removes it with mem_delete. Functions live_string_p etc
2985 call mem_find to lookup information about a given pointer in the
2986 tree, and use that to determine if the pointer points to a Lisp
2989 /* Initialize this part of alloc.c. */
2994 mem_z
.left
= mem_z
.right
= MEM_NIL
;
2995 mem_z
.parent
= NULL
;
2996 mem_z
.color
= MEM_BLACK
;
2997 mem_z
.start
= mem_z
.end
= NULL
;
3002 /* Value is a pointer to the mem_node containing START. Value is
3003 MEM_NIL if there is no node in the tree containing START. */
3005 static INLINE
struct mem_node
*
3011 if (start
< min_heap_address
|| start
> max_heap_address
)
3014 /* Make the search always successful to speed up the loop below. */
3015 mem_z
.start
= start
;
3016 mem_z
.end
= (char *) start
+ 1;
3019 while (start
< p
->start
|| start
>= p
->end
)
3020 p
= start
< p
->start
? p
->left
: p
->right
;
3025 /* Insert a new node into the tree for a block of memory with start
3026 address START, end address END, and type TYPE. Value is a
3027 pointer to the node that was inserted. */
3029 static struct mem_node
*
3030 mem_insert (start
, end
, type
)
3034 struct mem_node
*c
, *parent
, *x
;
3036 if (start
< min_heap_address
)
3037 min_heap_address
= start
;
3038 if (end
> max_heap_address
)
3039 max_heap_address
= end
;
3041 /* See where in the tree a node for START belongs. In this
3042 particular application, it shouldn't happen that a node is already
3043 present. For debugging purposes, let's check that. */
3047 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3049 while (c
!= MEM_NIL
)
3051 if (start
>= c
->start
&& start
< c
->end
)
3054 c
= start
< c
->start
? c
->left
: c
->right
;
3057 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3059 while (c
!= MEM_NIL
)
3062 c
= start
< c
->start
? c
->left
: c
->right
;
3065 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3067 /* Create a new node. */
3068 #ifdef GC_MALLOC_CHECK
3069 x
= (struct mem_node
*) _malloc_internal (sizeof *x
);
3073 x
= (struct mem_node
*) xmalloc (sizeof *x
);
3079 x
->left
= x
->right
= MEM_NIL
;
3082 /* Insert it as child of PARENT or install it as root. */
3085 if (start
< parent
->start
)
3093 /* Re-establish red-black tree properties. */
3094 mem_insert_fixup (x
);
3100 /* Re-establish the red-black properties of the tree, and thereby
3101 balance the tree, after node X has been inserted; X is always red. */
3104 mem_insert_fixup (x
)
3107 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3109 /* X is red and its parent is red. This is a violation of
3110 red-black tree property #3. */
3112 if (x
->parent
== x
->parent
->parent
->left
)
3114 /* We're on the left side of our grandparent, and Y is our
3116 struct mem_node
*y
= x
->parent
->parent
->right
;
3118 if (y
->color
== MEM_RED
)
3120 /* Uncle and parent are red but should be black because
3121 X is red. Change the colors accordingly and proceed
3122 with the grandparent. */
3123 x
->parent
->color
= MEM_BLACK
;
3124 y
->color
= MEM_BLACK
;
3125 x
->parent
->parent
->color
= MEM_RED
;
3126 x
= x
->parent
->parent
;
3130 /* Parent and uncle have different colors; parent is
3131 red, uncle is black. */
3132 if (x
== x
->parent
->right
)
3135 mem_rotate_left (x
);
3138 x
->parent
->color
= MEM_BLACK
;
3139 x
->parent
->parent
->color
= MEM_RED
;
3140 mem_rotate_right (x
->parent
->parent
);
3145 /* This is the symmetrical case of above. */
3146 struct mem_node
*y
= x
->parent
->parent
->left
;
3148 if (y
->color
== MEM_RED
)
3150 x
->parent
->color
= MEM_BLACK
;
3151 y
->color
= MEM_BLACK
;
3152 x
->parent
->parent
->color
= MEM_RED
;
3153 x
= x
->parent
->parent
;
3157 if (x
== x
->parent
->left
)
3160 mem_rotate_right (x
);
3163 x
->parent
->color
= MEM_BLACK
;
3164 x
->parent
->parent
->color
= MEM_RED
;
3165 mem_rotate_left (x
->parent
->parent
);
3170 /* The root may have been changed to red due to the algorithm. Set
3171 it to black so that property #5 is satisfied. */
3172 mem_root
->color
= MEM_BLACK
;
3188 /* Turn y's left sub-tree into x's right sub-tree. */
3191 if (y
->left
!= MEM_NIL
)
3192 y
->left
->parent
= x
;
3194 /* Y's parent was x's parent. */
3196 y
->parent
= x
->parent
;
3198 /* Get the parent to point to y instead of x. */
3201 if (x
== x
->parent
->left
)
3202 x
->parent
->left
= y
;
3204 x
->parent
->right
= y
;
3209 /* Put x on y's left. */
3223 mem_rotate_right (x
)
3226 struct mem_node
*y
= x
->left
;
3229 if (y
->right
!= MEM_NIL
)
3230 y
->right
->parent
= x
;
3233 y
->parent
= x
->parent
;
3236 if (x
== x
->parent
->right
)
3237 x
->parent
->right
= y
;
3239 x
->parent
->left
= y
;
3250 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
3256 struct mem_node
*x
, *y
;
3258 if (!z
|| z
== MEM_NIL
)
3261 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
3266 while (y
->left
!= MEM_NIL
)
3270 if (y
->left
!= MEM_NIL
)
3275 x
->parent
= y
->parent
;
3278 if (y
== y
->parent
->left
)
3279 y
->parent
->left
= x
;
3281 y
->parent
->right
= x
;
3288 z
->start
= y
->start
;
3293 if (y
->color
== MEM_BLACK
)
3294 mem_delete_fixup (x
);
3296 #ifdef GC_MALLOC_CHECK
3304 /* Re-establish the red-black properties of the tree, after a
3308 mem_delete_fixup (x
)
3311 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
3313 if (x
== x
->parent
->left
)
3315 struct mem_node
*w
= x
->parent
->right
;
3317 if (w
->color
== MEM_RED
)
3319 w
->color
= MEM_BLACK
;
3320 x
->parent
->color
= MEM_RED
;
3321 mem_rotate_left (x
->parent
);
3322 w
= x
->parent
->right
;
3325 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
3332 if (w
->right
->color
== MEM_BLACK
)
3334 w
->left
->color
= MEM_BLACK
;
3336 mem_rotate_right (w
);
3337 w
= x
->parent
->right
;
3339 w
->color
= x
->parent
->color
;
3340 x
->parent
->color
= MEM_BLACK
;
3341 w
->right
->color
= MEM_BLACK
;
3342 mem_rotate_left (x
->parent
);
3348 struct mem_node
*w
= x
->parent
->left
;
3350 if (w
->color
== MEM_RED
)
3352 w
->color
= MEM_BLACK
;
3353 x
->parent
->color
= MEM_RED
;
3354 mem_rotate_right (x
->parent
);
3355 w
= x
->parent
->left
;
3358 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
3365 if (w
->left
->color
== MEM_BLACK
)
3367 w
->right
->color
= MEM_BLACK
;
3369 mem_rotate_left (w
);
3370 w
= x
->parent
->left
;
3373 w
->color
= x
->parent
->color
;
3374 x
->parent
->color
= MEM_BLACK
;
3375 w
->left
->color
= MEM_BLACK
;
3376 mem_rotate_right (x
->parent
);
3382 x
->color
= MEM_BLACK
;
3386 /* Value is non-zero if P is a pointer to a live Lisp string on
3387 the heap. M is a pointer to the mem_block for P. */
3390 live_string_p (m
, p
)
3394 if (m
->type
== MEM_TYPE_STRING
)
3396 struct string_block
*b
= (struct string_block
*) m
->start
;
3397 int offset
= (char *) p
- (char *) &b
->strings
[0];
3399 /* P must point to the start of a Lisp_String structure, and it
3400 must not be on the free-list. */
3402 && offset
% sizeof b
->strings
[0] == 0
3403 && offset
< (STRING_BLOCK_SIZE
* sizeof b
->strings
[0])
3404 && ((struct Lisp_String
*) p
)->data
!= NULL
);
3411 /* Value is non-zero if P is a pointer to a live Lisp cons on
3412 the heap. M is a pointer to the mem_block for P. */
3419 if (m
->type
== MEM_TYPE_CONS
)
3421 struct cons_block
*b
= (struct cons_block
*) m
->start
;
3422 int offset
= (char *) p
- (char *) &b
->conses
[0];
3424 /* P must point to the start of a Lisp_Cons, not be
3425 one of the unused cells in the current cons block,
3426 and not be on the free-list. */
3428 && offset
% sizeof b
->conses
[0] == 0
3429 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
3431 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
3432 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
3439 /* Value is non-zero if P is a pointer to a live Lisp symbol on
3440 the heap. M is a pointer to the mem_block for P. */
3443 live_symbol_p (m
, p
)
3447 if (m
->type
== MEM_TYPE_SYMBOL
)
3449 struct symbol_block
*b
= (struct symbol_block
*) m
->start
;
3450 int offset
= (char *) p
- (char *) &b
->symbols
[0];
3452 /* P must point to the start of a Lisp_Symbol, not be
3453 one of the unused cells in the current symbol block,
3454 and not be on the free-list. */
3456 && offset
% sizeof b
->symbols
[0] == 0
3457 && offset
< (SYMBOL_BLOCK_SIZE
* sizeof b
->symbols
[0])
3458 && (b
!= symbol_block
3459 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
3460 && !EQ (((struct Lisp_Symbol
*) p
)->function
, Vdead
));
3467 /* Value is non-zero if P is a pointer to a live Lisp float on
3468 the heap. M is a pointer to the mem_block for P. */
3475 if (m
->type
== MEM_TYPE_FLOAT
)
3477 struct float_block
*b
= (struct float_block
*) m
->start
;
3478 int offset
= (char *) p
- (char *) &b
->floats
[0];
3480 /* P must point to the start of a Lisp_Float and not be
3481 one of the unused cells in the current float block. */
3483 && offset
% sizeof b
->floats
[0] == 0
3484 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
3485 && (b
!= float_block
3486 || offset
/ sizeof b
->floats
[0] < float_block_index
));
3493 /* Value is non-zero if P is a pointer to a live Lisp Misc on
3494 the heap. M is a pointer to the mem_block for P. */
3501 if (m
->type
== MEM_TYPE_MISC
)
3503 struct marker_block
*b
= (struct marker_block
*) m
->start
;
3504 int offset
= (char *) p
- (char *) &b
->markers
[0];
3506 /* P must point to the start of a Lisp_Misc, not be
3507 one of the unused cells in the current misc block,
3508 and not be on the free-list. */
3510 && offset
% sizeof b
->markers
[0] == 0
3511 && offset
< (MARKER_BLOCK_SIZE
* sizeof b
->markers
[0])
3512 && (b
!= marker_block
3513 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
3514 && ((union Lisp_Misc
*) p
)->u_marker
.type
!= Lisp_Misc_Free
);
3521 /* Value is non-zero if P is a pointer to a live vector-like object.
3522 M is a pointer to the mem_block for P. */
3525 live_vector_p (m
, p
)
3529 return (p
== m
->start
3530 && m
->type
>= MEM_TYPE_VECTOR
3531 && m
->type
<= MEM_TYPE_WINDOW
);
3535 /* Value is non-zero if P is a pointer to a live buffer. M is a
3536 pointer to the mem_block for P. */
3539 live_buffer_p (m
, p
)
3543 /* P must point to the start of the block, and the buffer
3544 must not have been killed. */
3545 return (m
->type
== MEM_TYPE_BUFFER
3547 && !NILP (((struct buffer
*) p
)->name
));
3550 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
3554 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3556 /* Array of objects that are kept alive because the C stack contains
3557 a pattern that looks like a reference to them . */
3559 #define MAX_ZOMBIES 10
3560 static Lisp_Object zombies
[MAX_ZOMBIES
];
3562 /* Number of zombie objects. */
3564 static int nzombies
;
3566 /* Number of garbage collections. */
3570 /* Average percentage of zombies per collection. */
3572 static double avg_zombies
;
3574 /* Max. number of live and zombie objects. */
3576 static int max_live
, max_zombies
;
3578 /* Average number of live objects per GC. */
3580 static double avg_live
;
3582 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
3583 doc
: /* Show information about live and zombie objects. */)
3586 Lisp_Object args
[8], zombie_list
= Qnil
;
3588 for (i
= 0; i
< nzombies
; i
++)
3589 zombie_list
= Fcons (zombies
[i
], zombie_list
);
3590 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
3591 args
[1] = make_number (ngcs
);
3592 args
[2] = make_float (avg_live
);
3593 args
[3] = make_float (avg_zombies
);
3594 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
3595 args
[5] = make_number (max_live
);
3596 args
[6] = make_number (max_zombies
);
3597 args
[7] = zombie_list
;
3598 return Fmessage (8, args
);
3601 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
3604 /* Mark OBJ if we can prove it's a Lisp_Object. */
3607 mark_maybe_object (obj
)
3610 void *po
= (void *) XPNTR (obj
);
3611 struct mem_node
*m
= mem_find (po
);
3617 switch (XGCTYPE (obj
))
3620 mark_p
= (live_string_p (m
, po
)
3621 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
3625 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
3629 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
3633 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
3636 case Lisp_Vectorlike
:
3637 /* Note: can't check GC_BUFFERP before we know it's a
3638 buffer because checking that dereferences the pointer
3639 PO which might point anywhere. */
3640 if (live_vector_p (m
, po
))
3641 mark_p
= !GC_SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
3642 else if (live_buffer_p (m
, po
))
3643 mark_p
= GC_BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
3647 mark_p
= (live_misc_p (m
, po
) && !XMARKER (obj
)->gcmarkbit
);
3651 case Lisp_Type_Limit
:
3657 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3658 if (nzombies
< MAX_ZOMBIES
)
3659 zombies
[nzombies
] = obj
;
3668 /* If P points to Lisp data, mark that as live if it isn't already
3672 mark_maybe_pointer (p
)
3677 /* Quickly rule out some values which can't point to Lisp data. We
3678 assume that Lisp data is aligned on even addresses. */
3679 if ((EMACS_INT
) p
& 1)
3685 Lisp_Object obj
= Qnil
;
3689 case MEM_TYPE_NON_LISP
:
3690 /* Nothing to do; not a pointer to Lisp memory. */
3693 case MEM_TYPE_BUFFER
:
3694 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P((struct buffer
*)p
))
3695 XSETVECTOR (obj
, p
);
3699 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
3703 case MEM_TYPE_STRING
:
3704 if (live_string_p (m
, p
)
3705 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
3706 XSETSTRING (obj
, p
);
3710 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
3714 case MEM_TYPE_SYMBOL
:
3715 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
3716 XSETSYMBOL (obj
, p
);
3719 case MEM_TYPE_FLOAT
:
3720 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
3724 case MEM_TYPE_VECTOR
:
3725 case MEM_TYPE_PROCESS
:
3726 case MEM_TYPE_HASH_TABLE
:
3727 case MEM_TYPE_FRAME
:
3728 case MEM_TYPE_WINDOW
:
3729 if (live_vector_p (m
, p
))
3732 XSETVECTOR (tem
, p
);
3733 if (!GC_SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
3748 /* Mark Lisp objects referenced from the address range START..END. */
3751 mark_memory (start
, end
)
3757 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3761 /* Make START the pointer to the start of the memory region,
3762 if it isn't already. */
3770 /* Mark Lisp_Objects. */
3771 for (p
= (Lisp_Object
*) start
; (void *) p
< end
; ++p
)
3772 mark_maybe_object (*p
);
3774 /* Mark Lisp data pointed to. This is necessary because, in some
3775 situations, the C compiler optimizes Lisp objects away, so that
3776 only a pointer to them remains. Example:
3778 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
3781 Lisp_Object obj = build_string ("test");
3782 struct Lisp_String *s = XSTRING (obj);
3783 Fgarbage_collect ();
3784 fprintf (stderr, "test `%s'\n", s->data);
3788 Here, `obj' isn't really used, and the compiler optimizes it
3789 away. The only reference to the life string is through the
3792 for (pp
= (void **) start
; (void *) pp
< end
; ++pp
)
3793 mark_maybe_pointer (*pp
);
3796 /* setjmp will work with GCC unless NON_SAVING_SETJMP is defined in
3797 the GCC system configuration. In gcc 3.2, the only systems for
3798 which this is so are i386-sco5 non-ELF, i386-sysv3 (maybe included
3799 by others?) and ns32k-pc532-min. */
3801 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
3803 static int setjmp_tested_p
, longjmps_done
;
3805 #define SETJMP_WILL_LIKELY_WORK "\
3807 Emacs garbage collector has been changed to use conservative stack\n\
3808 marking. Emacs has determined that the method it uses to do the\n\
3809 marking will likely work on your system, but this isn't sure.\n\
3811 If you are a system-programmer, or can get the help of a local wizard\n\
3812 who is, please take a look at the function mark_stack in alloc.c, and\n\
3813 verify that the methods used are appropriate for your system.\n\
3815 Please mail the result to <emacs-devel@gnu.org>.\n\
3818 #define SETJMP_WILL_NOT_WORK "\
3820 Emacs garbage collector has been changed to use conservative stack\n\
3821 marking. Emacs has determined that the default method it uses to do the\n\
3822 marking will not work on your system. We will need a system-dependent\n\
3823 solution for your system.\n\
3825 Please take a look at the function mark_stack in alloc.c, and\n\
3826 try to find a way to make it work on your system.\n\
3828 Note that you may get false negatives, depending on the compiler.\n\
3829 In particular, you need to use -O with GCC for this test.\n\
3831 Please mail the result to <emacs-devel@gnu.org>.\n\
3835 /* Perform a quick check if it looks like setjmp saves registers in a
3836 jmp_buf. Print a message to stderr saying so. When this test
3837 succeeds, this is _not_ a proof that setjmp is sufficient for
3838 conservative stack marking. Only the sources or a disassembly
3849 /* Arrange for X to be put in a register. */
3855 if (longjmps_done
== 1)
3857 /* Came here after the longjmp at the end of the function.
3859 If x == 1, the longjmp has restored the register to its
3860 value before the setjmp, and we can hope that setjmp
3861 saves all such registers in the jmp_buf, although that
3864 For other values of X, either something really strange is
3865 taking place, or the setjmp just didn't save the register. */
3868 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
3871 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
3878 if (longjmps_done
== 1)
3882 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
3885 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
3887 /* Abort if anything GCPRO'd doesn't survive the GC. */
3895 for (p
= gcprolist
; p
; p
= p
->next
)
3896 for (i
= 0; i
< p
->nvars
; ++i
)
3897 if (!survives_gc_p (p
->var
[i
]))
3898 /* FIXME: It's not necessarily a bug. It might just be that the
3899 GCPRO is unnecessary or should release the object sooner. */
3903 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3910 fprintf (stderr
, "\nZombies kept alive = %d:\n", nzombies
);
3911 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
3913 fprintf (stderr
, " %d = ", i
);
3914 debug_print (zombies
[i
]);
3918 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
3921 /* Mark live Lisp objects on the C stack.
3923 There are several system-dependent problems to consider when
3924 porting this to new architectures:
3928 We have to mark Lisp objects in CPU registers that can hold local
3929 variables or are used to pass parameters.
3931 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
3932 something that either saves relevant registers on the stack, or
3933 calls mark_maybe_object passing it each register's contents.
3935 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
3936 implementation assumes that calling setjmp saves registers we need
3937 to see in a jmp_buf which itself lies on the stack. This doesn't
3938 have to be true! It must be verified for each system, possibly
3939 by taking a look at the source code of setjmp.
3943 Architectures differ in the way their processor stack is organized.
3944 For example, the stack might look like this
3947 | Lisp_Object | size = 4
3949 | something else | size = 2
3951 | Lisp_Object | size = 4
3955 In such a case, not every Lisp_Object will be aligned equally. To
3956 find all Lisp_Object on the stack it won't be sufficient to walk
3957 the stack in steps of 4 bytes. Instead, two passes will be
3958 necessary, one starting at the start of the stack, and a second
3959 pass starting at the start of the stack + 2. Likewise, if the
3960 minimal alignment of Lisp_Objects on the stack is 1, four passes
3961 would be necessary, each one starting with one byte more offset
3962 from the stack start.
3964 The current code assumes by default that Lisp_Objects are aligned
3965 equally on the stack. */
3972 volatile int stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
3975 /* This trick flushes the register windows so that all the state of
3976 the process is contained in the stack. */
3977 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
3978 needed on ia64 too. See mach_dep.c, where it also says inline
3979 assembler doesn't work with relevant proprietary compilers. */
3984 /* Save registers that we need to see on the stack. We need to see
3985 registers used to hold register variables and registers used to
3987 #ifdef GC_SAVE_REGISTERS_ON_STACK
3988 GC_SAVE_REGISTERS_ON_STACK (end
);
3989 #else /* not GC_SAVE_REGISTERS_ON_STACK */
3991 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
3992 setjmp will definitely work, test it
3993 and print a message with the result
3995 if (!setjmp_tested_p
)
3997 setjmp_tested_p
= 1;
4000 #endif /* GC_SETJMP_WORKS */
4003 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
4004 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
4006 /* This assumes that the stack is a contiguous region in memory. If
4007 that's not the case, something has to be done here to iterate
4008 over the stack segments. */
4009 #ifndef GC_LISP_OBJECT_ALIGNMENT
4011 #define GC_LISP_OBJECT_ALIGNMENT __alignof__ (Lisp_Object)
4013 #define GC_LISP_OBJECT_ALIGNMENT sizeof (Lisp_Object)
4016 for (i
= 0; i
< sizeof (Lisp_Object
); i
+= GC_LISP_OBJECT_ALIGNMENT
)
4017 mark_memory ((char *) stack_base
+ i
, end
);
4019 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4025 #endif /* GC_MARK_STACK != 0 */
4029 /***********************************************************************
4030 Pure Storage Management
4031 ***********************************************************************/
4033 /* Allocate room for SIZE bytes from pure Lisp storage and return a
4034 pointer to it. TYPE is the Lisp type for which the memory is
4035 allocated. TYPE < 0 means it's not used for a Lisp object.
4037 If store_pure_type_info is set and TYPE is >= 0, the type of
4038 the allocated object is recorded in pure_types. */
4040 static POINTER_TYPE
*
4041 pure_alloc (size
, type
)
4045 POINTER_TYPE
*result
;
4047 size_t alignment
= (1 << GCTYPEBITS
);
4049 size_t alignment
= sizeof (EMACS_INT
);
4051 /* Give Lisp_Floats an extra alignment. */
4052 if (type
== Lisp_Float
)
4054 #if defined __GNUC__ && __GNUC__ >= 2
4055 alignment
= __alignof (struct Lisp_Float
);
4057 alignment
= sizeof (struct Lisp_Float
);
4063 result
= ALIGN (purebeg
+ pure_bytes_used
, alignment
);
4064 pure_bytes_used
= ((char *)result
- (char *)purebeg
) + size
;
4066 if (pure_bytes_used
<= pure_size
)
4069 /* Don't allocate a large amount here,
4070 because it might get mmap'd and then its address
4071 might not be usable. */
4072 purebeg
= (char *) xmalloc (10000);
4074 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
4075 pure_bytes_used
= 0;
4080 /* Print a warning if PURESIZE is too small. */
4085 if (pure_bytes_used_before_overflow
)
4086 message ("Pure Lisp storage overflow (approx. %d bytes needed)",
4087 (int) (pure_bytes_used
+ pure_bytes_used_before_overflow
));
4091 /* Return a string allocated in pure space. DATA is a buffer holding
4092 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
4093 non-zero means make the result string multibyte.
4095 Must get an error if pure storage is full, since if it cannot hold
4096 a large string it may be able to hold conses that point to that
4097 string; then the string is not protected from gc. */
4100 make_pure_string (data
, nchars
, nbytes
, multibyte
)
4106 struct Lisp_String
*s
;
4108 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4109 s
->data
= (unsigned char *) pure_alloc (nbytes
+ 1, -1);
4111 s
->size_byte
= multibyte
? nbytes
: -1;
4112 bcopy (data
, s
->data
, nbytes
);
4113 s
->data
[nbytes
] = '\0';
4114 s
->intervals
= NULL_INTERVAL
;
4115 XSETSTRING (string
, s
);
4120 /* Return a cons allocated from pure space. Give it pure copies
4121 of CAR as car and CDR as cdr. */
4124 pure_cons (car
, cdr
)
4125 Lisp_Object car
, cdr
;
4127 register Lisp_Object
new;
4128 struct Lisp_Cons
*p
;
4130 p
= (struct Lisp_Cons
*) pure_alloc (sizeof *p
, Lisp_Cons
);
4132 XSETCAR (new, Fpurecopy (car
));
4133 XSETCDR (new, Fpurecopy (cdr
));
4138 /* Value is a float object with value NUM allocated from pure space. */
4141 make_pure_float (num
)
4144 register Lisp_Object
new;
4145 struct Lisp_Float
*p
;
4147 p
= (struct Lisp_Float
*) pure_alloc (sizeof *p
, Lisp_Float
);
4149 XFLOAT_DATA (new) = num
;
4154 /* Return a vector with room for LEN Lisp_Objects allocated from
4158 make_pure_vector (len
)
4162 struct Lisp_Vector
*p
;
4163 size_t size
= sizeof *p
+ (len
- 1) * sizeof (Lisp_Object
);
4165 p
= (struct Lisp_Vector
*) pure_alloc (size
, Lisp_Vectorlike
);
4166 XSETVECTOR (new, p
);
4167 XVECTOR (new)->size
= len
;
4172 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
4173 doc
: /* Make a copy of OBJECT in pure storage.
4174 Recursively copies contents of vectors and cons cells.
4175 Does not copy symbols. Copies strings without text properties. */)
4177 register Lisp_Object obj
;
4179 if (NILP (Vpurify_flag
))
4182 if (PURE_POINTER_P (XPNTR (obj
)))
4186 return pure_cons (XCAR (obj
), XCDR (obj
));
4187 else if (FLOATP (obj
))
4188 return make_pure_float (XFLOAT_DATA (obj
));
4189 else if (STRINGP (obj
))
4190 return make_pure_string (SDATA (obj
), SCHARS (obj
),
4192 STRING_MULTIBYTE (obj
));
4193 else if (COMPILEDP (obj
) || VECTORP (obj
))
4195 register struct Lisp_Vector
*vec
;
4199 size
= XVECTOR (obj
)->size
;
4200 if (size
& PSEUDOVECTOR_FLAG
)
4201 size
&= PSEUDOVECTOR_SIZE_MASK
;
4202 vec
= XVECTOR (make_pure_vector (size
));
4203 for (i
= 0; i
< size
; i
++)
4204 vec
->contents
[i
] = Fpurecopy (XVECTOR (obj
)->contents
[i
]);
4205 if (COMPILEDP (obj
))
4206 XSETCOMPILED (obj
, vec
);
4208 XSETVECTOR (obj
, vec
);
4211 else if (MARKERP (obj
))
4212 error ("Attempt to copy a marker to pure storage");
4219 /***********************************************************************
4221 ***********************************************************************/
4223 /* Put an entry in staticvec, pointing at the variable with address
4227 staticpro (varaddress
)
4228 Lisp_Object
*varaddress
;
4230 staticvec
[staticidx
++] = varaddress
;
4231 if (staticidx
>= NSTATICS
)
4239 struct catchtag
*next
;
4243 /***********************************************************************
4245 ***********************************************************************/
4247 /* Temporarily prevent garbage collection. */
4250 inhibit_garbage_collection ()
4252 int count
= SPECPDL_INDEX ();
4253 int nbits
= min (VALBITS
, BITS_PER_INT
);
4255 specbind (Qgc_cons_threshold
, make_number (((EMACS_INT
) 1 << (nbits
- 1)) - 1));
4260 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
4261 doc
: /* Reclaim storage for Lisp objects no longer needed.
4262 Garbage collection happens automatically if you cons more than
4263 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
4264 `garbage-collect' normally returns a list with info on amount of space in use:
4265 ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)
4266 (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS
4267 (USED-FLOATS . FREE-FLOATS) (USED-INTERVALS . FREE-INTERVALS)
4268 (USED-STRINGS . FREE-STRINGS))
4269 However, if there was overflow in pure space, `garbage-collect'
4270 returns nil, because real GC can't be done. */)
4273 register struct specbinding
*bind
;
4274 struct catchtag
*catch;
4275 struct handler
*handler
;
4276 char stack_top_variable
;
4279 Lisp_Object total
[8];
4280 int count
= SPECPDL_INDEX ();
4281 EMACS_TIME t1
, t2
, t3
;
4286 EMACS_GET_TIME (t1
);
4288 /* Can't GC if pure storage overflowed because we can't determine
4289 if something is a pure object or not. */
4290 if (pure_bytes_used_before_overflow
)
4293 /* In case user calls debug_print during GC,
4294 don't let that cause a recursive GC. */
4295 consing_since_gc
= 0;
4297 /* Save what's currently displayed in the echo area. */
4298 message_p
= push_message ();
4299 record_unwind_protect (pop_message_unwind
, Qnil
);
4301 /* Save a copy of the contents of the stack, for debugging. */
4302 #if MAX_SAVE_STACK > 0
4303 if (NILP (Vpurify_flag
))
4305 i
= &stack_top_variable
- stack_bottom
;
4307 if (i
< MAX_SAVE_STACK
)
4309 if (stack_copy
== 0)
4310 stack_copy
= (char *) xmalloc (stack_copy_size
= i
);
4311 else if (stack_copy_size
< i
)
4312 stack_copy
= (char *) xrealloc (stack_copy
, (stack_copy_size
= i
));
4315 if ((EMACS_INT
) (&stack_top_variable
- stack_bottom
) > 0)
4316 bcopy (stack_bottom
, stack_copy
, i
);
4318 bcopy (&stack_top_variable
, stack_copy
, i
);
4322 #endif /* MAX_SAVE_STACK > 0 */
4324 if (garbage_collection_messages
)
4325 message1_nolog ("Garbage collecting...");
4329 shrink_regexp_cache ();
4331 /* Don't keep undo information around forever. */
4333 register struct buffer
*nextb
= all_buffers
;
4337 /* If a buffer's undo list is Qt, that means that undo is
4338 turned off in that buffer. Calling truncate_undo_list on
4339 Qt tends to return NULL, which effectively turns undo back on.
4340 So don't call truncate_undo_list if undo_list is Qt. */
4341 if (! EQ (nextb
->undo_list
, Qt
))
4343 = truncate_undo_list (nextb
->undo_list
, undo_limit
,
4344 undo_strong_limit
, undo_outer_limit
);
4346 /* Shrink buffer gaps, but skip indirect and dead buffers. */
4347 if (nextb
->base_buffer
== 0 && !NILP (nextb
->name
))
4349 /* If a buffer's gap size is more than 10% of the buffer
4350 size, or larger than 2000 bytes, then shrink it
4351 accordingly. Keep a minimum size of 20 bytes. */
4352 int size
= min (2000, max (20, (nextb
->text
->z_byte
/ 10)));
4354 if (nextb
->text
->gap_size
> size
)
4356 struct buffer
*save_current
= current_buffer
;
4357 current_buffer
= nextb
;
4358 make_gap (-(nextb
->text
->gap_size
- size
));
4359 current_buffer
= save_current
;
4363 nextb
= nextb
->next
;
4369 /* clear_marks (); */
4371 /* Mark all the special slots that serve as the roots of accessibility. */
4373 for (i
= 0; i
< staticidx
; i
++)
4374 mark_object (*staticvec
[i
]);
4376 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
4377 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
4381 register struct gcpro
*tail
;
4382 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
4383 for (i
= 0; i
< tail
->nvars
; i
++)
4384 mark_object (tail
->var
[i
]);
4389 for (bind
= specpdl
; bind
!= specpdl_ptr
; bind
++)
4391 mark_object (bind
->symbol
);
4392 mark_object (bind
->old_value
);
4394 for (catch = catchlist
; catch; catch = catch->next
)
4396 mark_object (catch->tag
);
4397 mark_object (catch->val
);
4399 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
4401 mark_object (handler
->handler
);
4402 mark_object (handler
->var
);
4407 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4413 extern void xg_mark_data ();
4418 /* Everything is now marked, except for the things that require special
4419 finalization, i.e. the undo_list.
4420 Look thru every buffer's undo list
4421 for elements that update markers that were not marked,
4424 register struct buffer
*nextb
= all_buffers
;
4428 /* If a buffer's undo list is Qt, that means that undo is
4429 turned off in that buffer. Calling truncate_undo_list on
4430 Qt tends to return NULL, which effectively turns undo back on.
4431 So don't call truncate_undo_list if undo_list is Qt. */
4432 if (! EQ (nextb
->undo_list
, Qt
))
4434 Lisp_Object tail
, prev
;
4435 tail
= nextb
->undo_list
;
4437 while (CONSP (tail
))
4439 if (GC_CONSP (XCAR (tail
))
4440 && GC_MARKERP (XCAR (XCAR (tail
)))
4441 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
4444 nextb
->undo_list
= tail
= XCDR (tail
);
4448 XSETCDR (prev
, tail
);
4458 /* Now that we have stripped the elements that need not be in the
4459 undo_list any more, we can finally mark the list. */
4460 mark_object (nextb
->undo_list
);
4462 nextb
= nextb
->next
;
4468 /* Clear the mark bits that we set in certain root slots. */
4470 unmark_byte_stack ();
4471 VECTOR_UNMARK (&buffer_defaults
);
4472 VECTOR_UNMARK (&buffer_local_symbols
);
4474 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
4480 /* clear_marks (); */
4483 consing_since_gc
= 0;
4484 if (gc_cons_threshold
< 10000)
4485 gc_cons_threshold
= 10000;
4487 if (garbage_collection_messages
)
4489 if (message_p
|| minibuf_level
> 0)
4492 message1_nolog ("Garbage collecting...done");
4495 unbind_to (count
, Qnil
);
4497 total
[0] = Fcons (make_number (total_conses
),
4498 make_number (total_free_conses
));
4499 total
[1] = Fcons (make_number (total_symbols
),
4500 make_number (total_free_symbols
));
4501 total
[2] = Fcons (make_number (total_markers
),
4502 make_number (total_free_markers
));
4503 total
[3] = make_number (total_string_size
);
4504 total
[4] = make_number (total_vector_size
);
4505 total
[5] = Fcons (make_number (total_floats
),
4506 make_number (total_free_floats
));
4507 total
[6] = Fcons (make_number (total_intervals
),
4508 make_number (total_free_intervals
));
4509 total
[7] = Fcons (make_number (total_strings
),
4510 make_number (total_free_strings
));
4512 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4514 /* Compute average percentage of zombies. */
4517 for (i
= 0; i
< 7; ++i
)
4518 if (CONSP (total
[i
]))
4519 nlive
+= XFASTINT (XCAR (total
[i
]));
4521 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
4522 max_live
= max (nlive
, max_live
);
4523 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
4524 max_zombies
= max (nzombies
, max_zombies
);
4529 if (!NILP (Vpost_gc_hook
))
4531 int count
= inhibit_garbage_collection ();
4532 safe_run_hooks (Qpost_gc_hook
);
4533 unbind_to (count
, Qnil
);
4536 /* Accumulate statistics. */
4537 EMACS_GET_TIME (t2
);
4538 EMACS_SUB_TIME (t3
, t2
, t1
);
4539 if (FLOATP (Vgc_elapsed
))
4540 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
) +
4542 EMACS_USECS (t3
) * 1.0e-6);
4545 return Flist (sizeof total
/ sizeof *total
, total
);
4549 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
4550 only interesting objects referenced from glyphs are strings. */
4553 mark_glyph_matrix (matrix
)
4554 struct glyph_matrix
*matrix
;
4556 struct glyph_row
*row
= matrix
->rows
;
4557 struct glyph_row
*end
= row
+ matrix
->nrows
;
4559 for (; row
< end
; ++row
)
4563 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
4565 struct glyph
*glyph
= row
->glyphs
[area
];
4566 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
4568 for (; glyph
< end_glyph
; ++glyph
)
4569 if (GC_STRINGP (glyph
->object
)
4570 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
4571 mark_object (glyph
->object
);
4577 /* Mark Lisp faces in the face cache C. */
4581 struct face_cache
*c
;
4586 for (i
= 0; i
< c
->used
; ++i
)
4588 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
4592 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
4593 mark_object (face
->lface
[j
]);
4600 #ifdef HAVE_WINDOW_SYSTEM
4602 /* Mark Lisp objects in image IMG. */
4608 mark_object (img
->spec
);
4610 if (!NILP (img
->data
.lisp_val
))
4611 mark_object (img
->data
.lisp_val
);
4615 /* Mark Lisp objects in image cache of frame F. It's done this way so
4616 that we don't have to include xterm.h here. */
4619 mark_image_cache (f
)
4622 forall_images_in_image_cache (f
, mark_image
);
4625 #endif /* HAVE_X_WINDOWS */
4629 /* Mark reference to a Lisp_Object.
4630 If the object referred to has not been seen yet, recursively mark
4631 all the references contained in it. */
4633 #define LAST_MARKED_SIZE 500
4634 Lisp_Object last_marked
[LAST_MARKED_SIZE
];
4635 int last_marked_index
;
4637 /* For debugging--call abort when we cdr down this many
4638 links of a list, in mark_object. In debugging,
4639 the call to abort will hit a breakpoint.
4640 Normally this is zero and the check never goes off. */
4641 int mark_object_loop_halt
;
4647 register Lisp_Object obj
= arg
;
4648 #ifdef GC_CHECK_MARKED_OBJECTS
4656 if (PURE_POINTER_P (XPNTR (obj
)))
4659 last_marked
[last_marked_index
++] = obj
;
4660 if (last_marked_index
== LAST_MARKED_SIZE
)
4661 last_marked_index
= 0;
4663 /* Perform some sanity checks on the objects marked here. Abort if
4664 we encounter an object we know is bogus. This increases GC time
4665 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
4666 #ifdef GC_CHECK_MARKED_OBJECTS
4668 po
= (void *) XPNTR (obj
);
4670 /* Check that the object pointed to by PO is known to be a Lisp
4671 structure allocated from the heap. */
4672 #define CHECK_ALLOCATED() \
4674 m = mem_find (po); \
4679 /* Check that the object pointed to by PO is live, using predicate
4681 #define CHECK_LIVE(LIVEP) \
4683 if (!LIVEP (m, po)) \
4687 /* Check both of the above conditions. */
4688 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
4690 CHECK_ALLOCATED (); \
4691 CHECK_LIVE (LIVEP); \
4694 #else /* not GC_CHECK_MARKED_OBJECTS */
4696 #define CHECK_ALLOCATED() (void) 0
4697 #define CHECK_LIVE(LIVEP) (void) 0
4698 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
4700 #endif /* not GC_CHECK_MARKED_OBJECTS */
4702 switch (SWITCH_ENUM_CAST (XGCTYPE (obj
)))
4706 register struct Lisp_String
*ptr
= XSTRING (obj
);
4707 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
4708 MARK_INTERVAL_TREE (ptr
->intervals
);
4710 #ifdef GC_CHECK_STRING_BYTES
4711 /* Check that the string size recorded in the string is the
4712 same as the one recorded in the sdata structure. */
4713 CHECK_STRING_BYTES (ptr
);
4714 #endif /* GC_CHECK_STRING_BYTES */
4718 case Lisp_Vectorlike
:
4719 #ifdef GC_CHECK_MARKED_OBJECTS
4721 if (m
== MEM_NIL
&& !GC_SUBRP (obj
)
4722 && po
!= &buffer_defaults
4723 && po
!= &buffer_local_symbols
)
4725 #endif /* GC_CHECK_MARKED_OBJECTS */
4727 if (GC_BUFFERP (obj
))
4729 if (!VECTOR_MARKED_P (XBUFFER (obj
)))
4731 #ifdef GC_CHECK_MARKED_OBJECTS
4732 if (po
!= &buffer_defaults
&& po
!= &buffer_local_symbols
)
4735 for (b
= all_buffers
; b
&& b
!= po
; b
= b
->next
)
4740 #endif /* GC_CHECK_MARKED_OBJECTS */
4744 else if (GC_SUBRP (obj
))
4746 else if (GC_COMPILEDP (obj
))
4747 /* We could treat this just like a vector, but it is better to
4748 save the COMPILED_CONSTANTS element for last and avoid
4751 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
4752 register EMACS_INT size
= ptr
->size
;
4755 if (VECTOR_MARKED_P (ptr
))
4756 break; /* Already marked */
4758 CHECK_LIVE (live_vector_p
);
4759 VECTOR_MARK (ptr
); /* Else mark it */
4760 size
&= PSEUDOVECTOR_SIZE_MASK
;
4761 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
4763 if (i
!= COMPILED_CONSTANTS
)
4764 mark_object (ptr
->contents
[i
]);
4766 obj
= ptr
->contents
[COMPILED_CONSTANTS
];
4769 else if (GC_FRAMEP (obj
))
4771 register struct frame
*ptr
= XFRAME (obj
);
4773 if (VECTOR_MARKED_P (ptr
)) break; /* Already marked */
4774 VECTOR_MARK (ptr
); /* Else mark it */
4776 CHECK_LIVE (live_vector_p
);
4777 mark_object (ptr
->name
);
4778 mark_object (ptr
->icon_name
);
4779 mark_object (ptr
->title
);
4780 mark_object (ptr
->focus_frame
);
4781 mark_object (ptr
->selected_window
);
4782 mark_object (ptr
->minibuffer_window
);
4783 mark_object (ptr
->param_alist
);
4784 mark_object (ptr
->scroll_bars
);
4785 mark_object (ptr
->condemned_scroll_bars
);
4786 mark_object (ptr
->menu_bar_items
);
4787 mark_object (ptr
->face_alist
);
4788 mark_object (ptr
->menu_bar_vector
);
4789 mark_object (ptr
->buffer_predicate
);
4790 mark_object (ptr
->buffer_list
);
4791 mark_object (ptr
->menu_bar_window
);
4792 mark_object (ptr
->tool_bar_window
);
4793 mark_face_cache (ptr
->face_cache
);
4794 #ifdef HAVE_WINDOW_SYSTEM
4795 mark_image_cache (ptr
);
4796 mark_object (ptr
->tool_bar_items
);
4797 mark_object (ptr
->desired_tool_bar_string
);
4798 mark_object (ptr
->current_tool_bar_string
);
4799 #endif /* HAVE_WINDOW_SYSTEM */
4801 else if (GC_BOOL_VECTOR_P (obj
))
4803 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
4805 if (VECTOR_MARKED_P (ptr
))
4806 break; /* Already marked */
4807 CHECK_LIVE (live_vector_p
);
4808 VECTOR_MARK (ptr
); /* Else mark it */
4810 else if (GC_WINDOWP (obj
))
4812 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
4813 struct window
*w
= XWINDOW (obj
);
4816 /* Stop if already marked. */
4817 if (VECTOR_MARKED_P (ptr
))
4821 CHECK_LIVE (live_vector_p
);
4824 /* There is no Lisp data above The member CURRENT_MATRIX in
4825 struct WINDOW. Stop marking when that slot is reached. */
4827 (char *) &ptr
->contents
[i
] < (char *) &w
->current_matrix
;
4829 mark_object (ptr
->contents
[i
]);
4831 /* Mark glyphs for leaf windows. Marking window matrices is
4832 sufficient because frame matrices use the same glyph
4834 if (NILP (w
->hchild
)
4836 && w
->current_matrix
)
4838 mark_glyph_matrix (w
->current_matrix
);
4839 mark_glyph_matrix (w
->desired_matrix
);
4842 else if (GC_HASH_TABLE_P (obj
))
4844 struct Lisp_Hash_Table
*h
= XHASH_TABLE (obj
);
4846 /* Stop if already marked. */
4847 if (VECTOR_MARKED_P (h
))
4851 CHECK_LIVE (live_vector_p
);
4854 /* Mark contents. */
4855 /* Do not mark next_free or next_weak.
4856 Being in the next_weak chain
4857 should not keep the hash table alive.
4858 No need to mark `count' since it is an integer. */
4859 mark_object (h
->test
);
4860 mark_object (h
->weak
);
4861 mark_object (h
->rehash_size
);
4862 mark_object (h
->rehash_threshold
);
4863 mark_object (h
->hash
);
4864 mark_object (h
->next
);
4865 mark_object (h
->index
);
4866 mark_object (h
->user_hash_function
);
4867 mark_object (h
->user_cmp_function
);
4869 /* If hash table is not weak, mark all keys and values.
4870 For weak tables, mark only the vector. */
4871 if (GC_NILP (h
->weak
))
4872 mark_object (h
->key_and_value
);
4874 VECTOR_MARK (XVECTOR (h
->key_and_value
));
4878 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
4879 register EMACS_INT size
= ptr
->size
;
4882 if (VECTOR_MARKED_P (ptr
)) break; /* Already marked */
4883 CHECK_LIVE (live_vector_p
);
4884 VECTOR_MARK (ptr
); /* Else mark it */
4885 if (size
& PSEUDOVECTOR_FLAG
)
4886 size
&= PSEUDOVECTOR_SIZE_MASK
;
4888 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
4889 mark_object (ptr
->contents
[i
]);
4895 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
4896 struct Lisp_Symbol
*ptrx
;
4898 if (ptr
->gcmarkbit
) break;
4899 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
4901 mark_object (ptr
->value
);
4902 mark_object (ptr
->function
);
4903 mark_object (ptr
->plist
);
4905 if (!PURE_POINTER_P (XSTRING (ptr
->xname
)))
4906 MARK_STRING (XSTRING (ptr
->xname
));
4907 MARK_INTERVAL_TREE (STRING_INTERVALS (ptr
->xname
));
4909 /* Note that we do not mark the obarray of the symbol.
4910 It is safe not to do so because nothing accesses that
4911 slot except to check whether it is nil. */
4915 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun */
4916 XSETSYMBOL (obj
, ptrx
);
4923 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
4924 if (XMARKER (obj
)->gcmarkbit
)
4926 XMARKER (obj
)->gcmarkbit
= 1;
4927 switch (XMISCTYPE (obj
))
4929 case Lisp_Misc_Buffer_Local_Value
:
4930 case Lisp_Misc_Some_Buffer_Local_Value
:
4932 register struct Lisp_Buffer_Local_Value
*ptr
4933 = XBUFFER_LOCAL_VALUE (obj
);
4934 /* If the cdr is nil, avoid recursion for the car. */
4935 if (EQ (ptr
->cdr
, Qnil
))
4937 obj
= ptr
->realvalue
;
4940 mark_object (ptr
->realvalue
);
4941 mark_object (ptr
->buffer
);
4942 mark_object (ptr
->frame
);
4947 case Lisp_Misc_Marker
:
4948 /* DO NOT mark thru the marker's chain.
4949 The buffer's markers chain does not preserve markers from gc;
4950 instead, markers are removed from the chain when freed by gc. */
4951 case Lisp_Misc_Intfwd
:
4952 case Lisp_Misc_Boolfwd
:
4953 case Lisp_Misc_Objfwd
:
4954 case Lisp_Misc_Buffer_Objfwd
:
4955 case Lisp_Misc_Kboard_Objfwd
:
4956 /* Don't bother with Lisp_Buffer_Objfwd,
4957 since all markable slots in current buffer marked anyway. */
4958 /* Don't need to do Lisp_Objfwd, since the places they point
4959 are protected with staticpro. */
4960 case Lisp_Misc_Save_Value
:
4963 case Lisp_Misc_Overlay
:
4965 struct Lisp_Overlay
*ptr
= XOVERLAY (obj
);
4966 mark_object (ptr
->start
);
4967 mark_object (ptr
->end
);
4968 mark_object (ptr
->plist
);
4971 XSETMISC (obj
, ptr
->next
);
4984 register struct Lisp_Cons
*ptr
= XCONS (obj
);
4985 if (CONS_MARKED_P (ptr
)) break;
4986 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
4988 /* If the cdr is nil, avoid recursion for the car. */
4989 if (EQ (ptr
->cdr
, Qnil
))
4995 mark_object (ptr
->car
);
4998 if (cdr_count
== mark_object_loop_halt
)
5004 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
5005 FLOAT_MARK (XFLOAT (obj
));
5016 #undef CHECK_ALLOCATED
5017 #undef CHECK_ALLOCATED_AND_LIVE
5020 /* Mark the pointers in a buffer structure. */
5026 register struct buffer
*buffer
= XBUFFER (buf
);
5027 register Lisp_Object
*ptr
, tmp
;
5028 Lisp_Object base_buffer
;
5030 VECTOR_MARK (buffer
);
5032 MARK_INTERVAL_TREE (BUF_INTERVALS (buffer
));
5034 /* For now, we just don't mark the undo_list. It's done later in
5035 a special way just before the sweep phase, and after stripping
5036 some of its elements that are not needed any more. */
5038 if (buffer
->overlays_before
)
5040 XSETMISC (tmp
, buffer
->overlays_before
);
5043 if (buffer
->overlays_after
)
5045 XSETMISC (tmp
, buffer
->overlays_after
);
5049 for (ptr
= &buffer
->name
;
5050 (char *)ptr
< (char *)buffer
+ sizeof (struct buffer
);
5054 /* If this is an indirect buffer, mark its base buffer. */
5055 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
5057 XSETBUFFER (base_buffer
, buffer
->base_buffer
);
5058 mark_buffer (base_buffer
);
5063 /* Value is non-zero if OBJ will survive the current GC because it's
5064 either marked or does not need to be marked to survive. */
5072 switch (XGCTYPE (obj
))
5079 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
5083 survives_p
= XMARKER (obj
)->gcmarkbit
;
5087 survives_p
= STRING_MARKED_P (XSTRING (obj
));
5090 case Lisp_Vectorlike
:
5091 survives_p
= GC_SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
5095 survives_p
= CONS_MARKED_P (XCONS (obj
));
5099 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
5106 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
5111 /* Sweep: find all structures not marked, and free them. */
5116 /* Remove or mark entries in weak hash tables.
5117 This must be done before any object is unmarked. */
5118 sweep_weak_hash_tables ();
5121 #ifdef GC_CHECK_STRING_BYTES
5122 if (!noninteractive
)
5123 check_string_bytes (1);
5126 /* Put all unmarked conses on free list */
5128 register struct cons_block
*cblk
;
5129 struct cons_block
**cprev
= &cons_block
;
5130 register int lim
= cons_block_index
;
5131 register int num_free
= 0, num_used
= 0;
5135 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
5139 for (i
= 0; i
< lim
; i
++)
5140 if (!CONS_MARKED_P (&cblk
->conses
[i
]))
5143 *(struct Lisp_Cons
**)&cblk
->conses
[i
].cdr
= cons_free_list
;
5144 cons_free_list
= &cblk
->conses
[i
];
5146 cons_free_list
->car
= Vdead
;
5152 CONS_UNMARK (&cblk
->conses
[i
]);
5154 lim
= CONS_BLOCK_SIZE
;
5155 /* If this block contains only free conses and we have already
5156 seen more than two blocks worth of free conses then deallocate
5158 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
5160 *cprev
= cblk
->next
;
5161 /* Unhook from the free list. */
5162 cons_free_list
= *(struct Lisp_Cons
**) &cblk
->conses
[0].cdr
;
5163 lisp_align_free (cblk
);
5168 num_free
+= this_free
;
5169 cprev
= &cblk
->next
;
5172 total_conses
= num_used
;
5173 total_free_conses
= num_free
;
5176 /* Put all unmarked floats on free list */
5178 register struct float_block
*fblk
;
5179 struct float_block
**fprev
= &float_block
;
5180 register int lim
= float_block_index
;
5181 register int num_free
= 0, num_used
= 0;
5183 float_free_list
= 0;
5185 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
5189 for (i
= 0; i
< lim
; i
++)
5190 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
5193 *(struct Lisp_Float
**)&fblk
->floats
[i
].data
= float_free_list
;
5194 float_free_list
= &fblk
->floats
[i
];
5199 FLOAT_UNMARK (&fblk
->floats
[i
]);
5201 lim
= FLOAT_BLOCK_SIZE
;
5202 /* If this block contains only free floats and we have already
5203 seen more than two blocks worth of free floats then deallocate
5205 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
5207 *fprev
= fblk
->next
;
5208 /* Unhook from the free list. */
5209 float_free_list
= *(struct Lisp_Float
**) &fblk
->floats
[0].data
;
5210 lisp_align_free (fblk
);
5215 num_free
+= this_free
;
5216 fprev
= &fblk
->next
;
5219 total_floats
= num_used
;
5220 total_free_floats
= num_free
;
5223 /* Put all unmarked intervals on free list */
5225 register struct interval_block
*iblk
;
5226 struct interval_block
**iprev
= &interval_block
;
5227 register int lim
= interval_block_index
;
5228 register int num_free
= 0, num_used
= 0;
5230 interval_free_list
= 0;
5232 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
5237 for (i
= 0; i
< lim
; i
++)
5239 if (!iblk
->intervals
[i
].gcmarkbit
)
5241 SET_INTERVAL_PARENT (&iblk
->intervals
[i
], interval_free_list
);
5242 interval_free_list
= &iblk
->intervals
[i
];
5248 iblk
->intervals
[i
].gcmarkbit
= 0;
5251 lim
= INTERVAL_BLOCK_SIZE
;
5252 /* If this block contains only free intervals and we have already
5253 seen more than two blocks worth of free intervals then
5254 deallocate this block. */
5255 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
5257 *iprev
= iblk
->next
;
5258 /* Unhook from the free list. */
5259 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
5261 n_interval_blocks
--;
5265 num_free
+= this_free
;
5266 iprev
= &iblk
->next
;
5269 total_intervals
= num_used
;
5270 total_free_intervals
= num_free
;
5273 /* Put all unmarked symbols on free list */
5275 register struct symbol_block
*sblk
;
5276 struct symbol_block
**sprev
= &symbol_block
;
5277 register int lim
= symbol_block_index
;
5278 register int num_free
= 0, num_used
= 0;
5280 symbol_free_list
= NULL
;
5282 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
5285 struct Lisp_Symbol
*sym
= sblk
->symbols
;
5286 struct Lisp_Symbol
*end
= sym
+ lim
;
5288 for (; sym
< end
; ++sym
)
5290 /* Check if the symbol was created during loadup. In such a case
5291 it might be pointed to by pure bytecode which we don't trace,
5292 so we conservatively assume that it is live. */
5293 int pure_p
= PURE_POINTER_P (XSTRING (sym
->xname
));
5295 if (!sym
->gcmarkbit
&& !pure_p
)
5297 *(struct Lisp_Symbol
**) &sym
->value
= symbol_free_list
;
5298 symbol_free_list
= sym
;
5300 symbol_free_list
->function
= Vdead
;
5308 UNMARK_STRING (XSTRING (sym
->xname
));
5313 lim
= SYMBOL_BLOCK_SIZE
;
5314 /* If this block contains only free symbols and we have already
5315 seen more than two blocks worth of free symbols then deallocate
5317 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
5319 *sprev
= sblk
->next
;
5320 /* Unhook from the free list. */
5321 symbol_free_list
= *(struct Lisp_Symbol
**)&sblk
->symbols
[0].value
;
5327 num_free
+= this_free
;
5328 sprev
= &sblk
->next
;
5331 total_symbols
= num_used
;
5332 total_free_symbols
= num_free
;
5335 /* Put all unmarked misc's on free list.
5336 For a marker, first unchain it from the buffer it points into. */
5338 register struct marker_block
*mblk
;
5339 struct marker_block
**mprev
= &marker_block
;
5340 register int lim
= marker_block_index
;
5341 register int num_free
= 0, num_used
= 0;
5343 marker_free_list
= 0;
5345 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
5350 for (i
= 0; i
< lim
; i
++)
5352 if (!mblk
->markers
[i
].u_marker
.gcmarkbit
)
5354 if (mblk
->markers
[i
].u_marker
.type
== Lisp_Misc_Marker
)
5355 unchain_marker (&mblk
->markers
[i
].u_marker
);
5356 /* Set the type of the freed object to Lisp_Misc_Free.
5357 We could leave the type alone, since nobody checks it,
5358 but this might catch bugs faster. */
5359 mblk
->markers
[i
].u_marker
.type
= Lisp_Misc_Free
;
5360 mblk
->markers
[i
].u_free
.chain
= marker_free_list
;
5361 marker_free_list
= &mblk
->markers
[i
];
5367 mblk
->markers
[i
].u_marker
.gcmarkbit
= 0;
5370 lim
= MARKER_BLOCK_SIZE
;
5371 /* If this block contains only free markers and we have already
5372 seen more than two blocks worth of free markers then deallocate
5374 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
5376 *mprev
= mblk
->next
;
5377 /* Unhook from the free list. */
5378 marker_free_list
= mblk
->markers
[0].u_free
.chain
;
5384 num_free
+= this_free
;
5385 mprev
= &mblk
->next
;
5389 total_markers
= num_used
;
5390 total_free_markers
= num_free
;
5393 /* Free all unmarked buffers */
5395 register struct buffer
*buffer
= all_buffers
, *prev
= 0, *next
;
5398 if (!VECTOR_MARKED_P (buffer
))
5401 prev
->next
= buffer
->next
;
5403 all_buffers
= buffer
->next
;
5404 next
= buffer
->next
;
5410 VECTOR_UNMARK (buffer
);
5411 UNMARK_BALANCE_INTERVALS (BUF_INTERVALS (buffer
));
5412 prev
= buffer
, buffer
= buffer
->next
;
5416 /* Free all unmarked vectors */
5418 register struct Lisp_Vector
*vector
= all_vectors
, *prev
= 0, *next
;
5419 total_vector_size
= 0;
5422 if (!VECTOR_MARKED_P (vector
))
5425 prev
->next
= vector
->next
;
5427 all_vectors
= vector
->next
;
5428 next
= vector
->next
;
5436 VECTOR_UNMARK (vector
);
5437 if (vector
->size
& PSEUDOVECTOR_FLAG
)
5438 total_vector_size
+= (PSEUDOVECTOR_SIZE_MASK
& vector
->size
);
5440 total_vector_size
+= vector
->size
;
5441 prev
= vector
, vector
= vector
->next
;
5445 #ifdef GC_CHECK_STRING_BYTES
5446 if (!noninteractive
)
5447 check_string_bytes (1);
5454 /* Debugging aids. */
5456 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
5457 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
5458 This may be helpful in debugging Emacs's memory usage.
5459 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
5464 XSETINT (end
, (EMACS_INT
) sbrk (0) / 1024);
5469 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
5470 doc
: /* Return a list of counters that measure how much consing there has been.
5471 Each of these counters increments for a certain kind of object.
5472 The counters wrap around from the largest positive integer to zero.
5473 Garbage collection does not decrease them.
5474 The elements of the value are as follows:
5475 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
5476 All are in units of 1 = one object consed
5477 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
5479 MISCS include overlays, markers, and some internal types.
5480 Frames, windows, buffers, and subprocesses count as vectors
5481 (but the contents of a buffer's text do not count here). */)
5484 Lisp_Object consed
[8];
5486 consed
[0] = make_number (min (MOST_POSITIVE_FIXNUM
, cons_cells_consed
));
5487 consed
[1] = make_number (min (MOST_POSITIVE_FIXNUM
, floats_consed
));
5488 consed
[2] = make_number (min (MOST_POSITIVE_FIXNUM
, vector_cells_consed
));
5489 consed
[3] = make_number (min (MOST_POSITIVE_FIXNUM
, symbols_consed
));
5490 consed
[4] = make_number (min (MOST_POSITIVE_FIXNUM
, string_chars_consed
));
5491 consed
[5] = make_number (min (MOST_POSITIVE_FIXNUM
, misc_objects_consed
));
5492 consed
[6] = make_number (min (MOST_POSITIVE_FIXNUM
, intervals_consed
));
5493 consed
[7] = make_number (min (MOST_POSITIVE_FIXNUM
, strings_consed
));
5495 return Flist (8, consed
);
5498 int suppress_checking
;
5500 die (msg
, file
, line
)
5505 fprintf (stderr
, "\r\nEmacs fatal error: %s:%d: %s\r\n",
5510 /* Initialization */
5515 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
5517 pure_size
= PURESIZE
;
5518 pure_bytes_used
= 0;
5519 pure_bytes_used_before_overflow
= 0;
5521 /* Initialize the list of free aligned blocks. */
5524 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
5526 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
5530 ignore_warnings
= 1;
5531 #ifdef DOUG_LEA_MALLOC
5532 mallopt (M_TRIM_THRESHOLD
, 128*1024); /* trim threshold */
5533 mallopt (M_MMAP_THRESHOLD
, 64*1024); /* mmap threshold */
5534 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* max. number of mmap'ed areas */
5544 malloc_hysteresis
= 32;
5546 malloc_hysteresis
= 0;
5549 spare_memory
= (char *) malloc (SPARE_MEMORY
);
5551 ignore_warnings
= 0;
5553 byte_stack_list
= 0;
5555 consing_since_gc
= 0;
5556 gc_cons_threshold
= 100000 * sizeof (Lisp_Object
);
5557 #ifdef VIRT_ADDR_VARIES
5558 malloc_sbrk_unused
= 1<<22; /* A large number */
5559 malloc_sbrk_used
= 100000; /* as reasonable as any number */
5560 #endif /* VIRT_ADDR_VARIES */
5567 byte_stack_list
= 0;
5569 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
5570 setjmp_tested_p
= longjmps_done
= 0;
5573 Vgc_elapsed
= make_float (0.0);
5580 DEFVAR_INT ("gc-cons-threshold", &gc_cons_threshold
,
5581 doc
: /* *Number of bytes of consing between garbage collections.
5582 Garbage collection can happen automatically once this many bytes have been
5583 allocated since the last garbage collection. All data types count.
5585 Garbage collection happens automatically only when `eval' is called.
5587 By binding this temporarily to a large number, you can effectively
5588 prevent garbage collection during a part of the program. */);
5590 DEFVAR_INT ("pure-bytes-used", &pure_bytes_used
,
5591 doc
: /* Number of bytes of sharable Lisp data allocated so far. */);
5593 DEFVAR_INT ("cons-cells-consed", &cons_cells_consed
,
5594 doc
: /* Number of cons cells that have been consed so far. */);
5596 DEFVAR_INT ("floats-consed", &floats_consed
,
5597 doc
: /* Number of floats that have been consed so far. */);
5599 DEFVAR_INT ("vector-cells-consed", &vector_cells_consed
,
5600 doc
: /* Number of vector cells that have been consed so far. */);
5602 DEFVAR_INT ("symbols-consed", &symbols_consed
,
5603 doc
: /* Number of symbols that have been consed so far. */);
5605 DEFVAR_INT ("string-chars-consed", &string_chars_consed
,
5606 doc
: /* Number of string characters that have been consed so far. */);
5608 DEFVAR_INT ("misc-objects-consed", &misc_objects_consed
,
5609 doc
: /* Number of miscellaneous objects that have been consed so far. */);
5611 DEFVAR_INT ("intervals-consed", &intervals_consed
,
5612 doc
: /* Number of intervals that have been consed so far. */);
5614 DEFVAR_INT ("strings-consed", &strings_consed
,
5615 doc
: /* Number of strings that have been consed so far. */);
5617 DEFVAR_LISP ("purify-flag", &Vpurify_flag
,
5618 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
5619 This means that certain objects should be allocated in shared (pure) space. */);
5621 DEFVAR_INT ("undo-limit", &undo_limit
,
5622 doc
: /* Keep no more undo information once it exceeds this size.
5623 This limit is applied when garbage collection happens.
5624 The size is counted as the number of bytes occupied,
5625 which includes both saved text and other data. */);
5628 DEFVAR_INT ("undo-strong-limit", &undo_strong_limit
,
5629 doc
: /* Don't keep more than this much size of undo information.
5630 A previous command which pushes the undo list past this size
5631 is entirely forgotten when GC happens.
5632 The size is counted as the number of bytes occupied,
5633 which includes both saved text and other data. */);
5634 undo_strong_limit
= 30000;
5636 DEFVAR_INT ("undo-outer-limit", &undo_outer_limit
,
5637 doc
: /* Don't keep more than this much size of undo information.
5638 If the current command has produced more than this much undo information,
5639 GC discards it. This is a last-ditch limit to prevent memory overflow.
5640 The size is counted as the number of bytes occupied,
5641 which includes both saved text and other data. */);
5642 undo_outer_limit
= 300000;
5644 DEFVAR_BOOL ("garbage-collection-messages", &garbage_collection_messages
,
5645 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
5646 garbage_collection_messages
= 0;
5648 DEFVAR_LISP ("post-gc-hook", &Vpost_gc_hook
,
5649 doc
: /* Hook run after garbage collection has finished. */);
5650 Vpost_gc_hook
= Qnil
;
5651 Qpost_gc_hook
= intern ("post-gc-hook");
5652 staticpro (&Qpost_gc_hook
);
5654 DEFVAR_LISP ("memory-signal-data", &Vmemory_signal_data
,
5655 doc
: /* Precomputed `signal' argument for memory-full error. */);
5656 /* We build this in advance because if we wait until we need it, we might
5657 not be able to allocate the memory to hold it. */
5660 build_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"));
5662 DEFVAR_LISP ("memory-full", &Vmemory_full
,
5663 doc
: /* Non-nil means we are handling a memory-full error. */);
5664 Vmemory_full
= Qnil
;
5666 staticpro (&Qgc_cons_threshold
);
5667 Qgc_cons_threshold
= intern ("gc-cons-threshold");
5669 staticpro (&Qchar_table_extra_slots
);
5670 Qchar_table_extra_slots
= intern ("char-table-extra-slots");
5672 DEFVAR_LISP ("gc-elapsed", &Vgc_elapsed
,
5673 doc
: /* Accumulated time elapsed in garbage collections.
5674 The time is in seconds as a floating point value. */);
5675 DEFVAR_INT ("gcs-done", &gcs_done
,
5676 doc
: /* Accumulated number of garbage collections done. */);
5681 defsubr (&Smake_byte_code
);
5682 defsubr (&Smake_list
);
5683 defsubr (&Smake_vector
);
5684 defsubr (&Smake_string
);
5685 defsubr (&Smake_bool_vector
);
5686 defsubr (&Smake_symbol
);
5687 defsubr (&Smake_marker
);
5688 defsubr (&Spurecopy
);
5689 defsubr (&Sgarbage_collect
);
5690 defsubr (&Smemory_limit
);
5691 defsubr (&Smemory_use_counts
);
5693 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5694 defsubr (&Sgc_status
);
5698 /* arch-tag: 6695ca10-e3c5-4c2c-8bc3-ed26a7dda857
5699 (do not change this comment) */