You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

665 lines
12 KiB

/*
** $Id: lapi.c,v 1.118 2001/01/19 13:20:30 roberto Exp roberto $
** Lua API
** See Copyright Notice in lua.h
*/
#include <string.h>
#include "lua.h"
#include "lapi.h"
#include "ldo.h"
#include "lfunc.h"
#include "lgc.h"
#include "lmem.h"
#include "lobject.h"
#include "lstate.h"
#include "lstring.h"
#include "ltable.h"
#include "ltm.h"
#include "lvm.h"
const char lua_ident[] = "$Lua: " LUA_VERSION " " LUA_COPYRIGHT " $\n"
"$Authors: " LUA_AUTHORS " $";
#define Index(L,i) ((i) >= 0 ? (L->Cbase+((i)-1)) : (L->top+(i)))
#define api_incr_top(L) incr_top
TObject *luaA_index (lua_State *L, int index) {
return Index(L, index);
}
static TObject *luaA_indexAcceptable (lua_State *L, int index) {
if (index >= 0) {
TObject *o = L->Cbase+(index-1);
if (o >= L->top) return NULL;
else return o;
}
else return L->top+index;
}
void luaA_pushobject (lua_State *L, const TObject *o) {
setobj(L->top, o);
incr_top;
}
24 years ago
LUA_API int lua_stackspace (lua_State *L) {
int i;
LUA_ENTRY;
i = (L->stack_last - L->top);
LUA_EXIT;
return i;
}
/*
** basic stack manipulation
*/
24 years ago
LUA_API int lua_gettop (lua_State *L) {
int i;
LUA_ENTRY;
i = (L->top - L->Cbase);
LUA_EXIT;
return i;
}
24 years ago
LUA_API void lua_settop (lua_State *L, int index) {
LUA_ENTRY;
if (index >= 0)
luaD_adjusttop(L, L->Cbase, index);
else
L->top = L->top+index+1; /* index is negative */
LUA_EXIT;
}
24 years ago
LUA_API void lua_remove (lua_State *L, int index) {
StkId p;
LUA_ENTRY;
p = luaA_index(L, index);
while (++p < L->top) setobj(p-1, p);
L->top--;
LUA_EXIT;
}
24 years ago
LUA_API void lua_insert (lua_State *L, int index) {
StkId p;
StkId q;
LUA_ENTRY;
p = luaA_index(L, index);
for (q = L->top; q>p; q--) setobj(q, q-1);
setobj(p, L->top);
LUA_EXIT;
}
24 years ago
LUA_API void lua_pushvalue (lua_State *L, int index) {
LUA_ENTRY;
setobj(L->top, luaA_index(L, index));
api_incr_top(L);
LUA_EXIT;
}
/*
** access functions (stack -> C)
*/
24 years ago
LUA_API int lua_type (lua_State *L, int index) {
StkId o;
int i;
LUA_ENTRY;
o = luaA_indexAcceptable(L, index);
i = (o == NULL) ? LUA_TNONE : ttype(o);
LUA_EXIT;
return i;
}
24 years ago
LUA_API const char *lua_typename (lua_State *L, int t) {
const char *s;
LUA_ENTRY;
UNUSED(L);
s = (t == LUA_TNONE) ? "no value" : luaO_typenames[t];
LUA_EXIT;
return s;
}
24 years ago
LUA_API int lua_iscfunction (lua_State *L, int index) {
StkId o;
int i;
LUA_ENTRY;
o = luaA_indexAcceptable(L, index);
i = (o == NULL) ? 0 : iscfunction(o);
LUA_EXIT;
return i;
}
24 years ago
LUA_API int lua_isnumber (lua_State *L, int index) {
TObject *o;
int i;
LUA_ENTRY;
o = luaA_indexAcceptable(L, index);
i = (o == NULL) ? 0 : (tonumber(o) == 0);
LUA_EXIT;
return i;
}
24 years ago
LUA_API int lua_isstring (lua_State *L, int index) {
int t = lua_type(L, index);
return (t == LUA_TSTRING || t == LUA_TNUMBER);
}
24 years ago
24 years ago
LUA_API int lua_tag (lua_State *L, int index) {
StkId o;
int i;
LUA_ENTRY;
o = luaA_indexAcceptable(L, index);
i = (o == NULL) ? LUA_NOTAG : luaT_tag(o);
LUA_EXIT;
return i;
}
24 years ago
LUA_API int lua_equal (lua_State *L, int index1, int index2) {
StkId o1, o2;
int i;
LUA_ENTRY;
o1 = luaA_indexAcceptable(L, index1);
o2 = luaA_indexAcceptable(L, index2);
i = (o1 == NULL || o2 == NULL) ? 0 /* index out-of-range */
: luaO_equalObj(o1, o2);
LUA_EXIT;
return i;
}
24 years ago
LUA_API int lua_lessthan (lua_State *L, int index1, int index2) {
StkId o1, o2;
int i;
LUA_ENTRY;
o1 = luaA_indexAcceptable(L, index1);
o2 = luaA_indexAcceptable(L, index2);
i = (o1 == NULL || o2 == NULL) ? 0 /* index out-of-range */
: luaV_lessthan(L, o1, o2, L->top);
LUA_EXIT;
return i;
}
LUA_API lua_Number lua_tonumber (lua_State *L, int index) {
StkId o;
lua_Number n;
LUA_ENTRY;
o = luaA_indexAcceptable(L, index);
n = (o == NULL || tonumber(o)) ? 0 : nvalue(o);
LUA_EXIT;
return n;
}
24 years ago
LUA_API const char *lua_tostring (lua_State *L, int index) {
StkId o;
const char *s;
LUA_ENTRY;
o = luaA_indexAcceptable(L, index);
s = (o == NULL || tostring(L, o)) ? NULL : svalue(o);
LUA_EXIT;
return s;
}
24 years ago
LUA_API size_t lua_strlen (lua_State *L, int index) {
StkId o;
size_t l;
LUA_ENTRY;
o = luaA_indexAcceptable(L, index);
l = (o == NULL || tostring(L, o)) ? 0 : tsvalue(o)->len;
LUA_EXIT;
return l;
}
24 years ago
LUA_API lua_CFunction lua_tocfunction (lua_State *L, int index) {
StkId o;
lua_CFunction f;
LUA_ENTRY;
o = luaA_indexAcceptable(L, index);
f = (o == NULL || !iscfunction(o)) ? NULL : clvalue(o)->f.c;
LUA_EXIT;
return f;
}
24 years ago
LUA_API void *lua_touserdata (lua_State *L, int index) {
StkId o;
void *p;
LUA_ENTRY;
o = luaA_indexAcceptable(L, index);
p = (o == NULL || ttype(o) != LUA_TUSERDATA) ? NULL :
24 years ago
tsvalue(o)->u.d.value;
LUA_EXIT;
return p;
}
24 years ago
LUA_API const void *lua_topointer (lua_State *L, int index) {
StkId o;
const void *p;
LUA_ENTRY;
o = luaA_indexAcceptable(L, index);
if (o == NULL) p = NULL;
else {
switch (ttype(o)) {
case LUA_TTABLE:
p = hvalue(o);
break;
case LUA_TFUNCTION:
p = clvalue(o);
break;
default:
p = NULL;
break;
}
}
LUA_EXIT;
return p;
}
/*
** push functions (C -> stack)
*/
24 years ago
LUA_API void lua_pushnil (lua_State *L) {
LUA_ENTRY;
setnilvalue(L->top);
api_incr_top(L);
LUA_EXIT;
}
LUA_API void lua_pushnumber (lua_State *L, lua_Number n) {
LUA_ENTRY;
setnvalue(L->top, n);
api_incr_top(L);
LUA_EXIT;
}
24 years ago
LUA_API void lua_pushlstring (lua_State *L, const char *s, size_t len) {
LUA_ENTRY;
setsvalue(L->top, luaS_newlstr(L, s, len));
api_incr_top(L);
LUA_EXIT;
}
24 years ago
LUA_API void lua_pushstring (lua_State *L, const char *s) {
if (s == NULL)
lua_pushnil(L);
else
lua_pushlstring(L, s, strlen(s));
}
24 years ago
LUA_API void lua_pushcclosure (lua_State *L, lua_CFunction fn, int n) {
LUA_ENTRY;
luaV_Cclosure(L, fn, n);
LUA_EXIT;
}
24 years ago
LUA_API void lua_pushusertag (lua_State *L, void *u, int tag) {
LUA_ENTRY;
24 years ago
/* ORDER LUA_T */
if (!(tag == LUA_ANYTAG || tag == LUA_TUSERDATA || validtag(G(L), tag)))
luaO_verror(L, "invalid tag for a userdata (%d)", tag);
setuvalue(L->top, luaS_createudata(L, u, tag));
api_incr_top(L);
LUA_EXIT;
}
/*
** get functions (Lua -> stack)
*/
24 years ago
LUA_API void lua_getglobal (lua_State *L, const char *name) {
StkId top;
LUA_ENTRY;
top = L->top;
setobj(top, luaV_getglobal(L, luaS_new(L, name)));
L->top = top;
api_incr_top(L);
LUA_EXIT;
}
24 years ago
LUA_API void lua_gettable (lua_State *L, int index) {
StkId t, top;
LUA_ENTRY;
t = Index(L, index);
top = L->top;
setobj(top-1, luaV_gettable(L, t));
L->top = top; /* tag method may change top */
LUA_EXIT;
}
24 years ago
LUA_API void lua_rawget (lua_State *L, int index) {
StkId t;
LUA_ENTRY;
t = Index(L, index);
lua_assert(ttype(t) == LUA_TTABLE);
setobj(L->top - 1, luaH_get(hvalue(t), L->top - 1));
LUA_EXIT;
}
24 years ago
LUA_API void lua_rawgeti (lua_State *L, int index, int n) {
StkId o;
LUA_ENTRY;
o = Index(L, index);
lua_assert(ttype(o) == LUA_TTABLE);
setobj(L->top, luaH_getnum(hvalue(o), n));
api_incr_top(L);
LUA_EXIT;
}
24 years ago
LUA_API void lua_getglobals (lua_State *L) {
LUA_ENTRY;
sethvalue(L->top, L->gt);
api_incr_top(L);
LUA_EXIT;
}
24 years ago
LUA_API int lua_getref (lua_State *L, int ref) {
int status = 1;
LUA_ENTRY;
if (ref == LUA_REFNIL) {
setnilvalue(L->top);
api_incr_top(L);
}
else if (0 <= ref && ref < G(L)->nref &&
(G(L)->refArray[ref].st == LOCK || G(L)->refArray[ref].st == HOLD)) {
setobj(L->top, &G(L)->refArray[ref].o);
api_incr_top(L);
}
else
status = 0;
LUA_EXIT;
return status;
}
24 years ago
LUA_API void lua_newtable (lua_State *L) {
LUA_ENTRY;
sethvalue(L->top, luaH_new(L, 0));
api_incr_top(L);
LUA_EXIT;
}
/*
** set functions (stack -> Lua)
*/
24 years ago
LUA_API void lua_setglobal (lua_State *L, const char *name) {
StkId top;
LUA_ENTRY;
top = L->top;
luaV_setglobal(L, luaS_new(L, name));
L->top = top-1; /* remove element from the top */
LUA_EXIT;
}
24 years ago
LUA_API void lua_settable (lua_State *L, int index) {
StkId t, top;
LUA_ENTRY;
t = Index(L, index);
top = L->top;
luaV_settable(L, t, top-2);
L->top = top-2; /* pop index and value */
LUA_EXIT;
}
24 years ago
LUA_API void lua_rawset (lua_State *L, int index) {
StkId t;
LUA_ENTRY;
t = Index(L, index);
lua_assert(ttype(t) == LUA_TTABLE);
setobj(luaH_set(L, hvalue(t), L->top-2), (L->top-1));
L->top -= 2;
LUA_EXIT;
}
24 years ago
LUA_API void lua_rawseti (lua_State *L, int index, int n) {
StkId o;
LUA_ENTRY;
o = Index(L, index);
lua_assert(ttype(o) == LUA_TTABLE);
setobj(luaH_setnum(L, hvalue(o), n), (L->top-1));
L->top--;
LUA_EXIT;
}
24 years ago
LUA_API void lua_setglobals (lua_State *L) {
StkId newtable;
LUA_ENTRY;
newtable = --L->top;
lua_assert(ttype(newtable) == LUA_TTABLE);
L->gt = hvalue(newtable);
LUA_EXIT;
}
24 years ago
LUA_API int lua_ref (lua_State *L, int lock) {
int ref;
LUA_ENTRY;
if (ttype(L->top-1) == LUA_TNIL)
ref = LUA_REFNIL;
else {
if (G(L)->refFree != NONEXT) { /* is there a free place? */
ref = G(L)->refFree;
G(L)->refFree = G(L)->refArray[ref].st;
}
else { /* no more free places */
luaM_growvector(L, G(L)->refArray, G(L)->nref, G(L)->sizeref, struct Ref,
MAX_INT, "reference table overflow");
ref = G(L)->nref++;
}
setobj(&G(L)->refArray[ref].o, L->top-1);
G(L)->refArray[ref].st = lock ? LOCK : HOLD;
}
L->top--;
LUA_EXIT;
return ref;
}
/*
** "do" functions (run Lua code)
** (most of them are in ldo.c)
*/
24 years ago
LUA_API void lua_rawcall (lua_State *L, int nargs, int nresults) {
LUA_ENTRY;
luaD_call(L, L->top-(nargs+1), nresults);
LUA_EXIT;
}
/*
** Garbage-collection functions
*/
/* GC values are expressed in Kbytes: #bytes/2^10 */
#define GCscale(x) ((int)((x)>>10))
#define GCunscale(x) ((mem_int)(x)<<10)
24 years ago
LUA_API int lua_getgcthreshold (lua_State *L) {
int threshold;
LUA_ENTRY;
threshold = GCscale(G(L)->GCthreshold);
LUA_EXIT;
return threshold;
}
24 years ago
LUA_API int lua_getgccount (lua_State *L) {
int count;
LUA_ENTRY;
count = GCscale(G(L)->nblocks);
LUA_EXIT;
return count;
}
24 years ago
LUA_API void lua_setgcthreshold (lua_State *L, int newthreshold) {
LUA_ENTRY;
if (newthreshold > GCscale(ULONG_MAX))
G(L)->GCthreshold = ULONG_MAX;
else
G(L)->GCthreshold = GCunscale(newthreshold);
luaC_checkGC(L);
LUA_EXIT;
}
/*
** miscellaneous functions
*/
24 years ago
LUA_API void lua_settag (lua_State *L, int tag) {
LUA_ENTRY;
luaT_realtag(L, tag);
switch (ttype(L->top-1)) {
case LUA_TTABLE:
hvalue(L->top-1)->htag = tag;
break;
case LUA_TUSERDATA:
tsvalue(L->top-1)->u.d.tag = tag;
break;
default:
luaO_verror(L, "cannot change the tag of a %.20s",
luaO_typename(L->top-1));
}
LUA_EXIT;
}
LUA_API void lua_error (lua_State *L, const char *s) {
LUA_ENTRY;
luaD_error(L, s);
LUA_EXIT;
}
24 years ago
LUA_API void lua_unref (lua_State *L, int ref) {
LUA_ENTRY;
if (ref >= 0) {
lua_assert(ref < G(L)->nref && G(L)->refArray[ref].st < 0);
G(L)->refArray[ref].st = G(L)->refFree;
G(L)->refFree = ref;
}
LUA_EXIT;
}
24 years ago
LUA_API int lua_next (lua_State *L, int index) {
StkId t;
Node *n;
int more;
LUA_ENTRY;
t = luaA_index(L, index);
lua_assert(ttype(t) == LUA_TTABLE);
n = luaH_next(L, hvalue(t), luaA_index(L, -1));
if (n) {
setobj(L->top-1, key(n));
setobj(L->top, val(n));
api_incr_top(L);
more = 1;
}
else { /* no more elements */
L->top -= 1; /* remove key */
more = 0;
}
LUA_EXIT;
return more;
}
24 years ago
LUA_API int lua_getn (lua_State *L, int index) {
Hash *h;
const TObject *value;
int n;
LUA_ENTRY;
h = hvalue(luaA_index(L, index));
value = luaH_getstr(h, luaS_newliteral(L, "n")); /* = h.n */
if (ttype(value) == LUA_TNUMBER)
n = (int)nvalue(value);
else {
lua_Number max = 0;
int i = h->size;
Node *nd = h->node;
while (i--) {
if (ttype(key(nd)) == LUA_TNUMBER &&
ttype(val(nd)) != LUA_TNIL &&
nvalue(key(nd)) > max)
max = nvalue(key(nd));
nd++;
}
n = (int)max;
}
LUA_EXIT;
return n;
}
24 years ago
LUA_API void lua_concat (lua_State *L, int n) {
StkId top;
LUA_ENTRY;
top = L->top;
luaV_strconc(L, n, top);
L->top = top-(n-1);
luaC_checkGC(L);
LUA_EXIT;
}
LUA_API void *lua_newuserdata (lua_State *L, size_t size) {
TString *ts;
void *p;
LUA_ENTRY;
ts = luaS_newudata(L, size, NULL);
setuvalue(L->top, ts);
api_incr_top(L);
p = ts->u.d.value;
LUA_EXIT;
return p;
}