mirror of
https://gitcode.com/JianFeeeee/LuaCangjia_api.git
synced 2026-09-20 08:58:13 +00:00
- lib/lua 替换为 Lua 5.1.5 官方源码; CMakeLists 删除 5.1 不存在的 lcorolib.c/lctype.c/lutf8lib.c/lbitlib.c - 补充 lua.hpp C++ 包装头(5.1 官方不提供, 保持桥接 include 路径不变) - LUA_OK 兼容宏: 5.1 无此定义(成功返回值为 0) - luaL_tolstring 兼容: 5.1 无此 API, l_print 改用 lua_tostring + lua_typename 兜底(#if LUA_VERSION_NUM >= 502 条件编译, 弹栈逻辑同步分支) - luaL_setfuncs 兼容: 5.1 无此 API, push_tty_file 改手动循环注册 - I/O 重定向沿用 Registry 方案(自 5.2.4 分支同步), typed interop 版本自适应断言同步 - 验证: GTest 44/44 通过
83 lines
2.2 KiB
C
83 lines
2.2 KiB
C
/*
|
|
** $Id: lparser.h,v 1.57.1.1 2007/12/27 13:02:25 roberto Exp $
|
|
** Lua Parser
|
|
** See Copyright Notice in lua.h
|
|
*/
|
|
|
|
#ifndef lparser_h
|
|
#define lparser_h
|
|
|
|
#include "llimits.h"
|
|
#include "lobject.h"
|
|
#include "lzio.h"
|
|
|
|
|
|
/*
|
|
** Expression descriptor
|
|
*/
|
|
|
|
typedef enum {
|
|
VVOID, /* no value */
|
|
VNIL,
|
|
VTRUE,
|
|
VFALSE,
|
|
VK, /* info = index of constant in `k' */
|
|
VKNUM, /* nval = numerical value */
|
|
VLOCAL, /* info = local register */
|
|
VUPVAL, /* info = index of upvalue in `upvalues' */
|
|
VGLOBAL, /* info = index of table; aux = index of global name in `k' */
|
|
VINDEXED, /* info = table register; aux = index register (or `k') */
|
|
VJMP, /* info = instruction pc */
|
|
VRELOCABLE, /* info = instruction pc */
|
|
VNONRELOC, /* info = result register */
|
|
VCALL, /* info = instruction pc */
|
|
VVARARG /* info = instruction pc */
|
|
} expkind;
|
|
|
|
typedef struct expdesc {
|
|
expkind k;
|
|
union {
|
|
struct { int info, aux; } s;
|
|
lua_Number nval;
|
|
} u;
|
|
int t; /* patch list of `exit when true' */
|
|
int f; /* patch list of `exit when false' */
|
|
} expdesc;
|
|
|
|
|
|
typedef struct upvaldesc {
|
|
lu_byte k;
|
|
lu_byte info;
|
|
} upvaldesc;
|
|
|
|
|
|
struct BlockCnt; /* defined in lparser.c */
|
|
|
|
|
|
/* state needed to generate code for a given function */
|
|
typedef struct FuncState {
|
|
Proto *f; /* current function header */
|
|
Table *h; /* table to find (and reuse) elements in `k' */
|
|
struct FuncState *prev; /* enclosing function */
|
|
struct LexState *ls; /* lexical state */
|
|
struct lua_State *L; /* copy of the Lua state */
|
|
struct BlockCnt *bl; /* chain of current blocks */
|
|
int pc; /* next position to code (equivalent to `ncode') */
|
|
int lasttarget; /* `pc' of last `jump target' */
|
|
int jpc; /* list of pending jumps to `pc' */
|
|
int freereg; /* first free register */
|
|
int nk; /* number of elements in `k' */
|
|
int np; /* number of elements in `p' */
|
|
short nlocvars; /* number of elements in `locvars' */
|
|
lu_byte nactvar; /* number of active local variables */
|
|
upvaldesc upvalues[LUAI_MAXUPVALUES]; /* upvalues */
|
|
unsigned short actvar[LUAI_MAXVARS]; /* declared-variable stack */
|
|
} FuncState;
|
|
|
|
|
|
LUAI_FUNC Proto *luaY_parser (lua_State *L, ZIO *z, Mbuffer *buff,
|
|
const char *name);
|
|
|
|
|
|
#endif
|