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. */
34 /* Note that this declares bzero on OSF/1. How dumb. */
38 #ifdef HAVE_GTK_AND_PTHREAD
42 /* This file is part of the core Lisp implementation, and thus must
43 deal with the real data structures. If the Lisp implementation is
44 replaced, this file likely will not be used. */
46 #undef HIDE_LISP_IMPLEMENTATION
49 #include "intervals.h"
55 #include "blockinput.h"
56 #include "character.h"
57 #include "syssignal.h"
58 #include "termhooks.h" /* For struct terminal. */
61 /* GC_MALLOC_CHECK defined means perform validity checks of malloc'd
62 memory. Can do this only if using gmalloc.c. */
64 #if defined SYSTEM_MALLOC || defined DOUG_LEA_MALLOC
65 #undef GC_MALLOC_CHECK
71 extern POINTER_TYPE
*sbrk ();
75 #define INCLUDED_FCNTL
87 #ifdef DOUG_LEA_MALLOC
90 /* malloc.h #defines this as size_t, at least in glibc2. */
91 #ifndef __malloc_size_t
92 #define __malloc_size_t int
95 /* Specify maximum number of areas to mmap. It would be nice to use a
96 value that explicitly means "no limit". */
98 #define MMAP_MAX_AREAS 100000000
100 #else /* not DOUG_LEA_MALLOC */
102 /* The following come from gmalloc.c. */
104 #define __malloc_size_t size_t
105 extern __malloc_size_t _bytes_used
;
106 extern __malloc_size_t __malloc_extra_blocks
;
108 #endif /* not DOUG_LEA_MALLOC */
110 #if ! defined (SYSTEM_MALLOC) && defined (HAVE_GTK_AND_PTHREAD)
112 /* When GTK uses the file chooser dialog, different backends can be loaded
113 dynamically. One such a backend is the Gnome VFS backend that gets loaded
114 if you run Gnome. That backend creates several threads and also allocates
117 If Emacs sets malloc hooks (! SYSTEM_MALLOC) and the emacs_blocked_*
118 functions below are called from malloc, there is a chance that one
119 of these threads preempts the Emacs main thread and the hook variables
120 end up in an inconsistent state. So we have a mutex to prevent that (note
121 that the backend handles concurrent access to malloc within its own threads
122 but Emacs code running in the main thread is not included in that control).
124 When UNBLOCK_INPUT is called, reinvoke_input_signal may be called. If this
125 happens in one of the backend threads we will have two threads that tries
126 to run Emacs code at once, and the code is not prepared for that.
127 To prevent that, we only call BLOCK/UNBLOCK from the main thread. */
129 static pthread_mutex_t alloc_mutex
;
131 #define BLOCK_INPUT_ALLOC \
134 if (pthread_equal (pthread_self (), main_thread)) \
136 pthread_mutex_lock (&alloc_mutex); \
139 #define UNBLOCK_INPUT_ALLOC \
142 pthread_mutex_unlock (&alloc_mutex); \
143 if (pthread_equal (pthread_self (), main_thread)) \
148 #else /* SYSTEM_MALLOC || not HAVE_GTK_AND_PTHREAD */
150 #define BLOCK_INPUT_ALLOC BLOCK_INPUT
151 #define UNBLOCK_INPUT_ALLOC UNBLOCK_INPUT
153 #endif /* SYSTEM_MALLOC || not HAVE_GTK_AND_PTHREAD */
155 /* Value of _bytes_used, when spare_memory was freed. */
157 static __malloc_size_t bytes_used_when_full
;
159 static __malloc_size_t bytes_used_when_reconsidered
;
161 /* Mark, unmark, query mark bit of a Lisp string. S must be a pointer
162 to a struct Lisp_String. */
164 #define MARK_STRING(S) ((S)->size |= ARRAY_MARK_FLAG)
165 #define UNMARK_STRING(S) ((S)->size &= ~ARRAY_MARK_FLAG)
166 #define STRING_MARKED_P(S) (((S)->size & ARRAY_MARK_FLAG) != 0)
168 #define VECTOR_MARK(V) ((V)->size |= ARRAY_MARK_FLAG)
169 #define VECTOR_UNMARK(V) ((V)->size &= ~ARRAY_MARK_FLAG)
170 #define VECTOR_MARKED_P(V) (((V)->size & ARRAY_MARK_FLAG) != 0)
172 /* Value is the number of bytes/chars of S, a pointer to a struct
173 Lisp_String. This must be used instead of STRING_BYTES (S) or
174 S->size during GC, because S->size contains the mark bit for
177 #define GC_STRING_BYTES(S) (STRING_BYTES (S))
178 #define GC_STRING_CHARS(S) ((S)->size & ~ARRAY_MARK_FLAG)
180 /* Number of bytes of consing done since the last gc. */
182 int consing_since_gc
;
184 /* Count the amount of consing of various sorts of space. */
186 EMACS_INT cons_cells_consed
;
187 EMACS_INT floats_consed
;
188 EMACS_INT vector_cells_consed
;
189 EMACS_INT symbols_consed
;
190 EMACS_INT string_chars_consed
;
191 EMACS_INT misc_objects_consed
;
192 EMACS_INT intervals_consed
;
193 EMACS_INT strings_consed
;
195 /* Minimum number of bytes of consing since GC before next GC. */
197 EMACS_INT gc_cons_threshold
;
199 /* Similar minimum, computed from Vgc_cons_percentage. */
201 EMACS_INT gc_relative_threshold
;
203 static Lisp_Object Vgc_cons_percentage
;
205 /* Minimum number of bytes of consing since GC before next GC,
206 when memory is full. */
208 EMACS_INT memory_full_cons_threshold
;
210 /* Nonzero during GC. */
214 /* Nonzero means abort if try to GC.
215 This is for code which is written on the assumption that
216 no GC will happen, so as to verify that assumption. */
220 /* Nonzero means display messages at beginning and end of GC. */
222 int garbage_collection_messages
;
224 #ifndef VIRT_ADDR_VARIES
226 #endif /* VIRT_ADDR_VARIES */
227 int malloc_sbrk_used
;
229 #ifndef VIRT_ADDR_VARIES
231 #endif /* VIRT_ADDR_VARIES */
232 int malloc_sbrk_unused
;
234 /* Number of live and free conses etc. */
236 static int total_conses
, total_markers
, total_symbols
, total_vector_size
;
237 static int total_free_conses
, total_free_markers
, total_free_symbols
;
238 static int total_free_floats
, total_floats
;
240 /* Points to memory space allocated as "spare", to be freed if we run
241 out of memory. We keep one large block, four cons-blocks, and
242 two string blocks. */
244 static char *spare_memory
[7];
246 /* Amount of spare memory to keep in large reserve block. */
248 #define SPARE_MEMORY (1 << 14)
250 /* Number of extra blocks malloc should get when it needs more core. */
252 static int malloc_hysteresis
;
254 /* Non-nil means defun should do purecopy on the function definition. */
256 Lisp_Object Vpurify_flag
;
258 /* Non-nil means we are handling a memory-full error. */
260 Lisp_Object Vmemory_full
;
264 /* Initialize it to a nonzero value to force it into data space
265 (rather than bss space). That way unexec will remap it into text
266 space (pure), on some systems. We have not implemented the
267 remapping on more recent systems because this is less important
268 nowadays than in the days of small memories and timesharing. */
270 EMACS_INT pure
[(PURESIZE
+ sizeof (EMACS_INT
) - 1) / sizeof (EMACS_INT
)] = {1,};
271 #define PUREBEG (char *) pure
275 #define pure PURE_SEG_BITS /* Use shared memory segment */
276 #define PUREBEG (char *)PURE_SEG_BITS
278 #endif /* HAVE_SHM */
280 /* Pointer to the pure area, and its size. */
282 static char *purebeg
;
283 static size_t pure_size
;
285 /* Number of bytes of pure storage used before pure storage overflowed.
286 If this is non-zero, this implies that an overflow occurred. */
288 static size_t pure_bytes_used_before_overflow
;
290 /* Value is non-zero if P points into pure space. */
292 #define PURE_POINTER_P(P) \
293 (((PNTR_COMPARISON_TYPE) (P) \
294 < (PNTR_COMPARISON_TYPE) ((char *) purebeg + pure_size)) \
295 && ((PNTR_COMPARISON_TYPE) (P) \
296 >= (PNTR_COMPARISON_TYPE) purebeg))
298 /* Total number of bytes allocated in pure storage. */
300 EMACS_INT pure_bytes_used
;
302 /* Index in pure at which next pure Lisp object will be allocated.. */
304 static EMACS_INT pure_bytes_used_lisp
;
306 /* Number of bytes allocated for non-Lisp objects in pure storage. */
308 static EMACS_INT pure_bytes_used_non_lisp
;
310 /* If nonzero, this is a warning delivered by malloc and not yet
313 char *pending_malloc_warning
;
315 /* Pre-computed signal argument for use when memory is exhausted. */
317 Lisp_Object Vmemory_signal_data
;
319 /* Maximum amount of C stack to save when a GC happens. */
321 #ifndef MAX_SAVE_STACK
322 #define MAX_SAVE_STACK 16000
325 /* Buffer in which we save a copy of the C stack at each GC. */
327 static char *stack_copy
;
328 static int stack_copy_size
;
330 /* Non-zero means ignore malloc warnings. Set during initialization.
331 Currently not used. */
333 static int ignore_warnings
;
335 Lisp_Object Qgc_cons_threshold
, Qchar_table_extra_slots
;
337 /* Hook run after GC has finished. */
339 Lisp_Object Vpost_gc_hook
, Qpost_gc_hook
;
341 Lisp_Object Vgc_elapsed
; /* accumulated elapsed time in GC */
342 EMACS_INT gcs_done
; /* accumulated GCs */
344 static void mark_buffer
P_ ((Lisp_Object
));
345 static void mark_terminals
P_ ((void));
346 extern void mark_kboards
P_ ((void));
347 extern void mark_ttys
P_ ((void));
348 extern void mark_backtrace
P_ ((void));
349 static void gc_sweep
P_ ((void));
350 static void mark_glyph_matrix
P_ ((struct glyph_matrix
*));
351 static void mark_face_cache
P_ ((struct face_cache
*));
353 #ifdef HAVE_WINDOW_SYSTEM
354 extern void mark_fringe_data
P_ ((void));
355 #endif /* HAVE_WINDOW_SYSTEM */
357 static struct Lisp_String
*allocate_string
P_ ((void));
358 static void compact_small_strings
P_ ((void));
359 static void free_large_strings
P_ ((void));
360 static void sweep_strings
P_ ((void));
362 extern int message_enable_multibyte
;
364 /* When scanning the C stack for live Lisp objects, Emacs keeps track
365 of what memory allocated via lisp_malloc is intended for what
366 purpose. This enumeration specifies the type of memory. */
377 /* We used to keep separate mem_types for subtypes of vectors such as
378 process, hash_table, frame, terminal, and window, but we never made
379 use of the distinction, so it only caused source-code complexity
380 and runtime slowdown. Minor but pointless. */
384 static POINTER_TYPE
*lisp_align_malloc
P_ ((size_t, enum mem_type
));
385 static POINTER_TYPE
*lisp_malloc
P_ ((size_t, enum mem_type
));
386 void refill_memory_reserve ();
389 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
391 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
392 #include <stdio.h> /* For fprintf. */
395 /* A unique object in pure space used to make some Lisp objects
396 on free lists recognizable in O(1). */
398 static Lisp_Object Vdead
;
400 #ifdef GC_MALLOC_CHECK
402 enum mem_type allocated_mem_type
;
403 static int dont_register_blocks
;
405 #endif /* GC_MALLOC_CHECK */
407 /* A node in the red-black tree describing allocated memory containing
408 Lisp data. Each such block is recorded with its start and end
409 address when it is allocated, and removed from the tree when it
412 A red-black tree is a balanced binary tree with the following
415 1. Every node is either red or black.
416 2. Every leaf is black.
417 3. If a node is red, then both of its children are black.
418 4. Every simple path from a node to a descendant leaf contains
419 the same number of black nodes.
420 5. The root is always black.
422 When nodes are inserted into the tree, or deleted from the tree,
423 the tree is "fixed" so that these properties are always true.
425 A red-black tree with N internal nodes has height at most 2
426 log(N+1). Searches, insertions and deletions are done in O(log N).
427 Please see a text book about data structures for a detailed
428 description of red-black trees. Any book worth its salt should
433 /* Children of this node. These pointers are never NULL. When there
434 is no child, the value is MEM_NIL, which points to a dummy node. */
435 struct mem_node
*left
, *right
;
437 /* The parent of this node. In the root node, this is NULL. */
438 struct mem_node
*parent
;
440 /* Start and end of allocated region. */
444 enum {MEM_BLACK
, MEM_RED
} color
;
450 /* Base address of stack. Set in main. */
452 Lisp_Object
*stack_base
;
454 /* Root of the tree describing allocated Lisp memory. */
456 static struct mem_node
*mem_root
;
458 /* Lowest and highest known address in the heap. */
460 static void *min_heap_address
, *max_heap_address
;
462 /* Sentinel node of the tree. */
464 static struct mem_node mem_z
;
465 #define MEM_NIL &mem_z
467 static POINTER_TYPE
*lisp_malloc
P_ ((size_t, enum mem_type
));
468 static struct Lisp_Vector
*allocate_vectorlike
P_ ((EMACS_INT
));
469 static void lisp_free
P_ ((POINTER_TYPE
*));
470 static void mark_stack
P_ ((void));
471 static int live_vector_p
P_ ((struct mem_node
*, void *));
472 static int live_buffer_p
P_ ((struct mem_node
*, void *));
473 static int live_string_p
P_ ((struct mem_node
*, void *));
474 static int live_cons_p
P_ ((struct mem_node
*, void *));
475 static int live_symbol_p
P_ ((struct mem_node
*, void *));
476 static int live_float_p
P_ ((struct mem_node
*, void *));
477 static int live_misc_p
P_ ((struct mem_node
*, void *));
478 static void mark_maybe_object
P_ ((Lisp_Object
));
479 static void mark_memory
P_ ((void *, void *, int));
480 static void mem_init
P_ ((void));
481 static struct mem_node
*mem_insert
P_ ((void *, void *, enum mem_type
));
482 static void mem_insert_fixup
P_ ((struct mem_node
*));
483 static void mem_rotate_left
P_ ((struct mem_node
*));
484 static void mem_rotate_right
P_ ((struct mem_node
*));
485 static void mem_delete
P_ ((struct mem_node
*));
486 static void mem_delete_fixup
P_ ((struct mem_node
*));
487 static INLINE
struct mem_node
*mem_find
P_ ((void *));
490 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
491 static void check_gcpros
P_ ((void));
494 #endif /* GC_MARK_STACK || GC_MALLOC_CHECK */
496 /* Recording what needs to be marked for gc. */
498 struct gcpro
*gcprolist
;
500 /* Addresses of staticpro'd variables. Initialize it to a nonzero
501 value; otherwise some compilers put it into BSS. */
503 #define NSTATICS 0x640
504 static Lisp_Object
*staticvec
[NSTATICS
] = {&Vpurify_flag
};
506 /* Index of next unused slot in staticvec. */
508 static int staticidx
= 0;
510 static POINTER_TYPE
*pure_alloc
P_ ((size_t, int));
513 /* Value is SZ rounded up to the next multiple of ALIGNMENT.
514 ALIGNMENT must be a power of 2. */
516 #define ALIGN(ptr, ALIGNMENT) \
517 ((POINTER_TYPE *) ((((EMACS_UINT)(ptr)) + (ALIGNMENT) - 1) \
518 & ~((ALIGNMENT) - 1)))
522 /************************************************************************
524 ************************************************************************/
526 /* Function malloc calls this if it finds we are near exhausting storage. */
532 pending_malloc_warning
= str
;
536 /* Display an already-pending malloc warning. */
539 display_malloc_warning ()
541 call3 (intern ("display-warning"),
543 build_string (pending_malloc_warning
),
544 intern ("emergency"));
545 pending_malloc_warning
= 0;
549 #ifdef DOUG_LEA_MALLOC
550 # define BYTES_USED (mallinfo ().uordblks)
552 # define BYTES_USED _bytes_used
555 /* Called if we can't allocate relocatable space for a buffer. */
558 buffer_memory_full ()
560 /* If buffers use the relocating allocator, no need to free
561 spare_memory, because we may have plenty of malloc space left
562 that we could get, and if we don't, the malloc that fails will
563 itself cause spare_memory to be freed. If buffers don't use the
564 relocating allocator, treat this like any other failing
571 /* This used to call error, but if we've run out of memory, we could
572 get infinite recursion trying to build the string. */
573 xsignal (Qnil
, Vmemory_signal_data
);
577 #ifdef XMALLOC_OVERRUN_CHECK
579 /* Check for overrun in malloc'ed buffers by wrapping a 16 byte header
580 and a 16 byte trailer around each block.
582 The header consists of 12 fixed bytes + a 4 byte integer contaning the
583 original block size, while the trailer consists of 16 fixed bytes.
585 The header is used to detect whether this block has been allocated
586 through these functions -- as it seems that some low-level libc
587 functions may bypass the malloc hooks.
591 #define XMALLOC_OVERRUN_CHECK_SIZE 16
593 static char xmalloc_overrun_check_header
[XMALLOC_OVERRUN_CHECK_SIZE
-4] =
594 { 0x9a, 0x9b, 0xae, 0xaf,
595 0xbf, 0xbe, 0xce, 0xcf,
596 0xea, 0xeb, 0xec, 0xed };
598 static char xmalloc_overrun_check_trailer
[XMALLOC_OVERRUN_CHECK_SIZE
] =
599 { 0xaa, 0xab, 0xac, 0xad,
600 0xba, 0xbb, 0xbc, 0xbd,
601 0xca, 0xcb, 0xcc, 0xcd,
602 0xda, 0xdb, 0xdc, 0xdd };
604 /* Macros to insert and extract the block size in the header. */
606 #define XMALLOC_PUT_SIZE(ptr, size) \
607 (ptr[-1] = (size & 0xff), \
608 ptr[-2] = ((size >> 8) & 0xff), \
609 ptr[-3] = ((size >> 16) & 0xff), \
610 ptr[-4] = ((size >> 24) & 0xff))
612 #define XMALLOC_GET_SIZE(ptr) \
613 (size_t)((unsigned)(ptr[-1]) | \
614 ((unsigned)(ptr[-2]) << 8) | \
615 ((unsigned)(ptr[-3]) << 16) | \
616 ((unsigned)(ptr[-4]) << 24))
619 /* The call depth in overrun_check functions. For example, this might happen:
621 overrun_check_malloc()
622 -> malloc -> (via hook)_-> emacs_blocked_malloc
623 -> overrun_check_malloc
624 call malloc (hooks are NULL, so real malloc is called).
625 malloc returns 10000.
626 add overhead, return 10016.
627 <- (back in overrun_check_malloc)
628 add overhead again, return 10032
629 xmalloc returns 10032.
634 overrun_check_free(10032)
636 free(10016) <- crash, because 10000 is the original pointer. */
638 static int check_depth
;
640 /* Like malloc, but wraps allocated block with header and trailer. */
643 overrun_check_malloc (size
)
646 register unsigned char *val
;
647 size_t overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_SIZE
*2 : 0;
649 val
= (unsigned char *) malloc (size
+ overhead
);
650 if (val
&& check_depth
== 1)
652 bcopy (xmalloc_overrun_check_header
, val
, XMALLOC_OVERRUN_CHECK_SIZE
- 4);
653 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
654 XMALLOC_PUT_SIZE(val
, size
);
655 bcopy (xmalloc_overrun_check_trailer
, val
+ size
, XMALLOC_OVERRUN_CHECK_SIZE
);
658 return (POINTER_TYPE
*)val
;
662 /* Like realloc, but checks old block for overrun, and wraps new block
663 with header and trailer. */
666 overrun_check_realloc (block
, size
)
670 register unsigned char *val
= (unsigned char *)block
;
671 size_t overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_SIZE
*2 : 0;
675 && bcmp (xmalloc_overrun_check_header
,
676 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
677 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
679 size_t osize
= XMALLOC_GET_SIZE (val
);
680 if (bcmp (xmalloc_overrun_check_trailer
,
682 XMALLOC_OVERRUN_CHECK_SIZE
))
684 bzero (val
+ osize
, XMALLOC_OVERRUN_CHECK_SIZE
);
685 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
686 bzero (val
, XMALLOC_OVERRUN_CHECK_SIZE
);
689 val
= (unsigned char *) realloc ((POINTER_TYPE
*)val
, size
+ overhead
);
691 if (val
&& check_depth
== 1)
693 bcopy (xmalloc_overrun_check_header
, val
, XMALLOC_OVERRUN_CHECK_SIZE
- 4);
694 val
+= XMALLOC_OVERRUN_CHECK_SIZE
;
695 XMALLOC_PUT_SIZE(val
, size
);
696 bcopy (xmalloc_overrun_check_trailer
, val
+ size
, XMALLOC_OVERRUN_CHECK_SIZE
);
699 return (POINTER_TYPE
*)val
;
702 /* Like free, but checks block for overrun. */
705 overrun_check_free (block
)
708 unsigned char *val
= (unsigned char *)block
;
713 && bcmp (xmalloc_overrun_check_header
,
714 val
- XMALLOC_OVERRUN_CHECK_SIZE
,
715 XMALLOC_OVERRUN_CHECK_SIZE
- 4) == 0)
717 size_t osize
= XMALLOC_GET_SIZE (val
);
718 if (bcmp (xmalloc_overrun_check_trailer
,
720 XMALLOC_OVERRUN_CHECK_SIZE
))
722 #ifdef XMALLOC_CLEAR_FREE_MEMORY
723 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
724 memset (val
, 0xff, osize
+ XMALLOC_OVERRUN_CHECK_SIZE
*2);
726 bzero (val
+ osize
, XMALLOC_OVERRUN_CHECK_SIZE
);
727 val
-= XMALLOC_OVERRUN_CHECK_SIZE
;
728 bzero (val
, XMALLOC_OVERRUN_CHECK_SIZE
);
739 #define malloc overrun_check_malloc
740 #define realloc overrun_check_realloc
741 #define free overrun_check_free
745 /* When using SYNC_INPUT, we don't call malloc from a signal handler, so
746 there's no need to block input around malloc. */
747 #define MALLOC_BLOCK_INPUT ((void)0)
748 #define MALLOC_UNBLOCK_INPUT ((void)0)
750 #define MALLOC_BLOCK_INPUT BLOCK_INPUT
751 #define MALLOC_UNBLOCK_INPUT UNBLOCK_INPUT
754 /* Like malloc but check for no memory and block interrupt input.. */
760 register POINTER_TYPE
*val
;
763 val
= (POINTER_TYPE
*) malloc (size
);
764 MALLOC_UNBLOCK_INPUT
;
772 /* Like realloc but check for no memory and block interrupt input.. */
775 xrealloc (block
, size
)
779 register POINTER_TYPE
*val
;
782 /* We must call malloc explicitly when BLOCK is 0, since some
783 reallocs don't do this. */
785 val
= (POINTER_TYPE
*) malloc (size
);
787 val
= (POINTER_TYPE
*) realloc (block
, size
);
788 MALLOC_UNBLOCK_INPUT
;
790 if (!val
&& size
) memory_full ();
795 /* Like free but block interrupt input. */
805 MALLOC_UNBLOCK_INPUT
;
806 /* We don't call refill_memory_reserve here
807 because that duplicates doing so in emacs_blocked_free
808 and the criterion should go there. */
812 /* Like strdup, but uses xmalloc. */
818 size_t len
= strlen (s
) + 1;
819 char *p
= (char *) xmalloc (len
);
825 /* Unwind for SAFE_ALLOCA */
828 safe_alloca_unwind (arg
)
831 register struct Lisp_Save_Value
*p
= XSAVE_VALUE (arg
);
841 /* Like malloc but used for allocating Lisp data. NBYTES is the
842 number of bytes to allocate, TYPE describes the intended use of the
843 allcated memory block (for strings, for conses, ...). */
846 static void *lisp_malloc_loser
;
849 static POINTER_TYPE
*
850 lisp_malloc (nbytes
, type
)
858 #ifdef GC_MALLOC_CHECK
859 allocated_mem_type
= type
;
862 val
= (void *) malloc (nbytes
);
865 /* If the memory just allocated cannot be addressed thru a Lisp
866 object's pointer, and it needs to be,
867 that's equivalent to running out of memory. */
868 if (val
&& type
!= MEM_TYPE_NON_LISP
)
871 XSETCONS (tem
, (char *) val
+ nbytes
- 1);
872 if ((char *) XCONS (tem
) != (char *) val
+ nbytes
- 1)
874 lisp_malloc_loser
= val
;
881 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
882 if (val
&& type
!= MEM_TYPE_NON_LISP
)
883 mem_insert (val
, (char *) val
+ nbytes
, type
);
886 MALLOC_UNBLOCK_INPUT
;
892 /* Free BLOCK. This must be called to free memory allocated with a
893 call to lisp_malloc. */
901 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
902 mem_delete (mem_find (block
));
904 MALLOC_UNBLOCK_INPUT
;
907 /* Allocation of aligned blocks of memory to store Lisp data. */
908 /* The entry point is lisp_align_malloc which returns blocks of at most */
909 /* BLOCK_BYTES and guarantees they are aligned on a BLOCK_ALIGN boundary. */
911 /* Use posix_memalloc if the system has it and we're using the system's
912 malloc (because our gmalloc.c routines don't have posix_memalign although
913 its memalloc could be used). */
914 #if defined (HAVE_POSIX_MEMALIGN) && defined (SYSTEM_MALLOC)
915 #define USE_POSIX_MEMALIGN 1
918 /* BLOCK_ALIGN has to be a power of 2. */
919 #define BLOCK_ALIGN (1 << 10)
921 /* Padding to leave at the end of a malloc'd block. This is to give
922 malloc a chance to minimize the amount of memory wasted to alignment.
923 It should be tuned to the particular malloc library used.
924 On glibc-2.3.2, malloc never tries to align, so a padding of 0 is best.
925 posix_memalign on the other hand would ideally prefer a value of 4
926 because otherwise, there's 1020 bytes wasted between each ablocks.
927 In Emacs, testing shows that those 1020 can most of the time be
928 efficiently used by malloc to place other objects, so a value of 0 can
929 still preferable unless you have a lot of aligned blocks and virtually
931 #define BLOCK_PADDING 0
932 #define BLOCK_BYTES \
933 (BLOCK_ALIGN - sizeof (struct ablock *) - BLOCK_PADDING)
935 /* Internal data structures and constants. */
937 #define ABLOCKS_SIZE 16
939 /* An aligned block of memory. */
944 char payload
[BLOCK_BYTES
];
945 struct ablock
*next_free
;
947 /* `abase' is the aligned base of the ablocks. */
948 /* It is overloaded to hold the virtual `busy' field that counts
949 the number of used ablock in the parent ablocks.
950 The first ablock has the `busy' field, the others have the `abase'
951 field. To tell the difference, we assume that pointers will have
952 integer values larger than 2 * ABLOCKS_SIZE. The lowest bit of `busy'
953 is used to tell whether the real base of the parent ablocks is `abase'
954 (if not, the word before the first ablock holds a pointer to the
956 struct ablocks
*abase
;
957 /* The padding of all but the last ablock is unused. The padding of
958 the last ablock in an ablocks is not allocated. */
960 char padding
[BLOCK_PADDING
];
964 /* A bunch of consecutive aligned blocks. */
967 struct ablock blocks
[ABLOCKS_SIZE
];
970 /* Size of the block requested from malloc or memalign. */
971 #define ABLOCKS_BYTES (sizeof (struct ablocks) - BLOCK_PADDING)
973 #define ABLOCK_ABASE(block) \
974 (((unsigned long) (block)->abase) <= (1 + 2 * ABLOCKS_SIZE) \
975 ? (struct ablocks *)(block) \
978 /* Virtual `busy' field. */
979 #define ABLOCKS_BUSY(abase) ((abase)->blocks[0].abase)
981 /* Pointer to the (not necessarily aligned) malloc block. */
982 #ifdef USE_POSIX_MEMALIGN
983 #define ABLOCKS_BASE(abase) (abase)
985 #define ABLOCKS_BASE(abase) \
986 (1 & (long) ABLOCKS_BUSY (abase) ? abase : ((void**)abase)[-1])
989 /* The list of free ablock. */
990 static struct ablock
*free_ablock
;
992 /* Allocate an aligned block of nbytes.
993 Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be
994 smaller or equal to BLOCK_BYTES. */
995 static POINTER_TYPE
*
996 lisp_align_malloc (nbytes
, type
)
1001 struct ablocks
*abase
;
1003 eassert (nbytes
<= BLOCK_BYTES
);
1007 #ifdef GC_MALLOC_CHECK
1008 allocated_mem_type
= type
;
1014 EMACS_INT aligned
; /* int gets warning casting to 64-bit pointer. */
1016 #ifdef DOUG_LEA_MALLOC
1017 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1018 because mapped region contents are not preserved in
1020 mallopt (M_MMAP_MAX
, 0);
1023 #ifdef USE_POSIX_MEMALIGN
1025 int err
= posix_memalign (&base
, BLOCK_ALIGN
, ABLOCKS_BYTES
);
1031 base
= malloc (ABLOCKS_BYTES
);
1032 abase
= ALIGN (base
, BLOCK_ALIGN
);
1037 MALLOC_UNBLOCK_INPUT
;
1041 aligned
= (base
== abase
);
1043 ((void**)abase
)[-1] = base
;
1045 #ifdef DOUG_LEA_MALLOC
1046 /* Back to a reasonable maximum of mmap'ed areas. */
1047 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1051 /* If the memory just allocated cannot be addressed thru a Lisp
1052 object's pointer, and it needs to be, that's equivalent to
1053 running out of memory. */
1054 if (type
!= MEM_TYPE_NON_LISP
)
1057 char *end
= (char *) base
+ ABLOCKS_BYTES
- 1;
1058 XSETCONS (tem
, end
);
1059 if ((char *) XCONS (tem
) != end
)
1061 lisp_malloc_loser
= base
;
1063 MALLOC_UNBLOCK_INPUT
;
1069 /* Initialize the blocks and put them on the free list.
1070 Is `base' was not properly aligned, we can't use the last block. */
1071 for (i
= 0; i
< (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1); i
++)
1073 abase
->blocks
[i
].abase
= abase
;
1074 abase
->blocks
[i
].x
.next_free
= free_ablock
;
1075 free_ablock
= &abase
->blocks
[i
];
1077 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (long) aligned
;
1079 eassert (0 == ((EMACS_UINT
)abase
) % BLOCK_ALIGN
);
1080 eassert (ABLOCK_ABASE (&abase
->blocks
[3]) == abase
); /* 3 is arbitrary */
1081 eassert (ABLOCK_ABASE (&abase
->blocks
[0]) == abase
);
1082 eassert (ABLOCKS_BASE (abase
) == base
);
1083 eassert (aligned
== (long) ABLOCKS_BUSY (abase
));
1086 abase
= ABLOCK_ABASE (free_ablock
);
1087 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (2 + (long) ABLOCKS_BUSY (abase
));
1089 free_ablock
= free_ablock
->x
.next_free
;
1091 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1092 if (val
&& type
!= MEM_TYPE_NON_LISP
)
1093 mem_insert (val
, (char *) val
+ nbytes
, type
);
1096 MALLOC_UNBLOCK_INPUT
;
1100 eassert (0 == ((EMACS_UINT
)val
) % BLOCK_ALIGN
);
1105 lisp_align_free (block
)
1106 POINTER_TYPE
*block
;
1108 struct ablock
*ablock
= block
;
1109 struct ablocks
*abase
= ABLOCK_ABASE (ablock
);
1112 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1113 mem_delete (mem_find (block
));
1115 /* Put on free list. */
1116 ablock
->x
.next_free
= free_ablock
;
1117 free_ablock
= ablock
;
1118 /* Update busy count. */
1119 ABLOCKS_BUSY (abase
) = (struct ablocks
*) (-2 + (long) ABLOCKS_BUSY (abase
));
1121 if (2 > (long) ABLOCKS_BUSY (abase
))
1122 { /* All the blocks are free. */
1123 int i
= 0, aligned
= (long) ABLOCKS_BUSY (abase
);
1124 struct ablock
**tem
= &free_ablock
;
1125 struct ablock
*atop
= &abase
->blocks
[aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1];
1129 if (*tem
>= (struct ablock
*) abase
&& *tem
< atop
)
1132 *tem
= (*tem
)->x
.next_free
;
1135 tem
= &(*tem
)->x
.next_free
;
1137 eassert ((aligned
& 1) == aligned
);
1138 eassert (i
== (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1));
1139 #ifdef USE_POSIX_MEMALIGN
1140 eassert ((unsigned long)ABLOCKS_BASE (abase
) % BLOCK_ALIGN
== 0);
1142 free (ABLOCKS_BASE (abase
));
1144 MALLOC_UNBLOCK_INPUT
;
1147 /* Return a new buffer structure allocated from the heap with
1148 a call to lisp_malloc. */
1154 = (struct buffer
*) lisp_malloc (sizeof (struct buffer
),
1156 b
->size
= sizeof (struct buffer
) / sizeof (EMACS_INT
);
1157 XSETPVECTYPE (b
, PVEC_BUFFER
);
1162 #ifndef SYSTEM_MALLOC
1164 /* Arranging to disable input signals while we're in malloc.
1166 This only works with GNU malloc. To help out systems which can't
1167 use GNU malloc, all the calls to malloc, realloc, and free
1168 elsewhere in the code should be inside a BLOCK_INPUT/UNBLOCK_INPUT
1169 pair; unfortunately, we have no idea what C library functions
1170 might call malloc, so we can't really protect them unless you're
1171 using GNU malloc. Fortunately, most of the major operating systems
1172 can use GNU malloc. */
1175 /* When using SYNC_INPUT, we don't call malloc from a signal handler, so
1176 there's no need to block input around malloc. */
1178 #ifndef DOUG_LEA_MALLOC
1179 extern void * (*__malloc_hook
) P_ ((size_t, const void *));
1180 extern void * (*__realloc_hook
) P_ ((void *, size_t, const void *));
1181 extern void (*__free_hook
) P_ ((void *, const void *));
1182 /* Else declared in malloc.h, perhaps with an extra arg. */
1183 #endif /* DOUG_LEA_MALLOC */
1184 static void * (*old_malloc_hook
) P_ ((size_t, const void *));
1185 static void * (*old_realloc_hook
) P_ ((void *, size_t, const void*));
1186 static void (*old_free_hook
) P_ ((void*, const void*));
1188 /* This function is used as the hook for free to call. */
1191 emacs_blocked_free (ptr
, ptr2
)
1197 #ifdef GC_MALLOC_CHECK
1203 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1206 "Freeing `%p' which wasn't allocated with malloc\n", ptr
);
1211 /* fprintf (stderr, "free %p...%p (%p)\n", m->start, m->end, ptr); */
1215 #endif /* GC_MALLOC_CHECK */
1217 __free_hook
= old_free_hook
;
1220 /* If we released our reserve (due to running out of memory),
1221 and we have a fair amount free once again,
1222 try to set aside another reserve in case we run out once more. */
1223 if (! NILP (Vmemory_full
)
1224 /* Verify there is enough space that even with the malloc
1225 hysteresis this call won't run out again.
1226 The code here is correct as long as SPARE_MEMORY
1227 is substantially larger than the block size malloc uses. */
1228 && (bytes_used_when_full
1229 > ((bytes_used_when_reconsidered
= BYTES_USED
)
1230 + max (malloc_hysteresis
, 4) * SPARE_MEMORY
)))
1231 refill_memory_reserve ();
1233 __free_hook
= emacs_blocked_free
;
1234 UNBLOCK_INPUT_ALLOC
;
1238 /* This function is the malloc hook that Emacs uses. */
1241 emacs_blocked_malloc (size
, ptr
)
1248 __malloc_hook
= old_malloc_hook
;
1249 #ifdef DOUG_LEA_MALLOC
1250 /* Segfaults on my system. --lorentey */
1251 /* mallopt (M_TOP_PAD, malloc_hysteresis * 4096); */
1253 __malloc_extra_blocks
= malloc_hysteresis
;
1256 value
= (void *) malloc (size
);
1258 #ifdef GC_MALLOC_CHECK
1260 struct mem_node
*m
= mem_find (value
);
1263 fprintf (stderr
, "Malloc returned %p which is already in use\n",
1265 fprintf (stderr
, "Region in use is %p...%p, %u bytes, type %d\n",
1266 m
->start
, m
->end
, (char *) m
->end
- (char *) m
->start
,
1271 if (!dont_register_blocks
)
1273 mem_insert (value
, (char *) value
+ max (1, size
), allocated_mem_type
);
1274 allocated_mem_type
= MEM_TYPE_NON_LISP
;
1277 #endif /* GC_MALLOC_CHECK */
1279 __malloc_hook
= emacs_blocked_malloc
;
1280 UNBLOCK_INPUT_ALLOC
;
1282 /* fprintf (stderr, "%p malloc\n", value); */
1287 /* This function is the realloc hook that Emacs uses. */
1290 emacs_blocked_realloc (ptr
, size
, ptr2
)
1298 __realloc_hook
= old_realloc_hook
;
1300 #ifdef GC_MALLOC_CHECK
1303 struct mem_node
*m
= mem_find (ptr
);
1304 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1307 "Realloc of %p which wasn't allocated with malloc\n",
1315 /* fprintf (stderr, "%p -> realloc\n", ptr); */
1317 /* Prevent malloc from registering blocks. */
1318 dont_register_blocks
= 1;
1319 #endif /* GC_MALLOC_CHECK */
1321 value
= (void *) realloc (ptr
, size
);
1323 #ifdef GC_MALLOC_CHECK
1324 dont_register_blocks
= 0;
1327 struct mem_node
*m
= mem_find (value
);
1330 fprintf (stderr
, "Realloc returns memory that is already in use\n");
1334 /* Can't handle zero size regions in the red-black tree. */
1335 mem_insert (value
, (char *) value
+ max (size
, 1), MEM_TYPE_NON_LISP
);
1338 /* fprintf (stderr, "%p <- realloc\n", value); */
1339 #endif /* GC_MALLOC_CHECK */
1341 __realloc_hook
= emacs_blocked_realloc
;
1342 UNBLOCK_INPUT_ALLOC
;
1348 #ifdef HAVE_GTK_AND_PTHREAD
1349 /* Called from Fdump_emacs so that when the dumped Emacs starts, it has a
1350 normal malloc. Some thread implementations need this as they call
1351 malloc before main. The pthread_self call in BLOCK_INPUT_ALLOC then
1352 calls malloc because it is the first call, and we have an endless loop. */
1355 reset_malloc_hooks ()
1357 __free_hook
= old_free_hook
;
1358 __malloc_hook
= old_malloc_hook
;
1359 __realloc_hook
= old_realloc_hook
;
1361 #endif /* HAVE_GTK_AND_PTHREAD */
1364 /* Called from main to set up malloc to use our hooks. */
1367 uninterrupt_malloc ()
1369 #ifdef HAVE_GTK_AND_PTHREAD
1370 #ifdef DOUG_LEA_MALLOC
1371 pthread_mutexattr_t attr
;
1373 /* GLIBC has a faster way to do this, but lets keep it portable.
1374 This is according to the Single UNIX Specification. */
1375 pthread_mutexattr_init (&attr
);
1376 pthread_mutexattr_settype (&attr
, PTHREAD_MUTEX_RECURSIVE
);
1377 pthread_mutex_init (&alloc_mutex
, &attr
);
1378 #else /* !DOUG_LEA_MALLOC */
1379 /* Some systems such as Solaris 2.6 doesn't have a recursive mutex,
1380 and the bundled gmalloc.c doesn't require it. */
1381 pthread_mutex_init (&alloc_mutex
, NULL
);
1382 #endif /* !DOUG_LEA_MALLOC */
1383 #endif /* HAVE_GTK_AND_PTHREAD */
1385 if (__free_hook
!= emacs_blocked_free
)
1386 old_free_hook
= __free_hook
;
1387 __free_hook
= emacs_blocked_free
;
1389 if (__malloc_hook
!= emacs_blocked_malloc
)
1390 old_malloc_hook
= __malloc_hook
;
1391 __malloc_hook
= emacs_blocked_malloc
;
1393 if (__realloc_hook
!= emacs_blocked_realloc
)
1394 old_realloc_hook
= __realloc_hook
;
1395 __realloc_hook
= emacs_blocked_realloc
;
1398 #endif /* not SYNC_INPUT */
1399 #endif /* not SYSTEM_MALLOC */
1403 /***********************************************************************
1405 ***********************************************************************/
1407 /* Number of intervals allocated in an interval_block structure.
1408 The 1020 is 1024 minus malloc overhead. */
1410 #define INTERVAL_BLOCK_SIZE \
1411 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
1413 /* Intervals are allocated in chunks in form of an interval_block
1416 struct interval_block
1418 /* Place `intervals' first, to preserve alignment. */
1419 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
1420 struct interval_block
*next
;
1423 /* Current interval block. Its `next' pointer points to older
1426 static struct interval_block
*interval_block
;
1428 /* Index in interval_block above of the next unused interval
1431 static int interval_block_index
;
1433 /* Number of free and live intervals. */
1435 static int total_free_intervals
, total_intervals
;
1437 /* List of free intervals. */
1439 INTERVAL interval_free_list
;
1441 /* Total number of interval blocks now in use. */
1443 static int n_interval_blocks
;
1446 /* Initialize interval allocation. */
1451 interval_block
= NULL
;
1452 interval_block_index
= INTERVAL_BLOCK_SIZE
;
1453 interval_free_list
= 0;
1454 n_interval_blocks
= 0;
1458 /* Return a new interval. */
1465 /* eassert (!handling_signal); */
1469 if (interval_free_list
)
1471 val
= interval_free_list
;
1472 interval_free_list
= INTERVAL_PARENT (interval_free_list
);
1476 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
1478 register struct interval_block
*newi
;
1480 newi
= (struct interval_block
*) lisp_malloc (sizeof *newi
,
1483 newi
->next
= interval_block
;
1484 interval_block
= newi
;
1485 interval_block_index
= 0;
1486 n_interval_blocks
++;
1488 val
= &interval_block
->intervals
[interval_block_index
++];
1491 MALLOC_UNBLOCK_INPUT
;
1493 consing_since_gc
+= sizeof (struct interval
);
1495 RESET_INTERVAL (val
);
1501 /* Mark Lisp objects in interval I. */
1504 mark_interval (i
, dummy
)
1505 register INTERVAL i
;
1508 eassert (!i
->gcmarkbit
); /* Intervals are never shared. */
1510 mark_object (i
->plist
);
1514 /* Mark the interval tree rooted in TREE. Don't call this directly;
1515 use the macro MARK_INTERVAL_TREE instead. */
1518 mark_interval_tree (tree
)
1519 register INTERVAL tree
;
1521 /* No need to test if this tree has been marked already; this
1522 function is always called through the MARK_INTERVAL_TREE macro,
1523 which takes care of that. */
1525 traverse_intervals_noorder (tree
, mark_interval
, Qnil
);
1529 /* Mark the interval tree rooted in I. */
1531 #define MARK_INTERVAL_TREE(i) \
1533 if (!NULL_INTERVAL_P (i) && !i->gcmarkbit) \
1534 mark_interval_tree (i); \
1538 #define UNMARK_BALANCE_INTERVALS(i) \
1540 if (! NULL_INTERVAL_P (i)) \
1541 (i) = balance_intervals (i); \
1545 /* Number support. If USE_LISP_UNION_TYPE is in effect, we
1546 can't create number objects in macros. */
1554 obj
.s
.type
= Lisp_Int
;
1559 /***********************************************************************
1561 ***********************************************************************/
1563 /* Lisp_Strings are allocated in string_block structures. When a new
1564 string_block is allocated, all the Lisp_Strings it contains are
1565 added to a free-list string_free_list. When a new Lisp_String is
1566 needed, it is taken from that list. During the sweep phase of GC,
1567 string_blocks that are entirely free are freed, except two which
1570 String data is allocated from sblock structures. Strings larger
1571 than LARGE_STRING_BYTES, get their own sblock, data for smaller
1572 strings is sub-allocated out of sblocks of size SBLOCK_SIZE.
1574 Sblocks consist internally of sdata structures, one for each
1575 Lisp_String. The sdata structure points to the Lisp_String it
1576 belongs to. The Lisp_String points back to the `u.data' member of
1577 its sdata structure.
1579 When a Lisp_String is freed during GC, it is put back on
1580 string_free_list, and its `data' member and its sdata's `string'
1581 pointer is set to null. The size of the string is recorded in the
1582 `u.nbytes' member of the sdata. So, sdata structures that are no
1583 longer used, can be easily recognized, and it's easy to compact the
1584 sblocks of small strings which we do in compact_small_strings. */
1586 /* Size in bytes of an sblock structure used for small strings. This
1587 is 8192 minus malloc overhead. */
1589 #define SBLOCK_SIZE 8188
1591 /* Strings larger than this are considered large strings. String data
1592 for large strings is allocated from individual sblocks. */
1594 #define LARGE_STRING_BYTES 1024
1596 /* Structure describing string memory sub-allocated from an sblock.
1597 This is where the contents of Lisp strings are stored. */
1601 /* Back-pointer to the string this sdata belongs to. If null, this
1602 structure is free, and the NBYTES member of the union below
1603 contains the string's byte size (the same value that STRING_BYTES
1604 would return if STRING were non-null). If non-null, STRING_BYTES
1605 (STRING) is the size of the data, and DATA contains the string's
1607 struct Lisp_String
*string
;
1609 #ifdef GC_CHECK_STRING_BYTES
1612 unsigned char data
[1];
1614 #define SDATA_NBYTES(S) (S)->nbytes
1615 #define SDATA_DATA(S) (S)->data
1617 #else /* not GC_CHECK_STRING_BYTES */
1621 /* When STRING in non-null. */
1622 unsigned char data
[1];
1624 /* When STRING is null. */
1629 #define SDATA_NBYTES(S) (S)->u.nbytes
1630 #define SDATA_DATA(S) (S)->u.data
1632 #endif /* not GC_CHECK_STRING_BYTES */
1636 /* Structure describing a block of memory which is sub-allocated to
1637 obtain string data memory for strings. Blocks for small strings
1638 are of fixed size SBLOCK_SIZE. Blocks for large strings are made
1639 as large as needed. */
1644 struct sblock
*next
;
1646 /* Pointer to the next free sdata block. This points past the end
1647 of the sblock if there isn't any space left in this block. */
1648 struct sdata
*next_free
;
1650 /* Start of data. */
1651 struct sdata first_data
;
1654 /* Number of Lisp strings in a string_block structure. The 1020 is
1655 1024 minus malloc overhead. */
1657 #define STRING_BLOCK_SIZE \
1658 ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String))
1660 /* Structure describing a block from which Lisp_String structures
1665 /* Place `strings' first, to preserve alignment. */
1666 struct Lisp_String strings
[STRING_BLOCK_SIZE
];
1667 struct string_block
*next
;
1670 /* Head and tail of the list of sblock structures holding Lisp string
1671 data. We always allocate from current_sblock. The NEXT pointers
1672 in the sblock structures go from oldest_sblock to current_sblock. */
1674 static struct sblock
*oldest_sblock
, *current_sblock
;
1676 /* List of sblocks for large strings. */
1678 static struct sblock
*large_sblocks
;
1680 /* List of string_block structures, and how many there are. */
1682 static struct string_block
*string_blocks
;
1683 static int n_string_blocks
;
1685 /* Free-list of Lisp_Strings. */
1687 static struct Lisp_String
*string_free_list
;
1689 /* Number of live and free Lisp_Strings. */
1691 static int total_strings
, total_free_strings
;
1693 /* Number of bytes used by live strings. */
1695 static int total_string_size
;
1697 /* Given a pointer to a Lisp_String S which is on the free-list
1698 string_free_list, return a pointer to its successor in the
1701 #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S))
1703 /* Return a pointer to the sdata structure belonging to Lisp string S.
1704 S must be live, i.e. S->data must not be null. S->data is actually
1705 a pointer to the `u.data' member of its sdata structure; the
1706 structure starts at a constant offset in front of that. */
1708 #ifdef GC_CHECK_STRING_BYTES
1710 #define SDATA_OF_STRING(S) \
1711 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *) \
1712 - sizeof (EMACS_INT)))
1714 #else /* not GC_CHECK_STRING_BYTES */
1716 #define SDATA_OF_STRING(S) \
1717 ((struct sdata *) ((S)->data - sizeof (struct Lisp_String *)))
1719 #endif /* not GC_CHECK_STRING_BYTES */
1722 #ifdef GC_CHECK_STRING_OVERRUN
1724 /* We check for overrun in string data blocks by appending a small
1725 "cookie" after each allocated string data block, and check for the
1726 presence of this cookie during GC. */
1728 #define GC_STRING_OVERRUN_COOKIE_SIZE 4
1729 static char string_overrun_cookie
[GC_STRING_OVERRUN_COOKIE_SIZE
] =
1730 { 0xde, 0xad, 0xbe, 0xef };
1733 #define GC_STRING_OVERRUN_COOKIE_SIZE 0
1736 /* Value is the size of an sdata structure large enough to hold NBYTES
1737 bytes of string data. The value returned includes a terminating
1738 NUL byte, the size of the sdata structure, and padding. */
1740 #ifdef GC_CHECK_STRING_BYTES
1742 #define SDATA_SIZE(NBYTES) \
1743 ((sizeof (struct Lisp_String *) \
1745 + sizeof (EMACS_INT) \
1746 + sizeof (EMACS_INT) - 1) \
1747 & ~(sizeof (EMACS_INT) - 1))
1749 #else /* not GC_CHECK_STRING_BYTES */
1751 #define SDATA_SIZE(NBYTES) \
1752 ((sizeof (struct Lisp_String *) \
1754 + sizeof (EMACS_INT) - 1) \
1755 & ~(sizeof (EMACS_INT) - 1))
1757 #endif /* not GC_CHECK_STRING_BYTES */
1759 /* Extra bytes to allocate for each string. */
1761 #define GC_STRING_EXTRA (GC_STRING_OVERRUN_COOKIE_SIZE)
1763 /* Initialize string allocation. Called from init_alloc_once. */
1768 total_strings
= total_free_strings
= total_string_size
= 0;
1769 oldest_sblock
= current_sblock
= large_sblocks
= NULL
;
1770 string_blocks
= NULL
;
1771 n_string_blocks
= 0;
1772 string_free_list
= NULL
;
1773 empty_unibyte_string
= make_pure_string ("", 0, 0, 0);
1774 empty_multibyte_string
= make_pure_string ("", 0, 0, 1);
1778 #ifdef GC_CHECK_STRING_BYTES
1780 static int check_string_bytes_count
;
1782 static void check_string_bytes
P_ ((int));
1783 static void check_sblock
P_ ((struct sblock
*));
1785 #define CHECK_STRING_BYTES(S) STRING_BYTES (S)
1788 /* Like GC_STRING_BYTES, but with debugging check. */
1792 struct Lisp_String
*s
;
1794 int nbytes
= (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1795 if (!PURE_POINTER_P (s
)
1797 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1802 /* Check validity of Lisp strings' string_bytes member in B. */
1808 struct sdata
*from
, *end
, *from_end
;
1812 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1814 /* Compute the next FROM here because copying below may
1815 overwrite data we need to compute it. */
1818 /* Check that the string size recorded in the string is the
1819 same as the one recorded in the sdata structure. */
1821 CHECK_STRING_BYTES (from
->string
);
1824 nbytes
= GC_STRING_BYTES (from
->string
);
1826 nbytes
= SDATA_NBYTES (from
);
1828 nbytes
= SDATA_SIZE (nbytes
);
1829 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
1834 /* Check validity of Lisp strings' string_bytes member. ALL_P
1835 non-zero means check all strings, otherwise check only most
1836 recently allocated strings. Used for hunting a bug. */
1839 check_string_bytes (all_p
)
1846 for (b
= large_sblocks
; b
; b
= b
->next
)
1848 struct Lisp_String
*s
= b
->first_data
.string
;
1850 CHECK_STRING_BYTES (s
);
1853 for (b
= oldest_sblock
; b
; b
= b
->next
)
1857 check_sblock (current_sblock
);
1860 #endif /* GC_CHECK_STRING_BYTES */
1862 #ifdef GC_CHECK_STRING_FREE_LIST
1864 /* Walk through the string free list looking for bogus next pointers.
1865 This may catch buffer overrun from a previous string. */
1868 check_string_free_list ()
1870 struct Lisp_String
*s
;
1872 /* Pop a Lisp_String off the free-list. */
1873 s
= string_free_list
;
1876 if ((unsigned)s
< 1024)
1878 s
= NEXT_FREE_LISP_STRING (s
);
1882 #define check_string_free_list()
1885 /* Return a new Lisp_String. */
1887 static struct Lisp_String
*
1890 struct Lisp_String
*s
;
1892 /* eassert (!handling_signal); */
1896 /* If the free-list is empty, allocate a new string_block, and
1897 add all the Lisp_Strings in it to the free-list. */
1898 if (string_free_list
== NULL
)
1900 struct string_block
*b
;
1903 b
= (struct string_block
*) lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1904 bzero (b
, sizeof *b
);
1905 b
->next
= string_blocks
;
1909 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1912 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1913 string_free_list
= s
;
1916 total_free_strings
+= STRING_BLOCK_SIZE
;
1919 check_string_free_list ();
1921 /* Pop a Lisp_String off the free-list. */
1922 s
= string_free_list
;
1923 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1925 MALLOC_UNBLOCK_INPUT
;
1927 /* Probably not strictly necessary, but play it safe. */
1928 bzero (s
, sizeof *s
);
1930 --total_free_strings
;
1933 consing_since_gc
+= sizeof *s
;
1935 #ifdef GC_CHECK_STRING_BYTES
1936 if (!noninteractive
)
1938 if (++check_string_bytes_count
== 200)
1940 check_string_bytes_count
= 0;
1941 check_string_bytes (1);
1944 check_string_bytes (0);
1946 #endif /* GC_CHECK_STRING_BYTES */
1952 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1953 plus a NUL byte at the end. Allocate an sdata structure for S, and
1954 set S->data to its `u.data' member. Store a NUL byte at the end of
1955 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1956 S->data if it was initially non-null. */
1959 allocate_string_data (s
, nchars
, nbytes
)
1960 struct Lisp_String
*s
;
1963 struct sdata
*data
, *old_data
;
1965 int needed
, old_nbytes
;
1967 /* Determine the number of bytes needed to store NBYTES bytes
1969 needed
= SDATA_SIZE (nbytes
);
1970 old_data
= s
->data
? SDATA_OF_STRING (s
) : NULL
;
1971 old_nbytes
= GC_STRING_BYTES (s
);
1975 if (nbytes
> LARGE_STRING_BYTES
)
1977 size_t size
= sizeof *b
- sizeof (struct sdata
) + needed
;
1979 #ifdef DOUG_LEA_MALLOC
1980 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1981 because mapped region contents are not preserved in
1984 In case you think of allowing it in a dumped Emacs at the
1985 cost of not being able to re-dump, there's another reason:
1986 mmap'ed data typically have an address towards the top of the
1987 address space, which won't fit into an EMACS_INT (at least on
1988 32-bit systems with the current tagging scheme). --fx */
1989 mallopt (M_MMAP_MAX
, 0);
1992 b
= (struct sblock
*) lisp_malloc (size
+ GC_STRING_EXTRA
, MEM_TYPE_NON_LISP
);
1994 #ifdef DOUG_LEA_MALLOC
1995 /* Back to a reasonable maximum of mmap'ed areas. */
1996 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1999 b
->next_free
= &b
->first_data
;
2000 b
->first_data
.string
= NULL
;
2001 b
->next
= large_sblocks
;
2004 else if (current_sblock
== NULL
2005 || (((char *) current_sblock
+ SBLOCK_SIZE
2006 - (char *) current_sblock
->next_free
)
2007 < (needed
+ GC_STRING_EXTRA
)))
2009 /* Not enough room in the current sblock. */
2010 b
= (struct sblock
*) lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
2011 b
->next_free
= &b
->first_data
;
2012 b
->first_data
.string
= NULL
;
2016 current_sblock
->next
= b
;
2024 data
= b
->next_free
;
2025 b
->next_free
= (struct sdata
*) ((char *) data
+ needed
+ GC_STRING_EXTRA
);
2027 MALLOC_UNBLOCK_INPUT
;
2030 s
->data
= SDATA_DATA (data
);
2031 #ifdef GC_CHECK_STRING_BYTES
2032 SDATA_NBYTES (data
) = nbytes
;
2035 s
->size_byte
= nbytes
;
2036 s
->data
[nbytes
] = '\0';
2037 #ifdef GC_CHECK_STRING_OVERRUN
2038 bcopy (string_overrun_cookie
, (char *) data
+ needed
,
2039 GC_STRING_OVERRUN_COOKIE_SIZE
);
2042 /* If S had already data assigned, mark that as free by setting its
2043 string back-pointer to null, and recording the size of the data
2047 SDATA_NBYTES (old_data
) = old_nbytes
;
2048 old_data
->string
= NULL
;
2051 consing_since_gc
+= needed
;
2055 /* Sweep and compact strings. */
2060 struct string_block
*b
, *next
;
2061 struct string_block
*live_blocks
= NULL
;
2063 string_free_list
= NULL
;
2064 total_strings
= total_free_strings
= 0;
2065 total_string_size
= 0;
2067 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
2068 for (b
= string_blocks
; b
; b
= next
)
2071 struct Lisp_String
*free_list_before
= string_free_list
;
2075 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
2077 struct Lisp_String
*s
= b
->strings
+ i
;
2081 /* String was not on free-list before. */
2082 if (STRING_MARKED_P (s
))
2084 /* String is live; unmark it and its intervals. */
2087 if (!NULL_INTERVAL_P (s
->intervals
))
2088 UNMARK_BALANCE_INTERVALS (s
->intervals
);
2091 total_string_size
+= STRING_BYTES (s
);
2095 /* String is dead. Put it on the free-list. */
2096 struct sdata
*data
= SDATA_OF_STRING (s
);
2098 /* Save the size of S in its sdata so that we know
2099 how large that is. Reset the sdata's string
2100 back-pointer so that we know it's free. */
2101 #ifdef GC_CHECK_STRING_BYTES
2102 if (GC_STRING_BYTES (s
) != SDATA_NBYTES (data
))
2105 data
->u
.nbytes
= GC_STRING_BYTES (s
);
2107 data
->string
= NULL
;
2109 /* Reset the strings's `data' member so that we
2113 /* Put the string on the free-list. */
2114 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2115 string_free_list
= s
;
2121 /* S was on the free-list before. Put it there again. */
2122 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2123 string_free_list
= s
;
2128 /* Free blocks that contain free Lisp_Strings only, except
2129 the first two of them. */
2130 if (nfree
== STRING_BLOCK_SIZE
2131 && total_free_strings
> STRING_BLOCK_SIZE
)
2135 string_free_list
= free_list_before
;
2139 total_free_strings
+= nfree
;
2140 b
->next
= live_blocks
;
2145 check_string_free_list ();
2147 string_blocks
= live_blocks
;
2148 free_large_strings ();
2149 compact_small_strings ();
2151 check_string_free_list ();
2155 /* Free dead large strings. */
2158 free_large_strings ()
2160 struct sblock
*b
, *next
;
2161 struct sblock
*live_blocks
= NULL
;
2163 for (b
= large_sblocks
; b
; b
= next
)
2167 if (b
->first_data
.string
== NULL
)
2171 b
->next
= live_blocks
;
2176 large_sblocks
= live_blocks
;
2180 /* Compact data of small strings. Free sblocks that don't contain
2181 data of live strings after compaction. */
2184 compact_small_strings ()
2186 struct sblock
*b
, *tb
, *next
;
2187 struct sdata
*from
, *to
, *end
, *tb_end
;
2188 struct sdata
*to_end
, *from_end
;
2190 /* TB is the sblock we copy to, TO is the sdata within TB we copy
2191 to, and TB_END is the end of TB. */
2193 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2194 to
= &tb
->first_data
;
2196 /* Step through the blocks from the oldest to the youngest. We
2197 expect that old blocks will stabilize over time, so that less
2198 copying will happen this way. */
2199 for (b
= oldest_sblock
; b
; b
= b
->next
)
2202 xassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
2204 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
2206 /* Compute the next FROM here because copying below may
2207 overwrite data we need to compute it. */
2210 #ifdef GC_CHECK_STRING_BYTES
2211 /* Check that the string size recorded in the string is the
2212 same as the one recorded in the sdata structure. */
2214 && GC_STRING_BYTES (from
->string
) != SDATA_NBYTES (from
))
2216 #endif /* GC_CHECK_STRING_BYTES */
2219 nbytes
= GC_STRING_BYTES (from
->string
);
2221 nbytes
= SDATA_NBYTES (from
);
2223 if (nbytes
> LARGE_STRING_BYTES
)
2226 nbytes
= SDATA_SIZE (nbytes
);
2227 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
2229 #ifdef GC_CHECK_STRING_OVERRUN
2230 if (bcmp (string_overrun_cookie
,
2231 ((char *) from_end
) - GC_STRING_OVERRUN_COOKIE_SIZE
,
2232 GC_STRING_OVERRUN_COOKIE_SIZE
))
2236 /* FROM->string non-null means it's alive. Copy its data. */
2239 /* If TB is full, proceed with the next sblock. */
2240 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2241 if (to_end
> tb_end
)
2245 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2246 to
= &tb
->first_data
;
2247 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2250 /* Copy, and update the string's `data' pointer. */
2253 xassert (tb
!= b
|| to
<= from
);
2254 safe_bcopy ((char *) from
, (char *) to
, nbytes
+ GC_STRING_EXTRA
);
2255 to
->string
->data
= SDATA_DATA (to
);
2258 /* Advance past the sdata we copied to. */
2264 /* The rest of the sblocks following TB don't contain live data, so
2265 we can free them. */
2266 for (b
= tb
->next
; b
; b
= next
)
2274 current_sblock
= tb
;
2278 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
2279 doc
: /* Return a newly created string of length LENGTH, with INIT in each element.
2280 LENGTH must be an integer.
2281 INIT must be an integer that represents a character. */)
2283 Lisp_Object length
, init
;
2285 register Lisp_Object val
;
2286 register unsigned char *p
, *end
;
2289 CHECK_NATNUM (length
);
2290 CHECK_NUMBER (init
);
2293 if (ASCII_CHAR_P (c
))
2295 nbytes
= XINT (length
);
2296 val
= make_uninit_string (nbytes
);
2298 end
= p
+ SCHARS (val
);
2304 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
2305 int len
= CHAR_STRING (c
, str
);
2307 nbytes
= len
* XINT (length
);
2308 val
= make_uninit_multibyte_string (XINT (length
), nbytes
);
2313 bcopy (str
, p
, len
);
2323 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
2324 doc
: /* Return a new bool-vector of length LENGTH, using INIT for each element.
2325 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
2327 Lisp_Object length
, init
;
2329 register Lisp_Object val
;
2330 struct Lisp_Bool_Vector
*p
;
2332 int length_in_chars
, length_in_elts
, bits_per_value
;
2334 CHECK_NATNUM (length
);
2336 bits_per_value
= sizeof (EMACS_INT
) * BOOL_VECTOR_BITS_PER_CHAR
;
2338 length_in_elts
= (XFASTINT (length
) + bits_per_value
- 1) / bits_per_value
;
2339 length_in_chars
= ((XFASTINT (length
) + BOOL_VECTOR_BITS_PER_CHAR
- 1)
2340 / BOOL_VECTOR_BITS_PER_CHAR
);
2342 /* We must allocate one more elements than LENGTH_IN_ELTS for the
2343 slot `size' of the struct Lisp_Bool_Vector. */
2344 val
= Fmake_vector (make_number (length_in_elts
+ 1), Qnil
);
2346 /* Get rid of any bits that would cause confusion. */
2347 XVECTOR (val
)->size
= 0; /* No Lisp_Object to trace in there. */
2348 /* Use XVECTOR (val) rather than `p' because p->size is not TRT. */
2349 XSETPVECTYPE (XVECTOR (val
), PVEC_BOOL_VECTOR
);
2351 p
= XBOOL_VECTOR (val
);
2352 p
->size
= XFASTINT (length
);
2354 real_init
= (NILP (init
) ? 0 : -1);
2355 for (i
= 0; i
< length_in_chars
; i
++)
2356 p
->data
[i
] = real_init
;
2358 /* Clear the extraneous bits in the last byte. */
2359 if (XINT (length
) != length_in_chars
* BOOL_VECTOR_BITS_PER_CHAR
)
2360 p
->data
[length_in_chars
- 1]
2361 &= (1 << (XINT (length
) % BOOL_VECTOR_BITS_PER_CHAR
)) - 1;
2367 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
2368 of characters from the contents. This string may be unibyte or
2369 multibyte, depending on the contents. */
2372 make_string (contents
, nbytes
)
2373 const char *contents
;
2376 register Lisp_Object val
;
2377 int nchars
, multibyte_nbytes
;
2379 parse_str_as_multibyte (contents
, nbytes
, &nchars
, &multibyte_nbytes
);
2380 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
2381 /* CONTENTS contains no multibyte sequences or contains an invalid
2382 multibyte sequence. We must make unibyte string. */
2383 val
= make_unibyte_string (contents
, nbytes
);
2385 val
= make_multibyte_string (contents
, nchars
, nbytes
);
2390 /* Make an unibyte string from LENGTH bytes at CONTENTS. */
2393 make_unibyte_string (contents
, length
)
2394 const char *contents
;
2397 register Lisp_Object val
;
2398 val
= make_uninit_string (length
);
2399 bcopy (contents
, SDATA (val
), length
);
2400 STRING_SET_UNIBYTE (val
);
2405 /* Make a multibyte string from NCHARS characters occupying NBYTES
2406 bytes at CONTENTS. */
2409 make_multibyte_string (contents
, nchars
, nbytes
)
2410 const char *contents
;
2413 register Lisp_Object val
;
2414 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2415 bcopy (contents
, SDATA (val
), nbytes
);
2420 /* Make a string from NCHARS characters occupying NBYTES bytes at
2421 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2424 make_string_from_bytes (contents
, nchars
, nbytes
)
2425 const char *contents
;
2428 register Lisp_Object val
;
2429 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2430 bcopy (contents
, SDATA (val
), nbytes
);
2431 if (SBYTES (val
) == SCHARS (val
))
2432 STRING_SET_UNIBYTE (val
);
2437 /* Make a string from NCHARS characters occupying NBYTES bytes at
2438 CONTENTS. The argument MULTIBYTE controls whether to label the
2439 string as multibyte. If NCHARS is negative, it counts the number of
2440 characters by itself. */
2443 make_specified_string (contents
, nchars
, nbytes
, multibyte
)
2444 const char *contents
;
2448 register Lisp_Object val
;
2453 nchars
= multibyte_chars_in_text (contents
, nbytes
);
2457 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2458 bcopy (contents
, SDATA (val
), nbytes
);
2460 STRING_SET_UNIBYTE (val
);
2465 /* Make a string from the data at STR, treating it as multibyte if the
2472 return make_string (str
, strlen (str
));
2476 /* Return an unibyte Lisp_String set up to hold LENGTH characters
2477 occupying LENGTH bytes. */
2480 make_uninit_string (length
)
2486 return empty_unibyte_string
;
2487 val
= make_uninit_multibyte_string (length
, length
);
2488 STRING_SET_UNIBYTE (val
);
2493 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2494 which occupy NBYTES bytes. */
2497 make_uninit_multibyte_string (nchars
, nbytes
)
2501 struct Lisp_String
*s
;
2506 return empty_multibyte_string
;
2508 s
= allocate_string ();
2509 allocate_string_data (s
, nchars
, nbytes
);
2510 XSETSTRING (string
, s
);
2511 string_chars_consed
+= nbytes
;
2517 /***********************************************************************
2519 ***********************************************************************/
2521 /* We store float cells inside of float_blocks, allocating a new
2522 float_block with malloc whenever necessary. Float cells reclaimed
2523 by GC are put on a free list to be reallocated before allocating
2524 any new float cells from the latest float_block. */
2526 #define FLOAT_BLOCK_SIZE \
2527 (((BLOCK_BYTES - sizeof (struct float_block *) \
2528 /* The compiler might add padding at the end. */ \
2529 - (sizeof (struct Lisp_Float) - sizeof (int))) * CHAR_BIT) \
2530 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2532 #define GETMARKBIT(block,n) \
2533 (((block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2534 >> ((n) % (sizeof(int) * CHAR_BIT))) \
2537 #define SETMARKBIT(block,n) \
2538 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2539 |= 1 << ((n) % (sizeof(int) * CHAR_BIT))
2541 #define UNSETMARKBIT(block,n) \
2542 (block)->gcmarkbits[(n) / (sizeof(int) * CHAR_BIT)] \
2543 &= ~(1 << ((n) % (sizeof(int) * CHAR_BIT)))
2545 #define FLOAT_BLOCK(fptr) \
2546 ((struct float_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2548 #define FLOAT_INDEX(fptr) \
2549 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2553 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2554 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2555 int gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2556 struct float_block
*next
;
2559 #define FLOAT_MARKED_P(fptr) \
2560 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2562 #define FLOAT_MARK(fptr) \
2563 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2565 #define FLOAT_UNMARK(fptr) \
2566 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2568 /* Current float_block. */
2570 struct float_block
*float_block
;
2572 /* Index of first unused Lisp_Float in the current float_block. */
2574 int float_block_index
;
2576 /* Total number of float blocks now in use. */
2580 /* Free-list of Lisp_Floats. */
2582 struct Lisp_Float
*float_free_list
;
2585 /* Initialize float allocation. */
2591 float_block_index
= FLOAT_BLOCK_SIZE
; /* Force alloc of new float_block. */
2592 float_free_list
= 0;
2597 /* Explicitly free a float cell by putting it on the free-list. */
2601 struct Lisp_Float
*ptr
;
2603 ptr
->u
.chain
= float_free_list
;
2604 float_free_list
= ptr
;
2608 /* Return a new float object with value FLOAT_VALUE. */
2611 make_float (float_value
)
2614 register Lisp_Object val
;
2616 /* eassert (!handling_signal); */
2620 if (float_free_list
)
2622 /* We use the data field for chaining the free list
2623 so that we won't use the same field that has the mark bit. */
2624 XSETFLOAT (val
, float_free_list
);
2625 float_free_list
= float_free_list
->u
.chain
;
2629 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2631 register struct float_block
*new;
2633 new = (struct float_block
*) lisp_align_malloc (sizeof *new,
2635 new->next
= float_block
;
2636 bzero ((char *) new->gcmarkbits
, sizeof new->gcmarkbits
);
2638 float_block_index
= 0;
2641 XSETFLOAT (val
, &float_block
->floats
[float_block_index
]);
2642 float_block_index
++;
2645 MALLOC_UNBLOCK_INPUT
;
2647 XFLOAT_INIT (val
, float_value
);
2648 eassert (!FLOAT_MARKED_P (XFLOAT (val
)));
2649 consing_since_gc
+= sizeof (struct Lisp_Float
);
2656 /***********************************************************************
2658 ***********************************************************************/
2660 /* We store cons cells inside of cons_blocks, allocating a new
2661 cons_block with malloc whenever necessary. Cons cells reclaimed by
2662 GC are put on a free list to be reallocated before allocating
2663 any new cons cells from the latest cons_block. */
2665 #define CONS_BLOCK_SIZE \
2666 (((BLOCK_BYTES - sizeof (struct cons_block *)) * CHAR_BIT) \
2667 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2669 #define CONS_BLOCK(fptr) \
2670 ((struct cons_block *)(((EMACS_UINT)(fptr)) & ~(BLOCK_ALIGN - 1)))
2672 #define CONS_INDEX(fptr) \
2673 ((((EMACS_UINT)(fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2677 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2678 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2679 int gcmarkbits
[1 + CONS_BLOCK_SIZE
/ (sizeof(int) * CHAR_BIT
)];
2680 struct cons_block
*next
;
2683 #define CONS_MARKED_P(fptr) \
2684 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2686 #define CONS_MARK(fptr) \
2687 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2689 #define CONS_UNMARK(fptr) \
2690 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2692 /* Current cons_block. */
2694 struct cons_block
*cons_block
;
2696 /* Index of first unused Lisp_Cons in the current block. */
2698 int cons_block_index
;
2700 /* Free-list of Lisp_Cons structures. */
2702 struct Lisp_Cons
*cons_free_list
;
2704 /* Total number of cons blocks now in use. */
2706 static int n_cons_blocks
;
2709 /* Initialize cons allocation. */
2715 cons_block_index
= CONS_BLOCK_SIZE
; /* Force alloc of new cons_block. */
2721 /* Explicitly free a cons cell by putting it on the free-list. */
2725 struct Lisp_Cons
*ptr
;
2727 ptr
->u
.chain
= cons_free_list
;
2731 cons_free_list
= ptr
;
2734 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
2735 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2737 Lisp_Object car
, cdr
;
2739 register Lisp_Object val
;
2741 /* eassert (!handling_signal); */
2747 /* We use the cdr for chaining the free list
2748 so that we won't use the same field that has the mark bit. */
2749 XSETCONS (val
, cons_free_list
);
2750 cons_free_list
= cons_free_list
->u
.chain
;
2754 if (cons_block_index
== CONS_BLOCK_SIZE
)
2756 register struct cons_block
*new;
2757 new = (struct cons_block
*) lisp_align_malloc (sizeof *new,
2759 bzero ((char *) new->gcmarkbits
, sizeof new->gcmarkbits
);
2760 new->next
= cons_block
;
2762 cons_block_index
= 0;
2765 XSETCONS (val
, &cons_block
->conses
[cons_block_index
]);
2769 MALLOC_UNBLOCK_INPUT
;
2773 eassert (!CONS_MARKED_P (XCONS (val
)));
2774 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2775 cons_cells_consed
++;
2779 /* Get an error now if there's any junk in the cons free list. */
2783 #ifdef GC_CHECK_CONS_LIST
2784 struct Lisp_Cons
*tail
= cons_free_list
;
2787 tail
= tail
->u
.chain
;
2791 /* Make a list of 1, 2, 3, 4 or 5 specified objects. */
2797 return Fcons (arg1
, Qnil
);
2802 Lisp_Object arg1
, arg2
;
2804 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2809 list3 (arg1
, arg2
, arg3
)
2810 Lisp_Object arg1
, arg2
, arg3
;
2812 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2817 list4 (arg1
, arg2
, arg3
, arg4
)
2818 Lisp_Object arg1
, arg2
, arg3
, arg4
;
2820 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2825 list5 (arg1
, arg2
, arg3
, arg4
, arg5
)
2826 Lisp_Object arg1
, arg2
, arg3
, arg4
, arg5
;
2828 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2829 Fcons (arg5
, Qnil
)))));
2833 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
2834 doc
: /* Return a newly created list with specified arguments as elements.
2835 Any number of arguments, even zero arguments, are allowed.
2836 usage: (list &rest OBJECTS) */)
2839 register Lisp_Object
*args
;
2841 register Lisp_Object val
;
2847 val
= Fcons (args
[nargs
], val
);
2853 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2854 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2856 register Lisp_Object length
, init
;
2858 register Lisp_Object val
;
2861 CHECK_NATNUM (length
);
2862 size
= XFASTINT (length
);
2867 val
= Fcons (init
, val
);
2872 val
= Fcons (init
, val
);
2877 val
= Fcons (init
, val
);
2882 val
= Fcons (init
, val
);
2887 val
= Fcons (init
, val
);
2902 /***********************************************************************
2904 ***********************************************************************/
2906 /* Singly-linked list of all vectors. */
2908 static struct Lisp_Vector
*all_vectors
;
2910 /* Total number of vector-like objects now in use. */
2912 static int n_vectors
;
2915 /* Value is a pointer to a newly allocated Lisp_Vector structure
2916 with room for LEN Lisp_Objects. */
2918 static struct Lisp_Vector
*
2919 allocate_vectorlike (len
)
2922 struct Lisp_Vector
*p
;
2927 #ifdef DOUG_LEA_MALLOC
2928 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
2929 because mapped region contents are not preserved in
2931 mallopt (M_MMAP_MAX
, 0);
2934 /* This gets triggered by code which I haven't bothered to fix. --Stef */
2935 /* eassert (!handling_signal); */
2937 nbytes
= sizeof *p
+ (len
- 1) * sizeof p
->contents
[0];
2938 p
= (struct Lisp_Vector
*) lisp_malloc (nbytes
, MEM_TYPE_VECTORLIKE
);
2940 #ifdef DOUG_LEA_MALLOC
2941 /* Back to a reasonable maximum of mmap'ed areas. */
2942 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2945 consing_since_gc
+= nbytes
;
2946 vector_cells_consed
+= len
;
2948 p
->next
= all_vectors
;
2951 MALLOC_UNBLOCK_INPUT
;
2958 /* Allocate a vector with NSLOTS slots. */
2960 struct Lisp_Vector
*
2961 allocate_vector (nslots
)
2964 struct Lisp_Vector
*v
= allocate_vectorlike (nslots
);
2970 /* Allocate other vector-like structures. */
2972 struct Lisp_Vector
*
2973 allocate_pseudovector (memlen
, lisplen
, tag
)
2974 int memlen
, lisplen
;
2977 struct Lisp_Vector
*v
= allocate_vectorlike (memlen
);
2980 /* Only the first lisplen slots will be traced normally by the GC. */
2982 for (i
= 0; i
< lisplen
; ++i
)
2983 v
->contents
[i
] = Qnil
;
2985 XSETPVECTYPE (v
, tag
); /* Add the appropriate tag. */
2989 struct Lisp_Hash_Table
*
2990 allocate_hash_table (void)
2992 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Hash_Table
, count
, PVEC_HASH_TABLE
);
2999 return ALLOCATE_PSEUDOVECTOR(struct window
, current_matrix
, PVEC_WINDOW
);
3004 allocate_terminal ()
3006 struct terminal
*t
= ALLOCATE_PSEUDOVECTOR (struct terminal
,
3007 next_terminal
, PVEC_TERMINAL
);
3008 /* Zero out the non-GC'd fields. FIXME: This should be made unnecessary. */
3009 bzero (&(t
->next_terminal
),
3010 ((char*)(t
+1)) - ((char*)&(t
->next_terminal
)));
3018 struct frame
*f
= ALLOCATE_PSEUDOVECTOR (struct frame
,
3019 face_cache
, PVEC_FRAME
);
3020 /* Zero out the non-GC'd fields. FIXME: This should be made unnecessary. */
3021 bzero (&(f
->face_cache
),
3022 ((char*)(f
+1)) - ((char*)&(f
->face_cache
)));
3027 struct Lisp_Process
*
3030 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Process
, pid
, PVEC_PROCESS
);
3034 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
3035 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
3036 See also the function `vector'. */)
3038 register Lisp_Object length
, init
;
3041 register EMACS_INT sizei
;
3043 register struct Lisp_Vector
*p
;
3045 CHECK_NATNUM (length
);
3046 sizei
= XFASTINT (length
);
3048 p
= allocate_vector (sizei
);
3049 for (index
= 0; index
< sizei
; index
++)
3050 p
->contents
[index
] = init
;
3052 XSETVECTOR (vector
, p
);
3057 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
3058 doc
: /* Return a newly created vector with specified arguments as elements.
3059 Any number of arguments, even zero arguments, are allowed.
3060 usage: (vector &rest OBJECTS) */)
3065 register Lisp_Object len
, val
;
3067 register struct Lisp_Vector
*p
;
3069 XSETFASTINT (len
, nargs
);
3070 val
= Fmake_vector (len
, Qnil
);
3072 for (index
= 0; index
< nargs
; index
++)
3073 p
->contents
[index
] = args
[index
];
3078 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
3079 doc
: /* Create a byte-code object with specified arguments as elements.
3080 The arguments should be the arglist, bytecode-string, constant vector,
3081 stack size, (optional) doc string, and (optional) interactive spec.
3082 The first four arguments are required; at most six have any
3084 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
3089 register Lisp_Object len
, val
;
3091 register struct Lisp_Vector
*p
;
3093 XSETFASTINT (len
, nargs
);
3094 if (!NILP (Vpurify_flag
))
3095 val
= make_pure_vector ((EMACS_INT
) nargs
);
3097 val
= Fmake_vector (len
, Qnil
);
3099 if (STRINGP (args
[1]) && STRING_MULTIBYTE (args
[1]))
3100 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
3101 earlier because they produced a raw 8-bit string for byte-code
3102 and now such a byte-code string is loaded as multibyte while
3103 raw 8-bit characters converted to multibyte form. Thus, now we
3104 must convert them back to the original unibyte form. */
3105 args
[1] = Fstring_as_unibyte (args
[1]);
3108 for (index
= 0; index
< nargs
; index
++)
3110 if (!NILP (Vpurify_flag
))
3111 args
[index
] = Fpurecopy (args
[index
]);
3112 p
->contents
[index
] = args
[index
];
3114 XSETPVECTYPE (p
, PVEC_COMPILED
);
3115 XSETCOMPILED (val
, p
);
3121 /***********************************************************************
3123 ***********************************************************************/
3125 /* Each symbol_block is just under 1020 bytes long, since malloc
3126 really allocates in units of powers of two and uses 4 bytes for its
3129 #define SYMBOL_BLOCK_SIZE \
3130 ((1020 - sizeof (struct symbol_block *)) / sizeof (struct Lisp_Symbol))
3134 /* Place `symbols' first, to preserve alignment. */
3135 struct Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
3136 struct symbol_block
*next
;
3139 /* Current symbol block and index of first unused Lisp_Symbol
3142 static struct symbol_block
*symbol_block
;
3143 static int symbol_block_index
;
3145 /* List of free symbols. */
3147 static struct Lisp_Symbol
*symbol_free_list
;
3149 /* Total number of symbol blocks now in use. */
3151 static int n_symbol_blocks
;
3154 /* Initialize symbol allocation. */
3159 symbol_block
= NULL
;
3160 symbol_block_index
= SYMBOL_BLOCK_SIZE
;
3161 symbol_free_list
= 0;
3162 n_symbol_blocks
= 0;
3166 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
3167 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
3168 Its value and function definition are void, and its property list is nil. */)
3172 register Lisp_Object val
;
3173 register struct Lisp_Symbol
*p
;
3175 CHECK_STRING (name
);
3177 /* eassert (!handling_signal); */
3181 if (symbol_free_list
)
3183 XSETSYMBOL (val
, symbol_free_list
);
3184 symbol_free_list
= symbol_free_list
->next
;
3188 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
3190 struct symbol_block
*new;
3191 new = (struct symbol_block
*) lisp_malloc (sizeof *new,
3193 new->next
= symbol_block
;
3195 symbol_block_index
= 0;
3198 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
]);
3199 symbol_block_index
++;
3202 MALLOC_UNBLOCK_INPUT
;
3207 p
->value
= Qunbound
;
3208 p
->function
= Qunbound
;
3211 p
->interned
= SYMBOL_UNINTERNED
;
3213 p
->indirect_variable
= 0;
3214 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
3221 /***********************************************************************
3222 Marker (Misc) Allocation
3223 ***********************************************************************/
3225 /* Allocation of markers and other objects that share that structure.
3226 Works like allocation of conses. */
3228 #define MARKER_BLOCK_SIZE \
3229 ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc))
3233 /* Place `markers' first, to preserve alignment. */
3234 union Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
3235 struct marker_block
*next
;
3238 static struct marker_block
*marker_block
;
3239 static int marker_block_index
;
3241 static union Lisp_Misc
*marker_free_list
;
3243 /* Total number of marker blocks now in use. */
3245 static int n_marker_blocks
;
3250 marker_block
= NULL
;
3251 marker_block_index
= MARKER_BLOCK_SIZE
;
3252 marker_free_list
= 0;
3253 n_marker_blocks
= 0;
3256 /* Return a newly allocated Lisp_Misc object, with no substructure. */
3263 /* eassert (!handling_signal); */
3267 if (marker_free_list
)
3269 XSETMISC (val
, marker_free_list
);
3270 marker_free_list
= marker_free_list
->u_free
.chain
;
3274 if (marker_block_index
== MARKER_BLOCK_SIZE
)
3276 struct marker_block
*new;
3277 new = (struct marker_block
*) lisp_malloc (sizeof *new,
3279 new->next
= marker_block
;
3281 marker_block_index
= 0;
3283 total_free_markers
+= MARKER_BLOCK_SIZE
;
3285 XSETMISC (val
, &marker_block
->markers
[marker_block_index
]);
3286 marker_block_index
++;
3289 MALLOC_UNBLOCK_INPUT
;
3291 --total_free_markers
;
3292 consing_since_gc
+= sizeof (union Lisp_Misc
);
3293 misc_objects_consed
++;
3294 XMISCANY (val
)->gcmarkbit
= 0;
3298 /* Free a Lisp_Misc object */
3304 XMISCTYPE (misc
) = Lisp_Misc_Free
;
3305 XMISC (misc
)->u_free
.chain
= marker_free_list
;
3306 marker_free_list
= XMISC (misc
);
3308 total_free_markers
++;
3311 /* Return a Lisp_Misc_Save_Value object containing POINTER and
3312 INTEGER. This is used to package C values to call record_unwind_protect.
3313 The unwind function can get the C values back using XSAVE_VALUE. */
3316 make_save_value (pointer
, integer
)
3320 register Lisp_Object val
;
3321 register struct Lisp_Save_Value
*p
;
3323 val
= allocate_misc ();
3324 XMISCTYPE (val
) = Lisp_Misc_Save_Value
;
3325 p
= XSAVE_VALUE (val
);
3326 p
->pointer
= pointer
;
3327 p
->integer
= integer
;
3332 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
3333 doc
: /* Return a newly allocated marker which does not point at any place. */)
3336 register Lisp_Object val
;
3337 register struct Lisp_Marker
*p
;
3339 val
= allocate_misc ();
3340 XMISCTYPE (val
) = Lisp_Misc_Marker
;
3346 p
->insertion_type
= 0;
3350 /* Put MARKER back on the free list after using it temporarily. */
3353 free_marker (marker
)
3356 unchain_marker (XMARKER (marker
));
3361 /* Return a newly created vector or string with specified arguments as
3362 elements. If all the arguments are characters that can fit
3363 in a string of events, make a string; otherwise, make a vector.
3365 Any number of arguments, even zero arguments, are allowed. */
3368 make_event_array (nargs
, args
)
3374 for (i
= 0; i
< nargs
; i
++)
3375 /* The things that fit in a string
3376 are characters that are in 0...127,
3377 after discarding the meta bit and all the bits above it. */
3378 if (!INTEGERP (args
[i
])
3379 || (XUINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
3380 return Fvector (nargs
, args
);
3382 /* Since the loop exited, we know that all the things in it are
3383 characters, so we can make a string. */
3387 result
= Fmake_string (make_number (nargs
), make_number (0));
3388 for (i
= 0; i
< nargs
; i
++)
3390 SSET (result
, i
, XINT (args
[i
]));
3391 /* Move the meta bit to the right place for a string char. */
3392 if (XINT (args
[i
]) & CHAR_META
)
3393 SSET (result
, i
, SREF (result
, i
) | 0x80);
3402 /************************************************************************
3403 Memory Full Handling
3404 ************************************************************************/
3407 /* Called if malloc returns zero. */
3416 memory_full_cons_threshold
= sizeof (struct cons_block
);
3418 /* The first time we get here, free the spare memory. */
3419 for (i
= 0; i
< sizeof (spare_memory
) / sizeof (char *); i
++)
3420 if (spare_memory
[i
])
3423 free (spare_memory
[i
]);
3424 else if (i
>= 1 && i
<= 4)
3425 lisp_align_free (spare_memory
[i
]);
3427 lisp_free (spare_memory
[i
]);
3428 spare_memory
[i
] = 0;
3431 /* Record the space now used. When it decreases substantially,
3432 we can refill the memory reserve. */
3433 #ifndef SYSTEM_MALLOC
3434 bytes_used_when_full
= BYTES_USED
;
3437 /* This used to call error, but if we've run out of memory, we could
3438 get infinite recursion trying to build the string. */
3439 xsignal (Qnil
, Vmemory_signal_data
);
3442 /* If we released our reserve (due to running out of memory),
3443 and we have a fair amount free once again,
3444 try to set aside another reserve in case we run out once more.
3446 This is called when a relocatable block is freed in ralloc.c,
3447 and also directly from this file, in case we're not using ralloc.c. */
3450 refill_memory_reserve ()
3452 #ifndef SYSTEM_MALLOC
3453 if (spare_memory
[0] == 0)
3454 spare_memory
[0] = (char *) malloc ((size_t) SPARE_MEMORY
);
3455 if (spare_memory
[1] == 0)
3456 spare_memory
[1] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3458 if (spare_memory
[2] == 0)
3459 spare_memory
[2] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3461 if (spare_memory
[3] == 0)
3462 spare_memory
[3] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3464 if (spare_memory
[4] == 0)
3465 spare_memory
[4] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3467 if (spare_memory
[5] == 0)
3468 spare_memory
[5] = (char *) lisp_malloc (sizeof (struct string_block
),
3470 if (spare_memory
[6] == 0)
3471 spare_memory
[6] = (char *) lisp_malloc (sizeof (struct string_block
),
3473 if (spare_memory
[0] && spare_memory
[1] && spare_memory
[5])
3474 Vmemory_full
= Qnil
;
3478 /************************************************************************
3480 ************************************************************************/
3482 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
3484 /* Conservative C stack marking requires a method to identify possibly
3485 live Lisp objects given a pointer value. We do this by keeping
3486 track of blocks of Lisp data that are allocated in a red-black tree
3487 (see also the comment of mem_node which is the type of nodes in
3488 that tree). Function lisp_malloc adds information for an allocated
3489 block to the red-black tree with calls to mem_insert, and function
3490 lisp_free removes it with mem_delete. Functions live_string_p etc
3491 call mem_find to lookup information about a given pointer in the
3492 tree, and use that to determine if the pointer points to a Lisp
3495 /* Initialize this part of alloc.c. */
3500 mem_z
.left
= mem_z
.right
= MEM_NIL
;
3501 mem_z
.parent
= NULL
;
3502 mem_z
.color
= MEM_BLACK
;
3503 mem_z
.start
= mem_z
.end
= NULL
;
3508 /* Value is a pointer to the mem_node containing START. Value is
3509 MEM_NIL if there is no node in the tree containing START. */
3511 static INLINE
struct mem_node
*
3517 if (start
< min_heap_address
|| start
> max_heap_address
)
3520 /* Make the search always successful to speed up the loop below. */
3521 mem_z
.start
= start
;
3522 mem_z
.end
= (char *) start
+ 1;
3525 while (start
< p
->start
|| start
>= p
->end
)
3526 p
= start
< p
->start
? p
->left
: p
->right
;
3531 /* Insert a new node into the tree for a block of memory with start
3532 address START, end address END, and type TYPE. Value is a
3533 pointer to the node that was inserted. */
3535 static struct mem_node
*
3536 mem_insert (start
, end
, type
)
3540 struct mem_node
*c
, *parent
, *x
;
3542 if (min_heap_address
== NULL
|| start
< min_heap_address
)
3543 min_heap_address
= start
;
3544 if (max_heap_address
== NULL
|| end
> max_heap_address
)
3545 max_heap_address
= end
;
3547 /* See where in the tree a node for START belongs. In this
3548 particular application, it shouldn't happen that a node is already
3549 present. For debugging purposes, let's check that. */
3553 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3555 while (c
!= MEM_NIL
)
3557 if (start
>= c
->start
&& start
< c
->end
)
3560 c
= start
< c
->start
? c
->left
: c
->right
;
3563 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3565 while (c
!= MEM_NIL
)
3568 c
= start
< c
->start
? c
->left
: c
->right
;
3571 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3573 /* Create a new node. */
3574 #ifdef GC_MALLOC_CHECK
3575 x
= (struct mem_node
*) _malloc_internal (sizeof *x
);
3579 x
= (struct mem_node
*) xmalloc (sizeof *x
);
3585 x
->left
= x
->right
= MEM_NIL
;
3588 /* Insert it as child of PARENT or install it as root. */
3591 if (start
< parent
->start
)
3599 /* Re-establish red-black tree properties. */
3600 mem_insert_fixup (x
);
3606 /* Re-establish the red-black properties of the tree, and thereby
3607 balance the tree, after node X has been inserted; X is always red. */
3610 mem_insert_fixup (x
)
3613 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3615 /* X is red and its parent is red. This is a violation of
3616 red-black tree property #3. */
3618 if (x
->parent
== x
->parent
->parent
->left
)
3620 /* We're on the left side of our grandparent, and Y is our
3622 struct mem_node
*y
= x
->parent
->parent
->right
;
3624 if (y
->color
== MEM_RED
)
3626 /* Uncle and parent are red but should be black because
3627 X is red. Change the colors accordingly and proceed
3628 with the grandparent. */
3629 x
->parent
->color
= MEM_BLACK
;
3630 y
->color
= MEM_BLACK
;
3631 x
->parent
->parent
->color
= MEM_RED
;
3632 x
= x
->parent
->parent
;
3636 /* Parent and uncle have different colors; parent is
3637 red, uncle is black. */
3638 if (x
== x
->parent
->right
)
3641 mem_rotate_left (x
);
3644 x
->parent
->color
= MEM_BLACK
;
3645 x
->parent
->parent
->color
= MEM_RED
;
3646 mem_rotate_right (x
->parent
->parent
);
3651 /* This is the symmetrical case of above. */
3652 struct mem_node
*y
= x
->parent
->parent
->left
;
3654 if (y
->color
== MEM_RED
)
3656 x
->parent
->color
= MEM_BLACK
;
3657 y
->color
= MEM_BLACK
;
3658 x
->parent
->parent
->color
= MEM_RED
;
3659 x
= x
->parent
->parent
;
3663 if (x
== x
->parent
->left
)
3666 mem_rotate_right (x
);
3669 x
->parent
->color
= MEM_BLACK
;
3670 x
->parent
->parent
->color
= MEM_RED
;
3671 mem_rotate_left (x
->parent
->parent
);
3676 /* The root may have been changed to red due to the algorithm. Set
3677 it to black so that property #5 is satisfied. */
3678 mem_root
->color
= MEM_BLACK
;
3694 /* Turn y's left sub-tree into x's right sub-tree. */
3697 if (y
->left
!= MEM_NIL
)
3698 y
->left
->parent
= x
;
3700 /* Y's parent was x's parent. */
3702 y
->parent
= x
->parent
;
3704 /* Get the parent to point to y instead of x. */
3707 if (x
== x
->parent
->left
)
3708 x
->parent
->left
= y
;
3710 x
->parent
->right
= y
;
3715 /* Put x on y's left. */
3729 mem_rotate_right (x
)
3732 struct mem_node
*y
= x
->left
;
3735 if (y
->right
!= MEM_NIL
)
3736 y
->right
->parent
= x
;
3739 y
->parent
= x
->parent
;
3742 if (x
== x
->parent
->right
)
3743 x
->parent
->right
= y
;
3745 x
->parent
->left
= y
;
3756 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
3762 struct mem_node
*x
, *y
;
3764 if (!z
|| z
== MEM_NIL
)
3767 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
3772 while (y
->left
!= MEM_NIL
)
3776 if (y
->left
!= MEM_NIL
)
3781 x
->parent
= y
->parent
;
3784 if (y
== y
->parent
->left
)
3785 y
->parent
->left
= x
;
3787 y
->parent
->right
= x
;
3794 z
->start
= y
->start
;
3799 if (y
->color
== MEM_BLACK
)
3800 mem_delete_fixup (x
);
3802 #ifdef GC_MALLOC_CHECK
3810 /* Re-establish the red-black properties of the tree, after a
3814 mem_delete_fixup (x
)
3817 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
3819 if (x
== x
->parent
->left
)
3821 struct mem_node
*w
= x
->parent
->right
;
3823 if (w
->color
== MEM_RED
)
3825 w
->color
= MEM_BLACK
;
3826 x
->parent
->color
= MEM_RED
;
3827 mem_rotate_left (x
->parent
);
3828 w
= x
->parent
->right
;
3831 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
3838 if (w
->right
->color
== MEM_BLACK
)
3840 w
->left
->color
= MEM_BLACK
;
3842 mem_rotate_right (w
);
3843 w
= x
->parent
->right
;
3845 w
->color
= x
->parent
->color
;
3846 x
->parent
->color
= MEM_BLACK
;
3847 w
->right
->color
= MEM_BLACK
;
3848 mem_rotate_left (x
->parent
);
3854 struct mem_node
*w
= x
->parent
->left
;
3856 if (w
->color
== MEM_RED
)
3858 w
->color
= MEM_BLACK
;
3859 x
->parent
->color
= MEM_RED
;
3860 mem_rotate_right (x
->parent
);
3861 w
= x
->parent
->left
;
3864 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
3871 if (w
->left
->color
== MEM_BLACK
)
3873 w
->right
->color
= MEM_BLACK
;
3875 mem_rotate_left (w
);
3876 w
= x
->parent
->left
;
3879 w
->color
= x
->parent
->color
;
3880 x
->parent
->color
= MEM_BLACK
;
3881 w
->left
->color
= MEM_BLACK
;
3882 mem_rotate_right (x
->parent
);
3888 x
->color
= MEM_BLACK
;
3892 /* Value is non-zero if P is a pointer to a live Lisp string on
3893 the heap. M is a pointer to the mem_block for P. */
3896 live_string_p (m
, p
)
3900 if (m
->type
== MEM_TYPE_STRING
)
3902 struct string_block
*b
= (struct string_block
*) m
->start
;
3903 int offset
= (char *) p
- (char *) &b
->strings
[0];
3905 /* P must point to the start of a Lisp_String structure, and it
3906 must not be on the free-list. */
3908 && offset
% sizeof b
->strings
[0] == 0
3909 && offset
< (STRING_BLOCK_SIZE
* sizeof b
->strings
[0])
3910 && ((struct Lisp_String
*) p
)->data
!= NULL
);
3917 /* Value is non-zero if P is a pointer to a live Lisp cons on
3918 the heap. M is a pointer to the mem_block for P. */
3925 if (m
->type
== MEM_TYPE_CONS
)
3927 struct cons_block
*b
= (struct cons_block
*) m
->start
;
3928 int offset
= (char *) p
- (char *) &b
->conses
[0];
3930 /* P must point to the start of a Lisp_Cons, not be
3931 one of the unused cells in the current cons block,
3932 and not be on the free-list. */
3934 && offset
% sizeof b
->conses
[0] == 0
3935 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
3937 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
3938 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
3945 /* Value is non-zero if P is a pointer to a live Lisp symbol on
3946 the heap. M is a pointer to the mem_block for P. */
3949 live_symbol_p (m
, p
)
3953 if (m
->type
== MEM_TYPE_SYMBOL
)
3955 struct symbol_block
*b
= (struct symbol_block
*) m
->start
;
3956 int offset
= (char *) p
- (char *) &b
->symbols
[0];
3958 /* P must point to the start of a Lisp_Symbol, not be
3959 one of the unused cells in the current symbol block,
3960 and not be on the free-list. */
3962 && offset
% sizeof b
->symbols
[0] == 0
3963 && offset
< (SYMBOL_BLOCK_SIZE
* sizeof b
->symbols
[0])
3964 && (b
!= symbol_block
3965 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
3966 && !EQ (((struct Lisp_Symbol
*) p
)->function
, Vdead
));
3973 /* Value is non-zero if P is a pointer to a live Lisp float on
3974 the heap. M is a pointer to the mem_block for P. */
3981 if (m
->type
== MEM_TYPE_FLOAT
)
3983 struct float_block
*b
= (struct float_block
*) m
->start
;
3984 int offset
= (char *) p
- (char *) &b
->floats
[0];
3986 /* P must point to the start of a Lisp_Float and not be
3987 one of the unused cells in the current float block. */
3989 && offset
% sizeof b
->floats
[0] == 0
3990 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
3991 && (b
!= float_block
3992 || offset
/ sizeof b
->floats
[0] < float_block_index
));
3999 /* Value is non-zero if P is a pointer to a live Lisp Misc on
4000 the heap. M is a pointer to the mem_block for P. */
4007 if (m
->type
== MEM_TYPE_MISC
)
4009 struct marker_block
*b
= (struct marker_block
*) m
->start
;
4010 int offset
= (char *) p
- (char *) &b
->markers
[0];
4012 /* P must point to the start of a Lisp_Misc, not be
4013 one of the unused cells in the current misc block,
4014 and not be on the free-list. */
4016 && offset
% sizeof b
->markers
[0] == 0
4017 && offset
< (MARKER_BLOCK_SIZE
* sizeof b
->markers
[0])
4018 && (b
!= marker_block
4019 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
4020 && ((union Lisp_Misc
*) p
)->u_any
.type
!= Lisp_Misc_Free
);
4027 /* Value is non-zero if P is a pointer to a live vector-like object.
4028 M is a pointer to the mem_block for P. */
4031 live_vector_p (m
, p
)
4035 return (p
== m
->start
&& m
->type
== MEM_TYPE_VECTORLIKE
);
4039 /* Value is non-zero if P is a pointer to a live buffer. M is a
4040 pointer to the mem_block for P. */
4043 live_buffer_p (m
, p
)
4047 /* P must point to the start of the block, and the buffer
4048 must not have been killed. */
4049 return (m
->type
== MEM_TYPE_BUFFER
4051 && !NILP (((struct buffer
*) p
)->name
));
4054 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
4058 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4060 /* Array of objects that are kept alive because the C stack contains
4061 a pattern that looks like a reference to them . */
4063 #define MAX_ZOMBIES 10
4064 static Lisp_Object zombies
[MAX_ZOMBIES
];
4066 /* Number of zombie objects. */
4068 static int nzombies
;
4070 /* Number of garbage collections. */
4074 /* Average percentage of zombies per collection. */
4076 static double avg_zombies
;
4078 /* Max. number of live and zombie objects. */
4080 static int max_live
, max_zombies
;
4082 /* Average number of live objects per GC. */
4084 static double avg_live
;
4086 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
4087 doc
: /* Show information about live and zombie objects. */)
4090 Lisp_Object args
[8], zombie_list
= Qnil
;
4092 for (i
= 0; i
< nzombies
; i
++)
4093 zombie_list
= Fcons (zombies
[i
], zombie_list
);
4094 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
4095 args
[1] = make_number (ngcs
);
4096 args
[2] = make_float (avg_live
);
4097 args
[3] = make_float (avg_zombies
);
4098 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
4099 args
[5] = make_number (max_live
);
4100 args
[6] = make_number (max_zombies
);
4101 args
[7] = zombie_list
;
4102 return Fmessage (8, args
);
4105 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4108 /* Mark OBJ if we can prove it's a Lisp_Object. */
4111 mark_maybe_object (obj
)
4114 void *po
= (void *) XPNTR (obj
);
4115 struct mem_node
*m
= mem_find (po
);
4121 switch (XTYPE (obj
))
4124 mark_p
= (live_string_p (m
, po
)
4125 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
4129 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
4133 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
4137 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
4140 case Lisp_Vectorlike
:
4141 /* Note: can't check BUFFERP before we know it's a
4142 buffer because checking that dereferences the pointer
4143 PO which might point anywhere. */
4144 if (live_vector_p (m
, po
))
4145 mark_p
= !SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
4146 else if (live_buffer_p (m
, po
))
4147 mark_p
= BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
4151 mark_p
= (live_misc_p (m
, po
) && !XMISCANY (obj
)->gcmarkbit
);
4155 case Lisp_Type_Limit
:
4161 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4162 if (nzombies
< MAX_ZOMBIES
)
4163 zombies
[nzombies
] = obj
;
4172 /* If P points to Lisp data, mark that as live if it isn't already
4176 mark_maybe_pointer (p
)
4181 /* Quickly rule out some values which can't point to Lisp data. */
4184 8 /* USE_LSB_TAG needs Lisp data to be aligned on multiples of 8. */
4186 2 /* We assume that Lisp data is aligned on even addresses. */
4194 Lisp_Object obj
= Qnil
;
4198 case MEM_TYPE_NON_LISP
:
4199 /* Nothing to do; not a pointer to Lisp memory. */
4202 case MEM_TYPE_BUFFER
:
4203 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P((struct buffer
*)p
))
4204 XSETVECTOR (obj
, p
);
4208 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
4212 case MEM_TYPE_STRING
:
4213 if (live_string_p (m
, p
)
4214 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
4215 XSETSTRING (obj
, p
);
4219 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
4223 case MEM_TYPE_SYMBOL
:
4224 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
4225 XSETSYMBOL (obj
, p
);
4228 case MEM_TYPE_FLOAT
:
4229 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
4233 case MEM_TYPE_VECTORLIKE
:
4234 if (live_vector_p (m
, p
))
4237 XSETVECTOR (tem
, p
);
4238 if (!SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
4253 /* Mark Lisp objects referenced from the address range START+OFFSET..END
4254 or END+OFFSET..START. */
4257 mark_memory (start
, end
, offset
)
4264 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4268 /* Make START the pointer to the start of the memory region,
4269 if it isn't already. */
4277 /* Mark Lisp_Objects. */
4278 for (p
= (Lisp_Object
*) ((char *) start
+ offset
); (void *) p
< end
; ++p
)
4279 mark_maybe_object (*p
);
4281 /* Mark Lisp data pointed to. This is necessary because, in some
4282 situations, the C compiler optimizes Lisp objects away, so that
4283 only a pointer to them remains. Example:
4285 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
4288 Lisp_Object obj = build_string ("test");
4289 struct Lisp_String *s = XSTRING (obj);
4290 Fgarbage_collect ();
4291 fprintf (stderr, "test `%s'\n", s->data);
4295 Here, `obj' isn't really used, and the compiler optimizes it
4296 away. The only reference to the life string is through the
4299 for (pp
= (void **) ((char *) start
+ offset
); (void *) pp
< end
; ++pp
)
4300 mark_maybe_pointer (*pp
);
4303 /* setjmp will work with GCC unless NON_SAVING_SETJMP is defined in
4304 the GCC system configuration. In gcc 3.2, the only systems for
4305 which this is so are i386-sco5 non-ELF, i386-sysv3 (maybe included
4306 by others?) and ns32k-pc532-min. */
4308 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
4310 static int setjmp_tested_p
, longjmps_done
;
4312 #define SETJMP_WILL_LIKELY_WORK "\
4314 Emacs garbage collector has been changed to use conservative stack\n\
4315 marking. Emacs has determined that the method it uses to do the\n\
4316 marking will likely work on your system, but this isn't sure.\n\
4318 If you are a system-programmer, or can get the help of a local wizard\n\
4319 who is, please take a look at the function mark_stack in alloc.c, and\n\
4320 verify that the methods used are appropriate for your system.\n\
4322 Please mail the result to <emacs-devel@gnu.org>.\n\
4325 #define SETJMP_WILL_NOT_WORK "\
4327 Emacs garbage collector has been changed to use conservative stack\n\
4328 marking. Emacs has determined that the default method it uses to do the\n\
4329 marking will not work on your system. We will need a system-dependent\n\
4330 solution for your system.\n\
4332 Please take a look at the function mark_stack in alloc.c, and\n\
4333 try to find a way to make it work on your system.\n\
4335 Note that you may get false negatives, depending on the compiler.\n\
4336 In particular, you need to use -O with GCC for this test.\n\
4338 Please mail the result to <emacs-devel@gnu.org>.\n\
4342 /* Perform a quick check if it looks like setjmp saves registers in a
4343 jmp_buf. Print a message to stderr saying so. When this test
4344 succeeds, this is _not_ a proof that setjmp is sufficient for
4345 conservative stack marking. Only the sources or a disassembly
4356 /* Arrange for X to be put in a register. */
4362 if (longjmps_done
== 1)
4364 /* Came here after the longjmp at the end of the function.
4366 If x == 1, the longjmp has restored the register to its
4367 value before the setjmp, and we can hope that setjmp
4368 saves all such registers in the jmp_buf, although that
4371 For other values of X, either something really strange is
4372 taking place, or the setjmp just didn't save the register. */
4375 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
4378 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
4385 if (longjmps_done
== 1)
4389 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
4392 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4394 /* Abort if anything GCPRO'd doesn't survive the GC. */
4402 for (p
= gcprolist
; p
; p
= p
->next
)
4403 for (i
= 0; i
< p
->nvars
; ++i
)
4404 if (!survives_gc_p (p
->var
[i
]))
4405 /* FIXME: It's not necessarily a bug. It might just be that the
4406 GCPRO is unnecessary or should release the object sooner. */
4410 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4417 fprintf (stderr
, "\nZombies kept alive = %d:\n", nzombies
);
4418 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
4420 fprintf (stderr
, " %d = ", i
);
4421 debug_print (zombies
[i
]);
4425 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4428 /* Mark live Lisp objects on the C stack.
4430 There are several system-dependent problems to consider when
4431 porting this to new architectures:
4435 We have to mark Lisp objects in CPU registers that can hold local
4436 variables or are used to pass parameters.
4438 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
4439 something that either saves relevant registers on the stack, or
4440 calls mark_maybe_object passing it each register's contents.
4442 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
4443 implementation assumes that calling setjmp saves registers we need
4444 to see in a jmp_buf which itself lies on the stack. This doesn't
4445 have to be true! It must be verified for each system, possibly
4446 by taking a look at the source code of setjmp.
4450 Architectures differ in the way their processor stack is organized.
4451 For example, the stack might look like this
4454 | Lisp_Object | size = 4
4456 | something else | size = 2
4458 | Lisp_Object | size = 4
4462 In such a case, not every Lisp_Object will be aligned equally. To
4463 find all Lisp_Object on the stack it won't be sufficient to walk
4464 the stack in steps of 4 bytes. Instead, two passes will be
4465 necessary, one starting at the start of the stack, and a second
4466 pass starting at the start of the stack + 2. Likewise, if the
4467 minimal alignment of Lisp_Objects on the stack is 1, four passes
4468 would be necessary, each one starting with one byte more offset
4469 from the stack start.
4471 The current code assumes by default that Lisp_Objects are aligned
4472 equally on the stack. */
4478 /* jmp_buf may not be aligned enough on darwin-ppc64 */
4479 union aligned_jmpbuf
{
4483 volatile int stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
4486 /* This trick flushes the register windows so that all the state of
4487 the process is contained in the stack. */
4488 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
4489 needed on ia64 too. See mach_dep.c, where it also says inline
4490 assembler doesn't work with relevant proprietary compilers. */
4492 #if defined (__sparc64__) && defined (__FreeBSD__)
4493 /* FreeBSD does not have a ta 3 handler. */
4500 /* Save registers that we need to see on the stack. We need to see
4501 registers used to hold register variables and registers used to
4503 #ifdef GC_SAVE_REGISTERS_ON_STACK
4504 GC_SAVE_REGISTERS_ON_STACK (end
);
4505 #else /* not GC_SAVE_REGISTERS_ON_STACK */
4507 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
4508 setjmp will definitely work, test it
4509 and print a message with the result
4511 if (!setjmp_tested_p
)
4513 setjmp_tested_p
= 1;
4516 #endif /* GC_SETJMP_WORKS */
4519 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
4520 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
4522 /* This assumes that the stack is a contiguous region in memory. If
4523 that's not the case, something has to be done here to iterate
4524 over the stack segments. */
4525 #ifndef GC_LISP_OBJECT_ALIGNMENT
4527 #define GC_LISP_OBJECT_ALIGNMENT __alignof__ (Lisp_Object)
4529 #define GC_LISP_OBJECT_ALIGNMENT sizeof (Lisp_Object)
4532 for (i
= 0; i
< sizeof (Lisp_Object
); i
+= GC_LISP_OBJECT_ALIGNMENT
)
4533 mark_memory (stack_base
, end
, i
);
4534 /* Allow for marking a secondary stack, like the register stack on the
4536 #ifdef GC_MARK_SECONDARY_STACK
4537 GC_MARK_SECONDARY_STACK ();
4540 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4545 #endif /* GC_MARK_STACK != 0 */
4548 /* Determine whether it is safe to access memory at address P. */
4554 return w32_valid_pointer_p (p
, 16);
4558 /* Obviously, we cannot just access it (we would SEGV trying), so we
4559 trick the o/s to tell us whether p is a valid pointer.
4560 Unfortunately, we cannot use NULL_DEVICE here, as emacs_write may
4561 not validate p in that case. */
4563 if ((fd
= emacs_open ("__Valid__Lisp__Object__", O_CREAT
| O_WRONLY
| O_TRUNC
, 0666)) >= 0)
4565 int valid
= (emacs_write (fd
, (char *)p
, 16) == 16);
4567 unlink ("__Valid__Lisp__Object__");
4575 /* Return 1 if OBJ is a valid lisp object.
4576 Return 0 if OBJ is NOT a valid lisp object.
4577 Return -1 if we cannot validate OBJ.
4578 This function can be quite slow,
4579 so it should only be used in code for manual debugging. */
4582 valid_lisp_object_p (obj
)
4593 p
= (void *) XPNTR (obj
);
4594 if (PURE_POINTER_P (p
))
4598 return valid_pointer_p (p
);
4605 int valid
= valid_pointer_p (p
);
4617 case MEM_TYPE_NON_LISP
:
4620 case MEM_TYPE_BUFFER
:
4621 return live_buffer_p (m
, p
);
4624 return live_cons_p (m
, p
);
4626 case MEM_TYPE_STRING
:
4627 return live_string_p (m
, p
);
4630 return live_misc_p (m
, p
);
4632 case MEM_TYPE_SYMBOL
:
4633 return live_symbol_p (m
, p
);
4635 case MEM_TYPE_FLOAT
:
4636 return live_float_p (m
, p
);
4638 case MEM_TYPE_VECTORLIKE
:
4639 return live_vector_p (m
, p
);
4652 /***********************************************************************
4653 Pure Storage Management
4654 ***********************************************************************/
4656 /* Allocate room for SIZE bytes from pure Lisp storage and return a
4657 pointer to it. TYPE is the Lisp type for which the memory is
4658 allocated. TYPE < 0 means it's not used for a Lisp object. */
4660 static POINTER_TYPE
*
4661 pure_alloc (size
, type
)
4665 POINTER_TYPE
*result
;
4667 size_t alignment
= (1 << GCTYPEBITS
);
4669 size_t alignment
= sizeof (EMACS_INT
);
4671 /* Give Lisp_Floats an extra alignment. */
4672 if (type
== Lisp_Float
)
4674 #if defined __GNUC__ && __GNUC__ >= 2
4675 alignment
= __alignof (struct Lisp_Float
);
4677 alignment
= sizeof (struct Lisp_Float
);
4685 /* Allocate space for a Lisp object from the beginning of the free
4686 space with taking account of alignment. */
4687 result
= ALIGN (purebeg
+ pure_bytes_used_lisp
, alignment
);
4688 pure_bytes_used_lisp
= ((char *)result
- (char *)purebeg
) + size
;
4692 /* Allocate space for a non-Lisp object from the end of the free
4694 pure_bytes_used_non_lisp
+= size
;
4695 result
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4697 pure_bytes_used
= pure_bytes_used_lisp
+ pure_bytes_used_non_lisp
;
4699 if (pure_bytes_used
<= pure_size
)
4702 /* Don't allocate a large amount here,
4703 because it might get mmap'd and then its address
4704 might not be usable. */
4705 purebeg
= (char *) xmalloc (10000);
4707 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
4708 pure_bytes_used
= 0;
4709 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
4714 /* Print a warning if PURESIZE is too small. */
4719 if (pure_bytes_used_before_overflow
)
4720 message ("emacs:0:Pure Lisp storage overflow (approx. %d bytes needed)",
4721 (int) (pure_bytes_used
+ pure_bytes_used_before_overflow
));
4725 /* Find the byte sequence {DATA[0], ..., DATA[NBYTES-1], '\0'} from
4726 the non-Lisp data pool of the pure storage, and return its start
4727 address. Return NULL if not found. */
4730 find_string_data_in_pure (data
, nbytes
)
4734 int i
, skip
, bm_skip
[256], last_char_skip
, infinity
, start
, start_max
;
4738 if (pure_bytes_used_non_lisp
< nbytes
+ 1)
4741 /* Set up the Boyer-Moore table. */
4743 for (i
= 0; i
< 256; i
++)
4746 p
= (unsigned char *) data
;
4748 bm_skip
[*p
++] = skip
;
4750 last_char_skip
= bm_skip
['\0'];
4752 non_lisp_beg
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
4753 start_max
= pure_bytes_used_non_lisp
- (nbytes
+ 1);
4755 /* See the comments in the function `boyer_moore' (search.c) for the
4756 use of `infinity'. */
4757 infinity
= pure_bytes_used_non_lisp
+ 1;
4758 bm_skip
['\0'] = infinity
;
4760 p
= (unsigned char *) non_lisp_beg
+ nbytes
;
4764 /* Check the last character (== '\0'). */
4767 start
+= bm_skip
[*(p
+ start
)];
4769 while (start
<= start_max
);
4771 if (start
< infinity
)
4772 /* Couldn't find the last character. */
4775 /* No less than `infinity' means we could find the last
4776 character at `p[start - infinity]'. */
4779 /* Check the remaining characters. */
4780 if (memcmp (data
, non_lisp_beg
+ start
, nbytes
) == 0)
4782 return non_lisp_beg
+ start
;
4784 start
+= last_char_skip
;
4786 while (start
<= start_max
);
4792 /* Return a string allocated in pure space. DATA is a buffer holding
4793 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
4794 non-zero means make the result string multibyte.
4796 Must get an error if pure storage is full, since if it cannot hold
4797 a large string it may be able to hold conses that point to that
4798 string; then the string is not protected from gc. */
4801 make_pure_string (data
, nchars
, nbytes
, multibyte
)
4807 struct Lisp_String
*s
;
4809 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4810 s
->data
= find_string_data_in_pure (data
, nbytes
);
4811 if (s
->data
== NULL
)
4813 s
->data
= (unsigned char *) pure_alloc (nbytes
+ 1, -1);
4814 bcopy (data
, s
->data
, nbytes
);
4815 s
->data
[nbytes
] = '\0';
4818 s
->size_byte
= multibyte
? nbytes
: -1;
4819 s
->intervals
= NULL_INTERVAL
;
4820 XSETSTRING (string
, s
);
4824 /* Return a string a string allocated in pure space. Do not allocate
4825 the string data, just point to DATA. */
4828 make_pure_c_string (const char *data
)
4831 struct Lisp_String
*s
;
4832 int nchars
= strlen (data
);
4834 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
4838 s
->intervals
= NULL_INTERVAL
;
4839 XSETSTRING (string
, s
);
4843 /* Return a cons allocated from pure space. Give it pure copies
4844 of CAR as car and CDR as cdr. */
4847 pure_cons (car
, cdr
)
4848 Lisp_Object car
, cdr
;
4850 register Lisp_Object
new;
4851 struct Lisp_Cons
*p
;
4853 p
= (struct Lisp_Cons
*) pure_alloc (sizeof *p
, Lisp_Cons
);
4855 XSETCAR (new, Fpurecopy (car
));
4856 XSETCDR (new, Fpurecopy (cdr
));
4861 /* Value is a float object with value NUM allocated from pure space. */
4864 make_pure_float (num
)
4867 register Lisp_Object
new;
4868 struct Lisp_Float
*p
;
4870 p
= (struct Lisp_Float
*) pure_alloc (sizeof *p
, Lisp_Float
);
4872 XFLOAT_INIT (new, num
);
4877 /* Return a vector with room for LEN Lisp_Objects allocated from
4881 make_pure_vector (len
)
4885 struct Lisp_Vector
*p
;
4886 size_t size
= sizeof *p
+ (len
- 1) * sizeof (Lisp_Object
);
4888 p
= (struct Lisp_Vector
*) pure_alloc (size
, Lisp_Vectorlike
);
4889 XSETVECTOR (new, p
);
4890 XVECTOR (new)->size
= len
;
4895 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
4896 doc
: /* Make a copy of object OBJ in pure storage.
4897 Recursively copies contents of vectors and cons cells.
4898 Does not copy symbols. Copies strings without text properties. */)
4900 register Lisp_Object obj
;
4902 if (NILP (Vpurify_flag
))
4905 if (PURE_POINTER_P (XPNTR (obj
)))
4909 return pure_cons (XCAR (obj
), XCDR (obj
));
4910 else if (FLOATP (obj
))
4911 return make_pure_float (XFLOAT_DATA (obj
));
4912 else if (STRINGP (obj
))
4913 return make_pure_string (SDATA (obj
), SCHARS (obj
),
4915 STRING_MULTIBYTE (obj
));
4916 else if (COMPILEDP (obj
) || VECTORP (obj
))
4918 register struct Lisp_Vector
*vec
;
4922 size
= XVECTOR (obj
)->size
;
4923 if (size
& PSEUDOVECTOR_FLAG
)
4924 size
&= PSEUDOVECTOR_SIZE_MASK
;
4925 vec
= XVECTOR (make_pure_vector (size
));
4926 for (i
= 0; i
< size
; i
++)
4927 vec
->contents
[i
] = Fpurecopy (XVECTOR (obj
)->contents
[i
]);
4928 if (COMPILEDP (obj
))
4930 XSETPVECTYPE (vec
, PVEC_COMPILED
);
4931 XSETCOMPILED (obj
, vec
);
4934 XSETVECTOR (obj
, vec
);
4937 else if (MARKERP (obj
))
4938 error ("Attempt to copy a marker to pure storage");
4945 /***********************************************************************
4947 ***********************************************************************/
4949 /* Put an entry in staticvec, pointing at the variable with address
4953 staticpro (varaddress
)
4954 Lisp_Object
*varaddress
;
4956 staticvec
[staticidx
++] = varaddress
;
4957 if (staticidx
>= NSTATICS
)
4962 /***********************************************************************
4964 ***********************************************************************/
4966 /* Temporarily prevent garbage collection. */
4969 inhibit_garbage_collection ()
4971 int count
= SPECPDL_INDEX ();
4972 int nbits
= min (VALBITS
, BITS_PER_INT
);
4974 specbind (Qgc_cons_threshold
, make_number (((EMACS_INT
) 1 << (nbits
- 1)) - 1));
4979 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
4980 doc
: /* Reclaim storage for Lisp objects no longer needed.
4981 Garbage collection happens automatically if you cons more than
4982 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
4983 `garbage-collect' normally returns a list with info on amount of space in use:
4984 ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)
4985 (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS
4986 (USED-FLOATS . FREE-FLOATS) (USED-INTERVALS . FREE-INTERVALS)
4987 (USED-STRINGS . FREE-STRINGS))
4988 However, if there was overflow in pure space, `garbage-collect'
4989 returns nil, because real GC can't be done. */)
4992 register struct specbinding
*bind
;
4993 struct catchtag
*catch;
4994 struct handler
*handler
;
4995 char stack_top_variable
;
4998 Lisp_Object total
[8];
4999 int count
= SPECPDL_INDEX ();
5000 EMACS_TIME t1
, t2
, t3
;
5005 /* Can't GC if pure storage overflowed because we can't determine
5006 if something is a pure object or not. */
5007 if (pure_bytes_used_before_overflow
)
5012 /* Don't keep undo information around forever.
5013 Do this early on, so it is no problem if the user quits. */
5015 register struct buffer
*nextb
= all_buffers
;
5019 /* If a buffer's undo list is Qt, that means that undo is
5020 turned off in that buffer. Calling truncate_undo_list on
5021 Qt tends to return NULL, which effectively turns undo back on.
5022 So don't call truncate_undo_list if undo_list is Qt. */
5023 if (! NILP (nextb
->name
) && ! EQ (nextb
->undo_list
, Qt
))
5024 truncate_undo_list (nextb
);
5026 /* Shrink buffer gaps, but skip indirect and dead buffers. */
5027 if (nextb
->base_buffer
== 0 && !NILP (nextb
->name
)
5028 && ! nextb
->text
->inhibit_shrinking
)
5030 /* If a buffer's gap size is more than 10% of the buffer
5031 size, or larger than 2000 bytes, then shrink it
5032 accordingly. Keep a minimum size of 20 bytes. */
5033 int size
= min (2000, max (20, (nextb
->text
->z_byte
/ 10)));
5035 if (nextb
->text
->gap_size
> size
)
5037 struct buffer
*save_current
= current_buffer
;
5038 current_buffer
= nextb
;
5039 make_gap (-(nextb
->text
->gap_size
- size
));
5040 current_buffer
= save_current
;
5044 nextb
= nextb
->next
;
5048 EMACS_GET_TIME (t1
);
5050 /* In case user calls debug_print during GC,
5051 don't let that cause a recursive GC. */
5052 consing_since_gc
= 0;
5054 /* Save what's currently displayed in the echo area. */
5055 message_p
= push_message ();
5056 record_unwind_protect (pop_message_unwind
, Qnil
);
5058 /* Save a copy of the contents of the stack, for debugging. */
5059 #if MAX_SAVE_STACK > 0
5060 if (NILP (Vpurify_flag
))
5062 i
= &stack_top_variable
- stack_bottom
;
5064 if (i
< MAX_SAVE_STACK
)
5066 if (stack_copy
== 0)
5067 stack_copy
= (char *) xmalloc (stack_copy_size
= i
);
5068 else if (stack_copy_size
< i
)
5069 stack_copy
= (char *) xrealloc (stack_copy
, (stack_copy_size
= i
));
5072 if ((EMACS_INT
) (&stack_top_variable
- stack_bottom
) > 0)
5073 bcopy (stack_bottom
, stack_copy
, i
);
5075 bcopy (&stack_top_variable
, stack_copy
, i
);
5079 #endif /* MAX_SAVE_STACK > 0 */
5081 if (garbage_collection_messages
)
5082 message1_nolog ("Garbage collecting...");
5086 shrink_regexp_cache ();
5090 /* clear_marks (); */
5092 /* Mark all the special slots that serve as the roots of accessibility. */
5094 for (i
= 0; i
< staticidx
; i
++)
5095 mark_object (*staticvec
[i
]);
5097 for (bind
= specpdl
; bind
!= specpdl_ptr
; bind
++)
5099 mark_object (bind
->symbol
);
5100 mark_object (bind
->old_value
);
5108 extern void xg_mark_data ();
5113 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
5114 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
5118 register struct gcpro
*tail
;
5119 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
5120 for (i
= 0; i
< tail
->nvars
; i
++)
5121 mark_object (tail
->var
[i
]);
5126 for (catch = catchlist
; catch; catch = catch->next
)
5128 mark_object (catch->tag
);
5129 mark_object (catch->val
);
5131 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
5133 mark_object (handler
->handler
);
5134 mark_object (handler
->var
);
5138 #ifdef HAVE_WINDOW_SYSTEM
5139 mark_fringe_data ();
5142 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5146 /* Everything is now marked, except for the things that require special
5147 finalization, i.e. the undo_list.
5148 Look thru every buffer's undo list
5149 for elements that update markers that were not marked,
5152 register struct buffer
*nextb
= all_buffers
;
5156 /* If a buffer's undo list is Qt, that means that undo is
5157 turned off in that buffer. Calling truncate_undo_list on
5158 Qt tends to return NULL, which effectively turns undo back on.
5159 So don't call truncate_undo_list if undo_list is Qt. */
5160 if (! EQ (nextb
->undo_list
, Qt
))
5162 Lisp_Object tail
, prev
;
5163 tail
= nextb
->undo_list
;
5165 while (CONSP (tail
))
5167 if (CONSP (XCAR (tail
))
5168 && MARKERP (XCAR (XCAR (tail
)))
5169 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
5172 nextb
->undo_list
= tail
= XCDR (tail
);
5176 XSETCDR (prev
, tail
);
5186 /* Now that we have stripped the elements that need not be in the
5187 undo_list any more, we can finally mark the list. */
5188 mark_object (nextb
->undo_list
);
5190 nextb
= nextb
->next
;
5196 /* Clear the mark bits that we set in certain root slots. */
5198 unmark_byte_stack ();
5199 VECTOR_UNMARK (&buffer_defaults
);
5200 VECTOR_UNMARK (&buffer_local_symbols
);
5202 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
5210 /* clear_marks (); */
5213 consing_since_gc
= 0;
5214 if (gc_cons_threshold
< 10000)
5215 gc_cons_threshold
= 10000;
5217 if (FLOATP (Vgc_cons_percentage
))
5218 { /* Set gc_cons_combined_threshold. */
5219 EMACS_INT total
= 0;
5221 total
+= total_conses
* sizeof (struct Lisp_Cons
);
5222 total
+= total_symbols
* sizeof (struct Lisp_Symbol
);
5223 total
+= total_markers
* sizeof (union Lisp_Misc
);
5224 total
+= total_string_size
;
5225 total
+= total_vector_size
* sizeof (Lisp_Object
);
5226 total
+= total_floats
* sizeof (struct Lisp_Float
);
5227 total
+= total_intervals
* sizeof (struct interval
);
5228 total
+= total_strings
* sizeof (struct Lisp_String
);
5230 gc_relative_threshold
= total
* XFLOAT_DATA (Vgc_cons_percentage
);
5233 gc_relative_threshold
= 0;
5235 if (garbage_collection_messages
)
5237 if (message_p
|| minibuf_level
> 0)
5240 message1_nolog ("Garbage collecting...done");
5243 unbind_to (count
, Qnil
);
5245 total
[0] = Fcons (make_number (total_conses
),
5246 make_number (total_free_conses
));
5247 total
[1] = Fcons (make_number (total_symbols
),
5248 make_number (total_free_symbols
));
5249 total
[2] = Fcons (make_number (total_markers
),
5250 make_number (total_free_markers
));
5251 total
[3] = make_number (total_string_size
);
5252 total
[4] = make_number (total_vector_size
);
5253 total
[5] = Fcons (make_number (total_floats
),
5254 make_number (total_free_floats
));
5255 total
[6] = Fcons (make_number (total_intervals
),
5256 make_number (total_free_intervals
));
5257 total
[7] = Fcons (make_number (total_strings
),
5258 make_number (total_free_strings
));
5260 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5262 /* Compute average percentage of zombies. */
5265 for (i
= 0; i
< 7; ++i
)
5266 if (CONSP (total
[i
]))
5267 nlive
+= XFASTINT (XCAR (total
[i
]));
5269 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
5270 max_live
= max (nlive
, max_live
);
5271 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
5272 max_zombies
= max (nzombies
, max_zombies
);
5277 if (!NILP (Vpost_gc_hook
))
5279 int count
= inhibit_garbage_collection ();
5280 safe_run_hooks (Qpost_gc_hook
);
5281 unbind_to (count
, Qnil
);
5284 /* Accumulate statistics. */
5285 EMACS_GET_TIME (t2
);
5286 EMACS_SUB_TIME (t3
, t2
, t1
);
5287 if (FLOATP (Vgc_elapsed
))
5288 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
) +
5290 EMACS_USECS (t3
) * 1.0e-6);
5293 return Flist (sizeof total
/ sizeof *total
, total
);
5297 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
5298 only interesting objects referenced from glyphs are strings. */
5301 mark_glyph_matrix (matrix
)
5302 struct glyph_matrix
*matrix
;
5304 struct glyph_row
*row
= matrix
->rows
;
5305 struct glyph_row
*end
= row
+ matrix
->nrows
;
5307 for (; row
< end
; ++row
)
5311 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
5313 struct glyph
*glyph
= row
->glyphs
[area
];
5314 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
5316 for (; glyph
< end_glyph
; ++glyph
)
5317 if (STRINGP (glyph
->object
)
5318 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
5319 mark_object (glyph
->object
);
5325 /* Mark Lisp faces in the face cache C. */
5329 struct face_cache
*c
;
5334 for (i
= 0; i
< c
->used
; ++i
)
5336 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
5340 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
5341 mark_object (face
->lface
[j
]);
5349 /* Mark reference to a Lisp_Object.
5350 If the object referred to has not been seen yet, recursively mark
5351 all the references contained in it. */
5353 #define LAST_MARKED_SIZE 500
5354 static Lisp_Object last_marked
[LAST_MARKED_SIZE
];
5355 int last_marked_index
;
5357 /* For debugging--call abort when we cdr down this many
5358 links of a list, in mark_object. In debugging,
5359 the call to abort will hit a breakpoint.
5360 Normally this is zero and the check never goes off. */
5361 static int mark_object_loop_halt
;
5363 /* Return non-zero if the object was not yet marked. */
5365 mark_vectorlike (ptr
)
5366 struct Lisp_Vector
*ptr
;
5368 register EMACS_INT size
= ptr
->size
;
5371 if (VECTOR_MARKED_P (ptr
))
5372 return 0; /* Already marked */
5373 VECTOR_MARK (ptr
); /* Else mark it */
5374 if (size
& PSEUDOVECTOR_FLAG
)
5375 size
&= PSEUDOVECTOR_SIZE_MASK
;
5377 /* Note that this size is not the memory-footprint size, but only
5378 the number of Lisp_Object fields that we should trace.
5379 The distinction is used e.g. by Lisp_Process which places extra
5380 non-Lisp_Object fields at the end of the structure. */
5381 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5382 mark_object (ptr
->contents
[i
]);
5386 /* Like mark_vectorlike but optimized for char-tables (and
5387 sub-char-tables) assuming that the contents are mostly integers or
5391 mark_char_table (ptr
)
5392 struct Lisp_Vector
*ptr
;
5394 register EMACS_INT size
= ptr
->size
& PSEUDOVECTOR_SIZE_MASK
;
5398 for (i
= 0; i
< size
; i
++)
5400 Lisp_Object val
= ptr
->contents
[i
];
5402 if (INTEGERP (val
) || SYMBOLP (val
) && XSYMBOL (val
)->gcmarkbit
)
5404 if (SUB_CHAR_TABLE_P (val
))
5406 if (! VECTOR_MARKED_P (XVECTOR (val
)))
5407 mark_char_table (XVECTOR (val
));
5418 register Lisp_Object obj
= arg
;
5419 #ifdef GC_CHECK_MARKED_OBJECTS
5427 if (PURE_POINTER_P (XPNTR (obj
)))
5430 last_marked
[last_marked_index
++] = obj
;
5431 if (last_marked_index
== LAST_MARKED_SIZE
)
5432 last_marked_index
= 0;
5434 /* Perform some sanity checks on the objects marked here. Abort if
5435 we encounter an object we know is bogus. This increases GC time
5436 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
5437 #ifdef GC_CHECK_MARKED_OBJECTS
5439 po
= (void *) XPNTR (obj
);
5441 /* Check that the object pointed to by PO is known to be a Lisp
5442 structure allocated from the heap. */
5443 #define CHECK_ALLOCATED() \
5445 m = mem_find (po); \
5450 /* Check that the object pointed to by PO is live, using predicate
5452 #define CHECK_LIVE(LIVEP) \
5454 if (!LIVEP (m, po)) \
5458 /* Check both of the above conditions. */
5459 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
5461 CHECK_ALLOCATED (); \
5462 CHECK_LIVE (LIVEP); \
5465 #else /* not GC_CHECK_MARKED_OBJECTS */
5467 #define CHECK_ALLOCATED() (void) 0
5468 #define CHECK_LIVE(LIVEP) (void) 0
5469 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
5471 #endif /* not GC_CHECK_MARKED_OBJECTS */
5473 switch (SWITCH_ENUM_CAST (XTYPE (obj
)))
5477 register struct Lisp_String
*ptr
= XSTRING (obj
);
5478 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
5479 MARK_INTERVAL_TREE (ptr
->intervals
);
5481 #ifdef GC_CHECK_STRING_BYTES
5482 /* Check that the string size recorded in the string is the
5483 same as the one recorded in the sdata structure. */
5484 CHECK_STRING_BYTES (ptr
);
5485 #endif /* GC_CHECK_STRING_BYTES */
5489 case Lisp_Vectorlike
:
5490 #ifdef GC_CHECK_MARKED_OBJECTS
5492 if (m
== MEM_NIL
&& !SUBRP (obj
)
5493 && po
!= &buffer_defaults
5494 && po
!= &buffer_local_symbols
)
5496 #endif /* GC_CHECK_MARKED_OBJECTS */
5500 if (!VECTOR_MARKED_P (XBUFFER (obj
)))
5502 #ifdef GC_CHECK_MARKED_OBJECTS
5503 if (po
!= &buffer_defaults
&& po
!= &buffer_local_symbols
)
5506 for (b
= all_buffers
; b
&& b
!= po
; b
= b
->next
)
5511 #endif /* GC_CHECK_MARKED_OBJECTS */
5515 else if (SUBRP (obj
))
5517 else if (COMPILEDP (obj
))
5518 /* We could treat this just like a vector, but it is better to
5519 save the COMPILED_CONSTANTS element for last and avoid
5522 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5523 register EMACS_INT size
= ptr
->size
;
5526 if (VECTOR_MARKED_P (ptr
))
5527 break; /* Already marked */
5529 CHECK_LIVE (live_vector_p
);
5530 VECTOR_MARK (ptr
); /* Else mark it */
5531 size
&= PSEUDOVECTOR_SIZE_MASK
;
5532 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
5534 if (i
!= COMPILED_CONSTANTS
)
5535 mark_object (ptr
->contents
[i
]);
5537 obj
= ptr
->contents
[COMPILED_CONSTANTS
];
5540 else if (FRAMEP (obj
))
5542 register struct frame
*ptr
= XFRAME (obj
);
5543 if (mark_vectorlike (XVECTOR (obj
)))
5544 mark_face_cache (ptr
->face_cache
);
5546 else if (WINDOWP (obj
))
5548 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5549 struct window
*w
= XWINDOW (obj
);
5550 if (mark_vectorlike (ptr
))
5552 /* Mark glyphs for leaf windows. Marking window matrices is
5553 sufficient because frame matrices use the same glyph
5555 if (NILP (w
->hchild
)
5557 && w
->current_matrix
)
5559 mark_glyph_matrix (w
->current_matrix
);
5560 mark_glyph_matrix (w
->desired_matrix
);
5564 else if (HASH_TABLE_P (obj
))
5566 struct Lisp_Hash_Table
*h
= XHASH_TABLE (obj
);
5567 if (mark_vectorlike ((struct Lisp_Vector
*)h
))
5568 { /* If hash table is not weak, mark all keys and values.
5569 For weak tables, mark only the vector. */
5571 mark_object (h
->key_and_value
);
5573 VECTOR_MARK (XVECTOR (h
->key_and_value
));
5576 else if (CHAR_TABLE_P (obj
))
5578 if (! VECTOR_MARKED_P (XVECTOR (obj
)))
5579 mark_char_table (XVECTOR (obj
));
5582 mark_vectorlike (XVECTOR (obj
));
5587 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
5588 struct Lisp_Symbol
*ptrx
;
5590 if (ptr
->gcmarkbit
) break;
5591 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
5593 mark_object (ptr
->value
);
5594 mark_object (ptr
->function
);
5595 mark_object (ptr
->plist
);
5597 if (!PURE_POINTER_P (XSTRING (ptr
->xname
)))
5598 MARK_STRING (XSTRING (ptr
->xname
));
5599 MARK_INTERVAL_TREE (STRING_INTERVALS (ptr
->xname
));
5601 /* Note that we do not mark the obarray of the symbol.
5602 It is safe not to do so because nothing accesses that
5603 slot except to check whether it is nil. */
5607 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun */
5608 XSETSYMBOL (obj
, ptrx
);
5615 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
5616 if (XMISCANY (obj
)->gcmarkbit
)
5618 XMISCANY (obj
)->gcmarkbit
= 1;
5620 switch (XMISCTYPE (obj
))
5622 case Lisp_Misc_Buffer_Local_Value
:
5624 register struct Lisp_Buffer_Local_Value
*ptr
5625 = XBUFFER_LOCAL_VALUE (obj
);
5626 /* If the cdr is nil, avoid recursion for the car. */
5627 if (EQ (ptr
->cdr
, Qnil
))
5629 obj
= ptr
->realvalue
;
5632 mark_object (ptr
->realvalue
);
5633 mark_object (ptr
->buffer
);
5634 mark_object (ptr
->frame
);
5639 case Lisp_Misc_Marker
:
5640 /* DO NOT mark thru the marker's chain.
5641 The buffer's markers chain does not preserve markers from gc;
5642 instead, markers are removed from the chain when freed by gc. */
5645 case Lisp_Misc_Intfwd
:
5646 case Lisp_Misc_Boolfwd
:
5647 case Lisp_Misc_Objfwd
:
5648 case Lisp_Misc_Buffer_Objfwd
:
5649 case Lisp_Misc_Kboard_Objfwd
:
5650 /* Don't bother with Lisp_Buffer_Objfwd,
5651 since all markable slots in current buffer marked anyway. */
5652 /* Don't need to do Lisp_Objfwd, since the places they point
5653 are protected with staticpro. */
5656 case Lisp_Misc_Save_Value
:
5659 register struct Lisp_Save_Value
*ptr
= XSAVE_VALUE (obj
);
5660 /* If DOGC is set, POINTER is the address of a memory
5661 area containing INTEGER potential Lisp_Objects. */
5664 Lisp_Object
*p
= (Lisp_Object
*) ptr
->pointer
;
5666 for (nelt
= ptr
->integer
; nelt
> 0; nelt
--, p
++)
5667 mark_maybe_object (*p
);
5673 case Lisp_Misc_Overlay
:
5675 struct Lisp_Overlay
*ptr
= XOVERLAY (obj
);
5676 mark_object (ptr
->start
);
5677 mark_object (ptr
->end
);
5678 mark_object (ptr
->plist
);
5681 XSETMISC (obj
, ptr
->next
);
5694 register struct Lisp_Cons
*ptr
= XCONS (obj
);
5695 if (CONS_MARKED_P (ptr
)) break;
5696 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
5698 /* If the cdr is nil, avoid recursion for the car. */
5699 if (EQ (ptr
->u
.cdr
, Qnil
))
5705 mark_object (ptr
->car
);
5708 if (cdr_count
== mark_object_loop_halt
)
5714 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
5715 FLOAT_MARK (XFLOAT (obj
));
5726 #undef CHECK_ALLOCATED
5727 #undef CHECK_ALLOCATED_AND_LIVE
5730 /* Mark the pointers in a buffer structure. */
5736 register struct buffer
*buffer
= XBUFFER (buf
);
5737 register Lisp_Object
*ptr
, tmp
;
5738 Lisp_Object base_buffer
;
5740 VECTOR_MARK (buffer
);
5742 MARK_INTERVAL_TREE (BUF_INTERVALS (buffer
));
5744 /* For now, we just don't mark the undo_list. It's done later in
5745 a special way just before the sweep phase, and after stripping
5746 some of its elements that are not needed any more. */
5748 if (buffer
->overlays_before
)
5750 XSETMISC (tmp
, buffer
->overlays_before
);
5753 if (buffer
->overlays_after
)
5755 XSETMISC (tmp
, buffer
->overlays_after
);
5759 /* buffer-local Lisp variables start at `undo_list',
5760 tho only the ones from `name' on are GC'd normally. */
5761 for (ptr
= &buffer
->name
;
5762 (char *)ptr
< (char *)buffer
+ sizeof (struct buffer
);
5766 /* If this is an indirect buffer, mark its base buffer. */
5767 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
5769 XSETBUFFER (base_buffer
, buffer
->base_buffer
);
5770 mark_buffer (base_buffer
);
5774 /* Mark the Lisp pointers in the terminal objects.
5775 Called by the Fgarbage_collector. */
5778 mark_terminals (void)
5781 for (t
= terminal_list
; t
; t
= t
->next_terminal
)
5783 eassert (t
->name
!= NULL
);
5784 #ifdef HAVE_WINDOW_SYSTEM
5785 mark_image_cache (t
->image_cache
);
5786 #endif /* HAVE_WINDOW_SYSTEM */
5787 mark_vectorlike ((struct Lisp_Vector
*)t
);
5793 /* Value is non-zero if OBJ will survive the current GC because it's
5794 either marked or does not need to be marked to survive. */
5802 switch (XTYPE (obj
))
5809 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
5813 survives_p
= XMISCANY (obj
)->gcmarkbit
;
5817 survives_p
= STRING_MARKED_P (XSTRING (obj
));
5820 case Lisp_Vectorlike
:
5821 survives_p
= SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
5825 survives_p
= CONS_MARKED_P (XCONS (obj
));
5829 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
5836 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
5841 /* Sweep: find all structures not marked, and free them. */
5846 /* Remove or mark entries in weak hash tables.
5847 This must be done before any object is unmarked. */
5848 sweep_weak_hash_tables ();
5851 #ifdef GC_CHECK_STRING_BYTES
5852 if (!noninteractive
)
5853 check_string_bytes (1);
5856 /* Put all unmarked conses on free list */
5858 register struct cons_block
*cblk
;
5859 struct cons_block
**cprev
= &cons_block
;
5860 register int lim
= cons_block_index
;
5861 register int num_free
= 0, num_used
= 0;
5865 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
5869 int ilim
= (lim
+ BITS_PER_INT
- 1) / BITS_PER_INT
;
5871 /* Scan the mark bits an int at a time. */
5872 for (i
= 0; i
<= ilim
; i
++)
5874 if (cblk
->gcmarkbits
[i
] == -1)
5876 /* Fast path - all cons cells for this int are marked. */
5877 cblk
->gcmarkbits
[i
] = 0;
5878 num_used
+= BITS_PER_INT
;
5882 /* Some cons cells for this int are not marked.
5883 Find which ones, and free them. */
5884 int start
, pos
, stop
;
5886 start
= i
* BITS_PER_INT
;
5888 if (stop
> BITS_PER_INT
)
5889 stop
= BITS_PER_INT
;
5892 for (pos
= start
; pos
< stop
; pos
++)
5894 if (!CONS_MARKED_P (&cblk
->conses
[pos
]))
5897 cblk
->conses
[pos
].u
.chain
= cons_free_list
;
5898 cons_free_list
= &cblk
->conses
[pos
];
5900 cons_free_list
->car
= Vdead
;
5906 CONS_UNMARK (&cblk
->conses
[pos
]);
5912 lim
= CONS_BLOCK_SIZE
;
5913 /* If this block contains only free conses and we have already
5914 seen more than two blocks worth of free conses then deallocate
5916 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
5918 *cprev
= cblk
->next
;
5919 /* Unhook from the free list. */
5920 cons_free_list
= cblk
->conses
[0].u
.chain
;
5921 lisp_align_free (cblk
);
5926 num_free
+= this_free
;
5927 cprev
= &cblk
->next
;
5930 total_conses
= num_used
;
5931 total_free_conses
= num_free
;
5934 /* Put all unmarked floats on free list */
5936 register struct float_block
*fblk
;
5937 struct float_block
**fprev
= &float_block
;
5938 register int lim
= float_block_index
;
5939 register int num_free
= 0, num_used
= 0;
5941 float_free_list
= 0;
5943 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
5947 for (i
= 0; i
< lim
; i
++)
5948 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
5951 fblk
->floats
[i
].u
.chain
= float_free_list
;
5952 float_free_list
= &fblk
->floats
[i
];
5957 FLOAT_UNMARK (&fblk
->floats
[i
]);
5959 lim
= FLOAT_BLOCK_SIZE
;
5960 /* If this block contains only free floats and we have already
5961 seen more than two blocks worth of free floats then deallocate
5963 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
5965 *fprev
= fblk
->next
;
5966 /* Unhook from the free list. */
5967 float_free_list
= fblk
->floats
[0].u
.chain
;
5968 lisp_align_free (fblk
);
5973 num_free
+= this_free
;
5974 fprev
= &fblk
->next
;
5977 total_floats
= num_used
;
5978 total_free_floats
= num_free
;
5981 /* Put all unmarked intervals on free list */
5983 register struct interval_block
*iblk
;
5984 struct interval_block
**iprev
= &interval_block
;
5985 register int lim
= interval_block_index
;
5986 register int num_free
= 0, num_used
= 0;
5988 interval_free_list
= 0;
5990 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
5995 for (i
= 0; i
< lim
; i
++)
5997 if (!iblk
->intervals
[i
].gcmarkbit
)
5999 SET_INTERVAL_PARENT (&iblk
->intervals
[i
], interval_free_list
);
6000 interval_free_list
= &iblk
->intervals
[i
];
6006 iblk
->intervals
[i
].gcmarkbit
= 0;
6009 lim
= INTERVAL_BLOCK_SIZE
;
6010 /* If this block contains only free intervals and we have already
6011 seen more than two blocks worth of free intervals then
6012 deallocate this block. */
6013 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
6015 *iprev
= iblk
->next
;
6016 /* Unhook from the free list. */
6017 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
6019 n_interval_blocks
--;
6023 num_free
+= this_free
;
6024 iprev
= &iblk
->next
;
6027 total_intervals
= num_used
;
6028 total_free_intervals
= num_free
;
6031 /* Put all unmarked symbols on free list */
6033 register struct symbol_block
*sblk
;
6034 struct symbol_block
**sprev
= &symbol_block
;
6035 register int lim
= symbol_block_index
;
6036 register int num_free
= 0, num_used
= 0;
6038 symbol_free_list
= NULL
;
6040 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
6043 struct Lisp_Symbol
*sym
= sblk
->symbols
;
6044 struct Lisp_Symbol
*end
= sym
+ lim
;
6046 for (; sym
< end
; ++sym
)
6048 /* Check if the symbol was created during loadup. In such a case
6049 it might be pointed to by pure bytecode which we don't trace,
6050 so we conservatively assume that it is live. */
6051 int pure_p
= PURE_POINTER_P (XSTRING (sym
->xname
));
6053 if (!sym
->gcmarkbit
&& !pure_p
)
6055 sym
->next
= symbol_free_list
;
6056 symbol_free_list
= sym
;
6058 symbol_free_list
->function
= Vdead
;
6066 UNMARK_STRING (XSTRING (sym
->xname
));
6071 lim
= SYMBOL_BLOCK_SIZE
;
6072 /* If this block contains only free symbols and we have already
6073 seen more than two blocks worth of free symbols then deallocate
6075 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
6077 *sprev
= sblk
->next
;
6078 /* Unhook from the free list. */
6079 symbol_free_list
= sblk
->symbols
[0].next
;
6085 num_free
+= this_free
;
6086 sprev
= &sblk
->next
;
6089 total_symbols
= num_used
;
6090 total_free_symbols
= num_free
;
6093 /* Put all unmarked misc's on free list.
6094 For a marker, first unchain it from the buffer it points into. */
6096 register struct marker_block
*mblk
;
6097 struct marker_block
**mprev
= &marker_block
;
6098 register int lim
= marker_block_index
;
6099 register int num_free
= 0, num_used
= 0;
6101 marker_free_list
= 0;
6103 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
6108 for (i
= 0; i
< lim
; i
++)
6110 if (!mblk
->markers
[i
].u_any
.gcmarkbit
)
6112 if (mblk
->markers
[i
].u_any
.type
== Lisp_Misc_Marker
)
6113 unchain_marker (&mblk
->markers
[i
].u_marker
);
6114 /* Set the type of the freed object to Lisp_Misc_Free.
6115 We could leave the type alone, since nobody checks it,
6116 but this might catch bugs faster. */
6117 mblk
->markers
[i
].u_marker
.type
= Lisp_Misc_Free
;
6118 mblk
->markers
[i
].u_free
.chain
= marker_free_list
;
6119 marker_free_list
= &mblk
->markers
[i
];
6125 mblk
->markers
[i
].u_any
.gcmarkbit
= 0;
6128 lim
= MARKER_BLOCK_SIZE
;
6129 /* If this block contains only free markers and we have already
6130 seen more than two blocks worth of free markers then deallocate
6132 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
6134 *mprev
= mblk
->next
;
6135 /* Unhook from the free list. */
6136 marker_free_list
= mblk
->markers
[0].u_free
.chain
;
6142 num_free
+= this_free
;
6143 mprev
= &mblk
->next
;
6147 total_markers
= num_used
;
6148 total_free_markers
= num_free
;
6151 /* Free all unmarked buffers */
6153 register struct buffer
*buffer
= all_buffers
, *prev
= 0, *next
;
6156 if (!VECTOR_MARKED_P (buffer
))
6159 prev
->next
= buffer
->next
;
6161 all_buffers
= buffer
->next
;
6162 next
= buffer
->next
;
6168 VECTOR_UNMARK (buffer
);
6169 UNMARK_BALANCE_INTERVALS (BUF_INTERVALS (buffer
));
6170 prev
= buffer
, buffer
= buffer
->next
;
6174 /* Free all unmarked vectors */
6176 register struct Lisp_Vector
*vector
= all_vectors
, *prev
= 0, *next
;
6177 total_vector_size
= 0;
6180 if (!VECTOR_MARKED_P (vector
))
6183 prev
->next
= vector
->next
;
6185 all_vectors
= vector
->next
;
6186 next
= vector
->next
;
6194 VECTOR_UNMARK (vector
);
6195 if (vector
->size
& PSEUDOVECTOR_FLAG
)
6196 total_vector_size
+= (PSEUDOVECTOR_SIZE_MASK
& vector
->size
);
6198 total_vector_size
+= vector
->size
;
6199 prev
= vector
, vector
= vector
->next
;
6203 #ifdef GC_CHECK_STRING_BYTES
6204 if (!noninteractive
)
6205 check_string_bytes (1);
6212 /* Debugging aids. */
6214 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
6215 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
6216 This may be helpful in debugging Emacs's memory usage.
6217 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
6222 XSETINT (end
, (EMACS_INT
) sbrk (0) / 1024);
6227 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
6228 doc
: /* Return a list of counters that measure how much consing there has been.
6229 Each of these counters increments for a certain kind of object.
6230 The counters wrap around from the largest positive integer to zero.
6231 Garbage collection does not decrease them.
6232 The elements of the value are as follows:
6233 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
6234 All are in units of 1 = one object consed
6235 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
6237 MISCS include overlays, markers, and some internal types.
6238 Frames, windows, buffers, and subprocesses count as vectors
6239 (but the contents of a buffer's text do not count here). */)
6242 Lisp_Object consed
[8];
6244 consed
[0] = make_number (min (MOST_POSITIVE_FIXNUM
, cons_cells_consed
));
6245 consed
[1] = make_number (min (MOST_POSITIVE_FIXNUM
, floats_consed
));
6246 consed
[2] = make_number (min (MOST_POSITIVE_FIXNUM
, vector_cells_consed
));
6247 consed
[3] = make_number (min (MOST_POSITIVE_FIXNUM
, symbols_consed
));
6248 consed
[4] = make_number (min (MOST_POSITIVE_FIXNUM
, string_chars_consed
));
6249 consed
[5] = make_number (min (MOST_POSITIVE_FIXNUM
, misc_objects_consed
));
6250 consed
[6] = make_number (min (MOST_POSITIVE_FIXNUM
, intervals_consed
));
6251 consed
[7] = make_number (min (MOST_POSITIVE_FIXNUM
, strings_consed
));
6253 return Flist (8, consed
);
6256 int suppress_checking
;
6259 die (msg
, file
, line
)
6264 fprintf (stderr
, "\r\n%s:%d: Emacs fatal error: %s\r\n",
6269 /* Initialization */
6274 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
6276 pure_size
= PURESIZE
;
6277 pure_bytes_used
= 0;
6278 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
6279 pure_bytes_used_before_overflow
= 0;
6281 /* Initialize the list of free aligned blocks. */
6284 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
6286 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
6290 ignore_warnings
= 1;
6291 #ifdef DOUG_LEA_MALLOC
6292 mallopt (M_TRIM_THRESHOLD
, 128*1024); /* trim threshold */
6293 mallopt (M_MMAP_THRESHOLD
, 64*1024); /* mmap threshold */
6294 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* max. number of mmap'ed areas */
6302 init_weak_hash_tables ();
6305 malloc_hysteresis
= 32;
6307 malloc_hysteresis
= 0;
6310 refill_memory_reserve ();
6312 ignore_warnings
= 0;
6314 byte_stack_list
= 0;
6316 consing_since_gc
= 0;
6317 gc_cons_threshold
= 100000 * sizeof (Lisp_Object
);
6318 gc_relative_threshold
= 0;
6320 #ifdef VIRT_ADDR_VARIES
6321 malloc_sbrk_unused
= 1<<22; /* A large number */
6322 malloc_sbrk_used
= 100000; /* as reasonable as any number */
6323 #endif /* VIRT_ADDR_VARIES */
6330 byte_stack_list
= 0;
6332 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
6333 setjmp_tested_p
= longjmps_done
= 0;
6336 Vgc_elapsed
= make_float (0.0);
6343 DEFVAR_INT ("gc-cons-threshold", &gc_cons_threshold
,
6344 doc
: /* *Number of bytes of consing between garbage collections.
6345 Garbage collection can happen automatically once this many bytes have been
6346 allocated since the last garbage collection. All data types count.
6348 Garbage collection happens automatically only when `eval' is called.
6350 By binding this temporarily to a large number, you can effectively
6351 prevent garbage collection during a part of the program.
6352 See also `gc-cons-percentage'. */);
6354 DEFVAR_LISP ("gc-cons-percentage", &Vgc_cons_percentage
,
6355 doc
: /* *Portion of the heap used for allocation.
6356 Garbage collection can happen automatically once this portion of the heap
6357 has been allocated since the last garbage collection.
6358 If this portion is smaller than `gc-cons-threshold', this is ignored. */);
6359 Vgc_cons_percentage
= make_float (0.1);
6361 DEFVAR_INT ("pure-bytes-used", &pure_bytes_used
,
6362 doc
: /* Number of bytes of sharable Lisp data allocated so far. */);
6364 DEFVAR_INT ("cons-cells-consed", &cons_cells_consed
,
6365 doc
: /* Number of cons cells that have been consed so far. */);
6367 DEFVAR_INT ("floats-consed", &floats_consed
,
6368 doc
: /* Number of floats that have been consed so far. */);
6370 DEFVAR_INT ("vector-cells-consed", &vector_cells_consed
,
6371 doc
: /* Number of vector cells that have been consed so far. */);
6373 DEFVAR_INT ("symbols-consed", &symbols_consed
,
6374 doc
: /* Number of symbols that have been consed so far. */);
6376 DEFVAR_INT ("string-chars-consed", &string_chars_consed
,
6377 doc
: /* Number of string characters that have been consed so far. */);
6379 DEFVAR_INT ("misc-objects-consed", &misc_objects_consed
,
6380 doc
: /* Number of miscellaneous objects that have been consed so far. */);
6382 DEFVAR_INT ("intervals-consed", &intervals_consed
,
6383 doc
: /* Number of intervals that have been consed so far. */);
6385 DEFVAR_INT ("strings-consed", &strings_consed
,
6386 doc
: /* Number of strings that have been consed so far. */);
6388 DEFVAR_LISP ("purify-flag", &Vpurify_flag
,
6389 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
6390 This means that certain objects should be allocated in shared (pure) space. */);
6392 DEFVAR_BOOL ("garbage-collection-messages", &garbage_collection_messages
,
6393 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
6394 garbage_collection_messages
= 0;
6396 DEFVAR_LISP ("post-gc-hook", &Vpost_gc_hook
,
6397 doc
: /* Hook run after garbage collection has finished. */);
6398 Vpost_gc_hook
= Qnil
;
6399 Qpost_gc_hook
= intern ("post-gc-hook");
6400 staticpro (&Qpost_gc_hook
);
6402 DEFVAR_LISP ("memory-signal-data", &Vmemory_signal_data
,
6403 doc
: /* Precomputed `signal' argument for memory-full error. */);
6404 /* We build this in advance because if we wait until we need it, we might
6405 not be able to allocate the memory to hold it. */
6408 build_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"));
6410 DEFVAR_LISP ("memory-full", &Vmemory_full
,
6411 doc
: /* Non-nil means Emacs cannot get much more Lisp memory. */);
6412 Vmemory_full
= Qnil
;
6414 staticpro (&Qgc_cons_threshold
);
6415 Qgc_cons_threshold
= intern ("gc-cons-threshold");
6417 staticpro (&Qchar_table_extra_slots
);
6418 Qchar_table_extra_slots
= intern ("char-table-extra-slots");
6420 DEFVAR_LISP ("gc-elapsed", &Vgc_elapsed
,
6421 doc
: /* Accumulated time elapsed in garbage collections.
6422 The time is in seconds as a floating point value. */);
6423 DEFVAR_INT ("gcs-done", &gcs_done
,
6424 doc
: /* Accumulated number of garbage collections done. */);
6429 defsubr (&Smake_byte_code
);
6430 defsubr (&Smake_list
);
6431 defsubr (&Smake_vector
);
6432 defsubr (&Smake_string
);
6433 defsubr (&Smake_bool_vector
);
6434 defsubr (&Smake_symbol
);
6435 defsubr (&Smake_marker
);
6436 defsubr (&Spurecopy
);
6437 defsubr (&Sgarbage_collect
);
6438 defsubr (&Smemory_limit
);
6439 defsubr (&Smemory_use_counts
);
6441 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
6442 defsubr (&Sgc_status
);
6446 /* arch-tag: 6695ca10-e3c5-4c2c-8bc3-ed26a7dda857
6447 (do not change this comment) */