mirrors/lua
1
0
Fork 0
mirror of https://github.com/lua/lua synced 2024-12-25 11:57:02 +03:00
Code Issues Packages Projects Releases Wiki Activity

warnings from Visual C

Browse Source
This commit is contained in:
Roberto Ierusalimschy 2005-07-11 11:01:37 -03:00
parent e86dab2dae
commit 0f30d00c87
2 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
lparser.c
View File

@ -1,5 +1,5 @@
/* /*
** $Id: lparser.c,v 2.29 2005/06/13 14:15:54 roberto Exp roberto $ ** $Id: lparser.c,v 2.30 2005/06/13 14:25:29 roberto Exp roberto $
** Lua Parser ** Lua Parser
** See Copyright Notice in lua.h ** See Copyright Notice in lua.h
*/ */
@ -300,7 +300,7 @@ static void enterlevel (LexState *ls) {
#define leavelevel(ls) ((ls)->L->nCcalls--) #define leavelevel(ls) ((ls)->L->nCcalls--)
static void enterblock (FuncState *fs, BlockCnt *bl, int isbreakable) { static void enterblock (FuncState *fs, BlockCnt *bl, lu_byte isbreakable) {
bl->breaklist = NO_JUMP; bl->breaklist = NO_JUMP;
bl->isbreakable = isbreakable; bl->isbreakable = isbreakable;
bl->nactvar = fs->nactvar; bl->nactvar = fs->nactvar;

6
ltable.c
View File

@ -1,5 +1,5 @@
/* /*
** $Id: ltable.c,v 2.24 2005/05/20 15:53:42 roberto Exp roberto $ ** $Id: ltable.c,v 2.25 2005/05/31 14:25:18 roberto Exp roberto $
** Lua tables (hash) ** Lua tables (hash)
** See Copyright Notice in lua.h ** See Copyright Notice in lua.h
*/ */
@ -376,7 +376,7 @@ void luaH_free (lua_State *L, Table *t) {
} }
static Node *getfreepos (lua_State *L, Table *t) { static Node *getfreepos (Table *t) {
while (t->lastfree-- > t->node) { while (t->lastfree-- > t->node) {
if (ttisnil(gkey(t->lastfree))) if (ttisnil(gkey(t->lastfree)))
return t->lastfree; return t->lastfree;
@ -397,7 +397,7 @@ static TValue *newkey (lua_State *L, Table *t, const TValue *key) {
Node *mp = luaH_mainposition(t, key); Node *mp = luaH_mainposition(t, key);
if (!ttisnil(gval(mp)) || mp == &luaH_dummynode) { if (!ttisnil(gval(mp)) || mp == &luaH_dummynode) {
Node *othern; Node *othern;
Node *n = getfreepos(L, t); /* get a free place */ Node *n = getfreepos(t); /* get a free place */
if (n == NULL) { /* cannot find a free place? */ if (n == NULL) { /* cannot find a free place? */
rehash(L, t, key); /* grow table */ rehash(L, t, key); /* grow table */
return luaH_set(L, t, key); /* re-insert key into grown table */ return luaH_set(L, t, key); /* re-insert key into grown table */