1 /* Storage allocation and gc for GNU Emacs Lisp interpreter.
2 Copyright (C) 1985, 86, 88, 93, 94, 95, 97, 98, 1999, 2000, 2001, 2002, 2003
3 Free Software Foundation, Inc.
5 This file is part of GNU Emacs.
7 GNU Emacs is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU Emacs is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU Emacs; see the file COPYING. If not, write to
19 the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
24 #include <limits.h> /* For CHAR_BIT. */
30 /* Note that this declares bzero on OSF/1. How dumb. */
34 /* GC_MALLOC_CHECK defined means perform validity checks of malloc'd
35 memory. Can do this only if using gmalloc.c. */
37 #if defined SYSTEM_MALLOC || defined DOUG_LEA_MALLOC
38 #undef GC_MALLOC_CHECK
41 /* This file is part of the core Lisp implementation, and thus must
42 deal with the real data structures. If the Lisp implementation is
43 replaced, this file likely will not be used. */
45 #undef HIDE_LISP_IMPLEMENTATION
48 #include "intervals.h"
54 #include "blockinput.h"
56 #include "syssignal.h"
62 extern POINTER_TYPE
*sbrk ();
65 #ifdef DOUG_LEA_MALLOC
68 /* malloc.h #defines this as size_t, at least in glibc2. */
69 #ifndef __malloc_size_t
70 #define __malloc_size_t int
73 /* Specify maximum number of areas to mmap. It would be nice to use a
74 value that explicitly means "no limit". */
76 #define MMAP_MAX_AREAS 100000000
78 #else /* not DOUG_LEA_MALLOC */
80 /* The following come from gmalloc.c. */
82 #define __malloc_size_t size_t
83 extern __malloc_size_t _bytes_used
;
84 extern __malloc_size_t __malloc_extra_blocks
;
86 #endif /* not DOUG_LEA_MALLOC */
88 /* Value of _bytes_used, when spare_memory was freed. */
90 static __malloc_size_t bytes_used_when_full
;
92 /* Mark, unmark, query mark bit of a Lisp string. S must be a pointer
93 to a struct Lisp_String. */
95 #define MARK_STRING(S) ((S)->size |= ARRAY_MARK_FLAG)
96 #define UNMARK_STRING(S) ((S)->size &= ~ARRAY_MARK_FLAG)
97 #define STRING_MARKED_P(S) ((S)->size & ARRAY_MARK_FLAG)
99 #define VECTOR_MARK(V) ((V)->size |= ARRAY_MARK_FLAG)
100 #define VECTOR_UNMARK(V) ((V)->size &= ~ARRAY_MARK_FLAG)
101 #define VECTOR_MARKED_P(V) ((V)->size & ARRAY_MARK_FLAG)
103 /* Value is the number of bytes/chars of S, a pointer to a struct
104 Lisp_String. This must be used instead of STRING_BYTES (S) or
105 S->size during GC, because S->size contains the mark bit for
108 #define GC_STRING_BYTES(S) (STRING_BYTES (S))
109 #define GC_STRING_CHARS(S) ((S)->size & ~ARRAY_MARK_FLAG)
111 /* Number of bytes of consing done since the last gc. */
113 int consing_since_gc
;
115 /* Count the amount of consing of various sorts of space. */
117 EMACS_INT cons_cells_consed
;
118 EMACS_INT floats_consed
;
119 EMACS_INT vector_cells_consed
;
120 EMACS_INT symbols_consed
;
121 EMACS_INT string_chars_consed
;
122 EMACS_INT misc_objects_consed
;
123 EMACS_INT intervals_consed
;
124 EMACS_INT strings_consed
;
126 /* Number of bytes of consing since GC before another GC should be done. */
128 EMACS_INT gc_cons_threshold
;
130 /* Nonzero during GC. */
134 /* Nonzero means abort if try to GC.
135 This is for code which is written on the assumption that
136 no GC will happen, so as to verify that assumption. */
140 /* Nonzero means display messages at beginning and end of GC. */
142 int garbage_collection_messages
;
144 #ifndef VIRT_ADDR_VARIES
146 #endif /* VIRT_ADDR_VARIES */
147 int malloc_sbrk_used
;
149 #ifndef VIRT_ADDR_VARIES
151 #endif /* VIRT_ADDR_VARIES */
152 int malloc_sbrk_unused
;
154 /* Two limits controlling how much undo information to keep. */
156 EMACS_INT undo_limit
;
157 EMACS_INT undo_strong_limit
;
159 /* Number of live and free conses etc. */
161 static int total_conses
, total_markers
, total_symbols
, total_vector_size
;
162 static int total_free_conses
, total_free_markers
, total_free_symbols
;
163 static int total_free_floats
, total_floats
;
165 /* Points to memory space allocated as "spare", to be freed if we run
168 static char *spare_memory
;
170 /* Amount of spare memory to keep in reserve. */
172 #define SPARE_MEMORY (1 << 14)
174 /* Number of extra blocks malloc should get when it needs more core. */
176 static int malloc_hysteresis
;
178 /* Non-nil means defun should do purecopy on the function definition. */
180 Lisp_Object Vpurify_flag
;
182 /* Non-nil means we are handling a memory-full error. */
184 Lisp_Object Vmemory_full
;
188 /* Force it into data space! Initialize it to a nonzero value;
189 otherwise some compilers put it into BSS. */
191 EMACS_INT pure
[PURESIZE
/ sizeof (EMACS_INT
)] = {1,};
192 #define PUREBEG (char *) pure
196 #define pure PURE_SEG_BITS /* Use shared memory segment */
197 #define PUREBEG (char *)PURE_SEG_BITS
199 #endif /* HAVE_SHM */
201 /* Pointer to the pure area, and its size. */
203 static char *purebeg
;
204 static size_t pure_size
;
206 /* Number of bytes of pure storage used before pure storage overflowed.
207 If this is non-zero, this implies that an overflow occurred. */
209 static size_t pure_bytes_used_before_overflow
;
211 /* Value is non-zero if P points into pure space. */
213 #define PURE_POINTER_P(P) \
214 (((PNTR_COMPARISON_TYPE) (P) \
215 < (PNTR_COMPARISON_TYPE) ((char *) purebeg + pure_size)) \
216 && ((PNTR_COMPARISON_TYPE) (P) \
217 >= (PNTR_COMPARISON_TYPE) purebeg))
219 /* Index in pure at which next pure object will be allocated.. */
221 EMACS_INT pure_bytes_used
;
223 /* If nonzero, this is a warning delivered by malloc and not yet
226 char *pending_malloc_warning
;
228 /* Pre-computed signal argument for use when memory is exhausted. */
230 Lisp_Object Vmemory_signal_data
;
232 /* Maximum amount of C stack to save when a GC happens. */
234 #ifndef MAX_SAVE_STACK
235 #define MAX_SAVE_STACK 16000
238 /* Buffer in which we save a copy of the C stack at each GC. */
243 /* Non-zero means ignore malloc warnings. Set during initialization.
244 Currently not used. */
248 Lisp_Object Qgc_cons_threshold
, Qchar_table_extra_slots
;
250 /* Hook run after GC has finished. */
252 Lisp_Object Vpost_gc_hook
, Qpost_gc_hook
;
254 Lisp_Object Vgc_elapsed
; /* accumulated elapsed time in GC */
255 EMACS_INT gcs_done
; /* accumulated GCs */
257 static void mark_buffer
P_ ((Lisp_Object
));
258 extern void mark_kboards
P_ ((void));
259 static void gc_sweep
P_ ((void));
260 static void mark_glyph_matrix
P_ ((struct glyph_matrix
*));
261 static void mark_face_cache
P_ ((struct face_cache
*));
263 #ifdef HAVE_WINDOW_SYSTEM
264 static void mark_image
P_ ((struct image
*));
265 static void mark_image_cache
P_ ((struct frame
*));
266 #endif /* HAVE_WINDOW_SYSTEM */
268 static struct Lisp_String
*allocate_string
P_ ((void));
269 static void compact_small_strings
P_ ((void));
270 static void free_large_strings
P_ ((void));
271 static void sweep_strings
P_ ((void));
273 extern int message_enable_multibyte
;
275 /* When scanning the C stack for live Lisp objects, Emacs keeps track
276 of what memory allocated via lisp_malloc is intended for what
277 purpose. This enumeration specifies the type of memory. */
288 /* Keep the following vector-like types together, with
289 MEM_TYPE_WINDOW being the last, and MEM_TYPE_VECTOR the
290 first. Or change the code of live_vector_p, for instance. */
298 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
300 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
301 #include <stdio.h> /* For fprintf. */
304 /* A unique object in pure space used to make some Lisp objects
305 on free lists recognizable in O(1). */
309 #ifdef GC_MALLOC_CHECK
311 enum mem_type allocated_mem_type
;
312 int dont_register_blocks
;
314 #endif /* GC_MALLOC_CHECK */
316 /* A node in the red-black tree describing allocated memory containing
317 Lisp data. Each such block is recorded with its start and end
318 address when it is allocated, and removed from the tree when it
321 A red-black tree is a balanced binary tree with the following
324 1. Every node is either red or black.
325 2. Every leaf is black.
326 3. If a node is red, then both of its children are black.
327 4. Every simple path from a node to a descendant leaf contains
328 the same number of black nodes.
329 5. The root is always black.
331 When nodes are inserted into the tree, or deleted from the tree,
332 the tree is "fixed" so that these properties are always true.
334 A red-black tree with N internal nodes has height at most 2
335 log(N+1). Searches, insertions and deletions are done in O(log N).
336 Please see a text book about data structures for a detailed
337 description of red-black trees. Any book worth its salt should
342 /* Children of this node. These pointers are never NULL. When there
343 is no child, the value is MEM_NIL, which points to a dummy node. */
344 struct mem_node
*left
, *right
;
346 /* The parent of this node. In the root node, this is NULL. */
347 struct mem_node
*parent
;
349 /* Start and end of allocated region. */
353 enum {MEM_BLACK
, MEM_RED
} color
;
359 /* Base address of stack. Set in main. */
361 Lisp_Object
*stack_base
;
363 /* Root of the tree describing allocated Lisp memory. */
365 static struct mem_node
*mem_root
;
367 /* Lowest and highest known address in the heap. */
369 static void *min_heap_address
, *max_heap_address
;
371 /* Sentinel node of the tree. */
373 static struct mem_node mem_z
;
374 #define MEM_NIL &mem_z
376 static POINTER_TYPE
*lisp_malloc
P_ ((size_t, enum mem_type
));
377 static struct Lisp_Vector
*allocate_vectorlike
P_ ((EMACS_INT
, enum mem_type
));
378 static void lisp_free
P_ ((POINTER_TYPE
*));
379 static void mark_stack
P_ ((void));
380 static int live_vector_p
P_ ((struct mem_node
*, void *));
381 static int live_buffer_p
P_ ((struct mem_node
*, void *));
382 static int live_string_p
P_ ((struct mem_node
*, void *));
383 static int live_cons_p
P_ ((struct mem_node
*, void *));
384 static int live_symbol_p
P_ ((struct mem_node
*, void *));
385 static int live_float_p
P_ ((struct mem_node
*, void *));
386 static int live_misc_p
P_ ((struct mem_node
*, void *));
387 static void mark_maybe_object
P_ ((Lisp_Object
));
388 static void mark_memory
P_ ((void *, void *));
389 static void mem_init
P_ ((void));
390 static struct mem_node
*mem_insert
P_ ((void *, void *, enum mem_type
));
391 static void mem_insert_fixup
P_ ((struct mem_node
*));
392 static void mem_rotate_left
P_ ((struct mem_node
*));
393 static void mem_rotate_right
P_ ((struct mem_node
*));
394 static void mem_delete
P_ ((struct mem_node
*));
395 static void mem_delete_fixup
P_ ((struct mem_node
*));
396 static INLINE
struct mem_node
*mem_find
P_ ((void *));
398 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
399 static void check_gcpros
P_ ((void));
402 #endif /* GC_MARK_STACK || GC_MALLOC_CHECK */
404 /* Recording what needs to be marked for gc. */
406 struct gcpro
*gcprolist
;
408 /* Addresses of staticpro'd variables. Initialize it to a nonzero
409 value; otherwise some compilers put it into BSS. */
411 #define NSTATICS 1280
412 Lisp_Object
*staticvec
[NSTATICS
] = {&Vpurify_flag
};
414 /* Index of next unused slot in staticvec. */
418 static POINTER_TYPE
*pure_alloc
P_ ((size_t, int));
421 /* Value is SZ rounded up to the next multiple of ALIGNMENT.
422 ALIGNMENT must be a power of 2. */
424 #define ALIGN(ptr, ALIGNMENT) \
425 ((POINTER_TYPE *) ((((EMACS_UINT)(ptr)) + (ALIGNMENT) - 1) \
426 & ~((ALIGNMENT) - 1)))
430 /************************************************************************
432 ************************************************************************/
434 /* Function malloc calls this if it finds we are near exhausting storage. */
440 pending_malloc_warning
= str
;
444 /* Display an already-pending malloc warning. */
447 display_malloc_warning ()
449 call3 (intern ("display-warning"),
451 build_string (pending_malloc_warning
),
452 intern ("emergency"));
453 pending_malloc_warning
= 0;
457 #ifdef DOUG_LEA_MALLOC
458 # define BYTES_USED (mallinfo ().arena)
460 # define BYTES_USED _bytes_used
464 /* Called if malloc returns zero. */
471 #ifndef SYSTEM_MALLOC
472 bytes_used_when_full
= BYTES_USED
;
475 /* The first time we get here, free the spare memory. */
482 /* This used to call error, but if we've run out of memory, we could
483 get infinite recursion trying to build the string. */
485 Fsignal (Qnil
, Vmemory_signal_data
);
489 /* Called if we can't allocate relocatable space for a buffer. */
492 buffer_memory_full ()
494 /* If buffers use the relocating allocator, no need to free
495 spare_memory, because we may have plenty of malloc space left
496 that we could get, and if we don't, the malloc that fails will
497 itself cause spare_memory to be freed. If buffers don't use the
498 relocating allocator, treat this like any other failing
507 /* This used to call error, but if we've run out of memory, we could
508 get infinite recursion trying to build the string. */
510 Fsignal (Qnil
, Vmemory_signal_data
);
514 /* Like malloc but check for no memory and block interrupt input.. */
520 register POINTER_TYPE
*val
;
523 val
= (POINTER_TYPE
*) malloc (size
);
532 /* Like realloc but check for no memory and block interrupt input.. */
535 xrealloc (block
, size
)
539 register POINTER_TYPE
*val
;
542 /* We must call malloc explicitly when BLOCK is 0, since some
543 reallocs don't do this. */
545 val
= (POINTER_TYPE
*) malloc (size
);
547 val
= (POINTER_TYPE
*) realloc (block
, size
);
550 if (!val
&& size
) memory_full ();
555 /* Like free but block interrupt input. */
567 /* Like strdup, but uses xmalloc. */
573 size_t len
= strlen (s
) + 1;
574 char *p
= (char *) xmalloc (len
);
580 /* Like malloc but used for allocating Lisp data. NBYTES is the
581 number of bytes to allocate, TYPE describes the intended use of the
582 allcated memory block (for strings, for conses, ...). */
584 static void *lisp_malloc_loser
;
586 static POINTER_TYPE
*
587 lisp_malloc (nbytes
, type
)
595 #ifdef GC_MALLOC_CHECK
596 allocated_mem_type
= type
;
599 val
= (void *) malloc (nbytes
);
601 /* If the memory just allocated cannot be addressed thru a Lisp
602 object's pointer, and it needs to be,
603 that's equivalent to running out of memory. */
604 if (val
&& type
!= MEM_TYPE_NON_LISP
)
607 XSETCONS (tem
, (char *) val
+ nbytes
- 1);
608 if ((char *) XCONS (tem
) != (char *) val
+ nbytes
- 1)
610 lisp_malloc_loser
= val
;
616 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
617 if (val
&& type
!= MEM_TYPE_NON_LISP
)
618 mem_insert (val
, (char *) val
+ nbytes
, type
);
627 /* Free BLOCK. This must be called to free memory allocated with a
628 call to lisp_malloc. */
636 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
637 mem_delete (mem_find (block
));
642 /* Allocation of aligned blocks of memory to store Lisp data. */
643 /* The entry point is lisp_align_malloc which returns blocks of at most */
644 /* BLOCK_BYTES and guarantees they are aligned on a BLOCK_ALIGN boundary. */
647 /* BLOCK_ALIGN has to be a power of 2. */
648 #define BLOCK_ALIGN (1 << 10)
650 /* Padding to leave at the end of a malloc'd block. This is to give
651 malloc a chance to minimize the amount of memory wasted to alignment.
652 It should be tuned to the particular malloc library used.
653 On glibc-2.3.2, malloc never tries to align, so a padding of 0 is best.
654 posix_memalign on the other hand would ideally prefer a value of 4
655 because otherwise, there's 1020 bytes wasted between each ablocks.
656 But testing shows that those 1020 will most of the time be efficiently
657 used by malloc to place other objects, so a value of 0 is still preferable
658 unless you have a lot of cons&floats and virtually nothing else. */
659 #define BLOCK_PADDING 0
660 #define BLOCK_BYTES \
661 (BLOCK_ALIGN - sizeof (struct aligned_block *) - BLOCK_PADDING)
663 /* Internal data structures and constants. */
665 #define ABLOCKS_SIZE 16
667 /* An aligned block of memory. */
672 char payload
[BLOCK_BYTES
];
673 struct ablock
*next_free
;
675 /* `abase' is the aligned base of the ablocks. */
676 /* It is overloaded to hold the virtual `busy' field that counts
677 the number of used ablock in the parent ablocks.
678 The first ablock has the `busy' field, the others have the `abase'
679 field. To tell the difference, we assume that pointers will have
680 integer values larger than 2 * ABLOCKS_SIZE. The lowest bit of `busy'
681 is used to tell whether the real base of the parent ablocks is `abase'
682 (if not, the word before the first ablock holds a pointer to the
684 struct ablocks
*abase
;
685 /* The padding of all but the last ablock is unused. The padding of
686 the last ablock in an ablocks is not allocated. */
688 char padding
[BLOCK_PADDING
];
692 /* A bunch of consecutive aligned blocks. */
695 struct ablock blocks
[ABLOCKS_SIZE
];
698 /* Size of the block requested from malloc or memalign. */
699 #define ABLOCKS_BYTES (sizeof (struct ablocks) - BLOCK_PADDING)
701 #define ABLOCK_ABASE(block) \
702 (((unsigned long) (block)->abase) <= (1 + 2 * ABLOCKS_SIZE) \
703 ? (struct ablocks *)(block) \
706 /* Virtual `busy' field. */
707 #define ABLOCKS_BUSY(abase) ((abase)->blocks[0].abase)
709 /* Pointer to the (not necessarily aligned) malloc block. */
710 #ifdef HAVE_POSIX_MEMALIGN
711 #define ABLOCKS_BASE(abase) (abase)
713 #define ABLOCKS_BASE(abase) \
714 (1 & (int) ABLOCKS_BUSY (abase) ? abase : ((void**)abase)[-1])
717 /* The list of free ablock. */
718 static struct ablock
*free_ablock
;
720 /* Allocate an aligned block of nbytes.
721 Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be
722 smaller or equal to BLOCK_BYTES. */
723 static POINTER_TYPE
*
724 lisp_align_malloc (nbytes
, type
)
729 struct ablocks
*abase
;
731 eassert (nbytes
<= BLOCK_BYTES
);
735 #ifdef GC_MALLOC_CHECK
736 allocated_mem_type
= type
;
742 EMACS_INT aligned
; /* int gets warning casting to 64-bit pointer. */
744 #ifdef DOUG_LEA_MALLOC
745 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
746 because mapped region contents are not preserved in
748 mallopt (M_MMAP_MAX
, 0);
751 #ifdef HAVE_POSIX_MEMALIGN
753 int err
= posix_memalign (&base
, BLOCK_ALIGN
, ABLOCKS_BYTES
);
754 abase
= err
? (base
= NULL
) : base
;
757 base
= malloc (ABLOCKS_BYTES
);
758 abase
= ALIGN (base
, BLOCK_ALIGN
);
761 aligned
= (base
== abase
);
763 ((void**)abase
)[-1] = base
;
765 #ifdef DOUG_LEA_MALLOC
766 /* Back to a reasonable maximum of mmap'ed areas. */
767 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
770 /* If the memory just allocated cannot be addressed thru a Lisp
771 object's pointer, and it needs to be, that's equivalent to
772 running out of memory. */
773 if (type
!= MEM_TYPE_NON_LISP
)
776 char *end
= (char *) base
+ ABLOCKS_BYTES
- 1;
778 if ((char *) XCONS (tem
) != end
)
780 lisp_malloc_loser
= base
;
787 /* Initialize the blocks and put them on the free list.
788 Is `base' was not properly aligned, we can't use the last block. */
789 for (i
= 0; i
< (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1); i
++)
791 abase
->blocks
[i
].abase
= abase
;
792 abase
->blocks
[i
].x
.next_free
= free_ablock
;
793 free_ablock
= &abase
->blocks
[i
];
795 ABLOCKS_BUSY (abase
) = (struct ablocks
*) aligned
;
797 eassert (0 == ((EMACS_UINT
)abase
) % BLOCK_ALIGN
);
798 eassert (ABLOCK_ABASE (&abase
->blocks
[3]) == abase
); /* 3 is arbitrary */
799 eassert (ABLOCK_ABASE (&abase
->blocks
[0]) == abase
);
800 eassert (ABLOCKS_BASE (abase
) == base
);
801 eassert (aligned
== (int)ABLOCKS_BUSY (abase
));
804 abase
= ABLOCK_ABASE (free_ablock
);
805 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (2 + (int) ABLOCKS_BUSY (abase
));
807 free_ablock
= free_ablock
->x
.next_free
;
809 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
810 if (val
&& type
!= MEM_TYPE_NON_LISP
)
811 mem_insert (val
, (char *) val
+ nbytes
, type
);
818 eassert (0 == ((EMACS_UINT
)val
) % BLOCK_ALIGN
);
823 lisp_align_free (block
)
826 struct ablock
*ablock
= block
;
827 struct ablocks
*abase
= ABLOCK_ABASE (ablock
);
830 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
831 mem_delete (mem_find (block
));
833 /* Put on free list. */
834 ablock
->x
.next_free
= free_ablock
;
835 free_ablock
= ablock
;
836 /* Update busy count. */
837 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (-2 + (int) ABLOCKS_BUSY (abase
));
839 if (2 > (int) ABLOCKS_BUSY (abase
))
840 { /* All the blocks are free. */
841 int i
= 0, aligned
= (int) ABLOCKS_BUSY (abase
);
842 struct ablock
**tem
= &free_ablock
;
843 struct ablock
*atop
= &abase
->blocks
[aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1];
847 if (*tem
>= (struct ablock
*) abase
&& *tem
< atop
)
850 *tem
= (*tem
)->x
.next_free
;
853 tem
= &(*tem
)->x
.next_free
;
855 eassert ((aligned
& 1) == aligned
);
856 eassert (i
== (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1));
857 free (ABLOCKS_BASE (abase
));
862 /* Return a new buffer structure allocated from the heap with
863 a call to lisp_malloc. */
869 = (struct buffer
*) lisp_malloc (sizeof (struct buffer
),
875 /* Arranging to disable input signals while we're in malloc.
877 This only works with GNU malloc. To help out systems which can't
878 use GNU malloc, all the calls to malloc, realloc, and free
879 elsewhere in the code should be inside a BLOCK_INPUT/UNBLOCK_INPUT
880 pairs; unfortunately, we have no idea what C library functions
881 might call malloc, so we can't really protect them unless you're
882 using GNU malloc. Fortunately, most of the major operating systems
883 can use GNU malloc. */
885 #ifndef SYSTEM_MALLOC
886 #ifndef DOUG_LEA_MALLOC
887 extern void * (*__malloc_hook
) P_ ((size_t));
888 extern void * (*__realloc_hook
) P_ ((void *, size_t));
889 extern void (*__free_hook
) P_ ((void *));
890 /* Else declared in malloc.h, perhaps with an extra arg. */
891 #endif /* DOUG_LEA_MALLOC */
892 static void * (*old_malloc_hook
) ();
893 static void * (*old_realloc_hook
) ();
894 static void (*old_free_hook
) ();
896 /* This function is used as the hook for free to call. */
899 emacs_blocked_free (ptr
)
904 #ifdef GC_MALLOC_CHECK
910 if (m
== MEM_NIL
|| m
->start
!= ptr
)
913 "Freeing `%p' which wasn't allocated with malloc\n", ptr
);
918 /* fprintf (stderr, "free %p...%p (%p)\n", m->start, m->end, ptr); */
922 #endif /* GC_MALLOC_CHECK */
924 __free_hook
= old_free_hook
;
927 /* If we released our reserve (due to running out of memory),
928 and we have a fair amount free once again,
929 try to set aside another reserve in case we run out once more. */
930 if (spare_memory
== 0
931 /* Verify there is enough space that even with the malloc
932 hysteresis this call won't run out again.
933 The code here is correct as long as SPARE_MEMORY
934 is substantially larger than the block size malloc uses. */
935 && (bytes_used_when_full
936 > BYTES_USED
+ max (malloc_hysteresis
, 4) * SPARE_MEMORY
))
937 spare_memory
= (char *) malloc ((size_t) SPARE_MEMORY
);
939 __free_hook
= emacs_blocked_free
;
944 /* If we released our reserve (due to running out of memory),
945 and we have a fair amount free once again,
946 try to set aside another reserve in case we run out once more.
948 This is called when a relocatable block is freed in ralloc.c. */
951 refill_memory_reserve ()
953 if (spare_memory
== 0)
954 spare_memory
= (char *) malloc ((size_t) SPARE_MEMORY
);
958 /* This function is the malloc hook that Emacs uses. */
961 emacs_blocked_malloc (size
)
967 __malloc_hook
= old_malloc_hook
;
968 #ifdef DOUG_LEA_MALLOC
969 mallopt (M_TOP_PAD
, malloc_hysteresis
* 4096);
971 __malloc_extra_blocks
= malloc_hysteresis
;
974 value
= (void *) malloc (size
);
976 #ifdef GC_MALLOC_CHECK
978 struct mem_node
*m
= mem_find (value
);
981 fprintf (stderr
, "Malloc returned %p which is already in use\n",
983 fprintf (stderr
, "Region in use is %p...%p, %u bytes, type %d\n",
984 m
->start
, m
->end
, (char *) m
->end
- (char *) m
->start
,
989 if (!dont_register_blocks
)
991 mem_insert (value
, (char *) value
+ max (1, size
), allocated_mem_type
);
992 allocated_mem_type
= MEM_TYPE_NON_LISP
;
995 #endif /* GC_MALLOC_CHECK */
997 __malloc_hook
= emacs_blocked_malloc
;
1000 /* fprintf (stderr, "%p malloc\n", value); */
1005 /* This function is the realloc hook that Emacs uses. */
1008 emacs_blocked_realloc (ptr
, size
)
1015 __realloc_hook
= old_realloc_hook
;
1017 #ifdef GC_MALLOC_CHECK
1020 struct mem_node
*m
= mem_find (ptr
);
1021 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1024 "Realloc of %p which wasn't allocated with malloc\n",
1032 /* fprintf (stderr, "%p -> realloc\n", ptr); */
1034 /* Prevent malloc from registering blocks. */
1035 dont_register_blocks
= 1;
1036 #endif /* GC_MALLOC_CHECK */
1038 value
= (void *) realloc (ptr
, size
);
1040 #ifdef GC_MALLOC_CHECK
1041 dont_register_blocks
= 0;
1044 struct mem_node
*m
= mem_find (value
);
1047 fprintf (stderr
, "Realloc returns memory that is already in use\n");
1051 /* Can't handle zero size regions in the red-black tree. */
1052 mem_insert (value
, (char *) value
+ max (size
, 1), MEM_TYPE_NON_LISP
);
1055 /* fprintf (stderr, "%p <- realloc\n", value); */
1056 #endif /* GC_MALLOC_CHECK */
1058 __realloc_hook
= emacs_blocked_realloc
;
1065 /* Called from main to set up malloc to use our hooks. */
1068 uninterrupt_malloc ()
1070 if (__free_hook
!= emacs_blocked_free
)
1071 old_free_hook
= __free_hook
;
1072 __free_hook
= emacs_blocked_free
;
1074 if (__malloc_hook
!= emacs_blocked_malloc
)
1075 old_malloc_hook
= __malloc_hook
;
1076 __malloc_hook
= emacs_blocked_malloc
;
1078 if (__realloc_hook
!= emacs_blocked_realloc
)
1079 old_realloc_hook
= __realloc_hook
;
1080 __realloc_hook
= emacs_blocked_realloc
;
1083 #endif /* not SYSTEM_MALLOC */
1087 /***********************************************************************
1089 ***********************************************************************/
1091 /* Number of intervals allocated in an interval_block structure.
1092 The 1020 is 1024 minus malloc overhead. */
1094 #define INTERVAL_BLOCK_SIZE \
1095 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
1097 /* Intervals are allocated in chunks in form of an interval_block
1100 struct interval_block
1102 struct interval_block
*next
;
1103 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
1106 /* Current interval block. Its `next' pointer points to older
1109 struct interval_block
*interval_block
;
1111 /* Index in interval_block above of the next unused interval
1114 static int interval_block_index
;
1116 /* Number of free and live intervals. */
1118 static int total_free_intervals
, total_intervals
;
1120 /* List of free intervals. */
1122 INTERVAL interval_free_list
;
1124 /* Total number of interval blocks now in use. */
1126 int n_interval_blocks
;
1129 /* Initialize interval allocation. */
1135 = (struct interval_block
*) lisp_malloc (sizeof *interval_block
,
1137 interval_block
->next
= 0;
1138 bzero ((char *) interval_block
->intervals
, sizeof interval_block
->intervals
);
1139 interval_block_index
= 0;
1140 interval_free_list
= 0;
1141 n_interval_blocks
= 1;
1145 /* Return a new interval. */
1152 if (interval_free_list
)
1154 val
= interval_free_list
;
1155 interval_free_list
= INTERVAL_PARENT (interval_free_list
);
1159 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
1161 register struct interval_block
*newi
;
1163 newi
= (struct interval_block
*) lisp_malloc (sizeof *newi
,
1166 newi
->next
= interval_block
;
1167 interval_block
= newi
;
1168 interval_block_index
= 0;
1169 n_interval_blocks
++;
1171 val
= &interval_block
->intervals
[interval_block_index
++];
1173 consing_since_gc
+= sizeof (struct interval
);
1175 RESET_INTERVAL (val
);
1181 /* Mark Lisp objects in interval I. */
1184 mark_interval (i
, dummy
)
1185 register INTERVAL i
;
1188 eassert (!i
->gcmarkbit
); /* Intervals are never shared. */
1190 mark_object (i
->plist
);
1194 /* Mark the interval tree rooted in TREE. Don't call this directly;
1195 use the macro MARK_INTERVAL_TREE instead. */
1198 mark_interval_tree (tree
)
1199 register INTERVAL tree
;
1201 /* No need to test if this tree has been marked already; this
1202 function is always called through the MARK_INTERVAL_TREE macro,
1203 which takes care of that. */
1205 traverse_intervals_noorder (tree
, mark_interval
, Qnil
);
1209 /* Mark the interval tree rooted in I. */
1211 #define MARK_INTERVAL_TREE(i) \
1213 if (!NULL_INTERVAL_P (i) && !i->gcmarkbit) \
1214 mark_interval_tree (i); \
1218 #define UNMARK_BALANCE_INTERVALS(i) \
1220 if (! NULL_INTERVAL_P (i)) \
1221 (i) = balance_intervals (i); \
1225 /* Number support. If NO_UNION_TYPE isn't in effect, we
1226 can't create number objects in macros. */
1234 obj
.s
.type
= Lisp_Int
;
1239 /***********************************************************************
1241 ***********************************************************************/
1243 /* Lisp_Strings are allocated in string_block structures. When a new
1244 string_block is allocated, all the Lisp_Strings it contains are
1245 added to a free-list string_free_list. When a new Lisp_String is
1246 needed, it is taken from that list. During the sweep phase of GC,
1247 string_blocks that are entirely free are freed, except two which
1250 String data is allocated from sblock structures. Strings larger
1251 than LARGE_STRING_BYTES, get their own sblock, data for smaller
1252 strings is sub-allocated out of sblocks of size SBLOCK_SIZE.
1254 Sblocks consist internally of sdata structures, one for each
1255 Lisp_String. The sdata structure points to the Lisp_String it
1256 belongs to. The Lisp_String points back to the `u.data' member of
1257 its sdata structure.
1259 When a Lisp_String is freed during GC, it is put back on
1260 string_free_list, and its `data' member and its sdata's `string'
1261 pointer is set to null. The size of the string is recorded in the
1262 `u.nbytes' member of the sdata. So, sdata structures that are no
1263 longer used, can be easily recognized, and it's easy to compact the
1264 sblocks of small strings which we do in compact_small_strings. */
1266 /* Size in bytes of an sblock structure used for small strings. This
1267 is 8192 minus malloc overhead. */
1269 #define SBLOCK_SIZE 8188
1271 /* Strings larger than this are considered large strings. String data
1272 for large strings is allocated from individual sblocks. */
1274 #define LARGE_STRING_BYTES 1024
1276 /* Structure describing string memory sub-allocated from an sblock.
1277 This is where the contents of Lisp strings are stored. */
1281 /* Back-pointer to the string this sdata belongs to. If null, this
1282 structure is free, and the NBYTES member of the union below
1283 contains the string's byte size (the same value that STRING_BYTES
1284 would return if STRING were non-null). If non-null, STRING_BYTES
1285 (STRING) is the size of the data, and DATA contains the string's
1287 struct Lisp_String
*string
;
1289 #ifdef GC_CHECK_STRING_BYTES
1292 unsigned char data
[1];
1294 #define SDATA_NBYTES(S) (S)->nbytes
1295 #define SDATA_DATA(S) (S)->data
1297 #else /* not GC_CHECK_STRING_BYTES */
1301 /* When STRING in non-null. */
1302 unsigned char data
[1];
1304 /* When STRING is null. */
1309 #define SDATA_NBYTES(S) (S)->u.nbytes
1310 #define SDATA_DATA(S) (S)->u.data
1312 #endif /* not GC_CHECK_STRING_BYTES */
1316 /* Structure describing a block of memory which is sub-allocated to
1317 obtain string data memory for strings. Blocks for small strings
1318 are of fixed size SBLOCK_SIZE. Blocks for large strings are made
1319 as large as needed. */
1324 struct sblock
*next
;
1326 /* Pointer to the next free sdata block. This points past the end
1327 of the sblock if there isn't any space left in this block. */
1328 struct sdata
*next_free
;
1330 /* Start of data. */
1331 struct sdata first_data
;
1334 /* Number of Lisp strings in a string_block structure. The 1020 is
1335 1024 minus malloc overhead. */
1337 #define STRING_BLOCK_SIZE \
1338 ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String))
1340 /* Structure describing a block from which Lisp_String structures
1345 struct string_block
*next
;
1346 struct Lisp_String strings
[STRING_BLOCK_SIZE
];
1349 /* Head and tail of the list of sblock structures holding Lisp string
1350 data. We always allocate from current_sblock. The NEXT pointers
1351 in the sblock structures go from oldest_sblock to current_sblock. */
1353 static struct sblock
*oldest_sblock
, *current_sblock
;
1355 /* List of sblocks for large strings. */
1357 static struct sblock
*large_sblocks
;
1359 /* List of string_block structures, and how many there are. */
1361 static struct string_block
*string_blocks
;
1362 static int n_string_blocks
;
1364 /* Free-list of Lisp_Strings. */
1366 static struct Lisp_String
*string_free_list
;
1368 /* Number of live and free Lisp_Strings. */
1370 static int total_strings
, total_free_strings
;
1372 /* Number of bytes used by live strings. */
1374 static int total_string_size
;
1376 /* Given a pointer to a Lisp_String S which is on the free-list
1377 string_free_list, return a pointer to its successor in the
1380 #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S))
1382 /* Return a pointer to the sdata structure belonging to Lisp string S.
1383 S must be live, i.e. S->data must not be null. S->data is actually
1384 a pointer to the `u.data' member of its sdata structure; the
1385 structure starts at a constant offset in front of that. */
1387 #ifdef GC_CHECK_STRING_BYTES
1389 #define SDATA_OF_STRING(S) \
1390 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *) \
1391 - sizeof (EMACS_INT)))
1393 #else /* not GC_CHECK_STRING_BYTES */
1395 #define SDATA_OF_STRING(S) \
1396 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *)))
1398 #endif /* not GC_CHECK_STRING_BYTES */
1400 /* Value is the size of an sdata structure large enough to hold NBYTES
1401 bytes of string data. The value returned includes a terminating
1402 NUL byte, the size of the sdata structure, and padding. */
1404 #ifdef GC_CHECK_STRING_BYTES
1406 #define SDATA_SIZE(NBYTES) \
1407 ((sizeof (struct Lisp_String *) \
1409 + sizeof (EMACS_INT) \
1410 + sizeof (EMACS_INT) - 1) \
1411 & ~(sizeof (EMACS_INT) - 1))
1413 #else /* not GC_CHECK_STRING_BYTES */
1415 #define SDATA_SIZE(NBYTES) \
1416 ((sizeof (struct Lisp_String *) \
1418 + sizeof (EMACS_INT) - 1) \
1419 & ~(sizeof (EMACS_INT) - 1))
1421 #endif /* not GC_CHECK_STRING_BYTES */
1423 /* Initialize string allocation. Called from init_alloc_once. */
1428 total_strings
= total_free_strings
= total_string_size
= 0;
1429 oldest_sblock
= current_sblock
= large_sblocks
= NULL
;
1430 string_blocks
= NULL
;
1431 n_string_blocks
= 0;
1432 string_free_list
= NULL
;
1436 #ifdef GC_CHECK_STRING_BYTES
1438 static int check_string_bytes_count
;
1440 void check_string_bytes
P_ ((int));
1441 void check_sblock
P_ ((struct sblock
*));
1443 #define CHECK_STRING_BYTES(S) STRING_BYTES (S)
1446 /* Like GC_STRING_BYTES, but with debugging check. */
1450 struct Lisp_String
*s
;
1452 int nbytes
= (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1453 if (!PURE_POINTER_P (s
)
1455 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1460 /* Check validity of Lisp strings' string_bytes member in B. */
1466 struct sdata
*from
, *end
, *from_end
;
1470 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1472 /* Compute the next FROM here because copying below may
1473 overwrite data we need to compute it. */
1476 /* Check that the string size recorded in the string is the
1477 same as the one recorded in the sdata structure. */
1479 CHECK_STRING_BYTES (from
->string
);
1482 nbytes
= GC_STRING_BYTES (from
->string
);
1484 nbytes
= SDATA_NBYTES (from
);
1486 nbytes
= SDATA_SIZE (nbytes
);
1487 from_end
= (struct sdata
*) ((char *) from
+ nbytes
);
1492 /* Check validity of Lisp strings' string_bytes member. ALL_P
1493 non-zero means check all strings, otherwise check only most
1494 recently allocated strings. Used for hunting a bug. */
1497 check_string_bytes (all_p
)
1504 for (b
= large_sblocks
; b
; b
= b
->next
)
1506 struct Lisp_String
*s
= b
->first_data
.string
;
1508 CHECK_STRING_BYTES (s
);
1511 for (b
= oldest_sblock
; b
; b
= b
->next
)
1515 check_sblock (current_sblock
);
1518 #endif /* GC_CHECK_STRING_BYTES */
1521 /* Return a new Lisp_String. */
1523 static struct Lisp_String
*
1526 struct Lisp_String
*s
;
1528 /* If the free-list is empty, allocate a new string_block, and
1529 add all the Lisp_Strings in it to the free-list. */
1530 if (string_free_list
== NULL
)
1532 struct string_block
*b
;
1535 b
= (struct string_block
*) lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1536 bzero (b
, sizeof *b
);
1537 b
->next
= string_blocks
;
1541 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1544 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1545 string_free_list
= s
;
1548 total_free_strings
+= STRING_BLOCK_SIZE
;
1551 /* Pop a Lisp_String off the free-list. */
1552 s
= string_free_list
;
1553 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1555 /* Probably not strictly necessary, but play it safe. */
1556 bzero (s
, sizeof *s
);
1558 --total_free_strings
;
1561 consing_since_gc
+= sizeof *s
;
1563 #ifdef GC_CHECK_STRING_BYTES
1570 if (++check_string_bytes_count
== 200)
1572 check_string_bytes_count
= 0;
1573 check_string_bytes (1);
1576 check_string_bytes (0);
1578 #endif /* GC_CHECK_STRING_BYTES */
1584 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1585 plus a NUL byte at the end. Allocate an sdata structure for S, and
1586 set S->data to its `u.data' member. Store a NUL byte at the end of
1587 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1588 S->data if it was initially non-null. */
1591 allocate_string_data (s
, nchars
, nbytes
)
1592 struct Lisp_String
*s
;
1595 struct sdata
*data
, *old_data
;
1597 int needed
, old_nbytes
;
1599 /* Determine the number of bytes needed to store NBYTES bytes
1601 needed
= SDATA_SIZE (nbytes
);
1603 if (nbytes
> LARGE_STRING_BYTES
)
1605 size_t size
= sizeof *b
- sizeof (struct sdata
) + needed
;
1607 #ifdef DOUG_LEA_MALLOC
1608 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1609 because mapped region contents are not preserved in
1612 In case you think of allowing it in a dumped Emacs at the
1613 cost of not being able to re-dump, there's another reason:
1614 mmap'ed data typically have an address towards the top of the
1615 address space, which won't fit into an EMACS_INT (at least on
1616 32-bit systems with the current tagging scheme). --fx */
1617 mallopt (M_MMAP_MAX
, 0);
1620 b
= (struct sblock
*) lisp_malloc (size
, MEM_TYPE_NON_LISP
);
1622 #ifdef DOUG_LEA_MALLOC
1623 /* Back to a reasonable maximum of mmap'ed areas. */
1624 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1627 b
->next_free
= &b
->first_data
;
1628 b
->first_data
.string
= NULL
;
1629 b
->next
= large_sblocks
;
1632 else if (current_sblock
== NULL
1633 || (((char *) current_sblock
+ SBLOCK_SIZE
1634 - (char *) current_sblock
->next_free
)
1637 /* Not enough room in the current sblock. */
1638 b
= (struct sblock
*) lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
1639 b
->next_free
= &b
->first_data
;
1640 b
->first_data
.string
= NULL
;
1644 current_sblock
->next
= b
;
1652 old_data
= s
->data
? SDATA_OF_STRING (s
) : NULL
;
1653 old_nbytes
= GC_STRING_BYTES (s
);
1655 data
= b
->next_free
;
1657 s
->data
= SDATA_DATA (data
);
1658 #ifdef GC_CHECK_STRING_BYTES
1659 SDATA_NBYTES (data
) = nbytes
;
1662 s
->size_byte
= nbytes
;
1663 s
->data
[nbytes
] = '\0';
1664 b
->next_free
= (struct sdata
*) ((char *) data
+ needed
);
1666 /* If S had already data assigned, mark that as free by setting its
1667 string back-pointer to null, and recording the size of the data
1671 SDATA_NBYTES (old_data
) = old_nbytes
;
1672 old_data
->string
= NULL
;
1675 consing_since_gc
+= needed
;
1679 /* Sweep and compact strings. */
1684 struct string_block
*b
, *next
;
1685 struct string_block
*live_blocks
= NULL
;
1687 string_free_list
= NULL
;
1688 total_strings
= total_free_strings
= 0;
1689 total_string_size
= 0;
1691 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
1692 for (b
= string_blocks
; b
; b
= next
)
1695 struct Lisp_String
*free_list_before
= string_free_list
;
1699 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
1701 struct Lisp_String
*s
= b
->strings
+ i
;
1705 /* String was not on free-list before. */
1706 if (STRING_MARKED_P (s
))
1708 /* String is live; unmark it and its intervals. */
1711 if (!NULL_INTERVAL_P (s
->intervals
))
1712 UNMARK_BALANCE_INTERVALS (s
->intervals
);
1715 total_string_size
+= STRING_BYTES (s
);
1719 /* String is dead. Put it on the free-list. */
1720 struct sdata
*data
= SDATA_OF_STRING (s
);
1722 /* Save the size of S in its sdata so that we know
1723 how large that is. Reset the sdata's string
1724 back-pointer so that we know it's free. */
1725 #ifdef GC_CHECK_STRING_BYTES
1726 if (GC_STRING_BYTES (s
) != SDATA_NBYTES (data
))
1729 data
->u
.nbytes
= GC_STRING_BYTES (s
);
1731 data
->string
= NULL
;
1733 /* Reset the strings's `data' member so that we
1737 /* Put the string on the free-list. */
1738 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1739 string_free_list
= s
;
1745 /* S was on the free-list before. Put it there again. */
1746 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1747 string_free_list
= s
;
1752 /* Free blocks that contain free Lisp_Strings only, except
1753 the first two of them. */
1754 if (nfree
== STRING_BLOCK_SIZE
1755 && total_free_strings
> STRING_BLOCK_SIZE
)
1759 string_free_list
= free_list_before
;
1763 total_free_strings
+= nfree
;
1764 b
->next
= live_blocks
;
1769 string_blocks
= live_blocks
;
1770 free_large_strings ();
1771 compact_small_strings ();
1775 /* Free dead large strings. */
1778 free_large_strings ()
1780 struct sblock
*b
, *next
;
1781 struct sblock
*live_blocks
= NULL
;
1783 for (b
= large_sblocks
; b
; b
= next
)
1787 if (b
->first_data
.string
== NULL
)
1791 b
->next
= live_blocks
;
1796 large_sblocks
= live_blocks
;
1800 /* Compact data of small strings. Free sblocks that don't contain
1801 data of live strings after compaction. */
1804 compact_small_strings ()
1806 struct sblock
*b
, *tb
, *next
;
1807 struct sdata
*from
, *to
, *end
, *tb_end
;
1808 struct sdata
*to_end
, *from_end
;
1810 /* TB is the sblock we copy to, TO is the sdata within TB we copy
1811 to, and TB_END is the end of TB. */
1813 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
1814 to
= &tb
->first_data
;
1816 /* Step through the blocks from the oldest to the youngest. We
1817 expect that old blocks will stabilize over time, so that less
1818 copying will happen this way. */
1819 for (b
= oldest_sblock
; b
; b
= b
->next
)
1822 xassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
1824 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1826 /* Compute the next FROM here because copying below may
1827 overwrite data we need to compute it. */
1830 #ifdef GC_CHECK_STRING_BYTES
1831 /* Check that the string size recorded in the string is the
1832 same as the one recorded in the sdata structure. */
1834 && GC_STRING_BYTES (from
->string
) != SDATA_NBYTES (from
))
1836 #endif /* GC_CHECK_STRING_BYTES */
1839 nbytes
= GC_STRING_BYTES (from
->string
);
1841 nbytes
= SDATA_NBYTES (from
);
1843 nbytes
= SDATA_SIZE (nbytes
);
1844 from_end
= (struct sdata
*) ((char *) from
+ nbytes
);
1846 /* FROM->string non-null means it's alive. Copy its data. */
1849 /* If TB is full, proceed with the next sblock. */
1850 to_end
= (struct sdata
*) ((char *) to
+ nbytes
);
1851 if (to_end
> tb_end
)
1855 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
1856 to
= &tb
->first_data
;
1857 to_end
= (struct sdata
*) ((char *) to
+ nbytes
);
1860 /* Copy, and update the string's `data' pointer. */
1863 xassert (tb
!= b
|| to
<= from
);
1864 safe_bcopy ((char *) from
, (char *) to
, nbytes
);
1865 to
->string
->data
= SDATA_DATA (to
);
1868 /* Advance past the sdata we copied to. */
1874 /* The rest of the sblocks following TB don't contain live data, so
1875 we can free them. */
1876 for (b
= tb
->next
; b
; b
= next
)
1884 current_sblock
= tb
;
1888 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
1889 doc
: /* Return a newly created string of length LENGTH, with each element being INIT.
1890 Both LENGTH and INIT must be numbers. */)
1892 Lisp_Object length
, init
;
1894 register Lisp_Object val
;
1895 register unsigned char *p
, *end
;
1898 CHECK_NATNUM (length
);
1899 CHECK_NUMBER (init
);
1902 if (SINGLE_BYTE_CHAR_P (c
))
1904 nbytes
= XINT (length
);
1905 val
= make_uninit_string (nbytes
);
1907 end
= p
+ SCHARS (val
);
1913 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
1914 int len
= CHAR_STRING (c
, str
);
1916 nbytes
= len
* XINT (length
);
1917 val
= make_uninit_multibyte_string (XINT (length
), nbytes
);
1922 bcopy (str
, p
, len
);
1932 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
1933 doc
: /* Return a new bool-vector of length LENGTH, using INIT for as each element.
1934 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
1936 Lisp_Object length
, init
;
1938 register Lisp_Object val
;
1939 struct Lisp_Bool_Vector
*p
;
1941 int length_in_chars
, length_in_elts
, bits_per_value
;
1943 CHECK_NATNUM (length
);
1945 bits_per_value
= sizeof (EMACS_INT
) * BITS_PER_CHAR
;
1947 length_in_elts
= (XFASTINT (length
) + bits_per_value
- 1) / bits_per_value
;
1948 length_in_chars
= ((XFASTINT (length
) + BITS_PER_CHAR
- 1) / BITS_PER_CHAR
);
1950 /* We must allocate one more elements than LENGTH_IN_ELTS for the
1951 slot `size' of the struct Lisp_Bool_Vector. */
1952 val
= Fmake_vector (make_number (length_in_elts
+ 1), Qnil
);
1953 p
= XBOOL_VECTOR (val
);
1955 /* Get rid of any bits that would cause confusion. */
1957 XSETBOOL_VECTOR (val
, p
);
1958 p
->size
= XFASTINT (length
);
1960 real_init
= (NILP (init
) ? 0 : -1);
1961 for (i
= 0; i
< length_in_chars
; i
++)
1962 p
->data
[i
] = real_init
;
1964 /* Clear the extraneous bits in the last byte. */
1965 if (XINT (length
) != length_in_chars
* BITS_PER_CHAR
)
1966 XBOOL_VECTOR (val
)->data
[length_in_chars
- 1]
1967 &= (1 << (XINT (length
) % BITS_PER_CHAR
)) - 1;
1973 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
1974 of characters from the contents. This string may be unibyte or
1975 multibyte, depending on the contents. */
1978 make_string (contents
, nbytes
)
1979 const char *contents
;
1982 register Lisp_Object val
;
1983 int nchars
, multibyte_nbytes
;
1985 parse_str_as_multibyte (contents
, nbytes
, &nchars
, &multibyte_nbytes
);
1986 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
1987 /* CONTENTS contains no multibyte sequences or contains an invalid
1988 multibyte sequence. We must make unibyte string. */
1989 val
= make_unibyte_string (contents
, nbytes
);
1991 val
= make_multibyte_string (contents
, nchars
, nbytes
);
1996 /* Make an unibyte string from LENGTH bytes at CONTENTS. */
1999 make_unibyte_string (contents
, length
)
2000 const char *contents
;
2003 register Lisp_Object val
;
2004 val
= make_uninit_string (length
);
2005 bcopy (contents
, SDATA (val
), length
);
2006 STRING_SET_UNIBYTE (val
);
2011 /* Make a multibyte string from NCHARS characters occupying NBYTES
2012 bytes at CONTENTS. */
2015 make_multibyte_string (contents
, nchars
, nbytes
)
2016 const char *contents
;
2019 register Lisp_Object val
;
2020 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2021 bcopy (contents
, SDATA (val
), nbytes
);
2026 /* Make a string from NCHARS characters occupying NBYTES bytes at
2027 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2030 make_string_from_bytes (contents
, nchars
, nbytes
)
2031 const char *contents
;
2034 register Lisp_Object val
;
2035 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2036 bcopy (contents
, SDATA (val
), nbytes
);
2037 if (SBYTES (val
) == SCHARS (val
))
2038 STRING_SET_UNIBYTE (val
);
2043 /* Make a string from NCHARS characters occupying NBYTES bytes at
2044 CONTENTS. The argument MULTIBYTE controls whether to label the
2045 string as multibyte. If NCHARS is negative, it counts the number of
2046 characters by itself. */
2049 make_specified_string (contents
, nchars
, nbytes
, multibyte
)
2050 const char *contents
;
2054 register Lisp_Object val
;
2059 nchars
= multibyte_chars_in_text (contents
, nbytes
);
2063 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2064 bcopy (contents
, SDATA (val
), nbytes
);
2066 STRING_SET_UNIBYTE (val
);
2071 /* Make a string from the data at STR, treating it as multibyte if the
2078 return make_string (str
, strlen (str
));
2082 /* Return an unibyte Lisp_String set up to hold LENGTH characters
2083 occupying LENGTH bytes. */
2086 make_uninit_string (length
)
2090 val
= make_uninit_multibyte_string (length
, length
);
2091 STRING_SET_UNIBYTE (val
);
2096 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2097 which occupy NBYTES bytes. */
2100 make_uninit_multibyte_string (nchars
, nbytes
)
2104 struct Lisp_String
*s
;
2109 s
= allocate_string ();
2110 allocate_string_data (s
, nchars
, nbytes
);
2111 XSETSTRING (string
, s
);
2112 string_chars_consed
+= nbytes
;
2118 /***********************************************************************
2120 ***********************************************************************/
2122 /* We store float cells inside of float_blocks, allocating a new
2123 float_block with malloc whenever necessary. Float cells reclaimed
2124 by GC are put on a free list to be reallocated before allocating
2125 any new float cells from the latest float_block. */
2127 #define FLOAT_BLOCK_SIZE \
2128 (((BLOCK_BYTES - sizeof (struct float_block *)) * CHAR_BIT) \
2129 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2131 #define GETMARKBIT(block,n) \
2132 (((block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2133 >> ((n) % (sizeof(int) * CHAR_BIT))) \
2136 #define SETMARKBIT(block,n) \
2137 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2138 |= 1 << ((n) % (sizeof(int) * CHAR_BIT))
2140 #define UNSETMARKBIT(block,n) \
2141 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2142 &= ~(1 << ((n) % (sizeof(int) * CHAR_BIT)))
2144 #define FLOAT_BLOCK(fptr) \
2145 ((struct float_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2147 #define FLOAT_INDEX(fptr) \
2148 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2152 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2153 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2154 int gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2155 struct float_block
*next
;
2158 #define FLOAT_MARKED_P(fptr) \
2159 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2161 #define FLOAT_MARK(fptr) \
2162 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2164 #define FLOAT_UNMARK(fptr) \
2165 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2167 /* Current float_block. */
2169 struct float_block
*float_block
;
2171 /* Index of first unused Lisp_Float in the current float_block. */
2173 int float_block_index
;
2175 /* Total number of float blocks now in use. */
2179 /* Free-list of Lisp_Floats. */
2181 struct Lisp_Float
*float_free_list
;
2184 /* Initialize float allocation. */
2190 float_block_index
= FLOAT_BLOCK_SIZE
; /* Force alloc of new float_block. */
2191 float_free_list
= 0;
2196 /* Explicitly free a float cell by putting it on the free-list. */
2200 struct Lisp_Float
*ptr
;
2202 *(struct Lisp_Float
**)&ptr
->data
= float_free_list
;
2203 float_free_list
= ptr
;
2207 /* Return a new float object with value FLOAT_VALUE. */
2210 make_float (float_value
)
2213 register Lisp_Object val
;
2215 if (float_free_list
)
2217 /* We use the data field for chaining the free list
2218 so that we won't use the same field that has the mark bit. */
2219 XSETFLOAT (val
, float_free_list
);
2220 float_free_list
= *(struct Lisp_Float
**)&float_free_list
->data
;
2224 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2226 register struct float_block
*new;
2228 new = (struct float_block
*) lisp_align_malloc (sizeof *new,
2230 new->next
= float_block
;
2232 float_block_index
= 0;
2235 XSETFLOAT (val
, &float_block
->floats
[float_block_index
++]);
2238 XFLOAT_DATA (val
) = float_value
;
2239 FLOAT_UNMARK (XFLOAT (val
));
2240 consing_since_gc
+= sizeof (struct Lisp_Float
);
2247 /***********************************************************************
2249 ***********************************************************************/
2251 /* We store cons cells inside of cons_blocks, allocating a new
2252 cons_block with malloc whenever necessary. Cons cells reclaimed by
2253 GC are put on a free list to be reallocated before allocating
2254 any new cons cells from the latest cons_block. */
2256 #define CONS_BLOCK_SIZE \
2257 (((BLOCK_BYTES - sizeof (struct cons_block *)) * CHAR_BIT) \
2258 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2260 #define CONS_BLOCK(fptr) \
2261 ((struct cons_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2263 #define CONS_INDEX(fptr) \
2264 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2268 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2269 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2270 int gcmarkbits
[1 + CONS_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2271 struct cons_block
*next
;
2274 #define CONS_MARKED_P(fptr) \
2275 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2277 #define CONS_MARK(fptr) \
2278 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2280 #define CONS_UNMARK(fptr) \
2281 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2283 /* Current cons_block. */
2285 struct cons_block
*cons_block
;
2287 /* Index of first unused Lisp_Cons in the current block. */
2289 int cons_block_index
;
2291 /* Free-list of Lisp_Cons structures. */
2293 struct Lisp_Cons
*cons_free_list
;
2295 /* Total number of cons blocks now in use. */
2300 /* Initialize cons allocation. */
2306 cons_block_index
= CONS_BLOCK_SIZE
; /* Force alloc of new cons_block. */
2312 /* Explicitly free a cons cell by putting it on the free-list. */
2316 struct Lisp_Cons
*ptr
;
2318 *(struct Lisp_Cons
**)&ptr
->cdr
= cons_free_list
;
2322 cons_free_list
= ptr
;
2326 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
2327 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2329 Lisp_Object car
, cdr
;
2331 register Lisp_Object val
;
2335 /* We use the cdr for chaining the free list
2336 so that we won't use the same field that has the mark bit. */
2337 XSETCONS (val
, cons_free_list
);
2338 cons_free_list
= *(struct Lisp_Cons
**)&cons_free_list
->cdr
;
2342 if (cons_block_index
== CONS_BLOCK_SIZE
)
2344 register struct cons_block
*new;
2345 new = (struct cons_block
*) lisp_align_malloc (sizeof *new,
2347 new->next
= cons_block
;
2349 cons_block_index
= 0;
2352 XSETCONS (val
, &cons_block
->conses
[cons_block_index
++]);
2357 CONS_UNMARK (XCONS (val
));
2358 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2359 cons_cells_consed
++;
2364 /* Make a list of 2, 3, 4 or 5 specified objects. */
2368 Lisp_Object arg1
, arg2
;
2370 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2375 list3 (arg1
, arg2
, arg3
)
2376 Lisp_Object arg1
, arg2
, arg3
;
2378 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2383 list4 (arg1
, arg2
, arg3
, arg4
)
2384 Lisp_Object arg1
, arg2
, arg3
, arg4
;
2386 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2391 list5 (arg1
, arg2
, arg3
, arg4
, arg5
)
2392 Lisp_Object arg1
, arg2
, arg3
, arg4
, arg5
;
2394 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2395 Fcons (arg5
, Qnil
)))));
2399 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
2400 doc
: /* Return a newly created list with specified arguments as elements.
2401 Any number of arguments, even zero arguments, are allowed.
2402 usage: (list &rest OBJECTS) */)
2405 register Lisp_Object
*args
;
2407 register Lisp_Object val
;
2413 val
= Fcons (args
[nargs
], val
);
2419 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2420 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2422 register Lisp_Object length
, init
;
2424 register Lisp_Object val
;
2427 CHECK_NATNUM (length
);
2428 size
= XFASTINT (length
);
2433 val
= Fcons (init
, val
);
2438 val
= Fcons (init
, val
);
2443 val
= Fcons (init
, val
);
2448 val
= Fcons (init
, val
);
2453 val
= Fcons (init
, val
);
2468 /***********************************************************************
2470 ***********************************************************************/
2472 /* Singly-linked list of all vectors. */
2474 struct Lisp_Vector
*all_vectors
;
2476 /* Total number of vector-like objects now in use. */
2481 /* Value is a pointer to a newly allocated Lisp_Vector structure
2482 with room for LEN Lisp_Objects. */
2484 static struct Lisp_Vector
*
2485 allocate_vectorlike (len
, type
)
2489 struct Lisp_Vector
*p
;
2492 #ifdef DOUG_LEA_MALLOC
2493 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
2494 because mapped region contents are not preserved in
2496 mallopt (M_MMAP_MAX
, 0);
2499 nbytes
= sizeof *p
+ (len
- 1) * sizeof p
->contents
[0];
2500 p
= (struct Lisp_Vector
*) lisp_malloc (nbytes
, type
);
2502 #ifdef DOUG_LEA_MALLOC
2503 /* Back to a reasonable maximum of mmap'ed areas. */
2504 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2507 consing_since_gc
+= nbytes
;
2508 vector_cells_consed
+= len
;
2510 p
->next
= all_vectors
;
2517 /* Allocate a vector with NSLOTS slots. */
2519 struct Lisp_Vector
*
2520 allocate_vector (nslots
)
2523 struct Lisp_Vector
*v
= allocate_vectorlike (nslots
, MEM_TYPE_VECTOR
);
2529 /* Allocate other vector-like structures. */
2531 struct Lisp_Hash_Table
*
2532 allocate_hash_table ()
2534 EMACS_INT len
= VECSIZE (struct Lisp_Hash_Table
);
2535 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_HASH_TABLE
);
2539 for (i
= 0; i
< len
; ++i
)
2540 v
->contents
[i
] = Qnil
;
2542 return (struct Lisp_Hash_Table
*) v
;
2549 EMACS_INT len
= VECSIZE (struct window
);
2550 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_WINDOW
);
2553 for (i
= 0; i
< len
; ++i
)
2554 v
->contents
[i
] = Qnil
;
2557 return (struct window
*) v
;
2564 EMACS_INT len
= VECSIZE (struct frame
);
2565 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_FRAME
);
2568 for (i
= 0; i
< len
; ++i
)
2569 v
->contents
[i
] = make_number (0);
2571 return (struct frame
*) v
;
2575 struct Lisp_Process
*
2578 EMACS_INT len
= VECSIZE (struct Lisp_Process
);
2579 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_PROCESS
);
2582 for (i
= 0; i
< len
; ++i
)
2583 v
->contents
[i
] = Qnil
;
2586 return (struct Lisp_Process
*) v
;
2590 struct Lisp_Vector
*
2591 allocate_other_vector (len
)
2594 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_VECTOR
);
2597 for (i
= 0; i
< len
; ++i
)
2598 v
->contents
[i
] = Qnil
;
2605 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
2606 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
2607 See also the function `vector'. */)
2609 register Lisp_Object length
, init
;
2612 register EMACS_INT sizei
;
2614 register struct Lisp_Vector
*p
;
2616 CHECK_NATNUM (length
);
2617 sizei
= XFASTINT (length
);
2619 p
= allocate_vector (sizei
);
2620 for (index
= 0; index
< sizei
; index
++)
2621 p
->contents
[index
] = init
;
2623 XSETVECTOR (vector
, p
);
2628 DEFUN ("make-char-table", Fmake_char_table
, Smake_char_table
, 1, 2, 0,
2629 doc
: /* Return a newly created char-table, with purpose PURPOSE.
2630 Each element is initialized to INIT, which defaults to nil.
2631 PURPOSE should be a symbol which has a `char-table-extra-slots' property.
2632 The property's value should be an integer between 0 and 10. */)
2634 register Lisp_Object purpose
, init
;
2638 CHECK_SYMBOL (purpose
);
2639 n
= Fget (purpose
, Qchar_table_extra_slots
);
2641 if (XINT (n
) < 0 || XINT (n
) > 10)
2642 args_out_of_range (n
, Qnil
);
2643 /* Add 2 to the size for the defalt and parent slots. */
2644 vector
= Fmake_vector (make_number (CHAR_TABLE_STANDARD_SLOTS
+ XINT (n
)),
2646 XCHAR_TABLE (vector
)->top
= Qt
;
2647 XCHAR_TABLE (vector
)->parent
= Qnil
;
2648 XCHAR_TABLE (vector
)->purpose
= purpose
;
2649 XSETCHAR_TABLE (vector
, XCHAR_TABLE (vector
));
2654 /* Return a newly created sub char table with default value DEFALT.
2655 Since a sub char table does not appear as a top level Emacs Lisp
2656 object, we don't need a Lisp interface to make it. */
2659 make_sub_char_table (defalt
)
2663 = Fmake_vector (make_number (SUB_CHAR_TABLE_STANDARD_SLOTS
), Qnil
);
2664 XCHAR_TABLE (vector
)->top
= Qnil
;
2665 XCHAR_TABLE (vector
)->defalt
= defalt
;
2666 XSETCHAR_TABLE (vector
, XCHAR_TABLE (vector
));
2671 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
2672 doc
: /* Return a newly created vector with specified arguments as elements.
2673 Any number of arguments, even zero arguments, are allowed.
2674 usage: (vector &rest OBJECTS) */)
2679 register Lisp_Object len
, val
;
2681 register struct Lisp_Vector
*p
;
2683 XSETFASTINT (len
, nargs
);
2684 val
= Fmake_vector (len
, Qnil
);
2686 for (index
= 0; index
< nargs
; index
++)
2687 p
->contents
[index
] = args
[index
];
2692 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
2693 doc
: /* Create a byte-code object with specified arguments as elements.
2694 The arguments should be the arglist, bytecode-string, constant vector,
2695 stack size, (optional) doc string, and (optional) interactive spec.
2696 The first four arguments are required; at most six have any
2698 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
2703 register Lisp_Object len
, val
;
2705 register struct Lisp_Vector
*p
;
2707 XSETFASTINT (len
, nargs
);
2708 if (!NILP (Vpurify_flag
))
2709 val
= make_pure_vector ((EMACS_INT
) nargs
);
2711 val
= Fmake_vector (len
, Qnil
);
2713 if (STRINGP (args
[1]) && STRING_MULTIBYTE (args
[1]))
2714 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
2715 earlier because they produced a raw 8-bit string for byte-code
2716 and now such a byte-code string is loaded as multibyte while
2717 raw 8-bit characters converted to multibyte form. Thus, now we
2718 must convert them back to the original unibyte form. */
2719 args
[1] = Fstring_as_unibyte (args
[1]);
2722 for (index
= 0; index
< nargs
; index
++)
2724 if (!NILP (Vpurify_flag
))
2725 args
[index
] = Fpurecopy (args
[index
]);
2726 p
->contents
[index
] = args
[index
];
2728 XSETCOMPILED (val
, p
);
2734 /***********************************************************************
2736 ***********************************************************************/
2738 /* Each symbol_block is just under 1020 bytes long, since malloc
2739 really allocates in units of powers of two and uses 4 bytes for its
2742 #define SYMBOL_BLOCK_SIZE \
2743 ((1020 - sizeof (struct symbol_block *)) / sizeof (struct Lisp_Symbol))
2747 struct symbol_block
*next
;
2748 struct Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
2751 /* Current symbol block and index of first unused Lisp_Symbol
2754 struct symbol_block
*symbol_block
;
2755 int symbol_block_index
;
2757 /* List of free symbols. */
2759 struct Lisp_Symbol
*symbol_free_list
;
2761 /* Total number of symbol blocks now in use. */
2763 int n_symbol_blocks
;
2766 /* Initialize symbol allocation. */
2771 symbol_block
= (struct symbol_block
*) lisp_malloc (sizeof *symbol_block
,
2773 symbol_block
->next
= 0;
2774 bzero ((char *) symbol_block
->symbols
, sizeof symbol_block
->symbols
);
2775 symbol_block_index
= 0;
2776 symbol_free_list
= 0;
2777 n_symbol_blocks
= 1;
2781 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
2782 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
2783 Its value and function definition are void, and its property list is nil. */)
2787 register Lisp_Object val
;
2788 register struct Lisp_Symbol
*p
;
2790 CHECK_STRING (name
);
2792 if (symbol_free_list
)
2794 XSETSYMBOL (val
, symbol_free_list
);
2795 symbol_free_list
= *(struct Lisp_Symbol
**)&symbol_free_list
->value
;
2799 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
2801 struct symbol_block
*new;
2802 new = (struct symbol_block
*) lisp_malloc (sizeof *new,
2804 new->next
= symbol_block
;
2806 symbol_block_index
= 0;
2809 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
++]);
2815 p
->value
= Qunbound
;
2816 p
->function
= Qunbound
;
2819 p
->interned
= SYMBOL_UNINTERNED
;
2821 p
->indirect_variable
= 0;
2822 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
2829 /***********************************************************************
2830 Marker (Misc) Allocation
2831 ***********************************************************************/
2833 /* Allocation of markers and other objects that share that structure.
2834 Works like allocation of conses. */
2836 #define MARKER_BLOCK_SIZE \
2837 ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc))
2841 struct marker_block
*next
;
2842 union Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
2845 struct marker_block
*marker_block
;
2846 int marker_block_index
;
2848 union Lisp_Misc
*marker_free_list
;
2850 /* Total number of marker blocks now in use. */
2852 int n_marker_blocks
;
2857 marker_block
= (struct marker_block
*) lisp_malloc (sizeof *marker_block
,
2859 marker_block
->next
= 0;
2860 bzero ((char *) marker_block
->markers
, sizeof marker_block
->markers
);
2861 marker_block_index
= 0;
2862 marker_free_list
= 0;
2863 n_marker_blocks
= 1;
2866 /* Return a newly allocated Lisp_Misc object, with no substructure. */
2873 if (marker_free_list
)
2875 XSETMISC (val
, marker_free_list
);
2876 marker_free_list
= marker_free_list
->u_free
.chain
;
2880 if (marker_block_index
== MARKER_BLOCK_SIZE
)
2882 struct marker_block
*new;
2883 new = (struct marker_block
*) lisp_malloc (sizeof *new,
2885 new->next
= marker_block
;
2887 marker_block_index
= 0;
2890 XSETMISC (val
, &marker_block
->markers
[marker_block_index
++]);
2893 consing_since_gc
+= sizeof (union Lisp_Misc
);
2894 misc_objects_consed
++;
2895 XMARKER (val
)->gcmarkbit
= 0;
2899 /* Return a Lisp_Misc_Save_Value object containing POINTER and
2900 INTEGER. This is used to package C values to call record_unwind_protect.
2901 The unwind function can get the C values back using XSAVE_VALUE. */
2904 make_save_value (pointer
, integer
)
2908 register Lisp_Object val
;
2909 register struct Lisp_Save_Value
*p
;
2911 val
= allocate_misc ();
2912 XMISCTYPE (val
) = Lisp_Misc_Save_Value
;
2913 p
= XSAVE_VALUE (val
);
2914 p
->pointer
= pointer
;
2915 p
->integer
= integer
;
2919 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
2920 doc
: /* Return a newly allocated marker which does not point at any place. */)
2923 register Lisp_Object val
;
2924 register struct Lisp_Marker
*p
;
2926 val
= allocate_misc ();
2927 XMISCTYPE (val
) = Lisp_Misc_Marker
;
2933 p
->insertion_type
= 0;
2937 /* Put MARKER back on the free list after using it temporarily. */
2940 free_marker (marker
)
2943 unchain_marker (XMARKER (marker
));
2945 XMISC (marker
)->u_marker
.type
= Lisp_Misc_Free
;
2946 XMISC (marker
)->u_free
.chain
= marker_free_list
;
2947 marker_free_list
= XMISC (marker
);
2949 total_free_markers
++;
2953 /* Return a newly created vector or string with specified arguments as
2954 elements. If all the arguments are characters that can fit
2955 in a string of events, make a string; otherwise, make a vector.
2957 Any number of arguments, even zero arguments, are allowed. */
2960 make_event_array (nargs
, args
)
2966 for (i
= 0; i
< nargs
; i
++)
2967 /* The things that fit in a string
2968 are characters that are in 0...127,
2969 after discarding the meta bit and all the bits above it. */
2970 if (!INTEGERP (args
[i
])
2971 || (XUINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
2972 return Fvector (nargs
, args
);
2974 /* Since the loop exited, we know that all the things in it are
2975 characters, so we can make a string. */
2979 result
= Fmake_string (make_number (nargs
), make_number (0));
2980 for (i
= 0; i
< nargs
; i
++)
2982 SSET (result
, i
, XINT (args
[i
]));
2983 /* Move the meta bit to the right place for a string char. */
2984 if (XINT (args
[i
]) & CHAR_META
)
2985 SSET (result
, i
, SREF (result
, i
) | 0x80);
2994 /************************************************************************
2996 ************************************************************************/
2998 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
3000 /* Conservative C stack marking requires a method to identify possibly
3001 live Lisp objects given a pointer value. We do this by keeping
3002 track of blocks of Lisp data that are allocated in a red-black tree
3003 (see also the comment of mem_node which is the type of nodes in
3004 that tree). Function lisp_malloc adds information for an allocated
3005 block to the red-black tree with calls to mem_insert, and function
3006 lisp_free removes it with mem_delete. Functions live_string_p etc
3007 call mem_find to lookup information about a given pointer in the
3008 tree, and use that to determine if the pointer points to a Lisp
3011 /* Initialize this part of alloc.c. */
3016 mem_z
.left
= mem_z
.right
= MEM_NIL
;
3017 mem_z
.parent
= NULL
;
3018 mem_z
.color
= MEM_BLACK
;
3019 mem_z
.start
= mem_z
.end
= NULL
;
3024 /* Value is a pointer to the mem_node containing START. Value is
3025 MEM_NIL if there is no node in the tree containing START. */
3027 static INLINE
struct mem_node
*
3033 if (start
< min_heap_address
|| start
> max_heap_address
)
3036 /* Make the search always successful to speed up the loop below. */
3037 mem_z
.start
= start
;
3038 mem_z
.end
= (char *) start
+ 1;
3041 while (start
< p
->start
|| start
>= p
->end
)
3042 p
= start
< p
->start
? p
->left
: p
->right
;
3047 /* Insert a new node into the tree for a block of memory with start
3048 address START, end address END, and type TYPE. Value is a
3049 pointer to the node that was inserted. */
3051 static struct mem_node
*
3052 mem_insert (start
, end
, type
)
3056 struct mem_node
*c
, *parent
, *x
;
3058 if (start
< min_heap_address
)
3059 min_heap_address
= start
;
3060 if (end
> max_heap_address
)
3061 max_heap_address
= end
;
3063 /* See where in the tree a node for START belongs. In this
3064 particular application, it shouldn't happen that a node is already
3065 present. For debugging purposes, let's check that. */
3069 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3071 while (c
!= MEM_NIL
)
3073 if (start
>= c
->start
&& start
< c
->end
)
3076 c
= start
< c
->start
? c
->left
: c
->right
;
3079 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3081 while (c
!= MEM_NIL
)
3084 c
= start
< c
->start
? c
->left
: c
->right
;
3087 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3089 /* Create a new node. */
3090 #ifdef GC_MALLOC_CHECK
3091 x
= (struct mem_node
*) _malloc_internal (sizeof *x
);
3095 x
= (struct mem_node
*) xmalloc (sizeof *x
);
3101 x
->left
= x
->right
= MEM_NIL
;
3104 /* Insert it as child of PARENT or install it as root. */
3107 if (start
< parent
->start
)
3115 /* Re-establish red-black tree properties. */
3116 mem_insert_fixup (x
);
3122 /* Re-establish the red-black properties of the tree, and thereby
3123 balance the tree, after node X has been inserted; X is always red. */
3126 mem_insert_fixup (x
)
3129 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3131 /* X is red and its parent is red. This is a violation of
3132 red-black tree property #3. */
3134 if (x
->parent
== x
->parent
->parent
->left
)
3136 /* We're on the left side of our grandparent, and Y is our
3138 struct mem_node
*y
= x
->parent
->parent
->right
;
3140 if (y
->color
== MEM_RED
)
3142 /* Uncle and parent are red but should be black because
3143 X is red. Change the colors accordingly and proceed
3144 with the grandparent. */
3145 x
->parent
->color
= MEM_BLACK
;
3146 y
->color
= MEM_BLACK
;
3147 x
->parent
->parent
->color
= MEM_RED
;
3148 x
= x
->parent
->parent
;
3152 /* Parent and uncle have different colors; parent is
3153 red, uncle is black. */
3154 if (x
== x
->parent
->right
)
3157 mem_rotate_left (x
);
3160 x
->parent
->color
= MEM_BLACK
;
3161 x
->parent
->parent
->color
= MEM_RED
;
3162 mem_rotate_right (x
->parent
->parent
);
3167 /* This is the symmetrical case of above. */
3168 struct mem_node
*y
= x
->parent
->parent
->left
;
3170 if (y
->color
== MEM_RED
)
3172 x
->parent
->color
= MEM_BLACK
;
3173 y
->color
= MEM_BLACK
;
3174 x
->parent
->parent
->color
= MEM_RED
;
3175 x
= x
->parent
->parent
;
3179 if (x
== x
->parent
->left
)
3182 mem_rotate_right (x
);
3185 x
->parent
->color
= MEM_BLACK
;
3186 x
->parent
->parent
->color
= MEM_RED
;
3187 mem_rotate_left (x
->parent
->parent
);
3192 /* The root may have been changed to red due to the algorithm. Set
3193 it to black so that property #5 is satisfied. */
3194 mem_root
->color
= MEM_BLACK
;
3210 /* Turn y's left sub-tree into x's right sub-tree. */
3213 if (y
->left
!= MEM_NIL
)
3214 y
->left
->parent
= x
;
3216 /* Y's parent was x's parent. */
3218 y
->parent
= x
->parent
;
3220 /* Get the parent to point to y instead of x. */
3223 if (x
== x
->parent
->left
)
3224 x
->parent
->left
= y
;
3226 x
->parent
->right
= y
;
3231 /* Put x on y's left. */
3245 mem_rotate_right (x
)
3248 struct mem_node
*y
= x
->left
;
3251 if (y
->right
!= MEM_NIL
)
3252 y
->right
->parent
= x
;
3255 y
->parent
= x
->parent
;
3258 if (x
== x
->parent
->right
)
3259 x
->parent
->right
= y
;
3261 x
->parent
->left
= y
;
3272 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
3278 struct mem_node
*x
, *y
;
3280 if (!z
|| z
== MEM_NIL
)
3283 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
3288 while (y
->left
!= MEM_NIL
)
3292 if (y
->left
!= MEM_NIL
)
3297 x
->parent
= y
->parent
;
3300 if (y
== y
->parent
->left
)
3301 y
->parent
->left
= x
;
3303 y
->parent
->right
= x
;
3310 z
->start
= y
->start
;
3315 if (y
->color
== MEM_BLACK
)
3316 mem_delete_fixup (x
);
3318 #ifdef GC_MALLOC_CHECK
3326 /* Re-establish the red-black properties of the tree, after a
3330 mem_delete_fixup (x
)
3333 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
3335 if (x
== x
->parent
->left
)
3337 struct mem_node
*w
= x
->parent
->right
;
3339 if (w
->color
== MEM_RED
)
3341 w
->color
= MEM_BLACK
;
3342 x
->parent
->color
= MEM_RED
;
3343 mem_rotate_left (x
->parent
);
3344 w
= x
->parent
->right
;
3347 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
3354 if (w
->right
->color
== MEM_BLACK
)
3356 w
->left
->color
= MEM_BLACK
;
3358 mem_rotate_right (w
);
3359 w
= x
->parent
->right
;
3361 w
->color
= x
->parent
->color
;
3362 x
->parent
->color
= MEM_BLACK
;
3363 w
->right
->color
= MEM_BLACK
;
3364 mem_rotate_left (x
->parent
);
3370 struct mem_node
*w
= x
->parent
->left
;
3372 if (w
->color
== MEM_RED
)
3374 w
->color
= MEM_BLACK
;
3375 x
->parent
->color
= MEM_RED
;
3376 mem_rotate_right (x
->parent
);
3377 w
= x
->parent
->left
;
3380 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
3387 if (w
->left
->color
== MEM_BLACK
)
3389 w
->right
->color
= MEM_BLACK
;
3391 mem_rotate_left (w
);
3392 w
= x
->parent
->left
;
3395 w
->color
= x
->parent
->color
;
3396 x
->parent
->color
= MEM_BLACK
;
3397 w
->left
->color
= MEM_BLACK
;
3398 mem_rotate_right (x
->parent
);
3404 x
->color
= MEM_BLACK
;
3408 /* Value is non-zero if P is a pointer to a live Lisp string on
3409 the heap. M is a pointer to the mem_block for P. */
3412 live_string_p (m
, p
)
3416 if (m
->type
== MEM_TYPE_STRING
)
3418 struct string_block
*b
= (struct string_block
*) m
->start
;
3419 int offset
= (char *) p
- (char *) &b
->strings
[0];
3421 /* P must point to the start of a Lisp_String structure, and it
3422 must not be on the free-list. */
3424 && offset
% sizeof b
->strings
[0] == 0
3425 && ((struct Lisp_String
*) p
)->data
!= NULL
);
3432 /* Value is non-zero if P is a pointer to a live Lisp cons on
3433 the heap. M is a pointer to the mem_block for P. */
3440 if (m
->type
== MEM_TYPE_CONS
)
3442 struct cons_block
*b
= (struct cons_block
*) m
->start
;
3443 int offset
= (char *) p
- (char *) &b
->conses
[0];
3445 /* P must point to the start of a Lisp_Cons, not be
3446 one of the unused cells in the current cons block,
3447 and not be on the free-list. */
3449 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
3450 && offset
% sizeof b
->conses
[0] == 0
3452 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
3453 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
3460 /* Value is non-zero if P is a pointer to a live Lisp symbol on
3461 the heap. M is a pointer to the mem_block for P. */
3464 live_symbol_p (m
, p
)
3468 if (m
->type
== MEM_TYPE_SYMBOL
)
3470 struct symbol_block
*b
= (struct symbol_block
*) m
->start
;
3471 int offset
= (char *) p
- (char *) &b
->symbols
[0];
3473 /* P must point to the start of a Lisp_Symbol, not be
3474 one of the unused cells in the current symbol block,
3475 and not be on the free-list. */
3477 && offset
% sizeof b
->symbols
[0] == 0
3478 && (b
!= symbol_block
3479 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
3480 && !EQ (((struct Lisp_Symbol
*) p
)->function
, Vdead
));
3487 /* Value is non-zero if P is a pointer to a live Lisp float on
3488 the heap. M is a pointer to the mem_block for P. */
3495 if (m
->type
== MEM_TYPE_FLOAT
)
3497 struct float_block
*b
= (struct float_block
*) m
->start
;
3498 int offset
= (char *) p
- (char *) &b
->floats
[0];
3500 /* P must point to the start of a Lisp_Float and not be
3501 one of the unused cells in the current float block. */
3503 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
3504 && offset
% sizeof b
->floats
[0] == 0
3505 && (b
!= float_block
3506 || offset
/ sizeof b
->floats
[0] < float_block_index
));
3513 /* Value is non-zero if P is a pointer to a live Lisp Misc on
3514 the heap. M is a pointer to the mem_block for P. */
3521 if (m
->type
== MEM_TYPE_MISC
)
3523 struct marker_block
*b
= (struct marker_block
*) m
->start
;
3524 int offset
= (char *) p
- (char *) &b
->markers
[0];
3526 /* P must point to the start of a Lisp_Misc, not be
3527 one of the unused cells in the current misc block,
3528 and not be on the free-list. */
3530 && offset
% sizeof b
->markers
[0] == 0
3531 && (b
!= marker_block
3532 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
3533 && ((union Lisp_Misc
*) p
)->u_marker
.type
!= Lisp_Misc_Free
);
3540 /* Value is non-zero if P is a pointer to a live vector-like object.
3541 M is a pointer to the mem_block for P. */
3544 live_vector_p (m
, p
)
3548 return (p
== m
->start
3549 && m
->type
>= MEM_TYPE_VECTOR
3550 && m
->type
<= MEM_TYPE_WINDOW
);
3554 /* Value is non-zero if P is a pointer to a live buffer. M is a
3555 pointer to the mem_block for P. */
3558 live_buffer_p (m
, p
)
3562 /* P must point to the start of the block, and the buffer
3563 must not have been killed. */
3564 return (m
->type
== MEM_TYPE_BUFFER
3566 && !NILP (((struct buffer
*) p
)->name
));
3569 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
3573 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3575 /* Array of objects that are kept alive because the C stack contains
3576 a pattern that looks like a reference to them . */
3578 #define MAX_ZOMBIES 10
3579 static Lisp_Object zombies
[MAX_ZOMBIES
];
3581 /* Number of zombie objects. */
3583 static int nzombies
;
3585 /* Number of garbage collections. */
3589 /* Average percentage of zombies per collection. */
3591 static double avg_zombies
;
3593 /* Max. number of live and zombie objects. */
3595 static int max_live
, max_zombies
;
3597 /* Average number of live objects per GC. */
3599 static double avg_live
;
3601 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
3602 doc
: /* Show information about live and zombie objects. */)
3605 Lisp_Object args
[8], zombie_list
= Qnil
;
3607 for (i
= 0; i
< nzombies
; i
++)
3608 zombie_list
= Fcons (zombies
[i
], zombie_list
);
3609 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
3610 args
[1] = make_number (ngcs
);
3611 args
[2] = make_float (avg_live
);
3612 args
[3] = make_float (avg_zombies
);
3613 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
3614 args
[5] = make_number (max_live
);
3615 args
[6] = make_number (max_zombies
);
3616 args
[7] = zombie_list
;
3617 return Fmessage (8, args
);
3620 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
3623 /* Mark OBJ if we can prove it's a Lisp_Object. */
3626 mark_maybe_object (obj
)
3629 void *po
= (void *) XPNTR (obj
);
3630 struct mem_node
*m
= mem_find (po
);
3636 switch (XGCTYPE (obj
))
3639 mark_p
= (live_string_p (m
, po
)
3640 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
3644 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
3648 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
3652 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
3655 case Lisp_Vectorlike
:
3656 /* Note: can't check GC_BUFFERP before we know it's a
3657 buffer because checking that dereferences the pointer
3658 PO which might point anywhere. */
3659 if (live_vector_p (m
, po
))
3660 mark_p
= !GC_SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
3661 else if (live_buffer_p (m
, po
))
3662 mark_p
= GC_BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
3666 mark_p
= (live_misc_p (m
, po
) && !XMARKER (obj
)->gcmarkbit
);
3670 case Lisp_Type_Limit
:
3676 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3677 if (nzombies
< MAX_ZOMBIES
)
3678 zombies
[nzombies
] = obj
;
3687 /* If P points to Lisp data, mark that as live if it isn't already
3691 mark_maybe_pointer (p
)
3696 /* Quickly rule out some values which can't point to Lisp data. We
3697 assume that Lisp data is aligned on even addresses. */
3698 if ((EMACS_INT
) p
& 1)
3704 Lisp_Object obj
= Qnil
;
3708 case MEM_TYPE_NON_LISP
:
3709 /* Nothing to do; not a pointer to Lisp memory. */
3712 case MEM_TYPE_BUFFER
:
3713 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P((struct buffer
*)p
))
3714 XSETVECTOR (obj
, p
);
3718 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
3722 case MEM_TYPE_STRING
:
3723 if (live_string_p (m
, p
)
3724 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
3725 XSETSTRING (obj
, p
);
3729 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
3733 case MEM_TYPE_SYMBOL
:
3734 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
3735 XSETSYMBOL (obj
, p
);
3738 case MEM_TYPE_FLOAT
:
3739 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
3743 case MEM_TYPE_VECTOR
:
3744 case MEM_TYPE_PROCESS
:
3745 case MEM_TYPE_HASH_TABLE
:
3746 case MEM_TYPE_FRAME
:
3747 case MEM_TYPE_WINDOW
:
3748 if (live_vector_p (m
, p
))
3751 XSETVECTOR (tem
, p
);
3752 if (!GC_SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
3767 /* Mark Lisp objects referenced from the address range START..END. */
3770 mark_memory (start
, end
)
3776 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3780 /* Make START the pointer to the start of the memory region,
3781 if it isn't already. */
3789 /* Mark Lisp_Objects. */
3790 for (p
= (Lisp_Object
*) start
; (void *) p
< end
; ++p
)
3791 mark_maybe_object (*p
);
3793 /* Mark Lisp data pointed to. This is necessary because, in some
3794 situations, the C compiler optimizes Lisp objects away, so that
3795 only a pointer to them remains. Example:
3797 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
3800 Lisp_Object obj = build_string ("test");
3801 struct Lisp_String *s = XSTRING (obj);
3802 Fgarbage_collect ();
3803 fprintf (stderr, "test `%s'\n", s->data);
3807 Here, `obj' isn't really used, and the compiler optimizes it
3808 away. The only reference to the life string is through the
3811 for (pp
= (void **) start
; (void *) pp
< end
; ++pp
)
3812 mark_maybe_pointer (*pp
);
3815 /* setjmp will work with GCC unless NON_SAVING_SETJMP is defined in
3816 the GCC system configuration. In gcc 3.2, the only systems for
3817 which this is so are i386-sco5 non-ELF, i386-sysv3 (maybe included
3818 by others?) and ns32k-pc532-min. */
3820 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
3822 static int setjmp_tested_p
, longjmps_done
;
3824 #define SETJMP_WILL_LIKELY_WORK "\
3826 Emacs garbage collector has been changed to use conservative stack\n\
3827 marking. Emacs has determined that the method it uses to do the\n\
3828 marking will likely work on your system, but this isn't sure.\n\
3830 If you are a system-programmer, or can get the help of a local wizard\n\
3831 who is, please take a look at the function mark_stack in alloc.c, and\n\
3832 verify that the methods used are appropriate for your system.\n\
3834 Please mail the result to <emacs-devel@gnu.org>.\n\
3837 #define SETJMP_WILL_NOT_WORK "\
3839 Emacs garbage collector has been changed to use conservative stack\n\
3840 marking. Emacs has determined that the default method it uses to do the\n\
3841 marking will not work on your system. We will need a system-dependent\n\
3842 solution for your system.\n\
3844 Please take a look at the function mark_stack in alloc.c, and\n\
3845 try to find a way to make it work on your system.\n\
3847 Note that you may get false negatives, depending on the compiler.\n\
3848 In particular, you need to use -O with GCC for this test.\n\
3850 Please mail the result to <emacs-devel@gnu.org>.\n\
3854 /* Perform a quick check if it looks like setjmp saves registers in a
3855 jmp_buf. Print a message to stderr saying so. When this test
3856 succeeds, this is _not_ a proof that setjmp is sufficient for
3857 conservative stack marking. Only the sources or a disassembly
3868 /* Arrange for X to be put in a register. */
3874 if (longjmps_done
== 1)
3876 /* Came here after the longjmp at the end of the function.
3878 If x == 1, the longjmp has restored the register to its
3879 value before the setjmp, and we can hope that setjmp
3880 saves all such registers in the jmp_buf, although that
3883 For other values of X, either something really strange is
3884 taking place, or the setjmp just didn't save the register. */
3887 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
3890 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
3897 if (longjmps_done
== 1)
3901 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
3904 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
3906 /* Abort if anything GCPRO'd doesn't survive the GC. */
3914 for (p
= gcprolist
; p
; p
= p
->next
)
3915 for (i
= 0; i
< p
->nvars
; ++i
)
3916 if (!survives_gc_p (p
->var
[i
]))
3917 /* FIXME: It's not necessarily a bug. It might just be that the
3918 GCPRO is unnecessary or should release the object sooner. */
3922 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3929 fprintf (stderr
, "\nZombies kept alive = %d:\n", nzombies
);
3930 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
3932 fprintf (stderr
, " %d = ", i
);
3933 debug_print (zombies
[i
]);
3937 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
3940 /* Mark live Lisp objects on the C stack.
3942 There are several system-dependent problems to consider when
3943 porting this to new architectures:
3947 We have to mark Lisp objects in CPU registers that can hold local
3948 variables or are used to pass parameters.
3950 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
3951 something that either saves relevant registers on the stack, or
3952 calls mark_maybe_object passing it each register's contents.
3954 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
3955 implementation assumes that calling setjmp saves registers we need
3956 to see in a jmp_buf which itself lies on the stack. This doesn't
3957 have to be true! It must be verified for each system, possibly
3958 by taking a look at the source code of setjmp.
3962 Architectures differ in the way their processor stack is organized.
3963 For example, the stack might look like this
3966 | Lisp_Object | size = 4
3968 | something else | size = 2
3970 | Lisp_Object | size = 4
3974 In such a case, not every Lisp_Object will be aligned equally. To
3975 find all Lisp_Object on the stack it won't be sufficient to walk
3976 the stack in steps of 4 bytes. Instead, two passes will be
3977 necessary, one starting at the start of the stack, and a second
3978 pass starting at the start of the stack + 2. Likewise, if the
3979 minimal alignment of Lisp_Objects on the stack is 1, four passes
3980 would be necessary, each one starting with one byte more offset
3981 from the stack start.
3983 The current code assumes by default that Lisp_Objects are aligned
3984 equally on the stack. */
3991 volatile int stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
3994 /* This trick flushes the register windows so that all the state of
3995 the process is contained in the stack. */
3996 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
3997 needed on ia64 too. See mach_dep.c, where it also says inline
3998 assembler doesn't work with relevant proprietary compilers. */
4003 /* Save registers that we need to see on the stack. We need to see
4004 registers used to hold register variables and registers used to
4006 #ifdef GC_SAVE_REGISTERS_ON_STACK
4007 GC_SAVE_REGISTERS_ON_STACK (end
);
4008 #else /* not GC_SAVE_REGISTERS_ON_STACK */
4010 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
4011 setjmp will definitely work, test it
4012 and print a message with the result
4014 if (!setjmp_tested_p
)
4016 setjmp_tested_p
= 1;
4019 #endif /* GC_SETJMP_WORKS */
4022 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
4023 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
4025 /* This assumes that the stack is a contiguous region in memory. If
4026 that's not the case, something has to be done here to iterate
4027 over the stack segments. */
4028 #ifndef GC_LISP_OBJECT_ALIGNMENT
4030 #define GC_LISP_OBJECT_ALIGNMENT __alignof__ (Lisp_Object)
4032 #define GC_LISP_OBJECT_ALIGNMENT sizeof (Lisp_Object)
4035 for (i
= 0; i
< sizeof (Lisp_Object
); i
+= GC_LISP_OBJECT_ALIGNMENT
)
4036 mark_memory ((char *) stack_base
+ i
, end
);
4038 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4044 #endif /* GC_MARK_STACK != 0 */
4048 /***********************************************************************
4049 Pure Storage Management
4050 ***********************************************************************/
4052 /* Allocate room for SIZE bytes from pure Lisp storage and return a
4053 pointer to it. TYPE is the Lisp type for which the memory is
4054 allocated. TYPE < 0 means it's not used for a Lisp object.
4056 If store_pure_type_info is set and TYPE is >= 0, the type of
4057 the allocated object is recorded in pure_types. */
4059 static POINTER_TYPE
*
4060 pure_alloc (size
, type
)
4064 POINTER_TYPE
*result
;
4065 size_t alignment
= sizeof (EMACS_INT
);
4067 /* Give Lisp_Floats an extra alignment. */
4068 if (type
== Lisp_Float
)
4070 #if defined __GNUC__ && __GNUC__ >= 2
4071 alignment
= __alignof (struct Lisp_Float
);
4073 alignment
= sizeof (struct Lisp_Float
);
4078 result
= ALIGN (purebeg
+ pure_bytes_used
, alignment
);
4079 pure_bytes_used
= ((char *)result
- (char *)purebeg
) + size
;
4081 if (pure_bytes_used
<= pure_size
)
4084 /* Don't allocate a large amount here,
4085 because it might get mmap'd and then its address
4086 might not be usable. */
4087 purebeg
= (char *) xmalloc (10000);
4089 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
4090 pure_bytes_used
= 0;
4095 /* Print a warning if PURESIZE is too small. */
4100 if (pure_bytes_used_before_overflow
)
4101 message ("Pure Lisp storage overflow (approx. %d bytes needed)",
4102 (int) (pure_bytes_used
+ pure_bytes_used_before_overflow
));
4106 /* Return a string allocated in pure space. DATA is a buffer holding
4107 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
4108 non-zero means make the result string multibyte.
4110 Must get an error if pure storage is full, since if it cannot hold
4111 a large string it may be able to hold conses that point to that
4112 string; then the string is not protected from gc. */
4115 make_pure_string (data
, nchars
, nbytes
, multibyte
)
4121 struct Lisp_String
*s
;
4123 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4124 s
->data
= (unsigned char *) pure_alloc (nbytes
+ 1, -1);
4126 s
->size_byte
= multibyte
? nbytes
: -1;
4127 bcopy (data
, s
->data
, nbytes
);
4128 s
->data
[nbytes
] = '\0';
4129 s
->intervals
= NULL_INTERVAL
;
4130 XSETSTRING (string
, s
);
4135 /* Return a cons allocated from pure space. Give it pure copies
4136 of CAR as car and CDR as cdr. */
4139 pure_cons (car
, cdr
)
4140 Lisp_Object car
, cdr
;
4142 register Lisp_Object
new;
4143 struct Lisp_Cons
*p
;
4145 p
= (struct Lisp_Cons
*) pure_alloc (sizeof *p
, Lisp_Cons
);
4147 XSETCAR (new, Fpurecopy (car
));
4148 XSETCDR (new, Fpurecopy (cdr
));
4153 /* Value is a float object with value NUM allocated from pure space. */
4156 make_pure_float (num
)
4159 register Lisp_Object
new;
4160 struct Lisp_Float
*p
;
4162 p
= (struct Lisp_Float
*) pure_alloc (sizeof *p
, Lisp_Float
);
4164 XFLOAT_DATA (new) = num
;
4169 /* Return a vector with room for LEN Lisp_Objects allocated from
4173 make_pure_vector (len
)
4177 struct Lisp_Vector
*p
;
4178 size_t size
= sizeof *p
+ (len
- 1) * sizeof (Lisp_Object
);
4180 p
= (struct Lisp_Vector
*) pure_alloc (size
, Lisp_Vectorlike
);
4181 XSETVECTOR (new, p
);
4182 XVECTOR (new)->size
= len
;
4187 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
4188 doc
: /* Make a copy of OBJECT in pure storage.
4189 Recursively copies contents of vectors and cons cells.
4190 Does not copy symbols. Copies strings without text properties. */)
4192 register Lisp_Object obj
;
4194 if (NILP (Vpurify_flag
))
4197 if (PURE_POINTER_P (XPNTR (obj
)))
4201 return pure_cons (XCAR (obj
), XCDR (obj
));
4202 else if (FLOATP (obj
))
4203 return make_pure_float (XFLOAT_DATA (obj
));
4204 else if (STRINGP (obj
))
4205 return make_pure_string (SDATA (obj
), SCHARS (obj
),
4207 STRING_MULTIBYTE (obj
));
4208 else if (COMPILEDP (obj
) || VECTORP (obj
))
4210 register struct Lisp_Vector
*vec
;
4211 register int i
, size
;
4213 size
= XVECTOR (obj
)->size
;
4214 if (size
& PSEUDOVECTOR_FLAG
)
4215 size
&= PSEUDOVECTOR_SIZE_MASK
;
4216 vec
= XVECTOR (make_pure_vector ((EMACS_INT
) size
));
4217 for (i
= 0; i
< size
; i
++)
4218 vec
->contents
[i
] = Fpurecopy (XVECTOR (obj
)->contents
[i
]);
4219 if (COMPILEDP (obj
))
4220 XSETCOMPILED (obj
, vec
);
4222 XSETVECTOR (obj
, vec
);
4225 else if (MARKERP (obj
))
4226 error ("Attempt to copy a marker to pure storage");
4233 /***********************************************************************
4235 ***********************************************************************/
4237 /* Put an entry in staticvec, pointing at the variable with address
4241 staticpro (varaddress
)
4242 Lisp_Object
*varaddress
;
4244 staticvec
[staticidx
++] = varaddress
;
4245 if (staticidx
>= NSTATICS
)
4253 struct catchtag
*next
;
4258 struct backtrace
*next
;
4259 Lisp_Object
*function
;
4260 Lisp_Object
*args
; /* Points to vector of args. */
4261 int nargs
; /* Length of vector. */
4262 /* If nargs is UNEVALLED, args points to slot holding list of
4269 /***********************************************************************
4271 ***********************************************************************/
4273 /* Temporarily prevent garbage collection. */
4276 inhibit_garbage_collection ()
4278 int count
= SPECPDL_INDEX ();
4279 int nbits
= min (VALBITS
, BITS_PER_INT
);
4281 specbind (Qgc_cons_threshold
, make_number (((EMACS_INT
) 1 << (nbits
- 1)) - 1));
4286 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
4287 doc
: /* Reclaim storage for Lisp objects no longer needed.
4288 Garbage collection happens automatically if you cons more than
4289 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
4290 `garbage-collect' normally returns a list with info on amount of space in use:
4291 ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)
4292 (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS
4293 (USED-FLOATS . FREE-FLOATS) (USED-INTERVALS . FREE-INTERVALS)
4294 (USED-STRINGS . FREE-STRINGS))
4295 However, if there was overflow in pure space, `garbage-collect'
4296 returns nil, because real GC can't be done. */)
4299 register struct specbinding
*bind
;
4300 struct catchtag
*catch;
4301 struct handler
*handler
;
4302 register struct backtrace
*backlist
;
4303 char stack_top_variable
;
4306 Lisp_Object total
[8];
4307 int count
= SPECPDL_INDEX ();
4308 EMACS_TIME t1
, t2
, t3
;
4313 EMACS_GET_TIME (t1
);
4315 /* Can't GC if pure storage overflowed because we can't determine
4316 if something is a pure object or not. */
4317 if (pure_bytes_used_before_overflow
)
4320 /* In case user calls debug_print during GC,
4321 don't let that cause a recursive GC. */
4322 consing_since_gc
= 0;
4324 /* Save what's currently displayed in the echo area. */
4325 message_p
= push_message ();
4326 record_unwind_protect (pop_message_unwind
, Qnil
);
4328 /* Save a copy of the contents of the stack, for debugging. */
4329 #if MAX_SAVE_STACK > 0
4330 if (NILP (Vpurify_flag
))
4332 i
= &stack_top_variable
- stack_bottom
;
4334 if (i
< MAX_SAVE_STACK
)
4336 if (stack_copy
== 0)
4337 stack_copy
= (char *) xmalloc (stack_copy_size
= i
);
4338 else if (stack_copy_size
< i
)
4339 stack_copy
= (char *) xrealloc (stack_copy
, (stack_copy_size
= i
));
4342 if ((EMACS_INT
) (&stack_top_variable
- stack_bottom
) > 0)
4343 bcopy (stack_bottom
, stack_copy
, i
);
4345 bcopy (&stack_top_variable
, stack_copy
, i
);
4349 #endif /* MAX_SAVE_STACK > 0 */
4351 if (garbage_collection_messages
)
4352 message1_nolog ("Garbage collecting...");
4356 shrink_regexp_cache ();
4358 /* Don't keep undo information around forever. */
4360 register struct buffer
*nextb
= all_buffers
;
4364 /* If a buffer's undo list is Qt, that means that undo is
4365 turned off in that buffer. Calling truncate_undo_list on
4366 Qt tends to return NULL, which effectively turns undo back on.
4367 So don't call truncate_undo_list if undo_list is Qt. */
4368 if (! EQ (nextb
->undo_list
, Qt
))
4370 = truncate_undo_list (nextb
->undo_list
, undo_limit
,
4373 /* Shrink buffer gaps, but skip indirect and dead buffers. */
4374 if (nextb
->base_buffer
== 0 && !NILP (nextb
->name
))
4376 /* If a buffer's gap size is more than 10% of the buffer
4377 size, or larger than 2000 bytes, then shrink it
4378 accordingly. Keep a minimum size of 20 bytes. */
4379 int size
= min (2000, max (20, (nextb
->text
->z_byte
/ 10)));
4381 if (nextb
->text
->gap_size
> size
)
4383 struct buffer
*save_current
= current_buffer
;
4384 current_buffer
= nextb
;
4385 make_gap (-(nextb
->text
->gap_size
- size
));
4386 current_buffer
= save_current
;
4390 nextb
= nextb
->next
;
4396 /* clear_marks (); */
4398 /* Mark all the special slots that serve as the roots of accessibility.
4400 Usually the special slots to mark are contained in particular structures.
4401 Then we know no slot is marked twice because the structures don't overlap.
4402 In some cases, the structures point to the slots to be marked.
4403 For these, we use MARKBIT to avoid double marking of the slot. */
4405 for (i
= 0; i
< staticidx
; i
++)
4406 mark_object (*staticvec
[i
]);
4408 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
4409 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
4413 register struct gcpro
*tail
;
4414 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
4415 for (i
= 0; i
< tail
->nvars
; i
++)
4416 if (!XMARKBIT (tail
->var
[i
]))
4418 mark_object (tail
->var
[i
]);
4419 XMARK (tail
->var
[i
]);
4425 for (bind
= specpdl
; bind
!= specpdl_ptr
; bind
++)
4427 mark_object (bind
->symbol
);
4428 mark_object (bind
->old_value
);
4430 for (catch = catchlist
; catch; catch = catch->next
)
4432 mark_object (catch->tag
);
4433 mark_object (catch->val
);
4435 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
4437 mark_object (handler
->handler
);
4438 mark_object (handler
->var
);
4440 for (backlist
= backtrace_list
; backlist
; backlist
= backlist
->next
)
4442 if (!XMARKBIT (*backlist
->function
))
4444 mark_object (*backlist
->function
);
4445 XMARK (*backlist
->function
);
4447 if (backlist
->nargs
== UNEVALLED
|| backlist
->nargs
== MANY
)
4450 i
= backlist
->nargs
- 1;
4452 if (!XMARKBIT (backlist
->args
[i
]))
4454 mark_object (backlist
->args
[i
]);
4455 XMARK (backlist
->args
[i
]);
4460 /* Look thru every buffer's undo list
4461 for elements that update markers that were not marked,
4464 register struct buffer
*nextb
= all_buffers
;
4468 /* If a buffer's undo list is Qt, that means that undo is
4469 turned off in that buffer. Calling truncate_undo_list on
4470 Qt tends to return NULL, which effectively turns undo back on.
4471 So don't call truncate_undo_list if undo_list is Qt. */
4472 if (! EQ (nextb
->undo_list
, Qt
))
4474 Lisp_Object tail
, prev
;
4475 tail
= nextb
->undo_list
;
4477 while (CONSP (tail
))
4479 if (GC_CONSP (XCAR (tail
))
4480 && GC_MARKERP (XCAR (XCAR (tail
)))
4481 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
4484 nextb
->undo_list
= tail
= XCDR (tail
);
4488 XSETCDR (prev
, tail
);
4499 nextb
= nextb
->next
;
4503 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4509 extern void xg_mark_data ();
4516 /* Clear the mark bits that we set in certain root slots. */
4518 #if (GC_MARK_STACK == GC_USE_GCPROS_AS_BEFORE \
4519 || GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES)
4521 register struct gcpro
*tail
;
4523 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
4524 for (i
= 0; i
< tail
->nvars
; i
++)
4525 XUNMARK (tail
->var
[i
]);
4529 unmark_byte_stack ();
4530 for (backlist
= backtrace_list
; backlist
; backlist
= backlist
->next
)
4532 XUNMARK (*backlist
->function
);
4533 if (backlist
->nargs
== UNEVALLED
|| backlist
->nargs
== MANY
)
4536 i
= backlist
->nargs
- 1;
4538 XUNMARK (backlist
->args
[i
]);
4540 VECTOR_UNMARK (&buffer_defaults
);
4541 VECTOR_UNMARK (&buffer_local_symbols
);
4543 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
4549 /* clear_marks (); */
4552 consing_since_gc
= 0;
4553 if (gc_cons_threshold
< 10000)
4554 gc_cons_threshold
= 10000;
4556 if (garbage_collection_messages
)
4558 if (message_p
|| minibuf_level
> 0)
4561 message1_nolog ("Garbage collecting...done");
4564 unbind_to (count
, Qnil
);
4566 total
[0] = Fcons (make_number (total_conses
),
4567 make_number (total_free_conses
));
4568 total
[1] = Fcons (make_number (total_symbols
),
4569 make_number (total_free_symbols
));
4570 total
[2] = Fcons (make_number (total_markers
),
4571 make_number (total_free_markers
));
4572 total
[3] = make_number (total_string_size
);
4573 total
[4] = make_number (total_vector_size
);
4574 total
[5] = Fcons (make_number (total_floats
),
4575 make_number (total_free_floats
));
4576 total
[6] = Fcons (make_number (total_intervals
),
4577 make_number (total_free_intervals
));
4578 total
[7] = Fcons (make_number (total_strings
),
4579 make_number (total_free_strings
));
4581 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4583 /* Compute average percentage of zombies. */
4586 for (i
= 0; i
< 7; ++i
)
4587 if (CONSP (total
[i
]))
4588 nlive
+= XFASTINT (XCAR (total
[i
]));
4590 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
4591 max_live
= max (nlive
, max_live
);
4592 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
4593 max_zombies
= max (nzombies
, max_zombies
);
4598 if (!NILP (Vpost_gc_hook
))
4600 int count
= inhibit_garbage_collection ();
4601 safe_run_hooks (Qpost_gc_hook
);
4602 unbind_to (count
, Qnil
);
4605 /* Accumulate statistics. */
4606 EMACS_GET_TIME (t2
);
4607 EMACS_SUB_TIME (t3
, t2
, t1
);
4608 if (FLOATP (Vgc_elapsed
))
4609 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
) +
4611 EMACS_USECS (t3
) * 1.0e-6);
4614 return Flist (sizeof total
/ sizeof *total
, total
);
4618 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
4619 only interesting objects referenced from glyphs are strings. */
4622 mark_glyph_matrix (matrix
)
4623 struct glyph_matrix
*matrix
;
4625 struct glyph_row
*row
= matrix
->rows
;
4626 struct glyph_row
*end
= row
+ matrix
->nrows
;
4628 for (; row
< end
; ++row
)
4632 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
4634 struct glyph
*glyph
= row
->glyphs
[area
];
4635 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
4637 for (; glyph
< end_glyph
; ++glyph
)
4638 if (GC_STRINGP (glyph
->object
)
4639 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
4640 mark_object (glyph
->object
);
4646 /* Mark Lisp faces in the face cache C. */
4650 struct face_cache
*c
;
4655 for (i
= 0; i
< c
->used
; ++i
)
4657 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
4661 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
4662 mark_object (face
->lface
[j
]);
4669 #ifdef HAVE_WINDOW_SYSTEM
4671 /* Mark Lisp objects in image IMG. */
4677 mark_object (img
->spec
);
4679 if (!NILP (img
->data
.lisp_val
))
4680 mark_object (img
->data
.lisp_val
);
4684 /* Mark Lisp objects in image cache of frame F. It's done this way so
4685 that we don't have to include xterm.h here. */
4688 mark_image_cache (f
)
4691 forall_images_in_image_cache (f
, mark_image
);
4694 #endif /* HAVE_X_WINDOWS */
4698 /* Mark reference to a Lisp_Object.
4699 If the object referred to has not been seen yet, recursively mark
4700 all the references contained in it. */
4702 #define LAST_MARKED_SIZE 500
4703 Lisp_Object last_marked
[LAST_MARKED_SIZE
];
4704 int last_marked_index
;
4706 /* For debugging--call abort when we cdr down this many
4707 links of a list, in mark_object. In debugging,
4708 the call to abort will hit a breakpoint.
4709 Normally this is zero and the check never goes off. */
4710 int mark_object_loop_halt
;
4716 register Lisp_Object obj
= arg
;
4717 #ifdef GC_CHECK_MARKED_OBJECTS
4726 if (PURE_POINTER_P (XPNTR (obj
)))
4729 last_marked
[last_marked_index
++] = obj
;
4730 if (last_marked_index
== LAST_MARKED_SIZE
)
4731 last_marked_index
= 0;
4733 /* Perform some sanity checks on the objects marked here. Abort if
4734 we encounter an object we know is bogus. This increases GC time
4735 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
4736 #ifdef GC_CHECK_MARKED_OBJECTS
4738 po
= (void *) XPNTR (obj
);
4740 /* Check that the object pointed to by PO is known to be a Lisp
4741 structure allocated from the heap. */
4742 #define CHECK_ALLOCATED() \
4744 m = mem_find (po); \
4749 /* Check that the object pointed to by PO is live, using predicate
4751 #define CHECK_LIVE(LIVEP) \
4753 if (!LIVEP (m, po)) \
4757 /* Check both of the above conditions. */
4758 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
4760 CHECK_ALLOCATED (); \
4761 CHECK_LIVE (LIVEP); \
4764 #else /* not GC_CHECK_MARKED_OBJECTS */
4766 #define CHECK_ALLOCATED() (void) 0
4767 #define CHECK_LIVE(LIVEP) (void) 0
4768 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
4770 #endif /* not GC_CHECK_MARKED_OBJECTS */
4772 switch (SWITCH_ENUM_CAST (XGCTYPE (obj
)))
4776 register struct Lisp_String
*ptr
= XSTRING (obj
);
4777 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
4778 MARK_INTERVAL_TREE (ptr
->intervals
);
4780 #ifdef GC_CHECK_STRING_BYTES
4781 /* Check that the string size recorded in the string is the
4782 same as the one recorded in the sdata structure. */
4783 CHECK_STRING_BYTES (ptr
);
4784 #endif /* GC_CHECK_STRING_BYTES */
4788 case Lisp_Vectorlike
:
4789 #ifdef GC_CHECK_MARKED_OBJECTS
4791 if (m
== MEM_NIL
&& !GC_SUBRP (obj
)
4792 && po
!= &buffer_defaults
4793 && po
!= &buffer_local_symbols
)
4795 #endif /* GC_CHECK_MARKED_OBJECTS */
4797 if (GC_BUFFERP (obj
))
4799 if (!VECTOR_MARKED_P (XBUFFER (obj
)))
4801 #ifdef GC_CHECK_MARKED_OBJECTS
4802 if (po
!= &buffer_defaults
&& po
!= &buffer_local_symbols
)
4805 for (b
= all_buffers
; b
&& b
!= po
; b
= b
->next
)
4810 #endif /* GC_CHECK_MARKED_OBJECTS */
4814 else if (GC_SUBRP (obj
))
4816 else if (GC_COMPILEDP (obj
))
4817 /* We could treat this just like a vector, but it is better to
4818 save the COMPILED_CONSTANTS element for last and avoid
4821 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
4822 register EMACS_INT size
= ptr
->size
;
4825 if (VECTOR_MARKED_P (ptr
))
4826 break; /* Already marked */
4828 CHECK_LIVE (live_vector_p
);
4829 VECTOR_MARK (ptr
); /* Else mark it */
4830 size
&= PSEUDOVECTOR_SIZE_MASK
;
4831 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
4833 if (i
!= COMPILED_CONSTANTS
)
4834 mark_object (ptr
->contents
[i
]);
4836 obj
= ptr
->contents
[COMPILED_CONSTANTS
];
4839 else if (GC_FRAMEP (obj
))
4841 register struct frame
*ptr
= XFRAME (obj
);
4843 if (VECTOR_MARKED_P (ptr
)) break; /* Already marked */
4844 VECTOR_MARK (ptr
); /* Else mark it */
4846 CHECK_LIVE (live_vector_p
);
4847 mark_object (ptr
->name
);
4848 mark_object (ptr
->icon_name
);
4849 mark_object (ptr
->title
);
4850 mark_object (ptr
->focus_frame
);
4851 mark_object (ptr
->selected_window
);
4852 mark_object (ptr
->minibuffer_window
);
4853 mark_object (ptr
->param_alist
);
4854 mark_object (ptr
->scroll_bars
);
4855 mark_object (ptr
->condemned_scroll_bars
);
4856 mark_object (ptr
->menu_bar_items
);
4857 mark_object (ptr
->face_alist
);
4858 mark_object (ptr
->menu_bar_vector
);
4859 mark_object (ptr
->buffer_predicate
);
4860 mark_object (ptr
->buffer_list
);
4861 mark_object (ptr
->menu_bar_window
);
4862 mark_object (ptr
->tool_bar_window
);
4863 mark_face_cache (ptr
->face_cache
);
4864 #ifdef HAVE_WINDOW_SYSTEM
4865 mark_image_cache (ptr
);
4866 mark_object (ptr
->tool_bar_items
);
4867 mark_object (ptr
->desired_tool_bar_string
);
4868 mark_object (ptr
->current_tool_bar_string
);
4869 #endif /* HAVE_WINDOW_SYSTEM */
4871 else if (GC_BOOL_VECTOR_P (obj
))
4873 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
4875 if (VECTOR_MARKED_P (ptr
))
4876 break; /* Already marked */
4877 CHECK_LIVE (live_vector_p
);
4878 VECTOR_MARK (ptr
); /* Else mark it */
4880 else if (GC_WINDOWP (obj
))
4882 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
4883 struct window
*w
= XWINDOW (obj
);
4886 /* Stop if already marked. */
4887 if (VECTOR_MARKED_P (ptr
))
4891 CHECK_LIVE (live_vector_p
);
4894 /* There is no Lisp data above The member CURRENT_MATRIX in
4895 struct WINDOW. Stop marking when that slot is reached. */
4897 (char *) &ptr
->contents
[i
] < (char *) &w
->current_matrix
;
4899 mark_object (ptr
->contents
[i
]);
4901 /* Mark glyphs for leaf windows. Marking window matrices is
4902 sufficient because frame matrices use the same glyph
4904 if (NILP (w
->hchild
)
4906 && w
->current_matrix
)
4908 mark_glyph_matrix (w
->current_matrix
);
4909 mark_glyph_matrix (w
->desired_matrix
);
4912 else if (GC_HASH_TABLE_P (obj
))
4914 struct Lisp_Hash_Table
*h
= XHASH_TABLE (obj
);
4916 /* Stop if already marked. */
4917 if (VECTOR_MARKED_P (h
))
4921 CHECK_LIVE (live_vector_p
);
4924 /* Mark contents. */
4925 /* Do not mark next_free or next_weak.
4926 Being in the next_weak chain
4927 should not keep the hash table alive.
4928 No need to mark `count' since it is an integer. */
4929 mark_object (h
->test
);
4930 mark_object (h
->weak
);
4931 mark_object (h
->rehash_size
);
4932 mark_object (h
->rehash_threshold
);
4933 mark_object (h
->hash
);
4934 mark_object (h
->next
);
4935 mark_object (h
->index
);
4936 mark_object (h
->user_hash_function
);
4937 mark_object (h
->user_cmp_function
);
4939 /* If hash table is not weak, mark all keys and values.
4940 For weak tables, mark only the vector. */
4941 if (GC_NILP (h
->weak
))
4942 mark_object (h
->key_and_value
);
4944 VECTOR_MARK (XVECTOR (h
->key_and_value
));
4948 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
4949 register EMACS_INT size
= ptr
->size
;
4952 if (VECTOR_MARKED_P (ptr
)) break; /* Already marked */
4953 CHECK_LIVE (live_vector_p
);
4954 VECTOR_MARK (ptr
); /* Else mark it */
4955 if (size
& PSEUDOVECTOR_FLAG
)
4956 size
&= PSEUDOVECTOR_SIZE_MASK
;
4958 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
4959 mark_object (ptr
->contents
[i
]);
4965 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
4966 struct Lisp_Symbol
*ptrx
;
4968 if (ptr
->gcmarkbit
) break;
4969 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
4971 mark_object (ptr
->value
);
4972 mark_object (ptr
->function
);
4973 mark_object (ptr
->plist
);
4975 if (!PURE_POINTER_P (XSTRING (ptr
->xname
)))
4976 MARK_STRING (XSTRING (ptr
->xname
));
4977 MARK_INTERVAL_TREE (STRING_INTERVALS (ptr
->xname
));
4979 /* Note that we do not mark the obarray of the symbol.
4980 It is safe not to do so because nothing accesses that
4981 slot except to check whether it is nil. */
4985 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun */
4986 XSETSYMBOL (obj
, ptrx
);
4993 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
4994 if (XMARKER (obj
)->gcmarkbit
)
4996 XMARKER (obj
)->gcmarkbit
= 1;
4997 switch (XMISCTYPE (obj
))
4999 case Lisp_Misc_Buffer_Local_Value
:
5000 case Lisp_Misc_Some_Buffer_Local_Value
:
5002 register struct Lisp_Buffer_Local_Value
*ptr
5003 = XBUFFER_LOCAL_VALUE (obj
);
5004 /* If the cdr is nil, avoid recursion for the car. */
5005 if (EQ (ptr
->cdr
, Qnil
))
5007 obj
= ptr
->realvalue
;
5010 mark_object (ptr
->realvalue
);
5011 mark_object (ptr
->buffer
);
5012 mark_object (ptr
->frame
);
5017 case Lisp_Misc_Marker
:
5018 /* DO NOT mark thru the marker's chain.
5019 The buffer's markers chain does not preserve markers from gc;
5020 instead, markers are removed from the chain when freed by gc. */
5021 case Lisp_Misc_Intfwd
:
5022 case Lisp_Misc_Boolfwd
:
5023 case Lisp_Misc_Objfwd
:
5024 case Lisp_Misc_Buffer_Objfwd
:
5025 case Lisp_Misc_Kboard_Objfwd
:
5026 /* Don't bother with Lisp_Buffer_Objfwd,
5027 since all markable slots in current buffer marked anyway. */
5028 /* Don't need to do Lisp_Objfwd, since the places they point
5029 are protected with staticpro. */
5030 case Lisp_Misc_Save_Value
:
5033 case Lisp_Misc_Overlay
:
5035 struct Lisp_Overlay
*ptr
= XOVERLAY (obj
);
5036 mark_object (ptr
->start
);
5037 mark_object (ptr
->end
);
5038 mark_object (ptr
->plist
);
5041 XSETMISC (obj
, ptr
->next
);
5054 register struct Lisp_Cons
*ptr
= XCONS (obj
);
5055 if (CONS_MARKED_P (ptr
)) break;
5056 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
5058 /* If the cdr is nil, avoid recursion for the car. */
5059 if (EQ (ptr
->cdr
, Qnil
))
5065 mark_object (ptr
->car
);
5068 if (cdr_count
== mark_object_loop_halt
)
5074 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
5075 FLOAT_MARK (XFLOAT (obj
));
5086 #undef CHECK_ALLOCATED
5087 #undef CHECK_ALLOCATED_AND_LIVE
5090 /* Mark the pointers in a buffer structure. */
5096 register struct buffer
*buffer
= XBUFFER (buf
);
5097 register Lisp_Object
*ptr
, tmp
;
5098 Lisp_Object base_buffer
;
5100 VECTOR_MARK (buffer
);
5102 MARK_INTERVAL_TREE (BUF_INTERVALS (buffer
));
5104 if (CONSP (buffer
->undo_list
))
5107 tail
= buffer
->undo_list
;
5109 /* We mark the undo list specially because
5110 its pointers to markers should be weak. */
5112 while (CONSP (tail
))
5114 register struct Lisp_Cons
*ptr
= XCONS (tail
);
5116 if (CONS_MARKED_P (ptr
))
5119 if (GC_CONSP (ptr
->car
)
5120 && !CONS_MARKED_P (XCONS (ptr
->car
))
5121 && GC_MARKERP (XCAR (ptr
->car
)))
5123 CONS_MARK (XCONS (ptr
->car
));
5124 mark_object (XCDR (ptr
->car
));
5127 mark_object (ptr
->car
);
5129 if (CONSP (ptr
->cdr
))
5135 mark_object (XCDR (tail
));
5138 mark_object (buffer
->undo_list
);
5140 if (buffer
->overlays_before
)
5142 XSETMISC (tmp
, buffer
->overlays_before
);
5145 if (buffer
->overlays_after
)
5147 XSETMISC (tmp
, buffer
->overlays_after
);
5151 for (ptr
= &buffer
->name
;
5152 (char *)ptr
< (char *)buffer
+ sizeof (struct buffer
);
5156 /* If this is an indirect buffer, mark its base buffer. */
5157 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
5159 XSETBUFFER (base_buffer
, buffer
->base_buffer
);
5160 mark_buffer (base_buffer
);
5165 /* Value is non-zero if OBJ will survive the current GC because it's
5166 either marked or does not need to be marked to survive. */
5174 switch (XGCTYPE (obj
))
5181 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
5185 survives_p
= XMARKER (obj
)->gcmarkbit
;
5189 survives_p
= STRING_MARKED_P (XSTRING (obj
));
5192 case Lisp_Vectorlike
:
5193 survives_p
= GC_SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
5197 survives_p
= CONS_MARKED_P (XCONS (obj
));
5201 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
5208 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
5213 /* Sweep: find all structures not marked, and free them. */
5218 /* Remove or mark entries in weak hash tables.
5219 This must be done before any object is unmarked. */
5220 sweep_weak_hash_tables ();
5223 #ifdef GC_CHECK_STRING_BYTES
5224 if (!noninteractive
)
5225 check_string_bytes (1);
5228 /* Put all unmarked conses on free list */
5230 register struct cons_block
*cblk
;
5231 struct cons_block
**cprev
= &cons_block
;
5232 register int lim
= cons_block_index
;
5233 register int num_free
= 0, num_used
= 0;
5237 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
5241 for (i
= 0; i
< lim
; i
++)
5242 if (!CONS_MARKED_P (&cblk
->conses
[i
]))
5245 *(struct Lisp_Cons
**)&cblk
->conses
[i
].cdr
= cons_free_list
;
5246 cons_free_list
= &cblk
->conses
[i
];
5248 cons_free_list
->car
= Vdead
;
5254 CONS_UNMARK (&cblk
->conses
[i
]);
5256 lim
= CONS_BLOCK_SIZE
;
5257 /* If this block contains only free conses and we have already
5258 seen more than two blocks worth of free conses then deallocate
5260 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
5262 *cprev
= cblk
->next
;
5263 /* Unhook from the free list. */
5264 cons_free_list
= *(struct Lisp_Cons
**) &cblk
->conses
[0].cdr
;
5265 lisp_align_free (cblk
);
5270 num_free
+= this_free
;
5271 cprev
= &cblk
->next
;
5274 total_conses
= num_used
;
5275 total_free_conses
= num_free
;
5278 /* Put all unmarked floats on free list */
5280 register struct float_block
*fblk
;
5281 struct float_block
**fprev
= &float_block
;
5282 register int lim
= float_block_index
;
5283 register int num_free
= 0, num_used
= 0;
5285 float_free_list
= 0;
5287 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
5291 for (i
= 0; i
< lim
; i
++)
5292 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
5295 *(struct Lisp_Float
**)&fblk
->floats
[i
].data
= float_free_list
;
5296 float_free_list
= &fblk
->floats
[i
];
5301 FLOAT_UNMARK (&fblk
->floats
[i
]);
5303 lim
= FLOAT_BLOCK_SIZE
;
5304 /* If this block contains only free floats and we have already
5305 seen more than two blocks worth of free floats then deallocate
5307 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
5309 *fprev
= fblk
->next
;
5310 /* Unhook from the free list. */
5311 float_free_list
= *(struct Lisp_Float
**) &fblk
->floats
[0].data
;
5312 lisp_align_free (fblk
);
5317 num_free
+= this_free
;
5318 fprev
= &fblk
->next
;
5321 total_floats
= num_used
;
5322 total_free_floats
= num_free
;
5325 /* Put all unmarked intervals on free list */
5327 register struct interval_block
*iblk
;
5328 struct interval_block
**iprev
= &interval_block
;
5329 register int lim
= interval_block_index
;
5330 register int num_free
= 0, num_used
= 0;
5332 interval_free_list
= 0;
5334 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
5339 for (i
= 0; i
< lim
; i
++)
5341 if (!iblk
->intervals
[i
].gcmarkbit
)
5343 SET_INTERVAL_PARENT (&iblk
->intervals
[i
], interval_free_list
);
5344 interval_free_list
= &iblk
->intervals
[i
];
5350 iblk
->intervals
[i
].gcmarkbit
= 0;
5353 lim
= INTERVAL_BLOCK_SIZE
;
5354 /* If this block contains only free intervals and we have already
5355 seen more than two blocks worth of free intervals then
5356 deallocate this block. */
5357 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
5359 *iprev
= iblk
->next
;
5360 /* Unhook from the free list. */
5361 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
5363 n_interval_blocks
--;
5367 num_free
+= this_free
;
5368 iprev
= &iblk
->next
;
5371 total_intervals
= num_used
;
5372 total_free_intervals
= num_free
;
5375 /* Put all unmarked symbols on free list */
5377 register struct symbol_block
*sblk
;
5378 struct symbol_block
**sprev
= &symbol_block
;
5379 register int lim
= symbol_block_index
;
5380 register int num_free
= 0, num_used
= 0;
5382 symbol_free_list
= NULL
;
5384 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
5387 struct Lisp_Symbol
*sym
= sblk
->symbols
;
5388 struct Lisp_Symbol
*end
= sym
+ lim
;
5390 for (; sym
< end
; ++sym
)
5392 /* Check if the symbol was created during loadup. In such a case
5393 it might be pointed to by pure bytecode which we don't trace,
5394 so we conservatively assume that it is live. */
5395 int pure_p
= PURE_POINTER_P (XSTRING (sym
->xname
));
5397 if (!sym
->gcmarkbit
&& !pure_p
)
5399 *(struct Lisp_Symbol
**) &sym
->value
= symbol_free_list
;
5400 symbol_free_list
= sym
;
5402 symbol_free_list
->function
= Vdead
;
5410 UNMARK_STRING (XSTRING (sym
->xname
));
5415 lim
= SYMBOL_BLOCK_SIZE
;
5416 /* If this block contains only free symbols and we have already
5417 seen more than two blocks worth of free symbols then deallocate
5419 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
5421 *sprev
= sblk
->next
;
5422 /* Unhook from the free list. */
5423 symbol_free_list
= *(struct Lisp_Symbol
**)&sblk
->symbols
[0].value
;
5429 num_free
+= this_free
;
5430 sprev
= &sblk
->next
;
5433 total_symbols
= num_used
;
5434 total_free_symbols
= num_free
;
5437 /* Put all unmarked misc's on free list.
5438 For a marker, first unchain it from the buffer it points into. */
5440 register struct marker_block
*mblk
;
5441 struct marker_block
**mprev
= &marker_block
;
5442 register int lim
= marker_block_index
;
5443 register int num_free
= 0, num_used
= 0;
5445 marker_free_list
= 0;
5447 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
5452 for (i
= 0; i
< lim
; i
++)
5454 if (!mblk
->markers
[i
].u_marker
.gcmarkbit
)
5456 if (mblk
->markers
[i
].u_marker
.type
== Lisp_Misc_Marker
)
5457 unchain_marker (&mblk
->markers
[i
].u_marker
);
5458 /* Set the type of the freed object to Lisp_Misc_Free.
5459 We could leave the type alone, since nobody checks it,
5460 but this might catch bugs faster. */
5461 mblk
->markers
[i
].u_marker
.type
= Lisp_Misc_Free
;
5462 mblk
->markers
[i
].u_free
.chain
= marker_free_list
;
5463 marker_free_list
= &mblk
->markers
[i
];
5469 mblk
->markers
[i
].u_marker
.gcmarkbit
= 0;
5472 lim
= MARKER_BLOCK_SIZE
;
5473 /* If this block contains only free markers and we have already
5474 seen more than two blocks worth of free markers then deallocate
5476 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
5478 *mprev
= mblk
->next
;
5479 /* Unhook from the free list. */
5480 marker_free_list
= mblk
->markers
[0].u_free
.chain
;
5486 num_free
+= this_free
;
5487 mprev
= &mblk
->next
;
5491 total_markers
= num_used
;
5492 total_free_markers
= num_free
;
5495 /* Free all unmarked buffers */
5497 register struct buffer
*buffer
= all_buffers
, *prev
= 0, *next
;
5500 if (!VECTOR_MARKED_P (buffer
))
5503 prev
->next
= buffer
->next
;
5505 all_buffers
= buffer
->next
;
5506 next
= buffer
->next
;
5512 VECTOR_UNMARK (buffer
);
5513 UNMARK_BALANCE_INTERVALS (BUF_INTERVALS (buffer
));
5514 prev
= buffer
, buffer
= buffer
->next
;
5518 /* Free all unmarked vectors */
5520 register struct Lisp_Vector
*vector
= all_vectors
, *prev
= 0, *next
;
5521 total_vector_size
= 0;
5524 if (!VECTOR_MARKED_P (vector
))
5527 prev
->next
= vector
->next
;
5529 all_vectors
= vector
->next
;
5530 next
= vector
->next
;
5538 VECTOR_UNMARK (vector
);
5539 if (vector
->size
& PSEUDOVECTOR_FLAG
)
5540 total_vector_size
+= (PSEUDOVECTOR_SIZE_MASK
& vector
->size
);
5542 total_vector_size
+= vector
->size
;
5543 prev
= vector
, vector
= vector
->next
;
5547 #ifdef GC_CHECK_STRING_BYTES
5548 if (!noninteractive
)
5549 check_string_bytes (1);
5556 /* Debugging aids. */
5558 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
5559 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
5560 This may be helpful in debugging Emacs's memory usage.
5561 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
5566 XSETINT (end
, (EMACS_INT
) sbrk (0) / 1024);
5571 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
5572 doc
: /* Return a list of counters that measure how much consing there has been.
5573 Each of these counters increments for a certain kind of object.
5574 The counters wrap around from the largest positive integer to zero.
5575 Garbage collection does not decrease them.
5576 The elements of the value are as follows:
5577 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
5578 All are in units of 1 = one object consed
5579 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
5581 MISCS include overlays, markers, and some internal types.
5582 Frames, windows, buffers, and subprocesses count as vectors
5583 (but the contents of a buffer's text do not count here). */)
5586 Lisp_Object consed
[8];
5588 consed
[0] = make_number (min (MOST_POSITIVE_FIXNUM
, cons_cells_consed
));
5589 consed
[1] = make_number (min (MOST_POSITIVE_FIXNUM
, floats_consed
));
5590 consed
[2] = make_number (min (MOST_POSITIVE_FIXNUM
, vector_cells_consed
));
5591 consed
[3] = make_number (min (MOST_POSITIVE_FIXNUM
, symbols_consed
));
5592 consed
[4] = make_number (min (MOST_POSITIVE_FIXNUM
, string_chars_consed
));
5593 consed
[5] = make_number (min (MOST_POSITIVE_FIXNUM
, misc_objects_consed
));
5594 consed
[6] = make_number (min (MOST_POSITIVE_FIXNUM
, intervals_consed
));
5595 consed
[7] = make_number (min (MOST_POSITIVE_FIXNUM
, strings_consed
));
5597 return Flist (8, consed
);
5600 int suppress_checking
;
5602 die (msg
, file
, line
)
5607 fprintf (stderr
, "\r\nEmacs fatal error: %s:%d: %s\r\n",
5612 /* Initialization */
5617 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
5619 pure_size
= PURESIZE
;
5620 pure_bytes_used
= 0;
5621 pure_bytes_used_before_overflow
= 0;
5623 /* Initialize the list of free aligned blocks. */
5626 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
5628 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
5632 ignore_warnings
= 1;
5633 #ifdef DOUG_LEA_MALLOC
5634 mallopt (M_TRIM_THRESHOLD
, 128*1024); /* trim threshold */
5635 mallopt (M_MMAP_THRESHOLD
, 64*1024); /* mmap threshold */
5636 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* max. number of mmap'ed areas */
5646 malloc_hysteresis
= 32;
5648 malloc_hysteresis
= 0;
5651 spare_memory
= (char *) malloc (SPARE_MEMORY
);
5653 ignore_warnings
= 0;
5655 byte_stack_list
= 0;
5657 consing_since_gc
= 0;
5658 gc_cons_threshold
= 100000 * sizeof (Lisp_Object
);
5659 #ifdef VIRT_ADDR_VARIES
5660 malloc_sbrk_unused
= 1<<22; /* A large number */
5661 malloc_sbrk_used
= 100000; /* as reasonable as any number */
5662 #endif /* VIRT_ADDR_VARIES */
5669 byte_stack_list
= 0;
5671 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
5672 setjmp_tested_p
= longjmps_done
= 0;
5675 Vgc_elapsed
= make_float (0.0);
5682 DEFVAR_INT ("gc-cons-threshold", &gc_cons_threshold
,
5683 doc
: /* *Number of bytes of consing between garbage collections.
5684 Garbage collection can happen automatically once this many bytes have been
5685 allocated since the last garbage collection. All data types count.
5687 Garbage collection happens automatically only when `eval' is called.
5689 By binding this temporarily to a large number, you can effectively
5690 prevent garbage collection during a part of the program. */);
5692 DEFVAR_INT ("pure-bytes-used", &pure_bytes_used
,
5693 doc
: /* Number of bytes of sharable Lisp data allocated so far. */);
5695 DEFVAR_INT ("cons-cells-consed", &cons_cells_consed
,
5696 doc
: /* Number of cons cells that have been consed so far. */);
5698 DEFVAR_INT ("floats-consed", &floats_consed
,
5699 doc
: /* Number of floats that have been consed so far. */);
5701 DEFVAR_INT ("vector-cells-consed", &vector_cells_consed
,
5702 doc
: /* Number of vector cells that have been consed so far. */);
5704 DEFVAR_INT ("symbols-consed", &symbols_consed
,
5705 doc
: /* Number of symbols that have been consed so far. */);
5707 DEFVAR_INT ("string-chars-consed", &string_chars_consed
,
5708 doc
: /* Number of string characters that have been consed so far. */);
5710 DEFVAR_INT ("misc-objects-consed", &misc_objects_consed
,
5711 doc
: /* Number of miscellaneous objects that have been consed so far. */);
5713 DEFVAR_INT ("intervals-consed", &intervals_consed
,
5714 doc
: /* Number of intervals that have been consed so far. */);
5716 DEFVAR_INT ("strings-consed", &strings_consed
,
5717 doc
: /* Number of strings that have been consed so far. */);
5719 DEFVAR_LISP ("purify-flag", &Vpurify_flag
,
5720 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
5721 This means that certain objects should be allocated in shared (pure) space. */);
5723 DEFVAR_INT ("undo-limit", &undo_limit
,
5724 doc
: /* Keep no more undo information once it exceeds this size.
5725 This limit is applied when garbage collection happens.
5726 The size is counted as the number of bytes occupied,
5727 which includes both saved text and other data. */);
5730 DEFVAR_INT ("undo-strong-limit", &undo_strong_limit
,
5731 doc
: /* Don't keep more than this much size of undo information.
5732 A command which pushes past this size is itself forgotten.
5733 This limit is applied when garbage collection happens.
5734 The size is counted as the number of bytes occupied,
5735 which includes both saved text and other data. */);
5736 undo_strong_limit
= 30000;
5738 DEFVAR_BOOL ("garbage-collection-messages", &garbage_collection_messages
,
5739 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
5740 garbage_collection_messages
= 0;
5742 DEFVAR_LISP ("post-gc-hook", &Vpost_gc_hook
,
5743 doc
: /* Hook run after garbage collection has finished. */);
5744 Vpost_gc_hook
= Qnil
;
5745 Qpost_gc_hook
= intern ("post-gc-hook");
5746 staticpro (&Qpost_gc_hook
);
5748 DEFVAR_LISP ("memory-signal-data", &Vmemory_signal_data
,
5749 doc
: /* Precomputed `signal' argument for memory-full error. */);
5750 /* We build this in advance because if we wait until we need it, we might
5751 not be able to allocate the memory to hold it. */
5754 build_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"));
5756 DEFVAR_LISP ("memory-full", &Vmemory_full
,
5757 doc
: /* Non-nil means we are handling a memory-full error. */);
5758 Vmemory_full
= Qnil
;
5760 staticpro (&Qgc_cons_threshold
);
5761 Qgc_cons_threshold
= intern ("gc-cons-threshold");
5763 staticpro (&Qchar_table_extra_slots
);
5764 Qchar_table_extra_slots
= intern ("char-table-extra-slots");
5766 DEFVAR_LISP ("gc-elapsed", &Vgc_elapsed
,
5767 doc
: /* Accumulated time elapsed in garbage collections.
5768 The time is in seconds as a floating point value. */);
5769 DEFVAR_INT ("gcs-done", &gcs_done
,
5770 doc
: /* Accumulated number of garbage collections done. */);
5775 defsubr (&Smake_byte_code
);
5776 defsubr (&Smake_list
);
5777 defsubr (&Smake_vector
);
5778 defsubr (&Smake_char_table
);
5779 defsubr (&Smake_string
);
5780 defsubr (&Smake_bool_vector
);
5781 defsubr (&Smake_symbol
);
5782 defsubr (&Smake_marker
);
5783 defsubr (&Spurecopy
);
5784 defsubr (&Sgarbage_collect
);
5785 defsubr (&Smemory_limit
);
5786 defsubr (&Smemory_use_counts
);
5788 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5789 defsubr (&Sgc_status
);
5793 /* arch-tag: 6695ca10-e3c5-4c2c-8bc3-ed26a7dda857
5794 (do not change this comment) */