1997-09-16 23:25:59 +04:00
|
|
|
/*
|
2010-06-09 21:53:59 +04:00
|
|
|
** $Id: lauxlib.c,v 1.214 2010/05/31 16:34:19 roberto Exp roberto $
|
1998-06-19 20:14:09 +04:00
|
|
|
** Auxiliary functions for building Lua libraries
|
1997-09-16 23:25:59 +04:00
|
|
|
** See Copyright Notice in lua.h
|
|
|
|
*/
|
|
|
|
|
1997-03-17 20:02:29 +03:00
|
|
|
|
2002-10-04 18:31:40 +04:00
|
|
|
#include <errno.h>
|
1997-03-18 18:30:50 +03:00
|
|
|
#include <stdarg.h>
|
1997-09-16 23:25:59 +04:00
|
|
|
#include <stdio.h>
|
2003-10-03 00:31:17 +04:00
|
|
|
#include <stdlib.h>
|
1998-06-18 20:57:03 +04:00
|
|
|
#include <string.h>
|
1997-03-17 20:02:29 +03:00
|
|
|
|
2002-06-04 00:11:41 +04:00
|
|
|
|
1999-12-27 20:33:22 +03:00
|
|
|
/* This file uses only the official API of Lua.
|
1999-02-26 00:07:26 +03:00
|
|
|
** Any function declared here could be written as an application function.
|
1998-01-09 18:09:53 +03:00
|
|
|
*/
|
1999-02-26 00:07:26 +03:00
|
|
|
|
2002-12-04 20:38:31 +03:00
|
|
|
#define lauxlib_c
|
2004-05-01 00:13:38 +04:00
|
|
|
#define LUA_LIB
|
2002-12-04 20:38:31 +03:00
|
|
|
|
1997-03-17 20:02:29 +03:00
|
|
|
#include "lua.h"
|
2000-06-12 17:52:05 +04:00
|
|
|
|
|
|
|
#include "lauxlib.h"
|
1997-03-17 20:02:29 +03:00
|
|
|
|
|
|
|
|
2009-02-27 21:17:13 +03:00
|
|
|
/*
|
|
|
|
** {======================================================
|
|
|
|
** Traceback
|
|
|
|
** =======================================================
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
#define LEVELS1 12 /* size of the first part of the stack */
|
|
|
|
#define LEVELS2 10 /* size of the second part of the stack */
|
|
|
|
|
|
|
|
|
2009-02-27 21:18:19 +03:00
|
|
|
|
|
|
|
/*
|
|
|
|
** search for 'objidx' in table at index -1.
|
|
|
|
** return 1 + string at top if find a good name.
|
|
|
|
*/
|
|
|
|
static int findfield (lua_State *L, int objidx, int level) {
|
|
|
|
int found = 0;
|
|
|
|
if (level == 0 || !lua_istable(L, -1))
|
|
|
|
return 0; /* not found */
|
|
|
|
lua_pushnil(L); /* start 'next' loop */
|
|
|
|
while (!found && lua_next(L, -2)) { /* for each pair in table */
|
|
|
|
if (lua_type(L, -2) == LUA_TSTRING) { /* ignore non-string keys */
|
|
|
|
if (lua_rawequal(L, objidx, -1)) { /* found object? */
|
|
|
|
lua_pop(L, 1); /* remove value (but keep name) */
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
else if (findfield(L, objidx, level - 1)) { /* try recursively */
|
|
|
|
lua_remove(L, -2); /* remove table (but keep name) */
|
|
|
|
lua_pushliteral(L, ".");
|
|
|
|
lua_insert(L, -2); /* place '.' between the two names */
|
|
|
|
lua_concat(L, 3);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
lua_pop(L, 1); /* remove value */
|
|
|
|
}
|
|
|
|
return 0; /* not found */
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static int pushglobalfuncname (lua_State *L, lua_Debug *ar) {
|
|
|
|
int top = lua_gettop(L);
|
|
|
|
lua_getinfo(L, "f", ar); /* push function */
|
2009-12-22 18:32:50 +03:00
|
|
|
lua_pushglobaltable(L);
|
2009-02-27 21:18:19 +03:00
|
|
|
if (findfield(L, top + 1, 2)) {
|
2009-10-05 20:44:33 +04:00
|
|
|
lua_copy(L, -1, top + 1); /* move name to proper place */
|
|
|
|
lua_pop(L, 2); /* remove pushed values */
|
2009-02-27 21:18:19 +03:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
lua_settop(L, top); /* remove function and global table */
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-02-27 21:17:13 +03:00
|
|
|
static void pushfuncname (lua_State *L, lua_Debug *ar) {
|
|
|
|
if (*ar->namewhat != '\0') /* is there a name? */
|
|
|
|
lua_pushfstring(L, "function " LUA_QS, ar->name);
|
|
|
|
else if (*ar->what == 'm') /* main? */
|
|
|
|
lua_pushfstring(L, "main chunk");
|
2009-02-27 21:18:19 +03:00
|
|
|
else if (*ar->what == 'C' || *ar->what == 't') {
|
|
|
|
if (pushglobalfuncname(L, ar)) {
|
|
|
|
lua_pushfstring(L, "function " LUA_QS, lua_tostring(L, -1));
|
|
|
|
lua_remove(L, -2); /* remove name */
|
|
|
|
}
|
|
|
|
else
|
2009-11-25 18:27:51 +03:00
|
|
|
lua_pushliteral(L, "?");
|
2009-02-27 21:18:19 +03:00
|
|
|
}
|
2009-02-27 21:17:13 +03:00
|
|
|
else
|
|
|
|
lua_pushfstring(L, "function <%s:%d>", ar->short_src, ar->linedefined);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static int countlevels (lua_State *L) {
|
|
|
|
lua_Debug ar;
|
2009-07-15 21:26:14 +04:00
|
|
|
int li = 1, le = 1;
|
|
|
|
/* find an upper bound */
|
|
|
|
while (lua_getstack(L, le, &ar)) { li = le; le *= 2; }
|
|
|
|
/* do a binary search */
|
|
|
|
while (li < le) {
|
|
|
|
int m = (li + le)/2;
|
|
|
|
if (lua_getstack(L, m, &ar)) li = m + 1;
|
|
|
|
else le = m;
|
|
|
|
}
|
|
|
|
return le - 1;
|
2009-02-27 21:17:13 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
LUALIB_API void luaL_traceback (lua_State *L, lua_State *L1,
|
|
|
|
const char *msg, int level) {
|
|
|
|
lua_Debug ar;
|
|
|
|
int top = lua_gettop(L);
|
|
|
|
int numlevels = countlevels(L1);
|
|
|
|
int mark = (numlevels > LEVELS1 + LEVELS2) ? LEVELS1 : 0;
|
|
|
|
if (msg) lua_pushfstring(L, "%s\n", msg);
|
|
|
|
lua_pushliteral(L, "stack traceback:");
|
|
|
|
while (lua_getstack(L1, level++, &ar)) {
|
|
|
|
if (level == mark) { /* too many levels? */
|
|
|
|
lua_pushliteral(L, "\n\t..."); /* add a '...' */
|
|
|
|
level = numlevels - LEVELS2; /* and skip to last ones */
|
|
|
|
}
|
|
|
|
else {
|
2009-11-25 18:27:51 +03:00
|
|
|
lua_getinfo(L1, "Slnt", &ar);
|
2009-02-27 21:17:13 +03:00
|
|
|
lua_pushfstring(L, "\n\t%s:", ar.short_src);
|
|
|
|
if (ar.currentline > 0)
|
|
|
|
lua_pushfstring(L, "%d:", ar.currentline);
|
|
|
|
lua_pushliteral(L, " in ");
|
|
|
|
pushfuncname(L, &ar);
|
2009-11-25 18:27:51 +03:00
|
|
|
if (ar.istailcall)
|
|
|
|
lua_pushliteral(L, "\n\t(...tail calls...)");
|
2009-02-27 21:17:13 +03:00
|
|
|
lua_concat(L, lua_gettop(L) - top);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
lua_concat(L, lua_gettop(L) - top);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* }====================================================== */
|
|
|
|
|
|
|
|
|
2002-06-04 00:11:41 +04:00
|
|
|
/*
|
|
|
|
** {======================================================
|
|
|
|
** Error-report functions
|
|
|
|
** =======================================================
|
|
|
|
*/
|
1998-06-18 20:57:03 +04:00
|
|
|
|
2002-05-06 23:05:10 +04:00
|
|
|
LUALIB_API int luaL_argerror (lua_State *L, int narg, const char *extramsg) {
|
2000-03-30 21:19:48 +04:00
|
|
|
lua_Debug ar;
|
2005-08-09 16:30:19 +04:00
|
|
|
if (!lua_getstack(L, 0, &ar)) /* no stack frame? */
|
|
|
|
return luaL_error(L, "bad argument #%d (%s)", narg, extramsg);
|
2001-11-28 23:13:13 +03:00
|
|
|
lua_getinfo(L, "n", &ar);
|
2002-06-05 20:59:37 +04:00
|
|
|
if (strcmp(ar.namewhat, "method") == 0) {
|
|
|
|
narg--; /* do not count `self' */
|
|
|
|
if (narg == 0) /* error is in the self argument itself? */
|
2008-06-13 22:45:35 +04:00
|
|
|
return luaL_error(L, "calling " LUA_QS " on bad self", ar.name);
|
2002-06-05 20:59:37 +04:00
|
|
|
}
|
2000-01-19 15:00:45 +03:00
|
|
|
if (ar.name == NULL)
|
2009-02-27 21:18:19 +03:00
|
|
|
ar.name = (pushglobalfuncname(L, &ar)) ? lua_tostring(L, -1) : "?";
|
2005-05-17 23:49:15 +04:00
|
|
|
return luaL_error(L, "bad argument #%d to " LUA_QS " (%s)",
|
2002-05-06 23:05:10 +04:00
|
|
|
narg, ar.name, extramsg);
|
1997-03-17 20:02:29 +03:00
|
|
|
}
|
|
|
|
|
1999-12-28 14:52:49 +03:00
|
|
|
|
2009-02-13 22:39:34 +03:00
|
|
|
LUALIB_API int luaL_typeerror (lua_State *L, int narg, const char *tname) {
|
2002-05-16 22:39:46 +04:00
|
|
|
const char *msg = lua_pushfstring(L, "%s expected, got %s",
|
2004-07-09 22:23:17 +04:00
|
|
|
tname, luaL_typename(L, narg));
|
2002-05-16 22:39:46 +04:00
|
|
|
return luaL_argerror(L, narg, msg);
|
1999-12-28 14:52:49 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2001-01-25 19:45:36 +03:00
|
|
|
static void tag_error (lua_State *L, int narg, int tag) {
|
2009-02-13 22:39:34 +03:00
|
|
|
luaL_typeerror(L, narg, lua_typename(L, tag));
|
2001-01-25 19:45:36 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-08-09 00:08:41 +04:00
|
|
|
LUALIB_API void luaL_where (lua_State *L, int level) {
|
|
|
|
lua_Debug ar;
|
|
|
|
if (lua_getstack(L, level, &ar)) { /* check function at level */
|
2003-10-01 20:50:53 +04:00
|
|
|
lua_getinfo(L, "Sl", &ar); /* get info about it */
|
2002-08-09 00:08:41 +04:00
|
|
|
if (ar.currentline > 0) { /* is there info? */
|
|
|
|
lua_pushfstring(L, "%s:%d: ", ar.short_src, ar.currentline);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
lua_pushliteral(L, ""); /* else, no information available... */
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-06-18 19:19:27 +04:00
|
|
|
LUALIB_API int luaL_error (lua_State *L, const char *fmt, ...) {
|
2002-06-04 00:11:41 +04:00
|
|
|
va_list argp;
|
|
|
|
va_start(argp, fmt);
|
2002-08-09 00:08:41 +04:00
|
|
|
luaL_where(L, 1);
|
2002-06-18 19:19:27 +04:00
|
|
|
lua_pushvfstring(L, fmt, argp);
|
2002-06-04 00:11:41 +04:00
|
|
|
va_end(argp);
|
2002-09-05 23:45:42 +04:00
|
|
|
lua_concat(L, 2);
|
2002-06-18 19:19:27 +04:00
|
|
|
return lua_error(L);
|
2002-06-04 00:11:41 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/* }====================================================== */
|
|
|
|
|
|
|
|
|
2007-06-21 18:09:59 +04:00
|
|
|
/*
|
|
|
|
** {======================================================
|
|
|
|
** Userdata's metatable manipulation
|
|
|
|
** =======================================================
|
|
|
|
*/
|
2002-06-04 00:11:41 +04:00
|
|
|
|
2003-03-18 15:25:32 +03:00
|
|
|
LUALIB_API int luaL_newmetatable (lua_State *L, const char *tname) {
|
2003-10-10 16:57:55 +04:00
|
|
|
lua_getfield(L, LUA_REGISTRYINDEX, tname); /* get registry.name */
|
2003-03-18 15:25:32 +03:00
|
|
|
if (!lua_isnil(L, -1)) /* name already in use? */
|
|
|
|
return 0; /* leave previous value on top, but return 0 */
|
|
|
|
lua_pop(L, 1);
|
|
|
|
lua_newtable(L); /* create metatable */
|
2003-10-10 16:57:55 +04:00
|
|
|
lua_pushvalue(L, -1);
|
|
|
|
lua_setfield(L, LUA_REGISTRYINDEX, tname); /* registry.name = metatable */
|
2003-03-18 15:25:32 +03:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2007-05-15 22:46:12 +04:00
|
|
|
LUALIB_API void *luaL_testudata (lua_State *L, int ud, const char *tname) {
|
2005-08-18 00:09:31 +04:00
|
|
|
void *p = lua_touserdata(L, ud);
|
2006-03-21 22:31:09 +03:00
|
|
|
if (p != NULL) { /* value is a userdata? */
|
|
|
|
if (lua_getmetatable(L, ud)) { /* does it have a metatable? */
|
|
|
|
lua_getfield(L, LUA_REGISTRYINDEX, tname); /* get correct metatable */
|
2008-06-12 18:37:27 +04:00
|
|
|
if (!lua_rawequal(L, -1, -2)) /* not the same? */
|
|
|
|
p = NULL; /* value is a userdata with wrong metatable */
|
|
|
|
lua_pop(L, 2); /* remove both metatables */
|
|
|
|
return p;
|
2006-03-21 22:31:09 +03:00
|
|
|
}
|
|
|
|
}
|
2008-06-12 18:37:27 +04:00
|
|
|
return NULL; /* value is not a userdata with a metatable */
|
2007-05-15 22:46:12 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
LUALIB_API void *luaL_checkudata (lua_State *L, int ud, const char *tname) {
|
|
|
|
void *p = luaL_testudata(L, ud, tname);
|
2009-02-13 22:39:34 +03:00
|
|
|
if (p == NULL) luaL_typeerror(L, ud, tname);
|
2007-05-15 22:46:12 +04:00
|
|
|
return p;
|
2003-03-18 15:25:32 +03:00
|
|
|
}
|
|
|
|
|
2007-06-21 18:09:59 +04:00
|
|
|
/* }====================================================== */
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
** {======================================================
|
|
|
|
** Argument check functions
|
|
|
|
** =======================================================
|
|
|
|
*/
|
|
|
|
|
|
|
|
LUALIB_API int luaL_checkoption (lua_State *L, int narg, const char *def,
|
|
|
|
const char *const lst[]) {
|
|
|
|
const char *name = (def) ? luaL_optstring(L, narg, def) :
|
|
|
|
luaL_checkstring(L, narg);
|
|
|
|
int i;
|
|
|
|
for (i=0; lst[i]; i++)
|
|
|
|
if (strcmp(lst[i], name) == 0)
|
|
|
|
return i;
|
|
|
|
return luaL_argerror(L, narg,
|
|
|
|
lua_pushfstring(L, "invalid option " LUA_QS, name));
|
|
|
|
}
|
|
|
|
|
2003-03-18 15:25:32 +03:00
|
|
|
|
2009-07-15 21:26:14 +04:00
|
|
|
LUALIB_API void luaL_checkstack (lua_State *L, int space, const char *msg) {
|
|
|
|
if (!lua_checkstack(L, space)) {
|
|
|
|
if (msg)
|
|
|
|
luaL_error(L, "stack overflow (%s)", msg);
|
|
|
|
else
|
|
|
|
luaL_error(L, "stack overflow");
|
|
|
|
}
|
2000-08-30 00:43:28 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-11-14 18:41:38 +03:00
|
|
|
LUALIB_API void luaL_checktype (lua_State *L, int narg, int t) {
|
2001-12-05 23:15:18 +03:00
|
|
|
if (lua_type(L, narg) != t)
|
2001-01-25 19:45:36 +03:00
|
|
|
tag_error(L, narg, t);
|
2000-10-03 00:10:55 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-11-14 18:41:38 +03:00
|
|
|
LUALIB_API void luaL_checkany (lua_State *L, int narg) {
|
2001-12-05 23:15:18 +03:00
|
|
|
if (lua_type(L, narg) == LUA_TNONE)
|
2001-11-28 23:13:13 +03:00
|
|
|
luaL_argerror(L, narg, "value expected");
|
2000-08-28 21:57:04 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-11-14 18:41:38 +03:00
|
|
|
LUALIB_API const char *luaL_checklstring (lua_State *L, int narg, size_t *len) {
|
2005-05-16 23:21:11 +04:00
|
|
|
const char *s = lua_tolstring(L, narg, len);
|
2001-01-25 19:45:36 +03:00
|
|
|
if (!s) tag_error(L, narg, LUA_TSTRING);
|
1999-10-05 22:33:43 +04:00
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
1997-03-17 20:02:29 +03:00
|
|
|
|
2002-11-14 18:41:38 +03:00
|
|
|
LUALIB_API const char *luaL_optlstring (lua_State *L, int narg,
|
|
|
|
const char *def, size_t *len) {
|
2002-03-27 18:30:41 +03:00
|
|
|
if (lua_isnoneornil(L, narg)) {
|
2000-09-29 16:40:56 +04:00
|
|
|
if (len)
|
|
|
|
*len = (def ? strlen(def) : 0);
|
1999-10-05 22:33:43 +04:00
|
|
|
return def;
|
|
|
|
}
|
2002-11-14 18:41:38 +03:00
|
|
|
else return luaL_checklstring(L, narg, len);
|
1997-03-17 20:02:29 +03:00
|
|
|
}
|
|
|
|
|
2000-09-29 16:40:56 +04:00
|
|
|
|
2002-11-14 18:41:38 +03:00
|
|
|
LUALIB_API lua_Number luaL_checknumber (lua_State *L, int narg) {
|
2000-12-04 21:33:40 +03:00
|
|
|
lua_Number d = lua_tonumber(L, narg);
|
2000-09-29 16:40:56 +04:00
|
|
|
if (d == 0 && !lua_isnumber(L, narg)) /* avoid extra test when d is not 0 */
|
2001-01-25 19:45:36 +03:00
|
|
|
tag_error(L, narg, LUA_TNUMBER);
|
2000-09-29 16:40:56 +04:00
|
|
|
return d;
|
1997-03-17 20:02:29 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-11-14 18:41:38 +03:00
|
|
|
LUALIB_API lua_Number luaL_optnumber (lua_State *L, int narg, lua_Number def) {
|
2005-10-21 17:47:42 +04:00
|
|
|
return luaL_opt(L, luaL_checknumber, narg, def);
|
1999-10-05 22:33:43 +04:00
|
|
|
}
|
1997-12-09 16:50:08 +03:00
|
|
|
|
|
|
|
|
2003-10-08 00:13:41 +04:00
|
|
|
LUALIB_API lua_Integer luaL_checkinteger (lua_State *L, int narg) {
|
|
|
|
lua_Integer d = lua_tointeger(L, narg);
|
|
|
|
if (d == 0 && !lua_isnumber(L, narg)) /* avoid extra test when d is not 0 */
|
|
|
|
tag_error(L, narg, LUA_TNUMBER);
|
|
|
|
return d;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
LUALIB_API lua_Integer luaL_optinteger (lua_State *L, int narg,
|
2005-10-21 17:47:42 +04:00
|
|
|
lua_Integer def) {
|
|
|
|
return luaL_opt(L, luaL_checkinteger, narg, def);
|
2003-10-08 00:13:41 +04:00
|
|
|
}
|
|
|
|
|
2007-06-21 18:09:59 +04:00
|
|
|
/* }====================================================== */
|
2004-09-21 20:54:32 +04:00
|
|
|
|
|
|
|
|
2000-09-11 21:38:42 +04:00
|
|
|
/*
|
|
|
|
** {======================================================
|
|
|
|
** Generic Buffer manipulation
|
|
|
|
** =======================================================
|
|
|
|
*/
|
|
|
|
|
2010-04-09 20:14:46 +04:00
|
|
|
/*
|
|
|
|
** check whether buffer is using a userdata on the stack as a temporary
|
|
|
|
** buffer
|
|
|
|
*/
|
|
|
|
#define buffonstack(B) ((B)->b != (B)->initb)
|
2000-09-11 21:38:42 +04:00
|
|
|
|
|
|
|
|
2010-04-09 20:14:46 +04:00
|
|
|
/*
|
|
|
|
** returns a pointer to a free area with at least 'sz' bytes
|
|
|
|
*/
|
|
|
|
LUALIB_API char *luaL_prepbuffsize (luaL_Buffer *B, size_t sz) {
|
|
|
|
lua_State *L = B->L;
|
|
|
|
if (B->size - B->n < sz) { /* not enough space? */
|
|
|
|
char *newbuff;
|
|
|
|
size_t newsize = B->size * 2; /* double buffer size */
|
|
|
|
if (newsize - B->n < sz) /* not bit enough? */
|
|
|
|
newsize = B->n + sz;
|
|
|
|
if (newsize < B->n || newsize - B->n < sz)
|
|
|
|
luaL_error(L, "string too large");
|
|
|
|
newbuff = (char *)lua_newuserdata(L, newsize); /* create larger buffer */
|
|
|
|
memcpy(newbuff, B->b, B->n); /* move content to new buffer */
|
|
|
|
if (buffonstack(B))
|
|
|
|
lua_remove(L, -2); /* remove old buffer */
|
|
|
|
B->b = newbuff;
|
|
|
|
B->size = newsize;
|
2000-09-11 21:38:42 +04:00
|
|
|
}
|
2010-04-09 20:14:46 +04:00
|
|
|
return &B->b[B->n];
|
2000-09-11 21:38:42 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2001-11-28 23:13:13 +03:00
|
|
|
LUALIB_API void luaL_addlstring (luaL_Buffer *B, const char *s, size_t l) {
|
2010-04-09 20:14:46 +04:00
|
|
|
char *b = luaL_prepbuffsize(B, l);
|
|
|
|
memcpy(b, s, l);
|
|
|
|
luaL_addsize(B, l);
|
2000-09-11 21:38:42 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2001-11-28 23:13:13 +03:00
|
|
|
LUALIB_API void luaL_addstring (luaL_Buffer *B, const char *s) {
|
2000-09-12 17:48:22 +04:00
|
|
|
luaL_addlstring(B, s, strlen(s));
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2000-10-27 20:15:53 +04:00
|
|
|
LUALIB_API void luaL_pushresult (luaL_Buffer *B) {
|
2010-04-09 20:14:46 +04:00
|
|
|
lua_State *L = B->L;
|
|
|
|
lua_pushlstring(L, B->b, B->n);
|
|
|
|
if (buffonstack(B))
|
|
|
|
lua_remove(L, -2); /* remove old buffer */
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
LUALIB_API void luaL_pushresultsize (luaL_Buffer *B, size_t sz) {
|
|
|
|
luaL_addsize(B, sz);
|
|
|
|
luaL_pushresult(B);
|
2000-09-11 21:38:42 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2000-10-27 20:15:53 +04:00
|
|
|
LUALIB_API void luaL_addvalue (luaL_Buffer *B) {
|
2000-09-11 21:38:42 +04:00
|
|
|
lua_State *L = B->L;
|
2010-04-09 20:14:46 +04:00
|
|
|
size_t l;
|
|
|
|
const char *s = lua_tolstring(L, -1, &l);
|
|
|
|
if (buffonstack(B))
|
|
|
|
lua_insert(L, -2); /* put value below buffer */
|
|
|
|
luaL_addlstring(B, s, l);
|
|
|
|
lua_remove(L, (buffonstack(B)) ? -2 : -1); /* remove value */
|
2000-09-11 21:38:42 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2000-10-27 20:15:53 +04:00
|
|
|
LUALIB_API void luaL_buffinit (lua_State *L, luaL_Buffer *B) {
|
2000-09-11 21:38:42 +04:00
|
|
|
B->L = L;
|
2010-04-09 20:14:46 +04:00
|
|
|
B->b = B->initb;
|
|
|
|
B->n = 0;
|
|
|
|
B->size = LUAL_BUFFERSIZE;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
LUALIB_API char *luaL_buffinitsize (lua_State *L, luaL_Buffer *B, size_t sz) {
|
|
|
|
luaL_buffinit(L, B);
|
|
|
|
return luaL_prepbuffsize(B, sz);
|
1999-03-10 17:19:41 +03:00
|
|
|
}
|
2000-08-28 21:57:04 +04:00
|
|
|
|
2000-09-11 21:38:42 +04:00
|
|
|
/* }====================================================== */
|
2001-10-31 22:40:14 +03:00
|
|
|
|
|
|
|
|
2007-06-21 18:09:59 +04:00
|
|
|
/*
|
|
|
|
** {======================================================
|
|
|
|
** Reference system
|
|
|
|
** =======================================================
|
|
|
|
*/
|
|
|
|
|
2010-05-10 19:25:02 +04:00
|
|
|
/* index of free-list header */
|
|
|
|
#define freelist "lua-freelist"
|
2007-06-21 18:09:59 +04:00
|
|
|
|
|
|
|
|
2001-10-31 22:40:14 +03:00
|
|
|
LUALIB_API int luaL_ref (lua_State *L, int t) {
|
|
|
|
int ref;
|
2010-05-12 18:09:20 +04:00
|
|
|
t = lua_absindex(L, t);
|
2002-10-04 18:31:40 +04:00
|
|
|
if (lua_isnil(L, -1)) {
|
|
|
|
lua_pop(L, 1); /* remove from stack */
|
|
|
|
return LUA_REFNIL; /* `nil' has a unique fixed reference */
|
|
|
|
}
|
2010-05-10 19:25:02 +04:00
|
|
|
lua_getfield(L, t, freelist); /* get first free element */
|
2003-10-08 00:13:41 +04:00
|
|
|
ref = (int)lua_tointeger(L, -1); /* ref = t[FREELIST_REF] */
|
2001-10-31 22:40:14 +03:00
|
|
|
lua_pop(L, 1); /* remove it from stack */
|
|
|
|
if (ref != 0) { /* any free element? */
|
|
|
|
lua_rawgeti(L, t, ref); /* remove it from list */
|
2010-05-10 19:25:02 +04:00
|
|
|
lua_setfield(L, t, freelist); /* (t[freelist] = t[ref]) */
|
2001-10-31 22:40:14 +03:00
|
|
|
}
|
2010-05-10 19:25:02 +04:00
|
|
|
else /* no free elements */
|
2009-12-17 19:20:01 +03:00
|
|
|
ref = (int)lua_rawlen(L, t) + 1; /* get a new reference */
|
2001-10-31 22:40:14 +03:00
|
|
|
lua_rawseti(L, t, ref);
|
|
|
|
return ref;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
LUALIB_API void luaL_unref (lua_State *L, int t, int ref) {
|
|
|
|
if (ref >= 0) {
|
2010-05-12 18:09:20 +04:00
|
|
|
t = lua_absindex(L, t);
|
2010-05-10 19:25:02 +04:00
|
|
|
lua_getfield(L, t, freelist);
|
|
|
|
lua_rawseti(L, t, ref); /* t[ref] = t[freelist] */
|
2003-10-08 00:13:41 +04:00
|
|
|
lua_pushinteger(L, ref);
|
2010-05-10 19:25:02 +04:00
|
|
|
lua_setfield(L, t, freelist); /* t[freelist] = ref */
|
2001-10-31 22:40:14 +03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-06-21 18:09:59 +04:00
|
|
|
/* }====================================================== */
|
2002-06-04 00:11:41 +04:00
|
|
|
|
2002-06-25 23:15:21 +04:00
|
|
|
|
2002-06-04 00:11:41 +04:00
|
|
|
/*
|
|
|
|
** {======================================================
|
|
|
|
** Load functions
|
|
|
|
** =======================================================
|
|
|
|
*/
|
|
|
|
|
|
|
|
typedef struct LoadF {
|
2010-06-09 21:53:59 +04:00
|
|
|
int n; /* number of pre-read characters */
|
2010-05-18 21:32:19 +04:00
|
|
|
FILE *f; /* file being read */
|
|
|
|
char buff[LUAL_BUFFERSIZE]; /* area for reading file */
|
2002-06-04 00:11:41 +04:00
|
|
|
} LoadF;
|
|
|
|
|
|
|
|
|
2002-08-06 21:26:45 +04:00
|
|
|
static const char *getF (lua_State *L, void *ud, size_t *size) {
|
2002-06-04 00:11:41 +04:00
|
|
|
LoadF *lf = (LoadF *)ud;
|
2002-08-06 21:26:45 +04:00
|
|
|
(void)L;
|
2010-06-09 21:53:59 +04:00
|
|
|
if (lf->n > 0) { /* are there pre-read characters to be read? */
|
|
|
|
*size = lf->n; /* return them (chars already in buffer) */
|
|
|
|
lf->n = 0; /* no more pre-read characters */
|
2010-02-18 22:32:41 +03:00
|
|
|
}
|
2010-05-18 21:32:19 +04:00
|
|
|
else { /* read a block from file */
|
2010-02-18 22:32:41 +03:00
|
|
|
/* 'fread' can return > 0 *and* set the EOF flag. If next call to
|
|
|
|
'getF' called 'fread', it might still wait for user input.
|
|
|
|
The next check avoids this problem. */
|
|
|
|
if (feof(lf->f)) return NULL;
|
2010-05-18 21:32:19 +04:00
|
|
|
*size = fread(lf->buff, 1, sizeof(lf->buff), lf->f); /* read block */
|
2010-02-18 22:32:41 +03:00
|
|
|
}
|
2010-02-18 22:37:57 +03:00
|
|
|
return lf->buff;
|
2002-06-04 00:11:41 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2004-06-02 17:50:46 +04:00
|
|
|
static int errfile (lua_State *L, const char *what, int fnameindex) {
|
|
|
|
const char *serr = strerror(errno);
|
2002-10-17 00:41:35 +04:00
|
|
|
const char *filename = lua_tostring(L, fnameindex) + 1;
|
2004-06-02 17:50:46 +04:00
|
|
|
lua_pushfstring(L, "cannot %s %s: %s", what, filename, serr);
|
2002-10-17 00:41:35 +04:00
|
|
|
lua_remove(L, fnameindex);
|
2002-06-04 00:11:41 +04:00
|
|
|
return LUA_ERRFILE;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2010-06-09 21:53:59 +04:00
|
|
|
/*
|
|
|
|
** reads the first character of file 'f' and skips its first line
|
|
|
|
** if it starts with '#'. Returns true if it skipped the first line.
|
|
|
|
** In any case, '*cp' has the first "valid" character of the file
|
|
|
|
** (after the optional first-line comment).
|
|
|
|
*/
|
|
|
|
static int skipcomment (FILE *f, int *cp) {
|
|
|
|
int c = *cp = getc(f);
|
|
|
|
if (c == '#') { /* first line is a comment (Unix exec. file)? */
|
|
|
|
while ((c = getc(f)) != EOF && c != '\n') ; /* skip first line */
|
|
|
|
*cp = getc(f); /* skip end-of-line */
|
|
|
|
return 1; /* there was a comment */
|
|
|
|
}
|
|
|
|
else return 0; /* no comment */
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-06-04 00:11:41 +04:00
|
|
|
LUALIB_API int luaL_loadfile (lua_State *L, const char *filename) {
|
|
|
|
LoadF lf;
|
2002-10-17 00:41:35 +04:00
|
|
|
int status, readstatus;
|
2002-06-04 00:11:41 +04:00
|
|
|
int c;
|
2002-10-17 00:41:35 +04:00
|
|
|
int fnameindex = lua_gettop(L) + 1; /* index of filename on the stack */
|
|
|
|
if (filename == NULL) {
|
|
|
|
lua_pushliteral(L, "=stdin");
|
|
|
|
lf.f = stdin;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
lua_pushfstring(L, "@%s", filename);
|
|
|
|
lf.f = fopen(filename, "r");
|
2004-06-02 17:50:46 +04:00
|
|
|
if (lf.f == NULL) return errfile(L, "open", fnameindex);
|
2002-10-17 00:41:35 +04:00
|
|
|
}
|
2010-06-09 21:53:59 +04:00
|
|
|
lf.n = 0;
|
|
|
|
if (skipcomment(lf.f, &c)) /* read initial portion */
|
|
|
|
lf.buff[lf.n++] = '\n'; /* add line to correct line numbers */
|
|
|
|
if (c == LUA_SIGNATURE[0] && filename) { /* binary file? */
|
2007-04-20 00:21:53 +04:00
|
|
|
lf.f = freopen(filename, "rb", lf.f); /* reopen in binary mode */
|
2004-06-02 17:50:46 +04:00
|
|
|
if (lf.f == NULL) return errfile(L, "reopen", fnameindex);
|
2010-06-09 21:53:59 +04:00
|
|
|
lf.n = 0;
|
|
|
|
skipcomment(lf.f, &c); /* re-read initial portion */
|
2002-06-04 00:11:41 +04:00
|
|
|
}
|
2010-06-09 21:53:59 +04:00
|
|
|
if (c != EOF)
|
|
|
|
lf.buff[lf.n++] = c; /* 'c' is the first character of the stream */
|
2002-06-04 00:11:41 +04:00
|
|
|
status = lua_load(L, getF, &lf, lua_tostring(L, -1));
|
2002-10-17 00:41:35 +04:00
|
|
|
readstatus = ferror(lf.f);
|
2007-04-20 00:21:53 +04:00
|
|
|
if (filename) fclose(lf.f); /* close file (even in case of errors) */
|
2002-10-17 00:41:35 +04:00
|
|
|
if (readstatus) {
|
|
|
|
lua_settop(L, fnameindex); /* ignore results from `lua_load' */
|
2004-06-02 17:50:46 +04:00
|
|
|
return errfile(L, "read", fnameindex);
|
2002-06-04 00:11:41 +04:00
|
|
|
}
|
2002-10-17 00:41:35 +04:00
|
|
|
lua_remove(L, fnameindex);
|
2002-06-04 00:11:41 +04:00
|
|
|
return status;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
typedef struct LoadS {
|
|
|
|
const char *s;
|
|
|
|
size_t size;
|
|
|
|
} LoadS;
|
|
|
|
|
|
|
|
|
2002-08-06 21:26:45 +04:00
|
|
|
static const char *getS (lua_State *L, void *ud, size_t *size) {
|
2002-06-04 00:11:41 +04:00
|
|
|
LoadS *ls = (LoadS *)ud;
|
2002-08-06 21:26:45 +04:00
|
|
|
(void)L;
|
2002-06-04 00:11:41 +04:00
|
|
|
if (ls->size == 0) return NULL;
|
|
|
|
*size = ls->size;
|
|
|
|
ls->size = 0;
|
|
|
|
return ls->s;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
LUALIB_API int luaL_loadbuffer (lua_State *L, const char *buff, size_t size,
|
|
|
|
const char *name) {
|
|
|
|
LoadS ls;
|
|
|
|
ls.s = buff;
|
|
|
|
ls.size = size;
|
|
|
|
return lua_load(L, getS, &ls, name);
|
|
|
|
}
|
|
|
|
|
2004-05-31 23:27:14 +04:00
|
|
|
|
2006-10-16 18:38:38 +04:00
|
|
|
LUALIB_API int luaL_loadstring (lua_State *L, const char *s) {
|
2005-08-15 18:12:32 +04:00
|
|
|
return luaL_loadbuffer(L, s, strlen(s), s);
|
|
|
|
}
|
|
|
|
|
2007-06-21 18:09:59 +04:00
|
|
|
/* }====================================================== */
|
2005-08-15 18:12:32 +04:00
|
|
|
|
|
|
|
|
2007-06-21 18:09:59 +04:00
|
|
|
|
|
|
|
LUALIB_API int luaL_getmetafield (lua_State *L, int obj, const char *event) {
|
|
|
|
if (!lua_getmetatable(L, obj)) /* no metatable? */
|
|
|
|
return 0;
|
|
|
|
lua_pushstring(L, event);
|
|
|
|
lua_rawget(L, -2);
|
|
|
|
if (lua_isnil(L, -1)) {
|
|
|
|
lua_pop(L, 2); /* remove metatable and metafield */
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
lua_remove(L, -2); /* remove only metatable */
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
LUALIB_API int luaL_callmeta (lua_State *L, int obj, const char *event) {
|
2010-05-12 18:09:20 +04:00
|
|
|
obj = lua_absindex(L, obj);
|
2007-06-21 18:09:59 +04:00
|
|
|
if (!luaL_getmetafield(L, obj, event)) /* no metafield? */
|
|
|
|
return 0;
|
|
|
|
lua_pushvalue(L, obj);
|
|
|
|
lua_call(L, 1, 1);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-12-17 19:20:01 +03:00
|
|
|
LUALIB_API int luaL_len (lua_State *L, int idx) {
|
|
|
|
int l;
|
|
|
|
lua_len(L, idx);
|
|
|
|
l = lua_tointeger(L, -1);
|
|
|
|
if (l == 0 && !lua_isnumber(L, -1))
|
|
|
|
luaL_error(L, "object length is not a number");
|
|
|
|
lua_pop(L, 1); /* remove object */
|
|
|
|
return l;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2008-01-03 20:07:59 +03:00
|
|
|
LUALIB_API const char *luaL_tolstring (lua_State *L, int idx, size_t *len) {
|
2007-06-21 18:09:59 +04:00
|
|
|
if (!luaL_callmeta(L, idx, "__tostring")) { /* no metafield? */
|
|
|
|
switch (lua_type(L, idx)) {
|
|
|
|
case LUA_TNUMBER:
|
|
|
|
case LUA_TSTRING:
|
|
|
|
lua_pushvalue(L, idx);
|
|
|
|
break;
|
|
|
|
case LUA_TBOOLEAN:
|
2008-01-03 20:07:59 +03:00
|
|
|
lua_pushstring(L, (lua_toboolean(L, idx) ? "true" : "false"));
|
|
|
|
break;
|
2007-06-21 18:09:59 +04:00
|
|
|
case LUA_TNIL:
|
2008-01-03 20:07:59 +03:00
|
|
|
lua_pushliteral(L, "nil");
|
|
|
|
break;
|
2007-06-21 18:09:59 +04:00
|
|
|
default:
|
2008-01-03 20:07:59 +03:00
|
|
|
lua_pushfstring(L, "%s: %p", luaL_typename(L, idx),
|
2007-06-21 18:09:59 +04:00
|
|
|
lua_topointer(L, idx));
|
2008-01-03 20:07:59 +03:00
|
|
|
break;
|
2007-06-21 18:09:59 +04:00
|
|
|
}
|
|
|
|
}
|
2009-07-15 21:47:34 +04:00
|
|
|
return lua_tolstring(L, -1, len);
|
2007-06-21 18:09:59 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2010-05-31 20:34:19 +04:00
|
|
|
/*
|
|
|
|
** Count number of elements in a luaL_Reg list.
|
|
|
|
*/
|
2007-06-21 18:09:59 +04:00
|
|
|
static int libsize (const luaL_Reg *l) {
|
|
|
|
int size = 0;
|
2010-03-18 00:37:37 +03:00
|
|
|
for (; l && l->name; l++) size++;
|
2007-06-21 18:09:59 +04:00
|
|
|
return size;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2010-05-31 20:34:19 +04:00
|
|
|
/*
|
|
|
|
** Find or create a module table with a given name. The function
|
|
|
|
** first looks at the _LOADED table and, if that fails, try a
|
|
|
|
** global variable with that name. In any case, leaves on the stack
|
|
|
|
** the module table.
|
|
|
|
*/
|
|
|
|
LUALIB_API void luaL_pushmodule (lua_State *L, const char *modname,
|
|
|
|
int sizehint) {
|
|
|
|
luaL_findtable(L, LUA_REGISTRYINDEX, "_LOADED", 1); /* get _LOADED table */
|
|
|
|
lua_getfield(L, -1, modname); /* get _LOADED[modname] */
|
|
|
|
if (!lua_istable(L, -1)) { /* not found? */
|
|
|
|
lua_pop(L, 1); /* remove previous result */
|
|
|
|
/* try global variable (and create one if it does not exist) */
|
|
|
|
lua_pushglobaltable(L);
|
|
|
|
if (luaL_findtable(L, 0, modname, sizehint) != NULL)
|
|
|
|
luaL_error(L, "name conflict for module " LUA_QS, modname);
|
|
|
|
lua_pushvalue(L, -1);
|
|
|
|
lua_setfield(L, -3, modname); /* _LOADED[modname] = new table */
|
|
|
|
}
|
|
|
|
lua_remove(L, -2); /* remove _LOADED table */
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2010-03-18 00:37:37 +03:00
|
|
|
LUALIB_API void luaL_openlib (lua_State *L, const char *libname,
|
|
|
|
const luaL_Reg *l, int nup) {
|
2009-06-18 22:59:58 +04:00
|
|
|
luaL_checkversion(L);
|
2007-06-21 18:09:59 +04:00
|
|
|
if (libname) {
|
2010-05-31 20:34:19 +04:00
|
|
|
luaL_pushmodule(L, libname, libsize(l)); /* get/create library table */
|
2010-03-18 00:37:37 +03:00
|
|
|
lua_insert(L, -(nup + 1)); /* move library table to below upvalues */
|
2007-06-21 18:09:59 +04:00
|
|
|
}
|
2010-03-18 00:37:37 +03:00
|
|
|
luaL_checkstack(L, nup, "too many upvalues");
|
2010-05-17 22:30:27 +04:00
|
|
|
for (; l && l->name; l++) { /* fill the table with given functions */
|
2010-03-18 00:37:37 +03:00
|
|
|
int i;
|
|
|
|
for (i = 0; i < nup; i++) /* copy upvalues to the top */
|
|
|
|
lua_pushvalue(L, -nup);
|
|
|
|
lua_pushcclosure(L, l->func, nup);
|
|
|
|
lua_setfield(L, -(nup + 2), l->name);
|
2007-06-21 18:09:59 +04:00
|
|
|
}
|
2010-03-18 00:37:37 +03:00
|
|
|
lua_pop(L, nup); /* remove upvalues */
|
2007-06-21 18:09:59 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
LUALIB_API const char *luaL_gsub (lua_State *L, const char *s, const char *p,
|
|
|
|
const char *r) {
|
|
|
|
const char *wild;
|
|
|
|
size_t l = strlen(p);
|
|
|
|
luaL_Buffer b;
|
|
|
|
luaL_buffinit(L, &b);
|
|
|
|
while ((wild = strstr(s, p)) != NULL) {
|
|
|
|
luaL_addlstring(&b, s, wild - s); /* push prefix */
|
|
|
|
luaL_addstring(&b, r); /* push replacement in place of pattern */
|
|
|
|
s = wild + l; /* continue after `p' */
|
|
|
|
}
|
|
|
|
luaL_addstring(&b, s); /* push last suffix */
|
|
|
|
luaL_pushresult(&b);
|
|
|
|
return lua_tostring(L, -1);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
LUALIB_API const char *luaL_findtable (lua_State *L, int idx,
|
|
|
|
const char *fname, int szhint) {
|
|
|
|
const char *e;
|
2009-12-22 18:32:50 +03:00
|
|
|
if (idx) lua_pushvalue(L, idx);
|
2007-06-21 18:09:59 +04:00
|
|
|
do {
|
|
|
|
e = strchr(fname, '.');
|
|
|
|
if (e == NULL) e = fname + strlen(fname);
|
|
|
|
lua_pushlstring(L, fname, e - fname);
|
|
|
|
lua_rawget(L, -2);
|
|
|
|
if (lua_isnil(L, -1)) { /* no such field? */
|
|
|
|
lua_pop(L, 1); /* remove this nil */
|
|
|
|
lua_createtable(L, 0, (*e == '.' ? 1 : szhint)); /* new table for field */
|
|
|
|
lua_pushlstring(L, fname, e - fname);
|
|
|
|
lua_pushvalue(L, -2);
|
|
|
|
lua_settable(L, -4); /* set new table into field */
|
|
|
|
}
|
|
|
|
else if (!lua_istable(L, -1)) { /* field has a non-table value? */
|
|
|
|
lua_pop(L, 2); /* remove table and value */
|
|
|
|
return fname; /* return problematic part of the name */
|
|
|
|
}
|
|
|
|
lua_remove(L, -2); /* remove previous table */
|
|
|
|
fname = e + 1;
|
|
|
|
} while (*e == '.');
|
|
|
|
return NULL;
|
|
|
|
}
|
2002-06-04 00:11:41 +04:00
|
|
|
|
|
|
|
|
2003-10-03 00:31:17 +04:00
|
|
|
static void *l_alloc (void *ud, void *ptr, size_t osize, size_t nsize) {
|
|
|
|
(void)ud;
|
2004-09-03 17:17:14 +04:00
|
|
|
(void)osize;
|
2003-10-03 00:31:17 +04:00
|
|
|
if (nsize == 0) {
|
|
|
|
free(ptr);
|
|
|
|
return NULL;
|
|
|
|
}
|
2005-08-26 21:32:05 +04:00
|
|
|
else
|
2003-10-03 00:31:17 +04:00
|
|
|
return realloc(ptr, nsize);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2004-08-13 23:52:53 +04:00
|
|
|
static int panic (lua_State *L) {
|
2010-02-18 22:18:41 +03:00
|
|
|
luai_writestringerror("PANIC: unprotected error in call to Lua API (%s)\n",
|
2005-07-11 18:01:28 +04:00
|
|
|
lua_tostring(L, -1));
|
2009-03-31 21:25:08 +04:00
|
|
|
return 0; /* return to Lua to abort */
|
2004-08-13 23:52:53 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2003-10-03 00:31:17 +04:00
|
|
|
LUALIB_API lua_State *luaL_newstate (void) {
|
2004-08-13 23:52:53 +04:00
|
|
|
lua_State *L = lua_newstate(l_alloc, NULL);
|
2005-07-11 18:01:28 +04:00
|
|
|
if (L) lua_atpanic(L, &panic);
|
2004-08-13 23:52:53 +04:00
|
|
|
return L;
|
2003-10-03 00:31:17 +04:00
|
|
|
}
|
|
|
|
|
2009-06-18 22:59:58 +04:00
|
|
|
|
|
|
|
LUALIB_API void luaL_checkversion_ (lua_State *L, lua_Number ver) {
|
|
|
|
const lua_Number *v = lua_version(L);
|
|
|
|
if (v != lua_version(NULL))
|
2009-06-19 18:21:57 +04:00
|
|
|
luaL_error(L, "multiple Lua VMs detected");
|
2009-06-18 22:59:58 +04:00
|
|
|
else if (*v != ver)
|
2009-06-19 18:21:57 +04:00
|
|
|
luaL_error(L, "version mismatch: app. needs %d, Lua core provides %f",
|
|
|
|
ver, *v);
|
2009-06-18 22:59:58 +04:00
|
|
|
}
|
2009-06-19 18:21:57 +04:00
|
|
|
|