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 & (long) ABLOCKS_BUSY (abase) ? abase : ((void**)abase)[-1])
717 /* The list of free ablock. */
718 static struct ablock
*free_ablock
;
720 /* Allocate an aligned block of nbytes.
721 Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be
722 smaller or equal to BLOCK_BYTES. */
723 static POINTER_TYPE
*
724 lisp_align_malloc (nbytes
, type
)
729 struct ablocks
*abase
;
731 eassert (nbytes
<= BLOCK_BYTES
);
735 #ifdef GC_MALLOC_CHECK
736 allocated_mem_type
= type
;
742 EMACS_INT aligned
; /* int gets warning casting to 64-bit pointer. */
744 #ifdef DOUG_LEA_MALLOC
745 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
746 because mapped region contents are not preserved in
748 mallopt (M_MMAP_MAX
, 0);
751 #ifdef HAVE_POSIX_MEMALIGN
753 int err
= posix_memalign (&base
, BLOCK_ALIGN
, ABLOCKS_BYTES
);
754 abase
= err
? (base
= NULL
) : base
;
757 base
= malloc (ABLOCKS_BYTES
);
758 abase
= ALIGN (base
, BLOCK_ALIGN
);
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
*) (long) 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
== (long) ABLOCKS_BUSY (abase
));
804 abase
= ABLOCK_ABASE (free_ablock
);
805 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (2 + (long) 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 + (long) ABLOCKS_BUSY (abase
));
839 if (2 > (long) ABLOCKS_BUSY (abase
))
840 { /* All the blocks are free. */
841 int i
= 0, aligned
= (long) 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. */
1134 interval_block
= NULL
;
1135 interval_block_index
= INTERVAL_BLOCK_SIZE
;
1136 interval_free_list
= 0;
1137 n_interval_blocks
= 0;
1141 /* Return a new interval. */
1148 if (interval_free_list
)
1150 val
= interval_free_list
;
1151 interval_free_list
= INTERVAL_PARENT (interval_free_list
);
1155 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
1157 register struct interval_block
*newi
;
1159 newi
= (struct interval_block
*) lisp_malloc (sizeof *newi
,
1162 newi
->next
= interval_block
;
1163 interval_block
= newi
;
1164 interval_block_index
= 0;
1165 n_interval_blocks
++;
1167 val
= &interval_block
->intervals
[interval_block_index
++];
1169 consing_since_gc
+= sizeof (struct interval
);
1171 RESET_INTERVAL (val
);
1177 /* Mark Lisp objects in interval I. */
1180 mark_interval (i
, dummy
)
1181 register INTERVAL i
;
1184 eassert (!i
->gcmarkbit
); /* Intervals are never shared. */
1186 mark_object (i
->plist
);
1190 /* Mark the interval tree rooted in TREE. Don't call this directly;
1191 use the macro MARK_INTERVAL_TREE instead. */
1194 mark_interval_tree (tree
)
1195 register INTERVAL tree
;
1197 /* No need to test if this tree has been marked already; this
1198 function is always called through the MARK_INTERVAL_TREE macro,
1199 which takes care of that. */
1201 traverse_intervals_noorder (tree
, mark_interval
, Qnil
);
1205 /* Mark the interval tree rooted in I. */
1207 #define MARK_INTERVAL_TREE(i) \
1209 if (!NULL_INTERVAL_P (i) && !i->gcmarkbit) \
1210 mark_interval_tree (i); \
1214 #define UNMARK_BALANCE_INTERVALS(i) \
1216 if (! NULL_INTERVAL_P (i)) \
1217 (i) = balance_intervals (i); \
1221 /* Number support. If NO_UNION_TYPE isn't in effect, we
1222 can't create number objects in macros. */
1230 obj
.s
.type
= Lisp_Int
;
1235 /***********************************************************************
1237 ***********************************************************************/
1239 /* Lisp_Strings are allocated in string_block structures. When a new
1240 string_block is allocated, all the Lisp_Strings it contains are
1241 added to a free-list string_free_list. When a new Lisp_String is
1242 needed, it is taken from that list. During the sweep phase of GC,
1243 string_blocks that are entirely free are freed, except two which
1246 String data is allocated from sblock structures. Strings larger
1247 than LARGE_STRING_BYTES, get their own sblock, data for smaller
1248 strings is sub-allocated out of sblocks of size SBLOCK_SIZE.
1250 Sblocks consist internally of sdata structures, one for each
1251 Lisp_String. The sdata structure points to the Lisp_String it
1252 belongs to. The Lisp_String points back to the `u.data' member of
1253 its sdata structure.
1255 When a Lisp_String is freed during GC, it is put back on
1256 string_free_list, and its `data' member and its sdata's `string'
1257 pointer is set to null. The size of the string is recorded in the
1258 `u.nbytes' member of the sdata. So, sdata structures that are no
1259 longer used, can be easily recognized, and it's easy to compact the
1260 sblocks of small strings which we do in compact_small_strings. */
1262 /* Size in bytes of an sblock structure used for small strings. This
1263 is 8192 minus malloc overhead. */
1265 #define SBLOCK_SIZE 8188
1267 /* Strings larger than this are considered large strings. String data
1268 for large strings is allocated from individual sblocks. */
1270 #define LARGE_STRING_BYTES 1024
1272 /* Structure describing string memory sub-allocated from an sblock.
1273 This is where the contents of Lisp strings are stored. */
1277 /* Back-pointer to the string this sdata belongs to. If null, this
1278 structure is free, and the NBYTES member of the union below
1279 contains the string's byte size (the same value that STRING_BYTES
1280 would return if STRING were non-null). If non-null, STRING_BYTES
1281 (STRING) is the size of the data, and DATA contains the string's
1283 struct Lisp_String
*string
;
1285 #ifdef GC_CHECK_STRING_BYTES
1288 unsigned char data
[1];
1290 #define SDATA_NBYTES(S) (S)->nbytes
1291 #define SDATA_DATA(S) (S)->data
1293 #else /* not GC_CHECK_STRING_BYTES */
1297 /* When STRING in non-null. */
1298 unsigned char data
[1];
1300 /* When STRING is null. */
1305 #define SDATA_NBYTES(S) (S)->u.nbytes
1306 #define SDATA_DATA(S) (S)->u.data
1308 #endif /* not GC_CHECK_STRING_BYTES */
1312 /* Structure describing a block of memory which is sub-allocated to
1313 obtain string data memory for strings. Blocks for small strings
1314 are of fixed size SBLOCK_SIZE. Blocks for large strings are made
1315 as large as needed. */
1320 struct sblock
*next
;
1322 /* Pointer to the next free sdata block. This points past the end
1323 of the sblock if there isn't any space left in this block. */
1324 struct sdata
*next_free
;
1326 /* Start of data. */
1327 struct sdata first_data
;
1330 /* Number of Lisp strings in a string_block structure. The 1020 is
1331 1024 minus malloc overhead. */
1333 #define STRING_BLOCK_SIZE \
1334 ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String))
1336 /* Structure describing a block from which Lisp_String structures
1341 struct string_block
*next
;
1342 struct Lisp_String strings
[STRING_BLOCK_SIZE
];
1345 /* Head and tail of the list of sblock structures holding Lisp string
1346 data. We always allocate from current_sblock. The NEXT pointers
1347 in the sblock structures go from oldest_sblock to current_sblock. */
1349 static struct sblock
*oldest_sblock
, *current_sblock
;
1351 /* List of sblocks for large strings. */
1353 static struct sblock
*large_sblocks
;
1355 /* List of string_block structures, and how many there are. */
1357 static struct string_block
*string_blocks
;
1358 static int n_string_blocks
;
1360 /* Free-list of Lisp_Strings. */
1362 static struct Lisp_String
*string_free_list
;
1364 /* Number of live and free Lisp_Strings. */
1366 static int total_strings
, total_free_strings
;
1368 /* Number of bytes used by live strings. */
1370 static int total_string_size
;
1372 /* Given a pointer to a Lisp_String S which is on the free-list
1373 string_free_list, return a pointer to its successor in the
1376 #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S))
1378 /* Return a pointer to the sdata structure belonging to Lisp string S.
1379 S must be live, i.e. S->data must not be null. S->data is actually
1380 a pointer to the `u.data' member of its sdata structure; the
1381 structure starts at a constant offset in front of that. */
1383 #ifdef GC_CHECK_STRING_BYTES
1385 #define SDATA_OF_STRING(S) \
1386 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *) \
1387 - sizeof (EMACS_INT)))
1389 #else /* not GC_CHECK_STRING_BYTES */
1391 #define SDATA_OF_STRING(S) \
1392 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *)))
1394 #endif /* not GC_CHECK_STRING_BYTES */
1396 /* Value is the size of an sdata structure large enough to hold NBYTES
1397 bytes of string data. The value returned includes a terminating
1398 NUL byte, the size of the sdata structure, and padding. */
1400 #ifdef GC_CHECK_STRING_BYTES
1402 #define SDATA_SIZE(NBYTES) \
1403 ((sizeof (struct Lisp_String *) \
1405 + sizeof (EMACS_INT) \
1406 + sizeof (EMACS_INT) - 1) \
1407 & ~(sizeof (EMACS_INT) - 1))
1409 #else /* not GC_CHECK_STRING_BYTES */
1411 #define SDATA_SIZE(NBYTES) \
1412 ((sizeof (struct Lisp_String *) \
1414 + sizeof (EMACS_INT) - 1) \
1415 & ~(sizeof (EMACS_INT) - 1))
1417 #endif /* not GC_CHECK_STRING_BYTES */
1419 /* Initialize string allocation. Called from init_alloc_once. */
1424 total_strings
= total_free_strings
= total_string_size
= 0;
1425 oldest_sblock
= current_sblock
= large_sblocks
= NULL
;
1426 string_blocks
= NULL
;
1427 n_string_blocks
= 0;
1428 string_free_list
= NULL
;
1432 #ifdef GC_CHECK_STRING_BYTES
1434 static int check_string_bytes_count
;
1436 void check_string_bytes
P_ ((int));
1437 void check_sblock
P_ ((struct sblock
*));
1439 #define CHECK_STRING_BYTES(S) STRING_BYTES (S)
1442 /* Like GC_STRING_BYTES, but with debugging check. */
1446 struct Lisp_String
*s
;
1448 int nbytes
= (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1449 if (!PURE_POINTER_P (s
)
1451 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1456 /* Check validity of Lisp strings' string_bytes member in B. */
1462 struct sdata
*from
, *end
, *from_end
;
1466 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1468 /* Compute the next FROM here because copying below may
1469 overwrite data we need to compute it. */
1472 /* Check that the string size recorded in the string is the
1473 same as the one recorded in the sdata structure. */
1475 CHECK_STRING_BYTES (from
->string
);
1478 nbytes
= GC_STRING_BYTES (from
->string
);
1480 nbytes
= SDATA_NBYTES (from
);
1482 nbytes
= SDATA_SIZE (nbytes
);
1483 from_end
= (struct sdata
*) ((char *) from
+ nbytes
);
1488 /* Check validity of Lisp strings' string_bytes member. ALL_P
1489 non-zero means check all strings, otherwise check only most
1490 recently allocated strings. Used for hunting a bug. */
1493 check_string_bytes (all_p
)
1500 for (b
= large_sblocks
; b
; b
= b
->next
)
1502 struct Lisp_String
*s
= b
->first_data
.string
;
1504 CHECK_STRING_BYTES (s
);
1507 for (b
= oldest_sblock
; b
; b
= b
->next
)
1511 check_sblock (current_sblock
);
1514 #endif /* GC_CHECK_STRING_BYTES */
1517 /* Return a new Lisp_String. */
1519 static struct Lisp_String
*
1522 struct Lisp_String
*s
;
1524 /* If the free-list is empty, allocate a new string_block, and
1525 add all the Lisp_Strings in it to the free-list. */
1526 if (string_free_list
== NULL
)
1528 struct string_block
*b
;
1531 b
= (struct string_block
*) lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1532 bzero (b
, sizeof *b
);
1533 b
->next
= string_blocks
;
1537 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1540 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1541 string_free_list
= s
;
1544 total_free_strings
+= STRING_BLOCK_SIZE
;
1547 /* Pop a Lisp_String off the free-list. */
1548 s
= string_free_list
;
1549 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1551 /* Probably not strictly necessary, but play it safe. */
1552 bzero (s
, sizeof *s
);
1554 --total_free_strings
;
1557 consing_since_gc
+= sizeof *s
;
1559 #ifdef GC_CHECK_STRING_BYTES
1566 if (++check_string_bytes_count
== 200)
1568 check_string_bytes_count
= 0;
1569 check_string_bytes (1);
1572 check_string_bytes (0);
1574 #endif /* GC_CHECK_STRING_BYTES */
1580 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1581 plus a NUL byte at the end. Allocate an sdata structure for S, and
1582 set S->data to its `u.data' member. Store a NUL byte at the end of
1583 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1584 S->data if it was initially non-null. */
1587 allocate_string_data (s
, nchars
, nbytes
)
1588 struct Lisp_String
*s
;
1591 struct sdata
*data
, *old_data
;
1593 int needed
, old_nbytes
;
1595 /* Determine the number of bytes needed to store NBYTES bytes
1597 needed
= SDATA_SIZE (nbytes
);
1599 if (nbytes
> LARGE_STRING_BYTES
)
1601 size_t size
= sizeof *b
- sizeof (struct sdata
) + needed
;
1603 #ifdef DOUG_LEA_MALLOC
1604 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1605 because mapped region contents are not preserved in
1608 In case you think of allowing it in a dumped Emacs at the
1609 cost of not being able to re-dump, there's another reason:
1610 mmap'ed data typically have an address towards the top of the
1611 address space, which won't fit into an EMACS_INT (at least on
1612 32-bit systems with the current tagging scheme). --fx */
1613 mallopt (M_MMAP_MAX
, 0);
1616 b
= (struct sblock
*) lisp_malloc (size
, MEM_TYPE_NON_LISP
);
1618 #ifdef DOUG_LEA_MALLOC
1619 /* Back to a reasonable maximum of mmap'ed areas. */
1620 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1623 b
->next_free
= &b
->first_data
;
1624 b
->first_data
.string
= NULL
;
1625 b
->next
= large_sblocks
;
1628 else if (current_sblock
== NULL
1629 || (((char *) current_sblock
+ SBLOCK_SIZE
1630 - (char *) current_sblock
->next_free
)
1633 /* Not enough room in the current sblock. */
1634 b
= (struct sblock
*) lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
1635 b
->next_free
= &b
->first_data
;
1636 b
->first_data
.string
= NULL
;
1640 current_sblock
->next
= b
;
1648 old_data
= s
->data
? SDATA_OF_STRING (s
) : NULL
;
1649 old_nbytes
= GC_STRING_BYTES (s
);
1651 data
= b
->next_free
;
1653 s
->data
= SDATA_DATA (data
);
1654 #ifdef GC_CHECK_STRING_BYTES
1655 SDATA_NBYTES (data
) = nbytes
;
1658 s
->size_byte
= nbytes
;
1659 s
->data
[nbytes
] = '\0';
1660 b
->next_free
= (struct sdata
*) ((char *) data
+ needed
);
1662 /* If S had already data assigned, mark that as free by setting its
1663 string back-pointer to null, and recording the size of the data
1667 SDATA_NBYTES (old_data
) = old_nbytes
;
1668 old_data
->string
= NULL
;
1671 consing_since_gc
+= needed
;
1675 /* Sweep and compact strings. */
1680 struct string_block
*b
, *next
;
1681 struct string_block
*live_blocks
= NULL
;
1683 string_free_list
= NULL
;
1684 total_strings
= total_free_strings
= 0;
1685 total_string_size
= 0;
1687 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
1688 for (b
= string_blocks
; b
; b
= next
)
1691 struct Lisp_String
*free_list_before
= string_free_list
;
1695 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
1697 struct Lisp_String
*s
= b
->strings
+ i
;
1701 /* String was not on free-list before. */
1702 if (STRING_MARKED_P (s
))
1704 /* String is live; unmark it and its intervals. */
1707 if (!NULL_INTERVAL_P (s
->intervals
))
1708 UNMARK_BALANCE_INTERVALS (s
->intervals
);
1711 total_string_size
+= STRING_BYTES (s
);
1715 /* String is dead. Put it on the free-list. */
1716 struct sdata
*data
= SDATA_OF_STRING (s
);
1718 /* Save the size of S in its sdata so that we know
1719 how large that is. Reset the sdata's string
1720 back-pointer so that we know it's free. */
1721 #ifdef GC_CHECK_STRING_BYTES
1722 if (GC_STRING_BYTES (s
) != SDATA_NBYTES (data
))
1725 data
->u
.nbytes
= GC_STRING_BYTES (s
);
1727 data
->string
= NULL
;
1729 /* Reset the strings's `data' member so that we
1733 /* Put the string on the free-list. */
1734 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1735 string_free_list
= s
;
1741 /* S was on the free-list before. Put it there again. */
1742 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1743 string_free_list
= s
;
1748 /* Free blocks that contain free Lisp_Strings only, except
1749 the first two of them. */
1750 if (nfree
== STRING_BLOCK_SIZE
1751 && total_free_strings
> STRING_BLOCK_SIZE
)
1755 string_free_list
= free_list_before
;
1759 total_free_strings
+= nfree
;
1760 b
->next
= live_blocks
;
1765 string_blocks
= live_blocks
;
1766 free_large_strings ();
1767 compact_small_strings ();
1771 /* Free dead large strings. */
1774 free_large_strings ()
1776 struct sblock
*b
, *next
;
1777 struct sblock
*live_blocks
= NULL
;
1779 for (b
= large_sblocks
; b
; b
= next
)
1783 if (b
->first_data
.string
== NULL
)
1787 b
->next
= live_blocks
;
1792 large_sblocks
= live_blocks
;
1796 /* Compact data of small strings. Free sblocks that don't contain
1797 data of live strings after compaction. */
1800 compact_small_strings ()
1802 struct sblock
*b
, *tb
, *next
;
1803 struct sdata
*from
, *to
, *end
, *tb_end
;
1804 struct sdata
*to_end
, *from_end
;
1806 /* TB is the sblock we copy to, TO is the sdata within TB we copy
1807 to, and TB_END is the end of TB. */
1809 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
1810 to
= &tb
->first_data
;
1812 /* Step through the blocks from the oldest to the youngest. We
1813 expect that old blocks will stabilize over time, so that less
1814 copying will happen this way. */
1815 for (b
= oldest_sblock
; b
; b
= b
->next
)
1818 xassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
1820 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1822 /* Compute the next FROM here because copying below may
1823 overwrite data we need to compute it. */
1826 #ifdef GC_CHECK_STRING_BYTES
1827 /* Check that the string size recorded in the string is the
1828 same as the one recorded in the sdata structure. */
1830 && GC_STRING_BYTES (from
->string
) != SDATA_NBYTES (from
))
1832 #endif /* GC_CHECK_STRING_BYTES */
1835 nbytes
= GC_STRING_BYTES (from
->string
);
1837 nbytes
= SDATA_NBYTES (from
);
1839 nbytes
= SDATA_SIZE (nbytes
);
1840 from_end
= (struct sdata
*) ((char *) from
+ nbytes
);
1842 /* FROM->string non-null means it's alive. Copy its data. */
1845 /* If TB is full, proceed with the next sblock. */
1846 to_end
= (struct sdata
*) ((char *) to
+ nbytes
);
1847 if (to_end
> tb_end
)
1851 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
1852 to
= &tb
->first_data
;
1853 to_end
= (struct sdata
*) ((char *) to
+ nbytes
);
1856 /* Copy, and update the string's `data' pointer. */
1859 xassert (tb
!= b
|| to
<= from
);
1860 safe_bcopy ((char *) from
, (char *) to
, nbytes
);
1861 to
->string
->data
= SDATA_DATA (to
);
1864 /* Advance past the sdata we copied to. */
1870 /* The rest of the sblocks following TB don't contain live data, so
1871 we can free them. */
1872 for (b
= tb
->next
; b
; b
= next
)
1880 current_sblock
= tb
;
1884 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
1885 doc
: /* Return a newly created string of length LENGTH, with each element being INIT.
1886 Both LENGTH and INIT must be numbers. */)
1888 Lisp_Object length
, init
;
1890 register Lisp_Object val
;
1891 register unsigned char *p
, *end
;
1894 CHECK_NATNUM (length
);
1895 CHECK_NUMBER (init
);
1898 if (SINGLE_BYTE_CHAR_P (c
))
1900 nbytes
= XINT (length
);
1901 val
= make_uninit_string (nbytes
);
1903 end
= p
+ SCHARS (val
);
1909 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
1910 int len
= CHAR_STRING (c
, str
);
1912 nbytes
= len
* XINT (length
);
1913 val
= make_uninit_multibyte_string (XINT (length
), nbytes
);
1918 bcopy (str
, p
, len
);
1928 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
1929 doc
: /* Return a new bool-vector of length LENGTH, using INIT for as each element.
1930 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
1932 Lisp_Object length
, init
;
1934 register Lisp_Object val
;
1935 struct Lisp_Bool_Vector
*p
;
1937 int length_in_chars
, length_in_elts
, bits_per_value
;
1939 CHECK_NATNUM (length
);
1941 bits_per_value
= sizeof (EMACS_INT
) * BITS_PER_CHAR
;
1943 length_in_elts
= (XFASTINT (length
) + bits_per_value
- 1) / bits_per_value
;
1944 length_in_chars
= ((XFASTINT (length
) + BITS_PER_CHAR
- 1) / BITS_PER_CHAR
);
1946 /* We must allocate one more elements than LENGTH_IN_ELTS for the
1947 slot `size' of the struct Lisp_Bool_Vector. */
1948 val
= Fmake_vector (make_number (length_in_elts
+ 1), Qnil
);
1949 p
= XBOOL_VECTOR (val
);
1951 /* Get rid of any bits that would cause confusion. */
1953 XSETBOOL_VECTOR (val
, p
);
1954 p
->size
= XFASTINT (length
);
1956 real_init
= (NILP (init
) ? 0 : -1);
1957 for (i
= 0; i
< length_in_chars
; i
++)
1958 p
->data
[i
] = real_init
;
1960 /* Clear the extraneous bits in the last byte. */
1961 if (XINT (length
) != length_in_chars
* BITS_PER_CHAR
)
1962 XBOOL_VECTOR (val
)->data
[length_in_chars
- 1]
1963 &= (1 << (XINT (length
) % BITS_PER_CHAR
)) - 1;
1969 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
1970 of characters from the contents. This string may be unibyte or
1971 multibyte, depending on the contents. */
1974 make_string (contents
, nbytes
)
1975 const char *contents
;
1978 register Lisp_Object val
;
1979 int nchars
, multibyte_nbytes
;
1981 parse_str_as_multibyte (contents
, nbytes
, &nchars
, &multibyte_nbytes
);
1982 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
1983 /* CONTENTS contains no multibyte sequences or contains an invalid
1984 multibyte sequence. We must make unibyte string. */
1985 val
= make_unibyte_string (contents
, nbytes
);
1987 val
= make_multibyte_string (contents
, nchars
, nbytes
);
1992 /* Make an unibyte string from LENGTH bytes at CONTENTS. */
1995 make_unibyte_string (contents
, length
)
1996 const char *contents
;
1999 register Lisp_Object val
;
2000 val
= make_uninit_string (length
);
2001 bcopy (contents
, SDATA (val
), length
);
2002 STRING_SET_UNIBYTE (val
);
2007 /* Make a multibyte string from NCHARS characters occupying NBYTES
2008 bytes at CONTENTS. */
2011 make_multibyte_string (contents
, nchars
, nbytes
)
2012 const char *contents
;
2015 register Lisp_Object val
;
2016 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2017 bcopy (contents
, SDATA (val
), nbytes
);
2022 /* Make a string from NCHARS characters occupying NBYTES bytes at
2023 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2026 make_string_from_bytes (contents
, nchars
, nbytes
)
2027 const char *contents
;
2030 register Lisp_Object val
;
2031 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2032 bcopy (contents
, SDATA (val
), nbytes
);
2033 if (SBYTES (val
) == SCHARS (val
))
2034 STRING_SET_UNIBYTE (val
);
2039 /* Make a string from NCHARS characters occupying NBYTES bytes at
2040 CONTENTS. The argument MULTIBYTE controls whether to label the
2041 string as multibyte. If NCHARS is negative, it counts the number of
2042 characters by itself. */
2045 make_specified_string (contents
, nchars
, nbytes
, multibyte
)
2046 const char *contents
;
2050 register Lisp_Object val
;
2055 nchars
= multibyte_chars_in_text (contents
, nbytes
);
2059 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2060 bcopy (contents
, SDATA (val
), nbytes
);
2062 STRING_SET_UNIBYTE (val
);
2067 /* Make a string from the data at STR, treating it as multibyte if the
2074 return make_string (str
, strlen (str
));
2078 /* Return an unibyte Lisp_String set up to hold LENGTH characters
2079 occupying LENGTH bytes. */
2082 make_uninit_string (length
)
2086 val
= make_uninit_multibyte_string (length
, length
);
2087 STRING_SET_UNIBYTE (val
);
2092 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2093 which occupy NBYTES bytes. */
2096 make_uninit_multibyte_string (nchars
, nbytes
)
2100 struct Lisp_String
*s
;
2105 s
= allocate_string ();
2106 allocate_string_data (s
, nchars
, nbytes
);
2107 XSETSTRING (string
, s
);
2108 string_chars_consed
+= nbytes
;
2114 /***********************************************************************
2116 ***********************************************************************/
2118 /* We store float cells inside of float_blocks, allocating a new
2119 float_block with malloc whenever necessary. Float cells reclaimed
2120 by GC are put on a free list to be reallocated before allocating
2121 any new float cells from the latest float_block. */
2123 #define FLOAT_BLOCK_SIZE \
2124 (((BLOCK_BYTES - sizeof (struct float_block *)) * CHAR_BIT) \
2125 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2127 #define GETMARKBIT(block,n) \
2128 (((block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2129 >> ((n) % (sizeof(int) * CHAR_BIT))) \
2132 #define SETMARKBIT(block,n) \
2133 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2134 |= 1 << ((n) % (sizeof(int) * CHAR_BIT))
2136 #define UNSETMARKBIT(block,n) \
2137 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2138 &= ~(1 << ((n) % (sizeof(int) * CHAR_BIT)))
2140 #define FLOAT_BLOCK(fptr) \
2141 ((struct float_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2143 #define FLOAT_INDEX(fptr) \
2144 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2148 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2149 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2150 int gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2151 struct float_block
*next
;
2154 #define FLOAT_MARKED_P(fptr) \
2155 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2157 #define FLOAT_MARK(fptr) \
2158 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2160 #define FLOAT_UNMARK(fptr) \
2161 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2163 /* Current float_block. */
2165 struct float_block
*float_block
;
2167 /* Index of first unused Lisp_Float in the current float_block. */
2169 int float_block_index
;
2171 /* Total number of float blocks now in use. */
2175 /* Free-list of Lisp_Floats. */
2177 struct Lisp_Float
*float_free_list
;
2180 /* Initialize float allocation. */
2186 float_block_index
= FLOAT_BLOCK_SIZE
; /* Force alloc of new float_block. */
2187 float_free_list
= 0;
2192 /* Explicitly free a float cell by putting it on the free-list. */
2196 struct Lisp_Float
*ptr
;
2198 *(struct Lisp_Float
**)&ptr
->data
= float_free_list
;
2199 float_free_list
= ptr
;
2203 /* Return a new float object with value FLOAT_VALUE. */
2206 make_float (float_value
)
2209 register Lisp_Object val
;
2211 if (float_free_list
)
2213 /* We use the data field for chaining the free list
2214 so that we won't use the same field that has the mark bit. */
2215 XSETFLOAT (val
, float_free_list
);
2216 float_free_list
= *(struct Lisp_Float
**)&float_free_list
->data
;
2220 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2222 register struct float_block
*new;
2224 new = (struct float_block
*) lisp_align_malloc (sizeof *new,
2226 new->next
= float_block
;
2228 float_block_index
= 0;
2231 XSETFLOAT (val
, &float_block
->floats
[float_block_index
++]);
2234 XFLOAT_DATA (val
) = float_value
;
2235 FLOAT_UNMARK (XFLOAT (val
));
2236 consing_since_gc
+= sizeof (struct Lisp_Float
);
2243 /***********************************************************************
2245 ***********************************************************************/
2247 /* We store cons cells inside of cons_blocks, allocating a new
2248 cons_block with malloc whenever necessary. Cons cells reclaimed by
2249 GC are put on a free list to be reallocated before allocating
2250 any new cons cells from the latest cons_block. */
2252 #define CONS_BLOCK_SIZE \
2253 (((BLOCK_BYTES - sizeof (struct cons_block *)) * CHAR_BIT) \
2254 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2256 #define CONS_BLOCK(fptr) \
2257 ((struct cons_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2259 #define CONS_INDEX(fptr) \
2260 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2264 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2265 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2266 int gcmarkbits
[1 + CONS_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2267 struct cons_block
*next
;
2270 #define CONS_MARKED_P(fptr) \
2271 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2273 #define CONS_MARK(fptr) \
2274 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2276 #define CONS_UNMARK(fptr) \
2277 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2279 /* Current cons_block. */
2281 struct cons_block
*cons_block
;
2283 /* Index of first unused Lisp_Cons in the current block. */
2285 int cons_block_index
;
2287 /* Free-list of Lisp_Cons structures. */
2289 struct Lisp_Cons
*cons_free_list
;
2291 /* Total number of cons blocks now in use. */
2296 /* Initialize cons allocation. */
2302 cons_block_index
= CONS_BLOCK_SIZE
; /* Force alloc of new cons_block. */
2308 /* Explicitly free a cons cell by putting it on the free-list. */
2312 struct Lisp_Cons
*ptr
;
2314 *(struct Lisp_Cons
**)&ptr
->cdr
= cons_free_list
;
2318 cons_free_list
= ptr
;
2322 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
2323 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2325 Lisp_Object car
, cdr
;
2327 register Lisp_Object val
;
2331 /* We use the cdr for chaining the free list
2332 so that we won't use the same field that has the mark bit. */
2333 XSETCONS (val
, cons_free_list
);
2334 cons_free_list
= *(struct Lisp_Cons
**)&cons_free_list
->cdr
;
2338 if (cons_block_index
== CONS_BLOCK_SIZE
)
2340 register struct cons_block
*new;
2341 new = (struct cons_block
*) lisp_align_malloc (sizeof *new,
2343 new->next
= cons_block
;
2345 cons_block_index
= 0;
2348 XSETCONS (val
, &cons_block
->conses
[cons_block_index
++]);
2353 CONS_UNMARK (XCONS (val
));
2354 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2355 cons_cells_consed
++;
2360 /* Make a list of 2, 3, 4 or 5 specified objects. */
2364 Lisp_Object arg1
, arg2
;
2366 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2371 list3 (arg1
, arg2
, arg3
)
2372 Lisp_Object arg1
, arg2
, arg3
;
2374 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2379 list4 (arg1
, arg2
, arg3
, arg4
)
2380 Lisp_Object arg1
, arg2
, arg3
, arg4
;
2382 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2387 list5 (arg1
, arg2
, arg3
, arg4
, arg5
)
2388 Lisp_Object arg1
, arg2
, arg3
, arg4
, arg5
;
2390 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2391 Fcons (arg5
, Qnil
)))));
2395 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
2396 doc
: /* Return a newly created list with specified arguments as elements.
2397 Any number of arguments, even zero arguments, are allowed.
2398 usage: (list &rest OBJECTS) */)
2401 register Lisp_Object
*args
;
2403 register Lisp_Object val
;
2409 val
= Fcons (args
[nargs
], val
);
2415 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2416 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2418 register Lisp_Object length
, init
;
2420 register Lisp_Object val
;
2423 CHECK_NATNUM (length
);
2424 size
= XFASTINT (length
);
2429 val
= Fcons (init
, val
);
2434 val
= Fcons (init
, val
);
2439 val
= Fcons (init
, val
);
2444 val
= Fcons (init
, val
);
2449 val
= Fcons (init
, val
);
2464 /***********************************************************************
2466 ***********************************************************************/
2468 /* Singly-linked list of all vectors. */
2470 struct Lisp_Vector
*all_vectors
;
2472 /* Total number of vector-like objects now in use. */
2477 /* Value is a pointer to a newly allocated Lisp_Vector structure
2478 with room for LEN Lisp_Objects. */
2480 static struct Lisp_Vector
*
2481 allocate_vectorlike (len
, type
)
2485 struct Lisp_Vector
*p
;
2488 #ifdef DOUG_LEA_MALLOC
2489 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
2490 because mapped region contents are not preserved in
2492 mallopt (M_MMAP_MAX
, 0);
2495 nbytes
= sizeof *p
+ (len
- 1) * sizeof p
->contents
[0];
2496 p
= (struct Lisp_Vector
*) lisp_malloc (nbytes
, type
);
2498 #ifdef DOUG_LEA_MALLOC
2499 /* Back to a reasonable maximum of mmap'ed areas. */
2500 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2503 consing_since_gc
+= nbytes
;
2504 vector_cells_consed
+= len
;
2506 p
->next
= all_vectors
;
2513 /* Allocate a vector with NSLOTS slots. */
2515 struct Lisp_Vector
*
2516 allocate_vector (nslots
)
2519 struct Lisp_Vector
*v
= allocate_vectorlike (nslots
, MEM_TYPE_VECTOR
);
2525 /* Allocate other vector-like structures. */
2527 struct Lisp_Hash_Table
*
2528 allocate_hash_table ()
2530 EMACS_INT len
= VECSIZE (struct Lisp_Hash_Table
);
2531 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_HASH_TABLE
);
2535 for (i
= 0; i
< len
; ++i
)
2536 v
->contents
[i
] = Qnil
;
2538 return (struct Lisp_Hash_Table
*) v
;
2545 EMACS_INT len
= VECSIZE (struct window
);
2546 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_WINDOW
);
2549 for (i
= 0; i
< len
; ++i
)
2550 v
->contents
[i
] = Qnil
;
2553 return (struct window
*) v
;
2560 EMACS_INT len
= VECSIZE (struct frame
);
2561 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_FRAME
);
2564 for (i
= 0; i
< len
; ++i
)
2565 v
->contents
[i
] = make_number (0);
2567 return (struct frame
*) v
;
2571 struct Lisp_Process
*
2574 EMACS_INT len
= VECSIZE (struct Lisp_Process
);
2575 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_PROCESS
);
2578 for (i
= 0; i
< len
; ++i
)
2579 v
->contents
[i
] = Qnil
;
2582 return (struct Lisp_Process
*) v
;
2586 struct Lisp_Vector
*
2587 allocate_other_vector (len
)
2590 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_VECTOR
);
2593 for (i
= 0; i
< len
; ++i
)
2594 v
->contents
[i
] = Qnil
;
2601 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
2602 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
2603 See also the function `vector'. */)
2605 register Lisp_Object length
, init
;
2608 register EMACS_INT sizei
;
2610 register struct Lisp_Vector
*p
;
2612 CHECK_NATNUM (length
);
2613 sizei
= XFASTINT (length
);
2615 p
= allocate_vector (sizei
);
2616 for (index
= 0; index
< sizei
; index
++)
2617 p
->contents
[index
] = init
;
2619 XSETVECTOR (vector
, p
);
2624 DEFUN ("make-char-table", Fmake_char_table
, Smake_char_table
, 1, 2, 0,
2625 doc
: /* Return a newly created char-table, with purpose PURPOSE.
2626 Each element is initialized to INIT, which defaults to nil.
2627 PURPOSE should be a symbol which has a `char-table-extra-slots' property.
2628 The property's value should be an integer between 0 and 10. */)
2630 register Lisp_Object purpose
, init
;
2634 CHECK_SYMBOL (purpose
);
2635 n
= Fget (purpose
, Qchar_table_extra_slots
);
2637 if (XINT (n
) < 0 || XINT (n
) > 10)
2638 args_out_of_range (n
, Qnil
);
2639 /* Add 2 to the size for the defalt and parent slots. */
2640 vector
= Fmake_vector (make_number (CHAR_TABLE_STANDARD_SLOTS
+ XINT (n
)),
2642 XCHAR_TABLE (vector
)->top
= Qt
;
2643 XCHAR_TABLE (vector
)->parent
= Qnil
;
2644 XCHAR_TABLE (vector
)->purpose
= purpose
;
2645 XSETCHAR_TABLE (vector
, XCHAR_TABLE (vector
));
2650 /* Return a newly created sub char table with default value DEFALT.
2651 Since a sub char table does not appear as a top level Emacs Lisp
2652 object, we don't need a Lisp interface to make it. */
2655 make_sub_char_table (defalt
)
2659 = Fmake_vector (make_number (SUB_CHAR_TABLE_STANDARD_SLOTS
), Qnil
);
2660 XCHAR_TABLE (vector
)->top
= Qnil
;
2661 XCHAR_TABLE (vector
)->defalt
= defalt
;
2662 XSETCHAR_TABLE (vector
, XCHAR_TABLE (vector
));
2667 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
2668 doc
: /* Return a newly created vector with specified arguments as elements.
2669 Any number of arguments, even zero arguments, are allowed.
2670 usage: (vector &rest OBJECTS) */)
2675 register Lisp_Object len
, val
;
2677 register struct Lisp_Vector
*p
;
2679 XSETFASTINT (len
, nargs
);
2680 val
= Fmake_vector (len
, Qnil
);
2682 for (index
= 0; index
< nargs
; index
++)
2683 p
->contents
[index
] = args
[index
];
2688 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
2689 doc
: /* Create a byte-code object with specified arguments as elements.
2690 The arguments should be the arglist, bytecode-string, constant vector,
2691 stack size, (optional) doc string, and (optional) interactive spec.
2692 The first four arguments are required; at most six have any
2694 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
2699 register Lisp_Object len
, val
;
2701 register struct Lisp_Vector
*p
;
2703 XSETFASTINT (len
, nargs
);
2704 if (!NILP (Vpurify_flag
))
2705 val
= make_pure_vector ((EMACS_INT
) nargs
);
2707 val
= Fmake_vector (len
, Qnil
);
2709 if (STRINGP (args
[1]) && STRING_MULTIBYTE (args
[1]))
2710 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
2711 earlier because they produced a raw 8-bit string for byte-code
2712 and now such a byte-code string is loaded as multibyte while
2713 raw 8-bit characters converted to multibyte form. Thus, now we
2714 must convert them back to the original unibyte form. */
2715 args
[1] = Fstring_as_unibyte (args
[1]);
2718 for (index
= 0; index
< nargs
; index
++)
2720 if (!NILP (Vpurify_flag
))
2721 args
[index
] = Fpurecopy (args
[index
]);
2722 p
->contents
[index
] = args
[index
];
2724 XSETCOMPILED (val
, p
);
2730 /***********************************************************************
2732 ***********************************************************************/
2734 /* Each symbol_block is just under 1020 bytes long, since malloc
2735 really allocates in units of powers of two and uses 4 bytes for its
2738 #define SYMBOL_BLOCK_SIZE \
2739 ((1020 - sizeof (struct symbol_block *)) / sizeof (struct Lisp_Symbol))
2743 struct symbol_block
*next
;
2744 struct Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
2747 /* Current symbol block and index of first unused Lisp_Symbol
2750 struct symbol_block
*symbol_block
;
2751 int symbol_block_index
;
2753 /* List of free symbols. */
2755 struct Lisp_Symbol
*symbol_free_list
;
2757 /* Total number of symbol blocks now in use. */
2759 int n_symbol_blocks
;
2762 /* Initialize symbol allocation. */
2767 symbol_block
= NULL
;
2768 symbol_block_index
= SYMBOL_BLOCK_SIZE
;
2769 symbol_free_list
= 0;
2770 n_symbol_blocks
= 0;
2774 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
2775 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
2776 Its value and function definition are void, and its property list is nil. */)
2780 register Lisp_Object val
;
2781 register struct Lisp_Symbol
*p
;
2783 CHECK_STRING (name
);
2785 if (symbol_free_list
)
2787 XSETSYMBOL (val
, symbol_free_list
);
2788 symbol_free_list
= *(struct Lisp_Symbol
**)&symbol_free_list
->value
;
2792 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
2794 struct symbol_block
*new;
2795 new = (struct symbol_block
*) lisp_malloc (sizeof *new,
2797 new->next
= symbol_block
;
2799 symbol_block_index
= 0;
2802 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
++]);
2808 p
->value
= Qunbound
;
2809 p
->function
= Qunbound
;
2812 p
->interned
= SYMBOL_UNINTERNED
;
2814 p
->indirect_variable
= 0;
2815 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
2822 /***********************************************************************
2823 Marker (Misc) Allocation
2824 ***********************************************************************/
2826 /* Allocation of markers and other objects that share that structure.
2827 Works like allocation of conses. */
2829 #define MARKER_BLOCK_SIZE \
2830 ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc))
2834 struct marker_block
*next
;
2835 union Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
2838 struct marker_block
*marker_block
;
2839 int marker_block_index
;
2841 union Lisp_Misc
*marker_free_list
;
2843 /* Total number of marker blocks now in use. */
2845 int n_marker_blocks
;
2850 marker_block
= NULL
;
2851 marker_block_index
= MARKER_BLOCK_SIZE
;
2852 marker_free_list
= 0;
2853 n_marker_blocks
= 0;
2854 fprintf(stderr
, "union Lisp_Misc = %d\n", sizeof (union Lisp_Misc
));
2857 /* Return a newly allocated Lisp_Misc object, with no substructure. */
2864 if (marker_free_list
)
2866 XSETMISC (val
, marker_free_list
);
2867 marker_free_list
= marker_free_list
->u_free
.chain
;
2871 if (marker_block_index
== MARKER_BLOCK_SIZE
)
2873 struct marker_block
*new;
2874 new = (struct marker_block
*) lisp_malloc (sizeof *new,
2876 new->next
= marker_block
;
2878 marker_block_index
= 0;
2881 XSETMISC (val
, &marker_block
->markers
[marker_block_index
++]);
2884 consing_since_gc
+= sizeof (union Lisp_Misc
);
2885 misc_objects_consed
++;
2886 XMARKER (val
)->gcmarkbit
= 0;
2890 /* Return a Lisp_Misc_Save_Value object containing POINTER and
2891 INTEGER. This is used to package C values to call record_unwind_protect.
2892 The unwind function can get the C values back using XSAVE_VALUE. */
2895 make_save_value (pointer
, integer
)
2899 register Lisp_Object val
;
2900 register struct Lisp_Save_Value
*p
;
2902 val
= allocate_misc ();
2903 XMISCTYPE (val
) = Lisp_Misc_Save_Value
;
2904 p
= XSAVE_VALUE (val
);
2905 p
->pointer
= pointer
;
2906 p
->integer
= integer
;
2910 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
2911 doc
: /* Return a newly allocated marker which does not point at any place. */)
2914 register Lisp_Object val
;
2915 register struct Lisp_Marker
*p
;
2917 val
= allocate_misc ();
2918 XMISCTYPE (val
) = Lisp_Misc_Marker
;
2924 p
->insertion_type
= 0;
2928 /* Put MARKER back on the free list after using it temporarily. */
2931 free_marker (marker
)
2934 unchain_marker (XMARKER (marker
));
2936 XMISC (marker
)->u_marker
.type
= Lisp_Misc_Free
;
2937 XMISC (marker
)->u_free
.chain
= marker_free_list
;
2938 marker_free_list
= XMISC (marker
);
2940 total_free_markers
++;
2944 /* Return a newly created vector or string with specified arguments as
2945 elements. If all the arguments are characters that can fit
2946 in a string of events, make a string; otherwise, make a vector.
2948 Any number of arguments, even zero arguments, are allowed. */
2951 make_event_array (nargs
, args
)
2957 for (i
= 0; i
< nargs
; i
++)
2958 /* The things that fit in a string
2959 are characters that are in 0...127,
2960 after discarding the meta bit and all the bits above it. */
2961 if (!INTEGERP (args
[i
])
2962 || (XUINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
2963 return Fvector (nargs
, args
);
2965 /* Since the loop exited, we know that all the things in it are
2966 characters, so we can make a string. */
2970 result
= Fmake_string (make_number (nargs
), make_number (0));
2971 for (i
= 0; i
< nargs
; i
++)
2973 SSET (result
, i
, XINT (args
[i
]));
2974 /* Move the meta bit to the right place for a string char. */
2975 if (XINT (args
[i
]) & CHAR_META
)
2976 SSET (result
, i
, SREF (result
, i
) | 0x80);
2985 /************************************************************************
2987 ************************************************************************/
2989 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
2991 /* Conservative C stack marking requires a method to identify possibly
2992 live Lisp objects given a pointer value. We do this by keeping
2993 track of blocks of Lisp data that are allocated in a red-black tree
2994 (see also the comment of mem_node which is the type of nodes in
2995 that tree). Function lisp_malloc adds information for an allocated
2996 block to the red-black tree with calls to mem_insert, and function
2997 lisp_free removes it with mem_delete. Functions live_string_p etc
2998 call mem_find to lookup information about a given pointer in the
2999 tree, and use that to determine if the pointer points to a Lisp
3002 /* Initialize this part of alloc.c. */
3007 mem_z
.left
= mem_z
.right
= MEM_NIL
;
3008 mem_z
.parent
= NULL
;
3009 mem_z
.color
= MEM_BLACK
;
3010 mem_z
.start
= mem_z
.end
= NULL
;
3015 /* Value is a pointer to the mem_node containing START. Value is
3016 MEM_NIL if there is no node in the tree containing START. */
3018 static INLINE
struct mem_node
*
3024 if (start
< min_heap_address
|| start
> max_heap_address
)
3027 /* Make the search always successful to speed up the loop below. */
3028 mem_z
.start
= start
;
3029 mem_z
.end
= (char *) start
+ 1;
3032 while (start
< p
->start
|| start
>= p
->end
)
3033 p
= start
< p
->start
? p
->left
: p
->right
;
3038 /* Insert a new node into the tree for a block of memory with start
3039 address START, end address END, and type TYPE. Value is a
3040 pointer to the node that was inserted. */
3042 static struct mem_node
*
3043 mem_insert (start
, end
, type
)
3047 struct mem_node
*c
, *parent
, *x
;
3049 if (start
< min_heap_address
)
3050 min_heap_address
= start
;
3051 if (end
> max_heap_address
)
3052 max_heap_address
= end
;
3054 /* See where in the tree a node for START belongs. In this
3055 particular application, it shouldn't happen that a node is already
3056 present. For debugging purposes, let's check that. */
3060 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3062 while (c
!= MEM_NIL
)
3064 if (start
>= c
->start
&& start
< c
->end
)
3067 c
= start
< c
->start
? c
->left
: c
->right
;
3070 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3072 while (c
!= MEM_NIL
)
3075 c
= start
< c
->start
? c
->left
: c
->right
;
3078 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3080 /* Create a new node. */
3081 #ifdef GC_MALLOC_CHECK
3082 x
= (struct mem_node
*) _malloc_internal (sizeof *x
);
3086 x
= (struct mem_node
*) xmalloc (sizeof *x
);
3092 x
->left
= x
->right
= MEM_NIL
;
3095 /* Insert it as child of PARENT or install it as root. */
3098 if (start
< parent
->start
)
3106 /* Re-establish red-black tree properties. */
3107 mem_insert_fixup (x
);
3113 /* Re-establish the red-black properties of the tree, and thereby
3114 balance the tree, after node X has been inserted; X is always red. */
3117 mem_insert_fixup (x
)
3120 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3122 /* X is red and its parent is red. This is a violation of
3123 red-black tree property #3. */
3125 if (x
->parent
== x
->parent
->parent
->left
)
3127 /* We're on the left side of our grandparent, and Y is our
3129 struct mem_node
*y
= x
->parent
->parent
->right
;
3131 if (y
->color
== MEM_RED
)
3133 /* Uncle and parent are red but should be black because
3134 X is red. Change the colors accordingly and proceed
3135 with the grandparent. */
3136 x
->parent
->color
= MEM_BLACK
;
3137 y
->color
= MEM_BLACK
;
3138 x
->parent
->parent
->color
= MEM_RED
;
3139 x
= x
->parent
->parent
;
3143 /* Parent and uncle have different colors; parent is
3144 red, uncle is black. */
3145 if (x
== x
->parent
->right
)
3148 mem_rotate_left (x
);
3151 x
->parent
->color
= MEM_BLACK
;
3152 x
->parent
->parent
->color
= MEM_RED
;
3153 mem_rotate_right (x
->parent
->parent
);
3158 /* This is the symmetrical case of above. */
3159 struct mem_node
*y
= x
->parent
->parent
->left
;
3161 if (y
->color
== MEM_RED
)
3163 x
->parent
->color
= MEM_BLACK
;
3164 y
->color
= MEM_BLACK
;
3165 x
->parent
->parent
->color
= MEM_RED
;
3166 x
= x
->parent
->parent
;
3170 if (x
== x
->parent
->left
)
3173 mem_rotate_right (x
);
3176 x
->parent
->color
= MEM_BLACK
;
3177 x
->parent
->parent
->color
= MEM_RED
;
3178 mem_rotate_left (x
->parent
->parent
);
3183 /* The root may have been changed to red due to the algorithm. Set
3184 it to black so that property #5 is satisfied. */
3185 mem_root
->color
= MEM_BLACK
;
3201 /* Turn y's left sub-tree into x's right sub-tree. */
3204 if (y
->left
!= MEM_NIL
)
3205 y
->left
->parent
= x
;
3207 /* Y's parent was x's parent. */
3209 y
->parent
= x
->parent
;
3211 /* Get the parent to point to y instead of x. */
3214 if (x
== x
->parent
->left
)
3215 x
->parent
->left
= y
;
3217 x
->parent
->right
= y
;
3222 /* Put x on y's left. */
3236 mem_rotate_right (x
)
3239 struct mem_node
*y
= x
->left
;
3242 if (y
->right
!= MEM_NIL
)
3243 y
->right
->parent
= x
;
3246 y
->parent
= x
->parent
;
3249 if (x
== x
->parent
->right
)
3250 x
->parent
->right
= y
;
3252 x
->parent
->left
= y
;
3263 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
3269 struct mem_node
*x
, *y
;
3271 if (!z
|| z
== MEM_NIL
)
3274 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
3279 while (y
->left
!= MEM_NIL
)
3283 if (y
->left
!= MEM_NIL
)
3288 x
->parent
= y
->parent
;
3291 if (y
== y
->parent
->left
)
3292 y
->parent
->left
= x
;
3294 y
->parent
->right
= x
;
3301 z
->start
= y
->start
;
3306 if (y
->color
== MEM_BLACK
)
3307 mem_delete_fixup (x
);
3309 #ifdef GC_MALLOC_CHECK
3317 /* Re-establish the red-black properties of the tree, after a
3321 mem_delete_fixup (x
)
3324 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
3326 if (x
== x
->parent
->left
)
3328 struct mem_node
*w
= x
->parent
->right
;
3330 if (w
->color
== MEM_RED
)
3332 w
->color
= MEM_BLACK
;
3333 x
->parent
->color
= MEM_RED
;
3334 mem_rotate_left (x
->parent
);
3335 w
= x
->parent
->right
;
3338 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
3345 if (w
->right
->color
== MEM_BLACK
)
3347 w
->left
->color
= MEM_BLACK
;
3349 mem_rotate_right (w
);
3350 w
= x
->parent
->right
;
3352 w
->color
= x
->parent
->color
;
3353 x
->parent
->color
= MEM_BLACK
;
3354 w
->right
->color
= MEM_BLACK
;
3355 mem_rotate_left (x
->parent
);
3361 struct mem_node
*w
= x
->parent
->left
;
3363 if (w
->color
== MEM_RED
)
3365 w
->color
= MEM_BLACK
;
3366 x
->parent
->color
= MEM_RED
;
3367 mem_rotate_right (x
->parent
);
3368 w
= x
->parent
->left
;
3371 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
3378 if (w
->left
->color
== MEM_BLACK
)
3380 w
->right
->color
= MEM_BLACK
;
3382 mem_rotate_left (w
);
3383 w
= x
->parent
->left
;
3386 w
->color
= x
->parent
->color
;
3387 x
->parent
->color
= MEM_BLACK
;
3388 w
->left
->color
= MEM_BLACK
;
3389 mem_rotate_right (x
->parent
);
3395 x
->color
= MEM_BLACK
;
3399 /* Value is non-zero if P is a pointer to a live Lisp string on
3400 the heap. M is a pointer to the mem_block for P. */
3403 live_string_p (m
, p
)
3407 if (m
->type
== MEM_TYPE_STRING
)
3409 struct string_block
*b
= (struct string_block
*) m
->start
;
3410 int offset
= (char *) p
- (char *) &b
->strings
[0];
3412 /* P must point to the start of a Lisp_String structure, and it
3413 must not be on the free-list. */
3415 && offset
% sizeof b
->strings
[0] == 0
3416 && ((struct Lisp_String
*) p
)->data
!= NULL
);
3423 /* Value is non-zero if P is a pointer to a live Lisp cons on
3424 the heap. M is a pointer to the mem_block for P. */
3431 if (m
->type
== MEM_TYPE_CONS
)
3433 struct cons_block
*b
= (struct cons_block
*) m
->start
;
3434 int offset
= (char *) p
- (char *) &b
->conses
[0];
3436 /* P must point to the start of a Lisp_Cons, not be
3437 one of the unused cells in the current cons block,
3438 and not be on the free-list. */
3440 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
3441 && offset
% sizeof b
->conses
[0] == 0
3443 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
3444 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
3451 /* Value is non-zero if P is a pointer to a live Lisp symbol on
3452 the heap. M is a pointer to the mem_block for P. */
3455 live_symbol_p (m
, p
)
3459 if (m
->type
== MEM_TYPE_SYMBOL
)
3461 struct symbol_block
*b
= (struct symbol_block
*) m
->start
;
3462 int offset
= (char *) p
- (char *) &b
->symbols
[0];
3464 /* P must point to the start of a Lisp_Symbol, not be
3465 one of the unused cells in the current symbol block,
3466 and not be on the free-list. */
3468 && offset
% sizeof b
->symbols
[0] == 0
3469 && (b
!= symbol_block
3470 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
3471 && !EQ (((struct Lisp_Symbol
*) p
)->function
, Vdead
));
3478 /* Value is non-zero if P is a pointer to a live Lisp float on
3479 the heap. M is a pointer to the mem_block for P. */
3486 if (m
->type
== MEM_TYPE_FLOAT
)
3488 struct float_block
*b
= (struct float_block
*) m
->start
;
3489 int offset
= (char *) p
- (char *) &b
->floats
[0];
3491 /* P must point to the start of a Lisp_Float and not be
3492 one of the unused cells in the current float block. */
3494 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
3495 && offset
% sizeof b
->floats
[0] == 0
3496 && (b
!= float_block
3497 || offset
/ sizeof b
->floats
[0] < float_block_index
));
3504 /* Value is non-zero if P is a pointer to a live Lisp Misc on
3505 the heap. M is a pointer to the mem_block for P. */
3512 if (m
->type
== MEM_TYPE_MISC
)
3514 struct marker_block
*b
= (struct marker_block
*) m
->start
;
3515 int offset
= (char *) p
- (char *) &b
->markers
[0];
3517 /* P must point to the start of a Lisp_Misc, not be
3518 one of the unused cells in the current misc block,
3519 and not be on the free-list. */
3521 && offset
% sizeof b
->markers
[0] == 0
3522 && (b
!= marker_block
3523 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
3524 && ((union Lisp_Misc
*) p
)->u_marker
.type
!= Lisp_Misc_Free
);
3531 /* Value is non-zero if P is a pointer to a live vector-like object.
3532 M is a pointer to the mem_block for P. */
3535 live_vector_p (m
, p
)
3539 return (p
== m
->start
3540 && m
->type
>= MEM_TYPE_VECTOR
3541 && m
->type
<= MEM_TYPE_WINDOW
);
3545 /* Value is non-zero if P is a pointer to a live buffer. M is a
3546 pointer to the mem_block for P. */
3549 live_buffer_p (m
, p
)
3553 /* P must point to the start of the block, and the buffer
3554 must not have been killed. */
3555 return (m
->type
== MEM_TYPE_BUFFER
3557 && !NILP (((struct buffer
*) p
)->name
));
3560 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
3564 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3566 /* Array of objects that are kept alive because the C stack contains
3567 a pattern that looks like a reference to them . */
3569 #define MAX_ZOMBIES 10
3570 static Lisp_Object zombies
[MAX_ZOMBIES
];
3572 /* Number of zombie objects. */
3574 static int nzombies
;
3576 /* Number of garbage collections. */
3580 /* Average percentage of zombies per collection. */
3582 static double avg_zombies
;
3584 /* Max. number of live and zombie objects. */
3586 static int max_live
, max_zombies
;
3588 /* Average number of live objects per GC. */
3590 static double avg_live
;
3592 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
3593 doc
: /* Show information about live and zombie objects. */)
3596 Lisp_Object args
[8], zombie_list
= Qnil
;
3598 for (i
= 0; i
< nzombies
; i
++)
3599 zombie_list
= Fcons (zombies
[i
], zombie_list
);
3600 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
3601 args
[1] = make_number (ngcs
);
3602 args
[2] = make_float (avg_live
);
3603 args
[3] = make_float (avg_zombies
);
3604 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
3605 args
[5] = make_number (max_live
);
3606 args
[6] = make_number (max_zombies
);
3607 args
[7] = zombie_list
;
3608 return Fmessage (8, args
);
3611 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
3614 /* Mark OBJ if we can prove it's a Lisp_Object. */
3617 mark_maybe_object (obj
)
3620 void *po
= (void *) XPNTR (obj
);
3621 struct mem_node
*m
= mem_find (po
);
3627 switch (XGCTYPE (obj
))
3630 mark_p
= (live_string_p (m
, po
)
3631 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
3635 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
3639 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
3643 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
3646 case Lisp_Vectorlike
:
3647 /* Note: can't check GC_BUFFERP before we know it's a
3648 buffer because checking that dereferences the pointer
3649 PO which might point anywhere. */
3650 if (live_vector_p (m
, po
))
3651 mark_p
= !GC_SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
3652 else if (live_buffer_p (m
, po
))
3653 mark_p
= GC_BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
3657 mark_p
= (live_misc_p (m
, po
) && !XMARKER (obj
)->gcmarkbit
);
3661 case Lisp_Type_Limit
:
3667 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3668 if (nzombies
< MAX_ZOMBIES
)
3669 zombies
[nzombies
] = obj
;
3678 /* If P points to Lisp data, mark that as live if it isn't already
3682 mark_maybe_pointer (p
)
3687 /* Quickly rule out some values which can't point to Lisp data. We
3688 assume that Lisp data is aligned on even addresses. */
3689 if ((EMACS_INT
) p
& 1)
3695 Lisp_Object obj
= Qnil
;
3699 case MEM_TYPE_NON_LISP
:
3700 /* Nothing to do; not a pointer to Lisp memory. */
3703 case MEM_TYPE_BUFFER
:
3704 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P((struct buffer
*)p
))
3705 XSETVECTOR (obj
, p
);
3709 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
3713 case MEM_TYPE_STRING
:
3714 if (live_string_p (m
, p
)
3715 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
3716 XSETSTRING (obj
, p
);
3720 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
3724 case MEM_TYPE_SYMBOL
:
3725 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
3726 XSETSYMBOL (obj
, p
);
3729 case MEM_TYPE_FLOAT
:
3730 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
3734 case MEM_TYPE_VECTOR
:
3735 case MEM_TYPE_PROCESS
:
3736 case MEM_TYPE_HASH_TABLE
:
3737 case MEM_TYPE_FRAME
:
3738 case MEM_TYPE_WINDOW
:
3739 if (live_vector_p (m
, p
))
3742 XSETVECTOR (tem
, p
);
3743 if (!GC_SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
3758 /* Mark Lisp objects referenced from the address range START..END. */
3761 mark_memory (start
, end
)
3767 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3771 /* Make START the pointer to the start of the memory region,
3772 if it isn't already. */
3780 /* Mark Lisp_Objects. */
3781 for (p
= (Lisp_Object
*) start
; (void *) p
< end
; ++p
)
3782 mark_maybe_object (*p
);
3784 /* Mark Lisp data pointed to. This is necessary because, in some
3785 situations, the C compiler optimizes Lisp objects away, so that
3786 only a pointer to them remains. Example:
3788 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
3791 Lisp_Object obj = build_string ("test");
3792 struct Lisp_String *s = XSTRING (obj);
3793 Fgarbage_collect ();
3794 fprintf (stderr, "test `%s'\n", s->data);
3798 Here, `obj' isn't really used, and the compiler optimizes it
3799 away. The only reference to the life string is through the
3802 for (pp
= (void **) start
; (void *) pp
< end
; ++pp
)
3803 mark_maybe_pointer (*pp
);
3806 /* setjmp will work with GCC unless NON_SAVING_SETJMP is defined in
3807 the GCC system configuration. In gcc 3.2, the only systems for
3808 which this is so are i386-sco5 non-ELF, i386-sysv3 (maybe included
3809 by others?) and ns32k-pc532-min. */
3811 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
3813 static int setjmp_tested_p
, longjmps_done
;
3815 #define SETJMP_WILL_LIKELY_WORK "\
3817 Emacs garbage collector has been changed to use conservative stack\n\
3818 marking. Emacs has determined that the method it uses to do the\n\
3819 marking will likely work on your system, but this isn't sure.\n\
3821 If you are a system-programmer, or can get the help of a local wizard\n\
3822 who is, please take a look at the function mark_stack in alloc.c, and\n\
3823 verify that the methods used are appropriate for your system.\n\
3825 Please mail the result to <emacs-devel@gnu.org>.\n\
3828 #define SETJMP_WILL_NOT_WORK "\
3830 Emacs garbage collector has been changed to use conservative stack\n\
3831 marking. Emacs has determined that the default method it uses to do the\n\
3832 marking will not work on your system. We will need a system-dependent\n\
3833 solution for your system.\n\
3835 Please take a look at the function mark_stack in alloc.c, and\n\
3836 try to find a way to make it work on your system.\n\
3838 Note that you may get false negatives, depending on the compiler.\n\
3839 In particular, you need to use -O with GCC for this test.\n\
3841 Please mail the result to <emacs-devel@gnu.org>.\n\
3845 /* Perform a quick check if it looks like setjmp saves registers in a
3846 jmp_buf. Print a message to stderr saying so. When this test
3847 succeeds, this is _not_ a proof that setjmp is sufficient for
3848 conservative stack marking. Only the sources or a disassembly
3859 /* Arrange for X to be put in a register. */
3865 if (longjmps_done
== 1)
3867 /* Came here after the longjmp at the end of the function.
3869 If x == 1, the longjmp has restored the register to its
3870 value before the setjmp, and we can hope that setjmp
3871 saves all such registers in the jmp_buf, although that
3874 For other values of X, either something really strange is
3875 taking place, or the setjmp just didn't save the register. */
3878 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
3881 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
3888 if (longjmps_done
== 1)
3892 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
3895 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
3897 /* Abort if anything GCPRO'd doesn't survive the GC. */
3905 for (p
= gcprolist
; p
; p
= p
->next
)
3906 for (i
= 0; i
< p
->nvars
; ++i
)
3907 if (!survives_gc_p (p
->var
[i
]))
3908 /* FIXME: It's not necessarily a bug. It might just be that the
3909 GCPRO is unnecessary or should release the object sooner. */
3913 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3920 fprintf (stderr
, "\nZombies kept alive = %d:\n", nzombies
);
3921 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
3923 fprintf (stderr
, " %d = ", i
);
3924 debug_print (zombies
[i
]);
3928 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
3931 /* Mark live Lisp objects on the C stack.
3933 There are several system-dependent problems to consider when
3934 porting this to new architectures:
3938 We have to mark Lisp objects in CPU registers that can hold local
3939 variables or are used to pass parameters.
3941 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
3942 something that either saves relevant registers on the stack, or
3943 calls mark_maybe_object passing it each register's contents.
3945 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
3946 implementation assumes that calling setjmp saves registers we need
3947 to see in a jmp_buf which itself lies on the stack. This doesn't
3948 have to be true! It must be verified for each system, possibly
3949 by taking a look at the source code of setjmp.
3953 Architectures differ in the way their processor stack is organized.
3954 For example, the stack might look like this
3957 | Lisp_Object | size = 4
3959 | something else | size = 2
3961 | Lisp_Object | size = 4
3965 In such a case, not every Lisp_Object will be aligned equally. To
3966 find all Lisp_Object on the stack it won't be sufficient to walk
3967 the stack in steps of 4 bytes. Instead, two passes will be
3968 necessary, one starting at the start of the stack, and a second
3969 pass starting at the start of the stack + 2. Likewise, if the
3970 minimal alignment of Lisp_Objects on the stack is 1, four passes
3971 would be necessary, each one starting with one byte more offset
3972 from the stack start.
3974 The current code assumes by default that Lisp_Objects are aligned
3975 equally on the stack. */
3982 volatile int stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
3985 /* This trick flushes the register windows so that all the state of
3986 the process is contained in the stack. */
3987 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
3988 needed on ia64 too. See mach_dep.c, where it also says inline
3989 assembler doesn't work with relevant proprietary compilers. */
3994 /* Save registers that we need to see on the stack. We need to see
3995 registers used to hold register variables and registers used to
3997 #ifdef GC_SAVE_REGISTERS_ON_STACK
3998 GC_SAVE_REGISTERS_ON_STACK (end
);
3999 #else /* not GC_SAVE_REGISTERS_ON_STACK */
4001 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
4002 setjmp will definitely work, test it
4003 and print a message with the result
4005 if (!setjmp_tested_p
)
4007 setjmp_tested_p
= 1;
4010 #endif /* GC_SETJMP_WORKS */
4013 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
4014 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
4016 /* This assumes that the stack is a contiguous region in memory. If
4017 that's not the case, something has to be done here to iterate
4018 over the stack segments. */
4019 #ifndef GC_LISP_OBJECT_ALIGNMENT
4021 #define GC_LISP_OBJECT_ALIGNMENT __alignof__ (Lisp_Object)
4023 #define GC_LISP_OBJECT_ALIGNMENT sizeof (Lisp_Object)
4026 for (i
= 0; i
< sizeof (Lisp_Object
); i
+= GC_LISP_OBJECT_ALIGNMENT
)
4027 mark_memory ((char *) stack_base
+ i
, end
);
4029 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4035 #endif /* GC_MARK_STACK != 0 */
4039 /***********************************************************************
4040 Pure Storage Management
4041 ***********************************************************************/
4043 /* Allocate room for SIZE bytes from pure Lisp storage and return a
4044 pointer to it. TYPE is the Lisp type for which the memory is
4045 allocated. TYPE < 0 means it's not used for a Lisp object.
4047 If store_pure_type_info is set and TYPE is >= 0, the type of
4048 the allocated object is recorded in pure_types. */
4050 static POINTER_TYPE
*
4051 pure_alloc (size
, type
)
4055 POINTER_TYPE
*result
;
4056 size_t alignment
= sizeof (EMACS_INT
);
4058 /* Give Lisp_Floats an extra alignment. */
4059 if (type
== Lisp_Float
)
4061 #if defined __GNUC__ && __GNUC__ >= 2
4062 alignment
= __alignof (struct Lisp_Float
);
4064 alignment
= sizeof (struct Lisp_Float
);
4069 result
= ALIGN (purebeg
+ pure_bytes_used
, alignment
);
4070 pure_bytes_used
= ((char *)result
- (char *)purebeg
) + size
;
4072 if (pure_bytes_used
<= pure_size
)
4075 /* Don't allocate a large amount here,
4076 because it might get mmap'd and then its address
4077 might not be usable. */
4078 purebeg
= (char *) xmalloc (10000);
4080 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
4081 pure_bytes_used
= 0;
4086 /* Print a warning if PURESIZE is too small. */
4091 if (pure_bytes_used_before_overflow
)
4092 message ("Pure Lisp storage overflow (approx. %d bytes needed)",
4093 (int) (pure_bytes_used
+ pure_bytes_used_before_overflow
));
4097 /* Return a string allocated in pure space. DATA is a buffer holding
4098 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
4099 non-zero means make the result string multibyte.
4101 Must get an error if pure storage is full, since if it cannot hold
4102 a large string it may be able to hold conses that point to that
4103 string; then the string is not protected from gc. */
4106 make_pure_string (data
, nchars
, nbytes
, multibyte
)
4112 struct Lisp_String
*s
;
4114 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4115 s
->data
= (unsigned char *) pure_alloc (nbytes
+ 1, -1);
4117 s
->size_byte
= multibyte
? nbytes
: -1;
4118 bcopy (data
, s
->data
, nbytes
);
4119 s
->data
[nbytes
] = '\0';
4120 s
->intervals
= NULL_INTERVAL
;
4121 XSETSTRING (string
, s
);
4126 /* Return a cons allocated from pure space. Give it pure copies
4127 of CAR as car and CDR as cdr. */
4130 pure_cons (car
, cdr
)
4131 Lisp_Object car
, cdr
;
4133 register Lisp_Object
new;
4134 struct Lisp_Cons
*p
;
4136 p
= (struct Lisp_Cons
*) pure_alloc (sizeof *p
, Lisp_Cons
);
4138 XSETCAR (new, Fpurecopy (car
));
4139 XSETCDR (new, Fpurecopy (cdr
));
4144 /* Value is a float object with value NUM allocated from pure space. */
4147 make_pure_float (num
)
4150 register Lisp_Object
new;
4151 struct Lisp_Float
*p
;
4153 p
= (struct Lisp_Float
*) pure_alloc (sizeof *p
, Lisp_Float
);
4155 XFLOAT_DATA (new) = num
;
4160 /* Return a vector with room for LEN Lisp_Objects allocated from
4164 make_pure_vector (len
)
4168 struct Lisp_Vector
*p
;
4169 size_t size
= sizeof *p
+ (len
- 1) * sizeof (Lisp_Object
);
4171 p
= (struct Lisp_Vector
*) pure_alloc (size
, Lisp_Vectorlike
);
4172 XSETVECTOR (new, p
);
4173 XVECTOR (new)->size
= len
;
4178 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
4179 doc
: /* Make a copy of OBJECT in pure storage.
4180 Recursively copies contents of vectors and cons cells.
4181 Does not copy symbols. Copies strings without text properties. */)
4183 register Lisp_Object obj
;
4185 if (NILP (Vpurify_flag
))
4188 if (PURE_POINTER_P (XPNTR (obj
)))
4192 return pure_cons (XCAR (obj
), XCDR (obj
));
4193 else if (FLOATP (obj
))
4194 return make_pure_float (XFLOAT_DATA (obj
));
4195 else if (STRINGP (obj
))
4196 return make_pure_string (SDATA (obj
), SCHARS (obj
),
4198 STRING_MULTIBYTE (obj
));
4199 else if (COMPILEDP (obj
) || VECTORP (obj
))
4201 register struct Lisp_Vector
*vec
;
4202 register int i
, size
;
4204 size
= XVECTOR (obj
)->size
;
4205 if (size
& PSEUDOVECTOR_FLAG
)
4206 size
&= PSEUDOVECTOR_SIZE_MASK
;
4207 vec
= XVECTOR (make_pure_vector ((EMACS_INT
) size
));
4208 for (i
= 0; i
< size
; i
++)
4209 vec
->contents
[i
] = Fpurecopy (XVECTOR (obj
)->contents
[i
]);
4210 if (COMPILEDP (obj
))
4211 XSETCOMPILED (obj
, vec
);
4213 XSETVECTOR (obj
, vec
);
4216 else if (MARKERP (obj
))
4217 error ("Attempt to copy a marker to pure storage");
4224 /***********************************************************************
4226 ***********************************************************************/
4228 /* Put an entry in staticvec, pointing at the variable with address
4232 staticpro (varaddress
)
4233 Lisp_Object
*varaddress
;
4235 staticvec
[staticidx
++] = varaddress
;
4236 if (staticidx
>= NSTATICS
)
4244 struct catchtag
*next
;
4249 struct backtrace
*next
;
4250 Lisp_Object
*function
;
4251 Lisp_Object
*args
; /* Points to vector of args. */
4252 int nargs
; /* Length of vector. */
4253 /* If nargs is UNEVALLED, args points to slot holding list of
4260 /***********************************************************************
4262 ***********************************************************************/
4264 /* Temporarily prevent garbage collection. */
4267 inhibit_garbage_collection ()
4269 int count
= SPECPDL_INDEX ();
4270 int nbits
= min (VALBITS
, BITS_PER_INT
);
4272 specbind (Qgc_cons_threshold
, make_number (((EMACS_INT
) 1 << (nbits
- 1)) - 1));
4277 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
4278 doc
: /* Reclaim storage for Lisp objects no longer needed.
4279 Garbage collection happens automatically if you cons more than
4280 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
4281 `garbage-collect' normally returns a list with info on amount of space in use:
4282 ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)
4283 (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS
4284 (USED-FLOATS . FREE-FLOATS) (USED-INTERVALS . FREE-INTERVALS)
4285 (USED-STRINGS . FREE-STRINGS))
4286 However, if there was overflow in pure space, `garbage-collect'
4287 returns nil, because real GC can't be done. */)
4290 register struct specbinding
*bind
;
4291 struct catchtag
*catch;
4292 struct handler
*handler
;
4293 register struct backtrace
*backlist
;
4294 char stack_top_variable
;
4297 Lisp_Object total
[8];
4298 int count
= SPECPDL_INDEX ();
4299 EMACS_TIME t1
, t2
, t3
;
4304 EMACS_GET_TIME (t1
);
4306 /* Can't GC if pure storage overflowed because we can't determine
4307 if something is a pure object or not. */
4308 if (pure_bytes_used_before_overflow
)
4311 /* In case user calls debug_print during GC,
4312 don't let that cause a recursive GC. */
4313 consing_since_gc
= 0;
4315 /* Save what's currently displayed in the echo area. */
4316 message_p
= push_message ();
4317 record_unwind_protect (pop_message_unwind
, Qnil
);
4319 /* Save a copy of the contents of the stack, for debugging. */
4320 #if MAX_SAVE_STACK > 0
4321 if (NILP (Vpurify_flag
))
4323 i
= &stack_top_variable
- stack_bottom
;
4325 if (i
< MAX_SAVE_STACK
)
4327 if (stack_copy
== 0)
4328 stack_copy
= (char *) xmalloc (stack_copy_size
= i
);
4329 else if (stack_copy_size
< i
)
4330 stack_copy
= (char *) xrealloc (stack_copy
, (stack_copy_size
= i
));
4333 if ((EMACS_INT
) (&stack_top_variable
- stack_bottom
) > 0)
4334 bcopy (stack_bottom
, stack_copy
, i
);
4336 bcopy (&stack_top_variable
, stack_copy
, i
);
4340 #endif /* MAX_SAVE_STACK > 0 */
4342 if (garbage_collection_messages
)
4343 message1_nolog ("Garbage collecting...");
4347 shrink_regexp_cache ();
4349 /* Don't keep undo information around forever. */
4351 register struct buffer
*nextb
= all_buffers
;
4355 /* If a buffer's undo list is Qt, that means that undo is
4356 turned off in that buffer. Calling truncate_undo_list on
4357 Qt tends to return NULL, which effectively turns undo back on.
4358 So don't call truncate_undo_list if undo_list is Qt. */
4359 if (! EQ (nextb
->undo_list
, Qt
))
4361 = truncate_undo_list (nextb
->undo_list
, undo_limit
,
4364 /* Shrink buffer gaps, but skip indirect and dead buffers. */
4365 if (nextb
->base_buffer
== 0 && !NILP (nextb
->name
))
4367 /* If a buffer's gap size is more than 10% of the buffer
4368 size, or larger than 2000 bytes, then shrink it
4369 accordingly. Keep a minimum size of 20 bytes. */
4370 int size
= min (2000, max (20, (nextb
->text
->z_byte
/ 10)));
4372 if (nextb
->text
->gap_size
> size
)
4374 struct buffer
*save_current
= current_buffer
;
4375 current_buffer
= nextb
;
4376 make_gap (-(nextb
->text
->gap_size
- size
));
4377 current_buffer
= save_current
;
4381 nextb
= nextb
->next
;
4387 /* clear_marks (); */
4389 /* Mark all the special slots that serve as the roots of accessibility. */
4391 for (i
= 0; i
< staticidx
; i
++)
4392 mark_object (*staticvec
[i
]);
4394 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
4395 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
4399 register struct gcpro
*tail
;
4400 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
4401 for (i
= 0; i
< tail
->nvars
; i
++)
4402 mark_object (tail
->var
[i
]);
4407 for (bind
= specpdl
; bind
!= specpdl_ptr
; bind
++)
4409 mark_object (bind
->symbol
);
4410 mark_object (bind
->old_value
);
4412 for (catch = catchlist
; catch; catch = catch->next
)
4414 mark_object (catch->tag
);
4415 mark_object (catch->val
);
4417 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
4419 mark_object (handler
->handler
);
4420 mark_object (handler
->var
);
4422 for (backlist
= backtrace_list
; backlist
; backlist
= backlist
->next
)
4424 mark_object (*backlist
->function
);
4426 if (backlist
->nargs
== UNEVALLED
|| backlist
->nargs
== MANY
)
4429 i
= backlist
->nargs
- 1;
4431 mark_object (backlist
->args
[i
]);
4435 /* Look thru every buffer's undo list
4436 for elements that update markers that were not marked,
4439 register struct buffer
*nextb
= all_buffers
;
4443 /* If a buffer's undo list is Qt, that means that undo is
4444 turned off in that buffer. Calling truncate_undo_list on
4445 Qt tends to return NULL, which effectively turns undo back on.
4446 So don't call truncate_undo_list if undo_list is Qt. */
4447 if (! EQ (nextb
->undo_list
, Qt
))
4449 Lisp_Object tail
, prev
;
4450 tail
= nextb
->undo_list
;
4452 while (CONSP (tail
))
4454 if (GC_CONSP (XCAR (tail
))
4455 && GC_MARKERP (XCAR (XCAR (tail
)))
4456 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
4459 nextb
->undo_list
= tail
= XCDR (tail
);
4463 XSETCDR (prev
, tail
);
4474 nextb
= nextb
->next
;
4478 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4484 extern void xg_mark_data ();
4491 /* Clear the mark bits that we set in certain root slots. */
4493 #if (GC_MARK_STACK == GC_USE_GCPROS_AS_BEFORE \
4494 || GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES)
4496 register struct gcpro
*tail
;
4500 unmark_byte_stack ();
4501 VECTOR_UNMARK (&buffer_defaults
);
4502 VECTOR_UNMARK (&buffer_local_symbols
);
4504 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
4510 /* clear_marks (); */
4513 consing_since_gc
= 0;
4514 if (gc_cons_threshold
< 10000)
4515 gc_cons_threshold
= 10000;
4517 if (garbage_collection_messages
)
4519 if (message_p
|| minibuf_level
> 0)
4522 message1_nolog ("Garbage collecting...done");
4525 unbind_to (count
, Qnil
);
4527 total
[0] = Fcons (make_number (total_conses
),
4528 make_number (total_free_conses
));
4529 total
[1] = Fcons (make_number (total_symbols
),
4530 make_number (total_free_symbols
));
4531 total
[2] = Fcons (make_number (total_markers
),
4532 make_number (total_free_markers
));
4533 total
[3] = make_number (total_string_size
);
4534 total
[4] = make_number (total_vector_size
);
4535 total
[5] = Fcons (make_number (total_floats
),
4536 make_number (total_free_floats
));
4537 total
[6] = Fcons (make_number (total_intervals
),
4538 make_number (total_free_intervals
));
4539 total
[7] = Fcons (make_number (total_strings
),
4540 make_number (total_free_strings
));
4542 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4544 /* Compute average percentage of zombies. */
4547 for (i
= 0; i
< 7; ++i
)
4548 if (CONSP (total
[i
]))
4549 nlive
+= XFASTINT (XCAR (total
[i
]));
4551 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
4552 max_live
= max (nlive
, max_live
);
4553 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
4554 max_zombies
= max (nzombies
, max_zombies
);
4559 if (!NILP (Vpost_gc_hook
))
4561 int count
= inhibit_garbage_collection ();
4562 safe_run_hooks (Qpost_gc_hook
);
4563 unbind_to (count
, Qnil
);
4566 /* Accumulate statistics. */
4567 EMACS_GET_TIME (t2
);
4568 EMACS_SUB_TIME (t3
, t2
, t1
);
4569 if (FLOATP (Vgc_elapsed
))
4570 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
) +
4572 EMACS_USECS (t3
) * 1.0e-6);
4575 return Flist (sizeof total
/ sizeof *total
, total
);
4579 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
4580 only interesting objects referenced from glyphs are strings. */
4583 mark_glyph_matrix (matrix
)
4584 struct glyph_matrix
*matrix
;
4586 struct glyph_row
*row
= matrix
->rows
;
4587 struct glyph_row
*end
= row
+ matrix
->nrows
;
4589 for (; row
< end
; ++row
)
4593 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
4595 struct glyph
*glyph
= row
->glyphs
[area
];
4596 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
4598 for (; glyph
< end_glyph
; ++glyph
)
4599 if (GC_STRINGP (glyph
->object
)
4600 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
4601 mark_object (glyph
->object
);
4607 /* Mark Lisp faces in the face cache C. */
4611 struct face_cache
*c
;
4616 for (i
= 0; i
< c
->used
; ++i
)
4618 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
4622 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
4623 mark_object (face
->lface
[j
]);
4630 #ifdef HAVE_WINDOW_SYSTEM
4632 /* Mark Lisp objects in image IMG. */
4638 mark_object (img
->spec
);
4640 if (!NILP (img
->data
.lisp_val
))
4641 mark_object (img
->data
.lisp_val
);
4645 /* Mark Lisp objects in image cache of frame F. It's done this way so
4646 that we don't have to include xterm.h here. */
4649 mark_image_cache (f
)
4652 forall_images_in_image_cache (f
, mark_image
);
4655 #endif /* HAVE_X_WINDOWS */
4659 /* Mark reference to a Lisp_Object.
4660 If the object referred to has not been seen yet, recursively mark
4661 all the references contained in it. */
4663 #define LAST_MARKED_SIZE 500
4664 Lisp_Object last_marked
[LAST_MARKED_SIZE
];
4665 int last_marked_index
;
4667 /* For debugging--call abort when we cdr down this many
4668 links of a list, in mark_object. In debugging,
4669 the call to abort will hit a breakpoint.
4670 Normally this is zero and the check never goes off. */
4671 int mark_object_loop_halt
;
4677 register Lisp_Object obj
= arg
;
4678 #ifdef GC_CHECK_MARKED_OBJECTS
4686 if (PURE_POINTER_P (XPNTR (obj
)))
4689 last_marked
[last_marked_index
++] = obj
;
4690 if (last_marked_index
== LAST_MARKED_SIZE
)
4691 last_marked_index
= 0;
4693 /* Perform some sanity checks on the objects marked here. Abort if
4694 we encounter an object we know is bogus. This increases GC time
4695 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
4696 #ifdef GC_CHECK_MARKED_OBJECTS
4698 po
= (void *) XPNTR (obj
);
4700 /* Check that the object pointed to by PO is known to be a Lisp
4701 structure allocated from the heap. */
4702 #define CHECK_ALLOCATED() \
4704 m = mem_find (po); \
4709 /* Check that the object pointed to by PO is live, using predicate
4711 #define CHECK_LIVE(LIVEP) \
4713 if (!LIVEP (m, po)) \
4717 /* Check both of the above conditions. */
4718 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
4720 CHECK_ALLOCATED (); \
4721 CHECK_LIVE (LIVEP); \
4724 #else /* not GC_CHECK_MARKED_OBJECTS */
4726 #define CHECK_ALLOCATED() (void) 0
4727 #define CHECK_LIVE(LIVEP) (void) 0
4728 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
4730 #endif /* not GC_CHECK_MARKED_OBJECTS */
4732 switch (SWITCH_ENUM_CAST (XGCTYPE (obj
)))
4736 register struct Lisp_String
*ptr
= XSTRING (obj
);
4737 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
4738 MARK_INTERVAL_TREE (ptr
->intervals
);
4740 #ifdef GC_CHECK_STRING_BYTES
4741 /* Check that the string size recorded in the string is the
4742 same as the one recorded in the sdata structure. */
4743 CHECK_STRING_BYTES (ptr
);
4744 #endif /* GC_CHECK_STRING_BYTES */
4748 case Lisp_Vectorlike
:
4749 #ifdef GC_CHECK_MARKED_OBJECTS
4751 if (m
== MEM_NIL
&& !GC_SUBRP (obj
)
4752 && po
!= &buffer_defaults
4753 && po
!= &buffer_local_symbols
)
4755 #endif /* GC_CHECK_MARKED_OBJECTS */
4757 if (GC_BUFFERP (obj
))
4759 if (!VECTOR_MARKED_P (XBUFFER (obj
)))
4761 #ifdef GC_CHECK_MARKED_OBJECTS
4762 if (po
!= &buffer_defaults
&& po
!= &buffer_local_symbols
)
4765 for (b
= all_buffers
; b
&& b
!= po
; b
= b
->next
)
4770 #endif /* GC_CHECK_MARKED_OBJECTS */
4774 else if (GC_SUBRP (obj
))
4776 else if (GC_COMPILEDP (obj
))
4777 /* We could treat this just like a vector, but it is better to
4778 save the COMPILED_CONSTANTS element for last and avoid
4781 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
4782 register EMACS_INT size
= ptr
->size
;
4785 if (VECTOR_MARKED_P (ptr
))
4786 break; /* Already marked */
4788 CHECK_LIVE (live_vector_p
);
4789 VECTOR_MARK (ptr
); /* Else mark it */
4790 size
&= PSEUDOVECTOR_SIZE_MASK
;
4791 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
4793 if (i
!= COMPILED_CONSTANTS
)
4794 mark_object (ptr
->contents
[i
]);
4796 obj
= ptr
->contents
[COMPILED_CONSTANTS
];
4799 else if (GC_FRAMEP (obj
))
4801 register struct frame
*ptr
= XFRAME (obj
);
4803 if (VECTOR_MARKED_P (ptr
)) break; /* Already marked */
4804 VECTOR_MARK (ptr
); /* Else mark it */
4806 CHECK_LIVE (live_vector_p
);
4807 mark_object (ptr
->name
);
4808 mark_object (ptr
->icon_name
);
4809 mark_object (ptr
->title
);
4810 mark_object (ptr
->focus_frame
);
4811 mark_object (ptr
->selected_window
);
4812 mark_object (ptr
->minibuffer_window
);
4813 mark_object (ptr
->param_alist
);
4814 mark_object (ptr
->scroll_bars
);
4815 mark_object (ptr
->condemned_scroll_bars
);
4816 mark_object (ptr
->menu_bar_items
);
4817 mark_object (ptr
->face_alist
);
4818 mark_object (ptr
->menu_bar_vector
);
4819 mark_object (ptr
->buffer_predicate
);
4820 mark_object (ptr
->buffer_list
);
4821 mark_object (ptr
->menu_bar_window
);
4822 mark_object (ptr
->tool_bar_window
);
4823 mark_face_cache (ptr
->face_cache
);
4824 #ifdef HAVE_WINDOW_SYSTEM
4825 mark_image_cache (ptr
);
4826 mark_object (ptr
->tool_bar_items
);
4827 mark_object (ptr
->desired_tool_bar_string
);
4828 mark_object (ptr
->current_tool_bar_string
);
4829 #endif /* HAVE_WINDOW_SYSTEM */
4831 else if (GC_BOOL_VECTOR_P (obj
))
4833 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
4835 if (VECTOR_MARKED_P (ptr
))
4836 break; /* Already marked */
4837 CHECK_LIVE (live_vector_p
);
4838 VECTOR_MARK (ptr
); /* Else mark it */
4840 else if (GC_WINDOWP (obj
))
4842 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
4843 struct window
*w
= XWINDOW (obj
);
4846 /* Stop if already marked. */
4847 if (VECTOR_MARKED_P (ptr
))
4851 CHECK_LIVE (live_vector_p
);
4854 /* There is no Lisp data above The member CURRENT_MATRIX in
4855 struct WINDOW. Stop marking when that slot is reached. */
4857 (char *) &ptr
->contents
[i
] < (char *) &w
->current_matrix
;
4859 mark_object (ptr
->contents
[i
]);
4861 /* Mark glyphs for leaf windows. Marking window matrices is
4862 sufficient because frame matrices use the same glyph
4864 if (NILP (w
->hchild
)
4866 && w
->current_matrix
)
4868 mark_glyph_matrix (w
->current_matrix
);
4869 mark_glyph_matrix (w
->desired_matrix
);
4872 else if (GC_HASH_TABLE_P (obj
))
4874 struct Lisp_Hash_Table
*h
= XHASH_TABLE (obj
);
4876 /* Stop if already marked. */
4877 if (VECTOR_MARKED_P (h
))
4881 CHECK_LIVE (live_vector_p
);
4884 /* Mark contents. */
4885 /* Do not mark next_free or next_weak.
4886 Being in the next_weak chain
4887 should not keep the hash table alive.
4888 No need to mark `count' since it is an integer. */
4889 mark_object (h
->test
);
4890 mark_object (h
->weak
);
4891 mark_object (h
->rehash_size
);
4892 mark_object (h
->rehash_threshold
);
4893 mark_object (h
->hash
);
4894 mark_object (h
->next
);
4895 mark_object (h
->index
);
4896 mark_object (h
->user_hash_function
);
4897 mark_object (h
->user_cmp_function
);
4899 /* If hash table is not weak, mark all keys and values.
4900 For weak tables, mark only the vector. */
4901 if (GC_NILP (h
->weak
))
4902 mark_object (h
->key_and_value
);
4904 VECTOR_MARK (XVECTOR (h
->key_and_value
));
4908 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
4909 register EMACS_INT size
= ptr
->size
;
4912 if (VECTOR_MARKED_P (ptr
)) break; /* Already marked */
4913 CHECK_LIVE (live_vector_p
);
4914 VECTOR_MARK (ptr
); /* Else mark it */
4915 if (size
& PSEUDOVECTOR_FLAG
)
4916 size
&= PSEUDOVECTOR_SIZE_MASK
;
4918 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
4919 mark_object (ptr
->contents
[i
]);
4925 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
4926 struct Lisp_Symbol
*ptrx
;
4928 if (ptr
->gcmarkbit
) break;
4929 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
4931 mark_object (ptr
->value
);
4932 mark_object (ptr
->function
);
4933 mark_object (ptr
->plist
);
4935 if (!PURE_POINTER_P (XSTRING (ptr
->xname
)))
4936 MARK_STRING (XSTRING (ptr
->xname
));
4937 MARK_INTERVAL_TREE (STRING_INTERVALS (ptr
->xname
));
4939 /* Note that we do not mark the obarray of the symbol.
4940 It is safe not to do so because nothing accesses that
4941 slot except to check whether it is nil. */
4945 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun */
4946 XSETSYMBOL (obj
, ptrx
);
4953 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
4954 if (XMARKER (obj
)->gcmarkbit
)
4956 XMARKER (obj
)->gcmarkbit
= 1;
4957 switch (XMISCTYPE (obj
))
4959 case Lisp_Misc_Buffer_Local_Value
:
4960 case Lisp_Misc_Some_Buffer_Local_Value
:
4962 register struct Lisp_Buffer_Local_Value
*ptr
4963 = XBUFFER_LOCAL_VALUE (obj
);
4964 /* If the cdr is nil, avoid recursion for the car. */
4965 if (EQ (ptr
->cdr
, Qnil
))
4967 obj
= ptr
->realvalue
;
4970 mark_object (ptr
->realvalue
);
4971 mark_object (ptr
->buffer
);
4972 mark_object (ptr
->frame
);
4977 case Lisp_Misc_Marker
:
4978 /* DO NOT mark thru the marker's chain.
4979 The buffer's markers chain does not preserve markers from gc;
4980 instead, markers are removed from the chain when freed by gc. */
4981 case Lisp_Misc_Intfwd
:
4982 case Lisp_Misc_Boolfwd
:
4983 case Lisp_Misc_Objfwd
:
4984 case Lisp_Misc_Buffer_Objfwd
:
4985 case Lisp_Misc_Kboard_Objfwd
:
4986 /* Don't bother with Lisp_Buffer_Objfwd,
4987 since all markable slots in current buffer marked anyway. */
4988 /* Don't need to do Lisp_Objfwd, since the places they point
4989 are protected with staticpro. */
4990 case Lisp_Misc_Save_Value
:
4993 case Lisp_Misc_Overlay
:
4995 struct Lisp_Overlay
*ptr
= XOVERLAY (obj
);
4996 mark_object (ptr
->start
);
4997 mark_object (ptr
->end
);
4998 mark_object (ptr
->plist
);
5001 XSETMISC (obj
, ptr
->next
);
5014 register struct Lisp_Cons
*ptr
= XCONS (obj
);
5015 if (CONS_MARKED_P (ptr
)) break;
5016 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
5018 /* If the cdr is nil, avoid recursion for the car. */
5019 if (EQ (ptr
->cdr
, Qnil
))
5025 mark_object (ptr
->car
);
5028 if (cdr_count
== mark_object_loop_halt
)
5034 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
5035 FLOAT_MARK (XFLOAT (obj
));
5046 #undef CHECK_ALLOCATED
5047 #undef CHECK_ALLOCATED_AND_LIVE
5050 /* Mark the pointers in a buffer structure. */
5056 register struct buffer
*buffer
= XBUFFER (buf
);
5057 register Lisp_Object
*ptr
, tmp
;
5058 Lisp_Object base_buffer
;
5060 VECTOR_MARK (buffer
);
5062 MARK_INTERVAL_TREE (BUF_INTERVALS (buffer
));
5064 if (CONSP (buffer
->undo_list
))
5067 tail
= buffer
->undo_list
;
5069 /* We mark the undo list specially because
5070 its pointers to markers should be weak. */
5072 while (CONSP (tail
))
5074 register struct Lisp_Cons
*ptr
= XCONS (tail
);
5076 if (CONS_MARKED_P (ptr
))
5079 if (GC_CONSP (ptr
->car
)
5080 && !CONS_MARKED_P (XCONS (ptr
->car
))
5081 && GC_MARKERP (XCAR (ptr
->car
)))
5083 CONS_MARK (XCONS (ptr
->car
));
5084 mark_object (XCDR (ptr
->car
));
5087 mark_object (ptr
->car
);
5089 if (CONSP (ptr
->cdr
))
5095 mark_object (XCDR (tail
));
5098 mark_object (buffer
->undo_list
);
5100 if (buffer
->overlays_before
)
5102 XSETMISC (tmp
, buffer
->overlays_before
);
5105 if (buffer
->overlays_after
)
5107 XSETMISC (tmp
, buffer
->overlays_after
);
5111 for (ptr
= &buffer
->name
;
5112 (char *)ptr
< (char *)buffer
+ sizeof (struct buffer
);
5116 /* If this is an indirect buffer, mark its base buffer. */
5117 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
5119 XSETBUFFER (base_buffer
, buffer
->base_buffer
);
5120 mark_buffer (base_buffer
);
5125 /* Value is non-zero if OBJ will survive the current GC because it's
5126 either marked or does not need to be marked to survive. */
5134 switch (XGCTYPE (obj
))
5141 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
5145 survives_p
= XMARKER (obj
)->gcmarkbit
;
5149 survives_p
= STRING_MARKED_P (XSTRING (obj
));
5152 case Lisp_Vectorlike
:
5153 survives_p
= GC_SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
5157 survives_p
= CONS_MARKED_P (XCONS (obj
));
5161 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
5168 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
5173 /* Sweep: find all structures not marked, and free them. */
5178 /* Remove or mark entries in weak hash tables.
5179 This must be done before any object is unmarked. */
5180 sweep_weak_hash_tables ();
5183 #ifdef GC_CHECK_STRING_BYTES
5184 if (!noninteractive
)
5185 check_string_bytes (1);
5188 /* Put all unmarked conses on free list */
5190 register struct cons_block
*cblk
;
5191 struct cons_block
**cprev
= &cons_block
;
5192 register int lim
= cons_block_index
;
5193 register int num_free
= 0, num_used
= 0;
5197 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
5201 for (i
= 0; i
< lim
; i
++)
5202 if (!CONS_MARKED_P (&cblk
->conses
[i
]))
5205 *(struct Lisp_Cons
**)&cblk
->conses
[i
].cdr
= cons_free_list
;
5206 cons_free_list
= &cblk
->conses
[i
];
5208 cons_free_list
->car
= Vdead
;
5214 CONS_UNMARK (&cblk
->conses
[i
]);
5216 lim
= CONS_BLOCK_SIZE
;
5217 /* If this block contains only free conses and we have already
5218 seen more than two blocks worth of free conses then deallocate
5220 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
5222 *cprev
= cblk
->next
;
5223 /* Unhook from the free list. */
5224 cons_free_list
= *(struct Lisp_Cons
**) &cblk
->conses
[0].cdr
;
5225 lisp_align_free (cblk
);
5230 num_free
+= this_free
;
5231 cprev
= &cblk
->next
;
5234 total_conses
= num_used
;
5235 total_free_conses
= num_free
;
5238 /* Put all unmarked floats on free list */
5240 register struct float_block
*fblk
;
5241 struct float_block
**fprev
= &float_block
;
5242 register int lim
= float_block_index
;
5243 register int num_free
= 0, num_used
= 0;
5245 float_free_list
= 0;
5247 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
5251 for (i
= 0; i
< lim
; i
++)
5252 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
5255 *(struct Lisp_Float
**)&fblk
->floats
[i
].data
= float_free_list
;
5256 float_free_list
= &fblk
->floats
[i
];
5261 FLOAT_UNMARK (&fblk
->floats
[i
]);
5263 lim
= FLOAT_BLOCK_SIZE
;
5264 /* If this block contains only free floats and we have already
5265 seen more than two blocks worth of free floats then deallocate
5267 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
5269 *fprev
= fblk
->next
;
5270 /* Unhook from the free list. */
5271 float_free_list
= *(struct Lisp_Float
**) &fblk
->floats
[0].data
;
5272 lisp_align_free (fblk
);
5277 num_free
+= this_free
;
5278 fprev
= &fblk
->next
;
5281 total_floats
= num_used
;
5282 total_free_floats
= num_free
;
5285 /* Put all unmarked intervals on free list */
5287 register struct interval_block
*iblk
;
5288 struct interval_block
**iprev
= &interval_block
;
5289 register int lim
= interval_block_index
;
5290 register int num_free
= 0, num_used
= 0;
5292 interval_free_list
= 0;
5294 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
5299 for (i
= 0; i
< lim
; i
++)
5301 if (!iblk
->intervals
[i
].gcmarkbit
)
5303 SET_INTERVAL_PARENT (&iblk
->intervals
[i
], interval_free_list
);
5304 interval_free_list
= &iblk
->intervals
[i
];
5310 iblk
->intervals
[i
].gcmarkbit
= 0;
5313 lim
= INTERVAL_BLOCK_SIZE
;
5314 /* If this block contains only free intervals and we have already
5315 seen more than two blocks worth of free intervals then
5316 deallocate this block. */
5317 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
5319 *iprev
= iblk
->next
;
5320 /* Unhook from the free list. */
5321 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
5323 n_interval_blocks
--;
5327 num_free
+= this_free
;
5328 iprev
= &iblk
->next
;
5331 total_intervals
= num_used
;
5332 total_free_intervals
= num_free
;
5335 /* Put all unmarked symbols on free list */
5337 register struct symbol_block
*sblk
;
5338 struct symbol_block
**sprev
= &symbol_block
;
5339 register int lim
= symbol_block_index
;
5340 register int num_free
= 0, num_used
= 0;
5342 symbol_free_list
= NULL
;
5344 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
5347 struct Lisp_Symbol
*sym
= sblk
->symbols
;
5348 struct Lisp_Symbol
*end
= sym
+ lim
;
5350 for (; sym
< end
; ++sym
)
5352 /* Check if the symbol was created during loadup. In such a case
5353 it might be pointed to by pure bytecode which we don't trace,
5354 so we conservatively assume that it is live. */
5355 int pure_p
= PURE_POINTER_P (XSTRING (sym
->xname
));
5357 if (!sym
->gcmarkbit
&& !pure_p
)
5359 *(struct Lisp_Symbol
**) &sym
->value
= symbol_free_list
;
5360 symbol_free_list
= sym
;
5362 symbol_free_list
->function
= Vdead
;
5370 UNMARK_STRING (XSTRING (sym
->xname
));
5375 lim
= SYMBOL_BLOCK_SIZE
;
5376 /* If this block contains only free symbols and we have already
5377 seen more than two blocks worth of free symbols then deallocate
5379 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
5381 *sprev
= sblk
->next
;
5382 /* Unhook from the free list. */
5383 symbol_free_list
= *(struct Lisp_Symbol
**)&sblk
->symbols
[0].value
;
5389 num_free
+= this_free
;
5390 sprev
= &sblk
->next
;
5393 total_symbols
= num_used
;
5394 total_free_symbols
= num_free
;
5397 /* Put all unmarked misc's on free list.
5398 For a marker, first unchain it from the buffer it points into. */
5400 register struct marker_block
*mblk
;
5401 struct marker_block
**mprev
= &marker_block
;
5402 register int lim
= marker_block_index
;
5403 register int num_free
= 0, num_used
= 0;
5405 marker_free_list
= 0;
5407 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
5412 for (i
= 0; i
< lim
; i
++)
5414 if (!mblk
->markers
[i
].u_marker
.gcmarkbit
)
5416 if (mblk
->markers
[i
].u_marker
.type
== Lisp_Misc_Marker
)
5417 unchain_marker (&mblk
->markers
[i
].u_marker
);
5418 /* Set the type of the freed object to Lisp_Misc_Free.
5419 We could leave the type alone, since nobody checks it,
5420 but this might catch bugs faster. */
5421 mblk
->markers
[i
].u_marker
.type
= Lisp_Misc_Free
;
5422 mblk
->markers
[i
].u_free
.chain
= marker_free_list
;
5423 marker_free_list
= &mblk
->markers
[i
];
5429 mblk
->markers
[i
].u_marker
.gcmarkbit
= 0;
5432 lim
= MARKER_BLOCK_SIZE
;
5433 /* If this block contains only free markers and we have already
5434 seen more than two blocks worth of free markers then deallocate
5436 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
5438 *mprev
= mblk
->next
;
5439 /* Unhook from the free list. */
5440 marker_free_list
= mblk
->markers
[0].u_free
.chain
;
5446 num_free
+= this_free
;
5447 mprev
= &mblk
->next
;
5451 total_markers
= num_used
;
5452 total_free_markers
= num_free
;
5455 /* Free all unmarked buffers */
5457 register struct buffer
*buffer
= all_buffers
, *prev
= 0, *next
;
5460 if (!VECTOR_MARKED_P (buffer
))
5463 prev
->next
= buffer
->next
;
5465 all_buffers
= buffer
->next
;
5466 next
= buffer
->next
;
5472 VECTOR_UNMARK (buffer
);
5473 UNMARK_BALANCE_INTERVALS (BUF_INTERVALS (buffer
));
5474 prev
= buffer
, buffer
= buffer
->next
;
5478 /* Free all unmarked vectors */
5480 register struct Lisp_Vector
*vector
= all_vectors
, *prev
= 0, *next
;
5481 total_vector_size
= 0;
5484 if (!VECTOR_MARKED_P (vector
))
5487 prev
->next
= vector
->next
;
5489 all_vectors
= vector
->next
;
5490 next
= vector
->next
;
5498 VECTOR_UNMARK (vector
);
5499 if (vector
->size
& PSEUDOVECTOR_FLAG
)
5500 total_vector_size
+= (PSEUDOVECTOR_SIZE_MASK
& vector
->size
);
5502 total_vector_size
+= vector
->size
;
5503 prev
= vector
, vector
= vector
->next
;
5507 #ifdef GC_CHECK_STRING_BYTES
5508 if (!noninteractive
)
5509 check_string_bytes (1);
5516 /* Debugging aids. */
5518 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
5519 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
5520 This may be helpful in debugging Emacs's memory usage.
5521 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
5526 XSETINT (end
, (EMACS_INT
) sbrk (0) / 1024);
5531 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
5532 doc
: /* Return a list of counters that measure how much consing there has been.
5533 Each of these counters increments for a certain kind of object.
5534 The counters wrap around from the largest positive integer to zero.
5535 Garbage collection does not decrease them.
5536 The elements of the value are as follows:
5537 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
5538 All are in units of 1 = one object consed
5539 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
5541 MISCS include overlays, markers, and some internal types.
5542 Frames, windows, buffers, and subprocesses count as vectors
5543 (but the contents of a buffer's text do not count here). */)
5546 Lisp_Object consed
[8];
5548 consed
[0] = make_number (min (MOST_POSITIVE_FIXNUM
, cons_cells_consed
));
5549 consed
[1] = make_number (min (MOST_POSITIVE_FIXNUM
, floats_consed
));
5550 consed
[2] = make_number (min (MOST_POSITIVE_FIXNUM
, vector_cells_consed
));
5551 consed
[3] = make_number (min (MOST_POSITIVE_FIXNUM
, symbols_consed
));
5552 consed
[4] = make_number (min (MOST_POSITIVE_FIXNUM
, string_chars_consed
));
5553 consed
[5] = make_number (min (MOST_POSITIVE_FIXNUM
, misc_objects_consed
));
5554 consed
[6] = make_number (min (MOST_POSITIVE_FIXNUM
, intervals_consed
));
5555 consed
[7] = make_number (min (MOST_POSITIVE_FIXNUM
, strings_consed
));
5557 return Flist (8, consed
);
5560 int suppress_checking
;
5562 die (msg
, file
, line
)
5567 fprintf (stderr
, "\r\nEmacs fatal error: %s:%d: %s\r\n",
5572 /* Initialization */
5577 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
5579 pure_size
= PURESIZE
;
5580 pure_bytes_used
= 0;
5581 pure_bytes_used_before_overflow
= 0;
5583 /* Initialize the list of free aligned blocks. */
5586 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
5588 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
5592 ignore_warnings
= 1;
5593 #ifdef DOUG_LEA_MALLOC
5594 mallopt (M_TRIM_THRESHOLD
, 128*1024); /* trim threshold */
5595 mallopt (M_MMAP_THRESHOLD
, 64*1024); /* mmap threshold */
5596 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* max. number of mmap'ed areas */
5606 malloc_hysteresis
= 32;
5608 malloc_hysteresis
= 0;
5611 spare_memory
= (char *) malloc (SPARE_MEMORY
);
5613 ignore_warnings
= 0;
5615 byte_stack_list
= 0;
5617 consing_since_gc
= 0;
5618 gc_cons_threshold
= 100000 * sizeof (Lisp_Object
);
5619 #ifdef VIRT_ADDR_VARIES
5620 malloc_sbrk_unused
= 1<<22; /* A large number */
5621 malloc_sbrk_used
= 100000; /* as reasonable as any number */
5622 #endif /* VIRT_ADDR_VARIES */
5629 byte_stack_list
= 0;
5631 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
5632 setjmp_tested_p
= longjmps_done
= 0;
5635 Vgc_elapsed
= make_float (0.0);
5642 DEFVAR_INT ("gc-cons-threshold", &gc_cons_threshold
,
5643 doc
: /* *Number of bytes of consing between garbage collections.
5644 Garbage collection can happen automatically once this many bytes have been
5645 allocated since the last garbage collection. All data types count.
5647 Garbage collection happens automatically only when `eval' is called.
5649 By binding this temporarily to a large number, you can effectively
5650 prevent garbage collection during a part of the program. */);
5652 DEFVAR_INT ("pure-bytes-used", &pure_bytes_used
,
5653 doc
: /* Number of bytes of sharable Lisp data allocated so far. */);
5655 DEFVAR_INT ("cons-cells-consed", &cons_cells_consed
,
5656 doc
: /* Number of cons cells that have been consed so far. */);
5658 DEFVAR_INT ("floats-consed", &floats_consed
,
5659 doc
: /* Number of floats that have been consed so far. */);
5661 DEFVAR_INT ("vector-cells-consed", &vector_cells_consed
,
5662 doc
: /* Number of vector cells that have been consed so far. */);
5664 DEFVAR_INT ("symbols-consed", &symbols_consed
,
5665 doc
: /* Number of symbols that have been consed so far. */);
5667 DEFVAR_INT ("string-chars-consed", &string_chars_consed
,
5668 doc
: /* Number of string characters that have been consed so far. */);
5670 DEFVAR_INT ("misc-objects-consed", &misc_objects_consed
,
5671 doc
: /* Number of miscellaneous objects that have been consed so far. */);
5673 DEFVAR_INT ("intervals-consed", &intervals_consed
,
5674 doc
: /* Number of intervals that have been consed so far. */);
5676 DEFVAR_INT ("strings-consed", &strings_consed
,
5677 doc
: /* Number of strings that have been consed so far. */);
5679 DEFVAR_LISP ("purify-flag", &Vpurify_flag
,
5680 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
5681 This means that certain objects should be allocated in shared (pure) space. */);
5683 DEFVAR_INT ("undo-limit", &undo_limit
,
5684 doc
: /* Keep no more undo information once it exceeds this size.
5685 This limit is applied when garbage collection happens.
5686 The size is counted as the number of bytes occupied,
5687 which includes both saved text and other data. */);
5690 DEFVAR_INT ("undo-strong-limit", &undo_strong_limit
,
5691 doc
: /* Don't keep more than this much size of undo information.
5692 A command which pushes past this size is itself forgotten.
5693 This limit is applied when garbage collection happens.
5694 The size is counted as the number of bytes occupied,
5695 which includes both saved text and other data. */);
5696 undo_strong_limit
= 30000;
5698 DEFVAR_BOOL ("garbage-collection-messages", &garbage_collection_messages
,
5699 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
5700 garbage_collection_messages
= 0;
5702 DEFVAR_LISP ("post-gc-hook", &Vpost_gc_hook
,
5703 doc
: /* Hook run after garbage collection has finished. */);
5704 Vpost_gc_hook
= Qnil
;
5705 Qpost_gc_hook
= intern ("post-gc-hook");
5706 staticpro (&Qpost_gc_hook
);
5708 DEFVAR_LISP ("memory-signal-data", &Vmemory_signal_data
,
5709 doc
: /* Precomputed `signal' argument for memory-full error. */);
5710 /* We build this in advance because if we wait until we need it, we might
5711 not be able to allocate the memory to hold it. */
5714 build_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"));
5716 DEFVAR_LISP ("memory-full", &Vmemory_full
,
5717 doc
: /* Non-nil means we are handling a memory-full error. */);
5718 Vmemory_full
= Qnil
;
5720 staticpro (&Qgc_cons_threshold
);
5721 Qgc_cons_threshold
= intern ("gc-cons-threshold");
5723 staticpro (&Qchar_table_extra_slots
);
5724 Qchar_table_extra_slots
= intern ("char-table-extra-slots");
5726 DEFVAR_LISP ("gc-elapsed", &Vgc_elapsed
,
5727 doc
: /* Accumulated time elapsed in garbage collections.
5728 The time is in seconds as a floating point value. */);
5729 DEFVAR_INT ("gcs-done", &gcs_done
,
5730 doc
: /* Accumulated number of garbage collections done. */);
5735 defsubr (&Smake_byte_code
);
5736 defsubr (&Smake_list
);
5737 defsubr (&Smake_vector
);
5738 defsubr (&Smake_char_table
);
5739 defsubr (&Smake_string
);
5740 defsubr (&Smake_bool_vector
);
5741 defsubr (&Smake_symbol
);
5742 defsubr (&Smake_marker
);
5743 defsubr (&Spurecopy
);
5744 defsubr (&Sgarbage_collect
);
5745 defsubr (&Smemory_limit
);
5746 defsubr (&Smemory_use_counts
);
5748 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5749 defsubr (&Sgc_status
);
5753 /* arch-tag: 6695ca10-e3c5-4c2c-8bc3-ed26a7dda857
5754 (do not change this comment) */