1 /* Storage allocation and gc for GNU Emacs Lisp interpreter.
2 Copyright (C) 1985, 1986, 1988, 1993, 1994, 1995, 1997, 1998, 1999,
3 2000, 2001, 2002, 2003, 2004 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 #ifdef HAVE_GTK_AND_PTHREAD
38 /* This file is part of the core Lisp implementation, and thus must
39 deal with the real data structures. If the Lisp implementation is
40 replaced, this file likely will not be used. */
42 #undef HIDE_LISP_IMPLEMENTATION
45 #include "intervals.h"
51 #include "blockinput.h"
53 #include "syssignal.h"
56 /* GC_MALLOC_CHECK defined means perform validity checks of malloc'd
57 memory. Can do this only if using gmalloc.c. */
59 #if defined SYSTEM_MALLOC || defined DOUG_LEA_MALLOC
60 #undef GC_MALLOC_CHECK
66 extern POINTER_TYPE
*sbrk ();
69 #ifdef DOUG_LEA_MALLOC
72 /* malloc.h #defines this as size_t, at least in glibc2. */
73 #ifndef __malloc_size_t
74 #define __malloc_size_t int
77 /* Specify maximum number of areas to mmap. It would be nice to use a
78 value that explicitly means "no limit". */
80 #define MMAP_MAX_AREAS 100000000
82 #else /* not DOUG_LEA_MALLOC */
84 /* The following come from gmalloc.c. */
86 #define __malloc_size_t size_t
87 extern __malloc_size_t _bytes_used
;
88 extern __malloc_size_t __malloc_extra_blocks
;
90 #endif /* not DOUG_LEA_MALLOC */
92 #if ! defined (SYSTEM_MALLOC) && defined (HAVE_GTK_AND_PTHREAD)
94 /* When GTK uses the file chooser dialog, different backends can be loaded
95 dynamically. One such a backend is the Gnome VFS backend that gets loaded
96 if you run Gnome. That backend creates several threads and also allocates
99 If Emacs sets malloc hooks (! SYSTEM_MALLOC) and the emacs_blocked_*
100 functions below are called from malloc, there is a chance that one
101 of these threads preempts the Emacs main thread and the hook variables
102 end up in an inconsistent state. So we have a mutex to prevent that (note
103 that the backend handles concurrent access to malloc within its own threads
104 but Emacs code running in the main thread is not included in that control).
106 When UNBLOCK_INPUT is called, revoke_input_signal may be called. If this
107 happens in one of the backend threads we will have two threads that tries
108 to run Emacs code at once, and the code is not prepared for that.
109 To prevent that, we only call BLOCK/UNBLOCK from the main thread. */
111 static pthread_mutex_t alloc_mutex
;
113 #define BLOCK_INPUT_ALLOC \
116 pthread_mutex_lock (&alloc_mutex); \
117 if (pthread_self () == main_thread) \
121 #define UNBLOCK_INPUT_ALLOC \
124 if (pthread_self () == main_thread) \
126 pthread_mutex_unlock (&alloc_mutex); \
130 #else /* SYSTEM_MALLOC || not HAVE_GTK_AND_PTHREAD */
132 #define BLOCK_INPUT_ALLOC BLOCK_INPUT
133 #define UNBLOCK_INPUT_ALLOC UNBLOCK_INPUT
135 #endif /* SYSTEM_MALLOC || not HAVE_GTK_AND_PTHREAD */
137 /* Value of _bytes_used, when spare_memory was freed. */
139 static __malloc_size_t bytes_used_when_full
;
141 /* Mark, unmark, query mark bit of a Lisp string. S must be a pointer
142 to a struct Lisp_String. */
144 #define MARK_STRING(S) ((S)->size |= ARRAY_MARK_FLAG)
145 #define UNMARK_STRING(S) ((S)->size &= ~ARRAY_MARK_FLAG)
146 #define STRING_MARKED_P(S) ((S)->size & ARRAY_MARK_FLAG)
148 #define VECTOR_MARK(V) ((V)->size |= ARRAY_MARK_FLAG)
149 #define VECTOR_UNMARK(V) ((V)->size &= ~ARRAY_MARK_FLAG)
150 #define VECTOR_MARKED_P(V) ((V)->size & ARRAY_MARK_FLAG)
152 /* Value is the number of bytes/chars of S, a pointer to a struct
153 Lisp_String. This must be used instead of STRING_BYTES (S) or
154 S->size during GC, because S->size contains the mark bit for
157 #define GC_STRING_BYTES(S) (STRING_BYTES (S))
158 #define GC_STRING_CHARS(S) ((S)->size & ~ARRAY_MARK_FLAG)
160 /* Number of bytes of consing done since the last gc. */
162 int consing_since_gc
;
164 /* Count the amount of consing of various sorts of space. */
166 EMACS_INT cons_cells_consed
;
167 EMACS_INT floats_consed
;
168 EMACS_INT vector_cells_consed
;
169 EMACS_INT symbols_consed
;
170 EMACS_INT string_chars_consed
;
171 EMACS_INT misc_objects_consed
;
172 EMACS_INT intervals_consed
;
173 EMACS_INT strings_consed
;
175 /* Number of bytes of consing since GC before another GC should be done. */
177 EMACS_INT gc_cons_threshold
;
179 /* Nonzero during GC. */
183 /* Nonzero means abort if try to GC.
184 This is for code which is written on the assumption that
185 no GC will happen, so as to verify that assumption. */
189 /* Nonzero means display messages at beginning and end of GC. */
191 int garbage_collection_messages
;
193 #ifndef VIRT_ADDR_VARIES
195 #endif /* VIRT_ADDR_VARIES */
196 int malloc_sbrk_used
;
198 #ifndef VIRT_ADDR_VARIES
200 #endif /* VIRT_ADDR_VARIES */
201 int malloc_sbrk_unused
;
203 /* Number of live and free conses etc. */
205 static int total_conses
, total_markers
, total_symbols
, total_vector_size
;
206 static int total_free_conses
, total_free_markers
, total_free_symbols
;
207 static int total_free_floats
, total_floats
;
209 /* Points to memory space allocated as "spare", to be freed if we run
212 static char *spare_memory
;
214 /* Amount of spare memory to keep in reserve. */
216 #define SPARE_MEMORY (1 << 14)
218 /* Number of extra blocks malloc should get when it needs more core. */
220 static int malloc_hysteresis
;
222 /* Non-nil means defun should do purecopy on the function definition. */
224 Lisp_Object Vpurify_flag
;
226 /* Non-nil means we are handling a memory-full error. */
228 Lisp_Object Vmemory_full
;
232 /* Initialize it to a nonzero value to force it into data space
233 (rather than bss space). That way unexec will remap it into text
234 space (pure), on some systems. We have not implemented the
235 remapping on more recent systems because this is less important
236 nowadays than in the days of small memories and timesharing. */
238 EMACS_INT pure
[PURESIZE
/ sizeof (EMACS_INT
)] = {1,};
239 #define PUREBEG (char *) pure
243 #define pure PURE_SEG_BITS /* Use shared memory segment */
244 #define PUREBEG (char *)PURE_SEG_BITS
246 #endif /* HAVE_SHM */
248 /* Pointer to the pure area, and its size. */
250 static char *purebeg
;
251 static size_t pure_size
;
253 /* Number of bytes of pure storage used before pure storage overflowed.
254 If this is non-zero, this implies that an overflow occurred. */
256 static size_t pure_bytes_used_before_overflow
;
258 /* Value is non-zero if P points into pure space. */
260 #define PURE_POINTER_P(P) \
261 (((PNTR_COMPARISON_TYPE) (P) \
262 < (PNTR_COMPARISON_TYPE) ((char *) purebeg + pure_size)) \
263 && ((PNTR_COMPARISON_TYPE) (P) \
264 >= (PNTR_COMPARISON_TYPE) purebeg))
266 /* Index in pure at which next pure object will be allocated.. */
268 EMACS_INT pure_bytes_used
;
270 /* If nonzero, this is a warning delivered by malloc and not yet
273 char *pending_malloc_warning
;
275 /* Pre-computed signal argument for use when memory is exhausted. */
277 Lisp_Object Vmemory_signal_data
;
279 /* Maximum amount of C stack to save when a GC happens. */
281 #ifndef MAX_SAVE_STACK
282 #define MAX_SAVE_STACK 16000
285 /* Buffer in which we save a copy of the C stack at each GC. */
290 /* Non-zero means ignore malloc warnings. Set during initialization.
291 Currently not used. */
295 Lisp_Object Qgc_cons_threshold
, Qchar_table_extra_slots
;
297 /* Hook run after GC has finished. */
299 Lisp_Object Vpost_gc_hook
, Qpost_gc_hook
;
301 Lisp_Object Vgc_elapsed
; /* accumulated elapsed time in GC */
302 EMACS_INT gcs_done
; /* accumulated GCs */
304 static void mark_buffer
P_ ((Lisp_Object
));
305 extern void mark_kboards
P_ ((void));
306 extern void mark_backtrace
P_ ((void));
307 static void gc_sweep
P_ ((void));
308 static void mark_glyph_matrix
P_ ((struct glyph_matrix
*));
309 static void mark_face_cache
P_ ((struct face_cache
*));
311 #ifdef HAVE_WINDOW_SYSTEM
312 static void mark_image
P_ ((struct image
*));
313 static void mark_image_cache
P_ ((struct frame
*));
314 #endif /* HAVE_WINDOW_SYSTEM */
316 static struct Lisp_String
*allocate_string
P_ ((void));
317 static void compact_small_strings
P_ ((void));
318 static void free_large_strings
P_ ((void));
319 static void sweep_strings
P_ ((void));
321 extern int message_enable_multibyte
;
323 /* When scanning the C stack for live Lisp objects, Emacs keeps track
324 of what memory allocated via lisp_malloc is intended for what
325 purpose. This enumeration specifies the type of memory. */
336 /* Keep the following vector-like types together, with
337 MEM_TYPE_WINDOW being the last, and MEM_TYPE_VECTOR the
338 first. Or change the code of live_vector_p, for instance. */
346 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
348 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
349 #include <stdio.h> /* For fprintf. */
352 /* A unique object in pure space used to make some Lisp objects
353 on free lists recognizable in O(1). */
357 #ifdef GC_MALLOC_CHECK
359 enum mem_type allocated_mem_type
;
360 int dont_register_blocks
;
362 #endif /* GC_MALLOC_CHECK */
364 /* A node in the red-black tree describing allocated memory containing
365 Lisp data. Each such block is recorded with its start and end
366 address when it is allocated, and removed from the tree when it
369 A red-black tree is a balanced binary tree with the following
372 1. Every node is either red or black.
373 2. Every leaf is black.
374 3. If a node is red, then both of its children are black.
375 4. Every simple path from a node to a descendant leaf contains
376 the same number of black nodes.
377 5. The root is always black.
379 When nodes are inserted into the tree, or deleted from the tree,
380 the tree is "fixed" so that these properties are always true.
382 A red-black tree with N internal nodes has height at most 2
383 log(N+1). Searches, insertions and deletions are done in O(log N).
384 Please see a text book about data structures for a detailed
385 description of red-black trees. Any book worth its salt should
390 /* Children of this node. These pointers are never NULL. When there
391 is no child, the value is MEM_NIL, which points to a dummy node. */
392 struct mem_node
*left
, *right
;
394 /* The parent of this node. In the root node, this is NULL. */
395 struct mem_node
*parent
;
397 /* Start and end of allocated region. */
401 enum {MEM_BLACK
, MEM_RED
} color
;
407 /* Base address of stack. Set in main. */
409 Lisp_Object
*stack_base
;
411 /* Root of the tree describing allocated Lisp memory. */
413 static struct mem_node
*mem_root
;
415 /* Lowest and highest known address in the heap. */
417 static void *min_heap_address
, *max_heap_address
;
419 /* Sentinel node of the tree. */
421 static struct mem_node mem_z
;
422 #define MEM_NIL &mem_z
424 static POINTER_TYPE
*lisp_malloc
P_ ((size_t, enum mem_type
));
425 static struct Lisp_Vector
*allocate_vectorlike
P_ ((EMACS_INT
, enum mem_type
));
426 static void lisp_free
P_ ((POINTER_TYPE
*));
427 static void mark_stack
P_ ((void));
428 static int live_vector_p
P_ ((struct mem_node
*, void *));
429 static int live_buffer_p
P_ ((struct mem_node
*, void *));
430 static int live_string_p
P_ ((struct mem_node
*, void *));
431 static int live_cons_p
P_ ((struct mem_node
*, void *));
432 static int live_symbol_p
P_ ((struct mem_node
*, void *));
433 static int live_float_p
P_ ((struct mem_node
*, void *));
434 static int live_misc_p
P_ ((struct mem_node
*, void *));
435 static void mark_maybe_object
P_ ((Lisp_Object
));
436 static void mark_memory
P_ ((void *, void *));
437 static void mem_init
P_ ((void));
438 static struct mem_node
*mem_insert
P_ ((void *, void *, enum mem_type
));
439 static void mem_insert_fixup
P_ ((struct mem_node
*));
440 static void mem_rotate_left
P_ ((struct mem_node
*));
441 static void mem_rotate_right
P_ ((struct mem_node
*));
442 static void mem_delete
P_ ((struct mem_node
*));
443 static void mem_delete_fixup
P_ ((struct mem_node
*));
444 static INLINE
struct mem_node
*mem_find
P_ ((void *));
446 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
447 static void check_gcpros
P_ ((void));
450 #endif /* GC_MARK_STACK || GC_MALLOC_CHECK */
452 /* Recording what needs to be marked for gc. */
454 struct gcpro
*gcprolist
;
456 /* Addresses of staticpro'd variables. Initialize it to a nonzero
457 value; otherwise some compilers put it into BSS. */
459 #define NSTATICS 1280
460 Lisp_Object
*staticvec
[NSTATICS
] = {&Vpurify_flag
};
462 /* Index of next unused slot in staticvec. */
466 static POINTER_TYPE
*pure_alloc
P_ ((size_t, int));
469 /* Value is SZ rounded up to the next multiple of ALIGNMENT.
470 ALIGNMENT must be a power of 2. */
472 #define ALIGN(ptr, ALIGNMENT) \
473 ((POINTER_TYPE *) ((((EMACS_UINT)(ptr)) + (ALIGNMENT) - 1) \
474 & ~((ALIGNMENT) - 1)))
478 /************************************************************************
480 ************************************************************************/
482 /* Function malloc calls this if it finds we are near exhausting storage. */
488 pending_malloc_warning
= str
;
492 /* Display an already-pending malloc warning. */
495 display_malloc_warning ()
497 call3 (intern ("display-warning"),
499 build_string (pending_malloc_warning
),
500 intern ("emergency"));
501 pending_malloc_warning
= 0;
505 #ifdef DOUG_LEA_MALLOC
506 # define BYTES_USED (mallinfo ().arena)
508 # define BYTES_USED _bytes_used
512 /* Called if malloc returns zero. */
519 #ifndef SYSTEM_MALLOC
520 bytes_used_when_full
= BYTES_USED
;
523 /* The first time we get here, free the spare memory. */
530 /* This used to call error, but if we've run out of memory, we could
531 get infinite recursion trying to build the string. */
533 Fsignal (Qnil
, Vmemory_signal_data
);
537 /* Called if we can't allocate relocatable space for a buffer. */
540 buffer_memory_full ()
542 /* If buffers use the relocating allocator, no need to free
543 spare_memory, because we may have plenty of malloc space left
544 that we could get, and if we don't, the malloc that fails will
545 itself cause spare_memory to be freed. If buffers don't use the
546 relocating allocator, treat this like any other failing
555 /* This used to call error, but if we've run out of memory, we could
556 get infinite recursion trying to build the string. */
558 Fsignal (Qnil
, Vmemory_signal_data
);
562 #ifdef XMALLOC_OVERRUN_CHECK
564 /* Check for overrun in malloc'ed buffers by wrapping a 16 byte header
565 and a 16 byte trailer around each block.
567 The header consists of 12 fixed bytes + a 4 byte integer contaning the
568 original block size, while the trailer consists of 16 fixed bytes.
570 The header is used to detect whether this block has been allocated
571 through these functions -- as it seems that some low-level libc
572 functions may bypass the malloc hooks.
576 #define XMALLOC_OVERRUN_CHECK_SIZE 16
578 static char xmalloc_overrun_check_header
[XMALLOC_OVERRUN_CHECK_SIZE
-4] =
579 { 0x9a, 0x9b, 0xae, 0xaf,
580 0xbf, 0xbe, 0xce, 0xcf,
581 0xea, 0xeb, 0xec, 0xed };
583 static char xmalloc_overrun_check_trailer
[XMALLOC_OVERRUN_CHECK_SIZE
] =
584 { 0xaa, 0xab, 0xac, 0xad,
585 0xba, 0xbb, 0xbc, 0xbd,
586 0xca, 0xcb, 0xcc, 0xcd,
587 0xda, 0xdb, 0xdc, 0xdd };
589 /* Macros to insert and extract the block size in the header. */
591 #define XMALLOC_PUT_SIZE(ptr, size) \
592 (ptr[-1] = (size & 0xff), \
593 ptr[-2] = ((size >> 8) & 0xff), \
594 ptr[-3] = ((size >> 16) & 0xff), \
595 ptr[-4] = ((size >> 24) & 0xff))
597 #define XMALLOC_GET_SIZE(ptr) \
598 (size_t)((unsigned)(ptr[-1]) | \
599 ((unsigned)(ptr[-2]) << 8) | \
600 ((unsigned)(ptr[-3]) << 16) | \
601 ((unsigned)(ptr[-4]) << 24))
604 /* Like malloc, but wraps allocated block with header and trailer. */
607 overrun_check_malloc (size
)
610 register unsigned char *val
;
612 val
= (unsigned char *) malloc (size
+ XMALLOC_OVERRUN_CHECK_SIZE
*2);
615 bcopy (xmalloc_overrun_check_header
, val
, XMALLOC_OVERRUN_CHECK_SIZE
- 4);
616 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
617 XMALLOC_PUT_SIZE(val
, size
);
618 bcopy (xmalloc_overrun_check_trailer
, val
+ size
, XMALLOC_OVERRUN_CHECK_SIZE
);
620 return (POINTER_TYPE
*)val
;
624 /* Like realloc, but checks old block for overrun, and wraps new block
625 with header and trailer. */
628 overrun_check_realloc (block
, size
)
632 register unsigned char *val
= (unsigned char *)block
;
635 && bcmp (xmalloc_overrun_check_header
,
636 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
637 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
639 size_t osize
= XMALLOC_GET_SIZE (val
);
640 if (bcmp (xmalloc_overrun_check_trailer
,
642 XMALLOC_OVERRUN_CHECK_SIZE
))
644 bzero (val
+ osize
, XMALLOC_OVERRUN_CHECK_SIZE
);
645 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
646 bzero (val
, XMALLOC_OVERRUN_CHECK_SIZE
);
649 val
= (unsigned char *) realloc ((POINTER_TYPE
*)val
, size
+ XMALLOC_OVERRUN_CHECK_SIZE
*2);
653 bcopy (xmalloc_overrun_check_header
, val
, XMALLOC_OVERRUN_CHECK_SIZE
- 4);
654 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
655 XMALLOC_PUT_SIZE(val
, size
);
656 bcopy (xmalloc_overrun_check_trailer
, val
+ size
, XMALLOC_OVERRUN_CHECK_SIZE
);
658 return (POINTER_TYPE
*)val
;
661 /* Like free, but checks block for overrun. */
664 overrun_check_free (block
)
667 unsigned char *val
= (unsigned char *)block
;
670 && bcmp (xmalloc_overrun_check_header
,
671 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
672 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
674 size_t osize
= XMALLOC_GET_SIZE (val
);
675 if (bcmp (xmalloc_overrun_check_trailer
,
677 XMALLOC_OVERRUN_CHECK_SIZE
))
679 bzero (val
+ osize
, XMALLOC_OVERRUN_CHECK_SIZE
);
680 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
681 bzero (val
, XMALLOC_OVERRUN_CHECK_SIZE
);
690 #define malloc overrun_check_malloc
691 #define realloc overrun_check_realloc
692 #define free overrun_check_free
696 /* Like malloc but check for no memory and block interrupt input.. */
702 register POINTER_TYPE
*val
;
705 val
= (POINTER_TYPE
*) malloc (size
);
714 /* Like realloc but check for no memory and block interrupt input.. */
717 xrealloc (block
, size
)
721 register POINTER_TYPE
*val
;
724 /* We must call malloc explicitly when BLOCK is 0, since some
725 reallocs don't do this. */
727 val
= (POINTER_TYPE
*) malloc (size
);
729 val
= (POINTER_TYPE
*) realloc (block
, size
);
732 if (!val
&& size
) memory_full ();
737 /* Like free but block interrupt input. */
749 /* Like strdup, but uses xmalloc. */
755 size_t len
= strlen (s
) + 1;
756 char *p
= (char *) xmalloc (len
);
762 /* Unwind for SAFE_ALLOCA */
765 safe_alloca_unwind (arg
)
768 register struct Lisp_Save_Value
*p
= XSAVE_VALUE (arg
);
778 /* Like malloc but used for allocating Lisp data. NBYTES is the
779 number of bytes to allocate, TYPE describes the intended use of the
780 allcated memory block (for strings, for conses, ...). */
783 static void *lisp_malloc_loser
;
786 static POINTER_TYPE
*
787 lisp_malloc (nbytes
, type
)
795 #ifdef GC_MALLOC_CHECK
796 allocated_mem_type
= type
;
799 val
= (void *) malloc (nbytes
);
802 /* If the memory just allocated cannot be addressed thru a Lisp
803 object's pointer, and it needs to be,
804 that's equivalent to running out of memory. */
805 if (val
&& type
!= MEM_TYPE_NON_LISP
)
808 XSETCONS (tem
, (char *) val
+ nbytes
- 1);
809 if ((char *) XCONS (tem
) != (char *) val
+ nbytes
- 1)
811 lisp_malloc_loser
= val
;
818 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
819 if (val
&& type
!= MEM_TYPE_NON_LISP
)
820 mem_insert (val
, (char *) val
+ nbytes
, type
);
829 /* Free BLOCK. This must be called to free memory allocated with a
830 call to lisp_malloc. */
838 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
839 mem_delete (mem_find (block
));
844 /* Allocation of aligned blocks of memory to store Lisp data. */
845 /* The entry point is lisp_align_malloc which returns blocks of at most */
846 /* BLOCK_BYTES and guarantees they are aligned on a BLOCK_ALIGN boundary. */
849 /* BLOCK_ALIGN has to be a power of 2. */
850 #define BLOCK_ALIGN (1 << 10)
852 /* Padding to leave at the end of a malloc'd block. This is to give
853 malloc a chance to minimize the amount of memory wasted to alignment.
854 It should be tuned to the particular malloc library used.
855 On glibc-2.3.2, malloc never tries to align, so a padding of 0 is best.
856 posix_memalign on the other hand would ideally prefer a value of 4
857 because otherwise, there's 1020 bytes wasted between each ablocks.
858 But testing shows that those 1020 will most of the time be efficiently
859 used by malloc to place other objects, so a value of 0 is still preferable
860 unless you have a lot of cons&floats and virtually nothing else. */
861 #define BLOCK_PADDING 0
862 #define BLOCK_BYTES \
863 (BLOCK_ALIGN - sizeof (struct aligned_block *) - BLOCK_PADDING)
865 /* Internal data structures and constants. */
867 #define ABLOCKS_SIZE 16
869 /* An aligned block of memory. */
874 char payload
[BLOCK_BYTES
];
875 struct ablock
*next_free
;
877 /* `abase' is the aligned base of the ablocks. */
878 /* It is overloaded to hold the virtual `busy' field that counts
879 the number of used ablock in the parent ablocks.
880 The first ablock has the `busy' field, the others have the `abase'
881 field. To tell the difference, we assume that pointers will have
882 integer values larger than 2 * ABLOCKS_SIZE. The lowest bit of `busy'
883 is used to tell whether the real base of the parent ablocks is `abase'
884 (if not, the word before the first ablock holds a pointer to the
886 struct ablocks
*abase
;
887 /* The padding of all but the last ablock is unused. The padding of
888 the last ablock in an ablocks is not allocated. */
890 char padding
[BLOCK_PADDING
];
894 /* A bunch of consecutive aligned blocks. */
897 struct ablock blocks
[ABLOCKS_SIZE
];
900 /* Size of the block requested from malloc or memalign. */
901 #define ABLOCKS_BYTES (sizeof (struct ablocks) - BLOCK_PADDING)
903 #define ABLOCK_ABASE(block) \
904 (((unsigned long) (block)->abase) <= (1 + 2 * ABLOCKS_SIZE) \
905 ? (struct ablocks *)(block) \
908 /* Virtual `busy' field. */
909 #define ABLOCKS_BUSY(abase) ((abase)->blocks[0].abase)
911 /* Pointer to the (not necessarily aligned) malloc block. */
912 #ifdef HAVE_POSIX_MEMALIGN
913 #define ABLOCKS_BASE(abase) (abase)
915 #define ABLOCKS_BASE(abase) \
916 (1 & (long) ABLOCKS_BUSY (abase) ? abase : ((void**)abase)[-1])
919 /* The list of free ablock. */
920 static struct ablock
*free_ablock
;
922 /* Allocate an aligned block of nbytes.
923 Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be
924 smaller or equal to BLOCK_BYTES. */
925 static POINTER_TYPE
*
926 lisp_align_malloc (nbytes
, type
)
931 struct ablocks
*abase
;
933 eassert (nbytes
<= BLOCK_BYTES
);
937 #ifdef GC_MALLOC_CHECK
938 allocated_mem_type
= type
;
944 EMACS_INT aligned
; /* int gets warning casting to 64-bit pointer. */
946 #ifdef DOUG_LEA_MALLOC
947 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
948 because mapped region contents are not preserved in
950 mallopt (M_MMAP_MAX
, 0);
953 #ifdef HAVE_POSIX_MEMALIGN
955 int err
= posix_memalign (&base
, BLOCK_ALIGN
, ABLOCKS_BYTES
);
961 base
= malloc (ABLOCKS_BYTES
);
962 abase
= ALIGN (base
, BLOCK_ALIGN
);
971 aligned
= (base
== abase
);
973 ((void**)abase
)[-1] = base
;
975 #ifdef DOUG_LEA_MALLOC
976 /* Back to a reasonable maximum of mmap'ed areas. */
977 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
981 /* If the memory just allocated cannot be addressed thru a Lisp
982 object's pointer, and it needs to be, that's equivalent to
983 running out of memory. */
984 if (type
!= MEM_TYPE_NON_LISP
)
987 char *end
= (char *) base
+ ABLOCKS_BYTES
- 1;
989 if ((char *) XCONS (tem
) != end
)
991 lisp_malloc_loser
= base
;
999 /* Initialize the blocks and put them on the free list.
1000 Is `base' was not properly aligned, we can't use the last block. */
1001 for (i
= 0; i
< (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1); i
++)
1003 abase
->blocks
[i
].abase
= abase
;
1004 abase
->blocks
[i
].x
.next_free
= free_ablock
;
1005 free_ablock
= &abase
->blocks
[i
];
1007 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (long) aligned
;
1009 eassert (0 == ((EMACS_UINT
)abase
) % BLOCK_ALIGN
);
1010 eassert (ABLOCK_ABASE (&abase
->blocks
[3]) == abase
); /* 3 is arbitrary */
1011 eassert (ABLOCK_ABASE (&abase
->blocks
[0]) == abase
);
1012 eassert (ABLOCKS_BASE (abase
) == base
);
1013 eassert (aligned
== (long) ABLOCKS_BUSY (abase
));
1016 abase
= ABLOCK_ABASE (free_ablock
);
1017 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (2 + (long) ABLOCKS_BUSY (abase
));
1019 free_ablock
= free_ablock
->x
.next_free
;
1021 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1022 if (val
&& type
!= MEM_TYPE_NON_LISP
)
1023 mem_insert (val
, (char *) val
+ nbytes
, type
);
1030 eassert (0 == ((EMACS_UINT
)val
) % BLOCK_ALIGN
);
1035 lisp_align_free (block
)
1036 POINTER_TYPE
*block
;
1038 struct ablock
*ablock
= block
;
1039 struct ablocks
*abase
= ABLOCK_ABASE (ablock
);
1042 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1043 mem_delete (mem_find (block
));
1045 /* Put on free list. */
1046 ablock
->x
.next_free
= free_ablock
;
1047 free_ablock
= ablock
;
1048 /* Update busy count. */
1049 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (-2 + (long) ABLOCKS_BUSY (abase
));
1051 if (2 > (long) ABLOCKS_BUSY (abase
))
1052 { /* All the blocks are free. */
1053 int i
= 0, aligned
= (long) ABLOCKS_BUSY (abase
);
1054 struct ablock
**tem
= &free_ablock
;
1055 struct ablock
*atop
= &abase
->blocks
[aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1];
1059 if (*tem
>= (struct ablock
*) abase
&& *tem
< atop
)
1062 *tem
= (*tem
)->x
.next_free
;
1065 tem
= &(*tem
)->x
.next_free
;
1067 eassert ((aligned
& 1) == aligned
);
1068 eassert (i
== (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1));
1069 free (ABLOCKS_BASE (abase
));
1074 /* Return a new buffer structure allocated from the heap with
1075 a call to lisp_malloc. */
1081 = (struct buffer
*) lisp_malloc (sizeof (struct buffer
),
1087 /* Arranging to disable input signals while we're in malloc.
1089 This only works with GNU malloc. To help out systems which can't
1090 use GNU malloc, all the calls to malloc, realloc, and free
1091 elsewhere in the code should be inside a BLOCK_INPUT/UNBLOCK_INPUT
1092 pairs; unfortunately, we have no idea what C library functions
1093 might call malloc, so we can't really protect them unless you're
1094 using GNU malloc. Fortunately, most of the major operating systems
1095 can use GNU malloc. */
1097 #ifndef SYSTEM_MALLOC
1098 #ifndef DOUG_LEA_MALLOC
1099 extern void * (*__malloc_hook
) P_ ((size_t));
1100 extern void * (*__realloc_hook
) P_ ((void *, size_t));
1101 extern void (*__free_hook
) P_ ((void *));
1102 /* Else declared in malloc.h, perhaps with an extra arg. */
1103 #endif /* DOUG_LEA_MALLOC */
1104 static void * (*old_malloc_hook
) ();
1105 static void * (*old_realloc_hook
) ();
1106 static void (*old_free_hook
) ();
1108 /* This function is used as the hook for free to call. */
1111 emacs_blocked_free (ptr
)
1116 #ifdef GC_MALLOC_CHECK
1122 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1125 "Freeing `%p' which wasn't allocated with malloc\n", ptr
);
1130 /* fprintf (stderr, "free %p...%p (%p)\n", m->start, m->end, ptr); */
1134 #endif /* GC_MALLOC_CHECK */
1136 __free_hook
= old_free_hook
;
1139 /* If we released our reserve (due to running out of memory),
1140 and we have a fair amount free once again,
1141 try to set aside another reserve in case we run out once more. */
1142 if (spare_memory
== 0
1143 /* Verify there is enough space that even with the malloc
1144 hysteresis this call won't run out again.
1145 The code here is correct as long as SPARE_MEMORY
1146 is substantially larger than the block size malloc uses. */
1147 && (bytes_used_when_full
1148 > BYTES_USED
+ max (malloc_hysteresis
, 4) * SPARE_MEMORY
))
1149 spare_memory
= (char *) malloc ((size_t) SPARE_MEMORY
);
1151 __free_hook
= emacs_blocked_free
;
1152 UNBLOCK_INPUT_ALLOC
;
1156 /* If we released our reserve (due to running out of memory),
1157 and we have a fair amount free once again,
1158 try to set aside another reserve in case we run out once more.
1160 This is called when a relocatable block is freed in ralloc.c. */
1163 refill_memory_reserve ()
1165 if (spare_memory
== 0)
1166 spare_memory
= (char *) malloc ((size_t) SPARE_MEMORY
);
1170 /* This function is the malloc hook that Emacs uses. */
1173 emacs_blocked_malloc (size
)
1179 __malloc_hook
= old_malloc_hook
;
1180 #ifdef DOUG_LEA_MALLOC
1181 mallopt (M_TOP_PAD
, malloc_hysteresis
* 4096);
1183 __malloc_extra_blocks
= malloc_hysteresis
;
1186 value
= (void *) malloc (size
);
1188 #ifdef GC_MALLOC_CHECK
1190 struct mem_node
*m
= mem_find (value
);
1193 fprintf (stderr
, "Malloc returned %p which is already in use\n",
1195 fprintf (stderr
, "Region in use is %p...%p, %u bytes, type %d\n",
1196 m
->start
, m
->end
, (char *) m
->end
- (char *) m
->start
,
1201 if (!dont_register_blocks
)
1203 mem_insert (value
, (char *) value
+ max (1, size
), allocated_mem_type
);
1204 allocated_mem_type
= MEM_TYPE_NON_LISP
;
1207 #endif /* GC_MALLOC_CHECK */
1209 __malloc_hook
= emacs_blocked_malloc
;
1210 UNBLOCK_INPUT_ALLOC
;
1212 /* fprintf (stderr, "%p malloc\n", value); */
1217 /* This function is the realloc hook that Emacs uses. */
1220 emacs_blocked_realloc (ptr
, size
)
1227 __realloc_hook
= old_realloc_hook
;
1229 #ifdef GC_MALLOC_CHECK
1232 struct mem_node
*m
= mem_find (ptr
);
1233 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1236 "Realloc of %p which wasn't allocated with malloc\n",
1244 /* fprintf (stderr, "%p -> realloc\n", ptr); */
1246 /* Prevent malloc from registering blocks. */
1247 dont_register_blocks
= 1;
1248 #endif /* GC_MALLOC_CHECK */
1250 value
= (void *) realloc (ptr
, size
);
1252 #ifdef GC_MALLOC_CHECK
1253 dont_register_blocks
= 0;
1256 struct mem_node
*m
= mem_find (value
);
1259 fprintf (stderr
, "Realloc returns memory that is already in use\n");
1263 /* Can't handle zero size regions in the red-black tree. */
1264 mem_insert (value
, (char *) value
+ max (size
, 1), MEM_TYPE_NON_LISP
);
1267 /* fprintf (stderr, "%p <- realloc\n", value); */
1268 #endif /* GC_MALLOC_CHECK */
1270 __realloc_hook
= emacs_blocked_realloc
;
1271 UNBLOCK_INPUT_ALLOC
;
1277 #ifdef HAVE_GTK_AND_PTHREAD
1278 /* Called from Fdump_emacs so that when the dumped Emacs starts, it has a
1279 normal malloc. Some thread implementations need this as they call
1280 malloc before main. The pthread_self call in BLOCK_INPUT_ALLOC then
1281 calls malloc because it is the first call, and we have an endless loop. */
1284 reset_malloc_hooks ()
1290 #endif /* HAVE_GTK_AND_PTHREAD */
1293 /* Called from main to set up malloc to use our hooks. */
1296 uninterrupt_malloc ()
1298 #ifdef HAVE_GTK_AND_PTHREAD
1299 pthread_mutexattr_t attr
;
1301 /* GLIBC has a faster way to do this, but lets keep it portable.
1302 This is according to the Single UNIX Specification. */
1303 pthread_mutexattr_init (&attr
);
1304 pthread_mutexattr_settype (&attr
, PTHREAD_MUTEX_RECURSIVE
);
1305 pthread_mutex_init (&alloc_mutex
, &attr
);
1306 #endif /* HAVE_GTK_AND_PTHREAD */
1308 if (__free_hook
!= emacs_blocked_free
)
1309 old_free_hook
= __free_hook
;
1310 __free_hook
= emacs_blocked_free
;
1312 if (__malloc_hook
!= emacs_blocked_malloc
)
1313 old_malloc_hook
= __malloc_hook
;
1314 __malloc_hook
= emacs_blocked_malloc
;
1316 if (__realloc_hook
!= emacs_blocked_realloc
)
1317 old_realloc_hook
= __realloc_hook
;
1318 __realloc_hook
= emacs_blocked_realloc
;
1321 #endif /* not SYSTEM_MALLOC */
1325 /***********************************************************************
1327 ***********************************************************************/
1329 /* Number of intervals allocated in an interval_block structure.
1330 The 1020 is 1024 minus malloc overhead. */
1332 #define INTERVAL_BLOCK_SIZE \
1333 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
1335 /* Intervals are allocated in chunks in form of an interval_block
1338 struct interval_block
1340 /* Place `intervals' first, to preserve alignment. */
1341 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
1342 struct interval_block
*next
;
1345 /* Current interval block. Its `next' pointer points to older
1348 struct interval_block
*interval_block
;
1350 /* Index in interval_block above of the next unused interval
1353 static int interval_block_index
;
1355 /* Number of free and live intervals. */
1357 static int total_free_intervals
, total_intervals
;
1359 /* List of free intervals. */
1361 INTERVAL interval_free_list
;
1363 /* Total number of interval blocks now in use. */
1365 int n_interval_blocks
;
1368 /* Initialize interval allocation. */
1373 interval_block
= NULL
;
1374 interval_block_index
= INTERVAL_BLOCK_SIZE
;
1375 interval_free_list
= 0;
1376 n_interval_blocks
= 0;
1380 /* Return a new interval. */
1387 if (interval_free_list
)
1389 val
= interval_free_list
;
1390 interval_free_list
= INTERVAL_PARENT (interval_free_list
);
1394 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
1396 register struct interval_block
*newi
;
1398 newi
= (struct interval_block
*) lisp_malloc (sizeof *newi
,
1401 newi
->next
= interval_block
;
1402 interval_block
= newi
;
1403 interval_block_index
= 0;
1404 n_interval_blocks
++;
1406 val
= &interval_block
->intervals
[interval_block_index
++];
1408 consing_since_gc
+= sizeof (struct interval
);
1410 RESET_INTERVAL (val
);
1416 /* Mark Lisp objects in interval I. */
1419 mark_interval (i
, dummy
)
1420 register INTERVAL i
;
1423 eassert (!i
->gcmarkbit
); /* Intervals are never shared. */
1425 mark_object (i
->plist
);
1429 /* Mark the interval tree rooted in TREE. Don't call this directly;
1430 use the macro MARK_INTERVAL_TREE instead. */
1433 mark_interval_tree (tree
)
1434 register INTERVAL tree
;
1436 /* No need to test if this tree has been marked already; this
1437 function is always called through the MARK_INTERVAL_TREE macro,
1438 which takes care of that. */
1440 traverse_intervals_noorder (tree
, mark_interval
, Qnil
);
1444 /* Mark the interval tree rooted in I. */
1446 #define MARK_INTERVAL_TREE(i) \
1448 if (!NULL_INTERVAL_P (i) && !i->gcmarkbit) \
1449 mark_interval_tree (i); \
1453 #define UNMARK_BALANCE_INTERVALS(i) \
1455 if (! NULL_INTERVAL_P (i)) \
1456 (i) = balance_intervals (i); \
1460 /* Number support. If NO_UNION_TYPE isn't in effect, we
1461 can't create number objects in macros. */
1469 obj
.s
.type
= Lisp_Int
;
1474 /***********************************************************************
1476 ***********************************************************************/
1478 /* Lisp_Strings are allocated in string_block structures. When a new
1479 string_block is allocated, all the Lisp_Strings it contains are
1480 added to a free-list string_free_list. When a new Lisp_String is
1481 needed, it is taken from that list. During the sweep phase of GC,
1482 string_blocks that are entirely free are freed, except two which
1485 String data is allocated from sblock structures. Strings larger
1486 than LARGE_STRING_BYTES, get their own sblock, data for smaller
1487 strings is sub-allocated out of sblocks of size SBLOCK_SIZE.
1489 Sblocks consist internally of sdata structures, one for each
1490 Lisp_String. The sdata structure points to the Lisp_String it
1491 belongs to. The Lisp_String points back to the `u.data' member of
1492 its sdata structure.
1494 When a Lisp_String is freed during GC, it is put back on
1495 string_free_list, and its `data' member and its sdata's `string'
1496 pointer is set to null. The size of the string is recorded in the
1497 `u.nbytes' member of the sdata. So, sdata structures that are no
1498 longer used, can be easily recognized, and it's easy to compact the
1499 sblocks of small strings which we do in compact_small_strings. */
1501 /* Size in bytes of an sblock structure used for small strings. This
1502 is 8192 minus malloc overhead. */
1504 #define SBLOCK_SIZE 8188
1506 /* Strings larger than this are considered large strings. String data
1507 for large strings is allocated from individual sblocks. */
1509 #define LARGE_STRING_BYTES 1024
1511 /* Structure describing string memory sub-allocated from an sblock.
1512 This is where the contents of Lisp strings are stored. */
1516 /* Back-pointer to the string this sdata belongs to. If null, this
1517 structure is free, and the NBYTES member of the union below
1518 contains the string's byte size (the same value that STRING_BYTES
1519 would return if STRING were non-null). If non-null, STRING_BYTES
1520 (STRING) is the size of the data, and DATA contains the string's
1522 struct Lisp_String
*string
;
1524 #ifdef GC_CHECK_STRING_BYTES
1527 unsigned char data
[1];
1529 #define SDATA_NBYTES(S) (S)->nbytes
1530 #define SDATA_DATA(S) (S)->data
1532 #else /* not GC_CHECK_STRING_BYTES */
1536 /* When STRING in non-null. */
1537 unsigned char data
[1];
1539 /* When STRING is null. */
1544 #define SDATA_NBYTES(S) (S)->u.nbytes
1545 #define SDATA_DATA(S) (S)->u.data
1547 #endif /* not GC_CHECK_STRING_BYTES */
1551 /* Structure describing a block of memory which is sub-allocated to
1552 obtain string data memory for strings. Blocks for small strings
1553 are of fixed size SBLOCK_SIZE. Blocks for large strings are made
1554 as large as needed. */
1559 struct sblock
*next
;
1561 /* Pointer to the next free sdata block. This points past the end
1562 of the sblock if there isn't any space left in this block. */
1563 struct sdata
*next_free
;
1565 /* Start of data. */
1566 struct sdata first_data
;
1569 /* Number of Lisp strings in a string_block structure. The 1020 is
1570 1024 minus malloc overhead. */
1572 #define STRING_BLOCK_SIZE \
1573 ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String))
1575 /* Structure describing a block from which Lisp_String structures
1580 /* Place `strings' first, to preserve alignment. */
1581 struct Lisp_String strings
[STRING_BLOCK_SIZE
];
1582 struct string_block
*next
;
1585 /* Head and tail of the list of sblock structures holding Lisp string
1586 data. We always allocate from current_sblock. The NEXT pointers
1587 in the sblock structures go from oldest_sblock to current_sblock. */
1589 static struct sblock
*oldest_sblock
, *current_sblock
;
1591 /* List of sblocks for large strings. */
1593 static struct sblock
*large_sblocks
;
1595 /* List of string_block structures, and how many there are. */
1597 static struct string_block
*string_blocks
;
1598 static int n_string_blocks
;
1600 /* Free-list of Lisp_Strings. */
1602 static struct Lisp_String
*string_free_list
;
1604 /* Number of live and free Lisp_Strings. */
1606 static int total_strings
, total_free_strings
;
1608 /* Number of bytes used by live strings. */
1610 static int total_string_size
;
1612 /* Given a pointer to a Lisp_String S which is on the free-list
1613 string_free_list, return a pointer to its successor in the
1616 #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S))
1618 /* Return a pointer to the sdata structure belonging to Lisp string S.
1619 S must be live, i.e. S->data must not be null. S->data is actually
1620 a pointer to the `u.data' member of its sdata structure; the
1621 structure starts at a constant offset in front of that. */
1623 #ifdef GC_CHECK_STRING_BYTES
1625 #define SDATA_OF_STRING(S) \
1626 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *) \
1627 - sizeof (EMACS_INT)))
1629 #else /* not GC_CHECK_STRING_BYTES */
1631 #define SDATA_OF_STRING(S) \
1632 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *)))
1634 #endif /* not GC_CHECK_STRING_BYTES */
1637 #ifdef GC_CHECK_STRING_OVERRUN
1639 /* We check for overrun in string data blocks by appending a small
1640 "cookie" after each allocated string data block, and check for the
1641 presense of this cookie during GC. */
1643 #define GC_STRING_OVERRUN_COOKIE_SIZE 4
1644 static char string_overrun_cookie
[GC_STRING_OVERRUN_COOKIE_SIZE
] =
1645 { 0xde, 0xad, 0xbe, 0xef };
1648 #define GC_STRING_OVERRUN_COOKIE_SIZE 0
1651 /* Value is the size of an sdata structure large enough to hold NBYTES
1652 bytes of string data. The value returned includes a terminating
1653 NUL byte, the size of the sdata structure, and padding. */
1655 #ifdef GC_CHECK_STRING_BYTES
1657 #define SDATA_SIZE(NBYTES) \
1658 ((sizeof (struct Lisp_String *) \
1660 + sizeof (EMACS_INT) \
1661 + sizeof (EMACS_INT) - 1) \
1662 & ~(sizeof (EMACS_INT) - 1))
1664 #else /* not GC_CHECK_STRING_BYTES */
1666 #define SDATA_SIZE(NBYTES) \
1667 ((sizeof (struct Lisp_String *) \
1669 + sizeof (EMACS_INT) - 1) \
1670 & ~(sizeof (EMACS_INT) - 1))
1672 #endif /* not GC_CHECK_STRING_BYTES */
1674 /* Extra bytes to allocate for each string. */
1676 #define GC_STRING_EXTRA (GC_STRING_OVERRUN_COOKIE_SIZE)
1678 /* Initialize string allocation. Called from init_alloc_once. */
1683 total_strings
= total_free_strings
= total_string_size
= 0;
1684 oldest_sblock
= current_sblock
= large_sblocks
= NULL
;
1685 string_blocks
= NULL
;
1686 n_string_blocks
= 0;
1687 string_free_list
= NULL
;
1691 #ifdef GC_CHECK_STRING_BYTES
1693 static int check_string_bytes_count
;
1695 void check_string_bytes
P_ ((int));
1696 void check_sblock
P_ ((struct sblock
*));
1698 #define CHECK_STRING_BYTES(S) STRING_BYTES (S)
1701 /* Like GC_STRING_BYTES, but with debugging check. */
1705 struct Lisp_String
*s
;
1707 int nbytes
= (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1708 if (!PURE_POINTER_P (s
)
1710 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1715 /* Check validity of Lisp strings' string_bytes member in B. */
1721 struct sdata
*from
, *end
, *from_end
;
1725 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1727 /* Compute the next FROM here because copying below may
1728 overwrite data we need to compute it. */
1731 /* Check that the string size recorded in the string is the
1732 same as the one recorded in the sdata structure. */
1734 CHECK_STRING_BYTES (from
->string
);
1737 nbytes
= GC_STRING_BYTES (from
->string
);
1739 nbytes
= SDATA_NBYTES (from
);
1741 nbytes
= SDATA_SIZE (nbytes
);
1742 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
1747 /* Check validity of Lisp strings' string_bytes member. ALL_P
1748 non-zero means check all strings, otherwise check only most
1749 recently allocated strings. Used for hunting a bug. */
1752 check_string_bytes (all_p
)
1759 for (b
= large_sblocks
; b
; b
= b
->next
)
1761 struct Lisp_String
*s
= b
->first_data
.string
;
1763 CHECK_STRING_BYTES (s
);
1766 for (b
= oldest_sblock
; b
; b
= b
->next
)
1770 check_sblock (current_sblock
);
1773 #endif /* GC_CHECK_STRING_BYTES */
1775 #ifdef GC_CHECK_STRING_FREE_LIST
1777 /* Walk through the string free list looking for bogus next pointers.
1778 This may catch buffer overrun from a previous string. */
1781 check_string_free_list ()
1783 struct Lisp_String
*s
;
1785 /* Pop a Lisp_String off the free-list. */
1786 s
= string_free_list
;
1789 if ((unsigned)s
< 1024)
1791 s
= NEXT_FREE_LISP_STRING (s
);
1795 #define check_string_free_list()
1798 /* Return a new Lisp_String. */
1800 static struct Lisp_String
*
1803 struct Lisp_String
*s
;
1805 /* If the free-list is empty, allocate a new string_block, and
1806 add all the Lisp_Strings in it to the free-list. */
1807 if (string_free_list
== NULL
)
1809 struct string_block
*b
;
1812 b
= (struct string_block
*) lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1813 bzero (b
, sizeof *b
);
1814 b
->next
= string_blocks
;
1818 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1821 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1822 string_free_list
= s
;
1825 total_free_strings
+= STRING_BLOCK_SIZE
;
1828 check_string_free_list ();
1830 /* Pop a Lisp_String off the free-list. */
1831 s
= string_free_list
;
1832 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1834 /* Probably not strictly necessary, but play it safe. */
1835 bzero (s
, sizeof *s
);
1837 --total_free_strings
;
1840 consing_since_gc
+= sizeof *s
;
1842 #ifdef GC_CHECK_STRING_BYTES
1849 if (++check_string_bytes_count
== 200)
1851 check_string_bytes_count
= 0;
1852 check_string_bytes (1);
1855 check_string_bytes (0);
1857 #endif /* GC_CHECK_STRING_BYTES */
1863 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1864 plus a NUL byte at the end. Allocate an sdata structure for S, and
1865 set S->data to its `u.data' member. Store a NUL byte at the end of
1866 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1867 S->data if it was initially non-null. */
1870 allocate_string_data (s
, nchars
, nbytes
)
1871 struct Lisp_String
*s
;
1874 struct sdata
*data
, *old_data
;
1876 int needed
, old_nbytes
;
1878 /* Determine the number of bytes needed to store NBYTES bytes
1880 needed
= SDATA_SIZE (nbytes
);
1882 if (nbytes
> LARGE_STRING_BYTES
)
1884 size_t size
= sizeof *b
- sizeof (struct sdata
) + needed
;
1886 #ifdef DOUG_LEA_MALLOC
1887 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1888 because mapped region contents are not preserved in
1891 In case you think of allowing it in a dumped Emacs at the
1892 cost of not being able to re-dump, there's another reason:
1893 mmap'ed data typically have an address towards the top of the
1894 address space, which won't fit into an EMACS_INT (at least on
1895 32-bit systems with the current tagging scheme). --fx */
1896 mallopt (M_MMAP_MAX
, 0);
1899 b
= (struct sblock
*) lisp_malloc (size
+ GC_STRING_EXTRA
, MEM_TYPE_NON_LISP
);
1901 #ifdef DOUG_LEA_MALLOC
1902 /* Back to a reasonable maximum of mmap'ed areas. */
1903 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1906 b
->next_free
= &b
->first_data
;
1907 b
->first_data
.string
= NULL
;
1908 b
->next
= large_sblocks
;
1911 else if (current_sblock
== NULL
1912 || (((char *) current_sblock
+ SBLOCK_SIZE
1913 - (char *) current_sblock
->next_free
)
1914 < (needed
+ GC_STRING_EXTRA
)))
1916 /* Not enough room in the current sblock. */
1917 b
= (struct sblock
*) lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
1918 b
->next_free
= &b
->first_data
;
1919 b
->first_data
.string
= NULL
;
1923 current_sblock
->next
= b
;
1931 old_data
= s
->data
? SDATA_OF_STRING (s
) : NULL
;
1932 old_nbytes
= GC_STRING_BYTES (s
);
1934 data
= b
->next_free
;
1936 s
->data
= SDATA_DATA (data
);
1937 #ifdef GC_CHECK_STRING_BYTES
1938 SDATA_NBYTES (data
) = nbytes
;
1941 s
->size_byte
= nbytes
;
1942 s
->data
[nbytes
] = '\0';
1943 #ifdef GC_CHECK_STRING_OVERRUN
1944 bcopy (string_overrun_cookie
, (char *) data
+ needed
,
1945 GC_STRING_OVERRUN_COOKIE_SIZE
);
1947 b
->next_free
= (struct sdata
*) ((char *) data
+ needed
+ GC_STRING_EXTRA
);
1949 /* If S had already data assigned, mark that as free by setting its
1950 string back-pointer to null, and recording the size of the data
1954 SDATA_NBYTES (old_data
) = old_nbytes
;
1955 old_data
->string
= NULL
;
1958 consing_since_gc
+= needed
;
1962 /* Sweep and compact strings. */
1967 struct string_block
*b
, *next
;
1968 struct string_block
*live_blocks
= NULL
;
1970 string_free_list
= NULL
;
1971 total_strings
= total_free_strings
= 0;
1972 total_string_size
= 0;
1974 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
1975 for (b
= string_blocks
; b
; b
= next
)
1978 struct Lisp_String
*free_list_before
= string_free_list
;
1982 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
1984 struct Lisp_String
*s
= b
->strings
+ i
;
1988 /* String was not on free-list before. */
1989 if (STRING_MARKED_P (s
))
1991 /* String is live; unmark it and its intervals. */
1994 if (!NULL_INTERVAL_P (s
->intervals
))
1995 UNMARK_BALANCE_INTERVALS (s
->intervals
);
1998 total_string_size
+= STRING_BYTES (s
);
2002 /* String is dead. Put it on the free-list. */
2003 struct sdata
*data
= SDATA_OF_STRING (s
);
2005 /* Save the size of S in its sdata so that we know
2006 how large that is. Reset the sdata's string
2007 back-pointer so that we know it's free. */
2008 #ifdef GC_CHECK_STRING_BYTES
2009 if (GC_STRING_BYTES (s
) != SDATA_NBYTES (data
))
2012 data
->u
.nbytes
= GC_STRING_BYTES (s
);
2014 data
->string
= NULL
;
2016 /* Reset the strings's `data' member so that we
2020 /* Put the string on the free-list. */
2021 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2022 string_free_list
= s
;
2028 /* S was on the free-list before. Put it there again. */
2029 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2030 string_free_list
= s
;
2035 /* Free blocks that contain free Lisp_Strings only, except
2036 the first two of them. */
2037 if (nfree
== STRING_BLOCK_SIZE
2038 && total_free_strings
> STRING_BLOCK_SIZE
)
2042 string_free_list
= free_list_before
;
2046 total_free_strings
+= nfree
;
2047 b
->next
= live_blocks
;
2052 check_string_free_list ();
2054 string_blocks
= live_blocks
;
2055 free_large_strings ();
2056 compact_small_strings ();
2058 check_string_free_list ();
2062 /* Free dead large strings. */
2065 free_large_strings ()
2067 struct sblock
*b
, *next
;
2068 struct sblock
*live_blocks
= NULL
;
2070 for (b
= large_sblocks
; b
; b
= next
)
2074 if (b
->first_data
.string
== NULL
)
2078 b
->next
= live_blocks
;
2083 large_sblocks
= live_blocks
;
2087 /* Compact data of small strings. Free sblocks that don't contain
2088 data of live strings after compaction. */
2091 compact_small_strings ()
2093 struct sblock
*b
, *tb
, *next
;
2094 struct sdata
*from
, *to
, *end
, *tb_end
;
2095 struct sdata
*to_end
, *from_end
;
2097 /* TB is the sblock we copy to, TO is the sdata within TB we copy
2098 to, and TB_END is the end of TB. */
2100 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2101 to
= &tb
->first_data
;
2103 /* Step through the blocks from the oldest to the youngest. We
2104 expect that old blocks will stabilize over time, so that less
2105 copying will happen this way. */
2106 for (b
= oldest_sblock
; b
; b
= b
->next
)
2109 xassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
2111 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
2113 /* Compute the next FROM here because copying below may
2114 overwrite data we need to compute it. */
2117 #ifdef GC_CHECK_STRING_BYTES
2118 /* Check that the string size recorded in the string is the
2119 same as the one recorded in the sdata structure. */
2121 && GC_STRING_BYTES (from
->string
) != SDATA_NBYTES (from
))
2123 #endif /* GC_CHECK_STRING_BYTES */
2126 nbytes
= GC_STRING_BYTES (from
->string
);
2128 nbytes
= SDATA_NBYTES (from
);
2130 if (nbytes
> LARGE_STRING_BYTES
)
2133 nbytes
= SDATA_SIZE (nbytes
);
2134 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
2136 #ifdef GC_CHECK_STRING_OVERRUN
2137 if (bcmp (string_overrun_cookie
,
2138 ((char *) from_end
) - GC_STRING_OVERRUN_COOKIE_SIZE
,
2139 GC_STRING_OVERRUN_COOKIE_SIZE
))
2143 /* FROM->string non-null means it's alive. Copy its data. */
2146 /* If TB is full, proceed with the next sblock. */
2147 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2148 if (to_end
> tb_end
)
2152 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2153 to
= &tb
->first_data
;
2154 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2157 /* Copy, and update the string's `data' pointer. */
2160 xassert (tb
!= b
|| to
<= from
);
2161 safe_bcopy ((char *) from
, (char *) to
, nbytes
+ GC_STRING_EXTRA
);
2162 to
->string
->data
= SDATA_DATA (to
);
2165 /* Advance past the sdata we copied to. */
2171 /* The rest of the sblocks following TB don't contain live data, so
2172 we can free them. */
2173 for (b
= tb
->next
; b
; b
= next
)
2181 current_sblock
= tb
;
2185 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
2186 doc
: /* Return a newly created string of length LENGTH, with INIT in each element.
2187 LENGTH must be an integer.
2188 INIT must be an integer that represents a character. */)
2190 Lisp_Object length
, init
;
2192 register Lisp_Object val
;
2193 register unsigned char *p
, *end
;
2196 CHECK_NATNUM (length
);
2197 CHECK_NUMBER (init
);
2200 if (SINGLE_BYTE_CHAR_P (c
))
2202 nbytes
= XINT (length
);
2203 val
= make_uninit_string (nbytes
);
2205 end
= p
+ SCHARS (val
);
2211 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
2212 int len
= CHAR_STRING (c
, str
);
2214 nbytes
= len
* XINT (length
);
2215 val
= make_uninit_multibyte_string (XINT (length
), nbytes
);
2220 bcopy (str
, p
, len
);
2230 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
2231 doc
: /* Return a new bool-vector of length LENGTH, using INIT for as each element.
2232 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
2234 Lisp_Object length
, init
;
2236 register Lisp_Object val
;
2237 struct Lisp_Bool_Vector
*p
;
2239 int length_in_chars
, length_in_elts
, bits_per_value
;
2241 CHECK_NATNUM (length
);
2243 bits_per_value
= sizeof (EMACS_INT
) * BOOL_VECTOR_BITS_PER_CHAR
;
2245 length_in_elts
= (XFASTINT (length
) + bits_per_value
- 1) / bits_per_value
;
2246 length_in_chars
= ((XFASTINT (length
) + BOOL_VECTOR_BITS_PER_CHAR
- 1)
2247 / BOOL_VECTOR_BITS_PER_CHAR
);
2249 /* We must allocate one more elements than LENGTH_IN_ELTS for the
2250 slot `size' of the struct Lisp_Bool_Vector. */
2251 val
= Fmake_vector (make_number (length_in_elts
+ 1), Qnil
);
2252 p
= XBOOL_VECTOR (val
);
2254 /* Get rid of any bits that would cause confusion. */
2256 XSETBOOL_VECTOR (val
, p
);
2257 p
->size
= XFASTINT (length
);
2259 real_init
= (NILP (init
) ? 0 : -1);
2260 for (i
= 0; i
< length_in_chars
; i
++)
2261 p
->data
[i
] = real_init
;
2263 /* Clear the extraneous bits in the last byte. */
2264 if (XINT (length
) != length_in_chars
* BOOL_VECTOR_BITS_PER_CHAR
)
2265 XBOOL_VECTOR (val
)->data
[length_in_chars
- 1]
2266 &= (1 << (XINT (length
) % BOOL_VECTOR_BITS_PER_CHAR
)) - 1;
2272 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
2273 of characters from the contents. This string may be unibyte or
2274 multibyte, depending on the contents. */
2277 make_string (contents
, nbytes
)
2278 const char *contents
;
2281 register Lisp_Object val
;
2282 int nchars
, multibyte_nbytes
;
2284 parse_str_as_multibyte (contents
, nbytes
, &nchars
, &multibyte_nbytes
);
2285 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
2286 /* CONTENTS contains no multibyte sequences or contains an invalid
2287 multibyte sequence. We must make unibyte string. */
2288 val
= make_unibyte_string (contents
, nbytes
);
2290 val
= make_multibyte_string (contents
, nchars
, nbytes
);
2295 /* Make an unibyte string from LENGTH bytes at CONTENTS. */
2298 make_unibyte_string (contents
, length
)
2299 const char *contents
;
2302 register Lisp_Object val
;
2303 val
= make_uninit_string (length
);
2304 bcopy (contents
, SDATA (val
), length
);
2305 STRING_SET_UNIBYTE (val
);
2310 /* Make a multibyte string from NCHARS characters occupying NBYTES
2311 bytes at CONTENTS. */
2314 make_multibyte_string (contents
, nchars
, nbytes
)
2315 const char *contents
;
2318 register Lisp_Object val
;
2319 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2320 bcopy (contents
, SDATA (val
), nbytes
);
2325 /* Make a string from NCHARS characters occupying NBYTES bytes at
2326 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2329 make_string_from_bytes (contents
, nchars
, nbytes
)
2330 const char *contents
;
2333 register Lisp_Object val
;
2334 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2335 bcopy (contents
, SDATA (val
), nbytes
);
2336 if (SBYTES (val
) == SCHARS (val
))
2337 STRING_SET_UNIBYTE (val
);
2342 /* Make a string from NCHARS characters occupying NBYTES bytes at
2343 CONTENTS. The argument MULTIBYTE controls whether to label the
2344 string as multibyte. If NCHARS is negative, it counts the number of
2345 characters by itself. */
2348 make_specified_string (contents
, nchars
, nbytes
, multibyte
)
2349 const char *contents
;
2353 register Lisp_Object val
;
2358 nchars
= multibyte_chars_in_text (contents
, nbytes
);
2362 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2363 bcopy (contents
, SDATA (val
), nbytes
);
2365 STRING_SET_UNIBYTE (val
);
2370 /* Make a string from the data at STR, treating it as multibyte if the
2377 return make_string (str
, strlen (str
));
2381 /* Return an unibyte Lisp_String set up to hold LENGTH characters
2382 occupying LENGTH bytes. */
2385 make_uninit_string (length
)
2389 val
= make_uninit_multibyte_string (length
, length
);
2390 STRING_SET_UNIBYTE (val
);
2395 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2396 which occupy NBYTES bytes. */
2399 make_uninit_multibyte_string (nchars
, nbytes
)
2403 struct Lisp_String
*s
;
2408 s
= allocate_string ();
2409 allocate_string_data (s
, nchars
, nbytes
);
2410 XSETSTRING (string
, s
);
2411 string_chars_consed
+= nbytes
;
2417 /***********************************************************************
2419 ***********************************************************************/
2421 /* We store float cells inside of float_blocks, allocating a new
2422 float_block with malloc whenever necessary. Float cells reclaimed
2423 by GC are put on a free list to be reallocated before allocating
2424 any new float cells from the latest float_block. */
2426 #define FLOAT_BLOCK_SIZE \
2427 (((BLOCK_BYTES - sizeof (struct float_block *) \
2428 /* The compiler might add padding at the end. */ \
2429 - (sizeof (struct Lisp_Float) - sizeof (int))) * CHAR_BIT) \
2430 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2432 #define GETMARKBIT(block,n) \
2433 (((block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2434 >> ((n) % (sizeof(int) * CHAR_BIT))) \
2437 #define SETMARKBIT(block,n) \
2438 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2439 |= 1 << ((n) % (sizeof(int) * CHAR_BIT))
2441 #define UNSETMARKBIT(block,n) \
2442 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2443 &= ~(1 << ((n) % (sizeof(int) * CHAR_BIT)))
2445 #define FLOAT_BLOCK(fptr) \
2446 ((struct float_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2448 #define FLOAT_INDEX(fptr) \
2449 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2453 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2454 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2455 int gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2456 struct float_block
*next
;
2459 #define FLOAT_MARKED_P(fptr) \
2460 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2462 #define FLOAT_MARK(fptr) \
2463 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2465 #define FLOAT_UNMARK(fptr) \
2466 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2468 /* Current float_block. */
2470 struct float_block
*float_block
;
2472 /* Index of first unused Lisp_Float in the current float_block. */
2474 int float_block_index
;
2476 /* Total number of float blocks now in use. */
2480 /* Free-list of Lisp_Floats. */
2482 struct Lisp_Float
*float_free_list
;
2485 /* Initialize float allocation. */
2491 float_block_index
= FLOAT_BLOCK_SIZE
; /* Force alloc of new float_block. */
2492 float_free_list
= 0;
2497 /* Explicitly free a float cell by putting it on the free-list. */
2501 struct Lisp_Float
*ptr
;
2503 *(struct Lisp_Float
**)&ptr
->data
= float_free_list
;
2504 float_free_list
= ptr
;
2508 /* Return a new float object with value FLOAT_VALUE. */
2511 make_float (float_value
)
2514 register Lisp_Object val
;
2516 if (float_free_list
)
2518 /* We use the data field for chaining the free list
2519 so that we won't use the same field that has the mark bit. */
2520 XSETFLOAT (val
, float_free_list
);
2521 float_free_list
= *(struct Lisp_Float
**)&float_free_list
->data
;
2525 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2527 register struct float_block
*new;
2529 new = (struct float_block
*) lisp_align_malloc (sizeof *new,
2531 new->next
= float_block
;
2532 bzero ((char *) new->gcmarkbits
, sizeof new->gcmarkbits
);
2534 float_block_index
= 0;
2537 XSETFLOAT (val
, &float_block
->floats
[float_block_index
]);
2538 float_block_index
++;
2541 XFLOAT_DATA (val
) = float_value
;
2542 eassert (!FLOAT_MARKED_P (XFLOAT (val
)));
2543 consing_since_gc
+= sizeof (struct Lisp_Float
);
2550 /***********************************************************************
2552 ***********************************************************************/
2554 /* We store cons cells inside of cons_blocks, allocating a new
2555 cons_block with malloc whenever necessary. Cons cells reclaimed by
2556 GC are put on a free list to be reallocated before allocating
2557 any new cons cells from the latest cons_block. */
2559 #define CONS_BLOCK_SIZE \
2560 (((BLOCK_BYTES - sizeof (struct cons_block *)) * CHAR_BIT) \
2561 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2563 #define CONS_BLOCK(fptr) \
2564 ((struct cons_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2566 #define CONS_INDEX(fptr) \
2567 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2571 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2572 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2573 int gcmarkbits
[1 + CONS_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2574 struct cons_block
*next
;
2577 #define CONS_MARKED_P(fptr) \
2578 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2580 #define CONS_MARK(fptr) \
2581 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2583 #define CONS_UNMARK(fptr) \
2584 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2586 /* Current cons_block. */
2588 struct cons_block
*cons_block
;
2590 /* Index of first unused Lisp_Cons in the current block. */
2592 int cons_block_index
;
2594 /* Free-list of Lisp_Cons structures. */
2596 struct Lisp_Cons
*cons_free_list
;
2598 /* Total number of cons blocks now in use. */
2603 /* Initialize cons allocation. */
2609 cons_block_index
= CONS_BLOCK_SIZE
; /* Force alloc of new cons_block. */
2615 /* Explicitly free a cons cell by putting it on the free-list. */
2619 struct Lisp_Cons
*ptr
;
2621 *(struct Lisp_Cons
**)&ptr
->cdr
= cons_free_list
;
2625 cons_free_list
= ptr
;
2628 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
2629 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2631 Lisp_Object car
, cdr
;
2633 register Lisp_Object val
;
2637 /* We use the cdr for chaining the free list
2638 so that we won't use the same field that has the mark bit. */
2639 XSETCONS (val
, cons_free_list
);
2640 cons_free_list
= *(struct Lisp_Cons
**)&cons_free_list
->cdr
;
2644 if (cons_block_index
== CONS_BLOCK_SIZE
)
2646 register struct cons_block
*new;
2647 new = (struct cons_block
*) lisp_align_malloc (sizeof *new,
2649 bzero ((char *) new->gcmarkbits
, sizeof new->gcmarkbits
);
2650 new->next
= cons_block
;
2652 cons_block_index
= 0;
2655 XSETCONS (val
, &cons_block
->conses
[cons_block_index
]);
2661 eassert (!CONS_MARKED_P (XCONS (val
)));
2662 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2663 cons_cells_consed
++;
2667 /* Get an error now if there's any junk in the cons free list. */
2671 #ifdef GC_CHECK_CONS_LIST
2672 struct Lisp_Cons
*tail
= cons_free_list
;
2675 tail
= *(struct Lisp_Cons
**)&tail
->cdr
;
2679 /* Make a list of 2, 3, 4 or 5 specified objects. */
2683 Lisp_Object arg1
, arg2
;
2685 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2690 list3 (arg1
, arg2
, arg3
)
2691 Lisp_Object arg1
, arg2
, arg3
;
2693 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2698 list4 (arg1
, arg2
, arg3
, arg4
)
2699 Lisp_Object arg1
, arg2
, arg3
, arg4
;
2701 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2706 list5 (arg1
, arg2
, arg3
, arg4
, arg5
)
2707 Lisp_Object arg1
, arg2
, arg3
, arg4
, arg5
;
2709 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2710 Fcons (arg5
, Qnil
)))));
2714 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
2715 doc
: /* Return a newly created list with specified arguments as elements.
2716 Any number of arguments, even zero arguments, are allowed.
2717 usage: (list &rest OBJECTS) */)
2720 register Lisp_Object
*args
;
2722 register Lisp_Object val
;
2728 val
= Fcons (args
[nargs
], val
);
2734 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2735 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2737 register Lisp_Object length
, init
;
2739 register Lisp_Object val
;
2742 CHECK_NATNUM (length
);
2743 size
= XFASTINT (length
);
2748 val
= Fcons (init
, val
);
2753 val
= Fcons (init
, val
);
2758 val
= Fcons (init
, val
);
2763 val
= Fcons (init
, val
);
2768 val
= Fcons (init
, val
);
2783 /***********************************************************************
2785 ***********************************************************************/
2787 /* Singly-linked list of all vectors. */
2789 struct Lisp_Vector
*all_vectors
;
2791 /* Total number of vector-like objects now in use. */
2796 /* Value is a pointer to a newly allocated Lisp_Vector structure
2797 with room for LEN Lisp_Objects. */
2799 static struct Lisp_Vector
*
2800 allocate_vectorlike (len
, type
)
2804 struct Lisp_Vector
*p
;
2807 #ifdef DOUG_LEA_MALLOC
2808 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
2809 because mapped region contents are not preserved in
2812 mallopt (M_MMAP_MAX
, 0);
2816 nbytes
= sizeof *p
+ (len
- 1) * sizeof p
->contents
[0];
2817 p
= (struct Lisp_Vector
*) lisp_malloc (nbytes
, type
);
2819 #ifdef DOUG_LEA_MALLOC
2820 /* Back to a reasonable maximum of mmap'ed areas. */
2822 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2826 consing_since_gc
+= nbytes
;
2827 vector_cells_consed
+= len
;
2829 p
->next
= all_vectors
;
2836 /* Allocate a vector with NSLOTS slots. */
2838 struct Lisp_Vector
*
2839 allocate_vector (nslots
)
2842 struct Lisp_Vector
*v
= allocate_vectorlike (nslots
, MEM_TYPE_VECTOR
);
2848 /* Allocate other vector-like structures. */
2850 struct Lisp_Hash_Table
*
2851 allocate_hash_table ()
2853 EMACS_INT len
= VECSIZE (struct Lisp_Hash_Table
);
2854 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_HASH_TABLE
);
2858 for (i
= 0; i
< len
; ++i
)
2859 v
->contents
[i
] = Qnil
;
2861 return (struct Lisp_Hash_Table
*) v
;
2868 EMACS_INT len
= VECSIZE (struct window
);
2869 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_WINDOW
);
2872 for (i
= 0; i
< len
; ++i
)
2873 v
->contents
[i
] = Qnil
;
2876 return (struct window
*) v
;
2883 EMACS_INT len
= VECSIZE (struct frame
);
2884 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_FRAME
);
2887 for (i
= 0; i
< len
; ++i
)
2888 v
->contents
[i
] = make_number (0);
2890 return (struct frame
*) v
;
2894 struct Lisp_Process
*
2897 EMACS_INT len
= VECSIZE (struct Lisp_Process
);
2898 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_PROCESS
);
2901 for (i
= 0; i
< len
; ++i
)
2902 v
->contents
[i
] = Qnil
;
2905 return (struct Lisp_Process
*) v
;
2909 struct Lisp_Vector
*
2910 allocate_other_vector (len
)
2913 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_VECTOR
);
2916 for (i
= 0; i
< len
; ++i
)
2917 v
->contents
[i
] = Qnil
;
2924 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
2925 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
2926 See also the function `vector'. */)
2928 register Lisp_Object length
, init
;
2931 register EMACS_INT sizei
;
2933 register struct Lisp_Vector
*p
;
2935 CHECK_NATNUM (length
);
2936 sizei
= XFASTINT (length
);
2938 p
= allocate_vector (sizei
);
2939 for (index
= 0; index
< sizei
; index
++)
2940 p
->contents
[index
] = init
;
2942 XSETVECTOR (vector
, p
);
2947 DEFUN ("make-char-table", Fmake_char_table
, Smake_char_table
, 1, 2, 0,
2948 doc
: /* Return a newly created char-table, with purpose PURPOSE.
2949 Each element is initialized to INIT, which defaults to nil.
2950 PURPOSE should be a symbol which has a `char-table-extra-slots' property.
2951 The property's value should be an integer between 0 and 10. */)
2953 register Lisp_Object purpose
, init
;
2957 CHECK_SYMBOL (purpose
);
2958 n
= Fget (purpose
, Qchar_table_extra_slots
);
2960 if (XINT (n
) < 0 || XINT (n
) > 10)
2961 args_out_of_range (n
, Qnil
);
2962 /* Add 2 to the size for the defalt and parent slots. */
2963 vector
= Fmake_vector (make_number (CHAR_TABLE_STANDARD_SLOTS
+ XINT (n
)),
2965 XCHAR_TABLE (vector
)->top
= Qt
;
2966 XCHAR_TABLE (vector
)->parent
= Qnil
;
2967 XCHAR_TABLE (vector
)->purpose
= purpose
;
2968 XSETCHAR_TABLE (vector
, XCHAR_TABLE (vector
));
2973 /* Return a newly created sub char table with default value DEFALT.
2974 Since a sub char table does not appear as a top level Emacs Lisp
2975 object, we don't need a Lisp interface to make it. */
2978 make_sub_char_table (defalt
)
2982 = Fmake_vector (make_number (SUB_CHAR_TABLE_STANDARD_SLOTS
), Qnil
);
2983 XCHAR_TABLE (vector
)->top
= Qnil
;
2984 XCHAR_TABLE (vector
)->defalt
= defalt
;
2985 XSETCHAR_TABLE (vector
, XCHAR_TABLE (vector
));
2990 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
2991 doc
: /* Return a newly created vector with specified arguments as elements.
2992 Any number of arguments, even zero arguments, are allowed.
2993 usage: (vector &rest OBJECTS) */)
2998 register Lisp_Object len
, val
;
3000 register struct Lisp_Vector
*p
;
3002 XSETFASTINT (len
, nargs
);
3003 val
= Fmake_vector (len
, Qnil
);
3005 for (index
= 0; index
< nargs
; index
++)
3006 p
->contents
[index
] = args
[index
];
3011 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
3012 doc
: /* Create a byte-code object with specified arguments as elements.
3013 The arguments should be the arglist, bytecode-string, constant vector,
3014 stack size, (optional) doc string, and (optional) interactive spec.
3015 The first four arguments are required; at most six have any
3017 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
3022 register Lisp_Object len
, val
;
3024 register struct Lisp_Vector
*p
;
3026 XSETFASTINT (len
, nargs
);
3027 if (!NILP (Vpurify_flag
))
3028 val
= make_pure_vector ((EMACS_INT
) nargs
);
3030 val
= Fmake_vector (len
, Qnil
);
3032 if (STRINGP (args
[1]) && STRING_MULTIBYTE (args
[1]))
3033 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
3034 earlier because they produced a raw 8-bit string for byte-code
3035 and now such a byte-code string is loaded as multibyte while
3036 raw 8-bit characters converted to multibyte form. Thus, now we
3037 must convert them back to the original unibyte form. */
3038 args
[1] = Fstring_as_unibyte (args
[1]);
3041 for (index
= 0; index
< nargs
; index
++)
3043 if (!NILP (Vpurify_flag
))
3044 args
[index
] = Fpurecopy (args
[index
]);
3045 p
->contents
[index
] = args
[index
];
3047 XSETCOMPILED (val
, p
);
3053 /***********************************************************************
3055 ***********************************************************************/
3057 /* Each symbol_block is just under 1020 bytes long, since malloc
3058 really allocates in units of powers of two and uses 4 bytes for its
3061 #define SYMBOL_BLOCK_SIZE \
3062 ((1020 - sizeof (struct symbol_block *)) / sizeof (struct Lisp_Symbol))
3066 /* Place `symbols' first, to preserve alignment. */
3067 struct Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
3068 struct symbol_block
*next
;
3071 /* Current symbol block and index of first unused Lisp_Symbol
3074 struct symbol_block
*symbol_block
;
3075 int symbol_block_index
;
3077 /* List of free symbols. */
3079 struct Lisp_Symbol
*symbol_free_list
;
3081 /* Total number of symbol blocks now in use. */
3083 int n_symbol_blocks
;
3086 /* Initialize symbol allocation. */
3091 symbol_block
= NULL
;
3092 symbol_block_index
= SYMBOL_BLOCK_SIZE
;
3093 symbol_free_list
= 0;
3094 n_symbol_blocks
= 0;
3098 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
3099 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
3100 Its value and function definition are void, and its property list is nil. */)
3104 register Lisp_Object val
;
3105 register struct Lisp_Symbol
*p
;
3107 CHECK_STRING (name
);
3109 if (symbol_free_list
)
3111 XSETSYMBOL (val
, symbol_free_list
);
3112 symbol_free_list
= *(struct Lisp_Symbol
**)&symbol_free_list
->value
;
3116 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
3118 struct symbol_block
*new;
3119 new = (struct symbol_block
*) lisp_malloc (sizeof *new,
3121 new->next
= symbol_block
;
3123 symbol_block_index
= 0;
3126 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
]);
3127 symbol_block_index
++;
3133 p
->value
= Qunbound
;
3134 p
->function
= Qunbound
;
3137 p
->interned
= SYMBOL_UNINTERNED
;
3139 p
->indirect_variable
= 0;
3140 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
3147 /***********************************************************************
3148 Marker (Misc) Allocation
3149 ***********************************************************************/
3151 /* Allocation of markers and other objects that share that structure.
3152 Works like allocation of conses. */
3154 #define MARKER_BLOCK_SIZE \
3155 ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc))
3159 /* Place `markers' first, to preserve alignment. */
3160 union Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
3161 struct marker_block
*next
;
3164 struct marker_block
*marker_block
;
3165 int marker_block_index
;
3167 union Lisp_Misc
*marker_free_list
;
3169 /* Total number of marker blocks now in use. */
3171 int n_marker_blocks
;
3176 marker_block
= NULL
;
3177 marker_block_index
= MARKER_BLOCK_SIZE
;
3178 marker_free_list
= 0;
3179 n_marker_blocks
= 0;
3182 /* Return a newly allocated Lisp_Misc object, with no substructure. */
3189 if (marker_free_list
)
3191 XSETMISC (val
, marker_free_list
);
3192 marker_free_list
= marker_free_list
->u_free
.chain
;
3196 if (marker_block_index
== MARKER_BLOCK_SIZE
)
3198 struct marker_block
*new;
3199 new = (struct marker_block
*) lisp_malloc (sizeof *new,
3201 new->next
= marker_block
;
3203 marker_block_index
= 0;
3205 total_free_markers
+= MARKER_BLOCK_SIZE
;
3207 XSETMISC (val
, &marker_block
->markers
[marker_block_index
]);
3208 marker_block_index
++;
3211 --total_free_markers
;
3212 consing_since_gc
+= sizeof (union Lisp_Misc
);
3213 misc_objects_consed
++;
3214 XMARKER (val
)->gcmarkbit
= 0;
3218 /* Free a Lisp_Misc object */
3224 XMISC (misc
)->u_marker
.type
= Lisp_Misc_Free
;
3225 XMISC (misc
)->u_free
.chain
= marker_free_list
;
3226 marker_free_list
= XMISC (misc
);
3228 total_free_markers
++;
3231 /* Return a Lisp_Misc_Save_Value object containing POINTER and
3232 INTEGER. This is used to package C values to call record_unwind_protect.
3233 The unwind function can get the C values back using XSAVE_VALUE. */
3236 make_save_value (pointer
, integer
)
3240 register Lisp_Object val
;
3241 register struct Lisp_Save_Value
*p
;
3243 val
= allocate_misc ();
3244 XMISCTYPE (val
) = Lisp_Misc_Save_Value
;
3245 p
= XSAVE_VALUE (val
);
3246 p
->pointer
= pointer
;
3247 p
->integer
= integer
;
3252 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
3253 doc
: /* Return a newly allocated marker which does not point at any place. */)
3256 register Lisp_Object val
;
3257 register struct Lisp_Marker
*p
;
3259 val
= allocate_misc ();
3260 XMISCTYPE (val
) = Lisp_Misc_Marker
;
3266 p
->insertion_type
= 0;
3270 /* Put MARKER back on the free list after using it temporarily. */
3273 free_marker (marker
)
3276 unchain_marker (XMARKER (marker
));
3281 /* Return a newly created vector or string with specified arguments as
3282 elements. If all the arguments are characters that can fit
3283 in a string of events, make a string; otherwise, make a vector.
3285 Any number of arguments, even zero arguments, are allowed. */
3288 make_event_array (nargs
, args
)
3294 for (i
= 0; i
< nargs
; i
++)
3295 /* The things that fit in a string
3296 are characters that are in 0...127,
3297 after discarding the meta bit and all the bits above it. */
3298 if (!INTEGERP (args
[i
])
3299 || (XUINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
3300 return Fvector (nargs
, args
);
3302 /* Since the loop exited, we know that all the things in it are
3303 characters, so we can make a string. */
3307 result
= Fmake_string (make_number (nargs
), make_number (0));
3308 for (i
= 0; i
< nargs
; i
++)
3310 SSET (result
, i
, XINT (args
[i
]));
3311 /* Move the meta bit to the right place for a string char. */
3312 if (XINT (args
[i
]) & CHAR_META
)
3313 SSET (result
, i
, SREF (result
, i
) | 0x80);
3322 /************************************************************************
3324 ************************************************************************/
3326 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
3328 /* Conservative C stack marking requires a method to identify possibly
3329 live Lisp objects given a pointer value. We do this by keeping
3330 track of blocks of Lisp data that are allocated in a red-black tree
3331 (see also the comment of mem_node which is the type of nodes in
3332 that tree). Function lisp_malloc adds information for an allocated
3333 block to the red-black tree with calls to mem_insert, and function
3334 lisp_free removes it with mem_delete. Functions live_string_p etc
3335 call mem_find to lookup information about a given pointer in the
3336 tree, and use that to determine if the pointer points to a Lisp
3339 /* Initialize this part of alloc.c. */
3344 mem_z
.left
= mem_z
.right
= MEM_NIL
;
3345 mem_z
.parent
= NULL
;
3346 mem_z
.color
= MEM_BLACK
;
3347 mem_z
.start
= mem_z
.end
= NULL
;
3352 /* Value is a pointer to the mem_node containing START. Value is
3353 MEM_NIL if there is no node in the tree containing START. */
3355 static INLINE
struct mem_node
*
3361 if (start
< min_heap_address
|| start
> max_heap_address
)
3364 /* Make the search always successful to speed up the loop below. */
3365 mem_z
.start
= start
;
3366 mem_z
.end
= (char *) start
+ 1;
3369 while (start
< p
->start
|| start
>= p
->end
)
3370 p
= start
< p
->start
? p
->left
: p
->right
;
3375 /* Insert a new node into the tree for a block of memory with start
3376 address START, end address END, and type TYPE. Value is a
3377 pointer to the node that was inserted. */
3379 static struct mem_node
*
3380 mem_insert (start
, end
, type
)
3384 struct mem_node
*c
, *parent
, *x
;
3386 if (start
< min_heap_address
)
3387 min_heap_address
= start
;
3388 if (end
> max_heap_address
)
3389 max_heap_address
= end
;
3391 /* See where in the tree a node for START belongs. In this
3392 particular application, it shouldn't happen that a node is already
3393 present. For debugging purposes, let's check that. */
3397 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3399 while (c
!= MEM_NIL
)
3401 if (start
>= c
->start
&& start
< c
->end
)
3404 c
= start
< c
->start
? c
->left
: c
->right
;
3407 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3409 while (c
!= MEM_NIL
)
3412 c
= start
< c
->start
? c
->left
: c
->right
;
3415 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3417 /* Create a new node. */
3418 #ifdef GC_MALLOC_CHECK
3419 x
= (struct mem_node
*) _malloc_internal (sizeof *x
);
3423 x
= (struct mem_node
*) xmalloc (sizeof *x
);
3429 x
->left
= x
->right
= MEM_NIL
;
3432 /* Insert it as child of PARENT or install it as root. */
3435 if (start
< parent
->start
)
3443 /* Re-establish red-black tree properties. */
3444 mem_insert_fixup (x
);
3450 /* Re-establish the red-black properties of the tree, and thereby
3451 balance the tree, after node X has been inserted; X is always red. */
3454 mem_insert_fixup (x
)
3457 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3459 /* X is red and its parent is red. This is a violation of
3460 red-black tree property #3. */
3462 if (x
->parent
== x
->parent
->parent
->left
)
3464 /* We're on the left side of our grandparent, and Y is our
3466 struct mem_node
*y
= x
->parent
->parent
->right
;
3468 if (y
->color
== MEM_RED
)
3470 /* Uncle and parent are red but should be black because
3471 X is red. Change the colors accordingly and proceed
3472 with the grandparent. */
3473 x
->parent
->color
= MEM_BLACK
;
3474 y
->color
= MEM_BLACK
;
3475 x
->parent
->parent
->color
= MEM_RED
;
3476 x
= x
->parent
->parent
;
3480 /* Parent and uncle have different colors; parent is
3481 red, uncle is black. */
3482 if (x
== x
->parent
->right
)
3485 mem_rotate_left (x
);
3488 x
->parent
->color
= MEM_BLACK
;
3489 x
->parent
->parent
->color
= MEM_RED
;
3490 mem_rotate_right (x
->parent
->parent
);
3495 /* This is the symmetrical case of above. */
3496 struct mem_node
*y
= x
->parent
->parent
->left
;
3498 if (y
->color
== MEM_RED
)
3500 x
->parent
->color
= MEM_BLACK
;
3501 y
->color
= MEM_BLACK
;
3502 x
->parent
->parent
->color
= MEM_RED
;
3503 x
= x
->parent
->parent
;
3507 if (x
== x
->parent
->left
)
3510 mem_rotate_right (x
);
3513 x
->parent
->color
= MEM_BLACK
;
3514 x
->parent
->parent
->color
= MEM_RED
;
3515 mem_rotate_left (x
->parent
->parent
);
3520 /* The root may have been changed to red due to the algorithm. Set
3521 it to black so that property #5 is satisfied. */
3522 mem_root
->color
= MEM_BLACK
;
3538 /* Turn y's left sub-tree into x's right sub-tree. */
3541 if (y
->left
!= MEM_NIL
)
3542 y
->left
->parent
= x
;
3544 /* Y's parent was x's parent. */
3546 y
->parent
= x
->parent
;
3548 /* Get the parent to point to y instead of x. */
3551 if (x
== x
->parent
->left
)
3552 x
->parent
->left
= y
;
3554 x
->parent
->right
= y
;
3559 /* Put x on y's left. */
3573 mem_rotate_right (x
)
3576 struct mem_node
*y
= x
->left
;
3579 if (y
->right
!= MEM_NIL
)
3580 y
->right
->parent
= x
;
3583 y
->parent
= x
->parent
;
3586 if (x
== x
->parent
->right
)
3587 x
->parent
->right
= y
;
3589 x
->parent
->left
= y
;
3600 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
3606 struct mem_node
*x
, *y
;
3608 if (!z
|| z
== MEM_NIL
)
3611 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
3616 while (y
->left
!= MEM_NIL
)
3620 if (y
->left
!= MEM_NIL
)
3625 x
->parent
= y
->parent
;
3628 if (y
== y
->parent
->left
)
3629 y
->parent
->left
= x
;
3631 y
->parent
->right
= x
;
3638 z
->start
= y
->start
;
3643 if (y
->color
== MEM_BLACK
)
3644 mem_delete_fixup (x
);
3646 #ifdef GC_MALLOC_CHECK
3654 /* Re-establish the red-black properties of the tree, after a
3658 mem_delete_fixup (x
)
3661 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
3663 if (x
== x
->parent
->left
)
3665 struct mem_node
*w
= x
->parent
->right
;
3667 if (w
->color
== MEM_RED
)
3669 w
->color
= MEM_BLACK
;
3670 x
->parent
->color
= MEM_RED
;
3671 mem_rotate_left (x
->parent
);
3672 w
= x
->parent
->right
;
3675 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
3682 if (w
->right
->color
== MEM_BLACK
)
3684 w
->left
->color
= MEM_BLACK
;
3686 mem_rotate_right (w
);
3687 w
= x
->parent
->right
;
3689 w
->color
= x
->parent
->color
;
3690 x
->parent
->color
= MEM_BLACK
;
3691 w
->right
->color
= MEM_BLACK
;
3692 mem_rotate_left (x
->parent
);
3698 struct mem_node
*w
= x
->parent
->left
;
3700 if (w
->color
== MEM_RED
)
3702 w
->color
= MEM_BLACK
;
3703 x
->parent
->color
= MEM_RED
;
3704 mem_rotate_right (x
->parent
);
3705 w
= x
->parent
->left
;
3708 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
3715 if (w
->left
->color
== MEM_BLACK
)
3717 w
->right
->color
= MEM_BLACK
;
3719 mem_rotate_left (w
);
3720 w
= x
->parent
->left
;
3723 w
->color
= x
->parent
->color
;
3724 x
->parent
->color
= MEM_BLACK
;
3725 w
->left
->color
= MEM_BLACK
;
3726 mem_rotate_right (x
->parent
);
3732 x
->color
= MEM_BLACK
;
3736 /* Value is non-zero if P is a pointer to a live Lisp string on
3737 the heap. M is a pointer to the mem_block for P. */
3740 live_string_p (m
, p
)
3744 if (m
->type
== MEM_TYPE_STRING
)
3746 struct string_block
*b
= (struct string_block
*) m
->start
;
3747 int offset
= (char *) p
- (char *) &b
->strings
[0];
3749 /* P must point to the start of a Lisp_String structure, and it
3750 must not be on the free-list. */
3752 && offset
% sizeof b
->strings
[0] == 0
3753 && offset
< (STRING_BLOCK_SIZE
* sizeof b
->strings
[0])
3754 && ((struct Lisp_String
*) p
)->data
!= NULL
);
3761 /* Value is non-zero if P is a pointer to a live Lisp cons on
3762 the heap. M is a pointer to the mem_block for P. */
3769 if (m
->type
== MEM_TYPE_CONS
)
3771 struct cons_block
*b
= (struct cons_block
*) m
->start
;
3772 int offset
= (char *) p
- (char *) &b
->conses
[0];
3774 /* P must point to the start of a Lisp_Cons, not be
3775 one of the unused cells in the current cons block,
3776 and not be on the free-list. */
3778 && offset
% sizeof b
->conses
[0] == 0
3779 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
3781 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
3782 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
3789 /* Value is non-zero if P is a pointer to a live Lisp symbol on
3790 the heap. M is a pointer to the mem_block for P. */
3793 live_symbol_p (m
, p
)
3797 if (m
->type
== MEM_TYPE_SYMBOL
)
3799 struct symbol_block
*b
= (struct symbol_block
*) m
->start
;
3800 int offset
= (char *) p
- (char *) &b
->symbols
[0];
3802 /* P must point to the start of a Lisp_Symbol, not be
3803 one of the unused cells in the current symbol block,
3804 and not be on the free-list. */
3806 && offset
% sizeof b
->symbols
[0] == 0
3807 && offset
< (SYMBOL_BLOCK_SIZE
* sizeof b
->symbols
[0])
3808 && (b
!= symbol_block
3809 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
3810 && !EQ (((struct Lisp_Symbol
*) p
)->function
, Vdead
));
3817 /* Value is non-zero if P is a pointer to a live Lisp float on
3818 the heap. M is a pointer to the mem_block for P. */
3825 if (m
->type
== MEM_TYPE_FLOAT
)
3827 struct float_block
*b
= (struct float_block
*) m
->start
;
3828 int offset
= (char *) p
- (char *) &b
->floats
[0];
3830 /* P must point to the start of a Lisp_Float and not be
3831 one of the unused cells in the current float block. */
3833 && offset
% sizeof b
->floats
[0] == 0
3834 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
3835 && (b
!= float_block
3836 || offset
/ sizeof b
->floats
[0] < float_block_index
));
3843 /* Value is non-zero if P is a pointer to a live Lisp Misc on
3844 the heap. M is a pointer to the mem_block for P. */
3851 if (m
->type
== MEM_TYPE_MISC
)
3853 struct marker_block
*b
= (struct marker_block
*) m
->start
;
3854 int offset
= (char *) p
- (char *) &b
->markers
[0];
3856 /* P must point to the start of a Lisp_Misc, not be
3857 one of the unused cells in the current misc block,
3858 and not be on the free-list. */
3860 && offset
% sizeof b
->markers
[0] == 0
3861 && offset
< (MARKER_BLOCK_SIZE
* sizeof b
->markers
[0])
3862 && (b
!= marker_block
3863 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
3864 && ((union Lisp_Misc
*) p
)->u_marker
.type
!= Lisp_Misc_Free
);
3871 /* Value is non-zero if P is a pointer to a live vector-like object.
3872 M is a pointer to the mem_block for P. */
3875 live_vector_p (m
, p
)
3879 return (p
== m
->start
3880 && m
->type
>= MEM_TYPE_VECTOR
3881 && m
->type
<= MEM_TYPE_WINDOW
);
3885 /* Value is non-zero if P is a pointer to a live buffer. M is a
3886 pointer to the mem_block for P. */
3889 live_buffer_p (m
, p
)
3893 /* P must point to the start of the block, and the buffer
3894 must not have been killed. */
3895 return (m
->type
== MEM_TYPE_BUFFER
3897 && !NILP (((struct buffer
*) p
)->name
));
3900 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
3904 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3906 /* Array of objects that are kept alive because the C stack contains
3907 a pattern that looks like a reference to them . */
3909 #define MAX_ZOMBIES 10
3910 static Lisp_Object zombies
[MAX_ZOMBIES
];
3912 /* Number of zombie objects. */
3914 static int nzombies
;
3916 /* Number of garbage collections. */
3920 /* Average percentage of zombies per collection. */
3922 static double avg_zombies
;
3924 /* Max. number of live and zombie objects. */
3926 static int max_live
, max_zombies
;
3928 /* Average number of live objects per GC. */
3930 static double avg_live
;
3932 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
3933 doc
: /* Show information about live and zombie objects. */)
3936 Lisp_Object args
[8], zombie_list
= Qnil
;
3938 for (i
= 0; i
< nzombies
; i
++)
3939 zombie_list
= Fcons (zombies
[i
], zombie_list
);
3940 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
3941 args
[1] = make_number (ngcs
);
3942 args
[2] = make_float (avg_live
);
3943 args
[3] = make_float (avg_zombies
);
3944 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
3945 args
[5] = make_number (max_live
);
3946 args
[6] = make_number (max_zombies
);
3947 args
[7] = zombie_list
;
3948 return Fmessage (8, args
);
3951 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
3954 /* Mark OBJ if we can prove it's a Lisp_Object. */
3957 mark_maybe_object (obj
)
3960 void *po
= (void *) XPNTR (obj
);
3961 struct mem_node
*m
= mem_find (po
);
3967 switch (XGCTYPE (obj
))
3970 mark_p
= (live_string_p (m
, po
)
3971 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
3975 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
3979 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
3983 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
3986 case Lisp_Vectorlike
:
3987 /* Note: can't check GC_BUFFERP before we know it's a
3988 buffer because checking that dereferences the pointer
3989 PO which might point anywhere. */
3990 if (live_vector_p (m
, po
))
3991 mark_p
= !GC_SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
3992 else if (live_buffer_p (m
, po
))
3993 mark_p
= GC_BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
3997 mark_p
= (live_misc_p (m
, po
) && !XMARKER (obj
)->gcmarkbit
);
4001 case Lisp_Type_Limit
:
4007 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4008 if (nzombies
< MAX_ZOMBIES
)
4009 zombies
[nzombies
] = obj
;
4018 /* If P points to Lisp data, mark that as live if it isn't already
4022 mark_maybe_pointer (p
)
4027 /* Quickly rule out some values which can't point to Lisp data. We
4028 assume that Lisp data is aligned on even addresses. */
4029 if ((EMACS_INT
) p
& 1)
4035 Lisp_Object obj
= Qnil
;
4039 case MEM_TYPE_NON_LISP
:
4040 /* Nothing to do; not a pointer to Lisp memory. */
4043 case MEM_TYPE_BUFFER
:
4044 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P((struct buffer
*)p
))
4045 XSETVECTOR (obj
, p
);
4049 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
4053 case MEM_TYPE_STRING
:
4054 if (live_string_p (m
, p
)
4055 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
4056 XSETSTRING (obj
, p
);
4060 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
4064 case MEM_TYPE_SYMBOL
:
4065 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
4066 XSETSYMBOL (obj
, p
);
4069 case MEM_TYPE_FLOAT
:
4070 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
4074 case MEM_TYPE_VECTOR
:
4075 case MEM_TYPE_PROCESS
:
4076 case MEM_TYPE_HASH_TABLE
:
4077 case MEM_TYPE_FRAME
:
4078 case MEM_TYPE_WINDOW
:
4079 if (live_vector_p (m
, p
))
4082 XSETVECTOR (tem
, p
);
4083 if (!GC_SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
4098 /* Mark Lisp objects referenced from the address range START..END. */
4101 mark_memory (start
, end
)
4107 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4111 /* Make START the pointer to the start of the memory region,
4112 if it isn't already. */
4120 /* Mark Lisp_Objects. */
4121 for (p
= (Lisp_Object
*) start
; (void *) p
< end
; ++p
)
4122 mark_maybe_object (*p
);
4124 /* Mark Lisp data pointed to. This is necessary because, in some
4125 situations, the C compiler optimizes Lisp objects away, so that
4126 only a pointer to them remains. Example:
4128 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
4131 Lisp_Object obj = build_string ("test");
4132 struct Lisp_String *s = XSTRING (obj);
4133 Fgarbage_collect ();
4134 fprintf (stderr, "test `%s'\n", s->data);
4138 Here, `obj' isn't really used, and the compiler optimizes it
4139 away. The only reference to the life string is through the
4142 for (pp
= (void **) start
; (void *) pp
< end
; ++pp
)
4143 mark_maybe_pointer (*pp
);
4146 /* setjmp will work with GCC unless NON_SAVING_SETJMP is defined in
4147 the GCC system configuration. In gcc 3.2, the only systems for
4148 which this is so are i386-sco5 non-ELF, i386-sysv3 (maybe included
4149 by others?) and ns32k-pc532-min. */
4151 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
4153 static int setjmp_tested_p
, longjmps_done
;
4155 #define SETJMP_WILL_LIKELY_WORK "\
4157 Emacs garbage collector has been changed to use conservative stack\n\
4158 marking. Emacs has determined that the method it uses to do the\n\
4159 marking will likely work on your system, but this isn't sure.\n\
4161 If you are a system-programmer, or can get the help of a local wizard\n\
4162 who is, please take a look at the function mark_stack in alloc.c, and\n\
4163 verify that the methods used are appropriate for your system.\n\
4165 Please mail the result to <emacs-devel@gnu.org>.\n\
4168 #define SETJMP_WILL_NOT_WORK "\
4170 Emacs garbage collector has been changed to use conservative stack\n\
4171 marking. Emacs has determined that the default method it uses to do the\n\
4172 marking will not work on your system. We will need a system-dependent\n\
4173 solution for your system.\n\
4175 Please take a look at the function mark_stack in alloc.c, and\n\
4176 try to find a way to make it work on your system.\n\
4178 Note that you may get false negatives, depending on the compiler.\n\
4179 In particular, you need to use -O with GCC for this test.\n\
4181 Please mail the result to <emacs-devel@gnu.org>.\n\
4185 /* Perform a quick check if it looks like setjmp saves registers in a
4186 jmp_buf. Print a message to stderr saying so. When this test
4187 succeeds, this is _not_ a proof that setjmp is sufficient for
4188 conservative stack marking. Only the sources or a disassembly
4199 /* Arrange for X to be put in a register. */
4205 if (longjmps_done
== 1)
4207 /* Came here after the longjmp at the end of the function.
4209 If x == 1, the longjmp has restored the register to its
4210 value before the setjmp, and we can hope that setjmp
4211 saves all such registers in the jmp_buf, although that
4214 For other values of X, either something really strange is
4215 taking place, or the setjmp just didn't save the register. */
4218 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
4221 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
4228 if (longjmps_done
== 1)
4232 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
4235 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4237 /* Abort if anything GCPRO'd doesn't survive the GC. */
4245 for (p
= gcprolist
; p
; p
= p
->next
)
4246 for (i
= 0; i
< p
->nvars
; ++i
)
4247 if (!survives_gc_p (p
->var
[i
]))
4248 /* FIXME: It's not necessarily a bug. It might just be that the
4249 GCPRO is unnecessary or should release the object sooner. */
4253 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4260 fprintf (stderr
, "\nZombies kept alive = %d:\n", nzombies
);
4261 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
4263 fprintf (stderr
, " %d = ", i
);
4264 debug_print (zombies
[i
]);
4268 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4271 /* Mark live Lisp objects on the C stack.
4273 There are several system-dependent problems to consider when
4274 porting this to new architectures:
4278 We have to mark Lisp objects in CPU registers that can hold local
4279 variables or are used to pass parameters.
4281 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
4282 something that either saves relevant registers on the stack, or
4283 calls mark_maybe_object passing it each register's contents.
4285 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
4286 implementation assumes that calling setjmp saves registers we need
4287 to see in a jmp_buf which itself lies on the stack. This doesn't
4288 have to be true! It must be verified for each system, possibly
4289 by taking a look at the source code of setjmp.
4293 Architectures differ in the way their processor stack is organized.
4294 For example, the stack might look like this
4297 | Lisp_Object | size = 4
4299 | something else | size = 2
4301 | Lisp_Object | size = 4
4305 In such a case, not every Lisp_Object will be aligned equally. To
4306 find all Lisp_Object on the stack it won't be sufficient to walk
4307 the stack in steps of 4 bytes. Instead, two passes will be
4308 necessary, one starting at the start of the stack, and a second
4309 pass starting at the start of the stack + 2. Likewise, if the
4310 minimal alignment of Lisp_Objects on the stack is 1, four passes
4311 would be necessary, each one starting with one byte more offset
4312 from the stack start.
4314 The current code assumes by default that Lisp_Objects are aligned
4315 equally on the stack. */
4322 volatile int stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
4325 /* This trick flushes the register windows so that all the state of
4326 the process is contained in the stack. */
4327 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
4328 needed on ia64 too. See mach_dep.c, where it also says inline
4329 assembler doesn't work with relevant proprietary compilers. */
4334 /* Save registers that we need to see on the stack. We need to see
4335 registers used to hold register variables and registers used to
4337 #ifdef GC_SAVE_REGISTERS_ON_STACK
4338 GC_SAVE_REGISTERS_ON_STACK (end
);
4339 #else /* not GC_SAVE_REGISTERS_ON_STACK */
4341 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
4342 setjmp will definitely work, test it
4343 and print a message with the result
4345 if (!setjmp_tested_p
)
4347 setjmp_tested_p
= 1;
4350 #endif /* GC_SETJMP_WORKS */
4353 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
4354 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
4356 /* This assumes that the stack is a contiguous region in memory. If
4357 that's not the case, something has to be done here to iterate
4358 over the stack segments. */
4359 #ifndef GC_LISP_OBJECT_ALIGNMENT
4361 #define GC_LISP_OBJECT_ALIGNMENT __alignof__ (Lisp_Object)
4363 #define GC_LISP_OBJECT_ALIGNMENT sizeof (Lisp_Object)
4366 for (i
= 0; i
< sizeof (Lisp_Object
); i
+= GC_LISP_OBJECT_ALIGNMENT
)
4367 mark_memory ((char *) stack_base
+ i
, end
);
4368 /* Allow for marking a secondary stack, like the register stack on the
4370 #ifdef GC_MARK_SECONDARY_STACK
4371 GC_MARK_SECONDARY_STACK ();
4374 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4380 #endif /* GC_MARK_STACK != 0 */
4384 /***********************************************************************
4385 Pure Storage Management
4386 ***********************************************************************/
4388 /* Allocate room for SIZE bytes from pure Lisp storage and return a
4389 pointer to it. TYPE is the Lisp type for which the memory is
4390 allocated. TYPE < 0 means it's not used for a Lisp object.
4392 If store_pure_type_info is set and TYPE is >= 0, the type of
4393 the allocated object is recorded in pure_types. */
4395 static POINTER_TYPE
*
4396 pure_alloc (size
, type
)
4400 POINTER_TYPE
*result
;
4402 size_t alignment
= (1 << GCTYPEBITS
);
4404 size_t alignment
= sizeof (EMACS_INT
);
4406 /* Give Lisp_Floats an extra alignment. */
4407 if (type
== Lisp_Float
)
4409 #if defined __GNUC__ && __GNUC__ >= 2
4410 alignment
= __alignof (struct Lisp_Float
);
4412 alignment
= sizeof (struct Lisp_Float
);
4418 result
= ALIGN (purebeg
+ pure_bytes_used
, alignment
);
4419 pure_bytes_used
= ((char *)result
- (char *)purebeg
) + size
;
4421 if (pure_bytes_used
<= pure_size
)
4424 /* Don't allocate a large amount here,
4425 because it might get mmap'd and then its address
4426 might not be usable. */
4427 purebeg
= (char *) xmalloc (10000);
4429 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
4430 pure_bytes_used
= 0;
4435 /* Print a warning if PURESIZE is too small. */
4440 if (pure_bytes_used_before_overflow
)
4441 message ("Pure Lisp storage overflow (approx. %d bytes needed)",
4442 (int) (pure_bytes_used
+ pure_bytes_used_before_overflow
));
4446 /* Return a string allocated in pure space. DATA is a buffer holding
4447 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
4448 non-zero means make the result string multibyte.
4450 Must get an error if pure storage is full, since if it cannot hold
4451 a large string it may be able to hold conses that point to that
4452 string; then the string is not protected from gc. */
4455 make_pure_string (data
, nchars
, nbytes
, multibyte
)
4461 struct Lisp_String
*s
;
4463 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4464 s
->data
= (unsigned char *) pure_alloc (nbytes
+ 1, -1);
4466 s
->size_byte
= multibyte
? nbytes
: -1;
4467 bcopy (data
, s
->data
, nbytes
);
4468 s
->data
[nbytes
] = '\0';
4469 s
->intervals
= NULL_INTERVAL
;
4470 XSETSTRING (string
, s
);
4475 /* Return a cons allocated from pure space. Give it pure copies
4476 of CAR as car and CDR as cdr. */
4479 pure_cons (car
, cdr
)
4480 Lisp_Object car
, cdr
;
4482 register Lisp_Object
new;
4483 struct Lisp_Cons
*p
;
4485 p
= (struct Lisp_Cons
*) pure_alloc (sizeof *p
, Lisp_Cons
);
4487 XSETCAR (new, Fpurecopy (car
));
4488 XSETCDR (new, Fpurecopy (cdr
));
4493 /* Value is a float object with value NUM allocated from pure space. */
4496 make_pure_float (num
)
4499 register Lisp_Object
new;
4500 struct Lisp_Float
*p
;
4502 p
= (struct Lisp_Float
*) pure_alloc (sizeof *p
, Lisp_Float
);
4504 XFLOAT_DATA (new) = num
;
4509 /* Return a vector with room for LEN Lisp_Objects allocated from
4513 make_pure_vector (len
)
4517 struct Lisp_Vector
*p
;
4518 size_t size
= sizeof *p
+ (len
- 1) * sizeof (Lisp_Object
);
4520 p
= (struct Lisp_Vector
*) pure_alloc (size
, Lisp_Vectorlike
);
4521 XSETVECTOR (new, p
);
4522 XVECTOR (new)->size
= len
;
4527 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
4528 doc
: /* Make a copy of OBJECT in pure storage.
4529 Recursively copies contents of vectors and cons cells.
4530 Does not copy symbols. Copies strings without text properties. */)
4532 register Lisp_Object obj
;
4534 if (NILP (Vpurify_flag
))
4537 if (PURE_POINTER_P (XPNTR (obj
)))
4541 return pure_cons (XCAR (obj
), XCDR (obj
));
4542 else if (FLOATP (obj
))
4543 return make_pure_float (XFLOAT_DATA (obj
));
4544 else if (STRINGP (obj
))
4545 return make_pure_string (SDATA (obj
), SCHARS (obj
),
4547 STRING_MULTIBYTE (obj
));
4548 else if (COMPILEDP (obj
) || VECTORP (obj
))
4550 register struct Lisp_Vector
*vec
;
4554 size
= XVECTOR (obj
)->size
;
4555 if (size
& PSEUDOVECTOR_FLAG
)
4556 size
&= PSEUDOVECTOR_SIZE_MASK
;
4557 vec
= XVECTOR (make_pure_vector (size
));
4558 for (i
= 0; i
< size
; i
++)
4559 vec
->contents
[i
] = Fpurecopy (XVECTOR (obj
)->contents
[i
]);
4560 if (COMPILEDP (obj
))
4561 XSETCOMPILED (obj
, vec
);
4563 XSETVECTOR (obj
, vec
);
4566 else if (MARKERP (obj
))
4567 error ("Attempt to copy a marker to pure storage");
4574 /***********************************************************************
4576 ***********************************************************************/
4578 /* Put an entry in staticvec, pointing at the variable with address
4582 staticpro (varaddress
)
4583 Lisp_Object
*varaddress
;
4585 staticvec
[staticidx
++] = varaddress
;
4586 if (staticidx
>= NSTATICS
)
4594 struct catchtag
*next
;
4598 /***********************************************************************
4600 ***********************************************************************/
4602 /* Temporarily prevent garbage collection. */
4605 inhibit_garbage_collection ()
4607 int count
= SPECPDL_INDEX ();
4608 int nbits
= min (VALBITS
, BITS_PER_INT
);
4610 specbind (Qgc_cons_threshold
, make_number (((EMACS_INT
) 1 << (nbits
- 1)) - 1));
4615 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
4616 doc
: /* Reclaim storage for Lisp objects no longer needed.
4617 Garbage collection happens automatically if you cons more than
4618 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
4619 `garbage-collect' normally returns a list with info on amount of space in use:
4620 ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)
4621 (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS
4622 (USED-FLOATS . FREE-FLOATS) (USED-INTERVALS . FREE-INTERVALS)
4623 (USED-STRINGS . FREE-STRINGS))
4624 However, if there was overflow in pure space, `garbage-collect'
4625 returns nil, because real GC can't be done. */)
4628 register struct specbinding
*bind
;
4629 struct catchtag
*catch;
4630 struct handler
*handler
;
4631 char stack_top_variable
;
4634 Lisp_Object total
[8];
4635 int count
= SPECPDL_INDEX ();
4636 EMACS_TIME t1
, t2
, t3
;
4641 /* Can't GC if pure storage overflowed because we can't determine
4642 if something is a pure object or not. */
4643 if (pure_bytes_used_before_overflow
)
4646 /* Don't keep undo information around forever.
4647 Do this early on, so it is no problem if the user quits. */
4649 register struct buffer
*nextb
= all_buffers
;
4653 /* If a buffer's undo list is Qt, that means that undo is
4654 turned off in that buffer. Calling truncate_undo_list on
4655 Qt tends to return NULL, which effectively turns undo back on.
4656 So don't call truncate_undo_list if undo_list is Qt. */
4657 if (! EQ (nextb
->undo_list
, Qt
))
4658 truncate_undo_list (nextb
);
4660 /* Shrink buffer gaps, but skip indirect and dead buffers. */
4661 if (nextb
->base_buffer
== 0 && !NILP (nextb
->name
))
4663 /* If a buffer's gap size is more than 10% of the buffer
4664 size, or larger than 2000 bytes, then shrink it
4665 accordingly. Keep a minimum size of 20 bytes. */
4666 int size
= min (2000, max (20, (nextb
->text
->z_byte
/ 10)));
4668 if (nextb
->text
->gap_size
> size
)
4670 struct buffer
*save_current
= current_buffer
;
4671 current_buffer
= nextb
;
4672 make_gap (-(nextb
->text
->gap_size
- size
));
4673 current_buffer
= save_current
;
4677 nextb
= nextb
->next
;
4681 EMACS_GET_TIME (t1
);
4683 /* In case user calls debug_print during GC,
4684 don't let that cause a recursive GC. */
4685 consing_since_gc
= 0;
4687 /* Save what's currently displayed in the echo area. */
4688 message_p
= push_message ();
4689 record_unwind_protect (pop_message_unwind
, Qnil
);
4691 /* Save a copy of the contents of the stack, for debugging. */
4692 #if MAX_SAVE_STACK > 0
4693 if (NILP (Vpurify_flag
))
4695 i
= &stack_top_variable
- stack_bottom
;
4697 if (i
< MAX_SAVE_STACK
)
4699 if (stack_copy
== 0)
4700 stack_copy
= (char *) xmalloc (stack_copy_size
= i
);
4701 else if (stack_copy_size
< i
)
4702 stack_copy
= (char *) xrealloc (stack_copy
, (stack_copy_size
= i
));
4705 if ((EMACS_INT
) (&stack_top_variable
- stack_bottom
) > 0)
4706 bcopy (stack_bottom
, stack_copy
, i
);
4708 bcopy (&stack_top_variable
, stack_copy
, i
);
4712 #endif /* MAX_SAVE_STACK > 0 */
4714 if (garbage_collection_messages
)
4715 message1_nolog ("Garbage collecting...");
4719 shrink_regexp_cache ();
4723 /* clear_marks (); */
4725 /* Mark all the special slots that serve as the roots of accessibility. */
4727 for (i
= 0; i
< staticidx
; i
++)
4728 mark_object (*staticvec
[i
]);
4730 for (bind
= specpdl
; bind
!= specpdl_ptr
; bind
++)
4732 mark_object (bind
->symbol
);
4733 mark_object (bind
->old_value
);
4739 extern void xg_mark_data ();
4744 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
4745 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
4749 register struct gcpro
*tail
;
4750 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
4751 for (i
= 0; i
< tail
->nvars
; i
++)
4752 mark_object (tail
->var
[i
]);
4757 for (catch = catchlist
; catch; catch = catch->next
)
4759 mark_object (catch->tag
);
4760 mark_object (catch->val
);
4762 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
4764 mark_object (handler
->handler
);
4765 mark_object (handler
->var
);
4769 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4773 /* Everything is now marked, except for the things that require special
4774 finalization, i.e. the undo_list.
4775 Look thru every buffer's undo list
4776 for elements that update markers that were not marked,
4779 register struct buffer
*nextb
= all_buffers
;
4783 /* If a buffer's undo list is Qt, that means that undo is
4784 turned off in that buffer. Calling truncate_undo_list on
4785 Qt tends to return NULL, which effectively turns undo back on.
4786 So don't call truncate_undo_list if undo_list is Qt. */
4787 if (! EQ (nextb
->undo_list
, Qt
))
4789 Lisp_Object tail
, prev
;
4790 tail
= nextb
->undo_list
;
4792 while (CONSP (tail
))
4794 if (GC_CONSP (XCAR (tail
))
4795 && GC_MARKERP (XCAR (XCAR (tail
)))
4796 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
4799 nextb
->undo_list
= tail
= XCDR (tail
);
4803 XSETCDR (prev
, tail
);
4813 /* Now that we have stripped the elements that need not be in the
4814 undo_list any more, we can finally mark the list. */
4815 mark_object (nextb
->undo_list
);
4817 nextb
= nextb
->next
;
4823 /* Clear the mark bits that we set in certain root slots. */
4825 unmark_byte_stack ();
4826 VECTOR_UNMARK (&buffer_defaults
);
4827 VECTOR_UNMARK (&buffer_local_symbols
);
4829 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
4835 /* clear_marks (); */
4838 consing_since_gc
= 0;
4839 if (gc_cons_threshold
< 10000)
4840 gc_cons_threshold
= 10000;
4842 if (garbage_collection_messages
)
4844 if (message_p
|| minibuf_level
> 0)
4847 message1_nolog ("Garbage collecting...done");
4850 unbind_to (count
, Qnil
);
4852 total
[0] = Fcons (make_number (total_conses
),
4853 make_number (total_free_conses
));
4854 total
[1] = Fcons (make_number (total_symbols
),
4855 make_number (total_free_symbols
));
4856 total
[2] = Fcons (make_number (total_markers
),
4857 make_number (total_free_markers
));
4858 total
[3] = make_number (total_string_size
);
4859 total
[4] = make_number (total_vector_size
);
4860 total
[5] = Fcons (make_number (total_floats
),
4861 make_number (total_free_floats
));
4862 total
[6] = Fcons (make_number (total_intervals
),
4863 make_number (total_free_intervals
));
4864 total
[7] = Fcons (make_number (total_strings
),
4865 make_number (total_free_strings
));
4867 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4869 /* Compute average percentage of zombies. */
4872 for (i
= 0; i
< 7; ++i
)
4873 if (CONSP (total
[i
]))
4874 nlive
+= XFASTINT (XCAR (total
[i
]));
4876 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
4877 max_live
= max (nlive
, max_live
);
4878 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
4879 max_zombies
= max (nzombies
, max_zombies
);
4884 if (!NILP (Vpost_gc_hook
))
4886 int count
= inhibit_garbage_collection ();
4887 safe_run_hooks (Qpost_gc_hook
);
4888 unbind_to (count
, Qnil
);
4891 /* Accumulate statistics. */
4892 EMACS_GET_TIME (t2
);
4893 EMACS_SUB_TIME (t3
, t2
, t1
);
4894 if (FLOATP (Vgc_elapsed
))
4895 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
) +
4897 EMACS_USECS (t3
) * 1.0e-6);
4900 return Flist (sizeof total
/ sizeof *total
, total
);
4904 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
4905 only interesting objects referenced from glyphs are strings. */
4908 mark_glyph_matrix (matrix
)
4909 struct glyph_matrix
*matrix
;
4911 struct glyph_row
*row
= matrix
->rows
;
4912 struct glyph_row
*end
= row
+ matrix
->nrows
;
4914 for (; row
< end
; ++row
)
4918 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
4920 struct glyph
*glyph
= row
->glyphs
[area
];
4921 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
4923 for (; glyph
< end_glyph
; ++glyph
)
4924 if (GC_STRINGP (glyph
->object
)
4925 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
4926 mark_object (glyph
->object
);
4932 /* Mark Lisp faces in the face cache C. */
4936 struct face_cache
*c
;
4941 for (i
= 0; i
< c
->used
; ++i
)
4943 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
4947 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
4948 mark_object (face
->lface
[j
]);
4955 #ifdef HAVE_WINDOW_SYSTEM
4957 /* Mark Lisp objects in image IMG. */
4963 mark_object (img
->spec
);
4965 if (!NILP (img
->data
.lisp_val
))
4966 mark_object (img
->data
.lisp_val
);
4970 /* Mark Lisp objects in image cache of frame F. It's done this way so
4971 that we don't have to include xterm.h here. */
4974 mark_image_cache (f
)
4977 forall_images_in_image_cache (f
, mark_image
);
4980 #endif /* HAVE_X_WINDOWS */
4984 /* Mark reference to a Lisp_Object.
4985 If the object referred to has not been seen yet, recursively mark
4986 all the references contained in it. */
4988 #define LAST_MARKED_SIZE 500
4989 Lisp_Object last_marked
[LAST_MARKED_SIZE
];
4990 int last_marked_index
;
4992 /* For debugging--call abort when we cdr down this many
4993 links of a list, in mark_object. In debugging,
4994 the call to abort will hit a breakpoint.
4995 Normally this is zero and the check never goes off. */
4996 int mark_object_loop_halt
;
5002 register Lisp_Object obj
= arg
;
5003 #ifdef GC_CHECK_MARKED_OBJECTS
5011 if (PURE_POINTER_P (XPNTR (obj
)))
5014 last_marked
[last_marked_index
++] = obj
;
5015 if (last_marked_index
== LAST_MARKED_SIZE
)
5016 last_marked_index
= 0;
5018 /* Perform some sanity checks on the objects marked here. Abort if
5019 we encounter an object we know is bogus. This increases GC time
5020 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
5021 #ifdef GC_CHECK_MARKED_OBJECTS
5023 po
= (void *) XPNTR (obj
);
5025 /* Check that the object pointed to by PO is known to be a Lisp
5026 structure allocated from the heap. */
5027 #define CHECK_ALLOCATED() \
5029 m = mem_find (po); \
5034 /* Check that the object pointed to by PO is live, using predicate
5036 #define CHECK_LIVE(LIVEP) \
5038 if (!LIVEP (m, po)) \
5042 /* Check both of the above conditions. */
5043 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
5045 CHECK_ALLOCATED (); \
5046 CHECK_LIVE (LIVEP); \
5049 #else /* not GC_CHECK_MARKED_OBJECTS */
5051 #define CHECK_ALLOCATED() (void) 0
5052 #define CHECK_LIVE(LIVEP) (void) 0
5053 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
5055 #endif /* not GC_CHECK_MARKED_OBJECTS */
5057 switch (SWITCH_ENUM_CAST (XGCTYPE (obj
)))
5061 register struct Lisp_String
*ptr
= XSTRING (obj
);
5062 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
5063 MARK_INTERVAL_TREE (ptr
->intervals
);
5065 #ifdef GC_CHECK_STRING_BYTES
5066 /* Check that the string size recorded in the string is the
5067 same as the one recorded in the sdata structure. */
5068 CHECK_STRING_BYTES (ptr
);
5069 #endif /* GC_CHECK_STRING_BYTES */
5073 case Lisp_Vectorlike
:
5074 #ifdef GC_CHECK_MARKED_OBJECTS
5076 if (m
== MEM_NIL
&& !GC_SUBRP (obj
)
5077 && po
!= &buffer_defaults
5078 && po
!= &buffer_local_symbols
)
5080 #endif /* GC_CHECK_MARKED_OBJECTS */
5082 if (GC_BUFFERP (obj
))
5084 if (!VECTOR_MARKED_P (XBUFFER (obj
)))
5086 #ifdef GC_CHECK_MARKED_OBJECTS
5087 if (po
!= &buffer_defaults
&& po
!= &buffer_local_symbols
)
5090 for (b
= all_buffers
; b
&& b
!= po
; b
= b
->next
)
5095 #endif /* GC_CHECK_MARKED_OBJECTS */
5099 else if (GC_SUBRP (obj
))
5101 else if (GC_COMPILEDP (obj
))
5102 /* We could treat this just like a vector, but it is better to
5103 save the COMPILED_CONSTANTS element for last and avoid
5106 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5107 register EMACS_INT size
= ptr
->size
;
5110 if (VECTOR_MARKED_P (ptr
))
5111 break; /* Already marked */
5113 CHECK_LIVE (live_vector_p
);
5114 VECTOR_MARK (ptr
); /* Else mark it */
5115 size
&= PSEUDOVECTOR_SIZE_MASK
;
5116 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5118 if (i
!= COMPILED_CONSTANTS
)
5119 mark_object (ptr
->contents
[i
]);
5121 obj
= ptr
->contents
[COMPILED_CONSTANTS
];
5124 else if (GC_FRAMEP (obj
))
5126 register struct frame
*ptr
= XFRAME (obj
);
5128 if (VECTOR_MARKED_P (ptr
)) break; /* Already marked */
5129 VECTOR_MARK (ptr
); /* Else mark it */
5131 CHECK_LIVE (live_vector_p
);
5132 mark_object (ptr
->name
);
5133 mark_object (ptr
->icon_name
);
5134 mark_object (ptr
->title
);
5135 mark_object (ptr
->focus_frame
);
5136 mark_object (ptr
->selected_window
);
5137 mark_object (ptr
->minibuffer_window
);
5138 mark_object (ptr
->param_alist
);
5139 mark_object (ptr
->scroll_bars
);
5140 mark_object (ptr
->condemned_scroll_bars
);
5141 mark_object (ptr
->menu_bar_items
);
5142 mark_object (ptr
->face_alist
);
5143 mark_object (ptr
->menu_bar_vector
);
5144 mark_object (ptr
->buffer_predicate
);
5145 mark_object (ptr
->buffer_list
);
5146 mark_object (ptr
->menu_bar_window
);
5147 mark_object (ptr
->tool_bar_window
);
5148 mark_face_cache (ptr
->face_cache
);
5149 #ifdef HAVE_WINDOW_SYSTEM
5150 mark_image_cache (ptr
);
5151 mark_object (ptr
->tool_bar_items
);
5152 mark_object (ptr
->desired_tool_bar_string
);
5153 mark_object (ptr
->current_tool_bar_string
);
5154 #endif /* HAVE_WINDOW_SYSTEM */
5156 else if (GC_BOOL_VECTOR_P (obj
))
5158 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5160 if (VECTOR_MARKED_P (ptr
))
5161 break; /* Already marked */
5162 CHECK_LIVE (live_vector_p
);
5163 VECTOR_MARK (ptr
); /* Else mark it */
5165 else if (GC_WINDOWP (obj
))
5167 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5168 struct window
*w
= XWINDOW (obj
);
5171 /* Stop if already marked. */
5172 if (VECTOR_MARKED_P (ptr
))
5176 CHECK_LIVE (live_vector_p
);
5179 /* There is no Lisp data above The member CURRENT_MATRIX in
5180 struct WINDOW. Stop marking when that slot is reached. */
5182 (char *) &ptr
->contents
[i
] < (char *) &w
->current_matrix
;
5184 mark_object (ptr
->contents
[i
]);
5186 /* Mark glyphs for leaf windows. Marking window matrices is
5187 sufficient because frame matrices use the same glyph
5189 if (NILP (w
->hchild
)
5191 && w
->current_matrix
)
5193 mark_glyph_matrix (w
->current_matrix
);
5194 mark_glyph_matrix (w
->desired_matrix
);
5197 else if (GC_HASH_TABLE_P (obj
))
5199 struct Lisp_Hash_Table
*h
= XHASH_TABLE (obj
);
5201 /* Stop if already marked. */
5202 if (VECTOR_MARKED_P (h
))
5206 CHECK_LIVE (live_vector_p
);
5209 /* Mark contents. */
5210 /* Do not mark next_free or next_weak.
5211 Being in the next_weak chain
5212 should not keep the hash table alive.
5213 No need to mark `count' since it is an integer. */
5214 mark_object (h
->test
);
5215 mark_object (h
->weak
);
5216 mark_object (h
->rehash_size
);
5217 mark_object (h
->rehash_threshold
);
5218 mark_object (h
->hash
);
5219 mark_object (h
->next
);
5220 mark_object (h
->index
);
5221 mark_object (h
->user_hash_function
);
5222 mark_object (h
->user_cmp_function
);
5224 /* If hash table is not weak, mark all keys and values.
5225 For weak tables, mark only the vector. */
5226 if (GC_NILP (h
->weak
))
5227 mark_object (h
->key_and_value
);
5229 VECTOR_MARK (XVECTOR (h
->key_and_value
));
5233 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5234 register EMACS_INT size
= ptr
->size
;
5237 if (VECTOR_MARKED_P (ptr
)) break; /* Already marked */
5238 CHECK_LIVE (live_vector_p
);
5239 VECTOR_MARK (ptr
); /* Else mark it */
5240 if (size
& PSEUDOVECTOR_FLAG
)
5241 size
&= PSEUDOVECTOR_SIZE_MASK
;
5243 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5244 mark_object (ptr
->contents
[i
]);
5250 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
5251 struct Lisp_Symbol
*ptrx
;
5253 if (ptr
->gcmarkbit
) break;
5254 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
5256 mark_object (ptr
->value
);
5257 mark_object (ptr
->function
);
5258 mark_object (ptr
->plist
);
5260 if (!PURE_POINTER_P (XSTRING (ptr
->xname
)))
5261 MARK_STRING (XSTRING (ptr
->xname
));
5262 MARK_INTERVAL_TREE (STRING_INTERVALS (ptr
->xname
));
5264 /* Note that we do not mark the obarray of the symbol.
5265 It is safe not to do so because nothing accesses that
5266 slot except to check whether it is nil. */
5270 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun */
5271 XSETSYMBOL (obj
, ptrx
);
5278 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
5279 if (XMARKER (obj
)->gcmarkbit
)
5281 XMARKER (obj
)->gcmarkbit
= 1;
5283 switch (XMISCTYPE (obj
))
5285 case Lisp_Misc_Buffer_Local_Value
:
5286 case Lisp_Misc_Some_Buffer_Local_Value
:
5288 register struct Lisp_Buffer_Local_Value
*ptr
5289 = XBUFFER_LOCAL_VALUE (obj
);
5290 /* If the cdr is nil, avoid recursion for the car. */
5291 if (EQ (ptr
->cdr
, Qnil
))
5293 obj
= ptr
->realvalue
;
5296 mark_object (ptr
->realvalue
);
5297 mark_object (ptr
->buffer
);
5298 mark_object (ptr
->frame
);
5303 case Lisp_Misc_Marker
:
5304 /* DO NOT mark thru the marker's chain.
5305 The buffer's markers chain does not preserve markers from gc;
5306 instead, markers are removed from the chain when freed by gc. */
5309 case Lisp_Misc_Intfwd
:
5310 case Lisp_Misc_Boolfwd
:
5311 case Lisp_Misc_Objfwd
:
5312 case Lisp_Misc_Buffer_Objfwd
:
5313 case Lisp_Misc_Kboard_Objfwd
:
5314 /* Don't bother with Lisp_Buffer_Objfwd,
5315 since all markable slots in current buffer marked anyway. */
5316 /* Don't need to do Lisp_Objfwd, since the places they point
5317 are protected with staticpro. */
5320 case Lisp_Misc_Save_Value
:
5323 register struct Lisp_Save_Value
*ptr
= XSAVE_VALUE (obj
);
5324 /* If DOGC is set, POINTER is the address of a memory
5325 area containing INTEGER potential Lisp_Objects. */
5328 Lisp_Object
*p
= (Lisp_Object
*) ptr
->pointer
;
5330 for (nelt
= ptr
->integer
; nelt
> 0; nelt
--, p
++)
5331 mark_maybe_object (*p
);
5337 case Lisp_Misc_Overlay
:
5339 struct Lisp_Overlay
*ptr
= XOVERLAY (obj
);
5340 mark_object (ptr
->start
);
5341 mark_object (ptr
->end
);
5342 mark_object (ptr
->plist
);
5345 XSETMISC (obj
, ptr
->next
);
5358 register struct Lisp_Cons
*ptr
= XCONS (obj
);
5359 if (CONS_MARKED_P (ptr
)) break;
5360 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
5362 /* If the cdr is nil, avoid recursion for the car. */
5363 if (EQ (ptr
->cdr
, Qnil
))
5369 mark_object (ptr
->car
);
5372 if (cdr_count
== mark_object_loop_halt
)
5378 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
5379 FLOAT_MARK (XFLOAT (obj
));
5390 #undef CHECK_ALLOCATED
5391 #undef CHECK_ALLOCATED_AND_LIVE
5394 /* Mark the pointers in a buffer structure. */
5400 register struct buffer
*buffer
= XBUFFER (buf
);
5401 register Lisp_Object
*ptr
, tmp
;
5402 Lisp_Object base_buffer
;
5404 VECTOR_MARK (buffer
);
5406 MARK_INTERVAL_TREE (BUF_INTERVALS (buffer
));
5408 /* For now, we just don't mark the undo_list. It's done later in
5409 a special way just before the sweep phase, and after stripping
5410 some of its elements that are not needed any more. */
5412 if (buffer
->overlays_before
)
5414 XSETMISC (tmp
, buffer
->overlays_before
);
5417 if (buffer
->overlays_after
)
5419 XSETMISC (tmp
, buffer
->overlays_after
);
5423 for (ptr
= &buffer
->name
;
5424 (char *)ptr
< (char *)buffer
+ sizeof (struct buffer
);
5428 /* If this is an indirect buffer, mark its base buffer. */
5429 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
5431 XSETBUFFER (base_buffer
, buffer
->base_buffer
);
5432 mark_buffer (base_buffer
);
5437 /* Value is non-zero if OBJ will survive the current GC because it's
5438 either marked or does not need to be marked to survive. */
5446 switch (XGCTYPE (obj
))
5453 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
5457 survives_p
= XMARKER (obj
)->gcmarkbit
;
5461 survives_p
= STRING_MARKED_P (XSTRING (obj
));
5464 case Lisp_Vectorlike
:
5465 survives_p
= GC_SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
5469 survives_p
= CONS_MARKED_P (XCONS (obj
));
5473 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
5480 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
5485 /* Sweep: find all structures not marked, and free them. */
5490 /* Remove or mark entries in weak hash tables.
5491 This must be done before any object is unmarked. */
5492 sweep_weak_hash_tables ();
5495 #ifdef GC_CHECK_STRING_BYTES
5496 if (!noninteractive
)
5497 check_string_bytes (1);
5500 /* Put all unmarked conses on free list */
5502 register struct cons_block
*cblk
;
5503 struct cons_block
**cprev
= &cons_block
;
5504 register int lim
= cons_block_index
;
5505 register int num_free
= 0, num_used
= 0;
5509 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
5513 for (i
= 0; i
< lim
; i
++)
5514 if (!CONS_MARKED_P (&cblk
->conses
[i
]))
5517 *(struct Lisp_Cons
**)&cblk
->conses
[i
].cdr
= cons_free_list
;
5518 cons_free_list
= &cblk
->conses
[i
];
5520 cons_free_list
->car
= Vdead
;
5526 CONS_UNMARK (&cblk
->conses
[i
]);
5528 lim
= CONS_BLOCK_SIZE
;
5529 /* If this block contains only free conses and we have already
5530 seen more than two blocks worth of free conses then deallocate
5532 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
5534 *cprev
= cblk
->next
;
5535 /* Unhook from the free list. */
5536 cons_free_list
= *(struct Lisp_Cons
**) &cblk
->conses
[0].cdr
;
5537 lisp_align_free (cblk
);
5542 num_free
+= this_free
;
5543 cprev
= &cblk
->next
;
5546 total_conses
= num_used
;
5547 total_free_conses
= num_free
;
5550 /* Put all unmarked floats on free list */
5552 register struct float_block
*fblk
;
5553 struct float_block
**fprev
= &float_block
;
5554 register int lim
= float_block_index
;
5555 register int num_free
= 0, num_used
= 0;
5557 float_free_list
= 0;
5559 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
5563 for (i
= 0; i
< lim
; i
++)
5564 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
5567 *(struct Lisp_Float
**)&fblk
->floats
[i
].data
= float_free_list
;
5568 float_free_list
= &fblk
->floats
[i
];
5573 FLOAT_UNMARK (&fblk
->floats
[i
]);
5575 lim
= FLOAT_BLOCK_SIZE
;
5576 /* If this block contains only free floats and we have already
5577 seen more than two blocks worth of free floats then deallocate
5579 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
5581 *fprev
= fblk
->next
;
5582 /* Unhook from the free list. */
5583 float_free_list
= *(struct Lisp_Float
**) &fblk
->floats
[0].data
;
5584 lisp_align_free (fblk
);
5589 num_free
+= this_free
;
5590 fprev
= &fblk
->next
;
5593 total_floats
= num_used
;
5594 total_free_floats
= num_free
;
5597 /* Put all unmarked intervals on free list */
5599 register struct interval_block
*iblk
;
5600 struct interval_block
**iprev
= &interval_block
;
5601 register int lim
= interval_block_index
;
5602 register int num_free
= 0, num_used
= 0;
5604 interval_free_list
= 0;
5606 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
5611 for (i
= 0; i
< lim
; i
++)
5613 if (!iblk
->intervals
[i
].gcmarkbit
)
5615 SET_INTERVAL_PARENT (&iblk
->intervals
[i
], interval_free_list
);
5616 interval_free_list
= &iblk
->intervals
[i
];
5622 iblk
->intervals
[i
].gcmarkbit
= 0;
5625 lim
= INTERVAL_BLOCK_SIZE
;
5626 /* If this block contains only free intervals and we have already
5627 seen more than two blocks worth of free intervals then
5628 deallocate this block. */
5629 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
5631 *iprev
= iblk
->next
;
5632 /* Unhook from the free list. */
5633 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
5635 n_interval_blocks
--;
5639 num_free
+= this_free
;
5640 iprev
= &iblk
->next
;
5643 total_intervals
= num_used
;
5644 total_free_intervals
= num_free
;
5647 /* Put all unmarked symbols on free list */
5649 register struct symbol_block
*sblk
;
5650 struct symbol_block
**sprev
= &symbol_block
;
5651 register int lim
= symbol_block_index
;
5652 register int num_free
= 0, num_used
= 0;
5654 symbol_free_list
= NULL
;
5656 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
5659 struct Lisp_Symbol
*sym
= sblk
->symbols
;
5660 struct Lisp_Symbol
*end
= sym
+ lim
;
5662 for (; sym
< end
; ++sym
)
5664 /* Check if the symbol was created during loadup. In such a case
5665 it might be pointed to by pure bytecode which we don't trace,
5666 so we conservatively assume that it is live. */
5667 int pure_p
= PURE_POINTER_P (XSTRING (sym
->xname
));
5669 if (!sym
->gcmarkbit
&& !pure_p
)
5671 *(struct Lisp_Symbol
**) &sym
->value
= symbol_free_list
;
5672 symbol_free_list
= sym
;
5674 symbol_free_list
->function
= Vdead
;
5682 UNMARK_STRING (XSTRING (sym
->xname
));
5687 lim
= SYMBOL_BLOCK_SIZE
;
5688 /* If this block contains only free symbols and we have already
5689 seen more than two blocks worth of free symbols then deallocate
5691 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
5693 *sprev
= sblk
->next
;
5694 /* Unhook from the free list. */
5695 symbol_free_list
= *(struct Lisp_Symbol
**)&sblk
->symbols
[0].value
;
5701 num_free
+= this_free
;
5702 sprev
= &sblk
->next
;
5705 total_symbols
= num_used
;
5706 total_free_symbols
= num_free
;
5709 /* Put all unmarked misc's on free list.
5710 For a marker, first unchain it from the buffer it points into. */
5712 register struct marker_block
*mblk
;
5713 struct marker_block
**mprev
= &marker_block
;
5714 register int lim
= marker_block_index
;
5715 register int num_free
= 0, num_used
= 0;
5717 marker_free_list
= 0;
5719 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
5724 for (i
= 0; i
< lim
; i
++)
5726 if (!mblk
->markers
[i
].u_marker
.gcmarkbit
)
5728 if (mblk
->markers
[i
].u_marker
.type
== Lisp_Misc_Marker
)
5729 unchain_marker (&mblk
->markers
[i
].u_marker
);
5730 /* Set the type of the freed object to Lisp_Misc_Free.
5731 We could leave the type alone, since nobody checks it,
5732 but this might catch bugs faster. */
5733 mblk
->markers
[i
].u_marker
.type
= Lisp_Misc_Free
;
5734 mblk
->markers
[i
].u_free
.chain
= marker_free_list
;
5735 marker_free_list
= &mblk
->markers
[i
];
5741 mblk
->markers
[i
].u_marker
.gcmarkbit
= 0;
5744 lim
= MARKER_BLOCK_SIZE
;
5745 /* If this block contains only free markers and we have already
5746 seen more than two blocks worth of free markers then deallocate
5748 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
5750 *mprev
= mblk
->next
;
5751 /* Unhook from the free list. */
5752 marker_free_list
= mblk
->markers
[0].u_free
.chain
;
5758 num_free
+= this_free
;
5759 mprev
= &mblk
->next
;
5763 total_markers
= num_used
;
5764 total_free_markers
= num_free
;
5767 /* Free all unmarked buffers */
5769 register struct buffer
*buffer
= all_buffers
, *prev
= 0, *next
;
5772 if (!VECTOR_MARKED_P (buffer
))
5775 prev
->next
= buffer
->next
;
5777 all_buffers
= buffer
->next
;
5778 next
= buffer
->next
;
5784 VECTOR_UNMARK (buffer
);
5785 UNMARK_BALANCE_INTERVALS (BUF_INTERVALS (buffer
));
5786 prev
= buffer
, buffer
= buffer
->next
;
5790 /* Free all unmarked vectors */
5792 register struct Lisp_Vector
*vector
= all_vectors
, *prev
= 0, *next
;
5793 total_vector_size
= 0;
5796 if (!VECTOR_MARKED_P (vector
))
5799 prev
->next
= vector
->next
;
5801 all_vectors
= vector
->next
;
5802 next
= vector
->next
;
5810 VECTOR_UNMARK (vector
);
5811 if (vector
->size
& PSEUDOVECTOR_FLAG
)
5812 total_vector_size
+= (PSEUDOVECTOR_SIZE_MASK
& vector
->size
);
5814 total_vector_size
+= vector
->size
;
5815 prev
= vector
, vector
= vector
->next
;
5819 #ifdef GC_CHECK_STRING_BYTES
5820 if (!noninteractive
)
5821 check_string_bytes (1);
5828 /* Debugging aids. */
5830 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
5831 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
5832 This may be helpful in debugging Emacs's memory usage.
5833 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
5838 XSETINT (end
, (EMACS_INT
) sbrk (0) / 1024);
5843 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
5844 doc
: /* Return a list of counters that measure how much consing there has been.
5845 Each of these counters increments for a certain kind of object.
5846 The counters wrap around from the largest positive integer to zero.
5847 Garbage collection does not decrease them.
5848 The elements of the value are as follows:
5849 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
5850 All are in units of 1 = one object consed
5851 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
5853 MISCS include overlays, markers, and some internal types.
5854 Frames, windows, buffers, and subprocesses count as vectors
5855 (but the contents of a buffer's text do not count here). */)
5858 Lisp_Object consed
[8];
5860 consed
[0] = make_number (min (MOST_POSITIVE_FIXNUM
, cons_cells_consed
));
5861 consed
[1] = make_number (min (MOST_POSITIVE_FIXNUM
, floats_consed
));
5862 consed
[2] = make_number (min (MOST_POSITIVE_FIXNUM
, vector_cells_consed
));
5863 consed
[3] = make_number (min (MOST_POSITIVE_FIXNUM
, symbols_consed
));
5864 consed
[4] = make_number (min (MOST_POSITIVE_FIXNUM
, string_chars_consed
));
5865 consed
[5] = make_number (min (MOST_POSITIVE_FIXNUM
, misc_objects_consed
));
5866 consed
[6] = make_number (min (MOST_POSITIVE_FIXNUM
, intervals_consed
));
5867 consed
[7] = make_number (min (MOST_POSITIVE_FIXNUM
, strings_consed
));
5869 return Flist (8, consed
);
5872 int suppress_checking
;
5874 die (msg
, file
, line
)
5879 fprintf (stderr
, "\r\nEmacs fatal error: %s:%d: %s\r\n",
5884 /* Initialization */
5889 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
5891 pure_size
= PURESIZE
;
5892 pure_bytes_used
= 0;
5893 pure_bytes_used_before_overflow
= 0;
5895 /* Initialize the list of free aligned blocks. */
5898 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
5900 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
5904 ignore_warnings
= 1;
5905 #ifdef DOUG_LEA_MALLOC
5906 mallopt (M_TRIM_THRESHOLD
, 128*1024); /* trim threshold */
5907 mallopt (M_MMAP_THRESHOLD
, 64*1024); /* mmap threshold */
5908 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* max. number of mmap'ed areas */
5918 malloc_hysteresis
= 32;
5920 malloc_hysteresis
= 0;
5923 spare_memory
= (char *) malloc (SPARE_MEMORY
);
5925 ignore_warnings
= 0;
5927 byte_stack_list
= 0;
5929 consing_since_gc
= 0;
5930 gc_cons_threshold
= 100000 * sizeof (Lisp_Object
);
5931 #ifdef VIRT_ADDR_VARIES
5932 malloc_sbrk_unused
= 1<<22; /* A large number */
5933 malloc_sbrk_used
= 100000; /* as reasonable as any number */
5934 #endif /* VIRT_ADDR_VARIES */
5941 byte_stack_list
= 0;
5943 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
5944 setjmp_tested_p
= longjmps_done
= 0;
5947 Vgc_elapsed
= make_float (0.0);
5954 DEFVAR_INT ("gc-cons-threshold", &gc_cons_threshold
,
5955 doc
: /* *Number of bytes of consing between garbage collections.
5956 Garbage collection can happen automatically once this many bytes have been
5957 allocated since the last garbage collection. All data types count.
5959 Garbage collection happens automatically only when `eval' is called.
5961 By binding this temporarily to a large number, you can effectively
5962 prevent garbage collection during a part of the program. */);
5964 DEFVAR_INT ("pure-bytes-used", &pure_bytes_used
,
5965 doc
: /* Number of bytes of sharable Lisp data allocated so far. */);
5967 DEFVAR_INT ("cons-cells-consed", &cons_cells_consed
,
5968 doc
: /* Number of cons cells that have been consed so far. */);
5970 DEFVAR_INT ("floats-consed", &floats_consed
,
5971 doc
: /* Number of floats that have been consed so far. */);
5973 DEFVAR_INT ("vector-cells-consed", &vector_cells_consed
,
5974 doc
: /* Number of vector cells that have been consed so far. */);
5976 DEFVAR_INT ("symbols-consed", &symbols_consed
,
5977 doc
: /* Number of symbols that have been consed so far. */);
5979 DEFVAR_INT ("string-chars-consed", &string_chars_consed
,
5980 doc
: /* Number of string characters that have been consed so far. */);
5982 DEFVAR_INT ("misc-objects-consed", &misc_objects_consed
,
5983 doc
: /* Number of miscellaneous objects that have been consed so far. */);
5985 DEFVAR_INT ("intervals-consed", &intervals_consed
,
5986 doc
: /* Number of intervals that have been consed so far. */);
5988 DEFVAR_INT ("strings-consed", &strings_consed
,
5989 doc
: /* Number of strings that have been consed so far. */);
5991 DEFVAR_LISP ("purify-flag", &Vpurify_flag
,
5992 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
5993 This means that certain objects should be allocated in shared (pure) space. */);
5995 DEFVAR_BOOL ("garbage-collection-messages", &garbage_collection_messages
,
5996 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
5997 garbage_collection_messages
= 0;
5999 DEFVAR_LISP ("post-gc-hook", &Vpost_gc_hook
,
6000 doc
: /* Hook run after garbage collection has finished. */);
6001 Vpost_gc_hook
= Qnil
;
6002 Qpost_gc_hook
= intern ("post-gc-hook");
6003 staticpro (&Qpost_gc_hook
);
6005 DEFVAR_LISP ("memory-signal-data", &Vmemory_signal_data
,
6006 doc
: /* Precomputed `signal' argument for memory-full error. */);
6007 /* We build this in advance because if we wait until we need it, we might
6008 not be able to allocate the memory to hold it. */
6011 build_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"));
6013 DEFVAR_LISP ("memory-full", &Vmemory_full
,
6014 doc
: /* Non-nil means we are handling a memory-full error. */);
6015 Vmemory_full
= Qnil
;
6017 staticpro (&Qgc_cons_threshold
);
6018 Qgc_cons_threshold
= intern ("gc-cons-threshold");
6020 staticpro (&Qchar_table_extra_slots
);
6021 Qchar_table_extra_slots
= intern ("char-table-extra-slots");
6023 DEFVAR_LISP ("gc-elapsed", &Vgc_elapsed
,
6024 doc
: /* Accumulated time elapsed in garbage collections.
6025 The time is in seconds as a floating point value. */);
6026 DEFVAR_INT ("gcs-done", &gcs_done
,
6027 doc
: /* Accumulated number of garbage collections done. */);
6032 defsubr (&Smake_byte_code
);
6033 defsubr (&Smake_list
);
6034 defsubr (&Smake_vector
);
6035 defsubr (&Smake_char_table
);
6036 defsubr (&Smake_string
);
6037 defsubr (&Smake_bool_vector
);
6038 defsubr (&Smake_symbol
);
6039 defsubr (&Smake_marker
);
6040 defsubr (&Spurecopy
);
6041 defsubr (&Sgarbage_collect
);
6042 defsubr (&Smemory_limit
);
6043 defsubr (&Smemory_use_counts
);
6045 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
6046 defsubr (&Sgc_status
);
6050 /* arch-tag: 6695ca10-e3c5-4c2c-8bc3-ed26a7dda857
6051 (do not change this comment) */