X-Git-Url: http://git.hcoop.net/bpt/guile.git/blobdiff_plain/eab1b25970c21df7da67bd8f48290a1a1e1bf3d7..083f810fe9b7f04dc0de6b8ebc62053a41714f2b:/libguile/gc.h diff --git a/libguile/gc.h b/libguile/gc.h index f0f89b7f7..4692a4935 100644 --- a/libguile/gc.h +++ b/libguile/gc.h @@ -3,79 +3,42 @@ #ifndef SCM_GC_H #define SCM_GC_H -/* Copyright (C) 1995,1996,1998,1999,2000,2001 Free Software Foundation, Inc. +/* Copyright (C) 1995,1996,1998,1999,2000,2001, 2002, 2003, 2004, 2006, 2007, 2008 Free Software Foundation, Inc. * - * This program is free software; you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation; either version 2, or (at your option) - * any later version. + * This library is free software; you can redistribute it and/or + * modify it under the terms of the GNU Lesser General Public + * License as published by the Free Software Foundation; either + * version 2.1 of the License, or (at your option) any later version. * - * This program is distributed in the hope that it will be useful, + * This library is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + * Lesser General Public License for more details. * - * You should have received a copy of the GNU General Public License - * along with this software; see the file COPYING. If not, write to - * the Free Software Foundation, Inc., 59 Temple Place, Suite 330, - * Boston, MA 02111-1307 USA - * - * As a special exception, the Free Software Foundation gives permission - * for additional uses of the text contained in its release of GUILE. - * - * The exception is that, if you link the GUILE library with other files - * to produce an executable, this does not by itself cause the - * resulting executable to be covered by the GNU General Public License. - * Your use of that executable is in no way restricted on account of - * linking the GUILE library code into it. - * - * This exception does not however invalidate any other reasons why - * the executable file might be covered by the GNU General Public License. - * - * This exception applies only to the code released by the - * Free Software Foundation under the name GUILE. If you copy - * code from other Free Software Foundation releases into a copy of - * GUILE, as the General Public License permits, the exception does - * not apply to the code that you add in this way. To avoid misleading - * anyone as to the status of such modified files, you must delete - * this exception notice from them. - * - * If you write modifications of your own for GUILE, it is your choice - * whether to permit this exception to apply to your modifications. - * If you do not wish that, delete this exception notice. */ + * You should have received a copy of the GNU Lesser General Public + * License along with this library; if not, write to the Free Software + * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA + */ #include "libguile/__scm.h" #include "libguile/hooks.h" +#include "libguile/threads.h" - typedef struct scm_t_cell { - scm_t_bits word_0; - scm_t_bits word_1; + SCM word_0; + SCM word_1; } scm_t_cell; -/* - CARDS - - A card is a small `page' of memory; it will be the unit for lazy - sweeping, generations, etc. The first cell of a card contains a - pointer to the mark bitvector, so that we can find the bitvector efficiently: we - knock off some lowerorder bits. - - The size on a 32 bit machine is 256 cells = 2kb. The card -*/ - - - -/* Cray machines have pointers that are incremented once for each word, - * rather than each byte, the 3 most significant bits encode the byte - * within the word. The following macros deal with this by storing the - * native Cray pointers like the ones that looks like scm expects. This - * is done for any pointers that might appear in the car of a scm_t_cell, +/* Cray machines have pointers that are incremented once for each + * word, rather than each byte, the 3 most significant bits encode the + * byte within the word. The following macros deal with this by + * storing the native Cray pointers like the ones that looks like scm + * expects. This is done for any pointers that point to a cell, * pointers to scm_vector elts, functions, &c are not munged. */ #ifdef _UNICOS @@ -87,74 +50,6 @@ typedef struct scm_t_cell #endif /* def _UNICOS */ -#define SCM_GC_CARD_N_HEADER_CELLS 1 -#define SCM_GC_CARD_N_CELLS 256 -#define SCM_GC_SIZEOF_CARD SCM_GC_CARD_N_CELLS * sizeof (scm_t_cell) - -#define SCM_GC_CARD_BVEC(card) ((scm_t_c_bvec_long *) ((card)->word_0)) -#define SCM_GC_SET_CARD_BVEC(card, bvec) \ - ((card)->word_0 = (scm_t_bits) (bvec)) - - -#define SCM_GC_GET_CARD_FLAGS(card) ((long) ((card)->word_1)) -#define SCM_GC_SET_CARD_FLAGS(card, flags) \ - ((card)->word_1 = (scm_t_bits) (flags)) -#define SCM_GC_CLEAR_CARD_FLAGS(card) (SCM_GC_SET_CARD_FLAGS (card, 0L)) - -#define SCM_GC_GET_CARD_FLAG(card, shift) (SCM_GC_GET_CARD_FLAGS (card) & (1L << (shift))) -#define SCM_GC_SET_CARD_FLAG(card, shift) \ - (SCM_GC_SET_CARD_FLAGS (card, SCM_GC_GET_CARD_FLAGS(card) | (1L << (shift)))) -#define SCM_GC_CLEAR_CARD_FLAG(card, shift) \ - (SCM_GC_SET_CARD_FLAGS (card, SCM_GC_GET_CARD_FLAGS(card) & ~(1L << (shift)))) - -#define SCM_GC_CARDF_DOUBLECELL 0 - -#define SCM_GC_CARD_DOUBLECELLP(card) SCM_GC_GET_CARD_FLAG (card, SCM_GC_CARDF_DOUBLECELL) -#define SCM_GC_SET_CARD_DOUBLECELL(card) SCM_GC_SET_CARD_FLAG (card, SCM_GC_CARDF_DOUBLECELL) - -/* card addressing. for efficiency, cards are *always* aligned to - SCM_GC_CARD_SIZE. */ - -#define SCM_GC_CARD_SIZE_MASK (SCM_GC_CARD_N_CELLS * sizeof (scm_t_cell) - 1) -#define SCM_GC_CARD_ADDR_MASK (~SCM_GC_CARD_SIZE_MASK) - -#define SCM_GC_CELL_CARD(x) ((scm_t_cell *) ((long) (x) & SCM_GC_CARD_ADDR_MASK)) -#define SCM_GC_CELL_OFFSET(x) (((long) (x) & SCM_GC_CARD_SIZE_MASK) >> SCM_CELL_SIZE_SHIFT) -#define SCM_GC_CELL_BVEC(x) SCM_GC_CARD_BVEC (SCM_GC_CELL_CARD (x)) -#define SCM_GC_CELL_GET_BIT(x) SCM_C_BVEC_GET (SCM_GC_CELL_BVEC (x), SCM_GC_CELL_OFFSET (x)) -#define SCM_GC_CELL_SET_BIT(x) SCM_C_BVEC_SET (SCM_GC_CELL_BVEC (x), SCM_GC_CELL_OFFSET (x)) -#define SCM_GC_CELL_CLEAR_BIT(x) SCM_C_BVEC_CLEAR (SCM_GC_CELL_BVEC (x), SCM_GC_CELL_OFFSET (x)) - -#define SCM_GC_CARD_UP(x) SCM_GC_CELL_CARD ((char *) (x) + SCM_GC_SIZEOF_CARD - 1) -#define SCM_GC_CARD_DOWN SCM_GC_CELL_CARD - -/* low level bit banging aids */ -typedef unsigned long scm_t_c_bvec_long; - -#if (SIZEOF_LONG == 8) -# define SCM_C_BVEC_LONG_BITS 64 -# define SCM_C_BVEC_OFFSET_SHIFT 6 -# define SCM_C_BVEC_POS_MASK 63 -# define SCM_CELL_SIZE_SHIFT 4 -# define SCM_SIZEOF_LONG SIZEOF_LONG -#else -# define SCM_C_BVEC_LONG_BITS 32 -# define SCM_SIZEOF_LONG SIZEOF_LONG -# define SCM_C_BVEC_OFFSET_SHIFT 5 -# define SCM_C_BVEC_POS_MASK 31 -# define SCM_CELL_SIZE_SHIFT 3 -#endif - -#define SCM_C_BVEC_OFFSET(pos) (pos >> SCM_C_BVEC_OFFSET_SHIFT) - -#define SCM_C_BVEC_GET(bvec, pos) (bvec[SCM_C_BVEC_OFFSET (pos)] & (1L << (pos & SCM_C_BVEC_POS_MASK))) -#define SCM_C_BVEC_SET(bvec, pos) (bvec[SCM_C_BVEC_OFFSET (pos)] |= (1L << (pos & SCM_C_BVEC_POS_MASK))) -#define SCM_C_BVEC_CLEAR(bvec, pos) (bvec[SCM_C_BVEC_OFFSET (pos)] &= ~(1L << (pos & SCM_C_BVEC_POS_MASK))) - -/* testing and changing GC marks */ -#define SCM_GC_MARK_P(x) SCM_GC_CELL_GET_BIT (x) -#define SCM_SET_GC_MARK(x) SCM_GC_CELL_SET_BIT (x) -#define SCM_CLEAR_GC_MARK(x) SCM_GC_CELL_CLEAR_BIT (x) /* Low level cell data accessing macros. These macros should only be used * from within code related to garbage collection issues, since they will @@ -162,15 +57,14 @@ typedef unsigned long scm_t_c_bvec_long; * in debug mode. In particular these macros will even work for free cells, * which should never be encountered by user code. */ -#define SCM_GC_CELL_WORD(x, n) \ - (((const scm_t_bits *) SCM2PTR (x)) [n]) -#define SCM_GC_CELL_OBJECT(x, n) \ - (SCM_PACK (((const scm_t_bits *) SCM2PTR (x)) [n])) -#define SCM_GC_SET_CELL_WORD(x, n, v) \ - (((scm_t_bits *) SCM2PTR (x)) [n] = (scm_t_bits) (v)) -#define SCM_GC_SET_CELL_OBJECT(x, n, v) \ - (((scm_t_bits *) SCM2PTR (x)) [n] = SCM_UNPACK (v)) -#define SCM_GC_CELL_TYPE(x) SCM_GC_CELL_WORD (x, 0) +#define SCM_GC_CELL_OBJECT(x, n) (((SCM *)SCM2PTR (x)) [n]) +#define SCM_GC_CELL_WORD(x, n) (SCM_UNPACK (SCM_GC_CELL_OBJECT ((x), (n)))) + +#define SCM_GC_SET_CELL_OBJECT(x, n, v) ((((SCM *)SCM2PTR (x)) [n]) = (v)) +#define SCM_GC_SET_CELL_WORD(x, n, v) \ + (SCM_GC_SET_CELL_OBJECT ((x), (n), SCM_PACK (v))) + +#define SCM_GC_CELL_TYPE(x) (SCM_GC_CELL_OBJECT ((x), 0)) /* Except for the garbage collector, no part of guile should ever run over a @@ -188,74 +82,68 @@ typedef unsigned long scm_t_c_bvec_long; #define SCM_CELL_WORD(x, n) \ SCM_VALIDATE_CELL ((x), SCM_GC_CELL_WORD ((x), (n))) -#define SCM_CELL_WORD_0(x) SCM_CELL_WORD (x, 0) -#define SCM_CELL_WORD_1(x) SCM_CELL_WORD (x, 1) -#define SCM_CELL_WORD_2(x) SCM_CELL_WORD (x, 2) -#define SCM_CELL_WORD_3(x) SCM_CELL_WORD (x, 3) +#define SCM_CELL_WORD_0(x) SCM_CELL_WORD ((x), 0) +#define SCM_CELL_WORD_1(x) SCM_CELL_WORD ((x), 1) +#define SCM_CELL_WORD_2(x) SCM_CELL_WORD ((x), 2) +#define SCM_CELL_WORD_3(x) SCM_CELL_WORD ((x), 3) #define SCM_CELL_OBJECT(x, n) \ SCM_VALIDATE_CELL ((x), SCM_GC_CELL_OBJECT ((x), (n))) -#define SCM_CELL_OBJECT_0(x) SCM_CELL_OBJECT (x, 0) -#define SCM_CELL_OBJECT_1(x) SCM_CELL_OBJECT (x, 1) -#define SCM_CELL_OBJECT_2(x) SCM_CELL_OBJECT (x, 2) -#define SCM_CELL_OBJECT_3(x) SCM_CELL_OBJECT (x, 3) +#define SCM_CELL_OBJECT_0(x) SCM_CELL_OBJECT ((x), 0) +#define SCM_CELL_OBJECT_1(x) SCM_CELL_OBJECT ((x), 1) +#define SCM_CELL_OBJECT_2(x) SCM_CELL_OBJECT ((x), 2) +#define SCM_CELL_OBJECT_3(x) SCM_CELL_OBJECT ((x), 3) #define SCM_SET_CELL_WORD(x, n, v) \ SCM_VALIDATE_CELL ((x), SCM_GC_SET_CELL_WORD ((x), (n), (v))) -#define SCM_SET_CELL_WORD_0(x, v) SCM_SET_CELL_WORD (x, 0, v) -#define SCM_SET_CELL_WORD_1(x, v) SCM_SET_CELL_WORD (x, 1, v) -#define SCM_SET_CELL_WORD_2(x, v) SCM_SET_CELL_WORD (x, 2, v) -#define SCM_SET_CELL_WORD_3(x, v) SCM_SET_CELL_WORD (x, 3, v) +#define SCM_SET_CELL_WORD_0(x, v) SCM_SET_CELL_WORD ((x), 0, (v)) +#define SCM_SET_CELL_WORD_1(x, v) SCM_SET_CELL_WORD ((x), 1, (v)) +#define SCM_SET_CELL_WORD_2(x, v) SCM_SET_CELL_WORD ((x), 2, (v)) +#define SCM_SET_CELL_WORD_3(x, v) SCM_SET_CELL_WORD ((x), 3, (v)) #define SCM_SET_CELL_OBJECT(x, n, v) \ SCM_VALIDATE_CELL ((x), SCM_GC_SET_CELL_OBJECT ((x), (n), (v))) -#define SCM_SET_CELL_OBJECT_0(x, v) SCM_SET_CELL_OBJECT (x, 0, v) -#define SCM_SET_CELL_OBJECT_1(x, v) SCM_SET_CELL_OBJECT (x, 1, v) -#define SCM_SET_CELL_OBJECT_2(x, v) SCM_SET_CELL_OBJECT (x, 2, v) -#define SCM_SET_CELL_OBJECT_3(x, v) SCM_SET_CELL_OBJECT (x, 3, v) - -#define SCM_CELL_TYPE(x) SCM_CELL_WORD_0 (x) -#define SCM_SET_CELL_TYPE(x, t) SCM_SET_CELL_WORD_0 (x, t) +#define SCM_SET_CELL_OBJECT_0(x, v) SCM_SET_CELL_OBJECT ((x), 0, (v)) +#define SCM_SET_CELL_OBJECT_1(x, v) SCM_SET_CELL_OBJECT ((x), 1, (v)) +#define SCM_SET_CELL_OBJECT_2(x, v) SCM_SET_CELL_OBJECT ((x), 2, (v)) +#define SCM_SET_CELL_OBJECT_3(x, v) SCM_SET_CELL_OBJECT ((x), 3, (v)) +#define SCM_CELL_OBJECT_LOC(x, n) (SCM_VALIDATE_CELL((x), &SCM_GC_CELL_OBJECT ((x), (n)))) +#define SCM_CARLOC(x) (SCM_CELL_OBJECT_LOC ((x), 0)) +#define SCM_CDRLOC(x) (SCM_CELL_OBJECT_LOC ((x), 1)) +#define SCM_CELL_TYPE(x) SCM_CELL_WORD_0 (x) +#define SCM_SET_CELL_TYPE(x, t) SCM_SET_CELL_WORD_0 ((x), (t)) /* Freelists consist of linked cells where the type entry holds the value * scm_tc_free_cell and the second entry holds a pointer to the next cell of * the freelist. Due to this structure, freelist cells are not cons cells * and thus may not be accessed using SCM_CAR and SCM_CDR. */ -/* - SCM_FREECELL_P removed ; the semantics are ambiguous with lazy - sweeping. Could mean "this cell is no longer in use (will be swept)" - or "this cell has just been swept, and is not yet in use". - */ - -#define SCM_FREECELL_P this_macro_has_been_removed_see_gc_header_file - #define SCM_FREE_CELL_CDR(x) \ (SCM_GC_CELL_OBJECT ((x), 1)) #define SCM_SET_FREE_CELL_CDR(x, v) \ (SCM_GC_SET_CELL_OBJECT ((x), 1, (v))) - -#define SCM_CELL_WORD_LOC(x, n) ((scm_t_bits *) & SCM_CELL_WORD (x, n)) -#define SCM_CARLOC(x) ((SCM *) SCM_CELL_WORD_LOC ((x), 0)) -#define SCM_CDRLOC(x) ((SCM *) SCM_CELL_WORD_LOC ((x), 1)) - - - - #if (SCM_DEBUG_CELL_ACCESSES == 1) /* Set this to != 0 if every cell that is accessed shall be checked: */ SCM_API int scm_debug_cell_accesses_p; SCM_API int scm_expensive_debug_cell_accesses_p; SCM_API int scm_debug_cells_gc_interval ; +void scm_i_expensive_validation_check (SCM cell); +#endif + +SCM_INTERNAL scm_i_pthread_mutex_t scm_i_gc_admin_mutex; + +#define scm_gc_running_p 0 +SCM_INTERNAL scm_i_pthread_mutex_t scm_i_sweep_mutex; + +#ifdef __ia64__ +void *scm_ia64_register_backing_store_base (void); +void *scm_ia64_ar_bsp (const void *); #endif -SCM_API int scm_block_gc; -SCM_API int scm_gc_heap_lock; -SCM_API unsigned int scm_gc_running_p; #if (SCM_ENABLE_DEPRECATED == 1) @@ -275,29 +163,15 @@ SCM_API size_t scm_default_max_segment_size; SCM_API size_t scm_max_segment_size; -/* - Deprecated scm_freelist, scm_master_freelist. - No warning; this is not a user serviceable part. - */ -extern SCM scm_i_freelist; -extern struct scm_t_cell_type_statistics scm_i_master_freelist; -extern SCM scm_i_freelist2; -extern struct scm_t_cell_type_statistics scm_i_master_freelist2; - +#define SCM_SET_FREELIST_LOC(key,ptr) scm_i_pthread_setspecific ((key), (ptr)) +#define SCM_FREELIST_LOC(key) ((SCM *) scm_i_pthread_getspecific (key)) +SCM_API struct scm_t_cell_type_statistics scm_i_master_freelist; +SCM_API struct scm_t_cell_type_statistics scm_i_master_freelist2; -SCM_API unsigned long scm_gc_cells_swept; -SCM_API unsigned long scm_gc_cells_collected; -SCM_API unsigned long scm_gc_cells_collected; -SCM_API unsigned long scm_gc_malloc_collected; -SCM_API unsigned long scm_gc_ports_collected; -SCM_API long scm_cells_allocated; -SCM_API int scm_gc_cell_yield_percentage; -SCM_API int scm_gc_malloc_yield_percentage; SCM_API unsigned long scm_mallocated; +SCM_API unsigned long scm_gc_ports_collected; SCM_API unsigned long scm_mtrigger; - - SCM_API SCM scm_after_gc_hook; SCM_API scm_t_c_hook scm_before_gc_c_hook; @@ -307,9 +181,13 @@ SCM_API scm_t_c_hook scm_after_sweep_c_hook; SCM_API scm_t_c_hook scm_after_gc_c_hook; #if defined (GUILE_DEBUG) || defined (GUILE_DEBUG_FREELIST) +#if (SCM_ENABLE_DEPRECATED == 1) +SCM scm_map_free_list (void); +#else #define scm_map_free_list deprecated #define scm_free_list_length deprecated #endif +#endif #if (SCM_ENABLE_DEPRECATED == 1) && defined (GUILE_DEBUG_FREELIST) SCM_API SCM scm_gc_set_debug_check_freelist_x (SCM flag); @@ -324,14 +202,14 @@ SCM_API SCM scm_set_debug_cell_accesses_x (SCM flag); SCM_API SCM scm_object_address (SCM obj); +SCM_API SCM scm_gc_enable (void); +SCM_API SCM scm_gc_disable (void); +SCM_API SCM scm_gc_dump (void); SCM_API SCM scm_gc_stats (void); +SCM_API SCM scm_gc_live_object_stats (void); SCM_API SCM scm_gc (void); -SCM_API void scm_gc_for_alloc (struct scm_t_cell_type_statistics *freelist); -SCM_API SCM scm_gc_for_newcell (struct scm_t_cell_type_statistics *master, SCM *freelist); -SCM_API void scm_igc (const char *what); +SCM_API void scm_i_gc (const char *what); SCM_API void scm_gc_mark (SCM p); -SCM_API void scm_gc_mark_dependencies (SCM p); -SCM_API void scm_mark_locations (SCM_STACKITEM x[], unsigned long n); SCM_API int scm_in_heap_p (SCM value); SCM_API void scm_gc_sweep (void); @@ -344,6 +222,7 @@ SCM_API void scm_gc_register_collectable_memory (void *mem, size_t size, const char *what); SCM_API void scm_gc_unregister_collectable_memory (void *mem, size_t size, const char *what); +SCM_API void *scm_gc_malloc_pointerless (size_t size, const char *what); SCM_API void *scm_gc_calloc (size_t size, const char *what); SCM_API void *scm_gc_malloc (size_t size, const char *what); SCM_API void *scm_gc_realloc (void *mem, size_t old_size, @@ -355,6 +234,31 @@ SCM_API char *scm_gc_strndup (const char *str, size_t n, const char *what); SCM_API void scm_remember_upto_here_1 (SCM obj); SCM_API void scm_remember_upto_here_2 (SCM obj1, SCM obj2); SCM_API void scm_remember_upto_here (SCM obj1, ...); + +/* In GCC we can force a reference to an SCM by making it an input to an + empty asm. This avoids the code size and slowdown of an actual function + call. Unfortunately there doesn't seem to be any way to do the varargs + scm_remember_upto_here like this. + + __volatile__ ensures nothing will be moved across the asm, and it won't + be optimized away (or only if proved unreachable). Constraint "g" can be + used on all processors and allows any memory or general register (or + immediate) operand. The actual asm syntax doesn't matter, we don't want + to use it, just ensure the operand is still alive. See "Extended Asm" in + the GCC manual for more. */ + +#ifdef __GNUC__ +#define scm_remember_upto_here_1(x) \ + do { \ + __asm__ __volatile__ ("" : : "g" (x)); \ + } while (0) +#define scm_remember_upto_here_2(x, y) \ + do { \ + scm_remember_upto_here_1 (x); \ + scm_remember_upto_here_1 (y); \ + } while (0) +#endif + SCM_API SCM scm_return_first (SCM elt, ...); SCM_API int scm_return_first_int (int x, ...); SCM_API SCM scm_permanent_object (SCM obj); @@ -364,8 +268,8 @@ SCM_API void scm_gc_register_root (SCM *p); SCM_API void scm_gc_unregister_root (SCM *p); SCM_API void scm_gc_register_roots (SCM *b, unsigned long n); SCM_API void scm_gc_unregister_roots (SCM *b, unsigned long n); +SCM_API void scm_storage_prehistory (void); SCM_API int scm_init_storage (void); -SCM_API void *scm_get_stack_base (void); SCM_API void scm_init_gc (void); #if SCM_ENABLE_DEPRECATED == 1