lua/lparser.h

122 lines
3.3 KiB
C
Raw Normal View History

1997-09-17 03:33:21 +08:00
/*
** $Id: lparser.h,v 1.70 2012/05/08 13:53:33 roberto Exp roberto $
2001-08-11 04:53:03 +08:00
** Lua Parser
1997-09-17 03:33:21 +08:00
** See Copyright Notice in lua.h
*/
#ifndef lparser_h
#define lparser_h
#include "llimits.h"
1997-09-17 03:33:21 +08:00
#include "lobject.h"
#include "lzio.h"
2000-02-22 21:31:43 +08:00
/*
** Expression descriptor
2000-02-22 21:31:43 +08:00
*/
2000-02-22 21:31:43 +08:00
typedef enum {
VVOID, /* no value */
VNIL,
2001-12-12 06:48:44 +08:00
VTRUE,
VFALSE,
VK, /* info = index of constant in `k' */
VKFLT, /* nval = numerical float value */
VKINT, /* nval = numerical integer value */
VNONRELOC, /* info = result register */
VLOCAL, /* info = local register */
VUPVAL, /* info = index of upvalue in 'upvalues' */
VINDEXED, /* t = table register/upvalue; idx = index R/K */
2002-05-10 02:00:38 +08:00
VJMP, /* info = instruction pc */
VRELOCABLE, /* info = instruction pc */
VCALL, /* info = instruction pc */
VVARARG /* info = instruction pc */
} expkind;
2000-02-22 21:31:43 +08:00
#define vkisvar(k) (VLOCAL <= (k) && (k) <= VINDEXED)
#define vkisinreg(k) ((k) == VNONRELOC || (k) == VLOCAL)
typedef struct expdesc {
expkind k;
union {
struct { /* for indexed variables (VINDEXED) */
short idx; /* index (R/K) */
lu_byte t; /* table (register or upvalue) */
lu_byte vt; /* whether 't' is register (VLOCAL) or upvalue (VUPVAL) */
} ind;
int info; /* for generic use */
lua_Number nval; /* for VKFLT */
lua_Integer ival; /* for VKINT */
} u;
int t; /* patch list of `exit when true' */
int f; /* patch list of `exit when false' */
} expdesc;
2000-02-22 21:31:43 +08:00
2011-02-05 01:34:43 +08:00
/* description of active local variable */
typedef struct Vardesc {
short idx; /* variable index in stack */
2011-02-05 01:34:43 +08:00
} Vardesc;
/* description of pending goto statements and label statements */
2011-02-05 01:34:43 +08:00
typedef struct Labeldesc {
TString *name; /* label identifier */
int pc; /* position in code */
int line; /* line where it appeared */
lu_byte nactvar; /* local level where it appears in current block */
2011-02-05 01:34:43 +08:00
} Labeldesc;
/* list of labels or gotos */
2011-02-05 01:34:43 +08:00
typedef struct Labellist {
Labeldesc *arr; /* array */
int n; /* number of entries in use */
int size; /* array size */
2011-02-05 01:34:43 +08:00
} Labellist;
/* dynamic structures used by the parser */
typedef struct Dyndata {
struct { /* list of active local variables */
Vardesc *arr;
int n;
int size;
} actvar;
Labellist gt; /* list of pending gotos */
Labellist label; /* list of active labels */
} Dyndata;
/* control of blocks */
2002-03-15 02:01:52 +08:00
struct BlockCnt; /* defined in lparser.c */
2002-05-15 01:52:22 +08:00
2000-02-22 21:31:43 +08:00
/* state needed to generate code for a given function */
typedef struct FuncState {
2000-03-11 02:37:44 +08:00
Proto *f; /* current function header */
Table *h; /* table to find (and reuse) elements in `k' */
2000-02-22 21:31:43 +08:00
struct FuncState *prev; /* enclosing function */
2000-03-14 04:37:16 +08:00
struct LexState *ls; /* lexical state */
2002-03-15 02:01:52 +08:00
struct BlockCnt *bl; /* chain of current blocks */
int pc; /* next position to code (equivalent to `ncode') */
int lasttarget; /* 'label' of last 'jump label' */
2002-05-15 01:52:22 +08:00
int jpc; /* list of pending jumps to `pc' */
int nk; /* number of elements in `k' */
2001-06-28 22:57:17 +08:00
int np; /* number of elements in `p' */
int firstlocal; /* index of first local var (in Dyndata array) */
short nlocvars; /* number of elements in 'f->locvars' */
lu_byte nactvar; /* number of active local variables */
lu_byte nups; /* number of upvalues */
lu_byte freereg; /* first free register */
2000-02-22 21:31:43 +08:00
} FuncState;
LUAI_FUNC Closure *luaY_parser (lua_State *L, ZIO *z, Mbuffer *buff,
Dyndata *dyd, const char *name, int firstchar);
1997-09-17 03:33:21 +08:00
#endif