121 lines
4.4 KiB
C
121 lines
4.4 KiB
C
/**************************************************************************/
|
|
/* */
|
|
/* OCaml */
|
|
/* */
|
|
/* Damien Doligez, projet Para, INRIA Rocquencourt */
|
|
/* */
|
|
/* Copyright 1996 Institut National de Recherche en Informatique et */
|
|
/* en Automatique. */
|
|
/* */
|
|
/* All rights reserved. This file is distributed under the terms of */
|
|
/* the GNU Lesser General Public License version 2.1, with the */
|
|
/* special exception on linking described in the file LICENSE. */
|
|
/* */
|
|
/**************************************************************************/
|
|
|
|
#ifndef CAML_MINOR_GC_H
|
|
#define CAML_MINOR_GC_H
|
|
|
|
|
|
#include "address_class.h"
|
|
#include "config.h"
|
|
|
|
CAMLextern value *caml_young_start, *caml_young_end;
|
|
CAMLextern value *caml_young_alloc_start, *caml_young_alloc_end;
|
|
CAMLextern value *caml_young_ptr, *caml_young_limit;
|
|
CAMLextern value *caml_young_trigger;
|
|
extern asize_t caml_minor_heap_wsz;
|
|
extern int caml_in_minor_collection;
|
|
extern double caml_extra_heap_resources_minor;
|
|
|
|
#define CAML_TABLE_STRUCT(t) { \
|
|
t *base; \
|
|
t *end; \
|
|
t *threshold; \
|
|
t *ptr; \
|
|
t *limit; \
|
|
asize_t size; \
|
|
asize_t reserve; \
|
|
}
|
|
|
|
struct caml_ref_table CAML_TABLE_STRUCT(value *);
|
|
CAMLextern struct caml_ref_table caml_ref_table;
|
|
|
|
struct caml_ephe_ref_elt {
|
|
value ephe; /* an ephemeron in major heap */
|
|
mlsize_t offset; /* the offset that points in the minor heap */
|
|
};
|
|
|
|
struct caml_ephe_ref_table CAML_TABLE_STRUCT(struct caml_ephe_ref_elt);
|
|
CAMLextern struct caml_ephe_ref_table caml_ephe_ref_table;
|
|
|
|
struct caml_custom_elt {
|
|
value block; /* The finalized block in the minor heap. */
|
|
mlsize_t mem; /* The parameters for adjusting GC speed. */
|
|
mlsize_t max;
|
|
};
|
|
|
|
struct caml_custom_table CAML_TABLE_STRUCT(struct caml_custom_elt);
|
|
CAMLextern struct caml_custom_table caml_custom_table;
|
|
|
|
extern void caml_set_minor_heap_size (asize_t); /* size in bytes */
|
|
extern void caml_empty_minor_heap (void);
|
|
CAMLextern void caml_gc_dispatch (void);
|
|
CAMLextern void garbage_collection (void); /* runtime/signals_nat.c */
|
|
extern void caml_realloc_ref_table (struct caml_ref_table *);
|
|
extern void caml_alloc_table (struct caml_ref_table *, asize_t, asize_t);
|
|
extern void caml_realloc_ephe_ref_table (struct caml_ephe_ref_table *);
|
|
extern void caml_alloc_ephe_table (struct caml_ephe_ref_table *,
|
|
asize_t, asize_t);
|
|
extern void caml_realloc_custom_table (struct caml_custom_table *);
|
|
extern void caml_alloc_custom_table (struct caml_custom_table *,
|
|
asize_t, asize_t);
|
|
extern void caml_oldify_one (value, value *);
|
|
extern void caml_oldify_mopup (void);
|
|
|
|
#define Oldify(p) do{ \
|
|
value __oldify__v__ = *p; \
|
|
if (Is_block (__oldify__v__) && Is_young (__oldify__v__)){ \
|
|
caml_oldify_one (__oldify__v__, (p)); \
|
|
} \
|
|
}while(0)
|
|
|
|
static inline void add_to_ref_table (struct caml_ref_table *tbl, value *p)
|
|
{
|
|
if (tbl->ptr >= tbl->limit){
|
|
CAMLassert (tbl->ptr == tbl->limit);
|
|
caml_realloc_ref_table (tbl);
|
|
}
|
|
*tbl->ptr++ = p;
|
|
}
|
|
|
|
static inline void add_to_ephe_ref_table (struct caml_ephe_ref_table *tbl,
|
|
value ar, mlsize_t offset)
|
|
{
|
|
struct caml_ephe_ref_elt *ephe_ref;
|
|
if (tbl->ptr >= tbl->limit){
|
|
CAMLassert (tbl->ptr == tbl->limit);
|
|
caml_realloc_ephe_ref_table (tbl);
|
|
}
|
|
ephe_ref = tbl->ptr++;
|
|
ephe_ref->ephe = ar;
|
|
ephe_ref->offset = offset;
|
|
CAMLassert(ephe_ref->offset < Wosize_val(ephe_ref->ephe));
|
|
}
|
|
|
|
static inline void add_to_custom_table (struct caml_custom_table *tbl, value v,
|
|
mlsize_t mem, mlsize_t max)
|
|
{
|
|
struct caml_custom_elt *elt;
|
|
if (tbl->ptr >= tbl->limit){
|
|
CAMLassert (tbl->ptr == tbl->limit);
|
|
caml_realloc_custom_table (tbl);
|
|
}
|
|
elt = tbl->ptr++;
|
|
elt->block = v;
|
|
elt->mem = mem;
|
|
elt->max = max;
|
|
}
|
|
|
|
#endif /* CAML_MINOR_GC_H */
|