1 /* Storage allocation and gc for GNU Emacs Lisp interpreter.
2 Copyright (C) 1985, 1986, 1988, 1992, 1993 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. */
23 #include "intervals.h"
31 #include "syssignal.h"
33 #define max(A,B) ((A) > (B) ? (A) : (B))
35 /* Macro to verify that storage intended for Lisp objects is not
36 out of range to fit in the space for a pointer.
37 ADDRESS is the start of the block, and SIZE
38 is the amount of space within which objects can start. */
39 #define VALIDATE_LISP_STORAGE(address, size) \
43 XSET (val, Lisp_Cons, (char *) address + size); \
44 if ((char *) XCONS (val) != (char *) address + size) \
51 /* Number of bytes of consing done since the last gc */
54 /* Number of bytes of consing since gc before another gc should be done. */
55 int gc_cons_threshold
;
57 /* Nonzero during gc */
60 #ifndef VIRT_ADDR_VARIES
62 #endif /* VIRT_ADDR_VARIES */
65 #ifndef VIRT_ADDR_VARIES
67 #endif /* VIRT_ADDR_VARIES */
68 int malloc_sbrk_unused
;
70 /* Two limits controlling how much undo information to keep. */
72 int undo_strong_limit
;
74 /* Non-nil means defun should do purecopy on the function definition */
75 Lisp_Object Vpurify_flag
;
78 int pure
[PURESIZE
/ sizeof (int)] = {0,}; /* Force it into data space! */
79 #define PUREBEG (char *) pure
81 #define pure PURE_SEG_BITS /* Use shared memory segment */
82 #define PUREBEG (char *)PURE_SEG_BITS
84 /* This variable is used only by the XPNTR macro when HAVE_SHM is
85 defined. If we used the PURESIZE macro directly there, that would
86 make most of emacs dependent on puresize.h, which we don't want -
87 you should be able to change that without too much recompilation.
88 So map_in_data initializes pure_size, and the dependencies work
91 #endif /* not HAVE_SHM */
93 /* Index in pure at which next pure object will be allocated. */
96 /* If nonzero, this is a warning delivered by malloc and not yet displayed. */
97 char *pending_malloc_warning
;
99 /* Maximum amount of C stack to save when a GC happens. */
101 #ifndef MAX_SAVE_STACK
102 #define MAX_SAVE_STACK 16000
105 /* Buffer in which we save a copy of the C stack at each GC. */
110 /* Non-zero means ignore malloc warnings. Set during initialization. */
113 static void mark_object (), mark_buffer ();
114 static void clear_marks (), gc_sweep ();
115 static void compact_strings ();
117 /* Versions of malloc and realloc that print warnings as memory gets full. */
120 malloc_warning_1 (str
)
123 Fprinc (str
, Vstandard_output
);
124 write_string ("\nKilling some buffers may delay running out of memory.\n", -1);
125 write_string ("However, certainly by the time you receive the 95% warning,\n", -1);
126 write_string ("you should clean up, kill this Emacs, and start a new one.", -1);
130 /* malloc calls this if it finds we are near exhausting storage */
134 pending_malloc_warning
= str
;
137 display_malloc_warning ()
139 register Lisp_Object val
;
141 val
= build_string (pending_malloc_warning
);
142 pending_malloc_warning
= 0;
143 internal_with_output_to_temp_buffer (" *Danger*", malloc_warning_1
, val
);
146 /* Called if malloc returns zero */
149 error ("Memory exhausted");
152 /* like malloc and realloc but check for no memory left */
160 val
= (long *) malloc (size
);
162 if (!val
&& size
) memory_full ();
167 xrealloc (block
, size
)
173 /* We must call malloc explicitly when BLOCK is 0, since some
174 reallocs don't do this. */
176 val
= (long *) malloc (size
);
178 val
= (long *) realloc (block
, size
);
180 if (!val
&& size
) memory_full ();
184 /* Interval allocation. */
186 #ifdef USE_TEXT_PROPERTIES
187 #define INTERVAL_BLOCK_SIZE \
188 ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval))
190 struct interval_block
192 struct interval_block
*next
;
193 struct interval intervals
[INTERVAL_BLOCK_SIZE
];
196 struct interval_block
*interval_block
;
197 static int interval_block_index
;
199 INTERVAL interval_free_list
;
205 = (struct interval_block
*) malloc (sizeof (struct interval_block
));
206 interval_block
->next
= 0;
207 bzero (interval_block
->intervals
, sizeof interval_block
->intervals
);
208 interval_block_index
= 0;
209 interval_free_list
= 0;
212 #define INIT_INTERVALS init_intervals ()
219 if (interval_free_list
)
221 val
= interval_free_list
;
222 interval_free_list
= interval_free_list
->parent
;
226 if (interval_block_index
== INTERVAL_BLOCK_SIZE
)
228 register struct interval_block
*newi
229 = (struct interval_block
*) malloc (sizeof (struct interval_block
));
234 VALIDATE_LISP_STORAGE (newi
, sizeof *newi
);
235 newi
->next
= interval_block
;
236 interval_block
= newi
;
237 interval_block_index
= 0;
239 val
= &interval_block
->intervals
[interval_block_index
++];
241 consing_since_gc
+= sizeof (struct interval
);
242 RESET_INTERVAL (val
);
246 static int total_free_intervals
, total_intervals
;
248 /* Mark the pointers of one interval. */
251 mark_interval (i
, dummy
)
255 if (XMARKBIT (i
->plist
))
257 mark_object (&i
->plist
);
262 mark_interval_tree (tree
)
263 register INTERVAL tree
;
265 if (XMARKBIT (tree
->plist
))
268 traverse_intervals (tree
, 1, 0, mark_interval
, Qnil
);
271 #define MARK_INTERVAL_TREE(i) \
272 { if (!NULL_INTERVAL_P (i)) mark_interval_tree (i); }
274 /* The oddity in the call to XUNMARK is necessary because XUNMARK
275 expands to an assigment to its argument, and most C compilers don't
276 support casts on the left operand of `='. */
277 #define UNMARK_BALANCE_INTERVALS(i) \
279 if (! NULL_INTERVAL_P (i)) \
281 XUNMARK (* (Lisp_Object *) (&(i)->parent)); \
282 (i) = balance_intervals (i); \
286 #else /* no interval use */
288 #define INIT_INTERVALS
290 #define UNMARK_BALANCE_INTERVALS(i)
291 #define MARK_INTERVAL_TREE(i)
293 #endif /* no interval use */
295 /* Floating point allocation. */
297 #ifdef LISP_FLOAT_TYPE
298 /* Allocation of float cells, just like conses */
299 /* We store float cells inside of float_blocks, allocating a new
300 float_block with malloc whenever necessary. Float cells reclaimed by
301 GC are put on a free list to be reallocated before allocating
302 any new float cells from the latest float_block.
304 Each float_block is just under 1020 bytes long,
305 since malloc really allocates in units of powers of two
306 and uses 4 bytes for its own overhead. */
308 #define FLOAT_BLOCK_SIZE \
309 ((1020 - sizeof (struct float_block *)) / sizeof (struct Lisp_Float))
313 struct float_block
*next
;
314 struct Lisp_Float floats
[FLOAT_BLOCK_SIZE
];
317 struct float_block
*float_block
;
318 int float_block_index
;
320 struct Lisp_Float
*float_free_list
;
325 float_block
= (struct float_block
*) malloc (sizeof (struct float_block
));
326 float_block
->next
= 0;
327 bzero (float_block
->floats
, sizeof float_block
->floats
);
328 float_block_index
= 0;
332 /* Explicitly free a float cell. */
334 struct Lisp_Float
*ptr
;
336 XFASTINT (ptr
->type
) = (int) float_free_list
;
337 float_free_list
= ptr
;
341 make_float (float_value
)
344 register Lisp_Object val
;
348 XSET (val
, Lisp_Float
, float_free_list
);
349 float_free_list
= (struct Lisp_Float
*) XFASTINT (float_free_list
->type
);
353 if (float_block_index
== FLOAT_BLOCK_SIZE
)
355 register struct float_block
*new = (struct float_block
*) malloc (sizeof (struct float_block
));
356 if (!new) memory_full ();
357 VALIDATE_LISP_STORAGE (new, sizeof *new);
358 new->next
= float_block
;
360 float_block_index
= 0;
362 XSET (val
, Lisp_Float
, &float_block
->floats
[float_block_index
++]);
364 XFLOAT (val
)->data
= float_value
;
365 XFLOAT (val
)->type
= 0; /* bug chasing -wsr */
366 consing_since_gc
+= sizeof (struct Lisp_Float
);
370 #endif /* LISP_FLOAT_TYPE */
372 /* Allocation of cons cells */
373 /* We store cons cells inside of cons_blocks, allocating a new
374 cons_block with malloc whenever necessary. Cons cells reclaimed by
375 GC are put on a free list to be reallocated before allocating
376 any new cons cells from the latest cons_block.
378 Each cons_block is just under 1020 bytes long,
379 since malloc really allocates in units of powers of two
380 and uses 4 bytes for its own overhead. */
382 #define CONS_BLOCK_SIZE \
383 ((1020 - sizeof (struct cons_block *)) / sizeof (struct Lisp_Cons))
387 struct cons_block
*next
;
388 struct Lisp_Cons conses
[CONS_BLOCK_SIZE
];
391 struct cons_block
*cons_block
;
392 int cons_block_index
;
394 struct Lisp_Cons
*cons_free_list
;
399 cons_block
= (struct cons_block
*) malloc (sizeof (struct cons_block
));
400 cons_block
->next
= 0;
401 bzero (cons_block
->conses
, sizeof cons_block
->conses
);
402 cons_block_index
= 0;
406 /* Explicitly free a cons cell. */
408 struct Lisp_Cons
*ptr
;
410 XFASTINT (ptr
->car
) = (int) cons_free_list
;
411 cons_free_list
= ptr
;
414 DEFUN ("cons", Fcons
, Scons
, 2, 2, 0,
415 "Create a new cons, give it CAR and CDR as components, and return it.")
417 Lisp_Object car
, cdr
;
419 register Lisp_Object val
;
423 XSET (val
, Lisp_Cons
, cons_free_list
);
424 cons_free_list
= (struct Lisp_Cons
*) XFASTINT (cons_free_list
->car
);
428 if (cons_block_index
== CONS_BLOCK_SIZE
)
430 register struct cons_block
*new = (struct cons_block
*) malloc (sizeof (struct cons_block
));
431 if (!new) memory_full ();
432 VALIDATE_LISP_STORAGE (new, sizeof *new);
433 new->next
= cons_block
;
435 cons_block_index
= 0;
437 XSET (val
, Lisp_Cons
, &cons_block
->conses
[cons_block_index
++]);
439 XCONS (val
)->car
= car
;
440 XCONS (val
)->cdr
= cdr
;
441 consing_since_gc
+= sizeof (struct Lisp_Cons
);
445 DEFUN ("list", Flist
, Slist
, 0, MANY
, 0,
446 "Return a newly created list with specified arguments as elements.\n\
447 Any number of arguments, even zero arguments, are allowed.")
450 register Lisp_Object
*args
;
452 register Lisp_Object len
, val
, val_tail
;
454 XFASTINT (len
) = nargs
;
455 val
= Fmake_list (len
, Qnil
);
457 while (!NILP (val_tail
))
459 XCONS (val_tail
)->car
= *args
++;
460 val_tail
= XCONS (val_tail
)->cdr
;
465 DEFUN ("make-list", Fmake_list
, Smake_list
, 2, 2, 0,
466 "Return a newly created list of length LENGTH, with each element being INIT.")
468 register Lisp_Object length
, init
;
470 register Lisp_Object val
;
473 if (XTYPE (length
) != Lisp_Int
|| XINT (length
) < 0)
474 length
= wrong_type_argument (Qnatnump
, length
);
475 size
= XINT (length
);
479 val
= Fcons (init
, val
);
483 /* Allocation of vectors */
485 struct Lisp_Vector
*all_vectors
;
487 DEFUN ("make-vector", Fmake_vector
, Smake_vector
, 2, 2, 0,
488 "Return a newly created vector of length LENGTH, with each element being INIT.\n\
489 See also the function `vector'.")
491 register Lisp_Object length
, init
;
493 register int sizei
, index
;
494 register Lisp_Object vector
;
495 register struct Lisp_Vector
*p
;
497 if (XTYPE (length
) != Lisp_Int
|| XINT (length
) < 0)
498 length
= wrong_type_argument (Qnatnump
, length
);
499 sizei
= XINT (length
);
501 p
= (struct Lisp_Vector
*) malloc (sizeof (struct Lisp_Vector
) + (sizei
- 1) * sizeof (Lisp_Object
));
504 VALIDATE_LISP_STORAGE (p
, 0);
506 XSET (vector
, Lisp_Vector
, p
);
507 consing_since_gc
+= sizeof (struct Lisp_Vector
) + (sizei
- 1) * sizeof (Lisp_Object
);
510 p
->next
= all_vectors
;
513 for (index
= 0; index
< sizei
; index
++)
514 p
->contents
[index
] = init
;
519 DEFUN ("vector", Fvector
, Svector
, 0, MANY
, 0,
520 "Return a newly created vector with specified arguments as elements.\n\
521 Any number of arguments, even zero arguments, are allowed.")
526 register Lisp_Object len
, val
;
528 register struct Lisp_Vector
*p
;
530 XFASTINT (len
) = nargs
;
531 val
= Fmake_vector (len
, Qnil
);
533 for (index
= 0; index
< nargs
; index
++)
534 p
->contents
[index
] = args
[index
];
538 DEFUN ("make-byte-code", Fmake_byte_code
, Smake_byte_code
, 4, MANY
, 0,
539 "Create a byte-code object with specified arguments as elements.\n\
540 The arguments should be the arglist, bytecode-string, constant vector,\n\
541 stack size, (optional) doc string, and (optional) interactive spec.\n\
542 The first four arguments are required; at most six have any\n\
548 register Lisp_Object len
, val
;
550 register struct Lisp_Vector
*p
;
552 XFASTINT (len
) = nargs
;
553 if (!NILP (Vpurify_flag
))
554 val
= make_pure_vector (len
);
556 val
= Fmake_vector (len
, Qnil
);
558 for (index
= 0; index
< nargs
; index
++)
560 if (!NILP (Vpurify_flag
))
561 args
[index
] = Fpurecopy (args
[index
]);
562 p
->contents
[index
] = args
[index
];
564 XSETTYPE (val
, Lisp_Compiled
);
568 /* Allocation of symbols.
569 Just like allocation of conses!
571 Each symbol_block is just under 1020 bytes long,
572 since malloc really allocates in units of powers of two
573 and uses 4 bytes for its own overhead. */
575 #define SYMBOL_BLOCK_SIZE \
576 ((1020 - sizeof (struct symbol_block *)) / sizeof (struct Lisp_Symbol))
580 struct symbol_block
*next
;
581 struct Lisp_Symbol symbols
[SYMBOL_BLOCK_SIZE
];
584 struct symbol_block
*symbol_block
;
585 int symbol_block_index
;
587 struct Lisp_Symbol
*symbol_free_list
;
592 symbol_block
= (struct symbol_block
*) malloc (sizeof (struct symbol_block
));
593 symbol_block
->next
= 0;
594 bzero (symbol_block
->symbols
, sizeof symbol_block
->symbols
);
595 symbol_block_index
= 0;
596 symbol_free_list
= 0;
599 DEFUN ("make-symbol", Fmake_symbol
, Smake_symbol
, 1, 1, 0,
600 "Return a newly allocated uninterned symbol whose name is NAME.\n\
601 Its value and function definition are void, and its property list is nil.")
605 register Lisp_Object val
;
606 register struct Lisp_Symbol
*p
;
608 CHECK_STRING (str
, 0);
610 if (symbol_free_list
)
612 XSET (val
, Lisp_Symbol
, symbol_free_list
);
614 = (struct Lisp_Symbol
*) XFASTINT (symbol_free_list
->value
);
618 if (symbol_block_index
== SYMBOL_BLOCK_SIZE
)
620 struct symbol_block
*new = (struct symbol_block
*) malloc (sizeof (struct symbol_block
));
621 if (!new) memory_full ();
622 VALIDATE_LISP_STORAGE (new, sizeof *new);
623 new->next
= symbol_block
;
625 symbol_block_index
= 0;
627 XSET (val
, Lisp_Symbol
, &symbol_block
->symbols
[symbol_block_index
++]);
630 p
->name
= XSTRING (str
);
633 p
->function
= Qunbound
;
635 consing_since_gc
+= sizeof (struct Lisp_Symbol
);
639 /* Allocation of markers.
640 Works like allocation of conses. */
642 #define MARKER_BLOCK_SIZE \
643 ((1020 - sizeof (struct marker_block *)) / sizeof (struct Lisp_Marker))
647 struct marker_block
*next
;
648 struct Lisp_Marker markers
[MARKER_BLOCK_SIZE
];
651 struct marker_block
*marker_block
;
652 int marker_block_index
;
654 struct Lisp_Marker
*marker_free_list
;
659 marker_block
= (struct marker_block
*) malloc (sizeof (struct marker_block
));
660 marker_block
->next
= 0;
661 bzero (marker_block
->markers
, sizeof marker_block
->markers
);
662 marker_block_index
= 0;
663 marker_free_list
= 0;
666 DEFUN ("make-marker", Fmake_marker
, Smake_marker
, 0, 0, 0,
667 "Return a newly allocated marker which does not point at any place.")
670 register Lisp_Object val
;
671 register struct Lisp_Marker
*p
;
673 if (marker_free_list
)
675 XSET (val
, Lisp_Marker
, marker_free_list
);
677 = (struct Lisp_Marker
*) XFASTINT (marker_free_list
->chain
);
681 if (marker_block_index
== MARKER_BLOCK_SIZE
)
683 struct marker_block
*new = (struct marker_block
*) malloc (sizeof (struct marker_block
));
684 if (!new) memory_full ();
685 VALIDATE_LISP_STORAGE (new, sizeof *new);
686 new->next
= marker_block
;
688 marker_block_index
= 0;
690 XSET (val
, Lisp_Marker
, &marker_block
->markers
[marker_block_index
++]);
696 consing_since_gc
+= sizeof (struct Lisp_Marker
);
700 /* Allocation of strings */
702 /* Strings reside inside of string_blocks. The entire data of the string,
703 both the size and the contents, live in part of the `chars' component of a string_block.
704 The `pos' component is the index within `chars' of the first free byte.
706 first_string_block points to the first string_block ever allocated.
707 Each block points to the next one with its `next' field.
708 The `prev' fields chain in reverse order.
709 The last one allocated is the one currently being filled.
710 current_string_block points to it.
712 The string_blocks that hold individual large strings
713 go in a separate chain, started by large_string_blocks. */
716 /* String blocks contain this many useful bytes.
717 8188 is power of 2, minus 4 for malloc overhead. */
718 #define STRING_BLOCK_SIZE (8188 - sizeof (struct string_block_head))
720 /* A string bigger than this gets its own specially-made string block
721 if it doesn't fit in the current one. */
722 #define STRING_BLOCK_OUTSIZE 1024
724 struct string_block_head
726 struct string_block
*next
, *prev
;
732 struct string_block
*next
, *prev
;
734 char chars
[STRING_BLOCK_SIZE
];
737 /* This points to the string block we are now allocating strings. */
739 struct string_block
*current_string_block
;
741 /* This points to the oldest string block, the one that starts the chain. */
743 struct string_block
*first_string_block
;
745 /* Last string block in chain of those made for individual large strings. */
747 struct string_block
*large_string_blocks
;
749 /* If SIZE is the length of a string, this returns how many bytes
750 the string occupies in a string_block (including padding). */
752 #define STRING_FULLSIZE(size) (((size) + sizeof (struct Lisp_String) + PAD) \
754 #define PAD (sizeof (int))
757 #define STRING_FULLSIZE(SIZE) \
758 (((SIZE) + 2 * sizeof (int)) & ~(sizeof (int) - 1))
764 current_string_block
= (struct string_block
*) malloc (sizeof (struct string_block
));
765 first_string_block
= current_string_block
;
766 consing_since_gc
+= sizeof (struct string_block
);
767 current_string_block
->next
= 0;
768 current_string_block
->prev
= 0;
769 current_string_block
->pos
= 0;
770 large_string_blocks
= 0;
773 DEFUN ("make-string", Fmake_string
, Smake_string
, 2, 2, 0,
774 "Return a newly created string of length LENGTH, with each element being INIT.\n\
775 Both LENGTH and INIT must be numbers.")
777 Lisp_Object length
, init
;
779 register Lisp_Object val
;
780 register unsigned char *p
, *end
, c
;
782 if (XTYPE (length
) != Lisp_Int
|| XINT (length
) < 0)
783 length
= wrong_type_argument (Qnatnump
, length
);
784 CHECK_NUMBER (init
, 1);
785 val
= make_uninit_string (XINT (length
));
787 p
= XSTRING (val
)->data
;
788 end
= p
+ XSTRING (val
)->size
;
796 make_string (contents
, length
)
800 register Lisp_Object val
;
801 val
= make_uninit_string (length
);
802 bcopy (contents
, XSTRING (val
)->data
, length
);
810 return make_string (str
, strlen (str
));
814 make_uninit_string (length
)
817 register Lisp_Object val
;
818 register int fullsize
= STRING_FULLSIZE (length
);
820 if (length
< 0) abort ();
822 if (fullsize
<= STRING_BLOCK_SIZE
- current_string_block
->pos
)
823 /* This string can fit in the current string block */
825 XSET (val
, Lisp_String
,
826 (struct Lisp_String
*) (current_string_block
->chars
+ current_string_block
->pos
));
827 current_string_block
->pos
+= fullsize
;
829 else if (fullsize
> STRING_BLOCK_OUTSIZE
)
830 /* This string gets its own string block */
832 register struct string_block
*new
833 = (struct string_block
*) malloc (sizeof (struct string_block_head
) + fullsize
);
834 VALIDATE_LISP_STORAGE (new, 0);
835 if (!new) memory_full ();
836 consing_since_gc
+= sizeof (struct string_block_head
) + fullsize
;
838 new->next
= large_string_blocks
;
839 large_string_blocks
= new;
840 XSET (val
, Lisp_String
,
841 (struct Lisp_String
*) ((struct string_block_head
*)new + 1));
844 /* Make a new current string block and start it off with this string */
846 register struct string_block
*new
847 = (struct string_block
*) malloc (sizeof (struct string_block
));
848 if (!new) memory_full ();
849 VALIDATE_LISP_STORAGE (new, sizeof *new);
850 consing_since_gc
+= sizeof (struct string_block
);
851 current_string_block
->next
= new;
852 new->prev
= current_string_block
;
854 current_string_block
= new;
856 XSET (val
, Lisp_String
,
857 (struct Lisp_String
*) current_string_block
->chars
);
860 XSTRING (val
)->size
= length
;
861 XSTRING (val
)->data
[length
] = 0;
862 INITIALIZE_INTERVAL (XSTRING (val
), NULL_INTERVAL
);
867 /* Return a newly created vector or string with specified arguments as
868 elements. If all the arguments are characters that can fit
869 in a string of events, make a string; otherwise, make a vector.
871 Any number of arguments, even zero arguments, are allowed. */
874 make_event_array (nargs
, args
)
880 for (i
= 0; i
< nargs
; i
++)
881 /* The things that fit in a string
882 are characters that are in 0...127 after discarding the meta bit. */
883 if (XTYPE (args
[i
]) != Lisp_Int
884 || (XUINT (args
[i
]) & ~CHAR_META
) >= 0200)
885 return Fvector (nargs
, args
);
887 /* Since the loop exited, we know that all the things in it are
888 characters, so we can make a string. */
890 Lisp_Object result
= Fmake_string (nargs
, make_number (0));
892 for (i
= 0; i
< nargs
; i
++)
894 XSTRING (result
)->data
[i
] = XINT (args
[i
]);
895 /* Move the meta bit to the right place for a string char. */
896 if (XINT (args
[i
]) & CHAR_META
)
897 XSTRING (result
)->data
[i
] |= 0x80;
904 /* Pure storage management. */
906 /* Must get an error if pure storage is full,
907 since if it cannot hold a large string
908 it may be able to hold conses that point to that string;
909 then the string is not protected from gc. */
912 make_pure_string (data
, length
)
916 register Lisp_Object
new;
917 register int size
= sizeof (int) + INTERVAL_PTR_SIZE
+ length
+ 1;
919 if (pureptr
+ size
> PURESIZE
)
920 error ("Pure Lisp storage exhausted");
921 XSET (new, Lisp_String
, PUREBEG
+ pureptr
);
922 XSTRING (new)->size
= length
;
923 bcopy (data
, XSTRING (new)->data
, length
);
924 XSTRING (new)->data
[length
] = 0;
925 pureptr
+= (size
+ sizeof (int) - 1)
926 / sizeof (int) * sizeof (int);
932 Lisp_Object car
, cdr
;
934 register Lisp_Object
new;
936 if (pureptr
+ sizeof (struct Lisp_Cons
) > PURESIZE
)
937 error ("Pure Lisp storage exhausted");
938 XSET (new, Lisp_Cons
, PUREBEG
+ pureptr
);
939 pureptr
+= sizeof (struct Lisp_Cons
);
940 XCONS (new)->car
= Fpurecopy (car
);
941 XCONS (new)->cdr
= Fpurecopy (cdr
);
945 #ifdef LISP_FLOAT_TYPE
948 make_pure_float (num
)
951 register Lisp_Object
new;
953 /* Make sure that PUREBEG + pureptr is aligned on at least a sizeof
954 (double) boundary. Some architectures (like the sparc) require
955 this, and I suspect that floats are rare enough that it's no
956 tragedy for those that do. */
959 char *p
= PUREBEG
+ pureptr
;
963 alignment
= __alignof (struct Lisp_Float
);
965 alignment
= sizeof (struct Lisp_Float
);
968 alignment
= sizeof (struct Lisp_Float
);
970 p
= (char *) (((unsigned long) p
+ alignment
- 1) & - alignment
);
971 pureptr
= p
- PUREBEG
;
974 if (pureptr
+ sizeof (struct Lisp_Float
) > PURESIZE
)
975 error ("Pure Lisp storage exhausted");
976 XSET (new, Lisp_Float
, PUREBEG
+ pureptr
);
977 pureptr
+= sizeof (struct Lisp_Float
);
978 XFLOAT (new)->data
= num
;
979 XFLOAT (new)->type
= 0; /* bug chasing -wsr */
983 #endif /* LISP_FLOAT_TYPE */
986 make_pure_vector (len
)
989 register Lisp_Object
new;
990 register int size
= sizeof (struct Lisp_Vector
) + (len
- 1) * sizeof (Lisp_Object
);
992 if (pureptr
+ size
> PURESIZE
)
993 error ("Pure Lisp storage exhausted");
995 XSET (new, Lisp_Vector
, PUREBEG
+ pureptr
);
997 XVECTOR (new)->size
= len
;
1001 DEFUN ("purecopy", Fpurecopy
, Spurecopy
, 1, 1, 0,
1002 "Make a copy of OBJECT in pure storage.\n\
1003 Recursively copies contents of vectors and cons cells.\n\
1004 Does not copy symbols.")
1006 register Lisp_Object obj
;
1008 register Lisp_Object
new, tem
;
1011 if (NILP (Vpurify_flag
))
1014 if ((PNTR_COMPARISON_TYPE
) XPNTR (obj
) < (PNTR_COMPARISON_TYPE
) ((char *) pure
+ PURESIZE
)
1015 && (PNTR_COMPARISON_TYPE
) XPNTR (obj
) >= (PNTR_COMPARISON_TYPE
) pure
)
1018 #ifdef SWITCH_ENUM_BUG
1019 switch ((int) XTYPE (obj
))
1021 switch (XTYPE (obj
))
1025 error ("Attempt to copy a marker to pure storage");
1028 return pure_cons (XCONS (obj
)->car
, XCONS (obj
)->cdr
);
1030 #ifdef LISP_FLOAT_TYPE
1032 return make_pure_float (XFLOAT (obj
)->data
);
1033 #endif /* LISP_FLOAT_TYPE */
1036 return make_pure_string (XSTRING (obj
)->data
, XSTRING (obj
)->size
);
1040 new = make_pure_vector (XVECTOR (obj
)->size
);
1041 for (i
= 0; i
< XVECTOR (obj
)->size
; i
++)
1043 tem
= XVECTOR (obj
)->contents
[i
];
1044 XVECTOR (new)->contents
[i
] = Fpurecopy (tem
);
1046 XSETTYPE (new, XTYPE (obj
));
1054 /* Recording what needs to be marked for gc. */
1056 struct gcpro
*gcprolist
;
1058 #define NSTATICS 512
1060 Lisp_Object
*staticvec
[NSTATICS
] = {0};
1064 /* Put an entry in staticvec, pointing at the variable whose address is given */
1067 staticpro (varaddress
)
1068 Lisp_Object
*varaddress
;
1070 staticvec
[staticidx
++] = varaddress
;
1071 if (staticidx
>= NSTATICS
)
1079 struct catchtag
*next
;
1080 /* jmp_buf jmp; /* We don't need this for GC purposes */
1085 struct backtrace
*next
;
1086 Lisp_Object
*function
;
1087 Lisp_Object
*args
; /* Points to vector of args. */
1088 int nargs
; /* length of vector */
1089 /* if nargs is UNEVALLED, args points to slot holding list of unevalled args */
1093 /* Two flags that are set during GC in the `size' component
1094 of a string or vector. On some machines, these flags
1095 are defined by the m- file to be different bits. */
1097 /* On vector, means it has been marked.
1098 On string size field or a reference to a string,
1099 means not the last reference in the chain. */
1101 #ifndef ARRAY_MARK_FLAG
1102 #define ARRAY_MARK_FLAG ((MARKBIT >> 1) & ~MARKBIT)
1103 #endif /* no ARRAY_MARK_FLAG */
1105 /* Any slot that is a Lisp_Object can point to a string
1106 and thus can be put on a string's reference-chain
1107 and thus may need to have its ARRAY_MARK_FLAG set.
1108 This includes the slots whose markbits are used to mark
1109 the containing objects. */
1111 #if ARRAY_MARK_FLAG == MARKBIT
1115 /* Garbage collection! */
1117 int total_conses
, total_markers
, total_symbols
, total_string_size
, total_vector_size
;
1118 int total_free_conses
, total_free_markers
, total_free_symbols
;
1119 #ifdef LISP_FLOAT_TYPE
1120 int total_free_floats
, total_floats
;
1121 #endif /* LISP_FLOAT_TYPE */
1123 DEFUN ("garbage-collect", Fgarbage_collect
, Sgarbage_collect
, 0, 0, "",
1124 "Reclaim storage for Lisp objects no longer needed.\n\
1125 Returns info on amount of space in use:\n\
1126 ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)\n\
1127 (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS\n\
1128 (USED-FLOATS . FREE-FLOATS))\n\
1129 Garbage collection happens automatically if you cons more than\n\
1130 `gc-cons-threshold' bytes of Lisp data since previous garbage collection.")
1133 register struct gcpro
*tail
;
1134 register struct specbinding
*bind
;
1135 struct catchtag
*catch;
1136 struct handler
*handler
;
1137 register struct backtrace
*backlist
;
1138 register Lisp_Object tem
;
1139 char *omessage
= echo_area_glyphs
;
1140 char stack_top_variable
;
1143 /* Save a copy of the contents of the stack, for debugging. */
1144 #if MAX_SAVE_STACK > 0
1145 if (NILP (Vpurify_flag
))
1147 i
= &stack_top_variable
- stack_bottom
;
1149 if (i
< MAX_SAVE_STACK
)
1151 if (stack_copy
== 0)
1152 stack_copy
= (char *) malloc (stack_copy_size
= i
);
1153 else if (stack_copy_size
< i
)
1154 stack_copy
= (char *) realloc (stack_copy
, (stack_copy_size
= i
));
1157 if ((int) (&stack_top_variable
- stack_bottom
) > 0)
1158 bcopy (stack_bottom
, stack_copy
, i
);
1160 bcopy (&stack_top_variable
, stack_copy
, i
);
1164 #endif /* MAX_SAVE_STACK > 0 */
1166 if (!noninteractive
)
1167 message1 ("Garbage collecting...");
1169 /* Don't keep command history around forever */
1170 tem
= Fnthcdr (make_number (30), Vcommand_history
);
1172 XCONS (tem
)->cdr
= Qnil
;
1174 /* Likewise for undo information. */
1176 register struct buffer
*nextb
= all_buffers
;
1180 /* If a buffer's undo list is Qt, that means that undo is
1181 turned off in that buffer. Calling truncate_undo_list on
1182 Qt tends to return NULL, which effectively turns undo back on.
1183 So don't call truncate_undo_list if undo_list is Qt. */
1184 if (! EQ (nextb
->undo_list
, Qt
))
1186 = truncate_undo_list (nextb
->undo_list
, undo_limit
,
1188 nextb
= nextb
->next
;
1194 /* clear_marks (); */
1196 /* In each "large string", set the MARKBIT of the size field.
1197 That enables mark_object to recognize them. */
1199 register struct string_block
*b
;
1200 for (b
= large_string_blocks
; b
; b
= b
->next
)
1201 ((struct Lisp_String
*)(&b
->chars
[0]))->size
|= MARKBIT
;
1204 /* Mark all the special slots that serve as the roots of accessibility.
1206 Usually the special slots to mark are contained in particular structures.
1207 Then we know no slot is marked twice because the structures don't overlap.
1208 In some cases, the structures point to the slots to be marked.
1209 For these, we use MARKBIT to avoid double marking of the slot. */
1211 for (i
= 0; i
< staticidx
; i
++)
1212 mark_object (staticvec
[i
]);
1213 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
1214 for (i
= 0; i
< tail
->nvars
; i
++)
1215 if (!XMARKBIT (tail
->var
[i
]))
1217 mark_object (&tail
->var
[i
]);
1218 XMARK (tail
->var
[i
]);
1220 for (bind
= specpdl
; bind
!= specpdl_ptr
; bind
++)
1222 mark_object (&bind
->symbol
);
1223 mark_object (&bind
->old_value
);
1225 for (catch = catchlist
; catch; catch = catch->next
)
1227 mark_object (&catch->tag
);
1228 mark_object (&catch->val
);
1230 for (handler
= handlerlist
; handler
; handler
= handler
->next
)
1232 mark_object (&handler
->handler
);
1233 mark_object (&handler
->var
);
1235 for (backlist
= backtrace_list
; backlist
; backlist
= backlist
->next
)
1237 if (!XMARKBIT (*backlist
->function
))
1239 mark_object (backlist
->function
);
1240 XMARK (*backlist
->function
);
1242 if (backlist
->nargs
== UNEVALLED
|| backlist
->nargs
== MANY
)
1245 i
= backlist
->nargs
- 1;
1247 if (!XMARKBIT (backlist
->args
[i
]))
1249 mark_object (&backlist
->args
[i
]);
1250 XMARK (backlist
->args
[i
]);
1256 /* Clear the mark bits that we set in certain root slots. */
1258 for (tail
= gcprolist
; tail
; tail
= tail
->next
)
1259 for (i
= 0; i
< tail
->nvars
; i
++)
1260 XUNMARK (tail
->var
[i
]);
1261 for (backlist
= backtrace_list
; backlist
; backlist
= backlist
->next
)
1263 XUNMARK (*backlist
->function
);
1264 if (backlist
->nargs
== UNEVALLED
|| backlist
->nargs
== MANY
)
1267 i
= backlist
->nargs
- 1;
1269 XUNMARK (backlist
->args
[i
]);
1271 XUNMARK (buffer_defaults
.name
);
1272 XUNMARK (buffer_local_symbols
.name
);
1274 /* clear_marks (); */
1277 consing_since_gc
= 0;
1278 if (gc_cons_threshold
< 10000)
1279 gc_cons_threshold
= 10000;
1282 message1 (omessage
);
1283 else if (!noninteractive
)
1284 message1 ("Garbage collecting...done");
1286 return Fcons (Fcons (make_number (total_conses
),
1287 make_number (total_free_conses
)),
1288 Fcons (Fcons (make_number (total_symbols
),
1289 make_number (total_free_symbols
)),
1290 Fcons (Fcons (make_number (total_markers
),
1291 make_number (total_free_markers
)),
1292 Fcons (make_number (total_string_size
),
1293 Fcons (make_number (total_vector_size
),
1295 #ifdef LISP_FLOAT_TYPE
1296 Fcons (Fcons (make_number (total_floats
),
1297 make_number (total_free_floats
)),
1299 #else /* not LISP_FLOAT_TYPE */
1301 #endif /* not LISP_FLOAT_TYPE */
1309 /* Clear marks on all conses */
1311 register struct cons_block
*cblk
;
1312 register int lim
= cons_block_index
;
1314 for (cblk
= cons_block
; cblk
; cblk
= cblk
->next
)
1317 for (i
= 0; i
< lim
; i
++)
1318 XUNMARK (cblk
->conses
[i
].car
);
1319 lim
= CONS_BLOCK_SIZE
;
1322 /* Clear marks on all symbols */
1324 register struct symbol_block
*sblk
;
1325 register int lim
= symbol_block_index
;
1327 for (sblk
= symbol_block
; sblk
; sblk
= sblk
->next
)
1330 for (i
= 0; i
< lim
; i
++)
1332 XUNMARK (sblk
->symbols
[i
].plist
);
1334 lim
= SYMBOL_BLOCK_SIZE
;
1337 /* Clear marks on all markers */
1339 register struct marker_block
*sblk
;
1340 register int lim
= marker_block_index
;
1342 for (sblk
= marker_block
; sblk
; sblk
= sblk
->next
)
1345 for (i
= 0; i
< lim
; i
++)
1346 XUNMARK (sblk
->markers
[i
].chain
);
1347 lim
= MARKER_BLOCK_SIZE
;
1350 /* Clear mark bits on all buffers */
1352 register struct buffer
*nextb
= all_buffers
;
1356 XUNMARK (nextb
->name
);
1357 nextb
= nextb
->next
;
1363 /* Mark reference to a Lisp_Object.
1364 If the object referred to has not been seen yet, recursively mark
1365 all the references contained in it.
1367 If the object referenced is a short string, the referrencing slot
1368 is threaded into a chain of such slots, pointed to from
1369 the `size' field of the string. The actual string size
1370 lives in the last slot in the chain. We recognize the end
1371 because it is < (unsigned) STRING_BLOCK_SIZE. */
1373 #define LAST_MARKED_SIZE 500
1374 Lisp_Object
*last_marked
[LAST_MARKED_SIZE
];
1375 int last_marked_index
;
1378 mark_object (objptr
)
1379 Lisp_Object
*objptr
;
1381 register Lisp_Object obj
;
1388 if ((PNTR_COMPARISON_TYPE
) XPNTR (obj
) < (PNTR_COMPARISON_TYPE
) ((char *) pure
+ PURESIZE
)
1389 && (PNTR_COMPARISON_TYPE
) XPNTR (obj
) >= (PNTR_COMPARISON_TYPE
) pure
)
1392 last_marked
[last_marked_index
++] = objptr
;
1393 if (last_marked_index
== LAST_MARKED_SIZE
)
1394 last_marked_index
= 0;
1396 #ifdef SWITCH_ENUM_BUG
1397 switch ((int) XGCTYPE (obj
))
1399 switch (XGCTYPE (obj
))
1404 register struct Lisp_String
*ptr
= XSTRING (obj
);
1406 MARK_INTERVAL_TREE (ptr
->intervals
);
1407 if (ptr
->size
& MARKBIT
)
1408 /* A large string. Just set ARRAY_MARK_FLAG. */
1409 ptr
->size
|= ARRAY_MARK_FLAG
;
1412 /* A small string. Put this reference
1413 into the chain of references to it.
1414 The address OBJPTR is even, so if the address
1415 includes MARKBIT, put it in the low bit
1416 when we store OBJPTR into the size field. */
1418 if (XMARKBIT (*objptr
))
1420 XFASTINT (*objptr
) = ptr
->size
;
1424 XFASTINT (*objptr
) = ptr
->size
;
1425 if ((int)objptr
& 1) abort ();
1426 ptr
->size
= (int) objptr
& ~MARKBIT
;
1427 if ((int) objptr
& MARKBIT
)
1436 case Lisp_Window_Configuration
:
1438 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
1439 register int size
= ptr
->size
;
1440 struct Lisp_Vector
*volatile ptr1
= ptr
;
1443 if (size
& ARRAY_MARK_FLAG
) break; /* Already marked */
1444 ptr
->size
|= ARRAY_MARK_FLAG
; /* Else mark it */
1445 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
1449 mark_object (&ptr
->contents
[i
]);
1455 /* We could treat this just like a vector, but it is better
1456 to save the COMPILED_CONSTANTS element for last and avoid recursion
1459 register struct Lisp_Vector
*ptr
= XVECTOR (obj
);
1460 register int size
= ptr
->size
;
1461 struct Lisp_Vector
*volatile ptr1
= ptr
;
1464 if (size
& ARRAY_MARK_FLAG
) break; /* Already marked */
1465 ptr
->size
|= ARRAY_MARK_FLAG
; /* Else mark it */
1466 for (i
= 0; i
< size
; i
++) /* and then mark its elements */
1470 if (i
!= COMPILED_CONSTANTS
)
1471 mark_object (&ptr
->contents
[i
]);
1473 objptr
= &ptr
->contents
[COMPILED_CONSTANTS
];
1481 register struct frame
*ptr
= XFRAME (obj
);
1482 register int size
= ptr
->size
;
1484 if (size
& ARRAY_MARK_FLAG
) break; /* Already marked */
1485 ptr
->size
|= ARRAY_MARK_FLAG
; /* Else mark it */
1487 mark_object (&ptr
->name
);
1488 mark_object (&ptr
->focus_frame
);
1489 mark_object (&ptr
->width
);
1490 mark_object (&ptr
->height
);
1491 mark_object (&ptr
->selected_window
);
1492 mark_object (&ptr
->minibuffer_window
);
1493 mark_object (&ptr
->param_alist
);
1494 mark_object (&ptr
->scroll_bars
);
1495 mark_object (&ptr
->condemned_scroll_bars
);
1496 mark_object (&ptr
->menu_bar_items
);
1499 #endif /* not MULTI_FRAME */
1503 register struct Lisp_Symbol
*ptr
= XSYMBOL (obj
);
1504 struct Lisp_Symbol
*ptrx
;
1506 if (XMARKBIT (ptr
->plist
)) break;
1508 mark_object ((Lisp_Object
*) &ptr
->value
);
1509 mark_object (&ptr
->function
);
1510 mark_object (&ptr
->plist
);
1511 XSETTYPE (*(Lisp_Object
*) &ptr
->name
, Lisp_String
);
1512 mark_object (&ptr
->name
);
1516 ptrx
= ptr
; /* Use pf ptrx avoids compiler bug on Sun */
1517 XSETSYMBOL (obj
, ptrx
);
1524 XMARK (XMARKER (obj
)->chain
);
1525 /* DO NOT mark thru the marker's chain.
1526 The buffer's markers chain does not preserve markers from gc;
1527 instead, markers are removed from the chain when freed by gc. */
1531 case Lisp_Buffer_Local_Value
:
1532 case Lisp_Some_Buffer_Local_Value
:
1534 register struct Lisp_Cons
*ptr
= XCONS (obj
);
1535 if (XMARKBIT (ptr
->car
)) break;
1537 /* If the cdr is nil, avoid recursion for the car. */
1538 if (EQ (ptr
->cdr
, Qnil
))
1545 mark_object (&ptr
->car
);
1551 #ifdef LISP_FLOAT_TYPE
1553 XMARK (XFLOAT (obj
)->type
);
1555 #endif /* LISP_FLOAT_TYPE */
1558 if (!XMARKBIT (XBUFFER (obj
)->name
))
1568 case Lisp_Buffer_Objfwd
:
1569 case Lisp_Internal_Stream
:
1570 /* Don't bother with Lisp_Buffer_Objfwd,
1571 since all markable slots in current buffer marked anyway. */
1572 /* Don't need to do Lisp_Objfwd, since the places they point
1573 are protected with staticpro. */
1581 /* Mark the pointers in a buffer structure. */
1587 register struct buffer
*buffer
= XBUFFER (buf
);
1588 register Lisp_Object
*ptr
;
1590 /* This is the buffer's markbit */
1591 mark_object (&buffer
->name
);
1592 XMARK (buffer
->name
);
1594 MARK_INTERVAL_TREE (buffer
->intervals
);
1597 mark_object (buffer
->syntax_table
);
1599 /* Mark the various string-pointers in the buffer object.
1600 Since the strings may be relocated, we must mark them
1601 in their actual slots. So gc_sweep must convert each slot
1602 back to an ordinary C pointer. */
1603 XSET (*(Lisp_Object
*)&buffer
->upcase_table
,
1604 Lisp_String
, buffer
->upcase_table
);
1605 mark_object ((Lisp_Object
*)&buffer
->upcase_table
);
1606 XSET (*(Lisp_Object
*)&buffer
->downcase_table
,
1607 Lisp_String
, buffer
->downcase_table
);
1608 mark_object ((Lisp_Object
*)&buffer
->downcase_table
);
1610 XSET (*(Lisp_Object
*)&buffer
->sort_table
,
1611 Lisp_String
, buffer
->sort_table
);
1612 mark_object ((Lisp_Object
*)&buffer
->sort_table
);
1613 XSET (*(Lisp_Object
*)&buffer
->folding_sort_table
,
1614 Lisp_String
, buffer
->folding_sort_table
);
1615 mark_object ((Lisp_Object
*)&buffer
->folding_sort_table
);
1618 for (ptr
= &buffer
->name
+ 1;
1619 (char *)ptr
< (char *)buffer
+ sizeof (struct buffer
);
1624 /* Sweep: find all structures not marked, and free them. */
1629 total_string_size
= 0;
1632 /* Put all unmarked conses on free list */
1634 register struct cons_block
*cblk
;
1635 register int lim
= cons_block_index
;
1636 register int num_free
= 0, num_used
= 0;
1640 for (cblk
= cons_block
; cblk
; cblk
= cblk
->next
)
1643 for (i
= 0; i
< lim
; i
++)
1644 if (!XMARKBIT (cblk
->conses
[i
].car
))
1646 XFASTINT (cblk
->conses
[i
].car
) = (int) cons_free_list
;
1648 cons_free_list
= &cblk
->conses
[i
];
1653 XUNMARK (cblk
->conses
[i
].car
);
1655 lim
= CONS_BLOCK_SIZE
;
1657 total_conses
= num_used
;
1658 total_free_conses
= num_free
;
1661 #ifdef LISP_FLOAT_TYPE
1662 /* Put all unmarked floats on free list */
1664 register struct float_block
*fblk
;
1665 register int lim
= float_block_index
;
1666 register int num_free
= 0, num_used
= 0;
1668 float_free_list
= 0;
1670 for (fblk
= float_block
; fblk
; fblk
= fblk
->next
)
1673 for (i
= 0; i
< lim
; i
++)
1674 if (!XMARKBIT (fblk
->floats
[i
].type
))
1676 XFASTINT (fblk
->floats
[i
].type
) = (int) float_free_list
;
1678 float_free_list
= &fblk
->floats
[i
];
1683 XUNMARK (fblk
->floats
[i
].type
);
1685 lim
= FLOAT_BLOCK_SIZE
;
1687 total_floats
= num_used
;
1688 total_free_floats
= num_free
;
1690 #endif /* LISP_FLOAT_TYPE */
1692 #ifdef USE_TEXT_PROPERTIES
1693 /* Put all unmarked intervals on free list */
1695 register struct interval_block
*iblk
;
1696 register int lim
= interval_block_index
;
1697 register int num_free
= 0, num_used
= 0;
1699 interval_free_list
= 0;
1701 for (iblk
= interval_block
; iblk
; iblk
= iblk
->next
)
1705 for (i
= 0; i
< lim
; i
++)
1707 if (! XMARKBIT (iblk
->intervals
[i
].plist
))
1709 iblk
->intervals
[i
].parent
= interval_free_list
;
1710 interval_free_list
= &iblk
->intervals
[i
];
1716 XUNMARK (iblk
->intervals
[i
].plist
);
1719 lim
= INTERVAL_BLOCK_SIZE
;
1721 total_intervals
= num_used
;
1722 total_free_intervals
= num_free
;
1724 #endif /* USE_TEXT_PROPERTIES */
1726 /* Put all unmarked symbols on free list */
1728 register struct symbol_block
*sblk
;
1729 register int lim
= symbol_block_index
;
1730 register int num_free
= 0, num_used
= 0;
1732 symbol_free_list
= 0;
1734 for (sblk
= symbol_block
; sblk
; sblk
= sblk
->next
)
1737 for (i
= 0; i
< lim
; i
++)
1738 if (!XMARKBIT (sblk
->symbols
[i
].plist
))
1740 XFASTINT (sblk
->symbols
[i
].value
) = (int) symbol_free_list
;
1741 symbol_free_list
= &sblk
->symbols
[i
];
1747 sblk
->symbols
[i
].name
1748 = XSTRING (*(Lisp_Object
*) &sblk
->symbols
[i
].name
);
1749 XUNMARK (sblk
->symbols
[i
].plist
);
1751 lim
= SYMBOL_BLOCK_SIZE
;
1753 total_symbols
= num_used
;
1754 total_free_symbols
= num_free
;
1758 /* Put all unmarked markers on free list.
1759 Dechain each one first from the buffer it points into. */
1761 register struct marker_block
*mblk
;
1762 struct Lisp_Marker
*tem1
;
1763 register int lim
= marker_block_index
;
1764 register int num_free
= 0, num_used
= 0;
1766 marker_free_list
= 0;
1768 for (mblk
= marker_block
; mblk
; mblk
= mblk
->next
)
1771 for (i
= 0; i
< lim
; i
++)
1772 if (!XMARKBIT (mblk
->markers
[i
].chain
))
1775 tem1
= &mblk
->markers
[i
]; /* tem1 avoids Sun compiler bug */
1776 XSET (tem
, Lisp_Marker
, tem1
);
1777 unchain_marker (tem
);
1778 XFASTINT (mblk
->markers
[i
].chain
) = (int) marker_free_list
;
1779 marker_free_list
= &mblk
->markers
[i
];
1785 XUNMARK (mblk
->markers
[i
].chain
);
1787 lim
= MARKER_BLOCK_SIZE
;
1790 total_markers
= num_used
;
1791 total_free_markers
= num_free
;
1794 /* Free all unmarked buffers */
1796 register struct buffer
*buffer
= all_buffers
, *prev
= 0, *next
;
1799 if (!XMARKBIT (buffer
->name
))
1802 prev
->next
= buffer
->next
;
1804 all_buffers
= buffer
->next
;
1805 next
= buffer
->next
;
1811 XUNMARK (buffer
->name
);
1812 UNMARK_BALANCE_INTERVALS (buffer
->intervals
);
1815 /* Each `struct Lisp_String *' was turned into a Lisp_Object
1816 for purposes of marking and relocation.
1817 Turn them back into C pointers now. */
1818 buffer
->upcase_table
1819 = XSTRING (*(Lisp_Object
*)&buffer
->upcase_table
);
1820 buffer
->downcase_table
1821 = XSTRING (*(Lisp_Object
*)&buffer
->downcase_table
);
1823 = XSTRING (*(Lisp_Object
*)&buffer
->sort_table
);
1824 buffer
->folding_sort_table
1825 = XSTRING (*(Lisp_Object
*)&buffer
->folding_sort_table
);
1828 prev
= buffer
, buffer
= buffer
->next
;
1832 #endif /* standalone */
1834 /* Free all unmarked vectors */
1836 register struct Lisp_Vector
*vector
= all_vectors
, *prev
= 0, *next
;
1837 total_vector_size
= 0;
1840 if (!(vector
->size
& ARRAY_MARK_FLAG
))
1843 prev
->next
= vector
->next
;
1845 all_vectors
= vector
->next
;
1846 next
= vector
->next
;
1852 vector
->size
&= ~ARRAY_MARK_FLAG
;
1853 total_vector_size
+= vector
->size
;
1854 prev
= vector
, vector
= vector
->next
;
1858 /* Free all "large strings" not marked with ARRAY_MARK_FLAG. */
1860 register struct string_block
*sb
= large_string_blocks
, *prev
= 0, *next
;
1863 if (!(((struct Lisp_String
*)(&sb
->chars
[0]))->size
& ARRAY_MARK_FLAG
))
1866 prev
->next
= sb
->next
;
1868 large_string_blocks
= sb
->next
;
1875 ((struct Lisp_String
*)(&sb
->chars
[0]))->size
1876 &= ~ARRAY_MARK_FLAG
& ~MARKBIT
;
1877 total_string_size
+= ((struct Lisp_String
*)(&sb
->chars
[0]))->size
;
1878 prev
= sb
, sb
= sb
->next
;
1883 /* Compactify strings, relocate references, and free empty string blocks. */
1888 /* String block of old strings we are scanning. */
1889 register struct string_block
*from_sb
;
1890 /* A preceding string block (or maybe the same one)
1891 where we are copying the still-live strings to. */
1892 register struct string_block
*to_sb
;
1896 to_sb
= first_string_block
;
1899 /* Scan each existing string block sequentially, string by string. */
1900 for (from_sb
= first_string_block
; from_sb
; from_sb
= from_sb
->next
)
1903 /* POS is the index of the next string in the block. */
1904 while (pos
< from_sb
->pos
)
1906 register struct Lisp_String
*nextstr
1907 = (struct Lisp_String
*) &from_sb
->chars
[pos
];
1909 register struct Lisp_String
*newaddr
;
1910 register int size
= nextstr
->size
;
1912 /* NEXTSTR is the old address of the next string.
1913 Just skip it if it isn't marked. */
1914 if ((unsigned) size
> STRING_BLOCK_SIZE
)
1916 /* It is marked, so its size field is really a chain of refs.
1917 Find the end of the chain, where the actual size lives. */
1918 while ((unsigned) size
> STRING_BLOCK_SIZE
)
1920 if (size
& 1) size
^= MARKBIT
| 1;
1921 size
= *(int *)size
& ~MARKBIT
;
1924 total_string_size
+= size
;
1926 /* If it won't fit in TO_SB, close it out,
1927 and move to the next sb. Keep doing so until
1928 TO_SB reaches a large enough, empty enough string block.
1929 We know that TO_SB cannot advance past FROM_SB here
1930 since FROM_SB is large enough to contain this string.
1931 Any string blocks skipped here
1932 will be patched out and freed later. */
1933 while (to_pos
+ STRING_FULLSIZE (size
)
1934 > max (to_sb
->pos
, STRING_BLOCK_SIZE
))
1936 to_sb
->pos
= to_pos
;
1937 to_sb
= to_sb
->next
;
1940 /* Compute new address of this string
1941 and update TO_POS for the space being used. */
1942 newaddr
= (struct Lisp_String
*) &to_sb
->chars
[to_pos
];
1943 to_pos
+= STRING_FULLSIZE (size
);
1945 /* Copy the string itself to the new place. */
1946 if (nextstr
!= newaddr
)
1947 bcopy (nextstr
, newaddr
, size
+ 1 + sizeof (int)
1948 + INTERVAL_PTR_SIZE
);
1950 /* Go through NEXTSTR's chain of references
1951 and make each slot in the chain point to
1952 the new address of this string. */
1953 size
= newaddr
->size
;
1954 while ((unsigned) size
> STRING_BLOCK_SIZE
)
1956 register Lisp_Object
*objptr
;
1957 if (size
& 1) size
^= MARKBIT
| 1;
1958 objptr
= (Lisp_Object
*)size
;
1960 size
= XFASTINT (*objptr
) & ~MARKBIT
;
1961 if (XMARKBIT (*objptr
))
1963 XSET (*objptr
, Lisp_String
, newaddr
);
1967 XSET (*objptr
, Lisp_String
, newaddr
);
1969 /* Store the actual size in the size field. */
1970 newaddr
->size
= size
;
1972 pos
+= STRING_FULLSIZE (size
);
1976 /* Close out the last string block still used and free any that follow. */
1977 to_sb
->pos
= to_pos
;
1978 current_string_block
= to_sb
;
1980 from_sb
= to_sb
->next
;
1984 to_sb
= from_sb
->next
;
1989 /* Free any empty string blocks further back in the chain.
1990 This loop will never free first_string_block, but it is very
1991 unlikely that that one will become empty, so why bother checking? */
1993 from_sb
= first_string_block
;
1994 while (to_sb
= from_sb
->next
)
1996 if (to_sb
->pos
== 0)
1998 if (from_sb
->next
= to_sb
->next
)
1999 from_sb
->next
->prev
= from_sb
;
2007 /* Debugging aids. */
2009 DEFUN ("memory-limit", Fmemory_limit
, Smemory_limit
, 0, 0, "",
2010 "Return the address of the last byte Emacs has allocated, divided by 1024.\n\
2011 This may be helpful in debugging Emacs's memory usage.\n\
2012 We divide the value by 1024 to make sure it fits in a Lisp integer.")
2017 XSET (end
, Lisp_Int
, (int) sbrk (0) / 1024);
2023 /* Initialization */
2027 /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */
2030 pure_size
= PURESIZE
;
2033 ignore_warnings
= 1;
2038 #ifdef LISP_FLOAT_TYPE
2040 #endif /* LISP_FLOAT_TYPE */
2043 ignore_warnings
= 0;
2046 consing_since_gc
= 0;
2047 gc_cons_threshold
= 100000;
2048 #ifdef VIRT_ADDR_VARIES
2049 malloc_sbrk_unused
= 1<<22; /* A large number */
2050 malloc_sbrk_used
= 100000; /* as reasonable as any number */
2051 #endif /* VIRT_ADDR_VARIES */
2062 DEFVAR_INT ("gc-cons-threshold", &gc_cons_threshold
,
2063 "*Number of bytes of consing between garbage collections.\n\
2064 Garbage collection can happen automatically once this many bytes have been\n\
2065 allocated since the last garbage collection. All data types count.\n\n\
2066 Garbage collection happens automatically only when `eval' is called.\n\n\
2067 By binding this temporarily to a large number, you can effectively\n\
2068 prevent garbage collection during a part of the program.");
2070 DEFVAR_INT ("pure-bytes-used", &pureptr
,
2071 "Number of bytes of sharable Lisp data allocated so far.");
2074 DEFVAR_INT ("data-bytes-used", &malloc_sbrk_used
,
2075 "Number of bytes of unshared memory allocated in this session.");
2077 DEFVAR_INT ("data-bytes-free", &malloc_sbrk_unused
,
2078 "Number of bytes of unshared memory remaining available in this session.");
2081 DEFVAR_LISP ("purify-flag", &Vpurify_flag
,
2082 "Non-nil means loading Lisp code in order to dump an executable.\n\
2083 This means that certain objects should be allocated in shared (pure) space.");
2085 DEFVAR_INT ("undo-limit", &undo_limit
,
2086 "Keep no more undo information once it exceeds this size.\n\
2087 This limit is applied when garbage collection happens.\n\
2088 The size is counted as the number of bytes occupied,\n\
2089 which includes both saved text and other data.");
2092 DEFVAR_INT ("undo-strong-limit", &undo_strong_limit
,
2093 "Don't keep more than this much size of undo information.\n\
2094 A command which pushes past this size is itself forgotten.\n\
2095 This limit is applied when garbage collection happens.\n\
2096 The size is counted as the number of bytes occupied,\n\
2097 which includes both saved text and other data.");
2098 undo_strong_limit
= 30000;
2103 defsubr (&Smake_byte_code
);
2104 defsubr (&Smake_list
);
2105 defsubr (&Smake_vector
);
2106 defsubr (&Smake_string
);
2107 defsubr (&Smake_symbol
);
2108 defsubr (&Smake_marker
);
2109 defsubr (&Spurecopy
);
2110 defsubr (&Sgarbage_collect
);
2111 defsubr (&Smemory_limit
);