Commit | Line | Data |
---|---|---|
7146af97 | 1 | /* Storage allocation and gc for GNU Emacs Lisp interpreter. |
c6c5df7f | 2 | Copyright (C) 1985, 1986, 1988, 1993 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; \ | |
45 | XSET (val, Lisp_Cons, (char *) address + size); \ | |
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 | |
80 | int pure[PURESIZE / sizeof (int)] = {0,}; /* Force it into data space! */ | |
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. */ | |
92 | 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 KH |
101 | /* Pre-computed signal argument for use when memory is exhausted. */ |
102 | static Lisp_Object memory_signal_data; | |
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 | { | |
438 | XFASTINT (ptr->type) = (int) float_free_list; | |
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 | { | |
450 | XSET (val, Lisp_Float, float_free_list); | |
451 | float_free_list = (struct Lisp_Float *) XFASTINT (float_free_list->type); | |
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 | } | |
463 | XSET (val, Lisp_Float, &float_block->floats[float_block_index++]); | |
464 | } | |
465 | XFLOAT (val)->data = float_value; | |
466 | XFLOAT (val)->type = 0; /* bug chasing -wsr */ | |
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 | { | |
511 | XFASTINT (ptr->car) = (int) cons_free_list; | |
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 | { | |
524 | XSET (val, Lisp_Cons, cons_free_list); | |
525 | cons_free_list = (struct Lisp_Cons *) XFASTINT (cons_free_list->car); | |
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 | } | |
537 | XSET (val, Lisp_Cons, &cons_block->conses[cons_block_index++]); | |
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 | ||
554 | XFASTINT (len) = nargs; | |
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 | ||
573 | if (XTYPE (length) != Lisp_Int || XINT (length) < 0) | |
574 | length = wrong_type_argument (Qnatnump, length); | |
575 | size = XINT (length); | |
576 | ||
577 | val = Qnil; | |
578 | while (size-- > 0) | |
579 | val = Fcons (init, val); | |
580 | return val; | |
581 | } | |
582 | \f | |
583 | /* Allocation of vectors */ | |
584 | ||
585 | struct Lisp_Vector *all_vectors; | |
586 | ||
587 | DEFUN ("make-vector", Fmake_vector, Smake_vector, 2, 2, 0, | |
588 | "Return a newly created vector of length LENGTH, with each element being INIT.\n\ | |
589 | See also the function `vector'.") | |
590 | (length, init) | |
591 | register Lisp_Object length, init; | |
592 | { | |
593 | register int sizei, index; | |
594 | register Lisp_Object vector; | |
595 | register struct Lisp_Vector *p; | |
596 | ||
597 | if (XTYPE (length) != Lisp_Int || XINT (length) < 0) | |
598 | length = wrong_type_argument (Qnatnump, length); | |
599 | sizei = XINT (length); | |
600 | ||
9ac0d9e0 | 601 | p = (struct Lisp_Vector *) xmalloc (sizeof (struct Lisp_Vector) + (sizei - 1) * sizeof (Lisp_Object)); |
7146af97 JB |
602 | VALIDATE_LISP_STORAGE (p, 0); |
603 | ||
604 | XSET (vector, Lisp_Vector, p); | |
605 | consing_since_gc += sizeof (struct Lisp_Vector) + (sizei - 1) * sizeof (Lisp_Object); | |
606 | ||
607 | p->size = sizei; | |
608 | p->next = all_vectors; | |
609 | all_vectors = p; | |
610 | ||
611 | for (index = 0; index < sizei; index++) | |
612 | p->contents[index] = init; | |
613 | ||
614 | return vector; | |
615 | } | |
616 | ||
617 | DEFUN ("vector", Fvector, Svector, 0, MANY, 0, | |
618 | "Return a newly created vector with specified arguments as elements.\n\ | |
619 | Any number of arguments, even zero arguments, are allowed.") | |
620 | (nargs, args) | |
621 | register int nargs; | |
622 | Lisp_Object *args; | |
623 | { | |
624 | register Lisp_Object len, val; | |
625 | register int index; | |
626 | register struct Lisp_Vector *p; | |
627 | ||
628 | XFASTINT (len) = nargs; | |
629 | val = Fmake_vector (len, Qnil); | |
630 | p = XVECTOR (val); | |
631 | for (index = 0; index < nargs; index++) | |
632 | p->contents[index] = args[index]; | |
633 | return val; | |
634 | } | |
635 | ||
636 | DEFUN ("make-byte-code", Fmake_byte_code, Smake_byte_code, 4, MANY, 0, | |
637 | "Create a byte-code object with specified arguments as elements.\n\ | |
638 | The arguments should be the arglist, bytecode-string, constant vector,\n\ | |
639 | stack size, (optional) doc string, and (optional) interactive spec.\n\ | |
640 | The first four arguments are required; at most six have any\n\ | |
641 | significance.") | |
642 | (nargs, args) | |
643 | register int nargs; | |
644 | Lisp_Object *args; | |
645 | { | |
646 | register Lisp_Object len, val; | |
647 | register int index; | |
648 | register struct Lisp_Vector *p; | |
649 | ||
650 | XFASTINT (len) = nargs; | |
265a9e55 | 651 | if (!NILP (Vpurify_flag)) |
7146af97 JB |
652 | val = make_pure_vector (len); |
653 | else | |
654 | val = Fmake_vector (len, Qnil); | |
655 | p = XVECTOR (val); | |
656 | for (index = 0; index < nargs; index++) | |
657 | { | |
265a9e55 | 658 | if (!NILP (Vpurify_flag)) |
7146af97 JB |
659 | args[index] = Fpurecopy (args[index]); |
660 | p->contents[index] = args[index]; | |
661 | } | |
662 | XSETTYPE (val, Lisp_Compiled); | |
663 | return val; | |
664 | } | |
665 | \f | |
666 | /* Allocation of symbols. | |
667 | Just like allocation of conses! | |
668 | ||
669 | Each symbol_block is just under 1020 bytes long, | |
670 | since malloc really allocates in units of powers of two | |
671 | and uses 4 bytes for its own overhead. */ | |
672 | ||
673 | #define SYMBOL_BLOCK_SIZE \ | |
674 | ((1020 - sizeof (struct symbol_block *)) / sizeof (struct Lisp_Symbol)) | |
675 | ||
676 | struct symbol_block | |
677 | { | |
678 | struct symbol_block *next; | |
679 | struct Lisp_Symbol symbols[SYMBOL_BLOCK_SIZE]; | |
680 | }; | |
681 | ||
682 | struct symbol_block *symbol_block; | |
683 | int symbol_block_index; | |
684 | ||
685 | struct Lisp_Symbol *symbol_free_list; | |
686 | ||
687 | void | |
688 | init_symbol () | |
689 | { | |
690 | symbol_block = (struct symbol_block *) malloc (sizeof (struct symbol_block)); | |
691 | symbol_block->next = 0; | |
692 | bzero (symbol_block->symbols, sizeof symbol_block->symbols); | |
693 | symbol_block_index = 0; | |
694 | symbol_free_list = 0; | |
695 | } | |
696 | ||
697 | DEFUN ("make-symbol", Fmake_symbol, Smake_symbol, 1, 1, 0, | |
698 | "Return a newly allocated uninterned symbol whose name is NAME.\n\ | |
699 | Its value and function definition are void, and its property list is nil.") | |
700 | (str) | |
701 | Lisp_Object str; | |
702 | { | |
703 | register Lisp_Object val; | |
704 | register struct Lisp_Symbol *p; | |
705 | ||
706 | CHECK_STRING (str, 0); | |
707 | ||
708 | if (symbol_free_list) | |
709 | { | |
710 | XSET (val, Lisp_Symbol, symbol_free_list); | |
711 | symbol_free_list | |
712 | = (struct Lisp_Symbol *) XFASTINT (symbol_free_list->value); | |
713 | } | |
714 | else | |
715 | { | |
716 | if (symbol_block_index == SYMBOL_BLOCK_SIZE) | |
717 | { | |
9ac0d9e0 | 718 | struct symbol_block *new = (struct symbol_block *) xmalloc (sizeof (struct symbol_block)); |
7146af97 JB |
719 | VALIDATE_LISP_STORAGE (new, sizeof *new); |
720 | new->next = symbol_block; | |
721 | symbol_block = new; | |
722 | symbol_block_index = 0; | |
723 | } | |
724 | XSET (val, Lisp_Symbol, &symbol_block->symbols[symbol_block_index++]); | |
725 | } | |
726 | p = XSYMBOL (val); | |
727 | p->name = XSTRING (str); | |
728 | p->plist = Qnil; | |
729 | p->value = Qunbound; | |
730 | p->function = Qunbound; | |
731 | p->next = 0; | |
732 | consing_since_gc += sizeof (struct Lisp_Symbol); | |
733 | return val; | |
734 | } | |
735 | \f | |
736 | /* Allocation of markers. | |
737 | Works like allocation of conses. */ | |
738 | ||
739 | #define MARKER_BLOCK_SIZE \ | |
740 | ((1020 - sizeof (struct marker_block *)) / sizeof (struct Lisp_Marker)) | |
741 | ||
742 | struct marker_block | |
743 | { | |
744 | struct marker_block *next; | |
745 | struct Lisp_Marker markers[MARKER_BLOCK_SIZE]; | |
746 | }; | |
747 | ||
748 | struct marker_block *marker_block; | |
749 | int marker_block_index; | |
750 | ||
751 | struct Lisp_Marker *marker_free_list; | |
752 | ||
753 | void | |
754 | init_marker () | |
755 | { | |
756 | marker_block = (struct marker_block *) malloc (sizeof (struct marker_block)); | |
757 | marker_block->next = 0; | |
758 | bzero (marker_block->markers, sizeof marker_block->markers); | |
759 | marker_block_index = 0; | |
760 | marker_free_list = 0; | |
761 | } | |
762 | ||
763 | DEFUN ("make-marker", Fmake_marker, Smake_marker, 0, 0, 0, | |
764 | "Return a newly allocated marker which does not point at any place.") | |
765 | () | |
766 | { | |
767 | register Lisp_Object val; | |
768 | register struct Lisp_Marker *p; | |
e065a56e | 769 | |
7146af97 JB |
770 | if (marker_free_list) |
771 | { | |
772 | XSET (val, Lisp_Marker, marker_free_list); | |
773 | marker_free_list | |
774 | = (struct Lisp_Marker *) XFASTINT (marker_free_list->chain); | |
775 | } | |
776 | else | |
777 | { | |
778 | if (marker_block_index == MARKER_BLOCK_SIZE) | |
779 | { | |
9ac0d9e0 | 780 | struct marker_block *new = (struct marker_block *) xmalloc (sizeof (struct marker_block)); |
7146af97 JB |
781 | VALIDATE_LISP_STORAGE (new, sizeof *new); |
782 | new->next = marker_block; | |
783 | marker_block = new; | |
784 | marker_block_index = 0; | |
785 | } | |
786 | XSET (val, Lisp_Marker, &marker_block->markers[marker_block_index++]); | |
787 | } | |
788 | p = XMARKER (val); | |
789 | p->buffer = 0; | |
790 | p->bufpos = 0; | |
791 | p->chain = Qnil; | |
792 | consing_since_gc += sizeof (struct Lisp_Marker); | |
793 | return val; | |
794 | } | |
795 | \f | |
796 | /* Allocation of strings */ | |
797 | ||
798 | /* Strings reside inside of string_blocks. The entire data of the string, | |
799 | both the size and the contents, live in part of the `chars' component of a string_block. | |
800 | The `pos' component is the index within `chars' of the first free byte. | |
801 | ||
802 | first_string_block points to the first string_block ever allocated. | |
803 | Each block points to the next one with its `next' field. | |
804 | The `prev' fields chain in reverse order. | |
805 | The last one allocated is the one currently being filled. | |
806 | current_string_block points to it. | |
807 | ||
808 | The string_blocks that hold individual large strings | |
809 | go in a separate chain, started by large_string_blocks. */ | |
810 | ||
811 | ||
812 | /* String blocks contain this many useful bytes. | |
813 | 8188 is power of 2, minus 4 for malloc overhead. */ | |
814 | #define STRING_BLOCK_SIZE (8188 - sizeof (struct string_block_head)) | |
815 | ||
816 | /* A string bigger than this gets its own specially-made string block | |
817 | if it doesn't fit in the current one. */ | |
818 | #define STRING_BLOCK_OUTSIZE 1024 | |
819 | ||
820 | struct string_block_head | |
821 | { | |
822 | struct string_block *next, *prev; | |
823 | int pos; | |
824 | }; | |
825 | ||
826 | struct string_block | |
827 | { | |
828 | struct string_block *next, *prev; | |
829 | int pos; | |
830 | char chars[STRING_BLOCK_SIZE]; | |
831 | }; | |
832 | ||
833 | /* This points to the string block we are now allocating strings. */ | |
834 | ||
835 | struct string_block *current_string_block; | |
836 | ||
837 | /* This points to the oldest string block, the one that starts the chain. */ | |
838 | ||
839 | struct string_block *first_string_block; | |
840 | ||
841 | /* Last string block in chain of those made for individual large strings. */ | |
842 | ||
843 | struct string_block *large_string_blocks; | |
844 | ||
845 | /* If SIZE is the length of a string, this returns how many bytes | |
846 | the string occupies in a string_block (including padding). */ | |
847 | ||
848 | #define STRING_FULLSIZE(size) (((size) + sizeof (struct Lisp_String) + PAD) \ | |
849 | & ~(PAD - 1)) | |
850 | #define PAD (sizeof (int)) | |
851 | ||
852 | #if 0 | |
853 | #define STRING_FULLSIZE(SIZE) \ | |
854 | (((SIZE) + 2 * sizeof (int)) & ~(sizeof (int) - 1)) | |
855 | #endif | |
856 | ||
857 | void | |
858 | init_strings () | |
859 | { | |
860 | current_string_block = (struct string_block *) malloc (sizeof (struct string_block)); | |
861 | first_string_block = current_string_block; | |
862 | consing_since_gc += sizeof (struct string_block); | |
863 | current_string_block->next = 0; | |
864 | current_string_block->prev = 0; | |
865 | current_string_block->pos = 0; | |
866 | large_string_blocks = 0; | |
867 | } | |
868 | ||
869 | DEFUN ("make-string", Fmake_string, Smake_string, 2, 2, 0, | |
870 | "Return a newly created string of length LENGTH, with each element being INIT.\n\ | |
871 | Both LENGTH and INIT must be numbers.") | |
872 | (length, init) | |
873 | Lisp_Object length, init; | |
874 | { | |
875 | register Lisp_Object val; | |
876 | register unsigned char *p, *end, c; | |
877 | ||
878 | if (XTYPE (length) != Lisp_Int || XINT (length) < 0) | |
879 | length = wrong_type_argument (Qnatnump, length); | |
880 | CHECK_NUMBER (init, 1); | |
881 | val = make_uninit_string (XINT (length)); | |
882 | c = XINT (init); | |
883 | p = XSTRING (val)->data; | |
884 | end = p + XSTRING (val)->size; | |
885 | while (p != end) | |
886 | *p++ = c; | |
887 | *p = 0; | |
888 | return val; | |
889 | } | |
890 | ||
891 | Lisp_Object | |
892 | make_string (contents, length) | |
893 | char *contents; | |
894 | int length; | |
895 | { | |
896 | register Lisp_Object val; | |
897 | val = make_uninit_string (length); | |
898 | bcopy (contents, XSTRING (val)->data, length); | |
899 | return val; | |
900 | } | |
901 | ||
902 | Lisp_Object | |
903 | build_string (str) | |
904 | char *str; | |
905 | { | |
906 | return make_string (str, strlen (str)); | |
907 | } | |
908 | ||
909 | Lisp_Object | |
910 | make_uninit_string (length) | |
911 | int length; | |
912 | { | |
913 | register Lisp_Object val; | |
914 | register int fullsize = STRING_FULLSIZE (length); | |
915 | ||
916 | if (length < 0) abort (); | |
917 | ||
918 | if (fullsize <= STRING_BLOCK_SIZE - current_string_block->pos) | |
919 | /* This string can fit in the current string block */ | |
920 | { | |
921 | XSET (val, Lisp_String, | |
922 | (struct Lisp_String *) (current_string_block->chars + current_string_block->pos)); | |
923 | current_string_block->pos += fullsize; | |
924 | } | |
925 | else if (fullsize > STRING_BLOCK_OUTSIZE) | |
926 | /* This string gets its own string block */ | |
927 | { | |
928 | register struct string_block *new | |
9ac0d9e0 | 929 | = (struct string_block *) xmalloc (sizeof (struct string_block_head) + fullsize); |
7146af97 | 930 | VALIDATE_LISP_STORAGE (new, 0); |
7146af97 JB |
931 | consing_since_gc += sizeof (struct string_block_head) + fullsize; |
932 | new->pos = fullsize; | |
933 | new->next = large_string_blocks; | |
934 | large_string_blocks = new; | |
935 | XSET (val, Lisp_String, | |
936 | (struct Lisp_String *) ((struct string_block_head *)new + 1)); | |
937 | } | |
938 | else | |
939 | /* Make a new current string block and start it off with this string */ | |
940 | { | |
941 | register struct string_block *new | |
9ac0d9e0 | 942 | = (struct string_block *) xmalloc (sizeof (struct string_block)); |
7146af97 JB |
943 | VALIDATE_LISP_STORAGE (new, sizeof *new); |
944 | consing_since_gc += sizeof (struct string_block); | |
945 | current_string_block->next = new; | |
946 | new->prev = current_string_block; | |
947 | new->next = 0; | |
948 | current_string_block = new; | |
949 | new->pos = fullsize; | |
950 | XSET (val, Lisp_String, | |
951 | (struct Lisp_String *) current_string_block->chars); | |
952 | } | |
953 | ||
954 | XSTRING (val)->size = length; | |
955 | XSTRING (val)->data[length] = 0; | |
d5e35230 | 956 | INITIALIZE_INTERVAL (XSTRING (val), NULL_INTERVAL); |
7146af97 JB |
957 | |
958 | return val; | |
959 | } | |
960 | ||
961 | /* Return a newly created vector or string with specified arguments as | |
736471d1 RS |
962 | elements. If all the arguments are characters that can fit |
963 | in a string of events, make a string; otherwise, make a vector. | |
964 | ||
965 | Any number of arguments, even zero arguments, are allowed. */ | |
7146af97 JB |
966 | |
967 | Lisp_Object | |
736471d1 | 968 | make_event_array (nargs, args) |
7146af97 JB |
969 | register int nargs; |
970 | Lisp_Object *args; | |
971 | { | |
972 | int i; | |
973 | ||
974 | for (i = 0; i < nargs; i++) | |
736471d1 | 975 | /* The things that fit in a string |
c9ca4659 RS |
976 | are characters that are in 0...127, |
977 | after discarding the meta bit and all the bits above it. */ | |
7146af97 | 978 | if (XTYPE (args[i]) != Lisp_Int |
c9ca4659 | 979 | || (XUINT (args[i]) & ~(-CHAR_META)) >= 0200) |
7146af97 JB |
980 | return Fvector (nargs, args); |
981 | ||
982 | /* Since the loop exited, we know that all the things in it are | |
983 | characters, so we can make a string. */ | |
984 | { | |
985 | Lisp_Object result = Fmake_string (nargs, make_number (0)); | |
986 | ||
987 | for (i = 0; i < nargs; i++) | |
736471d1 RS |
988 | { |
989 | XSTRING (result)->data[i] = XINT (args[i]); | |
990 | /* Move the meta bit to the right place for a string char. */ | |
991 | if (XINT (args[i]) & CHAR_META) | |
992 | XSTRING (result)->data[i] |= 0x80; | |
993 | } | |
7146af97 JB |
994 | |
995 | return result; | |
996 | } | |
997 | } | |
998 | \f | |
1a4f1e2c JB |
999 | /* Pure storage management. */ |
1000 | ||
7146af97 JB |
1001 | /* Must get an error if pure storage is full, |
1002 | since if it cannot hold a large string | |
1003 | it may be able to hold conses that point to that string; | |
1004 | then the string is not protected from gc. */ | |
1005 | ||
1006 | Lisp_Object | |
1007 | make_pure_string (data, length) | |
1008 | char *data; | |
1009 | int length; | |
1010 | { | |
1011 | register Lisp_Object new; | |
d5e35230 | 1012 | register int size = sizeof (int) + INTERVAL_PTR_SIZE + length + 1; |
7146af97 JB |
1013 | |
1014 | if (pureptr + size > PURESIZE) | |
1015 | error ("Pure Lisp storage exhausted"); | |
1016 | XSET (new, Lisp_String, PUREBEG + pureptr); | |
1017 | XSTRING (new)->size = length; | |
1018 | bcopy (data, XSTRING (new)->data, length); | |
1019 | XSTRING (new)->data[length] = 0; | |
06c5fe00 RS |
1020 | |
1021 | /* We must give strings in pure storage some kind of interval. So we | |
1022 | give them a null one. */ | |
1023 | #if defined (USE_TEXT_PROPERTIES) | |
1024 | XSTRING (new)->intervals = NULL_INTERVAL; | |
1025 | #endif | |
7146af97 JB |
1026 | pureptr += (size + sizeof (int) - 1) |
1027 | / sizeof (int) * sizeof (int); | |
1028 | return new; | |
1029 | } | |
1030 | ||
1031 | Lisp_Object | |
1032 | pure_cons (car, cdr) | |
1033 | Lisp_Object car, cdr; | |
1034 | { | |
1035 | register Lisp_Object new; | |
1036 | ||
1037 | if (pureptr + sizeof (struct Lisp_Cons) > PURESIZE) | |
1038 | error ("Pure Lisp storage exhausted"); | |
1039 | XSET (new, Lisp_Cons, PUREBEG + pureptr); | |
1040 | pureptr += sizeof (struct Lisp_Cons); | |
1041 | XCONS (new)->car = Fpurecopy (car); | |
1042 | XCONS (new)->cdr = Fpurecopy (cdr); | |
1043 | return new; | |
1044 | } | |
1045 | ||
1046 | #ifdef LISP_FLOAT_TYPE | |
1047 | ||
1048 | Lisp_Object | |
1049 | make_pure_float (num) | |
1050 | double num; | |
1051 | { | |
1052 | register Lisp_Object new; | |
1053 | ||
6d19f28a JB |
1054 | /* Make sure that PUREBEG + pureptr is aligned on at least a sizeof |
1055 | (double) boundary. Some architectures (like the sparc) require | |
1056 | this, and I suspect that floats are rare enough that it's no | |
1057 | tragedy for those that do. */ | |
1058 | { | |
1059 | int alignment; | |
1060 | char *p = PUREBEG + pureptr; | |
1061 | ||
fe90ad97 JB |
1062 | #ifdef __GNUC__ |
1063 | #if __GNUC__ >= 2 | |
6d19f28a | 1064 | alignment = __alignof (struct Lisp_Float); |
fe90ad97 | 1065 | #else |
6d19f28a | 1066 | alignment = sizeof (struct Lisp_Float); |
fe90ad97 JB |
1067 | #endif |
1068 | #else | |
6d19f28a | 1069 | alignment = sizeof (struct Lisp_Float); |
fe90ad97 | 1070 | #endif |
6d19f28a JB |
1071 | p = (char *) (((unsigned long) p + alignment - 1) & - alignment); |
1072 | pureptr = p - PUREBEG; | |
1073 | } | |
1a4f1e2c | 1074 | |
7146af97 JB |
1075 | if (pureptr + sizeof (struct Lisp_Float) > PURESIZE) |
1076 | error ("Pure Lisp storage exhausted"); | |
1077 | XSET (new, Lisp_Float, PUREBEG + pureptr); | |
1078 | pureptr += sizeof (struct Lisp_Float); | |
1079 | XFLOAT (new)->data = num; | |
1080 | XFLOAT (new)->type = 0; /* bug chasing -wsr */ | |
1081 | return new; | |
1082 | } | |
1083 | ||
1084 | #endif /* LISP_FLOAT_TYPE */ | |
1085 | ||
1086 | Lisp_Object | |
1087 | make_pure_vector (len) | |
1088 | int len; | |
1089 | { | |
1090 | register Lisp_Object new; | |
1091 | register int size = sizeof (struct Lisp_Vector) + (len - 1) * sizeof (Lisp_Object); | |
1092 | ||
1093 | if (pureptr + size > PURESIZE) | |
1094 | error ("Pure Lisp storage exhausted"); | |
1095 | ||
1096 | XSET (new, Lisp_Vector, PUREBEG + pureptr); | |
1097 | pureptr += size; | |
1098 | XVECTOR (new)->size = len; | |
1099 | return new; | |
1100 | } | |
1101 | ||
1102 | DEFUN ("purecopy", Fpurecopy, Spurecopy, 1, 1, 0, | |
1103 | "Make a copy of OBJECT in pure storage.\n\ | |
1104 | Recursively copies contents of vectors and cons cells.\n\ | |
1105 | Does not copy symbols.") | |
1106 | (obj) | |
1107 | register Lisp_Object obj; | |
1108 | { | |
1109 | register Lisp_Object new, tem; | |
1110 | register int i; | |
1111 | ||
265a9e55 | 1112 | if (NILP (Vpurify_flag)) |
7146af97 JB |
1113 | return obj; |
1114 | ||
1115 | if ((PNTR_COMPARISON_TYPE) XPNTR (obj) < (PNTR_COMPARISON_TYPE) ((char *) pure + PURESIZE) | |
1116 | && (PNTR_COMPARISON_TYPE) XPNTR (obj) >= (PNTR_COMPARISON_TYPE) pure) | |
1117 | return obj; | |
1118 | ||
1119 | #ifdef SWITCH_ENUM_BUG | |
1120 | switch ((int) XTYPE (obj)) | |
1121 | #else | |
1122 | switch (XTYPE (obj)) | |
1123 | #endif | |
1124 | { | |
1125 | case Lisp_Marker: | |
1126 | error ("Attempt to copy a marker to pure storage"); | |
1127 | ||
1128 | case Lisp_Cons: | |
1129 | return pure_cons (XCONS (obj)->car, XCONS (obj)->cdr); | |
1130 | ||
1131 | #ifdef LISP_FLOAT_TYPE | |
1132 | case Lisp_Float: | |
1133 | return make_pure_float (XFLOAT (obj)->data); | |
1134 | #endif /* LISP_FLOAT_TYPE */ | |
1135 | ||
1136 | case Lisp_String: | |
1137 | return make_pure_string (XSTRING (obj)->data, XSTRING (obj)->size); | |
1138 | ||
1139 | case Lisp_Compiled: | |
1140 | case Lisp_Vector: | |
1141 | new = make_pure_vector (XVECTOR (obj)->size); | |
1142 | for (i = 0; i < XVECTOR (obj)->size; i++) | |
1143 | { | |
1144 | tem = XVECTOR (obj)->contents[i]; | |
1145 | XVECTOR (new)->contents[i] = Fpurecopy (tem); | |
1146 | } | |
1147 | XSETTYPE (new, XTYPE (obj)); | |
1148 | return new; | |
1149 | ||
1150 | default: | |
1151 | return obj; | |
1152 | } | |
1153 | } | |
1154 | \f | |
1155 | /* Recording what needs to be marked for gc. */ | |
1156 | ||
1157 | struct gcpro *gcprolist; | |
1158 | ||
daa37602 | 1159 | #define NSTATICS 512 |
7146af97 JB |
1160 | |
1161 | Lisp_Object *staticvec[NSTATICS] = {0}; | |
1162 | ||
1163 | int staticidx = 0; | |
1164 | ||
1165 | /* Put an entry in staticvec, pointing at the variable whose address is given */ | |
1166 | ||
1167 | void | |
1168 | staticpro (varaddress) | |
1169 | Lisp_Object *varaddress; | |
1170 | { | |
1171 | staticvec[staticidx++] = varaddress; | |
1172 | if (staticidx >= NSTATICS) | |
1173 | abort (); | |
1174 | } | |
1175 | ||
1176 | struct catchtag | |
1177 | { | |
1178 | Lisp_Object tag; | |
1179 | Lisp_Object val; | |
1180 | struct catchtag *next; | |
1181 | /* jmp_buf jmp; /* We don't need this for GC purposes */ | |
1182 | }; | |
1183 | ||
1184 | struct backtrace | |
1185 | { | |
1186 | struct backtrace *next; | |
1187 | Lisp_Object *function; | |
1188 | Lisp_Object *args; /* Points to vector of args. */ | |
1189 | int nargs; /* length of vector */ | |
1190 | /* if nargs is UNEVALLED, args points to slot holding list of unevalled args */ | |
1191 | char evalargs; | |
1192 | }; | |
1193 | ||
1194 | /* Two flags that are set during GC in the `size' component | |
1195 | of a string or vector. On some machines, these flags | |
1196 | are defined by the m- file to be different bits. */ | |
1197 | ||
1198 | /* On vector, means it has been marked. | |
1199 | On string size field or a reference to a string, | |
1200 | means not the last reference in the chain. */ | |
1201 | ||
1202 | #ifndef ARRAY_MARK_FLAG | |
1203 | #define ARRAY_MARK_FLAG ((MARKBIT >> 1) & ~MARKBIT) | |
1204 | #endif /* no ARRAY_MARK_FLAG */ | |
1205 | ||
1206 | /* Any slot that is a Lisp_Object can point to a string | |
1207 | and thus can be put on a string's reference-chain | |
1208 | and thus may need to have its ARRAY_MARK_FLAG set. | |
1209 | This includes the slots whose markbits are used to mark | |
1210 | the containing objects. */ | |
1211 | ||
1212 | #if ARRAY_MARK_FLAG == MARKBIT | |
1213 | you lose | |
1214 | #endif | |
1215 | \f | |
1a4f1e2c JB |
1216 | /* Garbage collection! */ |
1217 | ||
7146af97 JB |
1218 | int total_conses, total_markers, total_symbols, total_string_size, total_vector_size; |
1219 | int total_free_conses, total_free_markers, total_free_symbols; | |
1220 | #ifdef LISP_FLOAT_TYPE | |
1221 | int total_free_floats, total_floats; | |
1222 | #endif /* LISP_FLOAT_TYPE */ | |
1223 | ||
7146af97 JB |
1224 | DEFUN ("garbage-collect", Fgarbage_collect, Sgarbage_collect, 0, 0, "", |
1225 | "Reclaim storage for Lisp objects no longer needed.\n\ | |
1226 | Returns info on amount of space in use:\n\ | |
1227 | ((USED-CONSES . FREE-CONSES) (USED-SYMS . FREE-SYMS)\n\ | |
1228 | (USED-MARKERS . FREE-MARKERS) USED-STRING-CHARS USED-VECTOR-SLOTS\n\ | |
1229 | (USED-FLOATS . FREE-FLOATS))\n\ | |
1230 | Garbage collection happens automatically if you cons more than\n\ | |
1231 | `gc-cons-threshold' bytes of Lisp data since previous garbage collection.") | |
1232 | () | |
1233 | { | |
1234 | register struct gcpro *tail; | |
1235 | register struct specbinding *bind; | |
1236 | struct catchtag *catch; | |
1237 | struct handler *handler; | |
1238 | register struct backtrace *backlist; | |
1239 | register Lisp_Object tem; | |
1240 | char *omessage = echo_area_glyphs; | |
51056d11 | 1241 | int omessage_length = echo_area_glyphs_length; |
7146af97 JB |
1242 | char stack_top_variable; |
1243 | register int i; | |
1244 | ||
7146af97 JB |
1245 | /* Save a copy of the contents of the stack, for debugging. */ |
1246 | #if MAX_SAVE_STACK > 0 | |
265a9e55 | 1247 | if (NILP (Vpurify_flag)) |
7146af97 JB |
1248 | { |
1249 | i = &stack_top_variable - stack_bottom; | |
1250 | if (i < 0) i = -i; | |
1251 | if (i < MAX_SAVE_STACK) | |
1252 | { | |
1253 | if (stack_copy == 0) | |
9ac0d9e0 | 1254 | stack_copy = (char *) xmalloc (stack_copy_size = i); |
7146af97 | 1255 | else if (stack_copy_size < i) |
9ac0d9e0 | 1256 | stack_copy = (char *) xrealloc (stack_copy, (stack_copy_size = i)); |
7146af97 JB |
1257 | if (stack_copy) |
1258 | { | |
1259 | if ((int) (&stack_top_variable - stack_bottom) > 0) | |
1260 | bcopy (stack_bottom, stack_copy, i); | |
1261 | else | |
1262 | bcopy (&stack_top_variable, stack_copy, i); | |
1263 | } | |
1264 | } | |
1265 | } | |
1266 | #endif /* MAX_SAVE_STACK > 0 */ | |
1267 | ||
1268 | if (!noninteractive) | |
1269 | message1 ("Garbage collecting..."); | |
1270 | ||
1271 | /* Don't keep command history around forever */ | |
1272 | tem = Fnthcdr (make_number (30), Vcommand_history); | |
1273 | if (CONSP (tem)) | |
1274 | XCONS (tem)->cdr = Qnil; | |
ffd56f97 | 1275 | |
7146af97 JB |
1276 | /* Likewise for undo information. */ |
1277 | { | |
1278 | register struct buffer *nextb = all_buffers; | |
1279 | ||
1280 | while (nextb) | |
1281 | { | |
ffd56f97 JB |
1282 | /* If a buffer's undo list is Qt, that means that undo is |
1283 | turned off in that buffer. Calling truncate_undo_list on | |
1284 | Qt tends to return NULL, which effectively turns undo back on. | |
1285 | So don't call truncate_undo_list if undo_list is Qt. */ | |
1286 | if (! EQ (nextb->undo_list, Qt)) | |
1287 | nextb->undo_list | |
502b9b64 JB |
1288 | = truncate_undo_list (nextb->undo_list, undo_limit, |
1289 | undo_strong_limit); | |
7146af97 JB |
1290 | nextb = nextb->next; |
1291 | } | |
1292 | } | |
1293 | ||
1294 | gc_in_progress = 1; | |
1295 | ||
1296 | /* clear_marks (); */ | |
1297 | ||
1298 | /* In each "large string", set the MARKBIT of the size field. | |
1299 | That enables mark_object to recognize them. */ | |
1300 | { | |
1301 | register struct string_block *b; | |
1302 | for (b = large_string_blocks; b; b = b->next) | |
1303 | ((struct Lisp_String *)(&b->chars[0]))->size |= MARKBIT; | |
1304 | } | |
1305 | ||
1306 | /* Mark all the special slots that serve as the roots of accessibility. | |
1307 | ||
1308 | Usually the special slots to mark are contained in particular structures. | |
1309 | Then we know no slot is marked twice because the structures don't overlap. | |
1310 | In some cases, the structures point to the slots to be marked. | |
1311 | For these, we use MARKBIT to avoid double marking of the slot. */ | |
1312 | ||
1313 | for (i = 0; i < staticidx; i++) | |
1314 | mark_object (staticvec[i]); | |
1315 | for (tail = gcprolist; tail; tail = tail->next) | |
1316 | for (i = 0; i < tail->nvars; i++) | |
1317 | if (!XMARKBIT (tail->var[i])) | |
1318 | { | |
1319 | mark_object (&tail->var[i]); | |
1320 | XMARK (tail->var[i]); | |
1321 | } | |
1322 | for (bind = specpdl; bind != specpdl_ptr; bind++) | |
1323 | { | |
1324 | mark_object (&bind->symbol); | |
1325 | mark_object (&bind->old_value); | |
1326 | } | |
1327 | for (catch = catchlist; catch; catch = catch->next) | |
1328 | { | |
1329 | mark_object (&catch->tag); | |
1330 | mark_object (&catch->val); | |
1331 | } | |
1332 | for (handler = handlerlist; handler; handler = handler->next) | |
1333 | { | |
1334 | mark_object (&handler->handler); | |
1335 | mark_object (&handler->var); | |
1336 | } | |
1337 | for (backlist = backtrace_list; backlist; backlist = backlist->next) | |
1338 | { | |
1339 | if (!XMARKBIT (*backlist->function)) | |
1340 | { | |
1341 | mark_object (backlist->function); | |
1342 | XMARK (*backlist->function); | |
1343 | } | |
1344 | if (backlist->nargs == UNEVALLED || backlist->nargs == MANY) | |
1345 | i = 0; | |
1346 | else | |
1347 | i = backlist->nargs - 1; | |
1348 | for (; i >= 0; i--) | |
1349 | if (!XMARKBIT (backlist->args[i])) | |
1350 | { | |
1351 | mark_object (&backlist->args[i]); | |
1352 | XMARK (backlist->args[i]); | |
1353 | } | |
1354 | } | |
1355 | ||
1356 | gc_sweep (); | |
1357 | ||
1358 | /* Clear the mark bits that we set in certain root slots. */ | |
1359 | ||
1360 | for (tail = gcprolist; tail; tail = tail->next) | |
1361 | for (i = 0; i < tail->nvars; i++) | |
1362 | XUNMARK (tail->var[i]); | |
1363 | for (backlist = backtrace_list; backlist; backlist = backlist->next) | |
1364 | { | |
1365 | XUNMARK (*backlist->function); | |
1366 | if (backlist->nargs == UNEVALLED || backlist->nargs == MANY) | |
1367 | i = 0; | |
1368 | else | |
1369 | i = backlist->nargs - 1; | |
1370 | for (; i >= 0; i--) | |
1371 | XUNMARK (backlist->args[i]); | |
1372 | } | |
1373 | XUNMARK (buffer_defaults.name); | |
1374 | XUNMARK (buffer_local_symbols.name); | |
1375 | ||
1376 | /* clear_marks (); */ | |
1377 | gc_in_progress = 0; | |
1378 | ||
1379 | consing_since_gc = 0; | |
1380 | if (gc_cons_threshold < 10000) | |
1381 | gc_cons_threshold = 10000; | |
1382 | ||
7d385b05 | 1383 | if (omessage || minibuf_level > 0) |
51056d11 | 1384 | message2 (omessage, omessage_length); |
7146af97 JB |
1385 | else if (!noninteractive) |
1386 | message1 ("Garbage collecting...done"); | |
1387 | ||
7146af97 JB |
1388 | return Fcons (Fcons (make_number (total_conses), |
1389 | make_number (total_free_conses)), | |
1390 | Fcons (Fcons (make_number (total_symbols), | |
1391 | make_number (total_free_symbols)), | |
1392 | Fcons (Fcons (make_number (total_markers), | |
1393 | make_number (total_free_markers)), | |
1394 | Fcons (make_number (total_string_size), | |
1395 | Fcons (make_number (total_vector_size), | |
1396 | ||
1397 | #ifdef LISP_FLOAT_TYPE | |
1398 | Fcons (Fcons (make_number (total_floats), | |
1399 | make_number (total_free_floats)), | |
1400 | Qnil) | |
1401 | #else /* not LISP_FLOAT_TYPE */ | |
1402 | Qnil | |
1403 | #endif /* not LISP_FLOAT_TYPE */ | |
1404 | ))))); | |
1405 | } | |
1406 | \f | |
1407 | #if 0 | |
1408 | static void | |
1409 | clear_marks () | |
1410 | { | |
1411 | /* Clear marks on all conses */ | |
1412 | { | |
1413 | register struct cons_block *cblk; | |
1414 | register int lim = cons_block_index; | |
1415 | ||
1416 | for (cblk = cons_block; cblk; cblk = cblk->next) | |
1417 | { | |
1418 | register int i; | |
1419 | for (i = 0; i < lim; i++) | |
1420 | XUNMARK (cblk->conses[i].car); | |
1421 | lim = CONS_BLOCK_SIZE; | |
1422 | } | |
1423 | } | |
1424 | /* Clear marks on all symbols */ | |
1425 | { | |
1426 | register struct symbol_block *sblk; | |
1427 | register int lim = symbol_block_index; | |
1428 | ||
1429 | for (sblk = symbol_block; sblk; sblk = sblk->next) | |
1430 | { | |
1431 | register int i; | |
1432 | for (i = 0; i < lim; i++) | |
1433 | { | |
1434 | XUNMARK (sblk->symbols[i].plist); | |
1435 | } | |
1436 | lim = SYMBOL_BLOCK_SIZE; | |
1437 | } | |
1438 | } | |
1439 | /* Clear marks on all markers */ | |
1440 | { | |
1441 | register struct marker_block *sblk; | |
1442 | register int lim = marker_block_index; | |
1443 | ||
1444 | for (sblk = marker_block; sblk; sblk = sblk->next) | |
1445 | { | |
1446 | register int i; | |
1447 | for (i = 0; i < lim; i++) | |
1448 | XUNMARK (sblk->markers[i].chain); | |
1449 | lim = MARKER_BLOCK_SIZE; | |
1450 | } | |
1451 | } | |
1452 | /* Clear mark bits on all buffers */ | |
1453 | { | |
1454 | register struct buffer *nextb = all_buffers; | |
1455 | ||
1456 | while (nextb) | |
1457 | { | |
1458 | XUNMARK (nextb->name); | |
1459 | nextb = nextb->next; | |
1460 | } | |
1461 | } | |
1462 | } | |
1463 | #endif | |
1464 | \f | |
1a4f1e2c JB |
1465 | /* Mark reference to a Lisp_Object. |
1466 | If the object referred to has not been seen yet, recursively mark | |
1467 | all the references contained in it. | |
7146af97 | 1468 | |
eb8c3be9 | 1469 | If the object referenced is a short string, the referencing slot |
7146af97 JB |
1470 | is threaded into a chain of such slots, pointed to from |
1471 | the `size' field of the string. The actual string size | |
1472 | lives in the last slot in the chain. We recognize the end | |
1473 | because it is < (unsigned) STRING_BLOCK_SIZE. */ | |
1474 | ||
785cd37f RS |
1475 | #define LAST_MARKED_SIZE 500 |
1476 | Lisp_Object *last_marked[LAST_MARKED_SIZE]; | |
1477 | int last_marked_index; | |
1478 | ||
7146af97 JB |
1479 | static void |
1480 | mark_object (objptr) | |
1481 | Lisp_Object *objptr; | |
1482 | { | |
1483 | register Lisp_Object obj; | |
1484 | ||
9149e743 | 1485 | loop: |
7146af97 | 1486 | obj = *objptr; |
9149e743 | 1487 | loop2: |
7146af97 JB |
1488 | XUNMARK (obj); |
1489 | ||
7146af97 JB |
1490 | if ((PNTR_COMPARISON_TYPE) XPNTR (obj) < (PNTR_COMPARISON_TYPE) ((char *) pure + PURESIZE) |
1491 | && (PNTR_COMPARISON_TYPE) XPNTR (obj) >= (PNTR_COMPARISON_TYPE) pure) | |
1492 | return; | |
1493 | ||
785cd37f RS |
1494 | last_marked[last_marked_index++] = objptr; |
1495 | if (last_marked_index == LAST_MARKED_SIZE) | |
1496 | last_marked_index = 0; | |
1497 | ||
7146af97 JB |
1498 | #ifdef SWITCH_ENUM_BUG |
1499 | switch ((int) XGCTYPE (obj)) | |
1500 | #else | |
1501 | switch (XGCTYPE (obj)) | |
1502 | #endif | |
1503 | { | |
1504 | case Lisp_String: | |
1505 | { | |
1506 | register struct Lisp_String *ptr = XSTRING (obj); | |
1507 | ||
d5e35230 | 1508 | MARK_INTERVAL_TREE (ptr->intervals); |
7146af97 JB |
1509 | if (ptr->size & MARKBIT) |
1510 | /* A large string. Just set ARRAY_MARK_FLAG. */ | |
1511 | ptr->size |= ARRAY_MARK_FLAG; | |
1512 | else | |
1513 | { | |
1514 | /* A small string. Put this reference | |
1515 | into the chain of references to it. | |
1516 | The address OBJPTR is even, so if the address | |
1517 | includes MARKBIT, put it in the low bit | |
1518 | when we store OBJPTR into the size field. */ | |
1519 | ||
1520 | if (XMARKBIT (*objptr)) | |
1521 | { | |
1522 | XFASTINT (*objptr) = ptr->size; | |
1523 | XMARK (*objptr); | |
1524 | } | |
1525 | else | |
1526 | XFASTINT (*objptr) = ptr->size; | |
1527 | if ((int)objptr & 1) abort (); | |
1528 | ptr->size = (int) objptr & ~MARKBIT; | |
1529 | if ((int) objptr & MARKBIT) | |
1530 | ptr->size ++; | |
1531 | } | |
1532 | } | |
1533 | break; | |
1534 | ||
1535 | case Lisp_Vector: | |
1536 | case Lisp_Window: | |
1537 | case Lisp_Process: | |
1538 | case Lisp_Window_Configuration: | |
7146af97 JB |
1539 | { |
1540 | register struct Lisp_Vector *ptr = XVECTOR (obj); | |
1541 | register int size = ptr->size; | |
41f54422 RS |
1542 | /* The reason we use ptr1 is to avoid an apparent hardware bug |
1543 | that happens occasionally on the FSF's HP 300s. | |
1544 | The bug is that a2 gets clobbered by recursive calls to mark_object. | |
1545 | The clobberage seems to happen during function entry, | |
1546 | perhaps in the moveml instruction. | |
1547 | Yes, this is a crock, but we have to do it. */ | |
785cd37f | 1548 | struct Lisp_Vector *volatile ptr1 = ptr; |
7146af97 JB |
1549 | register int i; |
1550 | ||
1551 | if (size & ARRAY_MARK_FLAG) break; /* Already marked */ | |
1552 | ptr->size |= ARRAY_MARK_FLAG; /* Else mark it */ | |
1553 | for (i = 0; i < size; i++) /* and then mark its elements */ | |
41f54422 | 1554 | mark_object (&ptr1->contents[i]); |
7146af97 JB |
1555 | } |
1556 | break; | |
1557 | ||
c54ca951 RS |
1558 | case Lisp_Compiled: |
1559 | /* We could treat this just like a vector, but it is better | |
1560 | to save the COMPILED_CONSTANTS element for last and avoid recursion | |
1561 | there. */ | |
1562 | { | |
1563 | register struct Lisp_Vector *ptr = XVECTOR (obj); | |
1564 | register int size = ptr->size; | |
41f54422 | 1565 | /* See comment above under Lisp_Vector. */ |
c54ca951 RS |
1566 | struct Lisp_Vector *volatile ptr1 = ptr; |
1567 | register int i; | |
1568 | ||
1569 | if (size & ARRAY_MARK_FLAG) break; /* Already marked */ | |
1570 | ptr->size |= ARRAY_MARK_FLAG; /* Else mark it */ | |
1571 | for (i = 0; i < size; i++) /* and then mark its elements */ | |
1572 | { | |
c54ca951 | 1573 | if (i != COMPILED_CONSTANTS) |
41f54422 | 1574 | mark_object (&ptr1->contents[i]); |
c54ca951 | 1575 | } |
41f54422 | 1576 | objptr = &ptr1->contents[COMPILED_CONSTANTS]; |
c54ca951 RS |
1577 | goto loop; |
1578 | } | |
1579 | ||
502b9b64 JB |
1580 | #ifdef MULTI_FRAME |
1581 | case Lisp_Frame: | |
7146af97 | 1582 | { |
41f54422 RS |
1583 | /* See comment above under Lisp_Vector for why this is volatile. */ |
1584 | register struct frame *volatile ptr = XFRAME (obj); | |
7146af97 | 1585 | register int size = ptr->size; |
7146af97 JB |
1586 | |
1587 | if (size & ARRAY_MARK_FLAG) break; /* Already marked */ | |
1588 | ptr->size |= ARRAY_MARK_FLAG; /* Else mark it */ | |
1589 | ||
1590 | mark_object (&ptr->name); | |
502b9b64 | 1591 | mark_object (&ptr->focus_frame); |
7146af97 JB |
1592 | mark_object (&ptr->width); |
1593 | mark_object (&ptr->height); | |
1594 | mark_object (&ptr->selected_window); | |
1595 | mark_object (&ptr->minibuffer_window); | |
1596 | mark_object (&ptr->param_alist); | |
a3c87d4e JB |
1597 | mark_object (&ptr->scroll_bars); |
1598 | mark_object (&ptr->condemned_scroll_bars); | |
9e8a7331 | 1599 | mark_object (&ptr->menu_bar_items); |
48dfbc2f | 1600 | mark_object (&ptr->face_alist); |
7146af97 JB |
1601 | } |
1602 | break; | |
12740e58 | 1603 | #endif /* MULTI_FRAME */ |
7146af97 | 1604 | |
7146af97 JB |
1605 | case Lisp_Symbol: |
1606 | { | |
41f54422 RS |
1607 | /* See comment above under Lisp_Vector for why this is volatile. */ |
1608 | register struct Lisp_Symbol *volatile ptr = XSYMBOL (obj); | |
7146af97 JB |
1609 | struct Lisp_Symbol *ptrx; |
1610 | ||
1611 | if (XMARKBIT (ptr->plist)) break; | |
1612 | XMARK (ptr->plist); | |
7146af97 JB |
1613 | mark_object ((Lisp_Object *) &ptr->value); |
1614 | mark_object (&ptr->function); | |
1615 | mark_object (&ptr->plist); | |
8aaa7c8a JB |
1616 | XSETTYPE (*(Lisp_Object *) &ptr->name, Lisp_String); |
1617 | mark_object (&ptr->name); | |
7146af97 JB |
1618 | ptr = ptr->next; |
1619 | if (ptr) | |
1620 | { | |
9149e743 KH |
1621 | /* For the benefit of the last_marked log. */ |
1622 | objptr = (Lisp_Object *)&XSYMBOL (obj)->next; | |
b0846f52 | 1623 | ptrx = ptr; /* Use of ptrx avoids compiler bug on Sun */ |
7146af97 | 1624 | XSETSYMBOL (obj, ptrx); |
9149e743 KH |
1625 | /* We can't goto loop here because *objptr doesn't contain an |
1626 | actual Lisp_Object with valid datatype field. */ | |
1627 | goto loop2; | |
7146af97 JB |
1628 | } |
1629 | } | |
1630 | break; | |
1631 | ||
1632 | case Lisp_Marker: | |
1633 | XMARK (XMARKER (obj)->chain); | |
1634 | /* DO NOT mark thru the marker's chain. | |
1635 | The buffer's markers chain does not preserve markers from gc; | |
c54ca951 | 1636 | instead, markers are removed from the chain when freed by gc. */ |
7146af97 JB |
1637 | break; |
1638 | ||
1639 | case Lisp_Cons: | |
1640 | case Lisp_Buffer_Local_Value: | |
1641 | case Lisp_Some_Buffer_Local_Value: | |
6c523803 | 1642 | case Lisp_Overlay: |
7146af97 JB |
1643 | { |
1644 | register struct Lisp_Cons *ptr = XCONS (obj); | |
1645 | if (XMARKBIT (ptr->car)) break; | |
1646 | XMARK (ptr->car); | |
c54ca951 RS |
1647 | /* If the cdr is nil, avoid recursion for the car. */ |
1648 | if (EQ (ptr->cdr, Qnil)) | |
1649 | { | |
1650 | objptr = &ptr->car; | |
c54ca951 RS |
1651 | goto loop; |
1652 | } | |
7146af97 | 1653 | mark_object (&ptr->car); |
41f54422 RS |
1654 | /* See comment above under Lisp_Vector for why not use ptr here. */ |
1655 | objptr = &XCONS (obj)->cdr; | |
7146af97 JB |
1656 | goto loop; |
1657 | } | |
1658 | ||
1659 | #ifdef LISP_FLOAT_TYPE | |
1660 | case Lisp_Float: | |
1661 | XMARK (XFLOAT (obj)->type); | |
1662 | break; | |
1663 | #endif /* LISP_FLOAT_TYPE */ | |
1664 | ||
1665 | case Lisp_Buffer: | |
1666 | if (!XMARKBIT (XBUFFER (obj)->name)) | |
1667 | mark_buffer (obj); | |
1668 | break; | |
1669 | ||
1670 | case Lisp_Int: | |
1671 | case Lisp_Void: | |
1672 | case Lisp_Subr: | |
1673 | case Lisp_Intfwd: | |
1674 | case Lisp_Boolfwd: | |
1675 | case Lisp_Objfwd: | |
1676 | case Lisp_Buffer_Objfwd: | |
1677 | case Lisp_Internal_Stream: | |
1678 | /* Don't bother with Lisp_Buffer_Objfwd, | |
1679 | since all markable slots in current buffer marked anyway. */ | |
1680 | /* Don't need to do Lisp_Objfwd, since the places they point | |
1681 | are protected with staticpro. */ | |
1682 | break; | |
1683 | ||
1684 | default: | |
1685 | abort (); | |
1686 | } | |
1687 | } | |
1688 | ||
1689 | /* Mark the pointers in a buffer structure. */ | |
1690 | ||
1691 | static void | |
1692 | mark_buffer (buf) | |
1693 | Lisp_Object buf; | |
1694 | { | |
7146af97 JB |
1695 | register struct buffer *buffer = XBUFFER (buf); |
1696 | register Lisp_Object *ptr; | |
1697 | ||
1698 | /* This is the buffer's markbit */ | |
1699 | mark_object (&buffer->name); | |
1700 | XMARK (buffer->name); | |
1701 | ||
d5e35230 JA |
1702 | MARK_INTERVAL_TREE (buffer->intervals); |
1703 | ||
7146af97 JB |
1704 | #if 0 |
1705 | mark_object (buffer->syntax_table); | |
1706 | ||
1707 | /* Mark the various string-pointers in the buffer object. | |
1708 | Since the strings may be relocated, we must mark them | |
1709 | in their actual slots. So gc_sweep must convert each slot | |
1710 | back to an ordinary C pointer. */ | |
1711 | XSET (*(Lisp_Object *)&buffer->upcase_table, | |
1712 | Lisp_String, buffer->upcase_table); | |
1713 | mark_object ((Lisp_Object *)&buffer->upcase_table); | |
1714 | XSET (*(Lisp_Object *)&buffer->downcase_table, | |
1715 | Lisp_String, buffer->downcase_table); | |
1716 | mark_object ((Lisp_Object *)&buffer->downcase_table); | |
1717 | ||
1718 | XSET (*(Lisp_Object *)&buffer->sort_table, | |
1719 | Lisp_String, buffer->sort_table); | |
1720 | mark_object ((Lisp_Object *)&buffer->sort_table); | |
1721 | XSET (*(Lisp_Object *)&buffer->folding_sort_table, | |
1722 | Lisp_String, buffer->folding_sort_table); | |
1723 | mark_object ((Lisp_Object *)&buffer->folding_sort_table); | |
1724 | #endif | |
1725 | ||
1726 | for (ptr = &buffer->name + 1; | |
1727 | (char *)ptr < (char *)buffer + sizeof (struct buffer); | |
1728 | ptr++) | |
1729 | mark_object (ptr); | |
1730 | } | |
1731 | \f | |
1a4f1e2c | 1732 | /* Sweep: find all structures not marked, and free them. */ |
7146af97 JB |
1733 | |
1734 | static void | |
1735 | gc_sweep () | |
1736 | { | |
1737 | total_string_size = 0; | |
1738 | compact_strings (); | |
1739 | ||
1740 | /* Put all unmarked conses on free list */ | |
1741 | { | |
1742 | register struct cons_block *cblk; | |
1743 | register int lim = cons_block_index; | |
1744 | register int num_free = 0, num_used = 0; | |
1745 | ||
1746 | cons_free_list = 0; | |
1747 | ||
1748 | for (cblk = cons_block; cblk; cblk = cblk->next) | |
1749 | { | |
1750 | register int i; | |
1751 | for (i = 0; i < lim; i++) | |
1752 | if (!XMARKBIT (cblk->conses[i].car)) | |
1753 | { | |
1754 | XFASTINT (cblk->conses[i].car) = (int) cons_free_list; | |
1755 | num_free++; | |
1756 | cons_free_list = &cblk->conses[i]; | |
1757 | } | |
1758 | else | |
1759 | { | |
1760 | num_used++; | |
1761 | XUNMARK (cblk->conses[i].car); | |
1762 | } | |
1763 | lim = CONS_BLOCK_SIZE; | |
1764 | } | |
1765 | total_conses = num_used; | |
1766 | total_free_conses = num_free; | |
1767 | } | |
1768 | ||
1769 | #ifdef LISP_FLOAT_TYPE | |
1770 | /* Put all unmarked floats on free list */ | |
1771 | { | |
1772 | register struct float_block *fblk; | |
1773 | register int lim = float_block_index; | |
1774 | register int num_free = 0, num_used = 0; | |
1775 | ||
1776 | float_free_list = 0; | |
1777 | ||
1778 | for (fblk = float_block; fblk; fblk = fblk->next) | |
1779 | { | |
1780 | register int i; | |
1781 | for (i = 0; i < lim; i++) | |
1782 | if (!XMARKBIT (fblk->floats[i].type)) | |
1783 | { | |
1784 | XFASTINT (fblk->floats[i].type) = (int) float_free_list; | |
1785 | num_free++; | |
1786 | float_free_list = &fblk->floats[i]; | |
1787 | } | |
1788 | else | |
1789 | { | |
1790 | num_used++; | |
1791 | XUNMARK (fblk->floats[i].type); | |
1792 | } | |
1793 | lim = FLOAT_BLOCK_SIZE; | |
1794 | } | |
1795 | total_floats = num_used; | |
1796 | total_free_floats = num_free; | |
1797 | } | |
1798 | #endif /* LISP_FLOAT_TYPE */ | |
1799 | ||
d5e35230 JA |
1800 | #ifdef USE_TEXT_PROPERTIES |
1801 | /* Put all unmarked intervals on free list */ | |
1802 | { | |
1803 | register struct interval_block *iblk; | |
1804 | register int lim = interval_block_index; | |
1805 | register int num_free = 0, num_used = 0; | |
1806 | ||
1807 | interval_free_list = 0; | |
1808 | ||
1809 | for (iblk = interval_block; iblk; iblk = iblk->next) | |
1810 | { | |
1811 | register int i; | |
1812 | ||
1813 | for (i = 0; i < lim; i++) | |
1814 | { | |
1815 | if (! XMARKBIT (iblk->intervals[i].plist)) | |
1816 | { | |
1817 | iblk->intervals[i].parent = interval_free_list; | |
1818 | interval_free_list = &iblk->intervals[i]; | |
1819 | num_free++; | |
1820 | } | |
1821 | else | |
1822 | { | |
1823 | num_used++; | |
1824 | XUNMARK (iblk->intervals[i].plist); | |
1825 | } | |
1826 | } | |
1827 | lim = INTERVAL_BLOCK_SIZE; | |
1828 | } | |
1829 | total_intervals = num_used; | |
1830 | total_free_intervals = num_free; | |
1831 | } | |
1832 | #endif /* USE_TEXT_PROPERTIES */ | |
1833 | ||
7146af97 JB |
1834 | /* Put all unmarked symbols on free list */ |
1835 | { | |
1836 | register struct symbol_block *sblk; | |
1837 | register int lim = symbol_block_index; | |
1838 | register int num_free = 0, num_used = 0; | |
1839 | ||
1840 | symbol_free_list = 0; | |
1841 | ||
1842 | for (sblk = symbol_block; sblk; sblk = sblk->next) | |
1843 | { | |
1844 | register int i; | |
1845 | for (i = 0; i < lim; i++) | |
1846 | if (!XMARKBIT (sblk->symbols[i].plist)) | |
1847 | { | |
1848 | XFASTINT (sblk->symbols[i].value) = (int) symbol_free_list; | |
1849 | symbol_free_list = &sblk->symbols[i]; | |
1850 | num_free++; | |
1851 | } | |
1852 | else | |
1853 | { | |
1854 | num_used++; | |
1855 | sblk->symbols[i].name | |
1856 | = XSTRING (*(Lisp_Object *) &sblk->symbols[i].name); | |
1857 | XUNMARK (sblk->symbols[i].plist); | |
1858 | } | |
1859 | lim = SYMBOL_BLOCK_SIZE; | |
1860 | } | |
1861 | total_symbols = num_used; | |
1862 | total_free_symbols = num_free; | |
1863 | } | |
1864 | ||
1865 | #ifndef standalone | |
1866 | /* Put all unmarked markers on free list. | |
1867 | Dechain each one first from the buffer it points into. */ | |
1868 | { | |
1869 | register struct marker_block *mblk; | |
1870 | struct Lisp_Marker *tem1; | |
1871 | register int lim = marker_block_index; | |
1872 | register int num_free = 0, num_used = 0; | |
1873 | ||
1874 | marker_free_list = 0; | |
1875 | ||
1876 | for (mblk = marker_block; mblk; mblk = mblk->next) | |
1877 | { | |
1878 | register int i; | |
1879 | for (i = 0; i < lim; i++) | |
1880 | if (!XMARKBIT (mblk->markers[i].chain)) | |
1881 | { | |
1882 | Lisp_Object tem; | |
1883 | tem1 = &mblk->markers[i]; /* tem1 avoids Sun compiler bug */ | |
1884 | XSET (tem, Lisp_Marker, tem1); | |
1885 | unchain_marker (tem); | |
1886 | XFASTINT (mblk->markers[i].chain) = (int) marker_free_list; | |
1887 | marker_free_list = &mblk->markers[i]; | |
1888 | num_free++; | |
1889 | } | |
1890 | else | |
1891 | { | |
1892 | num_used++; | |
1893 | XUNMARK (mblk->markers[i].chain); | |
1894 | } | |
1895 | lim = MARKER_BLOCK_SIZE; | |
1896 | } | |
1897 | ||
1898 | total_markers = num_used; | |
1899 | total_free_markers = num_free; | |
1900 | } | |
1901 | ||
1902 | /* Free all unmarked buffers */ | |
1903 | { | |
1904 | register struct buffer *buffer = all_buffers, *prev = 0, *next; | |
1905 | ||
1906 | while (buffer) | |
1907 | if (!XMARKBIT (buffer->name)) | |
1908 | { | |
1909 | if (prev) | |
1910 | prev->next = buffer->next; | |
1911 | else | |
1912 | all_buffers = buffer->next; | |
1913 | next = buffer->next; | |
9ac0d9e0 | 1914 | xfree (buffer); |
7146af97 JB |
1915 | buffer = next; |
1916 | } | |
1917 | else | |
1918 | { | |
1919 | XUNMARK (buffer->name); | |
d5e35230 | 1920 | UNMARK_BALANCE_INTERVALS (buffer->intervals); |
7146af97 JB |
1921 | |
1922 | #if 0 | |
1923 | /* Each `struct Lisp_String *' was turned into a Lisp_Object | |
1924 | for purposes of marking and relocation. | |
1925 | Turn them back into C pointers now. */ | |
1926 | buffer->upcase_table | |
1927 | = XSTRING (*(Lisp_Object *)&buffer->upcase_table); | |
1928 | buffer->downcase_table | |
1929 | = XSTRING (*(Lisp_Object *)&buffer->downcase_table); | |
1930 | buffer->sort_table | |
1931 | = XSTRING (*(Lisp_Object *)&buffer->sort_table); | |
1932 | buffer->folding_sort_table | |
1933 | = XSTRING (*(Lisp_Object *)&buffer->folding_sort_table); | |
1934 | #endif | |
1935 | ||
1936 | prev = buffer, buffer = buffer->next; | |
1937 | } | |
1938 | } | |
1939 | ||
1940 | #endif /* standalone */ | |
1941 | ||
1942 | /* Free all unmarked vectors */ | |
1943 | { | |
1944 | register struct Lisp_Vector *vector = all_vectors, *prev = 0, *next; | |
1945 | total_vector_size = 0; | |
1946 | ||
1947 | while (vector) | |
1948 | if (!(vector->size & ARRAY_MARK_FLAG)) | |
1949 | { | |
1950 | if (prev) | |
1951 | prev->next = vector->next; | |
1952 | else | |
1953 | all_vectors = vector->next; | |
1954 | next = vector->next; | |
9ac0d9e0 | 1955 | xfree (vector); |
7146af97 JB |
1956 | vector = next; |
1957 | } | |
1958 | else | |
1959 | { | |
1960 | vector->size &= ~ARRAY_MARK_FLAG; | |
1961 | total_vector_size += vector->size; | |
1962 | prev = vector, vector = vector->next; | |
1963 | } | |
1964 | } | |
1965 | ||
1966 | /* Free all "large strings" not marked with ARRAY_MARK_FLAG. */ | |
1967 | { | |
1968 | register struct string_block *sb = large_string_blocks, *prev = 0, *next; | |
e8720644 | 1969 | struct Lisp_String *s; |
7146af97 JB |
1970 | |
1971 | while (sb) | |
e8720644 JB |
1972 | { |
1973 | s = (struct Lisp_String *) &sb->chars[0]; | |
1974 | if (s->size & ARRAY_MARK_FLAG) | |
1975 | { | |
1976 | ((struct Lisp_String *)(&sb->chars[0]))->size | |
1977 | &= ~ARRAY_MARK_FLAG & ~MARKBIT; | |
1978 | UNMARK_BALANCE_INTERVALS (s->intervals); | |
1979 | total_string_size += ((struct Lisp_String *)(&sb->chars[0]))->size; | |
1980 | prev = sb, sb = sb->next; | |
1981 | } | |
1982 | else | |
1983 | { | |
1984 | if (prev) | |
1985 | prev->next = sb->next; | |
1986 | else | |
1987 | large_string_blocks = sb->next; | |
1988 | next = sb->next; | |
1989 | xfree (sb); | |
1990 | sb = next; | |
1991 | } | |
1992 | } | |
7146af97 JB |
1993 | } |
1994 | } | |
1995 | \f | |
1a4f1e2c | 1996 | /* Compactify strings, relocate references, and free empty string blocks. */ |
7146af97 JB |
1997 | |
1998 | static void | |
1999 | compact_strings () | |
2000 | { | |
2001 | /* String block of old strings we are scanning. */ | |
2002 | register struct string_block *from_sb; | |
2003 | /* A preceding string block (or maybe the same one) | |
2004 | where we are copying the still-live strings to. */ | |
2005 | register struct string_block *to_sb; | |
2006 | int pos; | |
2007 | int to_pos; | |
2008 | ||
2009 | to_sb = first_string_block; | |
2010 | to_pos = 0; | |
2011 | ||
2012 | /* Scan each existing string block sequentially, string by string. */ | |
2013 | for (from_sb = first_string_block; from_sb; from_sb = from_sb->next) | |
2014 | { | |
2015 | pos = 0; | |
2016 | /* POS is the index of the next string in the block. */ | |
2017 | while (pos < from_sb->pos) | |
2018 | { | |
2019 | register struct Lisp_String *nextstr | |
2020 | = (struct Lisp_String *) &from_sb->chars[pos]; | |
2021 | ||
2022 | register struct Lisp_String *newaddr; | |
2023 | register int size = nextstr->size; | |
2024 | ||
2025 | /* NEXTSTR is the old address of the next string. | |
2026 | Just skip it if it isn't marked. */ | |
2027 | if ((unsigned) size > STRING_BLOCK_SIZE) | |
2028 | { | |
2029 | /* It is marked, so its size field is really a chain of refs. | |
2030 | Find the end of the chain, where the actual size lives. */ | |
2031 | while ((unsigned) size > STRING_BLOCK_SIZE) | |
2032 | { | |
2033 | if (size & 1) size ^= MARKBIT | 1; | |
2034 | size = *(int *)size & ~MARKBIT; | |
2035 | } | |
2036 | ||
2037 | total_string_size += size; | |
2038 | ||
2039 | /* If it won't fit in TO_SB, close it out, | |
2040 | and move to the next sb. Keep doing so until | |
2041 | TO_SB reaches a large enough, empty enough string block. | |
2042 | We know that TO_SB cannot advance past FROM_SB here | |
2043 | since FROM_SB is large enough to contain this string. | |
2044 | Any string blocks skipped here | |
2045 | will be patched out and freed later. */ | |
2046 | while (to_pos + STRING_FULLSIZE (size) | |
2047 | > max (to_sb->pos, STRING_BLOCK_SIZE)) | |
2048 | { | |
2049 | to_sb->pos = to_pos; | |
2050 | to_sb = to_sb->next; | |
2051 | to_pos = 0; | |
2052 | } | |
2053 | /* Compute new address of this string | |
2054 | and update TO_POS for the space being used. */ | |
2055 | newaddr = (struct Lisp_String *) &to_sb->chars[to_pos]; | |
2056 | to_pos += STRING_FULLSIZE (size); | |
2057 | ||
2058 | /* Copy the string itself to the new place. */ | |
2059 | if (nextstr != newaddr) | |
d5e35230 JA |
2060 | bcopy (nextstr, newaddr, size + 1 + sizeof (int) |
2061 | + INTERVAL_PTR_SIZE); | |
7146af97 JB |
2062 | |
2063 | /* Go through NEXTSTR's chain of references | |
2064 | and make each slot in the chain point to | |
2065 | the new address of this string. */ | |
2066 | size = newaddr->size; | |
2067 | while ((unsigned) size > STRING_BLOCK_SIZE) | |
2068 | { | |
2069 | register Lisp_Object *objptr; | |
2070 | if (size & 1) size ^= MARKBIT | 1; | |
2071 | objptr = (Lisp_Object *)size; | |
2072 | ||
2073 | size = XFASTINT (*objptr) & ~MARKBIT; | |
2074 | if (XMARKBIT (*objptr)) | |
2075 | { | |
2076 | XSET (*objptr, Lisp_String, newaddr); | |
2077 | XMARK (*objptr); | |
2078 | } | |
2079 | else | |
2080 | XSET (*objptr, Lisp_String, newaddr); | |
2081 | } | |
2082 | /* Store the actual size in the size field. */ | |
2083 | newaddr->size = size; | |
e8720644 | 2084 | |
5f60ed47 | 2085 | #ifdef USE_TEXT_PROPERTIES |
e8720644 JB |
2086 | /* Now that the string has been relocated, rebalance its |
2087 | interval tree, and update the tree's parent pointer. */ | |
2088 | if (! NULL_INTERVAL_P (newaddr->intervals)) | |
2089 | { | |
2090 | UNMARK_BALANCE_INTERVALS (newaddr->intervals); | |
2091 | XSET (* (Lisp_Object *) &newaddr->intervals->parent, | |
2092 | Lisp_String, | |
2093 | newaddr); | |
2094 | } | |
5f60ed47 | 2095 | #endif /* USE_TEXT_PROPERTIES */ |
7146af97 JB |
2096 | } |
2097 | pos += STRING_FULLSIZE (size); | |
2098 | } | |
2099 | } | |
2100 | ||
2101 | /* Close out the last string block still used and free any that follow. */ | |
2102 | to_sb->pos = to_pos; | |
2103 | current_string_block = to_sb; | |
2104 | ||
2105 | from_sb = to_sb->next; | |
2106 | to_sb->next = 0; | |
2107 | while (from_sb) | |
2108 | { | |
2109 | to_sb = from_sb->next; | |
9ac0d9e0 | 2110 | xfree (from_sb); |
7146af97 JB |
2111 | from_sb = to_sb; |
2112 | } | |
2113 | ||
2114 | /* Free any empty string blocks further back in the chain. | |
2115 | This loop will never free first_string_block, but it is very | |
2116 | unlikely that that one will become empty, so why bother checking? */ | |
2117 | ||
2118 | from_sb = first_string_block; | |
2119 | while (to_sb = from_sb->next) | |
2120 | { | |
2121 | if (to_sb->pos == 0) | |
2122 | { | |
2123 | if (from_sb->next = to_sb->next) | |
2124 | from_sb->next->prev = from_sb; | |
9ac0d9e0 | 2125 | xfree (to_sb); |
7146af97 JB |
2126 | } |
2127 | else | |
2128 | from_sb = to_sb; | |
2129 | } | |
2130 | } | |
2131 | \f | |
20d24714 JB |
2132 | /* Debugging aids. */ |
2133 | ||
31ce1c91 | 2134 | DEFUN ("memory-limit", Fmemory_limit, Smemory_limit, 0, 0, 0, |
20d24714 JB |
2135 | "Return the address of the last byte Emacs has allocated, divided by 1024.\n\ |
2136 | This may be helpful in debugging Emacs's memory usage.\n\ | |
e41ae81f | 2137 | We divide the value by 1024 to make sure it fits in a Lisp integer.") |
20d24714 JB |
2138 | () |
2139 | { | |
2140 | Lisp_Object end; | |
2141 | ||
0d73ca81 | 2142 | XSET (end, Lisp_Int, (int) sbrk (0) / 1024); |
20d24714 JB |
2143 | |
2144 | return end; | |
2145 | } | |
2146 | ||
2147 | \f | |
7146af97 JB |
2148 | /* Initialization */ |
2149 | ||
2150 | init_alloc_once () | |
2151 | { | |
2152 | /* Used to do Vpurify_flag = Qt here, but Qt isn't set up yet! */ | |
2153 | pureptr = 0; | |
4c0be5f4 JB |
2154 | #ifdef HAVE_SHM |
2155 | pure_size = PURESIZE; | |
2156 | #endif | |
7146af97 JB |
2157 | all_vectors = 0; |
2158 | ignore_warnings = 1; | |
2159 | init_strings (); | |
2160 | init_cons (); | |
2161 | init_symbol (); | |
2162 | init_marker (); | |
2163 | #ifdef LISP_FLOAT_TYPE | |
2164 | init_float (); | |
2165 | #endif /* LISP_FLOAT_TYPE */ | |
d5e35230 JA |
2166 | INIT_INTERVALS; |
2167 | ||
7146af97 JB |
2168 | ignore_warnings = 0; |
2169 | gcprolist = 0; | |
2170 | staticidx = 0; | |
2171 | consing_since_gc = 0; | |
2172 | gc_cons_threshold = 100000; | |
2173 | #ifdef VIRT_ADDR_VARIES | |
2174 | malloc_sbrk_unused = 1<<22; /* A large number */ | |
2175 | malloc_sbrk_used = 100000; /* as reasonable as any number */ | |
2176 | #endif /* VIRT_ADDR_VARIES */ | |
2177 | } | |
2178 | ||
2179 | init_alloc () | |
2180 | { | |
2181 | gcprolist = 0; | |
2182 | } | |
2183 | ||
2184 | void | |
2185 | syms_of_alloc () | |
2186 | { | |
2187 | DEFVAR_INT ("gc-cons-threshold", &gc_cons_threshold, | |
2188 | "*Number of bytes of consing between garbage collections.\n\ | |
2189 | Garbage collection can happen automatically once this many bytes have been\n\ | |
2190 | allocated since the last garbage collection. All data types count.\n\n\ | |
2191 | Garbage collection happens automatically only when `eval' is called.\n\n\ | |
2192 | By binding this temporarily to a large number, you can effectively\n\ | |
2193 | prevent garbage collection during a part of the program."); | |
2194 | ||
2195 | DEFVAR_INT ("pure-bytes-used", &pureptr, | |
2196 | "Number of bytes of sharable Lisp data allocated so far."); | |
2197 | ||
2198 | #if 0 | |
2199 | DEFVAR_INT ("data-bytes-used", &malloc_sbrk_used, | |
2200 | "Number of bytes of unshared memory allocated in this session."); | |
2201 | ||
2202 | DEFVAR_INT ("data-bytes-free", &malloc_sbrk_unused, | |
2203 | "Number of bytes of unshared memory remaining available in this session."); | |
2204 | #endif | |
2205 | ||
2206 | DEFVAR_LISP ("purify-flag", &Vpurify_flag, | |
2207 | "Non-nil means loading Lisp code in order to dump an executable.\n\ | |
2208 | This means that certain objects should be allocated in shared (pure) space."); | |
2209 | ||
502b9b64 | 2210 | DEFVAR_INT ("undo-limit", &undo_limit, |
7146af97 | 2211 | "Keep no more undo information once it exceeds this size.\n\ |
502b9b64 | 2212 | This limit is applied when garbage collection happens.\n\ |
7146af97 JB |
2213 | The size is counted as the number of bytes occupied,\n\ |
2214 | which includes both saved text and other data."); | |
502b9b64 | 2215 | undo_limit = 20000; |
7146af97 | 2216 | |
502b9b64 | 2217 | DEFVAR_INT ("undo-strong-limit", &undo_strong_limit, |
7146af97 JB |
2218 | "Don't keep more than this much size of undo information.\n\ |
2219 | A command which pushes past this size is itself forgotten.\n\ | |
502b9b64 | 2220 | This limit is applied when garbage collection happens.\n\ |
7146af97 JB |
2221 | The size is counted as the number of bytes occupied,\n\ |
2222 | which includes both saved text and other data."); | |
502b9b64 | 2223 | undo_strong_limit = 30000; |
7146af97 | 2224 | |
bcb61d60 KH |
2225 | /* We build this in advance because if we wait until we need it, we might |
2226 | not be able to allocate the memory to hold it. */ | |
2227 | memory_signal_data = Fcons (build_string ("Memory exhausted"), Qnil); | |
2228 | staticpro (&memory_signal_data); | |
2229 | ||
7146af97 JB |
2230 | defsubr (&Scons); |
2231 | defsubr (&Slist); | |
2232 | defsubr (&Svector); | |
2233 | defsubr (&Smake_byte_code); | |
2234 | defsubr (&Smake_list); | |
2235 | defsubr (&Smake_vector); | |
2236 | defsubr (&Smake_string); | |
7146af97 JB |
2237 | defsubr (&Smake_symbol); |
2238 | defsubr (&Smake_marker); | |
2239 | defsubr (&Spurecopy); | |
2240 | defsubr (&Sgarbage_collect); | |
20d24714 | 2241 | defsubr (&Smemory_limit); |
7146af97 | 2242 | } |