1 /* Storage allocation and gc for GNU Emacs Lisp interpreter.
2 Copyright (C) 1985, 1986, 1988, 1993, 1994, 1995, 1997, 1998, 1999,
3 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
4 Free Software Foundation, Inc.
6 This file is part of GNU Emacs.
8 GNU Emacs is free software: you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation, either version 3 of the License, or
11 (at your option) any later version.
13 GNU Emacs is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GNU Emacs. If not, see <http://www.gnu.org/licenses/>. */
23 #include <limits.h> /* For CHAR_BIT. */
27 #include <stddef.h> /* For offsetof, used by PSEUDOVECSIZE. */
36 #ifdef HAVE_GTK_AND_PTHREAD
40 /* This file is part of the core Lisp implementation, and thus must
41 deal with the real data structures. If the Lisp implementation is
42 replaced, this file likely will not be used. */
44 #undef HIDE_LISP_IMPLEMENTATION
47 #include "intervals.h"
53 #include "blockinput.h"
54 #include "character.h"
55 #include "syssignal.h"
56 #include "termhooks.h" /* For struct terminal. */
59 /* GC_MALLOC_CHECK defined means perform validity checks of malloc'd
60 memory. Can do this only if using gmalloc.c. */
62 #if defined SYSTEM_MALLOC || defined DOUG_LEA_MALLOC
63 #undef GC_MALLOC_CHECK
69 extern POINTER_TYPE
*sbrk ();
84 #ifdef DOUG_LEA_MALLOC
87 /* malloc.h #defines this as size_t, at least in glibc2. */
88 #ifndef __malloc_size_t
89 #define __malloc_size_t int
92 /* Specify maximum number of areas to mmap. It would be nice to use a
93 value that explicitly means "no limit". */
95 #define MMAP_MAX_AREAS 100000000
97 #else /* not DOUG_LEA_MALLOC */
99 /* The following come from gmalloc.c. */
101 #define __malloc_size_t size_t
102 extern __malloc_size_t _bytes_used
;
103 extern __malloc_size_t __malloc_extra_blocks
;
105 #endif /* not DOUG_LEA_MALLOC */
107 #if ! defined (SYSTEM_MALLOC) && defined (HAVE_GTK_AND_PTHREAD)
109 /* When GTK uses the file chooser dialog, different backends can be loaded
110 dynamically. One such a backend is the Gnome VFS backend that gets loaded
111 if you run Gnome. That backend creates several threads and also allocates
114 If Emacs sets malloc hooks (! SYSTEM_MALLOC) and the emacs_blocked_*
115 functions below are called from malloc, there is a chance that one
116 of these threads preempts the Emacs main thread and the hook variables
117 end up in an inconsistent state. So we have a mutex to prevent that (note
118 that the backend handles concurrent access to malloc within its own threads
119 but Emacs code running in the main thread is not included in that control).
121 When UNBLOCK_INPUT is called, reinvoke_input_signal may be called. If this
122 happens in one of the backend threads we will have two threads that tries
123 to run Emacs code at once, and the code is not prepared for that.
124 To prevent that, we only call BLOCK/UNBLOCK from the main thread. */
126 static pthread_mutex_t alloc_mutex
;
128 #define BLOCK_INPUT_ALLOC \
131 if (pthread_equal (pthread_self (), main_thread)) \
133 pthread_mutex_lock (&alloc_mutex); \
136 #define UNBLOCK_INPUT_ALLOC \
139 pthread_mutex_unlock (&alloc_mutex); \
140 if (pthread_equal (pthread_self (), main_thread)) \
145 #else /* SYSTEM_MALLOC || not HAVE_GTK_AND_PTHREAD */
147 #define BLOCK_INPUT_ALLOC BLOCK_INPUT
148 #define UNBLOCK_INPUT_ALLOC UNBLOCK_INPUT
150 #endif /* SYSTEM_MALLOC || not HAVE_GTK_AND_PTHREAD */
152 /* Value of _bytes_used, when spare_memory was freed. */
154 static __malloc_size_t bytes_used_when_full
;
156 static __malloc_size_t bytes_used_when_reconsidered
;
158 /* Mark, unmark, query mark bit of a Lisp string. S must be a pointer
159 to a struct Lisp_String. */
161 #define MARK_STRING(S) ((S)->size |= ARRAY_MARK_FLAG)
162 #define UNMARK_STRING(S) ((S)->size &= ~ARRAY_MARK_FLAG)
163 #define STRING_MARKED_P(S) (((S)->size & ARRAY_MARK_FLAG) != 0)
165 #define VECTOR_MARK(V) ((V)->size |= ARRAY_MARK_FLAG)
166 #define VECTOR_UNMARK(V) ((V)->size &= ~ARRAY_MARK_FLAG)
167 #define VECTOR_MARKED_P(V) (((V)->size & ARRAY_MARK_FLAG) != 0)
169 /* Value is the number of bytes/chars of S, a pointer to a struct
170 Lisp_String. This must be used instead of STRING_BYTES (S) or
171 S->size during GC, because S->size contains the mark bit for
174 #define GC_STRING_BYTES(S) (STRING_BYTES (S))
175 #define GC_STRING_CHARS(S) ((S)->size & ~ARRAY_MARK_FLAG)
177 /* Number of bytes of consing done since the last gc. */
179 int consing_since_gc
;
181 /* Count the amount of consing of various sorts of space. */
183 EMACS_INT cons_cells_consed
;
184 EMACS_INT floats_consed
;
185 EMACS_INT vector_cells_consed
;
186 EMACS_INT symbols_consed
;
187 EMACS_INT string_chars_consed
;
188 EMACS_INT misc_objects_consed
;
189 EMACS_INT intervals_consed
;
190 EMACS_INT strings_consed
;
192 /* Minimum number of bytes of consing since GC before next GC. */
194 EMACS_INT gc_cons_threshold
;
196 /* Similar minimum, computed from Vgc_cons_percentage. */
198 EMACS_INT gc_relative_threshold
;
200 static Lisp_Object Vgc_cons_percentage
;
202 /* Minimum number of bytes of consing since GC before next GC,
203 when memory is full. */
205 EMACS_INT memory_full_cons_threshold
;
207 /* Nonzero during GC. */
211 /* Nonzero means abort if try to GC.
212 This is for code which is written on the assumption that
213 no GC will happen, so as to verify that assumption. */
217 /* Nonzero means display messages at beginning and end of GC. */
219 int garbage_collection_messages
;
221 #ifndef VIRT_ADDR_VARIES
223 #endif /* VIRT_ADDR_VARIES */
224 int malloc_sbrk_used
;
226 #ifndef VIRT_ADDR_VARIES
228 #endif /* VIRT_ADDR_VARIES */
229 int malloc_sbrk_unused
;
231 /* Number of live and free conses etc. */
233 static int total_conses
, total_markers
, total_symbols
, total_vector_size
;
234 static int total_free_conses
, total_free_markers
, total_free_symbols
;
235 static int total_free_floats
, total_floats
;
237 /* Points to memory space allocated as "spare", to be freed if we run
238 out of memory. We keep one large block, four cons-blocks, and
239 two string blocks. */
241 static char *spare_memory
[7];
243 /* Amount of spare memory to keep in large reserve block. */
245 #define SPARE_MEMORY (1 << 14)
247 /* Number of extra blocks malloc should get when it needs more core. */
249 static int malloc_hysteresis
;
251 /* Non-nil means defun should do purecopy on the function definition. */
253 Lisp_Object Vpurify_flag
;
255 /* Non-nil means we are handling a memory-full error. */
257 Lisp_Object Vmemory_full
;
259 /* Initialize it to a nonzero value to force it into data space
260 (rather than bss space). That way unexec will remap it into text
261 space (pure), on some systems. We have not implemented the
262 remapping on more recent systems because this is less important
263 nowadays than in the days of small memories and timesharing. */
265 EMACS_INT pure
[(PURESIZE
+ sizeof (EMACS_INT
) - 1) / sizeof (EMACS_INT
)] = {1,};
266 #define PUREBEG (char *) pure
268 /* Pointer to the pure area, and its size. */
270 static char *purebeg
;
271 static size_t pure_size
;
273 /* Number of bytes of pure storage used before pure storage overflowed.
274 If this is non-zero, this implies that an overflow occurred. */
276 static size_t pure_bytes_used_before_overflow
;
278 /* Value is non-zero if P points into pure space. */
280 #define PURE_POINTER_P(P) \
281 (((PNTR_COMPARISON_TYPE) (P) \
282 < (PNTR_COMPARISON_TYPE) ((char *) purebeg + pure_size)) \
283 && ((PNTR_COMPARISON_TYPE) (P) \
284 >= (PNTR_COMPARISON_TYPE) purebeg))
286 /* Total number of bytes allocated in pure storage. */
288 EMACS_INT pure_bytes_used
;
290 /* Index in pure at which next pure Lisp object will be allocated.. */
292 static EMACS_INT pure_bytes_used_lisp
;
294 /* Number of bytes allocated for non-Lisp objects in pure storage. */
296 static EMACS_INT pure_bytes_used_non_lisp
;
298 /* If nonzero, this is a warning delivered by malloc and not yet
301 char *pending_malloc_warning
;
303 /* Pre-computed signal argument for use when memory is exhausted. */
305 Lisp_Object Vmemory_signal_data
;
307 /* Maximum amount of C stack to save when a GC happens. */
309 #ifndef MAX_SAVE_STACK
310 #define MAX_SAVE_STACK 16000
313 /* Buffer in which we save a copy of the C stack at each GC. */
315 static char *stack_copy
;
316 static int stack_copy_size
;
318 /* Non-zero means ignore malloc warnings. Set during initialization.
319 Currently not used. */
321 static int ignore_warnings
;
323 Lisp_Object Qgc_cons_threshold
, Qchar_table_extra_slots
;
325 /* Hook run after GC has finished. */
327 Lisp_Object Vpost_gc_hook
, Qpost_gc_hook
;
329 Lisp_Object Vgc_elapsed
; /* accumulated elapsed time in GC */
330 EMACS_INT gcs_done
; /* accumulated GCs */
332 static void mark_buffer
P_ ((Lisp_Object
));
333 static void mark_terminals
P_ ((void));
334 extern void mark_kboards
P_ ((void));
335 extern void mark_ttys
P_ ((void));
336 extern void mark_backtrace
P_ ((void));
337 static void gc_sweep
P_ ((void));
338 static void mark_glyph_matrix
P_ ((struct glyph_matrix
*));
339 static void mark_face_cache
P_ ((struct face_cache
*));
341 #ifdef HAVE_WINDOW_SYSTEM
342 extern void mark_fringe_data
P_ ((void));
343 #endif /* HAVE_WINDOW_SYSTEM */
345 static struct Lisp_String
*allocate_string
P_ ((void));
346 static void compact_small_strings
P_ ((void));
347 static void free_large_strings
P_ ((void));
348 static void sweep_strings
P_ ((void));
350 extern int message_enable_multibyte
;
352 /* When scanning the C stack for live Lisp objects, Emacs keeps track
353 of what memory allocated via lisp_malloc is intended for what
354 purpose. This enumeration specifies the type of memory. */
365 /* We used to keep separate mem_types for subtypes of vectors such as
366 process, hash_table, frame, terminal, and window, but we never made
367 use of the distinction, so it only caused source-code complexity
368 and runtime slowdown. Minor but pointless. */
372 static POINTER_TYPE
*lisp_align_malloc
P_ ((size_t, enum mem_type
));
373 static POINTER_TYPE
*lisp_malloc
P_ ((size_t, enum mem_type
));
374 void refill_memory_reserve ();
377 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
379 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
380 #include <stdio.h> /* For fprintf. */
383 /* A unique object in pure space used to make some Lisp objects
384 on free lists recognizable in O(1). */
386 static Lisp_Object Vdead
;
388 #ifdef GC_MALLOC_CHECK
390 enum mem_type allocated_mem_type
;
391 static int dont_register_blocks
;
393 #endif /* GC_MALLOC_CHECK */
395 /* A node in the red-black tree describing allocated memory containing
396 Lisp data. Each such block is recorded with its start and end
397 address when it is allocated, and removed from the tree when it
400 A red-black tree is a balanced binary tree with the following
403 1. Every node is either red or black.
404 2. Every leaf is black.
405 3. If a node is red, then both of its children are black.
406 4. Every simple path from a node to a descendant leaf contains
407 the same number of black nodes.
408 5. The root is always black.
410 When nodes are inserted into the tree, or deleted from the tree,
411 the tree is "fixed" so that these properties are always true.
413 A red-black tree with N internal nodes has height at most 2
414 log(N+1). Searches, insertions and deletions are done in O(log N).
415 Please see a text book about data structures for a detailed
416 description of red-black trees. Any book worth its salt should
421 /* Children of this node. These pointers are never NULL. When there
422 is no child, the value is MEM_NIL, which points to a dummy node. */
423 struct mem_node
*left
, *right
;
425 /* The parent of this node. In the root node, this is NULL. */
426 struct mem_node
*parent
;
428 /* Start and end of allocated region. */
432 enum {MEM_BLACK
, MEM_RED
} color
;
438 /* Base address of stack. Set in main. */
440 Lisp_Object
*stack_base
;
442 /* Root of the tree describing allocated Lisp memory. */
444 static struct mem_node
*mem_root
;
446 /* Lowest and highest known address in the heap. */
448 static void *min_heap_address
, *max_heap_address
;
450 /* Sentinel node of the tree. */
452 static struct mem_node mem_z
;
453 #define MEM_NIL &mem_z
455 static POINTER_TYPE
*lisp_malloc
P_ ((size_t, enum mem_type
));
456 static struct Lisp_Vector
*allocate_vectorlike
P_ ((EMACS_INT
));
457 static void lisp_free
P_ ((POINTER_TYPE
*));
458 static void mark_stack
P_ ((void));
459 static int live_vector_p
P_ ((struct mem_node
*, void *));
460 static int live_buffer_p
P_ ((struct mem_node
*, void *));
461 static int live_string_p
P_ ((struct mem_node
*, void *));
462 static int live_cons_p
P_ ((struct mem_node
*, void *));
463 static int live_symbol_p
P_ ((struct mem_node
*, void *));
464 static int live_float_p
P_ ((struct mem_node
*, void *));
465 static int live_misc_p
P_ ((struct mem_node
*, void *));
466 static void mark_maybe_object
P_ ((Lisp_Object
));
467 static void mark_memory
P_ ((void *, void *, int));
468 static void mem_init
P_ ((void));
469 static struct mem_node
*mem_insert
P_ ((void *, void *, enum mem_type
));
470 static void mem_insert_fixup
P_ ((struct mem_node
*));
471 static void mem_rotate_left
P_ ((struct mem_node
*));
472 static void mem_rotate_right
P_ ((struct mem_node
*));
473 static void mem_delete
P_ ((struct mem_node
*));
474 static void mem_delete_fixup
P_ ((struct mem_node
*));
475 static INLINE
struct mem_node
*mem_find
P_ ((void *));
478 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
479 static void check_gcpros
P_ ((void));
482 #endif /* GC_MARK_STACK || GC_MALLOC_CHECK */
484 /* Recording what needs to be marked for gc. */
486 struct gcpro
*gcprolist
;
488 /* Addresses of staticpro'd variables. Initialize it to a nonzero
489 value; otherwise some compilers put it into BSS. */
491 #define NSTATICS 0x640
492 static Lisp_Object
*staticvec
[NSTATICS
] = {&Vpurify_flag
};
494 /* Index of next unused slot in staticvec. */
496 static int staticidx
= 0;
498 static POINTER_TYPE
*pure_alloc
P_ ((size_t, int));
501 /* Value is SZ rounded up to the next multiple of ALIGNMENT.
502 ALIGNMENT must be a power of 2. */
504 #define ALIGN(ptr, ALIGNMENT) \
505 ((POINTER_TYPE *) ((((EMACS_UINT)(ptr)) + (ALIGNMENT) - 1) \
506 & ~((ALIGNMENT) - 1)))
510 /************************************************************************
512 ************************************************************************/
514 /* Function malloc calls this if it finds we are near exhausting storage. */
520 pending_malloc_warning
= str
;
524 /* Display an already-pending malloc warning. */
527 display_malloc_warning ()
529 call3 (intern ("display-warning"),
531 build_string (pending_malloc_warning
),
532 intern ("emergency"));
533 pending_malloc_warning
= 0;
537 #ifdef DOUG_LEA_MALLOC
538 # define BYTES_USED (mallinfo ().uordblks)
540 # define BYTES_USED _bytes_used
543 /* Called if we can't allocate relocatable space for a buffer. */
546 buffer_memory_full ()
548 /* If buffers use the relocating allocator, no need to free
549 spare_memory, because we may have plenty of malloc space left
550 that we could get, and if we don't, the malloc that fails will
551 itself cause spare_memory to be freed. If buffers don't use the
552 relocating allocator, treat this like any other failing
559 /* This used to call error, but if we've run out of memory, we could
560 get infinite recursion trying to build the string. */
561 xsignal (Qnil
, Vmemory_signal_data
);
565 #ifdef XMALLOC_OVERRUN_CHECK
567 /* Check for overrun in malloc'ed buffers by wrapping a 16 byte header
568 and a 16 byte trailer around each block.
570 The header consists of 12 fixed bytes + a 4 byte integer contaning the
571 original block size, while the trailer consists of 16 fixed bytes.
573 The header is used to detect whether this block has been allocated
574 through these functions -- as it seems that some low-level libc
575 functions may bypass the malloc hooks.
579 #define XMALLOC_OVERRUN_CHECK_SIZE 16
581 static char xmalloc_overrun_check_header
[XMALLOC_OVERRUN_CHECK_SIZE
-4] =
582 { 0x9a, 0x9b, 0xae, 0xaf,
583 0xbf, 0xbe, 0xce, 0xcf,
584 0xea, 0xeb, 0xec, 0xed };
586 static char xmalloc_overrun_check_trailer
[XMALLOC_OVERRUN_CHECK_SIZE
] =
587 { 0xaa, 0xab, 0xac, 0xad,
588 0xba, 0xbb, 0xbc, 0xbd,
589 0xca, 0xcb, 0xcc, 0xcd,
590 0xda, 0xdb, 0xdc, 0xdd };
592 /* Macros to insert and extract the block size in the header. */
594 #define XMALLOC_PUT_SIZE(ptr, size) \
595 (ptr[-1] = (size & 0xff), \
596 ptr[-2] = ((size >> 8) & 0xff), \
597 ptr[-3] = ((size >> 16) & 0xff), \
598 ptr[-4] = ((size >> 24) & 0xff))
600 #define XMALLOC_GET_SIZE(ptr) \
601 (size_t)((unsigned)(ptr[-1]) | \
602 ((unsigned)(ptr[-2]) << 8) | \
603 ((unsigned)(ptr[-3]) << 16) | \
604 ((unsigned)(ptr[-4]) << 24))
607 /* The call depth in overrun_check functions. For example, this might happen:
609 overrun_check_malloc()
610 -> malloc -> (via hook)_-> emacs_blocked_malloc
611 -> overrun_check_malloc
612 call malloc (hooks are NULL, so real malloc is called).
613 malloc returns 10000.
614 add overhead, return 10016.
615 <- (back in overrun_check_malloc)
616 add overhead again, return 10032
617 xmalloc returns 10032.
622 overrun_check_free(10032)
624 free(10016) <- crash, because 10000 is the original pointer. */
626 static int check_depth
;
628 /* Like malloc, but wraps allocated block with header and trailer. */
631 overrun_check_malloc (size
)
634 register unsigned char *val
;
635 size_t overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_SIZE
*2 : 0;
637 val
= (unsigned char *) malloc (size
+ overhead
);
638 if (val
&& check_depth
== 1)
640 bcopy (xmalloc_overrun_check_header
, val
, XMALLOC_OVERRUN_CHECK_SIZE
- 4);
641 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
642 XMALLOC_PUT_SIZE(val
, size
);
643 bcopy (xmalloc_overrun_check_trailer
, val
+ size
, XMALLOC_OVERRUN_CHECK_SIZE
);
646 return (POINTER_TYPE
*)val
;
650 /* Like realloc, but checks old block for overrun, and wraps new block
651 with header and trailer. */
654 overrun_check_realloc (block
, size
)
658 register unsigned char *val
= (unsigned char *)block
;
659 size_t overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_SIZE
*2 : 0;
663 && bcmp (xmalloc_overrun_check_header
,
664 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
665 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
667 size_t osize
= XMALLOC_GET_SIZE (val
);
668 if (bcmp (xmalloc_overrun_check_trailer
,
670 XMALLOC_OVERRUN_CHECK_SIZE
))
672 bzero (val
+ osize
, XMALLOC_OVERRUN_CHECK_SIZE
);
673 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
674 bzero (val
, XMALLOC_OVERRUN_CHECK_SIZE
);
677 val
= (unsigned char *) realloc ((POINTER_TYPE
*)val
, size
+ overhead
);
679 if (val
&& check_depth
== 1)
681 bcopy (xmalloc_overrun_check_header
, val
, XMALLOC_OVERRUN_CHECK_SIZE
- 4);
682 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
683 XMALLOC_PUT_SIZE(val
, size
);
684 bcopy (xmalloc_overrun_check_trailer
, val
+ size
, XMALLOC_OVERRUN_CHECK_SIZE
);
687 return (POINTER_TYPE
*)val
;
690 /* Like free, but checks block for overrun. */
693 overrun_check_free (block
)
696 unsigned char *val
= (unsigned char *)block
;
701 && bcmp (xmalloc_overrun_check_header
,
702 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
703 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
705 size_t osize
= XMALLOC_GET_SIZE (val
);
706 if (bcmp (xmalloc_overrun_check_trailer
,
708 XMALLOC_OVERRUN_CHECK_SIZE
))
710 #ifdef XMALLOC_CLEAR_FREE_MEMORY
711 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
712 memset (val
, 0xff, osize
+ XMALLOC_OVERRUN_CHECK_SIZE
*2);
714 bzero (val
+ osize
, XMALLOC_OVERRUN_CHECK_SIZE
);
715 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
716 bzero (val
, XMALLOC_OVERRUN_CHECK_SIZE
);
727 #define malloc overrun_check_malloc
728 #define realloc overrun_check_realloc
729 #define free overrun_check_free
733 /* When using SYNC_INPUT, we don't call malloc from a signal handler, so
734 there's no need to block input around malloc. */
735 #define MALLOC_BLOCK_INPUT ((void)0)
736 #define MALLOC_UNBLOCK_INPUT ((void)0)
738 #define MALLOC_BLOCK_INPUT BLOCK_INPUT
739 #define MALLOC_UNBLOCK_INPUT UNBLOCK_INPUT
742 /* Like malloc but check for no memory and block interrupt input.. */
748 register POINTER_TYPE
*val
;
751 val
= (POINTER_TYPE
*) malloc (size
);
752 MALLOC_UNBLOCK_INPUT
;
760 /* Like realloc but check for no memory and block interrupt input.. */
763 xrealloc (block
, size
)
767 register POINTER_TYPE
*val
;
770 /* We must call malloc explicitly when BLOCK is 0, since some
771 reallocs don't do this. */
773 val
= (POINTER_TYPE
*) malloc (size
);
775 val
= (POINTER_TYPE
*) realloc (block
, size
);
776 MALLOC_UNBLOCK_INPUT
;
778 if (!val
&& size
) memory_full ();
783 /* Like free but block interrupt input. */
793 MALLOC_UNBLOCK_INPUT
;
794 /* We don't call refill_memory_reserve here
795 because that duplicates doing so in emacs_blocked_free
796 and the criterion should go there. */
800 /* Like strdup, but uses xmalloc. */
806 size_t len
= strlen (s
) + 1;
807 char *p
= (char *) xmalloc (len
);
813 /* Unwind for SAFE_ALLOCA */
816 safe_alloca_unwind (arg
)
819 register struct Lisp_Save_Value
*p
= XSAVE_VALUE (arg
);
829 /* Like malloc but used for allocating Lisp data. NBYTES is the
830 number of bytes to allocate, TYPE describes the intended use of the
831 allcated memory block (for strings, for conses, ...). */
834 static void *lisp_malloc_loser
;
837 static POINTER_TYPE
*
838 lisp_malloc (nbytes
, type
)
846 #ifdef GC_MALLOC_CHECK
847 allocated_mem_type
= type
;
850 val
= (void *) malloc (nbytes
);
853 /* If the memory just allocated cannot be addressed thru a Lisp
854 object's pointer, and it needs to be,
855 that's equivalent to running out of memory. */
856 if (val
&& type
!= MEM_TYPE_NON_LISP
)
859 XSETCONS (tem
, (char *) val
+ nbytes
- 1);
860 if ((char *) XCONS (tem
) != (char *) val
+ nbytes
- 1)
862 lisp_malloc_loser
= val
;
869 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
870 if (val
&& type
!= MEM_TYPE_NON_LISP
)
871 mem_insert (val
, (char *) val
+ nbytes
, type
);
874 MALLOC_UNBLOCK_INPUT
;
880 /* Free BLOCK. This must be called to free memory allocated with a
881 call to lisp_malloc. */
889 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
890 mem_delete (mem_find (block
));
892 MALLOC_UNBLOCK_INPUT
;
895 /* Allocation of aligned blocks of memory to store Lisp data. */
896 /* The entry point is lisp_align_malloc which returns blocks of at most */
897 /* BLOCK_BYTES and guarantees they are aligned on a BLOCK_ALIGN boundary. */
899 /* Use posix_memalloc if the system has it and we're using the system's
900 malloc (because our gmalloc.c routines don't have posix_memalign although
901 its memalloc could be used). */
902 #if defined (HAVE_POSIX_MEMALIGN) && defined (SYSTEM_MALLOC)
903 #define USE_POSIX_MEMALIGN 1
906 /* BLOCK_ALIGN has to be a power of 2. */
907 #define BLOCK_ALIGN (1 << 10)
909 /* Padding to leave at the end of a malloc'd block. This is to give
910 malloc a chance to minimize the amount of memory wasted to alignment.
911 It should be tuned to the particular malloc library used.
912 On glibc-2.3.2, malloc never tries to align, so a padding of 0 is best.
913 posix_memalign on the other hand would ideally prefer a value of 4
914 because otherwise, there's 1020 bytes wasted between each ablocks.
915 In Emacs, testing shows that those 1020 can most of the time be
916 efficiently used by malloc to place other objects, so a value of 0 can
917 still preferable unless you have a lot of aligned blocks and virtually
919 #define BLOCK_PADDING 0
920 #define BLOCK_BYTES \
921 (BLOCK_ALIGN - sizeof (struct ablock *) - BLOCK_PADDING)
923 /* Internal data structures and constants. */
925 #define ABLOCKS_SIZE 16
927 /* An aligned block of memory. */
932 char payload
[BLOCK_BYTES
];
933 struct ablock
*next_free
;
935 /* `abase' is the aligned base of the ablocks. */
936 /* It is overloaded to hold the virtual `busy' field that counts
937 the number of used ablock in the parent ablocks.
938 The first ablock has the `busy' field, the others have the `abase'
939 field. To tell the difference, we assume that pointers will have
940 integer values larger than 2 * ABLOCKS_SIZE. The lowest bit of `busy'
941 is used to tell whether the real base of the parent ablocks is `abase'
942 (if not, the word before the first ablock holds a pointer to the
944 struct ablocks
*abase
;
945 /* The padding of all but the last ablock is unused. The padding of
946 the last ablock in an ablocks is not allocated. */
948 char padding
[BLOCK_PADDING
];
952 /* A bunch of consecutive aligned blocks. */
955 struct ablock blocks
[ABLOCKS_SIZE
];
958 /* Size of the block requested from malloc or memalign. */
959 #define ABLOCKS_BYTES (sizeof (struct ablocks) - BLOCK_PADDING)
961 #define ABLOCK_ABASE(block) \
962 (((unsigned long) (block)->abase) <= (1 + 2 * ABLOCKS_SIZE) \
963 ? (struct ablocks *)(block) \
966 /* Virtual `busy' field. */
967 #define ABLOCKS_BUSY(abase) ((abase)->blocks[0].abase)
969 /* Pointer to the (not necessarily aligned) malloc block. */
970 #ifdef USE_POSIX_MEMALIGN
971 #define ABLOCKS_BASE(abase) (abase)
973 #define ABLOCKS_BASE(abase) \
974 (1 & (long) ABLOCKS_BUSY (abase) ? abase : ((void**)abase)[-1])
977 /* The list of free ablock. */
978 static struct ablock
*free_ablock
;
980 /* Allocate an aligned block of nbytes.
981 Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be
982 smaller or equal to BLOCK_BYTES. */
983 static POINTER_TYPE
*
984 lisp_align_malloc (nbytes
, type
)
989 struct ablocks
*abase
;
991 eassert (nbytes
<= BLOCK_BYTES
);
995 #ifdef GC_MALLOC_CHECK
996 allocated_mem_type
= type
;
1002 EMACS_INT aligned
; /* int gets warning casting to 64-bit pointer. */
1004 #ifdef DOUG_LEA_MALLOC
1005 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1006 because mapped region contents are not preserved in
1008 mallopt (M_MMAP_MAX
, 0);
1011 #ifdef USE_POSIX_MEMALIGN
1013 int err
= posix_memalign (&base
, BLOCK_ALIGN
, ABLOCKS_BYTES
);
1019 base
= malloc (ABLOCKS_BYTES
);
1020 abase
= ALIGN (base
, BLOCK_ALIGN
);
1025 MALLOC_UNBLOCK_INPUT
;
1029 aligned
= (base
== abase
);
1031 ((void**)abase
)[-1] = base
;
1033 #ifdef DOUG_LEA_MALLOC
1034 /* Back to a reasonable maximum of mmap'ed areas. */
1035 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1039 /* If the memory just allocated cannot be addressed thru a Lisp
1040 object's pointer, and it needs to be, that's equivalent to
1041 running out of memory. */
1042 if (type
!= MEM_TYPE_NON_LISP
)
1045 char *end
= (char *) base
+ ABLOCKS_BYTES
- 1;
1046 XSETCONS (tem
, end
);
1047 if ((char *) XCONS (tem
) != end
)
1049 lisp_malloc_loser
= base
;
1051 MALLOC_UNBLOCK_INPUT
;
1057 /* Initialize the blocks and put them on the free list.
1058 Is `base' was not properly aligned, we can't use the last block. */
1059 for (i
= 0; i
< (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1); i
++)
1061 abase
->blocks
[i
].abase
= abase
;
1062 abase
->blocks
[i
].x
.next_free
= free_ablock
;
1063 free_ablock
= &abase
->blocks
[i
];
1065 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (long) aligned
;
1067 eassert (0 == ((EMACS_UINT
)abase
) % BLOCK_ALIGN
);
1068 eassert (ABLOCK_ABASE (&abase
->blocks
[3]) == abase
); /* 3 is arbitrary */
1069 eassert (ABLOCK_ABASE (&abase
->blocks
[0]) == abase
);
1070 eassert (ABLOCKS_BASE (abase
) == base
);
1071 eassert (aligned
== (long) ABLOCKS_BUSY (abase
));
1074 abase
= ABLOCK_ABASE (free_ablock
);
1075 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (2 + (long) ABLOCKS_BUSY (abase
));
1077 free_ablock
= free_ablock
->x
.next_free
;
1079 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1080 if (val
&& type
!= MEM_TYPE_NON_LISP
)
1081 mem_insert (val
, (char *) val
+ nbytes
, type
);
1084 MALLOC_UNBLOCK_INPUT
;
1088 eassert (0 == ((EMACS_UINT
)val
) % BLOCK_ALIGN
);
1093 lisp_align_free (block
)
1094 POINTER_TYPE
*block
;
1096 struct ablock
*ablock
= block
;
1097 struct ablocks
*abase
= ABLOCK_ABASE (ablock
);
1100 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1101 mem_delete (mem_find (block
));
1103 /* Put on free list. */
1104 ablock
->x
.next_free
= free_ablock
;
1105 free_ablock
= ablock
;
1106 /* Update busy count. */
1107 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (-2 + (long) ABLOCKS_BUSY (abase
));
1109 if (2 > (long) ABLOCKS_BUSY (abase
))
1110 { /* All the blocks are free. */
1111 int i
= 0, aligned
= (long) ABLOCKS_BUSY (abase
);
1112 struct ablock
**tem
= &free_ablock
;
1113 struct ablock
*atop
= &abase
->blocks
[aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1];
1117 if (*tem
>= (struct ablock
*) abase
&& *tem
< atop
)
1120 *tem
= (*tem
)->x
.next_free
;
1123 tem
= &(*tem
)->x
.next_free
;
1125 eassert ((aligned
& 1) == aligned
);
1126 eassert (i
== (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1));
1127 #ifdef USE_POSIX_MEMALIGN
1128 eassert ((unsigned long)ABLOCKS_BASE (abase
) % BLOCK_ALIGN
== 0);
1130 free (ABLOCKS_BASE (abase
));
1132 MALLOC_UNBLOCK_INPUT
;
1135 /* Return a new buffer structure allocated from the heap with
1136 a call to lisp_malloc. */
1142 = (struct buffer
*) lisp_malloc (sizeof (struct buffer
),
1144 b
->size
= sizeof (struct buffer
) / sizeof (EMACS_INT
);
1145 XSETPVECTYPE (b
, PVEC_BUFFER
);
1150 #ifndef SYSTEM_MALLOC
1152 /* Arranging to disable input signals while we're in malloc.
1154 This only works with GNU malloc. To help out systems which can't
1155 use GNU malloc, all the calls to malloc, realloc, and free
1156 elsewhere in the code should be inside a BLOCK_INPUT/UNBLOCK_INPUT
1157 pair; unfortunately, we have no idea what C library functions
1158 might call malloc, so we can't really protect them unless you're
1159 using GNU malloc. Fortunately, most of the major operating systems
1160 can use GNU malloc. */
1163 /* When using SYNC_INPUT, we don't call malloc from a signal handler, so
1164 there's no need to block input around malloc. */
1166 #ifndef DOUG_LEA_MALLOC
1167 extern void * (*__malloc_hook
) P_ ((size_t, const void *));
1168 extern void * (*__realloc_hook
) P_ ((void *, size_t, const void *));
1169 extern void (*__free_hook
) P_ ((void *, const void *));
1170 /* Else declared in malloc.h, perhaps with an extra arg. */
1171 #endif /* DOUG_LEA_MALLOC */
1172 static void * (*old_malloc_hook
) P_ ((size_t, const void *));
1173 static void * (*old_realloc_hook
) P_ ((void *, size_t, const void*));
1174 static void (*old_free_hook
) P_ ((void*, const void*));
1176 /* This function is used as the hook for free to call. */
1179 emacs_blocked_free (ptr
, ptr2
)
1185 #ifdef GC_MALLOC_CHECK
1191 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1194 "Freeing `%p' which wasn't allocated with malloc\n", ptr
);
1199 /* fprintf (stderr, "free %p...%p (%p)\n", m->start, m->end, ptr); */
1203 #endif /* GC_MALLOC_CHECK */
1205 __free_hook
= old_free_hook
;
1208 /* If we released our reserve (due to running out of memory),
1209 and we have a fair amount free once again,
1210 try to set aside another reserve in case we run out once more. */
1211 if (! NILP (Vmemory_full
)
1212 /* Verify there is enough space that even with the malloc
1213 hysteresis this call won't run out again.
1214 The code here is correct as long as SPARE_MEMORY
1215 is substantially larger than the block size malloc uses. */
1216 && (bytes_used_when_full
1217 > ((bytes_used_when_reconsidered
= BYTES_USED
)
1218 + max (malloc_hysteresis
, 4) * SPARE_MEMORY
)))
1219 refill_memory_reserve ();
1221 __free_hook
= emacs_blocked_free
;
1222 UNBLOCK_INPUT_ALLOC
;
1226 /* This function is the malloc hook that Emacs uses. */
1229 emacs_blocked_malloc (size
, ptr
)
1236 __malloc_hook
= old_malloc_hook
;
1237 #ifdef DOUG_LEA_MALLOC
1238 /* Segfaults on my system. --lorentey */
1239 /* mallopt (M_TOP_PAD, malloc_hysteresis * 4096); */
1241 __malloc_extra_blocks
= malloc_hysteresis
;
1244 value
= (void *) malloc (size
);
1246 #ifdef GC_MALLOC_CHECK
1248 struct mem_node
*m
= mem_find (value
);
1251 fprintf (stderr
, "Malloc returned %p which is already in use\n",
1253 fprintf (stderr
, "Region in use is %p...%p, %u bytes, type %d\n",
1254 m
->start
, m
->end
, (char *) m
->end
- (char *) m
->start
,
1259 if (!dont_register_blocks
)
1261 mem_insert (value
, (char *) value
+ max (1, size
), allocated_mem_type
);
1262 allocated_mem_type
= MEM_TYPE_NON_LISP
;
1265 #endif /* GC_MALLOC_CHECK */
1267 __malloc_hook
= emacs_blocked_malloc
;
1268 UNBLOCK_INPUT_ALLOC
;
1270 /* fprintf (stderr, "%p malloc\n", value); */
1275 /* This function is the realloc hook that Emacs uses. */
1278 emacs_blocked_realloc (ptr
, size
, ptr2
)
1286 __realloc_hook
= old_realloc_hook
;
1288 #ifdef GC_MALLOC_CHECK
1291 struct mem_node
*m
= mem_find (ptr
);
1292 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1295 "Realloc of %p which wasn't allocated with malloc\n",
1303 /* fprintf (stderr, "%p -> realloc\n", ptr); */
1305 /* Prevent malloc from registering blocks. */
1306 dont_register_blocks
= 1;
1307 #endif /* GC_MALLOC_CHECK */
1309 value
= (void *) realloc (ptr
, size
);
1311 #ifdef GC_MALLOC_CHECK
1312 dont_register_blocks
= 0;
1315 struct mem_node
*m
= mem_find (value
);
1318 fprintf (stderr
, "Realloc returns memory that is already in use\n");
1322 /* Can't handle zero size regions in the red-black tree. */
1323 mem_insert (value
, (char *) value
+ max (size
, 1), MEM_TYPE_NON_LISP
);
1326 /* fprintf (stderr, "%p <- realloc\n", value); */
1327 #endif /* GC_MALLOC_CHECK */
1329 __realloc_hook
= emacs_blocked_realloc
;
1330 UNBLOCK_INPUT_ALLOC
;
1336 #ifdef HAVE_GTK_AND_PTHREAD
1337 /* Called from Fdump_emacs so that when the dumped Emacs starts, it has a
1338 normal malloc. Some thread implementations need this as they call
1339 malloc before main. The pthread_self call in BLOCK_INPUT_ALLOC then
1340 calls malloc because it is the first call, and we have an endless loop. */
1343 reset_malloc_hooks ()
1345 __free_hook
= old_free_hook
;
1346 __malloc_hook
= old_malloc_hook
;
1347 __realloc_hook
= old_realloc_hook
;
1349 #endif /* HAVE_GTK_AND_PTHREAD */
1352 /* Called from main to set up malloc to use our hooks. */
1355 uninterrupt_malloc ()
1357 #ifdef HAVE_GTK_AND_PTHREAD
1358 #ifdef DOUG_LEA_MALLOC
1359 pthread_mutexattr_t attr
;
1361 /* GLIBC has a faster way to do this, but lets keep it portable.
1362 This is according to the Single UNIX Specification. */
1363 pthread_mutexattr_init (&attr
);
1364 pthread_mutexattr_settype (&attr
, PTHREAD_MUTEX_RECURSIVE
);
1365 pthread_mutex_init (&alloc_mutex
, &attr
);
1366 #else /* !DOUG_LEA_MALLOC */
1367 /* Some systems such as Solaris 2.6 don't have a recursive mutex,
1368 and the bundled gmalloc.c doesn't require it. */
1369 pthread_mutex_init (&alloc_mutex
, NULL
);
1370 #endif /* !DOUG_LEA_MALLOC */
1371 #endif /* HAVE_GTK_AND_PTHREAD */
1373 if (__free_hook
!= emacs_blocked_free
)
1374 old_free_hook
= __free_hook
;
1375 __free_hook
= emacs_blocked_free
;
1377 if (__malloc_hook
!= emacs_blocked_malloc
)
1378 old_malloc_hook
= __malloc_hook
;
1379 __malloc_hook
= emacs_blocked_malloc
;
1381 if (__realloc_hook
!= emacs_blocked_realloc
)
1382 old_realloc_hook
= __realloc_hook
;
1383 __realloc_hook
= emacs_blocked_realloc
;
1386 #endif /* not SYNC_INPUT */
1387 #endif /* not SYSTEM_MALLOC */
1391 /***********************************************************************
1393 ***********************************************************************/
1395 /* Number of intervals allocated in an interval_block structure.
1396 The 1020 is 1024 minus malloc overhead. */
1398 #define INTERVAL_BLOCK_SIZE \
1399 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
1401 /* Intervals are allocated in chunks in form of an interval_block
1404 struct interval_block
1406 /* Place `intervals' first, to preserve alignment. */
1407 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
1408 struct interval_block
*next
;
1411 /* Current interval block. Its `next' pointer points to older
1414 static struct interval_block
*interval_block
;
1416 /* Index in interval_block above of the next unused interval
1419 static int interval_block_index
;
1421 /* Number of free and live intervals. */
1423 static int total_free_intervals
, total_intervals
;
1425 /* List of free intervals. */
1427 INTERVAL interval_free_list
;
1429 /* Total number of interval blocks now in use. */
1431 static int n_interval_blocks
;
1434 /* Initialize interval allocation. */
1439 interval_block
= NULL
;
1440 interval_block_index
= INTERVAL_BLOCK_SIZE
;
1441 interval_free_list
= 0;
1442 n_interval_blocks
= 0;
1446 /* Return a new interval. */
1453 /* eassert (!handling_signal); */
1457 if (interval_free_list
)
1459 val
= interval_free_list
;
1460 interval_free_list
= INTERVAL_PARENT (interval_free_list
);
1464 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
1466 register struct interval_block
*newi
;
1468 newi
= (struct interval_block
*) lisp_malloc (sizeof *newi
,
1471 newi
->next
= interval_block
;
1472 interval_block
= newi
;
1473 interval_block_index
= 0;
1474 n_interval_blocks
++;
1476 val
= &interval_block
->intervals
[interval_block_index
++];
1479 MALLOC_UNBLOCK_INPUT
;
1481 consing_since_gc
+= sizeof (struct interval
);
1483 RESET_INTERVAL (val
);
1489 /* Mark Lisp objects in interval I. */
1492 mark_interval (i
, dummy
)
1493 register INTERVAL i
;
1496 eassert (!i
->gcmarkbit
); /* Intervals are never shared. */
1498 mark_object (i
->plist
);
1502 /* Mark the interval tree rooted in TREE. Don't call this directly;
1503 use the macro MARK_INTERVAL_TREE instead. */
1506 mark_interval_tree (tree
)
1507 register INTERVAL tree
;
1509 /* No need to test if this tree has been marked already; this
1510 function is always called through the MARK_INTERVAL_TREE macro,
1511 which takes care of that. */
1513 traverse_intervals_noorder (tree
, mark_interval
, Qnil
);
1517 /* Mark the interval tree rooted in I. */
1519 #define MARK_INTERVAL_TREE(i) \
1521 if (!NULL_INTERVAL_P (i) && !i->gcmarkbit) \
1522 mark_interval_tree (i); \
1526 #define UNMARK_BALANCE_INTERVALS(i) \
1528 if (! NULL_INTERVAL_P (i)) \
1529 (i) = balance_intervals (i); \
1533 /* Number support. If USE_LISP_UNION_TYPE is in effect, we
1534 can't create number objects in macros. */
1542 obj
.s
.type
= Lisp_Int
;
1547 /***********************************************************************
1549 ***********************************************************************/
1551 /* Lisp_Strings are allocated in string_block structures. When a new
1552 string_block is allocated, all the Lisp_Strings it contains are
1553 added to a free-list string_free_list. When a new Lisp_String is
1554 needed, it is taken from that list. During the sweep phase of GC,
1555 string_blocks that are entirely free are freed, except two which
1558 String data is allocated from sblock structures. Strings larger
1559 than LARGE_STRING_BYTES, get their own sblock, data for smaller
1560 strings is sub-allocated out of sblocks of size SBLOCK_SIZE.
1562 Sblocks consist internally of sdata structures, one for each
1563 Lisp_String. The sdata structure points to the Lisp_String it
1564 belongs to. The Lisp_String points back to the `u.data' member of
1565 its sdata structure.
1567 When a Lisp_String is freed during GC, it is put back on
1568 string_free_list, and its `data' member and its sdata's `string'
1569 pointer is set to null. The size of the string is recorded in the
1570 `u.nbytes' member of the sdata. So, sdata structures that are no
1571 longer used, can be easily recognized, and it's easy to compact the
1572 sblocks of small strings which we do in compact_small_strings. */
1574 /* Size in bytes of an sblock structure used for small strings. This
1575 is 8192 minus malloc overhead. */
1577 #define SBLOCK_SIZE 8188
1579 /* Strings larger than this are considered large strings. String data
1580 for large strings is allocated from individual sblocks. */
1582 #define LARGE_STRING_BYTES 1024
1584 /* Structure describing string memory sub-allocated from an sblock.
1585 This is where the contents of Lisp strings are stored. */
1589 /* Back-pointer to the string this sdata belongs to. If null, this
1590 structure is free, and the NBYTES member of the union below
1591 contains the string's byte size (the same value that STRING_BYTES
1592 would return if STRING were non-null). If non-null, STRING_BYTES
1593 (STRING) is the size of the data, and DATA contains the string's
1595 struct Lisp_String
*string
;
1597 #ifdef GC_CHECK_STRING_BYTES
1600 unsigned char data
[1];
1602 #define SDATA_NBYTES(S) (S)->nbytes
1603 #define SDATA_DATA(S) (S)->data
1605 #else /* not GC_CHECK_STRING_BYTES */
1609 /* When STRING in non-null. */
1610 unsigned char data
[1];
1612 /* When STRING is null. */
1617 #define SDATA_NBYTES(S) (S)->u.nbytes
1618 #define SDATA_DATA(S) (S)->u.data
1620 #endif /* not GC_CHECK_STRING_BYTES */
1624 /* Structure describing a block of memory which is sub-allocated to
1625 obtain string data memory for strings. Blocks for small strings
1626 are of fixed size SBLOCK_SIZE. Blocks for large strings are made
1627 as large as needed. */
1632 struct sblock
*next
;
1634 /* Pointer to the next free sdata block. This points past the end
1635 of the sblock if there isn't any space left in this block. */
1636 struct sdata
*next_free
;
1638 /* Start of data. */
1639 struct sdata first_data
;
1642 /* Number of Lisp strings in a string_block structure. The 1020 is
1643 1024 minus malloc overhead. */
1645 #define STRING_BLOCK_SIZE \
1646 ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String))
1648 /* Structure describing a block from which Lisp_String structures
1653 /* Place `strings' first, to preserve alignment. */
1654 struct Lisp_String strings
[STRING_BLOCK_SIZE
];
1655 struct string_block
*next
;
1658 /* Head and tail of the list of sblock structures holding Lisp string
1659 data. We always allocate from current_sblock. The NEXT pointers
1660 in the sblock structures go from oldest_sblock to current_sblock. */
1662 static struct sblock
*oldest_sblock
, *current_sblock
;
1664 /* List of sblocks for large strings. */
1666 static struct sblock
*large_sblocks
;
1668 /* List of string_block structures, and how many there are. */
1670 static struct string_block
*string_blocks
;
1671 static int n_string_blocks
;
1673 /* Free-list of Lisp_Strings. */
1675 static struct Lisp_String
*string_free_list
;
1677 /* Number of live and free Lisp_Strings. */
1679 static int total_strings
, total_free_strings
;
1681 /* Number of bytes used by live strings. */
1683 static int total_string_size
;
1685 /* Given a pointer to a Lisp_String S which is on the free-list
1686 string_free_list, return a pointer to its successor in the
1689 #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S))
1691 /* Return a pointer to the sdata structure belonging to Lisp string S.
1692 S must be live, i.e. S->data must not be null. S->data is actually
1693 a pointer to the `u.data' member of its sdata structure; the
1694 structure starts at a constant offset in front of that. */
1696 #ifdef GC_CHECK_STRING_BYTES
1698 #define SDATA_OF_STRING(S) \
1699 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *) \
1700 - sizeof (EMACS_INT)))
1702 #else /* not GC_CHECK_STRING_BYTES */
1704 #define SDATA_OF_STRING(S) \
1705 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *)))
1707 #endif /* not GC_CHECK_STRING_BYTES */
1710 #ifdef GC_CHECK_STRING_OVERRUN
1712 /* We check for overrun in string data blocks by appending a small
1713 "cookie" after each allocated string data block, and check for the
1714 presence of this cookie during GC. */
1716 #define GC_STRING_OVERRUN_COOKIE_SIZE 4
1717 static char string_overrun_cookie
[GC_STRING_OVERRUN_COOKIE_SIZE
] =
1718 { 0xde, 0xad, 0xbe, 0xef };
1721 #define GC_STRING_OVERRUN_COOKIE_SIZE 0
1724 /* Value is the size of an sdata structure large enough to hold NBYTES
1725 bytes of string data. The value returned includes a terminating
1726 NUL byte, the size of the sdata structure, and padding. */
1728 #ifdef GC_CHECK_STRING_BYTES
1730 #define SDATA_SIZE(NBYTES) \
1731 ((sizeof (struct Lisp_String *) \
1733 + sizeof (EMACS_INT) \
1734 + sizeof (EMACS_INT) - 1) \
1735 & ~(sizeof (EMACS_INT) - 1))
1737 #else /* not GC_CHECK_STRING_BYTES */
1739 #define SDATA_SIZE(NBYTES) \
1740 ((sizeof (struct Lisp_String *) \
1742 + sizeof (EMACS_INT) - 1) \
1743 & ~(sizeof (EMACS_INT) - 1))
1745 #endif /* not GC_CHECK_STRING_BYTES */
1747 /* Extra bytes to allocate for each string. */
1749 #define GC_STRING_EXTRA (GC_STRING_OVERRUN_COOKIE_SIZE)
1751 /* Initialize string allocation. Called from init_alloc_once. */
1756 total_strings
= total_free_strings
= total_string_size
= 0;
1757 oldest_sblock
= current_sblock
= large_sblocks
= NULL
;
1758 string_blocks
= NULL
;
1759 n_string_blocks
= 0;
1760 string_free_list
= NULL
;
1761 empty_unibyte_string
= make_pure_string ("", 0, 0, 0);
1762 empty_multibyte_string
= make_pure_string ("", 0, 0, 1);
1766 #ifdef GC_CHECK_STRING_BYTES
1768 static int check_string_bytes_count
;
1770 static void check_string_bytes
P_ ((int));
1771 static void check_sblock
P_ ((struct sblock
*));
1773 #define CHECK_STRING_BYTES(S) STRING_BYTES (S)
1776 /* Like GC_STRING_BYTES, but with debugging check. */
1780 struct Lisp_String
*s
;
1782 int nbytes
= (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1783 if (!PURE_POINTER_P (s
)
1785 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1790 /* Check validity of Lisp strings' string_bytes member in B. */
1796 struct sdata
*from
, *end
, *from_end
;
1800 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1802 /* Compute the next FROM here because copying below may
1803 overwrite data we need to compute it. */
1806 /* Check that the string size recorded in the string is the
1807 same as the one recorded in the sdata structure. */
1809 CHECK_STRING_BYTES (from
->string
);
1812 nbytes
= GC_STRING_BYTES (from
->string
);
1814 nbytes
= SDATA_NBYTES (from
);
1816 nbytes
= SDATA_SIZE (nbytes
);
1817 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
1822 /* Check validity of Lisp strings' string_bytes member. ALL_P
1823 non-zero means check all strings, otherwise check only most
1824 recently allocated strings. Used for hunting a bug. */
1827 check_string_bytes (all_p
)
1834 for (b
= large_sblocks
; b
; b
= b
->next
)
1836 struct Lisp_String
*s
= b
->first_data
.string
;
1838 CHECK_STRING_BYTES (s
);
1841 for (b
= oldest_sblock
; b
; b
= b
->next
)
1845 check_sblock (current_sblock
);
1848 #endif /* GC_CHECK_STRING_BYTES */
1850 #ifdef GC_CHECK_STRING_FREE_LIST
1852 /* Walk through the string free list looking for bogus next pointers.
1853 This may catch buffer overrun from a previous string. */
1856 check_string_free_list ()
1858 struct Lisp_String
*s
;
1860 /* Pop a Lisp_String off the free-list. */
1861 s
= string_free_list
;
1864 if ((unsigned)s
< 1024)
1866 s
= NEXT_FREE_LISP_STRING (s
);
1870 #define check_string_free_list()
1873 /* Return a new Lisp_String. */
1875 static struct Lisp_String
*
1878 struct Lisp_String
*s
;
1880 /* eassert (!handling_signal); */
1884 /* If the free-list is empty, allocate a new string_block, and
1885 add all the Lisp_Strings in it to the free-list. */
1886 if (string_free_list
== NULL
)
1888 struct string_block
*b
;
1891 b
= (struct string_block
*) lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1892 bzero (b
, sizeof *b
);
1893 b
->next
= string_blocks
;
1897 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1900 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1901 string_free_list
= s
;
1904 total_free_strings
+= STRING_BLOCK_SIZE
;
1907 check_string_free_list ();
1909 /* Pop a Lisp_String off the free-list. */
1910 s
= string_free_list
;
1911 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1913 MALLOC_UNBLOCK_INPUT
;
1915 /* Probably not strictly necessary, but play it safe. */
1916 bzero (s
, sizeof *s
);
1918 --total_free_strings
;
1921 consing_since_gc
+= sizeof *s
;
1923 #ifdef GC_CHECK_STRING_BYTES
1924 if (!noninteractive
)
1926 if (++check_string_bytes_count
== 200)
1928 check_string_bytes_count
= 0;
1929 check_string_bytes (1);
1932 check_string_bytes (0);
1934 #endif /* GC_CHECK_STRING_BYTES */
1940 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1941 plus a NUL byte at the end. Allocate an sdata structure for S, and
1942 set S->data to its `u.data' member. Store a NUL byte at the end of
1943 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1944 S->data if it was initially non-null. */
1947 allocate_string_data (s
, nchars
, nbytes
)
1948 struct Lisp_String
*s
;
1951 struct sdata
*data
, *old_data
;
1953 int needed
, old_nbytes
;
1955 /* Determine the number of bytes needed to store NBYTES bytes
1957 needed
= SDATA_SIZE (nbytes
);
1958 old_data
= s
->data
? SDATA_OF_STRING (s
) : NULL
;
1959 old_nbytes
= GC_STRING_BYTES (s
);
1963 if (nbytes
> LARGE_STRING_BYTES
)
1965 size_t size
= sizeof *b
- sizeof (struct sdata
) + needed
;
1967 #ifdef DOUG_LEA_MALLOC
1968 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1969 because mapped region contents are not preserved in
1972 In case you think of allowing it in a dumped Emacs at the
1973 cost of not being able to re-dump, there's another reason:
1974 mmap'ed data typically have an address towards the top of the
1975 address space, which won't fit into an EMACS_INT (at least on
1976 32-bit systems with the current tagging scheme). --fx */
1977 mallopt (M_MMAP_MAX
, 0);
1980 b
= (struct sblock
*) lisp_malloc (size
+ GC_STRING_EXTRA
, MEM_TYPE_NON_LISP
);
1982 #ifdef DOUG_LEA_MALLOC
1983 /* Back to a reasonable maximum of mmap'ed areas. */
1984 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1987 b
->next_free
= &b
->first_data
;
1988 b
->first_data
.string
= NULL
;
1989 b
->next
= large_sblocks
;
1992 else if (current_sblock
== NULL
1993 || (((char *) current_sblock
+ SBLOCK_SIZE
1994 - (char *) current_sblock
->next_free
)
1995 < (needed
+ GC_STRING_EXTRA
)))
1997 /* Not enough room in the current sblock. */
1998 b
= (struct sblock
*) lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
1999 b
->next_free
= &b
->first_data
;
2000 b
->first_data
.string
= NULL
;
2004 current_sblock
->next
= b
;
2012 data
= b
->next_free
;
2013 b
->next_free
= (struct sdata
*) ((char *) data
+ needed
+ GC_STRING_EXTRA
);
2015 MALLOC_UNBLOCK_INPUT
;
2018 s
->data
= SDATA_DATA (data
);
2019 #ifdef GC_CHECK_STRING_BYTES
2020 SDATA_NBYTES (data
) = nbytes
;
2023 s
->size_byte
= nbytes
;
2024 s
->data
[nbytes
] = '\0';
2025 #ifdef GC_CHECK_STRING_OVERRUN
2026 bcopy (string_overrun_cookie
, (char *) data
+ needed
,
2027 GC_STRING_OVERRUN_COOKIE_SIZE
);
2030 /* If S had already data assigned, mark that as free by setting its
2031 string back-pointer to null, and recording the size of the data
2035 SDATA_NBYTES (old_data
) = old_nbytes
;
2036 old_data
->string
= NULL
;
2039 consing_since_gc
+= needed
;
2043 /* Sweep and compact strings. */
2048 struct string_block
*b
, *next
;
2049 struct string_block
*live_blocks
= NULL
;
2051 string_free_list
= NULL
;
2052 total_strings
= total_free_strings
= 0;
2053 total_string_size
= 0;
2055 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
2056 for (b
= string_blocks
; b
; b
= next
)
2059 struct Lisp_String
*free_list_before
= string_free_list
;
2063 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
2065 struct Lisp_String
*s
= b
->strings
+ i
;
2069 /* String was not on free-list before. */
2070 if (STRING_MARKED_P (s
))
2072 /* String is live; unmark it and its intervals. */
2075 if (!NULL_INTERVAL_P (s
->intervals
))
2076 UNMARK_BALANCE_INTERVALS (s
->intervals
);
2079 total_string_size
+= STRING_BYTES (s
);
2083 /* String is dead. Put it on the free-list. */
2084 struct sdata
*data
= SDATA_OF_STRING (s
);
2086 /* Save the size of S in its sdata so that we know
2087 how large that is. Reset the sdata's string
2088 back-pointer so that we know it's free. */
2089 #ifdef GC_CHECK_STRING_BYTES
2090 if (GC_STRING_BYTES (s
) != SDATA_NBYTES (data
))
2093 data
->u
.nbytes
= GC_STRING_BYTES (s
);
2095 data
->string
= NULL
;
2097 /* Reset the strings's `data' member so that we
2101 /* Put the string on the free-list. */
2102 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2103 string_free_list
= s
;
2109 /* S was on the free-list before. Put it there again. */
2110 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2111 string_free_list
= s
;
2116 /* Free blocks that contain free Lisp_Strings only, except
2117 the first two of them. */
2118 if (nfree
== STRING_BLOCK_SIZE
2119 && total_free_strings
> STRING_BLOCK_SIZE
)
2123 string_free_list
= free_list_before
;
2127 total_free_strings
+= nfree
;
2128 b
->next
= live_blocks
;
2133 check_string_free_list ();
2135 string_blocks
= live_blocks
;
2136 free_large_strings ();
2137 compact_small_strings ();
2139 check_string_free_list ();
2143 /* Free dead large strings. */
2146 free_large_strings ()
2148 struct sblock
*b
, *next
;
2149 struct sblock
*live_blocks
= NULL
;
2151 for (b
= large_sblocks
; b
; b
= next
)
2155 if (b
->first_data
.string
== NULL
)
2159 b
->next
= live_blocks
;
2164 large_sblocks
= live_blocks
;
2168 /* Compact data of small strings. Free sblocks that don't contain
2169 data of live strings after compaction. */
2172 compact_small_strings ()
2174 struct sblock
*b
, *tb
, *next
;
2175 struct sdata
*from
, *to
, *end
, *tb_end
;
2176 struct sdata
*to_end
, *from_end
;
2178 /* TB is the sblock we copy to, TO is the sdata within TB we copy
2179 to, and TB_END is the end of TB. */
2181 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2182 to
= &tb
->first_data
;
2184 /* Step through the blocks from the oldest to the youngest. We
2185 expect that old blocks will stabilize over time, so that less
2186 copying will happen this way. */
2187 for (b
= oldest_sblock
; b
; b
= b
->next
)
2190 xassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
2192 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
2194 /* Compute the next FROM here because copying below may
2195 overwrite data we need to compute it. */
2198 #ifdef GC_CHECK_STRING_BYTES
2199 /* Check that the string size recorded in the string is the
2200 same as the one recorded in the sdata structure. */
2202 && GC_STRING_BYTES (from
->string
) != SDATA_NBYTES (from
))
2204 #endif /* GC_CHECK_STRING_BYTES */
2207 nbytes
= GC_STRING_BYTES (from
->string
);
2209 nbytes
= SDATA_NBYTES (from
);
2211 if (nbytes
> LARGE_STRING_BYTES
)
2214 nbytes
= SDATA_SIZE (nbytes
);
2215 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
2217 #ifdef GC_CHECK_STRING_OVERRUN
2218 if (bcmp (string_overrun_cookie
,
2219 ((char *) from_end
) - GC_STRING_OVERRUN_COOKIE_SIZE
,
2220 GC_STRING_OVERRUN_COOKIE_SIZE
))
2224 /* FROM->string non-null means it's alive. Copy its data. */
2227 /* If TB is full, proceed with the next sblock. */
2228 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2229 if (to_end
> tb_end
)
2233 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2234 to
= &tb
->first_data
;
2235 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2238 /* Copy, and update the string's `data' pointer. */
2241 xassert (tb
!= b
|| to
<= from
);
2242 safe_bcopy ((char *) from
, (char *) to
, nbytes
+ GC_STRING_EXTRA
);
2243 to
->string
->data
= SDATA_DATA (to
);
2246 /* Advance past the sdata we copied to. */
2252 /* The rest of the sblocks following TB don't contain live data, so
2253 we can free them. */
2254 for (b
= tb
->next
; b
; b
= next
)
2262 current_sblock
= tb
;
2266 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
2267 doc
: /* Return a newly created string of length LENGTH, with INIT in each element.
2268 LENGTH must be an integer.
2269 INIT must be an integer that represents a character. */)
2271 Lisp_Object length
, init
;
2273 register Lisp_Object val
;
2274 register unsigned char *p
, *end
;
2277 CHECK_NATNUM (length
);
2278 CHECK_NUMBER (init
);
2281 if (ASCII_CHAR_P (c
))
2283 nbytes
= XINT (length
);
2284 val
= make_uninit_string (nbytes
);
2286 end
= p
+ SCHARS (val
);
2292 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
2293 int len
= CHAR_STRING (c
, str
);
2295 nbytes
= len
* XINT (length
);
2296 val
= make_uninit_multibyte_string (XINT (length
), nbytes
);
2301 bcopy (str
, p
, len
);
2311 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
2312 doc
: /* Return a new bool-vector of length LENGTH, using INIT for each element.
2313 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
2315 Lisp_Object length
, init
;
2317 register Lisp_Object val
;
2318 struct Lisp_Bool_Vector
*p
;
2320 int length_in_chars
, length_in_elts
, bits_per_value
;
2322 CHECK_NATNUM (length
);
2324 bits_per_value
= sizeof (EMACS_INT
) * BOOL_VECTOR_BITS_PER_CHAR
;
2326 length_in_elts
= (XFASTINT (length
) + bits_per_value
- 1) / bits_per_value
;
2327 length_in_chars
= ((XFASTINT (length
) + BOOL_VECTOR_BITS_PER_CHAR
- 1)
2328 / BOOL_VECTOR_BITS_PER_CHAR
);
2330 /* We must allocate one more elements than LENGTH_IN_ELTS for the
2331 slot `size' of the struct Lisp_Bool_Vector. */
2332 val
= Fmake_vector (make_number (length_in_elts
+ 1), Qnil
);
2334 /* Get rid of any bits that would cause confusion. */
2335 XVECTOR (val
)->size
= 0; /* No Lisp_Object to trace in there. */
2336 /* Use XVECTOR (val) rather than `p' because p->size is not TRT. */
2337 XSETPVECTYPE (XVECTOR (val
), PVEC_BOOL_VECTOR
);
2339 p
= XBOOL_VECTOR (val
);
2340 p
->size
= XFASTINT (length
);
2342 real_init
= (NILP (init
) ? 0 : -1);
2343 for (i
= 0; i
< length_in_chars
; i
++)
2344 p
->data
[i
] = real_init
;
2346 /* Clear the extraneous bits in the last byte. */
2347 if (XINT (length
) != length_in_chars
* BOOL_VECTOR_BITS_PER_CHAR
)
2348 p
->data
[length_in_chars
- 1]
2349 &= (1 << (XINT (length
) % BOOL_VECTOR_BITS_PER_CHAR
)) - 1;
2355 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
2356 of characters from the contents. This string may be unibyte or
2357 multibyte, depending on the contents. */
2360 make_string (contents
, nbytes
)
2361 const char *contents
;
2364 register Lisp_Object val
;
2365 int nchars
, multibyte_nbytes
;
2367 parse_str_as_multibyte (contents
, nbytes
, &nchars
, &multibyte_nbytes
);
2368 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
2369 /* CONTENTS contains no multibyte sequences or contains an invalid
2370 multibyte sequence. We must make unibyte string. */
2371 val
= make_unibyte_string (contents
, nbytes
);
2373 val
= make_multibyte_string (contents
, nchars
, nbytes
);
2378 /* Make an unibyte string from LENGTH bytes at CONTENTS. */
2381 make_unibyte_string (contents
, length
)
2382 const char *contents
;
2385 register Lisp_Object val
;
2386 val
= make_uninit_string (length
);
2387 bcopy (contents
, SDATA (val
), length
);
2388 STRING_SET_UNIBYTE (val
);
2393 /* Make a multibyte string from NCHARS characters occupying NBYTES
2394 bytes at CONTENTS. */
2397 make_multibyte_string (contents
, nchars
, nbytes
)
2398 const char *contents
;
2401 register Lisp_Object val
;
2402 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2403 bcopy (contents
, SDATA (val
), nbytes
);
2408 /* Make a string from NCHARS characters occupying NBYTES bytes at
2409 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2412 make_string_from_bytes (contents
, nchars
, nbytes
)
2413 const char *contents
;
2416 register Lisp_Object val
;
2417 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2418 bcopy (contents
, SDATA (val
), nbytes
);
2419 if (SBYTES (val
) == SCHARS (val
))
2420 STRING_SET_UNIBYTE (val
);
2425 /* Make a string from NCHARS characters occupying NBYTES bytes at
2426 CONTENTS. The argument MULTIBYTE controls whether to label the
2427 string as multibyte. If NCHARS is negative, it counts the number of
2428 characters by itself. */
2431 make_specified_string (contents
, nchars
, nbytes
, multibyte
)
2432 const char *contents
;
2436 register Lisp_Object val
;
2441 nchars
= multibyte_chars_in_text (contents
, nbytes
);
2445 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2446 bcopy (contents
, SDATA (val
), nbytes
);
2448 STRING_SET_UNIBYTE (val
);
2453 /* Make a string from the data at STR, treating it as multibyte if the
2460 return make_string (str
, strlen (str
));
2464 /* Return an unibyte Lisp_String set up to hold LENGTH characters
2465 occupying LENGTH bytes. */
2468 make_uninit_string (length
)
2474 return empty_unibyte_string
;
2475 val
= make_uninit_multibyte_string (length
, length
);
2476 STRING_SET_UNIBYTE (val
);
2481 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2482 which occupy NBYTES bytes. */
2485 make_uninit_multibyte_string (nchars
, nbytes
)
2489 struct Lisp_String
*s
;
2494 return empty_multibyte_string
;
2496 s
= allocate_string ();
2497 allocate_string_data (s
, nchars
, nbytes
);
2498 XSETSTRING (string
, s
);
2499 string_chars_consed
+= nbytes
;
2505 /***********************************************************************
2507 ***********************************************************************/
2509 /* We store float cells inside of float_blocks, allocating a new
2510 float_block with malloc whenever necessary. Float cells reclaimed
2511 by GC are put on a free list to be reallocated before allocating
2512 any new float cells from the latest float_block. */
2514 #define FLOAT_BLOCK_SIZE \
2515 (((BLOCK_BYTES - sizeof (struct float_block *) \
2516 /* The compiler might add padding at the end. */ \
2517 - (sizeof (struct Lisp_Float) - sizeof (int))) * CHAR_BIT) \
2518 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2520 #define GETMARKBIT(block,n) \
2521 (((block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2522 >> ((n) % (sizeof(int) * CHAR_BIT))) \
2525 #define SETMARKBIT(block,n) \
2526 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2527 |= 1 << ((n) % (sizeof(int) * CHAR_BIT))
2529 #define UNSETMARKBIT(block,n) \
2530 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2531 &= ~(1 << ((n) % (sizeof(int) * CHAR_BIT)))
2533 #define FLOAT_BLOCK(fptr) \
2534 ((struct float_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2536 #define FLOAT_INDEX(fptr) \
2537 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2541 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2542 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2543 int gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2544 struct float_block
*next
;
2547 #define FLOAT_MARKED_P(fptr) \
2548 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2550 #define FLOAT_MARK(fptr) \
2551 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2553 #define FLOAT_UNMARK(fptr) \
2554 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2556 /* Current float_block. */
2558 struct float_block
*float_block
;
2560 /* Index of first unused Lisp_Float in the current float_block. */
2562 int float_block_index
;
2564 /* Total number of float blocks now in use. */
2568 /* Free-list of Lisp_Floats. */
2570 struct Lisp_Float
*float_free_list
;
2573 /* Initialize float allocation. */
2579 float_block_index
= FLOAT_BLOCK_SIZE
; /* Force alloc of new float_block. */
2580 float_free_list
= 0;
2585 /* Explicitly free a float cell by putting it on the free-list. */
2589 struct Lisp_Float
*ptr
;
2591 ptr
->u
.chain
= float_free_list
;
2592 float_free_list
= ptr
;
2596 /* Return a new float object with value FLOAT_VALUE. */
2599 make_float (float_value
)
2602 register Lisp_Object val
;
2604 /* eassert (!handling_signal); */
2608 if (float_free_list
)
2610 /* We use the data field for chaining the free list
2611 so that we won't use the same field that has the mark bit. */
2612 XSETFLOAT (val
, float_free_list
);
2613 float_free_list
= float_free_list
->u
.chain
;
2617 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2619 register struct float_block
*new;
2621 new = (struct float_block
*) lisp_align_malloc (sizeof *new,
2623 new->next
= float_block
;
2624 bzero ((char *) new->gcmarkbits
, sizeof new->gcmarkbits
);
2626 float_block_index
= 0;
2629 XSETFLOAT (val
, &float_block
->floats
[float_block_index
]);
2630 float_block_index
++;
2633 MALLOC_UNBLOCK_INPUT
;
2635 XFLOAT_INIT (val
, float_value
);
2636 eassert (!FLOAT_MARKED_P (XFLOAT (val
)));
2637 consing_since_gc
+= sizeof (struct Lisp_Float
);
2644 /***********************************************************************
2646 ***********************************************************************/
2648 /* We store cons cells inside of cons_blocks, allocating a new
2649 cons_block with malloc whenever necessary. Cons cells reclaimed by
2650 GC are put on a free list to be reallocated before allocating
2651 any new cons cells from the latest cons_block. */
2653 #define CONS_BLOCK_SIZE \
2654 (((BLOCK_BYTES - sizeof (struct cons_block *)) * CHAR_BIT) \
2655 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2657 #define CONS_BLOCK(fptr) \
2658 ((struct cons_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2660 #define CONS_INDEX(fptr) \
2661 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2665 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2666 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2667 int gcmarkbits
[1 + CONS_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2668 struct cons_block
*next
;
2671 #define CONS_MARKED_P(fptr) \
2672 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2674 #define CONS_MARK(fptr) \
2675 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2677 #define CONS_UNMARK(fptr) \
2678 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2680 /* Current cons_block. */
2682 struct cons_block
*cons_block
;
2684 /* Index of first unused Lisp_Cons in the current block. */
2686 int cons_block_index
;
2688 /* Free-list of Lisp_Cons structures. */
2690 struct Lisp_Cons
*cons_free_list
;
2692 /* Total number of cons blocks now in use. */
2694 static int n_cons_blocks
;
2697 /* Initialize cons allocation. */
2703 cons_block_index
= CONS_BLOCK_SIZE
; /* Force alloc of new cons_block. */
2709 /* Explicitly free a cons cell by putting it on the free-list. */
2713 struct Lisp_Cons
*ptr
;
2715 ptr
->u
.chain
= cons_free_list
;
2719 cons_free_list
= ptr
;
2722 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
2723 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2725 Lisp_Object car
, cdr
;
2727 register Lisp_Object val
;
2729 /* eassert (!handling_signal); */
2735 /* We use the cdr for chaining the free list
2736 so that we won't use the same field that has the mark bit. */
2737 XSETCONS (val
, cons_free_list
);
2738 cons_free_list
= cons_free_list
->u
.chain
;
2742 if (cons_block_index
== CONS_BLOCK_SIZE
)
2744 register struct cons_block
*new;
2745 new = (struct cons_block
*) lisp_align_malloc (sizeof *new,
2747 bzero ((char *) new->gcmarkbits
, sizeof new->gcmarkbits
);
2748 new->next
= cons_block
;
2750 cons_block_index
= 0;
2753 XSETCONS (val
, &cons_block
->conses
[cons_block_index
]);
2757 MALLOC_UNBLOCK_INPUT
;
2761 eassert (!CONS_MARKED_P (XCONS (val
)));
2762 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2763 cons_cells_consed
++;
2767 /* Get an error now if there's any junk in the cons free list. */
2771 #ifdef GC_CHECK_CONS_LIST
2772 struct Lisp_Cons
*tail
= cons_free_list
;
2775 tail
= tail
->u
.chain
;
2779 /* Make a list of 1, 2, 3, 4 or 5 specified objects. */
2785 return Fcons (arg1
, Qnil
);
2790 Lisp_Object arg1
, arg2
;
2792 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2797 list3 (arg1
, arg2
, arg3
)
2798 Lisp_Object arg1
, arg2
, arg3
;
2800 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2805 list4 (arg1
, arg2
, arg3
, arg4
)
2806 Lisp_Object arg1
, arg2
, arg3
, arg4
;
2808 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2813 list5 (arg1
, arg2
, arg3
, arg4
, arg5
)
2814 Lisp_Object arg1
, arg2
, arg3
, arg4
, arg5
;
2816 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2817 Fcons (arg5
, Qnil
)))));
2821 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
2822 doc
: /* Return a newly created list with specified arguments as elements.
2823 Any number of arguments, even zero arguments, are allowed.
2824 usage: (list &rest OBJECTS) */)
2827 register Lisp_Object
*args
;
2829 register Lisp_Object val
;
2835 val
= Fcons (args
[nargs
], val
);
2841 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2842 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2844 register Lisp_Object length
, init
;
2846 register Lisp_Object val
;
2849 CHECK_NATNUM (length
);
2850 size
= XFASTINT (length
);
2855 val
= Fcons (init
, val
);
2860 val
= Fcons (init
, val
);
2865 val
= Fcons (init
, val
);
2870 val
= Fcons (init
, val
);
2875 val
= Fcons (init
, val
);
2890 /***********************************************************************
2892 ***********************************************************************/
2894 /* Singly-linked list of all vectors. */
2896 static struct Lisp_Vector
*all_vectors
;
2898 /* Total number of vector-like objects now in use. */
2900 static int n_vectors
;
2903 /* Value is a pointer to a newly allocated Lisp_Vector structure
2904 with room for LEN Lisp_Objects. */
2906 static struct Lisp_Vector
*
2907 allocate_vectorlike (len
)
2910 struct Lisp_Vector
*p
;
2915 #ifdef DOUG_LEA_MALLOC
2916 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
2917 because mapped region contents are not preserved in
2919 mallopt (M_MMAP_MAX
, 0);
2922 /* This gets triggered by code which I haven't bothered to fix. --Stef */
2923 /* eassert (!handling_signal); */
2925 nbytes
= sizeof *p
+ (len
- 1) * sizeof p
->contents
[0];
2926 p
= (struct Lisp_Vector
*) lisp_malloc (nbytes
, MEM_TYPE_VECTORLIKE
);
2928 #ifdef DOUG_LEA_MALLOC
2929 /* Back to a reasonable maximum of mmap'ed areas. */
2930 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2933 consing_since_gc
+= nbytes
;
2934 vector_cells_consed
+= len
;
2936 p
->next
= all_vectors
;
2939 MALLOC_UNBLOCK_INPUT
;
2946 /* Allocate a vector with NSLOTS slots. */
2948 struct Lisp_Vector
*
2949 allocate_vector (nslots
)
2952 struct Lisp_Vector
*v
= allocate_vectorlike (nslots
);
2958 /* Allocate other vector-like structures. */
2960 struct Lisp_Vector
*
2961 allocate_pseudovector (memlen
, lisplen
, tag
)
2962 int memlen
, lisplen
;
2965 struct Lisp_Vector
*v
= allocate_vectorlike (memlen
);
2968 /* Only the first lisplen slots will be traced normally by the GC. */
2970 for (i
= 0; i
< lisplen
; ++i
)
2971 v
->contents
[i
] = Qnil
;
2973 XSETPVECTYPE (v
, tag
); /* Add the appropriate tag. */
2977 struct Lisp_Hash_Table
*
2978 allocate_hash_table (void)
2980 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Hash_Table
, count
, PVEC_HASH_TABLE
);
2987 return ALLOCATE_PSEUDOVECTOR(struct window
, current_matrix
, PVEC_WINDOW
);
2992 allocate_terminal ()
2994 struct terminal
*t
= ALLOCATE_PSEUDOVECTOR (struct terminal
,
2995 next_terminal
, PVEC_TERMINAL
);
2996 /* Zero out the non-GC'd fields. FIXME: This should be made unnecessary. */
2997 bzero (&(t
->next_terminal
),
2998 ((char*)(t
+1)) - ((char*)&(t
->next_terminal
)));
3006 struct frame
*f
= ALLOCATE_PSEUDOVECTOR (struct frame
,
3007 face_cache
, PVEC_FRAME
);
3008 /* Zero out the non-GC'd fields. FIXME: This should be made unnecessary. */
3009 bzero (&(f
->face_cache
),
3010 ((char*)(f
+1)) - ((char*)&(f
->face_cache
)));
3015 struct Lisp_Process
*
3018 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Process
, pid
, PVEC_PROCESS
);
3022 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
3023 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
3024 See also the function `vector'. */)
3026 register Lisp_Object length
, init
;
3029 register EMACS_INT sizei
;
3031 register struct Lisp_Vector
*p
;
3033 CHECK_NATNUM (length
);
3034 sizei
= XFASTINT (length
);
3036 p
= allocate_vector (sizei
);
3037 for (index
= 0; index
< sizei
; index
++)
3038 p
->contents
[index
] = init
;
3040 XSETVECTOR (vector
, p
);
3045 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
3046 doc
: /* Return a newly created vector with specified arguments as elements.
3047 Any number of arguments, even zero arguments, are allowed.
3048 usage: (vector &rest OBJECTS) */)
3053 register Lisp_Object len
, val
;
3055 register struct Lisp_Vector
*p
;
3057 XSETFASTINT (len
, nargs
);
3058 val
= Fmake_vector (len
, Qnil
);
3060 for (index
= 0; index
< nargs
; index
++)
3061 p
->contents
[index
] = args
[index
];
3066 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
3067 doc
: /* Create a byte-code object with specified arguments as elements.
3068 The arguments should be the arglist, bytecode-string, constant vector,
3069 stack size, (optional) doc string, and (optional) interactive spec.
3070 The first four arguments are required; at most six have any
3072 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
3077 register Lisp_Object len
, val
;
3079 register struct Lisp_Vector
*p
;
3081 XSETFASTINT (len
, nargs
);
3082 if (!NILP (Vpurify_flag
))
3083 val
= make_pure_vector ((EMACS_INT
) nargs
);
3085 val
= Fmake_vector (len
, Qnil
);
3087 if (STRINGP (args
[1]) && STRING_MULTIBYTE (args
[1]))
3088 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
3089 earlier because they produced a raw 8-bit string for byte-code
3090 and now such a byte-code string is loaded as multibyte while
3091 raw 8-bit characters converted to multibyte form. Thus, now we
3092 must convert them back to the original unibyte form. */
3093 args
[1] = Fstring_as_unibyte (args
[1]);
3096 for (index
= 0; index
< nargs
; index
++)
3098 if (!NILP (Vpurify_flag
))
3099 args
[index
] = Fpurecopy (args
[index
]);
3100 p
->contents
[index
] = args
[index
];
3102 XSETPVECTYPE (p
, PVEC_COMPILED
);
3103 XSETCOMPILED (val
, p
);
3109 /***********************************************************************
3111 ***********************************************************************/
3113 /* Each symbol_block is just under 1020 bytes long, since malloc
3114 really allocates in units of powers of two and uses 4 bytes for its
3117 #define SYMBOL_BLOCK_SIZE \
3118 ((1020 - sizeof (struct symbol_block *)) / sizeof (struct Lisp_Symbol))
3122 /* Place `symbols' first, to preserve alignment. */
3123 struct Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
3124 struct symbol_block
*next
;
3127 /* Current symbol block and index of first unused Lisp_Symbol
3130 static struct symbol_block
*symbol_block
;
3131 static int symbol_block_index
;
3133 /* List of free symbols. */
3135 static struct Lisp_Symbol
*symbol_free_list
;
3137 /* Total number of symbol blocks now in use. */
3139 static int n_symbol_blocks
;
3142 /* Initialize symbol allocation. */
3147 symbol_block
= NULL
;
3148 symbol_block_index
= SYMBOL_BLOCK_SIZE
;
3149 symbol_free_list
= 0;
3150 n_symbol_blocks
= 0;
3154 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
3155 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
3156 Its value and function definition are void, and its property list is nil. */)
3160 register Lisp_Object val
;
3161 register struct Lisp_Symbol
*p
;
3163 CHECK_STRING (name
);
3165 /* eassert (!handling_signal); */
3169 if (symbol_free_list
)
3171 XSETSYMBOL (val
, symbol_free_list
);
3172 symbol_free_list
= symbol_free_list
->next
;
3176 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
3178 struct symbol_block
*new;
3179 new = (struct symbol_block
*) lisp_malloc (sizeof *new,
3181 new->next
= symbol_block
;
3183 symbol_block_index
= 0;
3186 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
]);
3187 symbol_block_index
++;
3190 MALLOC_UNBLOCK_INPUT
;
3195 p
->redirect
= SYMBOL_PLAINVAL
;
3196 SET_SYMBOL_VAL (p
, Qunbound
);
3197 p
->function
= Qunbound
;
3200 p
->interned
= SYMBOL_UNINTERNED
;
3202 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
3209 /***********************************************************************
3210 Marker (Misc) Allocation
3211 ***********************************************************************/
3213 /* Allocation of markers and other objects that share that structure.
3214 Works like allocation of conses. */
3216 #define MARKER_BLOCK_SIZE \
3217 ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc))
3221 /* Place `markers' first, to preserve alignment. */
3222 union Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
3223 struct marker_block
*next
;
3226 static struct marker_block
*marker_block
;
3227 static int marker_block_index
;
3229 static union Lisp_Misc
*marker_free_list
;
3231 /* Total number of marker blocks now in use. */
3233 static int n_marker_blocks
;
3238 marker_block
= NULL
;
3239 marker_block_index
= MARKER_BLOCK_SIZE
;
3240 marker_free_list
= 0;
3241 n_marker_blocks
= 0;
3244 /* Return a newly allocated Lisp_Misc object, with no substructure. */
3251 /* eassert (!handling_signal); */
3255 if (marker_free_list
)
3257 XSETMISC (val
, marker_free_list
);
3258 marker_free_list
= marker_free_list
->u_free
.chain
;
3262 if (marker_block_index
== MARKER_BLOCK_SIZE
)
3264 struct marker_block
*new;
3265 new = (struct marker_block
*) lisp_malloc (sizeof *new,
3267 new->next
= marker_block
;
3269 marker_block_index
= 0;
3271 total_free_markers
+= MARKER_BLOCK_SIZE
;
3273 XSETMISC (val
, &marker_block
->markers
[marker_block_index
]);
3274 marker_block_index
++;
3277 MALLOC_UNBLOCK_INPUT
;
3279 --total_free_markers
;
3280 consing_since_gc
+= sizeof (union Lisp_Misc
);
3281 misc_objects_consed
++;
3282 XMISCANY (val
)->gcmarkbit
= 0;
3286 /* Free a Lisp_Misc object */
3292 XMISCTYPE (misc
) = Lisp_Misc_Free
;
3293 XMISC (misc
)->u_free
.chain
= marker_free_list
;
3294 marker_free_list
= XMISC (misc
);
3296 total_free_markers
++;
3299 /* Return a Lisp_Misc_Save_Value object containing POINTER and
3300 INTEGER. This is used to package C values to call record_unwind_protect.
3301 The unwind function can get the C values back using XSAVE_VALUE. */
3304 make_save_value (pointer
, integer
)
3308 register Lisp_Object val
;
3309 register struct Lisp_Save_Value
*p
;
3311 val
= allocate_misc ();
3312 XMISCTYPE (val
) = Lisp_Misc_Save_Value
;
3313 p
= XSAVE_VALUE (val
);
3314 p
->pointer
= pointer
;
3315 p
->integer
= integer
;
3320 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
3321 doc
: /* Return a newly allocated marker which does not point at any place. */)
3324 register Lisp_Object val
;
3325 register struct Lisp_Marker
*p
;
3327 val
= allocate_misc ();
3328 XMISCTYPE (val
) = Lisp_Misc_Marker
;
3334 p
->insertion_type
= 0;
3338 /* Put MARKER back on the free list after using it temporarily. */
3341 free_marker (marker
)
3344 unchain_marker (XMARKER (marker
));
3349 /* Return a newly created vector or string with specified arguments as
3350 elements. If all the arguments are characters that can fit
3351 in a string of events, make a string; otherwise, make a vector.
3353 Any number of arguments, even zero arguments, are allowed. */
3356 make_event_array (nargs
, args
)
3362 for (i
= 0; i
< nargs
; i
++)
3363 /* The things that fit in a string
3364 are characters that are in 0...127,
3365 after discarding the meta bit and all the bits above it. */
3366 if (!INTEGERP (args
[i
])
3367 || (XUINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
3368 return Fvector (nargs
, args
);
3370 /* Since the loop exited, we know that all the things in it are
3371 characters, so we can make a string. */
3375 result
= Fmake_string (make_number (nargs
), make_number (0));
3376 for (i
= 0; i
< nargs
; i
++)
3378 SSET (result
, i
, XINT (args
[i
]));
3379 /* Move the meta bit to the right place for a string char. */
3380 if (XINT (args
[i
]) & CHAR_META
)
3381 SSET (result
, i
, SREF (result
, i
) | 0x80);
3390 /************************************************************************
3391 Memory Full Handling
3392 ************************************************************************/
3395 /* Called if malloc returns zero. */
3404 memory_full_cons_threshold
= sizeof (struct cons_block
);
3406 /* The first time we get here, free the spare memory. */
3407 for (i
= 0; i
< sizeof (spare_memory
) / sizeof (char *); i
++)
3408 if (spare_memory
[i
])
3411 free (spare_memory
[i
]);
3412 else if (i
>= 1 && i
<= 4)
3413 lisp_align_free (spare_memory
[i
]);
3415 lisp_free (spare_memory
[i
]);
3416 spare_memory
[i
] = 0;
3419 /* Record the space now used. When it decreases substantially,
3420 we can refill the memory reserve. */
3421 #ifndef SYSTEM_MALLOC
3422 bytes_used_when_full
= BYTES_USED
;
3425 /* This used to call error, but if we've run out of memory, we could
3426 get infinite recursion trying to build the string. */
3427 xsignal (Qnil
, Vmemory_signal_data
);
3430 /* If we released our reserve (due to running out of memory),
3431 and we have a fair amount free once again,
3432 try to set aside another reserve in case we run out once more.
3434 This is called when a relocatable block is freed in ralloc.c,
3435 and also directly from this file, in case we're not using ralloc.c. */
3438 refill_memory_reserve ()
3440 #ifndef SYSTEM_MALLOC
3441 if (spare_memory
[0] == 0)
3442 spare_memory
[0] = (char *) malloc ((size_t) SPARE_MEMORY
);
3443 if (spare_memory
[1] == 0)
3444 spare_memory
[1] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3446 if (spare_memory
[2] == 0)
3447 spare_memory
[2] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3449 if (spare_memory
[3] == 0)
3450 spare_memory
[3] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3452 if (spare_memory
[4] == 0)
3453 spare_memory
[4] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3455 if (spare_memory
[5] == 0)
3456 spare_memory
[5] = (char *) lisp_malloc (sizeof (struct string_block
),
3458 if (spare_memory
[6] == 0)
3459 spare_memory
[6] = (char *) lisp_malloc (sizeof (struct string_block
),
3461 if (spare_memory
[0] && spare_memory
[1] && spare_memory
[5])
3462 Vmemory_full
= Qnil
;
3466 /************************************************************************
3468 ************************************************************************/
3470 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
3472 /* Conservative C stack marking requires a method to identify possibly
3473 live Lisp objects given a pointer value. We do this by keeping
3474 track of blocks of Lisp data that are allocated in a red-black tree
3475 (see also the comment of mem_node which is the type of nodes in
3476 that tree). Function lisp_malloc adds information for an allocated
3477 block to the red-black tree with calls to mem_insert, and function
3478 lisp_free removes it with mem_delete. Functions live_string_p etc
3479 call mem_find to lookup information about a given pointer in the
3480 tree, and use that to determine if the pointer points to a Lisp
3483 /* Initialize this part of alloc.c. */
3488 mem_z
.left
= mem_z
.right
= MEM_NIL
;
3489 mem_z
.parent
= NULL
;
3490 mem_z
.color
= MEM_BLACK
;
3491 mem_z
.start
= mem_z
.end
= NULL
;
3496 /* Value is a pointer to the mem_node containing START. Value is
3497 MEM_NIL if there is no node in the tree containing START. */
3499 static INLINE
struct mem_node
*
3505 if (start
< min_heap_address
|| start
> max_heap_address
)
3508 /* Make the search always successful to speed up the loop below. */
3509 mem_z
.start
= start
;
3510 mem_z
.end
= (char *) start
+ 1;
3513 while (start
< p
->start
|| start
>= p
->end
)
3514 p
= start
< p
->start
? p
->left
: p
->right
;
3519 /* Insert a new node into the tree for a block of memory with start
3520 address START, end address END, and type TYPE. Value is a
3521 pointer to the node that was inserted. */
3523 static struct mem_node
*
3524 mem_insert (start
, end
, type
)
3528 struct mem_node
*c
, *parent
, *x
;
3530 if (min_heap_address
== NULL
|| start
< min_heap_address
)
3531 min_heap_address
= start
;
3532 if (max_heap_address
== NULL
|| end
> max_heap_address
)
3533 max_heap_address
= end
;
3535 /* See where in the tree a node for START belongs. In this
3536 particular application, it shouldn't happen that a node is already
3537 present. For debugging purposes, let's check that. */
3541 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3543 while (c
!= MEM_NIL
)
3545 if (start
>= c
->start
&& start
< c
->end
)
3548 c
= start
< c
->start
? c
->left
: c
->right
;
3551 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3553 while (c
!= MEM_NIL
)
3556 c
= start
< c
->start
? c
->left
: c
->right
;
3559 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3561 /* Create a new node. */
3562 #ifdef GC_MALLOC_CHECK
3563 x
= (struct mem_node
*) _malloc_internal (sizeof *x
);
3567 x
= (struct mem_node
*) xmalloc (sizeof *x
);
3573 x
->left
= x
->right
= MEM_NIL
;
3576 /* Insert it as child of PARENT or install it as root. */
3579 if (start
< parent
->start
)
3587 /* Re-establish red-black tree properties. */
3588 mem_insert_fixup (x
);
3594 /* Re-establish the red-black properties of the tree, and thereby
3595 balance the tree, after node X has been inserted; X is always red. */
3598 mem_insert_fixup (x
)
3601 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3603 /* X is red and its parent is red. This is a violation of
3604 red-black tree property #3. */
3606 if (x
->parent
== x
->parent
->parent
->left
)
3608 /* We're on the left side of our grandparent, and Y is our
3610 struct mem_node
*y
= x
->parent
->parent
->right
;
3612 if (y
->color
== MEM_RED
)
3614 /* Uncle and parent are red but should be black because
3615 X is red. Change the colors accordingly and proceed
3616 with the grandparent. */
3617 x
->parent
->color
= MEM_BLACK
;
3618 y
->color
= MEM_BLACK
;
3619 x
->parent
->parent
->color
= MEM_RED
;
3620 x
= x
->parent
->parent
;
3624 /* Parent and uncle have different colors; parent is
3625 red, uncle is black. */
3626 if (x
== x
->parent
->right
)
3629 mem_rotate_left (x
);
3632 x
->parent
->color
= MEM_BLACK
;
3633 x
->parent
->parent
->color
= MEM_RED
;
3634 mem_rotate_right (x
->parent
->parent
);
3639 /* This is the symmetrical case of above. */
3640 struct mem_node
*y
= x
->parent
->parent
->left
;
3642 if (y
->color
== MEM_RED
)
3644 x
->parent
->color
= MEM_BLACK
;
3645 y
->color
= MEM_BLACK
;
3646 x
->parent
->parent
->color
= MEM_RED
;
3647 x
= x
->parent
->parent
;
3651 if (x
== x
->parent
->left
)
3654 mem_rotate_right (x
);
3657 x
->parent
->color
= MEM_BLACK
;
3658 x
->parent
->parent
->color
= MEM_RED
;
3659 mem_rotate_left (x
->parent
->parent
);
3664 /* The root may have been changed to red due to the algorithm. Set
3665 it to black so that property #5 is satisfied. */
3666 mem_root
->color
= MEM_BLACK
;
3682 /* Turn y's left sub-tree into x's right sub-tree. */
3685 if (y
->left
!= MEM_NIL
)
3686 y
->left
->parent
= x
;
3688 /* Y's parent was x's parent. */
3690 y
->parent
= x
->parent
;
3692 /* Get the parent to point to y instead of x. */
3695 if (x
== x
->parent
->left
)
3696 x
->parent
->left
= y
;
3698 x
->parent
->right
= y
;
3703 /* Put x on y's left. */
3717 mem_rotate_right (x
)
3720 struct mem_node
*y
= x
->left
;
3723 if (y
->right
!= MEM_NIL
)
3724 y
->right
->parent
= x
;
3727 y
->parent
= x
->parent
;
3730 if (x
== x
->parent
->right
)
3731 x
->parent
->right
= y
;
3733 x
->parent
->left
= y
;
3744 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
3750 struct mem_node
*x
, *y
;
3752 if (!z
|| z
== MEM_NIL
)
3755 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
3760 while (y
->left
!= MEM_NIL
)
3764 if (y
->left
!= MEM_NIL
)
3769 x
->parent
= y
->parent
;
3772 if (y
== y
->parent
->left
)
3773 y
->parent
->left
= x
;
3775 y
->parent
->right
= x
;
3782 z
->start
= y
->start
;
3787 if (y
->color
== MEM_BLACK
)
3788 mem_delete_fixup (x
);
3790 #ifdef GC_MALLOC_CHECK
3798 /* Re-establish the red-black properties of the tree, after a
3802 mem_delete_fixup (x
)
3805 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
3807 if (x
== x
->parent
->left
)
3809 struct mem_node
*w
= x
->parent
->right
;
3811 if (w
->color
== MEM_RED
)
3813 w
->color
= MEM_BLACK
;
3814 x
->parent
->color
= MEM_RED
;
3815 mem_rotate_left (x
->parent
);
3816 w
= x
->parent
->right
;
3819 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
3826 if (w
->right
->color
== MEM_BLACK
)
3828 w
->left
->color
= MEM_BLACK
;
3830 mem_rotate_right (w
);
3831 w
= x
->parent
->right
;
3833 w
->color
= x
->parent
->color
;
3834 x
->parent
->color
= MEM_BLACK
;
3835 w
->right
->color
= MEM_BLACK
;
3836 mem_rotate_left (x
->parent
);
3842 struct mem_node
*w
= x
->parent
->left
;
3844 if (w
->color
== MEM_RED
)
3846 w
->color
= MEM_BLACK
;
3847 x
->parent
->color
= MEM_RED
;
3848 mem_rotate_right (x
->parent
);
3849 w
= x
->parent
->left
;
3852 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
3859 if (w
->left
->color
== MEM_BLACK
)
3861 w
->right
->color
= MEM_BLACK
;
3863 mem_rotate_left (w
);
3864 w
= x
->parent
->left
;
3867 w
->color
= x
->parent
->color
;
3868 x
->parent
->color
= MEM_BLACK
;
3869 w
->left
->color
= MEM_BLACK
;
3870 mem_rotate_right (x
->parent
);
3876 x
->color
= MEM_BLACK
;
3880 /* Value is non-zero if P is a pointer to a live Lisp string on
3881 the heap. M is a pointer to the mem_block for P. */
3884 live_string_p (m
, p
)
3888 if (m
->type
== MEM_TYPE_STRING
)
3890 struct string_block
*b
= (struct string_block
*) m
->start
;
3891 int offset
= (char *) p
- (char *) &b
->strings
[0];
3893 /* P must point to the start of a Lisp_String structure, and it
3894 must not be on the free-list. */
3896 && offset
% sizeof b
->strings
[0] == 0
3897 && offset
< (STRING_BLOCK_SIZE
* sizeof b
->strings
[0])
3898 && ((struct Lisp_String
*) p
)->data
!= NULL
);
3905 /* Value is non-zero if P is a pointer to a live Lisp cons on
3906 the heap. M is a pointer to the mem_block for P. */
3913 if (m
->type
== MEM_TYPE_CONS
)
3915 struct cons_block
*b
= (struct cons_block
*) m
->start
;
3916 int offset
= (char *) p
- (char *) &b
->conses
[0];
3918 /* P must point to the start of a Lisp_Cons, not be
3919 one of the unused cells in the current cons block,
3920 and not be on the free-list. */
3922 && offset
% sizeof b
->conses
[0] == 0
3923 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
3925 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
3926 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
3933 /* Value is non-zero if P is a pointer to a live Lisp symbol on
3934 the heap. M is a pointer to the mem_block for P. */
3937 live_symbol_p (m
, p
)
3941 if (m
->type
== MEM_TYPE_SYMBOL
)
3943 struct symbol_block
*b
= (struct symbol_block
*) m
->start
;
3944 int offset
= (char *) p
- (char *) &b
->symbols
[0];
3946 /* P must point to the start of a Lisp_Symbol, not be
3947 one of the unused cells in the current symbol block,
3948 and not be on the free-list. */
3950 && offset
% sizeof b
->symbols
[0] == 0
3951 && offset
< (SYMBOL_BLOCK_SIZE
* sizeof b
->symbols
[0])
3952 && (b
!= symbol_block
3953 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
3954 && !EQ (((struct Lisp_Symbol
*) p
)->function
, Vdead
));
3961 /* Value is non-zero if P is a pointer to a live Lisp float on
3962 the heap. M is a pointer to the mem_block for P. */
3969 if (m
->type
== MEM_TYPE_FLOAT
)
3971 struct float_block
*b
= (struct float_block
*) m
->start
;
3972 int offset
= (char *) p
- (char *) &b
->floats
[0];
3974 /* P must point to the start of a Lisp_Float and not be
3975 one of the unused cells in the current float block. */
3977 && offset
% sizeof b
->floats
[0] == 0
3978 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
3979 && (b
!= float_block
3980 || offset
/ sizeof b
->floats
[0] < float_block_index
));
3987 /* Value is non-zero if P is a pointer to a live Lisp Misc on
3988 the heap. M is a pointer to the mem_block for P. */
3995 if (m
->type
== MEM_TYPE_MISC
)
3997 struct marker_block
*b
= (struct marker_block
*) m
->start
;
3998 int offset
= (char *) p
- (char *) &b
->markers
[0];
4000 /* P must point to the start of a Lisp_Misc, not be
4001 one of the unused cells in the current misc block,
4002 and not be on the free-list. */
4004 && offset
% sizeof b
->markers
[0] == 0
4005 && offset
< (MARKER_BLOCK_SIZE
* sizeof b
->markers
[0])
4006 && (b
!= marker_block
4007 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
4008 && ((union Lisp_Misc
*) p
)->u_any
.type
!= Lisp_Misc_Free
);
4015 /* Value is non-zero if P is a pointer to a live vector-like object.
4016 M is a pointer to the mem_block for P. */
4019 live_vector_p (m
, p
)
4023 return (p
== m
->start
&& m
->type
== MEM_TYPE_VECTORLIKE
);
4027 /* Value is non-zero if P is a pointer to a live buffer. M is a
4028 pointer to the mem_block for P. */
4031 live_buffer_p (m
, p
)
4035 /* P must point to the start of the block, and the buffer
4036 must not have been killed. */
4037 return (m
->type
== MEM_TYPE_BUFFER
4039 && !NILP (((struct buffer
*) p
)->name
));
4042 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
4046 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4048 /* Array of objects that are kept alive because the C stack contains
4049 a pattern that looks like a reference to them . */
4051 #define MAX_ZOMBIES 10
4052 static Lisp_Object zombies
[MAX_ZOMBIES
];
4054 /* Number of zombie objects. */
4056 static int nzombies
;
4058 /* Number of garbage collections. */
4062 /* Average percentage of zombies per collection. */
4064 static double avg_zombies
;
4066 /* Max. number of live and zombie objects. */
4068 static int max_live
, max_zombies
;
4070 /* Average number of live objects per GC. */
4072 static double avg_live
;
4074 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
4075 doc
: /* Show information about live and zombie objects. */)
4078 Lisp_Object args
[8], zombie_list
= Qnil
;
4080 for (i
= 0; i
< nzombies
; i
++)
4081 zombie_list
= Fcons (zombies
[i
], zombie_list
);
4082 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
4083 args
[1] = make_number (ngcs
);
4084 args
[2] = make_float (avg_live
);
4085 args
[3] = make_float (avg_zombies
);
4086 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
4087 args
[5] = make_number (max_live
);
4088 args
[6] = make_number (max_zombies
);
4089 args
[7] = zombie_list
;
4090 return Fmessage (8, args
);
4093 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4096 /* Mark OBJ if we can prove it's a Lisp_Object. */
4099 mark_maybe_object (obj
)
4102 void *po
= (void *) XPNTR (obj
);
4103 struct mem_node
*m
= mem_find (po
);
4109 switch (XTYPE (obj
))
4112 mark_p
= (live_string_p (m
, po
)
4113 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
4117 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
4121 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
4125 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
4128 case Lisp_Vectorlike
:
4129 /* Note: can't check BUFFERP before we know it's a
4130 buffer because checking that dereferences the pointer
4131 PO which might point anywhere. */
4132 if (live_vector_p (m
, po
))
4133 mark_p
= !SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
4134 else if (live_buffer_p (m
, po
))
4135 mark_p
= BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
4139 mark_p
= (live_misc_p (m
, po
) && !XMISCANY (obj
)->gcmarkbit
);
4148 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4149 if (nzombies
< MAX_ZOMBIES
)
4150 zombies
[nzombies
] = obj
;
4159 /* If P points to Lisp data, mark that as live if it isn't already
4163 mark_maybe_pointer (p
)
4168 /* Quickly rule out some values which can't point to Lisp data. */
4171 8 /* USE_LSB_TAG needs Lisp data to be aligned on multiples of 8. */
4173 2 /* We assume that Lisp data is aligned on even addresses. */
4181 Lisp_Object obj
= Qnil
;
4185 case MEM_TYPE_NON_LISP
:
4186 /* Nothing to do; not a pointer to Lisp memory. */
4189 case MEM_TYPE_BUFFER
:
4190 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P((struct buffer
*)p
))
4191 XSETVECTOR (obj
, p
);
4195 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
4199 case MEM_TYPE_STRING
:
4200 if (live_string_p (m
, p
)
4201 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
4202 XSETSTRING (obj
, p
);
4206 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
4210 case MEM_TYPE_SYMBOL
:
4211 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
4212 XSETSYMBOL (obj
, p
);
4215 case MEM_TYPE_FLOAT
:
4216 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
4220 case MEM_TYPE_VECTORLIKE
:
4221 if (live_vector_p (m
, p
))
4224 XSETVECTOR (tem
, p
);
4225 if (!SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
4240 /* Mark Lisp objects referenced from the address range START+OFFSET..END
4241 or END+OFFSET..START. */
4244 mark_memory (start
, end
, offset
)
4251 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4255 /* Make START the pointer to the start of the memory region,
4256 if it isn't already. */
4264 /* Mark Lisp_Objects. */
4265 for (p
= (Lisp_Object
*) ((char *) start
+ offset
); (void *) p
< end
; ++p
)
4266 mark_maybe_object (*p
);
4268 /* Mark Lisp data pointed to. This is necessary because, in some
4269 situations, the C compiler optimizes Lisp objects away, so that
4270 only a pointer to them remains. Example:
4272 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
4275 Lisp_Object obj = build_string ("test");
4276 struct Lisp_String *s = XSTRING (obj);
4277 Fgarbage_collect ();
4278 fprintf (stderr, "test `%s'\n", s->data);
4282 Here, `obj' isn't really used, and the compiler optimizes it
4283 away. The only reference to the life string is through the
4286 for (pp
= (void **) ((char *) start
+ offset
); (void *) pp
< end
; ++pp
)
4287 mark_maybe_pointer (*pp
);
4290 /* setjmp will work with GCC unless NON_SAVING_SETJMP is defined in
4291 the GCC system configuration. In gcc 3.2, the only systems for
4292 which this is so are i386-sco5 non-ELF, i386-sysv3 (maybe included
4293 by others?) and ns32k-pc532-min. */
4295 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
4297 static int setjmp_tested_p
, longjmps_done
;
4299 #define SETJMP_WILL_LIKELY_WORK "\
4301 Emacs garbage collector has been changed to use conservative stack\n\
4302 marking. Emacs has determined that the method it uses to do the\n\
4303 marking will likely work on your system, but this isn't sure.\n\
4305 If you are a system-programmer, or can get the help of a local wizard\n\
4306 who is, please take a look at the function mark_stack in alloc.c, and\n\
4307 verify that the methods used are appropriate for your system.\n\
4309 Please mail the result to <emacs-devel@gnu.org>.\n\
4312 #define SETJMP_WILL_NOT_WORK "\
4314 Emacs garbage collector has been changed to use conservative stack\n\
4315 marking. Emacs has determined that the default method it uses to do the\n\
4316 marking will not work on your system. We will need a system-dependent\n\
4317 solution for your system.\n\
4319 Please take a look at the function mark_stack in alloc.c, and\n\
4320 try to find a way to make it work on your system.\n\
4322 Note that you may get false negatives, depending on the compiler.\n\
4323 In particular, you need to use -O with GCC for this test.\n\
4325 Please mail the result to <emacs-devel@gnu.org>.\n\
4329 /* Perform a quick check if it looks like setjmp saves registers in a
4330 jmp_buf. Print a message to stderr saying so. When this test
4331 succeeds, this is _not_ a proof that setjmp is sufficient for
4332 conservative stack marking. Only the sources or a disassembly
4343 /* Arrange for X to be put in a register. */
4349 if (longjmps_done
== 1)
4351 /* Came here after the longjmp at the end of the function.
4353 If x == 1, the longjmp has restored the register to its
4354 value before the setjmp, and we can hope that setjmp
4355 saves all such registers in the jmp_buf, although that
4358 For other values of X, either something really strange is
4359 taking place, or the setjmp just didn't save the register. */
4362 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
4365 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
4372 if (longjmps_done
== 1)
4376 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
4379 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4381 /* Abort if anything GCPRO'd doesn't survive the GC. */
4389 for (p
= gcprolist
; p
; p
= p
->next
)
4390 for (i
= 0; i
< p
->nvars
; ++i
)
4391 if (!survives_gc_p (p
->var
[i
]))
4392 /* FIXME: It's not necessarily a bug. It might just be that the
4393 GCPRO is unnecessary or should release the object sooner. */
4397 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4404 fprintf (stderr
, "\nZombies kept alive = %d:\n", nzombies
);
4405 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
4407 fprintf (stderr
, " %d = ", i
);
4408 debug_print (zombies
[i
]);
4412 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4415 /* Mark live Lisp objects on the C stack.
4417 There are several system-dependent problems to consider when
4418 porting this to new architectures:
4422 We have to mark Lisp objects in CPU registers that can hold local
4423 variables or are used to pass parameters.
4425 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
4426 something that either saves relevant registers on the stack, or
4427 calls mark_maybe_object passing it each register's contents.
4429 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
4430 implementation assumes that calling setjmp saves registers we need
4431 to see in a jmp_buf which itself lies on the stack. This doesn't
4432 have to be true! It must be verified for each system, possibly
4433 by taking a look at the source code of setjmp.
4437 Architectures differ in the way their processor stack is organized.
4438 For example, the stack might look like this
4441 | Lisp_Object | size = 4
4443 | something else | size = 2
4445 | Lisp_Object | size = 4
4449 In such a case, not every Lisp_Object will be aligned equally. To
4450 find all Lisp_Object on the stack it won't be sufficient to walk
4451 the stack in steps of 4 bytes. Instead, two passes will be
4452 necessary, one starting at the start of the stack, and a second
4453 pass starting at the start of the stack + 2. Likewise, if the
4454 minimal alignment of Lisp_Objects on the stack is 1, four passes
4455 would be necessary, each one starting with one byte more offset
4456 from the stack start.
4458 The current code assumes by default that Lisp_Objects are aligned
4459 equally on the stack. */
4465 /* jmp_buf may not be aligned enough on darwin-ppc64 */
4466 union aligned_jmpbuf
{
4470 volatile int stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
4473 /* This trick flushes the register windows so that all the state of
4474 the process is contained in the stack. */
4475 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
4476 needed on ia64 too. See mach_dep.c, where it also says inline
4477 assembler doesn't work with relevant proprietary compilers. */
4479 #if defined (__sparc64__) && defined (__FreeBSD__)
4480 /* FreeBSD does not have a ta 3 handler. */
4487 /* Save registers that we need to see on the stack. We need to see
4488 registers used to hold register variables and registers used to
4490 #ifdef GC_SAVE_REGISTERS_ON_STACK
4491 GC_SAVE_REGISTERS_ON_STACK (end
);
4492 #else /* not GC_SAVE_REGISTERS_ON_STACK */
4494 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
4495 setjmp will definitely work, test it
4496 and print a message with the result
4498 if (!setjmp_tested_p
)
4500 setjmp_tested_p
= 1;
4503 #endif /* GC_SETJMP_WORKS */
4506 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
4507 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
4509 /* This assumes that the stack is a contiguous region in memory. If
4510 that's not the case, something has to be done here to iterate
4511 over the stack segments. */
4512 #ifndef GC_LISP_OBJECT_ALIGNMENT
4514 #define GC_LISP_OBJECT_ALIGNMENT __alignof__ (Lisp_Object)
4516 #define GC_LISP_OBJECT_ALIGNMENT sizeof (Lisp_Object)
4519 for (i
= 0; i
< sizeof (Lisp_Object
); i
+= GC_LISP_OBJECT_ALIGNMENT
)
4520 mark_memory (stack_base
, end
, i
);
4521 /* Allow for marking a secondary stack, like the register stack on the
4523 #ifdef GC_MARK_SECONDARY_STACK
4524 GC_MARK_SECONDARY_STACK ();
4527 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4532 #endif /* GC_MARK_STACK != 0 */
4535 /* Determine whether it is safe to access memory at address P. */
4541 return w32_valid_pointer_p (p
, 16);
4545 /* Obviously, we cannot just access it (we would SEGV trying), so we
4546 trick the o/s to tell us whether p is a valid pointer.
4547 Unfortunately, we cannot use NULL_DEVICE here, as emacs_write may
4548 not validate p in that case. */
4550 if ((fd
= emacs_open ("__Valid__Lisp__Object__", O_CREAT
| O_WRONLY
| O_TRUNC
, 0666)) >= 0)
4552 int valid
= (emacs_write (fd
, (char *)p
, 16) == 16);
4554 unlink ("__Valid__Lisp__Object__");
4562 /* Return 1 if OBJ is a valid lisp object.
4563 Return 0 if OBJ is NOT a valid lisp object.
4564 Return -1 if we cannot validate OBJ.
4565 This function can be quite slow,
4566 so it should only be used in code for manual debugging. */
4569 valid_lisp_object_p (obj
)
4580 p
= (void *) XPNTR (obj
);
4581 if (PURE_POINTER_P (p
))
4585 return valid_pointer_p (p
);
4592 int valid
= valid_pointer_p (p
);
4604 case MEM_TYPE_NON_LISP
:
4607 case MEM_TYPE_BUFFER
:
4608 return live_buffer_p (m
, p
);
4611 return live_cons_p (m
, p
);
4613 case MEM_TYPE_STRING
:
4614 return live_string_p (m
, p
);
4617 return live_misc_p (m
, p
);
4619 case MEM_TYPE_SYMBOL
:
4620 return live_symbol_p (m
, p
);
4622 case MEM_TYPE_FLOAT
:
4623 return live_float_p (m
, p
);
4625 case MEM_TYPE_VECTORLIKE
:
4626 return live_vector_p (m
, p
);
4639 /***********************************************************************
4640 Pure Storage Management
4641 ***********************************************************************/
4643 /* Allocate room for SIZE bytes from pure Lisp storage and return a
4644 pointer to it. TYPE is the Lisp type for which the memory is
4645 allocated. TYPE < 0 means it's not used for a Lisp object. */
4647 static POINTER_TYPE
*
4648 pure_alloc (size
, type
)
4652 POINTER_TYPE
*result
;
4654 size_t alignment
= (1 << GCTYPEBITS
);
4656 size_t alignment
= sizeof (EMACS_INT
);
4658 /* Give Lisp_Floats an extra alignment. */
4659 if (type
== Lisp_Float
)
4661 #if defined __GNUC__ && __GNUC__ >= 2
4662 alignment
= __alignof (struct Lisp_Float
);
4664 alignment
= sizeof (struct Lisp_Float
);
4672 /* Allocate space for a Lisp object from the beginning of the free
4673 space with taking account of alignment. */
4674 result
= ALIGN (purebeg
+ pure_bytes_used_lisp
, alignment
);
4675 pure_bytes_used_lisp
= ((char *)result
- (char *)purebeg
) + size
;
4679 /* Allocate space for a non-Lisp object from the end of the free
4681 pure_bytes_used_non_lisp
+= size
;
4682 result
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4684 pure_bytes_used
= pure_bytes_used_lisp
+ pure_bytes_used_non_lisp
;
4686 if (pure_bytes_used
<= pure_size
)
4689 /* Don't allocate a large amount here,
4690 because it might get mmap'd and then its address
4691 might not be usable. */
4692 purebeg
= (char *) xmalloc (10000);
4694 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
4695 pure_bytes_used
= 0;
4696 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
4701 /* Print a warning if PURESIZE is too small. */
4706 if (pure_bytes_used_before_overflow
)
4707 message ("emacs:0:Pure Lisp storage overflow (approx. %d bytes needed)",
4708 (int) (pure_bytes_used
+ pure_bytes_used_before_overflow
));
4712 /* Find the byte sequence {DATA[0], ..., DATA[NBYTES-1], '\0'} from
4713 the non-Lisp data pool of the pure storage, and return its start
4714 address. Return NULL if not found. */
4717 find_string_data_in_pure (data
, nbytes
)
4721 int i
, skip
, bm_skip
[256], last_char_skip
, infinity
, start
, start_max
;
4722 const unsigned char *p
;
4725 if (pure_bytes_used_non_lisp
< nbytes
+ 1)
4728 /* Set up the Boyer-Moore table. */
4730 for (i
= 0; i
< 256; i
++)
4733 p
= (const unsigned char *) data
;
4735 bm_skip
[*p
++] = skip
;
4737 last_char_skip
= bm_skip
['\0'];
4739 non_lisp_beg
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4740 start_max
= pure_bytes_used_non_lisp
- (nbytes
+ 1);
4742 /* See the comments in the function `boyer_moore' (search.c) for the
4743 use of `infinity'. */
4744 infinity
= pure_bytes_used_non_lisp
+ 1;
4745 bm_skip
['\0'] = infinity
;
4747 p
= (const unsigned char *) non_lisp_beg
+ nbytes
;
4751 /* Check the last character (== '\0'). */
4754 start
+= bm_skip
[*(p
+ start
)];
4756 while (start
<= start_max
);
4758 if (start
< infinity
)
4759 /* Couldn't find the last character. */
4762 /* No less than `infinity' means we could find the last
4763 character at `p[start - infinity]'. */
4766 /* Check the remaining characters. */
4767 if (memcmp (data
, non_lisp_beg
+ start
, nbytes
) == 0)
4769 return non_lisp_beg
+ start
;
4771 start
+= last_char_skip
;
4773 while (start
<= start_max
);
4779 /* Return a string allocated in pure space. DATA is a buffer holding
4780 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
4781 non-zero means make the result string multibyte.
4783 Must get an error if pure storage is full, since if it cannot hold
4784 a large string it may be able to hold conses that point to that
4785 string; then the string is not protected from gc. */
4788 make_pure_string (data
, nchars
, nbytes
, multibyte
)
4794 struct Lisp_String
*s
;
4796 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4797 s
->data
= find_string_data_in_pure (data
, nbytes
);
4798 if (s
->data
== NULL
)
4800 s
->data
= (unsigned char *) pure_alloc (nbytes
+ 1, -1);
4801 bcopy (data
, s
->data
, nbytes
);
4802 s
->data
[nbytes
] = '\0';
4805 s
->size_byte
= multibyte
? nbytes
: -1;
4806 s
->intervals
= NULL_INTERVAL
;
4807 XSETSTRING (string
, s
);
4811 /* Return a string a string allocated in pure space. Do not allocate
4812 the string data, just point to DATA. */
4815 make_pure_c_string (const char *data
)
4818 struct Lisp_String
*s
;
4819 int nchars
= strlen (data
);
4821 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4824 s
->data
= (unsigned char *) data
;
4825 s
->intervals
= NULL_INTERVAL
;
4826 XSETSTRING (string
, s
);
4830 /* Return a cons allocated from pure space. Give it pure copies
4831 of CAR as car and CDR as cdr. */
4834 pure_cons (car
, cdr
)
4835 Lisp_Object car
, cdr
;
4837 register Lisp_Object
new;
4838 struct Lisp_Cons
*p
;
4840 p
= (struct Lisp_Cons
*) pure_alloc (sizeof *p
, Lisp_Cons
);
4842 XSETCAR (new, Fpurecopy (car
));
4843 XSETCDR (new, Fpurecopy (cdr
));
4848 /* Value is a float object with value NUM allocated from pure space. */
4851 make_pure_float (num
)
4854 register Lisp_Object
new;
4855 struct Lisp_Float
*p
;
4857 p
= (struct Lisp_Float
*) pure_alloc (sizeof *p
, Lisp_Float
);
4859 XFLOAT_INIT (new, num
);
4864 /* Return a vector with room for LEN Lisp_Objects allocated from
4868 make_pure_vector (len
)
4872 struct Lisp_Vector
*p
;
4873 size_t size
= sizeof *p
+ (len
- 1) * sizeof (Lisp_Object
);
4875 p
= (struct Lisp_Vector
*) pure_alloc (size
, Lisp_Vectorlike
);
4876 XSETVECTOR (new, p
);
4877 XVECTOR (new)->size
= len
;
4882 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
4883 doc
: /* Make a copy of object OBJ in pure storage.
4884 Recursively copies contents of vectors and cons cells.
4885 Does not copy symbols. Copies strings without text properties. */)
4887 register Lisp_Object obj
;
4889 if (NILP (Vpurify_flag
))
4892 if (PURE_POINTER_P (XPNTR (obj
)))
4895 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
4897 Lisp_Object tmp
= Fgethash (obj
, Vpurify_flag
, Qnil
);
4903 obj
= pure_cons (XCAR (obj
), XCDR (obj
));
4904 else if (FLOATP (obj
))
4905 obj
= make_pure_float (XFLOAT_DATA (obj
));
4906 else if (STRINGP (obj
))
4907 obj
= make_pure_string (SDATA (obj
), SCHARS (obj
),
4909 STRING_MULTIBYTE (obj
));
4910 else if (COMPILEDP (obj
) || VECTORP (obj
))
4912 register struct Lisp_Vector
*vec
;
4916 size
= XVECTOR (obj
)->size
;
4917 if (size
& PSEUDOVECTOR_FLAG
)
4918 size
&= PSEUDOVECTOR_SIZE_MASK
;
4919 vec
= XVECTOR (make_pure_vector (size
));
4920 for (i
= 0; i
< size
; i
++)
4921 vec
->contents
[i
] = Fpurecopy (XVECTOR (obj
)->contents
[i
]);
4922 if (COMPILEDP (obj
))
4924 XSETPVECTYPE (vec
, PVEC_COMPILED
);
4925 XSETCOMPILED (obj
, vec
);
4928 XSETVECTOR (obj
, vec
);
4930 else if (MARKERP (obj
))
4931 error ("Attempt to copy a marker to pure storage");
4933 /* Not purified, don't hash-cons. */
4936 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
4937 Fputhash (obj
, obj
, Vpurify_flag
);
4944 /***********************************************************************
4946 ***********************************************************************/
4948 /* Put an entry in staticvec, pointing at the variable with address
4952 staticpro (varaddress
)
4953 Lisp_Object
*varaddress
;
4955 staticvec
[staticidx
++] = varaddress
;
4956 if (staticidx
>= NSTATICS
)
4961 /***********************************************************************
4963 ***********************************************************************/
4965 /* Temporarily prevent garbage collection. */
4968 inhibit_garbage_collection ()
4970 int count
= SPECPDL_INDEX ();
4971 int nbits
= min (VALBITS
, BITS_PER_INT
);
4973 specbind (Qgc_cons_threshold
, make_number (((EMACS_INT
) 1 << (nbits
- 1)) - 1));
4978 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
4979 doc
: /* Reclaim storage for Lisp objects no longer needed.
4980 Garbage collection happens automatically if you cons more than
4981 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
4982 `garbage-collect' normally returns a list with info on amount of space in use:
4983 ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)
4984 (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS
4985 (USED-FLOATS . FREE-FLOATS) (USED-INTERVALS . FREE-INTERVALS)
4986 (USED-STRINGS . FREE-STRINGS))
4987 However, if there was overflow in pure space, `garbage-collect'
4988 returns nil, because real GC can't be done. */)
4991 register struct specbinding
*bind
;
4992 struct catchtag
*catch;
4993 struct handler
*handler
;
4994 char stack_top_variable
;
4997 Lisp_Object total
[8];
4998 int count
= SPECPDL_INDEX ();
4999 EMACS_TIME t1
, t2
, t3
;
5004 /* Can't GC if pure storage overflowed because we can't determine
5005 if something is a pure object or not. */
5006 if (pure_bytes_used_before_overflow
)
5011 /* Don't keep undo information around forever.
5012 Do this early on, so it is no problem if the user quits. */
5014 register struct buffer
*nextb
= all_buffers
;
5018 /* If a buffer's undo list is Qt, that means that undo is
5019 turned off in that buffer. Calling truncate_undo_list on
5020 Qt tends to return NULL, which effectively turns undo back on.
5021 So don't call truncate_undo_list if undo_list is Qt. */
5022 if (! NILP (nextb
->name
) && ! EQ (nextb
->undo_list
, Qt
))
5023 truncate_undo_list (nextb
);
5025 /* Shrink buffer gaps, but skip indirect and dead buffers. */
5026 if (nextb
->base_buffer
== 0 && !NILP (nextb
->name
)
5027 && ! nextb
->text
->inhibit_shrinking
)
5029 /* If a buffer's gap size is more than 10% of the buffer
5030 size, or larger than 2000 bytes, then shrink it
5031 accordingly. Keep a minimum size of 20 bytes. */
5032 int size
= min (2000, max (20, (nextb
->text
->z_byte
/ 10)));
5034 if (nextb
->text
->gap_size
> size
)
5036 struct buffer
*save_current
= current_buffer
;
5037 current_buffer
= nextb
;
5038 make_gap (-(nextb
->text
->gap_size
- size
));
5039 current_buffer
= save_current
;
5043 nextb
= nextb
->next
;
5047 EMACS_GET_TIME (t1
);
5049 /* In case user calls debug_print during GC,
5050 don't let that cause a recursive GC. */
5051 consing_since_gc
= 0;
5053 /* Save what's currently displayed in the echo area. */
5054 message_p
= push_message ();
5055 record_unwind_protect (pop_message_unwind
, Qnil
);
5057 /* Save a copy of the contents of the stack, for debugging. */
5058 #if MAX_SAVE_STACK > 0
5059 if (NILP (Vpurify_flag
))
5061 i
= &stack_top_variable
- stack_bottom
;
5063 if (i
< MAX_SAVE_STACK
)
5065 if (stack_copy
== 0)
5066 stack_copy
= (char *) xmalloc (stack_copy_size
= i
);
5067 else if (stack_copy_size
< i
)
5068 stack_copy
= (char *) xrealloc (stack_copy
, (stack_copy_size
= i
));
5071 if ((EMACS_INT
) (&stack_top_variable
- stack_bottom
) > 0)
5072 bcopy (stack_bottom
, stack_copy
, i
);
5074 bcopy (&stack_top_variable
, stack_copy
, i
);
5078 #endif /* MAX_SAVE_STACK > 0 */
5080 if (garbage_collection_messages
)
5081 message1_nolog ("Garbage collecting...");
5085 shrink_regexp_cache ();
5089 /* clear_marks (); */
5091 /* Mark all the special slots that serve as the roots of accessibility. */
5093 for (i
= 0; i
< staticidx
; i
++)
5094 mark_object (*staticvec
[i
]);
5096 for (bind
= specpdl
; bind
!= specpdl_ptr
; bind
++)
5098 mark_object (bind
->symbol
);
5099 mark_object (bind
->old_value
);
5107 extern void xg_mark_data ();
5112 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
5113 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
5117 register struct gcpro
*tail
;
5118 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
5119 for (i
= 0; i
< tail
->nvars
; i
++)
5120 mark_object (tail
->var
[i
]);
5125 for (catch = catchlist
; catch; catch = catch->next
)
5127 mark_object (catch->tag
);
5128 mark_object (catch->val
);
5130 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
5132 mark_object (handler
->handler
);
5133 mark_object (handler
->var
);
5137 #ifdef HAVE_WINDOW_SYSTEM
5138 mark_fringe_data ();
5141 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5145 /* Everything is now marked, except for the things that require special
5146 finalization, i.e. the undo_list.
5147 Look thru every buffer's undo list
5148 for elements that update markers that were not marked,
5151 register struct buffer
*nextb
= all_buffers
;
5155 /* If a buffer's undo list is Qt, that means that undo is
5156 turned off in that buffer. Calling truncate_undo_list on
5157 Qt tends to return NULL, which effectively turns undo back on.
5158 So don't call truncate_undo_list if undo_list is Qt. */
5159 if (! EQ (nextb
->undo_list
, Qt
))
5161 Lisp_Object tail
, prev
;
5162 tail
= nextb
->undo_list
;
5164 while (CONSP (tail
))
5166 if (CONSP (XCAR (tail
))
5167 && MARKERP (XCAR (XCAR (tail
)))
5168 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
5171 nextb
->undo_list
= tail
= XCDR (tail
);
5175 XSETCDR (prev
, tail
);
5185 /* Now that we have stripped the elements that need not be in the
5186 undo_list any more, we can finally mark the list. */
5187 mark_object (nextb
->undo_list
);
5189 nextb
= nextb
->next
;
5195 /* Clear the mark bits that we set in certain root slots. */
5197 unmark_byte_stack ();
5198 VECTOR_UNMARK (&buffer_defaults
);
5199 VECTOR_UNMARK (&buffer_local_symbols
);
5201 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
5209 /* clear_marks (); */
5212 consing_since_gc
= 0;
5213 if (gc_cons_threshold
< 10000)
5214 gc_cons_threshold
= 10000;
5216 if (FLOATP (Vgc_cons_percentage
))
5217 { /* Set gc_cons_combined_threshold. */
5218 EMACS_INT total
= 0;
5220 total
+= total_conses
* sizeof (struct Lisp_Cons
);
5221 total
+= total_symbols
* sizeof (struct Lisp_Symbol
);
5222 total
+= total_markers
* sizeof (union Lisp_Misc
);
5223 total
+= total_string_size
;
5224 total
+= total_vector_size
* sizeof (Lisp_Object
);
5225 total
+= total_floats
* sizeof (struct Lisp_Float
);
5226 total
+= total_intervals
* sizeof (struct interval
);
5227 total
+= total_strings
* sizeof (struct Lisp_String
);
5229 gc_relative_threshold
= total
* XFLOAT_DATA (Vgc_cons_percentage
);
5232 gc_relative_threshold
= 0;
5234 if (garbage_collection_messages
)
5236 if (message_p
|| minibuf_level
> 0)
5239 message1_nolog ("Garbage collecting...done");
5242 unbind_to (count
, Qnil
);
5244 total
[0] = Fcons (make_number (total_conses
),
5245 make_number (total_free_conses
));
5246 total
[1] = Fcons (make_number (total_symbols
),
5247 make_number (total_free_symbols
));
5248 total
[2] = Fcons (make_number (total_markers
),
5249 make_number (total_free_markers
));
5250 total
[3] = make_number (total_string_size
);
5251 total
[4] = make_number (total_vector_size
);
5252 total
[5] = Fcons (make_number (total_floats
),
5253 make_number (total_free_floats
));
5254 total
[6] = Fcons (make_number (total_intervals
),
5255 make_number (total_free_intervals
));
5256 total
[7] = Fcons (make_number (total_strings
),
5257 make_number (total_free_strings
));
5259 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5261 /* Compute average percentage of zombies. */
5264 for (i
= 0; i
< 7; ++i
)
5265 if (CONSP (total
[i
]))
5266 nlive
+= XFASTINT (XCAR (total
[i
]));
5268 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
5269 max_live
= max (nlive
, max_live
);
5270 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
5271 max_zombies
= max (nzombies
, max_zombies
);
5276 if (!NILP (Vpost_gc_hook
))
5278 int count
= inhibit_garbage_collection ();
5279 safe_run_hooks (Qpost_gc_hook
);
5280 unbind_to (count
, Qnil
);
5283 /* Accumulate statistics. */
5284 EMACS_GET_TIME (t2
);
5285 EMACS_SUB_TIME (t3
, t2
, t1
);
5286 if (FLOATP (Vgc_elapsed
))
5287 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
) +
5289 EMACS_USECS (t3
) * 1.0e-6);
5292 return Flist (sizeof total
/ sizeof *total
, total
);
5296 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
5297 only interesting objects referenced from glyphs are strings. */
5300 mark_glyph_matrix (matrix
)
5301 struct glyph_matrix
*matrix
;
5303 struct glyph_row
*row
= matrix
->rows
;
5304 struct glyph_row
*end
= row
+ matrix
->nrows
;
5306 for (; row
< end
; ++row
)
5310 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
5312 struct glyph
*glyph
= row
->glyphs
[area
];
5313 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
5315 for (; glyph
< end_glyph
; ++glyph
)
5316 if (STRINGP (glyph
->object
)
5317 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
5318 mark_object (glyph
->object
);
5324 /* Mark Lisp faces in the face cache C. */
5328 struct face_cache
*c
;
5333 for (i
= 0; i
< c
->used
; ++i
)
5335 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
5339 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
5340 mark_object (face
->lface
[j
]);
5348 /* Mark reference to a Lisp_Object.
5349 If the object referred to has not been seen yet, recursively mark
5350 all the references contained in it. */
5352 #define LAST_MARKED_SIZE 500
5353 static Lisp_Object last_marked
[LAST_MARKED_SIZE
];
5354 int last_marked_index
;
5356 /* For debugging--call abort when we cdr down this many
5357 links of a list, in mark_object. In debugging,
5358 the call to abort will hit a breakpoint.
5359 Normally this is zero and the check never goes off. */
5360 static int mark_object_loop_halt
;
5363 mark_vectorlike (ptr
)
5364 struct Lisp_Vector
*ptr
;
5366 register EMACS_INT size
= ptr
->size
;
5369 eassert (!VECTOR_MARKED_P (ptr
));
5370 VECTOR_MARK (ptr
); /* Else mark it */
5371 if (size
& PSEUDOVECTOR_FLAG
)
5372 size
&= PSEUDOVECTOR_SIZE_MASK
;
5374 /* Note that this size is not the memory-footprint size, but only
5375 the number of Lisp_Object fields that we should trace.
5376 The distinction is used e.g. by Lisp_Process which places extra
5377 non-Lisp_Object fields at the end of the structure. */
5378 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5379 mark_object (ptr
->contents
[i
]);
5382 /* Like mark_vectorlike but optimized for char-tables (and
5383 sub-char-tables) assuming that the contents are mostly integers or
5387 mark_char_table (ptr
)
5388 struct Lisp_Vector
*ptr
;
5390 register EMACS_INT size
= ptr
->size
& PSEUDOVECTOR_SIZE_MASK
;
5393 eassert (!VECTOR_MARKED_P (ptr
));
5395 for (i
= 0; i
< size
; i
++)
5397 Lisp_Object val
= ptr
->contents
[i
];
5399 if (INTEGERP (val
) || SYMBOLP (val
) && XSYMBOL (val
)->gcmarkbit
)
5401 if (SUB_CHAR_TABLE_P (val
))
5403 if (! VECTOR_MARKED_P (XVECTOR (val
)))
5404 mark_char_table (XVECTOR (val
));
5415 register Lisp_Object obj
= arg
;
5416 #ifdef GC_CHECK_MARKED_OBJECTS
5424 if (PURE_POINTER_P (XPNTR (obj
)))
5427 last_marked
[last_marked_index
++] = obj
;
5428 if (last_marked_index
== LAST_MARKED_SIZE
)
5429 last_marked_index
= 0;
5431 /* Perform some sanity checks on the objects marked here. Abort if
5432 we encounter an object we know is bogus. This increases GC time
5433 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
5434 #ifdef GC_CHECK_MARKED_OBJECTS
5436 po
= (void *) XPNTR (obj
);
5438 /* Check that the object pointed to by PO is known to be a Lisp
5439 structure allocated from the heap. */
5440 #define CHECK_ALLOCATED() \
5442 m = mem_find (po); \
5447 /* Check that the object pointed to by PO is live, using predicate
5449 #define CHECK_LIVE(LIVEP) \
5451 if (!LIVEP (m, po)) \
5455 /* Check both of the above conditions. */
5456 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
5458 CHECK_ALLOCATED (); \
5459 CHECK_LIVE (LIVEP); \
5462 #else /* not GC_CHECK_MARKED_OBJECTS */
5464 #define CHECK_ALLOCATED() (void) 0
5465 #define CHECK_LIVE(LIVEP) (void) 0
5466 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
5468 #endif /* not GC_CHECK_MARKED_OBJECTS */
5470 switch (SWITCH_ENUM_CAST (XTYPE (obj
)))
5474 register struct Lisp_String
*ptr
= XSTRING (obj
);
5475 if (STRING_MARKED_P (ptr
))
5477 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
5478 MARK_INTERVAL_TREE (ptr
->intervals
);
5480 #ifdef GC_CHECK_STRING_BYTES
5481 /* Check that the string size recorded in the string is the
5482 same as the one recorded in the sdata structure. */
5483 CHECK_STRING_BYTES (ptr
);
5484 #endif /* GC_CHECK_STRING_BYTES */
5488 case Lisp_Vectorlike
:
5489 if (VECTOR_MARKED_P (XVECTOR (obj
)))
5491 #ifdef GC_CHECK_MARKED_OBJECTS
5493 if (m
== MEM_NIL
&& !SUBRP (obj
)
5494 && po
!= &buffer_defaults
5495 && po
!= &buffer_local_symbols
)
5497 #endif /* GC_CHECK_MARKED_OBJECTS */
5501 #ifdef GC_CHECK_MARKED_OBJECTS
5502 if (po
!= &buffer_defaults
&& po
!= &buffer_local_symbols
)
5505 for (b
= all_buffers
; b
&& b
!= po
; b
= b
->next
)
5510 #endif /* GC_CHECK_MARKED_OBJECTS */
5513 else if (SUBRP (obj
))
5515 else if (COMPILEDP (obj
))
5516 /* We could treat this just like a vector, but it is better to
5517 save the COMPILED_CONSTANTS element for last and avoid
5520 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5521 register EMACS_INT size
= ptr
->size
;
5524 CHECK_LIVE (live_vector_p
);
5525 VECTOR_MARK (ptr
); /* Else mark it */
5526 size
&= PSEUDOVECTOR_SIZE_MASK
;
5527 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5529 if (i
!= COMPILED_CONSTANTS
)
5530 mark_object (ptr
->contents
[i
]);
5532 obj
= ptr
->contents
[COMPILED_CONSTANTS
];
5535 else if (FRAMEP (obj
))
5537 register struct frame
*ptr
= XFRAME (obj
);
5538 mark_vectorlike (XVECTOR (obj
));
5539 mark_face_cache (ptr
->face_cache
);
5541 else if (WINDOWP (obj
))
5543 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5544 struct window
*w
= XWINDOW (obj
);
5545 mark_vectorlike (ptr
);
5546 /* Mark glyphs for leaf windows. Marking window matrices is
5547 sufficient because frame matrices use the same glyph
5549 if (NILP (w
->hchild
)
5551 && w
->current_matrix
)
5553 mark_glyph_matrix (w
->current_matrix
);
5554 mark_glyph_matrix (w
->desired_matrix
);
5557 else if (HASH_TABLE_P (obj
))
5559 struct Lisp_Hash_Table
*h
= XHASH_TABLE (obj
);
5560 mark_vectorlike ((struct Lisp_Vector
*)h
);
5561 /* If hash table is not weak, mark all keys and values.
5562 For weak tables, mark only the vector. */
5564 mark_object (h
->key_and_value
);
5566 VECTOR_MARK (XVECTOR (h
->key_and_value
));
5568 else if (CHAR_TABLE_P (obj
))
5569 mark_char_table (XVECTOR (obj
));
5571 mark_vectorlike (XVECTOR (obj
));
5576 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
5577 struct Lisp_Symbol
*ptrx
;
5581 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
5583 mark_object (ptr
->function
);
5584 mark_object (ptr
->plist
);
5585 switch (ptr
->redirect
)
5587 case SYMBOL_PLAINVAL
: mark_object (SYMBOL_VAL (ptr
)); break;
5588 case SYMBOL_VARALIAS
:
5591 XSETSYMBOL (tem
, SYMBOL_ALIAS (ptr
));
5595 case SYMBOL_LOCALIZED
:
5597 struct Lisp_Buffer_Local_Value
*blv
= SYMBOL_BLV (ptr
);
5598 /* If the value is forwarded to a buffer or keyboard field,
5599 these are marked when we see the corresponding object.
5600 And if it's forwarded to a C variable, either it's not
5601 a Lisp_Object var, or it's staticpro'd already. */
5602 mark_object (blv
->where
);
5603 mark_object (blv
->valcell
);
5604 mark_object (blv
->defcell
);
5607 case SYMBOL_FORWARDED
:
5608 /* If the value is forwarded to a buffer or keyboard field,
5609 these are marked when we see the corresponding object.
5610 And if it's forwarded to a C variable, either it's not
5611 a Lisp_Object var, or it's staticpro'd already. */
5615 if (!PURE_POINTER_P (XSTRING (ptr
->xname
)))
5616 MARK_STRING (XSTRING (ptr
->xname
));
5617 MARK_INTERVAL_TREE (STRING_INTERVALS (ptr
->xname
));
5622 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun */
5623 XSETSYMBOL (obj
, ptrx
);
5630 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
5631 if (XMISCANY (obj
)->gcmarkbit
)
5633 XMISCANY (obj
)->gcmarkbit
= 1;
5635 switch (XMISCTYPE (obj
))
5638 case Lisp_Misc_Marker
:
5639 /* DO NOT mark thru the marker's chain.
5640 The buffer's markers chain does not preserve markers from gc;
5641 instead, markers are removed from the chain when freed by gc. */
5644 case Lisp_Misc_Save_Value
:
5647 register struct Lisp_Save_Value
*ptr
= XSAVE_VALUE (obj
);
5648 /* If DOGC is set, POINTER is the address of a memory
5649 area containing INTEGER potential Lisp_Objects. */
5652 Lisp_Object
*p
= (Lisp_Object
*) ptr
->pointer
;
5654 for (nelt
= ptr
->integer
; nelt
> 0; nelt
--, p
++)
5655 mark_maybe_object (*p
);
5661 case Lisp_Misc_Overlay
:
5663 struct Lisp_Overlay
*ptr
= XOVERLAY (obj
);
5664 mark_object (ptr
->start
);
5665 mark_object (ptr
->end
);
5666 mark_object (ptr
->plist
);
5669 XSETMISC (obj
, ptr
->next
);
5682 register struct Lisp_Cons
*ptr
= XCONS (obj
);
5683 if (CONS_MARKED_P (ptr
))
5685 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
5687 /* If the cdr is nil, avoid recursion for the car. */
5688 if (EQ (ptr
->u
.cdr
, Qnil
))
5694 mark_object (ptr
->car
);
5697 if (cdr_count
== mark_object_loop_halt
)
5703 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
5704 FLOAT_MARK (XFLOAT (obj
));
5715 #undef CHECK_ALLOCATED
5716 #undef CHECK_ALLOCATED_AND_LIVE
5719 /* Mark the pointers in a buffer structure. */
5725 register struct buffer
*buffer
= XBUFFER (buf
);
5726 register Lisp_Object
*ptr
, tmp
;
5727 Lisp_Object base_buffer
;
5729 eassert (!VECTOR_MARKED_P (buffer
));
5730 VECTOR_MARK (buffer
);
5732 MARK_INTERVAL_TREE (BUF_INTERVALS (buffer
));
5734 /* For now, we just don't mark the undo_list. It's done later in
5735 a special way just before the sweep phase, and after stripping
5736 some of its elements that are not needed any more. */
5738 if (buffer
->overlays_before
)
5740 XSETMISC (tmp
, buffer
->overlays_before
);
5743 if (buffer
->overlays_after
)
5745 XSETMISC (tmp
, buffer
->overlays_after
);
5749 /* buffer-local Lisp variables start at `undo_list',
5750 tho only the ones from `name' on are GC'd normally. */
5751 for (ptr
= &buffer
->name
;
5752 (char *)ptr
< (char *)buffer
+ sizeof (struct buffer
);
5756 /* If this is an indirect buffer, mark its base buffer. */
5757 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
5759 XSETBUFFER (base_buffer
, buffer
->base_buffer
);
5760 mark_buffer (base_buffer
);
5764 /* Mark the Lisp pointers in the terminal objects.
5765 Called by the Fgarbage_collector. */
5768 mark_terminals (void)
5771 for (t
= terminal_list
; t
; t
= t
->next_terminal
)
5773 eassert (t
->name
!= NULL
);
5774 if (!VECTOR_MARKED_P (t
))
5776 #ifdef HAVE_WINDOW_SYSTEM
5777 mark_image_cache (t
->image_cache
);
5778 #endif /* HAVE_WINDOW_SYSTEM */
5779 mark_vectorlike ((struct Lisp_Vector
*)t
);
5786 /* Value is non-zero if OBJ will survive the current GC because it's
5787 either marked or does not need to be marked to survive. */
5795 switch (XTYPE (obj
))
5802 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
5806 survives_p
= XMISCANY (obj
)->gcmarkbit
;
5810 survives_p
= STRING_MARKED_P (XSTRING (obj
));
5813 case Lisp_Vectorlike
:
5814 survives_p
= SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
5818 survives_p
= CONS_MARKED_P (XCONS (obj
));
5822 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
5829 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
5834 /* Sweep: find all structures not marked, and free them. */
5839 /* Remove or mark entries in weak hash tables.
5840 This must be done before any object is unmarked. */
5841 sweep_weak_hash_tables ();
5844 #ifdef GC_CHECK_STRING_BYTES
5845 if (!noninteractive
)
5846 check_string_bytes (1);
5849 /* Put all unmarked conses on free list */
5851 register struct cons_block
*cblk
;
5852 struct cons_block
**cprev
= &cons_block
;
5853 register int lim
= cons_block_index
;
5854 register int num_free
= 0, num_used
= 0;
5858 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
5862 int ilim
= (lim
+ BITS_PER_INT
- 1) / BITS_PER_INT
;
5864 /* Scan the mark bits an int at a time. */
5865 for (i
= 0; i
<= ilim
; i
++)
5867 if (cblk
->gcmarkbits
[i
] == -1)
5869 /* Fast path - all cons cells for this int are marked. */
5870 cblk
->gcmarkbits
[i
] = 0;
5871 num_used
+= BITS_PER_INT
;
5875 /* Some cons cells for this int are not marked.
5876 Find which ones, and free them. */
5877 int start
, pos
, stop
;
5879 start
= i
* BITS_PER_INT
;
5881 if (stop
> BITS_PER_INT
)
5882 stop
= BITS_PER_INT
;
5885 for (pos
= start
; pos
< stop
; pos
++)
5887 if (!CONS_MARKED_P (&cblk
->conses
[pos
]))
5890 cblk
->conses
[pos
].u
.chain
= cons_free_list
;
5891 cons_free_list
= &cblk
->conses
[pos
];
5893 cons_free_list
->car
= Vdead
;
5899 CONS_UNMARK (&cblk
->conses
[pos
]);
5905 lim
= CONS_BLOCK_SIZE
;
5906 /* If this block contains only free conses and we have already
5907 seen more than two blocks worth of free conses then deallocate
5909 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
5911 *cprev
= cblk
->next
;
5912 /* Unhook from the free list. */
5913 cons_free_list
= cblk
->conses
[0].u
.chain
;
5914 lisp_align_free (cblk
);
5919 num_free
+= this_free
;
5920 cprev
= &cblk
->next
;
5923 total_conses
= num_used
;
5924 total_free_conses
= num_free
;
5927 /* Put all unmarked floats on free list */
5929 register struct float_block
*fblk
;
5930 struct float_block
**fprev
= &float_block
;
5931 register int lim
= float_block_index
;
5932 register int num_free
= 0, num_used
= 0;
5934 float_free_list
= 0;
5936 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
5940 for (i
= 0; i
< lim
; i
++)
5941 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
5944 fblk
->floats
[i
].u
.chain
= float_free_list
;
5945 float_free_list
= &fblk
->floats
[i
];
5950 FLOAT_UNMARK (&fblk
->floats
[i
]);
5952 lim
= FLOAT_BLOCK_SIZE
;
5953 /* If this block contains only free floats and we have already
5954 seen more than two blocks worth of free floats then deallocate
5956 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
5958 *fprev
= fblk
->next
;
5959 /* Unhook from the free list. */
5960 float_free_list
= fblk
->floats
[0].u
.chain
;
5961 lisp_align_free (fblk
);
5966 num_free
+= this_free
;
5967 fprev
= &fblk
->next
;
5970 total_floats
= num_used
;
5971 total_free_floats
= num_free
;
5974 /* Put all unmarked intervals on free list */
5976 register struct interval_block
*iblk
;
5977 struct interval_block
**iprev
= &interval_block
;
5978 register int lim
= interval_block_index
;
5979 register int num_free
= 0, num_used
= 0;
5981 interval_free_list
= 0;
5983 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
5988 for (i
= 0; i
< lim
; i
++)
5990 if (!iblk
->intervals
[i
].gcmarkbit
)
5992 SET_INTERVAL_PARENT (&iblk
->intervals
[i
], interval_free_list
);
5993 interval_free_list
= &iblk
->intervals
[i
];
5999 iblk
->intervals
[i
].gcmarkbit
= 0;
6002 lim
= INTERVAL_BLOCK_SIZE
;
6003 /* If this block contains only free intervals and we have already
6004 seen more than two blocks worth of free intervals then
6005 deallocate this block. */
6006 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
6008 *iprev
= iblk
->next
;
6009 /* Unhook from the free list. */
6010 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
6012 n_interval_blocks
--;
6016 num_free
+= this_free
;
6017 iprev
= &iblk
->next
;
6020 total_intervals
= num_used
;
6021 total_free_intervals
= num_free
;
6024 /* Put all unmarked symbols on free list */
6026 register struct symbol_block
*sblk
;
6027 struct symbol_block
**sprev
= &symbol_block
;
6028 register int lim
= symbol_block_index
;
6029 register int num_free
= 0, num_used
= 0;
6031 symbol_free_list
= NULL
;
6033 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
6036 struct Lisp_Symbol
*sym
= sblk
->symbols
;
6037 struct Lisp_Symbol
*end
= sym
+ lim
;
6039 for (; sym
< end
; ++sym
)
6041 /* Check if the symbol was created during loadup. In such a case
6042 it might be pointed to by pure bytecode which we don't trace,
6043 so we conservatively assume that it is live. */
6044 int pure_p
= PURE_POINTER_P (XSTRING (sym
->xname
));
6046 if (!sym
->gcmarkbit
&& !pure_p
)
6048 if (sym
->redirect
== SYMBOL_LOCALIZED
)
6049 xfree (SYMBOL_BLV (sym
));
6050 sym
->next
= symbol_free_list
;
6051 symbol_free_list
= sym
;
6053 symbol_free_list
->function
= Vdead
;
6061 UNMARK_STRING (XSTRING (sym
->xname
));
6066 lim
= SYMBOL_BLOCK_SIZE
;
6067 /* If this block contains only free symbols and we have already
6068 seen more than two blocks worth of free symbols then deallocate
6070 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
6072 *sprev
= sblk
->next
;
6073 /* Unhook from the free list. */
6074 symbol_free_list
= sblk
->symbols
[0].next
;
6080 num_free
+= this_free
;
6081 sprev
= &sblk
->next
;
6084 total_symbols
= num_used
;
6085 total_free_symbols
= num_free
;
6088 /* Put all unmarked misc's on free list.
6089 For a marker, first unchain it from the buffer it points into. */
6091 register struct marker_block
*mblk
;
6092 struct marker_block
**mprev
= &marker_block
;
6093 register int lim
= marker_block_index
;
6094 register int num_free
= 0, num_used
= 0;
6096 marker_free_list
= 0;
6098 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
6103 for (i
= 0; i
< lim
; i
++)
6105 if (!mblk
->markers
[i
].u_any
.gcmarkbit
)
6107 if (mblk
->markers
[i
].u_any
.type
== Lisp_Misc_Marker
)
6108 unchain_marker (&mblk
->markers
[i
].u_marker
);
6109 /* Set the type of the freed object to Lisp_Misc_Free.
6110 We could leave the type alone, since nobody checks it,
6111 but this might catch bugs faster. */
6112 mblk
->markers
[i
].u_marker
.type
= Lisp_Misc_Free
;
6113 mblk
->markers
[i
].u_free
.chain
= marker_free_list
;
6114 marker_free_list
= &mblk
->markers
[i
];
6120 mblk
->markers
[i
].u_any
.gcmarkbit
= 0;
6123 lim
= MARKER_BLOCK_SIZE
;
6124 /* If this block contains only free markers and we have already
6125 seen more than two blocks worth of free markers then deallocate
6127 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
6129 *mprev
= mblk
->next
;
6130 /* Unhook from the free list. */
6131 marker_free_list
= mblk
->markers
[0].u_free
.chain
;
6137 num_free
+= this_free
;
6138 mprev
= &mblk
->next
;
6142 total_markers
= num_used
;
6143 total_free_markers
= num_free
;
6146 /* Free all unmarked buffers */
6148 register struct buffer
*buffer
= all_buffers
, *prev
= 0, *next
;
6151 if (!VECTOR_MARKED_P (buffer
))
6154 prev
->next
= buffer
->next
;
6156 all_buffers
= buffer
->next
;
6157 next
= buffer
->next
;
6163 VECTOR_UNMARK (buffer
);
6164 UNMARK_BALANCE_INTERVALS (BUF_INTERVALS (buffer
));
6165 prev
= buffer
, buffer
= buffer
->next
;
6169 /* Free all unmarked vectors */
6171 register struct Lisp_Vector
*vector
= all_vectors
, *prev
= 0, *next
;
6172 total_vector_size
= 0;
6175 if (!VECTOR_MARKED_P (vector
))
6178 prev
->next
= vector
->next
;
6180 all_vectors
= vector
->next
;
6181 next
= vector
->next
;
6189 VECTOR_UNMARK (vector
);
6190 if (vector
->size
& PSEUDOVECTOR_FLAG
)
6191 total_vector_size
+= (PSEUDOVECTOR_SIZE_MASK
& vector
->size
);
6193 total_vector_size
+= vector
->size
;
6194 prev
= vector
, vector
= vector
->next
;
6198 #ifdef GC_CHECK_STRING_BYTES
6199 if (!noninteractive
)
6200 check_string_bytes (1);
6207 /* Debugging aids. */
6209 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
6210 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
6211 This may be helpful in debugging Emacs's memory usage.
6212 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
6217 XSETINT (end
, (EMACS_INT
) sbrk (0) / 1024);
6222 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
6223 doc
: /* Return a list of counters that measure how much consing there has been.
6224 Each of these counters increments for a certain kind of object.
6225 The counters wrap around from the largest positive integer to zero.
6226 Garbage collection does not decrease them.
6227 The elements of the value are as follows:
6228 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
6229 All are in units of 1 = one object consed
6230 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
6232 MISCS include overlays, markers, and some internal types.
6233 Frames, windows, buffers, and subprocesses count as vectors
6234 (but the contents of a buffer's text do not count here). */)
6237 Lisp_Object consed
[8];
6239 consed
[0] = make_number (min (MOST_POSITIVE_FIXNUM
, cons_cells_consed
));
6240 consed
[1] = make_number (min (MOST_POSITIVE_FIXNUM
, floats_consed
));
6241 consed
[2] = make_number (min (MOST_POSITIVE_FIXNUM
, vector_cells_consed
));
6242 consed
[3] = make_number (min (MOST_POSITIVE_FIXNUM
, symbols_consed
));
6243 consed
[4] = make_number (min (MOST_POSITIVE_FIXNUM
, string_chars_consed
));
6244 consed
[5] = make_number (min (MOST_POSITIVE_FIXNUM
, misc_objects_consed
));
6245 consed
[6] = make_number (min (MOST_POSITIVE_FIXNUM
, intervals_consed
));
6246 consed
[7] = make_number (min (MOST_POSITIVE_FIXNUM
, strings_consed
));
6248 return Flist (8, consed
);
6251 int suppress_checking
;
6254 die (msg
, file
, line
)
6259 fprintf (stderr
, "\r\n%s:%d: Emacs fatal error: %s\r\n",
6264 /* Initialization */
6269 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
6271 pure_size
= PURESIZE
;
6272 pure_bytes_used
= 0;
6273 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
6274 pure_bytes_used_before_overflow
= 0;
6276 /* Initialize the list of free aligned blocks. */
6279 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
6281 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
6285 ignore_warnings
= 1;
6286 #ifdef DOUG_LEA_MALLOC
6287 mallopt (M_TRIM_THRESHOLD
, 128*1024); /* trim threshold */
6288 mallopt (M_MMAP_THRESHOLD
, 64*1024); /* mmap threshold */
6289 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* max. number of mmap'ed areas */
6297 init_weak_hash_tables ();
6300 malloc_hysteresis
= 32;
6302 malloc_hysteresis
= 0;
6305 refill_memory_reserve ();
6307 ignore_warnings
= 0;
6309 byte_stack_list
= 0;
6311 consing_since_gc
= 0;
6312 gc_cons_threshold
= 100000 * sizeof (Lisp_Object
);
6313 gc_relative_threshold
= 0;
6315 #ifdef VIRT_ADDR_VARIES
6316 malloc_sbrk_unused
= 1<<22; /* A large number */
6317 malloc_sbrk_used
= 100000; /* as reasonable as any number */
6318 #endif /* VIRT_ADDR_VARIES */
6325 byte_stack_list
= 0;
6327 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
6328 setjmp_tested_p
= longjmps_done
= 0;
6331 Vgc_elapsed
= make_float (0.0);
6338 DEFVAR_INT ("gc-cons-threshold", &gc_cons_threshold
,
6339 doc
: /* *Number of bytes of consing between garbage collections.
6340 Garbage collection can happen automatically once this many bytes have been
6341 allocated since the last garbage collection. All data types count.
6343 Garbage collection happens automatically only when `eval' is called.
6345 By binding this temporarily to a large number, you can effectively
6346 prevent garbage collection during a part of the program.
6347 See also `gc-cons-percentage'. */);
6349 DEFVAR_LISP ("gc-cons-percentage", &Vgc_cons_percentage
,
6350 doc
: /* *Portion of the heap used for allocation.
6351 Garbage collection can happen automatically once this portion of the heap
6352 has been allocated since the last garbage collection.
6353 If this portion is smaller than `gc-cons-threshold', this is ignored. */);
6354 Vgc_cons_percentage
= make_float (0.1);
6356 DEFVAR_INT ("pure-bytes-used", &pure_bytes_used
,
6357 doc
: /* Number of bytes of sharable Lisp data allocated so far. */);
6359 DEFVAR_INT ("cons-cells-consed", &cons_cells_consed
,
6360 doc
: /* Number of cons cells that have been consed so far. */);
6362 DEFVAR_INT ("floats-consed", &floats_consed
,
6363 doc
: /* Number of floats that have been consed so far. */);
6365 DEFVAR_INT ("vector-cells-consed", &vector_cells_consed
,
6366 doc
: /* Number of vector cells that have been consed so far. */);
6368 DEFVAR_INT ("symbols-consed", &symbols_consed
,
6369 doc
: /* Number of symbols that have been consed so far. */);
6371 DEFVAR_INT ("string-chars-consed", &string_chars_consed
,
6372 doc
: /* Number of string characters that have been consed so far. */);
6374 DEFVAR_INT ("misc-objects-consed", &misc_objects_consed
,
6375 doc
: /* Number of miscellaneous objects that have been consed so far. */);
6377 DEFVAR_INT ("intervals-consed", &intervals_consed
,
6378 doc
: /* Number of intervals that have been consed so far. */);
6380 DEFVAR_INT ("strings-consed", &strings_consed
,
6381 doc
: /* Number of strings that have been consed so far. */);
6383 DEFVAR_LISP ("purify-flag", &Vpurify_flag
,
6384 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
6385 This means that certain objects should be allocated in shared (pure) space.
6386 It can also be set to a hash-table, in which case this table is used to
6387 do hash-consing of the objects allocated to pure space. */);
6389 DEFVAR_BOOL ("garbage-collection-messages", &garbage_collection_messages
,
6390 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
6391 garbage_collection_messages
= 0;
6393 DEFVAR_LISP ("post-gc-hook", &Vpost_gc_hook
,
6394 doc
: /* Hook run after garbage collection has finished. */);
6395 Vpost_gc_hook
= Qnil
;
6396 Qpost_gc_hook
= intern_c_string ("post-gc-hook");
6397 staticpro (&Qpost_gc_hook
);
6399 DEFVAR_LISP ("memory-signal-data", &Vmemory_signal_data
,
6400 doc
: /* Precomputed `signal' argument for memory-full error. */);
6401 /* We build this in advance because if we wait until we need it, we might
6402 not be able to allocate the memory to hold it. */
6404 = pure_cons (Qerror
,
6405 pure_cons (make_pure_c_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"), Qnil
));
6407 DEFVAR_LISP ("memory-full", &Vmemory_full
,
6408 doc
: /* Non-nil means Emacs cannot get much more Lisp memory. */);
6409 Vmemory_full
= Qnil
;
6411 staticpro (&Qgc_cons_threshold
);
6412 Qgc_cons_threshold
= intern_c_string ("gc-cons-threshold");
6414 staticpro (&Qchar_table_extra_slots
);
6415 Qchar_table_extra_slots
= intern_c_string ("char-table-extra-slots");
6417 DEFVAR_LISP ("gc-elapsed", &Vgc_elapsed
,
6418 doc
: /* Accumulated time elapsed in garbage collections.
6419 The time is in seconds as a floating point value. */);
6420 DEFVAR_INT ("gcs-done", &gcs_done
,
6421 doc
: /* Accumulated number of garbage collections done. */);
6426 defsubr (&Smake_byte_code
);
6427 defsubr (&Smake_list
);
6428 defsubr (&Smake_vector
);
6429 defsubr (&Smake_string
);
6430 defsubr (&Smake_bool_vector
);
6431 defsubr (&Smake_symbol
);
6432 defsubr (&Smake_marker
);
6433 defsubr (&Spurecopy
);
6434 defsubr (&Sgarbage_collect
);
6435 defsubr (&Smemory_limit
);
6436 defsubr (&Smemory_use_counts
);
6438 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
6439 defsubr (&Sgc_status
);
6443 /* arch-tag: 6695ca10-e3c5-4c2c-8bc3-ed26a7dda857
6444 (do not change this comment) */