static void
check_svalue(svalue_t * v)
{
register int idx;
nested++;
if (nested > MAX_RECURSION) {
return;
}
switch (v->type) {
case T_OBJECT:
if (v->u.ob->flags & O_DESTRUCTED) {
free_svalue(v, "reclaim_objects");
*v = const0u;
cleaned++;
}
break;
case T_MAPPING:
gc_mapping(v->u.map);
break;
case T_ARRAY:
case T_CLASS:
for (idx = 0; idx < v->u.arr->size; idx++)
check_svalue(&v->u.arr->item[idx]);
break;
case T_FUNCTION:
{
svalue_t tmp;
program_t *prog;
if (v->u.fp->hdr.owner && (v->u.fp->hdr.owner->flags & O_DESTRUCTED)) {
if (v->u.fp->hdr.type == FP_LOCAL | FP_NOT_BINDABLE) {
prog = v->u.fp->hdr.owner->prog;
prog->func_ref--;
debug(d_flag, ("subtr func ref /%s: now %i\n",
prog->name, prog->func_ref));
if (!prog->ref && !prog->func_ref)
deallocate_program(prog);
}
free_object(v->u.fp->hdr.owner, "reclaim_objects");
v->u.fp->hdr.owner = 0;
cleaned++;
}
tmp.type = T_ARRAY;
if ((tmp.u.arr = v->u.fp->hdr.args))
check_svalue(&tmp);
break;
}
}
nested--;
return;
}
int reclaim_objects()
{
int i;
object_t *ob;
cleaned = nested = 0;
for (ob = obj_list; ob; ob = ob->next_all)
if (ob->prog)
for (i = 0; i < (int) ob->prog->num_variables_total; i++)
check_svalue(&ob->variables[i]);
return cleaned;
}
static void
gc_mapping P1(mapping_t *, m)
{
/* Be careful to correctly handle destructed mapping keys. We can't
* just call check_svalue() b/c the hash would be wrong and the '0'
* element we add would be unreferenceable (in most cases)
*/
mapping_node_t **prev, *elt;
int j = (int) m->table_size;
do {
prev = m->table + j;
while ((elt = *prev)) {
if (elt->values[0].type == T_OBJECT) {
if (elt->values[0].u.ob->flags & O_DESTRUCTED) {
free_object(elt->values[0].u.ob, "gc_mapping");
/* found one, do a map_delete() */
if (!(*prev = elt->next) && !m->table[j])
m->unfilled++;
cleaned++;
m->count--;
total_mapping_nodes--;
total_mapping_size -= sizeof(mapping_node_t);
free_svalue(elt->values + 1, "gc_mapping");
free_node(elt);
continue;
}
} else {
/* in case the key is a mapping or something */
check_svalue(elt->values);
}
check_svalue(elt->values+1);
prev = &(elt->next);
}
} while (j--);
}
static void
check_svalue P1(svalue_t *, v)
{
register int idx;
nested++;
if (nested > MAX_RECURSION) {
return;
}
switch (v->type) {
case T_OBJECT:
if (v->u.ob->flags & O_DESTRUCTED) {
free_svalue(v, "reclaim_objects");
*v = const0u;
cleaned++;
}
break;
case T_MAPPING:
gc_mapping(v->u.map);
break;
case T_ARRAY:
case T_CLASS:
for (idx = 0; idx < v->u.arr->size; idx++)
check_svalue(&v->u.arr->item[idx]);
break;
case T_FUNCTION:
{
svalue_t tmp;
tmp.type = T_ARRAY;
if ((tmp.u.arr = v->u.fp->hdr.args))
check_svalue(&tmp);
break;
}
}
nested--;
return;
}
