lua/lauxlib.c

219 lines
5.0 KiB
C
Raw Normal View History

/*
** $Id: lauxlib.c,v 1.40 2000/10/20 16:39:03 roberto Exp roberto $
1998-06-19 20:14:09 +04:00
** Auxiliary functions for building Lua libraries
** See Copyright Notice in lua.h
*/
#include <stdarg.h>
#include <stdio.h>
#include <string.h>
1999-12-27 20:33:22 +03:00
/* This file uses only the official API of Lua.
1999-02-26 00:07:26 +03:00
** Any function declared here could be written as an application function.
** With care, these functions can be used by other libraries.
1998-01-09 18:09:53 +03:00
*/
1999-02-26 00:07:26 +03:00
#include "lua.h"
#include "lauxlib.h"
#include "luadebug.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 void luaL_argerror (lua_State *L, int narg, const char *extramsg) {
2000-03-30 21:19:48 +04:00
lua_Debug ar;
2000-01-19 15:00:45 +03:00
lua_getstack(L, 0, &ar);
lua_getinfo(L, "n", &ar);
2000-01-19 15:00:45 +03:00
if (ar.name == NULL)
ar.name = "?";
1999-12-28 14:52:49 +03:00
luaL_verror(L, "bad argument #%d to `%.50s' (%.100s)",
2000-01-19 15:00:45 +03:00
narg, ar.name, extramsg);
}
1999-12-28 14:52:49 +03:00
2000-10-05 16:14:08 +04:00
static void type_error (lua_State *L, int narg, int t) {
1999-12-28 14:52:49 +03:00
char buff[100];
2000-10-20 20:39:03 +04:00
int tt = lua_type(L, narg);
const char *rt = (tt == LUA_TNONE) ? "no value" : lua_typename(L, tt);
sprintf(buff, "%.10s expected, got %.10s", lua_typename(L, t), rt);
1999-12-28 14:52:49 +03:00
luaL_argerror(L, narg, buff);
}
LUALIB_API void luaL_checkstack (lua_State *L, int space, const char *mes) {
2000-08-30 00:43:28 +04:00
if (space > lua_stackspace(L))
luaL_verror(L, "stack overflow (%.30s)", mes);
}
LUALIB_API void luaL_checktype(lua_State *L, int narg, int t) {
if (lua_type(L, narg) != t)
type_error(L, narg, t);
}
LUALIB_API void luaL_checkany (lua_State *L, int narg) {
2000-10-05 16:14:08 +04:00
if (lua_type(L, narg) == LUA_TNONE)
luaL_argerror(L, narg, "value expected");
2000-08-28 21:57:04 +04:00
}
LUALIB_API const char *luaL_check_lstr (lua_State *L, int narg, size_t *len) {
2000-08-28 21:57:04 +04:00
const char *s = lua_tostring(L, narg);
if (!s) type_error(L, narg, LUA_TSTRING);
2000-08-28 21:57:04 +04:00
if (len) *len = lua_strlen(L, narg);
1999-10-05 22:33:43 +04:00
return s;
}
LUALIB_API const char *luaL_opt_lstr (lua_State *L, int narg, const char *def,
2000-05-24 17:54:49 +04:00
size_t *len) {
2000-08-28 21:57:04 +04:00
if (lua_isnull(L, narg)) {
2000-09-29 16:40:56 +04:00
if (len)
*len = (def ? strlen(def) : 0);
1999-10-05 22:33:43 +04:00
return def;
}
2000-09-29 16:40:56 +04:00
else return luaL_check_lstr(L, narg, len);
}
2000-09-29 16:40:56 +04:00
LUALIB_API double luaL_check_number (lua_State *L, int narg) {
2000-09-29 16:40:56 +04:00
double d = lua_tonumber(L, narg);
if (d == 0 && !lua_isnumber(L, narg)) /* avoid extra test when d is not 0 */
type_error(L, narg, LUA_TNUMBER);
2000-09-29 16:40:56 +04:00
return d;
}
LUALIB_API double luaL_opt_number (lua_State *L, int narg, double def) {
2000-08-28 21:57:04 +04:00
if (lua_isnull(L, narg)) return def;
2000-09-29 16:40:56 +04:00
else return luaL_check_number(L, narg);
1999-10-05 22:33:43 +04:00
}
1997-12-09 16:50:08 +03:00
LUALIB_API void luaL_openlib (lua_State *L, const struct luaL_reg *l, int n) {
int i;
for (i=0; i<n; i++)
lua_register(L, l[i].name, l[i].func);
}
LUALIB_API void luaL_verror (lua_State *L, const char *fmt, ...) {
char buff[500];
va_list argp;
va_start(argp, fmt);
vsprintf(buff, fmt, argp);
va_end(argp);
lua_error(L, buff);
}
2000-09-11 21:38:42 +04:00
/*
** {======================================================
** 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);
if (toget >= 2) {
lua_concat(L, toget);
B->level = B->level - toget + 1;
}
}
}
LUALIB_API char *luaL_prepbuffer (luaL_Buffer *B) {
2000-09-11 21:38:42 +04:00
if (emptybuffer(B))
adjuststack(B);
return B->buffer;
}
LUALIB_API void luaL_addlstring (luaL_Buffer *B, const char *s, size_t l) {
2000-09-11 21:38:42 +04:00
while (l--)
luaL_putchar(B, *s++);
}
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));
}
LUALIB_API void luaL_pushresult (luaL_Buffer *B) {
2000-09-11 21:38:42 +04:00
emptybuffer(B);
if (B->level == 0)
lua_pushlstring(B->L, NULL, 0);
else if (B->level > 1)
lua_concat(B->L, B->level);
B->level = 1;
}
LUALIB_API void luaL_addvalue (luaL_Buffer *B) {
2000-09-11 21:38:42 +04:00
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) {
2000-09-11 21:38:42 +04:00
B->L = L;
B->p = B->buffer;
B->level = 0;
}
2000-08-28 21:57:04 +04:00
2000-09-11 21:38:42 +04:00
/* }====================================================== */