optimizations for space in LClosures and time cleanning weak tables

author: Roberto Ierusalimschy <roberto@inf.puc-rio.br> 2001-11-06 19:41:53 -0200
committer: Roberto Ierusalimschy <roberto@inf.puc-rio.br> 2001-11-06 19:41:53 -0200
commit: 26bf2adaceb18877d836174226d2bfdc3f1fc512 (patch)
tree: b23ccd2e297e7c5e732ce65e88f35145271f7faa /lgc.c
parent: fd48dcc7c8734091181d8d0e54b0ba3d1770f4c3 (diff)
download: lua-26bf2adaceb18877d836174226d2bfdc3f1fc512.tar.gz
lua-26bf2adaceb18877d836174226d2bfdc3f1fc512.tar.bz2
lua-26bf2adaceb18877d836174226d2bfdc3f1fc512.zip
1 files changed, 52 insertions, 48 deletions
diff --git a/lgc.c b/lgc.c
index abace987..d41b6d51 100644
--- a/lgc.c
+++ b/lgc.c
@@ -1,5 +1,5 @@
 /*
-** $Id: lgc.c,v 1.114 2001/10/25 19:14:14 roberto Exp roberto $
+** $Id: lgc.c,v 1.115 2001/10/31 19:58:11 roberto Exp $
 ** Garbage Collector
 ** See Copyright Notice in lua.h
 */
@@ -22,6 +22,7 @@
 typedef struct GCState {
  Table *tmark;  /* list of marked tables to be visited */
+  Table *toclear;  /* list of visited weak tables (to be cleared after GC) */
 } GCState;
@@ -65,10 +66,10 @@ static void markclosure (GCState *st, Closure *cl) {
      lua_assert(cl->l.nupvalues == cl->l.p->nupvalues);
      protomark(cl->l.p);
      for (i=0; i<cl->l.nupvalues; i++) {  /* mark its upvalues */
-        UpVal *u = cl->l.upvals[i].heap;
+        TObject *u = cl->l.upvals[i];
-        if (u && !u->marked) {
+        if (isclosed(u)) {
-          u->marked = 1;
+          ttype(u-1) = LUA_TNIL;  /* temporary value (to mark as visited) */
-          markobject(st, &u->val);
+          markobject(st, u);
        }
      }
    }
@@ -148,6 +149,10 @@ static void removekey (Node *n) {
 static void traversetable (GCState *st, Table *h) {
  int i;
  int mode = h->weakmode;
+  if (mode) {  /* weak table? must be cleared after GC... */
+    h->mark = st->toclear;  /* put in the appropriate list */
+    st->toclear = h;
+  }
  if (!(mode & LUA_WEAK_VALUE)) {
    i = sizearray(h);
    while (i--)
@@ -167,17 +172,15 @@ static void traversetable (GCState *st, Table *h) {
 }
-static void markall (lua_State *L) {
+static void markall (lua_State *L, GCState *st) {
-  GCState st;
+  marktagmethods(G(L), st);  /* mark tag methods */
-  st.tmark = NULL;
+  markstacks(L, st); /* mark all stacks */
-  marktagmethods(G(L), &st);  /* mark tag methods */
+  marktable(st, G(L)->type2tag);
-  markstacks(L, &st); /* mark all stacks */
+  markobject(st, &G(L)->registry);
-  marktable(&st, G(L)->type2tag);
+  while (st->tmark) {  /* mark tables */
-  markobject(&st, &G(L)->registry);
+    Table *h = st->tmark;  /* get first table from list */
-  while (st.tmark) {  /* mark tables */
+    st->tmark = h->mark;  /* remove it from list */
-    Table *h = st.tmark;  /* get first table from list */
+    traversetable(st, h);
-    st.tmark = h->mark;  /* remove it from list */
-    traversetable(&st, h);
  }
 }
@@ -198,30 +201,27 @@ static int hasmark (const TObject *o) {
 }
-static void cleardeadnodes (Table *h) {
+/*
-  int i;
+** clear (set to nil) keys and values from weaktables that were collected
-  i = sizearray(h);
+*/
-  while (i--) {
+static void cleartables (Table *h) {
-    TObject *o = &h->array[i];
+  for (; h; h = h->mark) {
-    if (!hasmark(o))
+    int i;
-      setnilvalue(o);  /* remove value */
+    lua_assert(h->weakmode);
-  }
+    i = sizearray(h);
-  i = sizenode(h);
+    while (i--) {
-  while (i--) {
+      TObject *o = &h->array[i];
-    Node *n = node(h, i);
+      if (!hasmark(o))
-    if (!hasmark(val(n)) || !hasmark(key(n))) {
+        setnilvalue(o);  /* remove value */
-      setnilvalue(val(n));  /* remove value ... */
+    }
-      removekey(n);  /* ... and key */
+    i = sizenode(h);
+    while (i--) {
+      Node *n = node(h, i);
+      if (!hasmark(val(n)) || !hasmark(key(n))) {
+        setnilvalue(val(n));  /* remove value ... */
+        removekey(n);  /* ... and key */
+      }
    }
-  }
-}
-static void cleartables (global_State *G) {
-  Table *h;
-  for (h = G->roottable; h; h = h->next) {
-    if (h->weakmode && ismarked(h))
-      cleardeadnodes(h);
  }
 }
@@ -284,16 +284,17 @@ static void collecttable (lua_State *L) {
 static void collectupval (lua_State *L) {
-  UpVal **v = &G(L)->rootupval;
+  TObject **v = &G(L)->rootupval;
-  UpVal *curr;
+  TObject *curr;
  while ((curr = *v) != NULL) {
-    if (curr->marked) {
+    if (ttype(curr) == LUA_TNIL) {  /* was marked? */
-      curr->marked = 0;
+      ttype(curr) = LUA_HEAPUPVAL;  /* unmark */
-      v = &curr->next;
+      v = &vvalue(curr);  /* next */
    }
    else {
-      *v = curr->next;
+      lua_assert(ttype(curr) == LUA_HEAPUPVAL);
-      luaM_freelem(L, curr);
+      *v = vvalue(curr);  /* next */
+      luaM_freearray(L, curr, 2, TObject);
    }
  }
 }
@@ -411,8 +412,11 @@ void luaC_collect (lua_State *L, int all) {
 void luaC_collectgarbage (lua_State *L) {
-  markall(L);
+  GCState st;
-  cleartables(G(L));
+  st.tmark = NULL;
+  st.toclear = NULL;
+  markall(L, &st);
+  cleartables(st.toclear);
  luaC_collect(L, 0);
  checkMbuffer(L);
  G(L)->GCthreshold = 2*G(L)->nblocks;  /* new threshold */
author	Roberto Ierusalimschy <roberto@inf.puc-rio.br>	2001-11-06 19:41:53 -0200
committer	Roberto Ierusalimschy <roberto@inf.puc-rio.br>	2001-11-06 19:41:53 -0200
commit	26bf2adaceb18877d836174226d2bfdc3f1fc512 (patch)
tree	b23ccd2e297e7c5e732ce65e88f35145271f7faa /lgc.c
parent	fd48dcc7c8734091181d8d0e54b0ba3d1770f4c3 (diff)
download	lua-26bf2adaceb18877d836174226d2bfdc3f1fc512.tar.gz lua-26bf2adaceb18877d836174226d2bfdc3f1fc512.tar.bz2 lua-26bf2adaceb18877d836174226d2bfdc3f1fc512.zip