1999-12-15 02:31:20 +08:00
|
|
|
/*
|
2018-08-24 01:26:12 +08:00
|
|
|
** $Id: ldebug.c $
|
1999-12-15 02:31:20 +08:00
|
|
|
** Debug Interface
|
|
|
|
** See Copyright Notice in lua.h
|
|
|
|
*/
|
|
|
|
|
2014-11-03 03:19:04 +08:00
|
|
|
#define ldebug_c
|
|
|
|
#define LUA_CORE
|
|
|
|
|
|
|
|
#include "lprefix.h"
|
|
|
|
|
1999-12-15 02:31:20 +08:00
|
|
|
|
2004-02-21 00:01:05 +08:00
|
|
|
#include <stdarg.h>
|
2003-10-03 03:21:09 +08:00
|
|
|
#include <stddef.h>
|
2002-06-18 23:19:27 +08:00
|
|
|
#include <string.h>
|
2000-02-18 02:30:36 +08:00
|
|
|
|
2000-06-12 21:52:05 +08:00
|
|
|
#include "lua.h"
|
|
|
|
|
1999-12-15 02:31:20 +08:00
|
|
|
#include "lapi.h"
|
2000-06-29 04:21:06 +08:00
|
|
|
#include "lcode.h"
|
1999-12-30 00:31:15 +08:00
|
|
|
#include "ldebug.h"
|
2000-01-19 20:00:45 +08:00
|
|
|
#include "ldo.h"
|
1999-12-15 02:31:20 +08:00
|
|
|
#include "lfunc.h"
|
|
|
|
#include "lobject.h"
|
2000-06-29 04:21:06 +08:00
|
|
|
#include "lopcodes.h"
|
1999-12-15 02:31:20 +08:00
|
|
|
#include "lstate.h"
|
2000-09-12 04:29:27 +08:00
|
|
|
#include "lstring.h"
|
1999-12-15 02:31:20 +08:00
|
|
|
#include "ltable.h"
|
|
|
|
#include "ltm.h"
|
2001-06-06 02:17:01 +08:00
|
|
|
#include "lvm.h"
|
1999-12-15 02:31:20 +08:00
|
|
|
|
|
|
|
|
2000-10-05 20:14:08 +08:00
|
|
|
|
2020-01-31 22:09:53 +08:00
|
|
|
#define noLuaClosure(f) ((f) == NULL || (f)->c.tt == LUA_VCCL)
|
2012-01-21 06:05:50 +08:00
|
|
|
|
|
|
|
|
2017-11-07 21:25:26 +08:00
|
|
|
/* Active Lua function (given call info) */
|
|
|
|
#define ci_func(ci) (clLvalue(s2v((ci)->func)))
|
2015-03-12 00:10:41 +08:00
|
|
|
|
|
|
|
|
2017-11-07 21:25:26 +08:00
|
|
|
static const char *funcnamefromcode (lua_State *L, CallInfo *ci,
|
2016-10-19 20:32:10 +08:00
|
|
|
const char **name);
|
2000-08-12 00:17:28 +08:00
|
|
|
|
2000-01-19 20:00:45 +08:00
|
|
|
|
2017-11-07 21:25:26 +08:00
|
|
|
static int currentpc (CallInfo *ci) {
|
|
|
|
lua_assert(isLua(ci));
|
|
|
|
return pcRel(ci->u.l.savedpc, ci_func(ci)->p);
|
2002-03-26 01:47:14 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2017-06-27 19:35:31 +08:00
|
|
|
/*
|
|
|
|
** Get a "base line" to find the line corresponding to an instruction.
|
|
|
|
** For that, search the array of absolute line info for the largest saved
|
2017-11-24 03:29:04 +08:00
|
|
|
** instruction smaller or equal to the wanted instruction. A special
|
2017-06-27 19:35:31 +08:00
|
|
|
** case is when there is no absolute info or the instruction is before
|
|
|
|
** the first absolute one.
|
|
|
|
*/
|
2018-06-09 03:06:59 +08:00
|
|
|
static int getbaseline (const Proto *f, int pc, int *basepc) {
|
2017-06-27 19:35:31 +08:00
|
|
|
if (f->sizeabslineinfo == 0 || pc < f->abslineinfo[0].pc) {
|
|
|
|
*basepc = -1; /* start from the beginning */
|
|
|
|
return f->linedefined;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
unsigned int i;
|
|
|
|
if (pc >= f->abslineinfo[f->sizeabslineinfo - 1].pc)
|
|
|
|
i = f->sizeabslineinfo - 1; /* instruction is after last saved one */
|
|
|
|
else { /* binary search */
|
|
|
|
unsigned int j = f->sizeabslineinfo - 1; /* pc < anchorlines[j] */
|
|
|
|
i = 0; /* abslineinfo[i] <= pc */
|
|
|
|
while (i < j - 1) {
|
|
|
|
unsigned int m = (j + i) / 2;
|
|
|
|
if (pc >= f->abslineinfo[m].pc)
|
|
|
|
i = m;
|
|
|
|
else
|
|
|
|
j = m;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
*basepc = f->abslineinfo[i].pc;
|
|
|
|
return f->abslineinfo[i].line;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
** Get the line corresponding to instruction 'pc' in function 'f';
|
|
|
|
** first gets a base line and from there does the increments until
|
|
|
|
** the desired instruction.
|
|
|
|
*/
|
2018-06-09 03:06:59 +08:00
|
|
|
int luaG_getfuncline (const Proto *f, int pc) {
|
2017-06-27 19:35:31 +08:00
|
|
|
if (f->lineinfo == NULL) /* no debug information? */
|
|
|
|
return -1;
|
|
|
|
else {
|
|
|
|
int basepc;
|
|
|
|
int baseline = getbaseline(f, pc, &basepc);
|
|
|
|
while (basepc++ < pc) { /* walk until given instruction */
|
|
|
|
lua_assert(f->lineinfo[basepc] != ABSLINEINFO);
|
|
|
|
baseline += f->lineinfo[basepc]; /* correct line */
|
|
|
|
}
|
|
|
|
return baseline;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2017-11-07 21:25:26 +08:00
|
|
|
static int currentline (CallInfo *ci) {
|
|
|
|
return luaG_getfuncline(ci_func(ci)->p, currentpc(ci));
|
2002-03-26 01:47:14 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-11-18 19:01:55 +08:00
|
|
|
/*
|
2017-11-13 23:36:52 +08:00
|
|
|
** This function can be called asynchronously (e.g. during a signal),
|
|
|
|
** under "reasonable" assumptions. A new 'ci' is completely linked
|
|
|
|
** in the list before it becomes part of the "active" list, and
|
|
|
|
** we assume that pointers are atomic (see comment in next function).
|
|
|
|
** (If we traverse one more item, there is no problem. If we traverse
|
|
|
|
** one less item, the worst that can happen is that the signal will
|
|
|
|
** not interrupt the script.)
|
|
|
|
*/
|
|
|
|
static void settraps (CallInfo *ci) {
|
|
|
|
for (; ci != NULL; ci = ci->previous)
|
|
|
|
if (isLua(ci))
|
|
|
|
ci->u.l.trap = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
** This function can be called asynchronously (e.g. during a signal),
|
|
|
|
** under "reasonable" assumptions.
|
2015-12-17 00:40:07 +08:00
|
|
|
** Fields 'oldpc', 'basehookcount', and 'hookcount' (set by
|
|
|
|
** 'resethookcount') are for debug only, and it is no problem if they
|
|
|
|
** get arbitrary values (causes at most one wrong hook call). 'hookmask'
|
|
|
|
** is an atomic value. We assume that pointers are atomic too (e.g., gcc
|
|
|
|
** ensures that for all platforms where it runs). Moreover, 'hook' is
|
|
|
|
** always checked before being called (see 'luaD_hook').
|
2002-11-18 19:01:55 +08:00
|
|
|
*/
|
2013-12-09 22:21:10 +08:00
|
|
|
LUA_API void lua_sethook (lua_State *L, lua_Hook func, int mask, int count) {
|
2002-11-18 19:01:55 +08:00
|
|
|
if (func == NULL || mask == 0) { /* turn off hooks? */
|
|
|
|
mask = 0;
|
|
|
|
func = NULL;
|
|
|
|
}
|
2017-11-07 21:25:26 +08:00
|
|
|
if (isLua(L->ci))
|
|
|
|
L->oldpc = L->ci->u.l.savedpc;
|
2002-11-18 19:01:55 +08:00
|
|
|
L->hook = func;
|
|
|
|
L->basehookcount = count;
|
|
|
|
resethookcount(L);
|
2005-12-23 00:19:56 +08:00
|
|
|
L->hookmask = cast_byte(mask);
|
2018-02-07 03:16:56 +08:00
|
|
|
if (mask)
|
2017-11-13 23:36:52 +08:00
|
|
|
settraps(L->ci); /* to trace inside 'luaV_execute' */
|
2002-07-09 02:21:33 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
LUA_API lua_Hook lua_gethook (lua_State *L) {
|
|
|
|
return L->hook;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-11-26 01:47:13 +08:00
|
|
|
LUA_API int lua_gethookmask (lua_State *L) {
|
|
|
|
return L->hookmask;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
LUA_API int lua_gethookcount (lua_State *L) {
|
|
|
|
return L->basehookcount;
|
1999-12-15 02:31:20 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2000-10-21 00:39:03 +08:00
|
|
|
LUA_API int lua_getstack (lua_State *L, int level, lua_Debug *ar) {
|
2001-01-24 23:45:33 +08:00
|
|
|
int status;
|
2017-11-07 21:25:26 +08:00
|
|
|
CallInfo *ci;
|
2009-11-25 23:27:51 +08:00
|
|
|
if (level < 0) return 0; /* invalid (negative) level */
|
2001-03-03 01:27:50 +08:00
|
|
|
lua_lock(L);
|
2017-11-07 21:25:26 +08:00
|
|
|
for (ci = L->ci; level > 0 && ci != &L->base_ci; ci = ci->previous)
|
2003-02-27 19:52:30 +08:00
|
|
|
level--;
|
2017-11-07 21:25:26 +08:00
|
|
|
if (level == 0 && ci != &L->base_ci) { /* level found? */
|
2003-02-27 19:52:30 +08:00
|
|
|
status = 1;
|
2017-11-07 21:25:26 +08:00
|
|
|
ar->i_ci = ci;
|
2003-02-27 19:52:30 +08:00
|
|
|
}
|
2005-04-14 21:30:47 +08:00
|
|
|
else status = 0; /* no such level */
|
2001-03-03 01:27:50 +08:00
|
|
|
lua_unlock(L);
|
2001-01-24 23:45:33 +08:00
|
|
|
return status;
|
1999-12-31 02:28:40 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2018-06-09 03:06:59 +08:00
|
|
|
static const char *upvalname (const Proto *p, int uv) {
|
2011-09-14 01:40:20 +08:00
|
|
|
TString *s = check_exp(uv < p->sizeupvalues, p->upvalues[uv].name);
|
|
|
|
if (s == NULL) return "?";
|
|
|
|
else return getstr(s);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2018-02-09 23:16:06 +08:00
|
|
|
static const char *findvararg (CallInfo *ci, int n, StkId *pos) {
|
|
|
|
if (clLvalue(s2v(ci->func))->p->is_vararg) {
|
|
|
|
int nextra = ci->u.l.nextraargs;
|
|
|
|
if (n <= nextra) {
|
|
|
|
*pos = ci->func - nextra + (n - 1);
|
2018-11-30 02:02:44 +08:00
|
|
|
return "(vararg)"; /* generic name for any vararg */
|
2018-02-09 23:16:06 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
return NULL; /* no such vararg */
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2018-11-30 02:02:44 +08:00
|
|
|
const char *luaG_findlocal (lua_State *L, CallInfo *ci, int n, StkId *pos) {
|
2017-12-20 22:58:05 +08:00
|
|
|
StkId base = ci->func + 1;
|
2018-02-09 23:16:06 +08:00
|
|
|
const char *name = NULL;
|
|
|
|
if (isLua(ci)) {
|
|
|
|
if (n < 0) /* access to vararg values? */
|
|
|
|
return findvararg(ci, -n, pos);
|
|
|
|
else
|
|
|
|
name = luaF_getlocalname(ci_func(ci)->p, n, currentpc(ci));
|
|
|
|
}
|
2009-06-02 03:09:26 +08:00
|
|
|
if (name == NULL) { /* no 'standard' name? */
|
2017-11-07 21:25:26 +08:00
|
|
|
StkId limit = (ci == L->ci) ? L->top : ci->next->func;
|
2018-11-30 02:02:44 +08:00
|
|
|
if (limit - base >= n && n > 0) { /* is 'n' inside 'ci' stack? */
|
|
|
|
/* generic name for any valid slot */
|
|
|
|
name = isLua(ci) ? "(temporary)" : "(C temporary)";
|
|
|
|
}
|
2010-12-01 01:17:51 +08:00
|
|
|
else
|
2009-12-02 00:31:04 +08:00
|
|
|
return NULL; /* no name */
|
2001-01-24 23:45:33 +08:00
|
|
|
}
|
2018-11-30 02:02:44 +08:00
|
|
|
if (pos)
|
|
|
|
*pos = base + (n - 1);
|
2009-06-02 03:09:26 +08:00
|
|
|
return name;
|
2005-11-02 00:08:52 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
LUA_API const char *lua_getlocal (lua_State *L, const lua_Debug *ar, int n) {
|
2010-06-22 00:30:12 +08:00
|
|
|
const char *name;
|
2005-11-02 00:08:52 +08:00
|
|
|
lua_lock(L);
|
2010-06-22 00:30:12 +08:00
|
|
|
if (ar == NULL) { /* information about non-active function? */
|
2017-06-29 23:06:44 +08:00
|
|
|
if (!isLfunction(s2v(L->top - 1))) /* not a Lua function? */
|
2010-06-22 00:30:12 +08:00
|
|
|
name = NULL;
|
|
|
|
else /* consider live variables at function start (parameters) */
|
2017-06-29 23:06:44 +08:00
|
|
|
name = luaF_getlocalname(clLvalue(s2v(L->top - 1))->p, n, 0);
|
2010-06-22 00:30:12 +08:00
|
|
|
}
|
|
|
|
else { /* active function; get information through 'ar' */
|
2015-03-29 03:14:47 +08:00
|
|
|
StkId pos = NULL; /* to avoid warnings */
|
2018-11-30 02:02:44 +08:00
|
|
|
name = luaG_findlocal(L, ar->i_ci, n, &pos);
|
2010-06-22 00:30:12 +08:00
|
|
|
if (name) {
|
2017-06-29 23:06:44 +08:00
|
|
|
setobjs2s(L, L->top, pos);
|
2010-06-22 00:30:12 +08:00
|
|
|
api_incr_top(L);
|
|
|
|
}
|
2006-07-11 23:53:29 +08:00
|
|
|
}
|
2001-03-03 01:27:50 +08:00
|
|
|
lua_unlock(L);
|
2000-08-29 01:57:04 +08:00
|
|
|
return name;
|
1999-12-15 02:31:20 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2001-11-29 04:13:13 +08:00
|
|
|
LUA_API const char *lua_setlocal (lua_State *L, const lua_Debug *ar, int n) {
|
2015-03-29 03:14:47 +08:00
|
|
|
StkId pos = NULL; /* to avoid warnings */
|
2015-02-14 00:01:17 +08:00
|
|
|
const char *name;
|
2001-03-03 01:27:50 +08:00
|
|
|
lua_lock(L);
|
2018-11-30 02:02:44 +08:00
|
|
|
name = luaG_findlocal(L, ar->i_ci, n, &pos);
|
2015-01-02 20:52:22 +08:00
|
|
|
if (name) {
|
2010-12-01 01:17:51 +08:00
|
|
|
setobjs2s(L, pos, L->top - 1);
|
2015-01-02 20:52:22 +08:00
|
|
|
L->top--; /* pop value */
|
|
|
|
}
|
2001-03-03 01:27:50 +08:00
|
|
|
lua_unlock(L);
|
2000-08-29 01:57:04 +08:00
|
|
|
return name;
|
2000-01-19 20:00:45 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2005-05-17 02:45:15 +08:00
|
|
|
static void funcinfo (lua_Debug *ar, Closure *cl) {
|
2012-01-21 06:05:50 +08:00
|
|
|
if (noLuaClosure(cl)) {
|
2002-05-16 02:57:44 +08:00
|
|
|
ar->source = "=[C]";
|
2019-04-04 22:45:26 +08:00
|
|
|
ar->srclen = LL("=[C]");
|
2000-10-05 20:14:08 +08:00
|
|
|
ar->linedefined = -1;
|
2005-08-04 21:37:38 +08:00
|
|
|
ar->lastlinedefined = -1;
|
2001-11-29 04:13:13 +08:00
|
|
|
ar->what = "C";
|
2000-10-05 20:14:08 +08:00
|
|
|
}
|
2003-02-27 19:52:30 +08:00
|
|
|
else {
|
2018-06-09 03:06:59 +08:00
|
|
|
const Proto *p = cl->l.p;
|
2019-04-04 22:45:26 +08:00
|
|
|
if (p->source) {
|
|
|
|
ar->source = getstr(p->source);
|
|
|
|
ar->srclen = tsslen(p->source);
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
ar->source = "=?";
|
|
|
|
ar->srclen = LL("=?");
|
|
|
|
}
|
2010-10-12 04:24:42 +08:00
|
|
|
ar->linedefined = p->linedefined;
|
|
|
|
ar->lastlinedefined = p->lastlinedefined;
|
2003-02-27 19:52:30 +08:00
|
|
|
ar->what = (ar->linedefined == 0) ? "main" : "Lua";
|
|
|
|
}
|
2019-04-04 22:45:26 +08:00
|
|
|
luaO_chunkid(ar->short_src, ar->source, ar->srclen);
|
1999-12-15 02:31:20 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2018-06-09 03:06:59 +08:00
|
|
|
static int nextline (const Proto *p, int currentline, int pc) {
|
2017-06-27 19:35:31 +08:00
|
|
|
if (p->lineinfo[pc] != ABSLINEINFO)
|
|
|
|
return currentline + p->lineinfo[pc];
|
|
|
|
else
|
|
|
|
return luaG_getfuncline(p, pc);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2005-05-17 02:45:15 +08:00
|
|
|
static void collectvalidlines (lua_State *L, Closure *f) {
|
2012-01-21 06:05:50 +08:00
|
|
|
if (noLuaClosure(f)) {
|
2017-06-29 23:06:44 +08:00
|
|
|
setnilvalue(s2v(L->top));
|
2012-08-17 01:34:28 +08:00
|
|
|
api_incr_top(L);
|
2005-05-17 02:45:15 +08:00
|
|
|
}
|
|
|
|
else {
|
|
|
|
int i;
|
2011-08-10 04:58:29 +08:00
|
|
|
TValue v;
|
2018-06-09 03:06:59 +08:00
|
|
|
const Proto *p = f->l.p;
|
2017-06-27 19:35:31 +08:00
|
|
|
int currentline = p->linedefined;
|
2011-08-10 04:58:29 +08:00
|
|
|
Table *t = luaH_new(L); /* new table to store active lines */
|
2017-06-29 23:06:44 +08:00
|
|
|
sethvalue2s(L, L->top, t); /* push it on stack */
|
2012-08-17 01:34:28 +08:00
|
|
|
api_incr_top(L);
|
2020-01-06 22:38:31 +08:00
|
|
|
setbtvalue(&v); /* boolean 'true' to be the value of all indices */
|
2017-06-27 19:35:31 +08:00
|
|
|
for (i = 0; i < p->sizelineinfo; i++) { /* for all lines with code */
|
|
|
|
currentline = nextline(p, currentline, i);
|
|
|
|
luaH_setint(L, t, currentline, &v); /* table[line] = true */
|
|
|
|
}
|
2005-05-17 02:45:15 +08:00
|
|
|
}
|
2000-01-19 20:00:45 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2017-11-07 21:25:26 +08:00
|
|
|
static const char *getfuncname (lua_State *L, CallInfo *ci, const char **name) {
|
|
|
|
if (ci == NULL) /* no 'ci'? */
|
2016-10-19 20:32:10 +08:00
|
|
|
return NULL; /* no info */
|
2017-11-07 21:25:26 +08:00
|
|
|
else if (ci->callstatus & CIST_FIN) { /* is this a finalizer? */
|
2016-10-19 20:32:10 +08:00
|
|
|
*name = "__gc";
|
|
|
|
return "metamethod"; /* report it as such */
|
|
|
|
}
|
|
|
|
/* calling function is a known Lua function? */
|
2017-11-07 21:25:26 +08:00
|
|
|
else if (!(ci->callstatus & CIST_TAIL) && isLua(ci->previous))
|
|
|
|
return funcnamefromcode(L, ci->previous, name);
|
|
|
|
else return NULL; /* no way to find a name */
|
2016-10-19 20:32:10 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2003-03-20 05:24:04 +08:00
|
|
|
static int auxgetinfo (lua_State *L, const char *what, lua_Debug *ar,
|
2017-11-07 21:25:26 +08:00
|
|
|
Closure *f, CallInfo *ci) {
|
2001-01-24 23:45:33 +08:00
|
|
|
int status = 1;
|
2000-03-03 22:58:26 +08:00
|
|
|
for (; *what; what++) {
|
2000-01-19 20:00:45 +08:00
|
|
|
switch (*what) {
|
2001-11-29 04:13:13 +08:00
|
|
|
case 'S': {
|
2003-03-18 20:24:38 +08:00
|
|
|
funcinfo(ar, f);
|
2000-01-19 20:00:45 +08:00
|
|
|
break;
|
2000-08-12 00:17:28 +08:00
|
|
|
}
|
2001-11-29 04:13:13 +08:00
|
|
|
case 'l': {
|
2017-11-07 21:25:26 +08:00
|
|
|
ar->currentline = (ci && isLua(ci)) ? currentline(ci) : -1;
|
2000-01-19 20:00:45 +08:00
|
|
|
break;
|
2000-08-12 00:17:28 +08:00
|
|
|
}
|
2001-11-29 04:13:13 +08:00
|
|
|
case 'u': {
|
2010-04-14 23:13:48 +08:00
|
|
|
ar->nups = (f == NULL) ? 0 : f->c.nupvalues;
|
2012-01-21 06:05:50 +08:00
|
|
|
if (noLuaClosure(f)) {
|
2010-01-06 22:42:35 +08:00
|
|
|
ar->isvararg = 1;
|
|
|
|
ar->nparams = 0;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
ar->isvararg = f->l.p->is_vararg;
|
2018-02-09 23:16:06 +08:00
|
|
|
ar->nparams = f->l.p->numparams;
|
2010-01-06 22:42:35 +08:00
|
|
|
}
|
2000-01-19 20:00:45 +08:00
|
|
|
break;
|
2000-08-12 00:17:28 +08:00
|
|
|
}
|
2009-11-25 23:27:51 +08:00
|
|
|
case 't': {
|
2017-11-07 21:25:26 +08:00
|
|
|
ar->istailcall = (ci) ? ci->callstatus & CIST_TAIL : 0;
|
2009-11-25 23:27:51 +08:00
|
|
|
break;
|
|
|
|
}
|
2001-11-29 04:13:13 +08:00
|
|
|
case 'n': {
|
2017-11-07 21:25:26 +08:00
|
|
|
ar->namewhat = getfuncname(L, ci, &ar->name);
|
2003-02-27 19:52:30 +08:00
|
|
|
if (ar->namewhat == NULL) {
|
2003-10-21 02:42:28 +08:00
|
|
|
ar->namewhat = ""; /* not found */
|
|
|
|
ar->name = NULL;
|
2003-02-27 19:52:30 +08:00
|
|
|
}
|
2000-01-19 20:00:45 +08:00
|
|
|
break;
|
2000-08-12 00:17:28 +08:00
|
|
|
}
|
2018-02-18 03:29:29 +08:00
|
|
|
case 'r': {
|
|
|
|
if (ci == NULL || !(ci->callstatus & CIST_TRAN))
|
2018-03-16 23:33:34 +08:00
|
|
|
ar->ftransfer = ar->ntransfer = 0;
|
2018-02-18 03:29:29 +08:00
|
|
|
else {
|
2018-03-16 23:33:34 +08:00
|
|
|
ar->ftransfer = ci->u2.transferinfo.ftransfer;
|
|
|
|
ar->ntransfer = ci->u2.transferinfo.ntransfer;
|
2018-02-18 03:29:29 +08:00
|
|
|
}
|
2019-06-03 22:36:42 +08:00
|
|
|
break;
|
2018-02-18 03:29:29 +08:00
|
|
|
}
|
2005-05-17 02:45:15 +08:00
|
|
|
case 'L':
|
|
|
|
case 'f': /* handled by lua_getinfo */
|
2000-01-19 20:00:45 +08:00
|
|
|
break;
|
2001-01-24 23:45:33 +08:00
|
|
|
default: status = 0; /* invalid option */
|
2000-01-19 20:00:45 +08:00
|
|
|
}
|
|
|
|
}
|
2003-02-27 19:52:30 +08:00
|
|
|
return status;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
LUA_API int lua_getinfo (lua_State *L, const char *what, lua_Debug *ar) {
|
2005-05-17 02:45:15 +08:00
|
|
|
int status;
|
2010-04-14 23:13:48 +08:00
|
|
|
Closure *cl;
|
2017-11-07 21:25:26 +08:00
|
|
|
CallInfo *ci;
|
2017-06-29 23:06:44 +08:00
|
|
|
TValue *func;
|
2003-02-27 19:52:30 +08:00
|
|
|
lua_lock(L);
|
|
|
|
if (*what == '>') {
|
2017-11-07 21:25:26 +08:00
|
|
|
ci = NULL;
|
2017-06-29 23:06:44 +08:00
|
|
|
func = s2v(L->top - 1);
|
2015-03-07 03:49:50 +08:00
|
|
|
api_check(L, ttisfunction(func), "function expected");
|
2005-05-17 02:45:15 +08:00
|
|
|
what++; /* skip the '>' */
|
2003-02-27 19:52:30 +08:00
|
|
|
L->top--; /* pop function */
|
|
|
|
}
|
2009-11-25 23:27:51 +08:00
|
|
|
else {
|
2017-11-07 21:25:26 +08:00
|
|
|
ci = ar->i_ci;
|
|
|
|
func = s2v(ci->func);
|
2017-06-29 23:06:44 +08:00
|
|
|
lua_assert(ttisfunction(func));
|
2003-02-27 19:52:30 +08:00
|
|
|
}
|
2010-04-14 23:13:48 +08:00
|
|
|
cl = ttisclosure(func) ? clvalue(func) : NULL;
|
2017-11-07 21:25:26 +08:00
|
|
|
status = auxgetinfo(L, what, ar, cl, ci);
|
2005-05-17 02:45:15 +08:00
|
|
|
if (strchr(what, 'f')) {
|
2017-06-29 23:06:44 +08:00
|
|
|
setobj2s(L, L->top, func);
|
2012-08-17 01:34:28 +08:00
|
|
|
api_incr_top(L);
|
2005-05-17 02:45:15 +08:00
|
|
|
}
|
|
|
|
if (strchr(what, 'L'))
|
2010-04-14 23:13:48 +08:00
|
|
|
collectvalidlines(L, cl);
|
2001-03-03 01:27:50 +08:00
|
|
|
lua_unlock(L);
|
2001-01-24 23:45:33 +08:00
|
|
|
return status;
|
1999-12-15 02:31:20 +08:00
|
|
|
}
|
|
|
|
|
2000-01-19 20:00:45 +08:00
|
|
|
|
2000-06-29 04:21:06 +08:00
|
|
|
/*
|
|
|
|
** {======================================================
|
2009-05-01 01:42:21 +08:00
|
|
|
** Symbolic Execution
|
2000-06-29 04:21:06 +08:00
|
|
|
** =======================================================
|
|
|
|
*/
|
|
|
|
|
2018-06-09 03:06:59 +08:00
|
|
|
static const char *getobjname (const Proto *p, int lastpc, int reg,
|
2011-04-28 22:00:11 +08:00
|
|
|
const char **name);
|
2002-08-21 04:03:05 +08:00
|
|
|
|
2011-04-28 22:00:11 +08:00
|
|
|
|
|
|
|
/*
|
2017-04-29 04:57:45 +08:00
|
|
|
** Find a "name" for the constant 'c'.
|
2011-04-28 22:00:11 +08:00
|
|
|
*/
|
2018-06-09 03:06:59 +08:00
|
|
|
static void kname (const Proto *p, int c, const char **name) {
|
2017-10-05 05:56:32 +08:00
|
|
|
TValue *kvalue = &p->k[c];
|
2017-04-29 04:57:45 +08:00
|
|
|
*name = (ttisstring(kvalue)) ? svalue(kvalue) : "?";
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
** Find a "name" for the register 'c'.
|
|
|
|
*/
|
2018-06-09 03:06:59 +08:00
|
|
|
static void rname (const Proto *p, int pc, int c, const char **name) {
|
2017-04-29 04:57:45 +08:00
|
|
|
const char *what = getobjname(p, pc, c, name); /* search for 'c' */
|
|
|
|
if (!(what && *what == 'c')) /* did not find a constant name? */
|
|
|
|
*name = "?";
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
2017-10-05 05:56:32 +08:00
|
|
|
** Find a "name" for a 'C' value in an RK instruction.
|
2017-04-29 04:57:45 +08:00
|
|
|
*/
|
2018-06-09 03:06:59 +08:00
|
|
|
static void rkname (const Proto *p, int pc, Instruction i, const char **name) {
|
2017-10-05 05:56:32 +08:00
|
|
|
int c = GETARG_C(i); /* key index */
|
|
|
|
if (GETARG_k(i)) /* is 'c' a constant? */
|
|
|
|
kname(p, c, name);
|
2017-04-29 04:57:45 +08:00
|
|
|
else /* 'c' is a register */
|
|
|
|
rname(p, pc, c, name);
|
2009-05-05 02:26:21 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2013-07-11 04:32:36 +08:00
|
|
|
static int filterpc (int pc, int jmptarget) {
|
|
|
|
if (pc < jmptarget) /* is code conditional (inside a jump)? */
|
|
|
|
return -1; /* cannot know who sets that register */
|
|
|
|
else return pc; /* current position sets that register */
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2011-08-13 04:01:44 +08:00
|
|
|
/*
|
2019-09-07 01:14:11 +08:00
|
|
|
** Try to find last instruction before 'lastpc' that modified register 'reg'.
|
2011-08-13 04:01:44 +08:00
|
|
|
*/
|
2018-06-09 03:06:59 +08:00
|
|
|
static int findsetreg (const Proto *p, int lastpc, int reg) {
|
2010-02-27 04:40:29 +08:00
|
|
|
int pc;
|
2011-08-13 04:01:44 +08:00
|
|
|
int setreg = -1; /* keep last instruction that changed 'reg' */
|
2013-07-11 04:32:36 +08:00
|
|
|
int jmptarget = 0; /* any code before this address is conditional */
|
2019-09-07 01:14:11 +08:00
|
|
|
if (testMMMode(GET_OPCODE(p->code[lastpc])))
|
|
|
|
lastpc--; /* previous instruction was not actually executed */
|
2001-06-06 02:17:01 +08:00
|
|
|
for (pc = 0; pc < lastpc; pc++) {
|
2009-05-05 02:26:21 +08:00
|
|
|
Instruction i = p->code[pc];
|
2001-02-10 02:37:33 +08:00
|
|
|
OpCode op = GET_OPCODE(i);
|
2001-06-06 02:17:01 +08:00
|
|
|
int a = GETARG_A(i);
|
2017-04-29 23:28:38 +08:00
|
|
|
int change; /* true if current instruction changed 'reg' */
|
2009-05-05 02:26:21 +08:00
|
|
|
switch (op) {
|
2017-04-29 23:28:38 +08:00
|
|
|
case OP_LOADNIL: { /* set registers from 'a' to 'a+b' */
|
2011-04-20 00:22:13 +08:00
|
|
|
int b = GETARG_B(i);
|
2017-04-29 23:28:38 +08:00
|
|
|
change = (a <= reg && reg <= a + b);
|
2001-02-10 02:37:33 +08:00
|
|
|
break;
|
|
|
|
}
|
2017-04-29 23:28:38 +08:00
|
|
|
case OP_TFORCALL: { /* affect all regs above its base */
|
|
|
|
change = (reg >= a + 2);
|
2000-06-29 04:21:06 +08:00
|
|
|
break;
|
|
|
|
}
|
2002-08-05 22:51:21 +08:00
|
|
|
case OP_CALL:
|
2017-04-29 23:28:38 +08:00
|
|
|
case OP_TAILCALL: { /* affect all registers above base */
|
|
|
|
change = (reg >= a);
|
2000-06-29 04:21:06 +08:00
|
|
|
break;
|
|
|
|
}
|
2017-04-29 23:28:38 +08:00
|
|
|
case OP_JMP: { /* doesn't change registers, but changes 'jmptarget' */
|
2017-11-08 01:20:42 +08:00
|
|
|
int b = GETARG_sJ(i);
|
2009-05-05 02:26:21 +08:00
|
|
|
int dest = pc + 1 + b;
|
2017-04-29 23:28:38 +08:00
|
|
|
/* jump does not skip 'lastpc' and is larger than current one? */
|
|
|
|
if (dest <= lastpc && dest > jmptarget)
|
|
|
|
jmptarget = dest; /* update 'jmptarget' */
|
|
|
|
change = 0;
|
2011-04-19 03:49:13 +08:00
|
|
|
break;
|
|
|
|
}
|
2017-04-29 23:28:38 +08:00
|
|
|
default: /* any instruction that sets A */
|
|
|
|
change = (testAMode(op) && reg == a);
|
2001-06-06 02:17:01 +08:00
|
|
|
break;
|
2000-06-29 04:21:06 +08:00
|
|
|
}
|
2017-04-29 23:28:38 +08:00
|
|
|
if (change)
|
|
|
|
setreg = filterpc(pc, jmptarget);
|
2000-06-29 04:21:06 +08:00
|
|
|
}
|
2011-08-13 04:01:44 +08:00
|
|
|
return setreg;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2017-04-29 04:57:45 +08:00
|
|
|
/*
|
|
|
|
** Check whether table being indexed by instruction 'i' is the
|
|
|
|
** environment '_ENV'
|
|
|
|
*/
|
2018-06-09 03:06:59 +08:00
|
|
|
static const char *gxf (const Proto *p, int pc, Instruction i, int isup) {
|
2017-04-29 04:57:45 +08:00
|
|
|
int t = GETARG_B(i); /* table index */
|
|
|
|
const char *name; /* name of indexed variable */
|
|
|
|
if (isup) /* is an upvalue? */
|
|
|
|
name = upvalname(p, t);
|
|
|
|
else
|
|
|
|
getobjname(p, pc, t, &name);
|
|
|
|
return (name && strcmp(name, LUA_ENV) == 0) ? "global" : "field";
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2019-06-03 22:36:42 +08:00
|
|
|
static const char *getobjname (const Proto *p, int lastpc, int reg,
|
|
|
|
const char **name) {
|
2011-08-13 04:01:44 +08:00
|
|
|
int pc;
|
|
|
|
*name = luaF_getlocalname(p, reg + 1, lastpc);
|
|
|
|
if (*name) /* is a local? */
|
|
|
|
return "local";
|
|
|
|
/* else try symbolic execution */
|
|
|
|
pc = findsetreg(p, lastpc, reg);
|
|
|
|
if (pc != -1) { /* could find instruction? */
|
|
|
|
Instruction i = p->code[pc];
|
|
|
|
OpCode op = GET_OPCODE(i);
|
|
|
|
switch (op) {
|
|
|
|
case OP_MOVE: {
|
|
|
|
int b = GETARG_B(i); /* move from 'b' to 'a' */
|
2011-09-14 02:05:59 +08:00
|
|
|
if (b < GETARG_A(i))
|
2011-08-13 04:01:44 +08:00
|
|
|
return getobjname(p, pc, b, name); /* get name for 'b' */
|
2011-09-14 02:05:59 +08:00
|
|
|
break;
|
2011-08-13 04:01:44 +08:00
|
|
|
}
|
2017-04-29 04:57:45 +08:00
|
|
|
case OP_GETTABUP: {
|
|
|
|
int k = GETARG_C(i); /* key index */
|
|
|
|
kname(p, k, name);
|
|
|
|
return gxf(p, pc, i, 1);
|
|
|
|
}
|
2011-08-13 04:01:44 +08:00
|
|
|
case OP_GETTABLE: {
|
|
|
|
int k = GETARG_C(i); /* key index */
|
2017-04-29 04:57:45 +08:00
|
|
|
rname(p, pc, k, name);
|
|
|
|
return gxf(p, pc, i, 0);
|
|
|
|
}
|
|
|
|
case OP_GETI: {
|
|
|
|
*name = "integer index";
|
|
|
|
return "field";
|
|
|
|
}
|
|
|
|
case OP_GETFIELD: {
|
|
|
|
int k = GETARG_C(i); /* key index */
|
|
|
|
kname(p, k, name);
|
|
|
|
return gxf(p, pc, i, 0);
|
2011-08-13 04:01:44 +08:00
|
|
|
}
|
|
|
|
case OP_GETUPVAL: {
|
2011-09-14 02:05:59 +08:00
|
|
|
*name = upvalname(p, GETARG_B(i));
|
2011-08-13 04:01:44 +08:00
|
|
|
return "upvalue";
|
|
|
|
}
|
|
|
|
case OP_LOADK:
|
|
|
|
case OP_LOADKX: {
|
|
|
|
int b = (op == OP_LOADK) ? GETARG_Bx(i)
|
|
|
|
: GETARG_Ax(p->code[pc + 1]);
|
|
|
|
if (ttisstring(&p->k[b])) {
|
|
|
|
*name = svalue(&p->k[b]);
|
|
|
|
return "constant";
|
|
|
|
}
|
2011-09-14 02:05:59 +08:00
|
|
|
break;
|
2011-08-13 04:01:44 +08:00
|
|
|
}
|
|
|
|
case OP_SELF: {
|
2017-10-05 05:56:32 +08:00
|
|
|
rkname(p, pc, i, name);
|
2011-08-13 04:01:44 +08:00
|
|
|
return "method";
|
|
|
|
}
|
|
|
|
default: break; /* go through to return NULL */
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return NULL; /* could not find reasonable name */
|
2000-06-29 04:21:06 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2016-10-19 20:32:10 +08:00
|
|
|
/*
|
|
|
|
** Try to find a name for a function based on the code that called it.
|
|
|
|
** (Only works when function was called by a Lua function.)
|
|
|
|
** Returns what the name is (e.g., "for iterator", "method",
|
|
|
|
** "metamethod") and sets '*name' to point to the name.
|
|
|
|
*/
|
2017-11-07 21:25:26 +08:00
|
|
|
static const char *funcnamefromcode (lua_State *L, CallInfo *ci,
|
2016-10-19 20:32:10 +08:00
|
|
|
const char **name) {
|
|
|
|
TMS tm = (TMS)0; /* (initial value avoids warnings) */
|
2018-06-09 03:06:59 +08:00
|
|
|
const Proto *p = ci_func(ci)->p; /* calling function */
|
2017-11-07 21:25:26 +08:00
|
|
|
int pc = currentpc(ci); /* calling instruction index */
|
2011-08-13 04:01:44 +08:00
|
|
|
Instruction i = p->code[pc]; /* calling instruction */
|
2017-11-07 21:25:26 +08:00
|
|
|
if (ci->callstatus & CIST_HOOKED) { /* was it called inside a hook? */
|
2014-12-08 23:48:23 +08:00
|
|
|
*name = "?";
|
|
|
|
return "hook";
|
|
|
|
}
|
2007-05-09 23:49:36 +08:00
|
|
|
switch (GET_OPCODE(i)) {
|
|
|
|
case OP_CALL:
|
2016-10-19 20:32:10 +08:00
|
|
|
case OP_TAILCALL:
|
|
|
|
return getobjname(p, pc, GETARG_A(i), name); /* get function name */
|
2011-08-13 04:01:44 +08:00
|
|
|
case OP_TFORCALL: { /* for iterator */
|
2010-03-05 22:01:29 +08:00
|
|
|
*name = "for iterator";
|
|
|
|
return "for iterator";
|
|
|
|
}
|
2016-10-19 20:32:10 +08:00
|
|
|
/* other instructions can do calls through metamethods */
|
2014-11-10 22:46:46 +08:00
|
|
|
case OP_SELF: case OP_GETTABUP: case OP_GETTABLE:
|
2017-04-29 04:57:45 +08:00
|
|
|
case OP_GETI: case OP_GETFIELD:
|
2014-11-10 22:46:46 +08:00
|
|
|
tm = TM_INDEX;
|
|
|
|
break;
|
2017-04-29 04:57:45 +08:00
|
|
|
case OP_SETTABUP: case OP_SETTABLE: case OP_SETI: case OP_SETFIELD:
|
2014-11-10 22:46:46 +08:00
|
|
|
tm = TM_NEWINDEX;
|
|
|
|
break;
|
2019-08-28 00:59:39 +08:00
|
|
|
case OP_MMBIN: case OP_MMBINI: case OP_MMBINK: {
|
|
|
|
tm = cast(TMS, GETARG_C(i));
|
2018-11-23 22:23:45 +08:00
|
|
|
break;
|
|
|
|
}
|
2007-05-09 23:49:36 +08:00
|
|
|
case OP_UNM: tm = TM_UNM; break;
|
2014-11-10 22:46:46 +08:00
|
|
|
case OP_BNOT: tm = TM_BNOT; break;
|
2007-05-09 23:49:36 +08:00
|
|
|
case OP_LEN: tm = TM_LEN; break;
|
2014-11-10 22:46:46 +08:00
|
|
|
case OP_CONCAT: tm = TM_CONCAT; break;
|
|
|
|
case OP_EQ: tm = TM_EQ; break;
|
2017-12-07 23:44:10 +08:00
|
|
|
case OP_LT: case OP_LE: case OP_LTI: case OP_LEI:
|
|
|
|
*name = "order"; /* '<=' can call '__lt', etc. */
|
|
|
|
return "metamethod";
|
2019-07-31 22:22:39 +08:00
|
|
|
case OP_CLOSE: case OP_RETURN:
|
|
|
|
*name = "close";
|
|
|
|
return "metamethod";
|
2016-10-19 20:32:10 +08:00
|
|
|
default:
|
|
|
|
return NULL; /* cannot find a reasonable name */
|
2007-05-09 23:49:36 +08:00
|
|
|
}
|
2017-12-07 23:44:10 +08:00
|
|
|
*name = getstr(G(L)->tmname[tm]) + 2;
|
2007-05-09 23:49:36 +08:00
|
|
|
return "metamethod";
|
2002-03-19 20:45:25 +08:00
|
|
|
}
|
|
|
|
|
2009-05-05 02:26:21 +08:00
|
|
|
/* }====================================================== */
|
|
|
|
|
|
|
|
|
2002-03-19 20:45:25 +08:00
|
|
|
|
2011-04-28 22:00:11 +08:00
|
|
|
/*
|
2014-11-11 02:41:19 +08:00
|
|
|
** The subtraction of two potentially unrelated pointers is
|
|
|
|
** not ISO C, but it should not crash a program; the subsequent
|
|
|
|
** checks are ISO C and ensure a correct result.
|
2011-04-28 22:00:11 +08:00
|
|
|
*/
|
2017-11-07 21:25:26 +08:00
|
|
|
static int isinstack (CallInfo *ci, const TValue *o) {
|
|
|
|
StkId base = ci->func + 1;
|
2017-06-29 23:06:44 +08:00
|
|
|
ptrdiff_t i = cast(StkId, o) - base;
|
2017-11-07 21:25:26 +08:00
|
|
|
return (0 <= i && i < (ci->top - base) && s2v(base + i) == o);
|
2000-08-12 00:17:28 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2014-11-11 02:41:19 +08:00
|
|
|
/*
|
|
|
|
** Checks whether value 'o' came from an upvalue. (That can only happen
|
|
|
|
** with instructions OP_GETTABUP/OP_SETTABUP, which operate directly on
|
|
|
|
** upvalues.)
|
|
|
|
*/
|
2017-11-07 21:25:26 +08:00
|
|
|
static const char *getupvalname (CallInfo *ci, const TValue *o,
|
2011-09-14 01:40:20 +08:00
|
|
|
const char **name) {
|
2017-11-07 21:25:26 +08:00
|
|
|
LClosure *c = ci_func(ci);
|
2010-02-27 04:40:29 +08:00
|
|
|
int i;
|
|
|
|
for (i = 0; i < c->nupvalues; i++) {
|
2010-04-09 01:06:33 +08:00
|
|
|
if (c->upvals[i]->v == o) {
|
2011-09-14 01:40:20 +08:00
|
|
|
*name = upvalname(c->p, i);
|
2010-02-27 04:40:29 +08:00
|
|
|
return "upvalue";
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2013-05-07 01:21:59 +08:00
|
|
|
static const char *varinfo (lua_State *L, const TValue *o) {
|
2014-11-12 01:08:19 +08:00
|
|
|
const char *name = NULL; /* to avoid warnings */
|
2017-11-07 21:25:26 +08:00
|
|
|
CallInfo *ci = L->ci;
|
2010-02-27 04:40:29 +08:00
|
|
|
const char *kind = NULL;
|
2017-11-07 21:25:26 +08:00
|
|
|
if (isLua(ci)) {
|
|
|
|
kind = getupvalname(ci, o, &name); /* check whether 'o' is an upvalue */
|
|
|
|
if (!kind && isinstack(ci, o)) /* no? try a register */
|
|
|
|
kind = getobjname(ci_func(ci)->p, currentpc(ci),
|
|
|
|
cast_int(cast(StkId, o) - (ci->func + 1)), &name);
|
2010-02-27 04:40:29 +08:00
|
|
|
}
|
2014-10-18 00:28:21 +08:00
|
|
|
return (kind) ? luaO_pushfstring(L, " (%s '%s')", kind, name) : "";
|
2013-05-07 01:21:59 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
l_noret luaG_typeerror (lua_State *L, const TValue *o, const char *op) {
|
2016-02-27 03:20:15 +08:00
|
|
|
const char *t = luaT_objtypename(L, o);
|
2013-05-07 01:21:59 +08:00
|
|
|
luaG_runerror(L, "attempt to %s a %s value%s", op, t, varinfo(L, o));
|
1999-12-30 00:31:15 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2018-10-31 02:46:56 +08:00
|
|
|
l_noret luaG_forerror (lua_State *L, const TValue *o, const char *what) {
|
|
|
|
luaG_runerror(L, "bad 'for' %s (number expected, got %s)",
|
|
|
|
what, luaT_objtypename(L, o));
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2013-04-30 00:58:10 +08:00
|
|
|
l_noret luaG_concaterror (lua_State *L, const TValue *p1, const TValue *p2) {
|
2014-07-30 22:00:14 +08:00
|
|
|
if (ttisstring(p1) || cvt2str(p1)) p1 = p2;
|
2003-02-27 20:32:30 +08:00
|
|
|
luaG_typeerror(L, p1, "concatenate");
|
2001-06-06 02:17:01 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2014-11-10 22:46:46 +08:00
|
|
|
l_noret luaG_opinterror (lua_State *L, const TValue *p1,
|
|
|
|
const TValue *p2, const char *msg) {
|
2017-07-08 00:34:32 +08:00
|
|
|
if (!ttisnumber(p1)) /* first operand is wrong? */
|
2014-07-17 20:30:53 +08:00
|
|
|
p2 = p1; /* now second is wrong */
|
2014-11-10 22:46:46 +08:00
|
|
|
luaG_typeerror(L, p2, msg);
|
1999-12-30 00:31:15 +08:00
|
|
|
}
|
2000-08-09 04:42:07 +08:00
|
|
|
|
2000-08-12 00:17:28 +08:00
|
|
|
|
2014-07-17 20:30:53 +08:00
|
|
|
/*
|
|
|
|
** Error when both values are convertible to numbers, but not to integers
|
|
|
|
*/
|
2013-05-07 01:21:59 +08:00
|
|
|
l_noret luaG_tointerror (lua_State *L, const TValue *p1, const TValue *p2) {
|
|
|
|
lua_Integer temp;
|
2017-11-08 22:50:23 +08:00
|
|
|
if (!tointegerns(p1, &temp))
|
2013-05-07 01:21:59 +08:00
|
|
|
p2 = p1;
|
2014-07-17 20:30:53 +08:00
|
|
|
luaG_runerror(L, "number%s has no integer representation", varinfo(L, p2));
|
2013-05-07 01:21:59 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2011-10-08 04:45:19 +08:00
|
|
|
l_noret luaG_ordererror (lua_State *L, const TValue *p1, const TValue *p2) {
|
2016-02-27 03:20:15 +08:00
|
|
|
const char *t1 = luaT_objtypename(L, p1);
|
|
|
|
const char *t2 = luaT_objtypename(L, p2);
|
|
|
|
if (strcmp(t1, t2) == 0)
|
2002-05-16 02:57:44 +08:00
|
|
|
luaG_runerror(L, "attempt to compare two %s values", t1);
|
2000-08-12 00:17:28 +08:00
|
|
|
else
|
2002-05-16 02:57:44 +08:00
|
|
|
luaG_runerror(L, "attempt to compare %s with %s", t1, t2);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2015-05-23 01:45:56 +08:00
|
|
|
/* add src:line information to 'msg' */
|
|
|
|
const char *luaG_addinfo (lua_State *L, const char *msg, TString *src,
|
|
|
|
int line) {
|
|
|
|
char buff[LUA_IDSIZE];
|
|
|
|
if (src)
|
2019-04-04 22:45:26 +08:00
|
|
|
luaO_chunkid(buff, getstr(src), tsslen(src));
|
2015-05-23 01:45:56 +08:00
|
|
|
else { /* no source available; use "?" instead */
|
|
|
|
buff[0] = '?'; buff[1] = '\0';
|
2002-06-18 23:19:27 +08:00
|
|
|
}
|
2015-05-23 01:45:56 +08:00
|
|
|
return luaO_pushfstring(L, "%s:%d: %s", buff, line, msg);
|
2002-06-18 23:19:27 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2011-10-08 04:45:19 +08:00
|
|
|
l_noret luaG_errormsg (lua_State *L) {
|
2002-08-06 23:32:22 +08:00
|
|
|
if (L->errfunc != 0) { /* is there an error handling function? */
|
|
|
|
StkId errfunc = restorestack(L, L->errfunc);
|
2018-01-10 20:02:35 +08:00
|
|
|
lua_assert(ttisfunction(s2v(errfunc)));
|
2003-12-10 20:13:36 +08:00
|
|
|
setobjs2s(L, L->top, L->top - 1); /* move argument */
|
|
|
|
setobjs2s(L, L->top - 1, errfunc); /* push function */
|
2014-11-12 01:08:19 +08:00
|
|
|
L->top++; /* assume EXTRA_STACK */
|
2015-11-03 02:48:07 +08:00
|
|
|
luaD_callnoyield(L, L->top - 2, 1); /* call it */
|
2002-08-06 23:32:22 +08:00
|
|
|
}
|
2002-06-18 23:19:27 +08:00
|
|
|
luaD_throw(L, LUA_ERRRUN);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2011-10-08 04:45:19 +08:00
|
|
|
l_noret luaG_runerror (lua_State *L, const char *fmt, ...) {
|
2017-11-07 21:25:26 +08:00
|
|
|
CallInfo *ci = L->ci;
|
2015-05-23 01:45:56 +08:00
|
|
|
const char *msg;
|
2002-05-16 02:57:44 +08:00
|
|
|
va_list argp;
|
2017-07-11 01:35:12 +08:00
|
|
|
luaC_checkGC(L); /* error message uses memory */
|
2002-05-16 02:57:44 +08:00
|
|
|
va_start(argp, fmt);
|
2015-05-23 01:45:56 +08:00
|
|
|
msg = luaO_pushvfstring(L, fmt, argp); /* format message */
|
2002-05-16 02:57:44 +08:00
|
|
|
va_end(argp);
|
2017-11-07 21:25:26 +08:00
|
|
|
if (isLua(ci)) /* if Lua function, add source:line information */
|
|
|
|
luaG_addinfo(L, msg, ci_func(ci)->p->source, currentline(ci));
|
2002-08-09 04:08:41 +08:00
|
|
|
luaG_errormsg(L);
|
2000-08-12 00:17:28 +08:00
|
|
|
}
|
|
|
|
|
2013-04-25 23:59:42 +08:00
|
|
|
|
2017-06-27 19:35:31 +08:00
|
|
|
/*
|
|
|
|
** Check whether new instruction 'newpc' is in a different line from
|
|
|
|
** previous instruction 'oldpc'.
|
|
|
|
*/
|
2018-06-09 03:06:59 +08:00
|
|
|
static int changedline (const Proto *p, int oldpc, int newpc) {
|
2017-06-27 19:35:31 +08:00
|
|
|
while (oldpc++ < newpc) {
|
|
|
|
if (p->lineinfo[oldpc] != 0)
|
|
|
|
return (luaG_getfuncline(p, oldpc - 1) != luaG_getfuncline(p, newpc));
|
|
|
|
}
|
|
|
|
return 0; /* no line changes in the way */
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2018-05-03 02:17:59 +08:00
|
|
|
int luaG_traceexec (lua_State *L, const Instruction *pc) {
|
2017-11-07 21:25:26 +08:00
|
|
|
CallInfo *ci = L->ci;
|
2013-04-25 23:59:42 +08:00
|
|
|
lu_byte mask = L->hookmask;
|
2018-05-03 02:17:59 +08:00
|
|
|
int counthook;
|
|
|
|
if (!(mask & (LUA_MASKLINE | LUA_MASKCOUNT))) { /* no hooks? */
|
|
|
|
ci->u.l.trap = 0; /* don't need to stop again */
|
|
|
|
return 0; /* turn off 'trap' */
|
|
|
|
}
|
|
|
|
pc++; /* reference is always next instruction */
|
|
|
|
ci->u.l.savedpc = pc; /* save 'pc' */
|
|
|
|
counthook = (--L->hookcount == 0 && (mask & LUA_MASKCOUNT));
|
2013-04-25 23:59:42 +08:00
|
|
|
if (counthook)
|
|
|
|
resethookcount(L); /* reset count */
|
2015-10-22 22:40:47 +08:00
|
|
|
else if (!(mask & LUA_MASKLINE))
|
2018-05-03 02:17:59 +08:00
|
|
|
return 1; /* no line hook and count != 0; nothing to be done now */
|
2017-11-07 21:25:26 +08:00
|
|
|
if (ci->callstatus & CIST_HOOKYIELD) { /* called hook last time? */
|
|
|
|
ci->callstatus &= ~CIST_HOOKYIELD; /* erase mark */
|
2018-05-03 02:17:59 +08:00
|
|
|
return 1; /* do not call hook again (VM yielded, so it did not move) */
|
2013-04-25 23:59:42 +08:00
|
|
|
}
|
2017-12-28 23:42:57 +08:00
|
|
|
if (!isIT(*(ci->u.l.savedpc - 1)))
|
|
|
|
L->top = ci->top; /* prepare top */
|
2013-04-25 23:59:42 +08:00
|
|
|
if (counthook)
|
2018-02-18 03:29:29 +08:00
|
|
|
luaD_hook(L, LUA_HOOKCOUNT, -1, 0, 0); /* call count hook */
|
2013-04-25 23:59:42 +08:00
|
|
|
if (mask & LUA_MASKLINE) {
|
2018-06-09 03:06:59 +08:00
|
|
|
const Proto *p = ci_func(ci)->p;
|
2018-05-03 02:17:59 +08:00
|
|
|
int npci = pcRel(pc, p);
|
2017-11-13 20:20:51 +08:00
|
|
|
if (npci == 0 || /* call linehook when enter a new function, */
|
2018-05-03 02:17:59 +08:00
|
|
|
pc <= L->oldpc || /* when jump back (loop), or when */
|
2017-11-13 20:20:51 +08:00
|
|
|
changedline(p, pcRel(L->oldpc, p), npci)) { /* enter new line */
|
2018-05-03 02:17:59 +08:00
|
|
|
int newline = luaG_getfuncline(p, npci);
|
2018-02-18 03:29:29 +08:00
|
|
|
luaD_hook(L, LUA_HOOKLINE, newline, 0, 0); /* call line hook */
|
2017-06-27 19:35:31 +08:00
|
|
|
}
|
2018-05-03 02:17:59 +08:00
|
|
|
L->oldpc = pc; /* 'pc' of last call to line hook */
|
2013-04-25 23:59:42 +08:00
|
|
|
}
|
|
|
|
if (L->status == LUA_YIELD) { /* did hook yield? */
|
|
|
|
if (counthook)
|
|
|
|
L->hookcount = 1; /* undo decrement to zero */
|
2017-11-07 21:25:26 +08:00
|
|
|
ci->u.l.savedpc--; /* undo increment (resume will increment it again) */
|
|
|
|
ci->callstatus |= CIST_HOOKYIELD; /* mark that it yielded */
|
2013-04-25 23:59:42 +08:00
|
|
|
luaD_throw(L, LUA_YIELD);
|
|
|
|
}
|
2018-05-03 02:17:59 +08:00
|
|
|
return 1; /* keep 'trap' on */
|
2013-04-25 23:59:42 +08:00
|
|
|
}
|
|
|
|
|