lua/ldebug.c

586 lines
14 KiB
C
Raw Normal View History

/*
2003-02-27 15:32:30 +03:00
** $Id: ldebug.c,v 1.146 2003/02/27 11:52:30 roberto Exp roberto $
** Debug Interface
** See Copyright Notice in lua.h
*/
2000-02-17 21:30:36 +03:00
#include <stdlib.h>
2002-06-18 19:19:27 +04:00
#include <string.h>
2000-02-17 21:30:36 +03:00
2002-12-04 20:38:31 +03:00
#define ldebug_c
#include "lua.h"
#include "lapi.h"
2000-06-29 00:21:06 +04:00
#include "lcode.h"
#include "ldebug.h"
2000-01-19 15:00:45 +03:00
#include "ldo.h"
#include "lfunc.h"
#include "lobject.h"
2000-06-29 00:21:06 +04:00
#include "lopcodes.h"
#include "lstate.h"
#include "lstring.h"
#include "ltable.h"
#include "ltm.h"
#include "lvm.h"
2000-10-05 16:14:08 +04:00
2002-08-07 18:35:55 +04:00
static const char *getfuncname (CallInfo *ci, const char **name);
2000-08-11 20:17:28 +04:00
2000-01-19 15:00:45 +03:00
#define isLua(ci) (!((ci)->state & CI_C))
2000-10-05 16:14:08 +04:00
2002-08-07 18:35:55 +04:00
static int currentpc (CallInfo *ci) {
if (!isLua(ci)) return -1; /* function is not a Lua function? */
2002-08-12 21:23:12 +04:00
if (ci->state & CI_HASFRAME) /* function has a frame? */
ci->u.l.savedpc = *ci->u.l.pc; /* use `pc' from there */
/* function's pc is saved */
return pcRel(ci->u.l.savedpc, ci_func(ci)->l.p);
}
2002-08-07 18:35:55 +04:00
static int currentline (CallInfo *ci) {
int pc = currentpc(ci);
if (pc < 0)
return -1; /* only active lua functions have current-line information */
else
return getline(ci_func(ci)->l.p, pc);
}
void luaG_inithooks (lua_State *L) {
2002-08-06 19:32:22 +04:00
CallInfo *ci;
for (ci = L->ci; ci != L->base_ci; ci--) /* update all `savedpc's */
2002-08-07 18:35:55 +04:00
currentpc(ci);
L->hookinit = 1;
}
/*
** this function can be called asynchronous (e.g. during a signal)
*/
LUA_API int lua_sethook (lua_State *L, lua_Hook func, int mask, int count) {
if (func == NULL || mask == 0) { /* turn off hooks? */
mask = 0;
func = NULL;
}
L->hook = func;
L->basehookcount = count;
resethookcount(L);
L->hookmask = cast(lu_byte, mask);
L->hookinit = 0;
2002-07-08 22:21:33 +04:00
return 1;
}
LUA_API lua_Hook lua_gethook (lua_State *L) {
return L->hook;
}
LUA_API int lua_gethookmask (lua_State *L) {
return L->hookmask;
}
LUA_API int lua_gethookcount (lua_State *L) {
return L->basehookcount;
}
2000-10-20 20:39:03 +04:00
LUA_API int lua_getstack (lua_State *L, int level, lua_Debug *ar) {
int status;
CallInfo *ci;
2001-03-02 20:27:50 +03:00
lua_lock(L);
for (ci = L->ci; level > 0 && ci > L->base_ci; ci--) {
level--;
if (!(ci->state & CI_C)) /* Lua function? */
level -= ci->u.l.tailcalls; /* skip lost tail calls */
}
if (level > 0 || ci == L->base_ci) status = 0; /* there is no such level */
else if (level < 0) { /* level is of a lost tail call */
status = 1;
ar->i_ci = 0;
}
2000-01-19 15:00:45 +03:00
else {
status = 1;
ar->i_ci = ci - L->base_ci;
2000-01-19 15:00:45 +03:00
}
2001-03-02 20:27:50 +03:00
lua_unlock(L);
return status;
}
static Proto *getluaproto (CallInfo *ci) {
return (isLua(ci) ? ci_func(ci)->l.p : NULL);
}
LUA_API const char *lua_getlocal (lua_State *L, const lua_Debug *ar, int n) {
const char *name;
CallInfo *ci;
Proto *fp;
2001-03-02 20:27:50 +03:00
lua_lock(L);
name = NULL;
2002-03-11 15:45:00 +03:00
ci = L->base_ci + ar->i_ci;
fp = getluaproto(ci);
if (fp) { /* is a Lua function? */
2002-08-07 18:35:55 +04:00
name = luaF_getlocalname(fp, n, currentpc(ci));
if (name)
luaA_pushobject(L, ci->base+(n-1)); /* push value */
}
2001-03-02 20:27:50 +03:00
lua_unlock(L);
2000-08-28 21:57:04 +04:00
return name;
}
LUA_API const char *lua_setlocal (lua_State *L, const lua_Debug *ar, int n) {
const char *name;
CallInfo *ci;
Proto *fp;
2001-03-02 20:27:50 +03:00
lua_lock(L);
name = NULL;
2002-03-11 15:45:00 +03:00
ci = L->base_ci + ar->i_ci;
fp = getluaproto(ci);
L->top--; /* pop new value */
if (fp) { /* is a Lua function? */
2002-08-07 18:35:55 +04:00
name = luaF_getlocalname(fp, n, currentpc(ci));
if (!name || name[0] == '(') /* `(' starts private locals */
name = NULL;
else
setobjs2s(ci->base+(n-1), L->top);
}
2001-03-02 20:27:50 +03:00
lua_unlock(L);
2000-08-28 21:57:04 +04:00
return name;
2000-01-19 15:00:45 +03:00
}
2000-10-20 20:39:03 +04:00
static void funcinfo (lua_State *L, lua_Debug *ar, StkId func) {
Closure *cl = clvalue(func);
2001-10-02 20:45:03 +04:00
if (cl->c.isC) {
2002-05-15 22:57:44 +04:00
ar->source = "=[C]";
2000-10-05 16:14:08 +04:00
ar->linedefined = -1;
ar->what = "C";
2000-10-05 16:14:08 +04:00
}
else {
ar->source = getstr(cl->l.p->source);
ar->linedefined = cl->l.p->lineDefined;
ar->what = (ar->linedefined == 0) ? "main" : "Lua";
}
luaO_chunkid(ar->short_src, ar->source, LUA_IDSIZE);
}
static const char *travglobals (lua_State *L, const TObject *o) {
2001-12-05 23:15:18 +03:00
Table *g = hvalue(gt(L));
2001-10-25 23:14:14 +04:00
int i = sizenode(g);
while (i--) {
Node *n = node(g, i);
if (luaO_rawequalObj(o, val(n)) && ttisstring(key(n)))
2001-10-25 23:14:14 +04:00
return getstr(tsvalue(key(n)));
}
return NULL;
}
static void info_tailcall (lua_State *L, lua_Debug *ar) {
ar->name = ar->namewhat = "";
ar->what = "tail";
ar->linedefined = ar->currentline = -1;
ar->source = "=(tail call)";
luaO_chunkid(ar->short_src, ar->source, LUA_IDSIZE);
ar->nups = 0;
setnilvalue(L->top);
2000-01-19 15:00:45 +03:00
}
static int getinfo (lua_State *L, const char *what, lua_Debug *ar,
StkId f, CallInfo *ci) {
int status = 1;
2000-03-03 17:58:26 +03:00
for (; *what; what++) {
2000-01-19 15:00:45 +03:00
switch (*what) {
case 'S': {
funcinfo(L, ar, f);
2000-01-19 15:00:45 +03:00
break;
2000-08-11 20:17:28 +04:00
}
case 'l': {
2002-08-07 18:35:55 +04:00
ar->currentline = (ci) ? currentline(ci) : -1;
2000-01-19 15:00:45 +03:00
break;
2000-08-11 20:17:28 +04:00
}
case 'u': {
ar->nups = clvalue(f)->c.nupvalues;
2000-01-19 15:00:45 +03:00
break;
2000-08-11 20:17:28 +04:00
}
case 'n': {
2002-08-07 18:35:55 +04:00
ar->namewhat = (ci) ? getfuncname(ci, &ar->name) : NULL;
if (ar->namewhat == NULL) {
/* try to find a global name */
if ((ar->name = travglobals(L, f)) != NULL)
ar->namewhat = "global";
else ar->namewhat = ""; /* not found */
}
2000-01-19 15:00:45 +03:00
break;
2000-08-11 20:17:28 +04:00
}
case 'f': {
setobj2s(L->top, f);
2000-01-19 15:00:45 +03:00
break;
2000-08-11 20:17:28 +04:00
}
default: status = 0; /* invalid option */
2000-01-19 15:00:45 +03:00
}
}
return status;
}
LUA_API int lua_getinfo (lua_State *L, const char *what, lua_Debug *ar) {
int status = 1;
lua_lock(L);
if (*what == '>') {
StkId f = L->top - 1;
if (!ttisfunction(f))
luaG_runerror(L, "value for `lua_getinfo' is not a function");
status = getinfo(L, what + 1, ar, f, NULL);
L->top--; /* pop function */
}
else if (ar->i_ci != 0) { /* no tail call? */
CallInfo *ci = L->base_ci + ar->i_ci;
lua_assert(ttisfunction(ci->base - 1));
status = getinfo(L, what, ar, ci->base - 1, ci);
}
else
info_tailcall(L, ar);
if (strchr(what, 'f')) incr_top(L);
2001-03-02 20:27:50 +03:00
lua_unlock(L);
return status;
}
2000-01-19 15:00:45 +03:00
2000-06-29 00:21:06 +04:00
/*
** {======================================================
** Symbolic Execution and code checker
2000-06-29 00:21:06 +04:00
** =======================================================
*/
2001-02-16 20:58:27 +03:00
#define check(x) if (!(x)) return 0;
2000-08-10 23:50:47 +04:00
#define checkjump(pt,pc) check(0 <= pc && pc < pt->sizecode)
#define checkreg(pt,reg) check((reg) < (pt)->maxstacksize)
static int precheck (const Proto *pt) {
check(pt->maxstacksize <= MAXSTACK);
check(pt->sizelineinfo == pt->sizecode || pt->sizelineinfo == 0);
2002-02-06 01:39:12 +03:00
lua_assert(pt->numparams+pt->is_vararg <= pt->maxstacksize);
check(GET_OPCODE(pt->code[pt->sizecode-1]) == OP_RETURN);
return 1;
}
static int checkopenop (const Proto *pt, int pc) {
Instruction i = pt->code[pc+1];
switch (GET_OPCODE(i)) {
case OP_CALL:
case OP_TAILCALL:
case OP_RETURN: {
2002-01-10 01:02:47 +03:00
check(GETARG_B(i) == 0);
return 1;
}
case OP_SETLISTO: return 1;
default: return 0; /* invalid instruction after an open call */
}
2001-02-16 20:58:27 +03:00
}
2001-02-16 20:58:27 +03:00
static int checkRK (const Proto *pt, int r) {
return (r < pt->maxstacksize || (r >= MAXSTACK && r-MAXSTACK < pt->sizek));
}
static Instruction luaG_symbexec (const Proto *pt, int lastpc, int reg) {
2001-02-16 20:58:27 +03:00
int pc;
int last; /* stores position of last instruction that changed `reg' */
last = pt->sizecode-1; /* points to final return (a `neutral' instruction) */
check(precheck(pt));
for (pc = 0; pc < lastpc; pc++) {
const Instruction i = pt->code[pc];
2001-02-09 21:37:33 +03:00
OpCode op = GET_OPCODE(i);
int a = GETARG_A(i);
int b = 0;
int c = 0;
2001-06-11 18:56:42 +04:00
checkreg(pt, a);
switch (getOpMode(op)) {
case iABC: {
b = GETARG_B(i);
c = GETARG_C(i);
if (testOpMode(op, OpModeBreg)) {
checkreg(pt, b);
}
else if (testOpMode(op, OpModeBrk))
check(checkRK(pt, b));
if (testOpMode(op, OpModeCrk))
check(checkRK(pt, c));
2000-08-14 21:46:27 +04:00
break;
}
case iABx: {
b = GETARG_Bx(i);
if (testOpMode(op, OpModeK)) check(b < pt->sizek);
2000-08-14 21:46:27 +04:00
break;
}
case iAsBx: {
b = GETARG_sBx(i);
2000-06-29 00:21:06 +04:00
break;
}
}
if (testOpMode(op, OpModesetA)) {
if (a == reg) last = pc; /* change register `a' */
}
if (testOpMode(op, OpModeT)) {
check(pc+2 < pt->sizecode); /* check skip */
check(GET_OPCODE(pt->code[pc+1]) == OP_JMP);
}
switch (op) {
2001-12-12 01:48:44 +03:00
case OP_LOADBOOL: {
check(c == 0 || pc+2 < pt->sizecode); /* check its jump */
break;
}
case OP_LOADNIL: {
if (a <= reg && reg <= b)
last = pc; /* set registers from `a' to `b' */
2001-02-09 21:37:33 +03:00
break;
}
case OP_GETUPVAL:
case OP_SETUPVAL: {
check(b < pt->nups);
2001-02-09 21:37:33 +03:00
break;
}
case OP_GETGLOBAL:
case OP_SETGLOBAL: {
check(ttisstring(&pt->k[b]));
2001-02-09 21:37:33 +03:00
break;
}
case OP_SELF: {
checkreg(pt, a+1);
if (reg == a+1) last = pc;
2001-02-09 21:37:33 +03:00
break;
}
case OP_CONCAT: {
2001-07-03 21:01:34 +04:00
/* `c' is a register, and at least two operands */
check(c < MAXSTACK && b < c);
2001-02-09 21:37:33 +03:00
break;
}
case OP_TFORLOOP:
2002-12-11 15:34:22 +03:00
checkreg(pt, a+c+5);
if (reg >= a) last = pc; /* affect all registers above base */
/* go through */
2002-02-06 01:39:12 +03:00
case OP_FORLOOP:
checkreg(pt, a+2);
/* go through */
case OP_JMP: {
int dest = pc+1+b;
check(0 <= dest && dest < pt->sizecode);
/* not full check and jump is forward and do not skip `lastpc'? */
if (reg != NO_REG && pc < dest && dest <= lastpc)
pc += b; /* do the jump */
2000-06-29 00:21:06 +04:00
break;
}
case OP_CALL:
case OP_TAILCALL: {
2002-01-10 01:02:47 +03:00
if (b != 0) {
checkreg(pt, a+b-1);
2001-06-11 18:56:42 +04:00
}
2002-01-10 01:02:47 +03:00
c--; /* c = num. returns */
if (c == LUA_MULTRET) {
check(checkopenop(pt, pc));
}
2001-06-11 18:56:42 +04:00
else if (c != 0)
checkreg(pt, a+c-1);
if (reg >= a) last = pc; /* affect all registers above base */
2000-06-29 00:21:06 +04:00
break;
}
case OP_RETURN: {
2002-01-10 01:02:47 +03:00
b--; /* b = num. returns */
if (b > 0) checkreg(pt, a+b-1);
2001-02-09 21:37:33 +03:00
break;
}
case OP_SETLIST: {
checkreg(pt, a + (b&(LFIELDS_PER_FLUSH-1)) + 1);
2001-02-09 21:37:33 +03:00
break;
}
case OP_CLOSURE: {
int nup;
2001-06-28 18:57:17 +04:00
check(b < pt->sizep);
nup = pt->p[b]->nups;
check(pc + nup < pt->sizecode);
for (; nup>0; nup--) {
OpCode op1 = GET_OPCODE(pt->code[pc+nup]);
check(op1 == OP_GETUPVAL || op1 == OP_MOVE);
}
2001-02-09 21:37:33 +03:00
break;
2000-06-29 00:21:06 +04:00
}
default: break;
2000-06-29 00:21:06 +04:00
}
}
return pt->code[last];
2001-02-09 21:37:33 +03:00
}
2002-07-08 22:21:33 +04:00
#undef check
#undef checkjump
#undef checkreg
2001-02-16 20:58:27 +03:00
/* }====================================================== */
2001-02-09 21:37:33 +03:00
int luaG_checkcode (const Proto *pt) {
return luaG_symbexec(pt, pt->sizecode, NO_REG);
2000-06-29 00:21:06 +04:00
}
static const char *kname (Proto *p, int c) {
c = c - MAXSTACK;
if (c >= 0 && ttisstring(&p->k[c]))
return svalue(&p->k[c]);
else
return "?";
}
2002-08-07 18:35:55 +04:00
static const char *getobjname (CallInfo *ci, int stackpos, const char **name) {
if (isLua(ci)) { /* a Lua function? */
2001-10-02 20:45:03 +04:00
Proto *p = ci_func(ci)->l.p;
2002-08-07 18:35:55 +04:00
int pc = currentpc(ci);
Instruction i;
*name = luaF_getlocalname(p, stackpos+1, pc);
if (*name) /* is a local? */
return "local";
i = luaG_symbexec(p, pc, stackpos); /* try symbolic execution */
lua_assert(pc != -1);
2000-06-29 00:21:06 +04:00
switch (GET_OPCODE(i)) {
case OP_GETGLOBAL: {
int g = GETARG_Bx(i); /* global index */
lua_assert(ttisstring(&p->k[g]));
*name = svalue(&p->k[g]);
return "global";
2000-06-29 00:21:06 +04:00
}
case OP_MOVE: {
int a = GETARG_A(i);
int b = GETARG_B(i); /* move from `b' to `a' */
if (b < a)
2002-08-07 18:35:55 +04:00
return getobjname(ci, b, name); /* get name for `b' */
break;
2000-06-29 00:21:06 +04:00
}
case OP_GETTABLE: {
int k = GETARG_C(i); /* key index */
*name = kname(p, k);
return "field";
}
case OP_SELF: {
int k = GETARG_C(i); /* key index */
*name = kname(p, k);
return "method";
2000-06-29 00:21:06 +04:00
}
default: break;
2000-06-29 00:21:06 +04:00
}
}
return NULL; /* no useful name found */
2000-06-29 00:21:06 +04:00
}
2002-08-07 18:35:55 +04:00
static const char *getfuncname (CallInfo *ci, const char **name) {
Instruction i;
if ((isLua(ci) && ci->u.l.tailcalls > 0) || !isLua(ci - 1))
return NULL; /* calling function is not Lua (or is unknown) */
2001-12-18 23:52:30 +03:00
ci--; /* calling function */
i = ci_func(ci)->l.p->code[currentpc(ci)];
if (GET_OPCODE(i) == OP_CALL || GET_OPCODE(i) == OP_TAILCALL)
return getobjname(ci, GETARG_A(i), name);
else
return NULL; /* no useful name can be found */
}
/* only ANSI way to check whether a pointer points to an array */
static int isinstack (CallInfo *ci, const TObject *o) {
StkId p;
for (p = ci->base; p < ci->top; p++)
if (o == p) return 1;
return 0;
2000-08-11 20:17:28 +04:00
}
void luaG_typeerror (lua_State *L, const TObject *o, const char *op) {
2002-06-06 22:17:33 +04:00
const char *name = NULL;
2001-12-05 23:15:18 +03:00
const char *t = luaT_typenames[ttype(o)];
2002-06-06 22:17:33 +04:00
const char *kind = (isinstack(L->ci, o)) ?
getobjname(L->ci, o - L->base, &name) : NULL;
2000-06-29 00:21:06 +04:00
if (kind)
2002-05-15 22:57:44 +04:00
luaG_runerror(L, "attempt to %s %s `%s' (a %s value)",
2000-08-10 23:50:47 +04:00
op, kind, name, t);
2000-06-29 00:21:06 +04:00
else
2002-05-15 22:57:44 +04:00
luaG_runerror(L, "attempt to %s a %s value", op, t);
}
void luaG_concaterror (lua_State *L, StkId p1, StkId p2) {
if (ttisstring(p1)) p1 = p2;
lua_assert(!ttisstring(p1));
2003-02-27 15:32:30 +03:00
luaG_typeerror(L, p1, "concatenate");
}
void luaG_aritherror (lua_State *L, const TObject *p1, const TObject *p2) {
TObject temp;
if (luaV_tonumber(p1, &temp) == NULL)
p2 = p1; /* first operand is wrong */
luaG_typeerror(L, p2, "perform arithmetic on");
}
2000-08-11 20:17:28 +04:00
2002-06-24 19:07:21 +04:00
int luaG_ordererror (lua_State *L, const TObject *p1, const TObject *p2) {
2001-12-05 23:15:18 +03:00
const char *t1 = luaT_typenames[ttype(p1)];
const char *t2 = luaT_typenames[ttype(p2)];
2000-08-11 20:17:28 +04:00
if (t1[2] == t2[2])
2002-05-15 22:57:44 +04:00
luaG_runerror(L, "attempt to compare two %s values", t1);
2000-08-11 20:17:28 +04:00
else
2002-05-15 22:57:44 +04:00
luaG_runerror(L, "attempt to compare %s with %s", t1, t2);
2002-06-24 19:07:21 +04:00
return 0;
2002-05-15 22:57:44 +04:00
}
static void addinfo (lua_State *L, const char *msg) {
2002-06-21 00:39:44 +04:00
CallInfo *ci = L->ci;
if (isLua(ci)) { /* is Lua code? */
char buff[LUA_IDSIZE]; /* add file:line information */
2002-08-07 18:35:55 +04:00
int line = currentline(ci);
2002-06-18 19:19:27 +04:00
luaO_chunkid(buff, getstr(getluaproto(ci)->source), LUA_IDSIZE);
luaO_pushfstring(L, "%s:%d: %s", buff, line, msg);
2002-06-18 19:19:27 +04:00
}
}
void luaG_errormsg (lua_State *L) {
2002-08-06 19:32:22 +04:00
if (L->errfunc != 0) { /* is there an error handling function? */
StkId errfunc = restorestack(L, L->errfunc);
if (!ttisfunction(errfunc)) luaD_throw(L, LUA_ERRERR);
setobjs2s(L->top, L->top - 1); /* move argument */
setobjs2s(L->top - 1, errfunc); /* push function */
2002-08-06 19:32:22 +04:00
incr_top(L);
luaD_call(L, L->top - 2, 1); /* call it */
}
2002-06-18 19:19:27 +04:00
luaD_throw(L, LUA_ERRRUN);
}
2002-05-15 22:57:44 +04:00
void luaG_runerror (lua_State *L, const char *fmt, ...) {
va_list argp;
va_start(argp, fmt);
addinfo(L, luaO_pushvfstring(L, fmt, argp));
2002-05-15 22:57:44 +04:00
va_end(argp);
luaG_errormsg(L);
2000-08-11 20:17:28 +04:00
}