lauxlib.c 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699
  1. /*
  2. ** $Id: lauxlib.c,v 1.124 2004/09/03 13:17:14 roberto Exp roberto $
  3. ** Auxiliary functions for building Lua libraries
  4. ** See Copyright Notice in lua.h
  5. */
  6. #include <ctype.h>
  7. #include <errno.h>
  8. #include <stdarg.h>
  9. #include <stdio.h>
  10. #include <stdlib.h>
  11. #include <string.h>
  12. /* This file uses only the official API of Lua.
  13. ** Any function declared here could be written as an application function.
  14. */
  15. #define lauxlib_c
  16. #define LUA_LIB
  17. #include "lua.h"
  18. #include "lauxlib.h"
  19. /* number of prereserved references (for internal use) */
  20. #define RESERVED_REFS 2
  21. /* reserved references */
  22. #define FREELIST_REF 1 /* free list of references */
  23. #define ARRAYSIZE_REF 2 /* array sizes */
  24. /* convert a stack index to positive */
  25. #define abs_index(L, i) ((i) > 0 || (i) <= LUA_REGISTRYINDEX ? (i) : \
  26. lua_gettop(L) + (i) + 1)
  27. /*
  28. ** {======================================================
  29. ** Error-report functions
  30. ** =======================================================
  31. */
  32. LUALIB_API int luaL_argerror (lua_State *L, int narg, const char *extramsg) {
  33. lua_Debug ar;
  34. lua_getstack(L, 0, &ar);
  35. lua_getinfo(L, "n", &ar);
  36. if (strcmp(ar.namewhat, "method") == 0) {
  37. narg--; /* do not count `self' */
  38. if (narg == 0) /* error is in the self argument itself? */
  39. return luaL_error(L, "calling `%s' on bad self (%s)", ar.name, extramsg);
  40. }
  41. if (ar.name == NULL)
  42. ar.name = "?";
  43. return luaL_error(L, "bad argument #%d to `%s' (%s)",
  44. narg, ar.name, extramsg);
  45. }
  46. LUALIB_API int luaL_typerror (lua_State *L, int narg, const char *tname) {
  47. const char *msg = lua_pushfstring(L, "%s expected, got %s",
  48. tname, luaL_typename(L, narg));
  49. return luaL_argerror(L, narg, msg);
  50. }
  51. static void tag_error (lua_State *L, int narg, int tag) {
  52. luaL_typerror(L, narg, lua_typename(L, tag));
  53. }
  54. LUALIB_API void luaL_where (lua_State *L, int level) {
  55. lua_Debug ar;
  56. if (lua_getstack(L, level, &ar)) { /* check function at level */
  57. lua_getinfo(L, "Sl", &ar); /* get info about it */
  58. if (ar.currentline > 0) { /* is there info? */
  59. lua_pushfstring(L, "%s:%d: ", ar.short_src, ar.currentline);
  60. return;
  61. }
  62. }
  63. lua_pushliteral(L, ""); /* else, no information available... */
  64. }
  65. LUALIB_API int luaL_error (lua_State *L, const char *fmt, ...) {
  66. va_list argp;
  67. va_start(argp, fmt);
  68. luaL_where(L, 1);
  69. lua_pushvfstring(L, fmt, argp);
  70. va_end(argp);
  71. lua_concat(L, 2);
  72. return lua_error(L);
  73. }
  74. /* }====================================================== */
  75. LUALIB_API int luaL_findstring (const char *name, const char *const list[]) {
  76. int i;
  77. for (i=0; list[i]; i++)
  78. if (strcmp(list[i], name) == 0)
  79. return i;
  80. return -1; /* name not found */
  81. }
  82. LUALIB_API int luaL_newmetatable (lua_State *L, const char *tname) {
  83. lua_getfield(L, LUA_REGISTRYINDEX, tname); /* get registry.name */
  84. if (!lua_isnil(L, -1)) /* name already in use? */
  85. return 0; /* leave previous value on top, but return 0 */
  86. lua_pop(L, 1);
  87. lua_newtable(L); /* create metatable */
  88. lua_pushvalue(L, -1);
  89. lua_setfield(L, LUA_REGISTRYINDEX, tname); /* registry.name = metatable */
  90. lua_pushvalue(L, -1);
  91. lua_pushstring(L, tname);
  92. lua_rawset(L, LUA_REGISTRYINDEX); /* registry[metatable] = name */
  93. return 1;
  94. }
  95. LUALIB_API void luaL_getmetatable (lua_State *L, const char *tname) {
  96. lua_getfield(L, LUA_REGISTRYINDEX, tname);
  97. }
  98. LUALIB_API void *luaL_checkudata (lua_State *L, int ud, const char *tname) {
  99. const char *tn;
  100. if (!lua_getmetatable(L, ud)) return NULL; /* no metatable? */
  101. lua_rawget(L, LUA_REGISTRYINDEX); /* get registry[metatable] */
  102. tn = lua_tostring(L, -1);
  103. if (tn && (strcmp(tn, tname) == 0)) {
  104. lua_pop(L, 1);
  105. return lua_touserdata(L, ud);
  106. }
  107. else {
  108. lua_pop(L, 1);
  109. return NULL;
  110. }
  111. }
  112. LUALIB_API void luaL_checkstack (lua_State *L, int space, const char *mes) {
  113. if (!lua_checkstack(L, space))
  114. luaL_error(L, "stack overflow (%s)", mes);
  115. }
  116. LUALIB_API void luaL_checktype (lua_State *L, int narg, int t) {
  117. if (lua_type(L, narg) != t)
  118. tag_error(L, narg, t);
  119. }
  120. LUALIB_API void luaL_checkany (lua_State *L, int narg) {
  121. if (lua_type(L, narg) == LUA_TNONE)
  122. luaL_argerror(L, narg, "value expected");
  123. }
  124. LUALIB_API const char *luaL_checklstring (lua_State *L, int narg, size_t *len) {
  125. const char *s = lua_tostring(L, narg);
  126. if (!s) tag_error(L, narg, LUA_TSTRING);
  127. if (len) *len = lua_strlen(L, narg);
  128. return s;
  129. }
  130. LUALIB_API const char *luaL_optlstring (lua_State *L, int narg,
  131. const char *def, size_t *len) {
  132. if (lua_isnoneornil(L, narg)) {
  133. if (len)
  134. *len = (def ? strlen(def) : 0);
  135. return def;
  136. }
  137. else return luaL_checklstring(L, narg, len);
  138. }
  139. LUALIB_API lua_Number luaL_checknumber (lua_State *L, int narg) {
  140. lua_Number d = lua_tonumber(L, narg);
  141. if (d == 0 && !lua_isnumber(L, narg)) /* avoid extra test when d is not 0 */
  142. tag_error(L, narg, LUA_TNUMBER);
  143. return d;
  144. }
  145. LUALIB_API lua_Number luaL_optnumber (lua_State *L, int narg, lua_Number def) {
  146. if (lua_isnoneornil(L, narg)) return def;
  147. else return luaL_checknumber(L, narg);
  148. }
  149. LUALIB_API lua_Integer luaL_checkinteger (lua_State *L, int narg) {
  150. lua_Integer d = lua_tointeger(L, narg);
  151. if (d == 0 && !lua_isnumber(L, narg)) /* avoid extra test when d is not 0 */
  152. tag_error(L, narg, LUA_TNUMBER);
  153. return d;
  154. }
  155. LUALIB_API lua_Integer luaL_optinteger (lua_State *L, int narg,
  156. lua_Integer def) {
  157. if (lua_isnoneornil(L, narg)) return def;
  158. else return luaL_checkinteger(L, narg);
  159. }
  160. LUALIB_API int luaL_getmetafield (lua_State *L, int obj, const char *event) {
  161. if (!lua_getmetatable(L, obj)) /* no metatable? */
  162. return 0;
  163. lua_getfield(L, -1, event);
  164. if (lua_isnil(L, -1)) {
  165. lua_pop(L, 2); /* remove metatable and metafield */
  166. return 0;
  167. }
  168. else {
  169. lua_remove(L, -2); /* remove only metatable */
  170. return 1;
  171. }
  172. }
  173. LUALIB_API int luaL_callmeta (lua_State *L, int obj, const char *event) {
  174. obj = abs_index(L, obj);
  175. if (!luaL_getmetafield(L, obj, event)) /* no metafield? */
  176. return 0;
  177. lua_pushvalue(L, obj);
  178. lua_call(L, 1, 1);
  179. return 1;
  180. }
  181. LUALIB_API void luaL_openlib (lua_State *L, const char *libname,
  182. const luaL_reg *l, int nup) {
  183. if (libname) {
  184. /* check whether lib already exists */
  185. lua_getglobal(L, libname);
  186. if (lua_isnil(L, -1)) { /* no? */
  187. lua_pop(L, 1);
  188. lua_newtable(L); /* create it */
  189. if (lua_getmetatable(L, LUA_GLOBALSINDEX))
  190. lua_setmetatable(L, -2); /* share metatable with global table */
  191. lua_pushvalue(L, -1);
  192. /* register it with given name */
  193. lua_setglobal(L, libname);
  194. }
  195. lua_insert(L, -(nup+1)); /* move library table to below upvalues */
  196. }
  197. for (; l->name; l++) {
  198. int i;
  199. for (i=0; i<nup; i++) /* copy upvalues to the top */
  200. lua_pushvalue(L, -nup);
  201. lua_pushcclosure(L, l->func, nup);
  202. lua_setfield(L, -(nup+2), l->name);
  203. }
  204. lua_pop(L, nup); /* remove upvalues */
  205. }
  206. /*
  207. ** {======================================================
  208. ** getn-setn: size for arrays
  209. ** =======================================================
  210. */
  211. static int checkint (lua_State *L, int topop) {
  212. int n = (lua_type(L, -1) == LUA_TNUMBER) ? lua_tointeger(L, -1) : -1;
  213. lua_pop(L, topop);
  214. return n;
  215. }
  216. static void getsizes (lua_State *L) {
  217. lua_rawgeti(L, LUA_REGISTRYINDEX, ARRAYSIZE_REF);
  218. if (lua_isnil(L, -1)) { /* no `size' table? */
  219. lua_pop(L, 1); /* remove nil */
  220. lua_newtable(L); /* create it */
  221. lua_pushvalue(L, -1); /* `size' will be its own metatable */
  222. lua_setmetatable(L, -2);
  223. lua_pushliteral(L, "kv");
  224. lua_setfield(L, -2, "__mode"); /* metatable(N).__mode = "kv" */
  225. lua_pushvalue(L, -1);
  226. lua_rawseti(L, LUA_REGISTRYINDEX, ARRAYSIZE_REF); /* store in register */
  227. }
  228. }
  229. LUALIB_API void luaL_setn (lua_State *L, int t, int n) {
  230. t = abs_index(L, t);
  231. getsizes(L);
  232. lua_pushvalue(L, t);
  233. lua_pushinteger(L, n);
  234. lua_rawset(L, -3); /* sizes[t] = n */
  235. lua_pop(L, 1); /* remove `sizes' */
  236. }
  237. /* find an `n' such that t[n] ~= nil and t[n+1] == nil */
  238. static int countn (lua_State *L, int t) {
  239. int i = LUA_FIRSTINDEX - 1;
  240. int j = 2;
  241. /* find `i' such that i <= n < i*2 (= j) */
  242. for (;;) {
  243. lua_rawgeti(L, t, j);
  244. if (lua_isnil(L, -1)) break;
  245. lua_pop(L, 1);
  246. i = j;
  247. j = i*2;
  248. }
  249. lua_pop(L, 1);
  250. /* i <= n < j; do a binary search */
  251. while (i < j-1) {
  252. int m = (i+j)/2;
  253. lua_rawgeti(L, t, m);
  254. if (lua_isnil(L, -1)) j = m;
  255. else i = m;
  256. lua_pop(L, 1);
  257. }
  258. return i - LUA_FIRSTINDEX + 1;
  259. }
  260. LUALIB_API int luaL_getn (lua_State *L, int t) {
  261. int n;
  262. t = abs_index(L, t);
  263. getsizes(L); /* try sizes[t] */
  264. lua_pushvalue(L, t);
  265. lua_rawget(L, -2);
  266. if ((n = checkint(L, 2)) >= 0) return n;
  267. lua_getfield(L, t, "n"); /* else try t.n */
  268. if ((n = checkint(L, 1)) >= 0) return n;
  269. return countn(L, t);
  270. }
  271. /* }====================================================== */
  272. static const char *pushnexttemplate (lua_State *L, const char *path) {
  273. const char *l;
  274. if (*path == '\0') return NULL; /* no more templates */
  275. if (*path == LUA_PATH_SEP) path++; /* skip separator */
  276. l = strchr(path, LUA_PATH_SEP); /* find next separator */
  277. if (l == NULL) l = path+strlen(path);
  278. lua_pushlstring(L, path, l - path); /* template */
  279. return l;
  280. }
  281. LUALIB_API const char *luaL_gsub (lua_State *L, const char *s, const char *p,
  282. const char *r) {
  283. const char *wild;
  284. int l = strlen(p);
  285. luaL_Buffer b;
  286. luaL_buffinit(L, &b);
  287. while ((wild = strstr(s, p)) != NULL) {
  288. luaL_addlstring(&b, s, wild - s); /* push prefix */
  289. luaL_addstring(&b, r); /* push replacement in place of pattern */
  290. s = wild + l; /* continue after `p' */
  291. }
  292. luaL_addstring(&b, s); /* push last suffix (`n' already includes this) */
  293. luaL_pushresult(&b);
  294. return lua_tostring(L, -1);
  295. }
  296. LUALIB_API const char *luaL_searchpath (lua_State *L, const char *name,
  297. const char *path) {
  298. FILE *f;
  299. const char *p = path;
  300. for (;;) {
  301. const char *fname;
  302. if ((p = pushnexttemplate(L, p)) == NULL) {
  303. lua_pushfstring(L, "no readable `%s' in path `%s'", name, path);
  304. return NULL;
  305. }
  306. fname = luaL_gsub(L, lua_tostring(L, -1), LUA_PATH_MARK, name);
  307. lua_remove(L, -2); /* remove path template */
  308. f = fopen(fname, "r"); /* try to read it */
  309. if (f) {
  310. fclose(f);
  311. return fname;
  312. }
  313. lua_pop(L, 1); /* remove file name */
  314. }
  315. }
  316. LUALIB_API const char *luaL_getfield (lua_State *L, const char *fname) {
  317. const char *e;
  318. while ((e = strchr(fname, '.')) != NULL) {
  319. lua_pushlstring(L, fname, e - fname);
  320. lua_gettable(L, -2);
  321. lua_remove(L, -2); /* remove previous table */
  322. fname = e + 1;
  323. if (!lua_istable(L, -1)) return fname;
  324. }
  325. lua_getfield(L, -1, fname); /* get last field */
  326. lua_remove(L, -2); /* remove previous table */
  327. return NULL;
  328. }
  329. LUALIB_API const char *luaL_setfield (lua_State *L, const char *fname) {
  330. const char *e;
  331. lua_insert(L, -2); /* move value to below table */
  332. while ((e = strchr(fname, '.')) != NULL) {
  333. lua_pushlstring(L, fname, e - fname);
  334. lua_gettable(L, -2);
  335. if (lua_isnil(L, -1)) { /* no such field? */
  336. lua_pop(L, 1); /* remove this nil */
  337. lua_newtable(L); /* create a new table for field */
  338. lua_pushlstring(L, fname, e - fname);
  339. lua_pushvalue(L, -2);
  340. lua_settable(L, -4); /* set new table into field */
  341. }
  342. lua_remove(L, -2); /* remove previous table */
  343. fname = e + 1;
  344. if (!lua_istable(L, -1)) {
  345. lua_pop(L, 2); /* remove table and value */
  346. return fname;
  347. }
  348. }
  349. lua_insert(L, -2); /* move table to below value */
  350. lua_setfield(L, -2, fname); /* set last field */
  351. lua_remove(L, -2); /* remove table */
  352. return NULL;
  353. }
  354. /*
  355. ** {======================================================
  356. ** Generic Buffer manipulation
  357. ** =======================================================
  358. */
  359. #define bufflen(B) ((B)->p - (B)->buffer)
  360. #define bufffree(B) ((size_t)(LUAL_BUFFERSIZE - bufflen(B)))
  361. #define LIMIT (LUA_MINSTACK/2)
  362. static int emptybuffer (luaL_Buffer *B) {
  363. size_t l = bufflen(B);
  364. if (l == 0) return 0; /* put nothing on stack */
  365. else {
  366. lua_pushlstring(B->L, B->buffer, l);
  367. B->p = B->buffer;
  368. B->lvl++;
  369. return 1;
  370. }
  371. }
  372. static void adjuststack (luaL_Buffer *B) {
  373. if (B->lvl > 1) {
  374. lua_State *L = B->L;
  375. int toget = 1; /* number of levels to concat */
  376. size_t toplen = lua_strlen(L, -1);
  377. do {
  378. size_t l = lua_strlen(L, -(toget+1));
  379. if (B->lvl - toget + 1 >= LIMIT || toplen > l) {
  380. toplen += l;
  381. toget++;
  382. }
  383. else break;
  384. } while (toget < B->lvl);
  385. lua_concat(L, toget);
  386. B->lvl = B->lvl - toget + 1;
  387. }
  388. }
  389. LUALIB_API char *luaL_prepbuffer (luaL_Buffer *B) {
  390. if (emptybuffer(B))
  391. adjuststack(B);
  392. return B->buffer;
  393. }
  394. LUALIB_API void luaL_addlstring (luaL_Buffer *B, const char *s, size_t l) {
  395. while (l--)
  396. luaL_putchar(B, *s++);
  397. }
  398. LUALIB_API void luaL_addstring (luaL_Buffer *B, const char *s) {
  399. luaL_addlstring(B, s, strlen(s));
  400. }
  401. LUALIB_API void luaL_pushresult (luaL_Buffer *B) {
  402. emptybuffer(B);
  403. lua_concat(B->L, B->lvl);
  404. B->lvl = 1;
  405. }
  406. LUALIB_API void luaL_addvalue (luaL_Buffer *B) {
  407. lua_State *L = B->L;
  408. size_t vl = lua_strlen(L, -1);
  409. if (vl <= bufffree(B)) { /* fit into buffer? */
  410. memcpy(B->p, lua_tostring(L, -1), vl); /* put it there */
  411. B->p += vl;
  412. lua_pop(L, 1); /* remove from stack */
  413. }
  414. else {
  415. if (emptybuffer(B))
  416. lua_insert(L, -2); /* put buffer before new value */
  417. B->lvl++; /* add new value into B stack */
  418. adjuststack(B);
  419. }
  420. }
  421. LUALIB_API void luaL_buffinit (lua_State *L, luaL_Buffer *B) {
  422. B->L = L;
  423. B->p = B->buffer;
  424. B->lvl = 0;
  425. }
  426. /* }====================================================== */
  427. LUALIB_API int luaL_ref (lua_State *L, int t) {
  428. int ref;
  429. t = abs_index(L, t);
  430. if (lua_isnil(L, -1)) {
  431. lua_pop(L, 1); /* remove from stack */
  432. return LUA_REFNIL; /* `nil' has a unique fixed reference */
  433. }
  434. lua_rawgeti(L, t, FREELIST_REF); /* get first free element */
  435. ref = (int)lua_tointeger(L, -1); /* ref = t[FREELIST_REF] */
  436. lua_pop(L, 1); /* remove it from stack */
  437. if (ref != 0) { /* any free element? */
  438. lua_rawgeti(L, t, ref); /* remove it from list */
  439. lua_rawseti(L, t, FREELIST_REF); /* (t[FREELIST_REF] = t[ref]) */
  440. }
  441. else { /* no free elements */
  442. ref = luaL_getn(L, t);
  443. if (ref < RESERVED_REFS)
  444. ref = RESERVED_REFS; /* skip reserved references */
  445. ref++; /* create new reference */
  446. luaL_setn(L, t, ref);
  447. }
  448. lua_rawseti(L, t, ref);
  449. return ref;
  450. }
  451. LUALIB_API void luaL_unref (lua_State *L, int t, int ref) {
  452. if (ref >= 0) {
  453. t = abs_index(L, t);
  454. lua_rawgeti(L, t, FREELIST_REF);
  455. lua_rawseti(L, t, ref); /* t[ref] = t[FREELIST_REF] */
  456. lua_pushinteger(L, ref);
  457. lua_rawseti(L, t, FREELIST_REF); /* t[FREELIST_REF] = ref */
  458. }
  459. }
  460. /*
  461. ** {======================================================
  462. ** Load functions
  463. ** =======================================================
  464. */
  465. typedef struct LoadF {
  466. int extraline;
  467. FILE *f;
  468. char buff[LUAL_BUFFERSIZE];
  469. } LoadF;
  470. static const char *getF (lua_State *L, void *ud, size_t *size) {
  471. LoadF *lf = (LoadF *)ud;
  472. (void)L;
  473. if (lf->extraline) {
  474. lf->extraline = 0;
  475. *size = 1;
  476. return "\n";
  477. }
  478. if (feof(lf->f)) return NULL;
  479. *size = fread(lf->buff, 1, LUAL_BUFFERSIZE, lf->f);
  480. return (*size > 0) ? lf->buff : NULL;
  481. }
  482. static int errfile (lua_State *L, const char *what, int fnameindex) {
  483. const char *serr = strerror(errno);
  484. const char *filename = lua_tostring(L, fnameindex) + 1;
  485. lua_pushfstring(L, "cannot %s %s: %s", what, filename, serr);
  486. lua_remove(L, fnameindex);
  487. return LUA_ERRFILE;
  488. }
  489. LUALIB_API int luaL_loadfile (lua_State *L, const char *filename) {
  490. LoadF lf;
  491. int status, readstatus;
  492. int c;
  493. int fnameindex = lua_gettop(L) + 1; /* index of filename on the stack */
  494. lf.extraline = 0;
  495. if (filename == NULL) {
  496. lua_pushliteral(L, "=stdin");
  497. lf.f = stdin;
  498. }
  499. else {
  500. lua_pushfstring(L, "@%s", filename);
  501. lf.f = fopen(filename, "r");
  502. if (lf.f == NULL) return errfile(L, "open", fnameindex);
  503. }
  504. c = getc(lf.f);
  505. if (c == '#') { /* Unix exec. file? */
  506. lf.extraline = 1;
  507. while ((c = getc(lf.f)) != EOF && c != '\n') ; /* skip first line */
  508. if (c == '\n') c = getc(lf.f);
  509. }
  510. if (c == LUA_SIGNATURE[0] && lf.f != stdin) { /* binary file? */
  511. fclose(lf.f);
  512. lf.f = fopen(filename, "rb"); /* reopen in binary mode */
  513. if (lf.f == NULL) return errfile(L, "reopen", fnameindex);
  514. /* skip eventual `#!...' */
  515. while ((c = getc(lf.f)) != EOF && c != LUA_SIGNATURE[0]) ;
  516. lf.extraline = 0;
  517. }
  518. ungetc(c, lf.f);
  519. status = lua_load(L, getF, &lf, lua_tostring(L, -1));
  520. readstatus = ferror(lf.f);
  521. if (lf.f != stdin) fclose(lf.f); /* close file (even in case of errors) */
  522. if (readstatus) {
  523. lua_settop(L, fnameindex); /* ignore results from `lua_load' */
  524. return errfile(L, "read", fnameindex);
  525. }
  526. lua_remove(L, fnameindex);
  527. return status;
  528. }
  529. typedef struct LoadS {
  530. const char *s;
  531. size_t size;
  532. } LoadS;
  533. static const char *getS (lua_State *L, void *ud, size_t *size) {
  534. LoadS *ls = (LoadS *)ud;
  535. (void)L;
  536. if (ls->size == 0) return NULL;
  537. *size = ls->size;
  538. ls->size = 0;
  539. return ls->s;
  540. }
  541. LUALIB_API int luaL_loadbuffer (lua_State *L, const char *buff, size_t size,
  542. const char *name) {
  543. LoadS ls;
  544. ls.s = buff;
  545. ls.size = size;
  546. return lua_load(L, getS, &ls, name);
  547. }
  548. /* }====================================================== */
  549. static void *l_alloc (void *ud, void *ptr, size_t osize, size_t nsize) {
  550. (void)ud;
  551. (void)osize;
  552. if (nsize == 0) {
  553. free(ptr);
  554. return NULL;
  555. }
  556. else
  557. return realloc(ptr, nsize);
  558. }
  559. static int panic (lua_State *L) {
  560. fprintf(stderr, "PANIC: unprotected error during Lua-API call\n");
  561. return 0;
  562. }
  563. LUALIB_API lua_State *luaL_newstate (void) {
  564. lua_State *L = lua_newstate(l_alloc, NULL);
  565. lua_atpanic(L, &panic);
  566. return L;
  567. }