mirror of
https://github.com/lua/lua
synced 2024-11-22 21:01:26 +03:00
315 lines
7.3 KiB
C
315 lines
7.3 KiB
C
/*
|
|
** $Id: lauxlib.c,v 1.67 2002/05/01 20:40:42 roberto Exp roberto $
|
|
** Auxiliary functions for building Lua libraries
|
|
** See Copyright Notice in lua.h
|
|
*/
|
|
|
|
|
|
#include <stdarg.h>
|
|
#include <stdio.h>
|
|
#include <string.h>
|
|
|
|
/* This file uses only the official API of Lua.
|
|
** Any function declared here could be written as an application function.
|
|
** With care, these functions can be used by other libraries.
|
|
*/
|
|
|
|
#include "lua.h"
|
|
|
|
#include "lauxlib.h"
|
|
#include "luadebug.h"
|
|
#include "lualib.h"
|
|
|
|
|
|
LUALIB_API int luaL_findstring (const char *name, const char *const list[]) {
|
|
int i;
|
|
for (i=0; list[i]; i++)
|
|
if (strcmp(list[i], name) == 0)
|
|
return i;
|
|
return -1; /* name not found */
|
|
}
|
|
|
|
|
|
LUALIB_API int luaL_argerror (lua_State *L, int narg, const char *extramsg) {
|
|
lua_Debug ar;
|
|
lua_getstack(L, 0, &ar);
|
|
lua_getinfo(L, "n", &ar);
|
|
if (strcmp(ar.namewhat, "method") == 0) narg--; /* do not count `self' */
|
|
if (ar.name == NULL)
|
|
ar.name = "?";
|
|
return luaL_verror(L, "bad argument #%d to `%s' (%s)",
|
|
narg, ar.name, extramsg);
|
|
}
|
|
|
|
|
|
LUALIB_API int luaL_typerror (lua_State *L, int narg, const char *tname) {
|
|
luaL_vstr(L, "%s expected, got %s", tname, lua_typename(L, lua_type(L,narg)));
|
|
return luaL_argerror(L, narg, lua_tostring(L, -1));
|
|
}
|
|
|
|
|
|
static void tag_error (lua_State *L, int narg, int tag) {
|
|
luaL_typerror(L, narg, lua_typename(L, tag));
|
|
}
|
|
|
|
|
|
LUALIB_API void luaL_check_stack (lua_State *L, int space, const char *mes) {
|
|
if (!lua_checkstack(L, space))
|
|
luaL_verror(L, "stack overflow (%s)", mes);
|
|
}
|
|
|
|
|
|
LUALIB_API void luaL_check_type (lua_State *L, int narg, int t) {
|
|
if (lua_type(L, narg) != t)
|
|
tag_error(L, narg, t);
|
|
}
|
|
|
|
|
|
LUALIB_API void luaL_check_any (lua_State *L, int narg) {
|
|
if (lua_type(L, narg) == LUA_TNONE)
|
|
luaL_argerror(L, narg, "value expected");
|
|
}
|
|
|
|
|
|
LUALIB_API const char *luaL_check_lstr (lua_State *L, int narg, size_t *len) {
|
|
const char *s = lua_tostring(L, narg);
|
|
if (!s) tag_error(L, narg, LUA_TSTRING);
|
|
if (len) *len = lua_strlen(L, narg);
|
|
return s;
|
|
}
|
|
|
|
|
|
LUALIB_API const char *luaL_opt_lstr (lua_State *L, int narg, const char *def, size_t *len) {
|
|
if (lua_isnoneornil(L, narg)) {
|
|
if (len)
|
|
*len = (def ? strlen(def) : 0);
|
|
return def;
|
|
}
|
|
else return luaL_check_lstr(L, narg, len);
|
|
}
|
|
|
|
|
|
LUALIB_API lua_Number luaL_check_number (lua_State *L, int narg) {
|
|
lua_Number d = lua_tonumber(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_Number luaL_opt_number (lua_State *L, int narg, lua_Number def) {
|
|
if (lua_isnoneornil(L, narg)) return def;
|
|
else return luaL_check_number(L, narg);
|
|
}
|
|
|
|
|
|
LUALIB_API int luaL_callmeta (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;
|
|
}
|
|
lua_pushvalue(L, obj);
|
|
lua_rawcall(L, 1, 1);
|
|
return 1;
|
|
}
|
|
|
|
|
|
LUALIB_API void luaL_openlib (lua_State *L, const luaL_reg *l, int nup) {
|
|
for (; l->name; l++) {
|
|
int i;
|
|
lua_pushstring(L, l->name);
|
|
for (i=0; i<nup; i++) /* copy upvalues to the top */
|
|
lua_pushvalue(L, -(nup+1));
|
|
lua_pushcclosure(L, l->func, nup);
|
|
lua_settable(L, -(nup+3));
|
|
}
|
|
lua_pop(L, nup);
|
|
}
|
|
|
|
|
|
LUALIB_API void luaL_opennamedlib (lua_State *L, const char *libname,
|
|
const luaL_reg *l, int nup) {
|
|
lua_pushstring(L, libname);
|
|
lua_insert(L, -(nup+1));
|
|
lua_newtable(L);
|
|
lua_insert(L, -(nup+1));
|
|
luaL_openlib(L, l, nup);
|
|
lua_settable(L, LUA_GLOBALSINDEX);
|
|
}
|
|
|
|
|
|
static void vstr (lua_State *L, const char *fmt, va_list argp) {
|
|
luaL_Buffer b;
|
|
luaL_buffinit(L, &b);
|
|
for (;;) {
|
|
const char *e = strchr(fmt, '%');
|
|
if (e == NULL) break;
|
|
luaL_addlstring(&b, fmt, e-fmt);
|
|
switch (*(e+1)) {
|
|
case 's':
|
|
luaL_addstring(&b, va_arg(argp, char *));
|
|
break;
|
|
case 'd':
|
|
lua_pushnumber(L, va_arg(argp, int));
|
|
luaL_addvalue (&b);
|
|
break;
|
|
case '%':
|
|
luaL_putchar(&b, '%');
|
|
break;
|
|
default:
|
|
lua_error(L, "invalid format option");
|
|
}
|
|
fmt = e+2;
|
|
}
|
|
luaL_addstring(&b, fmt);
|
|
luaL_pushresult(&b);
|
|
}
|
|
|
|
|
|
LUALIB_API void luaL_vstr (lua_State *L, const char *fmt, ...) {
|
|
va_list argp;
|
|
va_start(argp, fmt);
|
|
vstr(L, fmt, argp);
|
|
va_end(argp);
|
|
}
|
|
|
|
|
|
LUALIB_API int luaL_verror (lua_State *L, const char *fmt, ...) {
|
|
va_list argp;
|
|
va_start(argp, fmt);
|
|
vstr(L, fmt, argp);
|
|
va_end(argp);
|
|
return lua_errorobj(L);
|
|
}
|
|
|
|
|
|
/*
|
|
** {======================================================
|
|
** Generic Buffer manipulation
|
|
** =======================================================
|
|
*/
|
|
|
|
|
|
#define buffempty(B) ((B)->p == (B)->buffer)
|
|
#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;
|
|
B->level++;
|
|
return 1;
|
|
}
|
|
}
|
|
|
|
|
|
static void adjuststack (luaL_Buffer *B) {
|
|
if (B->level > 1) {
|
|
lua_State *L = B->L;
|
|
int toget = 1; /* number of levels to concat */
|
|
size_t toplen = lua_strlen(L, -1);
|
|
do {
|
|
size_t l = lua_strlen(L, -(toget+1));
|
|
if (B->level - toget + 1 >= LIMIT || toplen > l) {
|
|
toplen += l;
|
|
toget++;
|
|
}
|
|
else break;
|
|
} while (toget < B->level);
|
|
lua_concat(L, toget);
|
|
B->level = B->level - toget + 1;
|
|
}
|
|
}
|
|
|
|
|
|
LUALIB_API char *luaL_prepbuffer (luaL_Buffer *B) {
|
|
if (emptybuffer(B))
|
|
adjuststack(B);
|
|
return B->buffer;
|
|
}
|
|
|
|
|
|
LUALIB_API void luaL_addlstring (luaL_Buffer *B, const char *s, size_t l) {
|
|
while (l--)
|
|
luaL_putchar(B, *s++);
|
|
}
|
|
|
|
|
|
LUALIB_API void luaL_addstring (luaL_Buffer *B, const char *s) {
|
|
luaL_addlstring(B, s, strlen(s));
|
|
}
|
|
|
|
|
|
LUALIB_API void luaL_pushresult (luaL_Buffer *B) {
|
|
emptybuffer(B);
|
|
lua_concat(B->L, B->level);
|
|
B->level = 1;
|
|
}
|
|
|
|
|
|
LUALIB_API void luaL_addvalue (luaL_Buffer *B) {
|
|
lua_State *L = B->L;
|
|
size_t vl = lua_strlen(L, -1);
|
|
if (vl <= bufffree(B)) { /* fit into buffer? */
|
|
memcpy(B->p, lua_tostring(L, -1), vl); /* put it there */
|
|
B->p += vl;
|
|
lua_pop(L, 1); /* remove from stack */
|
|
}
|
|
else {
|
|
if (emptybuffer(B))
|
|
lua_insert(L, -2); /* put buffer before new value */
|
|
B->level++; /* add new value into B stack */
|
|
adjuststack(B);
|
|
}
|
|
}
|
|
|
|
|
|
LUALIB_API void luaL_buffinit (lua_State *L, luaL_Buffer *B) {
|
|
B->L = L;
|
|
B->p = B->buffer;
|
|
B->level = 0;
|
|
}
|
|
|
|
/* }====================================================== */
|
|
|
|
|
|
LUALIB_API int luaL_ref (lua_State *L, int t) {
|
|
int ref;
|
|
lua_rawgeti(L, t, 0); /* get first free element */
|
|
ref = (int)lua_tonumber(L, -1);
|
|
lua_pop(L, 1); /* remove it from stack */
|
|
if (ref != 0) { /* any free element? */
|
|
lua_rawgeti(L, t, ref); /* remove it from list */
|
|
lua_rawseti(L, t, 0);
|
|
}
|
|
else { /* no free elements */
|
|
ref = lua_getn(L, t) + 1; /* use next `n' */
|
|
lua_pushliteral(L, "n");
|
|
lua_pushnumber(L, ref);
|
|
lua_rawset(L, t); /* n = n+1 */
|
|
}
|
|
lua_rawseti(L, t, ref);
|
|
return ref;
|
|
}
|
|
|
|
|
|
LUALIB_API void luaL_unref (lua_State *L, int t, int ref) {
|
|
if (ref >= 0) {
|
|
lua_rawgeti(L, t, 0);
|
|
lua_pushnumber(L, ref);
|
|
lua_rawseti(L, t, 0);
|
|
lua_rawseti(L, t, ref);
|
|
}
|
|
}
|
|
|