Commit | Line | Data |
---|---|---|
c709de7f | 1 | /* Copyright (C) 1995,1996,1997,1998,1999,2000,2001, 2002 Free Software Foundation, Inc. |
a00c95d9 | 2 | * |
0f2d19dd JB |
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. | |
a00c95d9 | 7 | * |
0f2d19dd JB |
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. | |
a00c95d9 | 12 | * |
0f2d19dd JB |
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 | 41 | |
1bbd0b84 | 42 | |
37ddcaf6 MD |
43 | /* #define DEBUGINFO */ |
44 | ||
56495472 | 45 | |
0f2d19dd | 46 | #include <stdio.h> |
e6e2e95a | 47 | #include <errno.h> |
783e7774 | 48 | #include <string.h> |
c8a1bdc4 | 49 | #include <assert.h> |
e6e2e95a | 50 | |
d9189652 RB |
51 | #ifdef __ia64__ |
52 | #include <ucontext.h> | |
bb1180ef | 53 | extern unsigned long * __libc_ia64_register_backing_store_base; |
d9189652 RB |
54 | #endif |
55 | ||
a0599745 | 56 | #include "libguile/_scm.h" |
0a7a7445 | 57 | #include "libguile/eval.h" |
a0599745 MD |
58 | #include "libguile/stime.h" |
59 | #include "libguile/stackchk.h" | |
60 | #include "libguile/struct.h" | |
a0599745 MD |
61 | #include "libguile/smob.h" |
62 | #include "libguile/unif.h" | |
63 | #include "libguile/async.h" | |
64 | #include "libguile/ports.h" | |
65 | #include "libguile/root.h" | |
66 | #include "libguile/strings.h" | |
67 | #include "libguile/vectors.h" | |
801cb5e7 | 68 | #include "libguile/weaks.h" |
686765af | 69 | #include "libguile/hashtab.h" |
ecf470a2 | 70 | #include "libguile/tags.h" |
a0599745 | 71 | |
c8a1bdc4 | 72 | #include "libguile/private-gc.h" |
a0599745 | 73 | #include "libguile/validate.h" |
1be6b49c | 74 | #include "libguile/deprecation.h" |
a0599745 | 75 | #include "libguile/gc.h" |
fce59c93 | 76 | |
bc9d9bb2 | 77 | #ifdef GUILE_DEBUG_MALLOC |
a0599745 | 78 | #include "libguile/debug-malloc.h" |
bc9d9bb2 MD |
79 | #endif |
80 | ||
0f2d19dd | 81 | #ifdef HAVE_MALLOC_H |
95b88819 | 82 | #include <malloc.h> |
0f2d19dd JB |
83 | #endif |
84 | ||
85 | #ifdef HAVE_UNISTD_H | |
95b88819 | 86 | #include <unistd.h> |
0f2d19dd JB |
87 | #endif |
88 | ||
406c7d90 | 89 | |
8c494e99 | 90 | |
406c7d90 DH |
91 | unsigned int scm_gc_running_p = 0; |
92 | ||
406c7d90 DH |
93 | #if (SCM_DEBUG_CELL_ACCESSES == 1) |
94 | ||
eae33935 | 95 | /* Set this to != 0 if every cell that is accessed shall be checked: |
61045190 DH |
96 | */ |
97 | unsigned int scm_debug_cell_accesses_p = 1; | |
406c7d90 | 98 | |
e81d98ec DH |
99 | /* Set this to 0 if no additional gc's shall be performed, otherwise set it to |
100 | * the number of cell accesses after which a gc shall be called. | |
101 | */ | |
102 | static unsigned int debug_cells_gc_interval = 0; | |
103 | ||
406c7d90 DH |
104 | |
105 | /* Assert that the given object is a valid reference to a valid cell. This | |
106 | * test involves to determine whether the object is a cell pointer, whether | |
107 | * this pointer actually points into a heap segment and whether the cell | |
e81d98ec DH |
108 | * pointed to is not a free cell. Further, additional garbage collections may |
109 | * get executed after a user defined number of cell accesses. This helps to | |
110 | * find places in the C code where references are dropped for extremely short | |
111 | * periods. | |
406c7d90 | 112 | */ |
c8a1bdc4 | 113 | |
406c7d90 DH |
114 | void |
115 | scm_assert_cell_valid (SCM cell) | |
116 | { | |
61045190 DH |
117 | static unsigned int already_running = 0; |
118 | ||
c8a1bdc4 | 119 | if (!already_running) |
406c7d90 | 120 | { |
61045190 | 121 | already_running = 1; /* set to avoid recursion */ |
406c7d90 | 122 | |
c8a1bdc4 HWN |
123 | /* |
124 | During GC, no user-code should be run, and the guile core should | |
125 | use non-protected accessors. | |
126 | */ | |
127 | if (scm_gc_running_p) | |
128 | abort(); | |
129 | ||
130 | /* | |
131 | Only scm_in_heap_p is wildly expensive. | |
132 | */ | |
133 | if (scm_debug_cell_accesses_p) | |
134 | if (!scm_in_heap_p (cell)) | |
135 | { | |
136 | fprintf (stderr, "scm_assert_cell_valid: this object does not live in the heap: %lux\n", | |
137 | (unsigned long) SCM_UNPACK (cell)); | |
138 | abort (); | |
139 | } | |
140 | ||
141 | if (!SCM_GC_MARK_P (cell)) | |
406c7d90 | 142 | { |
c8a1bdc4 HWN |
143 | fprintf (stderr, |
144 | "scm_assert_cell_valid: this object is unmarked. \n" | |
145 | "It has been garbage-collected in the last GC run: " | |
146 | "%lux\n", | |
1be6b49c | 147 | (unsigned long) SCM_UNPACK (cell)); |
406c7d90 DH |
148 | abort (); |
149 | } | |
c8a1bdc4 HWN |
150 | |
151 | ||
152 | /* If desired, perform additional garbage collections after a user | |
153 | * defined number of cell accesses. | |
154 | */ | |
155 | if (scm_debug_cell_accesses_p && debug_cells_gc_interval) | |
406c7d90 | 156 | { |
c8a1bdc4 HWN |
157 | static unsigned int counter = 0; |
158 | ||
159 | if (counter != 0) | |
406c7d90 | 160 | { |
c8a1bdc4 | 161 | --counter; |
406c7d90 | 162 | } |
c8a1bdc4 | 163 | else |
e81d98ec | 164 | { |
c8a1bdc4 HWN |
165 | counter = debug_cells_gc_interval; |
166 | scm_igc ("scm_assert_cell_valid"); | |
e81d98ec | 167 | } |
406c7d90 | 168 | } |
61045190 | 169 | already_running = 0; /* re-enable */ |
406c7d90 DH |
170 | } |
171 | } | |
172 | ||
173 | ||
174 | SCM_DEFINE (scm_set_debug_cell_accesses_x, "set-debug-cell-accesses!", 1, 0, 0, | |
175 | (SCM flag), | |
1e6808ea | 176 | "If @var{flag} is @code{#f}, cell access checking is disabled.\n" |
e81d98ec DH |
177 | "If @var{flag} is @code{#t}, cell access checking is enabled,\n" |
178 | "but no additional calls to garbage collection are issued.\n" | |
179 | "If @var{flag} is a number, cell access checking is enabled,\n" | |
180 | "with an additional garbage collection after the given\n" | |
181 | "number of cell accesses.\n" | |
1e6808ea MG |
182 | "This procedure only exists when the compile-time flag\n" |
183 | "@code{SCM_DEBUG_CELL_ACCESSES} was set to 1.") | |
406c7d90 DH |
184 | #define FUNC_NAME s_scm_set_debug_cell_accesses_x |
185 | { | |
186 | if (SCM_FALSEP (flag)) { | |
187 | scm_debug_cell_accesses_p = 0; | |
188 | } else if (SCM_EQ_P (flag, SCM_BOOL_T)) { | |
e81d98ec DH |
189 | debug_cells_gc_interval = 0; |
190 | scm_debug_cell_accesses_p = 1; | |
191 | } else if (SCM_INUMP (flag)) { | |
192 | long int f = SCM_INUM (flag); | |
193 | if (f <= 0) SCM_OUT_OF_RANGE (1, flag); | |
194 | debug_cells_gc_interval = f; | |
406c7d90 DH |
195 | scm_debug_cell_accesses_p = 1; |
196 | } else { | |
197 | SCM_WRONG_TYPE_ARG (1, flag); | |
198 | } | |
199 | return SCM_UNSPECIFIED; | |
200 | } | |
201 | #undef FUNC_NAME | |
c8a1bdc4 | 202 | #else |
0f2d19dd | 203 | |
8fef55a8 | 204 | /* |
c8a1bdc4 HWN |
205 | Provide a stub, so people can use their Scheme code on non-debug |
206 | versions of GUILE as well. | |
4c48ba06 | 207 | */ |
c8a1bdc4 HWN |
208 | SCM_DEFINE (scm_set_debug_cell_accesses_x, "set-debug-cell-accesses!", 1, 0, 0, |
209 | (SCM flag), | |
210 | "This function is used to turn on checking for a debug version of GUILE. This version does not support this functionality\n") | |
211 | #define FUNC_NAME s_scm_set_debug_cell_accesses_x | |
212 | { | |
213 | ||
214 | /* | |
215 | do nothing | |
216 | */ | |
0f2d19dd | 217 | |
c8a1bdc4 HWN |
218 | scm_remember_upto_here (flag); |
219 | return SCM_UNSPECIFIED; | |
220 | } | |
221 | #undef FUNC_NAME | |
ecf470a2 | 222 | |
c8a1bdc4 | 223 | #endif /* SCM_DEBUG_CELL_ACCESSES == 1 */ |
0f2d19dd JB |
224 | |
225 | \f | |
945fec60 | 226 | |
c8a1bdc4 HWN |
227 | SCM scm_i_freelist = SCM_EOL; |
228 | SCM scm_i_freelist2 = SCM_EOL; | |
229 | ||
0f2d19dd JB |
230 | |
231 | /* scm_mtrigger | |
539b08a4 | 232 | * is the number of bytes of malloc allocation needed to trigger gc. |
0f2d19dd | 233 | */ |
c014a02e | 234 | unsigned long scm_mtrigger; |
0f2d19dd | 235 | |
0f2d19dd JB |
236 | /* scm_gc_heap_lock |
237 | * If set, don't expand the heap. Set only during gc, during which no allocation | |
238 | * is supposed to take place anyway. | |
239 | */ | |
240 | int scm_gc_heap_lock = 0; | |
241 | ||
242 | /* GC Blocking | |
243 | * Don't pause for collection if this is set -- just | |
244 | * expand the heap. | |
245 | */ | |
0f2d19dd JB |
246 | int scm_block_gc = 1; |
247 | ||
0f2d19dd JB |
248 | /* During collection, this accumulates objects holding |
249 | * weak references. | |
250 | */ | |
ab4bef85 | 251 | SCM scm_weak_vectors; |
0f2d19dd | 252 | |
7445e0e8 MD |
253 | /* During collection, this accumulates structures which are to be freed. |
254 | */ | |
255 | SCM scm_structs_to_free; | |
256 | ||
0f2d19dd JB |
257 | /* GC Statistics Keeping |
258 | */ | |
c2cbcc57 | 259 | long scm_cells_allocated = 0; |
c014a02e ML |
260 | unsigned long scm_mallocated = 0; |
261 | unsigned long scm_gc_cells_collected; | |
c8a1bdc4 | 262 | unsigned long scm_gc_cells_collected_1 = 0; /* previous GC yield */ |
c014a02e ML |
263 | unsigned long scm_gc_malloc_collected; |
264 | unsigned long scm_gc_ports_collected; | |
0f2d19dd | 265 | unsigned long scm_gc_time_taken = 0; |
c014a02e | 266 | static unsigned long t_before_gc; |
c9b0d4b0 | 267 | unsigned long scm_gc_mark_time_taken = 0; |
c014a02e ML |
268 | unsigned long scm_gc_times = 0; |
269 | unsigned long scm_gc_cells_swept = 0; | |
c9b0d4b0 ML |
270 | double scm_gc_cells_marked_acc = 0.; |
271 | double scm_gc_cells_swept_acc = 0.; | |
c2cbcc57 HWN |
272 | int scm_gc_cell_yield_percentage =0; |
273 | int scm_gc_malloc_yield_percentage = 0; | |
274 | ||
0f2d19dd JB |
275 | |
276 | SCM_SYMBOL (sym_cells_allocated, "cells-allocated"); | |
277 | SCM_SYMBOL (sym_heap_size, "cell-heap-size"); | |
278 | SCM_SYMBOL (sym_mallocated, "bytes-malloced"); | |
279 | SCM_SYMBOL (sym_mtrigger, "gc-malloc-threshold"); | |
280 | SCM_SYMBOL (sym_heap_segments, "cell-heap-segments"); | |
281 | SCM_SYMBOL (sym_gc_time_taken, "gc-time-taken"); | |
c9b0d4b0 | 282 | SCM_SYMBOL (sym_gc_mark_time_taken, "gc-mark-time-taken"); |
c9b0d4b0 ML |
283 | SCM_SYMBOL (sym_times, "gc-times"); |
284 | SCM_SYMBOL (sym_cells_marked, "cells-marked"); | |
285 | SCM_SYMBOL (sym_cells_swept, "cells-swept"); | |
c2cbcc57 HWN |
286 | SCM_SYMBOL (sym_malloc_yield, "malloc-yield"); |
287 | SCM_SYMBOL (sym_cell_yield, "cell-yield"); | |
0f2d19dd | 288 | |
bb2c57fa | 289 | |
cf2d30f6 | 290 | |
d3dd80ab | 291 | |
cf2d30f6 | 292 | /* Number of calls to SCM_NEWCELL since startup. */ |
c8a1bdc4 HWN |
293 | unsigned scm_newcell_count; |
294 | unsigned scm_newcell2_count; | |
b37fe1c5 | 295 | |
b37fe1c5 | 296 | |
0f2d19dd JB |
297 | /* {Scheme Interface to GC} |
298 | */ | |
c2cbcc57 | 299 | extern int scm_gc_malloc_yield_percentage; |
a00c95d9 | 300 | SCM_DEFINE (scm_gc_stats, "gc-stats", 0, 0, 0, |
1bbd0b84 | 301 | (), |
1e6808ea | 302 | "Return an association list of statistics about Guile's current\n" |
c8a1bdc4 | 303 | "use of storage.\n") |
1bbd0b84 | 304 | #define FUNC_NAME s_scm_gc_stats |
0f2d19dd | 305 | { |
c8a1bdc4 HWN |
306 | long i = 0; |
307 | SCM heap_segs = SCM_EOL ; | |
c014a02e ML |
308 | unsigned long int local_scm_mtrigger; |
309 | unsigned long int local_scm_mallocated; | |
310 | unsigned long int local_scm_heap_size; | |
c2cbcc57 HWN |
311 | int local_scm_gc_cell_yield_percentage; |
312 | int local_scm_gc_malloc_yield_percentage; | |
313 | long int local_scm_cells_allocated; | |
c014a02e ML |
314 | unsigned long int local_scm_gc_time_taken; |
315 | unsigned long int local_scm_gc_times; | |
316 | unsigned long int local_scm_gc_mark_time_taken; | |
c9b0d4b0 ML |
317 | double local_scm_gc_cells_swept; |
318 | double local_scm_gc_cells_marked; | |
0f2d19dd | 319 | SCM answer; |
c8a1bdc4 HWN |
320 | unsigned long *bounds = 0; |
321 | int table_size = scm_i_heap_segment_table_size; | |
0f2d19dd | 322 | SCM_DEFER_INTS; |
939794ce | 323 | |
c8a1bdc4 HWN |
324 | /* |
325 | temporarily store the numbers, so as not to cause GC. | |
7febb4a2 | 326 | */ |
c8a1bdc4 HWN |
327 | |
328 | bounds = malloc (sizeof (int) * table_size * 2); | |
329 | if (!bounds) | |
330 | abort(); | |
331 | for (i = table_size; i--; ) | |
332 | { | |
333 | bounds[2*i] = (unsigned long)scm_i_heap_segment_table[i]->bounds[0]; | |
334 | bounds[2*i+1] = (unsigned long)scm_i_heap_segment_table[i]->bounds[1]; | |
335 | } | |
0f2d19dd | 336 | |
4c9419ac | 337 | |
c8a1bdc4 HWN |
338 | /* Below, we cons to produce the resulting list. We want a snapshot of |
339 | * the heap situation before consing. | |
340 | */ | |
341 | local_scm_mtrigger = scm_mtrigger; | |
342 | local_scm_mallocated = scm_mallocated; | |
343 | local_scm_heap_size = SCM_HEAP_SIZE; | |
539b08a4 | 344 | |
c8a1bdc4 HWN |
345 | local_scm_cells_allocated = scm_cells_allocated; |
346 | ||
347 | local_scm_gc_time_taken = scm_gc_time_taken; | |
348 | local_scm_gc_mark_time_taken = scm_gc_mark_time_taken; | |
349 | local_scm_gc_times = scm_gc_times; | |
c2cbcc57 HWN |
350 | local_scm_gc_malloc_yield_percentage = scm_gc_malloc_yield_percentage; |
351 | local_scm_gc_cell_yield_percentage= scm_gc_cell_yield_percentage; | |
352 | ||
353 | local_scm_gc_cells_swept = | |
354 | (double) scm_gc_cells_swept_acc | |
355 | + (double) scm_gc_cells_swept; | |
c8a1bdc4 HWN |
356 | local_scm_gc_cells_marked = scm_gc_cells_marked_acc |
357 | +(double) scm_gc_cells_swept | |
358 | -(double) scm_gc_cells_collected; | |
0f2d19dd | 359 | |
c8a1bdc4 HWN |
360 | for (i = table_size; i--;) |
361 | { | |
362 | heap_segs = scm_cons (scm_cons (scm_ulong2num (bounds[2*i]), | |
363 | scm_ulong2num (bounds[2*i+1])), | |
364 | heap_segs); | |
365 | } | |
366 | ||
367 | answer = scm_list_n (scm_cons (sym_gc_time_taken, scm_ulong2num (local_scm_gc_time_taken)), | |
c2cbcc57 | 368 | scm_cons (sym_cells_allocated, scm_long2num (local_scm_cells_allocated)), |
c8a1bdc4 HWN |
369 | scm_cons (sym_heap_size, scm_ulong2num (local_scm_heap_size)), |
370 | scm_cons (sym_mallocated, scm_ulong2num (local_scm_mallocated)), | |
371 | scm_cons (sym_mtrigger, scm_ulong2num (local_scm_mtrigger)), | |
372 | scm_cons (sym_times, scm_ulong2num (local_scm_gc_times)), | |
373 | scm_cons (sym_gc_mark_time_taken, scm_ulong2num (local_scm_gc_mark_time_taken)), | |
374 | scm_cons (sym_cells_marked, scm_i_dbl2big (local_scm_gc_cells_marked)), | |
375 | scm_cons (sym_cells_swept, scm_i_dbl2big (local_scm_gc_cells_swept)), | |
c2cbcc57 HWN |
376 | scm_cons (sym_malloc_yield, scm_long2num (local_scm_gc_malloc_yield_percentage)), |
377 | scm_cons (sym_cell_yield, scm_long2num (local_scm_gc_cell_yield_percentage)), | |
c8a1bdc4 HWN |
378 | scm_cons (sym_heap_segments, heap_segs), |
379 | SCM_UNDEFINED); | |
380 | SCM_ALLOW_INTS; | |
381 | ||
382 | free (bounds); | |
383 | return answer; | |
0f2d19dd | 384 | } |
c8a1bdc4 | 385 | #undef FUNC_NAME |
0f2d19dd | 386 | |
c8a1bdc4 HWN |
387 | static void |
388 | gc_start_stats (const char *what SCM_UNUSED) | |
e4a7824f | 389 | { |
c8a1bdc4 | 390 | t_before_gc = scm_c_get_internal_run_time (); |
539b08a4 | 391 | |
c8a1bdc4 HWN |
392 | scm_gc_cells_marked_acc += (double) scm_gc_cells_swept |
393 | - (double) scm_gc_cells_collected; | |
c2cbcc57 | 394 | scm_gc_cells_swept_acc += (double) scm_gc_cells_swept; |
e4a7824f | 395 | |
c2cbcc57 HWN |
396 | scm_gc_cell_yield_percentage = ( scm_gc_cells_collected * 100 ) / SCM_HEAP_SIZE; |
397 | ||
c8a1bdc4 HWN |
398 | scm_gc_cells_swept = 0; |
399 | scm_gc_cells_collected_1 = scm_gc_cells_collected; | |
539b08a4 | 400 | |
c8a1bdc4 HWN |
401 | /* |
402 | CELLS SWEPT is another word for the number of cells that were | |
403 | examined during GC. YIELD is the number that we cleaned | |
404 | out. MARKED is the number that weren't cleaned. | |
405 | */ | |
406 | scm_gc_cells_collected = 0; | |
407 | scm_gc_malloc_collected = 0; | |
408 | scm_gc_ports_collected = 0; | |
e4a7824f | 409 | } |
acf4331f | 410 | |
c8a1bdc4 HWN |
411 | static void |
412 | gc_end_stats () | |
0f2d19dd | 413 | { |
c8a1bdc4 HWN |
414 | unsigned long t = scm_c_get_internal_run_time (); |
415 | scm_gc_time_taken += (t - t_before_gc); | |
539b08a4 | 416 | |
c8a1bdc4 | 417 | ++scm_gc_times; |
0f2d19dd | 418 | } |
acf4331f | 419 | |
0f2d19dd | 420 | |
c8a1bdc4 HWN |
421 | SCM_DEFINE (scm_object_address, "object-address", 1, 0, 0, |
422 | (SCM obj), | |
423 | "Return an integer that for the lifetime of @var{obj} is uniquely\n" | |
424 | "returned by this function for @var{obj}") | |
425 | #define FUNC_NAME s_scm_object_address | |
c68296f8 | 426 | { |
c8a1bdc4 | 427 | return scm_ulong2num ((unsigned long) SCM_UNPACK (obj)); |
c68296f8 | 428 | } |
c8a1bdc4 | 429 | #undef FUNC_NAME |
c68296f8 | 430 | |
1be6b49c | 431 | |
c8a1bdc4 HWN |
432 | SCM_DEFINE (scm_gc, "gc", 0, 0, 0, |
433 | (), | |
434 | "Scans all of SCM objects and reclaims for further use those that are\n" | |
435 | "no longer accessible.") | |
436 | #define FUNC_NAME s_scm_gc | |
437 | { | |
438 | SCM_DEFER_INTS; | |
439 | scm_igc ("call"); | |
440 | SCM_ALLOW_INTS; | |
441 | return SCM_UNSPECIFIED; | |
9d47a1e6 | 442 | } |
c8a1bdc4 | 443 | #undef FUNC_NAME |
9d47a1e6 | 444 | |
c68296f8 MV |
445 | |
446 | \f | |
0f2d19dd | 447 | |
c8a1bdc4 HWN |
448 | /* When we get POSIX threads support, the master will be global and |
449 | * common while the freelist will be individual for each thread. | |
0f2d19dd JB |
450 | */ |
451 | ||
c8a1bdc4 HWN |
452 | SCM |
453 | scm_gc_for_newcell (scm_t_cell_type_statistics *freelist, SCM *free_cells) | |
0f2d19dd | 454 | { |
c8a1bdc4 HWN |
455 | SCM cell; |
456 | ||
457 | ++scm_ints_disabled; | |
0f2d19dd | 458 | |
c8a1bdc4 HWN |
459 | *free_cells = scm_i_sweep_some_segments (freelist); |
460 | if (*free_cells == SCM_EOL && scm_i_gc_grow_heap_p (freelist)) | |
461 | { | |
462 | freelist->heap_segment_idx = scm_i_get_new_heap_segment (freelist, abort_on_error); | |
463 | *free_cells = scm_i_sweep_some_segments (freelist); | |
464 | } | |
acb0a19c | 465 | |
c8a1bdc4 HWN |
466 | if (*free_cells == SCM_EOL && !scm_block_gc) |
467 | { | |
468 | /* | |
469 | with the advent of lazy sweep, GC yield is only know just | |
470 | before doing the GC. | |
471 | */ | |
472 | scm_i_adjust_min_yield (freelist); | |
473 | ||
474 | /* | |
475 | out of fresh cells. Try to get some new ones. | |
476 | */ | |
0f2d19dd | 477 | |
c8a1bdc4 | 478 | scm_igc ("cells"); |
a00c95d9 | 479 | |
c8a1bdc4 HWN |
480 | *free_cells = scm_i_sweep_some_segments (freelist); |
481 | } | |
482 | ||
483 | if (*free_cells == SCM_EOL) | |
484 | { | |
485 | /* | |
486 | failed getting new cells. Get new juice or die. | |
487 | */ | |
488 | freelist->heap_segment_idx = scm_i_get_new_heap_segment (freelist, abort_on_error); | |
489 | *free_cells = scm_i_sweep_some_segments (freelist); | |
490 | } | |
491 | ||
492 | if (*free_cells == SCM_EOL) | |
493 | abort (); | |
0f2d19dd | 494 | |
c8a1bdc4 | 495 | cell = *free_cells; |
0f2d19dd | 496 | |
c8a1bdc4 | 497 | --scm_ints_disabled; |
0f2d19dd | 498 | |
c8a1bdc4 HWN |
499 | *free_cells = SCM_FREE_CELL_CDR (cell); |
500 | return cell; | |
501 | } | |
4a4c9785 | 502 | |
4a4c9785 | 503 | |
c8a1bdc4 HWN |
504 | scm_t_c_hook scm_before_gc_c_hook; |
505 | scm_t_c_hook scm_before_mark_c_hook; | |
506 | scm_t_c_hook scm_before_sweep_c_hook; | |
507 | scm_t_c_hook scm_after_sweep_c_hook; | |
508 | scm_t_c_hook scm_after_gc_c_hook; | |
4a4c9785 | 509 | |
c8a1bdc4 HWN |
510 | void |
511 | scm_igc (const char *what) | |
512 | { | |
513 | ++scm_gc_running_p; | |
514 | scm_c_hook_run (&scm_before_gc_c_hook, 0); | |
a00c95d9 | 515 | |
c8a1bdc4 HWN |
516 | #ifdef DEBUGINFO |
517 | fprintf (stderr,"gc reason %s\n", what); | |
518 | ||
519 | fprintf (stderr, | |
520 | SCM_NULLP (scm_i_freelist) | |
521 | ? "*" | |
522 | : (SCM_NULLP (scm_i_freelist2) ? "o" : "m")); | |
523 | #endif | |
4c48ba06 | 524 | |
c8a1bdc4 HWN |
525 | /* During the critical section, only the current thread may run. */ |
526 | SCM_CRITICAL_SECTION_START; | |
a00c95d9 | 527 | |
c8a1bdc4 | 528 | if (!scm_stack_base || scm_block_gc) |
d6884e63 | 529 | { |
c8a1bdc4 HWN |
530 | --scm_gc_running_p; |
531 | return; | |
d6884e63 ML |
532 | } |
533 | ||
c8a1bdc4 | 534 | gc_start_stats (what); |
a00c95d9 | 535 | |
c8a1bdc4 HWN |
536 | if (scm_gc_heap_lock) |
537 | /* We've invoked the collector while a GC is already in progress. | |
538 | That should never happen. */ | |
539 | abort (); | |
a00c95d9 | 540 | |
c8a1bdc4 | 541 | ++scm_gc_heap_lock; |
a00c95d9 | 542 | |
c8a1bdc4 HWN |
543 | /* |
544 | Let's finish the sweep. The conservative GC might point into the | |
545 | garbage, and marking that would create a mess. | |
546 | */ | |
547 | scm_i_sweep_all_segments("GC"); | |
548 | if (scm_mallocated < scm_i_deprecated_memory_return) | |
b6efc951 | 549 | { |
c8a1bdc4 HWN |
550 | /* The byte count of allocated objects has underflowed. This is |
551 | probably because you forgot to report the sizes of objects you | |
552 | have allocated, by calling scm_done_malloc or some such. When | |
553 | the GC freed them, it subtracted their size from | |
554 | scm_mallocated, which underflowed. */ | |
555 | fprintf (stderr, | |
556 | "scm_gc_sweep: Byte count of allocated objects has underflowed.\n" | |
557 | "This is probably because the GC hasn't been correctly informed\n" | |
558 | "about object sizes\n"); | |
b6efc951 DH |
559 | abort (); |
560 | } | |
c8a1bdc4 | 561 | scm_mallocated -= scm_i_deprecated_memory_return; |
0f2d19dd | 562 | |
c8a1bdc4 HWN |
563 | |
564 | ||
565 | scm_c_hook_run (&scm_before_mark_c_hook, 0); | |
b6efc951 | 566 | |
c8a1bdc4 HWN |
567 | scm_mark_all (); |
568 | ||
c2cbcc57 | 569 | scm_gc_mark_time_taken += (scm_c_get_internal_run_time () - t_before_gc); |
c8a1bdc4 HWN |
570 | |
571 | scm_c_hook_run (&scm_before_sweep_c_hook, 0); | |
572 | ||
573 | /* | |
574 | Moved this lock upwards so that we can alloc new heap at the end of a sweep. | |
0f2d19dd | 575 | |
c8a1bdc4 | 576 | DOCME: why should the heap be locked anyway? |
0f2d19dd | 577 | */ |
c8a1bdc4 | 578 | --scm_gc_heap_lock; |
a00c95d9 | 579 | |
c8a1bdc4 | 580 | scm_gc_sweep (); |
0f2d19dd | 581 | |
c8a1bdc4 HWN |
582 | scm_c_hook_run (&scm_after_sweep_c_hook, 0); |
583 | gc_end_stats (); | |
584 | ||
585 | SCM_CRITICAL_SECTION_END; | |
586 | scm_c_hook_run (&scm_after_gc_c_hook, 0); | |
587 | --scm_gc_running_p; | |
588 | } | |
589 | ||
590 | \f | |
0f2d19dd | 591 | |
a00c95d9 | 592 | |
0f2d19dd | 593 | |
0f2d19dd | 594 | |
c8a1bdc4 HWN |
595 | |
596 | \f | |
0f2d19dd | 597 | |
0f2d19dd JB |
598 | \f |
599 | /* {GC Protection Helper Functions} | |
600 | */ | |
601 | ||
602 | ||
5d2b97cd DH |
603 | /* |
604 | * If within a function you need to protect one or more scheme objects from | |
605 | * garbage collection, pass them as parameters to one of the | |
606 | * scm_remember_upto_here* functions below. These functions don't do | |
607 | * anything, but since the compiler does not know that they are actually | |
608 | * no-ops, it will generate code that calls these functions with the given | |
609 | * parameters. Therefore, you can be sure that the compiler will keep those | |
610 | * scheme values alive (on the stack or in a register) up to the point where | |
611 | * scm_remember_upto_here* is called. In other words, place the call to | |
592996c9 | 612 | * scm_remember_upto_here* _behind_ the last code in your function, that |
5d2b97cd DH |
613 | * depends on the scheme object to exist. |
614 | * | |
8c494e99 DH |
615 | * Example: We want to make sure that the string object str does not get |
616 | * garbage collected during the execution of 'some_function' in the code | |
617 | * below, because otherwise the characters belonging to str would be freed and | |
5d2b97cd DH |
618 | * 'some_function' might access freed memory. To make sure that the compiler |
619 | * keeps str alive on the stack or in a register such that it is visible to | |
620 | * the conservative gc we add the call to scm_remember_upto_here_1 _after_ the | |
621 | * call to 'some_function'. Note that this would not be necessary if str was | |
622 | * used anyway after the call to 'some_function'. | |
623 | * char *chars = SCM_STRING_CHARS (str); | |
624 | * some_function (chars); | |
625 | * scm_remember_upto_here_1 (str); // str will be alive up to this point. | |
626 | */ | |
627 | ||
628 | void | |
e81d98ec | 629 | scm_remember_upto_here_1 (SCM obj SCM_UNUSED) |
5d2b97cd DH |
630 | { |
631 | /* Empty. Protects a single object from garbage collection. */ | |
632 | } | |
633 | ||
634 | void | |
e81d98ec | 635 | scm_remember_upto_here_2 (SCM obj1 SCM_UNUSED, SCM obj2 SCM_UNUSED) |
5d2b97cd DH |
636 | { |
637 | /* Empty. Protects two objects from garbage collection. */ | |
638 | } | |
639 | ||
640 | void | |
e81d98ec | 641 | scm_remember_upto_here (SCM obj SCM_UNUSED, ...) |
5d2b97cd DH |
642 | { |
643 | /* Empty. Protects any number of objects from garbage collection. */ | |
644 | } | |
645 | ||
c209c88e | 646 | /* |
41b0806d GB |
647 | These crazy functions prevent garbage collection |
648 | of arguments after the first argument by | |
649 | ensuring they remain live throughout the | |
650 | function because they are used in the last | |
651 | line of the code block. | |
652 | It'd be better to have a nice compiler hint to | |
653 | aid the conservative stack-scanning GC. --03/09/00 gjb */ | |
0f2d19dd JB |
654 | SCM |
655 | scm_return_first (SCM elt, ...) | |
0f2d19dd JB |
656 | { |
657 | return elt; | |
658 | } | |
659 | ||
41b0806d GB |
660 | int |
661 | scm_return_first_int (int i, ...) | |
662 | { | |
663 | return i; | |
664 | } | |
665 | ||
0f2d19dd | 666 | |
0f2d19dd | 667 | SCM |
6e8d25a6 | 668 | scm_permanent_object (SCM obj) |
0f2d19dd JB |
669 | { |
670 | SCM_REDEFER_INTS; | |
671 | scm_permobjs = scm_cons (obj, scm_permobjs); | |
672 | SCM_REALLOW_INTS; | |
673 | return obj; | |
674 | } | |
675 | ||
676 | ||
7bd4fbe2 MD |
677 | /* Protect OBJ from the garbage collector. OBJ will not be freed, even if all |
678 | other references are dropped, until the object is unprotected by calling | |
6b1b030e | 679 | scm_gc_unprotect_object (OBJ). Calls to scm_gc_protect/unprotect_object nest, |
7bd4fbe2 MD |
680 | i. e. it is possible to protect the same object several times, but it is |
681 | necessary to unprotect the object the same number of times to actually get | |
682 | the object unprotected. It is an error to unprotect an object more often | |
683 | than it has been protected before. The function scm_protect_object returns | |
684 | OBJ. | |
685 | */ | |
686 | ||
687 | /* Implementation note: For every object X, there is a counter which | |
6b1b030e | 688 | scm_gc_protect_object(X) increments and scm_gc_unprotect_object(X) decrements. |
7bd4fbe2 | 689 | */ |
686765af | 690 | |
ef290276 | 691 | SCM |
6b1b030e | 692 | scm_gc_protect_object (SCM obj) |
ef290276 | 693 | { |
686765af | 694 | SCM handle; |
9d47a1e6 | 695 | |
686765af | 696 | /* This critical section barrier will be replaced by a mutex. */ |
2dd6a83a | 697 | SCM_REDEFER_INTS; |
9d47a1e6 | 698 | |
0f0f0899 | 699 | handle = scm_hashq_create_handle_x (scm_protects, obj, SCM_MAKINUM (0)); |
1be6b49c | 700 | SCM_SETCDR (handle, scm_sum (SCM_CDR (handle), SCM_MAKINUM (1))); |
9d47a1e6 | 701 | |
2dd6a83a | 702 | SCM_REALLOW_INTS; |
9d47a1e6 | 703 | |
ef290276 JB |
704 | return obj; |
705 | } | |
706 | ||
707 | ||
708 | /* Remove any protection for OBJ established by a prior call to | |
dab7f566 | 709 | scm_protect_object. This function returns OBJ. |
ef290276 | 710 | |
dab7f566 | 711 | See scm_protect_object for more information. */ |
ef290276 | 712 | SCM |
6b1b030e | 713 | scm_gc_unprotect_object (SCM obj) |
ef290276 | 714 | { |
686765af | 715 | SCM handle; |
9d47a1e6 | 716 | |
686765af | 717 | /* This critical section barrier will be replaced by a mutex. */ |
2dd6a83a | 718 | SCM_REDEFER_INTS; |
9d47a1e6 | 719 | |
686765af | 720 | handle = scm_hashq_get_handle (scm_protects, obj); |
9d47a1e6 | 721 | |
22a52da1 | 722 | if (SCM_FALSEP (handle)) |
686765af | 723 | { |
0f0f0899 MD |
724 | fprintf (stderr, "scm_unprotect_object called on unprotected object\n"); |
725 | abort (); | |
686765af | 726 | } |
6a199940 DH |
727 | else |
728 | { | |
1be6b49c ML |
729 | SCM count = scm_difference (SCM_CDR (handle), SCM_MAKINUM (1)); |
730 | if (SCM_EQ_P (count, SCM_MAKINUM (0))) | |
6a199940 DH |
731 | scm_hashq_remove_x (scm_protects, obj); |
732 | else | |
1be6b49c | 733 | SCM_SETCDR (handle, count); |
6a199940 | 734 | } |
686765af | 735 | |
2dd6a83a | 736 | SCM_REALLOW_INTS; |
ef290276 JB |
737 | |
738 | return obj; | |
739 | } | |
740 | ||
6b1b030e ML |
741 | void |
742 | scm_gc_register_root (SCM *p) | |
743 | { | |
744 | SCM handle; | |
745 | SCM key = scm_long2num ((long) p); | |
eae33935 | 746 | |
6b1b030e ML |
747 | /* This critical section barrier will be replaced by a mutex. */ |
748 | SCM_REDEFER_INTS; | |
749 | ||
750 | handle = scm_hashv_create_handle_x (scm_gc_registered_roots, key, SCM_MAKINUM (0)); | |
751 | SCM_SETCDR (handle, scm_sum (SCM_CDR (handle), SCM_MAKINUM (1))); | |
752 | ||
753 | SCM_REALLOW_INTS; | |
754 | } | |
755 | ||
756 | void | |
757 | scm_gc_unregister_root (SCM *p) | |
758 | { | |
759 | SCM handle; | |
760 | SCM key = scm_long2num ((long) p); | |
761 | ||
762 | /* This critical section barrier will be replaced by a mutex. */ | |
763 | SCM_REDEFER_INTS; | |
764 | ||
765 | handle = scm_hashv_get_handle (scm_gc_registered_roots, key); | |
766 | ||
767 | if (SCM_FALSEP (handle)) | |
768 | { | |
769 | fprintf (stderr, "scm_gc_unregister_root called on unregistered root\n"); | |
770 | abort (); | |
771 | } | |
772 | else | |
773 | { | |
774 | SCM count = scm_difference (SCM_CDR (handle), SCM_MAKINUM (1)); | |
775 | if (SCM_EQ_P (count, SCM_MAKINUM (0))) | |
776 | scm_hashv_remove_x (scm_gc_registered_roots, key); | |
777 | else | |
778 | SCM_SETCDR (handle, count); | |
779 | } | |
780 | ||
781 | SCM_REALLOW_INTS; | |
782 | } | |
783 | ||
784 | void | |
785 | scm_gc_register_roots (SCM *b, unsigned long n) | |
786 | { | |
787 | SCM *p = b; | |
788 | for (; p < b + n; ++p) | |
789 | scm_gc_register_root (p); | |
790 | } | |
791 | ||
792 | void | |
793 | scm_gc_unregister_roots (SCM *b, unsigned long n) | |
794 | { | |
795 | SCM *p = b; | |
796 | for (; p < b + n; ++p) | |
797 | scm_gc_unregister_root (p); | |
798 | } | |
799 | ||
04a98cff | 800 | int scm_i_terminating; |
c45acc34 JB |
801 | |
802 | /* called on process termination. */ | |
e52ceaac MD |
803 | #ifdef HAVE_ATEXIT |
804 | static void | |
805 | cleanup (void) | |
806 | #else | |
807 | #ifdef HAVE_ON_EXIT | |
51157deb MD |
808 | extern int on_exit (void (*procp) (), int arg); |
809 | ||
e52ceaac MD |
810 | static void |
811 | cleanup (int status, void *arg) | |
812 | #else | |
813 | #error Dont know how to setup a cleanup handler on your system. | |
814 | #endif | |
815 | #endif | |
c45acc34 | 816 | { |
04a98cff | 817 | scm_i_terminating = 1; |
c45acc34 JB |
818 | scm_flush_all_ports (); |
819 | } | |
ef290276 | 820 | |
0f2d19dd | 821 | \f |
a00c95d9 | 822 | |
4c48ba06 | 823 | |
c8a1bdc4 HWN |
824 | /* |
825 | MOVE THIS FUNCTION. IT DOES NOT HAVE ANYTHING TODO WITH GC. | |
826 | */ | |
85db4a2c DH |
827 | |
828 | /* Get an integer from an environment variable. */ | |
c8a1bdc4 HWN |
829 | int |
830 | scm_getenv_int (const char *var, int def) | |
85db4a2c | 831 | { |
c8a1bdc4 HWN |
832 | char *end = 0; |
833 | char *val = getenv (var); | |
834 | long res = def; | |
85db4a2c DH |
835 | if (!val) |
836 | return def; | |
837 | res = strtol (val, &end, 10); | |
838 | if (end == val) | |
839 | return def; | |
840 | return res; | |
841 | } | |
842 | ||
843 | ||
4a4c9785 | 844 | int |
85db4a2c | 845 | scm_init_storage () |
0f2d19dd | 846 | { |
1be6b49c | 847 | size_t j; |
0f2d19dd JB |
848 | |
849 | j = SCM_NUM_PROTECTS; | |
850 | while (j) | |
851 | scm_sys_protects[--j] = SCM_BOOL_F; | |
852 | scm_block_gc = 1; | |
4a4c9785 | 853 | |
c8a1bdc4 HWN |
854 | scm_gc_init_freelist(); |
855 | scm_gc_init_malloc (); | |
0f2d19dd JB |
856 | |
857 | j = SCM_HEAP_SEG_SIZE; | |
d6884e63 | 858 | |
c8a1bdc4 | 859 | |
acb0a19c | 860 | |
801cb5e7 MD |
861 | scm_c_hook_init (&scm_before_gc_c_hook, 0, SCM_C_HOOK_NORMAL); |
862 | scm_c_hook_init (&scm_before_mark_c_hook, 0, SCM_C_HOOK_NORMAL); | |
863 | scm_c_hook_init (&scm_before_sweep_c_hook, 0, SCM_C_HOOK_NORMAL); | |
864 | scm_c_hook_init (&scm_after_sweep_c_hook, 0, SCM_C_HOOK_NORMAL); | |
865 | scm_c_hook_init (&scm_after_gc_c_hook, 0, SCM_C_HOOK_NORMAL); | |
0f2d19dd JB |
866 | |
867 | /* Initialise the list of ports. */ | |
f5fd8aa2 MV |
868 | scm_port_table = (scm_t_port **) |
869 | malloc (sizeof (scm_t_port *) * scm_port_table_room); | |
870 | if (!scm_port_table) | |
0f2d19dd JB |
871 | return 1; |
872 | ||
a18bcd0e | 873 | #ifdef HAVE_ATEXIT |
c45acc34 | 874 | atexit (cleanup); |
e52ceaac MD |
875 | #else |
876 | #ifdef HAVE_ON_EXIT | |
877 | on_exit (cleanup, 0); | |
878 | #endif | |
a18bcd0e | 879 | #endif |
0f2d19dd | 880 | |
8960e0a0 | 881 | scm_stand_in_procs = SCM_EOL; |
0f2d19dd | 882 | scm_permobjs = SCM_EOL; |
00ffa0e7 | 883 | scm_protects = scm_c_make_hash_table (31); |
6b1b030e | 884 | scm_gc_registered_roots = scm_c_make_hash_table (31); |
d6884e63 | 885 | |
0f2d19dd JB |
886 | return 0; |
887 | } | |
939794ce | 888 | |
0f2d19dd JB |
889 | \f |
890 | ||
939794ce DH |
891 | SCM scm_after_gc_hook; |
892 | ||
939794ce DH |
893 | static SCM gc_async; |
894 | ||
939794ce DH |
895 | /* The function gc_async_thunk causes the execution of the after-gc-hook. It |
896 | * is run after the gc, as soon as the asynchronous events are handled by the | |
897 | * evaluator. | |
898 | */ | |
899 | static SCM | |
900 | gc_async_thunk (void) | |
901 | { | |
902 | scm_c_run_hook (scm_after_gc_hook, SCM_EOL); | |
939794ce DH |
903 | return SCM_UNSPECIFIED; |
904 | } | |
905 | ||
906 | ||
907 | /* The function mark_gc_async is run by the scm_after_gc_c_hook at the end of | |
908 | * the garbage collection. The only purpose of this function is to mark the | |
909 | * gc_async (which will eventually lead to the execution of the | |
910 | * gc_async_thunk). | |
911 | */ | |
912 | static void * | |
e81d98ec DH |
913 | mark_gc_async (void * hook_data SCM_UNUSED, |
914 | void *func_data SCM_UNUSED, | |
915 | void *data SCM_UNUSED) | |
916 | { | |
917 | /* If cell access debugging is enabled, the user may choose to perform | |
918 | * additional garbage collections after an arbitrary number of cell | |
919 | * accesses. We don't want the scheme level after-gc-hook to be performed | |
920 | * for each of these garbage collections for the following reason: The | |
921 | * execution of the after-gc-hook causes cell accesses itself. Thus, if the | |
922 | * after-gc-hook was performed with every gc, and if the gc was performed | |
923 | * after a very small number of cell accesses, then the number of cell | |
924 | * accesses during the execution of the after-gc-hook will suffice to cause | |
925 | * the execution of the next gc. Then, guile would keep executing the | |
926 | * after-gc-hook over and over again, and would never come to do other | |
927 | * things. | |
eae33935 | 928 | * |
e81d98ec DH |
929 | * To overcome this problem, if cell access debugging with additional |
930 | * garbage collections is enabled, the after-gc-hook is never run by the | |
931 | * garbage collecter. When running guile with cell access debugging and the | |
932 | * execution of the after-gc-hook is desired, then it is necessary to run | |
933 | * the hook explicitly from the user code. This has the effect, that from | |
934 | * the scheme level point of view it seems that garbage collection is | |
935 | * performed with a much lower frequency than it actually is. Obviously, | |
936 | * this will not work for code that depends on a fixed one to one | |
937 | * relationship between the execution counts of the C level garbage | |
938 | * collection hooks and the execution count of the scheme level | |
939 | * after-gc-hook. | |
940 | */ | |
941 | #if (SCM_DEBUG_CELL_ACCESSES == 1) | |
942 | if (debug_cells_gc_interval == 0) | |
943 | scm_system_async_mark (gc_async); | |
944 | #else | |
939794ce | 945 | scm_system_async_mark (gc_async); |
e81d98ec DH |
946 | #endif |
947 | ||
939794ce DH |
948 | return NULL; |
949 | } | |
950 | ||
0f2d19dd JB |
951 | void |
952 | scm_init_gc () | |
0f2d19dd | 953 | { |
939794ce DH |
954 | SCM after_gc_thunk; |
955 | ||
c8a1bdc4 HWN |
956 | |
957 | scm_gc_init_mark (); | |
d678e25c | 958 | |
fde50407 ML |
959 | scm_after_gc_hook = scm_permanent_object (scm_make_hook (SCM_INUM0)); |
960 | scm_c_define ("after-gc-hook", scm_after_gc_hook); | |
939794ce | 961 | |
9a441ddb MV |
962 | after_gc_thunk = scm_c_make_subr ("%gc-thunk", scm_tc7_subr_0, |
963 | gc_async_thunk); | |
23670993 | 964 | gc_async = scm_system_async (after_gc_thunk); /* protected via scm_asyncs */ |
939794ce DH |
965 | |
966 | scm_c_hook_add (&scm_after_gc_c_hook, mark_gc_async, NULL, 0); | |
967 | ||
a0599745 | 968 | #include "libguile/gc.x" |
0f2d19dd | 969 | } |
89e00824 | 970 | |
c8a1bdc4 HWN |
971 | |
972 | void | |
973 | scm_gc_sweep (void) | |
974 | #define FUNC_NAME "scm_gc_sweep" | |
975 | { | |
976 | scm_i_deprecated_memory_return = 0; | |
977 | ||
978 | scm_i_gc_sweep_freelist_reset (&scm_i_master_freelist); | |
979 | scm_i_gc_sweep_freelist_reset (&scm_i_master_freelist2); | |
980 | ||
981 | /* | |
982 | NOTHING HERE: LAZY SWEEPING ! | |
983 | */ | |
984 | scm_i_reset_segments (); | |
985 | ||
986 | /* When we move to POSIX threads private freelists should probably | |
987 | be GC-protected instead. */ | |
988 | scm_i_freelist = SCM_EOL; | |
989 | scm_i_freelist2 = SCM_EOL; | |
990 | } | |
991 | ||
992 | #undef FUNC_NAME | |
993 | ||
994 | ||
56495472 | 995 | |
89e00824 ML |
996 | /* |
997 | Local Variables: | |
998 | c-file-style: "gnu" | |
999 | End: | |
1000 | */ |