lapi.c 8.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429
  1. /*
  2. ** $Id: lapi.c,v 1.92 2000/08/31 20:23:40 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 "lauxlib.h"
  10. #include "ldo.h"
  11. #include "lfunc.h"
  12. #include "lgc.h"
  13. #include "lmem.h"
  14. #include "lobject.h"
  15. #include "lstate.h"
  16. #include "lstring.h"
  17. #include "ltable.h"
  18. #include "ltm.h"
  19. #include "lvm.h"
  20. const char lua_ident[] = "$Lua: " LUA_VERSION " " LUA_COPYRIGHT " $\n"
  21. "$Authors: " LUA_AUTHORS " $";
  22. #define Index(L,i) ((i) >= 0 ? (L->Cbase+((i)-1)) : (L->top+(i)))
  23. #define api_incr_top(L) (++L->top)
  24. TObject *luaA_index (lua_State *L, int index) {
  25. return Index(L, index);
  26. }
  27. void luaA_pushobject (lua_State *L, const TObject *o) {
  28. *L->top = *o;
  29. incr_top;
  30. }
  31. int lua_stackspace (lua_State *L) {
  32. return (L->stack_last - L->top);
  33. }
  34. /*
  35. ** basic stack manipulation
  36. */
  37. int lua_gettop (lua_State *L) {
  38. return (L->top - L->Cbase);
  39. }
  40. void lua_settop (lua_State *L, int index) {
  41. if (index >= 0)
  42. luaD_adjusttop(L, L->Cbase, index);
  43. else
  44. L->top = L->top+index+1; /* index is negative */
  45. }
  46. void lua_move (lua_State *L, int index) {
  47. TObject *p = Index(L, index);
  48. TObject temp = *p;
  49. while (++p < L->top) *(p-1) = *p;
  50. *(L->top-1) = temp;
  51. }
  52. void lua_insert (lua_State *L, int index) {
  53. TObject temp = *(L->top-1);
  54. TObject *p = Index(L, index);
  55. TObject *q;
  56. for (q = L->top-1; q>p; q--)
  57. *q = *(q-1);
  58. *p = temp;
  59. }
  60. void lua_pushobject (lua_State *L, int index) {
  61. *L->top = *Index(L, index);
  62. api_incr_top(L);
  63. }
  64. /*
  65. ** access functions (stack -> C)
  66. */
  67. #define btest(L,i,value,default) { \
  68. StkId o; \
  69. if ((i) >= 0) { \
  70. o = L->Cbase+((i)-1); \
  71. if (o >= L->top) return (default); \
  72. } \
  73. else o = L->top+(i); \
  74. return (value); }
  75. #define access(L,i,test,default,value) { \
  76. StkId o; \
  77. if ((i) >= 0) { \
  78. o = L->Cbase+((i)-1); \
  79. if (o >= L->top) return (default); \
  80. } \
  81. else o = L->top+(i); \
  82. return ((test) ? (value) : (default)); }
  83. const char *lua_type (lua_State *L, int index) {
  84. btest(L, index, luaO_typename(o), "NO VALUE");
  85. }
  86. int lua_iscfunction (lua_State *L, int index) {
  87. btest(L, index, (ttype(o) == TAG_CCLOSURE), 0);
  88. }
  89. int lua_isnumber (lua_State *L, int index) {
  90. btest(L, index, (tonumber(Index(L, index)) == 0), 0);
  91. }
  92. int lua_tag (lua_State *L, int index) {
  93. btest(L, index,
  94. ((ttype(o) == TAG_USERDATA) ? tsvalue(o)->u.d.tag : luaT_effectivetag(L, o)),
  95. -1);
  96. }
  97. int lua_equal(lua_State *L, int index1, int index2) {
  98. StkId o1 = Index(L, index1);
  99. StkId o2 = Index(L, index2);
  100. if (o1 >= L->top || o2 >= L->top) return 0; /* index out-of-range */
  101. else return luaO_equalObj(o1, o2);
  102. }
  103. double lua_tonumber (lua_State *L, int index) {
  104. access(L, index, (tonumber(o) == 0), 0.0, nvalue(o));
  105. }
  106. const char *lua_tostring (lua_State *L, int index) {
  107. luaC_checkGC(L); /* `tostring' may create a new string */
  108. access(L, index, (tostring(L, o) == 0), NULL, svalue(o));
  109. }
  110. size_t lua_strlen (lua_State *L, int index) {
  111. access(L, index, (tostring(L, o) == 0), 0, tsvalue(o)->u.s.len);
  112. }
  113. lua_CFunction lua_tocfunction (lua_State *L, int index) {
  114. access(L, index, (ttype(o) == TAG_CCLOSURE), NULL, clvalue(o)->f.c);
  115. }
  116. void *lua_touserdata (lua_State *L, int index) {
  117. access(L, index, (ttype(o) == TAG_USERDATA), NULL, tsvalue(o)->u.d.value);
  118. }
  119. const void *lua_topointer (lua_State *L, int index) {
  120. const TObject *o = Index(L, index);
  121. switch (ttype(o)) {
  122. case TAG_NUMBER: case TAG_NIL:
  123. return NULL;
  124. case TAG_STRING:
  125. return tsvalue(o)->str;
  126. case TAG_USERDATA:
  127. return tsvalue(o)->u.d.value;
  128. case TAG_TABLE:
  129. return hvalue(o);
  130. case TAG_CCLOSURE: case TAG_LCLOSURE:
  131. return clvalue(o);
  132. default: return NULL;
  133. }
  134. }
  135. /*
  136. ** push functions (C -> stack)
  137. */
  138. void lua_pushnil (lua_State *L) {
  139. ttype(L->top) = TAG_NIL;
  140. api_incr_top(L);
  141. }
  142. void lua_pushnumber (lua_State *L, double n) {
  143. ttype(L->top) = TAG_NUMBER;
  144. nvalue(L->top) = n;
  145. api_incr_top(L);
  146. }
  147. void lua_pushlstring (lua_State *L, const char *s, size_t len) {
  148. luaC_checkGC(L);
  149. tsvalue(L->top) = luaS_newlstr(L, s, len);
  150. ttype(L->top) = TAG_STRING;
  151. api_incr_top(L);
  152. }
  153. void lua_pushstring (lua_State *L, const char *s) {
  154. if (s == NULL)
  155. lua_pushnil(L);
  156. else
  157. lua_pushlstring(L, s, strlen(s));
  158. }
  159. void lua_pushcclosure (lua_State *L, lua_CFunction fn, int n) {
  160. luaC_checkGC(L);
  161. luaV_Cclosure(L, fn, n);
  162. }
  163. void lua_pushusertag (lua_State *L, void *u, int tag) { /* ORDER LUA_T */
  164. luaC_checkGC(L);
  165. if (tag != LUA_ANYTAG && tag != TAG_USERDATA && tag < NUM_TAGS)
  166. luaL_verror(L, "invalid tag for a userdata (%d)", tag);
  167. tsvalue(L->top) = luaS_createudata(L, u, tag);
  168. ttype(L->top) = TAG_USERDATA;
  169. api_incr_top(L);
  170. }
  171. /*
  172. ** get functions (Lua -> stack)
  173. */
  174. void lua_getglobal (lua_State *L, const char *name) {
  175. luaV_getglobal(L, luaS_new(L, name), L->top++);
  176. }
  177. void lua_gettable (lua_State *L) {
  178. luaV_gettable(L, L->top--);
  179. }
  180. void lua_rawget (lua_State *L) {
  181. LUA_ASSERT(ttype(L->top-2) == TAG_TABLE, "table expected");
  182. *(L->top - 2) = *luaH_get(L, hvalue(L->top - 2), L->top - 1);
  183. L->top--;
  184. }
  185. void lua_getglobals (lua_State *L) {
  186. hvalue(L->top) = L->gt;
  187. ttype(L->top) = TAG_TABLE;
  188. api_incr_top(L);
  189. }
  190. void lua_gettagmethod (lua_State *L, int tag, const char *event) {
  191. *L->top = *luaT_gettagmethod(L, tag, event);
  192. api_incr_top(L);
  193. }
  194. int lua_getref (lua_State *L, int ref) {
  195. if (ref == LUA_REFNIL)
  196. ttype(L->top) = TAG_NIL;
  197. else if (0 <= ref && ref < L->refSize &&
  198. (L->refArray[ref].st == LOCK || L->refArray[ref].st == HOLD))
  199. *L->top = L->refArray[ref].o;
  200. else
  201. return 0;
  202. api_incr_top(L);
  203. return 1;
  204. }
  205. void lua_newtable (lua_State *L) {
  206. luaC_checkGC(L);
  207. hvalue(L->top) = luaH_new(L, 0);
  208. ttype(L->top) = TAG_TABLE;
  209. api_incr_top(L);
  210. }
  211. /*
  212. ** set functions (stack -> Lua)
  213. */
  214. void lua_setglobal (lua_State *L, const char *name) {
  215. luaV_setglobal(L, luaS_new(L, name), L->top--);
  216. }
  217. void lua_settable (lua_State *L) {
  218. StkId top = L->top;
  219. luaV_settable(L, top-3, top);
  220. L->top = top-3; /* pop table, index, and value */
  221. }
  222. void lua_rawset (lua_State *L) {
  223. LUA_ASSERT(ttype(L->top-3) == TAG_TABLE, "table expected");
  224. *luaH_set(L, hvalue(L->top-3), L->top-2) = *(L->top-1);
  225. L->top -= 3;
  226. }
  227. void lua_setglobals (lua_State *L) {
  228. TObject *newtable = --L->top;
  229. LUA_ASSERT(ttype(newtable) == TAG_TABLE, "table expected");
  230. L->gt = hvalue(newtable);
  231. }
  232. void lua_settagmethod (lua_State *L, int tag, const char *event) {
  233. TObject *method = L->top - 1;
  234. if (ttype(method) != TAG_NIL &&
  235. ttype(method) != TAG_CCLOSURE &&
  236. ttype(method) != TAG_LCLOSURE)
  237. lua_error(L, "Lua API error - tag method must be a function or nil");
  238. luaT_settagmethod(L, tag, event, method);
  239. }
  240. int lua_ref (lua_State *L, int lock) {
  241. int ref;
  242. if (ttype(L->top-1) == TAG_NIL)
  243. ref = LUA_REFNIL;
  244. else {
  245. if (L->refFree != NONEXT) { /* is there a free place? */
  246. ref = L->refFree;
  247. L->refFree = L->refArray[ref].st;
  248. }
  249. else { /* no more free places */
  250. luaM_growvector(L, L->refArray, L->refSize, 1, struct Ref,
  251. "reference table overflow", MAX_INT);
  252. ref = L->refSize++;
  253. }
  254. L->refArray[ref].o = *(L->top-1);
  255. L->refArray[ref].st = lock ? LOCK : HOLD;
  256. }
  257. L->top--;
  258. return ref;
  259. }
  260. /*
  261. ** miscellaneous functions
  262. */
  263. void lua_settag (lua_State *L, int tag) {
  264. luaT_realtag(L, tag);
  265. switch (ttype(L->top-1)) {
  266. case TAG_TABLE:
  267. hvalue(L->top-1)->htag = tag;
  268. break;
  269. case TAG_USERDATA:
  270. tsvalue(L->top-1)->u.d.tag = tag;
  271. break;
  272. default:
  273. luaL_verror(L, "cannot change the tag of a %.20s",
  274. luaO_typename(L->top-1));
  275. }
  276. L->top--;
  277. }
  278. void lua_unref (lua_State *L, int ref) {
  279. if (ref >= 0) {
  280. LUA_ASSERT(ref < L->refSize && L->refArray[ref].st < 0, "invalid ref");
  281. L->refArray[ref].st = L->refFree;
  282. L->refFree = ref;
  283. }
  284. }
  285. int lua_next (lua_State *L) {
  286. const TObject *t = Index(L, -2);
  287. Node *n;
  288. LUA_ASSERT(ttype(t) == TAG_TABLE, "table expected");
  289. n = luaH_next(L, hvalue(t), Index(L, -1));
  290. if (n) {
  291. *(L->top-1) = *key(n);
  292. *L->top = *val(n);
  293. api_incr_top(L);
  294. return 1;
  295. }
  296. else { /* no more elements */
  297. L->top -= 2; /* remove key and table */
  298. return 0;
  299. }
  300. }
  301. int lua_getn (lua_State *L, int index) {
  302. Hash *h = hvalue(Index(L, index));
  303. const TObject *value = luaH_getstr(h, luaS_new(L, "n")); /* value = h.n */
  304. if (ttype(value) == TAG_NUMBER)
  305. return (int)nvalue(value);
  306. else {
  307. Number max = 0;
  308. int i = h->size;
  309. Node *n = h->node;
  310. while (i--) {
  311. if (ttype(key(n)) == TAG_NUMBER &&
  312. ttype(val(n)) != TAG_NIL &&
  313. nvalue(key(n)) > max)
  314. max = nvalue(key(n));
  315. n++;
  316. }
  317. return (int)max;
  318. }
  319. }