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, 2006, 2007, 2008
4 Free Software Foundation, Inc.
6 This file is part of GNU Emacs.
8 GNU Emacs is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 GNU Emacs is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GNU Emacs; see the file COPYING. If not, write to
20 the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
21 Boston, MA 02110-1301, USA. */
25 #include <limits.h> /* For CHAR_BIT. */
28 #include <stddef.h> /* For offsetof, used by PSEUDOVECSIZE. */
35 /* Note that this declares bzero on OSF/1. How dumb. */
39 #ifdef HAVE_GTK_AND_PTHREAD
43 /* This file is part of the core Lisp implementation, and thus must
44 deal with the real data structures. If the Lisp implementation is
45 replaced, this file likely will not be used. */
47 #undef HIDE_LISP_IMPLEMENTATION
50 #include "intervals.h"
56 #include "blockinput.h"
58 #include "syssignal.h"
59 #include "termhooks.h" /* For struct terminal. */
62 /* GC_MALLOC_CHECK defined means perform validity checks of malloc'd
63 memory. Can do this only if using gmalloc.c. */
65 #if defined SYSTEM_MALLOC || defined DOUG_LEA_MALLOC
66 #undef GC_MALLOC_CHECK
72 extern POINTER_TYPE
*sbrk ();
76 #define INCLUDED_FCNTL
88 #ifdef DOUG_LEA_MALLOC
91 /* malloc.h #defines this as size_t, at least in glibc2. */
92 #ifndef __malloc_size_t
93 #define __malloc_size_t int
96 /* Specify maximum number of areas to mmap. It would be nice to use a
97 value that explicitly means "no limit". */
99 #define MMAP_MAX_AREAS 100000000
101 #else /* not DOUG_LEA_MALLOC */
103 /* The following come from gmalloc.c. */
105 #define __malloc_size_t size_t
106 extern __malloc_size_t _bytes_used
;
107 extern __malloc_size_t __malloc_extra_blocks
;
109 #endif /* not DOUG_LEA_MALLOC */
111 #if ! defined (SYSTEM_MALLOC) && defined (HAVE_GTK_AND_PTHREAD)
113 /* When GTK uses the file chooser dialog, different backends can be loaded
114 dynamically. One such a backend is the Gnome VFS backend that gets loaded
115 if you run Gnome. That backend creates several threads and also allocates
118 If Emacs sets malloc hooks (! SYSTEM_MALLOC) and the emacs_blocked_*
119 functions below are called from malloc, there is a chance that one
120 of these threads preempts the Emacs main thread and the hook variables
121 end up in an inconsistent state. So we have a mutex to prevent that (note
122 that the backend handles concurrent access to malloc within its own threads
123 but Emacs code running in the main thread is not included in that control).
125 When UNBLOCK_INPUT is called, reinvoke_input_signal may be called. If this
126 happens in one of the backend threads we will have two threads that tries
127 to run Emacs code at once, and the code is not prepared for that.
128 To prevent that, we only call BLOCK/UNBLOCK from the main thread. */
130 static pthread_mutex_t alloc_mutex
;
132 #define BLOCK_INPUT_ALLOC \
135 if (pthread_equal (pthread_self (), main_thread)) \
137 pthread_mutex_lock (&alloc_mutex); \
140 #define UNBLOCK_INPUT_ALLOC \
143 pthread_mutex_unlock (&alloc_mutex); \
144 if (pthread_equal (pthread_self (), main_thread)) \
149 #else /* SYSTEM_MALLOC || not HAVE_GTK_AND_PTHREAD */
151 #define BLOCK_INPUT_ALLOC BLOCK_INPUT
152 #define UNBLOCK_INPUT_ALLOC UNBLOCK_INPUT
154 #endif /* SYSTEM_MALLOC || not HAVE_GTK_AND_PTHREAD */
156 /* Value of _bytes_used, when spare_memory was freed. */
158 static __malloc_size_t bytes_used_when_full
;
160 static __malloc_size_t bytes_used_when_reconsidered
;
162 /* Mark, unmark, query mark bit of a Lisp string. S must be a pointer
163 to a struct Lisp_String. */
165 #define MARK_STRING(S) ((S)->size |= ARRAY_MARK_FLAG)
166 #define UNMARK_STRING(S) ((S)->size &= ~ARRAY_MARK_FLAG)
167 #define STRING_MARKED_P(S) (((S)->size & ARRAY_MARK_FLAG) != 0)
169 #define VECTOR_MARK(V) ((V)->size |= ARRAY_MARK_FLAG)
170 #define VECTOR_UNMARK(V) ((V)->size &= ~ARRAY_MARK_FLAG)
171 #define VECTOR_MARKED_P(V) (((V)->size & ARRAY_MARK_FLAG) != 0)
173 /* Value is the number of bytes/chars of S, a pointer to a struct
174 Lisp_String. This must be used instead of STRING_BYTES (S) or
175 S->size during GC, because S->size contains the mark bit for
178 #define GC_STRING_BYTES(S) (STRING_BYTES (S))
179 #define GC_STRING_CHARS(S) ((S)->size & ~ARRAY_MARK_FLAG)
181 /* Number of bytes of consing done since the last gc. */
183 int consing_since_gc
;
185 /* Count the amount of consing of various sorts of space. */
187 EMACS_INT cons_cells_consed
;
188 EMACS_INT floats_consed
;
189 EMACS_INT vector_cells_consed
;
190 EMACS_INT symbols_consed
;
191 EMACS_INT string_chars_consed
;
192 EMACS_INT misc_objects_consed
;
193 EMACS_INT intervals_consed
;
194 EMACS_INT strings_consed
;
196 /* Minimum number of bytes of consing since GC before next GC. */
198 EMACS_INT gc_cons_threshold
;
200 /* Similar minimum, computed from Vgc_cons_percentage. */
202 EMACS_INT gc_relative_threshold
;
204 static Lisp_Object Vgc_cons_percentage
;
206 /* Minimum number of bytes of consing since GC before next GC,
207 when memory is full. */
209 EMACS_INT memory_full_cons_threshold
;
211 /* Nonzero during GC. */
215 /* Nonzero means abort if try to GC.
216 This is for code which is written on the assumption that
217 no GC will happen, so as to verify that assumption. */
221 /* Nonzero means display messages at beginning and end of GC. */
223 int garbage_collection_messages
;
225 #ifndef VIRT_ADDR_VARIES
227 #endif /* VIRT_ADDR_VARIES */
228 int malloc_sbrk_used
;
230 #ifndef VIRT_ADDR_VARIES
232 #endif /* VIRT_ADDR_VARIES */
233 int malloc_sbrk_unused
;
235 /* Number of live and free conses etc. */
237 static int total_conses
, total_markers
, total_symbols
, total_vector_size
;
238 static int total_free_conses
, total_free_markers
, total_free_symbols
;
239 static int total_free_floats
, total_floats
;
241 /* Points to memory space allocated as "spare", to be freed if we run
242 out of memory. We keep one large block, four cons-blocks, and
243 two string blocks. */
245 static char *spare_memory
[7];
247 /* Amount of spare memory to keep in large reserve block. */
249 #define SPARE_MEMORY (1 << 14)
251 /* Number of extra blocks malloc should get when it needs more core. */
253 static int malloc_hysteresis
;
255 /* Non-nil means defun should do purecopy on the function definition. */
257 Lisp_Object Vpurify_flag
;
259 /* Non-nil means we are handling a memory-full error. */
261 Lisp_Object Vmemory_full
;
265 /* Initialize it to a nonzero value to force it into data space
266 (rather than bss space). That way unexec will remap it into text
267 space (pure), on some systems. We have not implemented the
268 remapping on more recent systems because this is less important
269 nowadays than in the days of small memories and timesharing. */
271 EMACS_INT pure
[(PURESIZE
+ sizeof (EMACS_INT
) - 1) / sizeof (EMACS_INT
)] = {1,};
272 #define PUREBEG (char *) pure
276 #define pure PURE_SEG_BITS /* Use shared memory segment */
277 #define PUREBEG (char *)PURE_SEG_BITS
279 #endif /* HAVE_SHM */
281 /* Pointer to the pure area, and its size. */
283 static char *purebeg
;
284 static size_t pure_size
;
286 /* Number of bytes of pure storage used before pure storage overflowed.
287 If this is non-zero, this implies that an overflow occurred. */
289 static size_t pure_bytes_used_before_overflow
;
291 /* Value is non-zero if P points into pure space. */
293 #define PURE_POINTER_P(P) \
294 (((PNTR_COMPARISON_TYPE) (P) \
295 < (PNTR_COMPARISON_TYPE) ((char *) purebeg + pure_size)) \
296 && ((PNTR_COMPARISON_TYPE) (P) \
297 >= (PNTR_COMPARISON_TYPE) purebeg))
299 /* Total number of bytes allocated in pure storage. */
301 EMACS_INT pure_bytes_used
;
303 /* Index in pure at which next pure Lisp object will be allocated.. */
305 static EMACS_INT pure_bytes_used_lisp
;
307 /* Number of bytes allocated for non-Lisp objects in pure storage. */
309 static EMACS_INT pure_bytes_used_non_lisp
;
311 /* If nonzero, this is a warning delivered by malloc and not yet
314 char *pending_malloc_warning
;
316 /* Pre-computed signal argument for use when memory is exhausted. */
318 Lisp_Object Vmemory_signal_data
;
320 /* Maximum amount of C stack to save when a GC happens. */
322 #ifndef MAX_SAVE_STACK
323 #define MAX_SAVE_STACK 16000
326 /* Buffer in which we save a copy of the C stack at each GC. */
328 static char *stack_copy
;
329 static int stack_copy_size
;
331 /* Non-zero means ignore malloc warnings. Set during initialization.
332 Currently not used. */
334 static int ignore_warnings
;
336 Lisp_Object Qgc_cons_threshold
, Qchar_table_extra_slots
;
338 /* Hook run after GC has finished. */
340 Lisp_Object Vpost_gc_hook
, Qpost_gc_hook
;
342 Lisp_Object Vgc_elapsed
; /* accumulated elapsed time in GC */
343 EMACS_INT gcs_done
; /* accumulated GCs */
345 static void mark_buffer
P_ ((Lisp_Object
));
346 static void mark_terminals
P_ ((void));
347 extern void mark_kboards
P_ ((void));
348 extern void mark_ttys
P_ ((void));
349 extern void mark_backtrace
P_ ((void));
350 static void gc_sweep
P_ ((void));
351 static void mark_glyph_matrix
P_ ((struct glyph_matrix
*));
352 static void mark_face_cache
P_ ((struct face_cache
*));
354 #ifdef HAVE_WINDOW_SYSTEM
355 extern void mark_fringe_data
P_ ((void));
356 static void mark_image
P_ ((struct image
*));
357 static void mark_image_cache
P_ ((struct frame
*));
358 #endif /* HAVE_WINDOW_SYSTEM */
360 static struct Lisp_String
*allocate_string
P_ ((void));
361 static void compact_small_strings
P_ ((void));
362 static void free_large_strings
P_ ((void));
363 static void sweep_strings
P_ ((void));
365 extern int message_enable_multibyte
;
367 /* When scanning the C stack for live Lisp objects, Emacs keeps track
368 of what memory allocated via lisp_malloc is intended for what
369 purpose. This enumeration specifies the type of memory. */
380 /* We used to keep separate mem_types for subtypes of vectors such as
381 process, hash_table, frame, terminal, and window, but we never made
382 use of the distinction, so it only caused source-code complexity
383 and runtime slowdown. Minor but pointless. */
387 static POINTER_TYPE
*lisp_align_malloc
P_ ((size_t, enum mem_type
));
388 static POINTER_TYPE
*lisp_malloc
P_ ((size_t, enum mem_type
));
389 void refill_memory_reserve ();
392 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
394 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
395 #include <stdio.h> /* For fprintf. */
398 /* A unique object in pure space used to make some Lisp objects
399 on free lists recognizable in O(1). */
401 static Lisp_Object Vdead
;
403 #ifdef GC_MALLOC_CHECK
405 enum mem_type allocated_mem_type
;
406 static int dont_register_blocks
;
408 #endif /* GC_MALLOC_CHECK */
410 /* A node in the red-black tree describing allocated memory containing
411 Lisp data. Each such block is recorded with its start and end
412 address when it is allocated, and removed from the tree when it
415 A red-black tree is a balanced binary tree with the following
418 1. Every node is either red or black.
419 2. Every leaf is black.
420 3. If a node is red, then both of its children are black.
421 4. Every simple path from a node to a descendant leaf contains
422 the same number of black nodes.
423 5. The root is always black.
425 When nodes are inserted into the tree, or deleted from the tree,
426 the tree is "fixed" so that these properties are always true.
428 A red-black tree with N internal nodes has height at most 2
429 log(N+1). Searches, insertions and deletions are done in O(log N).
430 Please see a text book about data structures for a detailed
431 description of red-black trees. Any book worth its salt should
436 /* Children of this node. These pointers are never NULL. When there
437 is no child, the value is MEM_NIL, which points to a dummy node. */
438 struct mem_node
*left
, *right
;
440 /* The parent of this node. In the root node, this is NULL. */
441 struct mem_node
*parent
;
443 /* Start and end of allocated region. */
447 enum {MEM_BLACK
, MEM_RED
} color
;
453 /* Base address of stack. Set in main. */
455 Lisp_Object
*stack_base
;
457 /* Root of the tree describing allocated Lisp memory. */
459 static struct mem_node
*mem_root
;
461 /* Lowest and highest known address in the heap. */
463 static void *min_heap_address
, *max_heap_address
;
465 /* Sentinel node of the tree. */
467 static struct mem_node mem_z
;
468 #define MEM_NIL &mem_z
470 static POINTER_TYPE
*lisp_malloc
P_ ((size_t, enum mem_type
));
471 static struct Lisp_Vector
*allocate_vectorlike
P_ ((EMACS_INT
));
472 static void lisp_free
P_ ((POINTER_TYPE
*));
473 static void mark_stack
P_ ((void));
474 static int live_vector_p
P_ ((struct mem_node
*, void *));
475 static int live_buffer_p
P_ ((struct mem_node
*, void *));
476 static int live_string_p
P_ ((struct mem_node
*, void *));
477 static int live_cons_p
P_ ((struct mem_node
*, void *));
478 static int live_symbol_p
P_ ((struct mem_node
*, void *));
479 static int live_float_p
P_ ((struct mem_node
*, void *));
480 static int live_misc_p
P_ ((struct mem_node
*, void *));
481 static void mark_maybe_object
P_ ((Lisp_Object
));
482 static void mark_memory
P_ ((void *, void *, int));
483 static void mem_init
P_ ((void));
484 static struct mem_node
*mem_insert
P_ ((void *, void *, enum mem_type
));
485 static void mem_insert_fixup
P_ ((struct mem_node
*));
486 static void mem_rotate_left
P_ ((struct mem_node
*));
487 static void mem_rotate_right
P_ ((struct mem_node
*));
488 static void mem_delete
P_ ((struct mem_node
*));
489 static void mem_delete_fixup
P_ ((struct mem_node
*));
490 static INLINE
struct mem_node
*mem_find
P_ ((void *));
493 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
494 static void check_gcpros
P_ ((void));
497 #endif /* GC_MARK_STACK || GC_MALLOC_CHECK */
499 /* Recording what needs to be marked for gc. */
501 struct gcpro
*gcprolist
;
503 /* Addresses of staticpro'd variables. Initialize it to a nonzero
504 value; otherwise some compilers put it into BSS. */
506 #define NSTATICS 1280
507 static Lisp_Object
*staticvec
[NSTATICS
] = {&Vpurify_flag
};
509 /* Index of next unused slot in staticvec. */
511 static int staticidx
= 0;
513 static POINTER_TYPE
*pure_alloc
P_ ((size_t, int));
516 /* Value is SZ rounded up to the next multiple of ALIGNMENT.
517 ALIGNMENT must be a power of 2. */
519 #define ALIGN(ptr, ALIGNMENT) \
520 ((POINTER_TYPE *) ((((EMACS_UINT)(ptr)) + (ALIGNMENT) - 1) \
521 & ~((ALIGNMENT) - 1)))
525 /************************************************************************
527 ************************************************************************/
529 /* Function malloc calls this if it finds we are near exhausting storage. */
535 pending_malloc_warning
= str
;
539 /* Display an already-pending malloc warning. */
542 display_malloc_warning ()
544 call3 (intern ("display-warning"),
546 build_string (pending_malloc_warning
),
547 intern ("emergency"));
548 pending_malloc_warning
= 0;
552 #ifdef DOUG_LEA_MALLOC
553 # define BYTES_USED (mallinfo ().uordblks)
555 # define BYTES_USED _bytes_used
558 /* Called if we can't allocate relocatable space for a buffer. */
561 buffer_memory_full ()
563 /* If buffers use the relocating allocator, no need to free
564 spare_memory, because we may have plenty of malloc space left
565 that we could get, and if we don't, the malloc that fails will
566 itself cause spare_memory to be freed. If buffers don't use the
567 relocating allocator, treat this like any other failing
574 /* This used to call error, but if we've run out of memory, we could
575 get infinite recursion trying to build the string. */
576 xsignal (Qnil
, Vmemory_signal_data
);
580 #ifdef XMALLOC_OVERRUN_CHECK
582 /* Check for overrun in malloc'ed buffers by wrapping a 16 byte header
583 and a 16 byte trailer around each block.
585 The header consists of 12 fixed bytes + a 4 byte integer contaning the
586 original block size, while the trailer consists of 16 fixed bytes.
588 The header is used to detect whether this block has been allocated
589 through these functions -- as it seems that some low-level libc
590 functions may bypass the malloc hooks.
594 #define XMALLOC_OVERRUN_CHECK_SIZE 16
596 static char xmalloc_overrun_check_header
[XMALLOC_OVERRUN_CHECK_SIZE
-4] =
597 { 0x9a, 0x9b, 0xae, 0xaf,
598 0xbf, 0xbe, 0xce, 0xcf,
599 0xea, 0xeb, 0xec, 0xed };
601 static char xmalloc_overrun_check_trailer
[XMALLOC_OVERRUN_CHECK_SIZE
] =
602 { 0xaa, 0xab, 0xac, 0xad,
603 0xba, 0xbb, 0xbc, 0xbd,
604 0xca, 0xcb, 0xcc, 0xcd,
605 0xda, 0xdb, 0xdc, 0xdd };
607 /* Macros to insert and extract the block size in the header. */
609 #define XMALLOC_PUT_SIZE(ptr, size) \
610 (ptr[-1] = (size & 0xff), \
611 ptr[-2] = ((size >> 8) & 0xff), \
612 ptr[-3] = ((size >> 16) & 0xff), \
613 ptr[-4] = ((size >> 24) & 0xff))
615 #define XMALLOC_GET_SIZE(ptr) \
616 (size_t)((unsigned)(ptr[-1]) | \
617 ((unsigned)(ptr[-2]) << 8) | \
618 ((unsigned)(ptr[-3]) << 16) | \
619 ((unsigned)(ptr[-4]) << 24))
622 /* The call depth in overrun_check functions. For example, this might happen:
624 overrun_check_malloc()
625 -> malloc -> (via hook)_-> emacs_blocked_malloc
626 -> overrun_check_malloc
627 call malloc (hooks are NULL, so real malloc is called).
628 malloc returns 10000.
629 add overhead, return 10016.
630 <- (back in overrun_check_malloc)
631 add overhead again, return 10032
632 xmalloc returns 10032.
637 overrun_check_free(10032)
639 free(10016) <- crash, because 10000 is the original pointer. */
641 static int check_depth
;
643 /* Like malloc, but wraps allocated block with header and trailer. */
646 overrun_check_malloc (size
)
649 register unsigned char *val
;
650 size_t overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_SIZE
*2 : 0;
652 val
= (unsigned char *) malloc (size
+ overhead
);
653 if (val
&& check_depth
== 1)
655 bcopy (xmalloc_overrun_check_header
, val
, XMALLOC_OVERRUN_CHECK_SIZE
- 4);
656 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
657 XMALLOC_PUT_SIZE(val
, size
);
658 bcopy (xmalloc_overrun_check_trailer
, val
+ size
, XMALLOC_OVERRUN_CHECK_SIZE
);
661 return (POINTER_TYPE
*)val
;
665 /* Like realloc, but checks old block for overrun, and wraps new block
666 with header and trailer. */
669 overrun_check_realloc (block
, size
)
673 register unsigned char *val
= (unsigned char *)block
;
674 size_t overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_SIZE
*2 : 0;
678 && bcmp (xmalloc_overrun_check_header
,
679 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
680 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
682 size_t osize
= XMALLOC_GET_SIZE (val
);
683 if (bcmp (xmalloc_overrun_check_trailer
,
685 XMALLOC_OVERRUN_CHECK_SIZE
))
687 bzero (val
+ osize
, XMALLOC_OVERRUN_CHECK_SIZE
);
688 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
689 bzero (val
, XMALLOC_OVERRUN_CHECK_SIZE
);
692 val
= (unsigned char *) realloc ((POINTER_TYPE
*)val
, size
+ overhead
);
694 if (val
&& check_depth
== 1)
696 bcopy (xmalloc_overrun_check_header
, val
, XMALLOC_OVERRUN_CHECK_SIZE
- 4);
697 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
698 XMALLOC_PUT_SIZE(val
, size
);
699 bcopy (xmalloc_overrun_check_trailer
, val
+ size
, XMALLOC_OVERRUN_CHECK_SIZE
);
702 return (POINTER_TYPE
*)val
;
705 /* Like free, but checks block for overrun. */
708 overrun_check_free (block
)
711 unsigned char *val
= (unsigned char *)block
;
716 && bcmp (xmalloc_overrun_check_header
,
717 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
718 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
720 size_t osize
= XMALLOC_GET_SIZE (val
);
721 if (bcmp (xmalloc_overrun_check_trailer
,
723 XMALLOC_OVERRUN_CHECK_SIZE
))
725 #ifdef XMALLOC_CLEAR_FREE_MEMORY
726 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
727 memset (val
, 0xff, osize
+ XMALLOC_OVERRUN_CHECK_SIZE
*2);
729 bzero (val
+ osize
, XMALLOC_OVERRUN_CHECK_SIZE
);
730 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
731 bzero (val
, XMALLOC_OVERRUN_CHECK_SIZE
);
742 #define malloc overrun_check_malloc
743 #define realloc overrun_check_realloc
744 #define free overrun_check_free
748 /* When using SYNC_INPUT, we don't call malloc from a signal handler, so
749 there's no need to block input around malloc. */
750 #define MALLOC_BLOCK_INPUT ((void)0)
751 #define MALLOC_UNBLOCK_INPUT ((void)0)
753 #define MALLOC_BLOCK_INPUT BLOCK_INPUT
754 #define MALLOC_UNBLOCK_INPUT UNBLOCK_INPUT
757 /* Like malloc but check for no memory and block interrupt input.. */
763 register POINTER_TYPE
*val
;
766 val
= (POINTER_TYPE
*) malloc (size
);
767 MALLOC_UNBLOCK_INPUT
;
775 /* Like realloc but check for no memory and block interrupt input.. */
778 xrealloc (block
, size
)
782 register POINTER_TYPE
*val
;
785 /* We must call malloc explicitly when BLOCK is 0, since some
786 reallocs don't do this. */
788 val
= (POINTER_TYPE
*) malloc (size
);
790 val
= (POINTER_TYPE
*) realloc (block
, size
);
791 MALLOC_UNBLOCK_INPUT
;
793 if (!val
&& size
) memory_full ();
798 /* Like free but block interrupt input. */
806 MALLOC_UNBLOCK_INPUT
;
807 /* We don't call refill_memory_reserve here
808 because that duplicates doing so in emacs_blocked_free
809 and the criterion should go there. */
813 /* Like strdup, but uses xmalloc. */
819 size_t len
= strlen (s
) + 1;
820 char *p
= (char *) xmalloc (len
);
826 /* Unwind for SAFE_ALLOCA */
829 safe_alloca_unwind (arg
)
832 register struct Lisp_Save_Value
*p
= XSAVE_VALUE (arg
);
842 /* Like malloc but used for allocating Lisp data. NBYTES is the
843 number of bytes to allocate, TYPE describes the intended use of the
844 allcated memory block (for strings, for conses, ...). */
847 static void *lisp_malloc_loser
;
850 static POINTER_TYPE
*
851 lisp_malloc (nbytes
, type
)
859 #ifdef GC_MALLOC_CHECK
860 allocated_mem_type
= type
;
863 val
= (void *) malloc (nbytes
);
866 /* If the memory just allocated cannot be addressed thru a Lisp
867 object's pointer, and it needs to be,
868 that's equivalent to running out of memory. */
869 if (val
&& type
!= MEM_TYPE_NON_LISP
)
872 XSETCONS (tem
, (char *) val
+ nbytes
- 1);
873 if ((char *) XCONS (tem
) != (char *) val
+ nbytes
- 1)
875 lisp_malloc_loser
= val
;
882 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
883 if (val
&& type
!= MEM_TYPE_NON_LISP
)
884 mem_insert (val
, (char *) val
+ nbytes
, type
);
887 MALLOC_UNBLOCK_INPUT
;
893 /* Free BLOCK. This must be called to free memory allocated with a
894 call to lisp_malloc. */
902 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
903 mem_delete (mem_find (block
));
905 MALLOC_UNBLOCK_INPUT
;
908 /* Allocation of aligned blocks of memory to store Lisp data. */
909 /* The entry point is lisp_align_malloc which returns blocks of at most */
910 /* BLOCK_BYTES and guarantees they are aligned on a BLOCK_ALIGN boundary. */
912 /* Use posix_memalloc if the system has it and we're using the system's
913 malloc (because our gmalloc.c routines don't have posix_memalign although
914 its memalloc could be used). */
915 #if defined (HAVE_POSIX_MEMALIGN) && defined (SYSTEM_MALLOC)
916 #define USE_POSIX_MEMALIGN 1
919 /* BLOCK_ALIGN has to be a power of 2. */
920 #define BLOCK_ALIGN (1 << 10)
922 /* Padding to leave at the end of a malloc'd block. This is to give
923 malloc a chance to minimize the amount of memory wasted to alignment.
924 It should be tuned to the particular malloc library used.
925 On glibc-2.3.2, malloc never tries to align, so a padding of 0 is best.
926 posix_memalign on the other hand would ideally prefer a value of 4
927 because otherwise, there's 1020 bytes wasted between each ablocks.
928 In Emacs, testing shows that those 1020 can most of the time be
929 efficiently used by malloc to place other objects, so a value of 0 can
930 still preferable unless you have a lot of aligned blocks and virtually
932 #define BLOCK_PADDING 0
933 #define BLOCK_BYTES \
934 (BLOCK_ALIGN - sizeof (struct ablock *) - BLOCK_PADDING)
936 /* Internal data structures and constants. */
938 #define ABLOCKS_SIZE 16
940 /* An aligned block of memory. */
945 char payload
[BLOCK_BYTES
];
946 struct ablock
*next_free
;
948 /* `abase' is the aligned base of the ablocks. */
949 /* It is overloaded to hold the virtual `busy' field that counts
950 the number of used ablock in the parent ablocks.
951 The first ablock has the `busy' field, the others have the `abase'
952 field. To tell the difference, we assume that pointers will have
953 integer values larger than 2 * ABLOCKS_SIZE. The lowest bit of `busy'
954 is used to tell whether the real base of the parent ablocks is `abase'
955 (if not, the word before the first ablock holds a pointer to the
957 struct ablocks
*abase
;
958 /* The padding of all but the last ablock is unused. The padding of
959 the last ablock in an ablocks is not allocated. */
961 char padding
[BLOCK_PADDING
];
965 /* A bunch of consecutive aligned blocks. */
968 struct ablock blocks
[ABLOCKS_SIZE
];
971 /* Size of the block requested from malloc or memalign. */
972 #define ABLOCKS_BYTES (sizeof (struct ablocks) - BLOCK_PADDING)
974 #define ABLOCK_ABASE(block) \
975 (((unsigned long) (block)->abase) <= (1 + 2 * ABLOCKS_SIZE) \
976 ? (struct ablocks *)(block) \
979 /* Virtual `busy' field. */
980 #define ABLOCKS_BUSY(abase) ((abase)->blocks[0].abase)
982 /* Pointer to the (not necessarily aligned) malloc block. */
983 #ifdef USE_POSIX_MEMALIGN
984 #define ABLOCKS_BASE(abase) (abase)
986 #define ABLOCKS_BASE(abase) \
987 (1 & (long) ABLOCKS_BUSY (abase) ? abase : ((void**)abase)[-1])
990 /* The list of free ablock. */
991 static struct ablock
*free_ablock
;
993 /* Allocate an aligned block of nbytes.
994 Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be
995 smaller or equal to BLOCK_BYTES. */
996 static POINTER_TYPE
*
997 lisp_align_malloc (nbytes
, type
)
1002 struct ablocks
*abase
;
1004 eassert (nbytes
<= BLOCK_BYTES
);
1008 #ifdef GC_MALLOC_CHECK
1009 allocated_mem_type
= type
;
1015 EMACS_INT aligned
; /* int gets warning casting to 64-bit pointer. */
1017 #ifdef DOUG_LEA_MALLOC
1018 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1019 because mapped region contents are not preserved in
1021 mallopt (M_MMAP_MAX
, 0);
1024 #ifdef USE_POSIX_MEMALIGN
1026 int err
= posix_memalign (&base
, BLOCK_ALIGN
, ABLOCKS_BYTES
);
1032 base
= malloc (ABLOCKS_BYTES
);
1033 abase
= ALIGN (base
, BLOCK_ALIGN
);
1038 MALLOC_UNBLOCK_INPUT
;
1042 aligned
= (base
== abase
);
1044 ((void**)abase
)[-1] = base
;
1046 #ifdef DOUG_LEA_MALLOC
1047 /* Back to a reasonable maximum of mmap'ed areas. */
1048 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1052 /* If the memory just allocated cannot be addressed thru a Lisp
1053 object's pointer, and it needs to be, that's equivalent to
1054 running out of memory. */
1055 if (type
!= MEM_TYPE_NON_LISP
)
1058 char *end
= (char *) base
+ ABLOCKS_BYTES
- 1;
1059 XSETCONS (tem
, end
);
1060 if ((char *) XCONS (tem
) != end
)
1062 lisp_malloc_loser
= base
;
1064 MALLOC_UNBLOCK_INPUT
;
1070 /* Initialize the blocks and put them on the free list.
1071 Is `base' was not properly aligned, we can't use the last block. */
1072 for (i
= 0; i
< (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1); i
++)
1074 abase
->blocks
[i
].abase
= abase
;
1075 abase
->blocks
[i
].x
.next_free
= free_ablock
;
1076 free_ablock
= &abase
->blocks
[i
];
1078 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (long) aligned
;
1080 eassert (0 == ((EMACS_UINT
)abase
) % BLOCK_ALIGN
);
1081 eassert (ABLOCK_ABASE (&abase
->blocks
[3]) == abase
); /* 3 is arbitrary */
1082 eassert (ABLOCK_ABASE (&abase
->blocks
[0]) == abase
);
1083 eassert (ABLOCKS_BASE (abase
) == base
);
1084 eassert (aligned
== (long) ABLOCKS_BUSY (abase
));
1087 abase
= ABLOCK_ABASE (free_ablock
);
1088 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (2 + (long) ABLOCKS_BUSY (abase
));
1090 free_ablock
= free_ablock
->x
.next_free
;
1092 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1093 if (val
&& type
!= MEM_TYPE_NON_LISP
)
1094 mem_insert (val
, (char *) val
+ nbytes
, type
);
1097 MALLOC_UNBLOCK_INPUT
;
1101 eassert (0 == ((EMACS_UINT
)val
) % BLOCK_ALIGN
);
1106 lisp_align_free (block
)
1107 POINTER_TYPE
*block
;
1109 struct ablock
*ablock
= block
;
1110 struct ablocks
*abase
= ABLOCK_ABASE (ablock
);
1113 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1114 mem_delete (mem_find (block
));
1116 /* Put on free list. */
1117 ablock
->x
.next_free
= free_ablock
;
1118 free_ablock
= ablock
;
1119 /* Update busy count. */
1120 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (-2 + (long) ABLOCKS_BUSY (abase
));
1122 if (2 > (long) ABLOCKS_BUSY (abase
))
1123 { /* All the blocks are free. */
1124 int i
= 0, aligned
= (long) ABLOCKS_BUSY (abase
);
1125 struct ablock
**tem
= &free_ablock
;
1126 struct ablock
*atop
= &abase
->blocks
[aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1];
1130 if (*tem
>= (struct ablock
*) abase
&& *tem
< atop
)
1133 *tem
= (*tem
)->x
.next_free
;
1136 tem
= &(*tem
)->x
.next_free
;
1138 eassert ((aligned
& 1) == aligned
);
1139 eassert (i
== (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1));
1140 #ifdef USE_POSIX_MEMALIGN
1141 eassert ((unsigned long)ABLOCKS_BASE (abase
) % BLOCK_ALIGN
== 0);
1143 free (ABLOCKS_BASE (abase
));
1145 MALLOC_UNBLOCK_INPUT
;
1148 /* Return a new buffer structure allocated from the heap with
1149 a call to lisp_malloc. */
1155 = (struct buffer
*) lisp_malloc (sizeof (struct buffer
),
1157 b
->size
= sizeof (struct buffer
) / sizeof (EMACS_INT
);
1158 XSETPVECTYPE (b
, PVEC_BUFFER
);
1163 #ifndef SYSTEM_MALLOC
1165 /* Arranging to disable input signals while we're in malloc.
1167 This only works with GNU malloc. To help out systems which can't
1168 use GNU malloc, all the calls to malloc, realloc, and free
1169 elsewhere in the code should be inside a BLOCK_INPUT/UNBLOCK_INPUT
1170 pair; unfortunately, we have no idea what C library functions
1171 might call malloc, so we can't really protect them unless you're
1172 using GNU malloc. Fortunately, most of the major operating systems
1173 can use GNU malloc. */
1176 /* When using SYNC_INPUT, we don't call malloc from a signal handler, so
1177 there's no need to block input around malloc. */
1179 #ifndef DOUG_LEA_MALLOC
1180 extern void * (*__malloc_hook
) P_ ((size_t, const void *));
1181 extern void * (*__realloc_hook
) P_ ((void *, size_t, const void *));
1182 extern void (*__free_hook
) P_ ((void *, const void *));
1183 /* Else declared in malloc.h, perhaps with an extra arg. */
1184 #endif /* DOUG_LEA_MALLOC */
1185 static void * (*old_malloc_hook
) P_ ((size_t, const void *));
1186 static void * (*old_realloc_hook
) P_ ((void *, size_t, const void*));
1187 static void (*old_free_hook
) P_ ((void*, const void*));
1189 /* This function is used as the hook for free to call. */
1192 emacs_blocked_free (ptr
, ptr2
)
1198 #ifdef GC_MALLOC_CHECK
1204 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1207 "Freeing `%p' which wasn't allocated with malloc\n", ptr
);
1212 /* fprintf (stderr, "free %p...%p (%p)\n", m->start, m->end, ptr); */
1216 #endif /* GC_MALLOC_CHECK */
1218 __free_hook
= old_free_hook
;
1221 /* If we released our reserve (due to running out of memory),
1222 and we have a fair amount free once again,
1223 try to set aside another reserve in case we run out once more. */
1224 if (! NILP (Vmemory_full
)
1225 /* Verify there is enough space that even with the malloc
1226 hysteresis this call won't run out again.
1227 The code here is correct as long as SPARE_MEMORY
1228 is substantially larger than the block size malloc uses. */
1229 && (bytes_used_when_full
1230 > ((bytes_used_when_reconsidered
= BYTES_USED
)
1231 + max (malloc_hysteresis
, 4) * SPARE_MEMORY
)))
1232 refill_memory_reserve ();
1234 __free_hook
= emacs_blocked_free
;
1235 UNBLOCK_INPUT_ALLOC
;
1239 /* This function is the malloc hook that Emacs uses. */
1242 emacs_blocked_malloc (size
, ptr
)
1249 __malloc_hook
= old_malloc_hook
;
1250 #ifdef DOUG_LEA_MALLOC
1251 /* Segfaults on my system. --lorentey */
1252 /* mallopt (M_TOP_PAD, malloc_hysteresis * 4096); */
1254 __malloc_extra_blocks
= malloc_hysteresis
;
1257 value
= (void *) malloc (size
);
1259 #ifdef GC_MALLOC_CHECK
1261 struct mem_node
*m
= mem_find (value
);
1264 fprintf (stderr
, "Malloc returned %p which is already in use\n",
1266 fprintf (stderr
, "Region in use is %p...%p, %u bytes, type %d\n",
1267 m
->start
, m
->end
, (char *) m
->end
- (char *) m
->start
,
1272 if (!dont_register_blocks
)
1274 mem_insert (value
, (char *) value
+ max (1, size
), allocated_mem_type
);
1275 allocated_mem_type
= MEM_TYPE_NON_LISP
;
1278 #endif /* GC_MALLOC_CHECK */
1280 __malloc_hook
= emacs_blocked_malloc
;
1281 UNBLOCK_INPUT_ALLOC
;
1283 /* fprintf (stderr, "%p malloc\n", value); */
1288 /* This function is the realloc hook that Emacs uses. */
1291 emacs_blocked_realloc (ptr
, size
, ptr2
)
1299 __realloc_hook
= old_realloc_hook
;
1301 #ifdef GC_MALLOC_CHECK
1304 struct mem_node
*m
= mem_find (ptr
);
1305 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1308 "Realloc of %p which wasn't allocated with malloc\n",
1316 /* fprintf (stderr, "%p -> realloc\n", ptr); */
1318 /* Prevent malloc from registering blocks. */
1319 dont_register_blocks
= 1;
1320 #endif /* GC_MALLOC_CHECK */
1322 value
= (void *) realloc (ptr
, size
);
1324 #ifdef GC_MALLOC_CHECK
1325 dont_register_blocks
= 0;
1328 struct mem_node
*m
= mem_find (value
);
1331 fprintf (stderr
, "Realloc returns memory that is already in use\n");
1335 /* Can't handle zero size regions in the red-black tree. */
1336 mem_insert (value
, (char *) value
+ max (size
, 1), MEM_TYPE_NON_LISP
);
1339 /* fprintf (stderr, "%p <- realloc\n", value); */
1340 #endif /* GC_MALLOC_CHECK */
1342 __realloc_hook
= emacs_blocked_realloc
;
1343 UNBLOCK_INPUT_ALLOC
;
1349 #ifdef HAVE_GTK_AND_PTHREAD
1350 /* Called from Fdump_emacs so that when the dumped Emacs starts, it has a
1351 normal malloc. Some thread implementations need this as they call
1352 malloc before main. The pthread_self call in BLOCK_INPUT_ALLOC then
1353 calls malloc because it is the first call, and we have an endless loop. */
1356 reset_malloc_hooks ()
1358 __free_hook
= old_free_hook
;
1359 __malloc_hook
= old_malloc_hook
;
1360 __realloc_hook
= old_realloc_hook
;
1362 #endif /* HAVE_GTK_AND_PTHREAD */
1365 /* Called from main to set up malloc to use our hooks. */
1368 uninterrupt_malloc ()
1370 #ifdef HAVE_GTK_AND_PTHREAD
1371 pthread_mutexattr_t attr
;
1373 /* GLIBC has a faster way to do this, but lets keep it portable.
1374 This is according to the Single UNIX Specification. */
1375 pthread_mutexattr_init (&attr
);
1376 pthread_mutexattr_settype (&attr
, PTHREAD_MUTEX_RECURSIVE
);
1377 pthread_mutex_init (&alloc_mutex
, &attr
);
1378 #endif /* HAVE_GTK_AND_PTHREAD */
1380 if (__free_hook
!= emacs_blocked_free
)
1381 old_free_hook
= __free_hook
;
1382 __free_hook
= emacs_blocked_free
;
1384 if (__malloc_hook
!= emacs_blocked_malloc
)
1385 old_malloc_hook
= __malloc_hook
;
1386 __malloc_hook
= emacs_blocked_malloc
;
1388 if (__realloc_hook
!= emacs_blocked_realloc
)
1389 old_realloc_hook
= __realloc_hook
;
1390 __realloc_hook
= emacs_blocked_realloc
;
1393 #endif /* not SYNC_INPUT */
1394 #endif /* not SYSTEM_MALLOC */
1398 /***********************************************************************
1400 ***********************************************************************/
1402 /* Number of intervals allocated in an interval_block structure.
1403 The 1020 is 1024 minus malloc overhead. */
1405 #define INTERVAL_BLOCK_SIZE \
1406 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
1408 /* Intervals are allocated in chunks in form of an interval_block
1411 struct interval_block
1413 /* Place `intervals' first, to preserve alignment. */
1414 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
1415 struct interval_block
*next
;
1418 /* Current interval block. Its `next' pointer points to older
1421 static struct interval_block
*interval_block
;
1423 /* Index in interval_block above of the next unused interval
1426 static int interval_block_index
;
1428 /* Number of free and live intervals. */
1430 static int total_free_intervals
, total_intervals
;
1432 /* List of free intervals. */
1434 INTERVAL interval_free_list
;
1436 /* Total number of interval blocks now in use. */
1438 static int n_interval_blocks
;
1441 /* Initialize interval allocation. */
1446 interval_block
= NULL
;
1447 interval_block_index
= INTERVAL_BLOCK_SIZE
;
1448 interval_free_list
= 0;
1449 n_interval_blocks
= 0;
1453 /* Return a new interval. */
1460 /* eassert (!handling_signal); */
1464 if (interval_free_list
)
1466 val
= interval_free_list
;
1467 interval_free_list
= INTERVAL_PARENT (interval_free_list
);
1471 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
1473 register struct interval_block
*newi
;
1475 newi
= (struct interval_block
*) lisp_malloc (sizeof *newi
,
1478 newi
->next
= interval_block
;
1479 interval_block
= newi
;
1480 interval_block_index
= 0;
1481 n_interval_blocks
++;
1483 val
= &interval_block
->intervals
[interval_block_index
++];
1486 MALLOC_UNBLOCK_INPUT
;
1488 consing_since_gc
+= sizeof (struct interval
);
1490 RESET_INTERVAL (val
);
1496 /* Mark Lisp objects in interval I. */
1499 mark_interval (i
, dummy
)
1500 register INTERVAL i
;
1503 eassert (!i
->gcmarkbit
); /* Intervals are never shared. */
1505 mark_object (i
->plist
);
1509 /* Mark the interval tree rooted in TREE. Don't call this directly;
1510 use the macro MARK_INTERVAL_TREE instead. */
1513 mark_interval_tree (tree
)
1514 register INTERVAL tree
;
1516 /* No need to test if this tree has been marked already; this
1517 function is always called through the MARK_INTERVAL_TREE macro,
1518 which takes care of that. */
1520 traverse_intervals_noorder (tree
, mark_interval
, Qnil
);
1524 /* Mark the interval tree rooted in I. */
1526 #define MARK_INTERVAL_TREE(i) \
1528 if (!NULL_INTERVAL_P (i) && !i->gcmarkbit) \
1529 mark_interval_tree (i); \
1533 #define UNMARK_BALANCE_INTERVALS(i) \
1535 if (! NULL_INTERVAL_P (i)) \
1536 (i) = balance_intervals (i); \
1540 /* Number support. If NO_UNION_TYPE isn't in effect, we
1541 can't create number objects in macros. */
1549 obj
.s
.type
= Lisp_Int
;
1554 /***********************************************************************
1556 ***********************************************************************/
1558 /* Lisp_Strings are allocated in string_block structures. When a new
1559 string_block is allocated, all the Lisp_Strings it contains are
1560 added to a free-list string_free_list. When a new Lisp_String is
1561 needed, it is taken from that list. During the sweep phase of GC,
1562 string_blocks that are entirely free are freed, except two which
1565 String data is allocated from sblock structures. Strings larger
1566 than LARGE_STRING_BYTES, get their own sblock, data for smaller
1567 strings is sub-allocated out of sblocks of size SBLOCK_SIZE.
1569 Sblocks consist internally of sdata structures, one for each
1570 Lisp_String. The sdata structure points to the Lisp_String it
1571 belongs to. The Lisp_String points back to the `u.data' member of
1572 its sdata structure.
1574 When a Lisp_String is freed during GC, it is put back on
1575 string_free_list, and its `data' member and its sdata's `string'
1576 pointer is set to null. The size of the string is recorded in the
1577 `u.nbytes' member of the sdata. So, sdata structures that are no
1578 longer used, can be easily recognized, and it's easy to compact the
1579 sblocks of small strings which we do in compact_small_strings. */
1581 /* Size in bytes of an sblock structure used for small strings. This
1582 is 8192 minus malloc overhead. */
1584 #define SBLOCK_SIZE 8188
1586 /* Strings larger than this are considered large strings. String data
1587 for large strings is allocated from individual sblocks. */
1589 #define LARGE_STRING_BYTES 1024
1591 /* Structure describing string memory sub-allocated from an sblock.
1592 This is where the contents of Lisp strings are stored. */
1596 /* Back-pointer to the string this sdata belongs to. If null, this
1597 structure is free, and the NBYTES member of the union below
1598 contains the string's byte size (the same value that STRING_BYTES
1599 would return if STRING were non-null). If non-null, STRING_BYTES
1600 (STRING) is the size of the data, and DATA contains the string's
1602 struct Lisp_String
*string
;
1604 #ifdef GC_CHECK_STRING_BYTES
1607 unsigned char data
[1];
1609 #define SDATA_NBYTES(S) (S)->nbytes
1610 #define SDATA_DATA(S) (S)->data
1612 #else /* not GC_CHECK_STRING_BYTES */
1616 /* When STRING in non-null. */
1617 unsigned char data
[1];
1619 /* When STRING is null. */
1624 #define SDATA_NBYTES(S) (S)->u.nbytes
1625 #define SDATA_DATA(S) (S)->u.data
1627 #endif /* not GC_CHECK_STRING_BYTES */
1631 /* Structure describing a block of memory which is sub-allocated to
1632 obtain string data memory for strings. Blocks for small strings
1633 are of fixed size SBLOCK_SIZE. Blocks for large strings are made
1634 as large as needed. */
1639 struct sblock
*next
;
1641 /* Pointer to the next free sdata block. This points past the end
1642 of the sblock if there isn't any space left in this block. */
1643 struct sdata
*next_free
;
1645 /* Start of data. */
1646 struct sdata first_data
;
1649 /* Number of Lisp strings in a string_block structure. The 1020 is
1650 1024 minus malloc overhead. */
1652 #define STRING_BLOCK_SIZE \
1653 ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String))
1655 /* Structure describing a block from which Lisp_String structures
1660 /* Place `strings' first, to preserve alignment. */
1661 struct Lisp_String strings
[STRING_BLOCK_SIZE
];
1662 struct string_block
*next
;
1665 /* Head and tail of the list of sblock structures holding Lisp string
1666 data. We always allocate from current_sblock. The NEXT pointers
1667 in the sblock structures go from oldest_sblock to current_sblock. */
1669 static struct sblock
*oldest_sblock
, *current_sblock
;
1671 /* List of sblocks for large strings. */
1673 static struct sblock
*large_sblocks
;
1675 /* List of string_block structures, and how many there are. */
1677 static struct string_block
*string_blocks
;
1678 static int n_string_blocks
;
1680 /* Free-list of Lisp_Strings. */
1682 static struct Lisp_String
*string_free_list
;
1684 /* Number of live and free Lisp_Strings. */
1686 static int total_strings
, total_free_strings
;
1688 /* Number of bytes used by live strings. */
1690 static int total_string_size
;
1692 /* Given a pointer to a Lisp_String S which is on the free-list
1693 string_free_list, return a pointer to its successor in the
1696 #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S))
1698 /* Return a pointer to the sdata structure belonging to Lisp string S.
1699 S must be live, i.e. S->data must not be null. S->data is actually
1700 a pointer to the `u.data' member of its sdata structure; the
1701 structure starts at a constant offset in front of that. */
1703 #ifdef GC_CHECK_STRING_BYTES
1705 #define SDATA_OF_STRING(S) \
1706 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *) \
1707 - sizeof (EMACS_INT)))
1709 #else /* not GC_CHECK_STRING_BYTES */
1711 #define SDATA_OF_STRING(S) \
1712 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *)))
1714 #endif /* not GC_CHECK_STRING_BYTES */
1717 #ifdef GC_CHECK_STRING_OVERRUN
1719 /* We check for overrun in string data blocks by appending a small
1720 "cookie" after each allocated string data block, and check for the
1721 presence of this cookie during GC. */
1723 #define GC_STRING_OVERRUN_COOKIE_SIZE 4
1724 static char string_overrun_cookie
[GC_STRING_OVERRUN_COOKIE_SIZE
] =
1725 { 0xde, 0xad, 0xbe, 0xef };
1728 #define GC_STRING_OVERRUN_COOKIE_SIZE 0
1731 /* Value is the size of an sdata structure large enough to hold NBYTES
1732 bytes of string data. The value returned includes a terminating
1733 NUL byte, the size of the sdata structure, and padding. */
1735 #ifdef GC_CHECK_STRING_BYTES
1737 #define SDATA_SIZE(NBYTES) \
1738 ((sizeof (struct Lisp_String *) \
1740 + sizeof (EMACS_INT) \
1741 + sizeof (EMACS_INT) - 1) \
1742 & ~(sizeof (EMACS_INT) - 1))
1744 #else /* not GC_CHECK_STRING_BYTES */
1746 #define SDATA_SIZE(NBYTES) \
1747 ((sizeof (struct Lisp_String *) \
1749 + sizeof (EMACS_INT) - 1) \
1750 & ~(sizeof (EMACS_INT) - 1))
1752 #endif /* not GC_CHECK_STRING_BYTES */
1754 /* Extra bytes to allocate for each string. */
1756 #define GC_STRING_EXTRA (GC_STRING_OVERRUN_COOKIE_SIZE)
1758 /* Initialize string allocation. Called from init_alloc_once. */
1763 total_strings
= total_free_strings
= total_string_size
= 0;
1764 oldest_sblock
= current_sblock
= large_sblocks
= NULL
;
1765 string_blocks
= NULL
;
1766 n_string_blocks
= 0;
1767 string_free_list
= NULL
;
1768 empty_unibyte_string
= make_pure_string ("", 0, 0, 0);
1769 empty_multibyte_string
= make_pure_string ("", 0, 0, 1);
1773 #ifdef GC_CHECK_STRING_BYTES
1775 static int check_string_bytes_count
;
1777 static void check_string_bytes
P_ ((int));
1778 static void check_sblock
P_ ((struct sblock
*));
1780 #define CHECK_STRING_BYTES(S) STRING_BYTES (S)
1783 /* Like GC_STRING_BYTES, but with debugging check. */
1787 struct Lisp_String
*s
;
1789 int nbytes
= (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1790 if (!PURE_POINTER_P (s
)
1792 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1797 /* Check validity of Lisp strings' string_bytes member in B. */
1803 struct sdata
*from
, *end
, *from_end
;
1807 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1809 /* Compute the next FROM here because copying below may
1810 overwrite data we need to compute it. */
1813 /* Check that the string size recorded in the string is the
1814 same as the one recorded in the sdata structure. */
1816 CHECK_STRING_BYTES (from
->string
);
1819 nbytes
= GC_STRING_BYTES (from
->string
);
1821 nbytes
= SDATA_NBYTES (from
);
1823 nbytes
= SDATA_SIZE (nbytes
);
1824 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
1829 /* Check validity of Lisp strings' string_bytes member. ALL_P
1830 non-zero means check all strings, otherwise check only most
1831 recently allocated strings. Used for hunting a bug. */
1834 check_string_bytes (all_p
)
1841 for (b
= large_sblocks
; b
; b
= b
->next
)
1843 struct Lisp_String
*s
= b
->first_data
.string
;
1845 CHECK_STRING_BYTES (s
);
1848 for (b
= oldest_sblock
; b
; b
= b
->next
)
1852 check_sblock (current_sblock
);
1855 #endif /* GC_CHECK_STRING_BYTES */
1857 #ifdef GC_CHECK_STRING_FREE_LIST
1859 /* Walk through the string free list looking for bogus next pointers.
1860 This may catch buffer overrun from a previous string. */
1863 check_string_free_list ()
1865 struct Lisp_String
*s
;
1867 /* Pop a Lisp_String off the free-list. */
1868 s
= string_free_list
;
1871 if ((unsigned)s
< 1024)
1873 s
= NEXT_FREE_LISP_STRING (s
);
1877 #define check_string_free_list()
1880 /* Return a new Lisp_String. */
1882 static struct Lisp_String
*
1885 struct Lisp_String
*s
;
1887 /* eassert (!handling_signal); */
1891 /* If the free-list is empty, allocate a new string_block, and
1892 add all the Lisp_Strings in it to the free-list. */
1893 if (string_free_list
== NULL
)
1895 struct string_block
*b
;
1898 b
= (struct string_block
*) lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1899 bzero (b
, sizeof *b
);
1900 b
->next
= string_blocks
;
1904 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1907 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1908 string_free_list
= s
;
1911 total_free_strings
+= STRING_BLOCK_SIZE
;
1914 check_string_free_list ();
1916 /* Pop a Lisp_String off the free-list. */
1917 s
= string_free_list
;
1918 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1920 MALLOC_UNBLOCK_INPUT
;
1922 /* Probably not strictly necessary, but play it safe. */
1923 bzero (s
, sizeof *s
);
1925 --total_free_strings
;
1928 consing_since_gc
+= sizeof *s
;
1930 #ifdef GC_CHECK_STRING_BYTES
1931 if (!noninteractive
)
1933 if (++check_string_bytes_count
== 200)
1935 check_string_bytes_count
= 0;
1936 check_string_bytes (1);
1939 check_string_bytes (0);
1941 #endif /* GC_CHECK_STRING_BYTES */
1947 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1948 plus a NUL byte at the end. Allocate an sdata structure for S, and
1949 set S->data to its `u.data' member. Store a NUL byte at the end of
1950 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1951 S->data if it was initially non-null. */
1954 allocate_string_data (s
, nchars
, nbytes
)
1955 struct Lisp_String
*s
;
1958 struct sdata
*data
, *old_data
;
1960 int needed
, old_nbytes
;
1962 /* Determine the number of bytes needed to store NBYTES bytes
1964 needed
= SDATA_SIZE (nbytes
);
1965 old_data
= s
->data
? SDATA_OF_STRING (s
) : NULL
;
1966 old_nbytes
= GC_STRING_BYTES (s
);
1970 if (nbytes
> LARGE_STRING_BYTES
)
1972 size_t size
= sizeof *b
- sizeof (struct sdata
) + needed
;
1974 #ifdef DOUG_LEA_MALLOC
1975 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1976 because mapped region contents are not preserved in
1979 In case you think of allowing it in a dumped Emacs at the
1980 cost of not being able to re-dump, there's another reason:
1981 mmap'ed data typically have an address towards the top of the
1982 address space, which won't fit into an EMACS_INT (at least on
1983 32-bit systems with the current tagging scheme). --fx */
1984 mallopt (M_MMAP_MAX
, 0);
1987 b
= (struct sblock
*) lisp_malloc (size
+ GC_STRING_EXTRA
, MEM_TYPE_NON_LISP
);
1989 #ifdef DOUG_LEA_MALLOC
1990 /* Back to a reasonable maximum of mmap'ed areas. */
1991 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1994 b
->next_free
= &b
->first_data
;
1995 b
->first_data
.string
= NULL
;
1996 b
->next
= large_sblocks
;
1999 else if (current_sblock
== NULL
2000 || (((char *) current_sblock
+ SBLOCK_SIZE
2001 - (char *) current_sblock
->next_free
)
2002 < (needed
+ GC_STRING_EXTRA
)))
2004 /* Not enough room in the current sblock. */
2005 b
= (struct sblock
*) lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
2006 b
->next_free
= &b
->first_data
;
2007 b
->first_data
.string
= NULL
;
2011 current_sblock
->next
= b
;
2019 data
= b
->next_free
;
2020 b
->next_free
= (struct sdata
*) ((char *) data
+ needed
+ GC_STRING_EXTRA
);
2022 MALLOC_UNBLOCK_INPUT
;
2025 s
->data
= SDATA_DATA (data
);
2026 #ifdef GC_CHECK_STRING_BYTES
2027 SDATA_NBYTES (data
) = nbytes
;
2030 s
->size_byte
= nbytes
;
2031 s
->data
[nbytes
] = '\0';
2032 #ifdef GC_CHECK_STRING_OVERRUN
2033 bcopy (string_overrun_cookie
, (char *) data
+ needed
,
2034 GC_STRING_OVERRUN_COOKIE_SIZE
);
2037 /* If S had already data assigned, mark that as free by setting its
2038 string back-pointer to null, and recording the size of the data
2042 SDATA_NBYTES (old_data
) = old_nbytes
;
2043 old_data
->string
= NULL
;
2046 consing_since_gc
+= needed
;
2050 /* Sweep and compact strings. */
2055 struct string_block
*b
, *next
;
2056 struct string_block
*live_blocks
= NULL
;
2058 string_free_list
= NULL
;
2059 total_strings
= total_free_strings
= 0;
2060 total_string_size
= 0;
2062 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
2063 for (b
= string_blocks
; b
; b
= next
)
2066 struct Lisp_String
*free_list_before
= string_free_list
;
2070 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
2072 struct Lisp_String
*s
= b
->strings
+ i
;
2076 /* String was not on free-list before. */
2077 if (STRING_MARKED_P (s
))
2079 /* String is live; unmark it and its intervals. */
2082 if (!NULL_INTERVAL_P (s
->intervals
))
2083 UNMARK_BALANCE_INTERVALS (s
->intervals
);
2086 total_string_size
+= STRING_BYTES (s
);
2090 /* String is dead. Put it on the free-list. */
2091 struct sdata
*data
= SDATA_OF_STRING (s
);
2093 /* Save the size of S in its sdata so that we know
2094 how large that is. Reset the sdata's string
2095 back-pointer so that we know it's free. */
2096 #ifdef GC_CHECK_STRING_BYTES
2097 if (GC_STRING_BYTES (s
) != SDATA_NBYTES (data
))
2100 data
->u
.nbytes
= GC_STRING_BYTES (s
);
2102 data
->string
= NULL
;
2104 /* Reset the strings's `data' member so that we
2108 /* Put the string on the free-list. */
2109 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2110 string_free_list
= s
;
2116 /* S was on the free-list before. Put it there again. */
2117 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2118 string_free_list
= s
;
2123 /* Free blocks that contain free Lisp_Strings only, except
2124 the first two of them. */
2125 if (nfree
== STRING_BLOCK_SIZE
2126 && total_free_strings
> STRING_BLOCK_SIZE
)
2130 string_free_list
= free_list_before
;
2134 total_free_strings
+= nfree
;
2135 b
->next
= live_blocks
;
2140 check_string_free_list ();
2142 string_blocks
= live_blocks
;
2143 free_large_strings ();
2144 compact_small_strings ();
2146 check_string_free_list ();
2150 /* Free dead large strings. */
2153 free_large_strings ()
2155 struct sblock
*b
, *next
;
2156 struct sblock
*live_blocks
= NULL
;
2158 for (b
= large_sblocks
; b
; b
= next
)
2162 if (b
->first_data
.string
== NULL
)
2166 b
->next
= live_blocks
;
2171 large_sblocks
= live_blocks
;
2175 /* Compact data of small strings. Free sblocks that don't contain
2176 data of live strings after compaction. */
2179 compact_small_strings ()
2181 struct sblock
*b
, *tb
, *next
;
2182 struct sdata
*from
, *to
, *end
, *tb_end
;
2183 struct sdata
*to_end
, *from_end
;
2185 /* TB is the sblock we copy to, TO is the sdata within TB we copy
2186 to, and TB_END is the end of TB. */
2188 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2189 to
= &tb
->first_data
;
2191 /* Step through the blocks from the oldest to the youngest. We
2192 expect that old blocks will stabilize over time, so that less
2193 copying will happen this way. */
2194 for (b
= oldest_sblock
; b
; b
= b
->next
)
2197 xassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
2199 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
2201 /* Compute the next FROM here because copying below may
2202 overwrite data we need to compute it. */
2205 #ifdef GC_CHECK_STRING_BYTES
2206 /* Check that the string size recorded in the string is the
2207 same as the one recorded in the sdata structure. */
2209 && GC_STRING_BYTES (from
->string
) != SDATA_NBYTES (from
))
2211 #endif /* GC_CHECK_STRING_BYTES */
2214 nbytes
= GC_STRING_BYTES (from
->string
);
2216 nbytes
= SDATA_NBYTES (from
);
2218 if (nbytes
> LARGE_STRING_BYTES
)
2221 nbytes
= SDATA_SIZE (nbytes
);
2222 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
2224 #ifdef GC_CHECK_STRING_OVERRUN
2225 if (bcmp (string_overrun_cookie
,
2226 ((char *) from_end
) - GC_STRING_OVERRUN_COOKIE_SIZE
,
2227 GC_STRING_OVERRUN_COOKIE_SIZE
))
2231 /* FROM->string non-null means it's alive. Copy its data. */
2234 /* If TB is full, proceed with the next sblock. */
2235 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2236 if (to_end
> tb_end
)
2240 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2241 to
= &tb
->first_data
;
2242 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2245 /* Copy, and update the string's `data' pointer. */
2248 xassert (tb
!= b
|| to
<= from
);
2249 safe_bcopy ((char *) from
, (char *) to
, nbytes
+ GC_STRING_EXTRA
);
2250 to
->string
->data
= SDATA_DATA (to
);
2253 /* Advance past the sdata we copied to. */
2259 /* The rest of the sblocks following TB don't contain live data, so
2260 we can free them. */
2261 for (b
= tb
->next
; b
; b
= next
)
2269 current_sblock
= tb
;
2273 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
2274 doc
: /* Return a newly created string of length LENGTH, with INIT in each element.
2275 LENGTH must be an integer.
2276 INIT must be an integer that represents a character. */)
2278 Lisp_Object length
, init
;
2280 register Lisp_Object val
;
2281 register unsigned char *p
, *end
;
2284 CHECK_NATNUM (length
);
2285 CHECK_NUMBER (init
);
2288 if (SINGLE_BYTE_CHAR_P (c
))
2290 nbytes
= XINT (length
);
2291 val
= make_uninit_string (nbytes
);
2293 end
= p
+ SCHARS (val
);
2299 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
2300 int len
= CHAR_STRING (c
, str
);
2302 nbytes
= len
* XINT (length
);
2303 val
= make_uninit_multibyte_string (XINT (length
), nbytes
);
2308 bcopy (str
, p
, len
);
2318 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
2319 doc
: /* Return a new bool-vector of length LENGTH, using INIT for each element.
2320 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
2322 Lisp_Object length
, init
;
2324 register Lisp_Object val
;
2325 struct Lisp_Bool_Vector
*p
;
2327 int length_in_chars
, length_in_elts
, bits_per_value
;
2329 CHECK_NATNUM (length
);
2331 bits_per_value
= sizeof (EMACS_INT
) * BOOL_VECTOR_BITS_PER_CHAR
;
2333 length_in_elts
= (XFASTINT (length
) + bits_per_value
- 1) / bits_per_value
;
2334 length_in_chars
= ((XFASTINT (length
) + BOOL_VECTOR_BITS_PER_CHAR
- 1)
2335 / BOOL_VECTOR_BITS_PER_CHAR
);
2337 /* We must allocate one more elements than LENGTH_IN_ELTS for the
2338 slot `size' of the struct Lisp_Bool_Vector. */
2339 val
= Fmake_vector (make_number (length_in_elts
+ 1), Qnil
);
2341 /* Get rid of any bits that would cause confusion. */
2342 XVECTOR (val
)->size
= 0; /* No Lisp_Object to trace in there. */
2343 /* Use XVECTOR (val) rather than `p' because p->size is not TRT. */
2344 XSETPVECTYPE (XVECTOR (val
), PVEC_BOOL_VECTOR
);
2346 p
= XBOOL_VECTOR (val
);
2347 p
->size
= XFASTINT (length
);
2349 real_init
= (NILP (init
) ? 0 : -1);
2350 for (i
= 0; i
< length_in_chars
; i
++)
2351 p
->data
[i
] = real_init
;
2353 /* Clear the extraneous bits in the last byte. */
2354 if (XINT (length
) != length_in_chars
* BOOL_VECTOR_BITS_PER_CHAR
)
2355 p
->data
[length_in_chars
- 1]
2356 &= (1 << (XINT (length
) % BOOL_VECTOR_BITS_PER_CHAR
)) - 1;
2362 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
2363 of characters from the contents. This string may be unibyte or
2364 multibyte, depending on the contents. */
2367 make_string (contents
, nbytes
)
2368 const char *contents
;
2371 register Lisp_Object val
;
2372 int nchars
, multibyte_nbytes
;
2374 parse_str_as_multibyte (contents
, nbytes
, &nchars
, &multibyte_nbytes
);
2375 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
2376 /* CONTENTS contains no multibyte sequences or contains an invalid
2377 multibyte sequence. We must make unibyte string. */
2378 val
= make_unibyte_string (contents
, nbytes
);
2380 val
= make_multibyte_string (contents
, nchars
, nbytes
);
2385 /* Make an unibyte string from LENGTH bytes at CONTENTS. */
2388 make_unibyte_string (contents
, length
)
2389 const char *contents
;
2392 register Lisp_Object val
;
2393 val
= make_uninit_string (length
);
2394 bcopy (contents
, SDATA (val
), length
);
2395 STRING_SET_UNIBYTE (val
);
2400 /* Make a multibyte string from NCHARS characters occupying NBYTES
2401 bytes at CONTENTS. */
2404 make_multibyte_string (contents
, nchars
, nbytes
)
2405 const char *contents
;
2408 register Lisp_Object val
;
2409 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2410 bcopy (contents
, SDATA (val
), nbytes
);
2415 /* Make a string from NCHARS characters occupying NBYTES bytes at
2416 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2419 make_string_from_bytes (contents
, nchars
, nbytes
)
2420 const char *contents
;
2423 register Lisp_Object val
;
2424 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2425 bcopy (contents
, SDATA (val
), nbytes
);
2426 if (SBYTES (val
) == SCHARS (val
))
2427 STRING_SET_UNIBYTE (val
);
2432 /* Make a string from NCHARS characters occupying NBYTES bytes at
2433 CONTENTS. The argument MULTIBYTE controls whether to label the
2434 string as multibyte. If NCHARS is negative, it counts the number of
2435 characters by itself. */
2438 make_specified_string (contents
, nchars
, nbytes
, multibyte
)
2439 const char *contents
;
2443 register Lisp_Object val
;
2448 nchars
= multibyte_chars_in_text (contents
, nbytes
);
2452 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2453 bcopy (contents
, SDATA (val
), nbytes
);
2455 STRING_SET_UNIBYTE (val
);
2460 /* Make a string from the data at STR, treating it as multibyte if the
2467 return make_string (str
, strlen (str
));
2471 /* Return an unibyte Lisp_String set up to hold LENGTH characters
2472 occupying LENGTH bytes. */
2475 make_uninit_string (length
)
2481 return empty_unibyte_string
;
2482 val
= make_uninit_multibyte_string (length
, length
);
2483 STRING_SET_UNIBYTE (val
);
2488 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2489 which occupy NBYTES bytes. */
2492 make_uninit_multibyte_string (nchars
, nbytes
)
2496 struct Lisp_String
*s
;
2501 return empty_multibyte_string
;
2503 s
= allocate_string ();
2504 allocate_string_data (s
, nchars
, nbytes
);
2505 XSETSTRING (string
, s
);
2506 string_chars_consed
+= nbytes
;
2512 /***********************************************************************
2514 ***********************************************************************/
2516 /* We store float cells inside of float_blocks, allocating a new
2517 float_block with malloc whenever necessary. Float cells reclaimed
2518 by GC are put on a free list to be reallocated before allocating
2519 any new float cells from the latest float_block. */
2521 #define FLOAT_BLOCK_SIZE \
2522 (((BLOCK_BYTES - sizeof (struct float_block *) \
2523 /* The compiler might add padding at the end. */ \
2524 - (sizeof (struct Lisp_Float) - sizeof (int))) * CHAR_BIT) \
2525 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2527 #define GETMARKBIT(block,n) \
2528 (((block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2529 >> ((n) % (sizeof(int) * CHAR_BIT))) \
2532 #define SETMARKBIT(block,n) \
2533 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2534 |= 1 << ((n) % (sizeof(int) * CHAR_BIT))
2536 #define UNSETMARKBIT(block,n) \
2537 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2538 &= ~(1 << ((n) % (sizeof(int) * CHAR_BIT)))
2540 #define FLOAT_BLOCK(fptr) \
2541 ((struct float_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2543 #define FLOAT_INDEX(fptr) \
2544 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2548 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2549 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2550 int gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2551 struct float_block
*next
;
2554 #define FLOAT_MARKED_P(fptr) \
2555 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2557 #define FLOAT_MARK(fptr) \
2558 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2560 #define FLOAT_UNMARK(fptr) \
2561 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2563 /* Current float_block. */
2565 struct float_block
*float_block
;
2567 /* Index of first unused Lisp_Float in the current float_block. */
2569 int float_block_index
;
2571 /* Total number of float blocks now in use. */
2575 /* Free-list of Lisp_Floats. */
2577 struct Lisp_Float
*float_free_list
;
2580 /* Initialize float allocation. */
2586 float_block_index
= FLOAT_BLOCK_SIZE
; /* Force alloc of new float_block. */
2587 float_free_list
= 0;
2592 /* Explicitly free a float cell by putting it on the free-list. */
2596 struct Lisp_Float
*ptr
;
2598 ptr
->u
.chain
= float_free_list
;
2599 float_free_list
= ptr
;
2603 /* Return a new float object with value FLOAT_VALUE. */
2606 make_float (float_value
)
2609 register Lisp_Object val
;
2611 /* eassert (!handling_signal); */
2615 if (float_free_list
)
2617 /* We use the data field for chaining the free list
2618 so that we won't use the same field that has the mark bit. */
2619 XSETFLOAT (val
, float_free_list
);
2620 float_free_list
= float_free_list
->u
.chain
;
2624 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2626 register struct float_block
*new;
2628 new = (struct float_block
*) lisp_align_malloc (sizeof *new,
2630 new->next
= float_block
;
2631 bzero ((char *) new->gcmarkbits
, sizeof new->gcmarkbits
);
2633 float_block_index
= 0;
2636 XSETFLOAT (val
, &float_block
->floats
[float_block_index
]);
2637 float_block_index
++;
2640 MALLOC_UNBLOCK_INPUT
;
2642 XFLOAT_DATA (val
) = float_value
;
2643 eassert (!FLOAT_MARKED_P (XFLOAT (val
)));
2644 consing_since_gc
+= sizeof (struct Lisp_Float
);
2651 /***********************************************************************
2653 ***********************************************************************/
2655 /* We store cons cells inside of cons_blocks, allocating a new
2656 cons_block with malloc whenever necessary. Cons cells reclaimed by
2657 GC are put on a free list to be reallocated before allocating
2658 any new cons cells from the latest cons_block. */
2660 #define CONS_BLOCK_SIZE \
2661 (((BLOCK_BYTES - sizeof (struct cons_block *)) * CHAR_BIT) \
2662 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2664 #define CONS_BLOCK(fptr) \
2665 ((struct cons_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2667 #define CONS_INDEX(fptr) \
2668 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2672 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2673 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2674 int gcmarkbits
[1 + CONS_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2675 struct cons_block
*next
;
2678 #define CONS_MARKED_P(fptr) \
2679 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2681 #define CONS_MARK(fptr) \
2682 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2684 #define CONS_UNMARK(fptr) \
2685 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2687 /* Current cons_block. */
2689 struct cons_block
*cons_block
;
2691 /* Index of first unused Lisp_Cons in the current block. */
2693 int cons_block_index
;
2695 /* Free-list of Lisp_Cons structures. */
2697 struct Lisp_Cons
*cons_free_list
;
2699 /* Total number of cons blocks now in use. */
2701 static int n_cons_blocks
;
2704 /* Initialize cons allocation. */
2710 cons_block_index
= CONS_BLOCK_SIZE
; /* Force alloc of new cons_block. */
2716 /* Explicitly free a cons cell by putting it on the free-list. */
2720 struct Lisp_Cons
*ptr
;
2722 ptr
->u
.chain
= cons_free_list
;
2726 cons_free_list
= ptr
;
2729 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
2730 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2732 Lisp_Object car
, cdr
;
2734 register Lisp_Object val
;
2736 /* eassert (!handling_signal); */
2742 /* We use the cdr for chaining the free list
2743 so that we won't use the same field that has the mark bit. */
2744 XSETCONS (val
, cons_free_list
);
2745 cons_free_list
= cons_free_list
->u
.chain
;
2749 if (cons_block_index
== CONS_BLOCK_SIZE
)
2751 register struct cons_block
*new;
2752 new = (struct cons_block
*) lisp_align_malloc (sizeof *new,
2754 bzero ((char *) new->gcmarkbits
, sizeof new->gcmarkbits
);
2755 new->next
= cons_block
;
2757 cons_block_index
= 0;
2760 XSETCONS (val
, &cons_block
->conses
[cons_block_index
]);
2764 MALLOC_UNBLOCK_INPUT
;
2768 eassert (!CONS_MARKED_P (XCONS (val
)));
2769 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2770 cons_cells_consed
++;
2774 /* Get an error now if there's any junk in the cons free list. */
2778 #ifdef GC_CHECK_CONS_LIST
2779 struct Lisp_Cons
*tail
= cons_free_list
;
2782 tail
= tail
->u
.chain
;
2786 /* Make a list of 1, 2, 3, 4 or 5 specified objects. */
2792 return Fcons (arg1
, Qnil
);
2797 Lisp_Object arg1
, arg2
;
2799 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2804 list3 (arg1
, arg2
, arg3
)
2805 Lisp_Object arg1
, arg2
, arg3
;
2807 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2812 list4 (arg1
, arg2
, arg3
, arg4
)
2813 Lisp_Object arg1
, arg2
, arg3
, arg4
;
2815 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2820 list5 (arg1
, arg2
, arg3
, arg4
, arg5
)
2821 Lisp_Object arg1
, arg2
, arg3
, arg4
, arg5
;
2823 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2824 Fcons (arg5
, Qnil
)))));
2828 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
2829 doc
: /* Return a newly created list with specified arguments as elements.
2830 Any number of arguments, even zero arguments, are allowed.
2831 usage: (list &rest OBJECTS) */)
2834 register Lisp_Object
*args
;
2836 register Lisp_Object val
;
2842 val
= Fcons (args
[nargs
], val
);
2848 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2849 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2851 register Lisp_Object length
, init
;
2853 register Lisp_Object val
;
2856 CHECK_NATNUM (length
);
2857 size
= XFASTINT (length
);
2862 val
= Fcons (init
, val
);
2867 val
= Fcons (init
, val
);
2872 val
= Fcons (init
, val
);
2877 val
= Fcons (init
, val
);
2882 val
= Fcons (init
, val
);
2897 /***********************************************************************
2899 ***********************************************************************/
2901 /* Singly-linked list of all vectors. */
2903 static struct Lisp_Vector
*all_vectors
;
2905 /* Total number of vector-like objects now in use. */
2907 static int n_vectors
;
2910 /* Value is a pointer to a newly allocated Lisp_Vector structure
2911 with room for LEN Lisp_Objects. */
2913 static struct Lisp_Vector
*
2914 allocate_vectorlike (len
)
2917 struct Lisp_Vector
*p
;
2922 #ifdef DOUG_LEA_MALLOC
2923 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
2924 because mapped region contents are not preserved in
2926 mallopt (M_MMAP_MAX
, 0);
2929 /* This gets triggered by code which I haven't bothered to fix. --Stef */
2930 /* eassert (!handling_signal); */
2932 nbytes
= sizeof *p
+ (len
- 1) * sizeof p
->contents
[0];
2933 p
= (struct Lisp_Vector
*) lisp_malloc (nbytes
, MEM_TYPE_VECTORLIKE
);
2935 #ifdef DOUG_LEA_MALLOC
2936 /* Back to a reasonable maximum of mmap'ed areas. */
2937 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2940 consing_since_gc
+= nbytes
;
2941 vector_cells_consed
+= len
;
2943 p
->next
= all_vectors
;
2946 MALLOC_UNBLOCK_INPUT
;
2953 /* Allocate a vector with NSLOTS slots. */
2955 struct Lisp_Vector
*
2956 allocate_vector (nslots
)
2959 struct Lisp_Vector
*v
= allocate_vectorlike (nslots
);
2965 /* Allocate other vector-like structures. */
2967 struct Lisp_Vector
*
2968 allocate_pseudovector (memlen
, lisplen
, tag
)
2969 int memlen
, lisplen
;
2972 struct Lisp_Vector
*v
= allocate_vectorlike (memlen
);
2975 /* Only the first lisplen slots will be traced normally by the GC. */
2977 for (i
= 0; i
< lisplen
; ++i
)
2978 v
->contents
[i
] = Qnil
;
2980 XSETPVECTYPE (v
, tag
); /* Add the appropriate tag. */
2984 struct Lisp_Hash_Table
*
2985 allocate_hash_table (void)
2987 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Hash_Table
, count
, PVEC_HASH_TABLE
);
2994 return ALLOCATE_PSEUDOVECTOR(struct window
, current_matrix
, PVEC_WINDOW
);
2999 allocate_terminal ()
3001 struct terminal
*t
= ALLOCATE_PSEUDOVECTOR (struct terminal
,
3002 next_terminal
, PVEC_TERMINAL
);
3003 /* Zero out the non-GC'd fields. FIXME: This should be made unnecessary. */
3004 bzero (&(t
->next_terminal
),
3005 ((char*)(t
+1)) - ((char*)&(t
->next_terminal
)));
3013 struct frame
*f
= ALLOCATE_PSEUDOVECTOR (struct frame
,
3014 face_cache
, PVEC_FRAME
);
3015 /* Zero out the non-GC'd fields. FIXME: This should be made unnecessary. */
3016 bzero (&(f
->face_cache
),
3017 ((char*)(f
+1)) - ((char*)&(f
->face_cache
)));
3022 struct Lisp_Process
*
3025 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Process
, pid
, PVEC_PROCESS
);
3029 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
3030 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
3031 See also the function `vector'. */)
3033 register Lisp_Object length
, init
;
3036 register EMACS_INT sizei
;
3038 register struct Lisp_Vector
*p
;
3040 CHECK_NATNUM (length
);
3041 sizei
= XFASTINT (length
);
3043 p
= allocate_vector (sizei
);
3044 for (index
= 0; index
< sizei
; index
++)
3045 p
->contents
[index
] = init
;
3047 XSETVECTOR (vector
, p
);
3052 DEFUN ("make-char-table", Fmake_char_table
, Smake_char_table
, 1, 2, 0,
3053 doc
: /* Return a newly created char-table, with purpose PURPOSE.
3054 Each element is initialized to INIT, which defaults to nil.
3055 PURPOSE should be a symbol which has a `char-table-extra-slots' property.
3056 The property's value should be an integer between 0 and 10. */)
3058 register Lisp_Object purpose
, init
;
3062 CHECK_SYMBOL (purpose
);
3063 n
= Fget (purpose
, Qchar_table_extra_slots
);
3065 if (XINT (n
) < 0 || XINT (n
) > 10)
3066 args_out_of_range (n
, Qnil
);
3067 /* Add 2 to the size for the defalt and parent slots. */
3068 vector
= Fmake_vector (make_number (CHAR_TABLE_STANDARD_SLOTS
+ XINT (n
)),
3070 XSETPVECTYPE (XVECTOR (vector
), PVEC_CHAR_TABLE
);
3071 XCHAR_TABLE (vector
)->top
= Qt
;
3072 XCHAR_TABLE (vector
)->parent
= Qnil
;
3073 XCHAR_TABLE (vector
)->purpose
= purpose
;
3074 XSETCHAR_TABLE (vector
, XCHAR_TABLE (vector
));
3079 /* Return a newly created sub char table with slots initialized by INIT.
3080 Since a sub char table does not appear as a top level Emacs Lisp
3081 object, we don't need a Lisp interface to make it. */
3084 make_sub_char_table (init
)
3088 = Fmake_vector (make_number (SUB_CHAR_TABLE_STANDARD_SLOTS
), init
);
3089 XSETPVECTYPE (XVECTOR (vector
), PVEC_CHAR_TABLE
);
3090 XCHAR_TABLE (vector
)->top
= Qnil
;
3091 XCHAR_TABLE (vector
)->defalt
= Qnil
;
3092 XSETCHAR_TABLE (vector
, XCHAR_TABLE (vector
));
3097 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
3098 doc
: /* Return a newly created vector with specified arguments as elements.
3099 Any number of arguments, even zero arguments, are allowed.
3100 usage: (vector &rest OBJECTS) */)
3105 register Lisp_Object len
, val
;
3107 register struct Lisp_Vector
*p
;
3109 XSETFASTINT (len
, nargs
);
3110 val
= Fmake_vector (len
, Qnil
);
3112 for (index
= 0; index
< nargs
; index
++)
3113 p
->contents
[index
] = args
[index
];
3118 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
3119 doc
: /* Create a byte-code object with specified arguments as elements.
3120 The arguments should be the arglist, bytecode-string, constant vector,
3121 stack size, (optional) doc string, and (optional) interactive spec.
3122 The first four arguments are required; at most six have any
3124 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
3129 register Lisp_Object len
, val
;
3131 register struct Lisp_Vector
*p
;
3133 XSETFASTINT (len
, nargs
);
3134 if (!NILP (Vpurify_flag
))
3135 val
= make_pure_vector ((EMACS_INT
) nargs
);
3137 val
= Fmake_vector (len
, Qnil
);
3139 if (STRINGP (args
[1]) && STRING_MULTIBYTE (args
[1]))
3140 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
3141 earlier because they produced a raw 8-bit string for byte-code
3142 and now such a byte-code string is loaded as multibyte while
3143 raw 8-bit characters converted to multibyte form. Thus, now we
3144 must convert them back to the original unibyte form. */
3145 args
[1] = Fstring_as_unibyte (args
[1]);
3148 for (index
= 0; index
< nargs
; index
++)
3150 if (!NILP (Vpurify_flag
))
3151 args
[index
] = Fpurecopy (args
[index
]);
3152 p
->contents
[index
] = args
[index
];
3154 XSETPVECTYPE (p
, PVEC_COMPILED
);
3155 XSETCOMPILED (val
, p
);
3161 /***********************************************************************
3163 ***********************************************************************/
3165 /* Each symbol_block is just under 1020 bytes long, since malloc
3166 really allocates in units of powers of two and uses 4 bytes for its
3169 #define SYMBOL_BLOCK_SIZE \
3170 ((1020 - sizeof (struct symbol_block *)) / sizeof (struct Lisp_Symbol))
3174 /* Place `symbols' first, to preserve alignment. */
3175 struct Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
3176 struct symbol_block
*next
;
3179 /* Current symbol block and index of first unused Lisp_Symbol
3182 static struct symbol_block
*symbol_block
;
3183 static int symbol_block_index
;
3185 /* List of free symbols. */
3187 static struct Lisp_Symbol
*symbol_free_list
;
3189 /* Total number of symbol blocks now in use. */
3191 static int n_symbol_blocks
;
3194 /* Initialize symbol allocation. */
3199 symbol_block
= NULL
;
3200 symbol_block_index
= SYMBOL_BLOCK_SIZE
;
3201 symbol_free_list
= 0;
3202 n_symbol_blocks
= 0;
3206 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
3207 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
3208 Its value and function definition are void, and its property list is nil. */)
3212 register Lisp_Object val
;
3213 register struct Lisp_Symbol
*p
;
3215 CHECK_STRING (name
);
3217 /* eassert (!handling_signal); */
3221 if (symbol_free_list
)
3223 XSETSYMBOL (val
, symbol_free_list
);
3224 symbol_free_list
= symbol_free_list
->next
;
3228 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
3230 struct symbol_block
*new;
3231 new = (struct symbol_block
*) lisp_malloc (sizeof *new,
3233 new->next
= symbol_block
;
3235 symbol_block_index
= 0;
3238 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
]);
3239 symbol_block_index
++;
3242 MALLOC_UNBLOCK_INPUT
;
3247 p
->value
= Qunbound
;
3248 p
->function
= Qunbound
;
3251 p
->interned
= SYMBOL_UNINTERNED
;
3253 p
->indirect_variable
= 0;
3254 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
3261 /***********************************************************************
3262 Marker (Misc) Allocation
3263 ***********************************************************************/
3265 /* Allocation of markers and other objects that share that structure.
3266 Works like allocation of conses. */
3268 #define MARKER_BLOCK_SIZE \
3269 ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc))
3273 /* Place `markers' first, to preserve alignment. */
3274 union Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
3275 struct marker_block
*next
;
3278 static struct marker_block
*marker_block
;
3279 static int marker_block_index
;
3281 static union Lisp_Misc
*marker_free_list
;
3283 /* Total number of marker blocks now in use. */
3285 static int n_marker_blocks
;
3290 marker_block
= NULL
;
3291 marker_block_index
= MARKER_BLOCK_SIZE
;
3292 marker_free_list
= 0;
3293 n_marker_blocks
= 0;
3296 /* Return a newly allocated Lisp_Misc object, with no substructure. */
3303 /* eassert (!handling_signal); */
3307 if (marker_free_list
)
3309 XSETMISC (val
, marker_free_list
);
3310 marker_free_list
= marker_free_list
->u_free
.chain
;
3314 if (marker_block_index
== MARKER_BLOCK_SIZE
)
3316 struct marker_block
*new;
3317 new = (struct marker_block
*) lisp_malloc (sizeof *new,
3319 new->next
= marker_block
;
3321 marker_block_index
= 0;
3323 total_free_markers
+= MARKER_BLOCK_SIZE
;
3325 XSETMISC (val
, &marker_block
->markers
[marker_block_index
]);
3326 marker_block_index
++;
3329 MALLOC_UNBLOCK_INPUT
;
3331 --total_free_markers
;
3332 consing_since_gc
+= sizeof (union Lisp_Misc
);
3333 misc_objects_consed
++;
3334 XMISCANY (val
)->gcmarkbit
= 0;
3338 /* Free a Lisp_Misc object */
3344 XMISCTYPE (misc
) = Lisp_Misc_Free
;
3345 XMISC (misc
)->u_free
.chain
= marker_free_list
;
3346 marker_free_list
= XMISC (misc
);
3348 total_free_markers
++;
3351 /* Return a Lisp_Misc_Save_Value object containing POINTER and
3352 INTEGER. This is used to package C values to call record_unwind_protect.
3353 The unwind function can get the C values back using XSAVE_VALUE. */
3356 make_save_value (pointer
, integer
)
3360 register Lisp_Object val
;
3361 register struct Lisp_Save_Value
*p
;
3363 val
= allocate_misc ();
3364 XMISCTYPE (val
) = Lisp_Misc_Save_Value
;
3365 p
= XSAVE_VALUE (val
);
3366 p
->pointer
= pointer
;
3367 p
->integer
= integer
;
3372 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
3373 doc
: /* Return a newly allocated marker which does not point at any place. */)
3376 register Lisp_Object val
;
3377 register struct Lisp_Marker
*p
;
3379 val
= allocate_misc ();
3380 XMISCTYPE (val
) = Lisp_Misc_Marker
;
3386 p
->insertion_type
= 0;
3390 /* Put MARKER back on the free list after using it temporarily. */
3393 free_marker (marker
)
3396 unchain_marker (XMARKER (marker
));
3401 /* Return a newly created vector or string with specified arguments as
3402 elements. If all the arguments are characters that can fit
3403 in a string of events, make a string; otherwise, make a vector.
3405 Any number of arguments, even zero arguments, are allowed. */
3408 make_event_array (nargs
, args
)
3414 for (i
= 0; i
< nargs
; i
++)
3415 /* The things that fit in a string
3416 are characters that are in 0...127,
3417 after discarding the meta bit and all the bits above it. */
3418 if (!INTEGERP (args
[i
])
3419 || (XUINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
3420 return Fvector (nargs
, args
);
3422 /* Since the loop exited, we know that all the things in it are
3423 characters, so we can make a string. */
3427 result
= Fmake_string (make_number (nargs
), make_number (0));
3428 for (i
= 0; i
< nargs
; i
++)
3430 SSET (result
, i
, XINT (args
[i
]));
3431 /* Move the meta bit to the right place for a string char. */
3432 if (XINT (args
[i
]) & CHAR_META
)
3433 SSET (result
, i
, SREF (result
, i
) | 0x80);
3442 /************************************************************************
3443 Memory Full Handling
3444 ************************************************************************/
3447 /* Called if malloc returns zero. */
3456 memory_full_cons_threshold
= sizeof (struct cons_block
);
3458 /* The first time we get here, free the spare memory. */
3459 for (i
= 0; i
< sizeof (spare_memory
) / sizeof (char *); i
++)
3460 if (spare_memory
[i
])
3463 free (spare_memory
[i
]);
3464 else if (i
>= 1 && i
<= 4)
3465 lisp_align_free (spare_memory
[i
]);
3467 lisp_free (spare_memory
[i
]);
3468 spare_memory
[i
] = 0;
3471 /* Record the space now used. When it decreases substantially,
3472 we can refill the memory reserve. */
3473 #ifndef SYSTEM_MALLOC
3474 bytes_used_when_full
= BYTES_USED
;
3477 /* This used to call error, but if we've run out of memory, we could
3478 get infinite recursion trying to build the string. */
3479 xsignal (Qnil
, Vmemory_signal_data
);
3482 /* If we released our reserve (due to running out of memory),
3483 and we have a fair amount free once again,
3484 try to set aside another reserve in case we run out once more.
3486 This is called when a relocatable block is freed in ralloc.c,
3487 and also directly from this file, in case we're not using ralloc.c. */
3490 refill_memory_reserve ()
3492 #ifndef SYSTEM_MALLOC
3493 if (spare_memory
[0] == 0)
3494 spare_memory
[0] = (char *) malloc ((size_t) SPARE_MEMORY
);
3495 if (spare_memory
[1] == 0)
3496 spare_memory
[1] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3498 if (spare_memory
[2] == 0)
3499 spare_memory
[2] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3501 if (spare_memory
[3] == 0)
3502 spare_memory
[3] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3504 if (spare_memory
[4] == 0)
3505 spare_memory
[4] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3507 if (spare_memory
[5] == 0)
3508 spare_memory
[5] = (char *) lisp_malloc (sizeof (struct string_block
),
3510 if (spare_memory
[6] == 0)
3511 spare_memory
[6] = (char *) lisp_malloc (sizeof (struct string_block
),
3513 if (spare_memory
[0] && spare_memory
[1] && spare_memory
[5])
3514 Vmemory_full
= Qnil
;
3518 /************************************************************************
3520 ************************************************************************/
3522 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
3524 /* Conservative C stack marking requires a method to identify possibly
3525 live Lisp objects given a pointer value. We do this by keeping
3526 track of blocks of Lisp data that are allocated in a red-black tree
3527 (see also the comment of mem_node which is the type of nodes in
3528 that tree). Function lisp_malloc adds information for an allocated
3529 block to the red-black tree with calls to mem_insert, and function
3530 lisp_free removes it with mem_delete. Functions live_string_p etc
3531 call mem_find to lookup information about a given pointer in the
3532 tree, and use that to determine if the pointer points to a Lisp
3535 /* Initialize this part of alloc.c. */
3540 mem_z
.left
= mem_z
.right
= MEM_NIL
;
3541 mem_z
.parent
= NULL
;
3542 mem_z
.color
= MEM_BLACK
;
3543 mem_z
.start
= mem_z
.end
= NULL
;
3548 /* Value is a pointer to the mem_node containing START. Value is
3549 MEM_NIL if there is no node in the tree containing START. */
3551 static INLINE
struct mem_node
*
3557 if (start
< min_heap_address
|| start
> max_heap_address
)
3560 /* Make the search always successful to speed up the loop below. */
3561 mem_z
.start
= start
;
3562 mem_z
.end
= (char *) start
+ 1;
3565 while (start
< p
->start
|| start
>= p
->end
)
3566 p
= start
< p
->start
? p
->left
: p
->right
;
3571 /* Insert a new node into the tree for a block of memory with start
3572 address START, end address END, and type TYPE. Value is a
3573 pointer to the node that was inserted. */
3575 static struct mem_node
*
3576 mem_insert (start
, end
, type
)
3580 struct mem_node
*c
, *parent
, *x
;
3582 if (min_heap_address
== NULL
|| start
< min_heap_address
)
3583 min_heap_address
= start
;
3584 if (max_heap_address
== NULL
|| end
> max_heap_address
)
3585 max_heap_address
= end
;
3587 /* See where in the tree a node for START belongs. In this
3588 particular application, it shouldn't happen that a node is already
3589 present. For debugging purposes, let's check that. */
3593 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3595 while (c
!= MEM_NIL
)
3597 if (start
>= c
->start
&& start
< c
->end
)
3600 c
= start
< c
->start
? c
->left
: c
->right
;
3603 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3605 while (c
!= MEM_NIL
)
3608 c
= start
< c
->start
? c
->left
: c
->right
;
3611 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3613 /* Create a new node. */
3614 #ifdef GC_MALLOC_CHECK
3615 x
= (struct mem_node
*) _malloc_internal (sizeof *x
);
3619 x
= (struct mem_node
*) xmalloc (sizeof *x
);
3625 x
->left
= x
->right
= MEM_NIL
;
3628 /* Insert it as child of PARENT or install it as root. */
3631 if (start
< parent
->start
)
3639 /* Re-establish red-black tree properties. */
3640 mem_insert_fixup (x
);
3646 /* Re-establish the red-black properties of the tree, and thereby
3647 balance the tree, after node X has been inserted; X is always red. */
3650 mem_insert_fixup (x
)
3653 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3655 /* X is red and its parent is red. This is a violation of
3656 red-black tree property #3. */
3658 if (x
->parent
== x
->parent
->parent
->left
)
3660 /* We're on the left side of our grandparent, and Y is our
3662 struct mem_node
*y
= x
->parent
->parent
->right
;
3664 if (y
->color
== MEM_RED
)
3666 /* Uncle and parent are red but should be black because
3667 X is red. Change the colors accordingly and proceed
3668 with the grandparent. */
3669 x
->parent
->color
= MEM_BLACK
;
3670 y
->color
= MEM_BLACK
;
3671 x
->parent
->parent
->color
= MEM_RED
;
3672 x
= x
->parent
->parent
;
3676 /* Parent and uncle have different colors; parent is
3677 red, uncle is black. */
3678 if (x
== x
->parent
->right
)
3681 mem_rotate_left (x
);
3684 x
->parent
->color
= MEM_BLACK
;
3685 x
->parent
->parent
->color
= MEM_RED
;
3686 mem_rotate_right (x
->parent
->parent
);
3691 /* This is the symmetrical case of above. */
3692 struct mem_node
*y
= x
->parent
->parent
->left
;
3694 if (y
->color
== MEM_RED
)
3696 x
->parent
->color
= MEM_BLACK
;
3697 y
->color
= MEM_BLACK
;
3698 x
->parent
->parent
->color
= MEM_RED
;
3699 x
= x
->parent
->parent
;
3703 if (x
== x
->parent
->left
)
3706 mem_rotate_right (x
);
3709 x
->parent
->color
= MEM_BLACK
;
3710 x
->parent
->parent
->color
= MEM_RED
;
3711 mem_rotate_left (x
->parent
->parent
);
3716 /* The root may have been changed to red due to the algorithm. Set
3717 it to black so that property #5 is satisfied. */
3718 mem_root
->color
= MEM_BLACK
;
3734 /* Turn y's left sub-tree into x's right sub-tree. */
3737 if (y
->left
!= MEM_NIL
)
3738 y
->left
->parent
= x
;
3740 /* Y's parent was x's parent. */
3742 y
->parent
= x
->parent
;
3744 /* Get the parent to point to y instead of x. */
3747 if (x
== x
->parent
->left
)
3748 x
->parent
->left
= y
;
3750 x
->parent
->right
= y
;
3755 /* Put x on y's left. */
3769 mem_rotate_right (x
)
3772 struct mem_node
*y
= x
->left
;
3775 if (y
->right
!= MEM_NIL
)
3776 y
->right
->parent
= x
;
3779 y
->parent
= x
->parent
;
3782 if (x
== x
->parent
->right
)
3783 x
->parent
->right
= y
;
3785 x
->parent
->left
= y
;
3796 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
3802 struct mem_node
*x
, *y
;
3804 if (!z
|| z
== MEM_NIL
)
3807 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
3812 while (y
->left
!= MEM_NIL
)
3816 if (y
->left
!= MEM_NIL
)
3821 x
->parent
= y
->parent
;
3824 if (y
== y
->parent
->left
)
3825 y
->parent
->left
= x
;
3827 y
->parent
->right
= x
;
3834 z
->start
= y
->start
;
3839 if (y
->color
== MEM_BLACK
)
3840 mem_delete_fixup (x
);
3842 #ifdef GC_MALLOC_CHECK
3850 /* Re-establish the red-black properties of the tree, after a
3854 mem_delete_fixup (x
)
3857 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
3859 if (x
== x
->parent
->left
)
3861 struct mem_node
*w
= x
->parent
->right
;
3863 if (w
->color
== MEM_RED
)
3865 w
->color
= MEM_BLACK
;
3866 x
->parent
->color
= MEM_RED
;
3867 mem_rotate_left (x
->parent
);
3868 w
= x
->parent
->right
;
3871 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
3878 if (w
->right
->color
== MEM_BLACK
)
3880 w
->left
->color
= MEM_BLACK
;
3882 mem_rotate_right (w
);
3883 w
= x
->parent
->right
;
3885 w
->color
= x
->parent
->color
;
3886 x
->parent
->color
= MEM_BLACK
;
3887 w
->right
->color
= MEM_BLACK
;
3888 mem_rotate_left (x
->parent
);
3894 struct mem_node
*w
= x
->parent
->left
;
3896 if (w
->color
== MEM_RED
)
3898 w
->color
= MEM_BLACK
;
3899 x
->parent
->color
= MEM_RED
;
3900 mem_rotate_right (x
->parent
);
3901 w
= x
->parent
->left
;
3904 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
3911 if (w
->left
->color
== MEM_BLACK
)
3913 w
->right
->color
= MEM_BLACK
;
3915 mem_rotate_left (w
);
3916 w
= x
->parent
->left
;
3919 w
->color
= x
->parent
->color
;
3920 x
->parent
->color
= MEM_BLACK
;
3921 w
->left
->color
= MEM_BLACK
;
3922 mem_rotate_right (x
->parent
);
3928 x
->color
= MEM_BLACK
;
3932 /* Value is non-zero if P is a pointer to a live Lisp string on
3933 the heap. M is a pointer to the mem_block for P. */
3936 live_string_p (m
, p
)
3940 if (m
->type
== MEM_TYPE_STRING
)
3942 struct string_block
*b
= (struct string_block
*) m
->start
;
3943 int offset
= (char *) p
- (char *) &b
->strings
[0];
3945 /* P must point to the start of a Lisp_String structure, and it
3946 must not be on the free-list. */
3948 && offset
% sizeof b
->strings
[0] == 0
3949 && offset
< (STRING_BLOCK_SIZE
* sizeof b
->strings
[0])
3950 && ((struct Lisp_String
*) p
)->data
!= NULL
);
3957 /* Value is non-zero if P is a pointer to a live Lisp cons on
3958 the heap. M is a pointer to the mem_block for P. */
3965 if (m
->type
== MEM_TYPE_CONS
)
3967 struct cons_block
*b
= (struct cons_block
*) m
->start
;
3968 int offset
= (char *) p
- (char *) &b
->conses
[0];
3970 /* P must point to the start of a Lisp_Cons, not be
3971 one of the unused cells in the current cons block,
3972 and not be on the free-list. */
3974 && offset
% sizeof b
->conses
[0] == 0
3975 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
3977 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
3978 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
3985 /* Value is non-zero if P is a pointer to a live Lisp symbol on
3986 the heap. M is a pointer to the mem_block for P. */
3989 live_symbol_p (m
, p
)
3993 if (m
->type
== MEM_TYPE_SYMBOL
)
3995 struct symbol_block
*b
= (struct symbol_block
*) m
->start
;
3996 int offset
= (char *) p
- (char *) &b
->symbols
[0];
3998 /* P must point to the start of a Lisp_Symbol, not be
3999 one of the unused cells in the current symbol block,
4000 and not be on the free-list. */
4002 && offset
% sizeof b
->symbols
[0] == 0
4003 && offset
< (SYMBOL_BLOCK_SIZE
* sizeof b
->symbols
[0])
4004 && (b
!= symbol_block
4005 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
4006 && !EQ (((struct Lisp_Symbol
*) p
)->function
, Vdead
));
4013 /* Value is non-zero if P is a pointer to a live Lisp float on
4014 the heap. M is a pointer to the mem_block for P. */
4021 if (m
->type
== MEM_TYPE_FLOAT
)
4023 struct float_block
*b
= (struct float_block
*) m
->start
;
4024 int offset
= (char *) p
- (char *) &b
->floats
[0];
4026 /* P must point to the start of a Lisp_Float and not be
4027 one of the unused cells in the current float block. */
4029 && offset
% sizeof b
->floats
[0] == 0
4030 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
4031 && (b
!= float_block
4032 || offset
/ sizeof b
->floats
[0] < float_block_index
));
4039 /* Value is non-zero if P is a pointer to a live Lisp Misc on
4040 the heap. M is a pointer to the mem_block for P. */
4047 if (m
->type
== MEM_TYPE_MISC
)
4049 struct marker_block
*b
= (struct marker_block
*) m
->start
;
4050 int offset
= (char *) p
- (char *) &b
->markers
[0];
4052 /* P must point to the start of a Lisp_Misc, not be
4053 one of the unused cells in the current misc block,
4054 and not be on the free-list. */
4056 && offset
% sizeof b
->markers
[0] == 0
4057 && offset
< (MARKER_BLOCK_SIZE
* sizeof b
->markers
[0])
4058 && (b
!= marker_block
4059 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
4060 && ((union Lisp_Misc
*) p
)->u_any
.type
!= Lisp_Misc_Free
);
4067 /* Value is non-zero if P is a pointer to a live vector-like object.
4068 M is a pointer to the mem_block for P. */
4071 live_vector_p (m
, p
)
4075 return (p
== m
->start
&& m
->type
== MEM_TYPE_VECTORLIKE
);
4079 /* Value is non-zero if P is a pointer to a live buffer. M is a
4080 pointer to the mem_block for P. */
4083 live_buffer_p (m
, p
)
4087 /* P must point to the start of the block, and the buffer
4088 must not have been killed. */
4089 return (m
->type
== MEM_TYPE_BUFFER
4091 && !NILP (((struct buffer
*) p
)->name
));
4094 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
4098 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4100 /* Array of objects that are kept alive because the C stack contains
4101 a pattern that looks like a reference to them . */
4103 #define MAX_ZOMBIES 10
4104 static Lisp_Object zombies
[MAX_ZOMBIES
];
4106 /* Number of zombie objects. */
4108 static int nzombies
;
4110 /* Number of garbage collections. */
4114 /* Average percentage of zombies per collection. */
4116 static double avg_zombies
;
4118 /* Max. number of live and zombie objects. */
4120 static int max_live
, max_zombies
;
4122 /* Average number of live objects per GC. */
4124 static double avg_live
;
4126 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
4127 doc
: /* Show information about live and zombie objects. */)
4130 Lisp_Object args
[8], zombie_list
= Qnil
;
4132 for (i
= 0; i
< nzombies
; i
++)
4133 zombie_list
= Fcons (zombies
[i
], zombie_list
);
4134 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
4135 args
[1] = make_number (ngcs
);
4136 args
[2] = make_float (avg_live
);
4137 args
[3] = make_float (avg_zombies
);
4138 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
4139 args
[5] = make_number (max_live
);
4140 args
[6] = make_number (max_zombies
);
4141 args
[7] = zombie_list
;
4142 return Fmessage (8, args
);
4145 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4148 /* Mark OBJ if we can prove it's a Lisp_Object. */
4151 mark_maybe_object (obj
)
4154 void *po
= (void *) XPNTR (obj
);
4155 struct mem_node
*m
= mem_find (po
);
4161 switch (XGCTYPE (obj
))
4164 mark_p
= (live_string_p (m
, po
)
4165 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
4169 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
4173 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
4177 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
4180 case Lisp_Vectorlike
:
4181 /* Note: can't check GC_BUFFERP before we know it's a
4182 buffer because checking that dereferences the pointer
4183 PO which might point anywhere. */
4184 if (live_vector_p (m
, po
))
4185 mark_p
= !GC_SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
4186 else if (live_buffer_p (m
, po
))
4187 mark_p
= GC_BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
4191 mark_p
= (live_misc_p (m
, po
) && !XMISCANY (obj
)->gcmarkbit
);
4195 case Lisp_Type_Limit
:
4201 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4202 if (nzombies
< MAX_ZOMBIES
)
4203 zombies
[nzombies
] = obj
;
4212 /* If P points to Lisp data, mark that as live if it isn't already
4216 mark_maybe_pointer (p
)
4221 /* Quickly rule out some values which can't point to Lisp data. */
4224 8 /* USE_LSB_TAG needs Lisp data to be aligned on multiples of 8. */
4226 2 /* We assume that Lisp data is aligned on even addresses. */
4234 Lisp_Object obj
= Qnil
;
4238 case MEM_TYPE_NON_LISP
:
4239 /* Nothing to do; not a pointer to Lisp memory. */
4242 case MEM_TYPE_BUFFER
:
4243 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P((struct buffer
*)p
))
4244 XSETVECTOR (obj
, p
);
4248 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
4252 case MEM_TYPE_STRING
:
4253 if (live_string_p (m
, p
)
4254 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
4255 XSETSTRING (obj
, p
);
4259 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
4263 case MEM_TYPE_SYMBOL
:
4264 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
4265 XSETSYMBOL (obj
, p
);
4268 case MEM_TYPE_FLOAT
:
4269 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
4273 case MEM_TYPE_VECTORLIKE
:
4274 if (live_vector_p (m
, p
))
4277 XSETVECTOR (tem
, p
);
4278 if (!GC_SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
4293 /* Mark Lisp objects referenced from the address range START+OFFSET..END
4294 or END+OFFSET..START. */
4297 mark_memory (start
, end
, offset
)
4304 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4308 /* Make START the pointer to the start of the memory region,
4309 if it isn't already. */
4317 /* Mark Lisp_Objects. */
4318 for (p
= (Lisp_Object
*) ((char *) start
+ offset
); (void *) p
< end
; ++p
)
4319 mark_maybe_object (*p
);
4321 /* Mark Lisp data pointed to. This is necessary because, in some
4322 situations, the C compiler optimizes Lisp objects away, so that
4323 only a pointer to them remains. Example:
4325 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
4328 Lisp_Object obj = build_string ("test");
4329 struct Lisp_String *s = XSTRING (obj);
4330 Fgarbage_collect ();
4331 fprintf (stderr, "test `%s'\n", s->data);
4335 Here, `obj' isn't really used, and the compiler optimizes it
4336 away. The only reference to the life string is through the
4339 for (pp
= (void **) ((char *) start
+ offset
); (void *) pp
< end
; ++pp
)
4340 mark_maybe_pointer (*pp
);
4343 /* setjmp will work with GCC unless NON_SAVING_SETJMP is defined in
4344 the GCC system configuration. In gcc 3.2, the only systems for
4345 which this is so are i386-sco5 non-ELF, i386-sysv3 (maybe included
4346 by others?) and ns32k-pc532-min. */
4348 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
4350 static int setjmp_tested_p
, longjmps_done
;
4352 #define SETJMP_WILL_LIKELY_WORK "\
4354 Emacs garbage collector has been changed to use conservative stack\n\
4355 marking. Emacs has determined that the method it uses to do the\n\
4356 marking will likely work on your system, but this isn't sure.\n\
4358 If you are a system-programmer, or can get the help of a local wizard\n\
4359 who is, please take a look at the function mark_stack in alloc.c, and\n\
4360 verify that the methods used are appropriate for your system.\n\
4362 Please mail the result to <emacs-devel@gnu.org>.\n\
4365 #define SETJMP_WILL_NOT_WORK "\
4367 Emacs garbage collector has been changed to use conservative stack\n\
4368 marking. Emacs has determined that the default method it uses to do the\n\
4369 marking will not work on your system. We will need a system-dependent\n\
4370 solution for your system.\n\
4372 Please take a look at the function mark_stack in alloc.c, and\n\
4373 try to find a way to make it work on your system.\n\
4375 Note that you may get false negatives, depending on the compiler.\n\
4376 In particular, you need to use -O with GCC for this test.\n\
4378 Please mail the result to <emacs-devel@gnu.org>.\n\
4382 /* Perform a quick check if it looks like setjmp saves registers in a
4383 jmp_buf. Print a message to stderr saying so. When this test
4384 succeeds, this is _not_ a proof that setjmp is sufficient for
4385 conservative stack marking. Only the sources or a disassembly
4396 /* Arrange for X to be put in a register. */
4402 if (longjmps_done
== 1)
4404 /* Came here after the longjmp at the end of the function.
4406 If x == 1, the longjmp has restored the register to its
4407 value before the setjmp, and we can hope that setjmp
4408 saves all such registers in the jmp_buf, although that
4411 For other values of X, either something really strange is
4412 taking place, or the setjmp just didn't save the register. */
4415 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
4418 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
4425 if (longjmps_done
== 1)
4429 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
4432 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4434 /* Abort if anything GCPRO'd doesn't survive the GC. */
4442 for (p
= gcprolist
; p
; p
= p
->next
)
4443 for (i
= 0; i
< p
->nvars
; ++i
)
4444 if (!survives_gc_p (p
->var
[i
]))
4445 /* FIXME: It's not necessarily a bug. It might just be that the
4446 GCPRO is unnecessary or should release the object sooner. */
4450 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4457 fprintf (stderr
, "\nZombies kept alive = %d:\n", nzombies
);
4458 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
4460 fprintf (stderr
, " %d = ", i
);
4461 debug_print (zombies
[i
]);
4465 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4468 /* Mark live Lisp objects on the C stack.
4470 There are several system-dependent problems to consider when
4471 porting this to new architectures:
4475 We have to mark Lisp objects in CPU registers that can hold local
4476 variables or are used to pass parameters.
4478 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
4479 something that either saves relevant registers on the stack, or
4480 calls mark_maybe_object passing it each register's contents.
4482 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
4483 implementation assumes that calling setjmp saves registers we need
4484 to see in a jmp_buf which itself lies on the stack. This doesn't
4485 have to be true! It must be verified for each system, possibly
4486 by taking a look at the source code of setjmp.
4490 Architectures differ in the way their processor stack is organized.
4491 For example, the stack might look like this
4494 | Lisp_Object | size = 4
4496 | something else | size = 2
4498 | Lisp_Object | size = 4
4502 In such a case, not every Lisp_Object will be aligned equally. To
4503 find all Lisp_Object on the stack it won't be sufficient to walk
4504 the stack in steps of 4 bytes. Instead, two passes will be
4505 necessary, one starting at the start of the stack, and a second
4506 pass starting at the start of the stack + 2. Likewise, if the
4507 minimal alignment of Lisp_Objects on the stack is 1, four passes
4508 would be necessary, each one starting with one byte more offset
4509 from the stack start.
4511 The current code assumes by default that Lisp_Objects are aligned
4512 equally on the stack. */
4518 /* jmp_buf may not be aligned enough on darwin-ppc64 */
4519 union aligned_jmpbuf
{
4523 volatile int stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
4526 /* This trick flushes the register windows so that all the state of
4527 the process is contained in the stack. */
4528 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
4529 needed on ia64 too. See mach_dep.c, where it also says inline
4530 assembler doesn't work with relevant proprietary compilers. */
4535 /* Save registers that we need to see on the stack. We need to see
4536 registers used to hold register variables and registers used to
4538 #ifdef GC_SAVE_REGISTERS_ON_STACK
4539 GC_SAVE_REGISTERS_ON_STACK (end
);
4540 #else /* not GC_SAVE_REGISTERS_ON_STACK */
4542 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
4543 setjmp will definitely work, test it
4544 and print a message with the result
4546 if (!setjmp_tested_p
)
4548 setjmp_tested_p
= 1;
4551 #endif /* GC_SETJMP_WORKS */
4554 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
4555 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
4557 /* This assumes that the stack is a contiguous region in memory. If
4558 that's not the case, something has to be done here to iterate
4559 over the stack segments. */
4560 #ifndef GC_LISP_OBJECT_ALIGNMENT
4562 #define GC_LISP_OBJECT_ALIGNMENT __alignof__ (Lisp_Object)
4564 #define GC_LISP_OBJECT_ALIGNMENT sizeof (Lisp_Object)
4567 for (i
= 0; i
< sizeof (Lisp_Object
); i
+= GC_LISP_OBJECT_ALIGNMENT
)
4568 mark_memory (stack_base
, end
, i
);
4569 /* Allow for marking a secondary stack, like the register stack on the
4571 #ifdef GC_MARK_SECONDARY_STACK
4572 GC_MARK_SECONDARY_STACK ();
4575 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4580 #endif /* GC_MARK_STACK != 0 */
4583 /* Determine whether it is safe to access memory at address P. */
4589 return w32_valid_pointer_p (p
, 16);
4593 /* Obviously, we cannot just access it (we would SEGV trying), so we
4594 trick the o/s to tell us whether p is a valid pointer.
4595 Unfortunately, we cannot use NULL_DEVICE here, as emacs_write may
4596 not validate p in that case. */
4598 if ((fd
= emacs_open ("__Valid__Lisp__Object__", O_CREAT
| O_WRONLY
| O_TRUNC
, 0666)) >= 0)
4600 int valid
= (emacs_write (fd
, (char *)p
, 16) == 16);
4602 unlink ("__Valid__Lisp__Object__");
4610 /* Return 1 if OBJ is a valid lisp object.
4611 Return 0 if OBJ is NOT a valid lisp object.
4612 Return -1 if we cannot validate OBJ.
4613 This function can be quite slow,
4614 so it should only be used in code for manual debugging. */
4617 valid_lisp_object_p (obj
)
4628 p
= (void *) XPNTR (obj
);
4629 if (PURE_POINTER_P (p
))
4633 return valid_pointer_p (p
);
4640 int valid
= valid_pointer_p (p
);
4652 case MEM_TYPE_NON_LISP
:
4655 case MEM_TYPE_BUFFER
:
4656 return live_buffer_p (m
, p
);
4659 return live_cons_p (m
, p
);
4661 case MEM_TYPE_STRING
:
4662 return live_string_p (m
, p
);
4665 return live_misc_p (m
, p
);
4667 case MEM_TYPE_SYMBOL
:
4668 return live_symbol_p (m
, p
);
4670 case MEM_TYPE_FLOAT
:
4671 return live_float_p (m
, p
);
4673 case MEM_TYPE_VECTORLIKE
:
4674 return live_vector_p (m
, p
);
4687 /***********************************************************************
4688 Pure Storage Management
4689 ***********************************************************************/
4691 /* Allocate room for SIZE bytes from pure Lisp storage and return a
4692 pointer to it. TYPE is the Lisp type for which the memory is
4693 allocated. TYPE < 0 means it's not used for a Lisp object. */
4695 static POINTER_TYPE
*
4696 pure_alloc (size
, type
)
4700 POINTER_TYPE
*result
;
4702 size_t alignment
= (1 << GCTYPEBITS
);
4704 size_t alignment
= sizeof (EMACS_INT
);
4706 /* Give Lisp_Floats an extra alignment. */
4707 if (type
== Lisp_Float
)
4709 #if defined __GNUC__ && __GNUC__ >= 2
4710 alignment
= __alignof (struct Lisp_Float
);
4712 alignment
= sizeof (struct Lisp_Float
);
4720 /* Allocate space for a Lisp object from the beginning of the free
4721 space with taking account of alignment. */
4722 result
= ALIGN (purebeg
+ pure_bytes_used_lisp
, alignment
);
4723 pure_bytes_used_lisp
= ((char *)result
- (char *)purebeg
) + size
;
4727 /* Allocate space for a non-Lisp object from the end of the free
4729 pure_bytes_used_non_lisp
+= size
;
4730 result
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4732 pure_bytes_used
= pure_bytes_used_lisp
+ pure_bytes_used_non_lisp
;
4734 if (pure_bytes_used
<= pure_size
)
4737 /* Don't allocate a large amount here,
4738 because it might get mmap'd and then its address
4739 might not be usable. */
4740 purebeg
= (char *) xmalloc (10000);
4742 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
4743 pure_bytes_used
= 0;
4744 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
4749 /* Print a warning if PURESIZE is too small. */
4754 if (pure_bytes_used_before_overflow
)
4755 message ("emacs:0:Pure Lisp storage overflow (approx. %d bytes needed)",
4756 (int) (pure_bytes_used
+ pure_bytes_used_before_overflow
));
4760 /* Find the byte sequence {DATA[0], ..., DATA[NBYTES-1], '\0'} from
4761 the non-Lisp data pool of the pure storage, and return its start
4762 address. Return NULL if not found. */
4765 find_string_data_in_pure (data
, nbytes
)
4769 int i
, skip
, bm_skip
[256], last_char_skip
, infinity
, start
, start_max
;
4773 if (pure_bytes_used_non_lisp
< nbytes
+ 1)
4776 /* Set up the Boyer-Moore table. */
4778 for (i
= 0; i
< 256; i
++)
4781 p
= (unsigned char *) data
;
4783 bm_skip
[*p
++] = skip
;
4785 last_char_skip
= bm_skip
['\0'];
4787 non_lisp_beg
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4788 start_max
= pure_bytes_used_non_lisp
- (nbytes
+ 1);
4790 /* See the comments in the function `boyer_moore' (search.c) for the
4791 use of `infinity'. */
4792 infinity
= pure_bytes_used_non_lisp
+ 1;
4793 bm_skip
['\0'] = infinity
;
4795 p
= (unsigned char *) non_lisp_beg
+ nbytes
;
4799 /* Check the last character (== '\0'). */
4802 start
+= bm_skip
[*(p
+ start
)];
4804 while (start
<= start_max
);
4806 if (start
< infinity
)
4807 /* Couldn't find the last character. */
4810 /* No less than `infinity' means we could find the last
4811 character at `p[start - infinity]'. */
4814 /* Check the remaining characters. */
4815 if (memcmp (data
, non_lisp_beg
+ start
, nbytes
) == 0)
4817 return non_lisp_beg
+ start
;
4819 start
+= last_char_skip
;
4821 while (start
<= start_max
);
4827 /* Return a string allocated in pure space. DATA is a buffer holding
4828 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
4829 non-zero means make the result string multibyte.
4831 Must get an error if pure storage is full, since if it cannot hold
4832 a large string it may be able to hold conses that point to that
4833 string; then the string is not protected from gc. */
4836 make_pure_string (data
, nchars
, nbytes
, multibyte
)
4842 struct Lisp_String
*s
;
4844 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4845 s
->data
= find_string_data_in_pure (data
, nbytes
);
4846 if (s
->data
== NULL
)
4848 s
->data
= (unsigned char *) pure_alloc (nbytes
+ 1, -1);
4849 bcopy (data
, s
->data
, nbytes
);
4850 s
->data
[nbytes
] = '\0';
4853 s
->size_byte
= multibyte
? nbytes
: -1;
4854 s
->intervals
= NULL_INTERVAL
;
4855 XSETSTRING (string
, s
);
4860 /* Return a cons allocated from pure space. Give it pure copies
4861 of CAR as car and CDR as cdr. */
4864 pure_cons (car
, cdr
)
4865 Lisp_Object car
, cdr
;
4867 register Lisp_Object
new;
4868 struct Lisp_Cons
*p
;
4870 p
= (struct Lisp_Cons
*) pure_alloc (sizeof *p
, Lisp_Cons
);
4872 XSETCAR (new, Fpurecopy (car
));
4873 XSETCDR (new, Fpurecopy (cdr
));
4878 /* Value is a float object with value NUM allocated from pure space. */
4881 make_pure_float (num
)
4884 register Lisp_Object
new;
4885 struct Lisp_Float
*p
;
4887 p
= (struct Lisp_Float
*) pure_alloc (sizeof *p
, Lisp_Float
);
4889 XFLOAT_DATA (new) = num
;
4894 /* Return a vector with room for LEN Lisp_Objects allocated from
4898 make_pure_vector (len
)
4902 struct Lisp_Vector
*p
;
4903 size_t size
= sizeof *p
+ (len
- 1) * sizeof (Lisp_Object
);
4905 p
= (struct Lisp_Vector
*) pure_alloc (size
, Lisp_Vectorlike
);
4906 XSETVECTOR (new, p
);
4907 XVECTOR (new)->size
= len
;
4912 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
4913 doc
: /* Make a copy of object OBJ in pure storage.
4914 Recursively copies contents of vectors and cons cells.
4915 Does not copy symbols. Copies strings without text properties. */)
4917 register Lisp_Object obj
;
4919 if (NILP (Vpurify_flag
))
4922 if (PURE_POINTER_P (XPNTR (obj
)))
4926 return pure_cons (XCAR (obj
), XCDR (obj
));
4927 else if (FLOATP (obj
))
4928 return make_pure_float (XFLOAT_DATA (obj
));
4929 else if (STRINGP (obj
))
4930 return make_pure_string (SDATA (obj
), SCHARS (obj
),
4932 STRING_MULTIBYTE (obj
));
4933 else if (COMPILEDP (obj
) || VECTORP (obj
))
4935 register struct Lisp_Vector
*vec
;
4939 size
= XVECTOR (obj
)->size
;
4940 if (size
& PSEUDOVECTOR_FLAG
)
4941 size
&= PSEUDOVECTOR_SIZE_MASK
;
4942 vec
= XVECTOR (make_pure_vector (size
));
4943 for (i
= 0; i
< size
; i
++)
4944 vec
->contents
[i
] = Fpurecopy (XVECTOR (obj
)->contents
[i
]);
4945 if (COMPILEDP (obj
))
4947 XSETPVECTYPE (vec
, PVEC_COMPILED
);
4948 XSETCOMPILED (obj
, vec
);
4951 XSETVECTOR (obj
, vec
);
4954 else if (MARKERP (obj
))
4955 error ("Attempt to copy a marker to pure storage");
4962 /***********************************************************************
4964 ***********************************************************************/
4966 /* Put an entry in staticvec, pointing at the variable with address
4970 staticpro (varaddress
)
4971 Lisp_Object
*varaddress
;
4973 staticvec
[staticidx
++] = varaddress
;
4974 if (staticidx
>= NSTATICS
)
4982 struct catchtag
*next
;
4986 /***********************************************************************
4988 ***********************************************************************/
4990 /* Temporarily prevent garbage collection. */
4993 inhibit_garbage_collection ()
4995 int count
= SPECPDL_INDEX ();
4996 int nbits
= min (VALBITS
, BITS_PER_INT
);
4998 specbind (Qgc_cons_threshold
, make_number (((EMACS_INT
) 1 << (nbits
- 1)) - 1));
5003 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
5004 doc
: /* Reclaim storage for Lisp objects no longer needed.
5005 Garbage collection happens automatically if you cons more than
5006 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
5007 `garbage-collect' normally returns a list with info on amount of space in use:
5008 ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)
5009 (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS
5010 (USED-FLOATS . FREE-FLOATS) (USED-INTERVALS . FREE-INTERVALS)
5011 (USED-STRINGS . FREE-STRINGS))
5012 However, if there was overflow in pure space, `garbage-collect'
5013 returns nil, because real GC can't be done. */)
5016 register struct specbinding
*bind
;
5017 struct catchtag
*catch;
5018 struct handler
*handler
;
5019 char stack_top_variable
;
5022 Lisp_Object total
[8];
5023 int count
= SPECPDL_INDEX ();
5024 EMACS_TIME t1
, t2
, t3
;
5029 /* Can't GC if pure storage overflowed because we can't determine
5030 if something is a pure object or not. */
5031 if (pure_bytes_used_before_overflow
)
5036 /* Don't keep undo information around forever.
5037 Do this early on, so it is no problem if the user quits. */
5039 register struct buffer
*nextb
= all_buffers
;
5043 /* If a buffer's undo list is Qt, that means that undo is
5044 turned off in that buffer. Calling truncate_undo_list on
5045 Qt tends to return NULL, which effectively turns undo back on.
5046 So don't call truncate_undo_list if undo_list is Qt. */
5047 if (! NILP (nextb
->name
) && ! EQ (nextb
->undo_list
, Qt
))
5048 truncate_undo_list (nextb
);
5050 /* Shrink buffer gaps, but skip indirect and dead buffers. */
5051 if (nextb
->base_buffer
== 0 && !NILP (nextb
->name
))
5053 /* If a buffer's gap size is more than 10% of the buffer
5054 size, or larger than 2000 bytes, then shrink it
5055 accordingly. Keep a minimum size of 20 bytes. */
5056 int size
= min (2000, max (20, (nextb
->text
->z_byte
/ 10)));
5058 if (nextb
->text
->gap_size
> size
)
5060 struct buffer
*save_current
= current_buffer
;
5061 current_buffer
= nextb
;
5062 make_gap (-(nextb
->text
->gap_size
- size
));
5063 current_buffer
= save_current
;
5067 nextb
= nextb
->next
;
5071 EMACS_GET_TIME (t1
);
5073 /* In case user calls debug_print during GC,
5074 don't let that cause a recursive GC. */
5075 consing_since_gc
= 0;
5077 /* Save what's currently displayed in the echo area. */
5078 message_p
= push_message ();
5079 record_unwind_protect (pop_message_unwind
, Qnil
);
5081 /* Save a copy of the contents of the stack, for debugging. */
5082 #if MAX_SAVE_STACK > 0
5083 if (NILP (Vpurify_flag
))
5085 i
= &stack_top_variable
- stack_bottom
;
5087 if (i
< MAX_SAVE_STACK
)
5089 if (stack_copy
== 0)
5090 stack_copy
= (char *) xmalloc (stack_copy_size
= i
);
5091 else if (stack_copy_size
< i
)
5092 stack_copy
= (char *) xrealloc (stack_copy
, (stack_copy_size
= i
));
5095 if ((EMACS_INT
) (&stack_top_variable
- stack_bottom
) > 0)
5096 bcopy (stack_bottom
, stack_copy
, i
);
5098 bcopy (&stack_top_variable
, stack_copy
, i
);
5102 #endif /* MAX_SAVE_STACK > 0 */
5104 if (garbage_collection_messages
)
5105 message1_nolog ("Garbage collecting...");
5109 shrink_regexp_cache ();
5113 /* clear_marks (); */
5115 /* Mark all the special slots that serve as the roots of accessibility. */
5117 for (i
= 0; i
< staticidx
; i
++)
5118 mark_object (*staticvec
[i
]);
5120 for (bind
= specpdl
; bind
!= specpdl_ptr
; bind
++)
5122 mark_object (bind
->symbol
);
5123 mark_object (bind
->old_value
);
5131 extern void xg_mark_data ();
5136 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
5137 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
5141 register struct gcpro
*tail
;
5142 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
5143 for (i
= 0; i
< tail
->nvars
; i
++)
5144 mark_object (tail
->var
[i
]);
5149 for (catch = catchlist
; catch; catch = catch->next
)
5151 mark_object (catch->tag
);
5152 mark_object (catch->val
);
5154 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
5156 mark_object (handler
->handler
);
5157 mark_object (handler
->var
);
5161 #ifdef HAVE_WINDOW_SYSTEM
5162 mark_fringe_data ();
5165 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5169 /* Everything is now marked, except for the things that require special
5170 finalization, i.e. the undo_list.
5171 Look thru every buffer's undo list
5172 for elements that update markers that were not marked,
5175 register struct buffer
*nextb
= all_buffers
;
5179 /* If a buffer's undo list is Qt, that means that undo is
5180 turned off in that buffer. Calling truncate_undo_list on
5181 Qt tends to return NULL, which effectively turns undo back on.
5182 So don't call truncate_undo_list if undo_list is Qt. */
5183 if (! EQ (nextb
->undo_list
, Qt
))
5185 Lisp_Object tail
, prev
;
5186 tail
= nextb
->undo_list
;
5188 while (CONSP (tail
))
5190 if (GC_CONSP (XCAR (tail
))
5191 && GC_MARKERP (XCAR (XCAR (tail
)))
5192 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
5195 nextb
->undo_list
= tail
= XCDR (tail
);
5199 XSETCDR (prev
, tail
);
5209 /* Now that we have stripped the elements that need not be in the
5210 undo_list any more, we can finally mark the list. */
5211 mark_object (nextb
->undo_list
);
5213 nextb
= nextb
->next
;
5219 /* Clear the mark bits that we set in certain root slots. */
5221 unmark_byte_stack ();
5222 VECTOR_UNMARK (&buffer_defaults
);
5223 VECTOR_UNMARK (&buffer_local_symbols
);
5225 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
5233 /* clear_marks (); */
5236 consing_since_gc
= 0;
5237 if (gc_cons_threshold
< 10000)
5238 gc_cons_threshold
= 10000;
5240 if (FLOATP (Vgc_cons_percentage
))
5241 { /* Set gc_cons_combined_threshold. */
5242 EMACS_INT total
= 0;
5244 total
+= total_conses
* sizeof (struct Lisp_Cons
);
5245 total
+= total_symbols
* sizeof (struct Lisp_Symbol
);
5246 total
+= total_markers
* sizeof (union Lisp_Misc
);
5247 total
+= total_string_size
;
5248 total
+= total_vector_size
* sizeof (Lisp_Object
);
5249 total
+= total_floats
* sizeof (struct Lisp_Float
);
5250 total
+= total_intervals
* sizeof (struct interval
);
5251 total
+= total_strings
* sizeof (struct Lisp_String
);
5253 gc_relative_threshold
= total
* XFLOAT_DATA (Vgc_cons_percentage
);
5256 gc_relative_threshold
= 0;
5258 if (garbage_collection_messages
)
5260 if (message_p
|| minibuf_level
> 0)
5263 message1_nolog ("Garbage collecting...done");
5266 unbind_to (count
, Qnil
);
5268 total
[0] = Fcons (make_number (total_conses
),
5269 make_number (total_free_conses
));
5270 total
[1] = Fcons (make_number (total_symbols
),
5271 make_number (total_free_symbols
));
5272 total
[2] = Fcons (make_number (total_markers
),
5273 make_number (total_free_markers
));
5274 total
[3] = make_number (total_string_size
);
5275 total
[4] = make_number (total_vector_size
);
5276 total
[5] = Fcons (make_number (total_floats
),
5277 make_number (total_free_floats
));
5278 total
[6] = Fcons (make_number (total_intervals
),
5279 make_number (total_free_intervals
));
5280 total
[7] = Fcons (make_number (total_strings
),
5281 make_number (total_free_strings
));
5283 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5285 /* Compute average percentage of zombies. */
5288 for (i
= 0; i
< 7; ++i
)
5289 if (CONSP (total
[i
]))
5290 nlive
+= XFASTINT (XCAR (total
[i
]));
5292 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
5293 max_live
= max (nlive
, max_live
);
5294 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
5295 max_zombies
= max (nzombies
, max_zombies
);
5300 if (!NILP (Vpost_gc_hook
))
5302 int count
= inhibit_garbage_collection ();
5303 safe_run_hooks (Qpost_gc_hook
);
5304 unbind_to (count
, Qnil
);
5307 /* Accumulate statistics. */
5308 EMACS_GET_TIME (t2
);
5309 EMACS_SUB_TIME (t3
, t2
, t1
);
5310 if (FLOATP (Vgc_elapsed
))
5311 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
) +
5313 EMACS_USECS (t3
) * 1.0e-6);
5316 return Flist (sizeof total
/ sizeof *total
, total
);
5320 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
5321 only interesting objects referenced from glyphs are strings. */
5324 mark_glyph_matrix (matrix
)
5325 struct glyph_matrix
*matrix
;
5327 struct glyph_row
*row
= matrix
->rows
;
5328 struct glyph_row
*end
= row
+ matrix
->nrows
;
5330 for (; row
< end
; ++row
)
5334 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
5336 struct glyph
*glyph
= row
->glyphs
[area
];
5337 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
5339 for (; glyph
< end_glyph
; ++glyph
)
5340 if (GC_STRINGP (glyph
->object
)
5341 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
5342 mark_object (glyph
->object
);
5348 /* Mark Lisp faces in the face cache C. */
5352 struct face_cache
*c
;
5357 for (i
= 0; i
< c
->used
; ++i
)
5359 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
5363 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
5364 mark_object (face
->lface
[j
]);
5371 #ifdef HAVE_WINDOW_SYSTEM
5373 /* Mark Lisp objects in image IMG. */
5379 mark_object (img
->spec
);
5381 if (!NILP (img
->data
.lisp_val
))
5382 mark_object (img
->data
.lisp_val
);
5386 /* Mark Lisp objects in image cache of frame F. It's done this way so
5387 that we don't have to include xterm.h here. */
5390 mark_image_cache (f
)
5393 forall_images_in_image_cache (f
, mark_image
);
5396 #endif /* HAVE_X_WINDOWS */
5400 /* Mark reference to a Lisp_Object.
5401 If the object referred to has not been seen yet, recursively mark
5402 all the references contained in it. */
5404 #define LAST_MARKED_SIZE 500
5405 static Lisp_Object last_marked
[LAST_MARKED_SIZE
];
5406 int last_marked_index
;
5408 /* For debugging--call abort when we cdr down this many
5409 links of a list, in mark_object. In debugging,
5410 the call to abort will hit a breakpoint.
5411 Normally this is zero and the check never goes off. */
5412 static int mark_object_loop_halt
;
5414 /* Return non-zero if the object was not yet marked. */
5416 mark_vectorlike (ptr
)
5417 struct Lisp_Vector
*ptr
;
5419 register EMACS_INT size
= ptr
->size
;
5422 if (VECTOR_MARKED_P (ptr
))
5423 return 0; /* Already marked */
5424 VECTOR_MARK (ptr
); /* Else mark it */
5425 if (size
& PSEUDOVECTOR_FLAG
)
5426 size
&= PSEUDOVECTOR_SIZE_MASK
;
5428 /* Note that this size is not the memory-footprint size, but only
5429 the number of Lisp_Object fields that we should trace.
5430 The distinction is used e.g. by Lisp_Process which places extra
5431 non-Lisp_Object fields at the end of the structure. */
5432 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5433 mark_object (ptr
->contents
[i
]);
5441 register Lisp_Object obj
= arg
;
5442 #ifdef GC_CHECK_MARKED_OBJECTS
5450 if (PURE_POINTER_P (XPNTR (obj
)))
5453 last_marked
[last_marked_index
++] = obj
;
5454 if (last_marked_index
== LAST_MARKED_SIZE
)
5455 last_marked_index
= 0;
5457 /* Perform some sanity checks on the objects marked here. Abort if
5458 we encounter an object we know is bogus. This increases GC time
5459 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
5460 #ifdef GC_CHECK_MARKED_OBJECTS
5462 po
= (void *) XPNTR (obj
);
5464 /* Check that the object pointed to by PO is known to be a Lisp
5465 structure allocated from the heap. */
5466 #define CHECK_ALLOCATED() \
5468 m = mem_find (po); \
5473 /* Check that the object pointed to by PO is live, using predicate
5475 #define CHECK_LIVE(LIVEP) \
5477 if (!LIVEP (m, po)) \
5481 /* Check both of the above conditions. */
5482 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
5484 CHECK_ALLOCATED (); \
5485 CHECK_LIVE (LIVEP); \
5488 #else /* not GC_CHECK_MARKED_OBJECTS */
5490 #define CHECK_ALLOCATED() (void) 0
5491 #define CHECK_LIVE(LIVEP) (void) 0
5492 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
5494 #endif /* not GC_CHECK_MARKED_OBJECTS */
5496 switch (SWITCH_ENUM_CAST (XGCTYPE (obj
)))
5500 register struct Lisp_String
*ptr
= XSTRING (obj
);
5501 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
5502 MARK_INTERVAL_TREE (ptr
->intervals
);
5504 #ifdef GC_CHECK_STRING_BYTES
5505 /* Check that the string size recorded in the string is the
5506 same as the one recorded in the sdata structure. */
5507 CHECK_STRING_BYTES (ptr
);
5508 #endif /* GC_CHECK_STRING_BYTES */
5512 case Lisp_Vectorlike
:
5513 #ifdef GC_CHECK_MARKED_OBJECTS
5515 if (m
== MEM_NIL
&& !GC_SUBRP (obj
)
5516 && po
!= &buffer_defaults
5517 && po
!= &buffer_local_symbols
)
5519 #endif /* GC_CHECK_MARKED_OBJECTS */
5521 if (GC_BUFFERP (obj
))
5523 if (!VECTOR_MARKED_P (XBUFFER (obj
)))
5525 #ifdef GC_CHECK_MARKED_OBJECTS
5526 if (po
!= &buffer_defaults
&& po
!= &buffer_local_symbols
)
5529 for (b
= all_buffers
; b
&& b
!= po
; b
= b
->next
)
5534 #endif /* GC_CHECK_MARKED_OBJECTS */
5538 else if (GC_SUBRP (obj
))
5540 else if (GC_COMPILEDP (obj
))
5541 /* We could treat this just like a vector, but it is better to
5542 save the COMPILED_CONSTANTS element for last and avoid
5545 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5546 register EMACS_INT size
= ptr
->size
;
5549 if (VECTOR_MARKED_P (ptr
))
5550 break; /* Already marked */
5552 CHECK_LIVE (live_vector_p
);
5553 VECTOR_MARK (ptr
); /* Else mark it */
5554 size
&= PSEUDOVECTOR_SIZE_MASK
;
5555 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5557 if (i
!= COMPILED_CONSTANTS
)
5558 mark_object (ptr
->contents
[i
]);
5560 obj
= ptr
->contents
[COMPILED_CONSTANTS
];
5563 else if (GC_FRAMEP (obj
))
5565 register struct frame
*ptr
= XFRAME (obj
);
5566 if (mark_vectorlike (XVECTOR (obj
)))
5568 mark_face_cache (ptr
->face_cache
);
5569 #ifdef HAVE_WINDOW_SYSTEM
5570 mark_image_cache (ptr
);
5571 #endif /* HAVE_WINDOW_SYSTEM */
5574 else if (GC_WINDOWP (obj
))
5576 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5577 struct window
*w
= XWINDOW (obj
);
5578 if (mark_vectorlike (ptr
))
5580 /* Mark glyphs for leaf windows. Marking window matrices is
5581 sufficient because frame matrices use the same glyph
5583 if (NILP (w
->hchild
)
5585 && w
->current_matrix
)
5587 mark_glyph_matrix (w
->current_matrix
);
5588 mark_glyph_matrix (w
->desired_matrix
);
5592 else if (GC_HASH_TABLE_P (obj
))
5594 struct Lisp_Hash_Table
*h
= XHASH_TABLE (obj
);
5595 if (mark_vectorlike ((struct Lisp_Vector
*)h
))
5596 { /* If hash table is not weak, mark all keys and values.
5597 For weak tables, mark only the vector. */
5598 if (GC_NILP (h
->weak
))
5599 mark_object (h
->key_and_value
);
5601 VECTOR_MARK (XVECTOR (h
->key_and_value
));
5605 mark_vectorlike (XVECTOR (obj
));
5610 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
5611 struct Lisp_Symbol
*ptrx
;
5613 if (ptr
->gcmarkbit
) break;
5614 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
5616 mark_object (ptr
->value
);
5617 mark_object (ptr
->function
);
5618 mark_object (ptr
->plist
);
5620 if (!PURE_POINTER_P (XSTRING (ptr
->xname
)))
5621 MARK_STRING (XSTRING (ptr
->xname
));
5622 MARK_INTERVAL_TREE (STRING_INTERVALS (ptr
->xname
));
5624 /* Note that we do not mark the obarray of the symbol.
5625 It is safe not to do so because nothing accesses that
5626 slot except to check whether it is nil. */
5630 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun */
5631 XSETSYMBOL (obj
, ptrx
);
5638 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
5639 if (XMISCANY (obj
)->gcmarkbit
)
5641 XMISCANY (obj
)->gcmarkbit
= 1;
5643 switch (XMISCTYPE (obj
))
5645 case Lisp_Misc_Buffer_Local_Value
:
5647 register struct Lisp_Buffer_Local_Value
*ptr
5648 = XBUFFER_LOCAL_VALUE (obj
);
5649 /* If the cdr is nil, avoid recursion for the car. */
5650 if (EQ (ptr
->cdr
, Qnil
))
5652 obj
= ptr
->realvalue
;
5655 mark_object (ptr
->realvalue
);
5656 mark_object (ptr
->buffer
);
5657 mark_object (ptr
->frame
);
5662 case Lisp_Misc_Marker
:
5663 /* DO NOT mark thru the marker's chain.
5664 The buffer's markers chain does not preserve markers from gc;
5665 instead, markers are removed from the chain when freed by gc. */
5668 case Lisp_Misc_Intfwd
:
5669 case Lisp_Misc_Boolfwd
:
5670 case Lisp_Misc_Objfwd
:
5671 case Lisp_Misc_Buffer_Objfwd
:
5672 case Lisp_Misc_Kboard_Objfwd
:
5673 /* Don't bother with Lisp_Buffer_Objfwd,
5674 since all markable slots in current buffer marked anyway. */
5675 /* Don't need to do Lisp_Objfwd, since the places they point
5676 are protected with staticpro. */
5679 case Lisp_Misc_Save_Value
:
5682 register struct Lisp_Save_Value
*ptr
= XSAVE_VALUE (obj
);
5683 /* If DOGC is set, POINTER is the address of a memory
5684 area containing INTEGER potential Lisp_Objects. */
5687 Lisp_Object
*p
= (Lisp_Object
*) ptr
->pointer
;
5689 for (nelt
= ptr
->integer
; nelt
> 0; nelt
--, p
++)
5690 mark_maybe_object (*p
);
5696 case Lisp_Misc_Overlay
:
5698 struct Lisp_Overlay
*ptr
= XOVERLAY (obj
);
5699 mark_object (ptr
->start
);
5700 mark_object (ptr
->end
);
5701 mark_object (ptr
->plist
);
5704 XSETMISC (obj
, ptr
->next
);
5717 register struct Lisp_Cons
*ptr
= XCONS (obj
);
5718 if (CONS_MARKED_P (ptr
)) break;
5719 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
5721 /* If the cdr is nil, avoid recursion for the car. */
5722 if (EQ (ptr
->u
.cdr
, Qnil
))
5728 mark_object (ptr
->car
);
5731 if (cdr_count
== mark_object_loop_halt
)
5737 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
5738 FLOAT_MARK (XFLOAT (obj
));
5749 #undef CHECK_ALLOCATED
5750 #undef CHECK_ALLOCATED_AND_LIVE
5753 /* Mark the pointers in a buffer structure. */
5759 register struct buffer
*buffer
= XBUFFER (buf
);
5760 register Lisp_Object
*ptr
, tmp
;
5761 Lisp_Object base_buffer
;
5763 VECTOR_MARK (buffer
);
5765 MARK_INTERVAL_TREE (BUF_INTERVALS (buffer
));
5767 /* For now, we just don't mark the undo_list. It's done later in
5768 a special way just before the sweep phase, and after stripping
5769 some of its elements that are not needed any more. */
5771 if (buffer
->overlays_before
)
5773 XSETMISC (tmp
, buffer
->overlays_before
);
5776 if (buffer
->overlays_after
)
5778 XSETMISC (tmp
, buffer
->overlays_after
);
5782 for (ptr
= &buffer
->name
;
5783 (char *)ptr
< (char *)buffer
+ sizeof (struct buffer
);
5787 /* If this is an indirect buffer, mark its base buffer. */
5788 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
5790 XSETBUFFER (base_buffer
, buffer
->base_buffer
);
5791 mark_buffer (base_buffer
);
5795 /* Mark the Lisp pointers in the terminal objects.
5796 Called by the Fgarbage_collector. */
5799 mark_terminals (void)
5802 for (t
= terminal_list
; t
; t
= t
->next_terminal
)
5804 eassert (t
->name
!= NULL
);
5805 mark_vectorlike ((struct Lisp_Vector
*)t
);
5811 /* Value is non-zero if OBJ will survive the current GC because it's
5812 either marked or does not need to be marked to survive. */
5820 switch (XGCTYPE (obj
))
5827 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
5831 survives_p
= XMISCANY (obj
)->gcmarkbit
;
5835 survives_p
= STRING_MARKED_P (XSTRING (obj
));
5838 case Lisp_Vectorlike
:
5839 survives_p
= GC_SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
5843 survives_p
= CONS_MARKED_P (XCONS (obj
));
5847 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
5854 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
5859 /* Sweep: find all structures not marked, and free them. */
5864 /* Remove or mark entries in weak hash tables.
5865 This must be done before any object is unmarked. */
5866 sweep_weak_hash_tables ();
5869 #ifdef GC_CHECK_STRING_BYTES
5870 if (!noninteractive
)
5871 check_string_bytes (1);
5874 /* Put all unmarked conses on free list */
5876 register struct cons_block
*cblk
;
5877 struct cons_block
**cprev
= &cons_block
;
5878 register int lim
= cons_block_index
;
5879 register int num_free
= 0, num_used
= 0;
5883 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
5887 int ilim
= (lim
+ BITS_PER_INT
- 1) / BITS_PER_INT
;
5889 /* Scan the mark bits an int at a time. */
5890 for (i
= 0; i
<= ilim
; i
++)
5892 if (cblk
->gcmarkbits
[i
] == -1)
5894 /* Fast path - all cons cells for this int are marked. */
5895 cblk
->gcmarkbits
[i
] = 0;
5896 num_used
+= BITS_PER_INT
;
5900 /* Some cons cells for this int are not marked.
5901 Find which ones, and free them. */
5902 int start
, pos
, stop
;
5904 start
= i
* BITS_PER_INT
;
5906 if (stop
> BITS_PER_INT
)
5907 stop
= BITS_PER_INT
;
5910 for (pos
= start
; pos
< stop
; pos
++)
5912 if (!CONS_MARKED_P (&cblk
->conses
[pos
]))
5915 cblk
->conses
[pos
].u
.chain
= cons_free_list
;
5916 cons_free_list
= &cblk
->conses
[pos
];
5918 cons_free_list
->car
= Vdead
;
5924 CONS_UNMARK (&cblk
->conses
[pos
]);
5930 lim
= CONS_BLOCK_SIZE
;
5931 /* If this block contains only free conses and we have already
5932 seen more than two blocks worth of free conses then deallocate
5934 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
5936 *cprev
= cblk
->next
;
5937 /* Unhook from the free list. */
5938 cons_free_list
= cblk
->conses
[0].u
.chain
;
5939 lisp_align_free (cblk
);
5944 num_free
+= this_free
;
5945 cprev
= &cblk
->next
;
5948 total_conses
= num_used
;
5949 total_free_conses
= num_free
;
5952 /* Put all unmarked floats on free list */
5954 register struct float_block
*fblk
;
5955 struct float_block
**fprev
= &float_block
;
5956 register int lim
= float_block_index
;
5957 register int num_free
= 0, num_used
= 0;
5959 float_free_list
= 0;
5961 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
5965 for (i
= 0; i
< lim
; i
++)
5966 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
5969 fblk
->floats
[i
].u
.chain
= float_free_list
;
5970 float_free_list
= &fblk
->floats
[i
];
5975 FLOAT_UNMARK (&fblk
->floats
[i
]);
5977 lim
= FLOAT_BLOCK_SIZE
;
5978 /* If this block contains only free floats and we have already
5979 seen more than two blocks worth of free floats then deallocate
5981 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
5983 *fprev
= fblk
->next
;
5984 /* Unhook from the free list. */
5985 float_free_list
= fblk
->floats
[0].u
.chain
;
5986 lisp_align_free (fblk
);
5991 num_free
+= this_free
;
5992 fprev
= &fblk
->next
;
5995 total_floats
= num_used
;
5996 total_free_floats
= num_free
;
5999 /* Put all unmarked intervals on free list */
6001 register struct interval_block
*iblk
;
6002 struct interval_block
**iprev
= &interval_block
;
6003 register int lim
= interval_block_index
;
6004 register int num_free
= 0, num_used
= 0;
6006 interval_free_list
= 0;
6008 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
6013 for (i
= 0; i
< lim
; i
++)
6015 if (!iblk
->intervals
[i
].gcmarkbit
)
6017 SET_INTERVAL_PARENT (&iblk
->intervals
[i
], interval_free_list
);
6018 interval_free_list
= &iblk
->intervals
[i
];
6024 iblk
->intervals
[i
].gcmarkbit
= 0;
6027 lim
= INTERVAL_BLOCK_SIZE
;
6028 /* If this block contains only free intervals and we have already
6029 seen more than two blocks worth of free intervals then
6030 deallocate this block. */
6031 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
6033 *iprev
= iblk
->next
;
6034 /* Unhook from the free list. */
6035 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
6037 n_interval_blocks
--;
6041 num_free
+= this_free
;
6042 iprev
= &iblk
->next
;
6045 total_intervals
= num_used
;
6046 total_free_intervals
= num_free
;
6049 /* Put all unmarked symbols on free list */
6051 register struct symbol_block
*sblk
;
6052 struct symbol_block
**sprev
= &symbol_block
;
6053 register int lim
= symbol_block_index
;
6054 register int num_free
= 0, num_used
= 0;
6056 symbol_free_list
= NULL
;
6058 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
6061 struct Lisp_Symbol
*sym
= sblk
->symbols
;
6062 struct Lisp_Symbol
*end
= sym
+ lim
;
6064 for (; sym
< end
; ++sym
)
6066 /* Check if the symbol was created during loadup. In such a case
6067 it might be pointed to by pure bytecode which we don't trace,
6068 so we conservatively assume that it is live. */
6069 int pure_p
= PURE_POINTER_P (XSTRING (sym
->xname
));
6071 if (!sym
->gcmarkbit
&& !pure_p
)
6073 sym
->next
= symbol_free_list
;
6074 symbol_free_list
= sym
;
6076 symbol_free_list
->function
= Vdead
;
6084 UNMARK_STRING (XSTRING (sym
->xname
));
6089 lim
= SYMBOL_BLOCK_SIZE
;
6090 /* If this block contains only free symbols and we have already
6091 seen more than two blocks worth of free symbols then deallocate
6093 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
6095 *sprev
= sblk
->next
;
6096 /* Unhook from the free list. */
6097 symbol_free_list
= sblk
->symbols
[0].next
;
6103 num_free
+= this_free
;
6104 sprev
= &sblk
->next
;
6107 total_symbols
= num_used
;
6108 total_free_symbols
= num_free
;
6111 /* Put all unmarked misc's on free list.
6112 For a marker, first unchain it from the buffer it points into. */
6114 register struct marker_block
*mblk
;
6115 struct marker_block
**mprev
= &marker_block
;
6116 register int lim
= marker_block_index
;
6117 register int num_free
= 0, num_used
= 0;
6119 marker_free_list
= 0;
6121 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
6126 for (i
= 0; i
< lim
; i
++)
6128 if (!mblk
->markers
[i
].u_any
.gcmarkbit
)
6130 if (mblk
->markers
[i
].u_any
.type
== Lisp_Misc_Marker
)
6131 unchain_marker (&mblk
->markers
[i
].u_marker
);
6132 /* Set the type of the freed object to Lisp_Misc_Free.
6133 We could leave the type alone, since nobody checks it,
6134 but this might catch bugs faster. */
6135 mblk
->markers
[i
].u_marker
.type
= Lisp_Misc_Free
;
6136 mblk
->markers
[i
].u_free
.chain
= marker_free_list
;
6137 marker_free_list
= &mblk
->markers
[i
];
6143 mblk
->markers
[i
].u_any
.gcmarkbit
= 0;
6146 lim
= MARKER_BLOCK_SIZE
;
6147 /* If this block contains only free markers and we have already
6148 seen more than two blocks worth of free markers then deallocate
6150 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
6152 *mprev
= mblk
->next
;
6153 /* Unhook from the free list. */
6154 marker_free_list
= mblk
->markers
[0].u_free
.chain
;
6160 num_free
+= this_free
;
6161 mprev
= &mblk
->next
;
6165 total_markers
= num_used
;
6166 total_free_markers
= num_free
;
6169 /* Free all unmarked buffers */
6171 register struct buffer
*buffer
= all_buffers
, *prev
= 0, *next
;
6174 if (!VECTOR_MARKED_P (buffer
))
6177 prev
->next
= buffer
->next
;
6179 all_buffers
= buffer
->next
;
6180 next
= buffer
->next
;
6186 VECTOR_UNMARK (buffer
);
6187 UNMARK_BALANCE_INTERVALS (BUF_INTERVALS (buffer
));
6188 prev
= buffer
, buffer
= buffer
->next
;
6192 /* Free all unmarked vectors */
6194 register struct Lisp_Vector
*vector
= all_vectors
, *prev
= 0, *next
;
6195 total_vector_size
= 0;
6198 if (!VECTOR_MARKED_P (vector
))
6201 prev
->next
= vector
->next
;
6203 all_vectors
= vector
->next
;
6204 next
= vector
->next
;
6212 VECTOR_UNMARK (vector
);
6213 if (vector
->size
& PSEUDOVECTOR_FLAG
)
6214 total_vector_size
+= (PSEUDOVECTOR_SIZE_MASK
& vector
->size
);
6216 total_vector_size
+= vector
->size
;
6217 prev
= vector
, vector
= vector
->next
;
6221 #ifdef GC_CHECK_STRING_BYTES
6222 if (!noninteractive
)
6223 check_string_bytes (1);
6230 /* Debugging aids. */
6232 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
6233 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
6234 This may be helpful in debugging Emacs's memory usage.
6235 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
6240 XSETINT (end
, (EMACS_INT
) sbrk (0) / 1024);
6245 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
6246 doc
: /* Return a list of counters that measure how much consing there has been.
6247 Each of these counters increments for a certain kind of object.
6248 The counters wrap around from the largest positive integer to zero.
6249 Garbage collection does not decrease them.
6250 The elements of the value are as follows:
6251 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
6252 All are in units of 1 = one object consed
6253 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
6255 MISCS include overlays, markers, and some internal types.
6256 Frames, windows, buffers, and subprocesses count as vectors
6257 (but the contents of a buffer's text do not count here). */)
6260 Lisp_Object consed
[8];
6262 consed
[0] = make_number (min (MOST_POSITIVE_FIXNUM
, cons_cells_consed
));
6263 consed
[1] = make_number (min (MOST_POSITIVE_FIXNUM
, floats_consed
));
6264 consed
[2] = make_number (min (MOST_POSITIVE_FIXNUM
, vector_cells_consed
));
6265 consed
[3] = make_number (min (MOST_POSITIVE_FIXNUM
, symbols_consed
));
6266 consed
[4] = make_number (min (MOST_POSITIVE_FIXNUM
, string_chars_consed
));
6267 consed
[5] = make_number (min (MOST_POSITIVE_FIXNUM
, misc_objects_consed
));
6268 consed
[6] = make_number (min (MOST_POSITIVE_FIXNUM
, intervals_consed
));
6269 consed
[7] = make_number (min (MOST_POSITIVE_FIXNUM
, strings_consed
));
6271 return Flist (8, consed
);
6274 int suppress_checking
;
6277 die (msg
, file
, line
)
6282 fprintf (stderr
, "\r\n%s:%d: Emacs fatal error: %s\r\n",
6287 /* Initialization */
6292 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
6294 pure_size
= PURESIZE
;
6295 pure_bytes_used
= 0;
6296 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
6297 pure_bytes_used_before_overflow
= 0;
6299 /* Initialize the list of free aligned blocks. */
6302 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
6304 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
6308 ignore_warnings
= 1;
6309 #ifdef DOUG_LEA_MALLOC
6310 mallopt (M_TRIM_THRESHOLD
, 128*1024); /* trim threshold */
6311 mallopt (M_MMAP_THRESHOLD
, 64*1024); /* mmap threshold */
6312 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* max. number of mmap'ed areas */
6322 malloc_hysteresis
= 32;
6324 malloc_hysteresis
= 0;
6327 refill_memory_reserve ();
6329 ignore_warnings
= 0;
6331 byte_stack_list
= 0;
6333 consing_since_gc
= 0;
6334 gc_cons_threshold
= 100000 * sizeof (Lisp_Object
);
6335 gc_relative_threshold
= 0;
6337 #ifdef VIRT_ADDR_VARIES
6338 malloc_sbrk_unused
= 1<<22; /* A large number */
6339 malloc_sbrk_used
= 100000; /* as reasonable as any number */
6340 #endif /* VIRT_ADDR_VARIES */
6347 byte_stack_list
= 0;
6349 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
6350 setjmp_tested_p
= longjmps_done
= 0;
6353 Vgc_elapsed
= make_float (0.0);
6360 DEFVAR_INT ("gc-cons-threshold", &gc_cons_threshold
,
6361 doc
: /* *Number of bytes of consing between garbage collections.
6362 Garbage collection can happen automatically once this many bytes have been
6363 allocated since the last garbage collection. All data types count.
6365 Garbage collection happens automatically only when `eval' is called.
6367 By binding this temporarily to a large number, you can effectively
6368 prevent garbage collection during a part of the program.
6369 See also `gc-cons-percentage'. */);
6371 DEFVAR_LISP ("gc-cons-percentage", &Vgc_cons_percentage
,
6372 doc
: /* *Portion of the heap used for allocation.
6373 Garbage collection can happen automatically once this portion of the heap
6374 has been allocated since the last garbage collection.
6375 If this portion is smaller than `gc-cons-threshold', this is ignored. */);
6376 Vgc_cons_percentage
= make_float (0.1);
6378 DEFVAR_INT ("pure-bytes-used", &pure_bytes_used
,
6379 doc
: /* Number of bytes of sharable Lisp data allocated so far. */);
6381 DEFVAR_INT ("cons-cells-consed", &cons_cells_consed
,
6382 doc
: /* Number of cons cells that have been consed so far. */);
6384 DEFVAR_INT ("floats-consed", &floats_consed
,
6385 doc
: /* Number of floats that have been consed so far. */);
6387 DEFVAR_INT ("vector-cells-consed", &vector_cells_consed
,
6388 doc
: /* Number of vector cells that have been consed so far. */);
6390 DEFVAR_INT ("symbols-consed", &symbols_consed
,
6391 doc
: /* Number of symbols that have been consed so far. */);
6393 DEFVAR_INT ("string-chars-consed", &string_chars_consed
,
6394 doc
: /* Number of string characters that have been consed so far. */);
6396 DEFVAR_INT ("misc-objects-consed", &misc_objects_consed
,
6397 doc
: /* Number of miscellaneous objects that have been consed so far. */);
6399 DEFVAR_INT ("intervals-consed", &intervals_consed
,
6400 doc
: /* Number of intervals that have been consed so far. */);
6402 DEFVAR_INT ("strings-consed", &strings_consed
,
6403 doc
: /* Number of strings that have been consed so far. */);
6405 DEFVAR_LISP ("purify-flag", &Vpurify_flag
,
6406 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
6407 This means that certain objects should be allocated in shared (pure) space. */);
6409 DEFVAR_BOOL ("garbage-collection-messages", &garbage_collection_messages
,
6410 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
6411 garbage_collection_messages
= 0;
6413 DEFVAR_LISP ("post-gc-hook", &Vpost_gc_hook
,
6414 doc
: /* Hook run after garbage collection has finished. */);
6415 Vpost_gc_hook
= Qnil
;
6416 Qpost_gc_hook
= intern ("post-gc-hook");
6417 staticpro (&Qpost_gc_hook
);
6419 DEFVAR_LISP ("memory-signal-data", &Vmemory_signal_data
,
6420 doc
: /* Precomputed `signal' argument for memory-full error. */);
6421 /* We build this in advance because if we wait until we need it, we might
6422 not be able to allocate the memory to hold it. */
6425 build_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"));
6427 DEFVAR_LISP ("memory-full", &Vmemory_full
,
6428 doc
: /* Non-nil means Emacs cannot get much more Lisp memory. */);
6429 Vmemory_full
= Qnil
;
6431 staticpro (&Qgc_cons_threshold
);
6432 Qgc_cons_threshold
= intern ("gc-cons-threshold");
6434 staticpro (&Qchar_table_extra_slots
);
6435 Qchar_table_extra_slots
= intern ("char-table-extra-slots");
6437 DEFVAR_LISP ("gc-elapsed", &Vgc_elapsed
,
6438 doc
: /* Accumulated time elapsed in garbage collections.
6439 The time is in seconds as a floating point value. */);
6440 DEFVAR_INT ("gcs-done", &gcs_done
,
6441 doc
: /* Accumulated number of garbage collections done. */);
6446 defsubr (&Smake_byte_code
);
6447 defsubr (&Smake_list
);
6448 defsubr (&Smake_vector
);
6449 defsubr (&Smake_char_table
);
6450 defsubr (&Smake_string
);
6451 defsubr (&Smake_bool_vector
);
6452 defsubr (&Smake_symbol
);
6453 defsubr (&Smake_marker
);
6454 defsubr (&Spurecopy
);
6455 defsubr (&Sgarbage_collect
);
6456 defsubr (&Smemory_limit
);
6457 defsubr (&Smemory_use_counts
);
6459 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
6460 defsubr (&Sgc_status
);
6464 /* arch-tag: 6695ca10-e3c5-4c2c-8bc3-ed26a7dda857
6465 (do not change this comment) */