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, 2005 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., 51 Franklin Street, Fifth Floor,
20 Boston, MA 02110-1301, 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, reinvoke_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) != 0)
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) != 0)
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_ttys
P_ ((void));
307 extern void mark_backtrace
P_ ((void));
308 static void gc_sweep
P_ ((void));
309 static void mark_glyph_matrix
P_ ((struct glyph_matrix
*));
310 static void mark_face_cache
P_ ((struct face_cache
*));
312 #ifdef HAVE_WINDOW_SYSTEM
313 extern void mark_fringe_data
P_ ((void));
314 static void mark_image
P_ ((struct image
*));
315 static void mark_image_cache
P_ ((struct frame
*));
316 #endif /* HAVE_WINDOW_SYSTEM */
318 static struct Lisp_String
*allocate_string
P_ ((void));
319 static void compact_small_strings
P_ ((void));
320 static void free_large_strings
P_ ((void));
321 static void sweep_strings
P_ ((void));
323 extern int message_enable_multibyte
;
325 /* When scanning the C stack for live Lisp objects, Emacs keeps track
326 of what memory allocated via lisp_malloc is intended for what
327 purpose. This enumeration specifies the type of memory. */
338 /* Keep the following vector-like types together, with
339 MEM_TYPE_WINDOW being the last, and MEM_TYPE_VECTOR the
340 first. Or change the code of live_vector_p, for instance. */
348 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
350 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
351 #include <stdio.h> /* For fprintf. */
354 /* A unique object in pure space used to make some Lisp objects
355 on free lists recognizable in O(1). */
359 #ifdef GC_MALLOC_CHECK
361 enum mem_type allocated_mem_type
;
362 int dont_register_blocks
;
364 #endif /* GC_MALLOC_CHECK */
366 /* A node in the red-black tree describing allocated memory containing
367 Lisp data. Each such block is recorded with its start and end
368 address when it is allocated, and removed from the tree when it
371 A red-black tree is a balanced binary tree with the following
374 1. Every node is either red or black.
375 2. Every leaf is black.
376 3. If a node is red, then both of its children are black.
377 4. Every simple path from a node to a descendant leaf contains
378 the same number of black nodes.
379 5. The root is always black.
381 When nodes are inserted into the tree, or deleted from the tree,
382 the tree is "fixed" so that these properties are always true.
384 A red-black tree with N internal nodes has height at most 2
385 log(N+1). Searches, insertions and deletions are done in O(log N).
386 Please see a text book about data structures for a detailed
387 description of red-black trees. Any book worth its salt should
392 /* Children of this node. These pointers are never NULL. When there
393 is no child, the value is MEM_NIL, which points to a dummy node. */
394 struct mem_node
*left
, *right
;
396 /* The parent of this node. In the root node, this is NULL. */
397 struct mem_node
*parent
;
399 /* Start and end of allocated region. */
403 enum {MEM_BLACK
, MEM_RED
} color
;
409 /* Base address of stack. Set in main. */
411 Lisp_Object
*stack_base
;
413 /* Root of the tree describing allocated Lisp memory. */
415 static struct mem_node
*mem_root
;
417 /* Lowest and highest known address in the heap. */
419 static void *min_heap_address
, *max_heap_address
;
421 /* Sentinel node of the tree. */
423 static struct mem_node mem_z
;
424 #define MEM_NIL &mem_z
426 static POINTER_TYPE
*lisp_malloc
P_ ((size_t, enum mem_type
));
427 static struct Lisp_Vector
*allocate_vectorlike
P_ ((EMACS_INT
, enum mem_type
));
428 static void lisp_free
P_ ((POINTER_TYPE
*));
429 static void mark_stack
P_ ((void));
430 static int live_vector_p
P_ ((struct mem_node
*, void *));
431 static int live_buffer_p
P_ ((struct mem_node
*, void *));
432 static int live_string_p
P_ ((struct mem_node
*, void *));
433 static int live_cons_p
P_ ((struct mem_node
*, void *));
434 static int live_symbol_p
P_ ((struct mem_node
*, void *));
435 static int live_float_p
P_ ((struct mem_node
*, void *));
436 static int live_misc_p
P_ ((struct mem_node
*, void *));
437 static void mark_maybe_object
P_ ((Lisp_Object
));
438 static void mark_memory
P_ ((void *, void *));
439 static void mem_init
P_ ((void));
440 static struct mem_node
*mem_insert
P_ ((void *, void *, enum mem_type
));
441 static void mem_insert_fixup
P_ ((struct mem_node
*));
442 static void mem_rotate_left
P_ ((struct mem_node
*));
443 static void mem_rotate_right
P_ ((struct mem_node
*));
444 static void mem_delete
P_ ((struct mem_node
*));
445 static void mem_delete_fixup
P_ ((struct mem_node
*));
446 static INLINE
struct mem_node
*mem_find
P_ ((void *));
448 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
449 static void check_gcpros
P_ ((void));
452 #endif /* GC_MARK_STACK || GC_MALLOC_CHECK */
454 /* Recording what needs to be marked for gc. */
456 struct gcpro
*gcprolist
;
458 /* Addresses of staticpro'd variables. Initialize it to a nonzero
459 value; otherwise some compilers put it into BSS. */
461 #define NSTATICS 1280
462 Lisp_Object
*staticvec
[NSTATICS
] = {&Vpurify_flag
};
464 /* Index of next unused slot in staticvec. */
468 static POINTER_TYPE
*pure_alloc
P_ ((size_t, int));
471 /* Value is SZ rounded up to the next multiple of ALIGNMENT.
472 ALIGNMENT must be a power of 2. */
474 #define ALIGN(ptr, ALIGNMENT) \
475 ((POINTER_TYPE *) ((((EMACS_UINT)(ptr)) + (ALIGNMENT) - 1) \
476 & ~((ALIGNMENT) - 1)))
480 /************************************************************************
482 ************************************************************************/
484 /* Function malloc calls this if it finds we are near exhausting storage. */
490 pending_malloc_warning
= str
;
494 /* Display an already-pending malloc warning. */
497 display_malloc_warning ()
499 call3 (intern ("display-warning"),
501 build_string (pending_malloc_warning
),
502 intern ("emergency"));
503 pending_malloc_warning
= 0;
507 #ifdef DOUG_LEA_MALLOC
508 # define BYTES_USED (mallinfo ().arena)
510 # define BYTES_USED _bytes_used
514 /* Called if malloc returns zero. */
521 #ifndef SYSTEM_MALLOC
522 bytes_used_when_full
= BYTES_USED
;
525 /* The first time we get here, free the spare memory. */
532 /* This used to call error, but if we've run out of memory, we could
533 get infinite recursion trying to build the string. */
535 Fsignal (Qnil
, Vmemory_signal_data
);
538 DEFUN ("memory-full-p", Fmemory_full_p
, Smemory_full_p
, 0, 0, 0,
539 doc
: /* t if memory is nearly full, nil otherwise. */)
542 return (spare_memory
? Qnil
: Qt
);
545 /* Called if we can't allocate relocatable space for a buffer. */
548 buffer_memory_full ()
550 /* If buffers use the relocating allocator, no need to free
551 spare_memory, because we may have plenty of malloc space left
552 that we could get, and if we don't, the malloc that fails will
553 itself cause spare_memory to be freed. If buffers don't use the
554 relocating allocator, treat this like any other failing
563 /* This used to call error, but if we've run out of memory, we could
564 get infinite recursion trying to build the string. */
566 Fsignal (Qnil
, Vmemory_signal_data
);
570 #ifdef XMALLOC_OVERRUN_CHECK
572 /* Check for overrun in malloc'ed buffers by wrapping a 16 byte header
573 and a 16 byte trailer around each block.
575 The header consists of 12 fixed bytes + a 4 byte integer contaning the
576 original block size, while the trailer consists of 16 fixed bytes.
578 The header is used to detect whether this block has been allocated
579 through these functions -- as it seems that some low-level libc
580 functions may bypass the malloc hooks.
584 #define XMALLOC_OVERRUN_CHECK_SIZE 16
586 static char xmalloc_overrun_check_header
[XMALLOC_OVERRUN_CHECK_SIZE
-4] =
587 { 0x9a, 0x9b, 0xae, 0xaf,
588 0xbf, 0xbe, 0xce, 0xcf,
589 0xea, 0xeb, 0xec, 0xed };
591 static char xmalloc_overrun_check_trailer
[XMALLOC_OVERRUN_CHECK_SIZE
] =
592 { 0xaa, 0xab, 0xac, 0xad,
593 0xba, 0xbb, 0xbc, 0xbd,
594 0xca, 0xcb, 0xcc, 0xcd,
595 0xda, 0xdb, 0xdc, 0xdd };
597 /* Macros to insert and extract the block size in the header. */
599 #define XMALLOC_PUT_SIZE(ptr, size) \
600 (ptr[-1] = (size & 0xff), \
601 ptr[-2] = ((size >> 8) & 0xff), \
602 ptr[-3] = ((size >> 16) & 0xff), \
603 ptr[-4] = ((size >> 24) & 0xff))
605 #define XMALLOC_GET_SIZE(ptr) \
606 (size_t)((unsigned)(ptr[-1]) | \
607 ((unsigned)(ptr[-2]) << 8) | \
608 ((unsigned)(ptr[-3]) << 16) | \
609 ((unsigned)(ptr[-4]) << 24))
612 /* The call depth in overrun_check functions. For example, this might happen:
614 overrun_check_malloc()
615 -> malloc -> (via hook)_-> emacs_blocked_malloc
616 -> overrun_check_malloc
617 call malloc (hooks are NULL, so real malloc is called).
618 malloc returns 10000.
619 add overhead, return 10016.
620 <- (back in overrun_check_malloc)
621 add overhead again, return 10032
622 xmalloc returns 10032.
627 overrun_check_free(10032)
629 free(10016) <- crash, because 10000 is the original pointer. */
631 static int check_depth
;
633 /* Like malloc, but wraps allocated block with header and trailer. */
636 overrun_check_malloc (size
)
639 register unsigned char *val
;
640 size_t overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_SIZE
*2 : 0;
642 val
= (unsigned char *) malloc (size
+ overhead
);
643 if (val
&& check_depth
== 1)
645 bcopy (xmalloc_overrun_check_header
, val
, XMALLOC_OVERRUN_CHECK_SIZE
- 4);
646 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
647 XMALLOC_PUT_SIZE(val
, size
);
648 bcopy (xmalloc_overrun_check_trailer
, val
+ size
, XMALLOC_OVERRUN_CHECK_SIZE
);
651 return (POINTER_TYPE
*)val
;
655 /* Like realloc, but checks old block for overrun, and wraps new block
656 with header and trailer. */
659 overrun_check_realloc (block
, size
)
663 register unsigned char *val
= (unsigned char *)block
;
664 size_t overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_SIZE
*2 : 0;
668 && bcmp (xmalloc_overrun_check_header
,
669 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
670 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
672 size_t osize
= XMALLOC_GET_SIZE (val
);
673 if (bcmp (xmalloc_overrun_check_trailer
,
675 XMALLOC_OVERRUN_CHECK_SIZE
))
677 bzero (val
+ osize
, XMALLOC_OVERRUN_CHECK_SIZE
);
678 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
679 bzero (val
, XMALLOC_OVERRUN_CHECK_SIZE
);
682 val
= (unsigned char *) realloc ((POINTER_TYPE
*)val
, size
+ overhead
);
684 if (val
&& check_depth
== 1)
686 bcopy (xmalloc_overrun_check_header
, val
, XMALLOC_OVERRUN_CHECK_SIZE
- 4);
687 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
688 XMALLOC_PUT_SIZE(val
, size
);
689 bcopy (xmalloc_overrun_check_trailer
, val
+ size
, XMALLOC_OVERRUN_CHECK_SIZE
);
692 return (POINTER_TYPE
*)val
;
695 /* Like free, but checks block for overrun. */
698 overrun_check_free (block
)
701 unsigned char *val
= (unsigned char *)block
;
706 && bcmp (xmalloc_overrun_check_header
,
707 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
708 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
710 size_t osize
= XMALLOC_GET_SIZE (val
);
711 if (bcmp (xmalloc_overrun_check_trailer
,
713 XMALLOC_OVERRUN_CHECK_SIZE
))
715 #ifdef XMALLOC_CLEAR_FREE_MEMORY
716 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
717 memset (val
, 0xff, osize
+ XMALLOC_OVERRUN_CHECK_SIZE
*2);
719 bzero (val
+ osize
, XMALLOC_OVERRUN_CHECK_SIZE
);
720 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
721 bzero (val
, XMALLOC_OVERRUN_CHECK_SIZE
);
732 #define malloc overrun_check_malloc
733 #define realloc overrun_check_realloc
734 #define free overrun_check_free
738 /* Like malloc but check for no memory and block interrupt input.. */
744 register POINTER_TYPE
*val
;
747 val
= (POINTER_TYPE
*) malloc (size
);
756 /* Like realloc but check for no memory and block interrupt input.. */
759 xrealloc (block
, size
)
763 register POINTER_TYPE
*val
;
766 /* We must call malloc explicitly when BLOCK is 0, since some
767 reallocs don't do this. */
769 val
= (POINTER_TYPE
*) malloc (size
);
771 val
= (POINTER_TYPE
*) realloc (block
, size
);
774 if (!val
&& size
) memory_full ();
779 /* Like free but block interrupt input. */
791 /* Like strdup, but uses xmalloc. */
797 size_t len
= strlen (s
) + 1;
798 char *p
= (char *) xmalloc (len
);
804 /* Unwind for SAFE_ALLOCA */
807 safe_alloca_unwind (arg
)
810 register struct Lisp_Save_Value
*p
= XSAVE_VALUE (arg
);
820 /* Like malloc but used for allocating Lisp data. NBYTES is the
821 number of bytes to allocate, TYPE describes the intended use of the
822 allcated memory block (for strings, for conses, ...). */
825 static void *lisp_malloc_loser
;
828 static POINTER_TYPE
*
829 lisp_malloc (nbytes
, type
)
837 #ifdef GC_MALLOC_CHECK
838 allocated_mem_type
= type
;
841 val
= (void *) malloc (nbytes
);
844 /* If the memory just allocated cannot be addressed thru a Lisp
845 object's pointer, and it needs to be,
846 that's equivalent to running out of memory. */
847 if (val
&& type
!= MEM_TYPE_NON_LISP
)
850 XSETCONS (tem
, (char *) val
+ nbytes
- 1);
851 if ((char *) XCONS (tem
) != (char *) val
+ nbytes
- 1)
853 lisp_malloc_loser
= val
;
860 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
861 if (val
&& type
!= MEM_TYPE_NON_LISP
)
862 mem_insert (val
, (char *) val
+ nbytes
, type
);
871 /* Free BLOCK. This must be called to free memory allocated with a
872 call to lisp_malloc. */
880 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
881 mem_delete (mem_find (block
));
886 /* Allocation of aligned blocks of memory to store Lisp data. */
887 /* The entry point is lisp_align_malloc which returns blocks of at most */
888 /* BLOCK_BYTES and guarantees they are aligned on a BLOCK_ALIGN boundary. */
891 /* BLOCK_ALIGN has to be a power of 2. */
892 #define BLOCK_ALIGN (1 << 10)
894 /* Padding to leave at the end of a malloc'd block. This is to give
895 malloc a chance to minimize the amount of memory wasted to alignment.
896 It should be tuned to the particular malloc library used.
897 On glibc-2.3.2, malloc never tries to align, so a padding of 0 is best.
898 posix_memalign on the other hand would ideally prefer a value of 4
899 because otherwise, there's 1020 bytes wasted between each ablocks.
900 In Emacs, testing shows that those 1020 can most of the time be
901 efficiently used by malloc to place other objects, so a value of 0 can
902 still preferable unless you have a lot of aligned blocks and virtually
904 #define BLOCK_PADDING 0
905 #define BLOCK_BYTES \
906 (BLOCK_ALIGN - sizeof (struct ablock *) - BLOCK_PADDING)
908 /* Internal data structures and constants. */
910 #define ABLOCKS_SIZE 16
912 /* An aligned block of memory. */
917 char payload
[BLOCK_BYTES
];
918 struct ablock
*next_free
;
920 /* `abase' is the aligned base of the ablocks. */
921 /* It is overloaded to hold the virtual `busy' field that counts
922 the number of used ablock in the parent ablocks.
923 The first ablock has the `busy' field, the others have the `abase'
924 field. To tell the difference, we assume that pointers will have
925 integer values larger than 2 * ABLOCKS_SIZE. The lowest bit of `busy'
926 is used to tell whether the real base of the parent ablocks is `abase'
927 (if not, the word before the first ablock holds a pointer to the
929 struct ablocks
*abase
;
930 /* The padding of all but the last ablock is unused. The padding of
931 the last ablock in an ablocks is not allocated. */
933 char padding
[BLOCK_PADDING
];
937 /* A bunch of consecutive aligned blocks. */
940 struct ablock blocks
[ABLOCKS_SIZE
];
943 /* Size of the block requested from malloc or memalign. */
944 #define ABLOCKS_BYTES (sizeof (struct ablocks) - BLOCK_PADDING)
946 #define ABLOCK_ABASE(block) \
947 (((unsigned long) (block)->abase) <= (1 + 2 * ABLOCKS_SIZE) \
948 ? (struct ablocks *)(block) \
951 /* Virtual `busy' field. */
952 #define ABLOCKS_BUSY(abase) ((abase)->blocks[0].abase)
954 /* Pointer to the (not necessarily aligned) malloc block. */
955 #ifdef HAVE_POSIX_MEMALIGN
956 #define ABLOCKS_BASE(abase) (abase)
958 #define ABLOCKS_BASE(abase) \
959 (1 & (long) ABLOCKS_BUSY (abase) ? abase : ((void**)abase)[-1])
962 /* The list of free ablock. */
963 static struct ablock
*free_ablock
;
965 /* Allocate an aligned block of nbytes.
966 Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be
967 smaller or equal to BLOCK_BYTES. */
968 static POINTER_TYPE
*
969 lisp_align_malloc (nbytes
, type
)
974 struct ablocks
*abase
;
976 eassert (nbytes
<= BLOCK_BYTES
);
980 #ifdef GC_MALLOC_CHECK
981 allocated_mem_type
= type
;
987 EMACS_INT aligned
; /* int gets warning casting to 64-bit pointer. */
989 #ifdef DOUG_LEA_MALLOC
990 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
991 because mapped region contents are not preserved in
993 mallopt (M_MMAP_MAX
, 0);
996 #ifdef HAVE_POSIX_MEMALIGN
998 int err
= posix_memalign (&base
, BLOCK_ALIGN
, ABLOCKS_BYTES
);
1004 base
= malloc (ABLOCKS_BYTES
);
1005 abase
= ALIGN (base
, BLOCK_ALIGN
);
1014 aligned
= (base
== abase
);
1016 ((void**)abase
)[-1] = base
;
1018 #ifdef DOUG_LEA_MALLOC
1019 /* Back to a reasonable maximum of mmap'ed areas. */
1020 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1024 /* If the memory just allocated cannot be addressed thru a Lisp
1025 object's pointer, and it needs to be, that's equivalent to
1026 running out of memory. */
1027 if (type
!= MEM_TYPE_NON_LISP
)
1030 char *end
= (char *) base
+ ABLOCKS_BYTES
- 1;
1031 XSETCONS (tem
, end
);
1032 if ((char *) XCONS (tem
) != end
)
1034 lisp_malloc_loser
= base
;
1042 /* Initialize the blocks and put them on the free list.
1043 Is `base' was not properly aligned, we can't use the last block. */
1044 for (i
= 0; i
< (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1); i
++)
1046 abase
->blocks
[i
].abase
= abase
;
1047 abase
->blocks
[i
].x
.next_free
= free_ablock
;
1048 free_ablock
= &abase
->blocks
[i
];
1050 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (long) aligned
;
1052 eassert (0 == ((EMACS_UINT
)abase
) % BLOCK_ALIGN
);
1053 eassert (ABLOCK_ABASE (&abase
->blocks
[3]) == abase
); /* 3 is arbitrary */
1054 eassert (ABLOCK_ABASE (&abase
->blocks
[0]) == abase
);
1055 eassert (ABLOCKS_BASE (abase
) == base
);
1056 eassert (aligned
== (long) ABLOCKS_BUSY (abase
));
1059 abase
= ABLOCK_ABASE (free_ablock
);
1060 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (2 + (long) ABLOCKS_BUSY (abase
));
1062 free_ablock
= free_ablock
->x
.next_free
;
1064 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1065 if (val
&& type
!= MEM_TYPE_NON_LISP
)
1066 mem_insert (val
, (char *) val
+ nbytes
, type
);
1073 eassert (0 == ((EMACS_UINT
)val
) % BLOCK_ALIGN
);
1078 lisp_align_free (block
)
1079 POINTER_TYPE
*block
;
1081 struct ablock
*ablock
= block
;
1082 struct ablocks
*abase
= ABLOCK_ABASE (ablock
);
1085 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1086 mem_delete (mem_find (block
));
1088 /* Put on free list. */
1089 ablock
->x
.next_free
= free_ablock
;
1090 free_ablock
= ablock
;
1091 /* Update busy count. */
1092 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (-2 + (long) ABLOCKS_BUSY (abase
));
1094 if (2 > (long) ABLOCKS_BUSY (abase
))
1095 { /* All the blocks are free. */
1096 int i
= 0, aligned
= (long) ABLOCKS_BUSY (abase
);
1097 struct ablock
**tem
= &free_ablock
;
1098 struct ablock
*atop
= &abase
->blocks
[aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1];
1102 if (*tem
>= (struct ablock
*) abase
&& *tem
< atop
)
1105 *tem
= (*tem
)->x
.next_free
;
1108 tem
= &(*tem
)->x
.next_free
;
1110 eassert ((aligned
& 1) == aligned
);
1111 eassert (i
== (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1));
1112 free (ABLOCKS_BASE (abase
));
1117 /* Return a new buffer structure allocated from the heap with
1118 a call to lisp_malloc. */
1124 = (struct buffer
*) lisp_malloc (sizeof (struct buffer
),
1130 #ifndef SYSTEM_MALLOC
1132 /* If we released our reserve (due to running out of memory),
1133 and we have a fair amount free once again,
1134 try to set aside another reserve in case we run out once more.
1136 This is called when a relocatable block is freed in ralloc.c. */
1139 refill_memory_reserve ()
1141 if (spare_memory
== 0)
1142 spare_memory
= (char *) malloc ((size_t) SPARE_MEMORY
);
1146 /* Arranging to disable input signals while we're in malloc.
1148 This only works with GNU malloc. To help out systems which can't
1149 use GNU malloc, all the calls to malloc, realloc, and free
1150 elsewhere in the code should be inside a BLOCK_INPUT/UNBLOCK_INPUT
1151 pair; unfortunately, we have no idea what C library functions
1152 might call malloc, so we can't really protect them unless you're
1153 using GNU malloc. Fortunately, most of the major operating systems
1154 can use GNU malloc. */
1158 #ifndef DOUG_LEA_MALLOC
1159 extern void * (*__malloc_hook
) P_ ((size_t));
1160 extern void * (*__realloc_hook
) P_ ((void *, size_t));
1161 extern void (*__free_hook
) P_ ((void *));
1162 /* Else declared in malloc.h, perhaps with an extra arg. */
1163 #endif /* DOUG_LEA_MALLOC */
1164 static void * (*old_malloc_hook
) ();
1165 static void * (*old_realloc_hook
) ();
1166 static void (*old_free_hook
) ();
1168 /* This function is used as the hook for free to call. */
1171 emacs_blocked_free (ptr
)
1176 #ifdef GC_MALLOC_CHECK
1182 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1185 "Freeing `%p' which wasn't allocated with malloc\n", ptr
);
1190 /* fprintf (stderr, "free %p...%p (%p)\n", m->start, m->end, ptr); */
1194 #endif /* GC_MALLOC_CHECK */
1196 __free_hook
= old_free_hook
;
1199 /* If we released our reserve (due to running out of memory),
1200 and we have a fair amount free once again,
1201 try to set aside another reserve in case we run out once more. */
1202 if (spare_memory
== 0
1203 /* Verify there is enough space that even with the malloc
1204 hysteresis this call won't run out again.
1205 The code here is correct as long as SPARE_MEMORY
1206 is substantially larger than the block size malloc uses. */
1207 && (bytes_used_when_full
1208 > BYTES_USED
+ max (malloc_hysteresis
, 4) * SPARE_MEMORY
))
1209 spare_memory
= (char *) malloc ((size_t) SPARE_MEMORY
);
1211 __free_hook
= emacs_blocked_free
;
1212 UNBLOCK_INPUT_ALLOC
;
1216 /* This function is the malloc hook that Emacs uses. */
1219 emacs_blocked_malloc (size
)
1225 __malloc_hook
= old_malloc_hook
;
1226 #ifdef DOUG_LEA_MALLOC
1227 mallopt (M_TOP_PAD
, malloc_hysteresis
* 4096);
1229 __malloc_extra_blocks
= malloc_hysteresis
;
1232 value
= (void *) malloc (size
);
1234 #ifdef GC_MALLOC_CHECK
1236 struct mem_node
*m
= mem_find (value
);
1239 fprintf (stderr
, "Malloc returned %p which is already in use\n",
1241 fprintf (stderr
, "Region in use is %p...%p, %u bytes, type %d\n",
1242 m
->start
, m
->end
, (char *) m
->end
- (char *) m
->start
,
1247 if (!dont_register_blocks
)
1249 mem_insert (value
, (char *) value
+ max (1, size
), allocated_mem_type
);
1250 allocated_mem_type
= MEM_TYPE_NON_LISP
;
1253 #endif /* GC_MALLOC_CHECK */
1255 __malloc_hook
= emacs_blocked_malloc
;
1256 UNBLOCK_INPUT_ALLOC
;
1258 /* fprintf (stderr, "%p malloc\n", value); */
1263 /* This function is the realloc hook that Emacs uses. */
1266 emacs_blocked_realloc (ptr
, size
)
1273 __realloc_hook
= old_realloc_hook
;
1275 #ifdef GC_MALLOC_CHECK
1278 struct mem_node
*m
= mem_find (ptr
);
1279 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1282 "Realloc of %p which wasn't allocated with malloc\n",
1290 /* fprintf (stderr, "%p -> realloc\n", ptr); */
1292 /* Prevent malloc from registering blocks. */
1293 dont_register_blocks
= 1;
1294 #endif /* GC_MALLOC_CHECK */
1296 value
= (void *) realloc (ptr
, size
);
1298 #ifdef GC_MALLOC_CHECK
1299 dont_register_blocks
= 0;
1302 struct mem_node
*m
= mem_find (value
);
1305 fprintf (stderr
, "Realloc returns memory that is already in use\n");
1309 /* Can't handle zero size regions in the red-black tree. */
1310 mem_insert (value
, (char *) value
+ max (size
, 1), MEM_TYPE_NON_LISP
);
1313 /* fprintf (stderr, "%p <- realloc\n", value); */
1314 #endif /* GC_MALLOC_CHECK */
1316 __realloc_hook
= emacs_blocked_realloc
;
1317 UNBLOCK_INPUT_ALLOC
;
1323 #ifdef HAVE_GTK_AND_PTHREAD
1324 /* Called from Fdump_emacs so that when the dumped Emacs starts, it has a
1325 normal malloc. Some thread implementations need this as they call
1326 malloc before main. The pthread_self call in BLOCK_INPUT_ALLOC then
1327 calls malloc because it is the first call, and we have an endless loop. */
1330 reset_malloc_hooks ()
1336 #endif /* HAVE_GTK_AND_PTHREAD */
1339 /* Called from main to set up malloc to use our hooks. */
1342 uninterrupt_malloc ()
1344 #ifdef HAVE_GTK_AND_PTHREAD
1345 pthread_mutexattr_t attr
;
1347 /* GLIBC has a faster way to do this, but lets keep it portable.
1348 This is according to the Single UNIX Specification. */
1349 pthread_mutexattr_init (&attr
);
1350 pthread_mutexattr_settype (&attr
, PTHREAD_MUTEX_RECURSIVE
);
1351 pthread_mutex_init (&alloc_mutex
, &attr
);
1352 #endif /* HAVE_GTK_AND_PTHREAD */
1354 if (__free_hook
!= emacs_blocked_free
)
1355 old_free_hook
= __free_hook
;
1356 __free_hook
= emacs_blocked_free
;
1358 if (__malloc_hook
!= emacs_blocked_malloc
)
1359 old_malloc_hook
= __malloc_hook
;
1360 __malloc_hook
= emacs_blocked_malloc
;
1362 if (__realloc_hook
!= emacs_blocked_realloc
)
1363 old_realloc_hook
= __realloc_hook
;
1364 __realloc_hook
= emacs_blocked_realloc
;
1367 #endif /* not SYNC_INPUT */
1368 #endif /* not SYSTEM_MALLOC */
1372 /***********************************************************************
1374 ***********************************************************************/
1376 /* Number of intervals allocated in an interval_block structure.
1377 The 1020 is 1024 minus malloc overhead. */
1379 #define INTERVAL_BLOCK_SIZE \
1380 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
1382 /* Intervals are allocated in chunks in form of an interval_block
1385 struct interval_block
1387 /* Place `intervals' first, to preserve alignment. */
1388 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
1389 struct interval_block
*next
;
1392 /* Current interval block. Its `next' pointer points to older
1395 struct interval_block
*interval_block
;
1397 /* Index in interval_block above of the next unused interval
1400 static int interval_block_index
;
1402 /* Number of free and live intervals. */
1404 static int total_free_intervals
, total_intervals
;
1406 /* List of free intervals. */
1408 INTERVAL interval_free_list
;
1410 /* Total number of interval blocks now in use. */
1412 int n_interval_blocks
;
1415 /* Initialize interval allocation. */
1420 interval_block
= NULL
;
1421 interval_block_index
= INTERVAL_BLOCK_SIZE
;
1422 interval_free_list
= 0;
1423 n_interval_blocks
= 0;
1427 /* Return a new interval. */
1434 if (interval_free_list
)
1436 val
= interval_free_list
;
1437 interval_free_list
= INTERVAL_PARENT (interval_free_list
);
1441 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
1443 register struct interval_block
*newi
;
1445 newi
= (struct interval_block
*) lisp_malloc (sizeof *newi
,
1448 newi
->next
= interval_block
;
1449 interval_block
= newi
;
1450 interval_block_index
= 0;
1451 n_interval_blocks
++;
1453 val
= &interval_block
->intervals
[interval_block_index
++];
1455 consing_since_gc
+= sizeof (struct interval
);
1457 RESET_INTERVAL (val
);
1463 /* Mark Lisp objects in interval I. */
1466 mark_interval (i
, dummy
)
1467 register INTERVAL i
;
1470 eassert (!i
->gcmarkbit
); /* Intervals are never shared. */
1472 mark_object (i
->plist
);
1476 /* Mark the interval tree rooted in TREE. Don't call this directly;
1477 use the macro MARK_INTERVAL_TREE instead. */
1480 mark_interval_tree (tree
)
1481 register INTERVAL tree
;
1483 /* No need to test if this tree has been marked already; this
1484 function is always called through the MARK_INTERVAL_TREE macro,
1485 which takes care of that. */
1487 traverse_intervals_noorder (tree
, mark_interval
, Qnil
);
1491 /* Mark the interval tree rooted in I. */
1493 #define MARK_INTERVAL_TREE(i) \
1495 if (!NULL_INTERVAL_P (i) && !i->gcmarkbit) \
1496 mark_interval_tree (i); \
1500 #define UNMARK_BALANCE_INTERVALS(i) \
1502 if (! NULL_INTERVAL_P (i)) \
1503 (i) = balance_intervals (i); \
1507 /* Number support. If NO_UNION_TYPE isn't in effect, we
1508 can't create number objects in macros. */
1516 obj
.s
.type
= Lisp_Int
;
1521 /***********************************************************************
1523 ***********************************************************************/
1525 /* Lisp_Strings are allocated in string_block structures. When a new
1526 string_block is allocated, all the Lisp_Strings it contains are
1527 added to a free-list string_free_list. When a new Lisp_String is
1528 needed, it is taken from that list. During the sweep phase of GC,
1529 string_blocks that are entirely free are freed, except two which
1532 String data is allocated from sblock structures. Strings larger
1533 than LARGE_STRING_BYTES, get their own sblock, data for smaller
1534 strings is sub-allocated out of sblocks of size SBLOCK_SIZE.
1536 Sblocks consist internally of sdata structures, one for each
1537 Lisp_String. The sdata structure points to the Lisp_String it
1538 belongs to. The Lisp_String points back to the `u.data' member of
1539 its sdata structure.
1541 When a Lisp_String is freed during GC, it is put back on
1542 string_free_list, and its `data' member and its sdata's `string'
1543 pointer is set to null. The size of the string is recorded in the
1544 `u.nbytes' member of the sdata. So, sdata structures that are no
1545 longer used, can be easily recognized, and it's easy to compact the
1546 sblocks of small strings which we do in compact_small_strings. */
1548 /* Size in bytes of an sblock structure used for small strings. This
1549 is 8192 minus malloc overhead. */
1551 #define SBLOCK_SIZE 8188
1553 /* Strings larger than this are considered large strings. String data
1554 for large strings is allocated from individual sblocks. */
1556 #define LARGE_STRING_BYTES 1024
1558 /* Structure describing string memory sub-allocated from an sblock.
1559 This is where the contents of Lisp strings are stored. */
1563 /* Back-pointer to the string this sdata belongs to. If null, this
1564 structure is free, and the NBYTES member of the union below
1565 contains the string's byte size (the same value that STRING_BYTES
1566 would return if STRING were non-null). If non-null, STRING_BYTES
1567 (STRING) is the size of the data, and DATA contains the string's
1569 struct Lisp_String
*string
;
1571 #ifdef GC_CHECK_STRING_BYTES
1574 unsigned char data
[1];
1576 #define SDATA_NBYTES(S) (S)->nbytes
1577 #define SDATA_DATA(S) (S)->data
1579 #else /* not GC_CHECK_STRING_BYTES */
1583 /* When STRING in non-null. */
1584 unsigned char data
[1];
1586 /* When STRING is null. */
1591 #define SDATA_NBYTES(S) (S)->u.nbytes
1592 #define SDATA_DATA(S) (S)->u.data
1594 #endif /* not GC_CHECK_STRING_BYTES */
1598 /* Structure describing a block of memory which is sub-allocated to
1599 obtain string data memory for strings. Blocks for small strings
1600 are of fixed size SBLOCK_SIZE. Blocks for large strings are made
1601 as large as needed. */
1606 struct sblock
*next
;
1608 /* Pointer to the next free sdata block. This points past the end
1609 of the sblock if there isn't any space left in this block. */
1610 struct sdata
*next_free
;
1612 /* Start of data. */
1613 struct sdata first_data
;
1616 /* Number of Lisp strings in a string_block structure. The 1020 is
1617 1024 minus malloc overhead. */
1619 #define STRING_BLOCK_SIZE \
1620 ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String))
1622 /* Structure describing a block from which Lisp_String structures
1627 /* Place `strings' first, to preserve alignment. */
1628 struct Lisp_String strings
[STRING_BLOCK_SIZE
];
1629 struct string_block
*next
;
1632 /* Head and tail of the list of sblock structures holding Lisp string
1633 data. We always allocate from current_sblock. The NEXT pointers
1634 in the sblock structures go from oldest_sblock to current_sblock. */
1636 static struct sblock
*oldest_sblock
, *current_sblock
;
1638 /* List of sblocks for large strings. */
1640 static struct sblock
*large_sblocks
;
1642 /* List of string_block structures, and how many there are. */
1644 static struct string_block
*string_blocks
;
1645 static int n_string_blocks
;
1647 /* Free-list of Lisp_Strings. */
1649 static struct Lisp_String
*string_free_list
;
1651 /* Number of live and free Lisp_Strings. */
1653 static int total_strings
, total_free_strings
;
1655 /* Number of bytes used by live strings. */
1657 static int total_string_size
;
1659 /* Given a pointer to a Lisp_String S which is on the free-list
1660 string_free_list, return a pointer to its successor in the
1663 #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S))
1665 /* Return a pointer to the sdata structure belonging to Lisp string S.
1666 S must be live, i.e. S->data must not be null. S->data is actually
1667 a pointer to the `u.data' member of its sdata structure; the
1668 structure starts at a constant offset in front of that. */
1670 #ifdef GC_CHECK_STRING_BYTES
1672 #define SDATA_OF_STRING(S) \
1673 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *) \
1674 - sizeof (EMACS_INT)))
1676 #else /* not GC_CHECK_STRING_BYTES */
1678 #define SDATA_OF_STRING(S) \
1679 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *)))
1681 #endif /* not GC_CHECK_STRING_BYTES */
1684 #ifdef GC_CHECK_STRING_OVERRUN
1686 /* We check for overrun in string data blocks by appending a small
1687 "cookie" after each allocated string data block, and check for the
1688 presence of this cookie during GC. */
1690 #define GC_STRING_OVERRUN_COOKIE_SIZE 4
1691 static char string_overrun_cookie
[GC_STRING_OVERRUN_COOKIE_SIZE
] =
1692 { 0xde, 0xad, 0xbe, 0xef };
1695 #define GC_STRING_OVERRUN_COOKIE_SIZE 0
1698 /* Value is the size of an sdata structure large enough to hold NBYTES
1699 bytes of string data. The value returned includes a terminating
1700 NUL byte, the size of the sdata structure, and padding. */
1702 #ifdef GC_CHECK_STRING_BYTES
1704 #define SDATA_SIZE(NBYTES) \
1705 ((sizeof (struct Lisp_String *) \
1707 + sizeof (EMACS_INT) \
1708 + sizeof (EMACS_INT) - 1) \
1709 & ~(sizeof (EMACS_INT) - 1))
1711 #else /* not GC_CHECK_STRING_BYTES */
1713 #define SDATA_SIZE(NBYTES) \
1714 ((sizeof (struct Lisp_String *) \
1716 + sizeof (EMACS_INT) - 1) \
1717 & ~(sizeof (EMACS_INT) - 1))
1719 #endif /* not GC_CHECK_STRING_BYTES */
1721 /* Extra bytes to allocate for each string. */
1723 #define GC_STRING_EXTRA (GC_STRING_OVERRUN_COOKIE_SIZE)
1725 /* Initialize string allocation. Called from init_alloc_once. */
1730 total_strings
= total_free_strings
= total_string_size
= 0;
1731 oldest_sblock
= current_sblock
= large_sblocks
= NULL
;
1732 string_blocks
= NULL
;
1733 n_string_blocks
= 0;
1734 string_free_list
= NULL
;
1738 #ifdef GC_CHECK_STRING_BYTES
1740 static int check_string_bytes_count
;
1742 void check_string_bytes
P_ ((int));
1743 void check_sblock
P_ ((struct sblock
*));
1745 #define CHECK_STRING_BYTES(S) STRING_BYTES (S)
1748 /* Like GC_STRING_BYTES, but with debugging check. */
1752 struct Lisp_String
*s
;
1754 int nbytes
= (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1755 if (!PURE_POINTER_P (s
)
1757 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1762 /* Check validity of Lisp strings' string_bytes member in B. */
1768 struct sdata
*from
, *end
, *from_end
;
1772 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1774 /* Compute the next FROM here because copying below may
1775 overwrite data we need to compute it. */
1778 /* Check that the string size recorded in the string is the
1779 same as the one recorded in the sdata structure. */
1781 CHECK_STRING_BYTES (from
->string
);
1784 nbytes
= GC_STRING_BYTES (from
->string
);
1786 nbytes
= SDATA_NBYTES (from
);
1788 nbytes
= SDATA_SIZE (nbytes
);
1789 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
1794 /* Check validity of Lisp strings' string_bytes member. ALL_P
1795 non-zero means check all strings, otherwise check only most
1796 recently allocated strings. Used for hunting a bug. */
1799 check_string_bytes (all_p
)
1806 for (b
= large_sblocks
; b
; b
= b
->next
)
1808 struct Lisp_String
*s
= b
->first_data
.string
;
1810 CHECK_STRING_BYTES (s
);
1813 for (b
= oldest_sblock
; b
; b
= b
->next
)
1817 check_sblock (current_sblock
);
1820 #endif /* GC_CHECK_STRING_BYTES */
1822 #ifdef GC_CHECK_STRING_FREE_LIST
1824 /* Walk through the string free list looking for bogus next pointers.
1825 This may catch buffer overrun from a previous string. */
1828 check_string_free_list ()
1830 struct Lisp_String
*s
;
1832 /* Pop a Lisp_String off the free-list. */
1833 s
= string_free_list
;
1836 if ((unsigned)s
< 1024)
1838 s
= NEXT_FREE_LISP_STRING (s
);
1842 #define check_string_free_list()
1845 /* Return a new Lisp_String. */
1847 static struct Lisp_String
*
1850 struct Lisp_String
*s
;
1852 /* If the free-list is empty, allocate a new string_block, and
1853 add all the Lisp_Strings in it to the free-list. */
1854 if (string_free_list
== NULL
)
1856 struct string_block
*b
;
1859 b
= (struct string_block
*) lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1860 bzero (b
, sizeof *b
);
1861 b
->next
= string_blocks
;
1865 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1868 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1869 string_free_list
= s
;
1872 total_free_strings
+= STRING_BLOCK_SIZE
;
1875 check_string_free_list ();
1877 /* Pop a Lisp_String off the free-list. */
1878 s
= string_free_list
;
1879 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1881 /* Probably not strictly necessary, but play it safe. */
1882 bzero (s
, sizeof *s
);
1884 --total_free_strings
;
1887 consing_since_gc
+= sizeof *s
;
1889 #ifdef GC_CHECK_STRING_BYTES
1896 if (++check_string_bytes_count
== 200)
1898 check_string_bytes_count
= 0;
1899 check_string_bytes (1);
1902 check_string_bytes (0);
1904 #endif /* GC_CHECK_STRING_BYTES */
1910 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1911 plus a NUL byte at the end. Allocate an sdata structure for S, and
1912 set S->data to its `u.data' member. Store a NUL byte at the end of
1913 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1914 S->data if it was initially non-null. */
1917 allocate_string_data (s
, nchars
, nbytes
)
1918 struct Lisp_String
*s
;
1921 struct sdata
*data
, *old_data
;
1923 int needed
, old_nbytes
;
1925 /* Determine the number of bytes needed to store NBYTES bytes
1927 needed
= SDATA_SIZE (nbytes
);
1929 if (nbytes
> LARGE_STRING_BYTES
)
1931 size_t size
= sizeof *b
- sizeof (struct sdata
) + needed
;
1933 #ifdef DOUG_LEA_MALLOC
1934 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1935 because mapped region contents are not preserved in
1938 In case you think of allowing it in a dumped Emacs at the
1939 cost of not being able to re-dump, there's another reason:
1940 mmap'ed data typically have an address towards the top of the
1941 address space, which won't fit into an EMACS_INT (at least on
1942 32-bit systems with the current tagging scheme). --fx */
1944 mallopt (M_MMAP_MAX
, 0);
1948 b
= (struct sblock
*) lisp_malloc (size
+ GC_STRING_EXTRA
, MEM_TYPE_NON_LISP
);
1950 #ifdef DOUG_LEA_MALLOC
1951 /* Back to a reasonable maximum of mmap'ed areas. */
1953 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1957 b
->next_free
= &b
->first_data
;
1958 b
->first_data
.string
= NULL
;
1959 b
->next
= large_sblocks
;
1962 else if (current_sblock
== NULL
1963 || (((char *) current_sblock
+ SBLOCK_SIZE
1964 - (char *) current_sblock
->next_free
)
1965 < (needed
+ GC_STRING_EXTRA
)))
1967 /* Not enough room in the current sblock. */
1968 b
= (struct sblock
*) lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
1969 b
->next_free
= &b
->first_data
;
1970 b
->first_data
.string
= NULL
;
1974 current_sblock
->next
= b
;
1982 old_data
= s
->data
? SDATA_OF_STRING (s
) : NULL
;
1983 old_nbytes
= GC_STRING_BYTES (s
);
1985 data
= b
->next_free
;
1987 s
->data
= SDATA_DATA (data
);
1988 #ifdef GC_CHECK_STRING_BYTES
1989 SDATA_NBYTES (data
) = nbytes
;
1992 s
->size_byte
= nbytes
;
1993 s
->data
[nbytes
] = '\0';
1994 #ifdef GC_CHECK_STRING_OVERRUN
1995 bcopy (string_overrun_cookie
, (char *) data
+ needed
,
1996 GC_STRING_OVERRUN_COOKIE_SIZE
);
1998 b
->next_free
= (struct sdata
*) ((char *) data
+ needed
+ GC_STRING_EXTRA
);
2000 /* If S had already data assigned, mark that as free by setting its
2001 string back-pointer to null, and recording the size of the data
2005 SDATA_NBYTES (old_data
) = old_nbytes
;
2006 old_data
->string
= NULL
;
2009 consing_since_gc
+= needed
;
2013 /* Sweep and compact strings. */
2018 struct string_block
*b
, *next
;
2019 struct string_block
*live_blocks
= NULL
;
2021 string_free_list
= NULL
;
2022 total_strings
= total_free_strings
= 0;
2023 total_string_size
= 0;
2025 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
2026 for (b
= string_blocks
; b
; b
= next
)
2029 struct Lisp_String
*free_list_before
= string_free_list
;
2033 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
2035 struct Lisp_String
*s
= b
->strings
+ i
;
2039 /* String was not on free-list before. */
2040 if (STRING_MARKED_P (s
))
2042 /* String is live; unmark it and its intervals. */
2045 if (!NULL_INTERVAL_P (s
->intervals
))
2046 UNMARK_BALANCE_INTERVALS (s
->intervals
);
2049 total_string_size
+= STRING_BYTES (s
);
2053 /* String is dead. Put it on the free-list. */
2054 struct sdata
*data
= SDATA_OF_STRING (s
);
2056 /* Save the size of S in its sdata so that we know
2057 how large that is. Reset the sdata's string
2058 back-pointer so that we know it's free. */
2059 #ifdef GC_CHECK_STRING_BYTES
2060 if (GC_STRING_BYTES (s
) != SDATA_NBYTES (data
))
2063 data
->u
.nbytes
= GC_STRING_BYTES (s
);
2065 data
->string
= NULL
;
2067 /* Reset the strings's `data' member so that we
2071 /* Put the string on the free-list. */
2072 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2073 string_free_list
= s
;
2079 /* S was on the free-list before. Put it there again. */
2080 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2081 string_free_list
= s
;
2086 /* Free blocks that contain free Lisp_Strings only, except
2087 the first two of them. */
2088 if (nfree
== STRING_BLOCK_SIZE
2089 && total_free_strings
> STRING_BLOCK_SIZE
)
2093 string_free_list
= free_list_before
;
2097 total_free_strings
+= nfree
;
2098 b
->next
= live_blocks
;
2103 check_string_free_list ();
2105 string_blocks
= live_blocks
;
2106 free_large_strings ();
2107 compact_small_strings ();
2109 check_string_free_list ();
2113 /* Free dead large strings. */
2116 free_large_strings ()
2118 struct sblock
*b
, *next
;
2119 struct sblock
*live_blocks
= NULL
;
2121 for (b
= large_sblocks
; b
; b
= next
)
2125 if (b
->first_data
.string
== NULL
)
2129 b
->next
= live_blocks
;
2134 large_sblocks
= live_blocks
;
2138 /* Compact data of small strings. Free sblocks that don't contain
2139 data of live strings after compaction. */
2142 compact_small_strings ()
2144 struct sblock
*b
, *tb
, *next
;
2145 struct sdata
*from
, *to
, *end
, *tb_end
;
2146 struct sdata
*to_end
, *from_end
;
2148 /* TB is the sblock we copy to, TO is the sdata within TB we copy
2149 to, and TB_END is the end of TB. */
2151 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2152 to
= &tb
->first_data
;
2154 /* Step through the blocks from the oldest to the youngest. We
2155 expect that old blocks will stabilize over time, so that less
2156 copying will happen this way. */
2157 for (b
= oldest_sblock
; b
; b
= b
->next
)
2160 xassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
2162 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
2164 /* Compute the next FROM here because copying below may
2165 overwrite data we need to compute it. */
2168 #ifdef GC_CHECK_STRING_BYTES
2169 /* Check that the string size recorded in the string is the
2170 same as the one recorded in the sdata structure. */
2172 && GC_STRING_BYTES (from
->string
) != SDATA_NBYTES (from
))
2174 #endif /* GC_CHECK_STRING_BYTES */
2177 nbytes
= GC_STRING_BYTES (from
->string
);
2179 nbytes
= SDATA_NBYTES (from
);
2181 if (nbytes
> LARGE_STRING_BYTES
)
2184 nbytes
= SDATA_SIZE (nbytes
);
2185 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
2187 #ifdef GC_CHECK_STRING_OVERRUN
2188 if (bcmp (string_overrun_cookie
,
2189 ((char *) from_end
) - GC_STRING_OVERRUN_COOKIE_SIZE
,
2190 GC_STRING_OVERRUN_COOKIE_SIZE
))
2194 /* FROM->string non-null means it's alive. Copy its data. */
2197 /* If TB is full, proceed with the next sblock. */
2198 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2199 if (to_end
> tb_end
)
2203 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2204 to
= &tb
->first_data
;
2205 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2208 /* Copy, and update the string's `data' pointer. */
2211 xassert (tb
!= b
|| to
<= from
);
2212 safe_bcopy ((char *) from
, (char *) to
, nbytes
+ GC_STRING_EXTRA
);
2213 to
->string
->data
= SDATA_DATA (to
);
2216 /* Advance past the sdata we copied to. */
2222 /* The rest of the sblocks following TB don't contain live data, so
2223 we can free them. */
2224 for (b
= tb
->next
; b
; b
= next
)
2232 current_sblock
= tb
;
2236 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
2237 doc
: /* Return a newly created string of length LENGTH, with INIT in each element.
2238 LENGTH must be an integer.
2239 INIT must be an integer that represents a character. */)
2241 Lisp_Object length
, init
;
2243 register Lisp_Object val
;
2244 register unsigned char *p
, *end
;
2247 CHECK_NATNUM (length
);
2248 CHECK_NUMBER (init
);
2251 if (SINGLE_BYTE_CHAR_P (c
))
2253 nbytes
= XINT (length
);
2254 val
= make_uninit_string (nbytes
);
2256 end
= p
+ SCHARS (val
);
2262 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
2263 int len
= CHAR_STRING (c
, str
);
2265 nbytes
= len
* XINT (length
);
2266 val
= make_uninit_multibyte_string (XINT (length
), nbytes
);
2271 bcopy (str
, p
, len
);
2281 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
2282 doc
: /* Return a new bool-vector of length LENGTH, using INIT for as each element.
2283 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
2285 Lisp_Object length
, init
;
2287 register Lisp_Object val
;
2288 struct Lisp_Bool_Vector
*p
;
2290 int length_in_chars
, length_in_elts
, bits_per_value
;
2292 CHECK_NATNUM (length
);
2294 bits_per_value
= sizeof (EMACS_INT
) * BOOL_VECTOR_BITS_PER_CHAR
;
2296 length_in_elts
= (XFASTINT (length
) + bits_per_value
- 1) / bits_per_value
;
2297 length_in_chars
= ((XFASTINT (length
) + BOOL_VECTOR_BITS_PER_CHAR
- 1)
2298 / BOOL_VECTOR_BITS_PER_CHAR
);
2300 /* We must allocate one more elements than LENGTH_IN_ELTS for the
2301 slot `size' of the struct Lisp_Bool_Vector. */
2302 val
= Fmake_vector (make_number (length_in_elts
+ 1), Qnil
);
2303 p
= XBOOL_VECTOR (val
);
2305 /* Get rid of any bits that would cause confusion. */
2307 XSETBOOL_VECTOR (val
, p
);
2308 p
->size
= XFASTINT (length
);
2310 real_init
= (NILP (init
) ? 0 : -1);
2311 for (i
= 0; i
< length_in_chars
; i
++)
2312 p
->data
[i
] = real_init
;
2314 /* Clear the extraneous bits in the last byte. */
2315 if (XINT (length
) != length_in_chars
* BOOL_VECTOR_BITS_PER_CHAR
)
2316 XBOOL_VECTOR (val
)->data
[length_in_chars
- 1]
2317 &= (1 << (XINT (length
) % BOOL_VECTOR_BITS_PER_CHAR
)) - 1;
2323 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
2324 of characters from the contents. This string may be unibyte or
2325 multibyte, depending on the contents. */
2328 make_string (contents
, nbytes
)
2329 const char *contents
;
2332 register Lisp_Object val
;
2333 int nchars
, multibyte_nbytes
;
2335 parse_str_as_multibyte (contents
, nbytes
, &nchars
, &multibyte_nbytes
);
2336 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
2337 /* CONTENTS contains no multibyte sequences or contains an invalid
2338 multibyte sequence. We must make unibyte string. */
2339 val
= make_unibyte_string (contents
, nbytes
);
2341 val
= make_multibyte_string (contents
, nchars
, nbytes
);
2346 /* Make an unibyte string from LENGTH bytes at CONTENTS. */
2349 make_unibyte_string (contents
, length
)
2350 const char *contents
;
2353 register Lisp_Object val
;
2354 val
= make_uninit_string (length
);
2355 bcopy (contents
, SDATA (val
), length
);
2356 STRING_SET_UNIBYTE (val
);
2361 /* Make a multibyte string from NCHARS characters occupying NBYTES
2362 bytes at CONTENTS. */
2365 make_multibyte_string (contents
, nchars
, nbytes
)
2366 const char *contents
;
2369 register Lisp_Object val
;
2370 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2371 bcopy (contents
, SDATA (val
), nbytes
);
2376 /* Make a string from NCHARS characters occupying NBYTES bytes at
2377 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2380 make_string_from_bytes (contents
, nchars
, nbytes
)
2381 const char *contents
;
2384 register Lisp_Object val
;
2385 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2386 bcopy (contents
, SDATA (val
), nbytes
);
2387 if (SBYTES (val
) == SCHARS (val
))
2388 STRING_SET_UNIBYTE (val
);
2393 /* Make a string from NCHARS characters occupying NBYTES bytes at
2394 CONTENTS. The argument MULTIBYTE controls whether to label the
2395 string as multibyte. If NCHARS is negative, it counts the number of
2396 characters by itself. */
2399 make_specified_string (contents
, nchars
, nbytes
, multibyte
)
2400 const char *contents
;
2404 register Lisp_Object val
;
2409 nchars
= multibyte_chars_in_text (contents
, nbytes
);
2413 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2414 bcopy (contents
, SDATA (val
), nbytes
);
2416 STRING_SET_UNIBYTE (val
);
2421 /* Make a string from the data at STR, treating it as multibyte if the
2428 return make_string (str
, strlen (str
));
2432 /* Return an unibyte Lisp_String set up to hold LENGTH characters
2433 occupying LENGTH bytes. */
2436 make_uninit_string (length
)
2440 val
= make_uninit_multibyte_string (length
, length
);
2441 STRING_SET_UNIBYTE (val
);
2446 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2447 which occupy NBYTES bytes. */
2450 make_uninit_multibyte_string (nchars
, nbytes
)
2454 struct Lisp_String
*s
;
2459 s
= allocate_string ();
2460 allocate_string_data (s
, nchars
, nbytes
);
2461 XSETSTRING (string
, s
);
2462 string_chars_consed
+= nbytes
;
2468 /***********************************************************************
2470 ***********************************************************************/
2472 /* We store float cells inside of float_blocks, allocating a new
2473 float_block with malloc whenever necessary. Float cells reclaimed
2474 by GC are put on a free list to be reallocated before allocating
2475 any new float cells from the latest float_block. */
2477 #define FLOAT_BLOCK_SIZE \
2478 (((BLOCK_BYTES - sizeof (struct float_block *) \
2479 /* The compiler might add padding at the end. */ \
2480 - (sizeof (struct Lisp_Float) - sizeof (int))) * CHAR_BIT) \
2481 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2483 #define GETMARKBIT(block,n) \
2484 (((block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2485 >> ((n) % (sizeof(int) * CHAR_BIT))) \
2488 #define SETMARKBIT(block,n) \
2489 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2490 |= 1 << ((n) % (sizeof(int) * CHAR_BIT))
2492 #define UNSETMARKBIT(block,n) \
2493 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2494 &= ~(1 << ((n) % (sizeof(int) * CHAR_BIT)))
2496 #define FLOAT_BLOCK(fptr) \
2497 ((struct float_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2499 #define FLOAT_INDEX(fptr) \
2500 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2504 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2505 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2506 int gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2507 struct float_block
*next
;
2510 #define FLOAT_MARKED_P(fptr) \
2511 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2513 #define FLOAT_MARK(fptr) \
2514 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2516 #define FLOAT_UNMARK(fptr) \
2517 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2519 /* Current float_block. */
2521 struct float_block
*float_block
;
2523 /* Index of first unused Lisp_Float in the current float_block. */
2525 int float_block_index
;
2527 /* Total number of float blocks now in use. */
2531 /* Free-list of Lisp_Floats. */
2533 struct Lisp_Float
*float_free_list
;
2536 /* Initialize float allocation. */
2542 float_block_index
= FLOAT_BLOCK_SIZE
; /* Force alloc of new float_block. */
2543 float_free_list
= 0;
2548 /* Explicitly free a float cell by putting it on the free-list. */
2552 struct Lisp_Float
*ptr
;
2554 *(struct Lisp_Float
**)&ptr
->data
= float_free_list
;
2555 float_free_list
= ptr
;
2559 /* Return a new float object with value FLOAT_VALUE. */
2562 make_float (float_value
)
2565 register Lisp_Object val
;
2567 if (float_free_list
)
2569 /* We use the data field for chaining the free list
2570 so that we won't use the same field that has the mark bit. */
2571 XSETFLOAT (val
, float_free_list
);
2572 float_free_list
= *(struct Lisp_Float
**)&float_free_list
->data
;
2576 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2578 register struct float_block
*new;
2580 new = (struct float_block
*) lisp_align_malloc (sizeof *new,
2582 new->next
= float_block
;
2583 bzero ((char *) new->gcmarkbits
, sizeof new->gcmarkbits
);
2585 float_block_index
= 0;
2588 XSETFLOAT (val
, &float_block
->floats
[float_block_index
]);
2589 float_block_index
++;
2592 XFLOAT_DATA (val
) = float_value
;
2593 eassert (!FLOAT_MARKED_P (XFLOAT (val
)));
2594 consing_since_gc
+= sizeof (struct Lisp_Float
);
2601 /***********************************************************************
2603 ***********************************************************************/
2605 /* We store cons cells inside of cons_blocks, allocating a new
2606 cons_block with malloc whenever necessary. Cons cells reclaimed by
2607 GC are put on a free list to be reallocated before allocating
2608 any new cons cells from the latest cons_block. */
2610 #define CONS_BLOCK_SIZE \
2611 (((BLOCK_BYTES - sizeof (struct cons_block *)) * CHAR_BIT) \
2612 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2614 #define CONS_BLOCK(fptr) \
2615 ((struct cons_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2617 #define CONS_INDEX(fptr) \
2618 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2622 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2623 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2624 int gcmarkbits
[1 + CONS_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2625 struct cons_block
*next
;
2628 #define CONS_MARKED_P(fptr) \
2629 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2631 #define CONS_MARK(fptr) \
2632 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2634 #define CONS_UNMARK(fptr) \
2635 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2637 /* Current cons_block. */
2639 struct cons_block
*cons_block
;
2641 /* Index of first unused Lisp_Cons in the current block. */
2643 int cons_block_index
;
2645 /* Free-list of Lisp_Cons structures. */
2647 struct Lisp_Cons
*cons_free_list
;
2649 /* Total number of cons blocks now in use. */
2654 /* Initialize cons allocation. */
2660 cons_block_index
= CONS_BLOCK_SIZE
; /* Force alloc of new cons_block. */
2666 /* Explicitly free a cons cell by putting it on the free-list. */
2670 struct Lisp_Cons
*ptr
;
2672 *(struct Lisp_Cons
**)&ptr
->cdr
= cons_free_list
;
2676 cons_free_list
= ptr
;
2679 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
2680 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2682 Lisp_Object car
, cdr
;
2684 register Lisp_Object val
;
2688 /* We use the cdr for chaining the free list
2689 so that we won't use the same field that has the mark bit. */
2690 XSETCONS (val
, cons_free_list
);
2691 cons_free_list
= *(struct Lisp_Cons
**)&cons_free_list
->cdr
;
2695 if (cons_block_index
== CONS_BLOCK_SIZE
)
2697 register struct cons_block
*new;
2698 new = (struct cons_block
*) lisp_align_malloc (sizeof *new,
2700 bzero ((char *) new->gcmarkbits
, sizeof new->gcmarkbits
);
2701 new->next
= cons_block
;
2703 cons_block_index
= 0;
2706 XSETCONS (val
, &cons_block
->conses
[cons_block_index
]);
2712 eassert (!CONS_MARKED_P (XCONS (val
)));
2713 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2714 cons_cells_consed
++;
2718 /* Get an error now if there's any junk in the cons free list. */
2722 #ifdef GC_CHECK_CONS_LIST
2723 struct Lisp_Cons
*tail
= cons_free_list
;
2726 tail
= *(struct Lisp_Cons
**)&tail
->cdr
;
2730 /* Make a list of 2, 3, 4 or 5 specified objects. */
2734 Lisp_Object arg1
, arg2
;
2736 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2741 list3 (arg1
, arg2
, arg3
)
2742 Lisp_Object arg1
, arg2
, arg3
;
2744 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2749 list4 (arg1
, arg2
, arg3
, arg4
)
2750 Lisp_Object arg1
, arg2
, arg3
, arg4
;
2752 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2757 list5 (arg1
, arg2
, arg3
, arg4
, arg5
)
2758 Lisp_Object arg1
, arg2
, arg3
, arg4
, arg5
;
2760 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2761 Fcons (arg5
, Qnil
)))));
2765 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
2766 doc
: /* Return a newly created list with specified arguments as elements.
2767 Any number of arguments, even zero arguments, are allowed.
2768 usage: (list &rest OBJECTS) */)
2771 register Lisp_Object
*args
;
2773 register Lisp_Object val
;
2779 val
= Fcons (args
[nargs
], val
);
2785 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2786 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2788 register Lisp_Object length
, init
;
2790 register Lisp_Object val
;
2793 CHECK_NATNUM (length
);
2794 size
= XFASTINT (length
);
2799 val
= Fcons (init
, val
);
2804 val
= Fcons (init
, val
);
2809 val
= Fcons (init
, val
);
2814 val
= Fcons (init
, val
);
2819 val
= Fcons (init
, val
);
2834 /***********************************************************************
2836 ***********************************************************************/
2838 /* Singly-linked list of all vectors. */
2840 struct Lisp_Vector
*all_vectors
;
2842 /* Total number of vector-like objects now in use. */
2847 /* Value is a pointer to a newly allocated Lisp_Vector structure
2848 with room for LEN Lisp_Objects. */
2850 static struct Lisp_Vector
*
2851 allocate_vectorlike (len
, type
)
2855 struct Lisp_Vector
*p
;
2858 #ifdef DOUG_LEA_MALLOC
2859 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
2860 because mapped region contents are not preserved in
2863 mallopt (M_MMAP_MAX
, 0);
2867 nbytes
= sizeof *p
+ (len
- 1) * sizeof p
->contents
[0];
2868 p
= (struct Lisp_Vector
*) lisp_malloc (nbytes
, type
);
2870 #ifdef DOUG_LEA_MALLOC
2871 /* Back to a reasonable maximum of mmap'ed areas. */
2873 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2877 consing_since_gc
+= nbytes
;
2878 vector_cells_consed
+= len
;
2880 p
->next
= all_vectors
;
2887 /* Allocate a vector with NSLOTS slots. */
2889 struct Lisp_Vector
*
2890 allocate_vector (nslots
)
2893 struct Lisp_Vector
*v
= allocate_vectorlike (nslots
, MEM_TYPE_VECTOR
);
2899 /* Allocate other vector-like structures. */
2901 struct Lisp_Hash_Table
*
2902 allocate_hash_table ()
2904 EMACS_INT len
= VECSIZE (struct Lisp_Hash_Table
);
2905 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_HASH_TABLE
);
2909 for (i
= 0; i
< len
; ++i
)
2910 v
->contents
[i
] = Qnil
;
2912 return (struct Lisp_Hash_Table
*) v
;
2919 EMACS_INT len
= VECSIZE (struct window
);
2920 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_WINDOW
);
2923 for (i
= 0; i
< len
; ++i
)
2924 v
->contents
[i
] = Qnil
;
2927 return (struct window
*) v
;
2934 EMACS_INT len
= VECSIZE (struct frame
);
2935 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_FRAME
);
2938 for (i
= 0; i
< len
; ++i
)
2939 v
->contents
[i
] = make_number (0);
2941 return (struct frame
*) v
;
2945 struct Lisp_Process
*
2948 EMACS_INT len
= VECSIZE (struct Lisp_Process
);
2949 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_PROCESS
);
2952 for (i
= 0; i
< len
; ++i
)
2953 v
->contents
[i
] = Qnil
;
2956 return (struct Lisp_Process
*) v
;
2960 struct Lisp_Vector
*
2961 allocate_other_vector (len
)
2964 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_VECTOR
);
2967 for (i
= 0; i
< len
; ++i
)
2968 v
->contents
[i
] = Qnil
;
2975 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
2976 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
2977 See also the function `vector'. */)
2979 register Lisp_Object length
, init
;
2982 register EMACS_INT sizei
;
2984 register struct Lisp_Vector
*p
;
2986 CHECK_NATNUM (length
);
2987 sizei
= XFASTINT (length
);
2989 p
= allocate_vector (sizei
);
2990 for (index
= 0; index
< sizei
; index
++)
2991 p
->contents
[index
] = init
;
2993 XSETVECTOR (vector
, p
);
2998 DEFUN ("make-char-table", Fmake_char_table
, Smake_char_table
, 1, 2, 0,
2999 doc
: /* Return a newly created char-table, with purpose PURPOSE.
3000 Each element is initialized to INIT, which defaults to nil.
3001 PURPOSE should be a symbol which has a `char-table-extra-slots' property.
3002 The property's value should be an integer between 0 and 10. */)
3004 register Lisp_Object purpose
, init
;
3008 CHECK_SYMBOL (purpose
);
3009 n
= Fget (purpose
, Qchar_table_extra_slots
);
3011 if (XINT (n
) < 0 || XINT (n
) > 10)
3012 args_out_of_range (n
, Qnil
);
3013 /* Add 2 to the size for the defalt and parent slots. */
3014 vector
= Fmake_vector (make_number (CHAR_TABLE_STANDARD_SLOTS
+ XINT (n
)),
3016 XCHAR_TABLE (vector
)->top
= Qt
;
3017 XCHAR_TABLE (vector
)->parent
= Qnil
;
3018 XCHAR_TABLE (vector
)->purpose
= purpose
;
3019 XSETCHAR_TABLE (vector
, XCHAR_TABLE (vector
));
3024 /* Return a newly created sub char table with slots initialized by INIT.
3025 Since a sub char table does not appear as a top level Emacs Lisp
3026 object, we don't need a Lisp interface to make it. */
3029 make_sub_char_table (init
)
3033 = Fmake_vector (make_number (SUB_CHAR_TABLE_STANDARD_SLOTS
), init
);
3034 XCHAR_TABLE (vector
)->top
= Qnil
;
3035 XCHAR_TABLE (vector
)->defalt
= Qnil
;
3036 XSETCHAR_TABLE (vector
, XCHAR_TABLE (vector
));
3041 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
3042 doc
: /* Return a newly created vector with specified arguments as elements.
3043 Any number of arguments, even zero arguments, are allowed.
3044 usage: (vector &rest OBJECTS) */)
3049 register Lisp_Object len
, val
;
3051 register struct Lisp_Vector
*p
;
3053 XSETFASTINT (len
, nargs
);
3054 val
= Fmake_vector (len
, Qnil
);
3056 for (index
= 0; index
< nargs
; index
++)
3057 p
->contents
[index
] = args
[index
];
3062 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
3063 doc
: /* Create a byte-code object with specified arguments as elements.
3064 The arguments should be the arglist, bytecode-string, constant vector,
3065 stack size, (optional) doc string, and (optional) interactive spec.
3066 The first four arguments are required; at most six have any
3068 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
3073 register Lisp_Object len
, val
;
3075 register struct Lisp_Vector
*p
;
3077 XSETFASTINT (len
, nargs
);
3078 if (!NILP (Vpurify_flag
))
3079 val
= make_pure_vector ((EMACS_INT
) nargs
);
3081 val
= Fmake_vector (len
, Qnil
);
3083 if (STRINGP (args
[1]) && STRING_MULTIBYTE (args
[1]))
3084 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
3085 earlier because they produced a raw 8-bit string for byte-code
3086 and now such a byte-code string is loaded as multibyte while
3087 raw 8-bit characters converted to multibyte form. Thus, now we
3088 must convert them back to the original unibyte form. */
3089 args
[1] = Fstring_as_unibyte (args
[1]);
3092 for (index
= 0; index
< nargs
; index
++)
3094 if (!NILP (Vpurify_flag
))
3095 args
[index
] = Fpurecopy (args
[index
]);
3096 p
->contents
[index
] = args
[index
];
3098 XSETCOMPILED (val
, p
);
3104 /***********************************************************************
3106 ***********************************************************************/
3108 /* Each symbol_block is just under 1020 bytes long, since malloc
3109 really allocates in units of powers of two and uses 4 bytes for its
3112 #define SYMBOL_BLOCK_SIZE \
3113 ((1020 - sizeof (struct symbol_block *)) / sizeof (struct Lisp_Symbol))
3117 /* Place `symbols' first, to preserve alignment. */
3118 struct Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
3119 struct symbol_block
*next
;
3122 /* Current symbol block and index of first unused Lisp_Symbol
3125 struct symbol_block
*symbol_block
;
3126 int symbol_block_index
;
3128 /* List of free symbols. */
3130 struct Lisp_Symbol
*symbol_free_list
;
3132 /* Total number of symbol blocks now in use. */
3134 int n_symbol_blocks
;
3137 /* Initialize symbol allocation. */
3142 symbol_block
= NULL
;
3143 symbol_block_index
= SYMBOL_BLOCK_SIZE
;
3144 symbol_free_list
= 0;
3145 n_symbol_blocks
= 0;
3149 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
3150 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
3151 Its value and function definition are void, and its property list is nil. */)
3155 register Lisp_Object val
;
3156 register struct Lisp_Symbol
*p
;
3158 CHECK_STRING (name
);
3160 if (symbol_free_list
)
3162 XSETSYMBOL (val
, symbol_free_list
);
3163 symbol_free_list
= *(struct Lisp_Symbol
**)&symbol_free_list
->value
;
3167 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
3169 struct symbol_block
*new;
3170 new = (struct symbol_block
*) lisp_malloc (sizeof *new,
3172 new->next
= symbol_block
;
3174 symbol_block_index
= 0;
3177 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
]);
3178 symbol_block_index
++;
3184 p
->value
= Qunbound
;
3185 p
->function
= Qunbound
;
3188 p
->interned
= SYMBOL_UNINTERNED
;
3190 p
->indirect_variable
= 0;
3191 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
3198 /***********************************************************************
3199 Marker (Misc) Allocation
3200 ***********************************************************************/
3202 /* Allocation of markers and other objects that share that structure.
3203 Works like allocation of conses. */
3205 #define MARKER_BLOCK_SIZE \
3206 ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc))
3210 /* Place `markers' first, to preserve alignment. */
3211 union Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
3212 struct marker_block
*next
;
3215 struct marker_block
*marker_block
;
3216 int marker_block_index
;
3218 union Lisp_Misc
*marker_free_list
;
3220 /* Total number of marker blocks now in use. */
3222 int n_marker_blocks
;
3227 marker_block
= NULL
;
3228 marker_block_index
= MARKER_BLOCK_SIZE
;
3229 marker_free_list
= 0;
3230 n_marker_blocks
= 0;
3233 /* Return a newly allocated Lisp_Misc object, with no substructure. */
3240 if (marker_free_list
)
3242 XSETMISC (val
, marker_free_list
);
3243 marker_free_list
= marker_free_list
->u_free
.chain
;
3247 if (marker_block_index
== MARKER_BLOCK_SIZE
)
3249 struct marker_block
*new;
3250 new = (struct marker_block
*) lisp_malloc (sizeof *new,
3252 new->next
= marker_block
;
3254 marker_block_index
= 0;
3256 total_free_markers
+= MARKER_BLOCK_SIZE
;
3258 XSETMISC (val
, &marker_block
->markers
[marker_block_index
]);
3259 marker_block_index
++;
3262 --total_free_markers
;
3263 consing_since_gc
+= sizeof (union Lisp_Misc
);
3264 misc_objects_consed
++;
3265 XMARKER (val
)->gcmarkbit
= 0;
3269 /* Free a Lisp_Misc object */
3275 XMISC (misc
)->u_marker
.type
= Lisp_Misc_Free
;
3276 XMISC (misc
)->u_free
.chain
= marker_free_list
;
3277 marker_free_list
= XMISC (misc
);
3279 total_free_markers
++;
3282 /* Return a Lisp_Misc_Save_Value object containing POINTER and
3283 INTEGER. This is used to package C values to call record_unwind_protect.
3284 The unwind function can get the C values back using XSAVE_VALUE. */
3287 make_save_value (pointer
, integer
)
3291 register Lisp_Object val
;
3292 register struct Lisp_Save_Value
*p
;
3294 val
= allocate_misc ();
3295 XMISCTYPE (val
) = Lisp_Misc_Save_Value
;
3296 p
= XSAVE_VALUE (val
);
3297 p
->pointer
= pointer
;
3298 p
->integer
= integer
;
3303 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
3304 doc
: /* Return a newly allocated marker which does not point at any place. */)
3307 register Lisp_Object val
;
3308 register struct Lisp_Marker
*p
;
3310 val
= allocate_misc ();
3311 XMISCTYPE (val
) = Lisp_Misc_Marker
;
3317 p
->insertion_type
= 0;
3321 /* Put MARKER back on the free list after using it temporarily. */
3324 free_marker (marker
)
3327 unchain_marker (XMARKER (marker
));
3332 /* Return a newly created vector or string with specified arguments as
3333 elements. If all the arguments are characters that can fit
3334 in a string of events, make a string; otherwise, make a vector.
3336 Any number of arguments, even zero arguments, are allowed. */
3339 make_event_array (nargs
, args
)
3345 for (i
= 0; i
< nargs
; i
++)
3346 /* The things that fit in a string
3347 are characters that are in 0...127,
3348 after discarding the meta bit and all the bits above it. */
3349 if (!INTEGERP (args
[i
])
3350 || (XUINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
3351 return Fvector (nargs
, args
);
3353 /* Since the loop exited, we know that all the things in it are
3354 characters, so we can make a string. */
3358 result
= Fmake_string (make_number (nargs
), make_number (0));
3359 for (i
= 0; i
< nargs
; i
++)
3361 SSET (result
, i
, XINT (args
[i
]));
3362 /* Move the meta bit to the right place for a string char. */
3363 if (XINT (args
[i
]) & CHAR_META
)
3364 SSET (result
, i
, SREF (result
, i
) | 0x80);
3373 /************************************************************************
3375 ************************************************************************/
3377 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
3379 /* Conservative C stack marking requires a method to identify possibly
3380 live Lisp objects given a pointer value. We do this by keeping
3381 track of blocks of Lisp data that are allocated in a red-black tree
3382 (see also the comment of mem_node which is the type of nodes in
3383 that tree). Function lisp_malloc adds information for an allocated
3384 block to the red-black tree with calls to mem_insert, and function
3385 lisp_free removes it with mem_delete. Functions live_string_p etc
3386 call mem_find to lookup information about a given pointer in the
3387 tree, and use that to determine if the pointer points to a Lisp
3390 /* Initialize this part of alloc.c. */
3395 mem_z
.left
= mem_z
.right
= MEM_NIL
;
3396 mem_z
.parent
= NULL
;
3397 mem_z
.color
= MEM_BLACK
;
3398 mem_z
.start
= mem_z
.end
= NULL
;
3403 /* Value is a pointer to the mem_node containing START. Value is
3404 MEM_NIL if there is no node in the tree containing START. */
3406 static INLINE
struct mem_node
*
3412 if (start
< min_heap_address
|| start
> max_heap_address
)
3415 /* Make the search always successful to speed up the loop below. */
3416 mem_z
.start
= start
;
3417 mem_z
.end
= (char *) start
+ 1;
3420 while (start
< p
->start
|| start
>= p
->end
)
3421 p
= start
< p
->start
? p
->left
: p
->right
;
3426 /* Insert a new node into the tree for a block of memory with start
3427 address START, end address END, and type TYPE. Value is a
3428 pointer to the node that was inserted. */
3430 static struct mem_node
*
3431 mem_insert (start
, end
, type
)
3435 struct mem_node
*c
, *parent
, *x
;
3437 if (start
< min_heap_address
)
3438 min_heap_address
= start
;
3439 if (end
> max_heap_address
)
3440 max_heap_address
= end
;
3442 /* See where in the tree a node for START belongs. In this
3443 particular application, it shouldn't happen that a node is already
3444 present. For debugging purposes, let's check that. */
3448 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3450 while (c
!= MEM_NIL
)
3452 if (start
>= c
->start
&& start
< c
->end
)
3455 c
= start
< c
->start
? c
->left
: c
->right
;
3458 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3460 while (c
!= MEM_NIL
)
3463 c
= start
< c
->start
? c
->left
: c
->right
;
3466 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3468 /* Create a new node. */
3469 #ifdef GC_MALLOC_CHECK
3470 x
= (struct mem_node
*) _malloc_internal (sizeof *x
);
3474 x
= (struct mem_node
*) xmalloc (sizeof *x
);
3480 x
->left
= x
->right
= MEM_NIL
;
3483 /* Insert it as child of PARENT or install it as root. */
3486 if (start
< parent
->start
)
3494 /* Re-establish red-black tree properties. */
3495 mem_insert_fixup (x
);
3501 /* Re-establish the red-black properties of the tree, and thereby
3502 balance the tree, after node X has been inserted; X is always red. */
3505 mem_insert_fixup (x
)
3508 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3510 /* X is red and its parent is red. This is a violation of
3511 red-black tree property #3. */
3513 if (x
->parent
== x
->parent
->parent
->left
)
3515 /* We're on the left side of our grandparent, and Y is our
3517 struct mem_node
*y
= x
->parent
->parent
->right
;
3519 if (y
->color
== MEM_RED
)
3521 /* Uncle and parent are red but should be black because
3522 X is red. Change the colors accordingly and proceed
3523 with the grandparent. */
3524 x
->parent
->color
= MEM_BLACK
;
3525 y
->color
= MEM_BLACK
;
3526 x
->parent
->parent
->color
= MEM_RED
;
3527 x
= x
->parent
->parent
;
3531 /* Parent and uncle have different colors; parent is
3532 red, uncle is black. */
3533 if (x
== x
->parent
->right
)
3536 mem_rotate_left (x
);
3539 x
->parent
->color
= MEM_BLACK
;
3540 x
->parent
->parent
->color
= MEM_RED
;
3541 mem_rotate_right (x
->parent
->parent
);
3546 /* This is the symmetrical case of above. */
3547 struct mem_node
*y
= x
->parent
->parent
->left
;
3549 if (y
->color
== MEM_RED
)
3551 x
->parent
->color
= MEM_BLACK
;
3552 y
->color
= MEM_BLACK
;
3553 x
->parent
->parent
->color
= MEM_RED
;
3554 x
= x
->parent
->parent
;
3558 if (x
== x
->parent
->left
)
3561 mem_rotate_right (x
);
3564 x
->parent
->color
= MEM_BLACK
;
3565 x
->parent
->parent
->color
= MEM_RED
;
3566 mem_rotate_left (x
->parent
->parent
);
3571 /* The root may have been changed to red due to the algorithm. Set
3572 it to black so that property #5 is satisfied. */
3573 mem_root
->color
= MEM_BLACK
;
3589 /* Turn y's left sub-tree into x's right sub-tree. */
3592 if (y
->left
!= MEM_NIL
)
3593 y
->left
->parent
= x
;
3595 /* Y's parent was x's parent. */
3597 y
->parent
= x
->parent
;
3599 /* Get the parent to point to y instead of x. */
3602 if (x
== x
->parent
->left
)
3603 x
->parent
->left
= y
;
3605 x
->parent
->right
= y
;
3610 /* Put x on y's left. */
3624 mem_rotate_right (x
)
3627 struct mem_node
*y
= x
->left
;
3630 if (y
->right
!= MEM_NIL
)
3631 y
->right
->parent
= x
;
3634 y
->parent
= x
->parent
;
3637 if (x
== x
->parent
->right
)
3638 x
->parent
->right
= y
;
3640 x
->parent
->left
= y
;
3651 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
3657 struct mem_node
*x
, *y
;
3659 if (!z
|| z
== MEM_NIL
)
3662 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
3667 while (y
->left
!= MEM_NIL
)
3671 if (y
->left
!= MEM_NIL
)
3676 x
->parent
= y
->parent
;
3679 if (y
== y
->parent
->left
)
3680 y
->parent
->left
= x
;
3682 y
->parent
->right
= x
;
3689 z
->start
= y
->start
;
3694 if (y
->color
== MEM_BLACK
)
3695 mem_delete_fixup (x
);
3697 #ifdef GC_MALLOC_CHECK
3705 /* Re-establish the red-black properties of the tree, after a
3709 mem_delete_fixup (x
)
3712 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
3714 if (x
== x
->parent
->left
)
3716 struct mem_node
*w
= x
->parent
->right
;
3718 if (w
->color
== MEM_RED
)
3720 w
->color
= MEM_BLACK
;
3721 x
->parent
->color
= MEM_RED
;
3722 mem_rotate_left (x
->parent
);
3723 w
= x
->parent
->right
;
3726 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
3733 if (w
->right
->color
== MEM_BLACK
)
3735 w
->left
->color
= MEM_BLACK
;
3737 mem_rotate_right (w
);
3738 w
= x
->parent
->right
;
3740 w
->color
= x
->parent
->color
;
3741 x
->parent
->color
= MEM_BLACK
;
3742 w
->right
->color
= MEM_BLACK
;
3743 mem_rotate_left (x
->parent
);
3749 struct mem_node
*w
= x
->parent
->left
;
3751 if (w
->color
== MEM_RED
)
3753 w
->color
= MEM_BLACK
;
3754 x
->parent
->color
= MEM_RED
;
3755 mem_rotate_right (x
->parent
);
3756 w
= x
->parent
->left
;
3759 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
3766 if (w
->left
->color
== MEM_BLACK
)
3768 w
->right
->color
= MEM_BLACK
;
3770 mem_rotate_left (w
);
3771 w
= x
->parent
->left
;
3774 w
->color
= x
->parent
->color
;
3775 x
->parent
->color
= MEM_BLACK
;
3776 w
->left
->color
= MEM_BLACK
;
3777 mem_rotate_right (x
->parent
);
3783 x
->color
= MEM_BLACK
;
3787 /* Value is non-zero if P is a pointer to a live Lisp string on
3788 the heap. M is a pointer to the mem_block for P. */
3791 live_string_p (m
, p
)
3795 if (m
->type
== MEM_TYPE_STRING
)
3797 struct string_block
*b
= (struct string_block
*) m
->start
;
3798 int offset
= (char *) p
- (char *) &b
->strings
[0];
3800 /* P must point to the start of a Lisp_String structure, and it
3801 must not be on the free-list. */
3803 && offset
% sizeof b
->strings
[0] == 0
3804 && offset
< (STRING_BLOCK_SIZE
* sizeof b
->strings
[0])
3805 && ((struct Lisp_String
*) p
)->data
!= NULL
);
3812 /* Value is non-zero if P is a pointer to a live Lisp cons on
3813 the heap. M is a pointer to the mem_block for P. */
3820 if (m
->type
== MEM_TYPE_CONS
)
3822 struct cons_block
*b
= (struct cons_block
*) m
->start
;
3823 int offset
= (char *) p
- (char *) &b
->conses
[0];
3825 /* P must point to the start of a Lisp_Cons, not be
3826 one of the unused cells in the current cons block,
3827 and not be on the free-list. */
3829 && offset
% sizeof b
->conses
[0] == 0
3830 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
3832 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
3833 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
3840 /* Value is non-zero if P is a pointer to a live Lisp symbol on
3841 the heap. M is a pointer to the mem_block for P. */
3844 live_symbol_p (m
, p
)
3848 if (m
->type
== MEM_TYPE_SYMBOL
)
3850 struct symbol_block
*b
= (struct symbol_block
*) m
->start
;
3851 int offset
= (char *) p
- (char *) &b
->symbols
[0];
3853 /* P must point to the start of a Lisp_Symbol, not be
3854 one of the unused cells in the current symbol block,
3855 and not be on the free-list. */
3857 && offset
% sizeof b
->symbols
[0] == 0
3858 && offset
< (SYMBOL_BLOCK_SIZE
* sizeof b
->symbols
[0])
3859 && (b
!= symbol_block
3860 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
3861 && !EQ (((struct Lisp_Symbol
*) p
)->function
, Vdead
));
3868 /* Value is non-zero if P is a pointer to a live Lisp float on
3869 the heap. M is a pointer to the mem_block for P. */
3876 if (m
->type
== MEM_TYPE_FLOAT
)
3878 struct float_block
*b
= (struct float_block
*) m
->start
;
3879 int offset
= (char *) p
- (char *) &b
->floats
[0];
3881 /* P must point to the start of a Lisp_Float and not be
3882 one of the unused cells in the current float block. */
3884 && offset
% sizeof b
->floats
[0] == 0
3885 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
3886 && (b
!= float_block
3887 || offset
/ sizeof b
->floats
[0] < float_block_index
));
3894 /* Value is non-zero if P is a pointer to a live Lisp Misc on
3895 the heap. M is a pointer to the mem_block for P. */
3902 if (m
->type
== MEM_TYPE_MISC
)
3904 struct marker_block
*b
= (struct marker_block
*) m
->start
;
3905 int offset
= (char *) p
- (char *) &b
->markers
[0];
3907 /* P must point to the start of a Lisp_Misc, not be
3908 one of the unused cells in the current misc block,
3909 and not be on the free-list. */
3911 && offset
% sizeof b
->markers
[0] == 0
3912 && offset
< (MARKER_BLOCK_SIZE
* sizeof b
->markers
[0])
3913 && (b
!= marker_block
3914 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
3915 && ((union Lisp_Misc
*) p
)->u_marker
.type
!= Lisp_Misc_Free
);
3922 /* Value is non-zero if P is a pointer to a live vector-like object.
3923 M is a pointer to the mem_block for P. */
3926 live_vector_p (m
, p
)
3930 return (p
== m
->start
3931 && m
->type
>= MEM_TYPE_VECTOR
3932 && m
->type
<= MEM_TYPE_WINDOW
);
3936 /* Value is non-zero if P is a pointer to a live buffer. M is a
3937 pointer to the mem_block for P. */
3940 live_buffer_p (m
, p
)
3944 /* P must point to the start of the block, and the buffer
3945 must not have been killed. */
3946 return (m
->type
== MEM_TYPE_BUFFER
3948 && !NILP (((struct buffer
*) p
)->name
));
3951 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
3955 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3957 /* Array of objects that are kept alive because the C stack contains
3958 a pattern that looks like a reference to them . */
3960 #define MAX_ZOMBIES 10
3961 static Lisp_Object zombies
[MAX_ZOMBIES
];
3963 /* Number of zombie objects. */
3965 static int nzombies
;
3967 /* Number of garbage collections. */
3971 /* Average percentage of zombies per collection. */
3973 static double avg_zombies
;
3975 /* Max. number of live and zombie objects. */
3977 static int max_live
, max_zombies
;
3979 /* Average number of live objects per GC. */
3981 static double avg_live
;
3983 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
3984 doc
: /* Show information about live and zombie objects. */)
3987 Lisp_Object args
[8], zombie_list
= Qnil
;
3989 for (i
= 0; i
< nzombies
; i
++)
3990 zombie_list
= Fcons (zombies
[i
], zombie_list
);
3991 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
3992 args
[1] = make_number (ngcs
);
3993 args
[2] = make_float (avg_live
);
3994 args
[3] = make_float (avg_zombies
);
3995 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
3996 args
[5] = make_number (max_live
);
3997 args
[6] = make_number (max_zombies
);
3998 args
[7] = zombie_list
;
3999 return Fmessage (8, args
);
4002 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4005 /* Mark OBJ if we can prove it's a Lisp_Object. */
4008 mark_maybe_object (obj
)
4011 void *po
= (void *) XPNTR (obj
);
4012 struct mem_node
*m
= mem_find (po
);
4018 switch (XGCTYPE (obj
))
4021 mark_p
= (live_string_p (m
, po
)
4022 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
4026 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
4030 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
4034 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
4037 case Lisp_Vectorlike
:
4038 /* Note: can't check GC_BUFFERP before we know it's a
4039 buffer because checking that dereferences the pointer
4040 PO which might point anywhere. */
4041 if (live_vector_p (m
, po
))
4042 mark_p
= !GC_SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
4043 else if (live_buffer_p (m
, po
))
4044 mark_p
= GC_BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
4048 mark_p
= (live_misc_p (m
, po
) && !XMARKER (obj
)->gcmarkbit
);
4052 case Lisp_Type_Limit
:
4058 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4059 if (nzombies
< MAX_ZOMBIES
)
4060 zombies
[nzombies
] = obj
;
4069 /* If P points to Lisp data, mark that as live if it isn't already
4073 mark_maybe_pointer (p
)
4078 /* Quickly rule out some values which can't point to Lisp data. We
4079 assume that Lisp data is aligned on even addresses. */
4080 if ((EMACS_INT
) p
& 1)
4086 Lisp_Object obj
= Qnil
;
4090 case MEM_TYPE_NON_LISP
:
4091 /* Nothing to do; not a pointer to Lisp memory. */
4094 case MEM_TYPE_BUFFER
:
4095 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P((struct buffer
*)p
))
4096 XSETVECTOR (obj
, p
);
4100 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
4104 case MEM_TYPE_STRING
:
4105 if (live_string_p (m
, p
)
4106 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
4107 XSETSTRING (obj
, p
);
4111 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
4115 case MEM_TYPE_SYMBOL
:
4116 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
4117 XSETSYMBOL (obj
, p
);
4120 case MEM_TYPE_FLOAT
:
4121 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
4125 case MEM_TYPE_VECTOR
:
4126 case MEM_TYPE_PROCESS
:
4127 case MEM_TYPE_HASH_TABLE
:
4128 case MEM_TYPE_FRAME
:
4129 case MEM_TYPE_WINDOW
:
4130 if (live_vector_p (m
, p
))
4133 XSETVECTOR (tem
, p
);
4134 if (!GC_SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
4149 /* Mark Lisp objects referenced from the address range START..END. */
4152 mark_memory (start
, end
)
4158 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4162 /* Make START the pointer to the start of the memory region,
4163 if it isn't already. */
4171 /* Mark Lisp_Objects. */
4172 for (p
= (Lisp_Object
*) start
; (void *) p
< end
; ++p
)
4173 mark_maybe_object (*p
);
4175 /* Mark Lisp data pointed to. This is necessary because, in some
4176 situations, the C compiler optimizes Lisp objects away, so that
4177 only a pointer to them remains. Example:
4179 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
4182 Lisp_Object obj = build_string ("test");
4183 struct Lisp_String *s = XSTRING (obj);
4184 Fgarbage_collect ();
4185 fprintf (stderr, "test `%s'\n", s->data);
4189 Here, `obj' isn't really used, and the compiler optimizes it
4190 away. The only reference to the life string is through the
4193 for (pp
= (void **) start
; (void *) pp
< end
; ++pp
)
4194 mark_maybe_pointer (*pp
);
4197 /* setjmp will work with GCC unless NON_SAVING_SETJMP is defined in
4198 the GCC system configuration. In gcc 3.2, the only systems for
4199 which this is so are i386-sco5 non-ELF, i386-sysv3 (maybe included
4200 by others?) and ns32k-pc532-min. */
4202 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
4204 static int setjmp_tested_p
, longjmps_done
;
4206 #define SETJMP_WILL_LIKELY_WORK "\
4208 Emacs garbage collector has been changed to use conservative stack\n\
4209 marking. Emacs has determined that the method it uses to do the\n\
4210 marking will likely work on your system, but this isn't sure.\n\
4212 If you are a system-programmer, or can get the help of a local wizard\n\
4213 who is, please take a look at the function mark_stack in alloc.c, and\n\
4214 verify that the methods used are appropriate for your system.\n\
4216 Please mail the result to <emacs-devel@gnu.org>.\n\
4219 #define SETJMP_WILL_NOT_WORK "\
4221 Emacs garbage collector has been changed to use conservative stack\n\
4222 marking. Emacs has determined that the default method it uses to do the\n\
4223 marking will not work on your system. We will need a system-dependent\n\
4224 solution for your system.\n\
4226 Please take a look at the function mark_stack in alloc.c, and\n\
4227 try to find a way to make it work on your system.\n\
4229 Note that you may get false negatives, depending on the compiler.\n\
4230 In particular, you need to use -O with GCC for this test.\n\
4232 Please mail the result to <emacs-devel@gnu.org>.\n\
4236 /* Perform a quick check if it looks like setjmp saves registers in a
4237 jmp_buf. Print a message to stderr saying so. When this test
4238 succeeds, this is _not_ a proof that setjmp is sufficient for
4239 conservative stack marking. Only the sources or a disassembly
4250 /* Arrange for X to be put in a register. */
4256 if (longjmps_done
== 1)
4258 /* Came here after the longjmp at the end of the function.
4260 If x == 1, the longjmp has restored the register to its
4261 value before the setjmp, and we can hope that setjmp
4262 saves all such registers in the jmp_buf, although that
4265 For other values of X, either something really strange is
4266 taking place, or the setjmp just didn't save the register. */
4269 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
4272 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
4279 if (longjmps_done
== 1)
4283 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
4286 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4288 /* Abort if anything GCPRO'd doesn't survive the GC. */
4296 for (p
= gcprolist
; p
; p
= p
->next
)
4297 for (i
= 0; i
< p
->nvars
; ++i
)
4298 if (!survives_gc_p (p
->var
[i
]))
4299 /* FIXME: It's not necessarily a bug. It might just be that the
4300 GCPRO is unnecessary or should release the object sooner. */
4304 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4311 fprintf (stderr
, "\nZombies kept alive = %d:\n", nzombies
);
4312 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
4314 fprintf (stderr
, " %d = ", i
);
4315 debug_print (zombies
[i
]);
4319 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4322 /* Mark live Lisp objects on the C stack.
4324 There are several system-dependent problems to consider when
4325 porting this to new architectures:
4329 We have to mark Lisp objects in CPU registers that can hold local
4330 variables or are used to pass parameters.
4332 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
4333 something that either saves relevant registers on the stack, or
4334 calls mark_maybe_object passing it each register's contents.
4336 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
4337 implementation assumes that calling setjmp saves registers we need
4338 to see in a jmp_buf which itself lies on the stack. This doesn't
4339 have to be true! It must be verified for each system, possibly
4340 by taking a look at the source code of setjmp.
4344 Architectures differ in the way their processor stack is organized.
4345 For example, the stack might look like this
4348 | Lisp_Object | size = 4
4350 | something else | size = 2
4352 | Lisp_Object | size = 4
4356 In such a case, not every Lisp_Object will be aligned equally. To
4357 find all Lisp_Object on the stack it won't be sufficient to walk
4358 the stack in steps of 4 bytes. Instead, two passes will be
4359 necessary, one starting at the start of the stack, and a second
4360 pass starting at the start of the stack + 2. Likewise, if the
4361 minimal alignment of Lisp_Objects on the stack is 1, four passes
4362 would be necessary, each one starting with one byte more offset
4363 from the stack start.
4365 The current code assumes by default that Lisp_Objects are aligned
4366 equally on the stack. */
4373 volatile int stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
4376 /* This trick flushes the register windows so that all the state of
4377 the process is contained in the stack. */
4378 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
4379 needed on ia64 too. See mach_dep.c, where it also says inline
4380 assembler doesn't work with relevant proprietary compilers. */
4385 /* Save registers that we need to see on the stack. We need to see
4386 registers used to hold register variables and registers used to
4388 #ifdef GC_SAVE_REGISTERS_ON_STACK
4389 GC_SAVE_REGISTERS_ON_STACK (end
);
4390 #else /* not GC_SAVE_REGISTERS_ON_STACK */
4392 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
4393 setjmp will definitely work, test it
4394 and print a message with the result
4396 if (!setjmp_tested_p
)
4398 setjmp_tested_p
= 1;
4401 #endif /* GC_SETJMP_WORKS */
4404 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
4405 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
4407 /* This assumes that the stack is a contiguous region in memory. If
4408 that's not the case, something has to be done here to iterate
4409 over the stack segments. */
4410 #ifndef GC_LISP_OBJECT_ALIGNMENT
4412 #define GC_LISP_OBJECT_ALIGNMENT __alignof__ (Lisp_Object)
4414 #define GC_LISP_OBJECT_ALIGNMENT sizeof (Lisp_Object)
4417 for (i
= 0; i
< sizeof (Lisp_Object
); i
+= GC_LISP_OBJECT_ALIGNMENT
)
4418 mark_memory ((char *) stack_base
+ i
, end
);
4419 /* Allow for marking a secondary stack, like the register stack on the
4421 #ifdef GC_MARK_SECONDARY_STACK
4422 GC_MARK_SECONDARY_STACK ();
4425 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4431 #endif /* GC_MARK_STACK != 0 */
4435 /***********************************************************************
4436 Pure Storage Management
4437 ***********************************************************************/
4439 /* Allocate room for SIZE bytes from pure Lisp storage and return a
4440 pointer to it. TYPE is the Lisp type for which the memory is
4441 allocated. TYPE < 0 means it's not used for a Lisp object.
4443 If store_pure_type_info is set and TYPE is >= 0, the type of
4444 the allocated object is recorded in pure_types. */
4446 static POINTER_TYPE
*
4447 pure_alloc (size
, type
)
4451 POINTER_TYPE
*result
;
4453 size_t alignment
= (1 << GCTYPEBITS
);
4455 size_t alignment
= sizeof (EMACS_INT
);
4457 /* Give Lisp_Floats an extra alignment. */
4458 if (type
== Lisp_Float
)
4460 #if defined __GNUC__ && __GNUC__ >= 2
4461 alignment
= __alignof (struct Lisp_Float
);
4463 alignment
= sizeof (struct Lisp_Float
);
4469 result
= ALIGN (purebeg
+ pure_bytes_used
, alignment
);
4470 pure_bytes_used
= ((char *)result
- (char *)purebeg
) + size
;
4472 if (pure_bytes_used
<= pure_size
)
4475 /* Don't allocate a large amount here,
4476 because it might get mmap'd and then its address
4477 might not be usable. */
4478 purebeg
= (char *) xmalloc (10000);
4480 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
4481 pure_bytes_used
= 0;
4486 /* Print a warning if PURESIZE is too small. */
4491 if (pure_bytes_used_before_overflow
)
4492 message ("Pure Lisp storage overflow (approx. %d bytes needed)",
4493 (int) (pure_bytes_used
+ pure_bytes_used_before_overflow
));
4497 /* Return a string allocated in pure space. DATA is a buffer holding
4498 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
4499 non-zero means make the result string multibyte.
4501 Must get an error if pure storage is full, since if it cannot hold
4502 a large string it may be able to hold conses that point to that
4503 string; then the string is not protected from gc. */
4506 make_pure_string (data
, nchars
, nbytes
, multibyte
)
4512 struct Lisp_String
*s
;
4514 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4515 s
->data
= (unsigned char *) pure_alloc (nbytes
+ 1, -1);
4517 s
->size_byte
= multibyte
? nbytes
: -1;
4518 bcopy (data
, s
->data
, nbytes
);
4519 s
->data
[nbytes
] = '\0';
4520 s
->intervals
= NULL_INTERVAL
;
4521 XSETSTRING (string
, s
);
4526 /* Return a cons allocated from pure space. Give it pure copies
4527 of CAR as car and CDR as cdr. */
4530 pure_cons (car
, cdr
)
4531 Lisp_Object car
, cdr
;
4533 register Lisp_Object
new;
4534 struct Lisp_Cons
*p
;
4536 p
= (struct Lisp_Cons
*) pure_alloc (sizeof *p
, Lisp_Cons
);
4538 XSETCAR (new, Fpurecopy (car
));
4539 XSETCDR (new, Fpurecopy (cdr
));
4544 /* Value is a float object with value NUM allocated from pure space. */
4547 make_pure_float (num
)
4550 register Lisp_Object
new;
4551 struct Lisp_Float
*p
;
4553 p
= (struct Lisp_Float
*) pure_alloc (sizeof *p
, Lisp_Float
);
4555 XFLOAT_DATA (new) = num
;
4560 /* Return a vector with room for LEN Lisp_Objects allocated from
4564 make_pure_vector (len
)
4568 struct Lisp_Vector
*p
;
4569 size_t size
= sizeof *p
+ (len
- 1) * sizeof (Lisp_Object
);
4571 p
= (struct Lisp_Vector
*) pure_alloc (size
, Lisp_Vectorlike
);
4572 XSETVECTOR (new, p
);
4573 XVECTOR (new)->size
= len
;
4578 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
4579 doc
: /* Make a copy of OBJECT in pure storage.
4580 Recursively copies contents of vectors and cons cells.
4581 Does not copy symbols. Copies strings without text properties. */)
4583 register Lisp_Object obj
;
4585 if (NILP (Vpurify_flag
))
4588 if (PURE_POINTER_P (XPNTR (obj
)))
4592 return pure_cons (XCAR (obj
), XCDR (obj
));
4593 else if (FLOATP (obj
))
4594 return make_pure_float (XFLOAT_DATA (obj
));
4595 else if (STRINGP (obj
))
4596 return make_pure_string (SDATA (obj
), SCHARS (obj
),
4598 STRING_MULTIBYTE (obj
));
4599 else if (COMPILEDP (obj
) || VECTORP (obj
))
4601 register struct Lisp_Vector
*vec
;
4605 size
= XVECTOR (obj
)->size
;
4606 if (size
& PSEUDOVECTOR_FLAG
)
4607 size
&= PSEUDOVECTOR_SIZE_MASK
;
4608 vec
= XVECTOR (make_pure_vector (size
));
4609 for (i
= 0; i
< size
; i
++)
4610 vec
->contents
[i
] = Fpurecopy (XVECTOR (obj
)->contents
[i
]);
4611 if (COMPILEDP (obj
))
4612 XSETCOMPILED (obj
, vec
);
4614 XSETVECTOR (obj
, vec
);
4617 else if (MARKERP (obj
))
4618 error ("Attempt to copy a marker to pure storage");
4625 /***********************************************************************
4627 ***********************************************************************/
4629 /* Put an entry in staticvec, pointing at the variable with address
4633 staticpro (varaddress
)
4634 Lisp_Object
*varaddress
;
4636 staticvec
[staticidx
++] = varaddress
;
4637 if (staticidx
>= NSTATICS
)
4645 struct catchtag
*next
;
4649 /***********************************************************************
4651 ***********************************************************************/
4653 /* Temporarily prevent garbage collection. */
4656 inhibit_garbage_collection ()
4658 int count
= SPECPDL_INDEX ();
4659 int nbits
= min (VALBITS
, BITS_PER_INT
);
4661 specbind (Qgc_cons_threshold
, make_number (((EMACS_INT
) 1 << (nbits
- 1)) - 1));
4666 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
4667 doc
: /* Reclaim storage for Lisp objects no longer needed.
4668 Garbage collection happens automatically if you cons more than
4669 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
4670 `garbage-collect' normally returns a list with info on amount of space in use:
4671 ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)
4672 (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS
4673 (USED-FLOATS . FREE-FLOATS) (USED-INTERVALS . FREE-INTERVALS)
4674 (USED-STRINGS . FREE-STRINGS))
4675 However, if there was overflow in pure space, `garbage-collect'
4676 returns nil, because real GC can't be done. */)
4679 register struct specbinding
*bind
;
4680 struct catchtag
*catch;
4681 struct handler
*handler
;
4682 char stack_top_variable
;
4685 Lisp_Object total
[8];
4686 int count
= SPECPDL_INDEX ();
4687 EMACS_TIME t1
, t2
, t3
;
4692 /* Can't GC if pure storage overflowed because we can't determine
4693 if something is a pure object or not. */
4694 if (pure_bytes_used_before_overflow
)
4699 /* Don't keep undo information around forever.
4700 Do this early on, so it is no problem if the user quits. */
4702 register struct buffer
*nextb
= all_buffers
;
4706 /* If a buffer's undo list is Qt, that means that undo is
4707 turned off in that buffer. Calling truncate_undo_list on
4708 Qt tends to return NULL, which effectively turns undo back on.
4709 So don't call truncate_undo_list if undo_list is Qt. */
4710 if (! NILP (nextb
->name
) && ! EQ (nextb
->undo_list
, Qt
))
4711 truncate_undo_list (nextb
);
4713 /* Shrink buffer gaps, but skip indirect and dead buffers. */
4714 if (nextb
->base_buffer
== 0 && !NILP (nextb
->name
))
4716 /* If a buffer's gap size is more than 10% of the buffer
4717 size, or larger than 2000 bytes, then shrink it
4718 accordingly. Keep a minimum size of 20 bytes. */
4719 int size
= min (2000, max (20, (nextb
->text
->z_byte
/ 10)));
4721 if (nextb
->text
->gap_size
> size
)
4723 struct buffer
*save_current
= current_buffer
;
4724 current_buffer
= nextb
;
4725 make_gap (-(nextb
->text
->gap_size
- size
));
4726 current_buffer
= save_current
;
4730 nextb
= nextb
->next
;
4734 EMACS_GET_TIME (t1
);
4736 /* In case user calls debug_print during GC,
4737 don't let that cause a recursive GC. */
4738 consing_since_gc
= 0;
4740 /* Save what's currently displayed in the echo area. */
4741 message_p
= push_message ();
4742 record_unwind_protect (pop_message_unwind
, Qnil
);
4744 /* Save a copy of the contents of the stack, for debugging. */
4745 #if MAX_SAVE_STACK > 0
4746 if (NILP (Vpurify_flag
))
4748 i
= &stack_top_variable
- stack_bottom
;
4750 if (i
< MAX_SAVE_STACK
)
4752 if (stack_copy
== 0)
4753 stack_copy
= (char *) xmalloc (stack_copy_size
= i
);
4754 else if (stack_copy_size
< i
)
4755 stack_copy
= (char *) xrealloc (stack_copy
, (stack_copy_size
= i
));
4758 if ((EMACS_INT
) (&stack_top_variable
- stack_bottom
) > 0)
4759 bcopy (stack_bottom
, stack_copy
, i
);
4761 bcopy (&stack_top_variable
, stack_copy
, i
);
4765 #endif /* MAX_SAVE_STACK > 0 */
4767 if (garbage_collection_messages
)
4768 message1_nolog ("Garbage collecting...");
4772 shrink_regexp_cache ();
4776 /* clear_marks (); */
4778 /* Mark all the special slots that serve as the roots of accessibility. */
4780 for (i
= 0; i
< staticidx
; i
++)
4781 mark_object (*staticvec
[i
]);
4783 for (bind
= specpdl
; bind
!= specpdl_ptr
; bind
++)
4785 mark_object (bind
->symbol
);
4786 mark_object (bind
->old_value
);
4793 extern void xg_mark_data ();
4798 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
4799 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
4803 register struct gcpro
*tail
;
4804 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
4805 for (i
= 0; i
< tail
->nvars
; i
++)
4806 mark_object (tail
->var
[i
]);
4811 for (catch = catchlist
; catch; catch = catch->next
)
4813 mark_object (catch->tag
);
4814 mark_object (catch->val
);
4816 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
4818 mark_object (handler
->handler
);
4819 mark_object (handler
->var
);
4823 #ifdef HAVE_WINDOW_SYSTEM
4824 mark_fringe_data ();
4827 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4831 /* Everything is now marked, except for the things that require special
4832 finalization, i.e. the undo_list.
4833 Look thru every buffer's undo list
4834 for elements that update markers that were not marked,
4837 register struct buffer
*nextb
= all_buffers
;
4841 /* If a buffer's undo list is Qt, that means that undo is
4842 turned off in that buffer. Calling truncate_undo_list on
4843 Qt tends to return NULL, which effectively turns undo back on.
4844 So don't call truncate_undo_list if undo_list is Qt. */
4845 if (! EQ (nextb
->undo_list
, Qt
))
4847 Lisp_Object tail
, prev
;
4848 tail
= nextb
->undo_list
;
4850 while (CONSP (tail
))
4852 if (GC_CONSP (XCAR (tail
))
4853 && GC_MARKERP (XCAR (XCAR (tail
)))
4854 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
4857 nextb
->undo_list
= tail
= XCDR (tail
);
4861 XSETCDR (prev
, tail
);
4871 /* Now that we have stripped the elements that need not be in the
4872 undo_list any more, we can finally mark the list. */
4873 mark_object (nextb
->undo_list
);
4875 nextb
= nextb
->next
;
4881 /* Clear the mark bits that we set in certain root slots. */
4883 unmark_byte_stack ();
4884 VECTOR_UNMARK (&buffer_defaults
);
4885 VECTOR_UNMARK (&buffer_local_symbols
);
4887 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
4895 /* clear_marks (); */
4898 consing_since_gc
= 0;
4899 if (gc_cons_threshold
< 10000)
4900 gc_cons_threshold
= 10000;
4902 if (garbage_collection_messages
)
4904 if (message_p
|| minibuf_level
> 0)
4907 message1_nolog ("Garbage collecting...done");
4910 unbind_to (count
, Qnil
);
4912 total
[0] = Fcons (make_number (total_conses
),
4913 make_number (total_free_conses
));
4914 total
[1] = Fcons (make_number (total_symbols
),
4915 make_number (total_free_symbols
));
4916 total
[2] = Fcons (make_number (total_markers
),
4917 make_number (total_free_markers
));
4918 total
[3] = make_number (total_string_size
);
4919 total
[4] = make_number (total_vector_size
);
4920 total
[5] = Fcons (make_number (total_floats
),
4921 make_number (total_free_floats
));
4922 total
[6] = Fcons (make_number (total_intervals
),
4923 make_number (total_free_intervals
));
4924 total
[7] = Fcons (make_number (total_strings
),
4925 make_number (total_free_strings
));
4927 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4929 /* Compute average percentage of zombies. */
4932 for (i
= 0; i
< 7; ++i
)
4933 if (CONSP (total
[i
]))
4934 nlive
+= XFASTINT (XCAR (total
[i
]));
4936 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
4937 max_live
= max (nlive
, max_live
);
4938 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
4939 max_zombies
= max (nzombies
, max_zombies
);
4944 if (!NILP (Vpost_gc_hook
))
4946 int count
= inhibit_garbage_collection ();
4947 safe_run_hooks (Qpost_gc_hook
);
4948 unbind_to (count
, Qnil
);
4951 /* Accumulate statistics. */
4952 EMACS_GET_TIME (t2
);
4953 EMACS_SUB_TIME (t3
, t2
, t1
);
4954 if (FLOATP (Vgc_elapsed
))
4955 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
) +
4957 EMACS_USECS (t3
) * 1.0e-6);
4960 return Flist (sizeof total
/ sizeof *total
, total
);
4964 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
4965 only interesting objects referenced from glyphs are strings. */
4968 mark_glyph_matrix (matrix
)
4969 struct glyph_matrix
*matrix
;
4971 struct glyph_row
*row
= matrix
->rows
;
4972 struct glyph_row
*end
= row
+ matrix
->nrows
;
4974 for (; row
< end
; ++row
)
4978 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
4980 struct glyph
*glyph
= row
->glyphs
[area
];
4981 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
4983 for (; glyph
< end_glyph
; ++glyph
)
4984 if (GC_STRINGP (glyph
->object
)
4985 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
4986 mark_object (glyph
->object
);
4992 /* Mark Lisp faces in the face cache C. */
4996 struct face_cache
*c
;
5001 for (i
= 0; i
< c
->used
; ++i
)
5003 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
5007 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
5008 mark_object (face
->lface
[j
]);
5015 #ifdef HAVE_WINDOW_SYSTEM
5017 /* Mark Lisp objects in image IMG. */
5023 mark_object (img
->spec
);
5025 if (!NILP (img
->data
.lisp_val
))
5026 mark_object (img
->data
.lisp_val
);
5030 /* Mark Lisp objects in image cache of frame F. It's done this way so
5031 that we don't have to include xterm.h here. */
5034 mark_image_cache (f
)
5037 forall_images_in_image_cache (f
, mark_image
);
5040 #endif /* HAVE_X_WINDOWS */
5044 /* Mark reference to a Lisp_Object.
5045 If the object referred to has not been seen yet, recursively mark
5046 all the references contained in it. */
5048 #define LAST_MARKED_SIZE 500
5049 Lisp_Object last_marked
[LAST_MARKED_SIZE
];
5050 int last_marked_index
;
5052 /* For debugging--call abort when we cdr down this many
5053 links of a list, in mark_object. In debugging,
5054 the call to abort will hit a breakpoint.
5055 Normally this is zero and the check never goes off. */
5056 int mark_object_loop_halt
;
5062 register Lisp_Object obj
= arg
;
5063 #ifdef GC_CHECK_MARKED_OBJECTS
5071 if (PURE_POINTER_P (XPNTR (obj
)))
5074 last_marked
[last_marked_index
++] = obj
;
5075 if (last_marked_index
== LAST_MARKED_SIZE
)
5076 last_marked_index
= 0;
5078 /* Perform some sanity checks on the objects marked here. Abort if
5079 we encounter an object we know is bogus. This increases GC time
5080 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
5081 #ifdef GC_CHECK_MARKED_OBJECTS
5083 po
= (void *) XPNTR (obj
);
5085 /* Check that the object pointed to by PO is known to be a Lisp
5086 structure allocated from the heap. */
5087 #define CHECK_ALLOCATED() \
5089 m = mem_find (po); \
5094 /* Check that the object pointed to by PO is live, using predicate
5096 #define CHECK_LIVE(LIVEP) \
5098 if (!LIVEP (m, po)) \
5102 /* Check both of the above conditions. */
5103 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
5105 CHECK_ALLOCATED (); \
5106 CHECK_LIVE (LIVEP); \
5109 #else /* not GC_CHECK_MARKED_OBJECTS */
5111 #define CHECK_ALLOCATED() (void) 0
5112 #define CHECK_LIVE(LIVEP) (void) 0
5113 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
5115 #endif /* not GC_CHECK_MARKED_OBJECTS */
5117 switch (SWITCH_ENUM_CAST (XGCTYPE (obj
)))
5121 register struct Lisp_String
*ptr
= XSTRING (obj
);
5122 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
5123 MARK_INTERVAL_TREE (ptr
->intervals
);
5125 #ifdef GC_CHECK_STRING_BYTES
5126 /* Check that the string size recorded in the string is the
5127 same as the one recorded in the sdata structure. */
5128 CHECK_STRING_BYTES (ptr
);
5129 #endif /* GC_CHECK_STRING_BYTES */
5133 case Lisp_Vectorlike
:
5134 #ifdef GC_CHECK_MARKED_OBJECTS
5136 if (m
== MEM_NIL
&& !GC_SUBRP (obj
)
5137 && po
!= &buffer_defaults
5138 && po
!= &buffer_local_symbols
)
5140 #endif /* GC_CHECK_MARKED_OBJECTS */
5142 if (GC_BUFFERP (obj
))
5144 if (!VECTOR_MARKED_P (XBUFFER (obj
)))
5146 #ifdef GC_CHECK_MARKED_OBJECTS
5147 if (po
!= &buffer_defaults
&& po
!= &buffer_local_symbols
)
5150 for (b
= all_buffers
; b
&& b
!= po
; b
= b
->next
)
5155 #endif /* GC_CHECK_MARKED_OBJECTS */
5159 else if (GC_SUBRP (obj
))
5161 else if (GC_COMPILEDP (obj
))
5162 /* We could treat this just like a vector, but it is better to
5163 save the COMPILED_CONSTANTS element for last and avoid
5166 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5167 register EMACS_INT size
= ptr
->size
;
5170 if (VECTOR_MARKED_P (ptr
))
5171 break; /* Already marked */
5173 CHECK_LIVE (live_vector_p
);
5174 VECTOR_MARK (ptr
); /* Else mark it */
5175 size
&= PSEUDOVECTOR_SIZE_MASK
;
5176 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5178 if (i
!= COMPILED_CONSTANTS
)
5179 mark_object (ptr
->contents
[i
]);
5181 obj
= ptr
->contents
[COMPILED_CONSTANTS
];
5184 else if (GC_FRAMEP (obj
))
5186 register struct frame
*ptr
= XFRAME (obj
);
5188 if (VECTOR_MARKED_P (ptr
)) break; /* Already marked */
5189 VECTOR_MARK (ptr
); /* Else mark it */
5191 CHECK_LIVE (live_vector_p
);
5192 mark_object (ptr
->name
);
5193 mark_object (ptr
->icon_name
);
5194 mark_object (ptr
->title
);
5195 mark_object (ptr
->focus_frame
);
5196 mark_object (ptr
->selected_window
);
5197 mark_object (ptr
->minibuffer_window
);
5198 mark_object (ptr
->param_alist
);
5199 mark_object (ptr
->scroll_bars
);
5200 mark_object (ptr
->condemned_scroll_bars
);
5201 mark_object (ptr
->menu_bar_items
);
5202 mark_object (ptr
->face_alist
);
5203 mark_object (ptr
->menu_bar_vector
);
5204 mark_object (ptr
->buffer_predicate
);
5205 mark_object (ptr
->buffer_list
);
5206 mark_object (ptr
->menu_bar_window
);
5207 mark_object (ptr
->tool_bar_window
);
5208 mark_face_cache (ptr
->face_cache
);
5209 #ifdef HAVE_WINDOW_SYSTEM
5210 mark_image_cache (ptr
);
5211 mark_object (ptr
->tool_bar_items
);
5212 mark_object (ptr
->desired_tool_bar_string
);
5213 mark_object (ptr
->current_tool_bar_string
);
5214 #endif /* HAVE_WINDOW_SYSTEM */
5216 else if (GC_BOOL_VECTOR_P (obj
))
5218 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5220 if (VECTOR_MARKED_P (ptr
))
5221 break; /* Already marked */
5222 CHECK_LIVE (live_vector_p
);
5223 VECTOR_MARK (ptr
); /* Else mark it */
5225 else if (GC_WINDOWP (obj
))
5227 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5228 struct window
*w
= XWINDOW (obj
);
5231 /* Stop if already marked. */
5232 if (VECTOR_MARKED_P (ptr
))
5236 CHECK_LIVE (live_vector_p
);
5239 /* There is no Lisp data above The member CURRENT_MATRIX in
5240 struct WINDOW. Stop marking when that slot is reached. */
5242 (char *) &ptr
->contents
[i
] < (char *) &w
->current_matrix
;
5244 mark_object (ptr
->contents
[i
]);
5246 /* Mark glyphs for leaf windows. Marking window matrices is
5247 sufficient because frame matrices use the same glyph
5249 if (NILP (w
->hchild
)
5251 && w
->current_matrix
)
5253 mark_glyph_matrix (w
->current_matrix
);
5254 mark_glyph_matrix (w
->desired_matrix
);
5257 else if (GC_HASH_TABLE_P (obj
))
5259 struct Lisp_Hash_Table
*h
= XHASH_TABLE (obj
);
5261 /* Stop if already marked. */
5262 if (VECTOR_MARKED_P (h
))
5266 CHECK_LIVE (live_vector_p
);
5269 /* Mark contents. */
5270 /* Do not mark next_free or next_weak.
5271 Being in the next_weak chain
5272 should not keep the hash table alive.
5273 No need to mark `count' since it is an integer. */
5274 mark_object (h
->test
);
5275 mark_object (h
->weak
);
5276 mark_object (h
->rehash_size
);
5277 mark_object (h
->rehash_threshold
);
5278 mark_object (h
->hash
);
5279 mark_object (h
->next
);
5280 mark_object (h
->index
);
5281 mark_object (h
->user_hash_function
);
5282 mark_object (h
->user_cmp_function
);
5284 /* If hash table is not weak, mark all keys and values.
5285 For weak tables, mark only the vector. */
5286 if (GC_NILP (h
->weak
))
5287 mark_object (h
->key_and_value
);
5289 VECTOR_MARK (XVECTOR (h
->key_and_value
));
5293 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5294 register EMACS_INT size
= ptr
->size
;
5297 if (VECTOR_MARKED_P (ptr
)) break; /* Already marked */
5298 CHECK_LIVE (live_vector_p
);
5299 VECTOR_MARK (ptr
); /* Else mark it */
5300 if (size
& PSEUDOVECTOR_FLAG
)
5301 size
&= PSEUDOVECTOR_SIZE_MASK
;
5303 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5304 mark_object (ptr
->contents
[i
]);
5310 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
5311 struct Lisp_Symbol
*ptrx
;
5313 if (ptr
->gcmarkbit
) break;
5314 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
5316 mark_object (ptr
->value
);
5317 mark_object (ptr
->function
);
5318 mark_object (ptr
->plist
);
5320 if (!PURE_POINTER_P (XSTRING (ptr
->xname
)))
5321 MARK_STRING (XSTRING (ptr
->xname
));
5322 MARK_INTERVAL_TREE (STRING_INTERVALS (ptr
->xname
));
5324 /* Note that we do not mark the obarray of the symbol.
5325 It is safe not to do so because nothing accesses that
5326 slot except to check whether it is nil. */
5330 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun */
5331 XSETSYMBOL (obj
, ptrx
);
5338 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
5339 if (XMARKER (obj
)->gcmarkbit
)
5341 XMARKER (obj
)->gcmarkbit
= 1;
5343 switch (XMISCTYPE (obj
))
5345 case Lisp_Misc_Buffer_Local_Value
:
5346 case Lisp_Misc_Some_Buffer_Local_Value
:
5348 register struct Lisp_Buffer_Local_Value
*ptr
5349 = XBUFFER_LOCAL_VALUE (obj
);
5350 /* If the cdr is nil, avoid recursion for the car. */
5351 if (EQ (ptr
->cdr
, Qnil
))
5353 obj
= ptr
->realvalue
;
5356 mark_object (ptr
->realvalue
);
5357 mark_object (ptr
->buffer
);
5358 mark_object (ptr
->frame
);
5363 case Lisp_Misc_Marker
:
5364 /* DO NOT mark thru the marker's chain.
5365 The buffer's markers chain does not preserve markers from gc;
5366 instead, markers are removed from the chain when freed by gc. */
5369 case Lisp_Misc_Intfwd
:
5370 case Lisp_Misc_Boolfwd
:
5371 case Lisp_Misc_Objfwd
:
5372 case Lisp_Misc_Buffer_Objfwd
:
5373 case Lisp_Misc_Kboard_Objfwd
:
5374 /* Don't bother with Lisp_Buffer_Objfwd,
5375 since all markable slots in current buffer marked anyway. */
5376 /* Don't need to do Lisp_Objfwd, since the places they point
5377 are protected with staticpro. */
5380 case Lisp_Misc_Save_Value
:
5383 register struct Lisp_Save_Value
*ptr
= XSAVE_VALUE (obj
);
5384 /* If DOGC is set, POINTER is the address of a memory
5385 area containing INTEGER potential Lisp_Objects. */
5388 Lisp_Object
*p
= (Lisp_Object
*) ptr
->pointer
;
5390 for (nelt
= ptr
->integer
; nelt
> 0; nelt
--, p
++)
5391 mark_maybe_object (*p
);
5397 case Lisp_Misc_Overlay
:
5399 struct Lisp_Overlay
*ptr
= XOVERLAY (obj
);
5400 mark_object (ptr
->start
);
5401 mark_object (ptr
->end
);
5402 mark_object (ptr
->plist
);
5405 XSETMISC (obj
, ptr
->next
);
5418 register struct Lisp_Cons
*ptr
= XCONS (obj
);
5419 if (CONS_MARKED_P (ptr
)) break;
5420 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
5422 /* If the cdr is nil, avoid recursion for the car. */
5423 if (EQ (ptr
->cdr
, Qnil
))
5429 mark_object (ptr
->car
);
5432 if (cdr_count
== mark_object_loop_halt
)
5438 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
5439 FLOAT_MARK (XFLOAT (obj
));
5450 #undef CHECK_ALLOCATED
5451 #undef CHECK_ALLOCATED_AND_LIVE
5454 /* Mark the pointers in a buffer structure. */
5460 register struct buffer
*buffer
= XBUFFER (buf
);
5461 register Lisp_Object
*ptr
, tmp
;
5462 Lisp_Object base_buffer
;
5464 VECTOR_MARK (buffer
);
5466 MARK_INTERVAL_TREE (BUF_INTERVALS (buffer
));
5468 /* For now, we just don't mark the undo_list. It's done later in
5469 a special way just before the sweep phase, and after stripping
5470 some of its elements that are not needed any more. */
5472 if (buffer
->overlays_before
)
5474 XSETMISC (tmp
, buffer
->overlays_before
);
5477 if (buffer
->overlays_after
)
5479 XSETMISC (tmp
, buffer
->overlays_after
);
5483 for (ptr
= &buffer
->name
;
5484 (char *)ptr
< (char *)buffer
+ sizeof (struct buffer
);
5488 /* If this is an indirect buffer, mark its base buffer. */
5489 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
5491 XSETBUFFER (base_buffer
, buffer
->base_buffer
);
5492 mark_buffer (base_buffer
);
5497 /* Value is non-zero if OBJ will survive the current GC because it's
5498 either marked or does not need to be marked to survive. */
5506 switch (XGCTYPE (obj
))
5513 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
5517 survives_p
= XMARKER (obj
)->gcmarkbit
;
5521 survives_p
= STRING_MARKED_P (XSTRING (obj
));
5524 case Lisp_Vectorlike
:
5525 survives_p
= GC_SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
5529 survives_p
= CONS_MARKED_P (XCONS (obj
));
5533 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
5540 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
5545 /* Sweep: find all structures not marked, and free them. */
5550 /* Remove or mark entries in weak hash tables.
5551 This must be done before any object is unmarked. */
5552 sweep_weak_hash_tables ();
5555 #ifdef GC_CHECK_STRING_BYTES
5556 if (!noninteractive
)
5557 check_string_bytes (1);
5560 /* Put all unmarked conses on free list */
5562 register struct cons_block
*cblk
;
5563 struct cons_block
**cprev
= &cons_block
;
5564 register int lim
= cons_block_index
;
5565 register int num_free
= 0, num_used
= 0;
5569 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
5573 for (i
= 0; i
< lim
; i
++)
5574 if (!CONS_MARKED_P (&cblk
->conses
[i
]))
5577 *(struct Lisp_Cons
**)&cblk
->conses
[i
].cdr
= cons_free_list
;
5578 cons_free_list
= &cblk
->conses
[i
];
5580 cons_free_list
->car
= Vdead
;
5586 CONS_UNMARK (&cblk
->conses
[i
]);
5588 lim
= CONS_BLOCK_SIZE
;
5589 /* If this block contains only free conses and we have already
5590 seen more than two blocks worth of free conses then deallocate
5592 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
5594 *cprev
= cblk
->next
;
5595 /* Unhook from the free list. */
5596 cons_free_list
= *(struct Lisp_Cons
**) &cblk
->conses
[0].cdr
;
5597 lisp_align_free (cblk
);
5602 num_free
+= this_free
;
5603 cprev
= &cblk
->next
;
5606 total_conses
= num_used
;
5607 total_free_conses
= num_free
;
5610 /* Put all unmarked floats on free list */
5612 register struct float_block
*fblk
;
5613 struct float_block
**fprev
= &float_block
;
5614 register int lim
= float_block_index
;
5615 register int num_free
= 0, num_used
= 0;
5617 float_free_list
= 0;
5619 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
5623 for (i
= 0; i
< lim
; i
++)
5624 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
5627 *(struct Lisp_Float
**)&fblk
->floats
[i
].data
= float_free_list
;
5628 float_free_list
= &fblk
->floats
[i
];
5633 FLOAT_UNMARK (&fblk
->floats
[i
]);
5635 lim
= FLOAT_BLOCK_SIZE
;
5636 /* If this block contains only free floats and we have already
5637 seen more than two blocks worth of free floats then deallocate
5639 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
5641 *fprev
= fblk
->next
;
5642 /* Unhook from the free list. */
5643 float_free_list
= *(struct Lisp_Float
**) &fblk
->floats
[0].data
;
5644 lisp_align_free (fblk
);
5649 num_free
+= this_free
;
5650 fprev
= &fblk
->next
;
5653 total_floats
= num_used
;
5654 total_free_floats
= num_free
;
5657 /* Put all unmarked intervals on free list */
5659 register struct interval_block
*iblk
;
5660 struct interval_block
**iprev
= &interval_block
;
5661 register int lim
= interval_block_index
;
5662 register int num_free
= 0, num_used
= 0;
5664 interval_free_list
= 0;
5666 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
5671 for (i
= 0; i
< lim
; i
++)
5673 if (!iblk
->intervals
[i
].gcmarkbit
)
5675 SET_INTERVAL_PARENT (&iblk
->intervals
[i
], interval_free_list
);
5676 interval_free_list
= &iblk
->intervals
[i
];
5682 iblk
->intervals
[i
].gcmarkbit
= 0;
5685 lim
= INTERVAL_BLOCK_SIZE
;
5686 /* If this block contains only free intervals and we have already
5687 seen more than two blocks worth of free intervals then
5688 deallocate this block. */
5689 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
5691 *iprev
= iblk
->next
;
5692 /* Unhook from the free list. */
5693 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
5695 n_interval_blocks
--;
5699 num_free
+= this_free
;
5700 iprev
= &iblk
->next
;
5703 total_intervals
= num_used
;
5704 total_free_intervals
= num_free
;
5707 /* Put all unmarked symbols on free list */
5709 register struct symbol_block
*sblk
;
5710 struct symbol_block
**sprev
= &symbol_block
;
5711 register int lim
= symbol_block_index
;
5712 register int num_free
= 0, num_used
= 0;
5714 symbol_free_list
= NULL
;
5716 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
5719 struct Lisp_Symbol
*sym
= sblk
->symbols
;
5720 struct Lisp_Symbol
*end
= sym
+ lim
;
5722 for (; sym
< end
; ++sym
)
5724 /* Check if the symbol was created during loadup. In such a case
5725 it might be pointed to by pure bytecode which we don't trace,
5726 so we conservatively assume that it is live. */
5727 int pure_p
= PURE_POINTER_P (XSTRING (sym
->xname
));
5729 if (!sym
->gcmarkbit
&& !pure_p
)
5731 *(struct Lisp_Symbol
**) &sym
->value
= symbol_free_list
;
5732 symbol_free_list
= sym
;
5734 symbol_free_list
->function
= Vdead
;
5742 UNMARK_STRING (XSTRING (sym
->xname
));
5747 lim
= SYMBOL_BLOCK_SIZE
;
5748 /* If this block contains only free symbols and we have already
5749 seen more than two blocks worth of free symbols then deallocate
5751 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
5753 *sprev
= sblk
->next
;
5754 /* Unhook from the free list. */
5755 symbol_free_list
= *(struct Lisp_Symbol
**)&sblk
->symbols
[0].value
;
5761 num_free
+= this_free
;
5762 sprev
= &sblk
->next
;
5765 total_symbols
= num_used
;
5766 total_free_symbols
= num_free
;
5769 /* Put all unmarked misc's on free list.
5770 For a marker, first unchain it from the buffer it points into. */
5772 register struct marker_block
*mblk
;
5773 struct marker_block
**mprev
= &marker_block
;
5774 register int lim
= marker_block_index
;
5775 register int num_free
= 0, num_used
= 0;
5777 marker_free_list
= 0;
5779 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
5784 for (i
= 0; i
< lim
; i
++)
5786 if (!mblk
->markers
[i
].u_marker
.gcmarkbit
)
5788 if (mblk
->markers
[i
].u_marker
.type
== Lisp_Misc_Marker
)
5789 unchain_marker (&mblk
->markers
[i
].u_marker
);
5790 /* Set the type of the freed object to Lisp_Misc_Free.
5791 We could leave the type alone, since nobody checks it,
5792 but this might catch bugs faster. */
5793 mblk
->markers
[i
].u_marker
.type
= Lisp_Misc_Free
;
5794 mblk
->markers
[i
].u_free
.chain
= marker_free_list
;
5795 marker_free_list
= &mblk
->markers
[i
];
5801 mblk
->markers
[i
].u_marker
.gcmarkbit
= 0;
5804 lim
= MARKER_BLOCK_SIZE
;
5805 /* If this block contains only free markers and we have already
5806 seen more than two blocks worth of free markers then deallocate
5808 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
5810 *mprev
= mblk
->next
;
5811 /* Unhook from the free list. */
5812 marker_free_list
= mblk
->markers
[0].u_free
.chain
;
5818 num_free
+= this_free
;
5819 mprev
= &mblk
->next
;
5823 total_markers
= num_used
;
5824 total_free_markers
= num_free
;
5827 /* Free all unmarked buffers */
5829 register struct buffer
*buffer
= all_buffers
, *prev
= 0, *next
;
5832 if (!VECTOR_MARKED_P (buffer
))
5835 prev
->next
= buffer
->next
;
5837 all_buffers
= buffer
->next
;
5838 next
= buffer
->next
;
5844 VECTOR_UNMARK (buffer
);
5845 UNMARK_BALANCE_INTERVALS (BUF_INTERVALS (buffer
));
5846 prev
= buffer
, buffer
= buffer
->next
;
5850 /* Free all unmarked vectors */
5852 register struct Lisp_Vector
*vector
= all_vectors
, *prev
= 0, *next
;
5853 total_vector_size
= 0;
5856 if (!VECTOR_MARKED_P (vector
))
5859 prev
->next
= vector
->next
;
5861 all_vectors
= vector
->next
;
5862 next
= vector
->next
;
5870 VECTOR_UNMARK (vector
);
5871 if (vector
->size
& PSEUDOVECTOR_FLAG
)
5872 total_vector_size
+= (PSEUDOVECTOR_SIZE_MASK
& vector
->size
);
5874 total_vector_size
+= vector
->size
;
5875 prev
= vector
, vector
= vector
->next
;
5879 #ifdef GC_CHECK_STRING_BYTES
5880 if (!noninteractive
)
5881 check_string_bytes (1);
5888 /* Debugging aids. */
5890 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
5891 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
5892 This may be helpful in debugging Emacs's memory usage.
5893 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
5898 XSETINT (end
, (EMACS_INT
) sbrk (0) / 1024);
5903 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
5904 doc
: /* Return a list of counters that measure how much consing there has been.
5905 Each of these counters increments for a certain kind of object.
5906 The counters wrap around from the largest positive integer to zero.
5907 Garbage collection does not decrease them.
5908 The elements of the value are as follows:
5909 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
5910 All are in units of 1 = one object consed
5911 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
5913 MISCS include overlays, markers, and some internal types.
5914 Frames, windows, buffers, and subprocesses count as vectors
5915 (but the contents of a buffer's text do not count here). */)
5918 Lisp_Object consed
[8];
5920 consed
[0] = make_number (min (MOST_POSITIVE_FIXNUM
, cons_cells_consed
));
5921 consed
[1] = make_number (min (MOST_POSITIVE_FIXNUM
, floats_consed
));
5922 consed
[2] = make_number (min (MOST_POSITIVE_FIXNUM
, vector_cells_consed
));
5923 consed
[3] = make_number (min (MOST_POSITIVE_FIXNUM
, symbols_consed
));
5924 consed
[4] = make_number (min (MOST_POSITIVE_FIXNUM
, string_chars_consed
));
5925 consed
[5] = make_number (min (MOST_POSITIVE_FIXNUM
, misc_objects_consed
));
5926 consed
[6] = make_number (min (MOST_POSITIVE_FIXNUM
, intervals_consed
));
5927 consed
[7] = make_number (min (MOST_POSITIVE_FIXNUM
, strings_consed
));
5929 return Flist (8, consed
);
5932 int suppress_checking
;
5934 die (msg
, file
, line
)
5939 fprintf (stderr
, "\r\nEmacs fatal error: %s:%d: %s\r\n",
5944 /* Initialization */
5949 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
5951 pure_size
= PURESIZE
;
5952 pure_bytes_used
= 0;
5953 pure_bytes_used_before_overflow
= 0;
5955 /* Initialize the list of free aligned blocks. */
5958 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
5960 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
5964 ignore_warnings
= 1;
5965 #ifdef DOUG_LEA_MALLOC
5966 mallopt (M_TRIM_THRESHOLD
, 128*1024); /* trim threshold */
5967 mallopt (M_MMAP_THRESHOLD
, 64*1024); /* mmap threshold */
5968 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* max. number of mmap'ed areas */
5978 malloc_hysteresis
= 32;
5980 malloc_hysteresis
= 0;
5983 spare_memory
= (char *) malloc (SPARE_MEMORY
);
5985 ignore_warnings
= 0;
5987 byte_stack_list
= 0;
5989 consing_since_gc
= 0;
5990 gc_cons_threshold
= 100000 * sizeof (Lisp_Object
);
5991 #ifdef VIRT_ADDR_VARIES
5992 malloc_sbrk_unused
= 1<<22; /* A large number */
5993 malloc_sbrk_used
= 100000; /* as reasonable as any number */
5994 #endif /* VIRT_ADDR_VARIES */
6001 byte_stack_list
= 0;
6003 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
6004 setjmp_tested_p
= longjmps_done
= 0;
6007 Vgc_elapsed
= make_float (0.0);
6014 DEFVAR_INT ("gc-cons-threshold", &gc_cons_threshold
,
6015 doc
: /* *Number of bytes of consing between garbage collections.
6016 Garbage collection can happen automatically once this many bytes have been
6017 allocated since the last garbage collection. All data types count.
6019 Garbage collection happens automatically only when `eval' is called.
6021 By binding this temporarily to a large number, you can effectively
6022 prevent garbage collection during a part of the program. */);
6024 DEFVAR_INT ("pure-bytes-used", &pure_bytes_used
,
6025 doc
: /* Number of bytes of sharable Lisp data allocated so far. */);
6027 DEFVAR_INT ("cons-cells-consed", &cons_cells_consed
,
6028 doc
: /* Number of cons cells that have been consed so far. */);
6030 DEFVAR_INT ("floats-consed", &floats_consed
,
6031 doc
: /* Number of floats that have been consed so far. */);
6033 DEFVAR_INT ("vector-cells-consed", &vector_cells_consed
,
6034 doc
: /* Number of vector cells that have been consed so far. */);
6036 DEFVAR_INT ("symbols-consed", &symbols_consed
,
6037 doc
: /* Number of symbols that have been consed so far. */);
6039 DEFVAR_INT ("string-chars-consed", &string_chars_consed
,
6040 doc
: /* Number of string characters that have been consed so far. */);
6042 DEFVAR_INT ("misc-objects-consed", &misc_objects_consed
,
6043 doc
: /* Number of miscellaneous objects that have been consed so far. */);
6045 DEFVAR_INT ("intervals-consed", &intervals_consed
,
6046 doc
: /* Number of intervals that have been consed so far. */);
6048 DEFVAR_INT ("strings-consed", &strings_consed
,
6049 doc
: /* Number of strings that have been consed so far. */);
6051 DEFVAR_LISP ("purify-flag", &Vpurify_flag
,
6052 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
6053 This means that certain objects should be allocated in shared (pure) space. */);
6055 DEFVAR_BOOL ("garbage-collection-messages", &garbage_collection_messages
,
6056 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
6057 garbage_collection_messages
= 0;
6059 DEFVAR_LISP ("post-gc-hook", &Vpost_gc_hook
,
6060 doc
: /* Hook run after garbage collection has finished. */);
6061 Vpost_gc_hook
= Qnil
;
6062 Qpost_gc_hook
= intern ("post-gc-hook");
6063 staticpro (&Qpost_gc_hook
);
6065 DEFVAR_LISP ("memory-signal-data", &Vmemory_signal_data
,
6066 doc
: /* Precomputed `signal' argument for memory-full error. */);
6067 /* We build this in advance because if we wait until we need it, we might
6068 not be able to allocate the memory to hold it. */
6071 build_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"));
6073 DEFVAR_LISP ("memory-full", &Vmemory_full
,
6074 doc
: /* Non-nil means we are handling a memory-full error. */);
6075 Vmemory_full
= Qnil
;
6077 staticpro (&Qgc_cons_threshold
);
6078 Qgc_cons_threshold
= intern ("gc-cons-threshold");
6080 staticpro (&Qchar_table_extra_slots
);
6081 Qchar_table_extra_slots
= intern ("char-table-extra-slots");
6083 DEFVAR_LISP ("gc-elapsed", &Vgc_elapsed
,
6084 doc
: /* Accumulated time elapsed in garbage collections.
6085 The time is in seconds as a floating point value. */);
6086 DEFVAR_INT ("gcs-done", &gcs_done
,
6087 doc
: /* Accumulated number of garbage collections done. */);
6089 defsubr (&Smemory_full_p
);
6093 defsubr (&Smake_byte_code
);
6094 defsubr (&Smake_list
);
6095 defsubr (&Smake_vector
);
6096 defsubr (&Smake_char_table
);
6097 defsubr (&Smake_string
);
6098 defsubr (&Smake_bool_vector
);
6099 defsubr (&Smake_symbol
);
6100 defsubr (&Smake_marker
);
6101 defsubr (&Spurecopy
);
6102 defsubr (&Sgarbage_collect
);
6103 defsubr (&Smemory_limit
);
6104 defsubr (&Smemory_use_counts
);
6106 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
6107 defsubr (&Sgc_status
);
6111 /* arch-tag: 6695ca10-e3c5-4c2c-8bc3-ed26a7dda857
6112 (do not change this comment) */