ltests.c 50 KB

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