lapi.c 10 KB

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