1 /* Storage allocation and gc for GNU Emacs Lisp interpreter.
2 Copyright (C) 1985,86,88,93,94,95,97,98,1999,2000,01,02,03,2004
3 Free Software Foundation, Inc.
5 This file is part of GNU Emacs.
7 GNU Emacs is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU Emacs is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU Emacs; see the file COPYING. If not, write to
19 the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
24 #include <limits.h> /* For CHAR_BIT. */
30 /* Note that this declares bzero on OSF/1. How dumb. */
34 /* This file is part of the core Lisp implementation, and thus must
35 deal with the real data structures. If the Lisp implementation is
36 replaced, this file likely will not be used. */
38 #undef HIDE_LISP_IMPLEMENTATION
41 #include "intervals.h"
47 #include "blockinput.h"
49 #include "syssignal.h"
52 /* GC_MALLOC_CHECK defined means perform validity checks of malloc'd
53 memory. Can do this only if using gmalloc.c. */
55 #if defined SYSTEM_MALLOC || defined DOUG_LEA_MALLOC
56 #undef GC_MALLOC_CHECK
62 extern POINTER_TYPE
*sbrk ();
65 #ifdef DOUG_LEA_MALLOC
68 /* malloc.h #defines this as size_t, at least in glibc2. */
69 #ifndef __malloc_size_t
70 #define __malloc_size_t int
73 /* Specify maximum number of areas to mmap. It would be nice to use a
74 value that explicitly means "no limit". */
76 #define MMAP_MAX_AREAS 100000000
78 #else /* not DOUG_LEA_MALLOC */
80 /* The following come from gmalloc.c. */
82 #define __malloc_size_t size_t
83 extern __malloc_size_t _bytes_used
;
84 extern __malloc_size_t __malloc_extra_blocks
;
86 #endif /* not DOUG_LEA_MALLOC */
88 /* Value of _bytes_used, when spare_memory was freed. */
90 static __malloc_size_t bytes_used_when_full
;
92 /* Mark, unmark, query mark bit of a Lisp string. S must be a pointer
93 to a struct Lisp_String. */
95 #define MARK_STRING(S) ((S)->size |= ARRAY_MARK_FLAG)
96 #define UNMARK_STRING(S) ((S)->size &= ~ARRAY_MARK_FLAG)
97 #define STRING_MARKED_P(S) ((S)->size & ARRAY_MARK_FLAG)
99 #define VECTOR_MARK(V) ((V)->size |= ARRAY_MARK_FLAG)
100 #define VECTOR_UNMARK(V) ((V)->size &= ~ARRAY_MARK_FLAG)
101 #define VECTOR_MARKED_P(V) ((V)->size & ARRAY_MARK_FLAG)
103 /* Value is the number of bytes/chars of S, a pointer to a struct
104 Lisp_String. This must be used instead of STRING_BYTES (S) or
105 S->size during GC, because S->size contains the mark bit for
108 #define GC_STRING_BYTES(S) (STRING_BYTES (S))
109 #define GC_STRING_CHARS(S) ((S)->size & ~ARRAY_MARK_FLAG)
111 /* Number of bytes of consing done since the last gc. */
113 int consing_since_gc
;
115 /* Count the amount of consing of various sorts of space. */
117 EMACS_INT cons_cells_consed
;
118 EMACS_INT floats_consed
;
119 EMACS_INT vector_cells_consed
;
120 EMACS_INT symbols_consed
;
121 EMACS_INT string_chars_consed
;
122 EMACS_INT misc_objects_consed
;
123 EMACS_INT intervals_consed
;
124 EMACS_INT strings_consed
;
126 /* Number of bytes of consing since GC before another GC should be done. */
128 EMACS_INT gc_cons_threshold
;
130 /* Nonzero during GC. */
134 /* Nonzero means abort if try to GC.
135 This is for code which is written on the assumption that
136 no GC will happen, so as to verify that assumption. */
140 /* Nonzero means display messages at beginning and end of GC. */
142 int garbage_collection_messages
;
144 #ifndef VIRT_ADDR_VARIES
146 #endif /* VIRT_ADDR_VARIES */
147 int malloc_sbrk_used
;
149 #ifndef VIRT_ADDR_VARIES
151 #endif /* VIRT_ADDR_VARIES */
152 int malloc_sbrk_unused
;
154 /* Two limits controlling how much undo information to keep. */
156 EMACS_INT undo_limit
;
157 EMACS_INT undo_strong_limit
;
158 EMACS_INT undo_outer_limit
;
160 /* Number of live and free conses etc. */
162 static int total_conses
, total_markers
, total_symbols
, total_vector_size
;
163 static int total_free_conses
, total_free_markers
, total_free_symbols
;
164 static int total_free_floats
, total_floats
;
166 /* Points to memory space allocated as "spare", to be freed if we run
169 static char *spare_memory
;
171 /* Amount of spare memory to keep in reserve. */
173 #define SPARE_MEMORY (1 << 14)
175 /* Number of extra blocks malloc should get when it needs more core. */
177 static int malloc_hysteresis
;
179 /* Non-nil means defun should do purecopy on the function definition. */
181 Lisp_Object Vpurify_flag
;
183 /* Non-nil means we are handling a memory-full error. */
185 Lisp_Object Vmemory_full
;
189 /* Force it into data space! Initialize it to a nonzero value;
190 otherwise some compilers put it into BSS. */
192 EMACS_INT pure
[PURESIZE
/ sizeof (EMACS_INT
)] = {1,};
193 #define PUREBEG (char *) pure
197 #define pure PURE_SEG_BITS /* Use shared memory segment */
198 #define PUREBEG (char *)PURE_SEG_BITS
200 #endif /* HAVE_SHM */
202 /* Pointer to the pure area, and its size. */
204 static char *purebeg
;
205 static size_t pure_size
;
207 /* Number of bytes of pure storage used before pure storage overflowed.
208 If this is non-zero, this implies that an overflow occurred. */
210 static size_t pure_bytes_used_before_overflow
;
212 /* Value is non-zero if P points into pure space. */
214 #define PURE_POINTER_P(P) \
215 (((PNTR_COMPARISON_TYPE) (P) \
216 < (PNTR_COMPARISON_TYPE) ((char *) purebeg + pure_size)) \
217 && ((PNTR_COMPARISON_TYPE) (P) \
218 >= (PNTR_COMPARISON_TYPE) purebeg))
220 /* Index in pure at which next pure object will be allocated.. */
222 EMACS_INT pure_bytes_used
;
224 /* If nonzero, this is a warning delivered by malloc and not yet
227 char *pending_malloc_warning
;
229 /* Pre-computed signal argument for use when memory is exhausted. */
231 Lisp_Object Vmemory_signal_data
;
233 /* Maximum amount of C stack to save when a GC happens. */
235 #ifndef MAX_SAVE_STACK
236 #define MAX_SAVE_STACK 16000
239 /* Buffer in which we save a copy of the C stack at each GC. */
244 /* Non-zero means ignore malloc warnings. Set during initialization.
245 Currently not used. */
249 Lisp_Object Qgc_cons_threshold
, Qchar_table_extra_slots
;
251 /* Hook run after GC has finished. */
253 Lisp_Object Vpost_gc_hook
, Qpost_gc_hook
;
255 Lisp_Object Vgc_elapsed
; /* accumulated elapsed time in GC */
256 EMACS_INT gcs_done
; /* accumulated GCs */
258 static void mark_buffer
P_ ((Lisp_Object
));
259 extern void mark_kboards
P_ ((void));
260 extern void mark_backtrace
P_ ((void));
261 static void gc_sweep
P_ ((void));
262 static void mark_glyph_matrix
P_ ((struct glyph_matrix
*));
263 static void mark_face_cache
P_ ((struct face_cache
*));
265 #ifdef HAVE_WINDOW_SYSTEM
266 static void mark_image
P_ ((struct image
*));
267 static void mark_image_cache
P_ ((struct frame
*));
268 #endif /* HAVE_WINDOW_SYSTEM */
270 static struct Lisp_String
*allocate_string
P_ ((void));
271 static void compact_small_strings
P_ ((void));
272 static void free_large_strings
P_ ((void));
273 static void sweep_strings
P_ ((void));
275 extern int message_enable_multibyte
;
277 /* When scanning the C stack for live Lisp objects, Emacs keeps track
278 of what memory allocated via lisp_malloc is intended for what
279 purpose. This enumeration specifies the type of memory. */
290 /* Keep the following vector-like types together, with
291 MEM_TYPE_WINDOW being the last, and MEM_TYPE_VECTOR the
292 first. Or change the code of live_vector_p, for instance. */
300 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
302 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
303 #include <stdio.h> /* For fprintf. */
306 /* A unique object in pure space used to make some Lisp objects
307 on free lists recognizable in O(1). */
311 #ifdef GC_MALLOC_CHECK
313 enum mem_type allocated_mem_type
;
314 int dont_register_blocks
;
316 #endif /* GC_MALLOC_CHECK */
318 /* A node in the red-black tree describing allocated memory containing
319 Lisp data. Each such block is recorded with its start and end
320 address when it is allocated, and removed from the tree when it
323 A red-black tree is a balanced binary tree with the following
326 1. Every node is either red or black.
327 2. Every leaf is black.
328 3. If a node is red, then both of its children are black.
329 4. Every simple path from a node to a descendant leaf contains
330 the same number of black nodes.
331 5. The root is always black.
333 When nodes are inserted into the tree, or deleted from the tree,
334 the tree is "fixed" so that these properties are always true.
336 A red-black tree with N internal nodes has height at most 2
337 log(N+1). Searches, insertions and deletions are done in O(log N).
338 Please see a text book about data structures for a detailed
339 description of red-black trees. Any book worth its salt should
344 /* Children of this node. These pointers are never NULL. When there
345 is no child, the value is MEM_NIL, which points to a dummy node. */
346 struct mem_node
*left
, *right
;
348 /* The parent of this node. In the root node, this is NULL. */
349 struct mem_node
*parent
;
351 /* Start and end of allocated region. */
355 enum {MEM_BLACK
, MEM_RED
} color
;
361 /* Base address of stack. Set in main. */
363 Lisp_Object
*stack_base
;
365 /* Root of the tree describing allocated Lisp memory. */
367 static struct mem_node
*mem_root
;
369 /* Lowest and highest known address in the heap. */
371 static void *min_heap_address
, *max_heap_address
;
373 /* Sentinel node of the tree. */
375 static struct mem_node mem_z
;
376 #define MEM_NIL &mem_z
378 static POINTER_TYPE
*lisp_malloc
P_ ((size_t, enum mem_type
));
379 static struct Lisp_Vector
*allocate_vectorlike
P_ ((EMACS_INT
, enum mem_type
));
380 static void lisp_free
P_ ((POINTER_TYPE
*));
381 static void mark_stack
P_ ((void));
382 static int live_vector_p
P_ ((struct mem_node
*, void *));
383 static int live_buffer_p
P_ ((struct mem_node
*, void *));
384 static int live_string_p
P_ ((struct mem_node
*, void *));
385 static int live_cons_p
P_ ((struct mem_node
*, void *));
386 static int live_symbol_p
P_ ((struct mem_node
*, void *));
387 static int live_float_p
P_ ((struct mem_node
*, void *));
388 static int live_misc_p
P_ ((struct mem_node
*, void *));
389 static void mark_maybe_object
P_ ((Lisp_Object
));
390 static void mark_memory
P_ ((void *, void *));
391 static void mem_init
P_ ((void));
392 static struct mem_node
*mem_insert
P_ ((void *, void *, enum mem_type
));
393 static void mem_insert_fixup
P_ ((struct mem_node
*));
394 static void mem_rotate_left
P_ ((struct mem_node
*));
395 static void mem_rotate_right
P_ ((struct mem_node
*));
396 static void mem_delete
P_ ((struct mem_node
*));
397 static void mem_delete_fixup
P_ ((struct mem_node
*));
398 static INLINE
struct mem_node
*mem_find
P_ ((void *));
400 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
401 static void check_gcpros
P_ ((void));
404 #endif /* GC_MARK_STACK || GC_MALLOC_CHECK */
406 /* Recording what needs to be marked for gc. */
408 struct gcpro
*gcprolist
;
410 /* Addresses of staticpro'd variables. Initialize it to a nonzero
411 value; otherwise some compilers put it into BSS. */
413 #define NSTATICS 1280
414 Lisp_Object
*staticvec
[NSTATICS
] = {&Vpurify_flag
};
416 /* Index of next unused slot in staticvec. */
420 static POINTER_TYPE
*pure_alloc
P_ ((size_t, int));
423 /* Value is SZ rounded up to the next multiple of ALIGNMENT.
424 ALIGNMENT must be a power of 2. */
426 #define ALIGN(ptr, ALIGNMENT) \
427 ((POINTER_TYPE *) ((((EMACS_UINT)(ptr)) + (ALIGNMENT) - 1) \
428 & ~((ALIGNMENT) - 1)))
432 /************************************************************************
434 ************************************************************************/
436 /* Function malloc calls this if it finds we are near exhausting storage. */
442 pending_malloc_warning
= str
;
446 /* Display an already-pending malloc warning. */
449 display_malloc_warning ()
451 call3 (intern ("display-warning"),
453 build_string (pending_malloc_warning
),
454 intern ("emergency"));
455 pending_malloc_warning
= 0;
459 #ifdef DOUG_LEA_MALLOC
460 # define BYTES_USED (mallinfo ().arena)
462 # define BYTES_USED _bytes_used
466 /* Called if malloc returns zero. */
473 #ifndef SYSTEM_MALLOC
474 bytes_used_when_full
= BYTES_USED
;
477 /* The first time we get here, free the spare memory. */
484 /* This used to call error, but if we've run out of memory, we could
485 get infinite recursion trying to build the string. */
487 Fsignal (Qnil
, Vmemory_signal_data
);
491 /* Called if we can't allocate relocatable space for a buffer. */
494 buffer_memory_full ()
496 /* If buffers use the relocating allocator, no need to free
497 spare_memory, because we may have plenty of malloc space left
498 that we could get, and if we don't, the malloc that fails will
499 itself cause spare_memory to be freed. If buffers don't use the
500 relocating allocator, treat this like any other failing
509 /* This used to call error, but if we've run out of memory, we could
510 get infinite recursion trying to build the string. */
512 Fsignal (Qnil
, Vmemory_signal_data
);
516 /* Like malloc but check for no memory and block interrupt input.. */
522 register POINTER_TYPE
*val
;
525 val
= (POINTER_TYPE
*) malloc (size
);
534 /* Like realloc but check for no memory and block interrupt input.. */
537 xrealloc (block
, size
)
541 register POINTER_TYPE
*val
;
544 /* We must call malloc explicitly when BLOCK is 0, since some
545 reallocs don't do this. */
547 val
= (POINTER_TYPE
*) malloc (size
);
549 val
= (POINTER_TYPE
*) realloc (block
, size
);
552 if (!val
&& size
) memory_full ();
557 /* Like free but block interrupt input. */
569 /* Like strdup, but uses xmalloc. */
575 size_t len
= strlen (s
) + 1;
576 char *p
= (char *) xmalloc (len
);
582 /* Unwind for SAFE_ALLOCA */
585 safe_alloca_unwind (arg
)
588 register struct Lisp_Save_Value
*p
= XSAVE_VALUE (arg
);
598 /* Like malloc but used for allocating Lisp data. NBYTES is the
599 number of bytes to allocate, TYPE describes the intended use of the
600 allcated memory block (for strings, for conses, ...). */
602 static void *lisp_malloc_loser
;
604 static POINTER_TYPE
*
605 lisp_malloc (nbytes
, type
)
613 #ifdef GC_MALLOC_CHECK
614 allocated_mem_type
= type
;
617 val
= (void *) malloc (nbytes
);
620 /* If the memory just allocated cannot be addressed thru a Lisp
621 object's pointer, and it needs to be,
622 that's equivalent to running out of memory. */
623 if (val
&& type
!= MEM_TYPE_NON_LISP
)
626 XSETCONS (tem
, (char *) val
+ nbytes
- 1);
627 if ((char *) XCONS (tem
) != (char *) val
+ nbytes
- 1)
629 lisp_malloc_loser
= val
;
636 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
637 if (val
&& type
!= MEM_TYPE_NON_LISP
)
638 mem_insert (val
, (char *) val
+ nbytes
, type
);
647 /* Free BLOCK. This must be called to free memory allocated with a
648 call to lisp_malloc. */
656 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
657 mem_delete (mem_find (block
));
662 /* Allocation of aligned blocks of memory to store Lisp data. */
663 /* The entry point is lisp_align_malloc which returns blocks of at most */
664 /* BLOCK_BYTES and guarantees they are aligned on a BLOCK_ALIGN boundary. */
667 /* BLOCK_ALIGN has to be a power of 2. */
668 #define BLOCK_ALIGN (1 << 10)
670 /* Padding to leave at the end of a malloc'd block. This is to give
671 malloc a chance to minimize the amount of memory wasted to alignment.
672 It should be tuned to the particular malloc library used.
673 On glibc-2.3.2, malloc never tries to align, so a padding of 0 is best.
674 posix_memalign on the other hand would ideally prefer a value of 4
675 because otherwise, there's 1020 bytes wasted between each ablocks.
676 But testing shows that those 1020 will most of the time be efficiently
677 used by malloc to place other objects, so a value of 0 is still preferable
678 unless you have a lot of cons&floats and virtually nothing else. */
679 #define BLOCK_PADDING 0
680 #define BLOCK_BYTES \
681 (BLOCK_ALIGN - sizeof (struct aligned_block *) - BLOCK_PADDING)
683 /* Internal data structures and constants. */
685 #define ABLOCKS_SIZE 16
687 /* An aligned block of memory. */
692 char payload
[BLOCK_BYTES
];
693 struct ablock
*next_free
;
695 /* `abase' is the aligned base of the ablocks. */
696 /* It is overloaded to hold the virtual `busy' field that counts
697 the number of used ablock in the parent ablocks.
698 The first ablock has the `busy' field, the others have the `abase'
699 field. To tell the difference, we assume that pointers will have
700 integer values larger than 2 * ABLOCKS_SIZE. The lowest bit of `busy'
701 is used to tell whether the real base of the parent ablocks is `abase'
702 (if not, the word before the first ablock holds a pointer to the
704 struct ablocks
*abase
;
705 /* The padding of all but the last ablock is unused. The padding of
706 the last ablock in an ablocks is not allocated. */
708 char padding
[BLOCK_PADDING
];
712 /* A bunch of consecutive aligned blocks. */
715 struct ablock blocks
[ABLOCKS_SIZE
];
718 /* Size of the block requested from malloc or memalign. */
719 #define ABLOCKS_BYTES (sizeof (struct ablocks) - BLOCK_PADDING)
721 #define ABLOCK_ABASE(block) \
722 (((unsigned long) (block)->abase) <= (1 + 2 * ABLOCKS_SIZE) \
723 ? (struct ablocks *)(block) \
726 /* Virtual `busy' field. */
727 #define ABLOCKS_BUSY(abase) ((abase)->blocks[0].abase)
729 /* Pointer to the (not necessarily aligned) malloc block. */
730 #ifdef HAVE_POSIX_MEMALIGN
731 #define ABLOCKS_BASE(abase) (abase)
733 #define ABLOCKS_BASE(abase) \
734 (1 & (long) ABLOCKS_BUSY (abase) ? abase : ((void**)abase)[-1])
737 /* The list of free ablock. */
738 static struct ablock
*free_ablock
;
740 /* Allocate an aligned block of nbytes.
741 Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be
742 smaller or equal to BLOCK_BYTES. */
743 static POINTER_TYPE
*
744 lisp_align_malloc (nbytes
, type
)
749 struct ablocks
*abase
;
751 eassert (nbytes
<= BLOCK_BYTES
);
755 #ifdef GC_MALLOC_CHECK
756 allocated_mem_type
= type
;
762 EMACS_INT aligned
; /* int gets warning casting to 64-bit pointer. */
764 #ifdef DOUG_LEA_MALLOC
765 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
766 because mapped region contents are not preserved in
768 mallopt (M_MMAP_MAX
, 0);
771 #ifdef HAVE_POSIX_MEMALIGN
773 int err
= posix_memalign (&base
, BLOCK_ALIGN
, ABLOCKS_BYTES
);
779 base
= malloc (ABLOCKS_BYTES
);
780 abase
= ALIGN (base
, BLOCK_ALIGN
);
789 aligned
= (base
== abase
);
791 ((void**)abase
)[-1] = base
;
793 #ifdef DOUG_LEA_MALLOC
794 /* Back to a reasonable maximum of mmap'ed areas. */
795 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
799 /* If the memory just allocated cannot be addressed thru a Lisp
800 object's pointer, and it needs to be, that's equivalent to
801 running out of memory. */
802 if (type
!= MEM_TYPE_NON_LISP
)
805 char *end
= (char *) base
+ ABLOCKS_BYTES
- 1;
807 if ((char *) XCONS (tem
) != end
)
809 lisp_malloc_loser
= base
;
817 /* Initialize the blocks and put them on the free list.
818 Is `base' was not properly aligned, we can't use the last block. */
819 for (i
= 0; i
< (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1); i
++)
821 abase
->blocks
[i
].abase
= abase
;
822 abase
->blocks
[i
].x
.next_free
= free_ablock
;
823 free_ablock
= &abase
->blocks
[i
];
825 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (long) aligned
;
827 eassert (0 == ((EMACS_UINT
)abase
) % BLOCK_ALIGN
);
828 eassert (ABLOCK_ABASE (&abase
->blocks
[3]) == abase
); /* 3 is arbitrary */
829 eassert (ABLOCK_ABASE (&abase
->blocks
[0]) == abase
);
830 eassert (ABLOCKS_BASE (abase
) == base
);
831 eassert (aligned
== (long) ABLOCKS_BUSY (abase
));
834 abase
= ABLOCK_ABASE (free_ablock
);
835 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (2 + (long) ABLOCKS_BUSY (abase
));
837 free_ablock
= free_ablock
->x
.next_free
;
839 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
840 if (val
&& type
!= MEM_TYPE_NON_LISP
)
841 mem_insert (val
, (char *) val
+ nbytes
, type
);
848 eassert (0 == ((EMACS_UINT
)val
) % BLOCK_ALIGN
);
853 lisp_align_free (block
)
856 struct ablock
*ablock
= block
;
857 struct ablocks
*abase
= ABLOCK_ABASE (ablock
);
860 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
861 mem_delete (mem_find (block
));
863 /* Put on free list. */
864 ablock
->x
.next_free
= free_ablock
;
865 free_ablock
= ablock
;
866 /* Update busy count. */
867 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (-2 + (long) ABLOCKS_BUSY (abase
));
869 if (2 > (long) ABLOCKS_BUSY (abase
))
870 { /* All the blocks are free. */
871 int i
= 0, aligned
= (long) ABLOCKS_BUSY (abase
);
872 struct ablock
**tem
= &free_ablock
;
873 struct ablock
*atop
= &abase
->blocks
[aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1];
877 if (*tem
>= (struct ablock
*) abase
&& *tem
< atop
)
880 *tem
= (*tem
)->x
.next_free
;
883 tem
= &(*tem
)->x
.next_free
;
885 eassert ((aligned
& 1) == aligned
);
886 eassert (i
== (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1));
887 free (ABLOCKS_BASE (abase
));
892 /* Return a new buffer structure allocated from the heap with
893 a call to lisp_malloc. */
899 = (struct buffer
*) lisp_malloc (sizeof (struct buffer
),
905 /* Arranging to disable input signals while we're in malloc.
907 This only works with GNU malloc. To help out systems which can't
908 use GNU malloc, all the calls to malloc, realloc, and free
909 elsewhere in the code should be inside a BLOCK_INPUT/UNBLOCK_INPUT
910 pairs; unfortunately, we have no idea what C library functions
911 might call malloc, so we can't really protect them unless you're
912 using GNU malloc. Fortunately, most of the major operating systems
913 can use GNU malloc. */
915 #ifndef SYSTEM_MALLOC
916 #ifndef DOUG_LEA_MALLOC
917 extern void * (*__malloc_hook
) P_ ((size_t));
918 extern void * (*__realloc_hook
) P_ ((void *, size_t));
919 extern void (*__free_hook
) P_ ((void *));
920 /* Else declared in malloc.h, perhaps with an extra arg. */
921 #endif /* DOUG_LEA_MALLOC */
922 static void * (*old_malloc_hook
) ();
923 static void * (*old_realloc_hook
) ();
924 static void (*old_free_hook
) ();
926 /* This function is used as the hook for free to call. */
929 emacs_blocked_free (ptr
)
934 #ifdef GC_MALLOC_CHECK
940 if (m
== MEM_NIL
|| m
->start
!= ptr
)
943 "Freeing `%p' which wasn't allocated with malloc\n", ptr
);
948 /* fprintf (stderr, "free %p...%p (%p)\n", m->start, m->end, ptr); */
952 #endif /* GC_MALLOC_CHECK */
954 __free_hook
= old_free_hook
;
957 /* If we released our reserve (due to running out of memory),
958 and we have a fair amount free once again,
959 try to set aside another reserve in case we run out once more. */
960 if (spare_memory
== 0
961 /* Verify there is enough space that even with the malloc
962 hysteresis this call won't run out again.
963 The code here is correct as long as SPARE_MEMORY
964 is substantially larger than the block size malloc uses. */
965 && (bytes_used_when_full
966 > BYTES_USED
+ max (malloc_hysteresis
, 4) * SPARE_MEMORY
))
967 spare_memory
= (char *) malloc ((size_t) SPARE_MEMORY
);
969 __free_hook
= emacs_blocked_free
;
974 /* If we released our reserve (due to running out of memory),
975 and we have a fair amount free once again,
976 try to set aside another reserve in case we run out once more.
978 This is called when a relocatable block is freed in ralloc.c. */
981 refill_memory_reserve ()
983 if (spare_memory
== 0)
984 spare_memory
= (char *) malloc ((size_t) SPARE_MEMORY
);
988 /* This function is the malloc hook that Emacs uses. */
991 emacs_blocked_malloc (size
)
997 __malloc_hook
= old_malloc_hook
;
998 #ifdef DOUG_LEA_MALLOC
999 mallopt (M_TOP_PAD
, malloc_hysteresis
* 4096);
1001 __malloc_extra_blocks
= malloc_hysteresis
;
1004 value
= (void *) malloc (size
);
1006 #ifdef GC_MALLOC_CHECK
1008 struct mem_node
*m
= mem_find (value
);
1011 fprintf (stderr
, "Malloc returned %p which is already in use\n",
1013 fprintf (stderr
, "Region in use is %p...%p, %u bytes, type %d\n",
1014 m
->start
, m
->end
, (char *) m
->end
- (char *) m
->start
,
1019 if (!dont_register_blocks
)
1021 mem_insert (value
, (char *) value
+ max (1, size
), allocated_mem_type
);
1022 allocated_mem_type
= MEM_TYPE_NON_LISP
;
1025 #endif /* GC_MALLOC_CHECK */
1027 __malloc_hook
= emacs_blocked_malloc
;
1030 /* fprintf (stderr, "%p malloc\n", value); */
1035 /* This function is the realloc hook that Emacs uses. */
1038 emacs_blocked_realloc (ptr
, size
)
1045 __realloc_hook
= old_realloc_hook
;
1047 #ifdef GC_MALLOC_CHECK
1050 struct mem_node
*m
= mem_find (ptr
);
1051 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1054 "Realloc of %p which wasn't allocated with malloc\n",
1062 /* fprintf (stderr, "%p -> realloc\n", ptr); */
1064 /* Prevent malloc from registering blocks. */
1065 dont_register_blocks
= 1;
1066 #endif /* GC_MALLOC_CHECK */
1068 value
= (void *) realloc (ptr
, size
);
1070 #ifdef GC_MALLOC_CHECK
1071 dont_register_blocks
= 0;
1074 struct mem_node
*m
= mem_find (value
);
1077 fprintf (stderr
, "Realloc returns memory that is already in use\n");
1081 /* Can't handle zero size regions in the red-black tree. */
1082 mem_insert (value
, (char *) value
+ max (size
, 1), MEM_TYPE_NON_LISP
);
1085 /* fprintf (stderr, "%p <- realloc\n", value); */
1086 #endif /* GC_MALLOC_CHECK */
1088 __realloc_hook
= emacs_blocked_realloc
;
1095 /* Called from main to set up malloc to use our hooks. */
1098 uninterrupt_malloc ()
1100 if (__free_hook
!= emacs_blocked_free
)
1101 old_free_hook
= __free_hook
;
1102 __free_hook
= emacs_blocked_free
;
1104 if (__malloc_hook
!= emacs_blocked_malloc
)
1105 old_malloc_hook
= __malloc_hook
;
1106 __malloc_hook
= emacs_blocked_malloc
;
1108 if (__realloc_hook
!= emacs_blocked_realloc
)
1109 old_realloc_hook
= __realloc_hook
;
1110 __realloc_hook
= emacs_blocked_realloc
;
1113 #endif /* not SYSTEM_MALLOC */
1117 /***********************************************************************
1119 ***********************************************************************/
1121 /* Number of intervals allocated in an interval_block structure.
1122 The 1020 is 1024 minus malloc overhead. */
1124 #define INTERVAL_BLOCK_SIZE \
1125 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
1127 /* Intervals are allocated in chunks in form of an interval_block
1130 struct interval_block
1132 /* Place `intervals' first, to preserve alignment. */
1133 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
1134 struct interval_block
*next
;
1137 /* Current interval block. Its `next' pointer points to older
1140 struct interval_block
*interval_block
;
1142 /* Index in interval_block above of the next unused interval
1145 static int interval_block_index
;
1147 /* Number of free and live intervals. */
1149 static int total_free_intervals
, total_intervals
;
1151 /* List of free intervals. */
1153 INTERVAL interval_free_list
;
1155 /* Total number of interval blocks now in use. */
1157 int n_interval_blocks
;
1160 /* Initialize interval allocation. */
1165 interval_block
= NULL
;
1166 interval_block_index
= INTERVAL_BLOCK_SIZE
;
1167 interval_free_list
= 0;
1168 n_interval_blocks
= 0;
1172 /* Return a new interval. */
1179 if (interval_free_list
)
1181 val
= interval_free_list
;
1182 interval_free_list
= INTERVAL_PARENT (interval_free_list
);
1186 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
1188 register struct interval_block
*newi
;
1190 newi
= (struct interval_block
*) lisp_malloc (sizeof *newi
,
1193 newi
->next
= interval_block
;
1194 interval_block
= newi
;
1195 interval_block_index
= 0;
1196 n_interval_blocks
++;
1198 val
= &interval_block
->intervals
[interval_block_index
++];
1200 consing_since_gc
+= sizeof (struct interval
);
1202 RESET_INTERVAL (val
);
1208 /* Mark Lisp objects in interval I. */
1211 mark_interval (i
, dummy
)
1212 register INTERVAL i
;
1215 eassert (!i
->gcmarkbit
); /* Intervals are never shared. */
1217 mark_object (i
->plist
);
1221 /* Mark the interval tree rooted in TREE. Don't call this directly;
1222 use the macro MARK_INTERVAL_TREE instead. */
1225 mark_interval_tree (tree
)
1226 register INTERVAL tree
;
1228 /* No need to test if this tree has been marked already; this
1229 function is always called through the MARK_INTERVAL_TREE macro,
1230 which takes care of that. */
1232 traverse_intervals_noorder (tree
, mark_interval
, Qnil
);
1236 /* Mark the interval tree rooted in I. */
1238 #define MARK_INTERVAL_TREE(i) \
1240 if (!NULL_INTERVAL_P (i) && !i->gcmarkbit) \
1241 mark_interval_tree (i); \
1245 #define UNMARK_BALANCE_INTERVALS(i) \
1247 if (! NULL_INTERVAL_P (i)) \
1248 (i) = balance_intervals (i); \
1252 /* Number support. If NO_UNION_TYPE isn't in effect, we
1253 can't create number objects in macros. */
1261 obj
.s
.type
= Lisp_Int
;
1266 /***********************************************************************
1268 ***********************************************************************/
1270 /* Lisp_Strings are allocated in string_block structures. When a new
1271 string_block is allocated, all the Lisp_Strings it contains are
1272 added to a free-list string_free_list. When a new Lisp_String is
1273 needed, it is taken from that list. During the sweep phase of GC,
1274 string_blocks that are entirely free are freed, except two which
1277 String data is allocated from sblock structures. Strings larger
1278 than LARGE_STRING_BYTES, get their own sblock, data for smaller
1279 strings is sub-allocated out of sblocks of size SBLOCK_SIZE.
1281 Sblocks consist internally of sdata structures, one for each
1282 Lisp_String. The sdata structure points to the Lisp_String it
1283 belongs to. The Lisp_String points back to the `u.data' member of
1284 its sdata structure.
1286 When a Lisp_String is freed during GC, it is put back on
1287 string_free_list, and its `data' member and its sdata's `string'
1288 pointer is set to null. The size of the string is recorded in the
1289 `u.nbytes' member of the sdata. So, sdata structures that are no
1290 longer used, can be easily recognized, and it's easy to compact the
1291 sblocks of small strings which we do in compact_small_strings. */
1293 /* Size in bytes of an sblock structure used for small strings. This
1294 is 8192 minus malloc overhead. */
1296 #define SBLOCK_SIZE 8188
1298 /* Strings larger than this are considered large strings. String data
1299 for large strings is allocated from individual sblocks. */
1301 #define LARGE_STRING_BYTES 1024
1303 /* Structure describing string memory sub-allocated from an sblock.
1304 This is where the contents of Lisp strings are stored. */
1308 /* Back-pointer to the string this sdata belongs to. If null, this
1309 structure is free, and the NBYTES member of the union below
1310 contains the string's byte size (the same value that STRING_BYTES
1311 would return if STRING were non-null). If non-null, STRING_BYTES
1312 (STRING) is the size of the data, and DATA contains the string's
1314 struct Lisp_String
*string
;
1316 #ifdef GC_CHECK_STRING_BYTES
1319 unsigned char data
[1];
1321 #define SDATA_NBYTES(S) (S)->nbytes
1322 #define SDATA_DATA(S) (S)->data
1324 #else /* not GC_CHECK_STRING_BYTES */
1328 /* When STRING in non-null. */
1329 unsigned char data
[1];
1331 /* When STRING is null. */
1336 #define SDATA_NBYTES(S) (S)->u.nbytes
1337 #define SDATA_DATA(S) (S)->u.data
1339 #endif /* not GC_CHECK_STRING_BYTES */
1343 /* Structure describing a block of memory which is sub-allocated to
1344 obtain string data memory for strings. Blocks for small strings
1345 are of fixed size SBLOCK_SIZE. Blocks for large strings are made
1346 as large as needed. */
1351 struct sblock
*next
;
1353 /* Pointer to the next free sdata block. This points past the end
1354 of the sblock if there isn't any space left in this block. */
1355 struct sdata
*next_free
;
1357 /* Start of data. */
1358 struct sdata first_data
;
1361 /* Number of Lisp strings in a string_block structure. The 1020 is
1362 1024 minus malloc overhead. */
1364 #define STRING_BLOCK_SIZE \
1365 ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String))
1367 /* Structure describing a block from which Lisp_String structures
1372 /* Place `strings' first, to preserve alignment. */
1373 struct Lisp_String strings
[STRING_BLOCK_SIZE
];
1374 struct string_block
*next
;
1377 /* Head and tail of the list of sblock structures holding Lisp string
1378 data. We always allocate from current_sblock. The NEXT pointers
1379 in the sblock structures go from oldest_sblock to current_sblock. */
1381 static struct sblock
*oldest_sblock
, *current_sblock
;
1383 /* List of sblocks for large strings. */
1385 static struct sblock
*large_sblocks
;
1387 /* List of string_block structures, and how many there are. */
1389 static struct string_block
*string_blocks
;
1390 static int n_string_blocks
;
1392 /* Free-list of Lisp_Strings. */
1394 static struct Lisp_String
*string_free_list
;
1396 /* Number of live and free Lisp_Strings. */
1398 static int total_strings
, total_free_strings
;
1400 /* Number of bytes used by live strings. */
1402 static int total_string_size
;
1404 /* Given a pointer to a Lisp_String S which is on the free-list
1405 string_free_list, return a pointer to its successor in the
1408 #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S))
1410 /* Return a pointer to the sdata structure belonging to Lisp string S.
1411 S must be live, i.e. S->data must not be null. S->data is actually
1412 a pointer to the `u.data' member of its sdata structure; the
1413 structure starts at a constant offset in front of that. */
1415 #ifdef GC_CHECK_STRING_BYTES
1417 #define SDATA_OF_STRING(S) \
1418 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *) \
1419 - sizeof (EMACS_INT)))
1421 #else /* not GC_CHECK_STRING_BYTES */
1423 #define SDATA_OF_STRING(S) \
1424 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *)))
1426 #endif /* not GC_CHECK_STRING_BYTES */
1428 /* Value is the size of an sdata structure large enough to hold NBYTES
1429 bytes of string data. The value returned includes a terminating
1430 NUL byte, the size of the sdata structure, and padding. */
1432 #ifdef GC_CHECK_STRING_BYTES
1434 #define SDATA_SIZE(NBYTES) \
1435 ((sizeof (struct Lisp_String *) \
1437 + sizeof (EMACS_INT) \
1438 + sizeof (EMACS_INT) - 1) \
1439 & ~(sizeof (EMACS_INT) - 1))
1441 #else /* not GC_CHECK_STRING_BYTES */
1443 #define SDATA_SIZE(NBYTES) \
1444 ((sizeof (struct Lisp_String *) \
1446 + sizeof (EMACS_INT) - 1) \
1447 & ~(sizeof (EMACS_INT) - 1))
1449 #endif /* not GC_CHECK_STRING_BYTES */
1451 /* Initialize string allocation. Called from init_alloc_once. */
1456 total_strings
= total_free_strings
= total_string_size
= 0;
1457 oldest_sblock
= current_sblock
= large_sblocks
= NULL
;
1458 string_blocks
= NULL
;
1459 n_string_blocks
= 0;
1460 string_free_list
= NULL
;
1464 #ifdef GC_CHECK_STRING_BYTES
1466 static int check_string_bytes_count
;
1468 void check_string_bytes
P_ ((int));
1469 void check_sblock
P_ ((struct sblock
*));
1471 #define CHECK_STRING_BYTES(S) STRING_BYTES (S)
1474 /* Like GC_STRING_BYTES, but with debugging check. */
1478 struct Lisp_String
*s
;
1480 int nbytes
= (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1481 if (!PURE_POINTER_P (s
)
1483 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1488 /* Check validity of Lisp strings' string_bytes member in B. */
1494 struct sdata
*from
, *end
, *from_end
;
1498 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1500 /* Compute the next FROM here because copying below may
1501 overwrite data we need to compute it. */
1504 /* Check that the string size recorded in the string is the
1505 same as the one recorded in the sdata structure. */
1507 CHECK_STRING_BYTES (from
->string
);
1510 nbytes
= GC_STRING_BYTES (from
->string
);
1512 nbytes
= SDATA_NBYTES (from
);
1514 nbytes
= SDATA_SIZE (nbytes
);
1515 from_end
= (struct sdata
*) ((char *) from
+ nbytes
);
1520 /* Check validity of Lisp strings' string_bytes member. ALL_P
1521 non-zero means check all strings, otherwise check only most
1522 recently allocated strings. Used for hunting a bug. */
1525 check_string_bytes (all_p
)
1532 for (b
= large_sblocks
; b
; b
= b
->next
)
1534 struct Lisp_String
*s
= b
->first_data
.string
;
1536 CHECK_STRING_BYTES (s
);
1539 for (b
= oldest_sblock
; b
; b
= b
->next
)
1543 check_sblock (current_sblock
);
1546 #endif /* GC_CHECK_STRING_BYTES */
1549 /* Return a new Lisp_String. */
1551 static struct Lisp_String
*
1554 struct Lisp_String
*s
;
1556 /* If the free-list is empty, allocate a new string_block, and
1557 add all the Lisp_Strings in it to the free-list. */
1558 if (string_free_list
== NULL
)
1560 struct string_block
*b
;
1563 b
= (struct string_block
*) lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1564 bzero (b
, sizeof *b
);
1565 b
->next
= string_blocks
;
1569 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1572 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1573 string_free_list
= s
;
1576 total_free_strings
+= STRING_BLOCK_SIZE
;
1579 /* Pop a Lisp_String off the free-list. */
1580 s
= string_free_list
;
1581 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1583 /* Probably not strictly necessary, but play it safe. */
1584 bzero (s
, sizeof *s
);
1586 --total_free_strings
;
1589 consing_since_gc
+= sizeof *s
;
1591 #ifdef GC_CHECK_STRING_BYTES
1598 if (++check_string_bytes_count
== 200)
1600 check_string_bytes_count
= 0;
1601 check_string_bytes (1);
1604 check_string_bytes (0);
1606 #endif /* GC_CHECK_STRING_BYTES */
1612 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1613 plus a NUL byte at the end. Allocate an sdata structure for S, and
1614 set S->data to its `u.data' member. Store a NUL byte at the end of
1615 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1616 S->data if it was initially non-null. */
1619 allocate_string_data (s
, nchars
, nbytes
)
1620 struct Lisp_String
*s
;
1623 struct sdata
*data
, *old_data
;
1625 int needed
, old_nbytes
;
1627 /* Determine the number of bytes needed to store NBYTES bytes
1629 needed
= SDATA_SIZE (nbytes
);
1631 if (nbytes
> LARGE_STRING_BYTES
)
1633 size_t size
= sizeof *b
- sizeof (struct sdata
) + needed
;
1635 #ifdef DOUG_LEA_MALLOC
1636 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1637 because mapped region contents are not preserved in
1640 In case you think of allowing it in a dumped Emacs at the
1641 cost of not being able to re-dump, there's another reason:
1642 mmap'ed data typically have an address towards the top of the
1643 address space, which won't fit into an EMACS_INT (at least on
1644 32-bit systems with the current tagging scheme). --fx */
1645 mallopt (M_MMAP_MAX
, 0);
1648 b
= (struct sblock
*) lisp_malloc (size
, MEM_TYPE_NON_LISP
);
1650 #ifdef DOUG_LEA_MALLOC
1651 /* Back to a reasonable maximum of mmap'ed areas. */
1652 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1655 b
->next_free
= &b
->first_data
;
1656 b
->first_data
.string
= NULL
;
1657 b
->next
= large_sblocks
;
1660 else if (current_sblock
== NULL
1661 || (((char *) current_sblock
+ SBLOCK_SIZE
1662 - (char *) current_sblock
->next_free
)
1665 /* Not enough room in the current sblock. */
1666 b
= (struct sblock
*) lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
1667 b
->next_free
= &b
->first_data
;
1668 b
->first_data
.string
= NULL
;
1672 current_sblock
->next
= b
;
1680 old_data
= s
->data
? SDATA_OF_STRING (s
) : NULL
;
1681 old_nbytes
= GC_STRING_BYTES (s
);
1683 data
= b
->next_free
;
1685 s
->data
= SDATA_DATA (data
);
1686 #ifdef GC_CHECK_STRING_BYTES
1687 SDATA_NBYTES (data
) = nbytes
;
1690 s
->size_byte
= nbytes
;
1691 s
->data
[nbytes
] = '\0';
1692 b
->next_free
= (struct sdata
*) ((char *) data
+ needed
);
1694 /* If S had already data assigned, mark that as free by setting its
1695 string back-pointer to null, and recording the size of the data
1699 SDATA_NBYTES (old_data
) = old_nbytes
;
1700 old_data
->string
= NULL
;
1703 consing_since_gc
+= needed
;
1707 /* Sweep and compact strings. */
1712 struct string_block
*b
, *next
;
1713 struct string_block
*live_blocks
= NULL
;
1715 string_free_list
= NULL
;
1716 total_strings
= total_free_strings
= 0;
1717 total_string_size
= 0;
1719 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
1720 for (b
= string_blocks
; b
; b
= next
)
1723 struct Lisp_String
*free_list_before
= string_free_list
;
1727 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
1729 struct Lisp_String
*s
= b
->strings
+ i
;
1733 /* String was not on free-list before. */
1734 if (STRING_MARKED_P (s
))
1736 /* String is live; unmark it and its intervals. */
1739 if (!NULL_INTERVAL_P (s
->intervals
))
1740 UNMARK_BALANCE_INTERVALS (s
->intervals
);
1743 total_string_size
+= STRING_BYTES (s
);
1747 /* String is dead. Put it on the free-list. */
1748 struct sdata
*data
= SDATA_OF_STRING (s
);
1750 /* Save the size of S in its sdata so that we know
1751 how large that is. Reset the sdata's string
1752 back-pointer so that we know it's free. */
1753 #ifdef GC_CHECK_STRING_BYTES
1754 if (GC_STRING_BYTES (s
) != SDATA_NBYTES (data
))
1757 data
->u
.nbytes
= GC_STRING_BYTES (s
);
1759 data
->string
= NULL
;
1761 /* Reset the strings's `data' member so that we
1765 /* Put the string on the free-list. */
1766 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1767 string_free_list
= s
;
1773 /* S was on the free-list before. Put it there again. */
1774 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1775 string_free_list
= s
;
1780 /* Free blocks that contain free Lisp_Strings only, except
1781 the first two of them. */
1782 if (nfree
== STRING_BLOCK_SIZE
1783 && total_free_strings
> STRING_BLOCK_SIZE
)
1787 string_free_list
= free_list_before
;
1791 total_free_strings
+= nfree
;
1792 b
->next
= live_blocks
;
1797 string_blocks
= live_blocks
;
1798 free_large_strings ();
1799 compact_small_strings ();
1803 /* Free dead large strings. */
1806 free_large_strings ()
1808 struct sblock
*b
, *next
;
1809 struct sblock
*live_blocks
= NULL
;
1811 for (b
= large_sblocks
; b
; b
= next
)
1815 if (b
->first_data
.string
== NULL
)
1819 b
->next
= live_blocks
;
1824 large_sblocks
= live_blocks
;
1828 /* Compact data of small strings. Free sblocks that don't contain
1829 data of live strings after compaction. */
1832 compact_small_strings ()
1834 struct sblock
*b
, *tb
, *next
;
1835 struct sdata
*from
, *to
, *end
, *tb_end
;
1836 struct sdata
*to_end
, *from_end
;
1838 /* TB is the sblock we copy to, TO is the sdata within TB we copy
1839 to, and TB_END is the end of TB. */
1841 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
1842 to
= &tb
->first_data
;
1844 /* Step through the blocks from the oldest to the youngest. We
1845 expect that old blocks will stabilize over time, so that less
1846 copying will happen this way. */
1847 for (b
= oldest_sblock
; b
; b
= b
->next
)
1850 xassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
1852 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1854 /* Compute the next FROM here because copying below may
1855 overwrite data we need to compute it. */
1858 #ifdef GC_CHECK_STRING_BYTES
1859 /* Check that the string size recorded in the string is the
1860 same as the one recorded in the sdata structure. */
1862 && GC_STRING_BYTES (from
->string
) != SDATA_NBYTES (from
))
1864 #endif /* GC_CHECK_STRING_BYTES */
1867 nbytes
= GC_STRING_BYTES (from
->string
);
1869 nbytes
= SDATA_NBYTES (from
);
1871 nbytes
= SDATA_SIZE (nbytes
);
1872 from_end
= (struct sdata
*) ((char *) from
+ nbytes
);
1874 /* FROM->string non-null means it's alive. Copy its data. */
1877 /* If TB is full, proceed with the next sblock. */
1878 to_end
= (struct sdata
*) ((char *) to
+ nbytes
);
1879 if (to_end
> tb_end
)
1883 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
1884 to
= &tb
->first_data
;
1885 to_end
= (struct sdata
*) ((char *) to
+ nbytes
);
1888 /* Copy, and update the string's `data' pointer. */
1891 xassert (tb
!= b
|| to
<= from
);
1892 safe_bcopy ((char *) from
, (char *) to
, nbytes
);
1893 to
->string
->data
= SDATA_DATA (to
);
1896 /* Advance past the sdata we copied to. */
1902 /* The rest of the sblocks following TB don't contain live data, so
1903 we can free them. */
1904 for (b
= tb
->next
; b
; b
= next
)
1912 current_sblock
= tb
;
1916 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
1917 doc
: /* Return a newly created string of length LENGTH, with INIT in each element.
1918 LENGTH must be an integer.
1919 INIT must be an integer that represents a character. */)
1921 Lisp_Object length
, init
;
1923 register Lisp_Object val
;
1924 register unsigned char *p
, *end
;
1927 CHECK_NATNUM (length
);
1928 CHECK_NUMBER (init
);
1931 if (SINGLE_BYTE_CHAR_P (c
))
1933 nbytes
= XINT (length
);
1934 val
= make_uninit_string (nbytes
);
1936 end
= p
+ SCHARS (val
);
1942 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
1943 int len
= CHAR_STRING (c
, str
);
1945 nbytes
= len
* XINT (length
);
1946 val
= make_uninit_multibyte_string (XINT (length
), nbytes
);
1951 bcopy (str
, p
, len
);
1961 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
1962 doc
: /* Return a new bool-vector of length LENGTH, using INIT for as each element.
1963 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
1965 Lisp_Object length
, init
;
1967 register Lisp_Object val
;
1968 struct Lisp_Bool_Vector
*p
;
1970 int length_in_chars
, length_in_elts
, bits_per_value
;
1972 CHECK_NATNUM (length
);
1974 bits_per_value
= sizeof (EMACS_INT
) * BOOL_VECTOR_BITS_PER_CHAR
;
1976 length_in_elts
= (XFASTINT (length
) + bits_per_value
- 1) / bits_per_value
;
1977 length_in_chars
= ((XFASTINT (length
) + BOOL_VECTOR_BITS_PER_CHAR
- 1)
1978 / BOOL_VECTOR_BITS_PER_CHAR
);
1980 /* We must allocate one more elements than LENGTH_IN_ELTS for the
1981 slot `size' of the struct Lisp_Bool_Vector. */
1982 val
= Fmake_vector (make_number (length_in_elts
+ 1), Qnil
);
1983 p
= XBOOL_VECTOR (val
);
1985 /* Get rid of any bits that would cause confusion. */
1987 XSETBOOL_VECTOR (val
, p
);
1988 p
->size
= XFASTINT (length
);
1990 real_init
= (NILP (init
) ? 0 : -1);
1991 for (i
= 0; i
< length_in_chars
; i
++)
1992 p
->data
[i
] = real_init
;
1994 /* Clear the extraneous bits in the last byte. */
1995 if (XINT (length
) != length_in_chars
* BOOL_VECTOR_BITS_PER_CHAR
)
1996 XBOOL_VECTOR (val
)->data
[length_in_chars
- 1]
1997 &= (1 << (XINT (length
) % BOOL_VECTOR_BITS_PER_CHAR
)) - 1;
2003 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
2004 of characters from the contents. This string may be unibyte or
2005 multibyte, depending on the contents. */
2008 make_string (contents
, nbytes
)
2009 const char *contents
;
2012 register Lisp_Object val
;
2013 int nchars
, multibyte_nbytes
;
2015 parse_str_as_multibyte (contents
, nbytes
, &nchars
, &multibyte_nbytes
);
2016 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
2017 /* CONTENTS contains no multibyte sequences or contains an invalid
2018 multibyte sequence. We must make unibyte string. */
2019 val
= make_unibyte_string (contents
, nbytes
);
2021 val
= make_multibyte_string (contents
, nchars
, nbytes
);
2026 /* Make an unibyte string from LENGTH bytes at CONTENTS. */
2029 make_unibyte_string (contents
, length
)
2030 const char *contents
;
2033 register Lisp_Object val
;
2034 val
= make_uninit_string (length
);
2035 bcopy (contents
, SDATA (val
), length
);
2036 STRING_SET_UNIBYTE (val
);
2041 /* Make a multibyte string from NCHARS characters occupying NBYTES
2042 bytes at CONTENTS. */
2045 make_multibyte_string (contents
, nchars
, nbytes
)
2046 const char *contents
;
2049 register Lisp_Object val
;
2050 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2051 bcopy (contents
, SDATA (val
), nbytes
);
2056 /* Make a string from NCHARS characters occupying NBYTES bytes at
2057 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2060 make_string_from_bytes (contents
, nchars
, nbytes
)
2061 const char *contents
;
2064 register Lisp_Object val
;
2065 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2066 bcopy (contents
, SDATA (val
), nbytes
);
2067 if (SBYTES (val
) == SCHARS (val
))
2068 STRING_SET_UNIBYTE (val
);
2073 /* Make a string from NCHARS characters occupying NBYTES bytes at
2074 CONTENTS. The argument MULTIBYTE controls whether to label the
2075 string as multibyte. If NCHARS is negative, it counts the number of
2076 characters by itself. */
2079 make_specified_string (contents
, nchars
, nbytes
, multibyte
)
2080 const char *contents
;
2084 register Lisp_Object val
;
2089 nchars
= multibyte_chars_in_text (contents
, nbytes
);
2093 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2094 bcopy (contents
, SDATA (val
), nbytes
);
2096 STRING_SET_UNIBYTE (val
);
2101 /* Make a string from the data at STR, treating it as multibyte if the
2108 return make_string (str
, strlen (str
));
2112 /* Return an unibyte Lisp_String set up to hold LENGTH characters
2113 occupying LENGTH bytes. */
2116 make_uninit_string (length
)
2120 val
= make_uninit_multibyte_string (length
, length
);
2121 STRING_SET_UNIBYTE (val
);
2126 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2127 which occupy NBYTES bytes. */
2130 make_uninit_multibyte_string (nchars
, nbytes
)
2134 struct Lisp_String
*s
;
2139 s
= allocate_string ();
2140 allocate_string_data (s
, nchars
, nbytes
);
2141 XSETSTRING (string
, s
);
2142 string_chars_consed
+= nbytes
;
2148 /***********************************************************************
2150 ***********************************************************************/
2152 /* We store float cells inside of float_blocks, allocating a new
2153 float_block with malloc whenever necessary. Float cells reclaimed
2154 by GC are put on a free list to be reallocated before allocating
2155 any new float cells from the latest float_block. */
2157 #define FLOAT_BLOCK_SIZE \
2158 (((BLOCK_BYTES - sizeof (struct float_block *) \
2159 /* The compiler might add padding at the end. */ \
2160 - (sizeof (struct Lisp_Float) - sizeof (int))) * CHAR_BIT) \
2161 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2163 #define GETMARKBIT(block,n) \
2164 (((block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2165 >> ((n) % (sizeof(int) * CHAR_BIT))) \
2168 #define SETMARKBIT(block,n) \
2169 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2170 |= 1 << ((n) % (sizeof(int) * CHAR_BIT))
2172 #define UNSETMARKBIT(block,n) \
2173 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2174 &= ~(1 << ((n) % (sizeof(int) * CHAR_BIT)))
2176 #define FLOAT_BLOCK(fptr) \
2177 ((struct float_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2179 #define FLOAT_INDEX(fptr) \
2180 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2184 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2185 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2186 int gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2187 struct float_block
*next
;
2190 #define FLOAT_MARKED_P(fptr) \
2191 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2193 #define FLOAT_MARK(fptr) \
2194 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2196 #define FLOAT_UNMARK(fptr) \
2197 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2199 /* Current float_block. */
2201 struct float_block
*float_block
;
2203 /* Index of first unused Lisp_Float in the current float_block. */
2205 int float_block_index
;
2207 /* Total number of float blocks now in use. */
2211 /* Free-list of Lisp_Floats. */
2213 struct Lisp_Float
*float_free_list
;
2216 /* Initialize float allocation. */
2222 float_block_index
= FLOAT_BLOCK_SIZE
; /* Force alloc of new float_block. */
2223 float_free_list
= 0;
2228 /* Explicitly free a float cell by putting it on the free-list. */
2232 struct Lisp_Float
*ptr
;
2234 *(struct Lisp_Float
**)&ptr
->data
= float_free_list
;
2235 float_free_list
= ptr
;
2239 /* Return a new float object with value FLOAT_VALUE. */
2242 make_float (float_value
)
2245 register Lisp_Object val
;
2247 if (float_free_list
)
2249 /* We use the data field for chaining the free list
2250 so that we won't use the same field that has the mark bit. */
2251 XSETFLOAT (val
, float_free_list
);
2252 float_free_list
= *(struct Lisp_Float
**)&float_free_list
->data
;
2256 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2258 register struct float_block
*new;
2260 new = (struct float_block
*) lisp_align_malloc (sizeof *new,
2262 new->next
= float_block
;
2263 bzero ((char *) new->gcmarkbits
, sizeof new->gcmarkbits
);
2265 float_block_index
= 0;
2268 XSETFLOAT (val
, &float_block
->floats
[float_block_index
]);
2269 float_block_index
++;
2272 XFLOAT_DATA (val
) = float_value
;
2273 eassert (!FLOAT_MARKED_P (XFLOAT (val
)));
2274 consing_since_gc
+= sizeof (struct Lisp_Float
);
2281 /***********************************************************************
2283 ***********************************************************************/
2285 /* We store cons cells inside of cons_blocks, allocating a new
2286 cons_block with malloc whenever necessary. Cons cells reclaimed by
2287 GC are put on a free list to be reallocated before allocating
2288 any new cons cells from the latest cons_block. */
2290 #define CONS_BLOCK_SIZE \
2291 (((BLOCK_BYTES - sizeof (struct cons_block *)) * CHAR_BIT) \
2292 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2294 #define CONS_BLOCK(fptr) \
2295 ((struct cons_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2297 #define CONS_INDEX(fptr) \
2298 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2302 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2303 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2304 int gcmarkbits
[1 + CONS_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2305 struct cons_block
*next
;
2308 #define CONS_MARKED_P(fptr) \
2309 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2311 #define CONS_MARK(fptr) \
2312 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2314 #define CONS_UNMARK(fptr) \
2315 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2317 /* Current cons_block. */
2319 struct cons_block
*cons_block
;
2321 /* Index of first unused Lisp_Cons in the current block. */
2323 int cons_block_index
;
2325 /* Free-list of Lisp_Cons structures. */
2327 struct Lisp_Cons
*cons_free_list
;
2329 /* Total number of cons blocks now in use. */
2334 /* Initialize cons allocation. */
2340 cons_block_index
= CONS_BLOCK_SIZE
; /* Force alloc of new cons_block. */
2346 /* Explicitly free a cons cell by putting it on the free-list. */
2350 struct Lisp_Cons
*ptr
;
2352 *(struct Lisp_Cons
**)&ptr
->cdr
= cons_free_list
;
2356 cons_free_list
= ptr
;
2359 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
2360 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2362 Lisp_Object car
, cdr
;
2364 register Lisp_Object val
;
2368 /* We use the cdr for chaining the free list
2369 so that we won't use the same field that has the mark bit. */
2370 XSETCONS (val
, cons_free_list
);
2371 cons_free_list
= *(struct Lisp_Cons
**)&cons_free_list
->cdr
;
2375 if (cons_block_index
== CONS_BLOCK_SIZE
)
2377 register struct cons_block
*new;
2378 new = (struct cons_block
*) lisp_align_malloc (sizeof *new,
2380 bzero ((char *) new->gcmarkbits
, sizeof new->gcmarkbits
);
2381 new->next
= cons_block
;
2383 cons_block_index
= 0;
2386 XSETCONS (val
, &cons_block
->conses
[cons_block_index
]);
2392 eassert (!CONS_MARKED_P (XCONS (val
)));
2393 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2394 cons_cells_consed
++;
2398 /* Get an error now if there's any junk in the cons free list. */
2402 struct Lisp_Cons
*tail
= cons_free_list
;
2406 tail
= *(struct Lisp_Cons
**)&tail
->cdr
;
2410 /* Make a list of 2, 3, 4 or 5 specified objects. */
2414 Lisp_Object arg1
, arg2
;
2416 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2421 list3 (arg1
, arg2
, arg3
)
2422 Lisp_Object arg1
, arg2
, arg3
;
2424 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2429 list4 (arg1
, arg2
, arg3
, arg4
)
2430 Lisp_Object arg1
, arg2
, arg3
, arg4
;
2432 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2437 list5 (arg1
, arg2
, arg3
, arg4
, arg5
)
2438 Lisp_Object arg1
, arg2
, arg3
, arg4
, arg5
;
2440 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2441 Fcons (arg5
, Qnil
)))));
2445 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
2446 doc
: /* Return a newly created list with specified arguments as elements.
2447 Any number of arguments, even zero arguments, are allowed.
2448 usage: (list &rest OBJECTS) */)
2451 register Lisp_Object
*args
;
2453 register Lisp_Object val
;
2459 val
= Fcons (args
[nargs
], val
);
2465 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2466 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2468 register Lisp_Object length
, init
;
2470 register Lisp_Object val
;
2473 CHECK_NATNUM (length
);
2474 size
= XFASTINT (length
);
2479 val
= Fcons (init
, val
);
2484 val
= Fcons (init
, val
);
2489 val
= Fcons (init
, val
);
2494 val
= Fcons (init
, val
);
2499 val
= Fcons (init
, val
);
2514 /***********************************************************************
2516 ***********************************************************************/
2518 /* Singly-linked list of all vectors. */
2520 struct Lisp_Vector
*all_vectors
;
2522 /* Total number of vector-like objects now in use. */
2527 /* Value is a pointer to a newly allocated Lisp_Vector structure
2528 with room for LEN Lisp_Objects. */
2530 static struct Lisp_Vector
*
2531 allocate_vectorlike (len
, type
)
2535 struct Lisp_Vector
*p
;
2538 #ifdef DOUG_LEA_MALLOC
2539 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
2540 because mapped region contents are not preserved in
2543 mallopt (M_MMAP_MAX
, 0);
2547 nbytes
= sizeof *p
+ (len
- 1) * sizeof p
->contents
[0];
2548 p
= (struct Lisp_Vector
*) lisp_malloc (nbytes
, type
);
2550 #ifdef DOUG_LEA_MALLOC
2551 /* Back to a reasonable maximum of mmap'ed areas. */
2553 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2557 consing_since_gc
+= nbytes
;
2558 vector_cells_consed
+= len
;
2560 p
->next
= all_vectors
;
2567 /* Allocate a vector with NSLOTS slots. */
2569 struct Lisp_Vector
*
2570 allocate_vector (nslots
)
2573 struct Lisp_Vector
*v
= allocate_vectorlike (nslots
, MEM_TYPE_VECTOR
);
2579 /* Allocate other vector-like structures. */
2581 struct Lisp_Hash_Table
*
2582 allocate_hash_table ()
2584 EMACS_INT len
= VECSIZE (struct Lisp_Hash_Table
);
2585 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_HASH_TABLE
);
2589 for (i
= 0; i
< len
; ++i
)
2590 v
->contents
[i
] = Qnil
;
2592 return (struct Lisp_Hash_Table
*) v
;
2599 EMACS_INT len
= VECSIZE (struct window
);
2600 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_WINDOW
);
2603 for (i
= 0; i
< len
; ++i
)
2604 v
->contents
[i
] = Qnil
;
2607 return (struct window
*) v
;
2614 EMACS_INT len
= VECSIZE (struct frame
);
2615 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_FRAME
);
2618 for (i
= 0; i
< len
; ++i
)
2619 v
->contents
[i
] = make_number (0);
2621 return (struct frame
*) v
;
2625 struct Lisp_Process
*
2628 EMACS_INT len
= VECSIZE (struct Lisp_Process
);
2629 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_PROCESS
);
2632 for (i
= 0; i
< len
; ++i
)
2633 v
->contents
[i
] = Qnil
;
2636 return (struct Lisp_Process
*) v
;
2640 struct Lisp_Vector
*
2641 allocate_other_vector (len
)
2644 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_VECTOR
);
2647 for (i
= 0; i
< len
; ++i
)
2648 v
->contents
[i
] = Qnil
;
2655 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
2656 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
2657 See also the function `vector'. */)
2659 register Lisp_Object length
, init
;
2662 register EMACS_INT sizei
;
2664 register struct Lisp_Vector
*p
;
2666 CHECK_NATNUM (length
);
2667 sizei
= XFASTINT (length
);
2669 p
= allocate_vector (sizei
);
2670 for (index
= 0; index
< sizei
; index
++)
2671 p
->contents
[index
] = init
;
2673 XSETVECTOR (vector
, p
);
2678 DEFUN ("make-char-table", Fmake_char_table
, Smake_char_table
, 1, 2, 0,
2679 doc
: /* Return a newly created char-table, with purpose PURPOSE.
2680 Each element is initialized to INIT, which defaults to nil.
2681 PURPOSE should be a symbol which has a `char-table-extra-slots' property.
2682 The property's value should be an integer between 0 and 10. */)
2684 register Lisp_Object purpose
, init
;
2688 CHECK_SYMBOL (purpose
);
2689 n
= Fget (purpose
, Qchar_table_extra_slots
);
2691 if (XINT (n
) < 0 || XINT (n
) > 10)
2692 args_out_of_range (n
, Qnil
);
2693 /* Add 2 to the size for the defalt and parent slots. */
2694 vector
= Fmake_vector (make_number (CHAR_TABLE_STANDARD_SLOTS
+ XINT (n
)),
2696 XCHAR_TABLE (vector
)->top
= Qt
;
2697 XCHAR_TABLE (vector
)->parent
= Qnil
;
2698 XCHAR_TABLE (vector
)->purpose
= purpose
;
2699 XSETCHAR_TABLE (vector
, XCHAR_TABLE (vector
));
2704 /* Return a newly created sub char table with default value DEFALT.
2705 Since a sub char table does not appear as a top level Emacs Lisp
2706 object, we don't need a Lisp interface to make it. */
2709 make_sub_char_table (defalt
)
2713 = Fmake_vector (make_number (SUB_CHAR_TABLE_STANDARD_SLOTS
), Qnil
);
2714 XCHAR_TABLE (vector
)->top
= Qnil
;
2715 XCHAR_TABLE (vector
)->defalt
= defalt
;
2716 XSETCHAR_TABLE (vector
, XCHAR_TABLE (vector
));
2721 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
2722 doc
: /* Return a newly created vector with specified arguments as elements.
2723 Any number of arguments, even zero arguments, are allowed.
2724 usage: (vector &rest OBJECTS) */)
2729 register Lisp_Object len
, val
;
2731 register struct Lisp_Vector
*p
;
2733 XSETFASTINT (len
, nargs
);
2734 val
= Fmake_vector (len
, Qnil
);
2736 for (index
= 0; index
< nargs
; index
++)
2737 p
->contents
[index
] = args
[index
];
2742 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
2743 doc
: /* Create a byte-code object with specified arguments as elements.
2744 The arguments should be the arglist, bytecode-string, constant vector,
2745 stack size, (optional) doc string, and (optional) interactive spec.
2746 The first four arguments are required; at most six have any
2748 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
2753 register Lisp_Object len
, val
;
2755 register struct Lisp_Vector
*p
;
2757 XSETFASTINT (len
, nargs
);
2758 if (!NILP (Vpurify_flag
))
2759 val
= make_pure_vector ((EMACS_INT
) nargs
);
2761 val
= Fmake_vector (len
, Qnil
);
2763 if (STRINGP (args
[1]) && STRING_MULTIBYTE (args
[1]))
2764 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
2765 earlier because they produced a raw 8-bit string for byte-code
2766 and now such a byte-code string is loaded as multibyte while
2767 raw 8-bit characters converted to multibyte form. Thus, now we
2768 must convert them back to the original unibyte form. */
2769 args
[1] = Fstring_as_unibyte (args
[1]);
2772 for (index
= 0; index
< nargs
; index
++)
2774 if (!NILP (Vpurify_flag
))
2775 args
[index
] = Fpurecopy (args
[index
]);
2776 p
->contents
[index
] = args
[index
];
2778 XSETCOMPILED (val
, p
);
2784 /***********************************************************************
2786 ***********************************************************************/
2788 /* Each symbol_block is just under 1020 bytes long, since malloc
2789 really allocates in units of powers of two and uses 4 bytes for its
2792 #define SYMBOL_BLOCK_SIZE \
2793 ((1020 - sizeof (struct symbol_block *)) / sizeof (struct Lisp_Symbol))
2797 /* Place `symbols' first, to preserve alignment. */
2798 struct Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
2799 struct symbol_block
*next
;
2802 /* Current symbol block and index of first unused Lisp_Symbol
2805 struct symbol_block
*symbol_block
;
2806 int symbol_block_index
;
2808 /* List of free symbols. */
2810 struct Lisp_Symbol
*symbol_free_list
;
2812 /* Total number of symbol blocks now in use. */
2814 int n_symbol_blocks
;
2817 /* Initialize symbol allocation. */
2822 symbol_block
= NULL
;
2823 symbol_block_index
= SYMBOL_BLOCK_SIZE
;
2824 symbol_free_list
= 0;
2825 n_symbol_blocks
= 0;
2829 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
2830 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
2831 Its value and function definition are void, and its property list is nil. */)
2835 register Lisp_Object val
;
2836 register struct Lisp_Symbol
*p
;
2838 CHECK_STRING (name
);
2840 if (symbol_free_list
)
2842 XSETSYMBOL (val
, symbol_free_list
);
2843 symbol_free_list
= *(struct Lisp_Symbol
**)&symbol_free_list
->value
;
2847 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
2849 struct symbol_block
*new;
2850 new = (struct symbol_block
*) lisp_malloc (sizeof *new,
2852 new->next
= symbol_block
;
2854 symbol_block_index
= 0;
2857 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
]);
2858 symbol_block_index
++;
2864 p
->value
= Qunbound
;
2865 p
->function
= Qunbound
;
2868 p
->interned
= SYMBOL_UNINTERNED
;
2870 p
->indirect_variable
= 0;
2871 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
2878 /***********************************************************************
2879 Marker (Misc) Allocation
2880 ***********************************************************************/
2882 /* Allocation of markers and other objects that share that structure.
2883 Works like allocation of conses. */
2885 #define MARKER_BLOCK_SIZE \
2886 ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc))
2890 /* Place `markers' first, to preserve alignment. */
2891 union Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
2892 struct marker_block
*next
;
2895 struct marker_block
*marker_block
;
2896 int marker_block_index
;
2898 union Lisp_Misc
*marker_free_list
;
2900 /* Total number of marker blocks now in use. */
2902 int n_marker_blocks
;
2907 marker_block
= NULL
;
2908 marker_block_index
= MARKER_BLOCK_SIZE
;
2909 marker_free_list
= 0;
2910 n_marker_blocks
= 0;
2913 /* Return a newly allocated Lisp_Misc object, with no substructure. */
2920 if (marker_free_list
)
2922 XSETMISC (val
, marker_free_list
);
2923 marker_free_list
= marker_free_list
->u_free
.chain
;
2927 if (marker_block_index
== MARKER_BLOCK_SIZE
)
2929 struct marker_block
*new;
2930 new = (struct marker_block
*) lisp_malloc (sizeof *new,
2932 new->next
= marker_block
;
2934 marker_block_index
= 0;
2936 total_free_markers
+= MARKER_BLOCK_SIZE
;
2938 XSETMISC (val
, &marker_block
->markers
[marker_block_index
]);
2939 marker_block_index
++;
2942 --total_free_markers
;
2943 consing_since_gc
+= sizeof (union Lisp_Misc
);
2944 misc_objects_consed
++;
2945 XMARKER (val
)->gcmarkbit
= 0;
2949 /* Free a Lisp_Misc object */
2955 XMISC (misc
)->u_marker
.type
= Lisp_Misc_Free
;
2956 XMISC (misc
)->u_free
.chain
= marker_free_list
;
2957 marker_free_list
= XMISC (misc
);
2959 total_free_markers
++;
2962 /* Return a Lisp_Misc_Save_Value object containing POINTER and
2963 INTEGER. This is used to package C values to call record_unwind_protect.
2964 The unwind function can get the C values back using XSAVE_VALUE. */
2967 make_save_value (pointer
, integer
)
2971 register Lisp_Object val
;
2972 register struct Lisp_Save_Value
*p
;
2974 val
= allocate_misc ();
2975 XMISCTYPE (val
) = Lisp_Misc_Save_Value
;
2976 p
= XSAVE_VALUE (val
);
2977 p
->pointer
= pointer
;
2978 p
->integer
= integer
;
2983 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
2984 doc
: /* Return a newly allocated marker which does not point at any place. */)
2987 register Lisp_Object val
;
2988 register struct Lisp_Marker
*p
;
2990 val
= allocate_misc ();
2991 XMISCTYPE (val
) = Lisp_Misc_Marker
;
2997 p
->insertion_type
= 0;
3001 /* Put MARKER back on the free list after using it temporarily. */
3004 free_marker (marker
)
3007 unchain_marker (XMARKER (marker
));
3012 /* Return a newly created vector or string with specified arguments as
3013 elements. If all the arguments are characters that can fit
3014 in a string of events, make a string; otherwise, make a vector.
3016 Any number of arguments, even zero arguments, are allowed. */
3019 make_event_array (nargs
, args
)
3025 for (i
= 0; i
< nargs
; i
++)
3026 /* The things that fit in a string
3027 are characters that are in 0...127,
3028 after discarding the meta bit and all the bits above it. */
3029 if (!INTEGERP (args
[i
])
3030 || (XUINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
3031 return Fvector (nargs
, args
);
3033 /* Since the loop exited, we know that all the things in it are
3034 characters, so we can make a string. */
3038 result
= Fmake_string (make_number (nargs
), make_number (0));
3039 for (i
= 0; i
< nargs
; i
++)
3041 SSET (result
, i
, XINT (args
[i
]));
3042 /* Move the meta bit to the right place for a string char. */
3043 if (XINT (args
[i
]) & CHAR_META
)
3044 SSET (result
, i
, SREF (result
, i
) | 0x80);
3053 /************************************************************************
3055 ************************************************************************/
3057 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
3059 /* Conservative C stack marking requires a method to identify possibly
3060 live Lisp objects given a pointer value. We do this by keeping
3061 track of blocks of Lisp data that are allocated in a red-black tree
3062 (see also the comment of mem_node which is the type of nodes in
3063 that tree). Function lisp_malloc adds information for an allocated
3064 block to the red-black tree with calls to mem_insert, and function
3065 lisp_free removes it with mem_delete. Functions live_string_p etc
3066 call mem_find to lookup information about a given pointer in the
3067 tree, and use that to determine if the pointer points to a Lisp
3070 /* Initialize this part of alloc.c. */
3075 mem_z
.left
= mem_z
.right
= MEM_NIL
;
3076 mem_z
.parent
= NULL
;
3077 mem_z
.color
= MEM_BLACK
;
3078 mem_z
.start
= mem_z
.end
= NULL
;
3083 /* Value is a pointer to the mem_node containing START. Value is
3084 MEM_NIL if there is no node in the tree containing START. */
3086 static INLINE
struct mem_node
*
3092 if (start
< min_heap_address
|| start
> max_heap_address
)
3095 /* Make the search always successful to speed up the loop below. */
3096 mem_z
.start
= start
;
3097 mem_z
.end
= (char *) start
+ 1;
3100 while (start
< p
->start
|| start
>= p
->end
)
3101 p
= start
< p
->start
? p
->left
: p
->right
;
3106 /* Insert a new node into the tree for a block of memory with start
3107 address START, end address END, and type TYPE. Value is a
3108 pointer to the node that was inserted. */
3110 static struct mem_node
*
3111 mem_insert (start
, end
, type
)
3115 struct mem_node
*c
, *parent
, *x
;
3117 if (start
< min_heap_address
)
3118 min_heap_address
= start
;
3119 if (end
> max_heap_address
)
3120 max_heap_address
= end
;
3122 /* See where in the tree a node for START belongs. In this
3123 particular application, it shouldn't happen that a node is already
3124 present. For debugging purposes, let's check that. */
3128 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3130 while (c
!= MEM_NIL
)
3132 if (start
>= c
->start
&& start
< c
->end
)
3135 c
= start
< c
->start
? c
->left
: c
->right
;
3138 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3140 while (c
!= MEM_NIL
)
3143 c
= start
< c
->start
? c
->left
: c
->right
;
3146 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3148 /* Create a new node. */
3149 #ifdef GC_MALLOC_CHECK
3150 x
= (struct mem_node
*) _malloc_internal (sizeof *x
);
3154 x
= (struct mem_node
*) xmalloc (sizeof *x
);
3160 x
->left
= x
->right
= MEM_NIL
;
3163 /* Insert it as child of PARENT or install it as root. */
3166 if (start
< parent
->start
)
3174 /* Re-establish red-black tree properties. */
3175 mem_insert_fixup (x
);
3181 /* Re-establish the red-black properties of the tree, and thereby
3182 balance the tree, after node X has been inserted; X is always red. */
3185 mem_insert_fixup (x
)
3188 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3190 /* X is red and its parent is red. This is a violation of
3191 red-black tree property #3. */
3193 if (x
->parent
== x
->parent
->parent
->left
)
3195 /* We're on the left side of our grandparent, and Y is our
3197 struct mem_node
*y
= x
->parent
->parent
->right
;
3199 if (y
->color
== MEM_RED
)
3201 /* Uncle and parent are red but should be black because
3202 X is red. Change the colors accordingly and proceed
3203 with the grandparent. */
3204 x
->parent
->color
= MEM_BLACK
;
3205 y
->color
= MEM_BLACK
;
3206 x
->parent
->parent
->color
= MEM_RED
;
3207 x
= x
->parent
->parent
;
3211 /* Parent and uncle have different colors; parent is
3212 red, uncle is black. */
3213 if (x
== x
->parent
->right
)
3216 mem_rotate_left (x
);
3219 x
->parent
->color
= MEM_BLACK
;
3220 x
->parent
->parent
->color
= MEM_RED
;
3221 mem_rotate_right (x
->parent
->parent
);
3226 /* This is the symmetrical case of above. */
3227 struct mem_node
*y
= x
->parent
->parent
->left
;
3229 if (y
->color
== MEM_RED
)
3231 x
->parent
->color
= MEM_BLACK
;
3232 y
->color
= MEM_BLACK
;
3233 x
->parent
->parent
->color
= MEM_RED
;
3234 x
= x
->parent
->parent
;
3238 if (x
== x
->parent
->left
)
3241 mem_rotate_right (x
);
3244 x
->parent
->color
= MEM_BLACK
;
3245 x
->parent
->parent
->color
= MEM_RED
;
3246 mem_rotate_left (x
->parent
->parent
);
3251 /* The root may have been changed to red due to the algorithm. Set
3252 it to black so that property #5 is satisfied. */
3253 mem_root
->color
= MEM_BLACK
;
3269 /* Turn y's left sub-tree into x's right sub-tree. */
3272 if (y
->left
!= MEM_NIL
)
3273 y
->left
->parent
= x
;
3275 /* Y's parent was x's parent. */
3277 y
->parent
= x
->parent
;
3279 /* Get the parent to point to y instead of x. */
3282 if (x
== x
->parent
->left
)
3283 x
->parent
->left
= y
;
3285 x
->parent
->right
= y
;
3290 /* Put x on y's left. */
3304 mem_rotate_right (x
)
3307 struct mem_node
*y
= x
->left
;
3310 if (y
->right
!= MEM_NIL
)
3311 y
->right
->parent
= x
;
3314 y
->parent
= x
->parent
;
3317 if (x
== x
->parent
->right
)
3318 x
->parent
->right
= y
;
3320 x
->parent
->left
= y
;
3331 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
3337 struct mem_node
*x
, *y
;
3339 if (!z
|| z
== MEM_NIL
)
3342 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
3347 while (y
->left
!= MEM_NIL
)
3351 if (y
->left
!= MEM_NIL
)
3356 x
->parent
= y
->parent
;
3359 if (y
== y
->parent
->left
)
3360 y
->parent
->left
= x
;
3362 y
->parent
->right
= x
;
3369 z
->start
= y
->start
;
3374 if (y
->color
== MEM_BLACK
)
3375 mem_delete_fixup (x
);
3377 #ifdef GC_MALLOC_CHECK
3385 /* Re-establish the red-black properties of the tree, after a
3389 mem_delete_fixup (x
)
3392 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
3394 if (x
== x
->parent
->left
)
3396 struct mem_node
*w
= x
->parent
->right
;
3398 if (w
->color
== MEM_RED
)
3400 w
->color
= MEM_BLACK
;
3401 x
->parent
->color
= MEM_RED
;
3402 mem_rotate_left (x
->parent
);
3403 w
= x
->parent
->right
;
3406 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
3413 if (w
->right
->color
== MEM_BLACK
)
3415 w
->left
->color
= MEM_BLACK
;
3417 mem_rotate_right (w
);
3418 w
= x
->parent
->right
;
3420 w
->color
= x
->parent
->color
;
3421 x
->parent
->color
= MEM_BLACK
;
3422 w
->right
->color
= MEM_BLACK
;
3423 mem_rotate_left (x
->parent
);
3429 struct mem_node
*w
= x
->parent
->left
;
3431 if (w
->color
== MEM_RED
)
3433 w
->color
= MEM_BLACK
;
3434 x
->parent
->color
= MEM_RED
;
3435 mem_rotate_right (x
->parent
);
3436 w
= x
->parent
->left
;
3439 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
3446 if (w
->left
->color
== MEM_BLACK
)
3448 w
->right
->color
= MEM_BLACK
;
3450 mem_rotate_left (w
);
3451 w
= x
->parent
->left
;
3454 w
->color
= x
->parent
->color
;
3455 x
->parent
->color
= MEM_BLACK
;
3456 w
->left
->color
= MEM_BLACK
;
3457 mem_rotate_right (x
->parent
);
3463 x
->color
= MEM_BLACK
;
3467 /* Value is non-zero if P is a pointer to a live Lisp string on
3468 the heap. M is a pointer to the mem_block for P. */
3471 live_string_p (m
, p
)
3475 if (m
->type
== MEM_TYPE_STRING
)
3477 struct string_block
*b
= (struct string_block
*) m
->start
;
3478 int offset
= (char *) p
- (char *) &b
->strings
[0];
3480 /* P must point to the start of a Lisp_String structure, and it
3481 must not be on the free-list. */
3483 && offset
% sizeof b
->strings
[0] == 0
3484 && offset
< (STRING_BLOCK_SIZE
* sizeof b
->strings
[0])
3485 && ((struct Lisp_String
*) p
)->data
!= NULL
);
3492 /* Value is non-zero if P is a pointer to a live Lisp cons on
3493 the heap. M is a pointer to the mem_block for P. */
3500 if (m
->type
== MEM_TYPE_CONS
)
3502 struct cons_block
*b
= (struct cons_block
*) m
->start
;
3503 int offset
= (char *) p
- (char *) &b
->conses
[0];
3505 /* P must point to the start of a Lisp_Cons, not be
3506 one of the unused cells in the current cons block,
3507 and not be on the free-list. */
3509 && offset
% sizeof b
->conses
[0] == 0
3510 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
3512 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
3513 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
3520 /* Value is non-zero if P is a pointer to a live Lisp symbol on
3521 the heap. M is a pointer to the mem_block for P. */
3524 live_symbol_p (m
, p
)
3528 if (m
->type
== MEM_TYPE_SYMBOL
)
3530 struct symbol_block
*b
= (struct symbol_block
*) m
->start
;
3531 int offset
= (char *) p
- (char *) &b
->symbols
[0];
3533 /* P must point to the start of a Lisp_Symbol, not be
3534 one of the unused cells in the current symbol block,
3535 and not be on the free-list. */
3537 && offset
% sizeof b
->symbols
[0] == 0
3538 && offset
< (SYMBOL_BLOCK_SIZE
* sizeof b
->symbols
[0])
3539 && (b
!= symbol_block
3540 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
3541 && !EQ (((struct Lisp_Symbol
*) p
)->function
, Vdead
));
3548 /* Value is non-zero if P is a pointer to a live Lisp float on
3549 the heap. M is a pointer to the mem_block for P. */
3556 if (m
->type
== MEM_TYPE_FLOAT
)
3558 struct float_block
*b
= (struct float_block
*) m
->start
;
3559 int offset
= (char *) p
- (char *) &b
->floats
[0];
3561 /* P must point to the start of a Lisp_Float and not be
3562 one of the unused cells in the current float block. */
3564 && offset
% sizeof b
->floats
[0] == 0
3565 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
3566 && (b
!= float_block
3567 || offset
/ sizeof b
->floats
[0] < float_block_index
));
3574 /* Value is non-zero if P is a pointer to a live Lisp Misc on
3575 the heap. M is a pointer to the mem_block for P. */
3582 if (m
->type
== MEM_TYPE_MISC
)
3584 struct marker_block
*b
= (struct marker_block
*) m
->start
;
3585 int offset
= (char *) p
- (char *) &b
->markers
[0];
3587 /* P must point to the start of a Lisp_Misc, not be
3588 one of the unused cells in the current misc block,
3589 and not be on the free-list. */
3591 && offset
% sizeof b
->markers
[0] == 0
3592 && offset
< (MARKER_BLOCK_SIZE
* sizeof b
->markers
[0])
3593 && (b
!= marker_block
3594 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
3595 && ((union Lisp_Misc
*) p
)->u_marker
.type
!= Lisp_Misc_Free
);
3602 /* Value is non-zero if P is a pointer to a live vector-like object.
3603 M is a pointer to the mem_block for P. */
3606 live_vector_p (m
, p
)
3610 return (p
== m
->start
3611 && m
->type
>= MEM_TYPE_VECTOR
3612 && m
->type
<= MEM_TYPE_WINDOW
);
3616 /* Value is non-zero if P is a pointer to a live buffer. M is a
3617 pointer to the mem_block for P. */
3620 live_buffer_p (m
, p
)
3624 /* P must point to the start of the block, and the buffer
3625 must not have been killed. */
3626 return (m
->type
== MEM_TYPE_BUFFER
3628 && !NILP (((struct buffer
*) p
)->name
));
3631 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
3635 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3637 /* Array of objects that are kept alive because the C stack contains
3638 a pattern that looks like a reference to them . */
3640 #define MAX_ZOMBIES 10
3641 static Lisp_Object zombies
[MAX_ZOMBIES
];
3643 /* Number of zombie objects. */
3645 static int nzombies
;
3647 /* Number of garbage collections. */
3651 /* Average percentage of zombies per collection. */
3653 static double avg_zombies
;
3655 /* Max. number of live and zombie objects. */
3657 static int max_live
, max_zombies
;
3659 /* Average number of live objects per GC. */
3661 static double avg_live
;
3663 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
3664 doc
: /* Show information about live and zombie objects. */)
3667 Lisp_Object args
[8], zombie_list
= Qnil
;
3669 for (i
= 0; i
< nzombies
; i
++)
3670 zombie_list
= Fcons (zombies
[i
], zombie_list
);
3671 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
3672 args
[1] = make_number (ngcs
);
3673 args
[2] = make_float (avg_live
);
3674 args
[3] = make_float (avg_zombies
);
3675 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
3676 args
[5] = make_number (max_live
);
3677 args
[6] = make_number (max_zombies
);
3678 args
[7] = zombie_list
;
3679 return Fmessage (8, args
);
3682 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
3685 /* Mark OBJ if we can prove it's a Lisp_Object. */
3688 mark_maybe_object (obj
)
3691 void *po
= (void *) XPNTR (obj
);
3692 struct mem_node
*m
= mem_find (po
);
3698 switch (XGCTYPE (obj
))
3701 mark_p
= (live_string_p (m
, po
)
3702 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
3706 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
3710 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
3714 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
3717 case Lisp_Vectorlike
:
3718 /* Note: can't check GC_BUFFERP before we know it's a
3719 buffer because checking that dereferences the pointer
3720 PO which might point anywhere. */
3721 if (live_vector_p (m
, po
))
3722 mark_p
= !GC_SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
3723 else if (live_buffer_p (m
, po
))
3724 mark_p
= GC_BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
3728 mark_p
= (live_misc_p (m
, po
) && !XMARKER (obj
)->gcmarkbit
);
3732 case Lisp_Type_Limit
:
3738 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3739 if (nzombies
< MAX_ZOMBIES
)
3740 zombies
[nzombies
] = obj
;
3749 /* If P points to Lisp data, mark that as live if it isn't already
3753 mark_maybe_pointer (p
)
3758 /* Quickly rule out some values which can't point to Lisp data. We
3759 assume that Lisp data is aligned on even addresses. */
3760 if ((EMACS_INT
) p
& 1)
3766 Lisp_Object obj
= Qnil
;
3770 case MEM_TYPE_NON_LISP
:
3771 /* Nothing to do; not a pointer to Lisp memory. */
3774 case MEM_TYPE_BUFFER
:
3775 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P((struct buffer
*)p
))
3776 XSETVECTOR (obj
, p
);
3780 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
3784 case MEM_TYPE_STRING
:
3785 if (live_string_p (m
, p
)
3786 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
3787 XSETSTRING (obj
, p
);
3791 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
3795 case MEM_TYPE_SYMBOL
:
3796 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
3797 XSETSYMBOL (obj
, p
);
3800 case MEM_TYPE_FLOAT
:
3801 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
3805 case MEM_TYPE_VECTOR
:
3806 case MEM_TYPE_PROCESS
:
3807 case MEM_TYPE_HASH_TABLE
:
3808 case MEM_TYPE_FRAME
:
3809 case MEM_TYPE_WINDOW
:
3810 if (live_vector_p (m
, p
))
3813 XSETVECTOR (tem
, p
);
3814 if (!GC_SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
3829 /* Mark Lisp objects referenced from the address range START..END. */
3832 mark_memory (start
, end
)
3838 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3842 /* Make START the pointer to the start of the memory region,
3843 if it isn't already. */
3851 /* Mark Lisp_Objects. */
3852 for (p
= (Lisp_Object
*) start
; (void *) p
< end
; ++p
)
3853 mark_maybe_object (*p
);
3855 /* Mark Lisp data pointed to. This is necessary because, in some
3856 situations, the C compiler optimizes Lisp objects away, so that
3857 only a pointer to them remains. Example:
3859 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
3862 Lisp_Object obj = build_string ("test");
3863 struct Lisp_String *s = XSTRING (obj);
3864 Fgarbage_collect ();
3865 fprintf (stderr, "test `%s'\n", s->data);
3869 Here, `obj' isn't really used, and the compiler optimizes it
3870 away. The only reference to the life string is through the
3873 for (pp
= (void **) start
; (void *) pp
< end
; ++pp
)
3874 mark_maybe_pointer (*pp
);
3877 /* setjmp will work with GCC unless NON_SAVING_SETJMP is defined in
3878 the GCC system configuration. In gcc 3.2, the only systems for
3879 which this is so are i386-sco5 non-ELF, i386-sysv3 (maybe included
3880 by others?) and ns32k-pc532-min. */
3882 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
3884 static int setjmp_tested_p
, longjmps_done
;
3886 #define SETJMP_WILL_LIKELY_WORK "\
3888 Emacs garbage collector has been changed to use conservative stack\n\
3889 marking. Emacs has determined that the method it uses to do the\n\
3890 marking will likely work on your system, but this isn't sure.\n\
3892 If you are a system-programmer, or can get the help of a local wizard\n\
3893 who is, please take a look at the function mark_stack in alloc.c, and\n\
3894 verify that the methods used are appropriate for your system.\n\
3896 Please mail the result to <emacs-devel@gnu.org>.\n\
3899 #define SETJMP_WILL_NOT_WORK "\
3901 Emacs garbage collector has been changed to use conservative stack\n\
3902 marking. Emacs has determined that the default method it uses to do the\n\
3903 marking will not work on your system. We will need a system-dependent\n\
3904 solution for your system.\n\
3906 Please take a look at the function mark_stack in alloc.c, and\n\
3907 try to find a way to make it work on your system.\n\
3909 Note that you may get false negatives, depending on the compiler.\n\
3910 In particular, you need to use -O with GCC for this test.\n\
3912 Please mail the result to <emacs-devel@gnu.org>.\n\
3916 /* Perform a quick check if it looks like setjmp saves registers in a
3917 jmp_buf. Print a message to stderr saying so. When this test
3918 succeeds, this is _not_ a proof that setjmp is sufficient for
3919 conservative stack marking. Only the sources or a disassembly
3930 /* Arrange for X to be put in a register. */
3936 if (longjmps_done
== 1)
3938 /* Came here after the longjmp at the end of the function.
3940 If x == 1, the longjmp has restored the register to its
3941 value before the setjmp, and we can hope that setjmp
3942 saves all such registers in the jmp_buf, although that
3945 For other values of X, either something really strange is
3946 taking place, or the setjmp just didn't save the register. */
3949 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
3952 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
3959 if (longjmps_done
== 1)
3963 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
3966 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
3968 /* Abort if anything GCPRO'd doesn't survive the GC. */
3976 for (p
= gcprolist
; p
; p
= p
->next
)
3977 for (i
= 0; i
< p
->nvars
; ++i
)
3978 if (!survives_gc_p (p
->var
[i
]))
3979 /* FIXME: It's not necessarily a bug. It might just be that the
3980 GCPRO is unnecessary or should release the object sooner. */
3984 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3991 fprintf (stderr
, "\nZombies kept alive = %d:\n", nzombies
);
3992 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
3994 fprintf (stderr
, " %d = ", i
);
3995 debug_print (zombies
[i
]);
3999 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4002 /* Mark live Lisp objects on the C stack.
4004 There are several system-dependent problems to consider when
4005 porting this to new architectures:
4009 We have to mark Lisp objects in CPU registers that can hold local
4010 variables or are used to pass parameters.
4012 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
4013 something that either saves relevant registers on the stack, or
4014 calls mark_maybe_object passing it each register's contents.
4016 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
4017 implementation assumes that calling setjmp saves registers we need
4018 to see in a jmp_buf which itself lies on the stack. This doesn't
4019 have to be true! It must be verified for each system, possibly
4020 by taking a look at the source code of setjmp.
4024 Architectures differ in the way their processor stack is organized.
4025 For example, the stack might look like this
4028 | Lisp_Object | size = 4
4030 | something else | size = 2
4032 | Lisp_Object | size = 4
4036 In such a case, not every Lisp_Object will be aligned equally. To
4037 find all Lisp_Object on the stack it won't be sufficient to walk
4038 the stack in steps of 4 bytes. Instead, two passes will be
4039 necessary, one starting at the start of the stack, and a second
4040 pass starting at the start of the stack + 2. Likewise, if the
4041 minimal alignment of Lisp_Objects on the stack is 1, four passes
4042 would be necessary, each one starting with one byte more offset
4043 from the stack start.
4045 The current code assumes by default that Lisp_Objects are aligned
4046 equally on the stack. */
4053 volatile int stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
4056 /* This trick flushes the register windows so that all the state of
4057 the process is contained in the stack. */
4058 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
4059 needed on ia64 too. See mach_dep.c, where it also says inline
4060 assembler doesn't work with relevant proprietary compilers. */
4065 /* Save registers that we need to see on the stack. We need to see
4066 registers used to hold register variables and registers used to
4068 #ifdef GC_SAVE_REGISTERS_ON_STACK
4069 GC_SAVE_REGISTERS_ON_STACK (end
);
4070 #else /* not GC_SAVE_REGISTERS_ON_STACK */
4072 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
4073 setjmp will definitely work, test it
4074 and print a message with the result
4076 if (!setjmp_tested_p
)
4078 setjmp_tested_p
= 1;
4081 #endif /* GC_SETJMP_WORKS */
4084 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
4085 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
4087 /* This assumes that the stack is a contiguous region in memory. If
4088 that's not the case, something has to be done here to iterate
4089 over the stack segments. */
4090 #ifndef GC_LISP_OBJECT_ALIGNMENT
4092 #define GC_LISP_OBJECT_ALIGNMENT __alignof__ (Lisp_Object)
4094 #define GC_LISP_OBJECT_ALIGNMENT sizeof (Lisp_Object)
4097 for (i
= 0; i
< sizeof (Lisp_Object
); i
+= GC_LISP_OBJECT_ALIGNMENT
)
4098 mark_memory ((char *) stack_base
+ i
, end
);
4100 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4106 #endif /* GC_MARK_STACK != 0 */
4110 /***********************************************************************
4111 Pure Storage Management
4112 ***********************************************************************/
4114 /* Allocate room for SIZE bytes from pure Lisp storage and return a
4115 pointer to it. TYPE is the Lisp type for which the memory is
4116 allocated. TYPE < 0 means it's not used for a Lisp object.
4118 If store_pure_type_info is set and TYPE is >= 0, the type of
4119 the allocated object is recorded in pure_types. */
4121 static POINTER_TYPE
*
4122 pure_alloc (size
, type
)
4126 POINTER_TYPE
*result
;
4128 size_t alignment
= (1 << GCTYPEBITS
);
4130 size_t alignment
= sizeof (EMACS_INT
);
4132 /* Give Lisp_Floats an extra alignment. */
4133 if (type
== Lisp_Float
)
4135 #if defined __GNUC__ && __GNUC__ >= 2
4136 alignment
= __alignof (struct Lisp_Float
);
4138 alignment
= sizeof (struct Lisp_Float
);
4144 result
= ALIGN (purebeg
+ pure_bytes_used
, alignment
);
4145 pure_bytes_used
= ((char *)result
- (char *)purebeg
) + size
;
4147 if (pure_bytes_used
<= pure_size
)
4150 /* Don't allocate a large amount here,
4151 because it might get mmap'd and then its address
4152 might not be usable. */
4153 purebeg
= (char *) xmalloc (10000);
4155 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
4156 pure_bytes_used
= 0;
4161 /* Print a warning if PURESIZE is too small. */
4166 if (pure_bytes_used_before_overflow
)
4167 message ("Pure Lisp storage overflow (approx. %d bytes needed)",
4168 (int) (pure_bytes_used
+ pure_bytes_used_before_overflow
));
4172 /* Return a string allocated in pure space. DATA is a buffer holding
4173 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
4174 non-zero means make the result string multibyte.
4176 Must get an error if pure storage is full, since if it cannot hold
4177 a large string it may be able to hold conses that point to that
4178 string; then the string is not protected from gc. */
4181 make_pure_string (data
, nchars
, nbytes
, multibyte
)
4187 struct Lisp_String
*s
;
4189 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4190 s
->data
= (unsigned char *) pure_alloc (nbytes
+ 1, -1);
4192 s
->size_byte
= multibyte
? nbytes
: -1;
4193 bcopy (data
, s
->data
, nbytes
);
4194 s
->data
[nbytes
] = '\0';
4195 s
->intervals
= NULL_INTERVAL
;
4196 XSETSTRING (string
, s
);
4201 /* Return a cons allocated from pure space. Give it pure copies
4202 of CAR as car and CDR as cdr. */
4205 pure_cons (car
, cdr
)
4206 Lisp_Object car
, cdr
;
4208 register Lisp_Object
new;
4209 struct Lisp_Cons
*p
;
4211 p
= (struct Lisp_Cons
*) pure_alloc (sizeof *p
, Lisp_Cons
);
4213 XSETCAR (new, Fpurecopy (car
));
4214 XSETCDR (new, Fpurecopy (cdr
));
4219 /* Value is a float object with value NUM allocated from pure space. */
4222 make_pure_float (num
)
4225 register Lisp_Object
new;
4226 struct Lisp_Float
*p
;
4228 p
= (struct Lisp_Float
*) pure_alloc (sizeof *p
, Lisp_Float
);
4230 XFLOAT_DATA (new) = num
;
4235 /* Return a vector with room for LEN Lisp_Objects allocated from
4239 make_pure_vector (len
)
4243 struct Lisp_Vector
*p
;
4244 size_t size
= sizeof *p
+ (len
- 1) * sizeof (Lisp_Object
);
4246 p
= (struct Lisp_Vector
*) pure_alloc (size
, Lisp_Vectorlike
);
4247 XSETVECTOR (new, p
);
4248 XVECTOR (new)->size
= len
;
4253 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
4254 doc
: /* Make a copy of OBJECT in pure storage.
4255 Recursively copies contents of vectors and cons cells.
4256 Does not copy symbols. Copies strings without text properties. */)
4258 register Lisp_Object obj
;
4260 if (NILP (Vpurify_flag
))
4263 if (PURE_POINTER_P (XPNTR (obj
)))
4267 return pure_cons (XCAR (obj
), XCDR (obj
));
4268 else if (FLOATP (obj
))
4269 return make_pure_float (XFLOAT_DATA (obj
));
4270 else if (STRINGP (obj
))
4271 return make_pure_string (SDATA (obj
), SCHARS (obj
),
4273 STRING_MULTIBYTE (obj
));
4274 else if (COMPILEDP (obj
) || VECTORP (obj
))
4276 register struct Lisp_Vector
*vec
;
4280 size
= XVECTOR (obj
)->size
;
4281 if (size
& PSEUDOVECTOR_FLAG
)
4282 size
&= PSEUDOVECTOR_SIZE_MASK
;
4283 vec
= XVECTOR (make_pure_vector (size
));
4284 for (i
= 0; i
< size
; i
++)
4285 vec
->contents
[i
] = Fpurecopy (XVECTOR (obj
)->contents
[i
]);
4286 if (COMPILEDP (obj
))
4287 XSETCOMPILED (obj
, vec
);
4289 XSETVECTOR (obj
, vec
);
4292 else if (MARKERP (obj
))
4293 error ("Attempt to copy a marker to pure storage");
4300 /***********************************************************************
4302 ***********************************************************************/
4304 /* Put an entry in staticvec, pointing at the variable with address
4308 staticpro (varaddress
)
4309 Lisp_Object
*varaddress
;
4311 staticvec
[staticidx
++] = varaddress
;
4312 if (staticidx
>= NSTATICS
)
4320 struct catchtag
*next
;
4324 /***********************************************************************
4326 ***********************************************************************/
4328 /* Temporarily prevent garbage collection. */
4331 inhibit_garbage_collection ()
4333 int count
= SPECPDL_INDEX ();
4334 int nbits
= min (VALBITS
, BITS_PER_INT
);
4336 specbind (Qgc_cons_threshold
, make_number (((EMACS_INT
) 1 << (nbits
- 1)) - 1));
4341 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
4342 doc
: /* Reclaim storage for Lisp objects no longer needed.
4343 Garbage collection happens automatically if you cons more than
4344 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
4345 `garbage-collect' normally returns a list with info on amount of space in use:
4346 ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)
4347 (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS
4348 (USED-FLOATS . FREE-FLOATS) (USED-INTERVALS . FREE-INTERVALS)
4349 (USED-STRINGS . FREE-STRINGS))
4350 However, if there was overflow in pure space, `garbage-collect'
4351 returns nil, because real GC can't be done. */)
4354 register struct specbinding
*bind
;
4355 struct catchtag
*catch;
4356 struct handler
*handler
;
4357 char stack_top_variable
;
4360 Lisp_Object total
[8];
4361 int count
= SPECPDL_INDEX ();
4362 EMACS_TIME t1
, t2
, t3
;
4367 EMACS_GET_TIME (t1
);
4369 /* Can't GC if pure storage overflowed because we can't determine
4370 if something is a pure object or not. */
4371 if (pure_bytes_used_before_overflow
)
4374 /* In case user calls debug_print during GC,
4375 don't let that cause a recursive GC. */
4376 consing_since_gc
= 0;
4378 /* Save what's currently displayed in the echo area. */
4379 message_p
= push_message ();
4380 record_unwind_protect (pop_message_unwind
, Qnil
);
4382 /* Save a copy of the contents of the stack, for debugging. */
4383 #if MAX_SAVE_STACK > 0
4384 if (NILP (Vpurify_flag
))
4386 i
= &stack_top_variable
- stack_bottom
;
4388 if (i
< MAX_SAVE_STACK
)
4390 if (stack_copy
== 0)
4391 stack_copy
= (char *) xmalloc (stack_copy_size
= i
);
4392 else if (stack_copy_size
< i
)
4393 stack_copy
= (char *) xrealloc (stack_copy
, (stack_copy_size
= i
));
4396 if ((EMACS_INT
) (&stack_top_variable
- stack_bottom
) > 0)
4397 bcopy (stack_bottom
, stack_copy
, i
);
4399 bcopy (&stack_top_variable
, stack_copy
, i
);
4403 #endif /* MAX_SAVE_STACK > 0 */
4405 if (garbage_collection_messages
)
4406 message1_nolog ("Garbage collecting...");
4410 shrink_regexp_cache ();
4412 /* Don't keep undo information around forever. */
4414 register struct buffer
*nextb
= all_buffers
;
4418 /* If a buffer's undo list is Qt, that means that undo is
4419 turned off in that buffer. Calling truncate_undo_list on
4420 Qt tends to return NULL, which effectively turns undo back on.
4421 So don't call truncate_undo_list if undo_list is Qt. */
4422 if (! EQ (nextb
->undo_list
, Qt
))
4424 = truncate_undo_list (nextb
->undo_list
, undo_limit
,
4425 undo_strong_limit
, undo_outer_limit
);
4427 /* Shrink buffer gaps, but skip indirect and dead buffers. */
4428 if (nextb
->base_buffer
== 0 && !NILP (nextb
->name
))
4430 /* If a buffer's gap size is more than 10% of the buffer
4431 size, or larger than 2000 bytes, then shrink it
4432 accordingly. Keep a minimum size of 20 bytes. */
4433 int size
= min (2000, max (20, (nextb
->text
->z_byte
/ 10)));
4435 if (nextb
->text
->gap_size
> size
)
4437 struct buffer
*save_current
= current_buffer
;
4438 current_buffer
= nextb
;
4439 make_gap (-(nextb
->text
->gap_size
- size
));
4440 current_buffer
= save_current
;
4444 nextb
= nextb
->next
;
4450 /* clear_marks (); */
4452 /* Mark all the special slots that serve as the roots of accessibility. */
4454 for (i
= 0; i
< staticidx
; i
++)
4455 mark_object (*staticvec
[i
]);
4457 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
4458 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
4462 register struct gcpro
*tail
;
4463 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
4464 for (i
= 0; i
< tail
->nvars
; i
++)
4465 mark_object (tail
->var
[i
]);
4470 for (bind
= specpdl
; bind
!= specpdl_ptr
; bind
++)
4472 mark_object (bind
->symbol
);
4473 mark_object (bind
->old_value
);
4475 for (catch = catchlist
; catch; catch = catch->next
)
4477 mark_object (catch->tag
);
4478 mark_object (catch->val
);
4480 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
4482 mark_object (handler
->handler
);
4483 mark_object (handler
->var
);
4488 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4494 extern void xg_mark_data ();
4499 /* Everything is now marked, except for the things that require special
4500 finalization, i.e. the undo_list.
4501 Look thru every buffer's undo list
4502 for elements that update markers that were not marked,
4505 register struct buffer
*nextb
= all_buffers
;
4509 /* If a buffer's undo list is Qt, that means that undo is
4510 turned off in that buffer. Calling truncate_undo_list on
4511 Qt tends to return NULL, which effectively turns undo back on.
4512 So don't call truncate_undo_list if undo_list is Qt. */
4513 if (! EQ (nextb
->undo_list
, Qt
))
4515 Lisp_Object tail
, prev
;
4516 tail
= nextb
->undo_list
;
4518 while (CONSP (tail
))
4520 if (GC_CONSP (XCAR (tail
))
4521 && GC_MARKERP (XCAR (XCAR (tail
)))
4522 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
4525 nextb
->undo_list
= tail
= XCDR (tail
);
4529 XSETCDR (prev
, tail
);
4539 /* Now that we have stripped the elements that need not be in the
4540 undo_list any more, we can finally mark the list. */
4541 mark_object (nextb
->undo_list
);
4543 nextb
= nextb
->next
;
4549 /* Clear the mark bits that we set in certain root slots. */
4551 unmark_byte_stack ();
4552 VECTOR_UNMARK (&buffer_defaults
);
4553 VECTOR_UNMARK (&buffer_local_symbols
);
4555 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
4561 /* clear_marks (); */
4564 consing_since_gc
= 0;
4565 if (gc_cons_threshold
< 10000)
4566 gc_cons_threshold
= 10000;
4568 if (garbage_collection_messages
)
4570 if (message_p
|| minibuf_level
> 0)
4573 message1_nolog ("Garbage collecting...done");
4576 unbind_to (count
, Qnil
);
4578 total
[0] = Fcons (make_number (total_conses
),
4579 make_number (total_free_conses
));
4580 total
[1] = Fcons (make_number (total_symbols
),
4581 make_number (total_free_symbols
));
4582 total
[2] = Fcons (make_number (total_markers
),
4583 make_number (total_free_markers
));
4584 total
[3] = make_number (total_string_size
);
4585 total
[4] = make_number (total_vector_size
);
4586 total
[5] = Fcons (make_number (total_floats
),
4587 make_number (total_free_floats
));
4588 total
[6] = Fcons (make_number (total_intervals
),
4589 make_number (total_free_intervals
));
4590 total
[7] = Fcons (make_number (total_strings
),
4591 make_number (total_free_strings
));
4593 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4595 /* Compute average percentage of zombies. */
4598 for (i
= 0; i
< 7; ++i
)
4599 if (CONSP (total
[i
]))
4600 nlive
+= XFASTINT (XCAR (total
[i
]));
4602 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
4603 max_live
= max (nlive
, max_live
);
4604 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
4605 max_zombies
= max (nzombies
, max_zombies
);
4610 if (!NILP (Vpost_gc_hook
))
4612 int count
= inhibit_garbage_collection ();
4613 safe_run_hooks (Qpost_gc_hook
);
4614 unbind_to (count
, Qnil
);
4617 /* Accumulate statistics. */
4618 EMACS_GET_TIME (t2
);
4619 EMACS_SUB_TIME (t3
, t2
, t1
);
4620 if (FLOATP (Vgc_elapsed
))
4621 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
) +
4623 EMACS_USECS (t3
) * 1.0e-6);
4626 return Flist (sizeof total
/ sizeof *total
, total
);
4630 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
4631 only interesting objects referenced from glyphs are strings. */
4634 mark_glyph_matrix (matrix
)
4635 struct glyph_matrix
*matrix
;
4637 struct glyph_row
*row
= matrix
->rows
;
4638 struct glyph_row
*end
= row
+ matrix
->nrows
;
4640 for (; row
< end
; ++row
)
4644 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
4646 struct glyph
*glyph
= row
->glyphs
[area
];
4647 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
4649 for (; glyph
< end_glyph
; ++glyph
)
4650 if (GC_STRINGP (glyph
->object
)
4651 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
4652 mark_object (glyph
->object
);
4658 /* Mark Lisp faces in the face cache C. */
4662 struct face_cache
*c
;
4667 for (i
= 0; i
< c
->used
; ++i
)
4669 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
4673 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
4674 mark_object (face
->lface
[j
]);
4681 #ifdef HAVE_WINDOW_SYSTEM
4683 /* Mark Lisp objects in image IMG. */
4689 mark_object (img
->spec
);
4691 if (!NILP (img
->data
.lisp_val
))
4692 mark_object (img
->data
.lisp_val
);
4696 /* Mark Lisp objects in image cache of frame F. It's done this way so
4697 that we don't have to include xterm.h here. */
4700 mark_image_cache (f
)
4703 forall_images_in_image_cache (f
, mark_image
);
4706 #endif /* HAVE_X_WINDOWS */
4710 /* Mark reference to a Lisp_Object.
4711 If the object referred to has not been seen yet, recursively mark
4712 all the references contained in it. */
4714 #define LAST_MARKED_SIZE 500
4715 Lisp_Object last_marked
[LAST_MARKED_SIZE
];
4716 int last_marked_index
;
4718 /* For debugging--call abort when we cdr down this many
4719 links of a list, in mark_object. In debugging,
4720 the call to abort will hit a breakpoint.
4721 Normally this is zero and the check never goes off. */
4722 int mark_object_loop_halt
;
4728 register Lisp_Object obj
= arg
;
4729 #ifdef GC_CHECK_MARKED_OBJECTS
4737 if (PURE_POINTER_P (XPNTR (obj
)))
4740 last_marked
[last_marked_index
++] = obj
;
4741 if (last_marked_index
== LAST_MARKED_SIZE
)
4742 last_marked_index
= 0;
4744 /* Perform some sanity checks on the objects marked here. Abort if
4745 we encounter an object we know is bogus. This increases GC time
4746 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
4747 #ifdef GC_CHECK_MARKED_OBJECTS
4749 po
= (void *) XPNTR (obj
);
4751 /* Check that the object pointed to by PO is known to be a Lisp
4752 structure allocated from the heap. */
4753 #define CHECK_ALLOCATED() \
4755 m = mem_find (po); \
4760 /* Check that the object pointed to by PO is live, using predicate
4762 #define CHECK_LIVE(LIVEP) \
4764 if (!LIVEP (m, po)) \
4768 /* Check both of the above conditions. */
4769 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
4771 CHECK_ALLOCATED (); \
4772 CHECK_LIVE (LIVEP); \
4775 #else /* not GC_CHECK_MARKED_OBJECTS */
4777 #define CHECK_ALLOCATED() (void) 0
4778 #define CHECK_LIVE(LIVEP) (void) 0
4779 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
4781 #endif /* not GC_CHECK_MARKED_OBJECTS */
4783 switch (SWITCH_ENUM_CAST (XGCTYPE (obj
)))
4787 register struct Lisp_String
*ptr
= XSTRING (obj
);
4788 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
4789 MARK_INTERVAL_TREE (ptr
->intervals
);
4791 #ifdef GC_CHECK_STRING_BYTES
4792 /* Check that the string size recorded in the string is the
4793 same as the one recorded in the sdata structure. */
4794 CHECK_STRING_BYTES (ptr
);
4795 #endif /* GC_CHECK_STRING_BYTES */
4799 case Lisp_Vectorlike
:
4800 #ifdef GC_CHECK_MARKED_OBJECTS
4802 if (m
== MEM_NIL
&& !GC_SUBRP (obj
)
4803 && po
!= &buffer_defaults
4804 && po
!= &buffer_local_symbols
)
4806 #endif /* GC_CHECK_MARKED_OBJECTS */
4808 if (GC_BUFFERP (obj
))
4810 if (!VECTOR_MARKED_P (XBUFFER (obj
)))
4812 #ifdef GC_CHECK_MARKED_OBJECTS
4813 if (po
!= &buffer_defaults
&& po
!= &buffer_local_symbols
)
4816 for (b
= all_buffers
; b
&& b
!= po
; b
= b
->next
)
4821 #endif /* GC_CHECK_MARKED_OBJECTS */
4825 else if (GC_SUBRP (obj
))
4827 else if (GC_COMPILEDP (obj
))
4828 /* We could treat this just like a vector, but it is better to
4829 save the COMPILED_CONSTANTS element for last and avoid
4832 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
4833 register EMACS_INT size
= ptr
->size
;
4836 if (VECTOR_MARKED_P (ptr
))
4837 break; /* Already marked */
4839 CHECK_LIVE (live_vector_p
);
4840 VECTOR_MARK (ptr
); /* Else mark it */
4841 size
&= PSEUDOVECTOR_SIZE_MASK
;
4842 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
4844 if (i
!= COMPILED_CONSTANTS
)
4845 mark_object (ptr
->contents
[i
]);
4847 obj
= ptr
->contents
[COMPILED_CONSTANTS
];
4850 else if (GC_FRAMEP (obj
))
4852 register struct frame
*ptr
= XFRAME (obj
);
4854 if (VECTOR_MARKED_P (ptr
)) break; /* Already marked */
4855 VECTOR_MARK (ptr
); /* Else mark it */
4857 CHECK_LIVE (live_vector_p
);
4858 mark_object (ptr
->name
);
4859 mark_object (ptr
->icon_name
);
4860 mark_object (ptr
->title
);
4861 mark_object (ptr
->focus_frame
);
4862 mark_object (ptr
->selected_window
);
4863 mark_object (ptr
->minibuffer_window
);
4864 mark_object (ptr
->param_alist
);
4865 mark_object (ptr
->scroll_bars
);
4866 mark_object (ptr
->condemned_scroll_bars
);
4867 mark_object (ptr
->menu_bar_items
);
4868 mark_object (ptr
->face_alist
);
4869 mark_object (ptr
->menu_bar_vector
);
4870 mark_object (ptr
->buffer_predicate
);
4871 mark_object (ptr
->buffer_list
);
4872 mark_object (ptr
->menu_bar_window
);
4873 mark_object (ptr
->tool_bar_window
);
4874 mark_face_cache (ptr
->face_cache
);
4875 #ifdef HAVE_WINDOW_SYSTEM
4876 mark_image_cache (ptr
);
4877 mark_object (ptr
->tool_bar_items
);
4878 mark_object (ptr
->desired_tool_bar_string
);
4879 mark_object (ptr
->current_tool_bar_string
);
4880 #endif /* HAVE_WINDOW_SYSTEM */
4882 else if (GC_BOOL_VECTOR_P (obj
))
4884 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
4886 if (VECTOR_MARKED_P (ptr
))
4887 break; /* Already marked */
4888 CHECK_LIVE (live_vector_p
);
4889 VECTOR_MARK (ptr
); /* Else mark it */
4891 else if (GC_WINDOWP (obj
))
4893 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
4894 struct window
*w
= XWINDOW (obj
);
4897 /* Stop if already marked. */
4898 if (VECTOR_MARKED_P (ptr
))
4902 CHECK_LIVE (live_vector_p
);
4905 /* There is no Lisp data above The member CURRENT_MATRIX in
4906 struct WINDOW. Stop marking when that slot is reached. */
4908 (char *) &ptr
->contents
[i
] < (char *) &w
->current_matrix
;
4910 mark_object (ptr
->contents
[i
]);
4912 /* Mark glyphs for leaf windows. Marking window matrices is
4913 sufficient because frame matrices use the same glyph
4915 if (NILP (w
->hchild
)
4917 && w
->current_matrix
)
4919 mark_glyph_matrix (w
->current_matrix
);
4920 mark_glyph_matrix (w
->desired_matrix
);
4923 else if (GC_HASH_TABLE_P (obj
))
4925 struct Lisp_Hash_Table
*h
= XHASH_TABLE (obj
);
4927 /* Stop if already marked. */
4928 if (VECTOR_MARKED_P (h
))
4932 CHECK_LIVE (live_vector_p
);
4935 /* Mark contents. */
4936 /* Do not mark next_free or next_weak.
4937 Being in the next_weak chain
4938 should not keep the hash table alive.
4939 No need to mark `count' since it is an integer. */
4940 mark_object (h
->test
);
4941 mark_object (h
->weak
);
4942 mark_object (h
->rehash_size
);
4943 mark_object (h
->rehash_threshold
);
4944 mark_object (h
->hash
);
4945 mark_object (h
->next
);
4946 mark_object (h
->index
);
4947 mark_object (h
->user_hash_function
);
4948 mark_object (h
->user_cmp_function
);
4950 /* If hash table is not weak, mark all keys and values.
4951 For weak tables, mark only the vector. */
4952 if (GC_NILP (h
->weak
))
4953 mark_object (h
->key_and_value
);
4955 VECTOR_MARK (XVECTOR (h
->key_and_value
));
4959 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
4960 register EMACS_INT size
= ptr
->size
;
4963 if (VECTOR_MARKED_P (ptr
)) break; /* Already marked */
4964 CHECK_LIVE (live_vector_p
);
4965 VECTOR_MARK (ptr
); /* Else mark it */
4966 if (size
& PSEUDOVECTOR_FLAG
)
4967 size
&= PSEUDOVECTOR_SIZE_MASK
;
4969 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
4970 mark_object (ptr
->contents
[i
]);
4976 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
4977 struct Lisp_Symbol
*ptrx
;
4979 if (ptr
->gcmarkbit
) break;
4980 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
4982 mark_object (ptr
->value
);
4983 mark_object (ptr
->function
);
4984 mark_object (ptr
->plist
);
4986 if (!PURE_POINTER_P (XSTRING (ptr
->xname
)))
4987 MARK_STRING (XSTRING (ptr
->xname
));
4988 MARK_INTERVAL_TREE (STRING_INTERVALS (ptr
->xname
));
4990 /* Note that we do not mark the obarray of the symbol.
4991 It is safe not to do so because nothing accesses that
4992 slot except to check whether it is nil. */
4996 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun */
4997 XSETSYMBOL (obj
, ptrx
);
5004 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
5005 if (XMARKER (obj
)->gcmarkbit
)
5007 XMARKER (obj
)->gcmarkbit
= 1;
5009 switch (XMISCTYPE (obj
))
5011 case Lisp_Misc_Buffer_Local_Value
:
5012 case Lisp_Misc_Some_Buffer_Local_Value
:
5014 register struct Lisp_Buffer_Local_Value
*ptr
5015 = XBUFFER_LOCAL_VALUE (obj
);
5016 /* If the cdr is nil, avoid recursion for the car. */
5017 if (EQ (ptr
->cdr
, Qnil
))
5019 obj
= ptr
->realvalue
;
5022 mark_object (ptr
->realvalue
);
5023 mark_object (ptr
->buffer
);
5024 mark_object (ptr
->frame
);
5029 case Lisp_Misc_Marker
:
5030 /* DO NOT mark thru the marker's chain.
5031 The buffer's markers chain does not preserve markers from gc;
5032 instead, markers are removed from the chain when freed by gc. */
5035 case Lisp_Misc_Intfwd
:
5036 case Lisp_Misc_Boolfwd
:
5037 case Lisp_Misc_Objfwd
:
5038 case Lisp_Misc_Buffer_Objfwd
:
5039 case Lisp_Misc_Kboard_Objfwd
:
5040 /* Don't bother with Lisp_Buffer_Objfwd,
5041 since all markable slots in current buffer marked anyway. */
5042 /* Don't need to do Lisp_Objfwd, since the places they point
5043 are protected with staticpro. */
5046 case Lisp_Misc_Save_Value
:
5049 register struct Lisp_Save_Value
*ptr
= XSAVE_VALUE (obj
);
5050 /* If DOGC is set, POINTER is the address of a memory
5051 area containing INTEGER potential Lisp_Objects. */
5054 Lisp_Object
*p
= (Lisp_Object
*) ptr
->pointer
;
5056 for (nelt
= ptr
->integer
; nelt
> 0; nelt
--, p
++)
5057 mark_maybe_object (*p
);
5063 case Lisp_Misc_Overlay
:
5065 struct Lisp_Overlay
*ptr
= XOVERLAY (obj
);
5066 mark_object (ptr
->start
);
5067 mark_object (ptr
->end
);
5068 mark_object (ptr
->plist
);
5071 XSETMISC (obj
, ptr
->next
);
5084 register struct Lisp_Cons
*ptr
= XCONS (obj
);
5085 if (CONS_MARKED_P (ptr
)) break;
5086 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
5088 /* If the cdr is nil, avoid recursion for the car. */
5089 if (EQ (ptr
->cdr
, Qnil
))
5095 mark_object (ptr
->car
);
5098 if (cdr_count
== mark_object_loop_halt
)
5104 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
5105 FLOAT_MARK (XFLOAT (obj
));
5116 #undef CHECK_ALLOCATED
5117 #undef CHECK_ALLOCATED_AND_LIVE
5120 /* Mark the pointers in a buffer structure. */
5126 register struct buffer
*buffer
= XBUFFER (buf
);
5127 register Lisp_Object
*ptr
, tmp
;
5128 Lisp_Object base_buffer
;
5130 VECTOR_MARK (buffer
);
5132 MARK_INTERVAL_TREE (BUF_INTERVALS (buffer
));
5134 /* For now, we just don't mark the undo_list. It's done later in
5135 a special way just before the sweep phase, and after stripping
5136 some of its elements that are not needed any more. */
5138 if (buffer
->overlays_before
)
5140 XSETMISC (tmp
, buffer
->overlays_before
);
5143 if (buffer
->overlays_after
)
5145 XSETMISC (tmp
, buffer
->overlays_after
);
5149 for (ptr
= &buffer
->name
;
5150 (char *)ptr
< (char *)buffer
+ sizeof (struct buffer
);
5154 /* If this is an indirect buffer, mark its base buffer. */
5155 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
5157 XSETBUFFER (base_buffer
, buffer
->base_buffer
);
5158 mark_buffer (base_buffer
);
5163 /* Value is non-zero if OBJ will survive the current GC because it's
5164 either marked or does not need to be marked to survive. */
5172 switch (XGCTYPE (obj
))
5179 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
5183 survives_p
= XMARKER (obj
)->gcmarkbit
;
5187 survives_p
= STRING_MARKED_P (XSTRING (obj
));
5190 case Lisp_Vectorlike
:
5191 survives_p
= GC_SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
5195 survives_p
= CONS_MARKED_P (XCONS (obj
));
5199 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
5206 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
5211 /* Sweep: find all structures not marked, and free them. */
5216 /* Remove or mark entries in weak hash tables.
5217 This must be done before any object is unmarked. */
5218 sweep_weak_hash_tables ();
5221 #ifdef GC_CHECK_STRING_BYTES
5222 if (!noninteractive
)
5223 check_string_bytes (1);
5226 /* Put all unmarked conses on free list */
5228 register struct cons_block
*cblk
;
5229 struct cons_block
**cprev
= &cons_block
;
5230 register int lim
= cons_block_index
;
5231 register int num_free
= 0, num_used
= 0;
5235 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
5239 for (i
= 0; i
< lim
; i
++)
5240 if (!CONS_MARKED_P (&cblk
->conses
[i
]))
5243 *(struct Lisp_Cons
**)&cblk
->conses
[i
].cdr
= cons_free_list
;
5244 cons_free_list
= &cblk
->conses
[i
];
5246 cons_free_list
->car
= Vdead
;
5252 CONS_UNMARK (&cblk
->conses
[i
]);
5254 lim
= CONS_BLOCK_SIZE
;
5255 /* If this block contains only free conses and we have already
5256 seen more than two blocks worth of free conses then deallocate
5258 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
5260 *cprev
= cblk
->next
;
5261 /* Unhook from the free list. */
5262 cons_free_list
= *(struct Lisp_Cons
**) &cblk
->conses
[0].cdr
;
5263 lisp_align_free (cblk
);
5268 num_free
+= this_free
;
5269 cprev
= &cblk
->next
;
5272 total_conses
= num_used
;
5273 total_free_conses
= num_free
;
5276 /* Put all unmarked floats on free list */
5278 register struct float_block
*fblk
;
5279 struct float_block
**fprev
= &float_block
;
5280 register int lim
= float_block_index
;
5281 register int num_free
= 0, num_used
= 0;
5283 float_free_list
= 0;
5285 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
5289 for (i
= 0; i
< lim
; i
++)
5290 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
5293 *(struct Lisp_Float
**)&fblk
->floats
[i
].data
= float_free_list
;
5294 float_free_list
= &fblk
->floats
[i
];
5299 FLOAT_UNMARK (&fblk
->floats
[i
]);
5301 lim
= FLOAT_BLOCK_SIZE
;
5302 /* If this block contains only free floats and we have already
5303 seen more than two blocks worth of free floats then deallocate
5305 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
5307 *fprev
= fblk
->next
;
5308 /* Unhook from the free list. */
5309 float_free_list
= *(struct Lisp_Float
**) &fblk
->floats
[0].data
;
5310 lisp_align_free (fblk
);
5315 num_free
+= this_free
;
5316 fprev
= &fblk
->next
;
5319 total_floats
= num_used
;
5320 total_free_floats
= num_free
;
5323 /* Put all unmarked intervals on free list */
5325 register struct interval_block
*iblk
;
5326 struct interval_block
**iprev
= &interval_block
;
5327 register int lim
= interval_block_index
;
5328 register int num_free
= 0, num_used
= 0;
5330 interval_free_list
= 0;
5332 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
5337 for (i
= 0; i
< lim
; i
++)
5339 if (!iblk
->intervals
[i
].gcmarkbit
)
5341 SET_INTERVAL_PARENT (&iblk
->intervals
[i
], interval_free_list
);
5342 interval_free_list
= &iblk
->intervals
[i
];
5348 iblk
->intervals
[i
].gcmarkbit
= 0;
5351 lim
= INTERVAL_BLOCK_SIZE
;
5352 /* If this block contains only free intervals and we have already
5353 seen more than two blocks worth of free intervals then
5354 deallocate this block. */
5355 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
5357 *iprev
= iblk
->next
;
5358 /* Unhook from the free list. */
5359 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
5361 n_interval_blocks
--;
5365 num_free
+= this_free
;
5366 iprev
= &iblk
->next
;
5369 total_intervals
= num_used
;
5370 total_free_intervals
= num_free
;
5373 /* Put all unmarked symbols on free list */
5375 register struct symbol_block
*sblk
;
5376 struct symbol_block
**sprev
= &symbol_block
;
5377 register int lim
= symbol_block_index
;
5378 register int num_free
= 0, num_used
= 0;
5380 symbol_free_list
= NULL
;
5382 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
5385 struct Lisp_Symbol
*sym
= sblk
->symbols
;
5386 struct Lisp_Symbol
*end
= sym
+ lim
;
5388 for (; sym
< end
; ++sym
)
5390 /* Check if the symbol was created during loadup. In such a case
5391 it might be pointed to by pure bytecode which we don't trace,
5392 so we conservatively assume that it is live. */
5393 int pure_p
= PURE_POINTER_P (XSTRING (sym
->xname
));
5395 if (!sym
->gcmarkbit
&& !pure_p
)
5397 *(struct Lisp_Symbol
**) &sym
->value
= symbol_free_list
;
5398 symbol_free_list
= sym
;
5400 symbol_free_list
->function
= Vdead
;
5408 UNMARK_STRING (XSTRING (sym
->xname
));
5413 lim
= SYMBOL_BLOCK_SIZE
;
5414 /* If this block contains only free symbols and we have already
5415 seen more than two blocks worth of free symbols then deallocate
5417 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
5419 *sprev
= sblk
->next
;
5420 /* Unhook from the free list. */
5421 symbol_free_list
= *(struct Lisp_Symbol
**)&sblk
->symbols
[0].value
;
5427 num_free
+= this_free
;
5428 sprev
= &sblk
->next
;
5431 total_symbols
= num_used
;
5432 total_free_symbols
= num_free
;
5435 /* Put all unmarked misc's on free list.
5436 For a marker, first unchain it from the buffer it points into. */
5438 register struct marker_block
*mblk
;
5439 struct marker_block
**mprev
= &marker_block
;
5440 register int lim
= marker_block_index
;
5441 register int num_free
= 0, num_used
= 0;
5443 marker_free_list
= 0;
5445 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
5450 for (i
= 0; i
< lim
; i
++)
5452 if (!mblk
->markers
[i
].u_marker
.gcmarkbit
)
5454 if (mblk
->markers
[i
].u_marker
.type
== Lisp_Misc_Marker
)
5455 unchain_marker (&mblk
->markers
[i
].u_marker
);
5456 /* Set the type of the freed object to Lisp_Misc_Free.
5457 We could leave the type alone, since nobody checks it,
5458 but this might catch bugs faster. */
5459 mblk
->markers
[i
].u_marker
.type
= Lisp_Misc_Free
;
5460 mblk
->markers
[i
].u_free
.chain
= marker_free_list
;
5461 marker_free_list
= &mblk
->markers
[i
];
5467 mblk
->markers
[i
].u_marker
.gcmarkbit
= 0;
5470 lim
= MARKER_BLOCK_SIZE
;
5471 /* If this block contains only free markers and we have already
5472 seen more than two blocks worth of free markers then deallocate
5474 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
5476 *mprev
= mblk
->next
;
5477 /* Unhook from the free list. */
5478 marker_free_list
= mblk
->markers
[0].u_free
.chain
;
5484 num_free
+= this_free
;
5485 mprev
= &mblk
->next
;
5489 total_markers
= num_used
;
5490 total_free_markers
= num_free
;
5493 /* Free all unmarked buffers */
5495 register struct buffer
*buffer
= all_buffers
, *prev
= 0, *next
;
5498 if (!VECTOR_MARKED_P (buffer
))
5501 prev
->next
= buffer
->next
;
5503 all_buffers
= buffer
->next
;
5504 next
= buffer
->next
;
5510 VECTOR_UNMARK (buffer
);
5511 UNMARK_BALANCE_INTERVALS (BUF_INTERVALS (buffer
));
5512 prev
= buffer
, buffer
= buffer
->next
;
5516 /* Free all unmarked vectors */
5518 register struct Lisp_Vector
*vector
= all_vectors
, *prev
= 0, *next
;
5519 total_vector_size
= 0;
5522 if (!VECTOR_MARKED_P (vector
))
5525 prev
->next
= vector
->next
;
5527 all_vectors
= vector
->next
;
5528 next
= vector
->next
;
5536 VECTOR_UNMARK (vector
);
5537 if (vector
->size
& PSEUDOVECTOR_FLAG
)
5538 total_vector_size
+= (PSEUDOVECTOR_SIZE_MASK
& vector
->size
);
5540 total_vector_size
+= vector
->size
;
5541 prev
= vector
, vector
= vector
->next
;
5545 #ifdef GC_CHECK_STRING_BYTES
5546 if (!noninteractive
)
5547 check_string_bytes (1);
5554 /* Debugging aids. */
5556 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
5557 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
5558 This may be helpful in debugging Emacs's memory usage.
5559 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
5564 XSETINT (end
, (EMACS_INT
) sbrk (0) / 1024);
5569 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
5570 doc
: /* Return a list of counters that measure how much consing there has been.
5571 Each of these counters increments for a certain kind of object.
5572 The counters wrap around from the largest positive integer to zero.
5573 Garbage collection does not decrease them.
5574 The elements of the value are as follows:
5575 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
5576 All are in units of 1 = one object consed
5577 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
5579 MISCS include overlays, markers, and some internal types.
5580 Frames, windows, buffers, and subprocesses count as vectors
5581 (but the contents of a buffer's text do not count here). */)
5584 Lisp_Object consed
[8];
5586 consed
[0] = make_number (min (MOST_POSITIVE_FIXNUM
, cons_cells_consed
));
5587 consed
[1] = make_number (min (MOST_POSITIVE_FIXNUM
, floats_consed
));
5588 consed
[2] = make_number (min (MOST_POSITIVE_FIXNUM
, vector_cells_consed
));
5589 consed
[3] = make_number (min (MOST_POSITIVE_FIXNUM
, symbols_consed
));
5590 consed
[4] = make_number (min (MOST_POSITIVE_FIXNUM
, string_chars_consed
));
5591 consed
[5] = make_number (min (MOST_POSITIVE_FIXNUM
, misc_objects_consed
));
5592 consed
[6] = make_number (min (MOST_POSITIVE_FIXNUM
, intervals_consed
));
5593 consed
[7] = make_number (min (MOST_POSITIVE_FIXNUM
, strings_consed
));
5595 return Flist (8, consed
);
5598 int suppress_checking
;
5600 die (msg
, file
, line
)
5605 fprintf (stderr
, "\r\nEmacs fatal error: %s:%d: %s\r\n",
5610 /* Initialization */
5615 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
5617 pure_size
= PURESIZE
;
5618 pure_bytes_used
= 0;
5619 pure_bytes_used_before_overflow
= 0;
5621 /* Initialize the list of free aligned blocks. */
5624 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
5626 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
5630 ignore_warnings
= 1;
5631 #ifdef DOUG_LEA_MALLOC
5632 mallopt (M_TRIM_THRESHOLD
, 128*1024); /* trim threshold */
5633 mallopt (M_MMAP_THRESHOLD
, 64*1024); /* mmap threshold */
5634 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* max. number of mmap'ed areas */
5644 malloc_hysteresis
= 32;
5646 malloc_hysteresis
= 0;
5649 spare_memory
= (char *) malloc (SPARE_MEMORY
);
5651 ignore_warnings
= 0;
5653 byte_stack_list
= 0;
5655 consing_since_gc
= 0;
5656 gc_cons_threshold
= 100000 * sizeof (Lisp_Object
);
5657 #ifdef VIRT_ADDR_VARIES
5658 malloc_sbrk_unused
= 1<<22; /* A large number */
5659 malloc_sbrk_used
= 100000; /* as reasonable as any number */
5660 #endif /* VIRT_ADDR_VARIES */
5667 byte_stack_list
= 0;
5669 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
5670 setjmp_tested_p
= longjmps_done
= 0;
5673 Vgc_elapsed
= make_float (0.0);
5680 DEFVAR_INT ("gc-cons-threshold", &gc_cons_threshold
,
5681 doc
: /* *Number of bytes of consing between garbage collections.
5682 Garbage collection can happen automatically once this many bytes have been
5683 allocated since the last garbage collection. All data types count.
5685 Garbage collection happens automatically only when `eval' is called.
5687 By binding this temporarily to a large number, you can effectively
5688 prevent garbage collection during a part of the program. */);
5690 DEFVAR_INT ("pure-bytes-used", &pure_bytes_used
,
5691 doc
: /* Number of bytes of sharable Lisp data allocated so far. */);
5693 DEFVAR_INT ("cons-cells-consed", &cons_cells_consed
,
5694 doc
: /* Number of cons cells that have been consed so far. */);
5696 DEFVAR_INT ("floats-consed", &floats_consed
,
5697 doc
: /* Number of floats that have been consed so far. */);
5699 DEFVAR_INT ("vector-cells-consed", &vector_cells_consed
,
5700 doc
: /* Number of vector cells that have been consed so far. */);
5702 DEFVAR_INT ("symbols-consed", &symbols_consed
,
5703 doc
: /* Number of symbols that have been consed so far. */);
5705 DEFVAR_INT ("string-chars-consed", &string_chars_consed
,
5706 doc
: /* Number of string characters that have been consed so far. */);
5708 DEFVAR_INT ("misc-objects-consed", &misc_objects_consed
,
5709 doc
: /* Number of miscellaneous objects that have been consed so far. */);
5711 DEFVAR_INT ("intervals-consed", &intervals_consed
,
5712 doc
: /* Number of intervals that have been consed so far. */);
5714 DEFVAR_INT ("strings-consed", &strings_consed
,
5715 doc
: /* Number of strings that have been consed so far. */);
5717 DEFVAR_LISP ("purify-flag", &Vpurify_flag
,
5718 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
5719 This means that certain objects should be allocated in shared (pure) space. */);
5721 DEFVAR_INT ("undo-limit", &undo_limit
,
5722 doc
: /* Keep no more undo information once it exceeds this size.
5723 This limit is applied when garbage collection happens.
5724 The size is counted as the number of bytes occupied,
5725 which includes both saved text and other data. */);
5728 DEFVAR_INT ("undo-strong-limit", &undo_strong_limit
,
5729 doc
: /* Don't keep more than this much size of undo information.
5730 A previous command which pushes the undo list past this size
5731 is entirely forgotten when GC happens.
5732 The size is counted as the number of bytes occupied,
5733 which includes both saved text and other data. */);
5734 undo_strong_limit
= 30000;
5736 DEFVAR_INT ("undo-outer-limit", &undo_outer_limit
,
5737 doc
: /* Don't keep more than this much size of undo information.
5738 If the current command has produced more than this much undo information,
5739 GC discards it. This is a last-ditch limit to prevent memory overflow.
5740 The size is counted as the number of bytes occupied,
5741 which includes both saved text and other data. */);
5742 undo_outer_limit
= 300000;
5744 DEFVAR_BOOL ("garbage-collection-messages", &garbage_collection_messages
,
5745 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
5746 garbage_collection_messages
= 0;
5748 DEFVAR_LISP ("post-gc-hook", &Vpost_gc_hook
,
5749 doc
: /* Hook run after garbage collection has finished. */);
5750 Vpost_gc_hook
= Qnil
;
5751 Qpost_gc_hook
= intern ("post-gc-hook");
5752 staticpro (&Qpost_gc_hook
);
5754 DEFVAR_LISP ("memory-signal-data", &Vmemory_signal_data
,
5755 doc
: /* Precomputed `signal' argument for memory-full error. */);
5756 /* We build this in advance because if we wait until we need it, we might
5757 not be able to allocate the memory to hold it. */
5760 build_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"));
5762 DEFVAR_LISP ("memory-full", &Vmemory_full
,
5763 doc
: /* Non-nil means we are handling a memory-full error. */);
5764 Vmemory_full
= Qnil
;
5766 staticpro (&Qgc_cons_threshold
);
5767 Qgc_cons_threshold
= intern ("gc-cons-threshold");
5769 staticpro (&Qchar_table_extra_slots
);
5770 Qchar_table_extra_slots
= intern ("char-table-extra-slots");
5772 DEFVAR_LISP ("gc-elapsed", &Vgc_elapsed
,
5773 doc
: /* Accumulated time elapsed in garbage collections.
5774 The time is in seconds as a floating point value. */);
5775 DEFVAR_INT ("gcs-done", &gcs_done
,
5776 doc
: /* Accumulated number of garbage collections done. */);
5781 defsubr (&Smake_byte_code
);
5782 defsubr (&Smake_list
);
5783 defsubr (&Smake_vector
);
5784 defsubr (&Smake_char_table
);
5785 defsubr (&Smake_string
);
5786 defsubr (&Smake_bool_vector
);
5787 defsubr (&Smake_symbol
);
5788 defsubr (&Smake_marker
);
5789 defsubr (&Spurecopy
);
5790 defsubr (&Sgarbage_collect
);
5791 defsubr (&Smemory_limit
);
5792 defsubr (&Smemory_use_counts
);
5794 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5795 defsubr (&Sgc_status
);
5799 /* arch-tag: 6695ca10-e3c5-4c2c-8bc3-ed26a7dda857
5800 (do not change this comment) */