1997-09-17 03:25:59 +08:00
|
|
|
/*
|
2010-03-30 01:44:31 +08:00
|
|
|
** $Id: lauxlib.c,v 1.205 2010/03/22 17:28:31 roberto Exp roberto $
|
1998-06-20 00:14:09 +08:00
|
|
|
** Auxiliary functions for building Lua libraries
|
1997-09-17 03:25:59 +08:00
|
|
|
** See Copyright Notice in lua.h
|
|
|
|
*/
|
|
|
|
|
1997-03-18 01:02:29 +08:00
|
|
|
|
2002-10-04 22:31:40 +08:00
|
|
|
#include <errno.h>
|
1997-03-18 23:30:50 +08:00
|
|
|
#include <stdarg.h>
|
1997-09-17 03:25:59 +08:00
|
|
|
#include <stdio.h>
|
2003-10-03 04:31:17 +08:00
|
|
|
#include <stdlib.h>
|
1998-06-19 00:57:03 +08:00
|
|
|
#include <string.h>
|
1997-03-18 01:02:29 +08:00
|
|
|
|
2002-06-04 04:11:41 +08:00
|
|
|
|
1999-12-28 01:33:22 +08:00
|
|
|
/* This file uses only the official API of Lua.
|
1999-02-26 05:07:26 +08:00
|
|
|
** Any function declared here could be written as an application function.
|
1998-01-09 23:09:53 +08:00
|
|
|
*/
|
1999-02-26 05:07:26 +08:00
|
|
|
|
2002-12-05 01:38:31 +08:00
|
|
|
#define lauxlib_c
|
2004-05-01 04:13:38 +08:00
|
|
|
#define LUA_LIB
|
2002-12-05 01:38:31 +08:00
|
|
|
|
1997-03-18 01:02:29 +08:00
|
|
|
#include "lua.h"
|
2000-06-12 21:52:05 +08:00
|
|
|
|
|
|
|
#include "lauxlib.h"
|
1997-03-18 01:02:29 +08:00
|
|
|
|
|
|
|
|
2003-04-07 22:35:00 +08:00
|
|
|
/* convert a stack index to positive */
|
|
|
|
#define abs_index(L, i) ((i) > 0 || (i) <= LUA_REGISTRYINDEX ? (i) : \
|
|
|
|
lua_gettop(L) + (i) + 1)
|
|
|
|
|
|
|
|
|
2009-02-28 02:17:13 +08: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-28 02:18:19 +08: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 23:32:50 +08:00
|
|
|
lua_pushglobaltable(L);
|
2009-02-28 02:18:19 +08:00
|
|
|
if (findfield(L, top + 1, 2)) {
|
2009-10-06 00:44:33 +08:00
|
|
|
lua_copy(L, -1, top + 1); /* move name to proper place */
|
|
|
|
lua_pop(L, 2); /* remove pushed values */
|
2009-02-28 02:18:19 +08:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
lua_settop(L, top); /* remove function and global table */
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-02-28 02:17:13 +08: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-28 02:18:19 +08: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 23:27:51 +08:00
|
|
|
lua_pushliteral(L, "?");
|
2009-02-28 02:18:19 +08:00
|
|
|
}
|
2009-02-28 02:17:13 +08:00
|
|
|
else
|
|
|
|
lua_pushfstring(L, "function <%s:%d>", ar->short_src, ar->linedefined);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static int countlevels (lua_State *L) {
|
|
|
|
lua_Debug ar;
|
2009-07-16 01:26:14 +08: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-28 02:17:13 +08: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 23:27:51 +08:00
|
|
|
lua_getinfo(L1, "Slnt", &ar);
|
2009-02-28 02:17:13 +08: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 23:27:51 +08:00
|
|
|
if (ar.istailcall)
|
|
|
|
lua_pushliteral(L, "\n\t(...tail calls...)");
|
2009-02-28 02:17:13 +08:00
|
|
|
lua_concat(L, lua_gettop(L) - top);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
lua_concat(L, lua_gettop(L) - top);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* }====================================================== */
|
|
|
|
|
|
|
|
|
2002-06-04 04:11:41 +08:00
|
|
|
/*
|
|
|
|
** {======================================================
|
|
|
|
** Error-report functions
|
|
|
|
** =======================================================
|
|
|
|
*/
|
1998-06-19 00:57:03 +08:00
|
|
|
|
2002-05-07 03:05:10 +08:00
|
|
|
LUALIB_API int luaL_argerror (lua_State *L, int narg, const char *extramsg) {
|
2000-03-31 01:19:48 +08:00
|
|
|
lua_Debug ar;
|
2005-08-09 20:30:19 +08:00
|
|
|
if (!lua_getstack(L, 0, &ar)) /* no stack frame? */
|
|
|
|
return luaL_error(L, "bad argument #%d (%s)", narg, extramsg);
|
2001-11-29 04:13:13 +08:00
|
|
|
lua_getinfo(L, "n", &ar);
|
2002-06-06 00:59:37 +08:00
|
|
|
if (strcmp(ar.namewhat, "method") == 0) {
|
|
|
|
narg--; /* do not count `self' */
|
|
|
|
if (narg == 0) /* error is in the self argument itself? */
|
2008-06-14 02:45:35 +08:00
|
|
|
return luaL_error(L, "calling " LUA_QS " on bad self", ar.name);
|
2002-06-06 00:59:37 +08:00
|
|
|
}
|
2000-01-19 20:00:45 +08:00
|
|
|
if (ar.name == NULL)
|
2009-02-28 02:18:19 +08:00
|
|
|
ar.name = (pushglobalfuncname(L, &ar)) ? lua_tostring(L, -1) : "?";
|
2005-05-18 03:49:15 +08:00
|
|
|
return luaL_error(L, "bad argument #%d to " LUA_QS " (%s)",
|
2002-05-07 03:05:10 +08:00
|
|
|
narg, ar.name, extramsg);
|
1997-03-18 01:02:29 +08:00
|
|
|
}
|
|
|
|
|
1999-12-28 19:52:49 +08:00
|
|
|
|
2009-02-14 03:39:34 +08:00
|
|
|
LUALIB_API int luaL_typeerror (lua_State *L, int narg, const char *tname) {
|
2002-05-17 02:39:46 +08:00
|
|
|
const char *msg = lua_pushfstring(L, "%s expected, got %s",
|
2004-07-10 02:23:17 +08:00
|
|
|
tname, luaL_typename(L, narg));
|
2002-05-17 02:39:46 +08:00
|
|
|
return luaL_argerror(L, narg, msg);
|
1999-12-28 19:52:49 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2001-01-26 00:45:36 +08:00
|
|
|
static void tag_error (lua_State *L, int narg, int tag) {
|
2009-02-14 03:39:34 +08:00
|
|
|
luaL_typeerror(L, narg, lua_typename(L, tag));
|
2001-01-26 00:45:36 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-08-09 04:08:41 +08: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-02 00:50:53 +08:00
|
|
|
lua_getinfo(L, "Sl", &ar); /* get info about it */
|
2002-08-09 04:08:41 +08: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 23:19:27 +08:00
|
|
|
LUALIB_API int luaL_error (lua_State *L, const char *fmt, ...) {
|
2002-06-04 04:11:41 +08:00
|
|
|
va_list argp;
|
|
|
|
va_start(argp, fmt);
|
2002-08-09 04:08:41 +08:00
|
|
|
luaL_where(L, 1);
|
2002-06-18 23:19:27 +08:00
|
|
|
lua_pushvfstring(L, fmt, argp);
|
2002-06-04 04:11:41 +08:00
|
|
|
va_end(argp);
|
2002-09-06 03:45:42 +08:00
|
|
|
lua_concat(L, 2);
|
2002-06-18 23:19:27 +08:00
|
|
|
return lua_error(L);
|
2002-06-04 04:11:41 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/* }====================================================== */
|
|
|
|
|
|
|
|
|
2007-06-21 22:09:59 +08:00
|
|
|
/*
|
|
|
|
** {======================================================
|
|
|
|
** Userdata's metatable manipulation
|
|
|
|
** =======================================================
|
|
|
|
*/
|
2002-06-04 04:11:41 +08:00
|
|
|
|
2003-03-18 20:25:32 +08:00
|
|
|
LUALIB_API int luaL_newmetatable (lua_State *L, const char *tname) {
|
2003-10-10 20:57:55 +08:00
|
|
|
lua_getfield(L, LUA_REGISTRYINDEX, tname); /* get registry.name */
|
2003-03-18 20:25:32 +08: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 20:57:55 +08:00
|
|
|
lua_pushvalue(L, -1);
|
|
|
|
lua_setfield(L, LUA_REGISTRYINDEX, tname); /* registry.name = metatable */
|
2003-03-18 20:25:32 +08:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2007-05-16 02:46:12 +08:00
|
|
|
LUALIB_API void *luaL_testudata (lua_State *L, int ud, const char *tname) {
|
2005-08-18 04:09:31 +08:00
|
|
|
void *p = lua_touserdata(L, ud);
|
2006-03-22 03:31:09 +08: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 22:37:27 +08: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-22 03:31:09 +08:00
|
|
|
}
|
|
|
|
}
|
2008-06-12 22:37:27 +08:00
|
|
|
return NULL; /* value is not a userdata with a metatable */
|
2007-05-16 02:46:12 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
LUALIB_API void *luaL_checkudata (lua_State *L, int ud, const char *tname) {
|
|
|
|
void *p = luaL_testudata(L, ud, tname);
|
2009-02-14 03:39:34 +08:00
|
|
|
if (p == NULL) luaL_typeerror(L, ud, tname);
|
2007-05-16 02:46:12 +08:00
|
|
|
return p;
|
2003-03-18 20:25:32 +08:00
|
|
|
}
|
|
|
|
|
2007-06-21 22:09:59 +08: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 20:25:32 +08:00
|
|
|
|
2009-07-16 01:26:14 +08: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 04:43:28 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-11-14 23:41:38 +08:00
|
|
|
LUALIB_API void luaL_checktype (lua_State *L, int narg, int t) {
|
2001-12-06 04:15:18 +08:00
|
|
|
if (lua_type(L, narg) != t)
|
2001-01-26 00:45:36 +08:00
|
|
|
tag_error(L, narg, t);
|
2000-10-03 04:10:55 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-11-14 23:41:38 +08:00
|
|
|
LUALIB_API void luaL_checkany (lua_State *L, int narg) {
|
2001-12-06 04:15:18 +08:00
|
|
|
if (lua_type(L, narg) == LUA_TNONE)
|
2001-11-29 04:13:13 +08:00
|
|
|
luaL_argerror(L, narg, "value expected");
|
2000-08-29 01:57:04 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-11-14 23:41:38 +08:00
|
|
|
LUALIB_API const char *luaL_checklstring (lua_State *L, int narg, size_t *len) {
|
2005-05-17 03:21:11 +08:00
|
|
|
const char *s = lua_tolstring(L, narg, len);
|
2001-01-26 00:45:36 +08:00
|
|
|
if (!s) tag_error(L, narg, LUA_TSTRING);
|
1999-10-06 02:33:43 +08:00
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
1997-03-18 01:02:29 +08:00
|
|
|
|
2002-11-14 23:41:38 +08:00
|
|
|
LUALIB_API const char *luaL_optlstring (lua_State *L, int narg,
|
|
|
|
const char *def, size_t *len) {
|
2002-03-27 23:30:41 +08:00
|
|
|
if (lua_isnoneornil(L, narg)) {
|
2000-09-29 20:40:56 +08:00
|
|
|
if (len)
|
|
|
|
*len = (def ? strlen(def) : 0);
|
1999-10-06 02:33:43 +08:00
|
|
|
return def;
|
|
|
|
}
|
2002-11-14 23:41:38 +08:00
|
|
|
else return luaL_checklstring(L, narg, len);
|
1997-03-18 01:02:29 +08:00
|
|
|
}
|
|
|
|
|
2000-09-29 20:40:56 +08:00
|
|
|
|
2002-11-14 23:41:38 +08:00
|
|
|
LUALIB_API lua_Number luaL_checknumber (lua_State *L, int narg) {
|
2000-12-05 02:33:40 +08:00
|
|
|
lua_Number d = lua_tonumber(L, narg);
|
2000-09-29 20:40:56 +08:00
|
|
|
if (d == 0 && !lua_isnumber(L, narg)) /* avoid extra test when d is not 0 */
|
2001-01-26 00:45:36 +08:00
|
|
|
tag_error(L, narg, LUA_TNUMBER);
|
2000-09-29 20:40:56 +08:00
|
|
|
return d;
|
1997-03-18 01:02:29 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-11-14 23:41:38 +08:00
|
|
|
LUALIB_API lua_Number luaL_optnumber (lua_State *L, int narg, lua_Number def) {
|
2005-10-21 21:47:42 +08:00
|
|
|
return luaL_opt(L, luaL_checknumber, narg, def);
|
1999-10-06 02:33:43 +08:00
|
|
|
}
|
1997-12-09 21:50:08 +08:00
|
|
|
|
|
|
|
|
2003-10-08 04:13:41 +08: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 21:47:42 +08:00
|
|
|
lua_Integer def) {
|
|
|
|
return luaL_opt(L, luaL_checkinteger, narg, def);
|
2003-10-08 04:13:41 +08:00
|
|
|
}
|
|
|
|
|
2007-06-21 22:09:59 +08:00
|
|
|
/* }====================================================== */
|
2004-09-22 00:54:32 +08:00
|
|
|
|
|
|
|
|
2000-09-12 01:38:42 +08:00
|
|
|
/*
|
|
|
|
** {======================================================
|
|
|
|
** Generic Buffer manipulation
|
|
|
|
** =======================================================
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
#define bufflen(B) ((B)->p - (B)->buffer)
|
|
|
|
#define bufffree(B) ((size_t)(LUAL_BUFFERSIZE - bufflen(B)))
|
|
|
|
|
|
|
|
#define LIMIT (LUA_MINSTACK/2)
|
|
|
|
|
|
|
|
|
|
|
|
static int emptybuffer (luaL_Buffer *B) {
|
|
|
|
size_t l = bufflen(B);
|
|
|
|
if (l == 0) return 0; /* put nothing on stack */
|
|
|
|
else {
|
|
|
|
lua_pushlstring(B->L, B->buffer, l);
|
|
|
|
B->p = B->buffer;
|
2002-08-31 04:00:59 +08:00
|
|
|
B->lvl++;
|
2000-09-12 01:38:42 +08:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static void adjuststack (luaL_Buffer *B) {
|
2002-08-31 04:00:59 +08:00
|
|
|
if (B->lvl > 1) {
|
2000-09-12 01:38:42 +08:00
|
|
|
lua_State *L = B->L;
|
|
|
|
int toget = 1; /* number of levels to concat */
|
2009-12-18 00:20:01 +08:00
|
|
|
size_t toplen = lua_rawlen(L, -1);
|
2000-09-12 01:38:42 +08:00
|
|
|
do {
|
2009-12-18 00:20:01 +08:00
|
|
|
size_t l = lua_rawlen(L, -(toget+1));
|
2002-08-31 04:00:59 +08:00
|
|
|
if (B->lvl - toget + 1 >= LIMIT || toplen > l) {
|
2000-09-12 01:38:42 +08:00
|
|
|
toplen += l;
|
|
|
|
toget++;
|
|
|
|
}
|
|
|
|
else break;
|
2002-08-31 04:00:59 +08:00
|
|
|
} while (toget < B->lvl);
|
2001-02-15 01:04:11 +08:00
|
|
|
lua_concat(L, toget);
|
2002-08-31 04:00:59 +08:00
|
|
|
B->lvl = B->lvl - toget + 1;
|
2000-09-12 01:38:42 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2001-11-29 04:13:13 +08:00
|
|
|
LUALIB_API char *luaL_prepbuffer (luaL_Buffer *B) {
|
2000-09-12 01:38:42 +08:00
|
|
|
if (emptybuffer(B))
|
|
|
|
adjuststack(B);
|
|
|
|
return B->buffer;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2001-11-29 04:13:13 +08:00
|
|
|
LUALIB_API void luaL_addlstring (luaL_Buffer *B, const char *s, size_t l) {
|
2010-03-13 02:59:32 +08:00
|
|
|
while (l) {
|
|
|
|
size_t space = bufffree(B);
|
|
|
|
if (space == 0) {
|
|
|
|
luaL_prepbuffer(B);
|
2010-03-23 01:28:31 +08:00
|
|
|
space = LUAL_BUFFERSIZE; /* bufffree(B) == LUAL_BUFFERSIZE */
|
2010-03-13 02:59:32 +08:00
|
|
|
}
|
|
|
|
if (space > l) space = l;
|
|
|
|
memcpy(B->p, s, space);
|
|
|
|
B->p += space;
|
|
|
|
s += space;
|
|
|
|
l -= space;
|
|
|
|
}
|
2000-09-12 01:38:42 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2001-11-29 04:13:13 +08:00
|
|
|
LUALIB_API void luaL_addstring (luaL_Buffer *B, const char *s) {
|
2000-09-12 21:48:22 +08:00
|
|
|
luaL_addlstring(B, s, strlen(s));
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2000-10-28 00:15:53 +08:00
|
|
|
LUALIB_API void luaL_pushresult (luaL_Buffer *B) {
|
2000-09-12 01:38:42 +08:00
|
|
|
emptybuffer(B);
|
2002-08-31 04:00:59 +08:00
|
|
|
lua_concat(B->L, B->lvl);
|
|
|
|
B->lvl = 1;
|
2000-09-12 01:38:42 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2000-10-28 00:15:53 +08:00
|
|
|
LUALIB_API void luaL_addvalue (luaL_Buffer *B) {
|
2000-09-12 01:38:42 +08:00
|
|
|
lua_State *L = B->L;
|
2005-05-17 03:21:11 +08:00
|
|
|
size_t vl;
|
|
|
|
const char *s = lua_tolstring(L, -1, &vl);
|
2000-09-12 01:38:42 +08:00
|
|
|
if (vl <= bufffree(B)) { /* fit into buffer? */
|
2005-05-17 03:21:11 +08:00
|
|
|
memcpy(B->p, s, vl); /* put it there */
|
2000-09-12 01:38:42 +08:00
|
|
|
B->p += vl;
|
|
|
|
lua_pop(L, 1); /* remove from stack */
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
if (emptybuffer(B))
|
|
|
|
lua_insert(L, -2); /* put buffer before new value */
|
2002-08-31 04:00:59 +08:00
|
|
|
B->lvl++; /* add new value into B stack */
|
2000-09-12 01:38:42 +08:00
|
|
|
adjuststack(B);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2000-10-28 00:15:53 +08:00
|
|
|
LUALIB_API void luaL_buffinit (lua_State *L, luaL_Buffer *B) {
|
2009-02-17 22:31:16 +08:00
|
|
|
luaL_checkstack(L, LIMIT + LUA_MINSTACK, "no space for new buffer");
|
2000-09-12 01:38:42 +08:00
|
|
|
B->L = L;
|
|
|
|
B->p = B->buffer;
|
2002-08-31 04:00:59 +08:00
|
|
|
B->lvl = 0;
|
1999-03-10 22:19:41 +08:00
|
|
|
}
|
2000-08-29 01:57:04 +08:00
|
|
|
|
2000-09-12 01:38:42 +08:00
|
|
|
/* }====================================================== */
|
2001-11-01 03:40:14 +08:00
|
|
|
|
|
|
|
|
2007-06-21 22:09:59 +08:00
|
|
|
/*
|
|
|
|
** {======================================================
|
|
|
|
** Reference system
|
|
|
|
** =======================================================
|
|
|
|
*/
|
|
|
|
|
|
|
|
/* number of prereserved references (for internal use) */
|
2009-09-19 02:58:45 +08:00
|
|
|
#define FREELIST_REF (LUA_RIDX_LAST + 1) /* free list of references */
|
2007-06-21 22:09:59 +08:00
|
|
|
|
|
|
|
|
2001-11-01 03:40:14 +08:00
|
|
|
LUALIB_API int luaL_ref (lua_State *L, int t) {
|
|
|
|
int ref;
|
2003-04-07 22:35:00 +08:00
|
|
|
t = abs_index(L, t);
|
2002-10-04 22:31:40 +08:00
|
|
|
if (lua_isnil(L, -1)) {
|
|
|
|
lua_pop(L, 1); /* remove from stack */
|
|
|
|
return LUA_REFNIL; /* `nil' has a unique fixed reference */
|
|
|
|
}
|
2003-02-11 17:44:38 +08:00
|
|
|
lua_rawgeti(L, t, FREELIST_REF); /* get first free element */
|
2003-10-08 04:13:41 +08:00
|
|
|
ref = (int)lua_tointeger(L, -1); /* ref = t[FREELIST_REF] */
|
2001-11-01 03:40:14 +08:00
|
|
|
lua_pop(L, 1); /* remove it from stack */
|
|
|
|
if (ref != 0) { /* any free element? */
|
|
|
|
lua_rawgeti(L, t, ref); /* remove it from list */
|
2003-02-11 17:44:38 +08:00
|
|
|
lua_rawseti(L, t, FREELIST_REF); /* (t[FREELIST_REF] = t[ref]) */
|
2001-11-01 03:40:14 +08:00
|
|
|
}
|
|
|
|
else { /* no free elements */
|
2009-12-18 00:20:01 +08:00
|
|
|
ref = (int)lua_rawlen(L, t) + 1; /* get a new reference */
|
2009-09-19 02:58:45 +08:00
|
|
|
if (ref == FREELIST_REF) { /* FREELIST_REF not initialized? */
|
|
|
|
lua_pushinteger(L, 0);
|
|
|
|
lua_rawseti(L, t, FREELIST_REF);
|
|
|
|
ref = FREELIST_REF + 1;
|
|
|
|
}
|
2001-11-01 03:40:14 +08:00
|
|
|
}
|
|
|
|
lua_rawseti(L, t, ref);
|
|
|
|
return ref;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
LUALIB_API void luaL_unref (lua_State *L, int t, int ref) {
|
|
|
|
if (ref >= 0) {
|
2003-04-07 22:35:00 +08:00
|
|
|
t = abs_index(L, t);
|
2003-02-11 17:44:38 +08:00
|
|
|
lua_rawgeti(L, t, FREELIST_REF);
|
|
|
|
lua_rawseti(L, t, ref); /* t[ref] = t[FREELIST_REF] */
|
2003-10-08 04:13:41 +08:00
|
|
|
lua_pushinteger(L, ref);
|
2003-02-11 17:44:38 +08:00
|
|
|
lua_rawseti(L, t, FREELIST_REF); /* t[FREELIST_REF] = ref */
|
2001-11-01 03:40:14 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-06-21 22:09:59 +08:00
|
|
|
/* }====================================================== */
|
2002-06-04 04:11:41 +08:00
|
|
|
|
2002-06-26 03:15:21 +08:00
|
|
|
|
2002-06-04 04:11:41 +08:00
|
|
|
/*
|
|
|
|
** {======================================================
|
|
|
|
** Load functions
|
|
|
|
** =======================================================
|
|
|
|
*/
|
|
|
|
|
|
|
|
typedef struct LoadF {
|
2010-02-19 03:32:41 +08:00
|
|
|
int first;
|
2002-06-04 04:11:41 +08:00
|
|
|
FILE *f;
|
|
|
|
char buff[LUAL_BUFFERSIZE];
|
|
|
|
} LoadF;
|
|
|
|
|
|
|
|
|
2002-08-07 01:26:45 +08:00
|
|
|
static const char *getF (lua_State *L, void *ud, size_t *size) {
|
2002-06-04 04:11:41 +08:00
|
|
|
LoadF *lf = (LoadF *)ud;
|
2002-08-07 01:26:45 +08:00
|
|
|
(void)L;
|
2010-02-19 03:32:41 +08:00
|
|
|
if (lf->first != EOF) {
|
|
|
|
*size = 1;
|
|
|
|
lf->buff[0] = (char)lf->first;
|
|
|
|
lf->first = EOF;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
/* '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;
|
|
|
|
*size = fread(lf->buff, 1, sizeof(lf->buff), lf->f);
|
|
|
|
}
|
2010-02-19 03:37:57 +08:00
|
|
|
return lf->buff;
|
2002-06-04 04:11:41 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2004-06-02 21:50:46 +08:00
|
|
|
static int errfile (lua_State *L, const char *what, int fnameindex) {
|
|
|
|
const char *serr = strerror(errno);
|
2002-10-17 04:41:35 +08:00
|
|
|
const char *filename = lua_tostring(L, fnameindex) + 1;
|
2004-06-02 21:50:46 +08:00
|
|
|
lua_pushfstring(L, "cannot %s %s: %s", what, filename, serr);
|
2002-10-17 04:41:35 +08:00
|
|
|
lua_remove(L, fnameindex);
|
2002-06-04 04:11:41 +08:00
|
|
|
return LUA_ERRFILE;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
LUALIB_API int luaL_loadfile (lua_State *L, const char *filename) {
|
|
|
|
LoadF lf;
|
2002-10-17 04:41:35 +08:00
|
|
|
int status, readstatus;
|
2002-06-04 04:11:41 +08:00
|
|
|
int c;
|
2002-10-17 04:41:35 +08: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 21:50:46 +08:00
|
|
|
if (lf.f == NULL) return errfile(L, "open", fnameindex);
|
2002-10-17 04:41:35 +08:00
|
|
|
}
|
2003-05-15 20:20:24 +08:00
|
|
|
c = getc(lf.f);
|
|
|
|
if (c == '#') { /* Unix exec. file? */
|
|
|
|
while ((c = getc(lf.f)) != EOF && c != '\n') ; /* skip first line */
|
|
|
|
}
|
2010-02-11 23:52:50 +08:00
|
|
|
else if (c == LUA_SIGNATURE[0] && filename) { /* binary file? */
|
2007-04-20 04:21:53 +08:00
|
|
|
lf.f = freopen(filename, "rb", lf.f); /* reopen in binary mode */
|
2004-06-02 21:50:46 +08:00
|
|
|
if (lf.f == NULL) return errfile(L, "reopen", fnameindex);
|
2002-06-04 04:11:41 +08:00
|
|
|
}
|
2010-02-19 03:32:41 +08:00
|
|
|
lf.first = c; /* 'c' is the first character of the stream */
|
2002-06-04 04:11:41 +08:00
|
|
|
status = lua_load(L, getF, &lf, lua_tostring(L, -1));
|
2002-10-17 04:41:35 +08:00
|
|
|
readstatus = ferror(lf.f);
|
2007-04-20 04:21:53 +08:00
|
|
|
if (filename) fclose(lf.f); /* close file (even in case of errors) */
|
2002-10-17 04:41:35 +08:00
|
|
|
if (readstatus) {
|
|
|
|
lua_settop(L, fnameindex); /* ignore results from `lua_load' */
|
2004-06-02 21:50:46 +08:00
|
|
|
return errfile(L, "read", fnameindex);
|
2002-06-04 04:11:41 +08:00
|
|
|
}
|
2002-10-17 04:41:35 +08:00
|
|
|
lua_remove(L, fnameindex);
|
2002-06-04 04:11:41 +08:00
|
|
|
return status;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
typedef struct LoadS {
|
|
|
|
const char *s;
|
|
|
|
size_t size;
|
|
|
|
} LoadS;
|
|
|
|
|
|
|
|
|
2002-08-07 01:26:45 +08:00
|
|
|
static const char *getS (lua_State *L, void *ud, size_t *size) {
|
2002-06-04 04:11:41 +08:00
|
|
|
LoadS *ls = (LoadS *)ud;
|
2002-08-07 01:26:45 +08:00
|
|
|
(void)L;
|
2002-06-04 04:11:41 +08: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-06-01 03:27:14 +08:00
|
|
|
|
2006-10-16 22:38:38 +08:00
|
|
|
LUALIB_API int luaL_loadstring (lua_State *L, const char *s) {
|
2005-08-15 22:12:32 +08:00
|
|
|
return luaL_loadbuffer(L, s, strlen(s), s);
|
|
|
|
}
|
|
|
|
|
2007-06-21 22:09:59 +08:00
|
|
|
/* }====================================================== */
|
2005-08-15 22:12:32 +08:00
|
|
|
|
|
|
|
|
2007-06-21 22:09:59 +08: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) {
|
|
|
|
obj = abs_index(L, obj);
|
|
|
|
if (!luaL_getmetafield(L, obj, event)) /* no metafield? */
|
|
|
|
return 0;
|
|
|
|
lua_pushvalue(L, obj);
|
|
|
|
lua_call(L, 1, 1);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-12-18 00:20:01 +08: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-04 01:07:59 +08:00
|
|
|
LUALIB_API const char *luaL_tolstring (lua_State *L, int idx, size_t *len) {
|
2007-06-21 22:09:59 +08: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-04 01:07:59 +08:00
|
|
|
lua_pushstring(L, (lua_toboolean(L, idx) ? "true" : "false"));
|
|
|
|
break;
|
2007-06-21 22:09:59 +08:00
|
|
|
case LUA_TNIL:
|
2008-01-04 01:07:59 +08:00
|
|
|
lua_pushliteral(L, "nil");
|
|
|
|
break;
|
2007-06-21 22:09:59 +08:00
|
|
|
default:
|
2008-01-04 01:07:59 +08:00
|
|
|
lua_pushfstring(L, "%s: %p", luaL_typename(L, idx),
|
2007-06-21 22:09:59 +08:00
|
|
|
lua_topointer(L, idx));
|
2008-01-04 01:07:59 +08:00
|
|
|
break;
|
2007-06-21 22:09:59 +08:00
|
|
|
}
|
|
|
|
}
|
2009-07-16 01:47:34 +08:00
|
|
|
return lua_tolstring(L, -1, len);
|
2007-06-21 22:09:59 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static int libsize (const luaL_Reg *l) {
|
|
|
|
int size = 0;
|
2010-03-18 05:37:37 +08:00
|
|
|
for (; l && l->name; l++) size++;
|
2007-06-21 22:09:59 +08:00
|
|
|
return size;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2010-03-18 05:37:37 +08:00
|
|
|
LUALIB_API void luaL_openlib (lua_State *L, const char *libname,
|
|
|
|
const luaL_Reg *l, int nup) {
|
2009-06-19 02:59:58 +08:00
|
|
|
luaL_checkversion(L);
|
2007-06-21 22:09:59 +08:00
|
|
|
if (libname) {
|
|
|
|
/* check whether lib already exists */
|
2008-01-18 00:24:30 +08:00
|
|
|
luaL_findtable(L, LUA_REGISTRYINDEX, "_LOADED", 1);
|
2007-06-21 22:09:59 +08:00
|
|
|
lua_getfield(L, -1, libname); /* get _LOADED[libname] */
|
|
|
|
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) */
|
2009-12-22 23:32:50 +08:00
|
|
|
lua_pushglobaltable(L);
|
|
|
|
if (luaL_findtable(L, 0, libname, libsize(l)) != NULL)
|
2007-06-21 22:09:59 +08:00
|
|
|
luaL_error(L, "name conflict for module " LUA_QS, libname);
|
|
|
|
lua_pushvalue(L, -1);
|
|
|
|
lua_setfield(L, -3, libname); /* _LOADED[libname] = new table */
|
|
|
|
}
|
|
|
|
lua_remove(L, -2); /* remove _LOADED table */
|
2010-03-18 05:37:37 +08:00
|
|
|
lua_insert(L, -(nup + 1)); /* move library table to below upvalues */
|
2007-06-21 22:09:59 +08:00
|
|
|
}
|
2010-03-18 05:37:37 +08:00
|
|
|
luaL_checkstack(L, nup, "too many upvalues");
|
|
|
|
for (; l && l->name; l++) { /* else fill the table with given functions */
|
|
|
|
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 22:09:59 +08:00
|
|
|
}
|
2010-03-18 05:37:37 +08:00
|
|
|
lua_pop(L, nup); /* remove upvalues */
|
2007-06-21 22:09:59 +08: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 23:32:50 +08:00
|
|
|
if (idx) lua_pushvalue(L, idx);
|
2007-06-21 22:09:59 +08: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 04:11:41 +08:00
|
|
|
|
|
|
|
|
2003-10-03 04:31:17 +08:00
|
|
|
static void *l_alloc (void *ud, void *ptr, size_t osize, size_t nsize) {
|
|
|
|
(void)ud;
|
2004-09-03 21:17:14 +08:00
|
|
|
(void)osize;
|
2003-10-03 04:31:17 +08:00
|
|
|
if (nsize == 0) {
|
|
|
|
free(ptr);
|
|
|
|
return NULL;
|
|
|
|
}
|
2005-08-27 01:32:05 +08:00
|
|
|
else
|
2003-10-03 04:31:17 +08:00
|
|
|
return realloc(ptr, nsize);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2004-08-14 03:52:53 +08:00
|
|
|
static int panic (lua_State *L) {
|
2010-02-19 03:18:41 +08:00
|
|
|
luai_writestringerror("PANIC: unprotected error in call to Lua API (%s)\n",
|
2005-07-11 22:01:28 +08:00
|
|
|
lua_tostring(L, -1));
|
2009-04-01 01:25:08 +08:00
|
|
|
return 0; /* return to Lua to abort */
|
2004-08-14 03:52:53 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2003-10-03 04:31:17 +08:00
|
|
|
LUALIB_API lua_State *luaL_newstate (void) {
|
2004-08-14 03:52:53 +08:00
|
|
|
lua_State *L = lua_newstate(l_alloc, NULL);
|
2005-07-11 22:01:28 +08:00
|
|
|
if (L) lua_atpanic(L, &panic);
|
2004-08-14 03:52:53 +08:00
|
|
|
return L;
|
2003-10-03 04:31:17 +08:00
|
|
|
}
|
|
|
|
|
2009-06-19 02:59:58 +08: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 22:21:57 +08:00
|
|
|
luaL_error(L, "multiple Lua VMs detected");
|
2009-06-19 02:59:58 +08:00
|
|
|
else if (*v != ver)
|
2009-06-19 22:21:57 +08:00
|
|
|
luaL_error(L, "version mismatch: app. needs %d, Lua core provides %f",
|
|
|
|
ver, *v);
|
2009-06-19 02:59:58 +08:00
|
|
|
}
|
2009-06-19 22:21:57 +08:00
|
|
|
|
2010-01-22 00:49:21 +08:00
|
|
|
|
|
|
|
LUALIB_API int luaL_cpcall (lua_State *L, lua_CFunction f, int nargs,
|
|
|
|
int nresults) {
|
|
|
|
nargs++; /* to include function itself */
|
2010-03-20 05:04:17 +08:00
|
|
|
lua_rawgeti(L, LUA_REGISTRYINDEX, LUA_RIDX_CCALL);
|
2010-03-30 01:44:31 +08:00
|
|
|
lua_insert(L, -nargs); /* 'ccall' is real function to be called */
|
2010-01-22 00:49:21 +08:00
|
|
|
lua_pushlightuserdata(L, &f);
|
2010-03-30 01:44:31 +08:00
|
|
|
lua_insert(L, -nargs); /* 'f' address is its first argument */
|
2010-01-22 00:49:21 +08:00
|
|
|
return lua_pcall(L, nargs, nresults, 0);
|
|
|
|
}
|
|
|
|
|