1 /* Storage allocation and gc for GNU Emacs Lisp interpreter.
2 Copyright (C) 1985, 86, 88, 93, 94, 95 Free Software Foundation, Inc.
4 This file is part of GNU Emacs.
6 GNU Emacs is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
11 GNU Emacs is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GNU Emacs; see the file COPYING. If not, write to
18 the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */
24 #include "intervals.h"
30 #include "blockinput.h"
34 #include "syssignal.h"
38 /* The following come from gmalloc.c. */
40 #if defined (__STDC__) && __STDC__
42 #define __malloc_size_t size_t
44 #define __malloc_size_t unsigned int
46 extern __malloc_size_t _bytes_used
;
47 extern int __malloc_extra_blocks
;
49 #define max(A,B) ((A) > (B) ? (A) : (B))
50 #define min(A,B) ((A) < (B) ? (A) : (B))
52 /* Macro to verify that storage intended for Lisp objects is not
53 out of range to fit in the space for a pointer.
54 ADDRESS is the start of the block, and SIZE
55 is the amount of space within which objects can start. */
56 #define VALIDATE_LISP_STORAGE(address, size) \
60 XSETCONS (val, (char *) address + size); \
61 if ((char *) XCONS (val) != (char *) address + size) \
68 /* Value of _bytes_used, when spare_memory was freed. */
69 static __malloc_size_t bytes_used_when_full
;
71 /* Number of bytes of consing done since the last gc */
74 /* Count the amount of consing of various sorts of space. */
75 int cons_cells_consed
;
77 int vector_cells_consed
;
79 int string_chars_consed
;
80 int misc_objects_consed
;
83 /* Number of bytes of consing since gc before another gc should be done. */
84 int gc_cons_threshold
;
86 /* Nonzero during gc */
89 #ifndef VIRT_ADDR_VARIES
91 #endif /* VIRT_ADDR_VARIES */
94 #ifndef VIRT_ADDR_VARIES
96 #endif /* VIRT_ADDR_VARIES */
97 int malloc_sbrk_unused
;
99 /* Two limits controlling how much undo information to keep. */
101 int undo_strong_limit
;
103 /* Points to memory space allocated as "spare",
104 to be freed if we run out of memory. */
105 static char *spare_memory
;
107 /* Amount of spare memory to keep in reserve. */
108 #define SPARE_MEMORY (1 << 14)
110 /* Number of extra blocks malloc should get when it needs more core. */
111 static int malloc_hysteresis
;
113 /* Nonzero when malloc is called for allocating Lisp object space. */
114 int allocating_for_lisp
;
116 /* Non-nil means defun should do purecopy on the function definition */
117 Lisp_Object Vpurify_flag
;
120 EMACS_INT pure
[PURESIZE
/ sizeof (EMACS_INT
)] = {0,}; /* Force it into data space! */
121 #define PUREBEG (char *) pure
123 #define pure PURE_SEG_BITS /* Use shared memory segment */
124 #define PUREBEG (char *)PURE_SEG_BITS
126 /* This variable is used only by the XPNTR macro when HAVE_SHM is
127 defined. If we used the PURESIZE macro directly there, that would
128 make most of emacs dependent on puresize.h, which we don't want -
129 you should be able to change that without too much recompilation.
130 So map_in_data initializes pure_size, and the dependencies work
133 #endif /* not HAVE_SHM */
135 /* Index in pure at which next pure object will be allocated. */
138 /* If nonzero, this is a warning delivered by malloc and not yet displayed. */
139 char *pending_malloc_warning
;
141 /* Pre-computed signal argument for use when memory is exhausted. */
142 Lisp_Object memory_signal_data
;
144 /* Maximum amount of C stack to save when a GC happens. */
146 #ifndef MAX_SAVE_STACK
147 #define MAX_SAVE_STACK 16000
150 /* Define DONT_COPY_FLAG to be some bit which will always be zero in a
151 pointer to a Lisp_Object, when that pointer is viewed as an integer.
152 (On most machines, pointers are even, so we can use the low bit.
153 Word-addressible architectures may need to override this in the m-file.)
154 When linking references to small strings through the size field, we
155 use this slot to hold the bit that would otherwise be interpreted as
157 #ifndef DONT_COPY_FLAG
158 #define DONT_COPY_FLAG 1
159 #endif /* no DONT_COPY_FLAG */
161 /* Buffer in which we save a copy of the C stack at each GC. */
166 /* Non-zero means ignore malloc warnings. Set during initialization. */
169 Lisp_Object Qgc_cons_threshold
;
171 static void mark_object (), mark_buffer (), mark_kboards ();
172 static void clear_marks (), gc_sweep ();
173 static void compact_strings ();
175 /* Versions of malloc and realloc that print warnings as memory gets full. */
178 malloc_warning_1 (str
)
181 Fprinc (str
, Vstandard_output
);
182 write_string ("\nKilling some buffers may delay running out of memory.\n", -1);
183 write_string ("However, certainly by the time you receive the 95% warning,\n", -1);
184 write_string ("you should clean up, kill this Emacs, and start a new one.", -1);
188 /* malloc calls this if it finds we are near exhausting storage */
192 pending_malloc_warning
= str
;
195 display_malloc_warning ()
197 register Lisp_Object val
;
199 val
= build_string (pending_malloc_warning
);
200 pending_malloc_warning
= 0;
201 internal_with_output_to_temp_buffer (" *Danger*", malloc_warning_1
, val
);
204 /* Called if malloc returns zero */
208 #ifndef SYSTEM_MALLOC
209 bytes_used_when_full
= _bytes_used
;
212 /* The first time we get here, free the spare memory. */
219 /* This used to call error, but if we've run out of memory, we could get
220 infinite recursion trying to build the string. */
222 Fsignal (Qerror
, memory_signal_data
);
225 /* Called if we can't allocate relocatable space for a buffer. */
228 buffer_memory_full ()
230 /* If buffers use the relocating allocator,
231 no need to free spare_memory, because we may have plenty of malloc
232 space left that we could get, and if we don't, the malloc that fails
233 will itself cause spare_memory to be freed.
234 If buffers don't use the relocating allocator,
235 treat this like any other failing malloc. */
241 /* This used to call error, but if we've run out of memory, we could get
242 infinite recursion trying to build the string. */
244 Fsignal (Qerror
, memory_signal_data
);
247 /* like malloc routines but check for no memory and block interrupt input. */
256 val
= (long *) malloc (size
);
259 if (!val
&& size
) memory_full ();
264 xrealloc (block
, size
)
271 /* We must call malloc explicitly when BLOCK is 0, since some
272 reallocs don't do this. */
274 val
= (long *) malloc (size
);
276 val
= (long *) realloc (block
, size
);
279 if (!val
&& size
) memory_full ();
293 /* Arranging to disable input signals while we're in malloc.
295 This only works with GNU malloc. To help out systems which can't
296 use GNU malloc, all the calls to malloc, realloc, and free
297 elsewhere in the code should be inside a BLOCK_INPUT/UNBLOCK_INPUT
298 pairs; unfortunately, we have no idea what C library functions
299 might call malloc, so we can't really protect them unless you're
300 using GNU malloc. Fortunately, most of the major operating can use
303 #ifndef SYSTEM_MALLOC
304 extern void * (*__malloc_hook
) ();
305 static void * (*old_malloc_hook
) ();
306 extern void * (*__realloc_hook
) ();
307 static void * (*old_realloc_hook
) ();
308 extern void (*__free_hook
) ();
309 static void (*old_free_hook
) ();
311 /* This function is used as the hook for free to call. */
314 emacs_blocked_free (ptr
)
318 __free_hook
= old_free_hook
;
320 /* If we released our reserve (due to running out of memory),
321 and we have a fair amount free once again,
322 try to set aside another reserve in case we run out once more. */
323 if (spare_memory
== 0
324 /* Verify there is enough space that even with the malloc
325 hysteresis this call won't run out again.
326 The code here is correct as long as SPARE_MEMORY
327 is substantially larger than the block size malloc uses. */
328 && (bytes_used_when_full
329 > _bytes_used
+ max (malloc_hysteresis
, 4) * SPARE_MEMORY
))
330 spare_memory
= (char *) malloc (SPARE_MEMORY
);
332 __free_hook
= emacs_blocked_free
;
336 /* If we released our reserve (due to running out of memory),
337 and we have a fair amount free once again,
338 try to set aside another reserve in case we run out once more.
340 This is called when a relocatable block is freed in ralloc.c. */
343 refill_memory_reserve ()
345 if (spare_memory
== 0)
346 spare_memory
= (char *) malloc (SPARE_MEMORY
);
349 /* This function is the malloc hook that Emacs uses. */
352 emacs_blocked_malloc (size
)
358 __malloc_hook
= old_malloc_hook
;
359 __malloc_extra_blocks
= malloc_hysteresis
;
360 value
= (void *) malloc (size
);
361 __malloc_hook
= emacs_blocked_malloc
;
368 emacs_blocked_realloc (ptr
, size
)
375 __realloc_hook
= old_realloc_hook
;
376 value
= (void *) realloc (ptr
, size
);
377 __realloc_hook
= emacs_blocked_realloc
;
384 uninterrupt_malloc ()
386 old_free_hook
= __free_hook
;
387 __free_hook
= emacs_blocked_free
;
389 old_malloc_hook
= __malloc_hook
;
390 __malloc_hook
= emacs_blocked_malloc
;
392 old_realloc_hook
= __realloc_hook
;
393 __realloc_hook
= emacs_blocked_realloc
;
397 /* Interval allocation. */
399 #ifdef USE_TEXT_PROPERTIES
400 #define INTERVAL_BLOCK_SIZE \
401 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
403 struct interval_block
405 struct interval_block
*next
;
406 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
409 struct interval_block
*interval_block
;
410 static int interval_block_index
;
412 INTERVAL interval_free_list
;
417 allocating_for_lisp
= 1;
419 = (struct interval_block
*) malloc (sizeof (struct interval_block
));
420 allocating_for_lisp
= 0;
421 interval_block
->next
= 0;
422 bzero (interval_block
->intervals
, sizeof interval_block
->intervals
);
423 interval_block_index
= 0;
424 interval_free_list
= 0;
427 #define INIT_INTERVALS init_intervals ()
434 if (interval_free_list
)
436 val
= interval_free_list
;
437 interval_free_list
= interval_free_list
->parent
;
441 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
443 register struct interval_block
*newi
;
445 allocating_for_lisp
= 1;
446 newi
= (struct interval_block
*) xmalloc (sizeof (struct interval_block
));
448 allocating_for_lisp
= 0;
449 VALIDATE_LISP_STORAGE (newi
, sizeof *newi
);
450 newi
->next
= interval_block
;
451 interval_block
= newi
;
452 interval_block_index
= 0;
454 val
= &interval_block
->intervals
[interval_block_index
++];
456 consing_since_gc
+= sizeof (struct interval
);
458 RESET_INTERVAL (val
);
462 static int total_free_intervals
, total_intervals
;
464 /* Mark the pointers of one interval. */
467 mark_interval (i
, dummy
)
471 if (XMARKBIT (i
->plist
))
473 mark_object (&i
->plist
);
478 mark_interval_tree (tree
)
479 register INTERVAL tree
;
481 /* No need to test if this tree has been marked already; this
482 function is always called through the MARK_INTERVAL_TREE macro,
483 which takes care of that. */
485 /* XMARK expands to an assignment; the LHS of an assignment can't be
487 XMARK (* (Lisp_Object
*) &tree
->parent
);
489 traverse_intervals (tree
, 1, 0, mark_interval
, Qnil
);
492 #define MARK_INTERVAL_TREE(i) \
494 if (!NULL_INTERVAL_P (i) \
495 && ! XMARKBIT ((Lisp_Object) i->parent)) \
496 mark_interval_tree (i); \
499 /* The oddity in the call to XUNMARK is necessary because XUNMARK
500 expands to an assignment to its argument, and most C compilers don't
501 support casts on the left operand of `='. */
502 #define UNMARK_BALANCE_INTERVALS(i) \
504 if (! NULL_INTERVAL_P (i)) \
506 XUNMARK (* (Lisp_Object *) (&(i)->parent)); \
507 (i) = balance_intervals (i); \
511 #else /* no interval use */
513 #define INIT_INTERVALS
515 #define UNMARK_BALANCE_INTERVALS(i)
516 #define MARK_INTERVAL_TREE(i)
518 #endif /* no interval use */
520 /* Floating point allocation. */
522 #ifdef LISP_FLOAT_TYPE
523 /* Allocation of float cells, just like conses */
524 /* We store float cells inside of float_blocks, allocating a new
525 float_block with malloc whenever necessary. Float cells reclaimed by
526 GC are put on a free list to be reallocated before allocating
527 any new float cells from the latest float_block.
529 Each float_block is just under 1020 bytes long,
530 since malloc really allocates in units of powers of two
531 and uses 4 bytes for its own overhead. */
533 #define FLOAT_BLOCK_SIZE \
534 ((1020 - sizeof (struct float_block *)) / sizeof (struct Lisp_Float))
538 struct float_block
*next
;
539 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
542 struct float_block
*float_block
;
543 int float_block_index
;
545 struct Lisp_Float
*float_free_list
;
550 allocating_for_lisp
= 1;
551 float_block
= (struct float_block
*) malloc (sizeof (struct float_block
));
552 allocating_for_lisp
= 0;
553 float_block
->next
= 0;
554 bzero (float_block
->floats
, sizeof float_block
->floats
);
555 float_block_index
= 0;
559 /* Explicitly free a float cell. */
561 struct Lisp_Float
*ptr
;
563 *(struct Lisp_Float
**)&ptr
->type
= float_free_list
;
564 float_free_list
= ptr
;
568 make_float (float_value
)
571 register Lisp_Object val
;
575 XSETFLOAT (val
, float_free_list
);
576 float_free_list
= *(struct Lisp_Float
**)&float_free_list
->type
;
580 if (float_block_index
== FLOAT_BLOCK_SIZE
)
582 register struct float_block
*new;
584 allocating_for_lisp
= 1;
585 new = (struct float_block
*) xmalloc (sizeof (struct float_block
));
586 allocating_for_lisp
= 0;
587 VALIDATE_LISP_STORAGE (new, sizeof *new);
588 new->next
= float_block
;
590 float_block_index
= 0;
592 XSETFLOAT (val
, &float_block
->floats
[float_block_index
++]);
594 XFLOAT (val
)->data
= float_value
;
595 XSETFASTINT (XFLOAT (val
)->type
, 0); /* bug chasing -wsr */
596 consing_since_gc
+= sizeof (struct Lisp_Float
);
601 #endif /* LISP_FLOAT_TYPE */
603 /* Allocation of cons cells */
604 /* We store cons cells inside of cons_blocks, allocating a new
605 cons_block with malloc whenever necessary. Cons cells reclaimed by
606 GC are put on a free list to be reallocated before allocating
607 any new cons cells from the latest cons_block.
609 Each cons_block is just under 1020 bytes long,
610 since malloc really allocates in units of powers of two
611 and uses 4 bytes for its own overhead. */
613 #define CONS_BLOCK_SIZE \
614 ((1020 - sizeof (struct cons_block *)) / sizeof (struct Lisp_Cons))
618 struct cons_block
*next
;
619 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
622 struct cons_block
*cons_block
;
623 int cons_block_index
;
625 struct Lisp_Cons
*cons_free_list
;
630 allocating_for_lisp
= 1;
631 cons_block
= (struct cons_block
*) malloc (sizeof (struct cons_block
));
632 allocating_for_lisp
= 0;
633 cons_block
->next
= 0;
634 bzero (cons_block
->conses
, sizeof cons_block
->conses
);
635 cons_block_index
= 0;
639 /* Explicitly free a cons cell. */
641 struct Lisp_Cons
*ptr
;
643 *(struct Lisp_Cons
**)&ptr
->car
= cons_free_list
;
644 cons_free_list
= ptr
;
647 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
648 "Create a new cons, give it CAR and CDR as components, and return it.")
650 Lisp_Object car
, cdr
;
652 register Lisp_Object val
;
656 XSETCONS (val
, cons_free_list
);
657 cons_free_list
= *(struct Lisp_Cons
**)&cons_free_list
->car
;
661 if (cons_block_index
== CONS_BLOCK_SIZE
)
663 register struct cons_block
*new;
664 allocating_for_lisp
= 1;
665 new = (struct cons_block
*) xmalloc (sizeof (struct cons_block
));
666 allocating_for_lisp
= 0;
667 VALIDATE_LISP_STORAGE (new, sizeof *new);
668 new->next
= cons_block
;
670 cons_block_index
= 0;
672 XSETCONS (val
, &cons_block
->conses
[cons_block_index
++]);
674 XCONS (val
)->car
= car
;
675 XCONS (val
)->cdr
= cdr
;
676 consing_since_gc
+= sizeof (struct Lisp_Cons
);
681 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
682 "Return a newly created list with specified arguments as elements.\n\
683 Any number of arguments, even zero arguments, are allowed.")
686 register Lisp_Object
*args
;
688 register Lisp_Object val
= Qnil
;
691 val
= Fcons (args
[nargs
], val
);
695 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
696 "Return a newly created list of length LENGTH, with each element being INIT.")
698 register Lisp_Object length
, init
;
700 register Lisp_Object val
;
703 CHECK_NATNUM (length
, 0);
704 size
= XFASTINT (length
);
708 val
= Fcons (init
, val
);
712 /* Allocation of vectors */
714 struct Lisp_Vector
*all_vectors
;
717 allocate_vectorlike (len
)
720 struct Lisp_Vector
*p
;
722 allocating_for_lisp
= 1;
723 p
= (struct Lisp_Vector
*)xmalloc (sizeof (struct Lisp_Vector
)
724 + (len
- 1) * sizeof (Lisp_Object
));
725 allocating_for_lisp
= 0;
726 VALIDATE_LISP_STORAGE (p
, 0);
727 consing_since_gc
+= (sizeof (struct Lisp_Vector
)
728 + (len
- 1) * sizeof (Lisp_Object
));
729 vector_cells_consed
+= len
;
731 p
->next
= all_vectors
;
736 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
737 "Return a newly created vector of length LENGTH, with each element being INIT.\n\
738 See also the function `vector'.")
740 register Lisp_Object length
, init
;
743 register EMACS_INT sizei
;
745 register struct Lisp_Vector
*p
;
747 CHECK_NATNUM (length
, 0);
748 sizei
= XFASTINT (length
);
750 p
= allocate_vectorlike (sizei
);
752 for (index
= 0; index
< sizei
; index
++)
753 p
->contents
[index
] = init
;
755 XSETVECTOR (vector
, p
);
759 DEFUN ("make-char-table", Fmake_char_table
, Smake_char_table
, 0, 2, 0,
760 "Return a newly created char-table, with N \"extra\" slots.\n\
761 Each element is initialized to INIT, which defaults to nil.\n\
762 N may not be more than ten.\n\
763 See `char-table-extra-slot' and `set-char-table-extra-slot'.")
765 register Lisp_Object n
, init
;
769 if (XINT (n
) < 0 || XINT (n
) > 10)
770 args_out_of_range (n
, Qnil
);
771 /* Add 2 to the size for the defalt and parent slots. */
772 vector
= Fmake_vector (make_number (CHAR_TABLE_STANDARD_SLOTS
+ XINT (n
)),
774 XSETCHAR_TABLE (vector
, XCHAR_TABLE (vector
));
778 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
779 "Return a newly created vector with specified arguments as elements.\n\
780 Any number of arguments, even zero arguments, are allowed.")
785 register Lisp_Object len
, val
;
787 register struct Lisp_Vector
*p
;
789 XSETFASTINT (len
, nargs
);
790 val
= Fmake_vector (len
, Qnil
);
792 for (index
= 0; index
< nargs
; index
++)
793 p
->contents
[index
] = args
[index
];
797 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
798 "Create a byte-code object with specified arguments as elements.\n\
799 The arguments should be the arglist, bytecode-string, constant vector,\n\
800 stack size, (optional) doc string, and (optional) interactive spec.\n\
801 The first four arguments are required; at most six have any\n\
807 register Lisp_Object len
, val
;
809 register struct Lisp_Vector
*p
;
811 XSETFASTINT (len
, nargs
);
812 if (!NILP (Vpurify_flag
))
813 val
= make_pure_vector (len
);
815 val
= Fmake_vector (len
, Qnil
);
817 for (index
= 0; index
< nargs
; index
++)
819 if (!NILP (Vpurify_flag
))
820 args
[index
] = Fpurecopy (args
[index
]);
821 p
->contents
[index
] = args
[index
];
823 XSETCOMPILED (val
, val
);
827 /* Allocation of symbols.
828 Just like allocation of conses!
830 Each symbol_block is just under 1020 bytes long,
831 since malloc really allocates in units of powers of two
832 and uses 4 bytes for its own overhead. */
834 #define SYMBOL_BLOCK_SIZE \
835 ((1020 - sizeof (struct symbol_block *)) / sizeof (struct Lisp_Symbol))
839 struct symbol_block
*next
;
840 struct Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
843 struct symbol_block
*symbol_block
;
844 int symbol_block_index
;
846 struct Lisp_Symbol
*symbol_free_list
;
851 allocating_for_lisp
= 1;
852 symbol_block
= (struct symbol_block
*) malloc (sizeof (struct symbol_block
));
853 allocating_for_lisp
= 0;
854 symbol_block
->next
= 0;
855 bzero (symbol_block
->symbols
, sizeof symbol_block
->symbols
);
856 symbol_block_index
= 0;
857 symbol_free_list
= 0;
860 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
861 "Return a newly allocated uninterned symbol whose name is NAME.\n\
862 Its value and function definition are void, and its property list is nil.")
866 register Lisp_Object val
;
867 register struct Lisp_Symbol
*p
;
869 CHECK_STRING (str
, 0);
871 if (symbol_free_list
)
873 XSETSYMBOL (val
, symbol_free_list
);
874 symbol_free_list
= *(struct Lisp_Symbol
**)&symbol_free_list
->value
;
878 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
880 struct symbol_block
*new;
881 allocating_for_lisp
= 1;
882 new = (struct symbol_block
*) xmalloc (sizeof (struct symbol_block
));
883 allocating_for_lisp
= 0;
884 VALIDATE_LISP_STORAGE (new, sizeof *new);
885 new->next
= symbol_block
;
887 symbol_block_index
= 0;
889 XSETSYMBOL (val
, &symbol_block
->symbols
[symbol_block_index
++]);
892 p
->name
= XSTRING (str
);
895 p
->function
= Qunbound
;
897 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
902 /* Allocation of markers and other objects that share that structure.
903 Works like allocation of conses. */
905 #define MARKER_BLOCK_SIZE \
906 ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc))
910 struct marker_block
*next
;
911 union Lisp_Misc markers
[MARKER_BLOCK_SIZE
];
914 struct marker_block
*marker_block
;
915 int marker_block_index
;
917 union Lisp_Misc
*marker_free_list
;
922 allocating_for_lisp
= 1;
923 marker_block
= (struct marker_block
*) malloc (sizeof (struct marker_block
));
924 allocating_for_lisp
= 0;
925 marker_block
->next
= 0;
926 bzero (marker_block
->markers
, sizeof marker_block
->markers
);
927 marker_block_index
= 0;
928 marker_free_list
= 0;
931 /* Return a newly allocated Lisp_Misc object, with no substructure. */
937 if (marker_free_list
)
939 XSETMISC (val
, marker_free_list
);
940 marker_free_list
= marker_free_list
->u_free
.chain
;
944 if (marker_block_index
== MARKER_BLOCK_SIZE
)
946 struct marker_block
*new;
947 allocating_for_lisp
= 1;
948 new = (struct marker_block
*) xmalloc (sizeof (struct marker_block
));
949 allocating_for_lisp
= 0;
950 VALIDATE_LISP_STORAGE (new, sizeof *new);
951 new->next
= marker_block
;
953 marker_block_index
= 0;
955 XSETMISC (val
, &marker_block
->markers
[marker_block_index
++]);
957 consing_since_gc
+= sizeof (union Lisp_Misc
);
958 misc_objects_consed
++;
962 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
963 "Return a newly allocated marker which does not point at any place.")
966 register Lisp_Object val
;
967 register struct Lisp_Marker
*p
;
969 val
= allocate_misc ();
970 XMISCTYPE (val
) = Lisp_Misc_Marker
;
975 p
->insertion_type
= 0;
979 /* Allocation of strings */
981 /* Strings reside inside of string_blocks. The entire data of the string,
982 both the size and the contents, live in part of the `chars' component of a string_block.
983 The `pos' component is the index within `chars' of the first free byte.
985 first_string_block points to the first string_block ever allocated.
986 Each block points to the next one with its `next' field.
987 The `prev' fields chain in reverse order.
988 The last one allocated is the one currently being filled.
989 current_string_block points to it.
991 The string_blocks that hold individual large strings
992 go in a separate chain, started by large_string_blocks. */
995 /* String blocks contain this many useful bytes.
996 8188 is power of 2, minus 4 for malloc overhead. */
997 #define STRING_BLOCK_SIZE (8188 - sizeof (struct string_block_head))
999 /* A string bigger than this gets its own specially-made string block
1000 if it doesn't fit in the current one. */
1001 #define STRING_BLOCK_OUTSIZE 1024
1003 struct string_block_head
1005 struct string_block
*next
, *prev
;
1011 struct string_block
*next
, *prev
;
1013 char chars
[STRING_BLOCK_SIZE
];
1016 /* This points to the string block we are now allocating strings. */
1018 struct string_block
*current_string_block
;
1020 /* This points to the oldest string block, the one that starts the chain. */
1022 struct string_block
*first_string_block
;
1024 /* Last string block in chain of those made for individual large strings. */
1026 struct string_block
*large_string_blocks
;
1028 /* If SIZE is the length of a string, this returns how many bytes
1029 the string occupies in a string_block (including padding). */
1031 #define STRING_FULLSIZE(size) (((size) + sizeof (struct Lisp_String) + PAD) \
1033 #define PAD (sizeof (EMACS_INT))
1036 #define STRING_FULLSIZE(SIZE) \
1037 (((SIZE) + 2 * sizeof (EMACS_INT)) & ~(sizeof (EMACS_INT) - 1))
1043 allocating_for_lisp
= 1;
1044 current_string_block
= (struct string_block
*) malloc (sizeof (struct string_block
));
1045 allocating_for_lisp
= 0;
1046 first_string_block
= current_string_block
;
1047 consing_since_gc
+= sizeof (struct string_block
);
1048 current_string_block
->next
= 0;
1049 current_string_block
->prev
= 0;
1050 current_string_block
->pos
= 0;
1051 large_string_blocks
= 0;
1054 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
1055 "Return a newly created string of length LENGTH, with each element being INIT.\n\
1056 Both LENGTH and INIT must be numbers.")
1058 Lisp_Object length
, init
;
1060 register Lisp_Object val
;
1061 register unsigned char *p
, *end
, c
;
1063 CHECK_NATNUM (length
, 0);
1064 CHECK_NUMBER (init
, 1);
1065 val
= make_uninit_string (XFASTINT (length
));
1067 p
= XSTRING (val
)->data
;
1068 end
= p
+ XSTRING (val
)->size
;
1075 DEFUN ("make-bool-vector", Fmake_bool_vector
, Smake_bool_vector
, 2, 2, 0,
1076 "Return a newly created bitstring of length LENGTH, with INIT as each element.\n\
1077 Both LENGTH and INIT must be numbers. INIT matters only in whether it is t or nil.")
1079 Lisp_Object length
, init
;
1081 register Lisp_Object val
;
1082 struct Lisp_Bool_Vector
*p
;
1084 int length_in_chars
, length_in_elts
, bits_per_value
;
1086 CHECK_NATNUM (length
, 0);
1088 bits_per_value
= sizeof (EMACS_INT
) * INTBITS
/ sizeof (int);
1090 length_in_elts
= (XFASTINT (length
) + bits_per_value
- 1) / bits_per_value
;
1091 length_in_chars
= length_in_elts
* sizeof (EMACS_INT
);
1093 val
= Fmake_vector (make_number (length_in_elts
), Qnil
);
1094 p
= XBOOL_VECTOR (val
);
1095 /* Get rid of any bits that would cause confusion. */
1097 XSETBOOL_VECTOR (val
, p
);
1098 p
->size
= XFASTINT (length
);
1100 real_init
= (NILP (init
) ? 0 : -1);
1101 for (i
= 0; i
< length_in_chars
; i
++)
1102 p
->data
[i
] = real_init
;
1108 make_string (contents
, length
)
1112 register Lisp_Object val
;
1113 val
= make_uninit_string (length
);
1114 bcopy (contents
, XSTRING (val
)->data
, length
);
1122 return make_string (str
, strlen (str
));
1126 make_uninit_string (length
)
1129 register Lisp_Object val
;
1130 register int fullsize
= STRING_FULLSIZE (length
);
1132 if (length
< 0) abort ();
1134 if (fullsize
<= STRING_BLOCK_SIZE
- current_string_block
->pos
)
1135 /* This string can fit in the current string block */
1138 ((struct Lisp_String
*)
1139 (current_string_block
->chars
+ current_string_block
->pos
)));
1140 current_string_block
->pos
+= fullsize
;
1142 else if (fullsize
> STRING_BLOCK_OUTSIZE
)
1143 /* This string gets its own string block */
1145 register struct string_block
*new;
1146 allocating_for_lisp
= 1;
1147 new = (struct string_block
*) xmalloc (sizeof (struct string_block_head
) + fullsize
);
1148 allocating_for_lisp
= 0;
1149 VALIDATE_LISP_STORAGE (new, 0);
1150 consing_since_gc
+= sizeof (struct string_block_head
) + fullsize
;
1151 new->pos
= fullsize
;
1152 new->next
= large_string_blocks
;
1153 large_string_blocks
= new;
1155 ((struct Lisp_String
*)
1156 ((struct string_block_head
*)new + 1)));
1159 /* Make a new current string block and start it off with this string */
1161 register struct string_block
*new;
1162 allocating_for_lisp
= 1;
1163 new = (struct string_block
*) xmalloc (sizeof (struct string_block
));
1164 allocating_for_lisp
= 0;
1165 VALIDATE_LISP_STORAGE (new, sizeof *new);
1166 consing_since_gc
+= sizeof (struct string_block
);
1167 current_string_block
->next
= new;
1168 new->prev
= current_string_block
;
1170 current_string_block
= new;
1171 new->pos
= fullsize
;
1173 (struct Lisp_String
*) current_string_block
->chars
);
1176 string_chars_consed
+= fullsize
;
1177 XSTRING (val
)->size
= length
;
1178 XSTRING (val
)->data
[length
] = 0;
1179 INITIALIZE_INTERVAL (XSTRING (val
), NULL_INTERVAL
);
1184 /* Return a newly created vector or string with specified arguments as
1185 elements. If all the arguments are characters that can fit
1186 in a string of events, make a string; otherwise, make a vector.
1188 Any number of arguments, even zero arguments, are allowed. */
1191 make_event_array (nargs
, args
)
1197 for (i
= 0; i
< nargs
; i
++)
1198 /* The things that fit in a string
1199 are characters that are in 0...127,
1200 after discarding the meta bit and all the bits above it. */
1201 if (!INTEGERP (args
[i
])
1202 || (XUINT (args
[i
]) & ~(-CHAR_META
)) >= 0200)
1203 return Fvector (nargs
, args
);
1205 /* Since the loop exited, we know that all the things in it are
1206 characters, so we can make a string. */
1210 result
= Fmake_string (nargs
, make_number (0));
1211 for (i
= 0; i
< nargs
; i
++)
1213 XSTRING (result
)->data
[i
] = XINT (args
[i
]);
1214 /* Move the meta bit to the right place for a string char. */
1215 if (XINT (args
[i
]) & CHAR_META
)
1216 XSTRING (result
)->data
[i
] |= 0x80;
1223 /* Pure storage management. */
1225 /* Must get an error if pure storage is full,
1226 since if it cannot hold a large string
1227 it may be able to hold conses that point to that string;
1228 then the string is not protected from gc. */
1231 make_pure_string (data
, length
)
1235 register Lisp_Object
new;
1236 register int size
= sizeof (EMACS_INT
) + INTERVAL_PTR_SIZE
+ length
+ 1;
1238 if (pureptr
+ size
> PURESIZE
)
1239 error ("Pure Lisp storage exhausted");
1240 XSETSTRING (new, PUREBEG
+ pureptr
);
1241 XSTRING (new)->size
= length
;
1242 bcopy (data
, XSTRING (new)->data
, length
);
1243 XSTRING (new)->data
[length
] = 0;
1245 /* We must give strings in pure storage some kind of interval. So we
1246 give them a null one. */
1247 #if defined (USE_TEXT_PROPERTIES)
1248 XSTRING (new)->intervals
= NULL_INTERVAL
;
1250 pureptr
+= (size
+ sizeof (EMACS_INT
) - 1)
1251 / sizeof (EMACS_INT
) * sizeof (EMACS_INT
);
1256 pure_cons (car
, cdr
)
1257 Lisp_Object car
, cdr
;
1259 register Lisp_Object
new;
1261 if (pureptr
+ sizeof (struct Lisp_Cons
) > PURESIZE
)
1262 error ("Pure Lisp storage exhausted");
1263 XSETCONS (new, PUREBEG
+ pureptr
);
1264 pureptr
+= sizeof (struct Lisp_Cons
);
1265 XCONS (new)->car
= Fpurecopy (car
);
1266 XCONS (new)->cdr
= Fpurecopy (cdr
);
1270 #ifdef LISP_FLOAT_TYPE
1273 make_pure_float (num
)
1276 register Lisp_Object
new;
1278 /* Make sure that PUREBEG + pureptr is aligned on at least a sizeof
1279 (double) boundary. Some architectures (like the sparc) require
1280 this, and I suspect that floats are rare enough that it's no
1281 tragedy for those that do. */
1284 char *p
= PUREBEG
+ pureptr
;
1288 alignment
= __alignof (struct Lisp_Float
);
1290 alignment
= sizeof (struct Lisp_Float
);
1293 alignment
= sizeof (struct Lisp_Float
);
1295 p
= (char *) (((unsigned long) p
+ alignment
- 1) & - alignment
);
1296 pureptr
= p
- PUREBEG
;
1299 if (pureptr
+ sizeof (struct Lisp_Float
) > PURESIZE
)
1300 error ("Pure Lisp storage exhausted");
1301 XSETFLOAT (new, PUREBEG
+ pureptr
);
1302 pureptr
+= sizeof (struct Lisp_Float
);
1303 XFLOAT (new)->data
= num
;
1304 XSETFASTINT (XFLOAT (new)->type
, 0); /* bug chasing -wsr */
1308 #endif /* LISP_FLOAT_TYPE */
1311 make_pure_vector (len
)
1314 register Lisp_Object
new;
1315 register EMACS_INT size
= sizeof (struct Lisp_Vector
) + (len
- 1) * sizeof (Lisp_Object
);
1317 if (pureptr
+ size
> PURESIZE
)
1318 error ("Pure Lisp storage exhausted");
1320 XSETVECTOR (new, PUREBEG
+ pureptr
);
1322 XVECTOR (new)->size
= len
;
1326 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
1327 "Make a copy of OBJECT in pure storage.\n\
1328 Recursively copies contents of vectors and cons cells.\n\
1329 Does not copy symbols.")
1331 register Lisp_Object obj
;
1333 if (NILP (Vpurify_flag
))
1336 if ((PNTR_COMPARISON_TYPE
) XPNTR (obj
) < (PNTR_COMPARISON_TYPE
) ((char *) pure
+ PURESIZE
)
1337 && (PNTR_COMPARISON_TYPE
) XPNTR (obj
) >= (PNTR_COMPARISON_TYPE
) pure
)
1341 return pure_cons (XCONS (obj
)->car
, XCONS (obj
)->cdr
);
1342 #ifdef LISP_FLOAT_TYPE
1343 else if (FLOATP (obj
))
1344 return make_pure_float (XFLOAT (obj
)->data
);
1345 #endif /* LISP_FLOAT_TYPE */
1346 else if (STRINGP (obj
))
1347 return make_pure_string (XSTRING (obj
)->data
, XSTRING (obj
)->size
);
1348 else if (COMPILEDP (obj
) || VECTORP (obj
))
1350 register struct Lisp_Vector
*vec
;
1351 register int i
, size
;
1353 size
= XVECTOR (obj
)->size
;
1354 if (size
& PSEUDOVECTOR_FLAG
)
1355 size
&= PSEUDOVECTOR_SIZE_MASK
;
1356 vec
= XVECTOR (make_pure_vector (size
));
1357 for (i
= 0; i
< size
; i
++)
1358 vec
->contents
[i
] = Fpurecopy (XVECTOR (obj
)->contents
[i
]);
1359 if (COMPILEDP (obj
))
1360 XSETCOMPILED (obj
, vec
);
1362 XSETVECTOR (obj
, vec
);
1365 else if (MARKERP (obj
))
1366 error ("Attempt to copy a marker to pure storage");
1371 /* Recording what needs to be marked for gc. */
1373 struct gcpro
*gcprolist
;
1375 #define NSTATICS 768
1377 Lisp_Object
*staticvec
[NSTATICS
] = {0};
1381 /* Put an entry in staticvec, pointing at the variable whose address is given */
1384 staticpro (varaddress
)
1385 Lisp_Object
*varaddress
;
1387 staticvec
[staticidx
++] = varaddress
;
1388 if (staticidx
>= NSTATICS
)
1396 struct catchtag
*next
;
1397 /* jmp_buf jmp; /* We don't need this for GC purposes */
1402 struct backtrace
*next
;
1403 Lisp_Object
*function
;
1404 Lisp_Object
*args
; /* Points to vector of args. */
1405 int nargs
; /* length of vector */
1406 /* if nargs is UNEVALLED, args points to slot holding list of unevalled args */
1410 /* Garbage collection! */
1412 int total_conses
, total_markers
, total_symbols
, total_string_size
, total_vector_size
;
1413 int total_free_conses
, total_free_markers
, total_free_symbols
;
1414 #ifdef LISP_FLOAT_TYPE
1415 int total_free_floats
, total_floats
;
1416 #endif /* LISP_FLOAT_TYPE */
1418 /* Temporarily prevent garbage collection. */
1421 inhibit_garbage_collection ()
1423 int count
= specpdl_ptr
- specpdl
;
1425 int nbits
= min (VALBITS
, INTBITS
);
1427 XSETINT (number
, ((EMACS_INT
) 1 << (nbits
- 1)) - 1);
1429 specbind (Qgc_cons_threshold
, number
);
1434 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
1435 "Reclaim storage for Lisp objects no longer needed.\n\
1436 Returns info on amount of space in use:\n\
1437 ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)\n\
1438 (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS\n\
1439 (USED-FLOATS . FREE-FLOATS))\n\
1440 Garbage collection happens automatically if you cons more than\n\
1441 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.")
1444 register struct gcpro
*tail
;
1445 register struct specbinding
*bind
;
1446 struct catchtag
*catch;
1447 struct handler
*handler
;
1448 register struct backtrace
*backlist
;
1449 register Lisp_Object tem
;
1450 char *omessage
= echo_area_glyphs
;
1451 int omessage_length
= echo_area_glyphs_length
;
1452 char stack_top_variable
;
1455 /* In case user calls debug_print during GC,
1456 don't let that cause a recursive GC. */
1457 consing_since_gc
= 0;
1459 /* Save a copy of the contents of the stack, for debugging. */
1460 #if MAX_SAVE_STACK > 0
1461 if (NILP (Vpurify_flag
))
1463 i
= &stack_top_variable
- stack_bottom
;
1465 if (i
< MAX_SAVE_STACK
)
1467 if (stack_copy
== 0)
1468 stack_copy
= (char *) xmalloc (stack_copy_size
= i
);
1469 else if (stack_copy_size
< i
)
1470 stack_copy
= (char *) xrealloc (stack_copy
, (stack_copy_size
= i
));
1473 if ((EMACS_INT
) (&stack_top_variable
- stack_bottom
) > 0)
1474 bcopy (stack_bottom
, stack_copy
, i
);
1476 bcopy (&stack_top_variable
, stack_copy
, i
);
1480 #endif /* MAX_SAVE_STACK > 0 */
1482 if (!noninteractive
)
1483 message1_nolog ("Garbage collecting...");
1485 /* Don't keep command history around forever */
1486 tem
= Fnthcdr (make_number (30), Vcommand_history
);
1488 XCONS (tem
)->cdr
= Qnil
;
1490 /* Likewise for undo information. */
1492 register struct buffer
*nextb
= all_buffers
;
1496 /* If a buffer's undo list is Qt, that means that undo is
1497 turned off in that buffer. Calling truncate_undo_list on
1498 Qt tends to return NULL, which effectively turns undo back on.
1499 So don't call truncate_undo_list if undo_list is Qt. */
1500 if (! EQ (nextb
->undo_list
, Qt
))
1502 = truncate_undo_list (nextb
->undo_list
, undo_limit
,
1504 nextb
= nextb
->next
;
1510 /* clear_marks (); */
1512 /* In each "large string", set the MARKBIT of the size field.
1513 That enables mark_object to recognize them. */
1515 register struct string_block
*b
;
1516 for (b
= large_string_blocks
; b
; b
= b
->next
)
1517 ((struct Lisp_String
*)(&b
->chars
[0]))->size
|= MARKBIT
;
1520 /* Mark all the special slots that serve as the roots of accessibility.
1522 Usually the special slots to mark are contained in particular structures.
1523 Then we know no slot is marked twice because the structures don't overlap.
1524 In some cases, the structures point to the slots to be marked.
1525 For these, we use MARKBIT to avoid double marking of the slot. */
1527 for (i
= 0; i
< staticidx
; i
++)
1528 mark_object (staticvec
[i
]);
1529 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
1530 for (i
= 0; i
< tail
->nvars
; i
++)
1531 if (!XMARKBIT (tail
->var
[i
]))
1533 mark_object (&tail
->var
[i
]);
1534 XMARK (tail
->var
[i
]);
1536 for (bind
= specpdl
; bind
!= specpdl_ptr
; bind
++)
1538 mark_object (&bind
->symbol
);
1539 mark_object (&bind
->old_value
);
1541 for (catch = catchlist
; catch; catch = catch->next
)
1543 mark_object (&catch->tag
);
1544 mark_object (&catch->val
);
1546 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
1548 mark_object (&handler
->handler
);
1549 mark_object (&handler
->var
);
1551 for (backlist
= backtrace_list
; backlist
; backlist
= backlist
->next
)
1553 if (!XMARKBIT (*backlist
->function
))
1555 mark_object (backlist
->function
);
1556 XMARK (*backlist
->function
);
1558 if (backlist
->nargs
== UNEVALLED
|| backlist
->nargs
== MANY
)
1561 i
= backlist
->nargs
- 1;
1563 if (!XMARKBIT (backlist
->args
[i
]))
1565 mark_object (&backlist
->args
[i
]);
1566 XMARK (backlist
->args
[i
]);
1573 /* Clear the mark bits that we set in certain root slots. */
1575 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
1576 for (i
= 0; i
< tail
->nvars
; i
++)
1577 XUNMARK (tail
->var
[i
]);
1578 for (backlist
= backtrace_list
; backlist
; backlist
= backlist
->next
)
1580 XUNMARK (*backlist
->function
);
1581 if (backlist
->nargs
== UNEVALLED
|| backlist
->nargs
== MANY
)
1584 i
= backlist
->nargs
- 1;
1586 XUNMARK (backlist
->args
[i
]);
1588 XUNMARK (buffer_defaults
.name
);
1589 XUNMARK (buffer_local_symbols
.name
);
1591 /* clear_marks (); */
1594 consing_since_gc
= 0;
1595 if (gc_cons_threshold
< 10000)
1596 gc_cons_threshold
= 10000;
1598 if (omessage
|| minibuf_level
> 0)
1599 message2_nolog (omessage
, omessage_length
);
1600 else if (!noninteractive
)
1601 message1_nolog ("Garbage collecting...done");
1603 return Fcons (Fcons (make_number (total_conses
),
1604 make_number (total_free_conses
)),
1605 Fcons (Fcons (make_number (total_symbols
),
1606 make_number (total_free_symbols
)),
1607 Fcons (Fcons (make_number (total_markers
),
1608 make_number (total_free_markers
)),
1609 Fcons (make_number (total_string_size
),
1610 Fcons (make_number (total_vector_size
),
1612 #ifdef LISP_FLOAT_TYPE
1613 Fcons (Fcons (make_number (total_floats
),
1614 make_number (total_free_floats
)),
1616 #else /* not LISP_FLOAT_TYPE */
1618 #endif /* not LISP_FLOAT_TYPE */
1626 /* Clear marks on all conses */
1628 register struct cons_block
*cblk
;
1629 register int lim
= cons_block_index
;
1631 for (cblk
= cons_block
; cblk
; cblk
= cblk
->next
)
1634 for (i
= 0; i
< lim
; i
++)
1635 XUNMARK (cblk
->conses
[i
].car
);
1636 lim
= CONS_BLOCK_SIZE
;
1639 /* Clear marks on all symbols */
1641 register struct symbol_block
*sblk
;
1642 register int lim
= symbol_block_index
;
1644 for (sblk
= symbol_block
; sblk
; sblk
= sblk
->next
)
1647 for (i
= 0; i
< lim
; i
++)
1649 XUNMARK (sblk
->symbols
[i
].plist
);
1651 lim
= SYMBOL_BLOCK_SIZE
;
1654 /* Clear marks on all markers */
1656 register struct marker_block
*sblk
;
1657 register int lim
= marker_block_index
;
1659 for (sblk
= marker_block
; sblk
; sblk
= sblk
->next
)
1662 for (i
= 0; i
< lim
; i
++)
1663 if (sblk
->markers
[i
].u_marker
.type
== Lisp_Misc_Marker
)
1664 XUNMARK (sblk
->markers
[i
].u_marker
.chain
);
1665 lim
= MARKER_BLOCK_SIZE
;
1668 /* Clear mark bits on all buffers */
1670 register struct buffer
*nextb
= all_buffers
;
1674 XUNMARK (nextb
->name
);
1675 nextb
= nextb
->next
;
1681 /* Mark reference to a Lisp_Object.
1682 If the object referred to has not been seen yet, recursively mark
1683 all the references contained in it.
1685 If the object referenced is a short string, the referencing slot
1686 is threaded into a chain of such slots, pointed to from
1687 the `size' field of the string. The actual string size
1688 lives in the last slot in the chain. We recognize the end
1689 because it is < (unsigned) STRING_BLOCK_SIZE. */
1691 #define LAST_MARKED_SIZE 500
1692 Lisp_Object
*last_marked
[LAST_MARKED_SIZE
];
1693 int last_marked_index
;
1696 mark_object (objptr
)
1697 Lisp_Object
*objptr
;
1699 register Lisp_Object obj
;
1706 if ((PNTR_COMPARISON_TYPE
) XPNTR (obj
) < (PNTR_COMPARISON_TYPE
) ((char *) pure
+ PURESIZE
)
1707 && (PNTR_COMPARISON_TYPE
) XPNTR (obj
) >= (PNTR_COMPARISON_TYPE
) pure
)
1710 last_marked
[last_marked_index
++] = objptr
;
1711 if (last_marked_index
== LAST_MARKED_SIZE
)
1712 last_marked_index
= 0;
1714 switch (SWITCH_ENUM_CAST (XGCTYPE (obj
)))
1718 register struct Lisp_String
*ptr
= XSTRING (obj
);
1720 MARK_INTERVAL_TREE (ptr
->intervals
);
1721 if (ptr
->size
& MARKBIT
)
1722 /* A large string. Just set ARRAY_MARK_FLAG. */
1723 ptr
->size
|= ARRAY_MARK_FLAG
;
1726 /* A small string. Put this reference
1727 into the chain of references to it.
1728 If the address includes MARKBIT, put that bit elsewhere
1729 when we store OBJPTR into the size field. */
1731 if (XMARKBIT (*objptr
))
1733 XSETFASTINT (*objptr
, ptr
->size
);
1737 XSETFASTINT (*objptr
, ptr
->size
);
1739 if ((EMACS_INT
) objptr
& DONT_COPY_FLAG
)
1741 ptr
->size
= (EMACS_INT
) objptr
;
1742 if (ptr
->size
& MARKBIT
)
1743 ptr
->size
^= MARKBIT
| DONT_COPY_FLAG
;
1748 case Lisp_Vectorlike
:
1749 if (GC_BUFFERP (obj
))
1751 if (!XMARKBIT (XBUFFER (obj
)->name
))
1754 else if (GC_SUBRP (obj
))
1756 else if (GC_COMPILEDP (obj
))
1757 /* We could treat this just like a vector, but it is better
1758 to save the COMPILED_CONSTANTS element for last and avoid recursion
1761 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
1762 register EMACS_INT size
= ptr
->size
;
1763 /* See comment above under Lisp_Vector. */
1764 struct Lisp_Vector
*volatile ptr1
= ptr
;
1767 if (size
& ARRAY_MARK_FLAG
)
1768 break; /* Already marked */
1769 ptr
->size
|= ARRAY_MARK_FLAG
; /* Else mark it */
1770 size
&= PSEUDOVECTOR_SIZE_MASK
;
1771 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
1773 if (i
!= COMPILED_CONSTANTS
)
1774 mark_object (&ptr1
->contents
[i
]);
1776 /* This cast should be unnecessary, but some Mips compiler complains
1777 (MIPS-ABI + SysVR4, DC/OSx, etc). */
1778 objptr
= (Lisp_Object
*) &ptr1
->contents
[COMPILED_CONSTANTS
];
1782 else if (GC_FRAMEP (obj
))
1784 /* See comment above under Lisp_Vector for why this is volatile. */
1785 register struct frame
*volatile ptr
= XFRAME (obj
);
1786 register EMACS_INT size
= ptr
->size
;
1788 if (size
& ARRAY_MARK_FLAG
) break; /* Already marked */
1789 ptr
->size
|= ARRAY_MARK_FLAG
; /* Else mark it */
1791 mark_object (&ptr
->name
);
1792 mark_object (&ptr
->icon_name
);
1793 mark_object (&ptr
->focus_frame
);
1794 mark_object (&ptr
->selected_window
);
1795 mark_object (&ptr
->minibuffer_window
);
1796 mark_object (&ptr
->param_alist
);
1797 mark_object (&ptr
->scroll_bars
);
1798 mark_object (&ptr
->condemned_scroll_bars
);
1799 mark_object (&ptr
->menu_bar_items
);
1800 mark_object (&ptr
->face_alist
);
1801 mark_object (&ptr
->menu_bar_vector
);
1802 mark_object (&ptr
->buffer_predicate
);
1804 #endif /* MULTI_FRAME */
1805 else if (GC_BOOL_VECTOR_P (obj
))
1809 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
1810 register EMACS_INT size
= ptr
->size
;
1811 /* The reason we use ptr1 is to avoid an apparent hardware bug
1812 that happens occasionally on the FSF's HP 300s.
1813 The bug is that a2 gets clobbered by recursive calls to mark_object.
1814 The clobberage seems to happen during function entry,
1815 perhaps in the moveml instruction.
1816 Yes, this is a crock, but we have to do it. */
1817 struct Lisp_Vector
*volatile ptr1
= ptr
;
1820 if (size
& ARRAY_MARK_FLAG
) break; /* Already marked */
1821 ptr
->size
|= ARRAY_MARK_FLAG
; /* Else mark it */
1822 if (size
& PSEUDOVECTOR_FLAG
)
1823 size
&= PSEUDOVECTOR_SIZE_MASK
;
1824 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
1825 mark_object (&ptr1
->contents
[i
]);
1831 /* See comment above under Lisp_Vector for why this is volatile. */
1832 register struct Lisp_Symbol
*volatile ptr
= XSYMBOL (obj
);
1833 struct Lisp_Symbol
*ptrx
;
1835 if (XMARKBIT (ptr
->plist
)) break;
1837 mark_object ((Lisp_Object
*) &ptr
->value
);
1838 mark_object (&ptr
->function
);
1839 mark_object (&ptr
->plist
);
1840 XSETTYPE (*(Lisp_Object
*) &ptr
->name
, Lisp_String
);
1841 mark_object (&ptr
->name
);
1845 /* For the benefit of the last_marked log. */
1846 objptr
= (Lisp_Object
*)&XSYMBOL (obj
)->next
;
1847 ptrx
= ptr
; /* Use of ptrx avoids compiler bug on Sun */
1848 XSETSYMBOL (obj
, ptrx
);
1849 /* We can't goto loop here because *objptr doesn't contain an
1850 actual Lisp_Object with valid datatype field. */
1857 switch (XMISCTYPE (obj
))
1859 case Lisp_Misc_Marker
:
1860 XMARK (XMARKER (obj
)->chain
);
1861 /* DO NOT mark thru the marker's chain.
1862 The buffer's markers chain does not preserve markers from gc;
1863 instead, markers are removed from the chain when freed by gc. */
1866 case Lisp_Misc_Buffer_Local_Value
:
1867 case Lisp_Misc_Some_Buffer_Local_Value
:
1869 register struct Lisp_Buffer_Local_Value
*ptr
1870 = XBUFFER_LOCAL_VALUE (obj
);
1871 if (XMARKBIT (ptr
->car
)) break;
1873 /* If the cdr is nil, avoid recursion for the car. */
1874 if (EQ (ptr
->cdr
, Qnil
))
1879 mark_object (&ptr
->car
);
1880 /* See comment above under Lisp_Vector for why not use ptr here. */
1881 objptr
= &XBUFFER_LOCAL_VALUE (obj
)->cdr
;
1885 case Lisp_Misc_Intfwd
:
1886 case Lisp_Misc_Boolfwd
:
1887 case Lisp_Misc_Objfwd
:
1888 case Lisp_Misc_Buffer_Objfwd
:
1889 case Lisp_Misc_Kboard_Objfwd
:
1890 /* Don't bother with Lisp_Buffer_Objfwd,
1891 since all markable slots in current buffer marked anyway. */
1892 /* Don't need to do Lisp_Objfwd, since the places they point
1893 are protected with staticpro. */
1896 case Lisp_Misc_Overlay
:
1898 struct Lisp_Overlay
*ptr
= XOVERLAY (obj
);
1899 if (!XMARKBIT (ptr
->plist
))
1902 mark_object (&ptr
->start
);
1903 mark_object (&ptr
->end
);
1904 objptr
= &ptr
->plist
;
1917 register struct Lisp_Cons
*ptr
= XCONS (obj
);
1918 if (XMARKBIT (ptr
->car
)) break;
1920 /* If the cdr is nil, avoid recursion for the car. */
1921 if (EQ (ptr
->cdr
, Qnil
))
1926 mark_object (&ptr
->car
);
1927 /* See comment above under Lisp_Vector for why not use ptr here. */
1928 objptr
= &XCONS (obj
)->cdr
;
1932 #ifdef LISP_FLOAT_TYPE
1934 XMARK (XFLOAT (obj
)->type
);
1936 #endif /* LISP_FLOAT_TYPE */
1946 /* Mark the pointers in a buffer structure. */
1952 register struct buffer
*buffer
= XBUFFER (buf
);
1953 register Lisp_Object
*ptr
;
1954 Lisp_Object base_buffer
;
1956 /* This is the buffer's markbit */
1957 mark_object (&buffer
->name
);
1958 XMARK (buffer
->name
);
1960 MARK_INTERVAL_TREE (BUF_INTERVALS (buffer
));
1963 mark_object (buffer
->syntax_table
);
1965 /* Mark the various string-pointers in the buffer object.
1966 Since the strings may be relocated, we must mark them
1967 in their actual slots. So gc_sweep must convert each slot
1968 back to an ordinary C pointer. */
1969 XSETSTRING (*(Lisp_Object
*)&buffer
->upcase_table
, buffer
->upcase_table
);
1970 mark_object ((Lisp_Object
*)&buffer
->upcase_table
);
1971 XSETSTRING (*(Lisp_Object
*)&buffer
->downcase_table
, buffer
->downcase_table
);
1972 mark_object ((Lisp_Object
*)&buffer
->downcase_table
);
1974 XSETSTRING (*(Lisp_Object
*)&buffer
->sort_table
, buffer
->sort_table
);
1975 mark_object ((Lisp_Object
*)&buffer
->sort_table
);
1976 XSETSTRING (*(Lisp_Object
*)&buffer
->folding_sort_table
, buffer
->folding_sort_table
);
1977 mark_object ((Lisp_Object
*)&buffer
->folding_sort_table
);
1980 for (ptr
= &buffer
->name
+ 1;
1981 (char *)ptr
< (char *)buffer
+ sizeof (struct buffer
);
1985 /* If this is an indirect buffer, mark its base buffer. */
1986 if (buffer
->base_buffer
&& !XMARKBIT (buffer
->base_buffer
->name
))
1988 XSETBUFFER (base_buffer
, buffer
->base_buffer
);
1989 mark_buffer (base_buffer
);
1994 /* Mark the pointers in the kboard objects. */
2001 for (kb
= all_kboards
; kb
; kb
= kb
->next_kboard
)
2003 if (kb
->kbd_macro_buffer
)
2004 for (p
= kb
->kbd_macro_buffer
; p
< kb
->kbd_macro_ptr
; p
++)
2006 mark_object (&kb
->Vprefix_arg
);
2007 mark_object (&kb
->kbd_queue
);
2008 mark_object (&kb
->Vlast_kbd_macro
);
2009 mark_object (&kb
->Vsystem_key_alist
);
2010 mark_object (&kb
->system_key_syms
);
2014 /* Sweep: find all structures not marked, and free them. */
2019 total_string_size
= 0;
2022 /* Put all unmarked conses on free list */
2024 register struct cons_block
*cblk
;
2025 register int lim
= cons_block_index
;
2026 register int num_free
= 0, num_used
= 0;
2030 for (cblk
= cons_block
; cblk
; cblk
= cblk
->next
)
2033 for (i
= 0; i
< lim
; i
++)
2034 if (!XMARKBIT (cblk
->conses
[i
].car
))
2037 *(struct Lisp_Cons
**)&cblk
->conses
[i
].car
= cons_free_list
;
2038 cons_free_list
= &cblk
->conses
[i
];
2043 XUNMARK (cblk
->conses
[i
].car
);
2045 lim
= CONS_BLOCK_SIZE
;
2047 total_conses
= num_used
;
2048 total_free_conses
= num_free
;
2051 #ifdef LISP_FLOAT_TYPE
2052 /* Put all unmarked floats on free list */
2054 register struct float_block
*fblk
;
2055 register int lim
= float_block_index
;
2056 register int num_free
= 0, num_used
= 0;
2058 float_free_list
= 0;
2060 for (fblk
= float_block
; fblk
; fblk
= fblk
->next
)
2063 for (i
= 0; i
< lim
; i
++)
2064 if (!XMARKBIT (fblk
->floats
[i
].type
))
2067 *(struct Lisp_Float
**)&fblk
->floats
[i
].type
= float_free_list
;
2068 float_free_list
= &fblk
->floats
[i
];
2073 XUNMARK (fblk
->floats
[i
].type
);
2075 lim
= FLOAT_BLOCK_SIZE
;
2077 total_floats
= num_used
;
2078 total_free_floats
= num_free
;
2080 #endif /* LISP_FLOAT_TYPE */
2082 #ifdef USE_TEXT_PROPERTIES
2083 /* Put all unmarked intervals on free list */
2085 register struct interval_block
*iblk
;
2086 register int lim
= interval_block_index
;
2087 register int num_free
= 0, num_used
= 0;
2089 interval_free_list
= 0;
2091 for (iblk
= interval_block
; iblk
; iblk
= iblk
->next
)
2095 for (i
= 0; i
< lim
; i
++)
2097 if (! XMARKBIT (iblk
->intervals
[i
].plist
))
2099 iblk
->intervals
[i
].parent
= interval_free_list
;
2100 interval_free_list
= &iblk
->intervals
[i
];
2106 XUNMARK (iblk
->intervals
[i
].plist
);
2109 lim
= INTERVAL_BLOCK_SIZE
;
2111 total_intervals
= num_used
;
2112 total_free_intervals
= num_free
;
2114 #endif /* USE_TEXT_PROPERTIES */
2116 /* Put all unmarked symbols on free list */
2118 register struct symbol_block
*sblk
;
2119 register int lim
= symbol_block_index
;
2120 register int num_free
= 0, num_used
= 0;
2122 symbol_free_list
= 0;
2124 for (sblk
= symbol_block
; sblk
; sblk
= sblk
->next
)
2127 for (i
= 0; i
< lim
; i
++)
2128 if (!XMARKBIT (sblk
->symbols
[i
].plist
))
2130 *(struct Lisp_Symbol
**)&sblk
->symbols
[i
].value
= symbol_free_list
;
2131 symbol_free_list
= &sblk
->symbols
[i
];
2137 sblk
->symbols
[i
].name
2138 = XSTRING (*(Lisp_Object
*) &sblk
->symbols
[i
].name
);
2139 XUNMARK (sblk
->symbols
[i
].plist
);
2141 lim
= SYMBOL_BLOCK_SIZE
;
2143 total_symbols
= num_used
;
2144 total_free_symbols
= num_free
;
2148 /* Put all unmarked markers on free list.
2149 Dechain each one first from the buffer it points into,
2150 but only if it's a real marker. */
2152 register struct marker_block
*mblk
;
2153 register int lim
= marker_block_index
;
2154 register int num_free
= 0, num_used
= 0;
2156 marker_free_list
= 0;
2158 for (mblk
= marker_block
; mblk
; mblk
= mblk
->next
)
2161 EMACS_INT already_free
= -1;
2163 for (i
= 0; i
< lim
; i
++)
2165 Lisp_Object
*markword
;
2166 switch (mblk
->markers
[i
].u_marker
.type
)
2168 case Lisp_Misc_Marker
:
2169 markword
= &mblk
->markers
[i
].u_marker
.chain
;
2171 case Lisp_Misc_Buffer_Local_Value
:
2172 case Lisp_Misc_Some_Buffer_Local_Value
:
2173 markword
= &mblk
->markers
[i
].u_buffer_local_value
.car
;
2175 case Lisp_Misc_Overlay
:
2176 markword
= &mblk
->markers
[i
].u_overlay
.plist
;
2178 case Lisp_Misc_Free
:
2179 /* If the object was already free, keep it
2180 on the free list. */
2181 markword
= &already_free
;
2187 if (markword
&& !XMARKBIT (*markword
))
2190 if (mblk
->markers
[i
].u_marker
.type
== Lisp_Misc_Marker
)
2192 /* tem1 avoids Sun compiler bug */
2193 struct Lisp_Marker
*tem1
= &mblk
->markers
[i
].u_marker
;
2194 XSETMARKER (tem
, tem1
);
2195 unchain_marker (tem
);
2197 /* Set the type of the freed object to Lisp_Misc_Free.
2198 We could leave the type alone, since nobody checks it,
2199 but this might catch bugs faster. */
2200 mblk
->markers
[i
].u_marker
.type
= Lisp_Misc_Free
;
2201 mblk
->markers
[i
].u_free
.chain
= marker_free_list
;
2202 marker_free_list
= &mblk
->markers
[i
];
2209 XUNMARK (*markword
);
2212 lim
= MARKER_BLOCK_SIZE
;
2215 total_markers
= num_used
;
2216 total_free_markers
= num_free
;
2219 /* Free all unmarked buffers */
2221 register struct buffer
*buffer
= all_buffers
, *prev
= 0, *next
;
2224 if (!XMARKBIT (buffer
->name
))
2227 prev
->next
= buffer
->next
;
2229 all_buffers
= buffer
->next
;
2230 next
= buffer
->next
;
2236 XUNMARK (buffer
->name
);
2237 UNMARK_BALANCE_INTERVALS (BUF_INTERVALS (buffer
));
2240 /* Each `struct Lisp_String *' was turned into a Lisp_Object
2241 for purposes of marking and relocation.
2242 Turn them back into C pointers now. */
2243 buffer
->upcase_table
2244 = XSTRING (*(Lisp_Object
*)&buffer
->upcase_table
);
2245 buffer
->downcase_table
2246 = XSTRING (*(Lisp_Object
*)&buffer
->downcase_table
);
2248 = XSTRING (*(Lisp_Object
*)&buffer
->sort_table
);
2249 buffer
->folding_sort_table
2250 = XSTRING (*(Lisp_Object
*)&buffer
->folding_sort_table
);
2253 prev
= buffer
, buffer
= buffer
->next
;
2257 #endif /* standalone */
2259 /* Free all unmarked vectors */
2261 register struct Lisp_Vector
*vector
= all_vectors
, *prev
= 0, *next
;
2262 total_vector_size
= 0;
2265 if (!(vector
->size
& ARRAY_MARK_FLAG
))
2268 prev
->next
= vector
->next
;
2270 all_vectors
= vector
->next
;
2271 next
= vector
->next
;
2277 vector
->size
&= ~ARRAY_MARK_FLAG
;
2278 if (vector
->size
& PSEUDOVECTOR_FLAG
)
2279 total_vector_size
+= (PSEUDOVECTOR_SIZE_MASK
& vector
->size
);
2281 total_vector_size
+= vector
->size
;
2282 prev
= vector
, vector
= vector
->next
;
2286 /* Free all "large strings" not marked with ARRAY_MARK_FLAG. */
2288 register struct string_block
*sb
= large_string_blocks
, *prev
= 0, *next
;
2289 struct Lisp_String
*s
;
2293 s
= (struct Lisp_String
*) &sb
->chars
[0];
2294 if (s
->size
& ARRAY_MARK_FLAG
)
2296 ((struct Lisp_String
*)(&sb
->chars
[0]))->size
2297 &= ~ARRAY_MARK_FLAG
& ~MARKBIT
;
2298 UNMARK_BALANCE_INTERVALS (s
->intervals
);
2299 total_string_size
+= ((struct Lisp_String
*)(&sb
->chars
[0]))->size
;
2300 prev
= sb
, sb
= sb
->next
;
2305 prev
->next
= sb
->next
;
2307 large_string_blocks
= sb
->next
;
2316 /* Compactify strings, relocate references, and free empty string blocks. */
2321 /* String block of old strings we are scanning. */
2322 register struct string_block
*from_sb
;
2323 /* A preceding string block (or maybe the same one)
2324 where we are copying the still-live strings to. */
2325 register struct string_block
*to_sb
;
2329 to_sb
= first_string_block
;
2332 /* Scan each existing string block sequentially, string by string. */
2333 for (from_sb
= first_string_block
; from_sb
; from_sb
= from_sb
->next
)
2336 /* POS is the index of the next string in the block. */
2337 while (pos
< from_sb
->pos
)
2339 register struct Lisp_String
*nextstr
2340 = (struct Lisp_String
*) &from_sb
->chars
[pos
];
2342 register struct Lisp_String
*newaddr
;
2343 register EMACS_INT size
= nextstr
->size
;
2345 /* NEXTSTR is the old address of the next string.
2346 Just skip it if it isn't marked. */
2347 if (((EMACS_UINT
) size
& ~DONT_COPY_FLAG
) > STRING_BLOCK_SIZE
)
2349 /* It is marked, so its size field is really a chain of refs.
2350 Find the end of the chain, where the actual size lives. */
2351 while (((EMACS_UINT
) size
& ~DONT_COPY_FLAG
) > STRING_BLOCK_SIZE
)
2353 if (size
& DONT_COPY_FLAG
)
2354 size
^= MARKBIT
| DONT_COPY_FLAG
;
2355 size
= *(EMACS_INT
*)size
& ~MARKBIT
;
2358 total_string_size
+= size
;
2360 /* If it won't fit in TO_SB, close it out,
2361 and move to the next sb. Keep doing so until
2362 TO_SB reaches a large enough, empty enough string block.
2363 We know that TO_SB cannot advance past FROM_SB here
2364 since FROM_SB is large enough to contain this string.
2365 Any string blocks skipped here
2366 will be patched out and freed later. */
2367 while (to_pos
+ STRING_FULLSIZE (size
)
2368 > max (to_sb
->pos
, STRING_BLOCK_SIZE
))
2370 to_sb
->pos
= to_pos
;
2371 to_sb
= to_sb
->next
;
2374 /* Compute new address of this string
2375 and update TO_POS for the space being used. */
2376 newaddr
= (struct Lisp_String
*) &to_sb
->chars
[to_pos
];
2377 to_pos
+= STRING_FULLSIZE (size
);
2379 /* Copy the string itself to the new place. */
2380 if (nextstr
!= newaddr
)
2381 bcopy (nextstr
, newaddr
, size
+ 1 + sizeof (EMACS_INT
)
2382 + INTERVAL_PTR_SIZE
);
2384 /* Go through NEXTSTR's chain of references
2385 and make each slot in the chain point to
2386 the new address of this string. */
2387 size
= newaddr
->size
;
2388 while (((EMACS_UINT
) size
& ~DONT_COPY_FLAG
) > STRING_BLOCK_SIZE
)
2390 register Lisp_Object
*objptr
;
2391 if (size
& DONT_COPY_FLAG
)
2392 size
^= MARKBIT
| DONT_COPY_FLAG
;
2393 objptr
= (Lisp_Object
*)size
;
2395 size
= XFASTINT (*objptr
) & ~MARKBIT
;
2396 if (XMARKBIT (*objptr
))
2398 XSETSTRING (*objptr
, newaddr
);
2402 XSETSTRING (*objptr
, newaddr
);
2404 /* Store the actual size in the size field. */
2405 newaddr
->size
= size
;
2407 #ifdef USE_TEXT_PROPERTIES
2408 /* Now that the string has been relocated, rebalance its
2409 interval tree, and update the tree's parent pointer. */
2410 if (! NULL_INTERVAL_P (newaddr
->intervals
))
2412 UNMARK_BALANCE_INTERVALS (newaddr
->intervals
);
2413 XSETSTRING (* (Lisp_Object
*) &newaddr
->intervals
->parent
,
2416 #endif /* USE_TEXT_PROPERTIES */
2418 pos
+= STRING_FULLSIZE (size
);
2422 /* Close out the last string block still used and free any that follow. */
2423 to_sb
->pos
= to_pos
;
2424 current_string_block
= to_sb
;
2426 from_sb
= to_sb
->next
;
2430 to_sb
= from_sb
->next
;
2435 /* Free any empty string blocks further back in the chain.
2436 This loop will never free first_string_block, but it is very
2437 unlikely that that one will become empty, so why bother checking? */
2439 from_sb
= first_string_block
;
2440 while (to_sb
= from_sb
->next
)
2442 if (to_sb
->pos
== 0)
2444 if (from_sb
->next
= to_sb
->next
)
2445 from_sb
->next
->prev
= from_sb
;
2453 /* Debugging aids. */
2455 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, 0,
2456 "Return the address of the last byte Emacs has allocated, divided by 1024.\n\
2457 This may be helpful in debugging Emacs's memory usage.\n\
2458 We divide the value by 1024 to make sure it fits in a Lisp integer.")
2463 XSETINT (end
, (EMACS_INT
) sbrk (0) / 1024);
2468 DEFUN ("memory-use-counts", Fmemory_use_counts
, Smemory_use_counts
, 0, 0, 0,
2469 "Return a list of counters that measure how much consing there has been.\n\
2470 Each of these counters increments for a certain kind of object.\n\
2471 The counters wrap around from the largest positive integer to zero.\n\
2472 Garbage collection does not decrease them.\n\
2473 The elements of the value are as follows:\n\
2474 (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS)\n\
2475 All are in units of 1 = one object consed\n\
2476 except for VECTOR-CELLS and STRING-CHARS, which count the total length of\n\
2478 MISCS include overlays, markers, and some internal types.\n\
2479 Frames, windows, buffers, and subprocesses count as vectors\n\
2480 (but the contents of a buffer's text do not count here).")
2483 Lisp_Object lisp_cons_cells_consed
;
2484 Lisp_Object lisp_floats_consed
;
2485 Lisp_Object lisp_vector_cells_consed
;
2486 Lisp_Object lisp_symbols_consed
;
2487 Lisp_Object lisp_string_chars_consed
;
2488 Lisp_Object lisp_misc_objects_consed
;
2489 Lisp_Object lisp_intervals_consed
;
2491 XSETINT (lisp_cons_cells_consed
,
2492 cons_cells_consed
& ~(1 << (VALBITS
- 1)));
2493 XSETINT (lisp_floats_consed
,
2494 floats_consed
& ~(1 << (VALBITS
- 1)));
2495 XSETINT (lisp_vector_cells_consed
,
2496 vector_cells_consed
& ~(1 << (VALBITS
- 1)));
2497 XSETINT (lisp_symbols_consed
,
2498 symbols_consed
& ~(1 << (VALBITS
- 1)));
2499 XSETINT (lisp_string_chars_consed
,
2500 string_chars_consed
& ~(1 << (VALBITS
- 1)));
2501 XSETINT (lisp_misc_objects_consed
,
2502 misc_objects_consed
& ~(1 << (VALBITS
- 1)));
2503 XSETINT (lisp_intervals_consed
,
2504 intervals_consed
& ~(1 << (VALBITS
- 1)));
2506 return Fcons (lisp_cons_cells_consed
,
2507 Fcons (lisp_floats_consed
,
2508 Fcons (lisp_vector_cells_consed
,
2509 Fcons (lisp_symbols_consed
,
2510 Fcons (lisp_string_chars_consed
,
2511 Fcons (lisp_misc_objects_consed
,
2512 Fcons (lisp_intervals_consed
,
2516 /* Initialization */
2520 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
2523 pure_size
= PURESIZE
;
2526 ignore_warnings
= 1;
2531 #ifdef LISP_FLOAT_TYPE
2533 #endif /* LISP_FLOAT_TYPE */
2537 malloc_hysteresis
= 32;
2539 malloc_hysteresis
= 0;
2542 spare_memory
= (char *) malloc (SPARE_MEMORY
);
2544 ignore_warnings
= 0;
2547 consing_since_gc
= 0;
2548 gc_cons_threshold
= 100000 * sizeof (Lisp_Object
);
2549 #ifdef VIRT_ADDR_VARIES
2550 malloc_sbrk_unused
= 1<<22; /* A large number */
2551 malloc_sbrk_used
= 100000; /* as reasonable as any number */
2552 #endif /* VIRT_ADDR_VARIES */
2563 DEFVAR_INT ("gc-cons-threshold", &gc_cons_threshold
,
2564 "*Number of bytes of consing between garbage collections.\n\
2565 Garbage collection can happen automatically once this many bytes have been\n\
2566 allocated since the last garbage collection. All data types count.\n\n\
2567 Garbage collection happens automatically only when `eval' is called.\n\n\
2568 By binding this temporarily to a large number, you can effectively\n\
2569 prevent garbage collection during a part of the program.");
2571 DEFVAR_INT ("pure-bytes-used", &pureptr
,
2572 "Number of bytes of sharable Lisp data allocated so far.");
2575 DEFVAR_INT ("data-bytes-used", &malloc_sbrk_used
,
2576 "Number of bytes of unshared memory allocated in this session.");
2578 DEFVAR_INT ("data-bytes-free", &malloc_sbrk_unused
,
2579 "Number of bytes of unshared memory remaining available in this session.");
2582 DEFVAR_LISP ("purify-flag", &Vpurify_flag
,
2583 "Non-nil means loading Lisp code in order to dump an executable.\n\
2584 This means that certain objects should be allocated in shared (pure) space.");
2586 DEFVAR_INT ("undo-limit", &undo_limit
,
2587 "Keep no more undo information once it exceeds this size.\n\
2588 This limit is applied when garbage collection happens.\n\
2589 The size is counted as the number of bytes occupied,\n\
2590 which includes both saved text and other data.");
2593 DEFVAR_INT ("undo-strong-limit", &undo_strong_limit
,
2594 "Don't keep more than this much size of undo information.\n\
2595 A command which pushes past this size is itself forgotten.\n\
2596 This limit is applied when garbage collection happens.\n\
2597 The size is counted as the number of bytes occupied,\n\
2598 which includes both saved text and other data.");
2599 undo_strong_limit
= 30000;
2601 /* We build this in advance because if we wait until we need it, we might
2602 not be able to allocate the memory to hold it. */
2604 = Fcons (Qerror
, Fcons (build_string ("Memory exhausted--use M-x save-some-buffers RET"), Qnil
));
2605 staticpro (&memory_signal_data
);
2607 staticpro (&Qgc_cons_threshold
);
2608 Qgc_cons_threshold
= intern ("gc-cons-threshold");
2613 defsubr (&Smake_byte_code
);
2614 defsubr (&Smake_list
);
2615 defsubr (&Smake_vector
);
2616 defsubr (&Smake_char_table
);
2617 defsubr (&Smake_string
);
2618 defsubr (&Smake_bool_vector
);
2619 defsubr (&Smake_symbol
);
2620 defsubr (&Smake_marker
);
2621 defsubr (&Spurecopy
);
2622 defsubr (&Sgarbage_collect
);
2623 defsubr (&Smemory_limit
);
2624 defsubr (&Smemory_use_counts
);