1 /* Copyright (C) 1995,1996,1997,1998,1999,2000,2001, 2002, 2003, 2006, 2008, 2009, 2010, 2011, 2012, 2013 Free Software Foundation, Inc.
3 * This library is free software; you can redistribute it and/or
4 * modify it under the terms of the GNU Lesser General Public License
5 * as published by the Free Software Foundation; either version 3 of
6 * the License, or (at your option) any later version.
8 * This library is distributed in the hope that it will be useful, but
9 * WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 * Lesser General Public License for more details.
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
15 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
19 /* #define DEBUGINFO */
25 #include "libguile/gen-scmconfig.h"
35 extern unsigned long * __libc_ia64_register_backing_store_base
;
38 #include "libguile/_scm.h"
39 #include "libguile/eval.h"
40 #include "libguile/stime.h"
41 #include "libguile/stackchk.h"
42 #include "libguile/struct.h"
43 #include "libguile/smob.h"
44 #include "libguile/arrays.h"
45 #include "libguile/async.h"
46 #include "libguile/ports.h"
47 #include "libguile/root.h"
48 #include "libguile/strings.h"
49 #include "libguile/vectors.h"
50 #include "libguile/hashtab.h"
51 #include "libguile/tags.h"
53 #include "libguile/private-gc.h"
54 #include "libguile/validate.h"
55 #include "libguile/deprecation.h"
56 #include "libguile/gc.h"
57 #include "libguile/dynwind.h"
59 #include "libguile/bdw-gc.h"
61 /* For GC_set_start_callback. */
62 #include <gc/gc_mark.h>
64 #ifdef GUILE_DEBUG_MALLOC
65 #include "libguile/debug-malloc.h"
72 /* Set this to != 0 if every cell that is accessed shall be checked:
74 int scm_debug_cell_accesses_p
= 0;
75 int scm_expensive_debug_cell_accesses_p
= 0;
77 /* Set this to 0 if no additional gc's shall be performed, otherwise set it to
78 * the number of cell accesses after which a gc shall be called.
80 int scm_debug_cells_gc_interval
= 0;
82 /* Hash table that keeps a reference to objects the user wants to protect from
83 garbage collection. */
84 static SCM scm_protects
;
87 #if (SCM_DEBUG_CELL_ACCESSES == 1)
92 Assert that the given object is a valid reference to a valid cell. This
93 test involves to determine whether the object is a cell pointer, whether
94 this pointer actually points into a heap segment and whether the cell
95 pointed to is not a free cell. Further, additional garbage collections may
96 get executed after a user defined number of cell accesses. This helps to
97 find places in the C code where references are dropped for extremely short
102 scm_i_expensive_validation_check (SCM cell
)
104 /* If desired, perform additional garbage collections after a user
105 * defined number of cell accesses.
107 if (scm_debug_cells_gc_interval
)
109 static unsigned int counter
= 0;
117 counter
= scm_debug_cells_gc_interval
;
123 /* Whether cell validation is already running. */
124 static int scm_i_cell_validation_already_running
= 0;
127 scm_assert_cell_valid (SCM cell
)
129 if (!scm_i_cell_validation_already_running
&& scm_debug_cell_accesses_p
)
131 scm_i_cell_validation_already_running
= 1; /* set to avoid recursion */
134 During GC, no user-code should be run, and the guile core
135 should use non-protected accessors.
137 if (scm_gc_running_p
)
141 Only scm_in_heap_p and rescanning the heap is wildly
144 if (scm_expensive_debug_cell_accesses_p
)
145 scm_i_expensive_validation_check (cell
);
147 scm_i_cell_validation_already_running
= 0; /* re-enable */
153 SCM_DEFINE (scm_set_debug_cell_accesses_x
, "set-debug-cell-accesses!", 1, 0, 0,
155 "If @var{flag} is @code{#f}, cell access checking is disabled.\n"
156 "If @var{flag} is @code{#t}, cheap cell access checking is enabled,\n"
157 "but no additional calls to garbage collection are issued.\n"
158 "If @var{flag} is a number, strict cell access checking is enabled,\n"
159 "with an additional garbage collection after the given\n"
160 "number of cell accesses.\n"
161 "This procedure only exists when the compile-time flag\n"
162 "@code{SCM_DEBUG_CELL_ACCESSES} was set to 1.")
163 #define FUNC_NAME s_scm_set_debug_cell_accesses_x
165 if (scm_is_false (flag
))
167 scm_debug_cell_accesses_p
= 0;
169 else if (scm_is_eq (flag
, SCM_BOOL_T
))
171 scm_debug_cells_gc_interval
= 0;
172 scm_debug_cell_accesses_p
= 1;
173 scm_expensive_debug_cell_accesses_p
= 0;
177 scm_debug_cells_gc_interval
= scm_to_signed_integer (flag
, 0, INT_MAX
);
178 scm_debug_cell_accesses_p
= 1;
179 scm_expensive_debug_cell_accesses_p
= 1;
181 return SCM_UNSPECIFIED
;
186 #endif /* SCM_DEBUG_CELL_ACCESSES == 1 */
191 scm_t_c_hook scm_before_gc_c_hook
;
192 scm_t_c_hook scm_before_mark_c_hook
;
193 scm_t_c_hook scm_before_sweep_c_hook
;
194 scm_t_c_hook scm_after_sweep_c_hook
;
195 scm_t_c_hook scm_after_gc_c_hook
;
199 run_before_gc_c_hook (void)
201 if (!SCM_I_CURRENT_THREAD
)
202 /* GC while a thread is spinning up; punt. */
205 scm_c_hook_run (&scm_before_gc_c_hook
, NULL
);
209 /* GC Statistics Keeping
211 unsigned long scm_gc_ports_collected
= 0;
212 static long gc_time_taken
= 0;
213 static long gc_start_time
= 0;
215 static unsigned long free_space_divisor
;
216 static unsigned long minimum_free_space_divisor
;
217 static double target_free_space_divisor
;
219 static unsigned long protected_obj_count
= 0;
222 SCM_SYMBOL (sym_gc_time_taken
, "gc-time-taken");
223 SCM_SYMBOL (sym_heap_size
, "heap-size");
224 SCM_SYMBOL (sym_heap_free_size
, "heap-free-size");
225 SCM_SYMBOL (sym_heap_total_allocated
, "heap-total-allocated");
226 SCM_SYMBOL (sym_heap_allocated_since_gc
, "heap-allocated-since-gc");
227 SCM_SYMBOL (sym_protected_objects
, "protected-objects");
228 SCM_SYMBOL (sym_times
, "gc-times");
231 /* {Scheme Interface to GC}
234 tag_table_to_type_alist (void *closure
, SCM key
, SCM val
, SCM acc
)
236 if (scm_is_integer (key
))
238 int c_tag
= scm_to_int (key
);
240 char const * name
= scm_i_tag_name (c_tag
);
243 key
= scm_from_locale_string (name
);
248 sprintf (s
, "tag %d", c_tag
);
249 key
= scm_from_locale_string (s
);
253 return scm_cons (scm_cons (key
, val
), acc
);
256 SCM_DEFINE (scm_gc_live_object_stats
, "gc-live-object-stats", 0, 0, 0,
258 "Return an alist of statistics of the current live objects. ")
259 #define FUNC_NAME s_scm_gc_live_object_stats
261 SCM tab
= scm_make_hash_table (scm_from_int (57));
265 = scm_internal_hash_fold (&tag_table_to_type_alist
, NULL
, SCM_EOL
, tab
);
271 extern int scm_gc_malloc_yield_percentage
;
272 SCM_DEFINE (scm_gc_stats
, "gc-stats", 0, 0, 0,
274 "Return an association list of statistics about Guile's current\n"
276 #define FUNC_NAME s_scm_gc_stats
279 GC_word heap_size
, free_bytes
, unmapped_bytes
, bytes_since_gc
, total_bytes
;
282 GC_get_heap_usage_safe (&heap_size
, &free_bytes
, &unmapped_bytes
,
283 &bytes_since_gc
, &total_bytes
);
287 scm_list_n (scm_cons (sym_gc_time_taken
, scm_from_long (gc_time_taken
)),
288 scm_cons (sym_heap_size
, scm_from_size_t (heap_size
)),
289 scm_cons (sym_heap_free_size
, scm_from_size_t (free_bytes
)),
290 scm_cons (sym_heap_total_allocated
,
291 scm_from_size_t (total_bytes
)),
292 scm_cons (sym_heap_allocated_since_gc
,
293 scm_from_size_t (bytes_since_gc
)),
294 scm_cons (sym_protected_objects
,
295 scm_from_ulong (protected_obj_count
)),
296 scm_cons (sym_times
, scm_from_size_t (gc_times
)),
304 SCM_DEFINE (scm_gc_dump
, "gc-dump", 0, 0, 0,
306 "Dump information about the garbage collector's internal data "
307 "structures and memory usage to the standard output.")
308 #define FUNC_NAME s_scm_gc_dump
312 return SCM_UNSPECIFIED
;
317 SCM_DEFINE (scm_object_address
, "object-address", 1, 0, 0,
319 "Return an integer that for the lifetime of @var{obj} is uniquely\n"
320 "returned by this function for @var{obj}")
321 #define FUNC_NAME s_scm_object_address
323 return scm_from_ulong (SCM_UNPACK (obj
));
328 SCM_DEFINE (scm_gc_disable
, "gc-disable", 0, 0, 0,
330 "Disables the garbage collector. Nested calls are permitted. "
331 "GC is re-enabled once @code{gc-enable} has been called the "
332 "same number of times @code{gc-disable} was called.")
333 #define FUNC_NAME s_scm_gc_disable
336 return SCM_UNSPECIFIED
;
340 SCM_DEFINE (scm_gc_enable
, "gc-enable", 0, 0, 0,
342 "Enables the garbage collector.")
343 #define FUNC_NAME s_scm_gc_enable
346 return SCM_UNSPECIFIED
;
351 SCM_DEFINE (scm_gc
, "gc", 0, 0, 0,
353 "Scans all of SCM objects and reclaims for further use those that are\n"
354 "no longer accessible.")
355 #define FUNC_NAME s_scm_gc
358 /* If you're calling scm_gc(), you probably want synchronous
360 GC_invoke_finalizers ();
361 return SCM_UNSPECIFIED
;
366 scm_i_gc (const char *what
)
373 /* {GC Protection Helper Functions}
378 * If within a function you need to protect one or more scheme objects from
379 * garbage collection, pass them as parameters to one of the
380 * scm_remember_upto_here* functions below. These functions don't do
381 * anything, but since the compiler does not know that they are actually
382 * no-ops, it will generate code that calls these functions with the given
383 * parameters. Therefore, you can be sure that the compiler will keep those
384 * scheme values alive (on the stack or in a register) up to the point where
385 * scm_remember_upto_here* is called. In other words, place the call to
386 * scm_remember_upto_here* _behind_ the last code in your function, that
387 * depends on the scheme object to exist.
389 * Example: We want to make sure that the string object str does not get
390 * garbage collected during the execution of 'some_function' in the code
391 * below, because otherwise the characters belonging to str would be freed and
392 * 'some_function' might access freed memory. To make sure that the compiler
393 * keeps str alive on the stack or in a register such that it is visible to
394 * the conservative gc we add the call to scm_remember_upto_here_1 _after_ the
395 * call to 'some_function'. Note that this would not be necessary if str was
396 * used anyway after the call to 'some_function'.
397 * char *chars = scm_i_string_chars (str);
398 * some_function (chars);
399 * scm_remember_upto_here_1 (str); // str will be alive up to this point.
402 /* Remove any macro versions of these while defining the functions.
403 Functions are always included in the library, for upward binary
404 compatibility and in case combinations of GCC and non-GCC are used. */
405 #undef scm_remember_upto_here_1
406 #undef scm_remember_upto_here_2
409 scm_remember_upto_here_1 (SCM obj SCM_UNUSED
)
411 /* Empty. Protects a single object from garbage collection. */
415 scm_remember_upto_here_2 (SCM obj1 SCM_UNUSED
, SCM obj2 SCM_UNUSED
)
417 /* Empty. Protects two objects from garbage collection. */
421 scm_remember_upto_here (SCM obj SCM_UNUSED
, ...)
423 /* Empty. Protects any number of objects from garbage collection. */
427 These crazy functions prevent garbage collection
428 of arguments after the first argument by
429 ensuring they remain live throughout the
430 function because they are used in the last
431 line of the code block.
432 It'd be better to have a nice compiler hint to
433 aid the conservative stack-scanning GC. --03/09/00 gjb */
435 scm_return_first (SCM elt
, ...)
441 scm_return_first_int (int i
, ...)
448 scm_permanent_object (SCM obj
)
450 return (scm_gc_protect_object (obj
));
454 /* Protect OBJ from the garbage collector. OBJ will not be freed, even if all
455 other references are dropped, until the object is unprotected by calling
456 scm_gc_unprotect_object (OBJ). Calls to scm_gc_protect/unprotect_object nest,
457 i. e. it is possible to protect the same object several times, but it is
458 necessary to unprotect the object the same number of times to actually get
459 the object unprotected. It is an error to unprotect an object more often
460 than it has been protected before. The function scm_protect_object returns
464 /* Implementation note: For every object X, there is a counter which
465 scm_gc_protect_object (X) increments and scm_gc_unprotect_object (X) decrements.
471 scm_gc_protect_object (SCM obj
)
475 /* This critical section barrier will be replaced by a mutex. */
476 /* njrev: Indeed; if my comment above is correct, there is the same
477 critsec/mutex inconsistency here. */
478 SCM_CRITICAL_SECTION_START
;
480 handle
= scm_hashq_create_handle_x (scm_protects
, obj
, scm_from_int (0));
481 SCM_SETCDR (handle
, scm_sum (SCM_CDR (handle
), scm_from_int (1)));
483 protected_obj_count
++;
485 SCM_CRITICAL_SECTION_END
;
491 /* Remove any protection for OBJ established by a prior call to
492 scm_protect_object. This function returns OBJ.
494 See scm_protect_object for more information. */
496 scm_gc_unprotect_object (SCM obj
)
500 /* This critical section barrier will be replaced by a mutex. */
501 /* njrev: and again. */
502 SCM_CRITICAL_SECTION_START
;
504 if (scm_gc_running_p
)
506 fprintf (stderr
, "scm_unprotect_object called during GC.\n");
510 handle
= scm_hashq_get_handle (scm_protects
, obj
);
512 if (scm_is_false (handle
))
514 fprintf (stderr
, "scm_unprotect_object called on unprotected object\n");
519 SCM count
= scm_difference (SCM_CDR (handle
), scm_from_int (1));
520 if (scm_is_eq (count
, scm_from_int (0)))
521 scm_hashq_remove_x (scm_protects
, obj
);
523 SCM_SETCDR (handle
, count
);
525 protected_obj_count
--;
527 SCM_CRITICAL_SECTION_END
;
533 scm_gc_register_root (SCM
*p
)
539 scm_gc_unregister_root (SCM
*p
)
545 scm_gc_register_roots (SCM
*b
, unsigned long n
)
548 for (; p
< b
+ n
; ++p
)
549 scm_gc_register_root (p
);
553 scm_gc_unregister_roots (SCM
*b
, unsigned long n
)
556 for (; p
< b
+ n
; ++p
)
557 scm_gc_unregister_root (p
);
564 MOVE THIS FUNCTION. IT DOES NOT HAVE ANYTHING TODO WITH GC.
567 /* Get an integer from an environment variable. */
569 scm_getenv_int (const char *var
, int def
)
572 char *val
= getenv (var
);
576 res
= strtol (val
, &end
, 10);
583 scm_storage_prehistory ()
585 GC_all_interior_pointers
= 0;
586 free_space_divisor
= scm_getenv_int ("GC_FREE_SPACE_DIVISOR", 3);
587 minimum_free_space_divisor
= free_space_divisor
;
588 target_free_space_divisor
= free_space_divisor
;
589 GC_set_free_space_divisor (free_space_divisor
);
590 GC_set_finalize_on_demand (1);
594 #if (! ((defined GC_VERSION_MAJOR) && (GC_VERSION_MAJOR >= 7))) \
595 && (defined SCM_I_GSC_USE_PTHREAD_THREADS)
596 /* When using GC 6.8, this call is required to initialize thread-local
597 freelists (shouldn't be necessary with GC 7.0). */
601 GC_expand_hp (SCM_DEFAULT_INIT_HEAP_SIZE_2
);
603 /* We only need to register a displacement for those types for which the
604 higher bits of the type tag are used to store a pointer (that is, a
605 pointer to an 8-octet aligned region). For `scm_tc3_struct', this is
606 handled in `scm_alloc_struct ()'. */
607 GC_REGISTER_DISPLACEMENT (scm_tc3_cons
);
608 /* GC_REGISTER_DISPLACEMENT (scm_tc3_unused); */
611 if (!GC_is_visible (&scm_protects
))
614 scm_c_hook_init (&scm_before_gc_c_hook
, 0, SCM_C_HOOK_NORMAL
);
615 scm_c_hook_init (&scm_before_mark_c_hook
, 0, SCM_C_HOOK_NORMAL
);
616 scm_c_hook_init (&scm_before_sweep_c_hook
, 0, SCM_C_HOOK_NORMAL
);
617 scm_c_hook_init (&scm_after_sweep_c_hook
, 0, SCM_C_HOOK_NORMAL
);
618 scm_c_hook_init (&scm_after_gc_c_hook
, 0, SCM_C_HOOK_NORMAL
);
621 scm_i_pthread_mutex_t scm_i_gc_admin_mutex
= SCM_I_PTHREAD_MUTEX_INITIALIZER
;
624 scm_init_gc_protect_object ()
626 scm_protects
= scm_c_make_hash_table (31);
629 /* We can't have a cleanup handler since we have no thread to run it
636 on_exit (cleanup
, 0);
645 SCM scm_after_gc_hook
;
647 static SCM after_gc_async_cell
;
649 /* The function after_gc_async_thunk causes the execution of the
650 * after-gc-hook. It is run after the gc, as soon as the asynchronous
651 * events are handled by the evaluator.
654 after_gc_async_thunk (void)
656 /* Fun, no? Hook-run *and* run-hook? */
657 scm_c_hook_run (&scm_after_gc_c_hook
, NULL
);
658 scm_c_run_hook (scm_after_gc_hook
, SCM_EOL
);
659 return SCM_UNSPECIFIED
;
663 /* The function queue_after_gc_hook is run by the scm_before_gc_c_hook
664 * at the end of the garbage collection. The only purpose of this
665 * function is to mark the after_gc_async (which will eventually lead to
666 * the execution of the after_gc_async_thunk).
669 queue_after_gc_hook (void * hook_data SCM_UNUSED
,
670 void *fn_data SCM_UNUSED
,
671 void *data SCM_UNUSED
)
673 /* If cell access debugging is enabled, the user may choose to perform
674 * additional garbage collections after an arbitrary number of cell
675 * accesses. We don't want the scheme level after-gc-hook to be performed
676 * for each of these garbage collections for the following reason: The
677 * execution of the after-gc-hook causes cell accesses itself. Thus, if the
678 * after-gc-hook was performed with every gc, and if the gc was performed
679 * after a very small number of cell accesses, then the number of cell
680 * accesses during the execution of the after-gc-hook will suffice to cause
681 * the execution of the next gc. Then, guile would keep executing the
682 * after-gc-hook over and over again, and would never come to do other
685 * To overcome this problem, if cell access debugging with additional
686 * garbage collections is enabled, the after-gc-hook is never run by the
687 * garbage collecter. When running guile with cell access debugging and the
688 * execution of the after-gc-hook is desired, then it is necessary to run
689 * the hook explicitly from the user code. This has the effect, that from
690 * the scheme level point of view it seems that garbage collection is
691 * performed with a much lower frequency than it actually is. Obviously,
692 * this will not work for code that depends on a fixed one to one
693 * relationship between the execution counts of the C level garbage
694 * collection hooks and the execution count of the scheme level
698 #if (SCM_DEBUG_CELL_ACCESSES == 1)
699 if (scm_debug_cells_gc_interval
== 0)
702 scm_i_thread
*t
= SCM_I_CURRENT_THREAD
;
704 if (scm_is_false (SCM_CDR (after_gc_async_cell
)))
706 SCM_SETCDR (after_gc_async_cell
, t
->active_asyncs
);
707 t
->active_asyncs
= after_gc_async_cell
;
708 t
->pending_asyncs
= 1;
718 start_gc_timer (void * hook_data SCM_UNUSED
,
719 void *fn_data SCM_UNUSED
,
720 void *data SCM_UNUSED
)
723 gc_start_time
= scm_c_get_internal_run_time ();
729 accumulate_gc_timer (void * hook_data SCM_UNUSED
,
730 void *fn_data SCM_UNUSED
,
731 void *data SCM_UNUSED
)
735 long now
= scm_c_get_internal_run_time ();
736 gc_time_taken
+= now
- gc_start_time
;
743 /* Return some idea of the memory footprint of a process, in bytes.
744 Currently only works on Linux systems. */
746 get_image_size (void)
748 unsigned long size
, resident
, share
;
751 FILE *fp
= fopen ("/proc/self/statm", "r");
753 if (fp
&& fscanf (fp
, "%lu %lu %lu", &size
, &resident
, &share
) == 3)
754 ret
= resident
* 4096;
762 /* These are discussed later. */
763 static size_t bytes_until_gc
;
764 static scm_i_pthread_mutex_t bytes_until_gc_lock
= SCM_I_PTHREAD_MUTEX_INITIALIZER
;
766 /* Make GC run more frequently when the process image size is growing,
767 measured against the number of bytes allocated through the GC.
769 If Guile is allocating at a GC-managed heap size H, libgc will tend
770 to limit the process image size to H*N. But if at the same time the
771 user program is mallocating at a rate M bytes per GC-allocated byte,
772 then the process stabilizes at H*N*M -- assuming that collecting data
773 will result in malloc'd data being freed. It doesn't take a very
774 large M for this to be a bad situation. To limit the image size,
775 Guile should GC more often -- the bigger the M, the more often.
777 Numeric functions that produce bigger and bigger integers are
778 pessimal, because M is an increasing function of time. Here is an
779 example of such a function:
781 (define (factorial n)
785 (fac (1- n) (* n acc))))
788 It is possible for a process to grow for reasons that will not be
789 solved by faster GC. In that case M will be estimated as
790 artificially high for a while, and so GC will happen more often on
791 the Guile side. But when it stabilizes, Guile can ease back the GC
794 The key is to measure process image growth, not mallocation rate.
795 For maximum effectiveness, Guile reacts quickly to process growth,
796 and exponentially backs down when the process stops growing.
798 See http://thread.gmane.org/gmane.lisp.guile.devel/12552/focus=12936
799 for further discussion.
802 adjust_gc_frequency (void * hook_data SCM_UNUSED
,
803 void *fn_data SCM_UNUSED
,
804 void *data SCM_UNUSED
)
806 static size_t prev_image_size
= 0;
807 static size_t prev_bytes_alloced
= 0;
809 size_t bytes_alloced
;
811 scm_i_pthread_mutex_lock (&bytes_until_gc_lock
);
812 bytes_until_gc
= GC_get_heap_size ();
813 scm_i_pthread_mutex_unlock (&bytes_until_gc_lock
);
815 image_size
= get_image_size ();
816 bytes_alloced
= GC_get_total_bytes ();
818 #define HEURISTICS_DEBUG 0
821 fprintf (stderr
, "prev image / alloced: %lu / %lu\n", prev_image_size
, prev_bytes_alloced
);
822 fprintf (stderr
, " image / alloced: %lu / %lu\n", image_size
, bytes_alloced
);
823 fprintf (stderr
, "divisor %lu / %f\n", free_space_divisor
, target_free_space_divisor
);
826 if (prev_image_size
&& bytes_alloced
!= prev_bytes_alloced
)
828 double growth_rate
, new_target_free_space_divisor
;
829 double decay_factor
= 0.5;
830 double hysteresis
= 0.1;
832 growth_rate
= ((double) image_size
- prev_image_size
)
833 / ((double)bytes_alloced
- prev_bytes_alloced
);
836 fprintf (stderr
, "growth rate %f\n", growth_rate
);
839 new_target_free_space_divisor
= minimum_free_space_divisor
;
842 new_target_free_space_divisor
*= 1.0 + growth_rate
;
845 fprintf (stderr
, "new divisor %f\n", new_target_free_space_divisor
);
848 if (new_target_free_space_divisor
< target_free_space_divisor
)
850 target_free_space_divisor
=
851 (decay_factor
* target_free_space_divisor
852 + (1.0 - decay_factor
) * new_target_free_space_divisor
);
855 target_free_space_divisor
= new_target_free_space_divisor
;
858 fprintf (stderr
, "new target divisor %f\n", target_free_space_divisor
);
861 if (free_space_divisor
+ 0.5 + hysteresis
< target_free_space_divisor
862 || free_space_divisor
- 0.5 - hysteresis
> target_free_space_divisor
)
864 free_space_divisor
= lround (target_free_space_divisor
);
866 fprintf (stderr
, "new divisor %lu\n", free_space_divisor
);
868 GC_set_free_space_divisor (free_space_divisor
);
872 prev_image_size
= image_size
;
873 prev_bytes_alloced
= bytes_alloced
;
878 /* The adjust_gc_frequency routine handles transients in the process
879 image size. It can't handle instense non-GC-managed steady-state
880 allocation though, as it decays the FSD at steady-state down to its
883 The only real way to handle continuous, high non-GC allocation is to
884 let the GC know about it. This routine can handle non-GC allocation
885 rates that are similar in size to the GC-managed heap size.
889 scm_gc_register_allocation (size_t size
)
891 scm_i_pthread_mutex_lock (&bytes_until_gc_lock
);
892 if (bytes_until_gc
- size
> bytes_until_gc
)
894 bytes_until_gc
= GC_get_heap_size ();
895 scm_i_pthread_mutex_unlock (&bytes_until_gc_lock
);
900 bytes_until_gc
-= size
;
901 scm_i_pthread_mutex_unlock (&bytes_until_gc_lock
);
909 scm_i_tag_name (scm_t_bits tag
)
911 switch (tag
& 0x7f) /* 7 bits */
915 case scm_tcs_cons_imcar
:
916 return "cons (immediate car)";
917 case scm_tcs_cons_nimcar
:
918 return "cons (non-immediate car)";
919 case scm_tc7_pointer
:
921 case scm_tc7_hashtable
:
923 case scm_tc7_weak_set
:
925 case scm_tc7_weak_table
:
929 case scm_tc7_dynamic_state
:
930 return "dynamic state";
933 case scm_tc7_objcode
:
937 case scm_tc7_vm_cont
:
938 return "vm continuation";
940 return "weak vector";
952 case scm_tc16_complex
:
953 return "complex number";
955 case scm_tc16_fraction
:
963 case scm_tc7_stringbuf
:
964 return "string buffer";
969 case scm_tc7_variable
:
977 int k
= 0xff & (tag
>> 8);
978 return (scm_smobs
[k
].name
);
992 /* `GC_INIT ()' was invoked in `scm_storage_prehistory ()'. */
994 scm_after_gc_hook
= scm_make_hook (SCM_INUM0
);
995 scm_c_define ("after-gc-hook", scm_after_gc_hook
);
997 /* When the async is to run, the cdr of the gc_async pair gets set to
998 the asyncs queue of the current thread. */
999 after_gc_async_cell
= scm_cons (scm_c_make_gsubr ("%after-gc-thunk", 0, 0, 0,
1000 after_gc_async_thunk
),
1003 scm_c_hook_add (&scm_before_gc_c_hook
, queue_after_gc_hook
, NULL
, 0);
1004 scm_c_hook_add (&scm_before_gc_c_hook
, start_gc_timer
, NULL
, 0);
1005 scm_c_hook_add (&scm_after_gc_c_hook
, accumulate_gc_timer
, NULL
, 0);
1007 /* GC_get_heap_usage does not take a lock, and so can run in the GC
1009 scm_c_hook_add (&scm_before_gc_c_hook
, adjust_gc_frequency
, NULL
, 0);
1011 GC_set_start_callback (run_before_gc_c_hook
);
1013 #include "libguile/gc.x"
1019 #define FUNC_NAME "scm_gc_sweep"
1022 fprintf (stderr
, "%s: doing nothing\n", FUNC_NAME
);