ltests.c 47 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858
  1. /*
  2. ** $Id: ltests.c $
  3. ** Internal Module for Debugging of the Lua Implementation
  4. ** See Copyright Notice in lua.h
  5. */
  6. #define ltests_c
  7. #define LUA_CORE
  8. #include "lprefix.h"
  9. #include <limits.h>
  10. #include <setjmp.h>
  11. #include <stdio.h>
  12. #include <stdlib.h>
  13. #include <string.h>
  14. #include "lua.h"
  15. #include "lapi.h"
  16. #include "lauxlib.h"
  17. #include "lcode.h"
  18. #include "lctype.h"
  19. #include "ldebug.h"
  20. #include "ldo.h"
  21. #include "lfunc.h"
  22. #include "lmem.h"
  23. #include "lopcodes.h"
  24. #include "lopnames.h"
  25. #include "lstate.h"
  26. #include "lstring.h"
  27. #include "ltable.h"
  28. #include "lualib.h"
  29. /*
  30. ** The whole module only makes sense with LUA_DEBUG on
  31. */
  32. #if defined(LUA_DEBUG)
  33. void *l_Trick = 0;
  34. #define obj_at(L,k) s2v(L->ci->func + (k))
  35. static int runC (lua_State *L, lua_State *L1, const char *pc);
  36. static void setnameval (lua_State *L, const char *name, int val) {
  37. lua_pushinteger(L, val);
  38. lua_setfield(L, -2, name);
  39. }
  40. static void pushobject (lua_State *L, const TValue *o) {
  41. setobj2s(L, L->top, o);
  42. api_incr_top(L);
  43. }
  44. static void badexit (const char *fmt, const char *s) {
  45. fprintf(stderr, fmt, s);
  46. /* avoid assertion failures when exiting */
  47. l_memcontrol.numblocks = l_memcontrol.total = 0;
  48. exit(EXIT_FAILURE);
  49. }
  50. static int tpanic (lua_State *L) {
  51. return (badexit("PANIC: unprotected error in call to Lua API (%s)\n",
  52. lua_tostring(L, -1)),
  53. 0); /* do not return to Lua */
  54. }
  55. /*
  56. ** Warning function for tests. Fist, it concatenates all parts of
  57. ** a warning in buffer 'buff'. Then, it has three modes:
  58. ** - 0.normal: messages starting with '#' are shown on standard output;
  59. ** - other messages abort the tests (they represent real warning
  60. ** conditions; the standard tests should not generate these conditions
  61. ** unexpectedly);
  62. ** - 1.allow: all messages are shown;
  63. ** - 2.store: all warnings go to the global '_WARN';
  64. */
  65. static void warnf (void *ud, const char *msg, int tocont) {
  66. static char buff[200] = ""; /* should be enough for tests... */
  67. static int onoff = 1;
  68. static int mode = 0; /* start in normal mode */
  69. static int lasttocont = 0;
  70. if (!lasttocont && !tocont && *msg == '@') { /* control message? */
  71. if (buff[0] != '\0')
  72. badexit("Control warning during warning: %s\naborting...\n", msg);
  73. if (strcmp(msg, "@off") == 0)
  74. onoff = 0;
  75. else if (strcmp(msg, "@on") == 0)
  76. onoff = 1;
  77. else if (strcmp(msg, "@normal") == 0)
  78. mode = 0;
  79. else if (strcmp(msg, "@allow") == 0)
  80. mode = 1;
  81. else if (strcmp(msg, "@store") == 0)
  82. mode = 2;
  83. else
  84. badexit("Invalid control warning in test mode: %s\naborting...\n", msg);
  85. return;
  86. }
  87. lasttocont = tocont;
  88. if (strlen(msg) >= sizeof(buff) - strlen(buff))
  89. badexit("%s", "warnf-buffer overflow");
  90. strcat(buff, msg); /* add new message to current warning */
  91. if (!tocont) { /* message finished? */
  92. switch (mode) {
  93. case 0: { /* normal */
  94. if (buff[0] != '#' && onoff) /* unexpected warning? */
  95. badexit("Unexpected warning in test mode: %s\naborting...\n", buff);
  96. /* else */ /* FALLTHROUGH */
  97. }
  98. case 1: { /* allow */
  99. if (onoff)
  100. fprintf(stderr, "Lua warning: %s\n", buff); /* print warning */
  101. break;
  102. }
  103. case 2: { /* store */
  104. lua_State *L = cast(lua_State *, ud);
  105. lua_unlock(L);
  106. lua_pushstring(L, buff);
  107. lua_setglobal(L, "_WARN"); /* assign message to global '_WARN' */
  108. lua_lock(L);
  109. buff[0] = '\0'; /* prepare buffer for next warning */
  110. break;
  111. }
  112. }
  113. buff[0] = '\0'; /* prepare buffer for next warning */
  114. }
  115. }
  116. /*
  117. ** {======================================================================
  118. ** Controlled version for realloc.
  119. ** =======================================================================
  120. */
  121. #define MARK 0x55 /* 01010101 (a nice pattern) */
  122. typedef union Header {
  123. LUAI_MAXALIGN;
  124. struct {
  125. size_t size;
  126. int type;
  127. } d;
  128. } Header;
  129. #if !defined(EXTERNMEMCHECK)
  130. /* full memory check */
  131. #define MARKSIZE 16 /* size of marks after each block */
  132. #define fillmem(mem,size) memset(mem, -MARK, size)
  133. #else
  134. /* external memory check: don't do it twice */
  135. #define MARKSIZE 0
  136. #define fillmem(mem,size) /* empty */
  137. #endif
  138. Memcontrol l_memcontrol =
  139. {0UL, 0UL, 0UL, 0UL, (~0UL), {0UL, 0UL, 0UL, 0UL, 0UL, 0UL, 0UL, 0UL, 0UL}};
  140. static void freeblock (Memcontrol *mc, Header *block) {
  141. if (block) {
  142. size_t size = block->d.size;
  143. int i;
  144. for (i = 0; i < MARKSIZE; i++) /* check marks after block */
  145. lua_assert(*(cast_charp(block + 1) + size + i) == MARK);
  146. mc->objcount[block->d.type]--;
  147. fillmem(block, sizeof(Header) + size + MARKSIZE); /* erase block */
  148. free(block); /* actually free block */
  149. mc->numblocks--; /* update counts */
  150. mc->total -= size;
  151. }
  152. }
  153. void *debug_realloc (void *ud, void *b, size_t oldsize, size_t size) {
  154. Memcontrol *mc = cast(Memcontrol *, ud);
  155. Header *block = cast(Header *, b);
  156. int type;
  157. if (mc->memlimit == 0) { /* first time? */
  158. char *limit = getenv("MEMLIMIT"); /* initialize memory limit */
  159. mc->memlimit = limit ? strtoul(limit, NULL, 10) : ULONG_MAX;
  160. }
  161. if (block == NULL) {
  162. type = (oldsize < LUA_NUMTAGS) ? oldsize : 0;
  163. oldsize = 0;
  164. }
  165. else {
  166. block--; /* go to real header */
  167. type = block->d.type;
  168. lua_assert(oldsize == block->d.size);
  169. }
  170. if (size == 0) {
  171. freeblock(mc, block);
  172. return NULL;
  173. }
  174. if (mc->countlimit != ~0UL && size != oldsize) { /* count limit in use? */
  175. if (mc->countlimit == 0)
  176. return NULL; /* fake a memory allocation error */
  177. mc->countlimit--;
  178. }
  179. if (size > oldsize && mc->total+size-oldsize > mc->memlimit)
  180. return NULL; /* fake a memory allocation error */
  181. else {
  182. Header *newblock;
  183. int i;
  184. size_t commonsize = (oldsize < size) ? oldsize : size;
  185. size_t realsize = sizeof(Header) + size + MARKSIZE;
  186. if (realsize < size) return NULL; /* arithmetic overflow! */
  187. newblock = cast(Header *, malloc(realsize)); /* alloc a new block */
  188. if (newblock == NULL)
  189. return NULL; /* really out of memory? */
  190. if (block) {
  191. memcpy(newblock + 1, block + 1, commonsize); /* copy old contents */
  192. freeblock(mc, block); /* erase (and check) old copy */
  193. }
  194. /* initialize new part of the block with something weird */
  195. fillmem(cast_charp(newblock + 1) + commonsize, size - commonsize);
  196. /* initialize marks after block */
  197. for (i = 0; i < MARKSIZE; i++)
  198. *(cast_charp(newblock + 1) + size + i) = MARK;
  199. newblock->d.size = size;
  200. newblock->d.type = type;
  201. mc->total += size;
  202. if (mc->total > mc->maxmem)
  203. mc->maxmem = mc->total;
  204. mc->numblocks++;
  205. mc->objcount[type]++;
  206. return newblock + 1;
  207. }
  208. }
  209. /* }====================================================================== */
  210. /*
  211. ** {======================================================
  212. ** Functions to check memory consistency
  213. ** =======================================================
  214. */
  215. /*
  216. ** Check GC invariants. For incremental mode, a black object cannot
  217. ** point to a white one. For generational mode, really old objects
  218. ** cannot point to young objects. Both old1 and touched2 objects
  219. ** cannot point to new objects (but can point to survivals).
  220. ** (Threads and open upvalues, despite being marked "really old",
  221. ** continue to be visited in all collections, and therefore can point to
  222. ** new objects. They, and only they, are old but gray.)
  223. */
  224. static int testobjref1 (global_State *g, GCObject *f, GCObject *t) {
  225. if (isdead(g,t)) return 0;
  226. if (issweepphase(g))
  227. return 1; /* no invariants */
  228. else if (g->gckind == KGC_INC)
  229. return !(isblack(f) && iswhite(t)); /* basic incremental invariant */
  230. else { /* generational mode */
  231. if ((getage(f) == G_OLD && isblack(f)) && !isold(t))
  232. return 0;
  233. if (((getage(f) == G_OLD1 || getage(f) == G_TOUCHED2) && isblack(f)) &&
  234. getage(t) == G_NEW)
  235. return 0;
  236. return 1;
  237. }
  238. }
  239. static void printobj (global_State *g, GCObject *o) {
  240. printf("||%s(%p)-%c%c(%02X)||",
  241. ttypename(novariant(o->tt)), (void *)o,
  242. isdead(g,o) ? 'd' : isblack(o) ? 'b' : iswhite(o) ? 'w' : 'g',
  243. "ns01oTt"[getage(o)], o->marked);
  244. if (o->tt == LUA_TSHRSTR || o->tt == LUA_TLNGSTR)
  245. printf(" '%s'", getstr(gco2ts(o)));
  246. }
  247. static int testobjref (global_State *g, GCObject *f, GCObject *t) {
  248. int r1 = testobjref1(g, f, t);
  249. if (!r1) {
  250. printf("%d(%02X) - ", g->gcstate, g->currentwhite);
  251. printobj(g, f);
  252. printf(" -> ");
  253. printobj(g, t);
  254. printf("\n");
  255. }
  256. return r1;
  257. }
  258. #define checkobjref(g,f,t) \
  259. { if (t) lua_longassert(testobjref(g,f,obj2gco(t))); }
  260. static void checkvalref (global_State *g, GCObject *f, const TValue *t) {
  261. lua_assert(!iscollectable(t) ||
  262. (righttt(t) && testobjref(g, f, gcvalue(t))));
  263. }
  264. static void checktable (global_State *g, Table *h) {
  265. unsigned int i;
  266. unsigned int asize = luaH_realasize(h);
  267. Node *n, *limit = gnode(h, sizenode(h));
  268. GCObject *hgc = obj2gco(h);
  269. checkobjref(g, hgc, h->metatable);
  270. for (i = 0; i < asize; i++)
  271. checkvalref(g, hgc, &h->array[i]);
  272. for (n = gnode(h, 0); n < limit; n++) {
  273. if (!isempty(gval(n))) {
  274. TValue k;
  275. getnodekey(g->mainthread, &k, n);
  276. lua_assert(!keyisnil(n));
  277. checkvalref(g, hgc, &k);
  278. checkvalref(g, hgc, gval(n));
  279. }
  280. }
  281. }
  282. static void checkudata (global_State *g, Udata *u) {
  283. int i;
  284. GCObject *hgc = obj2gco(u);
  285. checkobjref(g, hgc, u->metatable);
  286. for (i = 0; i < u->nuvalue; i++)
  287. checkvalref(g, hgc, &u->uv[i].uv);
  288. }
  289. /*
  290. ** All marks are conditional because a GC may happen while the
  291. ** prototype is still being created
  292. */
  293. static void checkproto (global_State *g, Proto *f) {
  294. int i;
  295. GCObject *fgc = obj2gco(f);
  296. checkobjref(g, fgc, f->source);
  297. for (i=0; i<f->sizek; i++) {
  298. if (ttisstring(f->k + i))
  299. checkobjref(g, fgc, tsvalue(f->k + i));
  300. }
  301. for (i=0; i<f->sizeupvalues; i++)
  302. checkobjref(g, fgc, f->upvalues[i].name);
  303. for (i=0; i<f->sizep; i++)
  304. checkobjref(g, fgc, f->p[i]);
  305. for (i=0; i<f->sizelocvars; i++)
  306. checkobjref(g, fgc, f->locvars[i].varname);
  307. }
  308. static void checkCclosure (global_State *g, CClosure *cl) {
  309. GCObject *clgc = obj2gco(cl);
  310. int i;
  311. for (i = 0; i < cl->nupvalues; i++)
  312. checkvalref(g, clgc, &cl->upvalue[i]);
  313. }
  314. static void checkLclosure (global_State *g, LClosure *cl) {
  315. GCObject *clgc = obj2gco(cl);
  316. int i;
  317. checkobjref(g, clgc, cl->p);
  318. for (i=0; i<cl->nupvalues; i++) {
  319. UpVal *uv = cl->upvals[i];
  320. if (uv) {
  321. checkobjref(g, clgc, uv);
  322. if (!upisopen(uv))
  323. checkvalref(g, obj2gco(uv), uv->v);
  324. }
  325. }
  326. }
  327. static int lua_checkpc (CallInfo *ci) {
  328. if (!isLua(ci)) return 1;
  329. else {
  330. StkId f = ci->func;
  331. Proto *p = clLvalue(s2v(f))->p;
  332. return p->code <= ci->u.l.savedpc &&
  333. ci->u.l.savedpc <= p->code + p->sizecode;
  334. }
  335. }
  336. static void checkstack (global_State *g, lua_State *L1) {
  337. StkId o;
  338. CallInfo *ci;
  339. UpVal *uv;
  340. lua_assert(!isdead(g, L1));
  341. for (uv = L1->openupval; uv != NULL; uv = uv->u.open.next)
  342. lua_assert(upisopen(uv)); /* must be open */
  343. for (ci = L1->ci; ci != NULL; ci = ci->previous) {
  344. lua_assert(ci->top <= L1->stack_last);
  345. lua_assert(lua_checkpc(ci));
  346. }
  347. if (L1->stack) { /* complete thread? */
  348. for (o = L1->stack; o < L1->stack_last + EXTRA_STACK; o++)
  349. checkliveness(L1, s2v(o)); /* entire stack must have valid values */
  350. }
  351. else lua_assert(L1->stacksize == 0);
  352. }
  353. static void checkrefs (global_State *g, GCObject *o) {
  354. switch (o->tt) {
  355. case LUA_TUSERDATA: {
  356. checkudata(g, gco2u(o));
  357. break;
  358. }
  359. case LUA_TUPVAL: {
  360. checkvalref(g, o, gco2upv(o)->v);
  361. break;
  362. }
  363. case LUA_TTABLE: {
  364. checktable(g, gco2t(o));
  365. break;
  366. }
  367. case LUA_TTHREAD: {
  368. checkstack(g, gco2th(o));
  369. break;
  370. }
  371. case LUA_TLCL: {
  372. checkLclosure(g, gco2lcl(o));
  373. break;
  374. }
  375. case LUA_TCCL: {
  376. checkCclosure(g, gco2ccl(o));
  377. break;
  378. }
  379. case LUA_TPROTO: {
  380. checkproto(g, gco2p(o));
  381. break;
  382. }
  383. case LUA_TSHRSTR:
  384. case LUA_TLNGSTR: {
  385. lua_assert(!isgray(o)); /* strings are never gray */
  386. break;
  387. }
  388. default: lua_assert(0);
  389. }
  390. }
  391. /*
  392. ** Check consistency of an object:
  393. ** - Dead objects can only happen in the 'allgc' list during a sweep
  394. ** phase (controled by the caller through 'maybedead').
  395. ** - During pause, all objects must be white.
  396. ** - In generational mode:
  397. ** * objects must be old enough for their lists ('listage').
  398. ** * old objects cannot be white.
  399. ** * old objects must be black, except for 'touched1', 'old0',
  400. ** threads, and open upvalues.
  401. */
  402. static void checkobject (global_State *g, GCObject *o, int maybedead,
  403. int listage) {
  404. if (isdead(g, o))
  405. lua_assert(maybedead);
  406. else {
  407. lua_assert(g->gcstate != GCSpause || iswhite(o));
  408. if (g->gckind == KGC_GEN) { /* generational mode? */
  409. lua_assert(getage(o) >= listage);
  410. lua_assert(!iswhite(o) || !isold(o));
  411. if (isold(o)) {
  412. lua_assert(isblack(o) ||
  413. getage(o) == G_TOUCHED1 ||
  414. getage(o) == G_OLD0 ||
  415. o->tt == LUA_TTHREAD ||
  416. (o->tt == LUA_TUPVAL && upisopen(gco2upv(o))));
  417. }
  418. }
  419. checkrefs(g, o);
  420. }
  421. }
  422. static void checkgraylist (global_State *g, GCObject *o) {
  423. ((void)g); /* better to keep it available if we need to print an object */
  424. while (o) {
  425. lua_assert(isgray(o) || getage(o) == G_TOUCHED2);
  426. switch (o->tt) {
  427. case LUA_TTABLE: o = gco2t(o)->gclist; break;
  428. case LUA_TLCL: o = gco2lcl(o)->gclist; break;
  429. case LUA_TCCL: o = gco2ccl(o)->gclist; break;
  430. case LUA_TTHREAD: o = gco2th(o)->gclist; break;
  431. case LUA_TPROTO: o = gco2p(o)->gclist; break;
  432. default: lua_assert(0); /* other objects cannot be in a gray list */
  433. }
  434. }
  435. }
  436. /*
  437. ** Check objects in gray lists.
  438. */
  439. static void checkgrays (global_State *g) {
  440. if (!keepinvariant(g)) return;
  441. checkgraylist(g, g->gray);
  442. checkgraylist(g, g->grayagain);
  443. checkgraylist(g, g->weak);
  444. checkgraylist(g, g->ephemeron);
  445. }
  446. static void checklist (global_State *g, int maybedead, int tof,
  447. GCObject *newl, GCObject *survival, GCObject *old, GCObject *reallyold) {
  448. GCObject *o;
  449. for (o = newl; o != survival; o = o->next) {
  450. checkobject(g, o, maybedead, G_NEW);
  451. lua_assert(!tof == !tofinalize(o));
  452. }
  453. for (o = survival; o != old; o = o->next) {
  454. checkobject(g, o, 0, G_SURVIVAL);
  455. lua_assert(!tof == !tofinalize(o));
  456. }
  457. for (o = old; o != reallyold; o = o->next) {
  458. checkobject(g, o, 0, G_OLD1);
  459. lua_assert(!tof == !tofinalize(o));
  460. }
  461. for (o = reallyold; o != NULL; o = o->next) {
  462. checkobject(g, o, 0, G_OLD);
  463. lua_assert(!tof == !tofinalize(o));
  464. }
  465. }
  466. int lua_checkmemory (lua_State *L) {
  467. global_State *g = G(L);
  468. GCObject *o;
  469. int maybedead;
  470. if (keepinvariant(g)) {
  471. lua_assert(!iswhite(g->mainthread));
  472. lua_assert(!iswhite(gcvalue(&g->l_registry)));
  473. }
  474. lua_assert(!isdead(g, gcvalue(&g->l_registry)));
  475. lua_assert(g->sweepgc == NULL || issweepphase(g));
  476. checkgrays(g);
  477. /* check 'fixedgc' list */
  478. for (o = g->fixedgc; o != NULL; o = o->next) {
  479. lua_assert(o->tt == LUA_TSHRSTR && isgray(o) && getage(o) == G_OLD);
  480. }
  481. /* check 'allgc' list */
  482. maybedead = (GCSatomic < g->gcstate && g->gcstate <= GCSswpallgc);
  483. checklist(g, maybedead, 0, g->allgc, g->survival, g->old, g->reallyold);
  484. /* check 'finobj' list */
  485. checklist(g, 0, 1, g->finobj, g->finobjsur, g->finobjold, g->finobjrold);
  486. /* check 'tobefnz' list */
  487. for (o = g->tobefnz; o != NULL; o = o->next) {
  488. checkobject(g, o, 0, G_NEW);
  489. lua_assert(tofinalize(o));
  490. lua_assert(o->tt == LUA_TUSERDATA || o->tt == LUA_TTABLE);
  491. }
  492. return 0;
  493. }
  494. /* }====================================================== */
  495. /*
  496. ** {======================================================
  497. ** Disassembler
  498. ** =======================================================
  499. */
  500. static char *buildop (Proto *p, int pc, char *buff) {
  501. char *obuff = buff;
  502. Instruction i = p->code[pc];
  503. OpCode o = GET_OPCODE(i);
  504. const char *name = opnames[o];
  505. int line = luaG_getfuncline(p, pc);
  506. int lineinfo = (p->lineinfo != NULL) ? p->lineinfo[pc] : 0;
  507. if (lineinfo == ABSLINEINFO)
  508. buff += sprintf(buff, "(__");
  509. else
  510. buff += sprintf(buff, "(%2d", lineinfo);
  511. buff += sprintf(buff, " - %4d) %4d - ", line, pc);
  512. switch (getOpMode(o)) {
  513. case iABC:
  514. sprintf(buff, "%-12s%4d %4d %4d%s", name,
  515. GETARG_A(i), GETARG_B(i), GETARG_C(i),
  516. GETARG_k(i) ? " (k)" : "");
  517. break;
  518. case iABx:
  519. sprintf(buff, "%-12s%4d %4d", name, GETARG_A(i), GETARG_Bx(i));
  520. break;
  521. case iAsBx:
  522. sprintf(buff, "%-12s%4d %4d", name, GETARG_A(i), GETARG_sBx(i));
  523. break;
  524. case iAx:
  525. sprintf(buff, "%-12s%4d", name, GETARG_Ax(i));
  526. break;
  527. case isJ:
  528. sprintf(buff, "%-12s%4d", name, GETARG_sJ(i));
  529. break;
  530. }
  531. return obuff;
  532. }
  533. #if 0
  534. void luaI_printcode (Proto *pt, int size) {
  535. int pc;
  536. for (pc=0; pc<size; pc++) {
  537. char buff[100];
  538. printf("%s\n", buildop(pt, pc, buff));
  539. }
  540. printf("-------\n");
  541. }
  542. void luaI_printinst (Proto *pt, int pc) {
  543. char buff[100];
  544. printf("%s\n", buildop(pt, pc, buff));
  545. }
  546. #endif
  547. static int listcode (lua_State *L) {
  548. int pc;
  549. Proto *p;
  550. luaL_argcheck(L, lua_isfunction(L, 1) && !lua_iscfunction(L, 1),
  551. 1, "Lua function expected");
  552. p = getproto(obj_at(L, 1));
  553. lua_newtable(L);
  554. setnameval(L, "maxstack", p->maxstacksize);
  555. setnameval(L, "numparams", p->numparams);
  556. for (pc=0; pc<p->sizecode; pc++) {
  557. char buff[100];
  558. lua_pushinteger(L, pc+1);
  559. lua_pushstring(L, buildop(p, pc, buff));
  560. lua_settable(L, -3);
  561. }
  562. return 1;
  563. }
  564. static int printcode (lua_State *L) {
  565. int pc;
  566. Proto *p;
  567. luaL_argcheck(L, lua_isfunction(L, 1) && !lua_iscfunction(L, 1),
  568. 1, "Lua function expected");
  569. p = getproto(obj_at(L, 1));
  570. printf("maxstack: %d\n", p->maxstacksize);
  571. printf("numparams: %d\n", p->numparams);
  572. for (pc=0; pc<p->sizecode; pc++) {
  573. char buff[100];
  574. printf("%s\n", buildop(p, pc, buff));
  575. }
  576. return 0;
  577. }
  578. static int listk (lua_State *L) {
  579. Proto *p;
  580. int i;
  581. luaL_argcheck(L, lua_isfunction(L, 1) && !lua_iscfunction(L, 1),
  582. 1, "Lua function expected");
  583. p = getproto(obj_at(L, 1));
  584. lua_createtable(L, p->sizek, 0);
  585. for (i=0; i<p->sizek; i++) {
  586. pushobject(L, p->k+i);
  587. lua_rawseti(L, -2, i+1);
  588. }
  589. return 1;
  590. }
  591. static int listabslineinfo (lua_State *L) {
  592. Proto *p;
  593. int i;
  594. luaL_argcheck(L, lua_isfunction(L, 1) && !lua_iscfunction(L, 1),
  595. 1, "Lua function expected");
  596. p = getproto(obj_at(L, 1));
  597. luaL_argcheck(L, p->abslineinfo != NULL, 1, "function has no debug info");
  598. lua_createtable(L, 2 * p->sizeabslineinfo, 0);
  599. for (i=0; i < p->sizeabslineinfo; i++) {
  600. lua_pushinteger(L, p->abslineinfo[i].pc);
  601. lua_rawseti(L, -2, 2 * i + 1);
  602. lua_pushinteger(L, p->abslineinfo[i].line);
  603. lua_rawseti(L, -2, 2 * i + 2);
  604. }
  605. return 1;
  606. }
  607. static int listlocals (lua_State *L) {
  608. Proto *p;
  609. int pc = cast_int(luaL_checkinteger(L, 2)) - 1;
  610. int i = 0;
  611. const char *name;
  612. luaL_argcheck(L, lua_isfunction(L, 1) && !lua_iscfunction(L, 1),
  613. 1, "Lua function expected");
  614. p = getproto(obj_at(L, 1));
  615. while ((name = luaF_getlocalname(p, ++i, pc)) != NULL)
  616. lua_pushstring(L, name);
  617. return i-1;
  618. }
  619. /* }====================================================== */
  620. static void printstack (lua_State *L) {
  621. int i;
  622. int n = lua_gettop(L);
  623. for (i = 1; i <= n; i++) {
  624. printf("%3d: %s\n", i, luaL_tolstring(L, i, NULL));
  625. lua_pop(L, 1);
  626. }
  627. printf("\n");
  628. }
  629. static int get_limits (lua_State *L) {
  630. lua_createtable(L, 0, 6);
  631. setnameval(L, "IS32INT", LUAI_IS32INT);
  632. setnameval(L, "MAXARG_Ax", MAXARG_Ax);
  633. setnameval(L, "MAXARG_Bx", MAXARG_Bx);
  634. setnameval(L, "OFFSET_sBx", OFFSET_sBx);
  635. setnameval(L, "LFPF", LFIELDS_PER_FLUSH);
  636. setnameval(L, "NUM_OPCODES", NUM_OPCODES);
  637. return 1;
  638. }
  639. static int mem_query (lua_State *L) {
  640. if (lua_isnone(L, 1)) {
  641. lua_pushinteger(L, l_memcontrol.total);
  642. lua_pushinteger(L, l_memcontrol.numblocks);
  643. lua_pushinteger(L, l_memcontrol.maxmem);
  644. return 3;
  645. }
  646. else if (lua_isnumber(L, 1)) {
  647. unsigned long limit = cast(unsigned long, luaL_checkinteger(L, 1));
  648. if (limit == 0) limit = ULONG_MAX;
  649. l_memcontrol.memlimit = limit;
  650. return 0;
  651. }
  652. else {
  653. const char *t = luaL_checkstring(L, 1);
  654. int i;
  655. for (i = LUA_NUMTAGS - 1; i >= 0; i--) {
  656. if (strcmp(t, ttypename(i)) == 0) {
  657. lua_pushinteger(L, l_memcontrol.objcount[i]);
  658. return 1;
  659. }
  660. }
  661. return luaL_error(L, "unkown type '%s'", t);
  662. }
  663. }
  664. static int alloc_count (lua_State *L) {
  665. if (lua_isnone(L, 1))
  666. l_memcontrol.countlimit = ~0L;
  667. else
  668. l_memcontrol.countlimit = luaL_checkinteger(L, 1);
  669. return 0;
  670. }
  671. static int settrick (lua_State *L) {
  672. if (ttisnil(obj_at(L, 1)))
  673. l_Trick = NULL;
  674. else
  675. l_Trick = gcvalue(obj_at(L, 1));
  676. return 0;
  677. }
  678. static int gc_color (lua_State *L) {
  679. TValue *o;
  680. luaL_checkany(L, 1);
  681. o = obj_at(L, 1);
  682. if (!iscollectable(o))
  683. lua_pushstring(L, "no collectable");
  684. else {
  685. GCObject *obj = gcvalue(o);
  686. lua_pushstring(L, isdead(G(L), obj) ? "dead" :
  687. iswhite(obj) ? "white" :
  688. isblack(obj) ? "black" : "gray");
  689. }
  690. return 1;
  691. }
  692. static int gc_age (lua_State *L) {
  693. TValue *o;
  694. luaL_checkany(L, 1);
  695. o = obj_at(L, 1);
  696. if (!iscollectable(o))
  697. lua_pushstring(L, "no collectable");
  698. else {
  699. static const char *gennames[] = {"new", "survival", "old0", "old1",
  700. "old", "touched1", "touched2"};
  701. GCObject *obj = gcvalue(o);
  702. lua_pushstring(L, gennames[getage(obj)]);
  703. }
  704. return 1;
  705. }
  706. static int gc_printobj (lua_State *L) {
  707. TValue *o;
  708. luaL_checkany(L, 1);
  709. o = obj_at(L, 1);
  710. if (!iscollectable(o))
  711. printf("no collectable\n");
  712. else {
  713. GCObject *obj = gcvalue(o);
  714. printobj(G(L), obj);
  715. printf("\n");
  716. }
  717. return 0;
  718. }
  719. static int gc_state (lua_State *L) {
  720. static const char *statenames[] = {
  721. "propagate", "atomic", "enteratomic", "sweepallgc", "sweepfinobj",
  722. "sweeptobefnz", "sweepend", "callfin", "pause", ""};
  723. static const int states[] = {
  724. GCSpropagate, GCSenteratomic, GCSatomic, GCSswpallgc, GCSswpfinobj,
  725. GCSswptobefnz, GCSswpend, GCScallfin, GCSpause, -1};
  726. int option = states[luaL_checkoption(L, 1, "", statenames)];
  727. if (option == -1) {
  728. lua_pushstring(L, statenames[G(L)->gcstate]);
  729. return 1;
  730. }
  731. else {
  732. global_State *g = G(L);
  733. if (G(L)->gckind == KGC_GEN)
  734. luaL_error(L, "cannot change states in generational mode");
  735. lua_lock(L);
  736. if (option < g->gcstate) { /* must cross 'pause'? */
  737. luaC_runtilstate(L, bitmask(GCSpause)); /* run until pause */
  738. }
  739. luaC_runtilstate(L, bitmask(option));
  740. lua_assert(G(L)->gcstate == option);
  741. lua_unlock(L);
  742. return 0;
  743. }
  744. }
  745. static int hash_query (lua_State *L) {
  746. if (lua_isnone(L, 2)) {
  747. luaL_argcheck(L, lua_type(L, 1) == LUA_TSTRING, 1, "string expected");
  748. lua_pushinteger(L, tsvalue(obj_at(L, 1))->hash);
  749. }
  750. else {
  751. TValue *o = obj_at(L, 1);
  752. Table *t;
  753. luaL_checktype(L, 2, LUA_TTABLE);
  754. t = hvalue(obj_at(L, 2));
  755. lua_pushinteger(L, luaH_mainposition(t, o) - t->node);
  756. }
  757. return 1;
  758. }
  759. static int stacklevel (lua_State *L) {
  760. unsigned long a = 0;
  761. lua_pushinteger(L, (L->top - L->stack));
  762. lua_pushinteger(L, (L->stack_last - L->stack));
  763. lua_pushinteger(L, L->nCcalls);
  764. lua_pushinteger(L, L->nci);
  765. lua_pushinteger(L, (unsigned long)&a);
  766. return 5;
  767. }
  768. static int table_query (lua_State *L) {
  769. const Table *t;
  770. int i = cast_int(luaL_optinteger(L, 2, -1));
  771. unsigned int asize;
  772. luaL_checktype(L, 1, LUA_TTABLE);
  773. t = hvalue(obj_at(L, 1));
  774. asize = luaH_realasize(t);
  775. if (i == -1) {
  776. lua_pushinteger(L, asize);
  777. lua_pushinteger(L, allocsizenode(t));
  778. lua_pushinteger(L, isdummy(t) ? 0 : t->lastfree - t->node);
  779. lua_pushinteger(L, t->alimit);
  780. return 4;
  781. }
  782. else if ((unsigned int)i < asize) {
  783. lua_pushinteger(L, i);
  784. pushobject(L, &t->array[i]);
  785. lua_pushnil(L);
  786. }
  787. else if ((i -= asize) < sizenode(t)) {
  788. TValue k;
  789. getnodekey(L, &k, gnode(t, i));
  790. if (!isempty(gval(gnode(t, i))) ||
  791. ttisnil(&k) ||
  792. ttisnumber(&k)) {
  793. pushobject(L, &k);
  794. }
  795. else
  796. lua_pushliteral(L, "<undef>");
  797. pushobject(L, gval(gnode(t, i)));
  798. if (gnext(&t->node[i]) != 0)
  799. lua_pushinteger(L, gnext(&t->node[i]));
  800. else
  801. lua_pushnil(L);
  802. }
  803. return 3;
  804. }
  805. static int string_query (lua_State *L) {
  806. stringtable *tb = &G(L)->strt;
  807. int s = cast_int(luaL_optinteger(L, 1, 0)) - 1;
  808. if (s == -1) {
  809. lua_pushinteger(L ,tb->size);
  810. lua_pushinteger(L ,tb->nuse);
  811. return 2;
  812. }
  813. else if (s < tb->size) {
  814. TString *ts;
  815. int n = 0;
  816. for (ts = tb->hash[s]; ts != NULL; ts = ts->u.hnext) {
  817. setsvalue2s(L, L->top, ts);
  818. api_incr_top(L);
  819. n++;
  820. }
  821. return n;
  822. }
  823. else return 0;
  824. }
  825. static int tref (lua_State *L) {
  826. int level = lua_gettop(L);
  827. luaL_checkany(L, 1);
  828. lua_pushvalue(L, 1);
  829. lua_pushinteger(L, luaL_ref(L, LUA_REGISTRYINDEX));
  830. lua_assert(lua_gettop(L) == level+1); /* +1 for result */
  831. return 1;
  832. }
  833. static int getref (lua_State *L) {
  834. int level = lua_gettop(L);
  835. lua_rawgeti(L, LUA_REGISTRYINDEX, luaL_checkinteger(L, 1));
  836. lua_assert(lua_gettop(L) == level+1);
  837. return 1;
  838. }
  839. static int unref (lua_State *L) {
  840. int level = lua_gettop(L);
  841. luaL_unref(L, LUA_REGISTRYINDEX, cast_int(luaL_checkinteger(L, 1)));
  842. lua_assert(lua_gettop(L) == level);
  843. return 0;
  844. }
  845. static int upvalue (lua_State *L) {
  846. int n = cast_int(luaL_checkinteger(L, 2));
  847. luaL_checktype(L, 1, LUA_TFUNCTION);
  848. if (lua_isnone(L, 3)) {
  849. const char *name = lua_getupvalue(L, 1, n);
  850. if (name == NULL) return 0;
  851. lua_pushstring(L, name);
  852. return 2;
  853. }
  854. else {
  855. const char *name = lua_setupvalue(L, 1, n);
  856. lua_pushstring(L, name);
  857. return 1;
  858. }
  859. }
  860. static int newuserdata (lua_State *L) {
  861. size_t size = cast_sizet(luaL_optinteger(L, 1, 0));
  862. int nuv = luaL_optinteger(L, 2, 0);
  863. char *p = cast_charp(lua_newuserdatauv(L, size, nuv));
  864. while (size--) *p++ = '\0';
  865. return 1;
  866. }
  867. static int pushuserdata (lua_State *L) {
  868. lua_Integer u = luaL_checkinteger(L, 1);
  869. lua_pushlightuserdata(L, cast_voidp(cast_sizet(u)));
  870. return 1;
  871. }
  872. static int udataval (lua_State *L) {
  873. lua_pushinteger(L, cast(long, lua_touserdata(L, 1)));
  874. return 1;
  875. }
  876. static int doonnewstack (lua_State *L) {
  877. lua_State *L1 = lua_newthread(L);
  878. size_t l;
  879. const char *s = luaL_checklstring(L, 1, &l);
  880. int status = luaL_loadbuffer(L1, s, l, s);
  881. if (status == LUA_OK)
  882. status = lua_pcall(L1, 0, 0, 0);
  883. lua_pushinteger(L, status);
  884. return 1;
  885. }
  886. static int s2d (lua_State *L) {
  887. lua_pushnumber(L, cast_num(*cast(const double *, luaL_checkstring(L, 1))));
  888. return 1;
  889. }
  890. static int d2s (lua_State *L) {
  891. double d = cast(double, luaL_checknumber(L, 1));
  892. lua_pushlstring(L, cast_charp(&d), sizeof(d));
  893. return 1;
  894. }
  895. static int num2int (lua_State *L) {
  896. lua_pushinteger(L, lua_tointeger(L, 1));
  897. return 1;
  898. }
  899. static int newstate (lua_State *L) {
  900. void *ud;
  901. lua_Alloc f = lua_getallocf(L, &ud);
  902. lua_State *L1 = lua_newstate(f, ud);
  903. if (L1) {
  904. lua_atpanic(L1, tpanic);
  905. lua_pushlightuserdata(L, L1);
  906. }
  907. else
  908. lua_pushnil(L);
  909. return 1;
  910. }
  911. static lua_State *getstate (lua_State *L) {
  912. lua_State *L1 = cast(lua_State *, lua_touserdata(L, 1));
  913. luaL_argcheck(L, L1 != NULL, 1, "state expected");
  914. return L1;
  915. }
  916. static int loadlib (lua_State *L) {
  917. static const luaL_Reg libs[] = {
  918. {LUA_GNAME, luaopen_base},
  919. {"coroutine", luaopen_coroutine},
  920. {"debug", luaopen_debug},
  921. {"io", luaopen_io},
  922. {"os", luaopen_os},
  923. {"math", luaopen_math},
  924. {"string", luaopen_string},
  925. {"table", luaopen_table},
  926. {"T", luaB_opentests},
  927. {NULL, NULL}
  928. };
  929. lua_State *L1 = getstate(L);
  930. int i;
  931. luaL_requiref(L1, "package", luaopen_package, 0);
  932. lua_assert(lua_type(L1, -1) == LUA_TTABLE);
  933. /* 'requiref' should not reload module already loaded... */
  934. luaL_requiref(L1, "package", NULL, 1); /* seg. fault if it reloads */
  935. /* ...but should return the same module */
  936. lua_assert(lua_compare(L1, -1, -2, LUA_OPEQ));
  937. luaL_getsubtable(L1, LUA_REGISTRYINDEX, LUA_PRELOAD_TABLE);
  938. for (i = 0; libs[i].name; i++) {
  939. lua_pushcfunction(L1, libs[i].func);
  940. lua_setfield(L1, -2, libs[i].name);
  941. }
  942. return 0;
  943. }
  944. static int closestate (lua_State *L) {
  945. lua_State *L1 = getstate(L);
  946. lua_close(L1);
  947. return 0;
  948. }
  949. static int doremote (lua_State *L) {
  950. lua_State *L1 = getstate(L);
  951. size_t lcode;
  952. const char *code = luaL_checklstring(L, 2, &lcode);
  953. int status;
  954. lua_settop(L1, 0);
  955. status = luaL_loadbuffer(L1, code, lcode, code);
  956. if (status == LUA_OK)
  957. status = lua_pcall(L1, 0, LUA_MULTRET, 0);
  958. if (status != LUA_OK) {
  959. lua_pushnil(L);
  960. lua_pushstring(L, lua_tostring(L1, -1));
  961. lua_pushinteger(L, status);
  962. return 3;
  963. }
  964. else {
  965. int i = 0;
  966. while (!lua_isnone(L1, ++i))
  967. lua_pushstring(L, lua_tostring(L1, i));
  968. lua_pop(L1, i-1);
  969. return i-1;
  970. }
  971. }
  972. static int log2_aux (lua_State *L) {
  973. unsigned int x = (unsigned int)luaL_checkinteger(L, 1);
  974. lua_pushinteger(L, luaO_ceillog2(x));
  975. return 1;
  976. }
  977. struct Aux { jmp_buf jb; const char *paniccode; lua_State *L; };
  978. /*
  979. ** does a long-jump back to "main program".
  980. */
  981. static int panicback (lua_State *L) {
  982. struct Aux *b;
  983. lua_checkstack(L, 1); /* open space for 'Aux' struct */
  984. lua_getfield(L, LUA_REGISTRYINDEX, "_jmpbuf"); /* get 'Aux' struct */
  985. b = (struct Aux *)lua_touserdata(L, -1);
  986. lua_pop(L, 1); /* remove 'Aux' struct */
  987. runC(b->L, L, b->paniccode); /* run optional panic code */
  988. longjmp(b->jb, 1);
  989. return 1; /* to avoid warnings */
  990. }
  991. static int checkpanic (lua_State *L) {
  992. struct Aux b;
  993. void *ud;
  994. lua_State *L1;
  995. const char *code = luaL_checkstring(L, 1);
  996. lua_Alloc f = lua_getallocf(L, &ud);
  997. b.paniccode = luaL_optstring(L, 2, "");
  998. b.L = L;
  999. L1 = lua_newstate(f, ud); /* create new state */
  1000. if (L1 == NULL) { /* error? */
  1001. lua_pushnil(L);
  1002. return 1;
  1003. }
  1004. lua_atpanic(L1, panicback); /* set its panic function */
  1005. lua_pushlightuserdata(L1, &b);
  1006. lua_setfield(L1, LUA_REGISTRYINDEX, "_jmpbuf"); /* store 'Aux' struct */
  1007. if (setjmp(b.jb) == 0) { /* set jump buffer */
  1008. runC(L, L1, code); /* run code unprotected */
  1009. lua_pushliteral(L, "no errors");
  1010. }
  1011. else { /* error handling */
  1012. /* move error message to original state */
  1013. lua_pushstring(L, lua_tostring(L1, -1));
  1014. }
  1015. lua_close(L1);
  1016. return 1;
  1017. }
  1018. /*
  1019. ** {====================================================================
  1020. ** function to test the API with C. It interprets a kind of assembler
  1021. ** language with calls to the API, so the test can be driven by Lua code
  1022. ** =====================================================================
  1023. */
  1024. static void sethookaux (lua_State *L, int mask, int count, const char *code);
  1025. static const char *const delimits = " \t\n,;";
  1026. static void skip (const char **pc) {
  1027. for (;;) {
  1028. if (**pc != '\0' && strchr(delimits, **pc)) (*pc)++;
  1029. else if (**pc == '#') { /* comment? */
  1030. while (**pc != '\n' && **pc != '\0') (*pc)++; /* until end-of-line */
  1031. }
  1032. else break;
  1033. }
  1034. }
  1035. static int getnum_aux (lua_State *L, lua_State *L1, const char **pc) {
  1036. int res = 0;
  1037. int sig = 1;
  1038. skip(pc);
  1039. if (**pc == '.') {
  1040. res = cast_int(lua_tointeger(L1, -1));
  1041. lua_pop(L1, 1);
  1042. (*pc)++;
  1043. return res;
  1044. }
  1045. else if (**pc == '*') {
  1046. res = lua_gettop(L1);
  1047. (*pc)++;
  1048. return res;
  1049. }
  1050. else if (**pc == '-') {
  1051. sig = -1;
  1052. (*pc)++;
  1053. }
  1054. if (!lisdigit(cast_uchar(**pc)))
  1055. luaL_error(L, "number expected (%s)", *pc);
  1056. while (lisdigit(cast_uchar(**pc))) res = res*10 + (*(*pc)++) - '0';
  1057. return sig*res;
  1058. }
  1059. static const char *getstring_aux (lua_State *L, char *buff, const char **pc) {
  1060. int i = 0;
  1061. skip(pc);
  1062. if (**pc == '"' || **pc == '\'') { /* quoted string? */
  1063. int quote = *(*pc)++;
  1064. while (**pc != quote) {
  1065. if (**pc == '\0') luaL_error(L, "unfinished string in C script");
  1066. buff[i++] = *(*pc)++;
  1067. }
  1068. (*pc)++;
  1069. }
  1070. else {
  1071. while (**pc != '\0' && !strchr(delimits, **pc))
  1072. buff[i++] = *(*pc)++;
  1073. }
  1074. buff[i] = '\0';
  1075. return buff;
  1076. }
  1077. static int getindex_aux (lua_State *L, lua_State *L1, const char **pc) {
  1078. skip(pc);
  1079. switch (*(*pc)++) {
  1080. case 'R': return LUA_REGISTRYINDEX;
  1081. case 'G': return luaL_error(L, "deprecated index 'G'");
  1082. case 'U': return lua_upvalueindex(getnum_aux(L, L1, pc));
  1083. default: (*pc)--; return getnum_aux(L, L1, pc);
  1084. }
  1085. }
  1086. static void pushcode (lua_State *L, int code) {
  1087. static const char *const codes[] = {"OK", "YIELD", "ERRRUN",
  1088. "ERRSYNTAX", MEMERRMSG, "ERRGCMM", "ERRERR"};
  1089. lua_pushstring(L, codes[code]);
  1090. }
  1091. #define EQ(s1) (strcmp(s1, inst) == 0)
  1092. #define getnum (getnum_aux(L, L1, &pc))
  1093. #define getstring (getstring_aux(L, buff, &pc))
  1094. #define getindex (getindex_aux(L, L1, &pc))
  1095. static int testC (lua_State *L);
  1096. static int Cfunck (lua_State *L, int status, lua_KContext ctx);
  1097. /*
  1098. ** arithmetic operation encoding for 'arith' instruction
  1099. ** LUA_OPIDIV -> \
  1100. ** LUA_OPSHL -> <
  1101. ** LUA_OPSHR -> >
  1102. ** LUA_OPUNM -> _
  1103. ** LUA_OPBNOT -> !
  1104. */
  1105. static const char ops[] = "+-*%^/\\&|~<>_!";
  1106. static int runC (lua_State *L, lua_State *L1, const char *pc) {
  1107. char buff[300];
  1108. int status = 0;
  1109. if (pc == NULL) return luaL_error(L, "attempt to runC null script");
  1110. for (;;) {
  1111. const char *inst = getstring;
  1112. if EQ("") return 0;
  1113. else if EQ("absindex") {
  1114. lua_pushnumber(L1, lua_absindex(L1, getindex));
  1115. }
  1116. else if EQ("append") {
  1117. int t = getindex;
  1118. int i = lua_rawlen(L1, t);
  1119. lua_rawseti(L1, t, i + 1);
  1120. }
  1121. else if EQ("arith") {
  1122. int op;
  1123. skip(&pc);
  1124. op = strchr(ops, *pc++) - ops;
  1125. lua_arith(L1, op);
  1126. }
  1127. else if EQ("call") {
  1128. int narg = getnum;
  1129. int nres = getnum;
  1130. lua_call(L1, narg, nres);
  1131. }
  1132. else if EQ("callk") {
  1133. int narg = getnum;
  1134. int nres = getnum;
  1135. int i = getindex;
  1136. lua_callk(L1, narg, nres, i, Cfunck);
  1137. }
  1138. else if EQ("checkstack") {
  1139. int sz = getnum;
  1140. const char *msg = getstring;
  1141. if (*msg == '\0')
  1142. msg = NULL; /* to test 'luaL_checkstack' with no message */
  1143. luaL_checkstack(L1, sz, msg);
  1144. }
  1145. else if EQ("rawcheckstack") {
  1146. int sz = getnum;
  1147. lua_pushboolean(L1, lua_checkstack(L1, sz));
  1148. }
  1149. else if EQ("compare") {
  1150. const char *opt = getstring; /* EQ, LT, or LE */
  1151. int op = (opt[0] == 'E') ? LUA_OPEQ
  1152. : (opt[1] == 'T') ? LUA_OPLT : LUA_OPLE;
  1153. int a = getindex;
  1154. int b = getindex;
  1155. lua_pushboolean(L1, lua_compare(L1, a, b, op));
  1156. }
  1157. else if EQ("concat") {
  1158. lua_concat(L1, getnum);
  1159. }
  1160. else if EQ("copy") {
  1161. int f = getindex;
  1162. lua_copy(L1, f, getindex);
  1163. }
  1164. else if EQ("func2num") {
  1165. lua_CFunction func = lua_tocfunction(L1, getindex);
  1166. lua_pushnumber(L1, cast_sizet(func));
  1167. }
  1168. else if EQ("getfield") {
  1169. int t = getindex;
  1170. lua_getfield(L1, t, getstring);
  1171. }
  1172. else if EQ("getglobal") {
  1173. lua_getglobal(L1, getstring);
  1174. }
  1175. else if EQ("getmetatable") {
  1176. if (lua_getmetatable(L1, getindex) == 0)
  1177. lua_pushnil(L1);
  1178. }
  1179. else if EQ("gettable") {
  1180. lua_gettable(L1, getindex);
  1181. }
  1182. else if EQ("gettop") {
  1183. lua_pushinteger(L1, lua_gettop(L1));
  1184. }
  1185. else if EQ("gsub") {
  1186. int a = getnum; int b = getnum; int c = getnum;
  1187. luaL_gsub(L1, lua_tostring(L1, a),
  1188. lua_tostring(L1, b),
  1189. lua_tostring(L1, c));
  1190. }
  1191. else if EQ("insert") {
  1192. lua_insert(L1, getnum);
  1193. }
  1194. else if EQ("iscfunction") {
  1195. lua_pushboolean(L1, lua_iscfunction(L1, getindex));
  1196. }
  1197. else if EQ("isfunction") {
  1198. lua_pushboolean(L1, lua_isfunction(L1, getindex));
  1199. }
  1200. else if EQ("isnil") {
  1201. lua_pushboolean(L1, lua_isnil(L1, getindex));
  1202. }
  1203. else if EQ("isnull") {
  1204. lua_pushboolean(L1, lua_isnone(L1, getindex));
  1205. }
  1206. else if EQ("isnumber") {
  1207. lua_pushboolean(L1, lua_isnumber(L1, getindex));
  1208. }
  1209. else if EQ("isstring") {
  1210. lua_pushboolean(L1, lua_isstring(L1, getindex));
  1211. }
  1212. else if EQ("istable") {
  1213. lua_pushboolean(L1, lua_istable(L1, getindex));
  1214. }
  1215. else if EQ("isudataval") {
  1216. lua_pushboolean(L1, lua_islightuserdata(L1, getindex));
  1217. }
  1218. else if EQ("isuserdata") {
  1219. lua_pushboolean(L1, lua_isuserdata(L1, getindex));
  1220. }
  1221. else if EQ("len") {
  1222. lua_len(L1, getindex);
  1223. }
  1224. else if EQ("Llen") {
  1225. lua_pushinteger(L1, luaL_len(L1, getindex));
  1226. }
  1227. else if EQ("loadfile") {
  1228. luaL_loadfile(L1, luaL_checkstring(L1, getnum));
  1229. }
  1230. else if EQ("loadstring") {
  1231. const char *s = luaL_checkstring(L1, getnum);
  1232. luaL_loadstring(L1, s);
  1233. }
  1234. else if EQ("newmetatable") {
  1235. lua_pushboolean(L1, luaL_newmetatable(L1, getstring));
  1236. }
  1237. else if EQ("newtable") {
  1238. lua_newtable(L1);
  1239. }
  1240. else if EQ("newthread") {
  1241. lua_newthread(L1);
  1242. }
  1243. else if EQ("resetthread") {
  1244. lua_pushinteger(L1, lua_resetthread(L1));
  1245. }
  1246. else if EQ("newuserdata") {
  1247. lua_newuserdata(L1, getnum);
  1248. }
  1249. else if EQ("next") {
  1250. lua_next(L1, -2);
  1251. }
  1252. else if EQ("objsize") {
  1253. lua_pushinteger(L1, lua_rawlen(L1, getindex));
  1254. }
  1255. else if EQ("pcall") {
  1256. int narg = getnum;
  1257. int nres = getnum;
  1258. status = lua_pcall(L1, narg, nres, getnum);
  1259. }
  1260. else if EQ("pcallk") {
  1261. int narg = getnum;
  1262. int nres = getnum;
  1263. int i = getindex;
  1264. status = lua_pcallk(L1, narg, nres, 0, i, Cfunck);
  1265. }
  1266. else if EQ("pop") {
  1267. lua_pop(L1, getnum);
  1268. }
  1269. else if EQ("printstack") {
  1270. int n = getnum;
  1271. if (n != 0) {
  1272. printf("%s\n", luaL_tolstring(L1, n, NULL));
  1273. lua_pop(L1, 1);
  1274. }
  1275. else printstack(L1);
  1276. }
  1277. else if EQ("print") {
  1278. const char *msg = getstring;
  1279. printf("%s\n", msg);
  1280. }
  1281. else if EQ("warningC") {
  1282. const char *msg = getstring;
  1283. lua_warning(L1, msg, 1);
  1284. }
  1285. else if EQ("warning") {
  1286. const char *msg = getstring;
  1287. lua_warning(L1, msg, 0);
  1288. }
  1289. else if EQ("pushbool") {
  1290. lua_pushboolean(L1, getnum);
  1291. }
  1292. else if EQ("pushcclosure") {
  1293. lua_pushcclosure(L1, testC, getnum);
  1294. }
  1295. else if EQ("pushint") {
  1296. lua_pushinteger(L1, getnum);
  1297. }
  1298. else if EQ("pushnil") {
  1299. lua_pushnil(L1);
  1300. }
  1301. else if EQ("pushnum") {
  1302. lua_pushnumber(L1, (lua_Number)getnum);
  1303. }
  1304. else if EQ("pushstatus") {
  1305. pushcode(L1, status);
  1306. }
  1307. else if EQ("pushstring") {
  1308. lua_pushstring(L1, getstring);
  1309. }
  1310. else if EQ("pushupvalueindex") {
  1311. lua_pushinteger(L1, lua_upvalueindex(getnum));
  1312. }
  1313. else if EQ("pushvalue") {
  1314. lua_pushvalue(L1, getindex);
  1315. }
  1316. else if EQ("pushfstringI") {
  1317. lua_pushfstring(L1, lua_tostring(L, -2), (int)lua_tointeger(L, -1));
  1318. }
  1319. else if EQ("pushfstringS") {
  1320. lua_pushfstring(L1, lua_tostring(L, -2), lua_tostring(L, -1));
  1321. }
  1322. else if EQ("pushfstringP") {
  1323. lua_pushfstring(L1, lua_tostring(L, -2), lua_topointer(L, -1));
  1324. }
  1325. else if EQ("rawget") {
  1326. int t = getindex;
  1327. lua_rawget(L1, t);
  1328. }
  1329. else if EQ("rawgeti") {
  1330. int t = getindex;
  1331. lua_rawgeti(L1, t, getnum);
  1332. }
  1333. else if EQ("rawgetp") {
  1334. int t = getindex;
  1335. lua_rawgetp(L1, t, cast_voidp(cast_sizet(getnum)));
  1336. }
  1337. else if EQ("rawset") {
  1338. int t = getindex;
  1339. lua_rawset(L1, t);
  1340. }
  1341. else if EQ("rawseti") {
  1342. int t = getindex;
  1343. lua_rawseti(L1, t, getnum);
  1344. }
  1345. else if EQ("rawsetp") {
  1346. int t = getindex;
  1347. lua_rawsetp(L1, t, cast_voidp(cast_sizet(getnum)));
  1348. }
  1349. else if EQ("remove") {
  1350. lua_remove(L1, getnum);
  1351. }
  1352. else if EQ("replace") {
  1353. lua_replace(L1, getindex);
  1354. }
  1355. else if EQ("resume") {
  1356. int i = getindex;
  1357. int nres;
  1358. status = lua_resume(lua_tothread(L1, i), L, getnum, &nres);
  1359. }
  1360. else if EQ("return") {
  1361. int n = getnum;
  1362. if (L1 != L) {
  1363. int i;
  1364. for (i = 0; i < n; i++) {
  1365. int idx = -(n - i);
  1366. switch (lua_type(L1, idx)) {
  1367. case LUA_TBOOLEAN:
  1368. lua_pushboolean(L, lua_toboolean(L1, idx));
  1369. break;
  1370. default:
  1371. lua_pushstring(L, lua_tostring(L1, idx));
  1372. break;
  1373. }
  1374. }
  1375. }
  1376. return n;
  1377. }
  1378. else if EQ("rotate") {
  1379. int i = getindex;
  1380. lua_rotate(L1, i, getnum);
  1381. }
  1382. else if EQ("setfield") {
  1383. int t = getindex;
  1384. const char *s = getstring;
  1385. lua_setfield(L1, t, s);
  1386. }
  1387. else if EQ("seti") {
  1388. int t = getindex;
  1389. lua_seti(L1, t, getnum);
  1390. }
  1391. else if EQ("setglobal") {
  1392. const char *s = getstring;
  1393. lua_setglobal(L1, s);
  1394. }
  1395. else if EQ("sethook") {
  1396. int mask = getnum;
  1397. int count = getnum;
  1398. const char *s = getstring;
  1399. sethookaux(L1, mask, count, s);
  1400. }
  1401. else if EQ("setmetatable") {
  1402. int idx = getindex;
  1403. lua_setmetatable(L1, idx);
  1404. }
  1405. else if EQ("settable") {
  1406. lua_settable(L1, getindex);
  1407. }
  1408. else if EQ("settop") {
  1409. lua_settop(L1, getnum);
  1410. }
  1411. else if EQ("testudata") {
  1412. int i = getindex;
  1413. lua_pushboolean(L1, luaL_testudata(L1, i, getstring) != NULL);
  1414. }
  1415. else if EQ("error") {
  1416. lua_error(L1);
  1417. }
  1418. else if EQ("abort") {
  1419. abort();
  1420. }
  1421. else if EQ("throw") {
  1422. #if defined(__cplusplus)
  1423. static struct X { int x; } x;
  1424. throw x;
  1425. #else
  1426. luaL_error(L1, "C++");
  1427. #endif
  1428. break;
  1429. }
  1430. else if EQ("tobool") {
  1431. lua_pushboolean(L1, lua_toboolean(L1, getindex));
  1432. }
  1433. else if EQ("tocfunction") {
  1434. lua_pushcfunction(L1, lua_tocfunction(L1, getindex));
  1435. }
  1436. else if EQ("tointeger") {
  1437. lua_pushinteger(L1, lua_tointeger(L1, getindex));
  1438. }
  1439. else if EQ("tonumber") {
  1440. lua_pushnumber(L1, lua_tonumber(L1, getindex));
  1441. }
  1442. else if EQ("topointer") {
  1443. lua_pushlightuserdata(L1, cast_voidp(lua_topointer(L1, getindex)));
  1444. }
  1445. else if EQ("touserdata") {
  1446. lua_pushlightuserdata(L1, lua_touserdata(L1, getindex));
  1447. }
  1448. else if EQ("tostring") {
  1449. const char *s = lua_tostring(L1, getindex);
  1450. const char *s1 = lua_pushstring(L1, s);
  1451. lua_longassert((s == NULL && s1 == NULL) || strcmp(s, s1) == 0);
  1452. }
  1453. else if EQ("type") {
  1454. lua_pushstring(L1, luaL_typename(L1, getnum));
  1455. }
  1456. else if EQ("xmove") {
  1457. int f = getindex;
  1458. int t = getindex;
  1459. lua_State *fs = (f == 0) ? L1 : lua_tothread(L1, f);
  1460. lua_State *ts = (t == 0) ? L1 : lua_tothread(L1, t);
  1461. int n = getnum;
  1462. if (n == 0) n = lua_gettop(fs);
  1463. lua_xmove(fs, ts, n);
  1464. }
  1465. else if EQ("yield") {
  1466. return lua_yield(L1, getnum);
  1467. }
  1468. else if EQ("yieldk") {
  1469. int nres = getnum;
  1470. int i = getindex;
  1471. return lua_yieldk(L1, nres, i, Cfunck);
  1472. }
  1473. else if EQ("toclose") {
  1474. lua_toclose(L1, getnum);
  1475. }
  1476. else luaL_error(L, "unknown instruction %s", buff);
  1477. }
  1478. return 0;
  1479. }
  1480. static int testC (lua_State *L) {
  1481. lua_State *L1;
  1482. const char *pc;
  1483. if (lua_isuserdata(L, 1)) {
  1484. L1 = getstate(L);
  1485. pc = luaL_checkstring(L, 2);
  1486. }
  1487. else if (lua_isthread(L, 1)) {
  1488. L1 = lua_tothread(L, 1);
  1489. pc = luaL_checkstring(L, 2);
  1490. }
  1491. else {
  1492. L1 = L;
  1493. pc = luaL_checkstring(L, 1);
  1494. }
  1495. return runC(L, L1, pc);
  1496. }
  1497. static int Cfunc (lua_State *L) {
  1498. return runC(L, L, lua_tostring(L, lua_upvalueindex(1)));
  1499. }
  1500. static int Cfunck (lua_State *L, int status, lua_KContext ctx) {
  1501. pushcode(L, status);
  1502. lua_setglobal(L, "status");
  1503. lua_pushinteger(L, ctx);
  1504. lua_setglobal(L, "ctx");
  1505. return runC(L, L, lua_tostring(L, ctx));
  1506. }
  1507. static int makeCfunc (lua_State *L) {
  1508. luaL_checkstring(L, 1);
  1509. lua_pushcclosure(L, Cfunc, lua_gettop(L));
  1510. return 1;
  1511. }
  1512. /* }====================================================== */
  1513. /*
  1514. ** {======================================================
  1515. ** tests for C hooks
  1516. ** =======================================================
  1517. */
  1518. /*
  1519. ** C hook that runs the C script stored in registry.C_HOOK[L]
  1520. */
  1521. static void Chook (lua_State *L, lua_Debug *ar) {
  1522. const char *scpt;
  1523. const char *const events [] = {"call", "ret", "line", "count", "tailcall"};
  1524. lua_getfield(L, LUA_REGISTRYINDEX, "C_HOOK");
  1525. lua_pushlightuserdata(L, L);
  1526. lua_gettable(L, -2); /* get C_HOOK[L] (script saved by sethookaux) */
  1527. scpt = lua_tostring(L, -1); /* not very religious (string will be popped) */
  1528. lua_pop(L, 2); /* remove C_HOOK and script */
  1529. lua_pushstring(L, events[ar->event]); /* may be used by script */
  1530. lua_pushinteger(L, ar->currentline); /* may be used by script */
  1531. runC(L, L, scpt); /* run script from C_HOOK[L] */
  1532. }
  1533. /*
  1534. ** sets 'registry.C_HOOK[L] = scpt' and sets 'Chook' as a hook
  1535. */
  1536. static void sethookaux (lua_State *L, int mask, int count, const char *scpt) {
  1537. if (*scpt == '\0') { /* no script? */
  1538. lua_sethook(L, NULL, 0, 0); /* turn off hooks */
  1539. return;
  1540. }
  1541. lua_getfield(L, LUA_REGISTRYINDEX, "C_HOOK"); /* get C_HOOK table */
  1542. if (!lua_istable(L, -1)) { /* no hook table? */
  1543. lua_pop(L, 1); /* remove previous value */
  1544. lua_newtable(L); /* create new C_HOOK table */
  1545. lua_pushvalue(L, -1);
  1546. lua_setfield(L, LUA_REGISTRYINDEX, "C_HOOK"); /* register it */
  1547. }
  1548. lua_pushlightuserdata(L, L);
  1549. lua_pushstring(L, scpt);
  1550. lua_settable(L, -3); /* C_HOOK[L] = script */
  1551. lua_sethook(L, Chook, mask, count);
  1552. }
  1553. static int sethook (lua_State *L) {
  1554. if (lua_isnoneornil(L, 1))
  1555. lua_sethook(L, NULL, 0, 0); /* turn off hooks */
  1556. else {
  1557. const char *scpt = luaL_checkstring(L, 1);
  1558. const char *smask = luaL_checkstring(L, 2);
  1559. int count = cast_int(luaL_optinteger(L, 3, 0));
  1560. int mask = 0;
  1561. if (strchr(smask, 'c')) mask |= LUA_MASKCALL;
  1562. if (strchr(smask, 'r')) mask |= LUA_MASKRET;
  1563. if (strchr(smask, 'l')) mask |= LUA_MASKLINE;
  1564. if (count > 0) mask |= LUA_MASKCOUNT;
  1565. sethookaux(L, mask, count, scpt);
  1566. }
  1567. return 0;
  1568. }
  1569. static int coresume (lua_State *L) {
  1570. int status, nres;
  1571. lua_State *co = lua_tothread(L, 1);
  1572. luaL_argcheck(L, co, 1, "coroutine expected");
  1573. status = lua_resume(co, L, 0, &nres);
  1574. if (status != LUA_OK && status != LUA_YIELD) {
  1575. lua_pushboolean(L, 0);
  1576. lua_insert(L, -2);
  1577. return 2; /* return false + error message */
  1578. }
  1579. else {
  1580. lua_pushboolean(L, 1);
  1581. return 1;
  1582. }
  1583. }
  1584. /* }====================================================== */
  1585. static const struct luaL_Reg tests_funcs[] = {
  1586. {"checkmemory", lua_checkmemory},
  1587. {"closestate", closestate},
  1588. {"d2s", d2s},
  1589. {"doonnewstack", doonnewstack},
  1590. {"doremote", doremote},
  1591. {"gccolor", gc_color},
  1592. {"gcage", gc_age},
  1593. {"gcstate", gc_state},
  1594. {"pobj", gc_printobj},
  1595. {"getref", getref},
  1596. {"hash", hash_query},
  1597. {"log2", log2_aux},
  1598. {"limits", get_limits},
  1599. {"listcode", listcode},
  1600. {"printcode", printcode},
  1601. {"listk", listk},
  1602. {"listabslineinfo", listabslineinfo},
  1603. {"listlocals", listlocals},
  1604. {"loadlib", loadlib},
  1605. {"checkpanic", checkpanic},
  1606. {"newstate", newstate},
  1607. {"newuserdata", newuserdata},
  1608. {"num2int", num2int},
  1609. {"pushuserdata", pushuserdata},
  1610. {"querystr", string_query},
  1611. {"querytab", table_query},
  1612. {"ref", tref},
  1613. {"resume", coresume},
  1614. {"s2d", s2d},
  1615. {"sethook", sethook},
  1616. {"stacklevel", stacklevel},
  1617. {"testC", testC},
  1618. {"makeCfunc", makeCfunc},
  1619. {"totalmem", mem_query},
  1620. {"alloccount", alloc_count},
  1621. {"trick", settrick},
  1622. {"udataval", udataval},
  1623. {"unref", unref},
  1624. {"upvalue", upvalue},
  1625. {NULL, NULL}
  1626. };
  1627. static void checkfinalmem (void) {
  1628. lua_assert(l_memcontrol.numblocks == 0);
  1629. lua_assert(l_memcontrol.total == 0);
  1630. }
  1631. int luaB_opentests (lua_State *L) {
  1632. void *ud;
  1633. lua_atpanic(L, &tpanic);
  1634. lua_setwarnf(L, &warnf, L);
  1635. atexit(checkfinalmem);
  1636. lua_assert(lua_getallocf(L, &ud) == debug_realloc);
  1637. lua_assert(ud == cast_voidp(&l_memcontrol));
  1638. lua_setallocf(L, lua_getallocf(L, NULL), ud);
  1639. luaL_newlib(L, tests_funcs);
  1640. return 1;
  1641. }
  1642. #endif