fix scm_i_tag_name
[bpt/guile.git] / libguile / gc.c
1 /* Copyright (C) 1995,1996,1997,1998,1999,2000,2001, 2002, 2003, 2006, 2008, 2009, 2010, 2011 Free Software Foundation, Inc.
2 *
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.
7 *
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.
12 *
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
16 * 02110-1301 USA
17 */
18
19 /* #define DEBUGINFO */
20
21 #ifdef HAVE_CONFIG_H
22 # include <config.h>
23 #endif
24
25 #include "libguile/gen-scmconfig.h"
26
27 #include <stdio.h>
28 #include <errno.h>
29 #include <string.h>
30
31 #ifdef __ia64__
32 #include <ucontext.h>
33 extern unsigned long * __libc_ia64_register_backing_store_base;
34 #endif
35
36 #include "libguile/_scm.h"
37 #include "libguile/eval.h"
38 #include "libguile/stime.h"
39 #include "libguile/stackchk.h"
40 #include "libguile/struct.h"
41 #include "libguile/smob.h"
42 #include "libguile/arrays.h"
43 #include "libguile/async.h"
44 #include "libguile/ports.h"
45 #include "libguile/root.h"
46 #include "libguile/strings.h"
47 #include "libguile/vectors.h"
48 #include "libguile/weaks.h"
49 #include "libguile/hashtab.h"
50 #include "libguile/tags.h"
51
52 #include "libguile/private-gc.h"
53 #include "libguile/validate.h"
54 #include "libguile/deprecation.h"
55 #include "libguile/gc.h"
56 #include "libguile/dynwind.h"
57
58 #include "libguile/bdw-gc.h"
59
60 /* For GC_set_start_callback. */
61 #include <gc/gc_mark.h>
62
63 #ifdef GUILE_DEBUG_MALLOC
64 #include "libguile/debug-malloc.h"
65 #endif
66
67 #ifdef HAVE_MALLOC_H
68 #include <malloc.h>
69 #endif
70
71 #ifdef HAVE_UNISTD_H
72 #include <unistd.h>
73 #endif
74
75 /* Set this to != 0 if every cell that is accessed shall be checked:
76 */
77 int scm_debug_cell_accesses_p = 0;
78 int scm_expensive_debug_cell_accesses_p = 0;
79
80 /* Set this to 0 if no additional gc's shall be performed, otherwise set it to
81 * the number of cell accesses after which a gc shall be called.
82 */
83 int scm_debug_cells_gc_interval = 0;
84
85 /* Hash table that keeps a reference to objects the user wants to protect from
86 garbage collection. It could arguably be private but applications have come
87 to rely on it (e.g., Lilypond 2.13.9). */
88 SCM scm_protects;
89
90
91 #if (SCM_DEBUG_CELL_ACCESSES == 1)
92
93
94 /*
95
96 Assert that the given object is a valid reference to a valid cell. This
97 test involves to determine whether the object is a cell pointer, whether
98 this pointer actually points into a heap segment and whether the cell
99 pointed to is not a free cell. Further, additional garbage collections may
100 get executed after a user defined number of cell accesses. This helps to
101 find places in the C code where references are dropped for extremely short
102 periods.
103
104 */
105 void
106 scm_i_expensive_validation_check (SCM cell)
107 {
108 /* If desired, perform additional garbage collections after a user
109 * defined number of cell accesses.
110 */
111 if (scm_debug_cells_gc_interval)
112 {
113 static unsigned int counter = 0;
114
115 if (counter != 0)
116 {
117 --counter;
118 }
119 else
120 {
121 counter = scm_debug_cells_gc_interval;
122 scm_gc ();
123 }
124 }
125 }
126
127 /* Whether cell validation is already running. */
128 static int scm_i_cell_validation_already_running = 0;
129
130 void
131 scm_assert_cell_valid (SCM cell)
132 {
133 if (!scm_i_cell_validation_already_running && scm_debug_cell_accesses_p)
134 {
135 scm_i_cell_validation_already_running = 1; /* set to avoid recursion */
136
137 /*
138 During GC, no user-code should be run, and the guile core
139 should use non-protected accessors.
140 */
141 if (scm_gc_running_p)
142 return;
143
144 /*
145 Only scm_in_heap_p and rescanning the heap is wildly
146 expensive.
147 */
148 if (scm_expensive_debug_cell_accesses_p)
149 scm_i_expensive_validation_check (cell);
150
151 scm_i_cell_validation_already_running = 0; /* re-enable */
152 }
153 }
154
155
156
157 SCM_DEFINE (scm_set_debug_cell_accesses_x, "set-debug-cell-accesses!", 1, 0, 0,
158 (SCM flag),
159 "If @var{flag} is @code{#f}, cell access checking is disabled.\n"
160 "If @var{flag} is @code{#t}, cheap cell access checking is enabled,\n"
161 "but no additional calls to garbage collection are issued.\n"
162 "If @var{flag} is a number, strict cell access checking is enabled,\n"
163 "with an additional garbage collection after the given\n"
164 "number of cell accesses.\n"
165 "This procedure only exists when the compile-time flag\n"
166 "@code{SCM_DEBUG_CELL_ACCESSES} was set to 1.")
167 #define FUNC_NAME s_scm_set_debug_cell_accesses_x
168 {
169 if (scm_is_false (flag))
170 {
171 scm_debug_cell_accesses_p = 0;
172 }
173 else if (scm_is_eq (flag, SCM_BOOL_T))
174 {
175 scm_debug_cells_gc_interval = 0;
176 scm_debug_cell_accesses_p = 1;
177 scm_expensive_debug_cell_accesses_p = 0;
178 }
179 else
180 {
181 scm_debug_cells_gc_interval = scm_to_signed_integer (flag, 0, INT_MAX);
182 scm_debug_cell_accesses_p = 1;
183 scm_expensive_debug_cell_accesses_p = 1;
184 }
185 return SCM_UNSPECIFIED;
186 }
187 #undef FUNC_NAME
188
189
190 #endif /* SCM_DEBUG_CELL_ACCESSES == 1 */
191
192 \f
193 /* Hooks. */
194 scm_t_c_hook scm_before_gc_c_hook;
195 scm_t_c_hook scm_before_mark_c_hook;
196 scm_t_c_hook scm_before_sweep_c_hook;
197 scm_t_c_hook scm_after_sweep_c_hook;
198 scm_t_c_hook scm_after_gc_c_hook;
199
200
201 static void
202 run_before_gc_c_hook (void)
203 {
204 scm_c_hook_run (&scm_before_gc_c_hook, NULL);
205 }
206
207
208 /* GC Statistics Keeping
209 */
210 unsigned long scm_gc_ports_collected = 0;
211 static long gc_time_taken = 0;
212 static long gc_start_time = 0;
213
214
215 static unsigned long protected_obj_count = 0;
216
217
218 SCM_SYMBOL (sym_gc_time_taken, "gc-time-taken");
219 SCM_SYMBOL (sym_heap_size, "heap-size");
220 SCM_SYMBOL (sym_heap_free_size, "heap-free-size");
221 SCM_SYMBOL (sym_heap_total_allocated, "heap-total-allocated");
222 SCM_SYMBOL (sym_heap_allocated_since_gc, "heap-allocated-since-gc");
223 SCM_SYMBOL (sym_protected_objects, "protected-objects");
224 SCM_SYMBOL (sym_times, "gc-times");
225
226
227 /* {Scheme Interface to GC}
228 */
229 static SCM
230 tag_table_to_type_alist (void *closure, SCM key, SCM val, SCM acc)
231 {
232 if (scm_is_integer (key))
233 {
234 int c_tag = scm_to_int (key);
235
236 char const * name = scm_i_tag_name (c_tag);
237 if (name != NULL)
238 {
239 key = scm_from_locale_string (name);
240 }
241 else
242 {
243 char s[100];
244 sprintf (s, "tag %d", c_tag);
245 key = scm_from_locale_string (s);
246 }
247 }
248
249 return scm_cons (scm_cons (key, val), acc);
250 }
251
252 SCM_DEFINE (scm_gc_live_object_stats, "gc-live-object-stats", 0, 0, 0,
253 (),
254 "Return an alist of statistics of the current live objects. ")
255 #define FUNC_NAME s_scm_gc_live_object_stats
256 {
257 SCM tab = scm_make_hash_table (scm_from_int (57));
258 SCM alist;
259
260 alist
261 = scm_internal_hash_fold (&tag_table_to_type_alist, NULL, SCM_EOL, tab);
262
263 return alist;
264 }
265 #undef FUNC_NAME
266
267 extern int scm_gc_malloc_yield_percentage;
268 SCM_DEFINE (scm_gc_stats, "gc-stats", 0, 0, 0,
269 (),
270 "Return an association list of statistics about Guile's current\n"
271 "use of storage.\n")
272 #define FUNC_NAME s_scm_gc_stats
273 {
274 SCM answer;
275 size_t heap_size, free_bytes, bytes_since_gc, total_bytes;
276 size_t gc_times;
277
278 heap_size = GC_get_heap_size ();
279 free_bytes = GC_get_free_bytes ();
280 bytes_since_gc = GC_get_bytes_since_gc ();
281 total_bytes = GC_get_total_bytes ();
282 gc_times = GC_gc_no;
283
284 answer =
285 scm_list_n (scm_cons (sym_gc_time_taken, scm_from_long (gc_time_taken)),
286 scm_cons (sym_heap_size, scm_from_size_t (heap_size)),
287 scm_cons (sym_heap_free_size, scm_from_size_t (free_bytes)),
288 scm_cons (sym_heap_total_allocated,
289 scm_from_size_t (total_bytes)),
290 scm_cons (sym_heap_allocated_since_gc,
291 scm_from_size_t (bytes_since_gc)),
292 scm_cons (sym_protected_objects,
293 scm_from_ulong (protected_obj_count)),
294 scm_cons (sym_times, scm_from_size_t (gc_times)),
295 SCM_UNDEFINED);
296
297 return answer;
298 }
299 #undef FUNC_NAME
300
301
302 SCM_DEFINE (scm_gc_dump, "gc-dump", 0, 0, 0,
303 (void),
304 "Dump information about the garbage collector's internal data "
305 "structures and memory usage to the standard output.")
306 #define FUNC_NAME s_scm_gc_dump
307 {
308 GC_dump ();
309
310 return SCM_UNSPECIFIED;
311 }
312 #undef FUNC_NAME
313
314
315 SCM_DEFINE (scm_object_address, "object-address", 1, 0, 0,
316 (SCM obj),
317 "Return an integer that for the lifetime of @var{obj} is uniquely\n"
318 "returned by this function for @var{obj}")
319 #define FUNC_NAME s_scm_object_address
320 {
321 return scm_from_ulong (SCM_UNPACK (obj));
322 }
323 #undef FUNC_NAME
324
325
326 SCM_DEFINE (scm_gc_disable, "gc-disable", 0, 0, 0,
327 (),
328 "Disables the garbage collector. Nested calls are permitted. "
329 "GC is re-enabled once @code{gc-enable} has been called the "
330 "same number of times @code{gc-disable} was called.")
331 #define FUNC_NAME s_scm_gc_disable
332 {
333 GC_disable ();
334 return SCM_UNSPECIFIED;
335 }
336 #undef FUNC_NAME
337
338 SCM_DEFINE (scm_gc_enable, "gc-enable", 0, 0, 0,
339 (),
340 "Enables the garbage collector.")
341 #define FUNC_NAME s_scm_gc_enable
342 {
343 GC_enable ();
344 return SCM_UNSPECIFIED;
345 }
346 #undef FUNC_NAME
347
348
349 SCM_DEFINE (scm_gc, "gc", 0, 0, 0,
350 (),
351 "Scans all of SCM objects and reclaims for further use those that are\n"
352 "no longer accessible.")
353 #define FUNC_NAME s_scm_gc
354 {
355 scm_i_gc ("call");
356 return SCM_UNSPECIFIED;
357 }
358 #undef FUNC_NAME
359
360 void
361 scm_i_gc (const char *what)
362 {
363 #ifndef HAVE_GC_SET_START_CALLBACK
364 run_before_gc_c_hook ();
365 #endif
366 GC_gcollect ();
367 }
368
369
370 \f
371 /* {GC Protection Helper Functions}
372 */
373
374
375 /*
376 * If within a function you need to protect one or more scheme objects from
377 * garbage collection, pass them as parameters to one of the
378 * scm_remember_upto_here* functions below. These functions don't do
379 * anything, but since the compiler does not know that they are actually
380 * no-ops, it will generate code that calls these functions with the given
381 * parameters. Therefore, you can be sure that the compiler will keep those
382 * scheme values alive (on the stack or in a register) up to the point where
383 * scm_remember_upto_here* is called. In other words, place the call to
384 * scm_remember_upto_here* _behind_ the last code in your function, that
385 * depends on the scheme object to exist.
386 *
387 * Example: We want to make sure that the string object str does not get
388 * garbage collected during the execution of 'some_function' in the code
389 * below, because otherwise the characters belonging to str would be freed and
390 * 'some_function' might access freed memory. To make sure that the compiler
391 * keeps str alive on the stack or in a register such that it is visible to
392 * the conservative gc we add the call to scm_remember_upto_here_1 _after_ the
393 * call to 'some_function'. Note that this would not be necessary if str was
394 * used anyway after the call to 'some_function'.
395 * char *chars = scm_i_string_chars (str);
396 * some_function (chars);
397 * scm_remember_upto_here_1 (str); // str will be alive up to this point.
398 */
399
400 /* Remove any macro versions of these while defining the functions.
401 Functions are always included in the library, for upward binary
402 compatibility and in case combinations of GCC and non-GCC are used. */
403 #undef scm_remember_upto_here_1
404 #undef scm_remember_upto_here_2
405
406 void
407 scm_remember_upto_here_1 (SCM obj SCM_UNUSED)
408 {
409 /* Empty. Protects a single object from garbage collection. */
410 }
411
412 void
413 scm_remember_upto_here_2 (SCM obj1 SCM_UNUSED, SCM obj2 SCM_UNUSED)
414 {
415 /* Empty. Protects two objects from garbage collection. */
416 }
417
418 void
419 scm_remember_upto_here (SCM obj SCM_UNUSED, ...)
420 {
421 /* Empty. Protects any number of objects from garbage collection. */
422 }
423
424 /*
425 These crazy functions prevent garbage collection
426 of arguments after the first argument by
427 ensuring they remain live throughout the
428 function because they are used in the last
429 line of the code block.
430 It'd be better to have a nice compiler hint to
431 aid the conservative stack-scanning GC. --03/09/00 gjb */
432 SCM
433 scm_return_first (SCM elt, ...)
434 {
435 return elt;
436 }
437
438 int
439 scm_return_first_int (int i, ...)
440 {
441 return i;
442 }
443
444
445 SCM
446 scm_permanent_object (SCM obj)
447 {
448 return (scm_gc_protect_object (obj));
449 }
450
451
452 /* Protect OBJ from the garbage collector. OBJ will not be freed, even if all
453 other references are dropped, until the object is unprotected by calling
454 scm_gc_unprotect_object (OBJ). Calls to scm_gc_protect/unprotect_object nest,
455 i. e. it is possible to protect the same object several times, but it is
456 necessary to unprotect the object the same number of times to actually get
457 the object unprotected. It is an error to unprotect an object more often
458 than it has been protected before. The function scm_protect_object returns
459 OBJ.
460 */
461
462 /* Implementation note: For every object X, there is a counter which
463 scm_gc_protect_object (X) increments and scm_gc_unprotect_object (X) decrements.
464 */
465
466
467
468 SCM
469 scm_gc_protect_object (SCM obj)
470 {
471 SCM handle;
472
473 /* This critical section barrier will be replaced by a mutex. */
474 /* njrev: Indeed; if my comment above is correct, there is the same
475 critsec/mutex inconsistency here. */
476 SCM_CRITICAL_SECTION_START;
477
478 handle = scm_hashq_create_handle_x (scm_protects, obj, scm_from_int (0));
479 SCM_SETCDR (handle, scm_sum (SCM_CDR (handle), scm_from_int (1)));
480
481 protected_obj_count ++;
482
483 SCM_CRITICAL_SECTION_END;
484
485 return obj;
486 }
487
488
489 /* Remove any protection for OBJ established by a prior call to
490 scm_protect_object. This function returns OBJ.
491
492 See scm_protect_object for more information. */
493 SCM
494 scm_gc_unprotect_object (SCM obj)
495 {
496 SCM handle;
497
498 /* This critical section barrier will be replaced by a mutex. */
499 /* njrev: and again. */
500 SCM_CRITICAL_SECTION_START;
501
502 if (scm_gc_running_p)
503 {
504 fprintf (stderr, "scm_unprotect_object called during GC.\n");
505 abort ();
506 }
507
508 handle = scm_hashq_get_handle (scm_protects, obj);
509
510 if (scm_is_false (handle))
511 {
512 fprintf (stderr, "scm_unprotect_object called on unprotected object\n");
513 abort ();
514 }
515 else
516 {
517 SCM count = scm_difference (SCM_CDR (handle), scm_from_int (1));
518 if (scm_is_eq (count, scm_from_int (0)))
519 scm_hashq_remove_x (scm_protects, obj);
520 else
521 SCM_SETCDR (handle, count);
522 }
523 protected_obj_count --;
524
525 SCM_CRITICAL_SECTION_END;
526
527 return obj;
528 }
529
530 void
531 scm_gc_register_root (SCM *p)
532 {
533 /* Nothing. */
534 }
535
536 void
537 scm_gc_unregister_root (SCM *p)
538 {
539 /* Nothing. */
540 }
541
542 void
543 scm_gc_register_roots (SCM *b, unsigned long n)
544 {
545 SCM *p = b;
546 for (; p < b + n; ++p)
547 scm_gc_register_root (p);
548 }
549
550 void
551 scm_gc_unregister_roots (SCM *b, unsigned long n)
552 {
553 SCM *p = b;
554 for (; p < b + n; ++p)
555 scm_gc_unregister_root (p);
556 }
557
558 \f
559
560
561 /*
562 MOVE THIS FUNCTION. IT DOES NOT HAVE ANYTHING TODO WITH GC.
563 */
564
565 /* Get an integer from an environment variable. */
566 int
567 scm_getenv_int (const char *var, int def)
568 {
569 char *end = 0;
570 char *val = getenv (var);
571 long res = def;
572 if (!val)
573 return def;
574 res = strtol (val, &end, 10);
575 if (end == val)
576 return def;
577 return res;
578 }
579
580 void
581 scm_storage_prehistory ()
582 {
583 GC_all_interior_pointers = 0;
584 GC_set_free_space_divisor (scm_getenv_int ("GC_FREE_SPACE_DIVISOR", 3));
585
586 GC_INIT ();
587
588 #if (! ((defined GC_VERSION_MAJOR) && (GC_VERSION_MAJOR >= 7))) \
589 && (defined SCM_I_GSC_USE_PTHREAD_THREADS)
590 /* When using GC 6.8, this call is required to initialize thread-local
591 freelists (shouldn't be necessary with GC 7.0). */
592 GC_init ();
593 #endif
594
595 GC_expand_hp (SCM_DEFAULT_INIT_HEAP_SIZE_2);
596
597 /* We only need to register a displacement for those types for which the
598 higher bits of the type tag are used to store a pointer (that is, a
599 pointer to an 8-octet aligned region). For `scm_tc3_struct', this is
600 handled in `scm_alloc_struct ()'. */
601 GC_REGISTER_DISPLACEMENT (scm_tc3_cons);
602 /* GC_REGISTER_DISPLACEMENT (scm_tc3_unused); */
603
604 /* Sanity check. */
605 if (!GC_is_visible (&scm_protects))
606 abort ();
607
608 scm_c_hook_init (&scm_before_gc_c_hook, 0, SCM_C_HOOK_NORMAL);
609 scm_c_hook_init (&scm_before_mark_c_hook, 0, SCM_C_HOOK_NORMAL);
610 scm_c_hook_init (&scm_before_sweep_c_hook, 0, SCM_C_HOOK_NORMAL);
611 scm_c_hook_init (&scm_after_sweep_c_hook, 0, SCM_C_HOOK_NORMAL);
612 scm_c_hook_init (&scm_after_gc_c_hook, 0, SCM_C_HOOK_NORMAL);
613 }
614
615 scm_i_pthread_mutex_t scm_i_gc_admin_mutex = SCM_I_PTHREAD_MUTEX_INITIALIZER;
616
617 void
618 scm_init_gc_protect_object ()
619 {
620 scm_protects = scm_c_make_hash_table (31);
621
622 #if 0
623 /* We can't have a cleanup handler since we have no thread to run it
624 in. */
625
626 #ifdef HAVE_ATEXIT
627 atexit (cleanup);
628 #else
629 #ifdef HAVE_ON_EXIT
630 on_exit (cleanup, 0);
631 #endif
632 #endif
633
634 #endif
635 }
636
637 \f
638
639 SCM scm_after_gc_hook;
640
641 static SCM after_gc_async_cell;
642
643 /* The function after_gc_async_thunk causes the execution of the
644 * after-gc-hook. It is run after the gc, as soon as the asynchronous
645 * events are handled by the evaluator.
646 */
647 static SCM
648 after_gc_async_thunk (void)
649 {
650 /* Fun, no? Hook-run *and* run-hook? */
651 scm_c_hook_run (&scm_after_gc_c_hook, NULL);
652 scm_c_run_hook (scm_after_gc_hook, SCM_EOL);
653 return SCM_UNSPECIFIED;
654 }
655
656
657 /* The function queue_after_gc_hook is run by the scm_before_gc_c_hook
658 * at the end of the garbage collection. The only purpose of this
659 * function is to mark the after_gc_async (which will eventually lead to
660 * the execution of the after_gc_async_thunk).
661 */
662 static void *
663 queue_after_gc_hook (void * hook_data SCM_UNUSED,
664 void *fn_data SCM_UNUSED,
665 void *data SCM_UNUSED)
666 {
667 /* If cell access debugging is enabled, the user may choose to perform
668 * additional garbage collections after an arbitrary number of cell
669 * accesses. We don't want the scheme level after-gc-hook to be performed
670 * for each of these garbage collections for the following reason: The
671 * execution of the after-gc-hook causes cell accesses itself. Thus, if the
672 * after-gc-hook was performed with every gc, and if the gc was performed
673 * after a very small number of cell accesses, then the number of cell
674 * accesses during the execution of the after-gc-hook will suffice to cause
675 * the execution of the next gc. Then, guile would keep executing the
676 * after-gc-hook over and over again, and would never come to do other
677 * things.
678 *
679 * To overcome this problem, if cell access debugging with additional
680 * garbage collections is enabled, the after-gc-hook is never run by the
681 * garbage collecter. When running guile with cell access debugging and the
682 * execution of the after-gc-hook is desired, then it is necessary to run
683 * the hook explicitly from the user code. This has the effect, that from
684 * the scheme level point of view it seems that garbage collection is
685 * performed with a much lower frequency than it actually is. Obviously,
686 * this will not work for code that depends on a fixed one to one
687 * relationship between the execution counts of the C level garbage
688 * collection hooks and the execution count of the scheme level
689 * after-gc-hook.
690 */
691
692 #if (SCM_DEBUG_CELL_ACCESSES == 1)
693 if (scm_debug_cells_gc_interval == 0)
694 #endif
695 {
696 scm_i_thread *t = SCM_I_CURRENT_THREAD;
697
698 if (scm_is_false (SCM_CDR (after_gc_async_cell)))
699 {
700 SCM_SETCDR (after_gc_async_cell, t->active_asyncs);
701 t->active_asyncs = after_gc_async_cell;
702 t->pending_asyncs = 1;
703 }
704 }
705
706 return NULL;
707 }
708
709 \f
710
711 static void *
712 start_gc_timer (void * hook_data SCM_UNUSED,
713 void *fn_data SCM_UNUSED,
714 void *data SCM_UNUSED)
715 {
716 if (!gc_start_time)
717 gc_start_time = scm_c_get_internal_run_time ();
718
719 return NULL;
720 }
721
722 static void *
723 accumulate_gc_timer (void * hook_data SCM_UNUSED,
724 void *fn_data SCM_UNUSED,
725 void *data SCM_UNUSED)
726 {
727 if (gc_start_time)
728 { long now = scm_c_get_internal_run_time ();
729 gc_time_taken += now - gc_start_time;
730 gc_start_time = 0;
731 }
732
733 return NULL;
734 }
735
736
737 \f
738
739 char const *
740 scm_i_tag_name (scm_t_bits tag)
741 {
742 switch (tag & 0x7f) /* 7 bits */
743 {
744 case scm_tcs_struct:
745 return "struct";
746 case scm_tcs_cons_imcar:
747 return "cons (immediate car)";
748 case scm_tcs_cons_nimcar:
749 return "cons (non-immediate car)";
750 case scm_tc7_pointer:
751 return "foreign";
752 case scm_tc7_hashtable:
753 return "hashtable";
754 case scm_tc7_fluid:
755 return "fluid";
756 case scm_tc7_dynamic_state:
757 return "dynamic state";
758 case scm_tc7_frame:
759 return "frame";
760 case scm_tc7_objcode:
761 return "objcode";
762 case scm_tc7_vm:
763 return "vm";
764 case scm_tc7_vm_cont:
765 return "vm continuation";
766 case scm_tc7_wvect:
767 return "weak vector";
768 case scm_tc7_vector:
769 return "vector";
770 case scm_tc7_number:
771 switch (tag)
772 {
773 case scm_tc16_real:
774 return "real";
775 break;
776 case scm_tc16_big:
777 return "bignum";
778 break;
779 case scm_tc16_complex:
780 return "complex number";
781 break;
782 case scm_tc16_fraction:
783 return "fraction";
784 break;
785 }
786 break;
787 case scm_tc7_string:
788 return "string";
789 break;
790 case scm_tc7_stringbuf:
791 return "string buffer";
792 break;
793 case scm_tc7_symbol:
794 return "symbol";
795 break;
796 case scm_tc7_variable:
797 return "variable";
798 break;
799 case scm_tc7_port:
800 return "port";
801 break;
802 case scm_tc7_smob:
803 {
804 int k = 0xff & (tag >> 8);
805 return (scm_smobs[k].name);
806 }
807 break;
808 }
809
810 return NULL;
811 }
812
813
814
815 \f
816 void
817 scm_init_gc ()
818 {
819 /* `GC_INIT ()' was invoked in `scm_storage_prehistory ()'. */
820
821 scm_after_gc_hook = scm_make_hook (SCM_INUM0);
822 scm_c_define ("after-gc-hook", scm_after_gc_hook);
823
824 /* When the async is to run, the cdr of the gc_async pair gets set to
825 the asyncs queue of the current thread. */
826 after_gc_async_cell = scm_cons (scm_c_make_gsubr ("%after-gc-thunk", 0, 0, 0,
827 after_gc_async_thunk),
828 SCM_BOOL_F);
829
830 scm_c_hook_add (&scm_before_gc_c_hook, queue_after_gc_hook, NULL, 0);
831 scm_c_hook_add (&scm_before_gc_c_hook, start_gc_timer, NULL, 0);
832 scm_c_hook_add (&scm_after_gc_c_hook, accumulate_gc_timer, NULL, 0);
833
834 #ifdef HAVE_GC_SET_START_CALLBACK
835 GC_set_start_callback (run_before_gc_c_hook);
836 #endif
837
838 #include "libguile/gc.x"
839 }
840
841
842 void
843 scm_gc_sweep (void)
844 #define FUNC_NAME "scm_gc_sweep"
845 {
846 /* FIXME */
847 fprintf (stderr, "%s: doing nothing\n", FUNC_NAME);
848 }
849 #undef FUNC_NAME
850
851 /*
852 Local Variables:
853 c-file-style: "gnu"
854 End:
855 */