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