Commit | Line | Data |
---|---|---|
7146af97 | 1 | /* Storage allocation and gc for GNU Emacs Lisp interpreter. |
0220c518 | 2 | Copyright (C) 1985, 86, 88, 93, 94, 95 Free Software Foundation, Inc. |
7146af97 JB |
3 | |
4 | This file is part of GNU Emacs. | |
5 | ||
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 | |
7c299e7a | 8 | the Free Software Foundation; either version 2, or (at your option) |
7146af97 JB |
9 | any later version. |
10 | ||
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. | |
15 | ||
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. */ | |
19 | ||
290c8f1e | 20 | /* Note that this declares bzero on OSF/1. How dumb. */ |
cf026b25 | 21 | #include <signal.h> |
7146af97 | 22 | |
18160b98 | 23 | #include <config.h> |
7146af97 | 24 | #include "lisp.h" |
d5e35230 | 25 | #include "intervals.h" |
4c0be5f4 | 26 | #include "puresize.h" |
7146af97 JB |
27 | #ifndef standalone |
28 | #include "buffer.h" | |
29 | #include "window.h" | |
502b9b64 | 30 | #include "frame.h" |
9ac0d9e0 | 31 | #include "blockinput.h" |
077d751f | 32 | #include "keyboard.h" |
7146af97 JB |
33 | #endif |
34 | ||
e065a56e JB |
35 | #include "syssignal.h" |
36 | ||
ee1eea5c KH |
37 | extern char *sbrk (); |
38 | ||
276cbe5a RS |
39 | /* The following come from gmalloc.c. */ |
40 | ||
41 | #if defined (__STDC__) && __STDC__ | |
42 | #include <stddef.h> | |
43 | #define __malloc_size_t size_t | |
44 | #else | |
45 | #define __malloc_size_t unsigned int | |
46 | #endif | |
47 | extern __malloc_size_t _bytes_used; | |
48 | extern int __malloc_extra_blocks; | |
49 | ||
7146af97 | 50 | #define max(A,B) ((A) > (B) ? (A) : (B)) |
b580578b | 51 | #define min(A,B) ((A) < (B) ? (A) : (B)) |
7146af97 JB |
52 | |
53 | /* Macro to verify that storage intended for Lisp objects is not | |
54 | out of range to fit in the space for a pointer. | |
55 | ADDRESS is the start of the block, and SIZE | |
56 | is the amount of space within which objects can start. */ | |
57 | #define VALIDATE_LISP_STORAGE(address, size) \ | |
58 | do \ | |
59 | { \ | |
60 | Lisp_Object val; \ | |
45d12a89 | 61 | XSETCONS (val, (char *) address + size); \ |
7146af97 JB |
62 | if ((char *) XCONS (val) != (char *) address + size) \ |
63 | { \ | |
9ac0d9e0 | 64 | xfree (address); \ |
7146af97 JB |
65 | memory_full (); \ |
66 | } \ | |
67 | } while (0) | |
68 | ||
276cbe5a RS |
69 | /* Value of _bytes_used, when spare_memory was freed. */ |
70 | static __malloc_size_t bytes_used_when_full; | |
71 | ||
7146af97 JB |
72 | /* Number of bytes of consing done since the last gc */ |
73 | int consing_since_gc; | |
74 | ||
310ea200 RS |
75 | /* Count the amount of consing of various sorts of space. */ |
76 | int cons_cells_consed; | |
77 | int floats_consed; | |
78 | int vector_cells_consed; | |
79 | int symbols_consed; | |
80 | int string_chars_consed; | |
81 | int misc_objects_consed; | |
82 | int intervals_consed; | |
83 | ||
7146af97 | 84 | /* Number of bytes of consing since gc before another gc should be done. */ |
b580578b | 85 | int gc_cons_threshold; |
7146af97 JB |
86 | |
87 | /* Nonzero during gc */ | |
88 | int gc_in_progress; | |
89 | ||
90 | #ifndef VIRT_ADDR_VARIES | |
91 | extern | |
92 | #endif /* VIRT_ADDR_VARIES */ | |
93 | int malloc_sbrk_used; | |
94 | ||
95 | #ifndef VIRT_ADDR_VARIES | |
96 | extern | |
97 | #endif /* VIRT_ADDR_VARIES */ | |
98 | int malloc_sbrk_unused; | |
99 | ||
502b9b64 JB |
100 | /* Two limits controlling how much undo information to keep. */ |
101 | int undo_limit; | |
102 | int undo_strong_limit; | |
7146af97 | 103 | |
276cbe5a RS |
104 | /* Points to memory space allocated as "spare", |
105 | to be freed if we run out of memory. */ | |
106 | static char *spare_memory; | |
107 | ||
108 | /* Amount of spare memory to keep in reserve. */ | |
109 | #define SPARE_MEMORY (1 << 14) | |
110 | ||
111 | /* Number of extra blocks malloc should get when it needs more core. */ | |
112 | static int malloc_hysteresis; | |
113 | ||
3c06d205 KH |
114 | /* Nonzero when malloc is called for allocating Lisp object space. */ |
115 | int allocating_for_lisp; | |
116 | ||
7146af97 JB |
117 | /* Non-nil means defun should do purecopy on the function definition */ |
118 | Lisp_Object Vpurify_flag; | |
119 | ||
120 | #ifndef HAVE_SHM | |
42607681 | 121 | EMACS_INT pure[PURESIZE / sizeof (EMACS_INT)] = {0,}; /* Force it into data space! */ |
7146af97 JB |
122 | #define PUREBEG (char *) pure |
123 | #else | |
124 | #define pure PURE_SEG_BITS /* Use shared memory segment */ | |
125 | #define PUREBEG (char *)PURE_SEG_BITS | |
4c0be5f4 JB |
126 | |
127 | /* This variable is used only by the XPNTR macro when HAVE_SHM is | |
128 | defined. If we used the PURESIZE macro directly there, that would | |
129 | make most of emacs dependent on puresize.h, which we don't want - | |
130 | you should be able to change that without too much recompilation. | |
131 | So map_in_data initializes pure_size, and the dependencies work | |
132 | out. */ | |
42607681 | 133 | EMACS_INT pure_size; |
7146af97 JB |
134 | #endif /* not HAVE_SHM */ |
135 | ||
136 | /* Index in pure at which next pure object will be allocated. */ | |
137 | int pureptr; | |
138 | ||
139 | /* If nonzero, this is a warning delivered by malloc and not yet displayed. */ | |
140 | char *pending_malloc_warning; | |
141 | ||
bcb61d60 | 142 | /* Pre-computed signal argument for use when memory is exhausted. */ |
cf3540e4 | 143 | Lisp_Object memory_signal_data; |
bcb61d60 | 144 | |
7146af97 JB |
145 | /* Maximum amount of C stack to save when a GC happens. */ |
146 | ||
147 | #ifndef MAX_SAVE_STACK | |
148 | #define MAX_SAVE_STACK 16000 | |
149 | #endif | |
150 | ||
1fb577f7 KH |
151 | /* Define DONT_COPY_FLAG to be some bit which will always be zero in a |
152 | pointer to a Lisp_Object, when that pointer is viewed as an integer. | |
153 | (On most machines, pointers are even, so we can use the low bit. | |
8e6208c5 | 154 | Word-addressable architectures may need to override this in the m-file.) |
1fb577f7 KH |
155 | When linking references to small strings through the size field, we |
156 | use this slot to hold the bit that would otherwise be interpreted as | |
157 | the GC mark bit. */ | |
155ffe9c | 158 | #ifndef DONT_COPY_FLAG |
1fb577f7 | 159 | #define DONT_COPY_FLAG 1 |
155ffe9c RS |
160 | #endif /* no DONT_COPY_FLAG */ |
161 | ||
7146af97 JB |
162 | /* Buffer in which we save a copy of the C stack at each GC. */ |
163 | ||
164 | char *stack_copy; | |
165 | int stack_copy_size; | |
166 | ||
167 | /* Non-zero means ignore malloc warnings. Set during initialization. */ | |
168 | int ignore_warnings; | |
350273a4 | 169 | |
a59de17b | 170 | Lisp_Object Qgc_cons_threshold, Qchar_table_extra_slots; |
e8197642 | 171 | |
b875d3f7 | 172 | static void mark_object (), mark_buffer (), mark_kboards (); |
350273a4 JA |
173 | static void clear_marks (), gc_sweep (); |
174 | static void compact_strings (); | |
7146af97 | 175 | \f |
1a4f1e2c JB |
176 | /* Versions of malloc and realloc that print warnings as memory gets full. */ |
177 | ||
7146af97 JB |
178 | Lisp_Object |
179 | malloc_warning_1 (str) | |
180 | Lisp_Object str; | |
181 | { | |
182 | Fprinc (str, Vstandard_output); | |
183 | write_string ("\nKilling some buffers may delay running out of memory.\n", -1); | |
184 | write_string ("However, certainly by the time you receive the 95% warning,\n", -1); | |
185 | write_string ("you should clean up, kill this Emacs, and start a new one.", -1); | |
186 | return Qnil; | |
187 | } | |
188 | ||
189 | /* malloc calls this if it finds we are near exhausting storage */ | |
190 | malloc_warning (str) | |
191 | char *str; | |
192 | { | |
193 | pending_malloc_warning = str; | |
194 | } | |
195 | ||
196 | display_malloc_warning () | |
197 | { | |
198 | register Lisp_Object val; | |
199 | ||
200 | val = build_string (pending_malloc_warning); | |
201 | pending_malloc_warning = 0; | |
202 | internal_with_output_to_temp_buffer (" *Danger*", malloc_warning_1, val); | |
203 | } | |
204 | ||
205 | /* Called if malloc returns zero */ | |
276cbe5a | 206 | |
7146af97 JB |
207 | memory_full () |
208 | { | |
276cbe5a RS |
209 | #ifndef SYSTEM_MALLOC |
210 | bytes_used_when_full = _bytes_used; | |
211 | #endif | |
212 | ||
213 | /* The first time we get here, free the spare memory. */ | |
214 | if (spare_memory) | |
215 | { | |
216 | free (spare_memory); | |
217 | spare_memory = 0; | |
218 | } | |
219 | ||
220 | /* This used to call error, but if we've run out of memory, we could get | |
221 | infinite recursion trying to build the string. */ | |
222 | while (1) | |
223 | Fsignal (Qerror, memory_signal_data); | |
224 | } | |
225 | ||
226 | /* Called if we can't allocate relocatable space for a buffer. */ | |
227 | ||
228 | void | |
229 | buffer_memory_full () | |
230 | { | |
231 | /* If buffers use the relocating allocator, | |
232 | no need to free spare_memory, because we may have plenty of malloc | |
233 | space left that we could get, and if we don't, the malloc that fails | |
234 | will itself cause spare_memory to be freed. | |
235 | If buffers don't use the relocating allocator, | |
236 | treat this like any other failing malloc. */ | |
237 | ||
238 | #ifndef REL_ALLOC | |
239 | memory_full (); | |
240 | #endif | |
241 | ||
bcb61d60 KH |
242 | /* This used to call error, but if we've run out of memory, we could get |
243 | infinite recursion trying to build the string. */ | |
244 | while (1) | |
245 | Fsignal (Qerror, memory_signal_data); | |
7146af97 JB |
246 | } |
247 | ||
9ac0d9e0 | 248 | /* like malloc routines but check for no memory and block interrupt input. */ |
7146af97 JB |
249 | |
250 | long * | |
251 | xmalloc (size) | |
252 | int size; | |
253 | { | |
254 | register long *val; | |
255 | ||
9ac0d9e0 | 256 | BLOCK_INPUT; |
7146af97 | 257 | val = (long *) malloc (size); |
9ac0d9e0 | 258 | UNBLOCK_INPUT; |
7146af97 JB |
259 | |
260 | if (!val && size) memory_full (); | |
261 | return val; | |
262 | } | |
263 | ||
264 | long * | |
265 | xrealloc (block, size) | |
266 | long *block; | |
267 | int size; | |
268 | { | |
269 | register long *val; | |
270 | ||
9ac0d9e0 | 271 | BLOCK_INPUT; |
56d2031b JB |
272 | /* We must call malloc explicitly when BLOCK is 0, since some |
273 | reallocs don't do this. */ | |
274 | if (! block) | |
275 | val = (long *) malloc (size); | |
f048679d | 276 | else |
56d2031b | 277 | val = (long *) realloc (block, size); |
9ac0d9e0 | 278 | UNBLOCK_INPUT; |
7146af97 JB |
279 | |
280 | if (!val && size) memory_full (); | |
281 | return val; | |
282 | } | |
9ac0d9e0 JB |
283 | |
284 | void | |
285 | xfree (block) | |
286 | long *block; | |
287 | { | |
288 | BLOCK_INPUT; | |
289 | free (block); | |
290 | UNBLOCK_INPUT; | |
291 | } | |
292 | ||
293 | \f | |
294 | /* Arranging to disable input signals while we're in malloc. | |
295 | ||
296 | This only works with GNU malloc. To help out systems which can't | |
297 | use GNU malloc, all the calls to malloc, realloc, and free | |
298 | elsewhere in the code should be inside a BLOCK_INPUT/UNBLOCK_INPUT | |
299 | pairs; unfortunately, we have no idea what C library functions | |
300 | might call malloc, so we can't really protect them unless you're | |
301 | using GNU malloc. Fortunately, most of the major operating can use | |
302 | GNU malloc. */ | |
303 | ||
304 | #ifndef SYSTEM_MALLOC | |
b0846f52 JB |
305 | extern void * (*__malloc_hook) (); |
306 | static void * (*old_malloc_hook) (); | |
307 | extern void * (*__realloc_hook) (); | |
308 | static void * (*old_realloc_hook) (); | |
309 | extern void (*__free_hook) (); | |
310 | static void (*old_free_hook) (); | |
9ac0d9e0 | 311 | |
276cbe5a RS |
312 | /* This function is used as the hook for free to call. */ |
313 | ||
9ac0d9e0 JB |
314 | static void |
315 | emacs_blocked_free (ptr) | |
316 | void *ptr; | |
317 | { | |
318 | BLOCK_INPUT; | |
319 | __free_hook = old_free_hook; | |
320 | free (ptr); | |
276cbe5a RS |
321 | /* If we released our reserve (due to running out of memory), |
322 | and we have a fair amount free once again, | |
323 | try to set aside another reserve in case we run out once more. */ | |
324 | if (spare_memory == 0 | |
325 | /* Verify there is enough space that even with the malloc | |
326 | hysteresis this call won't run out again. | |
327 | The code here is correct as long as SPARE_MEMORY | |
328 | is substantially larger than the block size malloc uses. */ | |
329 | && (bytes_used_when_full | |
330 | > _bytes_used + max (malloc_hysteresis, 4) * SPARE_MEMORY)) | |
331 | spare_memory = (char *) malloc (SPARE_MEMORY); | |
332 | ||
b0846f52 | 333 | __free_hook = emacs_blocked_free; |
9ac0d9e0 JB |
334 | UNBLOCK_INPUT; |
335 | } | |
336 | ||
276cbe5a RS |
337 | /* If we released our reserve (due to running out of memory), |
338 | and we have a fair amount free once again, | |
339 | try to set aside another reserve in case we run out once more. | |
340 | ||
341 | This is called when a relocatable block is freed in ralloc.c. */ | |
342 | ||
343 | void | |
344 | refill_memory_reserve () | |
345 | { | |
346 | if (spare_memory == 0) | |
347 | spare_memory = (char *) malloc (SPARE_MEMORY); | |
348 | } | |
349 | ||
350 | /* This function is the malloc hook that Emacs uses. */ | |
351 | ||
9ac0d9e0 JB |
352 | static void * |
353 | emacs_blocked_malloc (size) | |
354 | unsigned size; | |
355 | { | |
356 | void *value; | |
357 | ||
358 | BLOCK_INPUT; | |
359 | __malloc_hook = old_malloc_hook; | |
276cbe5a | 360 | __malloc_extra_blocks = malloc_hysteresis; |
2756d8ee | 361 | value = (void *) malloc (size); |
b0846f52 | 362 | __malloc_hook = emacs_blocked_malloc; |
9ac0d9e0 JB |
363 | UNBLOCK_INPUT; |
364 | ||
365 | return value; | |
366 | } | |
367 | ||
368 | static void * | |
369 | emacs_blocked_realloc (ptr, size) | |
370 | void *ptr; | |
371 | unsigned size; | |
372 | { | |
373 | void *value; | |
374 | ||
375 | BLOCK_INPUT; | |
376 | __realloc_hook = old_realloc_hook; | |
2756d8ee | 377 | value = (void *) realloc (ptr, size); |
b0846f52 | 378 | __realloc_hook = emacs_blocked_realloc; |
9ac0d9e0 JB |
379 | UNBLOCK_INPUT; |
380 | ||
381 | return value; | |
382 | } | |
383 | ||
384 | void | |
385 | uninterrupt_malloc () | |
386 | { | |
387 | old_free_hook = __free_hook; | |
b0846f52 | 388 | __free_hook = emacs_blocked_free; |
9ac0d9e0 JB |
389 | |
390 | old_malloc_hook = __malloc_hook; | |
b0846f52 | 391 | __malloc_hook = emacs_blocked_malloc; |
9ac0d9e0 JB |
392 | |
393 | old_realloc_hook = __realloc_hook; | |
b0846f52 | 394 | __realloc_hook = emacs_blocked_realloc; |
9ac0d9e0 JB |
395 | } |
396 | #endif | |
7146af97 | 397 | \f |
1a4f1e2c JB |
398 | /* Interval allocation. */ |
399 | ||
d5e35230 JA |
400 | #ifdef USE_TEXT_PROPERTIES |
401 | #define INTERVAL_BLOCK_SIZE \ | |
402 | ((1020 - sizeof (struct interval_block *)) / sizeof (struct interval)) | |
403 | ||
404 | struct interval_block | |
405 | { | |
406 | struct interval_block *next; | |
407 | struct interval intervals[INTERVAL_BLOCK_SIZE]; | |
408 | }; | |
409 | ||
410 | struct interval_block *interval_block; | |
411 | static int interval_block_index; | |
412 | ||
413 | INTERVAL interval_free_list; | |
414 | ||
415 | static void | |
416 | init_intervals () | |
417 | { | |
3c06d205 | 418 | allocating_for_lisp = 1; |
d5e35230 JA |
419 | interval_block |
420 | = (struct interval_block *) malloc (sizeof (struct interval_block)); | |
3c06d205 | 421 | allocating_for_lisp = 0; |
d5e35230 | 422 | interval_block->next = 0; |
290c8f1e | 423 | bzero ((char *) interval_block->intervals, sizeof interval_block->intervals); |
d5e35230 JA |
424 | interval_block_index = 0; |
425 | interval_free_list = 0; | |
426 | } | |
427 | ||
428 | #define INIT_INTERVALS init_intervals () | |
429 | ||
430 | INTERVAL | |
431 | make_interval () | |
432 | { | |
433 | INTERVAL val; | |
434 | ||
435 | if (interval_free_list) | |
436 | { | |
437 | val = interval_free_list; | |
438 | interval_free_list = interval_free_list->parent; | |
439 | } | |
440 | else | |
441 | { | |
442 | if (interval_block_index == INTERVAL_BLOCK_SIZE) | |
443 | { | |
3c06d205 KH |
444 | register struct interval_block *newi; |
445 | ||
446 | allocating_for_lisp = 1; | |
447 | newi = (struct interval_block *) xmalloc (sizeof (struct interval_block)); | |
d5e35230 | 448 | |
3c06d205 | 449 | allocating_for_lisp = 0; |
d5e35230 JA |
450 | VALIDATE_LISP_STORAGE (newi, sizeof *newi); |
451 | newi->next = interval_block; | |
452 | interval_block = newi; | |
453 | interval_block_index = 0; | |
454 | } | |
455 | val = &interval_block->intervals[interval_block_index++]; | |
456 | } | |
457 | consing_since_gc += sizeof (struct interval); | |
310ea200 | 458 | intervals_consed++; |
d5e35230 JA |
459 | RESET_INTERVAL (val); |
460 | return val; | |
461 | } | |
462 | ||
463 | static int total_free_intervals, total_intervals; | |
464 | ||
465 | /* Mark the pointers of one interval. */ | |
466 | ||
467 | static void | |
d393c068 | 468 | mark_interval (i, dummy) |
d5e35230 | 469 | register INTERVAL i; |
d393c068 | 470 | Lisp_Object dummy; |
d5e35230 JA |
471 | { |
472 | if (XMARKBIT (i->plist)) | |
473 | abort (); | |
474 | mark_object (&i->plist); | |
475 | XMARK (i->plist); | |
476 | } | |
477 | ||
478 | static void | |
479 | mark_interval_tree (tree) | |
480 | register INTERVAL tree; | |
481 | { | |
e8720644 JB |
482 | /* No need to test if this tree has been marked already; this |
483 | function is always called through the MARK_INTERVAL_TREE macro, | |
484 | which takes care of that. */ | |
485 | ||
486 | /* XMARK expands to an assignment; the LHS of an assignment can't be | |
487 | a cast. */ | |
488 | XMARK (* (Lisp_Object *) &tree->parent); | |
d5e35230 | 489 | |
d393c068 | 490 | traverse_intervals (tree, 1, 0, mark_interval, Qnil); |
d5e35230 JA |
491 | } |
492 | ||
e8720644 JB |
493 | #define MARK_INTERVAL_TREE(i) \ |
494 | do { \ | |
495 | if (!NULL_INTERVAL_P (i) \ | |
496 | && ! XMARKBIT ((Lisp_Object) i->parent)) \ | |
497 | mark_interval_tree (i); \ | |
498 | } while (0) | |
d5e35230 | 499 | |
1a4f1e2c | 500 | /* The oddity in the call to XUNMARK is necessary because XUNMARK |
eb8c3be9 | 501 | expands to an assignment to its argument, and most C compilers don't |
1a4f1e2c JB |
502 | support casts on the left operand of `='. */ |
503 | #define UNMARK_BALANCE_INTERVALS(i) \ | |
504 | { \ | |
505 | if (! NULL_INTERVAL_P (i)) \ | |
506 | { \ | |
507 | XUNMARK (* (Lisp_Object *) (&(i)->parent)); \ | |
508 | (i) = balance_intervals (i); \ | |
509 | } \ | |
d5e35230 JA |
510 | } |
511 | ||
512 | #else /* no interval use */ | |
513 | ||
514 | #define INIT_INTERVALS | |
515 | ||
516 | #define UNMARK_BALANCE_INTERVALS(i) | |
517 | #define MARK_INTERVAL_TREE(i) | |
518 | ||
519 | #endif /* no interval use */ | |
520 | \f | |
1a4f1e2c JB |
521 | /* Floating point allocation. */ |
522 | ||
7146af97 JB |
523 | #ifdef LISP_FLOAT_TYPE |
524 | /* Allocation of float cells, just like conses */ | |
525 | /* We store float cells inside of float_blocks, allocating a new | |
526 | float_block with malloc whenever necessary. Float cells reclaimed by | |
527 | GC are put on a free list to be reallocated before allocating | |
528 | any new float cells from the latest float_block. | |
529 | ||
530 | Each float_block is just under 1020 bytes long, | |
531 | since malloc really allocates in units of powers of two | |
532 | and uses 4 bytes for its own overhead. */ | |
533 | ||
534 | #define FLOAT_BLOCK_SIZE \ | |
535 | ((1020 - sizeof (struct float_block *)) / sizeof (struct Lisp_Float)) | |
536 | ||
537 | struct float_block | |
538 | { | |
539 | struct float_block *next; | |
540 | struct Lisp_Float floats[FLOAT_BLOCK_SIZE]; | |
541 | }; | |
542 | ||
543 | struct float_block *float_block; | |
544 | int float_block_index; | |
545 | ||
546 | struct Lisp_Float *float_free_list; | |
547 | ||
548 | void | |
549 | init_float () | |
550 | { | |
3c06d205 | 551 | allocating_for_lisp = 1; |
7146af97 | 552 | float_block = (struct float_block *) malloc (sizeof (struct float_block)); |
3c06d205 | 553 | allocating_for_lisp = 0; |
7146af97 | 554 | float_block->next = 0; |
290c8f1e | 555 | bzero ((char *) float_block->floats, sizeof float_block->floats); |
7146af97 JB |
556 | float_block_index = 0; |
557 | float_free_list = 0; | |
558 | } | |
559 | ||
560 | /* Explicitly free a float cell. */ | |
561 | free_float (ptr) | |
562 | struct Lisp_Float *ptr; | |
563 | { | |
85481507 | 564 | *(struct Lisp_Float **)&ptr->type = float_free_list; |
7146af97 JB |
565 | float_free_list = ptr; |
566 | } | |
567 | ||
568 | Lisp_Object | |
569 | make_float (float_value) | |
570 | double float_value; | |
571 | { | |
572 | register Lisp_Object val; | |
573 | ||
574 | if (float_free_list) | |
575 | { | |
45d12a89 | 576 | XSETFLOAT (val, float_free_list); |
85481507 | 577 | float_free_list = *(struct Lisp_Float **)&float_free_list->type; |
7146af97 JB |
578 | } |
579 | else | |
580 | { | |
581 | if (float_block_index == FLOAT_BLOCK_SIZE) | |
582 | { | |
3c06d205 KH |
583 | register struct float_block *new; |
584 | ||
585 | allocating_for_lisp = 1; | |
586 | new = (struct float_block *) xmalloc (sizeof (struct float_block)); | |
587 | allocating_for_lisp = 0; | |
7146af97 JB |
588 | VALIDATE_LISP_STORAGE (new, sizeof *new); |
589 | new->next = float_block; | |
590 | float_block = new; | |
591 | float_block_index = 0; | |
592 | } | |
45d12a89 | 593 | XSETFLOAT (val, &float_block->floats[float_block_index++]); |
7146af97 JB |
594 | } |
595 | XFLOAT (val)->data = float_value; | |
67ba9986 | 596 | XSETFASTINT (XFLOAT (val)->type, 0); /* bug chasing -wsr */ |
7146af97 | 597 | consing_since_gc += sizeof (struct Lisp_Float); |
310ea200 | 598 | floats_consed++; |
7146af97 JB |
599 | return val; |
600 | } | |
601 | ||
602 | #endif /* LISP_FLOAT_TYPE */ | |
603 | \f | |
604 | /* Allocation of cons cells */ | |
605 | /* We store cons cells inside of cons_blocks, allocating a new | |
606 | cons_block with malloc whenever necessary. Cons cells reclaimed by | |
607 | GC are put on a free list to be reallocated before allocating | |
608 | any new cons cells from the latest cons_block. | |
609 | ||
610 | Each cons_block is just under 1020 bytes long, | |
611 | since malloc really allocates in units of powers of two | |
612 | and uses 4 bytes for its own overhead. */ | |
613 | ||
614 | #define CONS_BLOCK_SIZE \ | |
615 | ((1020 - sizeof (struct cons_block *)) / sizeof (struct Lisp_Cons)) | |
616 | ||
617 | struct cons_block | |
618 | { | |
619 | struct cons_block *next; | |
620 | struct Lisp_Cons conses[CONS_BLOCK_SIZE]; | |
621 | }; | |
622 | ||
623 | struct cons_block *cons_block; | |
624 | int cons_block_index; | |
625 | ||
626 | struct Lisp_Cons *cons_free_list; | |
627 | ||
628 | void | |
629 | init_cons () | |
630 | { | |
3c06d205 | 631 | allocating_for_lisp = 1; |
7146af97 | 632 | cons_block = (struct cons_block *) malloc (sizeof (struct cons_block)); |
3c06d205 | 633 | allocating_for_lisp = 0; |
7146af97 | 634 | cons_block->next = 0; |
290c8f1e | 635 | bzero ((char *) cons_block->conses, sizeof cons_block->conses); |
7146af97 JB |
636 | cons_block_index = 0; |
637 | cons_free_list = 0; | |
638 | } | |
639 | ||
640 | /* Explicitly free a cons cell. */ | |
641 | free_cons (ptr) | |
642 | struct Lisp_Cons *ptr; | |
643 | { | |
85481507 | 644 | *(struct Lisp_Cons **)&ptr->car = cons_free_list; |
7146af97 JB |
645 | cons_free_list = ptr; |
646 | } | |
647 | ||
648 | DEFUN ("cons", Fcons, Scons, 2, 2, 0, | |
649 | "Create a new cons, give it CAR and CDR as components, and return it.") | |
650 | (car, cdr) | |
651 | Lisp_Object car, cdr; | |
652 | { | |
653 | register Lisp_Object val; | |
654 | ||
655 | if (cons_free_list) | |
656 | { | |
45d12a89 | 657 | XSETCONS (val, cons_free_list); |
85481507 | 658 | cons_free_list = *(struct Lisp_Cons **)&cons_free_list->car; |
7146af97 JB |
659 | } |
660 | else | |
661 | { | |
662 | if (cons_block_index == CONS_BLOCK_SIZE) | |
663 | { | |
3c06d205 KH |
664 | register struct cons_block *new; |
665 | allocating_for_lisp = 1; | |
666 | new = (struct cons_block *) xmalloc (sizeof (struct cons_block)); | |
667 | allocating_for_lisp = 0; | |
7146af97 JB |
668 | VALIDATE_LISP_STORAGE (new, sizeof *new); |
669 | new->next = cons_block; | |
670 | cons_block = new; | |
671 | cons_block_index = 0; | |
672 | } | |
45d12a89 | 673 | XSETCONS (val, &cons_block->conses[cons_block_index++]); |
7146af97 JB |
674 | } |
675 | XCONS (val)->car = car; | |
676 | XCONS (val)->cdr = cdr; | |
677 | consing_since_gc += sizeof (struct Lisp_Cons); | |
310ea200 | 678 | cons_cells_consed++; |
7146af97 JB |
679 | return val; |
680 | } | |
681 | ||
682 | DEFUN ("list", Flist, Slist, 0, MANY, 0, | |
683 | "Return a newly created list with specified arguments as elements.\n\ | |
684 | Any number of arguments, even zero arguments, are allowed.") | |
685 | (nargs, args) | |
686 | int nargs; | |
687 | register Lisp_Object *args; | |
688 | { | |
128a5b55 RS |
689 | register Lisp_Object val; |
690 | val = Qnil; | |
7146af97 | 691 | |
128a5b55 RS |
692 | while (nargs > 0) |
693 | { | |
694 | nargs--; | |
695 | val = Fcons (args[nargs], val); | |
696 | } | |
7146af97 JB |
697 | return val; |
698 | } | |
699 | ||
700 | DEFUN ("make-list", Fmake_list, Smake_list, 2, 2, 0, | |
701 | "Return a newly created list of length LENGTH, with each element being INIT.") | |
702 | (length, init) | |
703 | register Lisp_Object length, init; | |
704 | { | |
705 | register Lisp_Object val; | |
706 | register int size; | |
707 | ||
c9dad5ed KH |
708 | CHECK_NATNUM (length, 0); |
709 | size = XFASTINT (length); | |
7146af97 JB |
710 | |
711 | val = Qnil; | |
712 | while (size-- > 0) | |
713 | val = Fcons (init, val); | |
714 | return val; | |
715 | } | |
716 | \f | |
717 | /* Allocation of vectors */ | |
718 | ||
719 | struct Lisp_Vector *all_vectors; | |
720 | ||
1825c68d KH |
721 | struct Lisp_Vector * |
722 | allocate_vectorlike (len) | |
723 | EMACS_INT len; | |
724 | { | |
725 | struct Lisp_Vector *p; | |
726 | ||
3c06d205 | 727 | allocating_for_lisp = 1; |
1825c68d KH |
728 | p = (struct Lisp_Vector *)xmalloc (sizeof (struct Lisp_Vector) |
729 | + (len - 1) * sizeof (Lisp_Object)); | |
3c06d205 | 730 | allocating_for_lisp = 0; |
1825c68d KH |
731 | VALIDATE_LISP_STORAGE (p, 0); |
732 | consing_since_gc += (sizeof (struct Lisp_Vector) | |
733 | + (len - 1) * sizeof (Lisp_Object)); | |
310ea200 | 734 | vector_cells_consed += len; |
1825c68d KH |
735 | |
736 | p->next = all_vectors; | |
737 | all_vectors = p; | |
738 | return p; | |
739 | } | |
740 | ||
7146af97 JB |
741 | DEFUN ("make-vector", Fmake_vector, Smake_vector, 2, 2, 0, |
742 | "Return a newly created vector of length LENGTH, with each element being INIT.\n\ | |
743 | See also the function `vector'.") | |
744 | (length, init) | |
745 | register Lisp_Object length, init; | |
746 | { | |
1825c68d KH |
747 | Lisp_Object vector; |
748 | register EMACS_INT sizei; | |
749 | register int index; | |
7146af97 JB |
750 | register struct Lisp_Vector *p; |
751 | ||
c9dad5ed KH |
752 | CHECK_NATNUM (length, 0); |
753 | sizei = XFASTINT (length); | |
7146af97 | 754 | |
1825c68d | 755 | p = allocate_vectorlike (sizei); |
7146af97 | 756 | p->size = sizei; |
7146af97 JB |
757 | for (index = 0; index < sizei; index++) |
758 | p->contents[index] = init; | |
759 | ||
1825c68d | 760 | XSETVECTOR (vector, p); |
7146af97 JB |
761 | return vector; |
762 | } | |
763 | ||
a59de17b | 764 | DEFUN ("make-char-table", Fmake_char_table, Smake_char_table, 1, 2, 0, |
c58b2b4d | 765 | "Return a newly created char-table, with purpose PURPOSE.\n\ |
7b07587b | 766 | Each element is initialized to INIT, which defaults to nil.\n\ |
a59de17b RS |
767 | PURPOSE should be a symbol which has a `char-table-extra-slot' property.\n\ |
768 | The property's value should be an integer between 0 and 10.") | |
769 | (purpose, init) | |
770 | register Lisp_Object purpose, init; | |
7b07587b RS |
771 | { |
772 | Lisp_Object vector; | |
a59de17b RS |
773 | Lisp_Object n; |
774 | CHECK_SYMBOL (purpose, 1); | |
775 | n = Fget (purpose, Qchar_table_extra_slots); | |
776 | CHECK_NUMBER (n, 0); | |
7b07587b RS |
777 | if (XINT (n) < 0 || XINT (n) > 10) |
778 | args_out_of_range (n, Qnil); | |
779 | /* Add 2 to the size for the defalt and parent slots. */ | |
780 | vector = Fmake_vector (make_number (CHAR_TABLE_STANDARD_SLOTS + XINT (n)), | |
781 | init); | |
c96a008c | 782 | XCHAR_TABLE (vector)->parent = Qnil; |
a59de17b | 783 | XCHAR_TABLE (vector)->purpose = purpose; |
7b07587b RS |
784 | XSETCHAR_TABLE (vector, XCHAR_TABLE (vector)); |
785 | return vector; | |
786 | } | |
787 | ||
7146af97 JB |
788 | DEFUN ("vector", Fvector, Svector, 0, MANY, 0, |
789 | "Return a newly created vector with specified arguments as elements.\n\ | |
790 | Any number of arguments, even zero arguments, are allowed.") | |
791 | (nargs, args) | |
792 | register int nargs; | |
793 | Lisp_Object *args; | |
794 | { | |
795 | register Lisp_Object len, val; | |
796 | register int index; | |
797 | register struct Lisp_Vector *p; | |
798 | ||
67ba9986 | 799 | XSETFASTINT (len, nargs); |
7146af97 JB |
800 | val = Fmake_vector (len, Qnil); |
801 | p = XVECTOR (val); | |
802 | for (index = 0; index < nargs; index++) | |
803 | p->contents[index] = args[index]; | |
804 | return val; | |
805 | } | |
806 | ||
807 | DEFUN ("make-byte-code", Fmake_byte_code, Smake_byte_code, 4, MANY, 0, | |
808 | "Create a byte-code object with specified arguments as elements.\n\ | |
809 | The arguments should be the arglist, bytecode-string, constant vector,\n\ | |
810 | stack size, (optional) doc string, and (optional) interactive spec.\n\ | |
811 | The first four arguments are required; at most six have any\n\ | |
812 | significance.") | |
813 | (nargs, args) | |
814 | register int nargs; | |
815 | Lisp_Object *args; | |
816 | { | |
817 | register Lisp_Object len, val; | |
818 | register int index; | |
819 | register struct Lisp_Vector *p; | |
820 | ||
67ba9986 | 821 | XSETFASTINT (len, nargs); |
265a9e55 | 822 | if (!NILP (Vpurify_flag)) |
7146af97 JB |
823 | val = make_pure_vector (len); |
824 | else | |
825 | val = Fmake_vector (len, Qnil); | |
826 | p = XVECTOR (val); | |
827 | for (index = 0; index < nargs; index++) | |
828 | { | |
265a9e55 | 829 | if (!NILP (Vpurify_flag)) |
7146af97 JB |
830 | args[index] = Fpurecopy (args[index]); |
831 | p->contents[index] = args[index]; | |
832 | } | |
169ee243 | 833 | XSETCOMPILED (val, val); |
7146af97 JB |
834 | return val; |
835 | } | |
836 | \f | |
837 | /* Allocation of symbols. | |
838 | Just like allocation of conses! | |
839 | ||
840 | Each symbol_block is just under 1020 bytes long, | |
841 | since malloc really allocates in units of powers of two | |
842 | and uses 4 bytes for its own overhead. */ | |
843 | ||
844 | #define SYMBOL_BLOCK_SIZE \ | |
845 | ((1020 - sizeof (struct symbol_block *)) / sizeof (struct Lisp_Symbol)) | |
846 | ||
847 | struct symbol_block | |
848 | { | |
849 | struct symbol_block *next; | |
850 | struct Lisp_Symbol symbols[SYMBOL_BLOCK_SIZE]; | |
851 | }; | |
852 | ||
853 | struct symbol_block *symbol_block; | |
854 | int symbol_block_index; | |
855 | ||
856 | struct Lisp_Symbol *symbol_free_list; | |
857 | ||
858 | void | |
859 | init_symbol () | |
860 | { | |
3c06d205 | 861 | allocating_for_lisp = 1; |
7146af97 | 862 | symbol_block = (struct symbol_block *) malloc (sizeof (struct symbol_block)); |
3c06d205 | 863 | allocating_for_lisp = 0; |
7146af97 | 864 | symbol_block->next = 0; |
290c8f1e | 865 | bzero ((char *) symbol_block->symbols, sizeof symbol_block->symbols); |
7146af97 JB |
866 | symbol_block_index = 0; |
867 | symbol_free_list = 0; | |
868 | } | |
869 | ||
870 | DEFUN ("make-symbol", Fmake_symbol, Smake_symbol, 1, 1, 0, | |
871 | "Return a newly allocated uninterned symbol whose name is NAME.\n\ | |
872 | Its value and function definition are void, and its property list is nil.") | |
54ee42dd EN |
873 | (name) |
874 | Lisp_Object name; | |
7146af97 JB |
875 | { |
876 | register Lisp_Object val; | |
877 | register struct Lisp_Symbol *p; | |
878 | ||
54ee42dd | 879 | CHECK_STRING (name, 0); |
7146af97 JB |
880 | |
881 | if (symbol_free_list) | |
882 | { | |
45d12a89 | 883 | XSETSYMBOL (val, symbol_free_list); |
85481507 | 884 | symbol_free_list = *(struct Lisp_Symbol **)&symbol_free_list->value; |
7146af97 JB |
885 | } |
886 | else | |
887 | { | |
888 | if (symbol_block_index == SYMBOL_BLOCK_SIZE) | |
889 | { | |
3c06d205 KH |
890 | struct symbol_block *new; |
891 | allocating_for_lisp = 1; | |
892 | new = (struct symbol_block *) xmalloc (sizeof (struct symbol_block)); | |
893 | allocating_for_lisp = 0; | |
7146af97 JB |
894 | VALIDATE_LISP_STORAGE (new, sizeof *new); |
895 | new->next = symbol_block; | |
896 | symbol_block = new; | |
897 | symbol_block_index = 0; | |
898 | } | |
45d12a89 | 899 | XSETSYMBOL (val, &symbol_block->symbols[symbol_block_index++]); |
7146af97 JB |
900 | } |
901 | p = XSYMBOL (val); | |
636b7260 | 902 | p->name = XSTRING (name); |
7146af97 JB |
903 | p->plist = Qnil; |
904 | p->value = Qunbound; | |
905 | p->function = Qunbound; | |
906 | p->next = 0; | |
907 | consing_since_gc += sizeof (struct Lisp_Symbol); | |
310ea200 | 908 | symbols_consed++; |
7146af97 JB |
909 | return val; |
910 | } | |
911 | \f | |
a0a38eb7 | 912 | /* Allocation of markers and other objects that share that structure. |
7146af97 JB |
913 | Works like allocation of conses. */ |
914 | ||
915 | #define MARKER_BLOCK_SIZE \ | |
a0a38eb7 | 916 | ((1020 - sizeof (struct marker_block *)) / sizeof (union Lisp_Misc)) |
7146af97 JB |
917 | |
918 | struct marker_block | |
919 | { | |
920 | struct marker_block *next; | |
a0a38eb7 | 921 | union Lisp_Misc markers[MARKER_BLOCK_SIZE]; |
7146af97 JB |
922 | }; |
923 | ||
924 | struct marker_block *marker_block; | |
925 | int marker_block_index; | |
926 | ||
a0a38eb7 | 927 | union Lisp_Misc *marker_free_list; |
7146af97 JB |
928 | |
929 | void | |
930 | init_marker () | |
931 | { | |
3c06d205 | 932 | allocating_for_lisp = 1; |
7146af97 | 933 | marker_block = (struct marker_block *) malloc (sizeof (struct marker_block)); |
3c06d205 | 934 | allocating_for_lisp = 0; |
7146af97 | 935 | marker_block->next = 0; |
290c8f1e | 936 | bzero ((char *) marker_block->markers, sizeof marker_block->markers); |
7146af97 JB |
937 | marker_block_index = 0; |
938 | marker_free_list = 0; | |
939 | } | |
940 | ||
a0a38eb7 KH |
941 | /* Return a newly allocated Lisp_Misc object, with no substructure. */ |
942 | Lisp_Object | |
943 | allocate_misc () | |
7146af97 | 944 | { |
a0a38eb7 | 945 | Lisp_Object val; |
e065a56e | 946 | |
7146af97 JB |
947 | if (marker_free_list) |
948 | { | |
a0a38eb7 KH |
949 | XSETMISC (val, marker_free_list); |
950 | marker_free_list = marker_free_list->u_free.chain; | |
7146af97 JB |
951 | } |
952 | else | |
953 | { | |
954 | if (marker_block_index == MARKER_BLOCK_SIZE) | |
955 | { | |
3c06d205 KH |
956 | struct marker_block *new; |
957 | allocating_for_lisp = 1; | |
958 | new = (struct marker_block *) xmalloc (sizeof (struct marker_block)); | |
959 | allocating_for_lisp = 0; | |
7146af97 JB |
960 | VALIDATE_LISP_STORAGE (new, sizeof *new); |
961 | new->next = marker_block; | |
962 | marker_block = new; | |
963 | marker_block_index = 0; | |
964 | } | |
a0a38eb7 | 965 | XSETMISC (val, &marker_block->markers[marker_block_index++]); |
7146af97 | 966 | } |
a0a38eb7 | 967 | consing_since_gc += sizeof (union Lisp_Misc); |
310ea200 | 968 | misc_objects_consed++; |
a0a38eb7 KH |
969 | return val; |
970 | } | |
971 | ||
972 | DEFUN ("make-marker", Fmake_marker, Smake_marker, 0, 0, 0, | |
973 | "Return a newly allocated marker which does not point at any place.") | |
974 | () | |
975 | { | |
976 | register Lisp_Object val; | |
977 | register struct Lisp_Marker *p; | |
978 | ||
979 | val = allocate_misc (); | |
a5da44fe | 980 | XMISCTYPE (val) = Lisp_Misc_Marker; |
7146af97 JB |
981 | p = XMARKER (val); |
982 | p->buffer = 0; | |
983 | p->bufpos = 0; | |
984 | p->chain = Qnil; | |
6ef5c4bd | 985 | p->insertion_type = 0; |
7146af97 JB |
986 | return val; |
987 | } | |
988 | \f | |
989 | /* Allocation of strings */ | |
990 | ||
991 | /* Strings reside inside of string_blocks. The entire data of the string, | |
992 | both the size and the contents, live in part of the `chars' component of a string_block. | |
993 | The `pos' component is the index within `chars' of the first free byte. | |
994 | ||
995 | first_string_block points to the first string_block ever allocated. | |
996 | Each block points to the next one with its `next' field. | |
997 | The `prev' fields chain in reverse order. | |
998 | The last one allocated is the one currently being filled. | |
999 | current_string_block points to it. | |
1000 | ||
1001 | The string_blocks that hold individual large strings | |
1002 | go in a separate chain, started by large_string_blocks. */ | |
1003 | ||
1004 | ||
1005 | /* String blocks contain this many useful bytes. | |
1006 | 8188 is power of 2, minus 4 for malloc overhead. */ | |
1007 | #define STRING_BLOCK_SIZE (8188 - sizeof (struct string_block_head)) | |
1008 | ||
1009 | /* A string bigger than this gets its own specially-made string block | |
1010 | if it doesn't fit in the current one. */ | |
1011 | #define STRING_BLOCK_OUTSIZE 1024 | |
1012 | ||
1013 | struct string_block_head | |
1014 | { | |
1015 | struct string_block *next, *prev; | |
1016 | int pos; | |
1017 | }; | |
1018 | ||
1019 | struct string_block | |
1020 | { | |
1021 | struct string_block *next, *prev; | |
42607681 | 1022 | EMACS_INT pos; |
7146af97 JB |
1023 | char chars[STRING_BLOCK_SIZE]; |
1024 | }; | |
1025 | ||
1026 | /* This points to the string block we are now allocating strings. */ | |
1027 | ||
1028 | struct string_block *current_string_block; | |
1029 | ||
1030 | /* This points to the oldest string block, the one that starts the chain. */ | |
1031 | ||
1032 | struct string_block *first_string_block; | |
1033 | ||
1034 | /* Last string block in chain of those made for individual large strings. */ | |
1035 | ||
1036 | struct string_block *large_string_blocks; | |
1037 | ||
1038 | /* If SIZE is the length of a string, this returns how many bytes | |
1039 | the string occupies in a string_block (including padding). */ | |
1040 | ||
1041 | #define STRING_FULLSIZE(size) (((size) + sizeof (struct Lisp_String) + PAD) \ | |
1042 | & ~(PAD - 1)) | |
42607681 | 1043 | #define PAD (sizeof (EMACS_INT)) |
7146af97 JB |
1044 | |
1045 | #if 0 | |
1046 | #define STRING_FULLSIZE(SIZE) \ | |
42607681 | 1047 | (((SIZE) + 2 * sizeof (EMACS_INT)) & ~(sizeof (EMACS_INT) - 1)) |
7146af97 JB |
1048 | #endif |
1049 | ||
1050 | void | |
1051 | init_strings () | |
1052 | { | |
3c06d205 | 1053 | allocating_for_lisp = 1; |
7146af97 | 1054 | current_string_block = (struct string_block *) malloc (sizeof (struct string_block)); |
3c06d205 | 1055 | allocating_for_lisp = 0; |
7146af97 JB |
1056 | first_string_block = current_string_block; |
1057 | consing_since_gc += sizeof (struct string_block); | |
1058 | current_string_block->next = 0; | |
1059 | current_string_block->prev = 0; | |
1060 | current_string_block->pos = 0; | |
1061 | large_string_blocks = 0; | |
1062 | } | |
1063 | ||
1064 | DEFUN ("make-string", Fmake_string, Smake_string, 2, 2, 0, | |
1065 | "Return a newly created string of length LENGTH, with each element being INIT.\n\ | |
1066 | Both LENGTH and INIT must be numbers.") | |
1067 | (length, init) | |
1068 | Lisp_Object length, init; | |
1069 | { | |
1070 | register Lisp_Object val; | |
1071 | register unsigned char *p, *end, c; | |
1072 | ||
c9dad5ed | 1073 | CHECK_NATNUM (length, 0); |
7146af97 | 1074 | CHECK_NUMBER (init, 1); |
c9dad5ed | 1075 | val = make_uninit_string (XFASTINT (length)); |
7146af97 JB |
1076 | c = XINT (init); |
1077 | p = XSTRING (val)->data; | |
1078 | end = p + XSTRING (val)->size; | |
1079 | while (p != end) | |
1080 | *p++ = c; | |
1081 | *p = 0; | |
1082 | return val; | |
1083 | } | |
1084 | ||
7b07587b RS |
1085 | DEFUN ("make-bool-vector", Fmake_bool_vector, Smake_bool_vector, 2, 2, 0, |
1086 | "Return a newly created bitstring of length LENGTH, with INIT as each element.\n\ | |
1087 | Both LENGTH and INIT must be numbers. INIT matters only in whether it is t or nil.") | |
1088 | (length, init) | |
1089 | Lisp_Object length, init; | |
1090 | { | |
1091 | register Lisp_Object val; | |
1092 | struct Lisp_Bool_Vector *p; | |
1093 | int real_init, i; | |
1094 | int length_in_chars, length_in_elts, bits_per_value; | |
1095 | ||
1096 | CHECK_NATNUM (length, 0); | |
1097 | ||
68be917d | 1098 | bits_per_value = sizeof (EMACS_INT) * BITS_PER_CHAR; |
7b07587b RS |
1099 | |
1100 | length_in_elts = (XFASTINT (length) + bits_per_value - 1) / bits_per_value; | |
1101 | length_in_chars = length_in_elts * sizeof (EMACS_INT); | |
1102 | ||
1103 | val = Fmake_vector (make_number (length_in_elts), Qnil); | |
1104 | p = XBOOL_VECTOR (val); | |
1105 | /* Get rid of any bits that would cause confusion. */ | |
1106 | p->vector_size = 0; | |
1107 | XSETBOOL_VECTOR (val, p); | |
1108 | p->size = XFASTINT (length); | |
1109 | ||
1110 | real_init = (NILP (init) ? 0 : -1); | |
1111 | for (i = 0; i < length_in_chars ; i++) | |
1112 | p->data[i] = real_init; | |
1113 | ||
1114 | return val; | |
1115 | } | |
1116 | ||
7146af97 JB |
1117 | Lisp_Object |
1118 | make_string (contents, length) | |
1119 | char *contents; | |
1120 | int length; | |
1121 | { | |
1122 | register Lisp_Object val; | |
1123 | val = make_uninit_string (length); | |
1124 | bcopy (contents, XSTRING (val)->data, length); | |
1125 | return val; | |
1126 | } | |
1127 | ||
1128 | Lisp_Object | |
1129 | build_string (str) | |
1130 | char *str; | |
1131 | { | |
1132 | return make_string (str, strlen (str)); | |
1133 | } | |
1134 | ||
1135 | Lisp_Object | |
1136 | make_uninit_string (length) | |
1137 | int length; | |
1138 | { | |
1139 | register Lisp_Object val; | |
1140 | register int fullsize = STRING_FULLSIZE (length); | |
1141 | ||
1142 | if (length < 0) abort (); | |
1143 | ||
1144 | if (fullsize <= STRING_BLOCK_SIZE - current_string_block->pos) | |
1145 | /* This string can fit in the current string block */ | |
1146 | { | |
45d12a89 KH |
1147 | XSETSTRING (val, |
1148 | ((struct Lisp_String *) | |
1149 | (current_string_block->chars + current_string_block->pos))); | |
7146af97 JB |
1150 | current_string_block->pos += fullsize; |
1151 | } | |
1152 | else if (fullsize > STRING_BLOCK_OUTSIZE) | |
1153 | /* This string gets its own string block */ | |
1154 | { | |
3c06d205 KH |
1155 | register struct string_block *new; |
1156 | allocating_for_lisp = 1; | |
1157 | new = (struct string_block *) xmalloc (sizeof (struct string_block_head) + fullsize); | |
1158 | allocating_for_lisp = 0; | |
7146af97 | 1159 | VALIDATE_LISP_STORAGE (new, 0); |
7146af97 JB |
1160 | consing_since_gc += sizeof (struct string_block_head) + fullsize; |
1161 | new->pos = fullsize; | |
1162 | new->next = large_string_blocks; | |
1163 | large_string_blocks = new; | |
45d12a89 KH |
1164 | XSETSTRING (val, |
1165 | ((struct Lisp_String *) | |
1166 | ((struct string_block_head *)new + 1))); | |
7146af97 JB |
1167 | } |
1168 | else | |
1169 | /* Make a new current string block and start it off with this string */ | |
1170 | { | |
3c06d205 KH |
1171 | register struct string_block *new; |
1172 | allocating_for_lisp = 1; | |
1173 | new = (struct string_block *) xmalloc (sizeof (struct string_block)); | |
1174 | allocating_for_lisp = 0; | |
7146af97 JB |
1175 | VALIDATE_LISP_STORAGE (new, sizeof *new); |
1176 | consing_since_gc += sizeof (struct string_block); | |
1177 | current_string_block->next = new; | |
1178 | new->prev = current_string_block; | |
1179 | new->next = 0; | |
1180 | current_string_block = new; | |
1181 | new->pos = fullsize; | |
45d12a89 KH |
1182 | XSETSTRING (val, |
1183 | (struct Lisp_String *) current_string_block->chars); | |
7146af97 JB |
1184 | } |
1185 | ||
310ea200 | 1186 | string_chars_consed += fullsize; |
7146af97 JB |
1187 | XSTRING (val)->size = length; |
1188 | XSTRING (val)->data[length] = 0; | |
d5e35230 | 1189 | INITIALIZE_INTERVAL (XSTRING (val), NULL_INTERVAL); |
7146af97 JB |
1190 | |
1191 | return val; | |
1192 | } | |
1193 | ||
1194 | /* Return a newly created vector or string with specified arguments as | |
736471d1 RS |
1195 | elements. If all the arguments are characters that can fit |
1196 | in a string of events, make a string; otherwise, make a vector. | |
1197 | ||
1198 | Any number of arguments, even zero arguments, are allowed. */ | |
7146af97 JB |
1199 | |
1200 | Lisp_Object | |
736471d1 | 1201 | make_event_array (nargs, args) |
7146af97 JB |
1202 | register int nargs; |
1203 | Lisp_Object *args; | |
1204 | { | |
1205 | int i; | |
1206 | ||
1207 | for (i = 0; i < nargs; i++) | |
736471d1 | 1208 | /* The things that fit in a string |
c9ca4659 RS |
1209 | are characters that are in 0...127, |
1210 | after discarding the meta bit and all the bits above it. */ | |
e687453f | 1211 | if (!INTEGERP (args[i]) |
c9ca4659 | 1212 | || (XUINT (args[i]) & ~(-CHAR_META)) >= 0200) |
7146af97 JB |
1213 | return Fvector (nargs, args); |
1214 | ||
1215 | /* Since the loop exited, we know that all the things in it are | |
1216 | characters, so we can make a string. */ | |
1217 | { | |
c13ccad2 | 1218 | Lisp_Object result; |
7146af97 | 1219 | |
c13ccad2 | 1220 | result = Fmake_string (nargs, make_number (0)); |
7146af97 | 1221 | for (i = 0; i < nargs; i++) |
736471d1 RS |
1222 | { |
1223 | XSTRING (result)->data[i] = XINT (args[i]); | |
1224 | /* Move the meta bit to the right place for a string char. */ | |
1225 | if (XINT (args[i]) & CHAR_META) | |
1226 | XSTRING (result)->data[i] |= 0x80; | |
1227 | } | |
7146af97 JB |
1228 | |
1229 | return result; | |
1230 | } | |
1231 | } | |
1232 | \f | |
1a4f1e2c JB |
1233 | /* Pure storage management. */ |
1234 | ||
7146af97 JB |
1235 | /* Must get an error if pure storage is full, |
1236 | since if it cannot hold a large string | |
1237 | it may be able to hold conses that point to that string; | |
1238 | then the string is not protected from gc. */ | |
1239 | ||
1240 | Lisp_Object | |
1241 | make_pure_string (data, length) | |
1242 | char *data; | |
1243 | int length; | |
1244 | { | |
1245 | register Lisp_Object new; | |
42607681 | 1246 | register int size = sizeof (EMACS_INT) + INTERVAL_PTR_SIZE + length + 1; |
7146af97 JB |
1247 | |
1248 | if (pureptr + size > PURESIZE) | |
1249 | error ("Pure Lisp storage exhausted"); | |
45d12a89 | 1250 | XSETSTRING (new, PUREBEG + pureptr); |
7146af97 JB |
1251 | XSTRING (new)->size = length; |
1252 | bcopy (data, XSTRING (new)->data, length); | |
1253 | XSTRING (new)->data[length] = 0; | |
06c5fe00 RS |
1254 | |
1255 | /* We must give strings in pure storage some kind of interval. So we | |
1256 | give them a null one. */ | |
1257 | #if defined (USE_TEXT_PROPERTIES) | |
1258 | XSTRING (new)->intervals = NULL_INTERVAL; | |
1259 | #endif | |
42607681 RS |
1260 | pureptr += (size + sizeof (EMACS_INT) - 1) |
1261 | / sizeof (EMACS_INT) * sizeof (EMACS_INT); | |
7146af97 JB |
1262 | return new; |
1263 | } | |
1264 | ||
1265 | Lisp_Object | |
1266 | pure_cons (car, cdr) | |
1267 | Lisp_Object car, cdr; | |
1268 | { | |
1269 | register Lisp_Object new; | |
1270 | ||
1271 | if (pureptr + sizeof (struct Lisp_Cons) > PURESIZE) | |
1272 | error ("Pure Lisp storage exhausted"); | |
45d12a89 | 1273 | XSETCONS (new, PUREBEG + pureptr); |
7146af97 JB |
1274 | pureptr += sizeof (struct Lisp_Cons); |
1275 | XCONS (new)->car = Fpurecopy (car); | |
1276 | XCONS (new)->cdr = Fpurecopy (cdr); | |
1277 | return new; | |
1278 | } | |
1279 | ||
1280 | #ifdef LISP_FLOAT_TYPE | |
1281 | ||
1282 | Lisp_Object | |
1283 | make_pure_float (num) | |
1284 | double num; | |
1285 | { | |
1286 | register Lisp_Object new; | |
1287 | ||
6d19f28a JB |
1288 | /* Make sure that PUREBEG + pureptr is aligned on at least a sizeof |
1289 | (double) boundary. Some architectures (like the sparc) require | |
1290 | this, and I suspect that floats are rare enough that it's no | |
1291 | tragedy for those that do. */ | |
1292 | { | |
1293 | int alignment; | |
1294 | char *p = PUREBEG + pureptr; | |
1295 | ||
fe90ad97 JB |
1296 | #ifdef __GNUC__ |
1297 | #if __GNUC__ >= 2 | |
6d19f28a | 1298 | alignment = __alignof (struct Lisp_Float); |
fe90ad97 | 1299 | #else |
6d19f28a | 1300 | alignment = sizeof (struct Lisp_Float); |
fe90ad97 JB |
1301 | #endif |
1302 | #else | |
6d19f28a | 1303 | alignment = sizeof (struct Lisp_Float); |
fe90ad97 | 1304 | #endif |
6d19f28a JB |
1305 | p = (char *) (((unsigned long) p + alignment - 1) & - alignment); |
1306 | pureptr = p - PUREBEG; | |
1307 | } | |
1a4f1e2c | 1308 | |
7146af97 JB |
1309 | if (pureptr + sizeof (struct Lisp_Float) > PURESIZE) |
1310 | error ("Pure Lisp storage exhausted"); | |
45d12a89 | 1311 | XSETFLOAT (new, PUREBEG + pureptr); |
7146af97 JB |
1312 | pureptr += sizeof (struct Lisp_Float); |
1313 | XFLOAT (new)->data = num; | |
67ba9986 | 1314 | XSETFASTINT (XFLOAT (new)->type, 0); /* bug chasing -wsr */ |
7146af97 JB |
1315 | return new; |
1316 | } | |
1317 | ||
1318 | #endif /* LISP_FLOAT_TYPE */ | |
1319 | ||
1320 | Lisp_Object | |
1321 | make_pure_vector (len) | |
42607681 | 1322 | EMACS_INT len; |
7146af97 JB |
1323 | { |
1324 | register Lisp_Object new; | |
42607681 | 1325 | register EMACS_INT size = sizeof (struct Lisp_Vector) + (len - 1) * sizeof (Lisp_Object); |
7146af97 JB |
1326 | |
1327 | if (pureptr + size > PURESIZE) | |
1328 | error ("Pure Lisp storage exhausted"); | |
1329 | ||
45d12a89 | 1330 | XSETVECTOR (new, PUREBEG + pureptr); |
7146af97 JB |
1331 | pureptr += size; |
1332 | XVECTOR (new)->size = len; | |
1333 | return new; | |
1334 | } | |
1335 | ||
1336 | DEFUN ("purecopy", Fpurecopy, Spurecopy, 1, 1, 0, | |
1337 | "Make a copy of OBJECT in pure storage.\n\ | |
1338 | Recursively copies contents of vectors and cons cells.\n\ | |
1339 | Does not copy symbols.") | |
1340 | (obj) | |
1341 | register Lisp_Object obj; | |
1342 | { | |
265a9e55 | 1343 | if (NILP (Vpurify_flag)) |
7146af97 JB |
1344 | return obj; |
1345 | ||
1346 | if ((PNTR_COMPARISON_TYPE) XPNTR (obj) < (PNTR_COMPARISON_TYPE) ((char *) pure + PURESIZE) | |
1347 | && (PNTR_COMPARISON_TYPE) XPNTR (obj) >= (PNTR_COMPARISON_TYPE) pure) | |
1348 | return obj; | |
1349 | ||
d6dd74bb KH |
1350 | if (CONSP (obj)) |
1351 | return pure_cons (XCONS (obj)->car, XCONS (obj)->cdr); | |
7146af97 | 1352 | #ifdef LISP_FLOAT_TYPE |
d6dd74bb KH |
1353 | else if (FLOATP (obj)) |
1354 | return make_pure_float (XFLOAT (obj)->data); | |
7146af97 | 1355 | #endif /* LISP_FLOAT_TYPE */ |
d6dd74bb KH |
1356 | else if (STRINGP (obj)) |
1357 | return make_pure_string (XSTRING (obj)->data, XSTRING (obj)->size); | |
1358 | else if (COMPILEDP (obj) || VECTORP (obj)) | |
1359 | { | |
1360 | register struct Lisp_Vector *vec; | |
1361 | register int i, size; | |
1362 | ||
1363 | size = XVECTOR (obj)->size; | |
7d535c68 KH |
1364 | if (size & PSEUDOVECTOR_FLAG) |
1365 | size &= PSEUDOVECTOR_SIZE_MASK; | |
d6dd74bb KH |
1366 | vec = XVECTOR (make_pure_vector (size)); |
1367 | for (i = 0; i < size; i++) | |
1368 | vec->contents[i] = Fpurecopy (XVECTOR (obj)->contents[i]); | |
1369 | if (COMPILEDP (obj)) | |
1370 | XSETCOMPILED (obj, vec); | |
1371 | else | |
1372 | XSETVECTOR (obj, vec); | |
7146af97 JB |
1373 | return obj; |
1374 | } | |
d6dd74bb KH |
1375 | else if (MARKERP (obj)) |
1376 | error ("Attempt to copy a marker to pure storage"); | |
1377 | else | |
1378 | return obj; | |
7146af97 JB |
1379 | } |
1380 | \f | |
1381 | /* Recording what needs to be marked for gc. */ | |
1382 | ||
1383 | struct gcpro *gcprolist; | |
1384 | ||
4cb7d267 | 1385 | #define NSTATICS 768 |
7146af97 JB |
1386 | |
1387 | Lisp_Object *staticvec[NSTATICS] = {0}; | |
1388 | ||
1389 | int staticidx = 0; | |
1390 | ||
1391 | /* Put an entry in staticvec, pointing at the variable whose address is given */ | |
1392 | ||
1393 | void | |
1394 | staticpro (varaddress) | |
1395 | Lisp_Object *varaddress; | |
1396 | { | |
1397 | staticvec[staticidx++] = varaddress; | |
1398 | if (staticidx >= NSTATICS) | |
1399 | abort (); | |
1400 | } | |
1401 | ||
1402 | struct catchtag | |
1403 | { | |
1404 | Lisp_Object tag; | |
1405 | Lisp_Object val; | |
1406 | struct catchtag *next; | |
1407 | /* jmp_buf jmp; /* We don't need this for GC purposes */ | |
1408 | }; | |
1409 | ||
1410 | struct backtrace | |
1411 | { | |
1412 | struct backtrace *next; | |
1413 | Lisp_Object *function; | |
1414 | Lisp_Object *args; /* Points to vector of args. */ | |
1415 | int nargs; /* length of vector */ | |
1416 | /* if nargs is UNEVALLED, args points to slot holding list of unevalled args */ | |
1417 | char evalargs; | |
1418 | }; | |
7146af97 | 1419 | \f |
1a4f1e2c JB |
1420 | /* Garbage collection! */ |
1421 | ||
7146af97 JB |
1422 | int total_conses, total_markers, total_symbols, total_string_size, total_vector_size; |
1423 | int total_free_conses, total_free_markers, total_free_symbols; | |
1424 | #ifdef LISP_FLOAT_TYPE | |
1425 | int total_free_floats, total_floats; | |
1426 | #endif /* LISP_FLOAT_TYPE */ | |
1427 | ||
e8197642 RS |
1428 | /* Temporarily prevent garbage collection. */ |
1429 | ||
1430 | int | |
1431 | inhibit_garbage_collection () | |
1432 | { | |
1433 | int count = specpdl_ptr - specpdl; | |
26b926e1 | 1434 | Lisp_Object number; |
68be917d | 1435 | int nbits = min (VALBITS, BITS_PER_INT); |
e8197642 | 1436 | |
b580578b | 1437 | XSETINT (number, ((EMACS_INT) 1 << (nbits - 1)) - 1); |
26b926e1 RS |
1438 | |
1439 | specbind (Qgc_cons_threshold, number); | |
e8197642 RS |
1440 | |
1441 | return count; | |
1442 | } | |
1443 | ||
7146af97 JB |
1444 | DEFUN ("garbage-collect", Fgarbage_collect, Sgarbage_collect, 0, 0, "", |
1445 | "Reclaim storage for Lisp objects no longer needed.\n\ | |
1446 | Returns info on amount of space in use:\n\ | |
1447 | ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)\n\ | |
1448 | (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS\n\ | |
1449 | (USED-FLOATS . FREE-FLOATS))\n\ | |
1450 | Garbage collection happens automatically if you cons more than\n\ | |
1451 | `gc-cons-threshold' bytes of Lisp data since previous garbage collection.") | |
1452 | () | |
1453 | { | |
1454 | register struct gcpro *tail; | |
1455 | register struct specbinding *bind; | |
1456 | struct catchtag *catch; | |
1457 | struct handler *handler; | |
1458 | register struct backtrace *backlist; | |
1459 | register Lisp_Object tem; | |
1460 | char *omessage = echo_area_glyphs; | |
51056d11 | 1461 | int omessage_length = echo_area_glyphs_length; |
7146af97 JB |
1462 | char stack_top_variable; |
1463 | register int i; | |
1464 | ||
58595309 KH |
1465 | /* In case user calls debug_print during GC, |
1466 | don't let that cause a recursive GC. */ | |
1467 | consing_since_gc = 0; | |
1468 | ||
7146af97 JB |
1469 | /* Save a copy of the contents of the stack, for debugging. */ |
1470 | #if MAX_SAVE_STACK > 0 | |
265a9e55 | 1471 | if (NILP (Vpurify_flag)) |
7146af97 JB |
1472 | { |
1473 | i = &stack_top_variable - stack_bottom; | |
1474 | if (i < 0) i = -i; | |
1475 | if (i < MAX_SAVE_STACK) | |
1476 | { | |
1477 | if (stack_copy == 0) | |
9ac0d9e0 | 1478 | stack_copy = (char *) xmalloc (stack_copy_size = i); |
7146af97 | 1479 | else if (stack_copy_size < i) |
9ac0d9e0 | 1480 | stack_copy = (char *) xrealloc (stack_copy, (stack_copy_size = i)); |
7146af97 JB |
1481 | if (stack_copy) |
1482 | { | |
42607681 | 1483 | if ((EMACS_INT) (&stack_top_variable - stack_bottom) > 0) |
7146af97 JB |
1484 | bcopy (stack_bottom, stack_copy, i); |
1485 | else | |
1486 | bcopy (&stack_top_variable, stack_copy, i); | |
1487 | } | |
1488 | } | |
1489 | } | |
1490 | #endif /* MAX_SAVE_STACK > 0 */ | |
1491 | ||
1492 | if (!noninteractive) | |
691c4285 | 1493 | message1_nolog ("Garbage collecting..."); |
7146af97 JB |
1494 | |
1495 | /* Don't keep command history around forever */ | |
1496 | tem = Fnthcdr (make_number (30), Vcommand_history); | |
1497 | if (CONSP (tem)) | |
1498 | XCONS (tem)->cdr = Qnil; | |
ffd56f97 | 1499 | |
7146af97 JB |
1500 | /* Likewise for undo information. */ |
1501 | { | |
1502 | register struct buffer *nextb = all_buffers; | |
1503 | ||
1504 | while (nextb) | |
1505 | { | |
ffd56f97 JB |
1506 | /* If a buffer's undo list is Qt, that means that undo is |
1507 | turned off in that buffer. Calling truncate_undo_list on | |
1508 | Qt tends to return NULL, which effectively turns undo back on. | |
1509 | So don't call truncate_undo_list if undo_list is Qt. */ | |
1510 | if (! EQ (nextb->undo_list, Qt)) | |
1511 | nextb->undo_list | |
502b9b64 JB |
1512 | = truncate_undo_list (nextb->undo_list, undo_limit, |
1513 | undo_strong_limit); | |
7146af97 JB |
1514 | nextb = nextb->next; |
1515 | } | |
1516 | } | |
1517 | ||
1518 | gc_in_progress = 1; | |
1519 | ||
1520 | /* clear_marks (); */ | |
1521 | ||
1522 | /* In each "large string", set the MARKBIT of the size field. | |
1523 | That enables mark_object to recognize them. */ | |
1524 | { | |
1525 | register struct string_block *b; | |
1526 | for (b = large_string_blocks; b; b = b->next) | |
1527 | ((struct Lisp_String *)(&b->chars[0]))->size |= MARKBIT; | |
1528 | } | |
1529 | ||
1530 | /* Mark all the special slots that serve as the roots of accessibility. | |
1531 | ||
1532 | Usually the special slots to mark are contained in particular structures. | |
1533 | Then we know no slot is marked twice because the structures don't overlap. | |
1534 | In some cases, the structures point to the slots to be marked. | |
1535 | For these, we use MARKBIT to avoid double marking of the slot. */ | |
1536 | ||
1537 | for (i = 0; i < staticidx; i++) | |
1538 | mark_object (staticvec[i]); | |
1539 | for (tail = gcprolist; tail; tail = tail->next) | |
1540 | for (i = 0; i < tail->nvars; i++) | |
1541 | if (!XMARKBIT (tail->var[i])) | |
1542 | { | |
1543 | mark_object (&tail->var[i]); | |
1544 | XMARK (tail->var[i]); | |
1545 | } | |
1546 | for (bind = specpdl; bind != specpdl_ptr; bind++) | |
1547 | { | |
1548 | mark_object (&bind->symbol); | |
1549 | mark_object (&bind->old_value); | |
1550 | } | |
1551 | for (catch = catchlist; catch; catch = catch->next) | |
1552 | { | |
1553 | mark_object (&catch->tag); | |
1554 | mark_object (&catch->val); | |
1555 | } | |
1556 | for (handler = handlerlist; handler; handler = handler->next) | |
1557 | { | |
1558 | mark_object (&handler->handler); | |
1559 | mark_object (&handler->var); | |
1560 | } | |
1561 | for (backlist = backtrace_list; backlist; backlist = backlist->next) | |
1562 | { | |
1563 | if (!XMARKBIT (*backlist->function)) | |
1564 | { | |
1565 | mark_object (backlist->function); | |
1566 | XMARK (*backlist->function); | |
1567 | } | |
1568 | if (backlist->nargs == UNEVALLED || backlist->nargs == MANY) | |
1569 | i = 0; | |
1570 | else | |
1571 | i = backlist->nargs - 1; | |
1572 | for (; i >= 0; i--) | |
1573 | if (!XMARKBIT (backlist->args[i])) | |
1574 | { | |
1575 | mark_object (&backlist->args[i]); | |
1576 | XMARK (backlist->args[i]); | |
1577 | } | |
1578 | } | |
b875d3f7 | 1579 | mark_kboards (); |
7146af97 JB |
1580 | |
1581 | gc_sweep (); | |
1582 | ||
1583 | /* Clear the mark bits that we set in certain root slots. */ | |
1584 | ||
1585 | for (tail = gcprolist; tail; tail = tail->next) | |
1586 | for (i = 0; i < tail->nvars; i++) | |
1587 | XUNMARK (tail->var[i]); | |
1588 | for (backlist = backtrace_list; backlist; backlist = backlist->next) | |
1589 | { | |
1590 | XUNMARK (*backlist->function); | |
1591 | if (backlist->nargs == UNEVALLED || backlist->nargs == MANY) | |
1592 | i = 0; | |
1593 | else | |
1594 | i = backlist->nargs - 1; | |
1595 | for (; i >= 0; i--) | |
1596 | XUNMARK (backlist->args[i]); | |
1597 | } | |
1598 | XUNMARK (buffer_defaults.name); | |
1599 | XUNMARK (buffer_local_symbols.name); | |
1600 | ||
1601 | /* clear_marks (); */ | |
1602 | gc_in_progress = 0; | |
1603 | ||
1604 | consing_since_gc = 0; | |
1605 | if (gc_cons_threshold < 10000) | |
1606 | gc_cons_threshold = 10000; | |
1607 | ||
7d385b05 | 1608 | if (omessage || minibuf_level > 0) |
691c4285 | 1609 | message2_nolog (omessage, omessage_length); |
7146af97 | 1610 | else if (!noninteractive) |
691c4285 | 1611 | message1_nolog ("Garbage collecting...done"); |
7146af97 | 1612 | |
7146af97 JB |
1613 | return Fcons (Fcons (make_number (total_conses), |
1614 | make_number (total_free_conses)), | |
1615 | Fcons (Fcons (make_number (total_symbols), | |
1616 | make_number (total_free_symbols)), | |
1617 | Fcons (Fcons (make_number (total_markers), | |
1618 | make_number (total_free_markers)), | |
1619 | Fcons (make_number (total_string_size), | |
1620 | Fcons (make_number (total_vector_size), | |
1621 | ||
1622 | #ifdef LISP_FLOAT_TYPE | |
1623 | Fcons (Fcons (make_number (total_floats), | |
1624 | make_number (total_free_floats)), | |
1625 | Qnil) | |
1626 | #else /* not LISP_FLOAT_TYPE */ | |
1627 | Qnil | |
1628 | #endif /* not LISP_FLOAT_TYPE */ | |
1629 | ))))); | |
1630 | } | |
1631 | \f | |
1632 | #if 0 | |
1633 | static void | |
1634 | clear_marks () | |
1635 | { | |
1636 | /* Clear marks on all conses */ | |
1637 | { | |
1638 | register struct cons_block *cblk; | |
1639 | register int lim = cons_block_index; | |
1640 | ||
1641 | for (cblk = cons_block; cblk; cblk = cblk->next) | |
1642 | { | |
1643 | register int i; | |
1644 | for (i = 0; i < lim; i++) | |
1645 | XUNMARK (cblk->conses[i].car); | |
1646 | lim = CONS_BLOCK_SIZE; | |
1647 | } | |
1648 | } | |
1649 | /* Clear marks on all symbols */ | |
1650 | { | |
1651 | register struct symbol_block *sblk; | |
1652 | register int lim = symbol_block_index; | |
1653 | ||
1654 | for (sblk = symbol_block; sblk; sblk = sblk->next) | |
1655 | { | |
1656 | register int i; | |
1657 | for (i = 0; i < lim; i++) | |
1658 | { | |
1659 | XUNMARK (sblk->symbols[i].plist); | |
1660 | } | |
1661 | lim = SYMBOL_BLOCK_SIZE; | |
1662 | } | |
1663 | } | |
1664 | /* Clear marks on all markers */ | |
1665 | { | |
1666 | register struct marker_block *sblk; | |
1667 | register int lim = marker_block_index; | |
1668 | ||
1669 | for (sblk = marker_block; sblk; sblk = sblk->next) | |
1670 | { | |
1671 | register int i; | |
1672 | for (i = 0; i < lim; i++) | |
a5da44fe | 1673 | if (sblk->markers[i].u_marker.type == Lisp_Misc_Marker) |
a0a38eb7 | 1674 | XUNMARK (sblk->markers[i].u_marker.chain); |
7146af97 JB |
1675 | lim = MARKER_BLOCK_SIZE; |
1676 | } | |
1677 | } | |
1678 | /* Clear mark bits on all buffers */ | |
1679 | { | |
1680 | register struct buffer *nextb = all_buffers; | |
1681 | ||
1682 | while (nextb) | |
1683 | { | |
1684 | XUNMARK (nextb->name); | |
1685 | nextb = nextb->next; | |
1686 | } | |
1687 | } | |
1688 | } | |
1689 | #endif | |
1690 | \f | |
1a4f1e2c JB |
1691 | /* Mark reference to a Lisp_Object. |
1692 | If the object referred to has not been seen yet, recursively mark | |
1693 | all the references contained in it. | |
7146af97 | 1694 | |
eb8c3be9 | 1695 | If the object referenced is a short string, the referencing slot |
7146af97 JB |
1696 | is threaded into a chain of such slots, pointed to from |
1697 | the `size' field of the string. The actual string size | |
1698 | lives in the last slot in the chain. We recognize the end | |
1699 | because it is < (unsigned) STRING_BLOCK_SIZE. */ | |
1700 | ||
785cd37f RS |
1701 | #define LAST_MARKED_SIZE 500 |
1702 | Lisp_Object *last_marked[LAST_MARKED_SIZE]; | |
1703 | int last_marked_index; | |
1704 | ||
7146af97 | 1705 | static void |
436c5811 RS |
1706 | mark_object (argptr) |
1707 | Lisp_Object *argptr; | |
7146af97 | 1708 | { |
436c5811 | 1709 | Lisp_Object *objptr = argptr; |
7146af97 JB |
1710 | register Lisp_Object obj; |
1711 | ||
9149e743 | 1712 | loop: |
7146af97 | 1713 | obj = *objptr; |
9149e743 | 1714 | loop2: |
7146af97 JB |
1715 | XUNMARK (obj); |
1716 | ||
7146af97 JB |
1717 | if ((PNTR_COMPARISON_TYPE) XPNTR (obj) < (PNTR_COMPARISON_TYPE) ((char *) pure + PURESIZE) |
1718 | && (PNTR_COMPARISON_TYPE) XPNTR (obj) >= (PNTR_COMPARISON_TYPE) pure) | |
1719 | return; | |
1720 | ||
785cd37f RS |
1721 | last_marked[last_marked_index++] = objptr; |
1722 | if (last_marked_index == LAST_MARKED_SIZE) | |
1723 | last_marked_index = 0; | |
1724 | ||
0220c518 | 1725 | switch (SWITCH_ENUM_CAST (XGCTYPE (obj))) |
7146af97 JB |
1726 | { |
1727 | case Lisp_String: | |
1728 | { | |
1729 | register struct Lisp_String *ptr = XSTRING (obj); | |
1730 | ||
d5e35230 | 1731 | MARK_INTERVAL_TREE (ptr->intervals); |
7146af97 JB |
1732 | if (ptr->size & MARKBIT) |
1733 | /* A large string. Just set ARRAY_MARK_FLAG. */ | |
1734 | ptr->size |= ARRAY_MARK_FLAG; | |
1735 | else | |
1736 | { | |
1737 | /* A small string. Put this reference | |
1738 | into the chain of references to it. | |
1fb577f7 | 1739 | If the address includes MARKBIT, put that bit elsewhere |
7146af97 JB |
1740 | when we store OBJPTR into the size field. */ |
1741 | ||
1742 | if (XMARKBIT (*objptr)) | |
1743 | { | |
67ba9986 | 1744 | XSETFASTINT (*objptr, ptr->size); |
7146af97 JB |
1745 | XMARK (*objptr); |
1746 | } | |
1747 | else | |
67ba9986 | 1748 | XSETFASTINT (*objptr, ptr->size); |
155ffe9c RS |
1749 | |
1750 | if ((EMACS_INT) objptr & DONT_COPY_FLAG) | |
1751 | abort (); | |
1fb577f7 KH |
1752 | ptr->size = (EMACS_INT) objptr; |
1753 | if (ptr->size & MARKBIT) | |
1754 | ptr->size ^= MARKBIT | DONT_COPY_FLAG; | |
7146af97 JB |
1755 | } |
1756 | } | |
1757 | break; | |
1758 | ||
76437631 | 1759 | case Lisp_Vectorlike: |
30e3190a | 1760 | if (GC_BUFFERP (obj)) |
6b552283 KH |
1761 | { |
1762 | if (!XMARKBIT (XBUFFER (obj)->name)) | |
1763 | mark_buffer (obj); | |
1764 | } | |
30e3190a | 1765 | else if (GC_SUBRP (obj)) |
169ee243 RS |
1766 | break; |
1767 | else if (GC_COMPILEDP (obj)) | |
1768 | /* We could treat this just like a vector, but it is better | |
1769 | to save the COMPILED_CONSTANTS element for last and avoid recursion | |
1770 | there. */ | |
1771 | { | |
1772 | register struct Lisp_Vector *ptr = XVECTOR (obj); | |
1773 | register EMACS_INT size = ptr->size; | |
1774 | /* See comment above under Lisp_Vector. */ | |
1775 | struct Lisp_Vector *volatile ptr1 = ptr; | |
1776 | register int i; | |
1777 | ||
1778 | if (size & ARRAY_MARK_FLAG) | |
1779 | break; /* Already marked */ | |
1780 | ptr->size |= ARRAY_MARK_FLAG; /* Else mark it */ | |
76437631 | 1781 | size &= PSEUDOVECTOR_SIZE_MASK; |
169ee243 RS |
1782 | for (i = 0; i < size; i++) /* and then mark its elements */ |
1783 | { | |
1784 | if (i != COMPILED_CONSTANTS) | |
1785 | mark_object (&ptr1->contents[i]); | |
1786 | } | |
1787 | /* This cast should be unnecessary, but some Mips compiler complains | |
1788 | (MIPS-ABI + SysVR4, DC/OSx, etc). */ | |
1789 | objptr = (Lisp_Object *) &ptr1->contents[COMPILED_CONSTANTS]; | |
1790 | goto loop; | |
1791 | } | |
502b9b64 | 1792 | #ifdef MULTI_FRAME |
169ee243 RS |
1793 | else if (GC_FRAMEP (obj)) |
1794 | { | |
1795 | /* See comment above under Lisp_Vector for why this is volatile. */ | |
1796 | register struct frame *volatile ptr = XFRAME (obj); | |
1797 | register EMACS_INT size = ptr->size; | |
1798 | ||
1799 | if (size & ARRAY_MARK_FLAG) break; /* Already marked */ | |
1800 | ptr->size |= ARRAY_MARK_FLAG; /* Else mark it */ | |
1801 | ||
1802 | mark_object (&ptr->name); | |
894a9d16 | 1803 | mark_object (&ptr->icon_name); |
169ee243 RS |
1804 | mark_object (&ptr->focus_frame); |
1805 | mark_object (&ptr->selected_window); | |
1806 | mark_object (&ptr->minibuffer_window); | |
1807 | mark_object (&ptr->param_alist); | |
1808 | mark_object (&ptr->scroll_bars); | |
1809 | mark_object (&ptr->condemned_scroll_bars); | |
1810 | mark_object (&ptr->menu_bar_items); | |
1811 | mark_object (&ptr->face_alist); | |
1812 | mark_object (&ptr->menu_bar_vector); | |
1813 | mark_object (&ptr->buffer_predicate); | |
1814 | } | |
12740e58 | 1815 | #endif /* MULTI_FRAME */ |
7b07587b RS |
1816 | else if (GC_BOOL_VECTOR_P (obj)) |
1817 | ; | |
04ff9756 | 1818 | else |
169ee243 RS |
1819 | { |
1820 | register struct Lisp_Vector *ptr = XVECTOR (obj); | |
1821 | register EMACS_INT size = ptr->size; | |
1822 | /* The reason we use ptr1 is to avoid an apparent hardware bug | |
1823 | that happens occasionally on the FSF's HP 300s. | |
1824 | The bug is that a2 gets clobbered by recursive calls to mark_object. | |
1825 | The clobberage seems to happen during function entry, | |
1826 | perhaps in the moveml instruction. | |
1827 | Yes, this is a crock, but we have to do it. */ | |
1828 | struct Lisp_Vector *volatile ptr1 = ptr; | |
1829 | register int i; | |
1830 | ||
1831 | if (size & ARRAY_MARK_FLAG) break; /* Already marked */ | |
1832 | ptr->size |= ARRAY_MARK_FLAG; /* Else mark it */ | |
1833 | if (size & PSEUDOVECTOR_FLAG) | |
1834 | size &= PSEUDOVECTOR_SIZE_MASK; | |
1835 | for (i = 0; i < size; i++) /* and then mark its elements */ | |
1836 | mark_object (&ptr1->contents[i]); | |
1837 | } | |
1838 | break; | |
7146af97 | 1839 | |
7146af97 JB |
1840 | case Lisp_Symbol: |
1841 | { | |
41f54422 RS |
1842 | /* See comment above under Lisp_Vector for why this is volatile. */ |
1843 | register struct Lisp_Symbol *volatile ptr = XSYMBOL (obj); | |
7146af97 JB |
1844 | struct Lisp_Symbol *ptrx; |
1845 | ||
1846 | if (XMARKBIT (ptr->plist)) break; | |
1847 | XMARK (ptr->plist); | |
7146af97 JB |
1848 | mark_object ((Lisp_Object *) &ptr->value); |
1849 | mark_object (&ptr->function); | |
1850 | mark_object (&ptr->plist); | |
8aaa7c8a JB |
1851 | XSETTYPE (*(Lisp_Object *) &ptr->name, Lisp_String); |
1852 | mark_object (&ptr->name); | |
7146af97 JB |
1853 | ptr = ptr->next; |
1854 | if (ptr) | |
1855 | { | |
9149e743 KH |
1856 | /* For the benefit of the last_marked log. */ |
1857 | objptr = (Lisp_Object *)&XSYMBOL (obj)->next; | |
b0846f52 | 1858 | ptrx = ptr; /* Use of ptrx avoids compiler bug on Sun */ |
7146af97 | 1859 | XSETSYMBOL (obj, ptrx); |
9149e743 KH |
1860 | /* We can't goto loop here because *objptr doesn't contain an |
1861 | actual Lisp_Object with valid datatype field. */ | |
1862 | goto loop2; | |
7146af97 JB |
1863 | } |
1864 | } | |
1865 | break; | |
1866 | ||
a0a38eb7 | 1867 | case Lisp_Misc: |
a5da44fe | 1868 | switch (XMISCTYPE (obj)) |
a0a38eb7 KH |
1869 | { |
1870 | case Lisp_Misc_Marker: | |
1871 | XMARK (XMARKER (obj)->chain); | |
1872 | /* DO NOT mark thru the marker's chain. | |
1873 | The buffer's markers chain does not preserve markers from gc; | |
1874 | instead, markers are removed from the chain when freed by gc. */ | |
1875 | break; | |
1876 | ||
465edf35 KH |
1877 | case Lisp_Misc_Buffer_Local_Value: |
1878 | case Lisp_Misc_Some_Buffer_Local_Value: | |
1879 | { | |
1880 | register struct Lisp_Buffer_Local_Value *ptr | |
1881 | = XBUFFER_LOCAL_VALUE (obj); | |
1882 | if (XMARKBIT (ptr->car)) break; | |
1883 | XMARK (ptr->car); | |
1884 | /* If the cdr is nil, avoid recursion for the car. */ | |
1885 | if (EQ (ptr->cdr, Qnil)) | |
1886 | { | |
1887 | objptr = &ptr->car; | |
1888 | goto loop; | |
1889 | } | |
1890 | mark_object (&ptr->car); | |
1891 | /* See comment above under Lisp_Vector for why not use ptr here. */ | |
1892 | objptr = &XBUFFER_LOCAL_VALUE (obj)->cdr; | |
1893 | goto loop; | |
1894 | } | |
1895 | ||
c8616056 KH |
1896 | case Lisp_Misc_Intfwd: |
1897 | case Lisp_Misc_Boolfwd: | |
1898 | case Lisp_Misc_Objfwd: | |
1899 | case Lisp_Misc_Buffer_Objfwd: | |
b875d3f7 | 1900 | case Lisp_Misc_Kboard_Objfwd: |
c8616056 KH |
1901 | /* Don't bother with Lisp_Buffer_Objfwd, |
1902 | since all markable slots in current buffer marked anyway. */ | |
1903 | /* Don't need to do Lisp_Objfwd, since the places they point | |
1904 | are protected with staticpro. */ | |
1905 | break; | |
1906 | ||
e202fa34 KH |
1907 | case Lisp_Misc_Overlay: |
1908 | { | |
1909 | struct Lisp_Overlay *ptr = XOVERLAY (obj); | |
1910 | if (!XMARKBIT (ptr->plist)) | |
1911 | { | |
1912 | XMARK (ptr->plist); | |
1913 | mark_object (&ptr->start); | |
1914 | mark_object (&ptr->end); | |
1915 | objptr = &ptr->plist; | |
1916 | goto loop; | |
1917 | } | |
1918 | } | |
1919 | break; | |
1920 | ||
a0a38eb7 KH |
1921 | default: |
1922 | abort (); | |
1923 | } | |
7146af97 JB |
1924 | break; |
1925 | ||
1926 | case Lisp_Cons: | |
7146af97 JB |
1927 | { |
1928 | register struct Lisp_Cons *ptr = XCONS (obj); | |
1929 | if (XMARKBIT (ptr->car)) break; | |
1930 | XMARK (ptr->car); | |
c54ca951 RS |
1931 | /* If the cdr is nil, avoid recursion for the car. */ |
1932 | if (EQ (ptr->cdr, Qnil)) | |
1933 | { | |
1934 | objptr = &ptr->car; | |
c54ca951 RS |
1935 | goto loop; |
1936 | } | |
7146af97 | 1937 | mark_object (&ptr->car); |
41f54422 RS |
1938 | /* See comment above under Lisp_Vector for why not use ptr here. */ |
1939 | objptr = &XCONS (obj)->cdr; | |
7146af97 JB |
1940 | goto loop; |
1941 | } | |
1942 | ||
1943 | #ifdef LISP_FLOAT_TYPE | |
1944 | case Lisp_Float: | |
1945 | XMARK (XFLOAT (obj)->type); | |
1946 | break; | |
1947 | #endif /* LISP_FLOAT_TYPE */ | |
1948 | ||
7146af97 | 1949 | case Lisp_Int: |
7146af97 JB |
1950 | break; |
1951 | ||
1952 | default: | |
1953 | abort (); | |
1954 | } | |
1955 | } | |
1956 | ||
1957 | /* Mark the pointers in a buffer structure. */ | |
1958 | ||
1959 | static void | |
1960 | mark_buffer (buf) | |
1961 | Lisp_Object buf; | |
1962 | { | |
7146af97 JB |
1963 | register struct buffer *buffer = XBUFFER (buf); |
1964 | register Lisp_Object *ptr; | |
30e3190a | 1965 | Lisp_Object base_buffer; |
7146af97 JB |
1966 | |
1967 | /* This is the buffer's markbit */ | |
1968 | mark_object (&buffer->name); | |
1969 | XMARK (buffer->name); | |
1970 | ||
30e3190a | 1971 | MARK_INTERVAL_TREE (BUF_INTERVALS (buffer)); |
d5e35230 | 1972 | |
7146af97 JB |
1973 | #if 0 |
1974 | mark_object (buffer->syntax_table); | |
1975 | ||
1976 | /* Mark the various string-pointers in the buffer object. | |
1977 | Since the strings may be relocated, we must mark them | |
1978 | in their actual slots. So gc_sweep must convert each slot | |
1979 | back to an ordinary C pointer. */ | |
45d12a89 | 1980 | XSETSTRING (*(Lisp_Object *)&buffer->upcase_table, buffer->upcase_table); |
7146af97 | 1981 | mark_object ((Lisp_Object *)&buffer->upcase_table); |
45d12a89 | 1982 | XSETSTRING (*(Lisp_Object *)&buffer->downcase_table, buffer->downcase_table); |
7146af97 JB |
1983 | mark_object ((Lisp_Object *)&buffer->downcase_table); |
1984 | ||
45d12a89 | 1985 | XSETSTRING (*(Lisp_Object *)&buffer->sort_table, buffer->sort_table); |
7146af97 | 1986 | mark_object ((Lisp_Object *)&buffer->sort_table); |
45d12a89 | 1987 | XSETSTRING (*(Lisp_Object *)&buffer->folding_sort_table, buffer->folding_sort_table); |
7146af97 JB |
1988 | mark_object ((Lisp_Object *)&buffer->folding_sort_table); |
1989 | #endif | |
1990 | ||
1991 | for (ptr = &buffer->name + 1; | |
1992 | (char *)ptr < (char *)buffer + sizeof (struct buffer); | |
1993 | ptr++) | |
1994 | mark_object (ptr); | |
30e3190a RS |
1995 | |
1996 | /* If this is an indirect buffer, mark its base buffer. */ | |
6b552283 | 1997 | if (buffer->base_buffer && !XMARKBIT (buffer->base_buffer->name)) |
30e3190a RS |
1998 | { |
1999 | XSETBUFFER (base_buffer, buffer->base_buffer); | |
2000 | mark_buffer (base_buffer); | |
2001 | } | |
7146af97 | 2002 | } |
084b1a0c KH |
2003 | |
2004 | ||
b875d3f7 | 2005 | /* Mark the pointers in the kboard objects. */ |
084b1a0c KH |
2006 | |
2007 | static void | |
b875d3f7 | 2008 | mark_kboards () |
084b1a0c | 2009 | { |
b875d3f7 | 2010 | KBOARD *kb; |
b94daf1e | 2011 | Lisp_Object *p; |
b875d3f7 | 2012 | for (kb = all_kboards; kb; kb = kb->next_kboard) |
084b1a0c | 2013 | { |
b94daf1e KH |
2014 | if (kb->kbd_macro_buffer) |
2015 | for (p = kb->kbd_macro_buffer; p < kb->kbd_macro_ptr; p++) | |
2016 | mark_object (p); | |
9671abc2 | 2017 | mark_object (&kb->Vprefix_arg); |
b875d3f7 KH |
2018 | mark_object (&kb->kbd_queue); |
2019 | mark_object (&kb->Vlast_kbd_macro); | |
b94daf1e | 2020 | mark_object (&kb->Vsystem_key_alist); |
6d03a6fd | 2021 | mark_object (&kb->system_key_syms); |
084b1a0c KH |
2022 | } |
2023 | } | |
7146af97 | 2024 | \f |
1a4f1e2c | 2025 | /* Sweep: find all structures not marked, and free them. */ |
7146af97 JB |
2026 | |
2027 | static void | |
2028 | gc_sweep () | |
2029 | { | |
2030 | total_string_size = 0; | |
2031 | compact_strings (); | |
2032 | ||
2033 | /* Put all unmarked conses on free list */ | |
2034 | { | |
2035 | register struct cons_block *cblk; | |
2036 | register int lim = cons_block_index; | |
2037 | register int num_free = 0, num_used = 0; | |
2038 | ||
2039 | cons_free_list = 0; | |
2040 | ||
2041 | for (cblk = cons_block; cblk; cblk = cblk->next) | |
2042 | { | |
2043 | register int i; | |
2044 | for (i = 0; i < lim; i++) | |
2045 | if (!XMARKBIT (cblk->conses[i].car)) | |
2046 | { | |
7146af97 | 2047 | num_free++; |
85481507 | 2048 | *(struct Lisp_Cons **)&cblk->conses[i].car = cons_free_list; |
7146af97 JB |
2049 | cons_free_list = &cblk->conses[i]; |
2050 | } | |
2051 | else | |
2052 | { | |
2053 | num_used++; | |
2054 | XUNMARK (cblk->conses[i].car); | |
2055 | } | |
2056 | lim = CONS_BLOCK_SIZE; | |
2057 | } | |
2058 | total_conses = num_used; | |
2059 | total_free_conses = num_free; | |
2060 | } | |
2061 | ||
2062 | #ifdef LISP_FLOAT_TYPE | |
2063 | /* Put all unmarked floats on free list */ | |
2064 | { | |
2065 | register struct float_block *fblk; | |
2066 | register int lim = float_block_index; | |
2067 | register int num_free = 0, num_used = 0; | |
2068 | ||
2069 | float_free_list = 0; | |
2070 | ||
2071 | for (fblk = float_block; fblk; fblk = fblk->next) | |
2072 | { | |
2073 | register int i; | |
2074 | for (i = 0; i < lim; i++) | |
2075 | if (!XMARKBIT (fblk->floats[i].type)) | |
2076 | { | |
7146af97 | 2077 | num_free++; |
85481507 | 2078 | *(struct Lisp_Float **)&fblk->floats[i].type = float_free_list; |
7146af97 JB |
2079 | float_free_list = &fblk->floats[i]; |
2080 | } | |
2081 | else | |
2082 | { | |
2083 | num_used++; | |
2084 | XUNMARK (fblk->floats[i].type); | |
2085 | } | |
2086 | lim = FLOAT_BLOCK_SIZE; | |
2087 | } | |
2088 | total_floats = num_used; | |
2089 | total_free_floats = num_free; | |
2090 | } | |
2091 | #endif /* LISP_FLOAT_TYPE */ | |
2092 | ||
d5e35230 JA |
2093 | #ifdef USE_TEXT_PROPERTIES |
2094 | /* Put all unmarked intervals on free list */ | |
2095 | { | |
2096 | register struct interval_block *iblk; | |
2097 | register int lim = interval_block_index; | |
2098 | register int num_free = 0, num_used = 0; | |
2099 | ||
2100 | interval_free_list = 0; | |
2101 | ||
2102 | for (iblk = interval_block; iblk; iblk = iblk->next) | |
2103 | { | |
2104 | register int i; | |
2105 | ||
2106 | for (i = 0; i < lim; i++) | |
2107 | { | |
2108 | if (! XMARKBIT (iblk->intervals[i].plist)) | |
2109 | { | |
2110 | iblk->intervals[i].parent = interval_free_list; | |
2111 | interval_free_list = &iblk->intervals[i]; | |
2112 | num_free++; | |
2113 | } | |
2114 | else | |
2115 | { | |
2116 | num_used++; | |
2117 | XUNMARK (iblk->intervals[i].plist); | |
2118 | } | |
2119 | } | |
2120 | lim = INTERVAL_BLOCK_SIZE; | |
2121 | } | |
2122 | total_intervals = num_used; | |
2123 | total_free_intervals = num_free; | |
2124 | } | |
2125 | #endif /* USE_TEXT_PROPERTIES */ | |
2126 | ||
7146af97 JB |
2127 | /* Put all unmarked symbols on free list */ |
2128 | { | |
2129 | register struct symbol_block *sblk; | |
2130 | register int lim = symbol_block_index; | |
2131 | register int num_free = 0, num_used = 0; | |
2132 | ||
2133 | symbol_free_list = 0; | |
2134 | ||
2135 | for (sblk = symbol_block; sblk; sblk = sblk->next) | |
2136 | { | |
2137 | register int i; | |
2138 | for (i = 0; i < lim; i++) | |
2139 | if (!XMARKBIT (sblk->symbols[i].plist)) | |
2140 | { | |
85481507 | 2141 | *(struct Lisp_Symbol **)&sblk->symbols[i].value = symbol_free_list; |
7146af97 JB |
2142 | symbol_free_list = &sblk->symbols[i]; |
2143 | num_free++; | |
2144 | } | |
2145 | else | |
2146 | { | |
2147 | num_used++; | |
2148 | sblk->symbols[i].name | |
2149 | = XSTRING (*(Lisp_Object *) &sblk->symbols[i].name); | |
2150 | XUNMARK (sblk->symbols[i].plist); | |
2151 | } | |
2152 | lim = SYMBOL_BLOCK_SIZE; | |
2153 | } | |
2154 | total_symbols = num_used; | |
2155 | total_free_symbols = num_free; | |
2156 | } | |
2157 | ||
2158 | #ifndef standalone | |
2159 | /* Put all unmarked markers on free list. | |
8e6208c5 | 2160 | Unchain each one first from the buffer it points into, |
465edf35 | 2161 | but only if it's a real marker. */ |
7146af97 JB |
2162 | { |
2163 | register struct marker_block *mblk; | |
7146af97 JB |
2164 | register int lim = marker_block_index; |
2165 | register int num_free = 0, num_used = 0; | |
2166 | ||
2167 | marker_free_list = 0; | |
2168 | ||
2169 | for (mblk = marker_block; mblk; mblk = mblk->next) | |
2170 | { | |
2171 | register int i; | |
26b926e1 | 2172 | EMACS_INT already_free = -1; |
fa05e253 | 2173 | |
7146af97 | 2174 | for (i = 0; i < lim; i++) |
465edf35 KH |
2175 | { |
2176 | Lisp_Object *markword; | |
a5da44fe | 2177 | switch (mblk->markers[i].u_marker.type) |
465edf35 KH |
2178 | { |
2179 | case Lisp_Misc_Marker: | |
2180 | markword = &mblk->markers[i].u_marker.chain; | |
2181 | break; | |
2182 | case Lisp_Misc_Buffer_Local_Value: | |
2183 | case Lisp_Misc_Some_Buffer_Local_Value: | |
2184 | markword = &mblk->markers[i].u_buffer_local_value.car; | |
2185 | break; | |
e202fa34 KH |
2186 | case Lisp_Misc_Overlay: |
2187 | markword = &mblk->markers[i].u_overlay.plist; | |
2188 | break; | |
fa05e253 RS |
2189 | case Lisp_Misc_Free: |
2190 | /* If the object was already free, keep it | |
2191 | on the free list. */ | |
2192 | markword = &already_free; | |
2193 | break; | |
465edf35 KH |
2194 | default: |
2195 | markword = 0; | |
e202fa34 | 2196 | break; |
465edf35 KH |
2197 | } |
2198 | if (markword && !XMARKBIT (*markword)) | |
2199 | { | |
2200 | Lisp_Object tem; | |
a5da44fe | 2201 | if (mblk->markers[i].u_marker.type == Lisp_Misc_Marker) |
465edf35 KH |
2202 | { |
2203 | /* tem1 avoids Sun compiler bug */ | |
2204 | struct Lisp_Marker *tem1 = &mblk->markers[i].u_marker; | |
2205 | XSETMARKER (tem, tem1); | |
2206 | unchain_marker (tem); | |
2207 | } | |
fa05e253 RS |
2208 | /* Set the type of the freed object to Lisp_Misc_Free. |
2209 | We could leave the type alone, since nobody checks it, | |
465edf35 | 2210 | but this might catch bugs faster. */ |
a5da44fe | 2211 | mblk->markers[i].u_marker.type = Lisp_Misc_Free; |
465edf35 KH |
2212 | mblk->markers[i].u_free.chain = marker_free_list; |
2213 | marker_free_list = &mblk->markers[i]; | |
2214 | num_free++; | |
2215 | } | |
2216 | else | |
2217 | { | |
2218 | num_used++; | |
2219 | if (markword) | |
2220 | XUNMARK (*markword); | |
2221 | } | |
2222 | } | |
7146af97 JB |
2223 | lim = MARKER_BLOCK_SIZE; |
2224 | } | |
2225 | ||
2226 | total_markers = num_used; | |
2227 | total_free_markers = num_free; | |
2228 | } | |
2229 | ||
2230 | /* Free all unmarked buffers */ | |
2231 | { | |
2232 | register struct buffer *buffer = all_buffers, *prev = 0, *next; | |
2233 | ||
2234 | while (buffer) | |
2235 | if (!XMARKBIT (buffer->name)) | |
2236 | { | |
2237 | if (prev) | |
2238 | prev->next = buffer->next; | |
2239 | else | |
2240 | all_buffers = buffer->next; | |
2241 | next = buffer->next; | |
9ac0d9e0 | 2242 | xfree (buffer); |
7146af97 JB |
2243 | buffer = next; |
2244 | } | |
2245 | else | |
2246 | { | |
2247 | XUNMARK (buffer->name); | |
30e3190a | 2248 | UNMARK_BALANCE_INTERVALS (BUF_INTERVALS (buffer)); |
7146af97 JB |
2249 | |
2250 | #if 0 | |
2251 | /* Each `struct Lisp_String *' was turned into a Lisp_Object | |
2252 | for purposes of marking and relocation. | |
2253 | Turn them back into C pointers now. */ | |
2254 | buffer->upcase_table | |
2255 | = XSTRING (*(Lisp_Object *)&buffer->upcase_table); | |
2256 | buffer->downcase_table | |
2257 | = XSTRING (*(Lisp_Object *)&buffer->downcase_table); | |
2258 | buffer->sort_table | |
2259 | = XSTRING (*(Lisp_Object *)&buffer->sort_table); | |
2260 | buffer->folding_sort_table | |
2261 | = XSTRING (*(Lisp_Object *)&buffer->folding_sort_table); | |
2262 | #endif | |
2263 | ||
2264 | prev = buffer, buffer = buffer->next; | |
2265 | } | |
2266 | } | |
2267 | ||
2268 | #endif /* standalone */ | |
2269 | ||
2270 | /* Free all unmarked vectors */ | |
2271 | { | |
2272 | register struct Lisp_Vector *vector = all_vectors, *prev = 0, *next; | |
2273 | total_vector_size = 0; | |
2274 | ||
2275 | while (vector) | |
2276 | if (!(vector->size & ARRAY_MARK_FLAG)) | |
2277 | { | |
2278 | if (prev) | |
2279 | prev->next = vector->next; | |
2280 | else | |
2281 | all_vectors = vector->next; | |
2282 | next = vector->next; | |
9ac0d9e0 | 2283 | xfree (vector); |
7146af97 JB |
2284 | vector = next; |
2285 | } | |
2286 | else | |
2287 | { | |
2288 | vector->size &= ~ARRAY_MARK_FLAG; | |
fa05e253 RS |
2289 | if (vector->size & PSEUDOVECTOR_FLAG) |
2290 | total_vector_size += (PSEUDOVECTOR_SIZE_MASK & vector->size); | |
2291 | else | |
2292 | total_vector_size += vector->size; | |
7146af97 JB |
2293 | prev = vector, vector = vector->next; |
2294 | } | |
2295 | } | |
2296 | ||
2297 | /* Free all "large strings" not marked with ARRAY_MARK_FLAG. */ | |
2298 | { | |
2299 | register struct string_block *sb = large_string_blocks, *prev = 0, *next; | |
e8720644 | 2300 | struct Lisp_String *s; |
7146af97 JB |
2301 | |
2302 | while (sb) | |
e8720644 JB |
2303 | { |
2304 | s = (struct Lisp_String *) &sb->chars[0]; | |
2305 | if (s->size & ARRAY_MARK_FLAG) | |
2306 | { | |
2307 | ((struct Lisp_String *)(&sb->chars[0]))->size | |
1fb577f7 | 2308 | &= ~ARRAY_MARK_FLAG & ~MARKBIT; |
e8720644 JB |
2309 | UNMARK_BALANCE_INTERVALS (s->intervals); |
2310 | total_string_size += ((struct Lisp_String *)(&sb->chars[0]))->size; | |
2311 | prev = sb, sb = sb->next; | |
2312 | } | |
2313 | else | |
2314 | { | |
2315 | if (prev) | |
2316 | prev->next = sb->next; | |
2317 | else | |
2318 | large_string_blocks = sb->next; | |
2319 | next = sb->next; | |
2320 | xfree (sb); | |
2321 | sb = next; | |
2322 | } | |
2323 | } | |
7146af97 JB |
2324 | } |
2325 | } | |
2326 | \f | |
1a4f1e2c | 2327 | /* Compactify strings, relocate references, and free empty string blocks. */ |
7146af97 JB |
2328 | |
2329 | static void | |
2330 | compact_strings () | |
2331 | { | |
2332 | /* String block of old strings we are scanning. */ | |
2333 | register struct string_block *from_sb; | |
2334 | /* A preceding string block (or maybe the same one) | |
2335 | where we are copying the still-live strings to. */ | |
2336 | register struct string_block *to_sb; | |
2337 | int pos; | |
2338 | int to_pos; | |
2339 | ||
2340 | to_sb = first_string_block; | |
2341 | to_pos = 0; | |
2342 | ||
2343 | /* Scan each existing string block sequentially, string by string. */ | |
2344 | for (from_sb = first_string_block; from_sb; from_sb = from_sb->next) | |
2345 | { | |
2346 | pos = 0; | |
2347 | /* POS is the index of the next string in the block. */ | |
2348 | while (pos < from_sb->pos) | |
2349 | { | |
2350 | register struct Lisp_String *nextstr | |
2351 | = (struct Lisp_String *) &from_sb->chars[pos]; | |
2352 | ||
2353 | register struct Lisp_String *newaddr; | |
42607681 | 2354 | register EMACS_INT size = nextstr->size; |
7146af97 JB |
2355 | |
2356 | /* NEXTSTR is the old address of the next string. | |
2357 | Just skip it if it isn't marked. */ | |
155ffe9c | 2358 | if (((EMACS_UINT) size & ~DONT_COPY_FLAG) > STRING_BLOCK_SIZE) |
7146af97 JB |
2359 | { |
2360 | /* It is marked, so its size field is really a chain of refs. | |
2361 | Find the end of the chain, where the actual size lives. */ | |
155ffe9c | 2362 | while (((EMACS_UINT) size & ~DONT_COPY_FLAG) > STRING_BLOCK_SIZE) |
7146af97 | 2363 | { |
155ffe9c RS |
2364 | if (size & DONT_COPY_FLAG) |
2365 | size ^= MARKBIT | DONT_COPY_FLAG; | |
42607681 | 2366 | size = *(EMACS_INT *)size & ~MARKBIT; |
7146af97 JB |
2367 | } |
2368 | ||
2369 | total_string_size += size; | |
2370 | ||
2371 | /* If it won't fit in TO_SB, close it out, | |
2372 | and move to the next sb. Keep doing so until | |
2373 | TO_SB reaches a large enough, empty enough string block. | |
2374 | We know that TO_SB cannot advance past FROM_SB here | |
2375 | since FROM_SB is large enough to contain this string. | |
2376 | Any string blocks skipped here | |
2377 | will be patched out and freed later. */ | |
2378 | while (to_pos + STRING_FULLSIZE (size) | |
2379 | > max (to_sb->pos, STRING_BLOCK_SIZE)) | |
2380 | { | |
2381 | to_sb->pos = to_pos; | |
2382 | to_sb = to_sb->next; | |
2383 | to_pos = 0; | |
2384 | } | |
2385 | /* Compute new address of this string | |
2386 | and update TO_POS for the space being used. */ | |
2387 | newaddr = (struct Lisp_String *) &to_sb->chars[to_pos]; | |
2388 | to_pos += STRING_FULLSIZE (size); | |
2389 | ||
2390 | /* Copy the string itself to the new place. */ | |
2391 | if (nextstr != newaddr) | |
42607681 | 2392 | bcopy (nextstr, newaddr, size + 1 + sizeof (EMACS_INT) |
d5e35230 | 2393 | + INTERVAL_PTR_SIZE); |
7146af97 JB |
2394 | |
2395 | /* Go through NEXTSTR's chain of references | |
2396 | and make each slot in the chain point to | |
2397 | the new address of this string. */ | |
2398 | size = newaddr->size; | |
155ffe9c | 2399 | while (((EMACS_UINT) size & ~DONT_COPY_FLAG) > STRING_BLOCK_SIZE) |
7146af97 JB |
2400 | { |
2401 | register Lisp_Object *objptr; | |
155ffe9c RS |
2402 | if (size & DONT_COPY_FLAG) |
2403 | size ^= MARKBIT | DONT_COPY_FLAG; | |
7146af97 JB |
2404 | objptr = (Lisp_Object *)size; |
2405 | ||
2406 | size = XFASTINT (*objptr) & ~MARKBIT; | |
2407 | if (XMARKBIT (*objptr)) | |
2408 | { | |
45d12a89 | 2409 | XSETSTRING (*objptr, newaddr); |
7146af97 JB |
2410 | XMARK (*objptr); |
2411 | } | |
2412 | else | |
45d12a89 | 2413 | XSETSTRING (*objptr, newaddr); |
7146af97 JB |
2414 | } |
2415 | /* Store the actual size in the size field. */ | |
2416 | newaddr->size = size; | |
e8720644 | 2417 | |
5f60ed47 | 2418 | #ifdef USE_TEXT_PROPERTIES |
e8720644 JB |
2419 | /* Now that the string has been relocated, rebalance its |
2420 | interval tree, and update the tree's parent pointer. */ | |
2421 | if (! NULL_INTERVAL_P (newaddr->intervals)) | |
2422 | { | |
2423 | UNMARK_BALANCE_INTERVALS (newaddr->intervals); | |
45d12a89 KH |
2424 | XSETSTRING (* (Lisp_Object *) &newaddr->intervals->parent, |
2425 | newaddr); | |
e8720644 | 2426 | } |
5f60ed47 | 2427 | #endif /* USE_TEXT_PROPERTIES */ |
7146af97 JB |
2428 | } |
2429 | pos += STRING_FULLSIZE (size); | |
2430 | } | |
2431 | } | |
2432 | ||
2433 | /* Close out the last string block still used and free any that follow. */ | |
2434 | to_sb->pos = to_pos; | |
2435 | current_string_block = to_sb; | |
2436 | ||
2437 | from_sb = to_sb->next; | |
2438 | to_sb->next = 0; | |
2439 | while (from_sb) | |
2440 | { | |
2441 | to_sb = from_sb->next; | |
9ac0d9e0 | 2442 | xfree (from_sb); |
7146af97 JB |
2443 | from_sb = to_sb; |
2444 | } | |
2445 | ||
2446 | /* Free any empty string blocks further back in the chain. | |
2447 | This loop will never free first_string_block, but it is very | |
2448 | unlikely that that one will become empty, so why bother checking? */ | |
2449 | ||
2450 | from_sb = first_string_block; | |
2451 | while (to_sb = from_sb->next) | |
2452 | { | |
2453 | if (to_sb->pos == 0) | |
2454 | { | |
2455 | if (from_sb->next = to_sb->next) | |
2456 | from_sb->next->prev = from_sb; | |
9ac0d9e0 | 2457 | xfree (to_sb); |
7146af97 JB |
2458 | } |
2459 | else | |
2460 | from_sb = to_sb; | |
2461 | } | |
2462 | } | |
2463 | \f | |
20d24714 JB |
2464 | /* Debugging aids. */ |
2465 | ||
31ce1c91 | 2466 | DEFUN ("memory-limit", Fmemory_limit, Smemory_limit, 0, 0, 0, |
20d24714 JB |
2467 | "Return the address of the last byte Emacs has allocated, divided by 1024.\n\ |
2468 | This may be helpful in debugging Emacs's memory usage.\n\ | |
e41ae81f | 2469 | We divide the value by 1024 to make sure it fits in a Lisp integer.") |
20d24714 JB |
2470 | () |
2471 | { | |
2472 | Lisp_Object end; | |
2473 | ||
45d12a89 | 2474 | XSETINT (end, (EMACS_INT) sbrk (0) / 1024); |
20d24714 JB |
2475 | |
2476 | return end; | |
2477 | } | |
2478 | ||
310ea200 RS |
2479 | DEFUN ("memory-use-counts", Fmemory_use_counts, Smemory_use_counts, 0, 0, 0, |
2480 | "Return a list of counters that measure how much consing there has been.\n\ | |
2481 | Each of these counters increments for a certain kind of object.\n\ | |
2482 | The counters wrap around from the largest positive integer to zero.\n\ | |
2483 | Garbage collection does not decrease them.\n\ | |
2484 | The elements of the value are as follows:\n\ | |
2485 | (CONSES FLOATS VECTOR-CELLS SYMBOLS STRING-CHARS MISCS INTERVALS)\n\ | |
2486 | All are in units of 1 = one object consed\n\ | |
2487 | except for VECTOR-CELLS and STRING-CHARS, which count the total length of\n\ | |
2488 | objects consed.\n\ | |
2489 | MISCS include overlays, markers, and some internal types.\n\ | |
2490 | Frames, windows, buffers, and subprocesses count as vectors\n\ | |
2491 | (but the contents of a buffer's text do not count here).") | |
2492 | () | |
2493 | { | |
2494 | Lisp_Object lisp_cons_cells_consed; | |
2495 | Lisp_Object lisp_floats_consed; | |
2496 | Lisp_Object lisp_vector_cells_consed; | |
2497 | Lisp_Object lisp_symbols_consed; | |
2498 | Lisp_Object lisp_string_chars_consed; | |
2499 | Lisp_Object lisp_misc_objects_consed; | |
2500 | Lisp_Object lisp_intervals_consed; | |
2501 | ||
2502 | XSETINT (lisp_cons_cells_consed, | |
290c8f1e | 2503 | cons_cells_consed & ~(((EMACS_INT) 1) << (VALBITS - 1))); |
310ea200 | 2504 | XSETINT (lisp_floats_consed, |
290c8f1e | 2505 | floats_consed & ~(((EMACS_INT) 1) << (VALBITS - 1))); |
310ea200 | 2506 | XSETINT (lisp_vector_cells_consed, |
290c8f1e | 2507 | vector_cells_consed & ~(((EMACS_INT) 1) << (VALBITS - 1))); |
310ea200 | 2508 | XSETINT (lisp_symbols_consed, |
290c8f1e | 2509 | symbols_consed & ~(((EMACS_INT) 1) << (VALBITS - 1))); |
310ea200 | 2510 | XSETINT (lisp_string_chars_consed, |
290c8f1e | 2511 | string_chars_consed & ~(((EMACS_INT) 1) << (VALBITS - 1))); |
310ea200 | 2512 | XSETINT (lisp_misc_objects_consed, |
290c8f1e | 2513 | misc_objects_consed & ~(((EMACS_INT) 1) << (VALBITS - 1))); |
310ea200 | 2514 | XSETINT (lisp_intervals_consed, |
290c8f1e | 2515 | intervals_consed & ~(((EMACS_INT) 1) << (VALBITS - 1))); |
310ea200 RS |
2516 | |
2517 | return Fcons (lisp_cons_cells_consed, | |
2518 | Fcons (lisp_floats_consed, | |
2519 | Fcons (lisp_vector_cells_consed, | |
2520 | Fcons (lisp_symbols_consed, | |
2521 | Fcons (lisp_string_chars_consed, | |
2522 | Fcons (lisp_misc_objects_consed, | |
2523 | Fcons (lisp_intervals_consed, | |
2524 | Qnil))))))); | |
2525 | } | |
20d24714 | 2526 | \f |
7146af97 JB |
2527 | /* Initialization */ |
2528 | ||
2529 | init_alloc_once () | |
2530 | { | |
2531 | /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */ | |
2532 | pureptr = 0; | |
4c0be5f4 JB |
2533 | #ifdef HAVE_SHM |
2534 | pure_size = PURESIZE; | |
2535 | #endif | |
7146af97 JB |
2536 | all_vectors = 0; |
2537 | ignore_warnings = 1; | |
2538 | init_strings (); | |
2539 | init_cons (); | |
2540 | init_symbol (); | |
2541 | init_marker (); | |
2542 | #ifdef LISP_FLOAT_TYPE | |
2543 | init_float (); | |
2544 | #endif /* LISP_FLOAT_TYPE */ | |
d5e35230 JA |
2545 | INIT_INTERVALS; |
2546 | ||
276cbe5a RS |
2547 | #ifdef REL_ALLOC |
2548 | malloc_hysteresis = 32; | |
2549 | #else | |
2550 | malloc_hysteresis = 0; | |
2551 | #endif | |
2552 | ||
2553 | spare_memory = (char *) malloc (SPARE_MEMORY); | |
2554 | ||
7146af97 JB |
2555 | ignore_warnings = 0; |
2556 | gcprolist = 0; | |
2557 | staticidx = 0; | |
2558 | consing_since_gc = 0; | |
7d179cea | 2559 | gc_cons_threshold = 100000 * sizeof (Lisp_Object); |
7146af97 JB |
2560 | #ifdef VIRT_ADDR_VARIES |
2561 | malloc_sbrk_unused = 1<<22; /* A large number */ | |
2562 | malloc_sbrk_used = 100000; /* as reasonable as any number */ | |
2563 | #endif /* VIRT_ADDR_VARIES */ | |
2564 | } | |
2565 | ||
2566 | init_alloc () | |
2567 | { | |
2568 | gcprolist = 0; | |
2569 | } | |
2570 | ||
2571 | void | |
2572 | syms_of_alloc () | |
2573 | { | |
2574 | DEFVAR_INT ("gc-cons-threshold", &gc_cons_threshold, | |
2575 | "*Number of bytes of consing between garbage collections.\n\ | |
2576 | Garbage collection can happen automatically once this many bytes have been\n\ | |
2577 | allocated since the last garbage collection. All data types count.\n\n\ | |
2578 | Garbage collection happens automatically only when `eval' is called.\n\n\ | |
2579 | By binding this temporarily to a large number, you can effectively\n\ | |
2580 | prevent garbage collection during a part of the program."); | |
2581 | ||
2582 | DEFVAR_INT ("pure-bytes-used", &pureptr, | |
2583 | "Number of bytes of sharable Lisp data allocated so far."); | |
2584 | ||
2585 | #if 0 | |
2586 | DEFVAR_INT ("data-bytes-used", &malloc_sbrk_used, | |
2587 | "Number of bytes of unshared memory allocated in this session."); | |
2588 | ||
2589 | DEFVAR_INT ("data-bytes-free", &malloc_sbrk_unused, | |
2590 | "Number of bytes of unshared memory remaining available in this session."); | |
2591 | #endif | |
2592 | ||
2593 | DEFVAR_LISP ("purify-flag", &Vpurify_flag, | |
2594 | "Non-nil means loading Lisp code in order to dump an executable.\n\ | |
2595 | This means that certain objects should be allocated in shared (pure) space."); | |
2596 | ||
502b9b64 | 2597 | DEFVAR_INT ("undo-limit", &undo_limit, |
7146af97 | 2598 | "Keep no more undo information once it exceeds this size.\n\ |
502b9b64 | 2599 | This limit is applied when garbage collection happens.\n\ |
7146af97 JB |
2600 | The size is counted as the number of bytes occupied,\n\ |
2601 | which includes both saved text and other data."); | |
502b9b64 | 2602 | undo_limit = 20000; |
7146af97 | 2603 | |
502b9b64 | 2604 | DEFVAR_INT ("undo-strong-limit", &undo_strong_limit, |
7146af97 JB |
2605 | "Don't keep more than this much size of undo information.\n\ |
2606 | A command which pushes past this size is itself forgotten.\n\ | |
502b9b64 | 2607 | This limit is applied when garbage collection happens.\n\ |
7146af97 JB |
2608 | The size is counted as the number of bytes occupied,\n\ |
2609 | which includes both saved text and other data."); | |
502b9b64 | 2610 | undo_strong_limit = 30000; |
7146af97 | 2611 | |
bcb61d60 KH |
2612 | /* We build this in advance because if we wait until we need it, we might |
2613 | not be able to allocate the memory to hold it. */ | |
cf3540e4 | 2614 | memory_signal_data |
276cbe5a | 2615 | = Fcons (Qerror, Fcons (build_string ("Memory exhausted--use M-x save-some-buffers RET"), Qnil)); |
bcb61d60 KH |
2616 | staticpro (&memory_signal_data); |
2617 | ||
e8197642 RS |
2618 | staticpro (&Qgc_cons_threshold); |
2619 | Qgc_cons_threshold = intern ("gc-cons-threshold"); | |
2620 | ||
a59de17b RS |
2621 | staticpro (&Qchar_table_extra_slots); |
2622 | Qchar_table_extra_slots = intern ("char-table-extra-slots"); | |
2623 | ||
7146af97 JB |
2624 | defsubr (&Scons); |
2625 | defsubr (&Slist); | |
2626 | defsubr (&Svector); | |
2627 | defsubr (&Smake_byte_code); | |
2628 | defsubr (&Smake_list); | |
2629 | defsubr (&Smake_vector); | |
7b07587b | 2630 | defsubr (&Smake_char_table); |
7146af97 | 2631 | defsubr (&Smake_string); |
7b07587b | 2632 | defsubr (&Smake_bool_vector); |
7146af97 JB |
2633 | defsubr (&Smake_symbol); |
2634 | defsubr (&Smake_marker); | |
2635 | defsubr (&Spurecopy); | |
2636 | defsubr (&Sgarbage_collect); | |
20d24714 | 2637 | defsubr (&Smemory_limit); |
310ea200 | 2638 | defsubr (&Smemory_use_counts); |
7146af97 | 2639 | } |