123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386 |
- /* Copyright (C) 1998,1999,2000,2001, 2006, 2008, 2009, 2011,
- * 2012, 2013 Free Software Foundation, Inc.
- *
- * This library is free software; you can redistribute it and/or
- * modify it under the terms of the GNU Lesser General Public License
- * as published by the Free Software Foundation; either version 3 of
- * the License, or (at your option) any later version.
- *
- * This library is distributed in the hope that it will be useful, but
- * WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
- * Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public
- * License along with this library; if not, write to the Free Software
- * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
- * 02110-1301 USA
- */
- /* This is an implementation of guardians as described in
- * R. Kent Dybvig, Carl Bruggeman, and David Eby (1993) "Guardians in
- * a Generation-Based Garbage Collector" ACM SIGPLAN Conference on
- * Programming Language Design and Implementation, June 1993
- * ftp://ftp.cs.indiana.edu/pub/scheme-repository/doc/pubs/guardians.ps.gz
- *
- * Original design: Mikael Djurfeldt
- * Original implementation: Michael Livshin
- * Hacked on since by: everybody
- *
- * By this point, the semantics are actually quite different from
- * those described in the abovementioned paper. The semantic changes
- * are there to improve safety and intuitiveness. The interface is
- * still (mostly) the one described by the paper, however.
- *
- * Boiled down again: Marius Vollmer
- *
- * Now they should again behave like those described in the paper.
- * Scheme guardians should be simple and friendly, not like the greedy
- * monsters we had...
- *
- * Rewritten for the Boehm-Demers-Weiser GC by Ludovic Courtès.
- */
- /* Uncomment the following line to debug guardian finalization. */
- /* #define DEBUG_GUARDIANS 1 */
- #ifdef HAVE_CONFIG_H
- # include <config.h>
- #endif
- #include "libguile/_scm.h"
- #include "libguile/ports.h"
- #include "libguile/print.h"
- #include "libguile/smob.h"
- #include "libguile/validate.h"
- #include "libguile/root.h"
- #include "libguile/hashtab.h"
- #include "libguile/deprecation.h"
- #include "libguile/eval.h"
- #include "libguile/guardians.h"
- #include "libguile/bdw-gc.h"
- static scm_t_bits tc16_guardian;
- typedef struct t_guardian
- {
- scm_i_pthread_mutex_t mutex;
- unsigned long live;
- SCM zombies;
- struct t_guardian *next;
- } t_guardian;
- #define GUARDIAN_P(x) SCM_SMOB_PREDICATE(tc16_guardian, x)
- #define GUARDIAN_DATA(x) ((t_guardian *) SCM_SMOB_DATA_1 (x))
- static int
- guardian_print (SCM guardian, SCM port, scm_print_state *pstate SCM_UNUSED)
- {
- t_guardian *g = GUARDIAN_DATA (guardian);
-
- scm_puts_unlocked ("#<guardian ", port);
- scm_uintprint ((scm_t_bits) g, 16, port);
- scm_puts_unlocked (" (reachable: ", port);
- scm_display (scm_from_uint (g->live), port);
- scm_puts_unlocked (" unreachable: ", port);
- scm_display (scm_length (g->zombies), port);
- scm_puts_unlocked (")", port);
- scm_puts_unlocked (">", port);
- return 1;
- }
- /* Handle finalization of OBJ which is guarded by the guardians listed in
- GUARDIAN_LIST. */
- static void
- finalize_guarded (void *ptr, void *finalizer_data)
- {
- SCM cell_pool;
- SCM obj, guardian_list, proxied_finalizer;
- obj = SCM_PACK_POINTER (ptr);
- guardian_list = SCM_CDR (SCM_PACK_POINTER (finalizer_data));
- proxied_finalizer = SCM_CAR (SCM_PACK_POINTER (finalizer_data));
- #ifdef DEBUG_GUARDIANS
- printf ("finalizing guarded %p (%u guardians)\n",
- ptr, scm_to_uint (scm_length (guardian_list)));
- #endif
- /* Preallocate a bunch of cells so that we can make sure that no garbage
- collection (and, thus, nested calls to `finalize_guarded ()') occurs
- while executing the following loop. This is quite inefficient (call to
- `scm_length ()') but that shouldn't be a problem in most cases. */
- cell_pool = scm_make_list (scm_length (guardian_list), SCM_UNSPECIFIED);
- /* Tell each guardian interested in OBJ that OBJ is no longer
- reachable. */
- for (;
- !scm_is_null (guardian_list);
- guardian_list = SCM_CDR (guardian_list))
- {
- SCM zombies;
- SCM guardian;
- t_guardian *g;
- guardian = scm_c_weak_vector_ref (scm_car (guardian_list), 0);
-
- if (scm_is_false (guardian))
- {
- /* The guardian itself vanished in the meantime. */
- #ifdef DEBUG_GUARDIANS
- printf (" guardian for %p vanished\n", ptr);
- #endif
- continue;
- }
- g = GUARDIAN_DATA (guardian);
- scm_i_pthread_mutex_lock (&g->mutex);
- if (g->live == 0)
- abort ();
- /* Get a fresh cell from CELL_POOL. */
- zombies = cell_pool;
- cell_pool = SCM_CDR (cell_pool);
- /* Compute and update G's zombie list. */
- SCM_SETCAR (zombies, obj);
- SCM_SETCDR (zombies, g->zombies);
- g->zombies = zombies;
- g->live--;
- scm_i_pthread_mutex_unlock (&g->mutex);
- }
- if (scm_is_true (proxied_finalizer))
- {
- /* Re-register the finalizer that was in place before we installed this
- one. */
- GC_finalization_proc finalizer, prev_finalizer;
- void *finalizer_data, *prev_finalizer_data;
- finalizer = (GC_finalization_proc) SCM_UNPACK_POINTER (SCM_CAR (proxied_finalizer));
- finalizer_data = SCM_UNPACK_POINTER (SCM_CDR (proxied_finalizer));
- if (finalizer == NULL)
- abort ();
- GC_REGISTER_FINALIZER_NO_ORDER (ptr, finalizer, finalizer_data,
- &prev_finalizer, &prev_finalizer_data);
- #ifdef DEBUG_GUARDIANS
- printf (" reinstalled proxied finalizer %p for %p\n", finalizer, ptr);
- #endif
- }
- #ifdef DEBUG_GUARDIANS
- printf ("end of finalize (%p)\n", ptr);
- #endif
- }
- /* Add OBJ as a guarded object of GUARDIAN. */
- static void
- scm_i_guard (SCM guardian, SCM obj)
- {
- t_guardian *g = GUARDIAN_DATA (guardian);
- if (SCM_HEAP_OBJECT_P (obj))
- {
- /* Register a finalizer and pass a pair as the ``client data''
- argument. The pair contains in its car `#f' or a pair describing a
- ``proxied'' finalizer (see below); its cdr contains a list of
- guardians interested in OBJ.
- A ``proxied'' finalizer is a finalizer that was registered for OBJ
- before OBJ became guarded (e.g., a SMOB `free' function). We are
- assuming here that finalizers are only used internally, either at
- the very beginning of an object's lifetime (e.g., see `SCM_NEWSMOB')
- or by this function. */
- GC_finalization_proc prev_finalizer;
- void *prev_data;
- SCM guardians_for_obj, finalizer_data;
- scm_i_pthread_mutex_lock (&g->mutex);
- g->live++;
- /* Note: GUARDIANS_FOR_OBJ holds weak references to guardians so
- that a guardian can be collected before the objects it guards
- (see `guardians.test'). */
- guardians_for_obj = scm_cons (scm_make_weak_vector (SCM_INUM1, guardian),
- SCM_EOL);
- finalizer_data = scm_cons (SCM_BOOL_F, guardians_for_obj);
- GC_REGISTER_FINALIZER_NO_ORDER (SCM_UNPACK_POINTER (obj), finalize_guarded,
- SCM_UNPACK_POINTER (finalizer_data),
- &prev_finalizer, &prev_data);
- if (prev_finalizer == finalize_guarded)
- {
- /* OBJ is already guarded by another guardian: add GUARDIAN to its
- list of guardians. */
- SCM prev_guardian_list, prev_finalizer_data;
- if (prev_data == NULL)
- abort ();
- prev_finalizer_data = SCM_PACK_POINTER (prev_data);
- if (!scm_is_pair (prev_finalizer_data))
- abort ();
- prev_guardian_list = SCM_CDR (prev_finalizer_data);
- SCM_SETCDR (guardians_for_obj, prev_guardian_list);
- /* Also copy information about proxied finalizers. */
- SCM_SETCAR (finalizer_data, SCM_CAR (prev_finalizer_data));
- }
- else if (prev_finalizer != NULL)
- {
- /* There was already a finalizer registered for OBJ so we will
- ``proxy'' it, i.e., record it so that we can re-register it once
- `finalize_guarded ()' has finished. */
- SCM proxied_finalizer;
- proxied_finalizer = scm_cons (SCM_PACK_POINTER (prev_finalizer),
- SCM_PACK_POINTER (prev_data));
- SCM_SETCAR (finalizer_data, proxied_finalizer);
- }
- scm_i_pthread_mutex_unlock (&g->mutex);
- }
- }
- static SCM
- scm_i_get_one_zombie (SCM guardian)
- {
- t_guardian *g = GUARDIAN_DATA (guardian);
- SCM res = SCM_BOOL_F;
- scm_i_pthread_mutex_lock (&g->mutex);
- if (!scm_is_null (g->zombies))
- {
- /* Note: We return zombies in reverse order. */
- res = SCM_CAR (g->zombies);
- g->zombies = SCM_CDR (g->zombies);
- }
- scm_i_pthread_mutex_unlock (&g->mutex);
- return res;
- }
- /* This is the Scheme entry point for each guardian: If OBJ is an
- * object, it's added to the guardian's live list. If OBJ is unbound,
- * the next available unreachable object (or #f if none) is returned.
- *
- * If the second optional argument THROW_P is true (the default), then
- * an error is raised if GUARDIAN is greedy and OBJ is already greedily
- * guarded. If THROW_P is false, #f is returned instead of raising the
- * error, and #t is returned if everything is fine.
- */
- static SCM
- guardian_apply (SCM guardian, SCM obj, SCM throw_p)
- {
- if (!SCM_UNBNDP (obj))
- {
- scm_i_guard (guardian, obj);
- return SCM_UNSPECIFIED;
- }
- else
- return scm_i_get_one_zombie (guardian);
- }
- SCM_DEFINE (scm_make_guardian, "make-guardian", 0, 0, 0,
- (),
- "Create a new guardian. A guardian protects a set of objects from\n"
- "garbage collection, allowing a program to apply cleanup or other\n"
- "actions.\n"
- "\n"
- "@code{make-guardian} returns a procedure representing the guardian.\n"
- "Calling the guardian procedure with an argument adds the argument to\n"
- "the guardian's set of protected objects. Calling the guardian\n"
- "procedure without an argument returns one of the protected objects\n"
- "which are ready for garbage collection, or @code{#f} if no such object\n"
- "is available. Objects which are returned in this way are removed from\n"
- "the guardian.\n"
- "\n"
- "You can put a single object into a guardian more than once and you can\n"
- "put a single object into more than one guardian. The object will then\n"
- "be returned multiple times by the guardian procedures.\n"
- "\n"
- "An object is eligible to be returned from a guardian when it is no\n"
- "longer referenced from outside any guardian.\n"
- "\n"
- "There is no guarantee about the order in which objects are returned\n"
- "from a guardian. If you want to impose an order on finalization\n"
- "actions, for example, you can do that by keeping objects alive in some\n"
- "global data structure until they are no longer needed for finalizing\n"
- "other objects.\n"
- "\n"
- "Being an element in a weak vector, a key in a hash table with weak\n"
- "keys, or a value in a hash table with weak value does not prevent an\n"
- "object from being returned by a guardian. But as long as an object\n"
- "can be returned from a guardian it will not be removed from such a\n"
- "weak vector or hash table. In other words, a weak link does not\n"
- "prevent an object from being considered collectable, but being inside\n"
- "a guardian prevents a weak link from being broken.\n"
- "\n"
- "A key in a weak key hash table can be though of as having a strong\n"
- "reference to its associated value as long as the key is accessible.\n"
- "Consequently, when the key only accessible from within a guardian, the\n"
- "reference from the key to the value is also considered to be coming\n"
- "from within a guardian. Thus, if there is no other reference to the\n"
- "value, it is eligible to be returned from a guardian.\n")
- #define FUNC_NAME s_scm_make_guardian
- {
- t_guardian *g = scm_gc_malloc (sizeof (t_guardian), "guardian");
- SCM z;
- scm_i_pthread_mutex_init (&g->mutex, NULL);
- /* A tconc starts out with one tail pair. */
- g->live = 0;
- g->zombies = SCM_EOL;
- g->next = NULL;
- SCM_NEWSMOB (z, tc16_guardian, g);
- return z;
- }
- #undef FUNC_NAME
- void
- scm_init_guardians ()
- {
- /* We use unordered finalization `a la Java. */
- GC_set_java_finalization (1);
- tc16_guardian = scm_make_smob_type ("guardian", 0);
- scm_set_smob_print (tc16_guardian, guardian_print);
- scm_set_smob_apply (tc16_guardian, guardian_apply, 0, 1, 0);
- #include "libguile/guardians.x"
- }
- /*
- Local Variables:
- c-file-style: "gnu"
- End:
- */
|