1997-09-16 23:25:59 +04:00
|
|
|
/*
|
2018-07-27 21:50:53 +03:00
|
|
|
** $Id: lauxlib.c $
|
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
|
|
|
|
*/
|
|
|
|
|
2014-11-02 22:19:04 +03:00
|
|
|
#define lauxlib_c
|
|
|
|
#define LUA_LIB
|
|
|
|
|
|
|
|
#include "lprefix.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
|
|
|
|
2016-01-08 18:33:09 +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
|
|
|
|
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
|
|
|
|
|
|
|
|
2018-11-09 22:03:52 +03:00
|
|
|
#if !defined(MAX_SIZET)
|
|
|
|
/* maximum value for size_t */
|
|
|
|
#define MAX_SIZET ((size_t)(~(size_t)0))
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
2009-02-27 21:17:13 +03:00
|
|
|
/*
|
|
|
|
** {======================================================
|
|
|
|
** Traceback
|
|
|
|
** =======================================================
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
2015-10-02 18:46:49 +03:00
|
|
|
#define LEVELS1 10 /* size of the first part of the stack */
|
|
|
|
#define LEVELS2 11 /* size of the second part of the stack */
|
2009-02-27 21:17:13 +03:00
|
|
|
|
|
|
|
|
2009-02-27 21:18:19 +03:00
|
|
|
|
|
|
|
/*
|
2019-05-28 21:50:40 +03:00
|
|
|
** Search for 'objidx' in table at index -1. ('objidx' must be an
|
|
|
|
** absolute index.) Return 1 + string at top if it found a good name.
|
2009-02-27 21:18:19 +03:00
|
|
|
*/
|
|
|
|
static int findfield (lua_State *L, int objidx, int level) {
|
|
|
|
if (level == 0 || !lua_istable(L, -1))
|
|
|
|
return 0; /* not found */
|
|
|
|
lua_pushnil(L); /* start 'next' loop */
|
2011-07-25 21:18:49 +04:00
|
|
|
while (lua_next(L, -2)) { /* for each pair in table */
|
2009-02-27 21:18:19 +03:00
|
|
|
if (lua_type(L, -2) == LUA_TSTRING) { /* ignore non-string keys */
|
2014-12-14 21:32:26 +03:00
|
|
|
if (lua_rawequal(L, objidx, -1)) { /* found object? */
|
2009-02-27 21:18:19 +03:00
|
|
|
lua_pop(L, 1); /* remove value (but keep name) */
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
else if (findfield(L, objidx, level - 1)) { /* try recursively */
|
2019-05-28 21:50:40 +03:00
|
|
|
/* stack: lib_name, lib_table, field_name (top) */
|
|
|
|
lua_pushliteral(L, "."); /* place '.' between the two names */
|
2019-07-05 21:03:15 +03:00
|
|
|
lua_replace(L, -3); /* (in the slot occupied by table) */
|
2019-05-28 21:50:40 +03:00
|
|
|
lua_concat(L, 3); /* lib_name.field_name */
|
2009-02-27 21:18:19 +03:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
lua_pop(L, 1); /* remove value */
|
|
|
|
}
|
|
|
|
return 0; /* not found */
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2014-12-14 21:32:26 +03:00
|
|
|
/*
|
|
|
|
** Search for a name for a function in all loaded modules
|
|
|
|
*/
|
2009-02-27 21:18:19 +03:00
|
|
|
static int pushglobalfuncname (lua_State *L, lua_Debug *ar) {
|
|
|
|
int top = lua_gettop(L);
|
|
|
|
lua_getinfo(L, "f", ar); /* push function */
|
2016-12-04 23:17:24 +03:00
|
|
|
lua_getfield(L, LUA_REGISTRYINDEX, LUA_LOADED_TABLE);
|
2014-12-14 21:32:26 +03:00
|
|
|
if (findfield(L, top + 1, 2)) {
|
|
|
|
const char *name = lua_tostring(L, -1);
|
2017-06-27 21:32:49 +03:00
|
|
|
if (strncmp(name, LUA_GNAME ".", 3) == 0) { /* name start with '_G.'? */
|
2014-12-14 21:32:26 +03:00
|
|
|
lua_pushstring(L, name + 3); /* push name without prefix */
|
|
|
|
lua_remove(L, -2); /* remove original name */
|
|
|
|
}
|
2019-05-28 21:50:40 +03:00
|
|
|
lua_copy(L, -1, top + 1); /* copy name to proper place */
|
2020-05-07 20:52:19 +03:00
|
|
|
lua_settop(L, top + 1); /* remove table "loaded" and name copy */
|
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) {
|
2014-12-10 14:31:32 +03:00
|
|
|
if (pushglobalfuncname(L, ar)) { /* try first a global name */
|
|
|
|
lua_pushfstring(L, "function '%s'", lua_tostring(L, -1));
|
|
|
|
lua_remove(L, -2); /* remove name */
|
|
|
|
}
|
|
|
|
else if (*ar->namewhat != '\0') /* is there a name from code? */
|
|
|
|
lua_pushfstring(L, "%s '%s'", ar->namewhat, ar->name); /* use it */
|
2009-02-27 21:17:13 +03:00
|
|
|
else if (*ar->what == 'm') /* main? */
|
2012-08-16 21:32:20 +04:00
|
|
|
lua_pushliteral(L, "main chunk");
|
2014-12-10 14:31:32 +03:00
|
|
|
else if (*ar->what != 'C') /* for Lua functions, use <file:line> */
|
2009-02-27 21:17:13 +03:00
|
|
|
lua_pushfstring(L, "function <%s:%d>", ar->short_src, ar->linedefined);
|
2014-12-10 14:31:32 +03:00
|
|
|
else /* nothing left... */
|
|
|
|
lua_pushliteral(L, "?");
|
2009-02-27 21:17:13 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2015-10-02 18:46:49 +03:00
|
|
|
static int lastlevel (lua_State *L) {
|
2009-02-27 21:17:13 +03:00
|
|
|
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) {
|
2019-05-28 21:50:40 +03:00
|
|
|
luaL_Buffer b;
|
2009-02-27 21:17:13 +03:00
|
|
|
lua_Debug ar;
|
2015-10-02 18:46:49 +03:00
|
|
|
int last = lastlevel(L1);
|
2019-05-28 21:50:40 +03:00
|
|
|
int limit2show = (last - level > LEVELS1 + LEVELS2) ? LEVELS1 : -1;
|
|
|
|
luaL_buffinit(L, &b);
|
|
|
|
if (msg) {
|
|
|
|
luaL_addstring(&b, msg);
|
|
|
|
luaL_addchar(&b, '\n');
|
|
|
|
}
|
|
|
|
luaL_addstring(&b, "stack traceback:");
|
2009-02-27 21:17:13 +03:00
|
|
|
while (lua_getstack(L1, level++, &ar)) {
|
2019-05-28 21:50:40 +03:00
|
|
|
if (limit2show-- == 0) { /* too many levels? */
|
|
|
|
int n = last - level - LEVELS2 + 1; /* number of levels to skip */
|
|
|
|
lua_pushfstring(L, "\n\t...\t(skipping %d levels)", n);
|
|
|
|
luaL_addvalue(&b); /* add warning about skip */
|
|
|
|
level += n; /* and skip to last levels */
|
2009-02-27 21:17:13 +03:00
|
|
|
}
|
|
|
|
else {
|
2009-11-25 18:27:51 +03:00
|
|
|
lua_getinfo(L1, "Slnt", &ar);
|
2019-05-28 21:50:40 +03:00
|
|
|
if (ar.currentline <= 0)
|
|
|
|
lua_pushfstring(L, "\n\t%s: in ", ar.short_src);
|
|
|
|
else
|
|
|
|
lua_pushfstring(L, "\n\t%s:%d: in ", ar.short_src, ar.currentline);
|
|
|
|
luaL_addvalue(&b);
|
2009-02-27 21:17:13 +03:00
|
|
|
pushfuncname(L, &ar);
|
2019-05-28 21:50:40 +03:00
|
|
|
luaL_addvalue(&b);
|
2009-11-25 18:27:51 +03:00
|
|
|
if (ar.istailcall)
|
2019-05-28 21:50:40 +03:00
|
|
|
luaL_addstring(&b, "\n\t(...tail calls...)");
|
2009-02-27 21:17:13 +03:00
|
|
|
}
|
|
|
|
}
|
2019-05-28 21:50:40 +03:00
|
|
|
luaL_pushresult(&b);
|
2009-02-27 21:17:13 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
/* }====================================================== */
|
|
|
|
|
|
|
|
|
2002-06-04 00:11:41 +04:00
|
|
|
/*
|
|
|
|
** {======================================================
|
|
|
|
** Error-report functions
|
|
|
|
** =======================================================
|
|
|
|
*/
|
1998-06-18 20:57:03 +04:00
|
|
|
|
2014-01-05 18:04:46 +04:00
|
|
|
LUALIB_API int luaL_argerror (lua_State *L, int arg, 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? */
|
2014-01-05 18:04:46 +04:00
|
|
|
return luaL_error(L, "bad argument #%d (%s)", arg, 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) {
|
2014-10-25 15:50:46 +04:00
|
|
|
arg--; /* do not count 'self' */
|
2014-01-05 18:04:46 +04:00
|
|
|
if (arg == 0) /* error is in the self argument itself? */
|
2014-10-17 20:28:21 +04:00
|
|
|
return luaL_error(L, "calling '%s' on bad self (%s)",
|
2012-10-19 19:55:01 +04:00
|
|
|
ar.name, extramsg);
|
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) : "?";
|
2014-10-17 20:28:21 +04:00
|
|
|
return luaL_error(L, "bad argument #%d to '%s' (%s)",
|
2014-01-05 18:04:46 +04:00
|
|
|
arg, ar.name, extramsg);
|
1997-03-17 20:02:29 +03:00
|
|
|
}
|
|
|
|
|
1999-12-28 14:52:49 +03:00
|
|
|
|
2021-02-24 17:14:44 +03:00
|
|
|
LUALIB_API int luaL_typeerror (lua_State *L, int arg, const char *tname) {
|
2014-02-11 21:39:15 +04:00
|
|
|
const char *msg;
|
2014-09-22 10:42:15 +04:00
|
|
|
const char *typearg; /* name for the type of the actual argument */
|
|
|
|
if (luaL_getmetafield(L, arg, "__name") == LUA_TSTRING)
|
|
|
|
typearg = lua_tostring(L, -1); /* use the given type name */
|
2014-02-19 17:48:53 +04:00
|
|
|
else if (lua_type(L, arg) == LUA_TLIGHTUSERDATA)
|
2014-09-22 10:42:15 +04:00
|
|
|
typearg = "light userdata"; /* special name for messages */
|
|
|
|
else
|
|
|
|
typearg = luaL_typename(L, arg); /* standard name */
|
2014-02-11 21:39:15 +04:00
|
|
|
msg = lua_pushfstring(L, "%s expected, got %s", tname, typearg);
|
2014-01-05 18:04:46 +04:00
|
|
|
return luaL_argerror(L, arg, msg);
|
1999-12-28 14:52:49 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2014-01-05 18:04:46 +04:00
|
|
|
static void tag_error (lua_State *L, int arg, int tag) {
|
2018-12-10 18:46:03 +03:00
|
|
|
luaL_typeerror(L, arg, lua_typename(L, tag));
|
2001-01-25 19:45:36 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2015-12-14 14:59:27 +03:00
|
|
|
/*
|
|
|
|
** The use of 'lua_pushfstring' ensures this function does not
|
|
|
|
** need reserved stack space when called.
|
|
|
|
*/
|
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;
|
|
|
|
}
|
|
|
|
}
|
2015-12-14 14:59:27 +03:00
|
|
|
lua_pushfstring(L, ""); /* else, no information available... */
|
2002-08-09 00:08:41 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2015-12-14 14:59:27 +03:00
|
|
|
/*
|
|
|
|
** Again, the use of 'lua_pushvfstring' ensures this function does
|
2016-01-08 18:33:09 +03:00
|
|
|
** not need reserved stack space when called. (At worst, it generates
|
|
|
|
** an error with "stack overflow" instead of the given message.)
|
2015-12-14 14:59:27 +03:00
|
|
|
*/
|
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
|
|
|
}
|
|
|
|
|
2011-03-03 19:34:46 +03:00
|
|
|
|
|
|
|
LUALIB_API int luaL_fileresult (lua_State *L, int stat, const char *fname) {
|
|
|
|
int en = errno; /* calls to Lua API may change this value */
|
|
|
|
if (stat) {
|
|
|
|
lua_pushboolean(L, 1);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
else {
|
2019-08-16 20:58:02 +03:00
|
|
|
luaL_pushfail(L);
|
2011-03-03 19:34:46 +03:00
|
|
|
if (fname)
|
|
|
|
lua_pushfstring(L, "%s: %s", fname, strerror(en));
|
|
|
|
else
|
2012-08-16 21:32:20 +04:00
|
|
|
lua_pushstring(L, strerror(en));
|
2011-03-03 19:34:46 +03:00
|
|
|
lua_pushinteger(L, en);
|
|
|
|
return 3;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2014-10-22 15:44:20 +04:00
|
|
|
#if !defined(l_inspectstat) /* { */
|
2011-03-03 19:34:46 +03:00
|
|
|
|
|
|
|
#if defined(LUA_USE_POSIX)
|
|
|
|
|
|
|
|
#include <sys/wait.h>
|
|
|
|
|
|
|
|
/*
|
|
|
|
** use appropriate macros to interpret 'pclose' return status
|
|
|
|
*/
|
2014-10-22 15:44:20 +04:00
|
|
|
#define l_inspectstat(stat,what) \
|
2011-03-03 19:34:46 +03:00
|
|
|
if (WIFEXITED(stat)) { stat = WEXITSTATUS(stat); } \
|
|
|
|
else if (WIFSIGNALED(stat)) { stat = WTERMSIG(stat); what = "signal"; }
|
|
|
|
|
|
|
|
#else
|
|
|
|
|
2014-10-22 15:44:20 +04:00
|
|
|
#define l_inspectstat(stat,what) /* no op */
|
2011-03-03 19:34:46 +03:00
|
|
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#endif /* } */
|
|
|
|
|
|
|
|
|
|
|
|
LUALIB_API int luaL_execresult (lua_State *L, int stat) {
|
2020-05-22 21:39:29 +03:00
|
|
|
if (stat != 0 && errno != 0) /* error with an 'errno'? */
|
2011-03-03 19:34:46 +03:00
|
|
|
return luaL_fileresult(L, 0, NULL);
|
|
|
|
else {
|
2020-11-03 22:34:36 +03:00
|
|
|
const char *what = "exit"; /* type of termination */
|
2014-10-22 15:44:20 +04:00
|
|
|
l_inspectstat(stat, what); /* interpret result */
|
2011-03-03 19:34:46 +03:00
|
|
|
if (*what == 'e' && stat == 0) /* successful termination? */
|
2011-06-16 18:11:04 +04:00
|
|
|
lua_pushboolean(L, 1);
|
|
|
|
else
|
2019-08-16 20:58:02 +03:00
|
|
|
luaL_pushfail(L);
|
2011-06-16 18:11:04 +04:00
|
|
|
lua_pushstring(L, what);
|
|
|
|
lua_pushinteger(L, stat);
|
2019-08-16 20:58:02 +03:00
|
|
|
return 3; /* return true/fail,what,code */
|
2011-03-03 19:34:46 +03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2002-06-04 00:11:41 +04:00
|
|
|
/* }====================================================== */
|
2018-07-27 21:50:53 +03:00
|
|
|
|
|
|
|
|
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) {
|
2015-02-03 20:38:24 +03:00
|
|
|
if (luaL_getmetatable(L, tname) != LUA_TNIL) /* name already in use? */
|
2003-03-18 15:25:32 +03:00
|
|
|
return 0; /* leave previous value on top, but return 0 */
|
|
|
|
lua_pop(L, 1);
|
2015-06-18 17:23:14 +03:00
|
|
|
lua_createtable(L, 0, 2); /* create metatable */
|
2014-02-11 21:39:15 +04:00
|
|
|
lua_pushstring(L, tname);
|
|
|
|
lua_setfield(L, -2, "__name"); /* metatable.__name = tname */
|
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;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2010-11-10 21:05:36 +03:00
|
|
|
LUALIB_API void luaL_setmetatable (lua_State *L, const char *tname) {
|
|
|
|
luaL_getmetatable(L, tname);
|
|
|
|
lua_setmetatable(L, -2);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
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? */
|
2011-12-02 17:25:57 +04:00
|
|
|
luaL_getmetatable(L, 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);
|
2018-12-10 18:46:03 +03:00
|
|
|
luaL_argexpected(L, p != NULL, 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
|
|
|
|
** =======================================================
|
|
|
|
*/
|
|
|
|
|
2014-01-05 18:04:46 +04:00
|
|
|
LUALIB_API int luaL_checkoption (lua_State *L, int arg, const char *def,
|
2007-06-21 18:09:59 +04:00
|
|
|
const char *const lst[]) {
|
2014-01-05 18:04:46 +04:00
|
|
|
const char *name = (def) ? luaL_optstring(L, arg, def) :
|
|
|
|
luaL_checkstring(L, arg);
|
2007-06-21 18:09:59 +04:00
|
|
|
int i;
|
|
|
|
for (i=0; lst[i]; i++)
|
|
|
|
if (strcmp(lst[i], name) == 0)
|
|
|
|
return i;
|
2014-01-05 18:04:46 +04:00
|
|
|
return luaL_argerror(L, arg,
|
2014-10-17 20:28:21 +04:00
|
|
|
lua_pushfstring(L, "invalid option '%s'", name));
|
2007-06-21 18:09:59 +04:00
|
|
|
}
|
|
|
|
|
2003-03-18 15:25:32 +03:00
|
|
|
|
2015-12-14 14:59:27 +03:00
|
|
|
/*
|
2016-01-08 18:33:09 +03:00
|
|
|
** Ensures the stack has at least 'space' extra slots, raising an error
|
|
|
|
** if it cannot fulfill the request. (The error handling needs a few
|
|
|
|
** extra slots to format the error message. In case of an error without
|
|
|
|
** this extra space, Lua will generate the same 'stack overflow' error,
|
2015-12-14 14:59:27 +03:00
|
|
|
** but without 'msg'.)
|
|
|
|
*/
|
2009-07-15 21:26:14 +04:00
|
|
|
LUALIB_API void luaL_checkstack (lua_State *L, int space, const char *msg) {
|
2021-02-24 17:14:44 +03:00
|
|
|
if (l_unlikely(!lua_checkstack(L, space))) {
|
2009-07-15 21:26:14 +04:00
|
|
|
if (msg)
|
|
|
|
luaL_error(L, "stack overflow (%s)", msg);
|
|
|
|
else
|
|
|
|
luaL_error(L, "stack overflow");
|
|
|
|
}
|
2000-08-30 00:43:28 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2014-01-05 18:04:46 +04:00
|
|
|
LUALIB_API void luaL_checktype (lua_State *L, int arg, int t) {
|
2021-02-24 17:14:44 +03:00
|
|
|
if (l_unlikely(lua_type(L, arg) != t))
|
2014-01-05 18:04:46 +04:00
|
|
|
tag_error(L, arg, t);
|
2000-10-03 00:10:55 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2014-01-05 18:04:46 +04:00
|
|
|
LUALIB_API void luaL_checkany (lua_State *L, int arg) {
|
2021-02-24 17:14:44 +03:00
|
|
|
if (l_unlikely(lua_type(L, arg) == LUA_TNONE))
|
2014-01-05 18:04:46 +04:00
|
|
|
luaL_argerror(L, arg, "value expected");
|
2000-08-28 21:57:04 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2014-01-05 18:04:46 +04:00
|
|
|
LUALIB_API const char *luaL_checklstring (lua_State *L, int arg, size_t *len) {
|
|
|
|
const char *s = lua_tolstring(L, arg, len);
|
2021-02-24 17:14:44 +03:00
|
|
|
if (l_unlikely(!s)) tag_error(L, arg, LUA_TSTRING);
|
1999-10-05 22:33:43 +04:00
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
1997-03-17 20:02:29 +03:00
|
|
|
|
2014-01-05 18:04:46 +04:00
|
|
|
LUALIB_API const char *luaL_optlstring (lua_State *L, int arg,
|
2002-11-14 18:41:38 +03:00
|
|
|
const char *def, size_t *len) {
|
2014-01-05 18:04:46 +04:00
|
|
|
if (lua_isnoneornil(L, arg)) {
|
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;
|
|
|
|
}
|
2014-01-05 18:04:46 +04:00
|
|
|
else return luaL_checklstring(L, arg, len);
|
1997-03-17 20:02:29 +03:00
|
|
|
}
|
|
|
|
|
2000-09-29 16:40:56 +04:00
|
|
|
|
2014-01-05 18:04:46 +04:00
|
|
|
LUALIB_API lua_Number luaL_checknumber (lua_State *L, int arg) {
|
2010-07-02 21:35:06 +04:00
|
|
|
int isnum;
|
2014-01-05 18:04:46 +04:00
|
|
|
lua_Number d = lua_tonumberx(L, arg, &isnum);
|
2021-02-24 17:14:44 +03:00
|
|
|
if (l_unlikely(!isnum))
|
2014-01-05 18:04:46 +04:00
|
|
|
tag_error(L, arg, LUA_TNUMBER);
|
2000-09-29 16:40:56 +04:00
|
|
|
return d;
|
1997-03-17 20:02:29 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2014-01-05 18:04:46 +04:00
|
|
|
LUALIB_API lua_Number luaL_optnumber (lua_State *L, int arg, lua_Number def) {
|
|
|
|
return luaL_opt(L, luaL_checknumber, arg, def);
|
1999-10-05 22:33:43 +04:00
|
|
|
}
|
1997-12-09 16:50:08 +03:00
|
|
|
|
|
|
|
|
2014-01-05 18:04:46 +04:00
|
|
|
static void interror (lua_State *L, int arg) {
|
2014-07-17 16:30:53 +04:00
|
|
|
if (lua_isnumber(L, arg))
|
|
|
|
luaL_argerror(L, arg, "number has no integer representation");
|
2013-06-14 22:34:49 +04:00
|
|
|
else
|
2014-01-05 18:04:46 +04:00
|
|
|
tag_error(L, arg, LUA_TNUMBER);
|
2013-06-14 22:34:49 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2014-01-05 18:04:46 +04:00
|
|
|
LUALIB_API lua_Integer luaL_checkinteger (lua_State *L, int arg) {
|
2010-07-02 21:35:06 +04:00
|
|
|
int isnum;
|
2014-01-05 18:04:46 +04:00
|
|
|
lua_Integer d = lua_tointegerx(L, arg, &isnum);
|
2021-02-24 17:14:44 +03:00
|
|
|
if (l_unlikely(!isnum)) {
|
2014-01-05 18:04:46 +04:00
|
|
|
interror(L, arg);
|
2013-06-14 22:34:49 +04:00
|
|
|
}
|
2003-10-08 00:13:41 +04:00
|
|
|
return d;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2014-01-05 18:04:46 +04:00
|
|
|
LUALIB_API lua_Integer luaL_optinteger (lua_State *L, int arg,
|
2005-10-21 17:47:42 +04:00
|
|
|
lua_Integer def) {
|
2014-01-05 18:04:46 +04:00
|
|
|
return luaL_opt(L, luaL_checkinteger, arg, 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
|
|
|
|
** =======================================================
|
|
|
|
*/
|
|
|
|
|
2015-06-18 17:23:14 +03:00
|
|
|
/* userdata to box arbitrary data */
|
|
|
|
typedef struct UBox {
|
|
|
|
void *box;
|
|
|
|
size_t bsize;
|
|
|
|
} UBox;
|
|
|
|
|
|
|
|
|
|
|
|
static void *resizebox (lua_State *L, int idx, size_t newsize) {
|
|
|
|
void *ud;
|
|
|
|
lua_Alloc allocf = lua_getallocf(L, &ud);
|
|
|
|
UBox *box = (UBox *)lua_touserdata(L, idx);
|
|
|
|
void *temp = allocf(ud, box->box, box->bsize, newsize);
|
2021-02-24 17:14:44 +03:00
|
|
|
if (l_unlikely(temp == NULL && newsize > 0)) { /* allocation error? */
|
2020-07-06 18:09:44 +03:00
|
|
|
lua_pushliteral(L, "not enough memory");
|
|
|
|
lua_error(L); /* raise a memory error */
|
|
|
|
}
|
2015-06-18 17:23:14 +03:00
|
|
|
box->box = temp;
|
|
|
|
box->bsize = newsize;
|
|
|
|
return temp;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static int boxgc (lua_State *L) {
|
|
|
|
resizebox(L, 1, 0);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2018-11-13 18:50:33 +03:00
|
|
|
static const luaL_Reg boxmt[] = { /* box metamethods */
|
|
|
|
{"__gc", boxgc},
|
|
|
|
{"__close", boxgc},
|
|
|
|
{NULL, NULL}
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
static void newbox (lua_State *L) {
|
2018-02-21 16:48:44 +03:00
|
|
|
UBox *box = (UBox *)lua_newuserdatauv(L, sizeof(UBox), 0);
|
2015-06-18 17:23:14 +03:00
|
|
|
box->box = NULL;
|
|
|
|
box->bsize = 0;
|
2018-11-13 18:50:33 +03:00
|
|
|
if (luaL_newmetatable(L, "_UBOX*")) /* creating metatable? */
|
|
|
|
luaL_setfuncs(L, boxmt, 0); /* set its metamethods */
|
2015-06-18 17:23:14 +03:00
|
|
|
lua_setmetatable(L, -2);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2010-04-09 20:14:46 +04:00
|
|
|
/*
|
|
|
|
** check whether buffer is using a userdata on the stack as a temporary
|
|
|
|
** buffer
|
|
|
|
*/
|
2017-04-24 21:06:12 +03:00
|
|
|
#define buffonstack(B) ((B)->b != (B)->init.b)
|
2000-09-11 21:38:42 +04:00
|
|
|
|
|
|
|
|
2021-03-02 17:39:42 +03:00
|
|
|
/*
|
|
|
|
** Whenever buffer is accessed, slot 'idx' must either be a box (which
|
|
|
|
** cannot be NULL) or it is a placeholder for the buffer.
|
|
|
|
*/
|
|
|
|
#define checkbufferlevel(B,idx) \
|
|
|
|
lua_assert(buffonstack(B) ? lua_touserdata(B->L, idx) != NULL \
|
|
|
|
: lua_touserdata(B->L, idx) == (void*)B)
|
|
|
|
|
|
|
|
|
2010-04-09 20:14:46 +04:00
|
|
|
/*
|
2018-11-09 22:03:52 +03:00
|
|
|
** Compute new size for buffer 'B', enough to accommodate extra 'sz'
|
2022-09-06 16:58:55 +03:00
|
|
|
** bytes. (The test for "not big enough" also gets the case when the
|
|
|
|
** computation of 'newsize' overflows.)
|
2010-04-09 20:14:46 +04:00
|
|
|
*/
|
2018-11-09 22:03:52 +03:00
|
|
|
static size_t newbuffsize (luaL_Buffer *B, size_t sz) {
|
2022-09-06 16:58:55 +03:00
|
|
|
size_t newsize = (B->size / 2) * 3; /* buffer size * 1.5 */
|
2021-02-24 17:14:44 +03:00
|
|
|
if (l_unlikely(MAX_SIZET - sz < B->n)) /* overflow in (B->n + sz)? */
|
2018-11-09 22:03:52 +03:00
|
|
|
return luaL_error(B->L, "buffer too large");
|
2022-09-06 16:58:55 +03:00
|
|
|
if (newsize < B->n + sz) /* not big enough? */
|
2018-11-09 22:03:52 +03:00
|
|
|
newsize = B->n + sz;
|
|
|
|
return newsize;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
** Returns a pointer to a free area with at least 'sz' bytes in buffer
|
2021-03-02 17:39:42 +03:00
|
|
|
** 'B'. 'boxidx' is the relative position in the stack where is the
|
|
|
|
** buffer's box or its placeholder.
|
2018-11-09 22:03:52 +03:00
|
|
|
*/
|
|
|
|
static char *prepbuffsize (luaL_Buffer *B, size_t sz, int boxidx) {
|
2021-03-02 17:39:42 +03:00
|
|
|
checkbufferlevel(B, boxidx);
|
2018-11-09 22:03:52 +03:00
|
|
|
if (B->size - B->n >= sz) /* enough space? */
|
|
|
|
return B->b + B->n;
|
|
|
|
else {
|
|
|
|
lua_State *L = B->L;
|
2010-04-09 20:14:46 +04:00
|
|
|
char *newbuff;
|
2018-11-09 22:03:52 +03:00
|
|
|
size_t newsize = newbuffsize(B, sz);
|
2011-05-03 20:01:57 +04:00
|
|
|
/* create larger buffer */
|
2018-11-09 22:03:52 +03:00
|
|
|
if (buffonstack(B)) /* buffer already has a box? */
|
|
|
|
newbuff = (char *)resizebox(L, boxidx, newsize); /* resize it */
|
|
|
|
else { /* no box yet */
|
2021-03-02 17:39:42 +03:00
|
|
|
lua_remove(L, boxidx); /* remove placeholder */
|
2018-11-13 18:50:33 +03:00
|
|
|
newbox(L); /* create a new box */
|
2021-01-11 21:03:01 +03:00
|
|
|
lua_insert(L, boxidx); /* move box to its intended position */
|
2018-11-13 18:50:33 +03:00
|
|
|
lua_toclose(L, boxidx);
|
|
|
|
newbuff = (char *)resizebox(L, boxidx, newsize);
|
|
|
|
memcpy(newbuff, B->b, B->n * sizeof(char)); /* copy original content */
|
2015-06-18 17:23:14 +03:00
|
|
|
}
|
2010-04-09 20:14:46 +04:00
|
|
|
B->b = newbuff;
|
|
|
|
B->size = newsize;
|
2018-11-09 22:03:52 +03:00
|
|
|
return newbuff + B->n;
|
2000-09-11 21:38:42 +04:00
|
|
|
}
|
2018-11-09 22:03:52 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
** returns a pointer to a free area with at least 'sz' bytes
|
|
|
|
*/
|
|
|
|
LUALIB_API char *luaL_prepbuffsize (luaL_Buffer *B, size_t sz) {
|
|
|
|
return prepbuffsize(B, sz, -1);
|
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) {
|
2015-10-06 19:10:22 +03:00
|
|
|
if (l > 0) { /* avoid 'memcpy' when 's' can be NULL */
|
2018-11-09 22:03:52 +03:00
|
|
|
char *b = prepbuffsize(B, l, -1);
|
2015-10-06 19:10:22 +03:00
|
|
|
memcpy(b, s, l * sizeof(char));
|
|
|
|
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;
|
2021-03-02 17:39:42 +03:00
|
|
|
checkbufferlevel(B, -1);
|
2010-04-09 20:14:46 +04:00
|
|
|
lua_pushlstring(L, B->b, B->n);
|
2021-03-02 17:39:42 +03:00
|
|
|
if (buffonstack(B))
|
2021-01-11 21:03:01 +03:00
|
|
|
lua_closeslot(L, -2); /* close the box */
|
2021-03-02 17:39:42 +03:00
|
|
|
lua_remove(L, -2); /* remove box or placeholder from the stack */
|
2010-04-09 20:14:46 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
}
|
|
|
|
|
|
|
|
|
2018-11-09 22:03:52 +03:00
|
|
|
/*
|
|
|
|
** 'luaL_addvalue' is the only function in the Buffer system where the
|
|
|
|
** box (if existent) is not on the top of the stack. So, instead of
|
|
|
|
** calling 'luaL_addlstring', it replicates the code using -2 as the
|
|
|
|
** last argument to 'prepbuffsize', signaling that the box is (or will
|
2022-08-19 20:10:18 +03:00
|
|
|
** be) below the string being added to the buffer. (Box creation can
|
2018-11-09 22:03:52 +03:00
|
|
|
** trigger an emergency GC, so we should not remove the string from the
|
|
|
|
** stack before we have the space guaranteed.)
|
|
|
|
*/
|
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;
|
2018-11-09 22:03:52 +03:00
|
|
|
size_t len;
|
|
|
|
const char *s = lua_tolstring(L, -1, &len);
|
|
|
|
char *b = prepbuffsize(B, len, -2);
|
|
|
|
memcpy(b, s, len * sizeof(char));
|
|
|
|
luaL_addsize(B, len);
|
|
|
|
lua_pop(L, 1); /* pop string */
|
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;
|
2017-04-24 21:06:12 +03:00
|
|
|
B->b = B->init.b;
|
2010-04-09 20:14:46 +04:00
|
|
|
B->n = 0;
|
|
|
|
B->size = LUAL_BUFFERSIZE;
|
2021-03-02 17:39:42 +03:00
|
|
|
lua_pushlightuserdata(L, (void*)B); /* push placeholder */
|
2010-04-09 20:14:46 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
LUALIB_API char *luaL_buffinitsize (lua_State *L, luaL_Buffer *B, size_t sz) {
|
|
|
|
luaL_buffinit(L, B);
|
2018-11-09 22:03:52 +03:00
|
|
|
return prepbuffsize(B, sz, -1);
|
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
|
|
|
|
** =======================================================
|
|
|
|
*/
|
|
|
|
|
2020-12-03 18:00:32 +03:00
|
|
|
/* index of free-list header (after the predefined values) */
|
|
|
|
#define freelist (LUA_RIDX_LAST + 1)
|
2007-06-21 18:09:59 +04:00
|
|
|
|
2020-12-03 18:00:32 +03:00
|
|
|
/*
|
|
|
|
** The previously freed references form a linked list:
|
|
|
|
** t[freelist] is the index of a first free index, or zero if list is
|
|
|
|
** empty; t[t[freelist]] is the index of the second element; etc.
|
|
|
|
*/
|
2001-10-31 22:40:14 +03:00
|
|
|
LUALIB_API int luaL_ref (lua_State *L, int t) {
|
|
|
|
int ref;
|
2002-10-04 18:31:40 +04:00
|
|
|
if (lua_isnil(L, -1)) {
|
|
|
|
lua_pop(L, 1); /* remove from stack */
|
2014-10-25 15:50:46 +04:00
|
|
|
return LUA_REFNIL; /* 'nil' has a unique fixed reference */
|
2002-10-04 18:31:40 +04:00
|
|
|
}
|
2012-06-01 00:28:45 +04:00
|
|
|
t = lua_absindex(L, t);
|
2020-12-03 18:00:32 +03:00
|
|
|
if (lua_rawgeti(L, t, freelist) == LUA_TNIL) { /* first access? */
|
|
|
|
ref = 0; /* list is empty */
|
|
|
|
lua_pushinteger(L, 0); /* initialize as an empty list */
|
|
|
|
lua_rawseti(L, t, freelist); /* ref = t[freelist] = 0 */
|
|
|
|
}
|
|
|
|
else { /* already initialized */
|
|
|
|
lua_assert(lua_isinteger(L, -1));
|
|
|
|
ref = (int)lua_tointeger(L, -1); /* ref = t[freelist] */
|
|
|
|
}
|
|
|
|
lua_pop(L, 1); /* remove element from stack */
|
2001-10-31 22:40:14 +03:00
|
|
|
if (ref != 0) { /* any free element? */
|
|
|
|
lua_rawgeti(L, t, ref); /* remove it from list */
|
2010-08-04 00:21:16 +04:00
|
|
|
lua_rawseti(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-08-04 00:21:16 +04:00
|
|
|
lua_rawgeti(L, t, freelist);
|
2020-12-03 18:00:32 +03:00
|
|
|
lua_assert(lua_isinteger(L, -1));
|
2010-05-10 19:25:02 +04:00
|
|
|
lua_rawseti(L, t, ref); /* t[ref] = t[freelist] */
|
2003-10-08 00:13:41 +04:00
|
|
|
lua_pushinteger(L, ref);
|
2010-08-04 00:21:16 +04:00
|
|
|
lua_rawseti(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 */
|
2014-11-21 15:17:58 +03:00
|
|
|
char buff[BUFSIZ]; /* 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;
|
2011-11-30 16:58:57 +04:00
|
|
|
(void)L; /* not used */
|
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;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2022-08-23 22:08:53 +03:00
|
|
|
/*
|
|
|
|
** Skip an optional BOM at the start of a stream. If there is an
|
|
|
|
** incomplete BOM (the first character is correct but the rest is
|
|
|
|
** not), returns the first character anyway to force an error
|
|
|
|
** (as no chunk can start with 0xEF).
|
|
|
|
*/
|
|
|
|
static int skipBOM (FILE *f) {
|
|
|
|
int c = getc(f); /* read first character */
|
|
|
|
if (c == 0xEF && getc(f) == 0xBB && getc(f) == 0xBF) /* correct BOM? */
|
|
|
|
return getc(f); /* ignore BOM and return next char */
|
|
|
|
else /* no (valid) BOM */
|
|
|
|
return c; /* return first character */
|
2010-10-01 22:53:00 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2010-06-09 21:53:59 +04:00
|
|
|
/*
|
2010-10-01 22:53:00 +04:00
|
|
|
** reads the first character of file 'f' and skips an optional BOM mark
|
|
|
|
** in its beginning plus 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 BOM and
|
|
|
|
** a first-line comment).
|
2010-06-09 21:53:59 +04:00
|
|
|
*/
|
2022-08-23 22:08:53 +03:00
|
|
|
static int skipcomment (FILE *f, int *cp) {
|
|
|
|
int c = *cp = skipBOM(f);
|
2010-06-09 21:53:59 +04:00
|
|
|
if (c == '#') { /* first line is a comment (Unix exec. file)? */
|
2012-03-20 02:57:14 +04:00
|
|
|
do { /* skip first line */
|
2022-08-23 22:08:53 +03:00
|
|
|
c = getc(f);
|
2015-12-14 14:59:27 +03:00
|
|
|
} while (c != EOF && c != '\n');
|
2022-08-23 22:08:53 +03:00
|
|
|
*cp = getc(f); /* next character after comment, if present */
|
2010-06-09 21:53:59 +04:00
|
|
|
return 1; /* there was a comment */
|
|
|
|
}
|
|
|
|
else return 0; /* no comment */
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2011-11-14 21:10:24 +04:00
|
|
|
LUALIB_API int luaL_loadfilex (lua_State *L, const char *filename,
|
|
|
|
const char *mode) {
|
2002-06-04 00:11:41 +04:00
|
|
|
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
|
|
|
}
|
2022-08-23 22:08:53 +03:00
|
|
|
lf.n = 0;
|
|
|
|
if (skipcomment(lf.f, &c)) /* read initial portion */
|
|
|
|
lf.buff[lf.n++] = '\n'; /* add newline to correct line numbers */
|
|
|
|
if (c == LUA_SIGNATURE[0]) { /* binary file? */
|
|
|
|
lf.n = 0; /* remove possible newline */
|
|
|
|
if (filename) { /* "real" file? */
|
|
|
|
lf.f = freopen(filename, "rb", lf.f); /* reopen in binary mode */
|
|
|
|
if (lf.f == NULL) return errfile(L, "reopen", fnameindex);
|
|
|
|
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 */
|
2011-11-29 19:55:08 +04:00
|
|
|
status = lua_load(L, getF, &lf, lua_tostring(L, -1), mode);
|
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) {
|
2014-10-25 15:50:46 +04:00
|
|
|
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;
|
2011-11-30 16:58:57 +04:00
|
|
|
(void)L; /* not used */
|
2002-06-04 00:11:41 +04:00
|
|
|
if (ls->size == 0) return NULL;
|
|
|
|
*size = ls->size;
|
|
|
|
ls->size = 0;
|
|
|
|
return ls->s;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2011-11-29 19:55:08 +04:00
|
|
|
LUALIB_API int luaL_loadbufferx (lua_State *L, const char *buff, size_t size,
|
|
|
|
const char *name, const char *mode) {
|
2002-06-04 00:11:41 +04:00
|
|
|
LoadS ls;
|
|
|
|
ls.s = buff;
|
|
|
|
ls.size = size;
|
2011-11-29 19:55:08 +04:00
|
|
|
return lua_load(L, getS, &ls, name, mode);
|
2002-06-04 00:11:41 +04:00
|
|
|
}
|
|
|
|
|
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? */
|
2014-09-22 10:42:15 +04:00
|
|
|
return LUA_TNIL;
|
2007-06-21 18:09:59 +04:00
|
|
|
else {
|
2014-09-22 10:42:15 +04:00
|
|
|
int tt;
|
|
|
|
lua_pushstring(L, event);
|
|
|
|
tt = lua_rawget(L, -2);
|
|
|
|
if (tt == LUA_TNIL) /* is metafield nil? */
|
|
|
|
lua_pop(L, 2); /* remove metatable and metafield */
|
|
|
|
else
|
|
|
|
lua_remove(L, -2); /* remove only metatable */
|
|
|
|
return tt; /* return metafield type */
|
2007-06-21 18:09:59 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
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);
|
2014-09-22 10:42:15 +04:00
|
|
|
if (luaL_getmetafield(L, obj, event) == LUA_TNIL) /* no metafield? */
|
2007-06-21 18:09:59 +04:00
|
|
|
return 0;
|
|
|
|
lua_pushvalue(L, obj);
|
|
|
|
lua_call(L, 1, 1);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2013-06-25 18:05:26 +04:00
|
|
|
LUALIB_API lua_Integer luaL_len (lua_State *L, int idx) {
|
|
|
|
lua_Integer l;
|
2010-07-02 21:35:06 +04:00
|
|
|
int isnum;
|
2009-12-17 19:20:01 +03:00
|
|
|
lua_len(L, idx);
|
2013-06-25 18:05:26 +04:00
|
|
|
l = lua_tointegerx(L, -1, &isnum);
|
2021-02-24 17:14:44 +03:00
|
|
|
if (l_unlikely(!isnum))
|
2013-06-25 18:05:26 +04:00
|
|
|
luaL_error(L, "object length is not an integer");
|
2009-12-17 19:20:01 +03:00
|
|
|
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) {
|
2021-07-22 19:48:43 +03:00
|
|
|
idx = lua_absindex(L,idx);
|
2016-12-04 23:09:45 +03:00
|
|
|
if (luaL_callmeta(L, idx, "__tostring")) { /* metafield? */
|
|
|
|
if (!lua_isstring(L, -1))
|
|
|
|
luaL_error(L, "'__tostring' must return a string");
|
|
|
|
}
|
|
|
|
else {
|
2007-06-21 18:09:59 +04:00
|
|
|
switch (lua_type(L, idx)) {
|
2014-02-05 23:14:53 +04:00
|
|
|
case LUA_TNUMBER: {
|
|
|
|
if (lua_isinteger(L, idx))
|
2016-12-20 21:37:00 +03:00
|
|
|
lua_pushfstring(L, "%I", (LUAI_UACINT)lua_tointeger(L, idx));
|
2014-05-13 01:44:17 +04:00
|
|
|
else
|
2016-12-20 21:37:00 +03:00
|
|
|
lua_pushfstring(L, "%f", (LUAI_UACNUMBER)lua_tonumber(L, idx));
|
2013-04-25 17:53:13 +04:00
|
|
|
break;
|
|
|
|
}
|
2007-06-21 18:09:59 +04:00
|
|
|
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;
|
2016-12-04 23:09:45 +03:00
|
|
|
default: {
|
|
|
|
int tt = luaL_getmetafield(L, idx, "__name"); /* try name */
|
|
|
|
const char *kind = (tt == LUA_TSTRING) ? lua_tostring(L, -1) :
|
|
|
|
luaL_typename(L, idx);
|
|
|
|
lua_pushfstring(L, "%s: %p", kind, lua_topointer(L, idx));
|
|
|
|
if (tt != LUA_TNIL)
|
|
|
|
lua_remove(L, -2); /* remove '__name' */
|
2008-01-03 20:07:59 +03:00
|
|
|
break;
|
2016-12-04 23:09:45 +03:00
|
|
|
}
|
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-07-02 15:38:13 +04:00
|
|
|
/*
|
|
|
|
** set functions from list 'l' into table at top - 'nup'; each
|
|
|
|
** function gets the 'nup' elements at the top as upvalues.
|
|
|
|
** Returns with only the table at the stack.
|
|
|
|
*/
|
|
|
|
LUALIB_API void luaL_setfuncs (lua_State *L, const luaL_Reg *l, int nup) {
|
2010-03-18 00:37:37 +03:00
|
|
|
luaL_checkstack(L, nup, "too many upvalues");
|
2011-04-19 22:29:41 +04:00
|
|
|
for (; l->name != NULL; l++) { /* fill the table with given functions */
|
2019-05-13 22:20:40 +03:00
|
|
|
if (l->func == NULL) /* place holder? */
|
|
|
|
lua_pushboolean(L, 0);
|
|
|
|
else {
|
2020-02-27 18:59:22 +03:00
|
|
|
int i;
|
2019-05-13 22:20:40 +03:00
|
|
|
for (i = 0; i < nup; i++) /* copy upvalues to the top */
|
|
|
|
lua_pushvalue(L, -nup);
|
|
|
|
lua_pushcclosure(L, l->func, nup); /* closure with those upvalues */
|
|
|
|
}
|
2010-03-18 00:37:37 +03:00
|
|
|
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
|
|
|
}
|
|
|
|
|
2010-06-30 21:40:27 +04:00
|
|
|
|
2010-07-02 15:38:13 +04:00
|
|
|
/*
|
|
|
|
** ensure that stack[idx][fname] has a table and push that table
|
|
|
|
** into the stack
|
|
|
|
*/
|
2011-04-08 23:17:36 +04:00
|
|
|
LUALIB_API int luaL_getsubtable (lua_State *L, int idx, const char *fname) {
|
2014-03-13 00:57:40 +04:00
|
|
|
if (lua_getfield(L, idx, fname) == LUA_TTABLE)
|
|
|
|
return 1; /* table already there */
|
2010-06-30 21:40:27 +04:00
|
|
|
else {
|
|
|
|
lua_pop(L, 1); /* remove previous result */
|
2012-06-01 00:28:45 +04:00
|
|
|
idx = lua_absindex(L, idx);
|
2010-06-30 21:40:27 +04:00
|
|
|
lua_newtable(L);
|
|
|
|
lua_pushvalue(L, -1); /* copy to be left at top */
|
|
|
|
lua_setfield(L, idx, fname); /* assign new table to field */
|
2011-01-10 18:51:42 +03:00
|
|
|
return 0; /* false, because did not find table there */
|
2010-06-30 21:40:27 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-06-21 18:09:59 +04:00
|
|
|
|
2010-07-02 15:38:13 +04:00
|
|
|
/*
|
2014-07-16 18:51:36 +04:00
|
|
|
** Stripped-down 'require': After checking "loaded" table, calls 'openf'
|
|
|
|
** to open a module, registers the result in 'package.loaded' table and,
|
|
|
|
** if 'glb' is true, also registers the result in the global table.
|
2010-07-02 15:38:13 +04:00
|
|
|
** Leaves resulting module on the top.
|
|
|
|
*/
|
|
|
|
LUALIB_API void luaL_requiref (lua_State *L, const char *modname,
|
|
|
|
lua_CFunction openf, int glb) {
|
2016-12-04 23:17:24 +03:00
|
|
|
luaL_getsubtable(L, LUA_REGISTRYINDEX, LUA_LOADED_TABLE);
|
|
|
|
lua_getfield(L, -1, modname); /* LOADED[modname] */
|
2014-07-16 18:51:36 +04:00
|
|
|
if (!lua_toboolean(L, -1)) { /* package not already loaded? */
|
|
|
|
lua_pop(L, 1); /* remove field */
|
|
|
|
lua_pushcfunction(L, openf);
|
|
|
|
lua_pushstring(L, modname); /* argument to open function */
|
|
|
|
lua_call(L, 1, 1); /* call 'openf' to open module */
|
|
|
|
lua_pushvalue(L, -1); /* make copy of module (call result) */
|
2016-12-04 23:17:24 +03:00
|
|
|
lua_setfield(L, -3, modname); /* LOADED[modname] = module */
|
2014-07-16 18:51:36 +04:00
|
|
|
}
|
2016-12-04 23:17:24 +03:00
|
|
|
lua_remove(L, -2); /* remove LOADED table */
|
2010-07-02 15:38:13 +04:00
|
|
|
if (glb) {
|
2014-07-16 18:51:36 +04:00
|
|
|
lua_pushvalue(L, -1); /* copy of module */
|
2012-04-20 21:05:17 +04:00
|
|
|
lua_setglobal(L, modname); /* _G[modname] = module */
|
2010-07-02 15:38:13 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2019-04-24 20:41:41 +03:00
|
|
|
LUALIB_API void luaL_addgsub (luaL_Buffer *b, const char *s,
|
|
|
|
const char *p, const char *r) {
|
2007-06-21 18:09:59 +04:00
|
|
|
const char *wild;
|
|
|
|
size_t l = strlen(p);
|
|
|
|
while ((wild = strstr(s, p)) != NULL) {
|
2019-04-24 20:41:41 +03:00
|
|
|
luaL_addlstring(b, s, wild - s); /* push prefix */
|
|
|
|
luaL_addstring(b, r); /* push replacement in place of pattern */
|
2014-10-25 15:50:46 +04:00
|
|
|
s = wild + l; /* continue after 'p' */
|
2007-06-21 18:09:59 +04:00
|
|
|
}
|
2019-04-24 20:41:41 +03:00
|
|
|
luaL_addstring(b, s); /* push last suffix */
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
LUALIB_API const char *luaL_gsub (lua_State *L, const char *s,
|
|
|
|
const char *p, const char *r) {
|
|
|
|
luaL_Buffer b;
|
|
|
|
luaL_buffinit(L, &b);
|
|
|
|
luaL_addgsub(&b, s, p, r);
|
2007-06-21 18:09:59 +04:00
|
|
|
luaL_pushresult(&b);
|
|
|
|
return lua_tostring(L, -1);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2003-10-03 00:31:17 +04:00
|
|
|
static void *l_alloc (void *ud, void *ptr, size_t osize, size_t nsize) {
|
2011-11-30 16:58:57 +04:00
|
|
|
(void)ud; (void)osize; /* not used */
|
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) {
|
2020-06-09 22:12:01 +03:00
|
|
|
const char *msg = lua_tostring(L, -1);
|
|
|
|
if (msg == NULL) msg = "error object is not a string";
|
2014-10-29 19:12:30 +03:00
|
|
|
lua_writestringerror("PANIC: unprotected error in call to Lua API (%s)\n",
|
2020-06-09 22:12:01 +03:00
|
|
|
msg);
|
2009-03-31 21:25:08 +04:00
|
|
|
return 0; /* return to Lua to abort */
|
2004-08-13 23:52:53 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2018-12-28 20:42:34 +03:00
|
|
|
/*
|
2020-11-03 22:34:36 +03:00
|
|
|
** Warning functions:
|
|
|
|
** warnfoff: warning system is off
|
|
|
|
** warnfon: ready to start a new message
|
|
|
|
** warnfcont: previous message is to be continued
|
2018-12-28 20:42:34 +03:00
|
|
|
*/
|
2020-11-03 22:34:36 +03:00
|
|
|
static void warnfoff (void *ud, const char *message, int tocont);
|
|
|
|
static void warnfon (void *ud, const char *message, int tocont);
|
|
|
|
static void warnfcont (void *ud, const char *message, int tocont);
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
** Check whether message is a control message. If so, execute the
|
|
|
|
** control or ignore it if unknown.
|
|
|
|
*/
|
|
|
|
static int checkcontrol (lua_State *L, const char *message, int tocont) {
|
|
|
|
if (tocont || *(message++) != '@') /* not a control message? */
|
|
|
|
return 0;
|
|
|
|
else {
|
|
|
|
if (strcmp(message, "off") == 0)
|
|
|
|
lua_setwarnf(L, warnfoff, L); /* turn warnings off */
|
|
|
|
else if (strcmp(message, "on") == 0)
|
|
|
|
lua_setwarnf(L, warnfon, L); /* turn warnings on */
|
|
|
|
return 1; /* it was a control message */
|
2019-08-15 19:44:36 +03:00
|
|
|
}
|
2020-11-03 22:34:36 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static void warnfoff (void *ud, const char *message, int tocont) {
|
|
|
|
checkcontrol((lua_State *)ud, message, tocont);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
** Writes the message and handle 'tocont', finishing the message
|
|
|
|
** if needed and setting the next warn function.
|
|
|
|
*/
|
|
|
|
static void warnfcont (void *ud, const char *message, int tocont) {
|
|
|
|
lua_State *L = (lua_State *)ud;
|
2019-03-14 21:30:54 +03:00
|
|
|
lua_writestringerror("%s", message); /* write message */
|
2019-08-15 19:44:36 +03:00
|
|
|
if (tocont) /* not the last part? */
|
2020-11-03 22:34:36 +03:00
|
|
|
lua_setwarnf(L, warnfcont, L); /* to be continued */
|
2019-08-15 19:44:36 +03:00
|
|
|
else { /* last part */
|
2019-03-14 21:30:54 +03:00
|
|
|
lua_writestringerror("%s", "\n"); /* finish message with end-of-line */
|
2020-11-03 22:34:36 +03:00
|
|
|
lua_setwarnf(L, warnfon, L); /* next call is a new message */
|
2019-08-15 19:44:36 +03:00
|
|
|
}
|
2018-12-28 20:42:34 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2020-11-03 22:34:36 +03:00
|
|
|
static void warnfon (void *ud, const char *message, int tocont) {
|
|
|
|
if (checkcontrol((lua_State *)ud, message, tocont)) /* control message? */
|
|
|
|
return; /* nothing else to be done */
|
|
|
|
lua_writestringerror("%s", "Lua warning: "); /* start a new warning */
|
|
|
|
warnfcont(ud, message, tocont); /* finish processing */
|
|
|
|
}
|
|
|
|
|
|
|
|
|
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);
|
2021-02-24 17:14:44 +03:00
|
|
|
if (l_likely(L)) {
|
2018-12-28 20:42:34 +03:00
|
|
|
lua_atpanic(L, &panic);
|
2020-11-03 22:34:36 +03:00
|
|
|
lua_setwarnf(L, warnfoff, L); /* default is warnings off */
|
2018-12-28 20:42:34 +03:00
|
|
|
}
|
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
|
|
|
|
2014-04-15 22:25:49 +04:00
|
|
|
LUALIB_API void luaL_checkversion_ (lua_State *L, lua_Number ver, size_t sz) {
|
2018-06-18 15:08:10 +03:00
|
|
|
lua_Number v = lua_version(L);
|
2014-07-19 18:37:09 +04:00
|
|
|
if (sz != LUAL_NUMSIZES) /* check numeric types */
|
|
|
|
luaL_error(L, "core and library have incompatible numeric types");
|
2018-06-18 15:08:10 +03:00
|
|
|
else if (v != ver)
|
2014-04-15 22:25:49 +04:00
|
|
|
luaL_error(L, "version mismatch: app. needs %f, Lua core provides %f",
|
2018-06-18 15:08:10 +03:00
|
|
|
(LUAI_UACNUMBER)ver, (LUAI_UACNUMBER)v);
|
2009-06-18 22:59:58 +04:00
|
|
|
}
|
2009-06-19 18:21:57 +04:00
|
|
|
|