aboutsummaryrefslogtreecommitdiff
path: root/lparser.h
diff options
context:
space:
mode:
authorRoberto Ierusalimschy <roberto@inf.puc-rio.br>2002-02-08 20:42:41 -0200
committerRoberto Ierusalimschy <roberto@inf.puc-rio.br>2002-02-08 20:42:41 -0200
commite01f5e680951a66bd67a22eeed1d9e05ab30b9f2 (patch)
tree99ff32eedd3bf3194561f5a2d916d948ba81c4f9 /lparser.h
parentcbfc581990db2e20ee06670dbf84f28bcfe1dc42 (diff)
downloadlua-e01f5e680951a66bd67a22eeed1d9e05ab30b9f2.tar.gz
lua-e01f5e680951a66bd67a22eeed1d9e05ab30b9f2.tar.bz2
lua-e01f5e680951a66bd67a22eeed1d9e05ab30b9f2.zip
better order of record fields for 64-bit machines
Diffstat (limited to 'lparser.h')
-rw-r--r--lparser.h4
1 files changed, 2 insertions, 2 deletions
diff --git a/lparser.h b/lparser.h
index 08e87454..5df59891 100644
--- a/lparser.h
+++ b/lparser.h
@@ -56,21 +56,21 @@ typedef struct expdesc {
56/* state needed to generate code for a given function */ 56/* state needed to generate code for a given function */
57typedef struct FuncState { 57typedef struct FuncState {
58 Proto *f; /* current function header */ 58 Proto *f; /* current function header */
59 Table *h; /* table to find (and reuse) elements in `k' */
59 struct FuncState *prev; /* enclosing function */ 60 struct FuncState *prev; /* enclosing function */
60 struct LexState *ls; /* lexical state */ 61 struct LexState *ls; /* lexical state */
61 struct lua_State *L; /* copy of the Lua state */ 62 struct lua_State *L; /* copy of the Lua state */
63 struct Breaklabel *bl; /* chain of breakable blocks */
62 int pc; /* next position to code (equivalent to `ncode') */ 64 int pc; /* next position to code (equivalent to `ncode') */
63 int lasttarget; /* `pc' of last `jump target' */ 65 int lasttarget; /* `pc' of last `jump target' */
64 int jlt; /* list of jumps to `lasttarget' */ 66 int jlt; /* list of jumps to `lasttarget' */
65 int freereg; /* first free register */ 67 int freereg; /* first free register */
66 int nk; /* number of elements in `k' */ 68 int nk; /* number of elements in `k' */
67 Table *h; /* table to find (and reuse) elements in `k' */
68 int np; /* number of elements in `p' */ 69 int np; /* number of elements in `p' */
69 int nlineinfo; /* number of elements in `lineinfo' */ 70 int nlineinfo; /* number of elements in `lineinfo' */
70 int nlocvars; /* number of elements in `locvars' */ 71 int nlocvars; /* number of elements in `locvars' */
71 int nactloc; /* number of active local variables */ 72 int nactloc; /* number of active local variables */
72 int lastline; /* line where last `lineinfo' was generated */ 73 int lastline; /* line where last `lineinfo' was generated */
73 struct Breaklabel *bl; /* chain of breakable blocks */
74 expdesc upvalues[MAXUPVALUES]; /* upvalues */ 74 expdesc upvalues[MAXUPVALUES]; /* upvalues */
75 int actloc[MAXLOCALS]; /* local-variable stack (indices to locvars) */ 75 int actloc[MAXLOCALS]; /* local-variable stack (indices to locvars) */
76 unsigned int wasup[words2bits(MAXLOCALS)]; /* bit array to mark whether a 76 unsigned int wasup[words2bits(MAXLOCALS)]; /* bit array to mark whether a