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 static 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. */
327 static char *stack_copy
;
328 static int stack_copy_size
;
330 /* Non-zero means ignore malloc warnings. Set during initialization.
331 Currently not used. */
333 static int ignore_warnings
;
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). */
400 static Lisp_Object Vdead
;
402 #ifdef GC_MALLOC_CHECK
404 enum mem_type allocated_mem_type
;
405 static 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 static Lisp_Object
*staticvec
[NSTATICS
] = {&Vpurify_flag
};
508 /* Index of next unused slot in staticvec. */
510 static int staticidx
= 0;
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 static 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 static 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 static void check_string_bytes
P_ ((int));
1777 static 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. */
2704 static int n_cons_blocks
;
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 static struct Lisp_Vector
*all_vectors
;
2908 /* Total number of vector-like objects now in use. */
2910 static int n_vectors
;
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 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. */
2987 struct Lisp_Hash_Table
*
2988 allocate_hash_table (void)
2990 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Hash_Table
, count
, PVEC_HASH_TABLE
);
2997 return ALLOCATE_PSEUDOVECTOR(struct window
, current_matrix
, PVEC_WINDOW
);
3002 allocate_terminal ()
3004 struct terminal
*t
= ALLOCATE_PSEUDOVECTOR (struct terminal
,
3005 next_terminal
, PVEC_TERMINAL
);
3006 /* Zero out the non-GC'd fields. FIXME: This should be made unnecessary. */
3007 bzero (&(t
->next_terminal
),
3008 ((char*)(t
+1)) - ((char*)&(t
->next_terminal
)));
3016 struct frame
*f
= ALLOCATE_PSEUDOVECTOR (struct frame
,
3017 face_cache
, PVEC_FRAME
);
3018 /* Zero out the non-GC'd fields. FIXME: This should be made unnecessary. */
3019 bzero (&(f
->face_cache
),
3020 ((char*)(f
+1)) - ((char*)&(f
->face_cache
)));
3025 struct Lisp_Process
*
3028 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Process
, pid
, PVEC_PROCESS
);
3032 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
3033 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
3034 See also the function `vector'. */)
3036 register Lisp_Object length
, init
;
3039 register EMACS_INT sizei
;
3041 register struct Lisp_Vector
*p
;
3043 CHECK_NATNUM (length
);
3044 sizei
= XFASTINT (length
);
3046 p
= allocate_vector (sizei
);
3047 for (index
= 0; index
< sizei
; index
++)
3048 p
->contents
[index
] = init
;
3050 XSETVECTOR (vector
, p
);
3055 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
3056 doc
: /* Return a newly created vector with specified arguments as elements.
3057 Any number of arguments, even zero arguments, are allowed.
3058 usage: (vector &rest OBJECTS) */)
3063 register Lisp_Object len
, val
;
3065 register struct Lisp_Vector
*p
;
3067 XSETFASTINT (len
, nargs
);
3068 val
= Fmake_vector (len
, Qnil
);
3070 for (index
= 0; index
< nargs
; index
++)
3071 p
->contents
[index
] = args
[index
];
3076 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
3077 doc
: /* Create a byte-code object with specified arguments as elements.
3078 The arguments should be the arglist, bytecode-string, constant vector,
3079 stack size, (optional) doc string, and (optional) interactive spec.
3080 The first four arguments are required; at most six have any
3082 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
3087 register Lisp_Object len
, val
;
3089 register struct Lisp_Vector
*p
;
3091 XSETFASTINT (len
, nargs
);
3092 if (!NILP (Vpurify_flag
))
3093 val
= make_pure_vector ((EMACS_INT
) nargs
);
3095 val
= Fmake_vector (len
, Qnil
);
3097 if (STRINGP (args
[1]) && STRING_MULTIBYTE (args
[1]))
3098 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
3099 earlier because they produced a raw 8-bit string for byte-code
3100 and now such a byte-code string is loaded as multibyte while
3101 raw 8-bit characters converted to multibyte form. Thus, now we
3102 must convert them back to the original unibyte form. */
3103 args
[1] = Fstring_as_unibyte (args
[1]);
3106 for (index
= 0; index
< nargs
; index
++)
3108 if (!NILP (Vpurify_flag
))
3109 args
[index
] = Fpurecopy (args
[index
]);
3110 p
->contents
[index
] = args
[index
];
3112 XSETPVECTYPE (p
, PVEC_COMPILED
);
3113 XSETCOMPILED (val
, p
);
3119 /***********************************************************************
3121 ***********************************************************************/
3123 /* Each symbol_block is just under 1020 bytes long, since malloc
3124 really allocates in units of powers of two and uses 4 bytes for its
3127 #define SYMBOL_BLOCK_SIZE \
3128 ((1020 - sizeof (struct symbol_block *)) / sizeof (struct Lisp_Symbol))
3132 /* Place `symbols' first, to preserve alignment. */
3133 struct Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
3134 struct symbol_block
*next
;
3137 /* Current symbol block and index of first unused Lisp_Symbol
3140 static struct symbol_block
*symbol_block
;
3141 static int symbol_block_index
;
3143 /* List of free symbols. */
3145 static struct Lisp_Symbol
*symbol_free_list
;
3147 /* Total number of symbol blocks now in use. */
3149 static int n_symbol_blocks
;
3152 /* Initialize symbol allocation. */
3157 symbol_block
= NULL
;
3158 symbol_block_index
= SYMBOL_BLOCK_SIZE
;
3159 symbol_free_list
= 0;
3160 n_symbol_blocks
= 0;
3164 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
3165 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
3166 Its value and function definition are void, and its property list is nil. */)
3170 register Lisp_Object val
;
3171 register struct Lisp_Symbol
*p
;
3173 CHECK_STRING (name
);
3175 /* eassert (!handling_signal); */
3179 if (symbol_free_list
)
3181 XSETSYMBOL (val
, symbol_free_list
);
3182 symbol_free_list
= symbol_free_list
->next
;
3186 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
3188 struct symbol_block
*new;
3189 new = (struct symbol_block
*) lisp_malloc (sizeof *new,
3191 new->next
= symbol_block
;
3193 symbol_block_index
= 0;
3196 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
]);
3197 symbol_block_index
++;
3200 MALLOC_UNBLOCK_INPUT
;
3205 p
->value
= Qunbound
;
3206 p
->function
= Qunbound
;
3209 p
->interned
= SYMBOL_UNINTERNED
;
3211 p
->indirect_variable
= 0;
3212 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
3219 /***********************************************************************
3220 Marker (Misc) Allocation
3221 ***********************************************************************/
3223 /* Allocation of markers and other objects that share that structure.
3224 Works like allocation of conses. */
3226 #define MARKER_BLOCK_SIZE \
3227 ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc))
3231 /* Place `markers' first, to preserve alignment. */
3232 union Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
3233 struct marker_block
*next
;
3236 static struct marker_block
*marker_block
;
3237 static int marker_block_index
;
3239 static union Lisp_Misc
*marker_free_list
;
3241 /* Total number of marker blocks now in use. */
3243 static int n_marker_blocks
;
3248 marker_block
= NULL
;
3249 marker_block_index
= MARKER_BLOCK_SIZE
;
3250 marker_free_list
= 0;
3251 n_marker_blocks
= 0;
3254 /* Return a newly allocated Lisp_Misc object, with no substructure. */
3261 /* eassert (!handling_signal); */
3265 if (marker_free_list
)
3267 XSETMISC (val
, marker_free_list
);
3268 marker_free_list
= marker_free_list
->u_free
.chain
;
3272 if (marker_block_index
== MARKER_BLOCK_SIZE
)
3274 struct marker_block
*new;
3275 new = (struct marker_block
*) lisp_malloc (sizeof *new,
3277 new->next
= marker_block
;
3279 marker_block_index
= 0;
3281 total_free_markers
+= MARKER_BLOCK_SIZE
;
3283 XSETMISC (val
, &marker_block
->markers
[marker_block_index
]);
3284 marker_block_index
++;
3287 MALLOC_UNBLOCK_INPUT
;
3289 --total_free_markers
;
3290 consing_since_gc
+= sizeof (union Lisp_Misc
);
3291 misc_objects_consed
++;
3292 XMISCANY (val
)->gcmarkbit
= 0;
3296 /* Free a Lisp_Misc object */
3302 XMISCTYPE (misc
) = Lisp_Misc_Free
;
3303 XMISC (misc
)->u_free
.chain
= marker_free_list
;
3304 marker_free_list
= XMISC (misc
);
3306 total_free_markers
++;
3309 /* Return a Lisp_Misc_Save_Value object containing POINTER and
3310 INTEGER. This is used to package C values to call record_unwind_protect.
3311 The unwind function can get the C values back using XSAVE_VALUE. */
3314 make_save_value (pointer
, integer
)
3318 register Lisp_Object val
;
3319 register struct Lisp_Save_Value
*p
;
3321 val
= allocate_misc ();
3322 XMISCTYPE (val
) = Lisp_Misc_Save_Value
;
3323 p
= XSAVE_VALUE (val
);
3324 p
->pointer
= pointer
;
3325 p
->integer
= integer
;
3330 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
3331 doc
: /* Return a newly allocated marker which does not point at any place. */)
3334 register Lisp_Object val
;
3335 register struct Lisp_Marker
*p
;
3337 val
= allocate_misc ();
3338 XMISCTYPE (val
) = Lisp_Misc_Marker
;
3344 p
->insertion_type
= 0;
3348 /* Put MARKER back on the free list after using it temporarily. */
3351 free_marker (marker
)
3354 unchain_marker (XMARKER (marker
));
3359 /* Return a newly created vector or string with specified arguments as
3360 elements. If all the arguments are characters that can fit
3361 in a string of events, make a string; otherwise, make a vector.
3363 Any number of arguments, even zero arguments, are allowed. */
3366 make_event_array (nargs
, args
)
3372 for (i
= 0; i
< nargs
; i
++)
3373 /* The things that fit in a string
3374 are characters that are in 0...127,
3375 after discarding the meta bit and all the bits above it. */
3376 if (!INTEGERP (args
[i
])
3377 || (XUINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
3378 return Fvector (nargs
, args
);
3380 /* Since the loop exited, we know that all the things in it are
3381 characters, so we can make a string. */
3385 result
= Fmake_string (make_number (nargs
), make_number (0));
3386 for (i
= 0; i
< nargs
; i
++)
3388 SSET (result
, i
, XINT (args
[i
]));
3389 /* Move the meta bit to the right place for a string char. */
3390 if (XINT (args
[i
]) & CHAR_META
)
3391 SSET (result
, i
, SREF (result
, i
) | 0x80);
3400 /************************************************************************
3401 Memory Full Handling
3402 ************************************************************************/
3405 /* Called if malloc returns zero. */
3414 memory_full_cons_threshold
= sizeof (struct cons_block
);
3416 /* The first time we get here, free the spare memory. */
3417 for (i
= 0; i
< sizeof (spare_memory
) / sizeof (char *); i
++)
3418 if (spare_memory
[i
])
3421 free (spare_memory
[i
]);
3422 else if (i
>= 1 && i
<= 4)
3423 lisp_align_free (spare_memory
[i
]);
3425 lisp_free (spare_memory
[i
]);
3426 spare_memory
[i
] = 0;
3429 /* Record the space now used. When it decreases substantially,
3430 we can refill the memory reserve. */
3431 #ifndef SYSTEM_MALLOC
3432 bytes_used_when_full
= BYTES_USED
;
3435 /* This used to call error, but if we've run out of memory, we could
3436 get infinite recursion trying to build the string. */
3437 xsignal (Qnil
, Vmemory_signal_data
);
3440 /* If we released our reserve (due to running out of memory),
3441 and we have a fair amount free once again,
3442 try to set aside another reserve in case we run out once more.
3444 This is called when a relocatable block is freed in ralloc.c,
3445 and also directly from this file, in case we're not using ralloc.c. */
3448 refill_memory_reserve ()
3450 #ifndef SYSTEM_MALLOC
3451 if (spare_memory
[0] == 0)
3452 spare_memory
[0] = (char *) malloc ((size_t) SPARE_MEMORY
);
3453 if (spare_memory
[1] == 0)
3454 spare_memory
[1] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3456 if (spare_memory
[2] == 0)
3457 spare_memory
[2] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3459 if (spare_memory
[3] == 0)
3460 spare_memory
[3] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3462 if (spare_memory
[4] == 0)
3463 spare_memory
[4] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3465 if (spare_memory
[5] == 0)
3466 spare_memory
[5] = (char *) lisp_malloc (sizeof (struct string_block
),
3468 if (spare_memory
[6] == 0)
3469 spare_memory
[6] = (char *) lisp_malloc (sizeof (struct string_block
),
3471 if (spare_memory
[0] && spare_memory
[1] && spare_memory
[5])
3472 Vmemory_full
= Qnil
;
3476 /************************************************************************
3478 ************************************************************************/
3480 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
3482 /* Conservative C stack marking requires a method to identify possibly
3483 live Lisp objects given a pointer value. We do this by keeping
3484 track of blocks of Lisp data that are allocated in a red-black tree
3485 (see also the comment of mem_node which is the type of nodes in
3486 that tree). Function lisp_malloc adds information for an allocated
3487 block to the red-black tree with calls to mem_insert, and function
3488 lisp_free removes it with mem_delete. Functions live_string_p etc
3489 call mem_find to lookup information about a given pointer in the
3490 tree, and use that to determine if the pointer points to a Lisp
3493 /* Initialize this part of alloc.c. */
3498 mem_z
.left
= mem_z
.right
= MEM_NIL
;
3499 mem_z
.parent
= NULL
;
3500 mem_z
.color
= MEM_BLACK
;
3501 mem_z
.start
= mem_z
.end
= NULL
;
3506 /* Value is a pointer to the mem_node containing START. Value is
3507 MEM_NIL if there is no node in the tree containing START. */
3509 static INLINE
struct mem_node
*
3515 if (start
< min_heap_address
|| start
> max_heap_address
)
3518 /* Make the search always successful to speed up the loop below. */
3519 mem_z
.start
= start
;
3520 mem_z
.end
= (char *) start
+ 1;
3523 while (start
< p
->start
|| start
>= p
->end
)
3524 p
= start
< p
->start
? p
->left
: p
->right
;
3529 /* Insert a new node into the tree for a block of memory with start
3530 address START, end address END, and type TYPE. Value is a
3531 pointer to the node that was inserted. */
3533 static struct mem_node
*
3534 mem_insert (start
, end
, type
)
3538 struct mem_node
*c
, *parent
, *x
;
3540 if (min_heap_address
== NULL
|| start
< min_heap_address
)
3541 min_heap_address
= start
;
3542 if (max_heap_address
== NULL
|| end
> max_heap_address
)
3543 max_heap_address
= end
;
3545 /* See where in the tree a node for START belongs. In this
3546 particular application, it shouldn't happen that a node is already
3547 present. For debugging purposes, let's check that. */
3551 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3553 while (c
!= MEM_NIL
)
3555 if (start
>= c
->start
&& start
< c
->end
)
3558 c
= start
< c
->start
? c
->left
: c
->right
;
3561 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3563 while (c
!= MEM_NIL
)
3566 c
= start
< c
->start
? c
->left
: c
->right
;
3569 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3571 /* Create a new node. */
3572 #ifdef GC_MALLOC_CHECK
3573 x
= (struct mem_node
*) _malloc_internal (sizeof *x
);
3577 x
= (struct mem_node
*) xmalloc (sizeof *x
);
3583 x
->left
= x
->right
= MEM_NIL
;
3586 /* Insert it as child of PARENT or install it as root. */
3589 if (start
< parent
->start
)
3597 /* Re-establish red-black tree properties. */
3598 mem_insert_fixup (x
);
3604 /* Re-establish the red-black properties of the tree, and thereby
3605 balance the tree, after node X has been inserted; X is always red. */
3608 mem_insert_fixup (x
)
3611 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3613 /* X is red and its parent is red. This is a violation of
3614 red-black tree property #3. */
3616 if (x
->parent
== x
->parent
->parent
->left
)
3618 /* We're on the left side of our grandparent, and Y is our
3620 struct mem_node
*y
= x
->parent
->parent
->right
;
3622 if (y
->color
== MEM_RED
)
3624 /* Uncle and parent are red but should be black because
3625 X is red. Change the colors accordingly and proceed
3626 with the grandparent. */
3627 x
->parent
->color
= MEM_BLACK
;
3628 y
->color
= MEM_BLACK
;
3629 x
->parent
->parent
->color
= MEM_RED
;
3630 x
= x
->parent
->parent
;
3634 /* Parent and uncle have different colors; parent is
3635 red, uncle is black. */
3636 if (x
== x
->parent
->right
)
3639 mem_rotate_left (x
);
3642 x
->parent
->color
= MEM_BLACK
;
3643 x
->parent
->parent
->color
= MEM_RED
;
3644 mem_rotate_right (x
->parent
->parent
);
3649 /* This is the symmetrical case of above. */
3650 struct mem_node
*y
= x
->parent
->parent
->left
;
3652 if (y
->color
== MEM_RED
)
3654 x
->parent
->color
= MEM_BLACK
;
3655 y
->color
= MEM_BLACK
;
3656 x
->parent
->parent
->color
= MEM_RED
;
3657 x
= x
->parent
->parent
;
3661 if (x
== x
->parent
->left
)
3664 mem_rotate_right (x
);
3667 x
->parent
->color
= MEM_BLACK
;
3668 x
->parent
->parent
->color
= MEM_RED
;
3669 mem_rotate_left (x
->parent
->parent
);
3674 /* The root may have been changed to red due to the algorithm. Set
3675 it to black so that property #5 is satisfied. */
3676 mem_root
->color
= MEM_BLACK
;
3692 /* Turn y's left sub-tree into x's right sub-tree. */
3695 if (y
->left
!= MEM_NIL
)
3696 y
->left
->parent
= x
;
3698 /* Y's parent was x's parent. */
3700 y
->parent
= x
->parent
;
3702 /* Get the parent to point to y instead of x. */
3705 if (x
== x
->parent
->left
)
3706 x
->parent
->left
= y
;
3708 x
->parent
->right
= y
;
3713 /* Put x on y's left. */
3727 mem_rotate_right (x
)
3730 struct mem_node
*y
= x
->left
;
3733 if (y
->right
!= MEM_NIL
)
3734 y
->right
->parent
= x
;
3737 y
->parent
= x
->parent
;
3740 if (x
== x
->parent
->right
)
3741 x
->parent
->right
= y
;
3743 x
->parent
->left
= y
;
3754 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
3760 struct mem_node
*x
, *y
;
3762 if (!z
|| z
== MEM_NIL
)
3765 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
3770 while (y
->left
!= MEM_NIL
)
3774 if (y
->left
!= MEM_NIL
)
3779 x
->parent
= y
->parent
;
3782 if (y
== y
->parent
->left
)
3783 y
->parent
->left
= x
;
3785 y
->parent
->right
= x
;
3792 z
->start
= y
->start
;
3797 if (y
->color
== MEM_BLACK
)
3798 mem_delete_fixup (x
);
3800 #ifdef GC_MALLOC_CHECK
3808 /* Re-establish the red-black properties of the tree, after a
3812 mem_delete_fixup (x
)
3815 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
3817 if (x
== x
->parent
->left
)
3819 struct mem_node
*w
= x
->parent
->right
;
3821 if (w
->color
== MEM_RED
)
3823 w
->color
= MEM_BLACK
;
3824 x
->parent
->color
= MEM_RED
;
3825 mem_rotate_left (x
->parent
);
3826 w
= x
->parent
->right
;
3829 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
3836 if (w
->right
->color
== MEM_BLACK
)
3838 w
->left
->color
= MEM_BLACK
;
3840 mem_rotate_right (w
);
3841 w
= x
->parent
->right
;
3843 w
->color
= x
->parent
->color
;
3844 x
->parent
->color
= MEM_BLACK
;
3845 w
->right
->color
= MEM_BLACK
;
3846 mem_rotate_left (x
->parent
);
3852 struct mem_node
*w
= x
->parent
->left
;
3854 if (w
->color
== MEM_RED
)
3856 w
->color
= MEM_BLACK
;
3857 x
->parent
->color
= MEM_RED
;
3858 mem_rotate_right (x
->parent
);
3859 w
= x
->parent
->left
;
3862 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
3869 if (w
->left
->color
== MEM_BLACK
)
3871 w
->right
->color
= MEM_BLACK
;
3873 mem_rotate_left (w
);
3874 w
= x
->parent
->left
;
3877 w
->color
= x
->parent
->color
;
3878 x
->parent
->color
= MEM_BLACK
;
3879 w
->left
->color
= MEM_BLACK
;
3880 mem_rotate_right (x
->parent
);
3886 x
->color
= MEM_BLACK
;
3890 /* Value is non-zero if P is a pointer to a live Lisp string on
3891 the heap. M is a pointer to the mem_block for P. */
3894 live_string_p (m
, p
)
3898 if (m
->type
== MEM_TYPE_STRING
)
3900 struct string_block
*b
= (struct string_block
*) m
->start
;
3901 int offset
= (char *) p
- (char *) &b
->strings
[0];
3903 /* P must point to the start of a Lisp_String structure, and it
3904 must not be on the free-list. */
3906 && offset
% sizeof b
->strings
[0] == 0
3907 && offset
< (STRING_BLOCK_SIZE
* sizeof b
->strings
[0])
3908 && ((struct Lisp_String
*) p
)->data
!= NULL
);
3915 /* Value is non-zero if P is a pointer to a live Lisp cons on
3916 the heap. M is a pointer to the mem_block for P. */
3923 if (m
->type
== MEM_TYPE_CONS
)
3925 struct cons_block
*b
= (struct cons_block
*) m
->start
;
3926 int offset
= (char *) p
- (char *) &b
->conses
[0];
3928 /* P must point to the start of a Lisp_Cons, not be
3929 one of the unused cells in the current cons block,
3930 and not be on the free-list. */
3932 && offset
% sizeof b
->conses
[0] == 0
3933 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
3935 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
3936 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
3943 /* Value is non-zero if P is a pointer to a live Lisp symbol on
3944 the heap. M is a pointer to the mem_block for P. */
3947 live_symbol_p (m
, p
)
3951 if (m
->type
== MEM_TYPE_SYMBOL
)
3953 struct symbol_block
*b
= (struct symbol_block
*) m
->start
;
3954 int offset
= (char *) p
- (char *) &b
->symbols
[0];
3956 /* P must point to the start of a Lisp_Symbol, not be
3957 one of the unused cells in the current symbol block,
3958 and not be on the free-list. */
3960 && offset
% sizeof b
->symbols
[0] == 0
3961 && offset
< (SYMBOL_BLOCK_SIZE
* sizeof b
->symbols
[0])
3962 && (b
!= symbol_block
3963 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
3964 && !EQ (((struct Lisp_Symbol
*) p
)->function
, Vdead
));
3971 /* Value is non-zero if P is a pointer to a live Lisp float on
3972 the heap. M is a pointer to the mem_block for P. */
3979 if (m
->type
== MEM_TYPE_FLOAT
)
3981 struct float_block
*b
= (struct float_block
*) m
->start
;
3982 int offset
= (char *) p
- (char *) &b
->floats
[0];
3984 /* P must point to the start of a Lisp_Float and not be
3985 one of the unused cells in the current float block. */
3987 && offset
% sizeof b
->floats
[0] == 0
3988 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
3989 && (b
!= float_block
3990 || offset
/ sizeof b
->floats
[0] < float_block_index
));
3997 /* Value is non-zero if P is a pointer to a live Lisp Misc on
3998 the heap. M is a pointer to the mem_block for P. */
4005 if (m
->type
== MEM_TYPE_MISC
)
4007 struct marker_block
*b
= (struct marker_block
*) m
->start
;
4008 int offset
= (char *) p
- (char *) &b
->markers
[0];
4010 /* P must point to the start of a Lisp_Misc, not be
4011 one of the unused cells in the current misc block,
4012 and not be on the free-list. */
4014 && offset
% sizeof b
->markers
[0] == 0
4015 && offset
< (MARKER_BLOCK_SIZE
* sizeof b
->markers
[0])
4016 && (b
!= marker_block
4017 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
4018 && ((union Lisp_Misc
*) p
)->u_any
.type
!= Lisp_Misc_Free
);
4025 /* Value is non-zero if P is a pointer to a live vector-like object.
4026 M is a pointer to the mem_block for P. */
4029 live_vector_p (m
, p
)
4033 return (p
== m
->start
&& m
->type
== MEM_TYPE_VECTORLIKE
);
4037 /* Value is non-zero if P is a pointer to a live buffer. M is a
4038 pointer to the mem_block for P. */
4041 live_buffer_p (m
, p
)
4045 /* P must point to the start of the block, and the buffer
4046 must not have been killed. */
4047 return (m
->type
== MEM_TYPE_BUFFER
4049 && !NILP (((struct buffer
*) p
)->name
));
4052 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
4056 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4058 /* Array of objects that are kept alive because the C stack contains
4059 a pattern that looks like a reference to them . */
4061 #define MAX_ZOMBIES 10
4062 static Lisp_Object zombies
[MAX_ZOMBIES
];
4064 /* Number of zombie objects. */
4066 static int nzombies
;
4068 /* Number of garbage collections. */
4072 /* Average percentage of zombies per collection. */
4074 static double avg_zombies
;
4076 /* Max. number of live and zombie objects. */
4078 static int max_live
, max_zombies
;
4080 /* Average number of live objects per GC. */
4082 static double avg_live
;
4084 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
4085 doc
: /* Show information about live and zombie objects. */)
4088 Lisp_Object args
[8], zombie_list
= Qnil
;
4090 for (i
= 0; i
< nzombies
; i
++)
4091 zombie_list
= Fcons (zombies
[i
], zombie_list
);
4092 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
4093 args
[1] = make_number (ngcs
);
4094 args
[2] = make_float (avg_live
);
4095 args
[3] = make_float (avg_zombies
);
4096 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
4097 args
[5] = make_number (max_live
);
4098 args
[6] = make_number (max_zombies
);
4099 args
[7] = zombie_list
;
4100 return Fmessage (8, args
);
4103 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4106 /* Mark OBJ if we can prove it's a Lisp_Object. */
4109 mark_maybe_object (obj
)
4112 void *po
= (void *) XPNTR (obj
);
4113 struct mem_node
*m
= mem_find (po
);
4119 switch (XTYPE (obj
))
4122 mark_p
= (live_string_p (m
, po
)
4123 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
4127 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
4131 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
4135 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
4138 case Lisp_Vectorlike
:
4139 /* Note: can't check BUFFERP before we know it's a
4140 buffer because checking that dereferences the pointer
4141 PO which might point anywhere. */
4142 if (live_vector_p (m
, po
))
4143 mark_p
= !SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
4144 else if (live_buffer_p (m
, po
))
4145 mark_p
= BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
4149 mark_p
= (live_misc_p (m
, po
) && !XMISCANY (obj
)->gcmarkbit
);
4153 case Lisp_Type_Limit
:
4159 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4160 if (nzombies
< MAX_ZOMBIES
)
4161 zombies
[nzombies
] = obj
;
4170 /* If P points to Lisp data, mark that as live if it isn't already
4174 mark_maybe_pointer (p
)
4179 /* Quickly rule out some values which can't point to Lisp data. */
4182 8 /* USE_LSB_TAG needs Lisp data to be aligned on multiples of 8. */
4184 2 /* We assume that Lisp data is aligned on even addresses. */
4192 Lisp_Object obj
= Qnil
;
4196 case MEM_TYPE_NON_LISP
:
4197 /* Nothing to do; not a pointer to Lisp memory. */
4200 case MEM_TYPE_BUFFER
:
4201 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P((struct buffer
*)p
))
4202 XSETVECTOR (obj
, p
);
4206 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
4210 case MEM_TYPE_STRING
:
4211 if (live_string_p (m
, p
)
4212 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
4213 XSETSTRING (obj
, p
);
4217 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
4221 case MEM_TYPE_SYMBOL
:
4222 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
4223 XSETSYMBOL (obj
, p
);
4226 case MEM_TYPE_FLOAT
:
4227 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
4231 case MEM_TYPE_VECTORLIKE
:
4232 if (live_vector_p (m
, p
))
4235 XSETVECTOR (tem
, p
);
4236 if (!SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
4251 /* Mark Lisp objects referenced from the address range START+OFFSET..END
4252 or END+OFFSET..START. */
4255 mark_memory (start
, end
, offset
)
4262 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4266 /* Make START the pointer to the start of the memory region,
4267 if it isn't already. */
4275 /* Mark Lisp_Objects. */
4276 for (p
= (Lisp_Object
*) ((char *) start
+ offset
); (void *) p
< end
; ++p
)
4277 mark_maybe_object (*p
);
4279 /* Mark Lisp data pointed to. This is necessary because, in some
4280 situations, the C compiler optimizes Lisp objects away, so that
4281 only a pointer to them remains. Example:
4283 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
4286 Lisp_Object obj = build_string ("test");
4287 struct Lisp_String *s = XSTRING (obj);
4288 Fgarbage_collect ();
4289 fprintf (stderr, "test `%s'\n", s->data);
4293 Here, `obj' isn't really used, and the compiler optimizes it
4294 away. The only reference to the life string is through the
4297 for (pp
= (void **) ((char *) start
+ offset
); (void *) pp
< end
; ++pp
)
4298 mark_maybe_pointer (*pp
);
4301 /* setjmp will work with GCC unless NON_SAVING_SETJMP is defined in
4302 the GCC system configuration. In gcc 3.2, the only systems for
4303 which this is so are i386-sco5 non-ELF, i386-sysv3 (maybe included
4304 by others?) and ns32k-pc532-min. */
4306 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
4308 static int setjmp_tested_p
, longjmps_done
;
4310 #define SETJMP_WILL_LIKELY_WORK "\
4312 Emacs garbage collector has been changed to use conservative stack\n\
4313 marking. Emacs has determined that the method it uses to do the\n\
4314 marking will likely work on your system, but this isn't sure.\n\
4316 If you are a system-programmer, or can get the help of a local wizard\n\
4317 who is, please take a look at the function mark_stack in alloc.c, and\n\
4318 verify that the methods used are appropriate for your system.\n\
4320 Please mail the result to <emacs-devel@gnu.org>.\n\
4323 #define SETJMP_WILL_NOT_WORK "\
4325 Emacs garbage collector has been changed to use conservative stack\n\
4326 marking. Emacs has determined that the default method it uses to do the\n\
4327 marking will not work on your system. We will need a system-dependent\n\
4328 solution for your system.\n\
4330 Please take a look at the function mark_stack in alloc.c, and\n\
4331 try to find a way to make it work on your system.\n\
4333 Note that you may get false negatives, depending on the compiler.\n\
4334 In particular, you need to use -O with GCC for this test.\n\
4336 Please mail the result to <emacs-devel@gnu.org>.\n\
4340 /* Perform a quick check if it looks like setjmp saves registers in a
4341 jmp_buf. Print a message to stderr saying so. When this test
4342 succeeds, this is _not_ a proof that setjmp is sufficient for
4343 conservative stack marking. Only the sources or a disassembly
4354 /* Arrange for X to be put in a register. */
4360 if (longjmps_done
== 1)
4362 /* Came here after the longjmp at the end of the function.
4364 If x == 1, the longjmp has restored the register to its
4365 value before the setjmp, and we can hope that setjmp
4366 saves all such registers in the jmp_buf, although that
4369 For other values of X, either something really strange is
4370 taking place, or the setjmp just didn't save the register. */
4373 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
4376 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
4383 if (longjmps_done
== 1)
4387 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
4390 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4392 /* Abort if anything GCPRO'd doesn't survive the GC. */
4400 for (p
= gcprolist
; p
; p
= p
->next
)
4401 for (i
= 0; i
< p
->nvars
; ++i
)
4402 if (!survives_gc_p (p
->var
[i
]))
4403 /* FIXME: It's not necessarily a bug. It might just be that the
4404 GCPRO is unnecessary or should release the object sooner. */
4408 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4415 fprintf (stderr
, "\nZombies kept alive = %d:\n", nzombies
);
4416 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
4418 fprintf (stderr
, " %d = ", i
);
4419 debug_print (zombies
[i
]);
4423 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4426 /* Mark live Lisp objects on the C stack.
4428 There are several system-dependent problems to consider when
4429 porting this to new architectures:
4433 We have to mark Lisp objects in CPU registers that can hold local
4434 variables or are used to pass parameters.
4436 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
4437 something that either saves relevant registers on the stack, or
4438 calls mark_maybe_object passing it each register's contents.
4440 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
4441 implementation assumes that calling setjmp saves registers we need
4442 to see in a jmp_buf which itself lies on the stack. This doesn't
4443 have to be true! It must be verified for each system, possibly
4444 by taking a look at the source code of setjmp.
4448 Architectures differ in the way their processor stack is organized.
4449 For example, the stack might look like this
4452 | Lisp_Object | size = 4
4454 | something else | size = 2
4456 | Lisp_Object | size = 4
4460 In such a case, not every Lisp_Object will be aligned equally. To
4461 find all Lisp_Object on the stack it won't be sufficient to walk
4462 the stack in steps of 4 bytes. Instead, two passes will be
4463 necessary, one starting at the start of the stack, and a second
4464 pass starting at the start of the stack + 2. Likewise, if the
4465 minimal alignment of Lisp_Objects on the stack is 1, four passes
4466 would be necessary, each one starting with one byte more offset
4467 from the stack start.
4469 The current code assumes by default that Lisp_Objects are aligned
4470 equally on the stack. */
4476 /* jmp_buf may not be aligned enough on darwin-ppc64 */
4477 union aligned_jmpbuf
{
4481 volatile int stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
4484 /* This trick flushes the register windows so that all the state of
4485 the process is contained in the stack. */
4486 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
4487 needed on ia64 too. See mach_dep.c, where it also says inline
4488 assembler doesn't work with relevant proprietary compilers. */
4493 /* Save registers that we need to see on the stack. We need to see
4494 registers used to hold register variables and registers used to
4496 #ifdef GC_SAVE_REGISTERS_ON_STACK
4497 GC_SAVE_REGISTERS_ON_STACK (end
);
4498 #else /* not GC_SAVE_REGISTERS_ON_STACK */
4500 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
4501 setjmp will definitely work, test it
4502 and print a message with the result
4504 if (!setjmp_tested_p
)
4506 setjmp_tested_p
= 1;
4509 #endif /* GC_SETJMP_WORKS */
4512 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
4513 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
4515 /* This assumes that the stack is a contiguous region in memory. If
4516 that's not the case, something has to be done here to iterate
4517 over the stack segments. */
4518 #ifndef GC_LISP_OBJECT_ALIGNMENT
4520 #define GC_LISP_OBJECT_ALIGNMENT __alignof__ (Lisp_Object)
4522 #define GC_LISP_OBJECT_ALIGNMENT sizeof (Lisp_Object)
4525 for (i
= 0; i
< sizeof (Lisp_Object
); i
+= GC_LISP_OBJECT_ALIGNMENT
)
4526 mark_memory (stack_base
, end
, i
);
4527 /* Allow for marking a secondary stack, like the register stack on the
4529 #ifdef GC_MARK_SECONDARY_STACK
4530 GC_MARK_SECONDARY_STACK ();
4533 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4538 #endif /* GC_MARK_STACK != 0 */
4541 /* Determine whether it is safe to access memory at address P. */
4547 return w32_valid_pointer_p (p
, 16);
4551 /* Obviously, we cannot just access it (we would SEGV trying), so we
4552 trick the o/s to tell us whether p is a valid pointer.
4553 Unfortunately, we cannot use NULL_DEVICE here, as emacs_write may
4554 not validate p in that case. */
4556 if ((fd
= emacs_open ("__Valid__Lisp__Object__", O_CREAT
| O_WRONLY
| O_TRUNC
, 0666)) >= 0)
4558 int valid
= (emacs_write (fd
, (char *)p
, 16) == 16);
4560 unlink ("__Valid__Lisp__Object__");
4568 /* Return 1 if OBJ is a valid lisp object.
4569 Return 0 if OBJ is NOT a valid lisp object.
4570 Return -1 if we cannot validate OBJ.
4571 This function can be quite slow,
4572 so it should only be used in code for manual debugging. */
4575 valid_lisp_object_p (obj
)
4586 p
= (void *) XPNTR (obj
);
4587 if (PURE_POINTER_P (p
))
4591 return valid_pointer_p (p
);
4598 int valid
= valid_pointer_p (p
);
4610 case MEM_TYPE_NON_LISP
:
4613 case MEM_TYPE_BUFFER
:
4614 return live_buffer_p (m
, p
);
4617 return live_cons_p (m
, p
);
4619 case MEM_TYPE_STRING
:
4620 return live_string_p (m
, p
);
4623 return live_misc_p (m
, p
);
4625 case MEM_TYPE_SYMBOL
:
4626 return live_symbol_p (m
, p
);
4628 case MEM_TYPE_FLOAT
:
4629 return live_float_p (m
, p
);
4631 case MEM_TYPE_VECTORLIKE
:
4632 return live_vector_p (m
, p
);
4645 /***********************************************************************
4646 Pure Storage Management
4647 ***********************************************************************/
4649 /* Allocate room for SIZE bytes from pure Lisp storage and return a
4650 pointer to it. TYPE is the Lisp type for which the memory is
4651 allocated. TYPE < 0 means it's not used for a Lisp object. */
4653 static POINTER_TYPE
*
4654 pure_alloc (size
, type
)
4658 POINTER_TYPE
*result
;
4660 size_t alignment
= (1 << GCTYPEBITS
);
4662 size_t alignment
= sizeof (EMACS_INT
);
4664 /* Give Lisp_Floats an extra alignment. */
4665 if (type
== Lisp_Float
)
4667 #if defined __GNUC__ && __GNUC__ >= 2
4668 alignment
= __alignof (struct Lisp_Float
);
4670 alignment
= sizeof (struct Lisp_Float
);
4678 /* Allocate space for a Lisp object from the beginning of the free
4679 space with taking account of alignment. */
4680 result
= ALIGN (purebeg
+ pure_bytes_used_lisp
, alignment
);
4681 pure_bytes_used_lisp
= ((char *)result
- (char *)purebeg
) + size
;
4685 /* Allocate space for a non-Lisp object from the end of the free
4687 pure_bytes_used_non_lisp
+= size
;
4688 result
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4690 pure_bytes_used
= pure_bytes_used_lisp
+ pure_bytes_used_non_lisp
;
4692 if (pure_bytes_used
<= pure_size
)
4695 /* Don't allocate a large amount here,
4696 because it might get mmap'd and then its address
4697 might not be usable. */
4698 purebeg
= (char *) xmalloc (10000);
4700 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
4701 pure_bytes_used
= 0;
4702 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
4707 /* Print a warning if PURESIZE is too small. */
4712 if (pure_bytes_used_before_overflow
)
4713 message ("emacs:0:Pure Lisp storage overflow (approx. %d bytes needed)",
4714 (int) (pure_bytes_used
+ pure_bytes_used_before_overflow
));
4718 /* Find the byte sequence {DATA[0], ..., DATA[NBYTES-1], '\0'} from
4719 the non-Lisp data pool of the pure storage, and return its start
4720 address. Return NULL if not found. */
4723 find_string_data_in_pure (data
, nbytes
)
4727 int i
, skip
, bm_skip
[256], last_char_skip
, infinity
, start
, start_max
;
4731 if (pure_bytes_used_non_lisp
< nbytes
+ 1)
4734 /* Set up the Boyer-Moore table. */
4736 for (i
= 0; i
< 256; i
++)
4739 p
= (unsigned char *) data
;
4741 bm_skip
[*p
++] = skip
;
4743 last_char_skip
= bm_skip
['\0'];
4745 non_lisp_beg
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4746 start_max
= pure_bytes_used_non_lisp
- (nbytes
+ 1);
4748 /* See the comments in the function `boyer_moore' (search.c) for the
4749 use of `infinity'. */
4750 infinity
= pure_bytes_used_non_lisp
+ 1;
4751 bm_skip
['\0'] = infinity
;
4753 p
= (unsigned char *) non_lisp_beg
+ nbytes
;
4757 /* Check the last character (== '\0'). */
4760 start
+= bm_skip
[*(p
+ start
)];
4762 while (start
<= start_max
);
4764 if (start
< infinity
)
4765 /* Couldn't find the last character. */
4768 /* No less than `infinity' means we could find the last
4769 character at `p[start - infinity]'. */
4772 /* Check the remaining characters. */
4773 if (memcmp (data
, non_lisp_beg
+ start
, nbytes
) == 0)
4775 return non_lisp_beg
+ start
;
4777 start
+= last_char_skip
;
4779 while (start
<= start_max
);
4785 /* Return a string allocated in pure space. DATA is a buffer holding
4786 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
4787 non-zero means make the result string multibyte.
4789 Must get an error if pure storage is full, since if it cannot hold
4790 a large string it may be able to hold conses that point to that
4791 string; then the string is not protected from gc. */
4794 make_pure_string (data
, nchars
, nbytes
, multibyte
)
4800 struct Lisp_String
*s
;
4802 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4803 s
->data
= find_string_data_in_pure (data
, nbytes
);
4804 if (s
->data
== NULL
)
4806 s
->data
= (unsigned char *) pure_alloc (nbytes
+ 1, -1);
4807 bcopy (data
, s
->data
, nbytes
);
4808 s
->data
[nbytes
] = '\0';
4811 s
->size_byte
= multibyte
? nbytes
: -1;
4812 s
->intervals
= NULL_INTERVAL
;
4813 XSETSTRING (string
, s
);
4818 /* Return a cons allocated from pure space. Give it pure copies
4819 of CAR as car and CDR as cdr. */
4822 pure_cons (car
, cdr
)
4823 Lisp_Object car
, cdr
;
4825 register Lisp_Object
new;
4826 struct Lisp_Cons
*p
;
4828 p
= (struct Lisp_Cons
*) pure_alloc (sizeof *p
, Lisp_Cons
);
4830 XSETCAR (new, Fpurecopy (car
));
4831 XSETCDR (new, Fpurecopy (cdr
));
4836 /* Value is a float object with value NUM allocated from pure space. */
4839 make_pure_float (num
)
4842 register Lisp_Object
new;
4843 struct Lisp_Float
*p
;
4845 p
= (struct Lisp_Float
*) pure_alloc (sizeof *p
, Lisp_Float
);
4847 XFLOAT_DATA (new) = num
;
4852 /* Return a vector with room for LEN Lisp_Objects allocated from
4856 make_pure_vector (len
)
4860 struct Lisp_Vector
*p
;
4861 size_t size
= sizeof *p
+ (len
- 1) * sizeof (Lisp_Object
);
4863 p
= (struct Lisp_Vector
*) pure_alloc (size
, Lisp_Vectorlike
);
4864 XSETVECTOR (new, p
);
4865 XVECTOR (new)->size
= len
;
4870 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
4871 doc
: /* Make a copy of object OBJ in pure storage.
4872 Recursively copies contents of vectors and cons cells.
4873 Does not copy symbols. Copies strings without text properties. */)
4875 register Lisp_Object obj
;
4877 if (NILP (Vpurify_flag
))
4880 if (PURE_POINTER_P (XPNTR (obj
)))
4884 return pure_cons (XCAR (obj
), XCDR (obj
));
4885 else if (FLOATP (obj
))
4886 return make_pure_float (XFLOAT_DATA (obj
));
4887 else if (STRINGP (obj
))
4888 return make_pure_string (SDATA (obj
), SCHARS (obj
),
4890 STRING_MULTIBYTE (obj
));
4891 else if (COMPILEDP (obj
) || VECTORP (obj
))
4893 register struct Lisp_Vector
*vec
;
4897 size
= XVECTOR (obj
)->size
;
4898 if (size
& PSEUDOVECTOR_FLAG
)
4899 size
&= PSEUDOVECTOR_SIZE_MASK
;
4900 vec
= XVECTOR (make_pure_vector (size
));
4901 for (i
= 0; i
< size
; i
++)
4902 vec
->contents
[i
] = Fpurecopy (XVECTOR (obj
)->contents
[i
]);
4903 if (COMPILEDP (obj
))
4905 XSETPVECTYPE (vec
, PVEC_COMPILED
);
4906 XSETCOMPILED (obj
, vec
);
4909 XSETVECTOR (obj
, vec
);
4912 else if (MARKERP (obj
))
4913 error ("Attempt to copy a marker to pure storage");
4920 /***********************************************************************
4922 ***********************************************************************/
4924 /* Put an entry in staticvec, pointing at the variable with address
4928 staticpro (varaddress
)
4929 Lisp_Object
*varaddress
;
4931 staticvec
[staticidx
++] = varaddress
;
4932 if (staticidx
>= NSTATICS
)
4940 struct catchtag
*next
;
4944 /***********************************************************************
4946 ***********************************************************************/
4948 /* Temporarily prevent garbage collection. */
4951 inhibit_garbage_collection ()
4953 int count
= SPECPDL_INDEX ();
4954 int nbits
= min (VALBITS
, BITS_PER_INT
);
4956 specbind (Qgc_cons_threshold
, make_number (((EMACS_INT
) 1 << (nbits
- 1)) - 1));
4961 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
4962 doc
: /* Reclaim storage for Lisp objects no longer needed.
4963 Garbage collection happens automatically if you cons more than
4964 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
4965 `garbage-collect' normally returns a list with info on amount of space in use:
4966 ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)
4967 (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS
4968 (USED-FLOATS . FREE-FLOATS) (USED-INTERVALS . FREE-INTERVALS)
4969 (USED-STRINGS . FREE-STRINGS))
4970 However, if there was overflow in pure space, `garbage-collect'
4971 returns nil, because real GC can't be done. */)
4974 register struct specbinding
*bind
;
4975 struct catchtag
*catch;
4976 struct handler
*handler
;
4977 char stack_top_variable
;
4980 Lisp_Object total
[8];
4981 int count
= SPECPDL_INDEX ();
4982 EMACS_TIME t1
, t2
, t3
;
4987 /* Can't GC if pure storage overflowed because we can't determine
4988 if something is a pure object or not. */
4989 if (pure_bytes_used_before_overflow
)
4994 /* Don't keep undo information around forever.
4995 Do this early on, so it is no problem if the user quits. */
4997 register struct buffer
*nextb
= all_buffers
;
5001 /* If a buffer's undo list is Qt, that means that undo is
5002 turned off in that buffer. Calling truncate_undo_list on
5003 Qt tends to return NULL, which effectively turns undo back on.
5004 So don't call truncate_undo_list if undo_list is Qt. */
5005 if (! NILP (nextb
->name
) && ! EQ (nextb
->undo_list
, Qt
))
5006 truncate_undo_list (nextb
);
5008 /* Shrink buffer gaps, but skip indirect and dead buffers. */
5009 if (nextb
->base_buffer
== 0 && !NILP (nextb
->name
)
5010 && ! nextb
->text
->inhibit_shrinking
)
5012 /* If a buffer's gap size is more than 10% of the buffer
5013 size, or larger than 2000 bytes, then shrink it
5014 accordingly. Keep a minimum size of 20 bytes. */
5015 int size
= min (2000, max (20, (nextb
->text
->z_byte
/ 10)));
5017 if (nextb
->text
->gap_size
> size
)
5019 struct buffer
*save_current
= current_buffer
;
5020 current_buffer
= nextb
;
5021 make_gap (-(nextb
->text
->gap_size
- size
));
5022 current_buffer
= save_current
;
5026 nextb
= nextb
->next
;
5030 EMACS_GET_TIME (t1
);
5032 /* In case user calls debug_print during GC,
5033 don't let that cause a recursive GC. */
5034 consing_since_gc
= 0;
5036 /* Save what's currently displayed in the echo area. */
5037 message_p
= push_message ();
5038 record_unwind_protect (pop_message_unwind
, Qnil
);
5040 /* Save a copy of the contents of the stack, for debugging. */
5041 #if MAX_SAVE_STACK > 0
5042 if (NILP (Vpurify_flag
))
5044 i
= &stack_top_variable
- stack_bottom
;
5046 if (i
< MAX_SAVE_STACK
)
5048 if (stack_copy
== 0)
5049 stack_copy
= (char *) xmalloc (stack_copy_size
= i
);
5050 else if (stack_copy_size
< i
)
5051 stack_copy
= (char *) xrealloc (stack_copy
, (stack_copy_size
= i
));
5054 if ((EMACS_INT
) (&stack_top_variable
- stack_bottom
) > 0)
5055 bcopy (stack_bottom
, stack_copy
, i
);
5057 bcopy (&stack_top_variable
, stack_copy
, i
);
5061 #endif /* MAX_SAVE_STACK > 0 */
5063 if (garbage_collection_messages
)
5064 message1_nolog ("Garbage collecting...");
5068 shrink_regexp_cache ();
5072 /* clear_marks (); */
5074 /* Mark all the special slots that serve as the roots of accessibility. */
5076 for (i
= 0; i
< staticidx
; i
++)
5077 mark_object (*staticvec
[i
]);
5079 for (bind
= specpdl
; bind
!= specpdl_ptr
; bind
++)
5081 mark_object (bind
->symbol
);
5082 mark_object (bind
->old_value
);
5090 extern void xg_mark_data ();
5095 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
5096 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
5100 register struct gcpro
*tail
;
5101 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
5102 for (i
= 0; i
< tail
->nvars
; i
++)
5103 mark_object (tail
->var
[i
]);
5108 for (catch = catchlist
; catch; catch = catch->next
)
5110 mark_object (catch->tag
);
5111 mark_object (catch->val
);
5113 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
5115 mark_object (handler
->handler
);
5116 mark_object (handler
->var
);
5120 #ifdef HAVE_WINDOW_SYSTEM
5121 mark_fringe_data ();
5124 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5128 /* Everything is now marked, except for the things that require special
5129 finalization, i.e. the undo_list.
5130 Look thru every buffer's undo list
5131 for elements that update markers that were not marked,
5134 register struct buffer
*nextb
= all_buffers
;
5138 /* If a buffer's undo list is Qt, that means that undo is
5139 turned off in that buffer. Calling truncate_undo_list on
5140 Qt tends to return NULL, which effectively turns undo back on.
5141 So don't call truncate_undo_list if undo_list is Qt. */
5142 if (! EQ (nextb
->undo_list
, Qt
))
5144 Lisp_Object tail
, prev
;
5145 tail
= nextb
->undo_list
;
5147 while (CONSP (tail
))
5149 if (CONSP (XCAR (tail
))
5150 && MARKERP (XCAR (XCAR (tail
)))
5151 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
5154 nextb
->undo_list
= tail
= XCDR (tail
);
5158 XSETCDR (prev
, tail
);
5168 /* Now that we have stripped the elements that need not be in the
5169 undo_list any more, we can finally mark the list. */
5170 mark_object (nextb
->undo_list
);
5172 nextb
= nextb
->next
;
5178 /* Clear the mark bits that we set in certain root slots. */
5180 unmark_byte_stack ();
5181 VECTOR_UNMARK (&buffer_defaults
);
5182 VECTOR_UNMARK (&buffer_local_symbols
);
5184 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
5192 /* clear_marks (); */
5195 consing_since_gc
= 0;
5196 if (gc_cons_threshold
< 10000)
5197 gc_cons_threshold
= 10000;
5199 if (FLOATP (Vgc_cons_percentage
))
5200 { /* Set gc_cons_combined_threshold. */
5201 EMACS_INT total
= 0;
5203 total
+= total_conses
* sizeof (struct Lisp_Cons
);
5204 total
+= total_symbols
* sizeof (struct Lisp_Symbol
);
5205 total
+= total_markers
* sizeof (union Lisp_Misc
);
5206 total
+= total_string_size
;
5207 total
+= total_vector_size
* sizeof (Lisp_Object
);
5208 total
+= total_floats
* sizeof (struct Lisp_Float
);
5209 total
+= total_intervals
* sizeof (struct interval
);
5210 total
+= total_strings
* sizeof (struct Lisp_String
);
5212 gc_relative_threshold
= total
* XFLOAT_DATA (Vgc_cons_percentage
);
5215 gc_relative_threshold
= 0;
5217 if (garbage_collection_messages
)
5219 if (message_p
|| minibuf_level
> 0)
5222 message1_nolog ("Garbage collecting...done");
5225 unbind_to (count
, Qnil
);
5227 total
[0] = Fcons (make_number (total_conses
),
5228 make_number (total_free_conses
));
5229 total
[1] = Fcons (make_number (total_symbols
),
5230 make_number (total_free_symbols
));
5231 total
[2] = Fcons (make_number (total_markers
),
5232 make_number (total_free_markers
));
5233 total
[3] = make_number (total_string_size
);
5234 total
[4] = make_number (total_vector_size
);
5235 total
[5] = Fcons (make_number (total_floats
),
5236 make_number (total_free_floats
));
5237 total
[6] = Fcons (make_number (total_intervals
),
5238 make_number (total_free_intervals
));
5239 total
[7] = Fcons (make_number (total_strings
),
5240 make_number (total_free_strings
));
5242 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5244 /* Compute average percentage of zombies. */
5247 for (i
= 0; i
< 7; ++i
)
5248 if (CONSP (total
[i
]))
5249 nlive
+= XFASTINT (XCAR (total
[i
]));
5251 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
5252 max_live
= max (nlive
, max_live
);
5253 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
5254 max_zombies
= max (nzombies
, max_zombies
);
5259 if (!NILP (Vpost_gc_hook
))
5261 int count
= inhibit_garbage_collection ();
5262 safe_run_hooks (Qpost_gc_hook
);
5263 unbind_to (count
, Qnil
);
5266 /* Accumulate statistics. */
5267 EMACS_GET_TIME (t2
);
5268 EMACS_SUB_TIME (t3
, t2
, t1
);
5269 if (FLOATP (Vgc_elapsed
))
5270 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
) +
5272 EMACS_USECS (t3
) * 1.0e-6);
5275 return Flist (sizeof total
/ sizeof *total
, total
);
5279 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
5280 only interesting objects referenced from glyphs are strings. */
5283 mark_glyph_matrix (matrix
)
5284 struct glyph_matrix
*matrix
;
5286 struct glyph_row
*row
= matrix
->rows
;
5287 struct glyph_row
*end
= row
+ matrix
->nrows
;
5289 for (; row
< end
; ++row
)
5293 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
5295 struct glyph
*glyph
= row
->glyphs
[area
];
5296 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
5298 for (; glyph
< end_glyph
; ++glyph
)
5299 if (STRINGP (glyph
->object
)
5300 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
5301 mark_object (glyph
->object
);
5307 /* Mark Lisp faces in the face cache C. */
5311 struct face_cache
*c
;
5316 for (i
= 0; i
< c
->used
; ++i
)
5318 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
5322 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
5323 mark_object (face
->lface
[j
]);
5330 #ifdef HAVE_WINDOW_SYSTEM
5332 /* Mark Lisp objects in image IMG. */
5338 mark_object (img
->spec
);
5340 if (!NILP (img
->data
.lisp_val
))
5341 mark_object (img
->data
.lisp_val
);
5345 /* Mark Lisp objects in image cache of frame F. It's done this way so
5346 that we don't have to include xterm.h here. */
5349 mark_image_cache (f
)
5352 forall_images_in_image_cache (f
, mark_image
);
5355 #endif /* HAVE_X_WINDOWS */
5359 /* Mark reference to a Lisp_Object.
5360 If the object referred to has not been seen yet, recursively mark
5361 all the references contained in it. */
5363 #define LAST_MARKED_SIZE 500
5364 static Lisp_Object last_marked
[LAST_MARKED_SIZE
];
5365 int last_marked_index
;
5367 /* For debugging--call abort when we cdr down this many
5368 links of a list, in mark_object. In debugging,
5369 the call to abort will hit a breakpoint.
5370 Normally this is zero and the check never goes off. */
5371 static int mark_object_loop_halt
;
5373 /* Return non-zero if the object was not yet marked. */
5375 mark_vectorlike (ptr
)
5376 struct Lisp_Vector
*ptr
;
5378 register EMACS_INT size
= ptr
->size
;
5381 if (VECTOR_MARKED_P (ptr
))
5382 return 0; /* Already marked */
5383 VECTOR_MARK (ptr
); /* Else mark it */
5384 if (size
& PSEUDOVECTOR_FLAG
)
5385 size
&= PSEUDOVECTOR_SIZE_MASK
;
5387 /* Note that this size is not the memory-footprint size, but only
5388 the number of Lisp_Object fields that we should trace.
5389 The distinction is used e.g. by Lisp_Process which places extra
5390 non-Lisp_Object fields at the end of the structure. */
5391 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5392 mark_object (ptr
->contents
[i
]);
5400 register Lisp_Object obj
= arg
;
5401 #ifdef GC_CHECK_MARKED_OBJECTS
5409 if (PURE_POINTER_P (XPNTR (obj
)))
5412 last_marked
[last_marked_index
++] = obj
;
5413 if (last_marked_index
== LAST_MARKED_SIZE
)
5414 last_marked_index
= 0;
5416 /* Perform some sanity checks on the objects marked here. Abort if
5417 we encounter an object we know is bogus. This increases GC time
5418 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
5419 #ifdef GC_CHECK_MARKED_OBJECTS
5421 po
= (void *) XPNTR (obj
);
5423 /* Check that the object pointed to by PO is known to be a Lisp
5424 structure allocated from the heap. */
5425 #define CHECK_ALLOCATED() \
5427 m = mem_find (po); \
5432 /* Check that the object pointed to by PO is live, using predicate
5434 #define CHECK_LIVE(LIVEP) \
5436 if (!LIVEP (m, po)) \
5440 /* Check both of the above conditions. */
5441 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
5443 CHECK_ALLOCATED (); \
5444 CHECK_LIVE (LIVEP); \
5447 #else /* not GC_CHECK_MARKED_OBJECTS */
5449 #define CHECK_ALLOCATED() (void) 0
5450 #define CHECK_LIVE(LIVEP) (void) 0
5451 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
5453 #endif /* not GC_CHECK_MARKED_OBJECTS */
5455 switch (SWITCH_ENUM_CAST (XTYPE (obj
)))
5459 register struct Lisp_String
*ptr
= XSTRING (obj
);
5460 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
5461 MARK_INTERVAL_TREE (ptr
->intervals
);
5463 #ifdef GC_CHECK_STRING_BYTES
5464 /* Check that the string size recorded in the string is the
5465 same as the one recorded in the sdata structure. */
5466 CHECK_STRING_BYTES (ptr
);
5467 #endif /* GC_CHECK_STRING_BYTES */
5471 case Lisp_Vectorlike
:
5472 #ifdef GC_CHECK_MARKED_OBJECTS
5474 if (m
== MEM_NIL
&& !SUBRP (obj
)
5475 && po
!= &buffer_defaults
5476 && po
!= &buffer_local_symbols
)
5478 #endif /* GC_CHECK_MARKED_OBJECTS */
5482 if (!VECTOR_MARKED_P (XBUFFER (obj
)))
5484 #ifdef GC_CHECK_MARKED_OBJECTS
5485 if (po
!= &buffer_defaults
&& po
!= &buffer_local_symbols
)
5488 for (b
= all_buffers
; b
&& b
!= po
; b
= b
->next
)
5493 #endif /* GC_CHECK_MARKED_OBJECTS */
5497 else if (SUBRP (obj
))
5499 else if (COMPILEDP (obj
))
5500 /* We could treat this just like a vector, but it is better to
5501 save the COMPILED_CONSTANTS element for last and avoid
5504 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5505 register EMACS_INT size
= ptr
->size
;
5508 if (VECTOR_MARKED_P (ptr
))
5509 break; /* Already marked */
5511 CHECK_LIVE (live_vector_p
);
5512 VECTOR_MARK (ptr
); /* Else mark it */
5513 size
&= PSEUDOVECTOR_SIZE_MASK
;
5514 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5516 if (i
!= COMPILED_CONSTANTS
)
5517 mark_object (ptr
->contents
[i
]);
5519 obj
= ptr
->contents
[COMPILED_CONSTANTS
];
5522 else if (FRAMEP (obj
))
5524 register struct frame
*ptr
= XFRAME (obj
);
5525 if (mark_vectorlike (XVECTOR (obj
)))
5527 mark_face_cache (ptr
->face_cache
);
5528 #ifdef HAVE_WINDOW_SYSTEM
5529 mark_image_cache (ptr
);
5530 #endif /* HAVE_WINDOW_SYSTEM */
5533 else if (WINDOWP (obj
))
5535 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5536 struct window
*w
= XWINDOW (obj
);
5537 if (mark_vectorlike (ptr
))
5539 /* Mark glyphs for leaf windows. Marking window matrices is
5540 sufficient because frame matrices use the same glyph
5542 if (NILP (w
->hchild
)
5544 && w
->current_matrix
)
5546 mark_glyph_matrix (w
->current_matrix
);
5547 mark_glyph_matrix (w
->desired_matrix
);
5551 else if (HASH_TABLE_P (obj
))
5553 struct Lisp_Hash_Table
*h
= XHASH_TABLE (obj
);
5554 if (mark_vectorlike ((struct Lisp_Vector
*)h
))
5555 { /* If hash table is not weak, mark all keys and values.
5556 For weak tables, mark only the vector. */
5558 mark_object (h
->key_and_value
);
5560 VECTOR_MARK (XVECTOR (h
->key_and_value
));
5564 mark_vectorlike (XVECTOR (obj
));
5569 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
5570 struct Lisp_Symbol
*ptrx
;
5572 if (ptr
->gcmarkbit
) break;
5573 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
5575 mark_object (ptr
->value
);
5576 mark_object (ptr
->function
);
5577 mark_object (ptr
->plist
);
5579 if (!PURE_POINTER_P (XSTRING (ptr
->xname
)))
5580 MARK_STRING (XSTRING (ptr
->xname
));
5581 MARK_INTERVAL_TREE (STRING_INTERVALS (ptr
->xname
));
5583 /* Note that we do not mark the obarray of the symbol.
5584 It is safe not to do so because nothing accesses that
5585 slot except to check whether it is nil. */
5589 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun */
5590 XSETSYMBOL (obj
, ptrx
);
5597 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
5598 if (XMISCANY (obj
)->gcmarkbit
)
5600 XMISCANY (obj
)->gcmarkbit
= 1;
5602 switch (XMISCTYPE (obj
))
5604 case Lisp_Misc_Buffer_Local_Value
:
5606 register struct Lisp_Buffer_Local_Value
*ptr
5607 = XBUFFER_LOCAL_VALUE (obj
);
5608 /* If the cdr is nil, avoid recursion for the car. */
5609 if (EQ (ptr
->cdr
, Qnil
))
5611 obj
= ptr
->realvalue
;
5614 mark_object (ptr
->realvalue
);
5615 mark_object (ptr
->buffer
);
5616 mark_object (ptr
->frame
);
5621 case Lisp_Misc_Marker
:
5622 /* DO NOT mark thru the marker's chain.
5623 The buffer's markers chain does not preserve markers from gc;
5624 instead, markers are removed from the chain when freed by gc. */
5627 case Lisp_Misc_Intfwd
:
5628 case Lisp_Misc_Boolfwd
:
5629 case Lisp_Misc_Objfwd
:
5630 case Lisp_Misc_Buffer_Objfwd
:
5631 case Lisp_Misc_Kboard_Objfwd
:
5632 /* Don't bother with Lisp_Buffer_Objfwd,
5633 since all markable slots in current buffer marked anyway. */
5634 /* Don't need to do Lisp_Objfwd, since the places they point
5635 are protected with staticpro. */
5638 case Lisp_Misc_Save_Value
:
5641 register struct Lisp_Save_Value
*ptr
= XSAVE_VALUE (obj
);
5642 /* If DOGC is set, POINTER is the address of a memory
5643 area containing INTEGER potential Lisp_Objects. */
5646 Lisp_Object
*p
= (Lisp_Object
*) ptr
->pointer
;
5648 for (nelt
= ptr
->integer
; nelt
> 0; nelt
--, p
++)
5649 mark_maybe_object (*p
);
5655 case Lisp_Misc_Overlay
:
5657 struct Lisp_Overlay
*ptr
= XOVERLAY (obj
);
5658 mark_object (ptr
->start
);
5659 mark_object (ptr
->end
);
5660 mark_object (ptr
->plist
);
5663 XSETMISC (obj
, ptr
->next
);
5676 register struct Lisp_Cons
*ptr
= XCONS (obj
);
5677 if (CONS_MARKED_P (ptr
)) break;
5678 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
5680 /* If the cdr is nil, avoid recursion for the car. */
5681 if (EQ (ptr
->u
.cdr
, Qnil
))
5687 mark_object (ptr
->car
);
5690 if (cdr_count
== mark_object_loop_halt
)
5696 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
5697 FLOAT_MARK (XFLOAT (obj
));
5708 #undef CHECK_ALLOCATED
5709 #undef CHECK_ALLOCATED_AND_LIVE
5712 /* Mark the pointers in a buffer structure. */
5718 register struct buffer
*buffer
= XBUFFER (buf
);
5719 register Lisp_Object
*ptr
, tmp
;
5720 Lisp_Object base_buffer
;
5722 VECTOR_MARK (buffer
);
5724 MARK_INTERVAL_TREE (BUF_INTERVALS (buffer
));
5726 /* For now, we just don't mark the undo_list. It's done later in
5727 a special way just before the sweep phase, and after stripping
5728 some of its elements that are not needed any more. */
5730 if (buffer
->overlays_before
)
5732 XSETMISC (tmp
, buffer
->overlays_before
);
5735 if (buffer
->overlays_after
)
5737 XSETMISC (tmp
, buffer
->overlays_after
);
5741 for (ptr
= &buffer
->name
;
5742 (char *)ptr
< (char *)buffer
+ sizeof (struct buffer
);
5746 /* If this is an indirect buffer, mark its base buffer. */
5747 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
5749 XSETBUFFER (base_buffer
, buffer
->base_buffer
);
5750 mark_buffer (base_buffer
);
5754 /* Mark the Lisp pointers in the terminal objects.
5755 Called by the Fgarbage_collector. */
5758 mark_terminals (void)
5761 for (t
= terminal_list
; t
; t
= t
->next_terminal
)
5763 eassert (t
->name
!= NULL
);
5764 mark_vectorlike ((struct Lisp_Vector
*)t
);
5770 /* Value is non-zero if OBJ will survive the current GC because it's
5771 either marked or does not need to be marked to survive. */
5779 switch (XTYPE (obj
))
5786 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
5790 survives_p
= XMISCANY (obj
)->gcmarkbit
;
5794 survives_p
= STRING_MARKED_P (XSTRING (obj
));
5797 case Lisp_Vectorlike
:
5798 survives_p
= SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
5802 survives_p
= CONS_MARKED_P (XCONS (obj
));
5806 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
5813 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
5818 /* Sweep: find all structures not marked, and free them. */
5823 /* Remove or mark entries in weak hash tables.
5824 This must be done before any object is unmarked. */
5825 sweep_weak_hash_tables ();
5828 #ifdef GC_CHECK_STRING_BYTES
5829 if (!noninteractive
)
5830 check_string_bytes (1);
5833 /* Put all unmarked conses on free list */
5835 register struct cons_block
*cblk
;
5836 struct cons_block
**cprev
= &cons_block
;
5837 register int lim
= cons_block_index
;
5838 register int num_free
= 0, num_used
= 0;
5842 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
5846 int ilim
= (lim
+ BITS_PER_INT
- 1) / BITS_PER_INT
;
5848 /* Scan the mark bits an int at a time. */
5849 for (i
= 0; i
<= ilim
; i
++)
5851 if (cblk
->gcmarkbits
[i
] == -1)
5853 /* Fast path - all cons cells for this int are marked. */
5854 cblk
->gcmarkbits
[i
] = 0;
5855 num_used
+= BITS_PER_INT
;
5859 /* Some cons cells for this int are not marked.
5860 Find which ones, and free them. */
5861 int start
, pos
, stop
;
5863 start
= i
* BITS_PER_INT
;
5865 if (stop
> BITS_PER_INT
)
5866 stop
= BITS_PER_INT
;
5869 for (pos
= start
; pos
< stop
; pos
++)
5871 if (!CONS_MARKED_P (&cblk
->conses
[pos
]))
5874 cblk
->conses
[pos
].u
.chain
= cons_free_list
;
5875 cons_free_list
= &cblk
->conses
[pos
];
5877 cons_free_list
->car
= Vdead
;
5883 CONS_UNMARK (&cblk
->conses
[pos
]);
5889 lim
= CONS_BLOCK_SIZE
;
5890 /* If this block contains only free conses and we have already
5891 seen more than two blocks worth of free conses then deallocate
5893 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
5895 *cprev
= cblk
->next
;
5896 /* Unhook from the free list. */
5897 cons_free_list
= cblk
->conses
[0].u
.chain
;
5898 lisp_align_free (cblk
);
5903 num_free
+= this_free
;
5904 cprev
= &cblk
->next
;
5907 total_conses
= num_used
;
5908 total_free_conses
= num_free
;
5911 /* Put all unmarked floats on free list */
5913 register struct float_block
*fblk
;
5914 struct float_block
**fprev
= &float_block
;
5915 register int lim
= float_block_index
;
5916 register int num_free
= 0, num_used
= 0;
5918 float_free_list
= 0;
5920 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
5924 for (i
= 0; i
< lim
; i
++)
5925 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
5928 fblk
->floats
[i
].u
.chain
= float_free_list
;
5929 float_free_list
= &fblk
->floats
[i
];
5934 FLOAT_UNMARK (&fblk
->floats
[i
]);
5936 lim
= FLOAT_BLOCK_SIZE
;
5937 /* If this block contains only free floats and we have already
5938 seen more than two blocks worth of free floats then deallocate
5940 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
5942 *fprev
= fblk
->next
;
5943 /* Unhook from the free list. */
5944 float_free_list
= fblk
->floats
[0].u
.chain
;
5945 lisp_align_free (fblk
);
5950 num_free
+= this_free
;
5951 fprev
= &fblk
->next
;
5954 total_floats
= num_used
;
5955 total_free_floats
= num_free
;
5958 /* Put all unmarked intervals on free list */
5960 register struct interval_block
*iblk
;
5961 struct interval_block
**iprev
= &interval_block
;
5962 register int lim
= interval_block_index
;
5963 register int num_free
= 0, num_used
= 0;
5965 interval_free_list
= 0;
5967 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
5972 for (i
= 0; i
< lim
; i
++)
5974 if (!iblk
->intervals
[i
].gcmarkbit
)
5976 SET_INTERVAL_PARENT (&iblk
->intervals
[i
], interval_free_list
);
5977 interval_free_list
= &iblk
->intervals
[i
];
5983 iblk
->intervals
[i
].gcmarkbit
= 0;
5986 lim
= INTERVAL_BLOCK_SIZE
;
5987 /* If this block contains only free intervals and we have already
5988 seen more than two blocks worth of free intervals then
5989 deallocate this block. */
5990 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
5992 *iprev
= iblk
->next
;
5993 /* Unhook from the free list. */
5994 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
5996 n_interval_blocks
--;
6000 num_free
+= this_free
;
6001 iprev
= &iblk
->next
;
6004 total_intervals
= num_used
;
6005 total_free_intervals
= num_free
;
6008 /* Put all unmarked symbols on free list */
6010 register struct symbol_block
*sblk
;
6011 struct symbol_block
**sprev
= &symbol_block
;
6012 register int lim
= symbol_block_index
;
6013 register int num_free
= 0, num_used
= 0;
6015 symbol_free_list
= NULL
;
6017 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
6020 struct Lisp_Symbol
*sym
= sblk
->symbols
;
6021 struct Lisp_Symbol
*end
= sym
+ lim
;
6023 for (; sym
< end
; ++sym
)
6025 /* Check if the symbol was created during loadup. In such a case
6026 it might be pointed to by pure bytecode which we don't trace,
6027 so we conservatively assume that it is live. */
6028 int pure_p
= PURE_POINTER_P (XSTRING (sym
->xname
));
6030 if (!sym
->gcmarkbit
&& !pure_p
)
6032 sym
->next
= symbol_free_list
;
6033 symbol_free_list
= sym
;
6035 symbol_free_list
->function
= Vdead
;
6043 UNMARK_STRING (XSTRING (sym
->xname
));
6048 lim
= SYMBOL_BLOCK_SIZE
;
6049 /* If this block contains only free symbols and we have already
6050 seen more than two blocks worth of free symbols then deallocate
6052 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
6054 *sprev
= sblk
->next
;
6055 /* Unhook from the free list. */
6056 symbol_free_list
= sblk
->symbols
[0].next
;
6062 num_free
+= this_free
;
6063 sprev
= &sblk
->next
;
6066 total_symbols
= num_used
;
6067 total_free_symbols
= num_free
;
6070 /* Put all unmarked misc's on free list.
6071 For a marker, first unchain it from the buffer it points into. */
6073 register struct marker_block
*mblk
;
6074 struct marker_block
**mprev
= &marker_block
;
6075 register int lim
= marker_block_index
;
6076 register int num_free
= 0, num_used
= 0;
6078 marker_free_list
= 0;
6080 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
6085 for (i
= 0; i
< lim
; i
++)
6087 if (!mblk
->markers
[i
].u_any
.gcmarkbit
)
6089 if (mblk
->markers
[i
].u_any
.type
== Lisp_Misc_Marker
)
6090 unchain_marker (&mblk
->markers
[i
].u_marker
);
6091 /* Set the type of the freed object to Lisp_Misc_Free.
6092 We could leave the type alone, since nobody checks it,
6093 but this might catch bugs faster. */
6094 mblk
->markers
[i
].u_marker
.type
= Lisp_Misc_Free
;
6095 mblk
->markers
[i
].u_free
.chain
= marker_free_list
;
6096 marker_free_list
= &mblk
->markers
[i
];
6102 mblk
->markers
[i
].u_any
.gcmarkbit
= 0;
6105 lim
= MARKER_BLOCK_SIZE
;
6106 /* If this block contains only free markers and we have already
6107 seen more than two blocks worth of free markers then deallocate
6109 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
6111 *mprev
= mblk
->next
;
6112 /* Unhook from the free list. */
6113 marker_free_list
= mblk
->markers
[0].u_free
.chain
;
6119 num_free
+= this_free
;
6120 mprev
= &mblk
->next
;
6124 total_markers
= num_used
;
6125 total_free_markers
= num_free
;
6128 /* Free all unmarked buffers */
6130 register struct buffer
*buffer
= all_buffers
, *prev
= 0, *next
;
6133 if (!VECTOR_MARKED_P (buffer
))
6136 prev
->next
= buffer
->next
;
6138 all_buffers
= buffer
->next
;
6139 next
= buffer
->next
;
6145 VECTOR_UNMARK (buffer
);
6146 UNMARK_BALANCE_INTERVALS (BUF_INTERVALS (buffer
));
6147 prev
= buffer
, buffer
= buffer
->next
;
6151 /* Free all unmarked vectors */
6153 register struct Lisp_Vector
*vector
= all_vectors
, *prev
= 0, *next
;
6154 total_vector_size
= 0;
6157 if (!VECTOR_MARKED_P (vector
))
6160 prev
->next
= vector
->next
;
6162 all_vectors
= vector
->next
;
6163 next
= vector
->next
;
6171 VECTOR_UNMARK (vector
);
6172 if (vector
->size
& PSEUDOVECTOR_FLAG
)
6173 total_vector_size
+= (PSEUDOVECTOR_SIZE_MASK
& vector
->size
);
6175 total_vector_size
+= vector
->size
;
6176 prev
= vector
, vector
= vector
->next
;
6180 #ifdef GC_CHECK_STRING_BYTES
6181 if (!noninteractive
)
6182 check_string_bytes (1);
6189 /* Debugging aids. */
6191 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
6192 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
6193 This may be helpful in debugging Emacs's memory usage.
6194 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
6199 XSETINT (end
, (EMACS_INT
) sbrk (0) / 1024);
6204 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
6205 doc
: /* Return a list of counters that measure how much consing there has been.
6206 Each of these counters increments for a certain kind of object.
6207 The counters wrap around from the largest positive integer to zero.
6208 Garbage collection does not decrease them.
6209 The elements of the value are as follows:
6210 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
6211 All are in units of 1 = one object consed
6212 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
6214 MISCS include overlays, markers, and some internal types.
6215 Frames, windows, buffers, and subprocesses count as vectors
6216 (but the contents of a buffer's text do not count here). */)
6219 Lisp_Object consed
[8];
6221 consed
[0] = make_number (min (MOST_POSITIVE_FIXNUM
, cons_cells_consed
));
6222 consed
[1] = make_number (min (MOST_POSITIVE_FIXNUM
, floats_consed
));
6223 consed
[2] = make_number (min (MOST_POSITIVE_FIXNUM
, vector_cells_consed
));
6224 consed
[3] = make_number (min (MOST_POSITIVE_FIXNUM
, symbols_consed
));
6225 consed
[4] = make_number (min (MOST_POSITIVE_FIXNUM
, string_chars_consed
));
6226 consed
[5] = make_number (min (MOST_POSITIVE_FIXNUM
, misc_objects_consed
));
6227 consed
[6] = make_number (min (MOST_POSITIVE_FIXNUM
, intervals_consed
));
6228 consed
[7] = make_number (min (MOST_POSITIVE_FIXNUM
, strings_consed
));
6230 return Flist (8, consed
);
6233 int suppress_checking
;
6236 die (msg
, file
, line
)
6241 fprintf (stderr
, "\r\n%s:%d: Emacs fatal error: %s\r\n",
6246 /* Initialization */
6251 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
6253 pure_size
= PURESIZE
;
6254 pure_bytes_used
= 0;
6255 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
6256 pure_bytes_used_before_overflow
= 0;
6258 /* Initialize the list of free aligned blocks. */
6261 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
6263 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
6267 ignore_warnings
= 1;
6268 #ifdef DOUG_LEA_MALLOC
6269 mallopt (M_TRIM_THRESHOLD
, 128*1024); /* trim threshold */
6270 mallopt (M_MMAP_THRESHOLD
, 64*1024); /* mmap threshold */
6271 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* max. number of mmap'ed areas */
6281 malloc_hysteresis
= 32;
6283 malloc_hysteresis
= 0;
6286 refill_memory_reserve ();
6288 ignore_warnings
= 0;
6290 byte_stack_list
= 0;
6292 consing_since_gc
= 0;
6293 gc_cons_threshold
= 100000 * sizeof (Lisp_Object
);
6294 gc_relative_threshold
= 0;
6296 #ifdef VIRT_ADDR_VARIES
6297 malloc_sbrk_unused
= 1<<22; /* A large number */
6298 malloc_sbrk_used
= 100000; /* as reasonable as any number */
6299 #endif /* VIRT_ADDR_VARIES */
6306 byte_stack_list
= 0;
6308 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
6309 setjmp_tested_p
= longjmps_done
= 0;
6312 Vgc_elapsed
= make_float (0.0);
6319 DEFVAR_INT ("gc-cons-threshold", &gc_cons_threshold
,
6320 doc
: /* *Number of bytes of consing between garbage collections.
6321 Garbage collection can happen automatically once this many bytes have been
6322 allocated since the last garbage collection. All data types count.
6324 Garbage collection happens automatically only when `eval' is called.
6326 By binding this temporarily to a large number, you can effectively
6327 prevent garbage collection during a part of the program.
6328 See also `gc-cons-percentage'. */);
6330 DEFVAR_LISP ("gc-cons-percentage", &Vgc_cons_percentage
,
6331 doc
: /* *Portion of the heap used for allocation.
6332 Garbage collection can happen automatically once this portion of the heap
6333 has been allocated since the last garbage collection.
6334 If this portion is smaller than `gc-cons-threshold', this is ignored. */);
6335 Vgc_cons_percentage
= make_float (0.1);
6337 DEFVAR_INT ("pure-bytes-used", &pure_bytes_used
,
6338 doc
: /* Number of bytes of sharable Lisp data allocated so far. */);
6340 DEFVAR_INT ("cons-cells-consed", &cons_cells_consed
,
6341 doc
: /* Number of cons cells that have been consed so far. */);
6343 DEFVAR_INT ("floats-consed", &floats_consed
,
6344 doc
: /* Number of floats that have been consed so far. */);
6346 DEFVAR_INT ("vector-cells-consed", &vector_cells_consed
,
6347 doc
: /* Number of vector cells that have been consed so far. */);
6349 DEFVAR_INT ("symbols-consed", &symbols_consed
,
6350 doc
: /* Number of symbols that have been consed so far. */);
6352 DEFVAR_INT ("string-chars-consed", &string_chars_consed
,
6353 doc
: /* Number of string characters that have been consed so far. */);
6355 DEFVAR_INT ("misc-objects-consed", &misc_objects_consed
,
6356 doc
: /* Number of miscellaneous objects that have been consed so far. */);
6358 DEFVAR_INT ("intervals-consed", &intervals_consed
,
6359 doc
: /* Number of intervals that have been consed so far. */);
6361 DEFVAR_INT ("strings-consed", &strings_consed
,
6362 doc
: /* Number of strings that have been consed so far. */);
6364 DEFVAR_LISP ("purify-flag", &Vpurify_flag
,
6365 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
6366 This means that certain objects should be allocated in shared (pure) space. */);
6368 DEFVAR_BOOL ("garbage-collection-messages", &garbage_collection_messages
,
6369 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
6370 garbage_collection_messages
= 0;
6372 DEFVAR_LISP ("post-gc-hook", &Vpost_gc_hook
,
6373 doc
: /* Hook run after garbage collection has finished. */);
6374 Vpost_gc_hook
= Qnil
;
6375 Qpost_gc_hook
= intern ("post-gc-hook");
6376 staticpro (&Qpost_gc_hook
);
6378 DEFVAR_LISP ("memory-signal-data", &Vmemory_signal_data
,
6379 doc
: /* Precomputed `signal' argument for memory-full error. */);
6380 /* We build this in advance because if we wait until we need it, we might
6381 not be able to allocate the memory to hold it. */
6384 build_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"));
6386 DEFVAR_LISP ("memory-full", &Vmemory_full
,
6387 doc
: /* Non-nil means Emacs cannot get much more Lisp memory. */);
6388 Vmemory_full
= Qnil
;
6390 staticpro (&Qgc_cons_threshold
);
6391 Qgc_cons_threshold
= intern ("gc-cons-threshold");
6393 staticpro (&Qchar_table_extra_slots
);
6394 Qchar_table_extra_slots
= intern ("char-table-extra-slots");
6396 DEFVAR_LISP ("gc-elapsed", &Vgc_elapsed
,
6397 doc
: /* Accumulated time elapsed in garbage collections.
6398 The time is in seconds as a floating point value. */);
6399 DEFVAR_INT ("gcs-done", &gcs_done
,
6400 doc
: /* Accumulated number of garbage collections done. */);
6405 defsubr (&Smake_byte_code
);
6406 defsubr (&Smake_list
);
6407 defsubr (&Smake_vector
);
6408 defsubr (&Smake_string
);
6409 defsubr (&Smake_bool_vector
);
6410 defsubr (&Smake_symbol
);
6411 defsubr (&Smake_marker
);
6412 defsubr (&Spurecopy
);
6413 defsubr (&Sgarbage_collect
);
6414 defsubr (&Smemory_limit
);
6415 defsubr (&Smemory_use_counts
);
6417 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
6418 defsubr (&Sgc_status
);
6422 /* arch-tag: 6695ca10-e3c5-4c2c-8bc3-ed26a7dda857
6423 (do not change this comment) */