lua/lfunc.c

134 lines
3.3 KiB
C
Raw Normal View History

1997-09-16 23:25:59 +04:00
/*
** $Id: lfunc.c,v 1.56 2002/05/02 13:06: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
*/
#include <stdlib.h>
#include "lua.h"
1997-09-16 23:25:59 +04:00
#include "lfunc.h"
#include "lmem.h"
#include "lobject.h"
#include "lstate.h"
1997-09-16 23:25:59 +04:00
2001-10-02 20:45:03 +04:00
#define sizeCclosure(n) (cast(int, sizeof(CClosure)) + \
2001-08-31 23:46:07 +04:00
cast(int, sizeof(TObject)*((n)-1)))
1997-09-16 23:25:59 +04:00
2001-10-02 20:45:03 +04:00
#define sizeLclosure(n) (cast(int, sizeof(LClosure)) + \
cast(int, sizeof(TObject *)*((n)-1)))
1997-09-16 23:25:59 +04:00
Closure *luaF_newCclosure (lua_State *L, int nelems) {
Closure *c = cast(Closure *, luaM_malloc(L, sizeCclosure(nelems)));
2001-10-02 20:45:03 +04:00
c->c.isC = 1;
c->c.next = G(L)->rootcl;
G(L)->rootcl = c;
2001-10-02 20:45:03 +04:00
c->c.marked = 0;
c->c.nupvalues = cast(lu_byte, nelems);
1997-09-16 23:25:59 +04:00
return c;
}
Closure *luaF_newLclosure (lua_State *L, int nelems, TObject *gt) {
Closure *c = cast(Closure *, luaM_malloc(L, sizeLclosure(nelems)));
2001-10-02 20:45:03 +04:00
c->l.isC = 0;
c->c.next = G(L)->rootcl;
G(L)->rootcl = c;
2001-10-02 20:45:03 +04:00
c->l.marked = 0;
c->l.g = *gt;
c->l.nupvalues = cast(lu_byte, nelems);
return c;
}
UpVal *luaF_findupval (lua_State *L, StkId level) {
UpVal **pp = &L->openupval;
UpVal *p;
while ((p = *pp) != NULL && p->v >= level) {
if (p->v == level) return p;
pp = &p->next;
}
p = luaM_new(L, UpVal); /* not found: create a new one */
p->v = level; /* current value lives in the stack */
p->next = *pp; /* chain it in the proper position */
*pp = p;
return p;
}
void luaF_close (lua_State *L, StkId level) {
UpVal *p;
while ((p = L->openupval) != NULL && p->v >= level) {
setobj(&p->value, p->v); /* save current value */
p->v = &p->value; /* now current value lives here */
L->openupval = p->next; /* remove from `open' list */
p->next = G(L)->rootupval; /* chain in `closed' list */
G(L)->rootupval = p;
}
}
2000-03-10 21:37:44 +03:00
Proto *luaF_newproto (lua_State *L) {
Proto *f = luaM_new(L, Proto);
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;
2001-02-20 21:28:11 +03:00
f->nupvalues = 0;
2000-10-10 23:52:58 +04:00
f->numparams = 0;
f->is_vararg = 0;
f->maxstacksize = 0;
f->marked = 0;
2000-08-08 22:26:05 +04:00
f->lineinfo = NULL;
f->sizelocvars = 0;
2000-10-10 23:52:58 +04:00
f->locvars = NULL;
1997-09-16 23:25:59 +04:00
f->lineDefined = 0;
f->source = NULL;
f->next = G(L)->rootproto; /* chain in list of protos */
G(L)->rootproto = f;
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, Instruction);
if (f->lineinfo)
luaM_freearray(L, f->lineinfo, f->sizecode, int);
luaM_freearray(L, f->locvars, f->sizelocvars, struct LocVar);
luaM_freearray(L, f->k, f->sizek, TObject);
2001-06-28 18:57:17 +04:00
luaM_freearray(L, f->p, f->sizep, Proto *);
luaM_freelem(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);
luaM_free(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
}