1 /* Storage allocation and gc for GNU Emacs Lisp interpreter.
3 Copyright (C) 1985-1986, 1988, 1993-1995, 1997-2012
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. */
32 /* This file is part of the core Lisp implementation, and thus must
33 deal with the real data structures. If the Lisp implementation is
34 replaced, this file likely will not be used. */
36 #undef HIDE_LISP_IMPLEMENTATION
39 #include "intervals.h"
41 #include "character.h"
46 #include "blockinput.h"
47 #include "syssignal.h"
48 #include "termhooks.h" /* For struct terminal. */
52 /* GC_CHECK_MARKED_OBJECTS means do sanity checks on allocated objects.
53 Doable only if GC_MARK_STACK. */
55 # undef GC_CHECK_MARKED_OBJECTS
58 /* GC_MALLOC_CHECK defined means perform validity checks of malloc'd
59 memory. Can do this only if using gmalloc.c and if not checking
62 #if (defined SYSTEM_MALLOC || defined DOUG_LEA_MALLOC \
63 || defined GC_CHECK_MARKED_OBJECTS)
64 #undef GC_MALLOC_CHECK
78 #ifdef DOUG_LEA_MALLOC
82 /* Specify maximum number of areas to mmap. It would be nice to use a
83 value that explicitly means "no limit". */
85 #define MMAP_MAX_AREAS 100000000
87 #else /* not DOUG_LEA_MALLOC */
89 /* The following come from gmalloc.c. */
91 extern size_t _bytes_used
;
92 extern size_t __malloc_extra_blocks
;
93 extern void *_malloc_internal (size_t);
94 extern void _free_internal (void *);
96 #endif /* not DOUG_LEA_MALLOC */
98 #if ! defined SYSTEM_MALLOC && ! defined SYNC_INPUT
101 /* When GTK uses the file chooser dialog, different backends can be loaded
102 dynamically. One such a backend is the Gnome VFS backend that gets loaded
103 if you run Gnome. That backend creates several threads and also allocates
106 Also, gconf and gsettings may create several threads.
108 If Emacs sets malloc hooks (! SYSTEM_MALLOC) and the emacs_blocked_*
109 functions below are called from malloc, there is a chance that one
110 of these threads preempts the Emacs main thread and the hook variables
111 end up in an inconsistent state. So we have a mutex to prevent that (note
112 that the backend handles concurrent access to malloc within its own threads
113 but Emacs code running in the main thread is not included in that control).
115 When UNBLOCK_INPUT is called, reinvoke_input_signal may be called. If this
116 happens in one of the backend threads we will have two threads that tries
117 to run Emacs code at once, and the code is not prepared for that.
118 To prevent that, we only call BLOCK/UNBLOCK from the main thread. */
120 static pthread_mutex_t alloc_mutex
;
122 #define BLOCK_INPUT_ALLOC \
125 if (pthread_equal (pthread_self (), main_thread)) \
127 pthread_mutex_lock (&alloc_mutex); \
130 #define UNBLOCK_INPUT_ALLOC \
133 pthread_mutex_unlock (&alloc_mutex); \
134 if (pthread_equal (pthread_self (), main_thread)) \
139 #else /* ! defined HAVE_PTHREAD */
141 #define BLOCK_INPUT_ALLOC BLOCK_INPUT
142 #define UNBLOCK_INPUT_ALLOC UNBLOCK_INPUT
144 #endif /* ! defined HAVE_PTHREAD */
145 #endif /* ! defined SYSTEM_MALLOC && ! defined SYNC_INPUT */
147 /* Mark, unmark, query mark bit of a Lisp string. S must be a pointer
148 to a struct Lisp_String. */
150 #define MARK_STRING(S) ((S)->size |= ARRAY_MARK_FLAG)
151 #define UNMARK_STRING(S) ((S)->size &= ~ARRAY_MARK_FLAG)
152 #define STRING_MARKED_P(S) (((S)->size & ARRAY_MARK_FLAG) != 0)
154 #define VECTOR_MARK(V) ((V)->header.size |= ARRAY_MARK_FLAG)
155 #define VECTOR_UNMARK(V) ((V)->header.size &= ~ARRAY_MARK_FLAG)
156 #define VECTOR_MARKED_P(V) (((V)->header.size & ARRAY_MARK_FLAG) != 0)
158 /* Value is the number of bytes of S, a pointer to a struct Lisp_String.
159 Be careful during GC, because S->size contains the mark bit for
162 #define GC_STRING_BYTES(S) (STRING_BYTES (S))
164 /* Global variables. */
165 struct emacs_globals globals
;
167 /* Number of bytes of consing done since the last gc. */
169 EMACS_INT consing_since_gc
;
171 /* Similar minimum, computed from Vgc_cons_percentage. */
173 EMACS_INT gc_relative_threshold
;
175 /* Minimum number of bytes of consing since GC before next GC,
176 when memory is full. */
178 EMACS_INT memory_full_cons_threshold
;
180 /* Nonzero during GC. */
184 /* Nonzero means abort if try to GC.
185 This is for code which is written on the assumption that
186 no GC will happen, so as to verify that assumption. */
190 /* Number of live and free conses etc. */
192 static EMACS_INT total_conses
, total_markers
, total_symbols
, total_vector_size
;
193 static EMACS_INT total_free_conses
, total_free_markers
, total_free_symbols
;
194 static EMACS_INT total_free_floats
, total_floats
;
196 /* Points to memory space allocated as "spare", to be freed if we run
197 out of memory. We keep one large block, four cons-blocks, and
198 two string blocks. */
200 static char *spare_memory
[7];
202 /* Amount of spare memory to keep in large reserve block, or to see
203 whether this much is available when malloc fails on a larger request. */
205 #define SPARE_MEMORY (1 << 14)
207 /* Number of extra blocks malloc should get when it needs more core. */
209 static int malloc_hysteresis
;
211 /* Initialize it to a nonzero value to force it into data space
212 (rather than bss space). That way unexec will remap it into text
213 space (pure), on some systems. We have not implemented the
214 remapping on more recent systems because this is less important
215 nowadays than in the days of small memories and timesharing. */
217 EMACS_INT pure
[(PURESIZE
+ sizeof (EMACS_INT
) - 1) / sizeof (EMACS_INT
)] = {1,};
218 #define PUREBEG (char *) pure
220 /* Pointer to the pure area, and its size. */
222 static char *purebeg
;
223 static ptrdiff_t pure_size
;
225 /* Number of bytes of pure storage used before pure storage overflowed.
226 If this is non-zero, this implies that an overflow occurred. */
228 static ptrdiff_t pure_bytes_used_before_overflow
;
230 /* Value is non-zero if P points into pure space. */
232 #define PURE_POINTER_P(P) \
233 ((uintptr_t) (P) - (uintptr_t) purebeg <= pure_size)
235 /* Index in pure at which next pure Lisp object will be allocated.. */
237 static ptrdiff_t pure_bytes_used_lisp
;
239 /* Number of bytes allocated for non-Lisp objects in pure storage. */
241 static ptrdiff_t pure_bytes_used_non_lisp
;
243 /* If nonzero, this is a warning delivered by malloc and not yet
246 const char *pending_malloc_warning
;
248 /* Maximum amount of C stack to save when a GC happens. */
250 #ifndef MAX_SAVE_STACK
251 #define MAX_SAVE_STACK 16000
254 /* Buffer in which we save a copy of the C stack at each GC. */
256 #if MAX_SAVE_STACK > 0
257 static char *stack_copy
;
258 static ptrdiff_t stack_copy_size
;
261 /* Non-zero means ignore malloc warnings. Set during initialization.
262 Currently not used. */
264 static int ignore_warnings
;
266 static Lisp_Object Qgc_cons_threshold
;
267 Lisp_Object Qchar_table_extra_slots
;
269 /* Hook run after GC has finished. */
271 static Lisp_Object Qpost_gc_hook
;
273 static void mark_terminals (void);
274 static void gc_sweep (void);
275 static Lisp_Object
make_pure_vector (ptrdiff_t);
276 static void mark_glyph_matrix (struct glyph_matrix
*);
277 static void mark_face_cache (struct face_cache
*);
279 #if !defined REL_ALLOC || defined SYSTEM_MALLOC
280 static void refill_memory_reserve (void);
282 static struct Lisp_String
*allocate_string (void);
283 static void compact_small_strings (void);
284 static void free_large_strings (void);
285 static void sweep_strings (void);
286 static void free_misc (Lisp_Object
);
287 extern Lisp_Object
which_symbols (Lisp_Object
, EMACS_INT
) EXTERNALLY_VISIBLE
;
289 /* When scanning the C stack for live Lisp objects, Emacs keeps track
290 of what memory allocated via lisp_malloc is intended for what
291 purpose. This enumeration specifies the type of memory. */
302 /* We used to keep separate mem_types for subtypes of vectors such as
303 process, hash_table, frame, terminal, and window, but we never made
304 use of the distinction, so it only caused source-code complexity
305 and runtime slowdown. Minor but pointless. */
307 /* Special type to denote vector blocks. */
308 MEM_TYPE_VECTOR_BLOCK
311 static void *lisp_malloc (size_t, enum mem_type
);
314 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
316 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
317 #include <stdio.h> /* For fprintf. */
320 /* A unique object in pure space used to make some Lisp objects
321 on free lists recognizable in O(1). */
323 static Lisp_Object Vdead
;
324 #define DEADP(x) EQ (x, Vdead)
326 #ifdef GC_MALLOC_CHECK
328 enum mem_type allocated_mem_type
;
330 #endif /* GC_MALLOC_CHECK */
332 /* A node in the red-black tree describing allocated memory containing
333 Lisp data. Each such block is recorded with its start and end
334 address when it is allocated, and removed from the tree when it
337 A red-black tree is a balanced binary tree with the following
340 1. Every node is either red or black.
341 2. Every leaf is black.
342 3. If a node is red, then both of its children are black.
343 4. Every simple path from a node to a descendant leaf contains
344 the same number of black nodes.
345 5. The root is always black.
347 When nodes are inserted into the tree, or deleted from the tree,
348 the tree is "fixed" so that these properties are always true.
350 A red-black tree with N internal nodes has height at most 2
351 log(N+1). Searches, insertions and deletions are done in O(log N).
352 Please see a text book about data structures for a detailed
353 description of red-black trees. Any book worth its salt should
358 /* Children of this node. These pointers are never NULL. When there
359 is no child, the value is MEM_NIL, which points to a dummy node. */
360 struct mem_node
*left
, *right
;
362 /* The parent of this node. In the root node, this is NULL. */
363 struct mem_node
*parent
;
365 /* Start and end of allocated region. */
369 enum {MEM_BLACK
, MEM_RED
} color
;
375 /* Base address of stack. Set in main. */
377 Lisp_Object
*stack_base
;
379 /* Root of the tree describing allocated Lisp memory. */
381 static struct mem_node
*mem_root
;
383 /* Lowest and highest known address in the heap. */
385 static void *min_heap_address
, *max_heap_address
;
387 /* Sentinel node of the tree. */
389 static struct mem_node mem_z
;
390 #define MEM_NIL &mem_z
392 static struct Lisp_Vector
*allocate_vectorlike (ptrdiff_t);
393 static void lisp_free (void *);
394 static void mark_stack (void);
395 static int live_vector_p (struct mem_node
*, void *);
396 static int live_buffer_p (struct mem_node
*, void *);
397 static int live_string_p (struct mem_node
*, void *);
398 static int live_cons_p (struct mem_node
*, void *);
399 static int live_symbol_p (struct mem_node
*, void *);
400 static int live_float_p (struct mem_node
*, void *);
401 static int live_misc_p (struct mem_node
*, void *);
402 static void mark_maybe_object (Lisp_Object
);
403 static void mark_memory (void *, void *);
404 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
405 static void mem_init (void);
406 static struct mem_node
*mem_insert (void *, void *, enum mem_type
);
407 static void mem_insert_fixup (struct mem_node
*);
409 static void mem_rotate_left (struct mem_node
*);
410 static void mem_rotate_right (struct mem_node
*);
411 static void mem_delete (struct mem_node
*);
412 static void mem_delete_fixup (struct mem_node
*);
413 static inline struct mem_node
*mem_find (void *);
416 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
417 static void check_gcpros (void);
420 #endif /* GC_MARK_STACK || GC_MALLOC_CHECK */
426 /* Recording what needs to be marked for gc. */
428 struct gcpro
*gcprolist
;
430 /* Addresses of staticpro'd variables. Initialize it to a nonzero
431 value; otherwise some compilers put it into BSS. */
433 #define NSTATICS 0x650
434 static Lisp_Object
*staticvec
[NSTATICS
] = {&Vpurify_flag
};
436 /* Index of next unused slot in staticvec. */
438 static int staticidx
= 0;
440 static void *pure_alloc (size_t, int);
443 /* Value is SZ rounded up to the next multiple of ALIGNMENT.
444 ALIGNMENT must be a power of 2. */
446 #define ALIGN(ptr, ALIGNMENT) \
447 ((void *) (((uintptr_t) (ptr) + (ALIGNMENT) - 1) \
448 & ~ ((ALIGNMENT) - 1)))
452 /************************************************************************
454 ************************************************************************/
456 /* Function malloc calls this if it finds we are near exhausting storage. */
459 malloc_warning (const char *str
)
461 pending_malloc_warning
= str
;
465 /* Display an already-pending malloc warning. */
468 display_malloc_warning (void)
470 call3 (intern ("display-warning"),
472 build_string (pending_malloc_warning
),
473 intern ("emergency"));
474 pending_malloc_warning
= 0;
477 /* Called if we can't allocate relocatable space for a buffer. */
480 buffer_memory_full (ptrdiff_t nbytes
)
482 /* If buffers use the relocating allocator, no need to free
483 spare_memory, because we may have plenty of malloc space left
484 that we could get, and if we don't, the malloc that fails will
485 itself cause spare_memory to be freed. If buffers don't use the
486 relocating allocator, treat this like any other failing
490 memory_full (nbytes
);
493 /* This used to call error, but if we've run out of memory, we could
494 get infinite recursion trying to build the string. */
495 xsignal (Qnil
, Vmemory_signal_data
);
498 /* A common multiple of the positive integers A and B. Ideally this
499 would be the least common multiple, but there's no way to do that
500 as a constant expression in C, so do the best that we can easily do. */
501 #define COMMON_MULTIPLE(a, b) \
502 ((a) % (b) == 0 ? (a) : (b) % (a) == 0 ? (b) : (a) * (b))
504 #ifndef XMALLOC_OVERRUN_CHECK
505 #define XMALLOC_OVERRUN_CHECK_OVERHEAD 0
508 /* Check for overrun in malloc'ed buffers by wrapping a header and trailer
511 The header consists of XMALLOC_OVERRUN_CHECK_SIZE fixed bytes
512 followed by XMALLOC_OVERRUN_SIZE_SIZE bytes containing the original
513 block size in little-endian order. The trailer consists of
514 XMALLOC_OVERRUN_CHECK_SIZE fixed bytes.
516 The header is used to detect whether this block has been allocated
517 through these functions, as some low-level libc functions may
518 bypass the malloc hooks. */
520 #define XMALLOC_OVERRUN_CHECK_SIZE 16
521 #define XMALLOC_OVERRUN_CHECK_OVERHEAD \
522 (2 * XMALLOC_OVERRUN_CHECK_SIZE + XMALLOC_OVERRUN_SIZE_SIZE)
524 /* Define XMALLOC_OVERRUN_SIZE_SIZE so that (1) it's large enough to
525 hold a size_t value and (2) the header size is a multiple of the
526 alignment that Emacs needs for C types and for USE_LSB_TAG. */
527 #define XMALLOC_BASE_ALIGNMENT \
530 union { long double d; intmax_t i; void *p; } u; \
536 # define XMALLOC_HEADER_ALIGNMENT \
537 COMMON_MULTIPLE (1 << GCTYPEBITS, XMALLOC_BASE_ALIGNMENT)
539 # define XMALLOC_HEADER_ALIGNMENT XMALLOC_BASE_ALIGNMENT
541 #define XMALLOC_OVERRUN_SIZE_SIZE \
542 (((XMALLOC_OVERRUN_CHECK_SIZE + sizeof (size_t) \
543 + XMALLOC_HEADER_ALIGNMENT - 1) \
544 / XMALLOC_HEADER_ALIGNMENT * XMALLOC_HEADER_ALIGNMENT) \
545 - XMALLOC_OVERRUN_CHECK_SIZE)
547 static char const xmalloc_overrun_check_header
[XMALLOC_OVERRUN_CHECK_SIZE
] =
548 { '\x9a', '\x9b', '\xae', '\xaf',
549 '\xbf', '\xbe', '\xce', '\xcf',
550 '\xea', '\xeb', '\xec', '\xed',
551 '\xdf', '\xde', '\x9c', '\x9d' };
553 static char const xmalloc_overrun_check_trailer
[XMALLOC_OVERRUN_CHECK_SIZE
] =
554 { '\xaa', '\xab', '\xac', '\xad',
555 '\xba', '\xbb', '\xbc', '\xbd',
556 '\xca', '\xcb', '\xcc', '\xcd',
557 '\xda', '\xdb', '\xdc', '\xdd' };
559 /* Insert and extract the block size in the header. */
562 xmalloc_put_size (unsigned char *ptr
, size_t size
)
565 for (i
= 0; i
< XMALLOC_OVERRUN_SIZE_SIZE
; i
++)
567 *--ptr
= size
& ((1 << CHAR_BIT
) - 1);
573 xmalloc_get_size (unsigned char *ptr
)
577 ptr
-= XMALLOC_OVERRUN_SIZE_SIZE
;
578 for (i
= 0; i
< XMALLOC_OVERRUN_SIZE_SIZE
; i
++)
587 /* The call depth in overrun_check functions. For example, this might happen:
589 overrun_check_malloc()
590 -> malloc -> (via hook)_-> emacs_blocked_malloc
591 -> overrun_check_malloc
592 call malloc (hooks are NULL, so real malloc is called).
593 malloc returns 10000.
594 add overhead, return 10016.
595 <- (back in overrun_check_malloc)
596 add overhead again, return 10032
597 xmalloc returns 10032.
602 overrun_check_free(10032)
604 free(10016) <- crash, because 10000 is the original pointer. */
606 static ptrdiff_t check_depth
;
608 /* Like malloc, but wraps allocated block with header and trailer. */
611 overrun_check_malloc (size_t size
)
613 register unsigned char *val
;
614 int overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_OVERHEAD
: 0;
615 if (SIZE_MAX
- overhead
< size
)
618 val
= (unsigned char *) malloc (size
+ overhead
);
619 if (val
&& check_depth
== 1)
621 memcpy (val
, xmalloc_overrun_check_header
, XMALLOC_OVERRUN_CHECK_SIZE
);
622 val
+= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
623 xmalloc_put_size (val
, size
);
624 memcpy (val
+ size
, xmalloc_overrun_check_trailer
,
625 XMALLOC_OVERRUN_CHECK_SIZE
);
632 /* Like realloc, but checks old block for overrun, and wraps new block
633 with header and trailer. */
636 overrun_check_realloc (void *block
, size_t size
)
638 register unsigned char *val
= (unsigned char *) block
;
639 int overhead
= ++check_depth
== 1 ? XMALLOC_OVERRUN_CHECK_OVERHEAD
: 0;
640 if (SIZE_MAX
- overhead
< size
)
645 && memcmp (xmalloc_overrun_check_header
,
646 val
- XMALLOC_OVERRUN_CHECK_SIZE
- XMALLOC_OVERRUN_SIZE_SIZE
,
647 XMALLOC_OVERRUN_CHECK_SIZE
) == 0)
649 size_t osize
= xmalloc_get_size (val
);
650 if (memcmp (xmalloc_overrun_check_trailer
, val
+ osize
,
651 XMALLOC_OVERRUN_CHECK_SIZE
))
653 memset (val
+ osize
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
654 val
-= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
655 memset (val
, 0, XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
);
658 val
= realloc (val
, size
+ overhead
);
660 if (val
&& check_depth
== 1)
662 memcpy (val
, xmalloc_overrun_check_header
, XMALLOC_OVERRUN_CHECK_SIZE
);
663 val
+= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
664 xmalloc_put_size (val
, size
);
665 memcpy (val
+ size
, xmalloc_overrun_check_trailer
,
666 XMALLOC_OVERRUN_CHECK_SIZE
);
672 /* Like free, but checks block for overrun. */
675 overrun_check_free (void *block
)
677 unsigned char *val
= (unsigned char *) block
;
682 && memcmp (xmalloc_overrun_check_header
,
683 val
- XMALLOC_OVERRUN_CHECK_SIZE
- XMALLOC_OVERRUN_SIZE_SIZE
,
684 XMALLOC_OVERRUN_CHECK_SIZE
) == 0)
686 size_t osize
= xmalloc_get_size (val
);
687 if (memcmp (xmalloc_overrun_check_trailer
, val
+ osize
,
688 XMALLOC_OVERRUN_CHECK_SIZE
))
690 #ifdef XMALLOC_CLEAR_FREE_MEMORY
691 val
-= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
692 memset (val
, 0xff, osize
+ XMALLOC_OVERRUN_CHECK_OVERHEAD
);
694 memset (val
+ osize
, 0, XMALLOC_OVERRUN_CHECK_SIZE
);
695 val
-= XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
;
696 memset (val
, 0, XMALLOC_OVERRUN_CHECK_SIZE
+ XMALLOC_OVERRUN_SIZE_SIZE
);
707 #define malloc overrun_check_malloc
708 #define realloc overrun_check_realloc
709 #define free overrun_check_free
713 /* When using SYNC_INPUT, we don't call malloc from a signal handler, so
714 there's no need to block input around malloc. */
715 #define MALLOC_BLOCK_INPUT ((void)0)
716 #define MALLOC_UNBLOCK_INPUT ((void)0)
718 #define MALLOC_BLOCK_INPUT BLOCK_INPUT
719 #define MALLOC_UNBLOCK_INPUT UNBLOCK_INPUT
722 /* Like malloc but check for no memory and block interrupt input.. */
725 xmalloc (size_t size
)
731 MALLOC_UNBLOCK_INPUT
;
738 /* Like the above, but zeroes out the memory just allocated. */
741 xzalloc (size_t size
)
747 MALLOC_UNBLOCK_INPUT
;
751 memset (val
, 0, size
);
755 /* Like realloc but check for no memory and block interrupt input.. */
758 xrealloc (void *block
, size_t size
)
763 /* We must call malloc explicitly when BLOCK is 0, since some
764 reallocs don't do this. */
768 val
= realloc (block
, size
);
769 MALLOC_UNBLOCK_INPUT
;
777 /* Like free but block interrupt input. */
786 MALLOC_UNBLOCK_INPUT
;
787 /* We don't call refill_memory_reserve here
788 because that duplicates doing so in emacs_blocked_free
789 and the criterion should go there. */
793 /* Other parts of Emacs pass large int values to allocator functions
794 expecting ptrdiff_t. This is portable in practice, but check it to
796 verify (INT_MAX
<= PTRDIFF_MAX
);
799 /* Allocate an array of NITEMS items, each of size ITEM_SIZE.
800 Signal an error on memory exhaustion, and block interrupt input. */
803 xnmalloc (ptrdiff_t nitems
, ptrdiff_t item_size
)
805 eassert (0 <= nitems
&& 0 < item_size
);
806 if (min (PTRDIFF_MAX
, SIZE_MAX
) / item_size
< nitems
)
807 memory_full (SIZE_MAX
);
808 return xmalloc (nitems
* item_size
);
812 /* Reallocate an array PA to make it of NITEMS items, each of size ITEM_SIZE.
813 Signal an error on memory exhaustion, and block interrupt input. */
816 xnrealloc (void *pa
, ptrdiff_t nitems
, ptrdiff_t item_size
)
818 eassert (0 <= nitems
&& 0 < item_size
);
819 if (min (PTRDIFF_MAX
, SIZE_MAX
) / item_size
< nitems
)
820 memory_full (SIZE_MAX
);
821 return xrealloc (pa
, nitems
* item_size
);
825 /* Grow PA, which points to an array of *NITEMS items, and return the
826 location of the reallocated array, updating *NITEMS to reflect its
827 new size. The new array will contain at least NITEMS_INCR_MIN more
828 items, but will not contain more than NITEMS_MAX items total.
829 ITEM_SIZE is the size of each item, in bytes.
831 ITEM_SIZE and NITEMS_INCR_MIN must be positive. *NITEMS must be
832 nonnegative. If NITEMS_MAX is -1, it is treated as if it were
835 If PA is null, then allocate a new array instead of reallocating
836 the old one. Thus, to grow an array A without saving its old
837 contents, invoke xfree (A) immediately followed by xgrowalloc (0,
840 Block interrupt input as needed. If memory exhaustion occurs, set
841 *NITEMS to zero if PA is null, and signal an error (i.e., do not
845 xpalloc (void *pa
, ptrdiff_t *nitems
, ptrdiff_t nitems_incr_min
,
846 ptrdiff_t nitems_max
, ptrdiff_t item_size
)
848 /* The approximate size to use for initial small allocation
849 requests. This is the largest "small" request for the GNU C
851 enum { DEFAULT_MXFAST
= 64 * sizeof (size_t) / 4 };
853 /* If the array is tiny, grow it to about (but no greater than)
854 DEFAULT_MXFAST bytes. Otherwise, grow it by about 50%. */
855 ptrdiff_t n
= *nitems
;
856 ptrdiff_t tiny_max
= DEFAULT_MXFAST
/ item_size
- n
;
857 ptrdiff_t half_again
= n
>> 1;
858 ptrdiff_t incr_estimate
= max (tiny_max
, half_again
);
860 /* Adjust the increment according to three constraints: NITEMS_INCR_MIN,
861 NITEMS_MAX, and what the C language can represent safely. */
862 ptrdiff_t C_language_max
= min (PTRDIFF_MAX
, SIZE_MAX
) / item_size
;
863 ptrdiff_t n_max
= (0 <= nitems_max
&& nitems_max
< C_language_max
864 ? nitems_max
: C_language_max
);
865 ptrdiff_t nitems_incr_max
= n_max
- n
;
866 ptrdiff_t incr
= max (nitems_incr_min
, min (incr_estimate
, nitems_incr_max
));
868 eassert (0 < item_size
&& 0 < nitems_incr_min
&& 0 <= n
&& -1 <= nitems_max
);
871 if (nitems_incr_max
< incr
)
872 memory_full (SIZE_MAX
);
874 pa
= xrealloc (pa
, n
* item_size
);
880 /* Like strdup, but uses xmalloc. */
883 xstrdup (const char *s
)
885 size_t len
= strlen (s
) + 1;
886 char *p
= xmalloc (len
);
892 /* Unwind for SAFE_ALLOCA */
895 safe_alloca_unwind (Lisp_Object arg
)
897 register struct Lisp_Save_Value
*p
= XSAVE_VALUE (arg
);
907 /* Like malloc but used for allocating Lisp data. NBYTES is the
908 number of bytes to allocate, TYPE describes the intended use of the
909 allocated memory block (for strings, for conses, ...). */
912 void *lisp_malloc_loser EXTERNALLY_VISIBLE
;
916 lisp_malloc (size_t nbytes
, enum mem_type type
)
922 #ifdef GC_MALLOC_CHECK
923 allocated_mem_type
= type
;
926 val
= (void *) malloc (nbytes
);
929 /* If the memory just allocated cannot be addressed thru a Lisp
930 object's pointer, and it needs to be,
931 that's equivalent to running out of memory. */
932 if (val
&& type
!= MEM_TYPE_NON_LISP
)
935 XSETCONS (tem
, (char *) val
+ nbytes
- 1);
936 if ((char *) XCONS (tem
) != (char *) val
+ nbytes
- 1)
938 lisp_malloc_loser
= val
;
945 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
946 if (val
&& type
!= MEM_TYPE_NON_LISP
)
947 mem_insert (val
, (char *) val
+ nbytes
, type
);
950 MALLOC_UNBLOCK_INPUT
;
952 memory_full (nbytes
);
956 /* Free BLOCK. This must be called to free memory allocated with a
957 call to lisp_malloc. */
960 lisp_free (void *block
)
964 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
965 mem_delete (mem_find (block
));
967 MALLOC_UNBLOCK_INPUT
;
970 /***** Allocation of aligned blocks of memory to store Lisp data. *****/
972 /* The entry point is lisp_align_malloc which returns blocks of at most
973 BLOCK_BYTES and guarantees they are aligned on a BLOCK_ALIGN boundary. */
975 #if defined (HAVE_POSIX_MEMALIGN) && defined (SYSTEM_MALLOC)
976 #define USE_POSIX_MEMALIGN 1
979 /* BLOCK_ALIGN has to be a power of 2. */
980 #define BLOCK_ALIGN (1 << 10)
982 /* Padding to leave at the end of a malloc'd block. This is to give
983 malloc a chance to minimize the amount of memory wasted to alignment.
984 It should be tuned to the particular malloc library used.
985 On glibc-2.3.2, malloc never tries to align, so a padding of 0 is best.
986 posix_memalign on the other hand would ideally prefer a value of 4
987 because otherwise, there's 1020 bytes wasted between each ablocks.
988 In Emacs, testing shows that those 1020 can most of the time be
989 efficiently used by malloc to place other objects, so a value of 0 can
990 still preferable unless you have a lot of aligned blocks and virtually
992 #define BLOCK_PADDING 0
993 #define BLOCK_BYTES \
994 (BLOCK_ALIGN - sizeof (struct ablocks *) - BLOCK_PADDING)
996 /* Internal data structures and constants. */
998 #define ABLOCKS_SIZE 16
1000 /* An aligned block of memory. */
1005 char payload
[BLOCK_BYTES
];
1006 struct ablock
*next_free
;
1008 /* `abase' is the aligned base of the ablocks. */
1009 /* It is overloaded to hold the virtual `busy' field that counts
1010 the number of used ablock in the parent ablocks.
1011 The first ablock has the `busy' field, the others have the `abase'
1012 field. To tell the difference, we assume that pointers will have
1013 integer values larger than 2 * ABLOCKS_SIZE. The lowest bit of `busy'
1014 is used to tell whether the real base of the parent ablocks is `abase'
1015 (if not, the word before the first ablock holds a pointer to the
1017 struct ablocks
*abase
;
1018 /* The padding of all but the last ablock is unused. The padding of
1019 the last ablock in an ablocks is not allocated. */
1021 char padding
[BLOCK_PADDING
];
1025 /* A bunch of consecutive aligned blocks. */
1028 struct ablock blocks
[ABLOCKS_SIZE
];
1031 /* Size of the block requested from malloc or posix_memalign. */
1032 #define ABLOCKS_BYTES (sizeof (struct ablocks) - BLOCK_PADDING)
1034 #define ABLOCK_ABASE(block) \
1035 (((uintptr_t) (block)->abase) <= (1 + 2 * ABLOCKS_SIZE) \
1036 ? (struct ablocks *)(block) \
1039 /* Virtual `busy' field. */
1040 #define ABLOCKS_BUSY(abase) ((abase)->blocks[0].abase)
1042 /* Pointer to the (not necessarily aligned) malloc block. */
1043 #ifdef USE_POSIX_MEMALIGN
1044 #define ABLOCKS_BASE(abase) (abase)
1046 #define ABLOCKS_BASE(abase) \
1047 (1 & (intptr_t) ABLOCKS_BUSY (abase) ? abase : ((void**)abase)[-1])
1050 /* The list of free ablock. */
1051 static struct ablock
*free_ablock
;
1053 /* Allocate an aligned block of nbytes.
1054 Alignment is on a multiple of BLOCK_ALIGN and `nbytes' has to be
1055 smaller or equal to BLOCK_BYTES. */
1057 lisp_align_malloc (size_t nbytes
, enum mem_type type
)
1060 struct ablocks
*abase
;
1062 eassert (nbytes
<= BLOCK_BYTES
);
1066 #ifdef GC_MALLOC_CHECK
1067 allocated_mem_type
= type
;
1073 intptr_t aligned
; /* int gets warning casting to 64-bit pointer. */
1075 #ifdef DOUG_LEA_MALLOC
1076 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
1077 because mapped region contents are not preserved in
1079 mallopt (M_MMAP_MAX
, 0);
1082 #ifdef USE_POSIX_MEMALIGN
1084 int err
= posix_memalign (&base
, BLOCK_ALIGN
, ABLOCKS_BYTES
);
1090 base
= malloc (ABLOCKS_BYTES
);
1091 abase
= ALIGN (base
, BLOCK_ALIGN
);
1096 MALLOC_UNBLOCK_INPUT
;
1097 memory_full (ABLOCKS_BYTES
);
1100 aligned
= (base
== abase
);
1102 ((void**)abase
)[-1] = base
;
1104 #ifdef DOUG_LEA_MALLOC
1105 /* Back to a reasonable maximum of mmap'ed areas. */
1106 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
1110 /* If the memory just allocated cannot be addressed thru a Lisp
1111 object's pointer, and it needs to be, that's equivalent to
1112 running out of memory. */
1113 if (type
!= MEM_TYPE_NON_LISP
)
1116 char *end
= (char *) base
+ ABLOCKS_BYTES
- 1;
1117 XSETCONS (tem
, end
);
1118 if ((char *) XCONS (tem
) != end
)
1120 lisp_malloc_loser
= base
;
1122 MALLOC_UNBLOCK_INPUT
;
1123 memory_full (SIZE_MAX
);
1128 /* Initialize the blocks and put them on the free list.
1129 If `base' was not properly aligned, we can't use the last block. */
1130 for (i
= 0; i
< (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1); i
++)
1132 abase
->blocks
[i
].abase
= abase
;
1133 abase
->blocks
[i
].x
.next_free
= free_ablock
;
1134 free_ablock
= &abase
->blocks
[i
];
1136 ABLOCKS_BUSY (abase
) = (struct ablocks
*) aligned
;
1138 eassert (0 == ((uintptr_t) abase
) % BLOCK_ALIGN
);
1139 eassert (ABLOCK_ABASE (&abase
->blocks
[3]) == abase
); /* 3 is arbitrary */
1140 eassert (ABLOCK_ABASE (&abase
->blocks
[0]) == abase
);
1141 eassert (ABLOCKS_BASE (abase
) == base
);
1142 eassert (aligned
== (intptr_t) ABLOCKS_BUSY (abase
));
1145 abase
= ABLOCK_ABASE (free_ablock
);
1146 ABLOCKS_BUSY (abase
) =
1147 (struct ablocks
*) (2 + (intptr_t) ABLOCKS_BUSY (abase
));
1149 free_ablock
= free_ablock
->x
.next_free
;
1151 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1152 if (type
!= MEM_TYPE_NON_LISP
)
1153 mem_insert (val
, (char *) val
+ nbytes
, type
);
1156 MALLOC_UNBLOCK_INPUT
;
1158 eassert (0 == ((uintptr_t) val
) % BLOCK_ALIGN
);
1163 lisp_align_free (void *block
)
1165 struct ablock
*ablock
= block
;
1166 struct ablocks
*abase
= ABLOCK_ABASE (ablock
);
1169 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
1170 mem_delete (mem_find (block
));
1172 /* Put on free list. */
1173 ablock
->x
.next_free
= free_ablock
;
1174 free_ablock
= ablock
;
1175 /* Update busy count. */
1176 ABLOCKS_BUSY (abase
)
1177 = (struct ablocks
*) (-2 + (intptr_t) ABLOCKS_BUSY (abase
));
1179 if (2 > (intptr_t) ABLOCKS_BUSY (abase
))
1180 { /* All the blocks are free. */
1181 int i
= 0, aligned
= (intptr_t) ABLOCKS_BUSY (abase
);
1182 struct ablock
**tem
= &free_ablock
;
1183 struct ablock
*atop
= &abase
->blocks
[aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1];
1187 if (*tem
>= (struct ablock
*) abase
&& *tem
< atop
)
1190 *tem
= (*tem
)->x
.next_free
;
1193 tem
= &(*tem
)->x
.next_free
;
1195 eassert ((aligned
& 1) == aligned
);
1196 eassert (i
== (aligned
? ABLOCKS_SIZE
: ABLOCKS_SIZE
- 1));
1197 #ifdef USE_POSIX_MEMALIGN
1198 eassert ((uintptr_t) ABLOCKS_BASE (abase
) % BLOCK_ALIGN
== 0);
1200 free (ABLOCKS_BASE (abase
));
1202 MALLOC_UNBLOCK_INPUT
;
1206 #ifndef SYSTEM_MALLOC
1208 /* Arranging to disable input signals while we're in malloc.
1210 This only works with GNU malloc. To help out systems which can't
1211 use GNU malloc, all the calls to malloc, realloc, and free
1212 elsewhere in the code should be inside a BLOCK_INPUT/UNBLOCK_INPUT
1213 pair; unfortunately, we have no idea what C library functions
1214 might call malloc, so we can't really protect them unless you're
1215 using GNU malloc. Fortunately, most of the major operating systems
1216 can use GNU malloc. */
1219 /* When using SYNC_INPUT, we don't call malloc from a signal handler, so
1220 there's no need to block input around malloc. */
1222 #ifndef DOUG_LEA_MALLOC
1223 extern void * (*__malloc_hook
) (size_t, const void *);
1224 extern void * (*__realloc_hook
) (void *, size_t, const void *);
1225 extern void (*__free_hook
) (void *, const void *);
1226 /* Else declared in malloc.h, perhaps with an extra arg. */
1227 #endif /* DOUG_LEA_MALLOC */
1228 static void * (*old_malloc_hook
) (size_t, const void *);
1229 static void * (*old_realloc_hook
) (void *, size_t, const void*);
1230 static void (*old_free_hook
) (void*, const void*);
1232 #ifdef DOUG_LEA_MALLOC
1233 # define BYTES_USED (mallinfo ().uordblks)
1235 # define BYTES_USED _bytes_used
1238 #ifdef GC_MALLOC_CHECK
1239 static int dont_register_blocks
;
1242 static size_t bytes_used_when_reconsidered
;
1244 /* Value of _bytes_used, when spare_memory was freed. */
1246 static size_t bytes_used_when_full
;
1248 /* This function is used as the hook for free to call. */
1251 emacs_blocked_free (void *ptr
, const void *ptr2
)
1255 #ifdef GC_MALLOC_CHECK
1261 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1264 "Freeing `%p' which wasn't allocated with malloc\n", ptr
);
1269 /* fprintf (stderr, "free %p...%p (%p)\n", m->start, m->end, ptr); */
1273 #endif /* GC_MALLOC_CHECK */
1275 __free_hook
= old_free_hook
;
1278 /* If we released our reserve (due to running out of memory),
1279 and we have a fair amount free once again,
1280 try to set aside another reserve in case we run out once more. */
1281 if (! NILP (Vmemory_full
)
1282 /* Verify there is enough space that even with the malloc
1283 hysteresis this call won't run out again.
1284 The code here is correct as long as SPARE_MEMORY
1285 is substantially larger than the block size malloc uses. */
1286 && (bytes_used_when_full
1287 > ((bytes_used_when_reconsidered
= BYTES_USED
)
1288 + max (malloc_hysteresis
, 4) * SPARE_MEMORY
)))
1289 refill_memory_reserve ();
1291 __free_hook
= emacs_blocked_free
;
1292 UNBLOCK_INPUT_ALLOC
;
1296 /* This function is the malloc hook that Emacs uses. */
1299 emacs_blocked_malloc (size_t size
, const void *ptr
)
1304 __malloc_hook
= old_malloc_hook
;
1305 #ifdef DOUG_LEA_MALLOC
1306 /* Segfaults on my system. --lorentey */
1307 /* mallopt (M_TOP_PAD, malloc_hysteresis * 4096); */
1309 __malloc_extra_blocks
= malloc_hysteresis
;
1312 value
= (void *) malloc (size
);
1314 #ifdef GC_MALLOC_CHECK
1316 struct mem_node
*m
= mem_find (value
);
1319 fprintf (stderr
, "Malloc returned %p which is already in use\n",
1321 fprintf (stderr
, "Region in use is %p...%p, %td bytes, type %d\n",
1322 m
->start
, m
->end
, (char *) m
->end
- (char *) m
->start
,
1327 if (!dont_register_blocks
)
1329 mem_insert (value
, (char *) value
+ max (1, size
), allocated_mem_type
);
1330 allocated_mem_type
= MEM_TYPE_NON_LISP
;
1333 #endif /* GC_MALLOC_CHECK */
1335 __malloc_hook
= emacs_blocked_malloc
;
1336 UNBLOCK_INPUT_ALLOC
;
1338 /* fprintf (stderr, "%p malloc\n", value); */
1343 /* This function is the realloc hook that Emacs uses. */
1346 emacs_blocked_realloc (void *ptr
, size_t size
, const void *ptr2
)
1351 __realloc_hook
= old_realloc_hook
;
1353 #ifdef GC_MALLOC_CHECK
1356 struct mem_node
*m
= mem_find (ptr
);
1357 if (m
== MEM_NIL
|| m
->start
!= ptr
)
1360 "Realloc of %p which wasn't allocated with malloc\n",
1368 /* fprintf (stderr, "%p -> realloc\n", ptr); */
1370 /* Prevent malloc from registering blocks. */
1371 dont_register_blocks
= 1;
1372 #endif /* GC_MALLOC_CHECK */
1374 value
= (void *) realloc (ptr
, size
);
1376 #ifdef GC_MALLOC_CHECK
1377 dont_register_blocks
= 0;
1380 struct mem_node
*m
= mem_find (value
);
1383 fprintf (stderr
, "Realloc returns memory that is already in use\n");
1387 /* Can't handle zero size regions in the red-black tree. */
1388 mem_insert (value
, (char *) value
+ max (size
, 1), MEM_TYPE_NON_LISP
);
1391 /* fprintf (stderr, "%p <- realloc\n", value); */
1392 #endif /* GC_MALLOC_CHECK */
1394 __realloc_hook
= emacs_blocked_realloc
;
1395 UNBLOCK_INPUT_ALLOC
;
1402 /* Called from Fdump_emacs so that when the dumped Emacs starts, it has a
1403 normal malloc. Some thread implementations need this as they call
1404 malloc before main. The pthread_self call in BLOCK_INPUT_ALLOC then
1405 calls malloc because it is the first call, and we have an endless loop. */
1408 reset_malloc_hooks (void)
1410 __free_hook
= old_free_hook
;
1411 __malloc_hook
= old_malloc_hook
;
1412 __realloc_hook
= old_realloc_hook
;
1414 #endif /* HAVE_PTHREAD */
1417 /* Called from main to set up malloc to use our hooks. */
1420 uninterrupt_malloc (void)
1423 #ifdef DOUG_LEA_MALLOC
1424 pthread_mutexattr_t attr
;
1426 /* GLIBC has a faster way to do this, but let's keep it portable.
1427 This is according to the Single UNIX Specification. */
1428 pthread_mutexattr_init (&attr
);
1429 pthread_mutexattr_settype (&attr
, PTHREAD_MUTEX_RECURSIVE
);
1430 pthread_mutex_init (&alloc_mutex
, &attr
);
1431 #else /* !DOUG_LEA_MALLOC */
1432 /* Some systems such as Solaris 2.6 don't have a recursive mutex,
1433 and the bundled gmalloc.c doesn't require it. */
1434 pthread_mutex_init (&alloc_mutex
, NULL
);
1435 #endif /* !DOUG_LEA_MALLOC */
1436 #endif /* HAVE_PTHREAD */
1438 if (__free_hook
!= emacs_blocked_free
)
1439 old_free_hook
= __free_hook
;
1440 __free_hook
= emacs_blocked_free
;
1442 if (__malloc_hook
!= emacs_blocked_malloc
)
1443 old_malloc_hook
= __malloc_hook
;
1444 __malloc_hook
= emacs_blocked_malloc
;
1446 if (__realloc_hook
!= emacs_blocked_realloc
)
1447 old_realloc_hook
= __realloc_hook
;
1448 __realloc_hook
= emacs_blocked_realloc
;
1451 #endif /* not SYNC_INPUT */
1452 #endif /* not SYSTEM_MALLOC */
1456 /***********************************************************************
1458 ***********************************************************************/
1460 /* Number of intervals allocated in an interval_block structure.
1461 The 1020 is 1024 minus malloc overhead. */
1463 #define INTERVAL_BLOCK_SIZE \
1464 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
1466 /* Intervals are allocated in chunks in form of an interval_block
1469 struct interval_block
1471 /* Place `intervals' first, to preserve alignment. */
1472 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
1473 struct interval_block
*next
;
1476 /* Current interval block. Its `next' pointer points to older
1479 static struct interval_block
*interval_block
;
1481 /* Index in interval_block above of the next unused interval
1484 static int interval_block_index
;
1486 /* Number of free and live intervals. */
1488 static EMACS_INT total_free_intervals
, total_intervals
;
1490 /* List of free intervals. */
1492 static INTERVAL interval_free_list
;
1495 /* Initialize interval allocation. */
1498 init_intervals (void)
1500 interval_block
= NULL
;
1501 interval_block_index
= INTERVAL_BLOCK_SIZE
;
1502 interval_free_list
= 0;
1506 /* Return a new interval. */
1509 make_interval (void)
1513 /* eassert (!handling_signal); */
1517 if (interval_free_list
)
1519 val
= interval_free_list
;
1520 interval_free_list
= INTERVAL_PARENT (interval_free_list
);
1524 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
1526 register struct interval_block
*newi
;
1528 newi
= (struct interval_block
*) lisp_malloc (sizeof *newi
,
1531 newi
->next
= interval_block
;
1532 interval_block
= newi
;
1533 interval_block_index
= 0;
1535 val
= &interval_block
->intervals
[interval_block_index
++];
1538 MALLOC_UNBLOCK_INPUT
;
1540 consing_since_gc
+= sizeof (struct interval
);
1542 RESET_INTERVAL (val
);
1548 /* Mark Lisp objects in interval I. */
1551 mark_interval (register INTERVAL i
, Lisp_Object dummy
)
1553 eassert (!i
->gcmarkbit
); /* Intervals are never shared. */
1555 mark_object (i
->plist
);
1559 /* Mark the interval tree rooted in TREE. Don't call this directly;
1560 use the macro MARK_INTERVAL_TREE instead. */
1563 mark_interval_tree (register INTERVAL tree
)
1565 /* No need to test if this tree has been marked already; this
1566 function is always called through the MARK_INTERVAL_TREE macro,
1567 which takes care of that. */
1569 traverse_intervals_noorder (tree
, mark_interval
, Qnil
);
1573 /* Mark the interval tree rooted in I. */
1575 #define MARK_INTERVAL_TREE(i) \
1577 if (!NULL_INTERVAL_P (i) && !i->gcmarkbit) \
1578 mark_interval_tree (i); \
1582 #define UNMARK_BALANCE_INTERVALS(i) \
1584 if (! NULL_INTERVAL_P (i)) \
1585 (i) = balance_intervals (i); \
1588 /***********************************************************************
1590 ***********************************************************************/
1592 /* Lisp_Strings are allocated in string_block structures. When a new
1593 string_block is allocated, all the Lisp_Strings it contains are
1594 added to a free-list string_free_list. When a new Lisp_String is
1595 needed, it is taken from that list. During the sweep phase of GC,
1596 string_blocks that are entirely free are freed, except two which
1599 String data is allocated from sblock structures. Strings larger
1600 than LARGE_STRING_BYTES, get their own sblock, data for smaller
1601 strings is sub-allocated out of sblocks of size SBLOCK_SIZE.
1603 Sblocks consist internally of sdata structures, one for each
1604 Lisp_String. The sdata structure points to the Lisp_String it
1605 belongs to. The Lisp_String points back to the `u.data' member of
1606 its sdata structure.
1608 When a Lisp_String is freed during GC, it is put back on
1609 string_free_list, and its `data' member and its sdata's `string'
1610 pointer is set to null. The size of the string is recorded in the
1611 `u.nbytes' member of the sdata. So, sdata structures that are no
1612 longer used, can be easily recognized, and it's easy to compact the
1613 sblocks of small strings which we do in compact_small_strings. */
1615 /* Size in bytes of an sblock structure used for small strings. This
1616 is 8192 minus malloc overhead. */
1618 #define SBLOCK_SIZE 8188
1620 /* Strings larger than this are considered large strings. String data
1621 for large strings is allocated from individual sblocks. */
1623 #define LARGE_STRING_BYTES 1024
1625 /* Structure describing string memory sub-allocated from an sblock.
1626 This is where the contents of Lisp strings are stored. */
1630 /* Back-pointer to the string this sdata belongs to. If null, this
1631 structure is free, and the NBYTES member of the union below
1632 contains the string's byte size (the same value that STRING_BYTES
1633 would return if STRING were non-null). If non-null, STRING_BYTES
1634 (STRING) is the size of the data, and DATA contains the string's
1636 struct Lisp_String
*string
;
1638 #ifdef GC_CHECK_STRING_BYTES
1641 unsigned char data
[1];
1643 #define SDATA_NBYTES(S) (S)->nbytes
1644 #define SDATA_DATA(S) (S)->data
1645 #define SDATA_SELECTOR(member) member
1647 #else /* not GC_CHECK_STRING_BYTES */
1651 /* When STRING is non-null. */
1652 unsigned char data
[1];
1654 /* When STRING is null. */
1658 #define SDATA_NBYTES(S) (S)->u.nbytes
1659 #define SDATA_DATA(S) (S)->u.data
1660 #define SDATA_SELECTOR(member) u.member
1662 #endif /* not GC_CHECK_STRING_BYTES */
1664 #define SDATA_DATA_OFFSET offsetof (struct sdata, SDATA_SELECTOR (data))
1668 /* Structure describing a block of memory which is sub-allocated to
1669 obtain string data memory for strings. Blocks for small strings
1670 are of fixed size SBLOCK_SIZE. Blocks for large strings are made
1671 as large as needed. */
1676 struct sblock
*next
;
1678 /* Pointer to the next free sdata block. This points past the end
1679 of the sblock if there isn't any space left in this block. */
1680 struct sdata
*next_free
;
1682 /* Start of data. */
1683 struct sdata first_data
;
1686 /* Number of Lisp strings in a string_block structure. The 1020 is
1687 1024 minus malloc overhead. */
1689 #define STRING_BLOCK_SIZE \
1690 ((1020 - sizeof (struct string_block *)) / sizeof (struct Lisp_String))
1692 /* Structure describing a block from which Lisp_String structures
1697 /* Place `strings' first, to preserve alignment. */
1698 struct Lisp_String strings
[STRING_BLOCK_SIZE
];
1699 struct string_block
*next
;
1702 /* Head and tail of the list of sblock structures holding Lisp string
1703 data. We always allocate from current_sblock. The NEXT pointers
1704 in the sblock structures go from oldest_sblock to current_sblock. */
1706 static struct sblock
*oldest_sblock
, *current_sblock
;
1708 /* List of sblocks for large strings. */
1710 static struct sblock
*large_sblocks
;
1712 /* List of string_block structures. */
1714 static struct string_block
*string_blocks
;
1716 /* Free-list of Lisp_Strings. */
1718 static struct Lisp_String
*string_free_list
;
1720 /* Number of live and free Lisp_Strings. */
1722 static EMACS_INT total_strings
, total_free_strings
;
1724 /* Number of bytes used by live strings. */
1726 static EMACS_INT total_string_size
;
1728 /* Given a pointer to a Lisp_String S which is on the free-list
1729 string_free_list, return a pointer to its successor in the
1732 #define NEXT_FREE_LISP_STRING(S) (*(struct Lisp_String **) (S))
1734 /* Return a pointer to the sdata structure belonging to Lisp string S.
1735 S must be live, i.e. S->data must not be null. S->data is actually
1736 a pointer to the `u.data' member of its sdata structure; the
1737 structure starts at a constant offset in front of that. */
1739 #define SDATA_OF_STRING(S) ((struct sdata *) ((S)->data - SDATA_DATA_OFFSET))
1742 #ifdef GC_CHECK_STRING_OVERRUN
1744 /* We check for overrun in string data blocks by appending a small
1745 "cookie" after each allocated string data block, and check for the
1746 presence of this cookie during GC. */
1748 #define GC_STRING_OVERRUN_COOKIE_SIZE 4
1749 static char const string_overrun_cookie
[GC_STRING_OVERRUN_COOKIE_SIZE
] =
1750 { '\xde', '\xad', '\xbe', '\xef' };
1753 #define GC_STRING_OVERRUN_COOKIE_SIZE 0
1756 /* Value is the size of an sdata structure large enough to hold NBYTES
1757 bytes of string data. The value returned includes a terminating
1758 NUL byte, the size of the sdata structure, and padding. */
1760 #ifdef GC_CHECK_STRING_BYTES
1762 #define SDATA_SIZE(NBYTES) \
1763 ((SDATA_DATA_OFFSET \
1765 + sizeof (ptrdiff_t) - 1) \
1766 & ~(sizeof (ptrdiff_t) - 1))
1768 #else /* not GC_CHECK_STRING_BYTES */
1770 /* The 'max' reserves space for the nbytes union member even when NBYTES + 1 is
1771 less than the size of that member. The 'max' is not needed when
1772 SDATA_DATA_OFFSET is a multiple of sizeof (ptrdiff_t), because then the
1773 alignment code reserves enough space. */
1775 #define SDATA_SIZE(NBYTES) \
1776 ((SDATA_DATA_OFFSET \
1777 + (SDATA_DATA_OFFSET % sizeof (ptrdiff_t) == 0 \
1779 : max (NBYTES, sizeof (ptrdiff_t) - 1)) \
1781 + sizeof (ptrdiff_t) - 1) \
1782 & ~(sizeof (ptrdiff_t) - 1))
1784 #endif /* not GC_CHECK_STRING_BYTES */
1786 /* Extra bytes to allocate for each string. */
1788 #define GC_STRING_EXTRA (GC_STRING_OVERRUN_COOKIE_SIZE)
1790 /* Exact bound on the number of bytes in a string, not counting the
1791 terminating null. A string cannot contain more bytes than
1792 STRING_BYTES_BOUND, nor can it be so long that the size_t
1793 arithmetic in allocate_string_data would overflow while it is
1794 calculating a value to be passed to malloc. */
1795 #define STRING_BYTES_MAX \
1796 min (STRING_BYTES_BOUND, \
1797 ((SIZE_MAX - XMALLOC_OVERRUN_CHECK_OVERHEAD \
1799 - offsetof (struct sblock, first_data) \
1800 - SDATA_DATA_OFFSET) \
1801 & ~(sizeof (EMACS_INT) - 1)))
1803 /* Initialize string allocation. Called from init_alloc_once. */
1808 total_strings
= total_free_strings
= total_string_size
= 0;
1809 oldest_sblock
= current_sblock
= large_sblocks
= NULL
;
1810 string_blocks
= NULL
;
1811 string_free_list
= NULL
;
1812 empty_unibyte_string
= make_pure_string ("", 0, 0, 0);
1813 empty_multibyte_string
= make_pure_string ("", 0, 0, 1);
1817 #ifdef GC_CHECK_STRING_BYTES
1819 static int check_string_bytes_count
;
1821 #define CHECK_STRING_BYTES(S) STRING_BYTES (S)
1824 /* Like GC_STRING_BYTES, but with debugging check. */
1827 string_bytes (struct Lisp_String
*s
)
1830 (s
->size_byte
< 0 ? s
->size
& ~ARRAY_MARK_FLAG
: s
->size_byte
);
1832 if (!PURE_POINTER_P (s
)
1834 && nbytes
!= SDATA_NBYTES (SDATA_OF_STRING (s
)))
1839 /* Check validity of Lisp strings' string_bytes member in B. */
1842 check_sblock (struct sblock
*b
)
1844 struct sdata
*from
, *end
, *from_end
;
1848 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
1850 /* Compute the next FROM here because copying below may
1851 overwrite data we need to compute it. */
1854 /* Check that the string size recorded in the string is the
1855 same as the one recorded in the sdata structure. */
1857 CHECK_STRING_BYTES (from
->string
);
1860 nbytes
= GC_STRING_BYTES (from
->string
);
1862 nbytes
= SDATA_NBYTES (from
);
1864 nbytes
= SDATA_SIZE (nbytes
);
1865 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
1870 /* Check validity of Lisp strings' string_bytes member. ALL_P
1871 non-zero means check all strings, otherwise check only most
1872 recently allocated strings. Used for hunting a bug. */
1875 check_string_bytes (int all_p
)
1881 for (b
= large_sblocks
; b
; b
= b
->next
)
1883 struct Lisp_String
*s
= b
->first_data
.string
;
1885 CHECK_STRING_BYTES (s
);
1888 for (b
= oldest_sblock
; b
; b
= b
->next
)
1891 else if (current_sblock
)
1892 check_sblock (current_sblock
);
1895 #endif /* GC_CHECK_STRING_BYTES */
1897 #ifdef GC_CHECK_STRING_FREE_LIST
1899 /* Walk through the string free list looking for bogus next pointers.
1900 This may catch buffer overrun from a previous string. */
1903 check_string_free_list (void)
1905 struct Lisp_String
*s
;
1907 /* Pop a Lisp_String off the free-list. */
1908 s
= string_free_list
;
1911 if ((uintptr_t) s
< 1024)
1913 s
= NEXT_FREE_LISP_STRING (s
);
1917 #define check_string_free_list()
1920 /* Return a new Lisp_String. */
1922 static struct Lisp_String
*
1923 allocate_string (void)
1925 struct Lisp_String
*s
;
1927 /* eassert (!handling_signal); */
1931 /* If the free-list is empty, allocate a new string_block, and
1932 add all the Lisp_Strings in it to the free-list. */
1933 if (string_free_list
== NULL
)
1935 struct string_block
*b
;
1938 b
= (struct string_block
*) lisp_malloc (sizeof *b
, MEM_TYPE_STRING
);
1939 b
->next
= string_blocks
;
1942 for (i
= STRING_BLOCK_SIZE
- 1; i
>= 0; --i
)
1945 /* Every string on a free list should have NULL data pointer. */
1947 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
1948 string_free_list
= s
;
1951 total_free_strings
+= STRING_BLOCK_SIZE
;
1954 check_string_free_list ();
1956 /* Pop a Lisp_String off the free-list. */
1957 s
= string_free_list
;
1958 string_free_list
= NEXT_FREE_LISP_STRING (s
);
1960 MALLOC_UNBLOCK_INPUT
;
1962 --total_free_strings
;
1965 consing_since_gc
+= sizeof *s
;
1967 #ifdef GC_CHECK_STRING_BYTES
1968 if (!noninteractive
)
1970 if (++check_string_bytes_count
== 200)
1972 check_string_bytes_count
= 0;
1973 check_string_bytes (1);
1976 check_string_bytes (0);
1978 #endif /* GC_CHECK_STRING_BYTES */
1984 /* Set up Lisp_String S for holding NCHARS characters, NBYTES bytes,
1985 plus a NUL byte at the end. Allocate an sdata structure for S, and
1986 set S->data to its `u.data' member. Store a NUL byte at the end of
1987 S->data. Set S->size to NCHARS and S->size_byte to NBYTES. Free
1988 S->data if it was initially non-null. */
1991 allocate_string_data (struct Lisp_String
*s
,
1992 EMACS_INT nchars
, EMACS_INT nbytes
)
1998 if (STRING_BYTES_MAX
< nbytes
)
2001 /* Determine the number of bytes needed to store NBYTES bytes
2003 needed
= SDATA_SIZE (nbytes
);
2007 if (nbytes
> LARGE_STRING_BYTES
)
2009 size_t size
= offsetof (struct sblock
, first_data
) + needed
;
2011 #ifdef DOUG_LEA_MALLOC
2012 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
2013 because mapped region contents are not preserved in
2016 In case you think of allowing it in a dumped Emacs at the
2017 cost of not being able to re-dump, there's another reason:
2018 mmap'ed data typically have an address towards the top of the
2019 address space, which won't fit into an EMACS_INT (at least on
2020 32-bit systems with the current tagging scheme). --fx */
2021 mallopt (M_MMAP_MAX
, 0);
2024 b
= (struct sblock
*) lisp_malloc (size
+ GC_STRING_EXTRA
, MEM_TYPE_NON_LISP
);
2026 #ifdef DOUG_LEA_MALLOC
2027 /* Back to a reasonable maximum of mmap'ed areas. */
2028 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
2031 b
->next_free
= &b
->first_data
;
2032 b
->first_data
.string
= NULL
;
2033 b
->next
= large_sblocks
;
2036 else if (current_sblock
== NULL
2037 || (((char *) current_sblock
+ SBLOCK_SIZE
2038 - (char *) current_sblock
->next_free
)
2039 < (needed
+ GC_STRING_EXTRA
)))
2041 /* Not enough room in the current sblock. */
2042 b
= (struct sblock
*) lisp_malloc (SBLOCK_SIZE
, MEM_TYPE_NON_LISP
);
2043 b
->next_free
= &b
->first_data
;
2044 b
->first_data
.string
= NULL
;
2048 current_sblock
->next
= b
;
2056 data
= b
->next_free
;
2057 b
->next_free
= (struct sdata
*) ((char *) data
+ needed
+ GC_STRING_EXTRA
);
2059 MALLOC_UNBLOCK_INPUT
;
2062 s
->data
= SDATA_DATA (data
);
2063 #ifdef GC_CHECK_STRING_BYTES
2064 SDATA_NBYTES (data
) = nbytes
;
2067 s
->size_byte
= nbytes
;
2068 s
->data
[nbytes
] = '\0';
2069 #ifdef GC_CHECK_STRING_OVERRUN
2070 memcpy ((char *) data
+ needed
, string_overrun_cookie
,
2071 GC_STRING_OVERRUN_COOKIE_SIZE
);
2073 consing_since_gc
+= needed
;
2077 /* Sweep and compact strings. */
2080 sweep_strings (void)
2082 struct string_block
*b
, *next
;
2083 struct string_block
*live_blocks
= NULL
;
2085 string_free_list
= NULL
;
2086 total_strings
= total_free_strings
= 0;
2087 total_string_size
= 0;
2089 /* Scan strings_blocks, free Lisp_Strings that aren't marked. */
2090 for (b
= string_blocks
; b
; b
= next
)
2093 struct Lisp_String
*free_list_before
= string_free_list
;
2097 for (i
= 0; i
< STRING_BLOCK_SIZE
; ++i
)
2099 struct Lisp_String
*s
= b
->strings
+ i
;
2103 /* String was not on free-list before. */
2104 if (STRING_MARKED_P (s
))
2106 /* String is live; unmark it and its intervals. */
2109 if (!NULL_INTERVAL_P (s
->intervals
))
2110 UNMARK_BALANCE_INTERVALS (s
->intervals
);
2113 total_string_size
+= STRING_BYTES (s
);
2117 /* String is dead. Put it on the free-list. */
2118 struct sdata
*data
= SDATA_OF_STRING (s
);
2120 /* Save the size of S in its sdata so that we know
2121 how large that is. Reset the sdata's string
2122 back-pointer so that we know it's free. */
2123 #ifdef GC_CHECK_STRING_BYTES
2124 if (GC_STRING_BYTES (s
) != SDATA_NBYTES (data
))
2127 data
->u
.nbytes
= GC_STRING_BYTES (s
);
2129 data
->string
= NULL
;
2131 /* Reset the strings's `data' member so that we
2135 /* Put the string on the free-list. */
2136 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2137 string_free_list
= s
;
2143 /* S was on the free-list before. Put it there again. */
2144 NEXT_FREE_LISP_STRING (s
) = string_free_list
;
2145 string_free_list
= s
;
2150 /* Free blocks that contain free Lisp_Strings only, except
2151 the first two of them. */
2152 if (nfree
== STRING_BLOCK_SIZE
2153 && total_free_strings
> STRING_BLOCK_SIZE
)
2156 string_free_list
= free_list_before
;
2160 total_free_strings
+= nfree
;
2161 b
->next
= live_blocks
;
2166 check_string_free_list ();
2168 string_blocks
= live_blocks
;
2169 free_large_strings ();
2170 compact_small_strings ();
2172 check_string_free_list ();
2176 /* Free dead large strings. */
2179 free_large_strings (void)
2181 struct sblock
*b
, *next
;
2182 struct sblock
*live_blocks
= NULL
;
2184 for (b
= large_sblocks
; b
; b
= next
)
2188 if (b
->first_data
.string
== NULL
)
2192 b
->next
= live_blocks
;
2197 large_sblocks
= live_blocks
;
2201 /* Compact data of small strings. Free sblocks that don't contain
2202 data of live strings after compaction. */
2205 compact_small_strings (void)
2207 struct sblock
*b
, *tb
, *next
;
2208 struct sdata
*from
, *to
, *end
, *tb_end
;
2209 struct sdata
*to_end
, *from_end
;
2211 /* TB is the sblock we copy to, TO is the sdata within TB we copy
2212 to, and TB_END is the end of TB. */
2214 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2215 to
= &tb
->first_data
;
2217 /* Step through the blocks from the oldest to the youngest. We
2218 expect that old blocks will stabilize over time, so that less
2219 copying will happen this way. */
2220 for (b
= oldest_sblock
; b
; b
= b
->next
)
2223 eassert ((char *) end
<= (char *) b
+ SBLOCK_SIZE
);
2225 for (from
= &b
->first_data
; from
< end
; from
= from_end
)
2227 /* Compute the next FROM here because copying below may
2228 overwrite data we need to compute it. */
2231 #ifdef GC_CHECK_STRING_BYTES
2232 /* Check that the string size recorded in the string is the
2233 same as the one recorded in the sdata structure. */
2235 && GC_STRING_BYTES (from
->string
) != SDATA_NBYTES (from
))
2237 #endif /* GC_CHECK_STRING_BYTES */
2240 nbytes
= GC_STRING_BYTES (from
->string
);
2242 nbytes
= SDATA_NBYTES (from
);
2244 if (nbytes
> LARGE_STRING_BYTES
)
2247 nbytes
= SDATA_SIZE (nbytes
);
2248 from_end
= (struct sdata
*) ((char *) from
+ nbytes
+ GC_STRING_EXTRA
);
2250 #ifdef GC_CHECK_STRING_OVERRUN
2251 if (memcmp (string_overrun_cookie
,
2252 (char *) from_end
- GC_STRING_OVERRUN_COOKIE_SIZE
,
2253 GC_STRING_OVERRUN_COOKIE_SIZE
))
2257 /* FROM->string non-null means it's alive. Copy its data. */
2260 /* If TB is full, proceed with the next sblock. */
2261 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2262 if (to_end
> tb_end
)
2266 tb_end
= (struct sdata
*) ((char *) tb
+ SBLOCK_SIZE
);
2267 to
= &tb
->first_data
;
2268 to_end
= (struct sdata
*) ((char *) to
+ nbytes
+ GC_STRING_EXTRA
);
2271 /* Copy, and update the string's `data' pointer. */
2274 eassert (tb
!= b
|| to
< from
);
2275 memmove (to
, from
, nbytes
+ GC_STRING_EXTRA
);
2276 to
->string
->data
= SDATA_DATA (to
);
2279 /* Advance past the sdata we copied to. */
2285 /* The rest of the sblocks following TB don't contain live data, so
2286 we can free them. */
2287 for (b
= tb
->next
; b
; b
= next
)
2295 current_sblock
= tb
;
2299 string_overflow (void)
2301 error ("Maximum string size exceeded");
2304 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
2305 doc
: /* Return a newly created string of length LENGTH, with INIT in each element.
2306 LENGTH must be an integer.
2307 INIT must be an integer that represents a character. */)
2308 (Lisp_Object length
, Lisp_Object init
)
2310 register Lisp_Object val
;
2311 register unsigned char *p
, *end
;
2315 CHECK_NATNUM (length
);
2316 CHECK_CHARACTER (init
);
2318 c
= XFASTINT (init
);
2319 if (ASCII_CHAR_P (c
))
2321 nbytes
= XINT (length
);
2322 val
= make_uninit_string (nbytes
);
2324 end
= p
+ SCHARS (val
);
2330 unsigned char str
[MAX_MULTIBYTE_LENGTH
];
2331 int len
= CHAR_STRING (c
, str
);
2332 EMACS_INT string_len
= XINT (length
);
2334 if (string_len
> STRING_BYTES_MAX
/ len
)
2336 nbytes
= len
* string_len
;
2337 val
= make_uninit_multibyte_string (string_len
, nbytes
);
2342 memcpy (p
, str
, len
);
2352 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
2353 doc
: /* Return a new bool-vector of length LENGTH, using INIT for each element.
2354 LENGTH must be a number. INIT matters only in whether it is t or nil. */)
2355 (Lisp_Object length
, Lisp_Object init
)
2357 register Lisp_Object val
;
2358 struct Lisp_Bool_Vector
*p
;
2359 ptrdiff_t length_in_chars
;
2360 EMACS_INT length_in_elts
;
2363 CHECK_NATNUM (length
);
2365 bits_per_value
= sizeof (EMACS_INT
) * BOOL_VECTOR_BITS_PER_CHAR
;
2367 length_in_elts
= (XFASTINT (length
) + bits_per_value
- 1) / bits_per_value
;
2369 /* We must allocate one more elements than LENGTH_IN_ELTS for the
2370 slot `size' of the struct Lisp_Bool_Vector. */
2371 val
= Fmake_vector (make_number (length_in_elts
+ 1), Qnil
);
2373 /* No Lisp_Object to trace in there. */
2374 XSETPVECTYPESIZE (XVECTOR (val
), PVEC_BOOL_VECTOR
, 0);
2376 p
= XBOOL_VECTOR (val
);
2377 p
->size
= XFASTINT (length
);
2379 length_in_chars
= ((XFASTINT (length
) + BOOL_VECTOR_BITS_PER_CHAR
- 1)
2380 / BOOL_VECTOR_BITS_PER_CHAR
);
2381 if (length_in_chars
)
2383 memset (p
->data
, ! NILP (init
) ? -1 : 0, length_in_chars
);
2385 /* Clear any extraneous bits in the last byte. */
2386 p
->data
[length_in_chars
- 1]
2387 &= (1 << (XINT (length
) % BOOL_VECTOR_BITS_PER_CHAR
)) - 1;
2394 /* Make a string from NBYTES bytes at CONTENTS, and compute the number
2395 of characters from the contents. This string may be unibyte or
2396 multibyte, depending on the contents. */
2399 make_string (const char *contents
, ptrdiff_t nbytes
)
2401 register Lisp_Object val
;
2402 ptrdiff_t nchars
, multibyte_nbytes
;
2404 parse_str_as_multibyte ((const unsigned char *) contents
, nbytes
,
2405 &nchars
, &multibyte_nbytes
);
2406 if (nbytes
== nchars
|| nbytes
!= multibyte_nbytes
)
2407 /* CONTENTS contains no multibyte sequences or contains an invalid
2408 multibyte sequence. We must make unibyte string. */
2409 val
= make_unibyte_string (contents
, nbytes
);
2411 val
= make_multibyte_string (contents
, nchars
, nbytes
);
2416 /* Make an unibyte string from LENGTH bytes at CONTENTS. */
2419 make_unibyte_string (const char *contents
, ptrdiff_t length
)
2421 register Lisp_Object val
;
2422 val
= make_uninit_string (length
);
2423 memcpy (SDATA (val
), contents
, length
);
2428 /* Make a multibyte string from NCHARS characters occupying NBYTES
2429 bytes at CONTENTS. */
2432 make_multibyte_string (const char *contents
,
2433 ptrdiff_t nchars
, ptrdiff_t nbytes
)
2435 register Lisp_Object val
;
2436 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2437 memcpy (SDATA (val
), contents
, nbytes
);
2442 /* Make a string from NCHARS characters occupying NBYTES bytes at
2443 CONTENTS. It is a multibyte string if NBYTES != NCHARS. */
2446 make_string_from_bytes (const char *contents
,
2447 ptrdiff_t nchars
, ptrdiff_t nbytes
)
2449 register Lisp_Object val
;
2450 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2451 memcpy (SDATA (val
), contents
, nbytes
);
2452 if (SBYTES (val
) == SCHARS (val
))
2453 STRING_SET_UNIBYTE (val
);
2458 /* Make a string from NCHARS characters occupying NBYTES bytes at
2459 CONTENTS. The argument MULTIBYTE controls whether to label the
2460 string as multibyte. If NCHARS is negative, it counts the number of
2461 characters by itself. */
2464 make_specified_string (const char *contents
,
2465 ptrdiff_t nchars
, ptrdiff_t nbytes
, int multibyte
)
2467 register Lisp_Object val
;
2472 nchars
= multibyte_chars_in_text ((const unsigned char *) contents
,
2477 val
= make_uninit_multibyte_string (nchars
, nbytes
);
2478 memcpy (SDATA (val
), contents
, nbytes
);
2480 STRING_SET_UNIBYTE (val
);
2485 /* Return an unibyte Lisp_String set up to hold LENGTH characters
2486 occupying LENGTH bytes. */
2489 make_uninit_string (EMACS_INT length
)
2494 return empty_unibyte_string
;
2495 val
= make_uninit_multibyte_string (length
, length
);
2496 STRING_SET_UNIBYTE (val
);
2501 /* Return a multibyte Lisp_String set up to hold NCHARS characters
2502 which occupy NBYTES bytes. */
2505 make_uninit_multibyte_string (EMACS_INT nchars
, EMACS_INT nbytes
)
2508 struct Lisp_String
*s
;
2513 return empty_multibyte_string
;
2515 s
= allocate_string ();
2516 s
->intervals
= NULL_INTERVAL
;
2517 allocate_string_data (s
, nchars
, nbytes
);
2518 XSETSTRING (string
, s
);
2519 string_chars_consed
+= nbytes
;
2525 /***********************************************************************
2527 ***********************************************************************/
2529 /* We store float cells inside of float_blocks, allocating a new
2530 float_block with malloc whenever necessary. Float cells reclaimed
2531 by GC are put on a free list to be reallocated before allocating
2532 any new float cells from the latest float_block. */
2534 #define FLOAT_BLOCK_SIZE \
2535 (((BLOCK_BYTES - sizeof (struct float_block *) \
2536 /* The compiler might add padding at the end. */ \
2537 - (sizeof (struct Lisp_Float) - sizeof (int))) * CHAR_BIT) \
2538 / (sizeof (struct Lisp_Float) * CHAR_BIT + 1))
2540 #define GETMARKBIT(block,n) \
2541 (((block)->gcmarkbits[(n) / (sizeof (int) * CHAR_BIT)] \
2542 >> ((n) % (sizeof (int) * CHAR_BIT))) \
2545 #define SETMARKBIT(block,n) \
2546 (block)->gcmarkbits[(n) / (sizeof (int) * CHAR_BIT)] \
2547 |= 1 << ((n) % (sizeof (int) * CHAR_BIT))
2549 #define UNSETMARKBIT(block,n) \
2550 (block)->gcmarkbits[(n) / (sizeof (int) * CHAR_BIT)] \
2551 &= ~(1 << ((n) % (sizeof (int) * CHAR_BIT)))
2553 #define FLOAT_BLOCK(fptr) \
2554 ((struct float_block *) (((uintptr_t) (fptr)) & ~(BLOCK_ALIGN - 1)))
2556 #define FLOAT_INDEX(fptr) \
2557 ((((uintptr_t) (fptr)) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Float))
2561 /* Place `floats' at the beginning, to ease up FLOAT_INDEX's job. */
2562 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
2563 int gcmarkbits
[1 + FLOAT_BLOCK_SIZE
/ (sizeof (int) * CHAR_BIT
)];
2564 struct float_block
*next
;
2567 #define FLOAT_MARKED_P(fptr) \
2568 GETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2570 #define FLOAT_MARK(fptr) \
2571 SETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2573 #define FLOAT_UNMARK(fptr) \
2574 UNSETMARKBIT (FLOAT_BLOCK (fptr), FLOAT_INDEX ((fptr)))
2576 /* Current float_block. */
2578 static struct float_block
*float_block
;
2580 /* Index of first unused Lisp_Float in the current float_block. */
2582 static int float_block_index
;
2584 /* Free-list of Lisp_Floats. */
2586 static struct Lisp_Float
*float_free_list
;
2589 /* Initialize float allocation. */
2595 float_block_index
= FLOAT_BLOCK_SIZE
; /* Force alloc of new float_block. */
2596 float_free_list
= 0;
2600 /* Return a new float object with value FLOAT_VALUE. */
2603 make_float (double float_value
)
2605 register Lisp_Object val
;
2607 /* eassert (!handling_signal); */
2611 if (float_free_list
)
2613 /* We use the data field for chaining the free list
2614 so that we won't use the same field that has the mark bit. */
2615 XSETFLOAT (val
, float_free_list
);
2616 float_free_list
= float_free_list
->u
.chain
;
2620 if (float_block_index
== FLOAT_BLOCK_SIZE
)
2622 register struct float_block
*new;
2624 new = (struct float_block
*) lisp_align_malloc (sizeof *new,
2626 new->next
= float_block
;
2627 memset (new->gcmarkbits
, 0, sizeof new->gcmarkbits
);
2629 float_block_index
= 0;
2631 XSETFLOAT (val
, &float_block
->floats
[float_block_index
]);
2632 float_block_index
++;
2635 MALLOC_UNBLOCK_INPUT
;
2637 XFLOAT_INIT (val
, float_value
);
2638 eassert (!FLOAT_MARKED_P (XFLOAT (val
)));
2639 consing_since_gc
+= sizeof (struct Lisp_Float
);
2646 /***********************************************************************
2648 ***********************************************************************/
2650 /* We store cons cells inside of cons_blocks, allocating a new
2651 cons_block with malloc whenever necessary. Cons cells reclaimed by
2652 GC are put on a free list to be reallocated before allocating
2653 any new cons cells from the latest cons_block. */
2655 #define CONS_BLOCK_SIZE \
2656 (((BLOCK_BYTES - sizeof (struct cons_block *) \
2657 /* The compiler might add padding at the end. */ \
2658 - (sizeof (struct Lisp_Cons) - sizeof (int))) * CHAR_BIT) \
2659 / (sizeof (struct Lisp_Cons) * CHAR_BIT + 1))
2661 #define CONS_BLOCK(fptr) \
2662 ((struct cons_block *) ((uintptr_t) (fptr) & ~(BLOCK_ALIGN - 1)))
2664 #define CONS_INDEX(fptr) \
2665 (((uintptr_t) (fptr) & (BLOCK_ALIGN - 1)) / sizeof (struct Lisp_Cons))
2669 /* Place `conses' at the beginning, to ease up CONS_INDEX's job. */
2670 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
2671 int gcmarkbits
[1 + CONS_BLOCK_SIZE
/ (sizeof (int) * CHAR_BIT
)];
2672 struct cons_block
*next
;
2675 #define CONS_MARKED_P(fptr) \
2676 GETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2678 #define CONS_MARK(fptr) \
2679 SETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2681 #define CONS_UNMARK(fptr) \
2682 UNSETMARKBIT (CONS_BLOCK (fptr), CONS_INDEX ((fptr)))
2684 /* Current cons_block. */
2686 static struct cons_block
*cons_block
;
2688 /* Index of first unused Lisp_Cons in the current block. */
2690 static int cons_block_index
;
2692 /* Free-list of Lisp_Cons structures. */
2694 static struct Lisp_Cons
*cons_free_list
;
2697 /* Initialize cons allocation. */
2703 cons_block_index
= CONS_BLOCK_SIZE
; /* Force alloc of new cons_block. */
2708 /* Explicitly free a cons cell by putting it on the free-list. */
2711 free_cons (struct Lisp_Cons
*ptr
)
2713 ptr
->u
.chain
= cons_free_list
;
2717 cons_free_list
= ptr
;
2720 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
2721 doc
: /* Create a new cons, give it CAR and CDR as components, and return it. */)
2722 (Lisp_Object car
, Lisp_Object cdr
)
2724 register Lisp_Object val
;
2726 /* eassert (!handling_signal); */
2732 /* We use the cdr for chaining the free list
2733 so that we won't use the same field that has the mark bit. */
2734 XSETCONS (val
, cons_free_list
);
2735 cons_free_list
= cons_free_list
->u
.chain
;
2739 if (cons_block_index
== CONS_BLOCK_SIZE
)
2741 register struct cons_block
*new;
2742 new = (struct cons_block
*) lisp_align_malloc (sizeof *new,
2744 memset (new->gcmarkbits
, 0, sizeof new->gcmarkbits
);
2745 new->next
= cons_block
;
2747 cons_block_index
= 0;
2749 XSETCONS (val
, &cons_block
->conses
[cons_block_index
]);
2753 MALLOC_UNBLOCK_INPUT
;
2757 eassert (!CONS_MARKED_P (XCONS (val
)));
2758 consing_since_gc
+= sizeof (struct Lisp_Cons
);
2759 cons_cells_consed
++;
2763 #ifdef GC_CHECK_CONS_LIST
2764 /* Get an error now if there's any junk in the cons free list. */
2766 check_cons_list (void)
2768 struct Lisp_Cons
*tail
= cons_free_list
;
2771 tail
= tail
->u
.chain
;
2775 /* Make a list of 1, 2, 3, 4 or 5 specified objects. */
2778 list1 (Lisp_Object arg1
)
2780 return Fcons (arg1
, Qnil
);
2784 list2 (Lisp_Object arg1
, Lisp_Object arg2
)
2786 return Fcons (arg1
, Fcons (arg2
, Qnil
));
2791 list3 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
)
2793 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Qnil
)));
2798 list4 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
, Lisp_Object arg4
)
2800 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
, Qnil
))));
2805 list5 (Lisp_Object arg1
, Lisp_Object arg2
, Lisp_Object arg3
, Lisp_Object arg4
, Lisp_Object arg5
)
2807 return Fcons (arg1
, Fcons (arg2
, Fcons (arg3
, Fcons (arg4
,
2808 Fcons (arg5
, Qnil
)))));
2812 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
2813 doc
: /* Return a newly created list with specified arguments as elements.
2814 Any number of arguments, even zero arguments, are allowed.
2815 usage: (list &rest OBJECTS) */)
2816 (ptrdiff_t nargs
, Lisp_Object
*args
)
2818 register Lisp_Object val
;
2824 val
= Fcons (args
[nargs
], val
);
2830 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
2831 doc
: /* Return a newly created list of length LENGTH, with each element being INIT. */)
2832 (register Lisp_Object length
, Lisp_Object init
)
2834 register Lisp_Object val
;
2835 register EMACS_INT size
;
2837 CHECK_NATNUM (length
);
2838 size
= XFASTINT (length
);
2843 val
= Fcons (init
, val
);
2848 val
= Fcons (init
, val
);
2853 val
= Fcons (init
, val
);
2858 val
= Fcons (init
, val
);
2863 val
= Fcons (init
, val
);
2878 /***********************************************************************
2880 ***********************************************************************/
2882 /* This value is balanced well enough to avoid too much internal overhead
2883 for the most common cases; it's not required to be a power of two, but
2884 it's expected to be a mult-of-ROUNDUP_SIZE (see below). */
2886 #define VECTOR_BLOCK_SIZE 4096
2888 /* Handy constants for vectorlike objects. */
2891 header_size
= offsetof (struct Lisp_Vector
, contents
),
2892 word_size
= sizeof (Lisp_Object
),
2893 roundup_size
= COMMON_MULTIPLE (sizeof (Lisp_Object
),
2894 USE_LSB_TAG
? 1 << GCTYPEBITS
: 1)
2897 /* ROUNDUP_SIZE must be a power of 2. */
2898 verify ((roundup_size
& (roundup_size
- 1)) == 0);
2900 /* Verify assumptions described above. */
2901 verify ((VECTOR_BLOCK_SIZE
% roundup_size
) == 0);
2902 verify (VECTOR_BLOCK_SIZE
<= (1 << PSEUDOVECTOR_SIZE_BITS
));
2904 /* Round up X to nearest mult-of-ROUNDUP_SIZE. */
2906 #define vroundup(x) (((x) + (roundup_size - 1)) & ~(roundup_size - 1))
2908 /* Rounding helps to maintain alignment constraints if USE_LSB_TAG. */
2910 #define VECTOR_BLOCK_BYTES (VECTOR_BLOCK_SIZE - vroundup (sizeof (void *)))
2912 /* Size of the minimal vector allocated from block. */
2914 #define VBLOCK_BYTES_MIN vroundup (sizeof (struct Lisp_Vector))
2916 /* Size of the largest vector allocated from block. */
2918 #define VBLOCK_BYTES_MAX \
2919 vroundup ((VECTOR_BLOCK_BYTES / 2) - sizeof (Lisp_Object))
2921 /* We maintain one free list for each possible block-allocated
2922 vector size, and this is the number of free lists we have. */
2924 #define VECTOR_MAX_FREE_LIST_INDEX \
2925 ((VECTOR_BLOCK_BYTES - VBLOCK_BYTES_MIN) / roundup_size + 1)
2927 /* Common shortcut to advance vector pointer over a block data. */
2929 #define ADVANCE(v, nbytes) ((struct Lisp_Vector *) ((char *) (v) + (nbytes)))
2931 /* Common shortcut to calculate NBYTES-vector index in VECTOR_FREE_LISTS. */
2933 #define VINDEX(nbytes) (((nbytes) - VBLOCK_BYTES_MIN) / roundup_size)
2935 /* Common shortcut to setup vector on a free list. */
2937 #define SETUP_ON_FREE_LIST(v, nbytes, index) \
2939 XSETPVECTYPESIZE (v, PVEC_FREE, nbytes); \
2940 eassert ((nbytes) % roundup_size == 0); \
2941 (index) = VINDEX (nbytes); \
2942 eassert ((index) < VECTOR_MAX_FREE_LIST_INDEX); \
2943 (v)->header.next.vector = vector_free_lists[index]; \
2944 vector_free_lists[index] = (v); \
2949 char data
[VECTOR_BLOCK_BYTES
];
2950 struct vector_block
*next
;
2953 /* Chain of vector blocks. */
2955 static struct vector_block
*vector_blocks
;
2957 /* Vector free lists, where NTH item points to a chain of free
2958 vectors of the same NBYTES size, so NTH == VINDEX (NBYTES). */
2960 static struct Lisp_Vector
*vector_free_lists
[VECTOR_MAX_FREE_LIST_INDEX
];
2962 /* Singly-linked list of large vectors. */
2964 static struct Lisp_Vector
*large_vectors
;
2966 /* The only vector with 0 slots, allocated from pure space. */
2968 static struct Lisp_Vector
*zero_vector
;
2970 /* Get a new vector block. */
2972 static struct vector_block
*
2973 allocate_vector_block (void)
2975 struct vector_block
*block
= xmalloc (sizeof (struct vector_block
));
2977 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
2978 mem_insert (block
->data
, block
->data
+ VECTOR_BLOCK_BYTES
,
2979 MEM_TYPE_VECTOR_BLOCK
);
2982 block
->next
= vector_blocks
;
2983 vector_blocks
= block
;
2987 /* Called once to initialize vector allocation. */
2992 zero_vector
= pure_alloc (header_size
, Lisp_Vectorlike
);
2993 zero_vector
->header
.size
= 0;
2996 /* Allocate vector from a vector block. */
2998 static struct Lisp_Vector
*
2999 allocate_vector_from_block (size_t nbytes
)
3001 struct Lisp_Vector
*vector
, *rest
;
3002 struct vector_block
*block
;
3003 size_t index
, restbytes
;
3005 eassert (VBLOCK_BYTES_MIN
<= nbytes
&& nbytes
<= VBLOCK_BYTES_MAX
);
3006 eassert (nbytes
% roundup_size
== 0);
3008 /* First, try to allocate from a free list
3009 containing vectors of the requested size. */
3010 index
= VINDEX (nbytes
);
3011 if (vector_free_lists
[index
])
3013 vector
= vector_free_lists
[index
];
3014 vector_free_lists
[index
] = vector
->header
.next
.vector
;
3015 vector
->header
.next
.nbytes
= nbytes
;
3019 /* Next, check free lists containing larger vectors. Since
3020 we will split the result, we should have remaining space
3021 large enough to use for one-slot vector at least. */
3022 for (index
= VINDEX (nbytes
+ VBLOCK_BYTES_MIN
);
3023 index
< VECTOR_MAX_FREE_LIST_INDEX
; index
++)
3024 if (vector_free_lists
[index
])
3026 /* This vector is larger than requested. */
3027 vector
= vector_free_lists
[index
];
3028 vector_free_lists
[index
] = vector
->header
.next
.vector
;
3029 vector
->header
.next
.nbytes
= nbytes
;
3031 /* Excess bytes are used for the smaller vector,
3032 which should be set on an appropriate free list. */
3033 restbytes
= index
* roundup_size
+ VBLOCK_BYTES_MIN
- nbytes
;
3034 eassert (restbytes
% roundup_size
== 0);
3035 rest
= ADVANCE (vector
, nbytes
);
3036 SETUP_ON_FREE_LIST (rest
, restbytes
, index
);
3040 /* Finally, need a new vector block. */
3041 block
= allocate_vector_block ();
3043 /* New vector will be at the beginning of this block. */
3044 vector
= (struct Lisp_Vector
*) block
->data
;
3045 vector
->header
.next
.nbytes
= nbytes
;
3047 /* If the rest of space from this block is large enough
3048 for one-slot vector at least, set up it on a free list. */
3049 restbytes
= VECTOR_BLOCK_BYTES
- nbytes
;
3050 if (restbytes
>= VBLOCK_BYTES_MIN
)
3052 eassert (restbytes
% roundup_size
== 0);
3053 rest
= ADVANCE (vector
, nbytes
);
3054 SETUP_ON_FREE_LIST (rest
, restbytes
, index
);
3059 /* Return how many Lisp_Objects can be stored in V. */
3061 #define VECTOR_SIZE(v) ((v)->header.size & PSEUDOVECTOR_FLAG ? \
3062 (PSEUDOVECTOR_SIZE_MASK & (v)->header.size) : \
3065 /* Nonzero if VECTOR pointer is valid pointer inside BLOCK. */
3067 #define VECTOR_IN_BLOCK(vector, block) \
3068 ((char *) (vector) <= (block)->data \
3069 + VECTOR_BLOCK_BYTES - VBLOCK_BYTES_MIN)
3071 /* Number of bytes used by vector-block-allocated object. This is the only
3072 place where we actually use the `nbytes' field of the vector-header.
3073 I.e. we could get rid of the `nbytes' field by computing it based on the
3076 #define PSEUDOVECTOR_NBYTES(vector) \
3077 (PSEUDOVECTOR_TYPEP (&vector->header, PVEC_FREE) \
3078 ? vector->header.size & PSEUDOVECTOR_SIZE_MASK \
3079 : vector->header.next.nbytes)
3081 /* Reclaim space used by unmarked vectors. */
3084 sweep_vectors (void)
3086 struct vector_block
*block
= vector_blocks
, **bprev
= &vector_blocks
;
3087 struct Lisp_Vector
*vector
, *next
, **vprev
= &large_vectors
;
3089 total_vector_size
= 0;
3090 memset (vector_free_lists
, 0, sizeof (vector_free_lists
));
3092 /* Looking through vector blocks. */
3094 for (block
= vector_blocks
; block
; block
= *bprev
)
3096 int free_this_block
= 0;
3098 for (vector
= (struct Lisp_Vector
*) block
->data
;
3099 VECTOR_IN_BLOCK (vector
, block
); vector
= next
)
3101 if (VECTOR_MARKED_P (vector
))
3103 VECTOR_UNMARK (vector
);
3104 total_vector_size
+= VECTOR_SIZE (vector
);
3105 next
= ADVANCE (vector
, vector
->header
.next
.nbytes
);
3109 ptrdiff_t nbytes
= PSEUDOVECTOR_NBYTES (vector
);
3110 ptrdiff_t total_bytes
= nbytes
;
3112 next
= ADVANCE (vector
, nbytes
);
3114 /* While NEXT is not marked, try to coalesce with VECTOR,
3115 thus making VECTOR of the largest possible size. */
3117 while (VECTOR_IN_BLOCK (next
, block
))
3119 if (VECTOR_MARKED_P (next
))
3121 nbytes
= PSEUDOVECTOR_NBYTES (next
);
3122 total_bytes
+= nbytes
;
3123 next
= ADVANCE (next
, nbytes
);
3126 eassert (total_bytes
% roundup_size
== 0);
3128 if (vector
== (struct Lisp_Vector
*) block
->data
3129 && !VECTOR_IN_BLOCK (next
, block
))
3130 /* This block should be freed because all of it's
3131 space was coalesced into the only free vector. */
3132 free_this_block
= 1;
3136 SETUP_ON_FREE_LIST (vector
, total_bytes
, tmp
);
3141 if (free_this_block
)
3143 *bprev
= block
->next
;
3144 #if GC_MARK_STACK && !defined GC_MALLOC_CHECK
3145 mem_delete (mem_find (block
->data
));
3150 bprev
= &block
->next
;
3153 /* Sweep large vectors. */
3155 for (vector
= large_vectors
; vector
; vector
= *vprev
)
3157 if (VECTOR_MARKED_P (vector
))
3159 VECTOR_UNMARK (vector
);
3160 total_vector_size
+= VECTOR_SIZE (vector
);
3161 vprev
= &vector
->header
.next
.vector
;
3165 *vprev
= vector
->header
.next
.vector
;
3171 /* Value is a pointer to a newly allocated Lisp_Vector structure
3172 with room for LEN Lisp_Objects. */
3174 static struct Lisp_Vector
*
3175 allocate_vectorlike (ptrdiff_t len
)
3177 struct Lisp_Vector
*p
;
3181 /* This gets triggered by code which I haven't bothered to fix. --Stef */
3182 /* eassert (!handling_signal); */
3188 size_t nbytes
= header_size
+ len
* word_size
;
3190 #ifdef DOUG_LEA_MALLOC
3191 /* Prevent mmap'ing the chunk. Lisp data may not be mmap'ed
3192 because mapped region contents are not preserved in
3194 mallopt (M_MMAP_MAX
, 0);
3197 if (nbytes
<= VBLOCK_BYTES_MAX
)
3198 p
= allocate_vector_from_block (vroundup (nbytes
));
3201 p
= (struct Lisp_Vector
*) lisp_malloc (nbytes
, MEM_TYPE_VECTORLIKE
);
3202 p
->header
.next
.vector
= large_vectors
;
3206 #ifdef DOUG_LEA_MALLOC
3207 /* Back to a reasonable maximum of mmap'ed areas. */
3208 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
);
3211 consing_since_gc
+= nbytes
;
3212 vector_cells_consed
+= len
;
3215 MALLOC_UNBLOCK_INPUT
;
3221 /* Allocate a vector with LEN slots. */
3223 struct Lisp_Vector
*
3224 allocate_vector (EMACS_INT len
)
3226 struct Lisp_Vector
*v
;
3227 ptrdiff_t nbytes_max
= min (PTRDIFF_MAX
, SIZE_MAX
);
3229 if (min ((nbytes_max
- header_size
) / word_size
, MOST_POSITIVE_FIXNUM
) < len
)
3230 memory_full (SIZE_MAX
);
3231 v
= allocate_vectorlike (len
);
3232 v
->header
.size
= len
;
3237 /* Allocate other vector-like structures. */
3239 struct Lisp_Vector
*
3240 allocate_pseudovector (int memlen
, int lisplen
, int tag
)
3242 struct Lisp_Vector
*v
= allocate_vectorlike (memlen
);
3245 /* Only the first lisplen slots will be traced normally by the GC. */
3246 for (i
= 0; i
< lisplen
; ++i
)
3247 v
->contents
[i
] = Qnil
;
3249 XSETPVECTYPESIZE (v
, tag
, lisplen
);
3254 allocate_buffer (void)
3256 struct buffer
*b
= lisp_malloc (sizeof (struct buffer
), MEM_TYPE_BUFFER
);
3258 XSETPVECTYPESIZE (b
, PVEC_BUFFER
, (offsetof (struct buffer
, own_text
)
3259 - header_size
) / word_size
);
3260 /* Note that the fields of B are not initialized. */
3264 struct Lisp_Hash_Table
*
3265 allocate_hash_table (void)
3267 return ALLOCATE_PSEUDOVECTOR (struct Lisp_Hash_Table
, count
, PVEC_HASH_TABLE
);
3271 allocate_window (void)
3275 w
= ALLOCATE_PSEUDOVECTOR (struct window
, current_matrix
, PVEC_WINDOW
);
3276 /* Users assumes that non-Lisp data is zeroed. */
3277 memset (&w
->current_matrix
, 0,
3278 sizeof (*w
) - offsetof (struct window
, current_matrix
));
3283 allocate_terminal (void)
3287 t
= ALLOCATE_PSEUDOVECTOR (struct terminal
, next_terminal
, PVEC_TERMINAL
);
3288 /* Users assumes that non-Lisp data is zeroed. */
3289 memset (&t
->next_terminal
, 0,
3290 sizeof (*t
) - offsetof (struct terminal
, next_terminal
));
3295 allocate_frame (void)
3299 f
= ALLOCATE_PSEUDOVECTOR (struct frame
, face_cache
, PVEC_FRAME
);
3300 /* Users assumes that non-Lisp data is zeroed. */
3301 memset (&f
->face_cache
, 0,
3302 sizeof (*f
) - offsetof (struct frame
, face_cache
));
3306 struct Lisp_Process
*
3307 allocate_process (void)
3309 struct Lisp_Process
*p
;
3311 p
= ALLOCATE_PSEUDOVECTOR (struct Lisp_Process
, pid
, PVEC_PROCESS
);
3312 /* Users assumes that non-Lisp data is zeroed. */
3314 sizeof (*p
) - offsetof (struct Lisp_Process
, pid
));
3318 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
3319 doc
: /* Return a newly created vector of length LENGTH, with each element being INIT.
3320 See also the function `vector'. */)
3321 (register Lisp_Object length
, Lisp_Object init
)
3324 register ptrdiff_t sizei
;
3325 register ptrdiff_t i
;
3326 register struct Lisp_Vector
*p
;
3328 CHECK_NATNUM (length
);
3330 p
= allocate_vector (XFASTINT (length
));
3331 sizei
= XFASTINT (length
);
3332 for (i
= 0; i
< sizei
; i
++)
3333 p
->contents
[i
] = init
;
3335 XSETVECTOR (vector
, p
);
3340 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
3341 doc
: /* Return a newly created vector with specified arguments as elements.
3342 Any number of arguments, even zero arguments, are allowed.
3343 usage: (vector &rest OBJECTS) */)
3344 (ptrdiff_t nargs
, Lisp_Object
*args
)
3346 register Lisp_Object len
, val
;
3348 register struct Lisp_Vector
*p
;
3350 XSETFASTINT (len
, nargs
);
3351 val
= Fmake_vector (len
, Qnil
);
3353 for (i
= 0; i
< nargs
; i
++)
3354 p
->contents
[i
] = args
[i
];
3359 make_byte_code (struct Lisp_Vector
*v
)
3361 if (v
->header
.size
> 1 && STRINGP (v
->contents
[1])
3362 && STRING_MULTIBYTE (v
->contents
[1]))
3363 /* BYTECODE-STRING must have been produced by Emacs 20.2 or the
3364 earlier because they produced a raw 8-bit string for byte-code
3365 and now such a byte-code string is loaded as multibyte while
3366 raw 8-bit characters converted to multibyte form. Thus, now we
3367 must convert them back to the original unibyte form. */
3368 v
->contents
[1] = Fstring_as_unibyte (v
->contents
[1]);
3369 XSETPVECTYPE (v
, PVEC_COMPILED
);
3372 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
3373 doc
: /* Create a byte-code object with specified arguments as elements.
3374 The arguments should be the ARGLIST, bytecode-string BYTE-CODE, constant
3375 vector CONSTANTS, maximum stack size DEPTH, (optional) DOCSTRING,
3376 and (optional) INTERACTIVE-SPEC.
3377 The first four arguments are required; at most six have any
3379 The ARGLIST can be either like the one of `lambda', in which case the arguments
3380 will be dynamically bound before executing the byte code, or it can be an
3381 integer of the form NNNNNNNRMMMMMMM where the 7bit MMMMMMM specifies the
3382 minimum number of arguments, the 7-bit NNNNNNN specifies the maximum number
3383 of arguments (ignoring &rest) and the R bit specifies whether there is a &rest
3384 argument to catch the left-over arguments. If such an integer is used, the
3385 arguments will not be dynamically bound but will be instead pushed on the
3386 stack before executing the byte-code.
3387 usage: (make-byte-code ARGLIST BYTE-CODE CONSTANTS DEPTH &optional DOCSTRING INTERACTIVE-SPEC &rest ELEMENTS) */)
3388 (ptrdiff_t nargs
, Lisp_Object
*args
)
3390 register Lisp_Object len
, val
;
3392 register struct Lisp_Vector
*p
;
3394 /* We used to purecopy everything here, if purify-flga was set. This worked
3395 OK for Emacs-23, but with Emacs-24's lexical binding code, it can be
3396 dangerous, since make-byte-code is used during execution to build
3397 closures, so any closure built during the preload phase would end up
3398 copied into pure space, including its free variables, which is sometimes
3399 just wasteful and other times plainly wrong (e.g. those free vars may want
3402 XSETFASTINT (len
, nargs
);
3403 val
= Fmake_vector (len
, Qnil
);
3406 for (i
= 0; i
< nargs
; i
++)
3407 p
->contents
[i
] = args
[i
];
3409 XSETCOMPILED (val
, p
);
3415 /***********************************************************************
3417 ***********************************************************************/
3419 /* Like struct Lisp_Symbol, but padded so that the size is a multiple
3420 of the required alignment if LSB tags are used. */
3422 union aligned_Lisp_Symbol
3424 struct Lisp_Symbol s
;
3426 unsigned char c
[(sizeof (struct Lisp_Symbol
) + (1 << GCTYPEBITS
) - 1)
3427 & -(1 << GCTYPEBITS
)];
3431 /* Each symbol_block is just under 1020 bytes long, since malloc
3432 really allocates in units of powers of two and uses 4 bytes for its
3435 #define SYMBOL_BLOCK_SIZE \
3436 ((1020 - sizeof (struct symbol_block *)) / sizeof (union aligned_Lisp_Symbol))
3440 /* Place `symbols' first, to preserve alignment. */
3441 union aligned_Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
3442 struct symbol_block
*next
;
3445 /* Current symbol block and index of first unused Lisp_Symbol
3448 static struct symbol_block
*symbol_block
;
3449 static int symbol_block_index
;
3451 /* List of free symbols. */
3453 static struct Lisp_Symbol
*symbol_free_list
;
3456 /* Initialize symbol allocation. */
3461 symbol_block
= NULL
;
3462 symbol_block_index
= SYMBOL_BLOCK_SIZE
;
3463 symbol_free_list
= 0;
3467 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
3468 doc
: /* Return a newly allocated uninterned symbol whose name is NAME.
3469 Its value and function definition are void, and its property list is nil. */)
3472 register Lisp_Object val
;
3473 register struct Lisp_Symbol
*p
;
3475 CHECK_STRING (name
);
3477 /* eassert (!handling_signal); */
3481 if (symbol_free_list
)
3483 XSETSYMBOL (val
, symbol_free_list
);
3484 symbol_free_list
= symbol_free_list
->next
;
3488 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
3490 struct symbol_block
*new;
3491 new = (struct symbol_block
*) lisp_malloc (sizeof *new,
3493 new->next
= symbol_block
;
3495 symbol_block_index
= 0;
3497 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
].s
);
3498 symbol_block_index
++;
3501 MALLOC_UNBLOCK_INPUT
;
3506 p
->redirect
= SYMBOL_PLAINVAL
;
3507 SET_SYMBOL_VAL (p
, Qunbound
);
3508 p
->function
= Qunbound
;
3511 p
->interned
= SYMBOL_UNINTERNED
;
3513 p
->declared_special
= 0;
3514 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
3521 /***********************************************************************
3522 Marker (Misc) Allocation
3523 ***********************************************************************/
3525 /* Like union Lisp_Misc, but padded so that its size is a multiple of
3526 the required alignment when LSB tags are used. */
3528 union aligned_Lisp_Misc
3532 unsigned char c
[(sizeof (union Lisp_Misc
) + (1 << GCTYPEBITS
) - 1)
3533 & -(1 << GCTYPEBITS
)];
3537 /* Allocation of markers and other objects that share that structure.
3538 Works like allocation of conses. */
3540 #define MARKER_BLOCK_SIZE \
3541 ((1020 - sizeof (struct marker_block *)) / sizeof (union aligned_Lisp_Misc))
3545 /* Place `markers' first, to preserve alignment. */
3546 union aligned_Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
3547 struct marker_block
*next
;
3550 static struct marker_block
*marker_block
;
3551 static int marker_block_index
;
3553 static union Lisp_Misc
*marker_free_list
;
3558 marker_block
= NULL
;
3559 marker_block_index
= MARKER_BLOCK_SIZE
;
3560 marker_free_list
= 0;
3563 /* Return a newly allocated Lisp_Misc object, with no substructure. */
3566 allocate_misc (void)
3570 /* eassert (!handling_signal); */
3574 if (marker_free_list
)
3576 XSETMISC (val
, marker_free_list
);
3577 marker_free_list
= marker_free_list
->u_free
.chain
;
3581 if (marker_block_index
== MARKER_BLOCK_SIZE
)
3583 struct marker_block
*new;
3584 new = (struct marker_block
*) lisp_malloc (sizeof *new,
3586 new->next
= marker_block
;
3588 marker_block_index
= 0;
3589 total_free_markers
+= MARKER_BLOCK_SIZE
;
3591 XSETMISC (val
, &marker_block
->markers
[marker_block_index
].m
);
3592 marker_block_index
++;
3595 MALLOC_UNBLOCK_INPUT
;
3597 --total_free_markers
;
3598 consing_since_gc
+= sizeof (union Lisp_Misc
);
3599 misc_objects_consed
++;
3600 XMISCANY (val
)->gcmarkbit
= 0;
3604 /* Free a Lisp_Misc object */
3607 free_misc (Lisp_Object misc
)
3609 XMISCTYPE (misc
) = Lisp_Misc_Free
;
3610 XMISC (misc
)->u_free
.chain
= marker_free_list
;
3611 marker_free_list
= XMISC (misc
);
3613 total_free_markers
++;
3616 /* Return a Lisp_Misc_Save_Value object containing POINTER and
3617 INTEGER. This is used to package C values to call record_unwind_protect.
3618 The unwind function can get the C values back using XSAVE_VALUE. */
3621 make_save_value (void *pointer
, ptrdiff_t integer
)
3623 register Lisp_Object val
;
3624 register struct Lisp_Save_Value
*p
;
3626 val
= allocate_misc ();
3627 XMISCTYPE (val
) = Lisp_Misc_Save_Value
;
3628 p
= XSAVE_VALUE (val
);
3629 p
->pointer
= pointer
;
3630 p
->integer
= integer
;
3635 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
3636 doc
: /* Return a newly allocated marker which does not point at any place. */)
3639 register Lisp_Object val
;
3640 register struct Lisp_Marker
*p
;
3642 val
= allocate_misc ();
3643 XMISCTYPE (val
) = Lisp_Misc_Marker
;
3649 p
->insertion_type
= 0;
3653 /* Put MARKER back on the free list after using it temporarily. */
3656 free_marker (Lisp_Object marker
)
3658 unchain_marker (XMARKER (marker
));
3663 /* Return a newly created vector or string with specified arguments as
3664 elements. If all the arguments are characters that can fit
3665 in a string of events, make a string; otherwise, make a vector.
3667 Any number of arguments, even zero arguments, are allowed. */
3670 make_event_array (register int nargs
, Lisp_Object
*args
)
3674 for (i
= 0; i
< nargs
; i
++)
3675 /* The things that fit in a string
3676 are characters that are in 0...127,
3677 after discarding the meta bit and all the bits above it. */
3678 if (!INTEGERP (args
[i
])
3679 || (XINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
3680 return Fvector (nargs
, args
);
3682 /* Since the loop exited, we know that all the things in it are
3683 characters, so we can make a string. */
3687 result
= Fmake_string (make_number (nargs
), make_number (0));
3688 for (i
= 0; i
< nargs
; i
++)
3690 SSET (result
, i
, XINT (args
[i
]));
3691 /* Move the meta bit to the right place for a string char. */
3692 if (XINT (args
[i
]) & CHAR_META
)
3693 SSET (result
, i
, SREF (result
, i
) | 0x80);
3702 /************************************************************************
3703 Memory Full Handling
3704 ************************************************************************/
3707 /* Called if malloc (NBYTES) returns zero. If NBYTES == SIZE_MAX,
3708 there may have been size_t overflow so that malloc was never
3709 called, or perhaps malloc was invoked successfully but the
3710 resulting pointer had problems fitting into a tagged EMACS_INT. In
3711 either case this counts as memory being full even though malloc did
3715 memory_full (size_t nbytes
)
3717 /* Do not go into hysterics merely because a large request failed. */
3718 int enough_free_memory
= 0;
3719 if (SPARE_MEMORY
< nbytes
)
3724 p
= malloc (SPARE_MEMORY
);
3728 enough_free_memory
= 1;
3730 MALLOC_UNBLOCK_INPUT
;
3733 if (! enough_free_memory
)
3739 memory_full_cons_threshold
= sizeof (struct cons_block
);
3741 /* The first time we get here, free the spare memory. */
3742 for (i
= 0; i
< sizeof (spare_memory
) / sizeof (char *); i
++)
3743 if (spare_memory
[i
])
3746 free (spare_memory
[i
]);
3747 else if (i
>= 1 && i
<= 4)
3748 lisp_align_free (spare_memory
[i
]);
3750 lisp_free (spare_memory
[i
]);
3751 spare_memory
[i
] = 0;
3754 /* Record the space now used. When it decreases substantially,
3755 we can refill the memory reserve. */
3756 #if !defined SYSTEM_MALLOC && !defined SYNC_INPUT
3757 bytes_used_when_full
= BYTES_USED
;
3761 /* This used to call error, but if we've run out of memory, we could
3762 get infinite recursion trying to build the string. */
3763 xsignal (Qnil
, Vmemory_signal_data
);
3766 /* If we released our reserve (due to running out of memory),
3767 and we have a fair amount free once again,
3768 try to set aside another reserve in case we run out once more.
3770 This is called when a relocatable block is freed in ralloc.c,
3771 and also directly from this file, in case we're not using ralloc.c. */
3774 refill_memory_reserve (void)
3776 #ifndef SYSTEM_MALLOC
3777 if (spare_memory
[0] == 0)
3778 spare_memory
[0] = (char *) malloc (SPARE_MEMORY
);
3779 if (spare_memory
[1] == 0)
3780 spare_memory
[1] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3782 if (spare_memory
[2] == 0)
3783 spare_memory
[2] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3785 if (spare_memory
[3] == 0)
3786 spare_memory
[3] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3788 if (spare_memory
[4] == 0)
3789 spare_memory
[4] = (char *) lisp_align_malloc (sizeof (struct cons_block
),
3791 if (spare_memory
[5] == 0)
3792 spare_memory
[5] = (char *) lisp_malloc (sizeof (struct string_block
),
3794 if (spare_memory
[6] == 0)
3795 spare_memory
[6] = (char *) lisp_malloc (sizeof (struct string_block
),
3797 if (spare_memory
[0] && spare_memory
[1] && spare_memory
[5])
3798 Vmemory_full
= Qnil
;
3802 /************************************************************************
3804 ************************************************************************/
3806 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
3808 /* Conservative C stack marking requires a method to identify possibly
3809 live Lisp objects given a pointer value. We do this by keeping
3810 track of blocks of Lisp data that are allocated in a red-black tree
3811 (see also the comment of mem_node which is the type of nodes in
3812 that tree). Function lisp_malloc adds information for an allocated
3813 block to the red-black tree with calls to mem_insert, and function
3814 lisp_free removes it with mem_delete. Functions live_string_p etc
3815 call mem_find to lookup information about a given pointer in the
3816 tree, and use that to determine if the pointer points to a Lisp
3819 /* Initialize this part of alloc.c. */
3824 mem_z
.left
= mem_z
.right
= MEM_NIL
;
3825 mem_z
.parent
= NULL
;
3826 mem_z
.color
= MEM_BLACK
;
3827 mem_z
.start
= mem_z
.end
= NULL
;
3832 /* Value is a pointer to the mem_node containing START. Value is
3833 MEM_NIL if there is no node in the tree containing START. */
3835 static inline struct mem_node
*
3836 mem_find (void *start
)
3840 if (start
< min_heap_address
|| start
> max_heap_address
)
3843 /* Make the search always successful to speed up the loop below. */
3844 mem_z
.start
= start
;
3845 mem_z
.end
= (char *) start
+ 1;
3848 while (start
< p
->start
|| start
>= p
->end
)
3849 p
= start
< p
->start
? p
->left
: p
->right
;
3854 /* Insert a new node into the tree for a block of memory with start
3855 address START, end address END, and type TYPE. Value is a
3856 pointer to the node that was inserted. */
3858 static struct mem_node
*
3859 mem_insert (void *start
, void *end
, enum mem_type type
)
3861 struct mem_node
*c
, *parent
, *x
;
3863 if (min_heap_address
== NULL
|| start
< min_heap_address
)
3864 min_heap_address
= start
;
3865 if (max_heap_address
== NULL
|| end
> max_heap_address
)
3866 max_heap_address
= end
;
3868 /* See where in the tree a node for START belongs. In this
3869 particular application, it shouldn't happen that a node is already
3870 present. For debugging purposes, let's check that. */
3874 #if GC_MARK_STACK != GC_MAKE_GCPROS_NOOPS
3876 while (c
!= MEM_NIL
)
3878 if (start
>= c
->start
&& start
< c
->end
)
3881 c
= start
< c
->start
? c
->left
: c
->right
;
3884 #else /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3886 while (c
!= MEM_NIL
)
3889 c
= start
< c
->start
? c
->left
: c
->right
;
3892 #endif /* GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS */
3894 /* Create a new node. */
3895 #ifdef GC_MALLOC_CHECK
3896 x
= (struct mem_node
*) _malloc_internal (sizeof *x
);
3900 x
= xmalloc (sizeof *x
);
3906 x
->left
= x
->right
= MEM_NIL
;
3909 /* Insert it as child of PARENT or install it as root. */
3912 if (start
< parent
->start
)
3920 /* Re-establish red-black tree properties. */
3921 mem_insert_fixup (x
);
3927 /* Re-establish the red-black properties of the tree, and thereby
3928 balance the tree, after node X has been inserted; X is always red. */
3931 mem_insert_fixup (struct mem_node
*x
)
3933 while (x
!= mem_root
&& x
->parent
->color
== MEM_RED
)
3935 /* X is red and its parent is red. This is a violation of
3936 red-black tree property #3. */
3938 if (x
->parent
== x
->parent
->parent
->left
)
3940 /* We're on the left side of our grandparent, and Y is our
3942 struct mem_node
*y
= x
->parent
->parent
->right
;
3944 if (y
->color
== MEM_RED
)
3946 /* Uncle and parent are red but should be black because
3947 X is red. Change the colors accordingly and proceed
3948 with the grandparent. */
3949 x
->parent
->color
= MEM_BLACK
;
3950 y
->color
= MEM_BLACK
;
3951 x
->parent
->parent
->color
= MEM_RED
;
3952 x
= x
->parent
->parent
;
3956 /* Parent and uncle have different colors; parent is
3957 red, uncle is black. */
3958 if (x
== x
->parent
->right
)
3961 mem_rotate_left (x
);
3964 x
->parent
->color
= MEM_BLACK
;
3965 x
->parent
->parent
->color
= MEM_RED
;
3966 mem_rotate_right (x
->parent
->parent
);
3971 /* This is the symmetrical case of above. */
3972 struct mem_node
*y
= x
->parent
->parent
->left
;
3974 if (y
->color
== MEM_RED
)
3976 x
->parent
->color
= MEM_BLACK
;
3977 y
->color
= MEM_BLACK
;
3978 x
->parent
->parent
->color
= MEM_RED
;
3979 x
= x
->parent
->parent
;
3983 if (x
== x
->parent
->left
)
3986 mem_rotate_right (x
);
3989 x
->parent
->color
= MEM_BLACK
;
3990 x
->parent
->parent
->color
= MEM_RED
;
3991 mem_rotate_left (x
->parent
->parent
);
3996 /* The root may have been changed to red due to the algorithm. Set
3997 it to black so that property #5 is satisfied. */
3998 mem_root
->color
= MEM_BLACK
;
4009 mem_rotate_left (struct mem_node
*x
)
4013 /* Turn y's left sub-tree into x's right sub-tree. */
4016 if (y
->left
!= MEM_NIL
)
4017 y
->left
->parent
= x
;
4019 /* Y's parent was x's parent. */
4021 y
->parent
= x
->parent
;
4023 /* Get the parent to point to y instead of x. */
4026 if (x
== x
->parent
->left
)
4027 x
->parent
->left
= y
;
4029 x
->parent
->right
= y
;
4034 /* Put x on y's left. */
4048 mem_rotate_right (struct mem_node
*x
)
4050 struct mem_node
*y
= x
->left
;
4053 if (y
->right
!= MEM_NIL
)
4054 y
->right
->parent
= x
;
4057 y
->parent
= x
->parent
;
4060 if (x
== x
->parent
->right
)
4061 x
->parent
->right
= y
;
4063 x
->parent
->left
= y
;
4074 /* Delete node Z from the tree. If Z is null or MEM_NIL, do nothing. */
4077 mem_delete (struct mem_node
*z
)
4079 struct mem_node
*x
, *y
;
4081 if (!z
|| z
== MEM_NIL
)
4084 if (z
->left
== MEM_NIL
|| z
->right
== MEM_NIL
)
4089 while (y
->left
!= MEM_NIL
)
4093 if (y
->left
!= MEM_NIL
)
4098 x
->parent
= y
->parent
;
4101 if (y
== y
->parent
->left
)
4102 y
->parent
->left
= x
;
4104 y
->parent
->right
= x
;
4111 z
->start
= y
->start
;
4116 if (y
->color
== MEM_BLACK
)
4117 mem_delete_fixup (x
);
4119 #ifdef GC_MALLOC_CHECK
4127 /* Re-establish the red-black properties of the tree, after a
4131 mem_delete_fixup (struct mem_node
*x
)
4133 while (x
!= mem_root
&& x
->color
== MEM_BLACK
)
4135 if (x
== x
->parent
->left
)
4137 struct mem_node
*w
= x
->parent
->right
;
4139 if (w
->color
== MEM_RED
)
4141 w
->color
= MEM_BLACK
;
4142 x
->parent
->color
= MEM_RED
;
4143 mem_rotate_left (x
->parent
);
4144 w
= x
->parent
->right
;
4147 if (w
->left
->color
== MEM_BLACK
&& w
->right
->color
== MEM_BLACK
)
4154 if (w
->right
->color
== MEM_BLACK
)
4156 w
->left
->color
= MEM_BLACK
;
4158 mem_rotate_right (w
);
4159 w
= x
->parent
->right
;
4161 w
->color
= x
->parent
->color
;
4162 x
->parent
->color
= MEM_BLACK
;
4163 w
->right
->color
= MEM_BLACK
;
4164 mem_rotate_left (x
->parent
);
4170 struct mem_node
*w
= x
->parent
->left
;
4172 if (w
->color
== MEM_RED
)
4174 w
->color
= MEM_BLACK
;
4175 x
->parent
->color
= MEM_RED
;
4176 mem_rotate_right (x
->parent
);
4177 w
= x
->parent
->left
;
4180 if (w
->right
->color
== MEM_BLACK
&& w
->left
->color
== MEM_BLACK
)
4187 if (w
->left
->color
== MEM_BLACK
)
4189 w
->right
->color
= MEM_BLACK
;
4191 mem_rotate_left (w
);
4192 w
= x
->parent
->left
;
4195 w
->color
= x
->parent
->color
;
4196 x
->parent
->color
= MEM_BLACK
;
4197 w
->left
->color
= MEM_BLACK
;
4198 mem_rotate_right (x
->parent
);
4204 x
->color
= MEM_BLACK
;
4208 /* Value is non-zero if P is a pointer to a live Lisp string on
4209 the heap. M is a pointer to the mem_block for P. */
4212 live_string_p (struct mem_node
*m
, void *p
)
4214 if (m
->type
== MEM_TYPE_STRING
)
4216 struct string_block
*b
= (struct string_block
*) m
->start
;
4217 ptrdiff_t offset
= (char *) p
- (char *) &b
->strings
[0];
4219 /* P must point to the start of a Lisp_String structure, and it
4220 must not be on the free-list. */
4222 && offset
% sizeof b
->strings
[0] == 0
4223 && offset
< (STRING_BLOCK_SIZE
* sizeof b
->strings
[0])
4224 && ((struct Lisp_String
*) p
)->data
!= NULL
);
4231 /* Value is non-zero if P is a pointer to a live Lisp cons on
4232 the heap. M is a pointer to the mem_block for P. */
4235 live_cons_p (struct mem_node
*m
, void *p
)
4237 if (m
->type
== MEM_TYPE_CONS
)
4239 struct cons_block
*b
= (struct cons_block
*) m
->start
;
4240 ptrdiff_t offset
= (char *) p
- (char *) &b
->conses
[0];
4242 /* P must point to the start of a Lisp_Cons, not be
4243 one of the unused cells in the current cons block,
4244 and not be on the free-list. */
4246 && offset
% sizeof b
->conses
[0] == 0
4247 && offset
< (CONS_BLOCK_SIZE
* sizeof b
->conses
[0])
4249 || offset
/ sizeof b
->conses
[0] < cons_block_index
)
4250 && !EQ (((struct Lisp_Cons
*) p
)->car
, Vdead
));
4257 /* Value is non-zero if P is a pointer to a live Lisp symbol on
4258 the heap. M is a pointer to the mem_block for P. */
4261 live_symbol_p (struct mem_node
*m
, void *p
)
4263 if (m
->type
== MEM_TYPE_SYMBOL
)
4265 struct symbol_block
*b
= (struct symbol_block
*) m
->start
;
4266 ptrdiff_t offset
= (char *) p
- (char *) &b
->symbols
[0];
4268 /* P must point to the start of a Lisp_Symbol, not be
4269 one of the unused cells in the current symbol block,
4270 and not be on the free-list. */
4272 && offset
% sizeof b
->symbols
[0] == 0
4273 && offset
< (SYMBOL_BLOCK_SIZE
* sizeof b
->symbols
[0])
4274 && (b
!= symbol_block
4275 || offset
/ sizeof b
->symbols
[0] < symbol_block_index
)
4276 && !EQ (((struct Lisp_Symbol
*) p
)->function
, Vdead
));
4283 /* Value is non-zero if P is a pointer to a live Lisp float on
4284 the heap. M is a pointer to the mem_block for P. */
4287 live_float_p (struct mem_node
*m
, void *p
)
4289 if (m
->type
== MEM_TYPE_FLOAT
)
4291 struct float_block
*b
= (struct float_block
*) m
->start
;
4292 ptrdiff_t offset
= (char *) p
- (char *) &b
->floats
[0];
4294 /* P must point to the start of a Lisp_Float and not be
4295 one of the unused cells in the current float block. */
4297 && offset
% sizeof b
->floats
[0] == 0
4298 && offset
< (FLOAT_BLOCK_SIZE
* sizeof b
->floats
[0])
4299 && (b
!= float_block
4300 || offset
/ sizeof b
->floats
[0] < float_block_index
));
4307 /* Value is non-zero if P is a pointer to a live Lisp Misc on
4308 the heap. M is a pointer to the mem_block for P. */
4311 live_misc_p (struct mem_node
*m
, void *p
)
4313 if (m
->type
== MEM_TYPE_MISC
)
4315 struct marker_block
*b
= (struct marker_block
*) m
->start
;
4316 ptrdiff_t offset
= (char *) p
- (char *) &b
->markers
[0];
4318 /* P must point to the start of a Lisp_Misc, not be
4319 one of the unused cells in the current misc block,
4320 and not be on the free-list. */
4322 && offset
% sizeof b
->markers
[0] == 0
4323 && offset
< (MARKER_BLOCK_SIZE
* sizeof b
->markers
[0])
4324 && (b
!= marker_block
4325 || offset
/ sizeof b
->markers
[0] < marker_block_index
)
4326 && ((union Lisp_Misc
*) p
)->u_any
.type
!= Lisp_Misc_Free
);
4333 /* Value is non-zero if P is a pointer to a live vector-like object.
4334 M is a pointer to the mem_block for P. */
4337 live_vector_p (struct mem_node
*m
, void *p
)
4339 if (m
->type
== MEM_TYPE_VECTOR_BLOCK
)
4341 /* This memory node corresponds to a vector block. */
4342 struct vector_block
*block
= (struct vector_block
*) m
->start
;
4343 struct Lisp_Vector
*vector
= (struct Lisp_Vector
*) block
->data
;
4345 /* P is in the block's allocation range. Scan the block
4346 up to P and see whether P points to the start of some
4347 vector which is not on a free list. FIXME: check whether
4348 some allocation patterns (probably a lot of short vectors)
4349 may cause a substantial overhead of this loop. */
4350 while (VECTOR_IN_BLOCK (vector
, block
)
4351 && vector
<= (struct Lisp_Vector
*) p
)
4353 if (PSEUDOVECTOR_TYPEP (&vector
->header
, PVEC_FREE
))
4354 vector
= ADVANCE (vector
, (vector
->header
.size
4355 & PSEUDOVECTOR_SIZE_MASK
));
4356 else if (vector
== p
)
4359 vector
= ADVANCE (vector
, vector
->header
.next
.nbytes
);
4362 else if (m
->type
== MEM_TYPE_VECTORLIKE
&& p
== m
->start
)
4363 /* This memory node corresponds to a large vector. */
4369 /* Value is non-zero if P is a pointer to a live buffer. M is a
4370 pointer to the mem_block for P. */
4373 live_buffer_p (struct mem_node
*m
, void *p
)
4375 /* P must point to the start of the block, and the buffer
4376 must not have been killed. */
4377 return (m
->type
== MEM_TYPE_BUFFER
4379 && !NILP (((struct buffer
*) p
)->BUFFER_INTERNAL_FIELD (name
)));
4382 #endif /* GC_MARK_STACK || defined GC_MALLOC_CHECK */
4386 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4388 /* Array of objects that are kept alive because the C stack contains
4389 a pattern that looks like a reference to them . */
4391 #define MAX_ZOMBIES 10
4392 static Lisp_Object zombies
[MAX_ZOMBIES
];
4394 /* Number of zombie objects. */
4396 static EMACS_INT nzombies
;
4398 /* Number of garbage collections. */
4400 static EMACS_INT ngcs
;
4402 /* Average percentage of zombies per collection. */
4404 static double avg_zombies
;
4406 /* Max. number of live and zombie objects. */
4408 static EMACS_INT max_live
, max_zombies
;
4410 /* Average number of live objects per GC. */
4412 static double avg_live
;
4414 DEFUN ("gc-status", Fgc_status
, Sgc_status
, 0, 0, "",
4415 doc
: /* Show information about live and zombie objects. */)
4418 Lisp_Object args
[8], zombie_list
= Qnil
;
4420 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); i
++)
4421 zombie_list
= Fcons (zombies
[i
], zombie_list
);
4422 args
[0] = build_string ("%d GCs, avg live/zombies = %.2f/%.2f (%f%%), max %d/%d\nzombies: %S");
4423 args
[1] = make_number (ngcs
);
4424 args
[2] = make_float (avg_live
);
4425 args
[3] = make_float (avg_zombies
);
4426 args
[4] = make_float (avg_zombies
/ avg_live
/ 100);
4427 args
[5] = make_number (max_live
);
4428 args
[6] = make_number (max_zombies
);
4429 args
[7] = zombie_list
;
4430 return Fmessage (8, args
);
4433 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4436 /* Mark OBJ if we can prove it's a Lisp_Object. */
4439 mark_maybe_object (Lisp_Object obj
)
4447 po
= (void *) XPNTR (obj
);
4454 switch (XTYPE (obj
))
4457 mark_p
= (live_string_p (m
, po
)
4458 && !STRING_MARKED_P ((struct Lisp_String
*) po
));
4462 mark_p
= (live_cons_p (m
, po
) && !CONS_MARKED_P (XCONS (obj
)));
4466 mark_p
= (live_symbol_p (m
, po
) && !XSYMBOL (obj
)->gcmarkbit
);
4470 mark_p
= (live_float_p (m
, po
) && !FLOAT_MARKED_P (XFLOAT (obj
)));
4473 case Lisp_Vectorlike
:
4474 /* Note: can't check BUFFERP before we know it's a
4475 buffer because checking that dereferences the pointer
4476 PO which might point anywhere. */
4477 if (live_vector_p (m
, po
))
4478 mark_p
= !SUBRP (obj
) && !VECTOR_MARKED_P (XVECTOR (obj
));
4479 else if (live_buffer_p (m
, po
))
4480 mark_p
= BUFFERP (obj
) && !VECTOR_MARKED_P (XBUFFER (obj
));
4484 mark_p
= (live_misc_p (m
, po
) && !XMISCANY (obj
)->gcmarkbit
);
4493 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4494 if (nzombies
< MAX_ZOMBIES
)
4495 zombies
[nzombies
] = obj
;
4504 /* If P points to Lisp data, mark that as live if it isn't already
4508 mark_maybe_pointer (void *p
)
4512 /* Quickly rule out some values which can't point to Lisp data.
4513 USE_LSB_TAG needs Lisp data to be aligned on multiples of 1 << GCTYPEBITS.
4514 Otherwise, assume that Lisp data is aligned on even addresses. */
4515 if ((intptr_t) p
% (USE_LSB_TAG
? 1 << GCTYPEBITS
: 2))
4521 Lisp_Object obj
= Qnil
;
4525 case MEM_TYPE_NON_LISP
:
4526 /* Nothing to do; not a pointer to Lisp memory. */
4529 case MEM_TYPE_BUFFER
:
4530 if (live_buffer_p (m
, p
) && !VECTOR_MARKED_P ((struct buffer
*)p
))
4531 XSETVECTOR (obj
, p
);
4535 if (live_cons_p (m
, p
) && !CONS_MARKED_P ((struct Lisp_Cons
*) p
))
4539 case MEM_TYPE_STRING
:
4540 if (live_string_p (m
, p
)
4541 && !STRING_MARKED_P ((struct Lisp_String
*) p
))
4542 XSETSTRING (obj
, p
);
4546 if (live_misc_p (m
, p
) && !((struct Lisp_Free
*) p
)->gcmarkbit
)
4550 case MEM_TYPE_SYMBOL
:
4551 if (live_symbol_p (m
, p
) && !((struct Lisp_Symbol
*) p
)->gcmarkbit
)
4552 XSETSYMBOL (obj
, p
);
4555 case MEM_TYPE_FLOAT
:
4556 if (live_float_p (m
, p
) && !FLOAT_MARKED_P (p
))
4560 case MEM_TYPE_VECTORLIKE
:
4561 case MEM_TYPE_VECTOR_BLOCK
:
4562 if (live_vector_p (m
, p
))
4565 XSETVECTOR (tem
, p
);
4566 if (!SUBRP (tem
) && !VECTOR_MARKED_P (XVECTOR (tem
)))
4581 /* Alignment of pointer values. Use offsetof, as it sometimes returns
4582 a smaller alignment than GCC's __alignof__ and mark_memory might
4583 miss objects if __alignof__ were used. */
4584 #define GC_POINTER_ALIGNMENT offsetof (struct {char a; void *b;}, b)
4586 /* Define POINTERS_MIGHT_HIDE_IN_OBJECTS to 1 if marking via C pointers does
4587 not suffice, which is the typical case. A host where a Lisp_Object is
4588 wider than a pointer might allocate a Lisp_Object in non-adjacent halves.
4589 If USE_LSB_TAG, the bottom half is not a valid pointer, but it should
4590 suffice to widen it to to a Lisp_Object and check it that way. */
4591 #if USE_LSB_TAG || VAL_MAX < UINTPTR_MAX
4592 # if !USE_LSB_TAG && VAL_MAX < UINTPTR_MAX >> GCTYPEBITS
4593 /* If tag bits straddle pointer-word boundaries, neither mark_maybe_pointer
4594 nor mark_maybe_object can follow the pointers. This should not occur on
4595 any practical porting target. */
4596 # error "MSB type bits straddle pointer-word boundaries"
4598 /* Marking via C pointers does not suffice, because Lisp_Objects contain
4599 pointer words that hold pointers ORed with type bits. */
4600 # define POINTERS_MIGHT_HIDE_IN_OBJECTS 1
4602 /* Marking via C pointers suffices, because Lisp_Objects contain pointer
4603 words that hold unmodified pointers. */
4604 # define POINTERS_MIGHT_HIDE_IN_OBJECTS 0
4607 /* Mark Lisp objects referenced from the address range START+OFFSET..END
4608 or END+OFFSET..START. */
4611 mark_memory (void *start
, void *end
)
4613 /* Do not allow -faddress-sanitizer to check this function, since it
4614 crosses the function stack boundary, and thus would yield many
4616 __attribute__((no_address_safety_analysis
))
4622 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4626 /* Make START the pointer to the start of the memory region,
4627 if it isn't already. */
4635 /* Mark Lisp data pointed to. This is necessary because, in some
4636 situations, the C compiler optimizes Lisp objects away, so that
4637 only a pointer to them remains. Example:
4639 DEFUN ("testme", Ftestme, Stestme, 0, 0, 0, "")
4642 Lisp_Object obj = build_string ("test");
4643 struct Lisp_String *s = XSTRING (obj);
4644 Fgarbage_collect ();
4645 fprintf (stderr, "test `%s'\n", s->data);
4649 Here, `obj' isn't really used, and the compiler optimizes it
4650 away. The only reference to the life string is through the
4653 for (pp
= start
; (void *) pp
< end
; pp
++)
4654 for (i
= 0; i
< sizeof *pp
; i
+= GC_POINTER_ALIGNMENT
)
4656 void *p
= *(void **) ((char *) pp
+ i
);
4657 mark_maybe_pointer (p
);
4658 if (POINTERS_MIGHT_HIDE_IN_OBJECTS
)
4659 mark_maybe_object (XIL ((intptr_t) p
));
4663 /* setjmp will work with GCC unless NON_SAVING_SETJMP is defined in
4664 the GCC system configuration. In gcc 3.2, the only systems for
4665 which this is so are i386-sco5 non-ELF, i386-sysv3 (maybe included
4666 by others?) and ns32k-pc532-min. */
4668 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
4670 static int setjmp_tested_p
, longjmps_done
;
4672 #define SETJMP_WILL_LIKELY_WORK "\
4674 Emacs garbage collector has been changed to use conservative stack\n\
4675 marking. Emacs has determined that the method it uses to do the\n\
4676 marking will likely work on your system, but this isn't sure.\n\
4678 If you are a system-programmer, or can get the help of a local wizard\n\
4679 who is, please take a look at the function mark_stack in alloc.c, and\n\
4680 verify that the methods used are appropriate for your system.\n\
4682 Please mail the result to <emacs-devel@gnu.org>.\n\
4685 #define SETJMP_WILL_NOT_WORK "\
4687 Emacs garbage collector has been changed to use conservative stack\n\
4688 marking. Emacs has determined that the default method it uses to do the\n\
4689 marking will not work on your system. We will need a system-dependent\n\
4690 solution for your system.\n\
4692 Please take a look at the function mark_stack in alloc.c, and\n\
4693 try to find a way to make it work on your system.\n\
4695 Note that you may get false negatives, depending on the compiler.\n\
4696 In particular, you need to use -O with GCC for this test.\n\
4698 Please mail the result to <emacs-devel@gnu.org>.\n\
4702 /* Perform a quick check if it looks like setjmp saves registers in a
4703 jmp_buf. Print a message to stderr saying so. When this test
4704 succeeds, this is _not_ a proof that setjmp is sufficient for
4705 conservative stack marking. Only the sources or a disassembly
4716 /* Arrange for X to be put in a register. */
4722 if (longjmps_done
== 1)
4724 /* Came here after the longjmp at the end of the function.
4726 If x == 1, the longjmp has restored the register to its
4727 value before the setjmp, and we can hope that setjmp
4728 saves all such registers in the jmp_buf, although that
4731 For other values of X, either something really strange is
4732 taking place, or the setjmp just didn't save the register. */
4735 fprintf (stderr
, SETJMP_WILL_LIKELY_WORK
);
4738 fprintf (stderr
, SETJMP_WILL_NOT_WORK
);
4745 if (longjmps_done
== 1)
4749 #endif /* not GC_SAVE_REGISTERS_ON_STACK && not GC_SETJMP_WORKS */
4752 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4754 /* Abort if anything GCPRO'd doesn't survive the GC. */
4762 for (p
= gcprolist
; p
; p
= p
->next
)
4763 for (i
= 0; i
< p
->nvars
; ++i
)
4764 if (!survives_gc_p (p
->var
[i
]))
4765 /* FIXME: It's not necessarily a bug. It might just be that the
4766 GCPRO is unnecessary or should release the object sooner. */
4770 #elif GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
4777 fprintf (stderr
, "\nZombies kept alive = %"pI
"d:\n", nzombies
);
4778 for (i
= 0; i
< min (MAX_ZOMBIES
, nzombies
); ++i
)
4780 fprintf (stderr
, " %d = ", i
);
4781 debug_print (zombies
[i
]);
4785 #endif /* GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES */
4788 /* Mark live Lisp objects on the C stack.
4790 There are several system-dependent problems to consider when
4791 porting this to new architectures:
4795 We have to mark Lisp objects in CPU registers that can hold local
4796 variables or are used to pass parameters.
4798 If GC_SAVE_REGISTERS_ON_STACK is defined, it should expand to
4799 something that either saves relevant registers on the stack, or
4800 calls mark_maybe_object passing it each register's contents.
4802 If GC_SAVE_REGISTERS_ON_STACK is not defined, the current
4803 implementation assumes that calling setjmp saves registers we need
4804 to see in a jmp_buf which itself lies on the stack. This doesn't
4805 have to be true! It must be verified for each system, possibly
4806 by taking a look at the source code of setjmp.
4808 If __builtin_unwind_init is available (defined by GCC >= 2.8) we
4809 can use it as a machine independent method to store all registers
4810 to the stack. In this case the macros described in the previous
4811 two paragraphs are not used.
4815 Architectures differ in the way their processor stack is organized.
4816 For example, the stack might look like this
4819 | Lisp_Object | size = 4
4821 | something else | size = 2
4823 | Lisp_Object | size = 4
4827 In such a case, not every Lisp_Object will be aligned equally. To
4828 find all Lisp_Object on the stack it won't be sufficient to walk
4829 the stack in steps of 4 bytes. Instead, two passes will be
4830 necessary, one starting at the start of the stack, and a second
4831 pass starting at the start of the stack + 2. Likewise, if the
4832 minimal alignment of Lisp_Objects on the stack is 1, four passes
4833 would be necessary, each one starting with one byte more offset
4834 from the stack start. */
4841 #ifdef HAVE___BUILTIN_UNWIND_INIT
4842 /* Force callee-saved registers and register windows onto the stack.
4843 This is the preferred method if available, obviating the need for
4844 machine dependent methods. */
4845 __builtin_unwind_init ();
4847 #else /* not HAVE___BUILTIN_UNWIND_INIT */
4848 #ifndef GC_SAVE_REGISTERS_ON_STACK
4849 /* jmp_buf may not be aligned enough on darwin-ppc64 */
4850 union aligned_jmpbuf
{
4854 volatile int stack_grows_down_p
= (char *) &j
> (char *) stack_base
;
4856 /* This trick flushes the register windows so that all the state of
4857 the process is contained in the stack. */
4858 /* Fixme: Code in the Boehm GC suggests flushing (with `flushrs') is
4859 needed on ia64 too. See mach_dep.c, where it also says inline
4860 assembler doesn't work with relevant proprietary compilers. */
4862 #if defined (__sparc64__) && defined (__FreeBSD__)
4863 /* FreeBSD does not have a ta 3 handler. */
4870 /* Save registers that we need to see on the stack. We need to see
4871 registers used to hold register variables and registers used to
4873 #ifdef GC_SAVE_REGISTERS_ON_STACK
4874 GC_SAVE_REGISTERS_ON_STACK (end
);
4875 #else /* not GC_SAVE_REGISTERS_ON_STACK */
4877 #ifndef GC_SETJMP_WORKS /* If it hasn't been checked yet that
4878 setjmp will definitely work, test it
4879 and print a message with the result
4881 if (!setjmp_tested_p
)
4883 setjmp_tested_p
= 1;
4886 #endif /* GC_SETJMP_WORKS */
4889 end
= stack_grows_down_p
? (char *) &j
+ sizeof j
: (char *) &j
;
4890 #endif /* not GC_SAVE_REGISTERS_ON_STACK */
4891 #endif /* not HAVE___BUILTIN_UNWIND_INIT */
4893 /* This assumes that the stack is a contiguous region in memory. If
4894 that's not the case, something has to be done here to iterate
4895 over the stack segments. */
4896 mark_memory (stack_base
, end
);
4898 /* Allow for marking a secondary stack, like the register stack on the
4900 #ifdef GC_MARK_SECONDARY_STACK
4901 GC_MARK_SECONDARY_STACK ();
4904 #if GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS
4909 #endif /* GC_MARK_STACK != 0 */
4912 /* Determine whether it is safe to access memory at address P. */
4914 valid_pointer_p (void *p
)
4917 return w32_valid_pointer_p (p
, 16);
4921 /* Obviously, we cannot just access it (we would SEGV trying), so we
4922 trick the o/s to tell us whether p is a valid pointer.
4923 Unfortunately, we cannot use NULL_DEVICE here, as emacs_write may
4924 not validate p in that case. */
4928 int valid
= (emacs_write (fd
[1], (char *) p
, 16) == 16);
4929 emacs_close (fd
[1]);
4930 emacs_close (fd
[0]);
4938 /* Return 1 if OBJ is a valid lisp object.
4939 Return 0 if OBJ is NOT a valid lisp object.
4940 Return -1 if we cannot validate OBJ.
4941 This function can be quite slow,
4942 so it should only be used in code for manual debugging. */
4945 valid_lisp_object_p (Lisp_Object obj
)
4955 p
= (void *) XPNTR (obj
);
4956 if (PURE_POINTER_P (p
))
4960 return valid_pointer_p (p
);
4967 int valid
= valid_pointer_p (p
);
4979 case MEM_TYPE_NON_LISP
:
4982 case MEM_TYPE_BUFFER
:
4983 return live_buffer_p (m
, p
);
4986 return live_cons_p (m
, p
);
4988 case MEM_TYPE_STRING
:
4989 return live_string_p (m
, p
);
4992 return live_misc_p (m
, p
);
4994 case MEM_TYPE_SYMBOL
:
4995 return live_symbol_p (m
, p
);
4997 case MEM_TYPE_FLOAT
:
4998 return live_float_p (m
, p
);
5000 case MEM_TYPE_VECTORLIKE
:
5001 case MEM_TYPE_VECTOR_BLOCK
:
5002 return live_vector_p (m
, p
);
5015 /***********************************************************************
5016 Pure Storage Management
5017 ***********************************************************************/
5019 /* Allocate room for SIZE bytes from pure Lisp storage and return a
5020 pointer to it. TYPE is the Lisp type for which the memory is
5021 allocated. TYPE < 0 means it's not used for a Lisp object. */
5024 pure_alloc (size_t size
, int type
)
5028 size_t alignment
= (1 << GCTYPEBITS
);
5030 size_t alignment
= sizeof (EMACS_INT
);
5032 /* Give Lisp_Floats an extra alignment. */
5033 if (type
== Lisp_Float
)
5035 #if defined __GNUC__ && __GNUC__ >= 2
5036 alignment
= __alignof (struct Lisp_Float
);
5038 alignment
= sizeof (struct Lisp_Float
);
5046 /* Allocate space for a Lisp object from the beginning of the free
5047 space with taking account of alignment. */
5048 result
= ALIGN (purebeg
+ pure_bytes_used_lisp
, alignment
);
5049 pure_bytes_used_lisp
= ((char *)result
- (char *)purebeg
) + size
;
5053 /* Allocate space for a non-Lisp object from the end of the free
5055 pure_bytes_used_non_lisp
+= size
;
5056 result
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
5058 pure_bytes_used
= pure_bytes_used_lisp
+ pure_bytes_used_non_lisp
;
5060 if (pure_bytes_used
<= pure_size
)
5063 /* Don't allocate a large amount here,
5064 because it might get mmap'd and then its address
5065 might not be usable. */
5066 purebeg
= xmalloc (10000);
5068 pure_bytes_used_before_overflow
+= pure_bytes_used
- size
;
5069 pure_bytes_used
= 0;
5070 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
5075 /* Print a warning if PURESIZE is too small. */
5078 check_pure_size (void)
5080 if (pure_bytes_used_before_overflow
)
5081 message (("emacs:0:Pure Lisp storage overflow (approx. %"pI
"d"
5083 pure_bytes_used
+ pure_bytes_used_before_overflow
);
5087 /* Find the byte sequence {DATA[0], ..., DATA[NBYTES-1], '\0'} from
5088 the non-Lisp data pool of the pure storage, and return its start
5089 address. Return NULL if not found. */
5092 find_string_data_in_pure (const char *data
, ptrdiff_t nbytes
)
5095 ptrdiff_t skip
, bm_skip
[256], last_char_skip
, infinity
, start
, start_max
;
5096 const unsigned char *p
;
5099 if (pure_bytes_used_non_lisp
<= nbytes
)
5102 /* Set up the Boyer-Moore table. */
5104 for (i
= 0; i
< 256; i
++)
5107 p
= (const unsigned char *) data
;
5109 bm_skip
[*p
++] = skip
;
5111 last_char_skip
= bm_skip
['\0'];
5113 non_lisp_beg
= purebeg
+ pure_size
- pure_bytes_used_non_lisp
;
5114 start_max
= pure_bytes_used_non_lisp
- (nbytes
+ 1);
5116 /* See the comments in the function `boyer_moore' (search.c) for the
5117 use of `infinity'. */
5118 infinity
= pure_bytes_used_non_lisp
+ 1;
5119 bm_skip
['\0'] = infinity
;
5121 p
= (const unsigned char *) non_lisp_beg
+ nbytes
;
5125 /* Check the last character (== '\0'). */
5128 start
+= bm_skip
[*(p
+ start
)];
5130 while (start
<= start_max
);
5132 if (start
< infinity
)
5133 /* Couldn't find the last character. */
5136 /* No less than `infinity' means we could find the last
5137 character at `p[start - infinity]'. */
5140 /* Check the remaining characters. */
5141 if (memcmp (data
, non_lisp_beg
+ start
, nbytes
) == 0)
5143 return non_lisp_beg
+ start
;
5145 start
+= last_char_skip
;
5147 while (start
<= start_max
);
5153 /* Return a string allocated in pure space. DATA is a buffer holding
5154 NCHARS characters, and NBYTES bytes of string data. MULTIBYTE
5155 non-zero means make the result string multibyte.
5157 Must get an error if pure storage is full, since if it cannot hold
5158 a large string it may be able to hold conses that point to that
5159 string; then the string is not protected from gc. */
5162 make_pure_string (const char *data
,
5163 ptrdiff_t nchars
, ptrdiff_t nbytes
, int multibyte
)
5166 struct Lisp_String
*s
;
5168 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
5169 s
->data
= (unsigned char *) find_string_data_in_pure (data
, nbytes
);
5170 if (s
->data
== NULL
)
5172 s
->data
= (unsigned char *) pure_alloc (nbytes
+ 1, -1);
5173 memcpy (s
->data
, data
, nbytes
);
5174 s
->data
[nbytes
] = '\0';
5177 s
->size_byte
= multibyte
? nbytes
: -1;
5178 s
->intervals
= NULL_INTERVAL
;
5179 XSETSTRING (string
, s
);
5183 /* Return a string a string allocated in pure space. Do not allocate
5184 the string data, just point to DATA. */
5187 make_pure_c_string (const char *data
)
5190 struct Lisp_String
*s
;
5191 ptrdiff_t nchars
= strlen (data
);
5193 s
= (struct Lisp_String
*) pure_alloc (sizeof *s
, Lisp_String
);
5196 s
->data
= (unsigned char *) data
;
5197 s
->intervals
= NULL_INTERVAL
;
5198 XSETSTRING (string
, s
);
5202 /* Return a cons allocated from pure space. Give it pure copies
5203 of CAR as car and CDR as cdr. */
5206 pure_cons (Lisp_Object car
, Lisp_Object cdr
)
5208 register Lisp_Object
new;
5209 struct Lisp_Cons
*p
;
5211 p
= (struct Lisp_Cons
*) pure_alloc (sizeof *p
, Lisp_Cons
);
5213 XSETCAR (new, Fpurecopy (car
));
5214 XSETCDR (new, Fpurecopy (cdr
));
5219 /* Value is a float object with value NUM allocated from pure space. */
5222 make_pure_float (double num
)
5224 register Lisp_Object
new;
5225 struct Lisp_Float
*p
;
5227 p
= (struct Lisp_Float
*) pure_alloc (sizeof *p
, Lisp_Float
);
5229 XFLOAT_INIT (new, num
);
5234 /* Return a vector with room for LEN Lisp_Objects allocated from
5238 make_pure_vector (ptrdiff_t len
)
5241 struct Lisp_Vector
*p
;
5242 size_t size
= (offsetof (struct Lisp_Vector
, contents
)
5243 + len
* sizeof (Lisp_Object
));
5245 p
= (struct Lisp_Vector
*) pure_alloc (size
, Lisp_Vectorlike
);
5246 XSETVECTOR (new, p
);
5247 XVECTOR (new)->header
.size
= len
;
5252 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
5253 doc
: /* Make a copy of object OBJ in pure storage.
5254 Recursively copies contents of vectors and cons cells.
5255 Does not copy symbols. Copies strings without text properties. */)
5256 (register Lisp_Object obj
)
5258 if (NILP (Vpurify_flag
))
5261 if (PURE_POINTER_P (XPNTR (obj
)))
5264 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
5266 Lisp_Object tmp
= Fgethash (obj
, Vpurify_flag
, Qnil
);
5272 obj
= pure_cons (XCAR (obj
), XCDR (obj
));
5273 else if (FLOATP (obj
))
5274 obj
= make_pure_float (XFLOAT_DATA (obj
));
5275 else if (STRINGP (obj
))
5276 obj
= make_pure_string (SSDATA (obj
), SCHARS (obj
),
5278 STRING_MULTIBYTE (obj
));
5279 else if (COMPILEDP (obj
) || VECTORP (obj
))
5281 register struct Lisp_Vector
*vec
;
5282 register ptrdiff_t i
;
5286 if (size
& PSEUDOVECTOR_FLAG
)
5287 size
&= PSEUDOVECTOR_SIZE_MASK
;
5288 vec
= XVECTOR (make_pure_vector (size
));
5289 for (i
= 0; i
< size
; i
++)
5290 vec
->contents
[i
] = Fpurecopy (AREF (obj
, i
));
5291 if (COMPILEDP (obj
))
5293 XSETPVECTYPE (vec
, PVEC_COMPILED
);
5294 XSETCOMPILED (obj
, vec
);
5297 XSETVECTOR (obj
, vec
);
5299 else if (MARKERP (obj
))
5300 error ("Attempt to copy a marker to pure storage");
5302 /* Not purified, don't hash-cons. */
5305 if (HASH_TABLE_P (Vpurify_flag
)) /* Hash consing. */
5306 Fputhash (obj
, obj
, Vpurify_flag
);
5313 /***********************************************************************
5315 ***********************************************************************/
5317 /* Put an entry in staticvec, pointing at the variable with address
5321 staticpro (Lisp_Object
*varaddress
)
5323 staticvec
[staticidx
++] = varaddress
;
5324 if (staticidx
>= NSTATICS
)
5329 /***********************************************************************
5331 ***********************************************************************/
5333 /* Temporarily prevent garbage collection. */
5336 inhibit_garbage_collection (void)
5338 ptrdiff_t count
= SPECPDL_INDEX ();
5340 specbind (Qgc_cons_threshold
, make_number (MOST_POSITIVE_FIXNUM
));
5345 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
5346 doc
: /* Reclaim storage for Lisp objects no longer needed.
5347 Garbage collection happens automatically if you cons more than
5348 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.
5349 `garbage-collect' normally returns a list with info on amount of space in use:
5350 ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)
5351 (USED-MISCS . FREE-MISCS) USED-STRING-CHARS USED-VECTOR-SLOTS
5352 (USED-FLOATS . FREE-FLOATS) (USED-INTERVALS . FREE-INTERVALS)
5353 (USED-STRINGS . FREE-STRINGS))
5354 However, if there was overflow in pure space, `garbage-collect'
5355 returns nil, because real GC can't be done.
5356 See Info node `(elisp)Garbage Collection'. */)
5359 register struct specbinding
*bind
;
5360 char stack_top_variable
;
5363 Lisp_Object total
[8];
5364 ptrdiff_t count
= SPECPDL_INDEX ();
5365 EMACS_TIME t1
, t2
, t3
;
5370 /* Can't GC if pure storage overflowed because we can't determine
5371 if something is a pure object or not. */
5372 if (pure_bytes_used_before_overflow
)
5377 /* Don't keep undo information around forever.
5378 Do this early on, so it is no problem if the user quits. */
5380 register struct buffer
*nextb
= all_buffers
;
5384 /* If a buffer's undo list is Qt, that means that undo is
5385 turned off in that buffer. Calling truncate_undo_list on
5386 Qt tends to return NULL, which effectively turns undo back on.
5387 So don't call truncate_undo_list if undo_list is Qt. */
5388 if (! NILP (nextb
->BUFFER_INTERNAL_FIELD (name
))
5389 && ! EQ (nextb
->BUFFER_INTERNAL_FIELD (undo_list
), Qt
))
5390 truncate_undo_list (nextb
);
5392 /* Shrink buffer gaps, but skip indirect and dead buffers. */
5393 if (nextb
->base_buffer
== 0 && !NILP (nextb
->BUFFER_INTERNAL_FIELD (name
))
5394 && ! nextb
->text
->inhibit_shrinking
)
5396 /* If a buffer's gap size is more than 10% of the buffer
5397 size, or larger than 2000 bytes, then shrink it
5398 accordingly. Keep a minimum size of 20 bytes. */
5399 int size
= min (2000, max (20, (nextb
->text
->z_byte
/ 10)));
5401 if (nextb
->text
->gap_size
> size
)
5403 struct buffer
*save_current
= current_buffer
;
5404 current_buffer
= nextb
;
5405 make_gap (-(nextb
->text
->gap_size
- size
));
5406 current_buffer
= save_current
;
5410 nextb
= nextb
->header
.next
.buffer
;
5414 EMACS_GET_TIME (t1
);
5416 /* In case user calls debug_print during GC,
5417 don't let that cause a recursive GC. */
5418 consing_since_gc
= 0;
5420 /* Save what's currently displayed in the echo area. */
5421 message_p
= push_message ();
5422 record_unwind_protect (pop_message_unwind
, Qnil
);
5424 /* Save a copy of the contents of the stack, for debugging. */
5425 #if MAX_SAVE_STACK > 0
5426 if (NILP (Vpurify_flag
))
5429 ptrdiff_t stack_size
;
5430 if (&stack_top_variable
< stack_bottom
)
5432 stack
= &stack_top_variable
;
5433 stack_size
= stack_bottom
- &stack_top_variable
;
5437 stack
= stack_bottom
;
5438 stack_size
= &stack_top_variable
- stack_bottom
;
5440 if (stack_size
<= MAX_SAVE_STACK
)
5442 if (stack_copy_size
< stack_size
)
5444 stack_copy
= (char *) xrealloc (stack_copy
, stack_size
);
5445 stack_copy_size
= stack_size
;
5447 memcpy (stack_copy
, stack
, stack_size
);
5450 #endif /* MAX_SAVE_STACK > 0 */
5452 if (garbage_collection_messages
)
5453 message1_nolog ("Garbage collecting...");
5457 shrink_regexp_cache ();
5461 /* clear_marks (); */
5463 /* Mark all the special slots that serve as the roots of accessibility. */
5465 for (i
= 0; i
< staticidx
; i
++)
5466 mark_object (*staticvec
[i
]);
5468 for (bind
= specpdl
; bind
!= specpdl_ptr
; bind
++)
5470 mark_object (bind
->symbol
);
5471 mark_object (bind
->old_value
);
5479 extern void xg_mark_data (void);
5484 #if (GC_MARK_STACK == GC_MAKE_GCPROS_NOOPS \
5485 || GC_MARK_STACK == GC_MARK_STACK_CHECK_GCPROS)
5489 register struct gcpro
*tail
;
5490 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
5491 for (i
= 0; i
< tail
->nvars
; i
++)
5492 mark_object (tail
->var
[i
]);
5496 struct catchtag
*catch;
5497 struct handler
*handler
;
5499 for (catch = catchlist
; catch; catch = catch->next
)
5501 mark_object (catch->tag
);
5502 mark_object (catch->val
);
5504 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
5506 mark_object (handler
->handler
);
5507 mark_object (handler
->var
);
5513 #ifdef HAVE_WINDOW_SYSTEM
5514 mark_fringe_data ();
5517 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5521 /* Everything is now marked, except for the things that require special
5522 finalization, i.e. the undo_list.
5523 Look thru every buffer's undo list
5524 for elements that update markers that were not marked,
5527 register struct buffer
*nextb
= all_buffers
;
5531 /* If a buffer's undo list is Qt, that means that undo is
5532 turned off in that buffer. Calling truncate_undo_list on
5533 Qt tends to return NULL, which effectively turns undo back on.
5534 So don't call truncate_undo_list if undo_list is Qt. */
5535 if (! EQ (nextb
->BUFFER_INTERNAL_FIELD (undo_list
), Qt
))
5537 Lisp_Object tail
, prev
;
5538 tail
= nextb
->BUFFER_INTERNAL_FIELD (undo_list
);
5540 while (CONSP (tail
))
5542 if (CONSP (XCAR (tail
))
5543 && MARKERP (XCAR (XCAR (tail
)))
5544 && !XMARKER (XCAR (XCAR (tail
)))->gcmarkbit
)
5547 nextb
->BUFFER_INTERNAL_FIELD (undo_list
) = tail
= XCDR (tail
);
5551 XSETCDR (prev
, tail
);
5561 /* Now that we have stripped the elements that need not be in the
5562 undo_list any more, we can finally mark the list. */
5563 mark_object (nextb
->BUFFER_INTERNAL_FIELD (undo_list
));
5565 nextb
= nextb
->header
.next
.buffer
;
5571 /* Clear the mark bits that we set in certain root slots. */
5573 unmark_byte_stack ();
5574 VECTOR_UNMARK (&buffer_defaults
);
5575 VECTOR_UNMARK (&buffer_local_symbols
);
5577 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES && 0
5585 /* clear_marks (); */
5588 consing_since_gc
= 0;
5589 if (gc_cons_threshold
< 10000)
5590 gc_cons_threshold
= 10000;
5592 gc_relative_threshold
= 0;
5593 if (FLOATP (Vgc_cons_percentage
))
5594 { /* Set gc_cons_combined_threshold. */
5597 tot
+= total_conses
* sizeof (struct Lisp_Cons
);
5598 tot
+= total_symbols
* sizeof (struct Lisp_Symbol
);
5599 tot
+= total_markers
* sizeof (union Lisp_Misc
);
5600 tot
+= total_string_size
;
5601 tot
+= total_vector_size
* sizeof (Lisp_Object
);
5602 tot
+= total_floats
* sizeof (struct Lisp_Float
);
5603 tot
+= total_intervals
* sizeof (struct interval
);
5604 tot
+= total_strings
* sizeof (struct Lisp_String
);
5606 tot
*= XFLOAT_DATA (Vgc_cons_percentage
);
5609 if (tot
< TYPE_MAXIMUM (EMACS_INT
))
5610 gc_relative_threshold
= tot
;
5612 gc_relative_threshold
= TYPE_MAXIMUM (EMACS_INT
);
5616 if (garbage_collection_messages
)
5618 if (message_p
|| minibuf_level
> 0)
5621 message1_nolog ("Garbage collecting...done");
5624 unbind_to (count
, Qnil
);
5626 total
[0] = Fcons (make_number (total_conses
),
5627 make_number (total_free_conses
));
5628 total
[1] = Fcons (make_number (total_symbols
),
5629 make_number (total_free_symbols
));
5630 total
[2] = Fcons (make_number (total_markers
),
5631 make_number (total_free_markers
));
5632 total
[3] = make_number (total_string_size
);
5633 total
[4] = make_number (total_vector_size
);
5634 total
[5] = Fcons (make_number (total_floats
),
5635 make_number (total_free_floats
));
5636 total
[6] = Fcons (make_number (total_intervals
),
5637 make_number (total_free_intervals
));
5638 total
[7] = Fcons (make_number (total_strings
),
5639 make_number (total_free_strings
));
5641 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
5643 /* Compute average percentage of zombies. */
5646 for (i
= 0; i
< 7; ++i
)
5647 if (CONSP (total
[i
]))
5648 nlive
+= XFASTINT (XCAR (total
[i
]));
5650 avg_live
= (avg_live
* ngcs
+ nlive
) / (ngcs
+ 1);
5651 max_live
= max (nlive
, max_live
);
5652 avg_zombies
= (avg_zombies
* ngcs
+ nzombies
) / (ngcs
+ 1);
5653 max_zombies
= max (nzombies
, max_zombies
);
5658 if (!NILP (Vpost_gc_hook
))
5660 ptrdiff_t gc_count
= inhibit_garbage_collection ();
5661 safe_run_hooks (Qpost_gc_hook
);
5662 unbind_to (gc_count
, Qnil
);
5665 /* Accumulate statistics. */
5666 if (FLOATP (Vgc_elapsed
))
5668 EMACS_GET_TIME (t2
);
5669 EMACS_SUB_TIME (t3
, t2
, t1
);
5670 Vgc_elapsed
= make_float (XFLOAT_DATA (Vgc_elapsed
)
5671 + EMACS_TIME_TO_DOUBLE (t3
));
5676 return Flist (sizeof total
/ sizeof *total
, total
);
5680 /* Mark Lisp objects in glyph matrix MATRIX. Currently the
5681 only interesting objects referenced from glyphs are strings. */
5684 mark_glyph_matrix (struct glyph_matrix
*matrix
)
5686 struct glyph_row
*row
= matrix
->rows
;
5687 struct glyph_row
*end
= row
+ matrix
->nrows
;
5689 for (; row
< end
; ++row
)
5693 for (area
= LEFT_MARGIN_AREA
; area
< LAST_AREA
; ++area
)
5695 struct glyph
*glyph
= row
->glyphs
[area
];
5696 struct glyph
*end_glyph
= glyph
+ row
->used
[area
];
5698 for (; glyph
< end_glyph
; ++glyph
)
5699 if (STRINGP (glyph
->object
)
5700 && !STRING_MARKED_P (XSTRING (glyph
->object
)))
5701 mark_object (glyph
->object
);
5707 /* Mark Lisp faces in the face cache C. */
5710 mark_face_cache (struct face_cache
*c
)
5715 for (i
= 0; i
< c
->used
; ++i
)
5717 struct face
*face
= FACE_FROM_ID (c
->f
, i
);
5721 for (j
= 0; j
< LFACE_VECTOR_SIZE
; ++j
)
5722 mark_object (face
->lface
[j
]);
5730 /* Mark reference to a Lisp_Object.
5731 If the object referred to has not been seen yet, recursively mark
5732 all the references contained in it. */
5734 #define LAST_MARKED_SIZE 500
5735 static Lisp_Object last_marked
[LAST_MARKED_SIZE
];
5736 static int last_marked_index
;
5738 /* For debugging--call abort when we cdr down this many
5739 links of a list, in mark_object. In debugging,
5740 the call to abort will hit a breakpoint.
5741 Normally this is zero and the check never goes off. */
5742 ptrdiff_t mark_object_loop_halt EXTERNALLY_VISIBLE
;
5745 mark_vectorlike (struct Lisp_Vector
*ptr
)
5747 ptrdiff_t size
= ptr
->header
.size
;
5750 eassert (!VECTOR_MARKED_P (ptr
));
5751 VECTOR_MARK (ptr
); /* Else mark it. */
5752 if (size
& PSEUDOVECTOR_FLAG
)
5753 size
&= PSEUDOVECTOR_SIZE_MASK
;
5755 /* Note that this size is not the memory-footprint size, but only
5756 the number of Lisp_Object fields that we should trace.
5757 The distinction is used e.g. by Lisp_Process which places extra
5758 non-Lisp_Object fields at the end of the structure... */
5759 for (i
= 0; i
< size
; i
++) /* ...and then mark its elements. */
5760 mark_object (ptr
->contents
[i
]);
5763 /* Like mark_vectorlike but optimized for char-tables (and
5764 sub-char-tables) assuming that the contents are mostly integers or
5768 mark_char_table (struct Lisp_Vector
*ptr
)
5770 int size
= ptr
->header
.size
& PSEUDOVECTOR_SIZE_MASK
;
5773 eassert (!VECTOR_MARKED_P (ptr
));
5775 for (i
= 0; i
< size
; i
++)
5777 Lisp_Object val
= ptr
->contents
[i
];
5779 if (INTEGERP (val
) || (SYMBOLP (val
) && XSYMBOL (val
)->gcmarkbit
))
5781 if (SUB_CHAR_TABLE_P (val
))
5783 if (! VECTOR_MARKED_P (XVECTOR (val
)))
5784 mark_char_table (XVECTOR (val
));
5791 /* Mark the chain of overlays starting at PTR. */
5794 mark_overlay (struct Lisp_Overlay
*ptr
)
5796 for (; ptr
&& !ptr
->gcmarkbit
; ptr
= ptr
->next
)
5799 mark_object (ptr
->start
);
5800 mark_object (ptr
->end
);
5801 mark_object (ptr
->plist
);
5805 /* Mark Lisp_Objects and special pointers in BUFFER. */
5808 mark_buffer (struct buffer
*buffer
)
5810 /* This is handled much like other pseudovectors... */
5811 mark_vectorlike ((struct Lisp_Vector
*) buffer
);
5813 /* ...but there are some buffer-specific things. */
5815 MARK_INTERVAL_TREE (BUF_INTERVALS (buffer
));
5817 /* For now, we just don't mark the undo_list. It's done later in
5818 a special way just before the sweep phase, and after stripping
5819 some of its elements that are not needed any more. */
5821 mark_overlay (buffer
->overlays_before
);
5822 mark_overlay (buffer
->overlays_after
);
5824 /* If this is an indirect buffer, mark its base buffer. */
5825 if (buffer
->base_buffer
&& !VECTOR_MARKED_P (buffer
->base_buffer
))
5826 mark_buffer (buffer
->base_buffer
);
5829 /* Determine type of generic Lisp_Object and mark it accordingly. */
5832 mark_object (Lisp_Object arg
)
5834 register Lisp_Object obj
= arg
;
5835 #ifdef GC_CHECK_MARKED_OBJECTS
5839 ptrdiff_t cdr_count
= 0;
5843 if (PURE_POINTER_P (XPNTR (obj
)))
5846 last_marked
[last_marked_index
++] = obj
;
5847 if (last_marked_index
== LAST_MARKED_SIZE
)
5848 last_marked_index
= 0;
5850 /* Perform some sanity checks on the objects marked here. Abort if
5851 we encounter an object we know is bogus. This increases GC time
5852 by ~80%, and requires compilation with GC_MARK_STACK != 0. */
5853 #ifdef GC_CHECK_MARKED_OBJECTS
5855 po
= (void *) XPNTR (obj
);
5857 /* Check that the object pointed to by PO is known to be a Lisp
5858 structure allocated from the heap. */
5859 #define CHECK_ALLOCATED() \
5861 m = mem_find (po); \
5866 /* Check that the object pointed to by PO is live, using predicate
5868 #define CHECK_LIVE(LIVEP) \
5870 if (!LIVEP (m, po)) \
5874 /* Check both of the above conditions. */
5875 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) \
5877 CHECK_ALLOCATED (); \
5878 CHECK_LIVE (LIVEP); \
5881 #else /* not GC_CHECK_MARKED_OBJECTS */
5883 #define CHECK_LIVE(LIVEP) (void) 0
5884 #define CHECK_ALLOCATED_AND_LIVE(LIVEP) (void) 0
5886 #endif /* not GC_CHECK_MARKED_OBJECTS */
5888 switch (SWITCH_ENUM_CAST (XTYPE (obj
)))
5892 register struct Lisp_String
*ptr
= XSTRING (obj
);
5893 if (STRING_MARKED_P (ptr
))
5895 CHECK_ALLOCATED_AND_LIVE (live_string_p
);
5897 MARK_INTERVAL_TREE (ptr
->intervals
);
5898 #ifdef GC_CHECK_STRING_BYTES
5899 /* Check that the string size recorded in the string is the
5900 same as the one recorded in the sdata structure. */
5901 CHECK_STRING_BYTES (ptr
);
5902 #endif /* GC_CHECK_STRING_BYTES */
5906 case Lisp_Vectorlike
:
5908 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
5909 register ptrdiff_t pvectype
;
5911 if (VECTOR_MARKED_P (ptr
))
5914 #ifdef GC_CHECK_MARKED_OBJECTS
5916 if (m
== MEM_NIL
&& !SUBRP (obj
)
5917 && po
!= &buffer_defaults
5918 && po
!= &buffer_local_symbols
)
5920 #endif /* GC_CHECK_MARKED_OBJECTS */
5922 if (ptr
->header
.size
& PSEUDOVECTOR_FLAG
)
5923 pvectype
= ((ptr
->header
.size
& PVEC_TYPE_MASK
)
5924 >> PSEUDOVECTOR_SIZE_BITS
);
5928 if (pvectype
!= PVEC_SUBR
&& pvectype
!= PVEC_BUFFER
)
5929 CHECK_LIVE (live_vector_p
);
5934 #ifdef GC_CHECK_MARKED_OBJECTS
5935 if (po
!= &buffer_defaults
&& po
!= &buffer_local_symbols
)
5937 struct buffer
*b
= all_buffers
;
5938 for (; b
&& b
!= po
; b
= b
->header
.next
.buffer
)
5943 #endif /* GC_CHECK_MARKED_OBJECTS */
5944 mark_buffer ((struct buffer
*) ptr
);
5948 { /* We could treat this just like a vector, but it is better
5949 to save the COMPILED_CONSTANTS element for last and avoid
5951 int size
= ptr
->header
.size
& PSEUDOVECTOR_SIZE_MASK
;
5955 for (i
= 0; i
< size
; i
++)
5956 if (i
!= COMPILED_CONSTANTS
)
5957 mark_object (ptr
->contents
[i
]);
5958 if (size
> COMPILED_CONSTANTS
)
5960 obj
= ptr
->contents
[COMPILED_CONSTANTS
];
5968 mark_vectorlike (ptr
);
5969 mark_face_cache (((struct frame
*) ptr
)->face_cache
);
5975 struct window
*w
= (struct window
*) ptr
;
5977 mark_vectorlike (ptr
);
5978 /* Mark glyphs for leaf windows. Marking window
5979 matrices is sufficient because frame matrices
5980 use the same glyph memory. */
5981 if (NILP (w
->hchild
) && NILP (w
->vchild
) && w
->current_matrix
)
5983 mark_glyph_matrix (w
->current_matrix
);
5984 mark_glyph_matrix (w
->desired_matrix
);
5989 case PVEC_HASH_TABLE
:
5991 struct Lisp_Hash_Table
*h
= (struct Lisp_Hash_Table
*) ptr
;
5993 mark_vectorlike (ptr
);
5994 /* If hash table is not weak, mark all keys and values.
5995 For weak tables, mark only the vector. */
5997 mark_object (h
->key_and_value
);
5999 VECTOR_MARK (XVECTOR (h
->key_and_value
));
6003 case PVEC_CHAR_TABLE
:
6004 mark_char_table (ptr
);
6007 case PVEC_BOOL_VECTOR
:
6008 /* No Lisp_Objects to mark in a bool vector. */
6019 mark_vectorlike (ptr
);
6026 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
6027 struct Lisp_Symbol
*ptrx
;
6031 CHECK_ALLOCATED_AND_LIVE (live_symbol_p
);
6033 mark_object (ptr
->function
);
6034 mark_object (ptr
->plist
);
6035 switch (ptr
->redirect
)
6037 case SYMBOL_PLAINVAL
: mark_object (SYMBOL_VAL (ptr
)); break;
6038 case SYMBOL_VARALIAS
:
6041 XSETSYMBOL (tem
, SYMBOL_ALIAS (ptr
));
6045 case SYMBOL_LOCALIZED
:
6047 struct Lisp_Buffer_Local_Value
*blv
= SYMBOL_BLV (ptr
);
6048 /* If the value is forwarded to a buffer or keyboard field,
6049 these are marked when we see the corresponding object.
6050 And if it's forwarded to a C variable, either it's not
6051 a Lisp_Object var, or it's staticpro'd already. */
6052 mark_object (blv
->where
);
6053 mark_object (blv
->valcell
);
6054 mark_object (blv
->defcell
);
6057 case SYMBOL_FORWARDED
:
6058 /* If the value is forwarded to a buffer or keyboard field,
6059 these are marked when we see the corresponding object.
6060 And if it's forwarded to a C variable, either it's not
6061 a Lisp_Object var, or it's staticpro'd already. */
6065 if (!PURE_POINTER_P (XSTRING (ptr
->xname
)))
6066 MARK_STRING (XSTRING (ptr
->xname
));
6067 MARK_INTERVAL_TREE (STRING_INTERVALS (ptr
->xname
));
6072 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun. */
6073 XSETSYMBOL (obj
, ptrx
);
6080 CHECK_ALLOCATED_AND_LIVE (live_misc_p
);
6082 if (XMISCANY (obj
)->gcmarkbit
)
6085 switch (XMISCTYPE (obj
))
6087 case Lisp_Misc_Marker
:
6088 /* DO NOT mark thru the marker's chain.
6089 The buffer's markers chain does not preserve markers from gc;
6090 instead, markers are removed from the chain when freed by gc. */
6091 XMISCANY (obj
)->gcmarkbit
= 1;
6094 case Lisp_Misc_Save_Value
:
6095 XMISCANY (obj
)->gcmarkbit
= 1;
6098 register struct Lisp_Save_Value
*ptr
= XSAVE_VALUE (obj
);
6099 /* If DOGC is set, POINTER is the address of a memory
6100 area containing INTEGER potential Lisp_Objects. */
6103 Lisp_Object
*p
= (Lisp_Object
*) ptr
->pointer
;
6105 for (nelt
= ptr
->integer
; nelt
> 0; nelt
--, p
++)
6106 mark_maybe_object (*p
);
6112 case Lisp_Misc_Overlay
:
6113 mark_overlay (XOVERLAY (obj
));
6123 register struct Lisp_Cons
*ptr
= XCONS (obj
);
6124 if (CONS_MARKED_P (ptr
))
6126 CHECK_ALLOCATED_AND_LIVE (live_cons_p
);
6128 /* If the cdr is nil, avoid recursion for the car. */
6129 if (EQ (ptr
->u
.cdr
, Qnil
))
6135 mark_object (ptr
->car
);
6138 if (cdr_count
== mark_object_loop_halt
)
6144 CHECK_ALLOCATED_AND_LIVE (live_float_p
);
6145 FLOAT_MARK (XFLOAT (obj
));
6156 #undef CHECK_ALLOCATED
6157 #undef CHECK_ALLOCATED_AND_LIVE
6159 /* Mark the Lisp pointers in the terminal objects.
6160 Called by Fgarbage_collect. */
6163 mark_terminals (void)
6166 for (t
= terminal_list
; t
; t
= t
->next_terminal
)
6168 eassert (t
->name
!= NULL
);
6169 #ifdef HAVE_WINDOW_SYSTEM
6170 /* If a terminal object is reachable from a stacpro'ed object,
6171 it might have been marked already. Make sure the image cache
6173 mark_image_cache (t
->image_cache
);
6174 #endif /* HAVE_WINDOW_SYSTEM */
6175 if (!VECTOR_MARKED_P (t
))
6176 mark_vectorlike ((struct Lisp_Vector
*)t
);
6182 /* Value is non-zero if OBJ will survive the current GC because it's
6183 either marked or does not need to be marked to survive. */
6186 survives_gc_p (Lisp_Object obj
)
6190 switch (XTYPE (obj
))
6197 survives_p
= XSYMBOL (obj
)->gcmarkbit
;
6201 survives_p
= XMISCANY (obj
)->gcmarkbit
;
6205 survives_p
= STRING_MARKED_P (XSTRING (obj
));
6208 case Lisp_Vectorlike
:
6209 survives_p
= SUBRP (obj
) || VECTOR_MARKED_P (XVECTOR (obj
));
6213 survives_p
= CONS_MARKED_P (XCONS (obj
));
6217 survives_p
= FLOAT_MARKED_P (XFLOAT (obj
));
6224 return survives_p
|| PURE_POINTER_P ((void *) XPNTR (obj
));
6229 /* Sweep: find all structures not marked, and free them. */
6234 /* Remove or mark entries in weak hash tables.
6235 This must be done before any object is unmarked. */
6236 sweep_weak_hash_tables ();
6239 #ifdef GC_CHECK_STRING_BYTES
6240 if (!noninteractive
)
6241 check_string_bytes (1);
6244 /* Put all unmarked conses on free list */
6246 register struct cons_block
*cblk
;
6247 struct cons_block
**cprev
= &cons_block
;
6248 register int lim
= cons_block_index
;
6249 EMACS_INT num_free
= 0, num_used
= 0;
6253 for (cblk
= cons_block
; cblk
; cblk
= *cprev
)
6257 int ilim
= (lim
+ BITS_PER_INT
- 1) / BITS_PER_INT
;
6259 /* Scan the mark bits an int at a time. */
6260 for (i
= 0; i
< ilim
; i
++)
6262 if (cblk
->gcmarkbits
[i
] == -1)
6264 /* Fast path - all cons cells for this int are marked. */
6265 cblk
->gcmarkbits
[i
] = 0;
6266 num_used
+= BITS_PER_INT
;
6270 /* Some cons cells for this int are not marked.
6271 Find which ones, and free them. */
6272 int start
, pos
, stop
;
6274 start
= i
* BITS_PER_INT
;
6276 if (stop
> BITS_PER_INT
)
6277 stop
= BITS_PER_INT
;
6280 for (pos
= start
; pos
< stop
; pos
++)
6282 if (!CONS_MARKED_P (&cblk
->conses
[pos
]))
6285 cblk
->conses
[pos
].u
.chain
= cons_free_list
;
6286 cons_free_list
= &cblk
->conses
[pos
];
6288 cons_free_list
->car
= Vdead
;
6294 CONS_UNMARK (&cblk
->conses
[pos
]);
6300 lim
= CONS_BLOCK_SIZE
;
6301 /* If this block contains only free conses and we have already
6302 seen more than two blocks worth of free conses then deallocate
6304 if (this_free
== CONS_BLOCK_SIZE
&& num_free
> CONS_BLOCK_SIZE
)
6306 *cprev
= cblk
->next
;
6307 /* Unhook from the free list. */
6308 cons_free_list
= cblk
->conses
[0].u
.chain
;
6309 lisp_align_free (cblk
);
6313 num_free
+= this_free
;
6314 cprev
= &cblk
->next
;
6317 total_conses
= num_used
;
6318 total_free_conses
= num_free
;
6321 /* Put all unmarked floats on free list */
6323 register struct float_block
*fblk
;
6324 struct float_block
**fprev
= &float_block
;
6325 register int lim
= float_block_index
;
6326 EMACS_INT num_free
= 0, num_used
= 0;
6328 float_free_list
= 0;
6330 for (fblk
= float_block
; fblk
; fblk
= *fprev
)
6334 for (i
= 0; i
< lim
; i
++)
6335 if (!FLOAT_MARKED_P (&fblk
->floats
[i
]))
6338 fblk
->floats
[i
].u
.chain
= float_free_list
;
6339 float_free_list
= &fblk
->floats
[i
];
6344 FLOAT_UNMARK (&fblk
->floats
[i
]);
6346 lim
= FLOAT_BLOCK_SIZE
;
6347 /* If this block contains only free floats and we have already
6348 seen more than two blocks worth of free floats then deallocate
6350 if (this_free
== FLOAT_BLOCK_SIZE
&& num_free
> FLOAT_BLOCK_SIZE
)
6352 *fprev
= fblk
->next
;
6353 /* Unhook from the free list. */
6354 float_free_list
= fblk
->floats
[0].u
.chain
;
6355 lisp_align_free (fblk
);
6359 num_free
+= this_free
;
6360 fprev
= &fblk
->next
;
6363 total_floats
= num_used
;
6364 total_free_floats
= num_free
;
6367 /* Put all unmarked intervals on free list */
6369 register struct interval_block
*iblk
;
6370 struct interval_block
**iprev
= &interval_block
;
6371 register int lim
= interval_block_index
;
6372 EMACS_INT num_free
= 0, num_used
= 0;
6374 interval_free_list
= 0;
6376 for (iblk
= interval_block
; iblk
; iblk
= *iprev
)
6381 for (i
= 0; i
< lim
; i
++)
6383 if (!iblk
->intervals
[i
].gcmarkbit
)
6385 SET_INTERVAL_PARENT (&iblk
->intervals
[i
], interval_free_list
);
6386 interval_free_list
= &iblk
->intervals
[i
];
6392 iblk
->intervals
[i
].gcmarkbit
= 0;
6395 lim
= INTERVAL_BLOCK_SIZE
;
6396 /* If this block contains only free intervals and we have already
6397 seen more than two blocks worth of free intervals then
6398 deallocate this block. */
6399 if (this_free
== INTERVAL_BLOCK_SIZE
&& num_free
> INTERVAL_BLOCK_SIZE
)
6401 *iprev
= iblk
->next
;
6402 /* Unhook from the free list. */
6403 interval_free_list
= INTERVAL_PARENT (&iblk
->intervals
[0]);
6408 num_free
+= this_free
;
6409 iprev
= &iblk
->next
;
6412 total_intervals
= num_used
;
6413 total_free_intervals
= num_free
;
6416 /* Put all unmarked symbols on free list */
6418 register struct symbol_block
*sblk
;
6419 struct symbol_block
**sprev
= &symbol_block
;
6420 register int lim
= symbol_block_index
;
6421 EMACS_INT num_free
= 0, num_used
= 0;
6423 symbol_free_list
= NULL
;
6425 for (sblk
= symbol_block
; sblk
; sblk
= *sprev
)
6428 union aligned_Lisp_Symbol
*sym
= sblk
->symbols
;
6429 union aligned_Lisp_Symbol
*end
= sym
+ lim
;
6431 for (; sym
< end
; ++sym
)
6433 /* Check if the symbol was created during loadup. In such a case
6434 it might be pointed to by pure bytecode which we don't trace,
6435 so we conservatively assume that it is live. */
6436 int pure_p
= PURE_POINTER_P (XSTRING (sym
->s
.xname
));
6438 if (!sym
->s
.gcmarkbit
&& !pure_p
)
6440 if (sym
->s
.redirect
== SYMBOL_LOCALIZED
)
6441 xfree (SYMBOL_BLV (&sym
->s
));
6442 sym
->s
.next
= symbol_free_list
;
6443 symbol_free_list
= &sym
->s
;
6445 symbol_free_list
->function
= Vdead
;
6453 UNMARK_STRING (XSTRING (sym
->s
.xname
));
6454 sym
->s
.gcmarkbit
= 0;
6458 lim
= SYMBOL_BLOCK_SIZE
;
6459 /* If this block contains only free symbols and we have already
6460 seen more than two blocks worth of free symbols then deallocate
6462 if (this_free
== SYMBOL_BLOCK_SIZE
&& num_free
> SYMBOL_BLOCK_SIZE
)
6464 *sprev
= sblk
->next
;
6465 /* Unhook from the free list. */
6466 symbol_free_list
= sblk
->symbols
[0].s
.next
;
6471 num_free
+= this_free
;
6472 sprev
= &sblk
->next
;
6475 total_symbols
= num_used
;
6476 total_free_symbols
= num_free
;
6479 /* Put all unmarked misc's on free list.
6480 For a marker, first unchain it from the buffer it points into. */
6482 register struct marker_block
*mblk
;
6483 struct marker_block
**mprev
= &marker_block
;
6484 register int lim
= marker_block_index
;
6485 EMACS_INT num_free
= 0, num_used
= 0;
6487 marker_free_list
= 0;
6489 for (mblk
= marker_block
; mblk
; mblk
= *mprev
)
6494 for (i
= 0; i
< lim
; i
++)
6496 if (!mblk
->markers
[i
].m
.u_any
.gcmarkbit
)
6498 if (mblk
->markers
[i
].m
.u_any
.type
== Lisp_Misc_Marker
)
6499 unchain_marker (&mblk
->markers
[i
].m
.u_marker
);
6500 /* Set the type of the freed object to Lisp_Misc_Free.
6501 We could leave the type alone, since nobody checks it,
6502 but this might catch bugs faster. */
6503 mblk
->markers
[i
].m
.u_marker
.type
= Lisp_Misc_Free
;
6504 mblk
->markers
[i
].m
.u_free
.chain
= marker_free_list
;
6505 marker_free_list
= &mblk
->markers
[i
].m
;
6511 mblk
->markers
[i
].m
.u_any
.gcmarkbit
= 0;
6514 lim
= MARKER_BLOCK_SIZE
;
6515 /* If this block contains only free markers and we have already
6516 seen more than two blocks worth of free markers then deallocate
6518 if (this_free
== MARKER_BLOCK_SIZE
&& num_free
> MARKER_BLOCK_SIZE
)
6520 *mprev
= mblk
->next
;
6521 /* Unhook from the free list. */
6522 marker_free_list
= mblk
->markers
[0].m
.u_free
.chain
;
6527 num_free
+= this_free
;
6528 mprev
= &mblk
->next
;
6532 total_markers
= num_used
;
6533 total_free_markers
= num_free
;
6536 /* Free all unmarked buffers */
6538 register struct buffer
*buffer
= all_buffers
, *prev
= 0, *next
;
6541 if (!VECTOR_MARKED_P (buffer
))
6544 prev
->header
.next
= buffer
->header
.next
;
6546 all_buffers
= buffer
->header
.next
.buffer
;
6547 next
= buffer
->header
.next
.buffer
;
6553 VECTOR_UNMARK (buffer
);
6554 UNMARK_BALANCE_INTERVALS (BUF_INTERVALS (buffer
));
6555 prev
= buffer
, buffer
= buffer
->header
.next
.buffer
;
6561 #ifdef GC_CHECK_STRING_BYTES
6562 if (!noninteractive
)
6563 check_string_bytes (1);
6570 /* Debugging aids. */
6572 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
6573 doc
: /* Return the address of the last byte Emacs has allocated, divided by 1024.
6574 This may be helpful in debugging Emacs's memory usage.
6575 We divide the value by 1024 to make sure it fits in a Lisp integer. */)
6580 XSETINT (end
, (intptr_t) (char *) sbrk (0) / 1024);
6585 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
6586 doc
: /* Return a list of counters that measure how much consing there has been.
6587 Each of these counters increments for a certain kind of object.
6588 The counters wrap around from the largest positive integer to zero.
6589 Garbage collection does not decrease them.
6590 The elements of the value are as follows:
6591 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS STRINGS)
6592 All are in units of 1 = one object consed
6593 except for VECTOR-CELLS and STRING-CHARS, which count the total length of
6595 MISCS include overlays, markers, and some internal types.
6596 Frames, windows, buffers, and subprocesses count as vectors
6597 (but the contents of a buffer's text do not count here). */)
6600 Lisp_Object consed
[8];
6602 consed
[0] = make_number (min (MOST_POSITIVE_FIXNUM
, cons_cells_consed
));
6603 consed
[1] = make_number (min (MOST_POSITIVE_FIXNUM
, floats_consed
));
6604 consed
[2] = make_number (min (MOST_POSITIVE_FIXNUM
, vector_cells_consed
));
6605 consed
[3] = make_number (min (MOST_POSITIVE_FIXNUM
, symbols_consed
));
6606 consed
[4] = make_number (min (MOST_POSITIVE_FIXNUM
, string_chars_consed
));
6607 consed
[5] = make_number (min (MOST_POSITIVE_FIXNUM
, misc_objects_consed
));
6608 consed
[6] = make_number (min (MOST_POSITIVE_FIXNUM
, intervals_consed
));
6609 consed
[7] = make_number (min (MOST_POSITIVE_FIXNUM
, strings_consed
));
6611 return Flist (8, consed
);
6614 /* Find at most FIND_MAX symbols which have OBJ as their value or
6615 function. This is used in gdbinit's `xwhichsymbols' command. */
6618 which_symbols (Lisp_Object obj
, EMACS_INT find_max
)
6620 struct symbol_block
*sblk
;
6621 ptrdiff_t gc_count
= inhibit_garbage_collection ();
6622 Lisp_Object found
= Qnil
;
6626 for (sblk
= symbol_block
; sblk
; sblk
= sblk
->next
)
6628 union aligned_Lisp_Symbol
*aligned_sym
= sblk
->symbols
;
6631 for (bn
= 0; bn
< SYMBOL_BLOCK_SIZE
; bn
++, aligned_sym
++)
6633 struct Lisp_Symbol
*sym
= &aligned_sym
->s
;
6637 if (sblk
== symbol_block
&& bn
>= symbol_block_index
)
6640 XSETSYMBOL (tem
, sym
);
6641 val
= find_symbol_value (tem
);
6643 || EQ (sym
->function
, obj
)
6644 || (!NILP (sym
->function
)
6645 && COMPILEDP (sym
->function
)
6646 && EQ (AREF (sym
->function
, COMPILED_BYTECODE
), obj
))
6649 && EQ (AREF (val
, COMPILED_BYTECODE
), obj
)))
6651 found
= Fcons (tem
, found
);
6652 if (--find_max
== 0)
6660 unbind_to (gc_count
, Qnil
);
6664 #ifdef ENABLE_CHECKING
6665 int suppress_checking
;
6668 die (const char *msg
, const char *file
, int line
)
6670 fprintf (stderr
, "\r\n%s:%d: Emacs fatal error: %s\r\n",
6676 /* Initialization */
6679 init_alloc_once (void)
6681 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
6683 pure_size
= PURESIZE
;
6684 pure_bytes_used
= 0;
6685 pure_bytes_used_lisp
= pure_bytes_used_non_lisp
= 0;
6686 pure_bytes_used_before_overflow
= 0;
6688 /* Initialize the list of free aligned blocks. */
6691 #if GC_MARK_STACK || defined GC_MALLOC_CHECK
6693 Vdead
= make_pure_string ("DEAD", 4, 4, 0);
6696 ignore_warnings
= 1;
6697 #ifdef DOUG_LEA_MALLOC
6698 mallopt (M_TRIM_THRESHOLD
, 128*1024); /* trim threshold */
6699 mallopt (M_MMAP_THRESHOLD
, 64*1024); /* mmap threshold */
6700 mallopt (M_MMAP_MAX
, MMAP_MAX_AREAS
); /* max. number of mmap'ed areas */
6709 init_weak_hash_tables ();
6712 malloc_hysteresis
= 32;
6714 malloc_hysteresis
= 0;
6717 refill_memory_reserve ();
6719 ignore_warnings
= 0;
6721 byte_stack_list
= 0;
6723 consing_since_gc
= 0;
6724 gc_cons_threshold
= 100000 * sizeof (Lisp_Object
);
6725 gc_relative_threshold
= 0;
6732 byte_stack_list
= 0;
6734 #if !defined GC_SAVE_REGISTERS_ON_STACK && !defined GC_SETJMP_WORKS
6735 setjmp_tested_p
= longjmps_done
= 0;
6738 Vgc_elapsed
= make_float (0.0);
6743 syms_of_alloc (void)
6745 DEFVAR_INT ("gc-cons-threshold", gc_cons_threshold
,
6746 doc
: /* Number of bytes of consing between garbage collections.
6747 Garbage collection can happen automatically once this many bytes have been
6748 allocated since the last garbage collection. All data types count.
6750 Garbage collection happens automatically only when `eval' is called.
6752 By binding this temporarily to a large number, you can effectively
6753 prevent garbage collection during a part of the program.
6754 See also `gc-cons-percentage'. */);
6756 DEFVAR_LISP ("gc-cons-percentage", Vgc_cons_percentage
,
6757 doc
: /* Portion of the heap used for allocation.
6758 Garbage collection can happen automatically once this portion of the heap
6759 has been allocated since the last garbage collection.
6760 If this portion is smaller than `gc-cons-threshold', this is ignored. */);
6761 Vgc_cons_percentage
= make_float (0.1);
6763 DEFVAR_INT ("pure-bytes-used", pure_bytes_used
,
6764 doc
: /* Number of bytes of shareable Lisp data allocated so far. */);
6766 DEFVAR_INT ("cons-cells-consed", cons_cells_consed
,
6767 doc
: /* Number of cons cells that have been consed so far. */);
6769 DEFVAR_INT ("floats-consed", floats_consed
,
6770 doc
: /* Number of floats that have been consed so far. */);
6772 DEFVAR_INT ("vector-cells-consed", vector_cells_consed
,
6773 doc
: /* Number of vector cells that have been consed so far. */);
6775 DEFVAR_INT ("symbols-consed", symbols_consed
,
6776 doc
: /* Number of symbols that have been consed so far. */);
6778 DEFVAR_INT ("string-chars-consed", string_chars_consed
,
6779 doc
: /* Number of string characters that have been consed so far. */);
6781 DEFVAR_INT ("misc-objects-consed", misc_objects_consed
,
6782 doc
: /* Number of miscellaneous objects that have been consed so far.
6783 These include markers and overlays, plus certain objects not visible
6786 DEFVAR_INT ("intervals-consed", intervals_consed
,
6787 doc
: /* Number of intervals that have been consed so far. */);
6789 DEFVAR_INT ("strings-consed", strings_consed
,
6790 doc
: /* Number of strings that have been consed so far. */);
6792 DEFVAR_LISP ("purify-flag", Vpurify_flag
,
6793 doc
: /* Non-nil means loading Lisp code in order to dump an executable.
6794 This means that certain objects should be allocated in shared (pure) space.
6795 It can also be set to a hash-table, in which case this table is used to
6796 do hash-consing of the objects allocated to pure space. */);
6798 DEFVAR_BOOL ("garbage-collection-messages", garbage_collection_messages
,
6799 doc
: /* Non-nil means display messages at start and end of garbage collection. */);
6800 garbage_collection_messages
= 0;
6802 DEFVAR_LISP ("post-gc-hook", Vpost_gc_hook
,
6803 doc
: /* Hook run after garbage collection has finished. */);
6804 Vpost_gc_hook
= Qnil
;
6805 DEFSYM (Qpost_gc_hook
, "post-gc-hook");
6807 DEFVAR_LISP ("memory-signal-data", Vmemory_signal_data
,
6808 doc
: /* Precomputed `signal' argument for memory-full error. */);
6809 /* We build this in advance because if we wait until we need it, we might
6810 not be able to allocate the memory to hold it. */
6812 = pure_cons (Qerror
,
6813 pure_cons (make_pure_c_string ("Memory exhausted--use M-x save-some-buffers then exit and restart Emacs"), Qnil
));
6815 DEFVAR_LISP ("memory-full", Vmemory_full
,
6816 doc
: /* Non-nil means Emacs cannot get much more Lisp memory. */);
6817 Vmemory_full
= Qnil
;
6819 DEFSYM (Qgc_cons_threshold
, "gc-cons-threshold");
6820 DEFSYM (Qchar_table_extra_slots
, "char-table-extra-slots");
6822 DEFVAR_LISP ("gc-elapsed", Vgc_elapsed
,
6823 doc
: /* Accumulated time elapsed in garbage collections.
6824 The time is in seconds as a floating point value. */);
6825 DEFVAR_INT ("gcs-done", gcs_done
,
6826 doc
: /* Accumulated number of garbage collections done. */);
6831 defsubr (&Smake_byte_code
);
6832 defsubr (&Smake_list
);
6833 defsubr (&Smake_vector
);
6834 defsubr (&Smake_string
);
6835 defsubr (&Smake_bool_vector
);
6836 defsubr (&Smake_symbol
);
6837 defsubr (&Smake_marker
);
6838 defsubr (&Spurecopy
);
6839 defsubr (&Sgarbage_collect
);
6840 defsubr (&Smemory_limit
);
6841 defsubr (&Smemory_use_counts
);
6843 #if GC_MARK_STACK == GC_USE_GCPROS_CHECK_ZOMBIES
6844 defsubr (&Sgc_status
);