2
0

lapi.c 27 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216
  1. /*
  2. ** $Id: lapi.c,v 2.139 2010/10/25 20:31:11 roberto Exp roberto $
  3. ** Lua API
  4. ** See Copyright Notice in lua.h
  5. */
  6. #include <stdarg.h>
  7. #include <string.h>
  8. #define lapi_c
  9. #define LUA_CORE
  10. #include "lua.h"
  11. #include "lapi.h"
  12. #include "ldebug.h"
  13. #include "ldo.h"
  14. #include "lfunc.h"
  15. #include "lgc.h"
  16. #include "lmem.h"
  17. #include "lobject.h"
  18. #include "lstate.h"
  19. #include "lstring.h"
  20. #include "ltable.h"
  21. #include "ltm.h"
  22. #include "lundump.h"
  23. #include "lvm.h"
  24. const char lua_ident[] =
  25. "$LuaVersion: " LUA_COPYRIGHT " $"
  26. "$LuaAuthors: " LUA_AUTHORS " $";
  27. #define api_checkvalidindex(L, i) api_check(L, (i) != luaO_nilobject, \
  28. "invalid index")
  29. static TValue *index2addr (lua_State *L, int idx) {
  30. CallInfo *ci = L->ci;
  31. if (idx > 0) {
  32. TValue *o = ci->func + idx;
  33. api_check(L, idx <= ci->top - (ci->func + 1), "unacceptable index");
  34. if (o >= L->top) return cast(TValue *, luaO_nilobject);
  35. else return o;
  36. }
  37. else if (idx > LUA_REGISTRYINDEX) {
  38. api_check(L, idx != 0 && -idx <= L->top - (ci->func + 1), "invalid index");
  39. return L->top + idx;
  40. }
  41. else if (idx == LUA_REGISTRYINDEX)
  42. return &G(L)->l_registry;
  43. else { /* upvalues */
  44. idx = LUA_REGISTRYINDEX - idx;
  45. api_check(L, idx <= MAXUPVAL + 1, "upvalue index too large");
  46. if (ttislcf(ci->func)) /* light C function? */
  47. return cast(TValue *, luaO_nilobject); /* it has no upvalues */
  48. else {
  49. Closure *func = clvalue(ci->func);
  50. return (idx <= func->c.nupvalues)
  51. ? &func->c.upvalue[idx-1]
  52. : cast(TValue *, luaO_nilobject);
  53. }
  54. }
  55. }
  56. /*
  57. ** to be called by 'lua_checkstack' in protected mode, to grow stack
  58. ** capturing memory errors
  59. */
  60. static void growstack (lua_State *L, void *ud) {
  61. int size = *(int *)ud;
  62. luaD_growstack(L, size);
  63. }
  64. LUA_API int lua_checkstack (lua_State *L, int size) {
  65. int res;
  66. CallInfo *ci = L->ci;
  67. lua_lock(L);
  68. if (L->stack_last - L->top > size) /* stack large enough? */
  69. res = 1; /* yes; check is OK */
  70. else { /* no; need to grow stack */
  71. int inuse = cast_int(L->top - L->stack) + EXTRA_STACK;
  72. if (inuse > LUAI_MAXSTACK - size) /* can grow without overflow? */
  73. res = 0; /* no */
  74. else /* try to grow stack */
  75. res = (luaD_rawrunprotected(L, &growstack, &size) == LUA_OK);
  76. }
  77. if (res && ci->top < L->top + size)
  78. ci->top = L->top + size; /* adjust frame top */
  79. lua_unlock(L);
  80. return res;
  81. }
  82. LUA_API void lua_xmove (lua_State *from, lua_State *to, int n) {
  83. int i;
  84. if (from == to) return;
  85. lua_lock(to);
  86. api_checknelems(from, n);
  87. api_check(from, G(from) == G(to), "moving among independent states");
  88. api_check(from, to->ci->top - to->top >= n, "not enough elements to move");
  89. from->top -= n;
  90. for (i = 0; i < n; i++) {
  91. setobj2s(to, to->top++, from->top + i);
  92. }
  93. lua_unlock(to);
  94. }
  95. LUA_API lua_CFunction lua_atpanic (lua_State *L, lua_CFunction panicf) {
  96. lua_CFunction old;
  97. lua_lock(L);
  98. old = G(L)->panic;
  99. G(L)->panic = panicf;
  100. lua_unlock(L);
  101. return old;
  102. }
  103. LUA_API const lua_Number *lua_version (lua_State *L) {
  104. static const lua_Number version = LUA_VERSION_NUM;
  105. if (L == NULL) return &version;
  106. else return G(L)->version;
  107. }
  108. /*
  109. ** basic stack manipulation
  110. */
  111. /*
  112. ** convert an acceptable stack index into an absolute index
  113. */
  114. LUA_API int lua_absindex (lua_State *L, int idx) {
  115. return (idx > 0 || idx <= LUA_REGISTRYINDEX)
  116. ? idx
  117. : cast_int(L->top - L->ci->func + idx);
  118. }
  119. LUA_API int lua_gettop (lua_State *L) {
  120. return cast_int(L->top - (L->ci->func + 1));
  121. }
  122. LUA_API void lua_settop (lua_State *L, int idx) {
  123. StkId func = L->ci->func;
  124. lua_lock(L);
  125. if (idx >= 0) {
  126. api_check(L, idx <= L->stack_last - (func + 1), "new top too large");
  127. while (L->top < (func + 1) + idx)
  128. setnilvalue(L->top++);
  129. L->top = (func + 1) + idx;
  130. }
  131. else {
  132. api_check(L, -(idx+1) <= (L->top - (func + 1)), "invalid new top");
  133. L->top += idx+1; /* `subtract' index (index is negative) */
  134. }
  135. lua_unlock(L);
  136. }
  137. LUA_API void lua_remove (lua_State *L, int idx) {
  138. StkId p;
  139. lua_lock(L);
  140. p = index2addr(L, idx);
  141. api_checkvalidindex(L, p);
  142. while (++p < L->top) setobjs2s(L, p-1, p);
  143. L->top--;
  144. lua_unlock(L);
  145. }
  146. LUA_API void lua_insert (lua_State *L, int idx) {
  147. StkId p;
  148. StkId q;
  149. lua_lock(L);
  150. p = index2addr(L, idx);
  151. api_checkvalidindex(L, p);
  152. for (q = L->top; q>p; q--) setobjs2s(L, q, q-1);
  153. setobjs2s(L, p, L->top);
  154. lua_unlock(L);
  155. }
  156. static void moveto (lua_State *L, TValue *fr, int idx) {
  157. TValue *to = index2addr(L, idx);
  158. api_checkvalidindex(L, to);
  159. setobj(L, to, fr);
  160. if (idx < LUA_REGISTRYINDEX) { /* function upvalue? */
  161. lua_assert(ttisclosure(L->ci->func));
  162. luaC_barrier(L, clvalue(L->ci->func), fr);
  163. }
  164. /* LUA_REGISTRYINDEX does not need gc barrier
  165. (collector revisits it before finishing collection) */
  166. }
  167. LUA_API void lua_replace (lua_State *L, int idx) {
  168. lua_lock(L);
  169. api_checknelems(L, 1);
  170. moveto(L, L->top - 1, idx);
  171. L->top--;
  172. lua_unlock(L);
  173. }
  174. LUA_API void lua_copy (lua_State *L, int fromidx, int toidx) {
  175. TValue *fr;
  176. lua_lock(L);
  177. fr = index2addr(L, fromidx);
  178. api_checkvalidindex(L, fr);
  179. moveto(L, fr, toidx);
  180. lua_unlock(L);
  181. }
  182. LUA_API void lua_pushvalue (lua_State *L, int idx) {
  183. lua_lock(L);
  184. setobj2s(L, L->top, index2addr(L, idx));
  185. api_incr_top(L);
  186. lua_unlock(L);
  187. }
  188. /*
  189. ** access functions (stack -> C)
  190. */
  191. LUA_API int lua_type (lua_State *L, int idx) {
  192. StkId o = index2addr(L, idx);
  193. return (o == luaO_nilobject) ? LUA_TNONE : ttypenv(o);
  194. }
  195. LUA_API const char *lua_typename (lua_State *L, int t) {
  196. UNUSED(L);
  197. return ttypename(t);
  198. }
  199. LUA_API int lua_iscfunction (lua_State *L, int idx) {
  200. StkId o = index2addr(L, idx);
  201. return (ttislcf(o) || (ttisclosure(o) && clvalue(o)->c.isC));
  202. }
  203. LUA_API int lua_isnumber (lua_State *L, int idx) {
  204. TValue n;
  205. const TValue *o = index2addr(L, idx);
  206. return tonumber(o, &n);
  207. }
  208. LUA_API int lua_isstring (lua_State *L, int idx) {
  209. int t = lua_type(L, idx);
  210. return (t == LUA_TSTRING || t == LUA_TNUMBER);
  211. }
  212. LUA_API int lua_isuserdata (lua_State *L, int idx) {
  213. const TValue *o = index2addr(L, idx);
  214. return (ttisuserdata(o) || ttislightuserdata(o));
  215. }
  216. LUA_API int lua_rawequal (lua_State *L, int index1, int index2) {
  217. StkId o1 = index2addr(L, index1);
  218. StkId o2 = index2addr(L, index2);
  219. return (o1 == luaO_nilobject || o2 == luaO_nilobject) ? 0
  220. : luaO_rawequalObj(o1, o2);
  221. }
  222. LUA_API void lua_arith (lua_State *L, int op) {
  223. lua_lock(L);
  224. api_checknelems(L, 2);
  225. if (ttisnumber(L->top - 2) && ttisnumber(L->top - 1)) {
  226. changenvalue(L->top - 2,
  227. luaO_arith(op, nvalue(L->top - 2), nvalue(L->top - 1)));
  228. }
  229. else
  230. luaV_arith(L, L->top - 2, L->top - 2, L->top - 1,
  231. cast(TMS, op - LUA_OPADD + TM_ADD));
  232. L->top--;
  233. lua_unlock(L);
  234. }
  235. LUA_API int lua_compare (lua_State *L, int index1, int index2, int op) {
  236. StkId o1, o2;
  237. int i;
  238. lua_lock(L); /* may call tag method */
  239. o1 = index2addr(L, index1);
  240. o2 = index2addr(L, index2);
  241. if (o1 == luaO_nilobject || o2 == luaO_nilobject)
  242. i = 0;
  243. else switch (op) {
  244. case LUA_OPEQ: i = equalobj(L, o1, o2); break;
  245. case LUA_OPLT: i = luaV_lessthan(L, o1, o2); break;
  246. case LUA_OPLE: i = luaV_lessequal(L, o1, o2); break;
  247. default: api_check(L, 0, "invalid option"); i = 0;
  248. }
  249. lua_unlock(L);
  250. return i;
  251. }
  252. LUA_API lua_Number lua_tonumberx (lua_State *L, int idx, int *isnum) {
  253. TValue n;
  254. const TValue *o = index2addr(L, idx);
  255. if (tonumber(o, &n)) {
  256. if (isnum) *isnum = 1;
  257. return nvalue(o);
  258. }
  259. else {
  260. if (isnum) *isnum = 0;
  261. return 0;
  262. }
  263. }
  264. LUA_API lua_Integer lua_tointegerx (lua_State *L, int idx, int *isnum) {
  265. TValue n;
  266. const TValue *o = index2addr(L, idx);
  267. if (tonumber(o, &n)) {
  268. lua_Integer res;
  269. lua_Number num = nvalue(o);
  270. lua_number2integer(res, num);
  271. if (isnum) *isnum = 1;
  272. return res;
  273. }
  274. else {
  275. if (isnum) *isnum = 0;
  276. return 0;
  277. }
  278. }
  279. LUA_API lua_Unsigned lua_tounsignedx (lua_State *L, int idx, int *isnum) {
  280. TValue n;
  281. const TValue *o = index2addr(L, idx);
  282. if (tonumber(o, &n)) {
  283. lua_Unsigned res;
  284. lua_Number num = nvalue(o);
  285. lua_number2unsigned(res, num);
  286. if (isnum) *isnum = 1;
  287. return res;
  288. }
  289. else {
  290. if (isnum) *isnum = 0;
  291. return 0;
  292. }
  293. }
  294. LUA_API int lua_toboolean (lua_State *L, int idx) {
  295. const TValue *o = index2addr(L, idx);
  296. return !l_isfalse(o);
  297. }
  298. LUA_API const char *lua_tolstring (lua_State *L, int idx, size_t *len) {
  299. StkId o = index2addr(L, idx);
  300. if (!ttisstring(o)) {
  301. lua_lock(L); /* `luaV_tostring' may create a new string */
  302. if (!luaV_tostring(L, o)) { /* conversion failed? */
  303. if (len != NULL) *len = 0;
  304. lua_unlock(L);
  305. return NULL;
  306. }
  307. luaC_checkGC(L);
  308. o = index2addr(L, idx); /* previous call may reallocate the stack */
  309. lua_unlock(L);
  310. }
  311. if (len != NULL) *len = tsvalue(o)->len;
  312. return svalue(o);
  313. }
  314. LUA_API size_t lua_rawlen (lua_State *L, int idx) {
  315. StkId o = index2addr(L, idx);
  316. switch (ttype(o)) {
  317. case LUA_TSTRING: return tsvalue(o)->len;
  318. case LUA_TUSERDATA: return uvalue(o)->len;
  319. case LUA_TTABLE: return luaH_getn(hvalue(o));
  320. default: return 0;
  321. }
  322. }
  323. LUA_API lua_CFunction lua_tocfunction (lua_State *L, int idx) {
  324. StkId o = index2addr(L, idx);
  325. if (ttislcf(o)) return fvalue(o);
  326. else if (ttisclosure(o) && clvalue(o)->c.isC)
  327. return clvalue(o)->c.f;
  328. else return NULL; /* not a C function */
  329. }
  330. LUA_API void *lua_touserdata (lua_State *L, int idx) {
  331. StkId o = index2addr(L, idx);
  332. switch (ttype(o)) {
  333. case LUA_TUSERDATA: return (rawuvalue(o) + 1);
  334. case LUA_TLIGHTUSERDATA: return pvalue(o);
  335. default: return NULL;
  336. }
  337. }
  338. LUA_API lua_State *lua_tothread (lua_State *L, int idx) {
  339. StkId o = index2addr(L, idx);
  340. return (!ttisthread(o)) ? NULL : thvalue(o);
  341. }
  342. LUA_API const void *lua_topointer (lua_State *L, int idx) {
  343. StkId o = index2addr(L, idx);
  344. switch (ttype(o)) {
  345. case LUA_TTABLE: return hvalue(o);
  346. case LUA_TFUNCTION: return clvalue(o);
  347. case LUA_TLCF: return cast(void *, cast(size_t, fvalue(o)));
  348. case LUA_TTHREAD: return thvalue(o);
  349. case LUA_TUSERDATA:
  350. case LUA_TLIGHTUSERDATA:
  351. return lua_touserdata(L, idx);
  352. default: return NULL;
  353. }
  354. }
  355. /*
  356. ** push functions (C -> stack)
  357. */
  358. LUA_API void lua_pushnil (lua_State *L) {
  359. lua_lock(L);
  360. setnilvalue(L->top);
  361. api_incr_top(L);
  362. lua_unlock(L);
  363. }
  364. LUA_API void lua_pushnumber (lua_State *L, lua_Number n) {
  365. lua_lock(L);
  366. setnvalue(L->top, n);
  367. api_incr_top(L);
  368. lua_unlock(L);
  369. }
  370. LUA_API void lua_pushinteger (lua_State *L, lua_Integer n) {
  371. lua_lock(L);
  372. setnvalue(L->top, cast_num(n));
  373. api_incr_top(L);
  374. lua_unlock(L);
  375. }
  376. LUA_API void lua_pushunsigned (lua_State *L, lua_Unsigned u) {
  377. lua_Number n;
  378. lua_lock(L);
  379. n = lua_unsigned2number(u);
  380. setnvalue(L->top, n);
  381. api_incr_top(L);
  382. lua_unlock(L);
  383. }
  384. LUA_API const char *lua_pushlstring (lua_State *L, const char *s, size_t len) {
  385. TString *ts;
  386. lua_lock(L);
  387. luaC_checkGC(L);
  388. ts = luaS_newlstr(L, s, len);
  389. setsvalue2s(L, L->top, ts);
  390. api_incr_top(L);
  391. lua_unlock(L);
  392. return getstr(ts);
  393. }
  394. LUA_API const char *lua_pushstring (lua_State *L, const char *s) {
  395. if (s == NULL) {
  396. lua_pushnil(L);
  397. return NULL;
  398. }
  399. else {
  400. TString *ts;
  401. lua_lock(L);
  402. luaC_checkGC(L);
  403. ts = luaS_new(L, s);
  404. setsvalue2s(L, L->top, ts);
  405. api_incr_top(L);
  406. lua_unlock(L);
  407. return getstr(ts);
  408. }
  409. }
  410. LUA_API const char *lua_pushvfstring (lua_State *L, const char *fmt,
  411. va_list argp) {
  412. const char *ret;
  413. lua_lock(L);
  414. luaC_checkGC(L);
  415. ret = luaO_pushvfstring(L, fmt, argp);
  416. lua_unlock(L);
  417. return ret;
  418. }
  419. LUA_API const char *lua_pushfstring (lua_State *L, const char *fmt, ...) {
  420. const char *ret;
  421. va_list argp;
  422. lua_lock(L);
  423. luaC_checkGC(L);
  424. va_start(argp, fmt);
  425. ret = luaO_pushvfstring(L, fmt, argp);
  426. va_end(argp);
  427. lua_unlock(L);
  428. return ret;
  429. }
  430. LUA_API void lua_pushcclosure (lua_State *L, lua_CFunction fn, int n) {
  431. lua_lock(L);
  432. if (n == 0) {
  433. setfvalue(L->top, fn);
  434. }
  435. else {
  436. Closure *cl;
  437. api_checknelems(L, n);
  438. api_check(L, n <= MAXUPVAL, "upvalue index too large");
  439. luaC_checkGC(L);
  440. cl = luaF_newCclosure(L, n);
  441. cl->c.f = fn;
  442. L->top -= n;
  443. while (n--)
  444. setobj2n(L, &cl->c.upvalue[n], L->top + n);
  445. setclvalue(L, L->top, cl);
  446. }
  447. api_incr_top(L);
  448. lua_unlock(L);
  449. }
  450. LUA_API void lua_pushboolean (lua_State *L, int b) {
  451. lua_lock(L);
  452. setbvalue(L->top, (b != 0)); /* ensure that true is 1 */
  453. api_incr_top(L);
  454. lua_unlock(L);
  455. }
  456. LUA_API void lua_pushlightuserdata (lua_State *L, void *p) {
  457. lua_lock(L);
  458. setpvalue(L->top, p);
  459. api_incr_top(L);
  460. lua_unlock(L);
  461. }
  462. LUA_API int lua_pushthread (lua_State *L) {
  463. lua_lock(L);
  464. setthvalue(L, L->top, L);
  465. api_incr_top(L);
  466. lua_unlock(L);
  467. return (G(L)->mainthread == L);
  468. }
  469. /*
  470. ** get functions (Lua -> stack)
  471. */
  472. LUA_API void lua_gettable (lua_State *L, int idx) {
  473. StkId t;
  474. lua_lock(L);
  475. t = index2addr(L, idx);
  476. api_checkvalidindex(L, t);
  477. luaV_gettable(L, t, L->top - 1, L->top - 1);
  478. lua_unlock(L);
  479. }
  480. LUA_API void lua_getfield (lua_State *L, int idx, const char *k) {
  481. StkId t;
  482. lua_lock(L);
  483. t = index2addr(L, idx);
  484. api_checkvalidindex(L, t);
  485. setsvalue2s(L, L->top, luaS_new(L, k));
  486. api_incr_top(L);
  487. luaV_gettable(L, t, L->top - 1, L->top - 1);
  488. lua_unlock(L);
  489. }
  490. LUA_API void lua_rawget (lua_State *L, int idx) {
  491. StkId t;
  492. lua_lock(L);
  493. t = index2addr(L, idx);
  494. api_check(L, ttistable(t), "table expected");
  495. setobj2s(L, L->top - 1, luaH_get(hvalue(t), L->top - 1));
  496. lua_unlock(L);
  497. }
  498. LUA_API void lua_rawgeti (lua_State *L, int idx, int n) {
  499. StkId o;
  500. lua_lock(L);
  501. o = index2addr(L, idx);
  502. api_check(L, ttistable(o), "table expected");
  503. setobj2s(L, L->top, luaH_getint(hvalue(o), n));
  504. api_incr_top(L);
  505. lua_unlock(L);
  506. }
  507. LUA_API void lua_createtable (lua_State *L, int narray, int nrec) {
  508. Table *t;
  509. lua_lock(L);
  510. luaC_checkGC(L);
  511. t = luaH_new(L);
  512. sethvalue(L, L->top, t);
  513. api_incr_top(L);
  514. if (narray > 0 || nrec > 0)
  515. luaH_resize(L, t, narray, nrec);
  516. lua_unlock(L);
  517. }
  518. LUA_API int lua_getmetatable (lua_State *L, int objindex) {
  519. const TValue *obj;
  520. Table *mt = NULL;
  521. int res;
  522. lua_lock(L);
  523. obj = index2addr(L, objindex);
  524. switch (ttype(obj)) {
  525. case LUA_TTABLE:
  526. mt = hvalue(obj)->metatable;
  527. break;
  528. case LUA_TUSERDATA:
  529. mt = uvalue(obj)->metatable;
  530. break;
  531. default:
  532. mt = G(L)->mt[ttypenv(obj)];
  533. break;
  534. }
  535. if (mt == NULL)
  536. res = 0;
  537. else {
  538. sethvalue(L, L->top, mt);
  539. api_incr_top(L);
  540. res = 1;
  541. }
  542. lua_unlock(L);
  543. return res;
  544. }
  545. LUA_API void lua_getuservalue (lua_State *L, int idx) {
  546. StkId o;
  547. lua_lock(L);
  548. o = index2addr(L, idx);
  549. api_checkvalidindex(L, o);
  550. api_check(L, ttisuserdata(o), "userdata expected");
  551. if (uvalue(o)->env) {
  552. sethvalue(L, L->top, uvalue(o)->env);
  553. } else
  554. setnilvalue(L->top);
  555. api_incr_top(L);
  556. lua_unlock(L);
  557. }
  558. /*
  559. ** set functions (stack -> Lua)
  560. */
  561. LUA_API void lua_settable (lua_State *L, int idx) {
  562. StkId t;
  563. lua_lock(L);
  564. api_checknelems(L, 2);
  565. t = index2addr(L, idx);
  566. api_checkvalidindex(L, t);
  567. luaV_settable(L, t, L->top - 2, L->top - 1);
  568. L->top -= 2; /* pop index and value */
  569. lua_unlock(L);
  570. }
  571. LUA_API void lua_setfield (lua_State *L, int idx, const char *k) {
  572. StkId t;
  573. lua_lock(L);
  574. api_checknelems(L, 1);
  575. t = index2addr(L, idx);
  576. api_checkvalidindex(L, t);
  577. setsvalue2s(L, L->top++, luaS_new(L, k));
  578. luaV_settable(L, t, L->top - 1, L->top - 2);
  579. L->top -= 2; /* pop value and key */
  580. lua_unlock(L);
  581. }
  582. LUA_API void lua_rawset (lua_State *L, int idx) {
  583. StkId t;
  584. lua_lock(L);
  585. api_checknelems(L, 2);
  586. t = index2addr(L, idx);
  587. api_check(L, ttistable(t), "table expected");
  588. setobj2t(L, luaH_set(L, hvalue(t), L->top-2), L->top-1);
  589. luaC_barrierback(L, gcvalue(t), L->top-1);
  590. L->top -= 2;
  591. lua_unlock(L);
  592. }
  593. LUA_API void lua_rawseti (lua_State *L, int idx, int n) {
  594. StkId o;
  595. lua_lock(L);
  596. api_checknelems(L, 1);
  597. o = index2addr(L, idx);
  598. api_check(L, ttistable(o), "table expected");
  599. setobj2t(L, luaH_setint(L, hvalue(o), n), L->top-1);
  600. luaC_barrierback(L, gcvalue(o), L->top-1);
  601. L->top--;
  602. lua_unlock(L);
  603. }
  604. LUA_API int lua_setmetatable (lua_State *L, int objindex) {
  605. TValue *obj;
  606. Table *mt;
  607. lua_lock(L);
  608. api_checknelems(L, 1);
  609. obj = index2addr(L, objindex);
  610. api_checkvalidindex(L, obj);
  611. if (ttisnil(L->top - 1))
  612. mt = NULL;
  613. else {
  614. api_check(L, ttistable(L->top - 1), "table expected");
  615. mt = hvalue(L->top - 1);
  616. }
  617. switch (ttype(obj)) {
  618. case LUA_TTABLE: {
  619. hvalue(obj)->metatable = mt;
  620. if (mt)
  621. luaC_objbarrierback(L, gcvalue(obj), mt);
  622. break;
  623. }
  624. case LUA_TUSERDATA: {
  625. uvalue(obj)->metatable = mt;
  626. if (mt) {
  627. luaC_objbarrier(L, rawuvalue(obj), mt);
  628. luaC_checkfinalizer(L, rawuvalue(obj));
  629. }
  630. break;
  631. }
  632. default: {
  633. G(L)->mt[ttypenv(obj)] = mt;
  634. break;
  635. }
  636. }
  637. L->top--;
  638. lua_unlock(L);
  639. return 1;
  640. }
  641. LUA_API void lua_setuservalue (lua_State *L, int idx) {
  642. StkId o;
  643. lua_lock(L);
  644. api_checknelems(L, 1);
  645. o = index2addr(L, idx);
  646. api_checkvalidindex(L, o);
  647. api_check(L, ttisuserdata(o), "userdata expected");
  648. if (ttisnil(L->top - 1))
  649. uvalue(o)->env = NULL;
  650. else {
  651. api_check(L, ttistable(L->top - 1), "table expected");
  652. uvalue(o)->env = hvalue(L->top - 1);
  653. luaC_objbarrier(L, gcvalue(o), hvalue(L->top - 1));
  654. }
  655. L->top--;
  656. lua_unlock(L);
  657. }
  658. /*
  659. ** `load' and `call' functions (run Lua code)
  660. */
  661. #define checkresults(L,na,nr) \
  662. api_check(L, (nr) == LUA_MULTRET || (L->ci->top - L->top >= (nr) - (na)), \
  663. "results from function overflow current stack size")
  664. LUA_API int lua_getctx (lua_State *L, int *ctx) {
  665. if (L->ci->callstatus & CIST_YIELDED) {
  666. if (ctx) *ctx = L->ci->u.c.ctx;
  667. return L->ci->u.c.status;
  668. }
  669. else return LUA_OK;
  670. }
  671. LUA_API void lua_callk (lua_State *L, int nargs, int nresults, int ctx,
  672. lua_CFunction k) {
  673. StkId func;
  674. lua_lock(L);
  675. api_check(L, k == NULL || !isLua(L->ci),
  676. "cannot use continuations inside hooks");
  677. api_checknelems(L, nargs+1);
  678. api_check(L, L->status == LUA_OK, "cannot do calls on non-normal thread");
  679. checkresults(L, nargs, nresults);
  680. func = L->top - (nargs+1);
  681. if (k != NULL && L->nny == 0) { /* need to prepare continuation? */
  682. L->ci->u.c.k = k; /* save continuation */
  683. L->ci->u.c.ctx = ctx; /* save context */
  684. luaD_call(L, func, nresults, 1); /* do the call */
  685. }
  686. else /* no continuation or no yieldable */
  687. luaD_call(L, func, nresults, 0); /* just do the call */
  688. adjustresults(L, nresults);
  689. lua_unlock(L);
  690. }
  691. /*
  692. ** Execute a protected call.
  693. */
  694. struct CallS { /* data to `f_call' */
  695. StkId func;
  696. int nresults;
  697. };
  698. static void f_call (lua_State *L, void *ud) {
  699. struct CallS *c = cast(struct CallS *, ud);
  700. luaD_call(L, c->func, c->nresults, 0);
  701. }
  702. LUA_API int lua_pcallk (lua_State *L, int nargs, int nresults, int errfunc,
  703. int ctx, lua_CFunction k) {
  704. struct CallS c;
  705. int status;
  706. ptrdiff_t func;
  707. lua_lock(L);
  708. api_check(L, k == NULL || !isLua(L->ci),
  709. "cannot use continuations inside hooks");
  710. api_checknelems(L, nargs+1);
  711. api_check(L, L->status == LUA_OK, "cannot do calls on non-normal thread");
  712. checkresults(L, nargs, nresults);
  713. if (errfunc == 0)
  714. func = 0;
  715. else {
  716. StkId o = index2addr(L, errfunc);
  717. api_checkvalidindex(L, o);
  718. func = savestack(L, o);
  719. }
  720. c.func = L->top - (nargs+1); /* function to be called */
  721. if (k == NULL || L->nny > 0) { /* no continuation or no yieldable? */
  722. c.nresults = nresults; /* do a 'conventional' protected call */
  723. status = luaD_pcall(L, f_call, &c, savestack(L, c.func), func);
  724. }
  725. else { /* prepare continuation (call is already protected by 'resume') */
  726. CallInfo *ci = L->ci;
  727. ci->u.c.k = k; /* save continuation */
  728. ci->u.c.ctx = ctx; /* save context */
  729. /* save information for error recovery */
  730. ci->u.c.extra = savestack(L, c.func);
  731. ci->u.c.old_allowhook = L->allowhook;
  732. ci->u.c.old_errfunc = L->errfunc;
  733. L->errfunc = func;
  734. /* mark that function may do error recovery */
  735. ci->callstatus |= CIST_YPCALL;
  736. luaD_call(L, c.func, nresults, 1); /* do the call */
  737. ci->callstatus &= ~CIST_YPCALL;
  738. L->errfunc = ci->u.c.old_errfunc;
  739. status = LUA_OK; /* if it is here, there were no errors */
  740. }
  741. adjustresults(L, nresults);
  742. lua_unlock(L);
  743. return status;
  744. }
  745. LUA_API int lua_load (lua_State *L, lua_Reader reader, void *data,
  746. const char *chunkname) {
  747. ZIO z;
  748. int status;
  749. lua_lock(L);
  750. if (!chunkname) chunkname = "?";
  751. luaZ_init(L, &z, reader, data);
  752. status = luaD_protectedparser(L, &z, chunkname);
  753. if (status == LUA_OK) { /* no errors? */
  754. Closure *f = clvalue(L->top - 1); /* get newly created function */
  755. lua_assert(!f->c.isC);
  756. if (f->l.nupvalues == 1) { /* does it have one upvalue? */
  757. /* get global table from registry */
  758. Table *reg = hvalue(&G(L)->l_registry);
  759. const TValue *gt = luaH_getint(reg, LUA_RIDX_GLOBALS);
  760. /* set global table as 1st upvalue of 'f' (may be LUA_ENV) */
  761. setobj(L, f->l.upvals[0]->v, gt);
  762. luaC_barrier(L, f->l.upvals[0], gt);
  763. }
  764. }
  765. lua_unlock(L);
  766. return status;
  767. }
  768. LUA_API int lua_dump (lua_State *L, lua_Writer writer, void *data) {
  769. int status;
  770. TValue *o;
  771. lua_lock(L);
  772. api_checknelems(L, 1);
  773. o = L->top - 1;
  774. if (isLfunction(o))
  775. status = luaU_dump(L, getproto(o), writer, data, 0);
  776. else
  777. status = 1;
  778. lua_unlock(L);
  779. return status;
  780. }
  781. LUA_API int lua_status (lua_State *L) {
  782. return L->status;
  783. }
  784. /*
  785. ** Garbage-collection function
  786. */
  787. LUA_API int lua_gc (lua_State *L, int what, int data) {
  788. int res = 0;
  789. global_State *g;
  790. lua_lock(L);
  791. g = G(L);
  792. switch (what) {
  793. case LUA_GCSTOP: {
  794. stopgc(g);
  795. break;
  796. }
  797. case LUA_GCRESTART: {
  798. g->GCdebt = 0;
  799. break;
  800. }
  801. case LUA_GCCOLLECT: {
  802. luaC_fullgc(L, 0);
  803. break;
  804. }
  805. case LUA_GCCOUNT: {
  806. /* GC values are expressed in Kbytes: #bytes/2^10 */
  807. res = cast_int(g->totalbytes >> 10);
  808. break;
  809. }
  810. case LUA_GCCOUNTB: {
  811. res = cast_int(g->totalbytes & 0x3ff);
  812. break;
  813. }
  814. case LUA_GCSTEP: {
  815. int stopped = gcstopped(g);
  816. if (g->gckind == KGC_GEN) { /* generational mode? */
  817. res = (g->lastmajormem == 0); /* 1 if will do major collection */
  818. luaC_step(L); /* do a single step */
  819. }
  820. else {
  821. while (data-- >= 0) {
  822. luaC_step(L);
  823. if (g->gcstate == GCSpause) { /* end of cycle? */
  824. res = 1; /* signal it */
  825. break;
  826. }
  827. }
  828. }
  829. if (stopped) /* collector was stopped? */
  830. stopgc(g); /* keep it that way */
  831. break;
  832. }
  833. case LUA_GCSETPAUSE: {
  834. res = g->gcpause;
  835. g->gcpause = data;
  836. break;
  837. }
  838. case LUA_GCSETMAJORINC: {
  839. res = g->gcmajorinc;
  840. g->gcmajorinc = data;
  841. break;
  842. }
  843. case LUA_GCSETSTEPMUL: {
  844. res = g->gcstepmul;
  845. g->gcstepmul = data;
  846. break;
  847. }
  848. case LUA_GCISRUNNING: {
  849. res = !gcstopped(g);
  850. break;
  851. }
  852. case LUA_GCGEN: { /* change collector to generational mode */
  853. luaC_changemode(L, KGC_GEN);
  854. break;
  855. }
  856. case LUA_GCINC: { /* change collector to incremental mode */
  857. luaC_changemode(L, KGC_NORMAL);
  858. break;
  859. }
  860. default: res = -1; /* invalid option */
  861. }
  862. lua_unlock(L);
  863. return res;
  864. }
  865. /*
  866. ** miscellaneous functions
  867. */
  868. LUA_API int lua_error (lua_State *L) {
  869. lua_lock(L);
  870. api_checknelems(L, 1);
  871. luaG_errormsg(L);
  872. lua_unlock(L);
  873. return 0; /* to avoid warnings */
  874. }
  875. LUA_API int lua_next (lua_State *L, int idx) {
  876. StkId t;
  877. int more;
  878. lua_lock(L);
  879. t = index2addr(L, idx);
  880. api_check(L, ttistable(t), "table expected");
  881. more = luaH_next(L, hvalue(t), L->top - 1);
  882. if (more) {
  883. api_incr_top(L);
  884. }
  885. else /* no more elements */
  886. L->top -= 1; /* remove key */
  887. lua_unlock(L);
  888. return more;
  889. }
  890. LUA_API void lua_concat (lua_State *L, int n) {
  891. lua_lock(L);
  892. api_checknelems(L, n);
  893. if (n >= 2) {
  894. luaC_checkGC(L);
  895. luaV_concat(L, n);
  896. }
  897. else if (n == 0) { /* push empty string */
  898. setsvalue2s(L, L->top, luaS_newlstr(L, "", 0));
  899. api_incr_top(L);
  900. }
  901. /* else n == 1; nothing to do */
  902. lua_unlock(L);
  903. }
  904. LUA_API void lua_len (lua_State *L, int idx) {
  905. StkId t;
  906. lua_lock(L);
  907. t = index2addr(L, idx);
  908. luaV_objlen(L, L->top, t);
  909. api_incr_top(L);
  910. lua_unlock(L);
  911. }
  912. LUA_API lua_Alloc lua_getallocf (lua_State *L, void **ud) {
  913. lua_Alloc f;
  914. lua_lock(L);
  915. if (ud) *ud = G(L)->ud;
  916. f = G(L)->frealloc;
  917. lua_unlock(L);
  918. return f;
  919. }
  920. LUA_API void lua_setallocf (lua_State *L, lua_Alloc f, void *ud) {
  921. lua_lock(L);
  922. G(L)->ud = ud;
  923. G(L)->frealloc = f;
  924. lua_unlock(L);
  925. }
  926. LUA_API void *lua_newuserdata (lua_State *L, size_t size) {
  927. Udata *u;
  928. lua_lock(L);
  929. luaC_checkGC(L);
  930. u = luaS_newudata(L, size, NULL);
  931. setuvalue(L, L->top, u);
  932. api_incr_top(L);
  933. lua_unlock(L);
  934. return u + 1;
  935. }
  936. static const char *aux_upvalue (StkId fi, int n, TValue **val,
  937. GCObject **owner) {
  938. Closure *f;
  939. if (!ttisclosure(fi)) return NULL;
  940. f = clvalue(fi);
  941. if (f->c.isC) {
  942. if (!(1 <= n && n <= f->c.nupvalues)) return NULL;
  943. *val = &f->c.upvalue[n-1];
  944. if (owner) *owner = obj2gco(f);
  945. return "";
  946. }
  947. else {
  948. const char *name;
  949. Proto *p = f->l.p;
  950. if (!(1 <= n && n <= p->sizeupvalues)) return NULL;
  951. *val = f->l.upvals[n-1]->v;
  952. if (owner) *owner = obj2gco(f->l.upvals[n - 1]);
  953. name = getstr(p->upvalues[n-1].name);
  954. if (name == NULL) /* no debug information? */
  955. name = "";
  956. return name;
  957. }
  958. }
  959. LUA_API const char *lua_getupvalue (lua_State *L, int funcindex, int n) {
  960. const char *name;
  961. TValue *val;
  962. lua_lock(L);
  963. name = aux_upvalue(index2addr(L, funcindex), n, &val, NULL);
  964. if (name) {
  965. setobj2s(L, L->top, val);
  966. api_incr_top(L);
  967. }
  968. lua_unlock(L);
  969. return name;
  970. }
  971. LUA_API const char *lua_setupvalue (lua_State *L, int funcindex, int n) {
  972. const char *name;
  973. TValue *val;
  974. GCObject *owner;
  975. StkId fi;
  976. lua_lock(L);
  977. fi = index2addr(L, funcindex);
  978. api_checknelems(L, 1);
  979. name = aux_upvalue(fi, n, &val, &owner);
  980. if (name) {
  981. L->top--;
  982. setobj(L, val, L->top);
  983. luaC_barrier(L, owner, L->top);
  984. }
  985. lua_unlock(L);
  986. return name;
  987. }
  988. static UpVal **getupvalref (lua_State *L, int fidx, int n, Closure **pf) {
  989. Closure *f;
  990. StkId fi = index2addr(L, fidx);
  991. api_check(L, ttisclosure(fi), "Lua function expected");
  992. f = clvalue(fi);
  993. api_check(L, !f->c.isC, "Lua function expected");
  994. api_check(L, (1 <= n && n <= f->l.p->sizeupvalues), "invalid upvalue index");
  995. if (pf) *pf = f;
  996. return &f->l.upvals[n - 1]; /* get its upvalue pointer */
  997. }
  998. LUA_API void *lua_upvalueid (lua_State *L, int fidx, int n) {
  999. Closure *f;
  1000. StkId fi = index2addr(L, fidx);
  1001. api_check(L, ttisclosure(fi), "function expected");
  1002. f = clvalue(fi);
  1003. if (f->c.isC) {
  1004. api_check(L, 1 <= n && n <= f->c.nupvalues, "invalid upvalue index");
  1005. return &f->c.upvalue[n - 1];
  1006. }
  1007. else return *getupvalref(L, fidx, n, NULL);
  1008. }
  1009. LUA_API void lua_upvaluejoin (lua_State *L, int fidx1, int n1,
  1010. int fidx2, int n2) {
  1011. Closure *f1;
  1012. UpVal **up1 = getupvalref(L, fidx1, n1, &f1);
  1013. UpVal **up2 = getupvalref(L, fidx2, n2, NULL);
  1014. *up1 = *up2;
  1015. luaC_objbarrier(L, f1, *up2);
  1016. }