Commit | Line | Data |
---|---|---|
ab4bef85 | 1 | /* Copyright (C) 1995, 1996, 1997, 1998, 1999 Free Software Foundation, Inc. |
0f2d19dd JB |
2 | * |
3 | * This program is free software; you can redistribute it and/or modify | |
4 | * it under the terms of the GNU General Public License as published by | |
5 | * the Free Software Foundation; either version 2, or (at your option) | |
6 | * any later version. | |
7 | * | |
8 | * This program is distributed in the hope that it will be useful, | |
9 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
10 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
11 | * GNU General Public License for more details. | |
12 | * | |
13 | * You should have received a copy of the GNU General Public License | |
14 | * along with this software; see the file COPYING. If not, write to | |
82892bed JB |
15 | * the Free Software Foundation, Inc., 59 Temple Place, Suite 330, |
16 | * Boston, MA 02111-1307 USA | |
0f2d19dd JB |
17 | * |
18 | * As a special exception, the Free Software Foundation gives permission | |
19 | * for additional uses of the text contained in its release of GUILE. | |
20 | * | |
21 | * The exception is that, if you link the GUILE library with other files | |
22 | * to produce an executable, this does not by itself cause the | |
23 | * resulting executable to be covered by the GNU General Public License. | |
24 | * Your use of that executable is in no way restricted on account of | |
25 | * linking the GUILE library code into it. | |
26 | * | |
27 | * This exception does not however invalidate any other reasons why | |
28 | * the executable file might be covered by the GNU General Public License. | |
29 | * | |
30 | * This exception applies only to the code released by the | |
31 | * Free Software Foundation under the name GUILE. If you copy | |
32 | * code from other Free Software Foundation releases into a copy of | |
33 | * GUILE, as the General Public License permits, the exception does | |
34 | * not apply to the code that you add in this way. To avoid misleading | |
35 | * anyone as to the status of such modified files, you must delete | |
36 | * this exception notice from them. | |
37 | * | |
38 | * If you write modifications of your own for GUILE, it is your choice | |
39 | * whether to permit this exception to apply to your modifications. | |
82892bed | 40 | * If you do not wish that, delete this exception notice. */ |
1bbd0b84 GB |
41 | |
42 | /* Software engineering face-lift by Greg J. Badros, 11-Dec-1999, | |
43 | gjb@cs.washington.edu, http://www.cs.washington.edu/homes/gjb */ | |
44 | ||
0f2d19dd JB |
45 | \f |
46 | #include <stdio.h> | |
47 | #include "_scm.h" | |
20e6290e JB |
48 | #include "stime.h" |
49 | #include "stackchk.h" | |
50 | #include "struct.h" | |
51 | #include "genio.h" | |
52 | #include "weaks.h" | |
0493cd89 | 53 | #include "guardians.h" |
20e6290e JB |
54 | #include "smob.h" |
55 | #include "unif.h" | |
56 | #include "async.h" | |
0f2d19dd | 57 | |
1bbd0b84 | 58 | #include "scm_validate.h" |
fce59c93 JB |
59 | #include "gc.h" |
60 | ||
0f2d19dd | 61 | #ifdef HAVE_MALLOC_H |
95b88819 | 62 | #include <malloc.h> |
0f2d19dd JB |
63 | #endif |
64 | ||
65 | #ifdef HAVE_UNISTD_H | |
95b88819 | 66 | #include <unistd.h> |
0f2d19dd JB |
67 | #endif |
68 | ||
1cc91f1b JB |
69 | #ifdef __STDC__ |
70 | #include <stdarg.h> | |
71 | #define var_start(x, y) va_start(x, y) | |
72 | #else | |
73 | #include <varargs.h> | |
74 | #define var_start(x, y) va_start(x) | |
75 | #endif | |
76 | ||
0f2d19dd JB |
77 | \f |
78 | /* {heap tuning parameters} | |
79 | * | |
80 | * These are parameters for controlling memory allocation. The heap | |
81 | * is the area out of which scm_cons, and object headers are allocated. | |
82 | * | |
83 | * Each heap cell is 8 bytes on a 32 bit machine and 16 bytes on a | |
84 | * 64 bit machine. The units of the _SIZE parameters are bytes. | |
85 | * Cons pairs and object headers occupy one heap cell. | |
86 | * | |
87 | * SCM_INIT_HEAP_SIZE is the initial size of heap. If this much heap is | |
88 | * allocated initially the heap will grow by half its current size | |
89 | * each subsequent time more heap is needed. | |
90 | * | |
91 | * If SCM_INIT_HEAP_SIZE heap cannot be allocated initially, SCM_HEAP_SEG_SIZE | |
92 | * will be used, and the heap will grow by SCM_HEAP_SEG_SIZE when more | |
93 | * heap is needed. SCM_HEAP_SEG_SIZE must fit into type scm_sizet. This code | |
94 | * is in scm_init_storage() and alloc_some_heap() in sys.c | |
95 | * | |
96 | * If SCM_INIT_HEAP_SIZE can be allocated initially, the heap will grow by | |
97 | * SCM_EXPHEAP(scm_heap_size) when more heap is needed. | |
98 | * | |
99 | * SCM_MIN_HEAP_SEG_SIZE is minimum size of heap to accept when more heap | |
100 | * is needed. | |
101 | * | |
102 | * INIT_MALLOC_LIMIT is the initial amount of malloc usage which will | |
103 | * trigger a GC. | |
6064dcc6 MV |
104 | * |
105 | * SCM_MTRIGGER_HYSTERESIS is the amount of malloc storage that must be | |
106 | * reclaimed by a GC triggered by must_malloc. If less than this is | |
107 | * reclaimed, the trigger threshold is raised. [I don't know what a | |
108 | * good value is. I arbitrarily chose 1/10 of the INIT_MALLOC_LIMIT to | |
109 | * work around a oscillation that caused almost constant GC.] | |
0f2d19dd JB |
110 | */ |
111 | ||
112 | #define SCM_INIT_HEAP_SIZE (32768L*sizeof(scm_cell)) | |
113 | #define SCM_MIN_HEAP_SEG_SIZE (2048L*sizeof(scm_cell)) | |
114 | #ifdef _QC | |
115 | # define SCM_HEAP_SEG_SIZE 32768L | |
116 | #else | |
117 | # ifdef sequent | |
118 | # define SCM_HEAP_SEG_SIZE (7000L*sizeof(scm_cell)) | |
119 | # else | |
120 | # define SCM_HEAP_SEG_SIZE (16384L*sizeof(scm_cell)) | |
121 | # endif | |
122 | #endif | |
123 | #define SCM_EXPHEAP(scm_heap_size) (scm_heap_size*2) | |
124 | #define SCM_INIT_MALLOC_LIMIT 100000 | |
6064dcc6 | 125 | #define SCM_MTRIGGER_HYSTERESIS (SCM_INIT_MALLOC_LIMIT/10) |
0f2d19dd JB |
126 | |
127 | /* CELL_UP and CELL_DN are used by scm_init_heap_seg to find scm_cell aligned inner | |
128 | bounds for allocated storage */ | |
129 | ||
130 | #ifdef PROT386 | |
131 | /*in 386 protected mode we must only adjust the offset */ | |
132 | # define CELL_UP(p) MK_FP(FP_SEG(p), ~7&(FP_OFF(p)+7)) | |
133 | # define CELL_DN(p) MK_FP(FP_SEG(p), ~7&FP_OFF(p)) | |
134 | #else | |
135 | # ifdef _UNICOS | |
136 | # define CELL_UP(p) (SCM_CELLPTR)(~1L & ((long)(p)+1L)) | |
137 | # define CELL_DN(p) (SCM_CELLPTR)(~1L & (long)(p)) | |
138 | # else | |
139 | # define CELL_UP(p) (SCM_CELLPTR)(~(sizeof(scm_cell)-1L) & ((long)(p)+sizeof(scm_cell)-1L)) | |
140 | # define CELL_DN(p) (SCM_CELLPTR)(~(sizeof(scm_cell)-1L) & (long)(p)) | |
141 | # endif /* UNICOS */ | |
142 | #endif /* PROT386 */ | |
143 | ||
144 | ||
145 | \f | |
146 | /* scm_freelist | |
147 | * is the head of freelist of cons pairs. | |
148 | */ | |
149 | SCM scm_freelist = SCM_EOL; | |
150 | ||
151 | /* scm_mtrigger | |
152 | * is the number of bytes of must_malloc allocation needed to trigger gc. | |
153 | */ | |
15e9d186 | 154 | unsigned long scm_mtrigger; |
0f2d19dd JB |
155 | |
156 | ||
157 | /* scm_gc_heap_lock | |
158 | * If set, don't expand the heap. Set only during gc, during which no allocation | |
159 | * is supposed to take place anyway. | |
160 | */ | |
161 | int scm_gc_heap_lock = 0; | |
162 | ||
163 | /* GC Blocking | |
164 | * Don't pause for collection if this is set -- just | |
165 | * expand the heap. | |
166 | */ | |
167 | ||
168 | int scm_block_gc = 1; | |
169 | ||
170 | /* If fewer than MIN_GC_YIELD cells are recovered during a garbage | |
171 | * collection (GC) more space is allocated for the heap. | |
172 | */ | |
173 | #define MIN_GC_YIELD (scm_heap_size/4) | |
174 | ||
175 | /* During collection, this accumulates objects holding | |
176 | * weak references. | |
177 | */ | |
ab4bef85 | 178 | SCM scm_weak_vectors; |
0f2d19dd JB |
179 | |
180 | /* GC Statistics Keeping | |
181 | */ | |
182 | unsigned long scm_cells_allocated = 0; | |
a5c314c8 | 183 | long scm_mallocated = 0; |
0f2d19dd JB |
184 | unsigned long scm_gc_cells_collected; |
185 | unsigned long scm_gc_malloc_collected; | |
186 | unsigned long scm_gc_ports_collected; | |
187 | unsigned long scm_gc_rt; | |
188 | unsigned long scm_gc_time_taken = 0; | |
189 | ||
190 | SCM_SYMBOL (sym_cells_allocated, "cells-allocated"); | |
191 | SCM_SYMBOL (sym_heap_size, "cell-heap-size"); | |
192 | SCM_SYMBOL (sym_mallocated, "bytes-malloced"); | |
193 | SCM_SYMBOL (sym_mtrigger, "gc-malloc-threshold"); | |
194 | SCM_SYMBOL (sym_heap_segments, "cell-heap-segments"); | |
195 | SCM_SYMBOL (sym_gc_time_taken, "gc-time-taken"); | |
196 | ||
197 | ||
198 | struct scm_heap_seg_data | |
199 | { | |
cf2d30f6 JB |
200 | /* lower and upper bounds of the segment */ |
201 | SCM_CELLPTR bounds[2]; | |
202 | ||
203 | /* address of the head-of-freelist pointer for this segment's cells. | |
204 | All segments usually point to the same one, scm_freelist. */ | |
205 | SCM *freelistp; | |
206 | ||
207 | /* number of SCM words per object in this segment */ | |
208 | int ncells; | |
209 | ||
210 | /* If SEG_DATA->valid is non-zero, the conservative marking | |
211 | functions will apply SEG_DATA->valid to the purported pointer and | |
212 | SEG_DATA, and mark the object iff the function returns non-zero. | |
213 | At the moment, I don't think anyone uses this. */ | |
0f2d19dd JB |
214 | int (*valid) (); |
215 | }; | |
216 | ||
217 | ||
218 | ||
219 | ||
1bbd0b84 GB |
220 | static void scm_mark_weak_vector_spines(void); |
221 | static scm_sizet init_heap_seg(SCM_CELLPTR, scm_sizet, int, SCM *); | |
222 | static void alloc_some_heap(int, SCM *); | |
0f2d19dd JB |
223 | |
224 | ||
225 | \f | |
cf2d30f6 JB |
226 | /* Debugging functions. */ |
227 | ||
fca7547b | 228 | #ifdef GUILE_DEBUG_FREELIST |
cf2d30f6 JB |
229 | |
230 | /* Return the number of the heap segment containing CELL. */ | |
231 | static int | |
232 | which_seg (SCM cell) | |
233 | { | |
234 | int i; | |
235 | ||
236 | for (i = 0; i < scm_n_heap_segs; i++) | |
237 | if (SCM_PTR_LE (scm_heap_table[i].bounds[0], (SCM_CELLPTR) cell) | |
238 | && SCM_PTR_GT (scm_heap_table[i].bounds[1], (SCM_CELLPTR) cell)) | |
239 | return i; | |
240 | fprintf (stderr, "which_seg: can't find segment containing cell %lx\n", | |
241 | cell); | |
242 | abort (); | |
243 | } | |
244 | ||
245 | ||
1bbd0b84 GB |
246 | GUILE_PROC (scm_map_free_list, "map-free-list", 0, 0, 0, |
247 | (), | |
248 | "") | |
249 | #define FUNC_NAME s_scm_map_free_list | |
cf2d30f6 JB |
250 | { |
251 | int last_seg = -1, count = 0; | |
252 | SCM f; | |
253 | ||
254 | fprintf (stderr, "%d segments total\n", scm_n_heap_segs); | |
255 | for (f = scm_freelist; SCM_NIMP (f); f = SCM_CDR (f)) | |
256 | { | |
257 | int this_seg = which_seg (f); | |
258 | ||
259 | if (this_seg != last_seg) | |
260 | { | |
261 | if (last_seg != -1) | |
262 | fprintf (stderr, " %5d cells in segment %d\n", count, last_seg); | |
263 | last_seg = this_seg; | |
264 | count = 0; | |
265 | } | |
266 | count++; | |
267 | } | |
268 | if (last_seg != -1) | |
269 | fprintf (stderr, " %5d cells in segment %d\n", count, last_seg); | |
270 | ||
271 | fflush (stderr); | |
272 | ||
273 | return SCM_UNSPECIFIED; | |
274 | } | |
1bbd0b84 | 275 | #undef FUNC_NAME |
cf2d30f6 JB |
276 | |
277 | ||
278 | /* Number of calls to SCM_NEWCELL since startup. */ | |
279 | static unsigned long scm_newcell_count; | |
280 | ||
281 | /* Search freelist for anything that isn't marked as a free cell. | |
282 | Abort if we find something. */ | |
283 | static void | |
284 | scm_check_freelist () | |
285 | { | |
286 | SCM f; | |
287 | int i = 0; | |
288 | ||
289 | for (f = scm_freelist; SCM_NIMP (f); f = SCM_CDR (f), i++) | |
290 | if (SCM_CAR (f) != (SCM) scm_tc_free_cell) | |
291 | { | |
292 | fprintf (stderr, "Bad cell in freelist on newcell %lu: %d'th elt\n", | |
293 | scm_newcell_count, i); | |
294 | fflush (stderr); | |
295 | abort (); | |
296 | } | |
297 | } | |
298 | ||
299 | static int scm_debug_check_freelist = 0; | |
25748c78 | 300 | |
1bbd0b84 GB |
301 | GUILE_PROC (scm_gc_set_debug_check_freelist_x, "gc-set-debug-check-freelist!", 1, 0, 0, |
302 | (SCM flag), | |
303 | "") | |
304 | #define FUNC_NAME s_scm_gc_set_debug_check_freelist_x | |
25748c78 | 305 | { |
1bbd0b84 | 306 | SCM_VALIDATE_BOOL_COPY(1,flag,scm_debug_check_freelist); |
25748c78 GB |
307 | return SCM_UNSPECIFIED; |
308 | } | |
1bbd0b84 | 309 | #undef FUNC_NAME |
25748c78 GB |
310 | |
311 | ||
f2333166 JB |
312 | SCM |
313 | scm_debug_newcell (void) | |
cf2d30f6 | 314 | { |
f2333166 JB |
315 | SCM new; |
316 | ||
cf2d30f6 | 317 | scm_newcell_count++; |
25748c78 | 318 | if (scm_debug_check_freelist) { |
cf2d30f6 | 319 | scm_check_freelist (); |
25748c78 GB |
320 | scm_gc(); |
321 | } | |
cf2d30f6 JB |
322 | |
323 | /* The rest of this is supposed to be identical to the SCM_NEWCELL | |
324 | macro. */ | |
325 | if (SCM_IMP (scm_freelist)) | |
f2333166 | 326 | new = scm_gc_for_newcell (); |
cf2d30f6 JB |
327 | else |
328 | { | |
f2333166 | 329 | new = scm_freelist; |
cf2d30f6 JB |
330 | scm_freelist = SCM_CDR (scm_freelist); |
331 | ++scm_cells_allocated; | |
332 | } | |
f2333166 JB |
333 | |
334 | return new; | |
cf2d30f6 JB |
335 | } |
336 | ||
fca7547b | 337 | #endif /* GUILE_DEBUG_FREELIST */ |
cf2d30f6 JB |
338 | |
339 | \f | |
0f2d19dd JB |
340 | |
341 | /* {Scheme Interface to GC} | |
342 | */ | |
343 | ||
1bbd0b84 GB |
344 | GUILE_PROC (scm_gc_stats, "gc-stats", 0, 0, 0, |
345 | (), | |
4079f87e | 346 | "Returns an association list of statistics about Guile's current use of storage. ") |
1bbd0b84 | 347 | #define FUNC_NAME s_scm_gc_stats |
0f2d19dd JB |
348 | { |
349 | int i; | |
350 | int n; | |
351 | SCM heap_segs; | |
352 | SCM local_scm_mtrigger; | |
353 | SCM local_scm_mallocated; | |
354 | SCM local_scm_heap_size; | |
355 | SCM local_scm_cells_allocated; | |
356 | SCM local_scm_gc_time_taken; | |
357 | SCM answer; | |
358 | ||
359 | SCM_DEFER_INTS; | |
360 | scm_block_gc = 1; | |
361 | retry: | |
362 | heap_segs = SCM_EOL; | |
363 | n = scm_n_heap_segs; | |
364 | for (i = scm_n_heap_segs; i--; ) | |
365 | heap_segs = scm_cons (scm_cons (scm_ulong2num ((unsigned long)scm_heap_table[i].bounds[1]), | |
366 | scm_ulong2num ((unsigned long)scm_heap_table[i].bounds[0])), | |
367 | heap_segs); | |
368 | if (scm_n_heap_segs != n) | |
369 | goto retry; | |
370 | scm_block_gc = 0; | |
371 | ||
372 | local_scm_mtrigger = scm_mtrigger; | |
373 | local_scm_mallocated = scm_mallocated; | |
374 | local_scm_heap_size = scm_heap_size; | |
375 | local_scm_cells_allocated = scm_cells_allocated; | |
376 | local_scm_gc_time_taken = scm_gc_time_taken; | |
377 | ||
378 | answer = scm_listify (scm_cons (sym_gc_time_taken, scm_ulong2num (local_scm_gc_time_taken)), | |
379 | scm_cons (sym_cells_allocated, scm_ulong2num (local_scm_cells_allocated)), | |
380 | scm_cons (sym_heap_size, scm_ulong2num (local_scm_heap_size)), | |
381 | scm_cons (sym_mallocated, scm_ulong2num (local_scm_mallocated)), | |
382 | scm_cons (sym_mtrigger, scm_ulong2num (local_scm_mtrigger)), | |
383 | scm_cons (sym_heap_segments, heap_segs), | |
384 | SCM_UNDEFINED); | |
385 | SCM_ALLOW_INTS; | |
386 | return answer; | |
387 | } | |
1bbd0b84 | 388 | #undef FUNC_NAME |
0f2d19dd JB |
389 | |
390 | ||
0f2d19dd | 391 | void |
6e8d25a6 | 392 | scm_gc_start (const char *what) |
0f2d19dd JB |
393 | { |
394 | scm_gc_rt = SCM_INUM (scm_get_internal_run_time ()); | |
395 | scm_gc_cells_collected = 0; | |
396 | scm_gc_malloc_collected = 0; | |
397 | scm_gc_ports_collected = 0; | |
398 | } | |
399 | ||
0f2d19dd JB |
400 | void |
401 | scm_gc_end () | |
0f2d19dd JB |
402 | { |
403 | scm_gc_rt = SCM_INUM (scm_get_internal_run_time ()) - scm_gc_rt; | |
404 | scm_gc_time_taken = scm_gc_time_taken + scm_gc_rt; | |
9ea54cc6 | 405 | scm_system_async_mark (scm_gc_async); |
0f2d19dd JB |
406 | } |
407 | ||
408 | ||
1bbd0b84 GB |
409 | GUILE_PROC (scm_object_address, "object-address", 1, 0, 0, |
410 | (SCM obj), | |
4079f87e GB |
411 | "Return an integer that for the lifetime of @var{obj} is uniquely |
412 | returned by this function for @var{obj}") | |
1bbd0b84 | 413 | #define FUNC_NAME s_scm_object_address |
0f2d19dd JB |
414 | { |
415 | return scm_ulong2num ((unsigned long)obj); | |
416 | } | |
1bbd0b84 | 417 | #undef FUNC_NAME |
0f2d19dd JB |
418 | |
419 | ||
1bbd0b84 GB |
420 | GUILE_PROC(scm_gc, "gc", 0, 0, 0, |
421 | (), | |
4079f87e GB |
422 | "Scans all of SCM objects and reclaims for further use those that are |
423 | no longer accessible.") | |
1bbd0b84 | 424 | #define FUNC_NAME s_scm_gc |
0f2d19dd JB |
425 | { |
426 | SCM_DEFER_INTS; | |
427 | scm_igc ("call"); | |
428 | SCM_ALLOW_INTS; | |
429 | return SCM_UNSPECIFIED; | |
430 | } | |
1bbd0b84 | 431 | #undef FUNC_NAME |
0f2d19dd JB |
432 | |
433 | ||
434 | \f | |
435 | /* {C Interface For When GC is Triggered} | |
436 | */ | |
437 | ||
0f2d19dd | 438 | void |
1bbd0b84 | 439 | scm_gc_for_alloc (int ncells, SCM *freelistp) |
0f2d19dd JB |
440 | { |
441 | SCM_REDEFER_INTS; | |
442 | scm_igc ("cells"); | |
443 | if ((scm_gc_cells_collected < MIN_GC_YIELD) || SCM_IMP (*freelistp)) | |
444 | { | |
445 | alloc_some_heap (ncells, freelistp); | |
446 | } | |
447 | SCM_REALLOW_INTS; | |
448 | } | |
449 | ||
450 | ||
0f2d19dd JB |
451 | SCM |
452 | scm_gc_for_newcell () | |
0f2d19dd JB |
453 | { |
454 | SCM fl; | |
455 | scm_gc_for_alloc (1, &scm_freelist); | |
456 | fl = scm_freelist; | |
457 | scm_freelist = SCM_CDR (fl); | |
1bbd0b84 | 458 | SCM_SETCAR(fl, scm_tc16_allocated); |
0f2d19dd JB |
459 | return fl; |
460 | } | |
461 | ||
0f2d19dd | 462 | void |
1bbd0b84 | 463 | scm_igc (const char *what) |
0f2d19dd JB |
464 | { |
465 | int j; | |
466 | ||
42db06f0 MD |
467 | #ifdef USE_THREADS |
468 | /* During the critical section, only the current thread may run. */ | |
469 | SCM_THREAD_CRITICAL_SECTION_START; | |
470 | #endif | |
471 | ||
e242dfd2 | 472 | /* fprintf (stderr, "gc: %s\n", what); */ |
c68296f8 | 473 | |
ab4bef85 JB |
474 | scm_gc_start (what); |
475 | ||
476 | if (!scm_stack_base || scm_block_gc) | |
477 | { | |
478 | scm_gc_end (); | |
479 | return; | |
480 | } | |
481 | ||
a5c314c8 JB |
482 | if (scm_mallocated < 0) |
483 | /* The byte count of allocated objects has underflowed. This is | |
484 | probably because you forgot to report the sizes of objects you | |
485 | have allocated, by calling scm_done_malloc or some such. When | |
486 | the GC freed them, it subtracted their size from | |
487 | scm_mallocated, which underflowed. */ | |
488 | abort (); | |
c45acc34 | 489 | |
ab4bef85 JB |
490 | if (scm_gc_heap_lock) |
491 | /* We've invoked the collector while a GC is already in progress. | |
492 | That should never happen. */ | |
493 | abort (); | |
0f2d19dd JB |
494 | |
495 | ++scm_gc_heap_lock; | |
ab4bef85 JB |
496 | |
497 | scm_weak_vectors = SCM_EOL; | |
0f2d19dd | 498 | |
0493cd89 MD |
499 | scm_guardian_gc_init (); |
500 | ||
0f2d19dd JB |
501 | /* unprotect any struct types with no instances */ |
502 | #if 0 | |
503 | { | |
504 | SCM type_list; | |
505 | SCM * pos; | |
506 | ||
507 | pos = &scm_type_obj_list; | |
508 | type_list = scm_type_obj_list; | |
509 | while (type_list != SCM_EOL) | |
510 | if (SCM_VELTS (SCM_CAR (type_list))[scm_struct_i_refcnt]) | |
511 | { | |
24e68a57 | 512 | pos = SCM_CDRLOC (type_list); |
0f2d19dd JB |
513 | type_list = SCM_CDR (type_list); |
514 | } | |
515 | else | |
516 | { | |
517 | *pos = SCM_CDR (type_list); | |
518 | type_list = SCM_CDR (type_list); | |
519 | } | |
520 | } | |
521 | #endif | |
522 | ||
523 | /* flush dead entries from the continuation stack */ | |
524 | { | |
525 | int x; | |
526 | int bound; | |
527 | SCM * elts; | |
528 | elts = SCM_VELTS (scm_continuation_stack); | |
529 | bound = SCM_LENGTH (scm_continuation_stack); | |
530 | x = SCM_INUM (scm_continuation_stack_ptr); | |
531 | while (x < bound) | |
532 | { | |
533 | elts[x] = SCM_BOOL_F; | |
534 | ++x; | |
535 | } | |
536 | } | |
537 | ||
42db06f0 MD |
538 | #ifndef USE_THREADS |
539 | ||
0f2d19dd JB |
540 | /* Protect from the C stack. This must be the first marking |
541 | * done because it provides information about what objects | |
542 | * are "in-use" by the C code. "in-use" objects are those | |
543 | * for which the values from SCM_LENGTH and SCM_CHARS must remain | |
544 | * usable. This requirement is stricter than a liveness | |
545 | * requirement -- in particular, it constrains the implementation | |
546 | * of scm_vector_set_length_x. | |
547 | */ | |
548 | SCM_FLUSH_REGISTER_WINDOWS; | |
549 | /* This assumes that all registers are saved into the jmp_buf */ | |
550 | setjmp (scm_save_regs_gc_mark); | |
551 | scm_mark_locations ((SCM_STACKITEM *) scm_save_regs_gc_mark, | |
ce4a361d JB |
552 | ( (scm_sizet) (sizeof (SCM_STACKITEM) - 1 + |
553 | sizeof scm_save_regs_gc_mark) | |
554 | / sizeof (SCM_STACKITEM))); | |
0f2d19dd JB |
555 | |
556 | { | |
557 | /* stack_len is long rather than scm_sizet in order to guarantee that | |
558 | &stack_len is long aligned */ | |
559 | #ifdef SCM_STACK_GROWS_UP | |
560 | #ifdef nosve | |
561 | long stack_len = (SCM_STACKITEM *) (&stack_len) - scm_stack_base; | |
562 | #else | |
563 | long stack_len = scm_stack_size (scm_stack_base); | |
564 | #endif | |
565 | scm_mark_locations (scm_stack_base, (scm_sizet) stack_len); | |
566 | #else | |
567 | #ifdef nosve | |
568 | long stack_len = scm_stack_base - (SCM_STACKITEM *) (&stack_len); | |
569 | #else | |
570 | long stack_len = scm_stack_size (scm_stack_base); | |
571 | #endif | |
572 | scm_mark_locations ((scm_stack_base - stack_len), (scm_sizet) stack_len); | |
573 | #endif | |
574 | } | |
575 | ||
42db06f0 MD |
576 | #else /* USE_THREADS */ |
577 | ||
578 | /* Mark every thread's stack and registers */ | |
579 | scm_threads_mark_stacks(); | |
580 | ||
581 | #endif /* USE_THREADS */ | |
0f2d19dd JB |
582 | |
583 | /* FIXME: insert a phase to un-protect string-data preserved | |
584 | * in scm_vector_set_length_x. | |
585 | */ | |
586 | ||
587 | j = SCM_NUM_PROTECTS; | |
588 | while (j--) | |
589 | scm_gc_mark (scm_sys_protects[j]); | |
590 | ||
9de33deb MD |
591 | /* FIXME: we should have a means to register C functions to be run |
592 | * in different phases of GC | |
593 | */ | |
594 | scm_mark_subr_table (); | |
595 | ||
42db06f0 MD |
596 | #ifndef USE_THREADS |
597 | scm_gc_mark (scm_root->handle); | |
598 | #endif | |
0f2d19dd JB |
599 | |
600 | scm_mark_weak_vector_spines (); | |
601 | ||
0493cd89 MD |
602 | scm_guardian_zombify (); |
603 | ||
0f2d19dd JB |
604 | scm_gc_sweep (); |
605 | ||
606 | --scm_gc_heap_lock; | |
607 | scm_gc_end (); | |
42db06f0 MD |
608 | |
609 | #ifdef USE_THREADS | |
610 | SCM_THREAD_CRITICAL_SECTION_END; | |
611 | #endif | |
0f2d19dd JB |
612 | } |
613 | ||
614 | \f | |
615 | /* {Mark/Sweep} | |
616 | */ | |
617 | ||
618 | ||
619 | ||
620 | /* Mark an object precisely. | |
621 | */ | |
0f2d19dd | 622 | void |
1bbd0b84 | 623 | scm_gc_mark (SCM p) |
0f2d19dd JB |
624 | { |
625 | register long i; | |
626 | register SCM ptr; | |
627 | ||
628 | ptr = p; | |
629 | ||
630 | gc_mark_loop: | |
631 | if (SCM_IMP (ptr)) | |
632 | return; | |
633 | ||
634 | gc_mark_nimp: | |
635 | if (SCM_NCELLP (ptr)) | |
f8392303 | 636 | scm_wta (ptr, "rogue pointer in heap", NULL); |
0f2d19dd JB |
637 | |
638 | switch (SCM_TYP7 (ptr)) | |
639 | { | |
640 | case scm_tcs_cons_nimcar: | |
641 | if (SCM_GCMARKP (ptr)) | |
642 | break; | |
643 | SCM_SETGCMARK (ptr); | |
644 | if (SCM_IMP (SCM_CDR (ptr))) /* SCM_IMP works even with a GC mark */ | |
645 | { | |
646 | ptr = SCM_CAR (ptr); | |
647 | goto gc_mark_nimp; | |
648 | } | |
649 | scm_gc_mark (SCM_CAR (ptr)); | |
650 | ptr = SCM_GCCDR (ptr); | |
651 | goto gc_mark_nimp; | |
652 | case scm_tcs_cons_imcar: | |
e641afaf | 653 | case scm_tc7_pws: |
0f2d19dd JB |
654 | if (SCM_GCMARKP (ptr)) |
655 | break; | |
656 | SCM_SETGCMARK (ptr); | |
657 | ptr = SCM_GCCDR (ptr); | |
658 | goto gc_mark_loop; | |
659 | case scm_tcs_cons_gloc: | |
660 | if (SCM_GCMARKP (ptr)) | |
661 | break; | |
662 | SCM_SETGCMARK (ptr); | |
663 | { | |
664 | SCM vcell; | |
665 | vcell = SCM_CAR (ptr) - 1L; | |
666 | switch (SCM_CDR (vcell)) | |
667 | { | |
668 | default: | |
669 | scm_gc_mark (vcell); | |
670 | ptr = SCM_GCCDR (ptr); | |
671 | goto gc_mark_loop; | |
672 | case 1: /* ! */ | |
673 | case 0: /* ! */ | |
674 | { | |
675 | SCM layout; | |
676 | SCM * vtable_data; | |
677 | int len; | |
678 | char * fields_desc; | |
ad75306c MD |
679 | register SCM * mem; |
680 | register int x; | |
0f2d19dd JB |
681 | |
682 | vtable_data = (SCM *)vcell; | |
4bfdf158 | 683 | layout = vtable_data[scm_vtable_index_layout]; |
0f2d19dd JB |
684 | len = SCM_LENGTH (layout); |
685 | fields_desc = SCM_CHARS (layout); | |
14d1400f JB |
686 | /* We're using SCM_GCCDR here like STRUCT_DATA, except |
687 | that it removes the mark */ | |
688 | mem = (SCM *)SCM_GCCDR (ptr); | |
0f2d19dd | 689 | |
aa0761ec MD |
690 | if (vtable_data[scm_struct_i_flags] & SCM_STRUCTF_ENTITY) |
691 | { | |
73e10adf | 692 | scm_gc_mark (mem[scm_struct_i_procedure]); |
e641afaf | 693 | scm_gc_mark (mem[scm_struct_i_setter]); |
aa0761ec | 694 | } |
ad75306c MD |
695 | if (len) |
696 | { | |
697 | for (x = 0; x < len - 2; x += 2, ++mem) | |
698 | if (fields_desc[x] == 'p') | |
699 | scm_gc_mark (*mem); | |
700 | if (fields_desc[x] == 'p') | |
701 | { | |
702 | if (SCM_LAYOUT_TAILP (fields_desc[x + 1])) | |
703 | for (x = *mem; x; --x) | |
704 | scm_gc_mark (*++mem); | |
705 | else | |
706 | scm_gc_mark (*mem); | |
707 | } | |
708 | } | |
0f2d19dd JB |
709 | if (!SCM_CDR (vcell)) |
710 | { | |
711 | SCM_SETGCMARK (vcell); | |
4bfdf158 | 712 | ptr = vtable_data[scm_vtable_index_vtable]; |
0f2d19dd JB |
713 | goto gc_mark_loop; |
714 | } | |
715 | } | |
716 | } | |
717 | } | |
718 | break; | |
719 | case scm_tcs_closures: | |
720 | if (SCM_GCMARKP (ptr)) | |
721 | break; | |
722 | SCM_SETGCMARK (ptr); | |
723 | if (SCM_IMP (SCM_CDR (ptr))) | |
724 | { | |
725 | ptr = SCM_CLOSCAR (ptr); | |
726 | goto gc_mark_nimp; | |
727 | } | |
728 | scm_gc_mark (SCM_CLOSCAR (ptr)); | |
729 | ptr = SCM_GCCDR (ptr); | |
730 | goto gc_mark_nimp; | |
731 | case scm_tc7_vector: | |
732 | case scm_tc7_lvector: | |
733 | #ifdef CCLO | |
734 | case scm_tc7_cclo: | |
735 | #endif | |
736 | if (SCM_GC8MARKP (ptr)) | |
737 | break; | |
738 | SCM_SETGC8MARK (ptr); | |
739 | i = SCM_LENGTH (ptr); | |
740 | if (i == 0) | |
741 | break; | |
742 | while (--i > 0) | |
743 | if (SCM_NIMP (SCM_VELTS (ptr)[i])) | |
744 | scm_gc_mark (SCM_VELTS (ptr)[i]); | |
745 | ptr = SCM_VELTS (ptr)[0]; | |
746 | goto gc_mark_loop; | |
747 | case scm_tc7_contin: | |
748 | if SCM_GC8MARKP | |
749 | (ptr) break; | |
750 | SCM_SETGC8MARK (ptr); | |
c68296f8 MV |
751 | if (SCM_VELTS (ptr)) |
752 | scm_mark_locations (SCM_VELTS (ptr), | |
753 | (scm_sizet) | |
754 | (SCM_LENGTH (ptr) + | |
755 | (sizeof (SCM_STACKITEM) + -1 + | |
756 | sizeof (scm_contregs)) / | |
757 | sizeof (SCM_STACKITEM))); | |
0f2d19dd | 758 | break; |
afe5177e | 759 | #ifdef HAVE_ARRAYS |
0f2d19dd JB |
760 | case scm_tc7_bvect: |
761 | case scm_tc7_byvect: | |
762 | case scm_tc7_ivect: | |
763 | case scm_tc7_uvect: | |
764 | case scm_tc7_fvect: | |
765 | case scm_tc7_dvect: | |
766 | case scm_tc7_cvect: | |
767 | case scm_tc7_svect: | |
5c11cc9d | 768 | #ifdef HAVE_LONG_LONGS |
0f2d19dd JB |
769 | case scm_tc7_llvect: |
770 | #endif | |
afe5177e | 771 | #endif |
0f2d19dd | 772 | case scm_tc7_string: |
0f2d19dd JB |
773 | SCM_SETGC8MARK (ptr); |
774 | break; | |
775 | ||
776 | case scm_tc7_substring: | |
0f2d19dd JB |
777 | if (SCM_GC8MARKP(ptr)) |
778 | break; | |
779 | SCM_SETGC8MARK (ptr); | |
780 | ptr = SCM_CDR (ptr); | |
781 | goto gc_mark_loop; | |
782 | ||
783 | case scm_tc7_wvect: | |
784 | if (SCM_GC8MARKP(ptr)) | |
785 | break; | |
ab4bef85 JB |
786 | SCM_WVECT_GC_CHAIN (ptr) = scm_weak_vectors; |
787 | scm_weak_vectors = ptr; | |
0f2d19dd JB |
788 | SCM_SETGC8MARK (ptr); |
789 | if (SCM_IS_WHVEC_ANY (ptr)) | |
790 | { | |
791 | int x; | |
792 | int len; | |
793 | int weak_keys; | |
794 | int weak_values; | |
795 | ||
796 | len = SCM_LENGTH (ptr); | |
797 | weak_keys = SCM_IS_WHVEC (ptr) || SCM_IS_WHVEC_B (ptr); | |
798 | weak_values = SCM_IS_WHVEC_V (ptr) || SCM_IS_WHVEC_B (ptr); | |
799 | ||
800 | for (x = 0; x < len; ++x) | |
801 | { | |
802 | SCM alist; | |
803 | alist = SCM_VELTS (ptr)[x]; | |
46408039 JB |
804 | |
805 | /* mark everything on the alist except the keys or | |
806 | * values, according to weak_values and weak_keys. */ | |
0f2d19dd JB |
807 | while ( SCM_NIMP (alist) |
808 | && SCM_CONSP (alist) | |
809 | && !SCM_GCMARKP (alist) | |
810 | && SCM_NIMP (SCM_CAR (alist)) | |
811 | && SCM_CONSP (SCM_CAR (alist))) | |
812 | { | |
813 | SCM kvpair; | |
814 | SCM next_alist; | |
815 | ||
816 | kvpair = SCM_CAR (alist); | |
817 | next_alist = SCM_CDR (alist); | |
818 | /* | |
819 | * Do not do this: | |
820 | * SCM_SETGCMARK (alist); | |
821 | * SCM_SETGCMARK (kvpair); | |
822 | * | |
823 | * It may be that either the key or value is protected by | |
824 | * an escaped reference to part of the spine of this alist. | |
825 | * If we mark the spine here, and only mark one or neither of the | |
826 | * key and value, they may never be properly marked. | |
827 | * This leads to a horrible situation in which an alist containing | |
828 | * freelist cells is exported. | |
829 | * | |
830 | * So only mark the spines of these arrays last of all marking. | |
831 | * If somebody confuses us by constructing a weak vector | |
832 | * with a circular alist then we are hosed, but at least we | |
833 | * won't prematurely drop table entries. | |
834 | */ | |
835 | if (!weak_keys) | |
836 | scm_gc_mark (SCM_CAR (kvpair)); | |
837 | if (!weak_values) | |
838 | scm_gc_mark (SCM_GCCDR (kvpair)); | |
839 | alist = next_alist; | |
840 | } | |
841 | if (SCM_NIMP (alist)) | |
842 | scm_gc_mark (alist); | |
843 | } | |
844 | } | |
845 | break; | |
846 | ||
847 | case scm_tc7_msymbol: | |
848 | if (SCM_GC8MARKP(ptr)) | |
849 | break; | |
850 | SCM_SETGC8MARK (ptr); | |
851 | scm_gc_mark (SCM_SYMBOL_FUNC (ptr)); | |
852 | ptr = SCM_SYMBOL_PROPS (ptr); | |
853 | goto gc_mark_loop; | |
854 | case scm_tc7_ssymbol: | |
855 | if (SCM_GC8MARKP(ptr)) | |
856 | break; | |
857 | SCM_SETGC8MARK (ptr); | |
858 | break; | |
859 | case scm_tcs_subrs: | |
9de33deb | 860 | break; |
0f2d19dd JB |
861 | case scm_tc7_port: |
862 | i = SCM_PTOBNUM (ptr); | |
863 | if (!(i < scm_numptob)) | |
864 | goto def; | |
865 | if (SCM_GC8MARKP (ptr)) | |
866 | break; | |
dc53f026 | 867 | SCM_SETGC8MARK (ptr); |
ebf7394e GH |
868 | if (SCM_PTAB_ENTRY(ptr)) |
869 | scm_gc_mark (SCM_PTAB_ENTRY(ptr)->file_name); | |
dc53f026 JB |
870 | if (scm_ptobs[i].mark) |
871 | { | |
872 | ptr = (scm_ptobs[i].mark) (ptr); | |
873 | goto gc_mark_loop; | |
874 | } | |
875 | else | |
876 | return; | |
0f2d19dd JB |
877 | break; |
878 | case scm_tc7_smob: | |
879 | if (SCM_GC8MARKP (ptr)) | |
880 | break; | |
dc53f026 JB |
881 | SCM_SETGC8MARK (ptr); |
882 | switch SCM_GCTYP16 (ptr) | |
0f2d19dd JB |
883 | { /* should be faster than going through scm_smobs */ |
884 | case scm_tc_free_cell: | |
885 | /* printf("found free_cell %X ", ptr); fflush(stdout); */ | |
1bbd0b84 GB |
886 | break; |
887 | case scm_tc16_allocated: | |
888 | SCM_SETGC8MARK (ptr); | |
0f2d19dd JB |
889 | break; |
890 | case scm_tcs_bignums: | |
891 | case scm_tc16_flo: | |
0f2d19dd JB |
892 | break; |
893 | default: | |
894 | i = SCM_SMOBNUM (ptr); | |
895 | if (!(i < scm_numsmob)) | |
896 | goto def; | |
dc53f026 JB |
897 | if (scm_smobs[i].mark) |
898 | { | |
899 | ptr = (scm_smobs[i].mark) (ptr); | |
900 | goto gc_mark_loop; | |
901 | } | |
902 | else | |
903 | return; | |
0f2d19dd JB |
904 | } |
905 | break; | |
906 | default: | |
907 | def:scm_wta (ptr, "unknown type in ", "gc_mark"); | |
908 | } | |
909 | } | |
910 | ||
911 | ||
912 | /* Mark a Region Conservatively | |
913 | */ | |
914 | ||
0f2d19dd | 915 | void |
6e8d25a6 | 916 | scm_mark_locations (SCM_STACKITEM x[], scm_sizet n) |
0f2d19dd JB |
917 | { |
918 | register long m = n; | |
919 | register int i, j; | |
920 | register SCM_CELLPTR ptr; | |
921 | ||
922 | while (0 <= --m) | |
923 | if SCM_CELLP (*(SCM **) & x[m]) | |
924 | { | |
925 | ptr = (SCM_CELLPTR) SCM2PTR ((*(SCM **) & x[m])); | |
926 | i = 0; | |
927 | j = scm_n_heap_segs - 1; | |
928 | if ( SCM_PTR_LE (scm_heap_table[i].bounds[0], ptr) | |
929 | && SCM_PTR_GT (scm_heap_table[j].bounds[1], ptr)) | |
930 | { | |
931 | while (i <= j) | |
932 | { | |
933 | int seg_id; | |
934 | seg_id = -1; | |
935 | if ( (i == j) | |
936 | || SCM_PTR_GT (scm_heap_table[i].bounds[1], ptr)) | |
937 | seg_id = i; | |
938 | else if (SCM_PTR_LE (scm_heap_table[j].bounds[0], ptr)) | |
939 | seg_id = j; | |
940 | else | |
941 | { | |
942 | int k; | |
943 | k = (i + j) / 2; | |
944 | if (k == i) | |
945 | break; | |
946 | if (SCM_PTR_GT (scm_heap_table[k].bounds[1], ptr)) | |
947 | { | |
948 | j = k; | |
949 | ++i; | |
950 | if (SCM_PTR_LE (scm_heap_table[i].bounds[0], ptr)) | |
951 | continue; | |
952 | else | |
953 | break; | |
954 | } | |
955 | else if (SCM_PTR_LE (scm_heap_table[k].bounds[0], ptr)) | |
956 | { | |
957 | i = k; | |
958 | --j; | |
959 | if (SCM_PTR_GT (scm_heap_table[j].bounds[1], ptr)) | |
960 | continue; | |
961 | else | |
962 | break; | |
963 | } | |
964 | } | |
965 | if ( !scm_heap_table[seg_id].valid | |
966 | || scm_heap_table[seg_id].valid (ptr, | |
967 | &scm_heap_table[seg_id])) | |
968 | scm_gc_mark (*(SCM *) & x[m]); | |
969 | break; | |
970 | } | |
971 | ||
972 | } | |
973 | } | |
974 | } | |
975 | ||
976 | ||
2e11a577 MD |
977 | /* The following is a C predicate which determines if an SCM value can be |
978 | regarded as a pointer to a cell on the heap. The code is duplicated | |
979 | from scm_mark_locations. */ | |
980 | ||
1cc91f1b | 981 | |
2e11a577 | 982 | int |
6e8d25a6 | 983 | scm_cellp (SCM value) |
2e11a577 MD |
984 | { |
985 | register int i, j; | |
986 | register SCM_CELLPTR ptr; | |
987 | ||
988 | if SCM_CELLP (*(SCM **) & value) | |
989 | { | |
990 | ptr = (SCM_CELLPTR) SCM2PTR ((*(SCM **) & value)); | |
991 | i = 0; | |
992 | j = scm_n_heap_segs - 1; | |
993 | if ( SCM_PTR_LE (scm_heap_table[i].bounds[0], ptr) | |
994 | && SCM_PTR_GT (scm_heap_table[j].bounds[1], ptr)) | |
995 | { | |
996 | while (i <= j) | |
997 | { | |
998 | int seg_id; | |
999 | seg_id = -1; | |
1000 | if ( (i == j) | |
1001 | || SCM_PTR_GT (scm_heap_table[i].bounds[1], ptr)) | |
1002 | seg_id = i; | |
1003 | else if (SCM_PTR_LE (scm_heap_table[j].bounds[0], ptr)) | |
1004 | seg_id = j; | |
1005 | else | |
1006 | { | |
1007 | int k; | |
1008 | k = (i + j) / 2; | |
1009 | if (k == i) | |
1010 | break; | |
1011 | if (SCM_PTR_GT (scm_heap_table[k].bounds[1], ptr)) | |
1012 | { | |
1013 | j = k; | |
1014 | ++i; | |
1015 | if (SCM_PTR_LE (scm_heap_table[i].bounds[0], ptr)) | |
1016 | continue; | |
1017 | else | |
1018 | break; | |
1019 | } | |
1020 | else if (SCM_PTR_LE (scm_heap_table[k].bounds[0], ptr)) | |
1021 | { | |
1022 | i = k; | |
1023 | --j; | |
1024 | if (SCM_PTR_GT (scm_heap_table[j].bounds[1], ptr)) | |
1025 | continue; | |
1026 | else | |
1027 | break; | |
1028 | } | |
1029 | } | |
1030 | if ( !scm_heap_table[seg_id].valid | |
1031 | || scm_heap_table[seg_id].valid (ptr, | |
1032 | &scm_heap_table[seg_id])) | |
1033 | return 1; | |
1034 | break; | |
1035 | } | |
1036 | ||
1037 | } | |
1038 | } | |
1039 | return 0; | |
1040 | } | |
1041 | ||
1042 | ||
3b2b8760 | 1043 | static void |
0f2d19dd | 1044 | scm_mark_weak_vector_spines () |
0f2d19dd | 1045 | { |
ab4bef85 | 1046 | SCM w; |
0f2d19dd | 1047 | |
ab4bef85 | 1048 | for (w = scm_weak_vectors; w != SCM_EOL; w = SCM_WVECT_GC_CHAIN (w)) |
0f2d19dd | 1049 | { |
ab4bef85 | 1050 | if (SCM_IS_WHVEC_ANY (w)) |
0f2d19dd JB |
1051 | { |
1052 | SCM *ptr; | |
1053 | SCM obj; | |
1054 | int j; | |
1055 | int n; | |
1056 | ||
ab4bef85 JB |
1057 | obj = w; |
1058 | ptr = SCM_VELTS (w); | |
1059 | n = SCM_LENGTH (w); | |
0f2d19dd JB |
1060 | for (j = 0; j < n; ++j) |
1061 | { | |
1062 | SCM alist; | |
1063 | ||
1064 | alist = ptr[j]; | |
1065 | while ( SCM_NIMP (alist) | |
1066 | && SCM_CONSP (alist) | |
1067 | && !SCM_GCMARKP (alist) | |
1068 | && SCM_NIMP (SCM_CAR (alist)) | |
1069 | && SCM_CONSP (SCM_CAR (alist))) | |
1070 | { | |
1071 | SCM_SETGCMARK (alist); | |
1072 | SCM_SETGCMARK (SCM_CAR (alist)); | |
1073 | alist = SCM_GCCDR (alist); | |
1074 | } | |
1075 | } | |
1076 | } | |
1077 | } | |
1078 | } | |
1079 | ||
1080 | ||
1081 | ||
0f2d19dd JB |
1082 | void |
1083 | scm_gc_sweep () | |
0f2d19dd JB |
1084 | { |
1085 | register SCM_CELLPTR ptr; | |
1086 | #ifdef SCM_POINTERS_MUNGED | |
1087 | register SCM scmptr; | |
1088 | #else | |
1089 | #undef scmptr | |
1090 | #define scmptr (SCM)ptr | |
1091 | #endif | |
1092 | register SCM nfreelist; | |
1093 | register SCM *hp_freelist; | |
0f2d19dd | 1094 | register long m; |
0f2d19dd | 1095 | register int span; |
15e9d186 | 1096 | long i; |
0f2d19dd JB |
1097 | scm_sizet seg_size; |
1098 | ||
0f2d19dd | 1099 | m = 0; |
0f2d19dd | 1100 | |
cf2d30f6 JB |
1101 | /* Reset all free list pointers. We'll reconstruct them completely |
1102 | while scanning. */ | |
1103 | for (i = 0; i < scm_n_heap_segs; i++) | |
1104 | *scm_heap_table[i].freelistp = SCM_EOL; | |
1105 | ||
1106 | for (i = 0; i < scm_n_heap_segs; i++) | |
0f2d19dd | 1107 | { |
15e9d186 JB |
1108 | register scm_sizet n = 0; |
1109 | register scm_sizet j; | |
1110 | ||
cf2d30f6 JB |
1111 | /* Unmarked cells go onto the front of the freelist this heap |
1112 | segment points to. Rather than updating the real freelist | |
1113 | pointer as we go along, we accumulate the new head in | |
1114 | nfreelist. Then, if it turns out that the entire segment is | |
1115 | free, we free (i.e., malloc's free) the whole segment, and | |
1116 | simply don't assign nfreelist back into the real freelist. */ | |
0f2d19dd | 1117 | hp_freelist = scm_heap_table[i].freelistp; |
cf2d30f6 JB |
1118 | nfreelist = *hp_freelist; |
1119 | ||
0f2d19dd JB |
1120 | span = scm_heap_table[i].ncells; |
1121 | ptr = CELL_UP (scm_heap_table[i].bounds[0]); | |
1122 | seg_size = CELL_DN (scm_heap_table[i].bounds[1]) - ptr; | |
0f2d19dd JB |
1123 | for (j = seg_size + span; j -= span; ptr += span) |
1124 | { | |
1125 | #ifdef SCM_POINTERS_MUNGED | |
1126 | scmptr = PTR2SCM (ptr); | |
1127 | #endif | |
1128 | switch SCM_TYP7 (scmptr) | |
1129 | { | |
1130 | case scm_tcs_cons_gloc: | |
1131 | if (SCM_GCMARKP (scmptr)) | |
1132 | { | |
1133 | if (SCM_CDR (SCM_CAR (scmptr) - 1) == (SCM)1) | |
24e68a57 | 1134 | SCM_SETCDR (SCM_CAR (scmptr) - 1, (SCM) 0); |
0f2d19dd JB |
1135 | goto cmrkcontinue; |
1136 | } | |
1137 | { | |
1138 | SCM vcell; | |
1139 | vcell = SCM_CAR (scmptr) - 1L; | |
1140 | ||
1141 | if ((SCM_CDR (vcell) == 0) || (SCM_CDR (vcell) == 1)) | |
1142 | { | |
f0cb1733 MD |
1143 | scm_struct_free_t free |
1144 | = (scm_struct_free_t) ((SCM*) vcell)[scm_struct_i_free]; | |
1145 | m += free ((SCM *) vcell, (SCM *) SCM_GCCDR (scmptr)); | |
0f2d19dd JB |
1146 | } |
1147 | } | |
1148 | break; | |
1149 | case scm_tcs_cons_imcar: | |
1150 | case scm_tcs_cons_nimcar: | |
1151 | case scm_tcs_closures: | |
e641afaf | 1152 | case scm_tc7_pws: |
0f2d19dd JB |
1153 | if (SCM_GCMARKP (scmptr)) |
1154 | goto cmrkcontinue; | |
1155 | break; | |
1156 | case scm_tc7_wvect: | |
1157 | if (SCM_GC8MARKP (scmptr)) | |
1158 | { | |
1159 | goto c8mrkcontinue; | |
1160 | } | |
1161 | else | |
1162 | { | |
ab4bef85 JB |
1163 | m += (2 + SCM_LENGTH (scmptr)) * sizeof (SCM); |
1164 | scm_must_free ((char *)(SCM_VELTS (scmptr) - 2)); | |
0f2d19dd JB |
1165 | break; |
1166 | } | |
1167 | ||
1168 | case scm_tc7_vector: | |
1169 | case scm_tc7_lvector: | |
1170 | #ifdef CCLO | |
1171 | case scm_tc7_cclo: | |
1172 | #endif | |
1173 | if (SCM_GC8MARKP (scmptr)) | |
1174 | goto c8mrkcontinue; | |
1175 | ||
1176 | m += (SCM_LENGTH (scmptr) * sizeof (SCM)); | |
1177 | freechars: | |
1178 | scm_must_free (SCM_CHARS (scmptr)); | |
1179 | /* SCM_SETCHARS(scmptr, 0);*/ | |
1180 | break; | |
afe5177e | 1181 | #ifdef HAVE_ARRAYS |
0f2d19dd JB |
1182 | case scm_tc7_bvect: |
1183 | if SCM_GC8MARKP (scmptr) | |
1184 | goto c8mrkcontinue; | |
1185 | m += sizeof (long) * ((SCM_HUGE_LENGTH (scmptr) + SCM_LONG_BIT - 1) / SCM_LONG_BIT); | |
1186 | goto freechars; | |
1187 | case scm_tc7_byvect: | |
1188 | if SCM_GC8MARKP (scmptr) | |
1189 | goto c8mrkcontinue; | |
1190 | m += SCM_HUGE_LENGTH (scmptr) * sizeof (char); | |
1191 | goto freechars; | |
1192 | case scm_tc7_ivect: | |
1193 | case scm_tc7_uvect: | |
1194 | if SCM_GC8MARKP (scmptr) | |
1195 | goto c8mrkcontinue; | |
1196 | m += SCM_HUGE_LENGTH (scmptr) * sizeof (long); | |
1197 | goto freechars; | |
1198 | case scm_tc7_svect: | |
1199 | if SCM_GC8MARKP (scmptr) | |
1200 | goto c8mrkcontinue; | |
1201 | m += SCM_HUGE_LENGTH (scmptr) * sizeof (short); | |
1202 | goto freechars; | |
5c11cc9d | 1203 | #ifdef HAVE_LONG_LONGS |
0f2d19dd JB |
1204 | case scm_tc7_llvect: |
1205 | if SCM_GC8MARKP (scmptr) | |
1206 | goto c8mrkcontinue; | |
1207 | m += SCM_HUGE_LENGTH (scmptr) * sizeof (long_long); | |
1208 | goto freechars; | |
1209 | #endif | |
1210 | case scm_tc7_fvect: | |
1211 | if SCM_GC8MARKP (scmptr) | |
1212 | goto c8mrkcontinue; | |
1213 | m += SCM_HUGE_LENGTH (scmptr) * sizeof (float); | |
1214 | goto freechars; | |
1215 | case scm_tc7_dvect: | |
1216 | if SCM_GC8MARKP (scmptr) | |
1217 | goto c8mrkcontinue; | |
1218 | m += SCM_HUGE_LENGTH (scmptr) * sizeof (double); | |
1219 | goto freechars; | |
1220 | case scm_tc7_cvect: | |
1221 | if SCM_GC8MARKP (scmptr) | |
1222 | goto c8mrkcontinue; | |
1223 | m += SCM_HUGE_LENGTH (scmptr) * 2 * sizeof (double); | |
1224 | goto freechars; | |
afe5177e | 1225 | #endif |
0f2d19dd | 1226 | case scm_tc7_substring: |
0f2d19dd JB |
1227 | if (SCM_GC8MARKP (scmptr)) |
1228 | goto c8mrkcontinue; | |
1229 | break; | |
1230 | case scm_tc7_string: | |
0f2d19dd JB |
1231 | if (SCM_GC8MARKP (scmptr)) |
1232 | goto c8mrkcontinue; | |
1233 | m += SCM_HUGE_LENGTH (scmptr) + 1; | |
1234 | goto freechars; | |
1235 | case scm_tc7_msymbol: | |
1236 | if (SCM_GC8MARKP (scmptr)) | |
1237 | goto c8mrkcontinue; | |
1238 | m += ( SCM_LENGTH (scmptr) | |
1239 | + 1 | |
1240 | + sizeof (SCM) * ((SCM *)SCM_CHARS (scmptr) - SCM_SLOTS(scmptr))); | |
1241 | scm_must_free ((char *)SCM_SLOTS (scmptr)); | |
1242 | break; | |
1243 | case scm_tc7_contin: | |
1244 | if SCM_GC8MARKP (scmptr) | |
1245 | goto c8mrkcontinue; | |
0db18cf4 | 1246 | m += SCM_LENGTH (scmptr) * sizeof (SCM_STACKITEM) + sizeof (scm_contregs); |
c68296f8 MV |
1247 | if (SCM_VELTS (scmptr)) |
1248 | goto freechars; | |
0f2d19dd JB |
1249 | case scm_tc7_ssymbol: |
1250 | if SCM_GC8MARKP(scmptr) | |
1251 | goto c8mrkcontinue; | |
1252 | break; | |
1253 | case scm_tcs_subrs: | |
1254 | continue; | |
1255 | case scm_tc7_port: | |
1256 | if SCM_GC8MARKP (scmptr) | |
1257 | goto c8mrkcontinue; | |
1258 | if SCM_OPENP (scmptr) | |
1259 | { | |
1260 | int k = SCM_PTOBNUM (scmptr); | |
1261 | if (!(k < scm_numptob)) | |
1262 | goto sweeperr; | |
1263 | /* Keep "revealed" ports alive. */ | |
1264 | if (scm_revealed_count(scmptr) > 0) | |
1265 | continue; | |
1266 | /* Yes, I really do mean scm_ptobs[k].free */ | |
1267 | /* rather than ftobs[k].close. .close */ | |
1268 | /* is for explicit CLOSE-PORT by user */ | |
84af0382 | 1269 | m += (scm_ptobs[k].free) (scmptr); |
0f2d19dd JB |
1270 | SCM_SETSTREAM (scmptr, 0); |
1271 | scm_remove_from_port_table (scmptr); | |
1272 | scm_gc_ports_collected++; | |
24e68a57 | 1273 | SCM_SETAND_CAR (scmptr, ~SCM_OPN); |
0f2d19dd JB |
1274 | } |
1275 | break; | |
1276 | case scm_tc7_smob: | |
1277 | switch SCM_GCTYP16 (scmptr) | |
1278 | { | |
1279 | case scm_tc_free_cell: | |
1280 | if SCM_GC8MARKP (scmptr) | |
1281 | goto c8mrkcontinue; | |
1282 | break; | |
1283 | #ifdef SCM_BIGDIG | |
1284 | case scm_tcs_bignums: | |
1285 | if SCM_GC8MARKP (scmptr) | |
1286 | goto c8mrkcontinue; | |
1287 | m += (SCM_NUMDIGS (scmptr) * SCM_BITSPERDIG / SCM_CHAR_BIT); | |
1288 | goto freechars; | |
1289 | #endif /* def SCM_BIGDIG */ | |
1290 | case scm_tc16_flo: | |
1291 | if SCM_GC8MARKP (scmptr) | |
1292 | goto c8mrkcontinue; | |
1293 | switch ((int) (SCM_CAR (scmptr) >> 16)) | |
1294 | { | |
1295 | case (SCM_IMAG_PART | SCM_REAL_PART) >> 16: | |
1296 | m += sizeof (double); | |
1297 | case SCM_REAL_PART >> 16: | |
1298 | case SCM_IMAG_PART >> 16: | |
1299 | m += sizeof (double); | |
1300 | goto freechars; | |
1301 | case 0: | |
1302 | break; | |
1303 | default: | |
1304 | goto sweeperr; | |
1305 | } | |
1306 | break; | |
1307 | default: | |
1308 | if SCM_GC8MARKP (scmptr) | |
1309 | goto c8mrkcontinue; | |
1310 | ||
1311 | { | |
1312 | int k; | |
1313 | k = SCM_SMOBNUM (scmptr); | |
1314 | if (!(k < scm_numsmob)) | |
1315 | goto sweeperr; | |
1316 | m += (scm_smobs[k].free) ((SCM) scmptr); | |
1317 | break; | |
1318 | } | |
1319 | } | |
1320 | break; | |
1321 | default: | |
1322 | sweeperr:scm_wta (scmptr, "unknown type in ", "gc_sweep"); | |
1323 | } | |
1324 | n += span; | |
1325 | #if 0 | |
1326 | if (SCM_CAR (scmptr) == (SCM) scm_tc_free_cell) | |
1327 | exit (2); | |
1328 | #endif | |
e7c5fb37 JB |
1329 | /* Stick the new cell on the front of nfreelist. It's |
1330 | critical that we mark this cell as freed; otherwise, the | |
1331 | conservative collector might trace it as some other type | |
1332 | of object. */ | |
24e68a57 MD |
1333 | SCM_SETCAR (scmptr, (SCM) scm_tc_free_cell); |
1334 | SCM_SETCDR (scmptr, nfreelist); | |
0f2d19dd | 1335 | nfreelist = scmptr; |
cf2d30f6 | 1336 | |
0f2d19dd JB |
1337 | continue; |
1338 | c8mrkcontinue: | |
1339 | SCM_CLRGC8MARK (scmptr); | |
1340 | continue; | |
1341 | cmrkcontinue: | |
1342 | SCM_CLRGCMARK (scmptr); | |
1343 | } | |
1344 | #ifdef GC_FREE_SEGMENTS | |
1345 | if (n == seg_size) | |
1346 | { | |
15e9d186 JB |
1347 | register long j; |
1348 | ||
0f2d19dd | 1349 | scm_heap_size -= seg_size; |
cf2d30f6 JB |
1350 | free ((char *) scm_heap_table[i].bounds[0]); |
1351 | scm_heap_table[i].bounds[0] = 0; | |
1352 | for (j = i + 1; j < scm_n_heap_segs; j++) | |
0f2d19dd JB |
1353 | scm_heap_table[j - 1] = scm_heap_table[j]; |
1354 | scm_n_heap_segs -= 1; | |
cf2d30f6 | 1355 | i--; /* We need to scan the segment just moved. */ |
0f2d19dd JB |
1356 | } |
1357 | else | |
1358 | #endif /* ifdef GC_FREE_SEGMENTS */ | |
cf2d30f6 JB |
1359 | /* Update the real freelist pointer to point to the head of |
1360 | the list of free cells we've built for this segment. */ | |
0f2d19dd JB |
1361 | *hp_freelist = nfreelist; |
1362 | ||
fca7547b | 1363 | #ifdef GUILE_DEBUG_FREELIST |
cf2d30f6 JB |
1364 | scm_check_freelist (); |
1365 | scm_map_free_list (); | |
1366 | #endif | |
1367 | ||
0f2d19dd | 1368 | scm_gc_cells_collected += n; |
0f2d19dd JB |
1369 | } |
1370 | /* Scan weak vectors. */ | |
1371 | { | |
ab4bef85 JB |
1372 | SCM *ptr, w; |
1373 | for (w = scm_weak_vectors; w != SCM_EOL; w = SCM_WVECT_GC_CHAIN (w)) | |
0f2d19dd | 1374 | { |
ab4bef85 | 1375 | if (!SCM_IS_WHVEC_ANY (w)) |
0f2d19dd | 1376 | { |
15e9d186 JB |
1377 | register long j, n; |
1378 | ||
ab4bef85 JB |
1379 | ptr = SCM_VELTS (w); |
1380 | n = SCM_LENGTH (w); | |
0f2d19dd | 1381 | for (j = 0; j < n; ++j) |
0c95b57d | 1382 | if (SCM_FREEP (ptr[j])) |
0f2d19dd JB |
1383 | ptr[j] = SCM_BOOL_F; |
1384 | } | |
1385 | else /* if (SCM_IS_WHVEC_ANY (scm_weak_vectors[i])) */ | |
1386 | { | |
ab4bef85 JB |
1387 | SCM obj = w; |
1388 | register long n = SCM_LENGTH (w); | |
15e9d186 JB |
1389 | register long j; |
1390 | ||
ab4bef85 | 1391 | ptr = SCM_VELTS (w); |
15e9d186 | 1392 | |
0f2d19dd JB |
1393 | for (j = 0; j < n; ++j) |
1394 | { | |
1395 | SCM * fixup; | |
1396 | SCM alist; | |
1397 | int weak_keys; | |
1398 | int weak_values; | |
1399 | ||
1400 | weak_keys = SCM_IS_WHVEC (obj) || SCM_IS_WHVEC_B (obj); | |
1401 | weak_values = SCM_IS_WHVEC_V (obj) || SCM_IS_WHVEC_B (obj); | |
1402 | ||
1403 | fixup = ptr + j; | |
1404 | alist = *fixup; | |
1405 | ||
1406 | while (SCM_NIMP (alist) | |
1407 | && SCM_CONSP (alist) | |
1408 | && SCM_NIMP (SCM_CAR (alist)) | |
1409 | && SCM_CONSP (SCM_CAR (alist))) | |
1410 | { | |
1411 | SCM key; | |
1412 | SCM value; | |
1413 | ||
1414 | key = SCM_CAAR (alist); | |
1415 | value = SCM_CDAR (alist); | |
0c95b57d GB |
1416 | if ( (weak_keys && SCM_FREEP (key)) |
1417 | || (weak_values && SCM_FREEP (value))) | |
0f2d19dd JB |
1418 | { |
1419 | *fixup = SCM_CDR (alist); | |
1420 | } | |
1421 | else | |
24e68a57 | 1422 | fixup = SCM_CDRLOC (alist); |
0f2d19dd JB |
1423 | alist = SCM_CDR (alist); |
1424 | } | |
1425 | } | |
1426 | } | |
1427 | } | |
1428 | } | |
1429 | scm_cells_allocated = (scm_heap_size - scm_gc_cells_collected); | |
1430 | scm_mallocated -= m; | |
1431 | scm_gc_malloc_collected = m; | |
1432 | } | |
1433 | ||
1434 | ||
1435 | \f | |
1436 | ||
1437 | /* {Front end to malloc} | |
1438 | * | |
c68296f8 | 1439 | * scm_must_malloc, scm_must_realloc, scm_must_free, scm_done_malloc |
0f2d19dd JB |
1440 | * |
1441 | * These functions provide services comperable to malloc, realloc, and | |
1442 | * free. They are for allocating malloced parts of scheme objects. | |
1443 | * The primary purpose of the front end is to impose calls to gc. | |
1444 | */ | |
1445 | ||
1446 | /* scm_must_malloc | |
1447 | * Return newly malloced storage or throw an error. | |
1448 | * | |
1449 | * The parameter WHAT is a string for error reporting. | |
1450 | * If the threshold scm_mtrigger will be passed by this | |
1451 | * allocation, or if the first call to malloc fails, | |
1452 | * garbage collect -- on the presumption that some objects | |
1453 | * using malloced storage may be collected. | |
1454 | * | |
1455 | * The limit scm_mtrigger may be raised by this allocation. | |
1456 | */ | |
07806695 | 1457 | void * |
e4ef2330 | 1458 | scm_must_malloc (scm_sizet size, const char *what) |
0f2d19dd | 1459 | { |
07806695 | 1460 | void *ptr; |
15e9d186 | 1461 | unsigned long nm = scm_mallocated + size; |
e4ef2330 MD |
1462 | |
1463 | if (nm <= scm_mtrigger) | |
0f2d19dd | 1464 | { |
07806695 | 1465 | SCM_SYSCALL (ptr = malloc (size)); |
0f2d19dd JB |
1466 | if (NULL != ptr) |
1467 | { | |
1468 | scm_mallocated = nm; | |
1469 | return ptr; | |
1470 | } | |
1471 | } | |
6064dcc6 | 1472 | |
0f2d19dd | 1473 | scm_igc (what); |
e4ef2330 | 1474 | |
0f2d19dd | 1475 | nm = scm_mallocated + size; |
07806695 | 1476 | SCM_SYSCALL (ptr = malloc (size)); |
0f2d19dd JB |
1477 | if (NULL != ptr) |
1478 | { | |
1479 | scm_mallocated = nm; | |
6064dcc6 MV |
1480 | if (nm > scm_mtrigger - SCM_MTRIGGER_HYSTERESIS) { |
1481 | if (nm > scm_mtrigger) | |
1482 | scm_mtrigger = nm + nm / 2; | |
1483 | else | |
1484 | scm_mtrigger += scm_mtrigger / 2; | |
1485 | } | |
0f2d19dd JB |
1486 | return ptr; |
1487 | } | |
e4ef2330 MD |
1488 | |
1489 | scm_wta (SCM_MAKINUM (size), (char *) SCM_NALLOC, what); | |
1490 | return 0; /* never reached */ | |
0f2d19dd JB |
1491 | } |
1492 | ||
1493 | ||
1494 | /* scm_must_realloc | |
1495 | * is similar to scm_must_malloc. | |
1496 | */ | |
07806695 JB |
1497 | void * |
1498 | scm_must_realloc (void *where, | |
e4ef2330 MD |
1499 | scm_sizet old_size, |
1500 | scm_sizet size, | |
3eeba8d4 | 1501 | const char *what) |
0f2d19dd | 1502 | { |
07806695 | 1503 | void *ptr; |
e4ef2330 MD |
1504 | scm_sizet nm = scm_mallocated + size - old_size; |
1505 | ||
1506 | if (nm <= scm_mtrigger) | |
0f2d19dd | 1507 | { |
07806695 | 1508 | SCM_SYSCALL (ptr = realloc (where, size)); |
0f2d19dd JB |
1509 | if (NULL != ptr) |
1510 | { | |
1511 | scm_mallocated = nm; | |
1512 | return ptr; | |
1513 | } | |
1514 | } | |
e4ef2330 | 1515 | |
0f2d19dd | 1516 | scm_igc (what); |
e4ef2330 MD |
1517 | |
1518 | nm = scm_mallocated + size - old_size; | |
07806695 | 1519 | SCM_SYSCALL (ptr = realloc (where, size)); |
0f2d19dd JB |
1520 | if (NULL != ptr) |
1521 | { | |
1522 | scm_mallocated = nm; | |
6064dcc6 MV |
1523 | if (nm > scm_mtrigger - SCM_MTRIGGER_HYSTERESIS) { |
1524 | if (nm > scm_mtrigger) | |
1525 | scm_mtrigger = nm + nm / 2; | |
1526 | else | |
1527 | scm_mtrigger += scm_mtrigger / 2; | |
1528 | } | |
0f2d19dd JB |
1529 | return ptr; |
1530 | } | |
e4ef2330 MD |
1531 | |
1532 | scm_wta (SCM_MAKINUM (size), (char *) SCM_NALLOC, what); | |
1533 | return 0; /* never reached */ | |
0f2d19dd JB |
1534 | } |
1535 | ||
0f2d19dd | 1536 | void |
07806695 | 1537 | scm_must_free (void *obj) |
0f2d19dd JB |
1538 | { |
1539 | if (obj) | |
1540 | free (obj); | |
1541 | else | |
1542 | scm_wta (SCM_INUM0, "already free", ""); | |
1543 | } | |
0f2d19dd | 1544 | |
c68296f8 MV |
1545 | /* Announce that there has been some malloc done that will be freed |
1546 | * during gc. A typical use is for a smob that uses some malloced | |
1547 | * memory but can not get it from scm_must_malloc (for whatever | |
1548 | * reason). When a new object of this smob is created you call | |
1549 | * scm_done_malloc with the size of the object. When your smob free | |
1550 | * function is called, be sure to include this size in the return | |
1551 | * value. */ | |
0f2d19dd | 1552 | |
c68296f8 | 1553 | void |
6e8d25a6 | 1554 | scm_done_malloc (long size) |
c68296f8 MV |
1555 | { |
1556 | scm_mallocated += size; | |
1557 | ||
1558 | if (scm_mallocated > scm_mtrigger) | |
1559 | { | |
1560 | scm_igc ("foreign mallocs"); | |
1561 | if (scm_mallocated > scm_mtrigger - SCM_MTRIGGER_HYSTERESIS) | |
1562 | { | |
1563 | if (scm_mallocated > scm_mtrigger) | |
1564 | scm_mtrigger = scm_mallocated + scm_mallocated / 2; | |
1565 | else | |
1566 | scm_mtrigger += scm_mtrigger / 2; | |
1567 | } | |
1568 | } | |
1569 | } | |
1570 | ||
1571 | ||
1572 | \f | |
0f2d19dd JB |
1573 | |
1574 | /* {Heap Segments} | |
1575 | * | |
1576 | * Each heap segment is an array of objects of a particular size. | |
1577 | * Every segment has an associated (possibly shared) freelist. | |
1578 | * A table of segment records is kept that records the upper and | |
1579 | * lower extents of the segment; this is used during the conservative | |
1580 | * phase of gc to identify probably gc roots (because they point | |
c68296f8 | 1581 | * into valid segments at reasonable offsets). */ |
0f2d19dd JB |
1582 | |
1583 | /* scm_expmem | |
1584 | * is true if the first segment was smaller than INIT_HEAP_SEG. | |
1585 | * If scm_expmem is set to one, subsequent segment allocations will | |
1586 | * allocate segments of size SCM_EXPHEAP(scm_heap_size). | |
1587 | */ | |
1588 | int scm_expmem = 0; | |
1589 | ||
1590 | /* scm_heap_org | |
1591 | * is the lowest base address of any heap segment. | |
1592 | */ | |
1593 | SCM_CELLPTR scm_heap_org; | |
1594 | ||
1595 | struct scm_heap_seg_data * scm_heap_table = 0; | |
1596 | int scm_n_heap_segs = 0; | |
1597 | ||
1598 | /* scm_heap_size | |
1599 | * is the total number of cells in heap segments. | |
1600 | */ | |
15e9d186 | 1601 | unsigned long scm_heap_size = 0; |
0f2d19dd JB |
1602 | |
1603 | /* init_heap_seg | |
1604 | * initializes a new heap segment and return the number of objects it contains. | |
1605 | * | |
1606 | * The segment origin, segment size in bytes, and the span of objects | |
1607 | * in cells are input parameters. The freelist is both input and output. | |
1608 | * | |
1609 | * This function presume that the scm_heap_table has already been expanded | |
1610 | * to accomodate a new segment record. | |
1611 | */ | |
1612 | ||
1613 | ||
0f2d19dd | 1614 | static scm_sizet |
6e8d25a6 | 1615 | init_heap_seg (SCM_CELLPTR seg_org, scm_sizet size, int ncells, SCM *freelistp) |
0f2d19dd JB |
1616 | { |
1617 | register SCM_CELLPTR ptr; | |
1618 | #ifdef SCM_POINTERS_MUNGED | |
1619 | register SCM scmptr; | |
1620 | #else | |
1621 | #undef scmptr | |
1622 | #define scmptr ptr | |
1623 | #endif | |
1624 | SCM_CELLPTR seg_end; | |
15e9d186 JB |
1625 | int new_seg_index; |
1626 | int n_new_objects; | |
0f2d19dd JB |
1627 | |
1628 | if (seg_org == NULL) | |
1629 | return 0; | |
1630 | ||
1631 | ptr = seg_org; | |
1632 | ||
1633 | /* Compute the ceiling on valid object pointers w/in this segment. | |
1634 | */ | |
1635 | seg_end = CELL_DN ((char *) ptr + size); | |
1636 | ||
1637 | /* Find the right place and insert the segment record. | |
1638 | * | |
1639 | */ | |
1640 | for (new_seg_index = 0; | |
1641 | ( (new_seg_index < scm_n_heap_segs) | |
1642 | && SCM_PTR_LE (scm_heap_table[new_seg_index].bounds[0], seg_org)); | |
1643 | new_seg_index++) | |
1644 | ; | |
1645 | ||
1646 | { | |
1647 | int i; | |
1648 | for (i = scm_n_heap_segs; i > new_seg_index; --i) | |
1649 | scm_heap_table[i] = scm_heap_table[i - 1]; | |
1650 | } | |
1651 | ||
1652 | ++scm_n_heap_segs; | |
1653 | ||
1654 | scm_heap_table[new_seg_index].valid = 0; | |
1655 | scm_heap_table[new_seg_index].ncells = ncells; | |
1656 | scm_heap_table[new_seg_index].freelistp = freelistp; | |
1657 | scm_heap_table[new_seg_index].bounds[0] = (SCM_CELLPTR)ptr; | |
1658 | scm_heap_table[new_seg_index].bounds[1] = (SCM_CELLPTR)seg_end; | |
1659 | ||
1660 | ||
1661 | /* Compute the least valid object pointer w/in this segment | |
1662 | */ | |
1663 | ptr = CELL_UP (ptr); | |
1664 | ||
1665 | ||
1666 | n_new_objects = seg_end - ptr; | |
1667 | ||
1668 | /* Prepend objects in this segment to the freelist. | |
1669 | */ | |
1670 | while (ptr < seg_end) | |
1671 | { | |
1672 | #ifdef SCM_POINTERS_MUNGED | |
1673 | scmptr = PTR2SCM (ptr); | |
1674 | #endif | |
24e68a57 MD |
1675 | SCM_SETCAR (scmptr, (SCM) scm_tc_free_cell); |
1676 | SCM_SETCDR (scmptr, PTR2SCM (ptr + ncells)); | |
0f2d19dd JB |
1677 | ptr += ncells; |
1678 | } | |
1679 | ||
1680 | ptr -= ncells; | |
1681 | ||
1682 | /* Patch up the last freelist pointer in the segment | |
1683 | * to join it to the input freelist. | |
1684 | */ | |
24e68a57 | 1685 | SCM_SETCDR (PTR2SCM (ptr), *freelistp); |
0f2d19dd JB |
1686 | *freelistp = PTR2SCM (CELL_UP (seg_org)); |
1687 | ||
1688 | scm_heap_size += (ncells * n_new_objects); | |
1689 | return size; | |
1690 | #ifdef scmptr | |
1691 | #undef scmptr | |
1692 | #endif | |
1693 | } | |
1694 | ||
1695 | ||
0f2d19dd | 1696 | static void |
6e8d25a6 | 1697 | alloc_some_heap (int ncells, SCM *freelistp) |
0f2d19dd JB |
1698 | { |
1699 | struct scm_heap_seg_data * tmptable; | |
1700 | SCM_CELLPTR ptr; | |
1701 | scm_sizet len; | |
1702 | ||
1703 | /* Critical code sections (such as the garbage collector) | |
1704 | * aren't supposed to add heap segments. | |
1705 | */ | |
1706 | if (scm_gc_heap_lock) | |
1707 | scm_wta (SCM_UNDEFINED, "need larger initial", "heap"); | |
1708 | ||
1709 | /* Expand the heap tables to have room for the new segment. | |
1710 | * Do not yet increment scm_n_heap_segs -- that is done by init_heap_seg | |
1711 | * only if the allocation of the segment itself succeeds. | |
1712 | */ | |
1713 | len = (1 + scm_n_heap_segs) * sizeof (struct scm_heap_seg_data); | |
1714 | ||
1715 | SCM_SYSCALL (tmptable = ((struct scm_heap_seg_data *) | |
1716 | realloc ((char *)scm_heap_table, len))); | |
1717 | if (!tmptable) | |
1718 | scm_wta (SCM_UNDEFINED, "could not grow", "hplims"); | |
1719 | else | |
1720 | scm_heap_table = tmptable; | |
1721 | ||
1722 | ||
1723 | /* Pick a size for the new heap segment. | |
1724 | * The rule for picking the size of a segment is explained in | |
1725 | * gc.h | |
1726 | */ | |
1727 | if (scm_expmem) | |
1728 | { | |
1729 | len = (scm_sizet) (SCM_EXPHEAP (scm_heap_size) * sizeof (scm_cell)); | |
1730 | if ((scm_sizet) (SCM_EXPHEAP (scm_heap_size) * sizeof (scm_cell)) != len) | |
1731 | len = 0; | |
1732 | } | |
1733 | else | |
1734 | len = SCM_HEAP_SEG_SIZE; | |
1735 | ||
1736 | { | |
1737 | scm_sizet smallest; | |
1738 | ||
1739 | smallest = (ncells * sizeof (scm_cell)); | |
1740 | if (len < smallest) | |
1741 | len = (ncells * sizeof (scm_cell)); | |
1742 | ||
1743 | /* Allocate with decaying ambition. */ | |
1744 | while ((len >= SCM_MIN_HEAP_SEG_SIZE) | |
1745 | && (len >= smallest)) | |
1746 | { | |
1747 | SCM_SYSCALL (ptr = (SCM_CELLPTR) malloc (len)); | |
1748 | if (ptr) | |
1749 | { | |
1750 | init_heap_seg (ptr, len, ncells, freelistp); | |
1751 | return; | |
1752 | } | |
1753 | len /= 2; | |
1754 | } | |
1755 | } | |
1756 | ||
1757 | scm_wta (SCM_UNDEFINED, "could not grow", "heap"); | |
1758 | } | |
1759 | ||
1760 | ||
1761 | ||
1bbd0b84 GB |
1762 | GUILE_PROC (scm_unhash_name, "unhash-name", 1, 0, 0, |
1763 | (SCM name), | |
1764 | "") | |
1765 | #define FUNC_NAME s_scm_unhash_name | |
0f2d19dd JB |
1766 | { |
1767 | int x; | |
1768 | int bound; | |
1bbd0b84 | 1769 | SCM_VALIDATE_SYMBOL(1,name); |
0f2d19dd JB |
1770 | SCM_DEFER_INTS; |
1771 | bound = scm_n_heap_segs; | |
1772 | for (x = 0; x < bound; ++x) | |
1773 | { | |
1774 | SCM_CELLPTR p; | |
1775 | SCM_CELLPTR pbound; | |
1776 | p = (SCM_CELLPTR)scm_heap_table[x].bounds[0]; | |
1777 | pbound = (SCM_CELLPTR)scm_heap_table[x].bounds[1]; | |
1778 | while (p < pbound) | |
1779 | { | |
1780 | SCM incar; | |
1781 | incar = p->car; | |
1782 | if (1 == (7 & (int)incar)) | |
1783 | { | |
1784 | --incar; | |
1785 | if ( ((name == SCM_BOOL_T) || (SCM_CAR (incar) == name)) | |
1786 | && (SCM_CDR (incar) != 0) | |
1787 | && (SCM_CDR (incar) != 1)) | |
1788 | { | |
1789 | p->car = name; | |
1790 | } | |
1791 | } | |
1792 | ++p; | |
1793 | } | |
1794 | } | |
1795 | SCM_ALLOW_INTS; | |
1796 | return name; | |
1797 | } | |
1bbd0b84 | 1798 | #undef FUNC_NAME |
0f2d19dd JB |
1799 | |
1800 | ||
1801 | \f | |
1802 | /* {GC Protection Helper Functions} | |
1803 | */ | |
1804 | ||
1805 | ||
0f2d19dd | 1806 | void |
6e8d25a6 GB |
1807 | scm_remember (SCM *ptr) |
1808 | { /* empty */ } | |
0f2d19dd | 1809 | |
1cc91f1b | 1810 | |
0f2d19dd JB |
1811 | SCM |
1812 | scm_return_first (SCM elt, ...) | |
0f2d19dd JB |
1813 | { |
1814 | return elt; | |
1815 | } | |
1816 | ||
1817 | ||
0f2d19dd | 1818 | SCM |
6e8d25a6 | 1819 | scm_permanent_object (SCM obj) |
0f2d19dd JB |
1820 | { |
1821 | SCM_REDEFER_INTS; | |
1822 | scm_permobjs = scm_cons (obj, scm_permobjs); | |
1823 | SCM_REALLOW_INTS; | |
1824 | return obj; | |
1825 | } | |
1826 | ||
1827 | ||
ef290276 JB |
1828 | /* Protect OBJ from the garbage collector. OBJ will not be freed, |
1829 | even if all other references are dropped, until someone applies | |
1830 | scm_unprotect_object to it. This function returns OBJ. | |
1831 | ||
dab7f566 JB |
1832 | Calls to scm_protect_object nest. For every object O, there is a |
1833 | counter which scm_protect_object(O) increments and | |
1834 | scm_unprotect_object(O) decrements, if it is greater than zero. If | |
1835 | an object's counter is greater than zero, the garbage collector | |
1836 | will not free it. | |
1837 | ||
1838 | Of course, that's not how it's implemented. scm_protect_object and | |
1839 | scm_unprotect_object just maintain a list of references to things. | |
1840 | Since the GC knows about this list, all objects it mentions stay | |
1841 | alive. scm_protect_object adds its argument to the list; | |
1842 | scm_unprotect_object removes the first occurrence of its argument | |
1843 | to the list. */ | |
ef290276 | 1844 | SCM |
6e8d25a6 | 1845 | scm_protect_object (SCM obj) |
ef290276 | 1846 | { |
ef290276 JB |
1847 | scm_protects = scm_cons (obj, scm_protects); |
1848 | ||
1849 | return obj; | |
1850 | } | |
1851 | ||
1852 | ||
1853 | /* Remove any protection for OBJ established by a prior call to | |
dab7f566 | 1854 | scm_protect_object. This function returns OBJ. |
ef290276 | 1855 | |
dab7f566 | 1856 | See scm_protect_object for more information. */ |
ef290276 | 1857 | SCM |
6e8d25a6 | 1858 | scm_unprotect_object (SCM obj) |
ef290276 | 1859 | { |
dab7f566 JB |
1860 | SCM *tail_ptr = &scm_protects; |
1861 | ||
0c95b57d | 1862 | while (SCM_CONSP (*tail_ptr)) |
dab7f566 JB |
1863 | if (SCM_CAR (*tail_ptr) == obj) |
1864 | { | |
1865 | *tail_ptr = SCM_CDR (*tail_ptr); | |
1866 | break; | |
1867 | } | |
1868 | else | |
1869 | tail_ptr = SCM_CDRLOC (*tail_ptr); | |
ef290276 JB |
1870 | |
1871 | return obj; | |
1872 | } | |
1873 | ||
c45acc34 JB |
1874 | int terminating; |
1875 | ||
1876 | /* called on process termination. */ | |
e52ceaac MD |
1877 | #ifdef HAVE_ATEXIT |
1878 | static void | |
1879 | cleanup (void) | |
1880 | #else | |
1881 | #ifdef HAVE_ON_EXIT | |
51157deb MD |
1882 | extern int on_exit (void (*procp) (), int arg); |
1883 | ||
e52ceaac MD |
1884 | static void |
1885 | cleanup (int status, void *arg) | |
1886 | #else | |
1887 | #error Dont know how to setup a cleanup handler on your system. | |
1888 | #endif | |
1889 | #endif | |
c45acc34 JB |
1890 | { |
1891 | terminating = 1; | |
1892 | scm_flush_all_ports (); | |
1893 | } | |
ef290276 | 1894 | |
0f2d19dd | 1895 | \f |
0f2d19dd | 1896 | int |
15e9d186 | 1897 | scm_init_storage (scm_sizet init_heap_size) |
0f2d19dd JB |
1898 | { |
1899 | scm_sizet j; | |
1900 | ||
1901 | j = SCM_NUM_PROTECTS; | |
1902 | while (j) | |
1903 | scm_sys_protects[--j] = SCM_BOOL_F; | |
1904 | scm_block_gc = 1; | |
1905 | scm_freelist = SCM_EOL; | |
1906 | scm_expmem = 0; | |
1907 | ||
1908 | j = SCM_HEAP_SEG_SIZE; | |
1909 | scm_mtrigger = SCM_INIT_MALLOC_LIMIT; | |
1910 | scm_heap_table = ((struct scm_heap_seg_data *) | |
1911 | scm_must_malloc (sizeof (struct scm_heap_seg_data), "hplims")); | |
1912 | if (0L == init_heap_size) | |
1913 | init_heap_size = SCM_INIT_HEAP_SIZE; | |
1914 | j = init_heap_size; | |
1915 | if ((init_heap_size != j) | |
1916 | || !init_heap_seg ((SCM_CELLPTR) malloc (j), j, 1, &scm_freelist)) | |
1917 | { | |
1918 | j = SCM_HEAP_SEG_SIZE; | |
1919 | if (!init_heap_seg ((SCM_CELLPTR) malloc (j), j, 1, &scm_freelist)) | |
1920 | return 1; | |
1921 | } | |
1922 | else | |
1923 | scm_expmem = 1; | |
1924 | scm_heap_org = CELL_UP (scm_heap_table[0].bounds[0]); | |
1925 | /* scm_hplims[0] can change. do not remove scm_heap_org */ | |
ab4bef85 | 1926 | scm_weak_vectors = SCM_EOL; |
0f2d19dd JB |
1927 | |
1928 | /* Initialise the list of ports. */ | |
840ae05d JB |
1929 | scm_port_table = (scm_port **) |
1930 | malloc (sizeof (scm_port *) * scm_port_table_room); | |
0f2d19dd JB |
1931 | if (!scm_port_table) |
1932 | return 1; | |
1933 | ||
a18bcd0e | 1934 | #ifdef HAVE_ATEXIT |
c45acc34 | 1935 | atexit (cleanup); |
e52ceaac MD |
1936 | #else |
1937 | #ifdef HAVE_ON_EXIT | |
1938 | on_exit (cleanup, 0); | |
1939 | #endif | |
a18bcd0e | 1940 | #endif |
0f2d19dd JB |
1941 | |
1942 | scm_undefineds = scm_cons (SCM_UNDEFINED, SCM_EOL); | |
24e68a57 | 1943 | SCM_SETCDR (scm_undefineds, scm_undefineds); |
0f2d19dd JB |
1944 | |
1945 | scm_listofnull = scm_cons (SCM_EOL, SCM_EOL); | |
1946 | scm_nullstr = scm_makstr (0L, 0); | |
a8741caa MD |
1947 | scm_nullvect = scm_make_vector (SCM_INUM0, SCM_UNDEFINED); |
1948 | scm_symhash = scm_make_vector ((SCM) SCM_MAKINUM (scm_symhash_dim), SCM_EOL); | |
4037ac5f | 1949 | scm_weak_symhash = scm_make_weak_key_hash_table ((SCM) SCM_MAKINUM (scm_symhash_dim)); |
a8741caa | 1950 | scm_symhash_vars = scm_make_vector ((SCM) SCM_MAKINUM (scm_symhash_dim), SCM_EOL); |
8960e0a0 | 1951 | scm_stand_in_procs = SCM_EOL; |
0f2d19dd | 1952 | scm_permobjs = SCM_EOL; |
ef290276 | 1953 | scm_protects = SCM_EOL; |
3b2b8760 | 1954 | scm_asyncs = SCM_EOL; |
0f2d19dd JB |
1955 | scm_sysintern ("most-positive-fixnum", (SCM) SCM_MAKINUM (SCM_MOST_POSITIVE_FIXNUM)); |
1956 | scm_sysintern ("most-negative-fixnum", (SCM) SCM_MAKINUM (SCM_MOST_NEGATIVE_FIXNUM)); | |
1957 | #ifdef SCM_BIGDIG | |
1958 | scm_sysintern ("bignum-radix", SCM_MAKINUM (SCM_BIGRAD)); | |
1959 | #endif | |
1960 | return 0; | |
1961 | } | |
1962 | \f | |
1963 | ||
0f2d19dd JB |
1964 | void |
1965 | scm_init_gc () | |
0f2d19dd JB |
1966 | { |
1967 | #include "gc.x" | |
1968 | } |