9
3

lapi.c 31 KB

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