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 Free Software Foundation, Inc.
5 This file is part of GNU Emacs.
7 GNU Emacs is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
12 GNU Emacs is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU Emacs; see the file COPYING. If not, write to
19 the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
20 Boston, MA 02110-1301, USA. */
24 #include <limits.h> /* For CHAR_BIT. */
27 #include <stddef.h> /* For offsetof, used by PSEUDOVECSIZE. */
34 /* Note that this declares bzero on OSF/1. How dumb. */
38 #ifdef HAVE_GTK_AND_PTHREAD
42 /* This file is part of the core Lisp implementation, and thus must
43 deal with the real data structures. If the Lisp implementation is
44 replaced, this file likely will not be used. */
46 #undef HIDE_LISP_IMPLEMENTATION
49 #include "intervals.h"
55 #include "blockinput.h"
56 #include "character.h"
57 #include "syssignal.h"
58 #include "termhooks.h" /* For struct terminal. */
61 /* GC_MALLOC_CHECK defined means perform validity checks of malloc'd
62 memory. Can do this only if using gmalloc.c. */
64 #if defined SYSTEM_MALLOC || defined DOUG_LEA_MALLOC
65 #undef GC_MALLOC_CHECK
71 extern POINTER_TYPE
*sbrk ();
75 #define INCLUDED_FCNTL
87 #ifdef DOUG_LEA_MALLOC
90 /* malloc.h #defines this as size_t, at least in glibc2. */
91 #ifndef __malloc_size_t
92 #define __malloc_size_t int
95 /* Specify maximum number of areas to mmap. It would be nice to use a
96 value that explicitly means "no limit". */
98 #define MMAP_MAX_AREAS 100000000
100 #else /* not DOUG_LEA_MALLOC */
102 /* The following come from gmalloc.c. */
104 #define __malloc_size_t size_t
105 extern __malloc_size_t _bytes_used
;
106 extern __malloc_size_t __malloc_extra_blocks
;
108 #endif /* not DOUG_LEA_MALLOC */
110 #if ! defined (SYSTEM_MALLOC) && defined (HAVE_GTK_AND_PTHREAD)
112 /* When GTK uses the file chooser dialog, different backends can be loaded
113 dynamically. One such a backend is the Gnome VFS backend that gets loaded
114 if you run Gnome. That backend creates several threads and also allocates
117 If Emacs sets malloc hooks (! SYSTEM_MALLOC) and the emacs_blocked_*
118 functions below are called from malloc, there is a chance that one
119 of these threads preempts the Emacs main thread and the hook variables
120 end up in an inconsistent state. So we have a mutex to prevent that (note
121 that the backend handles concurrent access to malloc within its own threads
122 but Emacs code running in the main thread is not included in that control).
124 When UNBLOCK_INPUT is called, reinvoke_input_signal may be called. If this
125 happens in one of the backend threads we will have two threads that tries
126 to run Emacs code at once, and the code is not prepared for that.
127 To prevent that, we only call BLOCK/UNBLOCK from the main thread. */
129 static pthread_mutex_t alloc_mutex
;
131 #define BLOCK_INPUT_ALLOC \
134 if (pthread_equal (pthread_self (), main_thread)) \
136 pthread_mutex_lock (&alloc_mutex); \
139 #define UNBLOCK_INPUT_ALLOC \
142 pthread_mutex_unlock (&alloc_mutex); \
143 if (pthread_equal (pthread_self (), main_thread)) \
148 #else /* SYSTEM_MALLOC || not HAVE_GTK_AND_PTHREAD */
150 #define BLOCK_INPUT_ALLOC BLOCK_INPUT
151 #define UNBLOCK_INPUT_ALLOC UNBLOCK_INPUT
153 #endif /* SYSTEM_MALLOC || not HAVE_GTK_AND_PTHREAD */
155 /* Value of _bytes_used, when spare_memory was freed. */
157 static __malloc_size_t bytes_used_when_full
;
159 static __malloc_size_t bytes_used_when_reconsidered
;
161 /* Mark, unmark, query mark bit of a Lisp string. S must be a pointer
162 to a struct Lisp_String. */
164 #define MARK_STRING(S) ((S)->size |= ARRAY_MARK_FLAG)
165 #define UNMARK_STRING(S) ((S)->size &= ~ARRAY_MARK_FLAG)
166 #define STRING_MARKED_P(S) (((S)->size & ARRAY_MARK_FLAG) != 0)
168 #define VECTOR_MARK(V) ((V)->size |= ARRAY_MARK_FLAG)
169 #define VECTOR_UNMARK(V) ((V)->size &= ~ARRAY_MARK_FLAG)
170 #define VECTOR_MARKED_P(V) (((V)->size & ARRAY_MARK_FLAG) != 0)
172 /* Value is the number of bytes/chars of S, a pointer to a struct
173 Lisp_String. This must be used instead of STRING_BYTES (S) or
174 S->size during GC, because S->size contains the mark bit for
177 #define GC_STRING_BYTES(S) (STRING_BYTES (S))
178 #define GC_STRING_CHARS(S) ((S)->size & ~ARRAY_MARK_FLAG)
180 /* Number of bytes of consing done since the last gc. */
182 int consing_since_gc
;
184 /* Count the amount of consing of various sorts of space. */
186 EMACS_INT cons_cells_consed
;
187 EMACS_INT floats_consed
;
188 EMACS_INT vector_cells_consed
;
189 EMACS_INT symbols_consed
;
190 EMACS_INT string_chars_consed
;
191 EMACS_INT misc_objects_consed
;
192 EMACS_INT intervals_consed
;
193 EMACS_INT strings_consed
;
195 /* Minimum number of bytes of consing since GC before next GC. */
197 EMACS_INT gc_cons_threshold
;
199 /* Similar minimum, computed from Vgc_cons_percentage. */
201 EMACS_INT gc_relative_threshold
;
203 static Lisp_Object Vgc_cons_percentage
;
205 /* Minimum number of bytes of consing since GC before next GC,
206 when memory is full. */
208 EMACS_INT memory_full_cons_threshold
;
210 /* Nonzero during GC. */
214 /* Nonzero means abort if try to GC.
215 This is for code which is written on the assumption that
216 no GC will happen, so as to verify that assumption. */
220 /* Nonzero means display messages at beginning and end of GC. */
222 int garbage_collection_messages
;
224 #ifndef VIRT_ADDR_VARIES
226 #endif /* VIRT_ADDR_VARIES */
227 int malloc_sbrk_used
;
229 #ifndef VIRT_ADDR_VARIES
231 #endif /* VIRT_ADDR_VARIES */
232 int malloc_sbrk_unused
;
234 /* Number of live and free conses etc. */
236 static int total_conses
, total_markers
, total_symbols
, total_vector_size
;
237 static int total_free_conses
, total_free_markers
, total_free_symbols
;
238 static int total_free_floats
, total_floats
;
240 /* Points to memory space allocated as "spare", to be freed if we run
241 out of memory. We keep one large block, four cons-blocks, and
242 two string blocks. */
244 char *spare_memory
[7];
246 /* Amount of spare memory to keep in large reserve block. */
248 #define SPARE_MEMORY (1 << 14)
250 /* Number of extra blocks malloc should get when it needs more core. */
252 static int malloc_hysteresis
;
254 /* Non-nil means defun should do purecopy on the function definition. */
256 Lisp_Object Vpurify_flag
;
258 /* Non-nil means we are handling a memory-full error. */
260 Lisp_Object Vmemory_full
;
264 /* Initialize it to a nonzero value to force it into data space
265 (rather than bss space). That way unexec will remap it into text
266 space (pure), on some systems. We have not implemented the
267 remapping on more recent systems because this is less important
268 nowadays than in the days of small memories and timesharing. */
270 EMACS_INT pure
[(PURESIZE
+ sizeof (EMACS_INT
) - 1) / sizeof (EMACS_INT
)] = {1,};
271 #define PUREBEG (char *) pure
275 #define pure PURE_SEG_BITS /* Use shared memory segment */
276 #define PUREBEG (char *)PURE_SEG_BITS
278 #endif /* HAVE_SHM */
280 /* Pointer to the pure area, and its size. */
282 static char *purebeg
;
283 static size_t pure_size
;
285 /* Number of bytes of pure storage used before pure storage overflowed.
286 If this is non-zero, this implies that an overflow occurred. */
288 static size_t pure_bytes_used_before_overflow
;
290 /* Value is non-zero if P points into pure space. */
292 #define PURE_POINTER_P(P) \
293 (((PNTR_COMPARISON_TYPE) (P) \
294 < (PNTR_COMPARISON_TYPE) ((char *) purebeg + pure_size)) \
295 && ((PNTR_COMPARISON_TYPE) (P) \
296 >= (PNTR_COMPARISON_TYPE) purebeg))
298 /* Total number of bytes allocated in pure storage. */
300 EMACS_INT pure_bytes_used
;
302 /* Index in pure at which next pure Lisp object will be allocated.. */
304 static EMACS_INT pure_bytes_used_lisp
;
306 /* Number of bytes allocated for non-Lisp objects in pure storage. */
308 static EMACS_INT pure_bytes_used_non_lisp
;
310 /* If nonzero, this is a warning delivered by malloc and not yet
313 char *pending_malloc_warning
;
315 /* Pre-computed signal argument for use when memory is exhausted. */
317 Lisp_Object Vmemory_signal_data
;
319 /* Maximum amount of C stack to save when a GC happens. */
321 #ifndef MAX_SAVE_STACK
322 #define MAX_SAVE_STACK 16000
325 /* Buffer in which we save a copy of the C stack at each GC. */
330 /* Non-zero means ignore malloc warnings. Set during initialization.
331 Currently not used. */
335 Lisp_Object Qgc_cons_threshold
, Qchar_table_extra_slots
;
337 /* Hook run after GC has finished. */
339 Lisp_Object Vpost_gc_hook
, Qpost_gc_hook
;
341 Lisp_Object Vgc_elapsed
; /* accumulated elapsed time in GC */
342 EMACS_INT gcs_done
; /* accumulated GCs */
344 static void mark_buffer
P_ ((Lisp_Object
));
345 static void mark_terminals
P_ ((void));
346 extern void mark_kboards
P_ ((void));
347 extern void mark_ttys
P_ ((void));
348 extern void mark_backtrace
P_ ((void));
349 static void gc_sweep
P_ ((void));
350 static void mark_glyph_matrix
P_ ((struct glyph_matrix
*));
351 static void mark_face_cache
P_ ((struct face_cache
*));
353 #ifdef HAVE_WINDOW_SYSTEM
354 extern void mark_fringe_data
P_ ((void));
355 static void mark_image
P_ ((struct image
*));
356 static void mark_image_cache
P_ ((struct frame
*));
357 #endif /* HAVE_WINDOW_SYSTEM */
359 static struct Lisp_String
*allocate_string
P_ ((void));
360 static void compact_small_strings
P_ ((void));
361 static void free_large_strings
P_ ((void));
362 static void sweep_strings
P_ ((void));
364 extern int message_enable_multibyte
;
366 /* When scanning the C stack for live Lisp objects, Emacs keeps track
367 of what memory allocated via lisp_malloc is intended for what
368 purpose. This enumeration specifies the type of memory. */
379 /* We used to keep separate mem_types for subtypes of vectors such as
380 process, hash_table, frame, terminal, and window, but we never made
381 use of the distinction, so it only caused source-code complexity
382 and runtime slowdown. Minor but pointless. */
386 static POINTER_TYPE
*lisp_align_malloc
P_ ((size_t, enum mem_type
));
387 static POINTER_TYPE
*lisp_malloc
P_ ((size_t, enum mem_type
));
388 void refill_memory_reserve ();
391 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
393 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
394 #include <stdio.h> /* For fprintf. */
397 /* A unique object in pure space used to make some Lisp objects
398 on free lists recognizable in O(1). */
402 #ifdef GC_MALLOC_CHECK
404 enum mem_type allocated_mem_type
;
405 int dont_register_blocks
;
407 #endif /* GC_MALLOC_CHECK */
409 /* A node in the red-black tree describing allocated memory containing
410 Lisp data. Each such block is recorded with its start and end
411 address when it is allocated, and removed from the tree when it
414 A red-black tree is a balanced binary tree with the following
417 1. Every node is either red or black.
418 2. Every leaf is black.
419 3. If a node is red, then both of its children are black.
420 4. Every simple path from a node to a descendant leaf contains
421 the same number of black nodes.
422 5. The root is always black.
424 When nodes are inserted into the tree, or deleted from the tree,
425 the tree is "fixed" so that these properties are always true.
427 A red-black tree with N internal nodes has height at most 2
428 log(N+1). Searches, insertions and deletions are done in O(log N).
429 Please see a text book about data structures for a detailed
430 description of red-black trees. Any book worth its salt should
435 /* Children of this node. These pointers are never NULL. When there
436 is no child, the value is MEM_NIL, which points to a dummy node. */
437 struct mem_node
*left
, *right
;
439 /* The parent of this node. In the root node, this is NULL. */
440 struct mem_node
*parent
;
442 /* Start and end of allocated region. */
446 enum {MEM_BLACK
, MEM_RED
} color
;
452 /* Base address of stack. Set in main. */
454 Lisp_Object
*stack_base
;
456 /* Root of the tree describing allocated Lisp memory. */
458 static struct mem_node
*mem_root
;
460 /* Lowest and highest known address in the heap. */
462 static void *min_heap_address
, *max_heap_address
;
464 /* Sentinel node of the tree. */
466 static struct mem_node mem_z
;
467 #define MEM_NIL &mem_z
469 static POINTER_TYPE
*lisp_malloc
P_ ((size_t, enum mem_type
));
470 static struct Lisp_Vector
*allocate_vectorlike
P_ ((EMACS_INT
));
471 static void lisp_free
P_ ((POINTER_TYPE
*));
472 static void mark_stack
P_ ((void));
473 static int live_vector_p
P_ ((struct mem_node
*, void *));
474 static int live_buffer_p
P_ ((struct mem_node
*, void *));
475 static int live_string_p
P_ ((struct mem_node
*, void *));
476 static int live_cons_p
P_ ((struct mem_node
*, void *));
477 static int live_symbol_p
P_ ((struct mem_node
*, void *));
478 static int live_float_p
P_ ((struct mem_node
*, void *));
479 static int live_misc_p
P_ ((struct mem_node
*, void *));
480 static void mark_maybe_object
P_ ((Lisp_Object
));
481 static void mark_memory
P_ ((void *, void *, int));
482 static void mem_init
P_ ((void));
483 static struct mem_node
*mem_insert
P_ ((void *, void *, enum mem_type
));
484 static void mem_insert_fixup
P_ ((struct mem_node
*));
485 static void mem_rotate_left
P_ ((struct mem_node
*));
486 static void mem_rotate_right
P_ ((struct mem_node
*));
487 static void mem_delete
P_ ((struct mem_node
*));
488 static void mem_delete_fixup
P_ ((struct mem_node
*));
489 static INLINE
struct mem_node
*mem_find
P_ ((void *));
492 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
493 static void check_gcpros
P_ ((void));
496 #endif /* GC_MARK_STACK || GC_MALLOC_CHECK */
498 /* Recording what needs to be marked for gc. */
500 struct gcpro
*gcprolist
;
502 /* Addresses of staticpro'd variables. Initialize it to a nonzero
503 value; otherwise some compilers put it into BSS. */
505 #define NSTATICS 0x600
506 Lisp_Object
*staticvec
[NSTATICS
] = {&Vpurify_flag
};
508 /* Index of next unused slot in staticvec. */
512 static POINTER_TYPE
*pure_alloc
P_ ((size_t, int));
515 /* Value is SZ rounded up to the next multiple of ALIGNMENT.
516 ALIGNMENT must be a power of 2. */
518 #define ALIGN(ptr, ALIGNMENT) \
519 ((POINTER_TYPE *) ((((EMACS_UINT)(ptr)) + (ALIGNMENT) - 1) \
520 & ~((ALIGNMENT) - 1)))
524 /************************************************************************
526 ************************************************************************/
528 /* Function malloc calls this if it finds we are near exhausting storage. */
534 pending_malloc_warning
= str
;
538 /* Display an already-pending malloc warning. */
541 display_malloc_warning ()
543 call3 (intern ("display-warning"),
545 build_string (pending_malloc_warning
),
546 intern ("emergency"));
547 pending_malloc_warning
= 0;
551 #ifdef DOUG_LEA_MALLOC
552 # define BYTES_USED (mallinfo ().uordblks)
554 # define BYTES_USED _bytes_used
557 /* Called if we can't allocate relocatable space for a buffer. */
560 buffer_memory_full ()
562 /* If buffers use the relocating allocator, no need to free
563 spare_memory, because we may have plenty of malloc space left
564 that we could get, and if we don't, the malloc that fails will
565 itself cause spare_memory to be freed. If buffers don't use the
566 relocating allocator, treat this like any other failing
573 /* This used to call error, but if we've run out of memory, we could
574 get infinite recursion trying to build the string. */
575 xsignal (Qnil
, Vmemory_signal_data
);
579 #ifdef XMALLOC_OVERRUN_CHECK
581 /* Check for overrun in malloc'ed buffers by wrapping a 16 byte header
582 and a 16 byte trailer around each block.
584 The header consists of 12 fixed bytes + a 4 byte integer contaning the
585 original block size, while the trailer consists of 16 fixed bytes.
587 The header is used to detect whether this block has been allocated
588 through these functions -- as it seems that some low-level libc
589 functions may bypass the malloc hooks.
593 #define XMALLOC_OVERRUN_CHECK_SIZE 16
595 static char xmalloc_overrun_check_header
[XMALLOC_OVERRUN_CHECK_SIZE
-4] =
596 { 0x9a, 0x9b, 0xae, 0xaf,
597 0xbf, 0xbe, 0xce, 0xcf,
598 0xea, 0xeb, 0xec, 0xed };
600 static char xmalloc_overrun_check_trailer
[XMALLOC_OVERRUN_CHECK_SIZE
] =
601 { 0xaa, 0xab, 0xac, 0xad,
602 0xba, 0xbb, 0xbc, 0xbd,
603 0xca, 0xcb, 0xcc, 0xcd,
604 0xda, 0xdb, 0xdc, 0xdd };
606 /* Macros to insert and extract the block size in the header. */
608 #define XMALLOC_PUT_SIZE(ptr, size) \
609 (ptr[-1] = (size & 0xff), \
610 ptr[-2] = ((size >> 8) & 0xff), \
611 ptr[-3] = ((size >> 16) & 0xff), \
612 ptr[-4] = ((size >> 24) & 0xff))
614 #define XMALLOC_GET_SIZE(ptr) \
615 (size_t)((unsigned)(ptr[-1]) | \
616 ((unsigned)(ptr[-2]) << 8) | \
617 ((unsigned)(ptr[-3]) << 16) | \
618 ((unsigned)(ptr[-4]) << 24))
621 /* The call depth in overrun_check functions. For example, this might happen:
623 overrun_check_malloc()
624 -> malloc -> (via hook)_-> emacs_blocked_malloc
625 -> overrun_check_malloc
626 call malloc (hooks are NULL, so real malloc is called).
627 malloc returns 10000.
628 add overhead, return 10016.
629 <- (back in overrun_check_malloc)
630 add overhead again, return 10032
631 xmalloc returns 10032.
636 overrun_check_free(10032)
638 free(10016) <- crash, because 10000 is the original pointer. */
640 static int check_depth
;
642 /* Like malloc, but wraps allocated block with header and trailer. */
645 overrun_check_malloc (size
)
648 register unsigned char *val
;
649 size_t overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_SIZE
*2 : 0;
651 val
= (unsigned char *) malloc (size
+ overhead
);
652 if (val
&& check_depth
== 1)
654 bcopy (xmalloc_overrun_check_header
, val
, XMALLOC_OVERRUN_CHECK_SIZE
- 4);
655 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
656 XMALLOC_PUT_SIZE(val
, size
);
657 bcopy (xmalloc_overrun_check_trailer
, val
+ size
, XMALLOC_OVERRUN_CHECK_SIZE
);
660 return (POINTER_TYPE
*)val
;
664 /* Like realloc, but checks old block for overrun, and wraps new block
665 with header and trailer. */
668 overrun_check_realloc (block
, size
)
672 register unsigned char *val
= (unsigned char *)block
;
673 size_t overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_SIZE
*2 : 0;
677 && bcmp (xmalloc_overrun_check_header
,
678 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
679 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
681 size_t osize
= XMALLOC_GET_SIZE (val
);
682 if (bcmp (xmalloc_overrun_check_trailer
,
684 XMALLOC_OVERRUN_CHECK_SIZE
))
686 bzero (val
+ osize
, XMALLOC_OVERRUN_CHECK_SIZE
);
687 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
688 bzero (val
, XMALLOC_OVERRUN_CHECK_SIZE
);
691 val
= (unsigned char *) realloc ((POINTER_TYPE
*)val
, size
+ overhead
);
693 if (val
&& check_depth
== 1)
695 bcopy (xmalloc_overrun_check_header
, val
, XMALLOC_OVERRUN_CHECK_SIZE
- 4);
696 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
697 XMALLOC_PUT_SIZE(val
, size
);
698 bcopy (xmalloc_overrun_check_trailer
, val
+ size
, XMALLOC_OVERRUN_CHECK_SIZE
);
701 return (POINTER_TYPE
*)val
;
704 /* Like free, but checks block for overrun. */
707 overrun_check_free (block
)
710 unsigned char *val
= (unsigned char *)block
;
715 && bcmp (xmalloc_overrun_check_header
,
716 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
717 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
719 size_t osize
= XMALLOC_GET_SIZE (val
);
720 if (bcmp (xmalloc_overrun_check_trailer
,
722 XMALLOC_OVERRUN_CHECK_SIZE
))
724 #ifdef XMALLOC_CLEAR_FREE_MEMORY
725 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
726 memset (val
, 0xff, osize
+ XMALLOC_OVERRUN_CHECK_SIZE
*2);
728 bzero (val
+ osize
, XMALLOC_OVERRUN_CHECK_SIZE
);
729 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
730 bzero (val
, XMALLOC_OVERRUN_CHECK_SIZE
);
741 #define malloc overrun_check_malloc
742 #define realloc overrun_check_realloc
743 #define free overrun_check_free
747 /* When using SYNC_INPUT, we don't call malloc from a signal handler, so
748 there's no need to block input around malloc. */
749 #define MALLOC_BLOCK_INPUT ((void)0)
750 #define MALLOC_UNBLOCK_INPUT ((void)0)
752 #define MALLOC_BLOCK_INPUT BLOCK_INPUT
753 #define MALLOC_UNBLOCK_INPUT UNBLOCK_INPUT
756 /* Like malloc but check for no memory and block interrupt input.. */
762 register POINTER_TYPE
*val
;
765 val
= (POINTER_TYPE
*) malloc (size
);
766 MALLOC_UNBLOCK_INPUT
;
774 /* Like realloc but check for no memory and block interrupt input.. */
777 xrealloc (block
, size
)
781 register POINTER_TYPE
*val
;
784 /* We must call malloc explicitly when BLOCK is 0, since some
785 reallocs don't do this. */
787 val
= (POINTER_TYPE
*) malloc (size
);
789 val
= (POINTER_TYPE
*) realloc (block
, size
);
790 MALLOC_UNBLOCK_INPUT
;
792 if (!val
&& size
) memory_full ();
797 /* Like free but block interrupt input. */
805 MALLOC_UNBLOCK_INPUT
;
806 /* We don't call refill_memory_reserve here
807 because that duplicates doing so in emacs_blocked_free
808 and the criterion should go there. */
812 /* Like strdup, but uses xmalloc. */
818 size_t len
= strlen (s
) + 1;
819 char *p
= (char *) xmalloc (len
);
825 /* Unwind for SAFE_ALLOCA */
828 safe_alloca_unwind (arg
)
831 register struct Lisp_Save_Value
*p
= XSAVE_VALUE (arg
);
841 /* Like malloc but used for allocating Lisp data. NBYTES is the
842 number of bytes to allocate, TYPE describes the intended use of the
843 allcated memory block (for strings, for conses, ...). */
846 static void *lisp_malloc_loser
;
849 static POINTER_TYPE
*
850 lisp_malloc (nbytes
, type
)
858 #ifdef GC_MALLOC_CHECK
859 allocated_mem_type
= type
;
862 val
= (void *) malloc (nbytes
);
865 /* If the memory just allocated cannot be addressed thru a Lisp
866 object's pointer, and it needs to be,
867 that's equivalent to running out of memory. */
868 if (val
&& type
!= MEM_TYPE_NON_LISP
)
871 XSETCONS (tem
, (char *) val
+ nbytes
- 1);
872 if ((char *) XCONS (tem
) != (char *) val
+ nbytes
- 1)
874 lisp_malloc_loser
= val
;
881 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
882 if (val
&& type
!= MEM_TYPE_NON_LISP
)
883 mem_insert (val
, (char *) val
+ nbytes
, type
);
886 MALLOC_UNBLOCK_INPUT
;
892 /* Free BLOCK. This must be called to free memory allocated with a
893 call to lisp_malloc. */
901 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
902 mem_delete (mem_find (block
));
904 MALLOC_UNBLOCK_INPUT
;
907 /* Allocation of aligned blocks of memory to store Lisp data. */
908 /* The entry point is lisp_align_malloc which returns blocks of at most */
909 /* BLOCK_BYTES and guarantees they are aligned on a BLOCK_ALIGN boundary. */
911 /* Use posix_memalloc if the system has it and we're using the system's
912 malloc (because our gmalloc.c routines don't have posix_memalign although
913 its memalloc could be used). */
914 #if defined (HAVE_POSIX_MEMALIGN) && defined (SYSTEM_MALLOC)
915 #define USE_POSIX_MEMALIGN 1
918 /* BLOCK_ALIGN has to be a power of 2. */
919 #define BLOCK_ALIGN (1 << 10)
921 /* Padding to leave at the end of a malloc'd block. This is to give
922 malloc a chance to minimize the amount of memory wasted to alignment.
923 It should be tuned to the particular malloc library used.
924 On glibc-2.3.2, malloc never tries to align, so a padding of 0 is best.
925 posix_memalign on the other hand would ideally prefer a value of 4
926 because otherwise, there's 1020 bytes wasted between each ablocks.
927 In Emacs, testing shows that those 1020 can most of the time be
928 efficiently used by malloc to place other objects, so a value of 0 can
929 still preferable unless you have a lot of aligned blocks and virtually
931 #define BLOCK_PADDING 0
932 #define BLOCK_BYTES \
933 (BLOCK_ALIGN - sizeof (struct ablock *) - BLOCK_PADDING)
935 /* Internal data structures and constants. */
937 #define ABLOCKS_SIZE 16
939 /* An aligned block of memory. */
944 char payload
[BLOCK_BYTES
];
945 struct ablock
*next_free
;
947 /* `abase' is the aligned base of the ablocks. */
948 /* It is overloaded to hold the virtual `busy' field that counts
949 the number of used ablock in the parent ablocks.
950 The first ablock has the `busy' field, the others have the `abase'
951 field. To tell the difference, we assume that pointers will have
952 integer values larger than 2 * ABLOCKS_SIZE. The lowest bit of `busy'
953 is used to tell whether the real base of the parent ablocks is `abase'
954 (if not, the word before the first ablock holds a pointer to the
956 struct ablocks
*abase
;
957 /* The padding of all but the last ablock is unused. The padding of
958 the last ablock in an ablocks is not allocated. */
960 char padding
[BLOCK_PADDING
];
964 /* A bunch of consecutive aligned blocks. */
967 struct ablock blocks
[ABLOCKS_SIZE
];
970 /* Size of the block requested from malloc or memalign. */
971 #define ABLOCKS_BYTES (sizeof (struct ablocks) - BLOCK_PADDING)
973 #define ABLOCK_ABASE(block) \
974 (((unsigned long) (block)->abase) <= (1 + 2 * ABLOCKS_SIZE) \
975 ? (struct ablocks *)(block) \
978 /* Virtual `busy' field. */
979 #define ABLOCKS_BUSY(abase) ((abase)->blocks[0].abase)
981 /* Pointer to the (not necessarily aligned) malloc block. */
982 #ifdef USE_POSIX_MEMALIGN
983 #define ABLOCKS_BASE(abase) (abase)
985 #define ABLOCKS_BASE(abase) \
986 (1 & (long) ABLOCKS_BUSY (abase) ? abase : ((void**)abase)[-1])
989 /* The list of free ablock. */
990 static struct ablock
*free_ablock
;
992 /* Allocate an aligned block of nbytes.
993 Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be
994 smaller or equal to BLOCK_BYTES. */
995 static POINTER_TYPE
*
996 lisp_align_malloc (nbytes
, type
)
1001 struct ablocks
*abase
;
1003 eassert (nbytes
<= BLOCK_BYTES
);
1007 #ifdef GC_MALLOC_CHECK
1008 allocated_mem_type
= type
;
1014 EMACS_INT aligned
; /* int gets warning casting to 64-bit pointer. */
1016 #ifdef DOUG_LEA_MALLOC
1017 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1018 because mapped region contents are not preserved in
1020 mallopt (M_MMAP_MAX
, 0);
1023 #ifdef USE_POSIX_MEMALIGN
1025 int err
= posix_memalign (&base
, BLOCK_ALIGN
, ABLOCKS_BYTES
);
1031 base
= malloc (ABLOCKS_BYTES
);
1032 abase
= ALIGN (base
, BLOCK_ALIGN
);
1037 MALLOC_UNBLOCK_INPUT
;
1041 aligned
= (base
== abase
);
1043 ((void**)abase
)[-1] = base
;
1045 #ifdef DOUG_LEA_MALLOC
1046 /* Back to a reasonable maximum of mmap'ed areas. */
1047 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1051 /* If the memory just allocated cannot be addressed thru a Lisp
1052 object's pointer, and it needs to be, that's equivalent to
1053 running out of memory. */
1054 if (type
!= MEM_TYPE_NON_LISP
)
1057 char *end
= (char *) base
+ ABLOCKS_BYTES
- 1;
1058 XSETCONS (tem
, end
);
1059 if ((char *) XCONS (tem
) != end
)
1061 lisp_malloc_loser
= base
;
1063 MALLOC_UNBLOCK_INPUT
;
1069 /* Initialize the blocks and put them on the free list.
1070 Is `base' was not properly aligned, we can't use the last block. */
1071 for (i
= 0; i
< (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1); i
++)
1073 abase
->blocks
[i
].abase
= abase
;
1074 abase
->blocks
[i
].x
.next_free
= free_ablock
;
1075 free_ablock
= &abase
->blocks
[i
];
1077 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (long) aligned
;
1079 eassert (0 == ((EMACS_UINT
)abase
) % BLOCK_ALIGN
);
1080 eassert (ABLOCK_ABASE (&abase
->blocks
[3]) == abase
); /* 3 is arbitrary */
1081 eassert (ABLOCK_ABASE (&abase
->blocks
[0]) == abase
);
1082 eassert (ABLOCKS_BASE (abase
) == base
);
1083 eassert (aligned
== (long) ABLOCKS_BUSY (abase
));
1086 abase
= ABLOCK_ABASE (free_ablock
);
1087 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (2 + (long) ABLOCKS_BUSY (abase
));
1089 free_ablock
= free_ablock
->x
.next_free
;
1091 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1092 if (val
&& type
!= MEM_TYPE_NON_LISP
)
1093 mem_insert (val
, (char *) val
+ nbytes
, type
);
1096 MALLOC_UNBLOCK_INPUT
;
1100 eassert (0 == ((EMACS_UINT
)val
) % BLOCK_ALIGN
);
1105 lisp_align_free (block
)
1106 POINTER_TYPE
*block
;
1108 struct ablock
*ablock
= block
;
1109 struct ablocks
*abase
= ABLOCK_ABASE (ablock
);
1112 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1113 mem_delete (mem_find (block
));
1115 /* Put on free list. */
1116 ablock
->x
.next_free
= free_ablock
;
1117 free_ablock
= ablock
;
1118 /* Update busy count. */
1119 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (-2 + (long) ABLOCKS_BUSY (abase
));
1121 if (2 > (long) ABLOCKS_BUSY (abase
))
1122 { /* All the blocks are free. */
1123 int i
= 0, aligned
= (long) ABLOCKS_BUSY (abase
);
1124 struct ablock
**tem
= &free_ablock
;
1125 struct ablock
*atop
= &abase
->blocks
[aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1];
1129 if (*tem
>= (struct ablock
*) abase
&& *tem
< atop
)
1132 *tem
= (*tem
)->x
.next_free
;
1135 tem
= &(*tem
)->x
.next_free
;
1137 eassert ((aligned
& 1) == aligned
);
1138 eassert (i
== (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1));
1139 #ifdef USE_POSIX_MEMALIGN
1140 eassert ((unsigned long)ABLOCKS_BASE (abase
) % BLOCK_ALIGN
== 0);
1142 free (ABLOCKS_BASE (abase
));
1144 MALLOC_UNBLOCK_INPUT
;
1147 /* Return a new buffer structure allocated from the heap with
1148 a call to lisp_malloc. */
1154 = (struct buffer
*) lisp_malloc (sizeof (struct buffer
),
1156 b
->size
= sizeof (struct buffer
) / sizeof (EMACS_INT
);
1157 XSETPVECTYPE (b
, PVEC_BUFFER
);
1162 #ifndef SYSTEM_MALLOC
1164 /* Arranging to disable input signals while we're in malloc.
1166 This only works with GNU malloc. To help out systems which can't
1167 use GNU malloc, all the calls to malloc, realloc, and free
1168 elsewhere in the code should be inside a BLOCK_INPUT/UNBLOCK_INPUT
1169 pair; unfortunately, we have no idea what C library functions
1170 might call malloc, so we can't really protect them unless you're
1171 using GNU malloc. Fortunately, most of the major operating systems
1172 can use GNU malloc. */
1175 /* When using SYNC_INPUT, we don't call malloc from a signal handler, so
1176 there's no need to block input around malloc. */
1178 #ifndef DOUG_LEA_MALLOC
1179 extern void * (*__malloc_hook
) P_ ((size_t, const void *));
1180 extern void * (*__realloc_hook
) P_ ((void *, size_t, const void *));
1181 extern void (*__free_hook
) P_ ((void *, const void *));
1182 /* Else declared in malloc.h, perhaps with an extra arg. */
1183 #endif /* DOUG_LEA_MALLOC */
1184 static void * (*old_malloc_hook
) P_ ((size_t, const void *));
1185 static void * (*old_realloc_hook
) P_ ((void *, size_t, const void*));
1186 static void (*old_free_hook
) P_ ((void*, const void*));
1188 /* This function is used as the hook for free to call. */
1191 emacs_blocked_free (ptr
, ptr2
)
1197 #ifdef GC_MALLOC_CHECK
1203 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1206 "Freeing `%p' which wasn't allocated with malloc\n", ptr
);
1211 /* fprintf (stderr, "free %p...%p (%p)\n", m->start, m->end, ptr); */
1215 #endif /* GC_MALLOC_CHECK */
1217 __free_hook
= old_free_hook
;
1220 /* If we released our reserve (due to running out of memory),
1221 and we have a fair amount free once again,
1222 try to set aside another reserve in case we run out once more. */
1223 if (! NILP (Vmemory_full
)
1224 /* Verify there is enough space that even with the malloc
1225 hysteresis this call won't run out again.
1226 The code here is correct as long as SPARE_MEMORY
1227 is substantially larger than the block size malloc uses. */
1228 && (bytes_used_when_full
1229 > ((bytes_used_when_reconsidered
= BYTES_USED
)
1230 + max (malloc_hysteresis
, 4) * SPARE_MEMORY
)))
1231 refill_memory_reserve ();
1233 __free_hook
= emacs_blocked_free
;
1234 UNBLOCK_INPUT_ALLOC
;
1238 /* This function is the malloc hook that Emacs uses. */
1241 emacs_blocked_malloc (size
, ptr
)
1248 __malloc_hook
= old_malloc_hook
;
1249 #ifdef DOUG_LEA_MALLOC
1250 /* Segfaults on my system. --lorentey */
1251 /* mallopt (M_TOP_PAD, malloc_hysteresis * 4096); */
1253 __malloc_extra_blocks
= malloc_hysteresis
;
1256 value
= (void *) malloc (size
);
1258 #ifdef GC_MALLOC_CHECK
1260 struct mem_node
*m
= mem_find (value
);
1263 fprintf (stderr
, "Malloc returned %p which is already in use\n",
1265 fprintf (stderr
, "Region in use is %p...%p, %u bytes, type %d\n",
1266 m
->start
, m
->end
, (char *) m
->end
- (char *) m
->start
,
1271 if (!dont_register_blocks
)
1273 mem_insert (value
, (char *) value
+ max (1, size
), allocated_mem_type
);
1274 allocated_mem_type
= MEM_TYPE_NON_LISP
;
1277 #endif /* GC_MALLOC_CHECK */
1279 __malloc_hook
= emacs_blocked_malloc
;
1280 UNBLOCK_INPUT_ALLOC
;
1282 /* fprintf (stderr, "%p malloc\n", value); */
1287 /* This function is the realloc hook that Emacs uses. */
1290 emacs_blocked_realloc (ptr
, size
, ptr2
)
1298 __realloc_hook
= old_realloc_hook
;
1300 #ifdef GC_MALLOC_CHECK
1303 struct mem_node
*m
= mem_find (ptr
);
1304 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1307 "Realloc of %p which wasn't allocated with malloc\n",
1315 /* fprintf (stderr, "%p -> realloc\n", ptr); */
1317 /* Prevent malloc from registering blocks. */
1318 dont_register_blocks
= 1;
1319 #endif /* GC_MALLOC_CHECK */
1321 value
= (void *) realloc (ptr
, size
);
1323 #ifdef GC_MALLOC_CHECK
1324 dont_register_blocks
= 0;
1327 struct mem_node
*m
= mem_find (value
);
1330 fprintf (stderr
, "Realloc returns memory that is already in use\n");
1334 /* Can't handle zero size regions in the red-black tree. */
1335 mem_insert (value
, (char *) value
+ max (size
, 1), MEM_TYPE_NON_LISP
);
1338 /* fprintf (stderr, "%p <- realloc\n", value); */
1339 #endif /* GC_MALLOC_CHECK */
1341 __realloc_hook
= emacs_blocked_realloc
;
1342 UNBLOCK_INPUT_ALLOC
;
1348 #ifdef HAVE_GTK_AND_PTHREAD
1349 /* Called from Fdump_emacs so that when the dumped Emacs starts, it has a
1350 normal malloc. Some thread implementations need this as they call
1351 malloc before main. The pthread_self call in BLOCK_INPUT_ALLOC then
1352 calls malloc because it is the first call, and we have an endless loop. */
1355 reset_malloc_hooks ()
1357 __free_hook
= old_free_hook
;
1358 __malloc_hook
= old_malloc_hook
;
1359 __realloc_hook
= old_realloc_hook
;
1361 #endif /* HAVE_GTK_AND_PTHREAD */
1364 /* Called from main to set up malloc to use our hooks. */
1367 uninterrupt_malloc ()
1369 #ifdef HAVE_GTK_AND_PTHREAD
1370 pthread_mutexattr_t attr
;
1372 /* GLIBC has a faster way to do this, but lets keep it portable.
1373 This is according to the Single UNIX Specification. */
1374 pthread_mutexattr_init (&attr
);
1375 pthread_mutexattr_settype (&attr
, PTHREAD_MUTEX_RECURSIVE
);
1376 pthread_mutex_init (&alloc_mutex
, &attr
);
1377 #endif /* HAVE_GTK_AND_PTHREAD */
1379 if (__free_hook
!= emacs_blocked_free
)
1380 old_free_hook
= __free_hook
;
1381 __free_hook
= emacs_blocked_free
;
1383 if (__malloc_hook
!= emacs_blocked_malloc
)
1384 old_malloc_hook
= __malloc_hook
;
1385 __malloc_hook
= emacs_blocked_malloc
;
1387 if (__realloc_hook
!= emacs_blocked_realloc
)
1388 old_realloc_hook
= __realloc_hook
;
1389 __realloc_hook
= emacs_blocked_realloc
;
1392 #endif /* not SYNC_INPUT */
1393 #endif /* not SYSTEM_MALLOC */
1397 /***********************************************************************
1399 ***********************************************************************/
1401 /* Number of intervals allocated in an interval_block structure.
1402 The 1020 is 1024 minus malloc overhead. */
1404 #define INTERVAL_BLOCK_SIZE \
1405 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
1407 /* Intervals are allocated in chunks in form of an interval_block
1410 struct interval_block
1412 /* Place `intervals' first, to preserve alignment. */
1413 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
1414 struct interval_block
*next
;
1417 /* Current interval block. Its `next' pointer points to older
1420 struct interval_block
*interval_block
;
1422 /* Index in interval_block above of the next unused interval
1425 static int interval_block_index
;
1427 /* Number of free and live intervals. */
1429 static int total_free_intervals
, total_intervals
;
1431 /* List of free intervals. */
1433 INTERVAL interval_free_list
;
1435 /* Total number of interval blocks now in use. */
1437 int n_interval_blocks
;
1440 /* Initialize interval allocation. */
1445 interval_block
= NULL
;
1446 interval_block_index
= INTERVAL_BLOCK_SIZE
;
1447 interval_free_list
= 0;
1448 n_interval_blocks
= 0;
1452 /* Return a new interval. */
1459 /* eassert (!handling_signal); */
1463 if (interval_free_list
)
1465 val
= interval_free_list
;
1466 interval_free_list
= INTERVAL_PARENT (interval_free_list
);
1470 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
1472 register struct interval_block
*newi
;
1474 newi
= (struct interval_block
*) lisp_malloc (sizeof *newi
,
1477 newi
->next
= interval_block
;
1478 interval_block
= newi
;
1479 interval_block_index
= 0;
1480 n_interval_blocks
++;
1482 val
= &interval_block
->intervals
[interval_block_index
++];
1485 MALLOC_UNBLOCK_INPUT
;
1487 consing_since_gc
+= sizeof (struct interval
);
1489 RESET_INTERVAL (val
);
1495 /* Mark Lisp objects in interval I. */
1498 mark_interval (i
, dummy
)
1499 register INTERVAL i
;
1502 eassert (!i
->gcmarkbit
); /* Intervals are never shared. */
1504 mark_object (i
->plist
);
1508 /* Mark the interval tree rooted in TREE. Don't call this directly;
1509 use the macro MARK_INTERVAL_TREE instead. */
1512 mark_interval_tree (tree
)
1513 register INTERVAL tree
;
1515 /* No need to test if this tree has been marked already; this
1516 function is always called through the MARK_INTERVAL_TREE macro,
1517 which takes care of that. */
1519 traverse_intervals_noorder (tree
, mark_interval
, Qnil
);
1523 /* Mark the interval tree rooted in I. */
1525 #define MARK_INTERVAL_TREE(i) \
1527 if (!NULL_INTERVAL_P (i) && !i->gcmarkbit) \
1528 mark_interval_tree (i); \
1532 #define UNMARK_BALANCE_INTERVALS(i) \
1534 if (! NULL_INTERVAL_P (i)) \
1535 (i) = balance_intervals (i); \
1539 /* Number support. If NO_UNION_TYPE isn't in effect, we
1540 can't create number objects in macros. */
1548 obj
.s
.type
= Lisp_Int
;
1553 /***********************************************************************
1555 ***********************************************************************/
1557 /* Lisp_Strings are allocated in string_block structures. When a new
1558 string_block is allocated, all the Lisp_Strings it contains are
1559 added to a free-list string_free_list. When a new Lisp_String is
1560 needed, it is taken from that list. During the sweep phase of GC,
1561 string_blocks that are entirely free are freed, except two which
1564 String data is allocated from sblock structures. Strings larger
1565 than LARGE_STRING_BYTES, get their own sblock, data for smaller
1566 strings is sub-allocated out of sblocks of size SBLOCK_SIZE.
1568 Sblocks consist internally of sdata structures, one for each
1569 Lisp_String. The sdata structure points to the Lisp_String it
1570 belongs to. The Lisp_String points back to the `u.data' member of
1571 its sdata structure.
1573 When a Lisp_String is freed during GC, it is put back on
1574 string_free_list, and its `data' member and its sdata's `string'
1575 pointer is set to null. The size of the string is recorded in the
1576 `u.nbytes' member of the sdata. So, sdata structures that are no
1577 longer used, can be easily recognized, and it's easy to compact the
1578 sblocks of small strings which we do in compact_small_strings. */
1580 /* Size in bytes of an sblock structure used for small strings. This
1581 is 8192 minus malloc overhead. */
1583 #define SBLOCK_SIZE 8188
1585 /* Strings larger than this are considered large strings. String data
1586 for large strings is allocated from individual sblocks. */
1588 #define LARGE_STRING_BYTES 1024
1590 /* Structure describing string memory sub-allocated from an sblock.
1591 This is where the contents of Lisp strings are stored. */
1595 /* Back-pointer to the string this sdata belongs to. If null, this
1596 structure is free, and the NBYTES member of the union below
1597 contains the string's byte size (the same value that STRING_BYTES
1598 would return if STRING were non-null). If non-null, STRING_BYTES
1599 (STRING) is the size of the data, and DATA contains the string's
1601 struct Lisp_String
*string
;
1603 #ifdef GC_CHECK_STRING_BYTES
1606 unsigned char data
[1];
1608 #define SDATA_NBYTES(S) (S)->nbytes
1609 #define SDATA_DATA(S) (S)->data
1611 #else /* not GC_CHECK_STRING_BYTES */
1615 /* When STRING in non-null. */
1616 unsigned char data
[1];
1618 /* When STRING is null. */
1623 #define SDATA_NBYTES(S) (S)->u.nbytes
1624 #define SDATA_DATA(S) (S)->u.data
1626 #endif /* not GC_CHECK_STRING_BYTES */
1630 /* Structure describing a block of memory which is sub-allocated to
1631 obtain string data memory for strings. Blocks for small strings
1632 are of fixed size SBLOCK_SIZE. Blocks for large strings are made
1633 as large as needed. */
1638 struct sblock
*next
;
1640 /* Pointer to the next free sdata block. This points past the end
1641 of the sblock if there isn't any space left in this block. */
1642 struct sdata
*next_free
;
1644 /* Start of data. */
1645 struct sdata first_data
;
1648 /* Number of Lisp strings in a string_block structure. The 1020 is
1649 1024 minus malloc overhead. */
1651 #define STRING_BLOCK_SIZE \
1652 ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String))
1654 /* Structure describing a block from which Lisp_String structures
1659 /* Place `strings' first, to preserve alignment. */
1660 struct Lisp_String strings
[STRING_BLOCK_SIZE
];
1661 struct string_block
*next
;
1664 /* Head and tail of the list of sblock structures holding Lisp string
1665 data. We always allocate from current_sblock. The NEXT pointers
1666 in the sblock structures go from oldest_sblock to current_sblock. */
1668 static struct sblock
*oldest_sblock
, *current_sblock
;
1670 /* List of sblocks for large strings. */
1672 static struct sblock
*large_sblocks
;
1674 /* List of string_block structures, and how many there are. */
1676 static struct string_block
*string_blocks
;
1677 static int n_string_blocks
;
1679 /* Free-list of Lisp_Strings. */
1681 static struct Lisp_String
*string_free_list
;
1683 /* Number of live and free Lisp_Strings. */
1685 static int total_strings
, total_free_strings
;
1687 /* Number of bytes used by live strings. */
1689 static int total_string_size
;
1691 /* Given a pointer to a Lisp_String S which is on the free-list
1692 string_free_list, return a pointer to its successor in the
1695 #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S))
1697 /* Return a pointer to the sdata structure belonging to Lisp string S.
1698 S must be live, i.e. S->data must not be null. S->data is actually
1699 a pointer to the `u.data' member of its sdata structure; the
1700 structure starts at a constant offset in front of that. */
1702 #ifdef GC_CHECK_STRING_BYTES
1704 #define SDATA_OF_STRING(S) \
1705 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *) \
1706 - sizeof (EMACS_INT)))
1708 #else /* not GC_CHECK_STRING_BYTES */
1710 #define SDATA_OF_STRING(S) \
1711 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *)))
1713 #endif /* not GC_CHECK_STRING_BYTES */
1716 #ifdef GC_CHECK_STRING_OVERRUN
1718 /* We check for overrun in string data blocks by appending a small
1719 "cookie" after each allocated string data block, and check for the
1720 presence of this cookie during GC. */
1722 #define GC_STRING_OVERRUN_COOKIE_SIZE 4
1723 static char string_overrun_cookie
[GC_STRING_OVERRUN_COOKIE_SIZE
] =
1724 { 0xde, 0xad, 0xbe, 0xef };
1727 #define GC_STRING_OVERRUN_COOKIE_SIZE 0
1730 /* Value is the size of an sdata structure large enough to hold NBYTES
1731 bytes of string data. The value returned includes a terminating
1732 NUL byte, the size of the sdata structure, and padding. */
1734 #ifdef GC_CHECK_STRING_BYTES
1736 #define SDATA_SIZE(NBYTES) \
1737 ((sizeof (struct Lisp_String *) \
1739 + sizeof (EMACS_INT) \
1740 + sizeof (EMACS_INT) - 1) \
1741 & ~(sizeof (EMACS_INT) - 1))
1743 #else /* not GC_CHECK_STRING_BYTES */
1745 #define SDATA_SIZE(NBYTES) \
1746 ((sizeof (struct Lisp_String *) \
1748 + sizeof (EMACS_INT) - 1) \
1749 & ~(sizeof (EMACS_INT) - 1))
1751 #endif /* not GC_CHECK_STRING_BYTES */
1753 /* Extra bytes to allocate for each string. */
1755 #define GC_STRING_EXTRA (GC_STRING_OVERRUN_COOKIE_SIZE)
1757 /* Initialize string allocation. Called from init_alloc_once. */
1762 total_strings
= total_free_strings
= total_string_size
= 0;
1763 oldest_sblock
= current_sblock
= large_sblocks
= NULL
;
1764 string_blocks
= NULL
;
1765 n_string_blocks
= 0;
1766 string_free_list
= NULL
;
1767 empty_unibyte_string
= make_pure_string ("", 0, 0, 0);
1768 empty_multibyte_string
= make_pure_string ("", 0, 0, 1);
1772 #ifdef GC_CHECK_STRING_BYTES
1774 static int check_string_bytes_count
;
1776 void check_string_bytes
P_ ((int));
1777 void check_sblock
P_ ((struct sblock
*));
1779 #define CHECK_STRING_BYTES(S) STRING_BYTES (S)
1782 /* Like GC_STRING_BYTES, but with debugging check. */
1786 struct Lisp_String
*s
;
1788 int nbytes
= (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1789 if (!PURE_POINTER_P (s
)
1791 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1796 /* Check validity of Lisp strings' string_bytes member in B. */
1802 struct sdata
*from
, *end
, *from_end
;
1806 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1808 /* Compute the next FROM here because copying below may
1809 overwrite data we need to compute it. */
1812 /* Check that the string size recorded in the string is the
1813 same as the one recorded in the sdata structure. */
1815 CHECK_STRING_BYTES (from
->string
);
1818 nbytes
= GC_STRING_BYTES (from
->string
);
1820 nbytes
= SDATA_NBYTES (from
);
1822 nbytes
= SDATA_SIZE (nbytes
);
1823 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
1828 /* Check validity of Lisp strings' string_bytes member. ALL_P
1829 non-zero means check all strings, otherwise check only most
1830 recently allocated strings. Used for hunting a bug. */
1833 check_string_bytes (all_p
)
1840 for (b
= large_sblocks
; b
; b
= b
->next
)
1842 struct Lisp_String
*s
= b
->first_data
.string
;
1844 CHECK_STRING_BYTES (s
);
1847 for (b
= oldest_sblock
; b
; b
= b
->next
)
1851 check_sblock (current_sblock
);
1854 #endif /* GC_CHECK_STRING_BYTES */
1856 #ifdef GC_CHECK_STRING_FREE_LIST
1858 /* Walk through the string free list looking for bogus next pointers.
1859 This may catch buffer overrun from a previous string. */
1862 check_string_free_list ()
1864 struct Lisp_String
*s
;
1866 /* Pop a Lisp_String off the free-list. */
1867 s
= string_free_list
;
1870 if ((unsigned)s
< 1024)
1872 s
= NEXT_FREE_LISP_STRING (s
);
1876 #define check_string_free_list()
1879 /* Return a new Lisp_String. */
1881 static struct Lisp_String
*
1884 struct Lisp_String
*s
;
1886 /* eassert (!handling_signal); */
1890 /* If the free-list is empty, allocate a new string_block, and
1891 add all the Lisp_Strings in it to the free-list. */
1892 if (string_free_list
== NULL
)
1894 struct string_block
*b
;
1897 b
= (struct string_block
*) lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1898 bzero (b
, sizeof *b
);
1899 b
->next
= string_blocks
;
1903 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1906 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1907 string_free_list
= s
;
1910 total_free_strings
+= STRING_BLOCK_SIZE
;
1913 check_string_free_list ();
1915 /* Pop a Lisp_String off the free-list. */
1916 s
= string_free_list
;
1917 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1919 MALLOC_UNBLOCK_INPUT
;
1921 /* Probably not strictly necessary, but play it safe. */
1922 bzero (s
, sizeof *s
);
1924 --total_free_strings
;
1927 consing_since_gc
+= sizeof *s
;
1929 #ifdef GC_CHECK_STRING_BYTES
1936 if (++check_string_bytes_count
== 200)
1938 check_string_bytes_count
= 0;
1939 check_string_bytes (1);
1942 check_string_bytes (0);
1944 #endif /* GC_CHECK_STRING_BYTES */
1950 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1951 plus a NUL byte at the end. Allocate an sdata structure for S, and
1952 set S->data to its `u.data' member. Store a NUL byte at the end of
1953 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1954 S->data if it was initially non-null. */
1957 allocate_string_data (s
, nchars
, nbytes
)
1958 struct Lisp_String
*s
;
1961 struct sdata
*data
, *old_data
;
1963 int needed
, old_nbytes
;
1965 /* Determine the number of bytes needed to store NBYTES bytes
1967 needed
= SDATA_SIZE (nbytes
);
1968 old_data
= s
->data
? SDATA_OF_STRING (s
) : NULL
;
1969 old_nbytes
= GC_STRING_BYTES (s
);
1973 if (nbytes
> LARGE_STRING_BYTES
)
1975 size_t size
= sizeof *b
- sizeof (struct sdata
) + needed
;
1977 #ifdef DOUG_LEA_MALLOC
1978 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1979 because mapped region contents are not preserved in
1982 In case you think of allowing it in a dumped Emacs at the
1983 cost of not being able to re-dump, there's another reason:
1984 mmap'ed data typically have an address towards the top of the
1985 address space, which won't fit into an EMACS_INT (at least on
1986 32-bit systems with the current tagging scheme). --fx */
1987 mallopt (M_MMAP_MAX
, 0);
1990 b
= (struct sblock
*) lisp_malloc (size
+ GC_STRING_EXTRA
, MEM_TYPE_NON_LISP
);
1992 #ifdef DOUG_LEA_MALLOC
1993 /* Back to a reasonable maximum of mmap'ed areas. */
1994 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1997 b
->next_free
= &b
->first_data
;
1998 b
->first_data
.string
= NULL
;
1999 b
->next
= large_sblocks
;
2002 else if (current_sblock
== NULL
2003 || (((char *) current_sblock
+ SBLOCK_SIZE
2004 - (char *) current_sblock
->next_free
)
2005 < (needed
+ GC_STRING_EXTRA
)))
2007 /* Not enough room in the current sblock. */
2008 b
= (struct sblock
*) lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
2009 b
->next_free
= &b
->first_data
;
2010 b
->first_data
.string
= NULL
;
2014 current_sblock
->next
= b
;
2022 data
= b
->next_free
;
2023 b
->next_free
= (struct sdata
*) ((char *) data
+ needed
+ GC_STRING_EXTRA
);
2025 MALLOC_UNBLOCK_INPUT
;
2028 s
->data
= SDATA_DATA (data
);
2029 #ifdef GC_CHECK_STRING_BYTES
2030 SDATA_NBYTES (data
) = nbytes
;
2033 s
->size_byte
= nbytes
;
2034 s
->data
[nbytes
] = '\0';
2035 #ifdef GC_CHECK_STRING_OVERRUN
2036 bcopy (string_overrun_cookie
, (char *) data
+ needed
,
2037 GC_STRING_OVERRUN_COOKIE_SIZE
);
2040 /* If S had already data assigned, mark that as free by setting its
2041 string back-pointer to null, and recording the size of the data
2045 SDATA_NBYTES (old_data
) = old_nbytes
;
2046 old_data
->string
= NULL
;
2049 consing_since_gc
+= needed
;
2053 /* Sweep and compact strings. */
2058 struct string_block
*b
, *next
;
2059 struct string_block
*live_blocks
= NULL
;
2061 string_free_list
= NULL
;
2062 total_strings
= total_free_strings
= 0;
2063 total_string_size
= 0;
2065 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
2066 for (b
= string_blocks
; b
; b
= next
)
2069 struct Lisp_String
*free_list_before
= string_free_list
;
2073 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
2075 struct Lisp_String
*s
= b
->strings
+ i
;
2079 /* String was not on free-list before. */
2080 if (STRING_MARKED_P (s
))
2082 /* String is live; unmark it and its intervals. */
2085 if (!NULL_INTERVAL_P (s
->intervals
))
2086 UNMARK_BALANCE_INTERVALS (s
->intervals
);
2089 total_string_size
+= STRING_BYTES (s
);
2093 /* String is dead. Put it on the free-list. */
2094 struct sdata
*data
= SDATA_OF_STRING (s
);
2096 /* Save the size of S in its sdata so that we know
2097 how large that is. Reset the sdata's string
2098 back-pointer so that we know it's free. */
2099 #ifdef GC_CHECK_STRING_BYTES
2100 if (GC_STRING_BYTES (s
) != SDATA_NBYTES (data
))
2103 data
->u
.nbytes
= GC_STRING_BYTES (s
);
2105 data
->string
= NULL
;
2107 /* Reset the strings's `data' member so that we
2111 /* Put the string on the free-list. */
2112 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2113 string_free_list
= s
;
2119 /* S was on the free-list before. Put it there again. */
2120 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2121 string_free_list
= s
;
2126 /* Free blocks that contain free Lisp_Strings only, except
2127 the first two of them. */
2128 if (nfree
== STRING_BLOCK_SIZE
2129 && total_free_strings
> STRING_BLOCK_SIZE
)
2133 string_free_list
= free_list_before
;
2137 total_free_strings
+= nfree
;
2138 b
->next
= live_blocks
;
2143 check_string_free_list ();
2145 string_blocks
= live_blocks
;
2146 free_large_strings ();
2147 compact_small_strings ();
2149 check_string_free_list ();
2153 /* Free dead large strings. */
2156 free_large_strings ()
2158 struct sblock
*b
, *next
;
2159 struct sblock
*live_blocks
= NULL
;
2161 for (b
= large_sblocks
; b
; b
= next
)
2165 if (b
->first_data
.string
== NULL
)
2169 b
->next
= live_blocks
;
2174 large_sblocks
= live_blocks
;
2178 /* Compact data of small strings. Free sblocks that don't contain
2179 data of live strings after compaction. */
2182 compact_small_strings ()
2184 struct sblock
*b
, *tb
, *next
;
2185 struct sdata
*from
, *to
, *end
, *tb_end
;
2186 struct sdata
*to_end
, *from_end
;
2188 /* TB is the sblock we copy to, TO is the sdata within TB we copy
2189 to, and TB_END is the end of TB. */
2191 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2192 to
= &tb
->first_data
;
2194 /* Step through the blocks from the oldest to the youngest. We
2195 expect that old blocks will stabilize over time, so that less
2196 copying will happen this way. */
2197 for (b
= oldest_sblock
; b
; b
= b
->next
)
2200 xassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
2202 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
2204 /* Compute the next FROM here because copying below may
2205 overwrite data we need to compute it. */
2208 #ifdef GC_CHECK_STRING_BYTES
2209 /* Check that the string size recorded in the string is the
2210 same as the one recorded in the sdata structure. */
2212 && GC_STRING_BYTES (from
->string
) != SDATA_NBYTES (from
))
2214 #endif /* GC_CHECK_STRING_BYTES */
2217 nbytes
= GC_STRING_BYTES (from
->string
);
2219 nbytes
= SDATA_NBYTES (from
);
2221 if (nbytes
> LARGE_STRING_BYTES
)
2224 nbytes
= SDATA_SIZE (nbytes
);
2225 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
2227 #ifdef GC_CHECK_STRING_OVERRUN
2228 if (bcmp (string_overrun_cookie
,
2229 ((char *) from_end
) - GC_STRING_OVERRUN_COOKIE_SIZE
,
2230 GC_STRING_OVERRUN_COOKIE_SIZE
))
2234 /* FROM->string non-null means it's alive. Copy its data. */
2237 /* If TB is full, proceed with the next sblock. */
2238 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2239 if (to_end
> tb_end
)
2243 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2244 to
= &tb
->first_data
;
2245 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2248 /* Copy, and update the string's `data' pointer. */
2251 xassert (tb
!= b
|| to
<= from
);
2252 safe_bcopy ((char *) from
, (char *) to
, nbytes
+ GC_STRING_EXTRA
);
2253 to
->string
->data
= SDATA_DATA (to
);
2256 /* Advance past the sdata we copied to. */
2262 /* The rest of the sblocks following TB don't contain live data, so
2263 we can free them. */
2264 for (b
= tb
->next
; b
; b
= next
)
2272 current_sblock
= tb
;
2276 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
2277 doc
: /* Return a newly created string of length LENGTH, with INIT in each element.
2278 LENGTH must be an integer.
2279 INIT must be an integer that represents a character. */)
2281 Lisp_Object length
, init
;
2283 register Lisp_Object val
;
2284 register unsigned char *p
, *end
;
2287 CHECK_NATNUM (length
);
2288 CHECK_NUMBER (init
);
2291 if (ASCII_CHAR_P (c
))
2293 nbytes
= XINT (length
);
2294 val
= make_uninit_string (nbytes
);
2296 end
= p
+ SCHARS (val
);
2302 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
2303 int len
= CHAR_STRING (c
, str
);
2305 nbytes
= len
* XINT (length
);
2306 val
= make_uninit_multibyte_string (XINT (length
), nbytes
);
2311 bcopy (str
, p
, len
);
2321 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
2322 doc
: /* Return a new bool-vector of length LENGTH, using INIT for each element.
2323 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
2325 Lisp_Object length
, init
;
2327 register Lisp_Object val
;
2328 struct Lisp_Bool_Vector
*p
;
2330 int length_in_chars
, length_in_elts
, bits_per_value
;
2332 CHECK_NATNUM (length
);
2334 bits_per_value
= sizeof (EMACS_INT
) * BOOL_VECTOR_BITS_PER_CHAR
;
2336 length_in_elts
= (XFASTINT (length
) + bits_per_value
- 1) / bits_per_value
;
2337 length_in_chars
= ((XFASTINT (length
) + BOOL_VECTOR_BITS_PER_CHAR
- 1)
2338 / BOOL_VECTOR_BITS_PER_CHAR
);
2340 /* We must allocate one more elements than LENGTH_IN_ELTS for the
2341 slot `size' of the struct Lisp_Bool_Vector. */
2342 val
= Fmake_vector (make_number (length_in_elts
+ 1), Qnil
);
2344 /* Get rid of any bits that would cause confusion. */
2345 XVECTOR (val
)->size
= 0; /* No Lisp_Object to trace in there. */
2346 /* Use XVECTOR (val) rather than `p' because p->size is not TRT. */
2347 XSETPVECTYPE (XVECTOR (val
), PVEC_BOOL_VECTOR
);
2349 p
= XBOOL_VECTOR (val
);
2350 p
->size
= XFASTINT (length
);
2352 real_init
= (NILP (init
) ? 0 : -1);
2353 for (i
= 0; i
< length_in_chars
; i
++)
2354 p
->data
[i
] = real_init
;
2356 /* Clear the extraneous bits in the last byte. */
2357 if (XINT (length
) != length_in_chars
* BOOL_VECTOR_BITS_PER_CHAR
)
2358 p
->data
[length_in_chars
- 1]
2359 &= (1 << (XINT (length
) % BOOL_VECTOR_BITS_PER_CHAR
)) - 1;
2365 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
2366 of characters from the contents. This string may be unibyte or
2367 multibyte, depending on the contents. */
2370 make_string (contents
, nbytes
)
2371 const char *contents
;
2374 register Lisp_Object val
;
2375 int nchars
, multibyte_nbytes
;
2377 parse_str_as_multibyte (contents
, nbytes
, &nchars
, &multibyte_nbytes
);
2378 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
2379 /* CONTENTS contains no multibyte sequences or contains an invalid
2380 multibyte sequence. We must make unibyte string. */
2381 val
= make_unibyte_string (contents
, nbytes
);
2383 val
= make_multibyte_string (contents
, nchars
, nbytes
);
2388 /* Make an unibyte string from LENGTH bytes at CONTENTS. */
2391 make_unibyte_string (contents
, length
)
2392 const char *contents
;
2395 register Lisp_Object val
;
2396 val
= make_uninit_string (length
);
2397 bcopy (contents
, SDATA (val
), length
);
2398 STRING_SET_UNIBYTE (val
);
2403 /* Make a multibyte string from NCHARS characters occupying NBYTES
2404 bytes at CONTENTS. */
2407 make_multibyte_string (contents
, nchars
, nbytes
)
2408 const char *contents
;
2411 register Lisp_Object val
;
2412 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2413 bcopy (contents
, SDATA (val
), nbytes
);
2418 /* Make a string from NCHARS characters occupying NBYTES bytes at
2419 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2422 make_string_from_bytes (contents
, nchars
, nbytes
)
2423 const char *contents
;
2426 register Lisp_Object val
;
2427 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2428 bcopy (contents
, SDATA (val
), nbytes
);
2429 if (SBYTES (val
) == SCHARS (val
))
2430 STRING_SET_UNIBYTE (val
);
2435 /* Make a string from NCHARS characters occupying NBYTES bytes at
2436 CONTENTS. The argument MULTIBYTE controls whether to label the
2437 string as multibyte. If NCHARS is negative, it counts the number of
2438 characters by itself. */
2441 make_specified_string (contents
, nchars
, nbytes
, multibyte
)
2442 const char *contents
;
2446 register Lisp_Object val
;
2451 nchars
= multibyte_chars_in_text (contents
, nbytes
);
2455 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2456 bcopy (contents
, SDATA (val
), nbytes
);
2458 STRING_SET_UNIBYTE (val
);
2463 /* Make a string from the data at STR, treating it as multibyte if the
2470 return make_string (str
, strlen (str
));
2474 /* Return an unibyte Lisp_String set up to hold LENGTH characters
2475 occupying LENGTH bytes. */
2478 make_uninit_string (length
)
2484 return empty_unibyte_string
;
2485 val
= make_uninit_multibyte_string (length
, length
);
2486 STRING_SET_UNIBYTE (val
);
2491 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2492 which occupy NBYTES bytes. */
2495 make_uninit_multibyte_string (nchars
, nbytes
)
2499 struct Lisp_String
*s
;
2504 return empty_multibyte_string
;
2506 s
= allocate_string ();
2507 allocate_string_data (s
, nchars
, nbytes
);
2508 XSETSTRING (string
, s
);
2509 string_chars_consed
+= nbytes
;
2515 /***********************************************************************
2517 ***********************************************************************/
2519 /* We store float cells inside of float_blocks, allocating a new
2520 float_block with malloc whenever necessary. Float cells reclaimed
2521 by GC are put on a free list to be reallocated before allocating
2522 any new float cells from the latest float_block. */
2524 #define FLOAT_BLOCK_SIZE \
2525 (((BLOCK_BYTES - sizeof (struct float_block *) \
2526 /* The compiler might add padding at the end. */ \
2527 - (sizeof (struct Lisp_Float) - sizeof (int))) * CHAR_BIT) \
2528 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2530 #define GETMARKBIT(block,n) \
2531 (((block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2532 >> ((n) % (sizeof(int) * CHAR_BIT))) \
2535 #define SETMARKBIT(block,n) \
2536 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2537 |= 1 << ((n) % (sizeof(int) * CHAR_BIT))
2539 #define UNSETMARKBIT(block,n) \
2540 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2541 &= ~(1 << ((n) % (sizeof(int) * CHAR_BIT)))
2543 #define FLOAT_BLOCK(fptr) \
2544 ((struct float_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2546 #define FLOAT_INDEX(fptr) \
2547 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2551 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2552 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2553 int gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2554 struct float_block
*next
;
2557 #define FLOAT_MARKED_P(fptr) \
2558 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2560 #define FLOAT_MARK(fptr) \
2561 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2563 #define FLOAT_UNMARK(fptr) \
2564 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2566 /* Current float_block. */
2568 struct float_block
*float_block
;
2570 /* Index of first unused Lisp_Float in the current float_block. */
2572 int float_block_index
;
2574 /* Total number of float blocks now in use. */
2578 /* Free-list of Lisp_Floats. */
2580 struct Lisp_Float
*float_free_list
;
2583 /* Initialize float allocation. */
2589 float_block_index
= FLOAT_BLOCK_SIZE
; /* Force alloc of new float_block. */
2590 float_free_list
= 0;
2595 /* Explicitly free a float cell by putting it on the free-list. */
2599 struct Lisp_Float
*ptr
;
2601 ptr
->u
.chain
= float_free_list
;
2602 float_free_list
= ptr
;
2606 /* Return a new float object with value FLOAT_VALUE. */
2609 make_float (float_value
)
2612 register Lisp_Object val
;
2614 /* eassert (!handling_signal); */
2618 if (float_free_list
)
2620 /* We use the data field for chaining the free list
2621 so that we won't use the same field that has the mark bit. */
2622 XSETFLOAT (val
, float_free_list
);
2623 float_free_list
= float_free_list
->u
.chain
;
2627 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2629 register struct float_block
*new;
2631 new = (struct float_block
*) lisp_align_malloc (sizeof *new,
2633 new->next
= float_block
;
2634 bzero ((char *) new->gcmarkbits
, sizeof new->gcmarkbits
);
2636 float_block_index
= 0;
2639 XSETFLOAT (val
, &float_block
->floats
[float_block_index
]);
2640 float_block_index
++;
2643 MALLOC_UNBLOCK_INPUT
;
2645 XFLOAT_DATA (val
) = float_value
;
2646 eassert (!FLOAT_MARKED_P (XFLOAT (val
)));
2647 consing_since_gc
+= sizeof (struct Lisp_Float
);
2654 /***********************************************************************
2656 ***********************************************************************/
2658 /* We store cons cells inside of cons_blocks, allocating a new
2659 cons_block with malloc whenever necessary. Cons cells reclaimed by
2660 GC are put on a free list to be reallocated before allocating
2661 any new cons cells from the latest cons_block. */
2663 #define CONS_BLOCK_SIZE \
2664 (((BLOCK_BYTES - sizeof (struct cons_block *)) * CHAR_BIT) \
2665 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2667 #define CONS_BLOCK(fptr) \
2668 ((struct cons_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2670 #define CONS_INDEX(fptr) \
2671 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2675 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2676 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2677 int gcmarkbits
[1 + CONS_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2678 struct cons_block
*next
;
2681 #define CONS_MARKED_P(fptr) \
2682 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2684 #define CONS_MARK(fptr) \
2685 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2687 #define CONS_UNMARK(fptr) \
2688 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2690 /* Current cons_block. */
2692 struct cons_block
*cons_block
;
2694 /* Index of first unused Lisp_Cons in the current block. */
2696 int cons_block_index
;
2698 /* Free-list of Lisp_Cons structures. */
2700 struct Lisp_Cons
*cons_free_list
;
2702 /* Total number of cons blocks now in use. */
2707 /* Initialize cons allocation. */
2713 cons_block_index
= CONS_BLOCK_SIZE
; /* Force alloc of new cons_block. */
2719 /* Explicitly free a cons cell by putting it on the free-list. */
2723 struct Lisp_Cons
*ptr
;
2725 ptr
->u
.chain
= cons_free_list
;
2729 cons_free_list
= ptr
;
2732 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
2733 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2735 Lisp_Object car
, cdr
;
2737 register Lisp_Object val
;
2739 /* eassert (!handling_signal); */
2745 /* We use the cdr for chaining the free list
2746 so that we won't use the same field that has the mark bit. */
2747 XSETCONS (val
, cons_free_list
);
2748 cons_free_list
= cons_free_list
->u
.chain
;
2752 if (cons_block_index
== CONS_BLOCK_SIZE
)
2754 register struct cons_block
*new;
2755 new = (struct cons_block
*) lisp_align_malloc (sizeof *new,
2757 bzero ((char *) new->gcmarkbits
, sizeof new->gcmarkbits
);
2758 new->next
= cons_block
;
2760 cons_block_index
= 0;
2763 XSETCONS (val
, &cons_block
->conses
[cons_block_index
]);
2767 MALLOC_UNBLOCK_INPUT
;
2771 eassert (!CONS_MARKED_P (XCONS (val
)));
2772 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2773 cons_cells_consed
++;
2777 /* Get an error now if there's any junk in the cons free list. */
2781 #ifdef GC_CHECK_CONS_LIST
2782 struct Lisp_Cons
*tail
= cons_free_list
;
2785 tail
= tail
->u
.chain
;
2789 /* Make a list of 1, 2, 3, 4 or 5 specified objects. */
2795 return Fcons (arg1
, Qnil
);
2800 Lisp_Object arg1
, arg2
;
2802 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2807 list3 (arg1
, arg2
, arg3
)
2808 Lisp_Object arg1
, arg2
, arg3
;
2810 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2815 list4 (arg1
, arg2
, arg3
, arg4
)
2816 Lisp_Object arg1
, arg2
, arg3
, arg4
;
2818 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2823 list5 (arg1
, arg2
, arg3
, arg4
, arg5
)
2824 Lisp_Object arg1
, arg2
, arg3
, arg4
, arg5
;
2826 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2827 Fcons (arg5
, Qnil
)))));
2831 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
2832 doc
: /* Return a newly created list with specified arguments as elements.
2833 Any number of arguments, even zero arguments, are allowed.
2834 usage: (list &rest OBJECTS) */)
2837 register Lisp_Object
*args
;
2839 register Lisp_Object val
;
2845 val
= Fcons (args
[nargs
], val
);
2851 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2852 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2854 register Lisp_Object length
, init
;
2856 register Lisp_Object val
;
2859 CHECK_NATNUM (length
);
2860 size
= XFASTINT (length
);
2865 val
= Fcons (init
, val
);
2870 val
= Fcons (init
, val
);
2875 val
= Fcons (init
, val
);
2880 val
= Fcons (init
, val
);
2885 val
= Fcons (init
, val
);
2900 /***********************************************************************
2902 ***********************************************************************/
2904 /* Singly-linked list of all vectors. */
2906 struct Lisp_Vector
*all_vectors
;
2908 /* Total number of vector-like objects now in use. */
2913 /* Value is a pointer to a newly allocated Lisp_Vector structure
2914 with room for LEN Lisp_Objects. */
2916 static struct Lisp_Vector
*
2917 allocate_vectorlike (len
)
2920 struct Lisp_Vector
*p
;
2925 #ifdef DOUG_LEA_MALLOC
2926 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
2927 because mapped region contents are not preserved in
2929 mallopt (M_MMAP_MAX
, 0);
2932 /* This gets triggered by code which I haven't bothered to fix. --Stef */
2933 /* eassert (!handling_signal); */
2935 nbytes
= sizeof *p
+ (len
- 1) * sizeof p
->contents
[0];
2936 p
= (struct Lisp_Vector
*) lisp_malloc (nbytes
, MEM_TYPE_VECTORLIKE
);
2938 #ifdef DOUG_LEA_MALLOC
2939 /* Back to a reasonable maximum of mmap'ed areas. */
2940 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2943 consing_since_gc
+= nbytes
;
2944 vector_cells_consed
+= len
;
2946 p
->next
= all_vectors
;
2949 MALLOC_UNBLOCK_INPUT
;
2956 /* Allocate a vector with NSLOTS slots. */
2958 struct Lisp_Vector
*
2959 allocate_vector (nslots
)
2962 struct Lisp_Vector
*v
= allocate_vectorlike (nslots
);
2968 /* Allocate other vector-like structures. */
2970 static struct Lisp_Vector
*
2971 allocate_pseudovector (memlen
, lisplen
, tag
)
2972 int memlen
, lisplen
;
2975 struct Lisp_Vector
*v
= allocate_vectorlike (memlen
);
2978 /* Only the first lisplen slots will be traced normally by the GC. */
2980 for (i
= 0; i
< lisplen
; ++i
)
2981 v
->contents
[i
] = Qnil
;
2983 XSETPVECTYPE (v
, tag
); /* Add the appropriate tag. */
2986 #define ALLOCATE_PSEUDOVECTOR(typ,field,tag) \
2988 allocate_pseudovector \
2989 (VECSIZE (typ), PSEUDOVECSIZE (typ, field), tag))
2991 struct Lisp_Hash_Table
*
2992 allocate_hash_table (void)
2994 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Hash_Table
, count
, PVEC_HASH_TABLE
);
3001 return ALLOCATE_PSEUDOVECTOR(struct window
, current_matrix
, PVEC_WINDOW
);
3006 allocate_terminal ()
3008 struct terminal
*t
= ALLOCATE_PSEUDOVECTOR (struct terminal
,
3009 next_terminal
, PVEC_TERMINAL
);
3010 /* Zero out the non-GC'd fields. FIXME: This should be made unnecessary. */
3011 bzero (&(t
->next_terminal
),
3012 ((char*)(t
+1)) - ((char*)&(t
->next_terminal
)));
3020 struct frame
*f
= ALLOCATE_PSEUDOVECTOR (struct frame
,
3021 face_cache
, PVEC_FRAME
);
3022 /* Zero out the non-GC'd fields. FIXME: This should be made unnecessary. */
3023 bzero (&(f
->face_cache
),
3024 ((char*)(f
+1)) - ((char*)&(f
->face_cache
)));
3029 struct Lisp_Process
*
3032 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Process
, pid
, PVEC_PROCESS
);
3036 /* Only used for PVEC_WINDOW_CONFIGURATION. */
3037 struct Lisp_Vector
*
3038 allocate_other_vector (len
)
3041 struct Lisp_Vector
*v
= allocate_vectorlike (len
);
3044 for (i
= 0; i
< len
; ++i
)
3045 v
->contents
[i
] = Qnil
;
3052 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
3053 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
3054 See also the function `vector'. */)
3056 register Lisp_Object length
, init
;
3059 register EMACS_INT sizei
;
3061 register struct Lisp_Vector
*p
;
3063 CHECK_NATNUM (length
);
3064 sizei
= XFASTINT (length
);
3066 p
= allocate_vector (sizei
);
3067 for (index
= 0; index
< sizei
; index
++)
3068 p
->contents
[index
] = init
;
3070 XSETVECTOR (vector
, p
);
3075 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
3076 doc
: /* Return a newly created vector with specified arguments as elements.
3077 Any number of arguments, even zero arguments, are allowed.
3078 usage: (vector &rest OBJECTS) */)
3083 register Lisp_Object len
, val
;
3085 register struct Lisp_Vector
*p
;
3087 XSETFASTINT (len
, nargs
);
3088 val
= Fmake_vector (len
, Qnil
);
3090 for (index
= 0; index
< nargs
; index
++)
3091 p
->contents
[index
] = args
[index
];
3096 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
3097 doc
: /* Create a byte-code object with specified arguments as elements.
3098 The arguments should be the arglist, bytecode-string, constant vector,
3099 stack size, (optional) doc string, and (optional) interactive spec.
3100 The first four arguments are required; at most six have any
3102 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
3107 register Lisp_Object len
, val
;
3109 register struct Lisp_Vector
*p
;
3111 XSETFASTINT (len
, nargs
);
3112 if (!NILP (Vpurify_flag
))
3113 val
= make_pure_vector ((EMACS_INT
) nargs
);
3115 val
= Fmake_vector (len
, Qnil
);
3117 if (STRINGP (args
[1]) && STRING_MULTIBYTE (args
[1]))
3118 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
3119 earlier because they produced a raw 8-bit string for byte-code
3120 and now such a byte-code string is loaded as multibyte while
3121 raw 8-bit characters converted to multibyte form. Thus, now we
3122 must convert them back to the original unibyte form. */
3123 args
[1] = Fstring_as_unibyte (args
[1]);
3126 for (index
= 0; index
< nargs
; index
++)
3128 if (!NILP (Vpurify_flag
))
3129 args
[index
] = Fpurecopy (args
[index
]);
3130 p
->contents
[index
] = args
[index
];
3132 XSETPVECTYPE (p
, PVEC_COMPILED
);
3133 XSETCOMPILED (val
, p
);
3139 /***********************************************************************
3141 ***********************************************************************/
3143 /* Each symbol_block is just under 1020 bytes long, since malloc
3144 really allocates in units of powers of two and uses 4 bytes for its
3147 #define SYMBOL_BLOCK_SIZE \
3148 ((1020 - sizeof (struct symbol_block *)) / sizeof (struct Lisp_Symbol))
3152 /* Place `symbols' first, to preserve alignment. */
3153 struct Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
3154 struct symbol_block
*next
;
3157 /* Current symbol block and index of first unused Lisp_Symbol
3160 struct symbol_block
*symbol_block
;
3161 int symbol_block_index
;
3163 /* List of free symbols. */
3165 struct Lisp_Symbol
*symbol_free_list
;
3167 /* Total number of symbol blocks now in use. */
3169 int n_symbol_blocks
;
3172 /* Initialize symbol allocation. */
3177 symbol_block
= NULL
;
3178 symbol_block_index
= SYMBOL_BLOCK_SIZE
;
3179 symbol_free_list
= 0;
3180 n_symbol_blocks
= 0;
3184 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
3185 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
3186 Its value and function definition are void, and its property list is nil. */)
3190 register Lisp_Object val
;
3191 register struct Lisp_Symbol
*p
;
3193 CHECK_STRING (name
);
3195 /* eassert (!handling_signal); */
3199 if (symbol_free_list
)
3201 XSETSYMBOL (val
, symbol_free_list
);
3202 symbol_free_list
= symbol_free_list
->next
;
3206 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
3208 struct symbol_block
*new;
3209 new = (struct symbol_block
*) lisp_malloc (sizeof *new,
3211 new->next
= symbol_block
;
3213 symbol_block_index
= 0;
3216 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
]);
3217 symbol_block_index
++;
3220 MALLOC_UNBLOCK_INPUT
;
3225 p
->value
= Qunbound
;
3226 p
->function
= Qunbound
;
3229 p
->interned
= SYMBOL_UNINTERNED
;
3231 p
->indirect_variable
= 0;
3232 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
3239 /***********************************************************************
3240 Marker (Misc) Allocation
3241 ***********************************************************************/
3243 /* Allocation of markers and other objects that share that structure.
3244 Works like allocation of conses. */
3246 #define MARKER_BLOCK_SIZE \
3247 ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc))
3251 /* Place `markers' first, to preserve alignment. */
3252 union Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
3253 struct marker_block
*next
;
3256 struct marker_block
*marker_block
;
3257 int marker_block_index
;
3259 union Lisp_Misc
*marker_free_list
;
3261 /* Total number of marker blocks now in use. */
3263 int n_marker_blocks
;
3268 marker_block
= NULL
;
3269 marker_block_index
= MARKER_BLOCK_SIZE
;
3270 marker_free_list
= 0;
3271 n_marker_blocks
= 0;
3274 /* Return a newly allocated Lisp_Misc object, with no substructure. */
3281 /* eassert (!handling_signal); */
3285 if (marker_free_list
)
3287 XSETMISC (val
, marker_free_list
);
3288 marker_free_list
= marker_free_list
->u_free
.chain
;
3292 if (marker_block_index
== MARKER_BLOCK_SIZE
)
3294 struct marker_block
*new;
3295 new = (struct marker_block
*) lisp_malloc (sizeof *new,
3297 new->next
= marker_block
;
3299 marker_block_index
= 0;
3301 total_free_markers
+= MARKER_BLOCK_SIZE
;
3303 XSETMISC (val
, &marker_block
->markers
[marker_block_index
]);
3304 marker_block_index
++;
3307 MALLOC_UNBLOCK_INPUT
;
3309 --total_free_markers
;
3310 consing_since_gc
+= sizeof (union Lisp_Misc
);
3311 misc_objects_consed
++;
3312 XMISCANY (val
)->gcmarkbit
= 0;
3316 /* Free a Lisp_Misc object */
3322 XMISCTYPE (misc
) = Lisp_Misc_Free
;
3323 XMISC (misc
)->u_free
.chain
= marker_free_list
;
3324 marker_free_list
= XMISC (misc
);
3326 total_free_markers
++;
3329 /* Return a Lisp_Misc_Save_Value object containing POINTER and
3330 INTEGER. This is used to package C values to call record_unwind_protect.
3331 The unwind function can get the C values back using XSAVE_VALUE. */
3334 make_save_value (pointer
, integer
)
3338 register Lisp_Object val
;
3339 register struct Lisp_Save_Value
*p
;
3341 val
= allocate_misc ();
3342 XMISCTYPE (val
) = Lisp_Misc_Save_Value
;
3343 p
= XSAVE_VALUE (val
);
3344 p
->pointer
= pointer
;
3345 p
->integer
= integer
;
3350 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
3351 doc
: /* Return a newly allocated marker which does not point at any place. */)
3354 register Lisp_Object val
;
3355 register struct Lisp_Marker
*p
;
3357 val
= allocate_misc ();
3358 XMISCTYPE (val
) = Lisp_Misc_Marker
;
3364 p
->insertion_type
= 0;
3368 /* Put MARKER back on the free list after using it temporarily. */
3371 free_marker (marker
)
3374 unchain_marker (XMARKER (marker
));
3379 /* Return a newly created vector or string with specified arguments as
3380 elements. If all the arguments are characters that can fit
3381 in a string of events, make a string; otherwise, make a vector.
3383 Any number of arguments, even zero arguments, are allowed. */
3386 make_event_array (nargs
, args
)
3392 for (i
= 0; i
< nargs
; i
++)
3393 /* The things that fit in a string
3394 are characters that are in 0...127,
3395 after discarding the meta bit and all the bits above it. */
3396 if (!INTEGERP (args
[i
])
3397 || (XUINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
3398 return Fvector (nargs
, args
);
3400 /* Since the loop exited, we know that all the things in it are
3401 characters, so we can make a string. */
3405 result
= Fmake_string (make_number (nargs
), make_number (0));
3406 for (i
= 0; i
< nargs
; i
++)
3408 SSET (result
, i
, XINT (args
[i
]));
3409 /* Move the meta bit to the right place for a string char. */
3410 if (XINT (args
[i
]) & CHAR_META
)
3411 SSET (result
, i
, SREF (result
, i
) | 0x80);
3420 /************************************************************************
3421 Memory Full Handling
3422 ************************************************************************/
3425 /* Called if malloc returns zero. */
3434 memory_full_cons_threshold
= sizeof (struct cons_block
);
3436 /* The first time we get here, free the spare memory. */
3437 for (i
= 0; i
< sizeof (spare_memory
) / sizeof (char *); i
++)
3438 if (spare_memory
[i
])
3441 free (spare_memory
[i
]);
3442 else if (i
>= 1 && i
<= 4)
3443 lisp_align_free (spare_memory
[i
]);
3445 lisp_free (spare_memory
[i
]);
3446 spare_memory
[i
] = 0;
3449 /* Record the space now used. When it decreases substantially,
3450 we can refill the memory reserve. */
3451 #ifndef SYSTEM_MALLOC
3452 bytes_used_when_full
= BYTES_USED
;
3455 /* This used to call error, but if we've run out of memory, we could
3456 get infinite recursion trying to build the string. */
3457 xsignal (Qnil
, Vmemory_signal_data
);
3460 /* If we released our reserve (due to running out of memory),
3461 and we have a fair amount free once again,
3462 try to set aside another reserve in case we run out once more.
3464 This is called when a relocatable block is freed in ralloc.c,
3465 and also directly from this file, in case we're not using ralloc.c. */
3468 refill_memory_reserve ()
3470 #ifndef SYSTEM_MALLOC
3471 if (spare_memory
[0] == 0)
3472 spare_memory
[0] = (char *) malloc ((size_t) SPARE_MEMORY
);
3473 if (spare_memory
[1] == 0)
3474 spare_memory
[1] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3476 if (spare_memory
[2] == 0)
3477 spare_memory
[2] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3479 if (spare_memory
[3] == 0)
3480 spare_memory
[3] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3482 if (spare_memory
[4] == 0)
3483 spare_memory
[4] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3485 if (spare_memory
[5] == 0)
3486 spare_memory
[5] = (char *) lisp_malloc (sizeof (struct string_block
),
3488 if (spare_memory
[6] == 0)
3489 spare_memory
[6] = (char *) lisp_malloc (sizeof (struct string_block
),
3491 if (spare_memory
[0] && spare_memory
[1] && spare_memory
[5])
3492 Vmemory_full
= Qnil
;
3496 /************************************************************************
3498 ************************************************************************/
3500 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
3502 /* Conservative C stack marking requires a method to identify possibly
3503 live Lisp objects given a pointer value. We do this by keeping
3504 track of blocks of Lisp data that are allocated in a red-black tree
3505 (see also the comment of mem_node which is the type of nodes in
3506 that tree). Function lisp_malloc adds information for an allocated
3507 block to the red-black tree with calls to mem_insert, and function
3508 lisp_free removes it with mem_delete. Functions live_string_p etc
3509 call mem_find to lookup information about a given pointer in the
3510 tree, and use that to determine if the pointer points to a Lisp
3513 /* Initialize this part of alloc.c. */
3518 mem_z
.left
= mem_z
.right
= MEM_NIL
;
3519 mem_z
.parent
= NULL
;
3520 mem_z
.color
= MEM_BLACK
;
3521 mem_z
.start
= mem_z
.end
= NULL
;
3526 /* Value is a pointer to the mem_node containing START. Value is
3527 MEM_NIL if there is no node in the tree containing START. */
3529 static INLINE
struct mem_node
*
3535 if (start
< min_heap_address
|| start
> max_heap_address
)
3538 /* Make the search always successful to speed up the loop below. */
3539 mem_z
.start
= start
;
3540 mem_z
.end
= (char *) start
+ 1;
3543 while (start
< p
->start
|| start
>= p
->end
)
3544 p
= start
< p
->start
? p
->left
: p
->right
;
3549 /* Insert a new node into the tree for a block of memory with start
3550 address START, end address END, and type TYPE. Value is a
3551 pointer to the node that was inserted. */
3553 static struct mem_node
*
3554 mem_insert (start
, end
, type
)
3558 struct mem_node
*c
, *parent
, *x
;
3560 if (min_heap_address
== NULL
|| start
< min_heap_address
)
3561 min_heap_address
= start
;
3562 if (max_heap_address
== NULL
|| end
> max_heap_address
)
3563 max_heap_address
= end
;
3565 /* See where in the tree a node for START belongs. In this
3566 particular application, it shouldn't happen that a node is already
3567 present. For debugging purposes, let's check that. */
3571 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3573 while (c
!= MEM_NIL
)
3575 if (start
>= c
->start
&& start
< c
->end
)
3578 c
= start
< c
->start
? c
->left
: c
->right
;
3581 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3583 while (c
!= MEM_NIL
)
3586 c
= start
< c
->start
? c
->left
: c
->right
;
3589 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3591 /* Create a new node. */
3592 #ifdef GC_MALLOC_CHECK
3593 x
= (struct mem_node
*) _malloc_internal (sizeof *x
);
3597 x
= (struct mem_node
*) xmalloc (sizeof *x
);
3603 x
->left
= x
->right
= MEM_NIL
;
3606 /* Insert it as child of PARENT or install it as root. */
3609 if (start
< parent
->start
)
3617 /* Re-establish red-black tree properties. */
3618 mem_insert_fixup (x
);
3624 /* Re-establish the red-black properties of the tree, and thereby
3625 balance the tree, after node X has been inserted; X is always red. */
3628 mem_insert_fixup (x
)
3631 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3633 /* X is red and its parent is red. This is a violation of
3634 red-black tree property #3. */
3636 if (x
->parent
== x
->parent
->parent
->left
)
3638 /* We're on the left side of our grandparent, and Y is our
3640 struct mem_node
*y
= x
->parent
->parent
->right
;
3642 if (y
->color
== MEM_RED
)
3644 /* Uncle and parent are red but should be black because
3645 X is red. Change the colors accordingly and proceed
3646 with the grandparent. */
3647 x
->parent
->color
= MEM_BLACK
;
3648 y
->color
= MEM_BLACK
;
3649 x
->parent
->parent
->color
= MEM_RED
;
3650 x
= x
->parent
->parent
;
3654 /* Parent and uncle have different colors; parent is
3655 red, uncle is black. */
3656 if (x
== x
->parent
->right
)
3659 mem_rotate_left (x
);
3662 x
->parent
->color
= MEM_BLACK
;
3663 x
->parent
->parent
->color
= MEM_RED
;
3664 mem_rotate_right (x
->parent
->parent
);
3669 /* This is the symmetrical case of above. */
3670 struct mem_node
*y
= x
->parent
->parent
->left
;
3672 if (y
->color
== MEM_RED
)
3674 x
->parent
->color
= MEM_BLACK
;
3675 y
->color
= MEM_BLACK
;
3676 x
->parent
->parent
->color
= MEM_RED
;
3677 x
= x
->parent
->parent
;
3681 if (x
== x
->parent
->left
)
3684 mem_rotate_right (x
);
3687 x
->parent
->color
= MEM_BLACK
;
3688 x
->parent
->parent
->color
= MEM_RED
;
3689 mem_rotate_left (x
->parent
->parent
);
3694 /* The root may have been changed to red due to the algorithm. Set
3695 it to black so that property #5 is satisfied. */
3696 mem_root
->color
= MEM_BLACK
;
3712 /* Turn y's left sub-tree into x's right sub-tree. */
3715 if (y
->left
!= MEM_NIL
)
3716 y
->left
->parent
= x
;
3718 /* Y's parent was x's parent. */
3720 y
->parent
= x
->parent
;
3722 /* Get the parent to point to y instead of x. */
3725 if (x
== x
->parent
->left
)
3726 x
->parent
->left
= y
;
3728 x
->parent
->right
= y
;
3733 /* Put x on y's left. */
3747 mem_rotate_right (x
)
3750 struct mem_node
*y
= x
->left
;
3753 if (y
->right
!= MEM_NIL
)
3754 y
->right
->parent
= x
;
3757 y
->parent
= x
->parent
;
3760 if (x
== x
->parent
->right
)
3761 x
->parent
->right
= y
;
3763 x
->parent
->left
= y
;
3774 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
3780 struct mem_node
*x
, *y
;
3782 if (!z
|| z
== MEM_NIL
)
3785 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
3790 while (y
->left
!= MEM_NIL
)
3794 if (y
->left
!= MEM_NIL
)
3799 x
->parent
= y
->parent
;
3802 if (y
== y
->parent
->left
)
3803 y
->parent
->left
= x
;
3805 y
->parent
->right
= x
;
3812 z
->start
= y
->start
;
3817 if (y
->color
== MEM_BLACK
)
3818 mem_delete_fixup (x
);
3820 #ifdef GC_MALLOC_CHECK
3828 /* Re-establish the red-black properties of the tree, after a
3832 mem_delete_fixup (x
)
3835 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
3837 if (x
== x
->parent
->left
)
3839 struct mem_node
*w
= x
->parent
->right
;
3841 if (w
->color
== MEM_RED
)
3843 w
->color
= MEM_BLACK
;
3844 x
->parent
->color
= MEM_RED
;
3845 mem_rotate_left (x
->parent
);
3846 w
= x
->parent
->right
;
3849 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
3856 if (w
->right
->color
== MEM_BLACK
)
3858 w
->left
->color
= MEM_BLACK
;
3860 mem_rotate_right (w
);
3861 w
= x
->parent
->right
;
3863 w
->color
= x
->parent
->color
;
3864 x
->parent
->color
= MEM_BLACK
;
3865 w
->right
->color
= MEM_BLACK
;
3866 mem_rotate_left (x
->parent
);
3872 struct mem_node
*w
= x
->parent
->left
;
3874 if (w
->color
== MEM_RED
)
3876 w
->color
= MEM_BLACK
;
3877 x
->parent
->color
= MEM_RED
;
3878 mem_rotate_right (x
->parent
);
3879 w
= x
->parent
->left
;
3882 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
3889 if (w
->left
->color
== MEM_BLACK
)
3891 w
->right
->color
= MEM_BLACK
;
3893 mem_rotate_left (w
);
3894 w
= x
->parent
->left
;
3897 w
->color
= x
->parent
->color
;
3898 x
->parent
->color
= MEM_BLACK
;
3899 w
->left
->color
= MEM_BLACK
;
3900 mem_rotate_right (x
->parent
);
3906 x
->color
= MEM_BLACK
;
3910 /* Value is non-zero if P is a pointer to a live Lisp string on
3911 the heap. M is a pointer to the mem_block for P. */
3914 live_string_p (m
, p
)
3918 if (m
->type
== MEM_TYPE_STRING
)
3920 struct string_block
*b
= (struct string_block
*) m
->start
;
3921 int offset
= (char *) p
- (char *) &b
->strings
[0];
3923 /* P must point to the start of a Lisp_String structure, and it
3924 must not be on the free-list. */
3926 && offset
% sizeof b
->strings
[0] == 0
3927 && offset
< (STRING_BLOCK_SIZE
* sizeof b
->strings
[0])
3928 && ((struct Lisp_String
*) p
)->data
!= NULL
);
3935 /* Value is non-zero if P is a pointer to a live Lisp cons on
3936 the heap. M is a pointer to the mem_block for P. */
3943 if (m
->type
== MEM_TYPE_CONS
)
3945 struct cons_block
*b
= (struct cons_block
*) m
->start
;
3946 int offset
= (char *) p
- (char *) &b
->conses
[0];
3948 /* P must point to the start of a Lisp_Cons, not be
3949 one of the unused cells in the current cons block,
3950 and not be on the free-list. */
3952 && offset
% sizeof b
->conses
[0] == 0
3953 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
3955 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
3956 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
3963 /* Value is non-zero if P is a pointer to a live Lisp symbol on
3964 the heap. M is a pointer to the mem_block for P. */
3967 live_symbol_p (m
, p
)
3971 if (m
->type
== MEM_TYPE_SYMBOL
)
3973 struct symbol_block
*b
= (struct symbol_block
*) m
->start
;
3974 int offset
= (char *) p
- (char *) &b
->symbols
[0];
3976 /* P must point to the start of a Lisp_Symbol, not be
3977 one of the unused cells in the current symbol block,
3978 and not be on the free-list. */
3980 && offset
% sizeof b
->symbols
[0] == 0
3981 && offset
< (SYMBOL_BLOCK_SIZE
* sizeof b
->symbols
[0])
3982 && (b
!= symbol_block
3983 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
3984 && !EQ (((struct Lisp_Symbol
*) p
)->function
, Vdead
));
3991 /* Value is non-zero if P is a pointer to a live Lisp float on
3992 the heap. M is a pointer to the mem_block for P. */
3999 if (m
->type
== MEM_TYPE_FLOAT
)
4001 struct float_block
*b
= (struct float_block
*) m
->start
;
4002 int offset
= (char *) p
- (char *) &b
->floats
[0];
4004 /* P must point to the start of a Lisp_Float and not be
4005 one of the unused cells in the current float block. */
4007 && offset
% sizeof b
->floats
[0] == 0
4008 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
4009 && (b
!= float_block
4010 || offset
/ sizeof b
->floats
[0] < float_block_index
));
4017 /* Value is non-zero if P is a pointer to a live Lisp Misc on
4018 the heap. M is a pointer to the mem_block for P. */
4025 if (m
->type
== MEM_TYPE_MISC
)
4027 struct marker_block
*b
= (struct marker_block
*) m
->start
;
4028 int offset
= (char *) p
- (char *) &b
->markers
[0];
4030 /* P must point to the start of a Lisp_Misc, not be
4031 one of the unused cells in the current misc block,
4032 and not be on the free-list. */
4034 && offset
% sizeof b
->markers
[0] == 0
4035 && offset
< (MARKER_BLOCK_SIZE
* sizeof b
->markers
[0])
4036 && (b
!= marker_block
4037 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
4038 && ((union Lisp_Misc
*) p
)->u_any
.type
!= Lisp_Misc_Free
);
4045 /* Value is non-zero if P is a pointer to a live vector-like object.
4046 M is a pointer to the mem_block for P. */
4049 live_vector_p (m
, p
)
4053 return (p
== m
->start
&& m
->type
== MEM_TYPE_VECTORLIKE
);
4057 /* Value is non-zero if P is a pointer to a live buffer. M is a
4058 pointer to the mem_block for P. */
4061 live_buffer_p (m
, p
)
4065 /* P must point to the start of the block, and the buffer
4066 must not have been killed. */
4067 return (m
->type
== MEM_TYPE_BUFFER
4069 && !NILP (((struct buffer
*) p
)->name
));
4072 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
4076 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4078 /* Array of objects that are kept alive because the C stack contains
4079 a pattern that looks like a reference to them . */
4081 #define MAX_ZOMBIES 10
4082 static Lisp_Object zombies
[MAX_ZOMBIES
];
4084 /* Number of zombie objects. */
4086 static int nzombies
;
4088 /* Number of garbage collections. */
4092 /* Average percentage of zombies per collection. */
4094 static double avg_zombies
;
4096 /* Max. number of live and zombie objects. */
4098 static int max_live
, max_zombies
;
4100 /* Average number of live objects per GC. */
4102 static double avg_live
;
4104 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
4105 doc
: /* Show information about live and zombie objects. */)
4108 Lisp_Object args
[8], zombie_list
= Qnil
;
4110 for (i
= 0; i
< nzombies
; i
++)
4111 zombie_list
= Fcons (zombies
[i
], zombie_list
);
4112 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
4113 args
[1] = make_number (ngcs
);
4114 args
[2] = make_float (avg_live
);
4115 args
[3] = make_float (avg_zombies
);
4116 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
4117 args
[5] = make_number (max_live
);
4118 args
[6] = make_number (max_zombies
);
4119 args
[7] = zombie_list
;
4120 return Fmessage (8, args
);
4123 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4126 /* Mark OBJ if we can prove it's a Lisp_Object. */
4129 mark_maybe_object (obj
)
4132 void *po
= (void *) XPNTR (obj
);
4133 struct mem_node
*m
= mem_find (po
);
4139 switch (XTYPE (obj
))
4142 mark_p
= (live_string_p (m
, po
)
4143 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
4147 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
4151 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
4155 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
4158 case Lisp_Vectorlike
:
4159 /* Note: can't check BUFFERP before we know it's a
4160 buffer because checking that dereferences the pointer
4161 PO which might point anywhere. */
4162 if (live_vector_p (m
, po
))
4163 mark_p
= !SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
4164 else if (live_buffer_p (m
, po
))
4165 mark_p
= BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
4169 mark_p
= (live_misc_p (m
, po
) && !XMISCANY (obj
)->gcmarkbit
);
4173 case Lisp_Type_Limit
:
4179 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4180 if (nzombies
< MAX_ZOMBIES
)
4181 zombies
[nzombies
] = obj
;
4190 /* If P points to Lisp data, mark that as live if it isn't already
4194 mark_maybe_pointer (p
)
4199 /* Quickly rule out some values which can't point to Lisp data. */
4202 8 /* USE_LSB_TAG needs Lisp data to be aligned on multiples of 8. */
4204 2 /* We assume that Lisp data is aligned on even addresses. */
4212 Lisp_Object obj
= Qnil
;
4216 case MEM_TYPE_NON_LISP
:
4217 /* Nothing to do; not a pointer to Lisp memory. */
4220 case MEM_TYPE_BUFFER
:
4221 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P((struct buffer
*)p
))
4222 XSETVECTOR (obj
, p
);
4226 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
4230 case MEM_TYPE_STRING
:
4231 if (live_string_p (m
, p
)
4232 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
4233 XSETSTRING (obj
, p
);
4237 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
4241 case MEM_TYPE_SYMBOL
:
4242 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
4243 XSETSYMBOL (obj
, p
);
4246 case MEM_TYPE_FLOAT
:
4247 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
4251 case MEM_TYPE_VECTORLIKE
:
4252 if (live_vector_p (m
, p
))
4255 XSETVECTOR (tem
, p
);
4256 if (!SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
4271 /* Mark Lisp objects referenced from the address range START+OFFSET..END
4272 or END+OFFSET..START. */
4275 mark_memory (start
, end
, offset
)
4282 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4286 /* Make START the pointer to the start of the memory region,
4287 if it isn't already. */
4295 /* Mark Lisp_Objects. */
4296 for (p
= (Lisp_Object
*) ((char *) start
+ offset
); (void *) p
< end
; ++p
)
4297 mark_maybe_object (*p
);
4299 /* Mark Lisp data pointed to. This is necessary because, in some
4300 situations, the C compiler optimizes Lisp objects away, so that
4301 only a pointer to them remains. Example:
4303 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
4306 Lisp_Object obj = build_string ("test");
4307 struct Lisp_String *s = XSTRING (obj);
4308 Fgarbage_collect ();
4309 fprintf (stderr, "test `%s'\n", s->data);
4313 Here, `obj' isn't really used, and the compiler optimizes it
4314 away. The only reference to the life string is through the
4317 for (pp
= (void **) ((char *) start
+ offset
); (void *) pp
< end
; ++pp
)
4318 mark_maybe_pointer (*pp
);
4321 /* setjmp will work with GCC unless NON_SAVING_SETJMP is defined in
4322 the GCC system configuration. In gcc 3.2, the only systems for
4323 which this is so are i386-sco5 non-ELF, i386-sysv3 (maybe included
4324 by others?) and ns32k-pc532-min. */
4326 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
4328 static int setjmp_tested_p
, longjmps_done
;
4330 #define SETJMP_WILL_LIKELY_WORK "\
4332 Emacs garbage collector has been changed to use conservative stack\n\
4333 marking. Emacs has determined that the method it uses to do the\n\
4334 marking will likely work on your system, but this isn't sure.\n\
4336 If you are a system-programmer, or can get the help of a local wizard\n\
4337 who is, please take a look at the function mark_stack in alloc.c, and\n\
4338 verify that the methods used are appropriate for your system.\n\
4340 Please mail the result to <emacs-devel@gnu.org>.\n\
4343 #define SETJMP_WILL_NOT_WORK "\
4345 Emacs garbage collector has been changed to use conservative stack\n\
4346 marking. Emacs has determined that the default method it uses to do the\n\
4347 marking will not work on your system. We will need a system-dependent\n\
4348 solution for your system.\n\
4350 Please take a look at the function mark_stack in alloc.c, and\n\
4351 try to find a way to make it work on your system.\n\
4353 Note that you may get false negatives, depending on the compiler.\n\
4354 In particular, you need to use -O with GCC for this test.\n\
4356 Please mail the result to <emacs-devel@gnu.org>.\n\
4360 /* Perform a quick check if it looks like setjmp saves registers in a
4361 jmp_buf. Print a message to stderr saying so. When this test
4362 succeeds, this is _not_ a proof that setjmp is sufficient for
4363 conservative stack marking. Only the sources or a disassembly
4374 /* Arrange for X to be put in a register. */
4380 if (longjmps_done
== 1)
4382 /* Came here after the longjmp at the end of the function.
4384 If x == 1, the longjmp has restored the register to its
4385 value before the setjmp, and we can hope that setjmp
4386 saves all such registers in the jmp_buf, although that
4389 For other values of X, either something really strange is
4390 taking place, or the setjmp just didn't save the register. */
4393 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
4396 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
4403 if (longjmps_done
== 1)
4407 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
4410 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4412 /* Abort if anything GCPRO'd doesn't survive the GC. */
4420 for (p
= gcprolist
; p
; p
= p
->next
)
4421 for (i
= 0; i
< p
->nvars
; ++i
)
4422 if (!survives_gc_p (p
->var
[i
]))
4423 /* FIXME: It's not necessarily a bug. It might just be that the
4424 GCPRO is unnecessary or should release the object sooner. */
4428 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4435 fprintf (stderr
, "\nZombies kept alive = %d:\n", nzombies
);
4436 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
4438 fprintf (stderr
, " %d = ", i
);
4439 debug_print (zombies
[i
]);
4443 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4446 /* Mark live Lisp objects on the C stack.
4448 There are several system-dependent problems to consider when
4449 porting this to new architectures:
4453 We have to mark Lisp objects in CPU registers that can hold local
4454 variables or are used to pass parameters.
4456 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
4457 something that either saves relevant registers on the stack, or
4458 calls mark_maybe_object passing it each register's contents.
4460 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
4461 implementation assumes that calling setjmp saves registers we need
4462 to see in a jmp_buf which itself lies on the stack. This doesn't
4463 have to be true! It must be verified for each system, possibly
4464 by taking a look at the source code of setjmp.
4468 Architectures differ in the way their processor stack is organized.
4469 For example, the stack might look like this
4472 | Lisp_Object | size = 4
4474 | something else | size = 2
4476 | Lisp_Object | size = 4
4480 In such a case, not every Lisp_Object will be aligned equally. To
4481 find all Lisp_Object on the stack it won't be sufficient to walk
4482 the stack in steps of 4 bytes. Instead, two passes will be
4483 necessary, one starting at the start of the stack, and a second
4484 pass starting at the start of the stack + 2. Likewise, if the
4485 minimal alignment of Lisp_Objects on the stack is 1, four passes
4486 would be necessary, each one starting with one byte more offset
4487 from the stack start.
4489 The current code assumes by default that Lisp_Objects are aligned
4490 equally on the stack. */
4496 /* jmp_buf may not be aligned enough on darwin-ppc64 */
4497 union aligned_jmpbuf
{
4501 volatile int stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
4504 /* This trick flushes the register windows so that all the state of
4505 the process is contained in the stack. */
4506 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
4507 needed on ia64 too. See mach_dep.c, where it also says inline
4508 assembler doesn't work with relevant proprietary compilers. */
4513 /* Save registers that we need to see on the stack. We need to see
4514 registers used to hold register variables and registers used to
4516 #ifdef GC_SAVE_REGISTERS_ON_STACK
4517 GC_SAVE_REGISTERS_ON_STACK (end
);
4518 #else /* not GC_SAVE_REGISTERS_ON_STACK */
4520 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
4521 setjmp will definitely work, test it
4522 and print a message with the result
4524 if (!setjmp_tested_p
)
4526 setjmp_tested_p
= 1;
4529 #endif /* GC_SETJMP_WORKS */
4532 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
4533 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
4535 /* This assumes that the stack is a contiguous region in memory. If
4536 that's not the case, something has to be done here to iterate
4537 over the stack segments. */
4538 #ifndef GC_LISP_OBJECT_ALIGNMENT
4540 #define GC_LISP_OBJECT_ALIGNMENT __alignof__ (Lisp_Object)
4542 #define GC_LISP_OBJECT_ALIGNMENT sizeof (Lisp_Object)
4545 for (i
= 0; i
< sizeof (Lisp_Object
); i
+= GC_LISP_OBJECT_ALIGNMENT
)
4546 mark_memory (stack_base
, end
, i
);
4547 /* Allow for marking a secondary stack, like the register stack on the
4549 #ifdef GC_MARK_SECONDARY_STACK
4550 GC_MARK_SECONDARY_STACK ();
4553 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4558 #endif /* GC_MARK_STACK != 0 */
4561 /* Determine whether it is safe to access memory at address P. */
4567 return w32_valid_pointer_p (p
, 16);
4571 /* Obviously, we cannot just access it (we would SEGV trying), so we
4572 trick the o/s to tell us whether p is a valid pointer.
4573 Unfortunately, we cannot use NULL_DEVICE here, as emacs_write may
4574 not validate p in that case. */
4576 if ((fd
= emacs_open ("__Valid__Lisp__Object__", O_CREAT
| O_WRONLY
| O_TRUNC
, 0666)) >= 0)
4578 int valid
= (emacs_write (fd
, (char *)p
, 16) == 16);
4580 unlink ("__Valid__Lisp__Object__");
4588 /* Return 1 if OBJ is a valid lisp object.
4589 Return 0 if OBJ is NOT a valid lisp object.
4590 Return -1 if we cannot validate OBJ.
4591 This function can be quite slow,
4592 so it should only be used in code for manual debugging. */
4595 valid_lisp_object_p (obj
)
4606 p
= (void *) XPNTR (obj
);
4607 if (PURE_POINTER_P (p
))
4611 return valid_pointer_p (p
);
4618 int valid
= valid_pointer_p (p
);
4630 case MEM_TYPE_NON_LISP
:
4633 case MEM_TYPE_BUFFER
:
4634 return live_buffer_p (m
, p
);
4637 return live_cons_p (m
, p
);
4639 case MEM_TYPE_STRING
:
4640 return live_string_p (m
, p
);
4643 return live_misc_p (m
, p
);
4645 case MEM_TYPE_SYMBOL
:
4646 return live_symbol_p (m
, p
);
4648 case MEM_TYPE_FLOAT
:
4649 return live_float_p (m
, p
);
4651 case MEM_TYPE_VECTORLIKE
:
4652 return live_vector_p (m
, p
);
4665 /***********************************************************************
4666 Pure Storage Management
4667 ***********************************************************************/
4669 /* Allocate room for SIZE bytes from pure Lisp storage and return a
4670 pointer to it. TYPE is the Lisp type for which the memory is
4671 allocated. TYPE < 0 means it's not used for a Lisp object. */
4673 static POINTER_TYPE
*
4674 pure_alloc (size
, type
)
4678 POINTER_TYPE
*result
;
4680 size_t alignment
= (1 << GCTYPEBITS
);
4682 size_t alignment
= sizeof (EMACS_INT
);
4684 /* Give Lisp_Floats an extra alignment. */
4685 if (type
== Lisp_Float
)
4687 #if defined __GNUC__ && __GNUC__ >= 2
4688 alignment
= __alignof (struct Lisp_Float
);
4690 alignment
= sizeof (struct Lisp_Float
);
4698 /* Allocate space for a Lisp object from the beginning of the free
4699 space with taking account of alignment. */
4700 result
= ALIGN (purebeg
+ pure_bytes_used_lisp
, alignment
);
4701 pure_bytes_used_lisp
= ((char *)result
- (char *)purebeg
) + size
;
4705 /* Allocate space for a non-Lisp object from the end of the free
4707 pure_bytes_used_non_lisp
+= size
;
4708 result
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4710 pure_bytes_used
= pure_bytes_used_lisp
+ pure_bytes_used_non_lisp
;
4712 if (pure_bytes_used
<= pure_size
)
4715 /* Don't allocate a large amount here,
4716 because it might get mmap'd and then its address
4717 might not be usable. */
4718 purebeg
= (char *) xmalloc (10000);
4720 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
4721 pure_bytes_used
= 0;
4722 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
4727 /* Print a warning if PURESIZE is too small. */
4732 if (pure_bytes_used_before_overflow
)
4733 message ("emacs:0:Pure Lisp storage overflow (approx. %d bytes needed)",
4734 (int) (pure_bytes_used
+ pure_bytes_used_before_overflow
));
4738 /* Find the byte sequence {DATA[0], ..., DATA[NBYTES-1], '\0'} from
4739 the non-Lisp data pool of the pure storage, and return its start
4740 address. Return NULL if not found. */
4743 find_string_data_in_pure (data
, nbytes
)
4747 int i
, skip
, bm_skip
[256], last_char_skip
, infinity
, start
, start_max
;
4751 if (pure_bytes_used_non_lisp
< nbytes
+ 1)
4754 /* Set up the Boyer-Moore table. */
4756 for (i
= 0; i
< 256; i
++)
4759 p
= (unsigned char *) data
;
4761 bm_skip
[*p
++] = skip
;
4763 last_char_skip
= bm_skip
['\0'];
4765 non_lisp_beg
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4766 start_max
= pure_bytes_used_non_lisp
- (nbytes
+ 1);
4768 /* See the comments in the function `boyer_moore' (search.c) for the
4769 use of `infinity'. */
4770 infinity
= pure_bytes_used_non_lisp
+ 1;
4771 bm_skip
['\0'] = infinity
;
4773 p
= (unsigned char *) non_lisp_beg
+ nbytes
;
4777 /* Check the last character (== '\0'). */
4780 start
+= bm_skip
[*(p
+ start
)];
4782 while (start
<= start_max
);
4784 if (start
< infinity
)
4785 /* Couldn't find the last character. */
4788 /* No less than `infinity' means we could find the last
4789 character at `p[start - infinity]'. */
4792 /* Check the remaining characters. */
4793 if (memcmp (data
, non_lisp_beg
+ start
, nbytes
) == 0)
4795 return non_lisp_beg
+ start
;
4797 start
+= last_char_skip
;
4799 while (start
<= start_max
);
4805 /* Return a string allocated in pure space. DATA is a buffer holding
4806 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
4807 non-zero means make the result string multibyte.
4809 Must get an error if pure storage is full, since if it cannot hold
4810 a large string it may be able to hold conses that point to that
4811 string; then the string is not protected from gc. */
4814 make_pure_string (data
, nchars
, nbytes
, multibyte
)
4820 struct Lisp_String
*s
;
4822 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4823 s
->data
= find_string_data_in_pure (data
, nbytes
);
4824 if (s
->data
== NULL
)
4826 s
->data
= (unsigned char *) pure_alloc (nbytes
+ 1, -1);
4827 bcopy (data
, s
->data
, nbytes
);
4828 s
->data
[nbytes
] = '\0';
4831 s
->size_byte
= multibyte
? nbytes
: -1;
4832 s
->intervals
= NULL_INTERVAL
;
4833 XSETSTRING (string
, s
);
4838 /* Return a cons allocated from pure space. Give it pure copies
4839 of CAR as car and CDR as cdr. */
4842 pure_cons (car
, cdr
)
4843 Lisp_Object car
, cdr
;
4845 register Lisp_Object
new;
4846 struct Lisp_Cons
*p
;
4848 p
= (struct Lisp_Cons
*) pure_alloc (sizeof *p
, Lisp_Cons
);
4850 XSETCAR (new, Fpurecopy (car
));
4851 XSETCDR (new, Fpurecopy (cdr
));
4856 /* Value is a float object with value NUM allocated from pure space. */
4859 make_pure_float (num
)
4862 register Lisp_Object
new;
4863 struct Lisp_Float
*p
;
4865 p
= (struct Lisp_Float
*) pure_alloc (sizeof *p
, Lisp_Float
);
4867 XFLOAT_DATA (new) = num
;
4872 /* Return a vector with room for LEN Lisp_Objects allocated from
4876 make_pure_vector (len
)
4880 struct Lisp_Vector
*p
;
4881 size_t size
= sizeof *p
+ (len
- 1) * sizeof (Lisp_Object
);
4883 p
= (struct Lisp_Vector
*) pure_alloc (size
, Lisp_Vectorlike
);
4884 XSETVECTOR (new, p
);
4885 XVECTOR (new)->size
= len
;
4890 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
4891 doc
: /* Make a copy of object OBJ in pure storage.
4892 Recursively copies contents of vectors and cons cells.
4893 Does not copy symbols. Copies strings without text properties. */)
4895 register Lisp_Object obj
;
4897 if (NILP (Vpurify_flag
))
4900 if (PURE_POINTER_P (XPNTR (obj
)))
4904 return pure_cons (XCAR (obj
), XCDR (obj
));
4905 else if (FLOATP (obj
))
4906 return make_pure_float (XFLOAT_DATA (obj
));
4907 else if (STRINGP (obj
))
4908 return make_pure_string (SDATA (obj
), SCHARS (obj
),
4910 STRING_MULTIBYTE (obj
));
4911 else if (COMPILEDP (obj
) || VECTORP (obj
))
4913 register struct Lisp_Vector
*vec
;
4917 size
= XVECTOR (obj
)->size
;
4918 if (size
& PSEUDOVECTOR_FLAG
)
4919 size
&= PSEUDOVECTOR_SIZE_MASK
;
4920 vec
= XVECTOR (make_pure_vector (size
));
4921 for (i
= 0; i
< size
; i
++)
4922 vec
->contents
[i
] = Fpurecopy (XVECTOR (obj
)->contents
[i
]);
4923 if (COMPILEDP (obj
))
4925 XSETPVECTYPE (vec
, PVEC_COMPILED
);
4926 XSETCOMPILED (obj
, vec
);
4929 XSETVECTOR (obj
, vec
);
4932 else if (MARKERP (obj
))
4933 error ("Attempt to copy a marker to pure storage");
4940 /***********************************************************************
4942 ***********************************************************************/
4944 /* Put an entry in staticvec, pointing at the variable with address
4948 staticpro (varaddress
)
4949 Lisp_Object
*varaddress
;
4951 staticvec
[staticidx
++] = varaddress
;
4952 if (staticidx
>= NSTATICS
)
4960 struct catchtag
*next
;
4964 /***********************************************************************
4966 ***********************************************************************/
4968 /* Temporarily prevent garbage collection. */
4971 inhibit_garbage_collection ()
4973 int count
= SPECPDL_INDEX ();
4974 int nbits
= min (VALBITS
, BITS_PER_INT
);
4976 specbind (Qgc_cons_threshold
, make_number (((EMACS_INT
) 1 << (nbits
- 1)) - 1));
4981 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
4982 doc
: /* Reclaim storage for Lisp objects no longer needed.
4983 Garbage collection happens automatically if you cons more than
4984 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
4985 `garbage-collect' normally returns a list with info on amount of space in use:
4986 ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)
4987 (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS
4988 (USED-FLOATS . FREE-FLOATS) (USED-INTERVALS . FREE-INTERVALS)
4989 (USED-STRINGS . FREE-STRINGS))
4990 However, if there was overflow in pure space, `garbage-collect'
4991 returns nil, because real GC can't be done. */)
4994 register struct specbinding
*bind
;
4995 struct catchtag
*catch;
4996 struct handler
*handler
;
4997 char stack_top_variable
;
5000 Lisp_Object total
[8];
5001 int count
= SPECPDL_INDEX ();
5002 EMACS_TIME t1
, t2
, t3
;
5007 /* Can't GC if pure storage overflowed because we can't determine
5008 if something is a pure object or not. */
5009 if (pure_bytes_used_before_overflow
)
5014 /* Don't keep undo information around forever.
5015 Do this early on, so it is no problem if the user quits. */
5017 register struct buffer
*nextb
= all_buffers
;
5021 /* If a buffer's undo list is Qt, that means that undo is
5022 turned off in that buffer. Calling truncate_undo_list on
5023 Qt tends to return NULL, which effectively turns undo back on.
5024 So don't call truncate_undo_list if undo_list is Qt. */
5025 if (! NILP (nextb
->name
) && ! EQ (nextb
->undo_list
, Qt
))
5026 truncate_undo_list (nextb
);
5028 /* Shrink buffer gaps, but skip indirect and dead buffers. */
5029 if (nextb
->base_buffer
== 0 && !NILP (nextb
->name
)
5030 && ! nextb
->text
->inhibit_shrinking
)
5032 /* If a buffer's gap size is more than 10% of the buffer
5033 size, or larger than 2000 bytes, then shrink it
5034 accordingly. Keep a minimum size of 20 bytes. */
5035 int size
= min (2000, max (20, (nextb
->text
->z_byte
/ 10)));
5037 if (nextb
->text
->gap_size
> size
)
5039 struct buffer
*save_current
= current_buffer
;
5040 current_buffer
= nextb
;
5041 make_gap (-(nextb
->text
->gap_size
- size
));
5042 current_buffer
= save_current
;
5046 nextb
= nextb
->next
;
5050 EMACS_GET_TIME (t1
);
5052 /* In case user calls debug_print during GC,
5053 don't let that cause a recursive GC. */
5054 consing_since_gc
= 0;
5056 /* Save what's currently displayed in the echo area. */
5057 message_p
= push_message ();
5058 record_unwind_protect (pop_message_unwind
, Qnil
);
5060 /* Save a copy of the contents of the stack, for debugging. */
5061 #if MAX_SAVE_STACK > 0
5062 if (NILP (Vpurify_flag
))
5064 i
= &stack_top_variable
- stack_bottom
;
5066 if (i
< MAX_SAVE_STACK
)
5068 if (stack_copy
== 0)
5069 stack_copy
= (char *) xmalloc (stack_copy_size
= i
);
5070 else if (stack_copy_size
< i
)
5071 stack_copy
= (char *) xrealloc (stack_copy
, (stack_copy_size
= i
));
5074 if ((EMACS_INT
) (&stack_top_variable
- stack_bottom
) > 0)
5075 bcopy (stack_bottom
, stack_copy
, i
);
5077 bcopy (&stack_top_variable
, stack_copy
, i
);
5081 #endif /* MAX_SAVE_STACK > 0 */
5083 if (garbage_collection_messages
)
5084 message1_nolog ("Garbage collecting...");
5088 shrink_regexp_cache ();
5092 /* clear_marks (); */
5094 /* Mark all the special slots that serve as the roots of accessibility. */
5096 for (i
= 0; i
< staticidx
; i
++)
5097 mark_object (*staticvec
[i
]);
5099 for (bind
= specpdl
; bind
!= specpdl_ptr
; bind
++)
5101 mark_object (bind
->symbol
);
5102 mark_object (bind
->old_value
);
5110 extern void xg_mark_data ();
5115 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
5116 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
5120 register struct gcpro
*tail
;
5121 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
5122 for (i
= 0; i
< tail
->nvars
; i
++)
5123 mark_object (tail
->var
[i
]);
5128 for (catch = catchlist
; catch; catch = catch->next
)
5130 mark_object (catch->tag
);
5131 mark_object (catch->val
);
5133 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
5135 mark_object (handler
->handler
);
5136 mark_object (handler
->var
);
5140 #ifdef HAVE_WINDOW_SYSTEM
5141 mark_fringe_data ();
5144 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5148 /* Everything is now marked, except for the things that require special
5149 finalization, i.e. the undo_list.
5150 Look thru every buffer's undo list
5151 for elements that update markers that were not marked,
5154 register struct buffer
*nextb
= all_buffers
;
5158 /* If a buffer's undo list is Qt, that means that undo is
5159 turned off in that buffer. Calling truncate_undo_list on
5160 Qt tends to return NULL, which effectively turns undo back on.
5161 So don't call truncate_undo_list if undo_list is Qt. */
5162 if (! EQ (nextb
->undo_list
, Qt
))
5164 Lisp_Object tail
, prev
;
5165 tail
= nextb
->undo_list
;
5167 while (CONSP (tail
))
5169 if (CONSP (XCAR (tail
))
5170 && MARKERP (XCAR (XCAR (tail
)))
5171 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
5174 nextb
->undo_list
= tail
= XCDR (tail
);
5178 XSETCDR (prev
, tail
);
5188 /* Now that we have stripped the elements that need not be in the
5189 undo_list any more, we can finally mark the list. */
5190 mark_object (nextb
->undo_list
);
5192 nextb
= nextb
->next
;
5198 /* Clear the mark bits that we set in certain root slots. */
5200 unmark_byte_stack ();
5201 VECTOR_UNMARK (&buffer_defaults
);
5202 VECTOR_UNMARK (&buffer_local_symbols
);
5204 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
5212 /* clear_marks (); */
5215 consing_since_gc
= 0;
5216 if (gc_cons_threshold
< 10000)
5217 gc_cons_threshold
= 10000;
5219 if (FLOATP (Vgc_cons_percentage
))
5220 { /* Set gc_cons_combined_threshold. */
5221 EMACS_INT total
= 0;
5223 total
+= total_conses
* sizeof (struct Lisp_Cons
);
5224 total
+= total_symbols
* sizeof (struct Lisp_Symbol
);
5225 total
+= total_markers
* sizeof (union Lisp_Misc
);
5226 total
+= total_string_size
;
5227 total
+= total_vector_size
* sizeof (Lisp_Object
);
5228 total
+= total_floats
* sizeof (struct Lisp_Float
);
5229 total
+= total_intervals
* sizeof (struct interval
);
5230 total
+= total_strings
* sizeof (struct Lisp_String
);
5232 gc_relative_threshold
= total
* XFLOAT_DATA (Vgc_cons_percentage
);
5235 gc_relative_threshold
= 0;
5237 if (garbage_collection_messages
)
5239 if (message_p
|| minibuf_level
> 0)
5242 message1_nolog ("Garbage collecting...done");
5245 unbind_to (count
, Qnil
);
5247 total
[0] = Fcons (make_number (total_conses
),
5248 make_number (total_free_conses
));
5249 total
[1] = Fcons (make_number (total_symbols
),
5250 make_number (total_free_symbols
));
5251 total
[2] = Fcons (make_number (total_markers
),
5252 make_number (total_free_markers
));
5253 total
[3] = make_number (total_string_size
);
5254 total
[4] = make_number (total_vector_size
);
5255 total
[5] = Fcons (make_number (total_floats
),
5256 make_number (total_free_floats
));
5257 total
[6] = Fcons (make_number (total_intervals
),
5258 make_number (total_free_intervals
));
5259 total
[7] = Fcons (make_number (total_strings
),
5260 make_number (total_free_strings
));
5262 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5264 /* Compute average percentage of zombies. */
5267 for (i
= 0; i
< 7; ++i
)
5268 if (CONSP (total
[i
]))
5269 nlive
+= XFASTINT (XCAR (total
[i
]));
5271 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
5272 max_live
= max (nlive
, max_live
);
5273 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
5274 max_zombies
= max (nzombies
, max_zombies
);
5279 if (!NILP (Vpost_gc_hook
))
5281 int count
= inhibit_garbage_collection ();
5282 safe_run_hooks (Qpost_gc_hook
);
5283 unbind_to (count
, Qnil
);
5286 /* Accumulate statistics. */
5287 EMACS_GET_TIME (t2
);
5288 EMACS_SUB_TIME (t3
, t2
, t1
);
5289 if (FLOATP (Vgc_elapsed
))
5290 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
) +
5292 EMACS_USECS (t3
) * 1.0e-6);
5295 return Flist (sizeof total
/ sizeof *total
, total
);
5299 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
5300 only interesting objects referenced from glyphs are strings. */
5303 mark_glyph_matrix (matrix
)
5304 struct glyph_matrix
*matrix
;
5306 struct glyph_row
*row
= matrix
->rows
;
5307 struct glyph_row
*end
= row
+ matrix
->nrows
;
5309 for (; row
< end
; ++row
)
5313 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
5315 struct glyph
*glyph
= row
->glyphs
[area
];
5316 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
5318 for (; glyph
< end_glyph
; ++glyph
)
5319 if (STRINGP (glyph
->object
)
5320 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
5321 mark_object (glyph
->object
);
5327 /* Mark Lisp faces in the face cache C. */
5331 struct face_cache
*c
;
5336 for (i
= 0; i
< c
->used
; ++i
)
5338 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
5342 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
5343 mark_object (face
->lface
[j
]);
5350 #ifdef HAVE_WINDOW_SYSTEM
5352 /* Mark Lisp objects in image IMG. */
5358 mark_object (img
->spec
);
5360 if (!NILP (img
->data
.lisp_val
))
5361 mark_object (img
->data
.lisp_val
);
5365 /* Mark Lisp objects in image cache of frame F. It's done this way so
5366 that we don't have to include xterm.h here. */
5369 mark_image_cache (f
)
5372 forall_images_in_image_cache (f
, mark_image
);
5375 #endif /* HAVE_X_WINDOWS */
5379 /* Mark reference to a Lisp_Object.
5380 If the object referred to has not been seen yet, recursively mark
5381 all the references contained in it. */
5383 #define LAST_MARKED_SIZE 500
5384 Lisp_Object last_marked
[LAST_MARKED_SIZE
];
5385 int last_marked_index
;
5387 /* For debugging--call abort when we cdr down this many
5388 links of a list, in mark_object. In debugging,
5389 the call to abort will hit a breakpoint.
5390 Normally this is zero and the check never goes off. */
5391 int mark_object_loop_halt
;
5393 /* Return non-zero if the object was not yet marked. */
5395 mark_vectorlike (ptr
)
5396 struct Lisp_Vector
*ptr
;
5398 register EMACS_INT size
= ptr
->size
;
5401 if (VECTOR_MARKED_P (ptr
))
5402 return 0; /* Already marked */
5403 VECTOR_MARK (ptr
); /* Else mark it */
5404 if (size
& PSEUDOVECTOR_FLAG
)
5405 size
&= PSEUDOVECTOR_SIZE_MASK
;
5407 /* Note that this size is not the memory-footprint size, but only
5408 the number of Lisp_Object fields that we should trace.
5409 The distinction is used e.g. by Lisp_Process which places extra
5410 non-Lisp_Object fields at the end of the structure. */
5411 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5412 mark_object (ptr
->contents
[i
]);
5420 register Lisp_Object obj
= arg
;
5421 #ifdef GC_CHECK_MARKED_OBJECTS
5429 if (PURE_POINTER_P (XPNTR (obj
)))
5432 last_marked
[last_marked_index
++] = obj
;
5433 if (last_marked_index
== LAST_MARKED_SIZE
)
5434 last_marked_index
= 0;
5436 /* Perform some sanity checks on the objects marked here. Abort if
5437 we encounter an object we know is bogus. This increases GC time
5438 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
5439 #ifdef GC_CHECK_MARKED_OBJECTS
5441 po
= (void *) XPNTR (obj
);
5443 /* Check that the object pointed to by PO is known to be a Lisp
5444 structure allocated from the heap. */
5445 #define CHECK_ALLOCATED() \
5447 m = mem_find (po); \
5452 /* Check that the object pointed to by PO is live, using predicate
5454 #define CHECK_LIVE(LIVEP) \
5456 if (!LIVEP (m, po)) \
5460 /* Check both of the above conditions. */
5461 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
5463 CHECK_ALLOCATED (); \
5464 CHECK_LIVE (LIVEP); \
5467 #else /* not GC_CHECK_MARKED_OBJECTS */
5469 #define CHECK_ALLOCATED() (void) 0
5470 #define CHECK_LIVE(LIVEP) (void) 0
5471 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
5473 #endif /* not GC_CHECK_MARKED_OBJECTS */
5475 switch (SWITCH_ENUM_CAST (XTYPE (obj
)))
5479 register struct Lisp_String
*ptr
= XSTRING (obj
);
5480 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
5481 MARK_INTERVAL_TREE (ptr
->intervals
);
5483 #ifdef GC_CHECK_STRING_BYTES
5484 /* Check that the string size recorded in the string is the
5485 same as the one recorded in the sdata structure. */
5486 CHECK_STRING_BYTES (ptr
);
5487 #endif /* GC_CHECK_STRING_BYTES */
5491 case Lisp_Vectorlike
:
5492 #ifdef GC_CHECK_MARKED_OBJECTS
5494 if (m
== MEM_NIL
&& !SUBRP (obj
)
5495 && po
!= &buffer_defaults
5496 && po
!= &buffer_local_symbols
)
5498 #endif /* GC_CHECK_MARKED_OBJECTS */
5502 if (!VECTOR_MARKED_P (XBUFFER (obj
)))
5504 #ifdef GC_CHECK_MARKED_OBJECTS
5505 if (po
!= &buffer_defaults
&& po
!= &buffer_local_symbols
)
5508 for (b
= all_buffers
; b
&& b
!= po
; b
= b
->next
)
5513 #endif /* GC_CHECK_MARKED_OBJECTS */
5517 else if (SUBRP (obj
))
5519 else if (COMPILEDP (obj
))
5520 /* We could treat this just like a vector, but it is better to
5521 save the COMPILED_CONSTANTS element for last and avoid
5524 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5525 register EMACS_INT size
= ptr
->size
;
5528 if (VECTOR_MARKED_P (ptr
))
5529 break; /* Already marked */
5531 CHECK_LIVE (live_vector_p
);
5532 VECTOR_MARK (ptr
); /* Else mark it */
5533 size
&= PSEUDOVECTOR_SIZE_MASK
;
5534 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5536 if (i
!= COMPILED_CONSTANTS
)
5537 mark_object (ptr
->contents
[i
]);
5539 obj
= ptr
->contents
[COMPILED_CONSTANTS
];
5542 else if (FRAMEP (obj
))
5544 register struct frame
*ptr
= XFRAME (obj
);
5545 if (mark_vectorlike (XVECTOR (obj
)))
5547 mark_face_cache (ptr
->face_cache
);
5548 #ifdef HAVE_WINDOW_SYSTEM
5549 mark_image_cache (ptr
);
5550 #endif /* HAVE_WINDOW_SYSTEM */
5553 else if (WINDOWP (obj
))
5555 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5556 struct window
*w
= XWINDOW (obj
);
5557 if (mark_vectorlike (ptr
))
5559 /* Mark glyphs for leaf windows. Marking window matrices is
5560 sufficient because frame matrices use the same glyph
5562 if (NILP (w
->hchild
)
5564 && w
->current_matrix
)
5566 mark_glyph_matrix (w
->current_matrix
);
5567 mark_glyph_matrix (w
->desired_matrix
);
5571 else if (HASH_TABLE_P (obj
))
5573 struct Lisp_Hash_Table
*h
= XHASH_TABLE (obj
);
5574 if (mark_vectorlike ((struct Lisp_Vector
*)h
))
5575 { /* If hash table is not weak, mark all keys and values.
5576 For weak tables, mark only the vector. */
5578 mark_object (h
->key_and_value
);
5580 VECTOR_MARK (XVECTOR (h
->key_and_value
));
5584 mark_vectorlike (XVECTOR (obj
));
5589 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
5590 struct Lisp_Symbol
*ptrx
;
5592 if (ptr
->gcmarkbit
) break;
5593 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
5595 mark_object (ptr
->value
);
5596 mark_object (ptr
->function
);
5597 mark_object (ptr
->plist
);
5599 if (!PURE_POINTER_P (XSTRING (ptr
->xname
)))
5600 MARK_STRING (XSTRING (ptr
->xname
));
5601 MARK_INTERVAL_TREE (STRING_INTERVALS (ptr
->xname
));
5603 /* Note that we do not mark the obarray of the symbol.
5604 It is safe not to do so because nothing accesses that
5605 slot except to check whether it is nil. */
5609 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun */
5610 XSETSYMBOL (obj
, ptrx
);
5617 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
5618 if (XMISCANY (obj
)->gcmarkbit
)
5620 XMISCANY (obj
)->gcmarkbit
= 1;
5622 switch (XMISCTYPE (obj
))
5624 case Lisp_Misc_Buffer_Local_Value
:
5626 register struct Lisp_Buffer_Local_Value
*ptr
5627 = XBUFFER_LOCAL_VALUE (obj
);
5628 /* If the cdr is nil, avoid recursion for the car. */
5629 if (EQ (ptr
->cdr
, Qnil
))
5631 obj
= ptr
->realvalue
;
5634 mark_object (ptr
->realvalue
);
5635 mark_object (ptr
->buffer
);
5636 mark_object (ptr
->frame
);
5641 case Lisp_Misc_Marker
:
5642 /* DO NOT mark thru the marker's chain.
5643 The buffer's markers chain does not preserve markers from gc;
5644 instead, markers are removed from the chain when freed by gc. */
5647 case Lisp_Misc_Intfwd
:
5648 case Lisp_Misc_Boolfwd
:
5649 case Lisp_Misc_Objfwd
:
5650 case Lisp_Misc_Buffer_Objfwd
:
5651 case Lisp_Misc_Kboard_Objfwd
:
5652 /* Don't bother with Lisp_Buffer_Objfwd,
5653 since all markable slots in current buffer marked anyway. */
5654 /* Don't need to do Lisp_Objfwd, since the places they point
5655 are protected with staticpro. */
5658 case Lisp_Misc_Save_Value
:
5661 register struct Lisp_Save_Value
*ptr
= XSAVE_VALUE (obj
);
5662 /* If DOGC is set, POINTER is the address of a memory
5663 area containing INTEGER potential Lisp_Objects. */
5666 Lisp_Object
*p
= (Lisp_Object
*) ptr
->pointer
;
5668 for (nelt
= ptr
->integer
; nelt
> 0; nelt
--, p
++)
5669 mark_maybe_object (*p
);
5675 case Lisp_Misc_Overlay
:
5677 struct Lisp_Overlay
*ptr
= XOVERLAY (obj
);
5678 mark_object (ptr
->start
);
5679 mark_object (ptr
->end
);
5680 mark_object (ptr
->plist
);
5683 XSETMISC (obj
, ptr
->next
);
5696 register struct Lisp_Cons
*ptr
= XCONS (obj
);
5697 if (CONS_MARKED_P (ptr
)) break;
5698 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
5700 /* If the cdr is nil, avoid recursion for the car. */
5701 if (EQ (ptr
->u
.cdr
, Qnil
))
5707 mark_object (ptr
->car
);
5710 if (cdr_count
== mark_object_loop_halt
)
5716 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
5717 FLOAT_MARK (XFLOAT (obj
));
5728 #undef CHECK_ALLOCATED
5729 #undef CHECK_ALLOCATED_AND_LIVE
5732 /* Mark the pointers in a buffer structure. */
5738 register struct buffer
*buffer
= XBUFFER (buf
);
5739 register Lisp_Object
*ptr
, tmp
;
5740 Lisp_Object base_buffer
;
5742 VECTOR_MARK (buffer
);
5744 MARK_INTERVAL_TREE (BUF_INTERVALS (buffer
));
5746 /* For now, we just don't mark the undo_list. It's done later in
5747 a special way just before the sweep phase, and after stripping
5748 some of its elements that are not needed any more. */
5750 if (buffer
->overlays_before
)
5752 XSETMISC (tmp
, buffer
->overlays_before
);
5755 if (buffer
->overlays_after
)
5757 XSETMISC (tmp
, buffer
->overlays_after
);
5761 for (ptr
= &buffer
->name
;
5762 (char *)ptr
< (char *)buffer
+ sizeof (struct buffer
);
5766 /* If this is an indirect buffer, mark its base buffer. */
5767 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
5769 XSETBUFFER (base_buffer
, buffer
->base_buffer
);
5770 mark_buffer (base_buffer
);
5774 /* Mark the Lisp pointers in the terminal objects.
5775 Called by the Fgarbage_collector. */
5778 mark_terminals (void)
5781 for (t
= terminal_list
; t
; t
= t
->next_terminal
)
5783 eassert (t
->name
!= NULL
);
5784 mark_vectorlike ((struct Lisp_Vector
*)t
);
5790 /* Value is non-zero if OBJ will survive the current GC because it's
5791 either marked or does not need to be marked to survive. */
5799 switch (XTYPE (obj
))
5806 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
5810 survives_p
= XMISCANY (obj
)->gcmarkbit
;
5814 survives_p
= STRING_MARKED_P (XSTRING (obj
));
5817 case Lisp_Vectorlike
:
5818 survives_p
= SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
5822 survives_p
= CONS_MARKED_P (XCONS (obj
));
5826 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
5833 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
5838 /* Sweep: find all structures not marked, and free them. */
5843 /* Remove or mark entries in weak hash tables.
5844 This must be done before any object is unmarked. */
5845 sweep_weak_hash_tables ();
5848 #ifdef GC_CHECK_STRING_BYTES
5849 if (!noninteractive
)
5850 check_string_bytes (1);
5853 /* Put all unmarked conses on free list */
5855 register struct cons_block
*cblk
;
5856 struct cons_block
**cprev
= &cons_block
;
5857 register int lim
= cons_block_index
;
5858 register int num_free
= 0, num_used
= 0;
5862 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
5866 int ilim
= (lim
+ BITS_PER_INT
- 1) / BITS_PER_INT
;
5868 /* Scan the mark bits an int at a time. */
5869 for (i
= 0; i
<= ilim
; i
++)
5871 if (cblk
->gcmarkbits
[i
] == -1)
5873 /* Fast path - all cons cells for this int are marked. */
5874 cblk
->gcmarkbits
[i
] = 0;
5875 num_used
+= BITS_PER_INT
;
5879 /* Some cons cells for this int are not marked.
5880 Find which ones, and free them. */
5881 int start
, pos
, stop
;
5883 start
= i
* BITS_PER_INT
;
5885 if (stop
> BITS_PER_INT
)
5886 stop
= BITS_PER_INT
;
5889 for (pos
= start
; pos
< stop
; pos
++)
5891 if (!CONS_MARKED_P (&cblk
->conses
[pos
]))
5894 cblk
->conses
[pos
].u
.chain
= cons_free_list
;
5895 cons_free_list
= &cblk
->conses
[pos
];
5897 cons_free_list
->car
= Vdead
;
5903 CONS_UNMARK (&cblk
->conses
[pos
]);
5909 lim
= CONS_BLOCK_SIZE
;
5910 /* If this block contains only free conses and we have already
5911 seen more than two blocks worth of free conses then deallocate
5913 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
5915 *cprev
= cblk
->next
;
5916 /* Unhook from the free list. */
5917 cons_free_list
= cblk
->conses
[0].u
.chain
;
5918 lisp_align_free (cblk
);
5923 num_free
+= this_free
;
5924 cprev
= &cblk
->next
;
5927 total_conses
= num_used
;
5928 total_free_conses
= num_free
;
5931 /* Put all unmarked floats on free list */
5933 register struct float_block
*fblk
;
5934 struct float_block
**fprev
= &float_block
;
5935 register int lim
= float_block_index
;
5936 register int num_free
= 0, num_used
= 0;
5938 float_free_list
= 0;
5940 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
5944 for (i
= 0; i
< lim
; i
++)
5945 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
5948 fblk
->floats
[i
].u
.chain
= float_free_list
;
5949 float_free_list
= &fblk
->floats
[i
];
5954 FLOAT_UNMARK (&fblk
->floats
[i
]);
5956 lim
= FLOAT_BLOCK_SIZE
;
5957 /* If this block contains only free floats and we have already
5958 seen more than two blocks worth of free floats then deallocate
5960 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
5962 *fprev
= fblk
->next
;
5963 /* Unhook from the free list. */
5964 float_free_list
= fblk
->floats
[0].u
.chain
;
5965 lisp_align_free (fblk
);
5970 num_free
+= this_free
;
5971 fprev
= &fblk
->next
;
5974 total_floats
= num_used
;
5975 total_free_floats
= num_free
;
5978 /* Put all unmarked intervals on free list */
5980 register struct interval_block
*iblk
;
5981 struct interval_block
**iprev
= &interval_block
;
5982 register int lim
= interval_block_index
;
5983 register int num_free
= 0, num_used
= 0;
5985 interval_free_list
= 0;
5987 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
5992 for (i
= 0; i
< lim
; i
++)
5994 if (!iblk
->intervals
[i
].gcmarkbit
)
5996 SET_INTERVAL_PARENT (&iblk
->intervals
[i
], interval_free_list
);
5997 interval_free_list
= &iblk
->intervals
[i
];
6003 iblk
->intervals
[i
].gcmarkbit
= 0;
6006 lim
= INTERVAL_BLOCK_SIZE
;
6007 /* If this block contains only free intervals and we have already
6008 seen more than two blocks worth of free intervals then
6009 deallocate this block. */
6010 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
6012 *iprev
= iblk
->next
;
6013 /* Unhook from the free list. */
6014 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
6016 n_interval_blocks
--;
6020 num_free
+= this_free
;
6021 iprev
= &iblk
->next
;
6024 total_intervals
= num_used
;
6025 total_free_intervals
= num_free
;
6028 /* Put all unmarked symbols on free list */
6030 register struct symbol_block
*sblk
;
6031 struct symbol_block
**sprev
= &symbol_block
;
6032 register int lim
= symbol_block_index
;
6033 register int num_free
= 0, num_used
= 0;
6035 symbol_free_list
= NULL
;
6037 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
6040 struct Lisp_Symbol
*sym
= sblk
->symbols
;
6041 struct Lisp_Symbol
*end
= sym
+ lim
;
6043 for (; sym
< end
; ++sym
)
6045 /* Check if the symbol was created during loadup. In such a case
6046 it might be pointed to by pure bytecode which we don't trace,
6047 so we conservatively assume that it is live. */
6048 int pure_p
= PURE_POINTER_P (XSTRING (sym
->xname
));
6050 if (!sym
->gcmarkbit
&& !pure_p
)
6052 sym
->next
= symbol_free_list
;
6053 symbol_free_list
= sym
;
6055 symbol_free_list
->function
= Vdead
;
6063 UNMARK_STRING (XSTRING (sym
->xname
));
6068 lim
= SYMBOL_BLOCK_SIZE
;
6069 /* If this block contains only free symbols and we have already
6070 seen more than two blocks worth of free symbols then deallocate
6072 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
6074 *sprev
= sblk
->next
;
6075 /* Unhook from the free list. */
6076 symbol_free_list
= sblk
->symbols
[0].next
;
6082 num_free
+= this_free
;
6083 sprev
= &sblk
->next
;
6086 total_symbols
= num_used
;
6087 total_free_symbols
= num_free
;
6090 /* Put all unmarked misc's on free list.
6091 For a marker, first unchain it from the buffer it points into. */
6093 register struct marker_block
*mblk
;
6094 struct marker_block
**mprev
= &marker_block
;
6095 register int lim
= marker_block_index
;
6096 register int num_free
= 0, num_used
= 0;
6098 marker_free_list
= 0;
6100 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
6105 for (i
= 0; i
< lim
; i
++)
6107 if (!mblk
->markers
[i
].u_any
.gcmarkbit
)
6109 if (mblk
->markers
[i
].u_any
.type
== Lisp_Misc_Marker
)
6110 unchain_marker (&mblk
->markers
[i
].u_marker
);
6111 /* Set the type of the freed object to Lisp_Misc_Free.
6112 We could leave the type alone, since nobody checks it,
6113 but this might catch bugs faster. */
6114 mblk
->markers
[i
].u_marker
.type
= Lisp_Misc_Free
;
6115 mblk
->markers
[i
].u_free
.chain
= marker_free_list
;
6116 marker_free_list
= &mblk
->markers
[i
];
6122 mblk
->markers
[i
].u_any
.gcmarkbit
= 0;
6125 lim
= MARKER_BLOCK_SIZE
;
6126 /* If this block contains only free markers and we have already
6127 seen more than two blocks worth of free markers then deallocate
6129 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
6131 *mprev
= mblk
->next
;
6132 /* Unhook from the free list. */
6133 marker_free_list
= mblk
->markers
[0].u_free
.chain
;
6139 num_free
+= this_free
;
6140 mprev
= &mblk
->next
;
6144 total_markers
= num_used
;
6145 total_free_markers
= num_free
;
6148 /* Free all unmarked buffers */
6150 register struct buffer
*buffer
= all_buffers
, *prev
= 0, *next
;
6153 if (!VECTOR_MARKED_P (buffer
))
6156 prev
->next
= buffer
->next
;
6158 all_buffers
= buffer
->next
;
6159 next
= buffer
->next
;
6165 VECTOR_UNMARK (buffer
);
6166 UNMARK_BALANCE_INTERVALS (BUF_INTERVALS (buffer
));
6167 prev
= buffer
, buffer
= buffer
->next
;
6171 /* Free all unmarked vectors */
6173 register struct Lisp_Vector
*vector
= all_vectors
, *prev
= 0, *next
;
6174 total_vector_size
= 0;
6177 if (!VECTOR_MARKED_P (vector
))
6180 prev
->next
= vector
->next
;
6182 all_vectors
= vector
->next
;
6183 next
= vector
->next
;
6191 VECTOR_UNMARK (vector
);
6192 if (vector
->size
& PSEUDOVECTOR_FLAG
)
6193 total_vector_size
+= (PSEUDOVECTOR_SIZE_MASK
& vector
->size
);
6195 total_vector_size
+= vector
->size
;
6196 prev
= vector
, vector
= vector
->next
;
6200 #ifdef GC_CHECK_STRING_BYTES
6201 if (!noninteractive
)
6202 check_string_bytes (1);
6209 /* Debugging aids. */
6211 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
6212 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
6213 This may be helpful in debugging Emacs's memory usage.
6214 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
6219 XSETINT (end
, (EMACS_INT
) sbrk (0) / 1024);
6224 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
6225 doc
: /* Return a list of counters that measure how much consing there has been.
6226 Each of these counters increments for a certain kind of object.
6227 The counters wrap around from the largest positive integer to zero.
6228 Garbage collection does not decrease them.
6229 The elements of the value are as follows:
6230 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
6231 All are in units of 1 = one object consed
6232 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
6234 MISCS include overlays, markers, and some internal types.
6235 Frames, windows, buffers, and subprocesses count as vectors
6236 (but the contents of a buffer's text do not count here). */)
6239 Lisp_Object consed
[8];
6241 consed
[0] = make_number (min (MOST_POSITIVE_FIXNUM
, cons_cells_consed
));
6242 consed
[1] = make_number (min (MOST_POSITIVE_FIXNUM
, floats_consed
));
6243 consed
[2] = make_number (min (MOST_POSITIVE_FIXNUM
, vector_cells_consed
));
6244 consed
[3] = make_number (min (MOST_POSITIVE_FIXNUM
, symbols_consed
));
6245 consed
[4] = make_number (min (MOST_POSITIVE_FIXNUM
, string_chars_consed
));
6246 consed
[5] = make_number (min (MOST_POSITIVE_FIXNUM
, misc_objects_consed
));
6247 consed
[6] = make_number (min (MOST_POSITIVE_FIXNUM
, intervals_consed
));
6248 consed
[7] = make_number (min (MOST_POSITIVE_FIXNUM
, strings_consed
));
6250 return Flist (8, consed
);
6253 int suppress_checking
;
6255 die (msg
, file
, line
)
6260 fprintf (stderr
, "\r\n%s:%d: Emacs fatal error: %s\r\n",
6265 /* Initialization */
6270 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
6272 pure_size
= PURESIZE
;
6273 pure_bytes_used
= 0;
6274 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
6275 pure_bytes_used_before_overflow
= 0;
6277 /* Initialize the list of free aligned blocks. */
6280 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
6282 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
6286 ignore_warnings
= 1;
6287 #ifdef DOUG_LEA_MALLOC
6288 mallopt (M_TRIM_THRESHOLD
, 128*1024); /* trim threshold */
6289 mallopt (M_MMAP_THRESHOLD
, 64*1024); /* mmap threshold */
6290 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* max. number of mmap'ed areas */
6300 malloc_hysteresis
= 32;
6302 malloc_hysteresis
= 0;
6305 refill_memory_reserve ();
6307 ignore_warnings
= 0;
6309 byte_stack_list
= 0;
6311 consing_since_gc
= 0;
6312 gc_cons_threshold
= 100000 * sizeof (Lisp_Object
);
6313 gc_relative_threshold
= 0;
6315 #ifdef VIRT_ADDR_VARIES
6316 malloc_sbrk_unused
= 1<<22; /* A large number */
6317 malloc_sbrk_used
= 100000; /* as reasonable as any number */
6318 #endif /* VIRT_ADDR_VARIES */
6325 byte_stack_list
= 0;
6327 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
6328 setjmp_tested_p
= longjmps_done
= 0;
6331 Vgc_elapsed
= make_float (0.0);
6338 DEFVAR_INT ("gc-cons-threshold", &gc_cons_threshold
,
6339 doc
: /* *Number of bytes of consing between garbage collections.
6340 Garbage collection can happen automatically once this many bytes have been
6341 allocated since the last garbage collection. All data types count.
6343 Garbage collection happens automatically only when `eval' is called.
6345 By binding this temporarily to a large number, you can effectively
6346 prevent garbage collection during a part of the program.
6347 See also `gc-cons-percentage'. */);
6349 DEFVAR_LISP ("gc-cons-percentage", &Vgc_cons_percentage
,
6350 doc
: /* *Portion of the heap used for allocation.
6351 Garbage collection can happen automatically once this portion of the heap
6352 has been allocated since the last garbage collection.
6353 If this portion is smaller than `gc-cons-threshold', this is ignored. */);
6354 Vgc_cons_percentage
= make_float (0.1);
6356 DEFVAR_INT ("pure-bytes-used", &pure_bytes_used
,
6357 doc
: /* Number of bytes of sharable Lisp data allocated so far. */);
6359 DEFVAR_INT ("cons-cells-consed", &cons_cells_consed
,
6360 doc
: /* Number of cons cells that have been consed so far. */);
6362 DEFVAR_INT ("floats-consed", &floats_consed
,
6363 doc
: /* Number of floats that have been consed so far. */);
6365 DEFVAR_INT ("vector-cells-consed", &vector_cells_consed
,
6366 doc
: /* Number of vector cells that have been consed so far. */);
6368 DEFVAR_INT ("symbols-consed", &symbols_consed
,
6369 doc
: /* Number of symbols that have been consed so far. */);
6371 DEFVAR_INT ("string-chars-consed", &string_chars_consed
,
6372 doc
: /* Number of string characters that have been consed so far. */);
6374 DEFVAR_INT ("misc-objects-consed", &misc_objects_consed
,
6375 doc
: /* Number of miscellaneous objects that have been consed so far. */);
6377 DEFVAR_INT ("intervals-consed", &intervals_consed
,
6378 doc
: /* Number of intervals that have been consed so far. */);
6380 DEFVAR_INT ("strings-consed", &strings_consed
,
6381 doc
: /* Number of strings that have been consed so far. */);
6383 DEFVAR_LISP ("purify-flag", &Vpurify_flag
,
6384 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
6385 This means that certain objects should be allocated in shared (pure) space. */);
6387 DEFVAR_BOOL ("garbage-collection-messages", &garbage_collection_messages
,
6388 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
6389 garbage_collection_messages
= 0;
6391 DEFVAR_LISP ("post-gc-hook", &Vpost_gc_hook
,
6392 doc
: /* Hook run after garbage collection has finished. */);
6393 Vpost_gc_hook
= Qnil
;
6394 Qpost_gc_hook
= intern ("post-gc-hook");
6395 staticpro (&Qpost_gc_hook
);
6397 DEFVAR_LISP ("memory-signal-data", &Vmemory_signal_data
,
6398 doc
: /* Precomputed `signal' argument for memory-full error. */);
6399 /* We build this in advance because if we wait until we need it, we might
6400 not be able to allocate the memory to hold it. */
6403 build_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"));
6405 DEFVAR_LISP ("memory-full", &Vmemory_full
,
6406 doc
: /* Non-nil means Emacs cannot get much more Lisp memory. */);
6407 Vmemory_full
= Qnil
;
6409 staticpro (&Qgc_cons_threshold
);
6410 Qgc_cons_threshold
= intern ("gc-cons-threshold");
6412 staticpro (&Qchar_table_extra_slots
);
6413 Qchar_table_extra_slots
= intern ("char-table-extra-slots");
6415 DEFVAR_LISP ("gc-elapsed", &Vgc_elapsed
,
6416 doc
: /* Accumulated time elapsed in garbage collections.
6417 The time is in seconds as a floating point value. */);
6418 DEFVAR_INT ("gcs-done", &gcs_done
,
6419 doc
: /* Accumulated number of garbage collections done. */);
6424 defsubr (&Smake_byte_code
);
6425 defsubr (&Smake_list
);
6426 defsubr (&Smake_vector
);
6427 defsubr (&Smake_string
);
6428 defsubr (&Smake_bool_vector
);
6429 defsubr (&Smake_symbol
);
6430 defsubr (&Smake_marker
);
6431 defsubr (&Spurecopy
);
6432 defsubr (&Sgarbage_collect
);
6433 defsubr (&Smemory_limit
);
6434 defsubr (&Smemory_use_counts
);
6436 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
6437 defsubr (&Sgc_status
);
6441 /* arch-tag: 6695ca10-e3c5-4c2c-8bc3-ed26a7dda857
6442 (do not change this comment) */