picrin/extlib/benz/gc.c

742 lines
15 KiB
C
Raw Normal View History

2014-08-25 00:38:09 -04:00
/**
* See Copyright Notice in picrin.h
*/
#include "picrin.h"
union header {
struct {
union header *ptr;
size_t size;
} s;
};
struct heap_page {
union header *basep, *endp;
struct heap_page *next;
};
struct pic_object {
union {
struct pic_basic basic;
struct pic_symbol sym;
struct pic_string str;
struct pic_blob blob;
struct pic_pair pair;
struct pic_vector vec;
struct pic_dict dict;
struct pic_reg reg;
struct pic_data data;
struct pic_record rec;
struct pic_id id;
struct pic_env env;
struct pic_proc proc;
struct pic_context cxt;
struct pic_port port;
struct pic_error err;
struct pic_lib lib;
struct pic_box box;
struct pic_checkpoint cp;
} u;
2015-07-20 02:02:16 -04:00
};
2014-08-25 00:38:09 -04:00
struct pic_heap {
union header base, *freep;
struct heap_page *pages;
struct pic_reg *regs; /* weak map chain */
2014-08-25 00:38:09 -04:00
};
2015-07-15 10:32:31 -04:00
struct pic_heap *
pic_heap_open(pic_state *pic)
2014-08-25 00:38:09 -04:00
{
2015-07-15 10:32:31 -04:00
struct pic_heap *heap;
2015-07-16 02:31:11 -04:00
heap = pic_malloc(pic, sizeof(struct pic_heap));
2015-07-15 10:32:31 -04:00
2014-08-25 00:38:09 -04:00
heap->base.s.ptr = &heap->base;
heap->base.s.size = 0; /* not 1, since it must never be used for allocation */
heap->freep = &heap->base;
heap->pages = NULL;
heap->regs = NULL;
2014-08-25 00:38:09 -04:00
return heap;
}
void
pic_heap_close(pic_state *pic, struct pic_heap *heap)
2014-08-25 00:38:09 -04:00
{
struct heap_page *page;
while (heap->pages) {
page = heap->pages;
heap->pages = heap->pages->next;
2015-07-16 02:28:30 -04:00
pic_free(pic, page->basep);
pic_free(pic, page);
2014-08-25 00:38:09 -04:00
}
2015-07-16 02:28:30 -04:00
pic_free(pic, heap);
2014-08-25 00:38:09 -04:00
}
2015-05-27 13:12:26 -04:00
#if PIC_ENABLE_LIBC
void *
2015-08-10 08:13:23 -04:00
pic_default_allocf(void PIC_UNUSED(*userdata), void *ptr, size_t size)
2014-08-25 00:38:09 -04:00
{
2015-08-10 08:17:26 -04:00
if (size != 0) {
2014-08-25 00:38:09 -04:00
return realloc(ptr, size);
}
2015-08-10 08:17:26 -04:00
free(ptr);
return NULL;
2014-08-25 00:38:09 -04:00
}
2015-05-27 13:12:26 -04:00
#endif
2014-08-25 00:38:09 -04:00
void *
2015-05-28 03:42:16 -04:00
pic_malloc(pic_state *pic, size_t size)
2014-08-25 00:38:09 -04:00
{
void *ptr;
2015-08-10 08:13:23 -04:00
ptr = pic->allocf(pic->userdata, NULL, size);
2014-08-25 00:38:09 -04:00
if (ptr == NULL && size > 0) {
2014-09-16 12:02:27 -04:00
pic_panic(pic, "memory exhausted");
2014-08-25 00:38:09 -04:00
}
return ptr;
}
void *
pic_realloc(pic_state *pic, void *ptr, size_t size)
{
2015-08-10 08:13:23 -04:00
ptr = pic->allocf(pic->userdata, ptr, size);
2014-08-25 00:38:09 -04:00
if (ptr == NULL && size > 0) {
2014-09-16 12:02:27 -04:00
pic_panic(pic, "memory exhausted");
2014-08-25 00:38:09 -04:00
}
return ptr;
}
void *
pic_calloc(pic_state *pic, size_t count, size_t size)
{
void *ptr;
size *= count;
2015-08-10 08:13:23 -04:00
ptr = pic->allocf(pic->userdata, NULL, size);
2014-08-25 00:38:09 -04:00
if (ptr == NULL && size > 0) {
2014-09-16 12:02:27 -04:00
pic_panic(pic, "memory exhausted");
2014-08-25 00:38:09 -04:00
}
memset(ptr, 0, size);
return ptr;
}
void
pic_free(pic_state *pic, void *ptr)
{
2015-08-10 08:13:23 -04:00
pic->allocf(pic->userdata, ptr, 0);
2014-08-25 00:38:09 -04:00
}
static void
gc_protect(pic_state *pic, struct pic_object *obj)
{
if (pic->arena_idx >= pic->arena_size) {
pic->arena_size = pic->arena_size * 2 + 1;
pic->arena = pic_realloc(pic, pic->arena, sizeof(struct pic_object *) * pic->arena_size);
}
pic->arena[pic->arena_idx++] = obj;
}
pic_value
pic_gc_protect(pic_state *pic, pic_value v)
{
if (! pic_obj_p(v))
2014-08-25 00:38:09 -04:00
return v;
gc_protect(pic, pic_obj_ptr(v));
2014-08-25 00:38:09 -04:00
return v;
}
size_t
pic_gc_arena_preserve(pic_state *pic)
{
return pic->arena_idx;
}
void
pic_gc_arena_restore(pic_state *pic, size_t state)
{
pic->arena_idx = state;
}
static void *
heap_alloc(pic_state *pic, size_t size)
2014-08-25 00:38:09 -04:00
{
2015-07-16 02:42:44 -04:00
union header *p, *prevp;
2014-08-25 00:38:09 -04:00
size_t nunits;
assert(size > 0);
nunits = (size + sizeof(union header) - 1) / sizeof(union header) + 1;
2015-07-16 02:42:44 -04:00
prevp = pic->heap->freep;
2014-08-25 00:38:09 -04:00
for (p = prevp->s.ptr; ; prevp = p, p = p->s.ptr) {
if (p->s.size >= nunits)
break;
2015-07-16 02:42:44 -04:00
if (p == pic->heap->freep) {
2014-08-25 00:38:09 -04:00
return NULL;
}
}
if (p->s.size == nunits) {
prevp->s.ptr = p->s.ptr;
}
else {
p->s.size -= nunits;
p += p->s.size;
p->s.size = nunits;
}
pic->heap->freep = prevp;
return (void *)(p + 1);
}
static void
2015-07-16 02:41:43 -04:00
heap_free(pic_state *pic, void *ap)
2014-08-25 00:38:09 -04:00
{
2015-07-16 02:42:44 -04:00
union header *bp, *p;
2015-07-16 02:41:43 -04:00
assert(ap != NULL);
bp = (union header *)ap - 1;
2014-08-25 00:38:09 -04:00
2015-07-16 02:42:44 -04:00
for (p = pic->heap->freep; ! (bp > p && bp < p->s.ptr); p = p->s.ptr) {
2014-08-25 00:38:09 -04:00
if (p >= p->s.ptr && (bp > p || bp < p->s.ptr)) {
break;
}
}
2015-07-16 03:13:30 -04:00
if (bp + bp->s.size == p->s.ptr && p->s.ptr->s.size > 0) { /* don't melt base header */
2014-08-25 00:38:09 -04:00
bp->s.size += p->s.ptr->s.size;
bp->s.ptr = p->s.ptr->s.ptr;
2015-07-16 02:45:01 -04:00
} else {
2014-08-25 00:38:09 -04:00
bp->s.ptr = p->s.ptr;
}
if (p + p->s.size == bp && bp->s.size > 0) { /* don't melt base header */
2014-08-25 00:38:09 -04:00
p->s.size += bp->s.size;
p->s.ptr = bp->s.ptr;
2015-07-16 02:45:01 -04:00
} else {
2014-08-25 00:38:09 -04:00
p->s.ptr = bp;
}
pic->heap->freep = p;
}
2015-07-16 02:33:31 -04:00
static void
heap_morecore(pic_state *pic)
2015-07-16 02:33:31 -04:00
{
2015-07-16 05:44:23 -04:00
union header *bp, *np;
2015-07-16 02:33:31 -04:00
struct heap_page *page;
2015-07-16 05:44:23 -04:00
size_t nunits;
2015-07-16 02:33:31 -04:00
2015-07-16 05:44:23 -04:00
nunits = PIC_HEAP_PAGE_SIZE / sizeof(union header);
2015-07-16 03:13:30 -04:00
2015-07-16 05:44:23 -04:00
assert(nunits >= 2);
2015-07-16 02:33:31 -04:00
2015-07-16 05:44:23 -04:00
bp = pic_malloc(pic, PIC_HEAP_PAGE_SIZE);
bp->s.size = 0; /* bp is never used for allocation */
heap_free(pic, bp + 1);
2015-07-16 02:33:31 -04:00
2015-07-16 05:44:23 -04:00
np = bp + 1;
np->s.size = nunits - 1;
2015-07-16 03:13:30 -04:00
heap_free(pic, np + 1);
2015-07-16 02:33:31 -04:00
page = pic_malloc(pic, sizeof(struct heap_page));
2015-07-16 05:44:23 -04:00
page->basep = bp;
page->endp = bp + nunits;
2015-07-16 02:33:31 -04:00
page->next = pic->heap->pages;
pic->heap->pages = page;
}
2015-07-20 02:18:12 -04:00
/* MARK */
2014-08-25 00:38:09 -04:00
static void gc_mark_object(pic_state *, struct pic_object *);
2014-08-25 00:38:09 -04:00
static void
gc_mark(pic_state *pic, pic_value v)
{
if (! pic_obj_p(v))
return;
gc_mark_object(pic, pic_obj_ptr(v));
}
2014-08-25 00:38:09 -04:00
static void
gc_mark_object(pic_state *pic, struct pic_object *obj)
2014-08-25 00:38:09 -04:00
{
2015-07-20 01:24:58 -04:00
loop:
if (obj->u.basic.gc_mark == PIC_GC_MARK)
2014-08-25 00:38:09 -04:00
return;
2015-07-16 04:23:29 -04:00
obj->u.basic.gc_mark = PIC_GC_MARK;
2014-08-25 00:38:09 -04:00
#define LOOP(o) obj = (struct pic_object *)(o); goto loop
2015-07-20 01:24:58 -04:00
switch (obj->u.basic.tt) {
2014-08-25 00:38:09 -04:00
case PIC_TT_PAIR: {
gc_mark(pic, obj->u.pair.car);
if (pic_obj_p(obj->u.pair.cdr)) {
LOOP(pic_obj_ptr(obj->u.pair.cdr));
2015-07-20 01:24:58 -04:00
}
2014-08-25 00:38:09 -04:00
break;
}
2015-05-30 09:34:51 -04:00
case PIC_TT_CXT: {
2014-08-25 00:38:09 -04:00
int i;
for (i = 0; i < obj->u.cxt.regc; ++i) {
gc_mark(pic, obj->u.cxt.regs[i]);
2014-08-25 00:38:09 -04:00
}
if (obj->u.cxt.up) {
LOOP(obj->u.cxt.up);
2014-08-25 00:38:09 -04:00
}
break;
}
case PIC_TT_PROC: {
if (pic_proc_irep_p(&obj->u.proc)) {
if (obj->u.proc.u.i.cxt) {
LOOP(obj->u.proc.u.i.cxt);
2015-05-31 07:19:07 -04:00
}
2015-01-18 22:14:46 -05:00
} else {
if (obj->u.proc.u.f.env) {
LOOP(obj->u.proc.u.f.env);
}
2014-08-25 00:38:09 -04:00
}
break;
}
case PIC_TT_PORT: {
break;
}
case PIC_TT_ERROR: {
gc_mark_object(pic, (struct pic_object *)obj->u.err.type);
gc_mark_object(pic, (struct pic_object *)obj->u.err.msg);
gc_mark(pic, obj->u.err.irrs);
LOOP(obj->u.err.stack);
2014-08-25 00:38:09 -04:00
break;
}
case PIC_TT_STRING: {
break;
}
case PIC_TT_VECTOR: {
2015-08-26 06:04:27 -04:00
int i;
for (i = 0; i < obj->u.vec.len; ++i) {
gc_mark(pic, obj->u.vec.data[i]);
2014-08-25 00:38:09 -04:00
}
break;
}
case PIC_TT_BLOB: {
break;
}
case PIC_TT_ID: {
2016-02-06 09:15:53 -05:00
gc_mark_object(pic, (struct pic_object *)obj->u.id.u.id.id);
LOOP(obj->u.id.u.id.env);
break;
}
2015-05-30 09:39:03 -04:00
case PIC_TT_ENV: {
khash_t(env) *h = &obj->u.env.map;
2015-06-24 18:26:48 -04:00
khiter_t it;
2014-08-25 00:38:09 -04:00
2015-06-24 18:26:48 -04:00
for (it = kh_begin(h); it != kh_end(h); ++it) {
if (kh_exist(h, it)) {
2016-02-06 09:15:53 -05:00
gc_mark_object(pic, (struct pic_object *)kh_key(h, it));
gc_mark_object(pic, (struct pic_object *)kh_val(h, it));
2015-06-24 18:26:48 -04:00
}
}
if (obj->u.env.prefix) {
gc_mark_object(pic, (struct pic_object *)obj->u.env.prefix);
}
if (obj->u.env.up) {
LOOP(obj->u.env.up);
2015-07-20 01:24:58 -04:00
}
2014-08-25 00:38:09 -04:00
break;
}
case PIC_TT_LIB: {
gc_mark(pic, obj->u.lib.name);
gc_mark_object(pic, (struct pic_object *)obj->u.lib.env);
LOOP(obj->u.lib.exports);
2014-08-25 00:38:09 -04:00
break;
}
case PIC_TT_DATA: {
if (obj->u.data.type->mark) {
obj->u.data.type->mark(pic, obj->u.data.data, gc_mark);
2014-09-16 03:18:19 -04:00
}
2014-08-25 00:38:09 -04:00
break;
}
case PIC_TT_DICT: {
2015-06-23 12:13:18 -04:00
pic_sym *sym;
2015-06-24 16:56:15 -04:00
khiter_t it;
2014-08-25 00:38:09 -04:00
pic_dict_for_each (sym, &obj->u.dict, it) {
gc_mark_object(pic, (struct pic_object *)sym);
gc_mark(pic, pic_dict_ref(pic, &obj->u.dict, sym));
2014-08-25 00:38:09 -04:00
}
break;
}
case PIC_TT_RECORD: {
2016-02-06 12:58:18 -05:00
gc_mark(pic, obj->u.rec.type);
if (pic_obj_p(obj->u.rec.datum)) {
LOOP(pic_obj_ptr(obj->u.rec.datum));
}
2014-08-25 00:38:09 -04:00
break;
}
case PIC_TT_SYMBOL: {
break;
}
2015-06-09 05:31:46 -04:00
case PIC_TT_REG: {
struct pic_reg *reg = (struct pic_reg *)obj;
reg->prev = pic->heap->regs;
pic->heap->regs = reg;
2015-06-09 05:31:46 -04:00
break;
}
2015-08-03 19:17:58 -04:00
case PIC_TT_BOX: {
if (pic_obj_p(obj->u.box.value)) {
LOOP(pic_obj_ptr(obj->u.box.value));
2015-08-03 19:17:58 -04:00
}
break;
}
2015-06-22 04:06:13 -04:00
case PIC_TT_CP: {
if (obj->u.cp.prev) {
gc_mark_object(pic, (struct pic_object *)obj->u.cp.prev);
2015-06-22 04:06:13 -04:00
}
if (obj->u.cp.in) {
gc_mark_object(pic, (struct pic_object *)obj->u.cp.in);
2015-06-22 04:06:13 -04:00
}
if (obj->u.cp.out) {
LOOP((struct pic_object *)obj->u.cp.out);
2015-06-22 04:06:13 -04:00
}
break;
}
2014-08-25 00:38:09 -04:00
case PIC_TT_NIL:
case PIC_TT_BOOL:
case PIC_TT_FLOAT:
case PIC_TT_INT:
case PIC_TT_CHAR:
case PIC_TT_EOF:
case PIC_TT_UNDEF:
2015-06-09 03:02:23 -04:00
case PIC_TT_INVALID:
2014-09-16 12:02:27 -04:00
pic_panic(pic, "logic flaw");
2014-08-25 00:38:09 -04:00
}
}
#define M(x) gc_mark_object(pic, (struct pic_object *)pic->x)
2014-08-25 00:38:09 -04:00
static void
gc_mark_phase(pic_state *pic)
{
pic_value *stack;
pic_callinfo *ci;
2014-09-18 01:50:01 -04:00
struct pic_proc **xhandler;
2016-02-04 10:30:11 -05:00
struct pic_list *list;
2014-09-18 01:50:01 -04:00
size_t j;
2015-06-09 05:31:46 -04:00
assert(pic->heap->regs == NULL);
2014-08-25 00:38:09 -04:00
2015-06-08 08:04:04 -04:00
/* checkpoint */
if (pic->cp) {
gc_mark_object(pic, (struct pic_object *)pic->cp);
2014-08-25 00:38:09 -04:00
}
/* stack */
for (stack = pic->stbase; stack != pic->sp; ++stack) {
gc_mark(pic, *stack);
}
/* callinfo */
for (ci = pic->ci; ci != pic->cibase; --ci) {
2015-05-30 09:34:51 -04:00
if (ci->cxt) {
gc_mark_object(pic, (struct pic_object *)ci->cxt);
2014-08-25 00:38:09 -04:00
}
}
2014-09-18 01:50:01 -04:00
/* exception handlers */
for (xhandler = pic->xpbase; xhandler != pic->xp; ++xhandler) {
gc_mark_object(pic, (struct pic_object *)*xhandler);
2014-09-18 01:50:01 -04:00
}
2014-08-25 00:38:09 -04:00
/* arena */
for (j = 0; j < pic->arena_idx; ++j) {
gc_mark_object(pic, (struct pic_object *)pic->arena[j]);
2014-08-25 00:38:09 -04:00
}
2016-02-04 10:30:11 -05:00
/* ireps */
for (list = pic->ireps.next; list != &pic->ireps; list = list->next) {
struct pic_irep *irep = (struct pic_irep *)list;
2016-02-06 04:15:15 -05:00
for (j = 0; j < irep->npool; ++j) {
2016-02-06 07:11:22 -05:00
gc_mark_object(pic, irep->pool[j]);
2016-02-04 10:30:11 -05:00
}
}
2015-01-20 03:38:34 -05:00
/* mark reserved symbols */
M(sDEFINE); M(sDEFINE_MACRO); M(sLAMBDA); M(sIF); M(sBEGIN); M(sSETBANG);
2015-07-20 02:18:12 -04:00
M(sQUOTE); M(sQUASIQUOTE); M(sUNQUOTE); M(sUNQUOTE_SPLICING);
M(sSYNTAX_QUOTE); M(sSYNTAX_QUASIQUOTE); M(sSYNTAX_UNQUOTE); M(sSYNTAX_UNQUOTE_SPLICING);
M(sDEFINE_LIBRARY); M(sIMPORT); M(sEXPORT); M(sCOND_EXPAND);
M(sCONS); M(sCAR); M(sCDR); M(sNILP); M(sSYMBOLP); M(sPAIRP);
M(sADD); M(sSUB); M(sMUL); M(sDIV); M(sEQ); M(sLT); M(sLE); M(sGT); M(sGE); M(sNOT);
2015-08-04 20:36:32 -04:00
2014-08-25 00:38:09 -04:00
/* global variables */
if (pic->globals) {
gc_mark_object(pic, (struct pic_object *)pic->globals);
2014-08-25 00:38:09 -04:00
}
/* macro objects */
if (pic->macros) {
gc_mark_object(pic, (struct pic_object *)pic->macros);
2014-08-25 00:38:09 -04:00
}
2014-09-18 01:50:01 -04:00
/* error object */
gc_mark(pic, pic->err);
2014-08-25 00:38:09 -04:00
2014-09-18 01:50:01 -04:00
/* features */
2014-09-09 12:41:10 -04:00
gc_mark(pic, pic->features);
2014-08-25 00:38:09 -04:00
/* library table */
gc_mark(pic, pic->libs);
2014-09-01 00:43:54 -04:00
2015-06-08 09:28:17 -04:00
/* parameter table */
gc_mark(pic, pic->ptable);
2015-06-09 05:31:46 -04:00
/* registries */
2014-09-24 23:12:52 -04:00
do {
2015-06-09 05:31:46 -04:00
struct pic_object *key;
pic_value val;
2015-06-24 18:14:29 -04:00
khiter_t it;
khash_t(reg) *h;
2015-06-09 05:31:46 -04:00
struct pic_reg *reg;
2014-09-24 23:12:52 -04:00
2015-06-09 05:31:46 -04:00
j = 0;
reg = pic->heap->regs;
2015-06-09 05:31:46 -04:00
while (reg != NULL) {
2015-06-24 18:14:29 -04:00
h = &reg->hash;
for (it = kh_begin(h); it != kh_end(h); ++it) {
if (! kh_exist(h, it))
continue;
key = kh_key(h, it);
val = kh_val(h, it);
if (key->u.basic.gc_mark == PIC_GC_MARK) {
if (pic_obj_p(val) && pic_obj_ptr(val)->u.basic.gc_mark == PIC_GC_UNMARK) {
gc_mark(pic, val);
++j;
}
2014-09-24 23:12:52 -04:00
}
}
2015-06-09 05:31:46 -04:00
reg = reg->prev;
2014-09-24 23:12:52 -04:00
}
} while (j > 0);
2014-08-25 00:38:09 -04:00
}
2015-07-20 02:18:12 -04:00
/* SWEEP */
2014-08-25 00:38:09 -04:00
static void
gc_finalize_object(pic_state *pic, struct pic_object *obj)
2014-08-25 00:38:09 -04:00
{
switch (obj->u.basic.tt) {
2014-08-25 00:38:09 -04:00
case PIC_TT_VECTOR: {
pic_free(pic, obj->u.vec.data);
2014-08-25 00:38:09 -04:00
break;
}
case PIC_TT_BLOB: {
pic_free(pic, obj->u.blob.data);
2014-08-25 00:38:09 -04:00
break;
}
case PIC_TT_STRING: {
pic_rope_decref(pic, obj->u.str.rope);
break;
}
2015-05-30 09:39:03 -04:00
case PIC_TT_ENV: {
kh_destroy(env, &obj->u.env.map);
2014-08-25 00:38:09 -04:00
break;
}
case PIC_TT_DATA: {
if (obj->u.data.type->dtor) {
obj->u.data.type->dtor(pic, obj->u.data.data);
2015-06-22 14:02:12 -04:00
}
2014-08-25 00:38:09 -04:00
break;
}
case PIC_TT_DICT: {
kh_destroy(dict, &obj->u.dict.hash);
2014-08-25 00:38:09 -04:00
break;
}
case PIC_TT_SYMBOL: {
pic_free(pic, (void *)obj->u.sym.cstr);
break;
}
2015-06-09 05:31:46 -04:00
case PIC_TT_REG: {
kh_destroy(reg, &obj->u.reg.hash);
2015-06-09 05:31:46 -04:00
break;
}
2016-02-04 10:30:11 -05:00
case PIC_TT_PROC: {
if (pic_proc_irep_p(&obj->u.proc)) {
pic_irep_decref(pic, obj->u.proc.u.i.irep);
}
break;
}
2015-07-20 02:02:16 -04:00
case PIC_TT_PAIR:
case PIC_TT_CXT:
case PIC_TT_PORT:
case PIC_TT_ERROR:
case PIC_TT_ID:
case PIC_TT_LIB:
case PIC_TT_RECORD:
case PIC_TT_CP:
2015-08-03 19:17:58 -04:00
case PIC_TT_BOX:
2015-06-22 04:06:13 -04:00
break;
2015-07-20 02:02:16 -04:00
2014-08-25 00:38:09 -04:00
case PIC_TT_NIL:
case PIC_TT_BOOL:
case PIC_TT_FLOAT:
case PIC_TT_INT:
case PIC_TT_CHAR:
case PIC_TT_EOF:
case PIC_TT_UNDEF:
2015-06-09 03:02:23 -04:00
case PIC_TT_INVALID:
2014-09-16 12:02:27 -04:00
pic_panic(pic, "logic flaw");
2014-08-25 00:38:09 -04:00
}
}
2015-07-16 03:34:59 -04:00
static size_t
2014-08-25 00:38:09 -04:00
gc_sweep_page(pic_state *pic, struct heap_page *page)
{
2015-07-16 02:45:01 -04:00
union header *bp, *p, *head = NULL, *tail = NULL;
struct pic_object *obj;
2015-07-16 03:34:59 -04:00
size_t alive = 0;
2014-08-25 00:38:09 -04:00
for (bp = page->basep; ; bp = bp->s.ptr) {
2015-07-16 03:13:30 -04:00
p = bp + (bp->s.size ? bp->s.size : 1); /* first bp's size is 0, so force advnce */
for (; p != bp->s.ptr; p += p->s.size) {
if (p < page->basep || page->endp <= p) {
2015-07-16 02:45:01 -04:00
goto escape;
2014-08-25 00:38:09 -04:00
}
obj = (struct pic_object *)(p + 1);
if (obj->u.basic.gc_mark == PIC_GC_MARK) {
obj->u.basic.gc_mark = PIC_GC_UNMARK;
2015-07-16 03:34:59 -04:00
alive += p->s.size;
2015-07-16 02:45:01 -04:00
} else {
if (head == NULL) {
head = p;
2015-07-19 05:12:50 -04:00
}
if (tail != NULL) {
2015-07-16 02:45:01 -04:00
tail->s.ptr = p;
}
tail = p;
tail->s.ptr = NULL; /* We can safely reuse ptr field of dead object */
2014-08-25 00:38:09 -04:00
}
}
}
escape:
/* free! */
2015-07-16 02:45:01 -04:00
while (head != NULL) {
p = head;
head = head->s.ptr;
gc_finalize_object(pic, (struct pic_object *)(p + 1));
2015-07-16 02:45:01 -04:00
heap_free(pic, p + 1);
2014-08-25 00:38:09 -04:00
}
2015-07-16 03:34:59 -04:00
return alive;
2014-08-25 00:38:09 -04:00
}
static void
gc_sweep_phase(pic_state *pic)
{
2015-07-16 03:34:59 -04:00
struct heap_page *page;
2015-06-24 18:14:29 -04:00
khiter_t it;
khash_t(reg) *h;
2015-07-20 02:18:12 -04:00
khash_t(s) *s = &pic->syms;
pic_sym *sym;
2015-07-16 04:23:29 -04:00
struct pic_object *obj;
2015-07-16 03:34:59 -04:00
size_t total = 0, inuse = 0;
2014-09-24 23:12:52 -04:00
2015-06-09 05:31:46 -04:00
/* registries */
while (pic->heap->regs != NULL) {
h = &pic->heap->regs->hash;
2015-06-24 18:14:29 -04:00
for (it = kh_begin(h); it != kh_end(h); ++it) {
if (! kh_exist(h, it))
continue;
2015-07-16 04:23:29 -04:00
obj = kh_key(h, it);
if (obj->u.basic.gc_mark == PIC_GC_UNMARK) {
2015-06-24 18:14:29 -04:00
kh_del(reg, h, it);
2014-09-24 23:12:52 -04:00
}
}
pic->heap->regs = pic->heap->regs->prev;
2015-06-09 05:31:46 -04:00
}
2014-08-25 00:38:09 -04:00
2015-07-20 02:18:12 -04:00
/* symbol table */
for (it = kh_begin(s); it != kh_end(s); ++it) {
if (! kh_exist(s, it))
continue;
sym = kh_val(s, it);
2015-07-16 04:23:29 -04:00
if (sym->gc_mark == PIC_GC_UNMARK) {
2015-07-20 02:18:12 -04:00
kh_del(s, s, it);
}
}
2015-01-20 03:38:34 -05:00
2015-07-16 03:34:59 -04:00
page = pic->heap->pages;
2014-08-25 00:38:09 -04:00
while (page) {
2015-07-16 03:34:59 -04:00
inuse += gc_sweep_page(pic, page);
total += page->endp - page->basep;
2014-08-25 00:38:09 -04:00
page = page->next;
}
2015-07-16 03:34:59 -04:00
if (PIC_PAGE_REQUEST_THRESHOLD(total) <= inuse) {
heap_morecore(pic);
}
2014-08-25 00:38:09 -04:00
}
void
pic_gc_run(pic_state *pic)
{
2015-01-18 22:14:29 -05:00
if (! pic->gc_enable) {
return;
}
2014-08-25 00:38:09 -04:00
gc_mark_phase(pic);
gc_sweep_phase(pic);
}
struct pic_object *
pic_obj_alloc_unsafe(pic_state *pic, size_t size, enum pic_tt tt)
{
struct pic_object *obj;
#if GC_STRESS
pic_gc_run(pic);
#endif
obj = (struct pic_object *)heap_alloc(pic, size);
2014-08-25 00:38:09 -04:00
if (obj == NULL) {
2015-01-18 22:14:46 -05:00
pic_gc_run(pic);
obj = (struct pic_object *)heap_alloc(pic, size);
2014-08-25 00:38:09 -04:00
if (obj == NULL) {
heap_morecore(pic);
obj = (struct pic_object *)heap_alloc(pic, size);
2014-08-25 00:38:09 -04:00
if (obj == NULL)
2014-09-16 12:02:27 -04:00
pic_panic(pic, "GC memory exhausted");
2014-08-25 00:38:09 -04:00
}
}
obj->u.basic.gc_mark = PIC_GC_UNMARK;
obj->u.basic.tt = tt;
2014-08-25 00:38:09 -04:00
return obj;
}
struct pic_object *
pic_obj_alloc(pic_state *pic, size_t size, enum pic_tt tt)
{
struct pic_object *obj;
obj = pic_obj_alloc_unsafe(pic, size, tt);
gc_protect(pic, obj);
return obj;
}