lapi.c 11 KB

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