1 /* Copyright (C) 1995, 96, 97, 98, 99, 2000 Free Software Foundation, Inc.
3 * This program is free software; you can redistribute it and/or modify
4 * it under the terms of the GNU General Public License as published by
5 * the Free Software Foundation; either version 2, or (at your option)
8 * This program is distributed in the hope that it will be useful,
9 * but WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
11 * GNU General Public License for more details.
13 * You should have received a copy of the GNU General Public License
14 * along with this software; see the file COPYING. If not, write to
15 * the Free Software Foundation, Inc., 59 Temple Place, Suite 330,
16 * Boston, MA 02111-1307 USA
18 * As a special exception, the Free Software Foundation gives permission
19 * for additional uses of the text contained in its release of GUILE.
21 * The exception is that, if you link the GUILE library with other files
22 * to produce an executable, this does not by itself cause the
23 * resulting executable to be covered by the GNU General Public License.
24 * Your use of that executable is in no way restricted on account of
25 * linking the GUILE library code into it.
27 * This exception does not however invalidate any other reasons why
28 * the executable file might be covered by the GNU General Public License.
30 * This exception applies only to the code released by the
31 * Free Software Foundation under the name GUILE. If you copy
32 * code from other Free Software Foundation releases into a copy of
33 * GUILE, as the General Public License permits, the exception does
34 * not apply to the code that you add in this way. To avoid misleading
35 * anyone as to the status of such modified files, you must delete
36 * this exception notice from them.
38 * If you write modifications of your own for GUILE, it is your choice
39 * whether to permit this exception to apply to your modifications.
40 * If you do not wish that, delete this exception notice. */
42 /* Software engineering face-lift by Greg J. Badros, 11-Dec-1999,
43 gjb@cs.washington.edu, http://www.cs.washington.edu/homes/gjb */
45 /* #define DEBUGINFO */
47 /* SECTION: This code is compiled once.
50 #ifndef MARK_DEPENDENCIES
54 #include "libguile/_scm.h"
55 #include "libguile/eval.h"
56 #include "libguile/stime.h"
57 #include "libguile/stackchk.h"
58 #include "libguile/struct.h"
59 #include "libguile/smob.h"
60 #include "libguile/unif.h"
61 #include "libguile/async.h"
62 #include "libguile/ports.h"
63 #include "libguile/root.h"
64 #include "libguile/strings.h"
65 #include "libguile/vectors.h"
66 #include "libguile/weaks.h"
67 #include "libguile/hashtab.h"
68 #include "libguile/tags.h"
70 #include "libguile/validate.h"
71 #include "libguile/gc.h"
73 #ifdef GUILE_DEBUG_MALLOC
74 #include "libguile/debug-malloc.h"
87 #define var_start(x, y) va_start(x, y)
90 #define var_start(x, y) va_start(x)
95 unsigned int scm_gc_running_p
= 0;
99 #if (SCM_DEBUG_CELL_ACCESSES == 1)
101 unsigned int scm_debug_cell_accesses_p
= 0;
104 /* Assert that the given object is a valid reference to a valid cell. This
105 * test involves to determine whether the object is a cell pointer, whether
106 * this pointer actually points into a heap segment and whether the cell
107 * pointed to is not a free cell.
110 scm_assert_cell_valid (SCM cell
)
112 if (scm_debug_cell_accesses_p
)
114 scm_debug_cell_accesses_p
= 0; /* disable to avoid recursion */
116 if (!scm_cellp (cell
))
118 fprintf (stderr
, "scm_assert_cell_valid: Not a cell object: %lx\n", SCM_UNPACK (cell
));
121 else if (!scm_gc_running_p
)
123 /* Dirk::FIXME:: During garbage collection there occur references to
124 free cells. This is allright during conservative marking, but
125 should not happen otherwise (I think). The case of free cells
126 accessed during conservative marking is handled in function
127 scm_mark_locations. However, there still occur accesses to free
128 cells during gc. I don't understand why this happens. If it is
129 a bug and gets fixed, the following test should also work while
132 if (SCM_FREE_CELL_P (cell
))
134 fprintf (stderr
, "scm_assert_cell_valid: Accessing free cell: %lx\n", SCM_UNPACK (cell
));
138 scm_debug_cell_accesses_p
= 1; /* re-enable */
143 SCM_DEFINE (scm_set_debug_cell_accesses_x
, "set-debug-cell-accesses!", 1, 0, 0,
145 "If FLAG is #f, cell access checking is disabled.\n"
146 "If FLAG is #t, cell access checking is enabled.\n"
147 "This procedure only exists because the compile-time flag\n"
148 "SCM_DEBUG_CELL_ACCESSES was set to 1.\n")
149 #define FUNC_NAME s_scm_set_debug_cell_accesses_x
151 if (SCM_FALSEP (flag
)) {
152 scm_debug_cell_accesses_p
= 0;
153 } else if (SCM_EQ_P (flag
, SCM_BOOL_T
)) {
154 scm_debug_cell_accesses_p
= 1;
156 SCM_WRONG_TYPE_ARG (1, flag
);
158 return SCM_UNSPECIFIED
;
162 #endif /* SCM_DEBUG_CELL_ACCESSES == 1 */
166 /* {heap tuning parameters}
168 * These are parameters for controlling memory allocation. The heap
169 * is the area out of which scm_cons, and object headers are allocated.
171 * Each heap cell is 8 bytes on a 32 bit machine and 16 bytes on a
172 * 64 bit machine. The units of the _SIZE parameters are bytes.
173 * Cons pairs and object headers occupy one heap cell.
175 * SCM_INIT_HEAP_SIZE is the initial size of heap. If this much heap is
176 * allocated initially the heap will grow by half its current size
177 * each subsequent time more heap is needed.
179 * If SCM_INIT_HEAP_SIZE heap cannot be allocated initially, SCM_HEAP_SEG_SIZE
180 * will be used, and the heap will grow by SCM_HEAP_SEG_SIZE when more
181 * heap is needed. SCM_HEAP_SEG_SIZE must fit into type scm_sizet. This code
182 * is in scm_init_storage() and alloc_some_heap() in sys.c
184 * If SCM_INIT_HEAP_SIZE can be allocated initially, the heap will grow by
185 * SCM_EXPHEAP(scm_heap_size) when more heap is needed.
187 * SCM_MIN_HEAP_SEG_SIZE is minimum size of heap to accept when more heap
190 * INIT_MALLOC_LIMIT is the initial amount of malloc usage which will
193 * SCM_MTRIGGER_HYSTERESIS is the amount of malloc storage that must be
194 * reclaimed by a GC triggered by must_malloc. If less than this is
195 * reclaimed, the trigger threshold is raised. [I don't know what a
196 * good value is. I arbitrarily chose 1/10 of the INIT_MALLOC_LIMIT to
197 * work around a oscillation that caused almost constant GC.]
201 * Heap size 45000 and 40% min yield gives quick startup and no extra
202 * heap allocation. Having higher values on min yield may lead to
203 * large heaps, especially if code behaviour is varying its
204 * maximum consumption between different freelists.
207 #define SCM_DATA_CELLS2CARDS(n) (((n) + SCM_GC_CARD_N_DATA_CELLS - 1) / SCM_GC_CARD_N_DATA_CELLS)
208 #define SCM_CARDS_PER_CLUSTER SCM_DATA_CELLS2CARDS (2000L)
209 #define SCM_CLUSTER_SIZE_1 (SCM_CARDS_PER_CLUSTER * SCM_GC_CARD_N_DATA_CELLS)
210 int scm_default_init_heap_size_1
= (((SCM_DATA_CELLS2CARDS (45000L) + SCM_CARDS_PER_CLUSTER
- 1)
211 / SCM_CARDS_PER_CLUSTER
) * SCM_GC_CARD_SIZE
);
212 int scm_default_min_yield_1
= 40;
214 #define SCM_CLUSTER_SIZE_2 (SCM_CARDS_PER_CLUSTER * (SCM_GC_CARD_N_DATA_CELLS / 2))
215 int scm_default_init_heap_size_2
= (((SCM_DATA_CELLS2CARDS (2500L * 2) + SCM_CARDS_PER_CLUSTER
- 1)
216 / SCM_CARDS_PER_CLUSTER
) * SCM_GC_CARD_SIZE
);
217 /* The following value may seem large, but note that if we get to GC at
218 * all, this means that we have a numerically intensive application
220 int scm_default_min_yield_2
= 40;
222 int scm_default_max_segment_size
= 2097000L;/* a little less (adm) than 2 Mb */
224 #define SCM_MIN_HEAP_SEG_SIZE (8 * SCM_GC_CARD_SIZE)
226 # define SCM_HEAP_SEG_SIZE 32768L
229 # define SCM_HEAP_SEG_SIZE (7000L * sizeof (scm_cell))
231 # define SCM_HEAP_SEG_SIZE (16384L * sizeof (scm_cell))
234 /* Make heap grow with factor 1.5 */
235 #define SCM_EXPHEAP(scm_heap_size) (scm_heap_size / 2)
236 #define SCM_INIT_MALLOC_LIMIT 100000
237 #define SCM_MTRIGGER_HYSTERESIS (SCM_INIT_MALLOC_LIMIT/10)
239 /* CELL_UP and CELL_DN are used by scm_init_heap_seg to find (scm_cell * span)
240 aligned inner bounds for allocated storage */
243 /*in 386 protected mode we must only adjust the offset */
244 # define CELL_UP(p, span) MK_FP(FP_SEG(p), ~(8*(span)-1)&(FP_OFF(p)+8*(span)-1))
245 # define CELL_DN(p, span) MK_FP(FP_SEG(p), ~(8*(span)-1)&FP_OFF(p))
248 # define CELL_UP(p, span) (SCM_CELLPTR)(~(span) & ((long)(p)+(span)))
249 # define CELL_DN(p, span) (SCM_CELLPTR)(~(span) & (long)(p))
251 # define CELL_UP(p, span) (SCM_CELLPTR)(~(sizeof(scm_cell)*(span)-1L) & ((long)(p)+sizeof(scm_cell)*(span)-1L))
252 # define CELL_DN(p, span) (SCM_CELLPTR)(~(sizeof(scm_cell)*(span)-1L) & (long)(p))
256 #define DOUBLECELL_ALIGNED_P(x) (((2 * sizeof (scm_cell) - 1) & SCM_UNPACK (x)) == 0)
258 #define ALIGNMENT_SLACK(freelist) (SCM_GC_CARD_SIZE - 1)
259 #define CLUSTER_SIZE_IN_BYTES(freelist) \
260 (((freelist)->cluster_size / (SCM_GC_CARD_N_DATA_CELLS / (freelist)->span)) * SCM_GC_CARD_SIZE)
266 typedef struct scm_freelist_t
{
267 /* collected cells */
269 /* number of cells left to collect before cluster is full */
270 unsigned int left_to_collect
;
271 /* number of clusters which have been allocated */
272 unsigned int clusters_allocated
;
273 /* a list of freelists, each of size cluster_size,
274 * except the last one which may be shorter
278 /* this is the number of objects in each cluster, including the spine cell */
280 /* indicates that we should grow heap instead of GC:ing
283 /* minimum yield on this list in order not to grow the heap
286 /* defines min_yield as percent of total heap size
288 int min_yield_fraction
;
289 /* number of cells per object on this list */
291 /* number of collected cells during last GC */
293 /* number of collected cells during penultimate GC */
295 /* total number of cells in heap segments
296 * belonging to this list.
301 SCM scm_freelist
= SCM_EOL
;
302 scm_freelist_t scm_master_freelist
= {
303 SCM_EOL
, 0, 0, SCM_EOL
, 0, SCM_CLUSTER_SIZE_1
, 0, 0, 0, 1, 0, 0
305 SCM scm_freelist2
= SCM_EOL
;
306 scm_freelist_t scm_master_freelist2
= {
307 SCM_EOL
, 0, 0, SCM_EOL
, 0, SCM_CLUSTER_SIZE_2
, 0, 0, 0, 2, 0, 0
311 * is the number of bytes of must_malloc allocation needed to trigger gc.
313 unsigned long scm_mtrigger
;
316 * If set, don't expand the heap. Set only during gc, during which no allocation
317 * is supposed to take place anyway.
319 int scm_gc_heap_lock
= 0;
322 * Don't pause for collection if this is set -- just
325 int scm_block_gc
= 1;
327 /* During collection, this accumulates objects holding
330 SCM scm_weak_vectors
;
332 /* During collection, this accumulates structures which are to be freed.
334 SCM scm_structs_to_free
;
336 /* GC Statistics Keeping
338 unsigned long scm_cells_allocated
= 0;
339 long scm_mallocated
= 0;
340 unsigned long scm_gc_cells_collected
;
341 unsigned long scm_gc_yield
;
342 static unsigned long scm_gc_yield_1
= 0; /* previous GC yield */
343 unsigned long scm_gc_malloc_collected
;
344 unsigned long scm_gc_ports_collected
;
345 unsigned long scm_gc_time_taken
= 0;
346 static unsigned long t_before_gc
;
347 static unsigned long t_before_sweep
;
348 unsigned long scm_gc_mark_time_taken
= 0;
349 unsigned long scm_gc_sweep_time_taken
= 0;
350 unsigned long scm_gc_times
= 0;
351 unsigned long scm_gc_cells_swept
= 0;
352 double scm_gc_cells_marked_acc
= 0.;
353 double scm_gc_cells_swept_acc
= 0.;
355 SCM_SYMBOL (sym_cells_allocated
, "cells-allocated");
356 SCM_SYMBOL (sym_heap_size
, "cell-heap-size");
357 SCM_SYMBOL (sym_mallocated
, "bytes-malloced");
358 SCM_SYMBOL (sym_mtrigger
, "gc-malloc-threshold");
359 SCM_SYMBOL (sym_heap_segments
, "cell-heap-segments");
360 SCM_SYMBOL (sym_gc_time_taken
, "gc-time-taken");
361 SCM_SYMBOL (sym_gc_mark_time_taken
, "gc-mark-time-taken");
362 SCM_SYMBOL (sym_gc_sweep_time_taken
, "gc-sweep-time-taken");
363 SCM_SYMBOL (sym_times
, "gc-times");
364 SCM_SYMBOL (sym_cells_marked
, "cells-marked");
365 SCM_SYMBOL (sym_cells_swept
, "cells-swept");
367 typedef struct scm_heap_seg_data_t
369 /* lower and upper bounds of the segment */
370 SCM_CELLPTR bounds
[2];
372 /* address of the head-of-freelist pointer for this segment's cells.
373 All segments usually point to the same one, scm_freelist. */
374 scm_freelist_t
*freelist
;
376 /* number of cells per object in this segment */
378 } scm_heap_seg_data_t
;
382 static scm_sizet
init_heap_seg (SCM_CELLPTR
, scm_sizet
, scm_freelist_t
*);
384 typedef enum { return_on_error
, abort_on_error
} policy_on_error
;
385 static void alloc_some_heap (scm_freelist_t
*, policy_on_error
);
388 #define SCM_HEAP_SIZE \
389 (scm_master_freelist.heap_size + scm_master_freelist2.heap_size)
390 #define SCM_MAX(A, B) ((A) > (B) ? (A) : (B))
392 #define BVEC_GROW_SIZE 256
393 #define BVEC_GROW_SIZE_IN_LIMBS (SCM_GC_CARD_BVEC_SIZE_IN_LIMBS * BVEC_GROW_SIZE)
394 #define BVEC_GROW_SIZE_IN_BYTES (BVEC_GROW_SIZE_IN_LIMBS * sizeof (scm_c_bvec_limb_t))
396 /* mark space allocation */
398 typedef struct scm_mark_space_t
400 scm_c_bvec_limb_t
*bvec_space
;
401 struct scm_mark_space_t
*next
;
404 static scm_mark_space_t
*current_mark_space
;
405 static scm_mark_space_t
**mark_space_ptr
;
406 static int current_mark_space_offset
;
407 static scm_mark_space_t
*mark_space_head
;
409 static scm_c_bvec_limb_t
*
412 scm_c_bvec_limb_t
*res
;
414 if (!current_mark_space
)
416 SCM_SYSCALL (current_mark_space
= (scm_mark_space_t
*) malloc (sizeof (scm_mark_space_t
)));
417 if (!current_mark_space
)
418 scm_wta (SCM_UNDEFINED
, "could not grow", "heap");
420 current_mark_space
->bvec_space
= NULL
;
421 current_mark_space
->next
= NULL
;
423 *mark_space_ptr
= current_mark_space
;
424 mark_space_ptr
= &(current_mark_space
->next
);
429 if (!(current_mark_space
->bvec_space
))
431 SCM_SYSCALL (current_mark_space
->bvec_space
=
432 (scm_c_bvec_limb_t
*) calloc (BVEC_GROW_SIZE_IN_BYTES
, 1));
433 if (!(current_mark_space
->bvec_space
))
434 scm_wta (SCM_UNDEFINED
, "could not grow", "heap");
436 current_mark_space_offset
= 0;
441 if (current_mark_space_offset
== BVEC_GROW_SIZE_IN_LIMBS
)
443 current_mark_space
= NULL
;
448 res
= current_mark_space
->bvec_space
+ current_mark_space_offset
;
449 current_mark_space_offset
+= SCM_GC_CARD_BVEC_SIZE_IN_LIMBS
;
457 scm_mark_space_t
*ms
;
459 for (ms
= mark_space_head
; ms
; ms
= ms
->next
)
460 memset (ms
->bvec_space
, 0, BVEC_GROW_SIZE_IN_BYTES
);
465 /* Debugging functions. */
467 #if defined (GUILE_DEBUG) || defined (GUILE_DEBUG_FREELIST)
469 /* Return the number of the heap segment containing CELL. */
475 for (i
= 0; i
< scm_n_heap_segs
; i
++)
476 if (SCM_PTR_LE (scm_heap_table
[i
].bounds
[0], SCM2PTR (cell
))
477 && SCM_PTR_GT (scm_heap_table
[i
].bounds
[1], SCM2PTR (cell
)))
479 fprintf (stderr
, "which_seg: can't find segment containing cell %lx\n",
486 map_free_list (scm_freelist_t
*master
, SCM freelist
)
488 int last_seg
= -1, count
= 0;
491 for (f
= freelist
; !SCM_NULLP (f
); f
= SCM_FREE_CELL_CDR (f
))
493 int this_seg
= which_seg (f
);
495 if (this_seg
!= last_seg
)
498 fprintf (stderr
, " %5d %d-cells in segment %d\n",
499 count
, master
->span
, last_seg
);
506 fprintf (stderr
, " %5d %d-cells in segment %d\n",
507 count
, master
->span
, last_seg
);
510 SCM_DEFINE (scm_map_free_list
, "map-free-list", 0, 0, 0,
512 "Print debugging information about the free-list.\n"
513 "`map-free-list' is only included in --enable-guile-debug builds of Guile.")
514 #define FUNC_NAME s_scm_map_free_list
517 fprintf (stderr
, "%d segments total (%d:%d",
519 scm_heap_table
[0].span
,
520 scm_heap_table
[0].bounds
[1] - scm_heap_table
[0].bounds
[0]);
521 for (i
= 1; i
< scm_n_heap_segs
; i
++)
522 fprintf (stderr
, ", %d:%d",
523 scm_heap_table
[i
].span
,
524 scm_heap_table
[i
].bounds
[1] - scm_heap_table
[i
].bounds
[0]);
525 fprintf (stderr
, ")\n");
526 map_free_list (&scm_master_freelist
, scm_freelist
);
527 map_free_list (&scm_master_freelist2
, scm_freelist2
);
530 return SCM_UNSPECIFIED
;
534 static int last_cluster
;
535 static int last_size
;
538 free_list_length (char *title
, int i
, SCM freelist
)
542 for (ls
= freelist
; !SCM_NULLP (ls
); ls
= SCM_FREE_CELL_CDR (ls
))
543 if (SCM_FREE_CELL_P (ls
))
547 fprintf (stderr
, "bad cell in %s at position %d\n", title
, n
);
554 if (last_cluster
== i
- 1)
555 fprintf (stderr
, "\t%d\n", last_size
);
557 fprintf (stderr
, "-%d\t%d\n", i
- 1, last_size
);
560 fprintf (stderr
, "%s %d", title
, i
);
562 fprintf (stderr
, "%s\t%d\n", title
, n
);
570 free_list_lengths (char *title
, scm_freelist_t
*master
, SCM freelist
)
573 int i
= 0, len
, n
= 0;
574 fprintf (stderr
, "%s\n\n", title
);
575 n
+= free_list_length ("free list", -1, freelist
);
576 for (clusters
= master
->clusters
;
577 SCM_NNULLP (clusters
);
578 clusters
= SCM_CDR (clusters
))
580 len
= free_list_length ("cluster", i
++, SCM_CAR (clusters
));
583 if (last_cluster
== i
- 1)
584 fprintf (stderr
, "\t%d\n", last_size
);
586 fprintf (stderr
, "-%d\t%d\n", i
- 1, last_size
);
587 fprintf (stderr
, "\ntotal %d objects\n\n", n
);
590 SCM_DEFINE (scm_free_list_length
, "free-list-length", 0, 0, 0,
592 "Print debugging information about the free-list.\n"
593 "`free-list-length' is only included in --enable-guile-debug builds of Guile.")
594 #define FUNC_NAME s_scm_free_list_length
596 free_list_lengths ("1-cells", &scm_master_freelist
, scm_freelist
);
597 free_list_lengths ("2-cells", &scm_master_freelist2
, scm_freelist2
);
598 return SCM_UNSPECIFIED
;
604 #ifdef GUILE_DEBUG_FREELIST
606 /* Number of calls to SCM_NEWCELL since startup. */
607 static unsigned long scm_newcell_count
;
608 static unsigned long scm_newcell2_count
;
610 /* Search freelist for anything that isn't marked as a free cell.
611 Abort if we find something. */
613 scm_check_freelist (SCM freelist
)
618 for (f
= freelist
; !SCM_NULLP (f
); f
= SCM_FREE_CELL_CDR (f
), i
++)
619 if (!SCM_FREE_CELL_P (f
))
621 fprintf (stderr
, "Bad cell in freelist on newcell %lu: %d'th elt\n",
622 scm_newcell_count
, i
);
627 SCM_DEFINE (scm_gc_set_debug_check_freelist_x
, "gc-set-debug-check-freelist!", 1, 0, 0,
629 "If FLAG is #t, check the freelist for consistency on each cell allocation.\n"
630 "This procedure only exists because the GUILE_DEBUG_FREELIST \n"
631 "compile-time flag was selected.\n")
632 #define FUNC_NAME s_scm_gc_set_debug_check_freelist_x
634 /* [cmm] I did a double-take when I read this code the first time.
636 SCM_VALIDATE_BOOL_COPY (1, flag
, scm_debug_check_freelist
);
637 return SCM_UNSPECIFIED
;
643 scm_debug_newcell (void)
648 if (scm_debug_check_freelist
)
650 scm_check_freelist (scm_freelist
);
654 /* The rest of this is supposed to be identical to the SCM_NEWCELL
656 if (SCM_NULLP (scm_freelist
))
657 new = scm_gc_for_newcell (&scm_master_freelist
, &scm_freelist
);
661 scm_freelist
= SCM_FREE_CELL_CDR (scm_freelist
);
668 scm_debug_newcell2 (void)
672 scm_newcell2_count
++;
673 if (scm_debug_check_freelist
)
675 scm_check_freelist (scm_freelist2
);
679 /* The rest of this is supposed to be identical to the SCM_NEWCELL
681 if (SCM_NULLP (scm_freelist2
))
682 new = scm_gc_for_newcell (&scm_master_freelist2
, &scm_freelist2
);
686 scm_freelist2
= SCM_FREE_CELL_CDR (scm_freelist2
);
692 #endif /* GUILE_DEBUG_FREELIST */
697 master_cells_allocated (scm_freelist_t
*master
)
699 /* the '- 1' below is to ignore the cluster spine cells. */
700 int objects
= master
->clusters_allocated
* (master
->cluster_size
- 1);
701 if (SCM_NULLP (master
->clusters
))
702 objects
-= master
->left_to_collect
;
703 return master
->span
* objects
;
707 freelist_length (SCM freelist
)
710 for (n
= 0; !SCM_NULLP (freelist
); freelist
= SCM_FREE_CELL_CDR (freelist
))
716 compute_cells_allocated ()
718 return (scm_cells_allocated
719 + master_cells_allocated (&scm_master_freelist
)
720 + master_cells_allocated (&scm_master_freelist2
)
721 - scm_master_freelist
.span
* freelist_length (scm_freelist
)
722 - scm_master_freelist2
.span
* freelist_length (scm_freelist2
));
725 /* {Scheme Interface to GC}
728 SCM_DEFINE (scm_gc_stats
, "gc-stats", 0, 0, 0,
730 "Returns an association list of statistics about Guile's current use of storage. ")
731 #define FUNC_NAME s_scm_gc_stats
736 long int local_scm_mtrigger
;
737 long int local_scm_mallocated
;
738 long int local_scm_heap_size
;
739 long int local_scm_cells_allocated
;
740 long int local_scm_gc_time_taken
;
741 long int local_scm_gc_times
;
742 long int local_scm_gc_mark_time_taken
;
743 long int local_scm_gc_sweep_time_taken
;
744 double local_scm_gc_cells_swept
;
745 double local_scm_gc_cells_marked
;
755 for (i
= scm_n_heap_segs
; i
--; )
756 heap_segs
= scm_cons (scm_cons (scm_ulong2num ((unsigned long)scm_heap_table
[i
].bounds
[1]),
757 scm_ulong2num ((unsigned long)scm_heap_table
[i
].bounds
[0])),
759 if (scm_n_heap_segs
!= n
)
764 /* Below, we cons to produce the resulting list. We want a snapshot of
765 * the heap situation before consing.
767 local_scm_mtrigger
= scm_mtrigger
;
768 local_scm_mallocated
= scm_mallocated
;
769 local_scm_heap_size
= SCM_HEAP_SIZE
;
770 local_scm_cells_allocated
= compute_cells_allocated ();
771 local_scm_gc_time_taken
= scm_gc_time_taken
;
772 local_scm_gc_mark_time_taken
= scm_gc_mark_time_taken
;
773 local_scm_gc_sweep_time_taken
= scm_gc_sweep_time_taken
;
774 local_scm_gc_times
= scm_gc_times
;
775 local_scm_gc_cells_swept
= scm_gc_cells_swept_acc
;
776 local_scm_gc_cells_marked
= scm_gc_cells_marked_acc
;
778 answer
= scm_listify (scm_cons (sym_gc_time_taken
, scm_ulong2num (local_scm_gc_time_taken
)),
779 scm_cons (sym_cells_allocated
, scm_ulong2num (local_scm_cells_allocated
)),
780 scm_cons (sym_heap_size
, scm_ulong2num (local_scm_heap_size
)),
781 scm_cons (sym_mallocated
, scm_ulong2num (local_scm_mallocated
)),
782 scm_cons (sym_mtrigger
, scm_ulong2num (local_scm_mtrigger
)),
783 scm_cons (sym_times
, scm_ulong2num (local_scm_gc_times
)),
784 scm_cons (sym_gc_mark_time_taken
, scm_ulong2num (local_scm_gc_mark_time_taken
)),
785 scm_cons (sym_gc_sweep_time_taken
, scm_ulong2num (local_scm_gc_sweep_time_taken
)),
786 scm_cons (sym_cells_marked
, scm_dbl2big (local_scm_gc_cells_marked
)),
787 scm_cons (sym_cells_swept
, scm_dbl2big (local_scm_gc_cells_swept
)),
788 scm_cons (sym_heap_segments
, heap_segs
),
797 gc_start_stats (const char *what
)
799 t_before_gc
= scm_c_get_internal_run_time ();
800 scm_gc_cells_swept
= 0;
801 scm_gc_cells_collected
= 0;
802 scm_gc_yield_1
= scm_gc_yield
;
803 scm_gc_yield
= (scm_cells_allocated
804 + master_cells_allocated (&scm_master_freelist
)
805 + master_cells_allocated (&scm_master_freelist2
));
806 scm_gc_malloc_collected
= 0;
807 scm_gc_ports_collected
= 0;
814 unsigned long t
= scm_c_get_internal_run_time ();
815 scm_gc_time_taken
+= (t
- t_before_gc
);
816 scm_gc_sweep_time_taken
+= (t
- t_before_sweep
);
819 scm_gc_cells_marked_acc
+= scm_gc_cells_swept
- scm_gc_cells_collected
;
820 scm_gc_cells_swept_acc
+= scm_gc_cells_swept
;
824 SCM_DEFINE (scm_object_address
, "object-address", 1, 0, 0,
826 "Return an integer that for the lifetime of @var{obj} is uniquely\n"
827 "returned by this function for @var{obj}")
828 #define FUNC_NAME s_scm_object_address
830 return scm_ulong2num ((unsigned long) SCM_UNPACK (obj
));
835 SCM_DEFINE (scm_gc
, "gc", 0, 0, 0,
837 "Scans all of SCM objects and reclaims for further use those that are\n"
838 "no longer accessible.")
839 #define FUNC_NAME s_scm_gc
844 return SCM_UNSPECIFIED
;
850 /* {C Interface For When GC is Triggered}
854 adjust_min_yield (scm_freelist_t
*freelist
)
856 /* min yield is adjusted upwards so that next predicted total yield
857 * (allocated cells actually freed by GC) becomes
858 * `min_yield_fraction' of total heap size. Note, however, that
859 * the absolute value of min_yield will correspond to `collected'
860 * on one master (the one which currently is triggering GC).
862 * The reason why we look at total yield instead of cells collected
863 * on one list is that we want to take other freelists into account.
864 * On this freelist, we know that (local) yield = collected cells,
865 * but that's probably not the case on the other lists.
867 * (We might consider computing a better prediction, for example
868 * by computing an average over multiple GC:s.)
870 if (freelist
->min_yield_fraction
)
872 /* Pick largest of last two yields. */
873 int delta
= ((SCM_HEAP_SIZE
* freelist
->min_yield_fraction
/ 100)
874 - (long) SCM_MAX (scm_gc_yield_1
, scm_gc_yield
));
876 fprintf (stderr
, " after GC = %d, delta = %d\n",
881 freelist
->min_yield
+= delta
;
886 /* When we get POSIX threads support, the master will be global and
887 * common while the freelist will be individual for each thread.
891 scm_gc_for_newcell (scm_freelist_t
*master
, SCM
*freelist
)
897 if (SCM_NULLP (master
->clusters
))
899 if (master
->grow_heap_p
|| scm_block_gc
)
901 /* In order to reduce gc frequency, try to allocate a new heap
902 * segment first, even if gc might find some free cells. If we
903 * can't obtain a new heap segment, we will try gc later.
905 master
->grow_heap_p
= 0;
906 alloc_some_heap (master
, return_on_error
);
908 if (SCM_NULLP (master
->clusters
))
910 /* The heap was not grown, either because it wasn't scheduled to
911 * grow, or because there was not enough memory available. In
912 * both cases we have to try gc to get some free cells.
915 fprintf (stderr
, "allocated = %d, ",
917 + master_cells_allocated (&scm_master_freelist
)
918 + master_cells_allocated (&scm_master_freelist2
));
921 adjust_min_yield (master
);
922 if (SCM_NULLP (master
->clusters
))
924 /* gc could not free any cells. Now, we _must_ allocate a
925 * new heap segment, because there is no other possibility
926 * to provide a new cell for the caller.
928 alloc_some_heap (master
, abort_on_error
);
932 cell
= SCM_CAR (master
->clusters
);
933 master
->clusters
= SCM_CDR (master
->clusters
);
934 ++master
->clusters_allocated
;
936 while (SCM_NULLP (cell
));
938 #ifdef GUILE_DEBUG_FREELIST
939 scm_check_freelist (cell
);
943 *freelist
= SCM_FREE_CELL_CDR (cell
);
949 /* This is a support routine which can be used to reserve a cluster
950 * for some special use, such as debugging. It won't be useful until
951 * free cells are preserved between garbage collections.
955 scm_alloc_cluster (scm_freelist_t
*master
)
958 cell
= scm_gc_for_newcell (master
, &freelist
);
959 SCM_SETCDR (cell
, freelist
);
965 scm_c_hook_t scm_before_gc_c_hook
;
966 scm_c_hook_t scm_before_mark_c_hook
;
967 scm_c_hook_t scm_before_sweep_c_hook
;
968 scm_c_hook_t scm_after_sweep_c_hook
;
969 scm_c_hook_t scm_after_gc_c_hook
;
973 scm_igc (const char *what
)
978 scm_c_hook_run (&scm_before_gc_c_hook
, 0);
981 SCM_NULLP (scm_freelist
)
983 : (SCM_NULLP (scm_freelist2
) ? "o" : "m"));
986 /* During the critical section, only the current thread may run. */
987 SCM_THREAD_CRITICAL_SECTION_START
;
990 /* fprintf (stderr, "gc: %s\n", what); */
992 if (!scm_stack_base
|| scm_block_gc
)
998 gc_start_stats (what
);
1000 if (scm_mallocated
< 0)
1001 /* The byte count of allocated objects has underflowed. This is
1002 probably because you forgot to report the sizes of objects you
1003 have allocated, by calling scm_done_malloc or some such. When
1004 the GC freed them, it subtracted their size from
1005 scm_mallocated, which underflowed. */
1008 if (scm_gc_heap_lock
)
1009 /* We've invoked the collector while a GC is already in progress.
1010 That should never happen. */
1015 /* flush dead entries from the continuation stack */
1020 elts
= SCM_VELTS (scm_continuation_stack
);
1021 bound
= SCM_VECTOR_LENGTH (scm_continuation_stack
);
1022 x
= SCM_INUM (scm_continuation_stack_ptr
);
1025 elts
[x
] = SCM_BOOL_F
;
1030 scm_c_hook_run (&scm_before_mark_c_hook
, 0);
1032 clear_mark_space ();
1036 /* Mark objects on the C stack. */
1037 SCM_FLUSH_REGISTER_WINDOWS
;
1038 /* This assumes that all registers are saved into the jmp_buf */
1039 setjmp (scm_save_regs_gc_mark
);
1040 scm_mark_locations ((SCM_STACKITEM
*) scm_save_regs_gc_mark
,
1041 ( (scm_sizet
) (sizeof (SCM_STACKITEM
) - 1 +
1042 sizeof scm_save_regs_gc_mark
)
1043 / sizeof (SCM_STACKITEM
)));
1046 scm_sizet stack_len
= scm_stack_size (scm_stack_base
);
1047 #ifdef SCM_STACK_GROWS_UP
1048 scm_mark_locations (scm_stack_base
, stack_len
);
1050 scm_mark_locations (scm_stack_base
- stack_len
, stack_len
);
1054 #else /* USE_THREADS */
1056 /* Mark every thread's stack and registers */
1057 scm_threads_mark_stacks ();
1059 #endif /* USE_THREADS */
1061 j
= SCM_NUM_PROTECTS
;
1063 scm_gc_mark (scm_sys_protects
[j
]);
1065 /* FIXME: we should have a means to register C functions to be run
1066 * in different phases of GC
1068 scm_mark_subr_table ();
1071 scm_gc_mark (scm_root
->handle
);
1074 t_before_sweep
= scm_c_get_internal_run_time ();
1075 scm_gc_mark_time_taken
+= (t_before_sweep
- t_before_gc
);
1077 scm_c_hook_run (&scm_before_sweep_c_hook
, 0);
1081 scm_c_hook_run (&scm_after_sweep_c_hook
, 0);
1087 SCM_THREAD_CRITICAL_SECTION_END
;
1089 scm_c_hook_run (&scm_after_gc_c_hook
, 0);
1098 #define MARK scm_gc_mark
1099 #define FNAME "scm_gc_mark"
1101 #endif /*!MARK_DEPENDENCIES*/
1103 /* Mark an object precisely.
1107 #define FUNC_NAME FNAME
1112 #ifndef MARK_DEPENDENCIES
1113 # define RECURSE scm_gc_mark
1115 /* go through the usual marking, but not for self-cycles. */
1116 # define RECURSE(x) do { if ((x) != p) scm_gc_mark (x); } while (0)
1120 #ifdef MARK_DEPENDENCIES
1121 goto gc_mark_loop_first_time
;
1130 #ifdef MARK_DEPENDENCIES
1131 if (SCM_EQ_P (ptr
, p
))
1137 gc_mark_loop_first_time
:
1140 if (!SCM_CELLP (ptr
))
1141 SCM_MISC_ERROR ("rogue pointer in heap", SCM_EOL
);
1143 #if (defined (GUILE_DEBUG_FREELIST))
1145 if (SCM_GC_IN_CARD_HEADERP (SCM2PTR (ptr
)))
1146 scm_wta (ptr
, "rogue pointer in heap", NULL
);
1150 #ifndef MARK_DEPENDENCIES
1152 if (SCM_GCMARKP (ptr
))
1155 SCM_SETGCMARK (ptr
);
1159 switch (SCM_TYP7 (ptr
))
1161 case scm_tcs_cons_nimcar
:
1162 if (SCM_IMP (SCM_CDR (ptr
)))
1164 ptr
= SCM_CAR (ptr
);
1167 RECURSE (SCM_CAR (ptr
));
1168 ptr
= SCM_CDR (ptr
);
1170 case scm_tcs_cons_imcar
:
1171 ptr
= SCM_CDR (ptr
);
1174 RECURSE (SCM_CELL_OBJECT_2 (ptr
));
1175 ptr
= SCM_CDR (ptr
);
1177 case scm_tcs_cons_gloc
:
1179 /* Dirk:FIXME:: The following code is super ugly: ptr may be a struct
1180 * or a gloc. If it is a gloc, the cell word #0 of ptr is a pointer
1181 * to a heap cell. If it is a struct, the cell word #0 of ptr is a
1182 * pointer to a struct vtable data region. The fact that these are
1183 * accessed in the same way restricts the possibilites to change the
1184 * data layout of structs or heap cells.
1186 scm_bits_t word0
= SCM_CELL_WORD_0 (ptr
) - scm_tc3_cons_gloc
;
1187 scm_bits_t
* vtable_data
= (scm_bits_t
*) word0
; /* access as struct */
1188 if (vtable_data
[scm_vtable_index_vcell
] != 0)
1191 SCM gloc_car
= SCM_PACK (word0
);
1193 ptr
= SCM_CDR (ptr
);
1198 /* ptr is a struct */
1199 SCM layout
= SCM_PACK (vtable_data
[scm_vtable_index_layout
]);
1200 int len
= SCM_SYMBOL_LENGTH (layout
);
1201 char * fields_desc
= SCM_SYMBOL_CHARS (layout
);
1202 scm_bits_t
* struct_data
= (scm_bits_t
*) SCM_STRUCT_DATA (ptr
);
1204 if (vtable_data
[scm_struct_i_flags
] & SCM_STRUCTF_ENTITY
)
1206 RECURSE (SCM_PACK (struct_data
[scm_struct_i_procedure
]));
1207 RECURSE (SCM_PACK (struct_data
[scm_struct_i_setter
]));
1213 for (x
= 0; x
< len
- 2; x
+= 2, ++struct_data
)
1214 if (fields_desc
[x
] == 'p')
1215 RECURSE (SCM_PACK (*struct_data
));
1216 if (fields_desc
[x
] == 'p')
1218 if (SCM_LAYOUT_TAILP (fields_desc
[x
+ 1]))
1219 for (x
= *struct_data
++; x
; --x
, ++struct_data
)
1220 RECURSE (SCM_PACK (*struct_data
));
1222 RECURSE (SCM_PACK (*struct_data
));
1226 ptr
= SCM_PACK (vtable_data
[scm_vtable_index_vtable
]);
1231 case scm_tcs_closures
:
1232 if (SCM_IMP (SCM_CDR (ptr
)))
1234 ptr
= SCM_CLOSCAR (ptr
);
1237 RECURSE (SCM_CLOSCAR (ptr
));
1238 ptr
= SCM_CDR (ptr
);
1240 case scm_tc7_vector
:
1241 i
= SCM_VECTOR_LENGTH (ptr
);
1245 if (SCM_NIMP (SCM_VELTS (ptr
)[i
]))
1246 RECURSE (SCM_VELTS (ptr
)[i
]);
1247 ptr
= SCM_VELTS (ptr
)[0];
1252 unsigned long int i
= SCM_CCLO_LENGTH (ptr
);
1253 unsigned long int j
;
1254 for (j
= 1; j
!= i
; ++j
)
1256 SCM obj
= SCM_CCLO_REF (ptr
, j
);
1260 ptr
= SCM_CCLO_REF (ptr
, 0);
1266 case scm_tc7_byvect
:
1273 #ifdef HAVE_LONG_LONGS
1274 case scm_tc7_llvect
:
1277 case scm_tc7_string
:
1280 case scm_tc7_substring
:
1281 ptr
= SCM_CDR (ptr
);
1285 SCM_WVECT_GC_CHAIN (ptr
) = scm_weak_vectors
;
1286 scm_weak_vectors
= ptr
;
1287 if (SCM_IS_WHVEC_ANY (ptr
))
1294 len
= SCM_VECTOR_LENGTH (ptr
);
1295 weak_keys
= SCM_IS_WHVEC (ptr
) || SCM_IS_WHVEC_B (ptr
);
1296 weak_values
= SCM_IS_WHVEC_V (ptr
) || SCM_IS_WHVEC_B (ptr
);
1298 for (x
= 0; x
< len
; ++x
)
1301 alist
= SCM_VELTS (ptr
)[x
];
1303 /* mark everything on the alist except the keys or
1304 * values, according to weak_values and weak_keys. */
1305 while ( SCM_CONSP (alist
)
1306 && !SCM_GCMARKP (alist
)
1307 && SCM_CONSP (SCM_CAR (alist
)))
1312 kvpair
= SCM_CAR (alist
);
1313 next_alist
= SCM_CDR (alist
);
1316 * SCM_SETGCMARK (alist);
1317 * SCM_SETGCMARK (kvpair);
1319 * It may be that either the key or value is protected by
1320 * an escaped reference to part of the spine of this alist.
1321 * If we mark the spine here, and only mark one or neither of the
1322 * key and value, they may never be properly marked.
1323 * This leads to a horrible situation in which an alist containing
1324 * freelist cells is exported.
1326 * So only mark the spines of these arrays last of all marking.
1327 * If somebody confuses us by constructing a weak vector
1328 * with a circular alist then we are hosed, but at least we
1329 * won't prematurely drop table entries.
1332 RECURSE (SCM_CAR (kvpair
));
1334 RECURSE (SCM_CDR (kvpair
));
1337 if (SCM_NIMP (alist
))
1343 case scm_tc7_symbol
:
1344 ptr
= SCM_PROP_SLOTS (ptr
);
1349 i
= SCM_PTOBNUM (ptr
);
1350 if (!(i
< scm_numptob
))
1352 if (SCM_PTAB_ENTRY(ptr
))
1353 RECURSE (SCM_FILENAME (ptr
));
1354 if (scm_ptobs
[i
].mark
)
1356 ptr
= (scm_ptobs
[i
].mark
) (ptr
);
1363 switch (SCM_TYP16 (ptr
))
1364 { /* should be faster than going through scm_smobs */
1365 case scm_tc_free_cell
:
1366 /* printf("found free_cell %X ", ptr); fflush(stdout); */
1369 case scm_tc16_complex
:
1372 i
= SCM_SMOBNUM (ptr
);
1373 if (!(i
< scm_numsmob
))
1375 if (scm_smobs
[i
].mark
)
1377 ptr
= (scm_smobs
[i
].mark
) (ptr
);
1386 SCM_MISC_ERROR ("unknown type", SCM_EOL
);
1392 #ifndef MARK_DEPENDENCIES
1397 /* And here we define `scm_gc_mark_dependencies', by including this
1398 * same file in itself.
1400 #define MARK scm_gc_mark_dependencies
1401 #define FNAME "scm_gc_mark_dependencies"
1402 #define MARK_DEPENDENCIES
1404 #undef MARK_DEPENDENCIES
1409 /* Mark a Region Conservatively
1413 scm_mark_locations (SCM_STACKITEM x
[], scm_sizet n
)
1417 for (m
= 0; m
< n
; ++m
)
1419 SCM obj
= * (SCM
*) &x
[m
];
1420 if (SCM_CELLP (obj
))
1422 SCM_CELLPTR ptr
= SCM2PTR (obj
);
1424 int j
= scm_n_heap_segs
- 1;
1425 if (SCM_PTR_LE (scm_heap_table
[i
].bounds
[0], ptr
)
1426 && SCM_PTR_GT (scm_heap_table
[j
].bounds
[1], ptr
))
1433 || SCM_PTR_GT (scm_heap_table
[i
].bounds
[1], ptr
))
1435 else if (SCM_PTR_LE (scm_heap_table
[j
].bounds
[0], ptr
))
1443 if (SCM_PTR_GT (scm_heap_table
[k
].bounds
[1], ptr
))
1447 if (SCM_PTR_LE (scm_heap_table
[i
].bounds
[0], ptr
))
1452 else if (SCM_PTR_LE (scm_heap_table
[k
].bounds
[0], ptr
))
1456 if (SCM_PTR_GT (scm_heap_table
[j
].bounds
[1], ptr
))
1463 if (SCM_GC_IN_CARD_HEADERP (ptr
))
1466 if (scm_heap_table
[seg_id
].span
== 1
1467 || DOUBLECELL_ALIGNED_P (obj
))
1478 /* The function scm_cellp determines whether an SCM value can be regarded as a
1479 * pointer to a cell on the heap. Binary search is used in order to determine
1480 * the heap segment that contains the cell.
1483 scm_cellp (SCM value
)
1485 if (SCM_CELLP (value
)) {
1486 scm_cell
* ptr
= SCM2PTR (value
);
1488 unsigned int j
= scm_n_heap_segs
- 1;
1491 int k
= (i
+ j
) / 2;
1492 if (SCM_PTR_GT (scm_heap_table
[k
].bounds
[1], ptr
)) {
1494 } else if (SCM_PTR_LE (scm_heap_table
[k
].bounds
[0], ptr
)) {
1499 if (SCM_PTR_LE (scm_heap_table
[i
].bounds
[0], ptr
)
1500 && SCM_PTR_GT (scm_heap_table
[i
].bounds
[1], ptr
)
1501 && (scm_heap_table
[i
].span
== 1 || DOUBLECELL_ALIGNED_P (value
))
1502 && !SCM_GC_IN_CARD_HEADERP (ptr
)
1513 gc_sweep_freelist_start (scm_freelist_t
*freelist
)
1515 freelist
->cells
= SCM_EOL
;
1516 freelist
->left_to_collect
= freelist
->cluster_size
;
1517 freelist
->clusters_allocated
= 0;
1518 freelist
->clusters
= SCM_EOL
;
1519 freelist
->clustertail
= &freelist
->clusters
;
1520 freelist
->collected_1
= freelist
->collected
;
1521 freelist
->collected
= 0;
1525 gc_sweep_freelist_finish (scm_freelist_t
*freelist
)
1528 *freelist
->clustertail
= freelist
->cells
;
1529 if (!SCM_NULLP (freelist
->cells
))
1531 SCM c
= freelist
->cells
;
1532 SCM_SETCAR (c
, SCM_CDR (c
));
1533 SCM_SETCDR (c
, SCM_EOL
);
1534 freelist
->collected
+=
1535 freelist
->span
* (freelist
->cluster_size
- freelist
->left_to_collect
);
1537 scm_gc_cells_collected
+= freelist
->collected
;
1539 /* Although freelist->min_yield is used to test freelist->collected
1540 * (which is the local GC yield for freelist), it is adjusted so
1541 * that *total* yield is freelist->min_yield_fraction of total heap
1542 * size. This means that a too low yield is compensated by more
1543 * heap on the list which is currently doing most work, which is
1544 * just what we want.
1546 collected
= SCM_MAX (freelist
->collected_1
, freelist
->collected
);
1547 freelist
->grow_heap_p
= (collected
< freelist
->min_yield
);
1550 #define NEXT_DATA_CELL(ptr, span) \
1552 scm_cell *nxt__ = CELL_UP ((char *) (ptr) + 1, (span)); \
1553 (ptr) = (SCM_GC_IN_CARD_HEADERP (nxt__) ? \
1554 CELL_UP (SCM_GC_CELL_CARD (nxt__) + SCM_GC_CARD_N_HEADER_CELLS, span) \
1560 #define FUNC_NAME "scm_gc_sweep"
1562 register SCM_CELLPTR ptr
;
1563 register SCM nfreelist
;
1564 register scm_freelist_t
*freelist
;
1572 gc_sweep_freelist_start (&scm_master_freelist
);
1573 gc_sweep_freelist_start (&scm_master_freelist2
);
1575 for (i
= 0; i
< scm_n_heap_segs
; i
++)
1577 register unsigned int left_to_collect
;
1578 register scm_sizet j
;
1580 /* Unmarked cells go onto the front of the freelist this heap
1581 segment points to. Rather than updating the real freelist
1582 pointer as we go along, we accumulate the new head in
1583 nfreelist. Then, if it turns out that the entire segment is
1584 free, we free (i.e., malloc's free) the whole segment, and
1585 simply don't assign nfreelist back into the real freelist. */
1586 freelist
= scm_heap_table
[i
].freelist
;
1587 nfreelist
= freelist
->cells
;
1588 left_to_collect
= freelist
->left_to_collect
;
1589 span
= scm_heap_table
[i
].span
;
1591 ptr
= CELL_UP (scm_heap_table
[i
].bounds
[0], span
);
1592 seg_size
= CELL_DN (scm_heap_table
[i
].bounds
[1], span
) - ptr
;
1594 /* use only data cells in seg_size */
1595 seg_size
= (seg_size
/ SCM_GC_CARD_N_CELLS
) * (SCM_GC_CARD_N_DATA_CELLS
/ span
) * span
;
1597 scm_gc_cells_swept
+= seg_size
;
1599 for (j
= seg_size
+ span
; j
-= span
; ptr
+= span
)
1603 if (SCM_GC_IN_CARD_HEADERP (ptr
))
1609 NEXT_DATA_CELL (nxt
, span
);
1616 scmptr
= PTR2SCM (ptr
);
1618 if (SCM_GCMARKP (scmptr
))
1621 switch SCM_TYP7 (scmptr
)
1623 case scm_tcs_cons_gloc
:
1625 /* Dirk:FIXME:: Again, super ugly code: scmptr may be a
1626 * struct or a gloc. See the corresponding comment in
1629 scm_bits_t word0
= (SCM_CELL_WORD_0 (scmptr
)
1630 - scm_tc3_cons_gloc
);
1631 /* access as struct */
1632 scm_bits_t
* vtable_data
= (scm_bits_t
*) word0
;
1633 if (vtable_data
[scm_vtable_index_vcell
] == 0)
1635 /* Structs need to be freed in a special order.
1636 * This is handled by GC C hooks in struct.c.
1638 SCM_SET_STRUCT_GC_CHAIN (scmptr
, scm_structs_to_free
);
1639 scm_structs_to_free
= scmptr
;
1642 /* fall through so that scmptr gets collected */
1645 case scm_tcs_cons_imcar
:
1646 case scm_tcs_cons_nimcar
:
1647 case scm_tcs_closures
:
1651 m
+= (2 + SCM_VECTOR_LENGTH (scmptr
)) * sizeof (SCM
);
1652 scm_must_free (SCM_VECTOR_BASE (scmptr
) - 2);
1654 case scm_tc7_vector
:
1656 unsigned long int length
= SCM_VECTOR_LENGTH (scmptr
);
1659 m
+= length
* sizeof (scm_bits_t
);
1660 scm_must_free (SCM_VECTOR_BASE (scmptr
));
1666 m
+= (SCM_CCLO_LENGTH (scmptr
) * sizeof (SCM
));
1667 scm_must_free (SCM_CCLO_BASE (scmptr
));
1673 unsigned long int length
= SCM_BITVECTOR_LENGTH (scmptr
);
1676 m
+= sizeof (long) * ((length
+ SCM_LONG_BIT
- 1) / SCM_LONG_BIT
);
1677 scm_must_free (SCM_BITVECTOR_BASE (scmptr
));
1681 case scm_tc7_byvect
:
1685 #ifdef HAVE_LONG_LONGS
1686 case scm_tc7_llvect
:
1691 m
+= SCM_UVECTOR_LENGTH (scmptr
) * scm_uniform_element_size (scmptr
);
1692 scm_must_free (SCM_UVECTOR_BASE (scmptr
));
1695 case scm_tc7_substring
:
1697 case scm_tc7_string
:
1698 m
+= SCM_STRING_LENGTH (scmptr
) + 1;
1699 scm_must_free (SCM_STRING_CHARS (scmptr
));
1701 case scm_tc7_symbol
:
1702 m
+= SCM_SYMBOL_LENGTH (scmptr
) + 1;
1703 scm_must_free (SCM_SYMBOL_CHARS (scmptr
));
1706 /* the various "subrs" (primitives) are never freed */
1709 if SCM_OPENP (scmptr
)
1711 int k
= SCM_PTOBNUM (scmptr
);
1712 if (!(k
< scm_numptob
))
1714 /* Keep "revealed" ports alive. */
1715 if (scm_revealed_count (scmptr
) > 0)
1717 /* Yes, I really do mean scm_ptobs[k].free */
1718 /* rather than ftobs[k].close. .close */
1719 /* is for explicit CLOSE-PORT by user */
1720 m
+= (scm_ptobs
[k
].free
) (scmptr
);
1721 SCM_SETSTREAM (scmptr
, 0);
1722 scm_remove_from_port_table (scmptr
);
1723 scm_gc_ports_collected
++;
1724 SCM_SETAND_CAR (scmptr
, ~SCM_OPN
);
1728 switch SCM_TYP16 (scmptr
)
1730 case scm_tc_free_cell
:
1735 m
+= (SCM_NUMDIGS (scmptr
) * SCM_BITSPERDIG
/ SCM_CHAR_BIT
);
1736 scm_must_free (SCM_BDIGITS (scmptr
));
1738 #endif /* def SCM_BIGDIG */
1739 case scm_tc16_complex
:
1740 m
+= sizeof (scm_complex_t
);
1741 scm_must_free (SCM_COMPLEX_MEM (scmptr
));
1746 k
= SCM_SMOBNUM (scmptr
);
1747 if (!(k
< scm_numsmob
))
1749 m
+= (scm_smobs
[k
].free
) (scmptr
);
1756 SCM_MISC_ERROR ("unknown type", SCM_EOL
);
1759 if (!--left_to_collect
)
1761 SCM_SETCAR (scmptr
, nfreelist
);
1762 *freelist
->clustertail
= scmptr
;
1763 freelist
->clustertail
= SCM_CDRLOC (scmptr
);
1765 nfreelist
= SCM_EOL
;
1766 freelist
->collected
+= span
* freelist
->cluster_size
;
1767 left_to_collect
= freelist
->cluster_size
;
1771 /* Stick the new cell on the front of nfreelist. It's
1772 critical that we mark this cell as freed; otherwise, the
1773 conservative collector might trace it as some other type
1775 SCM_SET_CELL_TYPE (scmptr
, scm_tc_free_cell
);
1776 SCM_SET_FREE_CELL_CDR (scmptr
, nfreelist
);
1781 #ifdef GC_FREE_SEGMENTS
1786 freelist
->heap_size
-= seg_size
;
1787 free ((char *) scm_heap_table
[i
].bounds
[0]);
1788 scm_heap_table
[i
].bounds
[0] = 0;
1789 for (j
= i
+ 1; j
< scm_n_heap_segs
; j
++)
1790 scm_heap_table
[j
- 1] = scm_heap_table
[j
];
1791 scm_n_heap_segs
-= 1;
1792 i
--; /* We need to scan the segment just moved. */
1795 #endif /* ifdef GC_FREE_SEGMENTS */
1797 /* Update the real freelist pointer to point to the head of
1798 the list of free cells we've built for this segment. */
1799 freelist
->cells
= nfreelist
;
1800 freelist
->left_to_collect
= left_to_collect
;
1803 #ifdef GUILE_DEBUG_FREELIST
1804 scm_map_free_list ();
1808 gc_sweep_freelist_finish (&scm_master_freelist
);
1809 gc_sweep_freelist_finish (&scm_master_freelist2
);
1811 /* When we move to POSIX threads private freelists should probably
1812 be GC-protected instead. */
1813 scm_freelist
= SCM_EOL
;
1814 scm_freelist2
= SCM_EOL
;
1816 scm_cells_allocated
= (SCM_HEAP_SIZE
- scm_gc_cells_collected
);
1817 scm_gc_yield
-= scm_cells_allocated
;
1818 scm_mallocated
-= m
;
1819 scm_gc_malloc_collected
= m
;
1825 /* {Front end to malloc}
1827 * scm_must_malloc, scm_must_realloc, scm_must_free, scm_done_malloc,
1830 * These functions provide services comperable to malloc, realloc, and
1831 * free. They are for allocating malloced parts of scheme objects.
1832 * The primary purpose of the front end is to impose calls to gc. */
1836 * Return newly malloced storage or throw an error.
1838 * The parameter WHAT is a string for error reporting.
1839 * If the threshold scm_mtrigger will be passed by this
1840 * allocation, or if the first call to malloc fails,
1841 * garbage collect -- on the presumption that some objects
1842 * using malloced storage may be collected.
1844 * The limit scm_mtrigger may be raised by this allocation.
1847 scm_must_malloc (scm_sizet size
, const char *what
)
1850 unsigned long nm
= scm_mallocated
+ size
;
1852 if (nm
<= scm_mtrigger
)
1854 SCM_SYSCALL (ptr
= malloc (size
));
1857 scm_mallocated
= nm
;
1858 #ifdef GUILE_DEBUG_MALLOC
1859 scm_malloc_register (ptr
, what
);
1867 nm
= scm_mallocated
+ size
;
1868 SCM_SYSCALL (ptr
= malloc (size
));
1871 scm_mallocated
= nm
;
1872 if (nm
> scm_mtrigger
- SCM_MTRIGGER_HYSTERESIS
) {
1873 if (nm
> scm_mtrigger
)
1874 scm_mtrigger
= nm
+ nm
/ 2;
1876 scm_mtrigger
+= scm_mtrigger
/ 2;
1878 #ifdef GUILE_DEBUG_MALLOC
1879 scm_malloc_register (ptr
, what
);
1885 scm_memory_error (what
);
1890 * is similar to scm_must_malloc.
1893 scm_must_realloc (void *where
,
1899 scm_sizet nm
= scm_mallocated
+ size
- old_size
;
1901 if (nm
<= scm_mtrigger
)
1903 SCM_SYSCALL (ptr
= realloc (where
, size
));
1906 scm_mallocated
= nm
;
1907 #ifdef GUILE_DEBUG_MALLOC
1908 scm_malloc_reregister (where
, ptr
, what
);
1916 nm
= scm_mallocated
+ size
- old_size
;
1917 SCM_SYSCALL (ptr
= realloc (where
, size
));
1920 scm_mallocated
= nm
;
1921 if (nm
> scm_mtrigger
- SCM_MTRIGGER_HYSTERESIS
) {
1922 if (nm
> scm_mtrigger
)
1923 scm_mtrigger
= nm
+ nm
/ 2;
1925 scm_mtrigger
+= scm_mtrigger
/ 2;
1927 #ifdef GUILE_DEBUG_MALLOC
1928 scm_malloc_reregister (where
, ptr
, what
);
1933 scm_memory_error (what
);
1938 scm_must_free (void *obj
)
1939 #define FUNC_NAME "scm_must_free"
1941 #ifdef GUILE_DEBUG_MALLOC
1942 scm_malloc_unregister (obj
);
1947 SCM_MISC_ERROR ("freeing NULL pointer", SCM_EOL
);
1952 /* Announce that there has been some malloc done that will be freed
1953 * during gc. A typical use is for a smob that uses some malloced
1954 * memory but can not get it from scm_must_malloc (for whatever
1955 * reason). When a new object of this smob is created you call
1956 * scm_done_malloc with the size of the object. When your smob free
1957 * function is called, be sure to include this size in the return
1960 * If you can't actually free the memory in the smob free function,
1961 * for whatever reason (like reference counting), you still can (and
1962 * should) report the amount of memory freed when you actually free it.
1963 * Do it by calling scm_done_malloc with the _negated_ size. Clever,
1964 * eh? Or even better, call scm_done_free. */
1967 scm_done_malloc (long size
)
1969 scm_mallocated
+= size
;
1971 if (scm_mallocated
> scm_mtrigger
)
1973 scm_igc ("foreign mallocs");
1974 if (scm_mallocated
> scm_mtrigger
- SCM_MTRIGGER_HYSTERESIS
)
1976 if (scm_mallocated
> scm_mtrigger
)
1977 scm_mtrigger
= scm_mallocated
+ scm_mallocated
/ 2;
1979 scm_mtrigger
+= scm_mtrigger
/ 2;
1985 scm_done_free (long size
)
1987 scm_mallocated
-= size
;
1994 * Each heap segment is an array of objects of a particular size.
1995 * Every segment has an associated (possibly shared) freelist.
1996 * A table of segment records is kept that records the upper and
1997 * lower extents of the segment; this is used during the conservative
1998 * phase of gc to identify probably gc roots (because they point
1999 * into valid segments at reasonable offsets). */
2002 * is true if the first segment was smaller than INIT_HEAP_SEG.
2003 * If scm_expmem is set to one, subsequent segment allocations will
2004 * allocate segments of size SCM_EXPHEAP(scm_heap_size).
2008 scm_sizet scm_max_segment_size
;
2011 * is the lowest base address of any heap segment.
2013 SCM_CELLPTR scm_heap_org
;
2015 scm_heap_seg_data_t
* scm_heap_table
= 0;
2016 static unsigned int heap_segment_table_size
= 0;
2017 int scm_n_heap_segs
= 0;
2020 * initializes a new heap segment and returns the number of objects it contains.
2022 * The segment origin and segment size in bytes are input parameters.
2023 * The freelist is both input and output.
2025 * This function presumes that the scm_heap_table has already been expanded
2026 * to accomodate a new segment record and that the markbit space was reserved
2027 * for all the cards in this segment.
2030 #define INIT_CARD(card, span) \
2032 SCM_GC_SET_CARD_BVEC (card, get_bvec ()); \
2034 SCM_GC_SET_CARD_DOUBLECELL (card); \
2038 init_heap_seg (SCM_CELLPTR seg_org
, scm_sizet size
, scm_freelist_t
*freelist
)
2040 register SCM_CELLPTR ptr
;
2041 SCM_CELLPTR seg_end
;
2044 int span
= freelist
->span
;
2046 if (seg_org
== NULL
)
2049 /* Align the begin ptr up.
2051 ptr
= SCM_GC_CARD_UP (seg_org
);
2053 /* Compute the ceiling on valid object pointers w/in this segment.
2055 seg_end
= SCM_GC_CARD_DOWN ((char *)seg_org
+ size
);
2057 /* Find the right place and insert the segment record.
2060 for (new_seg_index
= 0;
2061 ( (new_seg_index
< scm_n_heap_segs
)
2062 && SCM_PTR_LE (scm_heap_table
[new_seg_index
].bounds
[0], seg_org
));
2068 for (i
= scm_n_heap_segs
; i
> new_seg_index
; --i
)
2069 scm_heap_table
[i
] = scm_heap_table
[i
- 1];
2074 scm_heap_table
[new_seg_index
].span
= span
;
2075 scm_heap_table
[new_seg_index
].freelist
= freelist
;
2076 scm_heap_table
[new_seg_index
].bounds
[0] = ptr
;
2077 scm_heap_table
[new_seg_index
].bounds
[1] = seg_end
;
2080 n_new_cells
= seg_end
- ptr
;
2082 freelist
->heap_size
+= n_new_cells
;
2084 /* Partition objects in this segment into clusters */
2087 SCM
*clusterp
= &clusters
;
2089 NEXT_DATA_CELL (ptr
, span
);
2090 while (ptr
< seg_end
)
2092 scm_cell
*nxt
= ptr
;
2093 scm_cell
*prv
= NULL
;
2094 scm_cell
*last_card
= NULL
;
2095 int n_data_cells
= (SCM_GC_CARD_N_DATA_CELLS
/ span
) * SCM_CARDS_PER_CLUSTER
- 1;
2096 NEXT_DATA_CELL(nxt
, span
);
2098 /* Allocate cluster spine
2100 *clusterp
= PTR2SCM (ptr
);
2101 SCM_SETCAR (*clusterp
, PTR2SCM (nxt
));
2102 clusterp
= SCM_CDRLOC (*clusterp
);
2105 while (n_data_cells
--)
2107 scm_cell
*card
= SCM_GC_CELL_CARD (ptr
);
2108 SCM scmptr
= PTR2SCM (ptr
);
2110 NEXT_DATA_CELL (nxt
, span
);
2113 if (card
!= last_card
)
2115 INIT_CARD (card
, span
);
2119 SCM_SET_CELL_TYPE (scmptr
, scm_tc_free_cell
);
2120 SCM_SETCDR (scmptr
, PTR2SCM (nxt
));
2125 SCM_SET_FREE_CELL_CDR (PTR2SCM (prv
), SCM_EOL
);
2130 scm_cell
*ref
= seg_end
;
2131 NEXT_DATA_CELL (ref
, span
);
2133 /* [cmm] looks like the segment size doesn't divide cleanly by
2134 cluster size. bad cmm! */
2138 /* Patch up the last cluster pointer in the segment
2139 * to join it to the input freelist.
2141 *clusterp
= freelist
->clusters
;
2142 freelist
->clusters
= clusters
;
2146 fprintf (stderr
, "H");
2152 round_to_cluster_size (scm_freelist_t
*freelist
, scm_sizet len
)
2154 scm_sizet cluster_size_in_bytes
= CLUSTER_SIZE_IN_BYTES (freelist
);
2157 (len
+ cluster_size_in_bytes
- 1) / cluster_size_in_bytes
* cluster_size_in_bytes
2158 + ALIGNMENT_SLACK (freelist
);
2162 alloc_some_heap (scm_freelist_t
*freelist
, policy_on_error error_policy
)
2163 #define FUNC_NAME "alloc_some_heap"
2168 if (scm_gc_heap_lock
)
2170 /* Critical code sections (such as the garbage collector) aren't
2171 * supposed to add heap segments.
2173 fprintf (stderr
, "alloc_some_heap: Can not extend locked heap.\n");
2177 if (scm_n_heap_segs
== heap_segment_table_size
)
2179 /* We have to expand the heap segment table to have room for the new
2180 * segment. Do not yet increment scm_n_heap_segs -- that is done by
2181 * init_heap_seg only if the allocation of the segment itself succeeds.
2183 unsigned int new_table_size
= scm_n_heap_segs
+ 1;
2184 size_t size
= new_table_size
* sizeof (scm_heap_seg_data_t
);
2185 scm_heap_seg_data_t
* new_heap_table
;
2187 SCM_SYSCALL (new_heap_table
= ((scm_heap_seg_data_t
*)
2188 realloc ((char *)scm_heap_table
, size
)));
2189 if (!new_heap_table
)
2191 if (error_policy
== abort_on_error
)
2193 fprintf (stderr
, "alloc_some_heap: Could not grow heap segment table.\n");
2203 scm_heap_table
= new_heap_table
;
2204 heap_segment_table_size
= new_table_size
;
2208 /* Pick a size for the new heap segment.
2209 * The rule for picking the size of a segment is explained in
2213 /* Assure that the new segment is predicted to be large enough.
2215 * New yield should at least equal GC fraction of new heap size, i.e.
2217 * y + dh > f * (h + dh)
2220 * f : min yield fraction
2222 * dh : size of new heap segment
2224 * This gives dh > (f * h - y) / (1 - f)
2226 int f
= freelist
->min_yield_fraction
;
2227 long h
= SCM_HEAP_SIZE
;
2228 long min_cells
= (f
* h
- 100 * (long) scm_gc_yield
) / (99 - f
);
2229 len
= SCM_EXPHEAP (freelist
->heap_size
);
2231 fprintf (stderr
, "(%d < %d)", len
, min_cells
);
2233 if (len
< min_cells
)
2234 len
= min_cells
+ freelist
->cluster_size
;
2235 len
*= sizeof (scm_cell
);
2236 /* force new sampling */
2237 freelist
->collected
= LONG_MAX
;
2240 if (len
> scm_max_segment_size
)
2241 len
= scm_max_segment_size
;
2246 smallest
= CLUSTER_SIZE_IN_BYTES (freelist
);
2251 /* Allocate with decaying ambition. */
2252 while ((len
>= SCM_MIN_HEAP_SEG_SIZE
)
2253 && (len
>= smallest
))
2255 scm_sizet rounded_len
= round_to_cluster_size (freelist
, len
);
2256 SCM_SYSCALL (ptr
= (SCM_CELLPTR
) malloc (rounded_len
));
2259 init_heap_seg (ptr
, rounded_len
, freelist
);
2266 if (error_policy
== abort_on_error
)
2268 fprintf (stderr
, "alloc_some_heap: Could not grow heap.\n");
2275 SCM_DEFINE (scm_unhash_name
, "unhash-name", 1, 0, 0,
2278 #define FUNC_NAME s_scm_unhash_name
2282 SCM_VALIDATE_SYMBOL (1,name
);
2284 bound
= scm_n_heap_segs
;
2285 for (x
= 0; x
< bound
; ++x
)
2289 p
= scm_heap_table
[x
].bounds
[0];
2290 pbound
= scm_heap_table
[x
].bounds
[1];
2293 SCM cell
= PTR2SCM (p
);
2294 if (SCM_TYP3 (cell
) == scm_tc3_cons_gloc
)
2296 /* Dirk:FIXME:: Again, super ugly code: cell may be a gloc or a
2297 * struct cell. See the corresponding comment in scm_gc_mark.
2299 scm_bits_t word0
= SCM_CELL_WORD_0 (cell
) - scm_tc3_cons_gloc
;
2300 SCM gloc_car
= SCM_PACK (word0
); /* access as gloc */
2301 SCM vcell
= SCM_CELL_OBJECT_1 (gloc_car
);
2302 if ((SCM_EQ_P (name
, SCM_BOOL_T
) || SCM_EQ_P (SCM_CAR (gloc_car
), name
))
2303 && (SCM_UNPACK (vcell
) != 0) && (SCM_UNPACK (vcell
) != 1))
2305 SCM_SET_CELL_OBJECT_0 (cell
, name
);
2318 /* {GC Protection Helper Functions}
2323 * If within a function you need to protect one or more scheme objects from
2324 * garbage collection, pass them as parameters to one of the
2325 * scm_remember_upto_here* functions below. These functions don't do
2326 * anything, but since the compiler does not know that they are actually
2327 * no-ops, it will generate code that calls these functions with the given
2328 * parameters. Therefore, you can be sure that the compiler will keep those
2329 * scheme values alive (on the stack or in a register) up to the point where
2330 * scm_remember_upto_here* is called. In other words, place the call to
2331 * scm_remember_upt_here* _behind_ the last code in your function, that
2332 * depends on the scheme object to exist.
2334 * Example: We want to make sure, that the string object str does not get
2335 * garbage collected during the execution of 'some_function', because
2336 * otherwise the characters belonging to str would be freed and
2337 * 'some_function' might access freed memory. To make sure that the compiler
2338 * keeps str alive on the stack or in a register such that it is visible to
2339 * the conservative gc we add the call to scm_remember_upto_here_1 _after_ the
2340 * call to 'some_function'. Note that this would not be necessary if str was
2341 * used anyway after the call to 'some_function'.
2342 * char *chars = SCM_STRING_CHARS (str);
2343 * some_function (chars);
2344 * scm_remember_upto_here_1 (str); // str will be alive up to this point.
2348 scm_remember_upto_here_1 (SCM obj
)
2350 /* Empty. Protects a single object from garbage collection. */
2354 scm_remember_upto_here_2 (SCM obj1
, SCM obj2
)
2356 /* Empty. Protects two objects from garbage collection. */
2360 scm_remember_upto_here (SCM obj
, ...)
2362 /* Empty. Protects any number of objects from garbage collection. */
2366 #if (SCM_DEBUG_DEPRECATED == 0)
2369 scm_remember (SCM
*ptr
)
2374 #endif /* SCM_DEBUG_DEPRECATED == 0 */
2377 These crazy functions prevent garbage collection
2378 of arguments after the first argument by
2379 ensuring they remain live throughout the
2380 function because they are used in the last
2381 line of the code block.
2382 It'd be better to have a nice compiler hint to
2383 aid the conservative stack-scanning GC. --03/09/00 gjb */
2385 scm_return_first (SCM elt
, ...)
2391 scm_return_first_int (int i
, ...)
2398 scm_permanent_object (SCM obj
)
2401 scm_permobjs
= scm_cons (obj
, scm_permobjs
);
2407 /* Protect OBJ from the garbage collector. OBJ will not be freed, even if all
2408 other references are dropped, until the object is unprotected by calling
2409 scm_unprotect_object (OBJ). Calls to scm_protect/unprotect_object nest,
2410 i. e. it is possible to protect the same object several times, but it is
2411 necessary to unprotect the object the same number of times to actually get
2412 the object unprotected. It is an error to unprotect an object more often
2413 than it has been protected before. The function scm_protect_object returns
2417 /* Implementation note: For every object X, there is a counter which
2418 scm_protect_object(X) increments and scm_unprotect_object(X) decrements.
2422 scm_protect_object (SCM obj
)
2426 /* This critical section barrier will be replaced by a mutex. */
2429 handle
= scm_hashq_create_handle_x (scm_protects
, obj
, SCM_MAKINUM (0));
2430 SCM_SETCDR (handle
, SCM_MAKINUM (SCM_INUM (SCM_CDR (handle
)) + 1));
2438 /* Remove any protection for OBJ established by a prior call to
2439 scm_protect_object. This function returns OBJ.
2441 See scm_protect_object for more information. */
2443 scm_unprotect_object (SCM obj
)
2447 /* This critical section barrier will be replaced by a mutex. */
2450 handle
= scm_hashq_get_handle (scm_protects
, obj
);
2452 if (SCM_IMP (handle
))
2454 fprintf (stderr
, "scm_unprotect_object called on unprotected object\n");
2459 unsigned long int count
= SCM_INUM (SCM_CDR (handle
)) - 1;
2461 scm_hashq_remove_x (scm_protects
, obj
);
2463 SCM_SETCDR (handle
, SCM_MAKINUM (count
));
2473 /* called on process termination. */
2479 extern int on_exit (void (*procp
) (), int arg
);
2482 cleanup (int status
, void *arg
)
2484 #error Dont know how to setup a cleanup handler on your system.
2489 scm_flush_all_ports ();
2494 make_initial_segment (scm_sizet init_heap_size
, scm_freelist_t
*freelist
)
2496 scm_sizet rounded_size
= round_to_cluster_size (freelist
, init_heap_size
);
2498 if (!init_heap_seg ((SCM_CELLPTR
) malloc (rounded_size
),
2502 rounded_size
= round_to_cluster_size (freelist
, SCM_HEAP_SEG_SIZE
);
2503 if (!init_heap_seg ((SCM_CELLPTR
) malloc (rounded_size
),
2511 if (freelist
->min_yield_fraction
)
2512 freelist
->min_yield
= (freelist
->heap_size
* freelist
->min_yield_fraction
2514 freelist
->grow_heap_p
= (freelist
->heap_size
< freelist
->min_yield
);
2521 init_freelist (scm_freelist_t
*freelist
,
2526 freelist
->clusters
= SCM_EOL
;
2527 freelist
->cluster_size
= cluster_size
+ 1;
2528 freelist
->left_to_collect
= 0;
2529 freelist
->clusters_allocated
= 0;
2530 freelist
->min_yield
= 0;
2531 freelist
->min_yield_fraction
= min_yield
;
2532 freelist
->span
= span
;
2533 freelist
->collected
= 0;
2534 freelist
->collected_1
= 0;
2535 freelist
->heap_size
= 0;
2539 /* Get an integer from an environment variable. */
2541 scm_i_getenv_int (const char *var
, int def
)
2543 char *end
, *val
= getenv (var
);
2547 res
= strtol (val
, &end
, 10);
2557 scm_sizet gc_trigger_1
;
2558 scm_sizet gc_trigger_2
;
2559 scm_sizet init_heap_size_1
;
2560 scm_sizet init_heap_size_2
;
2563 j
= SCM_NUM_PROTECTS
;
2565 scm_sys_protects
[--j
] = SCM_BOOL_F
;
2568 scm_freelist
= SCM_EOL
;
2569 scm_freelist2
= SCM_EOL
;
2570 gc_trigger_1
= scm_i_getenv_int ("GUILE_MIN_YIELD_1", scm_default_min_yield_1
);
2571 init_freelist (&scm_master_freelist
, 1, SCM_CLUSTER_SIZE_1
, gc_trigger_1
);
2572 gc_trigger_2
= scm_i_getenv_int ("GUILE_MIN_YIELD_2", scm_default_min_yield_2
);
2573 init_freelist (&scm_master_freelist2
, 2, SCM_CLUSTER_SIZE_2
, gc_trigger_2
);
2574 scm_max_segment_size
= scm_i_getenv_int ("GUILE_MAX_SEGMENT_SIZE", scm_default_max_segment_size
);
2578 j
= SCM_HEAP_SEG_SIZE
;
2579 scm_mtrigger
= SCM_INIT_MALLOC_LIMIT
;
2580 scm_heap_table
= ((scm_heap_seg_data_t
*)
2581 scm_must_malloc (sizeof (scm_heap_seg_data_t
) * 2, "hplims"));
2582 heap_segment_table_size
= 2;
2584 mark_space_ptr
= &mark_space_head
;
2586 init_heap_size_1
= scm_i_getenv_int ("GUILE_INIT_SEGMENT_SIZE_1", scm_default_init_heap_size_1
);
2587 init_heap_size_2
= scm_i_getenv_int ("GUILE_INIT_SEGMENT_SIZE_2", scm_default_init_heap_size_2
);
2588 if (make_initial_segment (init_heap_size_1
, &scm_master_freelist
) ||
2589 make_initial_segment (init_heap_size_2
, &scm_master_freelist2
))
2592 /* scm_hplims[0] can change. do not remove scm_heap_org */
2593 scm_heap_org
= CELL_UP (scm_heap_table
[0].bounds
[0], 1);
2595 scm_c_hook_init (&scm_before_gc_c_hook
, 0, SCM_C_HOOK_NORMAL
);
2596 scm_c_hook_init (&scm_before_mark_c_hook
, 0, SCM_C_HOOK_NORMAL
);
2597 scm_c_hook_init (&scm_before_sweep_c_hook
, 0, SCM_C_HOOK_NORMAL
);
2598 scm_c_hook_init (&scm_after_sweep_c_hook
, 0, SCM_C_HOOK_NORMAL
);
2599 scm_c_hook_init (&scm_after_gc_c_hook
, 0, SCM_C_HOOK_NORMAL
);
2601 /* Initialise the list of ports. */
2602 scm_port_table
= (scm_port
**)
2603 malloc (sizeof (scm_port
*) * scm_port_table_room
);
2604 if (!scm_port_table
)
2611 on_exit (cleanup
, 0);
2615 scm_undefineds
= scm_cons (SCM_UNDEFINED
, SCM_EOL
);
2616 SCM_SETCDR (scm_undefineds
, scm_undefineds
);
2618 scm_listofnull
= scm_cons (SCM_EOL
, SCM_EOL
);
2619 scm_nullstr
= scm_makstr (0L, 0);
2620 scm_nullvect
= scm_c_make_vector (0, SCM_UNDEFINED
);
2622 #define DEFAULT_SYMHASH_SIZE 277
2623 scm_symhash
= scm_c_make_hash_table (DEFAULT_SYMHASH_SIZE
);
2624 scm_symhash_vars
= scm_c_make_hash_table (DEFAULT_SYMHASH_SIZE
);
2626 scm_stand_in_procs
= SCM_EOL
;
2627 scm_permobjs
= SCM_EOL
;
2628 scm_protects
= scm_c_make_hash_table (31);
2635 SCM scm_after_gc_hook
;
2637 #if (SCM_DEBUG_DEPRECATED == 0)
2638 static SCM scm_gc_vcell
; /* the vcell for gc-thunk. */
2639 #endif /* SCM_DEBUG_DEPRECATED == 0 */
2640 static SCM gc_async
;
2643 /* The function gc_async_thunk causes the execution of the after-gc-hook. It
2644 * is run after the gc, as soon as the asynchronous events are handled by the
2648 gc_async_thunk (void)
2650 scm_c_run_hook (scm_after_gc_hook
, SCM_EOL
);
2652 #if (SCM_DEBUG_DEPRECATED == 0)
2654 /* The following code will be removed in Guile 1.5. */
2655 if (SCM_NFALSEP (scm_gc_vcell
))
2657 SCM proc
= SCM_CDR (scm_gc_vcell
);
2659 if (SCM_NFALSEP (proc
) && !SCM_UNBNDP (proc
))
2660 scm_apply (proc
, SCM_EOL
, SCM_EOL
);
2663 #endif /* SCM_DEBUG_DEPRECATED == 0 */
2665 return SCM_UNSPECIFIED
;
2669 /* The function mark_gc_async is run by the scm_after_gc_c_hook at the end of
2670 * the garbage collection. The only purpose of this function is to mark the
2671 * gc_async (which will eventually lead to the execution of the
2675 mark_gc_async (void * hook_data
, void *func_data
, void *data
)
2677 scm_system_async_mark (gc_async
);
2687 scm_after_gc_hook
= scm_create_hook ("after-gc-hook", 0);
2689 #if (SCM_DEBUG_DEPRECATED == 0)
2690 scm_gc_vcell
= scm_sysintern ("gc-thunk", SCM_BOOL_F
);
2691 #endif /* SCM_DEBUG_DEPRECATED == 0 */
2692 after_gc_thunk
= scm_make_subr_opt ("%gc-thunk", scm_tc7_subr_0
, gc_async_thunk
, 0);
2693 gc_async
= scm_system_async (after_gc_thunk
); /* protected via scm_asyncs */
2695 scm_c_hook_add (&scm_after_gc_c_hook
, mark_gc_async
, NULL
, 0);
2697 #ifndef SCM_MAGIC_SNARFER
2698 #include "libguile/gc.x"
2702 #endif /*MARK_DEPENDENCIES*/