mirror of https://github.com/rusefi/lua.git
comments
This commit is contained in:
parent
10b4799ce5
commit
a1d3e001b9
|
@ -1,5 +1,5 @@
|
||||||
/*
|
/*
|
||||||
** $Id: lparser.h,v 1.22 2000/08/08 20:42:07 roberto Exp roberto $
|
** $Id: lparser.h,v 1.23 2000/08/22 17:44:17 roberto Exp roberto $
|
||||||
** LL(1) Parser and code generator for Lua
|
** LL(1) Parser and code generator for Lua
|
||||||
** See Copyright Notice in lua.h
|
** See Copyright Notice in lua.h
|
||||||
*/
|
*/
|
||||||
|
@ -43,7 +43,7 @@ typedef struct FuncState {
|
||||||
struct lua_State *L; /* copy of the Lua state */
|
struct lua_State *L; /* copy of the Lua state */
|
||||||
int pc; /* next position to code */
|
int pc; /* next position to code */
|
||||||
int lasttarget; /* `pc' of last `jump target' */
|
int lasttarget; /* `pc' of last `jump target' */
|
||||||
int jlt; /* list of jumps to `lasttarged' */
|
int jlt; /* list of jumps to `lasttarget' */
|
||||||
int stacklevel; /* number of values on activation register */
|
int stacklevel; /* number of values on activation register */
|
||||||
int nactloc; /* number of active local variables */
|
int nactloc; /* number of active local variables */
|
||||||
int nupvalues; /* number of upvalues */
|
int nupvalues; /* number of upvalues */
|
||||||
|
|
|
@ -1,5 +1,5 @@
|
||||||
/*
|
/*
|
||||||
** $Id: lstrlib.c,v 1.47 2000/08/28 17:57:04 roberto Exp roberto $
|
** $Id: lstrlib.c,v 1.48 2000/08/29 20:43:28 roberto Exp roberto $
|
||||||
** Standard library for string operations and pattern-matching
|
** Standard library for string operations and pattern-matching
|
||||||
** See Copyright Notice in lua.h
|
** See Copyright Notice in lua.h
|
||||||
*/
|
*/
|
||||||
|
@ -265,7 +265,7 @@ static const char *max_expand (lua_State *L, const char *s, const char *p,
|
||||||
long i = 0; /* counts maximum expand for item */
|
long i = 0; /* counts maximum expand for item */
|
||||||
while ((s+i)<cap->src_end && luaI_singlematch((unsigned char)*(s+i), p, ep))
|
while ((s+i)<cap->src_end && luaI_singlematch((unsigned char)*(s+i), p, ep))
|
||||||
i++;
|
i++;
|
||||||
/* keeps trying to match mith the maximum repetitions */
|
/* keeps trying to match with the maximum repetitions */
|
||||||
while (i>=0) {
|
while (i>=0) {
|
||||||
const char *res = match(L, (s+i), ep+1, cap);
|
const char *res = match(L, (s+i), ep+1, cap);
|
||||||
if (res) return res;
|
if (res) return res;
|
||||||
|
|
Loading…
Reference in New Issue