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