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