ldebug.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640
  1. /*
  2. ** $Id: ldebug.c,v 2.46 2009/04/17 14:28:06 roberto Exp roberto $
  3. ** Debug Interface
  4. ** See Copyright Notice in lua.h
  5. */
  6. #include <stdarg.h>
  7. #include <stddef.h>
  8. #include <string.h>
  9. #define ldebug_c
  10. #define LUA_CORE
  11. #include "lua.h"
  12. #include "lapi.h"
  13. #include "lcode.h"
  14. #include "ldebug.h"
  15. #include "ldo.h"
  16. #include "lfunc.h"
  17. #include "lobject.h"
  18. #include "lopcodes.h"
  19. #include "lstate.h"
  20. #include "lstring.h"
  21. #include "ltable.h"
  22. #include "ltm.h"
  23. #include "lvm.h"
  24. static const char *getfuncname (lua_State *L, CallInfo *ci, const char **name);
  25. static int currentpc (lua_State *L, CallInfo *ci) {
  26. if (!isLua(ci)) return -1; /* function is not a Lua function? */
  27. return pcRel(ci->u.l.savedpc, ci_func(ci)->l.p);
  28. }
  29. static int currentline (lua_State *L, CallInfo *ci) {
  30. int pc = currentpc(L, ci);
  31. if (pc < 0)
  32. return -1; /* only active lua functions have current-line information */
  33. else
  34. return getline(ci_func(ci)->l.p, pc);
  35. }
  36. /*
  37. ** this function can be called asynchronous (e.g. during a signal)
  38. */
  39. LUA_API int lua_sethook (lua_State *L, lua_Hook func, int mask, int count) {
  40. if (func == NULL || mask == 0) { /* turn off hooks? */
  41. mask = 0;
  42. func = NULL;
  43. }
  44. L->oldpc = NULL;
  45. L->hook = func;
  46. L->basehookcount = count;
  47. resethookcount(L);
  48. L->hookmask = cast_byte(mask);
  49. return 1;
  50. }
  51. LUA_API lua_Hook lua_gethook (lua_State *L) {
  52. return L->hook;
  53. }
  54. LUA_API int lua_gethookmask (lua_State *L) {
  55. return L->hookmask;
  56. }
  57. LUA_API int lua_gethookcount (lua_State *L) {
  58. return L->basehookcount;
  59. }
  60. LUA_API int lua_getstack (lua_State *L, int level, lua_Debug *ar) {
  61. int status;
  62. CallInfo *ci;
  63. lua_lock(L);
  64. for (ci = L->ci; level > 0 && ci != &L->base_ci; ci = ci->previous) {
  65. level--;
  66. if (isLua(ci)) /* Lua function? */
  67. level -= ci->u.l.tailcalls; /* skip lost tail calls */
  68. }
  69. if (level == 0 && ci != &L->base_ci) { /* level found? */
  70. status = 1;
  71. ar->i_ci = ci;
  72. }
  73. else if (level < 0) { /* level is of a lost tail call? */
  74. status = 1;
  75. ar->i_ci = NULL;
  76. }
  77. else status = 0; /* no such level */
  78. lua_unlock(L);
  79. return status;
  80. }
  81. static Proto *getluaproto (CallInfo *ci) {
  82. return (isLua(ci) ? ci_func(ci)->l.p : NULL);
  83. }
  84. static const char *findlocal (lua_State *L, CallInfo *ci, int n) {
  85. const char *name;
  86. Proto *fp = getluaproto(ci);
  87. if (fp && (name = luaF_getlocalname(fp, n, currentpc(L, ci))) != NULL)
  88. return name; /* is a local variable in a Lua function */
  89. else {
  90. StkId limit = (ci == L->ci) ? L->top : ci->next->func;
  91. if (limit - ci->base >= n && n > 0) /* is 'n' inside 'ci' stack? */
  92. return "(*temporary)";
  93. else
  94. return NULL;
  95. }
  96. }
  97. LUA_API const char *lua_getlocal (lua_State *L, const lua_Debug *ar, int n) {
  98. CallInfo *ci = ar->i_ci;
  99. const char *name = findlocal(L, ci, n);
  100. lua_lock(L);
  101. if (name) {
  102. setobj2s(L, L->top, ci->base + (n - 1));
  103. api_incr_top(L);
  104. }
  105. lua_unlock(L);
  106. return name;
  107. }
  108. LUA_API const char *lua_setlocal (lua_State *L, const lua_Debug *ar, int n) {
  109. CallInfo *ci = ar->i_ci;
  110. const char *name = findlocal(L, ci, n);
  111. lua_lock(L);
  112. if (name)
  113. setobjs2s(L, ci->base + (n - 1), L->top - 1);
  114. L->top--; /* pop value */
  115. lua_unlock(L);
  116. return name;
  117. }
  118. static void funcinfo (lua_Debug *ar, Closure *cl) {
  119. if (cl->c.isC) {
  120. ar->source = "=[C]";
  121. ar->linedefined = -1;
  122. ar->lastlinedefined = -1;
  123. ar->what = "C";
  124. }
  125. else {
  126. ar->source = getstr(cl->l.p->source);
  127. ar->linedefined = cl->l.p->linedefined;
  128. ar->lastlinedefined = cl->l.p->lastlinedefined;
  129. ar->what = (ar->linedefined == 0) ? "main" : "Lua";
  130. }
  131. luaO_chunkid(ar->short_src, ar->source, LUA_IDSIZE);
  132. }
  133. static void info_tailcall (lua_Debug *ar) {
  134. ar->name = NULL;
  135. ar->namewhat = "";
  136. ar->what = "tail";
  137. ar->lastlinedefined = ar->linedefined = ar->currentline = -1;
  138. ar->source = "=(tail call)";
  139. luaO_chunkid(ar->short_src, ar->source, LUA_IDSIZE);
  140. ar->nups = 0;
  141. }
  142. static void collectvalidlines (lua_State *L, Closure *f) {
  143. if (f == NULL || f->c.isC) {
  144. setnilvalue(L->top);
  145. incr_top(L);
  146. }
  147. else {
  148. int i;
  149. int *lineinfo = f->l.p->lineinfo;
  150. Table *t = luaH_new(L);
  151. sethvalue(L, L->top, t);
  152. incr_top(L);
  153. for (i=0; i<f->l.p->sizelineinfo; i++)
  154. setbvalue(luaH_setnum(L, t, lineinfo[i]), 1);
  155. }
  156. }
  157. static int auxgetinfo (lua_State *L, const char *what, lua_Debug *ar,
  158. Closure *f, CallInfo *ci) {
  159. int status = 1;
  160. if (f == NULL) {
  161. info_tailcall(ar);
  162. return status;
  163. }
  164. for (; *what; what++) {
  165. switch (*what) {
  166. case 'S': {
  167. funcinfo(ar, f);
  168. break;
  169. }
  170. case 'l': {
  171. ar->currentline = (ci) ? currentline(L, ci) : -1;
  172. break;
  173. }
  174. case 'u': {
  175. ar->nups = f->c.nupvalues;
  176. break;
  177. }
  178. case 'n': {
  179. ar->namewhat = (ci) ? getfuncname(L, ci, &ar->name) : NULL;
  180. if (ar->namewhat == NULL) {
  181. ar->namewhat = ""; /* not found */
  182. ar->name = NULL;
  183. }
  184. break;
  185. }
  186. case 'L':
  187. case 'f': /* handled by lua_getinfo */
  188. break;
  189. default: status = 0; /* invalid option */
  190. }
  191. }
  192. return status;
  193. }
  194. LUA_API int lua_getinfo (lua_State *L, const char *what, lua_Debug *ar) {
  195. int status;
  196. Closure *f = NULL;
  197. CallInfo *ci = NULL;
  198. lua_lock(L);
  199. if (*what == '>') {
  200. StkId func = L->top - 1;
  201. luai_apicheck(L, ttisfunction(func));
  202. what++; /* skip the '>' */
  203. f = clvalue(func);
  204. L->top--; /* pop function */
  205. }
  206. else if (ar->i_ci != NULL) { /* no tail call? */
  207. ci = ar->i_ci;
  208. lua_assert(ttisfunction(ci->func));
  209. f = clvalue(ci->func);
  210. }
  211. status = auxgetinfo(L, what, ar, f, ci);
  212. if (strchr(what, 'f')) {
  213. if (f == NULL) setnilvalue(L->top);
  214. else setclvalue(L, L->top, f);
  215. incr_top(L);
  216. }
  217. if (strchr(what, 'L'))
  218. collectvalidlines(L, f);
  219. lua_unlock(L);
  220. return status;
  221. }
  222. /*
  223. ** {======================================================
  224. ** Symbolic Execution and code checker
  225. ** =======================================================
  226. */
  227. #define check(x) if (!(x)) return 0;
  228. #define checkreg(pt,reg) check((reg) < (pt)->maxstacksize)
  229. static int precheck (const Proto *pt) {
  230. check(pt->maxstacksize <= MAXSTACK);
  231. check(pt->numparams <= pt->maxstacksize);
  232. check(pt->sizeupvalues == pt->nups || pt->sizeupvalues == 0);
  233. check(pt->sizelineinfo == pt->sizecode || pt->sizelineinfo == 0);
  234. check(pt->sizecode > 0 && GET_OPCODE(pt->code[pt->sizecode-1]) == OP_RETURN);
  235. return 1;
  236. }
  237. #define checkopenop(pt,pc) luaG_checkopenop((pt)->code[(pc)+1])
  238. int luaG_checkopenop (Instruction i) {
  239. switch (GET_OPCODE(i)) {
  240. case OP_CALL:
  241. case OP_TAILCALL:
  242. case OP_RETURN:
  243. case OP_SETLIST: {
  244. check(GETARG_B(i) == 0);
  245. return 1;
  246. }
  247. default: return 0; /* invalid instruction after an open call */
  248. }
  249. }
  250. static int checkArgMode (const Proto *pt, int r, enum OpArgMask mode) {
  251. switch (mode) {
  252. case OpArgN: check(r == 0); break;
  253. case OpArgU: break;
  254. case OpArgR: checkreg(pt, r); break;
  255. case OpArgK:
  256. check(ISK(r) ? INDEXK(r) < pt->sizek : r < pt->maxstacksize);
  257. break;
  258. }
  259. return 1;
  260. }
  261. static Instruction symbexec (const Proto *pt, int lastpc, int reg) {
  262. int pc;
  263. int last; /* stores position of last instruction that changed `reg' */
  264. last = pt->sizecode-1; /* points to final return (a `neutral' instruction) */
  265. check(precheck(pt));
  266. for (pc = 0; pc < lastpc; pc++) {
  267. Instruction i = pt->code[pc];
  268. OpCode op = GET_OPCODE(i);
  269. int a = GETARG_A(i);
  270. int b = 0;
  271. int c = 0;
  272. check(op < NUM_OPCODES);
  273. switch (getOpMode(op)) {
  274. case iABC: {
  275. checkreg(pt, a);
  276. b = GETARG_B(i);
  277. c = GETARG_C(i);
  278. check(checkArgMode(pt, b, getBMode(op)));
  279. check(checkArgMode(pt, c, getCMode(op)));
  280. break;
  281. }
  282. case iABx: {
  283. checkreg(pt, a);
  284. b = GETARG_Bx(i);
  285. if (getBMode(op) == OpArgK) check(b < pt->sizek);
  286. break;
  287. }
  288. case iAsBx: {
  289. checkreg(pt, a);
  290. b = GETARG_sBx(i);
  291. if (getBMode(op) == OpArgR) {
  292. int dest = pc+1+b;
  293. check(0 <= dest && dest < pt->sizecode);
  294. }
  295. break;
  296. }
  297. case iAx: break;
  298. }
  299. if (testAMode(op)) {
  300. if (a == reg) last = pc; /* change register `a' */
  301. }
  302. if (testTMode(op))
  303. check(GET_OPCODE(pt->code[pc+1]) == OP_JMP);
  304. switch (op) {
  305. case OP_LOADBOOL: {
  306. check(c == 0 || pc+2 < pt->sizecode); /* check its jump */
  307. break;
  308. }
  309. case OP_LOADNIL: {
  310. if (a <= reg && reg <= b)
  311. last = pc; /* set registers from `a' to `b' */
  312. break;
  313. }
  314. case OP_GETUPVAL:
  315. case OP_SETUPVAL: {
  316. check(b < pt->nups);
  317. break;
  318. }
  319. case OP_GETGLOBAL:
  320. case OP_SETGLOBAL: {
  321. check(ttisstring(&pt->k[b]));
  322. break;
  323. }
  324. case OP_SELF: {
  325. checkreg(pt, a+1);
  326. if (reg == a+1) last = pc;
  327. break;
  328. }
  329. case OP_CONCAT: {
  330. check(b < c); /* at least two operands */
  331. break;
  332. }
  333. case OP_TFORCALL: {
  334. check(c >= 1); /* at least one result (control variable) */
  335. checkreg(pt, a+2+c); /* space for results */
  336. check(GET_OPCODE(pt->code[pc+1]) == OP_TFORLOOP);
  337. if (reg >= a+2) last = pc; /* affect all regs above its base */
  338. break;
  339. }
  340. case OP_TFORLOOP:
  341. case OP_FORLOOP:
  342. case OP_FORPREP:
  343. checkreg(pt, a+3);
  344. /* go through */
  345. case OP_JMP: {
  346. int dest = pc+1+b;
  347. /* not full check and jump is forward and do not skip `lastpc'? */
  348. if (reg != NO_REG && pc < dest && dest <= lastpc)
  349. pc += b; /* do the jump */
  350. break;
  351. }
  352. case OP_CALL:
  353. case OP_TAILCALL: {
  354. if (b != 0) {
  355. checkreg(pt, a+b-1);
  356. }
  357. c--; /* c = num. returns */
  358. if (c == LUA_MULTRET) {
  359. check(checkopenop(pt, pc));
  360. }
  361. else if (c != 0)
  362. checkreg(pt, a+c-1);
  363. if (reg >= a) last = pc; /* affect all registers above base */
  364. break;
  365. }
  366. case OP_RETURN: {
  367. b--; /* b = num. returns */
  368. if (b > 0) checkreg(pt, a+b-1);
  369. break;
  370. }
  371. case OP_SETLIST: {
  372. if (b > 0) checkreg(pt, a + b);
  373. if (c == 0) check(GET_OPCODE(pt->code[pc + 1]) == OP_EXTRAARG);
  374. break;
  375. }
  376. case OP_CLOSURE: {
  377. int nup, j;
  378. check(b < pt->sizep);
  379. nup = pt->p[b]->nups;
  380. check(pc + nup < pt->sizecode);
  381. for (j = 1; j <= nup; j++) {
  382. OpCode op1 = GET_OPCODE(pt->code[pc + j]);
  383. check(op1 == OP_GETUPVAL || op1 == OP_MOVE);
  384. }
  385. if (reg != NO_REG) /* tracing? */
  386. pc += nup; /* do not 'execute' these pseudo-instructions */
  387. break;
  388. }
  389. case OP_VARARG: {
  390. check(pt->is_vararg);
  391. b--;
  392. if (b == LUA_MULTRET) check(checkopenop(pt, pc));
  393. checkreg(pt, a+b-1);
  394. break;
  395. }
  396. default: break;
  397. }
  398. }
  399. return pt->code[last];
  400. }
  401. #undef check
  402. #undef checkreg
  403. /* }====================================================== */
  404. int luaG_checkcode (const Proto *pt) {
  405. return (symbexec(pt, pt->sizecode, NO_REG) != 0);
  406. }
  407. static const char *kname (Proto *p, int c) {
  408. if (ISK(c) && ttisstring(&p->k[INDEXK(c)]))
  409. return svalue(&p->k[INDEXK(c)]);
  410. else
  411. return "?";
  412. }
  413. static const char *getobjname (lua_State *L, CallInfo *ci, int stackpos,
  414. const char **name) {
  415. if (isLua(ci)) { /* a Lua function? */
  416. Proto *p = ci_func(ci)->l.p;
  417. int pc = currentpc(L, ci);
  418. Instruction i;
  419. *name = luaF_getlocalname(p, stackpos+1, pc);
  420. if (*name) /* is a local? */
  421. return "local";
  422. i = symbexec(p, pc, stackpos); /* try symbolic execution */
  423. lua_assert(pc != -1);
  424. switch (GET_OPCODE(i)) {
  425. case OP_GETGLOBAL: {
  426. int g = GETARG_Bx(i); /* global index */
  427. lua_assert(ttisstring(&p->k[g]));
  428. *name = svalue(&p->k[g]);
  429. return "global";
  430. }
  431. case OP_MOVE: {
  432. int a = GETARG_A(i);
  433. int b = GETARG_B(i); /* move from `b' to `a' */
  434. if (b < a)
  435. return getobjname(L, ci, b, name); /* get name for `b' */
  436. break;
  437. }
  438. case OP_GETTABLE: {
  439. int k = GETARG_C(i); /* key index */
  440. *name = kname(p, k);
  441. return "field";
  442. }
  443. case OP_GETUPVAL: {
  444. int u = GETARG_B(i); /* upvalue index */
  445. *name = p->upvalues ? getstr(p->upvalues[u]) : "?";
  446. return "upvalue";
  447. }
  448. case OP_SELF: {
  449. int k = GETARG_C(i); /* key index */
  450. *name = kname(p, k);
  451. return "method";
  452. }
  453. default: break;
  454. }
  455. }
  456. return NULL; /* no useful name found */
  457. }
  458. static const char *getfuncname (lua_State *L, CallInfo *ci, const char **name) {
  459. TMS tm = 0;
  460. Instruction i;
  461. if ((isLua(ci) && ci->u.l.tailcalls > 0) || !isLua(ci->previous))
  462. return NULL; /* calling function is not Lua (or is unknown) */
  463. ci = ci->previous; /* calling function */
  464. i = ci_func(ci)->l.p->code[currentpc(L, ci)];
  465. switch (GET_OPCODE(i)) {
  466. case OP_CALL:
  467. case OP_TAILCALL:
  468. case OP_TFORLOOP:
  469. return getobjname(L, ci, GETARG_A(i), name);
  470. case OP_GETGLOBAL:
  471. case OP_SELF:
  472. case OP_GETTABLE: tm = TM_INDEX; break;
  473. case OP_SETGLOBAL:
  474. case OP_SETTABLE: tm = TM_NEWINDEX; break;
  475. case OP_EQ: tm = TM_EQ; break;
  476. case OP_ADD: tm = TM_ADD; break;
  477. case OP_SUB: tm = TM_SUB; break;
  478. case OP_MUL: tm = TM_MUL; break;
  479. case OP_DIV: tm = TM_DIV; break;
  480. case OP_MOD: tm = TM_MOD; break;
  481. case OP_POW: tm = TM_POW; break;
  482. case OP_UNM: tm = TM_UNM; break;
  483. case OP_LEN: tm = TM_LEN; break;
  484. case OP_LT: tm = TM_LT; break;
  485. case OP_LE: tm = TM_LE; break;
  486. case OP_CONCAT: tm = TM_CONCAT; break;
  487. default:
  488. return NULL; /* else no useful name can be found */
  489. }
  490. *name = getstr(G(L)->tmname[tm]);
  491. return "metamethod";
  492. }
  493. /* only ANSI way to check whether a pointer points to an array */
  494. static int isinstack (CallInfo *ci, const TValue *o) {
  495. StkId p;
  496. for (p = ci->base; p < ci->top; p++)
  497. if (o == p) return 1;
  498. return 0;
  499. }
  500. void luaG_typeerror (lua_State *L, const TValue *o, const char *op) {
  501. const char *name = NULL;
  502. const char *t = luaT_typenames[ttype(o)];
  503. const char *kind = (isinstack(L->ci, o)) ?
  504. getobjname(L, L->ci, cast_int(o - L->base), &name) :
  505. NULL;
  506. if (kind)
  507. luaG_runerror(L, "attempt to %s %s " LUA_QS " (a %s value)",
  508. op, kind, name, t);
  509. else
  510. luaG_runerror(L, "attempt to %s a %s value", op, t);
  511. }
  512. void luaG_concaterror (lua_State *L, StkId p1, StkId p2) {
  513. if (ttisstring(p1) || ttisnumber(p1)) p1 = p2;
  514. lua_assert(!ttisstring(p1) && !ttisnumber(p2));
  515. luaG_typeerror(L, p1, "concatenate");
  516. }
  517. void luaG_aritherror (lua_State *L, const TValue *p1, const TValue *p2) {
  518. TValue temp;
  519. if (luaV_tonumber(p1, &temp) == NULL)
  520. p2 = p1; /* first operand is wrong */
  521. luaG_typeerror(L, p2, "perform arithmetic on");
  522. }
  523. int luaG_ordererror (lua_State *L, const TValue *p1, const TValue *p2) {
  524. const char *t1 = luaT_typenames[ttype(p1)];
  525. const char *t2 = luaT_typenames[ttype(p2)];
  526. if (t1[2] == t2[2])
  527. luaG_runerror(L, "attempt to compare two %s values", t1);
  528. else
  529. luaG_runerror(L, "attempt to compare %s with %s", t1, t2);
  530. return 0;
  531. }
  532. static void addinfo (lua_State *L, const char *msg) {
  533. CallInfo *ci = L->ci;
  534. if (isLua(ci)) { /* is Lua code? */
  535. char buff[LUA_IDSIZE]; /* add file:line information */
  536. int line = currentline(L, ci);
  537. luaO_chunkid(buff, getstr(getluaproto(ci)->source), LUA_IDSIZE);
  538. luaO_pushfstring(L, "%s:%d: %s", buff, line, msg);
  539. }
  540. }
  541. void luaG_errormsg (lua_State *L) {
  542. if (L->errfunc != 0) { /* is there an error handling function? */
  543. StkId errfunc = restorestack(L, L->errfunc);
  544. if (!ttisfunction(errfunc)) luaD_throw(L, LUA_ERRERR);
  545. setobjs2s(L, L->top, L->top - 1); /* move argument */
  546. setobjs2s(L, L->top - 1, errfunc); /* push function */
  547. incr_top(L);
  548. luaD_call(L, L->top - 2, 1, 0); /* call it */
  549. }
  550. luaD_throw(L, LUA_ERRRUN);
  551. }
  552. void luaG_runerror (lua_State *L, const char *fmt, ...) {
  553. va_list argp;
  554. va_start(argp, fmt);
  555. addinfo(L, luaO_pushvfstring(L, fmt, argp));
  556. va_end(argp);
  557. luaG_errormsg(L);
  558. }