-/* Copyright (C) 1998, 1999, 2000 Free Software Foundation, Inc.
- *
- * This program is free software; you can redistribute it and/or modify
- * it under the terms of the GNU General Public License as published by
- * the Free Software Foundation; either version 2, or (at your option)
- * any later version.
- *
- * This program 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 General Public License for more details.
- *
- * You should have received a copy of the GNU General Public License
- * along with this software; see the file COPYING. If not, write to
- * the Free Software Foundation, Inc., 59 Temple Place, Suite 330,
- * Boston, MA 02111-1307 USA
- *
- * As a special exception, the Free Software Foundation gives permission
- * for additional uses of the text contained in its release of GUILE.
- *
- * The exception is that, if you link the GUILE library with other files
- * to produce an executable, this does not by itself cause the
- * resulting executable to be covered by the GNU General Public License.
- * Your use of that executable is in no way restricted on account of
- * linking the GUILE library code into it.
- *
- * This exception does not however invalidate any other reasons why
- * the executable file might be covered by the GNU General Public License.
- *
- * This exception applies only to the code released by the
- * Free Software Foundation under the name GUILE. If you copy
- * code from other Free Software Foundation releases into a copy of
- * GUILE, as the General Public License permits, the exception does
- * not apply to the code that you add in this way. To avoid misleading
- * anyone as to the status of such modified files, you must delete
- * this exception notice from them.
- *
- * If you write modifications of your own for GUILE, it is your choice
- * whether to permit this exception to apply to your modifications.
- * If you do not wish that, delete this exception notice. */
-
-/* Software engineering face-lift by Greg J. Badros, 11-Dec-1999,
- gjb@cs.washington.edu, http://www.cs.washington.edu/homes/gjb */
-
-\f
-
-/* 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
- *
- * Author: Michael N. Livshin
- * Modified by: Mikael Djurfeldt
- */
-
-#include <stdio.h>
-#include <assert.h>
-
-#include "_scm.h"
-#include "ports.h"
-#include "print.h"
-#include "smob.h"
-#include "vectors.h"
-
-#include "validate.h"
-#include "guardians.h"
-
-static long scm_tc16_guardian;
-
-/* The live and zombies FIFOs are implemented as tconcs as described
- in Dybvig's paper. This decouples addition and removal of elements
- so that no synchronization between these needs to take place.
-*/
-#define TCONC_IN(tc, obj, pair) \
-do { \
- SCM_SETCAR ((tc).tail, obj); \
- SCM_SETCAR (pair, SCM_BOOL_F); \
- SCM_SETCDR (pair, SCM_EOL); \
- SCM_SETCDR ((tc).tail, pair); \
- (tc).tail = pair; \
-} while (0)
-
-#define TCONC_OUT(tc, res) \
-do { \
- (res) = SCM_CAR ((tc).head); \
- (tc).head = SCM_CDR ((tc).head); \
-} while (0)
-
-#define TCONC_EMPTYP(tc) (SCM_EQ_P ((tc).head, (tc).tail))
-
-typedef struct tconc_t
-{
- SCM head;
- SCM tail;
-} tconc_t;
-
-typedef struct guardian_t
-{
- tconc_t live;
- tconc_t zombies;
- struct guardian_t *next;
-} guardian_t;
-
-#define GUARDIAN(x) ((guardian_t *) SCM_CELL_WORD_1 (x))
-#define GUARDIAN_LIVE(x) (GUARDIAN (x)->live)
-#define GUARDIAN_ZOMBIES(x) (GUARDIAN (x)->zombies)
-#define GUARDIAN_NEXT(x) (GUARDIAN (x)->next)
-
-#define CCLO_G(cclo) (SCM_VELTS (cclo)[1])
-
-/* subr constructed from guard below. */
-static SCM guard1;
-
-/* this is wrapped in a compiled closure and is the Scheme entry point
- for each guardian: if arg is an object, it's added to the
- guardian's live list. if arg is unbound, the next available
- zombified object (or #f if none) is returned. */
-static SCM
-guard (SCM cclo, SCM arg)
-{
- if (!SCM_UNBNDP (arg))
- {
- scm_guard (cclo, arg);
- return SCM_UNSPECIFIED;
- }
- else
- return scm_get_one_zombie (cclo);
-}
-
-void
-scm_guard (SCM guardian, SCM obj)
-{
- SCM g = CCLO_G (guardian);
-
- if (SCM_NIMP (obj))
- {
- SCM z;
-
- SCM_NEWCELL (z);
-
- /* This critical section barrier will be replaced by a mutex. */
- SCM_DEFER_INTS;
- TCONC_IN (GUARDIAN_LIVE (g), obj, z);
- SCM_ALLOW_INTS;
- }
-}
-
-SCM
-scm_get_one_zombie (SCM guardian)
-{
- SCM g = CCLO_G (guardian);
- SCM res = SCM_BOOL_F;
-
- /* This critical section barrier will be replaced by a mutex. */
- SCM_DEFER_INTS;
- if (!TCONC_EMPTYP (GUARDIAN_ZOMBIES (g)))
- TCONC_OUT (GUARDIAN_ZOMBIES (g), res);
- SCM_ALLOW_INTS;
- return res;
-}
-
-SCM_DEFINE (scm_make_guardian, "make-guardian", 0, 0, 0,
- (),
- "Create a new guardian.\n"
- "A guardian protects a set of objects from garbage collection,\n"
- "allowing a program to apply cleanup or other actions.\n\n"
-
- "make-guardian returns a procedure representing the guardian.\n"
- "Calling the guardian procedure with an argument adds the\n"
- "argument to the guardian's set of protected objects.\n"
- "Calling the guardian procedure without an argument returns\n"
- "one of the protected objects which are ready for garbage\n"
- "collection or @code{#f} if no such object is available.\n"
- "Objects which are returned in this way are removed from\n"
- "the guardian.\n\n".
-
- "See R. Kent Dybvig, Carl Bruggeman, and David Eby (1993)\n"
- "\"Guardians in a Generation-Based Garbage Collector\".\n"
- "ACM SIGPLAN Conference on Programming Language Design\n"
- "and Implementation, June 1993.")
-#define FUNC_NAME s_scm_make_guardian
-{
- SCM cclo = scm_makcclo (guard1, 2L);
- guardian_t *g = SCM_MUST_MALLOC_TYPE(guardian_t);
- SCM z1 = scm_cons (SCM_BOOL_F, SCM_EOL);
- SCM z2 = scm_cons (SCM_BOOL_F, SCM_EOL);
- SCM z;
-
- /* A tconc starts out with one tail pair. */
- g->live.head = g->live.tail = z1;
- g->zombies.head = g->zombies.tail = z2;
-
- SCM_NEWSMOB (z, scm_tc16_guardian, g);
-
- CCLO_G (cclo) = z;
-
- return cclo;
-}
-#undef FUNC_NAME
-
-/* during the gc mark phase, live guardians are linked into a list
- here. */
-static guardian_t *first_live_guardian = NULL;
-static guardian_t **current_link_field = NULL;
-
-/* called before gc mark phase begins to initialise the live guardian
- list. */
-void
-scm_guardian_gc_init()
-{
- current_link_field = &first_live_guardian;
- first_live_guardian = NULL;
-}
-
-/* mark a guardian by adding it to the live guardian list. */
-static SCM
-g_mark (SCM ptr)
-{
- *current_link_field = GUARDIAN (ptr);
- current_link_field = &GUARDIAN_NEXT (ptr);
- GUARDIAN_NEXT (ptr) = NULL;
-
- /* the objects protected by the guardian are not marked here: that
- would prevent them from ever getting collected. instead marking
- is done at the end of the mark phase by scm_guardian_zombify. */
- return SCM_BOOL_F;
-}
-
-/* this is called by the garbage collector between the mark and sweep
- phases. for each marked guardian, it moves any unmarked object in
- its live list (tconc) to its zombie list (tconc). */
-void scm_guardian_zombify (void)
-{
- guardian_t *g;
-
- /* Note that new guardians may be stuck on the end of the live
- guardian list as we run this loop. As we move unmarked objects
- to the zombie list and mark them, we may find some guarded
- guardians. The guardian mark function will stick them on the end
- of this list, so they'll be processed properly. */
-
- for (g = first_live_guardian; g; g = g->next)
- {
- SCM tconc_tail = g->live.tail;
- SCM *prev_ptr = &g->live.head;
- SCM pair = g->live.head;
-
- while (! SCM_EQ_P (pair, tconc_tail))
- {
- SCM next_pair = SCM_CDR (pair);
-
- if (SCM_NMARKEDP (SCM_CAR (pair)))
- {
- /* got you, zombie! */
-
- /* out of the live list! */
- *prev_ptr = next_pair;
-
- /* into the zombie list! */
- TCONC_IN (g->zombies, SCM_CAR (pair), pair);
- }
- else
- prev_ptr = SCM_CDRLOC (pair);
-
- pair = next_pair;
- }
-
- /* Mark the cells of the live list (yes, the cells in the list,
- even though we don't care about objects pointed to by the list
- cars, since we know they are already marked). */
- for (pair = g->live.head; SCM_NIMP (pair); pair = SCM_GCCDR (pair))
- SCM_SETGCMARK (pair);
-
- /* Preserve the zombies in their undead state, by marking to
- prevent collection. */
-
- /* ghouston: possible bug: this may mark objects which are
- protected by other guardians, but which have no references
- from outside of the guardian system. section 3 of the paper
- mentions shared and cyclic objects and it seems that all
- parts should be made available for collection. Currently the
- behaviour depends on the order in which guardians are
- scanned.
-
- Doesn't it seem a bit disturbing that if a zombie is returned
- to full life after getting returned from the guardian
- procedure, it may reference objects which are in a guardian's
- zombie list? Is it not necessary to move such zombies back
- to the live list, to avoid allowing the guardian procedure to
- return an object which is referenced, so not collectable?
- The paper doesn't give this impression. */
-
- scm_gc_mark (g->zombies.head);
- }
-}
-
-/* not generally used, since guardian smob is wrapped in a closure.
- maybe useful for debugging. */
-static int
-g_print (SCM exp, SCM port, scm_print_state *pstate)
-{
- char buf[256];
- sprintf (buf, "#<guardian live objs: %lu zombies: %lu>",
- scm_ilength (SCM_CDR (GUARDIAN_LIVE (exp).head)),
- scm_ilength (SCM_CDR (GUARDIAN_ZOMBIES (exp).head)));
- scm_puts (buf, port);
-
- return 1;
-}
-
-void
-scm_init_guardian()
-{
- scm_tc16_guardian = scm_make_smob_type_mfpe ("guardian", sizeof (guardian_t),
- g_mark, NULL, g_print, NULL);
- guard1 = scm_make_subr_opt ("guardian", scm_tc7_subr_2o, guard, 0);
-
-#include "guardians.x"
-}
-
-/*
- Local Variables:
- c-file-style: "gnu"
- End:
-*/
+/* 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
+ */
+
+\f
+/* 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/weaks.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 ("#<guardian ", port);
+ scm_uintprint ((scm_t_bits) g, 16, port);
+
+ scm_puts (" (reachable: ", port);
+ scm_display (scm_from_uint (g->live), port);
+ scm_puts (" unreachable: ", port);
+ scm_display (scm_length (g->zombies), port);
+ scm_puts (")", port);
+
+ scm_puts (">", 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 = PTR2SCM (ptr);
+ guardian_list = SCM_CDR (PTR2SCM (finalizer_data));
+ proxied_finalizer = SCM_CAR (PTR2SCM (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;
+ t_guardian *g;
+
+ if (SCM_WEAK_PAIR_CAR_DELETED_P (guardian_list))
+ {
+ /* The guardian itself vanished in the meantime. */
+#ifdef DEBUG_GUARDIANS
+ printf (" guardian for %p vanished\n", ptr);
+#endif
+ continue;
+ }
+
+ g = GUARDIAN_DATA (SCM_CAR (guardian_list));
+
+ 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) SCM2PTR (SCM_CAR (proxied_finalizer));
+ finalizer_data = SCM2PTR (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_NIMP (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 is a weak list so that a guardian can be
+ collected before the objects it guards (see `guardians.test'). */
+ guardians_for_obj = scm_weak_car_pair (guardian, SCM_EOL);
+ finalizer_data = scm_cons (SCM_BOOL_F, guardians_for_obj);
+
+ GC_REGISTER_FINALIZER_NO_ORDER (SCM2PTR (obj), finalize_guarded,
+ SCM2PTR (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 = PTR2SCM (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 (PTR2SCM (prev_finalizer),
+ PTR2SCM (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. */
+#ifdef HAVE_GC_SET_JAVA_FINALIZATION
+ /* This function was added in 7.2alpha2 (June 2009). */
+ GC_set_java_finalization (1);
+#else
+ /* This symbol is deprecated as of 7.3. */
+ GC_java_finalization = 1;
+#endif
+
+ 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:
+*/
HCoop / bpt / guile.git / blobdiff