lauxlib.c 6.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271
  1. /*
  2. ** $Id: lauxlib.c,v 1.61 2002/03/07 18:15:10 roberto Exp roberto $
  3. ** Auxiliary functions for building Lua libraries
  4. ** See Copyright Notice in lua.h
  5. */
  6. #include <stdarg.h>
  7. #include <stdio.h>
  8. #include <string.h>
  9. /* This file uses only the official API of Lua.
  10. ** Any function declared here could be written as an application function.
  11. ** With care, these functions can be used by other libraries.
  12. */
  13. #include "lua.h"
  14. #include "lauxlib.h"
  15. #include "luadebug.h"
  16. #include "lualib.h"
  17. LUALIB_API const char *luaL_errstr (int errcode) {
  18. static const char *const errstr[] = {
  19. "ok",
  20. "run-time error",
  21. "cannot open file",
  22. "syntax error",
  23. "not enough memory",
  24. "error in error handling"
  25. };
  26. return errstr[errcode];
  27. }
  28. LUALIB_API int luaL_findstring (const char *name, const char *const list[]) {
  29. int i;
  30. for (i=0; list[i]; i++)
  31. if (strcmp(list[i], name) == 0)
  32. return i;
  33. return -1; /* name not found */
  34. }
  35. LUALIB_API void luaL_argerror (lua_State *L, int narg, const char *extramsg) {
  36. lua_Debug ar;
  37. lua_getstack(L, 0, &ar);
  38. lua_getinfo(L, "n", &ar);
  39. if (ar.name == NULL)
  40. ar.name = "?";
  41. luaL_verror(L, "bad argument #%d to `%.50s' (%.100s)",
  42. narg, ar.name, extramsg);
  43. }
  44. LUALIB_API void luaL_typerror (lua_State *L, int narg, const char *tname) {
  45. char buff[80];
  46. sprintf(buff, "%.25s expected, got %.25s", tname,
  47. lua_typename(L, lua_type(L,narg)));
  48. luaL_argerror(L, narg, buff);
  49. }
  50. static void tag_error (lua_State *L, int narg, int tag) {
  51. luaL_typerror(L, narg, lua_typename(L, tag));
  52. }
  53. LUALIB_API void luaL_check_stack (lua_State *L, int space, const char *mes) {
  54. if (!lua_checkstack(L, space))
  55. luaL_verror(L, "stack overflow (%.30s)", mes);
  56. }
  57. LUALIB_API void luaL_check_type(lua_State *L, int narg, int t) {
  58. if (lua_type(L, narg) != t)
  59. tag_error(L, narg, t);
  60. }
  61. LUALIB_API void luaL_check_any (lua_State *L, int narg) {
  62. if (lua_type(L, narg) == LUA_TNONE)
  63. luaL_argerror(L, narg, "value expected");
  64. }
  65. LUALIB_API const char *luaL_check_lstr (lua_State *L, int narg, size_t *len) {
  66. const char *s = lua_tostring(L, narg);
  67. if (!s) tag_error(L, narg, LUA_TSTRING);
  68. if (len) *len = lua_strlen(L, narg);
  69. return s;
  70. }
  71. LUALIB_API const char *luaL_opt_lstr (lua_State *L, int narg, const char *def, size_t *len) {
  72. if (lua_isnone(L, narg)) {
  73. if (len)
  74. *len = (def ? strlen(def) : 0);
  75. return def;
  76. }
  77. else return luaL_check_lstr(L, narg, len);
  78. }
  79. LUALIB_API lua_Number luaL_check_number (lua_State *L, int narg) {
  80. lua_Number d = lua_tonumber(L, narg);
  81. if (d == 0 && !lua_isnumber(L, narg)) /* avoid extra test when d is not 0 */
  82. tag_error(L, narg, LUA_TNUMBER);
  83. return d;
  84. }
  85. LUALIB_API lua_Number luaL_opt_number (lua_State *L, int narg, lua_Number def) {
  86. if (lua_isnone(L, narg)) return def;
  87. else return luaL_check_number(L, narg);
  88. }
  89. LUALIB_API void luaL_openlib (lua_State *L, const luaL_reg *l) {
  90. for (; l->name; l++) {
  91. lua_pushstring(L, l->name);
  92. lua_pushcfunction(L, l->func);
  93. lua_settable(L, -3);
  94. }
  95. }
  96. LUALIB_API void luaL_opennamedlib (lua_State *L, const char *libname,
  97. const luaL_reg *l) {
  98. lua_pushstring(L, libname);
  99. lua_newtable(L);
  100. luaL_openlib(L, l);
  101. lua_settable(L, LUA_GLOBALSINDEX);
  102. }
  103. LUALIB_API void luaL_verror (lua_State *L, const char *fmt, ...) {
  104. char buff[500];
  105. va_list argp;
  106. va_start(argp, fmt);
  107. vsprintf(buff, fmt, argp);
  108. va_end(argp);
  109. lua_error(L, buff);
  110. }
  111. /*
  112. ** {======================================================
  113. ** Generic Buffer manipulation
  114. ** =======================================================
  115. */
  116. #define buffempty(B) ((B)->p == (B)->buffer)
  117. #define bufflen(B) ((B)->p - (B)->buffer)
  118. #define bufffree(B) ((size_t)(LUAL_BUFFERSIZE - bufflen(B)))
  119. #define LIMIT (LUA_MINSTACK/2)
  120. static int emptybuffer (luaL_Buffer *B) {
  121. size_t l = bufflen(B);
  122. if (l == 0) return 0; /* put nothing on stack */
  123. else {
  124. lua_pushlstring(B->L, B->buffer, l);
  125. B->p = B->buffer;
  126. B->level++;
  127. return 1;
  128. }
  129. }
  130. static void adjuststack (luaL_Buffer *B) {
  131. if (B->level > 1) {
  132. lua_State *L = B->L;
  133. int toget = 1; /* number of levels to concat */
  134. size_t toplen = lua_strlen(L, -1);
  135. do {
  136. size_t l = lua_strlen(L, -(toget+1));
  137. if (B->level - toget + 1 >= LIMIT || toplen > l) {
  138. toplen += l;
  139. toget++;
  140. }
  141. else break;
  142. } while (toget < B->level);
  143. lua_concat(L, toget);
  144. B->level = B->level - toget + 1;
  145. }
  146. }
  147. LUALIB_API char *luaL_prepbuffer (luaL_Buffer *B) {
  148. if (emptybuffer(B))
  149. adjuststack(B);
  150. return B->buffer;
  151. }
  152. LUALIB_API void luaL_addlstring (luaL_Buffer *B, const char *s, size_t l) {
  153. while (l--)
  154. luaL_putchar(B, *s++);
  155. }
  156. LUALIB_API void luaL_addstring (luaL_Buffer *B, const char *s) {
  157. luaL_addlstring(B, s, strlen(s));
  158. }
  159. LUALIB_API void luaL_pushresult (luaL_Buffer *B) {
  160. emptybuffer(B);
  161. lua_concat(B->L, B->level);
  162. B->level = 1;
  163. }
  164. LUALIB_API void luaL_addvalue (luaL_Buffer *B) {
  165. lua_State *L = B->L;
  166. size_t vl = lua_strlen(L, -1);
  167. if (vl <= bufffree(B)) { /* fit into buffer? */
  168. memcpy(B->p, lua_tostring(L, -1), vl); /* put it there */
  169. B->p += vl;
  170. lua_pop(L, 1); /* remove from stack */
  171. }
  172. else {
  173. if (emptybuffer(B))
  174. lua_insert(L, -2); /* put buffer before new value */
  175. B->level++; /* add new value into B stack */
  176. adjuststack(B);
  177. }
  178. }
  179. LUALIB_API void luaL_buffinit (lua_State *L, luaL_Buffer *B) {
  180. B->L = L;
  181. B->p = B->buffer;
  182. B->level = 0;
  183. }
  184. /* }====================================================== */
  185. LUALIB_API int luaL_ref (lua_State *L, int t) {
  186. int ref;
  187. lua_rawgeti(L, t, 0); /* get first free element */
  188. ref = (int)lua_tonumber(L, -1);
  189. lua_pop(L, 1); /* remove it from stack */
  190. if (ref != 0) { /* any free element? */
  191. lua_rawgeti(L, t, ref); /* remove it from list */
  192. lua_rawseti(L, t, 0);
  193. }
  194. else { /* no free elements */
  195. ref = lua_getn(L, t) + 1; /* use next `n' */
  196. lua_pushliteral(L, "n");
  197. lua_pushnumber(L, ref);
  198. lua_rawset(L, t); /* n = n+1 */
  199. }
  200. lua_rawseti(L, t, ref);
  201. return ref;
  202. }
  203. LUALIB_API void luaL_unref (lua_State *L, int t, int ref) {
  204. if (ref >= 0) {
  205. lua_rawgeti(L, t, 0);
  206. lua_pushnumber(L, ref);
  207. lua_rawseti(L, t, 0);
  208. lua_rawseti(L, t, ref);
  209. }
  210. }