diff --git a/lcode.c b/lcode.c index debb26e1..7a9e680b 100644 --- a/lcode.c +++ b/lcode.c @@ -1,5 +1,5 @@ /* -** $Id: lcode.c,v 2.45 2010/03/12 19:14:06 roberto Exp roberto $ +** $Id: lcode.c,v 2.46 2010/04/17 12:46:32 roberto Exp roberto $ ** Code generator for Lua ** See Copyright Notice in lua.h */ @@ -514,7 +514,7 @@ int luaK_exp2RK (FuncState *fs, expdesc *e) { case VTRUE: case VFALSE: case VNIL: { - if (fs->nk <= MAXINDEXRK) { /* constant fit in RK operand? */ + if (fs->nk <= MAXINDEXRK) { /* constant fits in RK operand? */ e->u.s.info = (e->k == VNIL) ? nilK(fs) : boolK(fs, (e->k == VTRUE)); e->k = VK; return RKASK(e->u.s.info); @@ -527,7 +527,7 @@ int luaK_exp2RK (FuncState *fs, expdesc *e) { /* go through */ } case VK: { - if (e->u.s.info <= MAXINDEXRK) /* constant fit in argC? */ + if (e->u.s.info <= MAXINDEXRK) /* constant fits in argC? */ return RKASK(e->u.s.info); else break; } diff --git a/lfunc.c b/lfunc.c index 67244672..6e809ca0 100644 --- a/lfunc.c +++ b/lfunc.c @@ -1,5 +1,5 @@ /* -** $Id: lfunc.c,v 2.25 2010/06/04 13:25:10 roberto Exp roberto $ +** $Id: lfunc.c,v 2.26 2010/06/10 21:27:09 roberto Exp roberto $ ** Auxiliary functions to manipulate prototypes and closures ** See Copyright Notice in lua.h */ @@ -57,7 +57,7 @@ UpVal *luaF_findupval (lua_State *L, StkId level) { lua_assert(p->v != &p->u.value); if (p->v == level) { /* found a corresponding upvalue? */ if (isdead(g, o)) /* is it dead? */ - changewhite(o); /* ressurrect it */ + changewhite(o); /* resurrect it */ return p; } resetoldbit(o); /* may create a newer upval after this one */ diff --git a/lgc.c b/lgc.c index 531094f0..930542e1 100644 --- a/lgc.c +++ b/lgc.c @@ -1,5 +1,5 @@ /* -** $Id: lgc.c,v 2.99 2010/06/07 16:55:34 roberto Exp roberto $ +** $Id: lgc.c,v 2.100 2010/06/25 12:18:10 roberto Exp roberto $ ** Garbage Collector ** See Copyright Notice in lua.h */ @@ -27,7 +27,7 @@ /* how much to allocate before next GC step */ #define GCSTEPSIZE 1024 -/* maximum numer of elements to sweep in each single step */ +/* maximum number of elements to sweep in each single step */ #define GCSWEEPMAX 40 /* cost of sweeping one element */ diff --git a/lgc.h b/lgc.h index 191adfeb..c7cfdf7c 100644 --- a/lgc.h +++ b/lgc.h @@ -1,5 +1,5 @@ /* -** $Id: lgc.h,v 2.42 2010/06/04 13:25:10 roberto Exp roberto $ +** $Id: lgc.h,v 2.43 2010/06/07 16:55:34 roberto Exp roberto $ ** Garbage Collector ** See Copyright Notice in lua.h */ @@ -44,7 +44,7 @@ /* ** macro to tell when main invariant (white objects cannot point to black ** ones) must be kept. During a non-generational collection, the sweep -** phase may brak the invariant, as objects turned white may point to +** phase may break the invariant, as objects turned white may point to ** still-black objects. The invariant is restored when sweep ends and ** all objects are white again. During a generational collection, the ** invariant must be kept all times. diff --git a/lvm.c b/lvm.c index 8361d3dd..754d608b 100644 --- a/lvm.c +++ b/lvm.c @@ -1,5 +1,5 @@ /* -** $Id: lvm.c,v 2.121 2010/06/04 13:25:10 roberto Exp roberto $ +** $Id: lvm.c,v 2.122 2010/06/07 16:55:34 roberto Exp roberto $ ** Lua virtual machine ** See Copyright Notice in lua.h */ @@ -88,7 +88,7 @@ static void callTM (lua_State *L, const TValue *f, const TValue *p1, setobj2s(L, L->top++, p1); /* 1st argument */ setobj2s(L, L->top++, p2); /* 2nd argument */ if (!hasres) /* no result? 'p3' is third argument */ - setobj2s(L, L->top++, p3); /* 3th argument */ + setobj2s(L, L->top++, p3); /* 3rd argument */ luaD_checkstack(L, 0); /* metamethod may yield only when called from Lua code */ luaD_call(L, L->top - (4 - hasres), hasres, isLua(L->ci)); @@ -370,7 +370,7 @@ static Closure *getcached (Proto *p, UpVal **encup, StkId base) { ** create a new Lua closure, push it in the stack, and initialize ** its upvalues. Note that the call to 'luaC_barrierproto' must come ** before the assignment to 'p->cache', as the function needs the -** orginal value of that field. +** original value of that field. */ static void pushclosure (lua_State *L, Proto *p, UpVal **encup, StkId base, StkId ra) {