ltests.c 51 KB

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