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
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 ();
73 #define INCLUDED_FCNTL
85 #ifdef DOUG_LEA_MALLOC
88 /* malloc.h #defines this as size_t, at least in glibc2. */
89 #ifndef __malloc_size_t
90 #define __malloc_size_t int
93 /* Specify maximum number of areas to mmap. It would be nice to use a
94 value that explicitly means "no limit". */
96 #define MMAP_MAX_AREAS 100000000
98 #else /* not DOUG_LEA_MALLOC */
100 /* The following come from gmalloc.c. */
102 #define __malloc_size_t size_t
103 extern __malloc_size_t _bytes_used
;
104 extern __malloc_size_t __malloc_extra_blocks
;
106 #endif /* not DOUG_LEA_MALLOC */
108 #if ! defined (SYSTEM_MALLOC) && defined (HAVE_GTK_AND_PTHREAD)
110 /* When GTK uses the file chooser dialog, different backends can be loaded
111 dynamically. One such a backend is the Gnome VFS backend that gets loaded
112 if you run Gnome. That backend creates several threads and also allocates
115 If Emacs sets malloc hooks (! SYSTEM_MALLOC) and the emacs_blocked_*
116 functions below are called from malloc, there is a chance that one
117 of these threads preempts the Emacs main thread and the hook variables
118 end up in an inconsistent state. So we have a mutex to prevent that (note
119 that the backend handles concurrent access to malloc within its own threads
120 but Emacs code running in the main thread is not included in that control).
122 When UNBLOCK_INPUT is called, reinvoke_input_signal may be called. If this
123 happens in one of the backend threads we will have two threads that tries
124 to run Emacs code at once, and the code is not prepared for that.
125 To prevent that, we only call BLOCK/UNBLOCK from the main thread. */
127 static pthread_mutex_t alloc_mutex
;
129 #define BLOCK_INPUT_ALLOC \
132 if (pthread_equal (pthread_self (), main_thread)) \
134 pthread_mutex_lock (&alloc_mutex); \
137 #define UNBLOCK_INPUT_ALLOC \
140 pthread_mutex_unlock (&alloc_mutex); \
141 if (pthread_equal (pthread_self (), main_thread)) \
146 #else /* SYSTEM_MALLOC || not HAVE_GTK_AND_PTHREAD */
148 #define BLOCK_INPUT_ALLOC BLOCK_INPUT
149 #define UNBLOCK_INPUT_ALLOC UNBLOCK_INPUT
151 #endif /* SYSTEM_MALLOC || not HAVE_GTK_AND_PTHREAD */
153 /* Value of _bytes_used, when spare_memory was freed. */
155 static __malloc_size_t bytes_used_when_full
;
157 static __malloc_size_t bytes_used_when_reconsidered
;
159 /* Mark, unmark, query mark bit of a Lisp string. S must be a pointer
160 to a struct Lisp_String. */
162 #define MARK_STRING(S) ((S)->size |= ARRAY_MARK_FLAG)
163 #define UNMARK_STRING(S) ((S)->size &= ~ARRAY_MARK_FLAG)
164 #define STRING_MARKED_P(S) (((S)->size & ARRAY_MARK_FLAG) != 0)
166 #define VECTOR_MARK(V) ((V)->size |= ARRAY_MARK_FLAG)
167 #define VECTOR_UNMARK(V) ((V)->size &= ~ARRAY_MARK_FLAG)
168 #define VECTOR_MARKED_P(V) (((V)->size & ARRAY_MARK_FLAG) != 0)
170 /* Value is the number of bytes/chars of S, a pointer to a struct
171 Lisp_String. This must be used instead of STRING_BYTES (S) or
172 S->size during GC, because S->size contains the mark bit for
175 #define GC_STRING_BYTES(S) (STRING_BYTES (S))
176 #define GC_STRING_CHARS(S) ((S)->size & ~ARRAY_MARK_FLAG)
178 /* Number of bytes of consing done since the last gc. */
180 int consing_since_gc
;
182 /* Count the amount of consing of various sorts of space. */
184 EMACS_INT cons_cells_consed
;
185 EMACS_INT floats_consed
;
186 EMACS_INT vector_cells_consed
;
187 EMACS_INT symbols_consed
;
188 EMACS_INT string_chars_consed
;
189 EMACS_INT misc_objects_consed
;
190 EMACS_INT intervals_consed
;
191 EMACS_INT strings_consed
;
193 /* Minimum number of bytes of consing since GC before next GC. */
195 EMACS_INT gc_cons_threshold
;
197 /* Similar minimum, computed from Vgc_cons_percentage. */
199 EMACS_INT gc_relative_threshold
;
201 static Lisp_Object Vgc_cons_percentage
;
203 /* Minimum number of bytes of consing since GC before next GC,
204 when memory is full. */
206 EMACS_INT memory_full_cons_threshold
;
208 /* Nonzero during GC. */
212 /* Nonzero means abort if try to GC.
213 This is for code which is written on the assumption that
214 no GC will happen, so as to verify that assumption. */
218 /* Nonzero means display messages at beginning and end of GC. */
220 int garbage_collection_messages
;
222 #ifndef VIRT_ADDR_VARIES
224 #endif /* VIRT_ADDR_VARIES */
225 int malloc_sbrk_used
;
227 #ifndef VIRT_ADDR_VARIES
229 #endif /* VIRT_ADDR_VARIES */
230 int malloc_sbrk_unused
;
232 /* Number of live and free conses etc. */
234 static int total_conses
, total_markers
, total_symbols
, total_vector_size
;
235 static int total_free_conses
, total_free_markers
, total_free_symbols
;
236 static int total_free_floats
, total_floats
;
238 /* Points to memory space allocated as "spare", to be freed if we run
239 out of memory. We keep one large block, four cons-blocks, and
240 two string blocks. */
242 static char *spare_memory
[7];
244 /* Amount of spare memory to keep in large reserve block. */
246 #define SPARE_MEMORY (1 << 14)
248 /* Number of extra blocks malloc should get when it needs more core. */
250 static int malloc_hysteresis
;
252 /* Non-nil means defun should do purecopy on the function definition. */
254 Lisp_Object Vpurify_flag
;
256 /* Non-nil means we are handling a memory-full error. */
258 Lisp_Object Vmemory_full
;
262 /* Initialize it to a nonzero value to force it into data space
263 (rather than bss space). That way unexec will remap it into text
264 space (pure), on some systems. We have not implemented the
265 remapping on more recent systems because this is less important
266 nowadays than in the days of small memories and timesharing. */
268 EMACS_INT pure
[(PURESIZE
+ sizeof (EMACS_INT
) - 1) / sizeof (EMACS_INT
)] = {1,};
269 #define PUREBEG (char *) pure
273 #define pure PURE_SEG_BITS /* Use shared memory segment */
274 #define PUREBEG (char *)PURE_SEG_BITS
276 #endif /* HAVE_SHM */
278 /* Pointer to the pure area, and its size. */
280 static char *purebeg
;
281 static size_t pure_size
;
283 /* Number of bytes of pure storage used before pure storage overflowed.
284 If this is non-zero, this implies that an overflow occurred. */
286 static size_t pure_bytes_used_before_overflow
;
288 /* Value is non-zero if P points into pure space. */
290 #define PURE_POINTER_P(P) \
291 (((PNTR_COMPARISON_TYPE) (P) \
292 < (PNTR_COMPARISON_TYPE) ((char *) purebeg + pure_size)) \
293 && ((PNTR_COMPARISON_TYPE) (P) \
294 >= (PNTR_COMPARISON_TYPE) purebeg))
296 /* Total number of bytes allocated in pure storage. */
298 EMACS_INT pure_bytes_used
;
300 /* Index in pure at which next pure Lisp object will be allocated.. */
302 static EMACS_INT pure_bytes_used_lisp
;
304 /* Number of bytes allocated for non-Lisp objects in pure storage. */
306 static EMACS_INT pure_bytes_used_non_lisp
;
308 /* If nonzero, this is a warning delivered by malloc and not yet
311 char *pending_malloc_warning
;
313 /* Pre-computed signal argument for use when memory is exhausted. */
315 Lisp_Object Vmemory_signal_data
;
317 /* Maximum amount of C stack to save when a GC happens. */
319 #ifndef MAX_SAVE_STACK
320 #define MAX_SAVE_STACK 16000
323 /* Buffer in which we save a copy of the C stack at each GC. */
325 static char *stack_copy
;
326 static int stack_copy_size
;
328 /* Non-zero means ignore malloc warnings. Set during initialization.
329 Currently not used. */
331 static int ignore_warnings
;
333 Lisp_Object Qgc_cons_threshold
, Qchar_table_extra_slots
;
335 /* Hook run after GC has finished. */
337 Lisp_Object Vpost_gc_hook
, Qpost_gc_hook
;
339 Lisp_Object Vgc_elapsed
; /* accumulated elapsed time in GC */
340 EMACS_INT gcs_done
; /* accumulated GCs */
342 static void mark_buffer
P_ ((Lisp_Object
));
343 static void mark_terminals
P_ ((void));
344 extern void mark_kboards
P_ ((void));
345 extern void mark_ttys
P_ ((void));
346 extern void mark_backtrace
P_ ((void));
347 static void gc_sweep
P_ ((void));
348 static void mark_glyph_matrix
P_ ((struct glyph_matrix
*));
349 static void mark_face_cache
P_ ((struct face_cache
*));
351 #ifdef HAVE_WINDOW_SYSTEM
352 extern void mark_fringe_data
P_ ((void));
353 #endif /* HAVE_WINDOW_SYSTEM */
355 static struct Lisp_String
*allocate_string
P_ ((void));
356 static void compact_small_strings
P_ ((void));
357 static void free_large_strings
P_ ((void));
358 static void sweep_strings
P_ ((void));
360 extern int message_enable_multibyte
;
362 /* When scanning the C stack for live Lisp objects, Emacs keeps track
363 of what memory allocated via lisp_malloc is intended for what
364 purpose. This enumeration specifies the type of memory. */
375 /* We used to keep separate mem_types for subtypes of vectors such as
376 process, hash_table, frame, terminal, and window, but we never made
377 use of the distinction, so it only caused source-code complexity
378 and runtime slowdown. Minor but pointless. */
382 static POINTER_TYPE
*lisp_align_malloc
P_ ((size_t, enum mem_type
));
383 static POINTER_TYPE
*lisp_malloc
P_ ((size_t, enum mem_type
));
384 void refill_memory_reserve ();
387 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
389 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
390 #include <stdio.h> /* For fprintf. */
393 /* A unique object in pure space used to make some Lisp objects
394 on free lists recognizable in O(1). */
396 static Lisp_Object Vdead
;
398 #ifdef GC_MALLOC_CHECK
400 enum mem_type allocated_mem_type
;
401 static int dont_register_blocks
;
403 #endif /* GC_MALLOC_CHECK */
405 /* A node in the red-black tree describing allocated memory containing
406 Lisp data. Each such block is recorded with its start and end
407 address when it is allocated, and removed from the tree when it
410 A red-black tree is a balanced binary tree with the following
413 1. Every node is either red or black.
414 2. Every leaf is black.
415 3. If a node is red, then both of its children are black.
416 4. Every simple path from a node to a descendant leaf contains
417 the same number of black nodes.
418 5. The root is always black.
420 When nodes are inserted into the tree, or deleted from the tree,
421 the tree is "fixed" so that these properties are always true.
423 A red-black tree with N internal nodes has height at most 2
424 log(N+1). Searches, insertions and deletions are done in O(log N).
425 Please see a text book about data structures for a detailed
426 description of red-black trees. Any book worth its salt should
431 /* Children of this node. These pointers are never NULL. When there
432 is no child, the value is MEM_NIL, which points to a dummy node. */
433 struct mem_node
*left
, *right
;
435 /* The parent of this node. In the root node, this is NULL. */
436 struct mem_node
*parent
;
438 /* Start and end of allocated region. */
442 enum {MEM_BLACK
, MEM_RED
} color
;
448 /* Base address of stack. Set in main. */
450 Lisp_Object
*stack_base
;
452 /* Root of the tree describing allocated Lisp memory. */
454 static struct mem_node
*mem_root
;
456 /* Lowest and highest known address in the heap. */
458 static void *min_heap_address
, *max_heap_address
;
460 /* Sentinel node of the tree. */
462 static struct mem_node mem_z
;
463 #define MEM_NIL &mem_z
465 static POINTER_TYPE
*lisp_malloc
P_ ((size_t, enum mem_type
));
466 static struct Lisp_Vector
*allocate_vectorlike
P_ ((EMACS_INT
));
467 static void lisp_free
P_ ((POINTER_TYPE
*));
468 static void mark_stack
P_ ((void));
469 static int live_vector_p
P_ ((struct mem_node
*, void *));
470 static int live_buffer_p
P_ ((struct mem_node
*, void *));
471 static int live_string_p
P_ ((struct mem_node
*, void *));
472 static int live_cons_p
P_ ((struct mem_node
*, void *));
473 static int live_symbol_p
P_ ((struct mem_node
*, void *));
474 static int live_float_p
P_ ((struct mem_node
*, void *));
475 static int live_misc_p
P_ ((struct mem_node
*, void *));
476 static void mark_maybe_object
P_ ((Lisp_Object
));
477 static void mark_memory
P_ ((void *, void *, int));
478 static void mem_init
P_ ((void));
479 static struct mem_node
*mem_insert
P_ ((void *, void *, enum mem_type
));
480 static void mem_insert_fixup
P_ ((struct mem_node
*));
481 static void mem_rotate_left
P_ ((struct mem_node
*));
482 static void mem_rotate_right
P_ ((struct mem_node
*));
483 static void mem_delete
P_ ((struct mem_node
*));
484 static void mem_delete_fixup
P_ ((struct mem_node
*));
485 static INLINE
struct mem_node
*mem_find
P_ ((void *));
488 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
489 static void check_gcpros
P_ ((void));
492 #endif /* GC_MARK_STACK || GC_MALLOC_CHECK */
494 /* Recording what needs to be marked for gc. */
496 struct gcpro
*gcprolist
;
498 /* Addresses of staticpro'd variables. Initialize it to a nonzero
499 value; otherwise some compilers put it into BSS. */
501 #define NSTATICS 0x640
502 static Lisp_Object
*staticvec
[NSTATICS
] = {&Vpurify_flag
};
504 /* Index of next unused slot in staticvec. */
506 static int staticidx
= 0;
508 static POINTER_TYPE
*pure_alloc
P_ ((size_t, int));
511 /* Value is SZ rounded up to the next multiple of ALIGNMENT.
512 ALIGNMENT must be a power of 2. */
514 #define ALIGN(ptr, ALIGNMENT) \
515 ((POINTER_TYPE *) ((((EMACS_UINT)(ptr)) + (ALIGNMENT) - 1) \
516 & ~((ALIGNMENT) - 1)))
520 /************************************************************************
522 ************************************************************************/
524 /* Function malloc calls this if it finds we are near exhausting storage. */
530 pending_malloc_warning
= str
;
534 /* Display an already-pending malloc warning. */
537 display_malloc_warning ()
539 call3 (intern ("display-warning"),
541 build_string (pending_malloc_warning
),
542 intern ("emergency"));
543 pending_malloc_warning
= 0;
547 #ifdef DOUG_LEA_MALLOC
548 # define BYTES_USED (mallinfo ().uordblks)
550 # define BYTES_USED _bytes_used
553 /* Called if we can't allocate relocatable space for a buffer. */
556 buffer_memory_full ()
558 /* If buffers use the relocating allocator, no need to free
559 spare_memory, because we may have plenty of malloc space left
560 that we could get, and if we don't, the malloc that fails will
561 itself cause spare_memory to be freed. If buffers don't use the
562 relocating allocator, treat this like any other failing
569 /* This used to call error, but if we've run out of memory, we could
570 get infinite recursion trying to build the string. */
571 xsignal (Qnil
, Vmemory_signal_data
);
575 #ifdef XMALLOC_OVERRUN_CHECK
577 /* Check for overrun in malloc'ed buffers by wrapping a 16 byte header
578 and a 16 byte trailer around each block.
580 The header consists of 12 fixed bytes + a 4 byte integer contaning the
581 original block size, while the trailer consists of 16 fixed bytes.
583 The header is used to detect whether this block has been allocated
584 through these functions -- as it seems that some low-level libc
585 functions may bypass the malloc hooks.
589 #define XMALLOC_OVERRUN_CHECK_SIZE 16
591 static char xmalloc_overrun_check_header
[XMALLOC_OVERRUN_CHECK_SIZE
-4] =
592 { 0x9a, 0x9b, 0xae, 0xaf,
593 0xbf, 0xbe, 0xce, 0xcf,
594 0xea, 0xeb, 0xec, 0xed };
596 static char xmalloc_overrun_check_trailer
[XMALLOC_OVERRUN_CHECK_SIZE
] =
597 { 0xaa, 0xab, 0xac, 0xad,
598 0xba, 0xbb, 0xbc, 0xbd,
599 0xca, 0xcb, 0xcc, 0xcd,
600 0xda, 0xdb, 0xdc, 0xdd };
602 /* Macros to insert and extract the block size in the header. */
604 #define XMALLOC_PUT_SIZE(ptr, size) \
605 (ptr[-1] = (size & 0xff), \
606 ptr[-2] = ((size >> 8) & 0xff), \
607 ptr[-3] = ((size >> 16) & 0xff), \
608 ptr[-4] = ((size >> 24) & 0xff))
610 #define XMALLOC_GET_SIZE(ptr) \
611 (size_t)((unsigned)(ptr[-1]) | \
612 ((unsigned)(ptr[-2]) << 8) | \
613 ((unsigned)(ptr[-3]) << 16) | \
614 ((unsigned)(ptr[-4]) << 24))
617 /* The call depth in overrun_check functions. For example, this might happen:
619 overrun_check_malloc()
620 -> malloc -> (via hook)_-> emacs_blocked_malloc
621 -> overrun_check_malloc
622 call malloc (hooks are NULL, so real malloc is called).
623 malloc returns 10000.
624 add overhead, return 10016.
625 <- (back in overrun_check_malloc)
626 add overhead again, return 10032
627 xmalloc returns 10032.
632 overrun_check_free(10032)
634 free(10016) <- crash, because 10000 is the original pointer. */
636 static int check_depth
;
638 /* Like malloc, but wraps allocated block with header and trailer. */
641 overrun_check_malloc (size
)
644 register unsigned char *val
;
645 size_t overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_SIZE
*2 : 0;
647 val
= (unsigned char *) malloc (size
+ overhead
);
648 if (val
&& check_depth
== 1)
650 bcopy (xmalloc_overrun_check_header
, val
, XMALLOC_OVERRUN_CHECK_SIZE
- 4);
651 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
652 XMALLOC_PUT_SIZE(val
, size
);
653 bcopy (xmalloc_overrun_check_trailer
, val
+ size
, XMALLOC_OVERRUN_CHECK_SIZE
);
656 return (POINTER_TYPE
*)val
;
660 /* Like realloc, but checks old block for overrun, and wraps new block
661 with header and trailer. */
664 overrun_check_realloc (block
, size
)
668 register unsigned char *val
= (unsigned char *)block
;
669 size_t overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_SIZE
*2 : 0;
673 && bcmp (xmalloc_overrun_check_header
,
674 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
675 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
677 size_t osize
= XMALLOC_GET_SIZE (val
);
678 if (bcmp (xmalloc_overrun_check_trailer
,
680 XMALLOC_OVERRUN_CHECK_SIZE
))
682 bzero (val
+ osize
, XMALLOC_OVERRUN_CHECK_SIZE
);
683 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
684 bzero (val
, XMALLOC_OVERRUN_CHECK_SIZE
);
687 val
= (unsigned char *) realloc ((POINTER_TYPE
*)val
, size
+ overhead
);
689 if (val
&& check_depth
== 1)
691 bcopy (xmalloc_overrun_check_header
, val
, XMALLOC_OVERRUN_CHECK_SIZE
- 4);
692 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
693 XMALLOC_PUT_SIZE(val
, size
);
694 bcopy (xmalloc_overrun_check_trailer
, val
+ size
, XMALLOC_OVERRUN_CHECK_SIZE
);
697 return (POINTER_TYPE
*)val
;
700 /* Like free, but checks block for overrun. */
703 overrun_check_free (block
)
706 unsigned char *val
= (unsigned char *)block
;
711 && bcmp (xmalloc_overrun_check_header
,
712 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
713 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
715 size_t osize
= XMALLOC_GET_SIZE (val
);
716 if (bcmp (xmalloc_overrun_check_trailer
,
718 XMALLOC_OVERRUN_CHECK_SIZE
))
720 #ifdef XMALLOC_CLEAR_FREE_MEMORY
721 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
722 memset (val
, 0xff, osize
+ XMALLOC_OVERRUN_CHECK_SIZE
*2);
724 bzero (val
+ osize
, XMALLOC_OVERRUN_CHECK_SIZE
);
725 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
726 bzero (val
, XMALLOC_OVERRUN_CHECK_SIZE
);
737 #define malloc overrun_check_malloc
738 #define realloc overrun_check_realloc
739 #define free overrun_check_free
743 /* When using SYNC_INPUT, we don't call malloc from a signal handler, so
744 there's no need to block input around malloc. */
745 #define MALLOC_BLOCK_INPUT ((void)0)
746 #define MALLOC_UNBLOCK_INPUT ((void)0)
748 #define MALLOC_BLOCK_INPUT BLOCK_INPUT
749 #define MALLOC_UNBLOCK_INPUT UNBLOCK_INPUT
752 /* Like malloc but check for no memory and block interrupt input.. */
758 register POINTER_TYPE
*val
;
761 val
= (POINTER_TYPE
*) malloc (size
);
762 MALLOC_UNBLOCK_INPUT
;
770 /* Like realloc but check for no memory and block interrupt input.. */
773 xrealloc (block
, size
)
777 register POINTER_TYPE
*val
;
780 /* We must call malloc explicitly when BLOCK is 0, since some
781 reallocs don't do this. */
783 val
= (POINTER_TYPE
*) malloc (size
);
785 val
= (POINTER_TYPE
*) realloc (block
, size
);
786 MALLOC_UNBLOCK_INPUT
;
788 if (!val
&& size
) memory_full ();
793 /* Like free but block interrupt input. */
803 MALLOC_UNBLOCK_INPUT
;
804 /* We don't call refill_memory_reserve here
805 because that duplicates doing so in emacs_blocked_free
806 and the criterion should go there. */
810 /* Like strdup, but uses xmalloc. */
816 size_t len
= strlen (s
) + 1;
817 char *p
= (char *) xmalloc (len
);
823 /* Unwind for SAFE_ALLOCA */
826 safe_alloca_unwind (arg
)
829 register struct Lisp_Save_Value
*p
= XSAVE_VALUE (arg
);
839 /* Like malloc but used for allocating Lisp data. NBYTES is the
840 number of bytes to allocate, TYPE describes the intended use of the
841 allcated memory block (for strings, for conses, ...). */
844 static void *lisp_malloc_loser
;
847 static POINTER_TYPE
*
848 lisp_malloc (nbytes
, type
)
856 #ifdef GC_MALLOC_CHECK
857 allocated_mem_type
= type
;
860 val
= (void *) malloc (nbytes
);
863 /* If the memory just allocated cannot be addressed thru a Lisp
864 object's pointer, and it needs to be,
865 that's equivalent to running out of memory. */
866 if (val
&& type
!= MEM_TYPE_NON_LISP
)
869 XSETCONS (tem
, (char *) val
+ nbytes
- 1);
870 if ((char *) XCONS (tem
) != (char *) val
+ nbytes
- 1)
872 lisp_malloc_loser
= val
;
879 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
880 if (val
&& type
!= MEM_TYPE_NON_LISP
)
881 mem_insert (val
, (char *) val
+ nbytes
, type
);
884 MALLOC_UNBLOCK_INPUT
;
890 /* Free BLOCK. This must be called to free memory allocated with a
891 call to lisp_malloc. */
899 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
900 mem_delete (mem_find (block
));
902 MALLOC_UNBLOCK_INPUT
;
905 /* Allocation of aligned blocks of memory to store Lisp data. */
906 /* The entry point is lisp_align_malloc which returns blocks of at most */
907 /* BLOCK_BYTES and guarantees they are aligned on a BLOCK_ALIGN boundary. */
909 /* Use posix_memalloc if the system has it and we're using the system's
910 malloc (because our gmalloc.c routines don't have posix_memalign although
911 its memalloc could be used). */
912 #if defined (HAVE_POSIX_MEMALIGN) && defined (SYSTEM_MALLOC)
913 #define USE_POSIX_MEMALIGN 1
916 /* BLOCK_ALIGN has to be a power of 2. */
917 #define BLOCK_ALIGN (1 << 10)
919 /* Padding to leave at the end of a malloc'd block. This is to give
920 malloc a chance to minimize the amount of memory wasted to alignment.
921 It should be tuned to the particular malloc library used.
922 On glibc-2.3.2, malloc never tries to align, so a padding of 0 is best.
923 posix_memalign on the other hand would ideally prefer a value of 4
924 because otherwise, there's 1020 bytes wasted between each ablocks.
925 In Emacs, testing shows that those 1020 can most of the time be
926 efficiently used by malloc to place other objects, so a value of 0 can
927 still preferable unless you have a lot of aligned blocks and virtually
929 #define BLOCK_PADDING 0
930 #define BLOCK_BYTES \
931 (BLOCK_ALIGN - sizeof (struct ablock *) - BLOCK_PADDING)
933 /* Internal data structures and constants. */
935 #define ABLOCKS_SIZE 16
937 /* An aligned block of memory. */
942 char payload
[BLOCK_BYTES
];
943 struct ablock
*next_free
;
945 /* `abase' is the aligned base of the ablocks. */
946 /* It is overloaded to hold the virtual `busy' field that counts
947 the number of used ablock in the parent ablocks.
948 The first ablock has the `busy' field, the others have the `abase'
949 field. To tell the difference, we assume that pointers will have
950 integer values larger than 2 * ABLOCKS_SIZE. The lowest bit of `busy'
951 is used to tell whether the real base of the parent ablocks is `abase'
952 (if not, the word before the first ablock holds a pointer to the
954 struct ablocks
*abase
;
955 /* The padding of all but the last ablock is unused. The padding of
956 the last ablock in an ablocks is not allocated. */
958 char padding
[BLOCK_PADDING
];
962 /* A bunch of consecutive aligned blocks. */
965 struct ablock blocks
[ABLOCKS_SIZE
];
968 /* Size of the block requested from malloc or memalign. */
969 #define ABLOCKS_BYTES (sizeof (struct ablocks) - BLOCK_PADDING)
971 #define ABLOCK_ABASE(block) \
972 (((unsigned long) (block)->abase) <= (1 + 2 * ABLOCKS_SIZE) \
973 ? (struct ablocks *)(block) \
976 /* Virtual `busy' field. */
977 #define ABLOCKS_BUSY(abase) ((abase)->blocks[0].abase)
979 /* Pointer to the (not necessarily aligned) malloc block. */
980 #ifdef USE_POSIX_MEMALIGN
981 #define ABLOCKS_BASE(abase) (abase)
983 #define ABLOCKS_BASE(abase) \
984 (1 & (long) ABLOCKS_BUSY (abase) ? abase : ((void**)abase)[-1])
987 /* The list of free ablock. */
988 static struct ablock
*free_ablock
;
990 /* Allocate an aligned block of nbytes.
991 Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be
992 smaller or equal to BLOCK_BYTES. */
993 static POINTER_TYPE
*
994 lisp_align_malloc (nbytes
, type
)
999 struct ablocks
*abase
;
1001 eassert (nbytes
<= BLOCK_BYTES
);
1005 #ifdef GC_MALLOC_CHECK
1006 allocated_mem_type
= type
;
1012 EMACS_INT aligned
; /* int gets warning casting to 64-bit pointer. */
1014 #ifdef DOUG_LEA_MALLOC
1015 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1016 because mapped region contents are not preserved in
1018 mallopt (M_MMAP_MAX
, 0);
1021 #ifdef USE_POSIX_MEMALIGN
1023 int err
= posix_memalign (&base
, BLOCK_ALIGN
, ABLOCKS_BYTES
);
1029 base
= malloc (ABLOCKS_BYTES
);
1030 abase
= ALIGN (base
, BLOCK_ALIGN
);
1035 MALLOC_UNBLOCK_INPUT
;
1039 aligned
= (base
== abase
);
1041 ((void**)abase
)[-1] = base
;
1043 #ifdef DOUG_LEA_MALLOC
1044 /* Back to a reasonable maximum of mmap'ed areas. */
1045 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1049 /* If the memory just allocated cannot be addressed thru a Lisp
1050 object's pointer, and it needs to be, that's equivalent to
1051 running out of memory. */
1052 if (type
!= MEM_TYPE_NON_LISP
)
1055 char *end
= (char *) base
+ ABLOCKS_BYTES
- 1;
1056 XSETCONS (tem
, end
);
1057 if ((char *) XCONS (tem
) != end
)
1059 lisp_malloc_loser
= base
;
1061 MALLOC_UNBLOCK_INPUT
;
1067 /* Initialize the blocks and put them on the free list.
1068 Is `base' was not properly aligned, we can't use the last block. */
1069 for (i
= 0; i
< (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1); i
++)
1071 abase
->blocks
[i
].abase
= abase
;
1072 abase
->blocks
[i
].x
.next_free
= free_ablock
;
1073 free_ablock
= &abase
->blocks
[i
];
1075 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (long) aligned
;
1077 eassert (0 == ((EMACS_UINT
)abase
) % BLOCK_ALIGN
);
1078 eassert (ABLOCK_ABASE (&abase
->blocks
[3]) == abase
); /* 3 is arbitrary */
1079 eassert (ABLOCK_ABASE (&abase
->blocks
[0]) == abase
);
1080 eassert (ABLOCKS_BASE (abase
) == base
);
1081 eassert (aligned
== (long) ABLOCKS_BUSY (abase
));
1084 abase
= ABLOCK_ABASE (free_ablock
);
1085 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (2 + (long) ABLOCKS_BUSY (abase
));
1087 free_ablock
= free_ablock
->x
.next_free
;
1089 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1090 if (val
&& type
!= MEM_TYPE_NON_LISP
)
1091 mem_insert (val
, (char *) val
+ nbytes
, type
);
1094 MALLOC_UNBLOCK_INPUT
;
1098 eassert (0 == ((EMACS_UINT
)val
) % BLOCK_ALIGN
);
1103 lisp_align_free (block
)
1104 POINTER_TYPE
*block
;
1106 struct ablock
*ablock
= block
;
1107 struct ablocks
*abase
= ABLOCK_ABASE (ablock
);
1110 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1111 mem_delete (mem_find (block
));
1113 /* Put on free list. */
1114 ablock
->x
.next_free
= free_ablock
;
1115 free_ablock
= ablock
;
1116 /* Update busy count. */
1117 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (-2 + (long) ABLOCKS_BUSY (abase
));
1119 if (2 > (long) ABLOCKS_BUSY (abase
))
1120 { /* All the blocks are free. */
1121 int i
= 0, aligned
= (long) ABLOCKS_BUSY (abase
);
1122 struct ablock
**tem
= &free_ablock
;
1123 struct ablock
*atop
= &abase
->blocks
[aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1];
1127 if (*tem
>= (struct ablock
*) abase
&& *tem
< atop
)
1130 *tem
= (*tem
)->x
.next_free
;
1133 tem
= &(*tem
)->x
.next_free
;
1135 eassert ((aligned
& 1) == aligned
);
1136 eassert (i
== (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1));
1137 #ifdef USE_POSIX_MEMALIGN
1138 eassert ((unsigned long)ABLOCKS_BASE (abase
) % BLOCK_ALIGN
== 0);
1140 free (ABLOCKS_BASE (abase
));
1142 MALLOC_UNBLOCK_INPUT
;
1145 /* Return a new buffer structure allocated from the heap with
1146 a call to lisp_malloc. */
1152 = (struct buffer
*) lisp_malloc (sizeof (struct buffer
),
1154 b
->size
= sizeof (struct buffer
) / sizeof (EMACS_INT
);
1155 XSETPVECTYPE (b
, PVEC_BUFFER
);
1160 #ifndef SYSTEM_MALLOC
1162 /* Arranging to disable input signals while we're in malloc.
1164 This only works with GNU malloc. To help out systems which can't
1165 use GNU malloc, all the calls to malloc, realloc, and free
1166 elsewhere in the code should be inside a BLOCK_INPUT/UNBLOCK_INPUT
1167 pair; unfortunately, we have no idea what C library functions
1168 might call malloc, so we can't really protect them unless you're
1169 using GNU malloc. Fortunately, most of the major operating systems
1170 can use GNU malloc. */
1173 /* When using SYNC_INPUT, we don't call malloc from a signal handler, so
1174 there's no need to block input around malloc. */
1176 #ifndef DOUG_LEA_MALLOC
1177 extern void * (*__malloc_hook
) P_ ((size_t, const void *));
1178 extern void * (*__realloc_hook
) P_ ((void *, size_t, const void *));
1179 extern void (*__free_hook
) P_ ((void *, const void *));
1180 /* Else declared in malloc.h, perhaps with an extra arg. */
1181 #endif /* DOUG_LEA_MALLOC */
1182 static void * (*old_malloc_hook
) P_ ((size_t, const void *));
1183 static void * (*old_realloc_hook
) P_ ((void *, size_t, const void*));
1184 static void (*old_free_hook
) P_ ((void*, const void*));
1186 /* This function is used as the hook for free to call. */
1189 emacs_blocked_free (ptr
, ptr2
)
1195 #ifdef GC_MALLOC_CHECK
1201 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1204 "Freeing `%p' which wasn't allocated with malloc\n", ptr
);
1209 /* fprintf (stderr, "free %p...%p (%p)\n", m->start, m->end, ptr); */
1213 #endif /* GC_MALLOC_CHECK */
1215 __free_hook
= old_free_hook
;
1218 /* If we released our reserve (due to running out of memory),
1219 and we have a fair amount free once again,
1220 try to set aside another reserve in case we run out once more. */
1221 if (! NILP (Vmemory_full
)
1222 /* Verify there is enough space that even with the malloc
1223 hysteresis this call won't run out again.
1224 The code here is correct as long as SPARE_MEMORY
1225 is substantially larger than the block size malloc uses. */
1226 && (bytes_used_when_full
1227 > ((bytes_used_when_reconsidered
= BYTES_USED
)
1228 + max (malloc_hysteresis
, 4) * SPARE_MEMORY
)))
1229 refill_memory_reserve ();
1231 __free_hook
= emacs_blocked_free
;
1232 UNBLOCK_INPUT_ALLOC
;
1236 /* This function is the malloc hook that Emacs uses. */
1239 emacs_blocked_malloc (size
, ptr
)
1246 __malloc_hook
= old_malloc_hook
;
1247 #ifdef DOUG_LEA_MALLOC
1248 /* Segfaults on my system. --lorentey */
1249 /* mallopt (M_TOP_PAD, malloc_hysteresis * 4096); */
1251 __malloc_extra_blocks
= malloc_hysteresis
;
1254 value
= (void *) malloc (size
);
1256 #ifdef GC_MALLOC_CHECK
1258 struct mem_node
*m
= mem_find (value
);
1261 fprintf (stderr
, "Malloc returned %p which is already in use\n",
1263 fprintf (stderr
, "Region in use is %p...%p, %u bytes, type %d\n",
1264 m
->start
, m
->end
, (char *) m
->end
- (char *) m
->start
,
1269 if (!dont_register_blocks
)
1271 mem_insert (value
, (char *) value
+ max (1, size
), allocated_mem_type
);
1272 allocated_mem_type
= MEM_TYPE_NON_LISP
;
1275 #endif /* GC_MALLOC_CHECK */
1277 __malloc_hook
= emacs_blocked_malloc
;
1278 UNBLOCK_INPUT_ALLOC
;
1280 /* fprintf (stderr, "%p malloc\n", value); */
1285 /* This function is the realloc hook that Emacs uses. */
1288 emacs_blocked_realloc (ptr
, size
, ptr2
)
1296 __realloc_hook
= old_realloc_hook
;
1298 #ifdef GC_MALLOC_CHECK
1301 struct mem_node
*m
= mem_find (ptr
);
1302 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1305 "Realloc of %p which wasn't allocated with malloc\n",
1313 /* fprintf (stderr, "%p -> realloc\n", ptr); */
1315 /* Prevent malloc from registering blocks. */
1316 dont_register_blocks
= 1;
1317 #endif /* GC_MALLOC_CHECK */
1319 value
= (void *) realloc (ptr
, size
);
1321 #ifdef GC_MALLOC_CHECK
1322 dont_register_blocks
= 0;
1325 struct mem_node
*m
= mem_find (value
);
1328 fprintf (stderr
, "Realloc returns memory that is already in use\n");
1332 /* Can't handle zero size regions in the red-black tree. */
1333 mem_insert (value
, (char *) value
+ max (size
, 1), MEM_TYPE_NON_LISP
);
1336 /* fprintf (stderr, "%p <- realloc\n", value); */
1337 #endif /* GC_MALLOC_CHECK */
1339 __realloc_hook
= emacs_blocked_realloc
;
1340 UNBLOCK_INPUT_ALLOC
;
1346 #ifdef HAVE_GTK_AND_PTHREAD
1347 /* Called from Fdump_emacs so that when the dumped Emacs starts, it has a
1348 normal malloc. Some thread implementations need this as they call
1349 malloc before main. The pthread_self call in BLOCK_INPUT_ALLOC then
1350 calls malloc because it is the first call, and we have an endless loop. */
1353 reset_malloc_hooks ()
1355 __free_hook
= old_free_hook
;
1356 __malloc_hook
= old_malloc_hook
;
1357 __realloc_hook
= old_realloc_hook
;
1359 #endif /* HAVE_GTK_AND_PTHREAD */
1362 /* Called from main to set up malloc to use our hooks. */
1365 uninterrupt_malloc ()
1367 #ifdef HAVE_GTK_AND_PTHREAD
1368 #ifdef DOUG_LEA_MALLOC
1369 pthread_mutexattr_t attr
;
1371 /* GLIBC has a faster way to do this, but lets keep it portable.
1372 This is according to the Single UNIX Specification. */
1373 pthread_mutexattr_init (&attr
);
1374 pthread_mutexattr_settype (&attr
, PTHREAD_MUTEX_RECURSIVE
);
1375 pthread_mutex_init (&alloc_mutex
, &attr
);
1376 #else /* !DOUG_LEA_MALLOC */
1377 /* Some systems such as Solaris 2.6 doesn't have a recursive mutex,
1378 and the bundled gmalloc.c doesn't require it. */
1379 pthread_mutex_init (&alloc_mutex
, NULL
);
1380 #endif /* !DOUG_LEA_MALLOC */
1381 #endif /* HAVE_GTK_AND_PTHREAD */
1383 if (__free_hook
!= emacs_blocked_free
)
1384 old_free_hook
= __free_hook
;
1385 __free_hook
= emacs_blocked_free
;
1387 if (__malloc_hook
!= emacs_blocked_malloc
)
1388 old_malloc_hook
= __malloc_hook
;
1389 __malloc_hook
= emacs_blocked_malloc
;
1391 if (__realloc_hook
!= emacs_blocked_realloc
)
1392 old_realloc_hook
= __realloc_hook
;
1393 __realloc_hook
= emacs_blocked_realloc
;
1396 #endif /* not SYNC_INPUT */
1397 #endif /* not SYSTEM_MALLOC */
1401 /***********************************************************************
1403 ***********************************************************************/
1405 /* Number of intervals allocated in an interval_block structure.
1406 The 1020 is 1024 minus malloc overhead. */
1408 #define INTERVAL_BLOCK_SIZE \
1409 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
1411 /* Intervals are allocated in chunks in form of an interval_block
1414 struct interval_block
1416 /* Place `intervals' first, to preserve alignment. */
1417 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
1418 struct interval_block
*next
;
1421 /* Current interval block. Its `next' pointer points to older
1424 static struct interval_block
*interval_block
;
1426 /* Index in interval_block above of the next unused interval
1429 static int interval_block_index
;
1431 /* Number of free and live intervals. */
1433 static int total_free_intervals
, total_intervals
;
1435 /* List of free intervals. */
1437 INTERVAL interval_free_list
;
1439 /* Total number of interval blocks now in use. */
1441 static int n_interval_blocks
;
1444 /* Initialize interval allocation. */
1449 interval_block
= NULL
;
1450 interval_block_index
= INTERVAL_BLOCK_SIZE
;
1451 interval_free_list
= 0;
1452 n_interval_blocks
= 0;
1456 /* Return a new interval. */
1463 /* eassert (!handling_signal); */
1467 if (interval_free_list
)
1469 val
= interval_free_list
;
1470 interval_free_list
= INTERVAL_PARENT (interval_free_list
);
1474 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
1476 register struct interval_block
*newi
;
1478 newi
= (struct interval_block
*) lisp_malloc (sizeof *newi
,
1481 newi
->next
= interval_block
;
1482 interval_block
= newi
;
1483 interval_block_index
= 0;
1484 n_interval_blocks
++;
1486 val
= &interval_block
->intervals
[interval_block_index
++];
1489 MALLOC_UNBLOCK_INPUT
;
1491 consing_since_gc
+= sizeof (struct interval
);
1493 RESET_INTERVAL (val
);
1499 /* Mark Lisp objects in interval I. */
1502 mark_interval (i
, dummy
)
1503 register INTERVAL i
;
1506 eassert (!i
->gcmarkbit
); /* Intervals are never shared. */
1508 mark_object (i
->plist
);
1512 /* Mark the interval tree rooted in TREE. Don't call this directly;
1513 use the macro MARK_INTERVAL_TREE instead. */
1516 mark_interval_tree (tree
)
1517 register INTERVAL tree
;
1519 /* No need to test if this tree has been marked already; this
1520 function is always called through the MARK_INTERVAL_TREE macro,
1521 which takes care of that. */
1523 traverse_intervals_noorder (tree
, mark_interval
, Qnil
);
1527 /* Mark the interval tree rooted in I. */
1529 #define MARK_INTERVAL_TREE(i) \
1531 if (!NULL_INTERVAL_P (i) && !i->gcmarkbit) \
1532 mark_interval_tree (i); \
1536 #define UNMARK_BALANCE_INTERVALS(i) \
1538 if (! NULL_INTERVAL_P (i)) \
1539 (i) = balance_intervals (i); \
1543 /* Number support. If USE_LISP_UNION_TYPE is in effect, we
1544 can't create number objects in macros. */
1552 obj
.s
.type
= Lisp_Int
;
1557 /***********************************************************************
1559 ***********************************************************************/
1561 /* Lisp_Strings are allocated in string_block structures. When a new
1562 string_block is allocated, all the Lisp_Strings it contains are
1563 added to a free-list string_free_list. When a new Lisp_String is
1564 needed, it is taken from that list. During the sweep phase of GC,
1565 string_blocks that are entirely free are freed, except two which
1568 String data is allocated from sblock structures. Strings larger
1569 than LARGE_STRING_BYTES, get their own sblock, data for smaller
1570 strings is sub-allocated out of sblocks of size SBLOCK_SIZE.
1572 Sblocks consist internally of sdata structures, one for each
1573 Lisp_String. The sdata structure points to the Lisp_String it
1574 belongs to. The Lisp_String points back to the `u.data' member of
1575 its sdata structure.
1577 When a Lisp_String is freed during GC, it is put back on
1578 string_free_list, and its `data' member and its sdata's `string'
1579 pointer is set to null. The size of the string is recorded in the
1580 `u.nbytes' member of the sdata. So, sdata structures that are no
1581 longer used, can be easily recognized, and it's easy to compact the
1582 sblocks of small strings which we do in compact_small_strings. */
1584 /* Size in bytes of an sblock structure used for small strings. This
1585 is 8192 minus malloc overhead. */
1587 #define SBLOCK_SIZE 8188
1589 /* Strings larger than this are considered large strings. String data
1590 for large strings is allocated from individual sblocks. */
1592 #define LARGE_STRING_BYTES 1024
1594 /* Structure describing string memory sub-allocated from an sblock.
1595 This is where the contents of Lisp strings are stored. */
1599 /* Back-pointer to the string this sdata belongs to. If null, this
1600 structure is free, and the NBYTES member of the union below
1601 contains the string's byte size (the same value that STRING_BYTES
1602 would return if STRING were non-null). If non-null, STRING_BYTES
1603 (STRING) is the size of the data, and DATA contains the string's
1605 struct Lisp_String
*string
;
1607 #ifdef GC_CHECK_STRING_BYTES
1610 unsigned char data
[1];
1612 #define SDATA_NBYTES(S) (S)->nbytes
1613 #define SDATA_DATA(S) (S)->data
1615 #else /* not GC_CHECK_STRING_BYTES */
1619 /* When STRING in non-null. */
1620 unsigned char data
[1];
1622 /* When STRING is null. */
1627 #define SDATA_NBYTES(S) (S)->u.nbytes
1628 #define SDATA_DATA(S) (S)->u.data
1630 #endif /* not GC_CHECK_STRING_BYTES */
1634 /* Structure describing a block of memory which is sub-allocated to
1635 obtain string data memory for strings. Blocks for small strings
1636 are of fixed size SBLOCK_SIZE. Blocks for large strings are made
1637 as large as needed. */
1642 struct sblock
*next
;
1644 /* Pointer to the next free sdata block. This points past the end
1645 of the sblock if there isn't any space left in this block. */
1646 struct sdata
*next_free
;
1648 /* Start of data. */
1649 struct sdata first_data
;
1652 /* Number of Lisp strings in a string_block structure. The 1020 is
1653 1024 minus malloc overhead. */
1655 #define STRING_BLOCK_SIZE \
1656 ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String))
1658 /* Structure describing a block from which Lisp_String structures
1663 /* Place `strings' first, to preserve alignment. */
1664 struct Lisp_String strings
[STRING_BLOCK_SIZE
];
1665 struct string_block
*next
;
1668 /* Head and tail of the list of sblock structures holding Lisp string
1669 data. We always allocate from current_sblock. The NEXT pointers
1670 in the sblock structures go from oldest_sblock to current_sblock. */
1672 static struct sblock
*oldest_sblock
, *current_sblock
;
1674 /* List of sblocks for large strings. */
1676 static struct sblock
*large_sblocks
;
1678 /* List of string_block structures, and how many there are. */
1680 static struct string_block
*string_blocks
;
1681 static int n_string_blocks
;
1683 /* Free-list of Lisp_Strings. */
1685 static struct Lisp_String
*string_free_list
;
1687 /* Number of live and free Lisp_Strings. */
1689 static int total_strings
, total_free_strings
;
1691 /* Number of bytes used by live strings. */
1693 static int total_string_size
;
1695 /* Given a pointer to a Lisp_String S which is on the free-list
1696 string_free_list, return a pointer to its successor in the
1699 #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S))
1701 /* Return a pointer to the sdata structure belonging to Lisp string S.
1702 S must be live, i.e. S->data must not be null. S->data is actually
1703 a pointer to the `u.data' member of its sdata structure; the
1704 structure starts at a constant offset in front of that. */
1706 #ifdef GC_CHECK_STRING_BYTES
1708 #define SDATA_OF_STRING(S) \
1709 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *) \
1710 - sizeof (EMACS_INT)))
1712 #else /* not GC_CHECK_STRING_BYTES */
1714 #define SDATA_OF_STRING(S) \
1715 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *)))
1717 #endif /* not GC_CHECK_STRING_BYTES */
1720 #ifdef GC_CHECK_STRING_OVERRUN
1722 /* We check for overrun in string data blocks by appending a small
1723 "cookie" after each allocated string data block, and check for the
1724 presence of this cookie during GC. */
1726 #define GC_STRING_OVERRUN_COOKIE_SIZE 4
1727 static char string_overrun_cookie
[GC_STRING_OVERRUN_COOKIE_SIZE
] =
1728 { 0xde, 0xad, 0xbe, 0xef };
1731 #define GC_STRING_OVERRUN_COOKIE_SIZE 0
1734 /* Value is the size of an sdata structure large enough to hold NBYTES
1735 bytes of string data. The value returned includes a terminating
1736 NUL byte, the size of the sdata structure, and padding. */
1738 #ifdef GC_CHECK_STRING_BYTES
1740 #define SDATA_SIZE(NBYTES) \
1741 ((sizeof (struct Lisp_String *) \
1743 + sizeof (EMACS_INT) \
1744 + sizeof (EMACS_INT) - 1) \
1745 & ~(sizeof (EMACS_INT) - 1))
1747 #else /* not GC_CHECK_STRING_BYTES */
1749 #define SDATA_SIZE(NBYTES) \
1750 ((sizeof (struct Lisp_String *) \
1752 + sizeof (EMACS_INT) - 1) \
1753 & ~(sizeof (EMACS_INT) - 1))
1755 #endif /* not GC_CHECK_STRING_BYTES */
1757 /* Extra bytes to allocate for each string. */
1759 #define GC_STRING_EXTRA (GC_STRING_OVERRUN_COOKIE_SIZE)
1761 /* Initialize string allocation. Called from init_alloc_once. */
1766 total_strings
= total_free_strings
= total_string_size
= 0;
1767 oldest_sblock
= current_sblock
= large_sblocks
= NULL
;
1768 string_blocks
= NULL
;
1769 n_string_blocks
= 0;
1770 string_free_list
= NULL
;
1771 empty_unibyte_string
= make_pure_string ("", 0, 0, 0);
1772 empty_multibyte_string
= make_pure_string ("", 0, 0, 1);
1776 #ifdef GC_CHECK_STRING_BYTES
1778 static int check_string_bytes_count
;
1780 static void check_string_bytes
P_ ((int));
1781 static void check_sblock
P_ ((struct sblock
*));
1783 #define CHECK_STRING_BYTES(S) STRING_BYTES (S)
1786 /* Like GC_STRING_BYTES, but with debugging check. */
1790 struct Lisp_String
*s
;
1792 int nbytes
= (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1793 if (!PURE_POINTER_P (s
)
1795 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1800 /* Check validity of Lisp strings' string_bytes member in B. */
1806 struct sdata
*from
, *end
, *from_end
;
1810 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1812 /* Compute the next FROM here because copying below may
1813 overwrite data we need to compute it. */
1816 /* Check that the string size recorded in the string is the
1817 same as the one recorded in the sdata structure. */
1819 CHECK_STRING_BYTES (from
->string
);
1822 nbytes
= GC_STRING_BYTES (from
->string
);
1824 nbytes
= SDATA_NBYTES (from
);
1826 nbytes
= SDATA_SIZE (nbytes
);
1827 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
1832 /* Check validity of Lisp strings' string_bytes member. ALL_P
1833 non-zero means check all strings, otherwise check only most
1834 recently allocated strings. Used for hunting a bug. */
1837 check_string_bytes (all_p
)
1844 for (b
= large_sblocks
; b
; b
= b
->next
)
1846 struct Lisp_String
*s
= b
->first_data
.string
;
1848 CHECK_STRING_BYTES (s
);
1851 for (b
= oldest_sblock
; b
; b
= b
->next
)
1855 check_sblock (current_sblock
);
1858 #endif /* GC_CHECK_STRING_BYTES */
1860 #ifdef GC_CHECK_STRING_FREE_LIST
1862 /* Walk through the string free list looking for bogus next pointers.
1863 This may catch buffer overrun from a previous string. */
1866 check_string_free_list ()
1868 struct Lisp_String
*s
;
1870 /* Pop a Lisp_String off the free-list. */
1871 s
= string_free_list
;
1874 if ((unsigned)s
< 1024)
1876 s
= NEXT_FREE_LISP_STRING (s
);
1880 #define check_string_free_list()
1883 /* Return a new Lisp_String. */
1885 static struct Lisp_String
*
1888 struct Lisp_String
*s
;
1890 /* eassert (!handling_signal); */
1894 /* If the free-list is empty, allocate a new string_block, and
1895 add all the Lisp_Strings in it to the free-list. */
1896 if (string_free_list
== NULL
)
1898 struct string_block
*b
;
1901 b
= (struct string_block
*) lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1902 bzero (b
, sizeof *b
);
1903 b
->next
= string_blocks
;
1907 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1910 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1911 string_free_list
= s
;
1914 total_free_strings
+= STRING_BLOCK_SIZE
;
1917 check_string_free_list ();
1919 /* Pop a Lisp_String off the free-list. */
1920 s
= string_free_list
;
1921 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1923 MALLOC_UNBLOCK_INPUT
;
1925 /* Probably not strictly necessary, but play it safe. */
1926 bzero (s
, sizeof *s
);
1928 --total_free_strings
;
1931 consing_since_gc
+= sizeof *s
;
1933 #ifdef GC_CHECK_STRING_BYTES
1934 if (!noninteractive
)
1936 if (++check_string_bytes_count
== 200)
1938 check_string_bytes_count
= 0;
1939 check_string_bytes (1);
1942 check_string_bytes (0);
1944 #endif /* GC_CHECK_STRING_BYTES */
1950 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1951 plus a NUL byte at the end. Allocate an sdata structure for S, and
1952 set S->data to its `u.data' member. Store a NUL byte at the end of
1953 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1954 S->data if it was initially non-null. */
1957 allocate_string_data (s
, nchars
, nbytes
)
1958 struct Lisp_String
*s
;
1961 struct sdata
*data
, *old_data
;
1963 int needed
, old_nbytes
;
1965 /* Determine the number of bytes needed to store NBYTES bytes
1967 needed
= SDATA_SIZE (nbytes
);
1968 old_data
= s
->data
? SDATA_OF_STRING (s
) : NULL
;
1969 old_nbytes
= GC_STRING_BYTES (s
);
1973 if (nbytes
> LARGE_STRING_BYTES
)
1975 size_t size
= sizeof *b
- sizeof (struct sdata
) + needed
;
1977 #ifdef DOUG_LEA_MALLOC
1978 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1979 because mapped region contents are not preserved in
1982 In case you think of allowing it in a dumped Emacs at the
1983 cost of not being able to re-dump, there's another reason:
1984 mmap'ed data typically have an address towards the top of the
1985 address space, which won't fit into an EMACS_INT (at least on
1986 32-bit systems with the current tagging scheme). --fx */
1987 mallopt (M_MMAP_MAX
, 0);
1990 b
= (struct sblock
*) lisp_malloc (size
+ GC_STRING_EXTRA
, MEM_TYPE_NON_LISP
);
1992 #ifdef DOUG_LEA_MALLOC
1993 /* Back to a reasonable maximum of mmap'ed areas. */
1994 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1997 b
->next_free
= &b
->first_data
;
1998 b
->first_data
.string
= NULL
;
1999 b
->next
= large_sblocks
;
2002 else if (current_sblock
== NULL
2003 || (((char *) current_sblock
+ SBLOCK_SIZE
2004 - (char *) current_sblock
->next_free
)
2005 < (needed
+ GC_STRING_EXTRA
)))
2007 /* Not enough room in the current sblock. */
2008 b
= (struct sblock
*) lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
2009 b
->next_free
= &b
->first_data
;
2010 b
->first_data
.string
= NULL
;
2014 current_sblock
->next
= b
;
2022 data
= b
->next_free
;
2023 b
->next_free
= (struct sdata
*) ((char *) data
+ needed
+ GC_STRING_EXTRA
);
2025 MALLOC_UNBLOCK_INPUT
;
2028 s
->data
= SDATA_DATA (data
);
2029 #ifdef GC_CHECK_STRING_BYTES
2030 SDATA_NBYTES (data
) = nbytes
;
2033 s
->size_byte
= nbytes
;
2034 s
->data
[nbytes
] = '\0';
2035 #ifdef GC_CHECK_STRING_OVERRUN
2036 bcopy (string_overrun_cookie
, (char *) data
+ needed
,
2037 GC_STRING_OVERRUN_COOKIE_SIZE
);
2040 /* If S had already data assigned, mark that as free by setting its
2041 string back-pointer to null, and recording the size of the data
2045 SDATA_NBYTES (old_data
) = old_nbytes
;
2046 old_data
->string
= NULL
;
2049 consing_since_gc
+= needed
;
2053 /* Sweep and compact strings. */
2058 struct string_block
*b
, *next
;
2059 struct string_block
*live_blocks
= NULL
;
2061 string_free_list
= NULL
;
2062 total_strings
= total_free_strings
= 0;
2063 total_string_size
= 0;
2065 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
2066 for (b
= string_blocks
; b
; b
= next
)
2069 struct Lisp_String
*free_list_before
= string_free_list
;
2073 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
2075 struct Lisp_String
*s
= b
->strings
+ i
;
2079 /* String was not on free-list before. */
2080 if (STRING_MARKED_P (s
))
2082 /* String is live; unmark it and its intervals. */
2085 if (!NULL_INTERVAL_P (s
->intervals
))
2086 UNMARK_BALANCE_INTERVALS (s
->intervals
);
2089 total_string_size
+= STRING_BYTES (s
);
2093 /* String is dead. Put it on the free-list. */
2094 struct sdata
*data
= SDATA_OF_STRING (s
);
2096 /* Save the size of S in its sdata so that we know
2097 how large that is. Reset the sdata's string
2098 back-pointer so that we know it's free. */
2099 #ifdef GC_CHECK_STRING_BYTES
2100 if (GC_STRING_BYTES (s
) != SDATA_NBYTES (data
))
2103 data
->u
.nbytes
= GC_STRING_BYTES (s
);
2105 data
->string
= NULL
;
2107 /* Reset the strings's `data' member so that we
2111 /* Put the string on the free-list. */
2112 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2113 string_free_list
= s
;
2119 /* S was on the free-list before. Put it there again. */
2120 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2121 string_free_list
= s
;
2126 /* Free blocks that contain free Lisp_Strings only, except
2127 the first two of them. */
2128 if (nfree
== STRING_BLOCK_SIZE
2129 && total_free_strings
> STRING_BLOCK_SIZE
)
2133 string_free_list
= free_list_before
;
2137 total_free_strings
+= nfree
;
2138 b
->next
= live_blocks
;
2143 check_string_free_list ();
2145 string_blocks
= live_blocks
;
2146 free_large_strings ();
2147 compact_small_strings ();
2149 check_string_free_list ();
2153 /* Free dead large strings. */
2156 free_large_strings ()
2158 struct sblock
*b
, *next
;
2159 struct sblock
*live_blocks
= NULL
;
2161 for (b
= large_sblocks
; b
; b
= next
)
2165 if (b
->first_data
.string
== NULL
)
2169 b
->next
= live_blocks
;
2174 large_sblocks
= live_blocks
;
2178 /* Compact data of small strings. Free sblocks that don't contain
2179 data of live strings after compaction. */
2182 compact_small_strings ()
2184 struct sblock
*b
, *tb
, *next
;
2185 struct sdata
*from
, *to
, *end
, *tb_end
;
2186 struct sdata
*to_end
, *from_end
;
2188 /* TB is the sblock we copy to, TO is the sdata within TB we copy
2189 to, and TB_END is the end of TB. */
2191 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2192 to
= &tb
->first_data
;
2194 /* Step through the blocks from the oldest to the youngest. We
2195 expect that old blocks will stabilize over time, so that less
2196 copying will happen this way. */
2197 for (b
= oldest_sblock
; b
; b
= b
->next
)
2200 xassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
2202 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
2204 /* Compute the next FROM here because copying below may
2205 overwrite data we need to compute it. */
2208 #ifdef GC_CHECK_STRING_BYTES
2209 /* Check that the string size recorded in the string is the
2210 same as the one recorded in the sdata structure. */
2212 && GC_STRING_BYTES (from
->string
) != SDATA_NBYTES (from
))
2214 #endif /* GC_CHECK_STRING_BYTES */
2217 nbytes
= GC_STRING_BYTES (from
->string
);
2219 nbytes
= SDATA_NBYTES (from
);
2221 if (nbytes
> LARGE_STRING_BYTES
)
2224 nbytes
= SDATA_SIZE (nbytes
);
2225 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
2227 #ifdef GC_CHECK_STRING_OVERRUN
2228 if (bcmp (string_overrun_cookie
,
2229 ((char *) from_end
) - GC_STRING_OVERRUN_COOKIE_SIZE
,
2230 GC_STRING_OVERRUN_COOKIE_SIZE
))
2234 /* FROM->string non-null means it's alive. Copy its data. */
2237 /* If TB is full, proceed with the next sblock. */
2238 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2239 if (to_end
> tb_end
)
2243 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2244 to
= &tb
->first_data
;
2245 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2248 /* Copy, and update the string's `data' pointer. */
2251 xassert (tb
!= b
|| to
<= from
);
2252 safe_bcopy ((char *) from
, (char *) to
, nbytes
+ GC_STRING_EXTRA
);
2253 to
->string
->data
= SDATA_DATA (to
);
2256 /* Advance past the sdata we copied to. */
2262 /* The rest of the sblocks following TB don't contain live data, so
2263 we can free them. */
2264 for (b
= tb
->next
; b
; b
= next
)
2272 current_sblock
= tb
;
2276 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
2277 doc
: /* Return a newly created string of length LENGTH, with INIT in each element.
2278 LENGTH must be an integer.
2279 INIT must be an integer that represents a character. */)
2281 Lisp_Object length
, init
;
2283 register Lisp_Object val
;
2284 register unsigned char *p
, *end
;
2287 CHECK_NATNUM (length
);
2288 CHECK_NUMBER (init
);
2291 if (ASCII_CHAR_P (c
))
2293 nbytes
= XINT (length
);
2294 val
= make_uninit_string (nbytes
);
2296 end
= p
+ SCHARS (val
);
2302 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
2303 int len
= CHAR_STRING (c
, str
);
2305 nbytes
= len
* XINT (length
);
2306 val
= make_uninit_multibyte_string (XINT (length
), nbytes
);
2311 bcopy (str
, p
, len
);
2321 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
2322 doc
: /* Return a new bool-vector of length LENGTH, using INIT for each element.
2323 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
2325 Lisp_Object length
, init
;
2327 register Lisp_Object val
;
2328 struct Lisp_Bool_Vector
*p
;
2330 int length_in_chars
, length_in_elts
, bits_per_value
;
2332 CHECK_NATNUM (length
);
2334 bits_per_value
= sizeof (EMACS_INT
) * BOOL_VECTOR_BITS_PER_CHAR
;
2336 length_in_elts
= (XFASTINT (length
) + bits_per_value
- 1) / bits_per_value
;
2337 length_in_chars
= ((XFASTINT (length
) + BOOL_VECTOR_BITS_PER_CHAR
- 1)
2338 / BOOL_VECTOR_BITS_PER_CHAR
);
2340 /* We must allocate one more elements than LENGTH_IN_ELTS for the
2341 slot `size' of the struct Lisp_Bool_Vector. */
2342 val
= Fmake_vector (make_number (length_in_elts
+ 1), Qnil
);
2344 /* Get rid of any bits that would cause confusion. */
2345 XVECTOR (val
)->size
= 0; /* No Lisp_Object to trace in there. */
2346 /* Use XVECTOR (val) rather than `p' because p->size is not TRT. */
2347 XSETPVECTYPE (XVECTOR (val
), PVEC_BOOL_VECTOR
);
2349 p
= XBOOL_VECTOR (val
);
2350 p
->size
= XFASTINT (length
);
2352 real_init
= (NILP (init
) ? 0 : -1);
2353 for (i
= 0; i
< length_in_chars
; i
++)
2354 p
->data
[i
] = real_init
;
2356 /* Clear the extraneous bits in the last byte. */
2357 if (XINT (length
) != length_in_chars
* BOOL_VECTOR_BITS_PER_CHAR
)
2358 p
->data
[length_in_chars
- 1]
2359 &= (1 << (XINT (length
) % BOOL_VECTOR_BITS_PER_CHAR
)) - 1;
2365 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
2366 of characters from the contents. This string may be unibyte or
2367 multibyte, depending on the contents. */
2370 make_string (contents
, nbytes
)
2371 const char *contents
;
2374 register Lisp_Object val
;
2375 int nchars
, multibyte_nbytes
;
2377 parse_str_as_multibyte (contents
, nbytes
, &nchars
, &multibyte_nbytes
);
2378 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
2379 /* CONTENTS contains no multibyte sequences or contains an invalid
2380 multibyte sequence. We must make unibyte string. */
2381 val
= make_unibyte_string (contents
, nbytes
);
2383 val
= make_multibyte_string (contents
, nchars
, nbytes
);
2388 /* Make an unibyte string from LENGTH bytes at CONTENTS. */
2391 make_unibyte_string (contents
, length
)
2392 const char *contents
;
2395 register Lisp_Object val
;
2396 val
= make_uninit_string (length
);
2397 bcopy (contents
, SDATA (val
), length
);
2398 STRING_SET_UNIBYTE (val
);
2403 /* Make a multibyte string from NCHARS characters occupying NBYTES
2404 bytes at CONTENTS. */
2407 make_multibyte_string (contents
, nchars
, nbytes
)
2408 const char *contents
;
2411 register Lisp_Object val
;
2412 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2413 bcopy (contents
, SDATA (val
), nbytes
);
2418 /* Make a string from NCHARS characters occupying NBYTES bytes at
2419 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2422 make_string_from_bytes (contents
, nchars
, nbytes
)
2423 const char *contents
;
2426 register Lisp_Object val
;
2427 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2428 bcopy (contents
, SDATA (val
), nbytes
);
2429 if (SBYTES (val
) == SCHARS (val
))
2430 STRING_SET_UNIBYTE (val
);
2435 /* Make a string from NCHARS characters occupying NBYTES bytes at
2436 CONTENTS. The argument MULTIBYTE controls whether to label the
2437 string as multibyte. If NCHARS is negative, it counts the number of
2438 characters by itself. */
2441 make_specified_string (contents
, nchars
, nbytes
, multibyte
)
2442 const char *contents
;
2446 register Lisp_Object val
;
2451 nchars
= multibyte_chars_in_text (contents
, nbytes
);
2455 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2456 bcopy (contents
, SDATA (val
), nbytes
);
2458 STRING_SET_UNIBYTE (val
);
2463 /* Make a string from the data at STR, treating it as multibyte if the
2470 return make_string (str
, strlen (str
));
2474 /* Return an unibyte Lisp_String set up to hold LENGTH characters
2475 occupying LENGTH bytes. */
2478 make_uninit_string (length
)
2484 return empty_unibyte_string
;
2485 val
= make_uninit_multibyte_string (length
, length
);
2486 STRING_SET_UNIBYTE (val
);
2491 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2492 which occupy NBYTES bytes. */
2495 make_uninit_multibyte_string (nchars
, nbytes
)
2499 struct Lisp_String
*s
;
2504 return empty_multibyte_string
;
2506 s
= allocate_string ();
2507 allocate_string_data (s
, nchars
, nbytes
);
2508 XSETSTRING (string
, s
);
2509 string_chars_consed
+= nbytes
;
2515 /***********************************************************************
2517 ***********************************************************************/
2519 /* We store float cells inside of float_blocks, allocating a new
2520 float_block with malloc whenever necessary. Float cells reclaimed
2521 by GC are put on a free list to be reallocated before allocating
2522 any new float cells from the latest float_block. */
2524 #define FLOAT_BLOCK_SIZE \
2525 (((BLOCK_BYTES - sizeof (struct float_block *) \
2526 /* The compiler might add padding at the end. */ \
2527 - (sizeof (struct Lisp_Float) - sizeof (int))) * CHAR_BIT) \
2528 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2530 #define GETMARKBIT(block,n) \
2531 (((block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2532 >> ((n) % (sizeof(int) * CHAR_BIT))) \
2535 #define SETMARKBIT(block,n) \
2536 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2537 |= 1 << ((n) % (sizeof(int) * CHAR_BIT))
2539 #define UNSETMARKBIT(block,n) \
2540 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2541 &= ~(1 << ((n) % (sizeof(int) * CHAR_BIT)))
2543 #define FLOAT_BLOCK(fptr) \
2544 ((struct float_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2546 #define FLOAT_INDEX(fptr) \
2547 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2551 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2552 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2553 int gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2554 struct float_block
*next
;
2557 #define FLOAT_MARKED_P(fptr) \
2558 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2560 #define FLOAT_MARK(fptr) \
2561 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2563 #define FLOAT_UNMARK(fptr) \
2564 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2566 /* Current float_block. */
2568 struct float_block
*float_block
;
2570 /* Index of first unused Lisp_Float in the current float_block. */
2572 int float_block_index
;
2574 /* Total number of float blocks now in use. */
2578 /* Free-list of Lisp_Floats. */
2580 struct Lisp_Float
*float_free_list
;
2583 /* Initialize float allocation. */
2589 float_block_index
= FLOAT_BLOCK_SIZE
; /* Force alloc of new float_block. */
2590 float_free_list
= 0;
2595 /* Explicitly free a float cell by putting it on the free-list. */
2599 struct Lisp_Float
*ptr
;
2601 ptr
->u
.chain
= float_free_list
;
2602 float_free_list
= ptr
;
2606 /* Return a new float object with value FLOAT_VALUE. */
2609 make_float (float_value
)
2612 register Lisp_Object val
;
2614 /* eassert (!handling_signal); */
2618 if (float_free_list
)
2620 /* We use the data field for chaining the free list
2621 so that we won't use the same field that has the mark bit. */
2622 XSETFLOAT (val
, float_free_list
);
2623 float_free_list
= float_free_list
->u
.chain
;
2627 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2629 register struct float_block
*new;
2631 new = (struct float_block
*) lisp_align_malloc (sizeof *new,
2633 new->next
= float_block
;
2634 bzero ((char *) new->gcmarkbits
, sizeof new->gcmarkbits
);
2636 float_block_index
= 0;
2639 XSETFLOAT (val
, &float_block
->floats
[float_block_index
]);
2640 float_block_index
++;
2643 MALLOC_UNBLOCK_INPUT
;
2645 XFLOAT_INIT (val
, float_value
);
2646 eassert (!FLOAT_MARKED_P (XFLOAT (val
)));
2647 consing_since_gc
+= sizeof (struct Lisp_Float
);
2654 /***********************************************************************
2656 ***********************************************************************/
2658 /* We store cons cells inside of cons_blocks, allocating a new
2659 cons_block with malloc whenever necessary. Cons cells reclaimed by
2660 GC are put on a free list to be reallocated before allocating
2661 any new cons cells from the latest cons_block. */
2663 #define CONS_BLOCK_SIZE \
2664 (((BLOCK_BYTES - sizeof (struct cons_block *)) * CHAR_BIT) \
2665 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2667 #define CONS_BLOCK(fptr) \
2668 ((struct cons_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2670 #define CONS_INDEX(fptr) \
2671 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2675 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2676 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2677 int gcmarkbits
[1 + CONS_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2678 struct cons_block
*next
;
2681 #define CONS_MARKED_P(fptr) \
2682 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2684 #define CONS_MARK(fptr) \
2685 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2687 #define CONS_UNMARK(fptr) \
2688 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2690 /* Current cons_block. */
2692 struct cons_block
*cons_block
;
2694 /* Index of first unused Lisp_Cons in the current block. */
2696 int cons_block_index
;
2698 /* Free-list of Lisp_Cons structures. */
2700 struct Lisp_Cons
*cons_free_list
;
2702 /* Total number of cons blocks now in use. */
2704 static int n_cons_blocks
;
2707 /* Initialize cons allocation. */
2713 cons_block_index
= CONS_BLOCK_SIZE
; /* Force alloc of new cons_block. */
2719 /* Explicitly free a cons cell by putting it on the free-list. */
2723 struct Lisp_Cons
*ptr
;
2725 ptr
->u
.chain
= cons_free_list
;
2729 cons_free_list
= ptr
;
2732 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
2733 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2735 Lisp_Object car
, cdr
;
2737 register Lisp_Object val
;
2739 /* eassert (!handling_signal); */
2745 /* We use the cdr for chaining the free list
2746 so that we won't use the same field that has the mark bit. */
2747 XSETCONS (val
, cons_free_list
);
2748 cons_free_list
= cons_free_list
->u
.chain
;
2752 if (cons_block_index
== CONS_BLOCK_SIZE
)
2754 register struct cons_block
*new;
2755 new = (struct cons_block
*) lisp_align_malloc (sizeof *new,
2757 bzero ((char *) new->gcmarkbits
, sizeof new->gcmarkbits
);
2758 new->next
= cons_block
;
2760 cons_block_index
= 0;
2763 XSETCONS (val
, &cons_block
->conses
[cons_block_index
]);
2767 MALLOC_UNBLOCK_INPUT
;
2771 eassert (!CONS_MARKED_P (XCONS (val
)));
2772 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2773 cons_cells_consed
++;
2777 /* Get an error now if there's any junk in the cons free list. */
2781 #ifdef GC_CHECK_CONS_LIST
2782 struct Lisp_Cons
*tail
= cons_free_list
;
2785 tail
= tail
->u
.chain
;
2789 /* Make a list of 1, 2, 3, 4 or 5 specified objects. */
2795 return Fcons (arg1
, Qnil
);
2800 Lisp_Object arg1
, arg2
;
2802 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2807 list3 (arg1
, arg2
, arg3
)
2808 Lisp_Object arg1
, arg2
, arg3
;
2810 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2815 list4 (arg1
, arg2
, arg3
, arg4
)
2816 Lisp_Object arg1
, arg2
, arg3
, arg4
;
2818 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2823 list5 (arg1
, arg2
, arg3
, arg4
, arg5
)
2824 Lisp_Object arg1
, arg2
, arg3
, arg4
, arg5
;
2826 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2827 Fcons (arg5
, Qnil
)))));
2831 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
2832 doc
: /* Return a newly created list with specified arguments as elements.
2833 Any number of arguments, even zero arguments, are allowed.
2834 usage: (list &rest OBJECTS) */)
2837 register Lisp_Object
*args
;
2839 register Lisp_Object val
;
2845 val
= Fcons (args
[nargs
], val
);
2851 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2852 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2854 register Lisp_Object length
, init
;
2856 register Lisp_Object val
;
2859 CHECK_NATNUM (length
);
2860 size
= XFASTINT (length
);
2865 val
= Fcons (init
, val
);
2870 val
= Fcons (init
, val
);
2875 val
= Fcons (init
, val
);
2880 val
= Fcons (init
, val
);
2885 val
= Fcons (init
, val
);
2900 /***********************************************************************
2902 ***********************************************************************/
2904 /* Singly-linked list of all vectors. */
2906 static struct Lisp_Vector
*all_vectors
;
2908 /* Total number of vector-like objects now in use. */
2910 static int n_vectors
;
2913 /* Value is a pointer to a newly allocated Lisp_Vector structure
2914 with room for LEN Lisp_Objects. */
2916 static struct Lisp_Vector
*
2917 allocate_vectorlike (len
)
2920 struct Lisp_Vector
*p
;
2925 #ifdef DOUG_LEA_MALLOC
2926 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
2927 because mapped region contents are not preserved in
2929 mallopt (M_MMAP_MAX
, 0);
2932 /* This gets triggered by code which I haven't bothered to fix. --Stef */
2933 /* eassert (!handling_signal); */
2935 nbytes
= sizeof *p
+ (len
- 1) * sizeof p
->contents
[0];
2936 p
= (struct Lisp_Vector
*) lisp_malloc (nbytes
, MEM_TYPE_VECTORLIKE
);
2938 #ifdef DOUG_LEA_MALLOC
2939 /* Back to a reasonable maximum of mmap'ed areas. */
2940 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2943 consing_since_gc
+= nbytes
;
2944 vector_cells_consed
+= len
;
2946 p
->next
= all_vectors
;
2949 MALLOC_UNBLOCK_INPUT
;
2956 /* Allocate a vector with NSLOTS slots. */
2958 struct Lisp_Vector
*
2959 allocate_vector (nslots
)
2962 struct Lisp_Vector
*v
= allocate_vectorlike (nslots
);
2968 /* Allocate other vector-like structures. */
2970 struct Lisp_Vector
*
2971 allocate_pseudovector (memlen
, lisplen
, tag
)
2972 int memlen
, lisplen
;
2975 struct Lisp_Vector
*v
= allocate_vectorlike (memlen
);
2978 /* Only the first lisplen slots will be traced normally by the GC. */
2980 for (i
= 0; i
< lisplen
; ++i
)
2981 v
->contents
[i
] = Qnil
;
2983 XSETPVECTYPE (v
, tag
); /* Add the appropriate tag. */
2987 struct Lisp_Hash_Table
*
2988 allocate_hash_table (void)
2990 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Hash_Table
, count
, PVEC_HASH_TABLE
);
2997 return ALLOCATE_PSEUDOVECTOR(struct window
, current_matrix
, PVEC_WINDOW
);
3002 allocate_terminal ()
3004 struct terminal
*t
= ALLOCATE_PSEUDOVECTOR (struct terminal
,
3005 next_terminal
, PVEC_TERMINAL
);
3006 /* Zero out the non-GC'd fields. FIXME: This should be made unnecessary. */
3007 bzero (&(t
->next_terminal
),
3008 ((char*)(t
+1)) - ((char*)&(t
->next_terminal
)));
3016 struct frame
*f
= ALLOCATE_PSEUDOVECTOR (struct frame
,
3017 face_cache
, PVEC_FRAME
);
3018 /* Zero out the non-GC'd fields. FIXME: This should be made unnecessary. */
3019 bzero (&(f
->face_cache
),
3020 ((char*)(f
+1)) - ((char*)&(f
->face_cache
)));
3025 struct Lisp_Process
*
3028 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Process
, pid
, PVEC_PROCESS
);
3032 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
3033 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
3034 See also the function `vector'. */)
3036 register Lisp_Object length
, init
;
3039 register EMACS_INT sizei
;
3041 register struct Lisp_Vector
*p
;
3043 CHECK_NATNUM (length
);
3044 sizei
= XFASTINT (length
);
3046 p
= allocate_vector (sizei
);
3047 for (index
= 0; index
< sizei
; index
++)
3048 p
->contents
[index
] = init
;
3050 XSETVECTOR (vector
, p
);
3055 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
3056 doc
: /* Return a newly created vector with specified arguments as elements.
3057 Any number of arguments, even zero arguments, are allowed.
3058 usage: (vector &rest OBJECTS) */)
3063 register Lisp_Object len
, val
;
3065 register struct Lisp_Vector
*p
;
3067 XSETFASTINT (len
, nargs
);
3068 val
= Fmake_vector (len
, Qnil
);
3070 for (index
= 0; index
< nargs
; index
++)
3071 p
->contents
[index
] = args
[index
];
3076 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
3077 doc
: /* Create a byte-code object with specified arguments as elements.
3078 The arguments should be the arglist, bytecode-string, constant vector,
3079 stack size, (optional) doc string, and (optional) interactive spec.
3080 The first four arguments are required; at most six have any
3082 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
3087 register Lisp_Object len
, val
;
3089 register struct Lisp_Vector
*p
;
3091 XSETFASTINT (len
, nargs
);
3092 if (!NILP (Vpurify_flag
))
3093 val
= make_pure_vector ((EMACS_INT
) nargs
);
3095 val
= Fmake_vector (len
, Qnil
);
3097 if (STRINGP (args
[1]) && STRING_MULTIBYTE (args
[1]))
3098 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
3099 earlier because they produced a raw 8-bit string for byte-code
3100 and now such a byte-code string is loaded as multibyte while
3101 raw 8-bit characters converted to multibyte form. Thus, now we
3102 must convert them back to the original unibyte form. */
3103 args
[1] = Fstring_as_unibyte (args
[1]);
3106 for (index
= 0; index
< nargs
; index
++)
3108 if (!NILP (Vpurify_flag
))
3109 args
[index
] = Fpurecopy (args
[index
]);
3110 p
->contents
[index
] = args
[index
];
3112 XSETPVECTYPE (p
, PVEC_COMPILED
);
3113 XSETCOMPILED (val
, p
);
3119 /***********************************************************************
3121 ***********************************************************************/
3123 /* Each symbol_block is just under 1020 bytes long, since malloc
3124 really allocates in units of powers of two and uses 4 bytes for its
3127 #define SYMBOL_BLOCK_SIZE \
3128 ((1020 - sizeof (struct symbol_block *)) / sizeof (struct Lisp_Symbol))
3132 /* Place `symbols' first, to preserve alignment. */
3133 struct Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
3134 struct symbol_block
*next
;
3137 /* Current symbol block and index of first unused Lisp_Symbol
3140 static struct symbol_block
*symbol_block
;
3141 static int symbol_block_index
;
3143 /* List of free symbols. */
3145 static struct Lisp_Symbol
*symbol_free_list
;
3147 /* Total number of symbol blocks now in use. */
3149 static int n_symbol_blocks
;
3152 /* Initialize symbol allocation. */
3157 symbol_block
= NULL
;
3158 symbol_block_index
= SYMBOL_BLOCK_SIZE
;
3159 symbol_free_list
= 0;
3160 n_symbol_blocks
= 0;
3164 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
3165 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
3166 Its value and function definition are void, and its property list is nil. */)
3170 register Lisp_Object val
;
3171 register struct Lisp_Symbol
*p
;
3173 CHECK_STRING (name
);
3175 /* eassert (!handling_signal); */
3179 if (symbol_free_list
)
3181 XSETSYMBOL (val
, symbol_free_list
);
3182 symbol_free_list
= symbol_free_list
->next
;
3186 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
3188 struct symbol_block
*new;
3189 new = (struct symbol_block
*) lisp_malloc (sizeof *new,
3191 new->next
= symbol_block
;
3193 symbol_block_index
= 0;
3196 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
]);
3197 symbol_block_index
++;
3200 MALLOC_UNBLOCK_INPUT
;
3205 p
->value
= Qunbound
;
3206 p
->function
= Qunbound
;
3209 p
->interned
= SYMBOL_UNINTERNED
;
3211 p
->indirect_variable
= 0;
3212 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
3219 /***********************************************************************
3220 Marker (Misc) Allocation
3221 ***********************************************************************/
3223 /* Allocation of markers and other objects that share that structure.
3224 Works like allocation of conses. */
3226 #define MARKER_BLOCK_SIZE \
3227 ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc))
3231 /* Place `markers' first, to preserve alignment. */
3232 union Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
3233 struct marker_block
*next
;
3236 static struct marker_block
*marker_block
;
3237 static int marker_block_index
;
3239 static union Lisp_Misc
*marker_free_list
;
3241 /* Total number of marker blocks now in use. */
3243 static int n_marker_blocks
;
3248 marker_block
= NULL
;
3249 marker_block_index
= MARKER_BLOCK_SIZE
;
3250 marker_free_list
= 0;
3251 n_marker_blocks
= 0;
3254 /* Return a newly allocated Lisp_Misc object, with no substructure. */
3261 /* eassert (!handling_signal); */
3265 if (marker_free_list
)
3267 XSETMISC (val
, marker_free_list
);
3268 marker_free_list
= marker_free_list
->u_free
.chain
;
3272 if (marker_block_index
== MARKER_BLOCK_SIZE
)
3274 struct marker_block
*new;
3275 new = (struct marker_block
*) lisp_malloc (sizeof *new,
3277 new->next
= marker_block
;
3279 marker_block_index
= 0;
3281 total_free_markers
+= MARKER_BLOCK_SIZE
;
3283 XSETMISC (val
, &marker_block
->markers
[marker_block_index
]);
3284 marker_block_index
++;
3287 MALLOC_UNBLOCK_INPUT
;
3289 --total_free_markers
;
3290 consing_since_gc
+= sizeof (union Lisp_Misc
);
3291 misc_objects_consed
++;
3292 XMISCANY (val
)->gcmarkbit
= 0;
3296 /* Free a Lisp_Misc object */
3302 XMISCTYPE (misc
) = Lisp_Misc_Free
;
3303 XMISC (misc
)->u_free
.chain
= marker_free_list
;
3304 marker_free_list
= XMISC (misc
);
3306 total_free_markers
++;
3309 /* Return a Lisp_Misc_Save_Value object containing POINTER and
3310 INTEGER. This is used to package C values to call record_unwind_protect.
3311 The unwind function can get the C values back using XSAVE_VALUE. */
3314 make_save_value (pointer
, integer
)
3318 register Lisp_Object val
;
3319 register struct Lisp_Save_Value
*p
;
3321 val
= allocate_misc ();
3322 XMISCTYPE (val
) = Lisp_Misc_Save_Value
;
3323 p
= XSAVE_VALUE (val
);
3324 p
->pointer
= pointer
;
3325 p
->integer
= integer
;
3330 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
3331 doc
: /* Return a newly allocated marker which does not point at any place. */)
3334 register Lisp_Object val
;
3335 register struct Lisp_Marker
*p
;
3337 val
= allocate_misc ();
3338 XMISCTYPE (val
) = Lisp_Misc_Marker
;
3344 p
->insertion_type
= 0;
3348 /* Put MARKER back on the free list after using it temporarily. */
3351 free_marker (marker
)
3354 unchain_marker (XMARKER (marker
));
3359 /* Return a newly created vector or string with specified arguments as
3360 elements. If all the arguments are characters that can fit
3361 in a string of events, make a string; otherwise, make a vector.
3363 Any number of arguments, even zero arguments, are allowed. */
3366 make_event_array (nargs
, args
)
3372 for (i
= 0; i
< nargs
; i
++)
3373 /* The things that fit in a string
3374 are characters that are in 0...127,
3375 after discarding the meta bit and all the bits above it. */
3376 if (!INTEGERP (args
[i
])
3377 || (XUINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
3378 return Fvector (nargs
, args
);
3380 /* Since the loop exited, we know that all the things in it are
3381 characters, so we can make a string. */
3385 result
= Fmake_string (make_number (nargs
), make_number (0));
3386 for (i
= 0; i
< nargs
; i
++)
3388 SSET (result
, i
, XINT (args
[i
]));
3389 /* Move the meta bit to the right place for a string char. */
3390 if (XINT (args
[i
]) & CHAR_META
)
3391 SSET (result
, i
, SREF (result
, i
) | 0x80);
3400 /************************************************************************
3401 Memory Full Handling
3402 ************************************************************************/
3405 /* Called if malloc returns zero. */
3414 memory_full_cons_threshold
= sizeof (struct cons_block
);
3416 /* The first time we get here, free the spare memory. */
3417 for (i
= 0; i
< sizeof (spare_memory
) / sizeof (char *); i
++)
3418 if (spare_memory
[i
])
3421 free (spare_memory
[i
]);
3422 else if (i
>= 1 && i
<= 4)
3423 lisp_align_free (spare_memory
[i
]);
3425 lisp_free (spare_memory
[i
]);
3426 spare_memory
[i
] = 0;
3429 /* Record the space now used. When it decreases substantially,
3430 we can refill the memory reserve. */
3431 #ifndef SYSTEM_MALLOC
3432 bytes_used_when_full
= BYTES_USED
;
3435 /* This used to call error, but if we've run out of memory, we could
3436 get infinite recursion trying to build the string. */
3437 xsignal (Qnil
, Vmemory_signal_data
);
3440 /* If we released our reserve (due to running out of memory),
3441 and we have a fair amount free once again,
3442 try to set aside another reserve in case we run out once more.
3444 This is called when a relocatable block is freed in ralloc.c,
3445 and also directly from this file, in case we're not using ralloc.c. */
3448 refill_memory_reserve ()
3450 #ifndef SYSTEM_MALLOC
3451 if (spare_memory
[0] == 0)
3452 spare_memory
[0] = (char *) malloc ((size_t) SPARE_MEMORY
);
3453 if (spare_memory
[1] == 0)
3454 spare_memory
[1] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3456 if (spare_memory
[2] == 0)
3457 spare_memory
[2] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3459 if (spare_memory
[3] == 0)
3460 spare_memory
[3] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3462 if (spare_memory
[4] == 0)
3463 spare_memory
[4] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3465 if (spare_memory
[5] == 0)
3466 spare_memory
[5] = (char *) lisp_malloc (sizeof (struct string_block
),
3468 if (spare_memory
[6] == 0)
3469 spare_memory
[6] = (char *) lisp_malloc (sizeof (struct string_block
),
3471 if (spare_memory
[0] && spare_memory
[1] && spare_memory
[5])
3472 Vmemory_full
= Qnil
;
3476 /************************************************************************
3478 ************************************************************************/
3480 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
3482 /* Conservative C stack marking requires a method to identify possibly
3483 live Lisp objects given a pointer value. We do this by keeping
3484 track of blocks of Lisp data that are allocated in a red-black tree
3485 (see also the comment of mem_node which is the type of nodes in
3486 that tree). Function lisp_malloc adds information for an allocated
3487 block to the red-black tree with calls to mem_insert, and function
3488 lisp_free removes it with mem_delete. Functions live_string_p etc
3489 call mem_find to lookup information about a given pointer in the
3490 tree, and use that to determine if the pointer points to a Lisp
3493 /* Initialize this part of alloc.c. */
3498 mem_z
.left
= mem_z
.right
= MEM_NIL
;
3499 mem_z
.parent
= NULL
;
3500 mem_z
.color
= MEM_BLACK
;
3501 mem_z
.start
= mem_z
.end
= NULL
;
3506 /* Value is a pointer to the mem_node containing START. Value is
3507 MEM_NIL if there is no node in the tree containing START. */
3509 static INLINE
struct mem_node
*
3515 if (start
< min_heap_address
|| start
> max_heap_address
)
3518 /* Make the search always successful to speed up the loop below. */
3519 mem_z
.start
= start
;
3520 mem_z
.end
= (char *) start
+ 1;
3523 while (start
< p
->start
|| start
>= p
->end
)
3524 p
= start
< p
->start
? p
->left
: p
->right
;
3529 /* Insert a new node into the tree for a block of memory with start
3530 address START, end address END, and type TYPE. Value is a
3531 pointer to the node that was inserted. */
3533 static struct mem_node
*
3534 mem_insert (start
, end
, type
)
3538 struct mem_node
*c
, *parent
, *x
;
3540 if (min_heap_address
== NULL
|| start
< min_heap_address
)
3541 min_heap_address
= start
;
3542 if (max_heap_address
== NULL
|| end
> max_heap_address
)
3543 max_heap_address
= end
;
3545 /* See where in the tree a node for START belongs. In this
3546 particular application, it shouldn't happen that a node is already
3547 present. For debugging purposes, let's check that. */
3551 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3553 while (c
!= MEM_NIL
)
3555 if (start
>= c
->start
&& start
< c
->end
)
3558 c
= start
< c
->start
? c
->left
: c
->right
;
3561 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3563 while (c
!= MEM_NIL
)
3566 c
= start
< c
->start
? c
->left
: c
->right
;
3569 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3571 /* Create a new node. */
3572 #ifdef GC_MALLOC_CHECK
3573 x
= (struct mem_node
*) _malloc_internal (sizeof *x
);
3577 x
= (struct mem_node
*) xmalloc (sizeof *x
);
3583 x
->left
= x
->right
= MEM_NIL
;
3586 /* Insert it as child of PARENT or install it as root. */
3589 if (start
< parent
->start
)
3597 /* Re-establish red-black tree properties. */
3598 mem_insert_fixup (x
);
3604 /* Re-establish the red-black properties of the tree, and thereby
3605 balance the tree, after node X has been inserted; X is always red. */
3608 mem_insert_fixup (x
)
3611 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3613 /* X is red and its parent is red. This is a violation of
3614 red-black tree property #3. */
3616 if (x
->parent
== x
->parent
->parent
->left
)
3618 /* We're on the left side of our grandparent, and Y is our
3620 struct mem_node
*y
= x
->parent
->parent
->right
;
3622 if (y
->color
== MEM_RED
)
3624 /* Uncle and parent are red but should be black because
3625 X is red. Change the colors accordingly and proceed
3626 with the grandparent. */
3627 x
->parent
->color
= MEM_BLACK
;
3628 y
->color
= MEM_BLACK
;
3629 x
->parent
->parent
->color
= MEM_RED
;
3630 x
= x
->parent
->parent
;
3634 /* Parent and uncle have different colors; parent is
3635 red, uncle is black. */
3636 if (x
== x
->parent
->right
)
3639 mem_rotate_left (x
);
3642 x
->parent
->color
= MEM_BLACK
;
3643 x
->parent
->parent
->color
= MEM_RED
;
3644 mem_rotate_right (x
->parent
->parent
);
3649 /* This is the symmetrical case of above. */
3650 struct mem_node
*y
= x
->parent
->parent
->left
;
3652 if (y
->color
== MEM_RED
)
3654 x
->parent
->color
= MEM_BLACK
;
3655 y
->color
= MEM_BLACK
;
3656 x
->parent
->parent
->color
= MEM_RED
;
3657 x
= x
->parent
->parent
;
3661 if (x
== x
->parent
->left
)
3664 mem_rotate_right (x
);
3667 x
->parent
->color
= MEM_BLACK
;
3668 x
->parent
->parent
->color
= MEM_RED
;
3669 mem_rotate_left (x
->parent
->parent
);
3674 /* The root may have been changed to red due to the algorithm. Set
3675 it to black so that property #5 is satisfied. */
3676 mem_root
->color
= MEM_BLACK
;
3692 /* Turn y's left sub-tree into x's right sub-tree. */
3695 if (y
->left
!= MEM_NIL
)
3696 y
->left
->parent
= x
;
3698 /* Y's parent was x's parent. */
3700 y
->parent
= x
->parent
;
3702 /* Get the parent to point to y instead of x. */
3705 if (x
== x
->parent
->left
)
3706 x
->parent
->left
= y
;
3708 x
->parent
->right
= y
;
3713 /* Put x on y's left. */
3727 mem_rotate_right (x
)
3730 struct mem_node
*y
= x
->left
;
3733 if (y
->right
!= MEM_NIL
)
3734 y
->right
->parent
= x
;
3737 y
->parent
= x
->parent
;
3740 if (x
== x
->parent
->right
)
3741 x
->parent
->right
= y
;
3743 x
->parent
->left
= y
;
3754 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
3760 struct mem_node
*x
, *y
;
3762 if (!z
|| z
== MEM_NIL
)
3765 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
3770 while (y
->left
!= MEM_NIL
)
3774 if (y
->left
!= MEM_NIL
)
3779 x
->parent
= y
->parent
;
3782 if (y
== y
->parent
->left
)
3783 y
->parent
->left
= x
;
3785 y
->parent
->right
= x
;
3792 z
->start
= y
->start
;
3797 if (y
->color
== MEM_BLACK
)
3798 mem_delete_fixup (x
);
3800 #ifdef GC_MALLOC_CHECK
3808 /* Re-establish the red-black properties of the tree, after a
3812 mem_delete_fixup (x
)
3815 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
3817 if (x
== x
->parent
->left
)
3819 struct mem_node
*w
= x
->parent
->right
;
3821 if (w
->color
== MEM_RED
)
3823 w
->color
= MEM_BLACK
;
3824 x
->parent
->color
= MEM_RED
;
3825 mem_rotate_left (x
->parent
);
3826 w
= x
->parent
->right
;
3829 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
3836 if (w
->right
->color
== MEM_BLACK
)
3838 w
->left
->color
= MEM_BLACK
;
3840 mem_rotate_right (w
);
3841 w
= x
->parent
->right
;
3843 w
->color
= x
->parent
->color
;
3844 x
->parent
->color
= MEM_BLACK
;
3845 w
->right
->color
= MEM_BLACK
;
3846 mem_rotate_left (x
->parent
);
3852 struct mem_node
*w
= x
->parent
->left
;
3854 if (w
->color
== MEM_RED
)
3856 w
->color
= MEM_BLACK
;
3857 x
->parent
->color
= MEM_RED
;
3858 mem_rotate_right (x
->parent
);
3859 w
= x
->parent
->left
;
3862 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
3869 if (w
->left
->color
== MEM_BLACK
)
3871 w
->right
->color
= MEM_BLACK
;
3873 mem_rotate_left (w
);
3874 w
= x
->parent
->left
;
3877 w
->color
= x
->parent
->color
;
3878 x
->parent
->color
= MEM_BLACK
;
3879 w
->left
->color
= MEM_BLACK
;
3880 mem_rotate_right (x
->parent
);
3886 x
->color
= MEM_BLACK
;
3890 /* Value is non-zero if P is a pointer to a live Lisp string on
3891 the heap. M is a pointer to the mem_block for P. */
3894 live_string_p (m
, p
)
3898 if (m
->type
== MEM_TYPE_STRING
)
3900 struct string_block
*b
= (struct string_block
*) m
->start
;
3901 int offset
= (char *) p
- (char *) &b
->strings
[0];
3903 /* P must point to the start of a Lisp_String structure, and it
3904 must not be on the free-list. */
3906 && offset
% sizeof b
->strings
[0] == 0
3907 && offset
< (STRING_BLOCK_SIZE
* sizeof b
->strings
[0])
3908 && ((struct Lisp_String
*) p
)->data
!= NULL
);
3915 /* Value is non-zero if P is a pointer to a live Lisp cons on
3916 the heap. M is a pointer to the mem_block for P. */
3923 if (m
->type
== MEM_TYPE_CONS
)
3925 struct cons_block
*b
= (struct cons_block
*) m
->start
;
3926 int offset
= (char *) p
- (char *) &b
->conses
[0];
3928 /* P must point to the start of a Lisp_Cons, not be
3929 one of the unused cells in the current cons block,
3930 and not be on the free-list. */
3932 && offset
% sizeof b
->conses
[0] == 0
3933 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
3935 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
3936 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
3943 /* Value is non-zero if P is a pointer to a live Lisp symbol on
3944 the heap. M is a pointer to the mem_block for P. */
3947 live_symbol_p (m
, p
)
3951 if (m
->type
== MEM_TYPE_SYMBOL
)
3953 struct symbol_block
*b
= (struct symbol_block
*) m
->start
;
3954 int offset
= (char *) p
- (char *) &b
->symbols
[0];
3956 /* P must point to the start of a Lisp_Symbol, not be
3957 one of the unused cells in the current symbol block,
3958 and not be on the free-list. */
3960 && offset
% sizeof b
->symbols
[0] == 0
3961 && offset
< (SYMBOL_BLOCK_SIZE
* sizeof b
->symbols
[0])
3962 && (b
!= symbol_block
3963 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
3964 && !EQ (((struct Lisp_Symbol
*) p
)->function
, Vdead
));
3971 /* Value is non-zero if P is a pointer to a live Lisp float on
3972 the heap. M is a pointer to the mem_block for P. */
3979 if (m
->type
== MEM_TYPE_FLOAT
)
3981 struct float_block
*b
= (struct float_block
*) m
->start
;
3982 int offset
= (char *) p
- (char *) &b
->floats
[0];
3984 /* P must point to the start of a Lisp_Float and not be
3985 one of the unused cells in the current float block. */
3987 && offset
% sizeof b
->floats
[0] == 0
3988 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
3989 && (b
!= float_block
3990 || offset
/ sizeof b
->floats
[0] < float_block_index
));
3997 /* Value is non-zero if P is a pointer to a live Lisp Misc on
3998 the heap. M is a pointer to the mem_block for P. */
4005 if (m
->type
== MEM_TYPE_MISC
)
4007 struct marker_block
*b
= (struct marker_block
*) m
->start
;
4008 int offset
= (char *) p
- (char *) &b
->markers
[0];
4010 /* P must point to the start of a Lisp_Misc, not be
4011 one of the unused cells in the current misc block,
4012 and not be on the free-list. */
4014 && offset
% sizeof b
->markers
[0] == 0
4015 && offset
< (MARKER_BLOCK_SIZE
* sizeof b
->markers
[0])
4016 && (b
!= marker_block
4017 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
4018 && ((union Lisp_Misc
*) p
)->u_any
.type
!= Lisp_Misc_Free
);
4025 /* Value is non-zero if P is a pointer to a live vector-like object.
4026 M is a pointer to the mem_block for P. */
4029 live_vector_p (m
, p
)
4033 return (p
== m
->start
&& m
->type
== MEM_TYPE_VECTORLIKE
);
4037 /* Value is non-zero if P is a pointer to a live buffer. M is a
4038 pointer to the mem_block for P. */
4041 live_buffer_p (m
, p
)
4045 /* P must point to the start of the block, and the buffer
4046 must not have been killed. */
4047 return (m
->type
== MEM_TYPE_BUFFER
4049 && !NILP (((struct buffer
*) p
)->name
));
4052 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
4056 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4058 /* Array of objects that are kept alive because the C stack contains
4059 a pattern that looks like a reference to them . */
4061 #define MAX_ZOMBIES 10
4062 static Lisp_Object zombies
[MAX_ZOMBIES
];
4064 /* Number of zombie objects. */
4066 static int nzombies
;
4068 /* Number of garbage collections. */
4072 /* Average percentage of zombies per collection. */
4074 static double avg_zombies
;
4076 /* Max. number of live and zombie objects. */
4078 static int max_live
, max_zombies
;
4080 /* Average number of live objects per GC. */
4082 static double avg_live
;
4084 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
4085 doc
: /* Show information about live and zombie objects. */)
4088 Lisp_Object args
[8], zombie_list
= Qnil
;
4090 for (i
= 0; i
< nzombies
; i
++)
4091 zombie_list
= Fcons (zombies
[i
], zombie_list
);
4092 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
4093 args
[1] = make_number (ngcs
);
4094 args
[2] = make_float (avg_live
);
4095 args
[3] = make_float (avg_zombies
);
4096 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
4097 args
[5] = make_number (max_live
);
4098 args
[6] = make_number (max_zombies
);
4099 args
[7] = zombie_list
;
4100 return Fmessage (8, args
);
4103 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4106 /* Mark OBJ if we can prove it's a Lisp_Object. */
4109 mark_maybe_object (obj
)
4112 void *po
= (void *) XPNTR (obj
);
4113 struct mem_node
*m
= mem_find (po
);
4119 switch (XTYPE (obj
))
4122 mark_p
= (live_string_p (m
, po
)
4123 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
4127 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
4131 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
4135 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
4138 case Lisp_Vectorlike
:
4139 /* Note: can't check BUFFERP before we know it's a
4140 buffer because checking that dereferences the pointer
4141 PO which might point anywhere. */
4142 if (live_vector_p (m
, po
))
4143 mark_p
= !SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
4144 else if (live_buffer_p (m
, po
))
4145 mark_p
= BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
4149 mark_p
= (live_misc_p (m
, po
) && !XMISCANY (obj
)->gcmarkbit
);
4158 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4159 if (nzombies
< MAX_ZOMBIES
)
4160 zombies
[nzombies
] = obj
;
4169 /* If P points to Lisp data, mark that as live if it isn't already
4173 mark_maybe_pointer (p
)
4178 /* Quickly rule out some values which can't point to Lisp data. */
4181 8 /* USE_LSB_TAG needs Lisp data to be aligned on multiples of 8. */
4183 2 /* We assume that Lisp data is aligned on even addresses. */
4191 Lisp_Object obj
= Qnil
;
4195 case MEM_TYPE_NON_LISP
:
4196 /* Nothing to do; not a pointer to Lisp memory. */
4199 case MEM_TYPE_BUFFER
:
4200 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P((struct buffer
*)p
))
4201 XSETVECTOR (obj
, p
);
4205 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
4209 case MEM_TYPE_STRING
:
4210 if (live_string_p (m
, p
)
4211 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
4212 XSETSTRING (obj
, p
);
4216 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
4220 case MEM_TYPE_SYMBOL
:
4221 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
4222 XSETSYMBOL (obj
, p
);
4225 case MEM_TYPE_FLOAT
:
4226 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
4230 case MEM_TYPE_VECTORLIKE
:
4231 if (live_vector_p (m
, p
))
4234 XSETVECTOR (tem
, p
);
4235 if (!SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
4250 /* Mark Lisp objects referenced from the address range START+OFFSET..END
4251 or END+OFFSET..START. */
4254 mark_memory (start
, end
, offset
)
4261 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4265 /* Make START the pointer to the start of the memory region,
4266 if it isn't already. */
4274 /* Mark Lisp_Objects. */
4275 for (p
= (Lisp_Object
*) ((char *) start
+ offset
); (void *) p
< end
; ++p
)
4276 mark_maybe_object (*p
);
4278 /* Mark Lisp data pointed to. This is necessary because, in some
4279 situations, the C compiler optimizes Lisp objects away, so that
4280 only a pointer to them remains. Example:
4282 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
4285 Lisp_Object obj = build_string ("test");
4286 struct Lisp_String *s = XSTRING (obj);
4287 Fgarbage_collect ();
4288 fprintf (stderr, "test `%s'\n", s->data);
4292 Here, `obj' isn't really used, and the compiler optimizes it
4293 away. The only reference to the life string is through the
4296 for (pp
= (void **) ((char *) start
+ offset
); (void *) pp
< end
; ++pp
)
4297 mark_maybe_pointer (*pp
);
4300 /* setjmp will work with GCC unless NON_SAVING_SETJMP is defined in
4301 the GCC system configuration. In gcc 3.2, the only systems for
4302 which this is so are i386-sco5 non-ELF, i386-sysv3 (maybe included
4303 by others?) and ns32k-pc532-min. */
4305 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
4307 static int setjmp_tested_p
, longjmps_done
;
4309 #define SETJMP_WILL_LIKELY_WORK "\
4311 Emacs garbage collector has been changed to use conservative stack\n\
4312 marking. Emacs has determined that the method it uses to do the\n\
4313 marking will likely work on your system, but this isn't sure.\n\
4315 If you are a system-programmer, or can get the help of a local wizard\n\
4316 who is, please take a look at the function mark_stack in alloc.c, and\n\
4317 verify that the methods used are appropriate for your system.\n\
4319 Please mail the result to <emacs-devel@gnu.org>.\n\
4322 #define SETJMP_WILL_NOT_WORK "\
4324 Emacs garbage collector has been changed to use conservative stack\n\
4325 marking. Emacs has determined that the default method it uses to do the\n\
4326 marking will not work on your system. We will need a system-dependent\n\
4327 solution for your system.\n\
4329 Please take a look at the function mark_stack in alloc.c, and\n\
4330 try to find a way to make it work on your system.\n\
4332 Note that you may get false negatives, depending on the compiler.\n\
4333 In particular, you need to use -O with GCC for this test.\n\
4335 Please mail the result to <emacs-devel@gnu.org>.\n\
4339 /* Perform a quick check if it looks like setjmp saves registers in a
4340 jmp_buf. Print a message to stderr saying so. When this test
4341 succeeds, this is _not_ a proof that setjmp is sufficient for
4342 conservative stack marking. Only the sources or a disassembly
4353 /* Arrange for X to be put in a register. */
4359 if (longjmps_done
== 1)
4361 /* Came here after the longjmp at the end of the function.
4363 If x == 1, the longjmp has restored the register to its
4364 value before the setjmp, and we can hope that setjmp
4365 saves all such registers in the jmp_buf, although that
4368 For other values of X, either something really strange is
4369 taking place, or the setjmp just didn't save the register. */
4372 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
4375 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
4382 if (longjmps_done
== 1)
4386 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
4389 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4391 /* Abort if anything GCPRO'd doesn't survive the GC. */
4399 for (p
= gcprolist
; p
; p
= p
->next
)
4400 for (i
= 0; i
< p
->nvars
; ++i
)
4401 if (!survives_gc_p (p
->var
[i
]))
4402 /* FIXME: It's not necessarily a bug. It might just be that the
4403 GCPRO is unnecessary or should release the object sooner. */
4407 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4414 fprintf (stderr
, "\nZombies kept alive = %d:\n", nzombies
);
4415 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
4417 fprintf (stderr
, " %d = ", i
);
4418 debug_print (zombies
[i
]);
4422 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4425 /* Mark live Lisp objects on the C stack.
4427 There are several system-dependent problems to consider when
4428 porting this to new architectures:
4432 We have to mark Lisp objects in CPU registers that can hold local
4433 variables or are used to pass parameters.
4435 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
4436 something that either saves relevant registers on the stack, or
4437 calls mark_maybe_object passing it each register's contents.
4439 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
4440 implementation assumes that calling setjmp saves registers we need
4441 to see in a jmp_buf which itself lies on the stack. This doesn't
4442 have to be true! It must be verified for each system, possibly
4443 by taking a look at the source code of setjmp.
4447 Architectures differ in the way their processor stack is organized.
4448 For example, the stack might look like this
4451 | Lisp_Object | size = 4
4453 | something else | size = 2
4455 | Lisp_Object | size = 4
4459 In such a case, not every Lisp_Object will be aligned equally. To
4460 find all Lisp_Object on the stack it won't be sufficient to walk
4461 the stack in steps of 4 bytes. Instead, two passes will be
4462 necessary, one starting at the start of the stack, and a second
4463 pass starting at the start of the stack + 2. Likewise, if the
4464 minimal alignment of Lisp_Objects on the stack is 1, four passes
4465 would be necessary, each one starting with one byte more offset
4466 from the stack start.
4468 The current code assumes by default that Lisp_Objects are aligned
4469 equally on the stack. */
4475 /* jmp_buf may not be aligned enough on darwin-ppc64 */
4476 union aligned_jmpbuf
{
4480 volatile int stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
4483 /* This trick flushes the register windows so that all the state of
4484 the process is contained in the stack. */
4485 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
4486 needed on ia64 too. See mach_dep.c, where it also says inline
4487 assembler doesn't work with relevant proprietary compilers. */
4489 #if defined (__sparc64__) && defined (__FreeBSD__)
4490 /* FreeBSD does not have a ta 3 handler. */
4497 /* Save registers that we need to see on the stack. We need to see
4498 registers used to hold register variables and registers used to
4500 #ifdef GC_SAVE_REGISTERS_ON_STACK
4501 GC_SAVE_REGISTERS_ON_STACK (end
);
4502 #else /* not GC_SAVE_REGISTERS_ON_STACK */
4504 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
4505 setjmp will definitely work, test it
4506 and print a message with the result
4508 if (!setjmp_tested_p
)
4510 setjmp_tested_p
= 1;
4513 #endif /* GC_SETJMP_WORKS */
4516 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
4517 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
4519 /* This assumes that the stack is a contiguous region in memory. If
4520 that's not the case, something has to be done here to iterate
4521 over the stack segments. */
4522 #ifndef GC_LISP_OBJECT_ALIGNMENT
4524 #define GC_LISP_OBJECT_ALIGNMENT __alignof__ (Lisp_Object)
4526 #define GC_LISP_OBJECT_ALIGNMENT sizeof (Lisp_Object)
4529 for (i
= 0; i
< sizeof (Lisp_Object
); i
+= GC_LISP_OBJECT_ALIGNMENT
)
4530 mark_memory (stack_base
, end
, i
);
4531 /* Allow for marking a secondary stack, like the register stack on the
4533 #ifdef GC_MARK_SECONDARY_STACK
4534 GC_MARK_SECONDARY_STACK ();
4537 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4542 #endif /* GC_MARK_STACK != 0 */
4545 /* Determine whether it is safe to access memory at address P. */
4551 return w32_valid_pointer_p (p
, 16);
4555 /* Obviously, we cannot just access it (we would SEGV trying), so we
4556 trick the o/s to tell us whether p is a valid pointer.
4557 Unfortunately, we cannot use NULL_DEVICE here, as emacs_write may
4558 not validate p in that case. */
4560 if ((fd
= emacs_open ("__Valid__Lisp__Object__", O_CREAT
| O_WRONLY
| O_TRUNC
, 0666)) >= 0)
4562 int valid
= (emacs_write (fd
, (char *)p
, 16) == 16);
4564 unlink ("__Valid__Lisp__Object__");
4572 /* Return 1 if OBJ is a valid lisp object.
4573 Return 0 if OBJ is NOT a valid lisp object.
4574 Return -1 if we cannot validate OBJ.
4575 This function can be quite slow,
4576 so it should only be used in code for manual debugging. */
4579 valid_lisp_object_p (obj
)
4590 p
= (void *) XPNTR (obj
);
4591 if (PURE_POINTER_P (p
))
4595 return valid_pointer_p (p
);
4602 int valid
= valid_pointer_p (p
);
4614 case MEM_TYPE_NON_LISP
:
4617 case MEM_TYPE_BUFFER
:
4618 return live_buffer_p (m
, p
);
4621 return live_cons_p (m
, p
);
4623 case MEM_TYPE_STRING
:
4624 return live_string_p (m
, p
);
4627 return live_misc_p (m
, p
);
4629 case MEM_TYPE_SYMBOL
:
4630 return live_symbol_p (m
, p
);
4632 case MEM_TYPE_FLOAT
:
4633 return live_float_p (m
, p
);
4635 case MEM_TYPE_VECTORLIKE
:
4636 return live_vector_p (m
, p
);
4649 /***********************************************************************
4650 Pure Storage Management
4651 ***********************************************************************/
4653 /* Allocate room for SIZE bytes from pure Lisp storage and return a
4654 pointer to it. TYPE is the Lisp type for which the memory is
4655 allocated. TYPE < 0 means it's not used for a Lisp object. */
4657 static POINTER_TYPE
*
4658 pure_alloc (size
, type
)
4662 POINTER_TYPE
*result
;
4664 size_t alignment
= (1 << GCTYPEBITS
);
4666 size_t alignment
= sizeof (EMACS_INT
);
4668 /* Give Lisp_Floats an extra alignment. */
4669 if (type
== Lisp_Float
)
4671 #if defined __GNUC__ && __GNUC__ >= 2
4672 alignment
= __alignof (struct Lisp_Float
);
4674 alignment
= sizeof (struct Lisp_Float
);
4682 /* Allocate space for a Lisp object from the beginning of the free
4683 space with taking account of alignment. */
4684 result
= ALIGN (purebeg
+ pure_bytes_used_lisp
, alignment
);
4685 pure_bytes_used_lisp
= ((char *)result
- (char *)purebeg
) + size
;
4689 /* Allocate space for a non-Lisp object from the end of the free
4691 pure_bytes_used_non_lisp
+= size
;
4692 result
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4694 pure_bytes_used
= pure_bytes_used_lisp
+ pure_bytes_used_non_lisp
;
4696 if (pure_bytes_used
<= pure_size
)
4699 /* Don't allocate a large amount here,
4700 because it might get mmap'd and then its address
4701 might not be usable. */
4702 purebeg
= (char *) xmalloc (10000);
4704 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
4705 pure_bytes_used
= 0;
4706 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
4711 /* Print a warning if PURESIZE is too small. */
4716 if (pure_bytes_used_before_overflow
)
4717 message ("emacs:0:Pure Lisp storage overflow (approx. %d bytes needed)",
4718 (int) (pure_bytes_used
+ pure_bytes_used_before_overflow
));
4722 /* Find the byte sequence {DATA[0], ..., DATA[NBYTES-1], '\0'} from
4723 the non-Lisp data pool of the pure storage, and return its start
4724 address. Return NULL if not found. */
4727 find_string_data_in_pure (data
, nbytes
)
4731 int i
, skip
, bm_skip
[256], last_char_skip
, infinity
, start
, start_max
;
4735 if (pure_bytes_used_non_lisp
< nbytes
+ 1)
4738 /* Set up the Boyer-Moore table. */
4740 for (i
= 0; i
< 256; i
++)
4743 p
= (unsigned char *) data
;
4745 bm_skip
[*p
++] = skip
;
4747 last_char_skip
= bm_skip
['\0'];
4749 non_lisp_beg
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4750 start_max
= pure_bytes_used_non_lisp
- (nbytes
+ 1);
4752 /* See the comments in the function `boyer_moore' (search.c) for the
4753 use of `infinity'. */
4754 infinity
= pure_bytes_used_non_lisp
+ 1;
4755 bm_skip
['\0'] = infinity
;
4757 p
= (unsigned char *) non_lisp_beg
+ nbytes
;
4761 /* Check the last character (== '\0'). */
4764 start
+= bm_skip
[*(p
+ start
)];
4766 while (start
<= start_max
);
4768 if (start
< infinity
)
4769 /* Couldn't find the last character. */
4772 /* No less than `infinity' means we could find the last
4773 character at `p[start - infinity]'. */
4776 /* Check the remaining characters. */
4777 if (memcmp (data
, non_lisp_beg
+ start
, nbytes
) == 0)
4779 return non_lisp_beg
+ start
;
4781 start
+= last_char_skip
;
4783 while (start
<= start_max
);
4789 /* Return a string allocated in pure space. DATA is a buffer holding
4790 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
4791 non-zero means make the result string multibyte.
4793 Must get an error if pure storage is full, since if it cannot hold
4794 a large string it may be able to hold conses that point to that
4795 string; then the string is not protected from gc. */
4798 make_pure_string (data
, nchars
, nbytes
, multibyte
)
4804 struct Lisp_String
*s
;
4806 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4807 s
->data
= find_string_data_in_pure (data
, nbytes
);
4808 if (s
->data
== NULL
)
4810 s
->data
= (unsigned char *) pure_alloc (nbytes
+ 1, -1);
4811 bcopy (data
, s
->data
, nbytes
);
4812 s
->data
[nbytes
] = '\0';
4815 s
->size_byte
= multibyte
? nbytes
: -1;
4816 s
->intervals
= NULL_INTERVAL
;
4817 XSETSTRING (string
, s
);
4821 /* Return a string a string allocated in pure space. Do not allocate
4822 the string data, just point to DATA. */
4825 make_pure_c_string (const char *data
)
4828 struct Lisp_String
*s
;
4829 int nchars
= strlen (data
);
4831 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4834 s
->data
= (unsigned char *) data
;
4835 s
->intervals
= NULL_INTERVAL
;
4836 XSETSTRING (string
, s
);
4840 /* Return a cons allocated from pure space. Give it pure copies
4841 of CAR as car and CDR as cdr. */
4844 pure_cons (car
, cdr
)
4845 Lisp_Object car
, cdr
;
4847 register Lisp_Object
new;
4848 struct Lisp_Cons
*p
;
4850 p
= (struct Lisp_Cons
*) pure_alloc (sizeof *p
, Lisp_Cons
);
4852 XSETCAR (new, Fpurecopy (car
));
4853 XSETCDR (new, Fpurecopy (cdr
));
4858 /* Value is a float object with value NUM allocated from pure space. */
4861 make_pure_float (num
)
4864 register Lisp_Object
new;
4865 struct Lisp_Float
*p
;
4867 p
= (struct Lisp_Float
*) pure_alloc (sizeof *p
, Lisp_Float
);
4869 XFLOAT_INIT (new, num
);
4874 /* Return a vector with room for LEN Lisp_Objects allocated from
4878 make_pure_vector (len
)
4882 struct Lisp_Vector
*p
;
4883 size_t size
= sizeof *p
+ (len
- 1) * sizeof (Lisp_Object
);
4885 p
= (struct Lisp_Vector
*) pure_alloc (size
, Lisp_Vectorlike
);
4886 XSETVECTOR (new, p
);
4887 XVECTOR (new)->size
= len
;
4892 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
4893 doc
: /* Make a copy of object OBJ in pure storage.
4894 Recursively copies contents of vectors and cons cells.
4895 Does not copy symbols. Copies strings without text properties. */)
4897 register Lisp_Object obj
;
4899 if (NILP (Vpurify_flag
))
4902 if (PURE_POINTER_P (XPNTR (obj
)))
4906 return pure_cons (XCAR (obj
), XCDR (obj
));
4907 else if (FLOATP (obj
))
4908 return make_pure_float (XFLOAT_DATA (obj
));
4909 else if (STRINGP (obj
))
4910 return make_pure_string (SDATA (obj
), SCHARS (obj
),
4912 STRING_MULTIBYTE (obj
));
4913 else if (COMPILEDP (obj
) || VECTORP (obj
))
4915 register struct Lisp_Vector
*vec
;
4919 size
= XVECTOR (obj
)->size
;
4920 if (size
& PSEUDOVECTOR_FLAG
)
4921 size
&= PSEUDOVECTOR_SIZE_MASK
;
4922 vec
= XVECTOR (make_pure_vector (size
));
4923 for (i
= 0; i
< size
; i
++)
4924 vec
->contents
[i
] = Fpurecopy (XVECTOR (obj
)->contents
[i
]);
4925 if (COMPILEDP (obj
))
4927 XSETPVECTYPE (vec
, PVEC_COMPILED
);
4928 XSETCOMPILED (obj
, vec
);
4931 XSETVECTOR (obj
, vec
);
4934 else if (MARKERP (obj
))
4935 error ("Attempt to copy a marker to pure storage");
4942 /***********************************************************************
4944 ***********************************************************************/
4946 /* Put an entry in staticvec, pointing at the variable with address
4950 staticpro (varaddress
)
4951 Lisp_Object
*varaddress
;
4953 staticvec
[staticidx
++] = varaddress
;
4954 if (staticidx
>= NSTATICS
)
4959 /***********************************************************************
4961 ***********************************************************************/
4963 /* Temporarily prevent garbage collection. */
4966 inhibit_garbage_collection ()
4968 int count
= SPECPDL_INDEX ();
4969 int nbits
= min (VALBITS
, BITS_PER_INT
);
4971 specbind (Qgc_cons_threshold
, make_number (((EMACS_INT
) 1 << (nbits
- 1)) - 1));
4976 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
4977 doc
: /* Reclaim storage for Lisp objects no longer needed.
4978 Garbage collection happens automatically if you cons more than
4979 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
4980 `garbage-collect' normally returns a list with info on amount of space in use:
4981 ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)
4982 (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS
4983 (USED-FLOATS . FREE-FLOATS) (USED-INTERVALS . FREE-INTERVALS)
4984 (USED-STRINGS . FREE-STRINGS))
4985 However, if there was overflow in pure space, `garbage-collect'
4986 returns nil, because real GC can't be done. */)
4989 register struct specbinding
*bind
;
4990 struct catchtag
*catch;
4991 struct handler
*handler
;
4992 char stack_top_variable
;
4995 Lisp_Object total
[8];
4996 int count
= SPECPDL_INDEX ();
4997 EMACS_TIME t1
, t2
, t3
;
5002 /* Can't GC if pure storage overflowed because we can't determine
5003 if something is a pure object or not. */
5004 if (pure_bytes_used_before_overflow
)
5009 /* Don't keep undo information around forever.
5010 Do this early on, so it is no problem if the user quits. */
5012 register struct buffer
*nextb
= all_buffers
;
5016 /* If a buffer's undo list is Qt, that means that undo is
5017 turned off in that buffer. Calling truncate_undo_list on
5018 Qt tends to return NULL, which effectively turns undo back on.
5019 So don't call truncate_undo_list if undo_list is Qt. */
5020 if (! NILP (nextb
->name
) && ! EQ (nextb
->undo_list
, Qt
))
5021 truncate_undo_list (nextb
);
5023 /* Shrink buffer gaps, but skip indirect and dead buffers. */
5024 if (nextb
->base_buffer
== 0 && !NILP (nextb
->name
)
5025 && ! nextb
->text
->inhibit_shrinking
)
5027 /* If a buffer's gap size is more than 10% of the buffer
5028 size, or larger than 2000 bytes, then shrink it
5029 accordingly. Keep a minimum size of 20 bytes. */
5030 int size
= min (2000, max (20, (nextb
->text
->z_byte
/ 10)));
5032 if (nextb
->text
->gap_size
> size
)
5034 struct buffer
*save_current
= current_buffer
;
5035 current_buffer
= nextb
;
5036 make_gap (-(nextb
->text
->gap_size
- size
));
5037 current_buffer
= save_current
;
5041 nextb
= nextb
->next
;
5045 EMACS_GET_TIME (t1
);
5047 /* In case user calls debug_print during GC,
5048 don't let that cause a recursive GC. */
5049 consing_since_gc
= 0;
5051 /* Save what's currently displayed in the echo area. */
5052 message_p
= push_message ();
5053 record_unwind_protect (pop_message_unwind
, Qnil
);
5055 /* Save a copy of the contents of the stack, for debugging. */
5056 #if MAX_SAVE_STACK > 0
5057 if (NILP (Vpurify_flag
))
5059 i
= &stack_top_variable
- stack_bottom
;
5061 if (i
< MAX_SAVE_STACK
)
5063 if (stack_copy
== 0)
5064 stack_copy
= (char *) xmalloc (stack_copy_size
= i
);
5065 else if (stack_copy_size
< i
)
5066 stack_copy
= (char *) xrealloc (stack_copy
, (stack_copy_size
= i
));
5069 if ((EMACS_INT
) (&stack_top_variable
- stack_bottom
) > 0)
5070 bcopy (stack_bottom
, stack_copy
, i
);
5072 bcopy (&stack_top_variable
, stack_copy
, i
);
5076 #endif /* MAX_SAVE_STACK > 0 */
5078 if (garbage_collection_messages
)
5079 message1_nolog ("Garbage collecting...");
5083 shrink_regexp_cache ();
5087 /* clear_marks (); */
5089 /* Mark all the special slots that serve as the roots of accessibility. */
5091 for (i
= 0; i
< staticidx
; i
++)
5092 mark_object (*staticvec
[i
]);
5094 for (bind
= specpdl
; bind
!= specpdl_ptr
; bind
++)
5096 mark_object (bind
->symbol
);
5097 mark_object (bind
->old_value
);
5105 extern void xg_mark_data ();
5110 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
5111 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
5115 register struct gcpro
*tail
;
5116 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
5117 for (i
= 0; i
< tail
->nvars
; i
++)
5118 mark_object (tail
->var
[i
]);
5123 for (catch = catchlist
; catch; catch = catch->next
)
5125 mark_object (catch->tag
);
5126 mark_object (catch->val
);
5128 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
5130 mark_object (handler
->handler
);
5131 mark_object (handler
->var
);
5135 #ifdef HAVE_WINDOW_SYSTEM
5136 mark_fringe_data ();
5139 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5143 /* Everything is now marked, except for the things that require special
5144 finalization, i.e. the undo_list.
5145 Look thru every buffer's undo list
5146 for elements that update markers that were not marked,
5149 register struct buffer
*nextb
= all_buffers
;
5153 /* If a buffer's undo list is Qt, that means that undo is
5154 turned off in that buffer. Calling truncate_undo_list on
5155 Qt tends to return NULL, which effectively turns undo back on.
5156 So don't call truncate_undo_list if undo_list is Qt. */
5157 if (! EQ (nextb
->undo_list
, Qt
))
5159 Lisp_Object tail
, prev
;
5160 tail
= nextb
->undo_list
;
5162 while (CONSP (tail
))
5164 if (CONSP (XCAR (tail
))
5165 && MARKERP (XCAR (XCAR (tail
)))
5166 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
5169 nextb
->undo_list
= tail
= XCDR (tail
);
5173 XSETCDR (prev
, tail
);
5183 /* Now that we have stripped the elements that need not be in the
5184 undo_list any more, we can finally mark the list. */
5185 mark_object (nextb
->undo_list
);
5187 nextb
= nextb
->next
;
5193 /* Clear the mark bits that we set in certain root slots. */
5195 unmark_byte_stack ();
5196 VECTOR_UNMARK (&buffer_defaults
);
5197 VECTOR_UNMARK (&buffer_local_symbols
);
5199 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
5207 /* clear_marks (); */
5210 consing_since_gc
= 0;
5211 if (gc_cons_threshold
< 10000)
5212 gc_cons_threshold
= 10000;
5214 if (FLOATP (Vgc_cons_percentage
))
5215 { /* Set gc_cons_combined_threshold. */
5216 EMACS_INT total
= 0;
5218 total
+= total_conses
* sizeof (struct Lisp_Cons
);
5219 total
+= total_symbols
* sizeof (struct Lisp_Symbol
);
5220 total
+= total_markers
* sizeof (union Lisp_Misc
);
5221 total
+= total_string_size
;
5222 total
+= total_vector_size
* sizeof (Lisp_Object
);
5223 total
+= total_floats
* sizeof (struct Lisp_Float
);
5224 total
+= total_intervals
* sizeof (struct interval
);
5225 total
+= total_strings
* sizeof (struct Lisp_String
);
5227 gc_relative_threshold
= total
* XFLOAT_DATA (Vgc_cons_percentage
);
5230 gc_relative_threshold
= 0;
5232 if (garbage_collection_messages
)
5234 if (message_p
|| minibuf_level
> 0)
5237 message1_nolog ("Garbage collecting...done");
5240 unbind_to (count
, Qnil
);
5242 total
[0] = Fcons (make_number (total_conses
),
5243 make_number (total_free_conses
));
5244 total
[1] = Fcons (make_number (total_symbols
),
5245 make_number (total_free_symbols
));
5246 total
[2] = Fcons (make_number (total_markers
),
5247 make_number (total_free_markers
));
5248 total
[3] = make_number (total_string_size
);
5249 total
[4] = make_number (total_vector_size
);
5250 total
[5] = Fcons (make_number (total_floats
),
5251 make_number (total_free_floats
));
5252 total
[6] = Fcons (make_number (total_intervals
),
5253 make_number (total_free_intervals
));
5254 total
[7] = Fcons (make_number (total_strings
),
5255 make_number (total_free_strings
));
5257 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5259 /* Compute average percentage of zombies. */
5262 for (i
= 0; i
< 7; ++i
)
5263 if (CONSP (total
[i
]))
5264 nlive
+= XFASTINT (XCAR (total
[i
]));
5266 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
5267 max_live
= max (nlive
, max_live
);
5268 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
5269 max_zombies
= max (nzombies
, max_zombies
);
5274 if (!NILP (Vpost_gc_hook
))
5276 int count
= inhibit_garbage_collection ();
5277 safe_run_hooks (Qpost_gc_hook
);
5278 unbind_to (count
, Qnil
);
5281 /* Accumulate statistics. */
5282 EMACS_GET_TIME (t2
);
5283 EMACS_SUB_TIME (t3
, t2
, t1
);
5284 if (FLOATP (Vgc_elapsed
))
5285 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
) +
5287 EMACS_USECS (t3
) * 1.0e-6);
5290 return Flist (sizeof total
/ sizeof *total
, total
);
5294 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
5295 only interesting objects referenced from glyphs are strings. */
5298 mark_glyph_matrix (matrix
)
5299 struct glyph_matrix
*matrix
;
5301 struct glyph_row
*row
= matrix
->rows
;
5302 struct glyph_row
*end
= row
+ matrix
->nrows
;
5304 for (; row
< end
; ++row
)
5308 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
5310 struct glyph
*glyph
= row
->glyphs
[area
];
5311 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
5313 for (; glyph
< end_glyph
; ++glyph
)
5314 if (STRINGP (glyph
->object
)
5315 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
5316 mark_object (glyph
->object
);
5322 /* Mark Lisp faces in the face cache C. */
5326 struct face_cache
*c
;
5331 for (i
= 0; i
< c
->used
; ++i
)
5333 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
5337 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
5338 mark_object (face
->lface
[j
]);
5346 /* Mark reference to a Lisp_Object.
5347 If the object referred to has not been seen yet, recursively mark
5348 all the references contained in it. */
5350 #define LAST_MARKED_SIZE 500
5351 static Lisp_Object last_marked
[LAST_MARKED_SIZE
];
5352 int last_marked_index
;
5354 /* For debugging--call abort when we cdr down this many
5355 links of a list, in mark_object. In debugging,
5356 the call to abort will hit a breakpoint.
5357 Normally this is zero and the check never goes off. */
5358 static int mark_object_loop_halt
;
5360 /* Return non-zero if the object was not yet marked. */
5362 mark_vectorlike (ptr
)
5363 struct Lisp_Vector
*ptr
;
5365 register EMACS_INT size
= ptr
->size
;
5368 if (VECTOR_MARKED_P (ptr
))
5369 return 0; /* Already marked */
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
]);
5383 /* Like mark_vectorlike but optimized for char-tables (and
5384 sub-char-tables) assuming that the contents are mostly integers or
5388 mark_char_table (ptr
)
5389 struct Lisp_Vector
*ptr
;
5391 register EMACS_INT size
= ptr
->size
& PSEUDOVECTOR_SIZE_MASK
;
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 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
5476 MARK_INTERVAL_TREE (ptr
->intervals
);
5478 #ifdef GC_CHECK_STRING_BYTES
5479 /* Check that the string size recorded in the string is the
5480 same as the one recorded in the sdata structure. */
5481 CHECK_STRING_BYTES (ptr
);
5482 #endif /* GC_CHECK_STRING_BYTES */
5486 case Lisp_Vectorlike
:
5487 #ifdef GC_CHECK_MARKED_OBJECTS
5489 if (m
== MEM_NIL
&& !SUBRP (obj
)
5490 && po
!= &buffer_defaults
5491 && po
!= &buffer_local_symbols
)
5493 #endif /* GC_CHECK_MARKED_OBJECTS */
5497 if (!VECTOR_MARKED_P (XBUFFER (obj
)))
5499 #ifdef GC_CHECK_MARKED_OBJECTS
5500 if (po
!= &buffer_defaults
&& po
!= &buffer_local_symbols
)
5503 for (b
= all_buffers
; b
&& b
!= po
; b
= b
->next
)
5508 #endif /* GC_CHECK_MARKED_OBJECTS */
5512 else if (SUBRP (obj
))
5514 else if (COMPILEDP (obj
))
5515 /* We could treat this just like a vector, but it is better to
5516 save the COMPILED_CONSTANTS element for last and avoid
5519 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5520 register EMACS_INT size
= ptr
->size
;
5523 if (VECTOR_MARKED_P (ptr
))
5524 break; /* Already marked */
5526 CHECK_LIVE (live_vector_p
);
5527 VECTOR_MARK (ptr
); /* Else mark it */
5528 size
&= PSEUDOVECTOR_SIZE_MASK
;
5529 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5531 if (i
!= COMPILED_CONSTANTS
)
5532 mark_object (ptr
->contents
[i
]);
5534 obj
= ptr
->contents
[COMPILED_CONSTANTS
];
5537 else if (FRAMEP (obj
))
5539 register struct frame
*ptr
= XFRAME (obj
);
5540 if (mark_vectorlike (XVECTOR (obj
)))
5541 mark_face_cache (ptr
->face_cache
);
5543 else if (WINDOWP (obj
))
5545 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5546 struct window
*w
= XWINDOW (obj
);
5547 if (mark_vectorlike (ptr
))
5549 /* Mark glyphs for leaf windows. Marking window matrices is
5550 sufficient because frame matrices use the same glyph
5552 if (NILP (w
->hchild
)
5554 && w
->current_matrix
)
5556 mark_glyph_matrix (w
->current_matrix
);
5557 mark_glyph_matrix (w
->desired_matrix
);
5561 else if (HASH_TABLE_P (obj
))
5563 struct Lisp_Hash_Table
*h
= XHASH_TABLE (obj
);
5564 if (mark_vectorlike ((struct Lisp_Vector
*)h
))
5565 { /* If hash table is not weak, mark all keys and values.
5566 For weak tables, mark only the vector. */
5568 mark_object (h
->key_and_value
);
5570 VECTOR_MARK (XVECTOR (h
->key_and_value
));
5573 else if (CHAR_TABLE_P (obj
))
5575 if (! VECTOR_MARKED_P (XVECTOR (obj
)))
5576 mark_char_table (XVECTOR (obj
));
5579 mark_vectorlike (XVECTOR (obj
));
5584 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
5585 struct Lisp_Symbol
*ptrx
;
5587 if (ptr
->gcmarkbit
) break;
5588 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
5590 mark_object (ptr
->value
);
5591 mark_object (ptr
->function
);
5592 mark_object (ptr
->plist
);
5594 if (!PURE_POINTER_P (XSTRING (ptr
->xname
)))
5595 MARK_STRING (XSTRING (ptr
->xname
));
5596 MARK_INTERVAL_TREE (STRING_INTERVALS (ptr
->xname
));
5598 /* Note that we do not mark the obarray of the symbol.
5599 It is safe not to do so because nothing accesses that
5600 slot except to check whether it is nil. */
5604 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun */
5605 XSETSYMBOL (obj
, ptrx
);
5612 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
5613 if (XMISCANY (obj
)->gcmarkbit
)
5615 XMISCANY (obj
)->gcmarkbit
= 1;
5617 switch (XMISCTYPE (obj
))
5619 case Lisp_Misc_Buffer_Local_Value
:
5621 register struct Lisp_Buffer_Local_Value
*ptr
5622 = XBUFFER_LOCAL_VALUE (obj
);
5623 /* If the cdr is nil, avoid recursion for the car. */
5624 if (EQ (ptr
->cdr
, Qnil
))
5626 obj
= ptr
->realvalue
;
5629 mark_object (ptr
->realvalue
);
5630 mark_object (ptr
->buffer
);
5631 mark_object (ptr
->frame
);
5636 case Lisp_Misc_Marker
:
5637 /* DO NOT mark thru the marker's chain.
5638 The buffer's markers chain does not preserve markers from gc;
5639 instead, markers are removed from the chain when freed by gc. */
5642 case Lisp_Misc_Intfwd
:
5643 case Lisp_Misc_Boolfwd
:
5644 case Lisp_Misc_Objfwd
:
5645 case Lisp_Misc_Buffer_Objfwd
:
5646 case Lisp_Misc_Kboard_Objfwd
:
5647 /* Don't bother with Lisp_Buffer_Objfwd,
5648 since all markable slots in current buffer marked anyway. */
5649 /* Don't need to do Lisp_Objfwd, since the places they point
5650 are protected with staticpro. */
5653 case Lisp_Misc_Save_Value
:
5656 register struct Lisp_Save_Value
*ptr
= XSAVE_VALUE (obj
);
5657 /* If DOGC is set, POINTER is the address of a memory
5658 area containing INTEGER potential Lisp_Objects. */
5661 Lisp_Object
*p
= (Lisp_Object
*) ptr
->pointer
;
5663 for (nelt
= ptr
->integer
; nelt
> 0; nelt
--, p
++)
5664 mark_maybe_object (*p
);
5670 case Lisp_Misc_Overlay
:
5672 struct Lisp_Overlay
*ptr
= XOVERLAY (obj
);
5673 mark_object (ptr
->start
);
5674 mark_object (ptr
->end
);
5675 mark_object (ptr
->plist
);
5678 XSETMISC (obj
, ptr
->next
);
5691 register struct Lisp_Cons
*ptr
= XCONS (obj
);
5692 if (CONS_MARKED_P (ptr
)) break;
5693 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
5695 /* If the cdr is nil, avoid recursion for the car. */
5696 if (EQ (ptr
->u
.cdr
, Qnil
))
5702 mark_object (ptr
->car
);
5705 if (cdr_count
== mark_object_loop_halt
)
5711 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
5712 FLOAT_MARK (XFLOAT (obj
));
5723 #undef CHECK_ALLOCATED
5724 #undef CHECK_ALLOCATED_AND_LIVE
5727 /* Mark the pointers in a buffer structure. */
5733 register struct buffer
*buffer
= XBUFFER (buf
);
5734 register Lisp_Object
*ptr
, tmp
;
5735 Lisp_Object base_buffer
;
5737 VECTOR_MARK (buffer
);
5739 MARK_INTERVAL_TREE (BUF_INTERVALS (buffer
));
5741 /* For now, we just don't mark the undo_list. It's done later in
5742 a special way just before the sweep phase, and after stripping
5743 some of its elements that are not needed any more. */
5745 if (buffer
->overlays_before
)
5747 XSETMISC (tmp
, buffer
->overlays_before
);
5750 if (buffer
->overlays_after
)
5752 XSETMISC (tmp
, buffer
->overlays_after
);
5756 /* buffer-local Lisp variables start at `undo_list',
5757 tho only the ones from `name' on are GC'd normally. */
5758 for (ptr
= &buffer
->name
;
5759 (char *)ptr
< (char *)buffer
+ sizeof (struct buffer
);
5763 /* If this is an indirect buffer, mark its base buffer. */
5764 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
5766 XSETBUFFER (base_buffer
, buffer
->base_buffer
);
5767 mark_buffer (base_buffer
);
5771 /* Mark the Lisp pointers in the terminal objects.
5772 Called by the Fgarbage_collector. */
5775 mark_terminals (void)
5778 for (t
= terminal_list
; t
; t
= t
->next_terminal
)
5780 eassert (t
->name
!= NULL
);
5781 #ifdef HAVE_WINDOW_SYSTEM
5782 mark_image_cache (t
->image_cache
);
5783 #endif /* HAVE_WINDOW_SYSTEM */
5784 mark_vectorlike ((struct Lisp_Vector
*)t
);
5790 /* Value is non-zero if OBJ will survive the current GC because it's
5791 either marked or does not need to be marked to survive. */
5799 switch (XTYPE (obj
))
5806 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
5810 survives_p
= XMISCANY (obj
)->gcmarkbit
;
5814 survives_p
= STRING_MARKED_P (XSTRING (obj
));
5817 case Lisp_Vectorlike
:
5818 survives_p
= SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
5822 survives_p
= CONS_MARKED_P (XCONS (obj
));
5826 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
5833 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
5838 /* Sweep: find all structures not marked, and free them. */
5843 /* Remove or mark entries in weak hash tables.
5844 This must be done before any object is unmarked. */
5845 sweep_weak_hash_tables ();
5848 #ifdef GC_CHECK_STRING_BYTES
5849 if (!noninteractive
)
5850 check_string_bytes (1);
5853 /* Put all unmarked conses on free list */
5855 register struct cons_block
*cblk
;
5856 struct cons_block
**cprev
= &cons_block
;
5857 register int lim
= cons_block_index
;
5858 register int num_free
= 0, num_used
= 0;
5862 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
5866 int ilim
= (lim
+ BITS_PER_INT
- 1) / BITS_PER_INT
;
5868 /* Scan the mark bits an int at a time. */
5869 for (i
= 0; i
<= ilim
; i
++)
5871 if (cblk
->gcmarkbits
[i
] == -1)
5873 /* Fast path - all cons cells for this int are marked. */
5874 cblk
->gcmarkbits
[i
] = 0;
5875 num_used
+= BITS_PER_INT
;
5879 /* Some cons cells for this int are not marked.
5880 Find which ones, and free them. */
5881 int start
, pos
, stop
;
5883 start
= i
* BITS_PER_INT
;
5885 if (stop
> BITS_PER_INT
)
5886 stop
= BITS_PER_INT
;
5889 for (pos
= start
; pos
< stop
; pos
++)
5891 if (!CONS_MARKED_P (&cblk
->conses
[pos
]))
5894 cblk
->conses
[pos
].u
.chain
= cons_free_list
;
5895 cons_free_list
= &cblk
->conses
[pos
];
5897 cons_free_list
->car
= Vdead
;
5903 CONS_UNMARK (&cblk
->conses
[pos
]);
5909 lim
= CONS_BLOCK_SIZE
;
5910 /* If this block contains only free conses and we have already
5911 seen more than two blocks worth of free conses then deallocate
5913 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
5915 *cprev
= cblk
->next
;
5916 /* Unhook from the free list. */
5917 cons_free_list
= cblk
->conses
[0].u
.chain
;
5918 lisp_align_free (cblk
);
5923 num_free
+= this_free
;
5924 cprev
= &cblk
->next
;
5927 total_conses
= num_used
;
5928 total_free_conses
= num_free
;
5931 /* Put all unmarked floats on free list */
5933 register struct float_block
*fblk
;
5934 struct float_block
**fprev
= &float_block
;
5935 register int lim
= float_block_index
;
5936 register int num_free
= 0, num_used
= 0;
5938 float_free_list
= 0;
5940 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
5944 for (i
= 0; i
< lim
; i
++)
5945 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
5948 fblk
->floats
[i
].u
.chain
= float_free_list
;
5949 float_free_list
= &fblk
->floats
[i
];
5954 FLOAT_UNMARK (&fblk
->floats
[i
]);
5956 lim
= FLOAT_BLOCK_SIZE
;
5957 /* If this block contains only free floats and we have already
5958 seen more than two blocks worth of free floats then deallocate
5960 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
5962 *fprev
= fblk
->next
;
5963 /* Unhook from the free list. */
5964 float_free_list
= fblk
->floats
[0].u
.chain
;
5965 lisp_align_free (fblk
);
5970 num_free
+= this_free
;
5971 fprev
= &fblk
->next
;
5974 total_floats
= num_used
;
5975 total_free_floats
= num_free
;
5978 /* Put all unmarked intervals on free list */
5980 register struct interval_block
*iblk
;
5981 struct interval_block
**iprev
= &interval_block
;
5982 register int lim
= interval_block_index
;
5983 register int num_free
= 0, num_used
= 0;
5985 interval_free_list
= 0;
5987 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
5992 for (i
= 0; i
< lim
; i
++)
5994 if (!iblk
->intervals
[i
].gcmarkbit
)
5996 SET_INTERVAL_PARENT (&iblk
->intervals
[i
], interval_free_list
);
5997 interval_free_list
= &iblk
->intervals
[i
];
6003 iblk
->intervals
[i
].gcmarkbit
= 0;
6006 lim
= INTERVAL_BLOCK_SIZE
;
6007 /* If this block contains only free intervals and we have already
6008 seen more than two blocks worth of free intervals then
6009 deallocate this block. */
6010 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
6012 *iprev
= iblk
->next
;
6013 /* Unhook from the free list. */
6014 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
6016 n_interval_blocks
--;
6020 num_free
+= this_free
;
6021 iprev
= &iblk
->next
;
6024 total_intervals
= num_used
;
6025 total_free_intervals
= num_free
;
6028 /* Put all unmarked symbols on free list */
6030 register struct symbol_block
*sblk
;
6031 struct symbol_block
**sprev
= &symbol_block
;
6032 register int lim
= symbol_block_index
;
6033 register int num_free
= 0, num_used
= 0;
6035 symbol_free_list
= NULL
;
6037 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
6040 struct Lisp_Symbol
*sym
= sblk
->symbols
;
6041 struct Lisp_Symbol
*end
= sym
+ lim
;
6043 for (; sym
< end
; ++sym
)
6045 /* Check if the symbol was created during loadup. In such a case
6046 it might be pointed to by pure bytecode which we don't trace,
6047 so we conservatively assume that it is live. */
6048 int pure_p
= PURE_POINTER_P (XSTRING (sym
->xname
));
6050 if (!sym
->gcmarkbit
&& !pure_p
)
6052 sym
->next
= symbol_free_list
;
6053 symbol_free_list
= sym
;
6055 symbol_free_list
->function
= Vdead
;
6063 UNMARK_STRING (XSTRING (sym
->xname
));
6068 lim
= SYMBOL_BLOCK_SIZE
;
6069 /* If this block contains only free symbols and we have already
6070 seen more than two blocks worth of free symbols then deallocate
6072 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
6074 *sprev
= sblk
->next
;
6075 /* Unhook from the free list. */
6076 symbol_free_list
= sblk
->symbols
[0].next
;
6082 num_free
+= this_free
;
6083 sprev
= &sblk
->next
;
6086 total_symbols
= num_used
;
6087 total_free_symbols
= num_free
;
6090 /* Put all unmarked misc's on free list.
6091 For a marker, first unchain it from the buffer it points into. */
6093 register struct marker_block
*mblk
;
6094 struct marker_block
**mprev
= &marker_block
;
6095 register int lim
= marker_block_index
;
6096 register int num_free
= 0, num_used
= 0;
6098 marker_free_list
= 0;
6100 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
6105 for (i
= 0; i
< lim
; i
++)
6107 if (!mblk
->markers
[i
].u_any
.gcmarkbit
)
6109 if (mblk
->markers
[i
].u_any
.type
== Lisp_Misc_Marker
)
6110 unchain_marker (&mblk
->markers
[i
].u_marker
);
6111 /* Set the type of the freed object to Lisp_Misc_Free.
6112 We could leave the type alone, since nobody checks it,
6113 but this might catch bugs faster. */
6114 mblk
->markers
[i
].u_marker
.type
= Lisp_Misc_Free
;
6115 mblk
->markers
[i
].u_free
.chain
= marker_free_list
;
6116 marker_free_list
= &mblk
->markers
[i
];
6122 mblk
->markers
[i
].u_any
.gcmarkbit
= 0;
6125 lim
= MARKER_BLOCK_SIZE
;
6126 /* If this block contains only free markers and we have already
6127 seen more than two blocks worth of free markers then deallocate
6129 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
6131 *mprev
= mblk
->next
;
6132 /* Unhook from the free list. */
6133 marker_free_list
= mblk
->markers
[0].u_free
.chain
;
6139 num_free
+= this_free
;
6140 mprev
= &mblk
->next
;
6144 total_markers
= num_used
;
6145 total_free_markers
= num_free
;
6148 /* Free all unmarked buffers */
6150 register struct buffer
*buffer
= all_buffers
, *prev
= 0, *next
;
6153 if (!VECTOR_MARKED_P (buffer
))
6156 prev
->next
= buffer
->next
;
6158 all_buffers
= buffer
->next
;
6159 next
= buffer
->next
;
6165 VECTOR_UNMARK (buffer
);
6166 UNMARK_BALANCE_INTERVALS (BUF_INTERVALS (buffer
));
6167 prev
= buffer
, buffer
= buffer
->next
;
6171 /* Free all unmarked vectors */
6173 register struct Lisp_Vector
*vector
= all_vectors
, *prev
= 0, *next
;
6174 total_vector_size
= 0;
6177 if (!VECTOR_MARKED_P (vector
))
6180 prev
->next
= vector
->next
;
6182 all_vectors
= vector
->next
;
6183 next
= vector
->next
;
6191 VECTOR_UNMARK (vector
);
6192 if (vector
->size
& PSEUDOVECTOR_FLAG
)
6193 total_vector_size
+= (PSEUDOVECTOR_SIZE_MASK
& vector
->size
);
6195 total_vector_size
+= vector
->size
;
6196 prev
= vector
, vector
= vector
->next
;
6200 #ifdef GC_CHECK_STRING_BYTES
6201 if (!noninteractive
)
6202 check_string_bytes (1);
6209 /* Debugging aids. */
6211 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
6212 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
6213 This may be helpful in debugging Emacs's memory usage.
6214 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
6219 XSETINT (end
, (EMACS_INT
) sbrk (0) / 1024);
6224 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
6225 doc
: /* Return a list of counters that measure how much consing there has been.
6226 Each of these counters increments for a certain kind of object.
6227 The counters wrap around from the largest positive integer to zero.
6228 Garbage collection does not decrease them.
6229 The elements of the value are as follows:
6230 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
6231 All are in units of 1 = one object consed
6232 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
6234 MISCS include overlays, markers, and some internal types.
6235 Frames, windows, buffers, and subprocesses count as vectors
6236 (but the contents of a buffer's text do not count here). */)
6239 Lisp_Object consed
[8];
6241 consed
[0] = make_number (min (MOST_POSITIVE_FIXNUM
, cons_cells_consed
));
6242 consed
[1] = make_number (min (MOST_POSITIVE_FIXNUM
, floats_consed
));
6243 consed
[2] = make_number (min (MOST_POSITIVE_FIXNUM
, vector_cells_consed
));
6244 consed
[3] = make_number (min (MOST_POSITIVE_FIXNUM
, symbols_consed
));
6245 consed
[4] = make_number (min (MOST_POSITIVE_FIXNUM
, string_chars_consed
));
6246 consed
[5] = make_number (min (MOST_POSITIVE_FIXNUM
, misc_objects_consed
));
6247 consed
[6] = make_number (min (MOST_POSITIVE_FIXNUM
, intervals_consed
));
6248 consed
[7] = make_number (min (MOST_POSITIVE_FIXNUM
, strings_consed
));
6250 return Flist (8, consed
);
6253 int suppress_checking
;
6256 die (msg
, file
, line
)
6261 fprintf (stderr
, "\r\n%s:%d: Emacs fatal error: %s\r\n",
6266 /* Initialization */
6271 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
6273 pure_size
= PURESIZE
;
6274 pure_bytes_used
= 0;
6275 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
6276 pure_bytes_used_before_overflow
= 0;
6278 /* Initialize the list of free aligned blocks. */
6281 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
6283 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
6287 ignore_warnings
= 1;
6288 #ifdef DOUG_LEA_MALLOC
6289 mallopt (M_TRIM_THRESHOLD
, 128*1024); /* trim threshold */
6290 mallopt (M_MMAP_THRESHOLD
, 64*1024); /* mmap threshold */
6291 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* max. number of mmap'ed areas */
6299 init_weak_hash_tables ();
6302 malloc_hysteresis
= 32;
6304 malloc_hysteresis
= 0;
6307 refill_memory_reserve ();
6309 ignore_warnings
= 0;
6311 byte_stack_list
= 0;
6313 consing_since_gc
= 0;
6314 gc_cons_threshold
= 100000 * sizeof (Lisp_Object
);
6315 gc_relative_threshold
= 0;
6317 #ifdef VIRT_ADDR_VARIES
6318 malloc_sbrk_unused
= 1<<22; /* A large number */
6319 malloc_sbrk_used
= 100000; /* as reasonable as any number */
6320 #endif /* VIRT_ADDR_VARIES */
6327 byte_stack_list
= 0;
6329 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
6330 setjmp_tested_p
= longjmps_done
= 0;
6333 Vgc_elapsed
= make_float (0.0);
6340 DEFVAR_INT ("gc-cons-threshold", &gc_cons_threshold
,
6341 doc
: /* *Number of bytes of consing between garbage collections.
6342 Garbage collection can happen automatically once this many bytes have been
6343 allocated since the last garbage collection. All data types count.
6345 Garbage collection happens automatically only when `eval' is called.
6347 By binding this temporarily to a large number, you can effectively
6348 prevent garbage collection during a part of the program.
6349 See also `gc-cons-percentage'. */);
6351 DEFVAR_LISP ("gc-cons-percentage", &Vgc_cons_percentage
,
6352 doc
: /* *Portion of the heap used for allocation.
6353 Garbage collection can happen automatically once this portion of the heap
6354 has been allocated since the last garbage collection.
6355 If this portion is smaller than `gc-cons-threshold', this is ignored. */);
6356 Vgc_cons_percentage
= make_float (0.1);
6358 DEFVAR_INT ("pure-bytes-used", &pure_bytes_used
,
6359 doc
: /* Number of bytes of sharable Lisp data allocated so far. */);
6361 DEFVAR_INT ("cons-cells-consed", &cons_cells_consed
,
6362 doc
: /* Number of cons cells that have been consed so far. */);
6364 DEFVAR_INT ("floats-consed", &floats_consed
,
6365 doc
: /* Number of floats that have been consed so far. */);
6367 DEFVAR_INT ("vector-cells-consed", &vector_cells_consed
,
6368 doc
: /* Number of vector cells that have been consed so far. */);
6370 DEFVAR_INT ("symbols-consed", &symbols_consed
,
6371 doc
: /* Number of symbols that have been consed so far. */);
6373 DEFVAR_INT ("string-chars-consed", &string_chars_consed
,
6374 doc
: /* Number of string characters that have been consed so far. */);
6376 DEFVAR_INT ("misc-objects-consed", &misc_objects_consed
,
6377 doc
: /* Number of miscellaneous objects that have been consed so far. */);
6379 DEFVAR_INT ("intervals-consed", &intervals_consed
,
6380 doc
: /* Number of intervals that have been consed so far. */);
6382 DEFVAR_INT ("strings-consed", &strings_consed
,
6383 doc
: /* Number of strings that have been consed so far. */);
6385 DEFVAR_LISP ("purify-flag", &Vpurify_flag
,
6386 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
6387 This means that certain objects should be allocated in shared (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. */
6405 build_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"));
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) */