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