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 Free Software Foundation, Inc.
5 This file is part of GNU Emacs.
7 GNU Emacs is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU Emacs is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU Emacs; see the file COPYING. If not, write to
19 the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
20 Boston, MA 02110-1301, USA. */
24 #include <limits.h> /* For CHAR_BIT. */
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"
57 #include "syssignal.h"
60 /* GC_MALLOC_CHECK defined means perform validity checks of malloc'd
61 memory. Can do this only if using gmalloc.c. */
63 #if defined SYSTEM_MALLOC || defined DOUG_LEA_MALLOC
64 #undef GC_MALLOC_CHECK
70 extern POINTER_TYPE
*sbrk ();
74 #define INCLUDED_FCNTL
81 #ifdef DOUG_LEA_MALLOC
84 /* malloc.h #defines this as size_t, at least in glibc2. */
85 #ifndef __malloc_size_t
86 #define __malloc_size_t int
89 /* Specify maximum number of areas to mmap. It would be nice to use a
90 value that explicitly means "no limit". */
92 #define MMAP_MAX_AREAS 100000000
94 #else /* not DOUG_LEA_MALLOC */
96 /* The following come from gmalloc.c. */
98 #define __malloc_size_t size_t
99 extern __malloc_size_t _bytes_used
;
100 extern __malloc_size_t __malloc_extra_blocks
;
102 #endif /* not DOUG_LEA_MALLOC */
104 #if ! defined (SYSTEM_MALLOC) && defined (HAVE_GTK_AND_PTHREAD)
106 /* When GTK uses the file chooser dialog, different backends can be loaded
107 dynamically. One such a backend is the Gnome VFS backend that gets loaded
108 if you run Gnome. That backend creates several threads and also allocates
111 If Emacs sets malloc hooks (! SYSTEM_MALLOC) and the emacs_blocked_*
112 functions below are called from malloc, there is a chance that one
113 of these threads preempts the Emacs main thread and the hook variables
114 end up in an inconsistent state. So we have a mutex to prevent that (note
115 that the backend handles concurrent access to malloc within its own threads
116 but Emacs code running in the main thread is not included in that control).
118 When UNBLOCK_INPUT is called, reinvoke_input_signal may be called. If this
119 happens in one of the backend threads we will have two threads that tries
120 to run Emacs code at once, and the code is not prepared for that.
121 To prevent that, we only call BLOCK/UNBLOCK from the main thread. */
123 static pthread_mutex_t alloc_mutex
;
125 #define BLOCK_INPUT_ALLOC \
128 pthread_mutex_lock (&alloc_mutex); \
129 if (pthread_self () == main_thread) \
133 #define UNBLOCK_INPUT_ALLOC \
136 if (pthread_self () == main_thread) \
138 pthread_mutex_unlock (&alloc_mutex); \
142 #else /* SYSTEM_MALLOC || not HAVE_GTK_AND_PTHREAD */
144 #define BLOCK_INPUT_ALLOC BLOCK_INPUT
145 #define UNBLOCK_INPUT_ALLOC UNBLOCK_INPUT
147 #endif /* SYSTEM_MALLOC || not HAVE_GTK_AND_PTHREAD */
149 /* Value of _bytes_used, when spare_memory was freed. */
151 static __malloc_size_t bytes_used_when_full
;
153 static __malloc_size_t bytes_used_when_reconsidered
;
155 /* Mark, unmark, query mark bit of a Lisp string. S must be a pointer
156 to a struct Lisp_String. */
158 #define MARK_STRING(S) ((S)->size |= ARRAY_MARK_FLAG)
159 #define UNMARK_STRING(S) ((S)->size &= ~ARRAY_MARK_FLAG)
160 #define STRING_MARKED_P(S) (((S)->size & ARRAY_MARK_FLAG) != 0)
162 #define VECTOR_MARK(V) ((V)->size |= ARRAY_MARK_FLAG)
163 #define VECTOR_UNMARK(V) ((V)->size &= ~ARRAY_MARK_FLAG)
164 #define VECTOR_MARKED_P(V) (((V)->size & ARRAY_MARK_FLAG) != 0)
166 /* Value is the number of bytes/chars of S, a pointer to a struct
167 Lisp_String. This must be used instead of STRING_BYTES (S) or
168 S->size during GC, because S->size contains the mark bit for
171 #define GC_STRING_BYTES(S) (STRING_BYTES (S))
172 #define GC_STRING_CHARS(S) ((S)->size & ~ARRAY_MARK_FLAG)
174 /* Number of bytes of consing done since the last gc. */
176 int consing_since_gc
;
178 /* Count the amount of consing of various sorts of space. */
180 EMACS_INT cons_cells_consed
;
181 EMACS_INT floats_consed
;
182 EMACS_INT vector_cells_consed
;
183 EMACS_INT symbols_consed
;
184 EMACS_INT string_chars_consed
;
185 EMACS_INT misc_objects_consed
;
186 EMACS_INT intervals_consed
;
187 EMACS_INT strings_consed
;
189 /* Minimum number of bytes of consing since GC before next GC. */
191 EMACS_INT gc_cons_threshold
;
193 /* Similar minimum, computed from Vgc_cons_percentage. */
195 EMACS_INT gc_relative_threshold
;
197 static Lisp_Object Vgc_cons_percentage
;
199 /* Minimum number of bytes of consing since GC before next GC,
200 when memory is full. */
202 EMACS_INT memory_full_cons_threshold
;
204 /* Nonzero during GC. */
208 /* Nonzero means abort if try to GC.
209 This is for code which is written on the assumption that
210 no GC will happen, so as to verify that assumption. */
214 /* Nonzero means display messages at beginning and end of GC. */
216 int garbage_collection_messages
;
218 #ifndef VIRT_ADDR_VARIES
220 #endif /* VIRT_ADDR_VARIES */
221 int malloc_sbrk_used
;
223 #ifndef VIRT_ADDR_VARIES
225 #endif /* VIRT_ADDR_VARIES */
226 int malloc_sbrk_unused
;
228 /* Number of live and free conses etc. */
230 static int total_conses
, total_markers
, total_symbols
, total_vector_size
;
231 static int total_free_conses
, total_free_markers
, total_free_symbols
;
232 static int total_free_floats
, total_floats
;
234 /* Points to memory space allocated as "spare", to be freed if we run
235 out of memory. We keep one large block, four cons-blocks, and
236 two string blocks. */
238 char *spare_memory
[7];
240 /* Amount of spare memory to keep in large reserve block. */
242 #define SPARE_MEMORY (1 << 14)
244 /* Number of extra blocks malloc should get when it needs more core. */
246 static int malloc_hysteresis
;
248 /* Non-nil means defun should do purecopy on the function definition. */
250 Lisp_Object Vpurify_flag
;
252 /* Non-nil means we are handling a memory-full error. */
254 Lisp_Object Vmemory_full
;
258 /* Initialize it to a nonzero value to force it into data space
259 (rather than bss space). That way unexec will remap it into text
260 space (pure), on some systems. We have not implemented the
261 remapping on more recent systems because this is less important
262 nowadays than in the days of small memories and timesharing. */
264 EMACS_INT pure
[PURESIZE
/ sizeof (EMACS_INT
)] = {1,};
265 #define PUREBEG (char *) pure
269 #define pure PURE_SEG_BITS /* Use shared memory segment */
270 #define PUREBEG (char *)PURE_SEG_BITS
272 #endif /* HAVE_SHM */
274 /* Pointer to the pure area, and its size. */
276 static char *purebeg
;
277 static size_t pure_size
;
279 /* Number of bytes of pure storage used before pure storage overflowed.
280 If this is non-zero, this implies that an overflow occurred. */
282 static size_t pure_bytes_used_before_overflow
;
284 /* Value is non-zero if P points into pure space. */
286 #define PURE_POINTER_P(P) \
287 (((PNTR_COMPARISON_TYPE) (P) \
288 < (PNTR_COMPARISON_TYPE) ((char *) purebeg + pure_size)) \
289 && ((PNTR_COMPARISON_TYPE) (P) \
290 >= (PNTR_COMPARISON_TYPE) purebeg))
292 /* Index in pure at which next pure object will be allocated.. */
294 EMACS_INT pure_bytes_used
;
296 /* If nonzero, this is a warning delivered by malloc and not yet
299 char *pending_malloc_warning
;
301 /* Pre-computed signal argument for use when memory is exhausted. */
303 Lisp_Object Vmemory_signal_data
;
305 /* Maximum amount of C stack to save when a GC happens. */
307 #ifndef MAX_SAVE_STACK
308 #define MAX_SAVE_STACK 16000
311 /* Buffer in which we save a copy of the C stack at each GC. */
316 /* Non-zero means ignore malloc warnings. Set during initialization.
317 Currently not used. */
321 Lisp_Object Qgc_cons_threshold
, Qchar_table_extra_slots
;
323 /* Hook run after GC has finished. */
325 Lisp_Object Vpost_gc_hook
, Qpost_gc_hook
;
327 Lisp_Object Vgc_elapsed
; /* accumulated elapsed time in GC */
328 EMACS_INT gcs_done
; /* accumulated GCs */
330 static void mark_buffer
P_ ((Lisp_Object
));
331 extern void mark_kboards
P_ ((void));
332 extern void mark_backtrace
P_ ((void));
333 static void gc_sweep
P_ ((void));
334 static void mark_glyph_matrix
P_ ((struct glyph_matrix
*));
335 static void mark_face_cache
P_ ((struct face_cache
*));
337 #ifdef HAVE_WINDOW_SYSTEM
338 extern void mark_fringe_data
P_ ((void));
339 static void mark_image
P_ ((struct image
*));
340 static void mark_image_cache
P_ ((struct frame
*));
341 #endif /* HAVE_WINDOW_SYSTEM */
343 static struct Lisp_String
*allocate_string
P_ ((void));
344 static void compact_small_strings
P_ ((void));
345 static void free_large_strings
P_ ((void));
346 static void sweep_strings
P_ ((void));
348 extern int message_enable_multibyte
;
350 /* When scanning the C stack for live Lisp objects, Emacs keeps track
351 of what memory allocated via lisp_malloc is intended for what
352 purpose. This enumeration specifies the type of memory. */
363 /* Keep the following vector-like types together, with
364 MEM_TYPE_WINDOW being the last, and MEM_TYPE_VECTOR the
365 first. Or change the code of live_vector_p, for instance. */
373 static POINTER_TYPE
*lisp_align_malloc
P_ ((size_t, enum mem_type
));
374 static POINTER_TYPE
*lisp_malloc
P_ ((size_t, enum mem_type
));
375 void refill_memory_reserve ();
378 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
380 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
381 #include <stdio.h> /* For fprintf. */
384 /* A unique object in pure space used to make some Lisp objects
385 on free lists recognizable in O(1). */
389 #ifdef GC_MALLOC_CHECK
391 enum mem_type allocated_mem_type
;
392 int dont_register_blocks
;
394 #endif /* GC_MALLOC_CHECK */
396 /* A node in the red-black tree describing allocated memory containing
397 Lisp data. Each such block is recorded with its start and end
398 address when it is allocated, and removed from the tree when it
401 A red-black tree is a balanced binary tree with the following
404 1. Every node is either red or black.
405 2. Every leaf is black.
406 3. If a node is red, then both of its children are black.
407 4. Every simple path from a node to a descendant leaf contains
408 the same number of black nodes.
409 5. The root is always black.
411 When nodes are inserted into the tree, or deleted from the tree,
412 the tree is "fixed" so that these properties are always true.
414 A red-black tree with N internal nodes has height at most 2
415 log(N+1). Searches, insertions and deletions are done in O(log N).
416 Please see a text book about data structures for a detailed
417 description of red-black trees. Any book worth its salt should
422 /* Children of this node. These pointers are never NULL. When there
423 is no child, the value is MEM_NIL, which points to a dummy node. */
424 struct mem_node
*left
, *right
;
426 /* The parent of this node. In the root node, this is NULL. */
427 struct mem_node
*parent
;
429 /* Start and end of allocated region. */
433 enum {MEM_BLACK
, MEM_RED
} color
;
439 /* Base address of stack. Set in main. */
441 Lisp_Object
*stack_base
;
443 /* Root of the tree describing allocated Lisp memory. */
445 static struct mem_node
*mem_root
;
447 /* Lowest and highest known address in the heap. */
449 static void *min_heap_address
, *max_heap_address
;
451 /* Sentinel node of the tree. */
453 static struct mem_node mem_z
;
454 #define MEM_NIL &mem_z
456 static POINTER_TYPE
*lisp_malloc
P_ ((size_t, enum mem_type
));
457 static struct Lisp_Vector
*allocate_vectorlike
P_ ((EMACS_INT
, enum mem_type
));
458 static void lisp_free
P_ ((POINTER_TYPE
*));
459 static void mark_stack
P_ ((void));
460 static int live_vector_p
P_ ((struct mem_node
*, void *));
461 static int live_buffer_p
P_ ((struct mem_node
*, void *));
462 static int live_string_p
P_ ((struct mem_node
*, void *));
463 static int live_cons_p
P_ ((struct mem_node
*, void *));
464 static int live_symbol_p
P_ ((struct mem_node
*, void *));
465 static int live_float_p
P_ ((struct mem_node
*, void *));
466 static int live_misc_p
P_ ((struct mem_node
*, void *));
467 static void mark_maybe_object
P_ ((Lisp_Object
));
468 static void mark_memory
P_ ((void *, void *));
469 static void mem_init
P_ ((void));
470 static struct mem_node
*mem_insert
P_ ((void *, void *, enum mem_type
));
471 static void mem_insert_fixup
P_ ((struct mem_node
*));
472 static void mem_rotate_left
P_ ((struct mem_node
*));
473 static void mem_rotate_right
P_ ((struct mem_node
*));
474 static void mem_delete
P_ ((struct mem_node
*));
475 static void mem_delete_fixup
P_ ((struct mem_node
*));
476 static INLINE
struct mem_node
*mem_find
P_ ((void *));
479 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
480 static void check_gcpros
P_ ((void));
483 #endif /* GC_MARK_STACK || GC_MALLOC_CHECK */
485 /* Recording what needs to be marked for gc. */
487 struct gcpro
*gcprolist
;
489 /* Addresses of staticpro'd variables. Initialize it to a nonzero
490 value; otherwise some compilers put it into BSS. */
492 #define NSTATICS 1280
493 Lisp_Object
*staticvec
[NSTATICS
] = {&Vpurify_flag
};
495 /* Index of next unused slot in staticvec. */
499 static POINTER_TYPE
*pure_alloc
P_ ((size_t, int));
502 /* Value is SZ rounded up to the next multiple of ALIGNMENT.
503 ALIGNMENT must be a power of 2. */
505 #define ALIGN(ptr, ALIGNMENT) \
506 ((POINTER_TYPE *) ((((EMACS_UINT)(ptr)) + (ALIGNMENT) - 1) \
507 & ~((ALIGNMENT) - 1)))
511 /************************************************************************
513 ************************************************************************/
515 /* Function malloc calls this if it finds we are near exhausting storage. */
521 pending_malloc_warning
= str
;
525 /* Display an already-pending malloc warning. */
528 display_malloc_warning ()
530 call3 (intern ("display-warning"),
532 build_string (pending_malloc_warning
),
533 intern ("emergency"));
534 pending_malloc_warning
= 0;
538 #ifdef DOUG_LEA_MALLOC
539 # define BYTES_USED (mallinfo ().uordblks)
541 # define BYTES_USED _bytes_used
544 /* Called if we can't allocate relocatable space for a buffer. */
547 buffer_memory_full ()
549 /* If buffers use the relocating allocator, no need to free
550 spare_memory, because we may have plenty of malloc space left
551 that we could get, and if we don't, the malloc that fails will
552 itself cause spare_memory to be freed. If buffers don't use the
553 relocating allocator, treat this like any other failing
560 /* This used to call error, but if we've run out of memory, we could
561 get infinite recursion trying to build the string. */
563 Fsignal (Qnil
, Vmemory_signal_data
);
567 #ifdef XMALLOC_OVERRUN_CHECK
569 /* Check for overrun in malloc'ed buffers by wrapping a 16 byte header
570 and a 16 byte trailer around each block.
572 The header consists of 12 fixed bytes + a 4 byte integer contaning the
573 original block size, while the trailer consists of 16 fixed bytes.
575 The header is used to detect whether this block has been allocated
576 through these functions -- as it seems that some low-level libc
577 functions may bypass the malloc hooks.
581 #define XMALLOC_OVERRUN_CHECK_SIZE 16
583 static char xmalloc_overrun_check_header
[XMALLOC_OVERRUN_CHECK_SIZE
-4] =
584 { 0x9a, 0x9b, 0xae, 0xaf,
585 0xbf, 0xbe, 0xce, 0xcf,
586 0xea, 0xeb, 0xec, 0xed };
588 static char xmalloc_overrun_check_trailer
[XMALLOC_OVERRUN_CHECK_SIZE
] =
589 { 0xaa, 0xab, 0xac, 0xad,
590 0xba, 0xbb, 0xbc, 0xbd,
591 0xca, 0xcb, 0xcc, 0xcd,
592 0xda, 0xdb, 0xdc, 0xdd };
594 /* Macros to insert and extract the block size in the header. */
596 #define XMALLOC_PUT_SIZE(ptr, size) \
597 (ptr[-1] = (size & 0xff), \
598 ptr[-2] = ((size >> 8) & 0xff), \
599 ptr[-3] = ((size >> 16) & 0xff), \
600 ptr[-4] = ((size >> 24) & 0xff))
602 #define XMALLOC_GET_SIZE(ptr) \
603 (size_t)((unsigned)(ptr[-1]) | \
604 ((unsigned)(ptr[-2]) << 8) | \
605 ((unsigned)(ptr[-3]) << 16) | \
606 ((unsigned)(ptr[-4]) << 24))
609 /* The call depth in overrun_check functions. For example, this might happen:
611 overrun_check_malloc()
612 -> malloc -> (via hook)_-> emacs_blocked_malloc
613 -> overrun_check_malloc
614 call malloc (hooks are NULL, so real malloc is called).
615 malloc returns 10000.
616 add overhead, return 10016.
617 <- (back in overrun_check_malloc)
618 add overhead again, return 10032
619 xmalloc returns 10032.
624 overrun_check_free(10032)
626 free(10016) <- crash, because 10000 is the original pointer. */
628 static int check_depth
;
630 /* Like malloc, but wraps allocated block with header and trailer. */
633 overrun_check_malloc (size
)
636 register unsigned char *val
;
637 size_t overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_SIZE
*2 : 0;
639 val
= (unsigned char *) malloc (size
+ overhead
);
640 if (val
&& check_depth
== 1)
642 bcopy (xmalloc_overrun_check_header
, val
, XMALLOC_OVERRUN_CHECK_SIZE
- 4);
643 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
644 XMALLOC_PUT_SIZE(val
, size
);
645 bcopy (xmalloc_overrun_check_trailer
, val
+ size
, XMALLOC_OVERRUN_CHECK_SIZE
);
648 return (POINTER_TYPE
*)val
;
652 /* Like realloc, but checks old block for overrun, and wraps new block
653 with header and trailer. */
656 overrun_check_realloc (block
, size
)
660 register unsigned char *val
= (unsigned char *)block
;
661 size_t overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_SIZE
*2 : 0;
665 && bcmp (xmalloc_overrun_check_header
,
666 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
667 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
669 size_t osize
= XMALLOC_GET_SIZE (val
);
670 if (bcmp (xmalloc_overrun_check_trailer
,
672 XMALLOC_OVERRUN_CHECK_SIZE
))
674 bzero (val
+ osize
, XMALLOC_OVERRUN_CHECK_SIZE
);
675 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
676 bzero (val
, XMALLOC_OVERRUN_CHECK_SIZE
);
679 val
= (unsigned char *) realloc ((POINTER_TYPE
*)val
, size
+ overhead
);
681 if (val
&& check_depth
== 1)
683 bcopy (xmalloc_overrun_check_header
, val
, XMALLOC_OVERRUN_CHECK_SIZE
- 4);
684 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
685 XMALLOC_PUT_SIZE(val
, size
);
686 bcopy (xmalloc_overrun_check_trailer
, val
+ size
, XMALLOC_OVERRUN_CHECK_SIZE
);
689 return (POINTER_TYPE
*)val
;
692 /* Like free, but checks block for overrun. */
695 overrun_check_free (block
)
698 unsigned char *val
= (unsigned char *)block
;
703 && bcmp (xmalloc_overrun_check_header
,
704 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
705 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
707 size_t osize
= XMALLOC_GET_SIZE (val
);
708 if (bcmp (xmalloc_overrun_check_trailer
,
710 XMALLOC_OVERRUN_CHECK_SIZE
))
712 #ifdef XMALLOC_CLEAR_FREE_MEMORY
713 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
714 memset (val
, 0xff, osize
+ XMALLOC_OVERRUN_CHECK_SIZE
*2);
716 bzero (val
+ osize
, XMALLOC_OVERRUN_CHECK_SIZE
);
717 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
718 bzero (val
, XMALLOC_OVERRUN_CHECK_SIZE
);
729 #define malloc overrun_check_malloc
730 #define realloc overrun_check_realloc
731 #define free overrun_check_free
735 /* Like malloc but check for no memory and block interrupt input.. */
741 register POINTER_TYPE
*val
;
744 val
= (POINTER_TYPE
*) malloc (size
);
753 /* Like realloc but check for no memory and block interrupt input.. */
756 xrealloc (block
, size
)
760 register POINTER_TYPE
*val
;
763 /* We must call malloc explicitly when BLOCK is 0, since some
764 reallocs don't do this. */
766 val
= (POINTER_TYPE
*) malloc (size
);
768 val
= (POINTER_TYPE
*) realloc (block
, size
);
771 if (!val
&& size
) memory_full ();
776 /* Like free but block interrupt input. */
785 /* We don't call refill_memory_reserve here
786 because that duplicates doing so in emacs_blocked_free
787 and the criterion should go there. */
791 /* Like strdup, but uses xmalloc. */
797 size_t len
= strlen (s
) + 1;
798 char *p
= (char *) xmalloc (len
);
804 /* Unwind for SAFE_ALLOCA */
807 safe_alloca_unwind (arg
)
810 register struct Lisp_Save_Value
*p
= XSAVE_VALUE (arg
);
820 /* Like malloc but used for allocating Lisp data. NBYTES is the
821 number of bytes to allocate, TYPE describes the intended use of the
822 allcated memory block (for strings, for conses, ...). */
825 static void *lisp_malloc_loser
;
828 static POINTER_TYPE
*
829 lisp_malloc (nbytes
, type
)
837 #ifdef GC_MALLOC_CHECK
838 allocated_mem_type
= type
;
841 val
= (void *) malloc (nbytes
);
844 /* If the memory just allocated cannot be addressed thru a Lisp
845 object's pointer, and it needs to be,
846 that's equivalent to running out of memory. */
847 if (val
&& type
!= MEM_TYPE_NON_LISP
)
850 XSETCONS (tem
, (char *) val
+ nbytes
- 1);
851 if ((char *) XCONS (tem
) != (char *) val
+ nbytes
- 1)
853 lisp_malloc_loser
= val
;
860 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
861 if (val
&& type
!= MEM_TYPE_NON_LISP
)
862 mem_insert (val
, (char *) val
+ nbytes
, type
);
871 /* Free BLOCK. This must be called to free memory allocated with a
872 call to lisp_malloc. */
880 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
881 mem_delete (mem_find (block
));
886 /* Allocation of aligned blocks of memory to store Lisp data. */
887 /* The entry point is lisp_align_malloc which returns blocks of at most */
888 /* BLOCK_BYTES and guarantees they are aligned on a BLOCK_ALIGN boundary. */
890 /* Use posix_memalloc if the system has it and we're using the system's
891 malloc (because our gmalloc.c routines don't have posix_memalign although
892 its memalloc could be used). */
893 #if defined (HAVE_POSIX_MEMALIGN) && defined (SYSTEM_MALLOC)
894 #define USE_POSIX_MEMALIGN 1
897 /* BLOCK_ALIGN has to be a power of 2. */
898 #define BLOCK_ALIGN (1 << 10)
900 /* Padding to leave at the end of a malloc'd block. This is to give
901 malloc a chance to minimize the amount of memory wasted to alignment.
902 It should be tuned to the particular malloc library used.
903 On glibc-2.3.2, malloc never tries to align, so a padding of 0 is best.
904 posix_memalign on the other hand would ideally prefer a value of 4
905 because otherwise, there's 1020 bytes wasted between each ablocks.
906 In Emacs, testing shows that those 1020 can most of the time be
907 efficiently used by malloc to place other objects, so a value of 0 can
908 still preferable unless you have a lot of aligned blocks and virtually
910 #define BLOCK_PADDING 0
911 #define BLOCK_BYTES \
912 (BLOCK_ALIGN - sizeof (struct ablock *) - BLOCK_PADDING)
914 /* Internal data structures and constants. */
916 #define ABLOCKS_SIZE 16
918 /* An aligned block of memory. */
923 char payload
[BLOCK_BYTES
];
924 struct ablock
*next_free
;
926 /* `abase' is the aligned base of the ablocks. */
927 /* It is overloaded to hold the virtual `busy' field that counts
928 the number of used ablock in the parent ablocks.
929 The first ablock has the `busy' field, the others have the `abase'
930 field. To tell the difference, we assume that pointers will have
931 integer values larger than 2 * ABLOCKS_SIZE. The lowest bit of `busy'
932 is used to tell whether the real base of the parent ablocks is `abase'
933 (if not, the word before the first ablock holds a pointer to the
935 struct ablocks
*abase
;
936 /* The padding of all but the last ablock is unused. The padding of
937 the last ablock in an ablocks is not allocated. */
939 char padding
[BLOCK_PADDING
];
943 /* A bunch of consecutive aligned blocks. */
946 struct ablock blocks
[ABLOCKS_SIZE
];
949 /* Size of the block requested from malloc or memalign. */
950 #define ABLOCKS_BYTES (sizeof (struct ablocks) - BLOCK_PADDING)
952 #define ABLOCK_ABASE(block) \
953 (((unsigned long) (block)->abase) <= (1 + 2 * ABLOCKS_SIZE) \
954 ? (struct ablocks *)(block) \
957 /* Virtual `busy' field. */
958 #define ABLOCKS_BUSY(abase) ((abase)->blocks[0].abase)
960 /* Pointer to the (not necessarily aligned) malloc block. */
961 #ifdef USE_POSIX_MEMALIGN
962 #define ABLOCKS_BASE(abase) (abase)
964 #define ABLOCKS_BASE(abase) \
965 (1 & (long) ABLOCKS_BUSY (abase) ? abase : ((void**)abase)[-1])
968 /* The list of free ablock. */
969 static struct ablock
*free_ablock
;
971 /* Allocate an aligned block of nbytes.
972 Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be
973 smaller or equal to BLOCK_BYTES. */
974 static POINTER_TYPE
*
975 lisp_align_malloc (nbytes
, type
)
980 struct ablocks
*abase
;
982 eassert (nbytes
<= BLOCK_BYTES
);
986 #ifdef GC_MALLOC_CHECK
987 allocated_mem_type
= type
;
993 EMACS_INT aligned
; /* int gets warning casting to 64-bit pointer. */
995 #ifdef DOUG_LEA_MALLOC
996 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
997 because mapped region contents are not preserved in
999 mallopt (M_MMAP_MAX
, 0);
1002 #ifdef USE_POSIX_MEMALIGN
1004 int err
= posix_memalign (&base
, BLOCK_ALIGN
, ABLOCKS_BYTES
);
1010 base
= malloc (ABLOCKS_BYTES
);
1011 abase
= ALIGN (base
, BLOCK_ALIGN
);
1020 aligned
= (base
== abase
);
1022 ((void**)abase
)[-1] = base
;
1024 #ifdef DOUG_LEA_MALLOC
1025 /* Back to a reasonable maximum of mmap'ed areas. */
1026 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1030 /* If the memory just allocated cannot be addressed thru a Lisp
1031 object's pointer, and it needs to be, that's equivalent to
1032 running out of memory. */
1033 if (type
!= MEM_TYPE_NON_LISP
)
1036 char *end
= (char *) base
+ ABLOCKS_BYTES
- 1;
1037 XSETCONS (tem
, end
);
1038 if ((char *) XCONS (tem
) != end
)
1040 lisp_malloc_loser
= base
;
1048 /* Initialize the blocks and put them on the free list.
1049 Is `base' was not properly aligned, we can't use the last block. */
1050 for (i
= 0; i
< (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1); i
++)
1052 abase
->blocks
[i
].abase
= abase
;
1053 abase
->blocks
[i
].x
.next_free
= free_ablock
;
1054 free_ablock
= &abase
->blocks
[i
];
1056 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (long) aligned
;
1058 eassert (0 == ((EMACS_UINT
)abase
) % BLOCK_ALIGN
);
1059 eassert (ABLOCK_ABASE (&abase
->blocks
[3]) == abase
); /* 3 is arbitrary */
1060 eassert (ABLOCK_ABASE (&abase
->blocks
[0]) == abase
);
1061 eassert (ABLOCKS_BASE (abase
) == base
);
1062 eassert (aligned
== (long) ABLOCKS_BUSY (abase
));
1065 abase
= ABLOCK_ABASE (free_ablock
);
1066 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (2 + (long) ABLOCKS_BUSY (abase
));
1068 free_ablock
= free_ablock
->x
.next_free
;
1070 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1071 if (val
&& type
!= MEM_TYPE_NON_LISP
)
1072 mem_insert (val
, (char *) val
+ nbytes
, type
);
1079 eassert (0 == ((EMACS_UINT
)val
) % BLOCK_ALIGN
);
1084 lisp_align_free (block
)
1085 POINTER_TYPE
*block
;
1087 struct ablock
*ablock
= block
;
1088 struct ablocks
*abase
= ABLOCK_ABASE (ablock
);
1091 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1092 mem_delete (mem_find (block
));
1094 /* Put on free list. */
1095 ablock
->x
.next_free
= free_ablock
;
1096 free_ablock
= ablock
;
1097 /* Update busy count. */
1098 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (-2 + (long) ABLOCKS_BUSY (abase
));
1100 if (2 > (long) ABLOCKS_BUSY (abase
))
1101 { /* All the blocks are free. */
1102 int i
= 0, aligned
= (long) ABLOCKS_BUSY (abase
);
1103 struct ablock
**tem
= &free_ablock
;
1104 struct ablock
*atop
= &abase
->blocks
[aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1];
1108 if (*tem
>= (struct ablock
*) abase
&& *tem
< atop
)
1111 *tem
= (*tem
)->x
.next_free
;
1114 tem
= &(*tem
)->x
.next_free
;
1116 eassert ((aligned
& 1) == aligned
);
1117 eassert (i
== (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1));
1118 #ifdef USE_POSIX_MEMALIGN
1119 eassert ((unsigned long)ABLOCKS_BASE (abase
) % BLOCK_ALIGN
== 0);
1121 free (ABLOCKS_BASE (abase
));
1126 /* Return a new buffer structure allocated from the heap with
1127 a call to lisp_malloc. */
1133 = (struct buffer
*) lisp_malloc (sizeof (struct buffer
),
1139 #ifndef SYSTEM_MALLOC
1141 /* Arranging to disable input signals while we're in malloc.
1143 This only works with GNU malloc. To help out systems which can't
1144 use GNU malloc, all the calls to malloc, realloc, and free
1145 elsewhere in the code should be inside a BLOCK_INPUT/UNBLOCK_INPUT
1146 pair; unfortunately, we have no idea what C library functions
1147 might call malloc, so we can't really protect them unless you're
1148 using GNU malloc. Fortunately, most of the major operating systems
1149 can use GNU malloc. */
1153 #ifndef DOUG_LEA_MALLOC
1154 extern void * (*__malloc_hook
) P_ ((size_t, const void *));
1155 extern void * (*__realloc_hook
) P_ ((void *, size_t, const void *));
1156 extern void (*__free_hook
) P_ ((void *, const void *));
1157 /* Else declared in malloc.h, perhaps with an extra arg. */
1158 #endif /* DOUG_LEA_MALLOC */
1159 static void * (*old_malloc_hook
) P_ ((size_t, const void *));
1160 static void * (*old_realloc_hook
) P_ ((void *, size_t, const void*));
1161 static void (*old_free_hook
) P_ ((void*, const void*));
1163 /* This function is used as the hook for free to call. */
1166 emacs_blocked_free (ptr
, ptr2
)
1170 EMACS_INT bytes_used_now
;
1174 #ifdef GC_MALLOC_CHECK
1180 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1183 "Freeing `%p' which wasn't allocated with malloc\n", ptr
);
1188 /* fprintf (stderr, "free %p...%p (%p)\n", m->start, m->end, ptr); */
1192 #endif /* GC_MALLOC_CHECK */
1194 __free_hook
= old_free_hook
;
1197 /* If we released our reserve (due to running out of memory),
1198 and we have a fair amount free once again,
1199 try to set aside another reserve in case we run out once more. */
1200 if (! NILP (Vmemory_full
)
1201 /* Verify there is enough space that even with the malloc
1202 hysteresis this call won't run out again.
1203 The code here is correct as long as SPARE_MEMORY
1204 is substantially larger than the block size malloc uses. */
1205 && (bytes_used_when_full
1206 > ((bytes_used_when_reconsidered
= BYTES_USED
)
1207 + max (malloc_hysteresis
, 4) * SPARE_MEMORY
)))
1208 refill_memory_reserve ();
1210 __free_hook
= emacs_blocked_free
;
1211 UNBLOCK_INPUT_ALLOC
;
1215 /* This function is the malloc hook that Emacs uses. */
1218 emacs_blocked_malloc (size
, ptr
)
1225 __malloc_hook
= old_malloc_hook
;
1226 #ifdef DOUG_LEA_MALLOC
1227 mallopt (M_TOP_PAD
, malloc_hysteresis
* 4096);
1229 __malloc_extra_blocks
= malloc_hysteresis
;
1232 value
= (void *) malloc (size
);
1234 #ifdef GC_MALLOC_CHECK
1236 struct mem_node
*m
= mem_find (value
);
1239 fprintf (stderr
, "Malloc returned %p which is already in use\n",
1241 fprintf (stderr
, "Region in use is %p...%p, %u bytes, type %d\n",
1242 m
->start
, m
->end
, (char *) m
->end
- (char *) m
->start
,
1247 if (!dont_register_blocks
)
1249 mem_insert (value
, (char *) value
+ max (1, size
), allocated_mem_type
);
1250 allocated_mem_type
= MEM_TYPE_NON_LISP
;
1253 #endif /* GC_MALLOC_CHECK */
1255 __malloc_hook
= emacs_blocked_malloc
;
1256 UNBLOCK_INPUT_ALLOC
;
1258 /* fprintf (stderr, "%p malloc\n", value); */
1263 /* This function is the realloc hook that Emacs uses. */
1266 emacs_blocked_realloc (ptr
, size
, ptr2
)
1274 __realloc_hook
= old_realloc_hook
;
1276 #ifdef GC_MALLOC_CHECK
1279 struct mem_node
*m
= mem_find (ptr
);
1280 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1283 "Realloc of %p which wasn't allocated with malloc\n",
1291 /* fprintf (stderr, "%p -> realloc\n", ptr); */
1293 /* Prevent malloc from registering blocks. */
1294 dont_register_blocks
= 1;
1295 #endif /* GC_MALLOC_CHECK */
1297 value
= (void *) realloc (ptr
, size
);
1299 #ifdef GC_MALLOC_CHECK
1300 dont_register_blocks
= 0;
1303 struct mem_node
*m
= mem_find (value
);
1306 fprintf (stderr
, "Realloc returns memory that is already in use\n");
1310 /* Can't handle zero size regions in the red-black tree. */
1311 mem_insert (value
, (char *) value
+ max (size
, 1), MEM_TYPE_NON_LISP
);
1314 /* fprintf (stderr, "%p <- realloc\n", value); */
1315 #endif /* GC_MALLOC_CHECK */
1317 __realloc_hook
= emacs_blocked_realloc
;
1318 UNBLOCK_INPUT_ALLOC
;
1324 #ifdef HAVE_GTK_AND_PTHREAD
1325 /* Called from Fdump_emacs so that when the dumped Emacs starts, it has a
1326 normal malloc. Some thread implementations need this as they call
1327 malloc before main. The pthread_self call in BLOCK_INPUT_ALLOC then
1328 calls malloc because it is the first call, and we have an endless loop. */
1331 reset_malloc_hooks ()
1337 #endif /* HAVE_GTK_AND_PTHREAD */
1340 /* Called from main to set up malloc to use our hooks. */
1343 uninterrupt_malloc ()
1345 #ifdef HAVE_GTK_AND_PTHREAD
1346 pthread_mutexattr_t attr
;
1348 /* GLIBC has a faster way to do this, but lets keep it portable.
1349 This is according to the Single UNIX Specification. */
1350 pthread_mutexattr_init (&attr
);
1351 pthread_mutexattr_settype (&attr
, PTHREAD_MUTEX_RECURSIVE
);
1352 pthread_mutex_init (&alloc_mutex
, &attr
);
1353 #endif /* HAVE_GTK_AND_PTHREAD */
1355 if (__free_hook
!= emacs_blocked_free
)
1356 old_free_hook
= __free_hook
;
1357 __free_hook
= emacs_blocked_free
;
1359 if (__malloc_hook
!= emacs_blocked_malloc
)
1360 old_malloc_hook
= __malloc_hook
;
1361 __malloc_hook
= emacs_blocked_malloc
;
1363 if (__realloc_hook
!= emacs_blocked_realloc
)
1364 old_realloc_hook
= __realloc_hook
;
1365 __realloc_hook
= emacs_blocked_realloc
;
1368 #endif /* not SYNC_INPUT */
1369 #endif /* not SYSTEM_MALLOC */
1373 /***********************************************************************
1375 ***********************************************************************/
1377 /* Number of intervals allocated in an interval_block structure.
1378 The 1020 is 1024 minus malloc overhead. */
1380 #define INTERVAL_BLOCK_SIZE \
1381 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
1383 /* Intervals are allocated in chunks in form of an interval_block
1386 struct interval_block
1388 /* Place `intervals' first, to preserve alignment. */
1389 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
1390 struct interval_block
*next
;
1393 /* Current interval block. Its `next' pointer points to older
1396 struct interval_block
*interval_block
;
1398 /* Index in interval_block above of the next unused interval
1401 static int interval_block_index
;
1403 /* Number of free and live intervals. */
1405 static int total_free_intervals
, total_intervals
;
1407 /* List of free intervals. */
1409 INTERVAL interval_free_list
;
1411 /* Total number of interval blocks now in use. */
1413 int n_interval_blocks
;
1416 /* Initialize interval allocation. */
1421 interval_block
= NULL
;
1422 interval_block_index
= INTERVAL_BLOCK_SIZE
;
1423 interval_free_list
= 0;
1424 n_interval_blocks
= 0;
1428 /* Return a new interval. */
1435 /* eassert (!handling_signal); */
1441 if (interval_free_list
)
1443 val
= interval_free_list
;
1444 interval_free_list
= INTERVAL_PARENT (interval_free_list
);
1448 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
1450 register struct interval_block
*newi
;
1452 newi
= (struct interval_block
*) lisp_malloc (sizeof *newi
,
1455 newi
->next
= interval_block
;
1456 interval_block
= newi
;
1457 interval_block_index
= 0;
1458 n_interval_blocks
++;
1460 val
= &interval_block
->intervals
[interval_block_index
++];
1467 consing_since_gc
+= sizeof (struct interval
);
1469 RESET_INTERVAL (val
);
1475 /* Mark Lisp objects in interval I. */
1478 mark_interval (i
, dummy
)
1479 register INTERVAL i
;
1482 eassert (!i
->gcmarkbit
); /* Intervals are never shared. */
1484 mark_object (i
->plist
);
1488 /* Mark the interval tree rooted in TREE. Don't call this directly;
1489 use the macro MARK_INTERVAL_TREE instead. */
1492 mark_interval_tree (tree
)
1493 register INTERVAL tree
;
1495 /* No need to test if this tree has been marked already; this
1496 function is always called through the MARK_INTERVAL_TREE macro,
1497 which takes care of that. */
1499 traverse_intervals_noorder (tree
, mark_interval
, Qnil
);
1503 /* Mark the interval tree rooted in I. */
1505 #define MARK_INTERVAL_TREE(i) \
1507 if (!NULL_INTERVAL_P (i) && !i->gcmarkbit) \
1508 mark_interval_tree (i); \
1512 #define UNMARK_BALANCE_INTERVALS(i) \
1514 if (! NULL_INTERVAL_P (i)) \
1515 (i) = balance_intervals (i); \
1519 /* Number support. If NO_UNION_TYPE isn't in effect, we
1520 can't create number objects in macros. */
1528 obj
.s
.type
= Lisp_Int
;
1533 /***********************************************************************
1535 ***********************************************************************/
1537 /* Lisp_Strings are allocated in string_block structures. When a new
1538 string_block is allocated, all the Lisp_Strings it contains are
1539 added to a free-list string_free_list. When a new Lisp_String is
1540 needed, it is taken from that list. During the sweep phase of GC,
1541 string_blocks that are entirely free are freed, except two which
1544 String data is allocated from sblock structures. Strings larger
1545 than LARGE_STRING_BYTES, get their own sblock, data for smaller
1546 strings is sub-allocated out of sblocks of size SBLOCK_SIZE.
1548 Sblocks consist internally of sdata structures, one for each
1549 Lisp_String. The sdata structure points to the Lisp_String it
1550 belongs to. The Lisp_String points back to the `u.data' member of
1551 its sdata structure.
1553 When a Lisp_String is freed during GC, it is put back on
1554 string_free_list, and its `data' member and its sdata's `string'
1555 pointer is set to null. The size of the string is recorded in the
1556 `u.nbytes' member of the sdata. So, sdata structures that are no
1557 longer used, can be easily recognized, and it's easy to compact the
1558 sblocks of small strings which we do in compact_small_strings. */
1560 /* Size in bytes of an sblock structure used for small strings. This
1561 is 8192 minus malloc overhead. */
1563 #define SBLOCK_SIZE 8188
1565 /* Strings larger than this are considered large strings. String data
1566 for large strings is allocated from individual sblocks. */
1568 #define LARGE_STRING_BYTES 1024
1570 /* Structure describing string memory sub-allocated from an sblock.
1571 This is where the contents of Lisp strings are stored. */
1575 /* Back-pointer to the string this sdata belongs to. If null, this
1576 structure is free, and the NBYTES member of the union below
1577 contains the string's byte size (the same value that STRING_BYTES
1578 would return if STRING were non-null). If non-null, STRING_BYTES
1579 (STRING) is the size of the data, and DATA contains the string's
1581 struct Lisp_String
*string
;
1583 #ifdef GC_CHECK_STRING_BYTES
1586 unsigned char data
[1];
1588 #define SDATA_NBYTES(S) (S)->nbytes
1589 #define SDATA_DATA(S) (S)->data
1591 #else /* not GC_CHECK_STRING_BYTES */
1595 /* When STRING in non-null. */
1596 unsigned char data
[1];
1598 /* When STRING is null. */
1603 #define SDATA_NBYTES(S) (S)->u.nbytes
1604 #define SDATA_DATA(S) (S)->u.data
1606 #endif /* not GC_CHECK_STRING_BYTES */
1610 /* Structure describing a block of memory which is sub-allocated to
1611 obtain string data memory for strings. Blocks for small strings
1612 are of fixed size SBLOCK_SIZE. Blocks for large strings are made
1613 as large as needed. */
1618 struct sblock
*next
;
1620 /* Pointer to the next free sdata block. This points past the end
1621 of the sblock if there isn't any space left in this block. */
1622 struct sdata
*next_free
;
1624 /* Start of data. */
1625 struct sdata first_data
;
1628 /* Number of Lisp strings in a string_block structure. The 1020 is
1629 1024 minus malloc overhead. */
1631 #define STRING_BLOCK_SIZE \
1632 ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String))
1634 /* Structure describing a block from which Lisp_String structures
1639 /* Place `strings' first, to preserve alignment. */
1640 struct Lisp_String strings
[STRING_BLOCK_SIZE
];
1641 struct string_block
*next
;
1644 /* Head and tail of the list of sblock structures holding Lisp string
1645 data. We always allocate from current_sblock. The NEXT pointers
1646 in the sblock structures go from oldest_sblock to current_sblock. */
1648 static struct sblock
*oldest_sblock
, *current_sblock
;
1650 /* List of sblocks for large strings. */
1652 static struct sblock
*large_sblocks
;
1654 /* List of string_block structures, and how many there are. */
1656 static struct string_block
*string_blocks
;
1657 static int n_string_blocks
;
1659 /* Free-list of Lisp_Strings. */
1661 static struct Lisp_String
*string_free_list
;
1663 /* Number of live and free Lisp_Strings. */
1665 static int total_strings
, total_free_strings
;
1667 /* Number of bytes used by live strings. */
1669 static int total_string_size
;
1671 /* Given a pointer to a Lisp_String S which is on the free-list
1672 string_free_list, return a pointer to its successor in the
1675 #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S))
1677 /* Return a pointer to the sdata structure belonging to Lisp string S.
1678 S must be live, i.e. S->data must not be null. S->data is actually
1679 a pointer to the `u.data' member of its sdata structure; the
1680 structure starts at a constant offset in front of that. */
1682 #ifdef GC_CHECK_STRING_BYTES
1684 #define SDATA_OF_STRING(S) \
1685 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *) \
1686 - sizeof (EMACS_INT)))
1688 #else /* not GC_CHECK_STRING_BYTES */
1690 #define SDATA_OF_STRING(S) \
1691 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *)))
1693 #endif /* not GC_CHECK_STRING_BYTES */
1696 #ifdef GC_CHECK_STRING_OVERRUN
1698 /* We check for overrun in string data blocks by appending a small
1699 "cookie" after each allocated string data block, and check for the
1700 presence of this cookie during GC. */
1702 #define GC_STRING_OVERRUN_COOKIE_SIZE 4
1703 static char string_overrun_cookie
[GC_STRING_OVERRUN_COOKIE_SIZE
] =
1704 { 0xde, 0xad, 0xbe, 0xef };
1707 #define GC_STRING_OVERRUN_COOKIE_SIZE 0
1710 /* Value is the size of an sdata structure large enough to hold NBYTES
1711 bytes of string data. The value returned includes a terminating
1712 NUL byte, the size of the sdata structure, and padding. */
1714 #ifdef GC_CHECK_STRING_BYTES
1716 #define SDATA_SIZE(NBYTES) \
1717 ((sizeof (struct Lisp_String *) \
1719 + sizeof (EMACS_INT) \
1720 + sizeof (EMACS_INT) - 1) \
1721 & ~(sizeof (EMACS_INT) - 1))
1723 #else /* not GC_CHECK_STRING_BYTES */
1725 #define SDATA_SIZE(NBYTES) \
1726 ((sizeof (struct Lisp_String *) \
1728 + sizeof (EMACS_INT) - 1) \
1729 & ~(sizeof (EMACS_INT) - 1))
1731 #endif /* not GC_CHECK_STRING_BYTES */
1733 /* Extra bytes to allocate for each string. */
1735 #define GC_STRING_EXTRA (GC_STRING_OVERRUN_COOKIE_SIZE)
1737 /* Initialize string allocation. Called from init_alloc_once. */
1742 total_strings
= total_free_strings
= total_string_size
= 0;
1743 oldest_sblock
= current_sblock
= large_sblocks
= NULL
;
1744 string_blocks
= NULL
;
1745 n_string_blocks
= 0;
1746 string_free_list
= NULL
;
1750 #ifdef GC_CHECK_STRING_BYTES
1752 static int check_string_bytes_count
;
1754 void check_string_bytes
P_ ((int));
1755 void check_sblock
P_ ((struct sblock
*));
1757 #define CHECK_STRING_BYTES(S) STRING_BYTES (S)
1760 /* Like GC_STRING_BYTES, but with debugging check. */
1764 struct Lisp_String
*s
;
1766 int nbytes
= (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1767 if (!PURE_POINTER_P (s
)
1769 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1774 /* Check validity of Lisp strings' string_bytes member in B. */
1780 struct sdata
*from
, *end
, *from_end
;
1784 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1786 /* Compute the next FROM here because copying below may
1787 overwrite data we need to compute it. */
1790 /* Check that the string size recorded in the string is the
1791 same as the one recorded in the sdata structure. */
1793 CHECK_STRING_BYTES (from
->string
);
1796 nbytes
= GC_STRING_BYTES (from
->string
);
1798 nbytes
= SDATA_NBYTES (from
);
1800 nbytes
= SDATA_SIZE (nbytes
);
1801 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
1806 /* Check validity of Lisp strings' string_bytes member. ALL_P
1807 non-zero means check all strings, otherwise check only most
1808 recently allocated strings. Used for hunting a bug. */
1811 check_string_bytes (all_p
)
1818 for (b
= large_sblocks
; b
; b
= b
->next
)
1820 struct Lisp_String
*s
= b
->first_data
.string
;
1822 CHECK_STRING_BYTES (s
);
1825 for (b
= oldest_sblock
; b
; b
= b
->next
)
1829 check_sblock (current_sblock
);
1832 #endif /* GC_CHECK_STRING_BYTES */
1834 #ifdef GC_CHECK_STRING_FREE_LIST
1836 /* Walk through the string free list looking for bogus next pointers.
1837 This may catch buffer overrun from a previous string. */
1840 check_string_free_list ()
1842 struct Lisp_String
*s
;
1844 /* Pop a Lisp_String off the free-list. */
1845 s
= string_free_list
;
1848 if ((unsigned)s
< 1024)
1850 s
= NEXT_FREE_LISP_STRING (s
);
1854 #define check_string_free_list()
1857 /* Return a new Lisp_String. */
1859 static struct Lisp_String
*
1862 struct Lisp_String
*s
;
1864 /* eassert (!handling_signal); */
1870 /* If the free-list is empty, allocate a new string_block, and
1871 add all the Lisp_Strings in it to the free-list. */
1872 if (string_free_list
== NULL
)
1874 struct string_block
*b
;
1877 b
= (struct string_block
*) lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1878 bzero (b
, sizeof *b
);
1879 b
->next
= string_blocks
;
1883 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1886 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1887 string_free_list
= s
;
1890 total_free_strings
+= STRING_BLOCK_SIZE
;
1893 check_string_free_list ();
1895 /* Pop a Lisp_String off the free-list. */
1896 s
= string_free_list
;
1897 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1903 /* Probably not strictly necessary, but play it safe. */
1904 bzero (s
, sizeof *s
);
1906 --total_free_strings
;
1909 consing_since_gc
+= sizeof *s
;
1911 #ifdef GC_CHECK_STRING_BYTES
1918 if (++check_string_bytes_count
== 200)
1920 check_string_bytes_count
= 0;
1921 check_string_bytes (1);
1924 check_string_bytes (0);
1926 #endif /* GC_CHECK_STRING_BYTES */
1932 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1933 plus a NUL byte at the end. Allocate an sdata structure for S, and
1934 set S->data to its `u.data' member. Store a NUL byte at the end of
1935 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1936 S->data if it was initially non-null. */
1939 allocate_string_data (s
, nchars
, nbytes
)
1940 struct Lisp_String
*s
;
1943 struct sdata
*data
, *old_data
;
1945 int needed
, old_nbytes
;
1947 /* Determine the number of bytes needed to store NBYTES bytes
1949 needed
= SDATA_SIZE (nbytes
);
1950 old_data
= s
->data
? SDATA_OF_STRING (s
) : NULL
;
1951 old_nbytes
= GC_STRING_BYTES (s
);
1957 if (nbytes
> LARGE_STRING_BYTES
)
1959 size_t size
= sizeof *b
- sizeof (struct sdata
) + needed
;
1961 #ifdef DOUG_LEA_MALLOC
1962 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1963 because mapped region contents are not preserved in
1966 In case you think of allowing it in a dumped Emacs at the
1967 cost of not being able to re-dump, there's another reason:
1968 mmap'ed data typically have an address towards the top of the
1969 address space, which won't fit into an EMACS_INT (at least on
1970 32-bit systems with the current tagging scheme). --fx */
1972 mallopt (M_MMAP_MAX
, 0);
1976 b
= (struct sblock
*) lisp_malloc (size
+ GC_STRING_EXTRA
, MEM_TYPE_NON_LISP
);
1978 #ifdef DOUG_LEA_MALLOC
1979 /* Back to a reasonable maximum of mmap'ed areas. */
1981 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1985 b
->next_free
= &b
->first_data
;
1986 b
->first_data
.string
= NULL
;
1987 b
->next
= large_sblocks
;
1990 else if (current_sblock
== NULL
1991 || (((char *) current_sblock
+ SBLOCK_SIZE
1992 - (char *) current_sblock
->next_free
)
1993 < (needed
+ GC_STRING_EXTRA
)))
1995 /* Not enough room in the current sblock. */
1996 b
= (struct sblock
*) lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
1997 b
->next_free
= &b
->first_data
;
1998 b
->first_data
.string
= NULL
;
2002 current_sblock
->next
= b
;
2010 data
= b
->next_free
;
2011 b
->next_free
= (struct sdata
*) ((char *) data
+ needed
+ GC_STRING_EXTRA
);
2018 s
->data
= SDATA_DATA (data
);
2019 #ifdef GC_CHECK_STRING_BYTES
2020 SDATA_NBYTES (data
) = nbytes
;
2023 s
->size_byte
= nbytes
;
2024 s
->data
[nbytes
] = '\0';
2025 #ifdef GC_CHECK_STRING_OVERRUN
2026 bcopy (string_overrun_cookie
, (char *) data
+ needed
,
2027 GC_STRING_OVERRUN_COOKIE_SIZE
);
2030 /* If S had already data assigned, mark that as free by setting its
2031 string back-pointer to null, and recording the size of the data
2035 SDATA_NBYTES (old_data
) = old_nbytes
;
2036 old_data
->string
= NULL
;
2039 consing_since_gc
+= needed
;
2043 /* Sweep and compact strings. */
2048 struct string_block
*b
, *next
;
2049 struct string_block
*live_blocks
= NULL
;
2051 string_free_list
= NULL
;
2052 total_strings
= total_free_strings
= 0;
2053 total_string_size
= 0;
2055 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
2056 for (b
= string_blocks
; b
; b
= next
)
2059 struct Lisp_String
*free_list_before
= string_free_list
;
2063 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
2065 struct Lisp_String
*s
= b
->strings
+ i
;
2069 /* String was not on free-list before. */
2070 if (STRING_MARKED_P (s
))
2072 /* String is live; unmark it and its intervals. */
2075 if (!NULL_INTERVAL_P (s
->intervals
))
2076 UNMARK_BALANCE_INTERVALS (s
->intervals
);
2079 total_string_size
+= STRING_BYTES (s
);
2083 /* String is dead. Put it on the free-list. */
2084 struct sdata
*data
= SDATA_OF_STRING (s
);
2086 /* Save the size of S in its sdata so that we know
2087 how large that is. Reset the sdata's string
2088 back-pointer so that we know it's free. */
2089 #ifdef GC_CHECK_STRING_BYTES
2090 if (GC_STRING_BYTES (s
) != SDATA_NBYTES (data
))
2093 data
->u
.nbytes
= GC_STRING_BYTES (s
);
2095 data
->string
= NULL
;
2097 /* Reset the strings's `data' member so that we
2101 /* Put the string on the free-list. */
2102 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2103 string_free_list
= s
;
2109 /* S was on the free-list before. Put it there again. */
2110 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2111 string_free_list
= s
;
2116 /* Free blocks that contain free Lisp_Strings only, except
2117 the first two of them. */
2118 if (nfree
== STRING_BLOCK_SIZE
2119 && total_free_strings
> STRING_BLOCK_SIZE
)
2123 string_free_list
= free_list_before
;
2127 total_free_strings
+= nfree
;
2128 b
->next
= live_blocks
;
2133 check_string_free_list ();
2135 string_blocks
= live_blocks
;
2136 free_large_strings ();
2137 compact_small_strings ();
2139 check_string_free_list ();
2143 /* Free dead large strings. */
2146 free_large_strings ()
2148 struct sblock
*b
, *next
;
2149 struct sblock
*live_blocks
= NULL
;
2151 for (b
= large_sblocks
; b
; b
= next
)
2155 if (b
->first_data
.string
== NULL
)
2159 b
->next
= live_blocks
;
2164 large_sblocks
= live_blocks
;
2168 /* Compact data of small strings. Free sblocks that don't contain
2169 data of live strings after compaction. */
2172 compact_small_strings ()
2174 struct sblock
*b
, *tb
, *next
;
2175 struct sdata
*from
, *to
, *end
, *tb_end
;
2176 struct sdata
*to_end
, *from_end
;
2178 /* TB is the sblock we copy to, TO is the sdata within TB we copy
2179 to, and TB_END is the end of TB. */
2181 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2182 to
= &tb
->first_data
;
2184 /* Step through the blocks from the oldest to the youngest. We
2185 expect that old blocks will stabilize over time, so that less
2186 copying will happen this way. */
2187 for (b
= oldest_sblock
; b
; b
= b
->next
)
2190 xassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
2192 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
2194 /* Compute the next FROM here because copying below may
2195 overwrite data we need to compute it. */
2198 #ifdef GC_CHECK_STRING_BYTES
2199 /* Check that the string size recorded in the string is the
2200 same as the one recorded in the sdata structure. */
2202 && GC_STRING_BYTES (from
->string
) != SDATA_NBYTES (from
))
2204 #endif /* GC_CHECK_STRING_BYTES */
2207 nbytes
= GC_STRING_BYTES (from
->string
);
2209 nbytes
= SDATA_NBYTES (from
);
2211 if (nbytes
> LARGE_STRING_BYTES
)
2214 nbytes
= SDATA_SIZE (nbytes
);
2215 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
2217 #ifdef GC_CHECK_STRING_OVERRUN
2218 if (bcmp (string_overrun_cookie
,
2219 ((char *) from_end
) - GC_STRING_OVERRUN_COOKIE_SIZE
,
2220 GC_STRING_OVERRUN_COOKIE_SIZE
))
2224 /* FROM->string non-null means it's alive. Copy its data. */
2227 /* If TB is full, proceed with the next sblock. */
2228 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2229 if (to_end
> tb_end
)
2233 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2234 to
= &tb
->first_data
;
2235 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2238 /* Copy, and update the string's `data' pointer. */
2241 xassert (tb
!= b
|| to
<= from
);
2242 safe_bcopy ((char *) from
, (char *) to
, nbytes
+ GC_STRING_EXTRA
);
2243 to
->string
->data
= SDATA_DATA (to
);
2246 /* Advance past the sdata we copied to. */
2252 /* The rest of the sblocks following TB don't contain live data, so
2253 we can free them. */
2254 for (b
= tb
->next
; b
; b
= next
)
2262 current_sblock
= tb
;
2266 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
2267 doc
: /* Return a newly created string of length LENGTH, with INIT in each element.
2268 LENGTH must be an integer.
2269 INIT must be an integer that represents a character. */)
2271 Lisp_Object length
, init
;
2273 register Lisp_Object val
;
2274 register unsigned char *p
, *end
;
2277 CHECK_NATNUM (length
);
2278 CHECK_NUMBER (init
);
2281 if (SINGLE_BYTE_CHAR_P (c
))
2283 nbytes
= XINT (length
);
2284 val
= make_uninit_string (nbytes
);
2286 end
= p
+ SCHARS (val
);
2292 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
2293 int len
= CHAR_STRING (c
, str
);
2295 nbytes
= len
* XINT (length
);
2296 val
= make_uninit_multibyte_string (XINT (length
), nbytes
);
2301 bcopy (str
, p
, len
);
2311 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
2312 doc
: /* Return a new bool-vector of length LENGTH, using INIT for each element.
2313 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
2315 Lisp_Object length
, init
;
2317 register Lisp_Object val
;
2318 struct Lisp_Bool_Vector
*p
;
2320 int length_in_chars
, length_in_elts
, bits_per_value
;
2322 CHECK_NATNUM (length
);
2324 bits_per_value
= sizeof (EMACS_INT
) * BOOL_VECTOR_BITS_PER_CHAR
;
2326 length_in_elts
= (XFASTINT (length
) + bits_per_value
- 1) / bits_per_value
;
2327 length_in_chars
= ((XFASTINT (length
) + BOOL_VECTOR_BITS_PER_CHAR
- 1)
2328 / BOOL_VECTOR_BITS_PER_CHAR
);
2330 /* We must allocate one more elements than LENGTH_IN_ELTS for the
2331 slot `size' of the struct Lisp_Bool_Vector. */
2332 val
= Fmake_vector (make_number (length_in_elts
+ 1), Qnil
);
2333 p
= XBOOL_VECTOR (val
);
2335 /* Get rid of any bits that would cause confusion. */
2337 XSETBOOL_VECTOR (val
, p
);
2338 p
->size
= XFASTINT (length
);
2340 real_init
= (NILP (init
) ? 0 : -1);
2341 for (i
= 0; i
< length_in_chars
; i
++)
2342 p
->data
[i
] = real_init
;
2344 /* Clear the extraneous bits in the last byte. */
2345 if (XINT (length
) != length_in_chars
* BOOL_VECTOR_BITS_PER_CHAR
)
2346 XBOOL_VECTOR (val
)->data
[length_in_chars
- 1]
2347 &= (1 << (XINT (length
) % BOOL_VECTOR_BITS_PER_CHAR
)) - 1;
2353 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
2354 of characters from the contents. This string may be unibyte or
2355 multibyte, depending on the contents. */
2358 make_string (contents
, nbytes
)
2359 const char *contents
;
2362 register Lisp_Object val
;
2363 int nchars
, multibyte_nbytes
;
2365 parse_str_as_multibyte (contents
, nbytes
, &nchars
, &multibyte_nbytes
);
2366 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
2367 /* CONTENTS contains no multibyte sequences or contains an invalid
2368 multibyte sequence. We must make unibyte string. */
2369 val
= make_unibyte_string (contents
, nbytes
);
2371 val
= make_multibyte_string (contents
, nchars
, nbytes
);
2376 /* Make an unibyte string from LENGTH bytes at CONTENTS. */
2379 make_unibyte_string (contents
, length
)
2380 const char *contents
;
2383 register Lisp_Object val
;
2384 val
= make_uninit_string (length
);
2385 bcopy (contents
, SDATA (val
), length
);
2386 STRING_SET_UNIBYTE (val
);
2391 /* Make a multibyte string from NCHARS characters occupying NBYTES
2392 bytes at CONTENTS. */
2395 make_multibyte_string (contents
, nchars
, nbytes
)
2396 const char *contents
;
2399 register Lisp_Object val
;
2400 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2401 bcopy (contents
, SDATA (val
), nbytes
);
2406 /* Make a string from NCHARS characters occupying NBYTES bytes at
2407 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2410 make_string_from_bytes (contents
, nchars
, nbytes
)
2411 const char *contents
;
2414 register Lisp_Object val
;
2415 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2416 bcopy (contents
, SDATA (val
), nbytes
);
2417 if (SBYTES (val
) == SCHARS (val
))
2418 STRING_SET_UNIBYTE (val
);
2423 /* Make a string from NCHARS characters occupying NBYTES bytes at
2424 CONTENTS. The argument MULTIBYTE controls whether to label the
2425 string as multibyte. If NCHARS is negative, it counts the number of
2426 characters by itself. */
2429 make_specified_string (contents
, nchars
, nbytes
, multibyte
)
2430 const char *contents
;
2434 register Lisp_Object val
;
2439 nchars
= multibyte_chars_in_text (contents
, nbytes
);
2443 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2444 bcopy (contents
, SDATA (val
), nbytes
);
2446 STRING_SET_UNIBYTE (val
);
2451 /* Make a string from the data at STR, treating it as multibyte if the
2458 return make_string (str
, strlen (str
));
2462 /* Return an unibyte Lisp_String set up to hold LENGTH characters
2463 occupying LENGTH bytes. */
2466 make_uninit_string (length
)
2470 val
= make_uninit_multibyte_string (length
, length
);
2471 STRING_SET_UNIBYTE (val
);
2476 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2477 which occupy NBYTES bytes. */
2480 make_uninit_multibyte_string (nchars
, nbytes
)
2484 struct Lisp_String
*s
;
2489 s
= allocate_string ();
2490 allocate_string_data (s
, nchars
, nbytes
);
2491 XSETSTRING (string
, s
);
2492 string_chars_consed
+= nbytes
;
2498 /***********************************************************************
2500 ***********************************************************************/
2502 /* We store float cells inside of float_blocks, allocating a new
2503 float_block with malloc whenever necessary. Float cells reclaimed
2504 by GC are put on a free list to be reallocated before allocating
2505 any new float cells from the latest float_block. */
2507 #define FLOAT_BLOCK_SIZE \
2508 (((BLOCK_BYTES - sizeof (struct float_block *) \
2509 /* The compiler might add padding at the end. */ \
2510 - (sizeof (struct Lisp_Float) - sizeof (int))) * CHAR_BIT) \
2511 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2513 #define GETMARKBIT(block,n) \
2514 (((block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2515 >> ((n) % (sizeof(int) * CHAR_BIT))) \
2518 #define SETMARKBIT(block,n) \
2519 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2520 |= 1 << ((n) % (sizeof(int) * CHAR_BIT))
2522 #define UNSETMARKBIT(block,n) \
2523 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2524 &= ~(1 << ((n) % (sizeof(int) * CHAR_BIT)))
2526 #define FLOAT_BLOCK(fptr) \
2527 ((struct float_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2529 #define FLOAT_INDEX(fptr) \
2530 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2534 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2535 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2536 int gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2537 struct float_block
*next
;
2540 #define FLOAT_MARKED_P(fptr) \
2541 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2543 #define FLOAT_MARK(fptr) \
2544 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2546 #define FLOAT_UNMARK(fptr) \
2547 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2549 /* Current float_block. */
2551 struct float_block
*float_block
;
2553 /* Index of first unused Lisp_Float in the current float_block. */
2555 int float_block_index
;
2557 /* Total number of float blocks now in use. */
2561 /* Free-list of Lisp_Floats. */
2563 struct Lisp_Float
*float_free_list
;
2566 /* Initialize float allocation. */
2572 float_block_index
= FLOAT_BLOCK_SIZE
; /* Force alloc of new float_block. */
2573 float_free_list
= 0;
2578 /* Explicitly free a float cell by putting it on the free-list. */
2582 struct Lisp_Float
*ptr
;
2584 ptr
->u
.chain
= float_free_list
;
2585 float_free_list
= ptr
;
2589 /* Return a new float object with value FLOAT_VALUE. */
2592 make_float (float_value
)
2595 register Lisp_Object val
;
2597 /* eassert (!handling_signal); */
2603 if (float_free_list
)
2605 /* We use the data field for chaining the free list
2606 so that we won't use the same field that has the mark bit. */
2607 XSETFLOAT (val
, float_free_list
);
2608 float_free_list
= float_free_list
->u
.chain
;
2612 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2614 register struct float_block
*new;
2616 new = (struct float_block
*) lisp_align_malloc (sizeof *new,
2618 new->next
= float_block
;
2619 bzero ((char *) new->gcmarkbits
, sizeof new->gcmarkbits
);
2621 float_block_index
= 0;
2624 XSETFLOAT (val
, &float_block
->floats
[float_block_index
]);
2625 float_block_index
++;
2632 XFLOAT_DATA (val
) = float_value
;
2633 eassert (!FLOAT_MARKED_P (XFLOAT (val
)));
2634 consing_since_gc
+= sizeof (struct Lisp_Float
);
2641 /***********************************************************************
2643 ***********************************************************************/
2645 /* We store cons cells inside of cons_blocks, allocating a new
2646 cons_block with malloc whenever necessary. Cons cells reclaimed by
2647 GC are put on a free list to be reallocated before allocating
2648 any new cons cells from the latest cons_block. */
2650 #define CONS_BLOCK_SIZE \
2651 (((BLOCK_BYTES - sizeof (struct cons_block *)) * CHAR_BIT) \
2652 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2654 #define CONS_BLOCK(fptr) \
2655 ((struct cons_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2657 #define CONS_INDEX(fptr) \
2658 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2662 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2663 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2664 int gcmarkbits
[1 + CONS_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2665 struct cons_block
*next
;
2668 #define CONS_MARKED_P(fptr) \
2669 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2671 #define CONS_MARK(fptr) \
2672 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2674 #define CONS_UNMARK(fptr) \
2675 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2677 /* Current cons_block. */
2679 struct cons_block
*cons_block
;
2681 /* Index of first unused Lisp_Cons in the current block. */
2683 int cons_block_index
;
2685 /* Free-list of Lisp_Cons structures. */
2687 struct Lisp_Cons
*cons_free_list
;
2689 /* Total number of cons blocks now in use. */
2694 /* Initialize cons allocation. */
2700 cons_block_index
= CONS_BLOCK_SIZE
; /* Force alloc of new cons_block. */
2706 /* Explicitly free a cons cell by putting it on the free-list. */
2710 struct Lisp_Cons
*ptr
;
2712 ptr
->u
.chain
= cons_free_list
;
2716 cons_free_list
= ptr
;
2719 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
2720 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2722 Lisp_Object car
, cdr
;
2724 register Lisp_Object val
;
2726 /* eassert (!handling_signal); */
2734 /* We use the cdr for chaining the free list
2735 so that we won't use the same field that has the mark bit. */
2736 XSETCONS (val
, cons_free_list
);
2737 cons_free_list
= cons_free_list
->u
.chain
;
2741 if (cons_block_index
== CONS_BLOCK_SIZE
)
2743 register struct cons_block
*new;
2744 new = (struct cons_block
*) lisp_align_malloc (sizeof *new,
2746 bzero ((char *) new->gcmarkbits
, sizeof new->gcmarkbits
);
2747 new->next
= cons_block
;
2749 cons_block_index
= 0;
2752 XSETCONS (val
, &cons_block
->conses
[cons_block_index
]);
2762 eassert (!CONS_MARKED_P (XCONS (val
)));
2763 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2764 cons_cells_consed
++;
2768 /* Get an error now if there's any junk in the cons free list. */
2772 #ifdef GC_CHECK_CONS_LIST
2773 struct Lisp_Cons
*tail
= cons_free_list
;
2776 tail
= tail
->u
.chain
;
2780 /* Make a list of 2, 3, 4 or 5 specified objects. */
2784 Lisp_Object arg1
, arg2
;
2786 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2791 list3 (arg1
, arg2
, arg3
)
2792 Lisp_Object arg1
, arg2
, arg3
;
2794 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2799 list4 (arg1
, arg2
, arg3
, arg4
)
2800 Lisp_Object arg1
, arg2
, arg3
, arg4
;
2802 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2807 list5 (arg1
, arg2
, arg3
, arg4
, arg5
)
2808 Lisp_Object arg1
, arg2
, arg3
, arg4
, arg5
;
2810 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2811 Fcons (arg5
, Qnil
)))));
2815 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
2816 doc
: /* Return a newly created list with specified arguments as elements.
2817 Any number of arguments, even zero arguments, are allowed.
2818 usage: (list &rest OBJECTS) */)
2821 register Lisp_Object
*args
;
2823 register Lisp_Object val
;
2829 val
= Fcons (args
[nargs
], val
);
2835 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2836 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2838 register Lisp_Object length
, init
;
2840 register Lisp_Object val
;
2843 CHECK_NATNUM (length
);
2844 size
= XFASTINT (length
);
2849 val
= Fcons (init
, val
);
2854 val
= Fcons (init
, val
);
2859 val
= Fcons (init
, val
);
2864 val
= Fcons (init
, val
);
2869 val
= Fcons (init
, val
);
2884 /***********************************************************************
2886 ***********************************************************************/
2888 /* Singly-linked list of all vectors. */
2890 struct Lisp_Vector
*all_vectors
;
2892 /* Total number of vector-like objects now in use. */
2897 /* Value is a pointer to a newly allocated Lisp_Vector structure
2898 with room for LEN Lisp_Objects. */
2900 static struct Lisp_Vector
*
2901 allocate_vectorlike (len
, type
)
2905 struct Lisp_Vector
*p
;
2908 #ifdef DOUG_LEA_MALLOC
2909 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
2910 because mapped region contents are not preserved in
2913 mallopt (M_MMAP_MAX
, 0);
2917 /* This gets triggered by code which I haven't bothered to fix. --Stef */
2918 /* eassert (!handling_signal); */
2920 nbytes
= sizeof *p
+ (len
- 1) * sizeof p
->contents
[0];
2921 p
= (struct Lisp_Vector
*) lisp_malloc (nbytes
, type
);
2923 #ifdef DOUG_LEA_MALLOC
2924 /* Back to a reasonable maximum of mmap'ed areas. */
2926 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2930 consing_since_gc
+= nbytes
;
2931 vector_cells_consed
+= len
;
2937 p
->next
= all_vectors
;
2949 /* Allocate a vector with NSLOTS slots. */
2951 struct Lisp_Vector
*
2952 allocate_vector (nslots
)
2955 struct Lisp_Vector
*v
= allocate_vectorlike (nslots
, MEM_TYPE_VECTOR
);
2961 /* Allocate other vector-like structures. */
2963 struct Lisp_Hash_Table
*
2964 allocate_hash_table ()
2966 EMACS_INT len
= VECSIZE (struct Lisp_Hash_Table
);
2967 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_HASH_TABLE
);
2971 for (i
= 0; i
< len
; ++i
)
2972 v
->contents
[i
] = Qnil
;
2974 return (struct Lisp_Hash_Table
*) v
;
2981 EMACS_INT len
= VECSIZE (struct window
);
2982 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_WINDOW
);
2985 for (i
= 0; i
< len
; ++i
)
2986 v
->contents
[i
] = Qnil
;
2989 return (struct window
*) v
;
2996 EMACS_INT len
= VECSIZE (struct frame
);
2997 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_FRAME
);
3000 for (i
= 0; i
< len
; ++i
)
3001 v
->contents
[i
] = make_number (0);
3003 return (struct frame
*) v
;
3007 struct Lisp_Process
*
3010 /* Memory-footprint of the object in nb of Lisp_Object fields. */
3011 EMACS_INT memlen
= VECSIZE (struct Lisp_Process
);
3012 /* Size if we only count the actual Lisp_Object fields (which need to be
3013 traced by the GC). */
3014 EMACS_INT lisplen
= PSEUDOVECSIZE (struct Lisp_Process
, pid
);
3015 struct Lisp_Vector
*v
= allocate_vectorlike (memlen
, MEM_TYPE_PROCESS
);
3018 for (i
= 0; i
< lisplen
; ++i
)
3019 v
->contents
[i
] = Qnil
;
3022 return (struct Lisp_Process
*) v
;
3026 struct Lisp_Vector
*
3027 allocate_other_vector (len
)
3030 struct Lisp_Vector
*v
= allocate_vectorlike (len
, MEM_TYPE_VECTOR
);
3033 for (i
= 0; i
< len
; ++i
)
3034 v
->contents
[i
] = Qnil
;
3041 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
3042 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
3043 See also the function `vector'. */)
3045 register Lisp_Object length
, init
;
3048 register EMACS_INT sizei
;
3050 register struct Lisp_Vector
*p
;
3052 CHECK_NATNUM (length
);
3053 sizei
= XFASTINT (length
);
3055 p
= allocate_vector (sizei
);
3056 for (index
= 0; index
< sizei
; index
++)
3057 p
->contents
[index
] = init
;
3059 XSETVECTOR (vector
, p
);
3064 DEFUN ("make-char-table", Fmake_char_table
, Smake_char_table
, 1, 2, 0,
3065 doc
: /* Return a newly created char-table, with purpose PURPOSE.
3066 Each element is initialized to INIT, which defaults to nil.
3067 PURPOSE should be a symbol which has a `char-table-extra-slots' property.
3068 The property's value should be an integer between 0 and 10. */)
3070 register Lisp_Object purpose
, init
;
3074 CHECK_SYMBOL (purpose
);
3075 n
= Fget (purpose
, Qchar_table_extra_slots
);
3077 if (XINT (n
) < 0 || XINT (n
) > 10)
3078 args_out_of_range (n
, Qnil
);
3079 /* Add 2 to the size for the defalt and parent slots. */
3080 vector
= Fmake_vector (make_number (CHAR_TABLE_STANDARD_SLOTS
+ XINT (n
)),
3082 XCHAR_TABLE (vector
)->top
= Qt
;
3083 XCHAR_TABLE (vector
)->parent
= Qnil
;
3084 XCHAR_TABLE (vector
)->purpose
= purpose
;
3085 XSETCHAR_TABLE (vector
, XCHAR_TABLE (vector
));
3090 /* Return a newly created sub char table with slots initialized by INIT.
3091 Since a sub char table does not appear as a top level Emacs Lisp
3092 object, we don't need a Lisp interface to make it. */
3095 make_sub_char_table (init
)
3099 = Fmake_vector (make_number (SUB_CHAR_TABLE_STANDARD_SLOTS
), init
);
3100 XCHAR_TABLE (vector
)->top
= Qnil
;
3101 XCHAR_TABLE (vector
)->defalt
= Qnil
;
3102 XSETCHAR_TABLE (vector
, XCHAR_TABLE (vector
));
3107 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
3108 doc
: /* Return a newly created vector with specified arguments as elements.
3109 Any number of arguments, even zero arguments, are allowed.
3110 usage: (vector &rest OBJECTS) */)
3115 register Lisp_Object len
, val
;
3117 register struct Lisp_Vector
*p
;
3119 XSETFASTINT (len
, nargs
);
3120 val
= Fmake_vector (len
, Qnil
);
3122 for (index
= 0; index
< nargs
; index
++)
3123 p
->contents
[index
] = args
[index
];
3128 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
3129 doc
: /* Create a byte-code object with specified arguments as elements.
3130 The arguments should be the arglist, bytecode-string, constant vector,
3131 stack size, (optional) doc string, and (optional) interactive spec.
3132 The first four arguments are required; at most six have any
3134 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
3139 register Lisp_Object len
, val
;
3141 register struct Lisp_Vector
*p
;
3143 XSETFASTINT (len
, nargs
);
3144 if (!NILP (Vpurify_flag
))
3145 val
= make_pure_vector ((EMACS_INT
) nargs
);
3147 val
= Fmake_vector (len
, Qnil
);
3149 if (STRINGP (args
[1]) && STRING_MULTIBYTE (args
[1]))
3150 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
3151 earlier because they produced a raw 8-bit string for byte-code
3152 and now such a byte-code string is loaded as multibyte while
3153 raw 8-bit characters converted to multibyte form. Thus, now we
3154 must convert them back to the original unibyte form. */
3155 args
[1] = Fstring_as_unibyte (args
[1]);
3158 for (index
= 0; index
< nargs
; index
++)
3160 if (!NILP (Vpurify_flag
))
3161 args
[index
] = Fpurecopy (args
[index
]);
3162 p
->contents
[index
] = args
[index
];
3164 XSETCOMPILED (val
, p
);
3170 /***********************************************************************
3172 ***********************************************************************/
3174 /* Each symbol_block is just under 1020 bytes long, since malloc
3175 really allocates in units of powers of two and uses 4 bytes for its
3178 #define SYMBOL_BLOCK_SIZE \
3179 ((1020 - sizeof (struct symbol_block *)) / sizeof (struct Lisp_Symbol))
3183 /* Place `symbols' first, to preserve alignment. */
3184 struct Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
3185 struct symbol_block
*next
;
3188 /* Current symbol block and index of first unused Lisp_Symbol
3191 struct symbol_block
*symbol_block
;
3192 int symbol_block_index
;
3194 /* List of free symbols. */
3196 struct Lisp_Symbol
*symbol_free_list
;
3198 /* Total number of symbol blocks now in use. */
3200 int n_symbol_blocks
;
3203 /* Initialize symbol allocation. */
3208 symbol_block
= NULL
;
3209 symbol_block_index
= SYMBOL_BLOCK_SIZE
;
3210 symbol_free_list
= 0;
3211 n_symbol_blocks
= 0;
3215 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
3216 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
3217 Its value and function definition are void, and its property list is nil. */)
3221 register Lisp_Object val
;
3222 register struct Lisp_Symbol
*p
;
3224 CHECK_STRING (name
);
3226 /* eassert (!handling_signal); */
3232 if (symbol_free_list
)
3234 XSETSYMBOL (val
, symbol_free_list
);
3235 symbol_free_list
= symbol_free_list
->next
;
3239 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
3241 struct symbol_block
*new;
3242 new = (struct symbol_block
*) lisp_malloc (sizeof *new,
3244 new->next
= symbol_block
;
3246 symbol_block_index
= 0;
3249 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
]);
3250 symbol_block_index
++;
3260 p
->value
= Qunbound
;
3261 p
->function
= Qunbound
;
3264 p
->interned
= SYMBOL_UNINTERNED
;
3266 p
->indirect_variable
= 0;
3267 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
3274 /***********************************************************************
3275 Marker (Misc) Allocation
3276 ***********************************************************************/
3278 /* Allocation of markers and other objects that share that structure.
3279 Works like allocation of conses. */
3281 #define MARKER_BLOCK_SIZE \
3282 ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc))
3286 /* Place `markers' first, to preserve alignment. */
3287 union Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
3288 struct marker_block
*next
;
3291 struct marker_block
*marker_block
;
3292 int marker_block_index
;
3294 union Lisp_Misc
*marker_free_list
;
3296 /* Total number of marker blocks now in use. */
3298 int n_marker_blocks
;
3303 marker_block
= NULL
;
3304 marker_block_index
= MARKER_BLOCK_SIZE
;
3305 marker_free_list
= 0;
3306 n_marker_blocks
= 0;
3309 /* Return a newly allocated Lisp_Misc object, with no substructure. */
3316 /* eassert (!handling_signal); */
3322 if (marker_free_list
)
3324 XSETMISC (val
, marker_free_list
);
3325 marker_free_list
= marker_free_list
->u_free
.chain
;
3329 if (marker_block_index
== MARKER_BLOCK_SIZE
)
3331 struct marker_block
*new;
3332 new = (struct marker_block
*) lisp_malloc (sizeof *new,
3334 new->next
= marker_block
;
3336 marker_block_index
= 0;
3338 total_free_markers
+= MARKER_BLOCK_SIZE
;
3340 XSETMISC (val
, &marker_block
->markers
[marker_block_index
]);
3341 marker_block_index
++;
3348 --total_free_markers
;
3349 consing_since_gc
+= sizeof (union Lisp_Misc
);
3350 misc_objects_consed
++;
3351 XMARKER (val
)->gcmarkbit
= 0;
3355 /* Free a Lisp_Misc object */
3361 XMISC (misc
)->u_marker
.type
= Lisp_Misc_Free
;
3362 XMISC (misc
)->u_free
.chain
= marker_free_list
;
3363 marker_free_list
= XMISC (misc
);
3365 total_free_markers
++;
3368 /* Return a Lisp_Misc_Save_Value object containing POINTER and
3369 INTEGER. This is used to package C values to call record_unwind_protect.
3370 The unwind function can get the C values back using XSAVE_VALUE. */
3373 make_save_value (pointer
, integer
)
3377 register Lisp_Object val
;
3378 register struct Lisp_Save_Value
*p
;
3380 val
= allocate_misc ();
3381 XMISCTYPE (val
) = Lisp_Misc_Save_Value
;
3382 p
= XSAVE_VALUE (val
);
3383 p
->pointer
= pointer
;
3384 p
->integer
= integer
;
3389 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
3390 doc
: /* Return a newly allocated marker which does not point at any place. */)
3393 register Lisp_Object val
;
3394 register struct Lisp_Marker
*p
;
3396 val
= allocate_misc ();
3397 XMISCTYPE (val
) = Lisp_Misc_Marker
;
3403 p
->insertion_type
= 0;
3407 /* Put MARKER back on the free list after using it temporarily. */
3410 free_marker (marker
)
3413 unchain_marker (XMARKER (marker
));
3418 /* Return a newly created vector or string with specified arguments as
3419 elements. If all the arguments are characters that can fit
3420 in a string of events, make a string; otherwise, make a vector.
3422 Any number of arguments, even zero arguments, are allowed. */
3425 make_event_array (nargs
, args
)
3431 for (i
= 0; i
< nargs
; i
++)
3432 /* The things that fit in a string
3433 are characters that are in 0...127,
3434 after discarding the meta bit and all the bits above it. */
3435 if (!INTEGERP (args
[i
])
3436 || (XUINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
3437 return Fvector (nargs
, args
);
3439 /* Since the loop exited, we know that all the things in it are
3440 characters, so we can make a string. */
3444 result
= Fmake_string (make_number (nargs
), make_number (0));
3445 for (i
= 0; i
< nargs
; i
++)
3447 SSET (result
, i
, XINT (args
[i
]));
3448 /* Move the meta bit to the right place for a string char. */
3449 if (XINT (args
[i
]) & CHAR_META
)
3450 SSET (result
, i
, SREF (result
, i
) | 0x80);
3459 /************************************************************************
3460 Memory Full Handling
3461 ************************************************************************/
3464 /* Called if malloc returns zero. */
3473 memory_full_cons_threshold
= sizeof (struct cons_block
);
3475 /* The first time we get here, free the spare memory. */
3476 for (i
= 0; i
< sizeof (spare_memory
) / sizeof (char *); i
++)
3477 if (spare_memory
[i
])
3480 free (spare_memory
[i
]);
3481 else if (i
>= 1 && i
<= 4)
3482 lisp_align_free (spare_memory
[i
]);
3484 lisp_free (spare_memory
[i
]);
3485 spare_memory
[i
] = 0;
3488 /* Record the space now used. When it decreases substantially,
3489 we can refill the memory reserve. */
3490 #ifndef SYSTEM_MALLOC
3491 bytes_used_when_full
= BYTES_USED
;
3494 /* This used to call error, but if we've run out of memory, we could
3495 get infinite recursion trying to build the string. */
3497 Fsignal (Qnil
, Vmemory_signal_data
);
3500 /* If we released our reserve (due to running out of memory),
3501 and we have a fair amount free once again,
3502 try to set aside another reserve in case we run out once more.
3504 This is called when a relocatable block is freed in ralloc.c,
3505 and also directly from this file, in case we're not using ralloc.c. */
3508 refill_memory_reserve ()
3510 #ifndef SYSTEM_MALLOC
3511 if (spare_memory
[0] == 0)
3512 spare_memory
[0] = (char *) malloc ((size_t) SPARE_MEMORY
);
3513 if (spare_memory
[1] == 0)
3514 spare_memory
[1] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3516 if (spare_memory
[2] == 0)
3517 spare_memory
[2] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3519 if (spare_memory
[3] == 0)
3520 spare_memory
[3] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3522 if (spare_memory
[4] == 0)
3523 spare_memory
[4] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3525 if (spare_memory
[5] == 0)
3526 spare_memory
[5] = (char *) lisp_malloc (sizeof (struct string_block
),
3528 if (spare_memory
[6] == 0)
3529 spare_memory
[6] = (char *) lisp_malloc (sizeof (struct string_block
),
3531 if (spare_memory
[0] && spare_memory
[1] && spare_memory
[5])
3532 Vmemory_full
= Qnil
;
3536 /************************************************************************
3538 ************************************************************************/
3540 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
3542 /* Conservative C stack marking requires a method to identify possibly
3543 live Lisp objects given a pointer value. We do this by keeping
3544 track of blocks of Lisp data that are allocated in a red-black tree
3545 (see also the comment of mem_node which is the type of nodes in
3546 that tree). Function lisp_malloc adds information for an allocated
3547 block to the red-black tree with calls to mem_insert, and function
3548 lisp_free removes it with mem_delete. Functions live_string_p etc
3549 call mem_find to lookup information about a given pointer in the
3550 tree, and use that to determine if the pointer points to a Lisp
3553 /* Initialize this part of alloc.c. */
3558 mem_z
.left
= mem_z
.right
= MEM_NIL
;
3559 mem_z
.parent
= NULL
;
3560 mem_z
.color
= MEM_BLACK
;
3561 mem_z
.start
= mem_z
.end
= NULL
;
3566 /* Value is a pointer to the mem_node containing START. Value is
3567 MEM_NIL if there is no node in the tree containing START. */
3569 static INLINE
struct mem_node
*
3575 if (start
< min_heap_address
|| start
> max_heap_address
)
3578 /* Make the search always successful to speed up the loop below. */
3579 mem_z
.start
= start
;
3580 mem_z
.end
= (char *) start
+ 1;
3583 while (start
< p
->start
|| start
>= p
->end
)
3584 p
= start
< p
->start
? p
->left
: p
->right
;
3589 /* Insert a new node into the tree for a block of memory with start
3590 address START, end address END, and type TYPE. Value is a
3591 pointer to the node that was inserted. */
3593 static struct mem_node
*
3594 mem_insert (start
, end
, type
)
3598 struct mem_node
*c
, *parent
, *x
;
3600 if (start
< min_heap_address
)
3601 min_heap_address
= start
;
3602 if (end
> max_heap_address
)
3603 max_heap_address
= end
;
3605 /* See where in the tree a node for START belongs. In this
3606 particular application, it shouldn't happen that a node is already
3607 present. For debugging purposes, let's check that. */
3611 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3613 while (c
!= MEM_NIL
)
3615 if (start
>= c
->start
&& start
< c
->end
)
3618 c
= start
< c
->start
? c
->left
: c
->right
;
3621 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3623 while (c
!= MEM_NIL
)
3626 c
= start
< c
->start
? c
->left
: c
->right
;
3629 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3631 /* Create a new node. */
3632 #ifdef GC_MALLOC_CHECK
3633 x
= (struct mem_node
*) _malloc_internal (sizeof *x
);
3637 x
= (struct mem_node
*) xmalloc (sizeof *x
);
3643 x
->left
= x
->right
= MEM_NIL
;
3646 /* Insert it as child of PARENT or install it as root. */
3649 if (start
< parent
->start
)
3657 /* Re-establish red-black tree properties. */
3658 mem_insert_fixup (x
);
3664 /* Re-establish the red-black properties of the tree, and thereby
3665 balance the tree, after node X has been inserted; X is always red. */
3668 mem_insert_fixup (x
)
3671 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3673 /* X is red and its parent is red. This is a violation of
3674 red-black tree property #3. */
3676 if (x
->parent
== x
->parent
->parent
->left
)
3678 /* We're on the left side of our grandparent, and Y is our
3680 struct mem_node
*y
= x
->parent
->parent
->right
;
3682 if (y
->color
== MEM_RED
)
3684 /* Uncle and parent are red but should be black because
3685 X is red. Change the colors accordingly and proceed
3686 with the grandparent. */
3687 x
->parent
->color
= MEM_BLACK
;
3688 y
->color
= MEM_BLACK
;
3689 x
->parent
->parent
->color
= MEM_RED
;
3690 x
= x
->parent
->parent
;
3694 /* Parent and uncle have different colors; parent is
3695 red, uncle is black. */
3696 if (x
== x
->parent
->right
)
3699 mem_rotate_left (x
);
3702 x
->parent
->color
= MEM_BLACK
;
3703 x
->parent
->parent
->color
= MEM_RED
;
3704 mem_rotate_right (x
->parent
->parent
);
3709 /* This is the symmetrical case of above. */
3710 struct mem_node
*y
= x
->parent
->parent
->left
;
3712 if (y
->color
== MEM_RED
)
3714 x
->parent
->color
= MEM_BLACK
;
3715 y
->color
= MEM_BLACK
;
3716 x
->parent
->parent
->color
= MEM_RED
;
3717 x
= x
->parent
->parent
;
3721 if (x
== x
->parent
->left
)
3724 mem_rotate_right (x
);
3727 x
->parent
->color
= MEM_BLACK
;
3728 x
->parent
->parent
->color
= MEM_RED
;
3729 mem_rotate_left (x
->parent
->parent
);
3734 /* The root may have been changed to red due to the algorithm. Set
3735 it to black so that property #5 is satisfied. */
3736 mem_root
->color
= MEM_BLACK
;
3752 /* Turn y's left sub-tree into x's right sub-tree. */
3755 if (y
->left
!= MEM_NIL
)
3756 y
->left
->parent
= x
;
3758 /* Y's parent was x's parent. */
3760 y
->parent
= x
->parent
;
3762 /* Get the parent to point to y instead of x. */
3765 if (x
== x
->parent
->left
)
3766 x
->parent
->left
= y
;
3768 x
->parent
->right
= y
;
3773 /* Put x on y's left. */
3787 mem_rotate_right (x
)
3790 struct mem_node
*y
= x
->left
;
3793 if (y
->right
!= MEM_NIL
)
3794 y
->right
->parent
= x
;
3797 y
->parent
= x
->parent
;
3800 if (x
== x
->parent
->right
)
3801 x
->parent
->right
= y
;
3803 x
->parent
->left
= y
;
3814 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
3820 struct mem_node
*x
, *y
;
3822 if (!z
|| z
== MEM_NIL
)
3825 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
3830 while (y
->left
!= MEM_NIL
)
3834 if (y
->left
!= MEM_NIL
)
3839 x
->parent
= y
->parent
;
3842 if (y
== y
->parent
->left
)
3843 y
->parent
->left
= x
;
3845 y
->parent
->right
= x
;
3852 z
->start
= y
->start
;
3857 if (y
->color
== MEM_BLACK
)
3858 mem_delete_fixup (x
);
3860 #ifdef GC_MALLOC_CHECK
3868 /* Re-establish the red-black properties of the tree, after a
3872 mem_delete_fixup (x
)
3875 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
3877 if (x
== x
->parent
->left
)
3879 struct mem_node
*w
= x
->parent
->right
;
3881 if (w
->color
== MEM_RED
)
3883 w
->color
= MEM_BLACK
;
3884 x
->parent
->color
= MEM_RED
;
3885 mem_rotate_left (x
->parent
);
3886 w
= x
->parent
->right
;
3889 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
3896 if (w
->right
->color
== MEM_BLACK
)
3898 w
->left
->color
= MEM_BLACK
;
3900 mem_rotate_right (w
);
3901 w
= x
->parent
->right
;
3903 w
->color
= x
->parent
->color
;
3904 x
->parent
->color
= MEM_BLACK
;
3905 w
->right
->color
= MEM_BLACK
;
3906 mem_rotate_left (x
->parent
);
3912 struct mem_node
*w
= x
->parent
->left
;
3914 if (w
->color
== MEM_RED
)
3916 w
->color
= MEM_BLACK
;
3917 x
->parent
->color
= MEM_RED
;
3918 mem_rotate_right (x
->parent
);
3919 w
= x
->parent
->left
;
3922 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
3929 if (w
->left
->color
== MEM_BLACK
)
3931 w
->right
->color
= MEM_BLACK
;
3933 mem_rotate_left (w
);
3934 w
= x
->parent
->left
;
3937 w
->color
= x
->parent
->color
;
3938 x
->parent
->color
= MEM_BLACK
;
3939 w
->left
->color
= MEM_BLACK
;
3940 mem_rotate_right (x
->parent
);
3946 x
->color
= MEM_BLACK
;
3950 /* Value is non-zero if P is a pointer to a live Lisp string on
3951 the heap. M is a pointer to the mem_block for P. */
3954 live_string_p (m
, p
)
3958 if (m
->type
== MEM_TYPE_STRING
)
3960 struct string_block
*b
= (struct string_block
*) m
->start
;
3961 int offset
= (char *) p
- (char *) &b
->strings
[0];
3963 /* P must point to the start of a Lisp_String structure, and it
3964 must not be on the free-list. */
3966 && offset
% sizeof b
->strings
[0] == 0
3967 && offset
< (STRING_BLOCK_SIZE
* sizeof b
->strings
[0])
3968 && ((struct Lisp_String
*) p
)->data
!= NULL
);
3975 /* Value is non-zero if P is a pointer to a live Lisp cons on
3976 the heap. M is a pointer to the mem_block for P. */
3983 if (m
->type
== MEM_TYPE_CONS
)
3985 struct cons_block
*b
= (struct cons_block
*) m
->start
;
3986 int offset
= (char *) p
- (char *) &b
->conses
[0];
3988 /* P must point to the start of a Lisp_Cons, not be
3989 one of the unused cells in the current cons block,
3990 and not be on the free-list. */
3992 && offset
% sizeof b
->conses
[0] == 0
3993 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
3995 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
3996 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
4003 /* Value is non-zero if P is a pointer to a live Lisp symbol on
4004 the heap. M is a pointer to the mem_block for P. */
4007 live_symbol_p (m
, p
)
4011 if (m
->type
== MEM_TYPE_SYMBOL
)
4013 struct symbol_block
*b
= (struct symbol_block
*) m
->start
;
4014 int offset
= (char *) p
- (char *) &b
->symbols
[0];
4016 /* P must point to the start of a Lisp_Symbol, not be
4017 one of the unused cells in the current symbol block,
4018 and not be on the free-list. */
4020 && offset
% sizeof b
->symbols
[0] == 0
4021 && offset
< (SYMBOL_BLOCK_SIZE
* sizeof b
->symbols
[0])
4022 && (b
!= symbol_block
4023 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
4024 && !EQ (((struct Lisp_Symbol
*) p
)->function
, Vdead
));
4031 /* Value is non-zero if P is a pointer to a live Lisp float on
4032 the heap. M is a pointer to the mem_block for P. */
4039 if (m
->type
== MEM_TYPE_FLOAT
)
4041 struct float_block
*b
= (struct float_block
*) m
->start
;
4042 int offset
= (char *) p
- (char *) &b
->floats
[0];
4044 /* P must point to the start of a Lisp_Float and not be
4045 one of the unused cells in the current float block. */
4047 && offset
% sizeof b
->floats
[0] == 0
4048 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
4049 && (b
!= float_block
4050 || offset
/ sizeof b
->floats
[0] < float_block_index
));
4057 /* Value is non-zero if P is a pointer to a live Lisp Misc on
4058 the heap. M is a pointer to the mem_block for P. */
4065 if (m
->type
== MEM_TYPE_MISC
)
4067 struct marker_block
*b
= (struct marker_block
*) m
->start
;
4068 int offset
= (char *) p
- (char *) &b
->markers
[0];
4070 /* P must point to the start of a Lisp_Misc, not be
4071 one of the unused cells in the current misc block,
4072 and not be on the free-list. */
4074 && offset
% sizeof b
->markers
[0] == 0
4075 && offset
< (MARKER_BLOCK_SIZE
* sizeof b
->markers
[0])
4076 && (b
!= marker_block
4077 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
4078 && ((union Lisp_Misc
*) p
)->u_marker
.type
!= Lisp_Misc_Free
);
4085 /* Value is non-zero if P is a pointer to a live vector-like object.
4086 M is a pointer to the mem_block for P. */
4089 live_vector_p (m
, p
)
4093 return (p
== m
->start
4094 && m
->type
>= MEM_TYPE_VECTOR
4095 && m
->type
<= MEM_TYPE_WINDOW
);
4099 /* Value is non-zero if P is a pointer to a live buffer. M is a
4100 pointer to the mem_block for P. */
4103 live_buffer_p (m
, p
)
4107 /* P must point to the start of the block, and the buffer
4108 must not have been killed. */
4109 return (m
->type
== MEM_TYPE_BUFFER
4111 && !NILP (((struct buffer
*) p
)->name
));
4114 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
4118 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4120 /* Array of objects that are kept alive because the C stack contains
4121 a pattern that looks like a reference to them . */
4123 #define MAX_ZOMBIES 10
4124 static Lisp_Object zombies
[MAX_ZOMBIES
];
4126 /* Number of zombie objects. */
4128 static int nzombies
;
4130 /* Number of garbage collections. */
4134 /* Average percentage of zombies per collection. */
4136 static double avg_zombies
;
4138 /* Max. number of live and zombie objects. */
4140 static int max_live
, max_zombies
;
4142 /* Average number of live objects per GC. */
4144 static double avg_live
;
4146 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
4147 doc
: /* Show information about live and zombie objects. */)
4150 Lisp_Object args
[8], zombie_list
= Qnil
;
4152 for (i
= 0; i
< nzombies
; i
++)
4153 zombie_list
= Fcons (zombies
[i
], zombie_list
);
4154 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
4155 args
[1] = make_number (ngcs
);
4156 args
[2] = make_float (avg_live
);
4157 args
[3] = make_float (avg_zombies
);
4158 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
4159 args
[5] = make_number (max_live
);
4160 args
[6] = make_number (max_zombies
);
4161 args
[7] = zombie_list
;
4162 return Fmessage (8, args
);
4165 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4168 /* Mark OBJ if we can prove it's a Lisp_Object. */
4171 mark_maybe_object (obj
)
4174 void *po
= (void *) XPNTR (obj
);
4175 struct mem_node
*m
= mem_find (po
);
4181 switch (XGCTYPE (obj
))
4184 mark_p
= (live_string_p (m
, po
)
4185 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
4189 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
4193 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
4197 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
4200 case Lisp_Vectorlike
:
4201 /* Note: can't check GC_BUFFERP before we know it's a
4202 buffer because checking that dereferences the pointer
4203 PO which might point anywhere. */
4204 if (live_vector_p (m
, po
))
4205 mark_p
= !GC_SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
4206 else if (live_buffer_p (m
, po
))
4207 mark_p
= GC_BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
4211 mark_p
= (live_misc_p (m
, po
) && !XMARKER (obj
)->gcmarkbit
);
4215 case Lisp_Type_Limit
:
4221 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4222 if (nzombies
< MAX_ZOMBIES
)
4223 zombies
[nzombies
] = obj
;
4232 /* If P points to Lisp data, mark that as live if it isn't already
4236 mark_maybe_pointer (p
)
4241 /* Quickly rule out some values which can't point to Lisp data. We
4242 assume that Lisp data is aligned on even addresses. */
4243 if ((EMACS_INT
) p
& 1)
4249 Lisp_Object obj
= Qnil
;
4253 case MEM_TYPE_NON_LISP
:
4254 /* Nothing to do; not a pointer to Lisp memory. */
4257 case MEM_TYPE_BUFFER
:
4258 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P((struct buffer
*)p
))
4259 XSETVECTOR (obj
, p
);
4263 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
4267 case MEM_TYPE_STRING
:
4268 if (live_string_p (m
, p
)
4269 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
4270 XSETSTRING (obj
, p
);
4274 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
4278 case MEM_TYPE_SYMBOL
:
4279 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
4280 XSETSYMBOL (obj
, p
);
4283 case MEM_TYPE_FLOAT
:
4284 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
4288 case MEM_TYPE_VECTOR
:
4289 case MEM_TYPE_PROCESS
:
4290 case MEM_TYPE_HASH_TABLE
:
4291 case MEM_TYPE_FRAME
:
4292 case MEM_TYPE_WINDOW
:
4293 if (live_vector_p (m
, p
))
4296 XSETVECTOR (tem
, p
);
4297 if (!GC_SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
4312 /* Mark Lisp objects referenced from the address range START..END. */
4315 mark_memory (start
, end
)
4321 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4325 /* Make START the pointer to the start of the memory region,
4326 if it isn't already. */
4334 /* Mark Lisp_Objects. */
4335 for (p
= (Lisp_Object
*) start
; (void *) p
< end
; ++p
)
4336 mark_maybe_object (*p
);
4338 /* Mark Lisp data pointed to. This is necessary because, in some
4339 situations, the C compiler optimizes Lisp objects away, so that
4340 only a pointer to them remains. Example:
4342 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
4345 Lisp_Object obj = build_string ("test");
4346 struct Lisp_String *s = XSTRING (obj);
4347 Fgarbage_collect ();
4348 fprintf (stderr, "test `%s'\n", s->data);
4352 Here, `obj' isn't really used, and the compiler optimizes it
4353 away. The only reference to the life string is through the
4356 for (pp
= (void **) start
; (void *) pp
< end
; ++pp
)
4357 mark_maybe_pointer (*pp
);
4360 /* setjmp will work with GCC unless NON_SAVING_SETJMP is defined in
4361 the GCC system configuration. In gcc 3.2, the only systems for
4362 which this is so are i386-sco5 non-ELF, i386-sysv3 (maybe included
4363 by others?) and ns32k-pc532-min. */
4365 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
4367 static int setjmp_tested_p
, longjmps_done
;
4369 #define SETJMP_WILL_LIKELY_WORK "\
4371 Emacs garbage collector has been changed to use conservative stack\n\
4372 marking. Emacs has determined that the method it uses to do the\n\
4373 marking will likely work on your system, but this isn't sure.\n\
4375 If you are a system-programmer, or can get the help of a local wizard\n\
4376 who is, please take a look at the function mark_stack in alloc.c, and\n\
4377 verify that the methods used are appropriate for your system.\n\
4379 Please mail the result to <emacs-devel@gnu.org>.\n\
4382 #define SETJMP_WILL_NOT_WORK "\
4384 Emacs garbage collector has been changed to use conservative stack\n\
4385 marking. Emacs has determined that the default method it uses to do the\n\
4386 marking will not work on your system. We will need a system-dependent\n\
4387 solution for your system.\n\
4389 Please take a look at the function mark_stack in alloc.c, and\n\
4390 try to find a way to make it work on your system.\n\
4392 Note that you may get false negatives, depending on the compiler.\n\
4393 In particular, you need to use -O with GCC for this test.\n\
4395 Please mail the result to <emacs-devel@gnu.org>.\n\
4399 /* Perform a quick check if it looks like setjmp saves registers in a
4400 jmp_buf. Print a message to stderr saying so. When this test
4401 succeeds, this is _not_ a proof that setjmp is sufficient for
4402 conservative stack marking. Only the sources or a disassembly
4413 /* Arrange for X to be put in a register. */
4419 if (longjmps_done
== 1)
4421 /* Came here after the longjmp at the end of the function.
4423 If x == 1, the longjmp has restored the register to its
4424 value before the setjmp, and we can hope that setjmp
4425 saves all such registers in the jmp_buf, although that
4428 For other values of X, either something really strange is
4429 taking place, or the setjmp just didn't save the register. */
4432 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
4435 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
4442 if (longjmps_done
== 1)
4446 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
4449 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4451 /* Abort if anything GCPRO'd doesn't survive the GC. */
4459 for (p
= gcprolist
; p
; p
= p
->next
)
4460 for (i
= 0; i
< p
->nvars
; ++i
)
4461 if (!survives_gc_p (p
->var
[i
]))
4462 /* FIXME: It's not necessarily a bug. It might just be that the
4463 GCPRO is unnecessary or should release the object sooner. */
4467 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4474 fprintf (stderr
, "\nZombies kept alive = %d:\n", nzombies
);
4475 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
4477 fprintf (stderr
, " %d = ", i
);
4478 debug_print (zombies
[i
]);
4482 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4485 /* Mark live Lisp objects on the C stack.
4487 There are several system-dependent problems to consider when
4488 porting this to new architectures:
4492 We have to mark Lisp objects in CPU registers that can hold local
4493 variables or are used to pass parameters.
4495 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
4496 something that either saves relevant registers on the stack, or
4497 calls mark_maybe_object passing it each register's contents.
4499 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
4500 implementation assumes that calling setjmp saves registers we need
4501 to see in a jmp_buf which itself lies on the stack. This doesn't
4502 have to be true! It must be verified for each system, possibly
4503 by taking a look at the source code of setjmp.
4507 Architectures differ in the way their processor stack is organized.
4508 For example, the stack might look like this
4511 | Lisp_Object | size = 4
4513 | something else | size = 2
4515 | Lisp_Object | size = 4
4519 In such a case, not every Lisp_Object will be aligned equally. To
4520 find all Lisp_Object on the stack it won't be sufficient to walk
4521 the stack in steps of 4 bytes. Instead, two passes will be
4522 necessary, one starting at the start of the stack, and a second
4523 pass starting at the start of the stack + 2. Likewise, if the
4524 minimal alignment of Lisp_Objects on the stack is 1, four passes
4525 would be necessary, each one starting with one byte more offset
4526 from the stack start.
4528 The current code assumes by default that Lisp_Objects are aligned
4529 equally on the stack. */
4536 volatile int stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
4539 /* This trick flushes the register windows so that all the state of
4540 the process is contained in the stack. */
4541 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
4542 needed on ia64 too. See mach_dep.c, where it also says inline
4543 assembler doesn't work with relevant proprietary compilers. */
4548 /* Save registers that we need to see on the stack. We need to see
4549 registers used to hold register variables and registers used to
4551 #ifdef GC_SAVE_REGISTERS_ON_STACK
4552 GC_SAVE_REGISTERS_ON_STACK (end
);
4553 #else /* not GC_SAVE_REGISTERS_ON_STACK */
4555 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
4556 setjmp will definitely work, test it
4557 and print a message with the result
4559 if (!setjmp_tested_p
)
4561 setjmp_tested_p
= 1;
4564 #endif /* GC_SETJMP_WORKS */
4567 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
4568 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
4570 /* This assumes that the stack is a contiguous region in memory. If
4571 that's not the case, something has to be done here to iterate
4572 over the stack segments. */
4573 #ifndef GC_LISP_OBJECT_ALIGNMENT
4575 #define GC_LISP_OBJECT_ALIGNMENT __alignof__ (Lisp_Object)
4577 #define GC_LISP_OBJECT_ALIGNMENT sizeof (Lisp_Object)
4580 for (i
= 0; i
< sizeof (Lisp_Object
); i
+= GC_LISP_OBJECT_ALIGNMENT
)
4581 mark_memory ((char *) stack_base
+ i
, end
);
4582 /* Allow for marking a secondary stack, like the register stack on the
4584 #ifdef GC_MARK_SECONDARY_STACK
4585 GC_MARK_SECONDARY_STACK ();
4588 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4593 #endif /* GC_MARK_STACK != 0 */
4597 /* Return 1 if OBJ is a valid lisp object.
4598 Return 0 if OBJ is NOT a valid lisp object.
4599 Return -1 if we cannot validate OBJ.
4600 This function can be quite slow,
4601 so it should only be used in code for manual debugging. */
4604 valid_lisp_object_p (obj
)
4617 p
= (void *) XPNTR (obj
);
4618 if (PURE_POINTER_P (p
))
4622 /* We need to determine whether it is safe to access memory at
4623 address P. Obviously, we cannot just access it (we would SEGV
4624 trying), so we trick the o/s to tell us whether p is a valid
4625 pointer. Unfortunately, we cannot use NULL_DEVICE here, as
4626 emacs_write may not validate p in that case. */
4627 if ((fd
= emacs_open ("__Valid__Lisp__Object__", O_CREAT
| O_WRONLY
| O_TRUNC
, 0666)) >= 0)
4629 int valid
= (emacs_write (fd
, (char *)p
, 16) == 16);
4631 unlink ("__Valid__Lisp__Object__");
4645 case MEM_TYPE_NON_LISP
:
4648 case MEM_TYPE_BUFFER
:
4649 return live_buffer_p (m
, p
);
4652 return live_cons_p (m
, p
);
4654 case MEM_TYPE_STRING
:
4655 return live_string_p (m
, p
);
4658 return live_misc_p (m
, p
);
4660 case MEM_TYPE_SYMBOL
:
4661 return live_symbol_p (m
, p
);
4663 case MEM_TYPE_FLOAT
:
4664 return live_float_p (m
, p
);
4666 case MEM_TYPE_VECTOR
:
4667 case MEM_TYPE_PROCESS
:
4668 case MEM_TYPE_HASH_TABLE
:
4669 case MEM_TYPE_FRAME
:
4670 case MEM_TYPE_WINDOW
:
4671 return live_vector_p (m
, p
);
4684 /***********************************************************************
4685 Pure Storage Management
4686 ***********************************************************************/
4688 /* Allocate room for SIZE bytes from pure Lisp storage and return a
4689 pointer to it. TYPE is the Lisp type for which the memory is
4690 allocated. TYPE < 0 means it's not used for a Lisp object.
4692 If store_pure_type_info is set and TYPE is >= 0, the type of
4693 the allocated object is recorded in pure_types. */
4695 static POINTER_TYPE
*
4696 pure_alloc (size
, type
)
4700 POINTER_TYPE
*result
;
4702 size_t alignment
= (1 << GCTYPEBITS
);
4704 size_t alignment
= sizeof (EMACS_INT
);
4706 /* Give Lisp_Floats an extra alignment. */
4707 if (type
== Lisp_Float
)
4709 #if defined __GNUC__ && __GNUC__ >= 2
4710 alignment
= __alignof (struct Lisp_Float
);
4712 alignment
= sizeof (struct Lisp_Float
);
4718 result
= ALIGN (purebeg
+ pure_bytes_used
, alignment
);
4719 pure_bytes_used
= ((char *)result
- (char *)purebeg
) + size
;
4721 if (pure_bytes_used
<= pure_size
)
4724 /* Don't allocate a large amount here,
4725 because it might get mmap'd and then its address
4726 might not be usable. */
4727 purebeg
= (char *) xmalloc (10000);
4729 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
4730 pure_bytes_used
= 0;
4735 /* Print a warning if PURESIZE is too small. */
4740 if (pure_bytes_used_before_overflow
)
4741 message ("emacs:0:Pure Lisp storage overflow (approx. %d bytes needed)",
4742 (int) (pure_bytes_used
+ pure_bytes_used_before_overflow
));
4746 /* Return a string allocated in pure space. DATA is a buffer holding
4747 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
4748 non-zero means make the result string multibyte.
4750 Must get an error if pure storage is full, since if it cannot hold
4751 a large string it may be able to hold conses that point to that
4752 string; then the string is not protected from gc. */
4755 make_pure_string (data
, nchars
, nbytes
, multibyte
)
4761 struct Lisp_String
*s
;
4763 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4764 s
->data
= (unsigned char *) pure_alloc (nbytes
+ 1, -1);
4766 s
->size_byte
= multibyte
? nbytes
: -1;
4767 bcopy (data
, s
->data
, nbytes
);
4768 s
->data
[nbytes
] = '\0';
4769 s
->intervals
= NULL_INTERVAL
;
4770 XSETSTRING (string
, s
);
4775 /* Return a cons allocated from pure space. Give it pure copies
4776 of CAR as car and CDR as cdr. */
4779 pure_cons (car
, cdr
)
4780 Lisp_Object car
, cdr
;
4782 register Lisp_Object
new;
4783 struct Lisp_Cons
*p
;
4785 p
= (struct Lisp_Cons
*) pure_alloc (sizeof *p
, Lisp_Cons
);
4787 XSETCAR (new, Fpurecopy (car
));
4788 XSETCDR (new, Fpurecopy (cdr
));
4793 /* Value is a float object with value NUM allocated from pure space. */
4796 make_pure_float (num
)
4799 register Lisp_Object
new;
4800 struct Lisp_Float
*p
;
4802 p
= (struct Lisp_Float
*) pure_alloc (sizeof *p
, Lisp_Float
);
4804 XFLOAT_DATA (new) = num
;
4809 /* Return a vector with room for LEN Lisp_Objects allocated from
4813 make_pure_vector (len
)
4817 struct Lisp_Vector
*p
;
4818 size_t size
= sizeof *p
+ (len
- 1) * sizeof (Lisp_Object
);
4820 p
= (struct Lisp_Vector
*) pure_alloc (size
, Lisp_Vectorlike
);
4821 XSETVECTOR (new, p
);
4822 XVECTOR (new)->size
= len
;
4827 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
4828 doc
: /* Make a copy of object OBJ in pure storage.
4829 Recursively copies contents of vectors and cons cells.
4830 Does not copy symbols. Copies strings without text properties. */)
4832 register Lisp_Object obj
;
4834 if (NILP (Vpurify_flag
))
4837 if (PURE_POINTER_P (XPNTR (obj
)))
4841 return pure_cons (XCAR (obj
), XCDR (obj
));
4842 else if (FLOATP (obj
))
4843 return make_pure_float (XFLOAT_DATA (obj
));
4844 else if (STRINGP (obj
))
4845 return make_pure_string (SDATA (obj
), SCHARS (obj
),
4847 STRING_MULTIBYTE (obj
));
4848 else if (COMPILEDP (obj
) || VECTORP (obj
))
4850 register struct Lisp_Vector
*vec
;
4854 size
= XVECTOR (obj
)->size
;
4855 if (size
& PSEUDOVECTOR_FLAG
)
4856 size
&= PSEUDOVECTOR_SIZE_MASK
;
4857 vec
= XVECTOR (make_pure_vector (size
));
4858 for (i
= 0; i
< size
; i
++)
4859 vec
->contents
[i
] = Fpurecopy (XVECTOR (obj
)->contents
[i
]);
4860 if (COMPILEDP (obj
))
4861 XSETCOMPILED (obj
, vec
);
4863 XSETVECTOR (obj
, vec
);
4866 else if (MARKERP (obj
))
4867 error ("Attempt to copy a marker to pure storage");
4874 /***********************************************************************
4876 ***********************************************************************/
4878 /* Put an entry in staticvec, pointing at the variable with address
4882 staticpro (varaddress
)
4883 Lisp_Object
*varaddress
;
4885 staticvec
[staticidx
++] = varaddress
;
4886 if (staticidx
>= NSTATICS
)
4894 struct catchtag
*next
;
4898 /***********************************************************************
4900 ***********************************************************************/
4902 /* Temporarily prevent garbage collection. */
4905 inhibit_garbage_collection ()
4907 int count
= SPECPDL_INDEX ();
4908 int nbits
= min (VALBITS
, BITS_PER_INT
);
4910 specbind (Qgc_cons_threshold
, make_number (((EMACS_INT
) 1 << (nbits
- 1)) - 1));
4915 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
4916 doc
: /* Reclaim storage for Lisp objects no longer needed.
4917 Garbage collection happens automatically if you cons more than
4918 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
4919 `garbage-collect' normally returns a list with info on amount of space in use:
4920 ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)
4921 (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS
4922 (USED-FLOATS . FREE-FLOATS) (USED-INTERVALS . FREE-INTERVALS)
4923 (USED-STRINGS . FREE-STRINGS))
4924 However, if there was overflow in pure space, `garbage-collect'
4925 returns nil, because real GC can't be done. */)
4928 register struct specbinding
*bind
;
4929 struct catchtag
*catch;
4930 struct handler
*handler
;
4931 char stack_top_variable
;
4934 Lisp_Object total
[8];
4935 int count
= SPECPDL_INDEX ();
4936 EMACS_TIME t1
, t2
, t3
;
4941 /* Can't GC if pure storage overflowed because we can't determine
4942 if something is a pure object or not. */
4943 if (pure_bytes_used_before_overflow
)
4948 /* Don't keep undo information around forever.
4949 Do this early on, so it is no problem if the user quits. */
4951 register struct buffer
*nextb
= all_buffers
;
4955 /* If a buffer's undo list is Qt, that means that undo is
4956 turned off in that buffer. Calling truncate_undo_list on
4957 Qt tends to return NULL, which effectively turns undo back on.
4958 So don't call truncate_undo_list if undo_list is Qt. */
4959 if (! NILP (nextb
->name
) && ! EQ (nextb
->undo_list
, Qt
))
4960 truncate_undo_list (nextb
);
4962 /* Shrink buffer gaps, but skip indirect and dead buffers. */
4963 if (nextb
->base_buffer
== 0 && !NILP (nextb
->name
))
4965 /* If a buffer's gap size is more than 10% of the buffer
4966 size, or larger than 2000 bytes, then shrink it
4967 accordingly. Keep a minimum size of 20 bytes. */
4968 int size
= min (2000, max (20, (nextb
->text
->z_byte
/ 10)));
4970 if (nextb
->text
->gap_size
> size
)
4972 struct buffer
*save_current
= current_buffer
;
4973 current_buffer
= nextb
;
4974 make_gap (-(nextb
->text
->gap_size
- size
));
4975 current_buffer
= save_current
;
4979 nextb
= nextb
->next
;
4983 EMACS_GET_TIME (t1
);
4985 /* In case user calls debug_print during GC,
4986 don't let that cause a recursive GC. */
4987 consing_since_gc
= 0;
4989 /* Save what's currently displayed in the echo area. */
4990 message_p
= push_message ();
4991 record_unwind_protect (pop_message_unwind
, Qnil
);
4993 /* Save a copy of the contents of the stack, for debugging. */
4994 #if MAX_SAVE_STACK > 0
4995 if (NILP (Vpurify_flag
))
4997 i
= &stack_top_variable
- stack_bottom
;
4999 if (i
< MAX_SAVE_STACK
)
5001 if (stack_copy
== 0)
5002 stack_copy
= (char *) xmalloc (stack_copy_size
= i
);
5003 else if (stack_copy_size
< i
)
5004 stack_copy
= (char *) xrealloc (stack_copy
, (stack_copy_size
= i
));
5007 if ((EMACS_INT
) (&stack_top_variable
- stack_bottom
) > 0)
5008 bcopy (stack_bottom
, stack_copy
, i
);
5010 bcopy (&stack_top_variable
, stack_copy
, i
);
5014 #endif /* MAX_SAVE_STACK > 0 */
5016 if (garbage_collection_messages
)
5017 message1_nolog ("Garbage collecting...");
5021 shrink_regexp_cache ();
5025 /* clear_marks (); */
5027 /* Mark all the special slots that serve as the roots of accessibility. */
5029 for (i
= 0; i
< staticidx
; i
++)
5030 mark_object (*staticvec
[i
]);
5032 for (bind
= specpdl
; bind
!= specpdl_ptr
; bind
++)
5034 mark_object (bind
->symbol
);
5035 mark_object (bind
->old_value
);
5041 extern void xg_mark_data ();
5046 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
5047 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
5051 register struct gcpro
*tail
;
5052 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
5053 for (i
= 0; i
< tail
->nvars
; i
++)
5054 mark_object (tail
->var
[i
]);
5059 for (catch = catchlist
; catch; catch = catch->next
)
5061 mark_object (catch->tag
);
5062 mark_object (catch->val
);
5064 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
5066 mark_object (handler
->handler
);
5067 mark_object (handler
->var
);
5071 #ifdef HAVE_WINDOW_SYSTEM
5072 mark_fringe_data ();
5075 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5079 /* Everything is now marked, except for the things that require special
5080 finalization, i.e. the undo_list.
5081 Look thru every buffer's undo list
5082 for elements that update markers that were not marked,
5085 register struct buffer
*nextb
= all_buffers
;
5089 /* If a buffer's undo list is Qt, that means that undo is
5090 turned off in that buffer. Calling truncate_undo_list on
5091 Qt tends to return NULL, which effectively turns undo back on.
5092 So don't call truncate_undo_list if undo_list is Qt. */
5093 if (! EQ (nextb
->undo_list
, Qt
))
5095 Lisp_Object tail
, prev
;
5096 tail
= nextb
->undo_list
;
5098 while (CONSP (tail
))
5100 if (GC_CONSP (XCAR (tail
))
5101 && GC_MARKERP (XCAR (XCAR (tail
)))
5102 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
5105 nextb
->undo_list
= tail
= XCDR (tail
);
5109 XSETCDR (prev
, tail
);
5119 /* Now that we have stripped the elements that need not be in the
5120 undo_list any more, we can finally mark the list. */
5121 mark_object (nextb
->undo_list
);
5123 nextb
= nextb
->next
;
5129 /* Clear the mark bits that we set in certain root slots. */
5131 unmark_byte_stack ();
5132 VECTOR_UNMARK (&buffer_defaults
);
5133 VECTOR_UNMARK (&buffer_local_symbols
);
5135 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
5143 /* clear_marks (); */
5146 consing_since_gc
= 0;
5147 if (gc_cons_threshold
< 10000)
5148 gc_cons_threshold
= 10000;
5150 if (FLOATP (Vgc_cons_percentage
))
5151 { /* Set gc_cons_combined_threshold. */
5152 EMACS_INT total
= 0;
5154 total
+= total_conses
* sizeof (struct Lisp_Cons
);
5155 total
+= total_symbols
* sizeof (struct Lisp_Symbol
);
5156 total
+= total_markers
* sizeof (union Lisp_Misc
);
5157 total
+= total_string_size
;
5158 total
+= total_vector_size
* sizeof (Lisp_Object
);
5159 total
+= total_floats
* sizeof (struct Lisp_Float
);
5160 total
+= total_intervals
* sizeof (struct interval
);
5161 total
+= total_strings
* sizeof (struct Lisp_String
);
5163 gc_relative_threshold
= total
* XFLOAT_DATA (Vgc_cons_percentage
);
5166 gc_relative_threshold
= 0;
5168 if (garbage_collection_messages
)
5170 if (message_p
|| minibuf_level
> 0)
5173 message1_nolog ("Garbage collecting...done");
5176 unbind_to (count
, Qnil
);
5178 total
[0] = Fcons (make_number (total_conses
),
5179 make_number (total_free_conses
));
5180 total
[1] = Fcons (make_number (total_symbols
),
5181 make_number (total_free_symbols
));
5182 total
[2] = Fcons (make_number (total_markers
),
5183 make_number (total_free_markers
));
5184 total
[3] = make_number (total_string_size
);
5185 total
[4] = make_number (total_vector_size
);
5186 total
[5] = Fcons (make_number (total_floats
),
5187 make_number (total_free_floats
));
5188 total
[6] = Fcons (make_number (total_intervals
),
5189 make_number (total_free_intervals
));
5190 total
[7] = Fcons (make_number (total_strings
),
5191 make_number (total_free_strings
));
5193 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5195 /* Compute average percentage of zombies. */
5198 for (i
= 0; i
< 7; ++i
)
5199 if (CONSP (total
[i
]))
5200 nlive
+= XFASTINT (XCAR (total
[i
]));
5202 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
5203 max_live
= max (nlive
, max_live
);
5204 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
5205 max_zombies
= max (nzombies
, max_zombies
);
5210 if (!NILP (Vpost_gc_hook
))
5212 int count
= inhibit_garbage_collection ();
5213 safe_run_hooks (Qpost_gc_hook
);
5214 unbind_to (count
, Qnil
);
5217 /* Accumulate statistics. */
5218 EMACS_GET_TIME (t2
);
5219 EMACS_SUB_TIME (t3
, t2
, t1
);
5220 if (FLOATP (Vgc_elapsed
))
5221 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
) +
5223 EMACS_USECS (t3
) * 1.0e-6);
5226 return Flist (sizeof total
/ sizeof *total
, total
);
5230 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
5231 only interesting objects referenced from glyphs are strings. */
5234 mark_glyph_matrix (matrix
)
5235 struct glyph_matrix
*matrix
;
5237 struct glyph_row
*row
= matrix
->rows
;
5238 struct glyph_row
*end
= row
+ matrix
->nrows
;
5240 for (; row
< end
; ++row
)
5244 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
5246 struct glyph
*glyph
= row
->glyphs
[area
];
5247 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
5249 for (; glyph
< end_glyph
; ++glyph
)
5250 if (GC_STRINGP (glyph
->object
)
5251 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
5252 mark_object (glyph
->object
);
5258 /* Mark Lisp faces in the face cache C. */
5262 struct face_cache
*c
;
5267 for (i
= 0; i
< c
->used
; ++i
)
5269 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
5273 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
5274 mark_object (face
->lface
[j
]);
5281 #ifdef HAVE_WINDOW_SYSTEM
5283 /* Mark Lisp objects in image IMG. */
5289 mark_object (img
->spec
);
5291 if (!NILP (img
->data
.lisp_val
))
5292 mark_object (img
->data
.lisp_val
);
5296 /* Mark Lisp objects in image cache of frame F. It's done this way so
5297 that we don't have to include xterm.h here. */
5300 mark_image_cache (f
)
5303 forall_images_in_image_cache (f
, mark_image
);
5306 #endif /* HAVE_X_WINDOWS */
5310 /* Mark reference to a Lisp_Object.
5311 If the object referred to has not been seen yet, recursively mark
5312 all the references contained in it. */
5314 #define LAST_MARKED_SIZE 500
5315 Lisp_Object last_marked
[LAST_MARKED_SIZE
];
5316 int last_marked_index
;
5318 /* For debugging--call abort when we cdr down this many
5319 links of a list, in mark_object. In debugging,
5320 the call to abort will hit a breakpoint.
5321 Normally this is zero and the check never goes off. */
5322 int mark_object_loop_halt
;
5328 register Lisp_Object obj
= arg
;
5329 #ifdef GC_CHECK_MARKED_OBJECTS
5337 if (PURE_POINTER_P (XPNTR (obj
)))
5340 last_marked
[last_marked_index
++] = obj
;
5341 if (last_marked_index
== LAST_MARKED_SIZE
)
5342 last_marked_index
= 0;
5344 /* Perform some sanity checks on the objects marked here. Abort if
5345 we encounter an object we know is bogus. This increases GC time
5346 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
5347 #ifdef GC_CHECK_MARKED_OBJECTS
5349 po
= (void *) XPNTR (obj
);
5351 /* Check that the object pointed to by PO is known to be a Lisp
5352 structure allocated from the heap. */
5353 #define CHECK_ALLOCATED() \
5355 m = mem_find (po); \
5360 /* Check that the object pointed to by PO is live, using predicate
5362 #define CHECK_LIVE(LIVEP) \
5364 if (!LIVEP (m, po)) \
5368 /* Check both of the above conditions. */
5369 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
5371 CHECK_ALLOCATED (); \
5372 CHECK_LIVE (LIVEP); \
5375 #else /* not GC_CHECK_MARKED_OBJECTS */
5377 #define CHECK_ALLOCATED() (void) 0
5378 #define CHECK_LIVE(LIVEP) (void) 0
5379 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
5381 #endif /* not GC_CHECK_MARKED_OBJECTS */
5383 switch (SWITCH_ENUM_CAST (XGCTYPE (obj
)))
5387 register struct Lisp_String
*ptr
= XSTRING (obj
);
5388 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
5389 MARK_INTERVAL_TREE (ptr
->intervals
);
5391 #ifdef GC_CHECK_STRING_BYTES
5392 /* Check that the string size recorded in the string is the
5393 same as the one recorded in the sdata structure. */
5394 CHECK_STRING_BYTES (ptr
);
5395 #endif /* GC_CHECK_STRING_BYTES */
5399 case Lisp_Vectorlike
:
5400 #ifdef GC_CHECK_MARKED_OBJECTS
5402 if (m
== MEM_NIL
&& !GC_SUBRP (obj
)
5403 && po
!= &buffer_defaults
5404 && po
!= &buffer_local_symbols
)
5406 #endif /* GC_CHECK_MARKED_OBJECTS */
5408 if (GC_BUFFERP (obj
))
5410 if (!VECTOR_MARKED_P (XBUFFER (obj
)))
5412 #ifdef GC_CHECK_MARKED_OBJECTS
5413 if (po
!= &buffer_defaults
&& po
!= &buffer_local_symbols
)
5416 for (b
= all_buffers
; b
&& b
!= po
; b
= b
->next
)
5421 #endif /* GC_CHECK_MARKED_OBJECTS */
5425 else if (GC_SUBRP (obj
))
5427 else if (GC_COMPILEDP (obj
))
5428 /* We could treat this just like a vector, but it is better to
5429 save the COMPILED_CONSTANTS element for last and avoid
5432 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5433 register EMACS_INT size
= ptr
->size
;
5436 if (VECTOR_MARKED_P (ptr
))
5437 break; /* Already marked */
5439 CHECK_LIVE (live_vector_p
);
5440 VECTOR_MARK (ptr
); /* Else mark it */
5441 size
&= PSEUDOVECTOR_SIZE_MASK
;
5442 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5444 if (i
!= COMPILED_CONSTANTS
)
5445 mark_object (ptr
->contents
[i
]);
5447 obj
= ptr
->contents
[COMPILED_CONSTANTS
];
5450 else if (GC_FRAMEP (obj
))
5452 register struct frame
*ptr
= XFRAME (obj
);
5454 if (VECTOR_MARKED_P (ptr
)) break; /* Already marked */
5455 VECTOR_MARK (ptr
); /* Else mark it */
5457 CHECK_LIVE (live_vector_p
);
5458 mark_object (ptr
->name
);
5459 mark_object (ptr
->icon_name
);
5460 mark_object (ptr
->title
);
5461 mark_object (ptr
->focus_frame
);
5462 mark_object (ptr
->selected_window
);
5463 mark_object (ptr
->minibuffer_window
);
5464 mark_object (ptr
->param_alist
);
5465 mark_object (ptr
->scroll_bars
);
5466 mark_object (ptr
->condemned_scroll_bars
);
5467 mark_object (ptr
->menu_bar_items
);
5468 mark_object (ptr
->face_alist
);
5469 mark_object (ptr
->menu_bar_vector
);
5470 mark_object (ptr
->buffer_predicate
);
5471 mark_object (ptr
->buffer_list
);
5472 mark_object (ptr
->menu_bar_window
);
5473 mark_object (ptr
->tool_bar_window
);
5474 mark_face_cache (ptr
->face_cache
);
5475 #ifdef HAVE_WINDOW_SYSTEM
5476 mark_image_cache (ptr
);
5477 mark_object (ptr
->tool_bar_items
);
5478 mark_object (ptr
->desired_tool_bar_string
);
5479 mark_object (ptr
->current_tool_bar_string
);
5480 #endif /* HAVE_WINDOW_SYSTEM */
5482 else if (GC_BOOL_VECTOR_P (obj
))
5484 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5486 if (VECTOR_MARKED_P (ptr
))
5487 break; /* Already marked */
5488 CHECK_LIVE (live_vector_p
);
5489 VECTOR_MARK (ptr
); /* Else mark it */
5491 else if (GC_WINDOWP (obj
))
5493 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5494 struct window
*w
= XWINDOW (obj
);
5497 /* Stop if already marked. */
5498 if (VECTOR_MARKED_P (ptr
))
5502 CHECK_LIVE (live_vector_p
);
5505 /* There is no Lisp data above The member CURRENT_MATRIX in
5506 struct WINDOW. Stop marking when that slot is reached. */
5508 (char *) &ptr
->contents
[i
] < (char *) &w
->current_matrix
;
5510 mark_object (ptr
->contents
[i
]);
5512 /* Mark glyphs for leaf windows. Marking window matrices is
5513 sufficient because frame matrices use the same glyph
5515 if (NILP (w
->hchild
)
5517 && w
->current_matrix
)
5519 mark_glyph_matrix (w
->current_matrix
);
5520 mark_glyph_matrix (w
->desired_matrix
);
5523 else if (GC_HASH_TABLE_P (obj
))
5525 struct Lisp_Hash_Table
*h
= XHASH_TABLE (obj
);
5527 /* Stop if already marked. */
5528 if (VECTOR_MARKED_P (h
))
5532 CHECK_LIVE (live_vector_p
);
5535 /* Mark contents. */
5536 /* Do not mark next_free or next_weak.
5537 Being in the next_weak chain
5538 should not keep the hash table alive.
5539 No need to mark `count' since it is an integer. */
5540 mark_object (h
->test
);
5541 mark_object (h
->weak
);
5542 mark_object (h
->rehash_size
);
5543 mark_object (h
->rehash_threshold
);
5544 mark_object (h
->hash
);
5545 mark_object (h
->next
);
5546 mark_object (h
->index
);
5547 mark_object (h
->user_hash_function
);
5548 mark_object (h
->user_cmp_function
);
5550 /* If hash table is not weak, mark all keys and values.
5551 For weak tables, mark only the vector. */
5552 if (GC_NILP (h
->weak
))
5553 mark_object (h
->key_and_value
);
5555 VECTOR_MARK (XVECTOR (h
->key_and_value
));
5559 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5560 register EMACS_INT size
= ptr
->size
;
5563 if (VECTOR_MARKED_P (ptr
)) break; /* Already marked */
5564 CHECK_LIVE (live_vector_p
);
5565 VECTOR_MARK (ptr
); /* Else mark it */
5566 if (size
& PSEUDOVECTOR_FLAG
)
5567 size
&= PSEUDOVECTOR_SIZE_MASK
;
5569 /* Note that this size is not the memory-footprint size, but only
5570 the number of Lisp_Object fields that we should trace.
5571 The distinction is used e.g. by Lisp_Process which places extra
5572 non-Lisp_Object fields at the end of the structure. */
5573 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5574 mark_object (ptr
->contents
[i
]);
5580 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
5581 struct Lisp_Symbol
*ptrx
;
5583 if (ptr
->gcmarkbit
) break;
5584 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
5586 mark_object (ptr
->value
);
5587 mark_object (ptr
->function
);
5588 mark_object (ptr
->plist
);
5590 if (!PURE_POINTER_P (XSTRING (ptr
->xname
)))
5591 MARK_STRING (XSTRING (ptr
->xname
));
5592 MARK_INTERVAL_TREE (STRING_INTERVALS (ptr
->xname
));
5594 /* Note that we do not mark the obarray of the symbol.
5595 It is safe not to do so because nothing accesses that
5596 slot except to check whether it is nil. */
5600 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun */
5601 XSETSYMBOL (obj
, ptrx
);
5608 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
5609 if (XMARKER (obj
)->gcmarkbit
)
5611 XMARKER (obj
)->gcmarkbit
= 1;
5613 switch (XMISCTYPE (obj
))
5615 case Lisp_Misc_Buffer_Local_Value
:
5616 case Lisp_Misc_Some_Buffer_Local_Value
:
5618 register struct Lisp_Buffer_Local_Value
*ptr
5619 = XBUFFER_LOCAL_VALUE (obj
);
5620 /* If the cdr is nil, avoid recursion for the car. */
5621 if (EQ (ptr
->cdr
, Qnil
))
5623 obj
= ptr
->realvalue
;
5626 mark_object (ptr
->realvalue
);
5627 mark_object (ptr
->buffer
);
5628 mark_object (ptr
->frame
);
5633 case Lisp_Misc_Marker
:
5634 /* DO NOT mark thru the marker's chain.
5635 The buffer's markers chain does not preserve markers from gc;
5636 instead, markers are removed from the chain when freed by gc. */
5639 case Lisp_Misc_Intfwd
:
5640 case Lisp_Misc_Boolfwd
:
5641 case Lisp_Misc_Objfwd
:
5642 case Lisp_Misc_Buffer_Objfwd
:
5643 case Lisp_Misc_Kboard_Objfwd
:
5644 /* Don't bother with Lisp_Buffer_Objfwd,
5645 since all markable slots in current buffer marked anyway. */
5646 /* Don't need to do Lisp_Objfwd, since the places they point
5647 are protected with staticpro. */
5650 case Lisp_Misc_Save_Value
:
5653 register struct Lisp_Save_Value
*ptr
= XSAVE_VALUE (obj
);
5654 /* If DOGC is set, POINTER is the address of a memory
5655 area containing INTEGER potential Lisp_Objects. */
5658 Lisp_Object
*p
= (Lisp_Object
*) ptr
->pointer
;
5660 for (nelt
= ptr
->integer
; nelt
> 0; nelt
--, p
++)
5661 mark_maybe_object (*p
);
5667 case Lisp_Misc_Overlay
:
5669 struct Lisp_Overlay
*ptr
= XOVERLAY (obj
);
5670 mark_object (ptr
->start
);
5671 mark_object (ptr
->end
);
5672 mark_object (ptr
->plist
);
5675 XSETMISC (obj
, ptr
->next
);
5688 register struct Lisp_Cons
*ptr
= XCONS (obj
);
5689 if (CONS_MARKED_P (ptr
)) break;
5690 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
5692 /* If the cdr is nil, avoid recursion for the car. */
5693 if (EQ (ptr
->u
.cdr
, Qnil
))
5699 mark_object (ptr
->car
);
5702 if (cdr_count
== mark_object_loop_halt
)
5708 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
5709 FLOAT_MARK (XFLOAT (obj
));
5720 #undef CHECK_ALLOCATED
5721 #undef CHECK_ALLOCATED_AND_LIVE
5724 /* Mark the pointers in a buffer structure. */
5730 register struct buffer
*buffer
= XBUFFER (buf
);
5731 register Lisp_Object
*ptr
, tmp
;
5732 Lisp_Object base_buffer
;
5734 VECTOR_MARK (buffer
);
5736 MARK_INTERVAL_TREE (BUF_INTERVALS (buffer
));
5738 /* For now, we just don't mark the undo_list. It's done later in
5739 a special way just before the sweep phase, and after stripping
5740 some of its elements that are not needed any more. */
5742 if (buffer
->overlays_before
)
5744 XSETMISC (tmp
, buffer
->overlays_before
);
5747 if (buffer
->overlays_after
)
5749 XSETMISC (tmp
, buffer
->overlays_after
);
5753 for (ptr
= &buffer
->name
;
5754 (char *)ptr
< (char *)buffer
+ sizeof (struct buffer
);
5758 /* If this is an indirect buffer, mark its base buffer. */
5759 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
5761 XSETBUFFER (base_buffer
, buffer
->base_buffer
);
5762 mark_buffer (base_buffer
);
5767 /* Value is non-zero if OBJ will survive the current GC because it's
5768 either marked or does not need to be marked to survive. */
5776 switch (XGCTYPE (obj
))
5783 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
5787 survives_p
= XMARKER (obj
)->gcmarkbit
;
5791 survives_p
= STRING_MARKED_P (XSTRING (obj
));
5794 case Lisp_Vectorlike
:
5795 survives_p
= GC_SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
5799 survives_p
= CONS_MARKED_P (XCONS (obj
));
5803 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
5810 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
5815 /* Sweep: find all structures not marked, and free them. */
5820 /* Remove or mark entries in weak hash tables.
5821 This must be done before any object is unmarked. */
5822 sweep_weak_hash_tables ();
5825 #ifdef GC_CHECK_STRING_BYTES
5826 if (!noninteractive
)
5827 check_string_bytes (1);
5830 /* Put all unmarked conses on free list */
5832 register struct cons_block
*cblk
;
5833 struct cons_block
**cprev
= &cons_block
;
5834 register int lim
= cons_block_index
;
5835 register int num_free
= 0, num_used
= 0;
5839 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
5843 for (i
= 0; i
< lim
; i
++)
5844 if (!CONS_MARKED_P (&cblk
->conses
[i
]))
5847 cblk
->conses
[i
].u
.chain
= cons_free_list
;
5848 cons_free_list
= &cblk
->conses
[i
];
5850 cons_free_list
->car
= Vdead
;
5856 CONS_UNMARK (&cblk
->conses
[i
]);
5858 lim
= CONS_BLOCK_SIZE
;
5859 /* If this block contains only free conses and we have already
5860 seen more than two blocks worth of free conses then deallocate
5862 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
5864 *cprev
= cblk
->next
;
5865 /* Unhook from the free list. */
5866 cons_free_list
= cblk
->conses
[0].u
.chain
;
5867 lisp_align_free (cblk
);
5872 num_free
+= this_free
;
5873 cprev
= &cblk
->next
;
5876 total_conses
= num_used
;
5877 total_free_conses
= num_free
;
5880 /* Put all unmarked floats on free list */
5882 register struct float_block
*fblk
;
5883 struct float_block
**fprev
= &float_block
;
5884 register int lim
= float_block_index
;
5885 register int num_free
= 0, num_used
= 0;
5887 float_free_list
= 0;
5889 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
5893 for (i
= 0; i
< lim
; i
++)
5894 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
5897 fblk
->floats
[i
].u
.chain
= float_free_list
;
5898 float_free_list
= &fblk
->floats
[i
];
5903 FLOAT_UNMARK (&fblk
->floats
[i
]);
5905 lim
= FLOAT_BLOCK_SIZE
;
5906 /* If this block contains only free floats and we have already
5907 seen more than two blocks worth of free floats then deallocate
5909 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
5911 *fprev
= fblk
->next
;
5912 /* Unhook from the free list. */
5913 float_free_list
= fblk
->floats
[0].u
.chain
;
5914 lisp_align_free (fblk
);
5919 num_free
+= this_free
;
5920 fprev
= &fblk
->next
;
5923 total_floats
= num_used
;
5924 total_free_floats
= num_free
;
5927 /* Put all unmarked intervals on free list */
5929 register struct interval_block
*iblk
;
5930 struct interval_block
**iprev
= &interval_block
;
5931 register int lim
= interval_block_index
;
5932 register int num_free
= 0, num_used
= 0;
5934 interval_free_list
= 0;
5936 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
5941 for (i
= 0; i
< lim
; i
++)
5943 if (!iblk
->intervals
[i
].gcmarkbit
)
5945 SET_INTERVAL_PARENT (&iblk
->intervals
[i
], interval_free_list
);
5946 interval_free_list
= &iblk
->intervals
[i
];
5952 iblk
->intervals
[i
].gcmarkbit
= 0;
5955 lim
= INTERVAL_BLOCK_SIZE
;
5956 /* If this block contains only free intervals and we have already
5957 seen more than two blocks worth of free intervals then
5958 deallocate this block. */
5959 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
5961 *iprev
= iblk
->next
;
5962 /* Unhook from the free list. */
5963 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
5965 n_interval_blocks
--;
5969 num_free
+= this_free
;
5970 iprev
= &iblk
->next
;
5973 total_intervals
= num_used
;
5974 total_free_intervals
= num_free
;
5977 /* Put all unmarked symbols on free list */
5979 register struct symbol_block
*sblk
;
5980 struct symbol_block
**sprev
= &symbol_block
;
5981 register int lim
= symbol_block_index
;
5982 register int num_free
= 0, num_used
= 0;
5984 symbol_free_list
= NULL
;
5986 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
5989 struct Lisp_Symbol
*sym
= sblk
->symbols
;
5990 struct Lisp_Symbol
*end
= sym
+ lim
;
5992 for (; sym
< end
; ++sym
)
5994 /* Check if the symbol was created during loadup. In such a case
5995 it might be pointed to by pure bytecode which we don't trace,
5996 so we conservatively assume that it is live. */
5997 int pure_p
= PURE_POINTER_P (XSTRING (sym
->xname
));
5999 if (!sym
->gcmarkbit
&& !pure_p
)
6001 sym
->next
= symbol_free_list
;
6002 symbol_free_list
= sym
;
6004 symbol_free_list
->function
= Vdead
;
6012 UNMARK_STRING (XSTRING (sym
->xname
));
6017 lim
= SYMBOL_BLOCK_SIZE
;
6018 /* If this block contains only free symbols and we have already
6019 seen more than two blocks worth of free symbols then deallocate
6021 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
6023 *sprev
= sblk
->next
;
6024 /* Unhook from the free list. */
6025 symbol_free_list
= sblk
->symbols
[0].next
;
6031 num_free
+= this_free
;
6032 sprev
= &sblk
->next
;
6035 total_symbols
= num_used
;
6036 total_free_symbols
= num_free
;
6039 /* Put all unmarked misc's on free list.
6040 For a marker, first unchain it from the buffer it points into. */
6042 register struct marker_block
*mblk
;
6043 struct marker_block
**mprev
= &marker_block
;
6044 register int lim
= marker_block_index
;
6045 register int num_free
= 0, num_used
= 0;
6047 marker_free_list
= 0;
6049 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
6054 for (i
= 0; i
< lim
; i
++)
6056 if (!mblk
->markers
[i
].u_marker
.gcmarkbit
)
6058 if (mblk
->markers
[i
].u_marker
.type
== Lisp_Misc_Marker
)
6059 unchain_marker (&mblk
->markers
[i
].u_marker
);
6060 /* Set the type of the freed object to Lisp_Misc_Free.
6061 We could leave the type alone, since nobody checks it,
6062 but this might catch bugs faster. */
6063 mblk
->markers
[i
].u_marker
.type
= Lisp_Misc_Free
;
6064 mblk
->markers
[i
].u_free
.chain
= marker_free_list
;
6065 marker_free_list
= &mblk
->markers
[i
];
6071 mblk
->markers
[i
].u_marker
.gcmarkbit
= 0;
6074 lim
= MARKER_BLOCK_SIZE
;
6075 /* If this block contains only free markers and we have already
6076 seen more than two blocks worth of free markers then deallocate
6078 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
6080 *mprev
= mblk
->next
;
6081 /* Unhook from the free list. */
6082 marker_free_list
= mblk
->markers
[0].u_free
.chain
;
6088 num_free
+= this_free
;
6089 mprev
= &mblk
->next
;
6093 total_markers
= num_used
;
6094 total_free_markers
= num_free
;
6097 /* Free all unmarked buffers */
6099 register struct buffer
*buffer
= all_buffers
, *prev
= 0, *next
;
6102 if (!VECTOR_MARKED_P (buffer
))
6105 prev
->next
= buffer
->next
;
6107 all_buffers
= buffer
->next
;
6108 next
= buffer
->next
;
6114 VECTOR_UNMARK (buffer
);
6115 UNMARK_BALANCE_INTERVALS (BUF_INTERVALS (buffer
));
6116 prev
= buffer
, buffer
= buffer
->next
;
6120 /* Free all unmarked vectors */
6122 register struct Lisp_Vector
*vector
= all_vectors
, *prev
= 0, *next
;
6123 total_vector_size
= 0;
6126 if (!VECTOR_MARKED_P (vector
))
6129 prev
->next
= vector
->next
;
6131 all_vectors
= vector
->next
;
6132 next
= vector
->next
;
6140 VECTOR_UNMARK (vector
);
6141 if (vector
->size
& PSEUDOVECTOR_FLAG
)
6142 total_vector_size
+= (PSEUDOVECTOR_SIZE_MASK
& vector
->size
);
6144 total_vector_size
+= vector
->size
;
6145 prev
= vector
, vector
= vector
->next
;
6149 #ifdef GC_CHECK_STRING_BYTES
6150 if (!noninteractive
)
6151 check_string_bytes (1);
6158 /* Debugging aids. */
6160 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
6161 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
6162 This may be helpful in debugging Emacs's memory usage.
6163 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
6168 XSETINT (end
, (EMACS_INT
) sbrk (0) / 1024);
6173 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
6174 doc
: /* Return a list of counters that measure how much consing there has been.
6175 Each of these counters increments for a certain kind of object.
6176 The counters wrap around from the largest positive integer to zero.
6177 Garbage collection does not decrease them.
6178 The elements of the value are as follows:
6179 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
6180 All are in units of 1 = one object consed
6181 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
6183 MISCS include overlays, markers, and some internal types.
6184 Frames, windows, buffers, and subprocesses count as vectors
6185 (but the contents of a buffer's text do not count here). */)
6188 Lisp_Object consed
[8];
6190 consed
[0] = make_number (min (MOST_POSITIVE_FIXNUM
, cons_cells_consed
));
6191 consed
[1] = make_number (min (MOST_POSITIVE_FIXNUM
, floats_consed
));
6192 consed
[2] = make_number (min (MOST_POSITIVE_FIXNUM
, vector_cells_consed
));
6193 consed
[3] = make_number (min (MOST_POSITIVE_FIXNUM
, symbols_consed
));
6194 consed
[4] = make_number (min (MOST_POSITIVE_FIXNUM
, string_chars_consed
));
6195 consed
[5] = make_number (min (MOST_POSITIVE_FIXNUM
, misc_objects_consed
));
6196 consed
[6] = make_number (min (MOST_POSITIVE_FIXNUM
, intervals_consed
));
6197 consed
[7] = make_number (min (MOST_POSITIVE_FIXNUM
, strings_consed
));
6199 return Flist (8, consed
);
6202 int suppress_checking
;
6204 die (msg
, file
, line
)
6209 fprintf (stderr
, "\r\nEmacs fatal error: %s:%d: %s\r\n",
6214 /* Initialization */
6219 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
6221 pure_size
= PURESIZE
;
6222 pure_bytes_used
= 0;
6223 pure_bytes_used_before_overflow
= 0;
6225 /* Initialize the list of free aligned blocks. */
6228 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
6230 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
6234 ignore_warnings
= 1;
6235 #ifdef DOUG_LEA_MALLOC
6236 mallopt (M_TRIM_THRESHOLD
, 128*1024); /* trim threshold */
6237 mallopt (M_MMAP_THRESHOLD
, 64*1024); /* mmap threshold */
6238 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* max. number of mmap'ed areas */
6248 malloc_hysteresis
= 32;
6250 malloc_hysteresis
= 0;
6253 refill_memory_reserve ();
6255 ignore_warnings
= 0;
6257 byte_stack_list
= 0;
6259 consing_since_gc
= 0;
6260 gc_cons_threshold
= 100000 * sizeof (Lisp_Object
);
6261 gc_relative_threshold
= 0;
6263 #ifdef VIRT_ADDR_VARIES
6264 malloc_sbrk_unused
= 1<<22; /* A large number */
6265 malloc_sbrk_used
= 100000; /* as reasonable as any number */
6266 #endif /* VIRT_ADDR_VARIES */
6273 byte_stack_list
= 0;
6275 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
6276 setjmp_tested_p
= longjmps_done
= 0;
6279 Vgc_elapsed
= make_float (0.0);
6286 DEFVAR_INT ("gc-cons-threshold", &gc_cons_threshold
,
6287 doc
: /* *Number of bytes of consing between garbage collections.
6288 Garbage collection can happen automatically once this many bytes have been
6289 allocated since the last garbage collection. All data types count.
6291 Garbage collection happens automatically only when `eval' is called.
6293 By binding this temporarily to a large number, you can effectively
6294 prevent garbage collection during a part of the program.
6295 See also `gc-cons-percentage'. */);
6297 DEFVAR_LISP ("gc-cons-percentage", &Vgc_cons_percentage
,
6298 doc
: /* *Portion of the heap used for allocation.
6299 Garbage collection can happen automatically once this portion of the heap
6300 has been allocated since the last garbage collection.
6301 If this portion is smaller than `gc-cons-threshold', this is ignored. */);
6302 Vgc_cons_percentage
= make_float (0.1);
6304 DEFVAR_INT ("pure-bytes-used", &pure_bytes_used
,
6305 doc
: /* Number of bytes of sharable Lisp data allocated so far. */);
6307 DEFVAR_INT ("cons-cells-consed", &cons_cells_consed
,
6308 doc
: /* Number of cons cells that have been consed so far. */);
6310 DEFVAR_INT ("floats-consed", &floats_consed
,
6311 doc
: /* Number of floats that have been consed so far. */);
6313 DEFVAR_INT ("vector-cells-consed", &vector_cells_consed
,
6314 doc
: /* Number of vector cells that have been consed so far. */);
6316 DEFVAR_INT ("symbols-consed", &symbols_consed
,
6317 doc
: /* Number of symbols that have been consed so far. */);
6319 DEFVAR_INT ("string-chars-consed", &string_chars_consed
,
6320 doc
: /* Number of string characters that have been consed so far. */);
6322 DEFVAR_INT ("misc-objects-consed", &misc_objects_consed
,
6323 doc
: /* Number of miscellaneous objects that have been consed so far. */);
6325 DEFVAR_INT ("intervals-consed", &intervals_consed
,
6326 doc
: /* Number of intervals that have been consed so far. */);
6328 DEFVAR_INT ("strings-consed", &strings_consed
,
6329 doc
: /* Number of strings that have been consed so far. */);
6331 DEFVAR_LISP ("purify-flag", &Vpurify_flag
,
6332 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
6333 This means that certain objects should be allocated in shared (pure) space. */);
6335 DEFVAR_BOOL ("garbage-collection-messages", &garbage_collection_messages
,
6336 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
6337 garbage_collection_messages
= 0;
6339 DEFVAR_LISP ("post-gc-hook", &Vpost_gc_hook
,
6340 doc
: /* Hook run after garbage collection has finished. */);
6341 Vpost_gc_hook
= Qnil
;
6342 Qpost_gc_hook
= intern ("post-gc-hook");
6343 staticpro (&Qpost_gc_hook
);
6345 DEFVAR_LISP ("memory-signal-data", &Vmemory_signal_data
,
6346 doc
: /* Precomputed `signal' argument for memory-full error. */);
6347 /* We build this in advance because if we wait until we need it, we might
6348 not be able to allocate the memory to hold it. */
6351 build_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"));
6353 DEFVAR_LISP ("memory-full", &Vmemory_full
,
6354 doc
: /* Non-nil means Emacs cannot get much more Lisp memory. */);
6355 Vmemory_full
= Qnil
;
6357 staticpro (&Qgc_cons_threshold
);
6358 Qgc_cons_threshold
= intern ("gc-cons-threshold");
6360 staticpro (&Qchar_table_extra_slots
);
6361 Qchar_table_extra_slots
= intern ("char-table-extra-slots");
6363 DEFVAR_LISP ("gc-elapsed", &Vgc_elapsed
,
6364 doc
: /* Accumulated time elapsed in garbage collections.
6365 The time is in seconds as a floating point value. */);
6366 DEFVAR_INT ("gcs-done", &gcs_done
,
6367 doc
: /* Accumulated number of garbage collections done. */);
6372 defsubr (&Smake_byte_code
);
6373 defsubr (&Smake_list
);
6374 defsubr (&Smake_vector
);
6375 defsubr (&Smake_char_table
);
6376 defsubr (&Smake_string
);
6377 defsubr (&Smake_bool_vector
);
6378 defsubr (&Smake_symbol
);
6379 defsubr (&Smake_marker
);
6380 defsubr (&Spurecopy
);
6381 defsubr (&Sgarbage_collect
);
6382 defsubr (&Smemory_limit
);
6383 defsubr (&Smemory_use_counts
);
6385 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
6386 defsubr (&Sgc_status
);
6390 /* arch-tag: 6695ca10-e3c5-4c2c-8bc3-ed26a7dda857
6391 (do not change this comment) */