ltests.c 29 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186
  1. /*
  2. ** $Id: ltests.c,v 2.65 2009/06/15 19:51:31 roberto Exp roberto $
  3. ** Internal Module for Debugging of the Lua Implementation
  4. ** See Copyright Notice in lua.h
  5. */
  6. #include <limits.h>
  7. #include <stdio.h>
  8. #include <stdlib.h>
  9. #include <string.h>
  10. #define ltests_c
  11. #define LUA_CORE
  12. #include "lua.h"
  13. #include "lapi.h"
  14. #include "lauxlib.h"
  15. #include "lcode.h"
  16. #include "lctype.h"
  17. #include "ldebug.h"
  18. #include "ldo.h"
  19. #include "lfunc.h"
  20. #include "lmem.h"
  21. #include "lopcodes.h"
  22. #include "lstate.h"
  23. #include "lstring.h"
  24. #include "ltable.h"
  25. #include "lualib.h"
  26. /*
  27. ** The whole module only makes sense with LUA_DEBUG on
  28. */
  29. #if defined(LUA_DEBUG)
  30. void *l_Trick = 0;
  31. int islocked = 0;
  32. #define obj_at(L,k) (L->ci->func + (k))
  33. static void setnameval (lua_State *L, const char *name, int val) {
  34. lua_pushstring(L, name);
  35. lua_pushinteger(L, val);
  36. lua_settable(L, -3);
  37. }
  38. static void pushobject (lua_State *L, const TValue *o) {
  39. setobj2s(L, L->top, o);
  40. api_incr_top(L);
  41. }
  42. static int tpanic (lua_State *L) {
  43. fprintf(stderr, "PANIC: unprotected error in call to Lua API (%s)\n",
  44. lua_tostring(L, -1));
  45. return (exit(EXIT_FAILURE), 0); /* do not return to Lua */
  46. }
  47. /*
  48. ** {======================================================================
  49. ** Controlled version for realloc.
  50. ** =======================================================================
  51. */
  52. #define MARK 0x55 /* 01010101 (a nice pattern) */
  53. #ifndef EXTERNMEMCHECK
  54. /* full memory check */
  55. #define HEADER (sizeof(L_Umaxalign)) /* ensures maximum alignment for HEADER */
  56. #define MARKSIZE 16 /* size of marks after each block */
  57. #define blockhead(b) (cast(char *, b) - HEADER)
  58. #define setsize(newblock, size) (*cast(size_t *, newblock) = size)
  59. #define checkblocksize(b, size) (size == (*cast(size_t *, blockhead(b))))
  60. #define fillmem(mem,size) memset(mem, -MARK, size)
  61. #else
  62. /* external memory check: don't do it twice */
  63. #define HEADER 0
  64. #define MARKSIZE 0
  65. #define blockhead(b) (b)
  66. #define setsize(newblock, size) /* empty */
  67. #define checkblocksize(b,size) (1)
  68. #define fillmem(mem,size) /* empty */
  69. #endif
  70. Memcontrol l_memcontrol = {0L, 0L, 0L, 0L};
  71. static void *checkblock (void *block, size_t size) {
  72. void *b = blockhead(block);
  73. int i;
  74. for (i=0;i<MARKSIZE;i++)
  75. lua_assert(*(cast(char *, b)+HEADER+size+i) == MARK+i); /* corrupted block? */
  76. return b;
  77. }
  78. static void freeblock (Memcontrol *mc, void *block, size_t size) {
  79. if (block) {
  80. lua_assert(checkblocksize(block, size));
  81. block = checkblock(block, size);
  82. fillmem(block, size+HEADER+MARKSIZE); /* erase block */
  83. free(block); /* free original block */
  84. mc->numblocks--;
  85. mc->total -= size;
  86. }
  87. }
  88. void *debug_realloc (void *ud, void *block, size_t oldsize, size_t size) {
  89. Memcontrol *mc = cast(Memcontrol *, ud);
  90. lua_assert((oldsize == 0) ? block == NULL :
  91. block && checkblocksize(block, oldsize));
  92. if (mc->memlimit == 0) { /* first time? */
  93. char *limit = getenv("MEMLIMIT"); /* initialize memory limit */
  94. mc->memlimit = limit ? strtoul(limit, NULL, 10) : ULONG_MAX;
  95. }
  96. if (size == 0) {
  97. freeblock(mc, block, oldsize);
  98. return NULL;
  99. }
  100. else if (size > oldsize && mc->total+size-oldsize > mc->memlimit)
  101. return NULL; /* to test memory allocation errors */
  102. else {
  103. void *newblock;
  104. int i;
  105. size_t realsize = HEADER+size+MARKSIZE;
  106. size_t commonsize = (oldsize < size) ? oldsize : size;
  107. if (realsize < size) return NULL; /* overflow! */
  108. newblock = malloc(realsize); /* alloc a new block */
  109. if (newblock == NULL) return NULL;
  110. if (block) {
  111. memcpy(cast(char *, newblock)+HEADER, block, commonsize);
  112. freeblock(mc, block, oldsize); /* erase (and check) old copy */
  113. }
  114. /* initialize new part of the block with something `weird' */
  115. fillmem(cast(char *, newblock)+HEADER+commonsize, size-commonsize);
  116. mc->total += size;
  117. if (mc->total > mc->maxmem)
  118. mc->maxmem = mc->total;
  119. mc->numblocks++;
  120. setsize(newblock, size);
  121. for (i=0;i<MARKSIZE;i++)
  122. *(cast(char *, newblock)+HEADER+size+i) = cast(char, MARK+i);
  123. return cast(char *, newblock)+HEADER;
  124. }
  125. }
  126. /* }====================================================================== */
  127. /*
  128. ** {======================================================
  129. ** Functions to check memory consistency
  130. ** =======================================================
  131. */
  132. static int testobjref1 (global_State *g, GCObject *f, GCObject *t) {
  133. if (isdead(g,t)) return 0;
  134. if (g->gcstate == GCSpropagate)
  135. return !isblack(f) || !iswhite(t);
  136. else if (g->gcstate == GCSfinalize)
  137. return iswhite(f);
  138. else
  139. return 1;
  140. }
  141. static void printobj (global_State *g, GCObject *o) {
  142. int i = 0;
  143. GCObject *p;
  144. for (p = g->rootgc; p != o && p != NULL; p = gch(p)->next) i++;
  145. if (p == NULL) i = -1;
  146. printf("%d:%s(%p)-%c(%02X)", i, luaT_typenames[gch(o)->tt], (void *)o,
  147. isdead(g,o)?'d':isblack(o)?'b':iswhite(o)?'w':'g', gch(o)->marked);
  148. }
  149. static int testobjref (global_State *g, GCObject *f, GCObject *t) {
  150. int r = testobjref1(g,f,t);
  151. if (!r) {
  152. printf("%d(%02X) - ", g->gcstate, g->currentwhite);
  153. printobj(g, f);
  154. printf("\t-> ");
  155. printobj(g, t);
  156. printf("\n");
  157. }
  158. return r;
  159. }
  160. #define checkobjref(g,f,t) lua_assert(testobjref(g,f,obj2gco(t)))
  161. #define checkvalref(g,f,t) lua_assert(!iscollectable(t) || \
  162. ((ttype(t) == gch((t)->value.gc)->tt) && testobjref(g,f,gcvalue(t))))
  163. static void checktable (global_State *g, Table *h) {
  164. int i;
  165. int weakkey = 0;
  166. int weakvalue = 0;
  167. const TValue *mode;
  168. GCObject *hgc = obj2gco(h);
  169. if (h->metatable)
  170. checkobjref(g, hgc, h->metatable);
  171. mode = gfasttm(g, h->metatable, TM_MODE);
  172. if (mode && ttisstring(mode)) { /* is there a weak mode? */
  173. weakkey = (strchr(svalue(mode), 'k') != NULL);
  174. weakvalue = (strchr(svalue(mode), 'v') != NULL);
  175. }
  176. i = h->sizearray;
  177. while (i--)
  178. checkvalref(g, hgc, &h->array[i]);
  179. i = sizenode(h);
  180. while (i--) {
  181. Node *n = gnode(h, i);
  182. if (!ttisnil(gval(n))) {
  183. lua_assert(!ttisnil(gkey(n)));
  184. checkvalref(g, hgc, gkey(n));
  185. checkvalref(g, hgc, gval(n));
  186. }
  187. }
  188. }
  189. /*
  190. ** All marks are conditional because a GC may happen while the
  191. ** prototype is still being created
  192. */
  193. static void checkproto (global_State *g, Proto *f) {
  194. int i;
  195. GCObject *fgc = obj2gco(f);
  196. if (f->source) checkobjref(g, fgc, f->source);
  197. for (i=0; i<f->sizek; i++) {
  198. if (ttisstring(f->k+i))
  199. checkobjref(g, fgc, rawtsvalue(f->k+i));
  200. }
  201. for (i=0; i<f->sizeupvalues; i++) {
  202. if (f->upvalues[i])
  203. checkobjref(g, fgc, f->upvalues[i]);
  204. }
  205. for (i=0; i<f->sizep; i++) {
  206. if (f->p[i])
  207. checkobjref(g, fgc, f->p[i]);
  208. }
  209. for (i=0; i<f->sizelocvars; i++) {
  210. if (f->locvars[i].varname)
  211. checkobjref(g, fgc, f->locvars[i].varname);
  212. }
  213. }
  214. static void checkclosure (global_State *g, Closure *cl) {
  215. GCObject *clgc = obj2gco(cl);
  216. checkobjref(g, clgc, cl->l.env);
  217. if (cl->c.isC) {
  218. int i;
  219. for (i=0; i<cl->c.nupvalues; i++)
  220. checkvalref(g, clgc, &cl->c.upvalue[i]);
  221. }
  222. else {
  223. int i;
  224. lua_assert(cl->l.nupvalues == cl->l.p->nups);
  225. checkobjref(g, clgc, cl->l.p);
  226. for (i=0; i<cl->l.nupvalues; i++) {
  227. if (cl->l.upvals[i]) {
  228. lua_assert(cl->l.upvals[i]->tt == LUA_TUPVAL);
  229. checkobjref(g, clgc, cl->l.upvals[i]);
  230. }
  231. }
  232. }
  233. }
  234. static int lua_checkpc (pCallInfo ci) {
  235. if (!isLua(ci)) return 1;
  236. else {
  237. Proto *p = ci_func(ci)->l.p;
  238. return p->code <= ci->u.l.savedpc &&
  239. ci->u.l.savedpc <= p->code + p->sizecode;
  240. }
  241. }
  242. static void checkstack (global_State *g, lua_State *L1) {
  243. StkId o;
  244. CallInfo *ci;
  245. GCObject *uvo;
  246. lua_assert(!isdead(g, obj2gco(L1)));
  247. for (uvo = L1->openupval; uvo != NULL; uvo = gch(uvo)->next) {
  248. UpVal *uv = gco2uv(uvo);
  249. lua_assert(uv->v != &uv->u.value); /* must be open */
  250. lua_assert(!isblack(uvo)); /* open upvalues cannot be black */
  251. }
  252. checkliveness(g, gt(L1));
  253. for (ci = L1->ci; ci != NULL; ci = ci->previous) {
  254. lua_assert(ci->top <= L1->stack_last);
  255. lua_assert(lua_checkpc(ci));
  256. }
  257. if (L1->stack) {
  258. for (o = L1->stack; o < L1->top; o++)
  259. checkliveness(g, o);
  260. }
  261. else lua_assert(L1->stacksize == 0);
  262. }
  263. static void checkobject (global_State *g, GCObject *o) {
  264. if (isdead(g, o))
  265. /* lua_assert(issweep(g));*/
  266. { if (!issweep(g))
  267. printf(">>> %d %s %02x\n", g->gcstate, luaT_typenames[gch(o)->tt], gch(o)->marked);
  268. }
  269. else {
  270. if (g->gcstate == GCSfinalize)
  271. lua_assert(iswhite(o));
  272. switch (gch(o)->tt) {
  273. case LUA_TUPVAL: {
  274. UpVal *uv = gco2uv(o);
  275. lua_assert(uv->v == &uv->u.value); /* must be closed */
  276. lua_assert(!isgray(o)); /* closed upvalues are never gray */
  277. checkvalref(g, o, uv->v);
  278. break;
  279. }
  280. case LUA_TUSERDATA: {
  281. Table *mt = gco2u(o)->metatable;
  282. if (mt) checkobjref(g, o, mt);
  283. break;
  284. }
  285. case LUA_TTABLE: {
  286. checktable(g, gco2t(o));
  287. break;
  288. }
  289. case LUA_TTHREAD: {
  290. checkstack(g, gco2th(o));
  291. break;
  292. }
  293. case LUA_TFUNCTION: {
  294. checkclosure(g, gco2cl(o));
  295. break;
  296. }
  297. case LUA_TPROTO: {
  298. checkproto(g, gco2p(o));
  299. break;
  300. }
  301. default: lua_assert(0);
  302. }
  303. }
  304. }
  305. int lua_checkmemory (lua_State *L) {
  306. global_State *g = G(L);
  307. GCObject *o;
  308. UpVal *uv;
  309. checkstack(g, g->mainthread);
  310. for (o = g->rootgc; o != obj2gco(g->mainthread); o = gch(o)->next) {
  311. lua_assert(!testbits(o->gch.marked, bit2mask(SEPARATED, SFIXEDBIT)));
  312. checkobject(g, o);
  313. }
  314. lua_assert(testbit(o->gch.marked, SFIXEDBIT));
  315. for (o = gch(o)->next; o != NULL; o = gch(o)->next) {
  316. lua_assert(gch(o)->tt == LUA_TUSERDATA &&
  317. !isdead(g, o) &&
  318. testbit(o->gch.marked, SEPARATED));
  319. checkobject(g, o);
  320. }
  321. for (uv = g->uvhead.u.l.next; uv != &g->uvhead; uv = uv->u.l.next) {
  322. lua_assert(uv->u.l.next->u.l.prev == uv && uv->u.l.prev->u.l.next == uv);
  323. lua_assert(uv->v != &uv->u.value); /* must be open */
  324. lua_assert(!isblack(obj2gco(uv))); /* open upvalues are never black */
  325. checkvalref(g, obj2gco(uv), uv->v);
  326. }
  327. return 0;
  328. }
  329. /* }====================================================== */
  330. /*
  331. ** {======================================================
  332. ** Disassembler
  333. ** =======================================================
  334. */
  335. static char *buildop (Proto *p, int pc, char *buff) {
  336. Instruction i = p->code[pc];
  337. OpCode o = GET_OPCODE(i);
  338. const char *name = luaP_opnames[o];
  339. int line = getfuncline(p, pc);
  340. sprintf(buff, "(%4d) %4d - ", line, pc);
  341. switch (getOpMode(o)) {
  342. case iABC:
  343. sprintf(buff+strlen(buff), "%-12s%4d %4d %4d", name,
  344. GETARG_A(i), GETARG_B(i), GETARG_C(i));
  345. break;
  346. case iABx:
  347. sprintf(buff+strlen(buff), "%-12s%4d %4d", name, GETARG_A(i), GETARG_Bx(i));
  348. break;
  349. case iAsBx:
  350. sprintf(buff+strlen(buff), "%-12s%4d %4d", name, GETARG_A(i), GETARG_sBx(i));
  351. break;
  352. case iAx:
  353. sprintf(buff+strlen(buff), "%-12s%4d", name, GETARG_Ax(i));
  354. break;
  355. }
  356. return buff;
  357. }
  358. #if 0
  359. void luaI_printcode (Proto *pt, int size) {
  360. int pc;
  361. for (pc=0; pc<size; pc++) {
  362. char buff[100];
  363. printf("%s\n", buildop(pt, pc, buff));
  364. }
  365. printf("-------\n");
  366. }
  367. #endif
  368. static int listcode (lua_State *L) {
  369. int pc;
  370. Proto *p;
  371. luaL_argcheck(L, lua_isfunction(L, 1) && !lua_iscfunction(L, 1),
  372. 1, "Lua function expected");
  373. p = clvalue(obj_at(L, 1))->l.p;
  374. lua_newtable(L);
  375. setnameval(L, "maxstack", p->maxstacksize);
  376. setnameval(L, "numparams", p->numparams);
  377. for (pc=0; pc<p->sizecode; pc++) {
  378. char buff[100];
  379. lua_pushinteger(L, pc+1);
  380. lua_pushstring(L, buildop(p, pc, buff));
  381. lua_settable(L, -3);
  382. }
  383. return 1;
  384. }
  385. static int listk (lua_State *L) {
  386. Proto *p;
  387. int i;
  388. luaL_argcheck(L, lua_isfunction(L, 1) && !lua_iscfunction(L, 1),
  389. 1, "Lua function expected");
  390. p = clvalue(obj_at(L, 1))->l.p;
  391. lua_createtable(L, p->sizek, 0);
  392. for (i=0; i<p->sizek; i++) {
  393. pushobject(L, p->k+i);
  394. lua_rawseti(L, -2, i+1);
  395. }
  396. return 1;
  397. }
  398. static int listlocals (lua_State *L) {
  399. Proto *p;
  400. int pc = luaL_checkint(L, 2) - 1;
  401. int i = 0;
  402. const char *name;
  403. luaL_argcheck(L, lua_isfunction(L, 1) && !lua_iscfunction(L, 1),
  404. 1, "Lua function expected");
  405. p = clvalue(obj_at(L, 1))->l.p;
  406. while ((name = luaF_getlocalname(p, ++i, pc)) != NULL)
  407. lua_pushstring(L, name);
  408. return i-1;
  409. }
  410. /* }====================================================== */
  411. static int get_limits (lua_State *L) {
  412. lua_createtable(L, 0, 5);
  413. setnameval(L, "BITS_INT", LUAI_BITSINT);
  414. setnameval(L, "LFPF", LFIELDS_PER_FLUSH);
  415. setnameval(L, "MAXVARS", LUAI_MAXVARS);
  416. setnameval(L, "MAXSTACK", MAXSTACK);
  417. setnameval(L, "MAXUPVALUES", LUAI_MAXUPVALUES);
  418. setnameval(L, "NUM_OPCODES", NUM_OPCODES);
  419. return 1;
  420. }
  421. static int mem_query (lua_State *L) {
  422. if (lua_isnone(L, 1)) {
  423. lua_pushinteger(L, l_memcontrol.total);
  424. lua_pushinteger(L, l_memcontrol.numblocks);
  425. lua_pushinteger(L, l_memcontrol.maxmem);
  426. return 3;
  427. }
  428. else {
  429. l_memcontrol.memlimit = luaL_checkint(L, 1);
  430. return 0;
  431. }
  432. }
  433. static int settrick (lua_State *L) {
  434. l_Trick = obj_at(L, 1)->value.gc;
  435. return 0;
  436. }
  437. /*static int set_gcstate (lua_State *L) {
  438. static const char *const state[] = {"propagate", "sweep", "finalize"};
  439. return 0;
  440. }*/
  441. static int get_gccolor (lua_State *L) {
  442. TValue *o;
  443. luaL_checkany(L, 1);
  444. o = obj_at(L, 1);
  445. if (!iscollectable(o))
  446. lua_pushstring(L, "no collectable");
  447. else
  448. lua_pushstring(L, iswhite(gcvalue(o)) ? "white" :
  449. isblack(gcvalue(o)) ? "black" : "grey");
  450. return 1;
  451. }
  452. static int gcstate (lua_State *L) {
  453. switch(G(L)->gcstate) {
  454. case GCSpropagate: lua_pushstring(L, "propagate"); break;
  455. case GCSsweepstring: lua_pushstring(L, "sweep strings"); break;
  456. case GCSsweep: lua_pushstring(L, "sweep"); break;
  457. case GCSfinalize: lua_pushstring(L, "finalize"); break;
  458. default: lua_assert(0);
  459. }
  460. return 1;
  461. }
  462. static int hash_query (lua_State *L) {
  463. if (lua_isnone(L, 2)) {
  464. luaL_argcheck(L, lua_type(L, 1) == LUA_TSTRING, 1, "string expected");
  465. lua_pushinteger(L, tsvalue(obj_at(L, 1))->hash);
  466. }
  467. else {
  468. TValue *o = obj_at(L, 1);
  469. Table *t;
  470. luaL_checktype(L, 2, LUA_TTABLE);
  471. t = hvalue(obj_at(L, 2));
  472. lua_pushinteger(L, luaH_mainposition(t, o) - t->node);
  473. }
  474. return 1;
  475. }
  476. static int stacklevel (lua_State *L) {
  477. unsigned long a = 0;
  478. lua_pushinteger(L, (L->top - L->stack));
  479. lua_pushinteger(L, (L->stack_last - L->stack));
  480. lua_pushinteger(L, L->nci);
  481. lua_pushinteger(L, (unsigned long)&a);
  482. return 5;
  483. }
  484. static int table_query (lua_State *L) {
  485. const Table *t;
  486. int i = luaL_optint(L, 2, -1);
  487. luaL_checktype(L, 1, LUA_TTABLE);
  488. t = hvalue(obj_at(L, 1));
  489. if (i == -1) {
  490. lua_pushinteger(L, t->sizearray);
  491. lua_pushinteger(L, luaH_isdummy(t->node) ? 0 : sizenode(t));
  492. lua_pushinteger(L, t->lastfree - t->node);
  493. }
  494. else if (i < t->sizearray) {
  495. lua_pushinteger(L, i);
  496. pushobject(L, &t->array[i]);
  497. lua_pushnil(L);
  498. }
  499. else if ((i -= t->sizearray) < sizenode(t)) {
  500. if (!ttisnil(gval(gnode(t, i))) ||
  501. ttisnil(gkey(gnode(t, i))) ||
  502. ttisnumber(gkey(gnode(t, i)))) {
  503. pushobject(L, key2tval(gnode(t, i)));
  504. }
  505. else
  506. lua_pushliteral(L, "<undef>");
  507. pushobject(L, gval(gnode(t, i)));
  508. if (gnext(&t->node[i]))
  509. lua_pushinteger(L, gnext(&t->node[i]) - t->node);
  510. else
  511. lua_pushnil(L);
  512. }
  513. return 3;
  514. }
  515. static int string_query (lua_State *L) {
  516. stringtable *tb = &G(L)->strt;
  517. int s = luaL_optint(L, 2, 0) - 1;
  518. if (s==-1) {
  519. lua_pushinteger(L ,tb->nuse);
  520. lua_pushinteger(L ,tb->size);
  521. return 2;
  522. }
  523. else if (s < tb->size) {
  524. GCObject *ts;
  525. int n = 0;
  526. for (ts = tb->hash[s]; ts; ts = gch(ts)->next) {
  527. setsvalue2s(L, L->top, gco2ts(ts));
  528. incr_top(L);
  529. n++;
  530. }
  531. return n;
  532. }
  533. return 0;
  534. }
  535. static int tref (lua_State *L) {
  536. int level = lua_gettop(L);
  537. int lock = luaL_optint(L, 2, 1);
  538. luaL_checkany(L, 1);
  539. lua_pushvalue(L, 1);
  540. lua_pushinteger(L, lua_ref(L, lock));
  541. lua_assert(lua_gettop(L) == level+1); /* +1 for result */
  542. return 1;
  543. }
  544. static int getref (lua_State *L) {
  545. int level = lua_gettop(L);
  546. lua_getref(L, luaL_checkint(L, 1));
  547. lua_assert(lua_gettop(L) == level+1);
  548. return 1;
  549. }
  550. static int unref (lua_State *L) {
  551. int level = lua_gettop(L);
  552. lua_unref(L, luaL_checkint(L, 1));
  553. lua_assert(lua_gettop(L) == level);
  554. return 0;
  555. }
  556. static int upvalue (lua_State *L) {
  557. int n = luaL_checkint(L, 2);
  558. luaL_checktype(L, 1, LUA_TFUNCTION);
  559. if (lua_isnone(L, 3)) {
  560. const char *name = lua_getupvalue(L, 1, n);
  561. if (name == NULL) return 0;
  562. lua_pushstring(L, name);
  563. return 2;
  564. }
  565. else {
  566. const char *name = lua_setupvalue(L, 1, n);
  567. lua_pushstring(L, name);
  568. return 1;
  569. }
  570. }
  571. static int newuserdata (lua_State *L) {
  572. size_t size = luaL_checkint(L, 1);
  573. char *p = cast(char *, lua_newuserdata(L, size));
  574. while (size--) *p++ = '\0';
  575. return 1;
  576. }
  577. static int pushuserdata (lua_State *L) {
  578. lua_pushlightuserdata(L, cast(void *, luaL_checkint(L, 1)));
  579. return 1;
  580. }
  581. static int udataval (lua_State *L) {
  582. lua_pushinteger(L, cast(long, lua_touserdata(L, 1)));
  583. return 1;
  584. }
  585. static int doonnewstack (lua_State *L) {
  586. lua_State *L1 = lua_newthread(L);
  587. size_t l;
  588. const char *s = luaL_checklstring(L, 1, &l);
  589. int status = luaL_loadbuffer(L1, s, l, s);
  590. lua_State *ML = lua_mainthread(L1);
  591. lua_assert(L1 != L && ML != L1 && lua_mainthread(L) == ML);
  592. if (status == LUA_OK)
  593. status = lua_pcall(L1, 0, 0, 0);
  594. lua_pushinteger(L, status);
  595. return 1;
  596. }
  597. static int s2d (lua_State *L) {
  598. lua_pushnumber(L, *cast(const double *, luaL_checkstring(L, 1)));
  599. return 1;
  600. }
  601. static int d2s (lua_State *L) {
  602. double d = luaL_checknumber(L, 1);
  603. lua_pushlstring(L, cast(char *, &d), sizeof(d));
  604. return 1;
  605. }
  606. static int num2int (lua_State *L) {
  607. lua_pushinteger(L, lua_tointeger(L, 1));
  608. return 1;
  609. }
  610. static int newstate (lua_State *L) {
  611. void *ud;
  612. lua_Alloc f = lua_getallocf(L, &ud);
  613. lua_State *L1 = lua_newstate(f, ud);
  614. if (L1) {
  615. lua_atpanic(L1, tpanic);
  616. lua_pushlightuserdata(L, L1);
  617. }
  618. else
  619. lua_pushnil(L);
  620. return 1;
  621. }
  622. static lua_State *getstate (lua_State *L) {
  623. lua_State *L1 = cast(lua_State *, lua_touserdata(L, 1));
  624. luaL_argcheck(L, L1 != NULL, 1, "state expected");
  625. return L1;
  626. }
  627. static int loadlib (lua_State *L) {
  628. static const luaL_Reg libs[] = {
  629. {"baselibopen", luaopen_base},
  630. {"dblibopen", luaopen_debug},
  631. {"iolibopen", luaopen_io},
  632. {"mathlibopen", luaopen_math},
  633. {"strlibopen", luaopen_string},
  634. {"tablibopen", luaopen_table},
  635. {"packageopen", luaopen_package},
  636. {NULL, NULL}
  637. };
  638. lua_State *L1 = getstate(L);
  639. lua_pushvalue(L1, LUA_GLOBALSINDEX);
  640. luaL_register(L1, NULL, libs);
  641. return 0;
  642. }
  643. static int closestate (lua_State *L) {
  644. lua_State *L1 = getstate(L);
  645. lua_close(L1);
  646. return 0;
  647. }
  648. static int doremote (lua_State *L) {
  649. lua_State *L1 = getstate(L);
  650. size_t lcode;
  651. const char *code = luaL_checklstring(L, 2, &lcode);
  652. int status;
  653. lua_settop(L1, 0);
  654. status = luaL_loadbuffer(L1, code, lcode, code);
  655. if (status == LUA_OK)
  656. status = lua_pcall(L1, 0, LUA_MULTRET, 0);
  657. if (status != LUA_OK) {
  658. lua_pushnil(L);
  659. lua_pushinteger(L, status);
  660. lua_pushstring(L, lua_tostring(L1, -1));
  661. return 3;
  662. }
  663. else {
  664. int i = 0;
  665. while (!lua_isnone(L1, ++i))
  666. lua_pushstring(L, lua_tostring(L1, i));
  667. lua_pop(L1, i-1);
  668. return i-1;
  669. }
  670. }
  671. static int int2fb_aux (lua_State *L) {
  672. int b = luaO_int2fb(luaL_checkint(L, 1));
  673. lua_pushinteger(L, b);
  674. lua_pushinteger(L, luaO_fb2int(b));
  675. return 2;
  676. }
  677. /*
  678. ** {======================================================
  679. ** function to test the API with C. It interprets a kind of assembler
  680. ** language with calls to the API, so the test can be driven by Lua code
  681. ** =======================================================
  682. */
  683. static const char *const delimits = " \t\n,;";
  684. static void skip (const char **pc) {
  685. while (**pc != '\0' && strchr(delimits, **pc)) (*pc)++;
  686. }
  687. static int getnum_aux (lua_State *L, const char **pc) {
  688. int res = 0;
  689. int sig = 1;
  690. skip(pc);
  691. if (**pc == '.') {
  692. res = cast_int(lua_tonumber(L, -1));
  693. lua_pop(L, 1);
  694. (*pc)++;
  695. return res;
  696. }
  697. else if (**pc == '-') {
  698. sig = -1;
  699. (*pc)++;
  700. }
  701. while (lisdigit(cast(unsigned char, **pc))) res = res*10 + (*(*pc)++) - '0';
  702. return sig*res;
  703. }
  704. static const char *getname_aux (char *buff, const char **pc) {
  705. int i = 0;
  706. skip(pc);
  707. while (**pc != '\0' && !strchr(delimits, **pc))
  708. buff[i++] = *(*pc)++;
  709. buff[i] = '\0';
  710. return buff;
  711. }
  712. static int getindex_aux (lua_State *L, const char **pc) {
  713. skip(pc);
  714. switch (*(*pc)++) {
  715. case 'R': return LUA_REGISTRYINDEX;
  716. case 'G': return LUA_GLOBALSINDEX;
  717. case 'E': return LUA_ENVIRONINDEX;
  718. case 'U': return lua_upvalueindex(getnum_aux(L, pc));
  719. default: (*pc)--; return getnum_aux(L, pc);
  720. }
  721. }
  722. #define EQ(s1) (strcmp(s1, inst) == 0)
  723. #define getnum (getnum_aux(L, &pc))
  724. #define getname (getname_aux(buff, &pc))
  725. #define getindex (getindex_aux(L, &pc))
  726. static int testC (lua_State *L);
  727. static int runC (lua_State *L, lua_State *L1, const char *pc) {
  728. char buff[30];
  729. for (;;) {
  730. const char *inst = getname;
  731. if EQ("") return 0;
  732. else if EQ("isnumber") {
  733. lua_pushboolean(L1, lua_isnumber(L1, getindex));
  734. }
  735. else if EQ("isstring") {
  736. lua_pushboolean(L1, lua_isstring(L1, getindex));
  737. }
  738. else if EQ("istable") {
  739. lua_pushboolean(L1, lua_istable(L1, getindex));
  740. }
  741. else if EQ("iscfunction") {
  742. lua_pushboolean(L1, lua_iscfunction(L1, getindex));
  743. }
  744. else if EQ("isfunction") {
  745. lua_pushboolean(L1, lua_isfunction(L1, getindex));
  746. }
  747. else if EQ("isuserdata") {
  748. lua_pushboolean(L1, lua_isuserdata(L1, getindex));
  749. }
  750. else if EQ("isudataval") {
  751. lua_pushboolean(L1, lua_islightuserdata(L1, getindex));
  752. }
  753. else if EQ("isnil") {
  754. lua_pushboolean(L1, lua_isnil(L1, getindex));
  755. }
  756. else if EQ("isnull") {
  757. lua_pushboolean(L1, lua_isnone(L1, getindex));
  758. }
  759. else if EQ("tonumber") {
  760. lua_pushnumber(L1, lua_tonumber(L1, getindex));
  761. }
  762. else if EQ("tostring") {
  763. const char *s = lua_tostring(L1, getindex);
  764. const char *s1 = lua_pushstring(L1, s);
  765. lua_assert((s == NULL && s1 == NULL) || (strcmp)(s, s1) == 0);
  766. }
  767. else if EQ("objsize") {
  768. lua_pushinteger(L1, lua_objlen(L1, getindex));
  769. }
  770. else if EQ("tocfunction") {
  771. lua_pushcfunction(L1, lua_tocfunction(L1, getindex));
  772. }
  773. else if EQ("return") {
  774. return getnum;
  775. }
  776. else if EQ("gettop") {
  777. lua_pushinteger(L1, lua_gettop(L1));
  778. }
  779. else if EQ("settop") {
  780. lua_settop(L1, getnum);
  781. }
  782. else if EQ("pop") {
  783. lua_pop(L1, getnum);
  784. }
  785. else if EQ("pushnum") {
  786. lua_pushinteger(L1, getnum);
  787. }
  788. else if EQ("pushstring") {
  789. lua_pushstring(L1, getname);
  790. }
  791. else if EQ("pushnil") {
  792. lua_pushnil(L1);
  793. }
  794. else if EQ("pushbool") {
  795. lua_pushboolean(L1, getnum);
  796. }
  797. else if EQ("newtable") {
  798. lua_newtable(L1);
  799. }
  800. else if EQ("newuserdata") {
  801. lua_newuserdata(L1, getnum);
  802. }
  803. else if EQ("tobool") {
  804. lua_pushboolean(L1, lua_toboolean(L1, getindex));
  805. }
  806. else if EQ("pushvalue") {
  807. lua_pushvalue(L1, getindex);
  808. }
  809. else if EQ("pushcclosure") {
  810. lua_pushcclosure(L1, testC, getnum);
  811. }
  812. else if EQ("remove") {
  813. lua_remove(L1, getnum);
  814. }
  815. else if EQ("insert") {
  816. lua_insert(L1, getnum);
  817. }
  818. else if EQ("replace") {
  819. lua_replace(L1, getindex);
  820. }
  821. else if EQ("gettable") {
  822. lua_gettable(L1, getindex);
  823. }
  824. else if EQ("settable") {
  825. lua_settable(L1, getindex);
  826. }
  827. else if EQ("next") {
  828. lua_next(L1, -2);
  829. }
  830. else if EQ("concat") {
  831. lua_concat(L1, getnum);
  832. }
  833. else if EQ("arith") {
  834. static char ops[] = "+-*/%^_";
  835. int op;
  836. skip(&pc);
  837. op = strchr(ops, *pc++) - ops;
  838. lua_arith(L, op);
  839. }
  840. else if EQ("compare") {
  841. int a = getindex;
  842. int b = getindex;
  843. lua_pushboolean(L1, lua_compare(L1, a, b, getnum));
  844. }
  845. else if EQ("call") {
  846. int narg = getnum;
  847. int nres = getnum;
  848. lua_call(L1, narg, nres);
  849. }
  850. else if EQ("pcall") {
  851. int narg = getnum;
  852. int nres = getnum;
  853. lua_pcall(L1, narg, nres, 0);
  854. }
  855. else if EQ("loadstring") {
  856. size_t sl;
  857. const char *s = luaL_checklstring(L1, getnum, &sl);
  858. luaL_loadbuffer(L1, s, sl, s);
  859. }
  860. else if EQ("loadfile") {
  861. luaL_loadfile(L1, luaL_checkstring(L1, getnum));
  862. }
  863. else if EQ("setmetatable") {
  864. lua_setmetatable(L1, getindex);
  865. }
  866. else if EQ("getmetatable") {
  867. if (lua_getmetatable(L1, getindex) == 0)
  868. lua_pushnil(L1);
  869. }
  870. else if EQ("type") {
  871. lua_pushstring(L1, luaL_typename(L1, getnum));
  872. }
  873. else if EQ("getn") {
  874. int i = getindex;
  875. lua_pushinteger(L1, lua_objlen(L1, i));
  876. }
  877. else if EQ("checkstack") {
  878. if (!lua_checkstack(L1, getnum))
  879. luaL_error(L, "C stack overflow");
  880. }
  881. else if EQ("newmetatable") {
  882. lua_pushboolean(L1, luaL_newmetatable(L1, getname));
  883. }
  884. else if EQ("testudata") {
  885. int i = getindex;
  886. lua_pushboolean(L1, luaL_testudata(L1, i, getname) != NULL);
  887. }
  888. else if EQ("gsub") {
  889. int a = getnum; int b = getnum; int c = getnum;
  890. luaL_gsub(L1, lua_tostring(L1, a),
  891. lua_tostring(L, b),
  892. lua_tostring(L, c));
  893. }
  894. else if EQ("throw") {
  895. #if defined(__cplusplus)
  896. static struct X { int x; } x;
  897. throw x;
  898. #else
  899. luaL_error(L1, "C++");
  900. #endif
  901. break;
  902. }
  903. else luaL_error(L, "unknown instruction %s", buff);
  904. }
  905. return 0;
  906. }
  907. static int testC (lua_State *L) {
  908. lua_State *L1;
  909. const char *pc;
  910. if (lua_isuserdata(L, 1)) {
  911. L1 = getstate(L);
  912. pc = luaL_checkstring(L, 2);
  913. }
  914. else if (lua_isthread(L, 1)) {
  915. L1 = lua_tothread(L, 1);
  916. pc = luaL_checkstring(L, 2);
  917. }
  918. else {
  919. L1 = L;
  920. pc = luaL_checkstring(L, 1);
  921. }
  922. return runC(L, L1, pc);
  923. }
  924. static int Cfunc (lua_State *L) {
  925. return runC(L, L, lua_tostring(L, lua_upvalueindex(1)));
  926. }
  927. static int makeCfunc (lua_State *L) {
  928. luaL_checkstring(L, 1);
  929. lua_settop(L, 1);
  930. lua_pushcclosure(L, Cfunc, 1);
  931. return 1;
  932. }
  933. /* }====================================================== */
  934. /*
  935. ** {======================================================
  936. ** tests for yield inside hooks
  937. ** =======================================================
  938. */
  939. static void yieldf (lua_State *L, lua_Debug *ar) {
  940. UNUSED(ar);
  941. lua_yield(L, 0);
  942. }
  943. static int setyhook (lua_State *L) {
  944. if (lua_isnoneornil(L, 1))
  945. lua_sethook(L, NULL, 0, 0); /* turn off hooks */
  946. else {
  947. const char *smask = luaL_checkstring(L, 1);
  948. int count = luaL_optint(L, 2, 0);
  949. int mask = 0;
  950. if (strchr(smask, 'l')) mask |= LUA_MASKLINE;
  951. if (count > 0) mask |= LUA_MASKCOUNT;
  952. lua_sethook(L, yieldf, mask, count);
  953. }
  954. return 0;
  955. }
  956. static int coresume (lua_State *L) {
  957. int status;
  958. lua_State *co = lua_tothread(L, 1);
  959. luaL_argcheck(L, co, 1, "coroutine expected");
  960. status = lua_resume(co, 0);
  961. if (status != LUA_OK && status != LUA_YIELD) {
  962. lua_pushboolean(L, 0);
  963. lua_insert(L, -2);
  964. return 2; /* return false + error message */
  965. }
  966. else {
  967. lua_pushboolean(L, 1);
  968. return 1;
  969. }
  970. }
  971. /* }====================================================== */
  972. static const struct luaL_Reg tests_funcs[] = {
  973. {"checkmemory", lua_checkmemory},
  974. {"closestate", closestate},
  975. {"d2s", d2s},
  976. {"doonnewstack", doonnewstack},
  977. {"doremote", doremote},
  978. {"gccolor", get_gccolor},
  979. {"gcstate", gcstate},
  980. {"getref", getref},
  981. {"hash", hash_query},
  982. {"int2fb", int2fb_aux},
  983. {"limits", get_limits},
  984. {"listcode", listcode},
  985. {"listk", listk},
  986. {"listlocals", listlocals},
  987. {"loadlib", loadlib},
  988. {"newstate", newstate},
  989. {"newuserdata", newuserdata},
  990. {"num2int", num2int},
  991. {"pushuserdata", pushuserdata},
  992. {"querystr", string_query},
  993. {"querytab", table_query},
  994. {"ref", tref},
  995. {"resume", coresume},
  996. {"s2d", s2d},
  997. {"setyhook", setyhook},
  998. {"stacklevel", stacklevel},
  999. {"testC", testC},
  1000. {"makeCfunc", makeCfunc},
  1001. {"totalmem", mem_query},
  1002. {"trick", settrick},
  1003. {"udataval", udataval},
  1004. {"unref", unref},
  1005. {"upvalue", upvalue},
  1006. {NULL, NULL}
  1007. };
  1008. static void checkfinalmem (void) {
  1009. lua_assert(l_memcontrol.numblocks == 0);
  1010. lua_assert(l_memcontrol.total == 0);
  1011. }
  1012. int luaB_opentests (lua_State *L) {
  1013. void *ud;
  1014. lua_atpanic(L, &tpanic);
  1015. atexit(checkfinalmem);
  1016. lua_assert(lua_getallocf(L, &ud) == debug_realloc);
  1017. lua_assert(ud == cast(void *, &l_memcontrol));
  1018. lua_setallocf(L, lua_getallocf(L, NULL), ud);
  1019. luaL_register(L, "T", tests_funcs);
  1020. return 0;
  1021. }
  1022. #endif