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