ltests.c 28 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150
  1. /*
  2. ** $Id: ltests.c,v 2.56 2008/10/28 12:54:25 roberto Exp roberto $
  3. ** Internal Module for Debugging of the Lua Implementation
  4. ** See Copyright Notice in lua.h
  5. */
  6. #include <ctype.h>
  7. #include <limits.h>
  8. #include <stdio.h>
  9. #include <stdlib.h>
  10. #include <string.h>
  11. #define ltests_c
  12. #define LUA_CORE
  13. #include "lua.h"
  14. #include "lapi.h"
  15. #include "lauxlib.h"
  16. #include "lcode.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->base+(k) - 1)
  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. /*
  43. ** {======================================================================
  44. ** Controlled version for realloc.
  45. ** =======================================================================
  46. */
  47. #define MARK 0x55 /* 01010101 (a nice pattern) */
  48. #ifndef EXTERNMEMCHECK
  49. /* full memory check */
  50. #define HEADER (sizeof(L_Umaxalign)) /* ensures maximum alignment for HEADER */
  51. #define MARKSIZE 16 /* size of marks after each block */
  52. #define blockhead(b) (cast(char *, b) - HEADER)
  53. #define setsize(newblock, size) (*cast(size_t *, newblock) = size)
  54. #define checkblocksize(b, size) (size == (*cast(size_t *, blockhead(b))))
  55. #define fillmem(mem,size) memset(mem, -MARK, size)
  56. #else
  57. /* external memory check: don't do it twice */
  58. #define HEADER 0
  59. #define MARKSIZE 0
  60. #define blockhead(b) (b)
  61. #define setsize(newblock, size) /* empty */
  62. #define checkblocksize(b,size) (1)
  63. #define fillmem(mem,size) /* empty */
  64. #endif
  65. Memcontrol l_memcontrol = {0L, 0L, 0L, 0L};
  66. static void *checkblock (void *block, size_t size) {
  67. void *b = blockhead(block);
  68. int i;
  69. for (i=0;i<MARKSIZE;i++)
  70. lua_assert(*(cast(char *, b)+HEADER+size+i) == MARK+i); /* corrupted block? */
  71. return b;
  72. }
  73. static void freeblock (Memcontrol *mc, void *block, size_t size) {
  74. if (block) {
  75. lua_assert(checkblocksize(block, size));
  76. block = checkblock(block, size);
  77. fillmem(block, size+HEADER+MARKSIZE); /* erase block */
  78. free(block); /* free original block */
  79. mc->numblocks--;
  80. mc->total -= size;
  81. }
  82. }
  83. void *debug_realloc (void *ud, void *block, size_t oldsize, size_t size) {
  84. Memcontrol *mc = cast(Memcontrol *, ud);
  85. lua_assert((oldsize == 0) ? block == NULL :
  86. block && checkblocksize(block, oldsize));
  87. if (mc->memlimit == 0) { /* first time? */
  88. char *limit = getenv("MEMLIMIT"); /* initialize memory limit */
  89. mc->memlimit = limit ? strtoul(limit, NULL, 10) : ULONG_MAX;
  90. }
  91. if (size == 0) {
  92. freeblock(mc, block, oldsize);
  93. return NULL;
  94. }
  95. else if (size > oldsize && mc->total+size-oldsize > mc->memlimit)
  96. return NULL; /* to test memory allocation errors */
  97. else {
  98. void *newblock;
  99. int i;
  100. size_t realsize = HEADER+size+MARKSIZE;
  101. size_t commonsize = (oldsize < size) ? oldsize : size;
  102. if (realsize < size) return NULL; /* overflow! */
  103. newblock = malloc(realsize); /* alloc a new block */
  104. if (newblock == NULL) return NULL;
  105. if (block) {
  106. memcpy(cast(char *, newblock)+HEADER, block, commonsize);
  107. freeblock(mc, block, oldsize); /* erase (and check) old copy */
  108. }
  109. /* initialize new part of the block with something `weird' */
  110. fillmem(cast(char *, newblock)+HEADER+commonsize, size-commonsize);
  111. mc->total += size;
  112. if (mc->total > mc->maxmem)
  113. mc->maxmem = mc->total;
  114. mc->numblocks++;
  115. setsize(newblock, size);
  116. for (i=0;i<MARKSIZE;i++)
  117. *(cast(char *, newblock)+HEADER+size+i) = cast(char, MARK+i);
  118. return cast(char *, newblock)+HEADER;
  119. }
  120. }
  121. /* }====================================================================== */
  122. /*
  123. ** {======================================================
  124. ** Functions to check memory consistency
  125. ** =======================================================
  126. */
  127. static int testobjref1 (global_State *g, GCObject *f, GCObject *t) {
  128. if (isdead(g,t)) return 0;
  129. if (g->gcstate == GCSpropagate)
  130. return !isblack(f) || !iswhite(t);
  131. else if (g->gcstate == GCSfinalize)
  132. return iswhite(f);
  133. else
  134. return 1;
  135. }
  136. static void printobj (global_State *g, GCObject *o) {
  137. int i = 0;
  138. GCObject *p;
  139. for (p = g->rootgc; p != o && p != NULL; p = gch(p)->next) i++;
  140. if (p == NULL) i = -1;
  141. printf("%d:%s(%p)-%c(%02X)", i, luaT_typenames[gch(o)->tt], (void *)o,
  142. isdead(g,o)?'d':isblack(o)?'b':iswhite(o)?'w':'g', gch(o)->marked);
  143. }
  144. static int testobjref (global_State *g, GCObject *f, GCObject *t) {
  145. int r = testobjref1(g,f,t);
  146. if (!r) {
  147. printf("%d(%02X) - ", g->gcstate, g->currentwhite);
  148. printobj(g, f);
  149. printf("\t-> ");
  150. printobj(g, t);
  151. printf("\n");
  152. }
  153. return r;
  154. }
  155. #define checkobjref(g,f,t) lua_assert(testobjref(g,f,obj2gco(t)))
  156. #define checkvalref(g,f,t) lua_assert(!iscollectable(t) || \
  157. ((ttype(t) == gch((t)->value.gc)->tt) && testobjref(g,f,gcvalue(t))))
  158. static void checktable (global_State *g, Table *h) {
  159. int i;
  160. int weakkey = 0;
  161. int weakvalue = 0;
  162. const TValue *mode;
  163. GCObject *hgc = obj2gco(h);
  164. if (h->metatable)
  165. checkobjref(g, hgc, h->metatable);
  166. mode = gfasttm(g, h->metatable, TM_MODE);
  167. if (mode && ttisstring(mode)) { /* is there a weak mode? */
  168. weakkey = (strchr(svalue(mode), 'k') != NULL);
  169. weakvalue = (strchr(svalue(mode), 'v') != NULL);
  170. }
  171. i = h->sizearray;
  172. while (i--)
  173. checkvalref(g, hgc, &h->array[i]);
  174. i = sizenode(h);
  175. while (i--) {
  176. Node *n = gnode(h, i);
  177. if (!ttisnil(gval(n))) {
  178. lua_assert(!ttisnil(gkey(n)));
  179. checkvalref(g, hgc, gkey(n));
  180. checkvalref(g, hgc, gval(n));
  181. }
  182. }
  183. }
  184. /*
  185. ** All marks are conditional because a GC may happen while the
  186. ** prototype is still being created
  187. */
  188. static void checkproto (global_State *g, Proto *f) {
  189. int i;
  190. GCObject *fgc = obj2gco(f);
  191. if (f->source) checkobjref(g, fgc, f->source);
  192. for (i=0; i<f->sizek; i++) {
  193. if (ttisstring(f->k+i))
  194. checkobjref(g, fgc, rawtsvalue(f->k+i));
  195. }
  196. for (i=0; i<f->sizeupvalues; i++) {
  197. if (f->upvalues[i])
  198. checkobjref(g, fgc, f->upvalues[i]);
  199. }
  200. for (i=0; i<f->sizep; i++) {
  201. if (f->p[i])
  202. checkobjref(g, fgc, f->p[i]);
  203. }
  204. for (i=0; i<f->sizelocvars; i++) {
  205. if (f->locvars[i].varname)
  206. checkobjref(g, fgc, f->locvars[i].varname);
  207. }
  208. }
  209. static void checkclosure (global_State *g, Closure *cl) {
  210. GCObject *clgc = obj2gco(cl);
  211. checkobjref(g, clgc, cl->l.env);
  212. if (cl->c.isC) {
  213. int i;
  214. for (i=0; i<cl->c.nupvalues; i++)
  215. checkvalref(g, clgc, &cl->c.upvalue[i]);
  216. }
  217. else {
  218. int i;
  219. lua_assert(cl->l.nupvalues == cl->l.p->nups);
  220. checkobjref(g, clgc, cl->l.p);
  221. for (i=0; i<cl->l.nupvalues; i++) {
  222. if (cl->l.upvals[i]) {
  223. lua_assert(cl->l.upvals[i]->tt == LUA_TUPVAL);
  224. checkobjref(g, clgc, cl->l.upvals[i]);
  225. }
  226. }
  227. }
  228. }
  229. static void checkstack (global_State *g, lua_State *L1) {
  230. StkId o;
  231. CallInfo *ci;
  232. GCObject *uvo;
  233. lua_assert(!isdead(g, obj2gco(L1)));
  234. for (uvo = L1->openupval; uvo != NULL; uvo = gch(uvo)->next) {
  235. UpVal *uv = gco2uv(uvo);
  236. lua_assert(uv->v != &uv->u.value); /* must be open */
  237. lua_assert(!isblack(uvo)); /* open upvalues cannot be black */
  238. }
  239. checkliveness(g, gt(L1));
  240. if (L1->base_ci) {
  241. for (ci = L1->base_ci; ci <= L1->ci; ci++) {
  242. lua_assert(ci->top <= L1->stack_last);
  243. lua_assert(lua_checkpc(L1, ci));
  244. }
  245. }
  246. else lua_assert(L1->size_ci == 0);
  247. if (L1->stack) {
  248. for (o = L1->stack; o < L1->top; o++)
  249. checkliveness(g, o);
  250. }
  251. else lua_assert(L1->stacksize == 0);
  252. }
  253. static void checkobject (global_State *g, GCObject *o) {
  254. if (isdead(g, o))
  255. /* lua_assert(issweep(g));*/
  256. { if (!issweep(g))
  257. printf(">>> %d %s %02x\n", g->gcstate, luaT_typenames[gch(o)->tt], gch(o)->marked);
  258. }
  259. else {
  260. if (g->gcstate == GCSfinalize)
  261. lua_assert(iswhite(o));
  262. switch (gch(o)->tt) {
  263. case LUA_TUPVAL: {
  264. UpVal *uv = gco2uv(o);
  265. lua_assert(uv->v == &uv->u.value); /* must be closed */
  266. lua_assert(!isgray(o)); /* closed upvalues are never gray */
  267. checkvalref(g, o, uv->v);
  268. break;
  269. }
  270. case LUA_TUSERDATA: {
  271. Table *mt = gco2u(o)->metatable;
  272. if (mt) checkobjref(g, o, mt);
  273. break;
  274. }
  275. case LUA_TTABLE: {
  276. checktable(g, gco2t(o));
  277. break;
  278. }
  279. case LUA_TTHREAD: {
  280. checkstack(g, gco2th(o));
  281. break;
  282. }
  283. case LUA_TFUNCTION: {
  284. checkclosure(g, gco2cl(o));
  285. break;
  286. }
  287. case LUA_TPROTO: {
  288. checkproto(g, gco2p(o));
  289. break;
  290. }
  291. default: lua_assert(0);
  292. }
  293. }
  294. }
  295. int lua_checkpc (lua_State *L, pCallInfo ci) {
  296. if (ci == L->base_ci || !isLua(ci)) return 1;
  297. else {
  298. Proto *p = ci_func(ci)->l.p;
  299. if (ci < L->ci)
  300. return p->code <= ci->savedpc && ci->savedpc <= p->code + p->sizecode;
  301. else
  302. return p->code <= L->savedpc && L->savedpc <= p->code + p->sizecode;
  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 = getline(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 = (L->base)->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->ci - L->base_ci));
  481. lua_pushinteger(L, (L->end_ci - L->base_ci));
  482. lua_pushinteger(L, (unsigned long)&a);
  483. return 5;
  484. }
  485. static int table_query (lua_State *L) {
  486. const Table *t;
  487. int i = luaL_optint(L, 2, -1);
  488. luaL_checktype(L, 1, LUA_TTABLE);
  489. t = hvalue(obj_at(L, 1));
  490. if (i == -1) {
  491. lua_pushinteger(L, t->sizearray);
  492. lua_pushinteger(L, luaH_isdummy(t->node) ? 0 : sizenode(t));
  493. lua_pushinteger(L, t->lastfree - t->node);
  494. }
  495. else if (i < t->sizearray) {
  496. lua_pushinteger(L, i);
  497. pushobject(L, &t->array[i]);
  498. lua_pushnil(L);
  499. }
  500. else if ((i -= t->sizearray) < sizenode(t)) {
  501. if (!ttisnil(gval(gnode(t, i))) ||
  502. ttisnil(gkey(gnode(t, i))) ||
  503. ttisnumber(gkey(gnode(t, i)))) {
  504. pushobject(L, key2tval(gnode(t, i)));
  505. }
  506. else
  507. lua_pushliteral(L, "<undef>");
  508. pushobject(L, gval(gnode(t, i)));
  509. if (gnext(&t->node[i]))
  510. lua_pushinteger(L, gnext(&t->node[i]) - t->node);
  511. else
  512. lua_pushnil(L);
  513. }
  514. return 3;
  515. }
  516. static int string_query (lua_State *L) {
  517. stringtable *tb = &G(L)->strt;
  518. int s = luaL_optint(L, 2, 0) - 1;
  519. if (s==-1) {
  520. lua_pushinteger(L ,tb->nuse);
  521. lua_pushinteger(L ,tb->size);
  522. return 2;
  523. }
  524. else if (s < tb->size) {
  525. GCObject *ts;
  526. int n = 0;
  527. for (ts = tb->hash[s]; ts; ts = gch(ts)->next) {
  528. setsvalue2s(L, L->top, gco2ts(ts));
  529. incr_top(L);
  530. n++;
  531. }
  532. return n;
  533. }
  534. return 0;
  535. }
  536. static int tref (lua_State *L) {
  537. int level = lua_gettop(L);
  538. int lock = luaL_optint(L, 2, 1);
  539. luaL_checkany(L, 1);
  540. lua_pushvalue(L, 1);
  541. lua_pushinteger(L, lua_ref(L, lock));
  542. lua_assert(lua_gettop(L) == level+1); /* +1 for result */
  543. return 1;
  544. }
  545. static int getref (lua_State *L) {
  546. int level = lua_gettop(L);
  547. lua_getref(L, luaL_checkint(L, 1));
  548. lua_assert(lua_gettop(L) == level+1);
  549. return 1;
  550. }
  551. static int unref (lua_State *L) {
  552. int level = lua_gettop(L);
  553. lua_unref(L, luaL_checkint(L, 1));
  554. lua_assert(lua_gettop(L) == level);
  555. return 0;
  556. }
  557. static int upvalue (lua_State *L) {
  558. int n = luaL_checkint(L, 2);
  559. luaL_checktype(L, 1, LUA_TFUNCTION);
  560. if (lua_isnone(L, 3)) {
  561. const char *name = lua_getupvalue(L, 1, n);
  562. if (name == NULL) return 0;
  563. lua_pushstring(L, name);
  564. return 2;
  565. }
  566. else {
  567. const char *name = lua_setupvalue(L, 1, n);
  568. lua_pushstring(L, name);
  569. return 1;
  570. }
  571. }
  572. static int newuserdata (lua_State *L) {
  573. size_t size = luaL_checkint(L, 1);
  574. char *p = cast(char *, lua_newuserdata(L, size));
  575. while (size--) *p++ = '\0';
  576. return 1;
  577. }
  578. static int pushuserdata (lua_State *L) {
  579. lua_pushlightuserdata(L, cast(void *, luaL_checkint(L, 1)));
  580. return 1;
  581. }
  582. static int udataval (lua_State *L) {
  583. lua_pushinteger(L, cast(long, lua_touserdata(L, 1)));
  584. return 1;
  585. }
  586. static int doonnewstack (lua_State *L) {
  587. lua_State *L1 = lua_newthread(L);
  588. size_t l;
  589. const char *s = luaL_checklstring(L, 1, &l);
  590. int status = luaL_loadbuffer(L1, s, l, s);
  591. if (status == LUA_OK)
  592. status = lua_pcall(L1, 0, 0, 0);
  593. lua_pushinteger(L, status);
  594. return 1;
  595. }
  596. static int s2d (lua_State *L) {
  597. lua_pushnumber(L, *cast(const double *, luaL_checkstring(L, 1)));
  598. return 1;
  599. }
  600. static int d2s (lua_State *L) {
  601. double d = luaL_checknumber(L, 1);
  602. lua_pushlstring(L, cast(char *, &d), sizeof(d));
  603. return 1;
  604. }
  605. static int num2int (lua_State *L) {
  606. lua_pushinteger(L, lua_tointeger(L, 1));
  607. return 1;
  608. }
  609. static int newstate (lua_State *L) {
  610. void *ud;
  611. lua_Alloc f = lua_getallocf(L, &ud);
  612. lua_State *L1 = lua_newstate(f, ud);
  613. if (L1)
  614. lua_pushlightuserdata(L, L1);
  615. else
  616. lua_pushnil(L);
  617. return 1;
  618. }
  619. static lua_State *getstate (lua_State *L) {
  620. lua_State *L1 = cast(lua_State *, lua_touserdata(L, 1));
  621. luaL_argcheck(L, L1 != NULL, 1, "state expected");
  622. return L1;
  623. }
  624. static int loadlib (lua_State *L) {
  625. static const luaL_Reg libs[] = {
  626. {"baselibopen", luaopen_base},
  627. {"dblibopen", luaopen_debug},
  628. {"iolibopen", luaopen_io},
  629. {"mathlibopen", luaopen_math},
  630. {"strlibopen", luaopen_string},
  631. {"tablibopen", luaopen_table},
  632. {"packageopen", luaopen_package},
  633. {NULL, NULL}
  634. };
  635. lua_State *L1 = getstate(L);
  636. lua_pushvalue(L1, LUA_GLOBALSINDEX);
  637. luaL_register(L1, NULL, libs);
  638. return 0;
  639. }
  640. static int closestate (lua_State *L) {
  641. lua_State *L1 = getstate(L);
  642. lua_close(L1);
  643. return 0;
  644. }
  645. static int doremote (lua_State *L) {
  646. lua_State *L1 = getstate(L);
  647. size_t lcode;
  648. const char *code = luaL_checklstring(L, 2, &lcode);
  649. int status;
  650. lua_settop(L1, 0);
  651. status = luaL_loadbuffer(L1, code, lcode, code);
  652. if (status == LUA_OK)
  653. status = lua_pcall(L1, 0, LUA_MULTRET, 0);
  654. if (status != LUA_OK) {
  655. lua_pushnil(L);
  656. lua_pushinteger(L, status);
  657. lua_pushstring(L, lua_tostring(L1, -1));
  658. return 3;
  659. }
  660. else {
  661. int i = 0;
  662. while (!lua_isnone(L1, ++i))
  663. lua_pushstring(L, lua_tostring(L1, i));
  664. lua_pop(L1, i-1);
  665. return i-1;
  666. }
  667. }
  668. static int int2fb_aux (lua_State *L) {
  669. int b = luaO_int2fb(luaL_checkint(L, 1));
  670. lua_pushinteger(L, b);
  671. lua_pushinteger(L, luaO_fb2int(b));
  672. return 2;
  673. }
  674. /*
  675. ** {======================================================
  676. ** function to test the API with C. It interprets a kind of assembler
  677. ** language with calls to the API, so the test can be driven by Lua code
  678. ** =======================================================
  679. */
  680. static const char *const delimits = " \t\n,;";
  681. static void skip (const char **pc) {
  682. while (**pc != '\0' && strchr(delimits, **pc)) (*pc)++;
  683. }
  684. static int getnum_aux (lua_State *L, const char **pc) {
  685. int res = 0;
  686. int sig = 1;
  687. skip(pc);
  688. if (**pc == '.') {
  689. res = cast_int(lua_tonumber(L, -1));
  690. lua_pop(L, 1);
  691. (*pc)++;
  692. return res;
  693. }
  694. else if (**pc == '-') {
  695. sig = -1;
  696. (*pc)++;
  697. }
  698. while (isdigit(cast_int(**pc))) res = res*10 + (*(*pc)++) - '0';
  699. return sig*res;
  700. }
  701. static const char *getname_aux (char *buff, const char **pc) {
  702. int i = 0;
  703. skip(pc);
  704. while (**pc != '\0' && !strchr(delimits, **pc))
  705. buff[i++] = *(*pc)++;
  706. buff[i] = '\0';
  707. return buff;
  708. }
  709. static int getindex_aux (lua_State *L, const char **pc) {
  710. skip(pc);
  711. switch (*(*pc)++) {
  712. case 'R': return LUA_REGISTRYINDEX;
  713. case 'G': return LUA_GLOBALSINDEX;
  714. case 'E': return LUA_ENVIRONINDEX;
  715. case 'U': return lua_upvalueindex(getnum_aux(L, pc));
  716. default: (*pc)--; return getnum_aux(L, pc);
  717. }
  718. }
  719. #define EQ(s1) (strcmp(s1, inst) == 0)
  720. #define getnum (getnum_aux(L, &pc))
  721. #define getname (getname_aux(buff, &pc))
  722. #define getindex (getindex_aux(L, &pc))
  723. static int testC (lua_State *L) {
  724. char buff[30];
  725. lua_State *L1;
  726. const char *pc;
  727. if (lua_isuserdata(L, 1)) {
  728. L1 = getstate(L);
  729. pc = luaL_checkstring(L, 2);
  730. }
  731. else {
  732. L1 = L;
  733. pc = luaL_checkstring(L, 1);
  734. }
  735. for (;;) {
  736. const char *inst = getname;
  737. if EQ("") return 0;
  738. else if EQ("isnumber") {
  739. lua_pushboolean(L1, lua_isnumber(L1, getindex));
  740. }
  741. else if EQ("isstring") {
  742. lua_pushboolean(L1, lua_isstring(L1, getindex));
  743. }
  744. else if EQ("istable") {
  745. lua_pushboolean(L1, lua_istable(L1, getindex));
  746. }
  747. else if EQ("iscfunction") {
  748. lua_pushboolean(L1, lua_iscfunction(L1, getindex));
  749. }
  750. else if EQ("isfunction") {
  751. lua_pushboolean(L1, lua_isfunction(L1, getindex));
  752. }
  753. else if EQ("isuserdata") {
  754. lua_pushboolean(L1, lua_isuserdata(L1, getindex));
  755. }
  756. else if EQ("isudataval") {
  757. lua_pushboolean(L1, lua_islightuserdata(L1, getindex));
  758. }
  759. else if EQ("isnil") {
  760. lua_pushboolean(L1, lua_isnil(L1, getindex));
  761. }
  762. else if EQ("isnull") {
  763. lua_pushboolean(L1, lua_isnone(L1, getindex));
  764. }
  765. else if EQ("tonumber") {
  766. lua_pushnumber(L1, lua_tonumber(L1, getindex));
  767. }
  768. else if EQ("tostring") {
  769. const char *s = lua_tostring(L1, getindex);
  770. const char *s1 = lua_pushstring(L1, s);
  771. lua_assert((s == NULL && s1 == NULL) || (strcmp)(s, s1) == 0);
  772. }
  773. else if EQ("objsize") {
  774. lua_pushinteger(L1, lua_objlen(L1, getindex));
  775. }
  776. else if EQ("tocfunction") {
  777. lua_pushcfunction(L1, lua_tocfunction(L1, getindex));
  778. }
  779. else if EQ("return") {
  780. return getnum;
  781. }
  782. else if EQ("gettop") {
  783. lua_pushinteger(L1, lua_gettop(L1));
  784. }
  785. else if EQ("settop") {
  786. lua_settop(L1, getnum);
  787. }
  788. else if EQ("pop") {
  789. lua_pop(L1, getnum);
  790. }
  791. else if EQ("pushnum") {
  792. lua_pushinteger(L1, getnum);
  793. }
  794. else if EQ("pushstring") {
  795. lua_pushstring(L1, getname);
  796. }
  797. else if EQ("pushnil") {
  798. lua_pushnil(L1);
  799. }
  800. else if EQ("pushbool") {
  801. lua_pushboolean(L1, getnum);
  802. }
  803. else if EQ("newtable") {
  804. lua_newtable(L1);
  805. }
  806. else if EQ("newuserdata") {
  807. lua_newuserdata(L1, getnum);
  808. }
  809. else if EQ("tobool") {
  810. lua_pushboolean(L1, lua_toboolean(L1, getindex));
  811. }
  812. else if EQ("pushvalue") {
  813. lua_pushvalue(L1, getindex);
  814. }
  815. else if EQ("pushcclosure") {
  816. lua_pushcclosure(L1, testC, getnum);
  817. }
  818. else if EQ("remove") {
  819. lua_remove(L1, getnum);
  820. }
  821. else if EQ("insert") {
  822. lua_insert(L1, getnum);
  823. }
  824. else if EQ("replace") {
  825. lua_replace(L1, getindex);
  826. }
  827. else if EQ("gettable") {
  828. lua_gettable(L1, getindex);
  829. }
  830. else if EQ("settable") {
  831. lua_settable(L1, getindex);
  832. }
  833. else if EQ("next") {
  834. lua_next(L1, -2);
  835. }
  836. else if EQ("concat") {
  837. lua_concat(L1, getnum);
  838. }
  839. else if EQ("lessthan") {
  840. int a = getindex;
  841. lua_pushboolean(L1, lua_lessthan(L1, a, getindex));
  842. }
  843. else if EQ("equal") {
  844. int a = getindex;
  845. lua_pushboolean(L1, lua_equal(L1, a, getindex));
  846. }
  847. else if EQ("rawcall") {
  848. int narg = getnum;
  849. int nres = getnum;
  850. lua_call(L1, narg, nres);
  851. }
  852. else if EQ("call") {
  853. int narg = getnum;
  854. int nres = getnum;
  855. lua_pcall(L1, narg, nres, 0);
  856. }
  857. else if EQ("loadstring") {
  858. size_t sl;
  859. const char *s = luaL_checklstring(L1, getnum, &sl);
  860. luaL_loadbuffer(L1, s, sl, s);
  861. }
  862. else if EQ("loadfile") {
  863. luaL_loadfile(L1, luaL_checkstring(L1, getnum));
  864. }
  865. else if EQ("setmetatable") {
  866. lua_setmetatable(L1, getindex);
  867. }
  868. else if EQ("getmetatable") {
  869. if (lua_getmetatable(L1, getindex) == 0)
  870. lua_pushnil(L1);
  871. }
  872. else if EQ("type") {
  873. lua_pushstring(L1, luaL_typename(L1, getnum));
  874. }
  875. else if EQ("getn") {
  876. int i = getindex;
  877. lua_pushinteger(L1, lua_objlen(L1, i));
  878. }
  879. else if EQ("checkstack") {
  880. if (!lua_checkstack(L1, getnum))
  881. luaL_error(L, "C stack overflow");
  882. }
  883. else if EQ("newmetatable") {
  884. lua_pushboolean(L1, luaL_newmetatable(L1, getname));
  885. }
  886. else if EQ("testudata") {
  887. int i = getindex;
  888. lua_pushboolean(L1, luaL_testudata(L1, i, getname) != NULL);
  889. }
  890. else if EQ("gsub") {
  891. int a = getnum; int b = getnum; int c = getnum;
  892. luaL_gsub(L1, lua_tostring(L1, a),
  893. lua_tostring(L, b),
  894. lua_tostring(L, c));
  895. }
  896. else if EQ("throw") {
  897. #if defined(__cplusplus)
  898. static struct X { int x; } x;
  899. throw x;
  900. #else
  901. luaL_error(L1, "C++");
  902. #endif
  903. break;
  904. }
  905. else luaL_error(L, "unknown instruction %s", buff);
  906. }
  907. return 0;
  908. }
  909. /* }====================================================== */
  910. /*
  911. ** {======================================================
  912. ** tests for yield inside hooks
  913. ** =======================================================
  914. */
  915. static void yieldf (lua_State *L, lua_Debug *ar) {
  916. UNUSED(ar);
  917. lua_yield(L, 0);
  918. }
  919. static int setyhook (lua_State *L) {
  920. if (lua_isnoneornil(L, 1))
  921. lua_sethook(L, NULL, 0, 0); /* turn off hooks */
  922. else {
  923. const char *smask = luaL_checkstring(L, 1);
  924. int count = luaL_optint(L, 2, 0);
  925. int mask = 0;
  926. if (strchr(smask, 'l')) mask |= LUA_MASKLINE;
  927. if (count > 0) mask |= LUA_MASKCOUNT;
  928. lua_sethook(L, yieldf, mask, count);
  929. }
  930. return 0;
  931. }
  932. static int coresume (lua_State *L) {
  933. int status;
  934. lua_State *co = lua_tothread(L, 1);
  935. luaL_argcheck(L, co, 1, "coroutine expected");
  936. status = lua_resume(co, 0);
  937. if (status != LUA_OK && status != LUA_YIELD) {
  938. lua_pushboolean(L, 0);
  939. lua_insert(L, -2);
  940. return 2; /* return false + error message */
  941. }
  942. else {
  943. lua_pushboolean(L, 1);
  944. return 1;
  945. }
  946. }
  947. /* }====================================================== */
  948. static const struct luaL_Reg tests_funcs[] = {
  949. {"checkmemory", lua_checkmemory},
  950. {"closestate", closestate},
  951. {"d2s", d2s},
  952. {"doonnewstack", doonnewstack},
  953. {"doremote", doremote},
  954. {"gccolor", get_gccolor},
  955. {"gcstate", gcstate},
  956. {"getref", getref},
  957. {"hash", hash_query},
  958. {"int2fb", int2fb_aux},
  959. {"limits", get_limits},
  960. {"listcode", listcode},
  961. {"listk", listk},
  962. {"listlocals", listlocals},
  963. {"loadlib", loadlib},
  964. {"newstate", newstate},
  965. {"newuserdata", newuserdata},
  966. {"num2int", num2int},
  967. {"pushuserdata", pushuserdata},
  968. {"querystr", string_query},
  969. {"querytab", table_query},
  970. {"ref", tref},
  971. {"resume", coresume},
  972. {"s2d", s2d},
  973. {"setyhook", setyhook},
  974. {"stacklevel", stacklevel},
  975. {"testC", testC},
  976. {"totalmem", mem_query},
  977. {"trick", settrick},
  978. {"udataval", udataval},
  979. {"unref", unref},
  980. {"upvalue", upvalue},
  981. {NULL, NULL}
  982. };
  983. static void checkfinalmem (void) {
  984. lua_assert(l_memcontrol.numblocks == 0);
  985. lua_assert(l_memcontrol.total == 0);
  986. }
  987. int luaB_opentests (lua_State *L) {
  988. void *ud;
  989. atexit(checkfinalmem);
  990. lua_assert(lua_getallocf(L, &ud) == debug_realloc);
  991. lua_assert(ud == cast(void *, &l_memcontrol));
  992. lua_setallocf(L, lua_getallocf(L, NULL), ud);
  993. luaL_register(L, "T", tests_funcs);
  994. return 0;
  995. }
  996. #endif