1997-09-16 23:25:59 +04:00
|
|
|
/*
|
2000-09-12 00:29:27 +04:00
|
|
|
** $Id: lauxlib.c,v 1.34 2000/09/11 17:38:42 roberto Exp roberto $
|
1998-06-19 20:14:09 +04:00
|
|
|
** Auxiliary functions for building Lua libraries
|
1997-09-16 23:25:59 +04:00
|
|
|
** See Copyright Notice in lua.h
|
|
|
|
*/
|
|
|
|
|
1997-03-17 20:02:29 +03:00
|
|
|
|
1997-03-18 18:30:50 +03:00
|
|
|
#include <stdarg.h>
|
1997-09-16 23:25:59 +04:00
|
|
|
#include <stdio.h>
|
1998-06-18 20:57:03 +04:00
|
|
|
#include <string.h>
|
1997-03-17 20:02:29 +03:00
|
|
|
|
1999-12-27 20:33:22 +03:00
|
|
|
/* This file uses only the official API of Lua.
|
1999-02-26 00:07:26 +03:00
|
|
|
** Any function declared here could be written as an application function.
|
|
|
|
** 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
|
|
|
|
1997-03-17 20:02:29 +03:00
|
|
|
#include "lua.h"
|
2000-06-12 17:52:05 +04:00
|
|
|
|
|
|
|
#include "lauxlib.h"
|
1997-04-06 18:08:08 +04:00
|
|
|
#include "luadebug.h"
|
1997-03-17 20:02:29 +03:00
|
|
|
|
|
|
|
|
1997-04-07 18:48:53 +04:00
|
|
|
|
1999-08-17 00:52:00 +04:00
|
|
|
int luaL_findstring (const char *name, const char *const list[]) {
|
1998-06-18 20:57:03 +04:00
|
|
|
int i;
|
|
|
|
for (i=0; list[i]; i++)
|
|
|
|
if (strcmp(list[i], name) == 0)
|
|
|
|
return i;
|
|
|
|
return -1; /* name not found */
|
|
|
|
}
|
|
|
|
|
1999-12-28 14:52:49 +03:00
|
|
|
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);
|
2000-08-29 18:33:31 +04:00
|
|
|
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);
|
1997-03-17 20:02:29 +03:00
|
|
|
}
|
|
|
|
|
1999-12-28 14:52:49 +03:00
|
|
|
|
2000-08-28 21:57:04 +04:00
|
|
|
static void type_error (lua_State *L, int narg, const char *type_name) {
|
1999-12-28 14:52:49 +03:00
|
|
|
char buff[100];
|
2000-08-28 21:57:04 +04:00
|
|
|
const char *rt = lua_type(L, narg);
|
|
|
|
if (*rt == 'N') rt = "no value";
|
|
|
|
sprintf(buff, "%.10s expected, got %.10s", type_name, rt);
|
1999-12-28 14:52:49 +03:00
|
|
|
luaL_argerror(L, narg, buff);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2000-08-30 00:43:28 +04:00
|
|
|
void luaL_checkstack (lua_State *L, int space, const char *mes) {
|
|
|
|
if (space > lua_stackspace(L))
|
|
|
|
luaL_verror(L, "stack overflow (%.30s)", mes);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2000-08-28 21:57:04 +04:00
|
|
|
/*
|
|
|
|
** use the 3rd letter of type names for testing:
|
|
|
|
** nuMber, niL, stRing, fuNction, usErdata, taBle, anY
|
|
|
|
*/
|
|
|
|
void luaL_checktype(lua_State *L, int narg, const char *tname) {
|
|
|
|
const char *rt = lua_type(L, narg);
|
|
|
|
if (!(*rt != 'N' && (tname[2] == 'y' || tname[2] == rt[2])))
|
|
|
|
type_error(L, narg, tname);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static const char *checkstr (lua_State *L, int narg, size_t *len) {
|
|
|
|
const char *s = lua_tostring(L, narg);
|
|
|
|
if (!s) type_error(L, narg, "string");
|
|
|
|
if (len) *len = lua_strlen(L, narg);
|
1999-10-05 22:33:43 +04:00
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
2000-05-24 17:54:49 +04:00
|
|
|
const char *luaL_check_lstr (lua_State *L, int narg, size_t *len) {
|
2000-08-28 21:57:04 +04:00
|
|
|
return checkstr(L, narg, len);
|
1997-03-17 20:02:29 +03:00
|
|
|
}
|
|
|
|
|
2000-05-24 17:54:49 +04:00
|
|
|
const char *luaL_opt_lstr (lua_State *L, int narg, const char *def,
|
|
|
|
size_t *len) {
|
2000-08-28 21:57:04 +04:00
|
|
|
if (lua_isnull(L, narg)) {
|
1999-10-05 22:33:43 +04:00
|
|
|
if (len) *len = def ? strlen(def) : 0;
|
|
|
|
return def;
|
|
|
|
}
|
2000-08-28 21:57:04 +04:00
|
|
|
else return checkstr(L, narg, len);
|
1997-03-17 20:02:29 +03:00
|
|
|
}
|
|
|
|
|
1999-12-28 14:52:49 +03:00
|
|
|
double luaL_check_number (lua_State *L, int narg) {
|
2000-08-28 21:57:04 +04:00
|
|
|
if (!lua_isnumber(L, narg)) type_error(L, narg, "number");
|
|
|
|
return lua_tonumber(L, narg);
|
1997-03-17 20:02:29 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
|
1999-12-28 14:52:49 +03:00
|
|
|
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;
|
1999-10-05 22:33:43 +04:00
|
|
|
else {
|
2000-08-28 21:57:04 +04:00
|
|
|
if (!lua_isnumber(L, narg)) type_error(L, narg, "number");
|
|
|
|
return lua_tonumber(L, narg);
|
1999-10-05 22:33:43 +04:00
|
|
|
}
|
|
|
|
}
|
1997-12-09 16:50:08 +03:00
|
|
|
|
|
|
|
|
1999-11-22 16:12:07 +03:00
|
|
|
void luaL_openlib (lua_State *L, const struct luaL_reg *l, int n) {
|
1997-03-18 18:30:50 +03:00
|
|
|
int i;
|
|
|
|
for (i=0; i<n; i++)
|
1999-11-22 16:12:07 +03:00
|
|
|
lua_register(L, l[i].name, l[i].func);
|
1997-03-18 18:30:50 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
|
1999-11-22 16:12:07 +03:00
|
|
|
void luaL_verror (lua_State *L, const char *fmt, ...) {
|
1997-09-16 23:25:59 +04:00
|
|
|
char buff[500];
|
1997-03-18 18:30:50 +03:00
|
|
|
va_list argp;
|
|
|
|
va_start(argp, fmt);
|
|
|
|
vsprintf(buff, fmt, argp);
|
|
|
|
va_end(argp);
|
1999-11-22 16:12:07 +03:00
|
|
|
lua_error(L, buff);
|
1997-03-18 18:30:50 +03:00
|
|
|
}
|
1997-09-26 19:02:26 +04:00
|
|
|
|
1999-03-05 00:23:39 +03:00
|
|
|
|
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;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
char *luaL_prepbuffer (luaL_Buffer *B) {
|
|
|
|
if (emptybuffer(B))
|
|
|
|
adjuststack(B);
|
|
|
|
return B->buffer;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void luaL_addlstring (luaL_Buffer *B, const char *s, size_t l) {
|
|
|
|
while (l--)
|
|
|
|
luaL_putchar(B, *s++);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void luaL_pushresult (luaL_Buffer *B) {
|
|
|
|
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;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
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);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void luaL_buffinit (lua_State *L, luaL_Buffer *B) {
|
|
|
|
B->L = L;
|
|
|
|
B->p = B->buffer;
|
|
|
|
B->level = 0;
|
1999-03-10 17:19:41 +03:00
|
|
|
}
|
2000-08-28 21:57:04 +04:00
|
|
|
|
2000-09-11 21:38:42 +04:00
|
|
|
/* }====================================================== */
|