2
0

lauxlib.c 5.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216
  1. /*
  2. ** $Id: lauxlib.c,v 1.42 2000/10/30 12:38:50 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. LUALIB_API int luaL_findstring (const char *name, const char *const list[]) {
  17. int i;
  18. for (i=0; list[i]; i++)
  19. if (strcmp(list[i], name) == 0)
  20. return i;
  21. return -1; /* name not found */
  22. }
  23. LUALIB_API void luaL_argerror (lua_State *L, int narg, const char *extramsg) {
  24. lua_Debug ar;
  25. lua_getstack(L, 0, &ar);
  26. lua_getinfo(L, "n", &ar);
  27. if (ar.name == NULL)
  28. ar.name = "?";
  29. luaL_verror(L, "bad argument #%d to `%.50s' (%.100s)",
  30. narg, ar.name, extramsg);
  31. }
  32. static void type_error (lua_State *L, int narg, int t) {
  33. char buff[50];
  34. sprintf(buff, "%.8s expected, got %.8s", lua_typename(L, t),
  35. lua_typename(L, lua_type(L, narg)));
  36. luaL_argerror(L, narg, buff);
  37. }
  38. LUALIB_API void luaL_checkstack (lua_State *L, int space, const char *mes) {
  39. if (space > lua_stackspace(L))
  40. luaL_verror(L, "stack overflow (%.30s)", mes);
  41. }
  42. LUALIB_API void luaL_checktype(lua_State *L, int narg, int t) {
  43. if (lua_type(L, narg) != t)
  44. type_error(L, narg, t);
  45. }
  46. LUALIB_API void luaL_checkany (lua_State *L, int narg) {
  47. if (lua_type(L, narg) == LUA_TNONE)
  48. luaL_argerror(L, narg, "value expected");
  49. }
  50. LUALIB_API const char *luaL_check_lstr (lua_State *L, int narg, size_t *len) {
  51. const char *s = lua_tostring(L, narg);
  52. if (!s) type_error(L, narg, LUA_TSTRING);
  53. if (len) *len = lua_strlen(L, narg);
  54. return s;
  55. }
  56. LUALIB_API const char *luaL_opt_lstr (lua_State *L, int narg, const char *def, size_t *len) {
  57. if (lua_isnull(L, narg)) {
  58. if (len)
  59. *len = (def ? strlen(def) : 0);
  60. return def;
  61. }
  62. else return luaL_check_lstr(L, narg, len);
  63. }
  64. LUALIB_API double luaL_check_number (lua_State *L, int narg) {
  65. double d = lua_tonumber(L, narg);
  66. if (d == 0 && !lua_isnumber(L, narg)) /* avoid extra test when d is not 0 */
  67. type_error(L, narg, LUA_TNUMBER);
  68. return d;
  69. }
  70. LUALIB_API double luaL_opt_number (lua_State *L, int narg, double def) {
  71. if (lua_isnull(L, narg)) return def;
  72. else return luaL_check_number(L, narg);
  73. }
  74. LUALIB_API void luaL_openlib (lua_State *L, const struct luaL_reg *l, int n) {
  75. int i;
  76. for (i=0; i<n; i++)
  77. lua_register(L, l[i].name, l[i].func);
  78. }
  79. LUALIB_API void luaL_verror (lua_State *L, const char *fmt, ...) {
  80. char buff[500];
  81. va_list argp;
  82. va_start(argp, fmt);
  83. vsprintf(buff, fmt, argp);
  84. va_end(argp);
  85. lua_error(L, buff);
  86. }
  87. /*
  88. ** {======================================================
  89. ** Generic Buffer manipulation
  90. ** =======================================================
  91. */
  92. #define buffempty(B) ((B)->p == (B)->buffer)
  93. #define bufflen(B) ((B)->p - (B)->buffer)
  94. #define bufffree(B) ((size_t)(LUAL_BUFFERSIZE - bufflen(B)))
  95. #define LIMIT (LUA_MINSTACK/2)
  96. static int emptybuffer (luaL_Buffer *B) {
  97. size_t l = bufflen(B);
  98. if (l == 0) return 0; /* put nothing on stack */
  99. else {
  100. lua_pushlstring(B->L, B->buffer, l);
  101. B->p = B->buffer;
  102. B->level++;
  103. return 1;
  104. }
  105. }
  106. static void adjuststack (luaL_Buffer *B) {
  107. if (B->level > 1) {
  108. lua_State *L = B->L;
  109. int toget = 1; /* number of levels to concat */
  110. size_t toplen = lua_strlen(L, -1);
  111. do {
  112. size_t l = lua_strlen(L, -(toget+1));
  113. if (B->level - toget + 1 >= LIMIT || toplen > l) {
  114. toplen += l;
  115. toget++;
  116. }
  117. else break;
  118. } while (toget < B->level);
  119. if (toget >= 2) {
  120. lua_concat(L, toget);
  121. B->level = B->level - toget + 1;
  122. }
  123. }
  124. }
  125. LUALIB_API char *luaL_prepbuffer (luaL_Buffer *B) {
  126. if (emptybuffer(B))
  127. adjuststack(B);
  128. return B->buffer;
  129. }
  130. LUALIB_API void luaL_addlstring (luaL_Buffer *B, const char *s, size_t l) {
  131. while (l--)
  132. luaL_putchar(B, *s++);
  133. }
  134. LUALIB_API void luaL_addstring (luaL_Buffer *B, const char *s) {
  135. luaL_addlstring(B, s, strlen(s));
  136. }
  137. LUALIB_API void luaL_pushresult (luaL_Buffer *B) {
  138. emptybuffer(B);
  139. if (B->level == 0)
  140. lua_pushlstring(B->L, NULL, 0);
  141. else if (B->level > 1)
  142. lua_concat(B->L, B->level);
  143. B->level = 1;
  144. }
  145. LUALIB_API void luaL_addvalue (luaL_Buffer *B) {
  146. lua_State *L = B->L;
  147. size_t vl = lua_strlen(L, -1);
  148. if (vl <= bufffree(B)) { /* fit into buffer? */
  149. memcpy(B->p, lua_tostring(L, -1), vl); /* put it there */
  150. B->p += vl;
  151. lua_pop(L, 1); /* remove from stack */
  152. }
  153. else {
  154. if (emptybuffer(B))
  155. lua_insert(L, -2); /* put buffer before new value */
  156. B->level++; /* add new value into B stack */
  157. adjuststack(B);
  158. }
  159. }
  160. LUALIB_API void luaL_buffinit (lua_State *L, luaL_Buffer *B) {
  161. B->L = L;
  162. B->p = B->buffer;
  163. B->level = 0;
  164. }
  165. /* }====================================================== */