lauxlib.c 30 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041
  1. /*
  2. ** $Id: lauxlib.c $
  3. ** Auxiliary functions for building Lua libraries
  4. ** See Copyright Notice in lua.h
  5. */
  6. #define lauxlib_c
  7. #define LUA_LIB
  8. #include "lprefix.h"
  9. #include <errno.h>
  10. #include <stdarg.h>
  11. #include <stdio.h>
  12. #include <stdlib.h>
  13. #include <string.h>
  14. /*
  15. ** This file uses only the official API of Lua.
  16. ** Any function declared here could be written as an application function.
  17. */
  18. #include "lua.h"
  19. #include "lauxlib.h"
  20. #if !defined(MAX_SIZET)
  21. /* maximum value for size_t */
  22. #define MAX_SIZET ((size_t)(~(size_t)0))
  23. #endif
  24. /*
  25. ** {======================================================
  26. ** Traceback
  27. ** =======================================================
  28. */
  29. #define LEVELS1 10 /* size of the first part of the stack */
  30. #define LEVELS2 11 /* size of the second part of the stack */
  31. /*
  32. ** Search for 'objidx' in table at index -1. ('objidx' must be an
  33. ** absolute index.) Return 1 + string at top if it found a good name.
  34. */
  35. static int findfield (lua_State *L, int objidx, int level) {
  36. if (level == 0 || !lua_istable(L, -1))
  37. return 0; /* not found */
  38. lua_pushnil(L); /* start 'next' loop */
  39. while (lua_next(L, -2)) { /* for each pair in table */
  40. if (lua_type(L, -2) == LUA_TSTRING) { /* ignore non-string keys */
  41. if (lua_rawequal(L, objidx, -1)) { /* found object? */
  42. lua_pop(L, 1); /* remove value (but keep name) */
  43. return 1;
  44. }
  45. else if (findfield(L, objidx, level - 1)) { /* try recursively */
  46. /* stack: lib_name, lib_table, field_name (top) */
  47. lua_pushliteral(L, "."); /* place '.' between the two names */
  48. lua_replace(L, -3); /* (in the slot occupied by table) */
  49. lua_concat(L, 3); /* lib_name.field_name */
  50. return 1;
  51. }
  52. }
  53. lua_pop(L, 1); /* remove value */
  54. }
  55. return 0; /* not found */
  56. }
  57. /*
  58. ** Search for a name for a function in all loaded modules
  59. */
  60. static int pushglobalfuncname (lua_State *L, lua_Debug *ar) {
  61. int top = lua_gettop(L);
  62. lua_getinfo(L, "f", ar); /* push function */
  63. lua_getfield(L, LUA_REGISTRYINDEX, LUA_LOADED_TABLE);
  64. if (findfield(L, top + 1, 2)) {
  65. const char *name = lua_tostring(L, -1);
  66. if (strncmp(name, LUA_GNAME ".", 3) == 0) { /* name start with '_G.'? */
  67. lua_pushstring(L, name + 3); /* push name without prefix */
  68. lua_remove(L, -2); /* remove original name */
  69. }
  70. lua_copy(L, -1, top + 1); /* copy name to proper place */
  71. lua_settop(L, top + 1); /* remove table "loaded" an name copy */
  72. return 1;
  73. }
  74. else {
  75. lua_settop(L, top); /* remove function and global table */
  76. return 0;
  77. }
  78. }
  79. static void pushfuncname (lua_State *L, lua_Debug *ar) {
  80. if (pushglobalfuncname(L, ar)) { /* try first a global name */
  81. lua_pushfstring(L, "function '%s'", lua_tostring(L, -1));
  82. lua_remove(L, -2); /* remove name */
  83. }
  84. else if (*ar->namewhat != '\0') /* is there a name from code? */
  85. lua_pushfstring(L, "%s '%s'", ar->namewhat, ar->name); /* use it */
  86. else if (*ar->what == 'm') /* main? */
  87. lua_pushliteral(L, "main chunk");
  88. else if (*ar->what != 'C') /* for Lua functions, use <file:line> */
  89. lua_pushfstring(L, "function <%s:%d>", ar->short_src, ar->linedefined);
  90. else /* nothing left... */
  91. lua_pushliteral(L, "?");
  92. }
  93. static int lastlevel (lua_State *L) {
  94. lua_Debug ar;
  95. int li = 1, le = 1;
  96. /* find an upper bound */
  97. while (lua_getstack(L, le, &ar)) { li = le; le *= 2; }
  98. /* do a binary search */
  99. while (li < le) {
  100. int m = (li + le)/2;
  101. if (lua_getstack(L, m, &ar)) li = m + 1;
  102. else le = m;
  103. }
  104. return le - 1;
  105. }
  106. LUALIB_API void luaL_traceback (lua_State *L, lua_State *L1,
  107. const char *msg, int level) {
  108. luaL_Buffer b;
  109. lua_Debug ar;
  110. int last = lastlevel(L1);
  111. int limit2show = (last - level > LEVELS1 + LEVELS2) ? LEVELS1 : -1;
  112. luaL_buffinit(L, &b);
  113. if (msg) {
  114. luaL_addstring(&b, msg);
  115. luaL_addchar(&b, '\n');
  116. }
  117. luaL_addstring(&b, "stack traceback:");
  118. while (lua_getstack(L1, level++, &ar)) {
  119. if (limit2show-- == 0) { /* too many levels? */
  120. int n = last - level - LEVELS2 + 1; /* number of levels to skip */
  121. lua_pushfstring(L, "\n\t...\t(skipping %d levels)", n);
  122. luaL_addvalue(&b); /* add warning about skip */
  123. level += n; /* and skip to last levels */
  124. }
  125. else {
  126. lua_getinfo(L1, "Slnt", &ar);
  127. if (ar.currentline <= 0)
  128. lua_pushfstring(L, "\n\t%s: in ", ar.short_src);
  129. else
  130. lua_pushfstring(L, "\n\t%s:%d: in ", ar.short_src, ar.currentline);
  131. luaL_addvalue(&b);
  132. pushfuncname(L, &ar);
  133. luaL_addvalue(&b);
  134. if (ar.istailcall)
  135. luaL_addstring(&b, "\n\t(...tail calls...)");
  136. }
  137. }
  138. luaL_pushresult(&b);
  139. }
  140. /* }====================================================== */
  141. /*
  142. ** {======================================================
  143. ** Error-report functions
  144. ** =======================================================
  145. */
  146. LUALIB_API int luaL_argerror (lua_State *L, int arg, const char *extramsg) {
  147. lua_Debug ar;
  148. if (!lua_getstack(L, 0, &ar)) /* no stack frame? */
  149. return luaL_error(L, "bad argument #%d (%s)", arg, extramsg);
  150. lua_getinfo(L, "n", &ar);
  151. if (strcmp(ar.namewhat, "method") == 0) {
  152. arg--; /* do not count 'self' */
  153. if (arg == 0) /* error is in the self argument itself? */
  154. return luaL_error(L, "calling '%s' on bad self (%s)",
  155. ar.name, extramsg);
  156. }
  157. if (ar.name == NULL)
  158. ar.name = (pushglobalfuncname(L, &ar)) ? lua_tostring(L, -1) : "?";
  159. return luaL_error(L, "bad argument #%d to '%s' (%s)",
  160. arg, ar.name, extramsg);
  161. }
  162. int luaL_typeerror (lua_State *L, int arg, const char *tname) {
  163. const char *msg;
  164. const char *typearg; /* name for the type of the actual argument */
  165. if (luaL_getmetafield(L, arg, "__name") == LUA_TSTRING)
  166. typearg = lua_tostring(L, -1); /* use the given type name */
  167. else if (lua_type(L, arg) == LUA_TLIGHTUSERDATA)
  168. typearg = "light userdata"; /* special name for messages */
  169. else
  170. typearg = luaL_typename(L, arg); /* standard name */
  171. msg = lua_pushfstring(L, "%s expected, got %s", tname, typearg);
  172. return luaL_argerror(L, arg, msg);
  173. }
  174. static void tag_error (lua_State *L, int arg, int tag) {
  175. luaL_typeerror(L, arg, lua_typename(L, tag));
  176. }
  177. /*
  178. ** The use of 'lua_pushfstring' ensures this function does not
  179. ** need reserved stack space when called.
  180. */
  181. LUALIB_API void luaL_where (lua_State *L, int level) {
  182. lua_Debug ar;
  183. if (lua_getstack(L, level, &ar)) { /* check function at level */
  184. lua_getinfo(L, "Sl", &ar); /* get info about it */
  185. if (ar.currentline > 0) { /* is there info? */
  186. lua_pushfstring(L, "%s:%d: ", ar.short_src, ar.currentline);
  187. return;
  188. }
  189. }
  190. lua_pushfstring(L, ""); /* else, no information available... */
  191. }
  192. /*
  193. ** Again, the use of 'lua_pushvfstring' ensures this function does
  194. ** not need reserved stack space when called. (At worst, it generates
  195. ** an error with "stack overflow" instead of the given message.)
  196. */
  197. LUALIB_API int luaL_error (lua_State *L, const char *fmt, ...) {
  198. va_list argp;
  199. va_start(argp, fmt);
  200. luaL_where(L, 1);
  201. lua_pushvfstring(L, fmt, argp);
  202. va_end(argp);
  203. lua_concat(L, 2);
  204. return lua_error(L);
  205. }
  206. LUALIB_API int luaL_fileresult (lua_State *L, int stat, const char *fname) {
  207. int en = errno; /* calls to Lua API may change this value */
  208. if (stat) {
  209. lua_pushboolean(L, 1);
  210. return 1;
  211. }
  212. else {
  213. lua_pushnil(L);
  214. if (fname)
  215. lua_pushfstring(L, "%s: %s", fname, strerror(en));
  216. else
  217. lua_pushstring(L, strerror(en));
  218. lua_pushinteger(L, en);
  219. return 3;
  220. }
  221. }
  222. #if !defined(l_inspectstat) /* { */
  223. #if defined(LUA_USE_POSIX)
  224. #include <sys/wait.h>
  225. /*
  226. ** use appropriate macros to interpret 'pclose' return status
  227. */
  228. #define l_inspectstat(stat,what) \
  229. if (WIFEXITED(stat)) { stat = WEXITSTATUS(stat); } \
  230. else if (WIFSIGNALED(stat)) { stat = WTERMSIG(stat); what = "signal"; }
  231. #else
  232. #define l_inspectstat(stat,what) /* no op */
  233. #endif
  234. #endif /* } */
  235. LUALIB_API int luaL_execresult (lua_State *L, int stat) {
  236. const char *what = "exit"; /* type of termination */
  237. if (stat == -1) /* error? */
  238. return luaL_fileresult(L, 0, NULL);
  239. else {
  240. l_inspectstat(stat, what); /* interpret result */
  241. if (*what == 'e' && stat == 0) /* successful termination? */
  242. lua_pushboolean(L, 1);
  243. else
  244. lua_pushnil(L);
  245. lua_pushstring(L, what);
  246. lua_pushinteger(L, stat);
  247. return 3; /* return true/nil,what,code */
  248. }
  249. }
  250. /* }====================================================== */
  251. /*
  252. ** {======================================================
  253. ** Userdata's metatable manipulation
  254. ** =======================================================
  255. */
  256. LUALIB_API int luaL_newmetatable (lua_State *L, const char *tname) {
  257. if (luaL_getmetatable(L, tname) != LUA_TNIL) /* name already in use? */
  258. return 0; /* leave previous value on top, but return 0 */
  259. lua_pop(L, 1);
  260. lua_createtable(L, 0, 2); /* create metatable */
  261. lua_pushstring(L, tname);
  262. lua_setfield(L, -2, "__name"); /* metatable.__name = tname */
  263. lua_pushvalue(L, -1);
  264. lua_setfield(L, LUA_REGISTRYINDEX, tname); /* registry.name = metatable */
  265. return 1;
  266. }
  267. LUALIB_API void luaL_setmetatable (lua_State *L, const char *tname) {
  268. luaL_getmetatable(L, tname);
  269. lua_setmetatable(L, -2);
  270. }
  271. LUALIB_API void *luaL_testudata (lua_State *L, int ud, const char *tname) {
  272. void *p = lua_touserdata(L, ud);
  273. if (p != NULL) { /* value is a userdata? */
  274. if (lua_getmetatable(L, ud)) { /* does it have a metatable? */
  275. luaL_getmetatable(L, tname); /* get correct metatable */
  276. if (!lua_rawequal(L, -1, -2)) /* not the same? */
  277. p = NULL; /* value is a userdata with wrong metatable */
  278. lua_pop(L, 2); /* remove both metatables */
  279. return p;
  280. }
  281. }
  282. return NULL; /* value is not a userdata with a metatable */
  283. }
  284. LUALIB_API void *luaL_checkudata (lua_State *L, int ud, const char *tname) {
  285. void *p = luaL_testudata(L, ud, tname);
  286. luaL_argexpected(L, p != NULL, ud, tname);
  287. return p;
  288. }
  289. /* }====================================================== */
  290. /*
  291. ** {======================================================
  292. ** Argument check functions
  293. ** =======================================================
  294. */
  295. LUALIB_API int luaL_checkoption (lua_State *L, int arg, const char *def,
  296. const char *const lst[]) {
  297. const char *name = (def) ? luaL_optstring(L, arg, def) :
  298. luaL_checkstring(L, arg);
  299. int i;
  300. for (i=0; lst[i]; i++)
  301. if (strcmp(lst[i], name) == 0)
  302. return i;
  303. return luaL_argerror(L, arg,
  304. lua_pushfstring(L, "invalid option '%s'", name));
  305. }
  306. /*
  307. ** Ensures the stack has at least 'space' extra slots, raising an error
  308. ** if it cannot fulfill the request. (The error handling needs a few
  309. ** extra slots to format the error message. In case of an error without
  310. ** this extra space, Lua will generate the same 'stack overflow' error,
  311. ** but without 'msg'.)
  312. */
  313. LUALIB_API void luaL_checkstack (lua_State *L, int space, const char *msg) {
  314. if (!lua_checkstack(L, space)) {
  315. if (msg)
  316. luaL_error(L, "stack overflow (%s)", msg);
  317. else
  318. luaL_error(L, "stack overflow");
  319. }
  320. }
  321. LUALIB_API void luaL_checktype (lua_State *L, int arg, int t) {
  322. if (lua_type(L, arg) != t)
  323. tag_error(L, arg, t);
  324. }
  325. LUALIB_API void luaL_checkany (lua_State *L, int arg) {
  326. if (lua_type(L, arg) == LUA_TNONE)
  327. luaL_argerror(L, arg, "value expected");
  328. }
  329. LUALIB_API const char *luaL_checklstring (lua_State *L, int arg, size_t *len) {
  330. const char *s = lua_tolstring(L, arg, len);
  331. if (!s) tag_error(L, arg, LUA_TSTRING);
  332. return s;
  333. }
  334. LUALIB_API const char *luaL_optlstring (lua_State *L, int arg,
  335. const char *def, size_t *len) {
  336. if (lua_isnoneornil(L, arg)) {
  337. if (len)
  338. *len = (def ? strlen(def) : 0);
  339. return def;
  340. }
  341. else return luaL_checklstring(L, arg, len);
  342. }
  343. LUALIB_API lua_Number luaL_checknumber (lua_State *L, int arg) {
  344. int isnum;
  345. lua_Number d = lua_tonumberx(L, arg, &isnum);
  346. if (!isnum)
  347. tag_error(L, arg, LUA_TNUMBER);
  348. return d;
  349. }
  350. LUALIB_API lua_Number luaL_optnumber (lua_State *L, int arg, lua_Number def) {
  351. return luaL_opt(L, luaL_checknumber, arg, def);
  352. }
  353. static void interror (lua_State *L, int arg) {
  354. if (lua_isnumber(L, arg))
  355. luaL_argerror(L, arg, "number has no integer representation");
  356. else
  357. tag_error(L, arg, LUA_TNUMBER);
  358. }
  359. LUALIB_API lua_Integer luaL_checkinteger (lua_State *L, int arg) {
  360. int isnum;
  361. lua_Integer d = lua_tointegerx(L, arg, &isnum);
  362. if (!isnum) {
  363. interror(L, arg);
  364. }
  365. return d;
  366. }
  367. LUALIB_API lua_Integer luaL_optinteger (lua_State *L, int arg,
  368. lua_Integer def) {
  369. return luaL_opt(L, luaL_checkinteger, arg, def);
  370. }
  371. /* }====================================================== */
  372. /*
  373. ** {======================================================
  374. ** Generic Buffer manipulation
  375. ** =======================================================
  376. */
  377. /* userdata to box arbitrary data */
  378. typedef struct UBox {
  379. void *box;
  380. size_t bsize;
  381. } UBox;
  382. static void *resizebox (lua_State *L, int idx, size_t newsize) {
  383. void *ud;
  384. lua_Alloc allocf = lua_getallocf(L, &ud);
  385. UBox *box = (UBox *)lua_touserdata(L, idx);
  386. void *temp = allocf(ud, box->box, box->bsize, newsize);
  387. if (temp == NULL && newsize > 0) /* allocation error? */
  388. luaL_error(L, "not enough memory for buffer allocation");
  389. box->box = temp;
  390. box->bsize = newsize;
  391. return temp;
  392. }
  393. static int boxgc (lua_State *L) {
  394. resizebox(L, 1, 0);
  395. return 0;
  396. }
  397. static const luaL_Reg boxmt[] = { /* box metamethods */
  398. {"__gc", boxgc},
  399. {"__close", boxgc},
  400. {NULL, NULL}
  401. };
  402. static void newbox (lua_State *L) {
  403. UBox *box = (UBox *)lua_newuserdatauv(L, sizeof(UBox), 0);
  404. box->box = NULL;
  405. box->bsize = 0;
  406. if (luaL_newmetatable(L, "_UBOX*")) /* creating metatable? */
  407. luaL_setfuncs(L, boxmt, 0); /* set its metamethods */
  408. lua_setmetatable(L, -2);
  409. }
  410. /*
  411. ** check whether buffer is using a userdata on the stack as a temporary
  412. ** buffer
  413. */
  414. #define buffonstack(B) ((B)->b != (B)->init.b)
  415. /*
  416. ** Compute new size for buffer 'B', enough to accommodate extra 'sz'
  417. ** bytes.
  418. */
  419. static size_t newbuffsize (luaL_Buffer *B, size_t sz) {
  420. size_t newsize = B->size * 2; /* double buffer size */
  421. if (MAX_SIZET - sz < B->n) /* overflow in (B->n + sz)? */
  422. return luaL_error(B->L, "buffer too large");
  423. if (newsize < B->n + sz) /* double is not big enough? */
  424. newsize = B->n + sz;
  425. return newsize;
  426. }
  427. /*
  428. ** Returns a pointer to a free area with at least 'sz' bytes in buffer
  429. ** 'B'. 'boxidx' is the relative position in the stack where the
  430. ** buffer's box is or should be.
  431. */
  432. static char *prepbuffsize (luaL_Buffer *B, size_t sz, int boxidx) {
  433. if (B->size - B->n >= sz) /* enough space? */
  434. return B->b + B->n;
  435. else {
  436. lua_State *L = B->L;
  437. char *newbuff;
  438. size_t newsize = newbuffsize(B, sz);
  439. /* create larger buffer */
  440. if (buffonstack(B)) /* buffer already has a box? */
  441. newbuff = (char *)resizebox(L, boxidx, newsize); /* resize it */
  442. else { /* no box yet */
  443. lua_pushnil(L); /* reserve slot for final result */
  444. newbox(L); /* create a new box */
  445. /* move box (and slot) to its intended position */
  446. lua_rotate(L, boxidx - 1, 2);
  447. lua_toclose(L, boxidx);
  448. newbuff = (char *)resizebox(L, boxidx, newsize);
  449. memcpy(newbuff, B->b, B->n * sizeof(char)); /* copy original content */
  450. }
  451. B->b = newbuff;
  452. B->size = newsize;
  453. return newbuff + B->n;
  454. }
  455. }
  456. /*
  457. ** returns a pointer to a free area with at least 'sz' bytes
  458. */
  459. LUALIB_API char *luaL_prepbuffsize (luaL_Buffer *B, size_t sz) {
  460. return prepbuffsize(B, sz, -1);
  461. }
  462. LUALIB_API void luaL_addlstring (luaL_Buffer *B, const char *s, size_t l) {
  463. if (l > 0) { /* avoid 'memcpy' when 's' can be NULL */
  464. char *b = prepbuffsize(B, l, -1);
  465. memcpy(b, s, l * sizeof(char));
  466. luaL_addsize(B, l);
  467. }
  468. }
  469. LUALIB_API void luaL_addstring (luaL_Buffer *B, const char *s) {
  470. luaL_addlstring(B, s, strlen(s));
  471. }
  472. LUALIB_API void luaL_pushresult (luaL_Buffer *B) {
  473. lua_State *L = B->L;
  474. lua_pushlstring(L, B->b, B->n);
  475. if (buffonstack(B)) {
  476. lua_copy(L, -1, -3); /* move string to reserved slot */
  477. lua_pop(L, 2); /* pop string and box (closing the box) */
  478. }
  479. }
  480. LUALIB_API void luaL_pushresultsize (luaL_Buffer *B, size_t sz) {
  481. luaL_addsize(B, sz);
  482. luaL_pushresult(B);
  483. }
  484. /*
  485. ** 'luaL_addvalue' is the only function in the Buffer system where the
  486. ** box (if existent) is not on the top of the stack. So, instead of
  487. ** calling 'luaL_addlstring', it replicates the code using -2 as the
  488. ** last argument to 'prepbuffsize', signaling that the box is (or will
  489. ** be) bellow the string being added to the buffer. (Box creation can
  490. ** trigger an emergency GC, so we should not remove the string from the
  491. ** stack before we have the space guaranteed.)
  492. */
  493. LUALIB_API void luaL_addvalue (luaL_Buffer *B) {
  494. lua_State *L = B->L;
  495. size_t len;
  496. const char *s = lua_tolstring(L, -1, &len);
  497. char *b = prepbuffsize(B, len, -2);
  498. memcpy(b, s, len * sizeof(char));
  499. luaL_addsize(B, len);
  500. lua_pop(L, 1); /* pop string */
  501. }
  502. LUALIB_API void luaL_buffinit (lua_State *L, luaL_Buffer *B) {
  503. B->L = L;
  504. B->b = B->init.b;
  505. B->n = 0;
  506. B->size = LUAL_BUFFERSIZE;
  507. }
  508. LUALIB_API char *luaL_buffinitsize (lua_State *L, luaL_Buffer *B, size_t sz) {
  509. luaL_buffinit(L, B);
  510. return prepbuffsize(B, sz, -1);
  511. }
  512. /* }====================================================== */
  513. /*
  514. ** {======================================================
  515. ** Reference system
  516. ** =======================================================
  517. */
  518. /* index of free-list header */
  519. #define freelist 0
  520. LUALIB_API int luaL_ref (lua_State *L, int t) {
  521. int ref;
  522. if (lua_isnil(L, -1)) {
  523. lua_pop(L, 1); /* remove from stack */
  524. return LUA_REFNIL; /* 'nil' has a unique fixed reference */
  525. }
  526. t = lua_absindex(L, t);
  527. lua_rawgeti(L, t, freelist); /* get first free element */
  528. ref = (int)lua_tointeger(L, -1); /* ref = t[freelist] */
  529. lua_pop(L, 1); /* remove it from stack */
  530. if (ref != 0) { /* any free element? */
  531. lua_rawgeti(L, t, ref); /* remove it from list */
  532. lua_rawseti(L, t, freelist); /* (t[freelist] = t[ref]) */
  533. }
  534. else /* no free elements */
  535. ref = (int)lua_rawlen(L, t) + 1; /* get a new reference */
  536. lua_rawseti(L, t, ref);
  537. return ref;
  538. }
  539. LUALIB_API void luaL_unref (lua_State *L, int t, int ref) {
  540. if (ref >= 0) {
  541. t = lua_absindex(L, t);
  542. lua_rawgeti(L, t, freelist);
  543. lua_rawseti(L, t, ref); /* t[ref] = t[freelist] */
  544. lua_pushinteger(L, ref);
  545. lua_rawseti(L, t, freelist); /* t[freelist] = ref */
  546. }
  547. }
  548. /* }====================================================== */
  549. /*
  550. ** {======================================================
  551. ** Load functions
  552. ** =======================================================
  553. */
  554. typedef struct LoadF {
  555. int n; /* number of pre-read characters */
  556. FILE *f; /* file being read */
  557. char buff[BUFSIZ]; /* area for reading file */
  558. } LoadF;
  559. static const char *getF (lua_State *L, void *ud, size_t *size) {
  560. LoadF *lf = (LoadF *)ud;
  561. (void)L; /* not used */
  562. if (lf->n > 0) { /* are there pre-read characters to be read? */
  563. *size = lf->n; /* return them (chars already in buffer) */
  564. lf->n = 0; /* no more pre-read characters */
  565. }
  566. else { /* read a block from file */
  567. /* 'fread' can return > 0 *and* set the EOF flag. If next call to
  568. 'getF' called 'fread', it might still wait for user input.
  569. The next check avoids this problem. */
  570. if (feof(lf->f)) return NULL;
  571. *size = fread(lf->buff, 1, sizeof(lf->buff), lf->f); /* read block */
  572. }
  573. return lf->buff;
  574. }
  575. static int errfile (lua_State *L, const char *what, int fnameindex) {
  576. const char *serr = strerror(errno);
  577. const char *filename = lua_tostring(L, fnameindex) + 1;
  578. lua_pushfstring(L, "cannot %s %s: %s", what, filename, serr);
  579. lua_remove(L, fnameindex);
  580. return LUA_ERRFILE;
  581. }
  582. static int skipBOM (LoadF *lf) {
  583. const char *p = "\xEF\xBB\xBF"; /* UTF-8 BOM mark */
  584. int c;
  585. lf->n = 0;
  586. do {
  587. c = getc(lf->f);
  588. if (c == EOF || c != *(const unsigned char *)p++) return c;
  589. lf->buff[lf->n++] = c; /* to be read by the parser */
  590. } while (*p != '\0');
  591. lf->n = 0; /* prefix matched; discard it */
  592. return getc(lf->f); /* return next character */
  593. }
  594. /*
  595. ** reads the first character of file 'f' and skips an optional BOM mark
  596. ** in its beginning plus its first line if it starts with '#'. Returns
  597. ** true if it skipped the first line. In any case, '*cp' has the
  598. ** first "valid" character of the file (after the optional BOM and
  599. ** a first-line comment).
  600. */
  601. static int skipcomment (LoadF *lf, int *cp) {
  602. int c = *cp = skipBOM(lf);
  603. if (c == '#') { /* first line is a comment (Unix exec. file)? */
  604. do { /* skip first line */
  605. c = getc(lf->f);
  606. } while (c != EOF && c != '\n');
  607. *cp = getc(lf->f); /* skip end-of-line, if present */
  608. return 1; /* there was a comment */
  609. }
  610. else return 0; /* no comment */
  611. }
  612. LUALIB_API int luaL_loadfilex (lua_State *L, const char *filename,
  613. const char *mode) {
  614. LoadF lf;
  615. int status, readstatus;
  616. int c;
  617. int fnameindex = lua_gettop(L) + 1; /* index of filename on the stack */
  618. if (filename == NULL) {
  619. lua_pushliteral(L, "=stdin");
  620. lf.f = stdin;
  621. }
  622. else {
  623. lua_pushfstring(L, "@%s", filename);
  624. lf.f = fopen(filename, "r");
  625. if (lf.f == NULL) return errfile(L, "open", fnameindex);
  626. }
  627. if (skipcomment(&lf, &c)) /* read initial portion */
  628. lf.buff[lf.n++] = '\n'; /* add line to correct line numbers */
  629. if (c == LUA_SIGNATURE[0] && filename) { /* binary file? */
  630. lf.f = freopen(filename, "rb", lf.f); /* reopen in binary mode */
  631. if (lf.f == NULL) return errfile(L, "reopen", fnameindex);
  632. skipcomment(&lf, &c); /* re-read initial portion */
  633. }
  634. if (c != EOF)
  635. lf.buff[lf.n++] = c; /* 'c' is the first character of the stream */
  636. status = lua_load(L, getF, &lf, lua_tostring(L, -1), mode);
  637. readstatus = ferror(lf.f);
  638. if (filename) fclose(lf.f); /* close file (even in case of errors) */
  639. if (readstatus) {
  640. lua_settop(L, fnameindex); /* ignore results from 'lua_load' */
  641. return errfile(L, "read", fnameindex);
  642. }
  643. lua_remove(L, fnameindex);
  644. return status;
  645. }
  646. typedef struct LoadS {
  647. const char *s;
  648. size_t size;
  649. } LoadS;
  650. static const char *getS (lua_State *L, void *ud, size_t *size) {
  651. LoadS *ls = (LoadS *)ud;
  652. (void)L; /* not used */
  653. if (ls->size == 0) return NULL;
  654. *size = ls->size;
  655. ls->size = 0;
  656. return ls->s;
  657. }
  658. LUALIB_API int luaL_loadbufferx (lua_State *L, const char *buff, size_t size,
  659. const char *name, const char *mode) {
  660. LoadS ls;
  661. ls.s = buff;
  662. ls.size = size;
  663. return lua_load(L, getS, &ls, name, mode);
  664. }
  665. LUALIB_API int luaL_loadstring (lua_State *L, const char *s) {
  666. return luaL_loadbuffer(L, s, strlen(s), s);
  667. }
  668. /* }====================================================== */
  669. LUALIB_API int luaL_getmetafield (lua_State *L, int obj, const char *event) {
  670. if (!lua_getmetatable(L, obj)) /* no metatable? */
  671. return LUA_TNIL;
  672. else {
  673. int tt;
  674. lua_pushstring(L, event);
  675. tt = lua_rawget(L, -2);
  676. if (tt == LUA_TNIL) /* is metafield nil? */
  677. lua_pop(L, 2); /* remove metatable and metafield */
  678. else
  679. lua_remove(L, -2); /* remove only metatable */
  680. return tt; /* return metafield type */
  681. }
  682. }
  683. LUALIB_API int luaL_callmeta (lua_State *L, int obj, const char *event) {
  684. obj = lua_absindex(L, obj);
  685. if (luaL_getmetafield(L, obj, event) == LUA_TNIL) /* no metafield? */
  686. return 0;
  687. lua_pushvalue(L, obj);
  688. lua_call(L, 1, 1);
  689. return 1;
  690. }
  691. LUALIB_API lua_Integer luaL_len (lua_State *L, int idx) {
  692. lua_Integer l;
  693. int isnum;
  694. lua_len(L, idx);
  695. l = lua_tointegerx(L, -1, &isnum);
  696. if (!isnum)
  697. luaL_error(L, "object length is not an integer");
  698. lua_pop(L, 1); /* remove object */
  699. return l;
  700. }
  701. LUALIB_API const char *luaL_tolstring (lua_State *L, int idx, size_t *len) {
  702. if (luaL_callmeta(L, idx, "__tostring")) { /* metafield? */
  703. if (!lua_isstring(L, -1))
  704. luaL_error(L, "'__tostring' must return a string");
  705. }
  706. else {
  707. switch (lua_type(L, idx)) {
  708. case LUA_TNUMBER: {
  709. if (lua_isinteger(L, idx))
  710. lua_pushfstring(L, "%I", (LUAI_UACINT)lua_tointeger(L, idx));
  711. else
  712. lua_pushfstring(L, "%f", (LUAI_UACNUMBER)lua_tonumber(L, idx));
  713. break;
  714. }
  715. case LUA_TSTRING:
  716. lua_pushvalue(L, idx);
  717. break;
  718. case LUA_TBOOLEAN:
  719. lua_pushstring(L, (lua_toboolean(L, idx) ? "true" : "false"));
  720. break;
  721. case LUA_TNIL:
  722. lua_pushliteral(L, "nil");
  723. break;
  724. default: {
  725. int tt = luaL_getmetafield(L, idx, "__name"); /* try name */
  726. const char *kind = (tt == LUA_TSTRING) ? lua_tostring(L, -1) :
  727. luaL_typename(L, idx);
  728. lua_pushfstring(L, "%s: %p", kind, lua_topointer(L, idx));
  729. if (tt != LUA_TNIL)
  730. lua_remove(L, -2); /* remove '__name' */
  731. break;
  732. }
  733. }
  734. }
  735. return lua_tolstring(L, -1, len);
  736. }
  737. /*
  738. ** set functions from list 'l' into table at top - 'nup'; each
  739. ** function gets the 'nup' elements at the top as upvalues.
  740. ** Returns with only the table at the stack.
  741. */
  742. LUALIB_API void luaL_setfuncs (lua_State *L, const luaL_Reg *l, int nup) {
  743. luaL_checkstack(L, nup, "too many upvalues");
  744. for (; l->name != NULL; l++) { /* fill the table with given functions */
  745. int i;
  746. if (l->func == NULL) /* place holder? */
  747. lua_pushboolean(L, 0);
  748. else {
  749. for (i = 0; i < nup; i++) /* copy upvalues to the top */
  750. lua_pushvalue(L, -nup);
  751. lua_pushcclosure(L, l->func, nup); /* closure with those upvalues */
  752. }
  753. lua_setfield(L, -(nup + 2), l->name);
  754. }
  755. lua_pop(L, nup); /* remove upvalues */
  756. }
  757. /*
  758. ** ensure that stack[idx][fname] has a table and push that table
  759. ** into the stack
  760. */
  761. LUALIB_API int luaL_getsubtable (lua_State *L, int idx, const char *fname) {
  762. if (lua_getfield(L, idx, fname) == LUA_TTABLE)
  763. return 1; /* table already there */
  764. else {
  765. lua_pop(L, 1); /* remove previous result */
  766. idx = lua_absindex(L, idx);
  767. lua_newtable(L);
  768. lua_pushvalue(L, -1); /* copy to be left at top */
  769. lua_setfield(L, idx, fname); /* assign new table to field */
  770. return 0; /* false, because did not find table there */
  771. }
  772. }
  773. /*
  774. ** Stripped-down 'require': After checking "loaded" table, calls 'openf'
  775. ** to open a module, registers the result in 'package.loaded' table and,
  776. ** if 'glb' is true, also registers the result in the global table.
  777. ** Leaves resulting module on the top.
  778. */
  779. LUALIB_API void luaL_requiref (lua_State *L, const char *modname,
  780. lua_CFunction openf, int glb) {
  781. luaL_getsubtable(L, LUA_REGISTRYINDEX, LUA_LOADED_TABLE);
  782. lua_getfield(L, -1, modname); /* LOADED[modname] */
  783. if (!lua_toboolean(L, -1)) { /* package not already loaded? */
  784. lua_pop(L, 1); /* remove field */
  785. lua_pushcfunction(L, openf);
  786. lua_pushstring(L, modname); /* argument to open function */
  787. lua_call(L, 1, 1); /* call 'openf' to open module */
  788. lua_pushvalue(L, -1); /* make copy of module (call result) */
  789. lua_setfield(L, -3, modname); /* LOADED[modname] = module */
  790. }
  791. lua_remove(L, -2); /* remove LOADED table */
  792. if (glb) {
  793. lua_pushvalue(L, -1); /* copy of module */
  794. lua_setglobal(L, modname); /* _G[modname] = module */
  795. }
  796. }
  797. LUALIB_API void luaL_addgsub (luaL_Buffer *b, const char *s,
  798. const char *p, const char *r) {
  799. const char *wild;
  800. size_t l = strlen(p);
  801. while ((wild = strstr(s, p)) != NULL) {
  802. luaL_addlstring(b, s, wild - s); /* push prefix */
  803. luaL_addstring(b, r); /* push replacement in place of pattern */
  804. s = wild + l; /* continue after 'p' */
  805. }
  806. luaL_addstring(b, s); /* push last suffix */
  807. }
  808. LUALIB_API const char *luaL_gsub (lua_State *L, const char *s,
  809. const char *p, const char *r) {
  810. luaL_Buffer b;
  811. luaL_buffinit(L, &b);
  812. luaL_addgsub(&b, s, p, r);
  813. luaL_pushresult(&b);
  814. return lua_tostring(L, -1);
  815. }
  816. static void *l_alloc (void *ud, void *ptr, size_t osize, size_t nsize) {
  817. (void)ud; (void)osize; /* not used */
  818. if (nsize == 0) {
  819. free(ptr);
  820. return NULL;
  821. }
  822. else
  823. return realloc(ptr, nsize);
  824. }
  825. static int panic (lua_State *L) {
  826. lua_writestringerror("PANIC: unprotected error in call to Lua API (%s)\n",
  827. lua_tostring(L, -1));
  828. return 0; /* return to Lua to abort */
  829. }
  830. /*
  831. ** Emit a warning. '*previoustocont' signals whether previous message
  832. ** was to be continued by the current one.
  833. */
  834. static void warnf (void *ud, const char *message, int tocont) {
  835. int *previoustocont = (int *)ud;
  836. if (!*previoustocont) /* previous message was the last? */
  837. lua_writestringerror("%s", "Lua warning: "); /* start a new warning */
  838. lua_writestringerror("%s", message); /* write message */
  839. if (!tocont) /* is this the last part? */
  840. lua_writestringerror("%s", "\n"); /* finish message with end-of-line */
  841. *previoustocont = tocont;
  842. }
  843. LUALIB_API lua_State *luaL_newstate (void) {
  844. lua_State *L = lua_newstate(l_alloc, NULL);
  845. if (L) {
  846. int *previoustocont; /* space for warning state */
  847. lua_atpanic(L, &panic);
  848. previoustocont = (int *)lua_newuserdatauv(L, sizeof(int), 0);
  849. luaL_ref(L, LUA_REGISTRYINDEX); /* make sure it won't be collected */
  850. *previoustocont = 0; /* next message starts a new warning */
  851. lua_setwarnf(L, warnf, previoustocont);
  852. }
  853. return L;
  854. }
  855. LUALIB_API void luaL_checkversion_ (lua_State *L, lua_Number ver, size_t sz) {
  856. lua_Number v = lua_version(L);
  857. if (sz != LUAL_NUMSIZES) /* check numeric types */
  858. luaL_error(L, "core and library have incompatible numeric types");
  859. else if (v != ver)
  860. luaL_error(L, "version mismatch: app. needs %f, Lua core provides %f",
  861. (LUAI_UACNUMBER)ver, (LUAI_UACNUMBER)v);
  862. }