diff options
| author | Roberto Ierusalimschy <roberto@inf.puc-rio.br> | 2005-07-11 11:01:37 -0300 |
|---|---|---|
| committer | Roberto Ierusalimschy <roberto@inf.puc-rio.br> | 2005-07-11 11:01:37 -0300 |
| commit | 0f30d00c872b4dc4b77daabc55d72338dcc31847 (patch) | |
| tree | 7418e9ff6b29d14bbe9cff579fc9e1f99a462ce5 | |
| parent | e86dab2daec444580485dcdba5f3f68d1474dad5 (diff) | |
| download | lua-0f30d00c872b4dc4b77daabc55d72338dcc31847.tar.gz lua-0f30d00c872b4dc4b77daabc55d72338dcc31847.tar.bz2 lua-0f30d00c872b4dc4b77daabc55d72338dcc31847.zip | |
warnings from Visual C
| -rw-r--r-- | lparser.c | 4 | ||||
| -rw-r--r-- | ltable.c | 6 |
2 files changed, 5 insertions, 5 deletions
| @@ -1,5 +1,5 @@ | |||
| 1 | /* | 1 | /* |
| 2 | ** $Id: lparser.c,v 2.29 2005/06/13 14:15:54 roberto Exp roberto $ | 2 | ** $Id: lparser.c,v 2.30 2005/06/13 14:25:29 roberto Exp roberto $ |
| 3 | ** Lua Parser | 3 | ** Lua Parser |
| 4 | ** See Copyright Notice in lua.h | 4 | ** See Copyright Notice in lua.h |
| 5 | */ | 5 | */ |
| @@ -300,7 +300,7 @@ static void enterlevel (LexState *ls) { | |||
| 300 | #define leavelevel(ls) ((ls)->L->nCcalls--) | 300 | #define leavelevel(ls) ((ls)->L->nCcalls--) |
| 301 | 301 | ||
| 302 | 302 | ||
| 303 | static void enterblock (FuncState *fs, BlockCnt *bl, int isbreakable) { | 303 | static void enterblock (FuncState *fs, BlockCnt *bl, lu_byte isbreakable) { |
| 304 | bl->breaklist = NO_JUMP; | 304 | bl->breaklist = NO_JUMP; |
| 305 | bl->isbreakable = isbreakable; | 305 | bl->isbreakable = isbreakable; |
| 306 | bl->nactvar = fs->nactvar; | 306 | bl->nactvar = fs->nactvar; |
| @@ -1,5 +1,5 @@ | |||
| 1 | /* | 1 | /* |
| 2 | ** $Id: ltable.c,v 2.24 2005/05/20 15:53:42 roberto Exp roberto $ | 2 | ** $Id: ltable.c,v 2.25 2005/05/31 14:25:18 roberto Exp roberto $ |
| 3 | ** Lua tables (hash) | 3 | ** Lua tables (hash) |
| 4 | ** See Copyright Notice in lua.h | 4 | ** See Copyright Notice in lua.h |
| 5 | */ | 5 | */ |
| @@ -376,7 +376,7 @@ void luaH_free (lua_State *L, Table *t) { | |||
| 376 | } | 376 | } |
| 377 | 377 | ||
| 378 | 378 | ||
| 379 | static Node *getfreepos (lua_State *L, Table *t) { | 379 | static Node *getfreepos (Table *t) { |
| 380 | while (t->lastfree-- > t->node) { | 380 | while (t->lastfree-- > t->node) { |
| 381 | if (ttisnil(gkey(t->lastfree))) | 381 | if (ttisnil(gkey(t->lastfree))) |
| 382 | return t->lastfree; | 382 | return t->lastfree; |
| @@ -397,7 +397,7 @@ static TValue *newkey (lua_State *L, Table *t, const TValue *key) { | |||
| 397 | Node *mp = luaH_mainposition(t, key); | 397 | Node *mp = luaH_mainposition(t, key); |
| 398 | if (!ttisnil(gval(mp)) || mp == &luaH_dummynode) { | 398 | if (!ttisnil(gval(mp)) || mp == &luaH_dummynode) { |
| 399 | Node *othern; | 399 | Node *othern; |
| 400 | Node *n = getfreepos(L, t); /* get a free place */ | 400 | Node *n = getfreepos(t); /* get a free place */ |
| 401 | if (n == NULL) { /* cannot find a free place? */ | 401 | if (n == NULL) { /* cannot find a free place? */ |
| 402 | rehash(L, t, key); /* grow table */ | 402 | rehash(L, t, key); /* grow table */ |
| 403 | return luaH_set(L, t, key); /* re-insert key into grown table */ | 403 | return luaH_set(L, t, key); /* re-insert key into grown table */ |
