1 /* Copyright (C) 1998,1999,2000,2001, 2006, 2008, 2009, 2011,
2 * 2012, 2013 Free Software Foundation, Inc.
4 * This library is free software; you can redistribute it and/or
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.
9 * This library is distributed in the hope that it will be useful, but
10 * WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 * Lesser General Public License for more details.
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
16 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
21 /* This is an implementation of guardians as described in
22 * R. Kent Dybvig, Carl Bruggeman, and David Eby (1993) "Guardians in
23 * a Generation-Based Garbage Collector" ACM SIGPLAN Conference on
24 * Programming Language Design and Implementation, June 1993
25 * ftp://ftp.cs.indiana.edu/pub/scheme-repository/doc/pubs/guardians.ps.gz
27 * Original design: Mikael Djurfeldt
28 * Original implementation: Michael Livshin
29 * Hacked on since by: everybody
31 * By this point, the semantics are actually quite different from
32 * those described in the abovementioned paper. The semantic changes
33 * are there to improve safety and intuitiveness. The interface is
34 * still (mostly) the one described by the paper, however.
36 * Boiled down again: Marius Vollmer
38 * Now they should again behave like those described in the paper.
39 * Scheme guardians should be simple and friendly, not like the greedy
42 * Rewritten for the Boehm-Demers-Weiser GC by Ludovic Courtès.
45 /* Uncomment the following line to debug guardian finalization. */
46 /* #define DEBUG_GUARDIANS 1 */
52 #include "libguile/_scm.h"
53 #include "libguile/ports.h"
54 #include "libguile/print.h"
55 #include "libguile/smob.h"
56 #include "libguile/validate.h"
57 #include "libguile/root.h"
58 #include "libguile/hashtab.h"
59 #include "libguile/weaks.h"
60 #include "libguile/deprecation.h"
61 #include "libguile/eval.h"
63 #include "libguile/guardians.h"
64 #include "libguile/bdw-gc.h"
69 static scm_t_bits tc16_guardian
;
71 typedef struct t_guardian
73 scm_i_pthread_mutex_t mutex
;
76 struct t_guardian
*next
;
79 #define GUARDIAN_P(x) SCM_SMOB_PREDICATE(tc16_guardian, x)
80 #define GUARDIAN_DATA(x) ((t_guardian *) SCM_SMOB_DATA_1 (x))
86 guardian_print (SCM guardian
, SCM port
, scm_print_state
*pstate SCM_UNUSED
)
88 t_guardian
*g
= GUARDIAN_DATA (guardian
);
90 scm_puts ("#<guardian ", port
);
91 scm_uintprint ((scm_t_bits
) g
, 16, port
);
93 scm_puts (" (reachable: ", port
);
94 scm_display (scm_from_uint (g
->live
), port
);
95 scm_puts (" unreachable: ", port
);
96 scm_display (scm_length (g
->zombies
), port
);
104 /* Handle finalization of OBJ which is guarded by the guardians listed in
107 finalize_guarded (void *ptr
, void *finalizer_data
)
110 SCM obj
, guardian_list
, proxied_finalizer
;
113 guardian_list
= SCM_CDR (PTR2SCM (finalizer_data
));
114 proxied_finalizer
= SCM_CAR (PTR2SCM (finalizer_data
));
116 #ifdef DEBUG_GUARDIANS
117 printf ("finalizing guarded %p (%u guardians)\n",
118 ptr
, scm_to_uint (scm_length (guardian_list
)));
121 /* Preallocate a bunch of cells so that we can make sure that no garbage
122 collection (and, thus, nested calls to `finalize_guarded ()') occurs
123 while executing the following loop. This is quite inefficient (call to
124 `scm_length ()') but that shouldn't be a problem in most cases. */
125 cell_pool
= scm_make_list (scm_length (guardian_list
), SCM_UNSPECIFIED
);
127 /* Tell each guardian interested in OBJ that OBJ is no longer
130 !scm_is_null (guardian_list
);
131 guardian_list
= SCM_CDR (guardian_list
))
136 if (SCM_WEAK_PAIR_CAR_DELETED_P (guardian_list
))
138 /* The guardian itself vanished in the meantime. */
139 #ifdef DEBUG_GUARDIANS
140 printf (" guardian for %p vanished\n", ptr
);
145 g
= GUARDIAN_DATA (SCM_CAR (guardian_list
));
147 scm_i_pthread_mutex_lock (&g
->mutex
);
152 /* Get a fresh cell from CELL_POOL. */
154 cell_pool
= SCM_CDR (cell_pool
);
156 /* Compute and update G's zombie list. */
157 SCM_SETCAR (zombies
, obj
);
158 SCM_SETCDR (zombies
, g
->zombies
);
159 g
->zombies
= zombies
;
163 scm_i_pthread_mutex_unlock (&g
->mutex
);
166 if (scm_is_true (proxied_finalizer
))
168 /* Re-register the finalizer that was in place before we installed this
170 GC_finalization_proc finalizer
, prev_finalizer
;
171 void *finalizer_data
, *prev_finalizer_data
;
173 finalizer
= (GC_finalization_proc
) SCM2PTR (SCM_CAR (proxied_finalizer
));
174 finalizer_data
= SCM2PTR (SCM_CDR (proxied_finalizer
));
176 if (finalizer
== NULL
)
179 GC_REGISTER_FINALIZER_NO_ORDER (ptr
, finalizer
, finalizer_data
,
180 &prev_finalizer
, &prev_finalizer_data
);
182 #ifdef DEBUG_GUARDIANS
183 printf (" reinstalled proxied finalizer %p for %p\n", finalizer
, ptr
);
187 #ifdef DEBUG_GUARDIANS
188 printf ("end of finalize (%p)\n", ptr
);
192 /* Add OBJ as a guarded object of GUARDIAN. */
194 scm_i_guard (SCM guardian
, SCM obj
)
196 t_guardian
*g
= GUARDIAN_DATA (guardian
);
200 /* Register a finalizer and pass a pair as the ``client data''
201 argument. The pair contains in its car `#f' or a pair describing a
202 ``proxied'' finalizer (see below); its cdr contains a list of
203 guardians interested in OBJ.
205 A ``proxied'' finalizer is a finalizer that was registered for OBJ
206 before OBJ became guarded (e.g., a SMOB `free' function). We are
207 assuming here that finalizers are only used internally, either at
208 the very beginning of an object's lifetime (e.g., see `SCM_NEWSMOB')
209 or by this function. */
210 GC_finalization_proc prev_finalizer
;
212 SCM guardians_for_obj
, finalizer_data
;
214 scm_i_pthread_mutex_lock (&g
->mutex
);
218 /* Note: GUARDIANS_FOR_OBJ is a weak list so that a guardian can be
219 collected before the objects it guards (see `guardians.test'). */
220 guardians_for_obj
= scm_weak_car_pair (guardian
, SCM_EOL
);
221 finalizer_data
= scm_cons (SCM_BOOL_F
, guardians_for_obj
);
223 GC_REGISTER_FINALIZER_NO_ORDER (SCM2PTR (obj
), finalize_guarded
,
224 SCM2PTR (finalizer_data
),
225 &prev_finalizer
, &prev_data
);
227 if (prev_finalizer
== finalize_guarded
)
229 /* OBJ is already guarded by another guardian: add GUARDIAN to its
230 list of guardians. */
231 SCM prev_guardian_list
, prev_finalizer_data
;
233 if (prev_data
== NULL
)
236 prev_finalizer_data
= PTR2SCM (prev_data
);
237 if (!scm_is_pair (prev_finalizer_data
))
240 prev_guardian_list
= SCM_CDR (prev_finalizer_data
);
241 SCM_SETCDR (guardians_for_obj
, prev_guardian_list
);
243 /* Also copy information about proxied finalizers. */
244 SCM_SETCAR (finalizer_data
, SCM_CAR (prev_finalizer_data
));
246 else if (prev_finalizer
!= NULL
)
248 /* There was already a finalizer registered for OBJ so we will
249 ``proxy'' it, i.e., record it so that we can re-register it once
250 `finalize_guarded ()' has finished. */
251 SCM proxied_finalizer
;
253 proxied_finalizer
= scm_cons (PTR2SCM (prev_finalizer
),
254 PTR2SCM (prev_data
));
255 SCM_SETCAR (finalizer_data
, proxied_finalizer
);
258 scm_i_pthread_mutex_unlock (&g
->mutex
);
263 scm_i_get_one_zombie (SCM guardian
)
265 t_guardian
*g
= GUARDIAN_DATA (guardian
);
266 SCM res
= SCM_BOOL_F
;
268 scm_i_pthread_mutex_lock (&g
->mutex
);
270 if (!scm_is_null (g
->zombies
))
272 /* Note: We return zombies in reverse order. */
273 res
= SCM_CAR (g
->zombies
);
274 g
->zombies
= SCM_CDR (g
->zombies
);
277 scm_i_pthread_mutex_unlock (&g
->mutex
);
282 /* This is the Scheme entry point for each guardian: If OBJ is an
283 * object, it's added to the guardian's live list. If OBJ is unbound,
284 * the next available unreachable object (or #f if none) is returned.
286 * If the second optional argument THROW_P is true (the default), then
287 * an error is raised if GUARDIAN is greedy and OBJ is already greedily
288 * guarded. If THROW_P is false, #f is returned instead of raising the
289 * error, and #t is returned if everything is fine.
292 guardian_apply (SCM guardian
, SCM obj
, SCM throw_p
)
294 if (!SCM_UNBNDP (obj
))
296 scm_i_guard (guardian
, obj
);
297 return SCM_UNSPECIFIED
;
300 return scm_i_get_one_zombie (guardian
);
303 SCM_DEFINE (scm_make_guardian
, "make-guardian", 0, 0, 0,
305 "Create a new guardian. A guardian protects a set of objects from\n"
306 "garbage collection, allowing a program to apply cleanup or other\n"
309 "@code{make-guardian} returns a procedure representing the guardian.\n"
310 "Calling the guardian procedure with an argument adds the argument to\n"
311 "the guardian's set of protected objects. Calling the guardian\n"
312 "procedure without an argument returns one of the protected objects\n"
313 "which are ready for garbage collection, or @code{#f} if no such object\n"
314 "is available. Objects which are returned in this way are removed from\n"
317 "You can put a single object into a guardian more than once and you can\n"
318 "put a single object into more than one guardian. The object will then\n"
319 "be returned multiple times by the guardian procedures.\n"
321 "An object is eligible to be returned from a guardian when it is no\n"
322 "longer referenced from outside any guardian.\n"
324 "There is no guarantee about the order in which objects are returned\n"
325 "from a guardian. If you want to impose an order on finalization\n"
326 "actions, for example, you can do that by keeping objects alive in some\n"
327 "global data structure until they are no longer needed for finalizing\n"
330 "Being an element in a weak vector, a key in a hash table with weak\n"
331 "keys, or a value in a hash table with weak value does not prevent an\n"
332 "object from being returned by a guardian. But as long as an object\n"
333 "can be returned from a guardian it will not be removed from such a\n"
334 "weak vector or hash table. In other words, a weak link does not\n"
335 "prevent an object from being considered collectable, but being inside\n"
336 "a guardian prevents a weak link from being broken.\n"
338 "A key in a weak key hash table can be though of as having a strong\n"
339 "reference to its associated value as long as the key is accessible.\n"
340 "Consequently, when the key only accessible from within a guardian, the\n"
341 "reference from the key to the value is also considered to be coming\n"
342 "from within a guardian. Thus, if there is no other reference to the\n"
343 "value, it is eligible to be returned from a guardian.\n")
344 #define FUNC_NAME s_scm_make_guardian
346 t_guardian
*g
= scm_gc_malloc (sizeof (t_guardian
), "guardian");
349 scm_i_pthread_mutex_init (&g
->mutex
, NULL
);
351 /* A tconc starts out with one tail pair. */
353 g
->zombies
= SCM_EOL
;
357 SCM_NEWSMOB (z
, tc16_guardian
, g
);
364 scm_init_guardians ()
366 /* We use unordered finalization `a la Java. */
367 #ifdef HAVE_GC_SET_JAVA_FINALIZATION
368 /* This function was added in 7.2alpha2 (June 2009). */
369 GC_set_java_finalization (1);
371 /* This symbol is deprecated as of 7.3. */
372 GC_java_finalization
= 1;
375 tc16_guardian
= scm_make_smob_type ("guardian", 0);
377 scm_set_smob_print (tc16_guardian
, guardian_print
);
378 scm_set_smob_apply (tc16_guardian
, guardian_apply
, 0, 1, 0);
380 #include "libguile/guardians.x"