diff options
| author | Roberto Ierusalimschy <roberto@inf.puc-rio.br> | 2001-12-05 18:15:18 -0200 |
|---|---|---|
| committer | Roberto Ierusalimschy <roberto@inf.puc-rio.br> | 2001-12-05 18:15:18 -0200 |
| commit | 592a309177edc52847b1196969ad6d49ba21f4fb (patch) | |
| tree | 06add977885c012ee22cc4f105785c435b6af353 /lfunc.c | |
| parent | 413fc7334bf8ceaea71417d73edef15c99d3a793 (diff) | |
| download | lua-592a309177edc52847b1196969ad6d49ba21f4fb.tar.gz lua-592a309177edc52847b1196969ad6d49ba21f4fb.tar.bz2 lua-592a309177edc52847b1196969ad6d49ba21f4fb.zip | |
tag system replaced by event tables
Diffstat (limited to 'lfunc.c')
| -rw-r--r-- | lfunc.c | 4 |
1 files changed, 1 insertions, 3 deletions
| @@ -1,5 +1,5 @@ | |||
| 1 | /* | 1 | /* |
| 2 | ** $Id: lfunc.c,v 1.49 2001/11/06 21:41:53 roberto Exp $ | 2 | ** $Id: lfunc.c,v 1.1 2001/11/29 22:14:34 rieru Exp rieru $ |
| 3 | ** Auxiliary functions to manipulate prototypes and closures | 3 | ** Auxiliary functions to manipulate prototypes and closures |
| 4 | ** See Copyright Notice in lua.h | 4 | ** See Copyright Notice in lua.h |
| 5 | */ | 5 | */ |
| @@ -54,7 +54,6 @@ UpVal *luaF_findupval (lua_State *L, StkId level) { | |||
| 54 | } | 54 | } |
| 55 | p = luaM_new(L, UpVal); /* not found: create a new one */ | 55 | p = luaM_new(L, UpVal); /* not found: create a new one */ |
| 56 | p->v = level; /* current value lives in the stack */ | 56 | p->v = level; /* current value lives in the stack */ |
| 57 | p->mark = 1; /* won't participate in GC while open */ | ||
| 58 | p->next = *pp; /* chain it in the proper position */ | 57 | p->next = *pp; /* chain it in the proper position */ |
| 59 | *pp = p; | 58 | *pp = p; |
| 60 | return p; | 59 | return p; |
| @@ -68,7 +67,6 @@ void luaF_close (lua_State *L, StkId level) { | |||
| 68 | p->v = &p->value; /* now current value lives here */ | 67 | p->v = &p->value; /* now current value lives here */ |
| 69 | L->openupval = p->next; /* remove from `open' list */ | 68 | L->openupval = p->next; /* remove from `open' list */ |
| 70 | p->next = G(L)->rootupval; /* chain in `closed' list */ | 69 | p->next = G(L)->rootupval; /* chain in `closed' list */ |
| 71 | p->mark = 0; /* now it can be collected */ | ||
| 72 | G(L)->rootupval = p; | 70 | G(L)->rootupval = p; |
| 73 | } | 71 | } |
| 74 | } | 72 | } |