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