ltests.c 52 KB

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