lua/lbuiltin.c

690 lines
18 KiB
C
Raw Normal View History

1997-09-16 23:25:59 +04:00
/*
** $Id: lbuiltin.c,v 1.111 2000/05/26 19:17:57 roberto Exp roberto $
1997-09-16 23:25:59 +04:00
** Built-in functions
** See Copyright Notice in lua.h
*/
2000-03-03 17:58:26 +03:00
/*
** =========================================================================
** All built-in functions are public (i.e. not static) and are named luaB_f,
** where f is the function name in Lua. So, if you do not need all these
** functions, you may register manually only the ones that you need.
** =========================================================================
*/
#include <ctype.h>
1997-09-16 23:25:59 +04:00
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
1997-09-16 23:25:59 +04:00
#define LUA_REENTRANT
1997-09-16 23:25:59 +04:00
#include "lapi.h"
#include "lauxlib.h"
#include "lbuiltin.h"
#include "ldo.h"
1997-10-24 21:17:24 +04:00
#include "lfunc.h"
1997-09-16 23:25:59 +04:00
#include "lmem.h"
#include "lobject.h"
#include "lstate.h"
1997-09-16 23:25:59 +04:00
#include "lstring.h"
#include "ltable.h"
#include "ltm.h"
#include "lua.h"
1998-06-19 22:47:06 +04:00
#include "lundump.h"
#include "lvm.h"
1997-09-16 23:25:59 +04:00
1999-12-14 21:33:29 +03:00
/*
** function defined in ltests.c, to open some internal-test functions
*/
void luaB_opentests (lua_State *L);
/*
1999-01-04 15:55:09 +03:00
** {======================================================
1999-02-12 22:23:02 +03:00
** Auxiliary functions
** =======================================================
*/
2000-03-10 21:37:44 +03:00
static Number getsize (const Hash *h) {
Number max = 0;
1999-10-14 23:13:31 +04:00
int i = h->size;
Node *n = h->node;
while (i--) {
2000-03-10 21:37:44 +03:00
if (ttype(key(n)) == TAG_NUMBER &&
ttype(val(n)) != TAG_NIL &&
nvalue(key(n)) > max)
max = nvalue(key(n));
n++;
}
return max;
}
2000-03-10 21:37:44 +03:00
static Number getnarg (lua_State *L, const Hash *a) {
TObject index;
1999-10-14 23:13:31 +04:00
const TObject *value;
/* value = table.n */
2000-03-10 21:37:44 +03:00
ttype(&index) = TAG_STRING;
tsvalue(&index) = luaS_new(L, "n");
value = luaH_get(L, a, &index);
2000-03-10 21:37:44 +03:00
return (ttype(value) == TAG_NUMBER) ? nvalue(value) : getsize(a);
}
static Hash *gettable (lua_State *L, int arg) {
return avalue(luaL_tablearg(L, arg));
}
1999-01-04 15:55:09 +03:00
/* }====================================================== */
/*
1999-01-04 15:55:09 +03:00
** {======================================================
** Functions that use only the official API
** =======================================================
*/
1997-09-16 23:25:59 +04:00
/*
2000-03-03 17:58:26 +03:00
** If your system does not support `stderr', redefine this function, or
** redefine _ERRORMESSAGE so that it won't need _ALERT.
*/
1999-12-28 22:23:41 +03:00
void luaB__ALERT (lua_State *L) {
fputs(luaL_check_string(L, 1), stderr);
1997-09-16 23:25:59 +04:00
}
/*
** Standard implementation of _ERRORMESSAGE.
1999-12-27 20:33:22 +03:00
** The library `liolib' redefines _ERRORMESSAGE for better error information.
*/
1999-12-27 20:33:22 +03:00
void luaB__ERRORMESSAGE (lua_State *L) {
lua_Object al;
lua_pushglobaltable(L);
lua_pushstring(L, LUA_ALERT);
al = lua_rawget(L);
if (lua_isfunction(L, al)) { /* avoid error loop if _ALERT is not defined */
const char *s = luaL_check_string(L, 1);
char *buff = luaL_openspace(L, strlen(s)+sizeof("error: \n"));
strcpy(buff, "error: "); strcat(buff, s); strcat(buff, "\n");
lua_pushstring(L, buff);
lua_callfunction(L, al);
}
1997-09-16 23:25:59 +04:00
}
/*
2000-03-03 17:58:26 +03:00
** If your system does not support `stdout', you can just remove this function.
** If you need, you can define your own `print' function, following this
** model but changing `fputs' to put the strings at a proper place
** (a console window or a log file, for instance).
*/
1999-12-14 21:33:29 +03:00
void luaB_print (lua_State *L) {
lua_Object args[MAXPRINT];
1997-09-16 23:25:59 +04:00
lua_Object obj;
int n = 0;
int i;
while ((obj = lua_getparam(L, n+1)) != LUA_NOOBJECT) {
luaL_arg_check(L, n < MAXPRINT, n+1, "too many arguments");
args[n++] = obj;
}
for (i=0; i<n; i++) {
lua_pushobject(L, args[i]);
if (lua_call(L, "tostring"))
lua_error(L, "error in `tostring' called by `print'");
obj = lua_getresult(L, 1);
if (!lua_isstring(L, obj))
lua_error(L, "`tostring' must return a string to `print'");
if (i>0) fputs("\t", stdout);
fputs(lua_getstring(L, obj), stdout);
1998-06-01 02:19:35 +04:00
}
fputs("\n", stdout);
1997-09-16 23:25:59 +04:00
}
1999-12-14 21:33:29 +03:00
void luaB_tonumber (lua_State *L) {
int base = luaL_opt_int(L, 2, 10);
1998-06-19 20:14:09 +04:00
if (base == 10) { /* standard conversion */
lua_Object o = luaL_nonnullarg(L, 1);
if (lua_isnumber(L, o)) {
lua_pushnumber(L, lua_getnumber(L, o));
return;
}
}
else {
const char *s1 = luaL_check_string(L, 1);
char *s2;
2000-03-10 21:37:44 +03:00
Number n;
2000-04-13 22:08:18 +04:00
luaL_arg_check(L, 2 <= base && base <= 36, 2, "base out of range");
n = strtoul(s1, &s2, base);
if (s1 != s2) { /* at least one valid digit? */
while (isspace((unsigned char)*s2)) s2++; /* skip trailing spaces */
if (*s2 == '\0') { /* no invalid trailing characters? */
lua_pushnumber(L, n);
return;
}
}
}
lua_pushnil(L); /* else not a number */
1997-09-16 23:25:59 +04:00
}
1999-12-14 21:33:29 +03:00
void luaB_error (lua_State *L) {
lua_error(L, luaL_opt_string(L, 1, NULL));
1997-09-16 23:25:59 +04:00
}
1999-12-14 21:33:29 +03:00
void luaB_setglobal (lua_State *L) {
2000-03-03 17:58:26 +03:00
const char *name = luaL_check_string(L, 1);
lua_Object value = luaL_nonnullarg(L, 2);
lua_pushobject(L, value);
2000-03-03 17:58:26 +03:00
lua_setglobal(L, name);
1997-09-16 23:25:59 +04:00
}
1999-12-14 21:33:29 +03:00
void luaB_getglobal (lua_State *L) {
lua_pushobject(L, lua_getglobal(L, luaL_check_string(L, 1)));
1997-09-16 23:25:59 +04:00
}
1999-12-14 21:33:29 +03:00
void luaB_tag (lua_State *L) {
lua_pushnumber(L, lua_tag(L, luaL_nonnullarg(L, 1)));
1997-09-16 23:25:59 +04:00
}
1999-12-14 21:33:29 +03:00
void luaB_settag (lua_State *L) {
lua_Object o = luaL_tablearg(L, 1);
lua_pushobject(L, o);
lua_settag(L, luaL_check_int(L, 2));
lua_pushobject(L, o); /* return first argument */
1997-09-16 23:25:59 +04:00
}
1999-12-14 21:33:29 +03:00
void luaB_newtag (lua_State *L) {
lua_pushnumber(L, lua_newtag(L));
1997-09-16 23:25:59 +04:00
}
1999-12-14 21:33:29 +03:00
void luaB_copytagmethods (lua_State *L) {
lua_pushnumber(L, lua_copytagmethods(L, luaL_check_int(L, 1),
luaL_check_int(L, 2)));
}
void luaB_globals (lua_State *L) {
lua_pushglobaltable(L);
if (lua_getparam(L, 1) != LUA_NOOBJECT)
lua_setglobaltable(L, luaL_tablearg(L, 1));
}
void luaB_rawget (lua_State *L) {
lua_pushobject(L, luaL_nonnullarg(L, 1));
lua_pushobject(L, luaL_nonnullarg(L, 2));
lua_pushobject(L, lua_rawget(L));
1997-09-16 23:25:59 +04:00
}
void luaB_rawset (lua_State *L) {
lua_pushobject(L, luaL_nonnullarg(L, 1));
lua_pushobject(L, luaL_nonnullarg(L, 2));
lua_pushobject(L, luaL_nonnullarg(L, 3));
lua_rawset(L);
1997-09-16 23:25:59 +04:00
}
1999-12-14 21:33:29 +03:00
void luaB_settagmethod (lua_State *L) {
int tag = luaL_check_int(L, 1);
const char *event = luaL_check_string(L, 2);
lua_Object nf = luaL_nonnullarg(L, 3);
luaL_arg_check(L, lua_isnil(L, nf) || lua_isfunction(L, nf), 3,
"function or nil expected");
2000-03-10 21:37:44 +03:00
if (strcmp(event, "gc") == 0 && tag != TAG_NIL)
2000-03-28 00:08:02 +04:00
lua_error(L, "deprecated use: cannot set the `gc' tag method from Lua");
lua_pushobject(L, nf);
lua_pushobject(L, lua_settagmethod(L, tag, event));
1997-09-16 23:25:59 +04:00
}
1999-12-14 21:33:29 +03:00
void luaB_gettagmethod (lua_State *L) {
lua_pushobject(L, lua_gettagmethod(L, luaL_check_int(L, 1),
luaL_check_string(L, 2)));
1997-09-16 23:25:59 +04:00
}
1999-12-14 21:33:29 +03:00
void luaB_collectgarbage (lua_State *L) {
lua_pushnumber(L, lua_collectgarbage(L, luaL_opt_int(L, 1, 0)));
1997-09-16 23:25:59 +04:00
}
1999-10-07 23:04:30 +04:00
1999-12-14 21:33:29 +03:00
void luaB_type (lua_State *L) {
lua_Object o = luaL_nonnullarg(L, 1);
lua_pushstring(L, lua_type(L, o));
1999-10-07 23:04:30 +04:00
}
1999-01-04 15:55:09 +03:00
/* }====================================================== */
1997-09-16 23:25:59 +04:00
/*
1999-01-04 15:55:09 +03:00
** {======================================================
** Functions that could use only the official API but
** do not, for efficiency.
** =======================================================
*/
static void passresults (lua_State *L) {
L->Cstack.base = L->Cstack.lua2C; /* position of first result */
if (L->Cstack.num == 0)
lua_pushuserdata(L, NULL); /* at least one result to signal no errors */
}
1999-12-14 21:33:29 +03:00
void luaB_dostring (lua_State *L) {
2000-05-24 17:54:49 +04:00
size_t l;
const char *s = luaL_check_lstr(L, 1, &l);
if (*s == ID_CHUNK)
lua_error(L, "`dostring' cannot run pre-compiled code");
if (lua_dobuffer(L, s, l, luaL_opt_string(L, 2, s)) == 0)
passresults(L);
else
lua_pushnil(L);
}
1999-12-14 21:33:29 +03:00
void luaB_dofile (lua_State *L) {
const char *fname = luaL_opt_string(L, 1, NULL);
if (lua_dofile(L, fname) == 0)
passresults(L);
else
lua_pushnil(L);
}
1999-12-14 21:33:29 +03:00
void luaB_call (lua_State *L) {
lua_Object f = luaL_nonnullarg(L, 1);
const Hash *arg = gettable(L, 2);
const char *options = luaL_opt_string(L, 3, "");
lua_Object err = lua_getparam(L, 4);
int narg = (int)getnarg(L, arg);
int i, status;
if (err != LUA_NOOBJECT) { /* set new error method */
2000-05-09 18:50:16 +04:00
lua_Object oldem = lua_getglobal(L, LUA_ERRORMESSAGE);
lua_pushobject(L, err);
2000-05-09 18:50:16 +04:00
lua_setglobal(L, LUA_ERRORMESSAGE);
2000-04-17 23:23:12 +04:00
err = oldem;
}
/* push arg[1...n] */
luaD_checkstack(L, narg);
for (i=0; i<narg; i++)
2000-04-25 20:55:09 +04:00
*(L->top++) = *luaH_getnum(arg, i+1);
status = lua_callfunction(L, f);
if (err != LUA_NOOBJECT) { /* restore old error method */
lua_pushobject(L, err);
2000-05-09 18:50:16 +04:00
lua_setglobal(L, LUA_ERRORMESSAGE);
}
if (status != 0) { /* error in call? */
if (strchr(options, 'x')) {
lua_pushnil(L);
return; /* return nil to signal the error */
}
else
2000-03-03 17:58:26 +03:00
lua_error(L, NULL); /* propagate error without additional messages */
}
else { /* no errors */
if (strchr(options, 'p')) { /* pack results? */
1999-12-01 22:50:08 +03:00
luaV_pack(L, L->Cstack.lua2C, L->Cstack.num, L->top);
incr_top;
}
else
L->Cstack.base = L->Cstack.lua2C; /* position of first result */
}
}
1999-12-14 21:33:29 +03:00
void luaB_next (lua_State *L) {
const Hash *a = gettable(L, 1);
lua_Object k = lua_getparam(L, 2);
2000-03-03 17:58:26 +03:00
int i; /* `luaA_next' gets first element after `i' */
if (k == LUA_NOOBJECT || ttype(k) == TAG_NIL)
1999-10-14 23:13:31 +04:00
i = 0; /* get first */
else {
i = luaH_pos(L, a, k)+1;
luaL_arg_check(L, i != 0, 2, "key not found");
1999-10-14 23:13:31 +04:00
}
if (luaA_next(L, a, i) == 0)
lua_pushnil(L);
}
1999-12-14 21:33:29 +03:00
void luaB_tostring (lua_State *L) {
lua_Object o = luaL_nonnullarg(L, 1);
char buff[64];
switch (ttype(o)) {
2000-03-10 21:37:44 +03:00
case TAG_NUMBER:
lua_pushstring(L, lua_getstring(L, o));
return;
2000-03-10 21:37:44 +03:00
case TAG_STRING:
lua_pushobject(L, o);
return;
2000-03-28 00:10:21 +04:00
case TAG_TABLE:
1999-11-16 15:50:48 +03:00
sprintf(buff, "table: %p", o->value.a);
break;
2000-03-10 21:37:44 +03:00
case TAG_LCLOSURE: case TAG_CCLOSURE:
1999-11-16 15:50:48 +03:00
sprintf(buff, "function: %p", o->value.cl);
break;
2000-03-10 21:37:44 +03:00
case TAG_USERDATA:
2000-03-03 17:58:26 +03:00
sprintf(buff, "userdata: %p(%d)", o->value.ts->u.d.value,
o->value.ts->u.d.tag);
break;
2000-03-10 21:37:44 +03:00
case TAG_NIL:
lua_pushstring(L, "nil");
return;
default:
LUA_INTERNALERROR(L, "invalid type");
}
lua_pushstring(L, buff);
}
1999-01-04 15:55:09 +03:00
/* }====================================================== */
/*
1999-01-04 15:55:09 +03:00
** {======================================================
** "Extra" functions
1999-01-04 15:55:09 +03:00
** These functions can be written in Lua, so you can
** delete them if you need a tiny Lua implementation.
** If you delete them, remove their entries in array
** "builtin_funcs".
** =======================================================
*/
1999-12-14 21:33:29 +03:00
void luaB_assert (lua_State *L) {
lua_Object p = luaL_nonnullarg(L, 1);
if (lua_isnil(L, p))
luaL_verror(L, "assertion failed! %.90s", luaL_opt_string(L, 2, ""));
}
1999-12-14 21:33:29 +03:00
void luaB_getn (lua_State *L) {
lua_pushnumber(L, getnarg(L, gettable(L, 1)));
}
1999-12-14 21:33:29 +03:00
void luaB_tinsert (lua_State *L) {
Hash *a = gettable(L, 1);
lua_Object v = lua_getparam(L, 3);
int n = (int)getnarg(L, a);
1998-12-30 16:16:50 +03:00
int pos;
if (v != LUA_NOOBJECT)
pos = luaL_check_int(L, 2);
1998-12-30 16:16:50 +03:00
else { /* called with only 2 arguments */
v = luaL_nonnullarg(L, 2);
1998-12-30 16:16:50 +03:00
pos = n+1;
}
luaV_setn(L, a, n+1); /* a.n = n+1 */
2000-03-03 17:58:26 +03:00
for (; n>=pos; n--)
luaH_move(L, a, n, n+1); /* a[n+1] = a[n] */
luaH_setint(L, a, pos, v); /* a[pos] = v */
1998-12-30 16:16:50 +03:00
}
1999-12-14 21:33:29 +03:00
void luaB_tremove (lua_State *L) {
Hash *a = gettable(L, 1);
int n = (int)getnarg(L, a);
int pos = luaL_opt_int(L, 2, n);
1998-12-30 16:16:50 +03:00
if (n <= 0) return; /* table is "empty" */
2000-04-25 20:55:09 +04:00
luaA_pushobject(L, luaH_getnum(a, pos)); /* result = a[pos] */
1998-12-30 16:16:50 +03:00
for ( ;pos<n; pos++)
luaH_move(L, a, pos+1, pos); /* a[pos] = a[pos+1] */
luaV_setn(L, a, n-1); /* a.n = n-1 */
luaH_setint(L, a, n, &luaO_nilobject); /* a[n] = nil */
1998-12-30 16:16:50 +03:00
}
static void luaB_foreachi (lua_State *L) {
const Hash *t = gettable(L, 1);
int n = (int)getnarg(L, t);
int i;
lua_Object f = luaL_functionarg(L, 2);
luaD_checkstack(L, 3); /* for f, key, and val */
for (i=1; i<=n; i++) {
*(L->top++) = *f;
ttype(L->top) = TAG_NUMBER; nvalue(L->top++) = i;
*(L->top++) = *luaH_getnum(t, i);
luaD_call(L, L->top-3, 1);
if (ttype(L->top-1) != TAG_NIL)
return;
L->top--; /* remove nil result */
}
}
static void luaB_foreach (lua_State *L) {
const Hash *a = gettable(L, 1);
lua_Object f = luaL_functionarg(L, 2);
int i;
luaD_checkstack(L, 3); /* for f, key, and val */
for (i=0; i<a->size; i++) {
const Node *nd = &(a->node[i]);
if (ttype(val(nd)) != TAG_NIL) {
*(L->top++) = *f;
*(L->top++) = *key(nd);
*(L->top++) = *val(nd);
luaD_call(L, L->top-3, 1);
if (ttype(L->top-1) != TAG_NIL)
return;
L->top--; /* remove result */
}
}
}
/*
** {======================================================
1999-01-04 15:55:09 +03:00
** Quicksort
** (based on `Algorithms in MODULA-3', Robert Sedgewick;
** Addison-Wesley, 1993.)
*/
static void swap (lua_State *L, Hash *a, int i, int j) {
1999-01-22 21:46:11 +03:00
TObject temp;
2000-04-25 20:55:09 +04:00
temp = *luaH_getnum(a, i);
luaH_move(L, a, j, i);
luaH_setint(L, a, j, &temp);
}
static int sort_comp (lua_State *L, lua_Object f, const TObject *a,
const TObject *b) {
1999-12-27 20:33:22 +03:00
/* WARNING: the caller (auxsort) must ensure stack space */
if (f != LUA_NOOBJECT) {
*(L->top) = *f;
1999-12-01 22:50:08 +03:00
*(L->top+1) = *a;
*(L->top+2) = *b;
L->top += 3;
luaD_call(L, L->top-3, 1);
L->top--;
2000-03-10 21:37:44 +03:00
return (ttype(L->top) != TAG_NIL);
}
2000-03-09 03:19:22 +03:00
else /* a < b? */
return luaV_lessthan(L, a, b, L->top);
}
static void auxsort (lua_State *L, Hash *a, int l, int u, lua_Object f) {
1999-12-01 22:50:08 +03:00
StkId P = L->top++; /* temporary place for pivot */
2000-03-10 21:37:44 +03:00
ttype(P) = TAG_NIL;
while (l < u) { /* for tail recursion */
1999-01-04 15:55:09 +03:00
int i, j;
/* sort elements a[l], a[(l+u)/2] and a[u] */
2000-04-25 20:55:09 +04:00
if (sort_comp(L, f, luaH_getnum(a, u), luaH_getnum(a, l)))
swap(L, a, l, u); /* a[u]<a[l] */
if (u-l == 1) break; /* only 2 elements */
1999-01-04 15:55:09 +03:00
i = (l+u)/2;
2000-04-25 20:55:09 +04:00
*P = *luaH_getnum(a, i); /* P = a[i] */
if (sort_comp(L, f, P, luaH_getnum(a, l))) /* a[i]<a[l]? */
swap(L, a, l, i);
2000-04-25 20:55:09 +04:00
else if (sort_comp(L, f, luaH_getnum(a, u), P)) /* a[u]<a[i]? */
swap(L, a, i, u);
if (u-l == 2) break; /* only 3 elements */
2000-04-25 20:55:09 +04:00
*P = *luaH_getnum(a, i); /* save pivot on stack (GC) */
swap(L, a, i, u-1); /* put median element as pivot (a[u-1]) */
1999-01-04 15:55:09 +03:00
/* a[l] <= P == a[u-1] <= a[u], only needs to sort from l+1 to u-2 */
i = l; j = u-1;
for (;;) { /* invariant: a[l..i] <= P <= a[j..u] */
1999-10-14 23:13:31 +04:00
/* repeat i++ until a[i] >= P */
2000-04-25 20:55:09 +04:00
while (sort_comp(L, f, luaH_getnum(a, ++i), P))
if (i>u) lua_error(L, "invalid order function for sorting");
1999-10-14 23:13:31 +04:00
/* repeat j-- until a[j] <= P */
2000-04-25 20:55:09 +04:00
while (sort_comp(L, f, P, luaH_getnum(a, --j)))
if (j<l) lua_error(L, "invalid order function for sorting");
1999-01-04 15:55:09 +03:00
if (j<i) break;
swap(L, a, i, j);
}
swap(L, a, u-1, i); /* swap pivot (a[u-1]) with a[i] */
1999-01-04 15:55:09 +03:00
/* a[l..i-1] <= a[i] == P <= a[i+1..u] */
/* adjust so that smaller "half" is in [j..i] and larger one in [l..u] */
if (i-l < u-i) {
j=l; i=i-1; l=i+2;
}
else {
j=i+1; i=u; u=j-2;
}
auxsort(L, a, j, i, f); /* call recursively the smaller one */
} /* repeat the routine for the larger one */
1999-12-01 22:50:08 +03:00
L->top--; /* remove pivot from stack */
}
1999-12-14 21:33:29 +03:00
void luaB_sort (lua_State *L) {
Hash *a = gettable(L, 1);
int n = (int)getnarg(L, a);
lua_Object func = lua_getparam(L, 2);
luaL_arg_check(L, func == LUA_NOOBJECT || lua_isfunction(L, func), 2,
"function expected");
2000-03-03 17:58:26 +03:00
luaD_checkstack(L, 4); /* for pivot, f, a, b (sort_comp) */
auxsort(L, a, 1, n, func);
}
/* }====================================================== */
/* }====================================================== */
/*
** {======================================================
** Deprecated functions to manipulate global environment:
** some of them can be simulated through table operations
** over the global table.
** =======================================================
*/
#ifdef LUA_DEPRECATETFUNCS
#define num_deprecated 4
static const struct luaL_reg deprecated_global_funcs[num_deprecated] = {
{"foreachvar", luaB_foreach},
{"nextvar", luaB_next},
{"rawgetglobal", luaB_rawget},
{"rawsetglobal", luaB_rawset}
};
static const struct luaL_reg other_deprecated_global_funcs[] = {
{"rawgettable", luaB_rawget},
{"rawsettable", luaB_rawset}
};
static void deprecated_funcs (lua_State *L) {
TObject gt;
int i;
ttype(&gt) = TAG_TABLE;
avalue(&gt) = L->gt;
for (i=0; i<num_deprecated; i++) {
lua_pushobject(L, &gt);
lua_pushcclosure(L, deprecated_global_funcs[i].func, 1);
lua_setglobal(L, deprecated_global_funcs[i].name);
}
luaL_openl(L, other_deprecated_global_funcs);
}
#else
/*
** gives an explicit error in any attempt to call an obsolet function
*/
static void obsolete_func (lua_State *L) {
luaL_verror(L, "function `%.20s' is obsolete", luaL_check_string(L, 1));
}
#define num_deprecated 6
static const char *const obsolete_names [num_deprecated] = {
"foreachvar", "nextvar", "rawgetglobal",
"rawgettable", "rawsetglobal", "rawsettable"
};
static void deprecated_funcs (lua_State *L) {
int i;
for (i=0; i<num_deprecated; i++) {
lua_pushstring(L, obsolete_names[i]);
lua_pushcclosure(L, obsolete_func, 1);
lua_setglobal(L, obsolete_names[i]);
}
}
#endif
/* }====================================================== */
1999-08-17 00:52:00 +04:00
static const struct luaL_reg builtin_funcs[] = {
2000-05-09 18:50:16 +04:00
{LUA_ALERT, luaB__ALERT},
{LUA_ERRORMESSAGE, luaB__ERRORMESSAGE},
1998-12-15 18:21:09 +03:00
{"call", luaB_call},
{"collectgarbage", luaB_collectgarbage},
{"copytagmethods", luaB_copytagmethods},
{"dofile", luaB_dofile},
1998-12-15 18:21:09 +03:00
{"dostring", luaB_dostring},
{"error", luaB_error},
{"foreach", luaB_foreach},
{"foreachi", luaB_foreachi},
1998-12-15 18:21:09 +03:00
{"getglobal", luaB_getglobal},
{"gettagmethod", luaB_gettagmethod},
{"globals", luaB_globals},
1998-12-15 18:21:09 +03:00
{"newtag", luaB_newtag},
{"next", luaB_next},
{"print", luaB_print},
{"rawget", luaB_rawget},
{"rawset", luaB_rawset},
1998-12-15 18:21:09 +03:00
{"setglobal", luaB_setglobal},
{"settag", luaB_settag},
{"settagmethod", luaB_settagmethod},
1999-11-30 16:06:50 +03:00
{"tag", luaB_tag},
{"tonumber", luaB_tonumber},
1998-12-15 18:21:09 +03:00
{"tostring", luaB_tostring},
{"type", luaB_type},
2000-03-03 17:58:26 +03:00
/* "Extra" functions */
{"assert", luaB_assert},
{"getn", luaB_getn},
1998-12-30 16:16:50 +03:00
{"sort", luaB_sort},
{"tinsert", luaB_tinsert},
{"tremove", luaB_tremove}
1997-09-16 23:25:59 +04:00
};
void luaB_predefine (lua_State *L) {
1997-09-16 23:25:59 +04:00
/* pre-register mem error messages, to avoid loop when error arises */
luaS_newfixed(L, memEM);
1999-11-22 20:39:51 +03:00
luaL_openl(L, builtin_funcs);
1999-12-20 16:10:38 +03:00
#ifdef DEBUG
luaB_opentests(L); /* internal test functions */
#endif
lua_pushstring(L, LUA_VERSION);
lua_setglobal(L, "_VERSION");
deprecated_funcs(L);
1997-09-16 23:25:59 +04:00
}