diff options
author | Roberto Ierusalimschy <roberto@inf.puc-rio.br> | 2010-06-30 11:11:17 -0300 |
---|---|---|
committer | Roberto Ierusalimschy <roberto@inf.puc-rio.br> | 2010-06-30 11:11:17 -0300 |
commit | a71c5f6f531a2503ff80e579e6c3bb95968645ba (patch) | |
tree | 96474e5949ce17418b12751dc83af5b260b7cbbe | |
parent | d9ea6eca7cd86758b9ff994b9e2eb1fa625155c9 (diff) | |
download | lua-a71c5f6f531a2503ff80e579e6c3bb95968645ba.tar.gz lua-a71c5f6f531a2503ff80e579e6c3bb95968645ba.tar.bz2 lua-a71c5f6f531a2503ff80e579e6c3bb95968645ba.zip |
typo in comments
-rw-r--r-- | lcode.c | 6 | ||||
-rw-r--r-- | lfunc.c | 4 | ||||
-rw-r--r-- | lgc.c | 4 | ||||
-rw-r--r-- | lgc.h | 4 | ||||
-rw-r--r-- | lvm.c | 6 |
5 files changed, 12 insertions, 12 deletions
@@ -1,5 +1,5 @@ | |||
1 | /* | 1 | /* |
2 | ** $Id: lcode.c,v 2.45 2010/03/12 19:14:06 roberto Exp roberto $ | 2 | ** $Id: lcode.c,v 2.46 2010/04/17 12:46:32 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 | */ |
@@ -514,7 +514,7 @@ int luaK_exp2RK (FuncState *fs, expdesc *e) { | |||
514 | case VTRUE: | 514 | case VTRUE: |
515 | case VFALSE: | 515 | case VFALSE: |
516 | case VNIL: { | 516 | case VNIL: { |
517 | if (fs->nk <= MAXINDEXRK) { /* constant fit in RK operand? */ | 517 | if (fs->nk <= MAXINDEXRK) { /* constant fits in RK operand? */ |
518 | e->u.s.info = (e->k == VNIL) ? nilK(fs) : boolK(fs, (e->k == VTRUE)); | 518 | e->u.s.info = (e->k == VNIL) ? nilK(fs) : boolK(fs, (e->k == VTRUE)); |
519 | e->k = VK; | 519 | e->k = VK; |
520 | return RKASK(e->u.s.info); | 520 | return RKASK(e->u.s.info); |
@@ -527,7 +527,7 @@ int luaK_exp2RK (FuncState *fs, expdesc *e) { | |||
527 | /* go through */ | 527 | /* go through */ |
528 | } | 528 | } |
529 | case VK: { | 529 | case VK: { |
530 | if (e->u.s.info <= MAXINDEXRK) /* constant fit in argC? */ | 530 | if (e->u.s.info <= MAXINDEXRK) /* constant fits in argC? */ |
531 | return RKASK(e->u.s.info); | 531 | return RKASK(e->u.s.info); |
532 | else break; | 532 | else break; |
533 | } | 533 | } |
@@ -1,5 +1,5 @@ | |||
1 | /* | 1 | /* |
2 | ** $Id: lfunc.c,v 2.25 2010/06/04 13:25:10 roberto Exp roberto $ | 2 | ** $Id: lfunc.c,v 2.26 2010/06/10 21:27:09 roberto Exp roberto $ |
3 | ** Auxiliary functions to manipulate prototypes and closures | 3 | ** Auxiliary functions to manipulate prototypes and closures |
4 | ** See Copyright Notice in lua.h | 4 | ** See Copyright Notice in lua.h |
5 | */ | 5 | */ |
@@ -57,7 +57,7 @@ UpVal *luaF_findupval (lua_State *L, StkId level) { | |||
57 | lua_assert(p->v != &p->u.value); | 57 | lua_assert(p->v != &p->u.value); |
58 | if (p->v == level) { /* found a corresponding upvalue? */ | 58 | if (p->v == level) { /* found a corresponding upvalue? */ |
59 | if (isdead(g, o)) /* is it dead? */ | 59 | if (isdead(g, o)) /* is it dead? */ |
60 | changewhite(o); /* ressurrect it */ | 60 | changewhite(o); /* resurrect it */ |
61 | return p; | 61 | return p; |
62 | } | 62 | } |
63 | resetoldbit(o); /* may create a newer upval after this one */ | 63 | resetoldbit(o); /* may create a newer upval after this one */ |
@@ -1,5 +1,5 @@ | |||
1 | /* | 1 | /* |
2 | ** $Id: lgc.c,v 2.99 2010/06/07 16:55:34 roberto Exp roberto $ | 2 | ** $Id: lgc.c,v 2.100 2010/06/25 12:18:10 roberto Exp roberto $ |
3 | ** Garbage Collector | 3 | ** Garbage Collector |
4 | ** See Copyright Notice in lua.h | 4 | ** See Copyright Notice in lua.h |
5 | */ | 5 | */ |
@@ -27,7 +27,7 @@ | |||
27 | /* how much to allocate before next GC step */ | 27 | /* how much to allocate before next GC step */ |
28 | #define GCSTEPSIZE 1024 | 28 | #define GCSTEPSIZE 1024 |
29 | 29 | ||
30 | /* maximum numer of elements to sweep in each single step */ | 30 | /* maximum number of elements to sweep in each single step */ |
31 | #define GCSWEEPMAX 40 | 31 | #define GCSWEEPMAX 40 |
32 | 32 | ||
33 | /* cost of sweeping one element */ | 33 | /* cost of sweeping one element */ |
@@ -1,5 +1,5 @@ | |||
1 | /* | 1 | /* |
2 | ** $Id: lgc.h,v 2.42 2010/06/04 13:25:10 roberto Exp roberto $ | 2 | ** $Id: lgc.h,v 2.43 2010/06/07 16:55:34 roberto Exp roberto $ |
3 | ** Garbage Collector | 3 | ** Garbage Collector |
4 | ** See Copyright Notice in lua.h | 4 | ** See Copyright Notice in lua.h |
5 | */ | 5 | */ |
@@ -44,7 +44,7 @@ | |||
44 | /* | 44 | /* |
45 | ** macro to tell when main invariant (white objects cannot point to black | 45 | ** macro to tell when main invariant (white objects cannot point to black |
46 | ** ones) must be kept. During a non-generational collection, the sweep | 46 | ** ones) must be kept. During a non-generational collection, the sweep |
47 | ** phase may brak the invariant, as objects turned white may point to | 47 | ** phase may break the invariant, as objects turned white may point to |
48 | ** still-black objects. The invariant is restored when sweep ends and | 48 | ** still-black objects. The invariant is restored when sweep ends and |
49 | ** all objects are white again. During a generational collection, the | 49 | ** all objects are white again. During a generational collection, the |
50 | ** invariant must be kept all times. | 50 | ** invariant must be kept all times. |
@@ -1,5 +1,5 @@ | |||
1 | /* | 1 | /* |
2 | ** $Id: lvm.c,v 2.121 2010/06/04 13:25:10 roberto Exp roberto $ | 2 | ** $Id: lvm.c,v 2.122 2010/06/07 16:55:34 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 | */ |
@@ -88,7 +88,7 @@ static void callTM (lua_State *L, const TValue *f, const TValue *p1, | |||
88 | setobj2s(L, L->top++, p1); /* 1st argument */ | 88 | setobj2s(L, L->top++, p1); /* 1st argument */ |
89 | setobj2s(L, L->top++, p2); /* 2nd argument */ | 89 | setobj2s(L, L->top++, p2); /* 2nd argument */ |
90 | if (!hasres) /* no result? 'p3' is third argument */ | 90 | if (!hasres) /* no result? 'p3' is third argument */ |
91 | setobj2s(L, L->top++, p3); /* 3th argument */ | 91 | setobj2s(L, L->top++, p3); /* 3rd argument */ |
92 | luaD_checkstack(L, 0); | 92 | luaD_checkstack(L, 0); |
93 | /* metamethod may yield only when called from Lua code */ | 93 | /* metamethod may yield only when called from Lua code */ |
94 | luaD_call(L, L->top - (4 - hasres), hasres, isLua(L->ci)); | 94 | luaD_call(L, L->top - (4 - hasres), hasres, isLua(L->ci)); |
@@ -370,7 +370,7 @@ static Closure *getcached (Proto *p, UpVal **encup, StkId base) { | |||
370 | ** create a new Lua closure, push it in the stack, and initialize | 370 | ** create a new Lua closure, push it in the stack, and initialize |
371 | ** its upvalues. Note that the call to 'luaC_barrierproto' must come | 371 | ** its upvalues. Note that the call to 'luaC_barrierproto' must come |
372 | ** before the assignment to 'p->cache', as the function needs the | 372 | ** before the assignment to 'p->cache', as the function needs the |
373 | ** orginal value of that field. | 373 | ** original value of that field. |
374 | */ | 374 | */ |
375 | static void pushclosure (lua_State *L, Proto *p, UpVal **encup, StkId base, | 375 | static void pushclosure (lua_State *L, Proto *p, UpVal **encup, StkId base, |
376 | StkId ra) { | 376 | StkId ra) { |