lua/lfunc.c

176 lines
4.5 KiB
C
Raw Normal View History

1997-09-16 23:25:59 +04:00
/*
** $Id: lfunc.c,v 2.17 2009/11/26 11:39:20 roberto Exp roberto $
1998-06-19 20:14:09 +04:00
** Auxiliary functions to manipulate prototypes and closures
1997-09-16 23:25:59 +04:00
** See Copyright Notice in lua.h
*/
2003-10-02 23:21:09 +04:00
#include <stddef.h>
1997-09-16 23:25:59 +04:00
2002-12-04 20:38:31 +03:00
#define lfunc_c
#define LUA_CORE
2002-12-04 20:38:31 +03:00
#include "lua.h"
1997-09-16 23:25:59 +04:00
#include "lfunc.h"
#include "lgc.h"
1997-09-16 23:25:59 +04:00
#include "lmem.h"
#include "lobject.h"
#include "lopcodes.h"
#include "lstate.h"
1997-09-16 23:25:59 +04:00
Closure *luaF_newCclosure (lua_State *L, int nelems, Table *e) {
Closure *c = cast(Closure *, luaM_malloc(L, sizeCclosure(nelems)));
luaC_link(L, obj2gco(c), LUA_TFUNCTION);
2001-10-02 20:45:03 +04:00
c->c.isC = 1;
c->c.env = e;
2005-12-22 19:19:56 +03:00
c->c.nupvalues = cast_byte(nelems);
1997-09-16 23:25:59 +04:00
return c;
}
Closure *luaF_newLclosure (lua_State *L, int nelems, Table *e) {
Closure *c = cast(Closure *, luaM_malloc(L, sizeLclosure(nelems)));
luaC_link(L, obj2gco(c), LUA_TFUNCTION);
2001-10-02 20:45:03 +04:00
c->l.isC = 0;
c->l.env = e;
2005-12-22 19:19:56 +03:00
c->l.nupvalues = cast_byte(nelems);
2004-03-16 00:04:33 +03:00
while (nelems--) c->l.upvals[nelems] = NULL;
return c;
}
UpVal *luaF_newupval (lua_State *L) {
UpVal *uv = luaM_new(L, UpVal);
luaC_link(L, obj2gco(uv), LUA_TUPVAL);
2005-01-18 20:18:09 +03:00
uv->v = &uv->u.value;
setnilvalue(uv->v);
return uv;
}
UpVal *luaF_findupval (lua_State *L, StkId level) {
2005-01-18 20:18:09 +03:00
global_State *g = G(L);
GCObject **pp = &L->openupval;
2002-11-13 14:32:26 +03:00
UpVal *p;
UpVal *uv;
while (*pp != NULL && (p = gco2uv(*pp))->v >= level) {
2005-01-18 20:18:09 +03:00
lua_assert(p->v != &p->u.value);
if (p->v == level) { /* found a corresponding upvalue? */
2005-02-10 16:25:02 +03:00
if (isdead(g, obj2gco(p))) /* is it dead? */
2009-11-26 14:39:20 +03:00
changewhite(obj2gco(p)); /* ressurrect it */
return p;
}
2002-11-13 14:32:26 +03:00
pp = &p->next;
}
uv = luaM_new(L, UpVal); /* not found: create a new one */
uv->tt = LUA_TUPVAL;
2005-01-18 20:18:09 +03:00
uv->marked = luaC_white(g);
uv->v = level; /* current value lives in the stack */
uv->next = *pp; /* chain it in the proper position */
*pp = obj2gco(uv);
2005-01-18 20:18:09 +03:00
uv->u.l.prev = &g->uvhead; /* double link it in `uvhead' list */
uv->u.l.next = g->uvhead.u.l.next;
uv->u.l.next->u.l.prev = uv;
g->uvhead.u.l.next = uv;
lua_assert(uv->u.l.next->u.l.prev == uv && uv->u.l.prev->u.l.next == uv);
return uv;
}
2005-01-18 20:18:09 +03:00
static void unlinkupval (UpVal *uv) {
lua_assert(uv->u.l.next->u.l.prev == uv && uv->u.l.prev->u.l.next == uv);
uv->u.l.next->u.l.prev = uv->u.l.prev; /* remove from `uvhead' list */
uv->u.l.prev->u.l.next = uv->u.l.next;
}
void luaF_freeupval (lua_State *L, UpVal *uv) {
if (uv->v != &uv->u.value) /* is it open? */
unlinkupval(uv); /* remove from open list */
luaM_free(L, uv); /* free upvalue */
}
void luaF_close (lua_State *L, StkId level) {
UpVal *uv;
2004-03-16 00:04:33 +03:00
global_State *g = G(L);
while (L->openupval != NULL && (uv = gco2uv(L->openupval))->v >= level) {
2004-03-16 00:04:33 +03:00
GCObject *o = obj2gco(uv);
2005-01-18 20:18:09 +03:00
lua_assert(!isblack(o) && uv->v != &uv->u.value);
L->openupval = uv->next; /* remove from `open' list */
2004-03-16 00:04:33 +03:00
if (isdead(g, o))
2005-01-18 20:18:09 +03:00
luaF_freeupval(L, uv); /* free upvalue */
2004-03-16 00:04:33 +03:00
else {
2005-01-18 20:18:09 +03:00
unlinkupval(uv);
setobj(L, &uv->u.value, uv->v);
uv->v = &uv->u.value; /* now current value lives here */
2004-03-16 00:04:33 +03:00
luaC_linkupval(L, uv); /* link upvalue into `gcroot' list */
}
}
}
2000-03-10 21:37:44 +03:00
Proto *luaF_newproto (lua_State *L) {
Proto *f = luaM_new(L, Proto);
luaC_link(L, obj2gco(f), LUA_TPROTO);
f->k = NULL;
f->sizek = 0;
2001-06-28 18:57:17 +04:00
f->p = NULL;
f->sizep = 0;
1997-09-16 23:25:59 +04:00
f->code = NULL;
f->sizecode = 0;
f->lineinfo = NULL;
f->sizelineinfo = 0;
f->upvalues = NULL;
f->sizeupvalues = 0;
2000-10-10 23:52:58 +04:00
f->numparams = 0;
f->is_vararg = 0;
f->maxstacksize = 0;
f->locvars = NULL;
f->sizelocvars = 0;
f->linedefined = 0;
f->lastlinedefined = 0;
f->source = NULL;
f->envreg = NO_REG;
1997-09-16 23:25:59 +04:00
return f;
}
2000-03-10 21:37:44 +03:00
void luaF_freeproto (lua_State *L, Proto *f) {
luaM_freearray(L, f->code, f->sizecode);
luaM_freearray(L, f->p, f->sizep);
luaM_freearray(L, f->k, f->sizek);
luaM_freearray(L, f->lineinfo, f->sizelineinfo);
luaM_freearray(L, f->locvars, f->sizelocvars);
luaM_freearray(L, f->upvalues, f->sizeupvalues);
2004-11-24 22:20:21 +03:00
luaM_free(L, f);
1997-09-16 23:25:59 +04:00
}
void luaF_freeclosure (lua_State *L, Closure *c) {
2001-10-02 20:45:03 +04:00
int size = (c->c.isC) ? sizeCclosure(c->c.nupvalues) :
sizeLclosure(c->l.nupvalues);
2004-11-24 22:20:21 +03:00
luaM_freemem(L, c, size);
1997-09-16 23:25:59 +04:00
}
/*
1999-12-27 20:33:22 +03:00
** Look for n-th local variable at line `line' in function `func'.
1997-09-16 23:25:59 +04:00
** Returns NULL if not found.
*/
const char *luaF_getlocalname (const Proto *f, int local_number, int pc) {
int i;
for (i = 0; i<f->sizelocvars && f->locvars[i].startpc <= pc; i++) {
if (pc < f->locvars[i].endpc) { /* is variable active? */
local_number--;
if (local_number == 0)
return getstr(f->locvars[i].varname);
1997-09-16 23:25:59 +04:00
}
}
return NULL; /* not found */
1997-09-16 23:25:59 +04:00
}