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