1 /* Storage allocation and gc for GNU Emacs Lisp interpreter.
2 Copyright (C) 1985, 1986, 1988, 1993, 1994, 1995, 1997, 1998, 1999,
3 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007 Free Software Foundation, Inc.
5 This file is part of GNU Emacs.
7 GNU Emacs is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
12 GNU Emacs is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU Emacs; see the file COPYING. If not, write to
19 the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
20 Boston, MA 02110-1301, USA. */
24 #include <limits.h> /* For CHAR_BIT. */
27 #include <stddef.h> /* For offsetof, used by PSEUDOVECSIZE. */
34 /* Note that this declares bzero on OSF/1. How dumb. */
38 #ifdef HAVE_GTK_AND_PTHREAD
42 /* This file is part of the core Lisp implementation, and thus must
43 deal with the real data structures. If the Lisp implementation is
44 replaced, this file likely will not be used. */
46 #undef HIDE_LISP_IMPLEMENTATION
49 #include "intervals.h"
55 #include "blockinput.h"
57 #include "syssignal.h"
58 #include "termhooks.h" /* For struct terminal. */
61 /* GC_MALLOC_CHECK defined means perform validity checks of malloc'd
62 memory. Can do this only if using gmalloc.c. */
64 #if defined SYSTEM_MALLOC || defined DOUG_LEA_MALLOC
65 #undef GC_MALLOC_CHECK
71 extern POINTER_TYPE
*sbrk ();
75 #define INCLUDED_FCNTL
87 #ifdef DOUG_LEA_MALLOC
90 /* malloc.h #defines this as size_t, at least in glibc2. */
91 #ifndef __malloc_size_t
92 #define __malloc_size_t int
95 /* Specify maximum number of areas to mmap. It would be nice to use a
96 value that explicitly means "no limit". */
98 #define MMAP_MAX_AREAS 100000000
100 #else /* not DOUG_LEA_MALLOC */
102 /* The following come from gmalloc.c. */
104 #define __malloc_size_t size_t
105 extern __malloc_size_t _bytes_used
;
106 extern __malloc_size_t __malloc_extra_blocks
;
108 #endif /* not DOUG_LEA_MALLOC */
110 #if ! defined (SYSTEM_MALLOC) && defined (HAVE_GTK_AND_PTHREAD)
112 /* When GTK uses the file chooser dialog, different backends can be loaded
113 dynamically. One such a backend is the Gnome VFS backend that gets loaded
114 if you run Gnome. That backend creates several threads and also allocates
117 If Emacs sets malloc hooks (! SYSTEM_MALLOC) and the emacs_blocked_*
118 functions below are called from malloc, there is a chance that one
119 of these threads preempts the Emacs main thread and the hook variables
120 end up in an inconsistent state. So we have a mutex to prevent that (note
121 that the backend handles concurrent access to malloc within its own threads
122 but Emacs code running in the main thread is not included in that control).
124 When UNBLOCK_INPUT is called, reinvoke_input_signal may be called. If this
125 happens in one of the backend threads we will have two threads that tries
126 to run Emacs code at once, and the code is not prepared for that.
127 To prevent that, we only call BLOCK/UNBLOCK from the main thread. */
129 static pthread_mutex_t alloc_mutex
;
131 #define BLOCK_INPUT_ALLOC \
134 if (pthread_equal (pthread_self (), main_thread)) \
136 pthread_mutex_lock (&alloc_mutex); \
139 #define UNBLOCK_INPUT_ALLOC \
142 pthread_mutex_unlock (&alloc_mutex); \
143 if (pthread_equal (pthread_self (), main_thread)) \
148 #else /* SYSTEM_MALLOC || not HAVE_GTK_AND_PTHREAD */
150 #define BLOCK_INPUT_ALLOC BLOCK_INPUT
151 #define UNBLOCK_INPUT_ALLOC UNBLOCK_INPUT
153 #endif /* SYSTEM_MALLOC || not HAVE_GTK_AND_PTHREAD */
155 /* Value of _bytes_used, when spare_memory was freed. */
157 static __malloc_size_t bytes_used_when_full
;
159 static __malloc_size_t bytes_used_when_reconsidered
;
161 /* Mark, unmark, query mark bit of a Lisp string. S must be a pointer
162 to a struct Lisp_String. */
164 #define MARK_STRING(S) ((S)->size |= ARRAY_MARK_FLAG)
165 #define UNMARK_STRING(S) ((S)->size &= ~ARRAY_MARK_FLAG)
166 #define STRING_MARKED_P(S) (((S)->size & ARRAY_MARK_FLAG) != 0)
168 #define VECTOR_MARK(V) ((V)->size |= ARRAY_MARK_FLAG)
169 #define VECTOR_UNMARK(V) ((V)->size &= ~ARRAY_MARK_FLAG)
170 #define VECTOR_MARKED_P(V) (((V)->size & ARRAY_MARK_FLAG) != 0)
172 /* Value is the number of bytes/chars of S, a pointer to a struct
173 Lisp_String. This must be used instead of STRING_BYTES (S) or
174 S->size during GC, because S->size contains the mark bit for
177 #define GC_STRING_BYTES(S) (STRING_BYTES (S))
178 #define GC_STRING_CHARS(S) ((S)->size & ~ARRAY_MARK_FLAG)
180 /* Number of bytes of consing done since the last gc. */
182 int consing_since_gc
;
184 /* Count the amount of consing of various sorts of space. */
186 EMACS_INT cons_cells_consed
;
187 EMACS_INT floats_consed
;
188 EMACS_INT vector_cells_consed
;
189 EMACS_INT symbols_consed
;
190 EMACS_INT string_chars_consed
;
191 EMACS_INT misc_objects_consed
;
192 EMACS_INT intervals_consed
;
193 EMACS_INT strings_consed
;
195 /* Minimum number of bytes of consing since GC before next GC. */
197 EMACS_INT gc_cons_threshold
;
199 /* Similar minimum, computed from Vgc_cons_percentage. */
201 EMACS_INT gc_relative_threshold
;
203 static Lisp_Object Vgc_cons_percentage
;
205 /* Minimum number of bytes of consing since GC before next GC,
206 when memory is full. */
208 EMACS_INT memory_full_cons_threshold
;
210 /* Nonzero during GC. */
214 /* Nonzero means abort if try to GC.
215 This is for code which is written on the assumption that
216 no GC will happen, so as to verify that assumption. */
220 /* Nonzero means display messages at beginning and end of GC. */
222 int garbage_collection_messages
;
224 #ifndef VIRT_ADDR_VARIES
226 #endif /* VIRT_ADDR_VARIES */
227 int malloc_sbrk_used
;
229 #ifndef VIRT_ADDR_VARIES
231 #endif /* VIRT_ADDR_VARIES */
232 int malloc_sbrk_unused
;
234 /* Number of live and free conses etc. */
236 static int total_conses
, total_markers
, total_symbols
, total_vector_size
;
237 static int total_free_conses
, total_free_markers
, total_free_symbols
;
238 static int total_free_floats
, total_floats
;
240 /* Points to memory space allocated as "spare", to be freed if we run
241 out of memory. We keep one large block, four cons-blocks, and
242 two string blocks. */
244 char *spare_memory
[7];
246 /* Amount of spare memory to keep in large reserve block. */
248 #define SPARE_MEMORY (1 << 14)
250 /* Number of extra blocks malloc should get when it needs more core. */
252 static int malloc_hysteresis
;
254 /* Non-nil means defun should do purecopy on the function definition. */
256 Lisp_Object Vpurify_flag
;
258 /* Non-nil means we are handling a memory-full error. */
260 Lisp_Object Vmemory_full
;
264 /* Initialize it to a nonzero value to force it into data space
265 (rather than bss space). That way unexec will remap it into text
266 space (pure), on some systems. We have not implemented the
267 remapping on more recent systems because this is less important
268 nowadays than in the days of small memories and timesharing. */
270 EMACS_INT pure
[(PURESIZE
+ sizeof (EMACS_INT
) - 1) / sizeof (EMACS_INT
)] = {1,};
271 #define PUREBEG (char *) pure
275 #define pure PURE_SEG_BITS /* Use shared memory segment */
276 #define PUREBEG (char *)PURE_SEG_BITS
278 #endif /* HAVE_SHM */
280 /* Pointer to the pure area, and its size. */
282 static char *purebeg
;
283 static size_t pure_size
;
285 /* Number of bytes of pure storage used before pure storage overflowed.
286 If this is non-zero, this implies that an overflow occurred. */
288 static size_t pure_bytes_used_before_overflow
;
290 /* Value is non-zero if P points into pure space. */
292 #define PURE_POINTER_P(P) \
293 (((PNTR_COMPARISON_TYPE) (P) \
294 < (PNTR_COMPARISON_TYPE) ((char *) purebeg + pure_size)) \
295 && ((PNTR_COMPARISON_TYPE) (P) \
296 >= (PNTR_COMPARISON_TYPE) purebeg))
298 /* Total number of bytes allocated in pure storage. */
300 EMACS_INT pure_bytes_used
;
302 /* Index in pure at which next pure Lisp object will be allocated.. */
304 static EMACS_INT pure_bytes_used_lisp
;
306 /* Number of bytes allocated for non-Lisp objects in pure storage. */
308 static EMACS_INT pure_bytes_used_non_lisp
;
310 /* If nonzero, this is a warning delivered by malloc and not yet
313 char *pending_malloc_warning
;
315 /* Pre-computed signal argument for use when memory is exhausted. */
317 Lisp_Object Vmemory_signal_data
;
319 /* Maximum amount of C stack to save when a GC happens. */
321 #ifndef MAX_SAVE_STACK
322 #define MAX_SAVE_STACK 16000
325 /* Buffer in which we save a copy of the C stack at each GC. */
330 /* Non-zero means ignore malloc warnings. Set during initialization.
331 Currently not used. */
335 Lisp_Object Qgc_cons_threshold
, Qchar_table_extra_slots
;
337 /* Hook run after GC has finished. */
339 Lisp_Object Vpost_gc_hook
, Qpost_gc_hook
;
341 Lisp_Object Vgc_elapsed
; /* accumulated elapsed time in GC */
342 EMACS_INT gcs_done
; /* accumulated GCs */
344 static void mark_buffer
P_ ((Lisp_Object
));
345 static void mark_terminals
P_ ((void));
346 extern void mark_kboards
P_ ((void));
347 extern void mark_ttys
P_ ((void));
348 extern void mark_backtrace
P_ ((void));
349 static void gc_sweep
P_ ((void));
350 static void mark_glyph_matrix
P_ ((struct glyph_matrix
*));
351 static void mark_face_cache
P_ ((struct face_cache
*));
353 #ifdef HAVE_WINDOW_SYSTEM
354 extern void mark_fringe_data
P_ ((void));
355 static void mark_image
P_ ((struct image
*));
356 static void mark_image_cache
P_ ((struct frame
*));
357 #endif /* HAVE_WINDOW_SYSTEM */
359 static struct Lisp_String
*allocate_string
P_ ((void));
360 static void compact_small_strings
P_ ((void));
361 static void free_large_strings
P_ ((void));
362 static void sweep_strings
P_ ((void));
364 extern int message_enable_multibyte
;
366 /* When scanning the C stack for live Lisp objects, Emacs keeps track
367 of what memory allocated via lisp_malloc is intended for what
368 purpose. This enumeration specifies the type of memory. */
379 /* We used to keep separate mem_types for subtypes of vectors such as
380 process, hash_table, frame, terminal, and window, but we never made
381 use of the distinction, so it only caused source-code complexity
382 and runtime slowdown. Minor but pointless. */
386 static POINTER_TYPE
*lisp_align_malloc
P_ ((size_t, enum mem_type
));
387 static POINTER_TYPE
*lisp_malloc
P_ ((size_t, enum mem_type
));
388 void refill_memory_reserve ();
391 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
393 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
394 #include <stdio.h> /* For fprintf. */
397 /* A unique object in pure space used to make some Lisp objects
398 on free lists recognizable in O(1). */
402 #ifdef GC_MALLOC_CHECK
404 enum mem_type allocated_mem_type
;
405 int dont_register_blocks
;
407 #endif /* GC_MALLOC_CHECK */
409 /* A node in the red-black tree describing allocated memory containing
410 Lisp data. Each such block is recorded with its start and end
411 address when it is allocated, and removed from the tree when it
414 A red-black tree is a balanced binary tree with the following
417 1. Every node is either red or black.
418 2. Every leaf is black.
419 3. If a node is red, then both of its children are black.
420 4. Every simple path from a node to a descendant leaf contains
421 the same number of black nodes.
422 5. The root is always black.
424 When nodes are inserted into the tree, or deleted from the tree,
425 the tree is "fixed" so that these properties are always true.
427 A red-black tree with N internal nodes has height at most 2
428 log(N+1). Searches, insertions and deletions are done in O(log N).
429 Please see a text book about data structures for a detailed
430 description of red-black trees. Any book worth its salt should
435 /* Children of this node. These pointers are never NULL. When there
436 is no child, the value is MEM_NIL, which points to a dummy node. */
437 struct mem_node
*left
, *right
;
439 /* The parent of this node. In the root node, this is NULL. */
440 struct mem_node
*parent
;
442 /* Start and end of allocated region. */
446 enum {MEM_BLACK
, MEM_RED
} color
;
452 /* Base address of stack. Set in main. */
454 Lisp_Object
*stack_base
;
456 /* Root of the tree describing allocated Lisp memory. */
458 static struct mem_node
*mem_root
;
460 /* Lowest and highest known address in the heap. */
462 static void *min_heap_address
, *max_heap_address
;
464 /* Sentinel node of the tree. */
466 static struct mem_node mem_z
;
467 #define MEM_NIL &mem_z
469 static POINTER_TYPE
*lisp_malloc
P_ ((size_t, enum mem_type
));
470 static struct Lisp_Vector
*allocate_vectorlike
P_ ((EMACS_INT
));
471 static void lisp_free
P_ ((POINTER_TYPE
*));
472 static void mark_stack
P_ ((void));
473 static int live_vector_p
P_ ((struct mem_node
*, void *));
474 static int live_buffer_p
P_ ((struct mem_node
*, void *));
475 static int live_string_p
P_ ((struct mem_node
*, void *));
476 static int live_cons_p
P_ ((struct mem_node
*, void *));
477 static int live_symbol_p
P_ ((struct mem_node
*, void *));
478 static int live_float_p
P_ ((struct mem_node
*, void *));
479 static int live_misc_p
P_ ((struct mem_node
*, void *));
480 static void mark_maybe_object
P_ ((Lisp_Object
));
481 static void mark_memory
P_ ((void *, void *, int));
482 static void mem_init
P_ ((void));
483 static struct mem_node
*mem_insert
P_ ((void *, void *, enum mem_type
));
484 static void mem_insert_fixup
P_ ((struct mem_node
*));
485 static void mem_rotate_left
P_ ((struct mem_node
*));
486 static void mem_rotate_right
P_ ((struct mem_node
*));
487 static void mem_delete
P_ ((struct mem_node
*));
488 static void mem_delete_fixup
P_ ((struct mem_node
*));
489 static INLINE
struct mem_node
*mem_find
P_ ((void *));
492 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
493 static void check_gcpros
P_ ((void));
496 #endif /* GC_MARK_STACK || GC_MALLOC_CHECK */
498 /* Recording what needs to be marked for gc. */
500 struct gcpro
*gcprolist
;
502 /* Addresses of staticpro'd variables. Initialize it to a nonzero
503 value; otherwise some compilers put it into BSS. */
505 #define NSTATICS 1280
506 Lisp_Object
*staticvec
[NSTATICS
] = {&Vpurify_flag
};
508 /* Index of next unused slot in staticvec. */
512 static POINTER_TYPE
*pure_alloc
P_ ((size_t, int));
515 /* Value is SZ rounded up to the next multiple of ALIGNMENT.
516 ALIGNMENT must be a power of 2. */
518 #define ALIGN(ptr, ALIGNMENT) \
519 ((POINTER_TYPE *) ((((EMACS_UINT)(ptr)) + (ALIGNMENT) - 1) \
520 & ~((ALIGNMENT) - 1)))
524 /************************************************************************
526 ************************************************************************/
528 /* Function malloc calls this if it finds we are near exhausting storage. */
534 pending_malloc_warning
= str
;
538 /* Display an already-pending malloc warning. */
541 display_malloc_warning ()
543 call3 (intern ("display-warning"),
545 build_string (pending_malloc_warning
),
546 intern ("emergency"));
547 pending_malloc_warning
= 0;
551 #ifdef DOUG_LEA_MALLOC
552 # define BYTES_USED (mallinfo ().uordblks)
554 # define BYTES_USED _bytes_used
557 /* Called if we can't allocate relocatable space for a buffer. */
560 buffer_memory_full ()
562 /* If buffers use the relocating allocator, no need to free
563 spare_memory, because we may have plenty of malloc space left
564 that we could get, and if we don't, the malloc that fails will
565 itself cause spare_memory to be freed. If buffers don't use the
566 relocating allocator, treat this like any other failing
573 /* This used to call error, but if we've run out of memory, we could
574 get infinite recursion trying to build the string. */
575 xsignal (Qnil
, Vmemory_signal_data
);
579 #ifdef XMALLOC_OVERRUN_CHECK
581 /* Check for overrun in malloc'ed buffers by wrapping a 16 byte header
582 and a 16 byte trailer around each block.
584 The header consists of 12 fixed bytes + a 4 byte integer contaning the
585 original block size, while the trailer consists of 16 fixed bytes.
587 The header is used to detect whether this block has been allocated
588 through these functions -- as it seems that some low-level libc
589 functions may bypass the malloc hooks.
593 #define XMALLOC_OVERRUN_CHECK_SIZE 16
595 static char xmalloc_overrun_check_header
[XMALLOC_OVERRUN_CHECK_SIZE
-4] =
596 { 0x9a, 0x9b, 0xae, 0xaf,
597 0xbf, 0xbe, 0xce, 0xcf,
598 0xea, 0xeb, 0xec, 0xed };
600 static char xmalloc_overrun_check_trailer
[XMALLOC_OVERRUN_CHECK_SIZE
] =
601 { 0xaa, 0xab, 0xac, 0xad,
602 0xba, 0xbb, 0xbc, 0xbd,
603 0xca, 0xcb, 0xcc, 0xcd,
604 0xda, 0xdb, 0xdc, 0xdd };
606 /* Macros to insert and extract the block size in the header. */
608 #define XMALLOC_PUT_SIZE(ptr, size) \
609 (ptr[-1] = (size & 0xff), \
610 ptr[-2] = ((size >> 8) & 0xff), \
611 ptr[-3] = ((size >> 16) & 0xff), \
612 ptr[-4] = ((size >> 24) & 0xff))
614 #define XMALLOC_GET_SIZE(ptr) \
615 (size_t)((unsigned)(ptr[-1]) | \
616 ((unsigned)(ptr[-2]) << 8) | \
617 ((unsigned)(ptr[-3]) << 16) | \
618 ((unsigned)(ptr[-4]) << 24))
621 /* The call depth in overrun_check functions. For example, this might happen:
623 overrun_check_malloc()
624 -> malloc -> (via hook)_-> emacs_blocked_malloc
625 -> overrun_check_malloc
626 call malloc (hooks are NULL, so real malloc is called).
627 malloc returns 10000.
628 add overhead, return 10016.
629 <- (back in overrun_check_malloc)
630 add overhead again, return 10032
631 xmalloc returns 10032.
636 overrun_check_free(10032)
638 free(10016) <- crash, because 10000 is the original pointer. */
640 static int check_depth
;
642 /* Like malloc, but wraps allocated block with header and trailer. */
645 overrun_check_malloc (size
)
648 register unsigned char *val
;
649 size_t overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_SIZE
*2 : 0;
651 val
= (unsigned char *) malloc (size
+ overhead
);
652 if (val
&& check_depth
== 1)
654 bcopy (xmalloc_overrun_check_header
, val
, XMALLOC_OVERRUN_CHECK_SIZE
- 4);
655 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
656 XMALLOC_PUT_SIZE(val
, size
);
657 bcopy (xmalloc_overrun_check_trailer
, val
+ size
, XMALLOC_OVERRUN_CHECK_SIZE
);
660 return (POINTER_TYPE
*)val
;
664 /* Like realloc, but checks old block for overrun, and wraps new block
665 with header and trailer. */
668 overrun_check_realloc (block
, size
)
672 register unsigned char *val
= (unsigned char *)block
;
673 size_t overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_SIZE
*2 : 0;
677 && bcmp (xmalloc_overrun_check_header
,
678 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
679 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
681 size_t osize
= XMALLOC_GET_SIZE (val
);
682 if (bcmp (xmalloc_overrun_check_trailer
,
684 XMALLOC_OVERRUN_CHECK_SIZE
))
686 bzero (val
+ osize
, XMALLOC_OVERRUN_CHECK_SIZE
);
687 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
688 bzero (val
, XMALLOC_OVERRUN_CHECK_SIZE
);
691 val
= (unsigned char *) realloc ((POINTER_TYPE
*)val
, size
+ overhead
);
693 if (val
&& check_depth
== 1)
695 bcopy (xmalloc_overrun_check_header
, val
, XMALLOC_OVERRUN_CHECK_SIZE
- 4);
696 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
697 XMALLOC_PUT_SIZE(val
, size
);
698 bcopy (xmalloc_overrun_check_trailer
, val
+ size
, XMALLOC_OVERRUN_CHECK_SIZE
);
701 return (POINTER_TYPE
*)val
;
704 /* Like free, but checks block for overrun. */
707 overrun_check_free (block
)
710 unsigned char *val
= (unsigned char *)block
;
715 && bcmp (xmalloc_overrun_check_header
,
716 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
717 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
719 size_t osize
= XMALLOC_GET_SIZE (val
);
720 if (bcmp (xmalloc_overrun_check_trailer
,
722 XMALLOC_OVERRUN_CHECK_SIZE
))
724 #ifdef XMALLOC_CLEAR_FREE_MEMORY
725 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
726 memset (val
, 0xff, osize
+ XMALLOC_OVERRUN_CHECK_SIZE
*2);
728 bzero (val
+ osize
, XMALLOC_OVERRUN_CHECK_SIZE
);
729 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
730 bzero (val
, XMALLOC_OVERRUN_CHECK_SIZE
);
741 #define malloc overrun_check_malloc
742 #define realloc overrun_check_realloc
743 #define free overrun_check_free
747 /* When using SYNC_INPUT, we don't call malloc from a signal handler, so
748 there's no need to block input around malloc. */
749 #define MALLOC_BLOCK_INPUT ((void)0)
750 #define MALLOC_UNBLOCK_INPUT ((void)0)
752 #define MALLOC_BLOCK_INPUT BLOCK_INPUT
753 #define MALLOC_UNBLOCK_INPUT UNBLOCK_INPUT
756 /* Like malloc but check for no memory and block interrupt input.. */
762 register POINTER_TYPE
*val
;
765 val
= (POINTER_TYPE
*) malloc (size
);
766 MALLOC_UNBLOCK_INPUT
;
774 /* Like realloc but check for no memory and block interrupt input.. */
777 xrealloc (block
, size
)
781 register POINTER_TYPE
*val
;
784 /* We must call malloc explicitly when BLOCK is 0, since some
785 reallocs don't do this. */
787 val
= (POINTER_TYPE
*) malloc (size
);
789 val
= (POINTER_TYPE
*) realloc (block
, size
);
790 MALLOC_UNBLOCK_INPUT
;
792 if (!val
&& size
) memory_full ();
797 /* Like free but block interrupt input. */
805 MALLOC_UNBLOCK_INPUT
;
806 /* We don't call refill_memory_reserve here
807 because that duplicates doing so in emacs_blocked_free
808 and the criterion should go there. */
812 /* Like strdup, but uses xmalloc. */
818 size_t len
= strlen (s
) + 1;
819 char *p
= (char *) xmalloc (len
);
825 /* Unwind for SAFE_ALLOCA */
828 safe_alloca_unwind (arg
)
831 register struct Lisp_Save_Value
*p
= XSAVE_VALUE (arg
);
841 /* Like malloc but used for allocating Lisp data. NBYTES is the
842 number of bytes to allocate, TYPE describes the intended use of the
843 allcated memory block (for strings, for conses, ...). */
846 static void *lisp_malloc_loser
;
849 static POINTER_TYPE
*
850 lisp_malloc (nbytes
, type
)
858 #ifdef GC_MALLOC_CHECK
859 allocated_mem_type
= type
;
862 val
= (void *) malloc (nbytes
);
865 /* If the memory just allocated cannot be addressed thru a Lisp
866 object's pointer, and it needs to be,
867 that's equivalent to running out of memory. */
868 if (val
&& type
!= MEM_TYPE_NON_LISP
)
871 XSETCONS (tem
, (char *) val
+ nbytes
- 1);
872 if ((char *) XCONS (tem
) != (char *) val
+ nbytes
- 1)
874 lisp_malloc_loser
= val
;
881 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
882 if (val
&& type
!= MEM_TYPE_NON_LISP
)
883 mem_insert (val
, (char *) val
+ nbytes
, type
);
886 MALLOC_UNBLOCK_INPUT
;
892 /* Free BLOCK. This must be called to free memory allocated with a
893 call to lisp_malloc. */
901 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
902 mem_delete (mem_find (block
));
904 MALLOC_UNBLOCK_INPUT
;
907 /* Allocation of aligned blocks of memory to store Lisp data. */
908 /* The entry point is lisp_align_malloc which returns blocks of at most */
909 /* BLOCK_BYTES and guarantees they are aligned on a BLOCK_ALIGN boundary. */
911 /* Use posix_memalloc if the system has it and we're using the system's
912 malloc (because our gmalloc.c routines don't have posix_memalign although
913 its memalloc could be used). */
914 #if defined (HAVE_POSIX_MEMALIGN) && defined (SYSTEM_MALLOC)
915 #define USE_POSIX_MEMALIGN 1
918 /* BLOCK_ALIGN has to be a power of 2. */
919 #define BLOCK_ALIGN (1 << 10)
921 /* Padding to leave at the end of a malloc'd block. This is to give
922 malloc a chance to minimize the amount of memory wasted to alignment.
923 It should be tuned to the particular malloc library used.
924 On glibc-2.3.2, malloc never tries to align, so a padding of 0 is best.
925 posix_memalign on the other hand would ideally prefer a value of 4
926 because otherwise, there's 1020 bytes wasted between each ablocks.
927 In Emacs, testing shows that those 1020 can most of the time be
928 efficiently used by malloc to place other objects, so a value of 0 can
929 still preferable unless you have a lot of aligned blocks and virtually
931 #define BLOCK_PADDING 0
932 #define BLOCK_BYTES \
933 (BLOCK_ALIGN - sizeof (struct ablock *) - BLOCK_PADDING)
935 /* Internal data structures and constants. */
937 #define ABLOCKS_SIZE 16
939 /* An aligned block of memory. */
944 char payload
[BLOCK_BYTES
];
945 struct ablock
*next_free
;
947 /* `abase' is the aligned base of the ablocks. */
948 /* It is overloaded to hold the virtual `busy' field that counts
949 the number of used ablock in the parent ablocks.
950 The first ablock has the `busy' field, the others have the `abase'
951 field. To tell the difference, we assume that pointers will have
952 integer values larger than 2 * ABLOCKS_SIZE. The lowest bit of `busy'
953 is used to tell whether the real base of the parent ablocks is `abase'
954 (if not, the word before the first ablock holds a pointer to the
956 struct ablocks
*abase
;
957 /* The padding of all but the last ablock is unused. The padding of
958 the last ablock in an ablocks is not allocated. */
960 char padding
[BLOCK_PADDING
];
964 /* A bunch of consecutive aligned blocks. */
967 struct ablock blocks
[ABLOCKS_SIZE
];
970 /* Size of the block requested from malloc or memalign. */
971 #define ABLOCKS_BYTES (sizeof (struct ablocks) - BLOCK_PADDING)
973 #define ABLOCK_ABASE(block) \
974 (((unsigned long) (block)->abase) <= (1 + 2 * ABLOCKS_SIZE) \
975 ? (struct ablocks *)(block) \
978 /* Virtual `busy' field. */
979 #define ABLOCKS_BUSY(abase) ((abase)->blocks[0].abase)
981 /* Pointer to the (not necessarily aligned) malloc block. */
982 #ifdef USE_POSIX_MEMALIGN
983 #define ABLOCKS_BASE(abase) (abase)
985 #define ABLOCKS_BASE(abase) \
986 (1 & (long) ABLOCKS_BUSY (abase) ? abase : ((void**)abase)[-1])
989 /* The list of free ablock. */
990 static struct ablock
*free_ablock
;
992 /* Allocate an aligned block of nbytes.
993 Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be
994 smaller or equal to BLOCK_BYTES. */
995 static POINTER_TYPE
*
996 lisp_align_malloc (nbytes
, type
)
1001 struct ablocks
*abase
;
1003 eassert (nbytes
<= BLOCK_BYTES
);
1007 #ifdef GC_MALLOC_CHECK
1008 allocated_mem_type
= type
;
1014 EMACS_INT aligned
; /* int gets warning casting to 64-bit pointer. */
1016 #ifdef DOUG_LEA_MALLOC
1017 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1018 because mapped region contents are not preserved in
1020 mallopt (M_MMAP_MAX
, 0);
1023 #ifdef USE_POSIX_MEMALIGN
1025 int err
= posix_memalign (&base
, BLOCK_ALIGN
, ABLOCKS_BYTES
);
1031 base
= malloc (ABLOCKS_BYTES
);
1032 abase
= ALIGN (base
, BLOCK_ALIGN
);
1037 MALLOC_UNBLOCK_INPUT
;
1041 aligned
= (base
== abase
);
1043 ((void**)abase
)[-1] = base
;
1045 #ifdef DOUG_LEA_MALLOC
1046 /* Back to a reasonable maximum of mmap'ed areas. */
1047 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1051 /* If the memory just allocated cannot be addressed thru a Lisp
1052 object's pointer, and it needs to be, that's equivalent to
1053 running out of memory. */
1054 if (type
!= MEM_TYPE_NON_LISP
)
1057 char *end
= (char *) base
+ ABLOCKS_BYTES
- 1;
1058 XSETCONS (tem
, end
);
1059 if ((char *) XCONS (tem
) != end
)
1061 lisp_malloc_loser
= base
;
1063 MALLOC_UNBLOCK_INPUT
;
1069 /* Initialize the blocks and put them on the free list.
1070 Is `base' was not properly aligned, we can't use the last block. */
1071 for (i
= 0; i
< (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1); i
++)
1073 abase
->blocks
[i
].abase
= abase
;
1074 abase
->blocks
[i
].x
.next_free
= free_ablock
;
1075 free_ablock
= &abase
->blocks
[i
];
1077 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (long) aligned
;
1079 eassert (0 == ((EMACS_UINT
)abase
) % BLOCK_ALIGN
);
1080 eassert (ABLOCK_ABASE (&abase
->blocks
[3]) == abase
); /* 3 is arbitrary */
1081 eassert (ABLOCK_ABASE (&abase
->blocks
[0]) == abase
);
1082 eassert (ABLOCKS_BASE (abase
) == base
);
1083 eassert (aligned
== (long) ABLOCKS_BUSY (abase
));
1086 abase
= ABLOCK_ABASE (free_ablock
);
1087 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (2 + (long) ABLOCKS_BUSY (abase
));
1089 free_ablock
= free_ablock
->x
.next_free
;
1091 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1092 if (val
&& type
!= MEM_TYPE_NON_LISP
)
1093 mem_insert (val
, (char *) val
+ nbytes
, type
);
1096 MALLOC_UNBLOCK_INPUT
;
1100 eassert (0 == ((EMACS_UINT
)val
) % BLOCK_ALIGN
);
1105 lisp_align_free (block
)
1106 POINTER_TYPE
*block
;
1108 struct ablock
*ablock
= block
;
1109 struct ablocks
*abase
= ABLOCK_ABASE (ablock
);
1112 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1113 mem_delete (mem_find (block
));
1115 /* Put on free list. */
1116 ablock
->x
.next_free
= free_ablock
;
1117 free_ablock
= ablock
;
1118 /* Update busy count. */
1119 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (-2 + (long) ABLOCKS_BUSY (abase
));
1121 if (2 > (long) ABLOCKS_BUSY (abase
))
1122 { /* All the blocks are free. */
1123 int i
= 0, aligned
= (long) ABLOCKS_BUSY (abase
);
1124 struct ablock
**tem
= &free_ablock
;
1125 struct ablock
*atop
= &abase
->blocks
[aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1];
1129 if (*tem
>= (struct ablock
*) abase
&& *tem
< atop
)
1132 *tem
= (*tem
)->x
.next_free
;
1135 tem
= &(*tem
)->x
.next_free
;
1137 eassert ((aligned
& 1) == aligned
);
1138 eassert (i
== (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1));
1139 #ifdef USE_POSIX_MEMALIGN
1140 eassert ((unsigned long)ABLOCKS_BASE (abase
) % BLOCK_ALIGN
== 0);
1142 free (ABLOCKS_BASE (abase
));
1144 MALLOC_UNBLOCK_INPUT
;
1147 /* Return a new buffer structure allocated from the heap with
1148 a call to lisp_malloc. */
1154 = (struct buffer
*) lisp_malloc (sizeof (struct buffer
),
1160 #ifndef SYSTEM_MALLOC
1162 /* Arranging to disable input signals while we're in malloc.
1164 This only works with GNU malloc. To help out systems which can't
1165 use GNU malloc, all the calls to malloc, realloc, and free
1166 elsewhere in the code should be inside a BLOCK_INPUT/UNBLOCK_INPUT
1167 pair; unfortunately, we have no idea what C library functions
1168 might call malloc, so we can't really protect them unless you're
1169 using GNU malloc. Fortunately, most of the major operating systems
1170 can use GNU malloc. */
1173 /* When using SYNC_INPUT, we don't call malloc from a signal handler, so
1174 there's no need to block input around malloc. */
1176 #ifndef DOUG_LEA_MALLOC
1177 extern void * (*__malloc_hook
) P_ ((size_t, const void *));
1178 extern void * (*__realloc_hook
) P_ ((void *, size_t, const void *));
1179 extern void (*__free_hook
) P_ ((void *, const void *));
1180 /* Else declared in malloc.h, perhaps with an extra arg. */
1181 #endif /* DOUG_LEA_MALLOC */
1182 static void * (*old_malloc_hook
) P_ ((size_t, const void *));
1183 static void * (*old_realloc_hook
) P_ ((void *, size_t, const void*));
1184 static void (*old_free_hook
) P_ ((void*, const void*));
1186 /* This function is used as the hook for free to call. */
1189 emacs_blocked_free (ptr
, ptr2
)
1195 #ifdef GC_MALLOC_CHECK
1201 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1204 "Freeing `%p' which wasn't allocated with malloc\n", ptr
);
1209 /* fprintf (stderr, "free %p...%p (%p)\n", m->start, m->end, ptr); */
1213 #endif /* GC_MALLOC_CHECK */
1215 __free_hook
= old_free_hook
;
1218 /* If we released our reserve (due to running out of memory),
1219 and we have a fair amount free once again,
1220 try to set aside another reserve in case we run out once more. */
1221 if (! NILP (Vmemory_full
)
1222 /* Verify there is enough space that even with the malloc
1223 hysteresis this call won't run out again.
1224 The code here is correct as long as SPARE_MEMORY
1225 is substantially larger than the block size malloc uses. */
1226 && (bytes_used_when_full
1227 > ((bytes_used_when_reconsidered
= BYTES_USED
)
1228 + max (malloc_hysteresis
, 4) * SPARE_MEMORY
)))
1229 refill_memory_reserve ();
1231 __free_hook
= emacs_blocked_free
;
1232 UNBLOCK_INPUT_ALLOC
;
1236 /* This function is the malloc hook that Emacs uses. */
1239 emacs_blocked_malloc (size
, ptr
)
1246 __malloc_hook
= old_malloc_hook
;
1247 #ifdef DOUG_LEA_MALLOC
1248 /* Segfaults on my system. --lorentey */
1249 /* mallopt (M_TOP_PAD, malloc_hysteresis * 4096); */
1251 __malloc_extra_blocks
= malloc_hysteresis
;
1254 value
= (void *) malloc (size
);
1256 #ifdef GC_MALLOC_CHECK
1258 struct mem_node
*m
= mem_find (value
);
1261 fprintf (stderr
, "Malloc returned %p which is already in use\n",
1263 fprintf (stderr
, "Region in use is %p...%p, %u bytes, type %d\n",
1264 m
->start
, m
->end
, (char *) m
->end
- (char *) m
->start
,
1269 if (!dont_register_blocks
)
1271 mem_insert (value
, (char *) value
+ max (1, size
), allocated_mem_type
);
1272 allocated_mem_type
= MEM_TYPE_NON_LISP
;
1275 #endif /* GC_MALLOC_CHECK */
1277 __malloc_hook
= emacs_blocked_malloc
;
1278 UNBLOCK_INPUT_ALLOC
;
1280 /* fprintf (stderr, "%p malloc\n", value); */
1285 /* This function is the realloc hook that Emacs uses. */
1288 emacs_blocked_realloc (ptr
, size
, ptr2
)
1296 __realloc_hook
= old_realloc_hook
;
1298 #ifdef GC_MALLOC_CHECK
1301 struct mem_node
*m
= mem_find (ptr
);
1302 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1305 "Realloc of %p which wasn't allocated with malloc\n",
1313 /* fprintf (stderr, "%p -> realloc\n", ptr); */
1315 /* Prevent malloc from registering blocks. */
1316 dont_register_blocks
= 1;
1317 #endif /* GC_MALLOC_CHECK */
1319 value
= (void *) realloc (ptr
, size
);
1321 #ifdef GC_MALLOC_CHECK
1322 dont_register_blocks
= 0;
1325 struct mem_node
*m
= mem_find (value
);
1328 fprintf (stderr
, "Realloc returns memory that is already in use\n");
1332 /* Can't handle zero size regions in the red-black tree. */
1333 mem_insert (value
, (char *) value
+ max (size
, 1), MEM_TYPE_NON_LISP
);
1336 /* fprintf (stderr, "%p <- realloc\n", value); */
1337 #endif /* GC_MALLOC_CHECK */
1339 __realloc_hook
= emacs_blocked_realloc
;
1340 UNBLOCK_INPUT_ALLOC
;
1346 #ifdef HAVE_GTK_AND_PTHREAD
1347 /* Called from Fdump_emacs so that when the dumped Emacs starts, it has a
1348 normal malloc. Some thread implementations need this as they call
1349 malloc before main. The pthread_self call in BLOCK_INPUT_ALLOC then
1350 calls malloc because it is the first call, and we have an endless loop. */
1353 reset_malloc_hooks ()
1355 __free_hook
= old_free_hook
;
1356 __malloc_hook
= old_malloc_hook
;
1357 __realloc_hook
= old_realloc_hook
;
1359 #endif /* HAVE_GTK_AND_PTHREAD */
1362 /* Called from main to set up malloc to use our hooks. */
1365 uninterrupt_malloc ()
1367 #ifdef HAVE_GTK_AND_PTHREAD
1368 pthread_mutexattr_t attr
;
1370 /* GLIBC has a faster way to do this, but lets keep it portable.
1371 This is according to the Single UNIX Specification. */
1372 pthread_mutexattr_init (&attr
);
1373 pthread_mutexattr_settype (&attr
, PTHREAD_MUTEX_RECURSIVE
);
1374 pthread_mutex_init (&alloc_mutex
, &attr
);
1375 #endif /* HAVE_GTK_AND_PTHREAD */
1377 if (__free_hook
!= emacs_blocked_free
)
1378 old_free_hook
= __free_hook
;
1379 __free_hook
= emacs_blocked_free
;
1381 if (__malloc_hook
!= emacs_blocked_malloc
)
1382 old_malloc_hook
= __malloc_hook
;
1383 __malloc_hook
= emacs_blocked_malloc
;
1385 if (__realloc_hook
!= emacs_blocked_realloc
)
1386 old_realloc_hook
= __realloc_hook
;
1387 __realloc_hook
= emacs_blocked_realloc
;
1390 #endif /* not SYNC_INPUT */
1391 #endif /* not SYSTEM_MALLOC */
1395 /***********************************************************************
1397 ***********************************************************************/
1399 /* Number of intervals allocated in an interval_block structure.
1400 The 1020 is 1024 minus malloc overhead. */
1402 #define INTERVAL_BLOCK_SIZE \
1403 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
1405 /* Intervals are allocated in chunks in form of an interval_block
1408 struct interval_block
1410 /* Place `intervals' first, to preserve alignment. */
1411 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
1412 struct interval_block
*next
;
1415 /* Current interval block. Its `next' pointer points to older
1418 struct interval_block
*interval_block
;
1420 /* Index in interval_block above of the next unused interval
1423 static int interval_block_index
;
1425 /* Number of free and live intervals. */
1427 static int total_free_intervals
, total_intervals
;
1429 /* List of free intervals. */
1431 INTERVAL interval_free_list
;
1433 /* Total number of interval blocks now in use. */
1435 int n_interval_blocks
;
1438 /* Initialize interval allocation. */
1443 interval_block
= NULL
;
1444 interval_block_index
= INTERVAL_BLOCK_SIZE
;
1445 interval_free_list
= 0;
1446 n_interval_blocks
= 0;
1450 /* Return a new interval. */
1457 /* eassert (!handling_signal); */
1461 if (interval_free_list
)
1463 val
= interval_free_list
;
1464 interval_free_list
= INTERVAL_PARENT (interval_free_list
);
1468 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
1470 register struct interval_block
*newi
;
1472 newi
= (struct interval_block
*) lisp_malloc (sizeof *newi
,
1475 newi
->next
= interval_block
;
1476 interval_block
= newi
;
1477 interval_block_index
= 0;
1478 n_interval_blocks
++;
1480 val
= &interval_block
->intervals
[interval_block_index
++];
1483 MALLOC_UNBLOCK_INPUT
;
1485 consing_since_gc
+= sizeof (struct interval
);
1487 RESET_INTERVAL (val
);
1493 /* Mark Lisp objects in interval I. */
1496 mark_interval (i
, dummy
)
1497 register INTERVAL i
;
1500 eassert (!i
->gcmarkbit
); /* Intervals are never shared. */
1502 mark_object (i
->plist
);
1506 /* Mark the interval tree rooted in TREE. Don't call this directly;
1507 use the macro MARK_INTERVAL_TREE instead. */
1510 mark_interval_tree (tree
)
1511 register INTERVAL tree
;
1513 /* No need to test if this tree has been marked already; this
1514 function is always called through the MARK_INTERVAL_TREE macro,
1515 which takes care of that. */
1517 traverse_intervals_noorder (tree
, mark_interval
, Qnil
);
1521 /* Mark the interval tree rooted in I. */
1523 #define MARK_INTERVAL_TREE(i) \
1525 if (!NULL_INTERVAL_P (i) && !i->gcmarkbit) \
1526 mark_interval_tree (i); \
1530 #define UNMARK_BALANCE_INTERVALS(i) \
1532 if (! NULL_INTERVAL_P (i)) \
1533 (i) = balance_intervals (i); \
1537 /* Number support. If NO_UNION_TYPE isn't in effect, we
1538 can't create number objects in macros. */
1546 obj
.s
.type
= Lisp_Int
;
1551 /***********************************************************************
1553 ***********************************************************************/
1555 /* Lisp_Strings are allocated in string_block structures. When a new
1556 string_block is allocated, all the Lisp_Strings it contains are
1557 added to a free-list string_free_list. When a new Lisp_String is
1558 needed, it is taken from that list. During the sweep phase of GC,
1559 string_blocks that are entirely free are freed, except two which
1562 String data is allocated from sblock structures. Strings larger
1563 than LARGE_STRING_BYTES, get their own sblock, data for smaller
1564 strings is sub-allocated out of sblocks of size SBLOCK_SIZE.
1566 Sblocks consist internally of sdata structures, one for each
1567 Lisp_String. The sdata structure points to the Lisp_String it
1568 belongs to. The Lisp_String points back to the `u.data' member of
1569 its sdata structure.
1571 When a Lisp_String is freed during GC, it is put back on
1572 string_free_list, and its `data' member and its sdata's `string'
1573 pointer is set to null. The size of the string is recorded in the
1574 `u.nbytes' member of the sdata. So, sdata structures that are no
1575 longer used, can be easily recognized, and it's easy to compact the
1576 sblocks of small strings which we do in compact_small_strings. */
1578 /* Size in bytes of an sblock structure used for small strings. This
1579 is 8192 minus malloc overhead. */
1581 #define SBLOCK_SIZE 8188
1583 /* Strings larger than this are considered large strings. String data
1584 for large strings is allocated from individual sblocks. */
1586 #define LARGE_STRING_BYTES 1024
1588 /* Structure describing string memory sub-allocated from an sblock.
1589 This is where the contents of Lisp strings are stored. */
1593 /* Back-pointer to the string this sdata belongs to. If null, this
1594 structure is free, and the NBYTES member of the union below
1595 contains the string's byte size (the same value that STRING_BYTES
1596 would return if STRING were non-null). If non-null, STRING_BYTES
1597 (STRING) is the size of the data, and DATA contains the string's
1599 struct Lisp_String
*string
;
1601 #ifdef GC_CHECK_STRING_BYTES
1604 unsigned char data
[1];
1606 #define SDATA_NBYTES(S) (S)->nbytes
1607 #define SDATA_DATA(S) (S)->data
1609 #else /* not GC_CHECK_STRING_BYTES */
1613 /* When STRING in non-null. */
1614 unsigned char data
[1];
1616 /* When STRING is null. */
1621 #define SDATA_NBYTES(S) (S)->u.nbytes
1622 #define SDATA_DATA(S) (S)->u.data
1624 #endif /* not GC_CHECK_STRING_BYTES */
1628 /* Structure describing a block of memory which is sub-allocated to
1629 obtain string data memory for strings. Blocks for small strings
1630 are of fixed size SBLOCK_SIZE. Blocks for large strings are made
1631 as large as needed. */
1636 struct sblock
*next
;
1638 /* Pointer to the next free sdata block. This points past the end
1639 of the sblock if there isn't any space left in this block. */
1640 struct sdata
*next_free
;
1642 /* Start of data. */
1643 struct sdata first_data
;
1646 /* Number of Lisp strings in a string_block structure. The 1020 is
1647 1024 minus malloc overhead. */
1649 #define STRING_BLOCK_SIZE \
1650 ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String))
1652 /* Structure describing a block from which Lisp_String structures
1657 /* Place `strings' first, to preserve alignment. */
1658 struct Lisp_String strings
[STRING_BLOCK_SIZE
];
1659 struct string_block
*next
;
1662 /* Head and tail of the list of sblock structures holding Lisp string
1663 data. We always allocate from current_sblock. The NEXT pointers
1664 in the sblock structures go from oldest_sblock to current_sblock. */
1666 static struct sblock
*oldest_sblock
, *current_sblock
;
1668 /* List of sblocks for large strings. */
1670 static struct sblock
*large_sblocks
;
1672 /* List of string_block structures, and how many there are. */
1674 static struct string_block
*string_blocks
;
1675 static int n_string_blocks
;
1677 /* Free-list of Lisp_Strings. */
1679 static struct Lisp_String
*string_free_list
;
1681 /* Number of live and free Lisp_Strings. */
1683 static int total_strings
, total_free_strings
;
1685 /* Number of bytes used by live strings. */
1687 static int total_string_size
;
1689 /* Given a pointer to a Lisp_String S which is on the free-list
1690 string_free_list, return a pointer to its successor in the
1693 #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S))
1695 /* Return a pointer to the sdata structure belonging to Lisp string S.
1696 S must be live, i.e. S->data must not be null. S->data is actually
1697 a pointer to the `u.data' member of its sdata structure; the
1698 structure starts at a constant offset in front of that. */
1700 #ifdef GC_CHECK_STRING_BYTES
1702 #define SDATA_OF_STRING(S) \
1703 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *) \
1704 - sizeof (EMACS_INT)))
1706 #else /* not GC_CHECK_STRING_BYTES */
1708 #define SDATA_OF_STRING(S) \
1709 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *)))
1711 #endif /* not GC_CHECK_STRING_BYTES */
1714 #ifdef GC_CHECK_STRING_OVERRUN
1716 /* We check for overrun in string data blocks by appending a small
1717 "cookie" after each allocated string data block, and check for the
1718 presence of this cookie during GC. */
1720 #define GC_STRING_OVERRUN_COOKIE_SIZE 4
1721 static char string_overrun_cookie
[GC_STRING_OVERRUN_COOKIE_SIZE
] =
1722 { 0xde, 0xad, 0xbe, 0xef };
1725 #define GC_STRING_OVERRUN_COOKIE_SIZE 0
1728 /* Value is the size of an sdata structure large enough to hold NBYTES
1729 bytes of string data. The value returned includes a terminating
1730 NUL byte, the size of the sdata structure, and padding. */
1732 #ifdef GC_CHECK_STRING_BYTES
1734 #define SDATA_SIZE(NBYTES) \
1735 ((sizeof (struct Lisp_String *) \
1737 + sizeof (EMACS_INT) \
1738 + sizeof (EMACS_INT) - 1) \
1739 & ~(sizeof (EMACS_INT) - 1))
1741 #else /* not GC_CHECK_STRING_BYTES */
1743 #define SDATA_SIZE(NBYTES) \
1744 ((sizeof (struct Lisp_String *) \
1746 + sizeof (EMACS_INT) - 1) \
1747 & ~(sizeof (EMACS_INT) - 1))
1749 #endif /* not GC_CHECK_STRING_BYTES */
1751 /* Extra bytes to allocate for each string. */
1753 #define GC_STRING_EXTRA (GC_STRING_OVERRUN_COOKIE_SIZE)
1755 /* Initialize string allocation. Called from init_alloc_once. */
1760 total_strings
= total_free_strings
= total_string_size
= 0;
1761 oldest_sblock
= current_sblock
= large_sblocks
= NULL
;
1762 string_blocks
= NULL
;
1763 n_string_blocks
= 0;
1764 string_free_list
= NULL
;
1765 empty_unibyte_string
= make_pure_string ("", 0, 0, 0);
1766 empty_multibyte_string
= make_pure_string ("", 0, 0, 1);
1770 #ifdef GC_CHECK_STRING_BYTES
1772 static int check_string_bytes_count
;
1774 void check_string_bytes
P_ ((int));
1775 void check_sblock
P_ ((struct sblock
*));
1777 #define CHECK_STRING_BYTES(S) STRING_BYTES (S)
1780 /* Like GC_STRING_BYTES, but with debugging check. */
1784 struct Lisp_String
*s
;
1786 int nbytes
= (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1787 if (!PURE_POINTER_P (s
)
1789 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1794 /* Check validity of Lisp strings' string_bytes member in B. */
1800 struct sdata
*from
, *end
, *from_end
;
1804 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1806 /* Compute the next FROM here because copying below may
1807 overwrite data we need to compute it. */
1810 /* Check that the string size recorded in the string is the
1811 same as the one recorded in the sdata structure. */
1813 CHECK_STRING_BYTES (from
->string
);
1816 nbytes
= GC_STRING_BYTES (from
->string
);
1818 nbytes
= SDATA_NBYTES (from
);
1820 nbytes
= SDATA_SIZE (nbytes
);
1821 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
1826 /* Check validity of Lisp strings' string_bytes member. ALL_P
1827 non-zero means check all strings, otherwise check only most
1828 recently allocated strings. Used for hunting a bug. */
1831 check_string_bytes (all_p
)
1838 for (b
= large_sblocks
; b
; b
= b
->next
)
1840 struct Lisp_String
*s
= b
->first_data
.string
;
1842 CHECK_STRING_BYTES (s
);
1845 for (b
= oldest_sblock
; b
; b
= b
->next
)
1849 check_sblock (current_sblock
);
1852 #endif /* GC_CHECK_STRING_BYTES */
1854 #ifdef GC_CHECK_STRING_FREE_LIST
1856 /* Walk through the string free list looking for bogus next pointers.
1857 This may catch buffer overrun from a previous string. */
1860 check_string_free_list ()
1862 struct Lisp_String
*s
;
1864 /* Pop a Lisp_String off the free-list. */
1865 s
= string_free_list
;
1868 if ((unsigned)s
< 1024)
1870 s
= NEXT_FREE_LISP_STRING (s
);
1874 #define check_string_free_list()
1877 /* Return a new Lisp_String. */
1879 static struct Lisp_String
*
1882 struct Lisp_String
*s
;
1884 /* eassert (!handling_signal); */
1888 /* If the free-list is empty, allocate a new string_block, and
1889 add all the Lisp_Strings in it to the free-list. */
1890 if (string_free_list
== NULL
)
1892 struct string_block
*b
;
1895 b
= (struct string_block
*) lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1896 bzero (b
, sizeof *b
);
1897 b
->next
= string_blocks
;
1901 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1904 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1905 string_free_list
= s
;
1908 total_free_strings
+= STRING_BLOCK_SIZE
;
1911 check_string_free_list ();
1913 /* Pop a Lisp_String off the free-list. */
1914 s
= string_free_list
;
1915 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1917 MALLOC_UNBLOCK_INPUT
;
1919 /* Probably not strictly necessary, but play it safe. */
1920 bzero (s
, sizeof *s
);
1922 --total_free_strings
;
1925 consing_since_gc
+= sizeof *s
;
1927 #ifdef GC_CHECK_STRING_BYTES
1934 if (++check_string_bytes_count
== 200)
1936 check_string_bytes_count
= 0;
1937 check_string_bytes (1);
1940 check_string_bytes (0);
1942 #endif /* GC_CHECK_STRING_BYTES */
1948 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1949 plus a NUL byte at the end. Allocate an sdata structure for S, and
1950 set S->data to its `u.data' member. Store a NUL byte at the end of
1951 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1952 S->data if it was initially non-null. */
1955 allocate_string_data (s
, nchars
, nbytes
)
1956 struct Lisp_String
*s
;
1959 struct sdata
*data
, *old_data
;
1961 int needed
, old_nbytes
;
1963 /* Determine the number of bytes needed to store NBYTES bytes
1965 needed
= SDATA_SIZE (nbytes
);
1966 old_data
= s
->data
? SDATA_OF_STRING (s
) : NULL
;
1967 old_nbytes
= GC_STRING_BYTES (s
);
1971 if (nbytes
> LARGE_STRING_BYTES
)
1973 size_t size
= sizeof *b
- sizeof (struct sdata
) + needed
;
1975 #ifdef DOUG_LEA_MALLOC
1976 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1977 because mapped region contents are not preserved in
1980 In case you think of allowing it in a dumped Emacs at the
1981 cost of not being able to re-dump, there's another reason:
1982 mmap'ed data typically have an address towards the top of the
1983 address space, which won't fit into an EMACS_INT (at least on
1984 32-bit systems with the current tagging scheme). --fx */
1985 mallopt (M_MMAP_MAX
, 0);
1988 b
= (struct sblock
*) lisp_malloc (size
+ GC_STRING_EXTRA
, MEM_TYPE_NON_LISP
);
1990 #ifdef DOUG_LEA_MALLOC
1991 /* Back to a reasonable maximum of mmap'ed areas. */
1992 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1995 b
->next_free
= &b
->first_data
;
1996 b
->first_data
.string
= NULL
;
1997 b
->next
= large_sblocks
;
2000 else if (current_sblock
== NULL
2001 || (((char *) current_sblock
+ SBLOCK_SIZE
2002 - (char *) current_sblock
->next_free
)
2003 < (needed
+ GC_STRING_EXTRA
)))
2005 /* Not enough room in the current sblock. */
2006 b
= (struct sblock
*) lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
2007 b
->next_free
= &b
->first_data
;
2008 b
->first_data
.string
= NULL
;
2012 current_sblock
->next
= b
;
2020 data
= b
->next_free
;
2021 b
->next_free
= (struct sdata
*) ((char *) data
+ needed
+ GC_STRING_EXTRA
);
2023 MALLOC_UNBLOCK_INPUT
;
2026 s
->data
= SDATA_DATA (data
);
2027 #ifdef GC_CHECK_STRING_BYTES
2028 SDATA_NBYTES (data
) = nbytes
;
2031 s
->size_byte
= nbytes
;
2032 s
->data
[nbytes
] = '\0';
2033 #ifdef GC_CHECK_STRING_OVERRUN
2034 bcopy (string_overrun_cookie
, (char *) data
+ needed
,
2035 GC_STRING_OVERRUN_COOKIE_SIZE
);
2038 /* If S had already data assigned, mark that as free by setting its
2039 string back-pointer to null, and recording the size of the data
2043 SDATA_NBYTES (old_data
) = old_nbytes
;
2044 old_data
->string
= NULL
;
2047 consing_since_gc
+= needed
;
2051 /* Sweep and compact strings. */
2056 struct string_block
*b
, *next
;
2057 struct string_block
*live_blocks
= NULL
;
2059 string_free_list
= NULL
;
2060 total_strings
= total_free_strings
= 0;
2061 total_string_size
= 0;
2063 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
2064 for (b
= string_blocks
; b
; b
= next
)
2067 struct Lisp_String
*free_list_before
= string_free_list
;
2071 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
2073 struct Lisp_String
*s
= b
->strings
+ i
;
2077 /* String was not on free-list before. */
2078 if (STRING_MARKED_P (s
))
2080 /* String is live; unmark it and its intervals. */
2083 if (!NULL_INTERVAL_P (s
->intervals
))
2084 UNMARK_BALANCE_INTERVALS (s
->intervals
);
2087 total_string_size
+= STRING_BYTES (s
);
2091 /* String is dead. Put it on the free-list. */
2092 struct sdata
*data
= SDATA_OF_STRING (s
);
2094 /* Save the size of S in its sdata so that we know
2095 how large that is. Reset the sdata's string
2096 back-pointer so that we know it's free. */
2097 #ifdef GC_CHECK_STRING_BYTES
2098 if (GC_STRING_BYTES (s
) != SDATA_NBYTES (data
))
2101 data
->u
.nbytes
= GC_STRING_BYTES (s
);
2103 data
->string
= NULL
;
2105 /* Reset the strings's `data' member so that we
2109 /* Put the string on the free-list. */
2110 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2111 string_free_list
= s
;
2117 /* S was on the free-list before. Put it there again. */
2118 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2119 string_free_list
= s
;
2124 /* Free blocks that contain free Lisp_Strings only, except
2125 the first two of them. */
2126 if (nfree
== STRING_BLOCK_SIZE
2127 && total_free_strings
> STRING_BLOCK_SIZE
)
2131 string_free_list
= free_list_before
;
2135 total_free_strings
+= nfree
;
2136 b
->next
= live_blocks
;
2141 check_string_free_list ();
2143 string_blocks
= live_blocks
;
2144 free_large_strings ();
2145 compact_small_strings ();
2147 check_string_free_list ();
2151 /* Free dead large strings. */
2154 free_large_strings ()
2156 struct sblock
*b
, *next
;
2157 struct sblock
*live_blocks
= NULL
;
2159 for (b
= large_sblocks
; b
; b
= next
)
2163 if (b
->first_data
.string
== NULL
)
2167 b
->next
= live_blocks
;
2172 large_sblocks
= live_blocks
;
2176 /* Compact data of small strings. Free sblocks that don't contain
2177 data of live strings after compaction. */
2180 compact_small_strings ()
2182 struct sblock
*b
, *tb
, *next
;
2183 struct sdata
*from
, *to
, *end
, *tb_end
;
2184 struct sdata
*to_end
, *from_end
;
2186 /* TB is the sblock we copy to, TO is the sdata within TB we copy
2187 to, and TB_END is the end of TB. */
2189 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2190 to
= &tb
->first_data
;
2192 /* Step through the blocks from the oldest to the youngest. We
2193 expect that old blocks will stabilize over time, so that less
2194 copying will happen this way. */
2195 for (b
= oldest_sblock
; b
; b
= b
->next
)
2198 xassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
2200 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
2202 /* Compute the next FROM here because copying below may
2203 overwrite data we need to compute it. */
2206 #ifdef GC_CHECK_STRING_BYTES
2207 /* Check that the string size recorded in the string is the
2208 same as the one recorded in the sdata structure. */
2210 && GC_STRING_BYTES (from
->string
) != SDATA_NBYTES (from
))
2212 #endif /* GC_CHECK_STRING_BYTES */
2215 nbytes
= GC_STRING_BYTES (from
->string
);
2217 nbytes
= SDATA_NBYTES (from
);
2219 if (nbytes
> LARGE_STRING_BYTES
)
2222 nbytes
= SDATA_SIZE (nbytes
);
2223 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
2225 #ifdef GC_CHECK_STRING_OVERRUN
2226 if (bcmp (string_overrun_cookie
,
2227 ((char *) from_end
) - GC_STRING_OVERRUN_COOKIE_SIZE
,
2228 GC_STRING_OVERRUN_COOKIE_SIZE
))
2232 /* FROM->string non-null means it's alive. Copy its data. */
2235 /* If TB is full, proceed with the next sblock. */
2236 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2237 if (to_end
> tb_end
)
2241 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2242 to
= &tb
->first_data
;
2243 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2246 /* Copy, and update the string's `data' pointer. */
2249 xassert (tb
!= b
|| to
<= from
);
2250 safe_bcopy ((char *) from
, (char *) to
, nbytes
+ GC_STRING_EXTRA
);
2251 to
->string
->data
= SDATA_DATA (to
);
2254 /* Advance past the sdata we copied to. */
2260 /* The rest of the sblocks following TB don't contain live data, so
2261 we can free them. */
2262 for (b
= tb
->next
; b
; b
= next
)
2270 current_sblock
= tb
;
2274 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
2275 doc
: /* Return a newly created string of length LENGTH, with INIT in each element.
2276 LENGTH must be an integer.
2277 INIT must be an integer that represents a character. */)
2279 Lisp_Object length
, init
;
2281 register Lisp_Object val
;
2282 register unsigned char *p
, *end
;
2285 CHECK_NATNUM (length
);
2286 CHECK_NUMBER (init
);
2289 if (SINGLE_BYTE_CHAR_P (c
))
2291 nbytes
= XINT (length
);
2292 val
= make_uninit_string (nbytes
);
2294 end
= p
+ SCHARS (val
);
2300 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
2301 int len
= CHAR_STRING (c
, str
);
2303 nbytes
= len
* XINT (length
);
2304 val
= make_uninit_multibyte_string (XINT (length
), nbytes
);
2309 bcopy (str
, p
, len
);
2319 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
2320 doc
: /* Return a new bool-vector of length LENGTH, using INIT for each element.
2321 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
2323 Lisp_Object length
, init
;
2325 register Lisp_Object val
;
2326 struct Lisp_Bool_Vector
*p
;
2328 int length_in_chars
, length_in_elts
, bits_per_value
;
2330 CHECK_NATNUM (length
);
2332 bits_per_value
= sizeof (EMACS_INT
) * BOOL_VECTOR_BITS_PER_CHAR
;
2334 length_in_elts
= (XFASTINT (length
) + bits_per_value
- 1) / bits_per_value
;
2335 length_in_chars
= ((XFASTINT (length
) + BOOL_VECTOR_BITS_PER_CHAR
- 1)
2336 / BOOL_VECTOR_BITS_PER_CHAR
);
2338 /* We must allocate one more elements than LENGTH_IN_ELTS for the
2339 slot `size' of the struct Lisp_Bool_Vector. */
2340 val
= Fmake_vector (make_number (length_in_elts
+ 1), Qnil
);
2342 /* Get rid of any bits that would cause confusion. */
2343 XVECTOR (val
)->size
= 0; /* No Lisp_Object to trace in there. */
2344 XSETPVECTYPE (XVECTOR (val
), PVEC_BOOL_VECTOR
);
2346 p
= XBOOL_VECTOR (val
);
2347 p
->size
= XFASTINT (length
);
2349 real_init
= (NILP (init
) ? 0 : -1);
2350 for (i
= 0; i
< length_in_chars
; i
++)
2351 p
->data
[i
] = real_init
;
2353 /* Clear the extraneous bits in the last byte. */
2354 if (XINT (length
) != length_in_chars
* BOOL_VECTOR_BITS_PER_CHAR
)
2355 p
->data
[length_in_chars
- 1]
2356 &= (1 << (XINT (length
) % BOOL_VECTOR_BITS_PER_CHAR
)) - 1;
2362 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
2363 of characters from the contents. This string may be unibyte or
2364 multibyte, depending on the contents. */
2367 make_string (contents
, nbytes
)
2368 const char *contents
;
2371 register Lisp_Object val
;
2372 int nchars
, multibyte_nbytes
;
2374 parse_str_as_multibyte (contents
, nbytes
, &nchars
, &multibyte_nbytes
);
2375 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
2376 /* CONTENTS contains no multibyte sequences or contains an invalid
2377 multibyte sequence. We must make unibyte string. */
2378 val
= make_unibyte_string (contents
, nbytes
);
2380 val
= make_multibyte_string (contents
, nchars
, nbytes
);
2385 /* Make an unibyte string from LENGTH bytes at CONTENTS. */
2388 make_unibyte_string (contents
, length
)
2389 const char *contents
;
2392 register Lisp_Object val
;
2393 val
= make_uninit_string (length
);
2394 bcopy (contents
, SDATA (val
), length
);
2395 STRING_SET_UNIBYTE (val
);
2400 /* Make a multibyte string from NCHARS characters occupying NBYTES
2401 bytes at CONTENTS. */
2404 make_multibyte_string (contents
, nchars
, nbytes
)
2405 const char *contents
;
2408 register Lisp_Object val
;
2409 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2410 bcopy (contents
, SDATA (val
), nbytes
);
2415 /* Make a string from NCHARS characters occupying NBYTES bytes at
2416 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2419 make_string_from_bytes (contents
, nchars
, nbytes
)
2420 const char *contents
;
2423 register Lisp_Object val
;
2424 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2425 bcopy (contents
, SDATA (val
), nbytes
);
2426 if (SBYTES (val
) == SCHARS (val
))
2427 STRING_SET_UNIBYTE (val
);
2432 /* Make a string from NCHARS characters occupying NBYTES bytes at
2433 CONTENTS. The argument MULTIBYTE controls whether to label the
2434 string as multibyte. If NCHARS is negative, it counts the number of
2435 characters by itself. */
2438 make_specified_string (contents
, nchars
, nbytes
, multibyte
)
2439 const char *contents
;
2443 register Lisp_Object val
;
2448 nchars
= multibyte_chars_in_text (contents
, nbytes
);
2452 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2453 bcopy (contents
, SDATA (val
), nbytes
);
2455 STRING_SET_UNIBYTE (val
);
2460 /* Make a string from the data at STR, treating it as multibyte if the
2467 return make_string (str
, strlen (str
));
2471 /* Return an unibyte Lisp_String set up to hold LENGTH characters
2472 occupying LENGTH bytes. */
2475 make_uninit_string (length
)
2481 return empty_unibyte_string
;
2482 val
= make_uninit_multibyte_string (length
, length
);
2483 STRING_SET_UNIBYTE (val
);
2488 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2489 which occupy NBYTES bytes. */
2492 make_uninit_multibyte_string (nchars
, nbytes
)
2496 struct Lisp_String
*s
;
2501 return empty_multibyte_string
;
2503 s
= allocate_string ();
2504 allocate_string_data (s
, nchars
, nbytes
);
2505 XSETSTRING (string
, s
);
2506 string_chars_consed
+= nbytes
;
2512 /***********************************************************************
2514 ***********************************************************************/
2516 /* We store float cells inside of float_blocks, allocating a new
2517 float_block with malloc whenever necessary. Float cells reclaimed
2518 by GC are put on a free list to be reallocated before allocating
2519 any new float cells from the latest float_block. */
2521 #define FLOAT_BLOCK_SIZE \
2522 (((BLOCK_BYTES - sizeof (struct float_block *) \
2523 /* The compiler might add padding at the end. */ \
2524 - (sizeof (struct Lisp_Float) - sizeof (int))) * CHAR_BIT) \
2525 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2527 #define GETMARKBIT(block,n) \
2528 (((block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2529 >> ((n) % (sizeof(int) * CHAR_BIT))) \
2532 #define SETMARKBIT(block,n) \
2533 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2534 |= 1 << ((n) % (sizeof(int) * CHAR_BIT))
2536 #define UNSETMARKBIT(block,n) \
2537 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2538 &= ~(1 << ((n) % (sizeof(int) * CHAR_BIT)))
2540 #define FLOAT_BLOCK(fptr) \
2541 ((struct float_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2543 #define FLOAT_INDEX(fptr) \
2544 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2548 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2549 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2550 int gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2551 struct float_block
*next
;
2554 #define FLOAT_MARKED_P(fptr) \
2555 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2557 #define FLOAT_MARK(fptr) \
2558 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2560 #define FLOAT_UNMARK(fptr) \
2561 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2563 /* Current float_block. */
2565 struct float_block
*float_block
;
2567 /* Index of first unused Lisp_Float in the current float_block. */
2569 int float_block_index
;
2571 /* Total number of float blocks now in use. */
2575 /* Free-list of Lisp_Floats. */
2577 struct Lisp_Float
*float_free_list
;
2580 /* Initialize float allocation. */
2586 float_block_index
= FLOAT_BLOCK_SIZE
; /* Force alloc of new float_block. */
2587 float_free_list
= 0;
2592 /* Explicitly free a float cell by putting it on the free-list. */
2596 struct Lisp_Float
*ptr
;
2598 ptr
->u
.chain
= float_free_list
;
2599 float_free_list
= ptr
;
2603 /* Return a new float object with value FLOAT_VALUE. */
2606 make_float (float_value
)
2609 register Lisp_Object val
;
2611 /* eassert (!handling_signal); */
2615 if (float_free_list
)
2617 /* We use the data field for chaining the free list
2618 so that we won't use the same field that has the mark bit. */
2619 XSETFLOAT (val
, float_free_list
);
2620 float_free_list
= float_free_list
->u
.chain
;
2624 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2626 register struct float_block
*new;
2628 new = (struct float_block
*) lisp_align_malloc (sizeof *new,
2630 new->next
= float_block
;
2631 bzero ((char *) new->gcmarkbits
, sizeof new->gcmarkbits
);
2633 float_block_index
= 0;
2636 XSETFLOAT (val
, &float_block
->floats
[float_block_index
]);
2637 float_block_index
++;
2640 MALLOC_UNBLOCK_INPUT
;
2642 XFLOAT_DATA (val
) = float_value
;
2643 eassert (!FLOAT_MARKED_P (XFLOAT (val
)));
2644 consing_since_gc
+= sizeof (struct Lisp_Float
);
2651 /***********************************************************************
2653 ***********************************************************************/
2655 /* We store cons cells inside of cons_blocks, allocating a new
2656 cons_block with malloc whenever necessary. Cons cells reclaimed by
2657 GC are put on a free list to be reallocated before allocating
2658 any new cons cells from the latest cons_block. */
2660 #define CONS_BLOCK_SIZE \
2661 (((BLOCK_BYTES - sizeof (struct cons_block *)) * CHAR_BIT) \
2662 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2664 #define CONS_BLOCK(fptr) \
2665 ((struct cons_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2667 #define CONS_INDEX(fptr) \
2668 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2672 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2673 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2674 int gcmarkbits
[1 + CONS_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2675 struct cons_block
*next
;
2678 #define CONS_MARKED_P(fptr) \
2679 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2681 #define CONS_MARK(fptr) \
2682 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2684 #define CONS_UNMARK(fptr) \
2685 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2687 /* Current cons_block. */
2689 struct cons_block
*cons_block
;
2691 /* Index of first unused Lisp_Cons in the current block. */
2693 int cons_block_index
;
2695 /* Free-list of Lisp_Cons structures. */
2697 struct Lisp_Cons
*cons_free_list
;
2699 /* Total number of cons blocks now in use. */
2704 /* Initialize cons allocation. */
2710 cons_block_index
= CONS_BLOCK_SIZE
; /* Force alloc of new cons_block. */
2716 /* Explicitly free a cons cell by putting it on the free-list. */
2720 struct Lisp_Cons
*ptr
;
2722 ptr
->u
.chain
= cons_free_list
;
2726 cons_free_list
= ptr
;
2729 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
2730 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2732 Lisp_Object car
, cdr
;
2734 register Lisp_Object val
;
2736 /* eassert (!handling_signal); */
2742 /* We use the cdr for chaining the free list
2743 so that we won't use the same field that has the mark bit. */
2744 XSETCONS (val
, cons_free_list
);
2745 cons_free_list
= cons_free_list
->u
.chain
;
2749 if (cons_block_index
== CONS_BLOCK_SIZE
)
2751 register struct cons_block
*new;
2752 new = (struct cons_block
*) lisp_align_malloc (sizeof *new,
2754 bzero ((char *) new->gcmarkbits
, sizeof new->gcmarkbits
);
2755 new->next
= cons_block
;
2757 cons_block_index
= 0;
2760 XSETCONS (val
, &cons_block
->conses
[cons_block_index
]);
2764 MALLOC_UNBLOCK_INPUT
;
2768 eassert (!CONS_MARKED_P (XCONS (val
)));
2769 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2770 cons_cells_consed
++;
2774 /* Get an error now if there's any junk in the cons free list. */
2778 #ifdef GC_CHECK_CONS_LIST
2779 struct Lisp_Cons
*tail
= cons_free_list
;
2782 tail
= tail
->u
.chain
;
2786 /* Make a list of 1, 2, 3, 4 or 5 specified objects. */
2792 return Fcons (arg1
, Qnil
);
2797 Lisp_Object arg1
, arg2
;
2799 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2804 list3 (arg1
, arg2
, arg3
)
2805 Lisp_Object arg1
, arg2
, arg3
;
2807 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2812 list4 (arg1
, arg2
, arg3
, arg4
)
2813 Lisp_Object arg1
, arg2
, arg3
, arg4
;
2815 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2820 list5 (arg1
, arg2
, arg3
, arg4
, arg5
)
2821 Lisp_Object arg1
, arg2
, arg3
, arg4
, arg5
;
2823 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2824 Fcons (arg5
, Qnil
)))));
2828 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
2829 doc
: /* Return a newly created list with specified arguments as elements.
2830 Any number of arguments, even zero arguments, are allowed.
2831 usage: (list &rest OBJECTS) */)
2834 register Lisp_Object
*args
;
2836 register Lisp_Object val
;
2842 val
= Fcons (args
[nargs
], val
);
2848 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2849 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2851 register Lisp_Object length
, init
;
2853 register Lisp_Object val
;
2856 CHECK_NATNUM (length
);
2857 size
= XFASTINT (length
);
2862 val
= Fcons (init
, val
);
2867 val
= Fcons (init
, val
);
2872 val
= Fcons (init
, val
);
2877 val
= Fcons (init
, val
);
2882 val
= Fcons (init
, val
);
2897 /***********************************************************************
2899 ***********************************************************************/
2901 /* Singly-linked list of all vectors. */
2903 struct Lisp_Vector
*all_vectors
;
2905 /* Total number of vector-like objects now in use. */
2910 /* Value is a pointer to a newly allocated Lisp_Vector structure
2911 with room for LEN Lisp_Objects. */
2913 static struct Lisp_Vector
*
2914 allocate_vectorlike (len
)
2917 struct Lisp_Vector
*p
;
2922 #ifdef DOUG_LEA_MALLOC
2923 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
2924 because mapped region contents are not preserved in
2926 mallopt (M_MMAP_MAX
, 0);
2929 /* This gets triggered by code which I haven't bothered to fix. --Stef */
2930 /* eassert (!handling_signal); */
2932 nbytes
= sizeof *p
+ (len
- 1) * sizeof p
->contents
[0];
2933 p
= (struct Lisp_Vector
*) lisp_malloc (nbytes
, MEM_TYPE_VECTORLIKE
);
2935 #ifdef DOUG_LEA_MALLOC
2936 /* Back to a reasonable maximum of mmap'ed areas. */
2937 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2940 consing_since_gc
+= nbytes
;
2941 vector_cells_consed
+= len
;
2943 p
->next
= all_vectors
;
2946 MALLOC_UNBLOCK_INPUT
;
2953 /* Allocate a vector with NSLOTS slots. */
2955 struct Lisp_Vector
*
2956 allocate_vector (nslots
)
2959 struct Lisp_Vector
*v
= allocate_vectorlike (nslots
);
2965 /* Allocate other vector-like structures. */
2967 static struct Lisp_Vector
*
2968 allocate_pseudovector (memlen
, lisplen
, tag
)
2969 int memlen
, lisplen
;
2972 struct Lisp_Vector
*v
= allocate_vectorlike (memlen
);
2975 /* Only the first lisplen slots will be traced normally by the GC. */
2977 for (i
= 0; i
< lisplen
; ++i
)
2978 v
->contents
[i
] = Qnil
;
2980 XSETPVECTYPE (v
, tag
); /* Add the appropriate tag. */
2983 #define ALLOCATE_PSEUDOVECTOR(typ,field,tag) \
2985 allocate_pseudovector \
2986 (VECSIZE (typ), PSEUDOVECSIZE (typ, field), tag))
2988 struct Lisp_Hash_Table
*
2989 allocate_hash_table ()
2991 EMACS_INT len
= VECSIZE (struct Lisp_Hash_Table
);
2992 struct Lisp_Vector
*v
= allocate_vectorlike (len
);
2996 for (i
= 0; i
< len
; ++i
)
2997 v
->contents
[i
] = Qnil
;
2999 return (struct Lisp_Hash_Table
*) v
;
3006 return ALLOCATE_PSEUDOVECTOR(struct window
, current_matrix
, PVEC_WINDOW
);
3011 allocate_terminal ()
3013 struct terminal
*t
= ALLOCATE_PSEUDOVECTOR (struct terminal
,
3014 next_terminal
, PVEC_TERMINAL
);
3015 /* Zero out the non-GC'd fields. FIXME: This should be made unnecessary. */
3016 bzero (&(t
->next_terminal
),
3017 ((char*)(t
+1)) - ((char*)&(t
->next_terminal
)));
3025 struct frame
*f
= ALLOCATE_PSEUDOVECTOR (struct frame
,
3026 face_cache
, PVEC_FRAME
);
3027 /* Zero out the non-GC'd fields. FIXME: This should be made unnecessary. */
3028 bzero (&(f
->face_cache
),
3029 ((char*)(f
+1)) - ((char*)&(f
->face_cache
)));
3034 struct Lisp_Process
*
3037 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Process
, pid
, PVEC_PROCESS
);
3041 /* Only used for PVEC_WINDOW_CONFIGURATION. */
3042 struct Lisp_Vector
*
3043 allocate_other_vector (len
)
3046 struct Lisp_Vector
*v
= allocate_vectorlike (len
);
3049 for (i
= 0; i
< len
; ++i
)
3050 v
->contents
[i
] = Qnil
;
3057 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
3058 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
3059 See also the function `vector'. */)
3061 register Lisp_Object length
, init
;
3064 register EMACS_INT sizei
;
3066 register struct Lisp_Vector
*p
;
3068 CHECK_NATNUM (length
);
3069 sizei
= XFASTINT (length
);
3071 p
= allocate_vector (sizei
);
3072 for (index
= 0; index
< sizei
; index
++)
3073 p
->contents
[index
] = init
;
3075 XSETVECTOR (vector
, p
);
3080 DEFUN ("make-char-table", Fmake_char_table
, Smake_char_table
, 1, 2, 0,
3081 doc
: /* Return a newly created char-table, with purpose PURPOSE.
3082 Each element is initialized to INIT, which defaults to nil.
3083 PURPOSE should be a symbol which has a `char-table-extra-slots' property.
3084 The property's value should be an integer between 0 and 10. */)
3086 register Lisp_Object purpose
, init
;
3090 CHECK_SYMBOL (purpose
);
3091 n
= Fget (purpose
, Qchar_table_extra_slots
);
3093 if (XINT (n
) < 0 || XINT (n
) > 10)
3094 args_out_of_range (n
, Qnil
);
3095 /* Add 2 to the size for the defalt and parent slots. */
3096 vector
= Fmake_vector (make_number (CHAR_TABLE_STANDARD_SLOTS
+ XINT (n
)),
3098 XSETPVECTYPE (XVECTOR (vector
), PVEC_CHAR_TABLE
);
3099 XCHAR_TABLE (vector
)->top
= Qt
;
3100 XCHAR_TABLE (vector
)->parent
= Qnil
;
3101 XCHAR_TABLE (vector
)->purpose
= purpose
;
3102 XSETCHAR_TABLE (vector
, XCHAR_TABLE (vector
));
3107 /* Return a newly created sub char table with slots initialized by INIT.
3108 Since a sub char table does not appear as a top level Emacs Lisp
3109 object, we don't need a Lisp interface to make it. */
3112 make_sub_char_table (init
)
3116 = Fmake_vector (make_number (SUB_CHAR_TABLE_STANDARD_SLOTS
), init
);
3117 XSETPVECTYPE (XVECTOR (vector
), PVEC_CHAR_TABLE
);
3118 XCHAR_TABLE (vector
)->top
= Qnil
;
3119 XCHAR_TABLE (vector
)->defalt
= Qnil
;
3120 XSETCHAR_TABLE (vector
, XCHAR_TABLE (vector
));
3125 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
3126 doc
: /* Return a newly created vector with specified arguments as elements.
3127 Any number of arguments, even zero arguments, are allowed.
3128 usage: (vector &rest OBJECTS) */)
3133 register Lisp_Object len
, val
;
3135 register struct Lisp_Vector
*p
;
3137 XSETFASTINT (len
, nargs
);
3138 val
= Fmake_vector (len
, Qnil
);
3140 for (index
= 0; index
< nargs
; index
++)
3141 p
->contents
[index
] = args
[index
];
3146 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
3147 doc
: /* Create a byte-code object with specified arguments as elements.
3148 The arguments should be the arglist, bytecode-string, constant vector,
3149 stack size, (optional) doc string, and (optional) interactive spec.
3150 The first four arguments are required; at most six have any
3152 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
3157 register Lisp_Object len
, val
;
3159 register struct Lisp_Vector
*p
;
3161 XSETFASTINT (len
, nargs
);
3162 if (!NILP (Vpurify_flag
))
3163 val
= make_pure_vector ((EMACS_INT
) nargs
);
3165 val
= Fmake_vector (len
, Qnil
);
3167 if (STRINGP (args
[1]) && STRING_MULTIBYTE (args
[1]))
3168 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
3169 earlier because they produced a raw 8-bit string for byte-code
3170 and now such a byte-code string is loaded as multibyte while
3171 raw 8-bit characters converted to multibyte form. Thus, now we
3172 must convert them back to the original unibyte form. */
3173 args
[1] = Fstring_as_unibyte (args
[1]);
3176 for (index
= 0; index
< nargs
; index
++)
3178 if (!NILP (Vpurify_flag
))
3179 args
[index
] = Fpurecopy (args
[index
]);
3180 p
->contents
[index
] = args
[index
];
3182 XSETPVECTYPE (p
, PVEC_COMPILED
);
3183 XSETCOMPILED (val
, p
);
3189 /***********************************************************************
3191 ***********************************************************************/
3193 /* Each symbol_block is just under 1020 bytes long, since malloc
3194 really allocates in units of powers of two and uses 4 bytes for its
3197 #define SYMBOL_BLOCK_SIZE \
3198 ((1020 - sizeof (struct symbol_block *)) / sizeof (struct Lisp_Symbol))
3202 /* Place `symbols' first, to preserve alignment. */
3203 struct Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
3204 struct symbol_block
*next
;
3207 /* Current symbol block and index of first unused Lisp_Symbol
3210 struct symbol_block
*symbol_block
;
3211 int symbol_block_index
;
3213 /* List of free symbols. */
3215 struct Lisp_Symbol
*symbol_free_list
;
3217 /* Total number of symbol blocks now in use. */
3219 int n_symbol_blocks
;
3222 /* Initialize symbol allocation. */
3227 symbol_block
= NULL
;
3228 symbol_block_index
= SYMBOL_BLOCK_SIZE
;
3229 symbol_free_list
= 0;
3230 n_symbol_blocks
= 0;
3234 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
3235 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
3236 Its value and function definition are void, and its property list is nil. */)
3240 register Lisp_Object val
;
3241 register struct Lisp_Symbol
*p
;
3243 CHECK_STRING (name
);
3245 /* eassert (!handling_signal); */
3249 if (symbol_free_list
)
3251 XSETSYMBOL (val
, symbol_free_list
);
3252 symbol_free_list
= symbol_free_list
->next
;
3256 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
3258 struct symbol_block
*new;
3259 new = (struct symbol_block
*) lisp_malloc (sizeof *new,
3261 new->next
= symbol_block
;
3263 symbol_block_index
= 0;
3266 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
]);
3267 symbol_block_index
++;
3270 MALLOC_UNBLOCK_INPUT
;
3275 p
->value
= Qunbound
;
3276 p
->function
= Qunbound
;
3279 p
->interned
= SYMBOL_UNINTERNED
;
3281 p
->indirect_variable
= 0;
3282 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
3289 /***********************************************************************
3290 Marker (Misc) Allocation
3291 ***********************************************************************/
3293 /* Allocation of markers and other objects that share that structure.
3294 Works like allocation of conses. */
3296 #define MARKER_BLOCK_SIZE \
3297 ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc))
3301 /* Place `markers' first, to preserve alignment. */
3302 union Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
3303 struct marker_block
*next
;
3306 struct marker_block
*marker_block
;
3307 int marker_block_index
;
3309 union Lisp_Misc
*marker_free_list
;
3311 /* Total number of marker blocks now in use. */
3313 int n_marker_blocks
;
3318 marker_block
= NULL
;
3319 marker_block_index
= MARKER_BLOCK_SIZE
;
3320 marker_free_list
= 0;
3321 n_marker_blocks
= 0;
3324 /* Return a newly allocated Lisp_Misc object, with no substructure. */
3331 /* eassert (!handling_signal); */
3335 if (marker_free_list
)
3337 XSETMISC (val
, marker_free_list
);
3338 marker_free_list
= marker_free_list
->u_free
.chain
;
3342 if (marker_block_index
== MARKER_BLOCK_SIZE
)
3344 struct marker_block
*new;
3345 new = (struct marker_block
*) lisp_malloc (sizeof *new,
3347 new->next
= marker_block
;
3349 marker_block_index
= 0;
3351 total_free_markers
+= MARKER_BLOCK_SIZE
;
3353 XSETMISC (val
, &marker_block
->markers
[marker_block_index
]);
3354 marker_block_index
++;
3357 MALLOC_UNBLOCK_INPUT
;
3359 --total_free_markers
;
3360 consing_since_gc
+= sizeof (union Lisp_Misc
);
3361 misc_objects_consed
++;
3362 XMARKER (val
)->gcmarkbit
= 0;
3366 /* Free a Lisp_Misc object */
3372 XMISC (misc
)->u_marker
.type
= Lisp_Misc_Free
;
3373 XMISC (misc
)->u_free
.chain
= marker_free_list
;
3374 marker_free_list
= XMISC (misc
);
3376 total_free_markers
++;
3379 /* Return a Lisp_Misc_Save_Value object containing POINTER and
3380 INTEGER. This is used to package C values to call record_unwind_protect.
3381 The unwind function can get the C values back using XSAVE_VALUE. */
3384 make_save_value (pointer
, integer
)
3388 register Lisp_Object val
;
3389 register struct Lisp_Save_Value
*p
;
3391 val
= allocate_misc ();
3392 XMISCTYPE (val
) = Lisp_Misc_Save_Value
;
3393 p
= XSAVE_VALUE (val
);
3394 p
->pointer
= pointer
;
3395 p
->integer
= integer
;
3400 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
3401 doc
: /* Return a newly allocated marker which does not point at any place. */)
3404 register Lisp_Object val
;
3405 register struct Lisp_Marker
*p
;
3407 val
= allocate_misc ();
3408 XMISCTYPE (val
) = Lisp_Misc_Marker
;
3414 p
->insertion_type
= 0;
3418 /* Put MARKER back on the free list after using it temporarily. */
3421 free_marker (marker
)
3424 unchain_marker (XMARKER (marker
));
3429 /* Return a newly created vector or string with specified arguments as
3430 elements. If all the arguments are characters that can fit
3431 in a string of events, make a string; otherwise, make a vector.
3433 Any number of arguments, even zero arguments, are allowed. */
3436 make_event_array (nargs
, args
)
3442 for (i
= 0; i
< nargs
; i
++)
3443 /* The things that fit in a string
3444 are characters that are in 0...127,
3445 after discarding the meta bit and all the bits above it. */
3446 if (!INTEGERP (args
[i
])
3447 || (XUINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
3448 return Fvector (nargs
, args
);
3450 /* Since the loop exited, we know that all the things in it are
3451 characters, so we can make a string. */
3455 result
= Fmake_string (make_number (nargs
), make_number (0));
3456 for (i
= 0; i
< nargs
; i
++)
3458 SSET (result
, i
, XINT (args
[i
]));
3459 /* Move the meta bit to the right place for a string char. */
3460 if (XINT (args
[i
]) & CHAR_META
)
3461 SSET (result
, i
, SREF (result
, i
) | 0x80);
3470 /************************************************************************
3471 Memory Full Handling
3472 ************************************************************************/
3475 /* Called if malloc returns zero. */
3484 memory_full_cons_threshold
= sizeof (struct cons_block
);
3486 /* The first time we get here, free the spare memory. */
3487 for (i
= 0; i
< sizeof (spare_memory
) / sizeof (char *); i
++)
3488 if (spare_memory
[i
])
3491 free (spare_memory
[i
]);
3492 else if (i
>= 1 && i
<= 4)
3493 lisp_align_free (spare_memory
[i
]);
3495 lisp_free (spare_memory
[i
]);
3496 spare_memory
[i
] = 0;
3499 /* Record the space now used. When it decreases substantially,
3500 we can refill the memory reserve. */
3501 #ifndef SYSTEM_MALLOC
3502 bytes_used_when_full
= BYTES_USED
;
3505 /* This used to call error, but if we've run out of memory, we could
3506 get infinite recursion trying to build the string. */
3507 xsignal (Qnil
, Vmemory_signal_data
);
3510 /* If we released our reserve (due to running out of memory),
3511 and we have a fair amount free once again,
3512 try to set aside another reserve in case we run out once more.
3514 This is called when a relocatable block is freed in ralloc.c,
3515 and also directly from this file, in case we're not using ralloc.c. */
3518 refill_memory_reserve ()
3520 #ifndef SYSTEM_MALLOC
3521 if (spare_memory
[0] == 0)
3522 spare_memory
[0] = (char *) malloc ((size_t) SPARE_MEMORY
);
3523 if (spare_memory
[1] == 0)
3524 spare_memory
[1] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3526 if (spare_memory
[2] == 0)
3527 spare_memory
[2] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3529 if (spare_memory
[3] == 0)
3530 spare_memory
[3] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3532 if (spare_memory
[4] == 0)
3533 spare_memory
[4] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3535 if (spare_memory
[5] == 0)
3536 spare_memory
[5] = (char *) lisp_malloc (sizeof (struct string_block
),
3538 if (spare_memory
[6] == 0)
3539 spare_memory
[6] = (char *) lisp_malloc (sizeof (struct string_block
),
3541 if (spare_memory
[0] && spare_memory
[1] && spare_memory
[5])
3542 Vmemory_full
= Qnil
;
3546 /************************************************************************
3548 ************************************************************************/
3550 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
3552 /* Conservative C stack marking requires a method to identify possibly
3553 live Lisp objects given a pointer value. We do this by keeping
3554 track of blocks of Lisp data that are allocated in a red-black tree
3555 (see also the comment of mem_node which is the type of nodes in
3556 that tree). Function lisp_malloc adds information for an allocated
3557 block to the red-black tree with calls to mem_insert, and function
3558 lisp_free removes it with mem_delete. Functions live_string_p etc
3559 call mem_find to lookup information about a given pointer in the
3560 tree, and use that to determine if the pointer points to a Lisp
3563 /* Initialize this part of alloc.c. */
3568 mem_z
.left
= mem_z
.right
= MEM_NIL
;
3569 mem_z
.parent
= NULL
;
3570 mem_z
.color
= MEM_BLACK
;
3571 mem_z
.start
= mem_z
.end
= NULL
;
3576 /* Value is a pointer to the mem_node containing START. Value is
3577 MEM_NIL if there is no node in the tree containing START. */
3579 static INLINE
struct mem_node
*
3585 if (start
< min_heap_address
|| start
> max_heap_address
)
3588 /* Make the search always successful to speed up the loop below. */
3589 mem_z
.start
= start
;
3590 mem_z
.end
= (char *) start
+ 1;
3593 while (start
< p
->start
|| start
>= p
->end
)
3594 p
= start
< p
->start
? p
->left
: p
->right
;
3599 /* Insert a new node into the tree for a block of memory with start
3600 address START, end address END, and type TYPE. Value is a
3601 pointer to the node that was inserted. */
3603 static struct mem_node
*
3604 mem_insert (start
, end
, type
)
3608 struct mem_node
*c
, *parent
, *x
;
3610 if (min_heap_address
== NULL
|| start
< min_heap_address
)
3611 min_heap_address
= start
;
3612 if (max_heap_address
== NULL
|| end
> max_heap_address
)
3613 max_heap_address
= end
;
3615 /* See where in the tree a node for START belongs. In this
3616 particular application, it shouldn't happen that a node is already
3617 present. For debugging purposes, let's check that. */
3621 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3623 while (c
!= MEM_NIL
)
3625 if (start
>= c
->start
&& start
< c
->end
)
3628 c
= start
< c
->start
? c
->left
: c
->right
;
3631 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3633 while (c
!= MEM_NIL
)
3636 c
= start
< c
->start
? c
->left
: c
->right
;
3639 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3641 /* Create a new node. */
3642 #ifdef GC_MALLOC_CHECK
3643 x
= (struct mem_node
*) _malloc_internal (sizeof *x
);
3647 x
= (struct mem_node
*) xmalloc (sizeof *x
);
3653 x
->left
= x
->right
= MEM_NIL
;
3656 /* Insert it as child of PARENT or install it as root. */
3659 if (start
< parent
->start
)
3667 /* Re-establish red-black tree properties. */
3668 mem_insert_fixup (x
);
3674 /* Re-establish the red-black properties of the tree, and thereby
3675 balance the tree, after node X has been inserted; X is always red. */
3678 mem_insert_fixup (x
)
3681 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3683 /* X is red and its parent is red. This is a violation of
3684 red-black tree property #3. */
3686 if (x
->parent
== x
->parent
->parent
->left
)
3688 /* We're on the left side of our grandparent, and Y is our
3690 struct mem_node
*y
= x
->parent
->parent
->right
;
3692 if (y
->color
== MEM_RED
)
3694 /* Uncle and parent are red but should be black because
3695 X is red. Change the colors accordingly and proceed
3696 with the grandparent. */
3697 x
->parent
->color
= MEM_BLACK
;
3698 y
->color
= MEM_BLACK
;
3699 x
->parent
->parent
->color
= MEM_RED
;
3700 x
= x
->parent
->parent
;
3704 /* Parent and uncle have different colors; parent is
3705 red, uncle is black. */
3706 if (x
== x
->parent
->right
)
3709 mem_rotate_left (x
);
3712 x
->parent
->color
= MEM_BLACK
;
3713 x
->parent
->parent
->color
= MEM_RED
;
3714 mem_rotate_right (x
->parent
->parent
);
3719 /* This is the symmetrical case of above. */
3720 struct mem_node
*y
= x
->parent
->parent
->left
;
3722 if (y
->color
== MEM_RED
)
3724 x
->parent
->color
= MEM_BLACK
;
3725 y
->color
= MEM_BLACK
;
3726 x
->parent
->parent
->color
= MEM_RED
;
3727 x
= x
->parent
->parent
;
3731 if (x
== x
->parent
->left
)
3734 mem_rotate_right (x
);
3737 x
->parent
->color
= MEM_BLACK
;
3738 x
->parent
->parent
->color
= MEM_RED
;
3739 mem_rotate_left (x
->parent
->parent
);
3744 /* The root may have been changed to red due to the algorithm. Set
3745 it to black so that property #5 is satisfied. */
3746 mem_root
->color
= MEM_BLACK
;
3762 /* Turn y's left sub-tree into x's right sub-tree. */
3765 if (y
->left
!= MEM_NIL
)
3766 y
->left
->parent
= x
;
3768 /* Y's parent was x's parent. */
3770 y
->parent
= x
->parent
;
3772 /* Get the parent to point to y instead of x. */
3775 if (x
== x
->parent
->left
)
3776 x
->parent
->left
= y
;
3778 x
->parent
->right
= y
;
3783 /* Put x on y's left. */
3797 mem_rotate_right (x
)
3800 struct mem_node
*y
= x
->left
;
3803 if (y
->right
!= MEM_NIL
)
3804 y
->right
->parent
= x
;
3807 y
->parent
= x
->parent
;
3810 if (x
== x
->parent
->right
)
3811 x
->parent
->right
= y
;
3813 x
->parent
->left
= y
;
3824 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
3830 struct mem_node
*x
, *y
;
3832 if (!z
|| z
== MEM_NIL
)
3835 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
3840 while (y
->left
!= MEM_NIL
)
3844 if (y
->left
!= MEM_NIL
)
3849 x
->parent
= y
->parent
;
3852 if (y
== y
->parent
->left
)
3853 y
->parent
->left
= x
;
3855 y
->parent
->right
= x
;
3862 z
->start
= y
->start
;
3867 if (y
->color
== MEM_BLACK
)
3868 mem_delete_fixup (x
);
3870 #ifdef GC_MALLOC_CHECK
3878 /* Re-establish the red-black properties of the tree, after a
3882 mem_delete_fixup (x
)
3885 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
3887 if (x
== x
->parent
->left
)
3889 struct mem_node
*w
= x
->parent
->right
;
3891 if (w
->color
== MEM_RED
)
3893 w
->color
= MEM_BLACK
;
3894 x
->parent
->color
= MEM_RED
;
3895 mem_rotate_left (x
->parent
);
3896 w
= x
->parent
->right
;
3899 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
3906 if (w
->right
->color
== MEM_BLACK
)
3908 w
->left
->color
= MEM_BLACK
;
3910 mem_rotate_right (w
);
3911 w
= x
->parent
->right
;
3913 w
->color
= x
->parent
->color
;
3914 x
->parent
->color
= MEM_BLACK
;
3915 w
->right
->color
= MEM_BLACK
;
3916 mem_rotate_left (x
->parent
);
3922 struct mem_node
*w
= x
->parent
->left
;
3924 if (w
->color
== MEM_RED
)
3926 w
->color
= MEM_BLACK
;
3927 x
->parent
->color
= MEM_RED
;
3928 mem_rotate_right (x
->parent
);
3929 w
= x
->parent
->left
;
3932 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
3939 if (w
->left
->color
== MEM_BLACK
)
3941 w
->right
->color
= MEM_BLACK
;
3943 mem_rotate_left (w
);
3944 w
= x
->parent
->left
;
3947 w
->color
= x
->parent
->color
;
3948 x
->parent
->color
= MEM_BLACK
;
3949 w
->left
->color
= MEM_BLACK
;
3950 mem_rotate_right (x
->parent
);
3956 x
->color
= MEM_BLACK
;
3960 /* Value is non-zero if P is a pointer to a live Lisp string on
3961 the heap. M is a pointer to the mem_block for P. */
3964 live_string_p (m
, p
)
3968 if (m
->type
== MEM_TYPE_STRING
)
3970 struct string_block
*b
= (struct string_block
*) m
->start
;
3971 int offset
= (char *) p
- (char *) &b
->strings
[0];
3973 /* P must point to the start of a Lisp_String structure, and it
3974 must not be on the free-list. */
3976 && offset
% sizeof b
->strings
[0] == 0
3977 && offset
< (STRING_BLOCK_SIZE
* sizeof b
->strings
[0])
3978 && ((struct Lisp_String
*) p
)->data
!= NULL
);
3985 /* Value is non-zero if P is a pointer to a live Lisp cons on
3986 the heap. M is a pointer to the mem_block for P. */
3993 if (m
->type
== MEM_TYPE_CONS
)
3995 struct cons_block
*b
= (struct cons_block
*) m
->start
;
3996 int offset
= (char *) p
- (char *) &b
->conses
[0];
3998 /* P must point to the start of a Lisp_Cons, not be
3999 one of the unused cells in the current cons block,
4000 and not be on the free-list. */
4002 && offset
% sizeof b
->conses
[0] == 0
4003 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
4005 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
4006 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
4013 /* Value is non-zero if P is a pointer to a live Lisp symbol on
4014 the heap. M is a pointer to the mem_block for P. */
4017 live_symbol_p (m
, p
)
4021 if (m
->type
== MEM_TYPE_SYMBOL
)
4023 struct symbol_block
*b
= (struct symbol_block
*) m
->start
;
4024 int offset
= (char *) p
- (char *) &b
->symbols
[0];
4026 /* P must point to the start of a Lisp_Symbol, not be
4027 one of the unused cells in the current symbol block,
4028 and not be on the free-list. */
4030 && offset
% sizeof b
->symbols
[0] == 0
4031 && offset
< (SYMBOL_BLOCK_SIZE
* sizeof b
->symbols
[0])
4032 && (b
!= symbol_block
4033 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
4034 && !EQ (((struct Lisp_Symbol
*) p
)->function
, Vdead
));
4041 /* Value is non-zero if P is a pointer to a live Lisp float on
4042 the heap. M is a pointer to the mem_block for P. */
4049 if (m
->type
== MEM_TYPE_FLOAT
)
4051 struct float_block
*b
= (struct float_block
*) m
->start
;
4052 int offset
= (char *) p
- (char *) &b
->floats
[0];
4054 /* P must point to the start of a Lisp_Float and not be
4055 one of the unused cells in the current float block. */
4057 && offset
% sizeof b
->floats
[0] == 0
4058 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
4059 && (b
!= float_block
4060 || offset
/ sizeof b
->floats
[0] < float_block_index
));
4067 /* Value is non-zero if P is a pointer to a live Lisp Misc on
4068 the heap. M is a pointer to the mem_block for P. */
4075 if (m
->type
== MEM_TYPE_MISC
)
4077 struct marker_block
*b
= (struct marker_block
*) m
->start
;
4078 int offset
= (char *) p
- (char *) &b
->markers
[0];
4080 /* P must point to the start of a Lisp_Misc, not be
4081 one of the unused cells in the current misc block,
4082 and not be on the free-list. */
4084 && offset
% sizeof b
->markers
[0] == 0
4085 && offset
< (MARKER_BLOCK_SIZE
* sizeof b
->markers
[0])
4086 && (b
!= marker_block
4087 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
4088 && ((union Lisp_Misc
*) p
)->u_marker
.type
!= Lisp_Misc_Free
);
4095 /* Value is non-zero if P is a pointer to a live vector-like object.
4096 M is a pointer to the mem_block for P. */
4099 live_vector_p (m
, p
)
4103 return (p
== m
->start
&& m
->type
== MEM_TYPE_VECTORLIKE
);
4107 /* Value is non-zero if P is a pointer to a live buffer. M is a
4108 pointer to the mem_block for P. */
4111 live_buffer_p (m
, p
)
4115 /* P must point to the start of the block, and the buffer
4116 must not have been killed. */
4117 return (m
->type
== MEM_TYPE_BUFFER
4119 && !NILP (((struct buffer
*) p
)->name
));
4122 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
4126 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4128 /* Array of objects that are kept alive because the C stack contains
4129 a pattern that looks like a reference to them . */
4131 #define MAX_ZOMBIES 10
4132 static Lisp_Object zombies
[MAX_ZOMBIES
];
4134 /* Number of zombie objects. */
4136 static int nzombies
;
4138 /* Number of garbage collections. */
4142 /* Average percentage of zombies per collection. */
4144 static double avg_zombies
;
4146 /* Max. number of live and zombie objects. */
4148 static int max_live
, max_zombies
;
4150 /* Average number of live objects per GC. */
4152 static double avg_live
;
4154 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
4155 doc
: /* Show information about live and zombie objects. */)
4158 Lisp_Object args
[8], zombie_list
= Qnil
;
4160 for (i
= 0; i
< nzombies
; i
++)
4161 zombie_list
= Fcons (zombies
[i
], zombie_list
);
4162 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
4163 args
[1] = make_number (ngcs
);
4164 args
[2] = make_float (avg_live
);
4165 args
[3] = make_float (avg_zombies
);
4166 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
4167 args
[5] = make_number (max_live
);
4168 args
[6] = make_number (max_zombies
);
4169 args
[7] = zombie_list
;
4170 return Fmessage (8, args
);
4173 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4176 /* Mark OBJ if we can prove it's a Lisp_Object. */
4179 mark_maybe_object (obj
)
4182 void *po
= (void *) XPNTR (obj
);
4183 struct mem_node
*m
= mem_find (po
);
4189 switch (XGCTYPE (obj
))
4192 mark_p
= (live_string_p (m
, po
)
4193 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
4197 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
4201 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
4205 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
4208 case Lisp_Vectorlike
:
4209 /* Note: can't check GC_BUFFERP before we know it's a
4210 buffer because checking that dereferences the pointer
4211 PO which might point anywhere. */
4212 if (live_vector_p (m
, po
))
4213 mark_p
= !GC_SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
4214 else if (live_buffer_p (m
, po
))
4215 mark_p
= GC_BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
4219 mark_p
= (live_misc_p (m
, po
) && !XMARKER (obj
)->gcmarkbit
);
4223 case Lisp_Type_Limit
:
4229 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4230 if (nzombies
< MAX_ZOMBIES
)
4231 zombies
[nzombies
] = obj
;
4240 /* If P points to Lisp data, mark that as live if it isn't already
4244 mark_maybe_pointer (p
)
4249 /* Quickly rule out some values which can't point to Lisp data. */
4252 8 /* USE_LSB_TAG needs Lisp data to be aligned on multiples of 8. */
4254 2 /* We assume that Lisp data is aligned on even addresses. */
4262 Lisp_Object obj
= Qnil
;
4266 case MEM_TYPE_NON_LISP
:
4267 /* Nothing to do; not a pointer to Lisp memory. */
4270 case MEM_TYPE_BUFFER
:
4271 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P((struct buffer
*)p
))
4272 XSETVECTOR (obj
, p
);
4276 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
4280 case MEM_TYPE_STRING
:
4281 if (live_string_p (m
, p
)
4282 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
4283 XSETSTRING (obj
, p
);
4287 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
4291 case MEM_TYPE_SYMBOL
:
4292 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
4293 XSETSYMBOL (obj
, p
);
4296 case MEM_TYPE_FLOAT
:
4297 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
4301 case MEM_TYPE_VECTORLIKE
:
4302 if (live_vector_p (m
, p
))
4305 XSETVECTOR (tem
, p
);
4306 if (!GC_SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
4321 /* Mark Lisp objects referenced from the address range START+OFFSET..END
4322 or END+OFFSET..START. */
4325 mark_memory (start
, end
, offset
)
4332 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4336 /* Make START the pointer to the start of the memory region,
4337 if it isn't already. */
4345 /* Mark Lisp_Objects. */
4346 for (p
= (Lisp_Object
*) ((char *) start
+ offset
); (void *) p
< end
; ++p
)
4347 mark_maybe_object (*p
);
4349 /* Mark Lisp data pointed to. This is necessary because, in some
4350 situations, the C compiler optimizes Lisp objects away, so that
4351 only a pointer to them remains. Example:
4353 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
4356 Lisp_Object obj = build_string ("test");
4357 struct Lisp_String *s = XSTRING (obj);
4358 Fgarbage_collect ();
4359 fprintf (stderr, "test `%s'\n", s->data);
4363 Here, `obj' isn't really used, and the compiler optimizes it
4364 away. The only reference to the life string is through the
4367 for (pp
= (void **) ((char *) start
+ offset
); (void *) pp
< end
; ++pp
)
4368 mark_maybe_pointer (*pp
);
4371 /* setjmp will work with GCC unless NON_SAVING_SETJMP is defined in
4372 the GCC system configuration. In gcc 3.2, the only systems for
4373 which this is so are i386-sco5 non-ELF, i386-sysv3 (maybe included
4374 by others?) and ns32k-pc532-min. */
4376 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
4378 static int setjmp_tested_p
, longjmps_done
;
4380 #define SETJMP_WILL_LIKELY_WORK "\
4382 Emacs garbage collector has been changed to use conservative stack\n\
4383 marking. Emacs has determined that the method it uses to do the\n\
4384 marking will likely work on your system, but this isn't sure.\n\
4386 If you are a system-programmer, or can get the help of a local wizard\n\
4387 who is, please take a look at the function mark_stack in alloc.c, and\n\
4388 verify that the methods used are appropriate for your system.\n\
4390 Please mail the result to <emacs-devel@gnu.org>.\n\
4393 #define SETJMP_WILL_NOT_WORK "\
4395 Emacs garbage collector has been changed to use conservative stack\n\
4396 marking. Emacs has determined that the default method it uses to do the\n\
4397 marking will not work on your system. We will need a system-dependent\n\
4398 solution for your system.\n\
4400 Please take a look at the function mark_stack in alloc.c, and\n\
4401 try to find a way to make it work on your system.\n\
4403 Note that you may get false negatives, depending on the compiler.\n\
4404 In particular, you need to use -O with GCC for this test.\n\
4406 Please mail the result to <emacs-devel@gnu.org>.\n\
4410 /* Perform a quick check if it looks like setjmp saves registers in a
4411 jmp_buf. Print a message to stderr saying so. When this test
4412 succeeds, this is _not_ a proof that setjmp is sufficient for
4413 conservative stack marking. Only the sources or a disassembly
4424 /* Arrange for X to be put in a register. */
4430 if (longjmps_done
== 1)
4432 /* Came here after the longjmp at the end of the function.
4434 If x == 1, the longjmp has restored the register to its
4435 value before the setjmp, and we can hope that setjmp
4436 saves all such registers in the jmp_buf, although that
4439 For other values of X, either something really strange is
4440 taking place, or the setjmp just didn't save the register. */
4443 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
4446 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
4453 if (longjmps_done
== 1)
4457 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
4460 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4462 /* Abort if anything GCPRO'd doesn't survive the GC. */
4470 for (p
= gcprolist
; p
; p
= p
->next
)
4471 for (i
= 0; i
< p
->nvars
; ++i
)
4472 if (!survives_gc_p (p
->var
[i
]))
4473 /* FIXME: It's not necessarily a bug. It might just be that the
4474 GCPRO is unnecessary or should release the object sooner. */
4478 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4485 fprintf (stderr
, "\nZombies kept alive = %d:\n", nzombies
);
4486 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
4488 fprintf (stderr
, " %d = ", i
);
4489 debug_print (zombies
[i
]);
4493 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4496 /* Mark live Lisp objects on the C stack.
4498 There are several system-dependent problems to consider when
4499 porting this to new architectures:
4503 We have to mark Lisp objects in CPU registers that can hold local
4504 variables or are used to pass parameters.
4506 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
4507 something that either saves relevant registers on the stack, or
4508 calls mark_maybe_object passing it each register's contents.
4510 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
4511 implementation assumes that calling setjmp saves registers we need
4512 to see in a jmp_buf which itself lies on the stack. This doesn't
4513 have to be true! It must be verified for each system, possibly
4514 by taking a look at the source code of setjmp.
4518 Architectures differ in the way their processor stack is organized.
4519 For example, the stack might look like this
4522 | Lisp_Object | size = 4
4524 | something else | size = 2
4526 | Lisp_Object | size = 4
4530 In such a case, not every Lisp_Object will be aligned equally. To
4531 find all Lisp_Object on the stack it won't be sufficient to walk
4532 the stack in steps of 4 bytes. Instead, two passes will be
4533 necessary, one starting at the start of the stack, and a second
4534 pass starting at the start of the stack + 2. Likewise, if the
4535 minimal alignment of Lisp_Objects on the stack is 1, four passes
4536 would be necessary, each one starting with one byte more offset
4537 from the stack start.
4539 The current code assumes by default that Lisp_Objects are aligned
4540 equally on the stack. */
4546 /* jmp_buf may not be aligned enough on darwin-ppc64 */
4547 union aligned_jmpbuf
{
4551 volatile int stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
4554 /* This trick flushes the register windows so that all the state of
4555 the process is contained in the stack. */
4556 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
4557 needed on ia64 too. See mach_dep.c, where it also says inline
4558 assembler doesn't work with relevant proprietary compilers. */
4563 /* Save registers that we need to see on the stack. We need to see
4564 registers used to hold register variables and registers used to
4566 #ifdef GC_SAVE_REGISTERS_ON_STACK
4567 GC_SAVE_REGISTERS_ON_STACK (end
);
4568 #else /* not GC_SAVE_REGISTERS_ON_STACK */
4570 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
4571 setjmp will definitely work, test it
4572 and print a message with the result
4574 if (!setjmp_tested_p
)
4576 setjmp_tested_p
= 1;
4579 #endif /* GC_SETJMP_WORKS */
4582 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
4583 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
4585 /* This assumes that the stack is a contiguous region in memory. If
4586 that's not the case, something has to be done here to iterate
4587 over the stack segments. */
4588 #ifndef GC_LISP_OBJECT_ALIGNMENT
4590 #define GC_LISP_OBJECT_ALIGNMENT __alignof__ (Lisp_Object)
4592 #define GC_LISP_OBJECT_ALIGNMENT sizeof (Lisp_Object)
4595 for (i
= 0; i
< sizeof (Lisp_Object
); i
+= GC_LISP_OBJECT_ALIGNMENT
)
4596 mark_memory (stack_base
, end
, i
);
4597 /* Allow for marking a secondary stack, like the register stack on the
4599 #ifdef GC_MARK_SECONDARY_STACK
4600 GC_MARK_SECONDARY_STACK ();
4603 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4608 #endif /* GC_MARK_STACK != 0 */
4611 /* Determine whether it is safe to access memory at address P. */
4617 return w32_valid_pointer_p (p
, 16);
4621 /* Obviously, we cannot just access it (we would SEGV trying), so we
4622 trick the o/s to tell us whether p is a valid pointer.
4623 Unfortunately, we cannot use NULL_DEVICE here, as emacs_write may
4624 not validate p in that case. */
4626 if ((fd
= emacs_open ("__Valid__Lisp__Object__", O_CREAT
| O_WRONLY
| O_TRUNC
, 0666)) >= 0)
4628 int valid
= (emacs_write (fd
, (char *)p
, 16) == 16);
4630 unlink ("__Valid__Lisp__Object__");
4638 /* Return 1 if OBJ is a valid lisp object.
4639 Return 0 if OBJ is NOT a valid lisp object.
4640 Return -1 if we cannot validate OBJ.
4641 This function can be quite slow,
4642 so it should only be used in code for manual debugging. */
4645 valid_lisp_object_p (obj
)
4656 p
= (void *) XPNTR (obj
);
4657 if (PURE_POINTER_P (p
))
4661 return valid_pointer_p (p
);
4668 int valid
= valid_pointer_p (p
);
4680 case MEM_TYPE_NON_LISP
:
4683 case MEM_TYPE_BUFFER
:
4684 return live_buffer_p (m
, p
);
4687 return live_cons_p (m
, p
);
4689 case MEM_TYPE_STRING
:
4690 return live_string_p (m
, p
);
4693 return live_misc_p (m
, p
);
4695 case MEM_TYPE_SYMBOL
:
4696 return live_symbol_p (m
, p
);
4698 case MEM_TYPE_FLOAT
:
4699 return live_float_p (m
, p
);
4701 case MEM_TYPE_VECTORLIKE
:
4702 return live_vector_p (m
, p
);
4715 /***********************************************************************
4716 Pure Storage Management
4717 ***********************************************************************/
4719 /* Allocate room for SIZE bytes from pure Lisp storage and return a
4720 pointer to it. TYPE is the Lisp type for which the memory is
4721 allocated. TYPE < 0 means it's not used for a Lisp object. */
4723 static POINTER_TYPE
*
4724 pure_alloc (size
, type
)
4728 POINTER_TYPE
*result
;
4730 size_t alignment
= (1 << GCTYPEBITS
);
4732 size_t alignment
= sizeof (EMACS_INT
);
4734 /* Give Lisp_Floats an extra alignment. */
4735 if (type
== Lisp_Float
)
4737 #if defined __GNUC__ && __GNUC__ >= 2
4738 alignment
= __alignof (struct Lisp_Float
);
4740 alignment
= sizeof (struct Lisp_Float
);
4748 /* Allocate space for a Lisp object from the beginning of the free
4749 space with taking account of alignment. */
4750 result
= ALIGN (purebeg
+ pure_bytes_used_lisp
, alignment
);
4751 pure_bytes_used_lisp
= ((char *)result
- (char *)purebeg
) + size
;
4755 /* Allocate space for a non-Lisp object from the end of the free
4757 pure_bytes_used_non_lisp
+= size
;
4758 result
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4760 pure_bytes_used
= pure_bytes_used_lisp
+ pure_bytes_used_non_lisp
;
4762 if (pure_bytes_used
<= pure_size
)
4765 /* Don't allocate a large amount here,
4766 because it might get mmap'd and then its address
4767 might not be usable. */
4768 purebeg
= (char *) xmalloc (10000);
4770 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
4771 pure_bytes_used
= 0;
4772 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
4777 /* Print a warning if PURESIZE is too small. */
4782 if (pure_bytes_used_before_overflow
)
4783 message ("emacs:0:Pure Lisp storage overflow (approx. %d bytes needed)",
4784 (int) (pure_bytes_used
+ pure_bytes_used_before_overflow
));
4788 /* Find the byte sequence {DATA[0], ..., DATA[NBYTES-1], '\0'} from
4789 the non-Lisp data pool of the pure storage, and return its start
4790 address. Return NULL if not found. */
4793 find_string_data_in_pure (data
, nbytes
)
4797 int i
, skip
, bm_skip
[256], last_char_skip
, infinity
, start
, start_max
;
4801 if (pure_bytes_used_non_lisp
< nbytes
+ 1)
4804 /* Set up the Boyer-Moore table. */
4806 for (i
= 0; i
< 256; i
++)
4809 p
= (unsigned char *) data
;
4811 bm_skip
[*p
++] = skip
;
4813 last_char_skip
= bm_skip
['\0'];
4815 non_lisp_beg
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4816 start_max
= pure_bytes_used_non_lisp
- (nbytes
+ 1);
4818 /* See the comments in the function `boyer_moore' (search.c) for the
4819 use of `infinity'. */
4820 infinity
= pure_bytes_used_non_lisp
+ 1;
4821 bm_skip
['\0'] = infinity
;
4823 p
= (unsigned char *) non_lisp_beg
+ nbytes
;
4827 /* Check the last character (== '\0'). */
4830 start
+= bm_skip
[*(p
+ start
)];
4832 while (start
<= start_max
);
4834 if (start
< infinity
)
4835 /* Couldn't find the last character. */
4838 /* No less than `infinity' means we could find the last
4839 character at `p[start - infinity]'. */
4842 /* Check the remaining characters. */
4843 if (memcmp (data
, non_lisp_beg
+ start
, nbytes
) == 0)
4845 return non_lisp_beg
+ start
;
4847 start
+= last_char_skip
;
4849 while (start
<= start_max
);
4855 /* Return a string allocated in pure space. DATA is a buffer holding
4856 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
4857 non-zero means make the result string multibyte.
4859 Must get an error if pure storage is full, since if it cannot hold
4860 a large string it may be able to hold conses that point to that
4861 string; then the string is not protected from gc. */
4864 make_pure_string (data
, nchars
, nbytes
, multibyte
)
4870 struct Lisp_String
*s
;
4872 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4873 s
->data
= find_string_data_in_pure (data
, nbytes
);
4874 if (s
->data
== NULL
)
4876 s
->data
= (unsigned char *) pure_alloc (nbytes
+ 1, -1);
4877 bcopy (data
, s
->data
, nbytes
);
4878 s
->data
[nbytes
] = '\0';
4881 s
->size_byte
= multibyte
? nbytes
: -1;
4882 s
->intervals
= NULL_INTERVAL
;
4883 XSETSTRING (string
, s
);
4888 /* Return a cons allocated from pure space. Give it pure copies
4889 of CAR as car and CDR as cdr. */
4892 pure_cons (car
, cdr
)
4893 Lisp_Object car
, cdr
;
4895 register Lisp_Object
new;
4896 struct Lisp_Cons
*p
;
4898 p
= (struct Lisp_Cons
*) pure_alloc (sizeof *p
, Lisp_Cons
);
4900 XSETCAR (new, Fpurecopy (car
));
4901 XSETCDR (new, Fpurecopy (cdr
));
4906 /* Value is a float object with value NUM allocated from pure space. */
4909 make_pure_float (num
)
4912 register Lisp_Object
new;
4913 struct Lisp_Float
*p
;
4915 p
= (struct Lisp_Float
*) pure_alloc (sizeof *p
, Lisp_Float
);
4917 XFLOAT_DATA (new) = num
;
4922 /* Return a vector with room for LEN Lisp_Objects allocated from
4926 make_pure_vector (len
)
4930 struct Lisp_Vector
*p
;
4931 size_t size
= sizeof *p
+ (len
- 1) * sizeof (Lisp_Object
);
4933 p
= (struct Lisp_Vector
*) pure_alloc (size
, Lisp_Vectorlike
);
4934 XSETVECTOR (new, p
);
4935 XVECTOR (new)->size
= len
;
4940 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
4941 doc
: /* Make a copy of object OBJ in pure storage.
4942 Recursively copies contents of vectors and cons cells.
4943 Does not copy symbols. Copies strings without text properties. */)
4945 register Lisp_Object obj
;
4947 if (NILP (Vpurify_flag
))
4950 if (PURE_POINTER_P (XPNTR (obj
)))
4954 return pure_cons (XCAR (obj
), XCDR (obj
));
4955 else if (FLOATP (obj
))
4956 return make_pure_float (XFLOAT_DATA (obj
));
4957 else if (STRINGP (obj
))
4958 return make_pure_string (SDATA (obj
), SCHARS (obj
),
4960 STRING_MULTIBYTE (obj
));
4961 else if (COMPILEDP (obj
) || VECTORP (obj
))
4963 register struct Lisp_Vector
*vec
;
4967 size
= XVECTOR (obj
)->size
;
4968 if (size
& PSEUDOVECTOR_FLAG
)
4969 size
&= PSEUDOVECTOR_SIZE_MASK
;
4970 vec
= XVECTOR (make_pure_vector (size
));
4971 for (i
= 0; i
< size
; i
++)
4972 vec
->contents
[i
] = Fpurecopy (XVECTOR (obj
)->contents
[i
]);
4973 if (COMPILEDP (obj
))
4974 XSETCOMPILED (obj
, vec
);
4976 XSETVECTOR (obj
, vec
);
4979 else if (MARKERP (obj
))
4980 error ("Attempt to copy a marker to pure storage");
4987 /***********************************************************************
4989 ***********************************************************************/
4991 /* Put an entry in staticvec, pointing at the variable with address
4995 staticpro (varaddress
)
4996 Lisp_Object
*varaddress
;
4998 staticvec
[staticidx
++] = varaddress
;
4999 if (staticidx
>= NSTATICS
)
5007 struct catchtag
*next
;
5011 /***********************************************************************
5013 ***********************************************************************/
5015 /* Temporarily prevent garbage collection. */
5018 inhibit_garbage_collection ()
5020 int count
= SPECPDL_INDEX ();
5021 int nbits
= min (VALBITS
, BITS_PER_INT
);
5023 specbind (Qgc_cons_threshold
, make_number (((EMACS_INT
) 1 << (nbits
- 1)) - 1));
5028 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
5029 doc
: /* Reclaim storage for Lisp objects no longer needed.
5030 Garbage collection happens automatically if you cons more than
5031 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
5032 `garbage-collect' normally returns a list with info on amount of space in use:
5033 ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)
5034 (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS
5035 (USED-FLOATS . FREE-FLOATS) (USED-INTERVALS . FREE-INTERVALS)
5036 (USED-STRINGS . FREE-STRINGS))
5037 However, if there was overflow in pure space, `garbage-collect'
5038 returns nil, because real GC can't be done. */)
5041 register struct specbinding
*bind
;
5042 struct catchtag
*catch;
5043 struct handler
*handler
;
5044 char stack_top_variable
;
5047 Lisp_Object total
[8];
5048 int count
= SPECPDL_INDEX ();
5049 EMACS_TIME t1
, t2
, t3
;
5054 /* Can't GC if pure storage overflowed because we can't determine
5055 if something is a pure object or not. */
5056 if (pure_bytes_used_before_overflow
)
5061 /* Don't keep undo information around forever.
5062 Do this early on, so it is no problem if the user quits. */
5064 register struct buffer
*nextb
= all_buffers
;
5068 /* If a buffer's undo list is Qt, that means that undo is
5069 turned off in that buffer. Calling truncate_undo_list on
5070 Qt tends to return NULL, which effectively turns undo back on.
5071 So don't call truncate_undo_list if undo_list is Qt. */
5072 if (! NILP (nextb
->name
) && ! EQ (nextb
->undo_list
, Qt
))
5073 truncate_undo_list (nextb
);
5075 /* Shrink buffer gaps, but skip indirect and dead buffers. */
5076 if (nextb
->base_buffer
== 0 && !NILP (nextb
->name
))
5078 /* If a buffer's gap size is more than 10% of the buffer
5079 size, or larger than 2000 bytes, then shrink it
5080 accordingly. Keep a minimum size of 20 bytes. */
5081 int size
= min (2000, max (20, (nextb
->text
->z_byte
/ 10)));
5083 if (nextb
->text
->gap_size
> size
)
5085 struct buffer
*save_current
= current_buffer
;
5086 current_buffer
= nextb
;
5087 make_gap (-(nextb
->text
->gap_size
- size
));
5088 current_buffer
= save_current
;
5092 nextb
= nextb
->next
;
5096 EMACS_GET_TIME (t1
);
5098 /* In case user calls debug_print during GC,
5099 don't let that cause a recursive GC. */
5100 consing_since_gc
= 0;
5102 /* Save what's currently displayed in the echo area. */
5103 message_p
= push_message ();
5104 record_unwind_protect (pop_message_unwind
, Qnil
);
5106 /* Save a copy of the contents of the stack, for debugging. */
5107 #if MAX_SAVE_STACK > 0
5108 if (NILP (Vpurify_flag
))
5110 i
= &stack_top_variable
- stack_bottom
;
5112 if (i
< MAX_SAVE_STACK
)
5114 if (stack_copy
== 0)
5115 stack_copy
= (char *) xmalloc (stack_copy_size
= i
);
5116 else if (stack_copy_size
< i
)
5117 stack_copy
= (char *) xrealloc (stack_copy
, (stack_copy_size
= i
));
5120 if ((EMACS_INT
) (&stack_top_variable
- stack_bottom
) > 0)
5121 bcopy (stack_bottom
, stack_copy
, i
);
5123 bcopy (&stack_top_variable
, stack_copy
, i
);
5127 #endif /* MAX_SAVE_STACK > 0 */
5129 if (garbage_collection_messages
)
5130 message1_nolog ("Garbage collecting...");
5134 shrink_regexp_cache ();
5138 /* clear_marks (); */
5140 /* Mark all the special slots that serve as the roots of accessibility. */
5142 for (i
= 0; i
< staticidx
; i
++)
5143 mark_object (*staticvec
[i
]);
5145 for (bind
= specpdl
; bind
!= specpdl_ptr
; bind
++)
5147 mark_object (bind
->symbol
);
5148 mark_object (bind
->old_value
);
5156 extern void xg_mark_data ();
5161 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
5162 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
5166 register struct gcpro
*tail
;
5167 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
5168 for (i
= 0; i
< tail
->nvars
; i
++)
5169 mark_object (tail
->var
[i
]);
5174 for (catch = catchlist
; catch; catch = catch->next
)
5176 mark_object (catch->tag
);
5177 mark_object (catch->val
);
5179 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
5181 mark_object (handler
->handler
);
5182 mark_object (handler
->var
);
5186 #ifdef HAVE_WINDOW_SYSTEM
5187 mark_fringe_data ();
5190 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5194 /* Everything is now marked, except for the things that require special
5195 finalization, i.e. the undo_list.
5196 Look thru every buffer's undo list
5197 for elements that update markers that were not marked,
5200 register struct buffer
*nextb
= all_buffers
;
5204 /* If a buffer's undo list is Qt, that means that undo is
5205 turned off in that buffer. Calling truncate_undo_list on
5206 Qt tends to return NULL, which effectively turns undo back on.
5207 So don't call truncate_undo_list if undo_list is Qt. */
5208 if (! EQ (nextb
->undo_list
, Qt
))
5210 Lisp_Object tail
, prev
;
5211 tail
= nextb
->undo_list
;
5213 while (CONSP (tail
))
5215 if (GC_CONSP (XCAR (tail
))
5216 && GC_MARKERP (XCAR (XCAR (tail
)))
5217 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
5220 nextb
->undo_list
= tail
= XCDR (tail
);
5224 XSETCDR (prev
, tail
);
5234 /* Now that we have stripped the elements that need not be in the
5235 undo_list any more, we can finally mark the list. */
5236 mark_object (nextb
->undo_list
);
5238 nextb
= nextb
->next
;
5244 /* Clear the mark bits that we set in certain root slots. */
5246 unmark_byte_stack ();
5247 VECTOR_UNMARK (&buffer_defaults
);
5248 VECTOR_UNMARK (&buffer_local_symbols
);
5250 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
5258 /* clear_marks (); */
5261 consing_since_gc
= 0;
5262 if (gc_cons_threshold
< 10000)
5263 gc_cons_threshold
= 10000;
5265 if (FLOATP (Vgc_cons_percentage
))
5266 { /* Set gc_cons_combined_threshold. */
5267 EMACS_INT total
= 0;
5269 total
+= total_conses
* sizeof (struct Lisp_Cons
);
5270 total
+= total_symbols
* sizeof (struct Lisp_Symbol
);
5271 total
+= total_markers
* sizeof (union Lisp_Misc
);
5272 total
+= total_string_size
;
5273 total
+= total_vector_size
* sizeof (Lisp_Object
);
5274 total
+= total_floats
* sizeof (struct Lisp_Float
);
5275 total
+= total_intervals
* sizeof (struct interval
);
5276 total
+= total_strings
* sizeof (struct Lisp_String
);
5278 gc_relative_threshold
= total
* XFLOAT_DATA (Vgc_cons_percentage
);
5281 gc_relative_threshold
= 0;
5283 if (garbage_collection_messages
)
5285 if (message_p
|| minibuf_level
> 0)
5288 message1_nolog ("Garbage collecting...done");
5291 unbind_to (count
, Qnil
);
5293 total
[0] = Fcons (make_number (total_conses
),
5294 make_number (total_free_conses
));
5295 total
[1] = Fcons (make_number (total_symbols
),
5296 make_number (total_free_symbols
));
5297 total
[2] = Fcons (make_number (total_markers
),
5298 make_number (total_free_markers
));
5299 total
[3] = make_number (total_string_size
);
5300 total
[4] = make_number (total_vector_size
);
5301 total
[5] = Fcons (make_number (total_floats
),
5302 make_number (total_free_floats
));
5303 total
[6] = Fcons (make_number (total_intervals
),
5304 make_number (total_free_intervals
));
5305 total
[7] = Fcons (make_number (total_strings
),
5306 make_number (total_free_strings
));
5308 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5310 /* Compute average percentage of zombies. */
5313 for (i
= 0; i
< 7; ++i
)
5314 if (CONSP (total
[i
]))
5315 nlive
+= XFASTINT (XCAR (total
[i
]));
5317 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
5318 max_live
= max (nlive
, max_live
);
5319 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
5320 max_zombies
= max (nzombies
, max_zombies
);
5325 if (!NILP (Vpost_gc_hook
))
5327 int count
= inhibit_garbage_collection ();
5328 safe_run_hooks (Qpost_gc_hook
);
5329 unbind_to (count
, Qnil
);
5332 /* Accumulate statistics. */
5333 EMACS_GET_TIME (t2
);
5334 EMACS_SUB_TIME (t3
, t2
, t1
);
5335 if (FLOATP (Vgc_elapsed
))
5336 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
) +
5338 EMACS_USECS (t3
) * 1.0e-6);
5341 return Flist (sizeof total
/ sizeof *total
, total
);
5345 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
5346 only interesting objects referenced from glyphs are strings. */
5349 mark_glyph_matrix (matrix
)
5350 struct glyph_matrix
*matrix
;
5352 struct glyph_row
*row
= matrix
->rows
;
5353 struct glyph_row
*end
= row
+ matrix
->nrows
;
5355 for (; row
< end
; ++row
)
5359 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
5361 struct glyph
*glyph
= row
->glyphs
[area
];
5362 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
5364 for (; glyph
< end_glyph
; ++glyph
)
5365 if (GC_STRINGP (glyph
->object
)
5366 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
5367 mark_object (glyph
->object
);
5373 /* Mark Lisp faces in the face cache C. */
5377 struct face_cache
*c
;
5382 for (i
= 0; i
< c
->used
; ++i
)
5384 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
5388 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
5389 mark_object (face
->lface
[j
]);
5396 #ifdef HAVE_WINDOW_SYSTEM
5398 /* Mark Lisp objects in image IMG. */
5404 mark_object (img
->spec
);
5406 if (!NILP (img
->data
.lisp_val
))
5407 mark_object (img
->data
.lisp_val
);
5411 /* Mark Lisp objects in image cache of frame F. It's done this way so
5412 that we don't have to include xterm.h here. */
5415 mark_image_cache (f
)
5418 forall_images_in_image_cache (f
, mark_image
);
5421 #endif /* HAVE_X_WINDOWS */
5425 /* Mark reference to a Lisp_Object.
5426 If the object referred to has not been seen yet, recursively mark
5427 all the references contained in it. */
5429 #define LAST_MARKED_SIZE 500
5430 Lisp_Object last_marked
[LAST_MARKED_SIZE
];
5431 int last_marked_index
;
5433 /* For debugging--call abort when we cdr down this many
5434 links of a list, in mark_object. In debugging,
5435 the call to abort will hit a breakpoint.
5436 Normally this is zero and the check never goes off. */
5437 int mark_object_loop_halt
;
5439 /* Return non-zero if the object was not yet marked. */
5441 mark_vectorlike (ptr
)
5442 struct Lisp_Vector
*ptr
;
5444 register EMACS_INT size
= ptr
->size
;
5447 if (VECTOR_MARKED_P (ptr
))
5448 return 0; /* Already marked */
5449 VECTOR_MARK (ptr
); /* Else mark it */
5450 if (size
& PSEUDOVECTOR_FLAG
)
5451 size
&= PSEUDOVECTOR_SIZE_MASK
;
5453 /* Note that this size is not the memory-footprint size, but only
5454 the number of Lisp_Object fields that we should trace.
5455 The distinction is used e.g. by Lisp_Process which places extra
5456 non-Lisp_Object fields at the end of the structure. */
5457 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5458 mark_object (ptr
->contents
[i
]);
5466 register Lisp_Object obj
= arg
;
5467 #ifdef GC_CHECK_MARKED_OBJECTS
5475 if (PURE_POINTER_P (XPNTR (obj
)))
5478 last_marked
[last_marked_index
++] = obj
;
5479 if (last_marked_index
== LAST_MARKED_SIZE
)
5480 last_marked_index
= 0;
5482 /* Perform some sanity checks on the objects marked here. Abort if
5483 we encounter an object we know is bogus. This increases GC time
5484 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
5485 #ifdef GC_CHECK_MARKED_OBJECTS
5487 po
= (void *) XPNTR (obj
);
5489 /* Check that the object pointed to by PO is known to be a Lisp
5490 structure allocated from the heap. */
5491 #define CHECK_ALLOCATED() \
5493 m = mem_find (po); \
5498 /* Check that the object pointed to by PO is live, using predicate
5500 #define CHECK_LIVE(LIVEP) \
5502 if (!LIVEP (m, po)) \
5506 /* Check both of the above conditions. */
5507 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
5509 CHECK_ALLOCATED (); \
5510 CHECK_LIVE (LIVEP); \
5513 #else /* not GC_CHECK_MARKED_OBJECTS */
5515 #define CHECK_ALLOCATED() (void) 0
5516 #define CHECK_LIVE(LIVEP) (void) 0
5517 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
5519 #endif /* not GC_CHECK_MARKED_OBJECTS */
5521 switch (SWITCH_ENUM_CAST (XGCTYPE (obj
)))
5525 register struct Lisp_String
*ptr
= XSTRING (obj
);
5526 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
5527 MARK_INTERVAL_TREE (ptr
->intervals
);
5529 #ifdef GC_CHECK_STRING_BYTES
5530 /* Check that the string size recorded in the string is the
5531 same as the one recorded in the sdata structure. */
5532 CHECK_STRING_BYTES (ptr
);
5533 #endif /* GC_CHECK_STRING_BYTES */
5537 case Lisp_Vectorlike
:
5538 #ifdef GC_CHECK_MARKED_OBJECTS
5540 if (m
== MEM_NIL
&& !GC_SUBRP (obj
)
5541 && po
!= &buffer_defaults
5542 && po
!= &buffer_local_symbols
)
5544 #endif /* GC_CHECK_MARKED_OBJECTS */
5546 if (GC_BUFFERP (obj
))
5548 if (!VECTOR_MARKED_P (XBUFFER (obj
)))
5550 #ifdef GC_CHECK_MARKED_OBJECTS
5551 if (po
!= &buffer_defaults
&& po
!= &buffer_local_symbols
)
5554 for (b
= all_buffers
; b
&& b
!= po
; b
= b
->next
)
5559 #endif /* GC_CHECK_MARKED_OBJECTS */
5563 else if (GC_SUBRP (obj
))
5565 else if (GC_COMPILEDP (obj
))
5566 /* We could treat this just like a vector, but it is better to
5567 save the COMPILED_CONSTANTS element for last and avoid
5570 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5571 register EMACS_INT size
= ptr
->size
;
5574 if (VECTOR_MARKED_P (ptr
))
5575 break; /* Already marked */
5577 CHECK_LIVE (live_vector_p
);
5578 VECTOR_MARK (ptr
); /* Else mark it */
5579 size
&= PSEUDOVECTOR_SIZE_MASK
;
5580 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5582 if (i
!= COMPILED_CONSTANTS
)
5583 mark_object (ptr
->contents
[i
]);
5585 obj
= ptr
->contents
[COMPILED_CONSTANTS
];
5588 else if (GC_FRAMEP (obj
))
5590 register struct frame
*ptr
= XFRAME (obj
);
5591 if (mark_vectorlike (XVECTOR (obj
)))
5593 mark_face_cache (ptr
->face_cache
);
5594 #ifdef HAVE_WINDOW_SYSTEM
5595 mark_image_cache (ptr
);
5596 #endif /* HAVE_WINDOW_SYSTEM */
5599 else if (GC_WINDOWP (obj
))
5601 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5602 struct window
*w
= XWINDOW (obj
);
5603 if (mark_vectorlike (ptr
))
5605 /* Mark glyphs for leaf windows. Marking window matrices is
5606 sufficient because frame matrices use the same glyph
5608 if (NILP (w
->hchild
)
5610 && w
->current_matrix
)
5612 mark_glyph_matrix (w
->current_matrix
);
5613 mark_glyph_matrix (w
->desired_matrix
);
5616 else if (GC_HASH_TABLE_P (obj
))
5618 struct Lisp_Hash_Table
*h
= XHASH_TABLE (obj
);
5620 /* Stop if already marked. */
5621 if (VECTOR_MARKED_P (h
))
5625 CHECK_LIVE (live_vector_p
);
5628 /* Mark contents. */
5629 /* Do not mark next_free or next_weak.
5630 Being in the next_weak chain
5631 should not keep the hash table alive.
5632 No need to mark `count' since it is an integer. */
5633 mark_object (h
->test
);
5634 mark_object (h
->weak
);
5635 mark_object (h
->rehash_size
);
5636 mark_object (h
->rehash_threshold
);
5637 mark_object (h
->hash
);
5638 mark_object (h
->next
);
5639 mark_object (h
->index
);
5640 mark_object (h
->user_hash_function
);
5641 mark_object (h
->user_cmp_function
);
5643 /* If hash table is not weak, mark all keys and values.
5644 For weak tables, mark only the vector. */
5645 if (GC_NILP (h
->weak
))
5646 mark_object (h
->key_and_value
);
5648 VECTOR_MARK (XVECTOR (h
->key_and_value
));
5652 mark_vectorlike (XVECTOR (obj
));
5657 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
5658 struct Lisp_Symbol
*ptrx
;
5660 if (ptr
->gcmarkbit
) break;
5661 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
5663 mark_object (ptr
->value
);
5664 mark_object (ptr
->function
);
5665 mark_object (ptr
->plist
);
5667 if (!PURE_POINTER_P (XSTRING (ptr
->xname
)))
5668 MARK_STRING (XSTRING (ptr
->xname
));
5669 MARK_INTERVAL_TREE (STRING_INTERVALS (ptr
->xname
));
5671 /* Note that we do not mark the obarray of the symbol.
5672 It is safe not to do so because nothing accesses that
5673 slot except to check whether it is nil. */
5677 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun */
5678 XSETSYMBOL (obj
, ptrx
);
5685 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
5686 if (XMARKER (obj
)->gcmarkbit
)
5688 XMARKER (obj
)->gcmarkbit
= 1;
5690 switch (XMISCTYPE (obj
))
5692 case Lisp_Misc_Buffer_Local_Value
:
5693 case Lisp_Misc_Some_Buffer_Local_Value
:
5695 register struct Lisp_Buffer_Local_Value
*ptr
5696 = XBUFFER_LOCAL_VALUE (obj
);
5697 /* If the cdr is nil, avoid recursion for the car. */
5698 if (EQ (ptr
->cdr
, Qnil
))
5700 obj
= ptr
->realvalue
;
5703 mark_object (ptr
->realvalue
);
5704 mark_object (ptr
->buffer
);
5705 mark_object (ptr
->frame
);
5710 case Lisp_Misc_Marker
:
5711 /* DO NOT mark thru the marker's chain.
5712 The buffer's markers chain does not preserve markers from gc;
5713 instead, markers are removed from the chain when freed by gc. */
5716 case Lisp_Misc_Intfwd
:
5717 case Lisp_Misc_Boolfwd
:
5718 case Lisp_Misc_Objfwd
:
5719 case Lisp_Misc_Buffer_Objfwd
:
5720 case Lisp_Misc_Kboard_Objfwd
:
5721 /* Don't bother with Lisp_Buffer_Objfwd,
5722 since all markable slots in current buffer marked anyway. */
5723 /* Don't need to do Lisp_Objfwd, since the places they point
5724 are protected with staticpro. */
5727 case Lisp_Misc_Save_Value
:
5730 register struct Lisp_Save_Value
*ptr
= XSAVE_VALUE (obj
);
5731 /* If DOGC is set, POINTER is the address of a memory
5732 area containing INTEGER potential Lisp_Objects. */
5735 Lisp_Object
*p
= (Lisp_Object
*) ptr
->pointer
;
5737 for (nelt
= ptr
->integer
; nelt
> 0; nelt
--, p
++)
5738 mark_maybe_object (*p
);
5744 case Lisp_Misc_Overlay
:
5746 struct Lisp_Overlay
*ptr
= XOVERLAY (obj
);
5747 mark_object (ptr
->start
);
5748 mark_object (ptr
->end
);
5749 mark_object (ptr
->plist
);
5752 XSETMISC (obj
, ptr
->next
);
5765 register struct Lisp_Cons
*ptr
= XCONS (obj
);
5766 if (CONS_MARKED_P (ptr
)) break;
5767 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
5769 /* If the cdr is nil, avoid recursion for the car. */
5770 if (EQ (ptr
->u
.cdr
, Qnil
))
5776 mark_object (ptr
->car
);
5779 if (cdr_count
== mark_object_loop_halt
)
5785 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
5786 FLOAT_MARK (XFLOAT (obj
));
5797 #undef CHECK_ALLOCATED
5798 #undef CHECK_ALLOCATED_AND_LIVE
5801 /* Mark the pointers in a buffer structure. */
5807 register struct buffer
*buffer
= XBUFFER (buf
);
5808 register Lisp_Object
*ptr
, tmp
;
5809 Lisp_Object base_buffer
;
5811 VECTOR_MARK (buffer
);
5813 MARK_INTERVAL_TREE (BUF_INTERVALS (buffer
));
5815 /* For now, we just don't mark the undo_list. It's done later in
5816 a special way just before the sweep phase, and after stripping
5817 some of its elements that are not needed any more. */
5819 if (buffer
->overlays_before
)
5821 XSETMISC (tmp
, buffer
->overlays_before
);
5824 if (buffer
->overlays_after
)
5826 XSETMISC (tmp
, buffer
->overlays_after
);
5830 for (ptr
= &buffer
->name
;
5831 (char *)ptr
< (char *)buffer
+ sizeof (struct buffer
);
5835 /* If this is an indirect buffer, mark its base buffer. */
5836 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
5838 XSETBUFFER (base_buffer
, buffer
->base_buffer
);
5839 mark_buffer (base_buffer
);
5843 /* Mark the Lisp pointers in the terminal objects.
5844 Called by the Fgarbage_collector. */
5847 mark_terminals (void)
5850 for (t
= terminal_list
; t
; t
= t
->next_terminal
)
5852 eassert (t
->name
!= NULL
);
5853 mark_vectorlike ((struct Lisp_Vector
*)tmp
);
5859 /* Value is non-zero if OBJ will survive the current GC because it's
5860 either marked or does not need to be marked to survive. */
5868 switch (XGCTYPE (obj
))
5875 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
5879 survives_p
= XMARKER (obj
)->gcmarkbit
;
5883 survives_p
= STRING_MARKED_P (XSTRING (obj
));
5886 case Lisp_Vectorlike
:
5887 survives_p
= GC_SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
5891 survives_p
= CONS_MARKED_P (XCONS (obj
));
5895 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
5902 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
5907 /* Sweep: find all structures not marked, and free them. */
5912 /* Remove or mark entries in weak hash tables.
5913 This must be done before any object is unmarked. */
5914 sweep_weak_hash_tables ();
5917 #ifdef GC_CHECK_STRING_BYTES
5918 if (!noninteractive
)
5919 check_string_bytes (1);
5922 /* Put all unmarked conses on free list */
5924 register struct cons_block
*cblk
;
5925 struct cons_block
**cprev
= &cons_block
;
5926 register int lim
= cons_block_index
;
5927 register int num_free
= 0, num_used
= 0;
5931 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
5935 int ilim
= (lim
+ BITS_PER_INT
- 1) / BITS_PER_INT
;
5937 /* Scan the mark bits an int at a time. */
5938 for (i
= 0; i
<= ilim
; i
++)
5940 if (cblk
->gcmarkbits
[i
] == -1)
5942 /* Fast path - all cons cells for this int are marked. */
5943 cblk
->gcmarkbits
[i
] = 0;
5944 num_used
+= BITS_PER_INT
;
5948 /* Some cons cells for this int are not marked.
5949 Find which ones, and free them. */
5950 int start
, pos
, stop
;
5952 start
= i
* BITS_PER_INT
;
5954 if (stop
> BITS_PER_INT
)
5955 stop
= BITS_PER_INT
;
5958 for (pos
= start
; pos
< stop
; pos
++)
5960 if (!CONS_MARKED_P (&cblk
->conses
[pos
]))
5963 cblk
->conses
[pos
].u
.chain
= cons_free_list
;
5964 cons_free_list
= &cblk
->conses
[pos
];
5966 cons_free_list
->car
= Vdead
;
5972 CONS_UNMARK (&cblk
->conses
[pos
]);
5978 lim
= CONS_BLOCK_SIZE
;
5979 /* If this block contains only free conses and we have already
5980 seen more than two blocks worth of free conses then deallocate
5982 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
5984 *cprev
= cblk
->next
;
5985 /* Unhook from the free list. */
5986 cons_free_list
= cblk
->conses
[0].u
.chain
;
5987 lisp_align_free (cblk
);
5992 num_free
+= this_free
;
5993 cprev
= &cblk
->next
;
5996 total_conses
= num_used
;
5997 total_free_conses
= num_free
;
6000 /* Put all unmarked floats on free list */
6002 register struct float_block
*fblk
;
6003 struct float_block
**fprev
= &float_block
;
6004 register int lim
= float_block_index
;
6005 register int num_free
= 0, num_used
= 0;
6007 float_free_list
= 0;
6009 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
6013 for (i
= 0; i
< lim
; i
++)
6014 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
6017 fblk
->floats
[i
].u
.chain
= float_free_list
;
6018 float_free_list
= &fblk
->floats
[i
];
6023 FLOAT_UNMARK (&fblk
->floats
[i
]);
6025 lim
= FLOAT_BLOCK_SIZE
;
6026 /* If this block contains only free floats and we have already
6027 seen more than two blocks worth of free floats then deallocate
6029 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
6031 *fprev
= fblk
->next
;
6032 /* Unhook from the free list. */
6033 float_free_list
= fblk
->floats
[0].u
.chain
;
6034 lisp_align_free (fblk
);
6039 num_free
+= this_free
;
6040 fprev
= &fblk
->next
;
6043 total_floats
= num_used
;
6044 total_free_floats
= num_free
;
6047 /* Put all unmarked intervals on free list */
6049 register struct interval_block
*iblk
;
6050 struct interval_block
**iprev
= &interval_block
;
6051 register int lim
= interval_block_index
;
6052 register int num_free
= 0, num_used
= 0;
6054 interval_free_list
= 0;
6056 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
6061 for (i
= 0; i
< lim
; i
++)
6063 if (!iblk
->intervals
[i
].gcmarkbit
)
6065 SET_INTERVAL_PARENT (&iblk
->intervals
[i
], interval_free_list
);
6066 interval_free_list
= &iblk
->intervals
[i
];
6072 iblk
->intervals
[i
].gcmarkbit
= 0;
6075 lim
= INTERVAL_BLOCK_SIZE
;
6076 /* If this block contains only free intervals and we have already
6077 seen more than two blocks worth of free intervals then
6078 deallocate this block. */
6079 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
6081 *iprev
= iblk
->next
;
6082 /* Unhook from the free list. */
6083 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
6085 n_interval_blocks
--;
6089 num_free
+= this_free
;
6090 iprev
= &iblk
->next
;
6093 total_intervals
= num_used
;
6094 total_free_intervals
= num_free
;
6097 /* Put all unmarked symbols on free list */
6099 register struct symbol_block
*sblk
;
6100 struct symbol_block
**sprev
= &symbol_block
;
6101 register int lim
= symbol_block_index
;
6102 register int num_free
= 0, num_used
= 0;
6104 symbol_free_list
= NULL
;
6106 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
6109 struct Lisp_Symbol
*sym
= sblk
->symbols
;
6110 struct Lisp_Symbol
*end
= sym
+ lim
;
6112 for (; sym
< end
; ++sym
)
6114 /* Check if the symbol was created during loadup. In such a case
6115 it might be pointed to by pure bytecode which we don't trace,
6116 so we conservatively assume that it is live. */
6117 int pure_p
= PURE_POINTER_P (XSTRING (sym
->xname
));
6119 if (!sym
->gcmarkbit
&& !pure_p
)
6121 sym
->next
= symbol_free_list
;
6122 symbol_free_list
= sym
;
6124 symbol_free_list
->function
= Vdead
;
6132 UNMARK_STRING (XSTRING (sym
->xname
));
6137 lim
= SYMBOL_BLOCK_SIZE
;
6138 /* If this block contains only free symbols and we have already
6139 seen more than two blocks worth of free symbols then deallocate
6141 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
6143 *sprev
= sblk
->next
;
6144 /* Unhook from the free list. */
6145 symbol_free_list
= sblk
->symbols
[0].next
;
6151 num_free
+= this_free
;
6152 sprev
= &sblk
->next
;
6155 total_symbols
= num_used
;
6156 total_free_symbols
= num_free
;
6159 /* Put all unmarked misc's on free list.
6160 For a marker, first unchain it from the buffer it points into. */
6162 register struct marker_block
*mblk
;
6163 struct marker_block
**mprev
= &marker_block
;
6164 register int lim
= marker_block_index
;
6165 register int num_free
= 0, num_used
= 0;
6167 marker_free_list
= 0;
6169 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
6174 for (i
= 0; i
< lim
; i
++)
6176 if (!mblk
->markers
[i
].u_marker
.gcmarkbit
)
6178 if (mblk
->markers
[i
].u_marker
.type
== Lisp_Misc_Marker
)
6179 unchain_marker (&mblk
->markers
[i
].u_marker
);
6180 /* Set the type of the freed object to Lisp_Misc_Free.
6181 We could leave the type alone, since nobody checks it,
6182 but this might catch bugs faster. */
6183 mblk
->markers
[i
].u_marker
.type
= Lisp_Misc_Free
;
6184 mblk
->markers
[i
].u_free
.chain
= marker_free_list
;
6185 marker_free_list
= &mblk
->markers
[i
];
6191 mblk
->markers
[i
].u_marker
.gcmarkbit
= 0;
6194 lim
= MARKER_BLOCK_SIZE
;
6195 /* If this block contains only free markers and we have already
6196 seen more than two blocks worth of free markers then deallocate
6198 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
6200 *mprev
= mblk
->next
;
6201 /* Unhook from the free list. */
6202 marker_free_list
= mblk
->markers
[0].u_free
.chain
;
6208 num_free
+= this_free
;
6209 mprev
= &mblk
->next
;
6213 total_markers
= num_used
;
6214 total_free_markers
= num_free
;
6217 /* Free all unmarked buffers */
6219 register struct buffer
*buffer
= all_buffers
, *prev
= 0, *next
;
6222 if (!VECTOR_MARKED_P (buffer
))
6225 prev
->next
= buffer
->next
;
6227 all_buffers
= buffer
->next
;
6228 next
= buffer
->next
;
6234 VECTOR_UNMARK (buffer
);
6235 UNMARK_BALANCE_INTERVALS (BUF_INTERVALS (buffer
));
6236 prev
= buffer
, buffer
= buffer
->next
;
6240 /* Free all unmarked vectors */
6242 register struct Lisp_Vector
*vector
= all_vectors
, *prev
= 0, *next
;
6243 total_vector_size
= 0;
6246 if (!VECTOR_MARKED_P (vector
))
6249 prev
->next
= vector
->next
;
6251 all_vectors
= vector
->next
;
6252 next
= vector
->next
;
6260 VECTOR_UNMARK (vector
);
6261 if (vector
->size
& PSEUDOVECTOR_FLAG
)
6262 total_vector_size
+= (PSEUDOVECTOR_SIZE_MASK
& vector
->size
);
6264 total_vector_size
+= vector
->size
;
6265 prev
= vector
, vector
= vector
->next
;
6269 #ifdef GC_CHECK_STRING_BYTES
6270 if (!noninteractive
)
6271 check_string_bytes (1);
6278 /* Debugging aids. */
6280 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
6281 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
6282 This may be helpful in debugging Emacs's memory usage.
6283 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
6288 XSETINT (end
, (EMACS_INT
) sbrk (0) / 1024);
6293 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
6294 doc
: /* Return a list of counters that measure how much consing there has been.
6295 Each of these counters increments for a certain kind of object.
6296 The counters wrap around from the largest positive integer to zero.
6297 Garbage collection does not decrease them.
6298 The elements of the value are as follows:
6299 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
6300 All are in units of 1 = one object consed
6301 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
6303 MISCS include overlays, markers, and some internal types.
6304 Frames, windows, buffers, and subprocesses count as vectors
6305 (but the contents of a buffer's text do not count here). */)
6308 Lisp_Object consed
[8];
6310 consed
[0] = make_number (min (MOST_POSITIVE_FIXNUM
, cons_cells_consed
));
6311 consed
[1] = make_number (min (MOST_POSITIVE_FIXNUM
, floats_consed
));
6312 consed
[2] = make_number (min (MOST_POSITIVE_FIXNUM
, vector_cells_consed
));
6313 consed
[3] = make_number (min (MOST_POSITIVE_FIXNUM
, symbols_consed
));
6314 consed
[4] = make_number (min (MOST_POSITIVE_FIXNUM
, string_chars_consed
));
6315 consed
[5] = make_number (min (MOST_POSITIVE_FIXNUM
, misc_objects_consed
));
6316 consed
[6] = make_number (min (MOST_POSITIVE_FIXNUM
, intervals_consed
));
6317 consed
[7] = make_number (min (MOST_POSITIVE_FIXNUM
, strings_consed
));
6319 return Flist (8, consed
);
6322 int suppress_checking
;
6324 die (msg
, file
, line
)
6329 fprintf (stderr
, "\r\nEmacs fatal error: %s:%d: %s\r\n",
6334 /* Initialization */
6339 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
6341 pure_size
= PURESIZE
;
6342 pure_bytes_used
= 0;
6343 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
6344 pure_bytes_used_before_overflow
= 0;
6346 /* Initialize the list of free aligned blocks. */
6349 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
6351 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
6355 ignore_warnings
= 1;
6356 #ifdef DOUG_LEA_MALLOC
6357 mallopt (M_TRIM_THRESHOLD
, 128*1024); /* trim threshold */
6358 mallopt (M_MMAP_THRESHOLD
, 64*1024); /* mmap threshold */
6359 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* max. number of mmap'ed areas */
6369 malloc_hysteresis
= 32;
6371 malloc_hysteresis
= 0;
6374 refill_memory_reserve ();
6376 ignore_warnings
= 0;
6378 byte_stack_list
= 0;
6380 consing_since_gc
= 0;
6381 gc_cons_threshold
= 100000 * sizeof (Lisp_Object
);
6382 gc_relative_threshold
= 0;
6384 #ifdef VIRT_ADDR_VARIES
6385 malloc_sbrk_unused
= 1<<22; /* A large number */
6386 malloc_sbrk_used
= 100000; /* as reasonable as any number */
6387 #endif /* VIRT_ADDR_VARIES */
6394 byte_stack_list
= 0;
6396 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
6397 setjmp_tested_p
= longjmps_done
= 0;
6400 Vgc_elapsed
= make_float (0.0);
6407 DEFVAR_INT ("gc-cons-threshold", &gc_cons_threshold
,
6408 doc
: /* *Number of bytes of consing between garbage collections.
6409 Garbage collection can happen automatically once this many bytes have been
6410 allocated since the last garbage collection. All data types count.
6412 Garbage collection happens automatically only when `eval' is called.
6414 By binding this temporarily to a large number, you can effectively
6415 prevent garbage collection during a part of the program.
6416 See also `gc-cons-percentage'. */);
6418 DEFVAR_LISP ("gc-cons-percentage", &Vgc_cons_percentage
,
6419 doc
: /* *Portion of the heap used for allocation.
6420 Garbage collection can happen automatically once this portion of the heap
6421 has been allocated since the last garbage collection.
6422 If this portion is smaller than `gc-cons-threshold', this is ignored. */);
6423 Vgc_cons_percentage
= make_float (0.1);
6425 DEFVAR_INT ("pure-bytes-used", &pure_bytes_used
,
6426 doc
: /* Number of bytes of sharable Lisp data allocated so far. */);
6428 DEFVAR_INT ("cons-cells-consed", &cons_cells_consed
,
6429 doc
: /* Number of cons cells that have been consed so far. */);
6431 DEFVAR_INT ("floats-consed", &floats_consed
,
6432 doc
: /* Number of floats that have been consed so far. */);
6434 DEFVAR_INT ("vector-cells-consed", &vector_cells_consed
,
6435 doc
: /* Number of vector cells that have been consed so far. */);
6437 DEFVAR_INT ("symbols-consed", &symbols_consed
,
6438 doc
: /* Number of symbols that have been consed so far. */);
6440 DEFVAR_INT ("string-chars-consed", &string_chars_consed
,
6441 doc
: /* Number of string characters that have been consed so far. */);
6443 DEFVAR_INT ("misc-objects-consed", &misc_objects_consed
,
6444 doc
: /* Number of miscellaneous objects that have been consed so far. */);
6446 DEFVAR_INT ("intervals-consed", &intervals_consed
,
6447 doc
: /* Number of intervals that have been consed so far. */);
6449 DEFVAR_INT ("strings-consed", &strings_consed
,
6450 doc
: /* Number of strings that have been consed so far. */);
6452 DEFVAR_LISP ("purify-flag", &Vpurify_flag
,
6453 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
6454 This means that certain objects should be allocated in shared (pure) space. */);
6456 DEFVAR_BOOL ("garbage-collection-messages", &garbage_collection_messages
,
6457 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
6458 garbage_collection_messages
= 0;
6460 DEFVAR_LISP ("post-gc-hook", &Vpost_gc_hook
,
6461 doc
: /* Hook run after garbage collection has finished. */);
6462 Vpost_gc_hook
= Qnil
;
6463 Qpost_gc_hook
= intern ("post-gc-hook");
6464 staticpro (&Qpost_gc_hook
);
6466 DEFVAR_LISP ("memory-signal-data", &Vmemory_signal_data
,
6467 doc
: /* Precomputed `signal' argument for memory-full error. */);
6468 /* We build this in advance because if we wait until we need it, we might
6469 not be able to allocate the memory to hold it. */
6472 build_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"));
6474 DEFVAR_LISP ("memory-full", &Vmemory_full
,
6475 doc
: /* Non-nil means Emacs cannot get much more Lisp memory. */);
6476 Vmemory_full
= Qnil
;
6478 staticpro (&Qgc_cons_threshold
);
6479 Qgc_cons_threshold
= intern ("gc-cons-threshold");
6481 staticpro (&Qchar_table_extra_slots
);
6482 Qchar_table_extra_slots
= intern ("char-table-extra-slots");
6484 DEFVAR_LISP ("gc-elapsed", &Vgc_elapsed
,
6485 doc
: /* Accumulated time elapsed in garbage collections.
6486 The time is in seconds as a floating point value. */);
6487 DEFVAR_INT ("gcs-done", &gcs_done
,
6488 doc
: /* Accumulated number of garbage collections done. */);
6493 defsubr (&Smake_byte_code
);
6494 defsubr (&Smake_list
);
6495 defsubr (&Smake_vector
);
6496 defsubr (&Smake_char_table
);
6497 defsubr (&Smake_string
);
6498 defsubr (&Smake_bool_vector
);
6499 defsubr (&Smake_symbol
);
6500 defsubr (&Smake_marker
);
6501 defsubr (&Spurecopy
);
6502 defsubr (&Sgarbage_collect
);
6503 defsubr (&Smemory_limit
);
6504 defsubr (&Smemory_use_counts
);
6506 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
6507 defsubr (&Sgc_status
);
6511 /* arch-tag: 6695ca10-e3c5-4c2c-8bc3-ed26a7dda857
6512 (do not change this comment) */