lapi.c 9.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444
  1. /*
  2. ** $Id: lapi.c,v 1.96 2000/09/11 20:29:27 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. TObject temp = *(L->top-1);
  52. StkId p = Index(L, index);
  53. StkId q;
  54. for (q = L->top-1; q>p; q--)
  55. *q = *(q-1);
  56. *p = temp;
  57. }
  58. void lua_pushvalue (lua_State *L, int index) {
  59. *L->top = *Index(L, index);
  60. api_incr_top(L);
  61. }
  62. /*
  63. ** access functions (stack -> C)
  64. */
  65. #define btest(L,i,value,default) { \
  66. StkId o; \
  67. if ((i) >= 0) { \
  68. o = L->Cbase+((i)-1); \
  69. if (o >= L->top) return (default); \
  70. } \
  71. else o = L->top+(i); \
  72. return (value); }
  73. #define access(L,i,test,default,value) { \
  74. StkId o; \
  75. if ((i) >= 0) { \
  76. o = L->Cbase+((i)-1); \
  77. if (o >= L->top) return (default); \
  78. } \
  79. else o = L->top+(i); \
  80. return ((test) ? (value) : (default)); }
  81. const char *lua_type (lua_State *L, int index) {
  82. btest(L, index, luaO_typename(o), "NO VALUE");
  83. }
  84. int lua_iscfunction (lua_State *L, int index) {
  85. btest(L, index, (ttype(o) == TAG_CCLOSURE), 0);
  86. }
  87. int lua_isnumber (lua_State *L, int index) {
  88. btest(L, index, (tonumber(Index(L, index)) == 0), 0);
  89. }
  90. int lua_tag (lua_State *L, int index) {
  91. btest(L, index,
  92. ((ttype(o) == TAG_USERDATA) ? tsvalue(o)->u.d.tag :
  93. luaT_effectivetag(L, o)), -1);
  94. }
  95. int lua_equal (lua_State *L, int index1, int index2) {
  96. StkId o1 = Index(L, index1);
  97. StkId o2 = Index(L, index2);
  98. if (o1 >= L->top || o2 >= L->top) return 0; /* index out-of-range */
  99. else return luaO_equalObj(o1, o2);
  100. }
  101. int lua_lessthan (lua_State *L, int index1, int index2) {
  102. StkId o1 = Index(L, index1);
  103. StkId o2 = Index(L, index2);
  104. if (o1 >= L->top || o2 >= L->top) return 0; /* index out-of-range */
  105. else return luaV_lessthan(L, o1, o2, L->top);
  106. }
  107. double lua_tonumber (lua_State *L, int index) {
  108. access(L, index, (tonumber(o) == 0), 0.0, nvalue(o));
  109. }
  110. const char *lua_tostring (lua_State *L, int index) {
  111. luaC_checkGC(L); /* `tostring' may create a new string */
  112. access(L, index, (tostring(L, o) == 0), NULL, svalue(o));
  113. }
  114. size_t lua_strlen (lua_State *L, int index) {
  115. access(L, index, (tostring(L, o) == 0), 0, tsvalue(o)->u.s.len);
  116. }
  117. lua_CFunction lua_tocfunction (lua_State *L, int index) {
  118. access(L, index, (ttype(o) == TAG_CCLOSURE), NULL, clvalue(o)->f.c);
  119. }
  120. void *lua_touserdata (lua_State *L, int index) {
  121. access(L, index, (ttype(o) == TAG_USERDATA), NULL, tsvalue(o)->u.d.value);
  122. }
  123. const void *lua_topointer (lua_State *L, int index) {
  124. StkId o = Index(L, index);
  125. switch (ttype(o)) {
  126. case TAG_TABLE:
  127. return hvalue(o);
  128. case TAG_CCLOSURE: case TAG_LCLOSURE:
  129. return clvalue(o);
  130. default: return NULL;
  131. }
  132. }
  133. /*
  134. ** push functions (C -> stack)
  135. */
  136. void lua_pushnil (lua_State *L) {
  137. ttype(L->top) = TAG_NIL;
  138. api_incr_top(L);
  139. }
  140. void lua_pushnumber (lua_State *L, double n) {
  141. ttype(L->top) = TAG_NUMBER;
  142. nvalue(L->top) = n;
  143. api_incr_top(L);
  144. }
  145. void lua_pushlstring (lua_State *L, const char *s, size_t len) {
  146. luaC_checkGC(L);
  147. tsvalue(L->top) = luaS_newlstr(L, s, len);
  148. ttype(L->top) = TAG_STRING;
  149. api_incr_top(L);
  150. }
  151. void lua_pushstring (lua_State *L, const char *s) {
  152. if (s == NULL)
  153. lua_pushnil(L);
  154. else
  155. lua_pushlstring(L, s, strlen(s));
  156. }
  157. void lua_pushcclosure (lua_State *L, lua_CFunction fn, int n) {
  158. luaC_checkGC(L);
  159. luaV_Cclosure(L, fn, n);
  160. }
  161. void lua_pushusertag (lua_State *L, void *u, int tag) { /* ORDER LUA_T */
  162. luaC_checkGC(L);
  163. if (tag != LUA_ANYTAG && tag != TAG_USERDATA && tag < NUM_TAGS)
  164. luaO_verror(L, "invalid tag for a userdata (%d)", tag);
  165. tsvalue(L->top) = luaS_createudata(L, u, tag);
  166. ttype(L->top) = TAG_USERDATA;
  167. api_incr_top(L);
  168. }
  169. /*
  170. ** get functions (Lua -> stack)
  171. */
  172. void lua_getglobal (lua_State *L, const char *name) {
  173. StkId top = L->top;
  174. *top = *luaV_getglobal(L, luaS_new(L, name));
  175. L->top = top;
  176. api_incr_top(L);
  177. }
  178. void lua_gettable (lua_State *L, int tableindex) {
  179. StkId t = Index(L, tableindex);
  180. StkId top = L->top;
  181. *(top-1) = *luaV_gettable(L, t);
  182. L->top = top; /* tag method may change top */
  183. }
  184. void lua_rawget (lua_State *L, int tableindex) {
  185. StkId t = Index(L, tableindex);
  186. LUA_ASSERT(ttype(t) == TAG_TABLE, "table expected");
  187. *(L->top - 1) = *luaH_get(L, hvalue(t), L->top - 1);
  188. }
  189. void lua_rawgeti (lua_State *L, int index, int n) {
  190. StkId o = Index(L, index);
  191. LUA_ASSERT(ttype(o) == TAG_TABLE, "table expected");
  192. *L->top = *luaH_getnum(hvalue(o), n);
  193. api_incr_top(L);
  194. }
  195. void lua_getglobals (lua_State *L) {
  196. hvalue(L->top) = L->gt;
  197. ttype(L->top) = TAG_TABLE;
  198. api_incr_top(L);
  199. }
  200. int lua_getref (lua_State *L, int ref) {
  201. if (ref == LUA_REFNIL)
  202. ttype(L->top) = TAG_NIL;
  203. else if (0 <= ref && ref < L->refSize &&
  204. (L->refArray[ref].st == LOCK || L->refArray[ref].st == HOLD))
  205. *L->top = L->refArray[ref].o;
  206. else
  207. return 0;
  208. api_incr_top(L);
  209. return 1;
  210. }
  211. void lua_newtable (lua_State *L) {
  212. luaC_checkGC(L);
  213. hvalue(L->top) = luaH_new(L, 0);
  214. ttype(L->top) = TAG_TABLE;
  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 tableindex) {
  226. StkId t = Index(L, tableindex);
  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 tableindex) {
  232. StkId t = Index(L, tableindex);
  233. LUA_ASSERT(ttype(t) == TAG_TABLE, "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) == TAG_TABLE, "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) == TAG_TABLE, "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) == TAG_NIL)
  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. ref = L->refSize++;
  261. }
  262. L->refArray[ref].o = *(L->top-1);
  263. L->refArray[ref].st = lock ? LOCK : HOLD;
  264. }
  265. L->top--;
  266. return ref;
  267. }
  268. /*
  269. ** miscellaneous functions
  270. */
  271. void lua_settag (lua_State *L, int tag) {
  272. luaT_realtag(L, tag);
  273. switch (ttype(L->top-1)) {
  274. case TAG_TABLE:
  275. hvalue(L->top-1)->htag = tag;
  276. break;
  277. case TAG_USERDATA:
  278. tsvalue(L->top-1)->u.d.tag = tag;
  279. break;
  280. default:
  281. luaO_verror(L, "cannot change the tag of a %.20s",
  282. luaO_typename(L->top-1));
  283. }
  284. L->top--;
  285. }
  286. void lua_unref (lua_State *L, int ref) {
  287. if (ref >= 0) {
  288. LUA_ASSERT(ref < L->refSize && L->refArray[ref].st < 0, "invalid ref");
  289. L->refArray[ref].st = L->refFree;
  290. L->refFree = ref;
  291. }
  292. }
  293. int lua_next (lua_State *L, int tableindex) {
  294. StkId t = Index(L, tableindex);
  295. Node *n;
  296. LUA_ASSERT(ttype(t) == TAG_TABLE, "table expected");
  297. n = luaH_next(L, hvalue(t), Index(L, -1));
  298. if (n) {
  299. *(L->top-1) = *key(n);
  300. *L->top = *val(n);
  301. api_incr_top(L);
  302. return 1;
  303. }
  304. else { /* no more elements */
  305. L->top -= 1; /* remove key */
  306. return 0;
  307. }
  308. }
  309. int lua_getn (lua_State *L, int index) {
  310. Hash *h = hvalue(Index(L, index));
  311. const TObject *value = luaH_getstr(h, luaS_new(L, "n")); /* value = h.n */
  312. if (ttype(value) == TAG_NUMBER)
  313. return (int)nvalue(value);
  314. else {
  315. Number max = 0;
  316. int i = h->size;
  317. Node *n = h->node;
  318. while (i--) {
  319. if (ttype(key(n)) == TAG_NUMBER &&
  320. ttype(val(n)) != TAG_NIL &&
  321. nvalue(key(n)) > max)
  322. max = nvalue(key(n));
  323. n++;
  324. }
  325. return (int)max;
  326. }
  327. }
  328. void lua_concat (lua_State *L, int n) {
  329. StkId top = L->top;
  330. luaV_strconc(L, n, top);
  331. L->top = top-(n-1);
  332. }