From ac78b914b655dd8e89d306f6336a229452046ead Mon Sep 17 00:00:00 2001 From: Roberto Ierusalimschy Date: Thu, 30 Nov 2017 13:37:16 -0200 Subject: warnings from Visual Studio /W3 --- lcode.c | 4 ++-- lgc.c | 4 ++-- ltm.c | 4 ++-- 3 files changed, 6 insertions(+), 6 deletions(-) diff --git a/lcode.c b/lcode.c index d1585193..56fd8522 100644 --- a/lcode.c +++ b/lcode.c @@ -1,5 +1,5 @@ /* -** $Id: lcode.c,v 2.140 2017/11/30 13:17:06 roberto Exp roberto $ +** $Id: lcode.c,v 2.140 2017/11/30 13:29:18 roberto Exp roberto $ ** Code generator for Lua ** See Copyright Notice in lua.h */ @@ -1128,7 +1128,7 @@ void luaK_indexed (FuncState *fs, expdesc *t, expdesc *k) { t->k = VINDEXSTR; } else if (isCint(k)) { - t->u.ind.idx = k->u.ival; /* integer constant */ + t->u.ind.idx = cast_int(k->u.ival); /* integer constant in proper range */ t->k = VINDEXI; } else { diff --git a/lgc.c b/lgc.c index 389d69bb..f4b8d6a4 100644 --- a/lgc.c +++ b/lgc.c @@ -1,5 +1,5 @@ /* -** $Id: lgc.c,v 2.238 2017/11/07 13:25:26 roberto Exp roberto $ +** $Id: lgc.c,v 2.239 2017/11/23 19:29:04 roberto Exp roberto $ ** Garbage Collector ** See Copyright Notice in lua.h */ @@ -1270,7 +1270,7 @@ static void genstep (lua_State *L, global_State *g) { lu_mem mem; youngcollection(L, g); mem = gettotalbytes(g); - luaE_setdebt(g, -((mem / 100) * g->genminormul)); + luaE_setdebt(g, -(cast(l_mem, (mem / 100)) * g->genminormul)); g->GCestimate = majorbase; /* preserve base value */ } } diff --git a/ltm.c b/ltm.c index 5ee123f5..fe87553d 100644 --- a/ltm.c +++ b/ltm.c @@ -1,5 +1,5 @@ /* -** $Id: ltm.c,v 2.49 2017/11/23 19:18:10 roberto Exp roberto $ +** $Id: ltm.c,v 2.50 2017/11/27 17:44:31 roberto Exp roberto $ ** Tag methods ** See Copyright Notice in lua.h */ @@ -237,7 +237,7 @@ void luaT_getvarargs (lua_State *L, TValue *t, StkId where, int wanted) { Table *h = hvalue(t); if (wanted < 0) { /* get all? */ const TValue *ns = luaH_getstr(h, G(L)->nfield); - int n = (ttisinteger(ns)) ? ivalue(ns) : 0; + int n = (ttisinteger(ns)) ? cast_int(ivalue(ns)) : 0; wanted = n; checkstackp(L, n, where); L->top = where + n; -- cgit v1.2.3-55-g6feb