lapi.c 9.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484
  1. /*
  2. ** $Id: lapi.c,v 1.104 2000/10/03 14:27:44 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[] = "$Lua: " LUA_VERSION " " LUA_COPYRIGHT " $\n"
  20. "$Authors: " LUA_AUTHORS " $";
  21. #define Index(L,i) ((i) >= 0 ? (L->Cbase+((i)-1)) : (L->top+(i)))
  22. #define api_incr_top(L) incr_top
  23. TObject *luaA_index (lua_State *L, int index) {
  24. return Index(L, index);
  25. }
  26. void luaA_pushobject (lua_State *L, const TObject *o) {
  27. *L->top = *o;
  28. incr_top;
  29. }
  30. int lua_stackspace (lua_State *L) {
  31. return (L->stack_last - L->top);
  32. }
  33. /*
  34. ** basic stack manipulation
  35. */
  36. int lua_gettop (lua_State *L) {
  37. return (L->top - L->Cbase);
  38. }
  39. void lua_settop (lua_State *L, int index) {
  40. if (index >= 0)
  41. luaD_adjusttop(L, L->Cbase, index);
  42. else
  43. L->top = L->top+index+1; /* index is negative */
  44. }
  45. void lua_remove (lua_State *L, int index) {
  46. StkId p = Index(L, index);
  47. while (++p < L->top) *(p-1) = *p;
  48. L->top--;
  49. }
  50. void lua_insert (lua_State *L, int index) {
  51. StkId p = Index(L, index);
  52. StkId q;
  53. for (q = L->top; q>p; q--)
  54. *q = *(q-1);
  55. *p = *L->top;
  56. }
  57. void lua_pushvalue (lua_State *L, int index) {
  58. *L->top = *Index(L, index);
  59. api_incr_top(L);
  60. }
  61. /*
  62. ** access functions (stack -> C)
  63. */
  64. #define btest(L,i,value,default) { \
  65. StkId o; \
  66. if ((i) >= 0) { \
  67. o = L->Cbase+((i)-1); \
  68. if (o >= L->top) return (default); \
  69. } \
  70. else o = L->top+(i); \
  71. return (value); }
  72. #define access(L,i,test,default,value) { \
  73. StkId o; \
  74. if ((i) >= 0) { \
  75. o = L->Cbase+((i)-1); \
  76. if (o >= L->top) return (default); \
  77. } \
  78. else o = L->top+(i); \
  79. return ((test) ? (value) : (default)); }
  80. int lua_type (lua_State *L, int index) {
  81. btest(L, index, ttype(o), LUA_TNONE);
  82. }
  83. const char *lua_typename (lua_State *L, int t) {
  84. UNUSED(L);
  85. return luaO_typenames[t];
  86. }
  87. int lua_iscfunction (lua_State *L, int index) {
  88. btest(L, index, iscfunction(o), 0);
  89. }
  90. int lua_isnumber (lua_State *L, int index) {
  91. btest(L, index, (tonumber(Index(L, index)) == 0), 0);
  92. }
  93. int lua_isstring (lua_State *L, int index) {
  94. int t = lua_type(L, index);
  95. return (t == LUA_TSTRING || t == LUA_TNUMBER);
  96. }
  97. int lua_tag (lua_State *L, int index) {
  98. btest(L, index, luaT_tag(o), LUA_NOTAG);
  99. }
  100. int lua_equal (lua_State *L, int index1, int index2) {
  101. StkId o1 = Index(L, index1);
  102. StkId o2 = Index(L, index2);
  103. if (o1 >= L->top || o2 >= L->top) return 0; /* index out-of-range */
  104. else return luaO_equalObj(o1, o2);
  105. }
  106. int lua_lessthan (lua_State *L, int index1, int index2) {
  107. StkId o1 = Index(L, index1);
  108. StkId o2 = Index(L, index2);
  109. if (o1 >= L->top || o2 >= L->top) return 0; /* index out-of-range */
  110. else return luaV_lessthan(L, o1, o2, L->top);
  111. }
  112. double lua_tonumber (lua_State *L, int index) {
  113. access(L, index, (tonumber(o) == 0), 0, nvalue(o));
  114. }
  115. const char *lua_tostring (lua_State *L, int index) {
  116. access(L, index, (tostring(L, o) == 0), NULL, svalue(o));
  117. }
  118. size_t lua_strlen (lua_State *L, int index) {
  119. access(L, index, (tostring(L, o) == 0), 0, tsvalue(o)->u.s.len);
  120. }
  121. lua_CFunction lua_tocfunction (lua_State *L, int index) {
  122. access(L, index, iscfunction(o), NULL, clvalue(o)->f.c);
  123. }
  124. void *lua_touserdata (lua_State *L, int index) {
  125. access(L, index, (ttype(o) == LUA_TUSERDATA), NULL, tsvalue(o)->u.d.value);
  126. }
  127. const void *lua_topointer (lua_State *L, int index) {
  128. StkId o = Index(L, index);
  129. switch (ttype(o)) {
  130. case LUA_TTABLE:
  131. return hvalue(o);
  132. case LUA_TFUNCTION:
  133. return clvalue(o);
  134. default: return NULL;
  135. }
  136. }
  137. /*
  138. ** push functions (C -> stack)
  139. */
  140. void lua_pushnil (lua_State *L) {
  141. ttype(L->top) = LUA_TNIL;
  142. api_incr_top(L);
  143. }
  144. void lua_pushnumber (lua_State *L, double n) {
  145. ttype(L->top) = LUA_TNUMBER;
  146. nvalue(L->top) = n;
  147. api_incr_top(L);
  148. }
  149. void lua_pushlstring (lua_State *L, const char *s, size_t len) {
  150. tsvalue(L->top) = luaS_newlstr(L, s, len);
  151. ttype(L->top) = LUA_TSTRING;
  152. api_incr_top(L);
  153. }
  154. void lua_pushstring (lua_State *L, const char *s) {
  155. if (s == NULL)
  156. lua_pushnil(L);
  157. else
  158. lua_pushlstring(L, s, strlen(s));
  159. }
  160. void lua_pushcclosure (lua_State *L, lua_CFunction fn, int n) {
  161. luaV_Cclosure(L, fn, n);
  162. }
  163. void lua_pushusertag (lua_State *L, void *u, int tag) { /* ORDER LUA_T */
  164. if (!(tag == LUA_ANYTAG || tag == LUA_TUSERDATA || validtag(tag)))
  165. luaO_verror(L, "invalid tag for a userdata (%d)", tag);
  166. tsvalue(L->top) = luaS_createudata(L, u, tag);
  167. ttype(L->top) = LUA_TUSERDATA;
  168. api_incr_top(L);
  169. }
  170. /*
  171. ** get functions (Lua -> stack)
  172. */
  173. void lua_getglobal (lua_State *L, const char *name) {
  174. StkId top = L->top;
  175. *top = *luaV_getglobal(L, luaS_new(L, name));
  176. L->top = top;
  177. api_incr_top(L);
  178. }
  179. void lua_gettable (lua_State *L, int index) {
  180. StkId t = Index(L, index);
  181. StkId top = L->top;
  182. *(top-1) = *luaV_gettable(L, t);
  183. L->top = top; /* tag method may change top */
  184. }
  185. void lua_rawget (lua_State *L, int index) {
  186. StkId t = Index(L, index);
  187. LUA_ASSERT(ttype(t) == LUA_TTABLE, "table expected");
  188. *(L->top - 1) = *luaH_get(L, hvalue(t), L->top - 1);
  189. }
  190. void lua_rawgeti (lua_State *L, int index, int n) {
  191. StkId o = Index(L, index);
  192. LUA_ASSERT(ttype(o) == LUA_TTABLE, "table expected");
  193. *L->top = *luaH_getnum(hvalue(o), n);
  194. api_incr_top(L);
  195. }
  196. void lua_getglobals (lua_State *L) {
  197. hvalue(L->top) = L->gt;
  198. ttype(L->top) = LUA_TTABLE;
  199. api_incr_top(L);
  200. }
  201. int lua_getref (lua_State *L, int ref) {
  202. if (ref == LUA_REFNIL)
  203. ttype(L->top) = LUA_TNIL;
  204. else if (0 <= ref && ref < L->refSize &&
  205. (L->refArray[ref].st == LOCK || L->refArray[ref].st == HOLD))
  206. *L->top = L->refArray[ref].o;
  207. else
  208. return 0;
  209. api_incr_top(L);
  210. return 1;
  211. }
  212. void lua_newtable (lua_State *L) {
  213. hvalue(L->top) = luaH_new(L, 0);
  214. ttype(L->top) = LUA_TTABLE;
  215. api_incr_top(L);
  216. }
  217. /*
  218. ** set functions (stack -> Lua)
  219. */
  220. void lua_setglobal (lua_State *L, const char *name) {
  221. StkId top = L->top;
  222. luaV_setglobal(L, luaS_new(L, name));
  223. L->top = top-1; /* remove element from the top */
  224. }
  225. void lua_settable (lua_State *L, int index) {
  226. StkId t = Index(L, index);
  227. StkId top = L->top;
  228. luaV_settable(L, t, top-2);
  229. L->top = top-2; /* pop index and value */
  230. }
  231. void lua_rawset (lua_State *L, int index) {
  232. StkId t = Index(L, index);
  233. LUA_ASSERT(ttype(t) == LUA_TTABLE, "table expected");
  234. *luaH_set(L, hvalue(t), L->top-2) = *(L->top-1);
  235. L->top -= 2;
  236. }
  237. void lua_rawseti (lua_State *L, int index, int n) {
  238. StkId o = Index(L, index);
  239. LUA_ASSERT(ttype(o) == LUA_TTABLE, "table expected");
  240. *luaH_setint(L, hvalue(o), n) = *(L->top-1);
  241. L->top--;
  242. }
  243. void lua_setglobals (lua_State *L) {
  244. StkId newtable = --L->top;
  245. LUA_ASSERT(ttype(newtable) == LUA_TTABLE, "table expected");
  246. L->gt = hvalue(newtable);
  247. }
  248. int lua_ref (lua_State *L, int lock) {
  249. int ref;
  250. if (ttype(L->top-1) == LUA_TNIL)
  251. ref = LUA_REFNIL;
  252. else {
  253. if (L->refFree != NONEXT) { /* is there a free place? */
  254. ref = L->refFree;
  255. L->refFree = L->refArray[ref].st;
  256. }
  257. else { /* no more free places */
  258. luaM_growvector(L, L->refArray, L->refSize, 1, struct Ref,
  259. "reference table overflow", MAX_INT);
  260. L->nblocks += sizeof(struct Ref);
  261. ref = L->refSize++;
  262. }
  263. L->refArray[ref].o = *(L->top-1);
  264. L->refArray[ref].st = lock ? LOCK : HOLD;
  265. }
  266. L->top--;
  267. return ref;
  268. }
  269. /*
  270. ** "do" functions (run Lua code)
  271. ** (most of them are in ldo.c)
  272. */
  273. void lua_rawcall (lua_State *L, int nargs, int nresults) {
  274. luaD_call(L, L->top-(nargs+1), nresults);
  275. }
  276. /*
  277. ** Garbage-collection functions
  278. */
  279. /* GC values are expressed in Kbytes: #bytes/2^10 */
  280. #define GCscale(x) ((int)((x)>>10))
  281. #define GCunscale(x) ((unsigned long)(x)<<10)
  282. int lua_getgcthreshold (lua_State *L) {
  283. return GCscale(L->GCthreshold);
  284. }
  285. int lua_getgccount (lua_State *L) {
  286. return GCscale(L->nblocks);
  287. }
  288. void lua_setgcthreshold (lua_State *L, int newthreshold) {
  289. if (newthreshold > GCscale(ULONG_MAX))
  290. L->GCthreshold = ULONG_MAX;
  291. else
  292. L->GCthreshold = GCunscale(newthreshold);
  293. luaC_checkGC(L);
  294. }
  295. /*
  296. ** miscellaneous functions
  297. */
  298. void lua_settag (lua_State *L, int tag) {
  299. luaT_realtag(L, tag);
  300. switch (ttype(L->top-1)) {
  301. case LUA_TTABLE:
  302. hvalue(L->top-1)->htag = tag;
  303. break;
  304. case LUA_TUSERDATA:
  305. tsvalue(L->top-1)->u.d.tag = tag;
  306. break;
  307. default:
  308. luaO_verror(L, "cannot change the tag of a %.20s",
  309. luaO_typename(L->top-1));
  310. }
  311. L->top--;
  312. }
  313. void lua_unref (lua_State *L, int ref) {
  314. if (ref >= 0) {
  315. LUA_ASSERT(ref < L->refSize && L->refArray[ref].st < 0, "invalid ref");
  316. L->refArray[ref].st = L->refFree;
  317. L->refFree = ref;
  318. }
  319. }
  320. int lua_next (lua_State *L, int index) {
  321. StkId t = Index(L, index);
  322. Node *n;
  323. LUA_ASSERT(ttype(t) == LUA_TTABLE, "table expected");
  324. n = luaH_next(L, hvalue(t), Index(L, -1));
  325. if (n) {
  326. *(L->top-1) = *key(n);
  327. *L->top = *val(n);
  328. api_incr_top(L);
  329. return 1;
  330. }
  331. else { /* no more elements */
  332. L->top -= 1; /* remove key */
  333. return 0;
  334. }
  335. }
  336. int lua_getn (lua_State *L, int index) {
  337. Hash *h = hvalue(Index(L, index));
  338. const TObject *value = luaH_getstr(h, luaS_new(L, "n")); /* value = h.n */
  339. if (ttype(value) == LUA_TNUMBER)
  340. return (int)nvalue(value);
  341. else {
  342. Number max = 0;
  343. int i = h->size;
  344. Node *n = h->node;
  345. while (i--) {
  346. if (ttype(key(n)) == LUA_TNUMBER &&
  347. ttype(val(n)) != LUA_TNIL &&
  348. nvalue(key(n)) > max)
  349. max = nvalue(key(n));
  350. n++;
  351. }
  352. return (int)max;
  353. }
  354. }
  355. void lua_concat (lua_State *L, int n) {
  356. StkId top = L->top;
  357. luaV_strconc(L, n, top);
  358. L->top = top-(n-1);
  359. luaC_checkGC(L);
  360. }