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