aboutsummaryrefslogtreecommitdiff
path: root/lgc.c
diff options
context:
space:
mode:
authorRoberto Ierusalimschy <roberto@inf.puc-rio.br>2003-02-11 08:46:24 -0200
committerRoberto Ierusalimschy <roberto@inf.puc-rio.br>2003-02-11 08:46:24 -0200
commit7a40cdbda0a171da223094208dd3c6e3eca13922 (patch)
treec95840411ac26e11b0683d4a5fc88402c1d0a70a /lgc.c
parent3cdeacbbfba9308dd2dcc995a9bcc510bfcead31 (diff)
downloadlua-7a40cdbda0a171da223094208dd3c6e3eca13922.tar.gz
lua-7a40cdbda0a171da223094208dd3c6e3eca13922.tar.bz2
lua-7a40cdbda0a171da223094208dd3c6e3eca13922.zip
different variables for number of upvalues and size of upvalue array
(makes code clearer)
Diffstat (limited to 'lgc.c')
-rw-r--r--lgc.c6
1 files changed, 3 insertions, 3 deletions
diff --git a/lgc.c b/lgc.c
index 626756a7..01e8032f 100644
--- a/lgc.c
+++ b/lgc.c
@@ -1,5 +1,5 @@
1/* 1/*
2** $Id: lgc.c,v 1.167 2002/12/19 11:11:55 roberto Exp roberto $ 2** $Id: lgc.c,v 1.168 2003/02/10 17:32:50 roberto Exp roberto $
3** Garbage Collector 3** Garbage Collector
4** See Copyright Notice in lua.h 4** See Copyright Notice in lua.h
5*/ 5*/
@@ -190,7 +190,7 @@ static void traverseproto (GCState *st, Proto *f) {
190 if (ttisstring(f->k+i)) 190 if (ttisstring(f->k+i))
191 stringmark(tsvalue(f->k+i)); 191 stringmark(tsvalue(f->k+i));
192 } 192 }
193 for (i=0; i<f->nupvalues; i++) /* mark upvalue names */ 193 for (i=0; i<f->sizeupvalues; i++) /* mark upvalue names */
194 stringmark(f->upvalues[i]); 194 stringmark(f->upvalues[i]);
195 for (i=0; i<f->sizep; i++) /* mark nested protos */ 195 for (i=0; i<f->sizep; i++) /* mark nested protos */
196 markvalue(st, f->p[i]); 196 markvalue(st, f->p[i]);
@@ -209,7 +209,7 @@ static void traverseclosure (GCState *st, Closure *cl) {
209 } 209 }
210 else { 210 else {
211 int i; 211 int i;
212 lua_assert(cl->l.nupvalues == cl->l.p->nupvalues); 212 lua_assert(cl->l.nupvalues == cl->l.p->nups);
213 markvalue(st, hvalue(&cl->l.g)); 213 markvalue(st, hvalue(&cl->l.g));
214 markvalue(st, cl->l.p); 214 markvalue(st, cl->l.p);
215 for (i=0; i<cl->l.nupvalues; i++) { /* mark its upvalues */ 215 for (i=0; i<cl->l.nupvalues; i++) { /* mark its upvalues */