diff options
-rw-r--r-- | lauxlib.c | 6 | ||||
-rw-r--r-- | lcode.c | 4 | ||||
-rw-r--r-- | ldblib.c | 4 | ||||
-rw-r--r-- | ldo.c | 6 | ||||
-rw-r--r-- | ldo.h | 4 | ||||
-rw-r--r-- | llex.c | 4 | ||||
-rw-r--r-- | llimits.h | 4 | ||||
-rw-r--r-- | loslib.c | 4 | ||||
-rw-r--r-- | ltable.c | 4 | ||||
-rw-r--r-- | lvm.c | 4 |
10 files changed, 22 insertions, 22 deletions
@@ -1,5 +1,5 @@ | |||
1 | /* | 1 | /* |
2 | ** $Id: lauxlib.c,v 1.282 2015/10/02 15:46:49 roberto Exp roberto $ | 2 | ** $Id: lauxlib.c,v 1.283 2015/10/06 16:10:22 roberto Exp roberto $ |
3 | ** Auxiliary functions for building Lua libraries | 3 | ** Auxiliary functions for building Lua libraries |
4 | ** See Copyright Notice in lua.h | 4 | ** See Copyright Notice in lua.h |
5 | */ | 5 | */ |
@@ -471,7 +471,7 @@ static void *newbox (lua_State *L, size_t newsize) { | |||
471 | box->bsize = 0; | 471 | box->bsize = 0; |
472 | if (luaL_newmetatable(L, "LUABOX")) { /* creating metatable? */ | 472 | if (luaL_newmetatable(L, "LUABOX")) { /* creating metatable? */ |
473 | lua_pushcfunction(L, boxgc); | 473 | lua_pushcfunction(L, boxgc); |
474 | lua_setfield(L, -2, "__gc"); /* metatalbe.__gc = boxgc */ | 474 | lua_setfield(L, -2, "__gc"); /* metatable.__gc = boxgc */ |
475 | } | 475 | } |
476 | lua_setmetatable(L, -2); | 476 | lua_setmetatable(L, -2); |
477 | return resizebox(L, -1, newsize); | 477 | return resizebox(L, -1, newsize); |
@@ -653,7 +653,7 @@ static int errfile (lua_State *L, const char *what, int fnameindex) { | |||
653 | 653 | ||
654 | 654 | ||
655 | static int skipBOM (LoadF *lf) { | 655 | static int skipBOM (LoadF *lf) { |
656 | const char *p = "\xEF\xBB\xBF"; /* Utf8 BOM mark */ | 656 | const char *p = "\xEF\xBB\xBF"; /* UTF-8 BOM mark */ |
657 | int c; | 657 | int c; |
658 | lf->n = 0; | 658 | lf->n = 0; |
659 | do { | 659 | do { |
@@ -1,5 +1,5 @@ | |||
1 | /* | 1 | /* |
2 | ** $Id: lcode.c,v 2.101 2015/04/29 18:24:11 roberto Exp roberto $ | 2 | ** $Id: lcode.c,v 2.102 2015/10/26 14:27:47 roberto Exp roberto $ |
3 | ** Code generator for Lua | 3 | ** Code generator for Lua |
4 | ** See Copyright Notice in lua.h | 4 | ** See Copyright Notice in lua.h |
5 | */ | 5 | */ |
@@ -816,7 +816,7 @@ static void codeexpval (FuncState *fs, OpCode op, | |||
816 | freeexp(fs, e1); | 816 | freeexp(fs, e1); |
817 | } | 817 | } |
818 | e1->u.info = luaK_codeABC(fs, op, 0, o1, o2); /* generate opcode */ | 818 | e1->u.info = luaK_codeABC(fs, op, 0, o1, o2); /* generate opcode */ |
819 | e1->k = VRELOCABLE; /* all those operations are relocable */ | 819 | e1->k = VRELOCABLE; /* all those operations are relocatable */ |
820 | luaK_fixline(fs, line); | 820 | luaK_fixline(fs, line); |
821 | } | 821 | } |
822 | } | 822 | } |
@@ -1,5 +1,5 @@ | |||
1 | /* | 1 | /* |
2 | ** $Id: ldblib.c,v 1.148 2015/01/02 12:52:22 roberto Exp roberto $ | 2 | ** $Id: ldblib.c,v 1.149 2015/02/19 17:06:21 roberto Exp roberto $ |
3 | ** Interface from Lua to its debug API | 3 | ** Interface from Lua to its debug API |
4 | ** See Copyright Notice in lua.h | 4 | ** See Copyright Notice in lua.h |
5 | */ | 5 | */ |
@@ -29,7 +29,7 @@ static const int HOOKKEY = 0; | |||
29 | 29 | ||
30 | /* | 30 | /* |
31 | ** If L1 != L, L1 can be in any state, and therefore there is no | 31 | ** If L1 != L, L1 can be in any state, and therefore there is no |
32 | ** garanties about its stack space; any push in L1 must be | 32 | ** garantees about its stack space; any push in L1 must be |
33 | ** checked. | 33 | ** checked. |
34 | */ | 34 | */ |
35 | static void checkstack (lua_State *L, lua_State *L1, int n) { | 35 | static void checkstack (lua_State *L, lua_State *L1, int n) { |
@@ -1,5 +1,5 @@ | |||
1 | /* | 1 | /* |
2 | ** $Id: ldo.c,v 2.148 2015/11/02 18:48:49 roberto Exp roberto $ | 2 | ** $Id: ldo.c,v 2.149 2015/11/13 13:24:26 roberto Exp roberto $ |
3 | ** Stack and Call structure of Lua | 3 | ** Stack and Call structure of Lua |
4 | ** See Copyright Notice in lua.h | 4 | ** See Copyright Notice in lua.h |
5 | */ | 5 | */ |
@@ -409,7 +409,7 @@ static int moveresults (lua_State *L, const TValue *firstResult, StkId res, | |||
409 | case 0: break; /* nothing to move */ | 409 | case 0: break; /* nothing to move */ |
410 | case 1: { /* one result needed */ | 410 | case 1: { /* one result needed */ |
411 | if (nres == 0) /* no results? */ | 411 | if (nres == 0) /* no results? */ |
412 | firstResult = luaO_nilobject; /* ajdust with nil */ | 412 | firstResult = luaO_nilobject; /* adjust with nil */ |
413 | setobjs2s(L, res, firstResult); /* move it to proper place */ | 413 | setobjs2s(L, res, firstResult); /* move it to proper place */ |
414 | break; | 414 | break; |
415 | } | 415 | } |
@@ -442,7 +442,7 @@ static int moveresults (lua_State *L, const TValue *firstResult, StkId res, | |||
442 | 442 | ||
443 | /* | 443 | /* |
444 | ** Finishes a function call: calls hook if necessary, removes CallInfo, | 444 | ** Finishes a function call: calls hook if necessary, removes CallInfo, |
445 | ** moves corrent number of results to proper place; returns 0 iff call | 445 | ** moves current number of results to proper place; returns 0 iff call |
446 | ** wanted multiple (variable number of) results. | 446 | ** wanted multiple (variable number of) results. |
447 | */ | 447 | */ |
448 | int luaD_poscall (lua_State *L, CallInfo *ci, StkId firstResult, int nres) { | 448 | int luaD_poscall (lua_State *L, CallInfo *ci, StkId firstResult, int nres) { |
@@ -1,5 +1,5 @@ | |||
1 | /* | 1 | /* |
2 | ** $Id: ldo.h,v 2.25 2015/11/02 18:48:07 roberto Exp roberto $ | 2 | ** $Id: ldo.h,v 2.26 2015/11/13 13:24:26 roberto Exp roberto $ |
3 | ** Stack and Call structure of Lua | 3 | ** Stack and Call structure of Lua |
4 | ** See Copyright Notice in lua.h | 4 | ** See Copyright Notice in lua.h |
5 | */ | 5 | */ |
@@ -16,7 +16,7 @@ | |||
16 | /* | 16 | /* |
17 | ** Macro to check stack size and grow stack if needed. Parameters | 17 | ** Macro to check stack size and grow stack if needed. Parameters |
18 | ** 'pre'/'pos' allow the macro to preserve a pointer into the | 18 | ** 'pre'/'pos' allow the macro to preserve a pointer into the |
19 | ** stack across realalocations, doing the work only when needed. | 19 | ** stack across realocations, doing the work only when needed. |
20 | ** 'condmovestack' is used in heavy tests to force a stack reallocation | 20 | ** 'condmovestack' is used in heavy tests to force a stack reallocation |
21 | ** at every check. | 21 | ** at every check. |
22 | */ | 22 | */ |
@@ -1,5 +1,5 @@ | |||
1 | /* | 1 | /* |
2 | ** $Id: llex.c,v 2.93 2015/05/22 17:45:56 roberto Exp roberto $ | 2 | ** $Id: llex.c,v 2.94 2015/10/28 18:51:47 roberto Exp roberto $ |
3 | ** Lexical Analyzer | 3 | ** Lexical Analyzer |
4 | ** See Copyright Notice in lua.h | 4 | ** See Copyright Notice in lua.h |
5 | */ | 5 | */ |
@@ -275,7 +275,7 @@ static int read_numeral (LexState *ls, SemInfo *seminfo) { | |||
275 | 275 | ||
276 | 276 | ||
277 | /* | 277 | /* |
278 | ** skip a sequence '[=*[' or ']=*]'; if sequence is wellformed, return | 278 | ** skip a sequence '[=*[' or ']=*]'; if sequence is well formed, return |
279 | ** its number of '='s; otherwise, return a negative number (-1 iff there | 279 | ** its number of '='s; otherwise, return a negative number (-1 iff there |
280 | ** are no '='s after initial bracket) | 280 | ** are no '='s after initial bracket) |
281 | */ | 281 | */ |
@@ -1,5 +1,5 @@ | |||
1 | /* | 1 | /* |
2 | ** $Id: llimits.h,v 1.139 2015/10/06 14:29:49 roberto Exp roberto $ | 2 | ** $Id: llimits.h,v 1.140 2015/10/21 18:40:47 roberto Exp roberto $ |
3 | ** Limits, basic types, and some other 'installation-dependent' definitions | 3 | ** Limits, basic types, and some other 'installation-dependent' definitions |
4 | ** See Copyright Notice in lua.h | 4 | ** See Copyright Notice in lua.h |
5 | */ | 5 | */ |
@@ -207,7 +207,7 @@ typedef unsigned long Instruction; | |||
207 | 207 | ||
208 | 208 | ||
209 | /* | 209 | /* |
210 | ** macros that are executed whenether program enters the Lua core | 210 | ** macros that are executed whenever program enters the Lua core |
211 | ** ('lua_lock') and leaves the core ('lua_unlock') | 211 | ** ('lua_lock') and leaves the core ('lua_unlock') |
212 | */ | 212 | */ |
213 | #if !defined(lua_lock) | 213 | #if !defined(lua_lock) |
@@ -1,5 +1,5 @@ | |||
1 | /* | 1 | /* |
2 | ** $Id: loslib.c,v 1.58 2015/07/04 16:35:14 roberto Exp roberto $ | 2 | ** $Id: loslib.c,v 1.59 2015/07/06 15:16:51 roberto Exp roberto $ |
3 | ** Standard Operating System library | 3 | ** Standard Operating System library |
4 | ** See Copyright Notice in lua.h | 4 | ** See Copyright Notice in lua.h |
5 | */ | 5 | */ |
@@ -215,7 +215,7 @@ static int getfield (lua_State *L, const char *key, int d, int delta) { | |||
215 | if (!isnum) { /* field is not a number? */ | 215 | if (!isnum) { /* field is not a number? */ |
216 | if (t != LUA_TNIL) /* some other value? */ | 216 | if (t != LUA_TNIL) /* some other value? */ |
217 | return luaL_error(L, "field '%s' not an integer", key); | 217 | return luaL_error(L, "field '%s' not an integer", key); |
218 | else if (d < 0) /* abssent field; no default? */ | 218 | else if (d < 0) /* absent field; no default? */ |
219 | return luaL_error(L, "field '%s' missing in date table", key); | 219 | return luaL_error(L, "field '%s' missing in date table", key); |
220 | res = d; | 220 | res = d; |
221 | } | 221 | } |
@@ -1,5 +1,5 @@ | |||
1 | /* | 1 | /* |
2 | ** $Id: ltable.c,v 2.115 2015/11/03 18:10:44 roberto Exp roberto $ | 2 | ** $Id: ltable.c,v 2.116 2015/11/03 18:35:21 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 | */ |
@@ -85,7 +85,7 @@ static const Node dummynode_ = { | |||
85 | /* | 85 | /* |
86 | ** Hash for floating-point numbers. | 86 | ** Hash for floating-point numbers. |
87 | ** The main computation should be just | 87 | ** The main computation should be just |
88 | ** n = frepx(n, &i); return (n * INT_MAX) + i | 88 | ** n = frexp(n, &i); return (n * INT_MAX) + i |
89 | ** but there are some numerical subtleties. | 89 | ** but there are some numerical subtleties. |
90 | ** In a two-complement representation, INT_MAX does not has an exact | 90 | ** In a two-complement representation, INT_MAX does not has an exact |
91 | ** representation as a float, but INT_MIN does; because the absolute | 91 | ** representation as a float, but INT_MIN does; because the absolute |
@@ -1,5 +1,5 @@ | |||
1 | /* | 1 | /* |
2 | ** $Id: lvm.c,v 2.262 2015/11/13 13:24:26 roberto Exp roberto $ | 2 | ** $Id: lvm.c,v 2.263 2015/11/17 16:00:28 roberto Exp roberto $ |
3 | ** Lua virtual machine | 3 | ** Lua virtual machine |
4 | ** See Copyright Notice in lua.h | 4 | ** See Copyright Notice in lua.h |
5 | */ | 5 | */ |
@@ -1051,7 +1051,7 @@ void luaV_execute (lua_State *L) { | |||
1051 | StkId rb; | 1051 | StkId rb; |
1052 | L->top = base + c + 1; /* mark the end of concat operands */ | 1052 | L->top = base + c + 1; /* mark the end of concat operands */ |
1053 | Protect(luaV_concat(L, c - b + 1)); | 1053 | Protect(luaV_concat(L, c - b + 1)); |
1054 | ra = RA(i); /* 'luav_concat' may invoke TMs and move the stack */ | 1054 | ra = RA(i); /* 'luaV_concat' may invoke TMs and move the stack */ |
1055 | rb = base + b; | 1055 | rb = base + b; |
1056 | setobjs2s(L, ra, rb); | 1056 | setobjs2s(L, ra, rb); |
1057 | checkGC(L, (ra >= rb ? ra + 1 : rb)); | 1057 | checkGC(L, (ra >= rb ? ra + 1 : rb)); |