Commit | Line | Data |
---|---|---|
0f595d7d LC |
1 | /* Copyright (C) 1995,1996,1997,1998,1999,2000,2001, 2002, 2003, 2006, |
2 | * 2008, 2009, 2010, 2011, 2012, 2013 Free Software Foundation, Inc. | |
a00c95d9 | 3 | * |
73be1d9e | 4 | * This library is free software; you can redistribute it and/or |
53befeb7 NJ |
5 | * modify it under the terms of the GNU Lesser General Public License |
6 | * as published by the Free Software Foundation; either version 3 of | |
7 | * the License, or (at your option) any later version. | |
a00c95d9 | 8 | * |
53befeb7 NJ |
9 | * This library is distributed in the hope that it will be useful, but |
10 | * WITHOUT ANY WARRANTY; without even the implied warranty of | |
73be1d9e MV |
11 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
12 | * Lesser General Public License for more details. | |
a00c95d9 | 13 | * |
73be1d9e MV |
14 | * You should have received a copy of the GNU Lesser General Public |
15 | * License along with this library; if not, write to the Free Software | |
53befeb7 NJ |
16 | * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA |
17 | * 02110-1301 USA | |
73be1d9e | 18 | */ |
1bbd0b84 | 19 | |
37ddcaf6 MD |
20 | /* #define DEBUGINFO */ |
21 | ||
dbb605f5 | 22 | #ifdef HAVE_CONFIG_H |
aa54a9b0 RB |
23 | # include <config.h> |
24 | #endif | |
56495472 | 25 | |
52b680f8 AW |
26 | #define SCM_BUILDING_DEPRECATED_CODE |
27 | ||
e7bca227 LC |
28 | #include "libguile/gen-scmconfig.h" |
29 | ||
0f2d19dd | 30 | #include <stdio.h> |
e6e2e95a | 31 | #include <errno.h> |
783e7774 | 32 | #include <string.h> |
34cf38c3 | 33 | #include <stdlib.h> |
6360beb2 | 34 | #include <math.h> |
e6e2e95a | 35 | |
3ec17f28 LC |
36 | #ifdef __ia64__ |
37 | #include <ucontext.h> | |
38 | extern unsigned long * __libc_ia64_register_backing_store_base; | |
39 | #endif | |
40 | ||
a0599745 | 41 | #include "libguile/_scm.h" |
0a7a7445 | 42 | #include "libguile/eval.h" |
a0599745 MD |
43 | #include "libguile/stime.h" |
44 | #include "libguile/stackchk.h" | |
45 | #include "libguile/struct.h" | |
a0599745 | 46 | #include "libguile/smob.h" |
2fa901a5 | 47 | #include "libguile/arrays.h" |
a0599745 MD |
48 | #include "libguile/async.h" |
49 | #include "libguile/ports.h" | |
50 | #include "libguile/root.h" | |
51 | #include "libguile/strings.h" | |
52 | #include "libguile/vectors.h" | |
801cb5e7 | 53 | #include "libguile/weaks.h" |
686765af | 54 | #include "libguile/hashtab.h" |
ecf470a2 | 55 | #include "libguile/tags.h" |
a0599745 | 56 | |
c8a1bdc4 | 57 | #include "libguile/private-gc.h" |
a0599745 | 58 | #include "libguile/validate.h" |
1be6b49c | 59 | #include "libguile/deprecation.h" |
a0599745 | 60 | #include "libguile/gc.h" |
9de87eea | 61 | #include "libguile/dynwind.h" |
fce59c93 | 62 | |
1c44468d | 63 | #include "libguile/bdw-gc.h" |
a82e7953 | 64 | |
cc3546b0 AW |
65 | /* For GC_set_start_callback. */ |
66 | #include <gc/gc_mark.h> | |
67 | ||
bc9d9bb2 | 68 | #ifdef GUILE_DEBUG_MALLOC |
a0599745 | 69 | #include "libguile/debug-malloc.h" |
bc9d9bb2 MD |
70 | #endif |
71 | ||
0f2d19dd | 72 | #ifdef HAVE_UNISTD_H |
95b88819 | 73 | #include <unistd.h> |
0f2d19dd JB |
74 | #endif |
75 | ||
eae33935 | 76 | /* Set this to != 0 if every cell that is accessed shall be checked: |
61045190 | 77 | */ |
eab1b259 HWN |
78 | int scm_debug_cell_accesses_p = 0; |
79 | int scm_expensive_debug_cell_accesses_p = 0; | |
406c7d90 | 80 | |
e81d98ec DH |
81 | /* Set this to 0 if no additional gc's shall be performed, otherwise set it to |
82 | * the number of cell accesses after which a gc shall be called. | |
83 | */ | |
eab1b259 | 84 | int scm_debug_cells_gc_interval = 0; |
e81d98ec | 85 | |
f0d1bacd | 86 | #if SCM_ENABLE_DEPRECATED == 1 |
acbccb0c LC |
87 | /* Hash table that keeps a reference to objects the user wants to protect from |
88 | garbage collection. It could arguably be private but applications have come | |
89 | to rely on it (e.g., Lilypond 2.13.9). */ | |
90 | SCM scm_protects; | |
f0d1bacd AW |
91 | #else |
92 | static SCM scm_protects; | |
93 | #endif | |
e7efe8e7 | 94 | |
eab1b259 HWN |
95 | #if (SCM_DEBUG_CELL_ACCESSES == 1) |
96 | ||
97 | ||
98 | /* | |
99 | ||
100 | Assert that the given object is a valid reference to a valid cell. This | |
101 | test involves to determine whether the object is a cell pointer, whether | |
102 | this pointer actually points into a heap segment and whether the cell | |
103 | pointed to is not a free cell. Further, additional garbage collections may | |
104 | get executed after a user defined number of cell accesses. This helps to | |
105 | find places in the C code where references are dropped for extremely short | |
106 | periods. | |
107 | ||
108 | */ | |
406c7d90 | 109 | void |
eab1b259 | 110 | scm_i_expensive_validation_check (SCM cell) |
406c7d90 | 111 | { |
eab1b259 HWN |
112 | /* If desired, perform additional garbage collections after a user |
113 | * defined number of cell accesses. | |
114 | */ | |
115 | if (scm_debug_cells_gc_interval) | |
116 | { | |
117 | static unsigned int counter = 0; | |
61045190 | 118 | |
eab1b259 HWN |
119 | if (counter != 0) |
120 | { | |
121 | --counter; | |
122 | } | |
123 | else | |
124 | { | |
125 | counter = scm_debug_cells_gc_interval; | |
b17e0ac3 | 126 | scm_gc (); |
eab1b259 HWN |
127 | } |
128 | } | |
129 | } | |
130 | ||
8c93b597 LC |
131 | /* Whether cell validation is already running. */ |
132 | static int scm_i_cell_validation_already_running = 0; | |
133 | ||
eab1b259 HWN |
134 | void |
135 | scm_assert_cell_valid (SCM cell) | |
136 | { | |
137 | if (!scm_i_cell_validation_already_running && scm_debug_cell_accesses_p) | |
406c7d90 | 138 | { |
eab1b259 | 139 | scm_i_cell_validation_already_running = 1; /* set to avoid recursion */ |
406c7d90 | 140 | |
c8a1bdc4 | 141 | /* |
eab1b259 HWN |
142 | During GC, no user-code should be run, and the guile core |
143 | should use non-protected accessors. | |
144 | */ | |
c8a1bdc4 | 145 | if (scm_gc_running_p) |
eab1b259 | 146 | return; |
c8a1bdc4 HWN |
147 | |
148 | /* | |
eab1b259 HWN |
149 | Only scm_in_heap_p and rescanning the heap is wildly |
150 | expensive. | |
151 | */ | |
152 | if (scm_expensive_debug_cell_accesses_p) | |
153 | scm_i_expensive_validation_check (cell); | |
b4246e5b | 154 | |
eab1b259 | 155 | scm_i_cell_validation_already_running = 0; /* re-enable */ |
406c7d90 DH |
156 | } |
157 | } | |
158 | ||
159 | ||
eab1b259 | 160 | |
406c7d90 DH |
161 | SCM_DEFINE (scm_set_debug_cell_accesses_x, "set-debug-cell-accesses!", 1, 0, 0, |
162 | (SCM flag), | |
1e6808ea | 163 | "If @var{flag} is @code{#f}, cell access checking is disabled.\n" |
eab1b259 | 164 | "If @var{flag} is @code{#t}, cheap cell access checking is enabled,\n" |
e81d98ec | 165 | "but no additional calls to garbage collection are issued.\n" |
eab1b259 | 166 | "If @var{flag} is a number, strict cell access checking is enabled,\n" |
e81d98ec DH |
167 | "with an additional garbage collection after the given\n" |
168 | "number of cell accesses.\n" | |
1e6808ea MG |
169 | "This procedure only exists when the compile-time flag\n" |
170 | "@code{SCM_DEBUG_CELL_ACCESSES} was set to 1.") | |
406c7d90 DH |
171 | #define FUNC_NAME s_scm_set_debug_cell_accesses_x |
172 | { | |
7888309b | 173 | if (scm_is_false (flag)) |
eab1b259 HWN |
174 | { |
175 | scm_debug_cell_accesses_p = 0; | |
176 | } | |
bc36d050 | 177 | else if (scm_is_eq (flag, SCM_BOOL_T)) |
eab1b259 HWN |
178 | { |
179 | scm_debug_cells_gc_interval = 0; | |
180 | scm_debug_cell_accesses_p = 1; | |
181 | scm_expensive_debug_cell_accesses_p = 0; | |
182 | } | |
e11e83f3 | 183 | else |
eab1b259 | 184 | { |
e11e83f3 | 185 | scm_debug_cells_gc_interval = scm_to_signed_integer (flag, 0, INT_MAX); |
eab1b259 HWN |
186 | scm_debug_cell_accesses_p = 1; |
187 | scm_expensive_debug_cell_accesses_p = 1; | |
188 | } | |
406c7d90 DH |
189 | return SCM_UNSPECIFIED; |
190 | } | |
191 | #undef FUNC_NAME | |
0f2d19dd | 192 | |
ecf470a2 | 193 | |
c8a1bdc4 | 194 | #endif /* SCM_DEBUG_CELL_ACCESSES == 1 */ |
0f2d19dd JB |
195 | |
196 | \f | |
14294ce0 | 197 | |
6360beb2 AW |
198 | /* Compatibility. */ |
199 | ||
14294ce0 AW |
200 | #ifndef HAVE_GC_GET_HEAP_USAGE_SAFE |
201 | static void | |
202 | GC_get_heap_usage_safe (GC_word *pheap_size, GC_word *pfree_bytes, | |
203 | GC_word *punmapped_bytes, GC_word *pbytes_since_gc, | |
204 | GC_word *ptotal_bytes) | |
205 | { | |
206 | *pheap_size = GC_get_heap_size (); | |
207 | *pfree_bytes = GC_get_free_bytes (); | |
4eb28612 | 208 | #ifdef HAVE_GC_GET_UNMAPPED_BYTES |
14294ce0 | 209 | *punmapped_bytes = GC_get_unmapped_bytes (); |
4eb28612 CJY |
210 | #else |
211 | *punmapped_bytes = 0; | |
212 | #endif | |
14294ce0 AW |
213 | *pbytes_since_gc = GC_get_bytes_since_gc (); |
214 | *ptotal_bytes = GC_get_total_bytes (); | |
215 | } | |
216 | #endif | |
217 | ||
6360beb2 AW |
218 | #ifndef HAVE_GC_GET_FREE_SPACE_DIVISOR |
219 | static GC_word | |
220 | GC_get_free_space_divisor (void) | |
221 | { | |
222 | return GC_free_space_divisor; | |
223 | } | |
224 | #endif | |
225 | ||
14294ce0 | 226 | \f |
26224b3f LC |
227 | /* Hooks. */ |
228 | scm_t_c_hook scm_before_gc_c_hook; | |
229 | scm_t_c_hook scm_before_mark_c_hook; | |
230 | scm_t_c_hook scm_before_sweep_c_hook; | |
231 | scm_t_c_hook scm_after_sweep_c_hook; | |
232 | scm_t_c_hook scm_after_gc_c_hook; | |
945fec60 | 233 | |
0f2d19dd | 234 | |
0fbdbe6c AW |
235 | static void |
236 | run_before_gc_c_hook (void) | |
237 | { | |
e1fbe716 AW |
238 | if (!SCM_I_CURRENT_THREAD) |
239 | /* GC while a thread is spinning up; punt. */ | |
240 | return; | |
241 | ||
0fbdbe6c AW |
242 | scm_c_hook_run (&scm_before_gc_c_hook, NULL); |
243 | } | |
244 | ||
245 | ||
0f2d19dd JB |
246 | /* GC Statistics Keeping |
247 | */ | |
b74e86cf | 248 | unsigned long scm_gc_ports_collected = 0; |
00b6ef23 AW |
249 | static long gc_time_taken = 0; |
250 | static long gc_start_time = 0; | |
251 | ||
6360beb2 AW |
252 | static unsigned long free_space_divisor; |
253 | static unsigned long minimum_free_space_divisor; | |
254 | static double target_free_space_divisor; | |
b74e86cf | 255 | |
915b3f9f | 256 | static unsigned long protected_obj_count = 0; |
c2cbcc57 | 257 | |
0f2d19dd | 258 | |
17ab1dc3 | 259 | SCM_SYMBOL (sym_gc_time_taken, "gc-time-taken"); |
915b3f9f LC |
260 | SCM_SYMBOL (sym_heap_size, "heap-size"); |
261 | SCM_SYMBOL (sym_heap_free_size, "heap-free-size"); | |
262 | SCM_SYMBOL (sym_heap_total_allocated, "heap-total-allocated"); | |
17ab1dc3 | 263 | SCM_SYMBOL (sym_heap_allocated_since_gc, "heap-allocated-since-gc"); |
7eec4c37 | 264 | SCM_SYMBOL (sym_protected_objects, "protected-objects"); |
17ab1dc3 | 265 | SCM_SYMBOL (sym_times, "gc-times"); |
cf2d30f6 | 266 | |
d3dd80ab | 267 | |
0f2d19dd JB |
268 | /* {Scheme Interface to GC} |
269 | */ | |
c2cbcc57 | 270 | extern int scm_gc_malloc_yield_percentage; |
a00c95d9 | 271 | SCM_DEFINE (scm_gc_stats, "gc-stats", 0, 0, 0, |
1bbd0b84 | 272 | (), |
1e6808ea | 273 | "Return an association list of statistics about Guile's current\n" |
c8a1bdc4 | 274 | "use of storage.\n") |
1bbd0b84 | 275 | #define FUNC_NAME s_scm_gc_stats |
0f2d19dd | 276 | { |
0f2d19dd | 277 | SCM answer; |
14294ce0 | 278 | GC_word heap_size, free_bytes, unmapped_bytes, bytes_since_gc, total_bytes; |
915b3f9f | 279 | size_t gc_times; |
4c9419ac | 280 | |
14294ce0 AW |
281 | GC_get_heap_usage_safe (&heap_size, &free_bytes, &unmapped_bytes, |
282 | &bytes_since_gc, &total_bytes); | |
0f595d7d LC |
283 | #ifdef HAVE_GC_GET_GC_NO |
284 | /* This function was added in 7.2alpha2 (June 2009). */ | |
285 | gc_times = GC_get_gc_no (); | |
286 | #else | |
287 | /* This symbol is deprecated as of 7.3. */ | |
14294ce0 | 288 | gc_times = GC_gc_no; |
0f595d7d | 289 | #endif |
fca43887 | 290 | |
b9bd8526 | 291 | answer = |
00b6ef23 | 292 | scm_list_n (scm_cons (sym_gc_time_taken, scm_from_long (gc_time_taken)), |
915b3f9f LC |
293 | scm_cons (sym_heap_size, scm_from_size_t (heap_size)), |
294 | scm_cons (sym_heap_free_size, scm_from_size_t (free_bytes)), | |
295 | scm_cons (sym_heap_total_allocated, | |
296 | scm_from_size_t (total_bytes)), | |
17ab1dc3 AW |
297 | scm_cons (sym_heap_allocated_since_gc, |
298 | scm_from_size_t (bytes_since_gc)), | |
915b3f9f LC |
299 | scm_cons (sym_protected_objects, |
300 | scm_from_ulong (protected_obj_count)), | |
301 | scm_cons (sym_times, scm_from_size_t (gc_times)), | |
b9bd8526 | 302 | SCM_UNDEFINED); |
fca43887 | 303 | |
c8a1bdc4 | 304 | return answer; |
0f2d19dd | 305 | } |
c8a1bdc4 | 306 | #undef FUNC_NAME |
0f2d19dd | 307 | |
539b08a4 | 308 | |
7f9ec18a LC |
309 | SCM_DEFINE (scm_gc_dump, "gc-dump", 0, 0, 0, |
310 | (void), | |
311 | "Dump information about the garbage collector's internal data " | |
312 | "structures and memory usage to the standard output.") | |
313 | #define FUNC_NAME s_scm_gc_dump | |
314 | { | |
315 | GC_dump (); | |
316 | ||
317 | return SCM_UNSPECIFIED; | |
318 | } | |
319 | #undef FUNC_NAME | |
320 | ||
acf4331f | 321 | |
c8a1bdc4 HWN |
322 | SCM_DEFINE (scm_object_address, "object-address", 1, 0, 0, |
323 | (SCM obj), | |
324 | "Return an integer that for the lifetime of @var{obj} is uniquely\n" | |
325 | "returned by this function for @var{obj}") | |
326 | #define FUNC_NAME s_scm_object_address | |
c68296f8 | 327 | { |
b9bd8526 | 328 | return scm_from_ulong (SCM_UNPACK (obj)); |
c68296f8 | 329 | } |
c8a1bdc4 | 330 | #undef FUNC_NAME |
c68296f8 | 331 | |
1be6b49c | 332 | |
915b3f9f LC |
333 | SCM_DEFINE (scm_gc_disable, "gc-disable", 0, 0, 0, |
334 | (), | |
335 | "Disables the garbage collector. Nested calls are permitted. " | |
336 | "GC is re-enabled once @code{gc-enable} has been called the " | |
337 | "same number of times @code{gc-disable} was called.") | |
338 | #define FUNC_NAME s_scm_gc_disable | |
339 | { | |
340 | GC_disable (); | |
341 | return SCM_UNSPECIFIED; | |
342 | } | |
343 | #undef FUNC_NAME | |
344 | ||
345 | SCM_DEFINE (scm_gc_enable, "gc-enable", 0, 0, 0, | |
346 | (), | |
347 | "Enables the garbage collector.") | |
348 | #define FUNC_NAME s_scm_gc_enable | |
349 | { | |
350 | GC_enable (); | |
351 | return SCM_UNSPECIFIED; | |
352 | } | |
353 | #undef FUNC_NAME | |
354 | ||
355 | ||
c8a1bdc4 HWN |
356 | SCM_DEFINE (scm_gc, "gc", 0, 0, 0, |
357 | (), | |
358 | "Scans all of SCM objects and reclaims for further use those that are\n" | |
359 | "no longer accessible.") | |
360 | #define FUNC_NAME s_scm_gc | |
361 | { | |
b17e0ac3 | 362 | scm_i_gc ("call"); |
f740445a AW |
363 | /* If you're calling scm_gc(), you probably want synchronous |
364 | finalization. */ | |
365 | GC_invoke_finalizers (); | |
c8a1bdc4 | 366 | return SCM_UNSPECIFIED; |
9d47a1e6 | 367 | } |
c8a1bdc4 | 368 | #undef FUNC_NAME |
9d47a1e6 | 369 | |
c8a1bdc4 | 370 | void |
b17e0ac3 | 371 | scm_i_gc (const char *what) |
c8a1bdc4 | 372 | { |
66b229d5 AW |
373 | #ifndef HAVE_GC_SET_START_CALLBACK |
374 | run_before_gc_c_hook (); | |
375 | #endif | |
26224b3f | 376 | GC_gcollect (); |
eab1b259 | 377 | } |
0f2d19dd | 378 | |
4c7016dc | 379 | |
0f2d19dd JB |
380 | \f |
381 | /* {GC Protection Helper Functions} | |
382 | */ | |
383 | ||
384 | ||
5d2b97cd DH |
385 | /* |
386 | * If within a function you need to protect one or more scheme objects from | |
387 | * garbage collection, pass them as parameters to one of the | |
388 | * scm_remember_upto_here* functions below. These functions don't do | |
389 | * anything, but since the compiler does not know that they are actually | |
390 | * no-ops, it will generate code that calls these functions with the given | |
391 | * parameters. Therefore, you can be sure that the compiler will keep those | |
392 | * scheme values alive (on the stack or in a register) up to the point where | |
393 | * scm_remember_upto_here* is called. In other words, place the call to | |
592996c9 | 394 | * scm_remember_upto_here* _behind_ the last code in your function, that |
5d2b97cd DH |
395 | * depends on the scheme object to exist. |
396 | * | |
8c494e99 DH |
397 | * Example: We want to make sure that the string object str does not get |
398 | * garbage collected during the execution of 'some_function' in the code | |
399 | * below, because otherwise the characters belonging to str would be freed and | |
5d2b97cd DH |
400 | * 'some_function' might access freed memory. To make sure that the compiler |
401 | * keeps str alive on the stack or in a register such that it is visible to | |
402 | * the conservative gc we add the call to scm_remember_upto_here_1 _after_ the | |
403 | * call to 'some_function'. Note that this would not be necessary if str was | |
404 | * used anyway after the call to 'some_function'. | |
eb01cb64 | 405 | * char *chars = scm_i_string_chars (str); |
5d2b97cd DH |
406 | * some_function (chars); |
407 | * scm_remember_upto_here_1 (str); // str will be alive up to this point. | |
408 | */ | |
409 | ||
9e1569bd KR |
410 | /* Remove any macro versions of these while defining the functions. |
411 | Functions are always included in the library, for upward binary | |
412 | compatibility and in case combinations of GCC and non-GCC are used. */ | |
413 | #undef scm_remember_upto_here_1 | |
414 | #undef scm_remember_upto_here_2 | |
415 | ||
5d2b97cd | 416 | void |
e81d98ec | 417 | scm_remember_upto_here_1 (SCM obj SCM_UNUSED) |
5d2b97cd DH |
418 | { |
419 | /* Empty. Protects a single object from garbage collection. */ | |
420 | } | |
421 | ||
422 | void | |
e81d98ec | 423 | scm_remember_upto_here_2 (SCM obj1 SCM_UNUSED, SCM obj2 SCM_UNUSED) |
5d2b97cd DH |
424 | { |
425 | /* Empty. Protects two objects from garbage collection. */ | |
426 | } | |
427 | ||
428 | void | |
e81d98ec | 429 | scm_remember_upto_here (SCM obj SCM_UNUSED, ...) |
5d2b97cd DH |
430 | { |
431 | /* Empty. Protects any number of objects from garbage collection. */ | |
432 | } | |
433 | ||
c209c88e | 434 | /* |
41b0806d GB |
435 | These crazy functions prevent garbage collection |
436 | of arguments after the first argument by | |
437 | ensuring they remain live throughout the | |
438 | function because they are used in the last | |
439 | line of the code block. | |
440 | It'd be better to have a nice compiler hint to | |
441 | aid the conservative stack-scanning GC. --03/09/00 gjb */ | |
0f2d19dd JB |
442 | SCM |
443 | scm_return_first (SCM elt, ...) | |
0f2d19dd JB |
444 | { |
445 | return elt; | |
446 | } | |
447 | ||
41b0806d GB |
448 | int |
449 | scm_return_first_int (int i, ...) | |
450 | { | |
451 | return i; | |
452 | } | |
453 | ||
0f2d19dd | 454 | |
0f2d19dd | 455 | SCM |
6e8d25a6 | 456 | scm_permanent_object (SCM obj) |
0f2d19dd | 457 | { |
8e7b3e98 | 458 | return (scm_gc_protect_object (obj)); |
0f2d19dd JB |
459 | } |
460 | ||
461 | ||
7bd4fbe2 MD |
462 | /* Protect OBJ from the garbage collector. OBJ will not be freed, even if all |
463 | other references are dropped, until the object is unprotected by calling | |
6b1b030e | 464 | scm_gc_unprotect_object (OBJ). Calls to scm_gc_protect/unprotect_object nest, |
7bd4fbe2 MD |
465 | i. e. it is possible to protect the same object several times, but it is |
466 | necessary to unprotect the object the same number of times to actually get | |
467 | the object unprotected. It is an error to unprotect an object more often | |
468 | than it has been protected before. The function scm_protect_object returns | |
469 | OBJ. | |
470 | */ | |
471 | ||
472 | /* Implementation note: For every object X, there is a counter which | |
1f584400 | 473 | scm_gc_protect_object (X) increments and scm_gc_unprotect_object (X) decrements. |
7bd4fbe2 | 474 | */ |
686765af | 475 | |
7eec4c37 HWN |
476 | |
477 | ||
ef290276 | 478 | SCM |
6b1b030e | 479 | scm_gc_protect_object (SCM obj) |
ef290276 | 480 | { |
686765af | 481 | SCM handle; |
9d47a1e6 | 482 | |
686765af | 483 | /* This critical section barrier will be replaced by a mutex. */ |
33b320ae NJ |
484 | /* njrev: Indeed; if my comment above is correct, there is the same |
485 | critsec/mutex inconsistency here. */ | |
9de87eea | 486 | SCM_CRITICAL_SECTION_START; |
9d47a1e6 | 487 | |
acbccb0c | 488 | handle = scm_hashq_create_handle_x (scm_protects, obj, scm_from_int (0)); |
e11e83f3 | 489 | SCM_SETCDR (handle, scm_sum (SCM_CDR (handle), scm_from_int (1))); |
9d47a1e6 | 490 | |
7eec4c37 HWN |
491 | protected_obj_count ++; |
492 | ||
9de87eea | 493 | SCM_CRITICAL_SECTION_END; |
9d47a1e6 | 494 | |
ef290276 JB |
495 | return obj; |
496 | } | |
497 | ||
498 | ||
499 | /* Remove any protection for OBJ established by a prior call to | |
dab7f566 | 500 | scm_protect_object. This function returns OBJ. |
ef290276 | 501 | |
dab7f566 | 502 | See scm_protect_object for more information. */ |
ef290276 | 503 | SCM |
6b1b030e | 504 | scm_gc_unprotect_object (SCM obj) |
ef290276 | 505 | { |
686765af | 506 | SCM handle; |
9d47a1e6 | 507 | |
686765af | 508 | /* This critical section barrier will be replaced by a mutex. */ |
33b320ae | 509 | /* njrev: and again. */ |
9de87eea | 510 | SCM_CRITICAL_SECTION_START; |
9d47a1e6 | 511 | |
0ff7e3ff HWN |
512 | if (scm_gc_running_p) |
513 | { | |
514 | fprintf (stderr, "scm_unprotect_object called during GC.\n"); | |
515 | abort (); | |
516 | } | |
b17e0ac3 | 517 | |
acbccb0c | 518 | handle = scm_hashq_get_handle (scm_protects, obj); |
9d47a1e6 | 519 | |
7888309b | 520 | if (scm_is_false (handle)) |
686765af | 521 | { |
0f0f0899 MD |
522 | fprintf (stderr, "scm_unprotect_object called on unprotected object\n"); |
523 | abort (); | |
686765af | 524 | } |
6a199940 DH |
525 | else |
526 | { | |
e11e83f3 | 527 | SCM count = scm_difference (SCM_CDR (handle), scm_from_int (1)); |
bc36d050 | 528 | if (scm_is_eq (count, scm_from_int (0))) |
acbccb0c | 529 | scm_hashq_remove_x (scm_protects, obj); |
6a199940 | 530 | else |
1be6b49c | 531 | SCM_SETCDR (handle, count); |
6a199940 | 532 | } |
7eec4c37 | 533 | protected_obj_count --; |
686765af | 534 | |
9de87eea | 535 | SCM_CRITICAL_SECTION_END; |
ef290276 JB |
536 | |
537 | return obj; | |
538 | } | |
539 | ||
6b1b030e ML |
540 | void |
541 | scm_gc_register_root (SCM *p) | |
542 | { | |
8e7b3e98 | 543 | /* Nothing. */ |
6b1b030e ML |
544 | } |
545 | ||
546 | void | |
547 | scm_gc_unregister_root (SCM *p) | |
548 | { | |
8e7b3e98 | 549 | /* Nothing. */ |
6b1b030e ML |
550 | } |
551 | ||
552 | void | |
553 | scm_gc_register_roots (SCM *b, unsigned long n) | |
554 | { | |
555 | SCM *p = b; | |
556 | for (; p < b + n; ++p) | |
557 | scm_gc_register_root (p); | |
558 | } | |
559 | ||
560 | void | |
561 | scm_gc_unregister_roots (SCM *b, unsigned long n) | |
562 | { | |
563 | SCM *p = b; | |
564 | for (; p < b + n; ++p) | |
565 | scm_gc_unregister_root (p); | |
566 | } | |
567 | ||
0f2d19dd | 568 | \f |
a00c95d9 | 569 | |
4c48ba06 | 570 | |
c8a1bdc4 HWN |
571 | /* |
572 | MOVE THIS FUNCTION. IT DOES NOT HAVE ANYTHING TODO WITH GC. | |
573 | */ | |
85db4a2c DH |
574 | |
575 | /* Get an integer from an environment variable. */ | |
c8a1bdc4 HWN |
576 | int |
577 | scm_getenv_int (const char *var, int def) | |
85db4a2c | 578 | { |
c8a1bdc4 HWN |
579 | char *end = 0; |
580 | char *val = getenv (var); | |
581 | long res = def; | |
85db4a2c DH |
582 | if (!val) |
583 | return def; | |
584 | res = strtol (val, &end, 10); | |
585 | if (end == val) | |
586 | return def; | |
587 | return res; | |
588 | } | |
589 | ||
9adbf27f AW |
590 | #ifndef HAVE_GC_SET_FINALIZE_ON_DEMAND |
591 | static void | |
592 | GC_set_finalize_on_demand (int foo) | |
593 | { | |
594 | GC_finalize_on_demand = foo; | |
595 | } | |
596 | #endif | |
597 | ||
c35738c1 MD |
598 | void |
599 | scm_storage_prehistory () | |
600 | { | |
0f595d7d LC |
601 | #ifdef HAVE_GC_SET_ALL_INTERIOR_POINTERS |
602 | /* This function was added in 7.2alpha2 (June 2009). */ | |
603 | GC_set_all_interior_pointers (0); | |
604 | #else | |
605 | /* This symbol is deprecated in 7.3. */ | |
184327a6 | 606 | GC_all_interior_pointers = 0; |
0f595d7d LC |
607 | #endif |
608 | ||
6360beb2 AW |
609 | free_space_divisor = scm_getenv_int ("GC_FREE_SPACE_DIVISOR", 3); |
610 | minimum_free_space_divisor = free_space_divisor; | |
611 | target_free_space_divisor = free_space_divisor; | |
612 | GC_set_free_space_divisor (free_space_divisor); | |
f740445a | 613 | GC_set_finalize_on_demand (1); |
184327a6 | 614 | |
a82e7953 | 615 | GC_INIT (); |
e7bca227 | 616 | |
11d2fc06 LC |
617 | #if (! ((defined GC_VERSION_MAJOR) && (GC_VERSION_MAJOR >= 7))) \ |
618 | && (defined SCM_I_GSC_USE_PTHREAD_THREADS) | |
e7bca227 LC |
619 | /* When using GC 6.8, this call is required to initialize thread-local |
620 | freelists (shouldn't be necessary with GC 7.0). */ | |
621 | GC_init (); | |
622 | #endif | |
623 | ||
fdab75a1 | 624 | GC_expand_hp (SCM_DEFAULT_INIT_HEAP_SIZE_2); |
915b3f9f | 625 | |
184327a6 LC |
626 | /* We only need to register a displacement for those types for which the |
627 | higher bits of the type tag are used to store a pointer (that is, a | |
628 | pointer to an 8-octet aligned region). For `scm_tc3_struct', this is | |
629 | handled in `scm_alloc_struct ()'. */ | |
630 | GC_REGISTER_DISPLACEMENT (scm_tc3_cons); | |
314b8716 | 631 | /* GC_REGISTER_DISPLACEMENT (scm_tc3_unused); */ |
184327a6 | 632 | |
915b3f9f | 633 | /* Sanity check. */ |
acbccb0c | 634 | if (!GC_is_visible (&scm_protects)) |
915b3f9f | 635 | abort (); |
a82e7953 | 636 | |
c35738c1 MD |
637 | scm_c_hook_init (&scm_before_gc_c_hook, 0, SCM_C_HOOK_NORMAL); |
638 | scm_c_hook_init (&scm_before_mark_c_hook, 0, SCM_C_HOOK_NORMAL); | |
639 | scm_c_hook_init (&scm_before_sweep_c_hook, 0, SCM_C_HOOK_NORMAL); | |
640 | scm_c_hook_init (&scm_after_sweep_c_hook, 0, SCM_C_HOOK_NORMAL); | |
641 | scm_c_hook_init (&scm_after_gc_c_hook, 0, SCM_C_HOOK_NORMAL); | |
642 | } | |
85db4a2c | 643 | |
9de87eea | 644 | scm_i_pthread_mutex_t scm_i_gc_admin_mutex = SCM_I_PTHREAD_MUTEX_INITIALIZER; |
eb01cb64 | 645 | |
562cd1b8 AW |
646 | void |
647 | scm_init_gc_protect_object () | |
0f2d19dd | 648 | { |
acbccb0c | 649 | scm_protects = scm_c_make_hash_table (31); |
4a4c9785 | 650 | |
9de87eea MV |
651 | #if 0 |
652 | /* We can't have a cleanup handler since we have no thread to run it | |
653 | in. */ | |
654 | ||
a18bcd0e | 655 | #ifdef HAVE_ATEXIT |
c45acc34 | 656 | atexit (cleanup); |
e52ceaac MD |
657 | #else |
658 | #ifdef HAVE_ON_EXIT | |
659 | on_exit (cleanup, 0); | |
660 | #endif | |
9de87eea MV |
661 | #endif |
662 | ||
a18bcd0e | 663 | #endif |
0f2d19dd | 664 | } |
939794ce | 665 | |
0f2d19dd JB |
666 | \f |
667 | ||
939794ce DH |
668 | SCM scm_after_gc_hook; |
669 | ||
cc3546b0 | 670 | static SCM after_gc_async_cell; |
939794ce | 671 | |
cc3546b0 AW |
672 | /* The function after_gc_async_thunk causes the execution of the |
673 | * after-gc-hook. It is run after the gc, as soon as the asynchronous | |
674 | * events are handled by the evaluator. | |
939794ce DH |
675 | */ |
676 | static SCM | |
cc3546b0 | 677 | after_gc_async_thunk (void) |
939794ce | 678 | { |
cc3546b0 AW |
679 | /* Fun, no? Hook-run *and* run-hook? */ |
680 | scm_c_hook_run (&scm_after_gc_c_hook, NULL); | |
939794ce | 681 | scm_c_run_hook (scm_after_gc_hook, SCM_EOL); |
939794ce DH |
682 | return SCM_UNSPECIFIED; |
683 | } | |
684 | ||
685 | ||
cc3546b0 AW |
686 | /* The function queue_after_gc_hook is run by the scm_before_gc_c_hook |
687 | * at the end of the garbage collection. The only purpose of this | |
688 | * function is to mark the after_gc_async (which will eventually lead to | |
689 | * the execution of the after_gc_async_thunk). | |
939794ce DH |
690 | */ |
691 | static void * | |
cc3546b0 AW |
692 | queue_after_gc_hook (void * hook_data SCM_UNUSED, |
693 | void *fn_data SCM_UNUSED, | |
694 | void *data SCM_UNUSED) | |
e81d98ec DH |
695 | { |
696 | /* If cell access debugging is enabled, the user may choose to perform | |
697 | * additional garbage collections after an arbitrary number of cell | |
698 | * accesses. We don't want the scheme level after-gc-hook to be performed | |
699 | * for each of these garbage collections for the following reason: The | |
700 | * execution of the after-gc-hook causes cell accesses itself. Thus, if the | |
701 | * after-gc-hook was performed with every gc, and if the gc was performed | |
702 | * after a very small number of cell accesses, then the number of cell | |
703 | * accesses during the execution of the after-gc-hook will suffice to cause | |
704 | * the execution of the next gc. Then, guile would keep executing the | |
705 | * after-gc-hook over and over again, and would never come to do other | |
706 | * things. | |
eae33935 | 707 | * |
e81d98ec DH |
708 | * To overcome this problem, if cell access debugging with additional |
709 | * garbage collections is enabled, the after-gc-hook is never run by the | |
710 | * garbage collecter. When running guile with cell access debugging and the | |
711 | * execution of the after-gc-hook is desired, then it is necessary to run | |
712 | * the hook explicitly from the user code. This has the effect, that from | |
713 | * the scheme level point of view it seems that garbage collection is | |
714 | * performed with a much lower frequency than it actually is. Obviously, | |
715 | * this will not work for code that depends on a fixed one to one | |
716 | * relationship between the execution counts of the C level garbage | |
717 | * collection hooks and the execution count of the scheme level | |
718 | * after-gc-hook. | |
719 | */ | |
9de87eea | 720 | |
e81d98ec | 721 | #if (SCM_DEBUG_CELL_ACCESSES == 1) |
eab1b259 | 722 | if (scm_debug_cells_gc_interval == 0) |
e81d98ec | 723 | #endif |
cc3546b0 AW |
724 | { |
725 | scm_i_thread *t = SCM_I_CURRENT_THREAD; | |
726 | ||
727 | if (scm_is_false (SCM_CDR (after_gc_async_cell))) | |
728 | { | |
729 | SCM_SETCDR (after_gc_async_cell, t->active_asyncs); | |
730 | t->active_asyncs = after_gc_async_cell; | |
731 | t->pending_asyncs = 1; | |
732 | } | |
733 | } | |
e81d98ec | 734 | |
939794ce DH |
735 | return NULL; |
736 | } | |
737 | ||
00b6ef23 AW |
738 | \f |
739 | ||
740 | static void * | |
741 | start_gc_timer (void * hook_data SCM_UNUSED, | |
742 | void *fn_data SCM_UNUSED, | |
743 | void *data SCM_UNUSED) | |
744 | { | |
745 | if (!gc_start_time) | |
746 | gc_start_time = scm_c_get_internal_run_time (); | |
747 | ||
748 | return NULL; | |
749 | } | |
750 | ||
751 | static void * | |
752 | accumulate_gc_timer (void * hook_data SCM_UNUSED, | |
753 | void *fn_data SCM_UNUSED, | |
754 | void *data SCM_UNUSED) | |
755 | { | |
756 | if (gc_start_time) | |
6360beb2 AW |
757 | { |
758 | long now = scm_c_get_internal_run_time (); | |
00b6ef23 AW |
759 | gc_time_taken += now - gc_start_time; |
760 | gc_start_time = 0; | |
761 | } | |
762 | ||
763 | return NULL; | |
764 | } | |
765 | ||
6360beb2 AW |
766 | /* Return some idea of the memory footprint of a process, in bytes. |
767 | Currently only works on Linux systems. */ | |
768 | static size_t | |
769 | get_image_size (void) | |
770 | { | |
771 | unsigned long size, resident, share; | |
8ac70433 | 772 | size_t ret = 0; |
6360beb2 AW |
773 | |
774 | FILE *fp = fopen ("/proc/self/statm", "r"); | |
775 | ||
776 | if (fp && fscanf (fp, "%lu %lu %lu", &size, &resident, &share) == 3) | |
777 | ret = resident * 4096; | |
778 | ||
779 | if (fp) | |
780 | fclose (fp); | |
781 | ||
782 | return ret; | |
783 | } | |
784 | ||
fd51e661 AW |
785 | /* These are discussed later. */ |
786 | static size_t bytes_until_gc; | |
787 | static scm_i_pthread_mutex_t bytes_until_gc_lock = SCM_I_PTHREAD_MUTEX_INITIALIZER; | |
788 | ||
6360beb2 AW |
789 | /* Make GC run more frequently when the process image size is growing, |
790 | measured against the number of bytes allocated through the GC. | |
791 | ||
792 | If Guile is allocating at a GC-managed heap size H, libgc will tend | |
793 | to limit the process image size to H*N. But if at the same time the | |
794 | user program is mallocating at a rate M bytes per GC-allocated byte, | |
795 | then the process stabilizes at H*N*M -- assuming that collecting data | |
796 | will result in malloc'd data being freed. It doesn't take a very | |
797 | large M for this to be a bad situation. To limit the image size, | |
798 | Guile should GC more often -- the bigger the M, the more often. | |
799 | ||
800 | Numeric functions that produce bigger and bigger integers are | |
801 | pessimal, because M is an increasing function of time. Here is an | |
802 | example of such a function: | |
803 | ||
804 | (define (factorial n) | |
805 | (define (fac n acc) | |
806 | (if (<= n 1) | |
807 | acc | |
808 | (fac (1- n) (* n acc)))) | |
809 | (fac n 1)) | |
810 | ||
811 | It is possible for a process to grow for reasons that will not be | |
812 | solved by faster GC. In that case M will be estimated as | |
813 | artificially high for a while, and so GC will happen more often on | |
814 | the Guile side. But when it stabilizes, Guile can ease back the GC | |
815 | frequency. | |
816 | ||
817 | The key is to measure process image growth, not mallocation rate. | |
818 | For maximum effectiveness, Guile reacts quickly to process growth, | |
819 | and exponentially backs down when the process stops growing. | |
820 | ||
821 | See http://thread.gmane.org/gmane.lisp.guile.devel/12552/focus=12936 | |
822 | for further discussion. | |
823 | */ | |
824 | static void * | |
825 | adjust_gc_frequency (void * hook_data SCM_UNUSED, | |
826 | void *fn_data SCM_UNUSED, | |
827 | void *data SCM_UNUSED) | |
828 | { | |
829 | static size_t prev_image_size = 0; | |
830 | static size_t prev_bytes_alloced = 0; | |
831 | size_t image_size; | |
832 | size_t bytes_alloced; | |
833 | ||
fd51e661 AW |
834 | scm_i_pthread_mutex_lock (&bytes_until_gc_lock); |
835 | bytes_until_gc = GC_get_heap_size (); | |
836 | scm_i_pthread_mutex_unlock (&bytes_until_gc_lock); | |
837 | ||
6360beb2 AW |
838 | image_size = get_image_size (); |
839 | bytes_alloced = GC_get_total_bytes (); | |
840 | ||
d1c03624 | 841 | #define HEURISTICS_DEBUG 0 |
6360beb2 AW |
842 | |
843 | #if HEURISTICS_DEBUG | |
844 | fprintf (stderr, "prev image / alloced: %lu / %lu\n", prev_image_size, prev_bytes_alloced); | |
845 | fprintf (stderr, " image / alloced: %lu / %lu\n", image_size, bytes_alloced); | |
846 | fprintf (stderr, "divisor %lu / %f\n", free_space_divisor, target_free_space_divisor); | |
847 | #endif | |
848 | ||
849 | if (prev_image_size && bytes_alloced != prev_bytes_alloced) | |
850 | { | |
851 | double growth_rate, new_target_free_space_divisor; | |
852 | double decay_factor = 0.5; | |
853 | double hysteresis = 0.1; | |
854 | ||
855 | growth_rate = ((double) image_size - prev_image_size) | |
856 | / ((double)bytes_alloced - prev_bytes_alloced); | |
857 | ||
858 | #if HEURISTICS_DEBUG | |
859 | fprintf (stderr, "growth rate %f\n", growth_rate); | |
860 | #endif | |
861 | ||
862 | new_target_free_space_divisor = minimum_free_space_divisor; | |
863 | ||
864 | if (growth_rate > 0) | |
865 | new_target_free_space_divisor *= 1.0 + growth_rate; | |
866 | ||
867 | #if HEURISTICS_DEBUG | |
868 | fprintf (stderr, "new divisor %f\n", new_target_free_space_divisor); | |
869 | #endif | |
870 | ||
871 | if (new_target_free_space_divisor < target_free_space_divisor) | |
872 | /* Decay down. */ | |
873 | target_free_space_divisor = | |
874 | (decay_factor * target_free_space_divisor | |
875 | + (1.0 - decay_factor) * new_target_free_space_divisor); | |
876 | else | |
877 | /* Jump up. */ | |
878 | target_free_space_divisor = new_target_free_space_divisor; | |
879 | ||
880 | #if HEURISTICS_DEBUG | |
881 | fprintf (stderr, "new target divisor %f\n", target_free_space_divisor); | |
882 | #endif | |
883 | ||
884 | if (free_space_divisor + 0.5 + hysteresis < target_free_space_divisor | |
885 | || free_space_divisor - 0.5 - hysteresis > target_free_space_divisor) | |
886 | { | |
887 | free_space_divisor = lround (target_free_space_divisor); | |
888 | #if HEURISTICS_DEBUG | |
889 | fprintf (stderr, "new divisor %lu\n", free_space_divisor); | |
890 | #endif | |
891 | GC_set_free_space_divisor (free_space_divisor); | |
892 | } | |
893 | } | |
894 | ||
895 | prev_image_size = image_size; | |
896 | prev_bytes_alloced = bytes_alloced; | |
897 | ||
898 | return NULL; | |
899 | } | |
900 | ||
fd51e661 AW |
901 | /* The adjust_gc_frequency routine handles transients in the process |
902 | image size. It can't handle instense non-GC-managed steady-state | |
903 | allocation though, as it decays the FSD at steady-state down to its | |
904 | minimum value. | |
905 | ||
906 | The only real way to handle continuous, high non-GC allocation is to | |
907 | let the GC know about it. This routine can handle non-GC allocation | |
908 | rates that are similar in size to the GC-managed heap size. | |
909 | */ | |
910 | ||
911 | void | |
912 | scm_gc_register_allocation (size_t size) | |
913 | { | |
914 | scm_i_pthread_mutex_lock (&bytes_until_gc_lock); | |
915 | if (bytes_until_gc - size > bytes_until_gc) | |
916 | { | |
917 | bytes_until_gc = GC_get_heap_size (); | |
918 | scm_i_pthread_mutex_unlock (&bytes_until_gc_lock); | |
919 | GC_gcollect (); | |
920 | } | |
921 | else | |
922 | { | |
923 | bytes_until_gc -= size; | |
924 | scm_i_pthread_mutex_unlock (&bytes_until_gc_lock); | |
925 | } | |
926 | } | |
927 | ||
00b6ef23 AW |
928 | |
929 | \f | |
930 | ||
26224b3f LC |
931 | char const * |
932 | scm_i_tag_name (scm_t_bits tag) | |
933 | { | |
74ec8d78 | 934 | switch (tag & 0x7f) /* 7 bits */ |
26224b3f LC |
935 | { |
936 | case scm_tcs_struct: | |
937 | return "struct"; | |
938 | case scm_tcs_cons_imcar: | |
939 | return "cons (immediate car)"; | |
940 | case scm_tcs_cons_nimcar: | |
941 | return "cons (non-immediate car)"; | |
5b46a8c2 | 942 | case scm_tc7_pointer: |
e2c2a699 | 943 | return "foreign"; |
c99de5aa AW |
944 | case scm_tc7_hashtable: |
945 | return "hashtable"; | |
9ea31741 AW |
946 | case scm_tc7_fluid: |
947 | return "fluid"; | |
948 | case scm_tc7_dynamic_state: | |
949 | return "dynamic state"; | |
6f3b0cc2 AW |
950 | case scm_tc7_frame: |
951 | return "frame"; | |
952 | case scm_tc7_objcode: | |
953 | return "objcode"; | |
954 | case scm_tc7_vm: | |
955 | return "vm"; | |
956 | case scm_tc7_vm_cont: | |
957 | return "vm continuation"; | |
26224b3f LC |
958 | case scm_tc7_wvect: |
959 | return "weak vector"; | |
960 | case scm_tc7_vector: | |
961 | return "vector"; | |
26224b3f LC |
962 | case scm_tc7_number: |
963 | switch (tag) | |
964 | { | |
965 | case scm_tc16_real: | |
966 | return "real"; | |
967 | break; | |
968 | case scm_tc16_big: | |
969 | return "bignum"; | |
970 | break; | |
971 | case scm_tc16_complex: | |
972 | return "complex number"; | |
973 | break; | |
974 | case scm_tc16_fraction: | |
975 | return "fraction"; | |
976 | break; | |
977 | } | |
978 | break; | |
979 | case scm_tc7_string: | |
980 | return "string"; | |
981 | break; | |
982 | case scm_tc7_stringbuf: | |
983 | return "string buffer"; | |
984 | break; | |
985 | case scm_tc7_symbol: | |
986 | return "symbol"; | |
987 | break; | |
988 | case scm_tc7_variable: | |
989 | return "variable"; | |
990 | break; | |
26224b3f LC |
991 | case scm_tc7_port: |
992 | return "port"; | |
993 | break; | |
994 | case scm_tc7_smob: | |
74ec8d78 AW |
995 | { |
996 | int k = 0xff & (tag >> 8); | |
997 | return (scm_smobs[k].name); | |
998 | } | |
26224b3f LC |
999 | break; |
1000 | } | |
1001 | ||
1002 | return NULL; | |
1003 | } | |
1004 | ||
1005 | ||
26224b3f LC |
1006 | |
1007 | \f | |
0f2d19dd JB |
1008 | void |
1009 | scm_init_gc () | |
0f2d19dd | 1010 | { |
a82e7953 | 1011 | /* `GC_INIT ()' was invoked in `scm_storage_prehistory ()'. */ |
d678e25c | 1012 | |
f39448c5 | 1013 | scm_after_gc_hook = scm_make_hook (SCM_INUM0); |
fde50407 | 1014 | scm_c_define ("after-gc-hook", scm_after_gc_hook); |
939794ce | 1015 | |
cc3546b0 AW |
1016 | /* When the async is to run, the cdr of the gc_async pair gets set to |
1017 | the asyncs queue of the current thread. */ | |
1018 | after_gc_async_cell = scm_cons (scm_c_make_gsubr ("%after-gc-thunk", 0, 0, 0, | |
1019 | after_gc_async_thunk), | |
1020 | SCM_BOOL_F); | |
939794ce | 1021 | |
cc3546b0 | 1022 | scm_c_hook_add (&scm_before_gc_c_hook, queue_after_gc_hook, NULL, 0); |
00b6ef23 AW |
1023 | scm_c_hook_add (&scm_before_gc_c_hook, start_gc_timer, NULL, 0); |
1024 | scm_c_hook_add (&scm_after_gc_c_hook, accumulate_gc_timer, NULL, 0); | |
66b229d5 | 1025 | |
738c899e AW |
1026 | #if HAVE_GC_GET_HEAP_USAGE_SAFE |
1027 | /* GC_get_heap_usage does not take a lock, and so can run in the GC | |
1028 | start hook. */ | |
1029 | scm_c_hook_add (&scm_before_gc_c_hook, adjust_gc_frequency, NULL, 0); | |
1030 | #else | |
1031 | /* GC_get_heap_usage might take a lock (and did from 7.2alpha1 to | |
1032 | 7.2alpha7), so call it in the after_gc_hook. */ | |
1033 | scm_c_hook_add (&scm_after_gc_c_hook, adjust_gc_frequency, NULL, 0); | |
1034 | #endif | |
1035 | ||
66b229d5 | 1036 | #ifdef HAVE_GC_SET_START_CALLBACK |
cc3546b0 | 1037 | GC_set_start_callback (run_before_gc_c_hook); |
66b229d5 | 1038 | #endif |
939794ce | 1039 | |
a0599745 | 1040 | #include "libguile/gc.x" |
0f2d19dd | 1041 | } |
89e00824 | 1042 | |
c8a1bdc4 HWN |
1043 | |
1044 | void | |
1045 | scm_gc_sweep (void) | |
1046 | #define FUNC_NAME "scm_gc_sweep" | |
1047 | { | |
26224b3f | 1048 | /* FIXME */ |
cd169c5a | 1049 | fprintf (stderr, "%s: doing nothing\n", FUNC_NAME); |
c8a1bdc4 | 1050 | } |
c8a1bdc4 HWN |
1051 | #undef FUNC_NAME |
1052 | ||
89e00824 ML |
1053 | /* |
1054 | Local Variables: | |
1055 | c-file-style: "gnu" | |
1056 | End: | |
1057 | */ |