/*
** $Id: $
** Garbage Collector
** See Copyright Notice in lua.h
*/


#include "ldo.h"
#include "lfunc.h"
#include "lgc.h"
#include "lglobal.h"
#include "lmem.h"
#include "lobject.h"
#include "lstring.h"
#include "ltable.h"
#include "ltm.h"
#include "lua.h"



static int markobject (TObject *o);



/*
** =======================================================
** REF mechanism
** =======================================================
*/

static struct ref {
  TObject o;
  enum {LOCK, HOLD, FREE, COLLECTED} status;
} *refArray = NULL;
static int refSize = 0;


int luaC_ref (TObject *o, int lock)
{
  int ref;
  if (ttype(o) == LUA_T_NIL)
    ref = -1;   /* special ref for nil */
  else {
    for (ref=0; ref<refSize; ref++)
      if (refArray[ref].status == FREE)
        goto found;
    /* no more empty spaces */ {
      int oldSize = refSize;
      refSize = luaM_growvector(&refArray, refSize, struct ref, refEM, MAX_WORD);
      for (ref=oldSize; ref<refSize; ref++)
        refArray[ref].status = FREE;
      ref = oldSize;
    } found:
    refArray[ref].o = *o;
    refArray[ref].status = lock ? LOCK : HOLD;
  }
  return ref;
}


void lua_unref (int ref)
{
  if (ref >= 0 && ref < refSize)
    refArray[ref].status = FREE;
}


TObject* luaC_getref (int ref)
{
  static TObject nul = {LUA_T_NIL, {0}};
  if (ref == -1)
    return &nul;
  if (ref >= 0 && ref < refSize &&
      (refArray[ref].status == LOCK || refArray[ref].status == HOLD))
    return &refArray[ref].o;
  else
    return NULL;
}


static void travlock (void)
{
  int i;
  for (i=0; i<refSize; i++)
    if (refArray[i].status == LOCK)
      markobject(&refArray[i].o);
}


static int ismarked (TObject *o)
{
  switch (o->ttype) {
    case LUA_T_STRING: case LUA_T_USERDATA:
      return o->value.ts->marked;
    case LUA_T_FUNCTION:
      return o->value.cl->head.marked;
    case LUA_T_PROTO:
      return o->value.tf->head.marked;
    case LUA_T_ARRAY:
      return o->value.a->head.marked;
    default:  /* nil, number or cfunction */
      return 1;
  }
}


static void invalidaterefs (void)
{
  int i;
  for (i=0; i<refSize; i++)
    if (refArray[i].status == HOLD && !ismarked(&refArray[i].o))
      refArray[i].status = COLLECTED;
}



static void hashcallIM (Hash *l)
{
  TObject t;
  ttype(&t) = LUA_T_ARRAY;
  for (; l; l=(Hash *)l->head.next) {
    avalue(&t) = l;
    luaD_gcIM(&t);
  }
}


static void strcallIM (TaggedString *l)
{
  TObject o;
  ttype(&o) = LUA_T_USERDATA;
  for (; l; l=l->uu.next) {
    tsvalue(&o) = l;
    luaD_gcIM(&o);
  }
}



static GCnode *listcollect (GCnode **root)
{
  GCnode *curr = *root, *prev = NULL, *frees = NULL;
  while (curr) {
    GCnode *next = curr->next;
    if (!curr->marked) {
      if (prev == NULL)
        *root = next;
      else
        prev->next = next;
      curr->next = frees;
      frees = curr;
      --luaO_nentities;
    }
    else {
      curr->marked = 0;
      prev = curr;
    }
    curr = next;
  }
  return frees;
}



static void strmark (TaggedString *s)
{
  if (!s->marked)
    s->marked = 1;
}


static void protomark (TProtoFunc *f)
{
  if (!f->head.marked) {
    LocVar *v = f->locvars;
    int i;
    f->head.marked = 1;
    if (f->fileName)
      strmark(f->fileName);
    for (i=0; i<f->nconsts; i++)
      markobject(&f->consts[i]);
    if (v) {
      for (; v->line != -1; v++)
        if (v->varname)
          strmark(v->varname);
    }
  }
}


static void funcmark (Closure *f)
{
  if (!f->head.marked) {
    int i;
    f->head.marked = 1;
    for (i=f->consts[0].value.tf->nupvalues; i>=0; i--)
      markobject(&f->consts[i]);
  }
}


static void hashmark (Hash *h)
{
  if (!h->head.marked) {
    int i;
    h->head.marked = 1;
    for (i=0; i<nhash(h); i++) {
      Node *n = node(h,i);
      if (ttype(ref(n)) != LUA_T_NIL) {
        markobject(&n->ref);
        markobject(&n->val);
      }
    }
  }
}


static int markobject (TObject *o)
{
  switch (ttype(o)) {
    case LUA_T_USERDATA:  case LUA_T_STRING:
      strmark(tsvalue(o));
      break;
    case LUA_T_ARRAY:
      hashmark(avalue(o));
      break;
    case LUA_T_FUNCTION:  case LUA_T_MARK:
      funcmark(o->value.cl);
      break;
    case LUA_T_PROTO:
      protomark(o->value.tf);
      break;
    default: break;  /* numbers, cfunctions, etc */
  }
  return 0;
}


static void call_nilIM (void)
{ /* signals end of garbage collection */
  TObject t;
  ttype(&t) = LUA_T_NIL;
  luaD_gcIM(&t);  /* end of list */
}



#define GARBAGE_BLOCK 150

long luaC_threshold = GARBAGE_BLOCK;


static void markall (void)
{
  luaD_travstack(markobject); /* mark stack objects */
  luaG_travsymbol(markobject); /* mark symbol table objects */
  travlock(); /* mark locked objects */
  luaT_travtagmethods(markobject);  /* mark fallbacks */
}


long lua_collectgarbage (long limit)
{
  long recovered = luaO_nentities;  /* to subtract luaM_new value after gc */
  Hash *freetable;
  TaggedString *freestr;
  TProtoFunc *freefunc;
  Closure *freeclos;
  markall();
  invalidaterefs();
  freestr = luaS_collector();
  freetable = (Hash *)listcollect((GCnode **)&luaH_root);
  freefunc = (TProtoFunc *)listcollect((GCnode **)&luaF_root);
  freeclos = (Closure *)listcollect((GCnode **)&luaF_rootcl);
  recovered = recovered-luaO_nentities;
/*printf("==total %ld  coletados %ld\n", luaO_nentities+recovered, recovered);*/
  luaC_threshold = (limit == 0) ? 2*luaO_nentities : luaO_nentities+limit;
  hashcallIM(freetable);
  strcallIM(freestr);
  call_nilIM();
  luaH_free(freetable);
  luaS_free(freestr);
  luaF_freeproto(freefunc);
  luaF_freeclosure(freeclos);
  luaM_clearbuffer();
  return recovered;
}


void luaC_checkGC (void)
{
  if (luaO_nentities >= luaC_threshold)
    lua_collectgarbage(0);
}