lapi.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698
  1. /*
  2. ** $Id: lapi.c,v 1.180 2002/03/26 20:46:10 roberto Exp roberto $
  3. ** Lua API
  4. ** See Copyright Notice in lua.h
  5. */
  6. #include <string.h>
  7. #include "lua.h"
  8. #include "lapi.h"
  9. #include "ldo.h"
  10. #include "lfunc.h"
  11. #include "lgc.h"
  12. #include "lmem.h"
  13. #include "lobject.h"
  14. #include "lstate.h"
  15. #include "lstring.h"
  16. #include "ltable.h"
  17. #include "ltm.h"
  18. #include "lvm.h"
  19. const char lua_ident[] =
  20. "$Lua: " LUA_VERSION " " LUA_COPYRIGHT " $\n"
  21. "$Authors: " LUA_AUTHORS " $\n"
  22. "$URL: www.lua.org $\n";
  23. #ifndef api_check
  24. #define api_check(L, o) ((void)1)
  25. #endif
  26. #define api_checknelems(L, n) api_check(L, (n) <= (L->top - L->ci->base))
  27. #define api_incr_top(L) (api_check(L, L->top<L->ci->top), L->top++)
  28. static TObject *negindex (lua_State *L, int index) {
  29. if (index > LUA_REGISTRYINDEX) {
  30. api_check(L, index != 0 && -index <= L->top - L->ci->base);
  31. return L->top+index;
  32. }
  33. else switch (index) { /* pseudo-indices */
  34. case LUA_REGISTRYINDEX: return registry(L);
  35. case LUA_GLOBALSINDEX: return gt(L);
  36. default: {
  37. TObject *func = (L->ci->base - 1);
  38. index = LUA_GLOBALSINDEX - index;
  39. api_check(L, iscfunction(func) && index <= clvalue(func)->c.nupvalues);
  40. return &clvalue(func)->c.upvalue[index-1];
  41. }
  42. }
  43. }
  44. #define luaA_index(L, index) \
  45. ( (index > 0) ? \
  46. (api_check(L, index <= L->top - L->ci->base), L->ci->base+index-1) : \
  47. negindex(L, index))
  48. static TObject *luaA_indexAcceptable (lua_State *L, int index) {
  49. if (index > 0) {
  50. TObject *o = L->ci->base+(index-1);
  51. api_check(L, index <= L->stack_last - L->ci->base);
  52. if (o >= L->top) return NULL;
  53. else return o;
  54. }
  55. else
  56. return negindex(L, index);
  57. }
  58. void luaA_pushobject (lua_State *L, const TObject *o) {
  59. setobj(L->top, o);
  60. incr_top(L);
  61. }
  62. LUA_API int lua_checkstack (lua_State *L, int size) {
  63. int res;
  64. lua_lock(L);
  65. if ((L->top - L->ci->base + size) > LUA_MAXCSTACK)
  66. res = 0; /* stack overflow */
  67. else {
  68. luaD_checkstack(L, size);
  69. if (L->ci->top < L->top + size)
  70. L->ci->top = L->top + size;
  71. res = 1;
  72. }
  73. lua_unlock(L);
  74. return res;
  75. }
  76. /*
  77. ** basic stack manipulation
  78. */
  79. LUA_API int lua_gettop (lua_State *L) {
  80. return (L->top - L->ci->base);
  81. }
  82. LUA_API void lua_settop (lua_State *L, int index) {
  83. lua_lock(L);
  84. if (index >= 0) {
  85. api_check(L, index <= L->stack_last - L->ci->base);
  86. while (L->top < L->ci->base + index)
  87. setnilvalue(L->top++);
  88. L->top = L->ci->base + index;
  89. }
  90. else {
  91. api_check(L, -(index+1) <= (L->top - L->ci->base));
  92. L->top += index+1; /* `subtract' index (index is negative) */
  93. }
  94. lua_unlock(L);
  95. }
  96. LUA_API void lua_remove (lua_State *L, int index) {
  97. StkId p;
  98. lua_lock(L);
  99. p = luaA_index(L, index);
  100. while (++p < L->top) setobj(p-1, p);
  101. L->top--;
  102. lua_unlock(L);
  103. }
  104. LUA_API void lua_insert (lua_State *L, int index) {
  105. StkId p;
  106. StkId q;
  107. lua_lock(L);
  108. p = luaA_index(L, index);
  109. for (q = L->top; q>p; q--) setobj(q, q-1);
  110. setobj(p, L->top);
  111. lua_unlock(L);
  112. }
  113. LUA_API void lua_replace (lua_State *L, int index) {
  114. lua_lock(L);
  115. api_checknelems(L, 1);
  116. setobj(luaA_index(L, index), L->top - 1);
  117. L->top--;
  118. lua_unlock(L);
  119. }
  120. LUA_API void lua_pushvalue (lua_State *L, int index) {
  121. lua_lock(L);
  122. setobj(L->top, luaA_index(L, index));
  123. api_incr_top(L);
  124. lua_unlock(L);
  125. }
  126. /*
  127. ** access functions (stack -> C)
  128. */
  129. LUA_API int lua_type (lua_State *L, int index) {
  130. StkId o = luaA_indexAcceptable(L, index);
  131. return (o == NULL) ? LUA_TNONE : ttype(o);
  132. }
  133. LUA_API const char *lua_typename (lua_State *L, int t) {
  134. UNUSED(L);
  135. return (t == LUA_TNONE) ? "no value" : luaT_typenames[t];
  136. }
  137. LUA_API int lua_iscfunction (lua_State *L, int index) {
  138. StkId o = luaA_indexAcceptable(L, index);
  139. return (o == NULL) ? 0 : iscfunction(o);
  140. }
  141. LUA_API int lua_isnumber (lua_State *L, int index) {
  142. TObject n;
  143. const TObject *o = luaA_indexAcceptable(L, index);
  144. return (o != NULL && tonumber(o, &n));
  145. }
  146. LUA_API int lua_isstring (lua_State *L, int index) {
  147. int t = lua_type(L, index);
  148. return (t == LUA_TSTRING || t == LUA_TNUMBER);
  149. }
  150. LUA_API int lua_equal (lua_State *L, int index1, int index2) {
  151. StkId o1 = luaA_indexAcceptable(L, index1);
  152. StkId o2 = luaA_indexAcceptable(L, index2);
  153. return (o1 == NULL || o2 == NULL) ? 0 /* index out of range */
  154. : luaO_equalObj(o1, o2);
  155. }
  156. LUA_API int lua_lessthan (lua_State *L, int index1, int index2) {
  157. StkId o1, o2;
  158. int i;
  159. lua_lock(L); /* may call tag method */
  160. o1 = luaA_indexAcceptable(L, index1);
  161. o2 = luaA_indexAcceptable(L, index2);
  162. i = (o1 == NULL || o2 == NULL) ? 0 /* index out-of-range */
  163. : luaV_lessthan(L, o1, o2);
  164. lua_unlock(L);
  165. return i;
  166. }
  167. LUA_API lua_Number lua_tonumber (lua_State *L, int index) {
  168. TObject n;
  169. const TObject *o = luaA_indexAcceptable(L, index);
  170. if (o != NULL && tonumber(o, &n))
  171. return nvalue(o);
  172. else
  173. return 0;
  174. }
  175. LUA_API int lua_toboolean (lua_State *L, int index) {
  176. const TObject *o = luaA_indexAcceptable(L, index);
  177. return (o != NULL) && !l_isfalse(o);
  178. }
  179. LUA_API const char *lua_tostring (lua_State *L, int index) {
  180. StkId o = luaA_indexAcceptable(L, index);
  181. if (o == NULL)
  182. return NULL;
  183. else if (ttype(o) == LUA_TSTRING)
  184. return svalue(o);
  185. else {
  186. const char *s;
  187. lua_lock(L); /* `luaV_tostring' may create a new string */
  188. s = (luaV_tostring(L, o) ? svalue(o) : NULL);
  189. lua_unlock(L);
  190. return s;
  191. }
  192. }
  193. LUA_API size_t lua_strlen (lua_State *L, int index) {
  194. StkId o = luaA_indexAcceptable(L, index);
  195. if (o == NULL)
  196. return 0;
  197. else if (ttype(o) == LUA_TSTRING)
  198. return tsvalue(o)->tsv.len;
  199. else {
  200. size_t l;
  201. lua_lock(L); /* `luaV_tostring' may create a new string */
  202. l = (luaV_tostring(L, o) ? tsvalue(o)->tsv.len : 0);
  203. lua_unlock(L);
  204. return l;
  205. }
  206. }
  207. LUA_API lua_CFunction lua_tocfunction (lua_State *L, int index) {
  208. StkId o = luaA_indexAcceptable(L, index);
  209. return (o == NULL || !iscfunction(o)) ? NULL : clvalue(o)->c.f;
  210. }
  211. LUA_API void *lua_touserdata (lua_State *L, int index) {
  212. StkId o = luaA_indexAcceptable(L, index);
  213. return (o == NULL || ttype(o) != LUA_TUSERDATA) ? NULL : uvalue(o)->uv.value;
  214. }
  215. LUA_API const void *lua_topointer (lua_State *L, int index) {
  216. StkId o = luaA_indexAcceptable(L, index);
  217. if (o == NULL) return NULL;
  218. else {
  219. switch (ttype(o)) {
  220. case LUA_TTABLE: return hvalue(o);
  221. case LUA_TFUNCTION: return clvalue(o);
  222. default: return NULL;
  223. }
  224. }
  225. }
  226. /*
  227. ** push functions (C -> stack)
  228. */
  229. LUA_API void lua_pushnil (lua_State *L) {
  230. lua_lock(L);
  231. setnilvalue(L->top);
  232. api_incr_top(L);
  233. lua_unlock(L);
  234. }
  235. LUA_API void lua_pushnumber (lua_State *L, lua_Number n) {
  236. lua_lock(L);
  237. setnvalue(L->top, n);
  238. api_incr_top(L);
  239. lua_unlock(L);
  240. }
  241. LUA_API void lua_pushlstring (lua_State *L, const char *s, size_t len) {
  242. lua_lock(L);
  243. setsvalue(L->top, luaS_newlstr(L, s, len));
  244. api_incr_top(L);
  245. lua_unlock(L);
  246. }
  247. LUA_API void lua_pushstring (lua_State *L, const char *s) {
  248. if (s == NULL)
  249. lua_pushnil(L);
  250. else
  251. lua_pushlstring(L, s, strlen(s));
  252. }
  253. LUA_API void lua_pushcclosure (lua_State *L, lua_CFunction fn, int n) {
  254. Closure *cl;
  255. lua_lock(L);
  256. api_checknelems(L, n);
  257. cl = luaF_newCclosure(L, n);
  258. cl->c.f = fn;
  259. L->top -= n;
  260. while (n--)
  261. setobj(&cl->c.upvalue[n], L->top+n);
  262. setclvalue(L->top, cl);
  263. api_incr_top(L);
  264. lua_unlock(L);
  265. }
  266. LUA_API void lua_pushboolean (lua_State *L, int b) {
  267. lua_lock(L);
  268. setbvalue(L->top, (b != 0)); /* ensure that true is 1 */
  269. api_incr_top(L);
  270. lua_unlock(L);
  271. }
  272. /*
  273. ** get functions (Lua -> stack)
  274. */
  275. LUA_API void lua_gettable (lua_State *L, int index) {
  276. StkId t;
  277. lua_lock(L);
  278. t = luaA_index(L, index);
  279. luaV_gettable(L, t, L->top-1, L->top-1);
  280. lua_unlock(L);
  281. }
  282. LUA_API void lua_rawget (lua_State *L, int index) {
  283. StkId t;
  284. lua_lock(L);
  285. t = luaA_index(L, index);
  286. api_check(L, ttype(t) == LUA_TTABLE);
  287. setobj(L->top - 1, luaH_get(hvalue(t), L->top - 1));
  288. lua_unlock(L);
  289. }
  290. LUA_API void lua_rawgeti (lua_State *L, int index, int n) {
  291. StkId o;
  292. lua_lock(L);
  293. o = luaA_index(L, index);
  294. api_check(L, ttype(o) == LUA_TTABLE);
  295. setobj(L->top, luaH_getnum(hvalue(o), n));
  296. api_incr_top(L);
  297. lua_unlock(L);
  298. }
  299. LUA_API void lua_newtable (lua_State *L) {
  300. lua_lock(L);
  301. sethvalue(L->top, luaH_new(L, 0, 0));
  302. api_incr_top(L);
  303. lua_unlock(L);
  304. }
  305. LUA_API int lua_getmetatable (lua_State *L, int objindex) {
  306. StkId obj;
  307. Table *mt;
  308. int res;
  309. lua_lock(L);
  310. obj = luaA_indexAcceptable(L, objindex);
  311. switch (ttype(obj)) {
  312. case LUA_TTABLE:
  313. mt = hvalue(obj)->metatable;
  314. break;
  315. case LUA_TUSERDATA:
  316. mt = uvalue(obj)->uv.metatable;
  317. break;
  318. default:
  319. mt = hvalue(defaultmeta(L));
  320. }
  321. if (mt == hvalue(defaultmeta(L))) {
  322. setnilvalue(L->top);
  323. res = 0;
  324. }
  325. else {
  326. sethvalue(L->top, mt);
  327. res = 1;
  328. }
  329. api_incr_top(L);
  330. lua_unlock(L);
  331. return res;
  332. }
  333. /*
  334. ** set functions (stack -> Lua)
  335. */
  336. LUA_API void lua_settable (lua_State *L, int index) {
  337. StkId t;
  338. lua_lock(L);
  339. api_checknelems(L, 2);
  340. t = luaA_index(L, index);
  341. luaV_settable(L, t, L->top - 2, L->top - 1);
  342. L->top -= 2; /* pop index and value */
  343. lua_unlock(L);
  344. }
  345. LUA_API void lua_rawset (lua_State *L, int index) {
  346. StkId t;
  347. lua_lock(L);
  348. api_checknelems(L, 2);
  349. t = luaA_index(L, index);
  350. api_check(L, ttype(t) == LUA_TTABLE);
  351. luaH_set(L, hvalue(t), L->top-2, L->top-1);
  352. L->top -= 2;
  353. lua_unlock(L);
  354. }
  355. LUA_API void lua_rawseti (lua_State *L, int index, int n) {
  356. StkId o;
  357. lua_lock(L);
  358. api_checknelems(L, 1);
  359. o = luaA_index(L, index);
  360. api_check(L, ttype(o) == LUA_TTABLE);
  361. luaH_setnum(L, hvalue(o), n, L->top-1);
  362. L->top--;
  363. lua_unlock(L);
  364. }
  365. LUA_API void lua_setmetatable (lua_State *L, int objindex) {
  366. StkId obj, mt;
  367. lua_lock(L);
  368. api_checknelems(L, 1);
  369. obj = luaA_indexAcceptable(L, objindex);
  370. mt = --L->top;
  371. if (ttype(mt) == LUA_TNIL)
  372. mt = defaultmeta(L);
  373. api_check(L, ttype(mt) == LUA_TTABLE);
  374. switch (ttype(obj)) {
  375. case LUA_TTABLE:
  376. hvalue(obj)->metatable = hvalue(mt);
  377. break;
  378. case LUA_TUSERDATA:
  379. uvalue(obj)->uv.metatable = hvalue(mt);
  380. break;
  381. default:
  382. luaO_verror(L, "cannot change the meta table of a %.20s",
  383. luaT_typenames[ttype(obj)]);
  384. }
  385. lua_unlock(L);
  386. }
  387. /*
  388. ** `do' functions (run Lua code)
  389. */
  390. LUA_API void lua_rawcall (lua_State *L, int nargs, int nresults) {
  391. StkId func;
  392. lua_lock(L);
  393. api_checknelems(L, nargs+1);
  394. func = L->top - (nargs+1);
  395. luaD_call(L, func, nresults);
  396. lua_unlock(L);
  397. }
  398. LUA_API int lua_dofile (lua_State *L, const char *filename) {
  399. int status;
  400. status = lua_loadfile(L, filename);
  401. if (status == 0) /* parse OK? */
  402. status = lua_call(L, 0, LUA_MULTRET); /* call main */
  403. return status;
  404. }
  405. LUA_API int lua_dobuffer (lua_State *L, const char *buff, size_t size,
  406. const char *name) {
  407. int status;
  408. status = lua_loadbuffer(L, buff, size, name);
  409. if (status == 0) /* parse OK? */
  410. status = lua_call(L, 0, LUA_MULTRET); /* call main */
  411. return status;
  412. }
  413. LUA_API int lua_dostring (lua_State *L, const char *str) {
  414. return lua_dobuffer(L, str, strlen(str), str);
  415. }
  416. /*
  417. ** Garbage-collection functions
  418. */
  419. /* GC values are expressed in Kbytes: #bytes/2^10 */
  420. #define GCscale(x) (cast(int, (x)>>10))
  421. #define GCunscale(x) (cast(lu_mem, (x)<<10))
  422. LUA_API int lua_getgcthreshold (lua_State *L) {
  423. int threshold;
  424. lua_lock(L);
  425. threshold = GCscale(G(L)->GCthreshold);
  426. lua_unlock(L);
  427. return threshold;
  428. }
  429. LUA_API int lua_getgccount (lua_State *L) {
  430. int count;
  431. lua_lock(L);
  432. count = GCscale(G(L)->nblocks);
  433. lua_unlock(L);
  434. return count;
  435. }
  436. LUA_API void lua_setgcthreshold (lua_State *L, int newthreshold) {
  437. lua_lock(L);
  438. if (newthreshold > GCscale(ULONG_MAX))
  439. G(L)->GCthreshold = ULONG_MAX;
  440. else
  441. G(L)->GCthreshold = GCunscale(newthreshold);
  442. luaC_checkGC(L);
  443. lua_unlock(L);
  444. }
  445. /*
  446. ** miscellaneous functions
  447. */
  448. LUA_API void lua_error (lua_State *L, const char *s) {
  449. lua_lock(L);
  450. luaD_error(L, s);
  451. lua_unlock(L);
  452. }
  453. LUA_API int lua_next (lua_State *L, int index) {
  454. StkId t;
  455. int more;
  456. lua_lock(L);
  457. t = luaA_index(L, index);
  458. api_check(L, ttype(t) == LUA_TTABLE);
  459. more = luaH_next(L, hvalue(t), L->top - 1);
  460. if (more) {
  461. api_incr_top(L);
  462. }
  463. else /* no more elements */
  464. L->top -= 1; /* remove key */
  465. lua_unlock(L);
  466. return more;
  467. }
  468. LUA_API int lua_getn (lua_State *L, int index) {
  469. StkId t;
  470. const TObject *value;
  471. int n;
  472. lua_lock(L);
  473. t = luaA_index(L, index);
  474. api_check(L, ttype(t) == LUA_TTABLE);
  475. value = luaH_getstr(hvalue(t), luaS_newliteral(L, "n")); /* = t.n */
  476. if (ttype(value) == LUA_TNUMBER)
  477. lua_number2int(n, nvalue(value));
  478. else {
  479. Node *nd;
  480. Table *a = hvalue(t);
  481. lua_Number max = 0;
  482. int i;
  483. i = sizearray(a);
  484. while (i--) {
  485. if (ttype(&a->array[i]) != LUA_TNIL)
  486. break;
  487. }
  488. max = i+1;
  489. i = sizenode(a);
  490. nd = a->node;
  491. while (i--) {
  492. if (ttype(key(nd)) == LUA_TNUMBER &&
  493. ttype(val(nd)) != LUA_TNIL &&
  494. nvalue(key(nd)) > max)
  495. max = nvalue(key(nd));
  496. nd++;
  497. }
  498. lua_number2int(n, max);
  499. }
  500. lua_unlock(L);
  501. return n;
  502. }
  503. LUA_API void lua_concat (lua_State *L, int n) {
  504. lua_lock(L);
  505. api_checknelems(L, n);
  506. if (n >= 2) {
  507. luaV_strconc(L, n, L->top - L->ci->base - 1);
  508. L->top -= (n-1);
  509. luaC_checkGC(L);
  510. }
  511. else if (n == 0) { /* push null string */
  512. setsvalue(L->top, luaS_newlstr(L, NULL, 0));
  513. api_incr_top(L);
  514. }
  515. /* else n == 1; nothing to do */
  516. lua_unlock(L);
  517. }
  518. static Udata *pushnewudata (lua_State *L, size_t size) {
  519. Udata *u = luaS_newudata(L, size);
  520. setuvalue(L->top, u);
  521. api_incr_top(L);
  522. return uvalue(L->top-1);
  523. }
  524. LUA_API void *lua_newuserdata (lua_State *L, size_t size) {
  525. Udata *u;
  526. void *p;
  527. lua_lock(L);
  528. u = pushnewudata(L, size);
  529. p = u->uv.value;
  530. lua_unlock(L);
  531. return p;
  532. }
  533. LUA_API void lua_newuserdatabox (lua_State *L, void *p) {
  534. Udata *u;
  535. lua_lock(L);
  536. u = pushnewudata(L, 0);
  537. u->uv.value = p;
  538. lua_unlock(L);
  539. }
  540. LUA_API int lua_pushupvalues (lua_State *L) {
  541. TObject *func;
  542. int n, i;
  543. lua_lock(L);
  544. func = (L->ci->base - 1);
  545. api_check(L, iscfunction(func));
  546. n = clvalue(func)->c.nupvalues;
  547. luaD_checkstack(L, n + LUA_MINSTACK);
  548. for (i=0; i<n; i++) {
  549. setobj(L->top, &clvalue(func)->c.upvalue[i]);
  550. L->top++;
  551. }
  552. lua_unlock(L);
  553. return n;
  554. }