lapi.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693
  1. /*
  2. ** $Id: lapi.c,v 1.1 2001/11/29 22:14:34 rieru Exp rieru $
  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) /* nothing */
  25. #endif
  26. #define api_checknelems(L, n) api_check(L, (n) <= (L->top - L->ci->base))
  27. #define api_incr_top(L) incr_top(L)
  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. TObject *luaA_index (lua_State *L, int index) {
  45. if (index > 0) {
  46. api_check(L, index <= L->top - L->ci->base);
  47. return L->ci->base+index-1;
  48. }
  49. else
  50. return negindex(L, index);
  51. }
  52. static TObject *luaA_indexAcceptable (lua_State *L, int index) {
  53. if (index > 0) {
  54. TObject *o = L->ci->base+(index-1);
  55. api_check(L, index <= L->stack_last - L->ci->base);
  56. if (o >= L->top) return NULL;
  57. else return o;
  58. }
  59. else
  60. return negindex(L, index);
  61. }
  62. void luaA_pushobject (lua_State *L, const TObject *o) {
  63. setobj(L->top, o);
  64. incr_top(L);
  65. }
  66. LUA_API int lua_stackspace (lua_State *L) {
  67. return (L->stack_last - L->top);
  68. }
  69. /*
  70. ** basic stack manipulation
  71. */
  72. LUA_API int lua_gettop (lua_State *L) {
  73. return (L->top - L->ci->base);
  74. }
  75. LUA_API void lua_settop (lua_State *L, int index) {
  76. lua_lock(L);
  77. if (index >= 0) {
  78. api_check(L, index <= L->stack_last - L->ci->base);
  79. while (L->top < L->ci->base + index)
  80. setnilvalue(L->top++);
  81. L->top = L->ci->base + index;
  82. }
  83. else {
  84. api_check(L, -(index+1) <= (L->top - L->ci->base));
  85. L->top += index+1; /* `subtract' index (index is negative) */
  86. }
  87. lua_unlock(L);
  88. }
  89. LUA_API void lua_remove (lua_State *L, int index) {
  90. StkId p;
  91. lua_lock(L);
  92. p = luaA_index(L, index);
  93. while (++p < L->top) setobj(p-1, p);
  94. L->top--;
  95. lua_unlock(L);
  96. }
  97. LUA_API void lua_insert (lua_State *L, int index) {
  98. StkId p;
  99. StkId q;
  100. lua_lock(L);
  101. p = luaA_index(L, index);
  102. for (q = L->top; q>p; q--) setobj(q, q-1);
  103. setobj(p, L->top);
  104. lua_unlock(L);
  105. }
  106. LUA_API void lua_replace (lua_State *L, int index) {
  107. lua_lock(L);
  108. api_checknelems(L, 1);
  109. setobj(luaA_index(L, index), L->top - 1);
  110. L->top--;
  111. lua_unlock(L);
  112. }
  113. LUA_API void lua_pushvalue (lua_State *L, int index) {
  114. lua_lock(L);
  115. setobj(L->top, luaA_index(L, index));
  116. api_incr_top(L);
  117. lua_unlock(L);
  118. }
  119. /*
  120. ** access functions (stack -> C)
  121. */
  122. LUA_API int lua_type (lua_State *L, int index) {
  123. StkId o = luaA_indexAcceptable(L, index);
  124. return (o == NULL) ? LUA_TNONE : ttype(o);
  125. }
  126. LUA_API const char *lua_typename (lua_State *L, int t) {
  127. UNUSED(L);
  128. return (t == LUA_TNONE) ? "no value" : luaT_typenames[t];
  129. }
  130. LUA_API int lua_iscfunction (lua_State *L, int index) {
  131. StkId o = luaA_indexAcceptable(L, index);
  132. return (o == NULL) ? 0 : iscfunction(o);
  133. }
  134. LUA_API int lua_isnumber (lua_State *L, int index) {
  135. TObject n;
  136. const TObject *o = luaA_indexAcceptable(L, index);
  137. return (o != NULL && tonumber(o, &n));
  138. }
  139. LUA_API int lua_istrue (lua_State *L, int index) {
  140. TObject *o = luaA_indexAcceptable(L, index);
  141. return (o != NULL && !l_isfalse(o));
  142. }
  143. LUA_API int lua_isstring (lua_State *L, int index) {
  144. int t = lua_type(L, index);
  145. return (t == LUA_TSTRING || t == LUA_TNUMBER);
  146. }
  147. LUA_API int lua_equal (lua_State *L, int index1, int index2) {
  148. StkId o1 = luaA_indexAcceptable(L, index1);
  149. StkId o2 = luaA_indexAcceptable(L, index2);
  150. return (o1 == NULL || o2 == NULL) ? 0 /* index out of range */
  151. : luaO_equalObj(o1, o2);
  152. }
  153. LUA_API int lua_lessthan (lua_State *L, int index1, int index2) {
  154. StkId o1, o2;
  155. int i;
  156. lua_lock(L); /* may call tag method */
  157. o1 = luaA_indexAcceptable(L, index1);
  158. o2 = luaA_indexAcceptable(L, index2);
  159. i = (o1 == NULL || o2 == NULL) ? 0 /* index out-of-range */
  160. : luaV_lessthan(L, o1, o2);
  161. lua_unlock(L);
  162. return i;
  163. }
  164. LUA_API lua_Number lua_tonumber (lua_State *L, int index) {
  165. TObject n;
  166. const TObject *o = luaA_indexAcceptable(L, index);
  167. if (o != NULL && tonumber(o, &n))
  168. return nvalue(o);
  169. else
  170. return 0;
  171. }
  172. LUA_API int lua_toboolean (lua_State *L, int index) {
  173. const TObject *o = luaA_indexAcceptable(L, index);
  174. if (o != NULL && (ttype(o) == LUA_TBOOLEAN))
  175. return bvalue(o);
  176. else
  177. return -1;
  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 void lua_getmetatable (lua_State *L, int objindex) {
  306. StkId obj;
  307. Table *mt;
  308. lua_lock(L);
  309. obj = luaA_indexAcceptable(L, objindex);
  310. switch (ttype(obj)) {
  311. case LUA_TTABLE:
  312. mt = hvalue(obj)->metatable;
  313. break;
  314. case LUA_TUSERDATA:
  315. mt = uvalue(obj)->uv.metatable;
  316. break;
  317. default:
  318. mt = hvalue(defaultmeta(L));
  319. }
  320. if (mt == hvalue(defaultmeta(L)))
  321. setnilvalue(L->top);
  322. else
  323. sethvalue(L->top, mt);
  324. api_incr_top(L);
  325. lua_unlock(L);
  326. }
  327. /*
  328. ** set functions (stack -> Lua)
  329. */
  330. LUA_API void lua_settable (lua_State *L, int index) {
  331. StkId t;
  332. lua_lock(L);
  333. api_checknelems(L, 2);
  334. t = luaA_index(L, index);
  335. luaV_settable(L, t, L->top - 2, L->top - 1);
  336. L->top -= 2; /* pop index and value */
  337. lua_unlock(L);
  338. }
  339. LUA_API void lua_rawset (lua_State *L, int index) {
  340. StkId t;
  341. lua_lock(L);
  342. api_checknelems(L, 2);
  343. t = luaA_index(L, index);
  344. api_check(L, ttype(t) == LUA_TTABLE);
  345. luaH_set(L, hvalue(t), L->top-2, L->top-1);
  346. L->top -= 2;
  347. lua_unlock(L);
  348. }
  349. LUA_API void lua_rawseti (lua_State *L, int index, int n) {
  350. StkId o;
  351. lua_lock(L);
  352. api_checknelems(L, 1);
  353. o = luaA_index(L, index);
  354. api_check(L, ttype(o) == LUA_TTABLE);
  355. luaH_setnum(L, hvalue(o), n, L->top-1);
  356. L->top--;
  357. lua_unlock(L);
  358. }
  359. LUA_API void lua_setmetatable (lua_State *L, int objindex) {
  360. StkId obj, mt;
  361. lua_lock(L);
  362. api_checknelems(L, 1);
  363. obj = luaA_indexAcceptable(L, objindex);
  364. mt = --L->top;
  365. if (ttype(mt) == LUA_TNIL)
  366. mt = defaultmeta(L);
  367. api_check(L, ttype(mt) == LUA_TTABLE);
  368. switch (ttype(obj)) {
  369. case LUA_TTABLE:
  370. hvalue(obj)->metatable = hvalue(mt);
  371. break;
  372. case LUA_TUSERDATA:
  373. uvalue(obj)->uv.metatable = hvalue(mt);
  374. break;
  375. default:
  376. luaO_verror(L, "cannot change the meta table of a %.20s",
  377. luaT_typenames[ttype(obj)]);
  378. }
  379. lua_unlock(L);
  380. }
  381. /*
  382. ** `do' functions (run Lua code)
  383. */
  384. LUA_API void lua_rawcall (lua_State *L, int nargs, int nresults) {
  385. StkId func;
  386. lua_lock(L);
  387. api_checknelems(L, nargs+1);
  388. func = L->top - (nargs+1);
  389. luaD_call(L, func, nresults);
  390. lua_unlock(L);
  391. }
  392. LUA_API int lua_dofile (lua_State *L, const char *filename) {
  393. int status;
  394. status = lua_loadfile(L, filename);
  395. if (status == 0) /* parse OK? */
  396. status = lua_call(L, 0, LUA_MULTRET); /* call main */
  397. return status;
  398. }
  399. LUA_API int lua_dobuffer (lua_State *L, const char *buff, size_t size,
  400. const char *name) {
  401. int status;
  402. status = lua_loadbuffer(L, buff, size, name);
  403. if (status == 0) /* parse OK? */
  404. status = lua_call(L, 0, LUA_MULTRET); /* call main */
  405. return status;
  406. }
  407. LUA_API int lua_dostring (lua_State *L, const char *str) {
  408. return lua_dobuffer(L, str, strlen(str), str);
  409. }
  410. /*
  411. ** Garbage-collection functions
  412. */
  413. /* GC values are expressed in Kbytes: #bytes/2^10 */
  414. #define GCscale(x) (cast(int, (x)>>10))
  415. #define GCunscale(x) (cast(lu_mem, (x)<<10))
  416. LUA_API int lua_getgcthreshold (lua_State *L) {
  417. int threshold;
  418. lua_lock(L);
  419. threshold = GCscale(G(L)->GCthreshold);
  420. lua_unlock(L);
  421. return threshold;
  422. }
  423. LUA_API int lua_getgccount (lua_State *L) {
  424. int count;
  425. lua_lock(L);
  426. count = GCscale(G(L)->nblocks);
  427. lua_unlock(L);
  428. return count;
  429. }
  430. LUA_API void lua_setgcthreshold (lua_State *L, int newthreshold) {
  431. lua_lock(L);
  432. if (newthreshold > GCscale(ULONG_MAX))
  433. G(L)->GCthreshold = ULONG_MAX;
  434. else
  435. G(L)->GCthreshold = GCunscale(newthreshold);
  436. luaC_checkGC(L);
  437. lua_unlock(L);
  438. }
  439. /*
  440. ** miscellaneous functions
  441. */
  442. LUA_API void lua_error (lua_State *L, const char *s) {
  443. lua_lock(L);
  444. luaD_error(L, s);
  445. lua_unlock(L);
  446. }
  447. LUA_API int lua_next (lua_State *L, int index) {
  448. StkId t;
  449. lua_lock(L);
  450. t = luaA_index(L, index);
  451. api_check(L, ttype(t) == LUA_TTABLE);
  452. index = luaH_index(L, hvalue(t), luaA_index(L, -1));
  453. index = (luaH_nexti(hvalue(t), index, L->top - 1) != -1);
  454. if (index) {
  455. api_incr_top(L);
  456. }
  457. else /* no more elements */
  458. L->top -= 1; /* remove key */
  459. lua_unlock(L);
  460. return index;
  461. }
  462. LUA_API int lua_getn (lua_State *L, int index) {
  463. StkId t;
  464. const TObject *value;
  465. int n;
  466. lua_lock(L);
  467. t = luaA_index(L, index);
  468. api_check(L, ttype(t) == LUA_TTABLE);
  469. value = luaH_getstr(hvalue(t), luaS_newliteral(L, "n")); /* = t.n */
  470. if (ttype(value) == LUA_TNUMBER)
  471. n = cast(int, nvalue(value));
  472. else {
  473. Node *nd;
  474. Table *a = hvalue(t);
  475. lua_Number max = 0;
  476. int i;
  477. i = sizearray(a);
  478. while (i--) {
  479. if (ttype(&a->array[i]) != LUA_TNIL)
  480. break;
  481. }
  482. max = i+1;
  483. i = sizenode(a);
  484. nd = a->node;
  485. while (i--) {
  486. if (ttype(key(nd)) == LUA_TNUMBER &&
  487. ttype(val(nd)) != LUA_TNIL &&
  488. nvalue(key(nd)) > max)
  489. max = nvalue(key(nd));
  490. nd++;
  491. }
  492. n = cast(int, max);
  493. }
  494. lua_unlock(L);
  495. return n;
  496. }
  497. LUA_API void lua_concat (lua_State *L, int n) {
  498. lua_lock(L);
  499. api_checknelems(L, n);
  500. if (n >= 2) {
  501. luaV_strconc(L, n, L->top - L->ci->base - 1);
  502. L->top -= (n-1);
  503. luaC_checkGC(L);
  504. }
  505. else if (n == 0) { /* push null string */
  506. setsvalue(L->top, luaS_newlstr(L, NULL, 0));
  507. api_incr_top(L);
  508. }
  509. /* else n == 1; nothing to do */
  510. lua_unlock(L);
  511. }
  512. static Udata *pushnewudata (lua_State *L, size_t size) {
  513. Udata *u = luaS_newudata(L, size);
  514. setuvalue(L->top, u);
  515. api_incr_top(L);
  516. return uvalue(L->top-1);
  517. }
  518. LUA_API void *lua_newuserdata (lua_State *L, size_t size) {
  519. Udata *u;
  520. void *p;
  521. lua_lock(L);
  522. u = pushnewudata(L, size);
  523. p = u->uv.value;
  524. lua_unlock(L);
  525. return p;
  526. }
  527. LUA_API void lua_newuserdatabox (lua_State *L, void *p) {
  528. Udata *u;
  529. lua_lock(L);
  530. u = pushnewudata(L, 0);
  531. u->uv.value = p;
  532. lua_unlock(L);
  533. }
  534. LUA_API int lua_pushupvalues (lua_State *L) {
  535. TObject *func;
  536. int n, i;
  537. lua_lock(L);
  538. func = (L->ci->base - 1);
  539. api_check(L, iscfunction(func));
  540. n = clvalue(func)->c.nupvalues;
  541. if (LUA_MINSTACK+n > lua_stackspace(L))
  542. luaD_error(L, "stack overflow");
  543. for (i=0; i<n; i++) {
  544. setobj(L->top, &clvalue(func)->c.upvalue[i]);
  545. L->top++;
  546. }
  547. lua_unlock(L);
  548. return n;
  549. }