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, 2009, 2010
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 of the License, or
11 (at your option) any later version.
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. If not, see <http://www.gnu.org/licenses/>. */
23 #include <limits.h> /* For CHAR_BIT. */
32 #ifdef HAVE_GTK_AND_PTHREAD
36 /* This file is part of the core Lisp implementation, and thus must
37 deal with the real data structures. If the Lisp implementation is
38 replaced, this file likely will not be used. */
40 #undef HIDE_LISP_IMPLEMENTATION
43 #include "intervals.h"
49 #include "blockinput.h"
50 #include "character.h"
51 #include "syssignal.h"
52 #include "termhooks.h" /* For struct terminal. */
55 /* GC_MALLOC_CHECK defined means perform validity checks of malloc'd
56 memory. Can do this only if using gmalloc.c. */
58 #if defined SYSTEM_MALLOC || defined DOUG_LEA_MALLOC
59 #undef GC_MALLOC_CHECK
65 extern POINTER_TYPE
*sbrk ();
80 #ifdef DOUG_LEA_MALLOC
83 /* malloc.h #defines this as size_t, at least in glibc2. */
84 #ifndef __malloc_size_t
85 #define __malloc_size_t int
88 /* Specify maximum number of areas to mmap. It would be nice to use a
89 value that explicitly means "no limit". */
91 #define MMAP_MAX_AREAS 100000000
93 #else /* not DOUG_LEA_MALLOC */
95 /* The following come from gmalloc.c. */
97 #define __malloc_size_t size_t
98 extern __malloc_size_t _bytes_used
;
99 extern __malloc_size_t __malloc_extra_blocks
;
101 #endif /* not DOUG_LEA_MALLOC */
103 #if ! defined (SYSTEM_MALLOC) && defined (HAVE_GTK_AND_PTHREAD)
105 /* When GTK uses the file chooser dialog, different backends can be loaded
106 dynamically. One such a backend is the Gnome VFS backend that gets loaded
107 if you run Gnome. That backend creates several threads and also allocates
110 If Emacs sets malloc hooks (! SYSTEM_MALLOC) and the emacs_blocked_*
111 functions below are called from malloc, there is a chance that one
112 of these threads preempts the Emacs main thread and the hook variables
113 end up in an inconsistent state. So we have a mutex to prevent that (note
114 that the backend handles concurrent access to malloc within its own threads
115 but Emacs code running in the main thread is not included in that control).
117 When UNBLOCK_INPUT is called, reinvoke_input_signal may be called. If this
118 happens in one of the backend threads we will have two threads that tries
119 to run Emacs code at once, and the code is not prepared for that.
120 To prevent that, we only call BLOCK/UNBLOCK from the main thread. */
122 static pthread_mutex_t alloc_mutex
;
124 #define BLOCK_INPUT_ALLOC \
127 if (pthread_equal (pthread_self (), main_thread)) \
129 pthread_mutex_lock (&alloc_mutex); \
132 #define UNBLOCK_INPUT_ALLOC \
135 pthread_mutex_unlock (&alloc_mutex); \
136 if (pthread_equal (pthread_self (), main_thread)) \
141 #else /* SYSTEM_MALLOC || not HAVE_GTK_AND_PTHREAD */
143 #define BLOCK_INPUT_ALLOC BLOCK_INPUT
144 #define UNBLOCK_INPUT_ALLOC UNBLOCK_INPUT
146 #endif /* SYSTEM_MALLOC || not HAVE_GTK_AND_PTHREAD */
148 /* Value of _bytes_used, when spare_memory was freed. */
150 static __malloc_size_t bytes_used_when_full
;
152 static __malloc_size_t bytes_used_when_reconsidered
;
154 /* Mark, unmark, query mark bit of a Lisp string. S must be a pointer
155 to a struct Lisp_String. */
157 #define MARK_STRING(S) ((S)->size |= ARRAY_MARK_FLAG)
158 #define UNMARK_STRING(S) ((S)->size &= ~ARRAY_MARK_FLAG)
159 #define STRING_MARKED_P(S) (((S)->size & ARRAY_MARK_FLAG) != 0)
161 #define VECTOR_MARK(V) ((V)->size |= ARRAY_MARK_FLAG)
162 #define VECTOR_UNMARK(V) ((V)->size &= ~ARRAY_MARK_FLAG)
163 #define VECTOR_MARKED_P(V) (((V)->size & ARRAY_MARK_FLAG) != 0)
165 /* Value is the number of bytes/chars of S, a pointer to a struct
166 Lisp_String. This must be used instead of STRING_BYTES (S) or
167 S->size during GC, because S->size contains the mark bit for
170 #define GC_STRING_BYTES(S) (STRING_BYTES (S))
171 #define GC_STRING_CHARS(S) ((S)->size & ~ARRAY_MARK_FLAG)
173 /* Number of bytes of consing done since the last gc. */
175 int consing_since_gc
;
177 /* Count the amount of consing of various sorts of space. */
179 EMACS_INT cons_cells_consed
;
180 EMACS_INT floats_consed
;
181 EMACS_INT vector_cells_consed
;
182 EMACS_INT symbols_consed
;
183 EMACS_INT string_chars_consed
;
184 EMACS_INT misc_objects_consed
;
185 EMACS_INT intervals_consed
;
186 EMACS_INT strings_consed
;
188 /* Minimum number of bytes of consing since GC before next GC. */
190 EMACS_INT gc_cons_threshold
;
192 /* Similar minimum, computed from Vgc_cons_percentage. */
194 EMACS_INT gc_relative_threshold
;
196 static Lisp_Object Vgc_cons_percentage
;
198 /* Minimum number of bytes of consing since GC before next GC,
199 when memory is full. */
201 EMACS_INT memory_full_cons_threshold
;
203 /* Nonzero during GC. */
207 /* Nonzero means abort if try to GC.
208 This is for code which is written on the assumption that
209 no GC will happen, so as to verify that assumption. */
213 /* Nonzero means display messages at beginning and end of GC. */
215 int garbage_collection_messages
;
217 /* Number of live and free conses etc. */
219 static int total_conses
, total_markers
, total_symbols
, total_vector_size
;
220 static int total_free_conses
, total_free_markers
, total_free_symbols
;
221 static int total_free_floats
, total_floats
;
223 /* Points to memory space allocated as "spare", to be freed if we run
224 out of memory. We keep one large block, four cons-blocks, and
225 two string blocks. */
227 static char *spare_memory
[7];
229 /* Amount of spare memory to keep in large reserve block. */
231 #define SPARE_MEMORY (1 << 14)
233 /* Number of extra blocks malloc should get when it needs more core. */
235 static int malloc_hysteresis
;
237 /* Non-nil means defun should do purecopy on the function definition. */
239 Lisp_Object Vpurify_flag
;
241 /* Non-nil means we are handling a memory-full error. */
243 Lisp_Object Vmemory_full
;
245 /* Initialize it to a nonzero value to force it into data space
246 (rather than bss space). That way unexec will remap it into text
247 space (pure), on some systems. We have not implemented the
248 remapping on more recent systems because this is less important
249 nowadays than in the days of small memories and timesharing. */
251 EMACS_INT pure
[(PURESIZE
+ sizeof (EMACS_INT
) - 1) / sizeof (EMACS_INT
)] = {1,};
252 #define PUREBEG (char *) pure
254 /* Pointer to the pure area, and its size. */
256 static char *purebeg
;
257 static size_t pure_size
;
259 /* Number of bytes of pure storage used before pure storage overflowed.
260 If this is non-zero, this implies that an overflow occurred. */
262 static size_t pure_bytes_used_before_overflow
;
264 /* Value is non-zero if P points into pure space. */
266 #define PURE_POINTER_P(P) \
267 (((PNTR_COMPARISON_TYPE) (P) \
268 < (PNTR_COMPARISON_TYPE) ((char *) purebeg + pure_size)) \
269 && ((PNTR_COMPARISON_TYPE) (P) \
270 >= (PNTR_COMPARISON_TYPE) purebeg))
272 /* Total number of bytes allocated in pure storage. */
274 EMACS_INT pure_bytes_used
;
276 /* Index in pure at which next pure Lisp object will be allocated.. */
278 static EMACS_INT pure_bytes_used_lisp
;
280 /* Number of bytes allocated for non-Lisp objects in pure storage. */
282 static EMACS_INT pure_bytes_used_non_lisp
;
284 /* If nonzero, this is a warning delivered by malloc and not yet
287 const char *pending_malloc_warning
;
289 /* Pre-computed signal argument for use when memory is exhausted. */
291 Lisp_Object Vmemory_signal_data
;
293 /* Maximum amount of C stack to save when a GC happens. */
295 #ifndef MAX_SAVE_STACK
296 #define MAX_SAVE_STACK 16000
299 /* Buffer in which we save a copy of the C stack at each GC. */
301 static char *stack_copy
;
302 static int stack_copy_size
;
304 /* Non-zero means ignore malloc warnings. Set during initialization.
305 Currently not used. */
307 static int ignore_warnings
;
309 Lisp_Object Qgc_cons_threshold
, Qchar_table_extra_slots
;
311 /* Hook run after GC has finished. */
313 Lisp_Object Vpost_gc_hook
, Qpost_gc_hook
;
315 Lisp_Object Vgc_elapsed
; /* accumulated elapsed time in GC */
316 EMACS_INT gcs_done
; /* accumulated GCs */
318 static void mark_buffer (Lisp_Object
);
319 static void mark_terminals (void);
320 extern void mark_kboards (void);
321 extern void mark_ttys (void);
322 extern void mark_backtrace (void);
323 static void gc_sweep (void);
324 static void mark_glyph_matrix (struct glyph_matrix
*);
325 static void mark_face_cache (struct face_cache
*);
327 #ifdef HAVE_WINDOW_SYSTEM
328 extern void mark_fringe_data (void);
329 #endif /* HAVE_WINDOW_SYSTEM */
331 static struct Lisp_String
*allocate_string (void);
332 static void compact_small_strings (void);
333 static void free_large_strings (void);
334 static void sweep_strings (void);
336 extern int message_enable_multibyte
;
338 /* When scanning the C stack for live Lisp objects, Emacs keeps track
339 of what memory allocated via lisp_malloc is intended for what
340 purpose. This enumeration specifies the type of memory. */
351 /* We used to keep separate mem_types for subtypes of vectors such as
352 process, hash_table, frame, terminal, and window, but we never made
353 use of the distinction, so it only caused source-code complexity
354 and runtime slowdown. Minor but pointless. */
358 static POINTER_TYPE
*lisp_align_malloc (size_t, enum mem_type
);
359 static POINTER_TYPE
*lisp_malloc (size_t, enum mem_type
);
360 void refill_memory_reserve (void);
363 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
365 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
366 #include <stdio.h> /* For fprintf. */
369 /* A unique object in pure space used to make some Lisp objects
370 on free lists recognizable in O(1). */
372 static Lisp_Object Vdead
;
374 #ifdef GC_MALLOC_CHECK
376 enum mem_type allocated_mem_type
;
377 static int dont_register_blocks
;
379 #endif /* GC_MALLOC_CHECK */
381 /* A node in the red-black tree describing allocated memory containing
382 Lisp data. Each such block is recorded with its start and end
383 address when it is allocated, and removed from the tree when it
386 A red-black tree is a balanced binary tree with the following
389 1. Every node is either red or black.
390 2. Every leaf is black.
391 3. If a node is red, then both of its children are black.
392 4. Every simple path from a node to a descendant leaf contains
393 the same number of black nodes.
394 5. The root is always black.
396 When nodes are inserted into the tree, or deleted from the tree,
397 the tree is "fixed" so that these properties are always true.
399 A red-black tree with N internal nodes has height at most 2
400 log(N+1). Searches, insertions and deletions are done in O(log N).
401 Please see a text book about data structures for a detailed
402 description of red-black trees. Any book worth its salt should
407 /* Children of this node. These pointers are never NULL. When there
408 is no child, the value is MEM_NIL, which points to a dummy node. */
409 struct mem_node
*left
, *right
;
411 /* The parent of this node. In the root node, this is NULL. */
412 struct mem_node
*parent
;
414 /* Start and end of allocated region. */
418 enum {MEM_BLACK
, MEM_RED
} color
;
424 /* Base address of stack. Set in main. */
426 Lisp_Object
*stack_base
;
428 /* Root of the tree describing allocated Lisp memory. */
430 static struct mem_node
*mem_root
;
432 /* Lowest and highest known address in the heap. */
434 static void *min_heap_address
, *max_heap_address
;
436 /* Sentinel node of the tree. */
438 static struct mem_node mem_z
;
439 #define MEM_NIL &mem_z
441 static struct Lisp_Vector
*allocate_vectorlike (EMACS_INT
);
442 static void lisp_free (POINTER_TYPE
*);
443 static void mark_stack (void);
444 static int live_vector_p (struct mem_node
*, void *);
445 static int live_buffer_p (struct mem_node
*, void *);
446 static int live_string_p (struct mem_node
*, void *);
447 static int live_cons_p (struct mem_node
*, void *);
448 static int live_symbol_p (struct mem_node
*, void *);
449 static int live_float_p (struct mem_node
*, void *);
450 static int live_misc_p (struct mem_node
*, void *);
451 static void mark_maybe_object (Lisp_Object
);
452 static void mark_memory (void *, void *, int);
453 static void mem_init (void);
454 static struct mem_node
*mem_insert (void *, void *, enum mem_type
);
455 static void mem_insert_fixup (struct mem_node
*);
456 static void mem_rotate_left (struct mem_node
*);
457 static void mem_rotate_right (struct mem_node
*);
458 static void mem_delete (struct mem_node
*);
459 static void mem_delete_fixup (struct mem_node
*);
460 static INLINE
struct mem_node
*mem_find (void *);
463 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
464 static void check_gcpros (void);
467 #endif /* GC_MARK_STACK || GC_MALLOC_CHECK */
469 /* Recording what needs to be marked for gc. */
471 struct gcpro
*gcprolist
;
473 /* Addresses of staticpro'd variables. Initialize it to a nonzero
474 value; otherwise some compilers put it into BSS. */
476 #define NSTATICS 0x640
477 static Lisp_Object
*staticvec
[NSTATICS
] = {&Vpurify_flag
};
479 /* Index of next unused slot in staticvec. */
481 static int staticidx
= 0;
483 static POINTER_TYPE
*pure_alloc (size_t, int);
486 /* Value is SZ rounded up to the next multiple of ALIGNMENT.
487 ALIGNMENT must be a power of 2. */
489 #define ALIGN(ptr, ALIGNMENT) \
490 ((POINTER_TYPE *) ((((EMACS_UINT)(ptr)) + (ALIGNMENT) - 1) \
491 & ~((ALIGNMENT) - 1)))
495 /************************************************************************
497 ************************************************************************/
499 /* Function malloc calls this if it finds we are near exhausting storage. */
502 malloc_warning (const char *str
)
504 pending_malloc_warning
= str
;
508 /* Display an already-pending malloc warning. */
511 display_malloc_warning (void)
513 call3 (intern ("display-warning"),
515 build_string (pending_malloc_warning
),
516 intern ("emergency"));
517 pending_malloc_warning
= 0;
521 #ifdef DOUG_LEA_MALLOC
522 # define BYTES_USED (mallinfo ().uordblks)
524 # define BYTES_USED _bytes_used
527 /* Called if we can't allocate relocatable space for a buffer. */
530 buffer_memory_full (void)
532 /* If buffers use the relocating allocator, no need to free
533 spare_memory, because we may have plenty of malloc space left
534 that we could get, and if we don't, the malloc that fails will
535 itself cause spare_memory to be freed. If buffers don't use the
536 relocating allocator, treat this like any other failing
543 /* This used to call error, but if we've run out of memory, we could
544 get infinite recursion trying to build the string. */
545 xsignal (Qnil
, Vmemory_signal_data
);
549 #ifdef XMALLOC_OVERRUN_CHECK
551 /* Check for overrun in malloc'ed buffers by wrapping a 16 byte header
552 and a 16 byte trailer around each block.
554 The header consists of 12 fixed bytes + a 4 byte integer contaning the
555 original block size, while the trailer consists of 16 fixed bytes.
557 The header is used to detect whether this block has been allocated
558 through these functions -- as it seems that some low-level libc
559 functions may bypass the malloc hooks.
563 #define XMALLOC_OVERRUN_CHECK_SIZE 16
565 static char xmalloc_overrun_check_header
[XMALLOC_OVERRUN_CHECK_SIZE
-4] =
566 { 0x9a, 0x9b, 0xae, 0xaf,
567 0xbf, 0xbe, 0xce, 0xcf,
568 0xea, 0xeb, 0xec, 0xed };
570 static char xmalloc_overrun_check_trailer
[XMALLOC_OVERRUN_CHECK_SIZE
] =
571 { 0xaa, 0xab, 0xac, 0xad,
572 0xba, 0xbb, 0xbc, 0xbd,
573 0xca, 0xcb, 0xcc, 0xcd,
574 0xda, 0xdb, 0xdc, 0xdd };
576 /* Macros to insert and extract the block size in the header. */
578 #define XMALLOC_PUT_SIZE(ptr, size) \
579 (ptr[-1] = (size & 0xff), \
580 ptr[-2] = ((size >> 8) & 0xff), \
581 ptr[-3] = ((size >> 16) & 0xff), \
582 ptr[-4] = ((size >> 24) & 0xff))
584 #define XMALLOC_GET_SIZE(ptr) \
585 (size_t)((unsigned)(ptr[-1]) | \
586 ((unsigned)(ptr[-2]) << 8) | \
587 ((unsigned)(ptr[-3]) << 16) | \
588 ((unsigned)(ptr[-4]) << 24))
591 /* The call depth in overrun_check functions. For example, this might happen:
593 overrun_check_malloc()
594 -> malloc -> (via hook)_-> emacs_blocked_malloc
595 -> overrun_check_malloc
596 call malloc (hooks are NULL, so real malloc is called).
597 malloc returns 10000.
598 add overhead, return 10016.
599 <- (back in overrun_check_malloc)
600 add overhead again, return 10032
601 xmalloc returns 10032.
606 overrun_check_free(10032)
608 free(10016) <- crash, because 10000 is the original pointer. */
610 static int check_depth
;
612 /* Like malloc, but wraps allocated block with header and trailer. */
615 overrun_check_malloc (size
)
618 register unsigned char *val
;
619 size_t overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_SIZE
*2 : 0;
621 val
= (unsigned char *) malloc (size
+ overhead
);
622 if (val
&& check_depth
== 1)
624 memcpy (val
, xmalloc_overrun_check_header
,
625 XMALLOC_OVERRUN_CHECK_SIZE
- 4);
626 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
627 XMALLOC_PUT_SIZE(val
, size
);
628 memcpy (val
+ size
, xmalloc_overrun_check_trailer
,
629 XMALLOC_OVERRUN_CHECK_SIZE
);
632 return (POINTER_TYPE
*)val
;
636 /* Like realloc, but checks old block for overrun, and wraps new block
637 with header and trailer. */
640 overrun_check_realloc (block
, size
)
644 register unsigned char *val
= (unsigned char *)block
;
645 size_t overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_SIZE
*2 : 0;
649 && memcmp (xmalloc_overrun_check_header
,
650 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
651 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
653 size_t osize
= XMALLOC_GET_SIZE (val
);
654 if (memcmp (xmalloc_overrun_check_trailer
, val
+ osize
,
655 XMALLOC_OVERRUN_CHECK_SIZE
))
657 memset (val
+ osize
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
658 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
659 memset (val
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
662 val
= (unsigned char *) realloc ((POINTER_TYPE
*)val
, size
+ overhead
);
664 if (val
&& check_depth
== 1)
666 memcpy (val
, xmalloc_overrun_check_header
,
667 XMALLOC_OVERRUN_CHECK_SIZE
- 4);
668 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
669 XMALLOC_PUT_SIZE(val
, size
);
670 memcpy (val
+ size
, xmalloc_overrun_check_trailer
,
671 XMALLOC_OVERRUN_CHECK_SIZE
);
674 return (POINTER_TYPE
*)val
;
677 /* Like free, but checks block for overrun. */
680 overrun_check_free (block
)
683 unsigned char *val
= (unsigned char *)block
;
688 && memcmp (xmalloc_overrun_check_header
,
689 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
690 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
692 size_t osize
= XMALLOC_GET_SIZE (val
);
693 if (memcmp (xmalloc_overrun_check_trailer
, val
+ osize
,
694 XMALLOC_OVERRUN_CHECK_SIZE
))
696 #ifdef XMALLOC_CLEAR_FREE_MEMORY
697 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
698 memset (val
, 0xff, osize
+ XMALLOC_OVERRUN_CHECK_SIZE
*2);
700 memset (val
+ osize
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
701 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
702 memset (val
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
713 #define malloc overrun_check_malloc
714 #define realloc overrun_check_realloc
715 #define free overrun_check_free
719 /* When using SYNC_INPUT, we don't call malloc from a signal handler, so
720 there's no need to block input around malloc. */
721 #define MALLOC_BLOCK_INPUT ((void)0)
722 #define MALLOC_UNBLOCK_INPUT ((void)0)
724 #define MALLOC_BLOCK_INPUT BLOCK_INPUT
725 #define MALLOC_UNBLOCK_INPUT UNBLOCK_INPUT
728 /* Like malloc but check for no memory and block interrupt input.. */
731 xmalloc (size_t size
)
733 register POINTER_TYPE
*val
;
736 val
= (POINTER_TYPE
*) malloc (size
);
737 MALLOC_UNBLOCK_INPUT
;
745 /* Like realloc but check for no memory and block interrupt input.. */
748 xrealloc (POINTER_TYPE
*block
, size_t size
)
750 register POINTER_TYPE
*val
;
753 /* We must call malloc explicitly when BLOCK is 0, since some
754 reallocs don't do this. */
756 val
= (POINTER_TYPE
*) malloc (size
);
758 val
= (POINTER_TYPE
*) realloc (block
, size
);
759 MALLOC_UNBLOCK_INPUT
;
761 if (!val
&& size
) memory_full ();
766 /* Like free but block interrupt input. */
769 xfree (POINTER_TYPE
*block
)
775 MALLOC_UNBLOCK_INPUT
;
776 /* We don't call refill_memory_reserve here
777 because that duplicates doing so in emacs_blocked_free
778 and the criterion should go there. */
782 /* Like strdup, but uses xmalloc. */
785 xstrdup (const char *s
)
787 size_t len
= strlen (s
) + 1;
788 char *p
= (char *) xmalloc (len
);
794 /* Unwind for SAFE_ALLOCA */
797 safe_alloca_unwind (Lisp_Object arg
)
799 register struct Lisp_Save_Value
*p
= XSAVE_VALUE (arg
);
809 /* Like malloc but used for allocating Lisp data. NBYTES is the
810 number of bytes to allocate, TYPE describes the intended use of the
811 allcated memory block (for strings, for conses, ...). */
814 static void *lisp_malloc_loser
;
817 static POINTER_TYPE
*
818 lisp_malloc (size_t nbytes
, enum mem_type type
)
824 #ifdef GC_MALLOC_CHECK
825 allocated_mem_type
= type
;
828 val
= (void *) malloc (nbytes
);
831 /* If the memory just allocated cannot be addressed thru a Lisp
832 object's pointer, and it needs to be,
833 that's equivalent to running out of memory. */
834 if (val
&& type
!= MEM_TYPE_NON_LISP
)
837 XSETCONS (tem
, (char *) val
+ nbytes
- 1);
838 if ((char *) XCONS (tem
) != (char *) val
+ nbytes
- 1)
840 lisp_malloc_loser
= val
;
847 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
848 if (val
&& type
!= MEM_TYPE_NON_LISP
)
849 mem_insert (val
, (char *) val
+ nbytes
, type
);
852 MALLOC_UNBLOCK_INPUT
;
858 /* Free BLOCK. This must be called to free memory allocated with a
859 call to lisp_malloc. */
862 lisp_free (POINTER_TYPE
*block
)
866 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
867 mem_delete (mem_find (block
));
869 MALLOC_UNBLOCK_INPUT
;
872 /* Allocation of aligned blocks of memory to store Lisp data. */
873 /* The entry point is lisp_align_malloc which returns blocks of at most */
874 /* BLOCK_BYTES and guarantees they are aligned on a BLOCK_ALIGN boundary. */
876 /* Use posix_memalloc if the system has it and we're using the system's
877 malloc (because our gmalloc.c routines don't have posix_memalign although
878 its memalloc could be used). */
879 #if defined (HAVE_POSIX_MEMALIGN) && defined (SYSTEM_MALLOC)
880 #define USE_POSIX_MEMALIGN 1
883 /* BLOCK_ALIGN has to be a power of 2. */
884 #define BLOCK_ALIGN (1 << 10)
886 /* Padding to leave at the end of a malloc'd block. This is to give
887 malloc a chance to minimize the amount of memory wasted to alignment.
888 It should be tuned to the particular malloc library used.
889 On glibc-2.3.2, malloc never tries to align, so a padding of 0 is best.
890 posix_memalign on the other hand would ideally prefer a value of 4
891 because otherwise, there's 1020 bytes wasted between each ablocks.
892 In Emacs, testing shows that those 1020 can most of the time be
893 efficiently used by malloc to place other objects, so a value of 0 can
894 still preferable unless you have a lot of aligned blocks and virtually
896 #define BLOCK_PADDING 0
897 #define BLOCK_BYTES \
898 (BLOCK_ALIGN - sizeof (struct ablock *) - BLOCK_PADDING)
900 /* Internal data structures and constants. */
902 #define ABLOCKS_SIZE 16
904 /* An aligned block of memory. */
909 char payload
[BLOCK_BYTES
];
910 struct ablock
*next_free
;
912 /* `abase' is the aligned base of the ablocks. */
913 /* It is overloaded to hold the virtual `busy' field that counts
914 the number of used ablock in the parent ablocks.
915 The first ablock has the `busy' field, the others have the `abase'
916 field. To tell the difference, we assume that pointers will have
917 integer values larger than 2 * ABLOCKS_SIZE. The lowest bit of `busy'
918 is used to tell whether the real base of the parent ablocks is `abase'
919 (if not, the word before the first ablock holds a pointer to the
921 struct ablocks
*abase
;
922 /* The padding of all but the last ablock is unused. The padding of
923 the last ablock in an ablocks is not allocated. */
925 char padding
[BLOCK_PADDING
];
929 /* A bunch of consecutive aligned blocks. */
932 struct ablock blocks
[ABLOCKS_SIZE
];
935 /* Size of the block requested from malloc or memalign. */
936 #define ABLOCKS_BYTES (sizeof (struct ablocks) - BLOCK_PADDING)
938 #define ABLOCK_ABASE(block) \
939 (((unsigned long) (block)->abase) <= (1 + 2 * ABLOCKS_SIZE) \
940 ? (struct ablocks *)(block) \
943 /* Virtual `busy' field. */
944 #define ABLOCKS_BUSY(abase) ((abase)->blocks[0].abase)
946 /* Pointer to the (not necessarily aligned) malloc block. */
947 #ifdef USE_POSIX_MEMALIGN
948 #define ABLOCKS_BASE(abase) (abase)
950 #define ABLOCKS_BASE(abase) \
951 (1 & (long) ABLOCKS_BUSY (abase) ? abase : ((void**)abase)[-1])
954 /* The list of free ablock. */
955 static struct ablock
*free_ablock
;
957 /* Allocate an aligned block of nbytes.
958 Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be
959 smaller or equal to BLOCK_BYTES. */
960 static POINTER_TYPE
*
961 lisp_align_malloc (size_t nbytes
, enum mem_type type
)
964 struct ablocks
*abase
;
966 eassert (nbytes
<= BLOCK_BYTES
);
970 #ifdef GC_MALLOC_CHECK
971 allocated_mem_type
= type
;
977 EMACS_INT aligned
; /* int gets warning casting to 64-bit pointer. */
979 #ifdef DOUG_LEA_MALLOC
980 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
981 because mapped region contents are not preserved in
983 mallopt (M_MMAP_MAX
, 0);
986 #ifdef USE_POSIX_MEMALIGN
988 int err
= posix_memalign (&base
, BLOCK_ALIGN
, ABLOCKS_BYTES
);
994 base
= malloc (ABLOCKS_BYTES
);
995 abase
= ALIGN (base
, BLOCK_ALIGN
);
1000 MALLOC_UNBLOCK_INPUT
;
1004 aligned
= (base
== abase
);
1006 ((void**)abase
)[-1] = base
;
1008 #ifdef DOUG_LEA_MALLOC
1009 /* Back to a reasonable maximum of mmap'ed areas. */
1010 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1014 /* If the memory just allocated cannot be addressed thru a Lisp
1015 object's pointer, and it needs to be, that's equivalent to
1016 running out of memory. */
1017 if (type
!= MEM_TYPE_NON_LISP
)
1020 char *end
= (char *) base
+ ABLOCKS_BYTES
- 1;
1021 XSETCONS (tem
, end
);
1022 if ((char *) XCONS (tem
) != end
)
1024 lisp_malloc_loser
= base
;
1026 MALLOC_UNBLOCK_INPUT
;
1032 /* Initialize the blocks and put them on the free list.
1033 Is `base' was not properly aligned, we can't use the last block. */
1034 for (i
= 0; i
< (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1); i
++)
1036 abase
->blocks
[i
].abase
= abase
;
1037 abase
->blocks
[i
].x
.next_free
= free_ablock
;
1038 free_ablock
= &abase
->blocks
[i
];
1040 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (long) aligned
;
1042 eassert (0 == ((EMACS_UINT
)abase
) % BLOCK_ALIGN
);
1043 eassert (ABLOCK_ABASE (&abase
->blocks
[3]) == abase
); /* 3 is arbitrary */
1044 eassert (ABLOCK_ABASE (&abase
->blocks
[0]) == abase
);
1045 eassert (ABLOCKS_BASE (abase
) == base
);
1046 eassert (aligned
== (long) ABLOCKS_BUSY (abase
));
1049 abase
= ABLOCK_ABASE (free_ablock
);
1050 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (2 + (long) ABLOCKS_BUSY (abase
));
1052 free_ablock
= free_ablock
->x
.next_free
;
1054 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1055 if (val
&& type
!= MEM_TYPE_NON_LISP
)
1056 mem_insert (val
, (char *) val
+ nbytes
, type
);
1059 MALLOC_UNBLOCK_INPUT
;
1063 eassert (0 == ((EMACS_UINT
)val
) % BLOCK_ALIGN
);
1068 lisp_align_free (POINTER_TYPE
*block
)
1070 struct ablock
*ablock
= block
;
1071 struct ablocks
*abase
= ABLOCK_ABASE (ablock
);
1074 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1075 mem_delete (mem_find (block
));
1077 /* Put on free list. */
1078 ablock
->x
.next_free
= free_ablock
;
1079 free_ablock
= ablock
;
1080 /* Update busy count. */
1081 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (-2 + (long) ABLOCKS_BUSY (abase
));
1083 if (2 > (long) ABLOCKS_BUSY (abase
))
1084 { /* All the blocks are free. */
1085 int i
= 0, aligned
= (long) ABLOCKS_BUSY (abase
);
1086 struct ablock
**tem
= &free_ablock
;
1087 struct ablock
*atop
= &abase
->blocks
[aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1];
1091 if (*tem
>= (struct ablock
*) abase
&& *tem
< atop
)
1094 *tem
= (*tem
)->x
.next_free
;
1097 tem
= &(*tem
)->x
.next_free
;
1099 eassert ((aligned
& 1) == aligned
);
1100 eassert (i
== (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1));
1101 #ifdef USE_POSIX_MEMALIGN
1102 eassert ((unsigned long)ABLOCKS_BASE (abase
) % BLOCK_ALIGN
== 0);
1104 free (ABLOCKS_BASE (abase
));
1106 MALLOC_UNBLOCK_INPUT
;
1109 /* Return a new buffer structure allocated from the heap with
1110 a call to lisp_malloc. */
1113 allocate_buffer (void)
1116 = (struct buffer
*) lisp_malloc (sizeof (struct buffer
),
1118 b
->size
= sizeof (struct buffer
) / sizeof (EMACS_INT
);
1119 XSETPVECTYPE (b
, PVEC_BUFFER
);
1124 #ifndef SYSTEM_MALLOC
1126 /* Arranging to disable input signals while we're in malloc.
1128 This only works with GNU malloc. To help out systems which can't
1129 use GNU malloc, all the calls to malloc, realloc, and free
1130 elsewhere in the code should be inside a BLOCK_INPUT/UNBLOCK_INPUT
1131 pair; unfortunately, we have no idea what C library functions
1132 might call malloc, so we can't really protect them unless you're
1133 using GNU malloc. Fortunately, most of the major operating systems
1134 can use GNU malloc. */
1137 /* When using SYNC_INPUT, we don't call malloc from a signal handler, so
1138 there's no need to block input around malloc. */
1140 #ifndef DOUG_LEA_MALLOC
1141 extern void * (*__malloc_hook
) (size_t, const void *);
1142 extern void * (*__realloc_hook
) (void *, size_t, const void *);
1143 extern void (*__free_hook
) (void *, const void *);
1144 /* Else declared in malloc.h, perhaps with an extra arg. */
1145 #endif /* DOUG_LEA_MALLOC */
1146 static void * (*old_malloc_hook
) (size_t, const void *);
1147 static void * (*old_realloc_hook
) (void *, size_t, const void*);
1148 static void (*old_free_hook
) (void*, const void*);
1150 /* This function is used as the hook for free to call. */
1153 emacs_blocked_free (void *ptr
, const void *ptr2
)
1157 #ifdef GC_MALLOC_CHECK
1163 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1166 "Freeing `%p' which wasn't allocated with malloc\n", ptr
);
1171 /* fprintf (stderr, "free %p...%p (%p)\n", m->start, m->end, ptr); */
1175 #endif /* GC_MALLOC_CHECK */
1177 __free_hook
= old_free_hook
;
1180 /* If we released our reserve (due to running out of memory),
1181 and we have a fair amount free once again,
1182 try to set aside another reserve in case we run out once more. */
1183 if (! NILP (Vmemory_full
)
1184 /* Verify there is enough space that even with the malloc
1185 hysteresis this call won't run out again.
1186 The code here is correct as long as SPARE_MEMORY
1187 is substantially larger than the block size malloc uses. */
1188 && (bytes_used_when_full
1189 > ((bytes_used_when_reconsidered
= BYTES_USED
)
1190 + max (malloc_hysteresis
, 4) * SPARE_MEMORY
)))
1191 refill_memory_reserve ();
1193 __free_hook
= emacs_blocked_free
;
1194 UNBLOCK_INPUT_ALLOC
;
1198 /* This function is the malloc hook that Emacs uses. */
1201 emacs_blocked_malloc (size_t size
, const void *ptr
)
1206 __malloc_hook
= old_malloc_hook
;
1207 #ifdef DOUG_LEA_MALLOC
1208 /* Segfaults on my system. --lorentey */
1209 /* mallopt (M_TOP_PAD, malloc_hysteresis * 4096); */
1211 __malloc_extra_blocks
= malloc_hysteresis
;
1214 value
= (void *) malloc (size
);
1216 #ifdef GC_MALLOC_CHECK
1218 struct mem_node
*m
= mem_find (value
);
1221 fprintf (stderr
, "Malloc returned %p which is already in use\n",
1223 fprintf (stderr
, "Region in use is %p...%p, %u bytes, type %d\n",
1224 m
->start
, m
->end
, (char *) m
->end
- (char *) m
->start
,
1229 if (!dont_register_blocks
)
1231 mem_insert (value
, (char *) value
+ max (1, size
), allocated_mem_type
);
1232 allocated_mem_type
= MEM_TYPE_NON_LISP
;
1235 #endif /* GC_MALLOC_CHECK */
1237 __malloc_hook
= emacs_blocked_malloc
;
1238 UNBLOCK_INPUT_ALLOC
;
1240 /* fprintf (stderr, "%p malloc\n", value); */
1245 /* This function is the realloc hook that Emacs uses. */
1248 emacs_blocked_realloc (void *ptr
, size_t size
, const void *ptr2
)
1253 __realloc_hook
= old_realloc_hook
;
1255 #ifdef GC_MALLOC_CHECK
1258 struct mem_node
*m
= mem_find (ptr
);
1259 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1262 "Realloc of %p which wasn't allocated with malloc\n",
1270 /* fprintf (stderr, "%p -> realloc\n", ptr); */
1272 /* Prevent malloc from registering blocks. */
1273 dont_register_blocks
= 1;
1274 #endif /* GC_MALLOC_CHECK */
1276 value
= (void *) realloc (ptr
, size
);
1278 #ifdef GC_MALLOC_CHECK
1279 dont_register_blocks
= 0;
1282 struct mem_node
*m
= mem_find (value
);
1285 fprintf (stderr
, "Realloc returns memory that is already in use\n");
1289 /* Can't handle zero size regions in the red-black tree. */
1290 mem_insert (value
, (char *) value
+ max (size
, 1), MEM_TYPE_NON_LISP
);
1293 /* fprintf (stderr, "%p <- realloc\n", value); */
1294 #endif /* GC_MALLOC_CHECK */
1296 __realloc_hook
= emacs_blocked_realloc
;
1297 UNBLOCK_INPUT_ALLOC
;
1303 #ifdef HAVE_GTK_AND_PTHREAD
1304 /* Called from Fdump_emacs so that when the dumped Emacs starts, it has a
1305 normal malloc. Some thread implementations need this as they call
1306 malloc before main. The pthread_self call in BLOCK_INPUT_ALLOC then
1307 calls malloc because it is the first call, and we have an endless loop. */
1310 reset_malloc_hooks ()
1312 __free_hook
= old_free_hook
;
1313 __malloc_hook
= old_malloc_hook
;
1314 __realloc_hook
= old_realloc_hook
;
1316 #endif /* HAVE_GTK_AND_PTHREAD */
1319 /* Called from main to set up malloc to use our hooks. */
1322 uninterrupt_malloc (void)
1324 #ifdef HAVE_GTK_AND_PTHREAD
1325 #ifdef DOUG_LEA_MALLOC
1326 pthread_mutexattr_t attr
;
1328 /* GLIBC has a faster way to do this, but lets keep it portable.
1329 This is according to the Single UNIX Specification. */
1330 pthread_mutexattr_init (&attr
);
1331 pthread_mutexattr_settype (&attr
, PTHREAD_MUTEX_RECURSIVE
);
1332 pthread_mutex_init (&alloc_mutex
, &attr
);
1333 #else /* !DOUG_LEA_MALLOC */
1334 /* Some systems such as Solaris 2.6 don't have a recursive mutex,
1335 and the bundled gmalloc.c doesn't require it. */
1336 pthread_mutex_init (&alloc_mutex
, NULL
);
1337 #endif /* !DOUG_LEA_MALLOC */
1338 #endif /* HAVE_GTK_AND_PTHREAD */
1340 if (__free_hook
!= emacs_blocked_free
)
1341 old_free_hook
= __free_hook
;
1342 __free_hook
= emacs_blocked_free
;
1344 if (__malloc_hook
!= emacs_blocked_malloc
)
1345 old_malloc_hook
= __malloc_hook
;
1346 __malloc_hook
= emacs_blocked_malloc
;
1348 if (__realloc_hook
!= emacs_blocked_realloc
)
1349 old_realloc_hook
= __realloc_hook
;
1350 __realloc_hook
= emacs_blocked_realloc
;
1353 #endif /* not SYNC_INPUT */
1354 #endif /* not SYSTEM_MALLOC */
1358 /***********************************************************************
1360 ***********************************************************************/
1362 /* Number of intervals allocated in an interval_block structure.
1363 The 1020 is 1024 minus malloc overhead. */
1365 #define INTERVAL_BLOCK_SIZE \
1366 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
1368 /* Intervals are allocated in chunks in form of an interval_block
1371 struct interval_block
1373 /* Place `intervals' first, to preserve alignment. */
1374 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
1375 struct interval_block
*next
;
1378 /* Current interval block. Its `next' pointer points to older
1381 static struct interval_block
*interval_block
;
1383 /* Index in interval_block above of the next unused interval
1386 static int interval_block_index
;
1388 /* Number of free and live intervals. */
1390 static int total_free_intervals
, total_intervals
;
1392 /* List of free intervals. */
1394 INTERVAL interval_free_list
;
1396 /* Total number of interval blocks now in use. */
1398 static int n_interval_blocks
;
1401 /* Initialize interval allocation. */
1404 init_intervals (void)
1406 interval_block
= NULL
;
1407 interval_block_index
= INTERVAL_BLOCK_SIZE
;
1408 interval_free_list
= 0;
1409 n_interval_blocks
= 0;
1413 /* Return a new interval. */
1416 make_interval (void)
1420 /* eassert (!handling_signal); */
1424 if (interval_free_list
)
1426 val
= interval_free_list
;
1427 interval_free_list
= INTERVAL_PARENT (interval_free_list
);
1431 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
1433 register struct interval_block
*newi
;
1435 newi
= (struct interval_block
*) lisp_malloc (sizeof *newi
,
1438 newi
->next
= interval_block
;
1439 interval_block
= newi
;
1440 interval_block_index
= 0;
1441 n_interval_blocks
++;
1443 val
= &interval_block
->intervals
[interval_block_index
++];
1446 MALLOC_UNBLOCK_INPUT
;
1448 consing_since_gc
+= sizeof (struct interval
);
1450 RESET_INTERVAL (val
);
1456 /* Mark Lisp objects in interval I. */
1459 mark_interval (register INTERVAL i
, Lisp_Object dummy
)
1461 eassert (!i
->gcmarkbit
); /* Intervals are never shared. */
1463 mark_object (i
->plist
);
1467 /* Mark the interval tree rooted in TREE. Don't call this directly;
1468 use the macro MARK_INTERVAL_TREE instead. */
1471 mark_interval_tree (register INTERVAL tree
)
1473 /* No need to test if this tree has been marked already; this
1474 function is always called through the MARK_INTERVAL_TREE macro,
1475 which takes care of that. */
1477 traverse_intervals_noorder (tree
, mark_interval
, Qnil
);
1481 /* Mark the interval tree rooted in I. */
1483 #define MARK_INTERVAL_TREE(i) \
1485 if (!NULL_INTERVAL_P (i) && !i->gcmarkbit) \
1486 mark_interval_tree (i); \
1490 #define UNMARK_BALANCE_INTERVALS(i) \
1492 if (! NULL_INTERVAL_P (i)) \
1493 (i) = balance_intervals (i); \
1497 /* Number support. If USE_LISP_UNION_TYPE is in effect, we
1498 can't create number objects in macros. */
1506 obj
.s
.type
= Lisp_Int
;
1511 /***********************************************************************
1513 ***********************************************************************/
1515 /* Lisp_Strings are allocated in string_block structures. When a new
1516 string_block is allocated, all the Lisp_Strings it contains are
1517 added to a free-list string_free_list. When a new Lisp_String is
1518 needed, it is taken from that list. During the sweep phase of GC,
1519 string_blocks that are entirely free are freed, except two which
1522 String data is allocated from sblock structures. Strings larger
1523 than LARGE_STRING_BYTES, get their own sblock, data for smaller
1524 strings is sub-allocated out of sblocks of size SBLOCK_SIZE.
1526 Sblocks consist internally of sdata structures, one for each
1527 Lisp_String. The sdata structure points to the Lisp_String it
1528 belongs to. The Lisp_String points back to the `u.data' member of
1529 its sdata structure.
1531 When a Lisp_String is freed during GC, it is put back on
1532 string_free_list, and its `data' member and its sdata's `string'
1533 pointer is set to null. The size of the string is recorded in the
1534 `u.nbytes' member of the sdata. So, sdata structures that are no
1535 longer used, can be easily recognized, and it's easy to compact the
1536 sblocks of small strings which we do in compact_small_strings. */
1538 /* Size in bytes of an sblock structure used for small strings. This
1539 is 8192 minus malloc overhead. */
1541 #define SBLOCK_SIZE 8188
1543 /* Strings larger than this are considered large strings. String data
1544 for large strings is allocated from individual sblocks. */
1546 #define LARGE_STRING_BYTES 1024
1548 /* Structure describing string memory sub-allocated from an sblock.
1549 This is where the contents of Lisp strings are stored. */
1553 /* Back-pointer to the string this sdata belongs to. If null, this
1554 structure is free, and the NBYTES member of the union below
1555 contains the string's byte size (the same value that STRING_BYTES
1556 would return if STRING were non-null). If non-null, STRING_BYTES
1557 (STRING) is the size of the data, and DATA contains the string's
1559 struct Lisp_String
*string
;
1561 #ifdef GC_CHECK_STRING_BYTES
1564 unsigned char data
[1];
1566 #define SDATA_NBYTES(S) (S)->nbytes
1567 #define SDATA_DATA(S) (S)->data
1569 #else /* not GC_CHECK_STRING_BYTES */
1573 /* When STRING in non-null. */
1574 unsigned char data
[1];
1576 /* When STRING is null. */
1581 #define SDATA_NBYTES(S) (S)->u.nbytes
1582 #define SDATA_DATA(S) (S)->u.data
1584 #endif /* not GC_CHECK_STRING_BYTES */
1588 /* Structure describing a block of memory which is sub-allocated to
1589 obtain string data memory for strings. Blocks for small strings
1590 are of fixed size SBLOCK_SIZE. Blocks for large strings are made
1591 as large as needed. */
1596 struct sblock
*next
;
1598 /* Pointer to the next free sdata block. This points past the end
1599 of the sblock if there isn't any space left in this block. */
1600 struct sdata
*next_free
;
1602 /* Start of data. */
1603 struct sdata first_data
;
1606 /* Number of Lisp strings in a string_block structure. The 1020 is
1607 1024 minus malloc overhead. */
1609 #define STRING_BLOCK_SIZE \
1610 ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String))
1612 /* Structure describing a block from which Lisp_String structures
1617 /* Place `strings' first, to preserve alignment. */
1618 struct Lisp_String strings
[STRING_BLOCK_SIZE
];
1619 struct string_block
*next
;
1622 /* Head and tail of the list of sblock structures holding Lisp string
1623 data. We always allocate from current_sblock. The NEXT pointers
1624 in the sblock structures go from oldest_sblock to current_sblock. */
1626 static struct sblock
*oldest_sblock
, *current_sblock
;
1628 /* List of sblocks for large strings. */
1630 static struct sblock
*large_sblocks
;
1632 /* List of string_block structures, and how many there are. */
1634 static struct string_block
*string_blocks
;
1635 static int n_string_blocks
;
1637 /* Free-list of Lisp_Strings. */
1639 static struct Lisp_String
*string_free_list
;
1641 /* Number of live and free Lisp_Strings. */
1643 static int total_strings
, total_free_strings
;
1645 /* Number of bytes used by live strings. */
1647 static int total_string_size
;
1649 /* Given a pointer to a Lisp_String S which is on the free-list
1650 string_free_list, return a pointer to its successor in the
1653 #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S))
1655 /* Return a pointer to the sdata structure belonging to Lisp string S.
1656 S must be live, i.e. S->data must not be null. S->data is actually
1657 a pointer to the `u.data' member of its sdata structure; the
1658 structure starts at a constant offset in front of that. */
1660 #ifdef GC_CHECK_STRING_BYTES
1662 #define SDATA_OF_STRING(S) \
1663 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *) \
1664 - sizeof (EMACS_INT)))
1666 #else /* not GC_CHECK_STRING_BYTES */
1668 #define SDATA_OF_STRING(S) \
1669 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *)))
1671 #endif /* not GC_CHECK_STRING_BYTES */
1674 #ifdef GC_CHECK_STRING_OVERRUN
1676 /* We check for overrun in string data blocks by appending a small
1677 "cookie" after each allocated string data block, and check for the
1678 presence of this cookie during GC. */
1680 #define GC_STRING_OVERRUN_COOKIE_SIZE 4
1681 static char string_overrun_cookie
[GC_STRING_OVERRUN_COOKIE_SIZE
] =
1682 { 0xde, 0xad, 0xbe, 0xef };
1685 #define GC_STRING_OVERRUN_COOKIE_SIZE 0
1688 /* Value is the size of an sdata structure large enough to hold NBYTES
1689 bytes of string data. The value returned includes a terminating
1690 NUL byte, the size of the sdata structure, and padding. */
1692 #ifdef GC_CHECK_STRING_BYTES
1694 #define SDATA_SIZE(NBYTES) \
1695 ((sizeof (struct Lisp_String *) \
1697 + sizeof (EMACS_INT) \
1698 + sizeof (EMACS_INT) - 1) \
1699 & ~(sizeof (EMACS_INT) - 1))
1701 #else /* not GC_CHECK_STRING_BYTES */
1703 #define SDATA_SIZE(NBYTES) \
1704 ((sizeof (struct Lisp_String *) \
1706 + sizeof (EMACS_INT) - 1) \
1707 & ~(sizeof (EMACS_INT) - 1))
1709 #endif /* not GC_CHECK_STRING_BYTES */
1711 /* Extra bytes to allocate for each string. */
1713 #define GC_STRING_EXTRA (GC_STRING_OVERRUN_COOKIE_SIZE)
1715 /* Initialize string allocation. Called from init_alloc_once. */
1720 total_strings
= total_free_strings
= total_string_size
= 0;
1721 oldest_sblock
= current_sblock
= large_sblocks
= NULL
;
1722 string_blocks
= NULL
;
1723 n_string_blocks
= 0;
1724 string_free_list
= NULL
;
1725 empty_unibyte_string
= make_pure_string ("", 0, 0, 0);
1726 empty_multibyte_string
= make_pure_string ("", 0, 0, 1);
1730 #ifdef GC_CHECK_STRING_BYTES
1732 static int check_string_bytes_count
;
1734 static void check_string_bytes (int);
1735 static void check_sblock (struct sblock
*);
1737 #define CHECK_STRING_BYTES(S) STRING_BYTES (S)
1740 /* Like GC_STRING_BYTES, but with debugging check. */
1744 struct Lisp_String
*s
;
1746 int nbytes
= (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1747 if (!PURE_POINTER_P (s
)
1749 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1754 /* Check validity of Lisp strings' string_bytes member in B. */
1760 struct sdata
*from
, *end
, *from_end
;
1764 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1766 /* Compute the next FROM here because copying below may
1767 overwrite data we need to compute it. */
1770 /* Check that the string size recorded in the string is the
1771 same as the one recorded in the sdata structure. */
1773 CHECK_STRING_BYTES (from
->string
);
1776 nbytes
= GC_STRING_BYTES (from
->string
);
1778 nbytes
= SDATA_NBYTES (from
);
1780 nbytes
= SDATA_SIZE (nbytes
);
1781 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
1786 /* Check validity of Lisp strings' string_bytes member. ALL_P
1787 non-zero means check all strings, otherwise check only most
1788 recently allocated strings. Used for hunting a bug. */
1791 check_string_bytes (all_p
)
1798 for (b
= large_sblocks
; b
; b
= b
->next
)
1800 struct Lisp_String
*s
= b
->first_data
.string
;
1802 CHECK_STRING_BYTES (s
);
1805 for (b
= oldest_sblock
; b
; b
= b
->next
)
1809 check_sblock (current_sblock
);
1812 #endif /* GC_CHECK_STRING_BYTES */
1814 #ifdef GC_CHECK_STRING_FREE_LIST
1816 /* Walk through the string free list looking for bogus next pointers.
1817 This may catch buffer overrun from a previous string. */
1820 check_string_free_list ()
1822 struct Lisp_String
*s
;
1824 /* Pop a Lisp_String off the free-list. */
1825 s
= string_free_list
;
1828 if ((unsigned)s
< 1024)
1830 s
= NEXT_FREE_LISP_STRING (s
);
1834 #define check_string_free_list()
1837 /* Return a new Lisp_String. */
1839 static struct Lisp_String
*
1840 allocate_string (void)
1842 struct Lisp_String
*s
;
1844 /* eassert (!handling_signal); */
1848 /* If the free-list is empty, allocate a new string_block, and
1849 add all the Lisp_Strings in it to the free-list. */
1850 if (string_free_list
== NULL
)
1852 struct string_block
*b
;
1855 b
= (struct string_block
*) lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1856 memset (b
, 0, sizeof *b
);
1857 b
->next
= string_blocks
;
1861 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1864 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1865 string_free_list
= s
;
1868 total_free_strings
+= STRING_BLOCK_SIZE
;
1871 check_string_free_list ();
1873 /* Pop a Lisp_String off the free-list. */
1874 s
= string_free_list
;
1875 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1877 MALLOC_UNBLOCK_INPUT
;
1879 /* Probably not strictly necessary, but play it safe. */
1880 memset (s
, 0, sizeof *s
);
1882 --total_free_strings
;
1885 consing_since_gc
+= sizeof *s
;
1887 #ifdef GC_CHECK_STRING_BYTES
1888 if (!noninteractive
)
1890 if (++check_string_bytes_count
== 200)
1892 check_string_bytes_count
= 0;
1893 check_string_bytes (1);
1896 check_string_bytes (0);
1898 #endif /* GC_CHECK_STRING_BYTES */
1904 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1905 plus a NUL byte at the end. Allocate an sdata structure for S, and
1906 set S->data to its `u.data' member. Store a NUL byte at the end of
1907 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1908 S->data if it was initially non-null. */
1911 allocate_string_data (struct Lisp_String
*s
, int nchars
, int nbytes
)
1913 struct sdata
*data
, *old_data
;
1915 int needed
, old_nbytes
;
1917 /* Determine the number of bytes needed to store NBYTES bytes
1919 needed
= SDATA_SIZE (nbytes
);
1920 old_data
= s
->data
? SDATA_OF_STRING (s
) : NULL
;
1921 old_nbytes
= GC_STRING_BYTES (s
);
1925 if (nbytes
> LARGE_STRING_BYTES
)
1927 size_t size
= sizeof *b
- sizeof (struct sdata
) + needed
;
1929 #ifdef DOUG_LEA_MALLOC
1930 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1931 because mapped region contents are not preserved in
1934 In case you think of allowing it in a dumped Emacs at the
1935 cost of not being able to re-dump, there's another reason:
1936 mmap'ed data typically have an address towards the top of the
1937 address space, which won't fit into an EMACS_INT (at least on
1938 32-bit systems with the current tagging scheme). --fx */
1939 mallopt (M_MMAP_MAX
, 0);
1942 b
= (struct sblock
*) lisp_malloc (size
+ GC_STRING_EXTRA
, MEM_TYPE_NON_LISP
);
1944 #ifdef DOUG_LEA_MALLOC
1945 /* Back to a reasonable maximum of mmap'ed areas. */
1946 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1949 b
->next_free
= &b
->first_data
;
1950 b
->first_data
.string
= NULL
;
1951 b
->next
= large_sblocks
;
1954 else if (current_sblock
== NULL
1955 || (((char *) current_sblock
+ SBLOCK_SIZE
1956 - (char *) current_sblock
->next_free
)
1957 < (needed
+ GC_STRING_EXTRA
)))
1959 /* Not enough room in the current sblock. */
1960 b
= (struct sblock
*) lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
1961 b
->next_free
= &b
->first_data
;
1962 b
->first_data
.string
= NULL
;
1966 current_sblock
->next
= b
;
1974 data
= b
->next_free
;
1975 b
->next_free
= (struct sdata
*) ((char *) data
+ needed
+ GC_STRING_EXTRA
);
1977 MALLOC_UNBLOCK_INPUT
;
1980 s
->data
= SDATA_DATA (data
);
1981 #ifdef GC_CHECK_STRING_BYTES
1982 SDATA_NBYTES (data
) = nbytes
;
1985 s
->size_byte
= nbytes
;
1986 s
->data
[nbytes
] = '\0';
1987 #ifdef GC_CHECK_STRING_OVERRUN
1988 memcpy (data
+ needed
, string_overrun_cookie
, GC_STRING_OVERRUN_COOKIE_SIZE
);
1991 /* If S had already data assigned, mark that as free by setting its
1992 string back-pointer to null, and recording the size of the data
1996 SDATA_NBYTES (old_data
) = old_nbytes
;
1997 old_data
->string
= NULL
;
2000 consing_since_gc
+= needed
;
2004 /* Sweep and compact strings. */
2007 sweep_strings (void)
2009 struct string_block
*b
, *next
;
2010 struct string_block
*live_blocks
= NULL
;
2012 string_free_list
= NULL
;
2013 total_strings
= total_free_strings
= 0;
2014 total_string_size
= 0;
2016 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
2017 for (b
= string_blocks
; b
; b
= next
)
2020 struct Lisp_String
*free_list_before
= string_free_list
;
2024 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
2026 struct Lisp_String
*s
= b
->strings
+ i
;
2030 /* String was not on free-list before. */
2031 if (STRING_MARKED_P (s
))
2033 /* String is live; unmark it and its intervals. */
2036 if (!NULL_INTERVAL_P (s
->intervals
))
2037 UNMARK_BALANCE_INTERVALS (s
->intervals
);
2040 total_string_size
+= STRING_BYTES (s
);
2044 /* String is dead. Put it on the free-list. */
2045 struct sdata
*data
= SDATA_OF_STRING (s
);
2047 /* Save the size of S in its sdata so that we know
2048 how large that is. Reset the sdata's string
2049 back-pointer so that we know it's free. */
2050 #ifdef GC_CHECK_STRING_BYTES
2051 if (GC_STRING_BYTES (s
) != SDATA_NBYTES (data
))
2054 data
->u
.nbytes
= GC_STRING_BYTES (s
);
2056 data
->string
= NULL
;
2058 /* Reset the strings's `data' member so that we
2062 /* Put the string on the free-list. */
2063 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2064 string_free_list
= s
;
2070 /* S was on the free-list before. Put it there again. */
2071 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2072 string_free_list
= s
;
2077 /* Free blocks that contain free Lisp_Strings only, except
2078 the first two of them. */
2079 if (nfree
== STRING_BLOCK_SIZE
2080 && total_free_strings
> STRING_BLOCK_SIZE
)
2084 string_free_list
= free_list_before
;
2088 total_free_strings
+= nfree
;
2089 b
->next
= live_blocks
;
2094 check_string_free_list ();
2096 string_blocks
= live_blocks
;
2097 free_large_strings ();
2098 compact_small_strings ();
2100 check_string_free_list ();
2104 /* Free dead large strings. */
2107 free_large_strings (void)
2109 struct sblock
*b
, *next
;
2110 struct sblock
*live_blocks
= NULL
;
2112 for (b
= large_sblocks
; b
; b
= next
)
2116 if (b
->first_data
.string
== NULL
)
2120 b
->next
= live_blocks
;
2125 large_sblocks
= live_blocks
;
2129 /* Compact data of small strings. Free sblocks that don't contain
2130 data of live strings after compaction. */
2133 compact_small_strings (void)
2135 struct sblock
*b
, *tb
, *next
;
2136 struct sdata
*from
, *to
, *end
, *tb_end
;
2137 struct sdata
*to_end
, *from_end
;
2139 /* TB is the sblock we copy to, TO is the sdata within TB we copy
2140 to, and TB_END is the end of TB. */
2142 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2143 to
= &tb
->first_data
;
2145 /* Step through the blocks from the oldest to the youngest. We
2146 expect that old blocks will stabilize over time, so that less
2147 copying will happen this way. */
2148 for (b
= oldest_sblock
; b
; b
= b
->next
)
2151 xassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
2153 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
2155 /* Compute the next FROM here because copying below may
2156 overwrite data we need to compute it. */
2159 #ifdef GC_CHECK_STRING_BYTES
2160 /* Check that the string size recorded in the string is the
2161 same as the one recorded in the sdata structure. */
2163 && GC_STRING_BYTES (from
->string
) != SDATA_NBYTES (from
))
2165 #endif /* GC_CHECK_STRING_BYTES */
2168 nbytes
= GC_STRING_BYTES (from
->string
);
2170 nbytes
= SDATA_NBYTES (from
);
2172 if (nbytes
> LARGE_STRING_BYTES
)
2175 nbytes
= SDATA_SIZE (nbytes
);
2176 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
2178 #ifdef GC_CHECK_STRING_OVERRUN
2179 if (memcmp (string_overrun_cookie
,
2180 (char *) from_end
- GC_STRING_OVERRUN_COOKIE_SIZE
,
2181 GC_STRING_OVERRUN_COOKIE_SIZE
))
2185 /* FROM->string non-null means it's alive. Copy its data. */
2188 /* If TB is full, proceed with the next sblock. */
2189 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2190 if (to_end
> tb_end
)
2194 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2195 to
= &tb
->first_data
;
2196 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2199 /* Copy, and update the string's `data' pointer. */
2202 xassert (tb
!= b
|| to
<= from
);
2203 memmove (to
, from
, nbytes
+ GC_STRING_EXTRA
);
2204 to
->string
->data
= SDATA_DATA (to
);
2207 /* Advance past the sdata we copied to. */
2213 /* The rest of the sblocks following TB don't contain live data, so
2214 we can free them. */
2215 for (b
= tb
->next
; b
; b
= next
)
2223 current_sblock
= tb
;
2227 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
2228 doc
: /* Return a newly created string of length LENGTH, with INIT in each element.
2229 LENGTH must be an integer.
2230 INIT must be an integer that represents a character. */)
2231 (Lisp_Object length
, Lisp_Object init
)
2233 register Lisp_Object val
;
2234 register unsigned char *p
, *end
;
2237 CHECK_NATNUM (length
);
2238 CHECK_NUMBER (init
);
2241 if (ASCII_CHAR_P (c
))
2243 nbytes
= XINT (length
);
2244 val
= make_uninit_string (nbytes
);
2246 end
= p
+ SCHARS (val
);
2252 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
2253 int len
= CHAR_STRING (c
, str
);
2255 nbytes
= len
* XINT (length
);
2256 val
= make_uninit_multibyte_string (XINT (length
), nbytes
);
2261 memcpy (p
, str
, len
);
2271 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
2272 doc
: /* Return a new bool-vector of length LENGTH, using INIT for each element.
2273 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
2274 (Lisp_Object length
, Lisp_Object init
)
2276 register Lisp_Object val
;
2277 struct Lisp_Bool_Vector
*p
;
2279 int length_in_chars
, length_in_elts
, bits_per_value
;
2281 CHECK_NATNUM (length
);
2283 bits_per_value
= sizeof (EMACS_INT
) * BOOL_VECTOR_BITS_PER_CHAR
;
2285 length_in_elts
= (XFASTINT (length
) + bits_per_value
- 1) / bits_per_value
;
2286 length_in_chars
= ((XFASTINT (length
) + BOOL_VECTOR_BITS_PER_CHAR
- 1)
2287 / BOOL_VECTOR_BITS_PER_CHAR
);
2289 /* We must allocate one more elements than LENGTH_IN_ELTS for the
2290 slot `size' of the struct Lisp_Bool_Vector. */
2291 val
= Fmake_vector (make_number (length_in_elts
+ 1), Qnil
);
2293 /* Get rid of any bits that would cause confusion. */
2294 XVECTOR (val
)->size
= 0; /* No Lisp_Object to trace in there. */
2295 /* Use XVECTOR (val) rather than `p' because p->size is not TRT. */
2296 XSETPVECTYPE (XVECTOR (val
), PVEC_BOOL_VECTOR
);
2298 p
= XBOOL_VECTOR (val
);
2299 p
->size
= XFASTINT (length
);
2301 real_init
= (NILP (init
) ? 0 : -1);
2302 for (i
= 0; i
< length_in_chars
; i
++)
2303 p
->data
[i
] = real_init
;
2305 /* Clear the extraneous bits in the last byte. */
2306 if (XINT (length
) != length_in_chars
* BOOL_VECTOR_BITS_PER_CHAR
)
2307 p
->data
[length_in_chars
- 1]
2308 &= (1 << (XINT (length
) % BOOL_VECTOR_BITS_PER_CHAR
)) - 1;
2314 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
2315 of characters from the contents. This string may be unibyte or
2316 multibyte, depending on the contents. */
2319 make_string (const char *contents
, int nbytes
)
2321 register Lisp_Object val
;
2322 int nchars
, multibyte_nbytes
;
2324 parse_str_as_multibyte (contents
, nbytes
, &nchars
, &multibyte_nbytes
);
2325 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
2326 /* CONTENTS contains no multibyte sequences or contains an invalid
2327 multibyte sequence. We must make unibyte string. */
2328 val
= make_unibyte_string (contents
, nbytes
);
2330 val
= make_multibyte_string (contents
, nchars
, nbytes
);
2335 /* Make an unibyte string from LENGTH bytes at CONTENTS. */
2338 make_unibyte_string (const char *contents
, int length
)
2340 register Lisp_Object val
;
2341 val
= make_uninit_string (length
);
2342 memcpy (SDATA (val
), contents
, length
);
2343 STRING_SET_UNIBYTE (val
);
2348 /* Make a multibyte string from NCHARS characters occupying NBYTES
2349 bytes at CONTENTS. */
2352 make_multibyte_string (const char *contents
, int nchars
, int nbytes
)
2354 register Lisp_Object val
;
2355 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2356 memcpy (SDATA (val
), contents
, nbytes
);
2361 /* Make a string from NCHARS characters occupying NBYTES bytes at
2362 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2365 make_string_from_bytes (const char *contents
, int nchars
, int nbytes
)
2367 register Lisp_Object val
;
2368 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2369 memcpy (SDATA (val
), contents
, nbytes
);
2370 if (SBYTES (val
) == SCHARS (val
))
2371 STRING_SET_UNIBYTE (val
);
2376 /* Make a string from NCHARS characters occupying NBYTES bytes at
2377 CONTENTS. The argument MULTIBYTE controls whether to label the
2378 string as multibyte. If NCHARS is negative, it counts the number of
2379 characters by itself. */
2382 make_specified_string (const char *contents
, int nchars
, int nbytes
, int multibyte
)
2384 register Lisp_Object val
;
2389 nchars
= multibyte_chars_in_text (contents
, nbytes
);
2393 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2394 memcpy (SDATA (val
), contents
, nbytes
);
2396 STRING_SET_UNIBYTE (val
);
2401 /* Make a string from the data at STR, treating it as multibyte if the
2405 build_string (const char *str
)
2407 return make_string (str
, strlen (str
));
2411 /* Return an unibyte Lisp_String set up to hold LENGTH characters
2412 occupying LENGTH bytes. */
2415 make_uninit_string (int length
)
2420 return empty_unibyte_string
;
2421 val
= make_uninit_multibyte_string (length
, length
);
2422 STRING_SET_UNIBYTE (val
);
2427 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2428 which occupy NBYTES bytes. */
2431 make_uninit_multibyte_string (int nchars
, int nbytes
)
2434 struct Lisp_String
*s
;
2439 return empty_multibyte_string
;
2441 s
= allocate_string ();
2442 allocate_string_data (s
, nchars
, nbytes
);
2443 XSETSTRING (string
, s
);
2444 string_chars_consed
+= nbytes
;
2450 /***********************************************************************
2452 ***********************************************************************/
2454 /* We store float cells inside of float_blocks, allocating a new
2455 float_block with malloc whenever necessary. Float cells reclaimed
2456 by GC are put on a free list to be reallocated before allocating
2457 any new float cells from the latest float_block. */
2459 #define FLOAT_BLOCK_SIZE \
2460 (((BLOCK_BYTES - sizeof (struct float_block *) \
2461 /* The compiler might add padding at the end. */ \
2462 - (sizeof (struct Lisp_Float) - sizeof (int))) * CHAR_BIT) \
2463 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2465 #define GETMARKBIT(block,n) \
2466 (((block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2467 >> ((n) % (sizeof(int) * CHAR_BIT))) \
2470 #define SETMARKBIT(block,n) \
2471 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2472 |= 1 << ((n) % (sizeof(int) * CHAR_BIT))
2474 #define UNSETMARKBIT(block,n) \
2475 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2476 &= ~(1 << ((n) % (sizeof(int) * CHAR_BIT)))
2478 #define FLOAT_BLOCK(fptr) \
2479 ((struct float_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2481 #define FLOAT_INDEX(fptr) \
2482 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2486 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2487 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2488 int gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2489 struct float_block
*next
;
2492 #define FLOAT_MARKED_P(fptr) \
2493 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2495 #define FLOAT_MARK(fptr) \
2496 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2498 #define FLOAT_UNMARK(fptr) \
2499 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2501 /* Current float_block. */
2503 struct float_block
*float_block
;
2505 /* Index of first unused Lisp_Float in the current float_block. */
2507 int float_block_index
;
2509 /* Total number of float blocks now in use. */
2513 /* Free-list of Lisp_Floats. */
2515 struct Lisp_Float
*float_free_list
;
2518 /* Initialize float allocation. */
2524 float_block_index
= FLOAT_BLOCK_SIZE
; /* Force alloc of new float_block. */
2525 float_free_list
= 0;
2530 /* Return a new float object with value FLOAT_VALUE. */
2533 make_float (double float_value
)
2535 register Lisp_Object val
;
2537 /* eassert (!handling_signal); */
2541 if (float_free_list
)
2543 /* We use the data field for chaining the free list
2544 so that we won't use the same field that has the mark bit. */
2545 XSETFLOAT (val
, float_free_list
);
2546 float_free_list
= float_free_list
->u
.chain
;
2550 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2552 register struct float_block
*new;
2554 new = (struct float_block
*) lisp_align_malloc (sizeof *new,
2556 new->next
= float_block
;
2557 memset (new->gcmarkbits
, 0, sizeof new->gcmarkbits
);
2559 float_block_index
= 0;
2562 XSETFLOAT (val
, &float_block
->floats
[float_block_index
]);
2563 float_block_index
++;
2566 MALLOC_UNBLOCK_INPUT
;
2568 XFLOAT_INIT (val
, float_value
);
2569 eassert (!FLOAT_MARKED_P (XFLOAT (val
)));
2570 consing_since_gc
+= sizeof (struct Lisp_Float
);
2577 /***********************************************************************
2579 ***********************************************************************/
2581 /* We store cons cells inside of cons_blocks, allocating a new
2582 cons_block with malloc whenever necessary. Cons cells reclaimed by
2583 GC are put on a free list to be reallocated before allocating
2584 any new cons cells from the latest cons_block. */
2586 #define CONS_BLOCK_SIZE \
2587 (((BLOCK_BYTES - sizeof (struct cons_block *)) * CHAR_BIT) \
2588 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2590 #define CONS_BLOCK(fptr) \
2591 ((struct cons_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2593 #define CONS_INDEX(fptr) \
2594 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2598 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2599 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2600 int gcmarkbits
[1 + CONS_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2601 struct cons_block
*next
;
2604 #define CONS_MARKED_P(fptr) \
2605 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2607 #define CONS_MARK(fptr) \
2608 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2610 #define CONS_UNMARK(fptr) \
2611 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2613 /* Current cons_block. */
2615 struct cons_block
*cons_block
;
2617 /* Index of first unused Lisp_Cons in the current block. */
2619 int cons_block_index
;
2621 /* Free-list of Lisp_Cons structures. */
2623 struct Lisp_Cons
*cons_free_list
;
2625 /* Total number of cons blocks now in use. */
2627 static int n_cons_blocks
;
2630 /* Initialize cons allocation. */
2636 cons_block_index
= CONS_BLOCK_SIZE
; /* Force alloc of new cons_block. */
2642 /* Explicitly free a cons cell by putting it on the free-list. */
2645 free_cons (struct Lisp_Cons
*ptr
)
2647 ptr
->u
.chain
= cons_free_list
;
2651 cons_free_list
= ptr
;
2654 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
2655 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2656 (Lisp_Object car
, Lisp_Object cdr
)
2658 register Lisp_Object val
;
2660 /* eassert (!handling_signal); */
2666 /* We use the cdr for chaining the free list
2667 so that we won't use the same field that has the mark bit. */
2668 XSETCONS (val
, cons_free_list
);
2669 cons_free_list
= cons_free_list
->u
.chain
;
2673 if (cons_block_index
== CONS_BLOCK_SIZE
)
2675 register struct cons_block
*new;
2676 new = (struct cons_block
*) lisp_align_malloc (sizeof *new,
2678 memset (new->gcmarkbits
, 0, sizeof new->gcmarkbits
);
2679 new->next
= cons_block
;
2681 cons_block_index
= 0;
2684 XSETCONS (val
, &cons_block
->conses
[cons_block_index
]);
2688 MALLOC_UNBLOCK_INPUT
;
2692 eassert (!CONS_MARKED_P (XCONS (val
)));
2693 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2694 cons_cells_consed
++;
2698 /* Get an error now if there's any junk in the cons free list. */
2700 check_cons_list (void)
2702 #ifdef GC_CHECK_CONS_LIST
2703 struct Lisp_Cons
*tail
= cons_free_list
;
2706 tail
= tail
->u
.chain
;
2710 /* Make a list of 1, 2, 3, 4 or 5 specified objects. */
2713 list1 (Lisp_Object arg1
)
2715 return Fcons (arg1
, Qnil
);
2719 list2 (Lisp_Object arg1
, Lisp_Object arg2
)
2721 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2726 list3 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
)
2728 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2733 list4 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
, Lisp_Object arg4
)
2735 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2740 list5 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
, Lisp_Object arg4
, Lisp_Object arg5
)
2742 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2743 Fcons (arg5
, Qnil
)))));
2747 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
2748 doc
: /* Return a newly created list with specified arguments as elements.
2749 Any number of arguments, even zero arguments, are allowed.
2750 usage: (list &rest OBJECTS) */)
2751 (int nargs
, register Lisp_Object
*args
)
2753 register Lisp_Object val
;
2759 val
= Fcons (args
[nargs
], val
);
2765 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2766 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2767 (register Lisp_Object length
, Lisp_Object init
)
2769 register Lisp_Object val
;
2772 CHECK_NATNUM (length
);
2773 size
= XFASTINT (length
);
2778 val
= Fcons (init
, val
);
2783 val
= Fcons (init
, val
);
2788 val
= Fcons (init
, val
);
2793 val
= Fcons (init
, val
);
2798 val
= Fcons (init
, val
);
2813 /***********************************************************************
2815 ***********************************************************************/
2817 /* Singly-linked list of all vectors. */
2819 static struct Lisp_Vector
*all_vectors
;
2821 /* Total number of vector-like objects now in use. */
2823 static int n_vectors
;
2826 /* Value is a pointer to a newly allocated Lisp_Vector structure
2827 with room for LEN Lisp_Objects. */
2829 static struct Lisp_Vector
*
2830 allocate_vectorlike (EMACS_INT len
)
2832 struct Lisp_Vector
*p
;
2837 #ifdef DOUG_LEA_MALLOC
2838 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
2839 because mapped region contents are not preserved in
2841 mallopt (M_MMAP_MAX
, 0);
2844 /* This gets triggered by code which I haven't bothered to fix. --Stef */
2845 /* eassert (!handling_signal); */
2847 nbytes
= sizeof *p
+ (len
- 1) * sizeof p
->contents
[0];
2848 p
= (struct Lisp_Vector
*) lisp_malloc (nbytes
, MEM_TYPE_VECTORLIKE
);
2850 #ifdef DOUG_LEA_MALLOC
2851 /* Back to a reasonable maximum of mmap'ed areas. */
2852 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2855 consing_since_gc
+= nbytes
;
2856 vector_cells_consed
+= len
;
2858 p
->next
= all_vectors
;
2861 MALLOC_UNBLOCK_INPUT
;
2868 /* Allocate a vector with NSLOTS slots. */
2870 struct Lisp_Vector
*
2871 allocate_vector (EMACS_INT nslots
)
2873 struct Lisp_Vector
*v
= allocate_vectorlike (nslots
);
2879 /* Allocate other vector-like structures. */
2881 struct Lisp_Vector
*
2882 allocate_pseudovector (int memlen
, int lisplen
, EMACS_INT tag
)
2884 struct Lisp_Vector
*v
= allocate_vectorlike (memlen
);
2887 /* Only the first lisplen slots will be traced normally by the GC. */
2889 for (i
= 0; i
< lisplen
; ++i
)
2890 v
->contents
[i
] = Qnil
;
2892 XSETPVECTYPE (v
, tag
); /* Add the appropriate tag. */
2896 struct Lisp_Hash_Table
*
2897 allocate_hash_table (void)
2899 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Hash_Table
, count
, PVEC_HASH_TABLE
);
2904 allocate_window (void)
2906 return ALLOCATE_PSEUDOVECTOR(struct window
, current_matrix
, PVEC_WINDOW
);
2911 allocate_terminal (void)
2913 struct terminal
*t
= ALLOCATE_PSEUDOVECTOR (struct terminal
,
2914 next_terminal
, PVEC_TERMINAL
);
2915 /* Zero out the non-GC'd fields. FIXME: This should be made unnecessary. */
2916 memset (&t
->next_terminal
, 0,
2917 (char*) (t
+ 1) - (char*) &t
->next_terminal
);
2923 allocate_frame (void)
2925 struct frame
*f
= ALLOCATE_PSEUDOVECTOR (struct frame
,
2926 face_cache
, PVEC_FRAME
);
2927 /* Zero out the non-GC'd fields. FIXME: This should be made unnecessary. */
2928 memset (&f
->face_cache
, 0,
2929 (char *) (f
+ 1) - (char *) &f
->face_cache
);
2934 struct Lisp_Process
*
2935 allocate_process (void)
2937 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Process
, pid
, PVEC_PROCESS
);
2941 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
2942 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
2943 See also the function `vector'. */)
2944 (register Lisp_Object length
, Lisp_Object init
)
2947 register EMACS_INT sizei
;
2949 register struct Lisp_Vector
*p
;
2951 CHECK_NATNUM (length
);
2952 sizei
= XFASTINT (length
);
2954 p
= allocate_vector (sizei
);
2955 for (index
= 0; index
< sizei
; index
++)
2956 p
->contents
[index
] = init
;
2958 XSETVECTOR (vector
, p
);
2963 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
2964 doc
: /* Return a newly created vector with specified arguments as elements.
2965 Any number of arguments, even zero arguments, are allowed.
2966 usage: (vector &rest OBJECTS) */)
2967 (register int nargs
, Lisp_Object
*args
)
2969 register Lisp_Object len
, val
;
2971 register struct Lisp_Vector
*p
;
2973 XSETFASTINT (len
, nargs
);
2974 val
= Fmake_vector (len
, Qnil
);
2976 for (index
= 0; index
< nargs
; index
++)
2977 p
->contents
[index
] = args
[index
];
2982 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
2983 doc
: /* Create a byte-code object with specified arguments as elements.
2984 The arguments should be the arglist, bytecode-string, constant vector,
2985 stack size, (optional) doc string, and (optional) interactive spec.
2986 The first four arguments are required; at most six have any
2988 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
2989 (register int nargs
, Lisp_Object
*args
)
2991 register Lisp_Object len
, val
;
2993 register struct Lisp_Vector
*p
;
2995 XSETFASTINT (len
, nargs
);
2996 if (!NILP (Vpurify_flag
))
2997 val
= make_pure_vector ((EMACS_INT
) nargs
);
2999 val
= Fmake_vector (len
, Qnil
);
3001 if (nargs
> 1 && STRINGP (args
[1]) && STRING_MULTIBYTE (args
[1]))
3002 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
3003 earlier because they produced a raw 8-bit string for byte-code
3004 and now such a byte-code string is loaded as multibyte while
3005 raw 8-bit characters converted to multibyte form. Thus, now we
3006 must convert them back to the original unibyte form. */
3007 args
[1] = Fstring_as_unibyte (args
[1]);
3010 for (index
= 0; index
< nargs
; index
++)
3012 if (!NILP (Vpurify_flag
))
3013 args
[index
] = Fpurecopy (args
[index
]);
3014 p
->contents
[index
] = args
[index
];
3016 XSETPVECTYPE (p
, PVEC_COMPILED
);
3017 XSETCOMPILED (val
, p
);
3023 /***********************************************************************
3025 ***********************************************************************/
3027 /* Each symbol_block is just under 1020 bytes long, since malloc
3028 really allocates in units of powers of two and uses 4 bytes for its
3031 #define SYMBOL_BLOCK_SIZE \
3032 ((1020 - sizeof (struct symbol_block *)) / sizeof (struct Lisp_Symbol))
3036 /* Place `symbols' first, to preserve alignment. */
3037 struct Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
3038 struct symbol_block
*next
;
3041 /* Current symbol block and index of first unused Lisp_Symbol
3044 static struct symbol_block
*symbol_block
;
3045 static int symbol_block_index
;
3047 /* List of free symbols. */
3049 static struct Lisp_Symbol
*symbol_free_list
;
3051 /* Total number of symbol blocks now in use. */
3053 static int n_symbol_blocks
;
3056 /* Initialize symbol allocation. */
3061 symbol_block
= NULL
;
3062 symbol_block_index
= SYMBOL_BLOCK_SIZE
;
3063 symbol_free_list
= 0;
3064 n_symbol_blocks
= 0;
3068 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
3069 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
3070 Its value and function definition are void, and its property list is nil. */)
3073 register Lisp_Object val
;
3074 register struct Lisp_Symbol
*p
;
3076 CHECK_STRING (name
);
3078 /* eassert (!handling_signal); */
3082 if (symbol_free_list
)
3084 XSETSYMBOL (val
, symbol_free_list
);
3085 symbol_free_list
= symbol_free_list
->next
;
3089 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
3091 struct symbol_block
*new;
3092 new = (struct symbol_block
*) lisp_malloc (sizeof *new,
3094 new->next
= symbol_block
;
3096 symbol_block_index
= 0;
3099 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
]);
3100 symbol_block_index
++;
3103 MALLOC_UNBLOCK_INPUT
;
3108 p
->redirect
= SYMBOL_PLAINVAL
;
3109 SET_SYMBOL_VAL (p
, Qunbound
);
3110 p
->function
= Qunbound
;
3113 p
->interned
= SYMBOL_UNINTERNED
;
3115 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
3122 /***********************************************************************
3123 Marker (Misc) Allocation
3124 ***********************************************************************/
3126 /* Allocation of markers and other objects that share that structure.
3127 Works like allocation of conses. */
3129 #define MARKER_BLOCK_SIZE \
3130 ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc))
3134 /* Place `markers' first, to preserve alignment. */
3135 union Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
3136 struct marker_block
*next
;
3139 static struct marker_block
*marker_block
;
3140 static int marker_block_index
;
3142 static union Lisp_Misc
*marker_free_list
;
3144 /* Total number of marker blocks now in use. */
3146 static int n_marker_blocks
;
3151 marker_block
= NULL
;
3152 marker_block_index
= MARKER_BLOCK_SIZE
;
3153 marker_free_list
= 0;
3154 n_marker_blocks
= 0;
3157 /* Return a newly allocated Lisp_Misc object, with no substructure. */
3160 allocate_misc (void)
3164 /* eassert (!handling_signal); */
3168 if (marker_free_list
)
3170 XSETMISC (val
, marker_free_list
);
3171 marker_free_list
= marker_free_list
->u_free
.chain
;
3175 if (marker_block_index
== MARKER_BLOCK_SIZE
)
3177 struct marker_block
*new;
3178 new = (struct marker_block
*) lisp_malloc (sizeof *new,
3180 new->next
= marker_block
;
3182 marker_block_index
= 0;
3184 total_free_markers
+= MARKER_BLOCK_SIZE
;
3186 XSETMISC (val
, &marker_block
->markers
[marker_block_index
]);
3187 marker_block_index
++;
3190 MALLOC_UNBLOCK_INPUT
;
3192 --total_free_markers
;
3193 consing_since_gc
+= sizeof (union Lisp_Misc
);
3194 misc_objects_consed
++;
3195 XMISCANY (val
)->gcmarkbit
= 0;
3199 /* Free a Lisp_Misc object */
3202 free_misc (Lisp_Object misc
)
3204 XMISCTYPE (misc
) = Lisp_Misc_Free
;
3205 XMISC (misc
)->u_free
.chain
= marker_free_list
;
3206 marker_free_list
= XMISC (misc
);
3208 total_free_markers
++;
3211 /* Return a Lisp_Misc_Save_Value object containing POINTER and
3212 INTEGER. This is used to package C values to call record_unwind_protect.
3213 The unwind function can get the C values back using XSAVE_VALUE. */
3216 make_save_value (void *pointer
, int integer
)
3218 register Lisp_Object val
;
3219 register struct Lisp_Save_Value
*p
;
3221 val
= allocate_misc ();
3222 XMISCTYPE (val
) = Lisp_Misc_Save_Value
;
3223 p
= XSAVE_VALUE (val
);
3224 p
->pointer
= pointer
;
3225 p
->integer
= integer
;
3230 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
3231 doc
: /* Return a newly allocated marker which does not point at any place. */)
3234 register Lisp_Object val
;
3235 register struct Lisp_Marker
*p
;
3237 val
= allocate_misc ();
3238 XMISCTYPE (val
) = Lisp_Misc_Marker
;
3244 p
->insertion_type
= 0;
3248 /* Put MARKER back on the free list after using it temporarily. */
3251 free_marker (Lisp_Object marker
)
3253 unchain_marker (XMARKER (marker
));
3258 /* Return a newly created vector or string with specified arguments as
3259 elements. If all the arguments are characters that can fit
3260 in a string of events, make a string; otherwise, make a vector.
3262 Any number of arguments, even zero arguments, are allowed. */
3265 make_event_array (register int nargs
, Lisp_Object
*args
)
3269 for (i
= 0; i
< nargs
; i
++)
3270 /* The things that fit in a string
3271 are characters that are in 0...127,
3272 after discarding the meta bit and all the bits above it. */
3273 if (!INTEGERP (args
[i
])
3274 || (XUINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
3275 return Fvector (nargs
, args
);
3277 /* Since the loop exited, we know that all the things in it are
3278 characters, so we can make a string. */
3282 result
= Fmake_string (make_number (nargs
), make_number (0));
3283 for (i
= 0; i
< nargs
; i
++)
3285 SSET (result
, i
, XINT (args
[i
]));
3286 /* Move the meta bit to the right place for a string char. */
3287 if (XINT (args
[i
]) & CHAR_META
)
3288 SSET (result
, i
, SREF (result
, i
) | 0x80);
3297 /************************************************************************
3298 Memory Full Handling
3299 ************************************************************************/
3302 /* Called if malloc returns zero. */
3311 memory_full_cons_threshold
= sizeof (struct cons_block
);
3313 /* The first time we get here, free the spare memory. */
3314 for (i
= 0; i
< sizeof (spare_memory
) / sizeof (char *); i
++)
3315 if (spare_memory
[i
])
3318 free (spare_memory
[i
]);
3319 else if (i
>= 1 && i
<= 4)
3320 lisp_align_free (spare_memory
[i
]);
3322 lisp_free (spare_memory
[i
]);
3323 spare_memory
[i
] = 0;
3326 /* Record the space now used. When it decreases substantially,
3327 we can refill the memory reserve. */
3328 #ifndef SYSTEM_MALLOC
3329 bytes_used_when_full
= BYTES_USED
;
3332 /* This used to call error, but if we've run out of memory, we could
3333 get infinite recursion trying to build the string. */
3334 xsignal (Qnil
, Vmemory_signal_data
);
3337 /* If we released our reserve (due to running out of memory),
3338 and we have a fair amount free once again,
3339 try to set aside another reserve in case we run out once more.
3341 This is called when a relocatable block is freed in ralloc.c,
3342 and also directly from this file, in case we're not using ralloc.c. */
3345 refill_memory_reserve (void)
3347 #ifndef SYSTEM_MALLOC
3348 if (spare_memory
[0] == 0)
3349 spare_memory
[0] = (char *) malloc ((size_t) SPARE_MEMORY
);
3350 if (spare_memory
[1] == 0)
3351 spare_memory
[1] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3353 if (spare_memory
[2] == 0)
3354 spare_memory
[2] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3356 if (spare_memory
[3] == 0)
3357 spare_memory
[3] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3359 if (spare_memory
[4] == 0)
3360 spare_memory
[4] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3362 if (spare_memory
[5] == 0)
3363 spare_memory
[5] = (char *) lisp_malloc (sizeof (struct string_block
),
3365 if (spare_memory
[6] == 0)
3366 spare_memory
[6] = (char *) lisp_malloc (sizeof (struct string_block
),
3368 if (spare_memory
[0] && spare_memory
[1] && spare_memory
[5])
3369 Vmemory_full
= Qnil
;
3373 /************************************************************************
3375 ************************************************************************/
3377 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
3379 /* Conservative C stack marking requires a method to identify possibly
3380 live Lisp objects given a pointer value. We do this by keeping
3381 track of blocks of Lisp data that are allocated in a red-black tree
3382 (see also the comment of mem_node which is the type of nodes in
3383 that tree). Function lisp_malloc adds information for an allocated
3384 block to the red-black tree with calls to mem_insert, and function
3385 lisp_free removes it with mem_delete. Functions live_string_p etc
3386 call mem_find to lookup information about a given pointer in the
3387 tree, and use that to determine if the pointer points to a Lisp
3390 /* Initialize this part of alloc.c. */
3395 mem_z
.left
= mem_z
.right
= MEM_NIL
;
3396 mem_z
.parent
= NULL
;
3397 mem_z
.color
= MEM_BLACK
;
3398 mem_z
.start
= mem_z
.end
= NULL
;
3403 /* Value is a pointer to the mem_node containing START. Value is
3404 MEM_NIL if there is no node in the tree containing START. */
3406 static INLINE
struct mem_node
*
3407 mem_find (void *start
)
3411 if (start
< min_heap_address
|| start
> max_heap_address
)
3414 /* Make the search always successful to speed up the loop below. */
3415 mem_z
.start
= start
;
3416 mem_z
.end
= (char *) start
+ 1;
3419 while (start
< p
->start
|| start
>= p
->end
)
3420 p
= start
< p
->start
? p
->left
: p
->right
;
3425 /* Insert a new node into the tree for a block of memory with start
3426 address START, end address END, and type TYPE. Value is a
3427 pointer to the node that was inserted. */
3429 static struct mem_node
*
3430 mem_insert (void *start
, void *end
, enum mem_type type
)
3432 struct mem_node
*c
, *parent
, *x
;
3434 if (min_heap_address
== NULL
|| start
< min_heap_address
)
3435 min_heap_address
= start
;
3436 if (max_heap_address
== NULL
|| end
> max_heap_address
)
3437 max_heap_address
= end
;
3439 /* See where in the tree a node for START belongs. In this
3440 particular application, it shouldn't happen that a node is already
3441 present. For debugging purposes, let's check that. */
3445 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3447 while (c
!= MEM_NIL
)
3449 if (start
>= c
->start
&& start
< c
->end
)
3452 c
= start
< c
->start
? c
->left
: c
->right
;
3455 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3457 while (c
!= MEM_NIL
)
3460 c
= start
< c
->start
? c
->left
: c
->right
;
3463 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3465 /* Create a new node. */
3466 #ifdef GC_MALLOC_CHECK
3467 x
= (struct mem_node
*) _malloc_internal (sizeof *x
);
3471 x
= (struct mem_node
*) xmalloc (sizeof *x
);
3477 x
->left
= x
->right
= MEM_NIL
;
3480 /* Insert it as child of PARENT or install it as root. */
3483 if (start
< parent
->start
)
3491 /* Re-establish red-black tree properties. */
3492 mem_insert_fixup (x
);
3498 /* Re-establish the red-black properties of the tree, and thereby
3499 balance the tree, after node X has been inserted; X is always red. */
3502 mem_insert_fixup (struct mem_node
*x
)
3504 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3506 /* X is red and its parent is red. This is a violation of
3507 red-black tree property #3. */
3509 if (x
->parent
== x
->parent
->parent
->left
)
3511 /* We're on the left side of our grandparent, and Y is our
3513 struct mem_node
*y
= x
->parent
->parent
->right
;
3515 if (y
->color
== MEM_RED
)
3517 /* Uncle and parent are red but should be black because
3518 X is red. Change the colors accordingly and proceed
3519 with the grandparent. */
3520 x
->parent
->color
= MEM_BLACK
;
3521 y
->color
= MEM_BLACK
;
3522 x
->parent
->parent
->color
= MEM_RED
;
3523 x
= x
->parent
->parent
;
3527 /* Parent and uncle have different colors; parent is
3528 red, uncle is black. */
3529 if (x
== x
->parent
->right
)
3532 mem_rotate_left (x
);
3535 x
->parent
->color
= MEM_BLACK
;
3536 x
->parent
->parent
->color
= MEM_RED
;
3537 mem_rotate_right (x
->parent
->parent
);
3542 /* This is the symmetrical case of above. */
3543 struct mem_node
*y
= x
->parent
->parent
->left
;
3545 if (y
->color
== MEM_RED
)
3547 x
->parent
->color
= MEM_BLACK
;
3548 y
->color
= MEM_BLACK
;
3549 x
->parent
->parent
->color
= MEM_RED
;
3550 x
= x
->parent
->parent
;
3554 if (x
== x
->parent
->left
)
3557 mem_rotate_right (x
);
3560 x
->parent
->color
= MEM_BLACK
;
3561 x
->parent
->parent
->color
= MEM_RED
;
3562 mem_rotate_left (x
->parent
->parent
);
3567 /* The root may have been changed to red due to the algorithm. Set
3568 it to black so that property #5 is satisfied. */
3569 mem_root
->color
= MEM_BLACK
;
3580 mem_rotate_left (struct mem_node
*x
)
3584 /* Turn y's left sub-tree into x's right sub-tree. */
3587 if (y
->left
!= MEM_NIL
)
3588 y
->left
->parent
= x
;
3590 /* Y's parent was x's parent. */
3592 y
->parent
= x
->parent
;
3594 /* Get the parent to point to y instead of x. */
3597 if (x
== x
->parent
->left
)
3598 x
->parent
->left
= y
;
3600 x
->parent
->right
= y
;
3605 /* Put x on y's left. */
3619 mem_rotate_right (struct mem_node
*x
)
3621 struct mem_node
*y
= x
->left
;
3624 if (y
->right
!= MEM_NIL
)
3625 y
->right
->parent
= x
;
3628 y
->parent
= x
->parent
;
3631 if (x
== x
->parent
->right
)
3632 x
->parent
->right
= y
;
3634 x
->parent
->left
= y
;
3645 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
3648 mem_delete (struct mem_node
*z
)
3650 struct mem_node
*x
, *y
;
3652 if (!z
|| z
== MEM_NIL
)
3655 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
3660 while (y
->left
!= MEM_NIL
)
3664 if (y
->left
!= MEM_NIL
)
3669 x
->parent
= y
->parent
;
3672 if (y
== y
->parent
->left
)
3673 y
->parent
->left
= x
;
3675 y
->parent
->right
= x
;
3682 z
->start
= y
->start
;
3687 if (y
->color
== MEM_BLACK
)
3688 mem_delete_fixup (x
);
3690 #ifdef GC_MALLOC_CHECK
3698 /* Re-establish the red-black properties of the tree, after a
3702 mem_delete_fixup (struct mem_node
*x
)
3704 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
3706 if (x
== x
->parent
->left
)
3708 struct mem_node
*w
= x
->parent
->right
;
3710 if (w
->color
== MEM_RED
)
3712 w
->color
= MEM_BLACK
;
3713 x
->parent
->color
= MEM_RED
;
3714 mem_rotate_left (x
->parent
);
3715 w
= x
->parent
->right
;
3718 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
3725 if (w
->right
->color
== MEM_BLACK
)
3727 w
->left
->color
= MEM_BLACK
;
3729 mem_rotate_right (w
);
3730 w
= x
->parent
->right
;
3732 w
->color
= x
->parent
->color
;
3733 x
->parent
->color
= MEM_BLACK
;
3734 w
->right
->color
= MEM_BLACK
;
3735 mem_rotate_left (x
->parent
);
3741 struct mem_node
*w
= x
->parent
->left
;
3743 if (w
->color
== MEM_RED
)
3745 w
->color
= MEM_BLACK
;
3746 x
->parent
->color
= MEM_RED
;
3747 mem_rotate_right (x
->parent
);
3748 w
= x
->parent
->left
;
3751 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
3758 if (w
->left
->color
== MEM_BLACK
)
3760 w
->right
->color
= MEM_BLACK
;
3762 mem_rotate_left (w
);
3763 w
= x
->parent
->left
;
3766 w
->color
= x
->parent
->color
;
3767 x
->parent
->color
= MEM_BLACK
;
3768 w
->left
->color
= MEM_BLACK
;
3769 mem_rotate_right (x
->parent
);
3775 x
->color
= MEM_BLACK
;
3779 /* Value is non-zero if P is a pointer to a live Lisp string on
3780 the heap. M is a pointer to the mem_block for P. */
3783 live_string_p (struct mem_node
*m
, void *p
)
3785 if (m
->type
== MEM_TYPE_STRING
)
3787 struct string_block
*b
= (struct string_block
*) m
->start
;
3788 int offset
= (char *) p
- (char *) &b
->strings
[0];
3790 /* P must point to the start of a Lisp_String structure, and it
3791 must not be on the free-list. */
3793 && offset
% sizeof b
->strings
[0] == 0
3794 && offset
< (STRING_BLOCK_SIZE
* sizeof b
->strings
[0])
3795 && ((struct Lisp_String
*) p
)->data
!= NULL
);
3802 /* Value is non-zero if P is a pointer to a live Lisp cons on
3803 the heap. M is a pointer to the mem_block for P. */
3806 live_cons_p (struct mem_node
*m
, void *p
)
3808 if (m
->type
== MEM_TYPE_CONS
)
3810 struct cons_block
*b
= (struct cons_block
*) m
->start
;
3811 int offset
= (char *) p
- (char *) &b
->conses
[0];
3813 /* P must point to the start of a Lisp_Cons, not be
3814 one of the unused cells in the current cons block,
3815 and not be on the free-list. */
3817 && offset
% sizeof b
->conses
[0] == 0
3818 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
3820 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
3821 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
3828 /* Value is non-zero if P is a pointer to a live Lisp symbol on
3829 the heap. M is a pointer to the mem_block for P. */
3832 live_symbol_p (struct mem_node
*m
, void *p
)
3834 if (m
->type
== MEM_TYPE_SYMBOL
)
3836 struct symbol_block
*b
= (struct symbol_block
*) m
->start
;
3837 int offset
= (char *) p
- (char *) &b
->symbols
[0];
3839 /* P must point to the start of a Lisp_Symbol, not be
3840 one of the unused cells in the current symbol block,
3841 and not be on the free-list. */
3843 && offset
% sizeof b
->symbols
[0] == 0
3844 && offset
< (SYMBOL_BLOCK_SIZE
* sizeof b
->symbols
[0])
3845 && (b
!= symbol_block
3846 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
3847 && !EQ (((struct Lisp_Symbol
*) p
)->function
, Vdead
));
3854 /* Value is non-zero if P is a pointer to a live Lisp float on
3855 the heap. M is a pointer to the mem_block for P. */
3858 live_float_p (struct mem_node
*m
, void *p
)
3860 if (m
->type
== MEM_TYPE_FLOAT
)
3862 struct float_block
*b
= (struct float_block
*) m
->start
;
3863 int offset
= (char *) p
- (char *) &b
->floats
[0];
3865 /* P must point to the start of a Lisp_Float and not be
3866 one of the unused cells in the current float block. */
3868 && offset
% sizeof b
->floats
[0] == 0
3869 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
3870 && (b
!= float_block
3871 || offset
/ sizeof b
->floats
[0] < float_block_index
));
3878 /* Value is non-zero if P is a pointer to a live Lisp Misc on
3879 the heap. M is a pointer to the mem_block for P. */
3882 live_misc_p (struct mem_node
*m
, void *p
)
3884 if (m
->type
== MEM_TYPE_MISC
)
3886 struct marker_block
*b
= (struct marker_block
*) m
->start
;
3887 int offset
= (char *) p
- (char *) &b
->markers
[0];
3889 /* P must point to the start of a Lisp_Misc, not be
3890 one of the unused cells in the current misc block,
3891 and not be on the free-list. */
3893 && offset
% sizeof b
->markers
[0] == 0
3894 && offset
< (MARKER_BLOCK_SIZE
* sizeof b
->markers
[0])
3895 && (b
!= marker_block
3896 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
3897 && ((union Lisp_Misc
*) p
)->u_any
.type
!= Lisp_Misc_Free
);
3904 /* Value is non-zero if P is a pointer to a live vector-like object.
3905 M is a pointer to the mem_block for P. */
3908 live_vector_p (struct mem_node
*m
, void *p
)
3910 return (p
== m
->start
&& m
->type
== MEM_TYPE_VECTORLIKE
);
3914 /* Value is non-zero if P is a pointer to a live buffer. M is a
3915 pointer to the mem_block for P. */
3918 live_buffer_p (struct mem_node
*m
, void *p
)
3920 /* P must point to the start of the block, and the buffer
3921 must not have been killed. */
3922 return (m
->type
== MEM_TYPE_BUFFER
3924 && !NILP (((struct buffer
*) p
)->name
));
3927 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
3931 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
3933 /* Array of objects that are kept alive because the C stack contains
3934 a pattern that looks like a reference to them . */
3936 #define MAX_ZOMBIES 10
3937 static Lisp_Object zombies
[MAX_ZOMBIES
];
3939 /* Number of zombie objects. */
3941 static int nzombies
;
3943 /* Number of garbage collections. */
3947 /* Average percentage of zombies per collection. */
3949 static double avg_zombies
;
3951 /* Max. number of live and zombie objects. */
3953 static int max_live
, max_zombies
;
3955 /* Average number of live objects per GC. */
3957 static double avg_live
;
3959 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
3960 doc
: /* Show information about live and zombie objects. */)
3963 Lisp_Object args
[8], zombie_list
= Qnil
;
3965 for (i
= 0; i
< nzombies
; i
++)
3966 zombie_list
= Fcons (zombies
[i
], zombie_list
);
3967 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
3968 args
[1] = make_number (ngcs
);
3969 args
[2] = make_float (avg_live
);
3970 args
[3] = make_float (avg_zombies
);
3971 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
3972 args
[5] = make_number (max_live
);
3973 args
[6] = make_number (max_zombies
);
3974 args
[7] = zombie_list
;
3975 return Fmessage (8, args
);
3978 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
3981 /* Mark OBJ if we can prove it's a Lisp_Object. */
3984 mark_maybe_object (Lisp_Object obj
)
3986 void *po
= (void *) XPNTR (obj
);
3987 struct mem_node
*m
= mem_find (po
);
3993 switch (XTYPE (obj
))
3996 mark_p
= (live_string_p (m
, po
)
3997 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
4001 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
4005 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
4009 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
4012 case Lisp_Vectorlike
:
4013 /* Note: can't check BUFFERP before we know it's a
4014 buffer because checking that dereferences the pointer
4015 PO which might point anywhere. */
4016 if (live_vector_p (m
, po
))
4017 mark_p
= !SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
4018 else if (live_buffer_p (m
, po
))
4019 mark_p
= BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
4023 mark_p
= (live_misc_p (m
, po
) && !XMISCANY (obj
)->gcmarkbit
);
4032 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4033 if (nzombies
< MAX_ZOMBIES
)
4034 zombies
[nzombies
] = obj
;
4043 /* If P points to Lisp data, mark that as live if it isn't already
4047 mark_maybe_pointer (void *p
)
4051 /* Quickly rule out some values which can't point to Lisp data. */
4054 8 /* USE_LSB_TAG needs Lisp data to be aligned on multiples of 8. */
4056 2 /* We assume that Lisp data is aligned on even addresses. */
4064 Lisp_Object obj
= Qnil
;
4068 case MEM_TYPE_NON_LISP
:
4069 /* Nothing to do; not a pointer to Lisp memory. */
4072 case MEM_TYPE_BUFFER
:
4073 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P((struct buffer
*)p
))
4074 XSETVECTOR (obj
, p
);
4078 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
4082 case MEM_TYPE_STRING
:
4083 if (live_string_p (m
, p
)
4084 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
4085 XSETSTRING (obj
, p
);
4089 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
4093 case MEM_TYPE_SYMBOL
:
4094 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
4095 XSETSYMBOL (obj
, p
);
4098 case MEM_TYPE_FLOAT
:
4099 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
4103 case MEM_TYPE_VECTORLIKE
:
4104 if (live_vector_p (m
, p
))
4107 XSETVECTOR (tem
, p
);
4108 if (!SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
4123 /* Mark Lisp objects referenced from the address range START+OFFSET..END
4124 or END+OFFSET..START. */
4127 mark_memory (void *start
, void *end
, int offset
)
4132 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4136 /* Make START the pointer to the start of the memory region,
4137 if it isn't already. */
4145 /* Mark Lisp_Objects. */
4146 for (p
= (Lisp_Object
*) ((char *) start
+ offset
); (void *) p
< end
; ++p
)
4147 mark_maybe_object (*p
);
4149 /* Mark Lisp data pointed to. This is necessary because, in some
4150 situations, the C compiler optimizes Lisp objects away, so that
4151 only a pointer to them remains. Example:
4153 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
4156 Lisp_Object obj = build_string ("test");
4157 struct Lisp_String *s = XSTRING (obj);
4158 Fgarbage_collect ();
4159 fprintf (stderr, "test `%s'\n", s->data);
4163 Here, `obj' isn't really used, and the compiler optimizes it
4164 away. The only reference to the life string is through the
4167 for (pp
= (void **) ((char *) start
+ offset
); (void *) pp
< end
; ++pp
)
4168 mark_maybe_pointer (*pp
);
4171 /* setjmp will work with GCC unless NON_SAVING_SETJMP is defined in
4172 the GCC system configuration. In gcc 3.2, the only systems for
4173 which this is so are i386-sco5 non-ELF, i386-sysv3 (maybe included
4174 by others?) and ns32k-pc532-min. */
4176 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
4178 static int setjmp_tested_p
, longjmps_done
;
4180 #define SETJMP_WILL_LIKELY_WORK "\
4182 Emacs garbage collector has been changed to use conservative stack\n\
4183 marking. Emacs has determined that the method it uses to do the\n\
4184 marking will likely work on your system, but this isn't sure.\n\
4186 If you are a system-programmer, or can get the help of a local wizard\n\
4187 who is, please take a look at the function mark_stack in alloc.c, and\n\
4188 verify that the methods used are appropriate for your system.\n\
4190 Please mail the result to <emacs-devel@gnu.org>.\n\
4193 #define SETJMP_WILL_NOT_WORK "\
4195 Emacs garbage collector has been changed to use conservative stack\n\
4196 marking. Emacs has determined that the default method it uses to do the\n\
4197 marking will not work on your system. We will need a system-dependent\n\
4198 solution for your system.\n\
4200 Please take a look at the function mark_stack in alloc.c, and\n\
4201 try to find a way to make it work on your system.\n\
4203 Note that you may get false negatives, depending on the compiler.\n\
4204 In particular, you need to use -O with GCC for this test.\n\
4206 Please mail the result to <emacs-devel@gnu.org>.\n\
4210 /* Perform a quick check if it looks like setjmp saves registers in a
4211 jmp_buf. Print a message to stderr saying so. When this test
4212 succeeds, this is _not_ a proof that setjmp is sufficient for
4213 conservative stack marking. Only the sources or a disassembly
4224 /* Arrange for X to be put in a register. */
4230 if (longjmps_done
== 1)
4232 /* Came here after the longjmp at the end of the function.
4234 If x == 1, the longjmp has restored the register to its
4235 value before the setjmp, and we can hope that setjmp
4236 saves all such registers in the jmp_buf, although that
4239 For other values of X, either something really strange is
4240 taking place, or the setjmp just didn't save the register. */
4243 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
4246 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
4253 if (longjmps_done
== 1)
4257 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
4260 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4262 /* Abort if anything GCPRO'd doesn't survive the GC. */
4270 for (p
= gcprolist
; p
; p
= p
->next
)
4271 for (i
= 0; i
< p
->nvars
; ++i
)
4272 if (!survives_gc_p (p
->var
[i
]))
4273 /* FIXME: It's not necessarily a bug. It might just be that the
4274 GCPRO is unnecessary or should release the object sooner. */
4278 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4285 fprintf (stderr
, "\nZombies kept alive = %d:\n", nzombies
);
4286 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
4288 fprintf (stderr
, " %d = ", i
);
4289 debug_print (zombies
[i
]);
4293 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4296 /* Mark live Lisp objects on the C stack.
4298 There are several system-dependent problems to consider when
4299 porting this to new architectures:
4303 We have to mark Lisp objects in CPU registers that can hold local
4304 variables or are used to pass parameters.
4306 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
4307 something that either saves relevant registers on the stack, or
4308 calls mark_maybe_object passing it each register's contents.
4310 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
4311 implementation assumes that calling setjmp saves registers we need
4312 to see in a jmp_buf which itself lies on the stack. This doesn't
4313 have to be true! It must be verified for each system, possibly
4314 by taking a look at the source code of setjmp.
4318 Architectures differ in the way their processor stack is organized.
4319 For example, the stack might look like this
4322 | Lisp_Object | size = 4
4324 | something else | size = 2
4326 | Lisp_Object | size = 4
4330 In such a case, not every Lisp_Object will be aligned equally. To
4331 find all Lisp_Object on the stack it won't be sufficient to walk
4332 the stack in steps of 4 bytes. Instead, two passes will be
4333 necessary, one starting at the start of the stack, and a second
4334 pass starting at the start of the stack + 2. Likewise, if the
4335 minimal alignment of Lisp_Objects on the stack is 1, four passes
4336 would be necessary, each one starting with one byte more offset
4337 from the stack start.
4339 The current code assumes by default that Lisp_Objects are aligned
4340 equally on the stack. */
4346 /* jmp_buf may not be aligned enough on darwin-ppc64 */
4347 union aligned_jmpbuf
{
4351 volatile int stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
4354 /* This trick flushes the register windows so that all the state of
4355 the process is contained in the stack. */
4356 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
4357 needed on ia64 too. See mach_dep.c, where it also says inline
4358 assembler doesn't work with relevant proprietary compilers. */
4360 #if defined (__sparc64__) && defined (__FreeBSD__)
4361 /* FreeBSD does not have a ta 3 handler. */
4368 /* Save registers that we need to see on the stack. We need to see
4369 registers used to hold register variables and registers used to
4371 #ifdef GC_SAVE_REGISTERS_ON_STACK
4372 GC_SAVE_REGISTERS_ON_STACK (end
);
4373 #else /* not GC_SAVE_REGISTERS_ON_STACK */
4375 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
4376 setjmp will definitely work, test it
4377 and print a message with the result
4379 if (!setjmp_tested_p
)
4381 setjmp_tested_p
= 1;
4384 #endif /* GC_SETJMP_WORKS */
4387 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
4388 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
4390 /* This assumes that the stack is a contiguous region in memory. If
4391 that's not the case, something has to be done here to iterate
4392 over the stack segments. */
4393 #ifndef GC_LISP_OBJECT_ALIGNMENT
4395 #define GC_LISP_OBJECT_ALIGNMENT __alignof__ (Lisp_Object)
4397 #define GC_LISP_OBJECT_ALIGNMENT sizeof (Lisp_Object)
4400 for (i
= 0; i
< sizeof (Lisp_Object
); i
+= GC_LISP_OBJECT_ALIGNMENT
)
4401 mark_memory (stack_base
, end
, i
);
4402 /* Allow for marking a secondary stack, like the register stack on the
4404 #ifdef GC_MARK_SECONDARY_STACK
4405 GC_MARK_SECONDARY_STACK ();
4408 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4413 #endif /* GC_MARK_STACK != 0 */
4416 /* Determine whether it is safe to access memory at address P. */
4418 valid_pointer_p (void *p
)
4421 return w32_valid_pointer_p (p
, 16);
4425 /* Obviously, we cannot just access it (we would SEGV trying), so we
4426 trick the o/s to tell us whether p is a valid pointer.
4427 Unfortunately, we cannot use NULL_DEVICE here, as emacs_write may
4428 not validate p in that case. */
4430 if ((fd
= emacs_open ("__Valid__Lisp__Object__", O_CREAT
| O_WRONLY
| O_TRUNC
, 0666)) >= 0)
4432 int valid
= (emacs_write (fd
, (char *)p
, 16) == 16);
4434 unlink ("__Valid__Lisp__Object__");
4442 /* Return 1 if OBJ is a valid lisp object.
4443 Return 0 if OBJ is NOT a valid lisp object.
4444 Return -1 if we cannot validate OBJ.
4445 This function can be quite slow,
4446 so it should only be used in code for manual debugging. */
4449 valid_lisp_object_p (Lisp_Object obj
)
4459 p
= (void *) XPNTR (obj
);
4460 if (PURE_POINTER_P (p
))
4464 return valid_pointer_p (p
);
4471 int valid
= valid_pointer_p (p
);
4483 case MEM_TYPE_NON_LISP
:
4486 case MEM_TYPE_BUFFER
:
4487 return live_buffer_p (m
, p
);
4490 return live_cons_p (m
, p
);
4492 case MEM_TYPE_STRING
:
4493 return live_string_p (m
, p
);
4496 return live_misc_p (m
, p
);
4498 case MEM_TYPE_SYMBOL
:
4499 return live_symbol_p (m
, p
);
4501 case MEM_TYPE_FLOAT
:
4502 return live_float_p (m
, p
);
4504 case MEM_TYPE_VECTORLIKE
:
4505 return live_vector_p (m
, p
);
4518 /***********************************************************************
4519 Pure Storage Management
4520 ***********************************************************************/
4522 /* Allocate room for SIZE bytes from pure Lisp storage and return a
4523 pointer to it. TYPE is the Lisp type for which the memory is
4524 allocated. TYPE < 0 means it's not used for a Lisp object. */
4526 static POINTER_TYPE
*
4527 pure_alloc (size_t size
, int type
)
4529 POINTER_TYPE
*result
;
4531 size_t alignment
= (1 << GCTYPEBITS
);
4533 size_t alignment
= sizeof (EMACS_INT
);
4535 /* Give Lisp_Floats an extra alignment. */
4536 if (type
== Lisp_Float
)
4538 #if defined __GNUC__ && __GNUC__ >= 2
4539 alignment
= __alignof (struct Lisp_Float
);
4541 alignment
= sizeof (struct Lisp_Float
);
4549 /* Allocate space for a Lisp object from the beginning of the free
4550 space with taking account of alignment. */
4551 result
= ALIGN (purebeg
+ pure_bytes_used_lisp
, alignment
);
4552 pure_bytes_used_lisp
= ((char *)result
- (char *)purebeg
) + size
;
4556 /* Allocate space for a non-Lisp object from the end of the free
4558 pure_bytes_used_non_lisp
+= size
;
4559 result
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4561 pure_bytes_used
= pure_bytes_used_lisp
+ pure_bytes_used_non_lisp
;
4563 if (pure_bytes_used
<= pure_size
)
4566 /* Don't allocate a large amount here,
4567 because it might get mmap'd and then its address
4568 might not be usable. */
4569 purebeg
= (char *) xmalloc (10000);
4571 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
4572 pure_bytes_used
= 0;
4573 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
4578 /* Print a warning if PURESIZE is too small. */
4581 check_pure_size (void)
4583 if (pure_bytes_used_before_overflow
)
4584 message ("emacs:0:Pure Lisp storage overflow (approx. %d bytes needed)",
4585 (int) (pure_bytes_used
+ pure_bytes_used_before_overflow
));
4589 /* Find the byte sequence {DATA[0], ..., DATA[NBYTES-1], '\0'} from
4590 the non-Lisp data pool of the pure storage, and return its start
4591 address. Return NULL if not found. */
4594 find_string_data_in_pure (const char *data
, int nbytes
)
4596 int i
, skip
, bm_skip
[256], last_char_skip
, infinity
, start
, start_max
;
4597 const unsigned char *p
;
4600 if (pure_bytes_used_non_lisp
< nbytes
+ 1)
4603 /* Set up the Boyer-Moore table. */
4605 for (i
= 0; i
< 256; i
++)
4608 p
= (const unsigned char *) data
;
4610 bm_skip
[*p
++] = skip
;
4612 last_char_skip
= bm_skip
['\0'];
4614 non_lisp_beg
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4615 start_max
= pure_bytes_used_non_lisp
- (nbytes
+ 1);
4617 /* See the comments in the function `boyer_moore' (search.c) for the
4618 use of `infinity'. */
4619 infinity
= pure_bytes_used_non_lisp
+ 1;
4620 bm_skip
['\0'] = infinity
;
4622 p
= (const unsigned char *) non_lisp_beg
+ nbytes
;
4626 /* Check the last character (== '\0'). */
4629 start
+= bm_skip
[*(p
+ start
)];
4631 while (start
<= start_max
);
4633 if (start
< infinity
)
4634 /* Couldn't find the last character. */
4637 /* No less than `infinity' means we could find the last
4638 character at `p[start - infinity]'. */
4641 /* Check the remaining characters. */
4642 if (memcmp (data
, non_lisp_beg
+ start
, nbytes
) == 0)
4644 return non_lisp_beg
+ start
;
4646 start
+= last_char_skip
;
4648 while (start
<= start_max
);
4654 /* Return a string allocated in pure space. DATA is a buffer holding
4655 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
4656 non-zero means make the result string multibyte.
4658 Must get an error if pure storage is full, since if it cannot hold
4659 a large string it may be able to hold conses that point to that
4660 string; then the string is not protected from gc. */
4663 make_pure_string (const char *data
, int nchars
, int nbytes
, int multibyte
)
4666 struct Lisp_String
*s
;
4668 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4669 s
->data
= find_string_data_in_pure (data
, nbytes
);
4670 if (s
->data
== NULL
)
4672 s
->data
= (unsigned char *) pure_alloc (nbytes
+ 1, -1);
4673 memcpy (s
->data
, data
, nbytes
);
4674 s
->data
[nbytes
] = '\0';
4677 s
->size_byte
= multibyte
? nbytes
: -1;
4678 s
->intervals
= NULL_INTERVAL
;
4679 XSETSTRING (string
, s
);
4683 /* Return a string a string allocated in pure space. Do not allocate
4684 the string data, just point to DATA. */
4687 make_pure_c_string (const char *data
)
4690 struct Lisp_String
*s
;
4691 int nchars
= strlen (data
);
4693 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4696 s
->data
= (unsigned char *) data
;
4697 s
->intervals
= NULL_INTERVAL
;
4698 XSETSTRING (string
, s
);
4702 /* Return a cons allocated from pure space. Give it pure copies
4703 of CAR as car and CDR as cdr. */
4706 pure_cons (Lisp_Object car
, Lisp_Object cdr
)
4708 register Lisp_Object
new;
4709 struct Lisp_Cons
*p
;
4711 p
= (struct Lisp_Cons
*) pure_alloc (sizeof *p
, Lisp_Cons
);
4713 XSETCAR (new, Fpurecopy (car
));
4714 XSETCDR (new, Fpurecopy (cdr
));
4719 /* Value is a float object with value NUM allocated from pure space. */
4722 make_pure_float (double num
)
4724 register Lisp_Object
new;
4725 struct Lisp_Float
*p
;
4727 p
= (struct Lisp_Float
*) pure_alloc (sizeof *p
, Lisp_Float
);
4729 XFLOAT_INIT (new, num
);
4734 /* Return a vector with room for LEN Lisp_Objects allocated from
4738 make_pure_vector (EMACS_INT len
)
4741 struct Lisp_Vector
*p
;
4742 size_t size
= sizeof *p
+ (len
- 1) * sizeof (Lisp_Object
);
4744 p
= (struct Lisp_Vector
*) pure_alloc (size
, Lisp_Vectorlike
);
4745 XSETVECTOR (new, p
);
4746 XVECTOR (new)->size
= len
;
4751 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
4752 doc
: /* Make a copy of object OBJ in pure storage.
4753 Recursively copies contents of vectors and cons cells.
4754 Does not copy symbols. Copies strings without text properties. */)
4755 (register Lisp_Object obj
)
4757 if (NILP (Vpurify_flag
))
4760 if (PURE_POINTER_P (XPNTR (obj
)))
4763 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
4765 Lisp_Object tmp
= Fgethash (obj
, Vpurify_flag
, Qnil
);
4771 obj
= pure_cons (XCAR (obj
), XCDR (obj
));
4772 else if (FLOATP (obj
))
4773 obj
= make_pure_float (XFLOAT_DATA (obj
));
4774 else if (STRINGP (obj
))
4775 obj
= make_pure_string (SDATA (obj
), SCHARS (obj
),
4777 STRING_MULTIBYTE (obj
));
4778 else if (COMPILEDP (obj
) || VECTORP (obj
))
4780 register struct Lisp_Vector
*vec
;
4784 size
= XVECTOR (obj
)->size
;
4785 if (size
& PSEUDOVECTOR_FLAG
)
4786 size
&= PSEUDOVECTOR_SIZE_MASK
;
4787 vec
= XVECTOR (make_pure_vector (size
));
4788 for (i
= 0; i
< size
; i
++)
4789 vec
->contents
[i
] = Fpurecopy (XVECTOR (obj
)->contents
[i
]);
4790 if (COMPILEDP (obj
))
4792 XSETPVECTYPE (vec
, PVEC_COMPILED
);
4793 XSETCOMPILED (obj
, vec
);
4796 XSETVECTOR (obj
, vec
);
4798 else if (MARKERP (obj
))
4799 error ("Attempt to copy a marker to pure storage");
4801 /* Not purified, don't hash-cons. */
4804 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
4805 Fputhash (obj
, obj
, Vpurify_flag
);
4812 /***********************************************************************
4814 ***********************************************************************/
4816 /* Put an entry in staticvec, pointing at the variable with address
4820 staticpro (Lisp_Object
*varaddress
)
4822 staticvec
[staticidx
++] = varaddress
;
4823 if (staticidx
>= NSTATICS
)
4828 /***********************************************************************
4830 ***********************************************************************/
4832 /* Temporarily prevent garbage collection. */
4835 inhibit_garbage_collection (void)
4837 int count
= SPECPDL_INDEX ();
4838 int nbits
= min (VALBITS
, BITS_PER_INT
);
4840 specbind (Qgc_cons_threshold
, make_number (((EMACS_INT
) 1 << (nbits
- 1)) - 1));
4845 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
4846 doc
: /* Reclaim storage for Lisp objects no longer needed.
4847 Garbage collection happens automatically if you cons more than
4848 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
4849 `garbage-collect' normally returns a list with info on amount of space in use:
4850 ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)
4851 (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS
4852 (USED-FLOATS . FREE-FLOATS) (USED-INTERVALS . FREE-INTERVALS)
4853 (USED-STRINGS . FREE-STRINGS))
4854 However, if there was overflow in pure space, `garbage-collect'
4855 returns nil, because real GC can't be done. */)
4858 register struct specbinding
*bind
;
4859 struct catchtag
*catch;
4860 struct handler
*handler
;
4861 char stack_top_variable
;
4864 Lisp_Object total
[8];
4865 int count
= SPECPDL_INDEX ();
4866 EMACS_TIME t1
, t2
, t3
;
4871 /* Can't GC if pure storage overflowed because we can't determine
4872 if something is a pure object or not. */
4873 if (pure_bytes_used_before_overflow
)
4878 /* Don't keep undo information around forever.
4879 Do this early on, so it is no problem if the user quits. */
4881 register struct buffer
*nextb
= all_buffers
;
4885 /* If a buffer's undo list is Qt, that means that undo is
4886 turned off in that buffer. Calling truncate_undo_list on
4887 Qt tends to return NULL, which effectively turns undo back on.
4888 So don't call truncate_undo_list if undo_list is Qt. */
4889 if (! NILP (nextb
->name
) && ! EQ (nextb
->undo_list
, Qt
))
4890 truncate_undo_list (nextb
);
4892 /* Shrink buffer gaps, but skip indirect and dead buffers. */
4893 if (nextb
->base_buffer
== 0 && !NILP (nextb
->name
)
4894 && ! nextb
->text
->inhibit_shrinking
)
4896 /* If a buffer's gap size is more than 10% of the buffer
4897 size, or larger than 2000 bytes, then shrink it
4898 accordingly. Keep a minimum size of 20 bytes. */
4899 int size
= min (2000, max (20, (nextb
->text
->z_byte
/ 10)));
4901 if (nextb
->text
->gap_size
> size
)
4903 struct buffer
*save_current
= current_buffer
;
4904 current_buffer
= nextb
;
4905 make_gap (-(nextb
->text
->gap_size
- size
));
4906 current_buffer
= save_current
;
4910 nextb
= nextb
->next
;
4914 EMACS_GET_TIME (t1
);
4916 /* In case user calls debug_print during GC,
4917 don't let that cause a recursive GC. */
4918 consing_since_gc
= 0;
4920 /* Save what's currently displayed in the echo area. */
4921 message_p
= push_message ();
4922 record_unwind_protect (pop_message_unwind
, Qnil
);
4924 /* Save a copy of the contents of the stack, for debugging. */
4925 #if MAX_SAVE_STACK > 0
4926 if (NILP (Vpurify_flag
))
4928 i
= &stack_top_variable
- stack_bottom
;
4930 if (i
< MAX_SAVE_STACK
)
4932 if (stack_copy
== 0)
4933 stack_copy
= (char *) xmalloc (stack_copy_size
= i
);
4934 else if (stack_copy_size
< i
)
4935 stack_copy
= (char *) xrealloc (stack_copy
, (stack_copy_size
= i
));
4938 if ((EMACS_INT
) (&stack_top_variable
- stack_bottom
) > 0)
4939 memcpy (stack_copy
, stack_bottom
, i
);
4941 memcpy (stack_copy
, &stack_top_variable
, i
);
4945 #endif /* MAX_SAVE_STACK > 0 */
4947 if (garbage_collection_messages
)
4948 message1_nolog ("Garbage collecting...");
4952 shrink_regexp_cache ();
4956 /* clear_marks (); */
4958 /* Mark all the special slots that serve as the roots of accessibility. */
4960 for (i
= 0; i
< staticidx
; i
++)
4961 mark_object (*staticvec
[i
]);
4963 for (bind
= specpdl
; bind
!= specpdl_ptr
; bind
++)
4965 mark_object (bind
->symbol
);
4966 mark_object (bind
->old_value
);
4974 extern void xg_mark_data (void);
4979 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
4980 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
4984 register struct gcpro
*tail
;
4985 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
4986 for (i
= 0; i
< tail
->nvars
; i
++)
4987 mark_object (tail
->var
[i
]);
4992 for (catch = catchlist
; catch; catch = catch->next
)
4994 mark_object (catch->tag
);
4995 mark_object (catch->val
);
4997 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
4999 mark_object (handler
->handler
);
5000 mark_object (handler
->var
);
5004 #ifdef HAVE_WINDOW_SYSTEM
5005 mark_fringe_data ();
5008 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5012 /* Everything is now marked, except for the things that require special
5013 finalization, i.e. the undo_list.
5014 Look thru every buffer's undo list
5015 for elements that update markers that were not marked,
5018 register struct buffer
*nextb
= all_buffers
;
5022 /* If a buffer's undo list is Qt, that means that undo is
5023 turned off in that buffer. Calling truncate_undo_list on
5024 Qt tends to return NULL, which effectively turns undo back on.
5025 So don't call truncate_undo_list if undo_list is Qt. */
5026 if (! EQ (nextb
->undo_list
, Qt
))
5028 Lisp_Object tail
, prev
;
5029 tail
= nextb
->undo_list
;
5031 while (CONSP (tail
))
5033 if (CONSP (XCAR (tail
))
5034 && MARKERP (XCAR (XCAR (tail
)))
5035 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
5038 nextb
->undo_list
= tail
= XCDR (tail
);
5042 XSETCDR (prev
, tail
);
5052 /* Now that we have stripped the elements that need not be in the
5053 undo_list any more, we can finally mark the list. */
5054 mark_object (nextb
->undo_list
);
5056 nextb
= nextb
->next
;
5062 /* Clear the mark bits that we set in certain root slots. */
5064 unmark_byte_stack ();
5065 VECTOR_UNMARK (&buffer_defaults
);
5066 VECTOR_UNMARK (&buffer_local_symbols
);
5068 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
5076 /* clear_marks (); */
5079 consing_since_gc
= 0;
5080 if (gc_cons_threshold
< 10000)
5081 gc_cons_threshold
= 10000;
5083 if (FLOATP (Vgc_cons_percentage
))
5084 { /* Set gc_cons_combined_threshold. */
5085 EMACS_INT total
= 0;
5087 total
+= total_conses
* sizeof (struct Lisp_Cons
);
5088 total
+= total_symbols
* sizeof (struct Lisp_Symbol
);
5089 total
+= total_markers
* sizeof (union Lisp_Misc
);
5090 total
+= total_string_size
;
5091 total
+= total_vector_size
* sizeof (Lisp_Object
);
5092 total
+= total_floats
* sizeof (struct Lisp_Float
);
5093 total
+= total_intervals
* sizeof (struct interval
);
5094 total
+= total_strings
* sizeof (struct Lisp_String
);
5096 gc_relative_threshold
= total
* XFLOAT_DATA (Vgc_cons_percentage
);
5099 gc_relative_threshold
= 0;
5101 if (garbage_collection_messages
)
5103 if (message_p
|| minibuf_level
> 0)
5106 message1_nolog ("Garbage collecting...done");
5109 unbind_to (count
, Qnil
);
5111 total
[0] = Fcons (make_number (total_conses
),
5112 make_number (total_free_conses
));
5113 total
[1] = Fcons (make_number (total_symbols
),
5114 make_number (total_free_symbols
));
5115 total
[2] = Fcons (make_number (total_markers
),
5116 make_number (total_free_markers
));
5117 total
[3] = make_number (total_string_size
);
5118 total
[4] = make_number (total_vector_size
);
5119 total
[5] = Fcons (make_number (total_floats
),
5120 make_number (total_free_floats
));
5121 total
[6] = Fcons (make_number (total_intervals
),
5122 make_number (total_free_intervals
));
5123 total
[7] = Fcons (make_number (total_strings
),
5124 make_number (total_free_strings
));
5126 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5128 /* Compute average percentage of zombies. */
5131 for (i
= 0; i
< 7; ++i
)
5132 if (CONSP (total
[i
]))
5133 nlive
+= XFASTINT (XCAR (total
[i
]));
5135 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
5136 max_live
= max (nlive
, max_live
);
5137 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
5138 max_zombies
= max (nzombies
, max_zombies
);
5143 if (!NILP (Vpost_gc_hook
))
5145 int count
= inhibit_garbage_collection ();
5146 safe_run_hooks (Qpost_gc_hook
);
5147 unbind_to (count
, Qnil
);
5150 /* Accumulate statistics. */
5151 EMACS_GET_TIME (t2
);
5152 EMACS_SUB_TIME (t3
, t2
, t1
);
5153 if (FLOATP (Vgc_elapsed
))
5154 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
) +
5156 EMACS_USECS (t3
) * 1.0e-6);
5159 return Flist (sizeof total
/ sizeof *total
, total
);
5163 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
5164 only interesting objects referenced from glyphs are strings. */
5167 mark_glyph_matrix (struct glyph_matrix
*matrix
)
5169 struct glyph_row
*row
= matrix
->rows
;
5170 struct glyph_row
*end
= row
+ matrix
->nrows
;
5172 for (; row
< end
; ++row
)
5176 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
5178 struct glyph
*glyph
= row
->glyphs
[area
];
5179 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
5181 for (; glyph
< end_glyph
; ++glyph
)
5182 if (STRINGP (glyph
->object
)
5183 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
5184 mark_object (glyph
->object
);
5190 /* Mark Lisp faces in the face cache C. */
5193 mark_face_cache (struct face_cache
*c
)
5198 for (i
= 0; i
< c
->used
; ++i
)
5200 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
5204 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
5205 mark_object (face
->lface
[j
]);
5213 /* Mark reference to a Lisp_Object.
5214 If the object referred to has not been seen yet, recursively mark
5215 all the references contained in it. */
5217 #define LAST_MARKED_SIZE 500
5218 static Lisp_Object last_marked
[LAST_MARKED_SIZE
];
5219 int last_marked_index
;
5221 /* For debugging--call abort when we cdr down this many
5222 links of a list, in mark_object. In debugging,
5223 the call to abort will hit a breakpoint.
5224 Normally this is zero and the check never goes off. */
5225 static int mark_object_loop_halt
;
5228 mark_vectorlike (struct Lisp_Vector
*ptr
)
5230 register EMACS_INT size
= ptr
->size
;
5233 eassert (!VECTOR_MARKED_P (ptr
));
5234 VECTOR_MARK (ptr
); /* Else mark it */
5235 if (size
& PSEUDOVECTOR_FLAG
)
5236 size
&= PSEUDOVECTOR_SIZE_MASK
;
5238 /* Note that this size is not the memory-footprint size, but only
5239 the number of Lisp_Object fields that we should trace.
5240 The distinction is used e.g. by Lisp_Process which places extra
5241 non-Lisp_Object fields at the end of the structure. */
5242 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5243 mark_object (ptr
->contents
[i
]);
5246 /* Like mark_vectorlike but optimized for char-tables (and
5247 sub-char-tables) assuming that the contents are mostly integers or
5251 mark_char_table (struct Lisp_Vector
*ptr
)
5253 register EMACS_INT size
= ptr
->size
& PSEUDOVECTOR_SIZE_MASK
;
5256 eassert (!VECTOR_MARKED_P (ptr
));
5258 for (i
= 0; i
< size
; i
++)
5260 Lisp_Object val
= ptr
->contents
[i
];
5262 if (INTEGERP (val
) || SYMBOLP (val
) && XSYMBOL (val
)->gcmarkbit
)
5264 if (SUB_CHAR_TABLE_P (val
))
5266 if (! VECTOR_MARKED_P (XVECTOR (val
)))
5267 mark_char_table (XVECTOR (val
));
5275 mark_object (Lisp_Object arg
)
5277 register Lisp_Object obj
= arg
;
5278 #ifdef GC_CHECK_MARKED_OBJECTS
5286 if (PURE_POINTER_P (XPNTR (obj
)))
5289 last_marked
[last_marked_index
++] = obj
;
5290 if (last_marked_index
== LAST_MARKED_SIZE
)
5291 last_marked_index
= 0;
5293 /* Perform some sanity checks on the objects marked here. Abort if
5294 we encounter an object we know is bogus. This increases GC time
5295 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
5296 #ifdef GC_CHECK_MARKED_OBJECTS
5298 po
= (void *) XPNTR (obj
);
5300 /* Check that the object pointed to by PO is known to be a Lisp
5301 structure allocated from the heap. */
5302 #define CHECK_ALLOCATED() \
5304 m = mem_find (po); \
5309 /* Check that the object pointed to by PO is live, using predicate
5311 #define CHECK_LIVE(LIVEP) \
5313 if (!LIVEP (m, po)) \
5317 /* Check both of the above conditions. */
5318 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
5320 CHECK_ALLOCATED (); \
5321 CHECK_LIVE (LIVEP); \
5324 #else /* not GC_CHECK_MARKED_OBJECTS */
5326 #define CHECK_ALLOCATED() (void) 0
5327 #define CHECK_LIVE(LIVEP) (void) 0
5328 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
5330 #endif /* not GC_CHECK_MARKED_OBJECTS */
5332 switch (SWITCH_ENUM_CAST (XTYPE (obj
)))
5336 register struct Lisp_String
*ptr
= XSTRING (obj
);
5337 if (STRING_MARKED_P (ptr
))
5339 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
5340 MARK_INTERVAL_TREE (ptr
->intervals
);
5342 #ifdef GC_CHECK_STRING_BYTES
5343 /* Check that the string size recorded in the string is the
5344 same as the one recorded in the sdata structure. */
5345 CHECK_STRING_BYTES (ptr
);
5346 #endif /* GC_CHECK_STRING_BYTES */
5350 case Lisp_Vectorlike
:
5351 if (VECTOR_MARKED_P (XVECTOR (obj
)))
5353 #ifdef GC_CHECK_MARKED_OBJECTS
5355 if (m
== MEM_NIL
&& !SUBRP (obj
)
5356 && po
!= &buffer_defaults
5357 && po
!= &buffer_local_symbols
)
5359 #endif /* GC_CHECK_MARKED_OBJECTS */
5363 #ifdef GC_CHECK_MARKED_OBJECTS
5364 if (po
!= &buffer_defaults
&& po
!= &buffer_local_symbols
)
5367 for (b
= all_buffers
; b
&& b
!= po
; b
= b
->next
)
5372 #endif /* GC_CHECK_MARKED_OBJECTS */
5375 else if (SUBRP (obj
))
5377 else if (COMPILEDP (obj
))
5378 /* We could treat this just like a vector, but it is better to
5379 save the COMPILED_CONSTANTS element for last and avoid
5382 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5383 register EMACS_INT size
= ptr
->size
;
5386 CHECK_LIVE (live_vector_p
);
5387 VECTOR_MARK (ptr
); /* Else mark it */
5388 size
&= PSEUDOVECTOR_SIZE_MASK
;
5389 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5391 if (i
!= COMPILED_CONSTANTS
)
5392 mark_object (ptr
->contents
[i
]);
5394 obj
= ptr
->contents
[COMPILED_CONSTANTS
];
5397 else if (FRAMEP (obj
))
5399 register struct frame
*ptr
= XFRAME (obj
);
5400 mark_vectorlike (XVECTOR (obj
));
5401 mark_face_cache (ptr
->face_cache
);
5403 else if (WINDOWP (obj
))
5405 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5406 struct window
*w
= XWINDOW (obj
);
5407 mark_vectorlike (ptr
);
5408 /* Mark glyphs for leaf windows. Marking window matrices is
5409 sufficient because frame matrices use the same glyph
5411 if (NILP (w
->hchild
)
5413 && w
->current_matrix
)
5415 mark_glyph_matrix (w
->current_matrix
);
5416 mark_glyph_matrix (w
->desired_matrix
);
5419 else if (HASH_TABLE_P (obj
))
5421 struct Lisp_Hash_Table
*h
= XHASH_TABLE (obj
);
5422 mark_vectorlike ((struct Lisp_Vector
*)h
);
5423 /* If hash table is not weak, mark all keys and values.
5424 For weak tables, mark only the vector. */
5426 mark_object (h
->key_and_value
);
5428 VECTOR_MARK (XVECTOR (h
->key_and_value
));
5430 else if (CHAR_TABLE_P (obj
))
5431 mark_char_table (XVECTOR (obj
));
5433 mark_vectorlike (XVECTOR (obj
));
5438 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
5439 struct Lisp_Symbol
*ptrx
;
5443 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
5445 mark_object (ptr
->function
);
5446 mark_object (ptr
->plist
);
5447 switch (ptr
->redirect
)
5449 case SYMBOL_PLAINVAL
: mark_object (SYMBOL_VAL (ptr
)); break;
5450 case SYMBOL_VARALIAS
:
5453 XSETSYMBOL (tem
, SYMBOL_ALIAS (ptr
));
5457 case SYMBOL_LOCALIZED
:
5459 struct Lisp_Buffer_Local_Value
*blv
= SYMBOL_BLV (ptr
);
5460 /* If the value is forwarded to a buffer or keyboard field,
5461 these are marked when we see the corresponding object.
5462 And if it's forwarded to a C variable, either it's not
5463 a Lisp_Object var, or it's staticpro'd already. */
5464 mark_object (blv
->where
);
5465 mark_object (blv
->valcell
);
5466 mark_object (blv
->defcell
);
5469 case SYMBOL_FORWARDED
:
5470 /* If the value is forwarded to a buffer or keyboard field,
5471 these are marked when we see the corresponding object.
5472 And if it's forwarded to a C variable, either it's not
5473 a Lisp_Object var, or it's staticpro'd already. */
5477 if (!PURE_POINTER_P (XSTRING (ptr
->xname
)))
5478 MARK_STRING (XSTRING (ptr
->xname
));
5479 MARK_INTERVAL_TREE (STRING_INTERVALS (ptr
->xname
));
5484 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun */
5485 XSETSYMBOL (obj
, ptrx
);
5492 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
5493 if (XMISCANY (obj
)->gcmarkbit
)
5495 XMISCANY (obj
)->gcmarkbit
= 1;
5497 switch (XMISCTYPE (obj
))
5500 case Lisp_Misc_Marker
:
5501 /* DO NOT mark thru the marker's chain.
5502 The buffer's markers chain does not preserve markers from gc;
5503 instead, markers are removed from the chain when freed by gc. */
5506 case Lisp_Misc_Save_Value
:
5509 register struct Lisp_Save_Value
*ptr
= XSAVE_VALUE (obj
);
5510 /* If DOGC is set, POINTER is the address of a memory
5511 area containing INTEGER potential Lisp_Objects. */
5514 Lisp_Object
*p
= (Lisp_Object
*) ptr
->pointer
;
5516 for (nelt
= ptr
->integer
; nelt
> 0; nelt
--, p
++)
5517 mark_maybe_object (*p
);
5523 case Lisp_Misc_Overlay
:
5525 struct Lisp_Overlay
*ptr
= XOVERLAY (obj
);
5526 mark_object (ptr
->start
);
5527 mark_object (ptr
->end
);
5528 mark_object (ptr
->plist
);
5531 XSETMISC (obj
, ptr
->next
);
5544 register struct Lisp_Cons
*ptr
= XCONS (obj
);
5545 if (CONS_MARKED_P (ptr
))
5547 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
5549 /* If the cdr is nil, avoid recursion for the car. */
5550 if (EQ (ptr
->u
.cdr
, Qnil
))
5556 mark_object (ptr
->car
);
5559 if (cdr_count
== mark_object_loop_halt
)
5565 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
5566 FLOAT_MARK (XFLOAT (obj
));
5577 #undef CHECK_ALLOCATED
5578 #undef CHECK_ALLOCATED_AND_LIVE
5581 /* Mark the pointers in a buffer structure. */
5584 mark_buffer (Lisp_Object buf
)
5586 register struct buffer
*buffer
= XBUFFER (buf
);
5587 register Lisp_Object
*ptr
, tmp
;
5588 Lisp_Object base_buffer
;
5590 eassert (!VECTOR_MARKED_P (buffer
));
5591 VECTOR_MARK (buffer
);
5593 MARK_INTERVAL_TREE (BUF_INTERVALS (buffer
));
5595 /* For now, we just don't mark the undo_list. It's done later in
5596 a special way just before the sweep phase, and after stripping
5597 some of its elements that are not needed any more. */
5599 if (buffer
->overlays_before
)
5601 XSETMISC (tmp
, buffer
->overlays_before
);
5604 if (buffer
->overlays_after
)
5606 XSETMISC (tmp
, buffer
->overlays_after
);
5610 /* buffer-local Lisp variables start at `undo_list',
5611 tho only the ones from `name' on are GC'd normally. */
5612 for (ptr
= &buffer
->name
;
5613 (char *)ptr
< (char *)buffer
+ sizeof (struct buffer
);
5617 /* If this is an indirect buffer, mark its base buffer. */
5618 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
5620 XSETBUFFER (base_buffer
, buffer
->base_buffer
);
5621 mark_buffer (base_buffer
);
5625 /* Mark the Lisp pointers in the terminal objects.
5626 Called by the Fgarbage_collector. */
5629 mark_terminals (void)
5632 for (t
= terminal_list
; t
; t
= t
->next_terminal
)
5634 eassert (t
->name
!= NULL
);
5635 if (!VECTOR_MARKED_P (t
))
5637 #ifdef HAVE_WINDOW_SYSTEM
5638 mark_image_cache (t
->image_cache
);
5639 #endif /* HAVE_WINDOW_SYSTEM */
5640 mark_vectorlike ((struct Lisp_Vector
*)t
);
5647 /* Value is non-zero if OBJ will survive the current GC because it's
5648 either marked or does not need to be marked to survive. */
5651 survives_gc_p (Lisp_Object obj
)
5655 switch (XTYPE (obj
))
5662 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
5666 survives_p
= XMISCANY (obj
)->gcmarkbit
;
5670 survives_p
= STRING_MARKED_P (XSTRING (obj
));
5673 case Lisp_Vectorlike
:
5674 survives_p
= SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
5678 survives_p
= CONS_MARKED_P (XCONS (obj
));
5682 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
5689 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
5694 /* Sweep: find all structures not marked, and free them. */
5699 /* Remove or mark entries in weak hash tables.
5700 This must be done before any object is unmarked. */
5701 sweep_weak_hash_tables ();
5704 #ifdef GC_CHECK_STRING_BYTES
5705 if (!noninteractive
)
5706 check_string_bytes (1);
5709 /* Put all unmarked conses on free list */
5711 register struct cons_block
*cblk
;
5712 struct cons_block
**cprev
= &cons_block
;
5713 register int lim
= cons_block_index
;
5714 register int num_free
= 0, num_used
= 0;
5718 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
5722 int ilim
= (lim
+ BITS_PER_INT
- 1) / BITS_PER_INT
;
5724 /* Scan the mark bits an int at a time. */
5725 for (i
= 0; i
<= ilim
; i
++)
5727 if (cblk
->gcmarkbits
[i
] == -1)
5729 /* Fast path - all cons cells for this int are marked. */
5730 cblk
->gcmarkbits
[i
] = 0;
5731 num_used
+= BITS_PER_INT
;
5735 /* Some cons cells for this int are not marked.
5736 Find which ones, and free them. */
5737 int start
, pos
, stop
;
5739 start
= i
* BITS_PER_INT
;
5741 if (stop
> BITS_PER_INT
)
5742 stop
= BITS_PER_INT
;
5745 for (pos
= start
; pos
< stop
; pos
++)
5747 if (!CONS_MARKED_P (&cblk
->conses
[pos
]))
5750 cblk
->conses
[pos
].u
.chain
= cons_free_list
;
5751 cons_free_list
= &cblk
->conses
[pos
];
5753 cons_free_list
->car
= Vdead
;
5759 CONS_UNMARK (&cblk
->conses
[pos
]);
5765 lim
= CONS_BLOCK_SIZE
;
5766 /* If this block contains only free conses and we have already
5767 seen more than two blocks worth of free conses then deallocate
5769 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
5771 *cprev
= cblk
->next
;
5772 /* Unhook from the free list. */
5773 cons_free_list
= cblk
->conses
[0].u
.chain
;
5774 lisp_align_free (cblk
);
5779 num_free
+= this_free
;
5780 cprev
= &cblk
->next
;
5783 total_conses
= num_used
;
5784 total_free_conses
= num_free
;
5787 /* Put all unmarked floats on free list */
5789 register struct float_block
*fblk
;
5790 struct float_block
**fprev
= &float_block
;
5791 register int lim
= float_block_index
;
5792 register int num_free
= 0, num_used
= 0;
5794 float_free_list
= 0;
5796 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
5800 for (i
= 0; i
< lim
; i
++)
5801 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
5804 fblk
->floats
[i
].u
.chain
= float_free_list
;
5805 float_free_list
= &fblk
->floats
[i
];
5810 FLOAT_UNMARK (&fblk
->floats
[i
]);
5812 lim
= FLOAT_BLOCK_SIZE
;
5813 /* If this block contains only free floats and we have already
5814 seen more than two blocks worth of free floats then deallocate
5816 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
5818 *fprev
= fblk
->next
;
5819 /* Unhook from the free list. */
5820 float_free_list
= fblk
->floats
[0].u
.chain
;
5821 lisp_align_free (fblk
);
5826 num_free
+= this_free
;
5827 fprev
= &fblk
->next
;
5830 total_floats
= num_used
;
5831 total_free_floats
= num_free
;
5834 /* Put all unmarked intervals on free list */
5836 register struct interval_block
*iblk
;
5837 struct interval_block
**iprev
= &interval_block
;
5838 register int lim
= interval_block_index
;
5839 register int num_free
= 0, num_used
= 0;
5841 interval_free_list
= 0;
5843 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
5848 for (i
= 0; i
< lim
; i
++)
5850 if (!iblk
->intervals
[i
].gcmarkbit
)
5852 SET_INTERVAL_PARENT (&iblk
->intervals
[i
], interval_free_list
);
5853 interval_free_list
= &iblk
->intervals
[i
];
5859 iblk
->intervals
[i
].gcmarkbit
= 0;
5862 lim
= INTERVAL_BLOCK_SIZE
;
5863 /* If this block contains only free intervals and we have already
5864 seen more than two blocks worth of free intervals then
5865 deallocate this block. */
5866 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
5868 *iprev
= iblk
->next
;
5869 /* Unhook from the free list. */
5870 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
5872 n_interval_blocks
--;
5876 num_free
+= this_free
;
5877 iprev
= &iblk
->next
;
5880 total_intervals
= num_used
;
5881 total_free_intervals
= num_free
;
5884 /* Put all unmarked symbols on free list */
5886 register struct symbol_block
*sblk
;
5887 struct symbol_block
**sprev
= &symbol_block
;
5888 register int lim
= symbol_block_index
;
5889 register int num_free
= 0, num_used
= 0;
5891 symbol_free_list
= NULL
;
5893 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
5896 struct Lisp_Symbol
*sym
= sblk
->symbols
;
5897 struct Lisp_Symbol
*end
= sym
+ lim
;
5899 for (; sym
< end
; ++sym
)
5901 /* Check if the symbol was created during loadup. In such a case
5902 it might be pointed to by pure bytecode which we don't trace,
5903 so we conservatively assume that it is live. */
5904 int pure_p
= PURE_POINTER_P (XSTRING (sym
->xname
));
5906 if (!sym
->gcmarkbit
&& !pure_p
)
5908 if (sym
->redirect
== SYMBOL_LOCALIZED
)
5909 xfree (SYMBOL_BLV (sym
));
5910 sym
->next
= symbol_free_list
;
5911 symbol_free_list
= sym
;
5913 symbol_free_list
->function
= Vdead
;
5921 UNMARK_STRING (XSTRING (sym
->xname
));
5926 lim
= SYMBOL_BLOCK_SIZE
;
5927 /* If this block contains only free symbols and we have already
5928 seen more than two blocks worth of free symbols then deallocate
5930 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
5932 *sprev
= sblk
->next
;
5933 /* Unhook from the free list. */
5934 symbol_free_list
= sblk
->symbols
[0].next
;
5940 num_free
+= this_free
;
5941 sprev
= &sblk
->next
;
5944 total_symbols
= num_used
;
5945 total_free_symbols
= num_free
;
5948 /* Put all unmarked misc's on free list.
5949 For a marker, first unchain it from the buffer it points into. */
5951 register struct marker_block
*mblk
;
5952 struct marker_block
**mprev
= &marker_block
;
5953 register int lim
= marker_block_index
;
5954 register int num_free
= 0, num_used
= 0;
5956 marker_free_list
= 0;
5958 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
5963 for (i
= 0; i
< lim
; i
++)
5965 if (!mblk
->markers
[i
].u_any
.gcmarkbit
)
5967 if (mblk
->markers
[i
].u_any
.type
== Lisp_Misc_Marker
)
5968 unchain_marker (&mblk
->markers
[i
].u_marker
);
5969 /* Set the type of the freed object to Lisp_Misc_Free.
5970 We could leave the type alone, since nobody checks it,
5971 but this might catch bugs faster. */
5972 mblk
->markers
[i
].u_marker
.type
= Lisp_Misc_Free
;
5973 mblk
->markers
[i
].u_free
.chain
= marker_free_list
;
5974 marker_free_list
= &mblk
->markers
[i
];
5980 mblk
->markers
[i
].u_any
.gcmarkbit
= 0;
5983 lim
= MARKER_BLOCK_SIZE
;
5984 /* If this block contains only free markers and we have already
5985 seen more than two blocks worth of free markers then deallocate
5987 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
5989 *mprev
= mblk
->next
;
5990 /* Unhook from the free list. */
5991 marker_free_list
= mblk
->markers
[0].u_free
.chain
;
5997 num_free
+= this_free
;
5998 mprev
= &mblk
->next
;
6002 total_markers
= num_used
;
6003 total_free_markers
= num_free
;
6006 /* Free all unmarked buffers */
6008 register struct buffer
*buffer
= all_buffers
, *prev
= 0, *next
;
6011 if (!VECTOR_MARKED_P (buffer
))
6014 prev
->next
= buffer
->next
;
6016 all_buffers
= buffer
->next
;
6017 next
= buffer
->next
;
6023 VECTOR_UNMARK (buffer
);
6024 UNMARK_BALANCE_INTERVALS (BUF_INTERVALS (buffer
));
6025 prev
= buffer
, buffer
= buffer
->next
;
6029 /* Free all unmarked vectors */
6031 register struct Lisp_Vector
*vector
= all_vectors
, *prev
= 0, *next
;
6032 total_vector_size
= 0;
6035 if (!VECTOR_MARKED_P (vector
))
6038 prev
->next
= vector
->next
;
6040 all_vectors
= vector
->next
;
6041 next
= vector
->next
;
6049 VECTOR_UNMARK (vector
);
6050 if (vector
->size
& PSEUDOVECTOR_FLAG
)
6051 total_vector_size
+= (PSEUDOVECTOR_SIZE_MASK
& vector
->size
);
6053 total_vector_size
+= vector
->size
;
6054 prev
= vector
, vector
= vector
->next
;
6058 #ifdef GC_CHECK_STRING_BYTES
6059 if (!noninteractive
)
6060 check_string_bytes (1);
6067 /* Debugging aids. */
6069 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
6070 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
6071 This may be helpful in debugging Emacs's memory usage.
6072 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
6077 XSETINT (end
, (EMACS_INT
) sbrk (0) / 1024);
6082 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
6083 doc
: /* Return a list of counters that measure how much consing there has been.
6084 Each of these counters increments for a certain kind of object.
6085 The counters wrap around from the largest positive integer to zero.
6086 Garbage collection does not decrease them.
6087 The elements of the value are as follows:
6088 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
6089 All are in units of 1 = one object consed
6090 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
6092 MISCS include overlays, markers, and some internal types.
6093 Frames, windows, buffers, and subprocesses count as vectors
6094 (but the contents of a buffer's text do not count here). */)
6097 Lisp_Object consed
[8];
6099 consed
[0] = make_number (min (MOST_POSITIVE_FIXNUM
, cons_cells_consed
));
6100 consed
[1] = make_number (min (MOST_POSITIVE_FIXNUM
, floats_consed
));
6101 consed
[2] = make_number (min (MOST_POSITIVE_FIXNUM
, vector_cells_consed
));
6102 consed
[3] = make_number (min (MOST_POSITIVE_FIXNUM
, symbols_consed
));
6103 consed
[4] = make_number (min (MOST_POSITIVE_FIXNUM
, string_chars_consed
));
6104 consed
[5] = make_number (min (MOST_POSITIVE_FIXNUM
, misc_objects_consed
));
6105 consed
[6] = make_number (min (MOST_POSITIVE_FIXNUM
, intervals_consed
));
6106 consed
[7] = make_number (min (MOST_POSITIVE_FIXNUM
, strings_consed
));
6108 return Flist (8, consed
);
6111 int suppress_checking
;
6114 die (const char *msg
, const char *file
, int line
)
6116 fprintf (stderr
, "\r\n%s:%d: Emacs fatal error: %s\r\n",
6121 /* Initialization */
6124 init_alloc_once (void)
6126 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
6128 pure_size
= PURESIZE
;
6129 pure_bytes_used
= 0;
6130 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
6131 pure_bytes_used_before_overflow
= 0;
6133 /* Initialize the list of free aligned blocks. */
6136 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
6138 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
6142 ignore_warnings
= 1;
6143 #ifdef DOUG_LEA_MALLOC
6144 mallopt (M_TRIM_THRESHOLD
, 128*1024); /* trim threshold */
6145 mallopt (M_MMAP_THRESHOLD
, 64*1024); /* mmap threshold */
6146 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* max. number of mmap'ed areas */
6154 init_weak_hash_tables ();
6157 malloc_hysteresis
= 32;
6159 malloc_hysteresis
= 0;
6162 refill_memory_reserve ();
6164 ignore_warnings
= 0;
6166 byte_stack_list
= 0;
6168 consing_since_gc
= 0;
6169 gc_cons_threshold
= 100000 * sizeof (Lisp_Object
);
6170 gc_relative_threshold
= 0;
6177 byte_stack_list
= 0;
6179 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
6180 setjmp_tested_p
= longjmps_done
= 0;
6183 Vgc_elapsed
= make_float (0.0);
6188 syms_of_alloc (void)
6190 DEFVAR_INT ("gc-cons-threshold", &gc_cons_threshold
,
6191 doc
: /* *Number of bytes of consing between garbage collections.
6192 Garbage collection can happen automatically once this many bytes have been
6193 allocated since the last garbage collection. All data types count.
6195 Garbage collection happens automatically only when `eval' is called.
6197 By binding this temporarily to a large number, you can effectively
6198 prevent garbage collection during a part of the program.
6199 See also `gc-cons-percentage'. */);
6201 DEFVAR_LISP ("gc-cons-percentage", &Vgc_cons_percentage
,
6202 doc
: /* *Portion of the heap used for allocation.
6203 Garbage collection can happen automatically once this portion of the heap
6204 has been allocated since the last garbage collection.
6205 If this portion is smaller than `gc-cons-threshold', this is ignored. */);
6206 Vgc_cons_percentage
= make_float (0.1);
6208 DEFVAR_INT ("pure-bytes-used", &pure_bytes_used
,
6209 doc
: /* Number of bytes of sharable Lisp data allocated so far. */);
6211 DEFVAR_INT ("cons-cells-consed", &cons_cells_consed
,
6212 doc
: /* Number of cons cells that have been consed so far. */);
6214 DEFVAR_INT ("floats-consed", &floats_consed
,
6215 doc
: /* Number of floats that have been consed so far. */);
6217 DEFVAR_INT ("vector-cells-consed", &vector_cells_consed
,
6218 doc
: /* Number of vector cells that have been consed so far. */);
6220 DEFVAR_INT ("symbols-consed", &symbols_consed
,
6221 doc
: /* Number of symbols that have been consed so far. */);
6223 DEFVAR_INT ("string-chars-consed", &string_chars_consed
,
6224 doc
: /* Number of string characters that have been consed so far. */);
6226 DEFVAR_INT ("misc-objects-consed", &misc_objects_consed
,
6227 doc
: /* Number of miscellaneous objects that have been consed so far. */);
6229 DEFVAR_INT ("intervals-consed", &intervals_consed
,
6230 doc
: /* Number of intervals that have been consed so far. */);
6232 DEFVAR_INT ("strings-consed", &strings_consed
,
6233 doc
: /* Number of strings that have been consed so far. */);
6235 DEFVAR_LISP ("purify-flag", &Vpurify_flag
,
6236 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
6237 This means that certain objects should be allocated in shared (pure) space.
6238 It can also be set to a hash-table, in which case this table is used to
6239 do hash-consing of the objects allocated to pure space. */);
6241 DEFVAR_BOOL ("garbage-collection-messages", &garbage_collection_messages
,
6242 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
6243 garbage_collection_messages
= 0;
6245 DEFVAR_LISP ("post-gc-hook", &Vpost_gc_hook
,
6246 doc
: /* Hook run after garbage collection has finished. */);
6247 Vpost_gc_hook
= Qnil
;
6248 Qpost_gc_hook
= intern_c_string ("post-gc-hook");
6249 staticpro (&Qpost_gc_hook
);
6251 DEFVAR_LISP ("memory-signal-data", &Vmemory_signal_data
,
6252 doc
: /* Precomputed `signal' argument for memory-full error. */);
6253 /* We build this in advance because if we wait until we need it, we might
6254 not be able to allocate the memory to hold it. */
6256 = pure_cons (Qerror
,
6257 pure_cons (make_pure_c_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"), Qnil
));
6259 DEFVAR_LISP ("memory-full", &Vmemory_full
,
6260 doc
: /* Non-nil means Emacs cannot get much more Lisp memory. */);
6261 Vmemory_full
= Qnil
;
6263 staticpro (&Qgc_cons_threshold
);
6264 Qgc_cons_threshold
= intern_c_string ("gc-cons-threshold");
6266 staticpro (&Qchar_table_extra_slots
);
6267 Qchar_table_extra_slots
= intern_c_string ("char-table-extra-slots");
6269 DEFVAR_LISP ("gc-elapsed", &Vgc_elapsed
,
6270 doc
: /* Accumulated time elapsed in garbage collections.
6271 The time is in seconds as a floating point value. */);
6272 DEFVAR_INT ("gcs-done", &gcs_done
,
6273 doc
: /* Accumulated number of garbage collections done. */);
6278 defsubr (&Smake_byte_code
);
6279 defsubr (&Smake_list
);
6280 defsubr (&Smake_vector
);
6281 defsubr (&Smake_string
);
6282 defsubr (&Smake_bool_vector
);
6283 defsubr (&Smake_symbol
);
6284 defsubr (&Smake_marker
);
6285 defsubr (&Spurecopy
);
6286 defsubr (&Sgarbage_collect
);
6287 defsubr (&Smemory_limit
);
6288 defsubr (&Smemory_use_counts
);
6290 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
6291 defsubr (&Sgc_status
);
6295 /* arch-tag: 6695ca10-e3c5-4c2c-8bc3-ed26a7dda857
6296 (do not change this comment) */