From ba8b5c173b20a92036384e114f9b5827de7596dc Mon Sep 17 00:00:00 2001 From: "martin.holst@gmail.com" Date: Tue, 21 May 2013 18:23:42 +0000 Subject: [PATCH] Added lua 5.2 sources --- liblua/Makefile | 187 ++++++ liblua/lapi.c | 1284 +++++++++++++++++++++++++++++++++++ liblua/lapi.h | 24 + liblua/lauxlib.c | 959 ++++++++++++++++++++++++++ liblua/lauxlib.h | 212 ++++++ liblua/lbaselib.c | 458 +++++++++++++ liblua/lbitlib.c | 211 ++++++ liblua/lcode.c | 881 ++++++++++++++++++++++++ liblua/lcode.h | 83 +++ liblua/lcorolib.c | 155 +++++ liblua/lctype.c | 52 ++ liblua/lctype.h | 95 +++ liblua/ldblib.c | 398 +++++++++++ liblua/ldebug.c | 580 ++++++++++++++++ liblua/ldebug.h | 34 + liblua/ldo.c | 673 +++++++++++++++++++ liblua/ldo.h | 46 ++ liblua/ldump.c | 173 +++++ liblua/lfunc.c | 161 +++++ liblua/lfunc.h | 33 + liblua/lgc.c | 1213 +++++++++++++++++++++++++++++++++ liblua/lgc.h | 157 +++++ liblua/linit.c | 67 ++ liblua/liolib.c | 665 ++++++++++++++++++ liblua/llex.c | 527 +++++++++++++++ liblua/llex.h | 78 +++ liblua/llimits.h | 309 +++++++++ liblua/lmathlib.c | 279 ++++++++ liblua/lmem.c | 99 +++ liblua/lmem.h | 57 ++ liblua/loadlib.c | 725 ++++++++++++++++++++ liblua/lobject.c | 287 ++++++++ liblua/lobject.h | 607 +++++++++++++++++ liblua/lopcodes.c | 107 +++ liblua/lopcodes.h | 288 ++++++++ liblua/loslib.c | 323 +++++++++ liblua/lparser.c | 1638 +++++++++++++++++++++++++++++++++++++++++++++ liblua/lparser.h | 119 ++++ liblua/lstate.c | 322 +++++++++ liblua/lstate.h | 228 +++++++ liblua/lstring.c | 185 +++++ liblua/lstring.h | 46 ++ liblua/lstrlib.c | 1019 ++++++++++++++++++++++++++++ liblua/ltable.c | 588 ++++++++++++++++ liblua/ltable.h | 41 ++ liblua/ltablib.c | 283 ++++++++ liblua/ltm.c | 77 +++ liblua/ltm.h | 57 ++ liblua/lua | Bin 0 -> 227685 bytes liblua/lua.c | 497 ++++++++++++++ liblua/lua.h | 444 ++++++++++++ liblua/lua.hpp | 9 + liblua/luac | Bin 0 -> 154588 bytes liblua/luac.c | 432 ++++++++++++ liblua/luaconf.h | 551 +++++++++++++++ liblua/lualib.h | 55 ++ liblua/lundump.c | 258 +++++++ liblua/lundump.h | 28 + liblua/lvm.c | 867 ++++++++++++++++++++++++ liblua/lvm.h | 44 ++ liblua/lzio.c | 76 +++ liblua/lzio.h | 65 ++ 62 files changed, 20416 insertions(+) create mode 100644 liblua/Makefile create mode 100644 liblua/lapi.c create mode 100644 liblua/lapi.h create mode 100644 liblua/lauxlib.c create mode 100644 liblua/lauxlib.h create mode 100644 liblua/lbaselib.c create mode 100644 liblua/lbitlib.c create mode 100644 liblua/lcode.c create mode 100644 liblua/lcode.h create mode 100644 liblua/lcorolib.c create mode 100644 liblua/lctype.c create mode 100644 liblua/lctype.h create mode 100644 liblua/ldblib.c create mode 100644 liblua/ldebug.c create mode 100644 liblua/ldebug.h create mode 100644 liblua/ldo.c create mode 100644 liblua/ldo.h create mode 100644 liblua/ldump.c create mode 100644 liblua/lfunc.c create mode 100644 liblua/lfunc.h create mode 100644 liblua/lgc.c create mode 100644 liblua/lgc.h create mode 100644 liblua/linit.c create mode 100644 liblua/liolib.c create mode 100644 liblua/llex.c create mode 100644 liblua/llex.h create mode 100644 liblua/llimits.h create mode 100644 liblua/lmathlib.c create mode 100644 liblua/lmem.c create mode 100644 liblua/lmem.h create mode 100644 liblua/loadlib.c create mode 100644 liblua/lobject.c create mode 100644 liblua/lobject.h create mode 100644 liblua/lopcodes.c create mode 100644 liblua/lopcodes.h create mode 100644 liblua/loslib.c create mode 100644 liblua/lparser.c create mode 100644 liblua/lparser.h create mode 100644 liblua/lstate.c create mode 100644 liblua/lstate.h create mode 100644 liblua/lstring.c create mode 100644 liblua/lstring.h create mode 100644 liblua/lstrlib.c create mode 100644 liblua/ltable.c create mode 100644 liblua/ltable.h create mode 100644 liblua/ltablib.c create mode 100644 liblua/ltm.c create mode 100644 liblua/ltm.h create mode 100755 liblua/lua create mode 100644 liblua/lua.c create mode 100644 liblua/lua.h create mode 100644 liblua/lua.hpp create mode 100755 liblua/luac create mode 100644 liblua/luac.c create mode 100644 liblua/luaconf.h create mode 100644 liblua/lualib.h create mode 100644 liblua/lundump.c create mode 100644 liblua/lundump.h create mode 100644 liblua/lvm.c create mode 100644 liblua/lvm.h create mode 100644 liblua/lzio.c create mode 100644 liblua/lzio.h diff --git a/liblua/Makefile b/liblua/Makefile new file mode 100644 index 00000000..fea895bc --- /dev/null +++ b/liblua/Makefile @@ -0,0 +1,187 @@ +# Makefile for building Lua +# See ../doc/readme.html for installation and customization instructions. + +# == CHANGE THE SETTINGS BELOW TO SUIT YOUR ENVIRONMENT ======================= + +# Your platform. See PLATS for possible values. +PLAT= none + +CC= gcc +CFLAGS= -O2 -Wall -DLUA_COMPAT_ALL $(SYSCFLAGS) $(MYCFLAGS) +LDFLAGS= $(SYSLDFLAGS) $(MYLDFLAGS) +LIBS= -lm $(SYSLIBS) $(MYLIBS) + +AR= ar rcu +RANLIB= ranlib +RM= rm -f + +SYSCFLAGS= +SYSLDFLAGS= +SYSLIBS= + +MYCFLAGS= +MYLDFLAGS= +MYLIBS= +MYOBJS= + +# == END OF USER SETTINGS -- NO NEED TO CHANGE ANYTHING BELOW THIS LINE ======= + +PLATS= aix ansi bsd freebsd generic linux macosx mingw posix solaris + +LUA_A= liblua.a +CORE_O= lapi.o lcode.o lctype.o ldebug.o ldo.o ldump.o lfunc.o lgc.o llex.o \ + lmem.o lobject.o lopcodes.o lparser.o lstate.o lstring.o ltable.o \ + ltm.o lundump.o lvm.o lzio.o +LIB_O= lauxlib.o lbaselib.o lbitlib.o lcorolib.o ldblib.o liolib.o \ + lmathlib.o loslib.o lstrlib.o ltablib.o loadlib.o linit.o +BASE_O= $(CORE_O) $(LIB_O) $(MYOBJS) + +LUA_T= lua +LUA_O= lua.o + +LUAC_T= luac +LUAC_O= luac.o + +ALL_O= $(BASE_O) $(LUA_O) $(LUAC_O) +ALL_T= $(LUA_A) $(LUA_T) $(LUAC_T) +ALL_A= $(LUA_A) + +# Targets start here. +default: $(PLAT) + +all: $(ALL_T) + +o: $(ALL_O) + +a: $(ALL_A) + +$(LUA_A): $(BASE_O) + $(AR) $@ $(BASE_O) + $(RANLIB) $@ + +$(LUA_T): $(LUA_O) $(LUA_A) + $(CC) -o $@ $(LDFLAGS) $(LUA_O) $(LUA_A) $(LIBS) + +$(LUAC_T): $(LUAC_O) $(LUA_A) + $(CC) -o $@ $(LDFLAGS) $(LUAC_O) $(LUA_A) $(LIBS) + +clean: + $(RM) $(ALL_T) $(ALL_O) + +depend: + @$(CC) $(CFLAGS) -MM l*.c + +echo: + @echo "PLAT= $(PLAT)" + @echo "CC= $(CC)" + @echo "CFLAGS= $(CFLAGS)" + @echo "LDFLAGS= $(SYSLDFLAGS)" + @echo "LIBS= $(LIBS)" + @echo "AR= $(AR)" + @echo "RANLIB= $(RANLIB)" + @echo "RM= $(RM)" + +# Convenience targets for popular platforms +ALL= all + +none: + @echo "Please do 'make PLATFORM' where PLATFORM is one of these:" + @echo " $(PLATS)" + +aix: + $(MAKE) $(ALL) CC="xlc" CFLAGS="-O2 -DLUA_USE_POSIX -DLUA_USE_DLOPEN" SYSLIBS="-ldl" SYSLDFLAGS="-brtl -bexpall" + +ansi: + $(MAKE) $(ALL) SYSCFLAGS="-DLUA_ANSI" + +bsd: + $(MAKE) $(ALL) SYSCFLAGS="-DLUA_USE_POSIX -DLUA_USE_DLOPEN" SYSLIBS="-Wl,-E" + +freebsd: + $(MAKE) $(ALL) SYSCFLAGS="-DLUA_USE_LINUX" SYSLIBS="-Wl,-E -lreadline" + +generic: $(ALL) + +linux: + $(MAKE) $(ALL) SYSCFLAGS="-DLUA_USE_LINUX" SYSLIBS="-Wl,-E -ldl -lreadline" + +macosx: + $(MAKE) $(ALL) SYSCFLAGS="-DLUA_USE_MACOSX" SYSLIBS="-lreadline" + +mingw: + $(MAKE) "LUA_A=lua52.dll" "LUA_T=lua.exe" \ + "AR=$(CC) -shared -o" "RANLIB=strip --strip-unneeded" \ + "SYSCFLAGS=-DLUA_BUILD_AS_DLL" "SYSLIBS=" "SYSLDFLAGS=-s" lua.exe + $(MAKE) "LUAC_T=luac.exe" luac.exe + +posix: + $(MAKE) $(ALL) SYSCFLAGS="-DLUA_USE_POSIX" + +solaris: + $(MAKE) $(ALL) SYSCFLAGS="-DLUA_USE_POSIX -DLUA_USE_DLOPEN" SYSLIBS="-ldl" + +# list targets that do not create files (but not all makes understand .PHONY) +.PHONY: all $(PLATS) default o a clean depend echo none + +# DO NOT DELETE + +lapi.o: lapi.c lua.h luaconf.h lapi.h llimits.h lstate.h lobject.h ltm.h \ + lzio.h lmem.h ldebug.h ldo.h lfunc.h lgc.h lstring.h ltable.h lundump.h \ + lvm.h +lauxlib.o: lauxlib.c lua.h luaconf.h lauxlib.h +lbaselib.o: lbaselib.c lua.h luaconf.h lauxlib.h lualib.h +lbitlib.o: lbitlib.c lua.h luaconf.h lauxlib.h lualib.h +lcode.o: lcode.c lua.h luaconf.h lcode.h llex.h lobject.h llimits.h \ + lzio.h lmem.h lopcodes.h lparser.h ldebug.h lstate.h ltm.h ldo.h lgc.h \ + lstring.h ltable.h lvm.h +lcorolib.o: lcorolib.c lua.h luaconf.h lauxlib.h lualib.h +lctype.o: lctype.c lctype.h lua.h luaconf.h llimits.h +ldblib.o: ldblib.c lua.h luaconf.h lauxlib.h lualib.h +ldebug.o: ldebug.c lua.h luaconf.h lapi.h llimits.h lstate.h lobject.h \ + ltm.h lzio.h lmem.h lcode.h llex.h lopcodes.h lparser.h ldebug.h ldo.h \ + lfunc.h lstring.h lgc.h ltable.h lvm.h +ldo.o: ldo.c lua.h luaconf.h lapi.h llimits.h lstate.h lobject.h ltm.h \ + lzio.h lmem.h ldebug.h ldo.h lfunc.h lgc.h lopcodes.h lparser.h \ + lstring.h ltable.h lundump.h lvm.h +ldump.o: ldump.c lua.h luaconf.h lobject.h llimits.h lstate.h ltm.h \ + lzio.h lmem.h lundump.h +lfunc.o: lfunc.c lua.h luaconf.h lfunc.h lobject.h llimits.h lgc.h \ + lstate.h ltm.h lzio.h lmem.h +lgc.o: lgc.c lua.h luaconf.h ldebug.h lstate.h lobject.h llimits.h ltm.h \ + lzio.h lmem.h ldo.h lfunc.h lgc.h lstring.h ltable.h +linit.o: linit.c lua.h luaconf.h lualib.h lauxlib.h +liolib.o: liolib.c lua.h luaconf.h lauxlib.h lualib.h +llex.o: llex.c lua.h luaconf.h lctype.h llimits.h ldo.h lobject.h \ + lstate.h ltm.h lzio.h lmem.h llex.h lparser.h lstring.h lgc.h ltable.h +lmathlib.o: lmathlib.c lua.h luaconf.h lauxlib.h lualib.h +lmem.o: lmem.c lua.h luaconf.h ldebug.h lstate.h lobject.h llimits.h \ + ltm.h lzio.h lmem.h ldo.h lgc.h +loadlib.o: loadlib.c lua.h luaconf.h lauxlib.h lualib.h +lobject.o: lobject.c lua.h luaconf.h lctype.h llimits.h ldebug.h lstate.h \ + lobject.h ltm.h lzio.h lmem.h ldo.h lstring.h lgc.h lvm.h +lopcodes.o: lopcodes.c lopcodes.h llimits.h lua.h luaconf.h +loslib.o: loslib.c lua.h luaconf.h lauxlib.h lualib.h +lparser.o: lparser.c lua.h luaconf.h lcode.h llex.h lobject.h llimits.h \ + lzio.h lmem.h lopcodes.h lparser.h ldebug.h lstate.h ltm.h ldo.h lfunc.h \ + lstring.h lgc.h ltable.h +lstate.o: lstate.c lua.h luaconf.h lapi.h llimits.h lstate.h lobject.h \ + ltm.h lzio.h lmem.h ldebug.h ldo.h lfunc.h lgc.h llex.h lstring.h \ + ltable.h +lstring.o: lstring.c lua.h luaconf.h lmem.h llimits.h lobject.h lstate.h \ + ltm.h lzio.h lstring.h lgc.h +lstrlib.o: lstrlib.c lua.h luaconf.h lauxlib.h lualib.h +ltable.o: ltable.c lua.h luaconf.h ldebug.h lstate.h lobject.h llimits.h \ + ltm.h lzio.h lmem.h ldo.h lgc.h lstring.h ltable.h lvm.h +ltablib.o: ltablib.c lua.h luaconf.h lauxlib.h lualib.h +ltm.o: ltm.c lua.h luaconf.h lobject.h llimits.h lstate.h ltm.h lzio.h \ + lmem.h lstring.h lgc.h ltable.h +lua.o: lua.c lua.h luaconf.h lauxlib.h lualib.h +luac.o: luac.c lua.h luaconf.h lauxlib.h lobject.h llimits.h lstate.h \ + ltm.h lzio.h lmem.h lundump.h ldebug.h lopcodes.h +lundump.o: lundump.c lua.h luaconf.h ldebug.h lstate.h lobject.h \ + llimits.h ltm.h lzio.h lmem.h ldo.h lfunc.h lstring.h lgc.h lundump.h +lvm.o: lvm.c lua.h luaconf.h ldebug.h lstate.h lobject.h llimits.h ltm.h \ + lzio.h lmem.h ldo.h lfunc.h lgc.h lopcodes.h lstring.h ltable.h lvm.h +lzio.o: lzio.c lua.h luaconf.h llimits.h lmem.h lstate.h lobject.h ltm.h \ + lzio.h + diff --git a/liblua/lapi.c b/liblua/lapi.c new file mode 100644 index 00000000..791d8545 --- /dev/null +++ b/liblua/lapi.c @@ -0,0 +1,1284 @@ +/* +** $Id: lapi.c,v 2.171 2013/03/16 21:10:18 roberto Exp $ +** Lua API +** See Copyright Notice in lua.h +*/ + + +#include +#include + +#define lapi_c +#define LUA_CORE + +#include "lua.h" + +#include "lapi.h" +#include "ldebug.h" +#include "ldo.h" +#include "lfunc.h" +#include "lgc.h" +#include "lmem.h" +#include "lobject.h" +#include "lstate.h" +#include "lstring.h" +#include "ltable.h" +#include "ltm.h" +#include "lundump.h" +#include "lvm.h" + + + +const char lua_ident[] = + "$LuaVersion: " LUA_COPYRIGHT " $" + "$LuaAuthors: " LUA_AUTHORS " $"; + + +/* value at a non-valid index */ +#define NONVALIDVALUE cast(TValue *, luaO_nilobject) + +/* corresponding test */ +#define isvalid(o) ((o) != luaO_nilobject) + +/* test for pseudo index */ +#define ispseudo(i) ((i) <= LUA_REGISTRYINDEX) + +/* test for valid but not pseudo index */ +#define isstackindex(i, o) (isvalid(o) && !ispseudo(i)) + +#define api_checkvalidindex(L, o) api_check(L, isvalid(o), "invalid index") + +#define api_checkstackindex(L, i, o) \ + api_check(L, isstackindex(i, o), "index not in the stack") + + +static TValue *index2addr (lua_State *L, int idx) { + CallInfo *ci = L->ci; + if (idx > 0) { + TValue *o = ci->func + idx; + api_check(L, idx <= ci->top - (ci->func + 1), "unacceptable index"); + if (o >= L->top) return NONVALIDVALUE; + else return o; + } + else if (!ispseudo(idx)) { /* negative index */ + api_check(L, idx != 0 && -idx <= L->top - (ci->func + 1), "invalid index"); + return L->top + idx; + } + else if (idx == LUA_REGISTRYINDEX) + return &G(L)->l_registry; + else { /* upvalues */ + idx = LUA_REGISTRYINDEX - idx; + api_check(L, idx <= MAXUPVAL + 1, "upvalue index too large"); + if (ttislcf(ci->func)) /* light C function? */ + return NONVALIDVALUE; /* it has no upvalues */ + else { + CClosure *func = clCvalue(ci->func); + return (idx <= func->nupvalues) ? &func->upvalue[idx-1] : NONVALIDVALUE; + } + } +} + + +/* +** to be called by 'lua_checkstack' in protected mode, to grow stack +** capturing memory errors +*/ +static void growstack (lua_State *L, void *ud) { + int size = *(int *)ud; + luaD_growstack(L, size); +} + + +LUA_API int lua_checkstack (lua_State *L, int size) { + int res; + CallInfo *ci = L->ci; + lua_lock(L); + if (L->stack_last - L->top > size) /* stack large enough? */ + res = 1; /* yes; check is OK */ + else { /* no; need to grow stack */ + int inuse = cast_int(L->top - L->stack) + EXTRA_STACK; + if (inuse > LUAI_MAXSTACK - size) /* can grow without overflow? */ + res = 0; /* no */ + else /* try to grow stack */ + res = (luaD_rawrunprotected(L, &growstack, &size) == LUA_OK); + } + if (res && ci->top < L->top + size) + ci->top = L->top + size; /* adjust frame top */ + lua_unlock(L); + return res; +} + + +LUA_API void lua_xmove (lua_State *from, lua_State *to, int n) { + int i; + if (from == to) return; + lua_lock(to); + api_checknelems(from, n); + api_check(from, G(from) == G(to), "moving among independent states"); + api_check(from, to->ci->top - to->top >= n, "not enough elements to move"); + from->top -= n; + for (i = 0; i < n; i++) { + setobj2s(to, to->top++, from->top + i); + } + lua_unlock(to); +} + + +LUA_API lua_CFunction lua_atpanic (lua_State *L, lua_CFunction panicf) { + lua_CFunction old; + lua_lock(L); + old = G(L)->panic; + G(L)->panic = panicf; + lua_unlock(L); + return old; +} + + +LUA_API const lua_Number *lua_version (lua_State *L) { + static const lua_Number version = LUA_VERSION_NUM; + if (L == NULL) return &version; + else return G(L)->version; +} + + + +/* +** basic stack manipulation +*/ + + +/* +** convert an acceptable stack index into an absolute index +*/ +LUA_API int lua_absindex (lua_State *L, int idx) { + return (idx > 0 || ispseudo(idx)) + ? idx + : cast_int(L->top - L->ci->func + idx); +} + + +LUA_API int lua_gettop (lua_State *L) { + return cast_int(L->top - (L->ci->func + 1)); +} + + +LUA_API void lua_settop (lua_State *L, int idx) { + StkId func = L->ci->func; + lua_lock(L); + if (idx >= 0) { + api_check(L, idx <= L->stack_last - (func + 1), "new top too large"); + while (L->top < (func + 1) + idx) + setnilvalue(L->top++); + L->top = (func + 1) + idx; + } + else { + api_check(L, -(idx+1) <= (L->top - (func + 1)), "invalid new top"); + L->top += idx+1; /* `subtract' index (index is negative) */ + } + lua_unlock(L); +} + + +LUA_API void lua_remove (lua_State *L, int idx) { + StkId p; + lua_lock(L); + p = index2addr(L, idx); + api_checkstackindex(L, idx, p); + while (++p < L->top) setobjs2s(L, p-1, p); + L->top--; + lua_unlock(L); +} + + +LUA_API void lua_insert (lua_State *L, int idx) { + StkId p; + StkId q; + lua_lock(L); + p = index2addr(L, idx); + api_checkstackindex(L, idx, p); + for (q = L->top; q > p; q--) /* use L->top as a temporary */ + setobjs2s(L, q, q - 1); + setobjs2s(L, p, L->top); + lua_unlock(L); +} + + +static void moveto (lua_State *L, TValue *fr, int idx) { + TValue *to = index2addr(L, idx); + api_checkvalidindex(L, to); + setobj(L, to, fr); + if (idx < LUA_REGISTRYINDEX) /* function upvalue? */ + luaC_barrier(L, clCvalue(L->ci->func), fr); + /* LUA_REGISTRYINDEX does not need gc barrier + (collector revisits it before finishing collection) */ +} + + +LUA_API void lua_replace (lua_State *L, int idx) { + lua_lock(L); + api_checknelems(L, 1); + moveto(L, L->top - 1, idx); + L->top--; + lua_unlock(L); +} + + +LUA_API void lua_copy (lua_State *L, int fromidx, int toidx) { + TValue *fr; + lua_lock(L); + fr = index2addr(L, fromidx); + moveto(L, fr, toidx); + lua_unlock(L); +} + + +LUA_API void lua_pushvalue (lua_State *L, int idx) { + lua_lock(L); + setobj2s(L, L->top, index2addr(L, idx)); + api_incr_top(L); + lua_unlock(L); +} + + + +/* +** access functions (stack -> C) +*/ + + +LUA_API int lua_type (lua_State *L, int idx) { + StkId o = index2addr(L, idx); + return (isvalid(o) ? ttypenv(o) : LUA_TNONE); +} + + +LUA_API const char *lua_typename (lua_State *L, int t) { + UNUSED(L); + return ttypename(t); +} + + +LUA_API int lua_iscfunction (lua_State *L, int idx) { + StkId o = index2addr(L, idx); + return (ttislcf(o) || (ttisCclosure(o))); +} + + +LUA_API int lua_isnumber (lua_State *L, int idx) { + TValue n; + const TValue *o = index2addr(L, idx); + return tonumber(o, &n); +} + + +LUA_API int lua_isstring (lua_State *L, int idx) { + int t = lua_type(L, idx); + return (t == LUA_TSTRING || t == LUA_TNUMBER); +} + + +LUA_API int lua_isuserdata (lua_State *L, int idx) { + const TValue *o = index2addr(L, idx); + return (ttisuserdata(o) || ttislightuserdata(o)); +} + + +LUA_API int lua_rawequal (lua_State *L, int index1, int index2) { + StkId o1 = index2addr(L, index1); + StkId o2 = index2addr(L, index2); + return (isvalid(o1) && isvalid(o2)) ? luaV_rawequalobj(o1, o2) : 0; +} + + +LUA_API void lua_arith (lua_State *L, int op) { + StkId o1; /* 1st operand */ + StkId o2; /* 2nd operand */ + lua_lock(L); + if (op != LUA_OPUNM) /* all other operations expect two operands */ + api_checknelems(L, 2); + else { /* for unary minus, add fake 2nd operand */ + api_checknelems(L, 1); + setobjs2s(L, L->top, L->top - 1); + L->top++; + } + o1 = L->top - 2; + o2 = L->top - 1; + if (ttisnumber(o1) && ttisnumber(o2)) { + setnvalue(o1, luaO_arith(op, nvalue(o1), nvalue(o2))); + } + else + luaV_arith(L, o1, o1, o2, cast(TMS, op - LUA_OPADD + TM_ADD)); + L->top--; + lua_unlock(L); +} + + +LUA_API int lua_compare (lua_State *L, int index1, int index2, int op) { + StkId o1, o2; + int i = 0; + lua_lock(L); /* may call tag method */ + o1 = index2addr(L, index1); + o2 = index2addr(L, index2); + if (isvalid(o1) && isvalid(o2)) { + switch (op) { + case LUA_OPEQ: i = equalobj(L, o1, o2); break; + case LUA_OPLT: i = luaV_lessthan(L, o1, o2); break; + case LUA_OPLE: i = luaV_lessequal(L, o1, o2); break; + default: api_check(L, 0, "invalid option"); + } + } + lua_unlock(L); + return i; +} + + +LUA_API lua_Number lua_tonumberx (lua_State *L, int idx, int *isnum) { + TValue n; + const TValue *o = index2addr(L, idx); + if (tonumber(o, &n)) { + if (isnum) *isnum = 1; + return nvalue(o); + } + else { + if (isnum) *isnum = 0; + return 0; + } +} + + +LUA_API lua_Integer lua_tointegerx (lua_State *L, int idx, int *isnum) { + TValue n; + const TValue *o = index2addr(L, idx); + if (tonumber(o, &n)) { + lua_Integer res; + lua_Number num = nvalue(o); + lua_number2integer(res, num); + if (isnum) *isnum = 1; + return res; + } + else { + if (isnum) *isnum = 0; + return 0; + } +} + + +LUA_API lua_Unsigned lua_tounsignedx (lua_State *L, int idx, int *isnum) { + TValue n; + const TValue *o = index2addr(L, idx); + if (tonumber(o, &n)) { + lua_Unsigned res; + lua_Number num = nvalue(o); + lua_number2unsigned(res, num); + if (isnum) *isnum = 1; + return res; + } + else { + if (isnum) *isnum = 0; + return 0; + } +} + + +LUA_API int lua_toboolean (lua_State *L, int idx) { + const TValue *o = index2addr(L, idx); + return !l_isfalse(o); +} + + +LUA_API const char *lua_tolstring (lua_State *L, int idx, size_t *len) { + StkId o = index2addr(L, idx); + if (!ttisstring(o)) { + lua_lock(L); /* `luaV_tostring' may create a new string */ + if (!luaV_tostring(L, o)) { /* conversion failed? */ + if (len != NULL) *len = 0; + lua_unlock(L); + return NULL; + } + luaC_checkGC(L); + o = index2addr(L, idx); /* previous call may reallocate the stack */ + lua_unlock(L); + } + if (len != NULL) *len = tsvalue(o)->len; + return svalue(o); +} + + +LUA_API size_t lua_rawlen (lua_State *L, int idx) { + StkId o = index2addr(L, idx); + switch (ttypenv(o)) { + case LUA_TSTRING: return tsvalue(o)->len; + case LUA_TUSERDATA: return uvalue(o)->len; + case LUA_TTABLE: return luaH_getn(hvalue(o)); + default: return 0; + } +} + + +LUA_API lua_CFunction lua_tocfunction (lua_State *L, int idx) { + StkId o = index2addr(L, idx); + if (ttislcf(o)) return fvalue(o); + else if (ttisCclosure(o)) + return clCvalue(o)->f; + else return NULL; /* not a C function */ +} + + +LUA_API void *lua_touserdata (lua_State *L, int idx) { + StkId o = index2addr(L, idx); + switch (ttypenv(o)) { + case LUA_TUSERDATA: return (rawuvalue(o) + 1); + case LUA_TLIGHTUSERDATA: return pvalue(o); + default: return NULL; + } +} + + +LUA_API lua_State *lua_tothread (lua_State *L, int idx) { + StkId o = index2addr(L, idx); + return (!ttisthread(o)) ? NULL : thvalue(o); +} + + +LUA_API const void *lua_topointer (lua_State *L, int idx) { + StkId o = index2addr(L, idx); + switch (ttype(o)) { + case LUA_TTABLE: return hvalue(o); + case LUA_TLCL: return clLvalue(o); + case LUA_TCCL: return clCvalue(o); + case LUA_TLCF: return cast(void *, cast(size_t, fvalue(o))); + case LUA_TTHREAD: return thvalue(o); + case LUA_TUSERDATA: + case LUA_TLIGHTUSERDATA: + return lua_touserdata(L, idx); + default: return NULL; + } +} + + + +/* +** push functions (C -> stack) +*/ + + +LUA_API void lua_pushnil (lua_State *L) { + lua_lock(L); + setnilvalue(L->top); + api_incr_top(L); + lua_unlock(L); +} + + +LUA_API void lua_pushnumber (lua_State *L, lua_Number n) { + lua_lock(L); + setnvalue(L->top, n); + luai_checknum(L, L->top, + luaG_runerror(L, "C API - attempt to push a signaling NaN")); + api_incr_top(L); + lua_unlock(L); +} + + +LUA_API void lua_pushinteger (lua_State *L, lua_Integer n) { + lua_lock(L); + setnvalue(L->top, cast_num(n)); + api_incr_top(L); + lua_unlock(L); +} + + +LUA_API void lua_pushunsigned (lua_State *L, lua_Unsigned u) { + lua_Number n; + lua_lock(L); + n = lua_unsigned2number(u); + setnvalue(L->top, n); + api_incr_top(L); + lua_unlock(L); +} + + +LUA_API const char *lua_pushlstring (lua_State *L, const char *s, size_t len) { + TString *ts; + lua_lock(L); + luaC_checkGC(L); + ts = luaS_newlstr(L, s, len); + setsvalue2s(L, L->top, ts); + api_incr_top(L); + lua_unlock(L); + return getstr(ts); +} + + +LUA_API const char *lua_pushstring (lua_State *L, const char *s) { + if (s == NULL) { + lua_pushnil(L); + return NULL; + } + else { + TString *ts; + lua_lock(L); + luaC_checkGC(L); + ts = luaS_new(L, s); + setsvalue2s(L, L->top, ts); + api_incr_top(L); + lua_unlock(L); + return getstr(ts); + } +} + + +LUA_API const char *lua_pushvfstring (lua_State *L, const char *fmt, + va_list argp) { + const char *ret; + lua_lock(L); + luaC_checkGC(L); + ret = luaO_pushvfstring(L, fmt, argp); + lua_unlock(L); + return ret; +} + + +LUA_API const char *lua_pushfstring (lua_State *L, const char *fmt, ...) { + const char *ret; + va_list argp; + lua_lock(L); + luaC_checkGC(L); + va_start(argp, fmt); + ret = luaO_pushvfstring(L, fmt, argp); + va_end(argp); + lua_unlock(L); + return ret; +} + + +LUA_API void lua_pushcclosure (lua_State *L, lua_CFunction fn, int n) { + lua_lock(L); + if (n == 0) { + setfvalue(L->top, fn); + } + else { + Closure *cl; + api_checknelems(L, n); + api_check(L, n <= MAXUPVAL, "upvalue index too large"); + luaC_checkGC(L); + cl = luaF_newCclosure(L, n); + cl->c.f = fn; + L->top -= n; + while (n--) + setobj2n(L, &cl->c.upvalue[n], L->top + n); + setclCvalue(L, L->top, cl); + } + api_incr_top(L); + lua_unlock(L); +} + + +LUA_API void lua_pushboolean (lua_State *L, int b) { + lua_lock(L); + setbvalue(L->top, (b != 0)); /* ensure that true is 1 */ + api_incr_top(L); + lua_unlock(L); +} + + +LUA_API void lua_pushlightuserdata (lua_State *L, void *p) { + lua_lock(L); + setpvalue(L->top, p); + api_incr_top(L); + lua_unlock(L); +} + + +LUA_API int lua_pushthread (lua_State *L) { + lua_lock(L); + setthvalue(L, L->top, L); + api_incr_top(L); + lua_unlock(L); + return (G(L)->mainthread == L); +} + + + +/* +** get functions (Lua -> stack) +*/ + + +LUA_API void lua_getglobal (lua_State *L, const char *var) { + Table *reg = hvalue(&G(L)->l_registry); + const TValue *gt; /* global table */ + lua_lock(L); + gt = luaH_getint(reg, LUA_RIDX_GLOBALS); + setsvalue2s(L, L->top++, luaS_new(L, var)); + luaV_gettable(L, gt, L->top - 1, L->top - 1); + lua_unlock(L); +} + + +LUA_API void lua_gettable (lua_State *L, int idx) { + StkId t; + lua_lock(L); + t = index2addr(L, idx); + luaV_gettable(L, t, L->top - 1, L->top - 1); + lua_unlock(L); +} + + +LUA_API void lua_getfield (lua_State *L, int idx, const char *k) { + StkId t; + lua_lock(L); + t = index2addr(L, idx); + setsvalue2s(L, L->top, luaS_new(L, k)); + api_incr_top(L); + luaV_gettable(L, t, L->top - 1, L->top - 1); + lua_unlock(L); +} + + +LUA_API void lua_rawget (lua_State *L, int idx) { + StkId t; + lua_lock(L); + t = index2addr(L, idx); + api_check(L, ttistable(t), "table expected"); + setobj2s(L, L->top - 1, luaH_get(hvalue(t), L->top - 1)); + lua_unlock(L); +} + + +LUA_API void lua_rawgeti (lua_State *L, int idx, int n) { + StkId t; + lua_lock(L); + t = index2addr(L, idx); + api_check(L, ttistable(t), "table expected"); + setobj2s(L, L->top, luaH_getint(hvalue(t), n)); + api_incr_top(L); + lua_unlock(L); +} + + +LUA_API void lua_rawgetp (lua_State *L, int idx, const void *p) { + StkId t; + TValue k; + lua_lock(L); + t = index2addr(L, idx); + api_check(L, ttistable(t), "table expected"); + setpvalue(&k, cast(void *, p)); + setobj2s(L, L->top, luaH_get(hvalue(t), &k)); + api_incr_top(L); + lua_unlock(L); +} + + +LUA_API void lua_createtable (lua_State *L, int narray, int nrec) { + Table *t; + lua_lock(L); + luaC_checkGC(L); + t = luaH_new(L); + sethvalue(L, L->top, t); + api_incr_top(L); + if (narray > 0 || nrec > 0) + luaH_resize(L, t, narray, nrec); + lua_unlock(L); +} + + +LUA_API int lua_getmetatable (lua_State *L, int objindex) { + const TValue *obj; + Table *mt = NULL; + int res; + lua_lock(L); + obj = index2addr(L, objindex); + switch (ttypenv(obj)) { + case LUA_TTABLE: + mt = hvalue(obj)->metatable; + break; + case LUA_TUSERDATA: + mt = uvalue(obj)->metatable; + break; + default: + mt = G(L)->mt[ttypenv(obj)]; + break; + } + if (mt == NULL) + res = 0; + else { + sethvalue(L, L->top, mt); + api_incr_top(L); + res = 1; + } + lua_unlock(L); + return res; +} + + +LUA_API void lua_getuservalue (lua_State *L, int idx) { + StkId o; + lua_lock(L); + o = index2addr(L, idx); + api_check(L, ttisuserdata(o), "userdata expected"); + if (uvalue(o)->env) { + sethvalue(L, L->top, uvalue(o)->env); + } else + setnilvalue(L->top); + api_incr_top(L); + lua_unlock(L); +} + + +/* +** set functions (stack -> Lua) +*/ + + +LUA_API void lua_setglobal (lua_State *L, const char *var) { + Table *reg = hvalue(&G(L)->l_registry); + const TValue *gt; /* global table */ + lua_lock(L); + api_checknelems(L, 1); + gt = luaH_getint(reg, LUA_RIDX_GLOBALS); + setsvalue2s(L, L->top++, luaS_new(L, var)); + luaV_settable(L, gt, L->top - 1, L->top - 2); + L->top -= 2; /* pop value and key */ + lua_unlock(L); +} + + +LUA_API void lua_settable (lua_State *L, int idx) { + StkId t; + lua_lock(L); + api_checknelems(L, 2); + t = index2addr(L, idx); + luaV_settable(L, t, L->top - 2, L->top - 1); + L->top -= 2; /* pop index and value */ + lua_unlock(L); +} + + +LUA_API void lua_setfield (lua_State *L, int idx, const char *k) { + StkId t; + lua_lock(L); + api_checknelems(L, 1); + t = index2addr(L, idx); + setsvalue2s(L, L->top++, luaS_new(L, k)); + luaV_settable(L, t, L->top - 1, L->top - 2); + L->top -= 2; /* pop value and key */ + lua_unlock(L); +} + + +LUA_API void lua_rawset (lua_State *L, int idx) { + StkId t; + lua_lock(L); + api_checknelems(L, 2); + t = index2addr(L, idx); + api_check(L, ttistable(t), "table expected"); + setobj2t(L, luaH_set(L, hvalue(t), L->top-2), L->top-1); + invalidateTMcache(hvalue(t)); + luaC_barrierback(L, gcvalue(t), L->top-1); + L->top -= 2; + lua_unlock(L); +} + + +LUA_API void lua_rawseti (lua_State *L, int idx, int n) { + StkId t; + lua_lock(L); + api_checknelems(L, 1); + t = index2addr(L, idx); + api_check(L, ttistable(t), "table expected"); + luaH_setint(L, hvalue(t), n, L->top - 1); + luaC_barrierback(L, gcvalue(t), L->top-1); + L->top--; + lua_unlock(L); +} + + +LUA_API void lua_rawsetp (lua_State *L, int idx, const void *p) { + StkId t; + TValue k; + lua_lock(L); + api_checknelems(L, 1); + t = index2addr(L, idx); + api_check(L, ttistable(t), "table expected"); + setpvalue(&k, cast(void *, p)); + setobj2t(L, luaH_set(L, hvalue(t), &k), L->top - 1); + luaC_barrierback(L, gcvalue(t), L->top - 1); + L->top--; + lua_unlock(L); +} + + +LUA_API int lua_setmetatable (lua_State *L, int objindex) { + TValue *obj; + Table *mt; + lua_lock(L); + api_checknelems(L, 1); + obj = index2addr(L, objindex); + if (ttisnil(L->top - 1)) + mt = NULL; + else { + api_check(L, ttistable(L->top - 1), "table expected"); + mt = hvalue(L->top - 1); + } + switch (ttypenv(obj)) { + case LUA_TTABLE: { + hvalue(obj)->metatable = mt; + if (mt) { + luaC_objbarrierback(L, gcvalue(obj), mt); + luaC_checkfinalizer(L, gcvalue(obj), mt); + } + break; + } + case LUA_TUSERDATA: { + uvalue(obj)->metatable = mt; + if (mt) { + luaC_objbarrier(L, rawuvalue(obj), mt); + luaC_checkfinalizer(L, gcvalue(obj), mt); + } + break; + } + default: { + G(L)->mt[ttypenv(obj)] = mt; + break; + } + } + L->top--; + lua_unlock(L); + return 1; +} + + +LUA_API void lua_setuservalue (lua_State *L, int idx) { + StkId o; + lua_lock(L); + api_checknelems(L, 1); + o = index2addr(L, idx); + api_check(L, ttisuserdata(o), "userdata expected"); + if (ttisnil(L->top - 1)) + uvalue(o)->env = NULL; + else { + api_check(L, ttistable(L->top - 1), "table expected"); + uvalue(o)->env = hvalue(L->top - 1); + luaC_objbarrier(L, gcvalue(o), hvalue(L->top - 1)); + } + L->top--; + lua_unlock(L); +} + + +/* +** `load' and `call' functions (run Lua code) +*/ + + +#define checkresults(L,na,nr) \ + api_check(L, (nr) == LUA_MULTRET || (L->ci->top - L->top >= (nr) - (na)), \ + "results from function overflow current stack size") + + +LUA_API int lua_getctx (lua_State *L, int *ctx) { + if (L->ci->callstatus & CIST_YIELDED) { + if (ctx) *ctx = L->ci->u.c.ctx; + return L->ci->u.c.status; + } + else return LUA_OK; +} + + +LUA_API void lua_callk (lua_State *L, int nargs, int nresults, int ctx, + lua_CFunction k) { + StkId func; + lua_lock(L); + api_check(L, k == NULL || !isLua(L->ci), + "cannot use continuations inside hooks"); + api_checknelems(L, nargs+1); + api_check(L, L->status == LUA_OK, "cannot do calls on non-normal thread"); + checkresults(L, nargs, nresults); + func = L->top - (nargs+1); + if (k != NULL && L->nny == 0) { /* need to prepare continuation? */ + L->ci->u.c.k = k; /* save continuation */ + L->ci->u.c.ctx = ctx; /* save context */ + luaD_call(L, func, nresults, 1); /* do the call */ + } + else /* no continuation or no yieldable */ + luaD_call(L, func, nresults, 0); /* just do the call */ + adjustresults(L, nresults); + lua_unlock(L); +} + + + +/* +** Execute a protected call. +*/ +struct CallS { /* data to `f_call' */ + StkId func; + int nresults; +}; + + +static void f_call (lua_State *L, void *ud) { + struct CallS *c = cast(struct CallS *, ud); + luaD_call(L, c->func, c->nresults, 0); +} + + + +LUA_API int lua_pcallk (lua_State *L, int nargs, int nresults, int errfunc, + int ctx, lua_CFunction k) { + struct CallS c; + int status; + ptrdiff_t func; + lua_lock(L); + api_check(L, k == NULL || !isLua(L->ci), + "cannot use continuations inside hooks"); + api_checknelems(L, nargs+1); + api_check(L, L->status == LUA_OK, "cannot do calls on non-normal thread"); + checkresults(L, nargs, nresults); + if (errfunc == 0) + func = 0; + else { + StkId o = index2addr(L, errfunc); + api_checkstackindex(L, errfunc, o); + func = savestack(L, o); + } + c.func = L->top - (nargs+1); /* function to be called */ + if (k == NULL || L->nny > 0) { /* no continuation or no yieldable? */ + c.nresults = nresults; /* do a 'conventional' protected call */ + status = luaD_pcall(L, f_call, &c, savestack(L, c.func), func); + } + else { /* prepare continuation (call is already protected by 'resume') */ + CallInfo *ci = L->ci; + ci->u.c.k = k; /* save continuation */ + ci->u.c.ctx = ctx; /* save context */ + /* save information for error recovery */ + ci->extra = savestack(L, c.func); + ci->u.c.old_allowhook = L->allowhook; + ci->u.c.old_errfunc = L->errfunc; + L->errfunc = func; + /* mark that function may do error recovery */ + ci->callstatus |= CIST_YPCALL; + luaD_call(L, c.func, nresults, 1); /* do the call */ + ci->callstatus &= ~CIST_YPCALL; + L->errfunc = ci->u.c.old_errfunc; + status = LUA_OK; /* if it is here, there were no errors */ + } + adjustresults(L, nresults); + lua_unlock(L); + return status; +} + + +LUA_API int lua_load (lua_State *L, lua_Reader reader, void *data, + const char *chunkname, const char *mode) { + ZIO z; + int status; + lua_lock(L); + if (!chunkname) chunkname = "?"; + luaZ_init(L, &z, reader, data); + status = luaD_protectedparser(L, &z, chunkname, mode); + if (status == LUA_OK) { /* no errors? */ + LClosure *f = clLvalue(L->top - 1); /* get newly created function */ + if (f->nupvalues == 1) { /* does it have one upvalue? */ + /* get global table from registry */ + Table *reg = hvalue(&G(L)->l_registry); + const TValue *gt = luaH_getint(reg, LUA_RIDX_GLOBALS); + /* set global table as 1st upvalue of 'f' (may be LUA_ENV) */ + setobj(L, f->upvals[0]->v, gt); + luaC_barrier(L, f->upvals[0], gt); + } + } + lua_unlock(L); + return status; +} + + +LUA_API int lua_dump (lua_State *L, lua_Writer writer, void *data) { + int status; + TValue *o; + lua_lock(L); + api_checknelems(L, 1); + o = L->top - 1; + if (isLfunction(o)) + status = luaU_dump(L, getproto(o), writer, data, 0); + else + status = 1; + lua_unlock(L); + return status; +} + + +LUA_API int lua_status (lua_State *L) { + return L->status; +} + + +/* +** Garbage-collection function +*/ + +LUA_API int lua_gc (lua_State *L, int what, int data) { + int res = 0; + global_State *g; + lua_lock(L); + g = G(L); + switch (what) { + case LUA_GCSTOP: { + g->gcrunning = 0; + break; + } + case LUA_GCRESTART: { + luaE_setdebt(g, 0); + g->gcrunning = 1; + break; + } + case LUA_GCCOLLECT: { + luaC_fullgc(L, 0); + break; + } + case LUA_GCCOUNT: { + /* GC values are expressed in Kbytes: #bytes/2^10 */ + res = cast_int(gettotalbytes(g) >> 10); + break; + } + case LUA_GCCOUNTB: { + res = cast_int(gettotalbytes(g) & 0x3ff); + break; + } + case LUA_GCSTEP: { + if (g->gckind == KGC_GEN) { /* generational mode? */ + res = (g->GCestimate == 0); /* true if it will do major collection */ + luaC_forcestep(L); /* do a single step */ + } + else { + lu_mem debt = cast(lu_mem, data) * 1024 - GCSTEPSIZE; + if (g->gcrunning) + debt += g->GCdebt; /* include current debt */ + luaE_setdebt(g, debt); + luaC_forcestep(L); + if (g->gcstate == GCSpause) /* end of cycle? */ + res = 1; /* signal it */ + } + break; + } + case LUA_GCSETPAUSE: { + res = g->gcpause; + g->gcpause = data; + break; + } + case LUA_GCSETMAJORINC: { + res = g->gcmajorinc; + g->gcmajorinc = data; + break; + } + case LUA_GCSETSTEPMUL: { + res = g->gcstepmul; + g->gcstepmul = data; + break; + } + case LUA_GCISRUNNING: { + res = g->gcrunning; + break; + } + case LUA_GCGEN: { /* change collector to generational mode */ + luaC_changemode(L, KGC_GEN); + break; + } + case LUA_GCINC: { /* change collector to incremental mode */ + luaC_changemode(L, KGC_NORMAL); + break; + } + default: res = -1; /* invalid option */ + } + lua_unlock(L); + return res; +} + + + +/* +** miscellaneous functions +*/ + + +LUA_API int lua_error (lua_State *L) { + lua_lock(L); + api_checknelems(L, 1); + luaG_errormsg(L); + /* code unreachable; will unlock when control actually leaves the kernel */ + return 0; /* to avoid warnings */ +} + + +LUA_API int lua_next (lua_State *L, int idx) { + StkId t; + int more; + lua_lock(L); + t = index2addr(L, idx); + api_check(L, ttistable(t), "table expected"); + more = luaH_next(L, hvalue(t), L->top - 1); + if (more) { + api_incr_top(L); + } + else /* no more elements */ + L->top -= 1; /* remove key */ + lua_unlock(L); + return more; +} + + +LUA_API void lua_concat (lua_State *L, int n) { + lua_lock(L); + api_checknelems(L, n); + if (n >= 2) { + luaC_checkGC(L); + luaV_concat(L, n); + } + else if (n == 0) { /* push empty string */ + setsvalue2s(L, L->top, luaS_newlstr(L, "", 0)); + api_incr_top(L); + } + /* else n == 1; nothing to do */ + lua_unlock(L); +} + + +LUA_API void lua_len (lua_State *L, int idx) { + StkId t; + lua_lock(L); + t = index2addr(L, idx); + luaV_objlen(L, L->top, t); + api_incr_top(L); + lua_unlock(L); +} + + +LUA_API lua_Alloc lua_getallocf (lua_State *L, void **ud) { + lua_Alloc f; + lua_lock(L); + if (ud) *ud = G(L)->ud; + f = G(L)->frealloc; + lua_unlock(L); + return f; +} + + +LUA_API void lua_setallocf (lua_State *L, lua_Alloc f, void *ud) { + lua_lock(L); + G(L)->ud = ud; + G(L)->frealloc = f; + lua_unlock(L); +} + + +LUA_API void *lua_newuserdata (lua_State *L, size_t size) { + Udata *u; + lua_lock(L); + luaC_checkGC(L); + u = luaS_newudata(L, size, NULL); + setuvalue(L, L->top, u); + api_incr_top(L); + lua_unlock(L); + return u + 1; +} + + + +static const char *aux_upvalue (StkId fi, int n, TValue **val, + GCObject **owner) { + switch (ttype(fi)) { + case LUA_TCCL: { /* C closure */ + CClosure *f = clCvalue(fi); + if (!(1 <= n && n <= f->nupvalues)) return NULL; + *val = &f->upvalue[n-1]; + if (owner) *owner = obj2gco(f); + return ""; + } + case LUA_TLCL: { /* Lua closure */ + LClosure *f = clLvalue(fi); + TString *name; + Proto *p = f->p; + if (!(1 <= n && n <= p->sizeupvalues)) return NULL; + *val = f->upvals[n-1]->v; + if (owner) *owner = obj2gco(f->upvals[n - 1]); + name = p->upvalues[n-1].name; + return (name == NULL) ? "" : getstr(name); + } + default: return NULL; /* not a closure */ + } +} + + +LUA_API const char *lua_getupvalue (lua_State *L, int funcindex, int n) { + const char *name; + TValue *val = NULL; /* to avoid warnings */ + lua_lock(L); + name = aux_upvalue(index2addr(L, funcindex), n, &val, NULL); + if (name) { + setobj2s(L, L->top, val); + api_incr_top(L); + } + lua_unlock(L); + return name; +} + + +LUA_API const char *lua_setupvalue (lua_State *L, int funcindex, int n) { + const char *name; + TValue *val = NULL; /* to avoid warnings */ + GCObject *owner = NULL; /* to avoid warnings */ + StkId fi; + lua_lock(L); + fi = index2addr(L, funcindex); + api_checknelems(L, 1); + name = aux_upvalue(fi, n, &val, &owner); + if (name) { + L->top--; + setobj(L, val, L->top); + luaC_barrier(L, owner, L->top); + } + lua_unlock(L); + return name; +} + + +static UpVal **getupvalref (lua_State *L, int fidx, int n, LClosure **pf) { + LClosure *f; + StkId fi = index2addr(L, fidx); + api_check(L, ttisLclosure(fi), "Lua function expected"); + f = clLvalue(fi); + api_check(L, (1 <= n && n <= f->p->sizeupvalues), "invalid upvalue index"); + if (pf) *pf = f; + return &f->upvals[n - 1]; /* get its upvalue pointer */ +} + + +LUA_API void *lua_upvalueid (lua_State *L, int fidx, int n) { + StkId fi = index2addr(L, fidx); + switch (ttype(fi)) { + case LUA_TLCL: { /* lua closure */ + return *getupvalref(L, fidx, n, NULL); + } + case LUA_TCCL: { /* C closure */ + CClosure *f = clCvalue(fi); + api_check(L, 1 <= n && n <= f->nupvalues, "invalid upvalue index"); + return &f->upvalue[n - 1]; + } + default: { + api_check(L, 0, "closure expected"); + return NULL; + } + } +} + + +LUA_API void lua_upvaluejoin (lua_State *L, int fidx1, int n1, + int fidx2, int n2) { + LClosure *f1; + UpVal **up1 = getupvalref(L, fidx1, n1, &f1); + UpVal **up2 = getupvalref(L, fidx2, n2, NULL); + *up1 = *up2; + luaC_objbarrier(L, f1, *up2); +} + diff --git a/liblua/lapi.h b/liblua/lapi.h new file mode 100644 index 00000000..0909a391 --- /dev/null +++ b/liblua/lapi.h @@ -0,0 +1,24 @@ +/* +** $Id: lapi.h,v 2.7 2009/11/27 15:37:59 roberto Exp $ +** Auxiliary functions from Lua API +** See Copyright Notice in lua.h +*/ + +#ifndef lapi_h +#define lapi_h + + +#include "llimits.h" +#include "lstate.h" + +#define api_incr_top(L) {L->top++; api_check(L, L->top <= L->ci->top, \ + "stack overflow");} + +#define adjustresults(L,nres) \ + { if ((nres) == LUA_MULTRET && L->ci->top < L->top) L->ci->top = L->top; } + +#define api_checknelems(L,n) api_check(L, (n) < (L->top - L->ci->func), \ + "not enough elements in the stack") + + +#endif diff --git a/liblua/lauxlib.c b/liblua/lauxlib.c new file mode 100644 index 00000000..2e989d66 --- /dev/null +++ b/liblua/lauxlib.c @@ -0,0 +1,959 @@ +/* +** $Id: lauxlib.c,v 1.248 2013/03/21 13:54:57 roberto Exp $ +** Auxiliary functions for building Lua libraries +** See Copyright Notice in lua.h +*/ + + +#include +#include +#include +#include +#include + + +/* This file uses only the official API of Lua. +** Any function declared here could be written as an application function. +*/ + +#define lauxlib_c +#define LUA_LIB + +#include "lua.h" + +#include "lauxlib.h" + + +/* +** {====================================================== +** Traceback +** ======================================================= +*/ + + +#define LEVELS1 12 /* size of the first part of the stack */ +#define LEVELS2 10 /* size of the second part of the stack */ + + + +/* +** search for 'objidx' in table at index -1. +** return 1 + string at top if find a good name. +*/ +static int findfield (lua_State *L, int objidx, int level) { + if (level == 0 || !lua_istable(L, -1)) + return 0; /* not found */ + lua_pushnil(L); /* start 'next' loop */ + while (lua_next(L, -2)) { /* for each pair in table */ + if (lua_type(L, -2) == LUA_TSTRING) { /* ignore non-string keys */ + if (lua_rawequal(L, objidx, -1)) { /* found object? */ + lua_pop(L, 1); /* remove value (but keep name) */ + return 1; + } + else if (findfield(L, objidx, level - 1)) { /* try recursively */ + lua_remove(L, -2); /* remove table (but keep name) */ + lua_pushliteral(L, "."); + lua_insert(L, -2); /* place '.' between the two names */ + lua_concat(L, 3); + return 1; + } + } + lua_pop(L, 1); /* remove value */ + } + return 0; /* not found */ +} + + +static int pushglobalfuncname (lua_State *L, lua_Debug *ar) { + int top = lua_gettop(L); + lua_getinfo(L, "f", ar); /* push function */ + lua_pushglobaltable(L); + if (findfield(L, top + 1, 2)) { + lua_copy(L, -1, top + 1); /* move name to proper place */ + lua_pop(L, 2); /* remove pushed values */ + return 1; + } + else { + lua_settop(L, top); /* remove function and global table */ + return 0; + } +} + + +static void pushfuncname (lua_State *L, lua_Debug *ar) { + if (*ar->namewhat != '\0') /* is there a name? */ + lua_pushfstring(L, "function " LUA_QS, ar->name); + else if (*ar->what == 'm') /* main? */ + lua_pushliteral(L, "main chunk"); + else if (*ar->what == 'C') { + if (pushglobalfuncname(L, ar)) { + lua_pushfstring(L, "function " LUA_QS, lua_tostring(L, -1)); + lua_remove(L, -2); /* remove name */ + } + else + lua_pushliteral(L, "?"); + } + else + lua_pushfstring(L, "function <%s:%d>", ar->short_src, ar->linedefined); +} + + +static int countlevels (lua_State *L) { + lua_Debug ar; + int li = 1, le = 1; + /* find an upper bound */ + while (lua_getstack(L, le, &ar)) { li = le; le *= 2; } + /* do a binary search */ + while (li < le) { + int m = (li + le)/2; + if (lua_getstack(L, m, &ar)) li = m + 1; + else le = m; + } + return le - 1; +} + + +LUALIB_API void luaL_traceback (lua_State *L, lua_State *L1, + const char *msg, int level) { + lua_Debug ar; + int top = lua_gettop(L); + int numlevels = countlevels(L1); + int mark = (numlevels > LEVELS1 + LEVELS2) ? LEVELS1 : 0; + if (msg) lua_pushfstring(L, "%s\n", msg); + lua_pushliteral(L, "stack traceback:"); + while (lua_getstack(L1, level++, &ar)) { + if (level == mark) { /* too many levels? */ + lua_pushliteral(L, "\n\t..."); /* add a '...' */ + level = numlevels - LEVELS2; /* and skip to last ones */ + } + else { + lua_getinfo(L1, "Slnt", &ar); + lua_pushfstring(L, "\n\t%s:", ar.short_src); + if (ar.currentline > 0) + lua_pushfstring(L, "%d:", ar.currentline); + lua_pushliteral(L, " in "); + pushfuncname(L, &ar); + if (ar.istailcall) + lua_pushliteral(L, "\n\t(...tail calls...)"); + lua_concat(L, lua_gettop(L) - top); + } + } + lua_concat(L, lua_gettop(L) - top); +} + +/* }====================================================== */ + + +/* +** {====================================================== +** Error-report functions +** ======================================================= +*/ + +LUALIB_API int luaL_argerror (lua_State *L, int narg, const char *extramsg) { + lua_Debug ar; + if (!lua_getstack(L, 0, &ar)) /* no stack frame? */ + return luaL_error(L, "bad argument #%d (%s)", narg, extramsg); + lua_getinfo(L, "n", &ar); + if (strcmp(ar.namewhat, "method") == 0) { + narg--; /* do not count `self' */ + if (narg == 0) /* error is in the self argument itself? */ + return luaL_error(L, "calling " LUA_QS " on bad self (%s)", + ar.name, extramsg); + } + if (ar.name == NULL) + ar.name = (pushglobalfuncname(L, &ar)) ? lua_tostring(L, -1) : "?"; + return luaL_error(L, "bad argument #%d to " LUA_QS " (%s)", + narg, ar.name, extramsg); +} + + +static int typeerror (lua_State *L, int narg, const char *tname) { + const char *msg = lua_pushfstring(L, "%s expected, got %s", + tname, luaL_typename(L, narg)); + return luaL_argerror(L, narg, msg); +} + + +static void tag_error (lua_State *L, int narg, int tag) { + typeerror(L, narg, lua_typename(L, tag)); +} + + +LUALIB_API void luaL_where (lua_State *L, int level) { + lua_Debug ar; + if (lua_getstack(L, level, &ar)) { /* check function at level */ + lua_getinfo(L, "Sl", &ar); /* get info about it */ + if (ar.currentline > 0) { /* is there info? */ + lua_pushfstring(L, "%s:%d: ", ar.short_src, ar.currentline); + return; + } + } + lua_pushliteral(L, ""); /* else, no information available... */ +} + + +LUALIB_API int luaL_error (lua_State *L, const char *fmt, ...) { + va_list argp; + va_start(argp, fmt); + luaL_where(L, 1); + lua_pushvfstring(L, fmt, argp); + va_end(argp); + lua_concat(L, 2); + return lua_error(L); +} + + +LUALIB_API int luaL_fileresult (lua_State *L, int stat, const char *fname) { + int en = errno; /* calls to Lua API may change this value */ + if (stat) { + lua_pushboolean(L, 1); + return 1; + } + else { + lua_pushnil(L); + if (fname) + lua_pushfstring(L, "%s: %s", fname, strerror(en)); + else + lua_pushstring(L, strerror(en)); + lua_pushinteger(L, en); + return 3; + } +} + + +#if !defined(inspectstat) /* { */ + +#if defined(LUA_USE_POSIX) + +#include + +/* +** use appropriate macros to interpret 'pclose' return status +*/ +#define inspectstat(stat,what) \ + if (WIFEXITED(stat)) { stat = WEXITSTATUS(stat); } \ + else if (WIFSIGNALED(stat)) { stat = WTERMSIG(stat); what = "signal"; } + +#else + +#define inspectstat(stat,what) /* no op */ + +#endif + +#endif /* } */ + + +LUALIB_API int luaL_execresult (lua_State *L, int stat) { + const char *what = "exit"; /* type of termination */ + if (stat == -1) /* error? */ + return luaL_fileresult(L, 0, NULL); + else { + inspectstat(stat, what); /* interpret result */ + if (*what == 'e' && stat == 0) /* successful termination? */ + lua_pushboolean(L, 1); + else + lua_pushnil(L); + lua_pushstring(L, what); + lua_pushinteger(L, stat); + return 3; /* return true/nil,what,code */ + } +} + +/* }====================================================== */ + + +/* +** {====================================================== +** Userdata's metatable manipulation +** ======================================================= +*/ + +LUALIB_API int luaL_newmetatable (lua_State *L, const char *tname) { + luaL_getmetatable(L, tname); /* try to get metatable */ + if (!lua_isnil(L, -1)) /* name already in use? */ + return 0; /* leave previous value on top, but return 0 */ + lua_pop(L, 1); + lua_newtable(L); /* create metatable */ + lua_pushvalue(L, -1); + lua_setfield(L, LUA_REGISTRYINDEX, tname); /* registry.name = metatable */ + return 1; +} + + +LUALIB_API void luaL_setmetatable (lua_State *L, const char *tname) { + luaL_getmetatable(L, tname); + lua_setmetatable(L, -2); +} + + +LUALIB_API void *luaL_testudata (lua_State *L, int ud, const char *tname) { + void *p = lua_touserdata(L, ud); + if (p != NULL) { /* value is a userdata? */ + if (lua_getmetatable(L, ud)) { /* does it have a metatable? */ + luaL_getmetatable(L, tname); /* get correct metatable */ + if (!lua_rawequal(L, -1, -2)) /* not the same? */ + p = NULL; /* value is a userdata with wrong metatable */ + lua_pop(L, 2); /* remove both metatables */ + return p; + } + } + return NULL; /* value is not a userdata with a metatable */ +} + + +LUALIB_API void *luaL_checkudata (lua_State *L, int ud, const char *tname) { + void *p = luaL_testudata(L, ud, tname); + if (p == NULL) typeerror(L, ud, tname); + return p; +} + +/* }====================================================== */ + + +/* +** {====================================================== +** Argument check functions +** ======================================================= +*/ + +LUALIB_API int luaL_checkoption (lua_State *L, int narg, const char *def, + const char *const lst[]) { + const char *name = (def) ? luaL_optstring(L, narg, def) : + luaL_checkstring(L, narg); + int i; + for (i=0; lst[i]; i++) + if (strcmp(lst[i], name) == 0) + return i; + return luaL_argerror(L, narg, + lua_pushfstring(L, "invalid option " LUA_QS, name)); +} + + +LUALIB_API void luaL_checkstack (lua_State *L, int space, const char *msg) { + /* keep some extra space to run error routines, if needed */ + const int extra = LUA_MINSTACK; + if (!lua_checkstack(L, space + extra)) { + if (msg) + luaL_error(L, "stack overflow (%s)", msg); + else + luaL_error(L, "stack overflow"); + } +} + + +LUALIB_API void luaL_checktype (lua_State *L, int narg, int t) { + if (lua_type(L, narg) != t) + tag_error(L, narg, t); +} + + +LUALIB_API void luaL_checkany (lua_State *L, int narg) { + if (lua_type(L, narg) == LUA_TNONE) + luaL_argerror(L, narg, "value expected"); +} + + +LUALIB_API const char *luaL_checklstring (lua_State *L, int narg, size_t *len) { + const char *s = lua_tolstring(L, narg, len); + if (!s) tag_error(L, narg, LUA_TSTRING); + return s; +} + + +LUALIB_API const char *luaL_optlstring (lua_State *L, int narg, + const char *def, size_t *len) { + if (lua_isnoneornil(L, narg)) { + if (len) + *len = (def ? strlen(def) : 0); + return def; + } + else return luaL_checklstring(L, narg, len); +} + + +LUALIB_API lua_Number luaL_checknumber (lua_State *L, int narg) { + int isnum; + lua_Number d = lua_tonumberx(L, narg, &isnum); + if (!isnum) + tag_error(L, narg, LUA_TNUMBER); + return d; +} + + +LUALIB_API lua_Number luaL_optnumber (lua_State *L, int narg, lua_Number def) { + return luaL_opt(L, luaL_checknumber, narg, def); +} + + +LUALIB_API lua_Integer luaL_checkinteger (lua_State *L, int narg) { + int isnum; + lua_Integer d = lua_tointegerx(L, narg, &isnum); + if (!isnum) + tag_error(L, narg, LUA_TNUMBER); + return d; +} + + +LUALIB_API lua_Unsigned luaL_checkunsigned (lua_State *L, int narg) { + int isnum; + lua_Unsigned d = lua_tounsignedx(L, narg, &isnum); + if (!isnum) + tag_error(L, narg, LUA_TNUMBER); + return d; +} + + +LUALIB_API lua_Integer luaL_optinteger (lua_State *L, int narg, + lua_Integer def) { + return luaL_opt(L, luaL_checkinteger, narg, def); +} + + +LUALIB_API lua_Unsigned luaL_optunsigned (lua_State *L, int narg, + lua_Unsigned def) { + return luaL_opt(L, luaL_checkunsigned, narg, def); +} + +/* }====================================================== */ + + +/* +** {====================================================== +** Generic Buffer manipulation +** ======================================================= +*/ + +/* +** check whether buffer is using a userdata on the stack as a temporary +** buffer +*/ +#define buffonstack(B) ((B)->b != (B)->initb) + + +/* +** returns a pointer to a free area with at least 'sz' bytes +*/ +LUALIB_API char *luaL_prepbuffsize (luaL_Buffer *B, size_t sz) { + lua_State *L = B->L; + if (B->size - B->n < sz) { /* not enough space? */ + char *newbuff; + size_t newsize = B->size * 2; /* double buffer size */ + if (newsize - B->n < sz) /* not big enough? */ + newsize = B->n + sz; + if (newsize < B->n || newsize - B->n < sz) + luaL_error(L, "buffer too large"); + /* create larger buffer */ + newbuff = (char *)lua_newuserdata(L, newsize * sizeof(char)); + /* move content to new buffer */ + memcpy(newbuff, B->b, B->n * sizeof(char)); + if (buffonstack(B)) + lua_remove(L, -2); /* remove old buffer */ + B->b = newbuff; + B->size = newsize; + } + return &B->b[B->n]; +} + + +LUALIB_API void luaL_addlstring (luaL_Buffer *B, const char *s, size_t l) { + char *b = luaL_prepbuffsize(B, l); + memcpy(b, s, l * sizeof(char)); + luaL_addsize(B, l); +} + + +LUALIB_API void luaL_addstring (luaL_Buffer *B, const char *s) { + luaL_addlstring(B, s, strlen(s)); +} + + +LUALIB_API void luaL_pushresult (luaL_Buffer *B) { + lua_State *L = B->L; + lua_pushlstring(L, B->b, B->n); + if (buffonstack(B)) + lua_remove(L, -2); /* remove old buffer */ +} + + +LUALIB_API void luaL_pushresultsize (luaL_Buffer *B, size_t sz) { + luaL_addsize(B, sz); + luaL_pushresult(B); +} + + +LUALIB_API void luaL_addvalue (luaL_Buffer *B) { + lua_State *L = B->L; + size_t l; + const char *s = lua_tolstring(L, -1, &l); + if (buffonstack(B)) + lua_insert(L, -2); /* put value below buffer */ + luaL_addlstring(B, s, l); + lua_remove(L, (buffonstack(B)) ? -2 : -1); /* remove value */ +} + + +LUALIB_API void luaL_buffinit (lua_State *L, luaL_Buffer *B) { + B->L = L; + B->b = B->initb; + B->n = 0; + B->size = LUAL_BUFFERSIZE; +} + + +LUALIB_API char *luaL_buffinitsize (lua_State *L, luaL_Buffer *B, size_t sz) { + luaL_buffinit(L, B); + return luaL_prepbuffsize(B, sz); +} + +/* }====================================================== */ + + +/* +** {====================================================== +** Reference system +** ======================================================= +*/ + +/* index of free-list header */ +#define freelist 0 + + +LUALIB_API int luaL_ref (lua_State *L, int t) { + int ref; + if (lua_isnil(L, -1)) { + lua_pop(L, 1); /* remove from stack */ + return LUA_REFNIL; /* `nil' has a unique fixed reference */ + } + t = lua_absindex(L, t); + lua_rawgeti(L, t, freelist); /* get first free element */ + ref = (int)lua_tointeger(L, -1); /* ref = t[freelist] */ + lua_pop(L, 1); /* remove it from stack */ + if (ref != 0) { /* any free element? */ + lua_rawgeti(L, t, ref); /* remove it from list */ + lua_rawseti(L, t, freelist); /* (t[freelist] = t[ref]) */ + } + else /* no free elements */ + ref = (int)lua_rawlen(L, t) + 1; /* get a new reference */ + lua_rawseti(L, t, ref); + return ref; +} + + +LUALIB_API void luaL_unref (lua_State *L, int t, int ref) { + if (ref >= 0) { + t = lua_absindex(L, t); + lua_rawgeti(L, t, freelist); + lua_rawseti(L, t, ref); /* t[ref] = t[freelist] */ + lua_pushinteger(L, ref); + lua_rawseti(L, t, freelist); /* t[freelist] = ref */ + } +} + +/* }====================================================== */ + + +/* +** {====================================================== +** Load functions +** ======================================================= +*/ + +typedef struct LoadF { + int n; /* number of pre-read characters */ + FILE *f; /* file being read */ + char buff[LUAL_BUFFERSIZE]; /* area for reading file */ +} LoadF; + + +static const char *getF (lua_State *L, void *ud, size_t *size) { + LoadF *lf = (LoadF *)ud; + (void)L; /* not used */ + if (lf->n > 0) { /* are there pre-read characters to be read? */ + *size = lf->n; /* return them (chars already in buffer) */ + lf->n = 0; /* no more pre-read characters */ + } + else { /* read a block from file */ + /* 'fread' can return > 0 *and* set the EOF flag. If next call to + 'getF' called 'fread', it might still wait for user input. + The next check avoids this problem. */ + if (feof(lf->f)) return NULL; + *size = fread(lf->buff, 1, sizeof(lf->buff), lf->f); /* read block */ + } + return lf->buff; +} + + +static int errfile (lua_State *L, const char *what, int fnameindex) { + const char *serr = strerror(errno); + const char *filename = lua_tostring(L, fnameindex) + 1; + lua_pushfstring(L, "cannot %s %s: %s", what, filename, serr); + lua_remove(L, fnameindex); + return LUA_ERRFILE; +} + + +static int skipBOM (LoadF *lf) { + const char *p = "\xEF\xBB\xBF"; /* Utf8 BOM mark */ + int c; + lf->n = 0; + do { + c = getc(lf->f); + if (c == EOF || c != *(const unsigned char *)p++) return c; + lf->buff[lf->n++] = c; /* to be read by the parser */ + } while (*p != '\0'); + lf->n = 0; /* prefix matched; discard it */ + return getc(lf->f); /* return next character */ +} + + +/* +** reads the first character of file 'f' and skips an optional BOM mark +** in its beginning plus its first line if it starts with '#'. Returns +** true if it skipped the first line. In any case, '*cp' has the +** first "valid" character of the file (after the optional BOM and +** a first-line comment). +*/ +static int skipcomment (LoadF *lf, int *cp) { + int c = *cp = skipBOM(lf); + if (c == '#') { /* first line is a comment (Unix exec. file)? */ + do { /* skip first line */ + c = getc(lf->f); + } while (c != EOF && c != '\n') ; + *cp = getc(lf->f); /* skip end-of-line, if present */ + return 1; /* there was a comment */ + } + else return 0; /* no comment */ +} + + +LUALIB_API int luaL_loadfilex (lua_State *L, const char *filename, + const char *mode) { + LoadF lf; + int status, readstatus; + int c; + int fnameindex = lua_gettop(L) + 1; /* index of filename on the stack */ + if (filename == NULL) { + lua_pushliteral(L, "=stdin"); + lf.f = stdin; + } + else { + lua_pushfstring(L, "@%s", filename); + lf.f = fopen(filename, "r"); + if (lf.f == NULL) return errfile(L, "open", fnameindex); + } + if (skipcomment(&lf, &c)) /* read initial portion */ + lf.buff[lf.n++] = '\n'; /* add line to correct line numbers */ + if (c == LUA_SIGNATURE[0] && filename) { /* binary file? */ + lf.f = freopen(filename, "rb", lf.f); /* reopen in binary mode */ + if (lf.f == NULL) return errfile(L, "reopen", fnameindex); + skipcomment(&lf, &c); /* re-read initial portion */ + } + if (c != EOF) + lf.buff[lf.n++] = c; /* 'c' is the first character of the stream */ + status = lua_load(L, getF, &lf, lua_tostring(L, -1), mode); + readstatus = ferror(lf.f); + if (filename) fclose(lf.f); /* close file (even in case of errors) */ + if (readstatus) { + lua_settop(L, fnameindex); /* ignore results from `lua_load' */ + return errfile(L, "read", fnameindex); + } + lua_remove(L, fnameindex); + return status; +} + + +typedef struct LoadS { + const char *s; + size_t size; +} LoadS; + + +static const char *getS (lua_State *L, void *ud, size_t *size) { + LoadS *ls = (LoadS *)ud; + (void)L; /* not used */ + if (ls->size == 0) return NULL; + *size = ls->size; + ls->size = 0; + return ls->s; +} + + +LUALIB_API int luaL_loadbufferx (lua_State *L, const char *buff, size_t size, + const char *name, const char *mode) { + LoadS ls; + ls.s = buff; + ls.size = size; + return lua_load(L, getS, &ls, name, mode); +} + + +LUALIB_API int luaL_loadstring (lua_State *L, const char *s) { + return luaL_loadbuffer(L, s, strlen(s), s); +} + +/* }====================================================== */ + + + +LUALIB_API int luaL_getmetafield (lua_State *L, int obj, const char *event) { + if (!lua_getmetatable(L, obj)) /* no metatable? */ + return 0; + lua_pushstring(L, event); + lua_rawget(L, -2); + if (lua_isnil(L, -1)) { + lua_pop(L, 2); /* remove metatable and metafield */ + return 0; + } + else { + lua_remove(L, -2); /* remove only metatable */ + return 1; + } +} + + +LUALIB_API int luaL_callmeta (lua_State *L, int obj, const char *event) { + obj = lua_absindex(L, obj); + if (!luaL_getmetafield(L, obj, event)) /* no metafield? */ + return 0; + lua_pushvalue(L, obj); + lua_call(L, 1, 1); + return 1; +} + + +LUALIB_API int luaL_len (lua_State *L, int idx) { + int l; + int isnum; + lua_len(L, idx); + l = (int)lua_tointegerx(L, -1, &isnum); + if (!isnum) + luaL_error(L, "object length is not a number"); + lua_pop(L, 1); /* remove object */ + return l; +} + + +LUALIB_API const char *luaL_tolstring (lua_State *L, int idx, size_t *len) { + if (!luaL_callmeta(L, idx, "__tostring")) { /* no metafield? */ + switch (lua_type(L, idx)) { + case LUA_TNUMBER: + case LUA_TSTRING: + lua_pushvalue(L, idx); + break; + case LUA_TBOOLEAN: + lua_pushstring(L, (lua_toboolean(L, idx) ? "true" : "false")); + break; + case LUA_TNIL: + lua_pushliteral(L, "nil"); + break; + default: + lua_pushfstring(L, "%s: %p", luaL_typename(L, idx), + lua_topointer(L, idx)); + break; + } + } + return lua_tolstring(L, -1, len); +} + + +/* +** {====================================================== +** Compatibility with 5.1 module functions +** ======================================================= +*/ +#if defined(LUA_COMPAT_MODULE) + +static const char *luaL_findtable (lua_State *L, int idx, + const char *fname, int szhint) { + const char *e; + if (idx) lua_pushvalue(L, idx); + do { + e = strchr(fname, '.'); + if (e == NULL) e = fname + strlen(fname); + lua_pushlstring(L, fname, e - fname); + lua_rawget(L, -2); + if (lua_isnil(L, -1)) { /* no such field? */ + lua_pop(L, 1); /* remove this nil */ + lua_createtable(L, 0, (*e == '.' ? 1 : szhint)); /* new table for field */ + lua_pushlstring(L, fname, e - fname); + lua_pushvalue(L, -2); + lua_settable(L, -4); /* set new table into field */ + } + else if (!lua_istable(L, -1)) { /* field has a non-table value? */ + lua_pop(L, 2); /* remove table and value */ + return fname; /* return problematic part of the name */ + } + lua_remove(L, -2); /* remove previous table */ + fname = e + 1; + } while (*e == '.'); + return NULL; +} + + +/* +** Count number of elements in a luaL_Reg list. +*/ +static int libsize (const luaL_Reg *l) { + int size = 0; + for (; l && l->name; l++) size++; + return size; +} + + +/* +** Find or create a module table with a given name. The function +** first looks at the _LOADED table and, if that fails, try a +** global variable with that name. In any case, leaves on the stack +** the module table. +*/ +LUALIB_API void luaL_pushmodule (lua_State *L, const char *modname, + int sizehint) { + luaL_findtable(L, LUA_REGISTRYINDEX, "_LOADED", 1); /* get _LOADED table */ + lua_getfield(L, -1, modname); /* get _LOADED[modname] */ + if (!lua_istable(L, -1)) { /* not found? */ + lua_pop(L, 1); /* remove previous result */ + /* try global variable (and create one if it does not exist) */ + lua_pushglobaltable(L); + if (luaL_findtable(L, 0, modname, sizehint) != NULL) + luaL_error(L, "name conflict for module " LUA_QS, modname); + lua_pushvalue(L, -1); + lua_setfield(L, -3, modname); /* _LOADED[modname] = new table */ + } + lua_remove(L, -2); /* remove _LOADED table */ +} + + +LUALIB_API void luaL_openlib (lua_State *L, const char *libname, + const luaL_Reg *l, int nup) { + luaL_checkversion(L); + if (libname) { + luaL_pushmodule(L, libname, libsize(l)); /* get/create library table */ + lua_insert(L, -(nup + 1)); /* move library table to below upvalues */ + } + if (l) + luaL_setfuncs(L, l, nup); + else + lua_pop(L, nup); /* remove upvalues */ +} + +#endif +/* }====================================================== */ + +/* +** set functions from list 'l' into table at top - 'nup'; each +** function gets the 'nup' elements at the top as upvalues. +** Returns with only the table at the stack. +*/ +LUALIB_API void luaL_setfuncs (lua_State *L, const luaL_Reg *l, int nup) { + luaL_checkversion(L); + luaL_checkstack(L, nup, "too many upvalues"); + for (; l->name != NULL; l++) { /* fill the table with given functions */ + int i; + for (i = 0; i < nup; i++) /* copy upvalues to the top */ + lua_pushvalue(L, -nup); + lua_pushcclosure(L, l->func, nup); /* closure with those upvalues */ + lua_setfield(L, -(nup + 2), l->name); + } + lua_pop(L, nup); /* remove upvalues */ +} + + +/* +** ensure that stack[idx][fname] has a table and push that table +** into the stack +*/ +LUALIB_API int luaL_getsubtable (lua_State *L, int idx, const char *fname) { + lua_getfield(L, idx, fname); + if (lua_istable(L, -1)) return 1; /* table already there */ + else { + lua_pop(L, 1); /* remove previous result */ + idx = lua_absindex(L, idx); + lua_newtable(L); + lua_pushvalue(L, -1); /* copy to be left at top */ + lua_setfield(L, idx, fname); /* assign new table to field */ + return 0; /* false, because did not find table there */ + } +} + + +/* +** stripped-down 'require'. Calls 'openf' to open a module, +** registers the result in 'package.loaded' table and, if 'glb' +** is true, also registers the result in the global table. +** Leaves resulting module on the top. +*/ +LUALIB_API void luaL_requiref (lua_State *L, const char *modname, + lua_CFunction openf, int glb) { + lua_pushcfunction(L, openf); + lua_pushstring(L, modname); /* argument to open function */ + lua_call(L, 1, 1); /* open module */ + luaL_getsubtable(L, LUA_REGISTRYINDEX, "_LOADED"); + lua_pushvalue(L, -2); /* make copy of module (call result) */ + lua_setfield(L, -2, modname); /* _LOADED[modname] = module */ + lua_pop(L, 1); /* remove _LOADED table */ + if (glb) { + lua_pushvalue(L, -1); /* copy of 'mod' */ + lua_setglobal(L, modname); /* _G[modname] = module */ + } +} + + +LUALIB_API const char *luaL_gsub (lua_State *L, const char *s, const char *p, + const char *r) { + const char *wild; + size_t l = strlen(p); + luaL_Buffer b; + luaL_buffinit(L, &b); + while ((wild = strstr(s, p)) != NULL) { + luaL_addlstring(&b, s, wild - s); /* push prefix */ + luaL_addstring(&b, r); /* push replacement in place of pattern */ + s = wild + l; /* continue after `p' */ + } + luaL_addstring(&b, s); /* push last suffix */ + luaL_pushresult(&b); + return lua_tostring(L, -1); +} + + +static void *l_alloc (void *ud, void *ptr, size_t osize, size_t nsize) { + (void)ud; (void)osize; /* not used */ + if (nsize == 0) { + free(ptr); + return NULL; + } + else + return realloc(ptr, nsize); +} + + +static int panic (lua_State *L) { + luai_writestringerror("PANIC: unprotected error in call to Lua API (%s)\n", + lua_tostring(L, -1)); + return 0; /* return to Lua to abort */ +} + + +LUALIB_API lua_State *luaL_newstate (void) { + lua_State *L = lua_newstate(l_alloc, NULL); + if (L) lua_atpanic(L, &panic); + return L; +} + + +LUALIB_API void luaL_checkversion_ (lua_State *L, lua_Number ver) { + const lua_Number *v = lua_version(L); + if (v != lua_version(NULL)) + luaL_error(L, "multiple Lua VMs detected"); + else if (*v != ver) + luaL_error(L, "version mismatch: app. needs %f, Lua core provides %f", + ver, *v); + /* check conversions number -> integer types */ + lua_pushnumber(L, -(lua_Number)0x1234); + if (lua_tointeger(L, -1) != -0x1234 || + lua_tounsigned(L, -1) != (lua_Unsigned)-0x1234) + luaL_error(L, "bad conversion number->int;" + " must recompile Lua with proper settings"); + lua_pop(L, 1); +} + diff --git a/liblua/lauxlib.h b/liblua/lauxlib.h new file mode 100644 index 00000000..ac4d15fb --- /dev/null +++ b/liblua/lauxlib.h @@ -0,0 +1,212 @@ +/* +** $Id: lauxlib.h,v 1.120 2011/11/29 15:55:08 roberto Exp $ +** Auxiliary functions for building Lua libraries +** See Copyright Notice in lua.h +*/ + + +#ifndef lauxlib_h +#define lauxlib_h + + +#include +#include + +#include "lua.h" + + + +/* extra error code for `luaL_load' */ +#define LUA_ERRFILE (LUA_ERRERR+1) + + +typedef struct luaL_Reg { + const char *name; + lua_CFunction func; +} luaL_Reg; + + +LUALIB_API void (luaL_checkversion_) (lua_State *L, lua_Number ver); +#define luaL_checkversion(L) luaL_checkversion_(L, LUA_VERSION_NUM) + +LUALIB_API int (luaL_getmetafield) (lua_State *L, int obj, const char *e); +LUALIB_API int (luaL_callmeta) (lua_State *L, int obj, const char *e); +LUALIB_API const char *(luaL_tolstring) (lua_State *L, int idx, size_t *len); +LUALIB_API int (luaL_argerror) (lua_State *L, int numarg, const char *extramsg); +LUALIB_API const char *(luaL_checklstring) (lua_State *L, int numArg, + size_t *l); +LUALIB_API const char *(luaL_optlstring) (lua_State *L, int numArg, + const char *def, size_t *l); +LUALIB_API lua_Number (luaL_checknumber) (lua_State *L, int numArg); +LUALIB_API lua_Number (luaL_optnumber) (lua_State *L, int nArg, lua_Number def); + +LUALIB_API lua_Integer (luaL_checkinteger) (lua_State *L, int numArg); +LUALIB_API lua_Integer (luaL_optinteger) (lua_State *L, int nArg, + lua_Integer def); +LUALIB_API lua_Unsigned (luaL_checkunsigned) (lua_State *L, int numArg); +LUALIB_API lua_Unsigned (luaL_optunsigned) (lua_State *L, int numArg, + lua_Unsigned def); + +LUALIB_API void (luaL_checkstack) (lua_State *L, int sz, const char *msg); +LUALIB_API void (luaL_checktype) (lua_State *L, int narg, int t); +LUALIB_API void (luaL_checkany) (lua_State *L, int narg); + +LUALIB_API int (luaL_newmetatable) (lua_State *L, const char *tname); +LUALIB_API void (luaL_setmetatable) (lua_State *L, const char *tname); +LUALIB_API void *(luaL_testudata) (lua_State *L, int ud, const char *tname); +LUALIB_API void *(luaL_checkudata) (lua_State *L, int ud, const char *tname); + +LUALIB_API void (luaL_where) (lua_State *L, int lvl); +LUALIB_API int (luaL_error) (lua_State *L, const char *fmt, ...); + +LUALIB_API int (luaL_checkoption) (lua_State *L, int narg, const char *def, + const char *const lst[]); + +LUALIB_API int (luaL_fileresult) (lua_State *L, int stat, const char *fname); +LUALIB_API int (luaL_execresult) (lua_State *L, int stat); + +/* pre-defined references */ +#define LUA_NOREF (-2) +#define LUA_REFNIL (-1) + +LUALIB_API int (luaL_ref) (lua_State *L, int t); +LUALIB_API void (luaL_unref) (lua_State *L, int t, int ref); + +LUALIB_API int (luaL_loadfilex) (lua_State *L, const char *filename, + const char *mode); + +#define luaL_loadfile(L,f) luaL_loadfilex(L,f,NULL) + +LUALIB_API int (luaL_loadbufferx) (lua_State *L, const char *buff, size_t sz, + const char *name, const char *mode); +LUALIB_API int (luaL_loadstring) (lua_State *L, const char *s); + +LUALIB_API lua_State *(luaL_newstate) (void); + +LUALIB_API int (luaL_len) (lua_State *L, int idx); + +LUALIB_API const char *(luaL_gsub) (lua_State *L, const char *s, const char *p, + const char *r); + +LUALIB_API void (luaL_setfuncs) (lua_State *L, const luaL_Reg *l, int nup); + +LUALIB_API int (luaL_getsubtable) (lua_State *L, int idx, const char *fname); + +LUALIB_API void (luaL_traceback) (lua_State *L, lua_State *L1, + const char *msg, int level); + +LUALIB_API void (luaL_requiref) (lua_State *L, const char *modname, + lua_CFunction openf, int glb); + +/* +** =============================================================== +** some useful macros +** =============================================================== +*/ + + +#define luaL_newlibtable(L,l) \ + lua_createtable(L, 0, sizeof(l)/sizeof((l)[0]) - 1) + +#define luaL_newlib(L,l) (luaL_newlibtable(L,l), luaL_setfuncs(L,l,0)) + +#define luaL_argcheck(L, cond,numarg,extramsg) \ + ((void)((cond) || luaL_argerror(L, (numarg), (extramsg)))) +#define luaL_checkstring(L,n) (luaL_checklstring(L, (n), NULL)) +#define luaL_optstring(L,n,d) (luaL_optlstring(L, (n), (d), NULL)) +#define luaL_checkint(L,n) ((int)luaL_checkinteger(L, (n))) +#define luaL_optint(L,n,d) ((int)luaL_optinteger(L, (n), (d))) +#define luaL_checklong(L,n) ((long)luaL_checkinteger(L, (n))) +#define luaL_optlong(L,n,d) ((long)luaL_optinteger(L, (n), (d))) + +#define luaL_typename(L,i) lua_typename(L, lua_type(L,(i))) + +#define luaL_dofile(L, fn) \ + (luaL_loadfile(L, fn) || lua_pcall(L, 0, LUA_MULTRET, 0)) + +#define luaL_dostring(L, s) \ + (luaL_loadstring(L, s) || lua_pcall(L, 0, LUA_MULTRET, 0)) + +#define luaL_getmetatable(L,n) (lua_getfield(L, LUA_REGISTRYINDEX, (n))) + +#define luaL_opt(L,f,n,d) (lua_isnoneornil(L,(n)) ? (d) : f(L,(n))) + +#define luaL_loadbuffer(L,s,sz,n) luaL_loadbufferx(L,s,sz,n,NULL) + + +/* +** {====================================================== +** Generic Buffer manipulation +** ======================================================= +*/ + +typedef struct luaL_Buffer { + char *b; /* buffer address */ + size_t size; /* buffer size */ + size_t n; /* number of characters in buffer */ + lua_State *L; + char initb[LUAL_BUFFERSIZE]; /* initial buffer */ +} luaL_Buffer; + + +#define luaL_addchar(B,c) \ + ((void)((B)->n < (B)->size || luaL_prepbuffsize((B), 1)), \ + ((B)->b[(B)->n++] = (c))) + +#define luaL_addsize(B,s) ((B)->n += (s)) + +LUALIB_API void (luaL_buffinit) (lua_State *L, luaL_Buffer *B); +LUALIB_API char *(luaL_prepbuffsize) (luaL_Buffer *B, size_t sz); +LUALIB_API void (luaL_addlstring) (luaL_Buffer *B, const char *s, size_t l); +LUALIB_API void (luaL_addstring) (luaL_Buffer *B, const char *s); +LUALIB_API void (luaL_addvalue) (luaL_Buffer *B); +LUALIB_API void (luaL_pushresult) (luaL_Buffer *B); +LUALIB_API void (luaL_pushresultsize) (luaL_Buffer *B, size_t sz); +LUALIB_API char *(luaL_buffinitsize) (lua_State *L, luaL_Buffer *B, size_t sz); + +#define luaL_prepbuffer(B) luaL_prepbuffsize(B, LUAL_BUFFERSIZE) + +/* }====================================================== */ + + + +/* +** {====================================================== +** File handles for IO library +** ======================================================= +*/ + +/* +** A file handle is a userdata with metatable 'LUA_FILEHANDLE' and +** initial structure 'luaL_Stream' (it may contain other fields +** after that initial structure). +*/ + +#define LUA_FILEHANDLE "FILE*" + + +typedef struct luaL_Stream { + FILE *f; /* stream (NULL for incompletely created streams) */ + lua_CFunction closef; /* to close stream (NULL for closed streams) */ +} luaL_Stream; + +/* }====================================================== */ + + + +/* compatibility with old module system */ +#if defined(LUA_COMPAT_MODULE) + +LUALIB_API void (luaL_pushmodule) (lua_State *L, const char *modname, + int sizehint); +LUALIB_API void (luaL_openlib) (lua_State *L, const char *libname, + const luaL_Reg *l, int nup); + +#define luaL_register(L,n,l) (luaL_openlib(L,(n),(l),0)) + +#endif + + +#endif + + diff --git a/liblua/lbaselib.c b/liblua/lbaselib.c new file mode 100644 index 00000000..540e9a5c --- /dev/null +++ b/liblua/lbaselib.c @@ -0,0 +1,458 @@ +/* +** $Id: lbaselib.c,v 1.276 2013/02/21 13:44:53 roberto Exp $ +** Basic library +** See Copyright Notice in lua.h +*/ + + + +#include +#include +#include +#include + +#define lbaselib_c +#define LUA_LIB + +#include "lua.h" + +#include "lauxlib.h" +#include "lualib.h" + + +static int luaB_print (lua_State *L) { + int n = lua_gettop(L); /* number of arguments */ + int i; + lua_getglobal(L, "tostring"); + for (i=1; i<=n; i++) { + const char *s; + size_t l; + lua_pushvalue(L, -1); /* function to be called */ + lua_pushvalue(L, i); /* value to print */ + lua_call(L, 1, 1); + s = lua_tolstring(L, -1, &l); /* get result */ + if (s == NULL) + return luaL_error(L, + LUA_QL("tostring") " must return a string to " LUA_QL("print")); + if (i>1) luai_writestring("\t", 1); + luai_writestring(s, l); + lua_pop(L, 1); /* pop result */ + } + luai_writeline(); + return 0; +} + + +#define SPACECHARS " \f\n\r\t\v" + +static int luaB_tonumber (lua_State *L) { + if (lua_isnoneornil(L, 2)) { /* standard conversion */ + int isnum; + lua_Number n = lua_tonumberx(L, 1, &isnum); + if (isnum) { + lua_pushnumber(L, n); + return 1; + } /* else not a number; must be something */ + luaL_checkany(L, 1); + } + else { + size_t l; + const char *s = luaL_checklstring(L, 1, &l); + const char *e = s + l; /* end point for 's' */ + int base = luaL_checkint(L, 2); + int neg = 0; + luaL_argcheck(L, 2 <= base && base <= 36, 2, "base out of range"); + s += strspn(s, SPACECHARS); /* skip initial spaces */ + if (*s == '-') { s++; neg = 1; } /* handle signal */ + else if (*s == '+') s++; + if (isalnum((unsigned char)*s)) { + lua_Number n = 0; + do { + int digit = (isdigit((unsigned char)*s)) ? *s - '0' + : toupper((unsigned char)*s) - 'A' + 10; + if (digit >= base) break; /* invalid numeral; force a fail */ + n = n * (lua_Number)base + (lua_Number)digit; + s++; + } while (isalnum((unsigned char)*s)); + s += strspn(s, SPACECHARS); /* skip trailing spaces */ + if (s == e) { /* no invalid trailing characters? */ + lua_pushnumber(L, (neg) ? -n : n); + return 1; + } /* else not a number */ + } /* else not a number */ + } + lua_pushnil(L); /* not a number */ + return 1; +} + + +static int luaB_error (lua_State *L) { + int level = luaL_optint(L, 2, 1); + lua_settop(L, 1); + if (lua_isstring(L, 1) && level > 0) { /* add extra information? */ + luaL_where(L, level); + lua_pushvalue(L, 1); + lua_concat(L, 2); + } + return lua_error(L); +} + + +static int luaB_getmetatable (lua_State *L) { + luaL_checkany(L, 1); + if (!lua_getmetatable(L, 1)) { + lua_pushnil(L); + return 1; /* no metatable */ + } + luaL_getmetafield(L, 1, "__metatable"); + return 1; /* returns either __metatable field (if present) or metatable */ +} + + +static int luaB_setmetatable (lua_State *L) { + int t = lua_type(L, 2); + luaL_checktype(L, 1, LUA_TTABLE); + luaL_argcheck(L, t == LUA_TNIL || t == LUA_TTABLE, 2, + "nil or table expected"); + if (luaL_getmetafield(L, 1, "__metatable")) + return luaL_error(L, "cannot change a protected metatable"); + lua_settop(L, 2); + lua_setmetatable(L, 1); + return 1; +} + + +static int luaB_rawequal (lua_State *L) { + luaL_checkany(L, 1); + luaL_checkany(L, 2); + lua_pushboolean(L, lua_rawequal(L, 1, 2)); + return 1; +} + + +static int luaB_rawlen (lua_State *L) { + int t = lua_type(L, 1); + luaL_argcheck(L, t == LUA_TTABLE || t == LUA_TSTRING, 1, + "table or string expected"); + lua_pushinteger(L, lua_rawlen(L, 1)); + return 1; +} + + +static int luaB_rawget (lua_State *L) { + luaL_checktype(L, 1, LUA_TTABLE); + luaL_checkany(L, 2); + lua_settop(L, 2); + lua_rawget(L, 1); + return 1; +} + +static int luaB_rawset (lua_State *L) { + luaL_checktype(L, 1, LUA_TTABLE); + luaL_checkany(L, 2); + luaL_checkany(L, 3); + lua_settop(L, 3); + lua_rawset(L, 1); + return 1; +} + + +static int luaB_collectgarbage (lua_State *L) { + static const char *const opts[] = {"stop", "restart", "collect", + "count", "step", "setpause", "setstepmul", + "setmajorinc", "isrunning", "generational", "incremental", NULL}; + static const int optsnum[] = {LUA_GCSTOP, LUA_GCRESTART, LUA_GCCOLLECT, + LUA_GCCOUNT, LUA_GCSTEP, LUA_GCSETPAUSE, LUA_GCSETSTEPMUL, + LUA_GCSETMAJORINC, LUA_GCISRUNNING, LUA_GCGEN, LUA_GCINC}; + int o = optsnum[luaL_checkoption(L, 1, "collect", opts)]; + int ex = luaL_optint(L, 2, 0); + int res = lua_gc(L, o, ex); + switch (o) { + case LUA_GCCOUNT: { + int b = lua_gc(L, LUA_GCCOUNTB, 0); + lua_pushnumber(L, res + ((lua_Number)b/1024)); + lua_pushinteger(L, b); + return 2; + } + case LUA_GCSTEP: case LUA_GCISRUNNING: { + lua_pushboolean(L, res); + return 1; + } + default: { + lua_pushinteger(L, res); + return 1; + } + } +} + + +static int luaB_type (lua_State *L) { + luaL_checkany(L, 1); + lua_pushstring(L, luaL_typename(L, 1)); + return 1; +} + + +static int pairsmeta (lua_State *L, const char *method, int iszero, + lua_CFunction iter) { + if (!luaL_getmetafield(L, 1, method)) { /* no metamethod? */ + luaL_checktype(L, 1, LUA_TTABLE); /* argument must be a table */ + lua_pushcfunction(L, iter); /* will return generator, */ + lua_pushvalue(L, 1); /* state, */ + if (iszero) lua_pushinteger(L, 0); /* and initial value */ + else lua_pushnil(L); + } + else { + lua_pushvalue(L, 1); /* argument 'self' to metamethod */ + lua_call(L, 1, 3); /* get 3 values from metamethod */ + } + return 3; +} + + +static int luaB_next (lua_State *L) { + luaL_checktype(L, 1, LUA_TTABLE); + lua_settop(L, 2); /* create a 2nd argument if there isn't one */ + if (lua_next(L, 1)) + return 2; + else { + lua_pushnil(L); + return 1; + } +} + + +static int luaB_pairs (lua_State *L) { + return pairsmeta(L, "__pairs", 0, luaB_next); +} + + +static int ipairsaux (lua_State *L) { + int i = luaL_checkint(L, 2); + luaL_checktype(L, 1, LUA_TTABLE); + i++; /* next value */ + lua_pushinteger(L, i); + lua_rawgeti(L, 1, i); + return (lua_isnil(L, -1)) ? 1 : 2; +} + + +static int luaB_ipairs (lua_State *L) { + return pairsmeta(L, "__ipairs", 1, ipairsaux); +} + + +static int load_aux (lua_State *L, int status, int envidx) { + if (status == LUA_OK) { + if (envidx != 0) { /* 'env' parameter? */ + lua_pushvalue(L, envidx); /* environment for loaded function */ + if (!lua_setupvalue(L, -2, 1)) /* set it as 1st upvalue */ + lua_pop(L, 1); /* remove 'env' if not used by previous call */ + } + return 1; + } + else { /* error (message is on top of the stack) */ + lua_pushnil(L); + lua_insert(L, -2); /* put before error message */ + return 2; /* return nil plus error message */ + } +} + + +static int luaB_loadfile (lua_State *L) { + const char *fname = luaL_optstring(L, 1, NULL); + const char *mode = luaL_optstring(L, 2, NULL); + int env = (!lua_isnone(L, 3) ? 3 : 0); /* 'env' index or 0 if no 'env' */ + int status = luaL_loadfilex(L, fname, mode); + return load_aux(L, status, env); +} + + +/* +** {====================================================== +** Generic Read function +** ======================================================= +*/ + + +/* +** reserved slot, above all arguments, to hold a copy of the returned +** string to avoid it being collected while parsed. 'load' has four +** optional arguments (chunk, source name, mode, and environment). +*/ +#define RESERVEDSLOT 5 + + +/* +** Reader for generic `load' function: `lua_load' uses the +** stack for internal stuff, so the reader cannot change the +** stack top. Instead, it keeps its resulting string in a +** reserved slot inside the stack. +*/ +static const char *generic_reader (lua_State *L, void *ud, size_t *size) { + (void)(ud); /* not used */ + luaL_checkstack(L, 2, "too many nested functions"); + lua_pushvalue(L, 1); /* get function */ + lua_call(L, 0, 1); /* call it */ + if (lua_isnil(L, -1)) { + lua_pop(L, 1); /* pop result */ + *size = 0; + return NULL; + } + else if (!lua_isstring(L, -1)) + luaL_error(L, "reader function must return a string"); + lua_replace(L, RESERVEDSLOT); /* save string in reserved slot */ + return lua_tolstring(L, RESERVEDSLOT, size); +} + + +static int luaB_load (lua_State *L) { + int status; + size_t l; + const char *s = lua_tolstring(L, 1, &l); + const char *mode = luaL_optstring(L, 3, "bt"); + int env = (!lua_isnone(L, 4) ? 4 : 0); /* 'env' index or 0 if no 'env' */ + if (s != NULL) { /* loading a string? */ + const char *chunkname = luaL_optstring(L, 2, s); + status = luaL_loadbufferx(L, s, l, chunkname, mode); + } + else { /* loading from a reader function */ + const char *chunkname = luaL_optstring(L, 2, "=(load)"); + luaL_checktype(L, 1, LUA_TFUNCTION); + lua_settop(L, RESERVEDSLOT); /* create reserved slot */ + status = lua_load(L, generic_reader, NULL, chunkname, mode); + } + return load_aux(L, status, env); +} + +/* }====================================================== */ + + +static int dofilecont (lua_State *L) { + return lua_gettop(L) - 1; +} + + +static int luaB_dofile (lua_State *L) { + const char *fname = luaL_optstring(L, 1, NULL); + lua_settop(L, 1); + if (luaL_loadfile(L, fname) != LUA_OK) + return lua_error(L); + lua_callk(L, 0, LUA_MULTRET, 0, dofilecont); + return dofilecont(L); +} + + +static int luaB_assert (lua_State *L) { + if (!lua_toboolean(L, 1)) + return luaL_error(L, "%s", luaL_optstring(L, 2, "assertion failed!")); + return lua_gettop(L); +} + + +static int luaB_select (lua_State *L) { + int n = lua_gettop(L); + if (lua_type(L, 1) == LUA_TSTRING && *lua_tostring(L, 1) == '#') { + lua_pushinteger(L, n-1); + return 1; + } + else { + int i = luaL_checkint(L, 1); + if (i < 0) i = n + i; + else if (i > n) i = n; + luaL_argcheck(L, 1 <= i, 1, "index out of range"); + return n - i; + } +} + + +static int finishpcall (lua_State *L, int status) { + if (!lua_checkstack(L, 1)) { /* no space for extra boolean? */ + lua_settop(L, 0); /* create space for return values */ + lua_pushboolean(L, 0); + lua_pushstring(L, "stack overflow"); + return 2; /* return false, msg */ + } + lua_pushboolean(L, status); /* first result (status) */ + lua_replace(L, 1); /* put first result in first slot */ + return lua_gettop(L); +} + + +static int pcallcont (lua_State *L) { + int status = lua_getctx(L, NULL); + return finishpcall(L, (status == LUA_YIELD)); +} + + +static int luaB_pcall (lua_State *L) { + int status; + luaL_checkany(L, 1); + lua_pushnil(L); + lua_insert(L, 1); /* create space for status result */ + status = lua_pcallk(L, lua_gettop(L) - 2, LUA_MULTRET, 0, 0, pcallcont); + return finishpcall(L, (status == LUA_OK)); +} + + +static int luaB_xpcall (lua_State *L) { + int status; + int n = lua_gettop(L); + luaL_argcheck(L, n >= 2, 2, "value expected"); + lua_pushvalue(L, 1); /* exchange function... */ + lua_copy(L, 2, 1); /* ...and error handler */ + lua_replace(L, 2); + status = lua_pcallk(L, n - 2, LUA_MULTRET, 1, 0, pcallcont); + return finishpcall(L, (status == LUA_OK)); +} + + +static int luaB_tostring (lua_State *L) { + luaL_checkany(L, 1); + luaL_tolstring(L, 1, NULL); + return 1; +} + + +static const luaL_Reg base_funcs[] = { + {"assert", luaB_assert}, + {"collectgarbage", luaB_collectgarbage}, + {"dofile", luaB_dofile}, + {"error", luaB_error}, + {"getmetatable", luaB_getmetatable}, + {"ipairs", luaB_ipairs}, + {"loadfile", luaB_loadfile}, + {"load", luaB_load}, +#if defined(LUA_COMPAT_LOADSTRING) + {"loadstring", luaB_load}, +#endif + {"next", luaB_next}, + {"pairs", luaB_pairs}, + {"pcall", luaB_pcall}, + {"print", luaB_print}, + {"rawequal", luaB_rawequal}, + {"rawlen", luaB_rawlen}, + {"rawget", luaB_rawget}, + {"rawset", luaB_rawset}, + {"select", luaB_select}, + {"setmetatable", luaB_setmetatable}, + {"tonumber", luaB_tonumber}, + {"tostring", luaB_tostring}, + {"type", luaB_type}, + {"xpcall", luaB_xpcall}, + {NULL, NULL} +}; + + +LUAMOD_API int luaopen_base (lua_State *L) { + /* set global _G */ + lua_pushglobaltable(L); + lua_pushglobaltable(L); + lua_setfield(L, -2, "_G"); + /* open lib into global table */ + luaL_setfuncs(L, base_funcs, 0); + lua_pushliteral(L, LUA_VERSION); + lua_setfield(L, -2, "_VERSION"); /* set global _VERSION */ + return 1; +} + diff --git a/liblua/lbitlib.c b/liblua/lbitlib.c new file mode 100644 index 00000000..9637532e --- /dev/null +++ b/liblua/lbitlib.c @@ -0,0 +1,211 @@ +/* +** $Id: lbitlib.c,v 1.18 2013/03/19 13:19:12 roberto Exp $ +** Standard library for bitwise operations +** See Copyright Notice in lua.h +*/ + +#define lbitlib_c +#define LUA_LIB + +#include "lua.h" + +#include "lauxlib.h" +#include "lualib.h" + + +/* number of bits to consider in a number */ +#if !defined(LUA_NBITS) +#define LUA_NBITS 32 +#endif + + +#define ALLONES (~(((~(lua_Unsigned)0) << (LUA_NBITS - 1)) << 1)) + +/* macro to trim extra bits */ +#define trim(x) ((x) & ALLONES) + + +/* builds a number with 'n' ones (1 <= n <= LUA_NBITS) */ +#define mask(n) (~((ALLONES << 1) << ((n) - 1))) + + +typedef lua_Unsigned b_uint; + + + +static b_uint andaux (lua_State *L) { + int i, n = lua_gettop(L); + b_uint r = ~(b_uint)0; + for (i = 1; i <= n; i++) + r &= luaL_checkunsigned(L, i); + return trim(r); +} + + +static int b_and (lua_State *L) { + b_uint r = andaux(L); + lua_pushunsigned(L, r); + return 1; +} + + +static int b_test (lua_State *L) { + b_uint r = andaux(L); + lua_pushboolean(L, r != 0); + return 1; +} + + +static int b_or (lua_State *L) { + int i, n = lua_gettop(L); + b_uint r = 0; + for (i = 1; i <= n; i++) + r |= luaL_checkunsigned(L, i); + lua_pushunsigned(L, trim(r)); + return 1; +} + + +static int b_xor (lua_State *L) { + int i, n = lua_gettop(L); + b_uint r = 0; + for (i = 1; i <= n; i++) + r ^= luaL_checkunsigned(L, i); + lua_pushunsigned(L, trim(r)); + return 1; +} + + +static int b_not (lua_State *L) { + b_uint r = ~luaL_checkunsigned(L, 1); + lua_pushunsigned(L, trim(r)); + return 1; +} + + +static int b_shift (lua_State *L, b_uint r, int i) { + if (i < 0) { /* shift right? */ + i = -i; + r = trim(r); + if (i >= LUA_NBITS) r = 0; + else r >>= i; + } + else { /* shift left */ + if (i >= LUA_NBITS) r = 0; + else r <<= i; + r = trim(r); + } + lua_pushunsigned(L, r); + return 1; +} + + +static int b_lshift (lua_State *L) { + return b_shift(L, luaL_checkunsigned(L, 1), luaL_checkint(L, 2)); +} + + +static int b_rshift (lua_State *L) { + return b_shift(L, luaL_checkunsigned(L, 1), -luaL_checkint(L, 2)); +} + + +static int b_arshift (lua_State *L) { + b_uint r = luaL_checkunsigned(L, 1); + int i = luaL_checkint(L, 2); + if (i < 0 || !(r & ((b_uint)1 << (LUA_NBITS - 1)))) + return b_shift(L, r, -i); + else { /* arithmetic shift for 'negative' number */ + if (i >= LUA_NBITS) r = ALLONES; + else + r = trim((r >> i) | ~(~(b_uint)0 >> i)); /* add signal bit */ + lua_pushunsigned(L, r); + return 1; + } +} + + +static int b_rot (lua_State *L, int i) { + b_uint r = luaL_checkunsigned(L, 1); + i &= (LUA_NBITS - 1); /* i = i % NBITS */ + r = trim(r); + r = (r << i) | (r >> (LUA_NBITS - i)); + lua_pushunsigned(L, trim(r)); + return 1; +} + + +static int b_lrot (lua_State *L) { + return b_rot(L, luaL_checkint(L, 2)); +} + + +static int b_rrot (lua_State *L) { + return b_rot(L, -luaL_checkint(L, 2)); +} + + +/* +** get field and width arguments for field-manipulation functions, +** checking whether they are valid. +** ('luaL_error' called without 'return' to avoid later warnings about +** 'width' being used uninitialized.) +*/ +static int fieldargs (lua_State *L, int farg, int *width) { + int f = luaL_checkint(L, farg); + int w = luaL_optint(L, farg + 1, 1); + luaL_argcheck(L, 0 <= f, farg, "field cannot be negative"); + luaL_argcheck(L, 0 < w, farg + 1, "width must be positive"); + if (f + w > LUA_NBITS) + luaL_error(L, "trying to access non-existent bits"); + *width = w; + return f; +} + + +static int b_extract (lua_State *L) { + int w; + b_uint r = luaL_checkunsigned(L, 1); + int f = fieldargs(L, 2, &w); + r = (r >> f) & mask(w); + lua_pushunsigned(L, r); + return 1; +} + + +static int b_replace (lua_State *L) { + int w; + b_uint r = luaL_checkunsigned(L, 1); + b_uint v = luaL_checkunsigned(L, 2); + int f = fieldargs(L, 3, &w); + int m = mask(w); + v &= m; /* erase bits outside given width */ + r = (r & ~(m << f)) | (v << f); + lua_pushunsigned(L, r); + return 1; +} + + +static const luaL_Reg bitlib[] = { + {"arshift", b_arshift}, + {"band", b_and}, + {"bnot", b_not}, + {"bor", b_or}, + {"bxor", b_xor}, + {"btest", b_test}, + {"extract", b_extract}, + {"lrotate", b_lrot}, + {"lshift", b_lshift}, + {"replace", b_replace}, + {"rrotate", b_rrot}, + {"rshift", b_rshift}, + {NULL, NULL} +}; + + + +LUAMOD_API int luaopen_bit32 (lua_State *L) { + luaL_newlib(L, bitlib); + return 1; +} + diff --git a/liblua/lcode.c b/liblua/lcode.c new file mode 100644 index 00000000..56c26ac8 --- /dev/null +++ b/liblua/lcode.c @@ -0,0 +1,881 @@ +/* +** $Id: lcode.c,v 2.62 2012/08/16 17:34:28 roberto Exp $ +** Code generator for Lua +** See Copyright Notice in lua.h +*/ + + +#include + +#define lcode_c +#define LUA_CORE + +#include "lua.h" + +#include "lcode.h" +#include "ldebug.h" +#include "ldo.h" +#include "lgc.h" +#include "llex.h" +#include "lmem.h" +#include "lobject.h" +#include "lopcodes.h" +#include "lparser.h" +#include "lstring.h" +#include "ltable.h" +#include "lvm.h" + + +#define hasjumps(e) ((e)->t != (e)->f) + + +static int isnumeral(expdesc *e) { + return (e->k == VKNUM && e->t == NO_JUMP && e->f == NO_JUMP); +} + + +void luaK_nil (FuncState *fs, int from, int n) { + Instruction *previous; + int l = from + n - 1; /* last register to set nil */ + if (fs->pc > fs->lasttarget) { /* no jumps to current position? */ + previous = &fs->f->code[fs->pc-1]; + if (GET_OPCODE(*previous) == OP_LOADNIL) { + int pfrom = GETARG_A(*previous); + int pl = pfrom + GETARG_B(*previous); + if ((pfrom <= from && from <= pl + 1) || + (from <= pfrom && pfrom <= l + 1)) { /* can connect both? */ + if (pfrom < from) from = pfrom; /* from = min(from, pfrom) */ + if (pl > l) l = pl; /* l = max(l, pl) */ + SETARG_A(*previous, from); + SETARG_B(*previous, l - from); + return; + } + } /* else go through */ + } + luaK_codeABC(fs, OP_LOADNIL, from, n - 1, 0); /* else no optimization */ +} + + +int luaK_jump (FuncState *fs) { + int jpc = fs->jpc; /* save list of jumps to here */ + int j; + fs->jpc = NO_JUMP; + j = luaK_codeAsBx(fs, OP_JMP, 0, NO_JUMP); + luaK_concat(fs, &j, jpc); /* keep them on hold */ + return j; +} + + +void luaK_ret (FuncState *fs, int first, int nret) { + luaK_codeABC(fs, OP_RETURN, first, nret+1, 0); +} + + +static int condjump (FuncState *fs, OpCode op, int A, int B, int C) { + luaK_codeABC(fs, op, A, B, C); + return luaK_jump(fs); +} + + +static void fixjump (FuncState *fs, int pc, int dest) { + Instruction *jmp = &fs->f->code[pc]; + int offset = dest-(pc+1); + lua_assert(dest != NO_JUMP); + if (abs(offset) > MAXARG_sBx) + luaX_syntaxerror(fs->ls, "control structure too long"); + SETARG_sBx(*jmp, offset); +} + + +/* +** returns current `pc' and marks it as a jump target (to avoid wrong +** optimizations with consecutive instructions not in the same basic block). +*/ +int luaK_getlabel (FuncState *fs) { + fs->lasttarget = fs->pc; + return fs->pc; +} + + +static int getjump (FuncState *fs, int pc) { + int offset = GETARG_sBx(fs->f->code[pc]); + if (offset == NO_JUMP) /* point to itself represents end of list */ + return NO_JUMP; /* end of list */ + else + return (pc+1)+offset; /* turn offset into absolute position */ +} + + +static Instruction *getjumpcontrol (FuncState *fs, int pc) { + Instruction *pi = &fs->f->code[pc]; + if (pc >= 1 && testTMode(GET_OPCODE(*(pi-1)))) + return pi-1; + else + return pi; +} + + +/* +** check whether list has any jump that do not produce a value +** (or produce an inverted value) +*/ +static int need_value (FuncState *fs, int list) { + for (; list != NO_JUMP; list = getjump(fs, list)) { + Instruction i = *getjumpcontrol(fs, list); + if (GET_OPCODE(i) != OP_TESTSET) return 1; + } + return 0; /* not found */ +} + + +static int patchtestreg (FuncState *fs, int node, int reg) { + Instruction *i = getjumpcontrol(fs, node); + if (GET_OPCODE(*i) != OP_TESTSET) + return 0; /* cannot patch other instructions */ + if (reg != NO_REG && reg != GETARG_B(*i)) + SETARG_A(*i, reg); + else /* no register to put value or register already has the value */ + *i = CREATE_ABC(OP_TEST, GETARG_B(*i), 0, GETARG_C(*i)); + + return 1; +} + + +static void removevalues (FuncState *fs, int list) { + for (; list != NO_JUMP; list = getjump(fs, list)) + patchtestreg(fs, list, NO_REG); +} + + +static void patchlistaux (FuncState *fs, int list, int vtarget, int reg, + int dtarget) { + while (list != NO_JUMP) { + int next = getjump(fs, list); + if (patchtestreg(fs, list, reg)) + fixjump(fs, list, vtarget); + else + fixjump(fs, list, dtarget); /* jump to default target */ + list = next; + } +} + + +static void dischargejpc (FuncState *fs) { + patchlistaux(fs, fs->jpc, fs->pc, NO_REG, fs->pc); + fs->jpc = NO_JUMP; +} + + +void luaK_patchlist (FuncState *fs, int list, int target) { + if (target == fs->pc) + luaK_patchtohere(fs, list); + else { + lua_assert(target < fs->pc); + patchlistaux(fs, list, target, NO_REG, target); + } +} + + +LUAI_FUNC void luaK_patchclose (FuncState *fs, int list, int level) { + level++; /* argument is +1 to reserve 0 as non-op */ + while (list != NO_JUMP) { + int next = getjump(fs, list); + lua_assert(GET_OPCODE(fs->f->code[list]) == OP_JMP && + (GETARG_A(fs->f->code[list]) == 0 || + GETARG_A(fs->f->code[list]) >= level)); + SETARG_A(fs->f->code[list], level); + list = next; + } +} + + +void luaK_patchtohere (FuncState *fs, int list) { + luaK_getlabel(fs); + luaK_concat(fs, &fs->jpc, list); +} + + +void luaK_concat (FuncState *fs, int *l1, int l2) { + if (l2 == NO_JUMP) return; + else if (*l1 == NO_JUMP) + *l1 = l2; + else { + int list = *l1; + int next; + while ((next = getjump(fs, list)) != NO_JUMP) /* find last element */ + list = next; + fixjump(fs, list, l2); + } +} + + +static int luaK_code (FuncState *fs, Instruction i) { + Proto *f = fs->f; + dischargejpc(fs); /* `pc' will change */ + /* put new instruction in code array */ + luaM_growvector(fs->ls->L, f->code, fs->pc, f->sizecode, Instruction, + MAX_INT, "opcodes"); + f->code[fs->pc] = i; + /* save corresponding line information */ + luaM_growvector(fs->ls->L, f->lineinfo, fs->pc, f->sizelineinfo, int, + MAX_INT, "opcodes"); + f->lineinfo[fs->pc] = fs->ls->lastline; + return fs->pc++; +} + + +int luaK_codeABC (FuncState *fs, OpCode o, int a, int b, int c) { + lua_assert(getOpMode(o) == iABC); + lua_assert(getBMode(o) != OpArgN || b == 0); + lua_assert(getCMode(o) != OpArgN || c == 0); + lua_assert(a <= MAXARG_A && b <= MAXARG_B && c <= MAXARG_C); + return luaK_code(fs, CREATE_ABC(o, a, b, c)); +} + + +int luaK_codeABx (FuncState *fs, OpCode o, int a, unsigned int bc) { + lua_assert(getOpMode(o) == iABx || getOpMode(o) == iAsBx); + lua_assert(getCMode(o) == OpArgN); + lua_assert(a <= MAXARG_A && bc <= MAXARG_Bx); + return luaK_code(fs, CREATE_ABx(o, a, bc)); +} + + +static int codeextraarg (FuncState *fs, int a) { + lua_assert(a <= MAXARG_Ax); + return luaK_code(fs, CREATE_Ax(OP_EXTRAARG, a)); +} + + +int luaK_codek (FuncState *fs, int reg, int k) { + if (k <= MAXARG_Bx) + return luaK_codeABx(fs, OP_LOADK, reg, k); + else { + int p = luaK_codeABx(fs, OP_LOADKX, reg, 0); + codeextraarg(fs, k); + return p; + } +} + + +void luaK_checkstack (FuncState *fs, int n) { + int newstack = fs->freereg + n; + if (newstack > fs->f->maxstacksize) { + if (newstack >= MAXSTACK) + luaX_syntaxerror(fs->ls, "function or expression too complex"); + fs->f->maxstacksize = cast_byte(newstack); + } +} + + +void luaK_reserveregs (FuncState *fs, int n) { + luaK_checkstack(fs, n); + fs->freereg += n; +} + + +static void freereg (FuncState *fs, int reg) { + if (!ISK(reg) && reg >= fs->nactvar) { + fs->freereg--; + lua_assert(reg == fs->freereg); + } +} + + +static void freeexp (FuncState *fs, expdesc *e) { + if (e->k == VNONRELOC) + freereg(fs, e->u.info); +} + + +static int addk (FuncState *fs, TValue *key, TValue *v) { + lua_State *L = fs->ls->L; + TValue *idx = luaH_set(L, fs->h, key); + Proto *f = fs->f; + int k, oldsize; + if (ttisnumber(idx)) { + lua_Number n = nvalue(idx); + lua_number2int(k, n); + if (luaV_rawequalobj(&f->k[k], v)) + return k; + /* else may be a collision (e.g., between 0.0 and "\0\0\0\0\0\0\0\0"); + go through and create a new entry for this value */ + } + /* constant not found; create a new entry */ + oldsize = f->sizek; + k = fs->nk; + /* numerical value does not need GC barrier; + table has no metatable, so it does not need to invalidate cache */ + setnvalue(idx, cast_num(k)); + luaM_growvector(L, f->k, k, f->sizek, TValue, MAXARG_Ax, "constants"); + while (oldsize < f->sizek) setnilvalue(&f->k[oldsize++]); + setobj(L, &f->k[k], v); + fs->nk++; + luaC_barrier(L, f, v); + return k; +} + + +int luaK_stringK (FuncState *fs, TString *s) { + TValue o; + setsvalue(fs->ls->L, &o, s); + return addk(fs, &o, &o); +} + + +int luaK_numberK (FuncState *fs, lua_Number r) { + int n; + lua_State *L = fs->ls->L; + TValue o; + setnvalue(&o, r); + if (r == 0 || luai_numisnan(NULL, r)) { /* handle -0 and NaN */ + /* use raw representation as key to avoid numeric problems */ + setsvalue(L, L->top++, luaS_newlstr(L, (char *)&r, sizeof(r))); + n = addk(fs, L->top - 1, &o); + L->top--; + } + else + n = addk(fs, &o, &o); /* regular case */ + return n; +} + + +static int boolK (FuncState *fs, int b) { + TValue o; + setbvalue(&o, b); + return addk(fs, &o, &o); +} + + +static int nilK (FuncState *fs) { + TValue k, v; + setnilvalue(&v); + /* cannot use nil as key; instead use table itself to represent nil */ + sethvalue(fs->ls->L, &k, fs->h); + return addk(fs, &k, &v); +} + + +void luaK_setreturns (FuncState *fs, expdesc *e, int nresults) { + if (e->k == VCALL) { /* expression is an open function call? */ + SETARG_C(getcode(fs, e), nresults+1); + } + else if (e->k == VVARARG) { + SETARG_B(getcode(fs, e), nresults+1); + SETARG_A(getcode(fs, e), fs->freereg); + luaK_reserveregs(fs, 1); + } +} + + +void luaK_setoneret (FuncState *fs, expdesc *e) { + if (e->k == VCALL) { /* expression is an open function call? */ + e->k = VNONRELOC; + e->u.info = GETARG_A(getcode(fs, e)); + } + else if (e->k == VVARARG) { + SETARG_B(getcode(fs, e), 2); + e->k = VRELOCABLE; /* can relocate its simple result */ + } +} + + +void luaK_dischargevars (FuncState *fs, expdesc *e) { + switch (e->k) { + case VLOCAL: { + e->k = VNONRELOC; + break; + } + case VUPVAL: { + e->u.info = luaK_codeABC(fs, OP_GETUPVAL, 0, e->u.info, 0); + e->k = VRELOCABLE; + break; + } + case VINDEXED: { + OpCode op = OP_GETTABUP; /* assume 't' is in an upvalue */ + freereg(fs, e->u.ind.idx); + if (e->u.ind.vt == VLOCAL) { /* 't' is in a register? */ + freereg(fs, e->u.ind.t); + op = OP_GETTABLE; + } + e->u.info = luaK_codeABC(fs, op, 0, e->u.ind.t, e->u.ind.idx); + e->k = VRELOCABLE; + break; + } + case VVARARG: + case VCALL: { + luaK_setoneret(fs, e); + break; + } + default: break; /* there is one value available (somewhere) */ + } +} + + +static int code_label (FuncState *fs, int A, int b, int jump) { + luaK_getlabel(fs); /* those instructions may be jump targets */ + return luaK_codeABC(fs, OP_LOADBOOL, A, b, jump); +} + + +static void discharge2reg (FuncState *fs, expdesc *e, int reg) { + luaK_dischargevars(fs, e); + switch (e->k) { + case VNIL: { + luaK_nil(fs, reg, 1); + break; + } + case VFALSE: case VTRUE: { + luaK_codeABC(fs, OP_LOADBOOL, reg, e->k == VTRUE, 0); + break; + } + case VK: { + luaK_codek(fs, reg, e->u.info); + break; + } + case VKNUM: { + luaK_codek(fs, reg, luaK_numberK(fs, e->u.nval)); + break; + } + case VRELOCABLE: { + Instruction *pc = &getcode(fs, e); + SETARG_A(*pc, reg); + break; + } + case VNONRELOC: { + if (reg != e->u.info) + luaK_codeABC(fs, OP_MOVE, reg, e->u.info, 0); + break; + } + default: { + lua_assert(e->k == VVOID || e->k == VJMP); + return; /* nothing to do... */ + } + } + e->u.info = reg; + e->k = VNONRELOC; +} + + +static void discharge2anyreg (FuncState *fs, expdesc *e) { + if (e->k != VNONRELOC) { + luaK_reserveregs(fs, 1); + discharge2reg(fs, e, fs->freereg-1); + } +} + + +static void exp2reg (FuncState *fs, expdesc *e, int reg) { + discharge2reg(fs, e, reg); + if (e->k == VJMP) + luaK_concat(fs, &e->t, e->u.info); /* put this jump in `t' list */ + if (hasjumps(e)) { + int final; /* position after whole expression */ + int p_f = NO_JUMP; /* position of an eventual LOAD false */ + int p_t = NO_JUMP; /* position of an eventual LOAD true */ + if (need_value(fs, e->t) || need_value(fs, e->f)) { + int fj = (e->k == VJMP) ? NO_JUMP : luaK_jump(fs); + p_f = code_label(fs, reg, 0, 1); + p_t = code_label(fs, reg, 1, 0); + luaK_patchtohere(fs, fj); + } + final = luaK_getlabel(fs); + patchlistaux(fs, e->f, final, reg, p_f); + patchlistaux(fs, e->t, final, reg, p_t); + } + e->f = e->t = NO_JUMP; + e->u.info = reg; + e->k = VNONRELOC; +} + + +void luaK_exp2nextreg (FuncState *fs, expdesc *e) { + luaK_dischargevars(fs, e); + freeexp(fs, e); + luaK_reserveregs(fs, 1); + exp2reg(fs, e, fs->freereg - 1); +} + + +int luaK_exp2anyreg (FuncState *fs, expdesc *e) { + luaK_dischargevars(fs, e); + if (e->k == VNONRELOC) { + if (!hasjumps(e)) return e->u.info; /* exp is already in a register */ + if (e->u.info >= fs->nactvar) { /* reg. is not a local? */ + exp2reg(fs, e, e->u.info); /* put value on it */ + return e->u.info; + } + } + luaK_exp2nextreg(fs, e); /* default */ + return e->u.info; +} + + +void luaK_exp2anyregup (FuncState *fs, expdesc *e) { + if (e->k != VUPVAL || hasjumps(e)) + luaK_exp2anyreg(fs, e); +} + + +void luaK_exp2val (FuncState *fs, expdesc *e) { + if (hasjumps(e)) + luaK_exp2anyreg(fs, e); + else + luaK_dischargevars(fs, e); +} + + +int luaK_exp2RK (FuncState *fs, expdesc *e) { + luaK_exp2val(fs, e); + switch (e->k) { + case VTRUE: + case VFALSE: + case VNIL: { + if (fs->nk <= MAXINDEXRK) { /* constant fits in RK operand? */ + e->u.info = (e->k == VNIL) ? nilK(fs) : boolK(fs, (e->k == VTRUE)); + e->k = VK; + return RKASK(e->u.info); + } + else break; + } + case VKNUM: { + e->u.info = luaK_numberK(fs, e->u.nval); + e->k = VK; + /* go through */ + } + case VK: { + if (e->u.info <= MAXINDEXRK) /* constant fits in argC? */ + return RKASK(e->u.info); + else break; + } + default: break; + } + /* not a constant in the right range: put it in a register */ + return luaK_exp2anyreg(fs, e); +} + + +void luaK_storevar (FuncState *fs, expdesc *var, expdesc *ex) { + switch (var->k) { + case VLOCAL: { + freeexp(fs, ex); + exp2reg(fs, ex, var->u.info); + return; + } + case VUPVAL: { + int e = luaK_exp2anyreg(fs, ex); + luaK_codeABC(fs, OP_SETUPVAL, e, var->u.info, 0); + break; + } + case VINDEXED: { + OpCode op = (var->u.ind.vt == VLOCAL) ? OP_SETTABLE : OP_SETTABUP; + int e = luaK_exp2RK(fs, ex); + luaK_codeABC(fs, op, var->u.ind.t, var->u.ind.idx, e); + break; + } + default: { + lua_assert(0); /* invalid var kind to store */ + break; + } + } + freeexp(fs, ex); +} + + +void luaK_self (FuncState *fs, expdesc *e, expdesc *key) { + int ereg; + luaK_exp2anyreg(fs, e); + ereg = e->u.info; /* register where 'e' was placed */ + freeexp(fs, e); + e->u.info = fs->freereg; /* base register for op_self */ + e->k = VNONRELOC; + luaK_reserveregs(fs, 2); /* function and 'self' produced by op_self */ + luaK_codeABC(fs, OP_SELF, e->u.info, ereg, luaK_exp2RK(fs, key)); + freeexp(fs, key); +} + + +static void invertjump (FuncState *fs, expdesc *e) { + Instruction *pc = getjumpcontrol(fs, e->u.info); + lua_assert(testTMode(GET_OPCODE(*pc)) && GET_OPCODE(*pc) != OP_TESTSET && + GET_OPCODE(*pc) != OP_TEST); + SETARG_A(*pc, !(GETARG_A(*pc))); +} + + +static int jumponcond (FuncState *fs, expdesc *e, int cond) { + if (e->k == VRELOCABLE) { + Instruction ie = getcode(fs, e); + if (GET_OPCODE(ie) == OP_NOT) { + fs->pc--; /* remove previous OP_NOT */ + return condjump(fs, OP_TEST, GETARG_B(ie), 0, !cond); + } + /* else go through */ + } + discharge2anyreg(fs, e); + freeexp(fs, e); + return condjump(fs, OP_TESTSET, NO_REG, e->u.info, cond); +} + + +void luaK_goiftrue (FuncState *fs, expdesc *e) { + int pc; /* pc of last jump */ + luaK_dischargevars(fs, e); + switch (e->k) { + case VJMP: { + invertjump(fs, e); + pc = e->u.info; + break; + } + case VK: case VKNUM: case VTRUE: { + pc = NO_JUMP; /* always true; do nothing */ + break; + } + default: { + pc = jumponcond(fs, e, 0); + break; + } + } + luaK_concat(fs, &e->f, pc); /* insert last jump in `f' list */ + luaK_patchtohere(fs, e->t); + e->t = NO_JUMP; +} + + +void luaK_goiffalse (FuncState *fs, expdesc *e) { + int pc; /* pc of last jump */ + luaK_dischargevars(fs, e); + switch (e->k) { + case VJMP: { + pc = e->u.info; + break; + } + case VNIL: case VFALSE: { + pc = NO_JUMP; /* always false; do nothing */ + break; + } + default: { + pc = jumponcond(fs, e, 1); + break; + } + } + luaK_concat(fs, &e->t, pc); /* insert last jump in `t' list */ + luaK_patchtohere(fs, e->f); + e->f = NO_JUMP; +} + + +static void codenot (FuncState *fs, expdesc *e) { + luaK_dischargevars(fs, e); + switch (e->k) { + case VNIL: case VFALSE: { + e->k = VTRUE; + break; + } + case VK: case VKNUM: case VTRUE: { + e->k = VFALSE; + break; + } + case VJMP: { + invertjump(fs, e); + break; + } + case VRELOCABLE: + case VNONRELOC: { + discharge2anyreg(fs, e); + freeexp(fs, e); + e->u.info = luaK_codeABC(fs, OP_NOT, 0, e->u.info, 0); + e->k = VRELOCABLE; + break; + } + default: { + lua_assert(0); /* cannot happen */ + break; + } + } + /* interchange true and false lists */ + { int temp = e->f; e->f = e->t; e->t = temp; } + removevalues(fs, e->f); + removevalues(fs, e->t); +} + + +void luaK_indexed (FuncState *fs, expdesc *t, expdesc *k) { + lua_assert(!hasjumps(t)); + t->u.ind.t = t->u.info; + t->u.ind.idx = luaK_exp2RK(fs, k); + t->u.ind.vt = (t->k == VUPVAL) ? VUPVAL + : check_exp(vkisinreg(t->k), VLOCAL); + t->k = VINDEXED; +} + + +static int constfolding (OpCode op, expdesc *e1, expdesc *e2) { + lua_Number r; + if (!isnumeral(e1) || !isnumeral(e2)) return 0; + if ((op == OP_DIV || op == OP_MOD) && e2->u.nval == 0) + return 0; /* do not attempt to divide by 0 */ + r = luaO_arith(op - OP_ADD + LUA_OPADD, e1->u.nval, e2->u.nval); + e1->u.nval = r; + return 1; +} + + +static void codearith (FuncState *fs, OpCode op, + expdesc *e1, expdesc *e2, int line) { + if (constfolding(op, e1, e2)) + return; + else { + int o2 = (op != OP_UNM && op != OP_LEN) ? luaK_exp2RK(fs, e2) : 0; + int o1 = luaK_exp2RK(fs, e1); + if (o1 > o2) { + freeexp(fs, e1); + freeexp(fs, e2); + } + else { + freeexp(fs, e2); + freeexp(fs, e1); + } + e1->u.info = luaK_codeABC(fs, op, 0, o1, o2); + e1->k = VRELOCABLE; + luaK_fixline(fs, line); + } +} + + +static void codecomp (FuncState *fs, OpCode op, int cond, expdesc *e1, + expdesc *e2) { + int o1 = luaK_exp2RK(fs, e1); + int o2 = luaK_exp2RK(fs, e2); + freeexp(fs, e2); + freeexp(fs, e1); + if (cond == 0 && op != OP_EQ) { + int temp; /* exchange args to replace by `<' or `<=' */ + temp = o1; o1 = o2; o2 = temp; /* o1 <==> o2 */ + cond = 1; + } + e1->u.info = condjump(fs, op, cond, o1, o2); + e1->k = VJMP; +} + + +void luaK_prefix (FuncState *fs, UnOpr op, expdesc *e, int line) { + expdesc e2; + e2.t = e2.f = NO_JUMP; e2.k = VKNUM; e2.u.nval = 0; + switch (op) { + case OPR_MINUS: { + if (isnumeral(e)) /* minus constant? */ + e->u.nval = luai_numunm(NULL, e->u.nval); /* fold it */ + else { + luaK_exp2anyreg(fs, e); + codearith(fs, OP_UNM, e, &e2, line); + } + break; + } + case OPR_NOT: codenot(fs, e); break; + case OPR_LEN: { + luaK_exp2anyreg(fs, e); /* cannot operate on constants */ + codearith(fs, OP_LEN, e, &e2, line); + break; + } + default: lua_assert(0); + } +} + + +void luaK_infix (FuncState *fs, BinOpr op, expdesc *v) { + switch (op) { + case OPR_AND: { + luaK_goiftrue(fs, v); + break; + } + case OPR_OR: { + luaK_goiffalse(fs, v); + break; + } + case OPR_CONCAT: { + luaK_exp2nextreg(fs, v); /* operand must be on the `stack' */ + break; + } + case OPR_ADD: case OPR_SUB: case OPR_MUL: case OPR_DIV: + case OPR_MOD: case OPR_POW: { + if (!isnumeral(v)) luaK_exp2RK(fs, v); + break; + } + default: { + luaK_exp2RK(fs, v); + break; + } + } +} + + +void luaK_posfix (FuncState *fs, BinOpr op, + expdesc *e1, expdesc *e2, int line) { + switch (op) { + case OPR_AND: { + lua_assert(e1->t == NO_JUMP); /* list must be closed */ + luaK_dischargevars(fs, e2); + luaK_concat(fs, &e2->f, e1->f); + *e1 = *e2; + break; + } + case OPR_OR: { + lua_assert(e1->f == NO_JUMP); /* list must be closed */ + luaK_dischargevars(fs, e2); + luaK_concat(fs, &e2->t, e1->t); + *e1 = *e2; + break; + } + case OPR_CONCAT: { + luaK_exp2val(fs, e2); + if (e2->k == VRELOCABLE && GET_OPCODE(getcode(fs, e2)) == OP_CONCAT) { + lua_assert(e1->u.info == GETARG_B(getcode(fs, e2))-1); + freeexp(fs, e1); + SETARG_B(getcode(fs, e2), e1->u.info); + e1->k = VRELOCABLE; e1->u.info = e2->u.info; + } + else { + luaK_exp2nextreg(fs, e2); /* operand must be on the 'stack' */ + codearith(fs, OP_CONCAT, e1, e2, line); + } + break; + } + case OPR_ADD: case OPR_SUB: case OPR_MUL: case OPR_DIV: + case OPR_MOD: case OPR_POW: { + codearith(fs, cast(OpCode, op - OPR_ADD + OP_ADD), e1, e2, line); + break; + } + case OPR_EQ: case OPR_LT: case OPR_LE: { + codecomp(fs, cast(OpCode, op - OPR_EQ + OP_EQ), 1, e1, e2); + break; + } + case OPR_NE: case OPR_GT: case OPR_GE: { + codecomp(fs, cast(OpCode, op - OPR_NE + OP_EQ), 0, e1, e2); + break; + } + default: lua_assert(0); + } +} + + +void luaK_fixline (FuncState *fs, int line) { + fs->f->lineinfo[fs->pc - 1] = line; +} + + +void luaK_setlist (FuncState *fs, int base, int nelems, int tostore) { + int c = (nelems - 1)/LFIELDS_PER_FLUSH + 1; + int b = (tostore == LUA_MULTRET) ? 0 : tostore; + lua_assert(tostore != 0); + if (c <= MAXARG_C) + luaK_codeABC(fs, OP_SETLIST, base, b, c); + else if (c <= MAXARG_Ax) { + luaK_codeABC(fs, OP_SETLIST, base, b, 0); + codeextraarg(fs, c); + } + else + luaX_syntaxerror(fs->ls, "constructor too long"); + fs->freereg = base + 1; /* free registers with list values */ +} + diff --git a/liblua/lcode.h b/liblua/lcode.h new file mode 100644 index 00000000..5a1fa9fe --- /dev/null +++ b/liblua/lcode.h @@ -0,0 +1,83 @@ +/* +** $Id: lcode.h,v 1.58 2011/08/30 16:26:41 roberto Exp $ +** Code generator for Lua +** See Copyright Notice in lua.h +*/ + +#ifndef lcode_h +#define lcode_h + +#include "llex.h" +#include "lobject.h" +#include "lopcodes.h" +#include "lparser.h" + + +/* +** Marks the end of a patch list. It is an invalid value both as an absolute +** address, and as a list link (would link an element to itself). +*/ +#define NO_JUMP (-1) + + +/* +** grep "ORDER OPR" if you change these enums (ORDER OP) +*/ +typedef enum BinOpr { + OPR_ADD, OPR_SUB, OPR_MUL, OPR_DIV, OPR_MOD, OPR_POW, + OPR_CONCAT, + OPR_EQ, OPR_LT, OPR_LE, + OPR_NE, OPR_GT, OPR_GE, + OPR_AND, OPR_OR, + OPR_NOBINOPR +} BinOpr; + + +typedef enum UnOpr { OPR_MINUS, OPR_NOT, OPR_LEN, OPR_NOUNOPR } UnOpr; + + +#define getcode(fs,e) ((fs)->f->code[(e)->u.info]) + +#define luaK_codeAsBx(fs,o,A,sBx) luaK_codeABx(fs,o,A,(sBx)+MAXARG_sBx) + +#define luaK_setmultret(fs,e) luaK_setreturns(fs, e, LUA_MULTRET) + +#define luaK_jumpto(fs,t) luaK_patchlist(fs, luaK_jump(fs), t) + +LUAI_FUNC int luaK_codeABx (FuncState *fs, OpCode o, int A, unsigned int Bx); +LUAI_FUNC int luaK_codeABC (FuncState *fs, OpCode o, int A, int B, int C); +LUAI_FUNC int luaK_codek (FuncState *fs, int reg, int k); +LUAI_FUNC void luaK_fixline (FuncState *fs, int line); +LUAI_FUNC void luaK_nil (FuncState *fs, int from, int n); +LUAI_FUNC void luaK_reserveregs (FuncState *fs, int n); +LUAI_FUNC void luaK_checkstack (FuncState *fs, int n); +LUAI_FUNC int luaK_stringK (FuncState *fs, TString *s); +LUAI_FUNC int luaK_numberK (FuncState *fs, lua_Number r); +LUAI_FUNC void luaK_dischargevars (FuncState *fs, expdesc *e); +LUAI_FUNC int luaK_exp2anyreg (FuncState *fs, expdesc *e); +LUAI_FUNC void luaK_exp2anyregup (FuncState *fs, expdesc *e); +LUAI_FUNC void luaK_exp2nextreg (FuncState *fs, expdesc *e); +LUAI_FUNC void luaK_exp2val (FuncState *fs, expdesc *e); +LUAI_FUNC int luaK_exp2RK (FuncState *fs, expdesc *e); +LUAI_FUNC void luaK_self (FuncState *fs, expdesc *e, expdesc *key); +LUAI_FUNC void luaK_indexed (FuncState *fs, expdesc *t, expdesc *k); +LUAI_FUNC void luaK_goiftrue (FuncState *fs, expdesc *e); +LUAI_FUNC void luaK_goiffalse (FuncState *fs, expdesc *e); +LUAI_FUNC void luaK_storevar (FuncState *fs, expdesc *var, expdesc *e); +LUAI_FUNC void luaK_setreturns (FuncState *fs, expdesc *e, int nresults); +LUAI_FUNC void luaK_setoneret (FuncState *fs, expdesc *e); +LUAI_FUNC int luaK_jump (FuncState *fs); +LUAI_FUNC void luaK_ret (FuncState *fs, int first, int nret); +LUAI_FUNC void luaK_patchlist (FuncState *fs, int list, int target); +LUAI_FUNC void luaK_patchtohere (FuncState *fs, int list); +LUAI_FUNC void luaK_patchclose (FuncState *fs, int list, int level); +LUAI_FUNC void luaK_concat (FuncState *fs, int *l1, int l2); +LUAI_FUNC int luaK_getlabel (FuncState *fs); +LUAI_FUNC void luaK_prefix (FuncState *fs, UnOpr op, expdesc *v, int line); +LUAI_FUNC void luaK_infix (FuncState *fs, BinOpr op, expdesc *v); +LUAI_FUNC void luaK_posfix (FuncState *fs, BinOpr op, expdesc *v1, + expdesc *v2, int line); +LUAI_FUNC void luaK_setlist (FuncState *fs, int base, int nelems, int tostore); + + +#endif diff --git a/liblua/lcorolib.c b/liblua/lcorolib.c new file mode 100644 index 00000000..1326c814 --- /dev/null +++ b/liblua/lcorolib.c @@ -0,0 +1,155 @@ +/* +** $Id: lcorolib.c,v 1.5 2013/02/21 13:44:53 roberto Exp $ +** Coroutine Library +** See Copyright Notice in lua.h +*/ + + +#include + + +#define lcorolib_c +#define LUA_LIB + +#include "lua.h" + +#include "lauxlib.h" +#include "lualib.h" + + +static int auxresume (lua_State *L, lua_State *co, int narg) { + int status; + if (!lua_checkstack(co, narg)) { + lua_pushliteral(L, "too many arguments to resume"); + return -1; /* error flag */ + } + if (lua_status(co) == LUA_OK && lua_gettop(co) == 0) { + lua_pushliteral(L, "cannot resume dead coroutine"); + return -1; /* error flag */ + } + lua_xmove(L, co, narg); + status = lua_resume(co, L, narg); + if (status == LUA_OK || status == LUA_YIELD) { + int nres = lua_gettop(co); + if (!lua_checkstack(L, nres + 1)) { + lua_pop(co, nres); /* remove results anyway */ + lua_pushliteral(L, "too many results to resume"); + return -1; /* error flag */ + } + lua_xmove(co, L, nres); /* move yielded values */ + return nres; + } + else { + lua_xmove(co, L, 1); /* move error message */ + return -1; /* error flag */ + } +} + + +static int luaB_coresume (lua_State *L) { + lua_State *co = lua_tothread(L, 1); + int r; + luaL_argcheck(L, co, 1, "coroutine expected"); + r = auxresume(L, co, lua_gettop(L) - 1); + if (r < 0) { + lua_pushboolean(L, 0); + lua_insert(L, -2); + return 2; /* return false + error message */ + } + else { + lua_pushboolean(L, 1); + lua_insert(L, -(r + 1)); + return r + 1; /* return true + `resume' returns */ + } +} + + +static int luaB_auxwrap (lua_State *L) { + lua_State *co = lua_tothread(L, lua_upvalueindex(1)); + int r = auxresume(L, co, lua_gettop(L)); + if (r < 0) { + if (lua_isstring(L, -1)) { /* error object is a string? */ + luaL_where(L, 1); /* add extra info */ + lua_insert(L, -2); + lua_concat(L, 2); + } + return lua_error(L); /* propagate error */ + } + return r; +} + + +static int luaB_cocreate (lua_State *L) { + lua_State *NL; + luaL_checktype(L, 1, LUA_TFUNCTION); + NL = lua_newthread(L); + lua_pushvalue(L, 1); /* move function to top */ + lua_xmove(L, NL, 1); /* move function from L to NL */ + return 1; +} + + +static int luaB_cowrap (lua_State *L) { + luaB_cocreate(L); + lua_pushcclosure(L, luaB_auxwrap, 1); + return 1; +} + + +static int luaB_yield (lua_State *L) { + return lua_yield(L, lua_gettop(L)); +} + + +static int luaB_costatus (lua_State *L) { + lua_State *co = lua_tothread(L, 1); + luaL_argcheck(L, co, 1, "coroutine expected"); + if (L == co) lua_pushliteral(L, "running"); + else { + switch (lua_status(co)) { + case LUA_YIELD: + lua_pushliteral(L, "suspended"); + break; + case LUA_OK: { + lua_Debug ar; + if (lua_getstack(co, 0, &ar) > 0) /* does it have frames? */ + lua_pushliteral(L, "normal"); /* it is running */ + else if (lua_gettop(co) == 0) + lua_pushliteral(L, "dead"); + else + lua_pushliteral(L, "suspended"); /* initial state */ + break; + } + default: /* some error occurred */ + lua_pushliteral(L, "dead"); + break; + } + } + return 1; +} + + +static int luaB_corunning (lua_State *L) { + int ismain = lua_pushthread(L); + lua_pushboolean(L, ismain); + return 2; +} + + +static const luaL_Reg co_funcs[] = { + {"create", luaB_cocreate}, + {"resume", luaB_coresume}, + {"running", luaB_corunning}, + {"status", luaB_costatus}, + {"wrap", luaB_cowrap}, + {"yield", luaB_yield}, + {NULL, NULL} +}; + + + +LUAMOD_API int luaopen_coroutine (lua_State *L) { + luaL_newlib(L, co_funcs); + return 1; +} + diff --git a/liblua/lctype.c b/liblua/lctype.c new file mode 100644 index 00000000..55e433a5 --- /dev/null +++ b/liblua/lctype.c @@ -0,0 +1,52 @@ +/* +** $Id: lctype.c,v 1.11 2011/10/03 16:19:23 roberto Exp $ +** 'ctype' functions for Lua +** See Copyright Notice in lua.h +*/ + +#define lctype_c +#define LUA_CORE + +#include "lctype.h" + +#if !LUA_USE_CTYPE /* { */ + +#include + +LUAI_DDEF const lu_byte luai_ctype_[UCHAR_MAX + 2] = { + 0x00, /* EOZ */ + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 0. */ + 0x00, 0x08, 0x08, 0x08, 0x08, 0x08, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 1. */ + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x0c, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, /* 2. */ + 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, + 0x16, 0x16, 0x16, 0x16, 0x16, 0x16, 0x16, 0x16, /* 3. */ + 0x16, 0x16, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, + 0x04, 0x15, 0x15, 0x15, 0x15, 0x15, 0x15, 0x05, /* 4. */ + 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, + 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, /* 5. */ + 0x05, 0x05, 0x05, 0x04, 0x04, 0x04, 0x04, 0x05, + 0x04, 0x15, 0x15, 0x15, 0x15, 0x15, 0x15, 0x05, /* 6. */ + 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, + 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, /* 7. */ + 0x05, 0x05, 0x05, 0x04, 0x04, 0x04, 0x04, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 8. */ + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 9. */ + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* a. */ + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* b. */ + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* c. */ + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* d. */ + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* e. */ + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* f. */ + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, +}; + +#endif /* } */ diff --git a/liblua/lctype.h b/liblua/lctype.h new file mode 100644 index 00000000..99c7d122 --- /dev/null +++ b/liblua/lctype.h @@ -0,0 +1,95 @@ +/* +** $Id: lctype.h,v 1.12 2011/07/15 12:50:29 roberto Exp $ +** 'ctype' functions for Lua +** See Copyright Notice in lua.h +*/ + +#ifndef lctype_h +#define lctype_h + +#include "lua.h" + + +/* +** WARNING: the functions defined here do not necessarily correspond +** to the similar functions in the standard C ctype.h. They are +** optimized for the specific needs of Lua +*/ + +#if !defined(LUA_USE_CTYPE) + +#if 'A' == 65 && '0' == 48 +/* ASCII case: can use its own tables; faster and fixed */ +#define LUA_USE_CTYPE 0 +#else +/* must use standard C ctype */ +#define LUA_USE_CTYPE 1 +#endif + +#endif + + +#if !LUA_USE_CTYPE /* { */ + +#include + +#include "llimits.h" + + +#define ALPHABIT 0 +#define DIGITBIT 1 +#define PRINTBIT 2 +#define SPACEBIT 3 +#define XDIGITBIT 4 + + +#define MASK(B) (1 << (B)) + + +/* +** add 1 to char to allow index -1 (EOZ) +*/ +#define testprop(c,p) (luai_ctype_[(c)+1] & (p)) + +/* +** 'lalpha' (Lua alphabetic) and 'lalnum' (Lua alphanumeric) both include '_' +*/ +#define lislalpha(c) testprop(c, MASK(ALPHABIT)) +#define lislalnum(c) testprop(c, (MASK(ALPHABIT) | MASK(DIGITBIT))) +#define lisdigit(c) testprop(c, MASK(DIGITBIT)) +#define lisspace(c) testprop(c, MASK(SPACEBIT)) +#define lisprint(c) testprop(c, MASK(PRINTBIT)) +#define lisxdigit(c) testprop(c, MASK(XDIGITBIT)) + +/* +** this 'ltolower' only works for alphabetic characters +*/ +#define ltolower(c) ((c) | ('A' ^ 'a')) + + +/* two more entries for 0 and -1 (EOZ) */ +LUAI_DDEC const lu_byte luai_ctype_[UCHAR_MAX + 2]; + + +#else /* }{ */ + +/* +** use standard C ctypes +*/ + +#include + + +#define lislalpha(c) (isalpha(c) || (c) == '_') +#define lislalnum(c) (isalnum(c) || (c) == '_') +#define lisdigit(c) (isdigit(c)) +#define lisspace(c) (isspace(c)) +#define lisprint(c) (isprint(c)) +#define lisxdigit(c) (isxdigit(c)) + +#define ltolower(c) (tolower(c)) + +#endif /* } */ + +#endif + diff --git a/liblua/ldblib.c b/liblua/ldblib.c new file mode 100644 index 00000000..c0226945 --- /dev/null +++ b/liblua/ldblib.c @@ -0,0 +1,398 @@ +/* +** $Id: ldblib.c,v 1.132 2012/01/19 20:14:44 roberto Exp $ +** Interface from Lua to its debug API +** See Copyright Notice in lua.h +*/ + + +#include +#include +#include + +#define ldblib_c +#define LUA_LIB + +#include "lua.h" + +#include "lauxlib.h" +#include "lualib.h" + + +#define HOOKKEY "_HKEY" + + + +static int db_getregistry (lua_State *L) { + lua_pushvalue(L, LUA_REGISTRYINDEX); + return 1; +} + + +static int db_getmetatable (lua_State *L) { + luaL_checkany(L, 1); + if (!lua_getmetatable(L, 1)) { + lua_pushnil(L); /* no metatable */ + } + return 1; +} + + +static int db_setmetatable (lua_State *L) { + int t = lua_type(L, 2); + luaL_argcheck(L, t == LUA_TNIL || t == LUA_TTABLE, 2, + "nil or table expected"); + lua_settop(L, 2); + lua_setmetatable(L, 1); + return 1; /* return 1st argument */ +} + + +static int db_getuservalue (lua_State *L) { + if (lua_type(L, 1) != LUA_TUSERDATA) + lua_pushnil(L); + else + lua_getuservalue(L, 1); + return 1; +} + + +static int db_setuservalue (lua_State *L) { + if (lua_type(L, 1) == LUA_TLIGHTUSERDATA) + luaL_argerror(L, 1, "full userdata expected, got light userdata"); + luaL_checktype(L, 1, LUA_TUSERDATA); + if (!lua_isnoneornil(L, 2)) + luaL_checktype(L, 2, LUA_TTABLE); + lua_settop(L, 2); + lua_setuservalue(L, 1); + return 1; +} + + +static void settabss (lua_State *L, const char *i, const char *v) { + lua_pushstring(L, v); + lua_setfield(L, -2, i); +} + + +static void settabsi (lua_State *L, const char *i, int v) { + lua_pushinteger(L, v); + lua_setfield(L, -2, i); +} + + +static void settabsb (lua_State *L, const char *i, int v) { + lua_pushboolean(L, v); + lua_setfield(L, -2, i); +} + + +static lua_State *getthread (lua_State *L, int *arg) { + if (lua_isthread(L, 1)) { + *arg = 1; + return lua_tothread(L, 1); + } + else { + *arg = 0; + return L; + } +} + + +static void treatstackoption (lua_State *L, lua_State *L1, const char *fname) { + if (L == L1) { + lua_pushvalue(L, -2); + lua_remove(L, -3); + } + else + lua_xmove(L1, L, 1); + lua_setfield(L, -2, fname); +} + + +static int db_getinfo (lua_State *L) { + lua_Debug ar; + int arg; + lua_State *L1 = getthread(L, &arg); + const char *options = luaL_optstring(L, arg+2, "flnStu"); + if (lua_isnumber(L, arg+1)) { + if (!lua_getstack(L1, (int)lua_tointeger(L, arg+1), &ar)) { + lua_pushnil(L); /* level out of range */ + return 1; + } + } + else if (lua_isfunction(L, arg+1)) { + lua_pushfstring(L, ">%s", options); + options = lua_tostring(L, -1); + lua_pushvalue(L, arg+1); + lua_xmove(L, L1, 1); + } + else + return luaL_argerror(L, arg+1, "function or level expected"); + if (!lua_getinfo(L1, options, &ar)) + return luaL_argerror(L, arg+2, "invalid option"); + lua_createtable(L, 0, 2); + if (strchr(options, 'S')) { + settabss(L, "source", ar.source); + settabss(L, "short_src", ar.short_src); + settabsi(L, "linedefined", ar.linedefined); + settabsi(L, "lastlinedefined", ar.lastlinedefined); + settabss(L, "what", ar.what); + } + if (strchr(options, 'l')) + settabsi(L, "currentline", ar.currentline); + if (strchr(options, 'u')) { + settabsi(L, "nups", ar.nups); + settabsi(L, "nparams", ar.nparams); + settabsb(L, "isvararg", ar.isvararg); + } + if (strchr(options, 'n')) { + settabss(L, "name", ar.name); + settabss(L, "namewhat", ar.namewhat); + } + if (strchr(options, 't')) + settabsb(L, "istailcall", ar.istailcall); + if (strchr(options, 'L')) + treatstackoption(L, L1, "activelines"); + if (strchr(options, 'f')) + treatstackoption(L, L1, "func"); + return 1; /* return table */ +} + + +static int db_getlocal (lua_State *L) { + int arg; + lua_State *L1 = getthread(L, &arg); + lua_Debug ar; + const char *name; + int nvar = luaL_checkint(L, arg+2); /* local-variable index */ + if (lua_isfunction(L, arg + 1)) { /* function argument? */ + lua_pushvalue(L, arg + 1); /* push function */ + lua_pushstring(L, lua_getlocal(L, NULL, nvar)); /* push local name */ + return 1; + } + else { /* stack-level argument */ + if (!lua_getstack(L1, luaL_checkint(L, arg+1), &ar)) /* out of range? */ + return luaL_argerror(L, arg+1, "level out of range"); + name = lua_getlocal(L1, &ar, nvar); + if (name) { + lua_xmove(L1, L, 1); /* push local value */ + lua_pushstring(L, name); /* push name */ + lua_pushvalue(L, -2); /* re-order */ + return 2; + } + else { + lua_pushnil(L); /* no name (nor value) */ + return 1; + } + } +} + + +static int db_setlocal (lua_State *L) { + int arg; + lua_State *L1 = getthread(L, &arg); + lua_Debug ar; + if (!lua_getstack(L1, luaL_checkint(L, arg+1), &ar)) /* out of range? */ + return luaL_argerror(L, arg+1, "level out of range"); + luaL_checkany(L, arg+3); + lua_settop(L, arg+3); + lua_xmove(L, L1, 1); + lua_pushstring(L, lua_setlocal(L1, &ar, luaL_checkint(L, arg+2))); + return 1; +} + + +static int auxupvalue (lua_State *L, int get) { + const char *name; + int n = luaL_checkint(L, 2); + luaL_checktype(L, 1, LUA_TFUNCTION); + name = get ? lua_getupvalue(L, 1, n) : lua_setupvalue(L, 1, n); + if (name == NULL) return 0; + lua_pushstring(L, name); + lua_insert(L, -(get+1)); + return get + 1; +} + + +static int db_getupvalue (lua_State *L) { + return auxupvalue(L, 1); +} + + +static int db_setupvalue (lua_State *L) { + luaL_checkany(L, 3); + return auxupvalue(L, 0); +} + + +static int checkupval (lua_State *L, int argf, int argnup) { + lua_Debug ar; + int nup = luaL_checkint(L, argnup); + luaL_checktype(L, argf, LUA_TFUNCTION); + lua_pushvalue(L, argf); + lua_getinfo(L, ">u", &ar); + luaL_argcheck(L, 1 <= nup && nup <= ar.nups, argnup, "invalid upvalue index"); + return nup; +} + + +static int db_upvalueid (lua_State *L) { + int n = checkupval(L, 1, 2); + lua_pushlightuserdata(L, lua_upvalueid(L, 1, n)); + return 1; +} + + +static int db_upvaluejoin (lua_State *L) { + int n1 = checkupval(L, 1, 2); + int n2 = checkupval(L, 3, 4); + luaL_argcheck(L, !lua_iscfunction(L, 1), 1, "Lua function expected"); + luaL_argcheck(L, !lua_iscfunction(L, 3), 3, "Lua function expected"); + lua_upvaluejoin(L, 1, n1, 3, n2); + return 0; +} + + +#define gethooktable(L) luaL_getsubtable(L, LUA_REGISTRYINDEX, HOOKKEY) + + +static void hookf (lua_State *L, lua_Debug *ar) { + static const char *const hooknames[] = + {"call", "return", "line", "count", "tail call"}; + gethooktable(L); + lua_pushthread(L); + lua_rawget(L, -2); + if (lua_isfunction(L, -1)) { + lua_pushstring(L, hooknames[(int)ar->event]); + if (ar->currentline >= 0) + lua_pushinteger(L, ar->currentline); + else lua_pushnil(L); + lua_assert(lua_getinfo(L, "lS", ar)); + lua_call(L, 2, 0); + } +} + + +static int makemask (const char *smask, int count) { + int mask = 0; + if (strchr(smask, 'c')) mask |= LUA_MASKCALL; + if (strchr(smask, 'r')) mask |= LUA_MASKRET; + if (strchr(smask, 'l')) mask |= LUA_MASKLINE; + if (count > 0) mask |= LUA_MASKCOUNT; + return mask; +} + + +static char *unmakemask (int mask, char *smask) { + int i = 0; + if (mask & LUA_MASKCALL) smask[i++] = 'c'; + if (mask & LUA_MASKRET) smask[i++] = 'r'; + if (mask & LUA_MASKLINE) smask[i++] = 'l'; + smask[i] = '\0'; + return smask; +} + + +static int db_sethook (lua_State *L) { + int arg, mask, count; + lua_Hook func; + lua_State *L1 = getthread(L, &arg); + if (lua_isnoneornil(L, arg+1)) { + lua_settop(L, arg+1); + func = NULL; mask = 0; count = 0; /* turn off hooks */ + } + else { + const char *smask = luaL_checkstring(L, arg+2); + luaL_checktype(L, arg+1, LUA_TFUNCTION); + count = luaL_optint(L, arg+3, 0); + func = hookf; mask = makemask(smask, count); + } + if (gethooktable(L) == 0) { /* creating hook table? */ + lua_pushstring(L, "k"); + lua_setfield(L, -2, "__mode"); /** hooktable.__mode = "k" */ + lua_pushvalue(L, -1); + lua_setmetatable(L, -2); /* setmetatable(hooktable) = hooktable */ + } + lua_pushthread(L1); lua_xmove(L1, L, 1); + lua_pushvalue(L, arg+1); + lua_rawset(L, -3); /* set new hook */ + lua_sethook(L1, func, mask, count); /* set hooks */ + return 0; +} + + +static int db_gethook (lua_State *L) { + int arg; + lua_State *L1 = getthread(L, &arg); + char buff[5]; + int mask = lua_gethookmask(L1); + lua_Hook hook = lua_gethook(L1); + if (hook != NULL && hook != hookf) /* external hook? */ + lua_pushliteral(L, "external hook"); + else { + gethooktable(L); + lua_pushthread(L1); lua_xmove(L1, L, 1); + lua_rawget(L, -2); /* get hook */ + lua_remove(L, -2); /* remove hook table */ + } + lua_pushstring(L, unmakemask(mask, buff)); + lua_pushinteger(L, lua_gethookcount(L1)); + return 3; +} + + +static int db_debug (lua_State *L) { + for (;;) { + char buffer[250]; + luai_writestringerror("%s", "lua_debug> "); + if (fgets(buffer, sizeof(buffer), stdin) == 0 || + strcmp(buffer, "cont\n") == 0) + return 0; + if (luaL_loadbuffer(L, buffer, strlen(buffer), "=(debug command)") || + lua_pcall(L, 0, 0, 0)) + luai_writestringerror("%s\n", lua_tostring(L, -1)); + lua_settop(L, 0); /* remove eventual returns */ + } +} + + +static int db_traceback (lua_State *L) { + int arg; + lua_State *L1 = getthread(L, &arg); + const char *msg = lua_tostring(L, arg + 1); + if (msg == NULL && !lua_isnoneornil(L, arg + 1)) /* non-string 'msg'? */ + lua_pushvalue(L, arg + 1); /* return it untouched */ + else { + int level = luaL_optint(L, arg + 2, (L == L1) ? 1 : 0); + luaL_traceback(L, L1, msg, level); + } + return 1; +} + + +static const luaL_Reg dblib[] = { + {"debug", db_debug}, + {"getuservalue", db_getuservalue}, + {"gethook", db_gethook}, + {"getinfo", db_getinfo}, + {"getlocal", db_getlocal}, + {"getregistry", db_getregistry}, + {"getmetatable", db_getmetatable}, + {"getupvalue", db_getupvalue}, + {"upvaluejoin", db_upvaluejoin}, + {"upvalueid", db_upvalueid}, + {"setuservalue", db_setuservalue}, + {"sethook", db_sethook}, + {"setlocal", db_setlocal}, + {"setmetatable", db_setmetatable}, + {"setupvalue", db_setupvalue}, + {"traceback", db_traceback}, + {NULL, NULL} +}; + + +LUAMOD_API int luaopen_debug (lua_State *L) { + luaL_newlib(L, dblib); + return 1; +} + diff --git a/liblua/ldebug.c b/liblua/ldebug.c new file mode 100644 index 00000000..7e04f9d0 --- /dev/null +++ b/liblua/ldebug.c @@ -0,0 +1,580 @@ +/* +** $Id: ldebug.c,v 2.90 2012/08/16 17:34:28 roberto Exp $ +** Debug Interface +** See Copyright Notice in lua.h +*/ + + +#include +#include +#include + + +#define ldebug_c +#define LUA_CORE + +#include "lua.h" + +#include "lapi.h" +#include "lcode.h" +#include "ldebug.h" +#include "ldo.h" +#include "lfunc.h" +#include "lobject.h" +#include "lopcodes.h" +#include "lstate.h" +#include "lstring.h" +#include "ltable.h" +#include "ltm.h" +#include "lvm.h" + + + +#define noLuaClosure(f) ((f) == NULL || (f)->c.tt == LUA_TCCL) + + +static const char *getfuncname (lua_State *L, CallInfo *ci, const char **name); + + +static int currentpc (CallInfo *ci) { + lua_assert(isLua(ci)); + return pcRel(ci->u.l.savedpc, ci_func(ci)->p); +} + + +static int currentline (CallInfo *ci) { + return getfuncline(ci_func(ci)->p, currentpc(ci)); +} + + +/* +** this function can be called asynchronous (e.g. during a signal) +*/ +LUA_API int lua_sethook (lua_State *L, lua_Hook func, int mask, int count) { + if (func == NULL || mask == 0) { /* turn off hooks? */ + mask = 0; + func = NULL; + } + if (isLua(L->ci)) + L->oldpc = L->ci->u.l.savedpc; + L->hook = func; + L->basehookcount = count; + resethookcount(L); + L->hookmask = cast_byte(mask); + return 1; +} + + +LUA_API lua_Hook lua_gethook (lua_State *L) { + return L->hook; +} + + +LUA_API int lua_gethookmask (lua_State *L) { + return L->hookmask; +} + + +LUA_API int lua_gethookcount (lua_State *L) { + return L->basehookcount; +} + + +LUA_API int lua_getstack (lua_State *L, int level, lua_Debug *ar) { + int status; + CallInfo *ci; + if (level < 0) return 0; /* invalid (negative) level */ + lua_lock(L); + for (ci = L->ci; level > 0 && ci != &L->base_ci; ci = ci->previous) + level--; + if (level == 0 && ci != &L->base_ci) { /* level found? */ + status = 1; + ar->i_ci = ci; + } + else status = 0; /* no such level */ + lua_unlock(L); + return status; +} + + +static const char *upvalname (Proto *p, int uv) { + TString *s = check_exp(uv < p->sizeupvalues, p->upvalues[uv].name); + if (s == NULL) return "?"; + else return getstr(s); +} + + +static const char *findvararg (CallInfo *ci, int n, StkId *pos) { + int nparams = clLvalue(ci->func)->p->numparams; + if (n >= ci->u.l.base - ci->func - nparams) + return NULL; /* no such vararg */ + else { + *pos = ci->func + nparams + n; + return "(*vararg)"; /* generic name for any vararg */ + } +} + + +static const char *findlocal (lua_State *L, CallInfo *ci, int n, + StkId *pos) { + const char *name = NULL; + StkId base; + if (isLua(ci)) { + if (n < 0) /* access to vararg values? */ + return findvararg(ci, -n, pos); + else { + base = ci->u.l.base; + name = luaF_getlocalname(ci_func(ci)->p, n, currentpc(ci)); + } + } + else + base = ci->func + 1; + if (name == NULL) { /* no 'standard' name? */ + StkId limit = (ci == L->ci) ? L->top : ci->next->func; + if (limit - base >= n && n > 0) /* is 'n' inside 'ci' stack? */ + name = "(*temporary)"; /* generic name for any valid slot */ + else + return NULL; /* no name */ + } + *pos = base + (n - 1); + return name; +} + + +LUA_API const char *lua_getlocal (lua_State *L, const lua_Debug *ar, int n) { + const char *name; + lua_lock(L); + if (ar == NULL) { /* information about non-active function? */ + if (!isLfunction(L->top - 1)) /* not a Lua function? */ + name = NULL; + else /* consider live variables at function start (parameters) */ + name = luaF_getlocalname(clLvalue(L->top - 1)->p, n, 0); + } + else { /* active function; get information through 'ar' */ + StkId pos = 0; /* to avoid warnings */ + name = findlocal(L, ar->i_ci, n, &pos); + if (name) { + setobj2s(L, L->top, pos); + api_incr_top(L); + } + } + lua_unlock(L); + return name; +} + + +LUA_API const char *lua_setlocal (lua_State *L, const lua_Debug *ar, int n) { + StkId pos = 0; /* to avoid warnings */ + const char *name = findlocal(L, ar->i_ci, n, &pos); + lua_lock(L); + if (name) + setobjs2s(L, pos, L->top - 1); + L->top--; /* pop value */ + lua_unlock(L); + return name; +} + + +static void funcinfo (lua_Debug *ar, Closure *cl) { + if (noLuaClosure(cl)) { + ar->source = "=[C]"; + ar->linedefined = -1; + ar->lastlinedefined = -1; + ar->what = "C"; + } + else { + Proto *p = cl->l.p; + ar->source = p->source ? getstr(p->source) : "=?"; + ar->linedefined = p->linedefined; + ar->lastlinedefined = p->lastlinedefined; + ar->what = (ar->linedefined == 0) ? "main" : "Lua"; + } + luaO_chunkid(ar->short_src, ar->source, LUA_IDSIZE); +} + + +static void collectvalidlines (lua_State *L, Closure *f) { + if (noLuaClosure(f)) { + setnilvalue(L->top); + api_incr_top(L); + } + else { + int i; + TValue v; + int *lineinfo = f->l.p->lineinfo; + Table *t = luaH_new(L); /* new table to store active lines */ + sethvalue(L, L->top, t); /* push it on stack */ + api_incr_top(L); + setbvalue(&v, 1); /* boolean 'true' to be the value of all indices */ + for (i = 0; i < f->l.p->sizelineinfo; i++) /* for all lines with code */ + luaH_setint(L, t, lineinfo[i], &v); /* table[line] = true */ + } +} + + +static int auxgetinfo (lua_State *L, const char *what, lua_Debug *ar, + Closure *f, CallInfo *ci) { + int status = 1; + for (; *what; what++) { + switch (*what) { + case 'S': { + funcinfo(ar, f); + break; + } + case 'l': { + ar->currentline = (ci && isLua(ci)) ? currentline(ci) : -1; + break; + } + case 'u': { + ar->nups = (f == NULL) ? 0 : f->c.nupvalues; + if (noLuaClosure(f)) { + ar->isvararg = 1; + ar->nparams = 0; + } + else { + ar->isvararg = f->l.p->is_vararg; + ar->nparams = f->l.p->numparams; + } + break; + } + case 't': { + ar->istailcall = (ci) ? ci->callstatus & CIST_TAIL : 0; + break; + } + case 'n': { + /* calling function is a known Lua function? */ + if (ci && !(ci->callstatus & CIST_TAIL) && isLua(ci->previous)) + ar->namewhat = getfuncname(L, ci->previous, &ar->name); + else + ar->namewhat = NULL; + if (ar->namewhat == NULL) { + ar->namewhat = ""; /* not found */ + ar->name = NULL; + } + break; + } + case 'L': + case 'f': /* handled by lua_getinfo */ + break; + default: status = 0; /* invalid option */ + } + } + return status; +} + + +LUA_API int lua_getinfo (lua_State *L, const char *what, lua_Debug *ar) { + int status; + Closure *cl; + CallInfo *ci; + StkId func; + lua_lock(L); + if (*what == '>') { + ci = NULL; + func = L->top - 1; + api_check(L, ttisfunction(func), "function expected"); + what++; /* skip the '>' */ + L->top--; /* pop function */ + } + else { + ci = ar->i_ci; + func = ci->func; + lua_assert(ttisfunction(ci->func)); + } + cl = ttisclosure(func) ? clvalue(func) : NULL; + status = auxgetinfo(L, what, ar, cl, ci); + if (strchr(what, 'f')) { + setobjs2s(L, L->top, func); + api_incr_top(L); + } + if (strchr(what, 'L')) + collectvalidlines(L, cl); + lua_unlock(L); + return status; +} + + +/* +** {====================================================== +** Symbolic Execution +** ======================================================= +*/ + +static const char *getobjname (Proto *p, int lastpc, int reg, + const char **name); + + +/* +** find a "name" for the RK value 'c' +*/ +static void kname (Proto *p, int pc, int c, const char **name) { + if (ISK(c)) { /* is 'c' a constant? */ + TValue *kvalue = &p->k[INDEXK(c)]; + if (ttisstring(kvalue)) { /* literal constant? */ + *name = svalue(kvalue); /* it is its own name */ + return; + } + /* else no reasonable name found */ + } + else { /* 'c' is a register */ + const char *what = getobjname(p, pc, c, name); /* search for 'c' */ + if (what && *what == 'c') { /* found a constant name? */ + return; /* 'name' already filled */ + } + /* else no reasonable name found */ + } + *name = "?"; /* no reasonable name found */ +} + + +/* +** try to find last instruction before 'lastpc' that modified register 'reg' +*/ +static int findsetreg (Proto *p, int lastpc, int reg) { + int pc; + int setreg = -1; /* keep last instruction that changed 'reg' */ + for (pc = 0; pc < lastpc; pc++) { + Instruction i = p->code[pc]; + OpCode op = GET_OPCODE(i); + int a = GETARG_A(i); + switch (op) { + case OP_LOADNIL: { + int b = GETARG_B(i); + if (a <= reg && reg <= a + b) /* set registers from 'a' to 'a+b' */ + setreg = pc; + break; + } + case OP_TFORCALL: { + if (reg >= a + 2) setreg = pc; /* affect all regs above its base */ + break; + } + case OP_CALL: + case OP_TAILCALL: { + if (reg >= a) setreg = pc; /* affect all registers above base */ + break; + } + case OP_JMP: { + int b = GETARG_sBx(i); + int dest = pc + 1 + b; + /* jump is forward and do not skip `lastpc'? */ + if (pc < dest && dest <= lastpc) + pc += b; /* do the jump */ + break; + } + case OP_TEST: { + if (reg == a) setreg = pc; /* jumped code can change 'a' */ + break; + } + default: + if (testAMode(op) && reg == a) /* any instruction that set A */ + setreg = pc; + break; + } + } + return setreg; +} + + +static const char *getobjname (Proto *p, int lastpc, int reg, + const char **name) { + int pc; + *name = luaF_getlocalname(p, reg + 1, lastpc); + if (*name) /* is a local? */ + return "local"; + /* else try symbolic execution */ + pc = findsetreg(p, lastpc, reg); + if (pc != -1) { /* could find instruction? */ + Instruction i = p->code[pc]; + OpCode op = GET_OPCODE(i); + switch (op) { + case OP_MOVE: { + int b = GETARG_B(i); /* move from 'b' to 'a' */ + if (b < GETARG_A(i)) + return getobjname(p, pc, b, name); /* get name for 'b' */ + break; + } + case OP_GETTABUP: + case OP_GETTABLE: { + int k = GETARG_C(i); /* key index */ + int t = GETARG_B(i); /* table index */ + const char *vn = (op == OP_GETTABLE) /* name of indexed variable */ + ? luaF_getlocalname(p, t + 1, pc) + : upvalname(p, t); + kname(p, pc, k, name); + return (vn && strcmp(vn, LUA_ENV) == 0) ? "global" : "field"; + } + case OP_GETUPVAL: { + *name = upvalname(p, GETARG_B(i)); + return "upvalue"; + } + case OP_LOADK: + case OP_LOADKX: { + int b = (op == OP_LOADK) ? GETARG_Bx(i) + : GETARG_Ax(p->code[pc + 1]); + if (ttisstring(&p->k[b])) { + *name = svalue(&p->k[b]); + return "constant"; + } + break; + } + case OP_SELF: { + int k = GETARG_C(i); /* key index */ + kname(p, pc, k, name); + return "method"; + } + default: break; /* go through to return NULL */ + } + } + return NULL; /* could not find reasonable name */ +} + + +static const char *getfuncname (lua_State *L, CallInfo *ci, const char **name) { + TMS tm; + Proto *p = ci_func(ci)->p; /* calling function */ + int pc = currentpc(ci); /* calling instruction index */ + Instruction i = p->code[pc]; /* calling instruction */ + switch (GET_OPCODE(i)) { + case OP_CALL: + case OP_TAILCALL: /* get function name */ + return getobjname(p, pc, GETARG_A(i), name); + case OP_TFORCALL: { /* for iterator */ + *name = "for iterator"; + return "for iterator"; + } + /* all other instructions can call only through metamethods */ + case OP_SELF: + case OP_GETTABUP: + case OP_GETTABLE: tm = TM_INDEX; break; + case OP_SETTABUP: + case OP_SETTABLE: tm = TM_NEWINDEX; break; + case OP_EQ: tm = TM_EQ; break; + case OP_ADD: tm = TM_ADD; break; + case OP_SUB: tm = TM_SUB; break; + case OP_MUL: tm = TM_MUL; break; + case OP_DIV: tm = TM_DIV; break; + case OP_MOD: tm = TM_MOD; break; + case OP_POW: tm = TM_POW; break; + case OP_UNM: tm = TM_UNM; break; + case OP_LEN: tm = TM_LEN; break; + case OP_LT: tm = TM_LT; break; + case OP_LE: tm = TM_LE; break; + case OP_CONCAT: tm = TM_CONCAT; break; + default: + return NULL; /* else no useful name can be found */ + } + *name = getstr(G(L)->tmname[tm]); + return "metamethod"; +} + +/* }====================================================== */ + + + +/* +** only ANSI way to check whether a pointer points to an array +** (used only for error messages, so efficiency is not a big concern) +*/ +static int isinstack (CallInfo *ci, const TValue *o) { + StkId p; + for (p = ci->u.l.base; p < ci->top; p++) + if (o == p) return 1; + return 0; +} + + +static const char *getupvalname (CallInfo *ci, const TValue *o, + const char **name) { + LClosure *c = ci_func(ci); + int i; + for (i = 0; i < c->nupvalues; i++) { + if (c->upvals[i]->v == o) { + *name = upvalname(c->p, i); + return "upvalue"; + } + } + return NULL; +} + + +l_noret luaG_typeerror (lua_State *L, const TValue *o, const char *op) { + CallInfo *ci = L->ci; + const char *name = NULL; + const char *t = objtypename(o); + const char *kind = NULL; + if (isLua(ci)) { + kind = getupvalname(ci, o, &name); /* check whether 'o' is an upvalue */ + if (!kind && isinstack(ci, o)) /* no? try a register */ + kind = getobjname(ci_func(ci)->p, currentpc(ci), + cast_int(o - ci->u.l.base), &name); + } + if (kind) + luaG_runerror(L, "attempt to %s %s " LUA_QS " (a %s value)", + op, kind, name, t); + else + luaG_runerror(L, "attempt to %s a %s value", op, t); +} + + +l_noret luaG_concaterror (lua_State *L, StkId p1, StkId p2) { + if (ttisstring(p1) || ttisnumber(p1)) p1 = p2; + lua_assert(!ttisstring(p1) && !ttisnumber(p2)); + luaG_typeerror(L, p1, "concatenate"); +} + + +l_noret luaG_aritherror (lua_State *L, const TValue *p1, const TValue *p2) { + TValue temp; + if (luaV_tonumber(p1, &temp) == NULL) + p2 = p1; /* first operand is wrong */ + luaG_typeerror(L, p2, "perform arithmetic on"); +} + + +l_noret luaG_ordererror (lua_State *L, const TValue *p1, const TValue *p2) { + const char *t1 = objtypename(p1); + const char *t2 = objtypename(p2); + if (t1 == t2) + luaG_runerror(L, "attempt to compare two %s values", t1); + else + luaG_runerror(L, "attempt to compare %s with %s", t1, t2); +} + + +static void addinfo (lua_State *L, const char *msg) { + CallInfo *ci = L->ci; + if (isLua(ci)) { /* is Lua code? */ + char buff[LUA_IDSIZE]; /* add file:line information */ + int line = currentline(ci); + TString *src = ci_func(ci)->p->source; + if (src) + luaO_chunkid(buff, getstr(src), LUA_IDSIZE); + else { /* no source available; use "?" instead */ + buff[0] = '?'; buff[1] = '\0'; + } + luaO_pushfstring(L, "%s:%d: %s", buff, line, msg); + } +} + + +l_noret luaG_errormsg (lua_State *L) { + if (L->errfunc != 0) { /* is there an error handling function? */ + StkId errfunc = restorestack(L, L->errfunc); + if (!ttisfunction(errfunc)) luaD_throw(L, LUA_ERRERR); + setobjs2s(L, L->top, L->top - 1); /* move argument */ + setobjs2s(L, L->top - 1, errfunc); /* push function */ + L->top++; + luaD_call(L, L->top - 2, 1, 0); /* call it */ + } + luaD_throw(L, LUA_ERRRUN); +} + + +l_noret luaG_runerror (lua_State *L, const char *fmt, ...) { + va_list argp; + va_start(argp, fmt); + addinfo(L, luaO_pushvfstring(L, fmt, argp)); + va_end(argp); + luaG_errormsg(L); +} + diff --git a/liblua/ldebug.h b/liblua/ldebug.h new file mode 100644 index 00000000..fe39556b --- /dev/null +++ b/liblua/ldebug.h @@ -0,0 +1,34 @@ +/* +** $Id: ldebug.h,v 2.7 2011/10/07 20:45:19 roberto Exp $ +** Auxiliary functions from Debug Interface module +** See Copyright Notice in lua.h +*/ + +#ifndef ldebug_h +#define ldebug_h + + +#include "lstate.h" + + +#define pcRel(pc, p) (cast(int, (pc) - (p)->code) - 1) + +#define getfuncline(f,pc) (((f)->lineinfo) ? (f)->lineinfo[pc] : 0) + +#define resethookcount(L) (L->hookcount = L->basehookcount) + +/* Active Lua function (given call info) */ +#define ci_func(ci) (clLvalue((ci)->func)) + + +LUAI_FUNC l_noret luaG_typeerror (lua_State *L, const TValue *o, + const char *opname); +LUAI_FUNC l_noret luaG_concaterror (lua_State *L, StkId p1, StkId p2); +LUAI_FUNC l_noret luaG_aritherror (lua_State *L, const TValue *p1, + const TValue *p2); +LUAI_FUNC l_noret luaG_ordererror (lua_State *L, const TValue *p1, + const TValue *p2); +LUAI_FUNC l_noret luaG_runerror (lua_State *L, const char *fmt, ...); +LUAI_FUNC l_noret luaG_errormsg (lua_State *L); + +#endif diff --git a/liblua/ldo.c b/liblua/ldo.c new file mode 100644 index 00000000..aafa3dca --- /dev/null +++ b/liblua/ldo.c @@ -0,0 +1,673 @@ +/* +** $Id: ldo.c,v 2.108 2012/10/01 14:05:04 roberto Exp $ +** Stack and Call structure of Lua +** See Copyright Notice in lua.h +*/ + + +#include +#include +#include + +#define ldo_c +#define LUA_CORE + +#include "lua.h" + +#include "lapi.h" +#include "ldebug.h" +#include "ldo.h" +#include "lfunc.h" +#include "lgc.h" +#include "lmem.h" +#include "lobject.h" +#include "lopcodes.h" +#include "lparser.h" +#include "lstate.h" +#include "lstring.h" +#include "ltable.h" +#include "ltm.h" +#include "lundump.h" +#include "lvm.h" +#include "lzio.h" + + + + +/* +** {====================================================== +** Error-recovery functions +** ======================================================= +*/ + +/* +** LUAI_THROW/LUAI_TRY define how Lua does exception handling. By +** default, Lua handles errors with exceptions when compiling as +** C++ code, with _longjmp/_setjmp when asked to use them, and with +** longjmp/setjmp otherwise. +*/ +#if !defined(LUAI_THROW) + +#if defined(__cplusplus) && !defined(LUA_USE_LONGJMP) +/* C++ exceptions */ +#define LUAI_THROW(L,c) throw(c) +#define LUAI_TRY(L,c,a) \ + try { a } catch(...) { if ((c)->status == 0) (c)->status = -1; } +#define luai_jmpbuf int /* dummy variable */ + +#elif defined(LUA_USE_ULONGJMP) +/* in Unix, try _longjmp/_setjmp (more efficient) */ +#define LUAI_THROW(L,c) _longjmp((c)->b, 1) +#define LUAI_TRY(L,c,a) if (_setjmp((c)->b) == 0) { a } +#define luai_jmpbuf jmp_buf + +#else +/* default handling with long jumps */ +#define LUAI_THROW(L,c) longjmp((c)->b, 1) +#define LUAI_TRY(L,c,a) if (setjmp((c)->b) == 0) { a } +#define luai_jmpbuf jmp_buf + +#endif + +#endif + + + +/* chain list of long jump buffers */ +struct lua_longjmp { + struct lua_longjmp *previous; + luai_jmpbuf b; + volatile int status; /* error code */ +}; + + +static void seterrorobj (lua_State *L, int errcode, StkId oldtop) { + switch (errcode) { + case LUA_ERRMEM: { /* memory error? */ + setsvalue2s(L, oldtop, G(L)->memerrmsg); /* reuse preregistered msg. */ + break; + } + case LUA_ERRERR: { + setsvalue2s(L, oldtop, luaS_newliteral(L, "error in error handling")); + break; + } + default: { + setobjs2s(L, oldtop, L->top - 1); /* error message on current top */ + break; + } + } + L->top = oldtop + 1; +} + + +l_noret luaD_throw (lua_State *L, int errcode) { + if (L->errorJmp) { /* thread has an error handler? */ + L->errorJmp->status = errcode; /* set status */ + LUAI_THROW(L, L->errorJmp); /* jump to it */ + } + else { /* thread has no error handler */ + L->status = cast_byte(errcode); /* mark it as dead */ + if (G(L)->mainthread->errorJmp) { /* main thread has a handler? */ + setobjs2s(L, G(L)->mainthread->top++, L->top - 1); /* copy error obj. */ + luaD_throw(G(L)->mainthread, errcode); /* re-throw in main thread */ + } + else { /* no handler at all; abort */ + if (G(L)->panic) { /* panic function? */ + lua_unlock(L); + G(L)->panic(L); /* call it (last chance to jump out) */ + } + abort(); + } + } +} + + +int luaD_rawrunprotected (lua_State *L, Pfunc f, void *ud) { + unsigned short oldnCcalls = L->nCcalls; + struct lua_longjmp lj; + lj.status = LUA_OK; + lj.previous = L->errorJmp; /* chain new error handler */ + L->errorJmp = &lj; + LUAI_TRY(L, &lj, + (*f)(L, ud); + ); + L->errorJmp = lj.previous; /* restore old error handler */ + L->nCcalls = oldnCcalls; + return lj.status; +} + +/* }====================================================== */ + + +static void correctstack (lua_State *L, TValue *oldstack) { + CallInfo *ci; + GCObject *up; + L->top = (L->top - oldstack) + L->stack; + for (up = L->openupval; up != NULL; up = up->gch.next) + gco2uv(up)->v = (gco2uv(up)->v - oldstack) + L->stack; + for (ci = L->ci; ci != NULL; ci = ci->previous) { + ci->top = (ci->top - oldstack) + L->stack; + ci->func = (ci->func - oldstack) + L->stack; + if (isLua(ci)) + ci->u.l.base = (ci->u.l.base - oldstack) + L->stack; + } +} + + +/* some space for error handling */ +#define ERRORSTACKSIZE (LUAI_MAXSTACK + 200) + + +void luaD_reallocstack (lua_State *L, int newsize) { + TValue *oldstack = L->stack; + int lim = L->stacksize; + lua_assert(newsize <= LUAI_MAXSTACK || newsize == ERRORSTACKSIZE); + lua_assert(L->stack_last - L->stack == L->stacksize - EXTRA_STACK); + luaM_reallocvector(L, L->stack, L->stacksize, newsize, TValue); + for (; lim < newsize; lim++) + setnilvalue(L->stack + lim); /* erase new segment */ + L->stacksize = newsize; + L->stack_last = L->stack + newsize - EXTRA_STACK; + correctstack(L, oldstack); +} + + +void luaD_growstack (lua_State *L, int n) { + int size = L->stacksize; + if (size > LUAI_MAXSTACK) /* error after extra size? */ + luaD_throw(L, LUA_ERRERR); + else { + int needed = cast_int(L->top - L->stack) + n + EXTRA_STACK; + int newsize = 2 * size; + if (newsize > LUAI_MAXSTACK) newsize = LUAI_MAXSTACK; + if (newsize < needed) newsize = needed; + if (newsize > LUAI_MAXSTACK) { /* stack overflow? */ + luaD_reallocstack(L, ERRORSTACKSIZE); + luaG_runerror(L, "stack overflow"); + } + else + luaD_reallocstack(L, newsize); + } +} + + +static int stackinuse (lua_State *L) { + CallInfo *ci; + StkId lim = L->top; + for (ci = L->ci; ci != NULL; ci = ci->previous) { + lua_assert(ci->top <= L->stack_last); + if (lim < ci->top) lim = ci->top; + } + return cast_int(lim - L->stack) + 1; /* part of stack in use */ +} + + +void luaD_shrinkstack (lua_State *L) { + int inuse = stackinuse(L); + int goodsize = inuse + (inuse / 8) + 2*EXTRA_STACK; + if (goodsize > LUAI_MAXSTACK) goodsize = LUAI_MAXSTACK; + if (inuse > LUAI_MAXSTACK || /* handling stack overflow? */ + goodsize >= L->stacksize) /* would grow instead of shrink? */ + condmovestack(L); /* don't change stack (change only for debugging) */ + else + luaD_reallocstack(L, goodsize); /* shrink it */ +} + + +void luaD_hook (lua_State *L, int event, int line) { + lua_Hook hook = L->hook; + if (hook && L->allowhook) { + CallInfo *ci = L->ci; + ptrdiff_t top = savestack(L, L->top); + ptrdiff_t ci_top = savestack(L, ci->top); + lua_Debug ar; + ar.event = event; + ar.currentline = line; + ar.i_ci = ci; + luaD_checkstack(L, LUA_MINSTACK); /* ensure minimum stack size */ + ci->top = L->top + LUA_MINSTACK; + lua_assert(ci->top <= L->stack_last); + L->allowhook = 0; /* cannot call hooks inside a hook */ + ci->callstatus |= CIST_HOOKED; + lua_unlock(L); + (*hook)(L, &ar); + lua_lock(L); + lua_assert(!L->allowhook); + L->allowhook = 1; + ci->top = restorestack(L, ci_top); + L->top = restorestack(L, top); + ci->callstatus &= ~CIST_HOOKED; + } +} + + +static void callhook (lua_State *L, CallInfo *ci) { + int hook = LUA_HOOKCALL; + ci->u.l.savedpc++; /* hooks assume 'pc' is already incremented */ + if (isLua(ci->previous) && + GET_OPCODE(*(ci->previous->u.l.savedpc - 1)) == OP_TAILCALL) { + ci->callstatus |= CIST_TAIL; + hook = LUA_HOOKTAILCALL; + } + luaD_hook(L, hook, -1); + ci->u.l.savedpc--; /* correct 'pc' */ +} + + +static StkId adjust_varargs (lua_State *L, Proto *p, int actual) { + int i; + int nfixargs = p->numparams; + StkId base, fixed; + lua_assert(actual >= nfixargs); + /* move fixed parameters to final position */ + fixed = L->top - actual; /* first fixed argument */ + base = L->top; /* final position of first argument */ + for (i=0; itop++, fixed + i); + setnilvalue(fixed + i); + } + return base; +} + + +static StkId tryfuncTM (lua_State *L, StkId func) { + const TValue *tm = luaT_gettmbyobj(L, func, TM_CALL); + StkId p; + ptrdiff_t funcr = savestack(L, func); + if (!ttisfunction(tm)) + luaG_typeerror(L, func, "call"); + /* Open a hole inside the stack at `func' */ + for (p = L->top; p > func; p--) setobjs2s(L, p, p-1); + incr_top(L); + func = restorestack(L, funcr); /* previous call may change stack */ + setobj2s(L, func, tm); /* tag method is the new function to be called */ + return func; +} + + + +#define next_ci(L) (L->ci = (L->ci->next ? L->ci->next : luaE_extendCI(L))) + + +/* +** returns true if function has been executed (C function) +*/ +int luaD_precall (lua_State *L, StkId func, int nresults) { + lua_CFunction f; + CallInfo *ci; + int n; /* number of arguments (Lua) or returns (C) */ + ptrdiff_t funcr = savestack(L, func); + switch (ttype(func)) { + case LUA_TLCF: /* light C function */ + f = fvalue(func); + goto Cfunc; + case LUA_TCCL: { /* C closure */ + f = clCvalue(func)->f; + Cfunc: + luaD_checkstack(L, LUA_MINSTACK); /* ensure minimum stack size */ + ci = next_ci(L); /* now 'enter' new function */ + ci->nresults = nresults; + ci->func = restorestack(L, funcr); + ci->top = L->top + LUA_MINSTACK; + lua_assert(ci->top <= L->stack_last); + ci->callstatus = 0; + luaC_checkGC(L); /* stack grow uses memory */ + if (L->hookmask & LUA_MASKCALL) + luaD_hook(L, LUA_HOOKCALL, -1); + lua_unlock(L); + n = (*f)(L); /* do the actual call */ + lua_lock(L); + api_checknelems(L, n); + luaD_poscall(L, L->top - n); + return 1; + } + case LUA_TLCL: { /* Lua function: prepare its call */ + StkId base; + Proto *p = clLvalue(func)->p; + luaD_checkstack(L, p->maxstacksize); + func = restorestack(L, funcr); + n = cast_int(L->top - func) - 1; /* number of real arguments */ + for (; n < p->numparams; n++) + setnilvalue(L->top++); /* complete missing arguments */ + base = (!p->is_vararg) ? func + 1 : adjust_varargs(L, p, n); + ci = next_ci(L); /* now 'enter' new function */ + ci->nresults = nresults; + ci->func = func; + ci->u.l.base = base; + ci->top = base + p->maxstacksize; + lua_assert(ci->top <= L->stack_last); + ci->u.l.savedpc = p->code; /* starting point */ + ci->callstatus = CIST_LUA; + L->top = ci->top; + luaC_checkGC(L); /* stack grow uses memory */ + if (L->hookmask & LUA_MASKCALL) + callhook(L, ci); + return 0; + } + default: { /* not a function */ + func = tryfuncTM(L, func); /* retry with 'function' tag method */ + return luaD_precall(L, func, nresults); /* now it must be a function */ + } + } +} + + +int luaD_poscall (lua_State *L, StkId firstResult) { + StkId res; + int wanted, i; + CallInfo *ci = L->ci; + if (L->hookmask & (LUA_MASKRET | LUA_MASKLINE)) { + if (L->hookmask & LUA_MASKRET) { + ptrdiff_t fr = savestack(L, firstResult); /* hook may change stack */ + luaD_hook(L, LUA_HOOKRET, -1); + firstResult = restorestack(L, fr); + } + L->oldpc = ci->previous->u.l.savedpc; /* 'oldpc' for caller function */ + } + res = ci->func; /* res == final position of 1st result */ + wanted = ci->nresults; + L->ci = ci = ci->previous; /* back to caller */ + /* move results to correct place */ + for (i = wanted; i != 0 && firstResult < L->top; i--) + setobjs2s(L, res++, firstResult++); + while (i-- > 0) + setnilvalue(res++); + L->top = res; + return (wanted - LUA_MULTRET); /* 0 iff wanted == LUA_MULTRET */ +} + + +/* +** Call a function (C or Lua). The function to be called is at *func. +** The arguments are on the stack, right after the function. +** When returns, all the results are on the stack, starting at the original +** function position. +*/ +void luaD_call (lua_State *L, StkId func, int nResults, int allowyield) { + if (++L->nCcalls >= LUAI_MAXCCALLS) { + if (L->nCcalls == LUAI_MAXCCALLS) + luaG_runerror(L, "C stack overflow"); + else if (L->nCcalls >= (LUAI_MAXCCALLS + (LUAI_MAXCCALLS>>3))) + luaD_throw(L, LUA_ERRERR); /* error while handing stack error */ + } + if (!allowyield) L->nny++; + if (!luaD_precall(L, func, nResults)) /* is a Lua function? */ + luaV_execute(L); /* call it */ + if (!allowyield) L->nny--; + L->nCcalls--; +} + + +static void finishCcall (lua_State *L) { + CallInfo *ci = L->ci; + int n; + lua_assert(ci->u.c.k != NULL); /* must have a continuation */ + lua_assert(L->nny == 0); + if (ci->callstatus & CIST_YPCALL) { /* was inside a pcall? */ + ci->callstatus &= ~CIST_YPCALL; /* finish 'lua_pcall' */ + L->errfunc = ci->u.c.old_errfunc; + } + /* finish 'lua_callk'/'lua_pcall' */ + adjustresults(L, ci->nresults); + /* call continuation function */ + if (!(ci->callstatus & CIST_STAT)) /* no call status? */ + ci->u.c.status = LUA_YIELD; /* 'default' status */ + lua_assert(ci->u.c.status != LUA_OK); + ci->callstatus = (ci->callstatus & ~(CIST_YPCALL | CIST_STAT)) | CIST_YIELDED; + lua_unlock(L); + n = (*ci->u.c.k)(L); + lua_lock(L); + api_checknelems(L, n); + /* finish 'luaD_precall' */ + luaD_poscall(L, L->top - n); +} + + +static void unroll (lua_State *L, void *ud) { + UNUSED(ud); + for (;;) { + if (L->ci == &L->base_ci) /* stack is empty? */ + return; /* coroutine finished normally */ + if (!isLua(L->ci)) /* C function? */ + finishCcall(L); + else { /* Lua function */ + luaV_finishOp(L); /* finish interrupted instruction */ + luaV_execute(L); /* execute down to higher C 'boundary' */ + } + } +} + + +/* +** check whether thread has a suspended protected call +*/ +static CallInfo *findpcall (lua_State *L) { + CallInfo *ci; + for (ci = L->ci; ci != NULL; ci = ci->previous) { /* search for a pcall */ + if (ci->callstatus & CIST_YPCALL) + return ci; + } + return NULL; /* no pending pcall */ +} + + +static int recover (lua_State *L, int status) { + StkId oldtop; + CallInfo *ci = findpcall(L); + if (ci == NULL) return 0; /* no recovery point */ + /* "finish" luaD_pcall */ + oldtop = restorestack(L, ci->extra); + luaF_close(L, oldtop); + seterrorobj(L, status, oldtop); + L->ci = ci; + L->allowhook = ci->u.c.old_allowhook; + L->nny = 0; /* should be zero to be yieldable */ + luaD_shrinkstack(L); + L->errfunc = ci->u.c.old_errfunc; + ci->callstatus |= CIST_STAT; /* call has error status */ + ci->u.c.status = status; /* (here it is) */ + return 1; /* continue running the coroutine */ +} + + +/* +** signal an error in the call to 'resume', not in the execution of the +** coroutine itself. (Such errors should not be handled by any coroutine +** error handler and should not kill the coroutine.) +*/ +static l_noret resume_error (lua_State *L, const char *msg, StkId firstArg) { + L->top = firstArg; /* remove args from the stack */ + setsvalue2s(L, L->top, luaS_new(L, msg)); /* push error message */ + api_incr_top(L); + luaD_throw(L, -1); /* jump back to 'lua_resume' */ +} + + +/* +** do the work for 'lua_resume' in protected mode +*/ +static void resume (lua_State *L, void *ud) { + int nCcalls = L->nCcalls; + StkId firstArg = cast(StkId, ud); + CallInfo *ci = L->ci; + if (nCcalls >= LUAI_MAXCCALLS) + resume_error(L, "C stack overflow", firstArg); + if (L->status == LUA_OK) { /* may be starting a coroutine */ + if (ci != &L->base_ci) /* not in base level? */ + resume_error(L, "cannot resume non-suspended coroutine", firstArg); + /* coroutine is in base level; start running it */ + if (!luaD_precall(L, firstArg - 1, LUA_MULTRET)) /* Lua function? */ + luaV_execute(L); /* call it */ + } + else if (L->status != LUA_YIELD) + resume_error(L, "cannot resume dead coroutine", firstArg); + else { /* resuming from previous yield */ + L->status = LUA_OK; + ci->func = restorestack(L, ci->extra); + if (isLua(ci)) /* yielded inside a hook? */ + luaV_execute(L); /* just continue running Lua code */ + else { /* 'common' yield */ + if (ci->u.c.k != NULL) { /* does it have a continuation? */ + int n; + ci->u.c.status = LUA_YIELD; /* 'default' status */ + ci->callstatus |= CIST_YIELDED; + lua_unlock(L); + n = (*ci->u.c.k)(L); /* call continuation */ + lua_lock(L); + api_checknelems(L, n); + firstArg = L->top - n; /* yield results come from continuation */ + } + luaD_poscall(L, firstArg); /* finish 'luaD_precall' */ + } + unroll(L, NULL); + } + lua_assert(nCcalls == L->nCcalls); +} + + +LUA_API int lua_resume (lua_State *L, lua_State *from, int nargs) { + int status; + lua_lock(L); + luai_userstateresume(L, nargs); + L->nCcalls = (from) ? from->nCcalls + 1 : 1; + L->nny = 0; /* allow yields */ + api_checknelems(L, (L->status == LUA_OK) ? nargs + 1 : nargs); + status = luaD_rawrunprotected(L, resume, L->top - nargs); + if (status == -1) /* error calling 'lua_resume'? */ + status = LUA_ERRRUN; + else { /* yield or regular error */ + while (status != LUA_OK && status != LUA_YIELD) { /* error? */ + if (recover(L, status)) /* recover point? */ + status = luaD_rawrunprotected(L, unroll, NULL); /* run continuation */ + else { /* unrecoverable error */ + L->status = cast_byte(status); /* mark thread as `dead' */ + seterrorobj(L, status, L->top); + L->ci->top = L->top; + break; + } + } + lua_assert(status == L->status); + } + L->nny = 1; /* do not allow yields */ + L->nCcalls--; + lua_assert(L->nCcalls == ((from) ? from->nCcalls : 0)); + lua_unlock(L); + return status; +} + + +LUA_API int lua_yieldk (lua_State *L, int nresults, int ctx, lua_CFunction k) { + CallInfo *ci = L->ci; + luai_userstateyield(L, nresults); + lua_lock(L); + api_checknelems(L, nresults); + if (L->nny > 0) { + if (L != G(L)->mainthread) + luaG_runerror(L, "attempt to yield across a C-call boundary"); + else + luaG_runerror(L, "attempt to yield from outside a coroutine"); + } + L->status = LUA_YIELD; + ci->extra = savestack(L, ci->func); /* save current 'func' */ + if (isLua(ci)) { /* inside a hook? */ + api_check(L, k == NULL, "hooks cannot continue after yielding"); + } + else { + if ((ci->u.c.k = k) != NULL) /* is there a continuation? */ + ci->u.c.ctx = ctx; /* save context */ + ci->func = L->top - nresults - 1; /* protect stack below results */ + luaD_throw(L, LUA_YIELD); + } + lua_assert(ci->callstatus & CIST_HOOKED); /* must be inside a hook */ + lua_unlock(L); + return 0; /* return to 'luaD_hook' */ +} + + +int luaD_pcall (lua_State *L, Pfunc func, void *u, + ptrdiff_t old_top, ptrdiff_t ef) { + int status; + CallInfo *old_ci = L->ci; + lu_byte old_allowhooks = L->allowhook; + unsigned short old_nny = L->nny; + ptrdiff_t old_errfunc = L->errfunc; + L->errfunc = ef; + status = luaD_rawrunprotected(L, func, u); + if (status != LUA_OK) { /* an error occurred? */ + StkId oldtop = restorestack(L, old_top); + luaF_close(L, oldtop); /* close possible pending closures */ + seterrorobj(L, status, oldtop); + L->ci = old_ci; + L->allowhook = old_allowhooks; + L->nny = old_nny; + luaD_shrinkstack(L); + } + L->errfunc = old_errfunc; + return status; +} + + + +/* +** Execute a protected parser. +*/ +struct SParser { /* data to `f_parser' */ + ZIO *z; + Mbuffer buff; /* dynamic structure used by the scanner */ + Dyndata dyd; /* dynamic structures used by the parser */ + const char *mode; + const char *name; +}; + + +static void checkmode (lua_State *L, const char *mode, const char *x) { + if (mode && strchr(mode, x[0]) == NULL) { + luaO_pushfstring(L, + "attempt to load a %s chunk (mode is " LUA_QS ")", x, mode); + luaD_throw(L, LUA_ERRSYNTAX); + } +} + + +static void f_parser (lua_State *L, void *ud) { + int i; + Closure *cl; + struct SParser *p = cast(struct SParser *, ud); + int c = zgetc(p->z); /* read first character */ + if (c == LUA_SIGNATURE[0]) { + checkmode(L, p->mode, "binary"); + cl = luaU_undump(L, p->z, &p->buff, p->name); + } + else { + checkmode(L, p->mode, "text"); + cl = luaY_parser(L, p->z, &p->buff, &p->dyd, p->name, c); + } + lua_assert(cl->l.nupvalues == cl->l.p->sizeupvalues); + for (i = 0; i < cl->l.nupvalues; i++) { /* initialize upvalues */ + UpVal *up = luaF_newupval(L); + cl->l.upvals[i] = up; + luaC_objbarrier(L, cl, up); + } +} + + +int luaD_protectedparser (lua_State *L, ZIO *z, const char *name, + const char *mode) { + struct SParser p; + int status; + L->nny++; /* cannot yield during parsing */ + p.z = z; p.name = name; p.mode = mode; + p.dyd.actvar.arr = NULL; p.dyd.actvar.size = 0; + p.dyd.gt.arr = NULL; p.dyd.gt.size = 0; + p.dyd.label.arr = NULL; p.dyd.label.size = 0; + luaZ_initbuffer(L, &p.buff); + status = luaD_pcall(L, f_parser, &p, savestack(L, L->top), L->errfunc); + luaZ_freebuffer(L, &p.buff); + luaM_freearray(L, p.dyd.actvar.arr, p.dyd.actvar.size); + luaM_freearray(L, p.dyd.gt.arr, p.dyd.gt.size); + luaM_freearray(L, p.dyd.label.arr, p.dyd.label.size); + L->nny--; + return status; +} + + diff --git a/liblua/ldo.h b/liblua/ldo.h new file mode 100644 index 00000000..27b837d9 --- /dev/null +++ b/liblua/ldo.h @@ -0,0 +1,46 @@ +/* +** $Id: ldo.h,v 2.20 2011/11/29 15:55:08 roberto Exp $ +** Stack and Call structure of Lua +** See Copyright Notice in lua.h +*/ + +#ifndef ldo_h +#define ldo_h + + +#include "lobject.h" +#include "lstate.h" +#include "lzio.h" + + +#define luaD_checkstack(L,n) if (L->stack_last - L->top <= (n)) \ + luaD_growstack(L, n); else condmovestack(L); + + +#define incr_top(L) {L->top++; luaD_checkstack(L,0);} + +#define savestack(L,p) ((char *)(p) - (char *)L->stack) +#define restorestack(L,n) ((TValue *)((char *)L->stack + (n))) + + +/* type of protected functions, to be ran by `runprotected' */ +typedef void (*Pfunc) (lua_State *L, void *ud); + +LUAI_FUNC int luaD_protectedparser (lua_State *L, ZIO *z, const char *name, + const char *mode); +LUAI_FUNC void luaD_hook (lua_State *L, int event, int line); +LUAI_FUNC int luaD_precall (lua_State *L, StkId func, int nresults); +LUAI_FUNC void luaD_call (lua_State *L, StkId func, int nResults, + int allowyield); +LUAI_FUNC int luaD_pcall (lua_State *L, Pfunc func, void *u, + ptrdiff_t oldtop, ptrdiff_t ef); +LUAI_FUNC int luaD_poscall (lua_State *L, StkId firstResult); +LUAI_FUNC void luaD_reallocstack (lua_State *L, int newsize); +LUAI_FUNC void luaD_growstack (lua_State *L, int n); +LUAI_FUNC void luaD_shrinkstack (lua_State *L); + +LUAI_FUNC l_noret luaD_throw (lua_State *L, int errcode); +LUAI_FUNC int luaD_rawrunprotected (lua_State *L, Pfunc f, void *ud); + +#endif + diff --git a/liblua/ldump.c b/liblua/ldump.c new file mode 100644 index 00000000..d5e6a47c --- /dev/null +++ b/liblua/ldump.c @@ -0,0 +1,173 @@ +/* +** $Id: ldump.c,v 2.17 2012/01/23 23:02:10 roberto Exp $ +** save precompiled Lua chunks +** See Copyright Notice in lua.h +*/ + +#include + +#define ldump_c +#define LUA_CORE + +#include "lua.h" + +#include "lobject.h" +#include "lstate.h" +#include "lundump.h" + +typedef struct { + lua_State* L; + lua_Writer writer; + void* data; + int strip; + int status; +} DumpState; + +#define DumpMem(b,n,size,D) DumpBlock(b,(n)*(size),D) +#define DumpVar(x,D) DumpMem(&x,1,sizeof(x),D) + +static void DumpBlock(const void* b, size_t size, DumpState* D) +{ + if (D->status==0) + { + lua_unlock(D->L); + D->status=(*D->writer)(D->L,b,size,D->data); + lua_lock(D->L); + } +} + +static void DumpChar(int y, DumpState* D) +{ + char x=(char)y; + DumpVar(x,D); +} + +static void DumpInt(int x, DumpState* D) +{ + DumpVar(x,D); +} + +static void DumpNumber(lua_Number x, DumpState* D) +{ + DumpVar(x,D); +} + +static void DumpVector(const void* b, int n, size_t size, DumpState* D) +{ + DumpInt(n,D); + DumpMem(b,n,size,D); +} + +static void DumpString(const TString* s, DumpState* D) +{ + if (s==NULL) + { + size_t size=0; + DumpVar(size,D); + } + else + { + size_t size=s->tsv.len+1; /* include trailing '\0' */ + DumpVar(size,D); + DumpBlock(getstr(s),size*sizeof(char),D); + } +} + +#define DumpCode(f,D) DumpVector(f->code,f->sizecode,sizeof(Instruction),D) + +static void DumpFunction(const Proto* f, DumpState* D); + +static void DumpConstants(const Proto* f, DumpState* D) +{ + int i,n=f->sizek; + DumpInt(n,D); + for (i=0; ik[i]; + DumpChar(ttypenv(o),D); + switch (ttypenv(o)) + { + case LUA_TNIL: + break; + case LUA_TBOOLEAN: + DumpChar(bvalue(o),D); + break; + case LUA_TNUMBER: + DumpNumber(nvalue(o),D); + break; + case LUA_TSTRING: + DumpString(rawtsvalue(o),D); + break; + default: lua_assert(0); + } + } + n=f->sizep; + DumpInt(n,D); + for (i=0; ip[i],D); +} + +static void DumpUpvalues(const Proto* f, DumpState* D) +{ + int i,n=f->sizeupvalues; + DumpInt(n,D); + for (i=0; iupvalues[i].instack,D); + DumpChar(f->upvalues[i].idx,D); + } +} + +static void DumpDebug(const Proto* f, DumpState* D) +{ + int i,n; + DumpString((D->strip) ? NULL : f->source,D); + n= (D->strip) ? 0 : f->sizelineinfo; + DumpVector(f->lineinfo,n,sizeof(int),D); + n= (D->strip) ? 0 : f->sizelocvars; + DumpInt(n,D); + for (i=0; ilocvars[i].varname,D); + DumpInt(f->locvars[i].startpc,D); + DumpInt(f->locvars[i].endpc,D); + } + n= (D->strip) ? 0 : f->sizeupvalues; + DumpInt(n,D); + for (i=0; iupvalues[i].name,D); +} + +static void DumpFunction(const Proto* f, DumpState* D) +{ + DumpInt(f->linedefined,D); + DumpInt(f->lastlinedefined,D); + DumpChar(f->numparams,D); + DumpChar(f->is_vararg,D); + DumpChar(f->maxstacksize,D); + DumpCode(f,D); + DumpConstants(f,D); + DumpUpvalues(f,D); + DumpDebug(f,D); +} + +static void DumpHeader(DumpState* D) +{ + lu_byte h[LUAC_HEADERSIZE]; + luaU_header(h); + DumpBlock(h,LUAC_HEADERSIZE,D); +} + +/* +** dump Lua function as precompiled chunk +*/ +int luaU_dump (lua_State* L, const Proto* f, lua_Writer w, void* data, int strip) +{ + DumpState D; + D.L=L; + D.writer=w; + D.data=data; + D.strip=strip; + D.status=0; + DumpHeader(&D); + DumpFunction(f,&D); + return D.status; +} diff --git a/liblua/lfunc.c b/liblua/lfunc.c new file mode 100644 index 00000000..c2128405 --- /dev/null +++ b/liblua/lfunc.c @@ -0,0 +1,161 @@ +/* +** $Id: lfunc.c,v 2.30 2012/10/03 12:36:46 roberto Exp $ +** Auxiliary functions to manipulate prototypes and closures +** See Copyright Notice in lua.h +*/ + + +#include + +#define lfunc_c +#define LUA_CORE + +#include "lua.h" + +#include "lfunc.h" +#include "lgc.h" +#include "lmem.h" +#include "lobject.h" +#include "lstate.h" + + + +Closure *luaF_newCclosure (lua_State *L, int n) { + Closure *c = &luaC_newobj(L, LUA_TCCL, sizeCclosure(n), NULL, 0)->cl; + c->c.nupvalues = cast_byte(n); + return c; +} + + +Closure *luaF_newLclosure (lua_State *L, int n) { + Closure *c = &luaC_newobj(L, LUA_TLCL, sizeLclosure(n), NULL, 0)->cl; + c->l.p = NULL; + c->l.nupvalues = cast_byte(n); + while (n--) c->l.upvals[n] = NULL; + return c; +} + + +UpVal *luaF_newupval (lua_State *L) { + UpVal *uv = &luaC_newobj(L, LUA_TUPVAL, sizeof(UpVal), NULL, 0)->uv; + uv->v = &uv->u.value; + setnilvalue(uv->v); + return uv; +} + + +UpVal *luaF_findupval (lua_State *L, StkId level) { + global_State *g = G(L); + GCObject **pp = &L->openupval; + UpVal *p; + UpVal *uv; + while (*pp != NULL && (p = gco2uv(*pp))->v >= level) { + GCObject *o = obj2gco(p); + lua_assert(p->v != &p->u.value); + lua_assert(!isold(o) || isold(obj2gco(L))); + if (p->v == level) { /* found a corresponding upvalue? */ + if (isdead(g, o)) /* is it dead? */ + changewhite(o); /* resurrect it */ + return p; + } + pp = &p->next; + } + /* not found: create a new one */ + uv = &luaC_newobj(L, LUA_TUPVAL, sizeof(UpVal), pp, 0)->uv; + uv->v = level; /* current value lives in the stack */ + uv->u.l.prev = &g->uvhead; /* double link it in `uvhead' list */ + uv->u.l.next = g->uvhead.u.l.next; + uv->u.l.next->u.l.prev = uv; + g->uvhead.u.l.next = uv; + lua_assert(uv->u.l.next->u.l.prev == uv && uv->u.l.prev->u.l.next == uv); + return uv; +} + + +static void unlinkupval (UpVal *uv) { + lua_assert(uv->u.l.next->u.l.prev == uv && uv->u.l.prev->u.l.next == uv); + uv->u.l.next->u.l.prev = uv->u.l.prev; /* remove from `uvhead' list */ + uv->u.l.prev->u.l.next = uv->u.l.next; +} + + +void luaF_freeupval (lua_State *L, UpVal *uv) { + if (uv->v != &uv->u.value) /* is it open? */ + unlinkupval(uv); /* remove from open list */ + luaM_free(L, uv); /* free upvalue */ +} + + +void luaF_close (lua_State *L, StkId level) { + UpVal *uv; + global_State *g = G(L); + while (L->openupval != NULL && (uv = gco2uv(L->openupval))->v >= level) { + GCObject *o = obj2gco(uv); + lua_assert(!isblack(o) && uv->v != &uv->u.value); + L->openupval = uv->next; /* remove from `open' list */ + if (isdead(g, o)) + luaF_freeupval(L, uv); /* free upvalue */ + else { + unlinkupval(uv); /* remove upvalue from 'uvhead' list */ + setobj(L, &uv->u.value, uv->v); /* move value to upvalue slot */ + uv->v = &uv->u.value; /* now current value lives here */ + gch(o)->next = g->allgc; /* link upvalue into 'allgc' list */ + g->allgc = o; + luaC_checkupvalcolor(g, uv); + } + } +} + + +Proto *luaF_newproto (lua_State *L) { + Proto *f = &luaC_newobj(L, LUA_TPROTO, sizeof(Proto), NULL, 0)->p; + f->k = NULL; + f->sizek = 0; + f->p = NULL; + f->sizep = 0; + f->code = NULL; + f->cache = NULL; + f->sizecode = 0; + f->lineinfo = NULL; + f->sizelineinfo = 0; + f->upvalues = NULL; + f->sizeupvalues = 0; + f->numparams = 0; + f->is_vararg = 0; + f->maxstacksize = 0; + f->locvars = NULL; + f->sizelocvars = 0; + f->linedefined = 0; + f->lastlinedefined = 0; + f->source = NULL; + return f; +} + + +void luaF_freeproto (lua_State *L, Proto *f) { + luaM_freearray(L, f->code, f->sizecode); + luaM_freearray(L, f->p, f->sizep); + luaM_freearray(L, f->k, f->sizek); + luaM_freearray(L, f->lineinfo, f->sizelineinfo); + luaM_freearray(L, f->locvars, f->sizelocvars); + luaM_freearray(L, f->upvalues, f->sizeupvalues); + luaM_free(L, f); +} + + +/* +** Look for n-th local variable at line `line' in function `func'. +** Returns NULL if not found. +*/ +const char *luaF_getlocalname (const Proto *f, int local_number, int pc) { + int i; + for (i = 0; isizelocvars && f->locvars[i].startpc <= pc; i++) { + if (pc < f->locvars[i].endpc) { /* is variable active? */ + local_number--; + if (local_number == 0) + return getstr(f->locvars[i].varname); + } + } + return NULL; /* not found */ +} + diff --git a/liblua/lfunc.h b/liblua/lfunc.h new file mode 100644 index 00000000..e236a717 --- /dev/null +++ b/liblua/lfunc.h @@ -0,0 +1,33 @@ +/* +** $Id: lfunc.h,v 2.8 2012/05/08 13:53:33 roberto Exp $ +** Auxiliary functions to manipulate prototypes and closures +** See Copyright Notice in lua.h +*/ + +#ifndef lfunc_h +#define lfunc_h + + +#include "lobject.h" + + +#define sizeCclosure(n) (cast(int, sizeof(CClosure)) + \ + cast(int, sizeof(TValue)*((n)-1))) + +#define sizeLclosure(n) (cast(int, sizeof(LClosure)) + \ + cast(int, sizeof(TValue *)*((n)-1))) + + +LUAI_FUNC Proto *luaF_newproto (lua_State *L); +LUAI_FUNC Closure *luaF_newCclosure (lua_State *L, int nelems); +LUAI_FUNC Closure *luaF_newLclosure (lua_State *L, int nelems); +LUAI_FUNC UpVal *luaF_newupval (lua_State *L); +LUAI_FUNC UpVal *luaF_findupval (lua_State *L, StkId level); +LUAI_FUNC void luaF_close (lua_State *L, StkId level); +LUAI_FUNC void luaF_freeproto (lua_State *L, Proto *f); +LUAI_FUNC void luaF_freeupval (lua_State *L, UpVal *uv); +LUAI_FUNC const char *luaF_getlocalname (const Proto *func, int local_number, + int pc); + + +#endif diff --git a/liblua/lgc.c b/liblua/lgc.c new file mode 100644 index 00000000..535e988a --- /dev/null +++ b/liblua/lgc.c @@ -0,0 +1,1213 @@ +/* +** $Id: lgc.c,v 2.140 2013/03/16 21:10:18 roberto Exp $ +** Garbage Collector +** See Copyright Notice in lua.h +*/ + +#include + +#define lgc_c +#define LUA_CORE + +#include "lua.h" + +#include "ldebug.h" +#include "ldo.h" +#include "lfunc.h" +#include "lgc.h" +#include "lmem.h" +#include "lobject.h" +#include "lstate.h" +#include "lstring.h" +#include "ltable.h" +#include "ltm.h" + + + +/* +** cost of sweeping one element (the size of a small object divided +** by some adjust for the sweep speed) +*/ +#define GCSWEEPCOST ((sizeof(TString) + 4) / 4) + +/* maximum number of elements to sweep in each single step */ +#define GCSWEEPMAX (cast_int((GCSTEPSIZE / GCSWEEPCOST) / 4)) + +/* maximum number of finalizers to call in each GC step */ +#define GCFINALIZENUM 4 + + +/* +** macro to adjust 'stepmul': 'stepmul' is actually used like +** 'stepmul / STEPMULADJ' (value chosen by tests) +*/ +#define STEPMULADJ 200 + + +/* +** macro to adjust 'pause': 'pause' is actually used like +** 'pause / PAUSEADJ' (value chosen by tests) +*/ +#define PAUSEADJ 100 + + +/* +** 'makewhite' erases all color bits plus the old bit and then +** sets only the current white bit +*/ +#define maskcolors (~(bit2mask(BLACKBIT, OLDBIT) | WHITEBITS)) +#define makewhite(g,x) \ + (gch(x)->marked = cast_byte((gch(x)->marked & maskcolors) | luaC_white(g))) + +#define white2gray(x) resetbits(gch(x)->marked, WHITEBITS) +#define black2gray(x) resetbit(gch(x)->marked, BLACKBIT) + + +#define isfinalized(x) testbit(gch(x)->marked, FINALIZEDBIT) + +#define checkdeadkey(n) lua_assert(!ttisdeadkey(gkey(n)) || ttisnil(gval(n))) + + +#define checkconsistency(obj) \ + lua_longassert(!iscollectable(obj) || righttt(obj)) + + +#define markvalue(g,o) { checkconsistency(o); \ + if (valiswhite(o)) reallymarkobject(g,gcvalue(o)); } + +#define markobject(g,t) { if ((t) && iswhite(obj2gco(t))) \ + reallymarkobject(g, obj2gco(t)); } + +static void reallymarkobject (global_State *g, GCObject *o); + + +/* +** {====================================================== +** Generic functions +** ======================================================= +*/ + + +/* +** one after last element in a hash array +*/ +#define gnodelast(h) gnode(h, cast(size_t, sizenode(h))) + + +/* +** link table 'h' into list pointed by 'p' +*/ +#define linktable(h,p) ((h)->gclist = *(p), *(p) = obj2gco(h)) + + +/* +** if key is not marked, mark its entry as dead (therefore removing it +** from the table) +*/ +static void removeentry (Node *n) { + lua_assert(ttisnil(gval(n))); + if (valiswhite(gkey(n))) + setdeadvalue(gkey(n)); /* unused and unmarked key; remove it */ +} + + +/* +** tells whether a key or value can be cleared from a weak +** table. Non-collectable objects are never removed from weak +** tables. Strings behave as `values', so are never removed too. for +** other objects: if really collected, cannot keep them; for objects +** being finalized, keep them in keys, but not in values +*/ +static int iscleared (global_State *g, const TValue *o) { + if (!iscollectable(o)) return 0; + else if (ttisstring(o)) { + markobject(g, rawtsvalue(o)); /* strings are `values', so are never weak */ + return 0; + } + else return iswhite(gcvalue(o)); +} + + +/* +** barrier that moves collector forward, that is, mark the white object +** being pointed by a black object. +*/ +void luaC_barrier_ (lua_State *L, GCObject *o, GCObject *v) { + global_State *g = G(L); + lua_assert(isblack(o) && iswhite(v) && !isdead(g, v) && !isdead(g, o)); + lua_assert(g->gcstate != GCSpause); + lua_assert(gch(o)->tt != LUA_TTABLE); + if (keepinvariantout(g)) /* must keep invariant? */ + reallymarkobject(g, v); /* restore invariant */ + else { /* sweep phase */ + lua_assert(issweepphase(g)); + makewhite(g, o); /* mark main obj. as white to avoid other barriers */ + } +} + + +/* +** barrier that moves collector backward, that is, mark the black object +** pointing to a white object as gray again. (Current implementation +** only works for tables; access to 'gclist' is not uniform across +** different types.) +*/ +void luaC_barrierback_ (lua_State *L, GCObject *o) { + global_State *g = G(L); + lua_assert(isblack(o) && !isdead(g, o) && gch(o)->tt == LUA_TTABLE); + black2gray(o); /* make object gray (again) */ + gco2t(o)->gclist = g->grayagain; + g->grayagain = o; +} + + +/* +** barrier for prototypes. When creating first closure (cache is +** NULL), use a forward barrier; this may be the only closure of the +** prototype (if it is a "regular" function, with a single instance) +** and the prototype may be big, so it is better to avoid traversing +** it again. Otherwise, use a backward barrier, to avoid marking all +** possible instances. +*/ +LUAI_FUNC void luaC_barrierproto_ (lua_State *L, Proto *p, Closure *c) { + global_State *g = G(L); + lua_assert(isblack(obj2gco(p))); + if (p->cache == NULL) { /* first time? */ + luaC_objbarrier(L, p, c); + } + else { /* use a backward barrier */ + black2gray(obj2gco(p)); /* make prototype gray (again) */ + p->gclist = g->grayagain; + g->grayagain = obj2gco(p); + } +} + + +/* +** check color (and invariants) for an upvalue that was closed, +** i.e., moved into the 'allgc' list +*/ +void luaC_checkupvalcolor (global_State *g, UpVal *uv) { + GCObject *o = obj2gco(uv); + lua_assert(!isblack(o)); /* open upvalues are never black */ + if (isgray(o)) { + if (keepinvariant(g)) { + resetoldbit(o); /* see MOVE OLD rule */ + gray2black(o); /* it is being visited now */ + markvalue(g, uv->v); + } + else { + lua_assert(issweepphase(g)); + makewhite(g, o); + } + } +} + + +/* +** create a new collectable object (with given type and size) and link +** it to '*list'. 'offset' tells how many bytes to allocate before the +** object itself (used only by states). +*/ +GCObject *luaC_newobj (lua_State *L, int tt, size_t sz, GCObject **list, + int offset) { + global_State *g = G(L); + char *raw = cast(char *, luaM_newobject(L, novariant(tt), sz)); + GCObject *o = obj2gco(raw + offset); + if (list == NULL) + list = &g->allgc; /* standard list for collectable objects */ + gch(o)->marked = luaC_white(g); + gch(o)->tt = tt; + gch(o)->next = *list; + *list = o; + return o; +} + +/* }====================================================== */ + + + +/* +** {====================================================== +** Mark functions +** ======================================================= +*/ + + +/* +** mark an object. Userdata, strings, and closed upvalues are visited +** and turned black here. Other objects are marked gray and added +** to appropriate list to be visited (and turned black) later. (Open +** upvalues are already linked in 'headuv' list.) +*/ +static void reallymarkobject (global_State *g, GCObject *o) { + lu_mem size; + white2gray(o); + switch (gch(o)->tt) { + case LUA_TSHRSTR: + case LUA_TLNGSTR: { + size = sizestring(gco2ts(o)); + break; /* nothing else to mark; make it black */ + } + case LUA_TUSERDATA: { + Table *mt = gco2u(o)->metatable; + markobject(g, mt); + markobject(g, gco2u(o)->env); + size = sizeudata(gco2u(o)); + break; + } + case LUA_TUPVAL: { + UpVal *uv = gco2uv(o); + markvalue(g, uv->v); + if (uv->v != &uv->u.value) /* open? */ + return; /* open upvalues remain gray */ + size = sizeof(UpVal); + break; + } + case LUA_TLCL: { + gco2lcl(o)->gclist = g->gray; + g->gray = o; + return; + } + case LUA_TCCL: { + gco2ccl(o)->gclist = g->gray; + g->gray = o; + return; + } + case LUA_TTABLE: { + linktable(gco2t(o), &g->gray); + return; + } + case LUA_TTHREAD: { + gco2th(o)->gclist = g->gray; + g->gray = o; + return; + } + case LUA_TPROTO: { + gco2p(o)->gclist = g->gray; + g->gray = o; + return; + } + default: lua_assert(0); return; + } + gray2black(o); + g->GCmemtrav += size; +} + + +/* +** mark metamethods for basic types +*/ +static void markmt (global_State *g) { + int i; + for (i=0; i < LUA_NUMTAGS; i++) + markobject(g, g->mt[i]); +} + + +/* +** mark all objects in list of being-finalized +*/ +static void markbeingfnz (global_State *g) { + GCObject *o; + for (o = g->tobefnz; o != NULL; o = gch(o)->next) { + makewhite(g, o); + reallymarkobject(g, o); + } +} + + +/* +** mark all values stored in marked open upvalues. (See comment in +** 'lstate.h'.) +*/ +static void remarkupvals (global_State *g) { + UpVal *uv; + for (uv = g->uvhead.u.l.next; uv != &g->uvhead; uv = uv->u.l.next) { + if (isgray(obj2gco(uv))) + markvalue(g, uv->v); + } +} + + +/* +** mark root set and reset all gray lists, to start a new +** incremental (or full) collection +*/ +static void restartcollection (global_State *g) { + g->gray = g->grayagain = NULL; + g->weak = g->allweak = g->ephemeron = NULL; + markobject(g, g->mainthread); + markvalue(g, &g->l_registry); + markmt(g); + markbeingfnz(g); /* mark any finalizing object left from previous cycle */ +} + +/* }====================================================== */ + + +/* +** {====================================================== +** Traverse functions +** ======================================================= +*/ + +static void traverseweakvalue (global_State *g, Table *h) { + Node *n, *limit = gnodelast(h); + /* if there is array part, assume it may have white values (do not + traverse it just to check) */ + int hasclears = (h->sizearray > 0); + for (n = gnode(h, 0); n < limit; n++) { + checkdeadkey(n); + if (ttisnil(gval(n))) /* entry is empty? */ + removeentry(n); /* remove it */ + else { + lua_assert(!ttisnil(gkey(n))); + markvalue(g, gkey(n)); /* mark key */ + if (!hasclears && iscleared(g, gval(n))) /* is there a white value? */ + hasclears = 1; /* table will have to be cleared */ + } + } + if (hasclears) + linktable(h, &g->weak); /* has to be cleared later */ + else /* no white values */ + linktable(h, &g->grayagain); /* no need to clean */ +} + + +static int traverseephemeron (global_State *g, Table *h) { + int marked = 0; /* true if an object is marked in this traversal */ + int hasclears = 0; /* true if table has white keys */ + int prop = 0; /* true if table has entry "white-key -> white-value" */ + Node *n, *limit = gnodelast(h); + int i; + /* traverse array part (numeric keys are 'strong') */ + for (i = 0; i < h->sizearray; i++) { + if (valiswhite(&h->array[i])) { + marked = 1; + reallymarkobject(g, gcvalue(&h->array[i])); + } + } + /* traverse hash part */ + for (n = gnode(h, 0); n < limit; n++) { + checkdeadkey(n); + if (ttisnil(gval(n))) /* entry is empty? */ + removeentry(n); /* remove it */ + else if (iscleared(g, gkey(n))) { /* key is not marked (yet)? */ + hasclears = 1; /* table must be cleared */ + if (valiswhite(gval(n))) /* value not marked yet? */ + prop = 1; /* must propagate again */ + } + else if (valiswhite(gval(n))) { /* value not marked yet? */ + marked = 1; + reallymarkobject(g, gcvalue(gval(n))); /* mark it now */ + } + } + if (prop) + linktable(h, &g->ephemeron); /* have to propagate again */ + else if (hasclears) /* does table have white keys? */ + linktable(h, &g->allweak); /* may have to clean white keys */ + else /* no white keys */ + linktable(h, &g->grayagain); /* no need to clean */ + return marked; +} + + +static void traversestrongtable (global_State *g, Table *h) { + Node *n, *limit = gnodelast(h); + int i; + for (i = 0; i < h->sizearray; i++) /* traverse array part */ + markvalue(g, &h->array[i]); + for (n = gnode(h, 0); n < limit; n++) { /* traverse hash part */ + checkdeadkey(n); + if (ttisnil(gval(n))) /* entry is empty? */ + removeentry(n); /* remove it */ + else { + lua_assert(!ttisnil(gkey(n))); + markvalue(g, gkey(n)); /* mark key */ + markvalue(g, gval(n)); /* mark value */ + } + } +} + + +static lu_mem traversetable (global_State *g, Table *h) { + const char *weakkey, *weakvalue; + const TValue *mode = gfasttm(g, h->metatable, TM_MODE); + markobject(g, h->metatable); + if (mode && ttisstring(mode) && /* is there a weak mode? */ + ((weakkey = strchr(svalue(mode), 'k')), + (weakvalue = strchr(svalue(mode), 'v')), + (weakkey || weakvalue))) { /* is really weak? */ + black2gray(obj2gco(h)); /* keep table gray */ + if (!weakkey) /* strong keys? */ + traverseweakvalue(g, h); + else if (!weakvalue) /* strong values? */ + traverseephemeron(g, h); + else /* all weak */ + linktable(h, &g->allweak); /* nothing to traverse now */ + } + else /* not weak */ + traversestrongtable(g, h); + return sizeof(Table) + sizeof(TValue) * h->sizearray + + sizeof(Node) * cast(size_t, sizenode(h)); +} + + +static int traverseproto (global_State *g, Proto *f) { + int i; + if (f->cache && iswhite(obj2gco(f->cache))) + f->cache = NULL; /* allow cache to be collected */ + markobject(g, f->source); + for (i = 0; i < f->sizek; i++) /* mark literals */ + markvalue(g, &f->k[i]); + for (i = 0; i < f->sizeupvalues; i++) /* mark upvalue names */ + markobject(g, f->upvalues[i].name); + for (i = 0; i < f->sizep; i++) /* mark nested protos */ + markobject(g, f->p[i]); + for (i = 0; i < f->sizelocvars; i++) /* mark local-variable names */ + markobject(g, f->locvars[i].varname); + return sizeof(Proto) + sizeof(Instruction) * f->sizecode + + sizeof(Proto *) * f->sizep + + sizeof(TValue) * f->sizek + + sizeof(int) * f->sizelineinfo + + sizeof(LocVar) * f->sizelocvars + + sizeof(Upvaldesc) * f->sizeupvalues; +} + + +static lu_mem traverseCclosure (global_State *g, CClosure *cl) { + int i; + for (i = 0; i < cl->nupvalues; i++) /* mark its upvalues */ + markvalue(g, &cl->upvalue[i]); + return sizeCclosure(cl->nupvalues); +} + +static lu_mem traverseLclosure (global_State *g, LClosure *cl) { + int i; + markobject(g, cl->p); /* mark its prototype */ + for (i = 0; i < cl->nupvalues; i++) /* mark its upvalues */ + markobject(g, cl->upvals[i]); + return sizeLclosure(cl->nupvalues); +} + + +static lu_mem traversestack (global_State *g, lua_State *th) { + StkId o = th->stack; + if (o == NULL) + return 1; /* stack not completely built yet */ + for (; o < th->top; o++) + markvalue(g, o); + if (g->gcstate == GCSatomic) { /* final traversal? */ + StkId lim = th->stack + th->stacksize; /* real end of stack */ + for (; o < lim; o++) /* clear not-marked stack slice */ + setnilvalue(o); + } + return sizeof(lua_State) + sizeof(TValue) * th->stacksize; +} + + +/* +** traverse one gray object, turning it to black (except for threads, +** which are always gray). +*/ +static void propagatemark (global_State *g) { + lu_mem size; + GCObject *o = g->gray; + lua_assert(isgray(o)); + gray2black(o); + switch (gch(o)->tt) { + case LUA_TTABLE: { + Table *h = gco2t(o); + g->gray = h->gclist; /* remove from 'gray' list */ + size = traversetable(g, h); + break; + } + case LUA_TLCL: { + LClosure *cl = gco2lcl(o); + g->gray = cl->gclist; /* remove from 'gray' list */ + size = traverseLclosure(g, cl); + break; + } + case LUA_TCCL: { + CClosure *cl = gco2ccl(o); + g->gray = cl->gclist; /* remove from 'gray' list */ + size = traverseCclosure(g, cl); + break; + } + case LUA_TTHREAD: { + lua_State *th = gco2th(o); + g->gray = th->gclist; /* remove from 'gray' list */ + th->gclist = g->grayagain; + g->grayagain = o; /* insert into 'grayagain' list */ + black2gray(o); + size = traversestack(g, th); + break; + } + case LUA_TPROTO: { + Proto *p = gco2p(o); + g->gray = p->gclist; /* remove from 'gray' list */ + size = traverseproto(g, p); + break; + } + default: lua_assert(0); return; + } + g->GCmemtrav += size; +} + + +static void propagateall (global_State *g) { + while (g->gray) propagatemark(g); +} + + +static void propagatelist (global_State *g, GCObject *l) { + lua_assert(g->gray == NULL); /* no grays left */ + g->gray = l; + propagateall(g); /* traverse all elements from 'l' */ +} + +/* +** retraverse all gray lists. Because tables may be reinserted in other +** lists when traversed, traverse the original lists to avoid traversing +** twice the same table (which is not wrong, but inefficient) +*/ +static void retraversegrays (global_State *g) { + GCObject *weak = g->weak; /* save original lists */ + GCObject *grayagain = g->grayagain; + GCObject *ephemeron = g->ephemeron; + g->weak = g->grayagain = g->ephemeron = NULL; + propagateall(g); /* traverse main gray list */ + propagatelist(g, grayagain); + propagatelist(g, weak); + propagatelist(g, ephemeron); +} + + +static void convergeephemerons (global_State *g) { + int changed; + do { + GCObject *w; + GCObject *next = g->ephemeron; /* get ephemeron list */ + g->ephemeron = NULL; /* tables will return to this list when traversed */ + changed = 0; + while ((w = next) != NULL) { + next = gco2t(w)->gclist; + if (traverseephemeron(g, gco2t(w))) { /* traverse marked some value? */ + propagateall(g); /* propagate changes */ + changed = 1; /* will have to revisit all ephemeron tables */ + } + } + } while (changed); +} + +/* }====================================================== */ + + +/* +** {====================================================== +** Sweep Functions +** ======================================================= +*/ + + +/* +** clear entries with unmarked keys from all weaktables in list 'l' up +** to element 'f' +*/ +static void clearkeys (global_State *g, GCObject *l, GCObject *f) { + for (; l != f; l = gco2t(l)->gclist) { + Table *h = gco2t(l); + Node *n, *limit = gnodelast(h); + for (n = gnode(h, 0); n < limit; n++) { + if (!ttisnil(gval(n)) && (iscleared(g, gkey(n)))) { + setnilvalue(gval(n)); /* remove value ... */ + removeentry(n); /* and remove entry from table */ + } + } + } +} + + +/* +** clear entries with unmarked values from all weaktables in list 'l' up +** to element 'f' +*/ +static void clearvalues (global_State *g, GCObject *l, GCObject *f) { + for (; l != f; l = gco2t(l)->gclist) { + Table *h = gco2t(l); + Node *n, *limit = gnodelast(h); + int i; + for (i = 0; i < h->sizearray; i++) { + TValue *o = &h->array[i]; + if (iscleared(g, o)) /* value was collected? */ + setnilvalue(o); /* remove value */ + } + for (n = gnode(h, 0); n < limit; n++) { + if (!ttisnil(gval(n)) && iscleared(g, gval(n))) { + setnilvalue(gval(n)); /* remove value ... */ + removeentry(n); /* and remove entry from table */ + } + } + } +} + + +static void freeobj (lua_State *L, GCObject *o) { + switch (gch(o)->tt) { + case LUA_TPROTO: luaF_freeproto(L, gco2p(o)); break; + case LUA_TLCL: { + luaM_freemem(L, o, sizeLclosure(gco2lcl(o)->nupvalues)); + break; + } + case LUA_TCCL: { + luaM_freemem(L, o, sizeCclosure(gco2ccl(o)->nupvalues)); + break; + } + case LUA_TUPVAL: luaF_freeupval(L, gco2uv(o)); break; + case LUA_TTABLE: luaH_free(L, gco2t(o)); break; + case LUA_TTHREAD: luaE_freethread(L, gco2th(o)); break; + case LUA_TUSERDATA: luaM_freemem(L, o, sizeudata(gco2u(o))); break; + case LUA_TSHRSTR: + G(L)->strt.nuse--; + /* go through */ + case LUA_TLNGSTR: { + luaM_freemem(L, o, sizestring(gco2ts(o))); + break; + } + default: lua_assert(0); + } +} + + +#define sweepwholelist(L,p) sweeplist(L,p,MAX_LUMEM) +static GCObject **sweeplist (lua_State *L, GCObject **p, lu_mem count); + + +/* +** sweep the (open) upvalues of a thread and resize its stack and +** list of call-info structures. +*/ +static void sweepthread (lua_State *L, lua_State *L1) { + if (L1->stack == NULL) return; /* stack not completely built yet */ + sweepwholelist(L, &L1->openupval); /* sweep open upvalues */ + luaE_freeCI(L1); /* free extra CallInfo slots */ + /* should not change the stack during an emergency gc cycle */ + if (G(L)->gckind != KGC_EMERGENCY) + luaD_shrinkstack(L1); +} + + +/* +** sweep at most 'count' elements from a list of GCObjects erasing dead +** objects, where a dead (not alive) object is one marked with the "old" +** (non current) white and not fixed. +** In non-generational mode, change all non-dead objects back to white, +** preparing for next collection cycle. +** In generational mode, keep black objects black, and also mark them as +** old; stop when hitting an old object, as all objects after that +** one will be old too. +** When object is a thread, sweep its list of open upvalues too. +*/ +static GCObject **sweeplist (lua_State *L, GCObject **p, lu_mem count) { + global_State *g = G(L); + int ow = otherwhite(g); + int toclear, toset; /* bits to clear and to set in all live objects */ + int tostop; /* stop sweep when this is true */ + if (isgenerational(g)) { /* generational mode? */ + toclear = ~0; /* clear nothing */ + toset = bitmask(OLDBIT); /* set the old bit of all surviving objects */ + tostop = bitmask(OLDBIT); /* do not sweep old generation */ + } + else { /* normal mode */ + toclear = maskcolors; /* clear all color bits + old bit */ + toset = luaC_white(g); /* make object white */ + tostop = 0; /* do not stop */ + } + while (*p != NULL && count-- > 0) { + GCObject *curr = *p; + int marked = gch(curr)->marked; + if (isdeadm(ow, marked)) { /* is 'curr' dead? */ + *p = gch(curr)->next; /* remove 'curr' from list */ + freeobj(L, curr); /* erase 'curr' */ + } + else { + if (testbits(marked, tostop)) + return NULL; /* stop sweeping this list */ + if (gch(curr)->tt == LUA_TTHREAD) + sweepthread(L, gco2th(curr)); /* sweep thread's upvalues */ + /* update marks */ + gch(curr)->marked = cast_byte((marked & toclear) | toset); + p = &gch(curr)->next; /* go to next element */ + } + } + return (*p == NULL) ? NULL : p; +} + + +/* +** sweep a list until a live object (or end of list) +*/ +static GCObject **sweeptolive (lua_State *L, GCObject **p, int *n) { + GCObject ** old = p; + int i = 0; + do { + i++; + p = sweeplist(L, p, 1); + } while (p == old); + if (n) *n += i; + return p; +} + +/* }====================================================== */ + + +/* +** {====================================================== +** Finalization +** ======================================================= +*/ + +static void checkSizes (lua_State *L) { + global_State *g = G(L); + if (g->gckind != KGC_EMERGENCY) { /* do not change sizes in emergency */ + int hs = g->strt.size / 2; /* half the size of the string table */ + if (g->strt.nuse < cast(lu_int32, hs)) /* using less than that half? */ + luaS_resize(L, hs); /* halve its size */ + luaZ_freebuffer(L, &g->buff); /* free concatenation buffer */ + } +} + + +static GCObject *udata2finalize (global_State *g) { + GCObject *o = g->tobefnz; /* get first element */ + lua_assert(isfinalized(o)); + g->tobefnz = gch(o)->next; /* remove it from 'tobefnz' list */ + gch(o)->next = g->allgc; /* return it to 'allgc' list */ + g->allgc = o; + resetbit(gch(o)->marked, SEPARATED); /* mark that it is not in 'tobefnz' */ + lua_assert(!isold(o)); /* see MOVE OLD rule */ + if (!keepinvariantout(g)) /* not keeping invariant? */ + makewhite(g, o); /* "sweep" object */ + return o; +} + + +static void dothecall (lua_State *L, void *ud) { + UNUSED(ud); + luaD_call(L, L->top - 2, 0, 0); +} + + +static void GCTM (lua_State *L, int propagateerrors) { + global_State *g = G(L); + const TValue *tm; + TValue v; + setgcovalue(L, &v, udata2finalize(g)); + tm = luaT_gettmbyobj(L, &v, TM_GC); + if (tm != NULL && ttisfunction(tm)) { /* is there a finalizer? */ + int status; + lu_byte oldah = L->allowhook; + int running = g->gcrunning; + L->allowhook = 0; /* stop debug hooks during GC metamethod */ + g->gcrunning = 0; /* avoid GC steps */ + setobj2s(L, L->top, tm); /* push finalizer... */ + setobj2s(L, L->top + 1, &v); /* ... and its argument */ + L->top += 2; /* and (next line) call the finalizer */ + status = luaD_pcall(L, dothecall, NULL, savestack(L, L->top - 2), 0); + L->allowhook = oldah; /* restore hooks */ + g->gcrunning = running; /* restore state */ + if (status != LUA_OK && propagateerrors) { /* error while running __gc? */ + if (status == LUA_ERRRUN) { /* is there an error object? */ + const char *msg = (ttisstring(L->top - 1)) + ? svalue(L->top - 1) + : "no message"; + luaO_pushfstring(L, "error in __gc metamethod (%s)", msg); + status = LUA_ERRGCMM; /* error in __gc metamethod */ + } + luaD_throw(L, status); /* re-throw error */ + } + } +} + + +/* +** move all unreachable objects (or 'all' objects) that need +** finalization from list 'finobj' to list 'tobefnz' (to be finalized) +*/ +static void separatetobefnz (lua_State *L, int all) { + global_State *g = G(L); + GCObject **p = &g->finobj; + GCObject *curr; + GCObject **lastnext = &g->tobefnz; + /* find last 'next' field in 'tobefnz' list (to add elements in its end) */ + while (*lastnext != NULL) + lastnext = &gch(*lastnext)->next; + while ((curr = *p) != NULL) { /* traverse all finalizable objects */ + lua_assert(!isfinalized(curr)); + lua_assert(testbit(gch(curr)->marked, SEPARATED)); + if (!(iswhite(curr) || all)) /* not being collected? */ + p = &gch(curr)->next; /* don't bother with it */ + else { + l_setbit(gch(curr)->marked, FINALIZEDBIT); /* won't be finalized again */ + *p = gch(curr)->next; /* remove 'curr' from 'finobj' list */ + gch(curr)->next = *lastnext; /* link at the end of 'tobefnz' list */ + *lastnext = curr; + lastnext = &gch(curr)->next; + } + } +} + + +/* +** if object 'o' has a finalizer, remove it from 'allgc' list (must +** search the list to find it) and link it in 'finobj' list. +*/ +void luaC_checkfinalizer (lua_State *L, GCObject *o, Table *mt) { + global_State *g = G(L); + if (testbit(gch(o)->marked, SEPARATED) || /* obj. is already separated... */ + isfinalized(o) || /* ... or is finalized... */ + gfasttm(g, mt, TM_GC) == NULL) /* or has no finalizer? */ + return; /* nothing to be done */ + else { /* move 'o' to 'finobj' list */ + GCObject **p; + GCheader *ho = gch(o); + if (g->sweepgc == &ho->next) { /* avoid removing current sweep object */ + lua_assert(issweepphase(g)); + g->sweepgc = sweeptolive(L, g->sweepgc, NULL); + } + /* search for pointer pointing to 'o' */ + for (p = &g->allgc; *p != o; p = &gch(*p)->next) { /* empty */ } + *p = ho->next; /* remove 'o' from root list */ + ho->next = g->finobj; /* link it in list 'finobj' */ + g->finobj = o; + l_setbit(ho->marked, SEPARATED); /* mark it as such */ + if (!keepinvariantout(g)) /* not keeping invariant? */ + makewhite(g, o); /* "sweep" object */ + else + resetoldbit(o); /* see MOVE OLD rule */ + } +} + +/* }====================================================== */ + + +/* +** {====================================================== +** GC control +** ======================================================= +*/ + + +/* +** set a reasonable "time" to wait before starting a new GC cycle; +** cycle will start when memory use hits threshold +*/ +static void setpause (global_State *g, l_mem estimate) { + l_mem debt, threshold; + estimate = estimate / PAUSEADJ; /* adjust 'estimate' */ + threshold = (g->gcpause < MAX_LMEM / estimate) /* overflow? */ + ? estimate * g->gcpause /* no overflow */ + : MAX_LMEM; /* overflow; truncate to maximum */ + debt = -cast(l_mem, threshold - gettotalbytes(g)); + luaE_setdebt(g, debt); +} + + +#define sweepphases \ + (bitmask(GCSsweepstring) | bitmask(GCSsweepudata) | bitmask(GCSsweep)) + + +/* +** enter first sweep phase (strings) and prepare pointers for other +** sweep phases. The calls to 'sweeptolive' make pointers point to an +** object inside the list (instead of to the header), so that the real +** sweep do not need to skip objects created between "now" and the start +** of the real sweep. +** Returns how many objects it swept. +*/ +static int entersweep (lua_State *L) { + global_State *g = G(L); + int n = 0; + g->gcstate = GCSsweepstring; + lua_assert(g->sweepgc == NULL && g->sweepfin == NULL); + /* prepare to sweep strings, finalizable objects, and regular objects */ + g->sweepstrgc = 0; + g->sweepfin = sweeptolive(L, &g->finobj, &n); + g->sweepgc = sweeptolive(L, &g->allgc, &n); + return n; +} + + +/* +** change GC mode +*/ +void luaC_changemode (lua_State *L, int mode) { + global_State *g = G(L); + if (mode == g->gckind) return; /* nothing to change */ + if (mode == KGC_GEN) { /* change to generational mode */ + /* make sure gray lists are consistent */ + luaC_runtilstate(L, bitmask(GCSpropagate)); + g->GCestimate = gettotalbytes(g); + g->gckind = KGC_GEN; + } + else { /* change to incremental mode */ + /* sweep all objects to turn them back to white + (as white has not changed, nothing extra will be collected) */ + g->gckind = KGC_NORMAL; + entersweep(L); + luaC_runtilstate(L, ~sweepphases); + } +} + + +/* +** call all pending finalizers +*/ +static void callallpendingfinalizers (lua_State *L, int propagateerrors) { + global_State *g = G(L); + while (g->tobefnz) { + resetoldbit(g->tobefnz); + GCTM(L, propagateerrors); + } +} + + +void luaC_freeallobjects (lua_State *L) { + global_State *g = G(L); + int i; + separatetobefnz(L, 1); /* separate all objects with finalizers */ + lua_assert(g->finobj == NULL); + callallpendingfinalizers(L, 0); + g->currentwhite = WHITEBITS; /* this "white" makes all objects look dead */ + g->gckind = KGC_NORMAL; + sweepwholelist(L, &g->finobj); /* finalizers can create objs. in 'finobj' */ + sweepwholelist(L, &g->allgc); + for (i = 0; i < g->strt.size; i++) /* free all string lists */ + sweepwholelist(L, &g->strt.hash[i]); + lua_assert(g->strt.nuse == 0); +} + + +static l_mem atomic (lua_State *L) { + global_State *g = G(L); + l_mem work = -cast(l_mem, g->GCmemtrav); /* start counting work */ + GCObject *origweak, *origall; + lua_assert(!iswhite(obj2gco(g->mainthread))); + markobject(g, L); /* mark running thread */ + /* registry and global metatables may be changed by API */ + markvalue(g, &g->l_registry); + markmt(g); /* mark basic metatables */ + /* remark occasional upvalues of (maybe) dead threads */ + remarkupvals(g); + propagateall(g); /* propagate changes */ + work += g->GCmemtrav; /* stop counting (do not (re)count grays) */ + /* traverse objects caught by write barrier and by 'remarkupvals' */ + retraversegrays(g); + work -= g->GCmemtrav; /* restart counting */ + convergeephemerons(g); + /* at this point, all strongly accessible objects are marked. */ + /* clear values from weak tables, before checking finalizers */ + clearvalues(g, g->weak, NULL); + clearvalues(g, g->allweak, NULL); + origweak = g->weak; origall = g->allweak; + work += g->GCmemtrav; /* stop counting (objects being finalized) */ + separatetobefnz(L, 0); /* separate objects to be finalized */ + markbeingfnz(g); /* mark objects that will be finalized */ + propagateall(g); /* remark, to propagate `preserveness' */ + work -= g->GCmemtrav; /* restart counting */ + convergeephemerons(g); + /* at this point, all resurrected objects are marked. */ + /* remove dead objects from weak tables */ + clearkeys(g, g->ephemeron, NULL); /* clear keys from all ephemeron tables */ + clearkeys(g, g->allweak, NULL); /* clear keys from all allweak tables */ + /* clear values from resurrected weak tables */ + clearvalues(g, g->weak, origweak); + clearvalues(g, g->allweak, origall); + g->currentwhite = cast_byte(otherwhite(g)); /* flip current white */ + work += g->GCmemtrav; /* complete counting */ + return work; /* estimate of memory marked by 'atomic' */ +} + + +static lu_mem singlestep (lua_State *L) { + global_State *g = G(L); + switch (g->gcstate) { + case GCSpause: { + /* start to count memory traversed */ + g->GCmemtrav = g->strt.size * sizeof(GCObject*); + lua_assert(!isgenerational(g)); + restartcollection(g); + g->gcstate = GCSpropagate; + return g->GCmemtrav; + } + case GCSpropagate: { + if (g->gray) { + lu_mem oldtrav = g->GCmemtrav; + propagatemark(g); + return g->GCmemtrav - oldtrav; /* memory traversed in this step */ + } + else { /* no more `gray' objects */ + lu_mem work; + int sw; + g->gcstate = GCSatomic; /* finish mark phase */ + g->GCestimate = g->GCmemtrav; /* save what was counted */; + work = atomic(L); /* add what was traversed by 'atomic' */ + g->GCestimate += work; /* estimate of total memory traversed */ + sw = entersweep(L); + return work + sw * GCSWEEPCOST; + } + } + case GCSsweepstring: { + int i; + for (i = 0; i < GCSWEEPMAX && g->sweepstrgc + i < g->strt.size; i++) + sweepwholelist(L, &g->strt.hash[g->sweepstrgc + i]); + g->sweepstrgc += i; + if (g->sweepstrgc >= g->strt.size) /* no more strings to sweep? */ + g->gcstate = GCSsweepudata; + return i * GCSWEEPCOST; + } + case GCSsweepudata: { + if (g->sweepfin) { + g->sweepfin = sweeplist(L, g->sweepfin, GCSWEEPMAX); + return GCSWEEPMAX*GCSWEEPCOST; + } + else { + g->gcstate = GCSsweep; + return 0; + } + } + case GCSsweep: { + if (g->sweepgc) { + g->sweepgc = sweeplist(L, g->sweepgc, GCSWEEPMAX); + return GCSWEEPMAX*GCSWEEPCOST; + } + else { + /* sweep main thread */ + GCObject *mt = obj2gco(g->mainthread); + sweeplist(L, &mt, 1); + checkSizes(L); + g->gcstate = GCSpause; /* finish collection */ + return GCSWEEPCOST; + } + } + default: lua_assert(0); return 0; + } +} + + +/* +** advances the garbage collector until it reaches a state allowed +** by 'statemask' +*/ +void luaC_runtilstate (lua_State *L, int statesmask) { + global_State *g = G(L); + while (!testbit(statesmask, g->gcstate)) + singlestep(L); +} + + +static void generationalcollection (lua_State *L) { + global_State *g = G(L); + lua_assert(g->gcstate == GCSpropagate); + if (g->GCestimate == 0) { /* signal for another major collection? */ + luaC_fullgc(L, 0); /* perform a full regular collection */ + g->GCestimate = gettotalbytes(g); /* update control */ + } + else { + lu_mem estimate = g->GCestimate; + luaC_runtilstate(L, bitmask(GCSpause)); /* run complete (minor) cycle */ + g->gcstate = GCSpropagate; /* skip restart */ + if (gettotalbytes(g) > (estimate / 100) * g->gcmajorinc) + g->GCestimate = 0; /* signal for a major collection */ + else + g->GCestimate = estimate; /* keep estimate from last major coll. */ + + } + setpause(g, gettotalbytes(g)); + lua_assert(g->gcstate == GCSpropagate); +} + + +static void incstep (lua_State *L) { + global_State *g = G(L); + l_mem debt = g->GCdebt; + int stepmul = g->gcstepmul; + if (stepmul < 40) stepmul = 40; /* avoid ridiculous low values (and 0) */ + /* convert debt from Kb to 'work units' (avoid zero debt and overflows) */ + debt = (debt / STEPMULADJ) + 1; + debt = (debt < MAX_LMEM / stepmul) ? debt * stepmul : MAX_LMEM; + do { /* always perform at least one single step */ + lu_mem work = singlestep(L); /* do some work */ + debt -= work; + } while (debt > -GCSTEPSIZE && g->gcstate != GCSpause); + if (g->gcstate == GCSpause) + setpause(g, g->GCestimate); /* pause until next cycle */ + else { + debt = (debt / stepmul) * STEPMULADJ; /* convert 'work units' to Kb */ + luaE_setdebt(g, debt); + } +} + + +/* +** performs a basic GC step +*/ +void luaC_forcestep (lua_State *L) { + global_State *g = G(L); + int i; + if (isgenerational(g)) generationalcollection(L); + else incstep(L); + /* run a few finalizers (or all of them at the end of a collect cycle) */ + for (i = 0; g->tobefnz && (i < GCFINALIZENUM || g->gcstate == GCSpause); i++) + GCTM(L, 1); /* call one finalizer */ +} + + +/* +** performs a basic GC step only if collector is running +*/ +void luaC_step (lua_State *L) { + global_State *g = G(L); + if (g->gcrunning) luaC_forcestep(L); + else luaE_setdebt(g, -GCSTEPSIZE); /* avoid being called too often */ +} + + + +/* +** performs a full GC cycle; if "isemergency", does not call +** finalizers (which could change stack positions) +*/ +void luaC_fullgc (lua_State *L, int isemergency) { + global_State *g = G(L); + int origkind = g->gckind; + lua_assert(origkind != KGC_EMERGENCY); + if (isemergency) /* do not run finalizers during emergency GC */ + g->gckind = KGC_EMERGENCY; + else { + g->gckind = KGC_NORMAL; + callallpendingfinalizers(L, 1); + } + if (keepinvariant(g)) { /* may there be some black objects? */ + /* must sweep all objects to turn them back to white + (as white has not changed, nothing will be collected) */ + entersweep(L); + } + /* finish any pending sweep phase to start a new cycle */ + luaC_runtilstate(L, bitmask(GCSpause)); + luaC_runtilstate(L, ~bitmask(GCSpause)); /* start new collection */ + luaC_runtilstate(L, bitmask(GCSpause)); /* run entire collection */ + if (origkind == KGC_GEN) { /* generational mode? */ + /* generational mode must be kept in propagate phase */ + luaC_runtilstate(L, bitmask(GCSpropagate)); + } + g->gckind = origkind; + setpause(g, gettotalbytes(g)); + if (!isemergency) /* do not run finalizers during emergency GC */ + callallpendingfinalizers(L, 1); +} + +/* }====================================================== */ + + diff --git a/liblua/lgc.h b/liblua/lgc.h new file mode 100644 index 00000000..dee270b4 --- /dev/null +++ b/liblua/lgc.h @@ -0,0 +1,157 @@ +/* +** $Id: lgc.h,v 2.58 2012/09/11 12:53:08 roberto Exp $ +** Garbage Collector +** See Copyright Notice in lua.h +*/ + +#ifndef lgc_h +#define lgc_h + + +#include "lobject.h" +#include "lstate.h" + +/* +** Collectable objects may have one of three colors: white, which +** means the object is not marked; gray, which means the +** object is marked, but its references may be not marked; and +** black, which means that the object and all its references are marked. +** The main invariant of the garbage collector, while marking objects, +** is that a black object can never point to a white one. Moreover, +** any gray object must be in a "gray list" (gray, grayagain, weak, +** allweak, ephemeron) so that it can be visited again before finishing +** the collection cycle. These lists have no meaning when the invariant +** is not being enforced (e.g., sweep phase). +*/ + + + +/* how much to allocate before next GC step */ +#if !defined(GCSTEPSIZE) +/* ~100 small strings */ +#define GCSTEPSIZE (cast_int(100 * sizeof(TString))) +#endif + + +/* +** Possible states of the Garbage Collector +*/ +#define GCSpropagate 0 +#define GCSatomic 1 +#define GCSsweepstring 2 +#define GCSsweepudata 3 +#define GCSsweep 4 +#define GCSpause 5 + + +#define issweepphase(g) \ + (GCSsweepstring <= (g)->gcstate && (g)->gcstate <= GCSsweep) + +#define isgenerational(g) ((g)->gckind == KGC_GEN) + +/* +** macros to tell when main invariant (white objects cannot point to black +** ones) must be kept. During a non-generational collection, the sweep +** phase may break the invariant, as objects turned white may point to +** still-black objects. The invariant is restored when sweep ends and +** all objects are white again. During a generational collection, the +** invariant must be kept all times. +*/ + +#define keepinvariant(g) (isgenerational(g) || g->gcstate <= GCSatomic) + + +/* +** Outside the collector, the state in generational mode is kept in +** 'propagate', so 'keepinvariant' is always true. +*/ +#define keepinvariantout(g) \ + check_exp(g->gcstate == GCSpropagate || !isgenerational(g), \ + g->gcstate <= GCSatomic) + + +/* +** some useful bit tricks +*/ +#define resetbits(x,m) ((x) &= cast(lu_byte, ~(m))) +#define setbits(x,m) ((x) |= (m)) +#define testbits(x,m) ((x) & (m)) +#define bitmask(b) (1<<(b)) +#define bit2mask(b1,b2) (bitmask(b1) | bitmask(b2)) +#define l_setbit(x,b) setbits(x, bitmask(b)) +#define resetbit(x,b) resetbits(x, bitmask(b)) +#define testbit(x,b) testbits(x, bitmask(b)) + + +/* Layout for bit use in `marked' field: */ +#define WHITE0BIT 0 /* object is white (type 0) */ +#define WHITE1BIT 1 /* object is white (type 1) */ +#define BLACKBIT 2 /* object is black */ +#define FINALIZEDBIT 3 /* object has been separated for finalization */ +#define SEPARATED 4 /* object is in 'finobj' list or in 'tobefnz' */ +#define FIXEDBIT 5 /* object is fixed (should not be collected) */ +#define OLDBIT 6 /* object is old (only in generational mode) */ +/* bit 7 is currently used by tests (luaL_checkmemory) */ + +#define WHITEBITS bit2mask(WHITE0BIT, WHITE1BIT) + + +#define iswhite(x) testbits((x)->gch.marked, WHITEBITS) +#define isblack(x) testbit((x)->gch.marked, BLACKBIT) +#define isgray(x) /* neither white nor black */ \ + (!testbits((x)->gch.marked, WHITEBITS | bitmask(BLACKBIT))) + +#define isold(x) testbit((x)->gch.marked, OLDBIT) + +/* MOVE OLD rule: whenever an object is moved to the beginning of + a GC list, its old bit must be cleared */ +#define resetoldbit(o) resetbit((o)->gch.marked, OLDBIT) + +#define otherwhite(g) (g->currentwhite ^ WHITEBITS) +#define isdeadm(ow,m) (!(((m) ^ WHITEBITS) & (ow))) +#define isdead(g,v) isdeadm(otherwhite(g), (v)->gch.marked) + +#define changewhite(x) ((x)->gch.marked ^= WHITEBITS) +#define gray2black(x) l_setbit((x)->gch.marked, BLACKBIT) + +#define valiswhite(x) (iscollectable(x) && iswhite(gcvalue(x))) + +#define luaC_white(g) cast(lu_byte, (g)->currentwhite & WHITEBITS) + + +#define luaC_condGC(L,c) \ + {if (G(L)->GCdebt > 0) {c;}; condchangemem(L);} +#define luaC_checkGC(L) luaC_condGC(L, luaC_step(L);) + + +#define luaC_barrier(L,p,v) { if (valiswhite(v) && isblack(obj2gco(p))) \ + luaC_barrier_(L,obj2gco(p),gcvalue(v)); } + +#define luaC_barrierback(L,p,v) { if (valiswhite(v) && isblack(obj2gco(p))) \ + luaC_barrierback_(L,p); } + +#define luaC_objbarrier(L,p,o) \ + { if (iswhite(obj2gco(o)) && isblack(obj2gco(p))) \ + luaC_barrier_(L,obj2gco(p),obj2gco(o)); } + +#define luaC_objbarrierback(L,p,o) \ + { if (iswhite(obj2gco(o)) && isblack(obj2gco(p))) luaC_barrierback_(L,p); } + +#define luaC_barrierproto(L,p,c) \ + { if (isblack(obj2gco(p))) luaC_barrierproto_(L,p,c); } + +LUAI_FUNC void luaC_freeallobjects (lua_State *L); +LUAI_FUNC void luaC_step (lua_State *L); +LUAI_FUNC void luaC_forcestep (lua_State *L); +LUAI_FUNC void luaC_runtilstate (lua_State *L, int statesmask); +LUAI_FUNC void luaC_fullgc (lua_State *L, int isemergency); +LUAI_FUNC GCObject *luaC_newobj (lua_State *L, int tt, size_t sz, + GCObject **list, int offset); +LUAI_FUNC void luaC_barrier_ (lua_State *L, GCObject *o, GCObject *v); +LUAI_FUNC void luaC_barrierback_ (lua_State *L, GCObject *o); +LUAI_FUNC void luaC_barrierproto_ (lua_State *L, Proto *p, Closure *c); +LUAI_FUNC void luaC_checkfinalizer (lua_State *L, GCObject *o, Table *mt); +LUAI_FUNC void luaC_checkupvalcolor (global_State *g, UpVal *uv); +LUAI_FUNC void luaC_changemode (lua_State *L, int mode); + +#endif diff --git a/liblua/linit.c b/liblua/linit.c new file mode 100644 index 00000000..8d3aa657 --- /dev/null +++ b/liblua/linit.c @@ -0,0 +1,67 @@ +/* +** $Id: linit.c,v 1.32 2011/04/08 19:17:36 roberto Exp $ +** Initialization of libraries for lua.c and other clients +** See Copyright Notice in lua.h +*/ + + +/* +** If you embed Lua in your program and need to open the standard +** libraries, call luaL_openlibs in your program. If you need a +** different set of libraries, copy this file to your project and edit +** it to suit your needs. +*/ + + +#define linit_c +#define LUA_LIB + +#include "lua.h" + +#include "lualib.h" +#include "lauxlib.h" + + +/* +** these libs are loaded by lua.c and are readily available to any Lua +** program +*/ +static const luaL_Reg loadedlibs[] = { + {"_G", luaopen_base}, + {LUA_LOADLIBNAME, luaopen_package}, + {LUA_COLIBNAME, luaopen_coroutine}, + {LUA_TABLIBNAME, luaopen_table}, + {LUA_IOLIBNAME, luaopen_io}, + {LUA_OSLIBNAME, luaopen_os}, + {LUA_STRLIBNAME, luaopen_string}, + {LUA_BITLIBNAME, luaopen_bit32}, + {LUA_MATHLIBNAME, luaopen_math}, + {LUA_DBLIBNAME, luaopen_debug}, + {NULL, NULL} +}; + + +/* +** these libs are preloaded and must be required before used +*/ +static const luaL_Reg preloadedlibs[] = { + {NULL, NULL} +}; + + +LUALIB_API void luaL_openlibs (lua_State *L) { + const luaL_Reg *lib; + /* call open functions from 'loadedlibs' and set results to global table */ + for (lib = loadedlibs; lib->func; lib++) { + luaL_requiref(L, lib->name, lib->func, 1); + lua_pop(L, 1); /* remove lib */ + } + /* add open functions from 'preloadedlibs' into 'package.preload' table */ + luaL_getsubtable(L, LUA_REGISTRYINDEX, "_PRELOAD"); + for (lib = preloadedlibs; lib->func; lib++) { + lua_pushcfunction(L, lib->func); + lua_setfield(L, -2, lib->name); + } + lua_pop(L, 1); /* remove _PRELOAD table */ +} + diff --git a/liblua/liolib.c b/liblua/liolib.c new file mode 100644 index 00000000..3f80db19 --- /dev/null +++ b/liblua/liolib.c @@ -0,0 +1,665 @@ +/* +** $Id: liolib.c,v 2.111 2013/03/21 13:57:27 roberto Exp $ +** Standard I/O (and system) library +** See Copyright Notice in lua.h +*/ + + +/* +** POSIX idiosyncrasy! +** This definition must come before the inclusion of 'stdio.h'; it +** should not affect non-POSIX systems +*/ +#if !defined(_FILE_OFFSET_BITS) +#define _FILE_OFFSET_BITS 64 +#endif + + +#include +#include +#include +#include + +#define liolib_c +#define LUA_LIB + +#include "lua.h" + +#include "lauxlib.h" +#include "lualib.h" + + +#if !defined(lua_checkmode) + +/* +** Check whether 'mode' matches '[rwa]%+?b?'. +** Change this macro to accept other modes for 'fopen' besides +** the standard ones. +*/ +#define lua_checkmode(mode) \ + (*mode != '\0' && strchr("rwa", *(mode++)) != NULL && \ + (*mode != '+' || ++mode) && /* skip if char is '+' */ \ + (*mode != 'b' || ++mode) && /* skip if char is 'b' */ \ + (*mode == '\0')) + +#endif + +/* +** {====================================================== +** lua_popen spawns a new process connected to the current +** one through the file streams. +** ======================================================= +*/ + +#if !defined(lua_popen) /* { */ + +#if defined(LUA_USE_POPEN) /* { */ + +#define lua_popen(L,c,m) ((void)L, fflush(NULL), popen(c,m)) +#define lua_pclose(L,file) ((void)L, pclose(file)) + +#elif defined(LUA_WIN) /* }{ */ + +#define lua_popen(L,c,m) ((void)L, _popen(c,m)) +#define lua_pclose(L,file) ((void)L, _pclose(file)) + + +#else /* }{ */ + +#define lua_popen(L,c,m) ((void)((void)c, m), \ + luaL_error(L, LUA_QL("popen") " not supported"), (FILE*)0) +#define lua_pclose(L,file) ((void)((void)L, file), -1) + + +#endif /* } */ + +#endif /* } */ + +/* }====================================================== */ + + +/* +** {====================================================== +** lua_fseek/lua_ftell: configuration for longer offsets +** ======================================================= +*/ + +#if !defined(lua_fseek) /* { */ + +#if defined(LUA_USE_POSIX) + +#define l_fseek(f,o,w) fseeko(f,o,w) +#define l_ftell(f) ftello(f) +#define l_seeknum off_t + +#elif defined(LUA_WIN) && !defined(_CRTIMP_TYPEINFO) \ + && defined(_MSC_VER) && (_MSC_VER >= 1400) +/* Windows (but not DDK) and Visual C++ 2005 or higher */ + +#define l_fseek(f,o,w) _fseeki64(f,o,w) +#define l_ftell(f) _ftelli64(f) +#define l_seeknum __int64 + +#else + +#define l_fseek(f,o,w) fseek(f,o,w) +#define l_ftell(f) ftell(f) +#define l_seeknum long + +#endif + +#endif /* } */ + +/* }====================================================== */ + + +#define IO_PREFIX "_IO_" +#define IO_INPUT (IO_PREFIX "input") +#define IO_OUTPUT (IO_PREFIX "output") + + +typedef luaL_Stream LStream; + + +#define tolstream(L) ((LStream *)luaL_checkudata(L, 1, LUA_FILEHANDLE)) + +#define isclosed(p) ((p)->closef == NULL) + + +static int io_type (lua_State *L) { + LStream *p; + luaL_checkany(L, 1); + p = (LStream *)luaL_testudata(L, 1, LUA_FILEHANDLE); + if (p == NULL) + lua_pushnil(L); /* not a file */ + else if (isclosed(p)) + lua_pushliteral(L, "closed file"); + else + lua_pushliteral(L, "file"); + return 1; +} + + +static int f_tostring (lua_State *L) { + LStream *p = tolstream(L); + if (isclosed(p)) + lua_pushliteral(L, "file (closed)"); + else + lua_pushfstring(L, "file (%p)", p->f); + return 1; +} + + +static FILE *tofile (lua_State *L) { + LStream *p = tolstream(L); + if (isclosed(p)) + luaL_error(L, "attempt to use a closed file"); + lua_assert(p->f); + return p->f; +} + + +/* +** When creating file handles, always creates a `closed' file handle +** before opening the actual file; so, if there is a memory error, the +** file is not left opened. +*/ +static LStream *newprefile (lua_State *L) { + LStream *p = (LStream *)lua_newuserdata(L, sizeof(LStream)); + p->closef = NULL; /* mark file handle as 'closed' */ + luaL_setmetatable(L, LUA_FILEHANDLE); + return p; +} + + +static int aux_close (lua_State *L) { + LStream *p = tolstream(L); + lua_CFunction cf = p->closef; + p->closef = NULL; /* mark stream as closed */ + return (*cf)(L); /* close it */ +} + + +static int io_close (lua_State *L) { + if (lua_isnone(L, 1)) /* no argument? */ + lua_getfield(L, LUA_REGISTRYINDEX, IO_OUTPUT); /* use standard output */ + tofile(L); /* make sure argument is an open stream */ + return aux_close(L); +} + + +static int f_gc (lua_State *L) { + LStream *p = tolstream(L); + if (!isclosed(p) && p->f != NULL) + aux_close(L); /* ignore closed and incompletely open files */ + return 0; +} + + +/* +** function to close regular files +*/ +static int io_fclose (lua_State *L) { + LStream *p = tolstream(L); + int res = fclose(p->f); + return luaL_fileresult(L, (res == 0), NULL); +} + + +static LStream *newfile (lua_State *L) { + LStream *p = newprefile(L); + p->f = NULL; + p->closef = &io_fclose; + return p; +} + + +static void opencheck (lua_State *L, const char *fname, const char *mode) { + LStream *p = newfile(L); + p->f = fopen(fname, mode); + if (p->f == NULL) + luaL_error(L, "cannot open file " LUA_QS " (%s)", fname, strerror(errno)); +} + + +static int io_open (lua_State *L) { + const char *filename = luaL_checkstring(L, 1); + const char *mode = luaL_optstring(L, 2, "r"); + LStream *p = newfile(L); + const char *md = mode; /* to traverse/check mode */ + luaL_argcheck(L, lua_checkmode(md), 2, "invalid mode"); + p->f = fopen(filename, mode); + return (p->f == NULL) ? luaL_fileresult(L, 0, filename) : 1; +} + + +/* +** function to close 'popen' files +*/ +static int io_pclose (lua_State *L) { + LStream *p = tolstream(L); + return luaL_execresult(L, lua_pclose(L, p->f)); +} + + +static int io_popen (lua_State *L) { + const char *filename = luaL_checkstring(L, 1); + const char *mode = luaL_optstring(L, 2, "r"); + LStream *p = newprefile(L); + p->f = lua_popen(L, filename, mode); + p->closef = &io_pclose; + return (p->f == NULL) ? luaL_fileresult(L, 0, filename) : 1; +} + + +static int io_tmpfile (lua_State *L) { + LStream *p = newfile(L); + p->f = tmpfile(); + return (p->f == NULL) ? luaL_fileresult(L, 0, NULL) : 1; +} + + +static FILE *getiofile (lua_State *L, const char *findex) { + LStream *p; + lua_getfield(L, LUA_REGISTRYINDEX, findex); + p = (LStream *)lua_touserdata(L, -1); + if (isclosed(p)) + luaL_error(L, "standard %s file is closed", findex + strlen(IO_PREFIX)); + return p->f; +} + + +static int g_iofile (lua_State *L, const char *f, const char *mode) { + if (!lua_isnoneornil(L, 1)) { + const char *filename = lua_tostring(L, 1); + if (filename) + opencheck(L, filename, mode); + else { + tofile(L); /* check that it's a valid file handle */ + lua_pushvalue(L, 1); + } + lua_setfield(L, LUA_REGISTRYINDEX, f); + } + /* return current value */ + lua_getfield(L, LUA_REGISTRYINDEX, f); + return 1; +} + + +static int io_input (lua_State *L) { + return g_iofile(L, IO_INPUT, "r"); +} + + +static int io_output (lua_State *L) { + return g_iofile(L, IO_OUTPUT, "w"); +} + + +static int io_readline (lua_State *L); + + +static void aux_lines (lua_State *L, int toclose) { + int i; + int n = lua_gettop(L) - 1; /* number of arguments to read */ + /* ensure that arguments will fit here and into 'io_readline' stack */ + luaL_argcheck(L, n <= LUA_MINSTACK - 3, LUA_MINSTACK - 3, "too many options"); + lua_pushvalue(L, 1); /* file handle */ + lua_pushinteger(L, n); /* number of arguments to read */ + lua_pushboolean(L, toclose); /* close/not close file when finished */ + for (i = 1; i <= n; i++) lua_pushvalue(L, i + 1); /* copy arguments */ + lua_pushcclosure(L, io_readline, 3 + n); +} + + +static int f_lines (lua_State *L) { + tofile(L); /* check that it's a valid file handle */ + aux_lines(L, 0); + return 1; +} + + +static int io_lines (lua_State *L) { + int toclose; + if (lua_isnone(L, 1)) lua_pushnil(L); /* at least one argument */ + if (lua_isnil(L, 1)) { /* no file name? */ + lua_getfield(L, LUA_REGISTRYINDEX, IO_INPUT); /* get default input */ + lua_replace(L, 1); /* put it at index 1 */ + tofile(L); /* check that it's a valid file handle */ + toclose = 0; /* do not close it after iteration */ + } + else { /* open a new file */ + const char *filename = luaL_checkstring(L, 1); + opencheck(L, filename, "r"); + lua_replace(L, 1); /* put file at index 1 */ + toclose = 1; /* close it after iteration */ + } + aux_lines(L, toclose); + return 1; +} + + +/* +** {====================================================== +** READ +** ======================================================= +*/ + + +static int read_number (lua_State *L, FILE *f) { + lua_Number d; + if (fscanf(f, LUA_NUMBER_SCAN, &d) == 1) { + lua_pushnumber(L, d); + return 1; + } + else { + lua_pushnil(L); /* "result" to be removed */ + return 0; /* read fails */ + } +} + + +static int test_eof (lua_State *L, FILE *f) { + int c = getc(f); + ungetc(c, f); + lua_pushlstring(L, NULL, 0); + return (c != EOF); +} + + +static int read_line (lua_State *L, FILE *f, int chop) { + luaL_Buffer b; + luaL_buffinit(L, &b); + for (;;) { + size_t l; + char *p = luaL_prepbuffer(&b); + if (fgets(p, LUAL_BUFFERSIZE, f) == NULL) { /* eof? */ + luaL_pushresult(&b); /* close buffer */ + return (lua_rawlen(L, -1) > 0); /* check whether read something */ + } + l = strlen(p); + if (l == 0 || p[l-1] != '\n') + luaL_addsize(&b, l); + else { + luaL_addsize(&b, l - chop); /* chop 'eol' if needed */ + luaL_pushresult(&b); /* close buffer */ + return 1; /* read at least an `eol' */ + } + } +} + + +#define MAX_SIZE_T (~(size_t)0) + +static void read_all (lua_State *L, FILE *f) { + size_t rlen = LUAL_BUFFERSIZE; /* how much to read in each cycle */ + luaL_Buffer b; + luaL_buffinit(L, &b); + for (;;) { + char *p = luaL_prepbuffsize(&b, rlen); + size_t nr = fread(p, sizeof(char), rlen, f); + luaL_addsize(&b, nr); + if (nr < rlen) break; /* eof? */ + else if (rlen <= (MAX_SIZE_T / 4)) /* avoid buffers too large */ + rlen *= 2; /* double buffer size at each iteration */ + } + luaL_pushresult(&b); /* close buffer */ +} + + +static int read_chars (lua_State *L, FILE *f, size_t n) { + size_t nr; /* number of chars actually read */ + char *p; + luaL_Buffer b; + luaL_buffinit(L, &b); + p = luaL_prepbuffsize(&b, n); /* prepare buffer to read whole block */ + nr = fread(p, sizeof(char), n, f); /* try to read 'n' chars */ + luaL_addsize(&b, nr); + luaL_pushresult(&b); /* close buffer */ + return (nr > 0); /* true iff read something */ +} + + +static int g_read (lua_State *L, FILE *f, int first) { + int nargs = lua_gettop(L) - 1; + int success; + int n; + clearerr(f); + if (nargs == 0) { /* no arguments? */ + success = read_line(L, f, 1); + n = first+1; /* to return 1 result */ + } + else { /* ensure stack space for all results and for auxlib's buffer */ + luaL_checkstack(L, nargs+LUA_MINSTACK, "too many arguments"); + success = 1; + for (n = first; nargs-- && success; n++) { + if (lua_type(L, n) == LUA_TNUMBER) { + size_t l = (size_t)lua_tointeger(L, n); + success = (l == 0) ? test_eof(L, f) : read_chars(L, f, l); + } + else { + const char *p = lua_tostring(L, n); + luaL_argcheck(L, p && p[0] == '*', n, "invalid option"); + switch (p[1]) { + case 'n': /* number */ + success = read_number(L, f); + break; + case 'l': /* line */ + success = read_line(L, f, 1); + break; + case 'L': /* line with end-of-line */ + success = read_line(L, f, 0); + break; + case 'a': /* file */ + read_all(L, f); /* read entire file */ + success = 1; /* always success */ + break; + default: + return luaL_argerror(L, n, "invalid format"); + } + } + } + } + if (ferror(f)) + return luaL_fileresult(L, 0, NULL); + if (!success) { + lua_pop(L, 1); /* remove last result */ + lua_pushnil(L); /* push nil instead */ + } + return n - first; +} + + +static int io_read (lua_State *L) { + return g_read(L, getiofile(L, IO_INPUT), 1); +} + + +static int f_read (lua_State *L) { + return g_read(L, tofile(L), 2); +} + + +static int io_readline (lua_State *L) { + LStream *p = (LStream *)lua_touserdata(L, lua_upvalueindex(1)); + int i; + int n = (int)lua_tointeger(L, lua_upvalueindex(2)); + if (isclosed(p)) /* file is already closed? */ + return luaL_error(L, "file is already closed"); + lua_settop(L , 1); + for (i = 1; i <= n; i++) /* push arguments to 'g_read' */ + lua_pushvalue(L, lua_upvalueindex(3 + i)); + n = g_read(L, p->f, 2); /* 'n' is number of results */ + lua_assert(n > 0); /* should return at least a nil */ + if (!lua_isnil(L, -n)) /* read at least one value? */ + return n; /* return them */ + else { /* first result is nil: EOF or error */ + if (n > 1) { /* is there error information? */ + /* 2nd result is error message */ + return luaL_error(L, "%s", lua_tostring(L, -n + 1)); + } + if (lua_toboolean(L, lua_upvalueindex(3))) { /* generator created file? */ + lua_settop(L, 0); + lua_pushvalue(L, lua_upvalueindex(1)); + aux_close(L); /* close it */ + } + return 0; + } +} + +/* }====================================================== */ + + +static int g_write (lua_State *L, FILE *f, int arg) { + int nargs = lua_gettop(L) - arg; + int status = 1; + for (; nargs--; arg++) { + if (lua_type(L, arg) == LUA_TNUMBER) { + /* optimization: could be done exactly as for strings */ + status = status && + fprintf(f, LUA_NUMBER_FMT, lua_tonumber(L, arg)) > 0; + } + else { + size_t l; + const char *s = luaL_checklstring(L, arg, &l); + status = status && (fwrite(s, sizeof(char), l, f) == l); + } + } + if (status) return 1; /* file handle already on stack top */ + else return luaL_fileresult(L, status, NULL); +} + + +static int io_write (lua_State *L) { + return g_write(L, getiofile(L, IO_OUTPUT), 1); +} + + +static int f_write (lua_State *L) { + FILE *f = tofile(L); + lua_pushvalue(L, 1); /* push file at the stack top (to be returned) */ + return g_write(L, f, 2); +} + + +static int f_seek (lua_State *L) { + static const int mode[] = {SEEK_SET, SEEK_CUR, SEEK_END}; + static const char *const modenames[] = {"set", "cur", "end", NULL}; + FILE *f = tofile(L); + int op = luaL_checkoption(L, 2, "cur", modenames); + lua_Number p3 = luaL_optnumber(L, 3, 0); + l_seeknum offset = (l_seeknum)p3; + luaL_argcheck(L, (lua_Number)offset == p3, 3, + "not an integer in proper range"); + op = l_fseek(f, offset, mode[op]); + if (op) + return luaL_fileresult(L, 0, NULL); /* error */ + else { + lua_pushnumber(L, (lua_Number)l_ftell(f)); + return 1; + } +} + + +static int f_setvbuf (lua_State *L) { + static const int mode[] = {_IONBF, _IOFBF, _IOLBF}; + static const char *const modenames[] = {"no", "full", "line", NULL}; + FILE *f = tofile(L); + int op = luaL_checkoption(L, 2, NULL, modenames); + lua_Integer sz = luaL_optinteger(L, 3, LUAL_BUFFERSIZE); + int res = setvbuf(f, NULL, mode[op], sz); + return luaL_fileresult(L, res == 0, NULL); +} + + + +static int io_flush (lua_State *L) { + return luaL_fileresult(L, fflush(getiofile(L, IO_OUTPUT)) == 0, NULL); +} + + +static int f_flush (lua_State *L) { + return luaL_fileresult(L, fflush(tofile(L)) == 0, NULL); +} + + +/* +** functions for 'io' library +*/ +static const luaL_Reg iolib[] = { + {"close", io_close}, + {"flush", io_flush}, + {"input", io_input}, + {"lines", io_lines}, + {"open", io_open}, + {"output", io_output}, + {"popen", io_popen}, + {"read", io_read}, + {"tmpfile", io_tmpfile}, + {"type", io_type}, + {"write", io_write}, + {NULL, NULL} +}; + + +/* +** methods for file handles +*/ +static const luaL_Reg flib[] = { + {"close", io_close}, + {"flush", f_flush}, + {"lines", f_lines}, + {"read", f_read}, + {"seek", f_seek}, + {"setvbuf", f_setvbuf}, + {"write", f_write}, + {"__gc", f_gc}, + {"__tostring", f_tostring}, + {NULL, NULL} +}; + + +static void createmeta (lua_State *L) { + luaL_newmetatable(L, LUA_FILEHANDLE); /* create metatable for file handles */ + lua_pushvalue(L, -1); /* push metatable */ + lua_setfield(L, -2, "__index"); /* metatable.__index = metatable */ + luaL_setfuncs(L, flib, 0); /* add file methods to new metatable */ + lua_pop(L, 1); /* pop new metatable */ +} + + +/* +** function to (not) close the standard files stdin, stdout, and stderr +*/ +static int io_noclose (lua_State *L) { + LStream *p = tolstream(L); + p->closef = &io_noclose; /* keep file opened */ + lua_pushnil(L); + lua_pushliteral(L, "cannot close standard file"); + return 2; +} + + +static void createstdfile (lua_State *L, FILE *f, const char *k, + const char *fname) { + LStream *p = newprefile(L); + p->f = f; + p->closef = &io_noclose; + if (k != NULL) { + lua_pushvalue(L, -1); + lua_setfield(L, LUA_REGISTRYINDEX, k); /* add file to registry */ + } + lua_setfield(L, -2, fname); /* add file to module */ +} + + +LUAMOD_API int luaopen_io (lua_State *L) { + luaL_newlib(L, iolib); /* new module */ + createmeta(L); + /* create (and set) default files */ + createstdfile(L, stdin, IO_INPUT, "stdin"); + createstdfile(L, stdout, IO_OUTPUT, "stdout"); + createstdfile(L, stderr, NULL, "stderr"); + return 1; +} + diff --git a/liblua/llex.c b/liblua/llex.c new file mode 100644 index 00000000..1a32e348 --- /dev/null +++ b/liblua/llex.c @@ -0,0 +1,527 @@ +/* +** $Id: llex.c,v 2.63 2013/03/16 21:10:18 roberto Exp $ +** Lexical Analyzer +** See Copyright Notice in lua.h +*/ + + +#include +#include + +#define llex_c +#define LUA_CORE + +#include "lua.h" + +#include "lctype.h" +#include "ldo.h" +#include "llex.h" +#include "lobject.h" +#include "lparser.h" +#include "lstate.h" +#include "lstring.h" +#include "ltable.h" +#include "lzio.h" + + + +#define next(ls) (ls->current = zgetc(ls->z)) + + + +#define currIsNewline(ls) (ls->current == '\n' || ls->current == '\r') + + +/* ORDER RESERVED */ +static const char *const luaX_tokens [] = { + "and", "break", "do", "else", "elseif", + "end", "false", "for", "function", "goto", "if", + "in", "local", "nil", "not", "or", "repeat", + "return", "then", "true", "until", "while", + "..", "...", "==", ">=", "<=", "~=", "::", "", + "", "", "" +}; + + +#define save_and_next(ls) (save(ls, ls->current), next(ls)) + + +static l_noret lexerror (LexState *ls, const char *msg, int token); + + +static void save (LexState *ls, int c) { + Mbuffer *b = ls->buff; + if (luaZ_bufflen(b) + 1 > luaZ_sizebuffer(b)) { + size_t newsize; + if (luaZ_sizebuffer(b) >= MAX_SIZET/2) + lexerror(ls, "lexical element too long", 0); + newsize = luaZ_sizebuffer(b) * 2; + luaZ_resizebuffer(ls->L, b, newsize); + } + b->buffer[luaZ_bufflen(b)++] = cast(char, c); +} + + +void luaX_init (lua_State *L) { + int i; + for (i=0; itsv.extra = cast_byte(i+1); /* reserved word */ + } +} + + +const char *luaX_token2str (LexState *ls, int token) { + if (token < FIRST_RESERVED) { /* single-byte symbols? */ + lua_assert(token == cast(unsigned char, token)); + return (lisprint(token)) ? luaO_pushfstring(ls->L, LUA_QL("%c"), token) : + luaO_pushfstring(ls->L, "char(%d)", token); + } + else { + const char *s = luaX_tokens[token - FIRST_RESERVED]; + if (token < TK_EOS) /* fixed format (symbols and reserved words)? */ + return luaO_pushfstring(ls->L, LUA_QS, s); + else /* names, strings, and numerals */ + return s; + } +} + + +static const char *txtToken (LexState *ls, int token) { + switch (token) { + case TK_NAME: + case TK_STRING: + case TK_NUMBER: + save(ls, '\0'); + return luaO_pushfstring(ls->L, LUA_QS, luaZ_buffer(ls->buff)); + default: + return luaX_token2str(ls, token); + } +} + + +static l_noret lexerror (LexState *ls, const char *msg, int token) { + char buff[LUA_IDSIZE]; + luaO_chunkid(buff, getstr(ls->source), LUA_IDSIZE); + msg = luaO_pushfstring(ls->L, "%s:%d: %s", buff, ls->linenumber, msg); + if (token) + luaO_pushfstring(ls->L, "%s near %s", msg, txtToken(ls, token)); + luaD_throw(ls->L, LUA_ERRSYNTAX); +} + + +l_noret luaX_syntaxerror (LexState *ls, const char *msg) { + lexerror(ls, msg, ls->t.token); +} + + +/* +** creates a new string and anchors it in function's table so that +** it will not be collected until the end of the function's compilation +** (by that time it should be anchored in function's prototype) +*/ +TString *luaX_newstring (LexState *ls, const char *str, size_t l) { + lua_State *L = ls->L; + TValue *o; /* entry for `str' */ + TString *ts = luaS_newlstr(L, str, l); /* create new string */ + setsvalue2s(L, L->top++, ts); /* temporarily anchor it in stack */ + o = luaH_set(L, ls->fs->h, L->top - 1); + if (ttisnil(o)) { /* not in use yet? (see 'addK') */ + /* boolean value does not need GC barrier; + table has no metatable, so it does not need to invalidate cache */ + setbvalue(o, 1); /* t[string] = true */ + luaC_checkGC(L); + } + L->top--; /* remove string from stack */ + return ts; +} + + +/* +** increment line number and skips newline sequence (any of +** \n, \r, \n\r, or \r\n) +*/ +static void inclinenumber (LexState *ls) { + int old = ls->current; + lua_assert(currIsNewline(ls)); + next(ls); /* skip `\n' or `\r' */ + if (currIsNewline(ls) && ls->current != old) + next(ls); /* skip `\n\r' or `\r\n' */ + if (++ls->linenumber >= MAX_INT) + luaX_syntaxerror(ls, "chunk has too many lines"); +} + + +void luaX_setinput (lua_State *L, LexState *ls, ZIO *z, TString *source, + int firstchar) { + ls->decpoint = '.'; + ls->L = L; + ls->current = firstchar; + ls->lookahead.token = TK_EOS; /* no look-ahead token */ + ls->z = z; + ls->fs = NULL; + ls->linenumber = 1; + ls->lastline = 1; + ls->source = source; + ls->envn = luaS_new(L, LUA_ENV); /* create env name */ + luaS_fix(ls->envn); /* never collect this name */ + luaZ_resizebuffer(ls->L, ls->buff, LUA_MINBUFFER); /* initialize buffer */ +} + + + +/* +** ======================================================= +** LEXICAL ANALYZER +** ======================================================= +*/ + + + +static int check_next (LexState *ls, const char *set) { + if (ls->current == '\0' || !strchr(set, ls->current)) + return 0; + save_and_next(ls); + return 1; +} + + +/* +** change all characters 'from' in buffer to 'to' +*/ +static void buffreplace (LexState *ls, char from, char to) { + size_t n = luaZ_bufflen(ls->buff); + char *p = luaZ_buffer(ls->buff); + while (n--) + if (p[n] == from) p[n] = to; +} + + +#if !defined(getlocaledecpoint) +#define getlocaledecpoint() (localeconv()->decimal_point[0]) +#endif + + +#define buff2d(b,e) luaO_str2d(luaZ_buffer(b), luaZ_bufflen(b) - 1, e) + +/* +** in case of format error, try to change decimal point separator to +** the one defined in the current locale and check again +*/ +static void trydecpoint (LexState *ls, SemInfo *seminfo) { + char old = ls->decpoint; + ls->decpoint = getlocaledecpoint(); + buffreplace(ls, old, ls->decpoint); /* try new decimal separator */ + if (!buff2d(ls->buff, &seminfo->r)) { + /* format error with correct decimal point: no more options */ + buffreplace(ls, ls->decpoint, '.'); /* undo change (for error message) */ + lexerror(ls, "malformed number", TK_NUMBER); + } +} + + +/* LUA_NUMBER */ +/* +** this function is quite liberal in what it accepts, as 'luaO_str2d' +** will reject ill-formed numerals. +*/ +static void read_numeral (LexState *ls, SemInfo *seminfo) { + const char *expo = "Ee"; + int first = ls->current; + lua_assert(lisdigit(ls->current)); + save_and_next(ls); + if (first == '0' && check_next(ls, "Xx")) /* hexadecimal? */ + expo = "Pp"; + for (;;) { + if (check_next(ls, expo)) /* exponent part? */ + check_next(ls, "+-"); /* optional exponent sign */ + if (lisxdigit(ls->current) || ls->current == '.') + save_and_next(ls); + else break; + } + save(ls, '\0'); + buffreplace(ls, '.', ls->decpoint); /* follow locale for decimal point */ + if (!buff2d(ls->buff, &seminfo->r)) /* format error? */ + trydecpoint(ls, seminfo); /* try to update decimal point separator */ +} + + +/* +** skip a sequence '[=*[' or ']=*]' and return its number of '='s or +** -1 if sequence is malformed +*/ +static int skip_sep (LexState *ls) { + int count = 0; + int s = ls->current; + lua_assert(s == '[' || s == ']'); + save_and_next(ls); + while (ls->current == '=') { + save_and_next(ls); + count++; + } + return (ls->current == s) ? count : (-count) - 1; +} + + +static void read_long_string (LexState *ls, SemInfo *seminfo, int sep) { + save_and_next(ls); /* skip 2nd `[' */ + if (currIsNewline(ls)) /* string starts with a newline? */ + inclinenumber(ls); /* skip it */ + for (;;) { + switch (ls->current) { + case EOZ: + lexerror(ls, (seminfo) ? "unfinished long string" : + "unfinished long comment", TK_EOS); + break; /* to avoid warnings */ + case ']': { + if (skip_sep(ls) == sep) { + save_and_next(ls); /* skip 2nd `]' */ + goto endloop; + } + break; + } + case '\n': case '\r': { + save(ls, '\n'); + inclinenumber(ls); + if (!seminfo) luaZ_resetbuffer(ls->buff); /* avoid wasting space */ + break; + } + default: { + if (seminfo) save_and_next(ls); + else next(ls); + } + } + } endloop: + if (seminfo) + seminfo->ts = luaX_newstring(ls, luaZ_buffer(ls->buff) + (2 + sep), + luaZ_bufflen(ls->buff) - 2*(2 + sep)); +} + + +static void escerror (LexState *ls, int *c, int n, const char *msg) { + int i; + luaZ_resetbuffer(ls->buff); /* prepare error message */ + save(ls, '\\'); + for (i = 0; i < n && c[i] != EOZ; i++) + save(ls, c[i]); + lexerror(ls, msg, TK_STRING); +} + + +static int readhexaesc (LexState *ls) { + int c[3], i; /* keep input for error message */ + int r = 0; /* result accumulator */ + c[0] = 'x'; /* for error message */ + for (i = 1; i < 3; i++) { /* read two hexadecimal digits */ + c[i] = next(ls); + if (!lisxdigit(c[i])) + escerror(ls, c, i + 1, "hexadecimal digit expected"); + r = (r << 4) + luaO_hexavalue(c[i]); + } + return r; +} + + +static int readdecesc (LexState *ls) { + int c[3], i; + int r = 0; /* result accumulator */ + for (i = 0; i < 3 && lisdigit(ls->current); i++) { /* read up to 3 digits */ + c[i] = ls->current; + r = 10*r + c[i] - '0'; + next(ls); + } + if (r > UCHAR_MAX) + escerror(ls, c, i, "decimal escape too large"); + return r; +} + + +static void read_string (LexState *ls, int del, SemInfo *seminfo) { + save_and_next(ls); /* keep delimiter (for error messages) */ + while (ls->current != del) { + switch (ls->current) { + case EOZ: + lexerror(ls, "unfinished string", TK_EOS); + break; /* to avoid warnings */ + case '\n': + case '\r': + lexerror(ls, "unfinished string", TK_STRING); + break; /* to avoid warnings */ + case '\\': { /* escape sequences */ + int c; /* final character to be saved */ + next(ls); /* do not save the `\' */ + switch (ls->current) { + case 'a': c = '\a'; goto read_save; + case 'b': c = '\b'; goto read_save; + case 'f': c = '\f'; goto read_save; + case 'n': c = '\n'; goto read_save; + case 'r': c = '\r'; goto read_save; + case 't': c = '\t'; goto read_save; + case 'v': c = '\v'; goto read_save; + case 'x': c = readhexaesc(ls); goto read_save; + case '\n': case '\r': + inclinenumber(ls); c = '\n'; goto only_save; + case '\\': case '\"': case '\'': + c = ls->current; goto read_save; + case EOZ: goto no_save; /* will raise an error next loop */ + case 'z': { /* zap following span of spaces */ + next(ls); /* skip the 'z' */ + while (lisspace(ls->current)) { + if (currIsNewline(ls)) inclinenumber(ls); + else next(ls); + } + goto no_save; + } + default: { + if (!lisdigit(ls->current)) + escerror(ls, &ls->current, 1, "invalid escape sequence"); + /* digital escape \ddd */ + c = readdecesc(ls); + goto only_save; + } + } + read_save: next(ls); /* read next character */ + only_save: save(ls, c); /* save 'c' */ + no_save: break; + } + default: + save_and_next(ls); + } + } + save_and_next(ls); /* skip delimiter */ + seminfo->ts = luaX_newstring(ls, luaZ_buffer(ls->buff) + 1, + luaZ_bufflen(ls->buff) - 2); +} + + +static int llex (LexState *ls, SemInfo *seminfo) { + luaZ_resetbuffer(ls->buff); + for (;;) { + switch (ls->current) { + case '\n': case '\r': { /* line breaks */ + inclinenumber(ls); + break; + } + case ' ': case '\f': case '\t': case '\v': { /* spaces */ + next(ls); + break; + } + case '-': { /* '-' or '--' (comment) */ + next(ls); + if (ls->current != '-') return '-'; + /* else is a comment */ + next(ls); + if (ls->current == '[') { /* long comment? */ + int sep = skip_sep(ls); + luaZ_resetbuffer(ls->buff); /* `skip_sep' may dirty the buffer */ + if (sep >= 0) { + read_long_string(ls, NULL, sep); /* skip long comment */ + luaZ_resetbuffer(ls->buff); /* previous call may dirty the buff. */ + break; + } + } + /* else short comment */ + while (!currIsNewline(ls) && ls->current != EOZ) + next(ls); /* skip until end of line (or end of file) */ + break; + } + case '[': { /* long string or simply '[' */ + int sep = skip_sep(ls); + if (sep >= 0) { + read_long_string(ls, seminfo, sep); + return TK_STRING; + } + else if (sep == -1) return '['; + else lexerror(ls, "invalid long string delimiter", TK_STRING); + } + case '=': { + next(ls); + if (ls->current != '=') return '='; + else { next(ls); return TK_EQ; } + } + case '<': { + next(ls); + if (ls->current != '=') return '<'; + else { next(ls); return TK_LE; } + } + case '>': { + next(ls); + if (ls->current != '=') return '>'; + else { next(ls); return TK_GE; } + } + case '~': { + next(ls); + if (ls->current != '=') return '~'; + else { next(ls); return TK_NE; } + } + case ':': { + next(ls); + if (ls->current != ':') return ':'; + else { next(ls); return TK_DBCOLON; } + } + case '"': case '\'': { /* short literal strings */ + read_string(ls, ls->current, seminfo); + return TK_STRING; + } + case '.': { /* '.', '..', '...', or number */ + save_and_next(ls); + if (check_next(ls, ".")) { + if (check_next(ls, ".")) + return TK_DOTS; /* '...' */ + else return TK_CONCAT; /* '..' */ + } + else if (!lisdigit(ls->current)) return '.'; + /* else go through */ + } + case '0': case '1': case '2': case '3': case '4': + case '5': case '6': case '7': case '8': case '9': { + read_numeral(ls, seminfo); + return TK_NUMBER; + } + case EOZ: { + return TK_EOS; + } + default: { + if (lislalpha(ls->current)) { /* identifier or reserved word? */ + TString *ts; + do { + save_and_next(ls); + } while (lislalnum(ls->current)); + ts = luaX_newstring(ls, luaZ_buffer(ls->buff), + luaZ_bufflen(ls->buff)); + seminfo->ts = ts; + if (isreserved(ts)) /* reserved word? */ + return ts->tsv.extra - 1 + FIRST_RESERVED; + else { + return TK_NAME; + } + } + else { /* single-char tokens (+ - / ...) */ + int c = ls->current; + next(ls); + return c; + } + } + } + } +} + + +void luaX_next (LexState *ls) { + ls->lastline = ls->linenumber; + if (ls->lookahead.token != TK_EOS) { /* is there a look-ahead token? */ + ls->t = ls->lookahead; /* use this one */ + ls->lookahead.token = TK_EOS; /* and discharge it */ + } + else + ls->t.token = llex(ls, &ls->t.seminfo); /* read next token */ +} + + +int luaX_lookahead (LexState *ls) { + lua_assert(ls->lookahead.token == TK_EOS); + ls->lookahead.token = llex(ls, &ls->lookahead.seminfo); + return ls->lookahead.token; +} + diff --git a/liblua/llex.h b/liblua/llex.h new file mode 100644 index 00000000..9ca8a299 --- /dev/null +++ b/liblua/llex.h @@ -0,0 +1,78 @@ +/* +** $Id: llex.h,v 1.72 2011/11/30 12:43:51 roberto Exp $ +** Lexical Analyzer +** See Copyright Notice in lua.h +*/ + +#ifndef llex_h +#define llex_h + +#include "lobject.h" +#include "lzio.h" + + +#define FIRST_RESERVED 257 + + + +/* +* WARNING: if you change the order of this enumeration, +* grep "ORDER RESERVED" +*/ +enum RESERVED { + /* terminal symbols denoted by reserved words */ + TK_AND = FIRST_RESERVED, TK_BREAK, + TK_DO, TK_ELSE, TK_ELSEIF, TK_END, TK_FALSE, TK_FOR, TK_FUNCTION, + TK_GOTO, TK_IF, TK_IN, TK_LOCAL, TK_NIL, TK_NOT, TK_OR, TK_REPEAT, + TK_RETURN, TK_THEN, TK_TRUE, TK_UNTIL, TK_WHILE, + /* other terminal symbols */ + TK_CONCAT, TK_DOTS, TK_EQ, TK_GE, TK_LE, TK_NE, TK_DBCOLON, TK_EOS, + TK_NUMBER, TK_NAME, TK_STRING +}; + +/* number of reserved words */ +#define NUM_RESERVED (cast(int, TK_WHILE-FIRST_RESERVED+1)) + + +typedef union { + lua_Number r; + TString *ts; +} SemInfo; /* semantics information */ + + +typedef struct Token { + int token; + SemInfo seminfo; +} Token; + + +/* state of the lexer plus state of the parser when shared by all + functions */ +typedef struct LexState { + int current; /* current character (charint) */ + int linenumber; /* input line counter */ + int lastline; /* line of last token `consumed' */ + Token t; /* current token */ + Token lookahead; /* look ahead token */ + struct FuncState *fs; /* current function (parser) */ + struct lua_State *L; + ZIO *z; /* input stream */ + Mbuffer *buff; /* buffer for tokens */ + struct Dyndata *dyd; /* dynamic structures used by the parser */ + TString *source; /* current source name */ + TString *envn; /* environment variable name */ + char decpoint; /* locale decimal point */ +} LexState; + + +LUAI_FUNC void luaX_init (lua_State *L); +LUAI_FUNC void luaX_setinput (lua_State *L, LexState *ls, ZIO *z, + TString *source, int firstchar); +LUAI_FUNC TString *luaX_newstring (LexState *ls, const char *str, size_t l); +LUAI_FUNC void luaX_next (LexState *ls); +LUAI_FUNC int luaX_lookahead (LexState *ls); +LUAI_FUNC l_noret luaX_syntaxerror (LexState *ls, const char *s); +LUAI_FUNC const char *luaX_token2str (LexState *ls, int token); + + +#endif diff --git a/liblua/llimits.h b/liblua/llimits.h new file mode 100644 index 00000000..1b8c79bd --- /dev/null +++ b/liblua/llimits.h @@ -0,0 +1,309 @@ +/* +** $Id: llimits.h,v 1.103 2013/02/20 14:08:56 roberto Exp $ +** Limits, basic types, and some other `installation-dependent' definitions +** See Copyright Notice in lua.h +*/ + +#ifndef llimits_h +#define llimits_h + + +#include +#include + + +#include "lua.h" + + +typedef unsigned LUA_INT32 lu_int32; + +typedef LUAI_UMEM lu_mem; + +typedef LUAI_MEM l_mem; + + + +/* chars used as small naturals (so that `char' is reserved for characters) */ +typedef unsigned char lu_byte; + + +#define MAX_SIZET ((size_t)(~(size_t)0)-2) + +#define MAX_LUMEM ((lu_mem)(~(lu_mem)0)-2) + +#define MAX_LMEM ((l_mem) ((MAX_LUMEM >> 1) - 2)) + + +#define MAX_INT (INT_MAX-2) /* maximum value of an int (-2 for safety) */ + +/* +** conversion of pointer to integer +** this is for hashing only; there is no problem if the integer +** cannot hold the whole pointer value +*/ +#define IntPoint(p) ((unsigned int)(lu_mem)(p)) + + + +/* type to ensure maximum alignment */ +#if !defined(LUAI_USER_ALIGNMENT_T) +#define LUAI_USER_ALIGNMENT_T union { double u; void *s; long l; } +#endif + +typedef LUAI_USER_ALIGNMENT_T L_Umaxalign; + + +/* result of a `usual argument conversion' over lua_Number */ +typedef LUAI_UACNUMBER l_uacNumber; + + +/* internal assertions for in-house debugging */ +#if defined(lua_assert) +#define check_exp(c,e) (lua_assert(c), (e)) +/* to avoid problems with conditions too long */ +#define lua_longassert(c) { if (!(c)) lua_assert(0); } +#else +#define lua_assert(c) ((void)0) +#define check_exp(c,e) (e) +#define lua_longassert(c) ((void)0) +#endif + +/* +** assertion for checking API calls +*/ +#if !defined(luai_apicheck) + +#if defined(LUA_USE_APICHECK) +#include +#define luai_apicheck(L,e) assert(e) +#else +#define luai_apicheck(L,e) lua_assert(e) +#endif + +#endif + +#define api_check(l,e,msg) luai_apicheck(l,(e) && msg) + + +#if !defined(UNUSED) +#define UNUSED(x) ((void)(x)) /* to avoid warnings */ +#endif + + +#define cast(t, exp) ((t)(exp)) + +#define cast_byte(i) cast(lu_byte, (i)) +#define cast_num(i) cast(lua_Number, (i)) +#define cast_int(i) cast(int, (i)) +#define cast_uchar(i) cast(unsigned char, (i)) + + +/* +** non-return type +*/ +#if defined(__GNUC__) +#define l_noret void __attribute__((noreturn)) +#elif defined(_MSC_VER) +#define l_noret void __declspec(noreturn) +#else +#define l_noret void +#endif + + + +/* +** maximum depth for nested C calls and syntactical nested non-terminals +** in a program. (Value must fit in an unsigned short int.) +*/ +#if !defined(LUAI_MAXCCALLS) +#define LUAI_MAXCCALLS 200 +#endif + +/* +** maximum number of upvalues in a closure (both C and Lua). (Value +** must fit in an unsigned char.) +*/ +#define MAXUPVAL UCHAR_MAX + + +/* +** type for virtual-machine instructions +** must be an unsigned with (at least) 4 bytes (see details in lopcodes.h) +*/ +typedef lu_int32 Instruction; + + + +/* maximum stack for a Lua function */ +#define MAXSTACK 250 + + + +/* minimum size for the string table (must be power of 2) */ +#if !defined(MINSTRTABSIZE) +#define MINSTRTABSIZE 32 +#endif + + +/* minimum size for string buffer */ +#if !defined(LUA_MINBUFFER) +#define LUA_MINBUFFER 32 +#endif + + +#if !defined(lua_lock) +#define lua_lock(L) ((void) 0) +#define lua_unlock(L) ((void) 0) +#endif + +#if !defined(luai_threadyield) +#define luai_threadyield(L) {lua_unlock(L); lua_lock(L);} +#endif + + +/* +** these macros allow user-specific actions on threads when you defined +** LUAI_EXTRASPACE and need to do something extra when a thread is +** created/deleted/resumed/yielded. +*/ +#if !defined(luai_userstateopen) +#define luai_userstateopen(L) ((void)L) +#endif + +#if !defined(luai_userstateclose) +#define luai_userstateclose(L) ((void)L) +#endif + +#if !defined(luai_userstatethread) +#define luai_userstatethread(L,L1) ((void)L) +#endif + +#if !defined(luai_userstatefree) +#define luai_userstatefree(L,L1) ((void)L) +#endif + +#if !defined(luai_userstateresume) +#define luai_userstateresume(L,n) ((void)L) +#endif + +#if !defined(luai_userstateyield) +#define luai_userstateyield(L,n) ((void)L) +#endif + +/* +** lua_number2int is a macro to convert lua_Number to int. +** lua_number2integer is a macro to convert lua_Number to lua_Integer. +** lua_number2unsigned is a macro to convert a lua_Number to a lua_Unsigned. +** lua_unsigned2number is a macro to convert a lua_Unsigned to a lua_Number. +** luai_hashnum is a macro to hash a lua_Number value into an integer. +** The hash must be deterministic and give reasonable values for +** both small and large values (outside the range of integers). +*/ + +#if defined(MS_ASMTRICK) || defined(LUA_MSASMTRICK) /* { */ +/* trick with Microsoft assembler for X86 */ + +#define lua_number2int(i,n) __asm {__asm fld n __asm fistp i} +#define lua_number2integer(i,n) lua_number2int(i, n) +#define lua_number2unsigned(i,n) \ + {__int64 l; __asm {__asm fld n __asm fistp l} i = (unsigned int)l;} + + +#elif defined(LUA_IEEE754TRICK) /* }{ */ +/* the next trick should work on any machine using IEEE754 with + a 32-bit int type */ + +union luai_Cast { double l_d; LUA_INT32 l_p[2]; }; + +#if !defined(LUA_IEEEENDIAN) /* { */ +#define LUAI_EXTRAIEEE \ + static const union luai_Cast ieeeendian = {-(33.0 + 6755399441055744.0)}; +#define LUA_IEEEENDIANLOC (ieeeendian.l_p[1] == 33) +#else +#define LUA_IEEEENDIANLOC LUA_IEEEENDIAN +#define LUAI_EXTRAIEEE /* empty */ +#endif /* } */ + +#define lua_number2int32(i,n,t) \ + { LUAI_EXTRAIEEE \ + volatile union luai_Cast u; u.l_d = (n) + 6755399441055744.0; \ + (i) = (t)u.l_p[LUA_IEEEENDIANLOC]; } + +#define luai_hashnum(i,n) \ + { volatile union luai_Cast u; u.l_d = (n) + 1.0; /* avoid -0 */ \ + (i) = u.l_p[0]; (i) += u.l_p[1]; } /* add double bits for his hash */ + +#define lua_number2int(i,n) lua_number2int32(i, n, int) +#define lua_number2unsigned(i,n) lua_number2int32(i, n, lua_Unsigned) + +/* the trick can be expanded to lua_Integer when it is a 32-bit value */ +#if defined(LUA_IEEELL) +#define lua_number2integer(i,n) lua_number2int32(i, n, lua_Integer) +#endif + +#endif /* } */ + + +/* the following definitions always work, but may be slow */ + +#if !defined(lua_number2int) +#define lua_number2int(i,n) ((i)=(int)(n)) +#endif + +#if !defined(lua_number2integer) +#define lua_number2integer(i,n) ((i)=(lua_Integer)(n)) +#endif + +#if !defined(lua_number2unsigned) /* { */ +/* the following definition assures proper modulo behavior */ +#if defined(LUA_NUMBER_DOUBLE) || defined(LUA_NUMBER_FLOAT) +#include +#define SUPUNSIGNED ((lua_Number)(~(lua_Unsigned)0) + 1) +#define lua_number2unsigned(i,n) \ + ((i)=(lua_Unsigned)((n) - floor((n)/SUPUNSIGNED)*SUPUNSIGNED)) +#else +#define lua_number2unsigned(i,n) ((i)=(lua_Unsigned)(n)) +#endif +#endif /* } */ + + +#if !defined(lua_unsigned2number) +/* on several machines, coercion from unsigned to double is slow, + so it may be worth to avoid */ +#define lua_unsigned2number(u) \ + (((u) <= (lua_Unsigned)INT_MAX) ? (lua_Number)(int)(u) : (lua_Number)(u)) +#endif + + + +#if defined(ltable_c) && !defined(luai_hashnum) + +#include +#include + +#define luai_hashnum(i,n) { int e; \ + n = l_mathop(frexp)(n, &e) * (lua_Number)(INT_MAX - DBL_MAX_EXP); \ + lua_number2int(i, n); i += e; } + +#endif + + + +/* +** macro to control inclusion of some hard tests on stack reallocation +*/ +#if !defined(HARDSTACKTESTS) +#define condmovestack(L) ((void)0) +#else +/* realloc stack keeping its size */ +#define condmovestack(L) luaD_reallocstack((L), (L)->stacksize) +#endif + +#if !defined(HARDMEMTESTS) +#define condchangemem(L) condmovestack(L) +#else +#define condchangemem(L) \ + ((void)(!(G(L)->gcrunning) || (luaC_fullgc(L, 0), 1))) +#endif + +#endif diff --git a/liblua/lmathlib.c b/liblua/lmathlib.c new file mode 100644 index 00000000..a49f1fd2 --- /dev/null +++ b/liblua/lmathlib.c @@ -0,0 +1,279 @@ +/* +** $Id: lmathlib.c,v 1.83 2013/03/07 18:21:32 roberto Exp $ +** Standard mathematical library +** See Copyright Notice in lua.h +*/ + + +#include +#include + +#define lmathlib_c +#define LUA_LIB + +#include "lua.h" + +#include "lauxlib.h" +#include "lualib.h" + + +#undef PI +#define PI ((lua_Number)(3.1415926535897932384626433832795)) +#define RADIANS_PER_DEGREE ((lua_Number)(PI/180.0)) + + + +static int math_abs (lua_State *L) { + lua_pushnumber(L, l_mathop(fabs)(luaL_checknumber(L, 1))); + return 1; +} + +static int math_sin (lua_State *L) { + lua_pushnumber(L, l_mathop(sin)(luaL_checknumber(L, 1))); + return 1; +} + +static int math_sinh (lua_State *L) { + lua_pushnumber(L, l_mathop(sinh)(luaL_checknumber(L, 1))); + return 1; +} + +static int math_cos (lua_State *L) { + lua_pushnumber(L, l_mathop(cos)(luaL_checknumber(L, 1))); + return 1; +} + +static int math_cosh (lua_State *L) { + lua_pushnumber(L, l_mathop(cosh)(luaL_checknumber(L, 1))); + return 1; +} + +static int math_tan (lua_State *L) { + lua_pushnumber(L, l_mathop(tan)(luaL_checknumber(L, 1))); + return 1; +} + +static int math_tanh (lua_State *L) { + lua_pushnumber(L, l_mathop(tanh)(luaL_checknumber(L, 1))); + return 1; +} + +static int math_asin (lua_State *L) { + lua_pushnumber(L, l_mathop(asin)(luaL_checknumber(L, 1))); + return 1; +} + +static int math_acos (lua_State *L) { + lua_pushnumber(L, l_mathop(acos)(luaL_checknumber(L, 1))); + return 1; +} + +static int math_atan (lua_State *L) { + lua_pushnumber(L, l_mathop(atan)(luaL_checknumber(L, 1))); + return 1; +} + +static int math_atan2 (lua_State *L) { + lua_pushnumber(L, l_mathop(atan2)(luaL_checknumber(L, 1), + luaL_checknumber(L, 2))); + return 1; +} + +static int math_ceil (lua_State *L) { + lua_pushnumber(L, l_mathop(ceil)(luaL_checknumber(L, 1))); + return 1; +} + +static int math_floor (lua_State *L) { + lua_pushnumber(L, l_mathop(floor)(luaL_checknumber(L, 1))); + return 1; +} + +static int math_fmod (lua_State *L) { + lua_pushnumber(L, l_mathop(fmod)(luaL_checknumber(L, 1), + luaL_checknumber(L, 2))); + return 1; +} + +static int math_modf (lua_State *L) { + lua_Number ip; + lua_Number fp = l_mathop(modf)(luaL_checknumber(L, 1), &ip); + lua_pushnumber(L, ip); + lua_pushnumber(L, fp); + return 2; +} + +static int math_sqrt (lua_State *L) { + lua_pushnumber(L, l_mathop(sqrt)(luaL_checknumber(L, 1))); + return 1; +} + +static int math_pow (lua_State *L) { + lua_Number x = luaL_checknumber(L, 1); + lua_Number y = luaL_checknumber(L, 2); + lua_pushnumber(L, l_mathop(pow)(x, y)); + return 1; +} + +static int math_log (lua_State *L) { + lua_Number x = luaL_checknumber(L, 1); + lua_Number res; + if (lua_isnoneornil(L, 2)) + res = l_mathop(log)(x); + else { + lua_Number base = luaL_checknumber(L, 2); + if (base == (lua_Number)10.0) res = l_mathop(log10)(x); + else res = l_mathop(log)(x)/l_mathop(log)(base); + } + lua_pushnumber(L, res); + return 1; +} + +#if defined(LUA_COMPAT_LOG10) +static int math_log10 (lua_State *L) { + lua_pushnumber(L, l_mathop(log10)(luaL_checknumber(L, 1))); + return 1; +} +#endif + +static int math_exp (lua_State *L) { + lua_pushnumber(L, l_mathop(exp)(luaL_checknumber(L, 1))); + return 1; +} + +static int math_deg (lua_State *L) { + lua_pushnumber(L, luaL_checknumber(L, 1)/RADIANS_PER_DEGREE); + return 1; +} + +static int math_rad (lua_State *L) { + lua_pushnumber(L, luaL_checknumber(L, 1)*RADIANS_PER_DEGREE); + return 1; +} + +static int math_frexp (lua_State *L) { + int e; + lua_pushnumber(L, l_mathop(frexp)(luaL_checknumber(L, 1), &e)); + lua_pushinteger(L, e); + return 2; +} + +static int math_ldexp (lua_State *L) { + lua_Number x = luaL_checknumber(L, 1); + int ep = luaL_checkint(L, 2); + lua_pushnumber(L, l_mathop(ldexp)(x, ep)); + return 1; +} + + + +static int math_min (lua_State *L) { + int n = lua_gettop(L); /* number of arguments */ + lua_Number dmin = luaL_checknumber(L, 1); + int i; + for (i=2; i<=n; i++) { + lua_Number d = luaL_checknumber(L, i); + if (d < dmin) + dmin = d; + } + lua_pushnumber(L, dmin); + return 1; +} + + +static int math_max (lua_State *L) { + int n = lua_gettop(L); /* number of arguments */ + lua_Number dmax = luaL_checknumber(L, 1); + int i; + for (i=2; i<=n; i++) { + lua_Number d = luaL_checknumber(L, i); + if (d > dmax) + dmax = d; + } + lua_pushnumber(L, dmax); + return 1; +} + + +static int math_random (lua_State *L) { + /* the `%' avoids the (rare) case of r==1, and is needed also because on + some systems (SunOS!) `rand()' may return a value larger than RAND_MAX */ + lua_Number r = (lua_Number)(rand()%RAND_MAX) / (lua_Number)RAND_MAX; + switch (lua_gettop(L)) { /* check number of arguments */ + case 0: { /* no arguments */ + lua_pushnumber(L, r); /* Number between 0 and 1 */ + break; + } + case 1: { /* only upper limit */ + lua_Number u = luaL_checknumber(L, 1); + luaL_argcheck(L, (lua_Number)1.0 <= u, 1, "interval is empty"); + lua_pushnumber(L, l_mathop(floor)(r*u) + (lua_Number)(1.0)); /* [1, u] */ + break; + } + case 2: { /* lower and upper limits */ + lua_Number l = luaL_checknumber(L, 1); + lua_Number u = luaL_checknumber(L, 2); + luaL_argcheck(L, l <= u, 2, "interval is empty"); + lua_pushnumber(L, l_mathop(floor)(r*(u-l+1)) + l); /* [l, u] */ + break; + } + default: return luaL_error(L, "wrong number of arguments"); + } + return 1; +} + + +static int math_randomseed (lua_State *L) { + srand(luaL_checkunsigned(L, 1)); + (void)rand(); /* discard first value to avoid undesirable correlations */ + return 0; +} + + +static const luaL_Reg mathlib[] = { + {"abs", math_abs}, + {"acos", math_acos}, + {"asin", math_asin}, + {"atan2", math_atan2}, + {"atan", math_atan}, + {"ceil", math_ceil}, + {"cosh", math_cosh}, + {"cos", math_cos}, + {"deg", math_deg}, + {"exp", math_exp}, + {"floor", math_floor}, + {"fmod", math_fmod}, + {"frexp", math_frexp}, + {"ldexp", math_ldexp}, +#if defined(LUA_COMPAT_LOG10) + {"log10", math_log10}, +#endif + {"log", math_log}, + {"max", math_max}, + {"min", math_min}, + {"modf", math_modf}, + {"pow", math_pow}, + {"rad", math_rad}, + {"random", math_random}, + {"randomseed", math_randomseed}, + {"sinh", math_sinh}, + {"sin", math_sin}, + {"sqrt", math_sqrt}, + {"tanh", math_tanh}, + {"tan", math_tan}, + {NULL, NULL} +}; + + +/* +** Open math library +*/ +LUAMOD_API int luaopen_math (lua_State *L) { + luaL_newlib(L, mathlib); + lua_pushnumber(L, PI); + lua_setfield(L, -2, "pi"); + lua_pushnumber(L, HUGE_VAL); + lua_setfield(L, -2, "huge"); + return 1; +} + diff --git a/liblua/lmem.c b/liblua/lmem.c new file mode 100644 index 00000000..3f88496e --- /dev/null +++ b/liblua/lmem.c @@ -0,0 +1,99 @@ +/* +** $Id: lmem.c,v 1.84 2012/05/23 15:41:53 roberto Exp $ +** Interface to Memory Manager +** See Copyright Notice in lua.h +*/ + + +#include + +#define lmem_c +#define LUA_CORE + +#include "lua.h" + +#include "ldebug.h" +#include "ldo.h" +#include "lgc.h" +#include "lmem.h" +#include "lobject.h" +#include "lstate.h" + + + +/* +** About the realloc function: +** void * frealloc (void *ud, void *ptr, size_t osize, size_t nsize); +** (`osize' is the old size, `nsize' is the new size) +** +** * frealloc(ud, NULL, x, s) creates a new block of size `s' (no +** matter 'x'). +** +** * frealloc(ud, p, x, 0) frees the block `p' +** (in this specific case, frealloc must return NULL); +** particularly, frealloc(ud, NULL, 0, 0) does nothing +** (which is equivalent to free(NULL) in ANSI C) +** +** frealloc returns NULL if it cannot create or reallocate the area +** (any reallocation to an equal or smaller size cannot fail!) +*/ + + + +#define MINSIZEARRAY 4 + + +void *luaM_growaux_ (lua_State *L, void *block, int *size, size_t size_elems, + int limit, const char *what) { + void *newblock; + int newsize; + if (*size >= limit/2) { /* cannot double it? */ + if (*size >= limit) /* cannot grow even a little? */ + luaG_runerror(L, "too many %s (limit is %d)", what, limit); + newsize = limit; /* still have at least one free place */ + } + else { + newsize = (*size)*2; + if (newsize < MINSIZEARRAY) + newsize = MINSIZEARRAY; /* minimum size */ + } + newblock = luaM_reallocv(L, block, *size, newsize, size_elems); + *size = newsize; /* update only when everything else is OK */ + return newblock; +} + + +l_noret luaM_toobig (lua_State *L) { + luaG_runerror(L, "memory allocation error: block too big"); +} + + + +/* +** generic allocation routine. +*/ +void *luaM_realloc_ (lua_State *L, void *block, size_t osize, size_t nsize) { + void *newblock; + global_State *g = G(L); + size_t realosize = (block) ? osize : 0; + lua_assert((realosize == 0) == (block == NULL)); +#if defined(HARDMEMTESTS) + if (nsize > realosize && g->gcrunning) + luaC_fullgc(L, 1); /* force a GC whenever possible */ +#endif + newblock = (*g->frealloc)(g->ud, block, osize, nsize); + if (newblock == NULL && nsize > 0) { + api_check(L, nsize > realosize, + "realloc cannot fail when shrinking a block"); + if (g->gcrunning) { + luaC_fullgc(L, 1); /* try to free some memory... */ + newblock = (*g->frealloc)(g->ud, block, osize, nsize); /* try again */ + } + if (newblock == NULL) + luaD_throw(L, LUA_ERRMEM); + } + lua_assert((nsize == 0) == (newblock == NULL)); + g->GCdebt = (g->GCdebt + nsize) - realosize; + return newblock; +} + diff --git a/liblua/lmem.h b/liblua/lmem.h new file mode 100644 index 00000000..5f850999 --- /dev/null +++ b/liblua/lmem.h @@ -0,0 +1,57 @@ +/* +** $Id: lmem.h,v 1.40 2013/02/20 14:08:21 roberto Exp $ +** Interface to Memory Manager +** See Copyright Notice in lua.h +*/ + +#ifndef lmem_h +#define lmem_h + + +#include + +#include "llimits.h" +#include "lua.h" + + +/* +** This macro avoids the runtime division MAX_SIZET/(e), as 'e' is +** always constant. +** The macro is somewhat complex to avoid warnings: +** +1 avoids warnings of "comparison has constant result"; +** cast to 'void' avoids warnings of "value unused". +*/ +#define luaM_reallocv(L,b,on,n,e) \ + (cast(void, \ + (cast(size_t, (n)+1) > MAX_SIZET/(e)) ? (luaM_toobig(L), 0) : 0), \ + luaM_realloc_(L, (b), (on)*(e), (n)*(e))) + +#define luaM_freemem(L, b, s) luaM_realloc_(L, (b), (s), 0) +#define luaM_free(L, b) luaM_realloc_(L, (b), sizeof(*(b)), 0) +#define luaM_freearray(L, b, n) luaM_reallocv(L, (b), n, 0, sizeof((b)[0])) + +#define luaM_malloc(L,s) luaM_realloc_(L, NULL, 0, (s)) +#define luaM_new(L,t) cast(t *, luaM_malloc(L, sizeof(t))) +#define luaM_newvector(L,n,t) \ + cast(t *, luaM_reallocv(L, NULL, 0, n, sizeof(t))) + +#define luaM_newobject(L,tag,s) luaM_realloc_(L, NULL, tag, (s)) + +#define luaM_growvector(L,v,nelems,size,t,limit,e) \ + if ((nelems)+1 > (size)) \ + ((v)=cast(t *, luaM_growaux_(L,v,&(size),sizeof(t),limit,e))) + +#define luaM_reallocvector(L, v,oldn,n,t) \ + ((v)=cast(t *, luaM_reallocv(L, v, oldn, n, sizeof(t)))) + +LUAI_FUNC l_noret luaM_toobig (lua_State *L); + +/* not to be called directly */ +LUAI_FUNC void *luaM_realloc_ (lua_State *L, void *block, size_t oldsize, + size_t size); +LUAI_FUNC void *luaM_growaux_ (lua_State *L, void *block, int *size, + size_t size_elem, int limit, + const char *what); + +#endif + diff --git a/liblua/loadlib.c b/liblua/loadlib.c new file mode 100644 index 00000000..a9959277 --- /dev/null +++ b/liblua/loadlib.c @@ -0,0 +1,725 @@ +/* +** $Id: loadlib.c,v 1.111 2012/05/30 12:33:44 roberto Exp $ +** Dynamic library loader for Lua +** See Copyright Notice in lua.h +** +** This module contains an implementation of loadlib for Unix systems +** that have dlfcn, an implementation for Windows, and a stub for other +** systems. +*/ + + +/* +** if needed, includes windows header before everything else +*/ +#if defined(_WIN32) +#include +#endif + + +#include +#include + + +#define loadlib_c +#define LUA_LIB + +#include "lua.h" + +#include "lauxlib.h" +#include "lualib.h" + + +/* +** LUA_PATH and LUA_CPATH are the names of the environment +** variables that Lua check to set its paths. +*/ +#if !defined(LUA_PATH) +#define LUA_PATH "LUA_PATH" +#endif + +#if !defined(LUA_CPATH) +#define LUA_CPATH "LUA_CPATH" +#endif + +#define LUA_PATHSUFFIX "_" LUA_VERSION_MAJOR "_" LUA_VERSION_MINOR + +#define LUA_PATHVERSION LUA_PATH LUA_PATHSUFFIX +#define LUA_CPATHVERSION LUA_CPATH LUA_PATHSUFFIX + +/* +** LUA_PATH_SEP is the character that separates templates in a path. +** LUA_PATH_MARK is the string that marks the substitution points in a +** template. +** LUA_EXEC_DIR in a Windows path is replaced by the executable's +** directory. +** LUA_IGMARK is a mark to ignore all before it when building the +** luaopen_ function name. +*/ +#if !defined (LUA_PATH_SEP) +#define LUA_PATH_SEP ";" +#endif +#if !defined (LUA_PATH_MARK) +#define LUA_PATH_MARK "?" +#endif +#if !defined (LUA_EXEC_DIR) +#define LUA_EXEC_DIR "!" +#endif +#if !defined (LUA_IGMARK) +#define LUA_IGMARK "-" +#endif + + +/* +** LUA_CSUBSEP is the character that replaces dots in submodule names +** when searching for a C loader. +** LUA_LSUBSEP is the character that replaces dots in submodule names +** when searching for a Lua loader. +*/ +#if !defined(LUA_CSUBSEP) +#define LUA_CSUBSEP LUA_DIRSEP +#endif + +#if !defined(LUA_LSUBSEP) +#define LUA_LSUBSEP LUA_DIRSEP +#endif + + +/* prefix for open functions in C libraries */ +#define LUA_POF "luaopen_" + +/* separator for open functions in C libraries */ +#define LUA_OFSEP "_" + + +/* table (in the registry) that keeps handles for all loaded C libraries */ +#define CLIBS "_CLIBS" + +#define LIB_FAIL "open" + + +/* error codes for ll_loadfunc */ +#define ERRLIB 1 +#define ERRFUNC 2 + +#define setprogdir(L) ((void)0) + + +/* +** system-dependent functions +*/ +static void ll_unloadlib (void *lib); +static void *ll_load (lua_State *L, const char *path, int seeglb); +static lua_CFunction ll_sym (lua_State *L, void *lib, const char *sym); + + + +#if defined(LUA_USE_DLOPEN) +/* +** {======================================================================== +** This is an implementation of loadlib based on the dlfcn interface. +** The dlfcn interface is available in Linux, SunOS, Solaris, IRIX, FreeBSD, +** NetBSD, AIX 4.2, HPUX 11, and probably most other Unix flavors, at least +** as an emulation layer on top of native functions. +** ========================================================================= +*/ + +#include + +static void ll_unloadlib (void *lib) { + dlclose(lib); +} + + +static void *ll_load (lua_State *L, const char *path, int seeglb) { + void *lib = dlopen(path, RTLD_NOW | (seeglb ? RTLD_GLOBAL : RTLD_LOCAL)); + if (lib == NULL) lua_pushstring(L, dlerror()); + return lib; +} + + +static lua_CFunction ll_sym (lua_State *L, void *lib, const char *sym) { + lua_CFunction f = (lua_CFunction)dlsym(lib, sym); + if (f == NULL) lua_pushstring(L, dlerror()); + return f; +} + +/* }====================================================== */ + + + +#elif defined(LUA_DL_DLL) +/* +** {====================================================================== +** This is an implementation of loadlib for Windows using native functions. +** ======================================================================= +*/ + +#undef setprogdir + +/* +** optional flags for LoadLibraryEx +*/ +#if !defined(LUA_LLE_FLAGS) +#define LUA_LLE_FLAGS 0 +#endif + + +static void setprogdir (lua_State *L) { + char buff[MAX_PATH + 1]; + char *lb; + DWORD nsize = sizeof(buff)/sizeof(char); + DWORD n = GetModuleFileNameA(NULL, buff, nsize); + if (n == 0 || n == nsize || (lb = strrchr(buff, '\\')) == NULL) + luaL_error(L, "unable to get ModuleFileName"); + else { + *lb = '\0'; + luaL_gsub(L, lua_tostring(L, -1), LUA_EXEC_DIR, buff); + lua_remove(L, -2); /* remove original string */ + } +} + + +static void pusherror (lua_State *L) { + int error = GetLastError(); + char buffer[128]; + if (FormatMessageA(FORMAT_MESSAGE_IGNORE_INSERTS | FORMAT_MESSAGE_FROM_SYSTEM, + NULL, error, 0, buffer, sizeof(buffer)/sizeof(char), NULL)) + lua_pushstring(L, buffer); + else + lua_pushfstring(L, "system error %d\n", error); +} + +static void ll_unloadlib (void *lib) { + FreeLibrary((HMODULE)lib); +} + + +static void *ll_load (lua_State *L, const char *path, int seeglb) { + HMODULE lib = LoadLibraryExA(path, NULL, LUA_LLE_FLAGS); + (void)(seeglb); /* not used: symbols are 'global' by default */ + if (lib == NULL) pusherror(L); + return lib; +} + + +static lua_CFunction ll_sym (lua_State *L, void *lib, const char *sym) { + lua_CFunction f = (lua_CFunction)GetProcAddress((HMODULE)lib, sym); + if (f == NULL) pusherror(L); + return f; +} + +/* }====================================================== */ + + +#else +/* +** {====================================================== +** Fallback for other systems +** ======================================================= +*/ + +#undef LIB_FAIL +#define LIB_FAIL "absent" + + +#define DLMSG "dynamic libraries not enabled; check your Lua installation" + + +static void ll_unloadlib (void *lib) { + (void)(lib); /* not used */ +} + + +static void *ll_load (lua_State *L, const char *path, int seeglb) { + (void)(path); (void)(seeglb); /* not used */ + lua_pushliteral(L, DLMSG); + return NULL; +} + + +static lua_CFunction ll_sym (lua_State *L, void *lib, const char *sym) { + (void)(lib); (void)(sym); /* not used */ + lua_pushliteral(L, DLMSG); + return NULL; +} + +/* }====================================================== */ +#endif + + +static void *ll_checkclib (lua_State *L, const char *path) { + void *plib; + lua_getfield(L, LUA_REGISTRYINDEX, CLIBS); + lua_getfield(L, -1, path); + plib = lua_touserdata(L, -1); /* plib = CLIBS[path] */ + lua_pop(L, 2); /* pop CLIBS table and 'plib' */ + return plib; +} + + +static void ll_addtoclib (lua_State *L, const char *path, void *plib) { + lua_getfield(L, LUA_REGISTRYINDEX, CLIBS); + lua_pushlightuserdata(L, plib); + lua_pushvalue(L, -1); + lua_setfield(L, -3, path); /* CLIBS[path] = plib */ + lua_rawseti(L, -2, luaL_len(L, -2) + 1); /* CLIBS[#CLIBS + 1] = plib */ + lua_pop(L, 1); /* pop CLIBS table */ +} + + +/* +** __gc tag method for CLIBS table: calls 'll_unloadlib' for all lib +** handles in list CLIBS +*/ +static int gctm (lua_State *L) { + int n = luaL_len(L, 1); + for (; n >= 1; n--) { /* for each handle, in reverse order */ + lua_rawgeti(L, 1, n); /* get handle CLIBS[n] */ + ll_unloadlib(lua_touserdata(L, -1)); + lua_pop(L, 1); /* pop handle */ + } + return 0; +} + + +static int ll_loadfunc (lua_State *L, const char *path, const char *sym) { + void *reg = ll_checkclib(L, path); /* check loaded C libraries */ + if (reg == NULL) { /* must load library? */ + reg = ll_load(L, path, *sym == '*'); + if (reg == NULL) return ERRLIB; /* unable to load library */ + ll_addtoclib(L, path, reg); + } + if (*sym == '*') { /* loading only library (no function)? */ + lua_pushboolean(L, 1); /* return 'true' */ + return 0; /* no errors */ + } + else { + lua_CFunction f = ll_sym(L, reg, sym); + if (f == NULL) + return ERRFUNC; /* unable to find function */ + lua_pushcfunction(L, f); /* else create new function */ + return 0; /* no errors */ + } +} + + +static int ll_loadlib (lua_State *L) { + const char *path = luaL_checkstring(L, 1); + const char *init = luaL_checkstring(L, 2); + int stat = ll_loadfunc(L, path, init); + if (stat == 0) /* no errors? */ + return 1; /* return the loaded function */ + else { /* error; error message is on stack top */ + lua_pushnil(L); + lua_insert(L, -2); + lua_pushstring(L, (stat == ERRLIB) ? LIB_FAIL : "init"); + return 3; /* return nil, error message, and where */ + } +} + + + +/* +** {====================================================== +** 'require' function +** ======================================================= +*/ + + +static int readable (const char *filename) { + FILE *f = fopen(filename, "r"); /* try to open file */ + if (f == NULL) return 0; /* open failed */ + fclose(f); + return 1; +} + + +static const char *pushnexttemplate (lua_State *L, const char *path) { + const char *l; + while (*path == *LUA_PATH_SEP) path++; /* skip separators */ + if (*path == '\0') return NULL; /* no more templates */ + l = strchr(path, *LUA_PATH_SEP); /* find next separator */ + if (l == NULL) l = path + strlen(path); + lua_pushlstring(L, path, l - path); /* template */ + return l; +} + + +static const char *searchpath (lua_State *L, const char *name, + const char *path, + const char *sep, + const char *dirsep) { + luaL_Buffer msg; /* to build error message */ + luaL_buffinit(L, &msg); + if (*sep != '\0') /* non-empty separator? */ + name = luaL_gsub(L, name, sep, dirsep); /* replace it by 'dirsep' */ + while ((path = pushnexttemplate(L, path)) != NULL) { + const char *filename = luaL_gsub(L, lua_tostring(L, -1), + LUA_PATH_MARK, name); + lua_remove(L, -2); /* remove path template */ + if (readable(filename)) /* does file exist and is readable? */ + return filename; /* return that file name */ + lua_pushfstring(L, "\n\tno file " LUA_QS, filename); + lua_remove(L, -2); /* remove file name */ + luaL_addvalue(&msg); /* concatenate error msg. entry */ + } + luaL_pushresult(&msg); /* create error message */ + return NULL; /* not found */ +} + + +static int ll_searchpath (lua_State *L) { + const char *f = searchpath(L, luaL_checkstring(L, 1), + luaL_checkstring(L, 2), + luaL_optstring(L, 3, "."), + luaL_optstring(L, 4, LUA_DIRSEP)); + if (f != NULL) return 1; + else { /* error message is on top of the stack */ + lua_pushnil(L); + lua_insert(L, -2); + return 2; /* return nil + error message */ + } +} + + +static const char *findfile (lua_State *L, const char *name, + const char *pname, + const char *dirsep) { + const char *path; + lua_getfield(L, lua_upvalueindex(1), pname); + path = lua_tostring(L, -1); + if (path == NULL) + luaL_error(L, LUA_QL("package.%s") " must be a string", pname); + return searchpath(L, name, path, ".", dirsep); +} + + +static int checkload (lua_State *L, int stat, const char *filename) { + if (stat) { /* module loaded successfully? */ + lua_pushstring(L, filename); /* will be 2nd argument to module */ + return 2; /* return open function and file name */ + } + else + return luaL_error(L, "error loading module " LUA_QS + " from file " LUA_QS ":\n\t%s", + lua_tostring(L, 1), filename, lua_tostring(L, -1)); +} + + +static int searcher_Lua (lua_State *L) { + const char *filename; + const char *name = luaL_checkstring(L, 1); + filename = findfile(L, name, "path", LUA_LSUBSEP); + if (filename == NULL) return 1; /* module not found in this path */ + return checkload(L, (luaL_loadfile(L, filename) == LUA_OK), filename); +} + + +static int loadfunc (lua_State *L, const char *filename, const char *modname) { + const char *funcname; + const char *mark; + modname = luaL_gsub(L, modname, ".", LUA_OFSEP); + mark = strchr(modname, *LUA_IGMARK); + if (mark) { + int stat; + funcname = lua_pushlstring(L, modname, mark - modname); + funcname = lua_pushfstring(L, LUA_POF"%s", funcname); + stat = ll_loadfunc(L, filename, funcname); + if (stat != ERRFUNC) return stat; + modname = mark + 1; /* else go ahead and try old-style name */ + } + funcname = lua_pushfstring(L, LUA_POF"%s", modname); + return ll_loadfunc(L, filename, funcname); +} + + +static int searcher_C (lua_State *L) { + const char *name = luaL_checkstring(L, 1); + const char *filename = findfile(L, name, "cpath", LUA_CSUBSEP); + if (filename == NULL) return 1; /* module not found in this path */ + return checkload(L, (loadfunc(L, filename, name) == 0), filename); +} + + +static int searcher_Croot (lua_State *L) { + const char *filename; + const char *name = luaL_checkstring(L, 1); + const char *p = strchr(name, '.'); + int stat; + if (p == NULL) return 0; /* is root */ + lua_pushlstring(L, name, p - name); + filename = findfile(L, lua_tostring(L, -1), "cpath", LUA_CSUBSEP); + if (filename == NULL) return 1; /* root not found */ + if ((stat = loadfunc(L, filename, name)) != 0) { + if (stat != ERRFUNC) + return checkload(L, 0, filename); /* real error */ + else { /* open function not found */ + lua_pushfstring(L, "\n\tno module " LUA_QS " in file " LUA_QS, + name, filename); + return 1; + } + } + lua_pushstring(L, filename); /* will be 2nd argument to module */ + return 2; +} + + +static int searcher_preload (lua_State *L) { + const char *name = luaL_checkstring(L, 1); + lua_getfield(L, LUA_REGISTRYINDEX, "_PRELOAD"); + lua_getfield(L, -1, name); + if (lua_isnil(L, -1)) /* not found? */ + lua_pushfstring(L, "\n\tno field package.preload['%s']", name); + return 1; +} + + +static void findloader (lua_State *L, const char *name) { + int i; + luaL_Buffer msg; /* to build error message */ + luaL_buffinit(L, &msg); + lua_getfield(L, lua_upvalueindex(1), "searchers"); /* will be at index 3 */ + if (!lua_istable(L, 3)) + luaL_error(L, LUA_QL("package.searchers") " must be a table"); + /* iterate over available searchers to find a loader */ + for (i = 1; ; i++) { + lua_rawgeti(L, 3, i); /* get a searcher */ + if (lua_isnil(L, -1)) { /* no more searchers? */ + lua_pop(L, 1); /* remove nil */ + luaL_pushresult(&msg); /* create error message */ + luaL_error(L, "module " LUA_QS " not found:%s", + name, lua_tostring(L, -1)); + } + lua_pushstring(L, name); + lua_call(L, 1, 2); /* call it */ + if (lua_isfunction(L, -2)) /* did it find a loader? */ + return; /* module loader found */ + else if (lua_isstring(L, -2)) { /* searcher returned error message? */ + lua_pop(L, 1); /* remove extra return */ + luaL_addvalue(&msg); /* concatenate error message */ + } + else + lua_pop(L, 2); /* remove both returns */ + } +} + + +static int ll_require (lua_State *L) { + const char *name = luaL_checkstring(L, 1); + lua_settop(L, 1); /* _LOADED table will be at index 2 */ + lua_getfield(L, LUA_REGISTRYINDEX, "_LOADED"); + lua_getfield(L, 2, name); /* _LOADED[name] */ + if (lua_toboolean(L, -1)) /* is it there? */ + return 1; /* package is already loaded */ + /* else must load package */ + lua_pop(L, 1); /* remove 'getfield' result */ + findloader(L, name); + lua_pushstring(L, name); /* pass name as argument to module loader */ + lua_insert(L, -2); /* name is 1st argument (before search data) */ + lua_call(L, 2, 1); /* run loader to load module */ + if (!lua_isnil(L, -1)) /* non-nil return? */ + lua_setfield(L, 2, name); /* _LOADED[name] = returned value */ + lua_getfield(L, 2, name); + if (lua_isnil(L, -1)) { /* module did not set a value? */ + lua_pushboolean(L, 1); /* use true as result */ + lua_pushvalue(L, -1); /* extra copy to be returned */ + lua_setfield(L, 2, name); /* _LOADED[name] = true */ + } + return 1; +} + +/* }====================================================== */ + + + +/* +** {====================================================== +** 'module' function +** ======================================================= +*/ +#if defined(LUA_COMPAT_MODULE) + +/* +** changes the environment variable of calling function +*/ +static void set_env (lua_State *L) { + lua_Debug ar; + if (lua_getstack(L, 1, &ar) == 0 || + lua_getinfo(L, "f", &ar) == 0 || /* get calling function */ + lua_iscfunction(L, -1)) + luaL_error(L, LUA_QL("module") " not called from a Lua function"); + lua_pushvalue(L, -2); /* copy new environment table to top */ + lua_setupvalue(L, -2, 1); + lua_pop(L, 1); /* remove function */ +} + + +static void dooptions (lua_State *L, int n) { + int i; + for (i = 2; i <= n; i++) { + if (lua_isfunction(L, i)) { /* avoid 'calling' extra info. */ + lua_pushvalue(L, i); /* get option (a function) */ + lua_pushvalue(L, -2); /* module */ + lua_call(L, 1, 0); + } + } +} + + +static void modinit (lua_State *L, const char *modname) { + const char *dot; + lua_pushvalue(L, -1); + lua_setfield(L, -2, "_M"); /* module._M = module */ + lua_pushstring(L, modname); + lua_setfield(L, -2, "_NAME"); + dot = strrchr(modname, '.'); /* look for last dot in module name */ + if (dot == NULL) dot = modname; + else dot++; + /* set _PACKAGE as package name (full module name minus last part) */ + lua_pushlstring(L, modname, dot - modname); + lua_setfield(L, -2, "_PACKAGE"); +} + + +static int ll_module (lua_State *L) { + const char *modname = luaL_checkstring(L, 1); + int lastarg = lua_gettop(L); /* last parameter */ + luaL_pushmodule(L, modname, 1); /* get/create module table */ + /* check whether table already has a _NAME field */ + lua_getfield(L, -1, "_NAME"); + if (!lua_isnil(L, -1)) /* is table an initialized module? */ + lua_pop(L, 1); + else { /* no; initialize it */ + lua_pop(L, 1); + modinit(L, modname); + } + lua_pushvalue(L, -1); + set_env(L); + dooptions(L, lastarg); + return 1; +} + + +static int ll_seeall (lua_State *L) { + luaL_checktype(L, 1, LUA_TTABLE); + if (!lua_getmetatable(L, 1)) { + lua_createtable(L, 0, 1); /* create new metatable */ + lua_pushvalue(L, -1); + lua_setmetatable(L, 1); + } + lua_pushglobaltable(L); + lua_setfield(L, -2, "__index"); /* mt.__index = _G */ + return 0; +} + +#endif +/* }====================================================== */ + + + +/* auxiliary mark (for internal use) */ +#define AUXMARK "\1" + + +/* +** return registry.LUA_NOENV as a boolean +*/ +static int noenv (lua_State *L) { + int b; + lua_getfield(L, LUA_REGISTRYINDEX, "LUA_NOENV"); + b = lua_toboolean(L, -1); + lua_pop(L, 1); /* remove value */ + return b; +} + + +static void setpath (lua_State *L, const char *fieldname, const char *envname1, + const char *envname2, const char *def) { + const char *path = getenv(envname1); + if (path == NULL) /* no environment variable? */ + path = getenv(envname2); /* try alternative name */ + if (path == NULL || noenv(L)) /* no environment variable? */ + lua_pushstring(L, def); /* use default */ + else { + /* replace ";;" by ";AUXMARK;" and then AUXMARK by default path */ + path = luaL_gsub(L, path, LUA_PATH_SEP LUA_PATH_SEP, + LUA_PATH_SEP AUXMARK LUA_PATH_SEP); + luaL_gsub(L, path, AUXMARK, def); + lua_remove(L, -2); + } + setprogdir(L); + lua_setfield(L, -2, fieldname); +} + + +static const luaL_Reg pk_funcs[] = { + {"loadlib", ll_loadlib}, + {"searchpath", ll_searchpath}, +#if defined(LUA_COMPAT_MODULE) + {"seeall", ll_seeall}, +#endif + {NULL, NULL} +}; + + +static const luaL_Reg ll_funcs[] = { +#if defined(LUA_COMPAT_MODULE) + {"module", ll_module}, +#endif + {"require", ll_require}, + {NULL, NULL} +}; + + +static void createsearcherstable (lua_State *L) { + static const lua_CFunction searchers[] = + {searcher_preload, searcher_Lua, searcher_C, searcher_Croot, NULL}; + int i; + /* create 'searchers' table */ + lua_createtable(L, sizeof(searchers)/sizeof(searchers[0]) - 1, 0); + /* fill it with pre-defined searchers */ + for (i=0; searchers[i] != NULL; i++) { + lua_pushvalue(L, -2); /* set 'package' as upvalue for all searchers */ + lua_pushcclosure(L, searchers[i], 1); + lua_rawseti(L, -2, i+1); + } +} + + +LUAMOD_API int luaopen_package (lua_State *L) { + /* create table CLIBS to keep track of loaded C libraries */ + luaL_getsubtable(L, LUA_REGISTRYINDEX, CLIBS); + lua_createtable(L, 0, 1); /* metatable for CLIBS */ + lua_pushcfunction(L, gctm); + lua_setfield(L, -2, "__gc"); /* set finalizer for CLIBS table */ + lua_setmetatable(L, -2); + /* create `package' table */ + luaL_newlib(L, pk_funcs); + createsearcherstable(L); +#if defined(LUA_COMPAT_LOADERS) + lua_pushvalue(L, -1); /* make a copy of 'searchers' table */ + lua_setfield(L, -3, "loaders"); /* put it in field `loaders' */ +#endif + lua_setfield(L, -2, "searchers"); /* put it in field 'searchers' */ + /* set field 'path' */ + setpath(L, "path", LUA_PATHVERSION, LUA_PATH, LUA_PATH_DEFAULT); + /* set field 'cpath' */ + setpath(L, "cpath", LUA_CPATHVERSION, LUA_CPATH, LUA_CPATH_DEFAULT); + /* store config information */ + lua_pushliteral(L, LUA_DIRSEP "\n" LUA_PATH_SEP "\n" LUA_PATH_MARK "\n" + LUA_EXEC_DIR "\n" LUA_IGMARK "\n"); + lua_setfield(L, -2, "config"); + /* set field `loaded' */ + luaL_getsubtable(L, LUA_REGISTRYINDEX, "_LOADED"); + lua_setfield(L, -2, "loaded"); + /* set field `preload' */ + luaL_getsubtable(L, LUA_REGISTRYINDEX, "_PRELOAD"); + lua_setfield(L, -2, "preload"); + lua_pushglobaltable(L); + lua_pushvalue(L, -2); /* set 'package' as upvalue for next lib */ + luaL_setfuncs(L, ll_funcs, 1); /* open lib into global table */ + lua_pop(L, 1); /* pop global table */ + return 1; /* return 'package' table */ +} + diff --git a/liblua/lobject.c b/liblua/lobject.c new file mode 100644 index 00000000..c152785a --- /dev/null +++ b/liblua/lobject.c @@ -0,0 +1,287 @@ +/* +** $Id: lobject.c,v 2.58 2013/02/20 14:08:56 roberto Exp $ +** Some generic functions over Lua objects +** See Copyright Notice in lua.h +*/ + +#include +#include +#include +#include + +#define lobject_c +#define LUA_CORE + +#include "lua.h" + +#include "lctype.h" +#include "ldebug.h" +#include "ldo.h" +#include "lmem.h" +#include "lobject.h" +#include "lstate.h" +#include "lstring.h" +#include "lvm.h" + + + +LUAI_DDEF const TValue luaO_nilobject_ = {NILCONSTANT}; + + +/* +** converts an integer to a "floating point byte", represented as +** (eeeeexxx), where the real value is (1xxx) * 2^(eeeee - 1) if +** eeeee != 0 and (xxx) otherwise. +*/ +int luaO_int2fb (unsigned int x) { + int e = 0; /* exponent */ + if (x < 8) return x; + while (x >= 0x10) { + x = (x+1) >> 1; + e++; + } + return ((e+1) << 3) | (cast_int(x) - 8); +} + + +/* converts back */ +int luaO_fb2int (int x) { + int e = (x >> 3) & 0x1f; + if (e == 0) return x; + else return ((x & 7) + 8) << (e - 1); +} + + +int luaO_ceillog2 (unsigned int x) { + static const lu_byte log_2[256] = { + 0,1,2,2,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5, + 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6, + 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7, + 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7, + 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, + 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, + 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, + 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8 + }; + int l = 0; + x--; + while (x >= 256) { l += 8; x >>= 8; } + return l + log_2[x]; +} + + +lua_Number luaO_arith (int op, lua_Number v1, lua_Number v2) { + switch (op) { + case LUA_OPADD: return luai_numadd(NULL, v1, v2); + case LUA_OPSUB: return luai_numsub(NULL, v1, v2); + case LUA_OPMUL: return luai_nummul(NULL, v1, v2); + case LUA_OPDIV: return luai_numdiv(NULL, v1, v2); + case LUA_OPMOD: return luai_nummod(NULL, v1, v2); + case LUA_OPPOW: return luai_numpow(NULL, v1, v2); + case LUA_OPUNM: return luai_numunm(NULL, v1); + default: lua_assert(0); return 0; + } +} + + +int luaO_hexavalue (int c) { + if (lisdigit(c)) return c - '0'; + else return ltolower(c) - 'a' + 10; +} + + +#if !defined(lua_strx2number) + +#include + + +static int isneg (const char **s) { + if (**s == '-') { (*s)++; return 1; } + else if (**s == '+') (*s)++; + return 0; +} + + +static lua_Number readhexa (const char **s, lua_Number r, int *count) { + for (; lisxdigit(cast_uchar(**s)); (*s)++) { /* read integer part */ + r = (r * cast_num(16.0)) + cast_num(luaO_hexavalue(cast_uchar(**s))); + (*count)++; + } + return r; +} + + +/* +** convert an hexadecimal numeric string to a number, following +** C99 specification for 'strtod' +*/ +static lua_Number lua_strx2number (const char *s, char **endptr) { + lua_Number r = 0.0; + int e = 0, i = 0; + int neg = 0; /* 1 if number is negative */ + *endptr = cast(char *, s); /* nothing is valid yet */ + while (lisspace(cast_uchar(*s))) s++; /* skip initial spaces */ + neg = isneg(&s); /* check signal */ + if (!(*s == '0' && (*(s + 1) == 'x' || *(s + 1) == 'X'))) /* check '0x' */ + return 0.0; /* invalid format (no '0x') */ + s += 2; /* skip '0x' */ + r = readhexa(&s, r, &i); /* read integer part */ + if (*s == '.') { + s++; /* skip dot */ + r = readhexa(&s, r, &e); /* read fractional part */ + } + if (i == 0 && e == 0) + return 0.0; /* invalid format (no digit) */ + e *= -4; /* each fractional digit divides value by 2^-4 */ + *endptr = cast(char *, s); /* valid up to here */ + if (*s == 'p' || *s == 'P') { /* exponent part? */ + int exp1 = 0; + int neg1; + s++; /* skip 'p' */ + neg1 = isneg(&s); /* signal */ + if (!lisdigit(cast_uchar(*s))) + goto ret; /* must have at least one digit */ + while (lisdigit(cast_uchar(*s))) /* read exponent */ + exp1 = exp1 * 10 + *(s++) - '0'; + if (neg1) exp1 = -exp1; + e += exp1; + } + *endptr = cast(char *, s); /* valid up to here */ + ret: + if (neg) r = -r; + return l_mathop(ldexp)(r, e); +} + +#endif + + +int luaO_str2d (const char *s, size_t len, lua_Number *result) { + char *endptr; + if (strpbrk(s, "nN")) /* reject 'inf' and 'nan' */ + return 0; + else if (strpbrk(s, "xX")) /* hexa? */ + *result = lua_strx2number(s, &endptr); + else + *result = lua_str2number(s, &endptr); + if (endptr == s) return 0; /* nothing recognized */ + while (lisspace(cast_uchar(*endptr))) endptr++; + return (endptr == s + len); /* OK if no trailing characters */ +} + + + +static void pushstr (lua_State *L, const char *str, size_t l) { + setsvalue2s(L, L->top++, luaS_newlstr(L, str, l)); +} + + +/* this function handles only `%d', `%c', %f, %p, and `%s' formats */ +const char *luaO_pushvfstring (lua_State *L, const char *fmt, va_list argp) { + int n = 0; + for (;;) { + const char *e = strchr(fmt, '%'); + if (e == NULL) break; + luaD_checkstack(L, 2); /* fmt + item */ + pushstr(L, fmt, e - fmt); + switch (*(e+1)) { + case 's': { + const char *s = va_arg(argp, char *); + if (s == NULL) s = "(null)"; + pushstr(L, s, strlen(s)); + break; + } + case 'c': { + char buff; + buff = cast(char, va_arg(argp, int)); + pushstr(L, &buff, 1); + break; + } + case 'd': { + setnvalue(L->top++, cast_num(va_arg(argp, int))); + break; + } + case 'f': { + setnvalue(L->top++, cast_num(va_arg(argp, l_uacNumber))); + break; + } + case 'p': { + char buff[4*sizeof(void *) + 8]; /* should be enough space for a `%p' */ + int l = sprintf(buff, "%p", va_arg(argp, void *)); + pushstr(L, buff, l); + break; + } + case '%': { + pushstr(L, "%", 1); + break; + } + default: { + luaG_runerror(L, + "invalid option " LUA_QL("%%%c") " to " LUA_QL("lua_pushfstring"), + *(e + 1)); + } + } + n += 2; + fmt = e+2; + } + luaD_checkstack(L, 1); + pushstr(L, fmt, strlen(fmt)); + if (n > 0) luaV_concat(L, n + 1); + return svalue(L->top - 1); +} + + +const char *luaO_pushfstring (lua_State *L, const char *fmt, ...) { + const char *msg; + va_list argp; + va_start(argp, fmt); + msg = luaO_pushvfstring(L, fmt, argp); + va_end(argp); + return msg; +} + + +/* number of chars of a literal string without the ending \0 */ +#define LL(x) (sizeof(x)/sizeof(char) - 1) + +#define RETS "..." +#define PRE "[string \"" +#define POS "\"]" + +#define addstr(a,b,l) ( memcpy(a,b,(l) * sizeof(char)), a += (l) ) + +void luaO_chunkid (char *out, const char *source, size_t bufflen) { + size_t l = strlen(source); + if (*source == '=') { /* 'literal' source */ + if (l <= bufflen) /* small enough? */ + memcpy(out, source + 1, l * sizeof(char)); + else { /* truncate it */ + addstr(out, source + 1, bufflen - 1); + *out = '\0'; + } + } + else if (*source == '@') { /* file name */ + if (l <= bufflen) /* small enough? */ + memcpy(out, source + 1, l * sizeof(char)); + else { /* add '...' before rest of name */ + addstr(out, RETS, LL(RETS)); + bufflen -= LL(RETS); + memcpy(out, source + 1 + l - bufflen, bufflen * sizeof(char)); + } + } + else { /* string; format as [string "source"] */ + const char *nl = strchr(source, '\n'); /* find first new line (if any) */ + addstr(out, PRE, LL(PRE)); /* add prefix */ + bufflen -= LL(PRE RETS POS) + 1; /* save space for prefix+suffix+'\0' */ + if (l < bufflen && nl == NULL) { /* small one-line source? */ + addstr(out, source, l); /* keep it */ + } + else { + if (nl != NULL) l = nl - source; /* stop at first newline */ + if (l > bufflen) l = bufflen; + addstr(out, source, l); + addstr(out, RETS, LL(RETS)); + } + memcpy(out, POS, (LL(POS) + 1) * sizeof(char)); + } +} + diff --git a/liblua/lobject.h b/liblua/lobject.h new file mode 100644 index 00000000..dd23b914 --- /dev/null +++ b/liblua/lobject.h @@ -0,0 +1,607 @@ +/* +** $Id: lobject.h,v 2.71 2012/09/11 18:21:44 roberto Exp $ +** Type definitions for Lua objects +** See Copyright Notice in lua.h +*/ + + +#ifndef lobject_h +#define lobject_h + + +#include + + +#include "llimits.h" +#include "lua.h" + + +/* +** Extra tags for non-values +*/ +#define LUA_TPROTO LUA_NUMTAGS +#define LUA_TUPVAL (LUA_NUMTAGS+1) +#define LUA_TDEADKEY (LUA_NUMTAGS+2) + +/* +** number of all possible tags (including LUA_TNONE but excluding DEADKEY) +*/ +#define LUA_TOTALTAGS (LUA_TUPVAL+2) + + +/* +** tags for Tagged Values have the following use of bits: +** bits 0-3: actual tag (a LUA_T* value) +** bits 4-5: variant bits +** bit 6: whether value is collectable +*/ + +#define VARBITS (3 << 4) + + +/* +** LUA_TFUNCTION variants: +** 0 - Lua function +** 1 - light C function +** 2 - regular C function (closure) +*/ + +/* Variant tags for functions */ +#define LUA_TLCL (LUA_TFUNCTION | (0 << 4)) /* Lua closure */ +#define LUA_TLCF (LUA_TFUNCTION | (1 << 4)) /* light C function */ +#define LUA_TCCL (LUA_TFUNCTION | (2 << 4)) /* C closure */ + + +/* Variant tags for strings */ +#define LUA_TSHRSTR (LUA_TSTRING | (0 << 4)) /* short strings */ +#define LUA_TLNGSTR (LUA_TSTRING | (1 << 4)) /* long strings */ + + +/* Bit mark for collectable types */ +#define BIT_ISCOLLECTABLE (1 << 6) + +/* mark a tag as collectable */ +#define ctb(t) ((t) | BIT_ISCOLLECTABLE) + + +/* +** Union of all collectable objects +*/ +typedef union GCObject GCObject; + + +/* +** Common Header for all collectable objects (in macro form, to be +** included in other objects) +*/ +#define CommonHeader GCObject *next; lu_byte tt; lu_byte marked + + +/* +** Common header in struct form +*/ +typedef struct GCheader { + CommonHeader; +} GCheader; + + + +/* +** Union of all Lua values +*/ +typedef union Value Value; + + +#define numfield lua_Number n; /* numbers */ + + + +/* +** Tagged Values. This is the basic representation of values in Lua, +** an actual value plus a tag with its type. +*/ + +#define TValuefields Value value_; int tt_ + +typedef struct lua_TValue TValue; + + +/* macro defining a nil value */ +#define NILCONSTANT {NULL}, LUA_TNIL + + +#define val_(o) ((o)->value_) +#define num_(o) (val_(o).n) + + +/* raw type tag of a TValue */ +#define rttype(o) ((o)->tt_) + +/* tag with no variants (bits 0-3) */ +#define novariant(x) ((x) & 0x0F) + +/* type tag of a TValue (bits 0-3 for tags + variant bits 4-5) */ +#define ttype(o) (rttype(o) & 0x3F) + +/* type tag of a TValue with no variants (bits 0-3) */ +#define ttypenv(o) (novariant(rttype(o))) + + +/* Macros to test type */ +#define checktag(o,t) (rttype(o) == (t)) +#define checktype(o,t) (ttypenv(o) == (t)) +#define ttisnumber(o) checktag((o), LUA_TNUMBER) +#define ttisnil(o) checktag((o), LUA_TNIL) +#define ttisboolean(o) checktag((o), LUA_TBOOLEAN) +#define ttislightuserdata(o) checktag((o), LUA_TLIGHTUSERDATA) +#define ttisstring(o) checktype((o), LUA_TSTRING) +#define ttisshrstring(o) checktag((o), ctb(LUA_TSHRSTR)) +#define ttislngstring(o) checktag((o), ctb(LUA_TLNGSTR)) +#define ttistable(o) checktag((o), ctb(LUA_TTABLE)) +#define ttisfunction(o) checktype(o, LUA_TFUNCTION) +#define ttisclosure(o) ((rttype(o) & 0x1F) == LUA_TFUNCTION) +#define ttisCclosure(o) checktag((o), ctb(LUA_TCCL)) +#define ttisLclosure(o) checktag((o), ctb(LUA_TLCL)) +#define ttislcf(o) checktag((o), LUA_TLCF) +#define ttisuserdata(o) checktag((o), ctb(LUA_TUSERDATA)) +#define ttisthread(o) checktag((o), ctb(LUA_TTHREAD)) +#define ttisdeadkey(o) checktag((o), LUA_TDEADKEY) + +#define ttisequal(o1,o2) (rttype(o1) == rttype(o2)) + +/* Macros to access values */ +#define nvalue(o) check_exp(ttisnumber(o), num_(o)) +#define gcvalue(o) check_exp(iscollectable(o), val_(o).gc) +#define pvalue(o) check_exp(ttislightuserdata(o), val_(o).p) +#define rawtsvalue(o) check_exp(ttisstring(o), &val_(o).gc->ts) +#define tsvalue(o) (&rawtsvalue(o)->tsv) +#define rawuvalue(o) check_exp(ttisuserdata(o), &val_(o).gc->u) +#define uvalue(o) (&rawuvalue(o)->uv) +#define clvalue(o) check_exp(ttisclosure(o), &val_(o).gc->cl) +#define clLvalue(o) check_exp(ttisLclosure(o), &val_(o).gc->cl.l) +#define clCvalue(o) check_exp(ttisCclosure(o), &val_(o).gc->cl.c) +#define fvalue(o) check_exp(ttislcf(o), val_(o).f) +#define hvalue(o) check_exp(ttistable(o), &val_(o).gc->h) +#define bvalue(o) check_exp(ttisboolean(o), val_(o).b) +#define thvalue(o) check_exp(ttisthread(o), &val_(o).gc->th) +/* a dead value may get the 'gc' field, but cannot access its contents */ +#define deadvalue(o) check_exp(ttisdeadkey(o), cast(void *, val_(o).gc)) + +#define l_isfalse(o) (ttisnil(o) || (ttisboolean(o) && bvalue(o) == 0)) + + +#define iscollectable(o) (rttype(o) & BIT_ISCOLLECTABLE) + + +/* Macros for internal tests */ +#define righttt(obj) (ttype(obj) == gcvalue(obj)->gch.tt) + +#define checkliveness(g,obj) \ + lua_longassert(!iscollectable(obj) || \ + (righttt(obj) && !isdead(g,gcvalue(obj)))) + + +/* Macros to set values */ +#define settt_(o,t) ((o)->tt_=(t)) + +#define setnvalue(obj,x) \ + { TValue *io=(obj); num_(io)=(x); settt_(io, LUA_TNUMBER); } + +#define setnilvalue(obj) settt_(obj, LUA_TNIL) + +#define setfvalue(obj,x) \ + { TValue *io=(obj); val_(io).f=(x); settt_(io, LUA_TLCF); } + +#define setpvalue(obj,x) \ + { TValue *io=(obj); val_(io).p=(x); settt_(io, LUA_TLIGHTUSERDATA); } + +#define setbvalue(obj,x) \ + { TValue *io=(obj); val_(io).b=(x); settt_(io, LUA_TBOOLEAN); } + +#define setgcovalue(L,obj,x) \ + { TValue *io=(obj); GCObject *i_g=(x); \ + val_(io).gc=i_g; settt_(io, ctb(gch(i_g)->tt)); } + +#define setsvalue(L,obj,x) \ + { TValue *io=(obj); \ + TString *x_ = (x); \ + val_(io).gc=cast(GCObject *, x_); settt_(io, ctb(x_->tsv.tt)); \ + checkliveness(G(L),io); } + +#define setuvalue(L,obj,x) \ + { TValue *io=(obj); \ + val_(io).gc=cast(GCObject *, (x)); settt_(io, ctb(LUA_TUSERDATA)); \ + checkliveness(G(L),io); } + +#define setthvalue(L,obj,x) \ + { TValue *io=(obj); \ + val_(io).gc=cast(GCObject *, (x)); settt_(io, ctb(LUA_TTHREAD)); \ + checkliveness(G(L),io); } + +#define setclLvalue(L,obj,x) \ + { TValue *io=(obj); \ + val_(io).gc=cast(GCObject *, (x)); settt_(io, ctb(LUA_TLCL)); \ + checkliveness(G(L),io); } + +#define setclCvalue(L,obj,x) \ + { TValue *io=(obj); \ + val_(io).gc=cast(GCObject *, (x)); settt_(io, ctb(LUA_TCCL)); \ + checkliveness(G(L),io); } + +#define sethvalue(L,obj,x) \ + { TValue *io=(obj); \ + val_(io).gc=cast(GCObject *, (x)); settt_(io, ctb(LUA_TTABLE)); \ + checkliveness(G(L),io); } + +#define setdeadvalue(obj) settt_(obj, LUA_TDEADKEY) + + + +#define setobj(L,obj1,obj2) \ + { const TValue *io2=(obj2); TValue *io1=(obj1); \ + io1->value_ = io2->value_; io1->tt_ = io2->tt_; \ + checkliveness(G(L),io1); } + + +/* +** different types of assignments, according to destination +*/ + +/* from stack to (same) stack */ +#define setobjs2s setobj +/* to stack (not from same stack) */ +#define setobj2s setobj +#define setsvalue2s setsvalue +#define sethvalue2s sethvalue +#define setptvalue2s setptvalue +/* from table to same table */ +#define setobjt2t setobj +/* to table */ +#define setobj2t setobj +/* to new object */ +#define setobj2n setobj +#define setsvalue2n setsvalue + + +/* check whether a number is valid (useful only for NaN trick) */ +#define luai_checknum(L,o,c) { /* empty */ } + + +/* +** {====================================================== +** NaN Trick +** ======================================================= +*/ +#if defined(LUA_NANTRICK) + +/* +** numbers are represented in the 'd_' field. All other values have the +** value (NNMARK | tag) in 'tt__'. A number with such pattern would be +** a "signaled NaN", which is never generated by regular operations by +** the CPU (nor by 'strtod') +*/ + +/* allows for external implementation for part of the trick */ +#if !defined(NNMARK) /* { */ + + +#if !defined(LUA_IEEEENDIAN) +#error option 'LUA_NANTRICK' needs 'LUA_IEEEENDIAN' +#endif + + +#define NNMARK 0x7FF7A500 +#define NNMASK 0x7FFFFF00 + +#undef TValuefields +#undef NILCONSTANT + +#if (LUA_IEEEENDIAN == 0) /* { */ + +/* little endian */ +#define TValuefields \ + union { struct { Value v__; int tt__; } i; double d__; } u +#define NILCONSTANT {{{NULL}, tag2tt(LUA_TNIL)}} +/* field-access macros */ +#define v_(o) ((o)->u.i.v__) +#define d_(o) ((o)->u.d__) +#define tt_(o) ((o)->u.i.tt__) + +#else /* }{ */ + +/* big endian */ +#define TValuefields \ + union { struct { int tt__; Value v__; } i; double d__; } u +#define NILCONSTANT {{tag2tt(LUA_TNIL), {NULL}}} +/* field-access macros */ +#define v_(o) ((o)->u.i.v__) +#define d_(o) ((o)->u.d__) +#define tt_(o) ((o)->u.i.tt__) + +#endif /* } */ + +#endif /* } */ + + +/* correspondence with standard representation */ +#undef val_ +#define val_(o) v_(o) +#undef num_ +#define num_(o) d_(o) + + +#undef numfield +#define numfield /* no such field; numbers are the entire struct */ + +/* basic check to distinguish numbers from non-numbers */ +#undef ttisnumber +#define ttisnumber(o) ((tt_(o) & NNMASK) != NNMARK) + +#define tag2tt(t) (NNMARK | (t)) + +#undef rttype +#define rttype(o) (ttisnumber(o) ? LUA_TNUMBER : tt_(o) & 0xff) + +#undef settt_ +#define settt_(o,t) (tt_(o) = tag2tt(t)) + +#undef setnvalue +#define setnvalue(obj,x) \ + { TValue *io_=(obj); num_(io_)=(x); lua_assert(ttisnumber(io_)); } + +#undef setobj +#define setobj(L,obj1,obj2) \ + { const TValue *o2_=(obj2); TValue *o1_=(obj1); \ + o1_->u = o2_->u; \ + checkliveness(G(L),o1_); } + + +/* +** these redefinitions are not mandatory, but these forms are more efficient +*/ + +#undef checktag +#undef checktype +#define checktag(o,t) (tt_(o) == tag2tt(t)) +#define checktype(o,t) (ctb(tt_(o) | VARBITS) == ctb(tag2tt(t) | VARBITS)) + +#undef ttisequal +#define ttisequal(o1,o2) \ + (ttisnumber(o1) ? ttisnumber(o2) : (tt_(o1) == tt_(o2))) + + +#undef luai_checknum +#define luai_checknum(L,o,c) { if (!ttisnumber(o)) c; } + +#endif +/* }====================================================== */ + + + +/* +** {====================================================== +** types and prototypes +** ======================================================= +*/ + + +union Value { + GCObject *gc; /* collectable objects */ + void *p; /* light userdata */ + int b; /* booleans */ + lua_CFunction f; /* light C functions */ + numfield /* numbers */ +}; + + +struct lua_TValue { + TValuefields; +}; + + +typedef TValue *StkId; /* index to stack elements */ + + + + +/* +** Header for string value; string bytes follow the end of this structure +*/ +typedef union TString { + L_Umaxalign dummy; /* ensures maximum alignment for strings */ + struct { + CommonHeader; + lu_byte extra; /* reserved words for short strings; "has hash" for longs */ + unsigned int hash; + size_t len; /* number of characters in string */ + } tsv; +} TString; + + +/* get the actual string (array of bytes) from a TString */ +#define getstr(ts) cast(const char *, (ts) + 1) + +/* get the actual string (array of bytes) from a Lua value */ +#define svalue(o) getstr(rawtsvalue(o)) + + +/* +** Header for userdata; memory area follows the end of this structure +*/ +typedef union Udata { + L_Umaxalign dummy; /* ensures maximum alignment for `local' udata */ + struct { + CommonHeader; + struct Table *metatable; + struct Table *env; + size_t len; /* number of bytes */ + } uv; +} Udata; + + + +/* +** Description of an upvalue for function prototypes +*/ +typedef struct Upvaldesc { + TString *name; /* upvalue name (for debug information) */ + lu_byte instack; /* whether it is in stack */ + lu_byte idx; /* index of upvalue (in stack or in outer function's list) */ +} Upvaldesc; + + +/* +** Description of a local variable for function prototypes +** (used for debug information) +*/ +typedef struct LocVar { + TString *varname; + int startpc; /* first point where variable is active */ + int endpc; /* first point where variable is dead */ +} LocVar; + + +/* +** Function Prototypes +*/ +typedef struct Proto { + CommonHeader; + TValue *k; /* constants used by the function */ + Instruction *code; + struct Proto **p; /* functions defined inside the function */ + int *lineinfo; /* map from opcodes to source lines (debug information) */ + LocVar *locvars; /* information about local variables (debug information) */ + Upvaldesc *upvalues; /* upvalue information */ + union Closure *cache; /* last created closure with this prototype */ + TString *source; /* used for debug information */ + int sizeupvalues; /* size of 'upvalues' */ + int sizek; /* size of `k' */ + int sizecode; + int sizelineinfo; + int sizep; /* size of `p' */ + int sizelocvars; + int linedefined; + int lastlinedefined; + GCObject *gclist; + lu_byte numparams; /* number of fixed parameters */ + lu_byte is_vararg; + lu_byte maxstacksize; /* maximum stack used by this function */ +} Proto; + + + +/* +** Lua Upvalues +*/ +typedef struct UpVal { + CommonHeader; + TValue *v; /* points to stack or to its own value */ + union { + TValue value; /* the value (when closed) */ + struct { /* double linked list (when open) */ + struct UpVal *prev; + struct UpVal *next; + } l; + } u; +} UpVal; + + +/* +** Closures +*/ + +#define ClosureHeader \ + CommonHeader; lu_byte nupvalues; GCObject *gclist + +typedef struct CClosure { + ClosureHeader; + lua_CFunction f; + TValue upvalue[1]; /* list of upvalues */ +} CClosure; + + +typedef struct LClosure { + ClosureHeader; + struct Proto *p; + UpVal *upvals[1]; /* list of upvalues */ +} LClosure; + + +typedef union Closure { + CClosure c; + LClosure l; +} Closure; + + +#define isLfunction(o) ttisLclosure(o) + +#define getproto(o) (clLvalue(o)->p) + + +/* +** Tables +*/ + +typedef union TKey { + struct { + TValuefields; + struct Node *next; /* for chaining */ + } nk; + TValue tvk; +} TKey; + + +typedef struct Node { + TValue i_val; + TKey i_key; +} Node; + + +typedef struct Table { + CommonHeader; + lu_byte flags; /* 1<

lsizenode)) + + +/* +** (address of) a fixed nil value +*/ +#define luaO_nilobject (&luaO_nilobject_) + + +LUAI_DDEC const TValue luaO_nilobject_; + + +LUAI_FUNC int luaO_int2fb (unsigned int x); +LUAI_FUNC int luaO_fb2int (int x); +LUAI_FUNC int luaO_ceillog2 (unsigned int x); +LUAI_FUNC lua_Number luaO_arith (int op, lua_Number v1, lua_Number v2); +LUAI_FUNC int luaO_str2d (const char *s, size_t len, lua_Number *result); +LUAI_FUNC int luaO_hexavalue (int c); +LUAI_FUNC const char *luaO_pushvfstring (lua_State *L, const char *fmt, + va_list argp); +LUAI_FUNC const char *luaO_pushfstring (lua_State *L, const char *fmt, ...); +LUAI_FUNC void luaO_chunkid (char *out, const char *source, size_t len); + + +#endif + diff --git a/liblua/lopcodes.c b/liblua/lopcodes.c new file mode 100644 index 00000000..ef736927 --- /dev/null +++ b/liblua/lopcodes.c @@ -0,0 +1,107 @@ +/* +** $Id: lopcodes.c,v 1.49 2012/05/14 13:34:18 roberto Exp $ +** Opcodes for Lua virtual machine +** See Copyright Notice in lua.h +*/ + + +#define lopcodes_c +#define LUA_CORE + + +#include "lopcodes.h" + + +/* ORDER OP */ + +LUAI_DDEF const char *const luaP_opnames[NUM_OPCODES+1] = { + "MOVE", + "LOADK", + "LOADKX", + "LOADBOOL", + "LOADNIL", + "GETUPVAL", + "GETTABUP", + "GETTABLE", + "SETTABUP", + "SETUPVAL", + "SETTABLE", + "NEWTABLE", + "SELF", + "ADD", + "SUB", + "MUL", + "DIV", + "MOD", + "POW", + "UNM", + "NOT", + "LEN", + "CONCAT", + "JMP", + "EQ", + "LT", + "LE", + "TEST", + "TESTSET", + "CALL", + "TAILCALL", + "RETURN", + "FORLOOP", + "FORPREP", + "TFORCALL", + "TFORLOOP", + "SETLIST", + "CLOSURE", + "VARARG", + "EXTRAARG", + NULL +}; + + +#define opmode(t,a,b,c,m) (((t)<<7) | ((a)<<6) | ((b)<<4) | ((c)<<2) | (m)) + +LUAI_DDEF const lu_byte luaP_opmodes[NUM_OPCODES] = { +/* T A B C mode opcode */ + opmode(0, 1, OpArgR, OpArgN, iABC) /* OP_MOVE */ + ,opmode(0, 1, OpArgK, OpArgN, iABx) /* OP_LOADK */ + ,opmode(0, 1, OpArgN, OpArgN, iABx) /* OP_LOADKX */ + ,opmode(0, 1, OpArgU, OpArgU, iABC) /* OP_LOADBOOL */ + ,opmode(0, 1, OpArgU, OpArgN, iABC) /* OP_LOADNIL */ + ,opmode(0, 1, OpArgU, OpArgN, iABC) /* OP_GETUPVAL */ + ,opmode(0, 1, OpArgU, OpArgK, iABC) /* OP_GETTABUP */ + ,opmode(0, 1, OpArgR, OpArgK, iABC) /* OP_GETTABLE */ + ,opmode(0, 0, OpArgK, OpArgK, iABC) /* OP_SETTABUP */ + ,opmode(0, 0, OpArgU, OpArgN, iABC) /* OP_SETUPVAL */ + ,opmode(0, 0, OpArgK, OpArgK, iABC) /* OP_SETTABLE */ + ,opmode(0, 1, OpArgU, OpArgU, iABC) /* OP_NEWTABLE */ + ,opmode(0, 1, OpArgR, OpArgK, iABC) /* OP_SELF */ + ,opmode(0, 1, OpArgK, OpArgK, iABC) /* OP_ADD */ + ,opmode(0, 1, OpArgK, OpArgK, iABC) /* OP_SUB */ + ,opmode(0, 1, OpArgK, OpArgK, iABC) /* OP_MUL */ + ,opmode(0, 1, OpArgK, OpArgK, iABC) /* OP_DIV */ + ,opmode(0, 1, OpArgK, OpArgK, iABC) /* OP_MOD */ + ,opmode(0, 1, OpArgK, OpArgK, iABC) /* OP_POW */ + ,opmode(0, 1, OpArgR, OpArgN, iABC) /* OP_UNM */ + ,opmode(0, 1, OpArgR, OpArgN, iABC) /* OP_NOT */ + ,opmode(0, 1, OpArgR, OpArgN, iABC) /* OP_LEN */ + ,opmode(0, 1, OpArgR, OpArgR, iABC) /* OP_CONCAT */ + ,opmode(0, 0, OpArgR, OpArgN, iAsBx) /* OP_JMP */ + ,opmode(1, 0, OpArgK, OpArgK, iABC) /* OP_EQ */ + ,opmode(1, 0, OpArgK, OpArgK, iABC) /* OP_LT */ + ,opmode(1, 0, OpArgK, OpArgK, iABC) /* OP_LE */ + ,opmode(1, 0, OpArgN, OpArgU, iABC) /* OP_TEST */ + ,opmode(1, 1, OpArgR, OpArgU, iABC) /* OP_TESTSET */ + ,opmode(0, 1, OpArgU, OpArgU, iABC) /* OP_CALL */ + ,opmode(0, 1, OpArgU, OpArgU, iABC) /* OP_TAILCALL */ + ,opmode(0, 0, OpArgU, OpArgN, iABC) /* OP_RETURN */ + ,opmode(0, 1, OpArgR, OpArgN, iAsBx) /* OP_FORLOOP */ + ,opmode(0, 1, OpArgR, OpArgN, iAsBx) /* OP_FORPREP */ + ,opmode(0, 0, OpArgN, OpArgU, iABC) /* OP_TFORCALL */ + ,opmode(0, 1, OpArgR, OpArgN, iAsBx) /* OP_TFORLOOP */ + ,opmode(0, 0, OpArgU, OpArgU, iABC) /* OP_SETLIST */ + ,opmode(0, 1, OpArgU, OpArgN, iABx) /* OP_CLOSURE */ + ,opmode(0, 1, OpArgU, OpArgN, iABC) /* OP_VARARG */ + ,opmode(0, 0, OpArgU, OpArgU, iAx) /* OP_EXTRAARG */ +}; + diff --git a/liblua/lopcodes.h b/liblua/lopcodes.h new file mode 100644 index 00000000..07d2b3f3 --- /dev/null +++ b/liblua/lopcodes.h @@ -0,0 +1,288 @@ +/* +** $Id: lopcodes.h,v 1.142 2011/07/15 12:50:29 roberto Exp $ +** Opcodes for Lua virtual machine +** See Copyright Notice in lua.h +*/ + +#ifndef lopcodes_h +#define lopcodes_h + +#include "llimits.h" + + +/*=========================================================================== + We assume that instructions are unsigned numbers. + All instructions have an opcode in the first 6 bits. + Instructions can have the following fields: + `A' : 8 bits + `B' : 9 bits + `C' : 9 bits + 'Ax' : 26 bits ('A', 'B', and 'C' together) + `Bx' : 18 bits (`B' and `C' together) + `sBx' : signed Bx + + A signed argument is represented in excess K; that is, the number + value is the unsigned value minus K. K is exactly the maximum value + for that argument (so that -max is represented by 0, and +max is + represented by 2*max), which is half the maximum for the corresponding + unsigned argument. +===========================================================================*/ + + +enum OpMode {iABC, iABx, iAsBx, iAx}; /* basic instruction format */ + + +/* +** size and position of opcode arguments. +*/ +#define SIZE_C 9 +#define SIZE_B 9 +#define SIZE_Bx (SIZE_C + SIZE_B) +#define SIZE_A 8 +#define SIZE_Ax (SIZE_C + SIZE_B + SIZE_A) + +#define SIZE_OP 6 + +#define POS_OP 0 +#define POS_A (POS_OP + SIZE_OP) +#define POS_C (POS_A + SIZE_A) +#define POS_B (POS_C + SIZE_C) +#define POS_Bx POS_C +#define POS_Ax POS_A + + +/* +** limits for opcode arguments. +** we use (signed) int to manipulate most arguments, +** so they must fit in LUAI_BITSINT-1 bits (-1 for sign) +*/ +#if SIZE_Bx < LUAI_BITSINT-1 +#define MAXARG_Bx ((1<>1) /* `sBx' is signed */ +#else +#define MAXARG_Bx MAX_INT +#define MAXARG_sBx MAX_INT +#endif + +#if SIZE_Ax < LUAI_BITSINT-1 +#define MAXARG_Ax ((1<>POS_OP) & MASK1(SIZE_OP,0))) +#define SET_OPCODE(i,o) ((i) = (((i)&MASK0(SIZE_OP,POS_OP)) | \ + ((cast(Instruction, o)<>pos) & MASK1(size,0))) +#define setarg(i,v,pos,size) ((i) = (((i)&MASK0(size,pos)) | \ + ((cast(Instruction, v)<= R(A) + 1 */ +OP_EQ,/* A B C if ((RK(B) == RK(C)) ~= A) then pc++ */ +OP_LT,/* A B C if ((RK(B) < RK(C)) ~= A) then pc++ */ +OP_LE,/* A B C if ((RK(B) <= RK(C)) ~= A) then pc++ */ + +OP_TEST,/* A C if not (R(A) <=> C) then pc++ */ +OP_TESTSET,/* A B C if (R(B) <=> C) then R(A) := R(B) else pc++ */ + +OP_CALL,/* A B C R(A), ... ,R(A+C-2) := R(A)(R(A+1), ... ,R(A+B-1)) */ +OP_TAILCALL,/* A B C return R(A)(R(A+1), ... ,R(A+B-1)) */ +OP_RETURN,/* A B return R(A), ... ,R(A+B-2) (see note) */ + +OP_FORLOOP,/* A sBx R(A)+=R(A+2); + if R(A) > 4) & 3)) +#define getCMode(m) (cast(enum OpArgMask, (luaP_opmodes[m] >> 2) & 3)) +#define testAMode(m) (luaP_opmodes[m] & (1 << 6)) +#define testTMode(m) (luaP_opmodes[m] & (1 << 7)) + + +LUAI_DDEC const char *const luaP_opnames[NUM_OPCODES+1]; /* opcode names */ + + +/* number of list items to accumulate before a SETLIST instruction */ +#define LFIELDS_PER_FLUSH 50 + + +#endif diff --git a/liblua/loslib.c b/liblua/loslib.c new file mode 100644 index 00000000..5170fd0d --- /dev/null +++ b/liblua/loslib.c @@ -0,0 +1,323 @@ +/* +** $Id: loslib.c,v 1.40 2012/10/19 15:54:02 roberto Exp $ +** Standard Operating System library +** See Copyright Notice in lua.h +*/ + + +#include +#include +#include +#include +#include + +#define loslib_c +#define LUA_LIB + +#include "lua.h" + +#include "lauxlib.h" +#include "lualib.h" + + +/* +** list of valid conversion specifiers for the 'strftime' function +*/ +#if !defined(LUA_STRFTIMEOPTIONS) + +#if !defined(LUA_USE_POSIX) +#define LUA_STRFTIMEOPTIONS { "aAbBcdHIjmMpSUwWxXyYz%", "" } +#else +#define LUA_STRFTIMEOPTIONS \ + { "aAbBcCdDeFgGhHIjmMnprRStTuUVwWxXyYzZ%", "" \ + "", "E", "cCxXyY", \ + "O", "deHImMSuUVwWy" } +#endif + +#endif + + + +/* +** By default, Lua uses tmpnam except when POSIX is available, where it +** uses mkstemp. +*/ +#if defined(LUA_USE_MKSTEMP) +#include +#define LUA_TMPNAMBUFSIZE 32 +#define lua_tmpnam(b,e) { \ + strcpy(b, "/tmp/lua_XXXXXX"); \ + e = mkstemp(b); \ + if (e != -1) close(e); \ + e = (e == -1); } + +#elif !defined(lua_tmpnam) + +#define LUA_TMPNAMBUFSIZE L_tmpnam +#define lua_tmpnam(b,e) { e = (tmpnam(b) == NULL); } + +#endif + + +/* +** By default, Lua uses gmtime/localtime, except when POSIX is available, +** where it uses gmtime_r/localtime_r +*/ +#if defined(LUA_USE_GMTIME_R) + +#define l_gmtime(t,r) gmtime_r(t,r) +#define l_localtime(t,r) localtime_r(t,r) + +#elif !defined(l_gmtime) + +#define l_gmtime(t,r) ((void)r, gmtime(t)) +#define l_localtime(t,r) ((void)r, localtime(t)) + +#endif + + + +static int os_execute (lua_State *L) { + const char *cmd = luaL_optstring(L, 1, NULL); + int stat = system(cmd); + if (cmd != NULL) + return luaL_execresult(L, stat); + else { + lua_pushboolean(L, stat); /* true if there is a shell */ + return 1; + } +} + + +static int os_remove (lua_State *L) { + const char *filename = luaL_checkstring(L, 1); + return luaL_fileresult(L, remove(filename) == 0, filename); +} + + +static int os_rename (lua_State *L) { + const char *fromname = luaL_checkstring(L, 1); + const char *toname = luaL_checkstring(L, 2); + return luaL_fileresult(L, rename(fromname, toname) == 0, NULL); +} + + +static int os_tmpname (lua_State *L) { + char buff[LUA_TMPNAMBUFSIZE]; + int err; + lua_tmpnam(buff, err); + if (err) + return luaL_error(L, "unable to generate a unique filename"); + lua_pushstring(L, buff); + return 1; +} + + +static int os_getenv (lua_State *L) { + lua_pushstring(L, getenv(luaL_checkstring(L, 1))); /* if NULL push nil */ + return 1; +} + + +static int os_clock (lua_State *L) { + lua_pushnumber(L, ((lua_Number)clock())/(lua_Number)CLOCKS_PER_SEC); + return 1; +} + + +/* +** {====================================================== +** Time/Date operations +** { year=%Y, month=%m, day=%d, hour=%H, min=%M, sec=%S, +** wday=%w+1, yday=%j, isdst=? } +** ======================================================= +*/ + +static void setfield (lua_State *L, const char *key, int value) { + lua_pushinteger(L, value); + lua_setfield(L, -2, key); +} + +static void setboolfield (lua_State *L, const char *key, int value) { + if (value < 0) /* undefined? */ + return; /* does not set field */ + lua_pushboolean(L, value); + lua_setfield(L, -2, key); +} + +static int getboolfield (lua_State *L, const char *key) { + int res; + lua_getfield(L, -1, key); + res = lua_isnil(L, -1) ? -1 : lua_toboolean(L, -1); + lua_pop(L, 1); + return res; +} + + +static int getfield (lua_State *L, const char *key, int d) { + int res, isnum; + lua_getfield(L, -1, key); + res = (int)lua_tointegerx(L, -1, &isnum); + if (!isnum) { + if (d < 0) + return luaL_error(L, "field " LUA_QS " missing in date table", key); + res = d; + } + lua_pop(L, 1); + return res; +} + + +static const char *checkoption (lua_State *L, const char *conv, char *buff) { + static const char *const options[] = LUA_STRFTIMEOPTIONS; + unsigned int i; + for (i = 0; i < sizeof(options)/sizeof(options[0]); i += 2) { + if (*conv != '\0' && strchr(options[i], *conv) != NULL) { + buff[1] = *conv; + if (*options[i + 1] == '\0') { /* one-char conversion specifier? */ + buff[2] = '\0'; /* end buffer */ + return conv + 1; + } + else if (*(conv + 1) != '\0' && + strchr(options[i + 1], *(conv + 1)) != NULL) { + buff[2] = *(conv + 1); /* valid two-char conversion specifier */ + buff[3] = '\0'; /* end buffer */ + return conv + 2; + } + } + } + luaL_argerror(L, 1, + lua_pushfstring(L, "invalid conversion specifier '%%%s'", conv)); + return conv; /* to avoid warnings */ +} + + +static int os_date (lua_State *L) { + const char *s = luaL_optstring(L, 1, "%c"); + time_t t = luaL_opt(L, (time_t)luaL_checknumber, 2, time(NULL)); + struct tm tmr, *stm; + if (*s == '!') { /* UTC? */ + stm = l_gmtime(&t, &tmr); + s++; /* skip `!' */ + } + else + stm = l_localtime(&t, &tmr); + if (stm == NULL) /* invalid date? */ + lua_pushnil(L); + else if (strcmp(s, "*t") == 0) { + lua_createtable(L, 0, 9); /* 9 = number of fields */ + setfield(L, "sec", stm->tm_sec); + setfield(L, "min", stm->tm_min); + setfield(L, "hour", stm->tm_hour); + setfield(L, "day", stm->tm_mday); + setfield(L, "month", stm->tm_mon+1); + setfield(L, "year", stm->tm_year+1900); + setfield(L, "wday", stm->tm_wday+1); + setfield(L, "yday", stm->tm_yday+1); + setboolfield(L, "isdst", stm->tm_isdst); + } + else { + char cc[4]; + luaL_Buffer b; + cc[0] = '%'; + luaL_buffinit(L, &b); + while (*s) { + if (*s != '%') /* no conversion specifier? */ + luaL_addchar(&b, *s++); + else { + size_t reslen; + char buff[200]; /* should be big enough for any conversion result */ + s = checkoption(L, s + 1, cc); + reslen = strftime(buff, sizeof(buff), cc, stm); + luaL_addlstring(&b, buff, reslen); + } + } + luaL_pushresult(&b); + } + return 1; +} + + +static int os_time (lua_State *L) { + time_t t; + if (lua_isnoneornil(L, 1)) /* called without args? */ + t = time(NULL); /* get current time */ + else { + struct tm ts; + luaL_checktype(L, 1, LUA_TTABLE); + lua_settop(L, 1); /* make sure table is at the top */ + ts.tm_sec = getfield(L, "sec", 0); + ts.tm_min = getfield(L, "min", 0); + ts.tm_hour = getfield(L, "hour", 12); + ts.tm_mday = getfield(L, "day", -1); + ts.tm_mon = getfield(L, "month", -1) - 1; + ts.tm_year = getfield(L, "year", -1) - 1900; + ts.tm_isdst = getboolfield(L, "isdst"); + t = mktime(&ts); + } + if (t == (time_t)(-1)) + lua_pushnil(L); + else + lua_pushnumber(L, (lua_Number)t); + return 1; +} + + +static int os_difftime (lua_State *L) { + lua_pushnumber(L, difftime((time_t)(luaL_checknumber(L, 1)), + (time_t)(luaL_optnumber(L, 2, 0)))); + return 1; +} + +/* }====================================================== */ + + +static int os_setlocale (lua_State *L) { + static const int cat[] = {LC_ALL, LC_COLLATE, LC_CTYPE, LC_MONETARY, + LC_NUMERIC, LC_TIME}; + static const char *const catnames[] = {"all", "collate", "ctype", "monetary", + "numeric", "time", NULL}; + const char *l = luaL_optstring(L, 1, NULL); + int op = luaL_checkoption(L, 2, "all", catnames); + lua_pushstring(L, setlocale(cat[op], l)); + return 1; +} + + +static int os_exit (lua_State *L) { + int status; + if (lua_isboolean(L, 1)) + status = (lua_toboolean(L, 1) ? EXIT_SUCCESS : EXIT_FAILURE); + else + status = luaL_optint(L, 1, EXIT_SUCCESS); + if (lua_toboolean(L, 2)) + lua_close(L); + if (L) exit(status); /* 'if' to avoid warnings for unreachable 'return' */ + return 0; +} + + +static const luaL_Reg syslib[] = { + {"clock", os_clock}, + {"date", os_date}, + {"difftime", os_difftime}, + {"execute", os_execute}, + {"exit", os_exit}, + {"getenv", os_getenv}, + {"remove", os_remove}, + {"rename", os_rename}, + {"setlocale", os_setlocale}, + {"time", os_time}, + {"tmpname", os_tmpname}, + {NULL, NULL} +}; + +/* }====================================================== */ + + + +LUAMOD_API int luaopen_os (lua_State *L) { + luaL_newlib(L, syslib); + return 1; +} + diff --git a/liblua/lparser.c b/liblua/lparser.c new file mode 100644 index 00000000..d8f5b4ff --- /dev/null +++ b/liblua/lparser.c @@ -0,0 +1,1638 @@ +/* +** $Id: lparser.c,v 2.130 2013/02/06 13:37:39 roberto Exp $ +** Lua Parser +** See Copyright Notice in lua.h +*/ + + +#include + +#define lparser_c +#define LUA_CORE + +#include "lua.h" + +#include "lcode.h" +#include "ldebug.h" +#include "ldo.h" +#include "lfunc.h" +#include "llex.h" +#include "lmem.h" +#include "lobject.h" +#include "lopcodes.h" +#include "lparser.h" +#include "lstate.h" +#include "lstring.h" +#include "ltable.h" + + + +/* maximum number of local variables per function (must be smaller + than 250, due to the bytecode format) */ +#define MAXVARS 200 + + +#define hasmultret(k) ((k) == VCALL || (k) == VVARARG) + + + +/* +** nodes for block list (list of active blocks) +*/ +typedef struct BlockCnt { + struct BlockCnt *previous; /* chain */ + short firstlabel; /* index of first label in this block */ + short firstgoto; /* index of first pending goto in this block */ + lu_byte nactvar; /* # active locals outside the block */ + lu_byte upval; /* true if some variable in the block is an upvalue */ + lu_byte isloop; /* true if `block' is a loop */ +} BlockCnt; + + + +/* +** prototypes for recursive non-terminal functions +*/ +static void statement (LexState *ls); +static void expr (LexState *ls, expdesc *v); + + +static void anchor_token (LexState *ls) { + /* last token from outer function must be EOS */ + lua_assert(ls->fs != NULL || ls->t.token == TK_EOS); + if (ls->t.token == TK_NAME || ls->t.token == TK_STRING) { + TString *ts = ls->t.seminfo.ts; + luaX_newstring(ls, getstr(ts), ts->tsv.len); + } +} + + +/* semantic error */ +static l_noret semerror (LexState *ls, const char *msg) { + ls->t.token = 0; /* remove 'near to' from final message */ + luaX_syntaxerror(ls, msg); +} + + +static l_noret error_expected (LexState *ls, int token) { + luaX_syntaxerror(ls, + luaO_pushfstring(ls->L, "%s expected", luaX_token2str(ls, token))); +} + + +static l_noret errorlimit (FuncState *fs, int limit, const char *what) { + lua_State *L = fs->ls->L; + const char *msg; + int line = fs->f->linedefined; + const char *where = (line == 0) + ? "main function" + : luaO_pushfstring(L, "function at line %d", line); + msg = luaO_pushfstring(L, "too many %s (limit is %d) in %s", + what, limit, where); + luaX_syntaxerror(fs->ls, msg); +} + + +static void checklimit (FuncState *fs, int v, int l, const char *what) { + if (v > l) errorlimit(fs, l, what); +} + + +static int testnext (LexState *ls, int c) { + if (ls->t.token == c) { + luaX_next(ls); + return 1; + } + else return 0; +} + + +static void check (LexState *ls, int c) { + if (ls->t.token != c) + error_expected(ls, c); +} + + +static void checknext (LexState *ls, int c) { + check(ls, c); + luaX_next(ls); +} + + +#define check_condition(ls,c,msg) { if (!(c)) luaX_syntaxerror(ls, msg); } + + + +static void check_match (LexState *ls, int what, int who, int where) { + if (!testnext(ls, what)) { + if (where == ls->linenumber) + error_expected(ls, what); + else { + luaX_syntaxerror(ls, luaO_pushfstring(ls->L, + "%s expected (to close %s at line %d)", + luaX_token2str(ls, what), luaX_token2str(ls, who), where)); + } + } +} + + +static TString *str_checkname (LexState *ls) { + TString *ts; + check(ls, TK_NAME); + ts = ls->t.seminfo.ts; + luaX_next(ls); + return ts; +} + + +static void init_exp (expdesc *e, expkind k, int i) { + e->f = e->t = NO_JUMP; + e->k = k; + e->u.info = i; +} + + +static void codestring (LexState *ls, expdesc *e, TString *s) { + init_exp(e, VK, luaK_stringK(ls->fs, s)); +} + + +static void checkname (LexState *ls, expdesc *e) { + codestring(ls, e, str_checkname(ls)); +} + + +static int registerlocalvar (LexState *ls, TString *varname) { + FuncState *fs = ls->fs; + Proto *f = fs->f; + int oldsize = f->sizelocvars; + luaM_growvector(ls->L, f->locvars, fs->nlocvars, f->sizelocvars, + LocVar, SHRT_MAX, "local variables"); + while (oldsize < f->sizelocvars) f->locvars[oldsize++].varname = NULL; + f->locvars[fs->nlocvars].varname = varname; + luaC_objbarrier(ls->L, f, varname); + return fs->nlocvars++; +} + + +static void new_localvar (LexState *ls, TString *name) { + FuncState *fs = ls->fs; + Dyndata *dyd = ls->dyd; + int reg = registerlocalvar(ls, name); + checklimit(fs, dyd->actvar.n + 1 - fs->firstlocal, + MAXVARS, "local variables"); + luaM_growvector(ls->L, dyd->actvar.arr, dyd->actvar.n + 1, + dyd->actvar.size, Vardesc, MAX_INT, "local variables"); + dyd->actvar.arr[dyd->actvar.n++].idx = cast(short, reg); +} + + +static void new_localvarliteral_ (LexState *ls, const char *name, size_t sz) { + new_localvar(ls, luaX_newstring(ls, name, sz)); +} + +#define new_localvarliteral(ls,v) \ + new_localvarliteral_(ls, "" v, (sizeof(v)/sizeof(char))-1) + + +static LocVar *getlocvar (FuncState *fs, int i) { + int idx = fs->ls->dyd->actvar.arr[fs->firstlocal + i].idx; + lua_assert(idx < fs->nlocvars); + return &fs->f->locvars[idx]; +} + + +static void adjustlocalvars (LexState *ls, int nvars) { + FuncState *fs = ls->fs; + fs->nactvar = cast_byte(fs->nactvar + nvars); + for (; nvars; nvars--) { + getlocvar(fs, fs->nactvar - nvars)->startpc = fs->pc; + } +} + + +static void removevars (FuncState *fs, int tolevel) { + fs->ls->dyd->actvar.n -= (fs->nactvar - tolevel); + while (fs->nactvar > tolevel) + getlocvar(fs, --fs->nactvar)->endpc = fs->pc; +} + + +static int searchupvalue (FuncState *fs, TString *name) { + int i; + Upvaldesc *up = fs->f->upvalues; + for (i = 0; i < fs->nups; i++) { + if (luaS_eqstr(up[i].name, name)) return i; + } + return -1; /* not found */ +} + + +static int newupvalue (FuncState *fs, TString *name, expdesc *v) { + Proto *f = fs->f; + int oldsize = f->sizeupvalues; + checklimit(fs, fs->nups + 1, MAXUPVAL, "upvalues"); + luaM_growvector(fs->ls->L, f->upvalues, fs->nups, f->sizeupvalues, + Upvaldesc, MAXUPVAL, "upvalues"); + while (oldsize < f->sizeupvalues) f->upvalues[oldsize++].name = NULL; + f->upvalues[fs->nups].instack = (v->k == VLOCAL); + f->upvalues[fs->nups].idx = cast_byte(v->u.info); + f->upvalues[fs->nups].name = name; + luaC_objbarrier(fs->ls->L, f, name); + return fs->nups++; +} + + +static int searchvar (FuncState *fs, TString *n) { + int i; + for (i = cast_int(fs->nactvar) - 1; i >= 0; i--) { + if (luaS_eqstr(n, getlocvar(fs, i)->varname)) + return i; + } + return -1; /* not found */ +} + + +/* + Mark block where variable at given level was defined + (to emit close instructions later). +*/ +static void markupval (FuncState *fs, int level) { + BlockCnt *bl = fs->bl; + while (bl->nactvar > level) bl = bl->previous; + bl->upval = 1; +} + + +/* + Find variable with given name 'n'. If it is an upvalue, add this + upvalue into all intermediate functions. +*/ +static int singlevaraux (FuncState *fs, TString *n, expdesc *var, int base) { + if (fs == NULL) /* no more levels? */ + return VVOID; /* default is global */ + else { + int v = searchvar(fs, n); /* look up locals at current level */ + if (v >= 0) { /* found? */ + init_exp(var, VLOCAL, v); /* variable is local */ + if (!base) + markupval(fs, v); /* local will be used as an upval */ + return VLOCAL; + } + else { /* not found as local at current level; try upvalues */ + int idx = searchupvalue(fs, n); /* try existing upvalues */ + if (idx < 0) { /* not found? */ + if (singlevaraux(fs->prev, n, var, 0) == VVOID) /* try upper levels */ + return VVOID; /* not found; is a global */ + /* else was LOCAL or UPVAL */ + idx = newupvalue(fs, n, var); /* will be a new upvalue */ + } + init_exp(var, VUPVAL, idx); + return VUPVAL; + } + } +} + + +static void singlevar (LexState *ls, expdesc *var) { + TString *varname = str_checkname(ls); + FuncState *fs = ls->fs; + if (singlevaraux(fs, varname, var, 1) == VVOID) { /* global name? */ + expdesc key; + singlevaraux(fs, ls->envn, var, 1); /* get environment variable */ + lua_assert(var->k == VLOCAL || var->k == VUPVAL); + codestring(ls, &key, varname); /* key is variable name */ + luaK_indexed(fs, var, &key); /* env[varname] */ + } +} + + +static void adjust_assign (LexState *ls, int nvars, int nexps, expdesc *e) { + FuncState *fs = ls->fs; + int extra = nvars - nexps; + if (hasmultret(e->k)) { + extra++; /* includes call itself */ + if (extra < 0) extra = 0; + luaK_setreturns(fs, e, extra); /* last exp. provides the difference */ + if (extra > 1) luaK_reserveregs(fs, extra-1); + } + else { + if (e->k != VVOID) luaK_exp2nextreg(fs, e); /* close last expression */ + if (extra > 0) { + int reg = fs->freereg; + luaK_reserveregs(fs, extra); + luaK_nil(fs, reg, extra); + } + } +} + + +static void enterlevel (LexState *ls) { + lua_State *L = ls->L; + ++L->nCcalls; + checklimit(ls->fs, L->nCcalls, LUAI_MAXCCALLS, "C levels"); +} + + +#define leavelevel(ls) ((ls)->L->nCcalls--) + + +static void closegoto (LexState *ls, int g, Labeldesc *label) { + int i; + FuncState *fs = ls->fs; + Labellist *gl = &ls->dyd->gt; + Labeldesc *gt = &gl->arr[g]; + lua_assert(luaS_eqstr(gt->name, label->name)); + if (gt->nactvar < label->nactvar) { + TString *vname = getlocvar(fs, gt->nactvar)->varname; + const char *msg = luaO_pushfstring(ls->L, + " at line %d jumps into the scope of local " LUA_QS, + getstr(gt->name), gt->line, getstr(vname)); + semerror(ls, msg); + } + luaK_patchlist(fs, gt->pc, label->pc); + /* remove goto from pending list */ + for (i = g; i < gl->n - 1; i++) + gl->arr[i] = gl->arr[i + 1]; + gl->n--; +} + + +/* +** try to close a goto with existing labels; this solves backward jumps +*/ +static int findlabel (LexState *ls, int g) { + int i; + BlockCnt *bl = ls->fs->bl; + Dyndata *dyd = ls->dyd; + Labeldesc *gt = &dyd->gt.arr[g]; + /* check labels in current block for a match */ + for (i = bl->firstlabel; i < dyd->label.n; i++) { + Labeldesc *lb = &dyd->label.arr[i]; + if (luaS_eqstr(lb->name, gt->name)) { /* correct label? */ + if (gt->nactvar > lb->nactvar && + (bl->upval || dyd->label.n > bl->firstlabel)) + luaK_patchclose(ls->fs, gt->pc, lb->nactvar); + closegoto(ls, g, lb); /* close it */ + return 1; + } + } + return 0; /* label not found; cannot close goto */ +} + + +static int newlabelentry (LexState *ls, Labellist *l, TString *name, + int line, int pc) { + int n = l->n; + luaM_growvector(ls->L, l->arr, n, l->size, + Labeldesc, SHRT_MAX, "labels/gotos"); + l->arr[n].name = name; + l->arr[n].line = line; + l->arr[n].nactvar = ls->fs->nactvar; + l->arr[n].pc = pc; + l->n++; + return n; +} + + +/* +** check whether new label 'lb' matches any pending gotos in current +** block; solves forward jumps +*/ +static void findgotos (LexState *ls, Labeldesc *lb) { + Labellist *gl = &ls->dyd->gt; + int i = ls->fs->bl->firstgoto; + while (i < gl->n) { + if (luaS_eqstr(gl->arr[i].name, lb->name)) + closegoto(ls, i, lb); + else + i++; + } +} + + +/* +** "export" pending gotos to outer level, to check them against +** outer labels; if the block being exited has upvalues, and +** the goto exits the scope of any variable (which can be the +** upvalue), close those variables being exited. +*/ +static void movegotosout (FuncState *fs, BlockCnt *bl) { + int i = bl->firstgoto; + Labellist *gl = &fs->ls->dyd->gt; + /* correct pending gotos to current block and try to close it + with visible labels */ + while (i < gl->n) { + Labeldesc *gt = &gl->arr[i]; + if (gt->nactvar > bl->nactvar) { + if (bl->upval) + luaK_patchclose(fs, gt->pc, bl->nactvar); + gt->nactvar = bl->nactvar; + } + if (!findlabel(fs->ls, i)) + i++; /* move to next one */ + } +} + + +static void enterblock (FuncState *fs, BlockCnt *bl, lu_byte isloop) { + bl->isloop = isloop; + bl->nactvar = fs->nactvar; + bl->firstlabel = fs->ls->dyd->label.n; + bl->firstgoto = fs->ls->dyd->gt.n; + bl->upval = 0; + bl->previous = fs->bl; + fs->bl = bl; + lua_assert(fs->freereg == fs->nactvar); +} + + +/* +** create a label named "break" to resolve break statements +*/ +static void breaklabel (LexState *ls) { + TString *n = luaS_new(ls->L, "break"); + int l = newlabelentry(ls, &ls->dyd->label, n, 0, ls->fs->pc); + findgotos(ls, &ls->dyd->label.arr[l]); +} + +/* +** generates an error for an undefined 'goto'; choose appropriate +** message when label name is a reserved word (which can only be 'break') +*/ +static l_noret undefgoto (LexState *ls, Labeldesc *gt) { + const char *msg = isreserved(gt->name) + ? "<%s> at line %d not inside a loop" + : "no visible label " LUA_QS " for at line %d"; + msg = luaO_pushfstring(ls->L, msg, getstr(gt->name), gt->line); + semerror(ls, msg); +} + + +static void leaveblock (FuncState *fs) { + BlockCnt *bl = fs->bl; + LexState *ls = fs->ls; + if (bl->previous && bl->upval) { + /* create a 'jump to here' to close upvalues */ + int j = luaK_jump(fs); + luaK_patchclose(fs, j, bl->nactvar); + luaK_patchtohere(fs, j); + } + if (bl->isloop) + breaklabel(ls); /* close pending breaks */ + fs->bl = bl->previous; + removevars(fs, bl->nactvar); + lua_assert(bl->nactvar == fs->nactvar); + fs->freereg = fs->nactvar; /* free registers */ + ls->dyd->label.n = bl->firstlabel; /* remove local labels */ + if (bl->previous) /* inner block? */ + movegotosout(fs, bl); /* update pending gotos to outer block */ + else if (bl->firstgoto < ls->dyd->gt.n) /* pending gotos in outer block? */ + undefgoto(ls, &ls->dyd->gt.arr[bl->firstgoto]); /* error */ +} + + +/* +** adds a new prototype into list of prototypes +*/ +static Proto *addprototype (LexState *ls) { + Proto *clp; + lua_State *L = ls->L; + FuncState *fs = ls->fs; + Proto *f = fs->f; /* prototype of current function */ + if (fs->np >= f->sizep) { + int oldsize = f->sizep; + luaM_growvector(L, f->p, fs->np, f->sizep, Proto *, MAXARG_Bx, "functions"); + while (oldsize < f->sizep) f->p[oldsize++] = NULL; + } + f->p[fs->np++] = clp = luaF_newproto(L); + luaC_objbarrier(L, f, clp); + return clp; +} + + +/* +** codes instruction to create new closure in parent function. +** The OP_CLOSURE instruction must use the last available register, +** so that, if it invokes the GC, the GC knows which registers +** are in use at that time. +*/ +static void codeclosure (LexState *ls, expdesc *v) { + FuncState *fs = ls->fs->prev; + init_exp(v, VRELOCABLE, luaK_codeABx(fs, OP_CLOSURE, 0, fs->np - 1)); + luaK_exp2nextreg(fs, v); /* fix it at the last register */ +} + + +static void open_func (LexState *ls, FuncState *fs, BlockCnt *bl) { + lua_State *L = ls->L; + Proto *f; + fs->prev = ls->fs; /* linked list of funcstates */ + fs->ls = ls; + ls->fs = fs; + fs->pc = 0; + fs->lasttarget = 0; + fs->jpc = NO_JUMP; + fs->freereg = 0; + fs->nk = 0; + fs->np = 0; + fs->nups = 0; + fs->nlocvars = 0; + fs->nactvar = 0; + fs->firstlocal = ls->dyd->actvar.n; + fs->bl = NULL; + f = fs->f; + f->source = ls->source; + f->maxstacksize = 2; /* registers 0/1 are always valid */ + fs->h = luaH_new(L); + /* anchor table of constants (to avoid being collected) */ + sethvalue2s(L, L->top, fs->h); + incr_top(L); + enterblock(fs, bl, 0); +} + + +static void close_func (LexState *ls) { + lua_State *L = ls->L; + FuncState *fs = ls->fs; + Proto *f = fs->f; + luaK_ret(fs, 0, 0); /* final return */ + leaveblock(fs); + luaM_reallocvector(L, f->code, f->sizecode, fs->pc, Instruction); + f->sizecode = fs->pc; + luaM_reallocvector(L, f->lineinfo, f->sizelineinfo, fs->pc, int); + f->sizelineinfo = fs->pc; + luaM_reallocvector(L, f->k, f->sizek, fs->nk, TValue); + f->sizek = fs->nk; + luaM_reallocvector(L, f->p, f->sizep, fs->np, Proto *); + f->sizep = fs->np; + luaM_reallocvector(L, f->locvars, f->sizelocvars, fs->nlocvars, LocVar); + f->sizelocvars = fs->nlocvars; + luaM_reallocvector(L, f->upvalues, f->sizeupvalues, fs->nups, Upvaldesc); + f->sizeupvalues = fs->nups; + lua_assert(fs->bl == NULL); + ls->fs = fs->prev; + /* last token read was anchored in defunct function; must re-anchor it */ + anchor_token(ls); + L->top--; /* pop table of constants */ + luaC_checkGC(L); +} + + + +/*============================================================*/ +/* GRAMMAR RULES */ +/*============================================================*/ + + +/* +** check whether current token is in the follow set of a block. +** 'until' closes syntactical blocks, but do not close scope, +** so it handled in separate. +*/ +static int block_follow (LexState *ls, int withuntil) { + switch (ls->t.token) { + case TK_ELSE: case TK_ELSEIF: + case TK_END: case TK_EOS: + return 1; + case TK_UNTIL: return withuntil; + default: return 0; + } +} + + +static void statlist (LexState *ls) { + /* statlist -> { stat [`;'] } */ + while (!block_follow(ls, 1)) { + if (ls->t.token == TK_RETURN) { + statement(ls); + return; /* 'return' must be last statement */ + } + statement(ls); + } +} + + +static void fieldsel (LexState *ls, expdesc *v) { + /* fieldsel -> ['.' | ':'] NAME */ + FuncState *fs = ls->fs; + expdesc key; + luaK_exp2anyregup(fs, v); + luaX_next(ls); /* skip the dot or colon */ + checkname(ls, &key); + luaK_indexed(fs, v, &key); +} + + +static void yindex (LexState *ls, expdesc *v) { + /* index -> '[' expr ']' */ + luaX_next(ls); /* skip the '[' */ + expr(ls, v); + luaK_exp2val(ls->fs, v); + checknext(ls, ']'); +} + + +/* +** {====================================================================== +** Rules for Constructors +** ======================================================================= +*/ + + +struct ConsControl { + expdesc v; /* last list item read */ + expdesc *t; /* table descriptor */ + int nh; /* total number of `record' elements */ + int na; /* total number of array elements */ + int tostore; /* number of array elements pending to be stored */ +}; + + +static void recfield (LexState *ls, struct ConsControl *cc) { + /* recfield -> (NAME | `['exp1`]') = exp1 */ + FuncState *fs = ls->fs; + int reg = ls->fs->freereg; + expdesc key, val; + int rkkey; + if (ls->t.token == TK_NAME) { + checklimit(fs, cc->nh, MAX_INT, "items in a constructor"); + checkname(ls, &key); + } + else /* ls->t.token == '[' */ + yindex(ls, &key); + cc->nh++; + checknext(ls, '='); + rkkey = luaK_exp2RK(fs, &key); + expr(ls, &val); + luaK_codeABC(fs, OP_SETTABLE, cc->t->u.info, rkkey, luaK_exp2RK(fs, &val)); + fs->freereg = reg; /* free registers */ +} + + +static void closelistfield (FuncState *fs, struct ConsControl *cc) { + if (cc->v.k == VVOID) return; /* there is no list item */ + luaK_exp2nextreg(fs, &cc->v); + cc->v.k = VVOID; + if (cc->tostore == LFIELDS_PER_FLUSH) { + luaK_setlist(fs, cc->t->u.info, cc->na, cc->tostore); /* flush */ + cc->tostore = 0; /* no more items pending */ + } +} + + +static void lastlistfield (FuncState *fs, struct ConsControl *cc) { + if (cc->tostore == 0) return; + if (hasmultret(cc->v.k)) { + luaK_setmultret(fs, &cc->v); + luaK_setlist(fs, cc->t->u.info, cc->na, LUA_MULTRET); + cc->na--; /* do not count last expression (unknown number of elements) */ + } + else { + if (cc->v.k != VVOID) + luaK_exp2nextreg(fs, &cc->v); + luaK_setlist(fs, cc->t->u.info, cc->na, cc->tostore); + } +} + + +static void listfield (LexState *ls, struct ConsControl *cc) { + /* listfield -> exp */ + expr(ls, &cc->v); + checklimit(ls->fs, cc->na, MAX_INT, "items in a constructor"); + cc->na++; + cc->tostore++; +} + + +static void field (LexState *ls, struct ConsControl *cc) { + /* field -> listfield | recfield */ + switch(ls->t.token) { + case TK_NAME: { /* may be 'listfield' or 'recfield' */ + if (luaX_lookahead(ls) != '=') /* expression? */ + listfield(ls, cc); + else + recfield(ls, cc); + break; + } + case '[': { + recfield(ls, cc); + break; + } + default: { + listfield(ls, cc); + break; + } + } +} + + +static void constructor (LexState *ls, expdesc *t) { + /* constructor -> '{' [ field { sep field } [sep] ] '}' + sep -> ',' | ';' */ + FuncState *fs = ls->fs; + int line = ls->linenumber; + int pc = luaK_codeABC(fs, OP_NEWTABLE, 0, 0, 0); + struct ConsControl cc; + cc.na = cc.nh = cc.tostore = 0; + cc.t = t; + init_exp(t, VRELOCABLE, pc); + init_exp(&cc.v, VVOID, 0); /* no value (yet) */ + luaK_exp2nextreg(ls->fs, t); /* fix it at stack top */ + checknext(ls, '{'); + do { + lua_assert(cc.v.k == VVOID || cc.tostore > 0); + if (ls->t.token == '}') break; + closelistfield(fs, &cc); + field(ls, &cc); + } while (testnext(ls, ',') || testnext(ls, ';')); + check_match(ls, '}', '{', line); + lastlistfield(fs, &cc); + SETARG_B(fs->f->code[pc], luaO_int2fb(cc.na)); /* set initial array size */ + SETARG_C(fs->f->code[pc], luaO_int2fb(cc.nh)); /* set initial table size */ +} + +/* }====================================================================== */ + + + +static void parlist (LexState *ls) { + /* parlist -> [ param { `,' param } ] */ + FuncState *fs = ls->fs; + Proto *f = fs->f; + int nparams = 0; + f->is_vararg = 0; + if (ls->t.token != ')') { /* is `parlist' not empty? */ + do { + switch (ls->t.token) { + case TK_NAME: { /* param -> NAME */ + new_localvar(ls, str_checkname(ls)); + nparams++; + break; + } + case TK_DOTS: { /* param -> `...' */ + luaX_next(ls); + f->is_vararg = 1; + break; + } + default: luaX_syntaxerror(ls, " or " LUA_QL("...") " expected"); + } + } while (!f->is_vararg && testnext(ls, ',')); + } + adjustlocalvars(ls, nparams); + f->numparams = cast_byte(fs->nactvar); + luaK_reserveregs(fs, fs->nactvar); /* reserve register for parameters */ +} + + +static void body (LexState *ls, expdesc *e, int ismethod, int line) { + /* body -> `(' parlist `)' block END */ + FuncState new_fs; + BlockCnt bl; + new_fs.f = addprototype(ls); + new_fs.f->linedefined = line; + open_func(ls, &new_fs, &bl); + checknext(ls, '('); + if (ismethod) { + new_localvarliteral(ls, "self"); /* create 'self' parameter */ + adjustlocalvars(ls, 1); + } + parlist(ls); + checknext(ls, ')'); + statlist(ls); + new_fs.f->lastlinedefined = ls->linenumber; + check_match(ls, TK_END, TK_FUNCTION, line); + codeclosure(ls, e); + close_func(ls); +} + + +static int explist (LexState *ls, expdesc *v) { + /* explist -> expr { `,' expr } */ + int n = 1; /* at least one expression */ + expr(ls, v); + while (testnext(ls, ',')) { + luaK_exp2nextreg(ls->fs, v); + expr(ls, v); + n++; + } + return n; +} + + +static void funcargs (LexState *ls, expdesc *f, int line) { + FuncState *fs = ls->fs; + expdesc args; + int base, nparams; + switch (ls->t.token) { + case '(': { /* funcargs -> `(' [ explist ] `)' */ + luaX_next(ls); + if (ls->t.token == ')') /* arg list is empty? */ + args.k = VVOID; + else { + explist(ls, &args); + luaK_setmultret(fs, &args); + } + check_match(ls, ')', '(', line); + break; + } + case '{': { /* funcargs -> constructor */ + constructor(ls, &args); + break; + } + case TK_STRING: { /* funcargs -> STRING */ + codestring(ls, &args, ls->t.seminfo.ts); + luaX_next(ls); /* must use `seminfo' before `next' */ + break; + } + default: { + luaX_syntaxerror(ls, "function arguments expected"); + } + } + lua_assert(f->k == VNONRELOC); + base = f->u.info; /* base register for call */ + if (hasmultret(args.k)) + nparams = LUA_MULTRET; /* open call */ + else { + if (args.k != VVOID) + luaK_exp2nextreg(fs, &args); /* close last argument */ + nparams = fs->freereg - (base+1); + } + init_exp(f, VCALL, luaK_codeABC(fs, OP_CALL, base, nparams+1, 2)); + luaK_fixline(fs, line); + fs->freereg = base+1; /* call remove function and arguments and leaves + (unless changed) one result */ +} + + + + +/* +** {====================================================================== +** Expression parsing +** ======================================================================= +*/ + + +static void primaryexp (LexState *ls, expdesc *v) { + /* primaryexp -> NAME | '(' expr ')' */ + switch (ls->t.token) { + case '(': { + int line = ls->linenumber; + luaX_next(ls); + expr(ls, v); + check_match(ls, ')', '(', line); + luaK_dischargevars(ls->fs, v); + return; + } + case TK_NAME: { + singlevar(ls, v); + return; + } + default: { + luaX_syntaxerror(ls, "unexpected symbol"); + } + } +} + + +static void suffixedexp (LexState *ls, expdesc *v) { + /* suffixedexp -> + primaryexp { '.' NAME | '[' exp ']' | ':' NAME funcargs | funcargs } */ + FuncState *fs = ls->fs; + int line = ls->linenumber; + primaryexp(ls, v); + for (;;) { + switch (ls->t.token) { + case '.': { /* fieldsel */ + fieldsel(ls, v); + break; + } + case '[': { /* `[' exp1 `]' */ + expdesc key; + luaK_exp2anyregup(fs, v); + yindex(ls, &key); + luaK_indexed(fs, v, &key); + break; + } + case ':': { /* `:' NAME funcargs */ + expdesc key; + luaX_next(ls); + checkname(ls, &key); + luaK_self(fs, v, &key); + funcargs(ls, v, line); + break; + } + case '(': case TK_STRING: case '{': { /* funcargs */ + luaK_exp2nextreg(fs, v); + funcargs(ls, v, line); + break; + } + default: return; + } + } +} + + +static void simpleexp (LexState *ls, expdesc *v) { + /* simpleexp -> NUMBER | STRING | NIL | TRUE | FALSE | ... | + constructor | FUNCTION body | suffixedexp */ + switch (ls->t.token) { + case TK_NUMBER: { + init_exp(v, VKNUM, 0); + v->u.nval = ls->t.seminfo.r; + break; + } + case TK_STRING: { + codestring(ls, v, ls->t.seminfo.ts); + break; + } + case TK_NIL: { + init_exp(v, VNIL, 0); + break; + } + case TK_TRUE: { + init_exp(v, VTRUE, 0); + break; + } + case TK_FALSE: { + init_exp(v, VFALSE, 0); + break; + } + case TK_DOTS: { /* vararg */ + FuncState *fs = ls->fs; + check_condition(ls, fs->f->is_vararg, + "cannot use " LUA_QL("...") " outside a vararg function"); + init_exp(v, VVARARG, luaK_codeABC(fs, OP_VARARG, 0, 1, 0)); + break; + } + case '{': { /* constructor */ + constructor(ls, v); + return; + } + case TK_FUNCTION: { + luaX_next(ls); + body(ls, v, 0, ls->linenumber); + return; + } + default: { + suffixedexp(ls, v); + return; + } + } + luaX_next(ls); +} + + +static UnOpr getunopr (int op) { + switch (op) { + case TK_NOT: return OPR_NOT; + case '-': return OPR_MINUS; + case '#': return OPR_LEN; + default: return OPR_NOUNOPR; + } +} + + +static BinOpr getbinopr (int op) { + switch (op) { + case '+': return OPR_ADD; + case '-': return OPR_SUB; + case '*': return OPR_MUL; + case '/': return OPR_DIV; + case '%': return OPR_MOD; + case '^': return OPR_POW; + case TK_CONCAT: return OPR_CONCAT; + case TK_NE: return OPR_NE; + case TK_EQ: return OPR_EQ; + case '<': return OPR_LT; + case TK_LE: return OPR_LE; + case '>': return OPR_GT; + case TK_GE: return OPR_GE; + case TK_AND: return OPR_AND; + case TK_OR: return OPR_OR; + default: return OPR_NOBINOPR; + } +} + + +static const struct { + lu_byte left; /* left priority for each binary operator */ + lu_byte right; /* right priority */ +} priority[] = { /* ORDER OPR */ + {6, 6}, {6, 6}, {7, 7}, {7, 7}, {7, 7}, /* `+' `-' `*' `/' `%' */ + {10, 9}, {5, 4}, /* ^, .. (right associative) */ + {3, 3}, {3, 3}, {3, 3}, /* ==, <, <= */ + {3, 3}, {3, 3}, {3, 3}, /* ~=, >, >= */ + {2, 2}, {1, 1} /* and, or */ +}; + +#define UNARY_PRIORITY 8 /* priority for unary operators */ + + +/* +** subexpr -> (simpleexp | unop subexpr) { binop subexpr } +** where `binop' is any binary operator with a priority higher than `limit' +*/ +static BinOpr subexpr (LexState *ls, expdesc *v, int limit) { + BinOpr op; + UnOpr uop; + enterlevel(ls); + uop = getunopr(ls->t.token); + if (uop != OPR_NOUNOPR) { + int line = ls->linenumber; + luaX_next(ls); + subexpr(ls, v, UNARY_PRIORITY); + luaK_prefix(ls->fs, uop, v, line); + } + else simpleexp(ls, v); + /* expand while operators have priorities higher than `limit' */ + op = getbinopr(ls->t.token); + while (op != OPR_NOBINOPR && priority[op].left > limit) { + expdesc v2; + BinOpr nextop; + int line = ls->linenumber; + luaX_next(ls); + luaK_infix(ls->fs, op, v); + /* read sub-expression with higher priority */ + nextop = subexpr(ls, &v2, priority[op].right); + luaK_posfix(ls->fs, op, v, &v2, line); + op = nextop; + } + leavelevel(ls); + return op; /* return first untreated operator */ +} + + +static void expr (LexState *ls, expdesc *v) { + subexpr(ls, v, 0); +} + +/* }==================================================================== */ + + + +/* +** {====================================================================== +** Rules for Statements +** ======================================================================= +*/ + + +static void block (LexState *ls) { + /* block -> statlist */ + FuncState *fs = ls->fs; + BlockCnt bl; + enterblock(fs, &bl, 0); + statlist(ls); + leaveblock(fs); +} + + +/* +** structure to chain all variables in the left-hand side of an +** assignment +*/ +struct LHS_assign { + struct LHS_assign *prev; + expdesc v; /* variable (global, local, upvalue, or indexed) */ +}; + + +/* +** check whether, in an assignment to an upvalue/local variable, the +** upvalue/local variable is begin used in a previous assignment to a +** table. If so, save original upvalue/local value in a safe place and +** use this safe copy in the previous assignment. +*/ +static void check_conflict (LexState *ls, struct LHS_assign *lh, expdesc *v) { + FuncState *fs = ls->fs; + int extra = fs->freereg; /* eventual position to save local variable */ + int conflict = 0; + for (; lh; lh = lh->prev) { /* check all previous assignments */ + if (lh->v.k == VINDEXED) { /* assigning to a table? */ + /* table is the upvalue/local being assigned now? */ + if (lh->v.u.ind.vt == v->k && lh->v.u.ind.t == v->u.info) { + conflict = 1; + lh->v.u.ind.vt = VLOCAL; + lh->v.u.ind.t = extra; /* previous assignment will use safe copy */ + } + /* index is the local being assigned? (index cannot be upvalue) */ + if (v->k == VLOCAL && lh->v.u.ind.idx == v->u.info) { + conflict = 1; + lh->v.u.ind.idx = extra; /* previous assignment will use safe copy */ + } + } + } + if (conflict) { + /* copy upvalue/local value to a temporary (in position 'extra') */ + OpCode op = (v->k == VLOCAL) ? OP_MOVE : OP_GETUPVAL; + luaK_codeABC(fs, op, extra, v->u.info, 0); + luaK_reserveregs(fs, 1); + } +} + + +static void assignment (LexState *ls, struct LHS_assign *lh, int nvars) { + expdesc e; + check_condition(ls, vkisvar(lh->v.k), "syntax error"); + if (testnext(ls, ',')) { /* assignment -> ',' suffixedexp assignment */ + struct LHS_assign nv; + nv.prev = lh; + suffixedexp(ls, &nv.v); + if (nv.v.k != VINDEXED) + check_conflict(ls, lh, &nv.v); + checklimit(ls->fs, nvars + ls->L->nCcalls, LUAI_MAXCCALLS, + "C levels"); + assignment(ls, &nv, nvars+1); + } + else { /* assignment -> `=' explist */ + int nexps; + checknext(ls, '='); + nexps = explist(ls, &e); + if (nexps != nvars) { + adjust_assign(ls, nvars, nexps, &e); + if (nexps > nvars) + ls->fs->freereg -= nexps - nvars; /* remove extra values */ + } + else { + luaK_setoneret(ls->fs, &e); /* close last expression */ + luaK_storevar(ls->fs, &lh->v, &e); + return; /* avoid default */ + } + } + init_exp(&e, VNONRELOC, ls->fs->freereg-1); /* default assignment */ + luaK_storevar(ls->fs, &lh->v, &e); +} + + +static int cond (LexState *ls) { + /* cond -> exp */ + expdesc v; + expr(ls, &v); /* read condition */ + if (v.k == VNIL) v.k = VFALSE; /* `falses' are all equal here */ + luaK_goiftrue(ls->fs, &v); + return v.f; +} + + +static void gotostat (LexState *ls, int pc) { + int line = ls->linenumber; + TString *label; + int g; + if (testnext(ls, TK_GOTO)) + label = str_checkname(ls); + else { + luaX_next(ls); /* skip break */ + label = luaS_new(ls->L, "break"); + } + g = newlabelentry(ls, &ls->dyd->gt, label, line, pc); + findlabel(ls, g); /* close it if label already defined */ +} + + +/* check for repeated labels on the same block */ +static void checkrepeated (FuncState *fs, Labellist *ll, TString *label) { + int i; + for (i = fs->bl->firstlabel; i < ll->n; i++) { + if (luaS_eqstr(label, ll->arr[i].name)) { + const char *msg = luaO_pushfstring(fs->ls->L, + "label " LUA_QS " already defined on line %d", + getstr(label), ll->arr[i].line); + semerror(fs->ls, msg); + } + } +} + + +/* skip no-op statements */ +static void skipnoopstat (LexState *ls) { + while (ls->t.token == ';' || ls->t.token == TK_DBCOLON) + statement(ls); +} + + +static void labelstat (LexState *ls, TString *label, int line) { + /* label -> '::' NAME '::' */ + FuncState *fs = ls->fs; + Labellist *ll = &ls->dyd->label; + int l; /* index of new label being created */ + checkrepeated(fs, ll, label); /* check for repeated labels */ + checknext(ls, TK_DBCOLON); /* skip double colon */ + /* create new entry for this label */ + l = newlabelentry(ls, ll, label, line, fs->pc); + skipnoopstat(ls); /* skip other no-op statements */ + if (block_follow(ls, 0)) { /* label is last no-op statement in the block? */ + /* assume that locals are already out of scope */ + ll->arr[l].nactvar = fs->bl->nactvar; + } + findgotos(ls, &ll->arr[l]); +} + + +static void whilestat (LexState *ls, int line) { + /* whilestat -> WHILE cond DO block END */ + FuncState *fs = ls->fs; + int whileinit; + int condexit; + BlockCnt bl; + luaX_next(ls); /* skip WHILE */ + whileinit = luaK_getlabel(fs); + condexit = cond(ls); + enterblock(fs, &bl, 1); + checknext(ls, TK_DO); + block(ls); + luaK_jumpto(fs, whileinit); + check_match(ls, TK_END, TK_WHILE, line); + leaveblock(fs); + luaK_patchtohere(fs, condexit); /* false conditions finish the loop */ +} + + +static void repeatstat (LexState *ls, int line) { + /* repeatstat -> REPEAT block UNTIL cond */ + int condexit; + FuncState *fs = ls->fs; + int repeat_init = luaK_getlabel(fs); + BlockCnt bl1, bl2; + enterblock(fs, &bl1, 1); /* loop block */ + enterblock(fs, &bl2, 0); /* scope block */ + luaX_next(ls); /* skip REPEAT */ + statlist(ls); + check_match(ls, TK_UNTIL, TK_REPEAT, line); + condexit = cond(ls); /* read condition (inside scope block) */ + if (bl2.upval) /* upvalues? */ + luaK_patchclose(fs, condexit, bl2.nactvar); + leaveblock(fs); /* finish scope */ + luaK_patchlist(fs, condexit, repeat_init); /* close the loop */ + leaveblock(fs); /* finish loop */ +} + + +static int exp1 (LexState *ls) { + expdesc e; + int reg; + expr(ls, &e); + luaK_exp2nextreg(ls->fs, &e); + lua_assert(e.k == VNONRELOC); + reg = e.u.info; + return reg; +} + + +static void forbody (LexState *ls, int base, int line, int nvars, int isnum) { + /* forbody -> DO block */ + BlockCnt bl; + FuncState *fs = ls->fs; + int prep, endfor; + adjustlocalvars(ls, 3); /* control variables */ + checknext(ls, TK_DO); + prep = isnum ? luaK_codeAsBx(fs, OP_FORPREP, base, NO_JUMP) : luaK_jump(fs); + enterblock(fs, &bl, 0); /* scope for declared variables */ + adjustlocalvars(ls, nvars); + luaK_reserveregs(fs, nvars); + block(ls); + leaveblock(fs); /* end of scope for declared variables */ + luaK_patchtohere(fs, prep); + if (isnum) /* numeric for? */ + endfor = luaK_codeAsBx(fs, OP_FORLOOP, base, NO_JUMP); + else { /* generic for */ + luaK_codeABC(fs, OP_TFORCALL, base, 0, nvars); + luaK_fixline(fs, line); + endfor = luaK_codeAsBx(fs, OP_TFORLOOP, base + 2, NO_JUMP); + } + luaK_patchlist(fs, endfor, prep + 1); + luaK_fixline(fs, line); +} + + +static void fornum (LexState *ls, TString *varname, int line) { + /* fornum -> NAME = exp1,exp1[,exp1] forbody */ + FuncState *fs = ls->fs; + int base = fs->freereg; + new_localvarliteral(ls, "(for index)"); + new_localvarliteral(ls, "(for limit)"); + new_localvarliteral(ls, "(for step)"); + new_localvar(ls, varname); + checknext(ls, '='); + exp1(ls); /* initial value */ + checknext(ls, ','); + exp1(ls); /* limit */ + if (testnext(ls, ',')) + exp1(ls); /* optional step */ + else { /* default step = 1 */ + luaK_codek(fs, fs->freereg, luaK_numberK(fs, 1)); + luaK_reserveregs(fs, 1); + } + forbody(ls, base, line, 1, 1); +} + + +static void forlist (LexState *ls, TString *indexname) { + /* forlist -> NAME {,NAME} IN explist forbody */ + FuncState *fs = ls->fs; + expdesc e; + int nvars = 4; /* gen, state, control, plus at least one declared var */ + int line; + int base = fs->freereg; + /* create control variables */ + new_localvarliteral(ls, "(for generator)"); + new_localvarliteral(ls, "(for state)"); + new_localvarliteral(ls, "(for control)"); + /* create declared variables */ + new_localvar(ls, indexname); + while (testnext(ls, ',')) { + new_localvar(ls, str_checkname(ls)); + nvars++; + } + checknext(ls, TK_IN); + line = ls->linenumber; + adjust_assign(ls, 3, explist(ls, &e), &e); + luaK_checkstack(fs, 3); /* extra space to call generator */ + forbody(ls, base, line, nvars - 3, 0); +} + + +static void forstat (LexState *ls, int line) { + /* forstat -> FOR (fornum | forlist) END */ + FuncState *fs = ls->fs; + TString *varname; + BlockCnt bl; + enterblock(fs, &bl, 1); /* scope for loop and control variables */ + luaX_next(ls); /* skip `for' */ + varname = str_checkname(ls); /* first variable name */ + switch (ls->t.token) { + case '=': fornum(ls, varname, line); break; + case ',': case TK_IN: forlist(ls, varname); break; + default: luaX_syntaxerror(ls, LUA_QL("=") " or " LUA_QL("in") " expected"); + } + check_match(ls, TK_END, TK_FOR, line); + leaveblock(fs); /* loop scope (`break' jumps to this point) */ +} + + +static void test_then_block (LexState *ls, int *escapelist) { + /* test_then_block -> [IF | ELSEIF] cond THEN block */ + BlockCnt bl; + FuncState *fs = ls->fs; + expdesc v; + int jf; /* instruction to skip 'then' code (if condition is false) */ + luaX_next(ls); /* skip IF or ELSEIF */ + expr(ls, &v); /* read condition */ + checknext(ls, TK_THEN); + if (ls->t.token == TK_GOTO || ls->t.token == TK_BREAK) { + luaK_goiffalse(ls->fs, &v); /* will jump to label if condition is true */ + enterblock(fs, &bl, 0); /* must enter block before 'goto' */ + gotostat(ls, v.t); /* handle goto/break */ + skipnoopstat(ls); /* skip other no-op statements */ + if (block_follow(ls, 0)) { /* 'goto' is the entire block? */ + leaveblock(fs); + return; /* and that is it */ + } + else /* must skip over 'then' part if condition is false */ + jf = luaK_jump(fs); + } + else { /* regular case (not goto/break) */ + luaK_goiftrue(ls->fs, &v); /* skip over block if condition is false */ + enterblock(fs, &bl, 0); + jf = v.f; + } + statlist(ls); /* `then' part */ + leaveblock(fs); + if (ls->t.token == TK_ELSE || + ls->t.token == TK_ELSEIF) /* followed by 'else'/'elseif'? */ + luaK_concat(fs, escapelist, luaK_jump(fs)); /* must jump over it */ + luaK_patchtohere(fs, jf); +} + + +static void ifstat (LexState *ls, int line) { + /* ifstat -> IF cond THEN block {ELSEIF cond THEN block} [ELSE block] END */ + FuncState *fs = ls->fs; + int escapelist = NO_JUMP; /* exit list for finished parts */ + test_then_block(ls, &escapelist); /* IF cond THEN block */ + while (ls->t.token == TK_ELSEIF) + test_then_block(ls, &escapelist); /* ELSEIF cond THEN block */ + if (testnext(ls, TK_ELSE)) + block(ls); /* `else' part */ + check_match(ls, TK_END, TK_IF, line); + luaK_patchtohere(fs, escapelist); /* patch escape list to 'if' end */ +} + + +static void localfunc (LexState *ls) { + expdesc b; + FuncState *fs = ls->fs; + new_localvar(ls, str_checkname(ls)); /* new local variable */ + adjustlocalvars(ls, 1); /* enter its scope */ + body(ls, &b, 0, ls->linenumber); /* function created in next register */ + /* debug information will only see the variable after this point! */ + getlocvar(fs, b.u.info)->startpc = fs->pc; +} + + +static void localstat (LexState *ls) { + /* stat -> LOCAL NAME {`,' NAME} [`=' explist] */ + int nvars = 0; + int nexps; + expdesc e; + do { + new_localvar(ls, str_checkname(ls)); + nvars++; + } while (testnext(ls, ',')); + if (testnext(ls, '=')) + nexps = explist(ls, &e); + else { + e.k = VVOID; + nexps = 0; + } + adjust_assign(ls, nvars, nexps, &e); + adjustlocalvars(ls, nvars); +} + + +static int funcname (LexState *ls, expdesc *v) { + /* funcname -> NAME {fieldsel} [`:' NAME] */ + int ismethod = 0; + singlevar(ls, v); + while (ls->t.token == '.') + fieldsel(ls, v); + if (ls->t.token == ':') { + ismethod = 1; + fieldsel(ls, v); + } + return ismethod; +} + + +static void funcstat (LexState *ls, int line) { + /* funcstat -> FUNCTION funcname body */ + int ismethod; + expdesc v, b; + luaX_next(ls); /* skip FUNCTION */ + ismethod = funcname(ls, &v); + body(ls, &b, ismethod, line); + luaK_storevar(ls->fs, &v, &b); + luaK_fixline(ls->fs, line); /* definition `happens' in the first line */ +} + + +static void exprstat (LexState *ls) { + /* stat -> func | assignment */ + FuncState *fs = ls->fs; + struct LHS_assign v; + suffixedexp(ls, &v.v); + if (ls->t.token == '=' || ls->t.token == ',') { /* stat -> assignment ? */ + v.prev = NULL; + assignment(ls, &v, 1); + } + else { /* stat -> func */ + check_condition(ls, v.v.k == VCALL, "syntax error"); + SETARG_C(getcode(fs, &v.v), 1); /* call statement uses no results */ + } +} + + +static void retstat (LexState *ls) { + /* stat -> RETURN [explist] [';'] */ + FuncState *fs = ls->fs; + expdesc e; + int first, nret; /* registers with returned values */ + if (block_follow(ls, 1) || ls->t.token == ';') + first = nret = 0; /* return no values */ + else { + nret = explist(ls, &e); /* optional return values */ + if (hasmultret(e.k)) { + luaK_setmultret(fs, &e); + if (e.k == VCALL && nret == 1) { /* tail call? */ + SET_OPCODE(getcode(fs,&e), OP_TAILCALL); + lua_assert(GETARG_A(getcode(fs,&e)) == fs->nactvar); + } + first = fs->nactvar; + nret = LUA_MULTRET; /* return all values */ + } + else { + if (nret == 1) /* only one single value? */ + first = luaK_exp2anyreg(fs, &e); + else { + luaK_exp2nextreg(fs, &e); /* values must go to the `stack' */ + first = fs->nactvar; /* return all `active' values */ + lua_assert(nret == fs->freereg - first); + } + } + } + luaK_ret(fs, first, nret); + testnext(ls, ';'); /* skip optional semicolon */ +} + + +static void statement (LexState *ls) { + int line = ls->linenumber; /* may be needed for error messages */ + enterlevel(ls); + switch (ls->t.token) { + case ';': { /* stat -> ';' (empty statement) */ + luaX_next(ls); /* skip ';' */ + break; + } + case TK_IF: { /* stat -> ifstat */ + ifstat(ls, line); + break; + } + case TK_WHILE: { /* stat -> whilestat */ + whilestat(ls, line); + break; + } + case TK_DO: { /* stat -> DO block END */ + luaX_next(ls); /* skip DO */ + block(ls); + check_match(ls, TK_END, TK_DO, line); + break; + } + case TK_FOR: { /* stat -> forstat */ + forstat(ls, line); + break; + } + case TK_REPEAT: { /* stat -> repeatstat */ + repeatstat(ls, line); + break; + } + case TK_FUNCTION: { /* stat -> funcstat */ + funcstat(ls, line); + break; + } + case TK_LOCAL: { /* stat -> localstat */ + luaX_next(ls); /* skip LOCAL */ + if (testnext(ls, TK_FUNCTION)) /* local function? */ + localfunc(ls); + else + localstat(ls); + break; + } + case TK_DBCOLON: { /* stat -> label */ + luaX_next(ls); /* skip double colon */ + labelstat(ls, str_checkname(ls), line); + break; + } + case TK_RETURN: { /* stat -> retstat */ + luaX_next(ls); /* skip RETURN */ + retstat(ls); + break; + } + case TK_BREAK: /* stat -> breakstat */ + case TK_GOTO: { /* stat -> 'goto' NAME */ + gotostat(ls, luaK_jump(ls->fs)); + break; + } + default: { /* stat -> func | assignment */ + exprstat(ls); + break; + } + } + lua_assert(ls->fs->f->maxstacksize >= ls->fs->freereg && + ls->fs->freereg >= ls->fs->nactvar); + ls->fs->freereg = ls->fs->nactvar; /* free registers */ + leavelevel(ls); +} + +/* }====================================================================== */ + + +/* +** compiles the main function, which is a regular vararg function with an +** upvalue named LUA_ENV +*/ +static void mainfunc (LexState *ls, FuncState *fs) { + BlockCnt bl; + expdesc v; + open_func(ls, fs, &bl); + fs->f->is_vararg = 1; /* main function is always vararg */ + init_exp(&v, VLOCAL, 0); /* create and... */ + newupvalue(fs, ls->envn, &v); /* ...set environment upvalue */ + luaX_next(ls); /* read first token */ + statlist(ls); /* parse main body */ + check(ls, TK_EOS); + close_func(ls); +} + + +Closure *luaY_parser (lua_State *L, ZIO *z, Mbuffer *buff, + Dyndata *dyd, const char *name, int firstchar) { + LexState lexstate; + FuncState funcstate; + Closure *cl = luaF_newLclosure(L, 1); /* create main closure */ + /* anchor closure (to avoid being collected) */ + setclLvalue(L, L->top, cl); + incr_top(L); + funcstate.f = cl->l.p = luaF_newproto(L); + funcstate.f->source = luaS_new(L, name); /* create and anchor TString */ + lexstate.buff = buff; + lexstate.dyd = dyd; + dyd->actvar.n = dyd->gt.n = dyd->label.n = 0; + luaX_setinput(L, &lexstate, z, funcstate.f->source, firstchar); + mainfunc(&lexstate, &funcstate); + lua_assert(!funcstate.prev && funcstate.nups == 1 && !lexstate.fs); + /* all scopes should be correctly finished */ + lua_assert(dyd->actvar.n == 0 && dyd->gt.n == 0 && dyd->label.n == 0); + return cl; /* it's on the stack too */ +} + diff --git a/liblua/lparser.h b/liblua/lparser.h new file mode 100644 index 00000000..301167d4 --- /dev/null +++ b/liblua/lparser.h @@ -0,0 +1,119 @@ +/* +** $Id: lparser.h,v 1.70 2012/05/08 13:53:33 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 */ + VNONRELOC, /* info = result register */ + VLOCAL, /* info = local register */ + VUPVAL, /* info = index of upvalue in 'upvalues' */ + VINDEXED, /* t = table register/upvalue; idx = index R/K */ + VJMP, /* info = instruction pc */ + VRELOCABLE, /* info = instruction pc */ + VCALL, /* info = instruction pc */ + VVARARG /* info = instruction pc */ +} expkind; + + +#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 VKNUM */ + } u; + int t; /* patch list of `exit when true' */ + int f; /* patch list of `exit when false' */ +} expdesc; + + +/* description of active local variable */ +typedef struct Vardesc { + short idx; /* variable index in stack */ +} Vardesc; + + +/* description of pending goto statements and label statements */ +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 */ +} Labeldesc; + + +/* list of labels or gotos */ +typedef struct Labellist { + Labeldesc *arr; /* array */ + int n; /* number of entries in use */ + int size; /* array size */ +} 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 */ +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 BlockCnt *bl; /* chain of current blocks */ + int pc; /* next position to code (equivalent to `ncode') */ + int lasttarget; /* 'label' of last 'jump label' */ + int jpc; /* list of pending jumps to `pc' */ + int nk; /* number of elements in `k' */ + 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 */ +} FuncState; + + +LUAI_FUNC Closure *luaY_parser (lua_State *L, ZIO *z, Mbuffer *buff, + Dyndata *dyd, const char *name, int firstchar); + + +#endif diff --git a/liblua/lstate.c b/liblua/lstate.c new file mode 100644 index 00000000..207a106d --- /dev/null +++ b/liblua/lstate.c @@ -0,0 +1,322 @@ +/* +** $Id: lstate.c,v 2.99 2012/10/02 17:40:53 roberto Exp $ +** Global State +** See Copyright Notice in lua.h +*/ + + +#include +#include + +#define lstate_c +#define LUA_CORE + +#include "lua.h" + +#include "lapi.h" +#include "ldebug.h" +#include "ldo.h" +#include "lfunc.h" +#include "lgc.h" +#include "llex.h" +#include "lmem.h" +#include "lstate.h" +#include "lstring.h" +#include "ltable.h" +#include "ltm.h" + + +#if !defined(LUAI_GCPAUSE) +#define LUAI_GCPAUSE 200 /* 200% */ +#endif + +#if !defined(LUAI_GCMAJOR) +#define LUAI_GCMAJOR 200 /* 200% */ +#endif + +#if !defined(LUAI_GCMUL) +#define LUAI_GCMUL 200 /* GC runs 'twice the speed' of memory allocation */ +#endif + + +#define MEMERRMSG "not enough memory" + + +/* +** a macro to help the creation of a unique random seed when a state is +** created; the seed is used to randomize hashes. +*/ +#if !defined(luai_makeseed) +#include +#define luai_makeseed() cast(unsigned int, time(NULL)) +#endif + + + +/* +** thread state + extra space +*/ +typedef struct LX { +#if defined(LUAI_EXTRASPACE) + char buff[LUAI_EXTRASPACE]; +#endif + lua_State l; +} LX; + + +/* +** Main thread combines a thread state and the global state +*/ +typedef struct LG { + LX l; + global_State g; +} LG; + + + +#define fromstate(L) (cast(LX *, cast(lu_byte *, (L)) - offsetof(LX, l))) + + +/* +** Compute an initial seed as random as possible. In ANSI, rely on +** Address Space Layout Randomization (if present) to increase +** randomness.. +*/ +#define addbuff(b,p,e) \ + { size_t t = cast(size_t, e); \ + memcpy(buff + p, &t, sizeof(t)); p += sizeof(t); } + +static unsigned int makeseed (lua_State *L) { + char buff[4 * sizeof(size_t)]; + unsigned int h = luai_makeseed(); + int p = 0; + addbuff(buff, p, L); /* heap variable */ + addbuff(buff, p, &h); /* local variable */ + addbuff(buff, p, luaO_nilobject); /* global variable */ + addbuff(buff, p, &lua_newstate); /* public function */ + lua_assert(p == sizeof(buff)); + return luaS_hash(buff, p, h); +} + + +/* +** set GCdebt to a new value keeping the value (totalbytes + GCdebt) +** invariant +*/ +void luaE_setdebt (global_State *g, l_mem debt) { + g->totalbytes -= (debt - g->GCdebt); + g->GCdebt = debt; +} + + +CallInfo *luaE_extendCI (lua_State *L) { + CallInfo *ci = luaM_new(L, CallInfo); + lua_assert(L->ci->next == NULL); + L->ci->next = ci; + ci->previous = L->ci; + ci->next = NULL; + return ci; +} + + +void luaE_freeCI (lua_State *L) { + CallInfo *ci = L->ci; + CallInfo *next = ci->next; + ci->next = NULL; + while ((ci = next) != NULL) { + next = ci->next; + luaM_free(L, ci); + } +} + + +static void stack_init (lua_State *L1, lua_State *L) { + int i; CallInfo *ci; + /* initialize stack array */ + L1->stack = luaM_newvector(L, BASIC_STACK_SIZE, TValue); + L1->stacksize = BASIC_STACK_SIZE; + for (i = 0; i < BASIC_STACK_SIZE; i++) + setnilvalue(L1->stack + i); /* erase new stack */ + L1->top = L1->stack; + L1->stack_last = L1->stack + L1->stacksize - EXTRA_STACK; + /* initialize first ci */ + ci = &L1->base_ci; + ci->next = ci->previous = NULL; + ci->callstatus = 0; + ci->func = L1->top; + setnilvalue(L1->top++); /* 'function' entry for this 'ci' */ + ci->top = L1->top + LUA_MINSTACK; + L1->ci = ci; +} + + +static void freestack (lua_State *L) { + if (L->stack == NULL) + return; /* stack not completely built yet */ + L->ci = &L->base_ci; /* free the entire 'ci' list */ + luaE_freeCI(L); + luaM_freearray(L, L->stack, L->stacksize); /* free stack array */ +} + + +/* +** Create registry table and its predefined values +*/ +static void init_registry (lua_State *L, global_State *g) { + TValue mt; + /* create registry */ + Table *registry = luaH_new(L); + sethvalue(L, &g->l_registry, registry); + luaH_resize(L, registry, LUA_RIDX_LAST, 0); + /* registry[LUA_RIDX_MAINTHREAD] = L */ + setthvalue(L, &mt, L); + luaH_setint(L, registry, LUA_RIDX_MAINTHREAD, &mt); + /* registry[LUA_RIDX_GLOBALS] = table of globals */ + sethvalue(L, &mt, luaH_new(L)); + luaH_setint(L, registry, LUA_RIDX_GLOBALS, &mt); +} + + +/* +** open parts of the state that may cause memory-allocation errors +*/ +static void f_luaopen (lua_State *L, void *ud) { + global_State *g = G(L); + UNUSED(ud); + stack_init(L, L); /* init stack */ + init_registry(L, g); + luaS_resize(L, MINSTRTABSIZE); /* initial size of string table */ + luaT_init(L); + luaX_init(L); + /* pre-create memory-error message */ + g->memerrmsg = luaS_newliteral(L, MEMERRMSG); + luaS_fix(g->memerrmsg); /* it should never be collected */ + g->gcrunning = 1; /* allow gc */ +} + + +/* +** preinitialize a state with consistent values without allocating +** any memory (to avoid errors) +*/ +static void preinit_state (lua_State *L, global_State *g) { + G(L) = g; + L->stack = NULL; + L->ci = NULL; + L->stacksize = 0; + L->errorJmp = NULL; + L->nCcalls = 0; + L->hook = NULL; + L->hookmask = 0; + L->basehookcount = 0; + L->allowhook = 1; + resethookcount(L); + L->openupval = NULL; + L->nny = 1; + L->status = LUA_OK; + L->errfunc = 0; +} + + +static void close_state (lua_State *L) { + global_State *g = G(L); + luaF_close(L, L->stack); /* close all upvalues for this thread */ + luaC_freeallobjects(L); /* collect all objects */ + luaM_freearray(L, G(L)->strt.hash, G(L)->strt.size); + luaZ_freebuffer(L, &g->buff); + freestack(L); + lua_assert(gettotalbytes(g) == sizeof(LG)); + (*g->frealloc)(g->ud, fromstate(L), sizeof(LG), 0); /* free main block */ +} + + +LUA_API lua_State *lua_newthread (lua_State *L) { + lua_State *L1; + lua_lock(L); + luaC_checkGC(L); + L1 = &luaC_newobj(L, LUA_TTHREAD, sizeof(LX), NULL, offsetof(LX, l))->th; + setthvalue(L, L->top, L1); + api_incr_top(L); + preinit_state(L1, G(L)); + L1->hookmask = L->hookmask; + L1->basehookcount = L->basehookcount; + L1->hook = L->hook; + resethookcount(L1); + luai_userstatethread(L, L1); + stack_init(L1, L); /* init stack */ + lua_unlock(L); + return L1; +} + + +void luaE_freethread (lua_State *L, lua_State *L1) { + LX *l = fromstate(L1); + luaF_close(L1, L1->stack); /* close all upvalues for this thread */ + lua_assert(L1->openupval == NULL); + luai_userstatefree(L, L1); + freestack(L1); + luaM_free(L, l); +} + + +LUA_API lua_State *lua_newstate (lua_Alloc f, void *ud) { + int i; + lua_State *L; + global_State *g; + LG *l = cast(LG *, (*f)(ud, NULL, LUA_TTHREAD, sizeof(LG))); + if (l == NULL) return NULL; + L = &l->l.l; + g = &l->g; + L->next = NULL; + L->tt = LUA_TTHREAD; + g->currentwhite = bit2mask(WHITE0BIT, FIXEDBIT); + L->marked = luaC_white(g); + g->gckind = KGC_NORMAL; + preinit_state(L, g); + g->frealloc = f; + g->ud = ud; + g->mainthread = L; + g->seed = makeseed(L); + g->uvhead.u.l.prev = &g->uvhead; + g->uvhead.u.l.next = &g->uvhead; + g->gcrunning = 0; /* no GC while building state */ + g->GCestimate = 0; + g->strt.size = 0; + g->strt.nuse = 0; + g->strt.hash = NULL; + setnilvalue(&g->l_registry); + luaZ_initbuffer(L, &g->buff); + g->panic = NULL; + g->version = lua_version(NULL); + g->gcstate = GCSpause; + g->allgc = NULL; + g->finobj = NULL; + g->tobefnz = NULL; + g->sweepgc = g->sweepfin = NULL; + g->gray = g->grayagain = NULL; + g->weak = g->ephemeron = g->allweak = NULL; + g->totalbytes = sizeof(LG); + g->GCdebt = 0; + g->gcpause = LUAI_GCPAUSE; + g->gcmajorinc = LUAI_GCMAJOR; + g->gcstepmul = LUAI_GCMUL; + for (i=0; i < LUA_NUMTAGS; i++) g->mt[i] = NULL; + if (luaD_rawrunprotected(L, f_luaopen, NULL) != LUA_OK) { + /* memory allocation error: free partial state */ + close_state(L); + L = NULL; + } + else + luai_userstateopen(L); + return L; +} + + +LUA_API void lua_close (lua_State *L) { + L = G(L)->mainthread; /* only the main thread can be closed */ + lua_lock(L); + luai_userstateclose(L); + close_state(L); +} + + diff --git a/liblua/lstate.h b/liblua/lstate.h new file mode 100644 index 00000000..c8a31f5c --- /dev/null +++ b/liblua/lstate.h @@ -0,0 +1,228 @@ +/* +** $Id: lstate.h,v 2.82 2012/07/02 13:37:04 roberto Exp $ +** Global State +** See Copyright Notice in lua.h +*/ + +#ifndef lstate_h +#define lstate_h + +#include "lua.h" + +#include "lobject.h" +#include "ltm.h" +#include "lzio.h" + + +/* + +** Some notes about garbage-collected objects: All objects in Lua must +** be kept somehow accessible until being freed. +** +** Lua keeps most objects linked in list g->allgc. The link uses field +** 'next' of the CommonHeader. +** +** Strings are kept in several lists headed by the array g->strt.hash. +** +** Open upvalues are not subject to independent garbage collection. They +** are collected together with their respective threads. Lua keeps a +** double-linked list with all open upvalues (g->uvhead) so that it can +** mark objects referred by them. (They are always gray, so they must +** be remarked in the atomic step. Usually their contents would be marked +** when traversing the respective threads, but the thread may already be +** dead, while the upvalue is still accessible through closures.) +** +** Objects with finalizers are kept in the list g->finobj. +** +** The list g->tobefnz links all objects being finalized. + +*/ + + +struct lua_longjmp; /* defined in ldo.c */ + + + +/* extra stack space to handle TM calls and some other extras */ +#define EXTRA_STACK 5 + + +#define BASIC_STACK_SIZE (2*LUA_MINSTACK) + + +/* kinds of Garbage Collection */ +#define KGC_NORMAL 0 +#define KGC_EMERGENCY 1 /* gc was forced by an allocation failure */ +#define KGC_GEN 2 /* generational collection */ + + +typedef struct stringtable { + GCObject **hash; + lu_int32 nuse; /* number of elements */ + int size; +} stringtable; + + +/* +** information about a call +*/ +typedef struct CallInfo { + StkId func; /* function index in the stack */ + StkId top; /* top for this function */ + struct CallInfo *previous, *next; /* dynamic call link */ + short nresults; /* expected number of results from this function */ + lu_byte callstatus; + ptrdiff_t extra; + union { + struct { /* only for Lua functions */ + StkId base; /* base for this function */ + const Instruction *savedpc; + } l; + struct { /* only for C functions */ + int ctx; /* context info. in case of yields */ + lua_CFunction k; /* continuation in case of yields */ + ptrdiff_t old_errfunc; + lu_byte old_allowhook; + lu_byte status; + } c; + } u; +} CallInfo; + + +/* +** Bits in CallInfo status +*/ +#define CIST_LUA (1<<0) /* call is running a Lua function */ +#define CIST_HOOKED (1<<1) /* call is running a debug hook */ +#define CIST_REENTRY (1<<2) /* call is running on same invocation of + luaV_execute of previous call */ +#define CIST_YIELDED (1<<3) /* call reentered after suspension */ +#define CIST_YPCALL (1<<4) /* call is a yieldable protected call */ +#define CIST_STAT (1<<5) /* call has an error status (pcall) */ +#define CIST_TAIL (1<<6) /* call was tail called */ +#define CIST_HOOKYIELD (1<<7) /* last hook called yielded */ + + +#define isLua(ci) ((ci)->callstatus & CIST_LUA) + + +/* +** `global state', shared by all threads of this state +*/ +typedef struct global_State { + lua_Alloc frealloc; /* function to reallocate memory */ + void *ud; /* auxiliary data to `frealloc' */ + lu_mem totalbytes; /* number of bytes currently allocated - GCdebt */ + l_mem GCdebt; /* bytes allocated not yet compensated by the collector */ + lu_mem GCmemtrav; /* memory traversed by the GC */ + lu_mem GCestimate; /* an estimate of the non-garbage memory in use */ + stringtable strt; /* hash table for strings */ + TValue l_registry; + unsigned int seed; /* randomized seed for hashes */ + lu_byte currentwhite; + lu_byte gcstate; /* state of garbage collector */ + lu_byte gckind; /* kind of GC running */ + lu_byte gcrunning; /* true if GC is running */ + int sweepstrgc; /* position of sweep in `strt' */ + GCObject *allgc; /* list of all collectable objects */ + GCObject *finobj; /* list of collectable objects with finalizers */ + GCObject **sweepgc; /* current position of sweep in list 'allgc' */ + GCObject **sweepfin; /* current position of sweep in list 'finobj' */ + GCObject *gray; /* list of gray objects */ + GCObject *grayagain; /* list of objects to be traversed atomically */ + GCObject *weak; /* list of tables with weak values */ + GCObject *ephemeron; /* list of ephemeron tables (weak keys) */ + GCObject *allweak; /* list of all-weak tables */ + GCObject *tobefnz; /* list of userdata to be GC */ + UpVal uvhead; /* head of double-linked list of all open upvalues */ + Mbuffer buff; /* temporary buffer for string concatenation */ + int gcpause; /* size of pause between successive GCs */ + int gcmajorinc; /* pause between major collections (only in gen. mode) */ + int gcstepmul; /* GC `granularity' */ + lua_CFunction panic; /* to be called in unprotected errors */ + struct lua_State *mainthread; + const lua_Number *version; /* pointer to version number */ + TString *memerrmsg; /* memory-error message */ + TString *tmname[TM_N]; /* array with tag-method names */ + struct Table *mt[LUA_NUMTAGS]; /* metatables for basic types */ +} global_State; + + +/* +** `per thread' state +*/ +struct lua_State { + CommonHeader; + lu_byte status; + StkId top; /* first free slot in the stack */ + global_State *l_G; + CallInfo *ci; /* call info for current function */ + const Instruction *oldpc; /* last pc traced */ + StkId stack_last; /* last free slot in the stack */ + StkId stack; /* stack base */ + int stacksize; + unsigned short nny; /* number of non-yieldable calls in stack */ + unsigned short nCcalls; /* number of nested C calls */ + lu_byte hookmask; + lu_byte allowhook; + int basehookcount; + int hookcount; + lua_Hook hook; + GCObject *openupval; /* list of open upvalues in this stack */ + GCObject *gclist; + struct lua_longjmp *errorJmp; /* current error recover point */ + ptrdiff_t errfunc; /* current error handling function (stack index) */ + CallInfo base_ci; /* CallInfo for first level (C calling Lua) */ +}; + + +#define G(L) (L->l_G) + + +/* +** Union of all collectable objects +*/ +union GCObject { + GCheader gch; /* common header */ + union TString ts; + union Udata u; + union Closure cl; + struct Table h; + struct Proto p; + struct UpVal uv; + struct lua_State th; /* thread */ +}; + + +#define gch(o) (&(o)->gch) + +/* macros to convert a GCObject into a specific value */ +#define rawgco2ts(o) \ + check_exp(novariant((o)->gch.tt) == LUA_TSTRING, &((o)->ts)) +#define gco2ts(o) (&rawgco2ts(o)->tsv) +#define rawgco2u(o) check_exp((o)->gch.tt == LUA_TUSERDATA, &((o)->u)) +#define gco2u(o) (&rawgco2u(o)->uv) +#define gco2lcl(o) check_exp((o)->gch.tt == LUA_TLCL, &((o)->cl.l)) +#define gco2ccl(o) check_exp((o)->gch.tt == LUA_TCCL, &((o)->cl.c)) +#define gco2cl(o) \ + check_exp(novariant((o)->gch.tt) == LUA_TFUNCTION, &((o)->cl)) +#define gco2t(o) check_exp((o)->gch.tt == LUA_TTABLE, &((o)->h)) +#define gco2p(o) check_exp((o)->gch.tt == LUA_TPROTO, &((o)->p)) +#define gco2uv(o) check_exp((o)->gch.tt == LUA_TUPVAL, &((o)->uv)) +#define gco2th(o) check_exp((o)->gch.tt == LUA_TTHREAD, &((o)->th)) + +/* macro to convert any Lua object into a GCObject */ +#define obj2gco(v) (cast(GCObject *, (v))) + + +/* actual number of total bytes allocated */ +#define gettotalbytes(g) ((g)->totalbytes + (g)->GCdebt) + +LUAI_FUNC void luaE_setdebt (global_State *g, l_mem debt); +LUAI_FUNC void luaE_freethread (lua_State *L, lua_State *L1); +LUAI_FUNC CallInfo *luaE_extendCI (lua_State *L); +LUAI_FUNC void luaE_freeCI (lua_State *L); + + +#endif + diff --git a/liblua/lstring.c b/liblua/lstring.c new file mode 100644 index 00000000..8b5af0b2 --- /dev/null +++ b/liblua/lstring.c @@ -0,0 +1,185 @@ +/* +** $Id: lstring.c,v 2.26 2013/01/08 13:50:10 roberto Exp $ +** String table (keeps all strings handled by Lua) +** See Copyright Notice in lua.h +*/ + + +#include + +#define lstring_c +#define LUA_CORE + +#include "lua.h" + +#include "lmem.h" +#include "lobject.h" +#include "lstate.h" +#include "lstring.h" + + +/* +** Lua will use at most ~(2^LUAI_HASHLIMIT) bytes from a string to +** compute its hash +*/ +#if !defined(LUAI_HASHLIMIT) +#define LUAI_HASHLIMIT 5 +#endif + + +/* +** equality for long strings +*/ +int luaS_eqlngstr (TString *a, TString *b) { + size_t len = a->tsv.len; + lua_assert(a->tsv.tt == LUA_TLNGSTR && b->tsv.tt == LUA_TLNGSTR); + return (a == b) || /* same instance or... */ + ((len == b->tsv.len) && /* equal length and ... */ + (memcmp(getstr(a), getstr(b), len) == 0)); /* equal contents */ +} + + +/* +** equality for strings +*/ +int luaS_eqstr (TString *a, TString *b) { + return (a->tsv.tt == b->tsv.tt) && + (a->tsv.tt == LUA_TSHRSTR ? eqshrstr(a, b) : luaS_eqlngstr(a, b)); +} + + +unsigned int luaS_hash (const char *str, size_t l, unsigned int seed) { + unsigned int h = seed ^ cast(unsigned int, l); + size_t l1; + size_t step = (l >> LUAI_HASHLIMIT) + 1; + for (l1 = l; l1 >= step; l1 -= step) + h = h ^ ((h<<5) + (h>>2) + cast_byte(str[l1 - 1])); + return h; +} + + +/* +** resizes the string table +*/ +void luaS_resize (lua_State *L, int newsize) { + int i; + stringtable *tb = &G(L)->strt; + /* cannot resize while GC is traversing strings */ + luaC_runtilstate(L, ~bitmask(GCSsweepstring)); + if (newsize > tb->size) { + luaM_reallocvector(L, tb->hash, tb->size, newsize, GCObject *); + for (i = tb->size; i < newsize; i++) tb->hash[i] = NULL; + } + /* rehash */ + for (i=0; isize; i++) { + GCObject *p = tb->hash[i]; + tb->hash[i] = NULL; + while (p) { /* for each node in the list */ + GCObject *next = gch(p)->next; /* save next */ + unsigned int h = lmod(gco2ts(p)->hash, newsize); /* new position */ + gch(p)->next = tb->hash[h]; /* chain it */ + tb->hash[h] = p; + resetoldbit(p); /* see MOVE OLD rule */ + p = next; + } + } + if (newsize < tb->size) { + /* shrinking slice must be empty */ + lua_assert(tb->hash[newsize] == NULL && tb->hash[tb->size - 1] == NULL); + luaM_reallocvector(L, tb->hash, tb->size, newsize, GCObject *); + } + tb->size = newsize; +} + + +/* +** creates a new string object +*/ +static TString *createstrobj (lua_State *L, const char *str, size_t l, + int tag, unsigned int h, GCObject **list) { + TString *ts; + size_t totalsize; /* total size of TString object */ + totalsize = sizeof(TString) + ((l + 1) * sizeof(char)); + ts = &luaC_newobj(L, tag, totalsize, list, 0)->ts; + ts->tsv.len = l; + ts->tsv.hash = h; + ts->tsv.extra = 0; + memcpy(ts+1, str, l*sizeof(char)); + ((char *)(ts+1))[l] = '\0'; /* ending 0 */ + return ts; +} + + +/* +** creates a new short string, inserting it into string table +*/ +static TString *newshrstr (lua_State *L, const char *str, size_t l, + unsigned int h) { + GCObject **list; /* (pointer to) list where it will be inserted */ + stringtable *tb = &G(L)->strt; + TString *s; + if (tb->nuse >= cast(lu_int32, tb->size) && tb->size <= MAX_INT/2) + luaS_resize(L, tb->size*2); /* too crowded */ + list = &tb->hash[lmod(h, tb->size)]; + s = createstrobj(L, str, l, LUA_TSHRSTR, h, list); + tb->nuse++; + return s; +} + + +/* +** checks whether short string exists and reuses it or creates a new one +*/ +static TString *internshrstr (lua_State *L, const char *str, size_t l) { + GCObject *o; + global_State *g = G(L); + unsigned int h = luaS_hash(str, l, g->seed); + for (o = g->strt.hash[lmod(h, g->strt.size)]; + o != NULL; + o = gch(o)->next) { + TString *ts = rawgco2ts(o); + if (h == ts->tsv.hash && + l == ts->tsv.len && + (memcmp(str, getstr(ts), l * sizeof(char)) == 0)) { + if (isdead(G(L), o)) /* string is dead (but was not collected yet)? */ + changewhite(o); /* resurrect it */ + return ts; + } + } + return newshrstr(L, str, l, h); /* not found; create a new string */ +} + + +/* +** new string (with explicit length) +*/ +TString *luaS_newlstr (lua_State *L, const char *str, size_t l) { + if (l <= LUAI_MAXSHORTLEN) /* short string? */ + return internshrstr(L, str, l); + else { + if (l + 1 > (MAX_SIZET - sizeof(TString))/sizeof(char)) + luaM_toobig(L); + return createstrobj(L, str, l, LUA_TLNGSTR, G(L)->seed, NULL); + } +} + + +/* +** new zero-terminated string +*/ +TString *luaS_new (lua_State *L, const char *str) { + return luaS_newlstr(L, str, strlen(str)); +} + + +Udata *luaS_newudata (lua_State *L, size_t s, Table *e) { + Udata *u; + if (s > MAX_SIZET - sizeof(Udata)) + luaM_toobig(L); + u = &luaC_newobj(L, LUA_TUSERDATA, sizeof(Udata) + s, NULL, 0)->u; + u->uv.len = s; + u->uv.metatable = NULL; + u->uv.env = e; + return u; +} + diff --git a/liblua/lstring.h b/liblua/lstring.h new file mode 100644 index 00000000..d312ff3d --- /dev/null +++ b/liblua/lstring.h @@ -0,0 +1,46 @@ +/* +** $Id: lstring.h,v 1.49 2012/02/01 21:57:15 roberto Exp $ +** String table (keep all strings handled by Lua) +** See Copyright Notice in lua.h +*/ + +#ifndef lstring_h +#define lstring_h + +#include "lgc.h" +#include "lobject.h" +#include "lstate.h" + + +#define sizestring(s) (sizeof(union TString)+((s)->len+1)*sizeof(char)) + +#define sizeudata(u) (sizeof(union Udata)+(u)->len) + +#define luaS_newliteral(L, s) (luaS_newlstr(L, "" s, \ + (sizeof(s)/sizeof(char))-1)) + +#define luaS_fix(s) l_setbit((s)->tsv.marked, FIXEDBIT) + + +/* +** test whether a string is a reserved word +*/ +#define isreserved(s) ((s)->tsv.tt == LUA_TSHRSTR && (s)->tsv.extra > 0) + + +/* +** equality for short strings, which are always internalized +*/ +#define eqshrstr(a,b) check_exp((a)->tsv.tt == LUA_TSHRSTR, (a) == (b)) + + +LUAI_FUNC unsigned int luaS_hash (const char *str, size_t l, unsigned int seed); +LUAI_FUNC int luaS_eqlngstr (TString *a, TString *b); +LUAI_FUNC int luaS_eqstr (TString *a, TString *b); +LUAI_FUNC void luaS_resize (lua_State *L, int newsize); +LUAI_FUNC Udata *luaS_newudata (lua_State *L, size_t s, Table *e); +LUAI_FUNC TString *luaS_newlstr (lua_State *L, const char *str, size_t l); +LUAI_FUNC TString *luaS_new (lua_State *L, const char *str); + + +#endif diff --git a/liblua/lstrlib.c b/liblua/lstrlib.c new file mode 100644 index 00000000..fcc61c9a --- /dev/null +++ b/liblua/lstrlib.c @@ -0,0 +1,1019 @@ +/* +** $Id: lstrlib.c,v 1.178 2012/08/14 18:12:34 roberto Exp $ +** Standard library for string operations and pattern-matching +** See Copyright Notice in lua.h +*/ + + +#include +#include +#include +#include +#include + +#define lstrlib_c +#define LUA_LIB + +#include "lua.h" + +#include "lauxlib.h" +#include "lualib.h" + + +/* +** maximum number of captures that a pattern can do during +** pattern-matching. This limit is arbitrary. +*/ +#if !defined(LUA_MAXCAPTURES) +#define LUA_MAXCAPTURES 32 +#endif + + +/* macro to `unsign' a character */ +#define uchar(c) ((unsigned char)(c)) + + + +static int str_len (lua_State *L) { + size_t l; + luaL_checklstring(L, 1, &l); + lua_pushinteger(L, (lua_Integer)l); + return 1; +} + + +/* translate a relative string position: negative means back from end */ +static size_t posrelat (ptrdiff_t pos, size_t len) { + if (pos >= 0) return (size_t)pos; + else if (0u - (size_t)pos > len) return 0; + else return len - ((size_t)-pos) + 1; +} + + +static int str_sub (lua_State *L) { + size_t l; + const char *s = luaL_checklstring(L, 1, &l); + size_t start = posrelat(luaL_checkinteger(L, 2), l); + size_t end = posrelat(luaL_optinteger(L, 3, -1), l); + if (start < 1) start = 1; + if (end > l) end = l; + if (start <= end) + lua_pushlstring(L, s + start - 1, end - start + 1); + else lua_pushliteral(L, ""); + return 1; +} + + +static int str_reverse (lua_State *L) { + size_t l, i; + luaL_Buffer b; + const char *s = luaL_checklstring(L, 1, &l); + char *p = luaL_buffinitsize(L, &b, l); + for (i = 0; i < l; i++) + p[i] = s[l - i - 1]; + luaL_pushresultsize(&b, l); + return 1; +} + + +static int str_lower (lua_State *L) { + size_t l; + size_t i; + luaL_Buffer b; + const char *s = luaL_checklstring(L, 1, &l); + char *p = luaL_buffinitsize(L, &b, l); + for (i=0; i> 1) + +static int str_rep (lua_State *L) { + size_t l, lsep; + const char *s = luaL_checklstring(L, 1, &l); + int n = luaL_checkint(L, 2); + const char *sep = luaL_optlstring(L, 3, "", &lsep); + if (n <= 0) lua_pushliteral(L, ""); + else if (l + lsep < l || l + lsep >= MAXSIZE / n) /* may overflow? */ + return luaL_error(L, "resulting string too large"); + else { + size_t totallen = n * l + (n - 1) * lsep; + luaL_Buffer b; + char *p = luaL_buffinitsize(L, &b, totallen); + while (n-- > 1) { /* first n-1 copies (followed by separator) */ + memcpy(p, s, l * sizeof(char)); p += l; + if (lsep > 0) { /* avoid empty 'memcpy' (may be expensive) */ + memcpy(p, sep, lsep * sizeof(char)); p += lsep; + } + } + memcpy(p, s, l * sizeof(char)); /* last copy (not followed by separator) */ + luaL_pushresultsize(&b, totallen); + } + return 1; +} + + +static int str_byte (lua_State *L) { + size_t l; + const char *s = luaL_checklstring(L, 1, &l); + size_t posi = posrelat(luaL_optinteger(L, 2, 1), l); + size_t pose = posrelat(luaL_optinteger(L, 3, posi), l); + int n, i; + if (posi < 1) posi = 1; + if (pose > l) pose = l; + if (posi > pose) return 0; /* empty interval; return no values */ + n = (int)(pose - posi + 1); + if (posi + n <= pose) /* (size_t -> int) overflow? */ + return luaL_error(L, "string slice too long"); + luaL_checkstack(L, n, "string slice too long"); + for (i=0; i= ms->level || ms->capture[l].len == CAP_UNFINISHED) + return luaL_error(ms->L, "invalid capture index %%%d", l + 1); + return l; +} + + +static int capture_to_close (MatchState *ms) { + int level = ms->level; + for (level--; level>=0; level--) + if (ms->capture[level].len == CAP_UNFINISHED) return level; + return luaL_error(ms->L, "invalid pattern capture"); +} + + +static const char *classend (MatchState *ms, const char *p) { + switch (*p++) { + case L_ESC: { + if (p == ms->p_end) + luaL_error(ms->L, "malformed pattern (ends with " LUA_QL("%%") ")"); + return p+1; + } + case '[': { + if (*p == '^') p++; + do { /* look for a `]' */ + if (p == ms->p_end) + luaL_error(ms->L, "malformed pattern (missing " LUA_QL("]") ")"); + if (*(p++) == L_ESC && p < ms->p_end) + p++; /* skip escapes (e.g. `%]') */ + } while (*p != ']'); + return p+1; + } + default: { + return p; + } + } +} + + +static int match_class (int c, int cl) { + int res; + switch (tolower(cl)) { + case 'a' : res = isalpha(c); break; + case 'c' : res = iscntrl(c); break; + case 'd' : res = isdigit(c); break; + case 'g' : res = isgraph(c); break; + case 'l' : res = islower(c); break; + case 'p' : res = ispunct(c); break; + case 's' : res = isspace(c); break; + case 'u' : res = isupper(c); break; + case 'w' : res = isalnum(c); break; + case 'x' : res = isxdigit(c); break; + case 'z' : res = (c == 0); break; /* deprecated option */ + default: return (cl == c); + } + return (islower(cl) ? res : !res); +} + + +static int matchbracketclass (int c, const char *p, const char *ec) { + int sig = 1; + if (*(p+1) == '^') { + sig = 0; + p++; /* skip the `^' */ + } + while (++p < ec) { + if (*p == L_ESC) { + p++; + if (match_class(c, uchar(*p))) + return sig; + } + else if ((*(p+1) == '-') && (p+2 < ec)) { + p+=2; + if (uchar(*(p-2)) <= c && c <= uchar(*p)) + return sig; + } + else if (uchar(*p) == c) return sig; + } + return !sig; +} + + +static int singlematch (MatchState *ms, const char *s, const char *p, + const char *ep) { + if (s >= ms->src_end) + return 0; + else { + int c = uchar(*s); + switch (*p) { + case '.': return 1; /* matches any char */ + case L_ESC: return match_class(c, uchar(*(p+1))); + case '[': return matchbracketclass(c, p, ep-1); + default: return (uchar(*p) == c); + } + } +} + + +static const char *matchbalance (MatchState *ms, const char *s, + const char *p) { + if (p >= ms->p_end - 1) + luaL_error(ms->L, "malformed pattern " + "(missing arguments to " LUA_QL("%%b") ")"); + if (*s != *p) return NULL; + else { + int b = *p; + int e = *(p+1); + int cont = 1; + while (++s < ms->src_end) { + if (*s == e) { + if (--cont == 0) return s+1; + } + else if (*s == b) cont++; + } + } + return NULL; /* string ends out of balance */ +} + + +static const char *max_expand (MatchState *ms, const char *s, + const char *p, const char *ep) { + ptrdiff_t i = 0; /* counts maximum expand for item */ + while (singlematch(ms, s + i, p, ep)) + i++; + /* keeps trying to match with the maximum repetitions */ + while (i>=0) { + const char *res = match(ms, (s+i), ep+1); + if (res) return res; + i--; /* else didn't match; reduce 1 repetition to try again */ + } + return NULL; +} + + +static const char *min_expand (MatchState *ms, const char *s, + const char *p, const char *ep) { + for (;;) { + const char *res = match(ms, s, ep+1); + if (res != NULL) + return res; + else if (singlematch(ms, s, p, ep)) + s++; /* try with one more repetition */ + else return NULL; + } +} + + +static const char *start_capture (MatchState *ms, const char *s, + const char *p, int what) { + const char *res; + int level = ms->level; + if (level >= LUA_MAXCAPTURES) luaL_error(ms->L, "too many captures"); + ms->capture[level].init = s; + ms->capture[level].len = what; + ms->level = level+1; + if ((res=match(ms, s, p)) == NULL) /* match failed? */ + ms->level--; /* undo capture */ + return res; +} + + +static const char *end_capture (MatchState *ms, const char *s, + const char *p) { + int l = capture_to_close(ms); + const char *res; + ms->capture[l].len = s - ms->capture[l].init; /* close capture */ + if ((res = match(ms, s, p)) == NULL) /* match failed? */ + ms->capture[l].len = CAP_UNFINISHED; /* undo capture */ + return res; +} + + +static const char *match_capture (MatchState *ms, const char *s, int l) { + size_t len; + l = check_capture(ms, l); + len = ms->capture[l].len; + if ((size_t)(ms->src_end-s) >= len && + memcmp(ms->capture[l].init, s, len) == 0) + return s+len; + else return NULL; +} + + +static const char *match (MatchState *ms, const char *s, const char *p) { + if (ms->matchdepth-- == 0) + luaL_error(ms->L, "pattern too complex"); + init: /* using goto's to optimize tail recursion */ + if (p != ms->p_end) { /* end of pattern? */ + switch (*p) { + case '(': { /* start capture */ + if (*(p + 1) == ')') /* position capture? */ + s = start_capture(ms, s, p + 2, CAP_POSITION); + else + s = start_capture(ms, s, p + 1, CAP_UNFINISHED); + break; + } + case ')': { /* end capture */ + s = end_capture(ms, s, p + 1); + break; + } + case '$': { + if ((p + 1) != ms->p_end) /* is the `$' the last char in pattern? */ + goto dflt; /* no; go to default */ + s = (s == ms->src_end) ? s : NULL; /* check end of string */ + break; + } + case L_ESC: { /* escaped sequences not in the format class[*+?-]? */ + switch (*(p + 1)) { + case 'b': { /* balanced string? */ + s = matchbalance(ms, s, p + 2); + if (s != NULL) { + p += 4; goto init; /* return match(ms, s, p + 4); */ + } /* else fail (s == NULL) */ + break; + } + case 'f': { /* frontier? */ + const char *ep; char previous; + p += 2; + if (*p != '[') + luaL_error(ms->L, "missing " LUA_QL("[") " after " + LUA_QL("%%f") " in pattern"); + ep = classend(ms, p); /* points to what is next */ + previous = (s == ms->src_init) ? '\0' : *(s - 1); + if (!matchbracketclass(uchar(previous), p, ep - 1) && + matchbracketclass(uchar(*s), p, ep - 1)) { + p = ep; goto init; /* return match(ms, s, ep); */ + } + s = NULL; /* match failed */ + break; + } + case '0': case '1': case '2': case '3': + case '4': case '5': case '6': case '7': + case '8': case '9': { /* capture results (%0-%9)? */ + s = match_capture(ms, s, uchar(*(p + 1))); + if (s != NULL) { + p += 2; goto init; /* return match(ms, s, p + 2) */ + } + break; + } + default: goto dflt; + } + break; + } + default: dflt: { /* pattern class plus optional suffix */ + const char *ep = classend(ms, p); /* points to optional suffix */ + /* does not match at least once? */ + if (!singlematch(ms, s, p, ep)) { + if (*ep == '*' || *ep == '?' || *ep == '-') { /* accept empty? */ + p = ep + 1; goto init; /* return match(ms, s, ep + 1); */ + } + else /* '+' or no suffix */ + s = NULL; /* fail */ + } + else { /* matched once */ + switch (*ep) { /* handle optional suffix */ + case '?': { /* optional */ + const char *res; + if ((res = match(ms, s + 1, ep + 1)) != NULL) + s = res; + else { + p = ep + 1; goto init; /* else return match(ms, s, ep + 1); */ + } + break; + } + case '+': /* 1 or more repetitions */ + s++; /* 1 match already done */ + /* go through */ + case '*': /* 0 or more repetitions */ + s = max_expand(ms, s, p, ep); + break; + case '-': /* 0 or more repetitions (minimum) */ + s = min_expand(ms, s, p, ep); + break; + default: /* no suffix */ + s++; p = ep; goto init; /* return match(ms, s + 1, ep); */ + } + } + break; + } + } + } + ms->matchdepth++; + return s; +} + + + +static const char *lmemfind (const char *s1, size_t l1, + const char *s2, size_t l2) { + if (l2 == 0) return s1; /* empty strings are everywhere */ + else if (l2 > l1) return NULL; /* avoids a negative `l1' */ + else { + const char *init; /* to search for a `*s2' inside `s1' */ + l2--; /* 1st char will be checked by `memchr' */ + l1 = l1-l2; /* `s2' cannot be found after that */ + while (l1 > 0 && (init = (const char *)memchr(s1, *s2, l1)) != NULL) { + init++; /* 1st char is already checked */ + if (memcmp(init, s2+1, l2) == 0) + return init-1; + else { /* correct `l1' and `s1' to try again */ + l1 -= init-s1; + s1 = init; + } + } + return NULL; /* not found */ + } +} + + +static void push_onecapture (MatchState *ms, int i, const char *s, + const char *e) { + if (i >= ms->level) { + if (i == 0) /* ms->level == 0, too */ + lua_pushlstring(ms->L, s, e - s); /* add whole match */ + else + luaL_error(ms->L, "invalid capture index"); + } + else { + ptrdiff_t l = ms->capture[i].len; + if (l == CAP_UNFINISHED) luaL_error(ms->L, "unfinished capture"); + if (l == CAP_POSITION) + lua_pushinteger(ms->L, ms->capture[i].init - ms->src_init + 1); + else + lua_pushlstring(ms->L, ms->capture[i].init, l); + } +} + + +static int push_captures (MatchState *ms, const char *s, const char *e) { + int i; + int nlevels = (ms->level == 0 && s) ? 1 : ms->level; + luaL_checkstack(ms->L, nlevels, "too many captures"); + for (i = 0; i < nlevels; i++) + push_onecapture(ms, i, s, e); + return nlevels; /* number of strings pushed */ +} + + +/* check whether pattern has no special characters */ +static int nospecials (const char *p, size_t l) { + size_t upto = 0; + do { + if (strpbrk(p + upto, SPECIALS)) + return 0; /* pattern has a special character */ + upto += strlen(p + upto) + 1; /* may have more after \0 */ + } while (upto <= l); + return 1; /* no special chars found */ +} + + +static int str_find_aux (lua_State *L, int find) { + size_t ls, lp; + const char *s = luaL_checklstring(L, 1, &ls); + const char *p = luaL_checklstring(L, 2, &lp); + size_t init = posrelat(luaL_optinteger(L, 3, 1), ls); + if (init < 1) init = 1; + else if (init > ls + 1) { /* start after string's end? */ + lua_pushnil(L); /* cannot find anything */ + return 1; + } + /* explicit request or no special characters? */ + if (find && (lua_toboolean(L, 4) || nospecials(p, lp))) { + /* do a plain search */ + const char *s2 = lmemfind(s + init - 1, ls - init + 1, p, lp); + if (s2) { + lua_pushinteger(L, s2 - s + 1); + lua_pushinteger(L, s2 - s + lp); + return 2; + } + } + else { + MatchState ms; + const char *s1 = s + init - 1; + int anchor = (*p == '^'); + if (anchor) { + p++; lp--; /* skip anchor character */ + } + ms.L = L; + ms.matchdepth = MAXCCALLS; + ms.src_init = s; + ms.src_end = s + ls; + ms.p_end = p + lp; + do { + const char *res; + ms.level = 0; + lua_assert(ms.matchdepth == MAXCCALLS); + if ((res=match(&ms, s1, p)) != NULL) { + if (find) { + lua_pushinteger(L, s1 - s + 1); /* start */ + lua_pushinteger(L, res - s); /* end */ + return push_captures(&ms, NULL, 0) + 2; + } + else + return push_captures(&ms, s1, res); + } + } while (s1++ < ms.src_end && !anchor); + } + lua_pushnil(L); /* not found */ + return 1; +} + + +static int str_find (lua_State *L) { + return str_find_aux(L, 1); +} + + +static int str_match (lua_State *L) { + return str_find_aux(L, 0); +} + + +static int gmatch_aux (lua_State *L) { + MatchState ms; + size_t ls, lp; + const char *s = lua_tolstring(L, lua_upvalueindex(1), &ls); + const char *p = lua_tolstring(L, lua_upvalueindex(2), &lp); + const char *src; + ms.L = L; + ms.matchdepth = MAXCCALLS; + ms.src_init = s; + ms.src_end = s+ls; + ms.p_end = p + lp; + for (src = s + (size_t)lua_tointeger(L, lua_upvalueindex(3)); + src <= ms.src_end; + src++) { + const char *e; + ms.level = 0; + lua_assert(ms.matchdepth == MAXCCALLS); + if ((e = match(&ms, src, p)) != NULL) { + lua_Integer newstart = e-s; + if (e == src) newstart++; /* empty match? go at least one position */ + lua_pushinteger(L, newstart); + lua_replace(L, lua_upvalueindex(3)); + return push_captures(&ms, src, e); + } + } + return 0; /* not found */ +} + + +static int gmatch (lua_State *L) { + luaL_checkstring(L, 1); + luaL_checkstring(L, 2); + lua_settop(L, 2); + lua_pushinteger(L, 0); + lua_pushcclosure(L, gmatch_aux, 3); + return 1; +} + + +static void add_s (MatchState *ms, luaL_Buffer *b, const char *s, + const char *e) { + size_t l, i; + const char *news = lua_tolstring(ms->L, 3, &l); + for (i = 0; i < l; i++) { + if (news[i] != L_ESC) + luaL_addchar(b, news[i]); + else { + i++; /* skip ESC */ + if (!isdigit(uchar(news[i]))) { + if (news[i] != L_ESC) + luaL_error(ms->L, "invalid use of " LUA_QL("%c") + " in replacement string", L_ESC); + luaL_addchar(b, news[i]); + } + else if (news[i] == '0') + luaL_addlstring(b, s, e - s); + else { + push_onecapture(ms, news[i] - '1', s, e); + luaL_addvalue(b); /* add capture to accumulated result */ + } + } + } +} + + +static void add_value (MatchState *ms, luaL_Buffer *b, const char *s, + const char *e, int tr) { + lua_State *L = ms->L; + switch (tr) { + case LUA_TFUNCTION: { + int n; + lua_pushvalue(L, 3); + n = push_captures(ms, s, e); + lua_call(L, n, 1); + break; + } + case LUA_TTABLE: { + push_onecapture(ms, 0, s, e); + lua_gettable(L, 3); + break; + } + default: { /* LUA_TNUMBER or LUA_TSTRING */ + add_s(ms, b, s, e); + return; + } + } + if (!lua_toboolean(L, -1)) { /* nil or false? */ + lua_pop(L, 1); + lua_pushlstring(L, s, e - s); /* keep original text */ + } + else if (!lua_isstring(L, -1)) + luaL_error(L, "invalid replacement value (a %s)", luaL_typename(L, -1)); + luaL_addvalue(b); /* add result to accumulator */ +} + + +static int str_gsub (lua_State *L) { + size_t srcl, lp; + const char *src = luaL_checklstring(L, 1, &srcl); + const char *p = luaL_checklstring(L, 2, &lp); + int tr = lua_type(L, 3); + size_t max_s = luaL_optinteger(L, 4, srcl+1); + int anchor = (*p == '^'); + size_t n = 0; + MatchState ms; + luaL_Buffer b; + luaL_argcheck(L, tr == LUA_TNUMBER || tr == LUA_TSTRING || + tr == LUA_TFUNCTION || tr == LUA_TTABLE, 3, + "string/function/table expected"); + luaL_buffinit(L, &b); + if (anchor) { + p++; lp--; /* skip anchor character */ + } + ms.L = L; + ms.matchdepth = MAXCCALLS; + ms.src_init = src; + ms.src_end = src+srcl; + ms.p_end = p + lp; + while (n < max_s) { + const char *e; + ms.level = 0; + lua_assert(ms.matchdepth == MAXCCALLS); + e = match(&ms, src, p); + if (e) { + n++; + add_value(&ms, &b, src, e, tr); + } + if (e && e>src) /* non empty match? */ + src = e; /* skip it */ + else if (src < ms.src_end) + luaL_addchar(&b, *src++); + else break; + if (anchor) break; + } + luaL_addlstring(&b, src, ms.src_end-src); + luaL_pushresult(&b); + lua_pushinteger(L, n); /* number of substitutions */ + return 2; +} + +/* }====================================================== */ + + + +/* +** {====================================================== +** STRING FORMAT +** ======================================================= +*/ + +/* +** LUA_INTFRMLEN is the length modifier for integer conversions in +** 'string.format'; LUA_INTFRM_T is the integer type corresponding to +** the previous length +*/ +#if !defined(LUA_INTFRMLEN) /* { */ +#if defined(LUA_USE_LONGLONG) + +#define LUA_INTFRMLEN "ll" +#define LUA_INTFRM_T long long + +#else + +#define LUA_INTFRMLEN "l" +#define LUA_INTFRM_T long + +#endif +#endif /* } */ + + +/* +** LUA_FLTFRMLEN is the length modifier for float conversions in +** 'string.format'; LUA_FLTFRM_T is the float type corresponding to +** the previous length +*/ +#if !defined(LUA_FLTFRMLEN) + +#define LUA_FLTFRMLEN "" +#define LUA_FLTFRM_T double + +#endif + + +/* maximum size of each formatted item (> len(format('%99.99f', -1e308))) */ +#define MAX_ITEM 512 +/* valid flags in a format specification */ +#define FLAGS "-+ #0" +/* +** maximum size of each format specification (such as '%-099.99d') +** (+10 accounts for %99.99x plus margin of error) +*/ +#define MAX_FORMAT (sizeof(FLAGS) + sizeof(LUA_INTFRMLEN) + 10) + + +static void addquoted (lua_State *L, luaL_Buffer *b, int arg) { + size_t l; + const char *s = luaL_checklstring(L, arg, &l); + luaL_addchar(b, '"'); + while (l--) { + if (*s == '"' || *s == '\\' || *s == '\n') { + luaL_addchar(b, '\\'); + luaL_addchar(b, *s); + } + else if (*s == '\0' || iscntrl(uchar(*s))) { + char buff[10]; + if (!isdigit(uchar(*(s+1)))) + sprintf(buff, "\\%d", (int)uchar(*s)); + else + sprintf(buff, "\\%03d", (int)uchar(*s)); + luaL_addstring(b, buff); + } + else + luaL_addchar(b, *s); + s++; + } + luaL_addchar(b, '"'); +} + +static const char *scanformat (lua_State *L, const char *strfrmt, char *form) { + const char *p = strfrmt; + while (*p != '\0' && strchr(FLAGS, *p) != NULL) p++; /* skip flags */ + if ((size_t)(p - strfrmt) >= sizeof(FLAGS)/sizeof(char)) + luaL_error(L, "invalid format (repeated flags)"); + if (isdigit(uchar(*p))) p++; /* skip width */ + if (isdigit(uchar(*p))) p++; /* (2 digits at most) */ + if (*p == '.') { + p++; + if (isdigit(uchar(*p))) p++; /* skip precision */ + if (isdigit(uchar(*p))) p++; /* (2 digits at most) */ + } + if (isdigit(uchar(*p))) + luaL_error(L, "invalid format (width or precision too long)"); + *(form++) = '%'; + memcpy(form, strfrmt, (p - strfrmt + 1) * sizeof(char)); + form += p - strfrmt + 1; + *form = '\0'; + return p; +} + + +/* +** add length modifier into formats +*/ +static void addlenmod (char *form, const char *lenmod) { + size_t l = strlen(form); + size_t lm = strlen(lenmod); + char spec = form[l - 1]; + strcpy(form + l - 1, lenmod); + form[l + lm - 1] = spec; + form[l + lm] = '\0'; +} + + +static int str_format (lua_State *L) { + int top = lua_gettop(L); + int arg = 1; + size_t sfl; + const char *strfrmt = luaL_checklstring(L, arg, &sfl); + const char *strfrmt_end = strfrmt+sfl; + luaL_Buffer b; + luaL_buffinit(L, &b); + while (strfrmt < strfrmt_end) { + if (*strfrmt != L_ESC) + luaL_addchar(&b, *strfrmt++); + else if (*++strfrmt == L_ESC) + luaL_addchar(&b, *strfrmt++); /* %% */ + else { /* format item */ + char form[MAX_FORMAT]; /* to store the format (`%...') */ + char *buff = luaL_prepbuffsize(&b, MAX_ITEM); /* to put formatted item */ + int nb = 0; /* number of bytes in added item */ + if (++arg > top) + luaL_argerror(L, arg, "no value"); + strfrmt = scanformat(L, strfrmt, form); + switch (*strfrmt++) { + case 'c': { + nb = sprintf(buff, form, luaL_checkint(L, arg)); + break; + } + case 'd': case 'i': { + lua_Number n = luaL_checknumber(L, arg); + LUA_INTFRM_T ni = (LUA_INTFRM_T)n; + lua_Number diff = n - (lua_Number)ni; + luaL_argcheck(L, -1 < diff && diff < 1, arg, + "not a number in proper range"); + addlenmod(form, LUA_INTFRMLEN); + nb = sprintf(buff, form, ni); + break; + } + case 'o': case 'u': case 'x': case 'X': { + lua_Number n = luaL_checknumber(L, arg); + unsigned LUA_INTFRM_T ni = (unsigned LUA_INTFRM_T)n; + lua_Number diff = n - (lua_Number)ni; + luaL_argcheck(L, -1 < diff && diff < 1, arg, + "not a non-negative number in proper range"); + addlenmod(form, LUA_INTFRMLEN); + nb = sprintf(buff, form, ni); + break; + } + case 'e': case 'E': case 'f': +#if defined(LUA_USE_AFORMAT) + case 'a': case 'A': +#endif + case 'g': case 'G': { + addlenmod(form, LUA_FLTFRMLEN); + nb = sprintf(buff, form, (LUA_FLTFRM_T)luaL_checknumber(L, arg)); + break; + } + case 'q': { + addquoted(L, &b, arg); + break; + } + case 's': { + size_t l; + const char *s = luaL_tolstring(L, arg, &l); + if (!strchr(form, '.') && l >= 100) { + /* no precision and string is too long to be formatted; + keep original string */ + luaL_addvalue(&b); + break; + } + else { + nb = sprintf(buff, form, s); + lua_pop(L, 1); /* remove result from 'luaL_tolstring' */ + break; + } + } + default: { /* also treat cases `pnLlh' */ + return luaL_error(L, "invalid option " LUA_QL("%%%c") " to " + LUA_QL("format"), *(strfrmt - 1)); + } + } + luaL_addsize(&b, nb); + } + } + luaL_pushresult(&b); + return 1; +} + +/* }====================================================== */ + + +static const luaL_Reg strlib[] = { + {"byte", str_byte}, + {"char", str_char}, + {"dump", str_dump}, + {"find", str_find}, + {"format", str_format}, + {"gmatch", gmatch}, + {"gsub", str_gsub}, + {"len", str_len}, + {"lower", str_lower}, + {"match", str_match}, + {"rep", str_rep}, + {"reverse", str_reverse}, + {"sub", str_sub}, + {"upper", str_upper}, + {NULL, NULL} +}; + + +static void createmetatable (lua_State *L) { + lua_createtable(L, 0, 1); /* table to be metatable for strings */ + lua_pushliteral(L, ""); /* dummy string */ + lua_pushvalue(L, -2); /* copy table */ + lua_setmetatable(L, -2); /* set table as metatable for strings */ + lua_pop(L, 1); /* pop dummy string */ + lua_pushvalue(L, -2); /* get string library */ + lua_setfield(L, -2, "__index"); /* metatable.__index = string */ + lua_pop(L, 1); /* pop metatable */ +} + + +/* +** Open string library +*/ +LUAMOD_API int luaopen_string (lua_State *L) { + luaL_newlib(L, strlib); + createmetatable(L); + return 1; +} + diff --git a/liblua/ltable.c b/liblua/ltable.c new file mode 100644 index 00000000..420391fc --- /dev/null +++ b/liblua/ltable.c @@ -0,0 +1,588 @@ +/* +** $Id: ltable.c,v 2.72 2012/09/11 19:37:16 roberto Exp $ +** Lua tables (hash) +** See Copyright Notice in lua.h +*/ + + +/* +** Implementation of tables (aka arrays, objects, or hash tables). +** Tables keep its elements in two parts: an array part and a hash part. +** Non-negative integer keys are all candidates to be kept in the array +** part. The actual size of the array is the largest `n' such that at +** least half the slots between 0 and n are in use. +** Hash uses a mix of chained scatter table with Brent's variation. +** A main invariant of these tables is that, if an element is not +** in its main position (i.e. the `original' position that its hash gives +** to it), then the colliding element is in its own main position. +** Hence even when the load factor reaches 100%, performance remains good. +*/ + +#include + +#define ltable_c +#define LUA_CORE + +#include "lua.h" + +#include "ldebug.h" +#include "ldo.h" +#include "lgc.h" +#include "lmem.h" +#include "lobject.h" +#include "lstate.h" +#include "lstring.h" +#include "ltable.h" +#include "lvm.h" + + +/* +** max size of array part is 2^MAXBITS +*/ +#if LUAI_BITSINT >= 32 +#define MAXBITS 30 +#else +#define MAXBITS (LUAI_BITSINT-2) +#endif + +#define MAXASIZE (1 << MAXBITS) + + +#define hashpow2(t,n) (gnode(t, lmod((n), sizenode(t)))) + +#define hashstr(t,str) hashpow2(t, (str)->tsv.hash) +#define hashboolean(t,p) hashpow2(t, p) + + +/* +** for some types, it is better to avoid modulus by power of 2, as +** they tend to have many 2 factors. +*/ +#define hashmod(t,n) (gnode(t, ((n) % ((sizenode(t)-1)|1)))) + + +#define hashpointer(t,p) hashmod(t, IntPoint(p)) + + +#define dummynode (&dummynode_) + +#define isdummy(n) ((n) == dummynode) + +static const Node dummynode_ = { + {NILCONSTANT}, /* value */ + {{NILCONSTANT, NULL}} /* key */ +}; + + +/* +** hash for lua_Numbers +*/ +static Node *hashnum (const Table *t, lua_Number n) { + int i; + luai_hashnum(i, n); + if (i < 0) { + if (cast(unsigned int, i) == 0u - i) /* use unsigned to avoid overflows */ + i = 0; /* handle INT_MIN */ + i = -i; /* must be a positive value */ + } + return hashmod(t, i); +} + + + +/* +** returns the `main' position of an element in a table (that is, the index +** of its hash value) +*/ +static Node *mainposition (const Table *t, const TValue *key) { + switch (ttype(key)) { + case LUA_TNUMBER: + return hashnum(t, nvalue(key)); + case LUA_TLNGSTR: { + TString *s = rawtsvalue(key); + if (s->tsv.extra == 0) { /* no hash? */ + s->tsv.hash = luaS_hash(getstr(s), s->tsv.len, s->tsv.hash); + s->tsv.extra = 1; /* now it has its hash */ + } + return hashstr(t, rawtsvalue(key)); + } + case LUA_TSHRSTR: + return hashstr(t, rawtsvalue(key)); + case LUA_TBOOLEAN: + return hashboolean(t, bvalue(key)); + case LUA_TLIGHTUSERDATA: + return hashpointer(t, pvalue(key)); + case LUA_TLCF: + return hashpointer(t, fvalue(key)); + default: + return hashpointer(t, gcvalue(key)); + } +} + + +/* +** returns the index for `key' if `key' is an appropriate key to live in +** the array part of the table, -1 otherwise. +*/ +static int arrayindex (const TValue *key) { + if (ttisnumber(key)) { + lua_Number n = nvalue(key); + int k; + lua_number2int(k, n); + if (luai_numeq(cast_num(k), n)) + return k; + } + return -1; /* `key' did not match some condition */ +} + + +/* +** returns the index of a `key' for table traversals. First goes all +** elements in the array part, then elements in the hash part. The +** beginning of a traversal is signaled by -1. +*/ +static int findindex (lua_State *L, Table *t, StkId key) { + int i; + if (ttisnil(key)) return -1; /* first iteration */ + i = arrayindex(key); + if (0 < i && i <= t->sizearray) /* is `key' inside array part? */ + return i-1; /* yes; that's the index (corrected to C) */ + else { + Node *n = mainposition(t, key); + for (;;) { /* check whether `key' is somewhere in the chain */ + /* key may be dead already, but it is ok to use it in `next' */ + if (luaV_rawequalobj(gkey(n), key) || + (ttisdeadkey(gkey(n)) && iscollectable(key) && + deadvalue(gkey(n)) == gcvalue(key))) { + i = cast_int(n - gnode(t, 0)); /* key index in hash table */ + /* hash elements are numbered after array ones */ + return i + t->sizearray; + } + else n = gnext(n); + if (n == NULL) + luaG_runerror(L, "invalid key to " LUA_QL("next")); /* key not found */ + } + } +} + + +int luaH_next (lua_State *L, Table *t, StkId key) { + int i = findindex(L, t, key); /* find original element */ + for (i++; i < t->sizearray; i++) { /* try first array part */ + if (!ttisnil(&t->array[i])) { /* a non-nil value? */ + setnvalue(key, cast_num(i+1)); + setobj2s(L, key+1, &t->array[i]); + return 1; + } + } + for (i -= t->sizearray; i < sizenode(t); i++) { /* then hash part */ + if (!ttisnil(gval(gnode(t, i)))) { /* a non-nil value? */ + setobj2s(L, key, gkey(gnode(t, i))); + setobj2s(L, key+1, gval(gnode(t, i))); + return 1; + } + } + return 0; /* no more elements */ +} + + +/* +** {============================================================= +** Rehash +** ============================================================== +*/ + + +static int computesizes (int nums[], int *narray) { + int i; + int twotoi; /* 2^i */ + int a = 0; /* number of elements smaller than 2^i */ + int na = 0; /* number of elements to go to array part */ + int n = 0; /* optimal size for array part */ + for (i = 0, twotoi = 1; twotoi/2 < *narray; i++, twotoi *= 2) { + if (nums[i] > 0) { + a += nums[i]; + if (a > twotoi/2) { /* more than half elements present? */ + n = twotoi; /* optimal size (till now) */ + na = a; /* all elements smaller than n will go to array part */ + } + } + if (a == *narray) break; /* all elements already counted */ + } + *narray = n; + lua_assert(*narray/2 <= na && na <= *narray); + return na; +} + + +static int countint (const TValue *key, int *nums) { + int k = arrayindex(key); + if (0 < k && k <= MAXASIZE) { /* is `key' an appropriate array index? */ + nums[luaO_ceillog2(k)]++; /* count as such */ + return 1; + } + else + return 0; +} + + +static int numusearray (const Table *t, int *nums) { + int lg; + int ttlg; /* 2^lg */ + int ause = 0; /* summation of `nums' */ + int i = 1; /* count to traverse all array keys */ + for (lg=0, ttlg=1; lg<=MAXBITS; lg++, ttlg*=2) { /* for each slice */ + int lc = 0; /* counter */ + int lim = ttlg; + if (lim > t->sizearray) { + lim = t->sizearray; /* adjust upper limit */ + if (i > lim) + break; /* no more elements to count */ + } + /* count elements in range (2^(lg-1), 2^lg] */ + for (; i <= lim; i++) { + if (!ttisnil(&t->array[i-1])) + lc++; + } + nums[lg] += lc; + ause += lc; + } + return ause; +} + + +static int numusehash (const Table *t, int *nums, int *pnasize) { + int totaluse = 0; /* total number of elements */ + int ause = 0; /* summation of `nums' */ + int i = sizenode(t); + while (i--) { + Node *n = &t->node[i]; + if (!ttisnil(gval(n))) { + ause += countint(gkey(n), nums); + totaluse++; + } + } + *pnasize += ause; + return totaluse; +} + + +static void setarrayvector (lua_State *L, Table *t, int size) { + int i; + luaM_reallocvector(L, t->array, t->sizearray, size, TValue); + for (i=t->sizearray; iarray[i]); + t->sizearray = size; +} + + +static void setnodevector (lua_State *L, Table *t, int size) { + int lsize; + if (size == 0) { /* no elements to hash part? */ + t->node = cast(Node *, dummynode); /* use common `dummynode' */ + lsize = 0; + } + else { + int i; + lsize = luaO_ceillog2(size); + if (lsize > MAXBITS) + luaG_runerror(L, "table overflow"); + size = twoto(lsize); + t->node = luaM_newvector(L, size, Node); + for (i=0; ilsizenode = cast_byte(lsize); + t->lastfree = gnode(t, size); /* all positions are free */ +} + + +void luaH_resize (lua_State *L, Table *t, int nasize, int nhsize) { + int i; + int oldasize = t->sizearray; + int oldhsize = t->lsizenode; + Node *nold = t->node; /* save old hash ... */ + if (nasize > oldasize) /* array part must grow? */ + setarrayvector(L, t, nasize); + /* create new hash part with appropriate size */ + setnodevector(L, t, nhsize); + if (nasize < oldasize) { /* array part must shrink? */ + t->sizearray = nasize; + /* re-insert elements from vanishing slice */ + for (i=nasize; iarray[i])) + luaH_setint(L, t, i + 1, &t->array[i]); + } + /* shrink array */ + luaM_reallocvector(L, t->array, oldasize, nasize, TValue); + } + /* re-insert elements from hash part */ + for (i = twoto(oldhsize) - 1; i >= 0; i--) { + Node *old = nold+i; + if (!ttisnil(gval(old))) { + /* doesn't need barrier/invalidate cache, as entry was + already present in the table */ + setobjt2t(L, luaH_set(L, t, gkey(old)), gval(old)); + } + } + if (!isdummy(nold)) + luaM_freearray(L, nold, cast(size_t, twoto(oldhsize))); /* free old array */ +} + + +void luaH_resizearray (lua_State *L, Table *t, int nasize) { + int nsize = isdummy(t->node) ? 0 : sizenode(t); + luaH_resize(L, t, nasize, nsize); +} + + +static void rehash (lua_State *L, Table *t, const TValue *ek) { + int nasize, na; + int nums[MAXBITS+1]; /* nums[i] = number of keys with 2^(i-1) < k <= 2^i */ + int i; + int totaluse; + for (i=0; i<=MAXBITS; i++) nums[i] = 0; /* reset counts */ + nasize = numusearray(t, nums); /* count keys in array part */ + totaluse = nasize; /* all those keys are integer keys */ + totaluse += numusehash(t, nums, &nasize); /* count keys in hash part */ + /* count extra key */ + nasize += countint(ek, nums); + totaluse++; + /* compute new size for array part */ + na = computesizes(nums, &nasize); + /* resize the table to new computed sizes */ + luaH_resize(L, t, nasize, totaluse - na); +} + + + +/* +** }============================================================= +*/ + + +Table *luaH_new (lua_State *L) { + Table *t = &luaC_newobj(L, LUA_TTABLE, sizeof(Table), NULL, 0)->h; + t->metatable = NULL; + t->flags = cast_byte(~0); + t->array = NULL; + t->sizearray = 0; + setnodevector(L, t, 0); + return t; +} + + +void luaH_free (lua_State *L, Table *t) { + if (!isdummy(t->node)) + luaM_freearray(L, t->node, cast(size_t, sizenode(t))); + luaM_freearray(L, t->array, t->sizearray); + luaM_free(L, t); +} + + +static Node *getfreepos (Table *t) { + while (t->lastfree > t->node) { + t->lastfree--; + if (ttisnil(gkey(t->lastfree))) + return t->lastfree; + } + return NULL; /* could not find a free place */ +} + + + +/* +** inserts a new key into a hash table; first, check whether key's main +** position is free. If not, check whether colliding node is in its main +** position or not: if it is not, move colliding node to an empty place and +** put new key in its main position; otherwise (colliding node is in its main +** position), new key goes to an empty position. +*/ +TValue *luaH_newkey (lua_State *L, Table *t, const TValue *key) { + Node *mp; + if (ttisnil(key)) luaG_runerror(L, "table index is nil"); + else if (ttisnumber(key) && luai_numisnan(L, nvalue(key))) + luaG_runerror(L, "table index is NaN"); + mp = mainposition(t, key); + if (!ttisnil(gval(mp)) || isdummy(mp)) { /* main position is taken? */ + Node *othern; + Node *n = getfreepos(t); /* get a free place */ + if (n == NULL) { /* cannot find a free place? */ + rehash(L, t, key); /* grow table */ + /* whatever called 'newkey' take care of TM cache and GC barrier */ + return luaH_set(L, t, key); /* insert key into grown table */ + } + lua_assert(!isdummy(n)); + othern = mainposition(t, gkey(mp)); + if (othern != mp) { /* is colliding node out of its main position? */ + /* yes; move colliding node into free position */ + while (gnext(othern) != mp) othern = gnext(othern); /* find previous */ + gnext(othern) = n; /* redo the chain with `n' in place of `mp' */ + *n = *mp; /* copy colliding node into free pos. (mp->next also goes) */ + gnext(mp) = NULL; /* now `mp' is free */ + setnilvalue(gval(mp)); + } + else { /* colliding node is in its own main position */ + /* new node will go into free position */ + gnext(n) = gnext(mp); /* chain new position */ + gnext(mp) = n; + mp = n; + } + } + setobj2t(L, gkey(mp), key); + luaC_barrierback(L, obj2gco(t), key); + lua_assert(ttisnil(gval(mp))); + return gval(mp); +} + + +/* +** search function for integers +*/ +const TValue *luaH_getint (Table *t, int key) { + /* (1 <= key && key <= t->sizearray) */ + if (cast(unsigned int, key-1) < cast(unsigned int, t->sizearray)) + return &t->array[key-1]; + else { + lua_Number nk = cast_num(key); + Node *n = hashnum(t, nk); + do { /* check whether `key' is somewhere in the chain */ + if (ttisnumber(gkey(n)) && luai_numeq(nvalue(gkey(n)), nk)) + return gval(n); /* that's it */ + else n = gnext(n); + } while (n); + return luaO_nilobject; + } +} + + +/* +** search function for short strings +*/ +const TValue *luaH_getstr (Table *t, TString *key) { + Node *n = hashstr(t, key); + lua_assert(key->tsv.tt == LUA_TSHRSTR); + do { /* check whether `key' is somewhere in the chain */ + if (ttisshrstring(gkey(n)) && eqshrstr(rawtsvalue(gkey(n)), key)) + return gval(n); /* that's it */ + else n = gnext(n); + } while (n); + return luaO_nilobject; +} + + +/* +** main search function +*/ +const TValue *luaH_get (Table *t, const TValue *key) { + switch (ttype(key)) { + case LUA_TSHRSTR: return luaH_getstr(t, rawtsvalue(key)); + case LUA_TNIL: return luaO_nilobject; + case LUA_TNUMBER: { + int k; + lua_Number n = nvalue(key); + lua_number2int(k, n); + if (luai_numeq(cast_num(k), n)) /* index is int? */ + return luaH_getint(t, k); /* use specialized version */ + /* else go through */ + } + default: { + Node *n = mainposition(t, key); + do { /* check whether `key' is somewhere in the chain */ + if (luaV_rawequalobj(gkey(n), key)) + return gval(n); /* that's it */ + else n = gnext(n); + } while (n); + return luaO_nilobject; + } + } +} + + +/* +** beware: when using this function you probably need to check a GC +** barrier and invalidate the TM cache. +*/ +TValue *luaH_set (lua_State *L, Table *t, const TValue *key) { + const TValue *p = luaH_get(t, key); + if (p != luaO_nilobject) + return cast(TValue *, p); + else return luaH_newkey(L, t, key); +} + + +void luaH_setint (lua_State *L, Table *t, int key, TValue *value) { + const TValue *p = luaH_getint(t, key); + TValue *cell; + if (p != luaO_nilobject) + cell = cast(TValue *, p); + else { + TValue k; + setnvalue(&k, cast_num(key)); + cell = luaH_newkey(L, t, &k); + } + setobj2t(L, cell, value); +} + + +static int unbound_search (Table *t, unsigned int j) { + unsigned int i = j; /* i is zero or a present index */ + j++; + /* find `i' and `j' such that i is present and j is not */ + while (!ttisnil(luaH_getint(t, j))) { + i = j; + j *= 2; + if (j > cast(unsigned int, MAX_INT)) { /* overflow? */ + /* table was built with bad purposes: resort to linear search */ + i = 1; + while (!ttisnil(luaH_getint(t, i))) i++; + return i - 1; + } + } + /* now do a binary search between them */ + while (j - i > 1) { + unsigned int m = (i+j)/2; + if (ttisnil(luaH_getint(t, m))) j = m; + else i = m; + } + return i; +} + + +/* +** Try to find a boundary in table `t'. A `boundary' is an integer index +** such that t[i] is non-nil and t[i+1] is nil (and 0 if t[1] is nil). +*/ +int luaH_getn (Table *t) { + unsigned int j = t->sizearray; + if (j > 0 && ttisnil(&t->array[j - 1])) { + /* there is a boundary in the array part: (binary) search for it */ + unsigned int i = 0; + while (j - i > 1) { + unsigned int m = (i+j)/2; + if (ttisnil(&t->array[m - 1])) j = m; + else i = m; + } + return i; + } + /* else must find a boundary in hash part */ + else if (isdummy(t->node)) /* hash part is empty? */ + return j; /* that is easy... */ + else return unbound_search(t, j); +} + + + +#if defined(LUA_DEBUG) + +Node *luaH_mainposition (const Table *t, const TValue *key) { + return mainposition(t, key); +} + +int luaH_isdummy (Node *n) { return isdummy(n); } + +#endif diff --git a/liblua/ltable.h b/liblua/ltable.h new file mode 100644 index 00000000..2f6f5c2d --- /dev/null +++ b/liblua/ltable.h @@ -0,0 +1,41 @@ +/* +** $Id: ltable.h,v 2.16 2011/08/17 20:26:47 roberto Exp $ +** Lua tables (hash) +** See Copyright Notice in lua.h +*/ + +#ifndef ltable_h +#define ltable_h + +#include "lobject.h" + + +#define gnode(t,i) (&(t)->node[i]) +#define gkey(n) (&(n)->i_key.tvk) +#define gval(n) (&(n)->i_val) +#define gnext(n) ((n)->i_key.nk.next) + +#define invalidateTMcache(t) ((t)->flags = 0) + + +LUAI_FUNC const TValue *luaH_getint (Table *t, int key); +LUAI_FUNC void luaH_setint (lua_State *L, Table *t, int key, TValue *value); +LUAI_FUNC const TValue *luaH_getstr (Table *t, TString *key); +LUAI_FUNC const TValue *luaH_get (Table *t, const TValue *key); +LUAI_FUNC TValue *luaH_newkey (lua_State *L, Table *t, const TValue *key); +LUAI_FUNC TValue *luaH_set (lua_State *L, Table *t, const TValue *key); +LUAI_FUNC Table *luaH_new (lua_State *L); +LUAI_FUNC void luaH_resize (lua_State *L, Table *t, int nasize, int nhsize); +LUAI_FUNC void luaH_resizearray (lua_State *L, Table *t, int nasize); +LUAI_FUNC void luaH_free (lua_State *L, Table *t); +LUAI_FUNC int luaH_next (lua_State *L, Table *t, StkId key); +LUAI_FUNC int luaH_getn (Table *t); + + +#if defined(LUA_DEBUG) +LUAI_FUNC Node *luaH_mainposition (const Table *t, const TValue *key); +LUAI_FUNC int luaH_isdummy (Node *n); +#endif + + +#endif diff --git a/liblua/ltablib.c b/liblua/ltablib.c new file mode 100644 index 00000000..ad798b4e --- /dev/null +++ b/liblua/ltablib.c @@ -0,0 +1,283 @@ +/* +** $Id: ltablib.c,v 1.65 2013/03/07 18:17:24 roberto Exp $ +** Library for Table Manipulation +** See Copyright Notice in lua.h +*/ + + +#include + +#define ltablib_c +#define LUA_LIB + +#include "lua.h" + +#include "lauxlib.h" +#include "lualib.h" + + +#define aux_getn(L,n) (luaL_checktype(L, n, LUA_TTABLE), luaL_len(L, n)) + + + +#if defined(LUA_COMPAT_MAXN) +static int maxn (lua_State *L) { + lua_Number max = 0; + luaL_checktype(L, 1, LUA_TTABLE); + lua_pushnil(L); /* first key */ + while (lua_next(L, 1)) { + lua_pop(L, 1); /* remove value */ + if (lua_type(L, -1) == LUA_TNUMBER) { + lua_Number v = lua_tonumber(L, -1); + if (v > max) max = v; + } + } + lua_pushnumber(L, max); + return 1; +} +#endif + + +static int tinsert (lua_State *L) { + int e = aux_getn(L, 1) + 1; /* first empty element */ + int pos; /* where to insert new element */ + switch (lua_gettop(L)) { + case 2: { /* called with only 2 arguments */ + pos = e; /* insert new element at the end */ + break; + } + case 3: { + int i; + pos = luaL_checkint(L, 2); /* 2nd argument is the position */ + luaL_argcheck(L, 1 <= pos && pos <= e, 2, "position out of bounds"); + for (i = e; i > pos; i--) { /* move up elements */ + lua_rawgeti(L, 1, i-1); + lua_rawseti(L, 1, i); /* t[i] = t[i-1] */ + } + break; + } + default: { + return luaL_error(L, "wrong number of arguments to " LUA_QL("insert")); + } + } + lua_rawseti(L, 1, pos); /* t[pos] = v */ + return 0; +} + + +static int tremove (lua_State *L) { + int size = aux_getn(L, 1); + int pos = luaL_optint(L, 2, size); + if (pos != size) /* validate 'pos' if given */ + luaL_argcheck(L, 1 <= pos && pos <= size + 1, 1, "position out of bounds"); + lua_rawgeti(L, 1, pos); /* result = t[pos] */ + for ( ; pos < size; pos++) { + lua_rawgeti(L, 1, pos+1); + lua_rawseti(L, 1, pos); /* t[pos] = t[pos+1] */ + } + lua_pushnil(L); + lua_rawseti(L, 1, pos); /* t[pos] = nil */ + return 1; +} + + +static void addfield (lua_State *L, luaL_Buffer *b, int i) { + lua_rawgeti(L, 1, i); + if (!lua_isstring(L, -1)) + luaL_error(L, "invalid value (%s) at index %d in table for " + LUA_QL("concat"), luaL_typename(L, -1), i); + luaL_addvalue(b); +} + + +static int tconcat (lua_State *L) { + luaL_Buffer b; + size_t lsep; + int i, last; + const char *sep = luaL_optlstring(L, 2, "", &lsep); + luaL_checktype(L, 1, LUA_TTABLE); + i = luaL_optint(L, 3, 1); + last = luaL_opt(L, luaL_checkint, 4, luaL_len(L, 1)); + luaL_buffinit(L, &b); + for (; i < last; i++) { + addfield(L, &b, i); + luaL_addlstring(&b, sep, lsep); + } + if (i == last) /* add last value (if interval was not empty) */ + addfield(L, &b, i); + luaL_pushresult(&b); + return 1; +} + + +/* +** {====================================================== +** Pack/unpack +** ======================================================= +*/ + +static int pack (lua_State *L) { + int n = lua_gettop(L); /* number of elements to pack */ + lua_createtable(L, n, 1); /* create result table */ + lua_pushinteger(L, n); + lua_setfield(L, -2, "n"); /* t.n = number of elements */ + if (n > 0) { /* at least one element? */ + int i; + lua_pushvalue(L, 1); + lua_rawseti(L, -2, 1); /* insert first element */ + lua_replace(L, 1); /* move table into index 1 */ + for (i = n; i >= 2; i--) /* assign other elements */ + lua_rawseti(L, 1, i); + } + return 1; /* return table */ +} + + +static int unpack (lua_State *L) { + int i, e, n; + luaL_checktype(L, 1, LUA_TTABLE); + i = luaL_optint(L, 2, 1); + e = luaL_opt(L, luaL_checkint, 3, luaL_len(L, 1)); + if (i > e) return 0; /* empty range */ + n = e - i + 1; /* number of elements */ + if (n <= 0 || !lua_checkstack(L, n)) /* n <= 0 means arith. overflow */ + return luaL_error(L, "too many results to unpack"); + lua_rawgeti(L, 1, i); /* push arg[i] (avoiding overflow problems) */ + while (i++ < e) /* push arg[i + 1...e] */ + lua_rawgeti(L, 1, i); + return n; +} + +/* }====================================================== */ + + + +/* +** {====================================================== +** Quicksort +** (based on `Algorithms in MODULA-3', Robert Sedgewick; +** Addison-Wesley, 1993.) +** ======================================================= +*/ + + +static void set2 (lua_State *L, int i, int j) { + lua_rawseti(L, 1, i); + lua_rawseti(L, 1, j); +} + +static int sort_comp (lua_State *L, int a, int b) { + if (!lua_isnil(L, 2)) { /* function? */ + int res; + lua_pushvalue(L, 2); + lua_pushvalue(L, a-1); /* -1 to compensate function */ + lua_pushvalue(L, b-2); /* -2 to compensate function and `a' */ + lua_call(L, 2, 1); + res = lua_toboolean(L, -1); + lua_pop(L, 1); + return res; + } + else /* a < b? */ + return lua_compare(L, a, b, LUA_OPLT); +} + +static void auxsort (lua_State *L, int l, int u) { + while (l < u) { /* for tail recursion */ + int i, j; + /* sort elements a[l], a[(l+u)/2] and a[u] */ + lua_rawgeti(L, 1, l); + lua_rawgeti(L, 1, u); + if (sort_comp(L, -1, -2)) /* a[u] < a[l]? */ + set2(L, l, u); /* swap a[l] - a[u] */ + else + lua_pop(L, 2); + if (u-l == 1) break; /* only 2 elements */ + i = (l+u)/2; + lua_rawgeti(L, 1, i); + lua_rawgeti(L, 1, l); + if (sort_comp(L, -2, -1)) /* a[i]= P */ + while (lua_rawgeti(L, 1, ++i), sort_comp(L, -1, -2)) { + if (i>=u) luaL_error(L, "invalid order function for sorting"); + lua_pop(L, 1); /* remove a[i] */ + } + /* repeat --j until a[j] <= P */ + while (lua_rawgeti(L, 1, --j), sort_comp(L, -3, -1)) { + if (j<=l) luaL_error(L, "invalid order function for sorting"); + lua_pop(L, 1); /* remove a[j] */ + } + if (j + +#define ltm_c +#define LUA_CORE + +#include "lua.h" + +#include "lobject.h" +#include "lstate.h" +#include "lstring.h" +#include "ltable.h" +#include "ltm.h" + + +static const char udatatypename[] = "userdata"; + +LUAI_DDEF const char *const luaT_typenames_[LUA_TOTALTAGS] = { + "no value", + "nil", "boolean", udatatypename, "number", + "string", "table", "function", udatatypename, "thread", + "proto", "upval" /* these last two cases are used for tests only */ +}; + + +void luaT_init (lua_State *L) { + static const char *const luaT_eventname[] = { /* ORDER TM */ + "__index", "__newindex", + "__gc", "__mode", "__len", "__eq", + "__add", "__sub", "__mul", "__div", "__mod", + "__pow", "__unm", "__lt", "__le", + "__concat", "__call" + }; + int i; + for (i=0; itmname[i] = luaS_new(L, luaT_eventname[i]); + luaS_fix(G(L)->tmname[i]); /* never collect these names */ + } +} + + +/* +** function to be used with macro "fasttm": optimized for absence of +** tag methods +*/ +const TValue *luaT_gettm (Table *events, TMS event, TString *ename) { + const TValue *tm = luaH_getstr(events, ename); + lua_assert(event <= TM_EQ); + if (ttisnil(tm)) { /* no tag method? */ + events->flags |= cast_byte(1u<metatable; + break; + case LUA_TUSERDATA: + mt = uvalue(o)->metatable; + break; + default: + mt = G(L)->mt[ttypenv(o)]; + } + return (mt ? luaH_getstr(mt, G(L)->tmname[event]) : luaO_nilobject); +} + diff --git a/liblua/ltm.h b/liblua/ltm.h new file mode 100644 index 00000000..89bdc19a --- /dev/null +++ b/liblua/ltm.h @@ -0,0 +1,57 @@ +/* +** $Id: ltm.h,v 2.11 2011/02/28 17:32:10 roberto Exp $ +** Tag methods +** See Copyright Notice in lua.h +*/ + +#ifndef ltm_h +#define ltm_h + + +#include "lobject.h" + + +/* +* WARNING: if you change the order of this enumeration, +* grep "ORDER TM" +*/ +typedef enum { + TM_INDEX, + TM_NEWINDEX, + TM_GC, + TM_MODE, + TM_LEN, + TM_EQ, /* last tag method with `fast' access */ + TM_ADD, + TM_SUB, + TM_MUL, + TM_DIV, + TM_MOD, + TM_POW, + TM_UNM, + TM_LT, + TM_LE, + TM_CONCAT, + TM_CALL, + TM_N /* number of elements in the enum */ +} TMS; + + + +#define gfasttm(g,et,e) ((et) == NULL ? NULL : \ + ((et)->flags & (1u<<(e))) ? NULL : luaT_gettm(et, e, (g)->tmname[e])) + +#define fasttm(l,et,e) gfasttm(G(l), et, e) + +#define ttypename(x) luaT_typenames_[(x) + 1] +#define objtypename(x) ttypename(ttypenv(x)) + +LUAI_DDEC const char *const luaT_typenames_[LUA_TOTALTAGS]; + + +LUAI_FUNC const TValue *luaT_gettm (Table *events, TMS event, TString *ename); +LUAI_FUNC const TValue *luaT_gettmbyobj (lua_State *L, const TValue *o, + TMS event); +LUAI_FUNC void luaT_init (lua_State *L); + +#endif diff --git a/liblua/lua b/liblua/lua new file mode 100755 index 0000000000000000000000000000000000000000..a2f5de90f72a36d72bceeca4e42bfc57ac76fc1d GIT binary patch literal 227685 zcmc${dwdi{);Hdh1Q-H11F{+wbznzKL^MIv#2Yh7Ch38R1|h(Tn1ql(B#@Z&K#<$u zBr9zjjdymR-4%7+$7gS{UJ$cxn1D$@R}HWzE2~6Q>}Es)Xox7}_dQkBnGQ>y-@flZ z@9^n#pHsI}r%s)7s_JyJ))&Z$v)Lr`7bo2&5p=c3!%+OMByIRMj=}WDBc)42@%J+6 z5@|5tK@3MJl;-Jo?-5m-cRNd!q92gYZoe=~D&7-=QAsGdYzMHfgN*&&yd z^g!oD38~MIO^P47&i+L4x{a>l+kGA>fBiUD^I%7UYt6K)K8=jezuO)^$Ze0jbmi3Y z-xWxIxhc)v6PJ<}svl)rH+^gpI&YH(7Y&Y+Qs*>Et`%`bQs~amNPGIM#G!E`pGdF6 zaQX(@r@F53kNZ_Z$7}VYJs^S6LwEX>;wocLlC%)_MYzgwRR~nT7zpXt_N_@kNS<~r3VSXPsQ~Rt_EC>;(83%U z7Wd!az7f}RxSq#FzZdvTdQse868HbX{SV@qZhyq}CtQEV^)jwaxL(2a8m`xI(QgZ` zCR~5R)r>2Gs|D9KT-$NIjf;LeaP7qPF0Q}hdLLH@u3fnPf$KwDAK}`E>z}y(h3ivX z^gDp76W3?B4&wS87yZ7(rQuX%*@2Gg_!ucwTM#yA_~7S|wL8&x#a*y@>zFGxzixkb;@meIj-BT?Ix6F{E!VvE z#j@r3```QgH|xD8(=IJNwQu&fA0K+a+4Ab8sl%o$EGTvk|I@09#<$kFezLmsz5g4p<4lP`UE%((i}!V^Ett(Y`_{}IR1{dv#jRzACC>|=TB zhm4-G_^u;~Yx6#w@cA!y-26)WB}K3AYrQJtxHhKz^-CW5a!>1}Irn`s>cF$xAH3nv zZ?`u-^wI0aGly2d7nExAoEU6F$-Q=e_;-(pUB^y7ay)nnyk3y5Z#J_mDTeCTHk3^Nc6w-RAed zH|VL~xf5@H>SuRmwgpQ|7hmuG?6dtD+gvNJNV=$^^O0xX`uRow@F4$@6_1<<4&S|V z&Z8?Pzn;5d^5>&3AC{=~9x z{8_%eUym4l@HZ2$OU>z+1AaY}IA!=v&kP$}>zL9$>7@r3WUW8x&&t}bKk$>`bC0!V zyubDBZ7&TUQ!{eX-B)hy{OI+2*Zy*qy#AMI{*sq>PhYX=)|bD0@ArTE-7SmT%isB6 z*s4|2+c!-3`1Xm#cPxK9dg~vZw;$d1@#W`TI%(p6|IB%5-nf?|FD@RM^`ST8nq})N zH{Y{=!<8QwJoAEn_btORmKklfg}<&%f~cPJw?9sjMx7%iH~@Zb{JHb5gxsI2p6>_1 z%V_gl`7a)NZv0l{cb$XI*9NHHGXVX80qAcZpq`Bb)DsyX|I`8c_0<6RNspY152X9g zg%1u;&+Gx{{O17q?;Zdj9-yA>1K^tmz&}0!e#rp+nlb=AmkfY^Xn^`}8=(F<1K>%= zpNr4`11IEM_{jt0|J49=&Kw~Bg9GHhXMldq7@(e;29W3L2B<%Afcp0gkUw*Pb}t^F zo~s6+r(l5k$u~L|pZ_#K{qGM@&oI>E!gcoVq5{l(f0iiz-^dpMrPn|`+q;`kzw|3;3M zqRjspAvMnA_0xKXej7#p#sJ3`a513ubS>*n7IOfouIR59>-rH z@J*tg(9d{1F9`hof*wh<>lb*Z=vUE$yq>FUJmE33T|cjM8q|il~45JGC&jf!q&gA*YZ=>HWqW-SCJPbD1``;w;eo5K9 zU)xzK*06%kjv}7FQQ+5z{%%~z@hJko&L&ACrHiEG6Z07croj$%p58{_!jodpn|CPbts8QsDn2`0o_*^HYI;RphS{ z^^X?#I6+UR7+X|2|72;@i5eEkuXWrU*zNU{7T@xV!Wzm^ZX?Ozug?i85~b`k$z_czC*}= z6-P_I5crK^yq*&HKMVTv#rT3P>^D~AcM5*G1^#Cuzf16;NZ?lqzNMbUw|OQ#(|NyW z{XoAofp5Gplfhq#aS5Apb+?D%x3IsG^lQN%DTminB=C#HIC{>a|3M*FRYyH6=Nq7p zelG}o=e-^VoBUrV>gf`4`y@-1q?2MCBVztuDe%(;{gTi>ro8PGbau|-basmT3n8~o zi(Cn`bb%=kLY}9JggXSCo925MW{tqVX!7R-$2$dng=p6!?2bv#j{=`B>`S`HzeUv3 zF_qIfOW>~-?RE(JV#@g)f7`FZJ)6Wl4U7DbiSgPb^8ZxePnzxC z%IW!+n7=J%{#hQD)AWBLV!T{pKK?}1bCHmfPBC7e2>dj`=hWl8o?Qa}cQIZ?!k(JG z>yxOT#>;gvA1`#1{k|4_aEkn<9R4@Gv#FZkmTdNoxf>=SsWunVUCe}M7f zJZZFO*R1F7qFnDka&^;`1OO51nNmma|#pA0_H367yWm5k%-elf;NKGX{49?Dy}*AZ@Y1UsKVIN- z1)n`rJPcz9{HG>8LOvY=KTXJaqnH=w{QbMo4^FZEDiZnU3Vv=};9;0$0{?@kf0OWs zTLk_Kb3O`tWX_AdqW+GBydHFi{azOQPo2j5^`5~0Q}j3WE{gMu z?h^J62Ufx2AmQBB>ZjQbpxLsaPpqI!VHxMFgg$ zN+?$*m6VoONX5v>(xsaFsudz)K?Og=UQkg|QCU+eEvTqju>^lBt4f#RR$5(+mXWWz zw0HrIzDoto{+W4&3red6oip>YDk_(j&Mcl^Q7RQu+Bs9qI;7$S3knyZhn3YUsO}P8 zX<1oC5S?4NL@8fVT39WW)|M+$O{r2*SyGI8YpRQvE|AI?VKqv1b;+V?@DA-Rymv`e zVacM!V8g!#szG&C^Q#ww zuheTmHC60ZMwCcP7Go@yfY(HapbdExj7E7)v7)Sy%1SHCq_TyjN(~jRKpnxQfJ%6g z(vr%h%UG=nQ4E$YtpwdA#Y%Z4Cjph0RFoE1BS|VmkI^AyEUT(6U#gVxt|<#DgNjsE zgLA>k8zv*Qyr!}wBcrgarlfdj8S6+D2;qZRrj(+?EL(}PqN=oTKD8%-q*6u+Mh=}` zLER!bV!f^sMVD8XE2V@jUI4}|Ed~P$3yDuvD;OmU%F8%g&{N{wlEsWk%95(G@`_SR zn@VM{s;ab_wOm-p=};;wDwhi!`nha=une`=SUSqamum6fQOHhz^#P zV6-7U3G9zb8EfkLIaxTJKx z*@jX%zp@g8zm!*2g(*;7S`(~LYRd0twFU|yb`?uX(H+({qcOOYguQeDs~()LDXnH5 zW;sAcS#W6yv;omtT)mJph(QDnSF(0p0=$yCn@R_YHTSc(4Ir;A_ zv-C*}5LXozO$9|IcU)K?p7h{=K|5^D>o{Wx04X9Lv-F@zAZnoBBSgiPL81+BcMgj7;&io*qnNoHaB zQj8YsBRq%L{A7b(yfjv2Kee-h<`JLM7{l1KAks?j3qtmY5>lQ#lSK=nbqjTD9+5D` zW+tkzjAx(jP%2~1FqtBkt54ww^;F2(C2lk8$TSTPQ>vN5p~LVYh}k>>_OVqy+|1s?IbSt4Y$f6YM95SD;nT*yd2^q<$Up|6Tb48{gI`Phg$ zmK4`8X$nA4?+ccjRF>BWYH|bq%&fvm*G#(RddYlFON%{D?t8rMn%Hyf>Bd+(EfwMr zHOl`b;7&25gU-Sbp8gH)hbK$|i#(+}zs$cpjh9N0h9H&djhE~q-%wT}mfLJ$D9aU( z_*7n&N>Lm1k1$wzu_v?qP*5KStnL5mU;KYuYT%p$r~Kd1^#8gP#qruCTDv-Nxo`z9 zF2~AtsPs?lFVK%ucy@Y%C4GpLh_xw|r{80bJ&l!aqVy%o6Yfa{+odi6D;H7yL!=)B zJi5Gm1VuIv!9tw!U&!D=(ntYwdg57olzu)-kCQGD3-_L*^MU2D(UaK||6`v2(Eh{| z7QA^LNO*Hko|4UT55jLGg!mcPmB_hEqIy-<}cNP$I`y!GocFKiPsOn#^Cm1rG-I{pMKk*qZ436%&S?$bvWbtSEWC1#ij>;TtXZk%SPx4Hmq)mrF?-E%?4Y5a3_3;LS4>%D>5iH}{qa zzr}*TfDqyrvEa=;b4uD_!JB)ngzvE6FCv8a?X%#`Js(QywBRo>GvlsX@aCQ#C3jiy zms;}oSn%c^EK5EXlUwtQfbez;-o-NVKTZpNtOcKB!H=`xT^9ULE%;;$-fh9BTJTp` z@aY!(cnjWR!Cz^?%NBgH1)p!hr&#cFEcmM|_#z8_f(5_Gg1_2=ud?7LTJW_N{52MQ z$b!Gtf?sdJr&{oh7JQlozrli^WWjH=;IFgbU$Wq@x8OHf@HbfSTP*k+E%=B9pKihL zu;4Q+_znyHCJTO_1%I;z-)X_$V!`Vc{H+#zmj!>D1>a-An|r4$`FKqJJ(m1-3*KwN zJ1zK33qHw$&$8fM7JRk^pKQVVEcjFlKF5Mjx8QRvc#j1yTkx_4@3-LdE%>Px{2U8@ zngw5E!3Qk(MHYOX1z%;s-)_OzTJZT6e8_^IZo#j&;LS5HN^Z2^XIS!Yu;6D}@Ea}o z0t@~n3x1XbzsZ81ZNYD`;D2VpM=bceEchK3ym@v;$sHE_-Io0OEckgAe5VC}j|Hz= z@P!t9mjz#B!S`73#TL9I&eO<8;4^_I%Hgl=`m?~w;kWJE@s7^*nQx4fdauaFU&rMh zJQ2KzG8>(}_+4=m!Q}cF9SojCa2&xA246)mxjM!s29G0{TpVK~gD)nSTpOd2!J`N! zm&OP&IFVo?)2L!_9Kkr{kc=V*pV|zVTpA;v!N&>5lk+F;bicg1e2>^NDQ7zFu4du*JJc9SojC@Hm1a48DqBasiA@3?4@?nSNsqM1e57DTnzr0U^3Z;lfk2K)CKGB%44z6bnNFkY2R8l$dkF4i@J$4hsWdtmJc(d3 zkw%2UR}oC6(b&Y`aRie|G&VB$VuHyO8jTDdMKGB_BgEiDf^!M3VsIS6Wb%w62A_Hj zFqt|dpTWloCKG3P7<`yuGHpgGgAWo+Ce3g$_+x^}lo?J2?T;gg2`kVn;85&!DOn8jST)J!DOP0Mg~7lFqtMJ z#NdYrCX-}TG57(3=MY@P;QI+C(`4i`xSC)xNrs2P_YzE|$Vg@Ie1gdY87>CjMKGBj z!wI-RR`<@3)gSU@b%s;_bPEiD>XRPw*u(Gl%Ibme4v%AVMD^L_aF)}lFNGX=XZh9l zy#;>tyJo7@JJYNF1GSuf6Cf34G~Q0v%6n^VNUhcrr3{n`85~x%0etZ|6MF?ar`QiYib49etdZ=rtPOhV<#AMp64%?o z40hv|D`D6RyXtpdDodB$~RG7xqf$F`GcZ-=+^14K-mXJVvN4j*P#3J+6LVQl2W`zHH9F9ZY{3Ld9k3YFPSaPo_uO%4O-&xkO3Z z_Yfr`TRqIhEn7WA0~~?XOY3GCAzS)$l!*!EGiV}P?Uc2<-5A6Qw= zZ!asmrjK5Xb6U4vin8d=H=D*uZxSb($f0Sj0v$B$#?!D@oPRUYFoAwZ+nKgoUk4<} zXr2hZq($Z$W6!{i=5jNl9u+l_QDS`EDnpKSFJtG3dy%xY6J_|6q1N>AoYQw8iMI!G z%=ua04aTtvuUyqU9p&^5;8xmhHd&79!{FL9-3&B|x+8mA^eQ&5n{T6>OIc1f6KUEX zz{G00DV7)WTVHvyw^vN7?UZL2Trs(Rzmh{7{!KU7QXdJXV5TaALpR^rsN5#2pHjXW znqA1U_&Z3#JT~_*gB#_B?D*bLdSdXsHcZAHjdSOvMSw?VgnTs2ur=or3F=XZ+b5_c zy2Uykke@D+9}=0Q`fl|^aJ0IQ4I&@T@Y_ice6C%f1@--)7ZY?p3Di;6Q@!VWbd#wL zutdA{*q^~wa0atYKTYC|e56No*LlQ8p|p8h~pSHNuv`}A6+qq)6BH= ze+KpA2R(>AU27FD@+#D}xyHw!Jtn{20%-8J21AGn$gB`$0d3-$KcUO*gHGT^Khk}S zl560HGl?X!o`d^UA92)C=y+^=)PsE)HbKeC+GscW_vRyP$l9n}#&8?dbG+KBOzq2h z1y~M2an!FuWqnu&nhT%qb<{loEHr-IZ$J#^(P;F-ScuLGJtsHJblchRQ4=??mVuGO zrxKR^LT*r;KWu#pB!JH+eivNdX9wnCp~1Vh2OOf_T!^OF%tAfQG|lvKNId~;%>Rx8 z&G8_EnkmGH8;LXmedC?h-2|A~m^7M{>H)PCa#KpYI^w8*9hFeYR_F(`_Q;EXn|_8? zn$ZZW^W9!Fu!M2zfc_2E8GYQCj;5)sin0w=kQ#0|xv}~dD*_^aCMsl@W+FqM2z7`u zkget#)QK7M2kMP>>li3~66mX;dyUIc$mFAX03r<@Ncu5oL7L&eIF2lfkOdV%)m??= zWo^Xge}IOfd@M6lNcyuh-L+eHAW1(Tf*nvNzJ_NKRI<aT@Pmo+#y)YAzN+EDsLM}03Ar|sEpxESnCjD%Zp z1Sq%-@K6|mOe;G!=i5T3${lt0U<4hH?n7$ml+RH&g+Oj^9glpBPK8dDa-qvB>GroA zibsE=zeh*3TYtpOYVf9NcV92*o6%V$9zddg@wZ^+<}BMS6^^>@1iUF#O2%&oxbLVt z1Q_|=Kt4tl#$zQf`dcb`-~_8?1D?_13f!7DLi3wh^LbXn>#rdzx8H9k!+0?6dhhWT zLbrve*P&Breg}J4=BU3OvJk3`0}Fox3cwk9?N;)J+id=l_hl{nJvRC39!4Uuv~CYZ zo7)d9;2vGS(^3B;^7}}F>4PB09nL|~J@ED*jej`L1|`Vn(4!DS!hPf<93z{+TA;W7 z4h+zj9z_Rf@M_Rf(~Cfb(mjs4e}Vtx%OLOHA&->dYqV!v4zg(&iC9j)9~f^#j!iD< zkhPh6LH2G(-E2@Bx(Q_8jt8&WX8aVn`s8^~+W)}EXvG91e$^p=GLl25AUT&&LB^H` zK>^k4Lr21^-m^>8?`(&!3w^IkKz_ZX2a1|>P%jGgb?p- zmbFc2&QX5|^=g-^9*XX z+pZ_UWdYrGE-{H17?K#WYsL|1alS6$tYEB)J|%}&V}{pV4srqwrFLkCfC>*Abjsm~ z-5YMT$>G`_DR|7Mo@`2>MT2_4d-5Zn?P#`oCR<(Q9vyCr*Hce%A@OFkf{vs$H_9cr zWy7&dITkkJ0u8HLCE2zkufhFxpFQ+zH=-_oxZSR=gS(KI@m26^ZKgYkcud_J4#Nkr zQf~CA-}=>~zLf90C;x?Ux0LgvTsF)q`bQGx4Zm&EzXJ<=8D9tYHUB!FQ42+-(?_MI zYRY#~=(dT$3qosbQqVb7%l@v1&FS?RpR{gnEoQ~pq-=N*quKh(d-5Ofi1lO8qo8D> z@QyP9@tY0cNAI66Mo+^|zyZlpiKp z{0Qw(eN(8uyGX8?jFMhMveg(c3t$9L2kMG`y7gBeN!JexE%YErY5FgsGKd^Z9xDY|h=@C^8?=XAt)zYrbk4YifMTdODu@al4u@MWp7dxn$}e!30PD z#^|l@mbKZgHA!+wo7~cwAjiiw6{SETZq9Yej;w9l*PZz%6w_+Yx-+Dplzdr>dy}3Z zv9&G#o}e7|<$mX9d0OWuHq5yxt@b&$W@SAVXPts7aP6Y$ry+$3c6 zn07~-1sC;(w4FxHjm&StEwa6SH`TD_yPNa#*LF2j z_sS(uz-W94RU0KYOih9% zfC#mibky%&^PFRIZeqr^wZEVeRB#(Qgo3tHs9jb^D(CxEUd8s9|Hi7cz_cDU{r3~J z9_>*-Bqv$j>sNo&*I-V{+WG5FbM5ccX4uty`|7K@v+N$ljg;=pq4CNkerPKfc`{mR zch1m+;J8?OiK^2Y2_-9NwYxy9 zcDbH}e?7dp=njvhe?NgFHMm|%5#_){YFy8~*jbIonp4R?Z>InK1*{_r-NA43%#)JR$VHf)}3bINK< zo@V!H9(eT;XCMO$og9*mY}IQIeni_Dq|de4NwW3;#d^reF(OPRw>P8abCO z>s6# ziA3;=)%OOpUqH)3HY`N9`5UUbYTSMP)2={Di>%#}CaX7Tfi$~16*V3PksZ~a`_XaL z>DBT{>gR%7kE9-#wdGE}l>El2{|%JN;l<9r_Gmt#bF@C^t4-|aq@#KDFw~u8nJ$*M zt5Lq+`0@Uu012L~*-0AIM3r}w_C(P!>v-$?VMpX!NyRBckU8Ax*uDi;rdRZz*h_G7az^9p|c0eTBTE&tNC;+;N^y3r`(X&rCj0-M+VCnc^Ir);HGA(H-;%8&ANbus{0{J~$ySty z%f$x7xDO&^_8()h2Qui?)$S%*0L_e|U$G-YsfN#~W{)0`Tehebqn*GOR$JG(DA+r%mP!f6F=#q}> zi+=M_)bG->%=%%y71$i~AS7CtKCE&l*_Tvr6gk3W7;vhLEeT3 zHi>~m2f;22oUYRcO$i}yh}kRs4_I%ZkC-9h?=MiCX_4^vWkL8~aVVa2Vms;~4c52c z#r7{qUlJ{Gij!zLAAVh*ydgj519dKWyFLx|WAnMzE(fu#f?jv@tIuK|Am!x0e5WT7 zNz}xY@Tu|3eu7S#ECTgp6)}#z?!6uyYQ5RC_0$@J}@Qi|clv_k$|r`7ht z6X{P6(jk8m^3a5l!?{k%(AR&=f~(p@B|@Q@nHXL5-L+$mi!A?E5A3_z&1#4q5cXE+ zT5>3a+*~NDqunyxIJ{kvY#~ewRf)mT;A6l^#`P)Pjii- zPyho>2w2x+GMsGL_I-3jY&?+=(6D>a7RS~_H#{*n|6Ibx3=zy^LBXxnReod|twFRZ}6}6w+c%1GnFmA3%&}E>87E&Os~iHs z+&_M%3#yuOlaRE{HM4af+y6qZ9~NUCE4dghHytd}zV?LwGtwF|(dsVhR3DYb97Y}= zADSQfN!nJ`YLF#e4#VrdkufIbA5ZO4Gkdsy-cP?mtbYKJTUhaQ_<`5pfW_iiGv@U3 zu1z9nmCE>ogGCmP!2IG$sz|*W3)*xzC73978Y}&!{ zTl6K3f9JX9Kh38Rtfq63yyvO^jO4jyqXUxM&wo6(JnHpdQ;!y7#-;LkEjJW&>W&vc zgI3UmMX^@UgEg^VOK`V&64{*U&g}6hqh&3#tJ{N3p+vtn+0Ax?#t<`@9C87~B9;jx z?FBWGknclu6^TUjL&TMwbAHfz@HloznJ=KF3em>qE=+*_J#!LfIL{_P)`Aiv;1Z_L zXd?VO0o48+v;B|GY9Di-Z#`klNw22%+2jXXFt<$3^r?Yk&z;2`>eJao^>O7gzKR4@ zu!z`{BGOz;q`2JyU6CAYgYKi@irK@0v?I)Apk;a|?en4yZE8>bP9;Is?(H(Y_d&|| z@b^QMVm^y^%IY6?uvtu76=)<$oN|Ewa8co;tM@vUgWbNNa9LB8ONeV&Pm?u(j?>dY z2M*ClkEF_MBSS9$%c6gw{hL_%=gso_S^2#@E3cvz3d5`-`d3STn0~m>>_~MF+_tN+ z?ICM-cFF2=ux1*BWqKFeXB>+5*??X}<1VvZ9#Sjqo+PLv)Q`M<38o$aA7$3KH8I9d z+FeeIbZ3sUE9c2*e2|uzst$H+&h+#6p#tolKrNsAa0c6@VtYDvIexhld#uWkvhdn$ zNx3;~C+AAxSazPTB!b1XIl%anM1k#D7^3ug4CoKcUMQEU?_=i+lC2JR>mTS4hzVKg*jjdH(|}P-+Q|DK*YZ3Ys-+l;C98bo|dwMXA4zbl}XxUgj+P6iI-!Ie$-fzVWW!i;p~L}x zsqcbIvRuD2k9J9R$&PIJhj1`Y(>7Mq2M`tYV-}Huh3ZlLP4u)rqHYgD(tMbQMP1&| zDtDqyxr7JSU~KMor&8xV=)BC=W5}8m^VB|sa`t240#-nDXF)a-F%!XzZVxufw_uVm z0e+cHjQ^oVU(3W0KMQ>W{}D%XIm%!*C9(eWK=5}Vq=YEOk`#8^xbVt8e~tG1t?M1? zKMIHtvhbN<)Jv@}iR}R{AFFovy1%Q%H{i_m1_B()F&)w(=KMh4Fw4xyuSV74Dm5tZ}fJ%$60Rs-`IcSf#b{jNNS|qfx zU=TcO7GJN0X$_-3L4S>F*+xC1 zF|14`&z- z6N|re*7)J{?T0m!$d%!);0U%b{t*3U>tgQELCk2>;C~nozf7cfB&aUf-hN{##-S4H zn`Syl(jyvik-Q%46ZZ?GnTtWIEZ7e;JdBaccB-*~ z3d-4@NZo1U!2t_E63O}?PW64C+UgB|ZPV{T%h?n%eL&Wd^?X3S1|LL4$}9OIuO#9RM-rxL zqa#z*nP0l-foZ|P@Dmb(b|9H~%pt1as#T3C{NV#q{jVE?>E`K^}y zl)h;2(+Ix8(oH?l5VVoDKdK+Q0vxQ5_+j4b{aCow?_X2v*Yc9QZ$TaOMlWXb#oPTr z=T(`KM@h)ot7L>Dwv6p-ZV8k`agXR^OJ{kS*DaAX8Z$DPynW;W9iU|ApDMZD{LBV-`!}^DSfV z>agKsh!DxD+F{%TsE?oO$zJ#A)Ulb8x-Fm{!&Ys};q$O zcGQmq0SJbULl773;Cbg^2)3-@^`jd&i>HIqcwag-4O_`9xp$uB)SC+YfItu;Xgi9u zM9*9IIZ+%wGX!o-Uj>jt+NDM_tx4#f`Y}34Lth5UDPi23gYdNV5wwkCp%cH`@*tiZ z&$Kum- zPREnrj=^P2aO2FEHrDjL@PR-DX~uwtlL&El;59(HAZK(MFy8r(Cj=5enM0tW?M5 z<+bK%K927*T2@~y+m3D7h?0DRa2Fyaj0z^>@CJ z8EMs6YD>Wa?`SBB;DHdvK?;9^gK>{jamX1x!Q(hUpj7fFGJ2F_vYJ`T-M_{ev>8TW z%2<|lE7Rdj){<$l%MHu18N1d=wuc+J<3e!$1AErbU!P599{2a;1izrQy81rsErdef zR;$o_*QX0dZ>i3&lEg%t7$76@uC;43ynM#$QIU7EkgG_QQ&$u{e)^6Z`M zS3CUbNgghXm=i?ILY5ty2j6lVk7EsJQ)~0IG%q4=(vE}=;vi_SqwadRk9848-D2GR z4f%E+o);jKh2w(&BHFN^f#tx~Hj=UOI2uq}^VIj~tRZ><`0h*N@lbMjJB}9O>mo`) zSP$HiviuM>Y5g9d&bn@@qM8!l=Aw#d_Zj z1mdxFz3+NfWAM*tC!l`kQ%{p&!^8qr&7_I~YOnr88=va~aRA?U3ahg1X7Zo zt?FD+ikMvR2}FH>`oJgOxNxUuz3)cjS>`i`&N|AIcX)94)ELKuC(&md?CIlT>$5iBWU0+}gRRYXy<`+(QVIRRh7)563dj@Y z@?qRZHizrqcAslA=xz61jXHaq`7?Xt7_3g(gCrvz34ZMwV>^OQ%=KIV(JYAGL}2hv zKepBb>T)Lp-DWhfJQOEkOhO~L(O`-w*c)lGW8m6|OY|qE55X&^@!u${zC+G#Qp@4N z@GXdM^VxZDgfckl>HR392i0sL6N>TjQ_v_jo41jCa>M7dZ}}_gj{b2AmRnNvlPzSs zqaSWT2(1+TfIcvf7ihK&r(4UGVRUQSl1R5#w;(W)$`QAsFK!t^x8H0TOt)v4o{ctQ z<@zvRk7&8Iq;X+_@5F$m%eHN%u^y}>Hd7&e2->2spEQ`M92nlgT22p6oycaXIbF!k zLVDGl9=Rb0D~NC4YUeuj=^)gM_}AZtqN4U#fO%4eHy=O?sD2fyZSMFfd#3lWTQ(%?@5>dpW{l~4DPdo}8S_C^o2#8l3DyYSjO}X=2Q*)*tmVOQMWP8bz2WsNdqU1=3m)f+1iDT=9!S|n zx|w*KAWz7J#)rEmw2K~3?^e`9npy(n#RVs^&kCI<%|y+h;Ir^^v9vum+;oPDl19co9zj zHQ3XyJd8Vym)atNOh!_m6?AaZ)hMVhC2p!8MvwKaSNiR5C56ugC1(a>kU%# zC2kP&*!|EK9~1Q!e~9Qut5u{gM#~Mgc6Cz+l|X%XzomtQVRn*d{qjUvd%#YOgz>p* zo7wPF?B~CQ*ECn5J2WWjKQY(zoi~GCs3St@WG$@yZsP6exu_KJmUCq7 zI=NvQ{MH$EuWC?pw=N~Vx2Ek6txlAJBch1q@Fl{_$k?~$dX`S_$*J4q61;0Uv(?4+ z3;sp>1a`Q0+fXiJ-`aP{3!!~>J^UsXyLg?dCZFi3uL228*9m&wV3Twj zr)LIc*;o2+K`;n0s?X}byzXlnHpd&eIkI{SPEA?t7Hm^HkCs3;r7~#6^Oz9e0llL? zDnvqUm+3u-i!c;8{=^t7WYSOxY@4%pH|^d)!%$>PW|iX&)KR8p=4c`cW8K@-?so5N z?g^Xkv_jq>^$?B1^lYut<9K)^a^;nr4j`yg{WMSQ!E)43f$<2PKx`|;jo9_CCehmy zc#+zNqW~aQCwouso!StP>^|F!o@PTv&heR)LgzkelUe;cjRo zr)OxhJuv6%PEq*x+B=wnn2?)p!`^aF0>?IF4<3Y9s2!5y_Tw2{Ylhy+vJPW!+srjq zLROmXSq@1j=c?HY5#p*a69I|b9q2)LuIWFa0gNf)r_sv`A%`->mJyX1@5qkKT}15H z6pl_hyCKuY+Zr3*X0MNM8vGqCr{Wv3orx^TaeG(Ba?jeKbodmakujo71IO$g?az@O zfKvE@?bEUSIlei!?&~cmf@t_T7L#Acyo$6)9$rzd3a#}^%DrUf7-zIQ($&d$-*$#J6VP}NQvmQwjQrP_mxEX% z>W$bRWABgZ^gHjp~bA&z=aYQcp0P_V~BNVIz@txs>A~f~TOL0N$!{=cJcww@$l9_@b|5p9B2{iLJ z>jD!Nrt9QZ^PDx9LEiL$4X05kKw*0^dsQGeyc|O7v<~OCC(9*g=*m2V{*3G1W((fa zy$w?(eDLV{{Bf8t5dImplvWn5b@eK9y0^K432h#~Eqt&YavXlgj(olOXc61_8_0N& z@=%#dZw;s|ETVrLUk9ll1X9|eW${|tNNwhgb`~jUfX?@- zKd0R#IA2)h;9Y=}2)<9@SewY-aC)1E+^5rWb85rYlOW-e7q8-?10WaT4!Vix`f2Dt z)q`_Z4Du2LT+{S$JX(mqeJ?pLLv2PLFpbu)MczZ!^`91-*?~I)B zz2lJ{WW2p$@>THNkX#!`K_J}s36Ri?W2?ssJz!b-k?f%Zlr`i1wTD8hS4epcYn=4j z2?f&aURm0aGrAC0 zr)9YUpq;Jn>E-o+y4aPcu1+oUsik-bk|n;MZQ$C#c3+aW4GuFhfOBLSvfxmHs#t{Z zu&e0^uRBY&IqJ94NHbBRm#5iQ0_PXw6=yML?<3Ed;z>uM^g86{C>w}hj3#hsqh`6v zvehD2n`azi6t|J03aH84vfvyt)_TJPNustD2b+z2>|es029WRGz5g~TenV0L0@t^2+mEjS*1j{a`GBe8C$QWW|ge8)VN+Hw^Jy-|> zmQE|Wi=Zk7wsRtTTa2t4};3Wi?eO`lY@9tQ@@pkv$D}~ zj1S8g{D_`E!n!;99yj*G@Gd4J42#Dph<0SlfmnapdLC;M+O@R9EqB!6%M@@Qa~Nr= zFNfX(Bku{kD{J?`Luu}+_h8VD!nW#@QrVp~&Z!)O$xes#L&UMM`HfEh%O5-HI800H9r&OD7C|nYb;B+m z<;|}5`Sm+alAvXIa3CC6$B9sVwV`R_T-obO{JI2cK#Ebz#1pEQQBmN`USFEXg8Gl@ zOQ>pc>ZnU_+^BARDk;3gggwWOB6p$L{>yCZhaLfgmi(gKv`>7RB!(%1yX&@ZChXMTP*L(3e4Z3rlrL3DNoMo-01Bi84Ptliu@!>(qH z>GysBt*1!4V3JCn^{dfa7rGoKW!#A_S=uZ))yuk-0<&| zT;@+BGq`b_z2VK5$LPL3hf1SIIK)|r#t*agaqK(|?IweCG2i-C0fsZq>px*tm?v1j_SJs;?4dwYrWwk*gpOOpFF@z ztzRZY$CDq3qfUHE0$j$6fx%&3+D`aXUyCAsoH6BPe63(oVTp_-tnH9jTVoG@<L3kIbkixFuUFEfPdeVI+OAW&#B#+}?2Y zm&81f#^eG@OZ{}Jc8d#@*!8zX@vpMAU_KH84NGvSaZ>*g<`*B2Sd;CAwiXWD`qGWsBZu^FXP+b9&IJQH{qz0!3KH{@l(ASDOwFa+vKSK zDUjOgy8|Uh!L+!5R+>y1RwDxoPNTgJ{c_4aEs4HQ@&$SV<}W~|Y^eAGq!9C`oyC0e zH&c;^`l-|RCK1u>jan+PN^vQ?XrRKGiT4_YCHP%B5VOHZwUpZ$iI^D|wv z!)o~gS*ez#p&Si{v?@-ko$mQt56K_xFV$0vwl&c zl0@@KF4=>)o$wDhcggN>p@4*a1qd<)30do>dYY(0w3D{8na)G>WYmd$yrg!I3n0W7 zFXN#ov!7UB-ccl&Nb9pAtfJ{~Oi95eHdak-ICjQ5z!|+q@IT`&XY~ktX90)8IOT%C z95I{Yjs5jvYV4^^tf4thGzM$-R0nStqmzkosAnLjUW}t-^VFeO(LlL$gpb9CyW>4| z?+5?2ekw&m@ujG#A93cIk>jLjH=H(TIjE9az_Xg^!gm&_@5Z6aSx8Vej{j!TGIRzk zI5PZDhWSxbM7yWgWA*R!XXw>1RycZ{QG|2LfP1E6^Q@uN{_*&_UBOFWfpm>&UREe* z?lz)cwCKX&2Ua)OR-Fn0Zb$voUF?nVSxM}bab##9vS#6Qcc!~YRxj|wp(xV*7lA^B z)H01L#)}PAQwW4N)4`QqiwuweC!X$ghIf{&A)8}&ROtyp&*aY3jv55Amf!^bJFG;c#KKG@=g zNB$M|Z`z|H#lArcox5b@_pEi?Jbn1;K~VqLfkd#zmk8E~)hE--Xc2lnNXR4n$1d_8 zDKrkp|Fi5kJ{=17gbyc#JAVwF8n-@Y=<+qn^$nsF!^1js|4qH=?P-+b%Lr zGo3H#8W|BRl%o+bZb$W6pp0E2eK7%KAcTL!&#M|LWm+~y!O87*IU`E%Aieq$aTsF| zr7=*xq^XQlJq3l4CHM*3(>q)K`__8evo8@pu_jA_Jw!A+^p}sEBZy=8;FfS_{Ll^z znEo*{x|h&W4jbq~WB2XnQvAztzuL?ExWC1tM)O3H99682u->Se=}Y@AR7-)vbW$e@1gS-%(qaETxO z5eVX2aM&1j)FF%*eONqHJq+EKU3WORS=R9Vm{AxPdst7nW!$nsaI>RrJUYfR9%ufH z|9+4dUX+gDCW@Wib`jZc9Fbx%Guo{e!WIOy(QcybVPQYQEAgefx^j>$H$bblZv%Uf zyH`I>Y=^@AJ9?10d{$4`EC2*8_-YwSF58eaK3LHHIaI zH8qx^fM^#ko}lVYY_|xi*uqrEQD6E+@B_^BJs|4r^f%}B^~#`KQ=U%mL12~|KQIiV zLv9$|>H=R4@~;Km;Ezd1T4}5vl3G>|jjRV{a34;0Z!@~k%RZGZ=;)H0hJExx)vbvi zy$~pQunT$QlZWMo;gjT+GgGi}I9SI1VKW>U`mJSap)Q<0Op#B1@6U*=9wMvn`yDTL z$rG?9p0GSgKKZHfRRIS7@(`+m0*S@{o@VC^BL4SVGyXT7UN4ZfFq3|q+o(_QCn$au zP*xFkm4>Rj!k-;oFAqhizHOPqv3c6e@WGeDpT!S-XMH}jV}hGbUYlr(fO%X;ML0S- zuP0X0tcobZ*emgPBXO{TO)9)0MH(-O7R6W@v$s)b{fJm3=Eq=~ES`-&K|ic%o6k?L zCrHg5zwkig(QZ5_JIW%|N2cw@_jC{@fbAi#lTOD}1Q9iOUGfB+N+CE!H}IBceI$E* z(4W12@oXhbUtzAhAIuE*#3_k%OmtNL?lXubDsI}4oGEGE9v<8oM7`6yAO=azF945> z*vhyIhKh%-ybV1;-;?HFtF^Kb-5ty2G*mQntJrI~4>Do$8OKOpGIhkmP)PW{aT!Oy zhIq4IpFZgx>`{hy=R%(iZXZlRF=u_x2V1Y(JP2$)2*xHTBgt4neOThHp%3Z(uXw!w z1r0>YcRdLch8RT?j#n4c&)(T=hlj$hyXhm`6n0H}VK9Za57TBrSnhG{>BP6IHpmSL zp+JLsyW###_GfQF2#|0Gww-Wa~%uVvgyoj91?az`2@>RkxO5L zGdapiHK9^z?R$Q-=g;`pvLXcdAy@?Ah}eB@sKNV8#Le*bWJjvk|r zn*1|{u?j*!;%n%%Bgx|^wPy)M8ay;@XhK*Ybj#S~9n+RK1lz`2Bh`yu#HatcFP3}lZj;`{kjEp-0nuQ@DA?0U&5jPqC7=ZFNwAt55;}~hA&Ig1(Ctg|;LSwr zl`sLSuYk^ciDT&HR`m5=U_c@S`^d8AaAE~jfzZ3vkosVfegw8G`WaiV!?~of!pFKe z`%Kr9j?(zhO~(_u?jU)KjoWw{H%-~@B3DUg{Y5}L8?9dKjf>IxxFLbrI(dV!7Zx4e zt)uQj`(`ZyqoG-ujKKY*sRAIVfiECx-u)$wRWTRAiBNPX|x z^P--<5u0fpU+${*AKy`EH}~Nx(s{j5-V~!FIp~ zRx?mq2(Mk`M)f6G9%U88cm#>Du?JEoJophwu#pwR8Ls*(_H6t))=vZtv9BiL7!B{pgem@q z_$b1QnOJ2UUfyNQW(nBS{7U!WB!K;=GU$hX9RS>oW2lnm3yXi&FQqK6ueV?I9-1zsh;r@N4x4~{1$EaFU zA(1l5#u*^?yGSR&UV0tRwsM=Pv`T@D@2Zodb6`(MA0W7l>w_THwnvmJc~~x20^cl~ zl#NJ2AHr|;^r?YEFgMWyP=+*>Kmc0Nj{{d9@j9Mrjkcne;7^IeVsbJL(=+?DC{a8b zrxwx2DNCbe5a`)RK|lKDJ8b{f5U^n256Wolx4?H_1ph$}|COPG->@CAK7WPn&zzpo zS6W+OVC0MsmDODD<(U>@9%k)4W+C>=B|9(_YM|k2xG#7! zkzOC*^NYQ5@Ri*1In2VmBzzwere1#rRt$=0NPCu@df;uyMHqd%EyI_-_5-TZpYh4^ zJH-6dmZbVKz6m}E&jI^fmUHmyi0yg2CVc0EyD_3h{U>B6nf+!i%_qy=K-1W@>x#DZ z_XlO|nU_EUcKH?s8Xjbi*s~iRMXXYYXro{|gfU|RB37e=_Q$X=j3^hA6TcPqKpOke z(38QD2u4n|=gJ z8^xC6lf8WY=FvOsSn&pbZZf<7{%OpA!iN?R9FNyW?pfq*%PENSw&%akQ`L}tsd(ECTjhP@ zf%8ay@JI(sIF~%@P!iI*i0Hz54F!XirKUwpIl9{od984JXoZBsl?r@63TI9@(^-YR zN1U0V1<(V2=M>=mmPJ^fki7fD{~u>(0v}~{_5TbB5*B?%r5cxN)YK-fL2a7|)C`${ zi6)xLA{Mo@QA(>-iZg(fC3F(y={T5HZT)w9ZELM^kF+Mi5V`8)}b{J!*vz!w5ww-1O%9lQWO3D^}ZsJoj6Nt*w*C53SUV5`J1MPgk zTPM!9rYE|lhQ>}D7jh>~w_|s1`7))`Z}F!?EyzVge&zZeu*-l=p7B)LllPq)CF9zI zRlJda#*T;v2W9sMCoX#xUGmwO`qN*TlG&lLCV#u0?@hID#m*_%pF6@8!-vJoWTGZX z0pixd(d1d0rPKZfK-7LIr%s&1>}}>a7@7vrn0!c}RS(HO32-#-lkF_X3n_SSdk(lL zltJ?n4586|sMTx2tg}D=l>KS#GwyG*KmQ=^p^mO9H&5$(^6zSmN8B-Ux*gEp@5((m z);_qymf-kp%npXCw;XMjEBMRaU!NnWBvmFw9Ja}Yvem*U4WGg|vfd}L;! z&qq9Ypmt;YL+l@9UtqhVs`2ge*|KqSJhv{0S-W)+IB>4BVrmxBvUS^2t^N3(DFdCv z^fH*&<|yn6K9tz>aN_acvdP137LRCZ>defoqL-m5)-}U7U|d(m1#TeZ7m@PV$_PXc zYTKsbvvY>y%{`GR#XXT}oZqsFyvo~@H=AGbh^?ad#w>r;`FPgoycq_z(cD0xR6QyZ zVF;0NOFXlG7JqZLl0ggb$-(`_n18W)R>}3^WLkq*K-o3>zs1(&tCo_Xy6>K zx*t(^TJ84O1&KXFVrST~w=+RDTOK_+Ng;vI%neAAXY=jVtq7RedWEZHv^Wx^HbH0+ zSi@dtLM(zO@8t2BgNwcKNd`!Jd6sOa)0{S(@UWUr3&>{c-1HlMb(Zr-@ZSM#=~wHH1U0v)e#n%hL{Sr(`n{HRvsBVhWwfx-aZIQg9mzNkw6D6=vOl0G!my2YqMTQeQPwjs>q4-PJesqPN$O`gpr;J}1v~hrvO?SX zp9bvg*U7w&b*y_A*7e=PqE(NF5}$mY0IGnqe7Q{t2?X>JyfYNxldr@|7T_?`~PyhlwOTpU{}nXZi)KF=<2l}R$g}N znhz_ZEh(kQAx#fEJ7qE_ba9|&Lr?hh&!Yh{bzbYykdI?QNPS%|#S@*pL_em>5TQ@$cAQ^LJA)#)N zOB6_FfU@%<`ap5H>#0PJojB& zHMYK?>K#kP8v`wDZv~tcPfpFEoIIL9 zz=fem?b=0`g;G(nPOQb18#{k*7fUwSu#;r^>*h|5wmi|$@*HdXIR7`8JpjkO9NUUL zRuuf}Q^y_yW-M`Rri%wOnanEoMd|{KG>>Ke940={eY|s<2f=F}C5+zx8iP}@%Dd39}rvBt#UwNBd~nQ>z9Lhq_k z$ci*}@F%g0cem=@F5cb57p!gpr?a%}vG|*b!3D8H5`)tz?%2}_^m)WcSWchkin_R6 zNQ@g4Ghn~VfwT6NSiQ4i$d1;f46!tJe3U39#wWXg#9`a|iV-`O+ShRt4P@}Xt$l_3 zSembwDv5FFhmzVbsa6KX@D{`piCxpZle7F7H+w1Ea{Mtgjf-n!8F)dQ7R!JKi@JS1 zxU%@!`8gUFQJt)*$nCb?ixW`(f$PwQ2dwO3_kT0 zws?Wu)OoWv1amFrz2_k^Aak|TknH(#ZUkrVKLV^hWSUs@K`nP^iW^uO#&kNCF&3MQ z9+iX9=)UF5Jzo33k&7;x2oh-yF5UH4YAG_rNj%6m_i-ikAw)3bHkE+uLwdbr;UG~_ zx`m+&U%dKs-5gBps#fLeug_KlGEMBPQ}(KOisszm&*S9FKl=-dAa?4Cvyw zG6eM7PiO_lj0a8+Q0^(rwc?CRAJH(@b`;8+h58Fw388S@4XP}+--LcUD@Kw}pmo=H zFCR$jt~!sdSua8$*pS%jm}@B*T|MLa*xYYj`_1y6Na=~*Edq}cUdp+^Ga91cjq3io zB1O4X$%$;j54Fje_zp^Tqr1h7NC2_kNYNQc+C$F3NM5X8Ctl7k7UWaJ(i}f*tTpp5 z-~gG(gH4|ztBUlc?`B=JuPHxoeS@-^Q%9m*k{1(t!lw@wWq!y$;ngPvqe(3)Zm4?x z{8a3uK;}29&)A(rC0m2Kw#(N|gAgn5md)x#-iq4!!B{>%RKkO~nYcN7;=oWmkG(v7 zmH*=laP><-jt|gbYoacVX<=Z5F z5lY!d%4LE`w1$}9^-BB+=kx;cw2j6-Lf(hSAv%DZuq-l)EyGr+YbI?1kzYNLgNgNt zaQ;ES7ds!36a={19!kS`;6vgcX8vmJwHul0n$8)gTUqgWA*tA4kGbI?YsB^TFIJ2R zf$i-(mQ9)vs|N&S$%~lB#n?{iyhI&ch`kop|9a z7;>i+mBtZV_SQG@@+t09c>y)DuYj8TcInt}s)q*xTbIxPBY6|$rS9+V@AM2I=@eC-s1bLn3+kuR=AAL3wrj4SHHEtu#kJ}tL}$f zj~#NKGy|+9QhPXD+fov{g3EA3a1$%RL4DJq;yiw25#U}17IFI<-82JxO6EZi4dy-o z8gzUr1@QTV*Z4h14?dqn-!K~A_JVW_$w1X}sMo3He{%uLyeW{Tc3~F@2CLDnuL^rN zLjUl$j1UbGh1XBffTNEVN0MV%`h7HRjmLkNd*R`A$bBuu#fS^ev$?OIHdo#QJJMyE zPus@#ua-WM?r6__+T4jOX(OgBpZ41yv%%|u)Nty3H0_E06yhuJw^2}8ttuN2#j>C2 ztXNVXPA+P$b5`_@mvrv5aZzefsJ0g=4&|!BeacyWGtV(p5d6NmB$W8_Fz5Dg4gRt9 z_2T;0;en)on8)-e`?Jw456LEt1Cz}Yd4_$N!{dDro|K8pCbMrv#)aX)PZ6h(>UYU% zR%4oEdgmrVh9NoU zYIlRX4*lOtvOsRbKo{oPU^cH?LofBAYxoZ1T^HZ3={hTJthX_qtJP1Zpd$?Z8)&Qh zfx8N0c4UQ6jL7|JM34i+pLSM!Z9=BT(lgn4l1<~FjF{?}MO|~iOP5FHs)tLW9@HjO zW6LyOfjF}*7I|?3@kd)1)eHLE2)d}A%wRQ68)UI)%&Rv485YW67`({t6|7zBr0!Dp z$uA?nm=U&_*z2L*NKka2&(Zp{*_8NEBvmftUS8^rFK2qN;k)=p?bx@X>JS2F>sY(9 z{8J+3oG^~6eP!{XS@{!+uLny$?5R5#V;n)Zs+1LpxcOJ7+43!wRB!G_2GcEIN(Z)p z(KV!$J;xLHu@|ym-L>gjURd&ymk;y!ohQb7nF^v9g*g7+LrywWVfesziiq~RsxFe8 zdS%FY_>oZU8fSTr1y`gR2JpPx4jSEY!I1U38%EkPvYSrFd8#y&3ReVRS9Phc1l;wf zM#ha_M?L4(gV-ozCy!bLS1u;}uYxWy1G^+9ff!T@nXO^CdY`aAU+!IufVW#gpWnqC zWQUgdQGR|6$;E6>(ymM%wF+&hD75Owmc#>)C1wd{bQ%~Go*`utl1GwpkY`B^a>n4#a(Re#EcAP0;F8J_(oKfkf_gYlv1A3s`D)NF#- zU6(EimIKboSi~{$m_@um`<=12Q%}vim{s@ZFWW`Gt-n4*8>z_r13Uq{s>QC3xeEcO z-eP`ly+!=q;t~cZF(zl;5y|xEvhc~{2R^@2yR3k4=---D2EwY{|K=n5v|6C>l~7Ep zENn9){=^H`yj;!0#yOw1q%6;G`VYttqjX^870;=Vmp9(hy&m|V`n?Sv3pHrKBs-HA zej@g5M)%Fa8momtXa1MQppLcASY=*HO3kd;yMPZ zY?y`T{qh0jGFALKAGepb-DBK^bun(FI$8I*VG^>jdb?|$KZARUxV~z z?mEK~>|>$B6kGVRh@MC9^8UEiKZ41z_2fB@{}d~p`F##PUcR6LzgrCe|A1yfjhGKN zqPciFxAY)L)^U^^!~=JIG|9oG^DuWxrcSGK9>!w*R&i+T6_pE*Ov|^$(iz4ik1d>Q zD;M9`lw4e{!8Zi9H6+h7=5&oa_8McmC`jUxir~Cc)Mo4V4lat1P{X0xiIt0w2r1?j zh*y&-*<8=@f>$AVNhvQzX);ekmb90w@=`$R^ZQ+I^U0Fo0{hT&pO-4Yi>WFHOj$!> zTtyLzH=bz+7vUc%v4roa6zvjG8j=8na|%wgCZL>@TL=THiOudaRWAh=NI*fvUtjy| zq6v-3k$8%ZOWs(Sm50I4W%Uz?{vrcb7v@`>I4vHPOb{z>C=OM-3y{zK78Y_U7KUqx zaB5WWy=J$$GWIQ=T~jflF*&a}n|FE{D8hj?yHfEdM9n5%C<=|ewrtTw^1sZj-f8O@ zFIUxuYNiI~J?+ggwkDK}vm3ZC?M@41-e>;o;U^qwN(F23_}FNfbIVOEZx+lx{bECO z-UAgjbI;TsZvuM}f>M%{7FFX*A5J!q>1z$Z?KWrP_(zduCXE!!n8;gGE+-K4A+k;S z*9_eJEH{LZ`>4&SWEPMc&X>~1^EPd>yeUT#%1vkWnP>*7(IDlJ@3ZU+Ju9LfVE^ zQ`$V}6+>o?)VuW*A)N^+vX&Dq8h$Dg7lH@%5zw z8s^I@apZA8uQ0BjGV|b{Igt1ZRn1vcl74ak{;9jLI+aHwd0mMa!J@Z!f!*=R=9j4M z((62o?ZP}k+!5GHU|{OT>WKSB2*npyHEav!``ZP8K5;CNz)u|yLPAi|J*a`+{xA<9 zB4k$O=&8oje_(#AT!U5z1)ZuB12;Nt$1}w7C-5gWCoxbNJG}EgZKR`M=(+Yx2K6^_ zW3b9;3s5i{UtES0lb9^O1&bepl-5+sfXRs2S;eB7_m}{*DtURSr&!L9j(IFIB@1U< zz*O@Z(xihi8616+{PnCIUAL3f$zrD-npx#tSK(w$JgmbDg05N0eLIH3`&tKNU_5Ndzqj zJ!o3Mn%_wFMed=DITCRDaKs{;7&tffoh2vJywk?gf%0cKZMX9UREh4(kL|ikueIy$ zCHPDX%)r;y`uLfTnTWs0-9(iu#$pTtoNv$3ZCbLSK;qJE3BaWyy+9EFss8nppr-EyWNk%Z%j$3 z^a8NXP5pc)q&o3VOP9VgTZl@ku5j|3B_f~BKPGtDY$i-}{?X+tF|~x2vpC~zx|=p^ zsl-mm9y?wM3Z1qodVoE_x%C_T9zW7P{9Q3$54K-N@im&dzoLv^fUp+TS8L8u|ozyuCtLfOJy^=jccd`P|@nt%I#k*11DE(DM;DnkOu4 z1}hcgabJZc*vX$;w{0bxi&9s~=9B_=R$}%%V`f0v)f_wjPha@zilY&?FrzP5h>;F^+E)MGj4Xfl)VI<=EIBYtdlzh>VlUyS!I zmf@z3fpeX3%rWZ$4m z^6A;W1iT>(ZB~cVz5`?}koREC(*XoSKpA@-jW8{FC`V7ly31}A7^cD{9))euV;?z! zzZ~Gtc%EO}%yH4U0ocRwA7B@3N7G||jyYn;r5r8hXE|z`fe5f1ZWs{&4Bh+z9MWYuZxD@XY z4fj%QZb4;>)@_Cc&(nJC%L_GkyD!aJbly%Ol-fQ5)m}vULY8yPR?jXchg)+nZuk_C zqIwntty2biRd@^W0B!H(&hh?(=j{Wh{Rz9Qx7a+JPo|I=Y^-KhYyY@Dq4DDa3~{;ZRsrW2l^e`4R~*CJU+dI{&W-P!6N<>k($*-r zV#B7X7)b!}X|b{}Pe{zyj5-l2UpA#Wh4>y~U0# z#EKTdw}hmeC0NAn6z!q1#bEh+C8N#BP^Hq((tepmW&JoGstBO6I4vYL&*L1eDIZIl z>ZT+m6n@{s%$Mj>%Osj%mq{hRZ)d;F`~f?tmDabJTPc_RgJh-Ld6FHUc3pl@xx*Q4 zt=xEKv2f9S2Gxh!tga?8IH1e2Cw4>TO9AcD-3s7z+CFAg6T44y+CJb*XSF?4=rcXP zu_9F%g!-A^Mm^kBa}bPjbLa#e)4L!VIeKBPrhNKs?-BLsUKG$gqKh`YjgC!%Z=2K=_Tm0bbZU|EH>3aDvOaRi&faI~T9IS?tftCLeJNsN}ho-SEu z?+E+3O*_{ND;h!+Vh7M9m}Sh4^mBr1M-F|`&x#gwG?MyawL{x=QkJA4reNPaz>ko%Usw|xye}*#>OM1s`TCK$!aMLONS&-pLlk1H z-}+~Ej-u!UxqxP+gx_kudYyh#k7@2C2AcVCH06Vh zeuXv5*?sQ>=b|kiMz7vcmR87IXC#Z?6y3+(Gt~xX``SV2tPVt}oHR54XgOzR_gYNB z*x1uNJBO8oV#G1^nO#U{ncl2iMj0N?xIDdy$M~Ztf35qp7a!)kBQ1Sr83QNzABKeM zYM^V!HYCpsSpoU-nc>=37JiSDrE>W&uR@Z;AYK;Z|<2 z&srX*AIm6Hqt{hYx`b}(TEs^?{JIB4W7bN z6+2_R#QfMXzVfz_hC46u*EsVF$iDO%@(ce7{ujA{Tp|*2_n4V9$hM12V0OzQ3-}tJ zU@l-SvdW!#7kaOnZ$mqilTlU}e3D2@j#PiX@qftVGvmej?_v^bui2)|!T8(pwMF*WQ4+ z(i@rRs|!a_l3sGYu?uq)=&aW*v1yYg3>K$1TKU+zv!DaoV3eRqJ*|NwL!>X}HE{Cq z)5b4mPvg3mZXFio}hG=JMJo(jbOW+<(wv?Eie`JemEBFN`F-31t z@txg*)HxCL+A2X;kS~>%7f&C5lNnFxJ@NxKwZ{Ds88IP{G+sdkA0E|;2WznmF=(5BtVOttGbW~+5& z&h5X%z$s4KS8d5towoDsm(Rsr%Um-j&gvL{43C^Pt8%4o;rl~SdlpuuF9H~OeoVg9u=|#?;`Sny2-m*vEI)$+xJFrE!f*fZ2O+EuYy`RcfE*3p zUNMH^zM;W@{VIV15^)Eja!^*$Hz*24cj7-wzX^7SE!3fA&Gezbj9!@~nL2fpQ+%lu8mrHbZ|2yvM3Y%ecM zDgCk!b39;L7qGY6D5RWwRtSL1oXk(txAeep(@I#lT?mZ)R!^eiv_UyK(4Zt^W#^ba zib~lZ2P!NGBE8g?kw5cL7AFnh@(kCU@)|^FnfNqw`_7#nht0|NV>YD!4;o4i|79=Q z?wyxfgB;xaLv!T4;tbX{^(2E4?(x%<|G+W~83K_HaLMSroS|5QYXr&4r;k~GeLo(h z-&&oxgePx@;v8*(f3C}+E(fVQ@uImt>|Ya%4*g9*AW>2w2Rkd~nYTpXz0=jzE`7q$ z%0o8hq)~9=={=iL4YMo4yIFcFP+;^lht!zYRd7sM6m6C#lOEL3qK{Q1b&~GpRgjy zdX%_D)#Gh5N8!VrsIP?c0XkQ2JcpLDwfQE^ch#Q!rMt+rGltlJPVF;mF!kjjH0bNB zsg$XkZ!CfSwg6rnGA3H%aKxR33;~_!o#^v5n;{4`S4l%s`OE#!3Vq5gqAbe{v%Ju^ z-}2LLI5Q6B*?A+SHRG?rurp`bbx!P_5xZ>ZZrSN#SNkioooVOT-`OvD>@PuGbiu^# zMV|j>a$E&DUAkHGZ|G*SW}_FV`PSpsq&I6_~?{Mv5A`|3#u#a_I-&3h5}S3+CS4 ze-nRui+D|`@|gJZ!q^Otry zV{GYp4Bi*{?TatAvOrl#P;wRTbwjfGPKP%84w;HP z|MED~+fpgV(7W|%;C^sQ%+D3Wt64M5oM>E56FTrk(e-+lRrhc}{?ccXmXyirgZS_Iax>dA%9=TS^p_z0 zaY6g`yv3fgQ z^9Gp!t*_E+v?|i_yl|6VZh2j=2z~A|-(7&jqpUZq1`+3s1zT$8iT-fj*fDpWK|Q{0d28A;sFPhIrTlE-wS3Pet3n44?>~|ZOcb>(YZDtB7p0tE0rud18GO=*vB=HxH zT;?V1T?nD1UqcgP_~tBH%7FBo|48-g}z| z<>q@Nt>YPrgIym+9J_VuOf4E8J`+(f*g6^9;Hk{dQV<-iFbHI24Sgx&C7ng1`cbMM zjqd#w8|~-a75#jg8l54-8Q7J&1|jvJcltL5LBQ)H=^xW!fvxoAAnt~sy=nldyn^TW zpXJiY$oU-LStVbK%&~0kT#Fakj{N3-jiGnxgB5pC>NublkLHTqYgvcU#a*)8>P%J2 zxz18$*U?$392X3Y#{kte?$lVxE4XjLoP55Yl17N1J| z2btS6TIf;D7(b6*Z#ZayWtV8_Zk5MUnd+#v6%(y0-kT8Q^^dQ2df$qA62G=j+{x9f zwEaqmT6Ac$M(8G%sdUP#uVse>ilgNCLx_yNd$N`mcJg&)rUBpzEl$Anz^7H!BXwAM zdLz*Y&5?Js@<+l>4ky;S6eOWId% zRu4=HuJz&HOalP_&ufHYWU{qs+5wZFhhF5cjUvP^!^XUfS@z;PZh-ZR5M3SnEaw@? zE6MbZ8d&684)ImJxVaFUDY#0uW9f3h5}?qZo|Tt3*(jB@h{OXWkJ0A)t#$pSs;X{`WlPUvYp znGeX49Z92m*G7J^RW|a}ymJANfHv8SQGymRkssjl)~=1UAF2)Rmd~uhz#ytKXIov7 zJwJ03A`;qbeDowfuRhqP1AORTZ$c+d`lm@I?o?SfaTg!G2~i#Wqj-`3wKpLY_aEMy z|GF~&b-n-9n3+hb3AqfB!#dH=Cq$<=AsXd3P?P_^Ib0(y5Ih z{RXTTdfLla%=(pjOk73;x+!Z=)a8x|OWk-@)>9v4w)GYjd+RM4;*T*snuy>=h(je( zNR;$%9Uxu;$jEb)>F5;?h^9U)}>Yd7n%cX^n0Zp@< zQyMN2hDM>n&kly&+3X|*v1nVG=BTc~KDCT#ZM1{1!;vgy<3q|BOy$1*(9v4LRwe~w zU$P#TwQFJraeaa8BJxegBZ3=h%giKJ9Hn<;!97}k4P-u$JZ<++f&M}+rP9e`UOjhO zX{~u_RvjR(;@p$fE=D)E zJ4BX|?l*>p1Kp_L;V+RC?=HD)A<^yqjw;fhEq+0i>LYfFgdw88rZF<%wBde{WJeFW_5(!$4_b= z#Z{Em(IjCGCHU4M2q{Hr$$I7TwilAEi*M8f5KM>>o6nuT2}fLER^~E!zn1Yn_SmC<^?UXmbjtz z`MIBObo)IxA-1Qx-_ylyd}rir_O;9?KE#Oh>%|y<43mcD(?gWn-M`Q zoSN-43n6Tw1Q-6w4Vb{a|6Pl09NQ9(xn+d3-Aa2B5mx!D*w=;Ml82#kXbt;;aY_XX@l2+iowCS>v?N!I!4*9Ca2PmAQ`XspC>U)? z@9@kl=Zx;}ogP0mHED1>Gd^$r2@J;6Vu_62nJ7tENz@XUygW(A1l;6*)8x>y8a2%= zUj}#^_}V*x^$SjRcUdv|xlO6_iTvx{eSG4vz|LJX(c+d`21AKL2KPL%z5W4 zwd-Ts-Cee?=lWC8L6=*WvlTW_;YYa&RvgVwTI+$Tzt4T^m>}U1-W9O(#^FHk<%k`# z!8V>O)==Jq^eLaW4(Z9`9Zen}khiXg)SE?P?ByArJWUAANaE)Gk%HPMO&Enkk!@&_ zZ7B11(NC2tD0I+1Wk@aHwbz(DSwSIOu709|hPV_2!$br5K+4S5ce6Fn_($LgfXLRE zJSjJk=lbb6bdm%)zi)36ep;un@O*wbF~1{OdOY0N~5lq<}L5aW-EzxC=!5^ z&_{|^rV>o{%XNU12MIABDKA9KbA*^r1Eh7% z53ZrK(>{y8<~ndK^NYRK$2ZM>D7x**+Mb~OB8yU^P*fcPKTke9@4of%8cK|4#luC! z$|e0&O7N*BJ*Q3H4adiOlhM_%#Ly$o&`-e?!;9kBCaa9M>kcicFzXQnGxzVkUOE39 z8-j-1KXtPE1Y@a8UQ3MCh0ywm<+U$hisaT(8gp)uSBt391$;J0a~3*}d3B{e@T7_c z)`n|8j4WGNLAo5|HfMP&c-qkNbOf_!O(=DRC1djW!o}yA3|Bh#1_|E@*S@g$tOm}e zaFTzeF|Z4Yz*22epbzmj+uUO-{DS5IU>Z)2uAs(}r$dQ7h}Z9GC=gYUnr4-Sge^lY zbL(H_nG&u*bz=e{OA$lQZ4Sd4w+0s2Kt*^CVWlOl(bQ#YN;3y{@FJSXR3hod&I~8d zR!XFI2u>${NaNtGkt-QCC-ku(tKyYq3F6O2moBU*6&RehFEb)}9BN@IspnC&rk24m zkA<$dAT|2o(AT5^q~HCE6|Gn|)VS`yDUR~EklX9rD%(QH$`5EE&ut1Nb~8^os5i8% zQNSR9%B{2;b}`s?6Q}IHY<^8!0*oeHF0QbA4xkDV_daIF1*s`N8mb;UqN#D1jeE#V z{$jLuQaNi=)H}(eW|K<{ zYM)-r0xyPo;n4Pe)iYX!C|9|srUXl)0q%&WS}I)1^^nZhS4w2ShM&A=u_JxA6%<=F z3<1uAn$6SDxd*s1VJP;ufxrQb_+pN$WK@s^E$=(H(*1Lp!& z?d8w|r2!d~HDl*_Vqqmy{XPAG$db9tq`W0kyg62b}BfV0Pu-pTLGn4+~NerOt( zk9<6y)d`}wQKsXB=OYeFmLR>Y(tgKL{J3b$95fJCp7 z@wTbIBF_#;!mtwEMfe_BC{R_VRFsd|YFWEI->~{Mo?|J&h5Qr?zZ^lzXjuo}jpE=a zL}@4{w`rogv?Ea)2qiWSB0%tyYnHkfZ4C#8Ad-}X1CIuFL~D1)??>M81>B}oq#R9A zY55UiM*WC8%h}vNYD|rL3V&91AM($m`j#2#>q8BRZQMljQtYb@T-qHNz{h|c&-G*r zg8ni0=n6S4D@R$GPGo}SrymG;_{RUzMs^E8A6*d&bSJt4nZGiJ+Mba6o|8J2Zfus< zNNQY_Z47-c@Ra!~^+SQ)F&h{t$C0U~z~XZ)SkU6Tlrmwij5XQR_*@gcf& zvE>jk@^4?5)d<|~bQ@>g!UHlab*JasA9miJJpQq@J(niGR@45fyHV+Q=a;1>4~n9M zlh+)9=(^Qu`xR4cfacovQ&$J#Lo?@h5W{Vy^ncqe-b~32v8z(y(~I1UbzPeGx@Q9# z;lml;W2a%(+6vPpa>uu%>aDcp3!)llICafuAs?GV&u%5y#N1&^MS_Fj3G^f=W|jV^w63!0#%f`Rvv-zsGaku~Jrc3-Jllh_@Y|4-HP zYvt*Sf8WTMS9ALNIsdFX8(NsWO5&lpW;=`3@|==Evne3{CC^)0fMutZ^OR`fqeJ~` zV6*F%vnR6XoCve}WFU($AKc0S))D(C*?zxn+U{R#)_bnMw0;D8)oSAjD+1=^KRLhj zJBfjzG5lAD#jrA6REBh$Z0nYSB#E+0k6cdCdZWqvpGAx+O80&!WU%WWg#;_q9Mc~1@$`>u(*pTfTfsa2;w;lK5AoLNB%LFRBO$tIsy!+3y*A3UtxL_F6p}f+lpz7Z zvuPiKJl1rnODkYlmjSqqQOL0OC^=R(Xt=X^nS)F;(SpPhblaIX_=7zlOyc=n5}+8FZGN8pdW|{M`--Q!IVk(} z2BUi^D7!53Ju`==iGe}Rj(~ylb;78rLH~a%5&Xlg@5p2^aRg$+FrKIza&nSMV|>XCJw!^OVpKm zmp96xRab#?^Leb6v`O&MK0MvbZipuPIR1Bj+pEIUJfM)=-Q>m!!WPA!$OzNcz9vJz%xPRO65WcxSE0d3g7F@ZQW7^T=^cT+l?v<`HNScEI&<~-Vxd5~H(uHIAP72FpZORq+0OGVVUwPk25&6# zk_4sfBi)O^Zy&vQJSyI)+Q;!6HhxApHAhi(LSA7mcuTb!mH0XB=WD8u_`f{jkh^Nh z8?PvjrA4ZBgr~cspb0~*#wTCuqVzGq*OphH=^^~kdl0xN9pDGhGBbX&7yauUc1&aZ z>phc7F7BB$w5Vs&L4lr0!%BK4ajrXQIG-c<9Er*>>Zsce9x;m;siQ~80+6G(P#&M` z%)Bz1EU|adOLLq)rps9o7&ksvIeIb~Yka4y34uNVIYyLD@6N_+(s_h{-%d z)?Xm%ZpPQB&YU7$pQm-o8eG1bu*xEH^6AzL)b?Y36uc|ZyAj^I_AdxM^7ZgcAm7$$ zwqCm&)C%6=AX8*E*mtorY~-QD@;mMr629z;;uu%vTOL6`^w8BF zZQg7yq_l@$R>IR#{jpUD^#A72v-s<(;eKB=xV9Yv8^OLWIS=kHGh%aMPat-j3Qh5v zZFFZMj>=bP_V(Vo0gfRV(UgkmS4Phs?XQK29|=Oul%xT_(XAkTX5Mv(#J8DS@jdq@ zaF{>clw?6WrBVKq8+npn?hfnD9Zg+ZM(!+9)?+;*=8Q9kS;5T7mafryCCxV0_Q%d9 z*=%egxisYf~0JAxm{7R|Y%q>Dd3TEv#W0h^@NoD-Y&S(CZn`kwDe|(KYjT2Jq?Z5$iw|4?n{IOZqi$Mj|2X`^m+j;efpLk`+AC#i zx<M??K32n$O~+J}9!m^lPze6W^$#GajuA;06{XMsE%-HT+AA3m|T6x+%N zl3AxzROU8O{Ogi^!3JCfX_%C9Ir=C2AV)8&&Stx;E(c)##@}qGY#u@@l=D04DZ+c- zCjBbT%Oq&@wp`{`Q~Y^RZZCe09Cc552hFmEK5!+?0)WbJa+)QXWtn{bIk~4<1?c*J zOHH*3kkj^-UAYYwf(QBe_%l%7N1e6@c!hZ>5`Pp?!y{ihmuw>eHa7F8XxS(rn!grcw-c?>-=^-hS__1<;hkF!Yrcf(VYfOmx~p;Mpr}{!(RJ zQ<_o&13sR50QkXyGND|1zU!N9pxSEsJ_u`>Mt$pLUk?EHqMdt}&k+Md!H++f;G%DP+t=Pq&9 zz2V%^d43MQ?|t2S4Yctp_2{mQbLn-rYZ1NmKvd%;Ma(x)YnXldv-DfIEa$RJ`TgSC zBlbVP)Xh=u3kdSDuzy+kNTB0=jWw(~Sb)pgAk0n3Kd49Kx!czmk)>OS@0AwEA7gh8 z(G7%W9OV3@EAuS-%cf8qYrX)Z=8lsLQkrkqFc*JA@cRE7-?vubBv~-Nw}C9ydh3@+Ki&9LFD3AXRv$A(6381nysZI_4JWayBz{M7>VU`MV<+S~#9(hO^>EwXMW3xe0)y?1$!mk$yBt53+Oc+T ze5rW9siJ&Z9xUSTymQ)?&=vjax3m0L{Gk1Q?>Hzk!oy$L{2?w8_v6GsN$fMWHFf@) zKf4lY>3E>G8@*|;u?h}_m8y1~lhBPUk<>Tsjkyg-w260v;o6Uu{JE*+-+}^fi^5e` zR*Y_PcVg0L*x6^T8e|xc?%b$DEon!b5$W(>!18VU8{c~ZZ&11mv(Rtqae`}1M44F{T1T4$$L&Pq1*M-w*$ z32&ZDv&jfDalC&&d~qWty-u2`5Q#}E>`|s{t}+oI^|(^_<=xPmmh5V0&^ZH2gbdI$ z!++o-=lClQK>zyvLs)yi!FGH8Dxn$nf_UI@7?On19cE1ETr6vod)*wDVdyfGI&B+x zpCw^Q+~?8_I6b;Ai-0YVu*2qOLH9nhEs&!dlc$hrHYXDVV-s}VD^-(9(Ymf-8~Q zcen>VQD5WP&He*(Xr*)!wG=uVdx;T&mXToQDR15AU#*g62&3n}I8klh-WYfz>Rtk? zwTdGbT%$K;ewpRVlb|qbxCM{^^6vDJT&iY|AgUgZrsnpmO0;`V2`cXTWb**iaho?T zJ`~T9a(kbe^4Vc;v_1OGXFF~zZXtn#C0O-Hxe6SL1k<0h+dT})OGdX_2cu1F(e#`A z@y0{A)qfv??$iA)L)k$dGBU6~ZF)9)2eQQECEgFnmDLGvNq15!&!0SF_H4`xa@zh3fD>0Yvv$8A zZyL|w5eh$ROtvV!a=7Bewk~Jcd+<4yI`LLX>{|^~1m*3$(kr zF_0_CA4|<8*6|5yMO$7>j{YGCLLHLs)^4AN)8%7MTglWd)nb1nfqpYt8vp$EmUn6pQFx zHD}Hkjiaf^OdUC!6Ry&5W$Xq1JlF@^cv*CBJ*duEv6Xz?C0uSqV-o)^1x4_y4@z<5 z0y5PKb#FTa=ZN!DZ5T}k&>EP8?!!dROe`ub<{q)~*l1)8>CBmJmasT&CjgqnqOxL` zbqYdC{+;#NSBKkImBq0mEmhcTR(Nj+eIipTivZn;=xp4#lwKysGMP&;gZX&MJ$tXJ zR5^dh66c(OJDQwFgHwafO^w7a@#tCSwk{B*?PlRAQ)p=E<+QooP9ZR{h9;YGo$$T7 zH&UYx?HXMPlM`L1-jSRFb6Gc)vkqGUBX~+L1feICg_F}~axA%cB&ww>FB>^Uve4)= zf4ZEmcT7AH1iltaDECPvuP=An-bQ2A(x{pA%lydk2a8494hb#YtQGGzN6PvScR1L$ zPkCM26lk`u*T6}w+VQj=N(>Ih4#~Fb?Po2%ozQLcB722DAFZb(0#dLyx;F+_1K8}C zUE8GW4Of>-45?H0B{J?a;Rv7SuxaYbaJXNvKqZ3$7n!n3rG7q*Ap|eQqIB+iOt&^QcGz4EN+2n47}%l1yGE^S~L_y?uH;Bx(&qp zb-4rgyGIlK&`<;`0up7F%Rg!oOH(o;=p2P>LamJzC)Vj_O{3dVo?iS>7GHoX!1RE~ zy~@B>_{dOJI1@a z9$L-G@!PmX%&RspBg(5}_tryFcLa*|aQ?dicZ?28h=aZzNsuPyoXxu zv_!mEKCLXvlSpTw+D9}#r|m9|8nV<^h?2e*_0_{02%5GGReV&0wjF5}zX%_2xxt2r z)kslz_$Kyf1UNYDG3LP9U|}Z2$64Mk88PuF+rE$cw1VcUAHZeg?jRYuPQ!%66p5xJ zV*}v9L`nv^S`Ra@d~%&OWiwO}-P7%~J<2cL)r~n!&zZ*~;JU@@2VjA~vj8q>3m4p; za&RF~qyR3fJh;4M{hx|~pGESfmVeRi`N{Cx3};Tzv~1;|C%bv3(TN8awd8LdoVLan z$!_7a|9H5iSwno11#udB8&UR_XxUMI#*R{a*W#gFzwc5hyM7kdvOlwi+4cJl?^!?m zv~bMA8@I;VNJb=XpvSg7z&o^(nPl~QkMwNiq&{70x4Nf)(;tHZA1p2LkWPw3+gwJZ zp=HB(%AOJH4-`%crTC+n5+kT!IGT!NyrAXN2;v?UQhXIVQ_RdRsk zt7)a785$60eozZD-K{*Ao=QpXW4U zctdj3lL#%)Sn5zX_8gH$AY|ArA^$JN7IWAv2&${tE}XMD4weNbjM&3mbc_UnMGJ^3 zdc9dv|8z;xoFr^+a`Ej1UYtKakvRfEsaN_Z0@y#XcB~DAYF}GCCe*sPRJb;Ac)b39fwNZizo+{dn0TuqIDoPdqxjl%vY*J}#ic4K0@P zHWDG`9ppTV5S_jT6x8?%;FI0&|A%p~2K&$@_FppGV`)-m1@TN+n?^@d-xU$eahz`= z=?U7}&!N;$ay+M`!-{HmqSj^SXX%g6Kj=@}@6+gH_kQE?XiNi2aE>yLvu)SehAdsT zG(EhF0oMi7kLUO=!{fr?I%Je>3N_H~)3%hz63?XHq7`r7*zp}{>EmN1dAMqJS=eUb z^(gN@l|GK8i_l8-lYYZvYB_ocPTKZEcK#m!JW%`Nz4;%Q{$5HDRLI^amR|ZP?f?FN z8UJtp)A(NlsX{CHQtd&?)cut~D=N&8HUd;hz<^(_tp zg!u=Sw<>5OD<634?yU>*P)My?wDxmfNP)?c-Bl;MBdfctbUT+hz(RbfKvPN2r->Y0`^4^roZQ#F^~kWh zD^#^j{ve^$eCz((7~p970+1GhgtfS=wA}T&E&-NO?J#g-lxwI z0J87>!|xYvU~Q_|IH8qt7Qr1c{R+#)dC{GAdJNHD?*=IyPWx@VZFF}neZwl+aC4@Z zPV&%)3#M3K2?r-wgY?&E9K4cDun~KrK-+#F<&!}k-La;P=UqHc-)Y+@`m}z>LLv9- z_iU>pv@&qw39?)yJsu+2@i}jNTn(jhr$<`y8!jr^=lP9Uc{7hS>G6!XuzsWJ+gVWm z)5fRt^81Z%a(;ZDR&Om0?^jR4yARJ#tCu`be~Em51@npQ0}svT@GLx}Pc>m{M4xin zN5i){JSRf#j;{3Yc$(iY1@K)&FNN?Cd@ry)1E2loGRf1YJ@MFEj3aooAD#?)^oQqT zy7s~#pQg0mM;B}ZGvr@ZlfOepgz2AT`^~l=V=&Wr*oXk`OMK~Dm`NC$YUvVvZpNX| ze6mJrG!e)S^kq}DW8=jQOzpTzXo5&JeDp-{n2Jj z&t+2BQXa>alKzWMvIs_xo?0JlYWX;d9M_0ky0>RC9@>`Zk;M59+_QmHYC$isP)1VOVZ!uB`*50VZHS> z<%q80swuI?lUCnXK`v^27`(8p5ScbDLZHGg?9oFXr#Lrs}zgngx>-sG$zlHgD#`ttS6*}+ylFl>w%sDjK+3NLRKA&%2j!K?05jlpE zn2h96G>8|L&Mwx-e_bYS3}h!;>l~M!M&+<04HgqEzpO)ce!s8OXfo*>zu@-ra_{!? z3(12cd5c4=iB>-47`@J>Lq#X_;vM8Yek}vCncAGp80bF+wMIS|Oan1_%2{j=xfwuE_XK>@$TbYsDPBzLlB z0f!(8?AioN&irfuYR>@fKAOc2S!Wa9OCu?Wx>`IH)aRNA+E&rRN`2lUTl_zqHntg*cJYd@W z*5XS#2{M3tY&P#RNQEl(f!g))GYGP5d7Rw_@W>50GUy&2-_R?v3u@h{{fE0~ zIzmnFe9ZpN`wteL_u2e=x%1vi_XWaTxu0~;Aa|SI4H8(EMtB2p8ttED-l=E+7b$y7 zZC~dCh7IC;T<(`MLjZ|Y(DL}ZPpTX3Z-47(6UjxS1r_QAj0>c}yMpa8#HR?#myMi3xfooG5oNLls4K4r-{V!$@(*v7wtKFnPzr>WbWSE zKf8UyRB|1}5AnkH*+{K|rEV}}t*QQzna<2u{y34+eTsOUeH@E_I732C$zq}TpCj@p zY3{K;*0K9?Z$D$3D2cDP)Y;F?*~LT5G*j%wQbIl*w?JC|n5*_@8nqsHoxcR!DzcEi zbFcf4Y6nP&S6 zYhxYzMMi){ob+_7wp-Ny>WTgne-^93X=ZVW;3sGMe+wZ>zYI34`1Zj|L<}8rfvS9{z;f*8{JLDF(eTxhK!I zvp1pI*B6dvpJ&E-co9K!3)gq8+A3NtMj*h!^hDT!ca~7 zhQ&_jAH9c+V3izuSjTL0_ zV?s~mnp?^6$$2uVC>~;l5%)tg@$kXHQvp0b@!7uf6iDZ(U@!1pjlN#g`BT5!Yw0$e zy86TP!S*fdy;|Neov-`vFXVmZkCyH*jk3=BbA5*CGxG!Zn|v{Jj`}9Ng}pal4#V3l zikc4gCqIyTY(*x12(|p3wapyLAk$&nvFIB2pC48@>P=MwiHA#gN|)GhgZRV)MMrDg zfT*bRkH_0ZHa~{p*u4K8-W5q}{P`@_^Jm#`=HI)B^oO2Wd2Q)C9fG*KX)h#R#xurz z${0H_?AV(+Kd|lenTcnyt|T9Ae{9Jax>My!kGLF9^BS^h=7)SDLst88O1CIe)49WI zht@x)O6Cc3l^qWA@Zt@Yz9SElF(FCb0f@VSp5h9%F&-1zT5sg?OhkNs9@k@_hdhR|0KFQD> z#iXSmuf#_O0{Y+26wvXfpwZ3=L>$u*rOi{-^aaZbKKw9Cy-Mu%`tAv+v4tf}6`U)`Kmna3jtD)OS zlbKEC>pS;+8h=sv#q%aege6tj(I@lGlOw3w+03Yz=HJ+EcA0d(f#08h<*!^ykd)JM zlViUY$lp>_2-$UCG%p4Vs&b|y0ot#2HN!24$5Q=%@jn)IANhxz-WugkKinf_Em;|7 zZ}piQVN$r9y4zxxnOk@7@rK>q`Tg7u*nK3k;`S@b-YQ;e`EgE!-$w-M@YFrZ)*}yk z{BDEbZO*1`+Q7fj4A4yGKA(_0O{WT4_GoT-MqBAo1ps*jLdwLJwXI7}pQ9 zb*;RTFV2OpH#!$F({0g~SIr6*$qK;SKTqR0w25Bzi{*O5Jpj8FCTd4*_gZ#VyhbGW zUp$53RqvTu%#vm9@#w4H1lOz(EfXZvL5r5sqV2=ak@r8e(uA*TqE7&ePS!~PFk220 zej!ne&B-vAK;CVZ53L7VI9GN#Wl;cgvdIIx6yWXToQ=}%^M8PiZ@c7`&L?L zI$>knQ5v-Q4`MQObj;QaA?|g+Kaa2b_~#*_YJBGkZt7xf?8N_=Xwu574B1X%o4FW< zmw7tBpAtRf<42!Gfuq&%2u(4L6Zh5_E+qs3^l4jqd#iJf=!n+$;N4k0BZu*NULddU zRWDSboo;JB2W1gIVSXNc_4lL2Z&Lms1@r?btpBl-5E>6e7&L%)u*~d*e-``f7(D$a zPcOX5(e5(Zl`#OpYA;P&?d1CLX1cm9JJS#H<3)6q{xAK-{fPEvLw#ftvF%|HDD-Q$ z?fEh6Fe@{T@k%s;zU`&pdQ4GOx?aQCJ*_NpphpOM%6 zp?HVK&X8a2J@4(ot4t@|pN@te{o%C##lrm?nubv(#GN!#ZGt33>8B>gzCGqKQx6&{ zl{UUKii|pQ%&VD0wZ2NkkX-mr`|xOJka_(5J;JQFvne4$S4gg4E)1;mHoy%lxCco} z_7@)6%L>+nE)QLio--gaU~XV{(NmUBypC8oTR3N1pV7AzanXYp~L^`(wh?qa(m79W=bdAYZQsHgV677t!DyZ_?u!+&z^ z7moKNjhE3A{#P(wi7};S7~{<$&3_ngVS8t*J+eGu0Xs53f7{$j;Fv|hy;_6r9C$x^ zoUs{eFL-xs4g#goWR^*5FJcOS%k=A^V2Yg*M&OZyygds1-haQlAL>Gw?WO;@eYP1| z)BoOnf1bayPqX(uFw^T8@Fj!-TnCji_Z=|f4-%U=<7C7$tMO<#!!?N zjPA|r+vq!RIa3tmv+Lkf!&b|IfWMD_Hoyf)*nFk8W18~Bg8Z6k^GWmiq}B9?ChCoK?Y`zn+s1iVrBuq2Kk3@k>XmT z23zC_wVpU`F=-=b+va0HQ7|#i=c-k6K7I~mto;%s@iRP0DCXH%9nJpjr(JqsJ3m<9 zHP)`pJPm~6R0l8WYJ%xw@7nZAsNuRbcV7<4m{X}mpMV%!j$qHBYtI+;NL(^Y8r^lYzqW|)Vv-z+3Ls;j_;=?73yax47iBGN+X2E{l<95trsS%# z12VMvr`YsFhLJ3g_wslz5FmL_hx-*$Xr7^jtRMO)cuQoo86(qRKPj{F?r^jI{<<>- zOtzE*_#)4Q4CG(gQda1{&y|Gq-_knEq(AP`t~cr{qM0g-VT~ zj?PD>(qvcGte|(Ml3Kw>DPQE2&vVM>QEtW?amZlrhzU*1HcMBKEE*^aw80!9n`CHp zNxjgYBR|{8-ySsQsHmd|mK1Q#M)r^JmEHgDt3RRFvMpvCvKMoww-|N%s9;Cl*kcg$ zh$|$7e8!+elESv~<5t#@)#+))b*x37jx#6XY)}6$^Yi?*OK`ZRAJO@A3Xi#z3Syxy zr&pwu*oU&M3ps*_2y+y7hp+Z-kPZ9Q0=Kw;%U9%F2x3 zPseQ`g1ISs`u}EJz;ql6e?fDg&^sl0pzE-I=l~z?P{sbbGB##!nv=xRw9Ed2=zV?k z1G(;I-e@rf$Aqqs=e!Vl_GVCSLGylh6ScP2nf06GLn9`ZoH?C|mj?OPO0TFzD)J@3UQtV=fwq9cPzgH^`J*%vOYVmc8)K zUYeZqCPFWKd2)c~u^dAySq51vSy#@BzoT>2d-PU7_z{lYskz}l+udw(mkktLN%y;)zwz9yo5s>+m6v<2T`pLP)quuoYdDkn=t-5i15m4? z=jMdR1r`Zpf!G!zAp<)<$;hWIGmkC%C?ikp5f@Gdb1x3m@^oZtReW-Rgb-{p#YnxX z_z@hm@k^rX&ABkJ^dDKk{0nr<%!2J)m)gp+747*={2bo}M!{HmYG{K#6#ic=0si4Y zDPEQH$X^?t7>W+c3E#$omaRz_I(AQVU{1K31jlg6D)P04iLoESZD!qYJJ*>bWnpRF zTVS#Vz}Ty?%_YH^zMrl83jKyRWTOQbU;_ZlK+k260lklID0)n2iv!LYArpcMbY0n_ zI+q&>EL~D$Ud9jQFm5-IE-1a#=soqkiTg@gYBQNi)_|vvB=MLvnKN?h?=CHOZB8 z7)v?HeU;!9b%|%)XV&iCcDoxqXXat?i+_y09o=|dY+KC&+u_)_UrWeOw6}M-i#$Y= z6I(%eFp=WOz3>TS;po$}q3i6=&TDj>?z1;Eo|lu;ZFS7=*srrclly5+>$^r*9^I`; zp^$I&p=fJ<`Y#z2k7kmBU6LRTmUU^65v)7?5)qMH*^~66Og^4ppEbGg!HKJS`3S6x z*n7*krtP|*PgjY(!KOt0yX&3z5ZCEda=l#6B938~O&Y4}2Z}p8K83@aO(yUxM#S9( zJjy`k(5rL&wQ}t!7{C3DV0`4LK=b+TZO)UH$wT4?1P9$Z%Aa@+aOHFPni(VpnN(CY z{s(eyl2R(zmrFHVh)Ps#Ff@ansn|l#;k) zpXP`T6hte}@Yy`k+bFGE~BLBkwB9PWzvfq%M`^w1@o7)%+g9?;GoPEcZpa`{y4(mgc;g{yx(4 zx0e^uyCTm=Yu%*O2s5<>QX*aVYG;Az1XY^IZNYiRZ?exCwTmkd~!c ztivN4qw6cWt%&71bQ9g2pMIb7yYY*6u8~)Pd~d{7H+|pdg2dpO*ov}MeOH_#Y&Glf z_yMyQ%U?|!4nDC>Xnt|5=aQ<}*CUc=gV3sYx#@dU)_oj_=Rz4f!4lPpn|i6-vwIb2 zKPVg5$O-AN>%YL?8~czDST+_x9*emREJ+sn@JNRh0!d2RoY%P8aYbTOFG3`?1^t!V z*;ScCIgeoX@^_q;Jl!k3I$a*=bQyVGlvYMwtG`7=^S28HQ=>=5FE7Qb5T7z26hAc( zTc!C{c{-xBdFTLvVbJI?GsXcGd8B~i-_}v4|X82xuBhaWc{fbi`(KmWb=k*&h^?Rl6 z0xlsS&p#SJzchA!zs&gwnnNU)iYr0u`5xX8vu|4=n?EN`nyeL;RCuH7;BKn}v(eJL zuvQRIuR_2P&yf}GdlK%yI_Ug< zGmj3%{UktO-K%H+80Uqa#sEqVl;($fljhp?kuQDxO8W5HOT}1IFwx@(7Orc6j1+;{ z>xG;vd1S48`HZtFku*u391A2a<@NK6ww-t$dMdWFX;atPn^cGG3Y4!7_=m6VyS-^c z&u*(?KIMzb#1$~tr!$w)iT{DAjA`E?()k|T?Tv2Rndl-|u7mu_?C)Y3ceC8M$`hkv zW<_i}4^pWe_#%DAK4oKr!O*m^YxM1(nmg%lKMr~qpWe11wpu-O5JPmSP1u$iN00J4 zx^FpJ-#>rE)be#R3uo{B9&F6&S}|wB)NhttN=$OEGfn`fx3A;m#- zeb?x&LJZJd2Zhgo7wgrYx~M?K%E7ZYh|yz(Na38g4+T-v1`8aLkw4Vey6pEtJfbtK zpgNI1I}qpoOWQ1TNg##`Z&-o4Z+J2-$Rh)@Au+lVQ%k5ZbtTF)gHH=jnZT3p!9&_c z$6Ac%YR8hz&L`2JTyM=$dRDkED`@U2{yWdSvO1Csfz+}3R@Q61RBa~J*S+i>aEGWgA=SDn9}7cpTuU~6G1c<#W}Qa-+*InORaCq70S$7Z)SW<6pf%_~6SA1+%N-IdFx z#{Y1WMyw(bWwtY<3ITf9q@=-QCysv?1f(Bx*AqK#D9qYwCaG-Mh%=NQax+JDXMOy_ zf?)Y){@NQr5PdR&Wbkb@C3LLk-}{wsC=2gE0#jCxAVE!dI3%J=6B&yVXY3a9(;eV# zctK@sy_)+;5|1GbTg)Okm+k0V5&@DL%@>`wL$^w?J$PMHcRoGBrJlo6E~K%jLF+4# z{P*RuN|BuOY_S)aQ}oVK?r!sn*~5*=qZzqrb5AY|O}F$V>%Gd^Kj?b1f6(A2HWNH9 z>E@#f$?~s9uSExS_t(nXz1Y>k_^myHrgHVeAs_RNl8G+4xlky>TW^u%D$^x!zZa{YI#~zs?1QZS zz4HRolm4TFx=Or{269aSUP+7P$s$!^N`LX8J$Pv^{27n+4q+}B6aR7=EruFslwK(u z;*A$Qw;+6A>OMNOd>bFuqkLFVWQ%LZ+27%U)Of{FPAU$gWwm#_B$AMLpm|5&Lf+(u zCrmyTUnzJG&vb@Afp36GGCh^=>~JQ2IeW$#V*1Sbm|x)t0zH92xc-qEcK|-mBoMIy{QpIxNaLEIa&4onEC?5ofuv)`H z+tV11>daDp1>$FvR54?bIl>Q=dWxT%;>z{Gg2kOQ( zbLoLu9Okb*8)9`_ck+S&3zj;`(tjvAwTS2KnY{UIh zL~;~Pc#e~Nt3wL{oCJSk4yhF9?IA-8QWe@)4XBbdS_j?z4tC?Z$iGtyRTi}4Pg#%k zj(wx+;l)FgiW1vHWJq)uH|PIMU(sFN!Z*pQGbeeo&WMQi=1eNsDk9I~=h6c6Gk(hZ zqb!F=nEf`J;p#aO!_~|@kQ_AY&{NCIcSxv!e-V_*<-}1X-Oo?lb_#n`SQi)OR&yVU zCUq0Dt`~c?msA$2Msskw)eX>v3a*n%>UGJIFWK|g^ZU&F;XjV)%o_-#4ANOEzRD#g0<-$9x4`}3h*0IgjhC-Nn~|vH8%?tTAlM2 ze>PhshaBT(muq(-93!MVu9v%vG7*+UWSqyK88xFPAICDGVOfFLq#m-L`y}Np-5UN(-=}tV@!*V|E%G8V7cnqIP7x0J zn7CllS2ZCBh7_bmF-u49+I4-4qs{c==uOus4fm;-4{lmb9(2jIKxkShNbE)*^3h{- zGl`a#ICOv0!>svA6rQucNeyKrp~L1p*}109(4VYFbDnTUs>J;r-Fxt448V0M(U-sx z+tF6?T}{?}_%sKRn1!FzE==|8-|s_Z?r-oNnWsWC@~rItwEwLAwuDZ(6k*MC5-D-= zuIbPJ#jb6aj?K!vZHf>O@zG@Gnbbr4;brhZD4r)5{_w&ce^VYVXfo6J<`Qje=0C(=m-NCl!xi5k9*O~IV;xN)+AOkMdG z+a8D+?v6-5V&t4bFXAQ2b0s=C6+$Vw^qjblIEJ>_dykJ84Y9^

OKQx6v*V`ZI}Ruq8N%zQjvg`% zqY4ev%d+{wUgn9NUqH^=@6REfK=1U0_40{}*jZooTck{g z`W(^zja`Iu7&ES3}G#_$;c!Oy!r2(oAOGma3Mm6NIA@`6~N%^}{o z!`7v5lYSjCSnKI~VJrfE%_x=m70!J>DLj?c>ww7XI}C}}FP0bXEw)I{_|SaNdk(5% zR%~egtPu_q65#OVzAM80?hdeHbm;!pTqyAU#e>fb;&&`B{bcebC_rfU0@gUQ{vEZ8 zrOtt>URumGcvXnCuxg_Pl0bV%V0S5+wjlZj$$Qt3F;j99573Bj9yH;}!Xh(24iicq z^hmKL1LY}n%>hYAy);9oTv~52@0>~Z>c!nph+ajGoM-(TBksGA5>LI`JO_gI!H2(g zw1^wU$!Rw8#^nXky$8ik_t&1xm*`%cJje5g=-2My3uoQM(UHH_2p2;&3d_jOJC=u* zJ9Hd7olYXJT6`yE8!2-+OxpABZU{jmH8=1fetLSYtp_yWwb8v-N9IbU`>4!Ko=6M! z2|wRcldJ>V`R$eD_6tqVP)sR!3~`24l1uAE;hB;t8+3>A21xquzHgYH2*soKol`sb zDEX!=f8CY^pUc05yEPmuGh^__vFEbsp~Vbj3h~qRUTwYEjfKnh?(g&{_K`{J@7U=n zq8=pv5=fW?>&tX=QopCrte}b>7o&gmzWHb?#U1et^yhOT>9$E!`l7pLO+MFEEWXH% zohWVA|iJk0@K>E^CxM|Ad5e{RS{yyVH8cm+e zb6I-1CwE#jlZH9Dv-AtU1rhlUpdr_@`eNvSQuEq>Pz%htoAe zA)QR_*E%`TFy3;-PELIZ5lTN$=rfEEKRLCQ5+{E1FW8)&^z<9HL;Jv8&LdXuK%Gcg zf9(t=?tkDn%#ZV0p=W>Xbc$lj)6ZBs>ZI4t_U$#g>lBb**RwNq>95_T4cbj8x@T^aC^D{m}D_W+jc5O`AFU)$Qb6uO2@h*iQ_C`!NT;AbG%fV$?$i*k~A zi(`WpBMH!6KaRyn-6f3b(nBZndrF9*J?Tbwog?!*iYAyu~`3kFL*eIv?lWeF+x49Vz4d+#Sc9@QT<4sh?;8a{Vy* zy$r^aEZG@-VC~&A*_)x@L!8asOqOD-%|l(eC^_jR_TjLa!MXh-+vXHvP}w5ML^3oa zA>m>c$U6&LedgmbrPW$l#n<}?NNbRdnei}*{I%~PD5ATr^4Hza`2?#J^TJ>QJOMw< zhhE+_&41sogjbwR3et5J$RKX3gjYFs=$kpyDuyQV7Y&V_F)x^yK5SJxQ`cYH)#F{S z>na>7vC{*{QGe|xjLcSu;7Ol1M&xgS*=^!m_dk$JYr-oXzRVE^L|$r|Owi@O24Tr$ zA4hf`i|0fYu~$+^iOQw>yVo|79UQ%qct&=PDd(QBdFe%rf=qsQ^Cy1OZ|V%H@~?>F+GhT?2=Y0j?-8$# z-lv%)?QgKC46-j6@3cQo2{^}$bbdce75Xzno!^tKpT<+guYzFwen)PZy{wnOH`0!8 z4wL@nl+?;+lgDr6hpTWdWa!hR|3SU!4C>VTNPg#Me*cT#v1LwT%L?Q%=gK)jRAt9) z6$$bcm+cIB3AW1fj061E=K`Jt2awtan^Oe)w2h3s7)vDM@**EQF)6=x)YYZp%s;hnYab;6!CC< z9nM<-{y<0JU4!|ORGajU7q3jn;)qs87APQYG^3X^ku$zg3wpt zHcZLY(iOoTqmX2B&WzfGOgDWCi`!y%wIAs`81 z6rbDcd$E&JYx&EZI8UYDWvs0^QvP0^YJhMA1Dm&5HX-=E**+$IPZ;atLXg1WPJ!9{ z0$j}>;I1djZa(C9N}dn5bowv(DaYLoeY`5a@DU<3ImDDeGAJn6}wQjJU_R8YLf7{=WnxjAJ|WGgLGgp#*xlt6`|Ng zW0nuQxqtJpV%@|v4;uh2%Ky5XfURTGOT+tt>-Qbaz`-H{jAflkS zs*0C*c2Q{zcCqcK*y~&J7yV6_&38{^Wbn%>#nvoBaun6mmFoJn1d*bZYOJ zmgHvTtl^|Lh>LErPfzYxS`cZ{hsQaCfCa8(>nr()@Y+cfb$&^_$DHWqv(kUI_8JpE z!<+cQZ;~vK0vsPRy~5aQ%Ivi=16H!t41C8~Cvm4kjkn1=1~-(9kzlHE5}I+dgl0^D zBJRe&+@c7wux!PHSDhywdmrx&0ShlcMxF!B{qS}b%K6Ffo=`k6fmXBaZLTCb_e~oN zSa#RKoH-vMgAb&w9&}9e34Vnr1V6fk&(NrT*YY~5v)}L3|7MH&g5#S zggMxBm(0QRfckj0D{(`YoV&Y~n?UTVp#P%vgz?NIg<`PpdhuVXBU3O@#MGVmM2B3Z zi$g$e&A<~Pe@jG!_HlZc{>)G*KE24%dkwxSCyS>vxd@{+{X{l>k5(Kwo`?c714_lg zrCHQyfHzWSVImEb+uPP}yv4Ohi6O9GZY54ZexPL9%tg&IPh!!9d&fo_bN9)YHPY#N zw{3ll^h;~uEi=LSfqjoXll@~dVKv@}ec#Qnb$y5a-ddQ|UvYNlr)PI@UzTJL_j+c1 zGxFhHmN05~E6g|f(1sq_SS)zi4k9FCPX3pICh}$;3$lNC^I$e;b@oSt%-dpOEyFQI zx~X#6LFA=ej2f+XY@IdgWvYk;NuF>tw;j|=Vq(-M?qk-KsYUeWtb25ikH?VW2mN@% zaZc_yfp*a;%)=~zYxwjTpEUEA0>Ft7t8ISAH|O3@i)mYeUMk-*{T5wapfl%yMeFwv zd~!fjwo(TSwm#qvAEWMTB`>BL@rqx*H)9S;xmN&@?Ws*oH#d)-7W7Mf{+u z_8_l63Xr=f$mjIuley=4I;53N$Qe))^K?iDdU*Yx*gk?}fo%ZO@c=#HLy^|H0O9VW zf^zQpNWEte;@8GEv?%!v&63avsh%_=YE1y7s37y zJgB)d_>cG7<$GKBWVPtE8%lOHRDn7<2y}YcZI-i4p~sMI(o?)&UCwYjxw)22Vv8~D zwnJIbJwy>L4Nr~k=|=q59`XE+-zHf28APV6_aEeDzF>m7&(aYpZbeM)J)N|aB9z`i zpTDY?ftt)4AlVUhE&RDaKuSO3;#XshTFldMy%n@`JJ1KY%Y@TBsv@* z{Cp#w>tExo+(=5wEAtb_;L*WkojiKBC_mGwtPpMRKAD zQL)Oh&tQM4iLg9E*eG^yOzb)Cw~DbAv09>R2M~>w)+suZb{Tm)(MnZw5<0{quVXB} z%xJKfnBYKGw$j38!D?{3u4}YC-$TzHKXlMpVGDd9vXW>EC6R#e7KL zpRpg@{3mkbA;TJy&#Tlz612HZWq80a8`zMOOwW2ZM?NkfGm&754`m z1vE{n6xu2teG8wMO<>l_C6-QbY<@0k1hG@pQJ;FcY5eN|@mVMK7Y}cNKi8~(Q?Rts zku3Bq@@)ZSZdzo?$n+SUip#D{(>179|2qT^i+`cCXm^}!+o63l@+{L}DGg$a6%@S@-y9AgpZ?>43!!`mb8N)cYS3PgG_dc z>qqP4+exH_nU3X@#T@yX+!J<=Gk(Oy!Nl33wFDNdn#0Z8)N5Hx+t(!Pauw68nM?`7tB=E_o6_#atT zwzBEVTuFO3omKR>@^>^)qX;vc&;^IRhJgdHa$4P%dA>+**`~1jX%`|39tI)=oCHii z!B>=iU-z>hc#P;%chxTh6L!@XINuw7>*B*4%jlYc2JjV;GKcRGrt(`2gWDSRwgDO; z5YY4lc#kjUJys@lm2ejJu$3=PM$5OXRcY-^$)h%X|$I5p9$Nru4O~u6Jt}ffLc761RK3qyO zudqByl0q+vr`54-Wjl6$u+~Js*BTGCtKrFSS${OV+~>3Rx2)QFSC&b+S1iw^gt@x-mi?-`FqyJK{Qef*{#9fG1cm}K*#r- z)nxkAHbw@3?Ibg3n|TC1n`1@2vLaSmh<&(r>)I_l*LB;PUT@{Qd=(hBj=ehe#?B8@ zy;=Y4@%1(deoOU*NG5SX2vBF@+=&90=n3Net77k&-azD7AWKNyC~;_FPu6{eV7~i$ zjLcz);4yf=i%BRx4=a!g1QIQOnwYQHsgm~JUEWM|t#}By#=#4T06WmJ;~Orau`|G! zzrc;od1k{vEtkCKrb5c^Z*RW|_%Obk@(XL#3N%6t%{+$@g~KpI&6Dz*y-pzrQlW!@ zk$hA*M+#w6rO;@~w{}CUY3G{Qy5lyl-MDtc&UL}#Hg;QQ{sbp^6adAxk3IC5s@?kb zGN-sh>iSw<5PK)Kl?OXy$hBK#bO6$Ucdj{ZohfG|VFYiHv)9kf)5*TSt!*T$RA5rC zh~Q>|Gmq6I_{!H3nAj?5H2#L!a@;arshmMj|Iz~YOdFoA0WE6xn*XIQ&r*D3xtWq7 zU)A@&=XUK1~+h5`S`dj-P_Yt%E%k8wk{qTDwt(g%-Y~@j%{f$%T97R2v`&dq(bI+ILB0s;>7W&@kMqBEUDvimdJirgvZFmwa?3v!ZgIZejWBy|l0Xyu#bFPym} zNhtIf6|;gUZK8X`&jGL&)+i~Id9R*2q4H1swSSa9nB4`K-k@(7JDYICzIsr2u?4SH z+QmC0X4fV3*F7%HXD^i@$3m#?{KRGl@h#>dTvQ}e?P(Lzb#Z$9Jv};k6I)D$Vm};j zkVBy4ZfAm1r3!m5yZ%;<-=)riR&x#CQn%R2JKqh>tcYVx`agvq^jN-|mwziX#Qsg} z^PSKxFu|{4KiN&HD`z>w2MrySs_v0QzRFbQT+*I7b^*7gEnRK%3<>f&V-0Wo-&lEJ zw+KZ~kuB-xVnsP}LpaFehkZeLPpqEG1v&$<{=4H=XLPPL0NN*l>pH{Xgg~!UB;N6iJ78)8so19%;mI`?*-=f zocbuGEeqc+@LdgRB=FR7;;9NPin6aaOm7gOA0hT_R2B(HaF->ipi(H3WQPzUknNSF zUFlS_>*(BvYsjJl;(4Ed4yIEXd(tkj$fIJBh$@dNAV(9x=jE@JtSw`y{re{|V&t}{Qy4zmdiso}L z=OSVg-a?QNitn=tt2YP2uCz=qwfsNQ*)8lg+Zje?w_|MTa%S%O*<{SrFbdrIj(u&e z2aR0aiJV9y3;n9UTP#Zxb9zSS2^}LL-s`ac|2@_R^05Q!=oQg*riTzh2Mbh}Pf6}k zR>H#5Y5VcpP09TK)c!KBeP+M*AV?$VJAAbj84j+^v_Co)r6BnZ>L8R3wVnuz3HCQs z@sRK@@y@zTuoowTLn0178^&DX$(t6F{2e%Wpd;qZ2{!799(gMEcR|^LVEF^ z9on%fKv;bd;>>Z_)#}=8NX}D1+G1|t6a#Csn>>woM)|UtMGY_UMQ{CbpBu3Dk=rrD zt~mZXeMUoapFRmNlKb=-{r9<&dHjn&7Z{hA$ivQlH?tp8syGHh0z2$>_2;p6GbV=z zlUQ(xs|_V%dV;JGd$gJ;lrYscC4GH<%_TnD12H?bxtV3*cg%sMRyAKI{zNxS=H zGvI&pew0$(LeDE?R^sk~(e`B~p=;ZNODtO-XFY$Ly`EY0^<)Mp^YeuYk!&qYIXc>% zx%zY1@99lho0_2f8-mzzxQEYhY=ckDl)wHb;=TuA*G?X*)Qdic2xeO@=r@!9h6sLL z^@}4^cAE#OAeSKzmkLiK?OmAczSbq_1A*KlX^qEzO(dkfS2z1BNz~hpI_2)1Q6w7vdX*Xkr_JaS6N64^7O^2PwnktlP^{2q`^WB53h)3r7lJ9KoE%XPbe) z&e*S6@(q$lIC|@~0V3ckYxo%VkRy9{C{hxg!~L~NiMnEnEg7wCyAajg9~my@Lq^}r zcAb(#4typpLy}p*YJ#GfA+>{UTSyG+Y)A+HV{|^CT!WqRVs5TM#{B+;b!) z9&&W17#tmUeFCrap>4UZ#{?0!&t?@RSp&IFnSs~(`)7Y8Qb?g}M|@&kvY;XloL&G_ zz<%Tj;9~1qBrb_o^Apr*U87V9&x|h50|4_mGSC}2&wTs8-pPU5=HLE>lYJM~TvMt2 zh3Su(^L~V?=N6G`7lLBt7g=?IC$s7&vg!i&*ev@O;2LsAi22-No_rK(vcmLzpdCNs zUeG8EM@Vp;9_L`YP>hgWt|qwM0nu5k7oKsa>7P3ivS5XDEzK}zvaat9S0R^rz|#yw zqV%EFz>N9v4-yH~nj8<@Rk7uA4gcA>N&-?kky7z3nnx&;B$KVl+bD{@kqeCkULWv6 zAje<1*-X)|(KqsiDJnO|Omsy73Ap_in})-gyO(zL0n5(i$-karF|rqGYq*o7yVeu{ zNB6Uzb$GhPJi#J)UtVO@#mjLvc9<(U_4m_RE9Wz}(gtL!Xf$urn><$xq1&d~M+_H6YI8LLP)sjX%*W#FEU{I&AFgNq-b-J||2cthm!UK484 z!{-o&Q^<^8%!SUaNN0!7}&AY7rtAuwVe3I@s@ds_T@uvxKPru=T0Oqd&svv5d9)Q zT(~^4>JXL}n6X0gZ8{Yc<|O!LsJAtV8d1GF>Dl>-;$(lMq>N z4n6wX)l;^}H6OBDmJb4z74`*yE+x>Rkia3>?bQiRFRbi)1G?tbr`U244#(hfk~(!# zCq|Tyih;9OMk$pGy2LcNc7KuJXC&ar68tH~M6oeQ5ICx&B6*ENQN0QMBaz3z=u3fgGBEkHQ}P~XO)5xbptGHU4xvgYIm@Z?tyGCPu=I4Q z43*pxqmpr_&MG;wqGWWk-YH2+Nitk=nXK??magG3zIX(1D!MCqhtuieId+020$XWv z=oMBZ526bx8IXL+>9nta5_VeM@3iV8!(1-I+#HNRR730az|*768XGiKmjd*nOM|BBvxT zPkz!M0)QCy?2!O3?-0L5errjV`YwW7y^LZ_YTWd_%re;5*dR+HUCVehPefWZ?$z{B zuK$jRK!4pYWr1*dSC@YizNRuU{TK!zPs(2N=@YVIdEpO4-;uYJ0Et#}&qI<2=!@`M z_SHye(+#v~=2oz25at+!vLF%5Qm5C*U$e#w<9T0NYB9&XV|iLDaIGuv%6N-bM>$`_Mw4tJYN z_p0D^#QgHHDeM^gz5x5ftn)xg_G{`8rXXGvpL6vxc`*H$W9p?7)6u<`O|P#1r9m2~ zE6OUCJ?2SiY!`n?_y|cI;hjD)1-rjU_E2!;)u-dQvR=)f`#_ z-2nNgbLe`>zT^`doaoA5D3M0jgC8TEa-fRFCP($TQCch<> z-j!L!YuzVy^6lflvJIAT)f_Tq089L5_4v(lUHC_fIs59tegK;VBGSjY{tB~RhD9YG zP%}NRtviY51%#x|4-mFLC~$6eem8?n(Z<_kX~l40;X*K$jblk8n&gR?JhLqIe@5+?Igz4^a88^ z0j-fsRT${w48%Vn4v=kyn77=kp=zv0i5Xs_JG>qx{<_6rU!-Skia%njPL>3}?FEm} zZy*sltf5+YxFrzXl4lM?aKq+>1jF*cIT&iegJ>d;iw;B7T6bbNWFCS&!3fFK!(D0y zo)j)>5UuEV8#i*oNjU!bzQNb|Yr8T2tZN5XN5)II7XBFg>%b1&>Er6ng}=9pbR#O= z`T9PaAHM23GH*7L{@UIUsLrMNwd8{%C%>ez8rIr5qU!-T(XJdQMA|&baY&Ri>ir;`*u>C$uMX#xyz|WlkR3D{Q*_w~}mZF}E$C1g2 zN({Trnw`QQEgAiD3C+2`f@+d`dGg5`!lZvw33Qs<%-!n_t9!S--D;98(^{LIsYw2R+2DKpq-%&z#sAn8g$WheSdBlf8p| zG~^UUboTnkTWO(pf0`=`=Dilk2_L6yo6(+`pbMcZ6bS3Nflf1uQETvY9xPNWby9!3 zPbT1<4_SY(s}#*SF@Qo})Xh*N#lYoBGGnj4%(tDsHx~fB4Cx-V|MgL6Do&{k6poJ^ z58w11`^TR?IOoNakwWS_7FPl;eMFwUF-hoD#x-Z_c$tTNyQ{yT6D%a5 zD(>aDh}eKC)p&k+F9c!EiL*poOvAyN7$bZY-F?Wcak_+J#jSmWX^sCz{v7i=aTzef zR&xrhRQJ)$qn*HviX5y$%446JKT$u(?U$`!9WCD)z#`1GR#vh;8OTYU2BqIv-!NUt zyESz<$gz1xkfZL@L4{5)@cO%QbUPJ?a%ElHOiW_VGc6wa zekvg#^FW;hqNJmb*kVHzbm@iH`BY8RJNw?r)DkVJE%hP zX3S9yLnI1uBzKrao(K%UTlSH;ixz0p6RkV^bMa||Iz3+g3B$;w4i;*&a*I{SykMKL zpPeC-36>!pB=GKJxo*lMcX6A}ijI~scU*C{}-JmBq z=89jnwGD~)czV557xzE@ebd7-n6L=@LMLIC$Rr8I7U==6j^tF5S?<%)D7g5z7@h z=9|eVy@BS(X(Hf}P91Y}N^q;lrsOlgjKfWkb?ru5&y3XkH)6$}Z`)mW7>VPocc=Sn>0^XAR@^aO zst2jh*Ebv}-f-CrrHC@&{YF)LqQg@G`JGwc7iqwL%D$88b@Mw)fiy(_&IC+3%dXwv zmX%?vkmLNTP0Ys+2;9z(Q}MMr($BSr8m#%yVrTUS#GW_QQ?{vzeeFumR%BI&_A+28 z8YXom&_h=p_Hze8&XyXFm3!s@vRaqVJd6$Fb!Fo|tZR1(-_4Em=zP`fPka5k{y*Cj zeGv=JqYe&Q)QFg<(xL@DY;M{HRPE_iT^Thp!_nwOqwPt2uUx){)!S;j0zk|3Kt5!XFJS^zDiwbH{WxKradXGYHwCN9PW{ zKJr9}M@+)&{PTzSY8%6kq~Db9>fFq-81}JSzM0|4W5@o`^T$1AYU@6e70!GJesehU z=njyJaD^!q-gb=WNU2__`xwm1hmm@=3TvTU=OJONydQ_~GOKmN)?ytS|Atj%`Js|F z^S=ot%7)9`lOYp!>_>bL3f){SLU zR+aj%{P+3~Qh&Suk`-vWl~WJ9(O=5JeT$i%X=ujL8RaX|8#lvVb0~E5q`htCCqSYyzo6s&`iyB>WY*)x)3#V-V%^L`YqCA` z$sA^$^s4NB>NUG8m$3^=%&+;(_NuT1+YGa8yZ`DYsX60gi;Gq>0ZjofICpv^r6KmP zXCxMx2_43(_|M}V*KxdSJB*jp$#|Ld-7pJ$-|pb=UDQD5^Z+Y@!vW?SsmZCA>^xTU zu-UO8Uesy|HEk|#`o2%o56ASC_q9Ij(|2{>6>_<7yZ@SldOaXl3I#Qf;<9H~tl06_ z$_b7{S`ET7?PHPCVnzZ1$Qj^3;p!79V$9^Z*i3Rc=C#Szo^iE`?f(eo;tD}Zf+eLU zk0MBsKXufJGq?M%(jQ~GJjO|a-19egLJM5nr}}(#D;L#eYAGe=?>tn+dmB z%-<~PDua0uaQj)$bLmg;UuYf%K$%lNX*-_7b@_3g+mWod}7MRO!2Yu_ruE^l;UIsFIZna=X=-@x&&s-|?PoX0ju=2mxKVIuQXgU19*WW&s z{tud9`~NcjU*TCS^>26Je`WvmtrJY}U1a9c2Jn?8?D|iq1SG*K$2*|jLRTGDzq9o> zLuC9dPNSdge|#$|cAG<`{xP@N`E}WEeZ4?n?W+-pT#Wwpx*csXcj1cy)Gl|$tPpGZ z6~~feL~M!KB&*T~Eh{xHcWOLA4aytFx|PfxRF1pO%5R{}8XsI&K?QS>B?pNQ$+Kv4ueZ4N65S7rNs8N-1QqNZWGqd zPDgm?aYb}C4-KS5c}UzTyX61AHbIL+(|Zn(WMpZ5X7wyVuuK0gL_By8sn=o6EM3cj z4MSf$`wyC#U)}_rJDwO6N|&EP@8(60-QA_ilGmYzYsct+P_kM|S?75e781&{DYW3! z@a+>$y)ANGNSl)0fp!F-@r8J=cK16%M*Qs@qs=`Wsnz~E|6#D8 zOPsF@q-Hi_L-yOoSbq~lEI*&K(uy6jDWXKLizUCcb%_4R*ZkrQ(n0cI3y;Qxe1QzJ zrQdsX3(ebZDe(u%Ht$1`c||_t)Bcp(xCiXwiJp3xH^fSp{$;tYo~7=SLiN9!i$Not zNn8Ecs6NL{9M%_`9+U285iP1AUJW_~GG$axW%f|@}mkvfuv4JBSK86f}0T8W?=aiZA-1N-M6 zR=XyAPR$P|`fJHaMI6b?B^6R>(90zQ`FGOKu*GVwx}T`Z$yj z2Z3i*;>M}0;?Z5wi0v>7n7Fw2PN#$y7{Vo&)SQPKzmZw+eTq+5zFq72%dlWu%^$d{CY(A#@IH>1`Q!>vXKuO? z00@j5=gtNXzS+)PQjbD=s&{Lq`NICXiTtdYmYd_RgZ$8ZdQ(n19*sB*a3<(*SF2h2 z1AAMJlk*)0Yc(%AB?S(5wVEfLl0t{GTFqRiq$p{*s+E&ybB|Nl!{Mmb*^7mV%ymwA zujD~?&QiJBDeRp*G*ft%7KTfTi3y(51IPvB(_jQ;Nr%5$O+B2L`fiWRILA!7Ubtq7 z4~k6vLd$AERSx`gK11W_o7vCYY zDC&WgEn>#Pnr|tAhAHHp*Qw%b{ODSdiXJ`r=bu5cje>aLKju^)4pT{0NwZnLZps%z zG)3kO7+H8lhH1|$8X6)njlFt_Su#!nY@Pdf&VA7T2=Aet!Fx5;{gZJT&h*&0rbL*w^^7Kq&E zzgeN3JFChYCzdB4gOP;>8qM)Hc7kX7z#HO7fON$X!YC(EiR>hhtfkuj!VbIQkA?g% zG*$VCL)~uPMMQ_-PiP>0faq7k9f$z20fOPv%;6BGe%Clh-&zqzA0q{%Lvls!09Bzp zJs#;%l9utz=TamDK?H)Cf0sk5sSB8m^bZjWK4@>s(P>J@sZ;o9{(4Qeec|ozWWS@d zY`Wbhu*$O1_&Ib*wmtU$LI1Z(H>2n#oBjdR_U+Pt96ta5qyGug#eb*&t1bP9#F+6nR2ckl9B&)TcoymSJ#ib67#oMyK_fyj4wCRWIszM@<|>(an6;^pKJ^NKl|N$ z3F6*`em+^zASK>eOd^ z&Gi32neQ^MBB`+`(_Ugt_i*W7LrIA;cvqtgYG(Sbi5!}qeq(*j%-mDLLxSb0Fn5SQ z4JEEYRHi3g;-7z!ujcy`BkL*2_0ONoQ@rHML?OUe@5yp-o8PjpvmT+uu)I+DvdOOm z%HNvKEy~OC0_E?{#9~{L{$H040?}`|h^%=4$i*P`Oyz(t((!isMCdCNd&iuC{K@i2 zXZ%63A$5W$pS;;_ZJmAXulWhfseCh|@Idl|Q`+HBIq|qv zf}_zRHO##7>DV zBQ}orY5WZ@Ar$S0Pp%`k81C>n{Yt8Mvno*j>5R9kMeY$_$Bcz9WvmW*>CkrJbQ&aU zPPkI}Q}#Ewq;8WSAdL^;>J!OI*xtw$D7i6NYRnaK=F55UGV=+4BK1y2*e>I_8eg@K zsFsZ+F+Izy87m2fPtL)BI~hQ-PhI6;n3vEnKv;TSLd){c*m!2epF?AsI6>zS&(|=< zP^`9Ojz!=f?vmkoqg9m_=+hm<`=Tib-b6qbs~Jb|hoH6*L0VPbGHIGL3CLElSNar( zFC=&F1PNQdc~V&P)3~Z=GgdOW_T>#GzEzj+o;-w@yPjCsk=22kS-uk^w`5v1oS4Ji zNmPhcZ_+&1X--S+VM-J0DJo)|ITKlIRX`~Xl%A#B8qEuTAq&TlGFl3aDt3dmOXgsE z%iCn;5$XiXZz$pEzaSfi`{nTjwT-J1cVeQoVj@QlN%z08UZ%l^v&3fhFIo=am@CGB zG>!(osE+Ll5kn~t?0si?bb_6f*6@+_hsG<9lM?J_CB}KV1 z$-(`3?t{iVf?ur*n2m@S@PcGxU{`ttog-)_d?aT}|;WEw0e{`Rtsk?OYQV=jv~N z?R^X?WqE*_m&#*-GV55j+guNffc(Rsf`RGG|0=b3eW+fLLq<(eey>5 z>XplMjr_H8Pg*dD)~+t8sKQs!yqE#)Rvsk(2-~W`9$O|;dtUsR<9R@8RLKMzC*)hD z#FrY3u+1LxrSSqC)k1?tmE0`CC3=gF6)YLIJiq98p+Fu#k&NJ#>h(9+4YrLB z;&h7ByZ&9K&&bJ{d@$awgSKBN+s6JYrW7^230pX=?!U@iiji{1V+%W_4Ei11vkJ40^pG#TrF z<^N@bxiqYYJRQ)!9t(YrqtKFyn3HBW@Hw9+>VmqIl1(NmY0Mg7dk55w5QEb!-L9ED zk=vfY{wJ&13pCqDUizbQ>sES(ZgQ_ufhlrS$!^lM{`tf0M}4Wp5vHkQl+EBv3D#Jc z0{@oRx-8tn-!j1g4f4{Li|4}y3hdSa%3o&w&q2ipKvS>3t=yc=f~(xb1n~5G*7xh& z@2QJHqMUDqB$=Fn;r-QWv#TP1YDVcnRODS5WX zOuJO#8k>D7f=q8n@j|=qE7|P*1KUIIBs3dha5WN@OD9%3*=?V0u}`|*#+%`X zr57bZEV3rt+e()qfAIZK`D!jWtPYj0_1||o%i(R7T1_D)lC8(^ohC)J_Pq#?szkUq z5VcCCf`4Nfq?cQNyR~N&)iOWVqWRIaXl$lO^VBuYBsC;kXNr}BGBh`3W=g26#RQu{ z-P~%GWhR)Zat~F8*KM(p?f&3qVU2=N`6{Nks%%SD`MXmpc#$;NcMF2L+GqGO`HF^b zAbWcma`RQPQ=ZxT;zYmx+}ZNa4Q>sq}HJ_E94e#TzZz?J5MC)Yt7t zY3j<+?f4a_l6|Nm2N^Q2L43CJdeG{@0ilzp;4M+=ml?>&3?|#1)E`jyvfat>bKtTn zGT4kJ*4$p|85zHm)Y_2|;@`SXfND66!IT#?>${nDB@*c)Z~rITimwS?gJgu@o`;qp zxRiY&RIci|`!lyIydeYWg8c9c(;s*PuunRk(sZ+bepmne^9J`1p9vKm4>cWJ-pnK1 z7z9WtmH(4{sZE5uxq5|{q*K2kg3xugRl7M}62k z_phQs@n$6(Kef3{UnMFSV;JAxCi4UW$`Ljl_DzvutW3Q+<;*`Blx0=NRBR*@eamd9 zW-Yw^pS_PMSJC9qs#p8~%$T~ySWkcL@M>Rpo4c>4Io7%W6>&@e8rhn?vPq`J+Dyt;x+E3E!7jGztt}TZU36o4@vB zz9T~p7|d&U^^EMFdm8^gn8!Yj$BG?%9&Z!!dpNrWXd7D(_ts`}mdI(jkc}up$1G2s z3=EbJ2bcP5#YaB4ug$g}A6kmb-N*UPJ-t$X8Ni;)QlP=GKhjcis3$Ihr#{O^BOX}L z7WoY7B?}0Wc(Za5!zM~jXLC?>az0)`wlwA?5wvpuX}P~nk_uGuXhs3xw522ogGaAA zxAVeba!`Ihe z`yI`K@$scxCFknXkA3_PoIpv{crLIuI>G=gqSrM92HArFE$9ly#+RA{GO*Sjjp~c$ zv2R@3t2(wVYg6KkCkD^p0si~@(q?eEf9}z;9M}76|HOEMZ>;y%74ZS6a>ou&%*YMn z(4AJCoM#1MpG!oQ;wDg12>bws%5N=T>y4$&u>ScoxC=j=DmVa;Z9)vyTRmck98Cp? zuqdk26palZrI4 zefr?Qz*S`H;oV-}YW7&D7Fup&J0RoFAML9c_+I2=QmIBZfL!*|%koo(sb=K4Ke;L~ z^5jB{FC%QNZWtlZ@kmbIl?XsQH~TB#(+ zc-G(KMu~E!3xUZtxfpL(k?Ic<8%2+@TTk*0{%IAHFifGELDpEzvUktET$q$#gJyH* zx3ttdoc`Kxbm4-cyc>CdyxITDCQ9%$6;&n9SK}E|1rb-b(qFrYFHTnRR&yoCYjurk z;Q4D`f#PIXR+z4a`@Y4{v~Rmfx7B@jRhOHIw^nhQfr1#`w^f{XMd2&`$viQz#5n3D zgQUyc^{r0aN*=>ek}E2VPmXoH<$NWK+7B6Oc;Byv`!#HtwGi zdQx_iT$e`d(aRV*$uXnlk{`b36*Bd@HTFHL;eE*ihZ02vC8qdHK#YcXK4(OfEwApo z!<;H5(wklx{q+ufuZ_8>t_jgR zIOrB+#^p}&Rv})pSl<^U3wz>*eBbc$FDJd3>aN^TBal0jLE-N;MF5cEpqbqUAp&w1 zJ-jaxv6X#LiO<{%-3T4#g(dv9)lB5KMvbOMQ?n}eae6iS5wZV0T;aj5B(JP$6RUHx@~AUJ2RmrH8+ zVLo7I!03f_B02KqD}-WcJTJe5)KO5u2%#lmhcRMxPk=f?c>)F-_Fj~$`vQlCzxEzx zZ|!gn3t9RR?09K^x2%QnvjEBnDBzE%D3%aVbrBAoz`aADQ6Ot?6d*xH2(wyePvR=` z4^CRxN6U7<@B1=xNJqxN5+N@HRGc0xK^tPXg$CjD=3jqQ1WqV^zs}WjP}@qP2&-X) z5UPnT*g+0PAC1ltm-T%4C?#eg?2Dr{LN9Vawr)pogs;F~_bd9XsM&j>WTN0TG<9ev zcUd9&myoPzM@R%N`WOGs!wQZJ;kbDe4Dr;f(RuG(FoM#*Fh85YPyF}&6$nGIG;*bo z?U}#2oHGIcFCSJ?ub@lNA43`9G~SKR$}+p z4H4{-H79i*7BmIUmf?UuPlV z8Ze?}Nrrz#6G3I>8@yN!!4gUNsrj6CnzKt!8F-AM>uj%Eo`ORNYK`$L6AG`|EX&WpcDf{Iil29e1-PyGYLN9g@ycGw*8i98%5 z^aXEopGA&O_={XW_8zjR(|=J2mpl5b2-lX}_~nZ*cm<-Q*i~z){|8jZ){El9OA#y? zXc8Qv@kV3U(4ebI224IYg+Cc_Byfs4FQ;(g?SlGZwZ23$g#^ncB24NM zA2RkK_X!!FT`wMh5fY)L@jFjm%ZB2vtLV;2c)-`w_$r65EgBeMP5>PF!6LSqGX)&? zN7YSPKi))nd0+gtTGqX^Pf&8+=O?MFc8MncuNA}qndcv}JM-APvF(-_o6zn;?k(bD z!5$KKC;SJhiD3ORABFw`qcdTZj)z5#n9a*oj=Mo<`#pR(s`lgsz45E0s01@KSZ=VH zWViMx-Et{oYJmMf`I1=^om?(baT=nGR|jU6S-!$NQy}=n#{3#SX4Ulr6z}K7(zD(V z#yEK0WQId+>b$X2+A8RXc6hTu>8D{F{N?s+9vuo35JcEk?_>^^zP^Ut(|_%-zJfne zV&0(d<>)!F(D61!iuzL>lyOY_6av&*#}E*RC%(Pf5exhf5ArM)NCG3d$CQZ_y7EGH zQL$x}?{?wuyfyBluNJV6lSJ}%Z|fM z0w_HB$UZlSX-NxN6QTPr@6e8GYN*{GA%X@-2~6`d5zpYfnF!G!5bN9r_Vd?Kf)sv?j**%xlb5 z?sEN9(r^utwWLDw8K!8J8HWkovga3weG(KRc5*Ikk%$@^Noqh%o#XCd%r_8h`4U!v z$xSbZ7=IQl|9s|>U}C)MHX{Sr2J;nc>17&fHNU4nrW}lYKK%nd=iEA4JH^2T&3{Z*TLs z`pa2eGn9x=1nhYZI4$Nh=BJuW+CHtzmKRxtyk|z*-*r&?cK@|Ox!c24p#r%`%q=o* zVX>wy=0#DrnMiwQJmEK_M%H^V;!c!ka{+|w{1>9Oy&?W?Ipbun;1~+%9Hn|Xe@WJ; z#mQBwStX?IopV(ex90|6=#}aM6Dl7BF0*lbvcj4>(g|IxD2Ama(y!eHzzMbdCm76# zNtP2Am3c7eiUVh}Y>E&N?lu>}h~;l?2Z4-eg@q@gn2hEOP^z;+vgENJ0+<0hj{p1ZJdG1Gfg(DVpWFYo$GmTaV zv!B9j>QEH1#GdD>66--y9|KELnmV2Zl=BoPAn7pL*@t;e0e|v@dx?ZQn%x&mT3q+t zRIhp%4v-&0jOKt*_6P8`iA7*0U&Q?cp+gy0A@Ihv7kIt%BK#$>_v~(vocS(y_bOlK zPn0pUjCgD{|G>fv5`k?wrqw*f?* z&;MiZec+?Ks{H?lNlH_KXa~iTyndQ;L7a%lltw zuh}utR}8b+Hnl-gqv2*hf7$lF@|(_Hyzk>OddXK(iCwyu4q+YJ*KAjEXlUrzyF}%Q zjGJBTTkJI$3157E?$Mk&F@EI|&BB{g>hevF7*Jod z+?mGB9j_WE*KlL}cL;dx_-!bu!)YUVr#E09s|mmJT-vv#;QyX8RZJg@rOFDiV5Y|M6tL}NFQxO#4$ zjeUh0aBqzJUNNqrNTEhzZ!JnB%$efzS0wiXQXD!U5qrgIDcdh%pJExnQeqI1g8o4`;Xi zy;x61{NJWLn7(!!B1MSJMSYsR)R&Ha-AqEM*~j0=IN}PX=wG}bdZRLXx|b@RC`3!A zoX4K?{N&BICI=HI0M>R`a zb;Iv9lb$`AisjSr`gOh-Cj?Cf0ji!{BD{Pyu-EkRIf)F)s0IgsCs3GLkS`m7iyv;Y ziQ19;Yin+pRATp=7B<6NIxki#yS21p%RV+GeLn)vXZ+rAX%!Zf%sso*y!BKc-_vZ4 z9tiZ&Pm85;cxt~K>%paJHXddlYu-=(71sNwek#M6;)-0X4tvrI{EkL@ctjiMg^M44 zkQ`&RB;!dOlx})X5{PR8t!A>B<>X%(G&XgYxmm{aVoD|*8n}*%%R0A#WaXBu^=C;b z7D>!gsmWfJoDKY5mg&so^7bP(eDprffu9`xoOw|1h1egq3+>{Ee?V?W^F!{!@tY+{ z-T6i&urMSm0iuRosHSedD1y&)=1tzqlDNpZ3_6jQu-F@RIWO=Zt=Z7weTq za%=q%0W+|)&!mQbL}`)2TaH@&Dn^&|n0JTMsHpZ*j4tU}SqdZ(U zoXiAUNuC!a>;>+m7!)&K1d2@mJ{!9LHIO=&Xe8_3D7}3xw|Cw9A5Ys^V_t{*BFg^b zw_y%-7SD5{v!C-bM#ZkBb9pMT^A9&iPw(Y?M1E@J=*|3*R=Q-N8PIGVah)0(55~w$ z5HI0ftbg9F2mcpZpyH9|p86EOzAM*l7!o~V_tRxmnWvp!hy}~2t-M!D($2M$CHe+A zKx@91j2JO#ci6d#bn(M-JAyG|u4L#-q|La&`*`%XMsb@*{(c&JhT?bw^he93oqrL# z>Q)BNYbb%()3E|_;r;;^5~L2I{i(*gSVQDo#k@e2IJ}^*^A=(?5et{Ixh3-xDg9II zPT1d=3&pV?USrgMa{S5uZ9?{MY~oUWUwG9c$JxipD|`9f^ZV$(IzmB#TWg72697%}cF$RAx*N;5^O?N)sCkf&cV{g%Pbl*h5xvy=UC&V2mT8|?a@eBl3mP)rf!X|LGL zr2NQNOj@)ycU1WOYqYYL{WE0GHf1MI&h?g?q$FW|3XtUW)Y{p;Rt0sVE3f5`sep{n568k8&b zVbJKJ9J>k1T22|n8JT7At7W!KObC(s9l{B75wq)@SI4Mi41nXb~cuZF@1w7)`bmW*d(^LdjYL*J~_ z(aYol=XnOQBoK7RiUe+^&7Knb=lQRh^P}nYvCclT*+DnQ${F+CBKB--rmP!sp&+HhQt_l>ebUTeaoRND%P@X4#^%w08Ba1jZ@(5#(LYLg&e2Dg-GF_t z(vCbSKif?=>zietVn+Wz-Xz1wj@|Y-v6V7d#IlxpqH4_gElTIPADUTd&Wn=!h1C5? za{S0KQOeIzV`Kg?_Sp4|d~3!U4fNW1rX4Qc`$5xJDJrO*L6y>A-$g4vwIW%IhtZ;{ zy7=8uw2P_63x6;h_G?8qZMQozVnPf`5&$Dy5gTCB^i45xz2OigJuwqs~MfK2Mg((WVK}c%2Vw+ zG;kP5wdm^DD^1O`gRYD{!T32}aVeVg&pGvY?sD7$eYR-4S5-C`En@`n zQ`Yp=zuZFEq$1Xm{SJ0A9a8cNYgX;2nor%E^sw9Y${FgEFgkpRTjG9F3B1 zgZmcUaoo?<;rT%UF)3w9#d_F-^?+I%W1JRM;5C(t`@ai*>1@_2t`a@}S~A9RnS1>+ zG9SzpE{?!nC{4^cVGog?Z|4z(bJeLFp{4xny{=ck;hl=)!%GnO(Ov2?!|^%u+m`zI zGs|gcj)q!W+au9X{pHTBxB8u}l^fTut*pAiX$?i&Tbup!+gy?pZE5j0)i&?;w}#r< z8>4OhXp2A6N(v51w6yx`Y8x9Hns@jY7~%qdV1C=x&Mj@x`i5qwIMlNJR_B(A&81sc zty@)<{I>P=TW@d{%x_!ZZw`g(+x)eyJKCE<&Cyv-dvj~3u4PAa!vmpue@i6V(9-M| z!C8)^vTl9(y4#&w0(C7-l&RiN&Y`O*^!@D(t)XO5-Q-MR+v-{yB2j1S)@Vyxl!EVY z0?jRcTll6>TU+f8lHip@G!mbR_FDhz7vHe>2ETuKOJsLz!;Wy&A6S01|N5J5TC(Vd z!s~DJBeJ-qb;m+~<>uv!Ha4`FcmbPW%eH$%by0sqo4>gw>aX?N9Ixhmdy>ym8rFZe ztySAS{=03_{C88{wtMcGRl2jbp|N&bV@NA5?Gjo#%kN(lBB9!--yiA-)wM?@Bo*;5 z5b6REXz<$)Z5V3xoBpk>i#F^G`I}nmL;l+BLbkDOMAIlHYNNlowkhPNe@!dWrrTO; zTX*{x2-!&N)WqAuExY_XL#=JnDGklrTUwiHrGumZt)tW)z)iGK6ob9Y*ji?NKbOCM9Zi>{m-cIEz0cYDh`YRUugNyyll@$#;+C!+5`j&h6WZ-+1@8W>+zm;Qz4GkYt z9LV6i@pmiTMVFq5cdFbp6F$1D#hck}j($?)nDzWKR#hOW1Flv(t)W?M9(U1owly@P znw)5;BkC*{1EcOfe+$d|_QsZ7?s_UlAI3p_sJ0%()7sJ=#p05zQ}S(WfoU?V3%57l z=MNZ@0~1J!g6U&Ex;|@q%`MG~+S=P9q2_wbywrqK(%mhp)n8lJ+R`RUZTTWGHT~OK z+MDa8-1c*h{PxzCCO_qDYY@99Ep3T0vcJSc%vX%P%ZB?Ei)?mu>-a}az12ngN8db zJdr_n`Tw_Jjn>=$gl&h3k68?ActCMfaZ-`3mTt0=dT8s`9d%G$tH*8`9s99%x}TZe zf{h{@4YRRY>fZ+8KJ1?s|F(u5$*mq5FMti#VD?<|>s@uDsU;!sxe^m7R4h^~Q4A{P zD;6jwQ+SDQGkm@*KH2)YAmcOhB|aDag`b@Nhd+Vl_QuAm9eKNw`7|_Rfi|RU;pfk< zTOj7^g2wjRt&#S&@OHb2UEszr*qIhe3Dn$QT2)!OrLj1_xT#5;RlHI0a>c6^Z&18h zak=6e#f^$?W3F9)d%07wzO-zO{abBd+4}Vr=F7TO70$}?s?C+RmzpnCrOP%~3WYBf z<<2Ja1qxrRjHSR@SAK^pQ?bG+Eh}?2@ryNUH&-}it8RDJt}k;c*Wcl6Ubog+x4z1$ zC|~C+U%zg7X_d2jZKYGb!KtWns>(OnKP2i@m9DB-URqJ%Y$U6V>zozqH&$*euXL*T zV(9XvV*PqkmWoxxTwbw$)8>uk&h4ceOE<1`%B!n3mdY1YOsFG*TPIZS;GPLJwq3WQ z1!t1k#`(9mH{)nwSLJ^3ed*Z$nNp*XrWYFI1=H+kO-L$Qx z5!0+Ow3AGofY}{lF?Fz=lG!s1D576?gqrOR(qpmF)9-BkqOC1V)CIRJ@RP)X zhUNvy+O_R&j@EWqjmwLO8@D^f;sm&`E6~llRfMC6|=~) zkxgk#e?WG#jV*0vFPm&Nqr;1(iHUG)N^|<}ZEuQ5rf{NRykK=L5qxFa{kECK+~mCs z=~2Wf)X=QPU}H;5L?H8d}KMYOU|r|F36UZ%l-I#Gh87n zYW})qn}(Gl^_PE5Pk-_@>A&e*c$qm>{l3JIMit#~@DG+gkU@9(|5G@5p8PZG@ls)T zUA-@~+pMOji|7I;YQ4tp=FJ8hL{%79bVH*`c%*f;>l~Q^#!IxVrKK@c+w4TcGO(RU zD^t&DkHExhZlZwApQ#}r8uPcdBvlO zD2~?p+Gs6`(wr7VQQy?ihMT@F zj2d(rnvM4`DtgbEzxetkJ6NLdv!k1Lgra8Hc!V~Wpob0g^bXvOo`--4tW1`+-C2O@ zTwqrue^Yx~)W1!3-_7k!+d{3%lqKq1o@r&rd2KwX7Cc1nVb28$&^h|uY%9R9cy$Td3 z7TEBRV$nk7D+aH%;T*;Ot8BPLaYX5{`Ig?f$f93yMANBp)4k5}N0eWp`8tXN%8w{c zD0XT-!;3Y2#ZJvPs5m^&@@uZtd=w|Iu;CuXe8rl}E&UnAz%@2JrtMRyXy-*kb3?Sj zSb})vr=0_prR!ELU+Qmf7VT?nO?B5XHI3g3n@5g4N-I~H{qiiGH<`11slPT7S**vZ z^S5)ZK_nDKh(p_!o%qCX67u70&Nk!FYj&gCiMr@kY^$4X`8>U2QZOeCq`-lKUlap} zh;7ab|MbtUpAfUoDlEtP5u>fOb)ju|6qh=)F2W9SHZ^iOGV3CQ9F8;`(Ktyv*jR3I zD55IPGo`WSI03nphyfCbay)7pqm97TBq>T#4oFOG+(TdgmGkSZOF`ProOa4VGgg|^ zS*%*il~7t7TG%>I9%g;2%DyDcJ%mI)v9-jtZEd^A9A+WHnyR=Wp#)+TV*F!Ugnq+ zT-MU*iUk`H1Da z>vQLYmR_&&V_&iS?cAD|Ph{MN-F3b2j1BK_@K7X?}(byzv3QM@5Z+p8}ED=)_5Pj-^PoyYWWm1!!=6JQFP;F;*_T6 z%8jY~pNbZ69fOuh1pUt7#R?(VFjRx_8aE@-S zgLt#co)(2`<(7`#F%rK?8+U-%SU0qVF?k!AhOSwgNoL+jf=+qJsf=LST8Cpw4D_6F zk%U@PleFfn6ApFM)`#jEnkZU*!wwwCuH(f^D%4h2i-Vz!i!q_*x)2)AiYwhz#3=FV z4(HlMXvIb}Zxf|feO=$;;I|2xKMmU*4!h)l-x1FS3O~Y46+rG=vGYRtw>L-GsO<`4 z>pQpH;@oJn$AfZh!FRzYdOQdXtK7*hQEA z*UIm&m5y6JH$CUUKdn9fR5>@@8cnxjPkQ>_*YIBp^E=bi@6hmsV#!14e7Ai6w_*PO zN9y_K_S>MgOY_5a99;FbzbcGZi`ZX{~K$SL&ZV>tz?^Vzi03 zJB_1WaXc3Gy0mBDU6kDTVsCP;=N-z(cCfJ#|BKU%uYtXuO~Z?cH=BD4)=`R2ySAZ~ zoAO&5?3da$oVVuA!gf3ra<_h4l*{UJKk8~n_TF49cedVMzH!s4_3Iof?dG?mwso8A zvFls5i~WalHJOnlV5ss%%~$dJJFT_5uuXAE@I@T)01*Z7(Z~UwRD`d|q@pcqn|4Hu z$6an&V}!C5ZjDkDOi(-9^)Z&YlFG3K1z9dw8Zwoii>zsx*ywJ@!S174DZR7-$ za=>aeRzBbDXMua`eu3*&G7lKIH{&t=-6sdEyqrLUTD|_5Hj+rX_r1BzwnIG4Nw-c%(6FQYBYF-o zq3Qih`EGbp!}*Wf`0X0*)by@jZSx;_r{y>4yqMT$!@pJe0S(7BT&dv;G`^$Z*%}_| zweeq};m${G_)-n~-(|xKG+gtD4PSYgwugr6cnn-VlRcJSsPg$*Ufb%)zi(82vEnK% zZ<&TyE3Q|pR;*KOQQWQAt(eTgo}c<4WbvQ(^gA>8e1)8tOUiaE~$~Ep2#kA=kFHg&Vd<@i?-Z+r~+YvyCm?whs9d zWgg)j6yImmX~d5!7pxntJo~*yT%r!o%ouXCb+@=C8UD3(bvToFR-t(jJ7p#tk4)fZ z^KN+B(uP$JJMXvc9dY&Y0UK`D@Ywro_yG<3)j#&2%UAg>4fkpI5e-j#z{Y=vh9esP zeHt#*^anItsq%vw?o@t*h9}e?m~3+@TBBRrTI;w6(-swHjoyK9>e^dd8Ms1nn%g67PBYIa)Hb!TP}pk^ z#znm=jLU-|&gy7ZANz=sb^1tQWZ9DgPM)Po( z%gpTI^swuX?)Rg_*YE|fbb#L34vmh2juB{xrAA7gXeg1I+^ zw17+!H(NRFvE@%5Ihj}iD|@v~BQT#!U9G!ny}Zq>3m&edo~Sk~B~p|cFs->#=|s#a zQnV>z>amNbe#C+c-6ykPCudJ+NHd}xdq+T?;){lMU~h5srl)(>s6MBI{;TG`(vS-SO|r`Si;Smym%M>-uz1+tu9%riw{iNyj`Miqez0BTtp> zW_c7pyWJYd&dOVqok)WdZf9RoyN!p?>RR~IhI(ZO)O>^a>(qsCTEmb7!5s|47A&Fd za^+`xE31jq$gYgPEjz9+l)pI1JDes`Kw>)^m3sa+*S9n&Fjmpn4b5Sv?S3{SBvL<40CJ`;OaqB8PVeJZm#?=9LsIDy#bAPF=ckYO&sF` za)>U9(pU!A15FV_5r=@puZ!-Egd{s002m%jmQZU$om02Gqk8w9&U%J_a8=XVP3@a+ z-*v}s4s*-H^j6e6z z29HnGH4vX$yz}SF-B4PPvT;+i%9Klr`oLY@C4Dz> z@Dkn6Resxc#cMR|eAkAr(D2B&Z1`GNUc>j@WcB;lnC0K7`~eLwb>%f&s$oaNL04Yq z^Hpy6J2t(I8t&Bcr4-$K-Kh4#T`IRtF|2sMqML4JeAz3?zEM8e{GY*pSLX^X=Pp}6 z`88Mh{Dyaz$!E8w+o||AMd5YsU0iB+Fw(8+gi4+o8nZLqU|)2t|H?wUHoMw5b7kJb zwel_V3vWbETCY|ccRo_?EO-N@HexO_*j+`+*(qn5!bn;zN|19`cg)sv(b~U*{Vqm| zd%ry*kJ|BW2&sU3<-yI&<+*9QbPY44#W}|)t#{ru@0x3GTO7E1{vv1FZkbjb89S06 zQ-Lk@4s%!0*&)|Rc@B}ITXxR;mq8!GtmgufH0?Q`*at3SVe`@}j_4$FO z`?-_0JzRb!y6L-eZuq4zv)upo)AV+~Gb5ZS@22n4GY9Bly@xy!v*|vm;X+;dj%v8? zl;wX}!;`C{*&XSilTpbqRo`$|!fpyh=fO#4@ zcfDS44?-`(_l#+3Bun)+Nz;pb_X2%83!Lo>WbxO6*m_tcf1Rs^ugf@(@Y+!}xESto z3rEsWccZy*W0TMha@!?Uz%E4QnQ_zB$-bQYXZw9(xpjcjD|*6W9>Z=+E+Q$OI_|J? zVNfi6xo|E=BKVK^V?O8IX_&^b;?g&6IkjwD$&?3ybRDUeD%zHyH~kARig;Mmbg3J! zr8VssLBymGa$+&<=L@dA?6d3oJGWV!a4f!8!<7j;{`YCPMEUY6Z~5fME#I|w^3U4v zhm=1#)5>KQq74JKF3ch)J0thzCgWXhbMnCZQrvZ0*Ojg8ISceM=VG}N>w34{(-^0Y zu@|<xQ_F`>uy`jx0}z;zD~L?Q-+2)e*$UDWc0;0E3H6EhH3JP+gef!lgg9I(r_Xn zX|=VuZ805wN$ujXd^^6srs4cKHhf&eBeSO;|IaADbC%_w(etj7i>8;)EQ7pZPd+uT zv^e=HixV1lCYA^3|*JpoD)*xxpzgXD;#ioeDo#1Qvl|uo9dCJB0t=^b^<*j)0@! zgwUrb|7(y31K<=`30D7}@`Hn5A6Uds^A3Yya2%Who!3&|KN1hjIYT^f5bOXu&QeZr z3LFCq;2zG4ZaX9Q@!x5FCCv^57KM2L@h2d4vy6fc@Z<(C3gZ z^Rpi;1an?VeFR?>PYi-R;3znH3350$iVEV1B5)9_1czTuK4AZ)$b-SlXfJS-S1y)Z zh1~0C7qG}ryMp1%$se2o9juDsE8>ZO;FaVH#=s6RXCCDS1K^{LgUiCc%c7XnC zNT-nUgE`kTKEUt|@x+kO!3l5_oC0HD{6CR?-D~z)3K$oc89u*VSMl*Z~H?VXy|wDI=2%E5R7=EA0e3c#-G`I0%k|!{8(sUQK@2k?tDu0gJ#e*a3Ee{a`;h3J!tQytsT+ z_~3*f?=&wcBt72RUjqhtcX=l`xDk1992^BlH&H%t3e3NrbojY|09e2egH?k)U?&*h zrv?VW9DWaD0u1vL3OP4W4}Q@l0`}ZZdB8z%7#s%2gbz-FMf^HS{*9CyEChr1kUm)S zCgOp^;JDyc#>EoKRZDw<9d(ow%&8|GuqQ;lUQfE)i4P9m&o}^cT4_fKN6F_6gm+VK zumJ1;!(cyH{Q&8KgJ4YfZ=pPIBpQ3ar*jvfJho4ECdVQ!FU6Ez)mpdox}r!@1niH>USewOnfi^ z7Q6>}upbPAF|ZRHelP6+2K(s;Fy{l5=N8KOA=(KX1joQ}Fb2jx%(%T3{s83#`@sQl z3LFLle}_C+4Nig`V9ssC2MfW1kB~lC{RHWQ{on}LGf4Xg{}b>_NDu4-`#(v#U<{l9 zgP$V3Qo>*W4E#NE;OIY4-(`#kexF0G>lF>r4`9b<=m#+PS=v+RpGO}qNA4eq4;Foa z{J_{S?EwbAN%_G+a0(m+^UIJQquyW)jDQ8-B3-Z=8~{7OVQ~1{l&_p}eTVS?4uWB@ z=s5C1|1NUiI5+_od=L2*)OVb6fIZ)*9ANbiD6fQ{Vg7(Ia0(2ZVEn8kK3D<{{*d&+ zf*;WiU=cVZd~jUC&r;tY!35&~41*ouC^#VDA5(8|3iPj{9ezUk;2;4h{(Y=ZrV72b=(h!6~r+7sOvf{21*F z_WY7|1_!|&Fa{2S9nX`mguzKLc#8h1Al+Zl?_luPv?CY;JHX)=$QSINL>?Rk^Vbso zPs#~a{}<_lIlrO3zz)z^M|r^lFnpSE3l4+T68;_XU=KI|4uZqr6gUP3|C@OtVX$yL z`AyLd;5gU;7X6-n0tdlC;e#V!3>+8!A7~G-8qBYxJYWC}{E_m4L9iMe1v|khuwVFR zCD-ei`Xk zkq;OIbMg|22p9zW!BKDs?75iofr0!)!r4qY!9p<1Z}aqk9pC^M;Fqt*z)^4#?3t5D z_-`ldCtWajIq8Bu;4nA{jtd{01aq#S9(T|WU?EsNFOjGL3+9s#*aHrM#4RO?f~+7~^g7K`_i)_QOI4d%zri0$>oV z21mg`Fb0l;Ia{Ff0|_NyfZv&jfWu%PSnzt<4-A8oU=Nso5Anf5a0(2AL4M$5K=41fjvG-wd42E$+v*dz2x>J1KqlVJY_+BZabs~A^c5F7); z;3U`&=5Hroun_FoOnZXEUA!d|Feu&Fb39u@|k17neo6zXGTZ7ZJi3HToq!s@OIy0bUr74~NB^Z6ce#Y{PRVTZqZHgS!}kxngKN&g`KJE6Z$ z=%teWooVroDSx%_iRUZL%PHpT3H}cg?`J|^mY3h_qYB+wWqJOtY~TB5ztxgyI)@|{aNg#Yzy;;lkhN35)F-|e&Va>@`Aelh%U_)w=YeC0Uz& zd4bYAe`#I;63e{!lIIcPhrfO{@$5_+|8d`{yn@HFmgV{PWiQJM^j=V!SJ*wXG_R=Z z!j*Y7S;aGEo zK9c{uEdG4wYywlq`v|=ldJy_6JgSwif?f&zwHfqA=+)4#%%Jau9)W&I2K@l^4(MxB z=rZmOLmz@}#=99;$@wPy3g4tJGu3{iU8>-hxap_R8=(iGU#v6%k>7hB`2#AyNCcU+ zVR8}q!_aF;=Wm3rAE7@DJ)Dv6Jm@E(N1*Q!Su-9g%y?KyM=v*{*l}bW&qmLUBG)5w z)T`UaIPQ}9c)uOQ=oK@FVT*h*@`3N-s~7n+y|$f{SLVKnzpM4Hl%o;(DdabcylFR* zZl0BwPr9qL93r9b)YqN5qd*mZ>N0196S0@Bbuh3Uw1y@=@X_u484Iy{6 z$mvJopMgFK{eaL?+T}sY?dBu(oQHlX;jHKmkwd@M82%dmmgm~P73uwtd<1#P!~IA( z8llVCQ=v-)g}xX10Cf58ekASz=!4KPHAMf?72Upia$S*I&EH_Ij9Q6v47tgS_(DGc zeG2+3CBA-yej2*NnU@*=DfHPWm>lS-?Ih!U9&|tSw0`rgG5sdxEQ4PI-;~qsS6?u# zA0(Ydy3x5>;7d-yzyvZ59PnwK`#%Brt4@-XE=j=rYM&Fus zZMj+3_IdiYJh#d$ac0qwdY>X*jCh&#&SvsXLKhkLBj4vjpMpN$C4y4lCD8MKp!z#) z+;8*7fz)>kavjL|`EKjG$>U2pdz6n!lQDm)Jvm9|AaY}*BV*B~b8i~|82kzNtAwxX z^aCm(`J9BG&za>);nVKkye{l84aD>_^_qPV>oIbFD{?9GLB{yXT&n=3JWG%pK(0pQ zOh5X{5m}wPK2MI_oGSPe@QvO!{1!7_t2Cb|{Cv(%`y_r^`$g00bpW{zc23hva7i5*V(gJpMH2Y@nDABoyfU*&-6cX zL&zo9*Y((QK3@ZJD^m377UTjyI-B^4q-WZFxz(qIdl;lE%&<<)zZdyYGTJnSbW+9sVu!p*`*5vs^p8hV&#ex&Vk4_I#R;f=m z7$M#(u&12Oc_m`WQJqdQU!&DAatjHBInzEW=~r2)m3fuEJ5uT`<*SlNKTg*pLT`j# z03EgKeWVV1q31(ylKj_UhoI*~jZ5c9yo2y-esVTJHyZsbAn}esuZEt~C)AT+DE6n+ z>jeA``0thonl39DYt2SeVi|3cPWEiZ2XaaKS{HkGlK(vA7x3Nv2)!8k6!8G>Bk5JC z{3@ZEamzaQkkw*Rt|)x}Pjx*>9Tx#HU~S(lLGA!@)yTb1)9Lo<_$l#4yiQ!6d%GJ) z#3cXY#2X>ra*fyJW07SXF+I(?eOk%~-{{%ZT{F8cSlgSuk4aJZn9o;dn$S~Zdr4y+ z25IL>=7rdm=-bD9<#`4BvdS?c#7^(N0HeBVrtB!hQuhq&mASr0Q%P(!N^^ayAYscO z#ROO_q;;Oq>b!hLIYPA_iR?@~X}3d^qvPji6ID_#v(FMcV?}Nye}lQQirDdd9JwLn zu9ESDUg*u*kXN$L*PZR#iKI0Qr2oz!H_V-kH}Kv42z^c-`U`sMI2HOr=;PDS%b<@z z&vp}$H2A*-`Y80}!S92=M+!iLJ&rk?wht=v_CaNNk*opP2SLi%2U&~9)E@(NggYUPUVhfzTL`^? zJ0Q!YUCBrHYxKG9*H-6^$qX=fM;X*YtCl?03uZ zDzh$;er5}t(a*LDQl2wXe(u_YB?B|A*sNmHN>JKo?#n4J{E!gzBmK7odgX7pnPX)lK|ah~pSNTYApPmvW2N2ymt>otmS^gvV&tpOsC{h4k2FOY zX1Cp!Y=Iw!@0au#<##JR3Oxedthdnbf-d8#7kUTuzZH4c4q&}t!EP{xguI3Shmo5= z?)Tn$#5~w1ejiyc;?};W|HOJ- z0{sB=BItu&eAZn%ACepLAcncx3?e4!9p}#w@vaeqex!d-K_7*FKxoPNNDtr-WVPqr`W8E+E4$S#z2+n3Jb`=w z`EsF|avFaI_1*0?Sp}@@SE0|4yH>|j>iQWJKcdmA#*Zj^^@^8TKdVTuaArJlr{t?2 zDNiHx4(Rtty;JS367*&tHD}IBKkY|u=t9o0`JS?_n10Hvr?m4iD8`+IL@edAdK9cJTdST6L-p zCDChJNH2I%Jh4ms4W##&tXDcu(QDn}pT%xu`;az4je#cf>j3e4E{CqgjwGwY|RpYa!`uAe2o?rH0%^IzJrm<>Tk zemv1C>FG!6T?Kst`bULk>b=IZms9G!H@(_60g1n#_?0h@Tm3U#yIFg?e!BQF&W;nm zkNExB1km@7W!;?@>7Hpde!H1x*8V|G?o^x36&)JJ~sj4qYgfYVZdgN zNk1KdJ_;Q(F3o;D4t)grr-W|S`wHoMHbIYNJ?`^$NoAyc&LAguW8W)sMnA3qqGI&?lkO9o|Rid!SE2&m4dIq36$y zCwfKNSCdz`)vhOpp!YzRvbdimd^rZa5Bl$fnAGza0KU(8^;nsUg{C$Pj*l`#&k(Qr zHSxp}wI5UWwaIz9k}cD3r?DffYedRY#-B=mJn^{XzcO!PhVSiZh+yc&XBP zFvxgWox6j-uK!!wWk2$hm&fh-LRDV=I#M&^A9~Ie@x=3zj~UO#p0?}vMEZc1bWR{Y zihR<4X6=L1&?lg8lyvkX>Cb)*YV&vtH^fr+<<*D%I zqq{$ou~LtmGmrINi=cA zKCIknP7CdXmGV@*7W;MqcitqQZF!YqaofT$`}!#k78YIL>_ILTh+F@>nNQ-Ou^;Kb z1Ijn^8+W^KB;H}@6U4hh2tk>L>q*q+FZ|>1C*iLVzUr|(nzHau!}nhuPuwMZ-QSkb z&dZUJ^3TCAuYqsYFYT{Nb6%Ys*Tu*cBNs#Nmy!q$mAyi1Y>*#}jYoyW4LvKV%!~I%-AkICA;dap%#~HyhaR zao-^81~Ripep0_P$b}0T2VVK8f|d{cC+F`G@dBq6M%!QXMe*h6IeIAGDt{>^5Vcuf`FP^(wUWG#h=huaSN^O?rK|#uJ;e3D9Ndq-XSicW)q%dQ3Ay ztmj_lX&Do7U|Brve10zUEztX+n|bJ-Be&a%N&D@AKMMZ^zDxUc&qUuo?%TkA+h{Hv zs&+F5Thcp(e9!WDV!f5O=hD`-Yu2-;;mflabv^{lc-`RH+sW}NS0P@YN|{?=t3RY% zbFM_clUPL^~kNM1{3sFr{{zl}c zR;qnq^c|~2gY9eK_rfm-##8Q#z~7SOAA%o%e><|){$Sqt)*AsS_tWsh@ZUazfZLv8 z_tc1^BkRW0@hJJ7L4I^q+@5!u@}#dTbE(`od`-{Tc{Tfdy;)f|Nm6DllzhvOD_Ijy zd?hvC$Fi#OMtqO^_GM?iU8HUEns$gHKT#34=MpAg-@A0Un{|Fa{F=4##M7iL{h00_ zE%ZHUv;`6A1sQ+GkayOp9Vl`5Nc~PgpCTP&UzvQ8cC17>!=D`DEt3fFlm5t^-u_t9 znKz&PEOJX#uFEHW_YJu+M&# zH%WiaRg7oo_e;ETZfnUA0{$p2Yk=Qo4g|@64}5tRsaW{>k@2)2`WSS-jHhJ(2W9?c&15jCqeh05$R9&~WK%rxuV(y- zrLp$0tgZ_g_uVtGIK+dtKG*jxled)XH1ai@c?N**Ub}3w?IQd+7>u3pHwa(thqq|S zCBG%`N8pErzd`E7Jmg3-f5n%@kVShh=Zi2&i~sdvfZnd{DMUWf&U>JTp&Ng8($8)V zlgo2`-;*>dkUJ>lxg(y))^U@%e=_S-8LmFF3UdX(TSrL&KWG50<&kJGDbH!rE4edn z?+1xrYo+yT%?_~ML$5<7Wj=7;AO~+rzt$4uMvyc6{xIBCb{E|(JmsRO4pwjw8FxHcesn~U~8a>K~IJ{!4Y|7YC4H2WzW=vl|IrtN<_aHZV6q&K*o{kY_- zANhU|`WW<|dHT?_yPg+z&dB-@<5XrjWo1b;9!MDvCy3V*PWp>d&sCTQc7L)w!@f0h zFU{gzfksPHBT_UeS22TPnDqZc2xeYW2JwRz$^o|e8aC$o>@_57(MtP9iC5DQx99pv zKk$0|Gd`bmB}<*i9YAgzxs{T>+2`3UxE$}SGPfM;I6EeT^WJzu>g?bz=#u-2_tRZy zVRq16q6S2-pF*w(xetomI`*YlknVYCJ*3%-s1N+xw4HT6oBmAd4bz{i@@jm&=jl#g z)wB$|ao9sXQS#}#FP?bMpO(+?w8^m#pFW>uxtoYUCuC@?wYgGlY1h-_Khzjcd`Ji> z>yE6>*2=JQa~Gq}n^bSVh+G+RW5}hhW84Q4%e*Yt_ZeViuH@T@T&y{s_!paR(r+jl zPB%&w@b)9u*Ah?sG+lpZ%qyc;S70p7nSQ%t7Y@nyBwdn(?C0gajIFT@ zq1hNJMQ!oKSNV>d-H#ai+4v2`S>tXqO*I_J`DW^Z=T>EN%dDH*Ks-QbY!)Llriq@`YQE4MS6q# z;)xxSkI`4|{@b_0vp29q+_gZ&q~7zcXTL%`nY-@zvHhI9&o6CUfn3pJx(~o!?)G(M z$+p+dCfJBHjO zayJXX)XVG#7!*6)Yj&nRPa&7nhkr4BUSU`3`Ic! zFUI}&ZXOTFunbKVtCd`abWe`GGVem1qS;Y+&vksm-_=PQ2Db$LTG zaP&MuW2!wU?R^Bf!Tq|Pr?ijw@q~W@ehmKW`A+*;e*wO92}(X^;OD$Mp7^8?()_Y= z2`s5U=HbxqL(bT*tGlzhvhDpz8T6}iA2bO{dKJhOy@zL!B|Xy*?CVw@uHzCo0!ExiXk+wmUw5N-QzK`w?| zwGi|^gOyAA8DxCyMb6(JPwW@D)cT6EyCT=RyoJX{^ul4}`;hMy0`urG@w=wp$739K z&D?Db8_z3QChMXYHc;4;Gt*?rk^abLfQ*rz)~7_;$M&kN$2=K8@AK?fb3aqgEY_Ht z9#ROKP6cvB$W51y=)^jIWpOgEp>^HJr9f<2aYMI~m++{6N>vZ5tdJB;oNA4cc zpT=(8k~dMJjy~CcGwGx}RmkOkSm!tU54qoC`X71$bhG}s`bZvX;Unqy!Y_jVxDb;4 zpQ`RnI){-PK(0Am&Uc6Aa~%F8{2JlA_lV?@10TufH2lH=%IDcFYsDJEWMqfRzE|X= zymRSrc}K@_A(--@JW#`jHJ@VmG5GKB_*O5<-FwMr3;gg$;)$<&eEWRd+sLIn*WP89 z`Mejo{EzaE2az-TD06>vdjIxhiErrq=8-A)anc(gJ=`3sUz7LdMc%09g})ClFlgUd{oof zC-;c;yhqO)3gscS04p~;DSOQgf09QbZ`792?9#qRNH6fQRC~tUcbD^P61LTl@puxs z2y(YezWNdR8R)~%yImqE>CVB?S@?wNDYK4o52h;%ucla-R#@7x7&&=2i#gwM?d8X~ zY>dBoU$*a8bhB%Y8auBM`SFjRdrxOC^a<#h^ZEev81!{EOY>LCeHglbQ1^uo*mFVY zr>CJ;Lq8;vrk|4bqS?Qd%ROLY->l&N&fe*~F;cHN7*ZpoW7d1p>6L5g?mY{Xg6^}8 z0+I5RAz$-}^z#p)Z-HJ7{Vu+{AE8H~4?w@qC4xflg)Z;1d3gr?Aav)G>d#P~wAB&l zInZ@IG3%1Mo=AEp;1|I!&^Q7@KMlPE`rl;GXBV^0hHlzVc_Kd#`ULdUa>+O;hA!{g z=@eO`AFSRirQ=s~EnkL;#IHxLUkdr#FIC(f1y#!c4fxg*H;4|#TpvFjev2|AZzo`63Nzs}aj+P`AWVM0nf zoPi(sO#GbZ!RD|)6+(Zdt*ZGe^J^jWBIv&qO6oqN5)(!JXLy};E5q{$E5yLm(@fpp z%eaY>&IIWkmvq*2UAWO+58#m2?6W^6RS>xY$n}3Vo_K3!dzgE>AEhGYxzcaPkaG^l z?LG9=eq&FJ-bKsuV1`WT48mVNI5Ey z??=8}(oL7gwURC`{j&%881lF!b)8aUfS{>A{3-Y!NEu%;&SiI^=Dq31W5`9mp!*<6 zi_a4NpMX9L{hboO)_q>7(6?dM(_h6kwi3(QeBp2;YQI$&`(;iE`t`|k&xIC3FMw{^ z4gd63>!0>*p**R6qblV3kVDO+wgV>-9Ea&5BI9ola)ZdViJX3<-up|i2cC*2{!wT~ z|FWO$&NAme9LWpSw9k`$^pgHl-#h3T?k=;g zdi&ZrrOa34)gJZctKIKOB6fTfBX`%^^t}g^Q}0i$mV4N&=iPE|wri%9m-;p$KTf){ zg@pe@K+3ll`WW;lgkZ*v`ceII^+#Jw9nUgu?YCSSzEg8NzDm_@R=*!nzFC)OPmZCi z{Re%Fc$m35uk_LZK}q*C{7LvS)}*~t@9|0d%~{T$Z^RR?^?`SG&y<@T;s)%TVH9yl z6tQ~_AZe5#KlyareZIgOFH#%3Tesu25xJg!izjM{WBb|jKiTsKRHl?~KXPNp8N0`n zFa6y0u$1rL^&Yt4yISAY?>PKI_$xIZ-p5hyHk_$H{2KVC-A#PgYOwq3Ic2P`@aO6H zNj*1MVeiG1_`YK|(~ML`jM+@zmwt>SncMQzlU~g?^*q(&$E7ILkMySKslD(A;2)I; z@VkBHVQ;KpACI2u!Q+P9`&}Q3h)KI2AzolCZl7N=@wjJf{Vf~aWk=*rA{RmKClc`< zZ@$RB+U*`wj@jj`Z{JGQ-|q7_EFt>5>KYE>Qt#);cqt=ZC-HhEeNzr^{w5bjRglvD zQRF9(e~rp_`I65?oBmh+9Uh;%b*uRXSvb&Bu#6VT*4%5v>9F~VR_n}YCr;a9__o1`4pUeg?ee+YgL zeA7NI|1HV*Ps1OEf4Rgr$GLwdeAACQ zehc5?uYm{(vkd+6E8wMKi_RT*glY;@J}oMQX!aj zO1^JE@|{D565r@wlP~*y-KU#-o#fk=aU?47Du~zfXU3EA>?Pg+@iy??>vvV@!aoRq z0{&IPH|4E&hn=a?EIGUl_5X&1KmfM{FCh|{CeeY;k&b5$F(j=!ru!&{~5i{ zYvL!*Rb+l1gzty{35oBH`zV8MO|JOH)``PP+W%?f29f))$eD6`dQr}ItbX7og*VvI z{*r$-8|eHK)3@&&`19cV;hXj)717pGu43r&j@7^AyB+6NugUE&J*F_}*CW@5+^a>- z)Gw*;CH=k1pCx?#NVyI`?;&2L&`i8mQcn79kH8;>zf|~cyXer6_$T1YyI;@8KLdXX z{$7c1()Wp5+pJVlzqu9czke7{d_(v~FB(6g+%feXL{J8dvJ|&%c z_=WHf+jOvxtRJz{tBp;k7r9a7jGw@y)99rm`5b~T@2YK-bjrKrEf(EAIUQgG2>)sL zfoJtTnTanNcxA4%wv3Nc@PqKHy?KCNOYg5RxP4hmvF!Y;-NePBG4nynKM#j~WJ2%x ztAD%6ls)}9o(klKkvm8nJ05tY0D4dKqr1K?gcU`u!_o!s9_J&z;b_fy)zt0#3*|CQ;yZ>Cn$YHo=)8->?@ z61#Akc%tXOks56UozF+&l@V{?XQ|K8xb_>532SYFxtxTmDOX9RF@T&3&cSate7Dr;us)QOx+1{yswdso3=MR{HIPr2m}S3me`2um6FR?lAYovRP0o zk#nENPu>3*zhUZg5jDP#vHh9uWoev36`gxojB?0F%G*dj1;3pB+)wzu%1>MW+w2q& z{vr55;+u6s_I+3g?$rt5KMh~rg*>0{c0O-Qn?I-E_rovt_&f=WgG7Q7e>RF{7`}`- z8~@(4_zU5Wrp0&PvSZ^{z?XL~FZSXm^OrOm;ZMPToAUL(EpJUI@nHq(NU=LB8CM68 zuYO+jIpd?3cP_c}wL&6cwq#6KGp>#kZ-jWqC7-0-zss4G zlsPnT%_*J(mHi*_bvz``Bhv22`#92^rr&Xdot&1z#hsC98K&aW5BteK^6T@Dlf%kS z+As3Nx&27|RzFEOP7=Rla(eqD3O^e|RQR{3-V>`f?Vd^M{4eo+fZjXz zde!<|yp7YkML2L+bKchYhyTUM$ve<57J`0+UIjgpL6>wJp@*S=QDklT#8g_9E7uydB2th2$T_D| z{ROhf^VT=oMbbG8zXbkkq`%U}CtZX2;zLm6P9RtGTWybZR$q$p54wlx$Vh(Ko0$*D z8GoZKmmG1LkMQTg_x~WX{CV();9oB3WB0{5m z+45z46~iz1eLV5^seHLnDtV}VB>B`MH-Ox9^$`AE_(Sl;t!L{&Ia-qCI0%0NzSP;{ zhm++v2H*KZ(%;&JyHLFRM#2sQQ=e1F$!`UmuN<>E5DUKue<6JNje+yUuYlk4BK$`9 z{V&4rg+B|4X@^M!x7wJkcQORoeVy$G9%#UY6v08o5s7lH(fT zUCDNya~IePuiJDeJJIqf2~Qt*eiN+C{TcSH$nQbE2l=GG zLj5ercW20#A%95nM}DWY1N!zcu~Smt`$K)YW^%2vMD{3h57ypxLlg~c?OW6Tq*Iuk zu+L?g{z2c|ZTnx!HD?R!6?|8(y;wb#AYX?32=Y&Q{bTN*a@j}rfA+OW!Cda+$(0r^ zXUdLK`ezUEf-@7D_hIn+tDP>3$TI9YRus>!TbWxA1zQ|S%8Q_6oqC$|21)M~e3x}f zZlBHN>q+QC(39gm=}(t(WZ%Phg>UQ<8f*IfpE>`kkjAAir!n}gqBY~6^eQh*SU+p> z`3C!bL3PcU`Xe`p+#4>W5Yy$0W#+xVd#p6e&rW!nj7`Uy`jcLNULx&18B(5;(1)P^ zi0_<#@X%Cuwz<|IP8@aIirnlsq5m(Y{iGl7l=mXq*CNVe8DogbWgd}Rf?Q30B5{oG z*kAZ_*2=sU-;wL~GWu%^ayc(gB>qd}^d1^-kz#Jk!F)w7hdbOhlUv}drTp(jejNEe zkvHR;`#XBC)10T8@ok=J?^@B<`1LS0*BSS+HRMeFYiZ9b5{Z+D%lOdz()OYFG19i7mAQ97 zNq@XfqRY74LwX%oCK4YIf?3~<-bCB^{?=W}q#X_-H;LT)RIZChebSkPENni>WF-k1l8}UeKGW0PGt)^=chgIfAqayDi=YfBtDwUo z3Zjmnz(v3j*;LfIS4C8Wc0&=+Q7{)b=KY;>e%0G_-_L#D&*%M*{v=&bee2YzdTKd! zs-B*1HQ18=1k$rdjobI$>U^|)r0gOVApN&UA4U4?7DTk)^zV-G_cXQN7YEb!;>2~s z?qBMALKoWWz2olhcQEhe`;6oX0w&QUdypmVv<7n7spI26FOU1m=kO|@C(zH~$@ht! z)_B-e?CG7*=N&sfehC6=r}A^&q+4I49iD|;FXR?d4&w={jYRC6@-?L2i1awyq5AL2 zbO-}A?h zkDtVLxJvxQ%6W6k#wS-0yYv6!Sy;1-KhOnb_}kVlDlCR2=s|ZG8NrqNn!U;6v#9^7De_kef4o zeEb54SwEHQ)#Fb0L|*}NgOK~B$h{wRaO)9V1e|1Vl|B=>TOhZjZG3zeD;Mk0IT&yH zy$br}%<>m)BKHL3BKYm8K=f(V&&j<8 zx%IQgtNxA@-;cq+Kbrhhi*^zI6kKYn?Qv)~_P2A!?RPrPx@yNurvz{wc9Kuu;p4q_ zW+>~=0>}+OPKNnAuXkGDofdef1>R|acUs_`7I>!x-f4k%THu`)c&7#auUlZAuUSgI zg)YBrh2&Kq>a&I_{$-V_$nDAuyO9si@%3tV#`isVzFr-~cny*h+(9wT@MGyVsr z%f3=xE*+1NGZMdXk}rX`qrPJw9`^NW3ggf0WN~+9_g+@aKDB^-7v=V2=z_`aV$A9{ ziSbcZK=xzuk|Sk#9bkc1n&#`3;{%MldUsN87ly9%Mp}JM8E4$pV~p`HpJ3_C z{{KCAi|t=u&~xn9ml-3&J~yp-Yf4DVw20K=ykKF9E7 zhT9oVIho}%oXT((!$l0&GVEr!nc<}juV;7{!v`2X#qc?XFEiZEaLOqxpW#%7vluR7 zxRzlz!_5pYWq3WqyBI#e@F|ARF?^Zfc7{_1vE;1Q87EGUREYwF+alB3B6FwD2_KWqC31;WBAQR&LoKcO{=P!A z3t=H=VXwPNrVEK&)@w~?3W?Tv^Ov4ji1sknlPiOIOvDzV;ZzSnDw_ot!H z!a~kcHYalVWF}n`36O?5L?r{SvZ;dCnoKA0UPx@kdp9CT%fzFFsMnh44Z3sDzC_R) zM_w1R96>afi}qU%cfBzNF=&tWC1WT$1BG~N)ly7jS3d8x#xi|XX3xCfiAyWC!gWMHFBUy z$~r3d?(!3R_(+c@Ym>|G*4@j)fOxre)?yX^z{Nj+3t8h_ez&fD`2>>)F~QZ}$+>V7 z#AMBMakp-cv|9cV3p}a6)YH|U*t-B1(xxuITc-!6nM9`rWxvAZclZAhq*v#6>wby( zou44}7nh?x|0lqtU7ere{G{PIfOzd;LHS+Es(xL8NOk@ZuD>J9ufHW;l_A7y7k;WP z|1j;`@aZNP|3&SHcln&ko9psBzi!`ytwo)GKg9g5{loMN!_2?)3YXKuaBbB4 z0^(9bm;aca`6_WtkC8+7t<6wh{sVRSmu$2AOSW15^SW#EyZ&=@1Q*gr&OdX0Z0U8& zUoT%De-?T7tjh2F+&}y;^FNQga{sRUG5Tp^|I7UHOvud*TzbyWdyDy9!@BY5>hH$E z%g9q*{#$?U5;fjifBv8E-|2a^F26@V+Z$tkcVnuxGJjnDH|z56{Dzgk^Bb1m%~NJC z&p#Lc2QEaHD<;hRVdg)^2{Lr|?eI7*y>e^;$+GOV&&uWI>}^8T-u@8r4lrIzpPxpkwK@8Y@j zpqB4i-rv>ocX`f!*Ye#wXP0aF?w+%^wR{iH+0k0Qr|0ZrEf0Cl?$z?WJZH~p`QDzh zQ?+~_&)J_^zOU!(N-f{7Y%gm0{+Rz=)kv==%kJ3C@2b?v*nPWsTZJ($5Axi6tmOw+ zNA+69U;|kB!^&M+hi`~~C`RB-YC+|4ZSK{pO0p$LC zEg1g? z)|I=4@|_Dz-i^2SlaG>5r5^c=jr6a#(Bz#%ypcS+*!W9REJGH&Q9Ew~Z^2)i)X(?J zou0aRbSwE#9hdLumHO15CqAY65Ax>lei7BzPn1uzKmVd0kNrz=eC}83Inj0plHWxx-%%*~!yUeoYsur_GEaLCpRdHN zzvqKDs^A#cmrH}cV|GoO|d0!?E zU1>Z_F29{2_Z1;`3lEJGpnA z@p+o+dGeW0sb>fILh@ZF8y_Oq-`qsnzT~4fn4WVee;9e>M&mNyI?s<2Uhwku|{F?mhpZqsekl8O#hKuiszk7?mcW= z_9gOKKt4u(v|&$v%Sq?^H+&_l$TyM?kUvCzF}eSU$#;=oLq1G?Gx@FL9gmv)3*`5c zM;9jzTg z-}aR(Bj2CAlU)2Nc^ytZLVkx~?^yEe6TXr^lAq%AJZXFj`9ks%x%d3!3G$)u8ovxoUTN~k_k4{Hu-&$h`@c2r`u$?^(O((Y-^4=BE6InS zHNJs*ZgBcb#&?3Oyl!#&$z6NiK_2>nuX6euXt?^4)AKXqw@%Vz?>_R;=Z$~Bu=fq} z;g^liARi(3Uon0e>p4mu{=M*of#-AlW*UA6M_{ro6@)G$+$j=9FRPHv)XWuYA z=TrXjCi2%%-ha#F-MVly`7pWDb2oY9?vrULH-Q+F66H?(ennl+S{GyspM43%i+1M`{eH>-<5oTT+Tn_wGa6axtka7CiiwR z{j*Hmn@aAJ>u=8>Z3cLw`<+Yq;XO@{yWjavPssRBslS6fyqEEt$j>DoAzw`1OFnd< z$v;kh8F-`me4+`zk$OUNOwWwjDJJjc@6Vhb`BF%{?xddA$i35ypF%Ew#3SQmc)oGh@4M`5 zJk)OdB+Bmt-l#nf0aridWE;=2ua?);Ci1P+KeWO0JNr48+&kC!rKZMPL_SFF?Eh-= z61iKy);sz4o1VR>r-yu){7~}E9XE zVRF|mOUb>Do4mc_&zs3R$X$O$$%n|@{LPS;$d78Vf-fKsU2U4rVtqbBo+W>b{FCI7 zL6gsre};UB{MY37fy;auT5j{Dll&2KZ-wy_$iG89gV&h;BKc3qL)RL=iu_mPL*&lR zze+wrzK-(S$-|#CJwxO>?`r)%LjExM-sA(HGI=*n4kI5T-mqDlhMl09p zztQQh#pIWgzf3+z9wvXCe3<-T@;Asw$=y8tJ9+q4)9?7(wX2Y^evd7m-;2U7kB@-X?qEtYTsx&K*{Ka~7r^3EaS?!M%YPDTF! z`FYg8j=V&E1bK`+berk9n>38@0S@L1> zk5SJ(Uq&AJipk$V`Hzzi-)sC-%HQPle98FfV9xwAj# zk`Iy}OZ{=DpWOLfDe^J$uT#EAKKzK4>-LEklb6UBQ2sLV$fG8I5&3ma5BY=SpCuoB z%;ZmNv4k&@XUW}t-A_LHO_Lv>o=3rTJfCgjGfe(0d5IjuLtoEPPsfPqar>ZOQr=rz ztLHWHFuBvSoqGIlnVyZ*|2FwB`EBGo?_uMx^Kp}R<6$py@7u=rr2HY|p*nsPd6@iB z%AZJHB6ss*4!Qq?=|8N+GWg`3Pa1diUj{Di*(qO!kJpI4%g?VF53@ao$k&25vI9}- zAAHL6yZN}0e58)&$;ZguxV?}({Iuygg5`dcyrYg^O+G;G&L3_fAE}eSoqVj0-%B2T z#>#yU%YB5rgFH?CB>6}k{{eaAJGJ%y8F?r9buFgocjVspOy2ode4tZsY^x?UX-&e3abTy(7p&-#0xMQvL+;L2}nGCy|fT@zcr2>i81! z@DFP1xr)4_j-N+9KyJA_uZMiJPX2sy?}xSew}HzzFL7Rvw%Cn*7`)MVzKVK=sOKEE z!%fuVoon-D4*BQFeRAh_4O5RdYV|pT@(+`Dkh^|=f_#YlILiNke3abT+vl8~|1|wc z%KwUdgnT9W>*S&TGI{5ZZFhRe-Taj=O;rDu-0c^34H*yp$n<=I`u8CpB0sCe5)L8v zeq!?aT~|mt5?t*M+bu#p5psV+tzDW8-l)IkflEDyo;Uq&UMwT;_?dBMhu4vhk#A-_ z1M=)IOnw^c)8q7$JN@T7{V$mOe^Ac{$wMz1zk_<#b{04cpWb*o5PAKCk^5Nebcm4iD@)G%rtj|x$NB&^)`?Od> z$;rQB{0YjBIsJb${#SAj2LjSx!><}2B;SMFf6e$J@?*#c$v;Crojmfo$?JC_A#FB! z>95A+Ik&tPIQ}=|I~n%QBp)N+m3$q!x83CRJBpCj2`=MyD6sK4M)@A_M&t8*>KXl) z>2daUGkNIW#{WV+7dig6@wqLQ@KN%PapS+G{Kv_C&+7AO@@vUUEKqqaouLP)~%sV=v>sB%ezj+1vOo)HBcN-^X}B`9N%Y}k~MiZK39+r z4V%2P&+EuTVUyS2Y=^Em`55)Pe$S9+H=4ZLXI|G{BhOO*I`Wz1p|?%mJ>NNveCTV& zXHK>ZE6GbaEBD$K`(@Wm5&GckU+{=>>vw#0celht#%=A1=ewCB|qUre; z`4D-S^2d{Z)ydy$@|Tl8Nj`e9@eu3(L-Np{$SMDV)4#=diu{k{gIlehyOIBsyn}k2 zHP~rC&c`cE&p#=DD0yfn({l#-RPv5{Ox}&dndD*WcYHqi5as7m&)MWz+LKes19ESQ zl{iHz)!~G`j&eLwEe5uXkJE`YBC(riz z8u_E-gI_g0&Ypjdd?;%5znAhqCNHra+&<+Mr)PhYcjNpm^2j9P$8((Tu)p=!;1(;l zo%gjjdG;aW0r}zNV_l}FmGznC^ju)_N0a+b&p{^tn@N_ioP1<={#>Uo^J z#P$8tmkq>{+SK``X8oBpnO)GX6o%_a#oA?Y}{_;d8v?KK%!Gp3qA^`Zv?_ zH1!wB2RMIcQqLviV}ae5+s9o^-f^wz`5fgxLmv8y@j>eUlGAgMaW{S*AUoFLKilqi3-#YeUV7W~ ze~A1sr-%2oH~G`xVz27|e(FccF`4TA4(k=_>12PMO+9atXE`47blpx=i zJi>W5Kz=Ow;9+)OPm#|g4-fiEzChkiK5)PBL&;Y;{q*;?l7E1_^a+#iC+{U6N?N(@ zzWT{K`i(pLd^x!ES0_Jb?)v3M%6GooC=@-Fm(AWLsL;vk-e2!u75%9e+ z{zLpbXPQIrS>+U}3SOoB=#y6N15DfAM1EHocF{l5;j85Bls|~vUu7I4Kwn2GXQV2a zMfnirk7Qaq`M^0=pF7Aq$iu$zE6L9#@1&j;nIz{3sxp7989H#ePb2~Sau z{rEaxvD+suZ6Y71{Md4<&n}t^-)l`iw90sz{8IAp8OEKTa8ncgU!uH!j@2hZJ&%x& ztT#RPk$<;|o);-UFwf+j|L|H9`Ekl;SDXCdEmpuDaCl@qcb;eUd5Gm64leC~4E-_J z{%tBxp{ig}6TYqq&otrNl;gbjEY_1{Tt(i=btFW7z2iw=$!zk^l8>@q){+mChd3VG z`tnW3*PEVODF1!%Py;*vW6F1|HhGu}eU+3mQWgA_@4iI3;@jYRiNF2s`3f#E z?Ct#S#^d>rCVZOm-Mzsj)^1l(k567&Vf>fmOPze+EBP4tIm##geRQClLRCSYddAN3 zl_ILIi^)6B^)>GLWsp4FW&9JG>Up1be5uvb*|B@cecG!XDgO|8mgSyH{nPvRZuPu} z<@Pj@-`0eGya~UZ`hAYWRn-5LCh|{GKC;2;h-0cT{MLrm{`*rKipU6u+ z#`{{V;J=ak8;rYov}3q&J0IMHAFmvLN6F`~8$El?X(GS0316igde-=!yiU}2&kMqh z>yuLs`}uxfCEu&>_}p|@ZlL_Iaz?6x$D8oy zl*0~ioUdn|KQxj5dlSC=pW1us#4c&)G0*@xH3!<^S)=J`hxJ$oKu<6*SZ z^bAt|FmPF4>c5}iIF+YRRd9L}zDha#(slDx+MRcGHj&R$zSQlj{9`QRLh{jDO^=(` zA0r=R`#U>!vy-p4+m6Rf|C7}JsB%WCf}c`;xXV|15z~ItME-B!VaikoJ754b@&gZ2 zj_3YyU&S{w({bdTx7Xh9sZI2(YQhsvKkeJG)So8L{@KcXaFQi#1DAE*ecuS(0q%B?~M8ycjIl! zQ8v!QtdFzj`;!mS?{&{3j#6$qtKa7|;b%}!w$88HK;F5?`tgHQwvl|`p!rH%`&{7U z7n;2D_pTrxJR;<&0DXcQ@hRq@HlXSLs8U=ey*?^vB#dd4asd`a6H-)h7D? zMR}j?yf5|djRi>kdG^$V(RuiU@8I)n1Vt9(UgFyU-+pX*>Z@fqd|C({m~HTudJMtMUIN|G08Ss)E}oKg9dJkZE55m+@17KK2dD`ToBS-M&21vTx(QEGPnP!3&EL(A^Ydw_w!SVQALIJ|4Ed+XJ+}Xzlsv@x!yM`B_vC{In7#d7i}C+fPNAw` z*JG^xv+I1NF{T|%?s43@_L-`@N&zqDQht=@2B(uRB_H7Df)1E$PYE)_fwBY`+pe={}%ZW$NzQY&yxFGr`-DcViWyiln>o#{eC|6{JV+# zo-hcF{H6CO$GI8plCxvSHIYA^@*$otb+X*WP2{^MKicD~zrA^teGdKlIh~s6YT-b8FuUnZXLx`S*qmrvxpTq0k@S4OLdS4`(JsT7%)N+q^J zL8=&C9~3g166w4LVv_mj=7g8ul*|VCMAq~MY57j-L_TH`$#e|$Po#@|U0O^u9;7nq z9@H(DO!ugAQ7r`oeTjTN+LQ3&8Mz0qkc-9=UD4PkFBOdyKnD3R6Q0;66x1G&pdhngrqK#$6Gu_FQ#0!OfFWVPQrad%SzEJG$M)5&# zM*FH@`O?*Eg20R8d%t^e_3%~M*%aD4 z-a2dc%$d;KKq!ze?Y6Jr4)C?wxqi>Sv^!qx>+46Bs#qZ3^<5*Hie{6jaxxuHY;B9i z@jc(&fi_uBF0%!_jwVArf?{@aG*wKrCiA&yYsBlzY)%w19viH6#`KeBV{jz8iapTP zgQTvF+F+aX9rcT+q$4c*EQl8SvXESWU_Med=~a7gG^ZC!@!jB(wAwmWE*BNk)^Dk9 zTp??!N8WP@^lpD&G`9&QCSnCoF8eI#N?=rUr!VmGTM~(E3SA&0HybVH6Zi`EH7lg| zFnVQp$Q%A;6Y03*!I!_Mk{93`)S+MQR2$XZdNLow*SP1d!mJe)TR>Ck}_!s_f&-Qo~qN<&7*>tM97E+OrYvk#7q;}l<3dntJBl@g6MBO z$wReJuH2lLN3~N446>}3>Pz%V`&fhEN=7q=El5w$)_M~93YXa!<}B2CDVw#pDj>g3 zxD47MkY@ID-UW%RSu|}T?nUDpi}`}~P{w7@q8jx(Tv8;Nm|(;a{X`SA7lGmNdsSc>0?pd>{;(W17ON4>T@YILFfC;?=?am; z4;-XKRV;&_R)CrH%}kSCropDD>i z@e2v506H@Wi_zs`#N*mjx(Lo+xk7G7R~h73q$AO~N#?Vy6Ef(u31n38M-^0n5?qY2reQjwJlu35j_P3f6*~ZwP9)-i8X?pTGgP}T(L)1B>xAWDlXgCqFODCL zVuV?ACe{&{x57s04>gaoQ1Pvm=xoz2V@_r?ZhToFHSppvt1$mPi8ko=Bts^RDHNCa zqDZ7G@>7H!FkAG;FnNeXrbUl>lnpm%t2>iH8QqJxP>R zl&D?W?doU{U&BVu3`>(CqJvK>id(NJR6++xuVHS`=aqb(bcfnU6x5Y0SkH6?`QBtV zOkI$37b$lEZ&DKQnO z+I9u{mQtNsx{PwTp*sDv#{IGih+kvAs#QIP0TL|~**M5iOs8SbT%s8@7u%AHVyTr8 z1}&8ca;f)=QR*5X-o=sG6`&c-@q>$oY+UQSIGQF=sER?ZDpu2*h@e~XBPzT|y4>gj zo4&f%X?97X9{gZTC9*LCcNNi^UPaBKaA0B7F$~2)HUT(G)Qh+}cw)c`y)vRjq~cg3 zf;#E?ED5;o&15!t^43jdZiA=0zDGRlQ3(dy~eLYqxeHBp>*Dzy}>tjfBj)i!q(yWwBQb#X(( zOrJhWqjH6H9wLcNHR+MrE(WasWSQU+(^KCP*(d0c&~>E28ZstE|ok^nq*!b;pQvkF5B|@OO1>)Ck6LTJF+1qkyFwo$uvw!T=u# z6@YP&h!PKK-3o%G*h&x=QGGYK5-Ie^`Nbq|6qjhUB9?kwVfu&#%fm&&^v?w_jgo@^ zt{vQ_6s8AOciG_aT5rTL+=t5b#0q`f#v#f1m0E@6 zWl2JGt;{v^eGpq2$Ux|ZDA)2uI1foAY=Km1?3?q2Ud(Eh#s;OW8`D5M)1D0GS2TrD zk7zr#1+u-C0&r%fQ&4lz8I=s;tVYxQSmcW;xl*1Wl}>7)tq^hYjGA< z@kUn$Vr*c*+N7)nSXlDT^;?2I&*NaietAt(D@j-fCBp{Wtl>&pD3$IhmnnBs$Q5}r zm~!bJj8*vFnhU+C?xogKkTu-qs+LM6^Ofj5r*@a4Ui4>3HBDr21z>h7Lhr!ibOmBiah$L*i!e}*tZ=`B|^0qz*atC*7md=7Ux z{*lPpff!=j?ZSj&ILO(cq?qL`cQ=a5!}$$sIP5(b#yJS8t1ENtVOX5Qk~>h9(qyzexz(rXFCu7pfZ-q-6`us z5Ug3z?v}vC%U8~yw>((6XwmA0Yl1cN<}Y8UeaV{^?R>D(#@<+fT{l*~$|PSP#~PSJ zWs@kG*4k8&OLP)OQF(b>iQe2AwVfqW+hq>1WzP=OZ2~p(C#@@oHvsEJtkNed#dskX zOt4mWtv<2H_pa30VYy{mBBxqT+%!CrSP;t>RT6QtpoNS&q;d-E`-_(^o!^cV?HQ6! zwk+7_$mSI8awQQ5-jZBr>2!?Xv5%|~6J@c3(TOA(muvs1elSRy(IW4!wFQ(mqb6oB{orSk;Rb79SN`<$M&6*(PLI zjzQaF78?B+jW-Y|WOyj8T_Y8ZxfzPKN!E1$25ccyrv~0konC1)oJ7_SGWhjDFOD@c zINQ@DOSi>FLnyiWU5lwOlxA)w5or#IV%dQ2c~Rp@ua1q zK*k*IAlBPp{)XKmgshTD%t8rl%U?k+Tb#+&zI!s;95@Th$ZnbUw_0`#kZn^8)oYFt&EOozZO6lZ~ zXX<6!RJGN@;Ke)_^Px5s-8jJxL803=nzcZooS-OZV||@i0ef%+n_jgJ$V8|Y7h4^z znsGGJ%WYwo!y}B7>5+*ysizGnOuH6`|1;Y3{@@SPT6gV3H%wW%$}@%lAK>VVW&36B zSIU^tsuQ1PB#D(IQ#a3os!yxn%%EFpQQzwxBBQ8c^YlcH z_g9{CD&rP&Nrc~`>rBqWY0?Di0NA6zaScU2pMmno9S{Nkw_S@_C^1q@;!1sh~X7tG&a%O%pp$Pmk-xWRa?~C77Jq zu3Xh5kjCkjhX51Ine=TelU4siJKdQ`Nx<_}@uu|Aj&>*<7Fu3SwsXpOs)=3av8LwK zsf%N-vf--nVf5J=K4*n8G3mJ$aI0B+zaoNmv}21Pz*DVCbLwZ1OpCdAZlSE31NzY` zt(6=fS8fR1Vb3fp%Oi@?18aN4GO;QsK^+hbXMCy*2DH}rOrI_ugC4g}%v-=miDaFW z+g8hmM+jOgZ7VrBhr6$PpYnl^rOPPA!l$RVGKlPE*)q5V+hHX0HG{a2sp(5CP)?ZT zA+kP)YE(hjNw!$1-N1>GTF43FwoF%AQ%m6Da>nLh6+gY!E@%DvX*Sv1PSD~WKI-#E zn3Y-qeV9{=Tt8N(S>*_5xh$WR1p-rkqLtEW%EM=T0;aw=d3rLTG<#Oot6xiNV}HlZqVlz`7v+K|CV zD(RJ%PoDMp0ah##(3xN9x{BqL;j6=|Ry}4-f1PJ6S~z_ws|bKh5B(I6Cr8w^Y9tSO z$Src^lNwP}nS*+|Y110h5%T&V2^E{DjOF!3^P9YhZWqq! +#include +#include +#include + +#define lua_c + +#include "lua.h" + +#include "lauxlib.h" +#include "lualib.h" + + +#if !defined(LUA_PROMPT) +#define LUA_PROMPT "> " +#define LUA_PROMPT2 ">> " +#endif + +#if !defined(LUA_PROGNAME) +#define LUA_PROGNAME "lua" +#endif + +#if !defined(LUA_MAXINPUT) +#define LUA_MAXINPUT 512 +#endif + +#if !defined(LUA_INIT) +#define LUA_INIT "LUA_INIT" +#endif + +#define LUA_INITVERSION \ + LUA_INIT "_" LUA_VERSION_MAJOR "_" LUA_VERSION_MINOR + + +/* +** lua_stdin_is_tty detects whether the standard input is a 'tty' (that +** is, whether we're running lua interactively). +*/ +#if defined(LUA_USE_ISATTY) +#include +#define lua_stdin_is_tty() isatty(0) +#elif defined(LUA_WIN) +#include +#include +#define lua_stdin_is_tty() _isatty(_fileno(stdin)) +#else +#define lua_stdin_is_tty() 1 /* assume stdin is a tty */ +#endif + + +/* +** lua_readline defines how to show a prompt and then read a line from +** the standard input. +** lua_saveline defines how to "save" a read line in a "history". +** lua_freeline defines how to free a line read by lua_readline. +*/ +#if defined(LUA_USE_READLINE) + +#include +#include +#include +#define lua_readline(L,b,p) ((void)L, ((b)=readline(p)) != NULL) +#define lua_saveline(L,idx) \ + if (lua_rawlen(L,idx) > 0) /* non-empty line? */ \ + add_history(lua_tostring(L, idx)); /* add it to history */ +#define lua_freeline(L,b) ((void)L, free(b)) + +#elif !defined(lua_readline) + +#define lua_readline(L,b,p) \ + ((void)L, fputs(p, stdout), fflush(stdout), /* show prompt */ \ + fgets(b, LUA_MAXINPUT, stdin) != NULL) /* get line */ +#define lua_saveline(L,idx) { (void)L; (void)idx; } +#define lua_freeline(L,b) { (void)L; (void)b; } + +#endif + + + + +static lua_State *globalL = NULL; + +static const char *progname = LUA_PROGNAME; + + + +static void lstop (lua_State *L, lua_Debug *ar) { + (void)ar; /* unused arg. */ + lua_sethook(L, NULL, 0, 0); + luaL_error(L, "interrupted!"); +} + + +static void laction (int i) { + signal(i, SIG_DFL); /* if another SIGINT happens before lstop, + terminate process (default action) */ + lua_sethook(globalL, lstop, LUA_MASKCALL | LUA_MASKRET | LUA_MASKCOUNT, 1); +} + + +static void print_usage (const char *badoption) { + luai_writestringerror("%s: ", progname); + if (badoption[1] == 'e' || badoption[1] == 'l') + luai_writestringerror("'%s' needs argument\n", badoption); + else + luai_writestringerror("unrecognized option '%s'\n", badoption); + luai_writestringerror( + "usage: %s [options] [script [args]]\n" + "Available options are:\n" + " -e stat execute string " LUA_QL("stat") "\n" + " -i enter interactive mode after executing " LUA_QL("script") "\n" + " -l name require library " LUA_QL("name") "\n" + " -v show version information\n" + " -E ignore environment variables\n" + " -- stop handling options\n" + " - stop handling options and execute stdin\n" + , + progname); +} + + +static void l_message (const char *pname, const char *msg) { + if (pname) luai_writestringerror("%s: ", pname); + luai_writestringerror("%s\n", msg); +} + + +static int report (lua_State *L, int status) { + if (status != LUA_OK && !lua_isnil(L, -1)) { + const char *msg = lua_tostring(L, -1); + if (msg == NULL) msg = "(error object is not a string)"; + l_message(progname, msg); + lua_pop(L, 1); + /* force a complete garbage collection in case of errors */ + lua_gc(L, LUA_GCCOLLECT, 0); + } + return status; +} + + +/* the next function is called unprotected, so it must avoid errors */ +static void finalreport (lua_State *L, int status) { + if (status != LUA_OK) { + const char *msg = (lua_type(L, -1) == LUA_TSTRING) ? lua_tostring(L, -1) + : NULL; + if (msg == NULL) msg = "(error object is not a string)"; + l_message(progname, msg); + lua_pop(L, 1); + } +} + + +static int traceback (lua_State *L) { + const char *msg = lua_tostring(L, 1); + if (msg) + luaL_traceback(L, L, msg, 1); + else if (!lua_isnoneornil(L, 1)) { /* is there an error object? */ + if (!luaL_callmeta(L, 1, "__tostring")) /* try its 'tostring' metamethod */ + lua_pushliteral(L, "(no error message)"); + } + return 1; +} + + +static int docall (lua_State *L, int narg, int nres) { + int status; + int base = lua_gettop(L) - narg; /* function index */ + lua_pushcfunction(L, traceback); /* push traceback function */ + lua_insert(L, base); /* put it under chunk and args */ + globalL = L; /* to be available to 'laction' */ + signal(SIGINT, laction); + status = lua_pcall(L, narg, nres, base); + signal(SIGINT, SIG_DFL); + lua_remove(L, base); /* remove traceback function */ + return status; +} + + +static void print_version (void) { + luai_writestring(LUA_COPYRIGHT, strlen(LUA_COPYRIGHT)); + luai_writeline(); +} + + +static int getargs (lua_State *L, char **argv, int n) { + int narg; + int i; + int argc = 0; + while (argv[argc]) argc++; /* count total number of arguments */ + narg = argc - (n + 1); /* number of arguments to the script */ + luaL_checkstack(L, narg + 3, "too many arguments to script"); + for (i=n+1; i < argc; i++) + lua_pushstring(L, argv[i]); + lua_createtable(L, narg, n + 1); + for (i=0; i < argc; i++) { + lua_pushstring(L, argv[i]); + lua_rawseti(L, -2, i - n); + } + return narg; +} + + +static int dofile (lua_State *L, const char *name) { + int status = luaL_loadfile(L, name); + if (status == LUA_OK) status = docall(L, 0, 0); + return report(L, status); +} + + +static int dostring (lua_State *L, const char *s, const char *name) { + int status = luaL_loadbuffer(L, s, strlen(s), name); + if (status == LUA_OK) status = docall(L, 0, 0); + return report(L, status); +} + + +static int dolibrary (lua_State *L, const char *name) { + int status; + lua_getglobal(L, "require"); + lua_pushstring(L, name); + status = docall(L, 1, 1); /* call 'require(name)' */ + if (status == LUA_OK) + lua_setglobal(L, name); /* global[name] = require return */ + return report(L, status); +} + + +static const char *get_prompt (lua_State *L, int firstline) { + const char *p; + lua_getglobal(L, firstline ? "_PROMPT" : "_PROMPT2"); + p = lua_tostring(L, -1); + if (p == NULL) p = (firstline ? LUA_PROMPT : LUA_PROMPT2); + return p; +} + +/* mark in error messages for incomplete statements */ +#define EOFMARK "" +#define marklen (sizeof(EOFMARK)/sizeof(char) - 1) + +static int incomplete (lua_State *L, int status) { + if (status == LUA_ERRSYNTAX) { + size_t lmsg; + const char *msg = lua_tolstring(L, -1, &lmsg); + if (lmsg >= marklen && strcmp(msg + lmsg - marklen, EOFMARK) == 0) { + lua_pop(L, 1); + return 1; + } + } + return 0; /* else... */ +} + + +static int pushline (lua_State *L, int firstline) { + char buffer[LUA_MAXINPUT]; + char *b = buffer; + size_t l; + const char *prmt = get_prompt(L, firstline); + int readstatus = lua_readline(L, b, prmt); + lua_pop(L, 1); /* remove result from 'get_prompt' */ + if (readstatus == 0) + return 0; /* no input */ + l = strlen(b); + if (l > 0 && b[l-1] == '\n') /* line ends with newline? */ + b[l-1] = '\0'; /* remove it */ + if (firstline && b[0] == '=') /* first line starts with `=' ? */ + lua_pushfstring(L, "return %s", b+1); /* change it to `return' */ + else + lua_pushstring(L, b); + lua_freeline(L, b); + return 1; +} + + +static int loadline (lua_State *L) { + int status; + lua_settop(L, 0); + if (!pushline(L, 1)) + return -1; /* no input */ + for (;;) { /* repeat until gets a complete line */ + size_t l; + const char *line = lua_tolstring(L, 1, &l); + status = luaL_loadbuffer(L, line, l, "=stdin"); + if (!incomplete(L, status)) break; /* cannot try to add lines? */ + if (!pushline(L, 0)) /* no more input? */ + return -1; + lua_pushliteral(L, "\n"); /* add a new line... */ + lua_insert(L, -2); /* ...between the two lines */ + lua_concat(L, 3); /* join them */ + } + lua_saveline(L, 1); + lua_remove(L, 1); /* remove line */ + return status; +} + + +static void dotty (lua_State *L) { + int status; + const char *oldprogname = progname; + progname = NULL; + while ((status = loadline(L)) != -1) { + if (status == LUA_OK) status = docall(L, 0, LUA_MULTRET); + report(L, status); + if (status == LUA_OK && lua_gettop(L) > 0) { /* any result to print? */ + luaL_checkstack(L, LUA_MINSTACK, "too many results to print"); + lua_getglobal(L, "print"); + lua_insert(L, 1); + if (lua_pcall(L, lua_gettop(L)-1, 0, 0) != LUA_OK) + l_message(progname, lua_pushfstring(L, + "error calling " LUA_QL("print") " (%s)", + lua_tostring(L, -1))); + } + } + lua_settop(L, 0); /* clear stack */ + luai_writeline(); + progname = oldprogname; +} + + +static int handle_script (lua_State *L, char **argv, int n) { + int status; + const char *fname; + int narg = getargs(L, argv, n); /* collect arguments */ + lua_setglobal(L, "arg"); + fname = argv[n]; + if (strcmp(fname, "-") == 0 && strcmp(argv[n-1], "--") != 0) + fname = NULL; /* stdin */ + status = luaL_loadfile(L, fname); + lua_insert(L, -(narg+1)); + if (status == LUA_OK) + status = docall(L, narg, LUA_MULTRET); + else + lua_pop(L, narg); + return report(L, status); +} + + +/* check that argument has no extra characters at the end */ +#define noextrachars(x) {if ((x)[2] != '\0') return -1;} + + +/* indices of various argument indicators in array args */ +#define has_i 0 /* -i */ +#define has_v 1 /* -v */ +#define has_e 2 /* -e */ +#define has_E 3 /* -E */ + +#define num_has 4 /* number of 'has_*' */ + + +static int collectargs (char **argv, int *args) { + int i; + for (i = 1; argv[i] != NULL; i++) { + if (argv[i][0] != '-') /* not an option? */ + return i; + switch (argv[i][1]) { /* option */ + case '-': + noextrachars(argv[i]); + return (argv[i+1] != NULL ? i+1 : 0); + case '\0': + return i; + case 'E': + args[has_E] = 1; + break; + case 'i': + noextrachars(argv[i]); + args[has_i] = 1; /* go through */ + case 'v': + noextrachars(argv[i]); + args[has_v] = 1; + break; + case 'e': + args[has_e] = 1; /* go through */ + case 'l': /* both options need an argument */ + if (argv[i][2] == '\0') { /* no concatenated argument? */ + i++; /* try next 'argv' */ + if (argv[i] == NULL || argv[i][0] == '-') + return -(i - 1); /* no next argument or it is another option */ + } + break; + default: /* invalid option; return its index... */ + return -i; /* ...as a negative value */ + } + } + return 0; +} + + +static int runargs (lua_State *L, char **argv, int n) { + int i; + for (i = 1; i < n; i++) { + lua_assert(argv[i][0] == '-'); + switch (argv[i][1]) { /* option */ + case 'e': { + const char *chunk = argv[i] + 2; + if (*chunk == '\0') chunk = argv[++i]; + lua_assert(chunk != NULL); + if (dostring(L, chunk, "=(command line)") != LUA_OK) + return 0; + break; + } + case 'l': { + const char *filename = argv[i] + 2; + if (*filename == '\0') filename = argv[++i]; + lua_assert(filename != NULL); + if (dolibrary(L, filename) != LUA_OK) + return 0; /* stop if file fails */ + break; + } + default: break; + } + } + return 1; +} + + +static int handle_luainit (lua_State *L) { + const char *name = "=" LUA_INITVERSION; + const char *init = getenv(name + 1); + if (init == NULL) { + name = "=" LUA_INIT; + init = getenv(name + 1); /* try alternative name */ + } + if (init == NULL) return LUA_OK; + else if (init[0] == '@') + return dofile(L, init+1); + else + return dostring(L, init, name); +} + + +static int pmain (lua_State *L) { + int argc = (int)lua_tointeger(L, 1); + char **argv = (char **)lua_touserdata(L, 2); + int script; + int args[num_has]; + args[has_i] = args[has_v] = args[has_e] = args[has_E] = 0; + if (argv[0] && argv[0][0]) progname = argv[0]; + script = collectargs(argv, args); + if (script < 0) { /* invalid arg? */ + print_usage(argv[-script]); + return 0; + } + if (args[has_v]) print_version(); + if (args[has_E]) { /* option '-E'? */ + lua_pushboolean(L, 1); /* signal for libraries to ignore env. vars. */ + lua_setfield(L, LUA_REGISTRYINDEX, "LUA_NOENV"); + } + /* open standard libraries */ + luaL_checkversion(L); + lua_gc(L, LUA_GCSTOP, 0); /* stop collector during initialization */ + luaL_openlibs(L); /* open libraries */ + lua_gc(L, LUA_GCRESTART, 0); + if (!args[has_E] && handle_luainit(L) != LUA_OK) + return 0; /* error running LUA_INIT */ + /* execute arguments -e and -l */ + if (!runargs(L, argv, (script > 0) ? script : argc)) return 0; + /* execute main script (if there is one) */ + if (script && handle_script(L, argv, script) != LUA_OK) return 0; + if (args[has_i]) /* -i option? */ + dotty(L); + else if (script == 0 && !args[has_e] && !args[has_v]) { /* no arguments? */ + if (lua_stdin_is_tty()) { + print_version(); + dotty(L); + } + else dofile(L, NULL); /* executes stdin as a file */ + } + lua_pushboolean(L, 1); /* signal no errors */ + return 1; +} + + +int main (int argc, char **argv) { + int status, result; + lua_State *L = luaL_newstate(); /* create state */ + if (L == NULL) { + l_message(argv[0], "cannot create state: not enough memory"); + return EXIT_FAILURE; + } + /* call 'pmain' in protected mode */ + lua_pushcfunction(L, &pmain); + lua_pushinteger(L, argc); /* 1st argument */ + lua_pushlightuserdata(L, argv); /* 2nd argument */ + status = lua_pcall(L, 2, 1, 0); + result = lua_toboolean(L, -1); /* get result */ + finalreport(L, status); + lua_close(L); + return (result && status == LUA_OK) ? EXIT_SUCCESS : EXIT_FAILURE; +} + diff --git a/liblua/lua.h b/liblua/lua.h new file mode 100644 index 00000000..eb0482b8 --- /dev/null +++ b/liblua/lua.h @@ -0,0 +1,444 @@ +/* +** $Id: lua.h,v 1.285 2013/03/15 13:04:22 roberto Exp $ +** Lua - A Scripting Language +** Lua.org, PUC-Rio, Brazil (http://www.lua.org) +** See Copyright Notice at the end of this file +*/ + + +#ifndef lua_h +#define lua_h + +#include +#include + + +#include "luaconf.h" + + +#define LUA_VERSION_MAJOR "5" +#define LUA_VERSION_MINOR "2" +#define LUA_VERSION_NUM 502 +#define LUA_VERSION_RELEASE "2" + +#define LUA_VERSION "Lua " LUA_VERSION_MAJOR "." LUA_VERSION_MINOR +#define LUA_RELEASE LUA_VERSION "." LUA_VERSION_RELEASE +#define LUA_COPYRIGHT LUA_RELEASE " Copyright (C) 1994-2013 Lua.org, PUC-Rio" +#define LUA_AUTHORS "R. Ierusalimschy, L. H. de Figueiredo, W. Celes" + + +/* mark for precompiled code ('Lua') */ +#define LUA_SIGNATURE "\033Lua" + +/* option for multiple returns in 'lua_pcall' and 'lua_call' */ +#define LUA_MULTRET (-1) + + +/* +** pseudo-indices +*/ +#define LUA_REGISTRYINDEX LUAI_FIRSTPSEUDOIDX +#define lua_upvalueindex(i) (LUA_REGISTRYINDEX - (i)) + + +/* thread status */ +#define LUA_OK 0 +#define LUA_YIELD 1 +#define LUA_ERRRUN 2 +#define LUA_ERRSYNTAX 3 +#define LUA_ERRMEM 4 +#define LUA_ERRGCMM 5 +#define LUA_ERRERR 6 + + +typedef struct lua_State lua_State; + +typedef int (*lua_CFunction) (lua_State *L); + + +/* +** functions that read/write blocks when loading/dumping Lua chunks +*/ +typedef const char * (*lua_Reader) (lua_State *L, void *ud, size_t *sz); + +typedef int (*lua_Writer) (lua_State *L, const void* p, size_t sz, void* ud); + + +/* +** prototype for memory-allocation functions +*/ +typedef void * (*lua_Alloc) (void *ud, void *ptr, size_t osize, size_t nsize); + + +/* +** basic types +*/ +#define LUA_TNONE (-1) + +#define LUA_TNIL 0 +#define LUA_TBOOLEAN 1 +#define LUA_TLIGHTUSERDATA 2 +#define LUA_TNUMBER 3 +#define LUA_TSTRING 4 +#define LUA_TTABLE 5 +#define LUA_TFUNCTION 6 +#define LUA_TUSERDATA 7 +#define LUA_TTHREAD 8 + +#define LUA_NUMTAGS 9 + + + +/* minimum Lua stack available to a C function */ +#define LUA_MINSTACK 20 + + +/* predefined values in the registry */ +#define LUA_RIDX_MAINTHREAD 1 +#define LUA_RIDX_GLOBALS 2 +#define LUA_RIDX_LAST LUA_RIDX_GLOBALS + + +/* type of numbers in Lua */ +typedef LUA_NUMBER lua_Number; + + +/* type for integer functions */ +typedef LUA_INTEGER lua_Integer; + +/* unsigned integer type */ +typedef LUA_UNSIGNED lua_Unsigned; + + + +/* +** generic extra include file +*/ +#if defined(LUA_USER_H) +#include LUA_USER_H +#endif + + +/* +** RCS ident string +*/ +extern const char lua_ident[]; + + +/* +** state manipulation +*/ +LUA_API lua_State *(lua_newstate) (lua_Alloc f, void *ud); +LUA_API void (lua_close) (lua_State *L); +LUA_API lua_State *(lua_newthread) (lua_State *L); + +LUA_API lua_CFunction (lua_atpanic) (lua_State *L, lua_CFunction panicf); + + +LUA_API const lua_Number *(lua_version) (lua_State *L); + + +/* +** basic stack manipulation +*/ +LUA_API int (lua_absindex) (lua_State *L, int idx); +LUA_API int (lua_gettop) (lua_State *L); +LUA_API void (lua_settop) (lua_State *L, int idx); +LUA_API void (lua_pushvalue) (lua_State *L, int idx); +LUA_API void (lua_remove) (lua_State *L, int idx); +LUA_API void (lua_insert) (lua_State *L, int idx); +LUA_API void (lua_replace) (lua_State *L, int idx); +LUA_API void (lua_copy) (lua_State *L, int fromidx, int toidx); +LUA_API int (lua_checkstack) (lua_State *L, int sz); + +LUA_API void (lua_xmove) (lua_State *from, lua_State *to, int n); + + +/* +** access functions (stack -> C) +*/ + +LUA_API int (lua_isnumber) (lua_State *L, int idx); +LUA_API int (lua_isstring) (lua_State *L, int idx); +LUA_API int (lua_iscfunction) (lua_State *L, int idx); +LUA_API int (lua_isuserdata) (lua_State *L, int idx); +LUA_API int (lua_type) (lua_State *L, int idx); +LUA_API const char *(lua_typename) (lua_State *L, int tp); + +LUA_API lua_Number (lua_tonumberx) (lua_State *L, int idx, int *isnum); +LUA_API lua_Integer (lua_tointegerx) (lua_State *L, int idx, int *isnum); +LUA_API lua_Unsigned (lua_tounsignedx) (lua_State *L, int idx, int *isnum); +LUA_API int (lua_toboolean) (lua_State *L, int idx); +LUA_API const char *(lua_tolstring) (lua_State *L, int idx, size_t *len); +LUA_API size_t (lua_rawlen) (lua_State *L, int idx); +LUA_API lua_CFunction (lua_tocfunction) (lua_State *L, int idx); +LUA_API void *(lua_touserdata) (lua_State *L, int idx); +LUA_API lua_State *(lua_tothread) (lua_State *L, int idx); +LUA_API const void *(lua_topointer) (lua_State *L, int idx); + + +/* +** Comparison and arithmetic functions +*/ + +#define LUA_OPADD 0 /* ORDER TM */ +#define LUA_OPSUB 1 +#define LUA_OPMUL 2 +#define LUA_OPDIV 3 +#define LUA_OPMOD 4 +#define LUA_OPPOW 5 +#define LUA_OPUNM 6 + +LUA_API void (lua_arith) (lua_State *L, int op); + +#define LUA_OPEQ 0 +#define LUA_OPLT 1 +#define LUA_OPLE 2 + +LUA_API int (lua_rawequal) (lua_State *L, int idx1, int idx2); +LUA_API int (lua_compare) (lua_State *L, int idx1, int idx2, int op); + + +/* +** push functions (C -> stack) +*/ +LUA_API void (lua_pushnil) (lua_State *L); +LUA_API void (lua_pushnumber) (lua_State *L, lua_Number n); +LUA_API void (lua_pushinteger) (lua_State *L, lua_Integer n); +LUA_API void (lua_pushunsigned) (lua_State *L, lua_Unsigned n); +LUA_API const char *(lua_pushlstring) (lua_State *L, const char *s, size_t l); +LUA_API const char *(lua_pushstring) (lua_State *L, const char *s); +LUA_API const char *(lua_pushvfstring) (lua_State *L, const char *fmt, + va_list argp); +LUA_API const char *(lua_pushfstring) (lua_State *L, const char *fmt, ...); +LUA_API void (lua_pushcclosure) (lua_State *L, lua_CFunction fn, int n); +LUA_API void (lua_pushboolean) (lua_State *L, int b); +LUA_API void (lua_pushlightuserdata) (lua_State *L, void *p); +LUA_API int (lua_pushthread) (lua_State *L); + + +/* +** get functions (Lua -> stack) +*/ +LUA_API void (lua_getglobal) (lua_State *L, const char *var); +LUA_API void (lua_gettable) (lua_State *L, int idx); +LUA_API void (lua_getfield) (lua_State *L, int idx, const char *k); +LUA_API void (lua_rawget) (lua_State *L, int idx); +LUA_API void (lua_rawgeti) (lua_State *L, int idx, int n); +LUA_API void (lua_rawgetp) (lua_State *L, int idx, const void *p); +LUA_API void (lua_createtable) (lua_State *L, int narr, int nrec); +LUA_API void *(lua_newuserdata) (lua_State *L, size_t sz); +LUA_API int (lua_getmetatable) (lua_State *L, int objindex); +LUA_API void (lua_getuservalue) (lua_State *L, int idx); + + +/* +** set functions (stack -> Lua) +*/ +LUA_API void (lua_setglobal) (lua_State *L, const char *var); +LUA_API void (lua_settable) (lua_State *L, int idx); +LUA_API void (lua_setfield) (lua_State *L, int idx, const char *k); +LUA_API void (lua_rawset) (lua_State *L, int idx); +LUA_API void (lua_rawseti) (lua_State *L, int idx, int n); +LUA_API void (lua_rawsetp) (lua_State *L, int idx, const void *p); +LUA_API int (lua_setmetatable) (lua_State *L, int objindex); +LUA_API void (lua_setuservalue) (lua_State *L, int idx); + + +/* +** 'load' and 'call' functions (load and run Lua code) +*/ +LUA_API void (lua_callk) (lua_State *L, int nargs, int nresults, int ctx, + lua_CFunction k); +#define lua_call(L,n,r) lua_callk(L, (n), (r), 0, NULL) + +LUA_API int (lua_getctx) (lua_State *L, int *ctx); + +LUA_API int (lua_pcallk) (lua_State *L, int nargs, int nresults, int errfunc, + int ctx, lua_CFunction k); +#define lua_pcall(L,n,r,f) lua_pcallk(L, (n), (r), (f), 0, NULL) + +LUA_API int (lua_load) (lua_State *L, lua_Reader reader, void *dt, + const char *chunkname, + const char *mode); + +LUA_API int (lua_dump) (lua_State *L, lua_Writer writer, void *data); + + +/* +** coroutine functions +*/ +LUA_API int (lua_yieldk) (lua_State *L, int nresults, int ctx, + lua_CFunction k); +#define lua_yield(L,n) lua_yieldk(L, (n), 0, NULL) +LUA_API int (lua_resume) (lua_State *L, lua_State *from, int narg); +LUA_API int (lua_status) (lua_State *L); + +/* +** garbage-collection function and options +*/ + +#define LUA_GCSTOP 0 +#define LUA_GCRESTART 1 +#define LUA_GCCOLLECT 2 +#define LUA_GCCOUNT 3 +#define LUA_GCCOUNTB 4 +#define LUA_GCSTEP 5 +#define LUA_GCSETPAUSE 6 +#define LUA_GCSETSTEPMUL 7 +#define LUA_GCSETMAJORINC 8 +#define LUA_GCISRUNNING 9 +#define LUA_GCGEN 10 +#define LUA_GCINC 11 + +LUA_API int (lua_gc) (lua_State *L, int what, int data); + + +/* +** miscellaneous functions +*/ + +LUA_API int (lua_error) (lua_State *L); + +LUA_API int (lua_next) (lua_State *L, int idx); + +LUA_API void (lua_concat) (lua_State *L, int n); +LUA_API void (lua_len) (lua_State *L, int idx); + +LUA_API lua_Alloc (lua_getallocf) (lua_State *L, void **ud); +LUA_API void (lua_setallocf) (lua_State *L, lua_Alloc f, void *ud); + + + +/* +** =============================================================== +** some useful macros +** =============================================================== +*/ + +#define lua_tonumber(L,i) lua_tonumberx(L,i,NULL) +#define lua_tointeger(L,i) lua_tointegerx(L,i,NULL) +#define lua_tounsigned(L,i) lua_tounsignedx(L,i,NULL) + +#define lua_pop(L,n) lua_settop(L, -(n)-1) + +#define lua_newtable(L) lua_createtable(L, 0, 0) + +#define lua_register(L,n,f) (lua_pushcfunction(L, (f)), lua_setglobal(L, (n))) + +#define lua_pushcfunction(L,f) lua_pushcclosure(L, (f), 0) + +#define lua_isfunction(L,n) (lua_type(L, (n)) == LUA_TFUNCTION) +#define lua_istable(L,n) (lua_type(L, (n)) == LUA_TTABLE) +#define lua_islightuserdata(L,n) (lua_type(L, (n)) == LUA_TLIGHTUSERDATA) +#define lua_isnil(L,n) (lua_type(L, (n)) == LUA_TNIL) +#define lua_isboolean(L,n) (lua_type(L, (n)) == LUA_TBOOLEAN) +#define lua_isthread(L,n) (lua_type(L, (n)) == LUA_TTHREAD) +#define lua_isnone(L,n) (lua_type(L, (n)) == LUA_TNONE) +#define lua_isnoneornil(L, n) (lua_type(L, (n)) <= 0) + +#define lua_pushliteral(L, s) \ + lua_pushlstring(L, "" s, (sizeof(s)/sizeof(char))-1) + +#define lua_pushglobaltable(L) \ + lua_rawgeti(L, LUA_REGISTRYINDEX, LUA_RIDX_GLOBALS) + +#define lua_tostring(L,i) lua_tolstring(L, (i), NULL) + + + +/* +** {====================================================================== +** Debug API +** ======================================================================= +*/ + + +/* +** Event codes +*/ +#define LUA_HOOKCALL 0 +#define LUA_HOOKRET 1 +#define LUA_HOOKLINE 2 +#define LUA_HOOKCOUNT 3 +#define LUA_HOOKTAILCALL 4 + + +/* +** Event masks +*/ +#define LUA_MASKCALL (1 << LUA_HOOKCALL) +#define LUA_MASKRET (1 << LUA_HOOKRET) +#define LUA_MASKLINE (1 << LUA_HOOKLINE) +#define LUA_MASKCOUNT (1 << LUA_HOOKCOUNT) + +typedef struct lua_Debug lua_Debug; /* activation record */ + + +/* Functions to be called by the debugger in specific events */ +typedef void (*lua_Hook) (lua_State *L, lua_Debug *ar); + + +LUA_API int (lua_getstack) (lua_State *L, int level, lua_Debug *ar); +LUA_API int (lua_getinfo) (lua_State *L, const char *what, lua_Debug *ar); +LUA_API const char *(lua_getlocal) (lua_State *L, const lua_Debug *ar, int n); +LUA_API const char *(lua_setlocal) (lua_State *L, const lua_Debug *ar, int n); +LUA_API const char *(lua_getupvalue) (lua_State *L, int funcindex, int n); +LUA_API const char *(lua_setupvalue) (lua_State *L, int funcindex, int n); + +LUA_API void *(lua_upvalueid) (lua_State *L, int fidx, int n); +LUA_API void (lua_upvaluejoin) (lua_State *L, int fidx1, int n1, + int fidx2, int n2); + +LUA_API int (lua_sethook) (lua_State *L, lua_Hook func, int mask, int count); +LUA_API lua_Hook (lua_gethook) (lua_State *L); +LUA_API int (lua_gethookmask) (lua_State *L); +LUA_API int (lua_gethookcount) (lua_State *L); + + +struct lua_Debug { + int event; + const char *name; /* (n) */ + const char *namewhat; /* (n) 'global', 'local', 'field', 'method' */ + const char *what; /* (S) 'Lua', 'C', 'main', 'tail' */ + const char *source; /* (S) */ + int currentline; /* (l) */ + int linedefined; /* (S) */ + int lastlinedefined; /* (S) */ + unsigned char nups; /* (u) number of upvalues */ + unsigned char nparams;/* (u) number of parameters */ + char isvararg; /* (u) */ + char istailcall; /* (t) */ + char short_src[LUA_IDSIZE]; /* (S) */ + /* private part */ + struct CallInfo *i_ci; /* active function */ +}; + +/* }====================================================================== */ + + +/****************************************************************************** +* Copyright (C) 1994-2013 Lua.org, PUC-Rio. +* +* Permission is hereby granted, free of charge, to any person obtaining +* a copy of this software and associated documentation files (the +* "Software"), to deal in the Software without restriction, including +* without limitation the rights to use, copy, modify, merge, publish, +* distribute, sublicense, and/or sell copies of the Software, and to +* permit persons to whom the Software is furnished to do so, subject to +* the following conditions: +* +* The above copyright notice and this permission notice shall be +* included in all copies or substantial portions of the Software. +* +* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, +* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF +* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. +* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY +* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, +* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE +* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. +******************************************************************************/ + + +#endif diff --git a/liblua/lua.hpp b/liblua/lua.hpp new file mode 100644 index 00000000..ec417f59 --- /dev/null +++ b/liblua/lua.hpp @@ -0,0 +1,9 @@ +// lua.hpp +// Lua header files for C++ +// <> not supplied automatically because Lua also compiles as C++ + +extern "C" { +#include "lua.h" +#include "lualib.h" +#include "lauxlib.h" +} diff --git a/liblua/luac b/liblua/luac new file mode 100755 index 0000000000000000000000000000000000000000..4b3de4f822bb33f5931d8ccbd5327b4988dd1a0c GIT binary patch literal 154588 zcmc${e?U}K`agaLP)F2eG%G5r(VYrX3(Sg1%^8@1J315vC}jqUkR}Sj9i{xi*g$!^ zP0?<@-uo-t-FAELw!77CMpigLh}JtpUCY&VB}=>GWRfMKm3&^$Ip;Ei<@deszrItK zd(U&udCqg5^PJ~A=Q+>4)_Z(82_}fYA^P4ibsBb z>RVpYxJ#0amCo>d>C6HKH|}*r5PmO-yHStGqk1W#UW%w^+`9!j<8Jhi`bJlw z=wD%i6DdkN=_a|^-`JhX(l7szvWT8jU*?EYUv@FLai2PhB_-o-)Vm$^SpRtT|N7UU z^A6G8x%eUp`i;Bju5?}Hl7%-;y{>Z6{dJS;GH;xGT(Bc zQp!W!7bm6vW_*fi_&W1XOHCVW3vTr|rTq0a+h2xSl5A^T*ZeztRsP*l;t;zzyy5Cu zOMYJ@W!#*Rv?n1gJ zgCr$*hMH&DuJum%Wm4Dg8pk?80;7lS^qYihGJBGwYjM90S30gK0(OJA8#f0YZpJkY z*9=@UaXE2i;mXF9gNuH-xMWT({#Yz*UHgew?$CRLqmoUE)r+dARNo z=@M}-#eE^JGLfd+BJo@y?n}h|KHMwCGu@WqT8^seh=V!5Z7v4 zYjD-$3gB9Yi+&IBoAfa5kKj^qJ&NlwT#w^=0@qJ*J%#IOT+iTo7T3>l{Sp`beueAT zxSq$g0oMz-==WP(zsL0wu0P^B`}b!6UcvQhT*hm7{+meu9rxF9ZN&8ku1&b!!u1X= z`nBK+<7&nA-0JtqfaOXukUY#?c@ZFEb_ZP0%`{0_4v|lG2 zUjK2&_*>7b-Q6-LA$_*_{mJv*41IN;<=7a95zjPG($IetOT` zZ}uL3$lCh1%hE^8ytin9b>yE{S2n%9&UV3?@(+FyN%f6*`>NkhS@vT4`@b!5d~@RA z+YU^1*s?d5l(?5zXTCP=Z@thmD=N^sb}H^?4sn{PgErr@hvBY3b{GI<9dX z*TyY*{nAHs?%zM=!1L{o+<5qR?M;t<{Cecs!#AssRen3YXwxmK|J7fWO?c<)f8Jj_ z?uN3gCnuz&K&K1Z9avitF8-+uVwe>hR@=mU>` z?H{>wTk#VQOnp7~fvKO4y<$xIJ~cDD^8T)!s}_x%_~MJN|8;lC2it%8%8adF<<&T@ zKka^b_NU>cS+ib$>(igE&K~{8smtzu{Gubfj-B`R?&oLU`O{Z-T{23)`J%GubwBI= zAM?*veCf^h?EYfZ*n_{Ge0_ROS26hWX!6XFH$OXKXq{zd=aiQoS(Ls0q&GWzpZ?GV zBj0rDU<(jr}eVD34aa0xO8~-M=r;;E7n(Syl3BY zSMM!)_P6@o(?>W~M7Egj{Z(BGMD3ivcTAEr=0|eFfc+S}>l|=e`hTo^Cd%7zo&9?e zfFCRWmvi7*d=B`(&VlFHIp8zSfk!__`M;h6zWf|`?mP#4>N)WI@*L&IoCALGIpB|- z1ODkb+8qJ74cFPf8_$7x;&nT%Y+r^r` z0_EuUXBbTcmwZl^rZtLw1;aUf!>vx1rg5cTLn4QVXFFN?CiYj74h-Y)9yiDT4*@?c z%J)p?aKmPJN5H#W91qzQ^vf6Yg!7y%eI@%VNvA+B(b?_gcz!G34~TY41%9u9|I;k! zT>lRVI&5#qJ zSDOV~6MQJWk(W2{zbeLS!&!9th5U3Ka54;U2>E|fz@76r+~9Mkz>}ZJ@ju0CK|hG{ zHZkw67VsMc{iU-w9z(9)7IZpuIi7A&{!Waq74lOj_#nX2aAVxFIi6V}<2KQ*wSdFd z3ixLRe?H}KtAO7t+T9@Zzd_G20e?m4`Akv%q`;Ftjng?tz$b}z({JW*L!O@&{0ZE_ z+ok;>{dNgFRxyrOaImz&C@H3chRK`{|3aF69~$Lzoh)tG4}THk5)kv~0+uUDC4wHOkdyraev9Bw(?KVL>=5v$ z#khn8J!1s?A>gNRDSd#`12Wj}fZ#*5C~x%l7l6||ed(-uy58uQ(0l0u&qadHYT3yk zhJOAZ#{cuALeZ`$E{zd<*sze7ze8k$?%MlY%X5@H=_I+L4R1tbBciX z2!3`6c{Ap9u_*5p_zk=9O3-hWQhuP9+C;ngf_^cK68UAxuFKEj^jt35eO2JM3Avpl z;9CT|E1Q?UUcgU-5AYsJ&a?P@zM$VZmzQr5<;m$w?S_T^UnAfpf}dR;7lY8gg?=B3 z@;ySX40-d2ade9DO5??)GopN{pwlPdX3^j3TqlDR2>7i6-XqqF#{@h<(DTamoSr`l z_qx{|_wMuzScIATF+VWbd zqOz*0Myjq_DV2B&^GX(#*N6gzdD)d!%gYNFEUYZ&c|V$i#>#kO6&02K+Qn$Ix@O68 zrJ|&4@lvV0ZiymQR8^NR2OQ|`y>D4H%c%A%wUV-A8Bh~>WlITKQn6r3rG%`q#S3br zn(_sel~rZZf`wHzid3sCTCyB}Ym}-*Qbl=H1wB^+FN!RvEHA5CzJeh59~jGPYL-`_ zy|M+$lB(s>vhrnR%c`Z4+HwW$Bflb!L?Ev6E38cQ15!mpU0$+~kWkye zC{@&yvz}C}tXZOzQ*yx~YO`!HwOJd7v&4H_$-U(Y)vTeGaRUPI8B74b#DFYYfF4!w z3@TVvSxHE#byljZ)?ZSwWcd=Q(!T)gDKA^fIK`5{u2faC#{~;(mn>gYUPlRE2~mjJ zJh5^yhLaUS*NyV1%6P`$NDLtLl_)g}%E}jFG+3TewXmwHvU~w}Oqi=Nx;5ps{z|2G z$%725uLP{GTvo0u;3XK1{^hkx?pa-ntOTg8Gfaz z5?ola{9aa*S}UW$@bez{FcJ$EE%aA_VXUhqe58ms%ggH&j(jvS+ElQ=Li_a<^E+0%WGIgG`zT~iu1j0S=9=`U$hy=6dGM6Rw;f+7!ou< z9pEigEUCoc({Qmov>Y3C8ipn1m3)luEn@|U;euH#y`(nQ66=eC(TBjZ{*&1F7Y_8B z4-T~`q>yzlj&hoMY&LVYQClk(RQfs7C>6&ibPGd5BW=i8iBiRB;iHJg2U;e?_f}Rd zTu_NwLqp2v7N>G~`AP^krYa2$i4S`Kbg)n|V&l6GoFvq-M)=6_iHJ<99wUE|A2Xa< z7-){BKhswwC@GkXTGg>S=z^e{DiQLN~?K$!^nQ_5=<|G*Sjpj0ndzJ$vGNGnssFw!7U9b+H_UQ&&$$3#@+l6x03jtpP} zhS*q(D!i?d^5rph3}PY|T|(+Bxfi0v(3e#~BO45gm!>7PWu!)8^KrqVMR5~t$#UT4 zVqa4pn@o%+3zo-F4pJ2l(1hR<5Ca(#_7ad*e!rgy*uvV{n0zti$1B8XF;EgmDLTVt zDK_1JE^dGaCcRP>Yf|t`D3cP#0^<4d1z0Z`i-_^dsuuaV+VRnXht-8x#Tm&3a!GBx zphIK^aSdsM0eoIDF~kDQTA=9?$5J7@_d(`(KKdCGXRN+hYI(*FCXXR4P!hCUlVD?R z`Pmv!BJeH|dZoOs94ggNT0WXmXU#-p8cgsnH`MR~EXa!)>awb3)eFR$NBxO)!B=8P zGb<>@B{snTpus2uQwB8VSyMJPh}E?4@v#TP(PhqXfn(W%T9)U-+H${ti9zL(T0u>& z&zqH9GUeJS*WMr*&({w;Wn>IIUVrV>f#;0a<5U=V3F5!l6Ne-+c+x;Vj7MomTxzH^ z3@M7(pz<&w+1-pM)Bo|mg#W1gxl5fp=l@E{|9|DdKEVarGf0vRm;aI_*s3H+zY!Z2 z#HFw}3&YQL{*oo5B*`rO1^EPf^2ui~48x>mkyb9I`a`95k$#Hh50O3;>9MSSqO@0} zd3y;1?e+C909GF3bRm1s!d zq&WD9IQZf?xUom1?CLl;26W(87Y9FY07`K)oQp)eu}7!u^>J`RMhM;%2OmuU@p~=~ zZuqDuYeO7-U@r*xOL1_+r%UBuiGv$HGlDnA!7n0!_=V%(hOdaSw#LCPHVWh36$dx= zxRkvo4t{A|`R+Kl;j5r*Jq~_ZT=||jxZy*h?7ld-;p1f0grA7`Kb`^jA9EahLLA&0 z2meVNJS7fpkAvId;8(@LQ{&)Q$HCL%;Hh!&%s6;j99#~5Vb=eE86gMXHMhqy`fnKX z(Riu<%CY!sxx$GjN-w4Yk?wx{u1uyhP1Q&jOD9m8rf4M0(x-PLO;a=S3QHfSG)>9K z29`cTX;K4`CYC-(X_}gm088(sG_f^O&C)w5O;a&a%F^#qnxfG)<{U&lv!&{3)erDn+_k`cX>L z6pD1Q^h1=UsS^pa^n;Y9DHC~xrE4fnQzf#2rSGFOO_4|wOE07}sn$qmYzjvni`ROmd>IyO^Jw;rEjJ*O@&B0OHZLRO@WAwrLUnhiGIY&(i136 zA|H`h`VvZ$s7HFfr~Z$jw2ji;ES*eg68T6MOD9m8L_HE_>C^u}nnXPE3QHfSG>LX( z1JVVu`YmM7s_#NV%hX>+6S6krN+9uRqYk62SKT9PqrSnDtR~qvJq?F%3yE7sSg%6i z&Gf8$@KhwLy9r&stQJ`Hg0~>csz-X%X%24hm(>Hotxn6vu<9|(!ECEl|MV6~a?SCo z+g(Lo^+e0vz~U-&ss8|$?+autSI*cccRHEM*Z<%!Nl~+`9@Bq?Czs=2Ye&ib?JiCE z)px-&{rhV&>WMsp>ktb86L=#ER8Rr znk)F7$@2KMm@u;DF$XdyTN){$jk=b4tljYGuJMv5{7AU5*Y*q>i zX)M)IJE=_PkRWdKQ)l>jxfa}_AAwaFJ27eWdZ-z2UcU$o4W6#{U&^`l3ry9F{>XQ@ zZI;#m=}90Bp04#@!Sh!k!_^F!6xl;%c2L6wtjr2a<9vX4xdJK|>@Y=M!vkb8@Mg72xbzNYhe>7(JA$=``VE&dN%KMVqZ>7J#vb`n%>wR-sB{1^#fk(}srR{>HF+o^pZQnLx`(^CB<-xVSZgFx0mMmX|)A4wAQ;&F?0Sj$EuhYMpjGPR4EU!e~D$;fKlDO=n?Q!tUfJg2lSsYlvTDHdJKTr9y2Iv1HF2A1guNj>Geq4SDKS#D} z4w(Vpy9$eFl`htDOI5}0Q{8r%OaVERpF-=A#q*wJqiOmK#XQ|118u&Zzcdcp>SioEuQaPfm0^J6*z5@)zx;Z&*JHD1=c(O zNu6rvNUMPq!u>uFA3DJhmx9hh;B#q3i@fSTW%Zw|WQ;Nw9)altOfyCuTKJ&lIZoUQ z3`btES1U^KWb`*~lhs1IQ}x-WTOPj;GR@>k*4%cdx9nqWT$B1wm-?^P$WT}CvzeBS zttgnP{p!o{*jpRrP-%4_tjb{J2X} zw+6ctrzcn%EJ?6x5-km%1KD(wR%oBpGTp$()b@Ix-DYWc4%zxIfWWd5>E70KB^71U zd$*XBA%VkZPVQ`(X4J|EQx$!=Q8@U?NX6dUNw}x}NMYSW1xatg9K71{@Z-=ZF7+7Z z|7P0B=+7MQ?{_;^gVRs^0Ew)-0UEsf8EAkAl&8@H`Z2j68kX1_0EUr;y6p-CNN zyEcKLHn)0M)~2UGeVFx;SZZZQ)c-m3Lov64T=%$22K4RpOW!;Kfo=W_1GNtWujP898p_Gq*gY7g+fh3* z4%&d$NuZdD@oapVCKdYRl*>9=97ZK~XpKo5yAGAcQKipg^A|-kTdpz6WrVXrg^mQG zP{F{HcuvgU-cE9Z1gk^PedDa6KK~R z?nf=X0;^VJ0iK$`_DL;vqkXxxJIR~q$%MieI-~i8->^y81=>r2KSswGP6v=$8ZHDX z-rmbSvGzn`r=am8->_kD66LJMXGjksJ`ufXpB ztTg5sCSq!Al4pcZ?$les`p9Zl0P+aAVv69BxCWo65_h3QY<;2$9h1|HFm}RP4wp7RpEpoxG~mhj>>ZLJb+7(2YG$A1@zvM`f&V_Wo8gIX4Aa00yGI_5 zKTfk8nuSGlC;AQ%`yeCi4ZdsA^MJ+e__RJ8nac6-S@8R#OqkQD|3a9*hQ^Ql5AmMc zE%AD27_dP0$ja?_UofUI`tL$HF-lJyT%#k#ciHdiPITQu6G!4hPunA1H= zQ)WnkTPFL>w8QjT+$U&rdq6KtFtM%bY9R0iJI#5H&;7ex!86cPa5+Gm6xv5(d;8|^ zF%&JO8BQ$o2i&k9M(Tfr?}s+ISyW7$ZAJ64=IZHm+nGNZhH1*$GAxm<;FnlMPwt%+ zntpn^ku7`L}38R=1CrIz8k`VFdjGcegg=5hc~4OCG5WRr6W^_1=L+nnTM`CNZ53c*8v*PtY&PqVcD zUMy%S#>QSOX_)7-mTi?aXAiMK8?v`;JR7ERtU4LJuyx?Eaax|=qMsn?x(!gU6#{^V zetjLBinRN^7)#FPCy7uCJ-tCs9+15GReG96PvKwTDFaVU#QeFowJCDh7MgN$V!|e8 z2-9m?u2r^Vx3#Z3^UpVX`qwzuo!NuCk}qosZ_-oRSHU{-g$hlXW~yM>_+YZ*RQ=@U zk14Z9eh$1&U>HqZSgbL60)MU*NvFgrecj#!a}^7H*a=_&43e}t7_A#Kwnb`hVtya( z#)x_ya~|>W4j!HvJTp`=2hUuk%)_n{+aX|BdtzFCetl1ouQBY?MxM;m zyjGt&Tp0!tIq6l+aWW()=4UpO1uSc0#8ij<&}z`pxO43bmW{c|j<)*$BB>+cYeR<) zVrzFA*kyIJa=usPDB5HCm7$DF(>_e6Eg1G;U(w@=u7hCu`$SuF`I%os^Yi z3O#@vLDGJh75Vj@VC5kF!RTXj$z|I)ootsl7gCs;4(}w*S)X>VO-}2QTl*=Im+Ym?F+Dlbk#`X?1D```=h;QmRJxn3Agl9S>{nSL7Z~mQf zna@5_)(Wi5@6h^5(mT)yl5Bd<>nOCFYhUxiTsKGmbQZmilS-jagLIa`>jCQ}E!?=% zr{-GM-r^430cPe{Gj@7|Z6+`2i6Ko?)N6vX1+!jl&C|>t4XQmDw)z~u)pZq;S> ze@yNVHvi^Ak32-Cm#n@GlRA;Mr{JJmJq__};);=!4?&Il?}*%^RxjskIAyK;}zp zg*l%gt2b-D46`~57>|I+u9{E1=(uWiVS$I#lMlrysmEn)rIoPC!7r`)JD^k!F0~G{ zNAil!kvD@cbn0$B6V0nfXk~-oftBQ8z@mq_5LrVDFn$C60p5R9Ai;xKLDHZmtGt`! zh)2ib%j^5d6E%ZWoH7iBgWZ<)W>UAJ|HNJzoTL-oaKf}V>3>3bbSQYb!tzu&c=|%i zQ*Fb$;3A3nzf$x^2&dZFO!6MAHzz8iW%aP$`VM3cE5*}c6c;mD(pRCapq>cbZ+V6? z7=5L2-?M&Z!=soHme-wT zDYG`q?8r02zxP8`Q_+-xj(n-lX=6($qdfXCjblbQ`XSwmTxt&=%`c#{hss)&Rhg%G z^dMZ9A%C|V%Ii@sbp^viWsE%Nn7$QEpaBO1%=6~A2iNo^`VYW6=IM5;ow(=q=ymh) z{*_0^egtl_(Vp(;_832KC;{>CNSddQ9i4PQ!m6y%rh)kcesnXJ803fe(KFy0bE&)4 z5A-Okdbj!|)^{RjKT_Ux-?0_0;W<)IOccN%OM^}!|10QidPGAQYirf$u{)zvk+_KH09QYj~e)IBr2kIN56uBQFWb_|n zu?y>uRZm3Eu!JWnU=T>@)U)1V;-_2&r=~KrGm(T7{Kja!i%DVBM`nd(Zdi%X3tqG? z&kaZS51wBf|8L>@8ifBKeA496zKkJl+;?2IObQzf8I7RCJ|&ssMwfJ4pADLif_|Hx zZQ#f1tzg!p2LaK-M6@uZV48`L9k&#dkR;i)Bzs(AHbZ|6ZtoD<`(#ji`abMrFrPEF z!I_>+-rP}d5@*z{Ujh3>bEEOPzu=P}|_wn-$CqTRPCkU5p4t`<@o=Q@(NJ&A) z(m*zlTmUbuQY?3R2o24j8)-aY55hjew-R8*qU_{ivf@c}^eiAl6_^DIOs0Hrpa^3X z#_IJW76IWq%<$2<`7qw6;6Y39^blog@boa{3OJ{gWXyU@JGO3+wc%v5km+S+eK>6* zo9N2ar9Y#;C@()pLe1AJ{ZFt=(MQaX;He80YeqPDs=^QZD*@Rc6N;vG4{SA7}u`*ZuN8LoV#DAMg<(yT56my&vn(6$8yte?ThwG%qro zj9f#0Sp9Whbc6Q|Fxue&mf^3J$yJ{3!&9+xvn9=KFSVrk?A4aEr|bcgw50vg-o);| zvu|Mcm+h~x``_(hc7NO6g?nsrjzPKKYFtz1%?{*`LDJMRkT!oE0z3MkbJXFBa@EFw`;KdMq9Gc_%&7D)o>MzCo zUj^fMH`}VDeH<#n0!;v{u3yP8vSrgLY@Y|l6B$0u1S>It?XBtLYKu=D>egHkfC#1| z7Q-B~e~+vV>&!J*Q0pWYt)z+sDmE{aLuiSZNZH zE%S_GU39#EZhE~~G3K+HOJQ=8PXUDL6aR0dg|g729n>jqkkBbxF(Z$U56ut#B>Yjb zR*NE;%<8_0F(zgo&+1XL`nY{QNWVg?zXg%ata>Kwz-xa^93800m@~+_Hi)2IY5)U@ zqiinOv?tc92$4Do8`?}5C738?8Y}&!!B__)gq067abUg^efkg9UmALs`i;7qtHdGt zp?qTf0sS4OqcA_1c+=9$M7Z&2{pE0W)?dt&J-QLMy+%`5FVqM*2Dt?XNx+JsZXp>V zjhPae0|xSPjK9yq2WqTwLzL;X#@)np2fPYeLl=eBkY#iomyv|dEHhEUwg-Gh#r03D z%P<(=_MX?y@ZSXde1WE8KjkL^5BZV=F19a(5YQk7fE%NPJRU9-pZEVIk3X0{PR6_+ zn?DafL+p*8KZ9pYXjV5(0{y(d5yO{SZLxV2n`q!|314Y)x5G%*{e;pGjGs1Vg^wogcO@tCXf)s z_9hbYJ-LLoz#9Fi0_h){AG9Al4!1?6~xNxh+x`&1AT3M^P(I@2NZ^ZBKlTbf0%x_$mmE-AI!E%aC^ww9X+yo zJ6JOt!g6~L^D_=d`)ok3p>da)mxt6!r!$4C43r(nF!TucD6_`nGh_TD?{Y@CH*11f zIS;{k$`CCpT^(xKnC0d1Mn&+RKrNsAsDOE?m`}$nC$6-@$Epmg2-dqLWm?8I&Xtn! zwBznqk};0t9ANy(wlUS<$T!zQ@sklN@`RqtwfR(MCX|;=mDAbYO}_|uq8o)A81sRS zj^LifLX=6N0^hRrLb*)c4$l{+mO9d|f2czsCT3^CwQP6OfKg=M$&VQ2iM1dZ^{^Ku zx>tejd1P`;oSjJ)AdHM~%PTXTwCccnm7;$-f%oNdl1_A?(w<5pnhx?ap#$&Iz?Lx`ff7pEc2v2aX(6Fo(QSi2vR=D|EH?QsQG+mlVor4%V!iQoxv zAe}nzMCWCUD%MvNO^I1*A3-^Lv2g(_Ai8rPo5`4oU`DSKj`C(q5+=ZZWfSASDXjJH zSs3Eyp>JS62J8BAl%Z@&V*lxc;P1fE6j6*VDc0@CMTol;@=QMe`27y`9~DIORPf9Q z>ZMka!hC=$$E&@FGbnzDLZ7%jmC>s&!F0$78}kEwOQBwJ-P6SSr01|A(SsFDTe9cU z-h5B2K55L2jgo{MoPR}IxE%q!Px4BC7W{!{i3fRRUN#fP!cdN4V#YA&`UuWf(}04go977RF`=b$~}+AYvT8R5XHq9L%XSve}sOseK9xaAZ9dbWGg@RS0cqJL3Ls69W<6=9ICLtX`zE8J**KI z$?Achcu@2<7XSlkynM0#t^ADo2m6~=gf`vGObps(Vf{eEBN(~NQw;|yC}%zq(O*iF z)>G3lah#G^yfD>_9*V8`*I+c;`}6Z#dx(;-6jU-dvD!%FUSZrrzhicy*m#o55V62^ zI*66@&QD>_R%0eYwZYkm$%J$Kh13c1?@>4m^2iFw(7d2*3MMK)fB}q<$Jy&K{HcWB zO8Du4tvLEU0}c7GQBI-OtZ3>az|@q3wL<2gR)a}OOBo8tYKB(Rr`~U7wgKGMckty6 zY*g$iY=Ik2V@qT-F_xoWdhixv2%bciA%E&Fea}JW(h7buGk9vKav8i&r>^pk4i(_A zF?K4Lh<3Z?LBB}BD2@d7$y(ta8&&}3o{F2FkVh!XN-|QJe~^V{_P_x1K@w^8L1fZ) zkJ{l1eqqw@LCfOMUQ5;Uk@AE*5EUt}?6bTwgd~KM5H1#;r4}Bt(F4DXKY9t9FRtE)D3r~qBsq2~j$qj2XkRC?o zr4b<~Z9erYxN2LEoCoHtJBU^#{TBS;L2S)0;=IsxPrKUDst-j#ee2PSuIz{GBQ*ap ziU?&`K{FyMaPH)OG6}`xGDKyOU&otRWW`AX_aj>xM}vTQ@UX%sLmoWWd<;QzCC86$ z;4EH*c~R3?E7?l!njd%SO%)aig4$69QIG3BC5nS*hQW*(Kp<i;M|x4#Csr)j)+~p|5}6?8lSk*;dO>+cI}p8Wy8tqWkyo)xSj93$5ZsCnn z?r+>?S^olcn*7@LrK{VaWnjl3U6+E>@f4V2Fd38VIP)dPn!X!05U3!{=+kf#ag$uO z1M3)zW|2)tyed?evAED2ge_QU*n(o6fl=OJ^-ddSS5~oI2O3M$2@N}y?^<1iNSE82 z*MU{h7vuV)jXC*GxojIF6trpC>6VQv>x|QU9N#-y*IXi-zG{9PHMxUu2O=dR^kNLw zW7vcXQ!pWqp3^>}Ja!3OVGAd29D0LDQ=un^j{Di(_E zIgSGa$|ZZk(WiVRt66p2{A(&8XBf_wv7CYG+hI)B(b9rwua$7d*2gV!$A#eh2kY4& zdwnjQc|6#cgsl^w-5?_mkkoYR@OoGHLcemiRjUC>WB(KP8=y@6D$(cT*!B9 zh>SqQQ;+8DGnQ9=WQv8G(8u`an(I}&yy{5`79<%K?tzu)(`MD> zX&Ej=-eepN9>hV=P)oxN$e{P9mg4RW<(pkBHp53t7VIS-1#o-GB?;Fyva$0x=2JWJ z)DP&aA$lSBj#x4-w|ED@vN5qCtP}-x-}JPVhvBfr>jD9&NU~S*=!Gr%=pNL4PV#!s zR99fF`6^38F+g4|2SymxcRsM*b0a13ShwDD1HCd7@JQ$ z1BB?D7tu=kGmlc8qLgWO-MxB0q$Ja=>ReHZ$T08;M12T+;FD)Uu-m!bb5rDbW-|xS z2<0myT)mzNPD=xh&|yP)tSq{z)5C1GNG&T%<=ECmxtIl@=^@pV%G5CU&c^L?G$h9BUwCBWrRC%GgBpsQ+(a)b$QJi; zEq}4*#0v&~TjNf(Xp-tl-}D@mO*6e|fS9W`*vx2qx_#4hAki<$#!jJwh1EiTgA6OF z6-&c4P(xU}n0C>|$l8ObgIJw33QI}|Rl^wDu8n+DeUDzcIWjbOdYt8vljt)J_PQR9 z?a#J&rb=5pH=4G1Zjd4+td#&-MLQV3IEN^ckI4PB=5RUg^w@q0qB}j4fV01aKc~|( zSe^1FvLcyCc(rRI?Fc$C_H#Z&vmidwgtz^?2x#%CE3FW8QzXR7P@F_$3L3$U29r-S z7Jm$^=9h^}^d~l-!7FRz52&oZN5*bS>ye?bEr@Rm*?Dl73RoH&Q6kcZ?lsdAit+Ly z@D~hgXe0UL3!lf_`~q-CUv9>BON#DqrnNizQL}|^A2uh^ZEG_HWky?@N6>9kGe!4D z|3)8Ypn4=((HEPC(e2mGL+SP`)3ebg>|7t?`w=a-jx;Wo;5#s2nX;+PSgeOC$t_e# zABMIl>?Z@uR1OUJp;}HKPMv7YQgeDxoV|Xf=Jd&-9PA*zgsGit)o%x(+(m#L?7L7@ z)E;R$s5msZ?hBfJbm+$q^FNQw-Q5SxdSy6$Qu_w-_c`sKK5OIQf0B{h^aT zGi_{eADJ$SA@<5`ucitqdNJf4I~f~}cgV(2O4(u!P&G#ER!qrlN(HkoCeFchWCjIH zAGbE?Nm*L~H%zZ`Bi=?O%YI7=n?tmf-!&6TK}FC^1b)Jnw=mG41VQK%0mqYG265X0 zbu|-z#)DMUkA8^oUmkE5J5NKrfR0hPPi-LVzRlQOcU11$jk zYM^ateuO<&lSE_9`3E16;1@Q8|JZ}~R!hTbuoDX$q-`vpr+Hd_Dz-&t@3b1LQieT(%h6tc#HV@E z5fzMuD;!ON^uwLjy5eWDV~hVdS0vDN>TzFM8|h}^agsbS7aAYtn$RwKB4TMF#0Vnv zkrn5k!d~CUU~6}za06LR%*r&Z>p0u`O){+6K>MI$fb?KXH~7OxBM(z_@OsVGXuN%m zF@zYiSQ_%G{q9)|TVr_BcR)t5ofh|gdL8jsV9%iXuq0@_)K(E>GMWOdpo2G!!RAR{ zPTW*Kiheb)Um4`zN(r7xVqUym%1snyiwTXgNA3)#a^O5&R!w<(P}m6i?MR3&aA%D zMKyp=(hqDVVVIlZT)#3|)*dobBf+|ANx6~*z-YH&Ry_#%>OkKE+&H=!fkALT=)WUH zE#f+X8t>ogrWT6dz2z7ZhOi>QyeZv`m4$gmI$K9R-DnCd7XJAiSof7~P>k zp*Pfy=-Z}I4?!p%E|4PLvRKxxmqW8*w-%UPYJ{4bv7Gqck+CnZCRy^2iXxW7lME}v zv1jcKEFT|szkf4SPc?3T`K5#gTzXk&FLw?Ec;yl9S8;?k(#sm54B9gW_cqwM^>lf)Re_;VQuQ< z(GuvUQ~|Ac9uopQpm+2~g-EEKGTt=M9q&*;J$aKATGD_7Yn!!yCwXt6VJNaCtJ?Ag za8#&SIhu&VSobcq+wPjnEn#@~arBHYCt$SkO$4}fGu>L1)AHD8l*%jn-iM%0_1}4F zAGV`j3XDhS1Y%n$Zp5sAJ_T=0IPl`N2S)(_tVwm9+&wGglgu8|p*+*~-qu4&vqFWb zDHTnfKnG3)TcL7x_`mXo=6nl9RO(jCojjNv)=yD7Y(Iql;&qmTJy;*1@By^?hefYw zg6_+NT^66KBBc#SAwLeu@U|MHGCww-an6heG6%4|CzHhsyU9TR9+^`xhLtgxH0c9i zY>Q;jfsilo_D!1AaR#V5EFAVP4F%EC2?rTJ#!jIw3xFkl1|1|OBzIotHLYb!<+_hSL^A-klUKfvMjguI959A zhtuIxfJP<~Wg0lP-jRQf_Ww`{-!eZPIRSdOb8g)i&8UKC_~N)Fzkyj58DYE*qErX! zy^?YtEpv=B+HINYR5;a^ndwA^-o(-7rhC&^pnaV;?E@Jr&brgLK}OcDm4`TSXJ;nR zI3DwsY_Al^n~>n@{|9#MnMj(vrVcNK=Pbh%tF;EoC*UZ8H@`@}K8cwiey^@~FR}aInU#ZBBkGOtkF|`&vwk_7$l2CN6{f9T{U)v7MFq4cCvKou zFAeptfp}Rhn<01_0uI&LHjK<&6iu$SMlWxI4FU_T%^HkgRnGz6vJga`)8|G2i89sa z*k1GR#%-Yo`q!qaXK)Nt(S&__C;i(6e2&o9Nsh{8AJS{e+!q1yEwDln8hYrZ1V8-n zd6)q%EZNzqOu>+StA4WyH21TG!Z-2WOr6YXUa}T5$d&0cA#4&AC~PlgPZ!CdzXs4c zGa1?1gY!g(uFOa1&xGDKlmDLHHcXY^!DH+5Ct$)r_zUVNuOe7y>sN|<+id=%El#f~ zc(4<49DL7=a{c*e5$^owXz?KBk+wzu8)q#c_x~2t%Q(M;DVFj}8h4yW{|fR*@!m|% zq1OqA<9>7P&t-VCqfasWc0hm8mtRhJRpYptR(-OsgWWT|X}g1c7g`!#N56u7*uoCO zW;)o1ZT)sYHd*mUyrXocfy}2494%ls@0(bQ+Hj)5f17~yi%0Z#_|#Sw(LaIjgVYaw zX`RrrH_7T~t?(u@ixiB2&JSunCGQf9FYI#gEkoPFWuBL%~}^Q?G&ThU_|D8Uo=?B|$&+^ghx!GBfQ>h8E+77rjcf%MqiI%t_036#w*TZ&fdpgFvOFN zL=idO@G0v05|^S09NMVawhFgeYTM$RfEdL#QdB-Qm9H!~hm5rznkY%swqjwkk&pdL zc+&u**1!7)lj7GT6(Epp8spZR*!-mZzc=W~Ov>nG-bHLcoSB;QJ0>odD>txaNF=h+ zh&Q+l1;Y_Dn?nKgfXyqJ-fhqdh+Edk*U)n^2TkjT%ZhdZR<{Tq6NznFVNqOw?0C!7SZwvi*9m&OC6f|$BC(zl zOOYs2KQL4w*=W$b6*D?vk>%#B7+Eo6tE3cE%;=U@X2abCJL`a6$y-jt%MU{;f=k^d z{K-K)siEI0g4u3#9OJ_Z`tcEo1Nz6XbfX{e#eM|7B)|y6=5Z#X9ocpu)?c=t7lxV{ zX1S#y8Nz3IBZrZudUEJJFtVP&yNXT^ER>e~6;2G=F|4in<0tSELSH{li!2TAfo&B{ z?DJI*zep_9=EHW{=RYsHis{>Vurc;2RlV60tjbqdvNIw55OFv*ztk^;!-E}l9HFiC zR=m27O^^*|-B=fo@n+Y1y!vf;Cjmm{#DTD_h7+NB>H@PT*xc*Oyt)KxKuV;Ji6>Mq zqoT;_USFQfg8Gl?%Lp|Yb<`yoZiE}(=L#+}cq6gT_iF^%V6?zA2 z7>k-A0aeITo`UTd+bO{lp3(9O1{$2+jfg>}&mpE*s3jk4IGSGwl}S}D!LAkq$j*~t zbhmW#IxkR^A(^Ifrjn?_bcBg)1i!2Vwds75b~CyV8$a4#b&(yl2a|^Es&2BUbn+m> zv{vjrFu-M4RCRcVug<5{+px=D>2+J)sB%-Fwpo84^A6D?*m)qOOk?vHtEvfx0k$k~ zu;}zpuhAC34AH_^U4s|vp%cOKS}!2bTT9*g>tMZ4Evw^iD1s$$cf`(F$bAe;ezgcd ziQlgou8YML!CW^um0L$-2t`u}qHkf^n0f5r*hVi90o9>bUxnIb_}T~Ud~6I#eubDjMKwPvjQz^9NZ94E<@<-42+(Ip+>CF z8CjdwUtm_V#|?TvfbE{4T`)-{=la!liyXoq9h!v{eF~0cu)9Wn67nGfBPn~N{)~~` zG{_$T*B2%l%gVVuCR8hk$S-6G#AV#AJe8m)e@ej|!&Yv`Lf`b0chHm<3oXZqF#o*$rR znv!_NS8@KW)Av7oW#z@tDxmM*ZtRc00ccieDk&l?r3k;;t3L^lTU%DhN*vR7B8kt= zt*v(jkHUTYnHOIkqm599*%YYu*H(Myr-f|n+I9 zYE$ULEI$EITXVOs>=>Aq;M2-eslXZ(V8LnR>(H;D;|!rKIo zFFuX8A2kiTb&VW(6-i+i!x$i`hq8d51#<_3j1Zf+?XTOOiBEGt4MDP@gE6DVkxc7l zYcWN6g@Y|)2=Xd3N7%b-zbE>jvNN%79n1EuaHEX#4+YIm*f1ymIM6=c9z}Q&7I*dQ zjBTNOTMN__g|g{?yA&S_E>1rCyt9ackxpc6D+t}gy$PYQ`%|e3?d?!)HL4*VSA?`W z*Dp?1QfNNOWxEi!6Z{sZIqohSDoF4vK#(a&D1JR4Jevq1+R50~LgyiRDsaM&m(uC9 zAqnxt%Xp~D)=%s&Zz~l{r2SbbcF}Y=rli4%ja}0g96MtlV2$1*`0u#OS~CjYS-_z% zPPrg3M~&uqV{ctTjXnJeYpB?Y#;}?_-NoC*=wx9W8d;K4FUHZban^9`XrNrWf?p*D zdlQ`v+x`DqKZ_!v_*T@=k2rI6dJPt<3$Y0*#kr-=UTE1kXE?QgJh5Si|5B_#y2dmw ztK>Jljlhc*Z8-eE?gnnvSs>t6;J@9*-WZ>g!d@9ife?{32dBG*_EK5B&EL)(Y@1IN;gA3aCcI=(^*V6Bx&f8 zyjvtQc`~1FTby;c9>Db=l}zVZi}-CZzg5x=nKHYRkep@j7U2wx+>&h8L1O0=Y>z z>_-ZX!}0$dGmcM(gFV3`Nx|;#0;eae&l$cl53ekOZ8+<-sywa$T!TH|t0W`dFVWKI z!D@j1F~`0DO<y}mb}0g)5u+S9 z{2!HD{2!L9{$I-F;G7)6(8GBUf1>{e91CD7cUcR{W&k?)z# zmvoI55p0yBVKHv_J`_Na9U^}zC1`;V_7Oj?3RTIpZH$7G?Ph$hjov}}+e^e@j6syf zKsiKHnLg>3hRXCwxBbkgceeZw?De$gUm|{DPnL%D5Yg<=U+iOm5Xa!bW_${7cozmt z-^&)=OKB?y2fEPM1M)=iFUP%VKeOZLAA5$z;wO@1h+=ny{YG`6C*wq*jsm6kgJic# zA0sl;Xu4XO!7Vg}^=+hAyCix|W2N0}Y5X_x0;|ks{ywIA{0V1rB?_o}o$Hrk050{y zJ_1491;@SpsM^;si)IkJvb5Cu23n zN{rPsvK$peyD;$tRd2%GBB){;Qz1tK`4__uF!FbSsI&9moHx*`2zgC;KD`HlSsMA4 zLBPxGWH~gp!v?;_e_s#$G3dxBkKrMyWq4?0ov4HRNV>aP(1m{XX>mbEkGyHb$G@$f zk^J#*ePxgIpp1O-h#VR@MQ%Ma6OO~7GW>@vFkt9c&-Ow+IDMEYpFHJtgx3s{)$Lx( zUwh<<*b`4&nIfP3cjWUT4E_}Xpn?L4#s7ZK&KcPG0*<4M_}@%=y+GE2O!{$dqyCIP zLGi0dWtYOMG+f;g{N&hrc{oD#O)D&xjk61b2VcTR!O`eETDFmnJ5xnKu7~vuiH%@KD%wZ~P};u@v4qLYo6&xyQDv8(+bCP7Wmn@a?vC z%j57E;mb@J`$)z~=AswH@Zo%y;z(VNdotHv&jPkgI$Jjmi*-ZUkL{=^rLV=A92F%@ zKq}RL;6;00$G=vTBES#9A_zx>_c>IH_nC;B!S+gaU5_={|wmx z<{r*}w6X$xh#`S2?tLCKVsjt%`STvGY6sM37 z4@_UmdISgIY@KIfM9p=;6K4<|p|7VI_5{#wh@qv&=pV>V1RPFDqd9tvK4I`LGJ+up z04P4Q$Kxoq=Ltj_JTQBBQcxcW-K!K2(j|DY=vKW4zL&rXJ8z|pbh z27G}Orjz*S+8#EjpBRI>2a7L?>3>F$7^zN2$LcOdA9Q&zY?GhEyF#2^I(p&lv7yE1 zuCB>A+MAnYQwpOV=SlQFVxofA3qIG6!-W?sUBAZWGL2IMkOg7+jC=1@{s8K#i5qnJ;k& zz1)hv-UkRsgkT?C@d8e)pehi0w+2%0PtlKJEsK7__UkY%X{_+EF3vu~^rWLSK6JO^ z30=34ywM==al4AfO;g%!WGd;bzX*tDqt#De+2y0PHE|CHNam=w1(I&lloF-b97k z)gMKpvG>t{zj^?7wv!f)^Vs{x@H%EYfgcpqvKTaBRwtqrZB=2$(Z>Gz^P)hIR26O6w6tpS=hu!u6L&uEO#!4L1i3@P65K|BzUM&FCcAHh-pgJ4A(FtC(1BOSqR21*OzwX5ww zUzY7uRzr+Okr+pILF$CO(-CRQQW}O}2lm3p^!NV@=P4@)pdRzWY5W$_7&ZTJcEUIh z^pQlc!~rTrXMJ1n;6)_C238Gcxau$2bL20vej;dyK7N>pV>G-Y6QuYb;-d&JW@6cjdh31vsZh{o(aih0aW@K zm~c!D!T(PmkY0ez-zPwc8~yth%>4UY--2~3@)e;q6cQ;TH_iaz z?;@Rq_0nZ|zJsrs_;*8mjuSPh(PFG8qz@2W#`S?8d)uSR)jTYhD}gUpOmQQU5Z@K` z?;218hq2s54?r2xR6^I$ihdlh#<0usbVsxUSo}XB4vWdjI84tGABZGgjm4=&^ruv$ zDQ*zxIg*AV1M?jLOPd3Lf`Q*EW8rUs?YiF%+sVGzsPl-b|#|2l)JA zuN-_Xw|)xIo1cR3V`8b-pT#N$MKr84+e|%hg>n%_-)VAqGV4DioL;rZ3MQo zUYPh`w%|0rx89CDc+KeOt%6VJr|j6jVkS4;dg4sCG%UOzdH-2FBAZP=3Z;!|E4LZr zpNIWJI(EGNhYe;A_MgVyL&1j@5FC%!NA6kd+LBY0;OfjNCXR7>jDK(ggG6@A4LBK= z9qo#q7g}Blo3JhepP{4iVdZc{OXU!{I11&wjt)gfnd*@HGV!(@T;&7ff%8ay@JI(s zIF~%@P!iI*nCQZL4Mjs%q-TT;Il7x(RIjuBtjvW4ykai^YPrOL5IDq+PDzbI!<6uR>*K2A8_Dh`H=T+?!iBV(eN4X`3mOsO)7~N0QVZIjiE%(K)V9I$cn#j!IKW(ND6RU(SP*>bI{}VD-^!AI zHj>OgqrPY)|46F`HB@fXx6`xsI$;ASW2Ziu5%l_o0l+v0c$$^K@moeONTpmHZQAJN zFFi^H(3R`K61vZ3DCuwzhn#M_?QkD&gLMb_(`eP!j284sJjwA>DDN@-zj+1Lih7zL z&jR90#Fw`M{z8n@0be2-$BZ=Rr5*B3Brk^PsMoYSRezkYm31M6csC|SSL8-m3SRAD zl3x01WUA0IZhU@i7mcX4G$pWR4*ta+%`;uy()#5UrY$?pIQ*G4b8yC@6BD%8_uxiO z`U86RPyjj`2~IzpyHFlU)e!bhOr(>V2fa5%Abw*Yadd2s^wpGp5e6P%xo;Nsni~xL zDQop9fqFP~E=1HNKQ8G`gu4^I&Ya=wef5tbI(&7p^6=zUz{J;@xWvrC_U#pV3Ysh7iax}7%>4X4~V4spR{H0;|m$d5VBq*0K%EnqY z&MgdfHwOgoy7yoeAL z-`3zqNL}o!Ht)lKLa}45d1bo(0Cv1yyh>B*Gr>gPCtKWmp=As0g*d&#?lX}*UfTK0 zIhIIL0B;oh_oSxb%|e_9lyltq|3LdVLl{f|Iu9-I9Uaj5@vR!@;E$o8vXYaOOJXMi zXQ9P<{&YH|iGSAPwt0{OER|iD4b?D0lsgf}Qz|?5`bR`pi*kF9f z*s9@a{$lcR<9KeX6>jao8py!S_~&#CPLr>joofAH-P2PbPPFJn;a;nz*RHS*1rKfx zzGq!uFr0nGL;io9y$g7h)wTbhAps(w@2FH`wHh_Gi5E<)Z4-euLuO!tiKYTdi(1-P zN~=|>Gl+8UB$eqnm{x7=_1M;Gdum&I>Y)&IOt>U?M-;_N4caPu7%+H)fJ*+K?|$F8 z1hMD${COTSGw-{vYp=a-d#$yTGiGOQ5xopdx3Yp~z__N2TLVGJ&m-lrl@W*@)V57V z=jIH@+j~OOi+e&BbAHPz@+xmr-fn))Besg-8?*dX=iynS^L7~6R&xV|k`1Uxgdv0` zEOpKPS^Uk#LtIl9e+L8q4Ci+}*B+mzpBhsbY2JOc?mAAQ2uR4kAL1{92F~GX{Cx^v zT(>)Ne(b=o$T&Opb|%PX%cDn%6cPx{kKn%t+K}o~xBN)! zNA}Ij;#12$=(UdKAty$|d9{*mFTN4Zh(GXzj^&E!gzcmSfUe@k)P2$M1hTYKZ)4~gJfv|vt$ z@S~FPg{#(um%slTiS0Lw3bTKPD?TDxDUhB93WDjehyK8;qR83#^|tfzgvZ&G%9R-% zd%t+et7;}f#jNhIF7QyL#uR@H8~;Bu%h~^z;idFa!8QQw>Q3c7EGYbiIg9P-F z&H!cSIrN3n!K0=6j8|;L=aqRV>R8V&oktz@C>?ir@EF*zRU?}k zt9Du{-sEd#dmlvIVd0X$v&R(By&1uHS2(_<+nm%Ge{@>V*Y&gxj!T1yPZ9{YC=jY! zxA@XPGECNqb+~e4=kK+*zBcY9nf}IWr-fS|YixanwSAQTo6P}$6Tb}Giak~o{2P)d z91mtJb!?`K2TEAm%o_GZ@_dXmk7WK5Bt9_yXzF&=KjN*@iaF$+715%g{Wz;2v zb!CHaX=s?-Q2jkNI5Ivk|8!Cc3_6{q^fv!Em%jJ<@XdX?pU2m~!#S8(|fF|^qFnB_?K8eNv4($4yt8N>WjMjODW(!xc+Tt)lX-W z`QBdP;nKU<;E4I7mG#@RPsf>BZERCELCQ6C%$u1yq*tWiE)Sl(`b<~7?8N6@nUL-%3=If?P zVqE&6q&7@y8G~YY3nH=DzM1aHS$>S$54sOAaB--{9vp2Er^Pbh!lM3Q53VeJran#M zBC0V>MQ*nZZk&Mf4_t#bL{P`s&dOg=3Q5h&ja&7asgSucHN&@zdk@+iB%-BfE!*Ep zfG%H`?Z3il8*jgSI)nH%-|x?qz+M`~J9~wc3e2K`ruE zz=&gOiE*5Po>6Yk(;w%BhWTKdhDltW^(*@|L?m;r@FEu&e*PoysV_qb3*@HMx7;C^ zt10h350C-5Df!J|+4JSx2tNDK5uiJeX=2UWzv8w;aRW=kn9e4F%qF8pm~~aiHg##mhi**ZGF0K z@yGU6tMYZ%Wh(-iW_H%;Ln@xGId^#TxbEyBP$YK@<8(arr*B0N7u|25tfb$AR@r@k z*Cp<>WFU>tD9vojGYBqI$>7YJonbJ{ajvmqDvJ8 z9-Pg>q|dg+U3vq$owVeuTItQ-mr~0zvvK;&{ivDvkw(S@lJjkR!N0x^NOb_C1b<5G z!|uzw7m^N3u7#fcuRwnE(T}X?4(~0S#!^7Ny zT16glmt{F`|59%_k>DMac>dWKzJ$V0#9j(f;X!BD~c55RwXC&8h)tF&g7ja z*-h~s=0(~dOrdBTlJ>B17|DzE>y*p*#e#f{SeoO9O?Bq_^Ep5!^5C_PkySaO=k^6{Y(9?Y@C&Dj$NhT?kc5dvi)M&;^-i`C0=<)~8P8ziqSD^U=jv7O z785;{Cg*t>sS0@Jo@pZoD}YvbmK5nG6|&^6sH@a@@*2o5T)!RlOA8QH15wvef=O^xTySZLp~LQ=889&^}3)`;uwU#u9De7oECte7$>(f|m` z5*IR$i?E&2$+1m|N!5u*2fI8Zn-wcy9r;RT!p+Hg$ISq1iPRnp z*0q*IF6S~F5!|C!gM<2}L&XvN$RfZU3@jAi#+8u_>UFZ^T`pjmKONH4F6<(~U^Tk+H-pwi)tvl$Mu>)p z!t14Iz|lvGBgwHW{e3iUjmLYJd*R|WSN{gM;Bmp1Z0_qP&AT+FSg|Ef+QvUxE&V@t z+4ka3no49z8!@f*&$eH)+3kVUaO(Xo+7tZ=Grvt%pR(|`QBe7yC^sI8Wk1_lwX`9a zSlm+Ytm>U8>D*~M0!buL*NYT~a@81r!dZC}&oNXG{Jy;;5c}dt=eA%i{;>@W;`-L% zfxBHXkLgkNXH&d9Ae%G}Og2yCIQue(#|I%iDHB&rW8aF53&Vk*B2J;3Z<5ul)-=oX z{*axw=t#5{OH)f=%@==d(VpS0@!K&{^cx)YCT6riQfdQr&o4fY?01c=PX(*?H^w*W z(l>d2D7T@n3v;bMo7b&TA(qfJe24L_i|*ERomC4PY>a28`bh~o!qC5gwjJDu*;N>` zqq9fFh}^G61UWGLNoUp9CS__ZJ(Ha$(L4dlh^Y=>*0=cFba`Z^dblL)LTyqtwoLP7 zh%?(_u^T54-LPzNgP>p3lw90EX0TeP4YF8N^ODVfhJ|t@1~0OE`Rmp>$vf43;)}>H zW|VCv@=BmL-K~B!sGA0M803n&K1u0qb=)lC))HH=T*|RB0d?tnk6E>XTpg#W$T1nlN!A zGjeVj!A2QBZOmf0axvk56?BOiI8I^`h(V>0*&2qc4+{J95Lf`8~`*c4(O& z=jYd$Si<%s?aH(pjLDgIL^55vEPQhLfyb}ZE-N4$dRLQLc(=RzuUoHAs|5;Q3B|O^LcjU> zy}V$}%hfz=obzc*%JTeX+adX3m=27*;yD#^^Tu1c*8~4kzqi6;p$3hZWM}ijOT^B2 zT-IDI40`z28k08=#C&(w!3uZUB^7qwNdIOJ97JOTIZ6AeG1iI@*E3LM!z?`SpMea+ zWvcjf$h9JQ0%dlVHYdK>f{z5pA4{ukCcCh2D}L?%`r0S2{RWwu&6Zz)s)&VUr1Ha8 z@QXS5+m^OR&111etb>M+L8?GDYbpbc$=jR=midu7QC_pP7d;kmEf+bXsN}lh>yhgm zE__ zddPt7u1}#;gJz0k#D2P_1xj7+JUnyM_{+)`0RC**ZM~=IkuiW$NPoQ`f@p2 z>vG%V*m{nV{dnMR3MV+YbROnT$>f>!&cj%&UoQ@fzr1qMv1$3XSUSU)s z-gu@RUW9+7#1g)vQnX7%X-ohR&M7#}nuKyvZXpb)Cbz_&s(RkHKmrOP{-(O87f)(R zjK))RLSkWMRvrdFS2Ro_`il%$U6^li;wXld&u^?PSgj1t} z@3q8RDkI)jM+&3C91BtoOH3WJY(Z&B^zda1Miq4q zNTF~-Z$p?FOAAiB zp)wItyYYrg-F#iv!CJ|3Y?3ZDU1A#C;*6`op9r06i%)lMeoaIs8${RrYOy<#Vl!67 zorjz2g|f()b8Lm#&dq;wE4VRp1?~Uq4JyRRru=XSW6*ZmY+-h_@rEm$Rn17-uxd)1 z2i;=Gtf7W@14T$@0*fd0jsGmMP!MtccoAW?6}lv4eVRb0}Y5>I-S2b)4=KH$^fIe|7kibhF4?;pv(mkkw?*1?jAR=Ve zEfbu3~w8xaN_}^emil z0aMKn>`him;rX%5dmoB!VLS6zOF@m%g(ZE#suz?We|uoHbm$khNm z1%NG#BtM4tq(f5Q_uWGiD=w`Fe!OVF`o3YppJ3D9$ZU}}drK;4peTKW{aG)7sHyf} z^6a}j^YW=6I@mK2xS3zzCih*5KwLIaNa?hFn!l+(2-@QjO=#B~%`ClCIJG1Zv><7j)0Nir8}+L#NeO6#zjd3ul9so;7}xD`UkPx%U8P=!;dFsH*jppwVvyWNk%Z%j$3 z^a8NXO}%_4sP^t@>GGX(g{Y+J3MRf)BJ%0{W0ITAX3}KmA6=djQ%7hyi!)K%)M>+( zO6-K}u@jY`&}o~l2iOywTfV{XiKFeqdy4sbxcxeYui@nV6=nPq1WMo?7CdJdH=>LctEt6KX zfR&2zxVOR*?8Gmv+qRO;g{j-b^A8JOVnqgcCKKnt(LsazB5n#O0!&M=&4xuA8@-sN`XskfNjxZA31`* z=;O~so?q0$anXdtwUr5l<&+6wOCWq%>l$@$>Fyjz* z<)(`B>}iU5*wsVLO-zu5=@e?GKEWRW=pyT4*=MFg-4HLE1+567j?*ie+!(V-oWrx-+<2`NAzPvzlxBJpeqpy?@N^Kv5YA+&v0n1sl%eBkN;np0E8$Jc3sGb8s zOThtch1U@e(Dq(PP4pf-Yacl6kJ)9t+2)BRh3O_<>mQB<;1Q(oOzT!?zrIDM=?4+y z)E^AxOz_&C7oMphy>m=a(ej1<;fye{BUR!J^t-kj?o^<}-@q6?1t@Lzl*}CFOuTiF z_GzNuY(l$8E5bwcy7hnEk&lPVNoCbJu6Q|1!?M+vH^!gGXTDqu;YaYPFLfR^zk72KA~yod~YP;#ni;P*uPGeTH>@@lqMGq;znTnHKmJQPH97Egb!ODpbk8V z0ZWQ&8V)AH++PC#C>F-2Zwre`MDy|;nrLkQC!L$*jGP#A`|R5SMdV{?YZ6?sVbfHE zB!Kv|SXr1SB<5>Dod}e#m|pEiJ=GCNU$}T4_d&9F=~?LCcK-KkO#SAigdJOe6)l2q z2}wCiu!x-!?V+;8VEKC`!YzqFrP9yRewjsO{g?_>1W;L=7809hagNrMPp}Df`^{}P z3x(fyG4osY$E%&98Frae^80r7{pP<>cdfMEZ%(3I`oASB<<67r__XWtgUTJwXlv!h zGlzu>A2g_I{%+@ErZ705%d*GzL*{jh>hk?#7>v{Q0jnC@f2Py+4qsA!=>UxF;@?@3 zDhNWI;kD5KcNMA$M!7kpK*#hxh(?ZHnDy5sMTa% zXKd$l4(^_avQg;&4RI^G0}OuvyLM#JFrpAUfF{8#HG9&}2(BGD^hrN0TF}u%>WfZ?w&@n}Y<>{3wx+Zk>La0oa3OYPUof$-#O$C$D@c)wyoCccKvQI1N0|3=O7AtLpbdN8A4oQT zC=F6h(S7D^zim)!CKl?Fhr_M<(Qo4?()HN$?ELK{*SV7nIjfcg&Ff6Vo%>VX+~p75 zsq{9fm%Jz4JaOl4j?t8|r0@}*YXGkT*4#Yr_Z~i8`0&48bIC5_$6dic{A`Gf9Qb?L zqjoX)!CfbR_#q831^e!Ny|eZUYhr`<1?5EDXNECfFEUqn2R`|!lXYnbLyYxX|IFSo z6rCg&(5#g3d(BR-)Bn^|=L!Z+@;?j-*VIDS zPH0S=9k2rOWwV2IFD|-~lcjR`Ft0(9!{mMrW zi4yZ8$9u}#RvJzPyft2kOl$R;KGX7N_+RJ-a*0U9Jz!?jAloi9iP^0PE#PZ(l6eW` zE34d@H=*|$;v3M;#59x@1|Q@+BHm}oOT6W(PKi|J?pHO?hH4UDep<6i%=Ie=If(?) zKC=d^7`AvBjX{O}KvtL57i$R*ptOo4nZBe8k)MirEMG6I$Xe5|OuFkK`r7L=SGXe+ zeT~CWl%$uOZ|uSx1v=*yOKjSt34_JytyVs^?kwnlHWksq;j#|ByCIdYHZm3DN`V z9fh_i{ieRrNl{w)Hh{Gf`&lH+-mm%)a&=K!`9&WZp>GfB+Y$QqKYTmXAk-Ys)sy@u zpa!LXr1-A@%0ywi)4r9j4@p$8mgk9M?Za9g9;!L;E!SM;Z)$GMA3)agOK_NQ%`q=X zDgB}cb39;{EnsiA(Wi3mSs?&2a~eO*HOmhTH?4$)+XcYLYxPt*P8*b?Lk&tYR(6i* zw?}j!RXN65(Hu;6>_k%VxDnXnx9yBpOiS7FSQS z%^ZghcdVfj&WDXXt~ahjOWC@7ljeJBPyW(f+6`wO zXX~dHQd%?q8Voygj$P;2{#lVrm+zOIE^?)}GP{{}j{SZ1d6)ggsEaNb+rQZL|Kz?D za=LWcD&(7{`Pib0%5%JaBWK&Pv!Zw9Bo`psXX8=iKxu~&{=F#t#OR95iydN~We7qQ zYtFHQ?AK}YNCaeNU}v5Aiyd#yR`rYLTpeI8XhVBg<2yCI)M9UrvtD5Bnkp(uk^Y%P zNrh{gcYc6XN6t6%bN#Ud>gtyrOm9&ID;g?l?EW{2Udg5Jdp)3|s4kd$_qJoX$rO)^ z!?r>ZAoL*>FV}Se_s*S2K`puWx>5Q?Z=QDUu zL|HNH!nd;tr263$h(oq-XGa2t9DU@^eDBc^Tr6smSv$movQ~m9iTy zVSO67ADmLTm2TW3h(@=}iW?gnH>7>hm#v~N+ptH=E^TbSF{q5tPtFu`l@ZvCB>9$e z)1#o1ZI}Cq&0Ej97$nI-8@v)kP)p_J9|&K9Lu}t+P8-_*+5Ji=l&O(8IU@))S(`b+ zl^=AqAZOXtu?3}vMTsYwcXZubPMZuPv3(<>uR0IU^N&Y5jy{j0PQCwOo)={v124eQ z%9=ftp`Yq{=XSXTurrhAt}-`(FP?hXZ_Wg7TtoCifPXq*+KW3)eazZlmOzi zEAp?W{^*e_T8^?{Nk7Je4$(tn=Pcv3orfu7loqoJxX@i7h1K)Sjcmp|K6#X^TZJW?1ef*v;9e3hP%>KU<~Z`?iX_1XZP=yuI4=YqAa> zA?q711M)mpF0Uc3$1-f;b|SxHPV>X@61j2^|J_h-=DJ2%Gp~>SV!E6>-@ZL>vF9uh z{=CasK=@sdVt%F=oi(6@xDQO{`|-y`*DiYoFu7*HepB?4VhV5;lytu4z@QK6v?F!0 z07KEYZxCxEL1V)t){>c=sOfyFh^d_L(WwwJ>`n#pDHA2eaK9!ao@BOfmI=`MDqVG> zTJJZ{3ODKH=2!HJ(C0qmTY$u)tT(I%5$B8rTWabQZ#dWS7Azd2k~bxU>NAGfF{e)T zN(40ET)W*XPS$Lit0TDGIH@@pRx1_zcDT1Zs^iXR4VaX z^D}u-v4??QpLuW(3wAW?qaPQFS19DeJ;?FLw(YgY9?=_21&mFqEi)>oXde4q%#*P< zYghF!PbU*YFb^wl3WlqWPGjckDBgdTHCPXDvh#BQV16}Upjn@3%KEREGvE>GI0&(* z`2W|fdW^iOp8L%r$O=7s-TLN#$>I(9^rG$()`~LKi!!lrSH(6y z&Bk9)0?xp$)HMjn2i?=Z8Uz8ikA!zjhXuCMlY_V$g7&Hbr1A=$>wT6>CnM*xk7rie zF(SktdHG(_~GrDw9up48ZVDt zZ_sanWtV9AewD{kne3>x6=Ta(yf-Gu>mOh5aK9Dx#C~g^#HUrW()KGMYT@B68eu%P zLZy>#eJwjAP#h)49|B|~KajPwu#>MTGmQXOXmK*82R^N;9;(OE(;EthXpT(O3=02^ zBlR9-{EeK^H-18eRz0lOlkDq0^CH?U#cUl{d=hg}F*Rn6r&y|-Z|d?D1OR=0{y6V9 zRD|E1lqpJW#Ufx{X2nVLp>j2ns6N*%k2%YUJ;_JBcDS5PF!9F0Mwqg@?~n!rtFHo z&NyU_wFccBeDPUaT1(OQBWHz^H!ZW(rj(o81>@Ff^>SHag0pNg@sjirH0R1~ERvPm zvrB_wb3L?%`jz($wYe)8Di;-85l)oY8wJF7 zv6Bb5cB;KA9AD?OeV2;ia8!=FYfE}^1t(B zo}SFnnkjA~YzRCUC=^Iz8lG4VIegoDE zJ?&*IW)nvoATFB%x~VhAaGX0PEOp~qSx-Zl*)~{I>}{}Uh(E^6a4duyAr6&DAz|Lv z3L1Qt>l4ba4}MyFUeQ29O>=r1z-nDE$@AHI&l7Mr-oQnEEj>?uBctmhRZJD`gvT!Ccy5JtI`+S*qBv0G@Q=q?)OR02P%}eK9TpB4+ zT*Wf7MjvhOL!yBSU;JBHUFBXjIj_uRFosa=e2@$LXw zM!H`e9`tpif(O4qQk3WTUb8V=_xAi(+`NKrzMc4cDPT!3h+;Z!0L|ou9jG&lzZv@w zcU`H@aE9u}RtQdcZ9Uei5d!Vaex$@t(%kja&nk9Q%YY#P=p=Y&G_b zEi+Q%me^N##-{T%Qb+GWFbyV~2bWyz?Zd>h>acIWqB48g#q`ho$Ia;o#veVkWeitQ zR)-UWIh5dAhajXBr6rq`%iCT^wlTU@6NvS|i+gd7-@Wuc2DkWBCbQ_YLr zD<{axvrdyM;#ppWv?fzTUn>z4uw<3YY{C)GD`?_;ejKy-%l|YUV zJQ2L+M3Y#KHF)kYYAdLtVFeTQm=QcJD}6c^%KZM}6qMUdu4$>+qD9scH`YCS?Pr?e z+gvyywx_$_)GGVl!q^fS&LVH}y;bu>xNhzI*FuRYWaqo2I*_a%JlTZrXiAP*+n6{G z3BhSkF@`xEp}Hxx*H#9W>&)OwOHXP@o(m(|YhGs%0k1N~k8IsF?g<1oBZ62sHQQ?z zLD&K@F8q}nFoAn);L7|&^K;D2Z(Y;)R=>R6ufv~~RyeOk6?U&yXaAO&uQq72SYICr z^?rN3ItemQTE>6@sBU&}+Jd0#_$$Xm`!j!aRs{}Y>f|8XZ7-5p>$G3X+ZBPsZ0-wF zhxH9$x$@LU>5*vBUeh+|qcliogQ7nJ0OJt#Wn7LO*aBU<{&U29bNLLb48=|%5*C?L z|E>mSmc#7*cHj~ua^y|zt~39|PRlQ~YsXz$TFha>$SfU^48s*%{=;uYza(kOMw<`? zqb=zjo|@x~>%Q@<=o!f=gANXHB{3_BS^|@oC+V1goBVH@9KQNb zYMNWV4DdGawVl3A3r>sgvtsl!uO+7v`PaSwq}U_Az5BRcu_;-yjOfhbsmYQN>*8yf z^WGQhHbr*F_u0Ol*_I3s#<^uVTVXR5ew?dd#nJqvwH~PY#P>3EZMFe12~3di2=@xu z`4e!UcXPznY_^RjiZztCAbrZ`twVb9c!v{*2;{9VBK2m`?e_8vcl`;W8BN^0H&Rgh z)JbD-D6$Pru?=PZSM*cm3JQ%ls0^tE-1eFhrzt3e%hgX&&=8k`V3=qmA4r+``hK2tADeZ$x&;KoK?G@ z*~dv z(ZtqPCa&G4OW<^92w{w-1;lKaldGpCuk%X~-eG=zyzADeBOCx?uPk9;y`j=#YP0RS z*ee_^6w4Vg0o@Dv6M<4$Cuq~%Z8ojQI_=tj{-ki%mT1>*)UI`YsGuCDeJ+1lua&xr z55cHzw{y!3zNY`gAAAn|v|fbkA!ojsTX|2S(jW0AWk6|2ClbvG3n3u|`jF%fS8l9l zw5j3zF?alh#ym2Fprh|)JV#gYWWoCKE*k8qAB|vFU#aiRrPRX3l~29frxNqa!^;oo zedL5(Chcdo!P;Cbma_Mf=w2&X!IhehA?jAD60<>1t&Au!&)yzY&j`|g=D8?BPM=Fo z9vnZVma45pju>!;DDdJb3jTEW8vv9{2jt!TLE?Q{5Rt^wCFzZ$YWo@w?y(QQ}Ob_MO{Sd?0YqUsR%S@Pkz_pMLV zP$EPt9xWnPF6pOILP0g@Ic@T8I6mH+jINd?h8}T-embrgZWKqqtTOJdJF=w0Y(fys z+&^@^a{f6s1P!@=#s{>3KWJ}3f9^_l{Gh_~sFpHSfyG!FpNU}9_qHI_aZh#f$@ep5q%sDjiq zt1KjJ8ETnZ?vrOqumaVM2?Q)f3_PnrmMjY=FI`)jIlO}x;aH{; zNjGwKF!5QXMA}JkI`Kmq2XBpB$*?)0kNH^@w=7E#eLB2+QAMf1;Iw^_5y|6F3sXrw z_u#X+b+G1V-qw+f`4gOqi?OlhggBVIOzIQ!N=R<$6fw>nSBNV8c(| zve=Qn%LK+>(1mi6m zf6r-C{07bis@lt;2TB7n5;qBSMW=-)TAF-*V`7BZk?wSbACX0y^wKBt(0U<$!e&Zv z+Fzvk0{TG!-}3e9vS75pjl2Qnjml+Nx7CR~WhazD!MUu`-mywvItk(b(DP&z>7D$} zj451aqDQ82`N+rPS)Cw^8)Z65cs}B=WC_ySDxH`O@s}-wvjI7KW24}+oKK|YP&v(H zuamIBRW5x%oPkbtISK3CP|k(y!1S0%77wjjvfaGL(LuUgbT8W=_j8Bi|4hGN(W0JV zOQ4AN$`TOkRWjZ-^;hKD0ZABEqPqy+A`1no%Jhoznq8K)+w%>pU*kEJ6kNzpvFM8- zq>R>$@ZB&DjzW~iVse|tx=TA^b-qAs>mULIKe=Y9d-1NIZx|v;Nzk{!w#`?L5=K0818@aUG zH-L`;JD%&w7Wlnm?y(heT2_v-GM&iy&ClNv^6-uSrA_P>fIhY&;OmZc`!e@2hq|6X z{4FPW2Hn^!uc73GD%%+Pp6?0sRq6+Py)~N|D94e>X5W(YELhOuyOir>nc&FOV(Uuc zd!OdMsKF)21rxXI=;aMuku7d{tsF5F1&nkdn55=w(rkC=1dfo`TxNvYD1)8Ak} zr4DC_&F9eQ?D~89!aG)FaPH@$PgRXWhaBGAwncueU$!yj^+x18aLOO?<7k{iXO; zrQ^N6EIDmZ6eXCr>KH`VT~6C?m|`O|*S4R$(ia_`nc6`Nx0TZ0wOhP}lA9ynOa{*? zif63r()?Fk8_*~Z&hQ>P4YSTxm?@Dvx+B?Or7d?$TRAS6yy{bskL`h{cM)u2Znvew zlA!}ma96+y{WET=wi0u8{T4`9sZ4qHUU`=EM9nifw)p8CXo8js`rb->yOb$}){=WW z{$kbI*nZ#j|5QD%R-V3i_l?xNl+)kO{b&78p@oTWN<1`I?PjrBpHVVsHU-4L7MiahBr!(Eg=EeyWk^8qv$PLE9&ftTr4=x&%K+TQC}h}ulo&4?G~C&|z(J;(ml)bH&3dY{ zBn-ropfRS7I*^$$?Oh8-P!4wuJArq-3G9F(=jZF@*RWWF-0ZqQntRl1ye}S_Ykryi zdX+iS{fei$8Ik>ZgVDVdlwA?J(ahs%Y+#V{c<1J)5hI&g4b!UGtP8+(LX5F^{3Gg987j|N1_U0P{#)=EJf67{9-<&AP^)m7l!d>*MIZ4!L64^KC(u2hiN+tr$5qZ!90tZ=V5l9{{~3qfM@oSO9I?xTC+KO-+P9{RQ1$>aTnNi zo9cE%Gfa$I=gVo2Tj$O4A7~0}53%?@LI~ZP;YZQCZZhA(L){8**4PQKY`xCSpBy?I zf&IqcTdy33!v*q-Tb5iEh@t-r-UC)!Og0TGfOpn3-9e*F^?SA%mqz!Y}P~b z`DC1d6_YV6N6Bx`BYwLu{(#4aAtO_Cja!rfgw5gEv4Ub(1KE$F*kd?AxF}YcL$OQE zr``~w#X^B}C|=q3AP72FpZNeS z+0OHIVUwPkMt3aok_4sfBi)O^Zx6kAJSLh_?Gt$p8y^=;&QnyKkXM)s-cqerC4Nc! z`I_n@`fryw?)vZQAU=eko4<8u_Bqfr^g9Cz#CqvjAJ z^~q7P0OaVcP3vRH&g>y4$1`iXoK?OF6CRsD8@*HSqBU0r+ih77dD<=|^J%fx- z##M=!%rjv91;X*|_!`xl)1~Y4v|d?*%R33HEHZP>v}T|-tVKwsxpyUcH`RUD{yCvX z{@n<@8|S@~gId8m9At{jQTAPAoQ)joJnas#i|uBSC$~I&0P;KGcoM$s3*#79=2;#= zK=jZ~mo{%V7f{;8FDv0`ss6M~2=xEv(6i+0suBObYH)2k1U6J=J}Eg5?k_W9OYDFz za-s@NcbjdB&qf?YABfN0-CIAvF(f0JUNQ5E@Mp(*r}!p%EC@AQk_P-nw}SMU`PU#4 z-)f%1_uQSpQQmZuk_GLQ#&}N_@+8099oC&YoV>b>+*zco$9hK08D|c2{F&1%U8D86 zG}~0SE%I5C%|<4p8~CsiG*)d0`!+OIVXUx8BThwLMml(kv1O$o)vxK|G9Tx56oZ1t z&>j6=4U!DzWHeX*KydW@{sjdta>T02#;ul-B#A#o;>dP@+2T)pxisFwEkZyFW*u+A zD%--7%IFu#-BS-tEVzmJO&rNv^2?}vt$aPvreejz{retCSq zvnqVbYGI!}m#G?1dv{psTGc}x^9J~>WwK{8bhx{*D&16kJ`@0#or?vKv!aqFO zPCgL`c%0T=AzRZ`vNhp5%NS%`T1I6&IJryU4b?j;+j8`7gxs~>`+&}{F7#^^Obg4y zlAak(oX?pF5JWf{g{T`D<(hdVPq7}Gqr3CxDeju)?QtaE3daXz_M7D10UVu3+wWNE z2r&@VvJ~Y2_cxA-XaC0bhb_(zCG2gmgb-^V_RV7E;Ggx*I`R?IEBM2Zce?mlAP-37s+$M^CU9vCOzzHM`lTt26|70KJ=w;2S8%Sne4#2#PzuivR ze26Vk&hMzF2=9Hb=~r=HCPAaO@QIBgH`3iDDZx&cwcC0{z1Y}k)WJ<>nG1OLL;cHVcL0l3YlJHGCO0R_f z4H{A~o*hX$d&lKZ9&%cJ8uZjfpYgOb+xTWvDF!>V4~VL}-&3E3E>R96#+O?OBKQj0 zt_Ojqudw+`m2pjJN=euM!Hh$|4-S+Gl*FYLgj=&9 zT-%gb%wT~3plKk72-XCAp4#_B3BX;N1K_a8)W+opWY~4up3qW)TM+GG$aa{mxMi(0 z0G}<|qsz_MkHf6>i9DU~-{{hV;6Of!U`3gWV~LJRf%=ngyP*EXL7=_>P|xWA&UA^m z!L*x|b-4h}UE-`m;oOl5=HUC**WK4Z8?REA?kb6DdgEs%scIPnNKsauM^V6=()9f#sLUFwL9E_SfPBKVoo?XLS^bNu5|KIq&y#^=A zg7LipWEmgX8vmcicdI)-Z=x@HIQ=Uc!Ub*7r?}68gnpU7c;k=4l@alNZ6E$DKZzu3 zcF_65A$NiDUZP zmT0*6CNl)x9>ZYmtrSuKloj(MgHHeWC9S9Evuy<=7s?4 z38Qu$C(!K+H7j__n`Sg4m+*fjPts6Ciw^nym$Mg4vrHA9c8y;GZE2>}&Q}|7PE#_v zJB%O&rQcN^SnXKchC08k4!*P3cF@)?Rg(juGAvT^=^o1mLJpj`_)w1((aBg8Qo^8D4&)Gi{Q*Vr)?=+(XW0xD}Tce+TZ3L2W3XN_$!+~#3dB}AU04E z`GjpvoxkkOu7p}T9_Z~xZyIc>fa)i4CCRwTXm?Vb2ZM0boeh|c|GsYS(*}tA@wis5r;9~ zI{|f@79=mD87aYcb5)NgcQqzHubSnuEhtI0fYaoIocG`+w4>SAZ@zz$bm4z5-4f=e z$4UwH<)jm`-I!?^I@`$hniAaXQwW{ zH*X8aZtxS{d@ao;Lde9?Z6Cpxc*vwTN;4HAF=>T8%9PDjCIX}$R|>z}8+y}{UF{4~ zGoVDs0L`mNG{asH4_ppIk}$f%j0v5KWNmV!E0_6EPJYpa6=n8LuyEqX^}x)GLXwl{^ho9aNK5VVpTgzc~SLVMvuL6#)Vc+}+SX%zKN$_HF_JYZ6f|toU^X2^a zbW@r1g6BQGBZ&A(uN)6WE|q3&&$!NZA4aBfOt>FP%(YJbVzUqN!McQavk~aP&#bfG zp?u)-^ecpwP=cbIP$hP~jP!%;_<{VB{Y)cYUi>_}{vW+xupFff5_mpA$+JHoH4YvJ z$w~WT11DU6A>3}>&wvfis@z7Nm^T2mcTm5bwj+UZ_C|9)Or!19MnL=^|<=bT;xlBLXc${>&5Zy3xN{CCv~<&wq2G+OoUJ z_i8wP39QyCj$Ck!-kAAymM>3%!mQ;MKmy3S)5mhDnmvN3dNiE8cAKh%yAPD0;%-W` z3^1K|%hn}F;yF@o?^9DgJM4|NN3Z#8$4$kpByg| zUSo@<|HU77JcL{Q&k^W8-ET6KJ>(%H1N)PvXS;hKOH5wuZJ%6Oo#2jiiduR8*|@yWO|Tp6z4vtf+W_7?yg zyRwC~`_(6kig*T(Q21F>qE+dYgB7Q=bvY~Eg3qzkvDZr?-)>A0J4qjjFg6344kvD4 zcav#Ypxw`nfm})cNb*`@9Ur4sxb?Zj*dKu))FJ6^-R}7~T|VNpl^o5xssliryHfTf zn*R1d-J_ACa#w3@f>_zsmn|FxlWZWr=PHPw<_BL2#s{?U2x%Th*^B_(^Y|K>Mo()@ zUiArXoYR!;RSsGBfVMM#Uf{nc>#-7CC8O2dJC3l~9}qs4zcvWAvVtvS0*;4fYR&mo z&#AHv6btEHHD}Hkjl;>%Y#lk9lfS9q%GeA1d2kT8@v`XNHKN{GwTpb+C0uSqV-o+q z0*c^Q@0a4p1!Srf=1^DylwK;wGMP&; zgL!z$J$o;yR5^dh66cJ=9Zk-o{uzGf2TjB;@#tyi)-DjG?Iz(VQ)q1M<+QooPQf?1 zmL{8Xo$$T7H&m+*?HXMHlM`L1-m#nlb6Gc)vkqH6BX~+L1feID1rsx8b1b=JG^(X6 zFIzc9ve4)=f4+>a_e?$o1il(eDECPvt}A!i-aup4(x{pA3;f9O2a84hM+BB{*NS(W zV`cq^I~?xWr`)b>3N+i-%iyF|?IcL-NUhM&`<;`0up7F%Rg!sOH(o;=p2P>1IwB!PN~<=+NOAGd3wqF zS$qMm0Mi8`_bLNlk#AV8)24V!NepiyAfv@NZ9id*+5H(#_^l(#3?(TRAQP4G9o;)d zup^mBkF~8cpfGDq$-MfxR-tH?p!1?cH+%Y;VkxP$eNLmMP0CGod zL0Q%sDqc$`TX$fkAP)LAkT-I3`VyYz`JJ}tlb<`3aAa(9pn zU9Vw6Vv0ml5|IJ$U@|5BT&;&0SU$N5oBy50;j= zNGC<2?OH~pp=H<4czq`!zNmxD`| zq%;*T5^o_dp3E8f{SoG#H7!AX1chrNa_&L7znxEtk?CTMr7v_@PIrX7EVkp*Hu+bzW#9C4gTm^maxSLy2B5;?Hn55 zdV-?pvz$g8)|eRcI6@0FmO2!UJVT@r2pNo*kpCBBi#ciz1U0VME}XMD4weNbh}gqi zbc_UnMeq+R%Snr*{+W`bIZ4>w9LKj4cya#xSmqc6rC#Zu2w?v#msd)l?&T#lfn`fd zg=>=!i@ajNs#6&iV@|`1%xCDju)@-(8WHHB^eqZ|K^mcB3Cz{$<5(su2ZMKlsu-Bd z$`JawQpY9U-2)}CQkFA%wD2vMI4_HE)ES`#4|JZxoH$0~s@&sHi@25*K(5 zh^R#H7vx$n@)kaV6FH0K?ia3!1Xn(c?}$ER{dn0TuqIb{N?*wC%AK>oPh2{@oTJL@ zJ}#icjjfjQHW4A_9^^cY5S_jX6x8?%;FI0&KVuxM!9jG1{g(*#SelesMLZMMrm^AV z_e2D99Oqj|dV;q0b0GQC9M37~u%g->sCC)-S^DGg5Bk&g`#3t;{gLswG^PvnjYN8fb0F~M|1p_;c?+`Ju*taLJhS0v@IpFL^J8vX~o?)c6`TL`uIpm z9E$(yzKqEk_T*N!xzF&fn#qhiZSKJO4w|->(n^6|gso zrI&w9`+xjD#{c{OH2#-Cs=#Xg6s1od+WrBJHLsq5UmnMhi5DFYgyk3-0)O!Gr6cg) z0{GtWe~d5spT;-ej?X5+TkbN)HmzwPAO2fG``NWC+Y@#@=#7b=n+VBeD}-lxSq#!Ee~l)2(Xj73y{>N^NLJI z>dk3i%K>W|`98a!vv`$8iTEfz$hZGD-hV9K&e5u^hQbx4Whb@#($yszTPbnQdC7jkl6 z_pW1u@qK}+e))q0lGj`J-zFbN)91rPICV8&;UujwaRH(^zjV2fm1A_rAt9{Xt;I2= zy;$pfgu@#o9Nr}WC8x@>TvW_y=oW=F0bC>)jwQF6U5@N-MLW#Wuh_Pw0o+VZN&mo( znaKO}xdK4;y?6M%nY*j1Z$A~8jXWjk_onAPZVg|@1=ag&!gMdw(-1+=jl6a8$}=2 z?|3NWNBaG&)e)94aN-HFTqHdaBH8h2cYIt8rE#Z6Tk;z$Dmv)-!mPZR$C~s+MqF6G zN%ie4sQ+=}Q+oN2jBi?gd>>bD9Swh^o`iP~o*!2)aj5=c`Th##6FLYUn$OW$cu1dW z#@2{F<+P85Z*zD~gxu|2>3evZ-!BF5T}&^9@DY5^w><-&kIZF?t53V)vAY<@@aQ9W zGU(DDp4W5@!61*OwBJh?Yy&gw-&T{qT}OoJpJw~bwjW_I7xSF=>5|~gIiR$1EHzne3B!#quPJ3P;SYIvX~D}U-It>%z&)QfG7c%2%3~|u zb}nCQo*ZE->zAJw07?d(x1FzGKEG6<#m%mD=LZLOa(O`~-#+-|R|;M>@$z8Fe8E?> zE;-4(Kq$9Dx@LXLWx&9?2t+vVA@l12mZHg$&ri*z=}FR4$jhM2jj(p=)Yi0nX? zu%>lUU!oK<u zX=|m?gw3DYX-@@{nnU8CXPd88@)$t3RXY`qKX)<-A+k^Q`zI{0= zxz0r77)oF=l1I@XURXN2SS$Z^nYb~Koo20bTzVRo!;UmqOtk#64%zwrzFMQnq;vd& z+sn({+siK?502z54zVU%`IKYydYcXvozRVUkoWl249I3`b22s1e+@zbdFJ9L`biqmU$%E8D z?7_f?*M~Tj1=uf`W8seB_+^yCaGW~@r=PNQ50nFe%yW78$lpJEPHsz>M-~+DTTC|= z{Ks-9dlqmAqQI_Au;k3o2B7BruNYz}nP#;Lrt2iZXyOZ7%NbR7=W0;FVjmdxISamt zDPEcQFnIt73iv|;LDCuMf|w`Mck)8*nUTI+3C<(pPq~*ky31zKhoB*+U76e6bIHti za`V#}h9$qT(jKeb#|pi>o^%4&6fY&C;0(ww3R1wjGBFe zHQZ;~z1E^jQv?~nJ+_-u7^KD84FogAce!mgSAjP>%;yVR{tC!p0i-^!q8stD>GYI) zcnJ>`!f~^51KR;?C@Yg!j6OS$KI+;IrA?@nBK)~hQ^!Dc<8EM z2HYqPAls`{5BAxkB)Bc71;%~ z7Ha?DE}GuLklgbz`#bMHSa{xd@cryt2zNEJ1`iB!x9PcbZCM)O4a8}*e~Ni0!#-T3 z>@Br@sd)?=#QC7yD`$oQ604x)@%K=E9`4rBCX$OtD=O3$j0>c}yPWMY%%cd(myMi7u>@R<5M}Z|3{-hN_#UkaCoaIB^>Tk_QF+eAko$rTU<_u@*~>Ju`y+GL zQ2*@q%`?b#5Iw>T-)AE&6D)OuA!|+b_svXZ#_~srl)aDr{G%BXa!M8p&EJp7 zqold}EMZaP-rUCW50Jn-P zqVL@6KJ}@k*PCnU)Aa{Bmu7Nhj;DJfZ3 zX)&mcb;9Qv0Tyx6)2-QUQU9x_cu%}pbb`~&;xtzPx|deugYtHrcR?KY{owzL&%l{cf1t z-`3CDeUvMd}{AC<^$Evyh!S)=4e5NYQV;b%J(hup%5r zcyRl-T@sl`uc2hrXDVz@&^53rRJYe@;~FNELgtaWgH}W^Yrq?IRnwLFmDlizbfpuI z_RUM2)bHGfj9{cjP@)ms;}v}Uc-6%VXIU-E-7RXHUzN_Pq6y!1+P*-i6B@ky;7t`| z@?%09a?Pz~_~bm9QWOnvq8W<6XC@y#ICutt=O;efcbpFCJOk_nzMbgnMX4Wq-Cj+% z!Q_?ir4P4nS?^AH$E2R~-e17`%%3DzNTw@G-J9z(NS~P>!r$bJp>x!K!CTmS*UMqJ z-=e7LV1M!hxyM#y;zv-++gbhQNCue>+Ky?TCOVEP9QA8e0*Q-DcuJSpaD(XNLq$hx z+;*26cahCcU^q7Ke}{WTQl~ecC3^le8_t}&pGbe^W#zTyJ39pN_-jLucm>ZG^XWBq zV%V`?OJ!_3eP;4GtSiY!+aFmv4(Z_N8(rdZ63uJKs+k}1DGXWd%PHNWOl|5-w;fvl zfGU~C%?o{1n6Qw#;_g36#f4f(BIaLo2_Qs>aHc=Q=koO$u|f`q@@Mf&mtMN=J_8=f&>h93 zr68}w`-cMh|DG+N<4-}OsmEP%HGRRd{15*=7ARUHcK^=Zk*~@uj97

o_t zMIbNq>A$jz0*wElStM@DF3VVpNltr$qRQ!N*Pa}%B3jDndZ(VdG5G70zajb?AwMGR ztEn-$HmB1jX?Z(%N?&_Cy!fJ?-e&iUD}p_-PxDwKyo_?t!zk02gYlk3Dd=4Z-A0s0_rS;T7lmIuYy3o5QiUCT8sA(wf~u)7qhgwWW4qa9()k8{f8Le9aw$PlPRmV> z{aPS@OHmTeVOV^I&1f5_>rQGONQR+P0wWt6?u zXBNVwa5;_lM=mudk=4u&yE}DbZU^i?mRWK86=iP`ueJO*C&C{j0(DrlRoMpQL6_fc z7QD?mpvQCk8_fXCWbXCoxXY?75?cQ(%deH@qb<%l$KQ$lYiZ=GXdHnDTLI&yfwr#I zm-5BA;FTulLT1_@ZhgtDVv(!>%>DB;jzgR1)i$wQcesaO*TO{YsNHVM&Z?J*1pliY zf6YtoGqZ#x%iQhKSFZ`KSs_}+PpE?yEvZF2h@T_xzh|WhPuDCpmjH_t>m&e}9Y+Yi zkSNCIWSC1J?>5Va)`KmaE4z}iD1bTH~iIXs$kaL#?+{75*6|+z!a$Vm_+u3nRBpNiYGB_*VNOkU8ZK3G| zjfs!Zpv`{}lcA$EyE25h*8~4Nz8>VChlr~2ohP`di*=Dx{$rv^OP?9CokYL62!@w= zGQXc=s@pGASA)!-;iF^UuSt_UtA1OfDETe^EIHCJ>*>wEbAte%m>cs(zW*N4=r zTA`h8Yd!;I5kFymE`9a(qs4Dh{vZWx15jB1Bc~!X9*Qt%06VeF48cE(eRd3XzWMoi zlcU`gv@5j=!D@)6t#)$#xHIisl%452`SBt;OaGVt5`Ule=0bgB60z-J5WvZm0VpiM zYtM^ehgq2kj8~!&^lgZOlhbbs*83p(B=Urc_PE(NT5Gf9Oi0l|!yQU(>{V5sJ|nOB zBk>N8jFVsO8*d%Jt4t@|ACHDE{o%C#xx)P$xEP~MfIDes*aS(4(oal_e5d9S(*PPO zl{UUKii|qD=B3P$T3;n%NG$rNefUXekl8`sVAdPiln{Z-C08&P29`-n_P!PuUNrmB#XX4sml8$-|U2mgcGE=z(gAF1uf0#{V?(*DTnHcBZpg7qjLYo zQm#Tx@l$coDs4=b5CW2=K0~*yr5jC&&tzUah(22Xd`lnE*KMMb4-KS@p(rgF-J8E~ zL0i~&8B-MGv+Lkd!)2BO0e=twY=8@pu=z@##WdxL1^HoRMW_YzQAnS1_zSHAlz>!B zBk={v6fc8z+1WGGf(*X}wdUAC~E+}0C&bC{WA%VdeNAV{=t zmNKxpJ$WcOnQoR~yPhn?!!=%)Yv0HQTaS`*0q=p(p^A_l>Il{?eF;X7?71B4vCZPE zt6#X&vorD-jCp~9NtgH;-Px^Y_F}EA*=+rlu+2Tfz9N5dRFge?oWvgZib`HC-J{BSIGvG=>iD$EHZ|--8dYLtr&$_FNA@@PnZqWRm z5z43zT&$@HCLiCDOUK&2dBG*1j5%9YXX?b)$9o{`MKqnWh5cP(mn&A+!tY$k%aWBG z(Lq%gI>jlOU!N?}7Z9I9{uKt^TQw+vZsRwwXJ(CIy02>a&Y7$xdcY8^u99c$`@hNn z-o7iCoQpf?|Db?M_WXw=1nwy4GP@aP>M2i!|6PU+C9y0>y1lkPt1$T){ATnH2_L8O zcnp5YENN`uc&E+Jdx<1R!2-zGC;RS-;FxmMXMe%c4vwUMFy3#Y)w@&GXSjO%KP1!R z8Ah_e^`?{i0vRM1>JVR{hsN-PtRMDL@V@8_GgH$*pVX{!G2E=b)Bbr46P2=>H@YUI zmQSga_4f1Lim?5>zoJF&m#-J7B>pG*!HsH9=+?wX#2`>E;_r2^a?wtds zYNzlyax^T6scyn)uqQaSd=wDz^Jt9V(QdEOQc|m(>{Qow^MHkOzxk@2p9|Q?JQt{| zOdhE1_p3_2yUvW|c4N}N6w(V^U+kgyiyx! zovEZZ@>0)J-t+ss=lAj4{LaV%g1jRU8lP>Jt~52TQVaB&IYvq{xVo-G_~+5jA@p}T z)j29Um;@^YoTteCmVM>wzaN#C!PlByW;e7KapwdHbsu5D9=&moLCo!0BB3ok6DE?< zw$+a-Sw~jq*zAV3SI3!8bDog7hxz5~wd*jyXKuIiIplcEMHG;P+C!^QDanUY>mr_^ z_!(NXs+!F%n^TLMko@f9_@+ZlVu=3l%HQUb(!bdhV{%j23R%I%g7t6%vF1){gS%er z(93t(N!qy?9|Lsd-vXIk>$5E{KVpiflERTnHHx8o4& zuv$QRD#SN`e&`a;5lkLWiOAQTm9pZ*OfkRaH@Gi<2EDi6bnx;rgA@RJ%-a^8oOiBG zy_uWPVkm-@KC}GEZDKxU(_dqd9q#X+0Fl(6piJ#utM3zma)KaXpIOO7(qEulj();u z+M_(MB4g?VZ!?cjIY;dYK10{rjhV4%FDcF{#GUUkLbL5(g7%Kwy3Av@<$e@1L=IIV ztyx4f-}~^uK}QY!RH%V&z3M8U<`y*w+>cVLALf9tf*qb~ci{m6jMt1-Q#>E!=5r|L zaQhVVXrj}D`NPopxjT9b+P3+tb`9;?h9}Vx6R^k{3Fc<;rwWa&SbmK9Xi}M-HOuA4Y!&T%pVxg~?{m%$qd(vJeZHT^_xF82V6Ssu_jUij z@9Vzq>%QOjTPLe<5kJ*zA%gjEeDR+nU9zbLg?pJfn9#@V^5iaI{g9A9%%P_CpP$FV z>}dE>(KKzde^usv^U)9Fx_k4+OW`nv3DZJR<^``)_>i z*1g8k-YPHexlTBXJcpUFA`icd@|c~fa4lI~7P{IAmgYVtIm>PT4JRRU|L|f=KK%&(wfF=H>KFaSk zX~r7t56=(&76b3t@g{bT-{%%Hu*|NZJ@jGnzowY{uOydZRk?=yYl97e(3MWGh6bJY zgP|#^_k?ns;3PR5!%J38zca_gSdU;fvu3zIJRd$!8kXSGBu`cWxc&xobGhKmd_UW) zD~uo3kXLMm$!so}C87Icl|g@Z-{0>HW+!1K4zkyF2CrXo=bOAd-#NAGwzqUFKFLdy z?T1?)>fe{^IL#9}Jh*wOx9O}74~OjML?TI|j5a;OVG?7aj=RstME8sv-J-VJ&hA)! zvi+IRE7!CSxAfTvukT1V6z&Teofe!RABJ(-2RN?F$!+9N@M3PoxbX1LC+_~)HT`M? z-~IFcYaD0Nv+e1sPwxJiyf1e6#Kh3I&!2SIKS-j-J3rd}Z z6XingbH!2EnLjbp_NyZz(a|;!XA~|t-1NI;<=^AYU;E~goD)tmcQ)sGLk07b?7hvr ziE@s4597=?^W-gzuMwPf$+sGiH3NzIlJnQ!FPA)W|95fjLnVyb+&=0!`5}?L)Ih%I zyy2e|)3;^ANzM}+n~=1NjCkL><3U?(bQNdok|KU2i^})HFH$!85ouIk{zS64&LA9lxQ` ziNREJiN2MuT#nMYJ)i5b77smX##Q3*IE&%Irc~%>*SOEZW+6 z{h<^7NdxU3?Kh!crwkouKdt=nKm0(x(v$R^_Gb_O@xtYui(1+T<{g_gaFq+sLhW<;dVKi+=s6U*9vS9E9-6}qfrL3q~N;@*#u^HofadU&C*b4#X?Lw4;z z-_MtYWYfh%LD!yu{k8ok97#pd&*$SUHPn*a3LjjnLm~GNl!zH238SL3IFlm_!};k2 zud~VtpT+(FtBJ2*MC4Pt601geo<`a9?=p$R<_)_g|0ozshW>(sy zXLENmYx2c2Z?0M8=c;&a8gRew;3D_Sb4PrzB)^0AvM>l-7wEXAkPCv{`E*%%e{M(0 z?s!QyHMcY0NfPGCe5GsXMJvZTZ_aFgmUp!VZ=`x+<#E$#Kgaf4Dc|c1iEK(axJyeP zSN;XpWd+Zs@l2Br)=FF^{=p~UmG(eh4vV}r`ym~5*@w<;iR?PE)U>eJc!mgKR^#om zha|l0A4`yHK+Ep>hxZ?A+YLC(pqvfLG3+ZBm z&$typd+0N3267i-6uQvVorZ9lN?o=5}d}h(>9J2iQ_{OM>M=J zwja*#oO%uoH!+tRB64@1knUW-N6!{Ked~J)kTi$*1Xyn88ooxpYIw#q%v0@uIQ*-L zyMJZou#wya&*rADe0J9Bhkt(Vq+{(#W?U3>zL&xE)7zdRlJq-oAx-;TAXDD7N#B|D zIt6`Jp9VU&@(f`b;NfX zgSlIuQ8m8(Sz|GyGlZVB7pM)E5~F;rJn3m>{qzTmZdvgBZBurS{*l_)HPPQzf6IS8 zv4%6knTOgKhT#UTju^8(Hzz^apAX9<;dgGzkFzY3hHYrg9p{$KO%+VwcgUR(XwBN!$H% zQF^QpnbOvg#01e2VFCV${JysWwaHn|!bL z9+@ciwCF@)=SXhsgU8Od(q1Rjo|14s7)giE2#rkKei=>4y&MPVMO`TGhhI52^vs0t z*V*(sk}L^w3nW5E5t`cY+AMsZeqhWnvJ0rTi`)4kr+9c{@~il8qdwdW4_fk zbTC%G@%`15-|XK|VA=3`iKgJ=Vqinf@PPY9Lw;QCvAsZyI6>-zhwSGTiZ& z86snL|J-d&=;huc$+i*3vH96^Wp=3%K7rU6;;TGjububp(1?dcM*7`{?Pu%7(D+*T zR$<}596Bl2QnE6BEqn_VFx2hVKYCmqgY~s=qmeDIV4TDuZ_1dtv#Vo;H-Ev;(pxL2 zAcQO_$c?(Mg{Kp-*^fT0d}FeRZV;f#nk_-9Cb*I=Vw$GudM0tweknZjP3mo>m(SH3 zb^j0-fgue!?<@PHiMAdQAcO1hvGbznd$xafOyz5rX5}+Am=!fZ$_rvNYQD8y$bIw+ zq?MYSq1~b{Ql?N{7VlE?Rk6GK51miShkt!8FYxTN{Y%>Wn64j8d$WEphmBZFu#Rx= zhYCpZpI}}KT{$_uRlcQ*UY*}@)71P0zfEry-CQc|ov&N{_a)pg<~~XqkszCruZ3F? zjk)blp)BQ^#nHTPQ`LGF__g+e+2L;(hQlzBWn-fo%OLL~dBbv_vDp{kD@#YhuhD}| zCgeC;K3Y~m`vBHA%fLZ>?hKzDz7cZ>nJr+6B3_)Xq5Ywmo|wlL4&xg+$r2dCpeFO^!=d%7B-cFm!s~FmS!vAHuiD~li3h5cq_KulyrQ6W@ zgO`~EqWVEx{89UT_*~)-T{%(C-K7Fd9f6;wS~WiL2#klCG;M*;OVkR`5^eK-YAl^5kNA zq76wDLqBxo4a)(Yh>bLosh!Bp!OsFog}FK$Al;!owto23j1IwPXn8XbMXK0QxKi$A zh#!TVUNPe!mlIDvprP&V2wP|2CvoL=%%8rD5{t}{;cP`>DEwxG{Enp*!Sman3BQ9uB2wzx*cFcyIPxxcJB5>xA>Ga=6WX}L zBfdYx%NL^%#>tnRa@aw>C>we;5L!6FoDbvD>mzobF*kJbt?9QPBvn2et&RRu`W#EX zT|06q*D^CaUNf54Q&cIZ8af$mjI?iw3x$kt^t2D79ovcFTFOCN*>&Z*EIUauU-7!* z&aRVxN4Z3vMiVi~t|Fnhtc0)Dgokc-`vavoJH2%womEX~a-%;DHh8J+|AEjg8GLR| z_9{XPCZyjkmhEMsTZJZH@?fbneHimg2A7qvauo%7Z`KIRvA2PCF%=nb{IHCHDX^-gnge;lF{=!L(&Mqe&Glf}twXBjJKQxJ~OD`xB zCS!GplP~e*H~Z zT#?#l!q0CXJS4A`li~1xGV0<7W=vuy)S!n%%=Z%iVzv|Hy|p@-x{!Ypwr3y&8&*6_ zi6cX-t^Ksk1^bdwb#N`(hKdJ^F4kZv6CEfj5n=Zy%XWs#P!2n z@@^qPzJMVc@ji4gPX2n$euJc+9OV7L$-%WER0M(?m$SZC5T zv+CG%Z4tf~)sH37$Ku*&Ew(mxQ`(kHmX`f3-6M3Rce9bw(yj>dQ2!Zid8uX#0=-b$ zGc5g?N!0Xbv%caYMEWwq*Usy#mZavm?o-~zkV{C-3!K3Q%;XJMg+@J17f5Qy5b5Y> z0olL%$sv}9rW-A!S*8D?6O36kS^16J3f`ox&^0DJ*VLKtf1*DP9dhM?q|;5GF>3U- zchF4Cu(UvX<5XGCy*L)z!d<*^3Y#*x;=~50X<%XW*6mJcSg0^zZIB|zQ zUHRAkdTx7|cR3^;QF7)J%g}(z-+BK@Hh6tc+P7o=i@y70|MInP{|6(H&b91}J(1L6 zzs+_|ThZjE7orjl{@tT;x!$g<&Lw1ER}Pu&ezT>AK9>@lf9SKHmD9q5eN0Mjf9~AF zxq`^<(YF(dyBs=Fo|4pV%XIbSL-*P+ttO10{On>6=kY`5u=FOXt&qpe@A8?1H+Vtx z;YAcoUsxz&$ESpy;kdo&{OJKX*Zy>7_z`00Sdqd@iF{qzoYVUGp+|VvCwvwjoWbK# zt`Fpxg<80Nf*6~g?7aPFWSI$M+eLQUo=r*=#lynL0h2>tH8~FdAeS0_TvWH0!k0)b zcjN_3T#|LJO_cL#un=(Qsrd2Wj$ZfuB{?h5v5}xF7>*oB?aWPDw&2*d^?^RbhCI8t zCuVzLVdwO-OyzW3!8=0X;)ODp3DTa-O^+s&zil@AUZMcfF~)X^xb!=chd7vU=wS*G z{;J!ZWB&4er2LMV=n80+;Z-D0nf%hrJB#do`MJRlVBYhlKgheyd?}}Wsh2xw|9BOz z_fH#I(IsBI7#-(p{F>%Tr@o463bQS&ai#}4bBU7|+Rtb@5HdHlEai^iY;yve4~*~$!Hn=Fdl`gsFL{&CT+Yd-$<3XNM3iZ6%#@eNUkYFI z9-=o^+|wMH^E1(&X(}t zpXmrhn%??zJUXrz+GqL5P4I`I(Holf3DX{!d9$YJCG-=VKQby=!mvxXuLzHAXkw4n^p=!o26&6~5^a`p?sYUm-@(kHXg*cl#BCye}u`A;}4apnWN> zGx#Zp;T%}Zb}{p>dH;KzmEtPC$^BAxB;7Eb1xcZiUE8j9Czhn9&Equia_ae%PCxiD zX;ahhjb7>hd`z!2A}h-kStQbanVSOFiO%88PYRE4xSryll3r7Pxbb1i{nXIYQMvPy zx!EFo*?9cvt$QWHv2E3!9KAJQ2@NbK`?kT=k<5-NSLD9=L77H9>8;OFadN?|nGFQEe`B-f4}iG`5&|4ahGFCOYKiM|xR5kky9{it*+(MM4!+rwivr(2|l zj8nJ|o5INq6K$^c%Lac*Cp3EPOW|Hp=(ud~hfwr9<-O>f8(2QPa-0B{kJr~9eVe2; zfe@-^o+8fPd)joqPd$v2&V8r$`u5~Ur%5`WGQA^z-2U{lQ+sb{WTBL2%lPRujGK;V zu!HaVE9oSiwmgyXTk&n`q87+^4}O~zF1+0I)mCZ6M=z8t{Q%h*OAnPOz4b>3iqOc0^xG@O zFW@p$^D@A)qXK?O67%xN2h#U^NXCjTQjo5@s0_|+P3J2aZ<=q|e88XAnetd(`}_m> zojaEt8>8x`w@!?X-DuRyFsQU&k&7HnZ+(%JSqgEOF)5lx(|x(SBVt=mztcl#jyvkO zbi@FWJoo`ApgaB^mLYlQ8kL)gio1 zFAkmq-yzY#+;Mqoa#x?490Fi1!`<$hbME@3@FHS2I_=;>Jo=d6B7<@Txfwzj8Z(+n zgQ0|6=*aUIbl!$p080@clD{3}EgAl?NrmqWJSdl3vtBInb}mh7zcR0V=YbS=%@3GPxD4+PJTOEI_v#`_EjZMFR7Y)WQor#Vva1yrY|^0mdHoZ z0JGFQv@?Xo{zW7F^AGsN5R{d4%g zXvX$DAGB!M48I(8Hanz&&N=V7-N#%tBTGO|EyQh>V)i(Ots$py7GL#dSBp;-{e_dx zKMMblx8GzDJ8ho1uY!A5dATB=t^CMT40*i#&zbyRkGEeXX8_pl%^4)A zZmQr3>MP0dI9Z#UYRiMwb+uWuDr+ldWzD+MnbEk=*Hqh3SzfoLw)&RJ3SV8lF!*N9 zXq-9O_?DN|*471mGaC7~kpGjNU_(=-v$?FMvC^3_ci#Lh&W4Me4I7*dWzL38&W6p- zhFWJsgR>#%Y}n>(n2~)&g>#KBxTC)Esu>l|Ro6IKn;L@+)wNq@Ia%(Ht!34<&SlP| z85NV9>t|Hlz~4FinK5TUBY!J=1e|oGPyWwnl)u3`CC#We#0sapuC_5)RvT>eWzDFV z<=b4>;G0puaI#ZVS58I~h)wm|%4(V_6UmbNj7Iaff>PGi`L>qT?(kLD);9%xo2zRo z8=b4NYMRQ*XF1z9IolhmgOyHsO&!%Rb57k%Uu|V&MWe5*VN282%G#h)TNfYFx21Yp zWvwHjX$+pG#Dz!x<=E{YWeZDz0 zKKs;EHwJxKO^ua8;-8dxb5l)?Pduc4g}Kfr@%empO+hII6(?!bCo~ zRW>wAM@rzCU~vZwG}nw)GeY!qW-?d@fdsr@YOfel~*=4!ckFOD^?rxOr|Cm z(L-lc%$`wkwKO{dDN2=lZ+u(_z=&8QaC6CRXb+;3g`L)bD4O3ORBdtRaQ4t zR@BY*T{qX4SBYZco37cgP`b+&#>vSulb5r(y0WIi(RnSZEIC_h>Nb_tI2#LAt#`66 z4OVWguWKl4*nwtt={Bau26Qws`r-VM&y${;!e*{g6w(?I!YC=1p#IC+klbw!nN z%7PMyQ8UWxwlcd`ih{GfI#`w9EAz2<89mIYuWS%S0u2XF(x@&+?T}oSGYi)8pHgMN z-xjIshW}aU{TuoEWI}$6l;6eEmFJj->rwtk6Yvk}@1nEO*2}yEbp20)^4Jdz)TYpbVVn@-wprc%{JdIy7WYRNcqMY^1bYOH6u zTsb!4xOjJnaP^gyH`K8zDf8vcVaZwJ+f>(7TOs+j&nf(y8|t>ovaGS1Oq7kyG(mi~ z`%S?5R*M0}k&tzFtGiz@tT_K)gl_u(s`&odc-->$@3G|{zQf{i#R0`$#Wuw%#rrhe zKZ^tZqImwv10=9Sf5&nHj0I(6h2yexFNYGZ4`MCBwrZJ)RK>Qd}h>{0AhtXFJSOo-<6&Loc~nI}b`2?@`{zww;$ zPd?uN!%tQ%rmUc$wnmif(1DT)n=)DO{bKzry}4F|c^` z>O%8l)v`ioX+iP2qV>7vM{(}rbwxtqM`3}p*8G6N56fdIc&#e9&gCgw;^gM%J8Rc1 zc2=${bn=(2cUG>>cZybD=d4?`(pj~-*eNVn<>akim6u!WEMHmV6kO{R7CXfSYwaH* zb&7MB73Sp@7CLK4YRxKV$?7#lYYK{-VtyF9{3u+#+T^8h86oouSFc^SrodUByC!$d zQm3G#culVSK(tgg*H@MYD=QpK#+5aV@7z)stZQ_{td2?8+WZ~&hgd?fy0SEbUCiUG z!Wyc@)ZFN7!u)ts9H$zy;}U49b<^@S?%2Ait_GE?rg9sJvb|u`w~ESU7LfAW$UFVr z7_6+)9XU0m`xT7{$)@=2|Xf7L_#>$$_ z&LS~sUv0w7ojW%!5G&QKjiOeHlBFhL)~)(P&HRZ1T0*d-jjLQ=7UIDe{6&9_)uNH* zi=@h-UmfS+yRm6&y(EoKunMbgd0jmg_086zY}8H%oAsC=V)DgsZI!~By1IJJC-c*` z>c(o>5HM|Q^=GMNlX83<9JGtG|3tBtn5OF?ns=SkGc}t%0wYdxEe zte<7sE!)S&uqT_g4Gm58GHux2IAv)8}RlcoF?5S>&^>}U5)=iZS z>M4`gseY!NZu8pqI-%I5*q`9eRQJngSpGz}OaE76PeQtG{4MD=A1(&eeL8gc{&&%h z*A0IlAw5UkiRgxNu__^)OHag`m9Hn$ma|#Wub83OJx%=;d(XG-D#ej=th-0ir+fi* zpLo0VZ&CCq_Pg<3X#IT`XgudyELC)T)_qL*{OUfT>1QgvMZ=$XtL5)i%v9_@+tPhg zEf%Ree3o_BEB3#|y027s+uN)=`#g&Wv|j9}sIILJRvQhG^Ah8ZfTG-0%ktz5iAY_e zgR1$Cfobeu=svO?l3TRQte@R|^2E`-&{tMpKUWV?%-GC+2Z0a}m9pQz4Rr{k;bunM zCS%~Mb%WbsI_GM1tSfE)qVmSXVD=t}fh`7~hy}z;qx0G$kGXmeikuZxjKezvaM)~s@V1d$XG-Iq81Y@qSp#EYkb0A25ynJ{wkBm39oPDbYfKnw*cwyCJVAk61%0*; zos{A^jn!Lf+2*Nit`2H3T~TObG_zma8YWR zbDL0grCbhkaj?1`mvo8sD;rT{ZBL6?SKJdlMkG7V{IB<$U+jY!m0u19G257>g-kLW z3TdKenbOoT;ndZaqYW5ab+ie|1Qm&0*&JgLR+)NgD&^cH&+s}sUWybCDAp%nm%3g2 z(0UuLN3kyfkE?rFG2=SR?}j@amMH(7WtP8mljct`(OsnU5#@KoC1P0pUA}$|_xIuf z(6-s>;UlG8W{Gl{Yt4)|OW~F1ylW!mgy*xoi&Rlo~|S zR&uS%A*a!tiaH0|2S#K5RBv|JD3a}QN2~#&$08Z)Inf0mab$&plx(UEvY^>sg-+~T zb(M4VRnDTToZGH)7A|xaRn~338dHW*KIMnlG@M1YNLT;07Vp|>`}22h`q$tAjqik_ z>vqwl|EtpbSHR@2r=wz~gS=+uvmze?T56tnBb`n&o2 zzYU%LpOo_-ZMSZ%m-jc>esE61zZMHm6YuHh|LXMr+4wR~lmEnc|6abtaR1N!ukCMt zt3LnUb}Gg{)M)*G_r2kri`@(=zdGT zTk#J{|C8ch6rImozGTITic=KdsyIzC>HOp?=kv6t$d%?^-qmdI}0CeE%Z5xebfqh-@gCidqjd;@? zr|quMh!5-rbHHA(2rRjKG*ShQfL%iW=xC%5^nPqKatzD@!(ae(xZA%O%mll^Y%mN4 zz?_d057-8_fxTd__=5vrW;gMGIiT|v;sZ0mDli-D1_NLpSPC8oo57M#j7ECEFnCPx zlY~Eu@c%|R!CtTk%;bw+%|Zvez%bY+Zf=1HgUz7BwPC$rCO80QgE^lbjg){TU_ICj zwt?MX4>$n!fmxp!jT{#`=u9PlpbzZsA>UxhXGbF~U^Cb)bnpN;01k-%=SCyL;tyuL zmHGyAz^u=cKG+O4g9Bg>SaJ{Hz&RlJu z4EBO;U_aOm9tV5DVK5AO&xh|p@&_IVOTdyx2nP;;{b1&!@CzOEP9wfUX7>{Al4`w|9AJ`2Z0KHreIsj%qMLOUJ=(~V?K23drS>K_Y zp!d7f3)l^2UP$^!Ngpiv9_Kp6>d%@#iKbZL%{Q;~3hruwIc?md7{=sIxEL;!vfjwZ(>y#G^ z{MTq?1U&u*{f2Wf-rtiSFcYi-2f!|{>P^xCyTKFSac~420W-2F*B{6y*a!N-<6w#4 z2;srZljINV1xG;dDE#cQ=YW1ND?vWmy#b(BvJwn zBy&MI7~sCJFesm&%eajA`S@Elm?@uy1Os3d*bTOUBVaGs%Y|acgg%LI+;5mUIT9%n zPxz~;FR+h$ zW!pe6*R=J3&ENny0-gW^+z>YcW^x&%|6POwtH7!yV@d=K?eNdExazyR0>R)NRC7BFWe`39T8W8!};@#hd8%mKq|sUNVp7=N&2 z9reBde=r*itfwBpUa&>n*HJF8tpvV>)Z_aoFE{`m0K2cJ9l+xoXoo8acLVhac9%vX z&EP;8;l;g)^uRy`^#S(YLjD&~?hlY3Fbix02f%(Xu#<5CHiOPplmpBJkAvA@=56E; zYya>;|2yp|`*X=Io|CU^CbPmb8)&Fbs}>eYca}YjE#j{D6Tw$Pd^Cc7Zu< z#1DGgi63kRy?)XGv%s7W5l-A-Gnm;ydBJ9I02}~^!K}UHKNmL`082U}5m9%0!9LKt zkNAZSI*Xx$KG1t7{9qMW59V|c4r~Mazya_$nDt@8<>3!zf&-u*41*QVeZN%_Fcek1 zto`td8|(x7K1KXXD95L%FK_^?0!uzayMVo5ued);dBA3H80-eUOUWnb19Lt{KNdIG z0``5L{D1@C0GM?T^$2!@BjOKc1Sk)f1!jGLa)AM`6s!W9!OVMUZ!ib!1^d8bU>FRG z{};)}GQxpA(A!HqU^iF_j)2XAUm`r1c^~1yFgOBM{X6L|C!b&d%=rrC2TQ;fuo>(I ztG-J9!N391TS30RMn4w(I_ZGT-=JQ>5wK6(50F2w7xWeq?m_s$UN9i;KH>*Uz;18^ z><4omA{^KUIxC6iVe$uNK0^C|17HhSa**}_tH5FLf0XjCA{^)kn;)ZJiTk_63+5ap zUZI2D)zlA|1!jGZctLrlT5ytXS>q%%XC$3JiKmPBP{CaxQvO^R0 zChtk<^msls`Fls7ej?4gBDD~&H~8Ot%V;D?0xwR>xRZ1;_a!e*^L3^aq-E`$keimh zXJT$zPUwvMw63J&UwI~{+)nJy6&dJ6e2fqq5;eH!#4==a9arJmI`-ZweTyCij;X%pew0AK0tqmj=E-+G!OWv^#XvZv6n35`e6 zZTgpLqgqM-%_~_z&POZEyRbXL-DTG5#a?zfJs?NG96Ull3OyTox}n%VLVx)*{3n%vjm&5p(2Ek%m3GdDUIKlm@S6TmX!^ra8rt?s!s1l}-vRjAgpYFV z@#LpvhLS1#&6CqIA>^icb4@R{{QKe0XhYW*{^g+wds41V%if#Jc-~CROH<#^-{tyO z@^KXY6Y#GSep7EmT|3#tYX&Q1;d=wV%yzyV8_(Bh`SLY=;hQ#r^1@dh$CvH#TgIi9 zQR*chzHazt37n;d58cRB^$_~Y(A%KPZ}*X~C!u#iuM^@bX^K6b3Q}E?TEgEzs`Oe3 zGkqd+UP5@GFM@so`dcNuK0+^s9)_OSKWm^5LyxZ~>F=%3y&Vbd=2>CdP4amU{sH_= zKHYZp1je+3#B&tBF8ENjW9`2=EhC?DNIb9Ne*ph)Mg5nj4JUcNY!VV0&wTz*MGyw| zVq*{j@_es{sc%m*!ZwuR>9k!H`CpJ)Ymb(J_ap+Pv?jyf2jMI2#D>9d+uzql{Ux3k)W2E$$HY?-<&$_)$bTR4 zNME$^+&IQxzCJL3|1$AM)Js3PML8s$eEdi7Un>6b<2t+99oD8?HSqcNjYd8sd~xGJ z`uNgRD*z=wcf;2PU#ak!_VyIOvOINlnwXoM2P8lE8@X-#>r8(wCQp)|=OjP)cS-m$ zgnvl<$HcQ`3|~Hc$Kl&&`Irx_{Hr2Yi{s=; z4SfEt(a3EHeD8(Nm3xxz-SBn87n@&KBlkR>YWS>{VCCaM_%c2`8hJ|MGxeTle>w75)S8Z&Ut|MLNw{2=Y*11 zr1>hN@;g6uee`#LvP*fmHOVO<+}Y?K&blf8@O@r=-9+M}OlWw>~``IG=OY#4x1kiYy$xsZ}m>f%QlXxoNI}YE4!e{!K zPWCt@{Z{qQ6n}k$z90Gt!cB3Bpv3op@-Gv*iH~`1mz83s|Kl%v4Q4)x?-yAf8VmyS z?0kZrgwGG(Cp4Zt9_>GVPkpoz^HSHlVT4W6pHGH*374ngLLMer`Vqs^%=5+gAIIOw z+2x^$dnT;ho6^ak$lmAil$$Dy3bIz>XobJ({0dnTYP zhbDSHiNc#3r++U^^>oCOmP#Hx%OIi4pfNK5mJ4ZBlxcZd2E81nvM7nahxtNDTM$cH1T11uusWOY${w(`U-SAx^{Rz3SH~HE$f2U_pif0>~RxyzF+W=n= zdn=fXqL0vn&m`T^*eLZZ)Xemw{MICLYoO#fJx z=JPDK^W}=vviSK<+A}2$eVRR=H4;md-^!0dNYn9e#$Rqyw(Fa~*!2zTk?4A15^n=iZHuB~qd`0XT89m(0^M;SXBz#tjl60n{ zP*=fc=83rV>LTbZ(09Y*&WqdW0V32S+y?xI@i%%)T>gU41MEpvNVwQMxRs#pG+@Tj ze)ziJdqenQ`7`D4eA$jrln+y}(vC;rzo~pQa=Gx+j;dcX8tk}z6@ULd>=B6n(zGs* zr`hyraY{Q+$)Ni2zf$Y%P7k9<*TrTXYuY*Au8WJ3&y{vQby;kSAoO(w+&O$;gjq>=2uc*FpGv zUmT4*FJVpnuo%{M_S`aMVzwn#-p&y&|hv&wqytCcZk+zxk7Wzl;Xyn#p z9K=6r-M8rdWHqaS-@VP~7sjH7(~We@WK@n0S~W6#9v(~9;^=uElOvoG1R&-5|LcMW{? zUm1=3S@=x8Nlfa$CCT%fw9LFjxwIdC|5sH%HvLDcA|JKeu1gN$UxdF;;-i;euk`1j zmq0i3E%f(6mwxps^it>_5`I??V7_3&t~Qy3yn+8yF*pps_s8gb#5m{_`;g8@jDyfb zY4Q+FE^>}~gM}`_aLkhxX(DmC>GZ@c`3Mq!)z?QOJNRweTeKXypiImv0c8B_hp!*L zi-eEb33=Y{X4AxT5dUNNuND7Te_osB3%cFF$f1|v^L|71d)iO5*ZBlF3Ec<1HyWOK z*N%tSf;@m?u6;__M6S)}PdDK%6@os}zJ<^aK;JL4*m$G`SU0g;lW3?Qqryr&JNe^# zU^Mbs;g^23Kh0~#KlDE6Ul6(}7wa#ZuTWYh1{JDF!XM<1|C{U)3ZFjn!RMgM9``4u zzw3I%6QrG&q{`AdFwS2iZ>O-39e$9jYb7p|e={GThlElZ+}w*FkK}U^{2AXGjT8vM zwgke&l8sC1=b^JG}v4_rp4G#>#2hDY2YV&(qIgzJ?z$5`Bce2>Jo&bff4a z^kV3J&=(7}F3oo>{Y~nj2Kq4ccF7;$ib8rjae zUgFy)^OcTMAu8je;iQ>m=dpA6GjH?HBSy)lySW)6Qjn$KT9frk>3F zV*9fl6?A7J;*s(d!ru@7&xK&hXXZ~+zEkE;zh}?5<ciWUcFg;yJEcX($D6zP-!N7cM1;V{l4Vu z)9Uw3v=YC`j5DkMz&AXg_IjJVp$DORzdaf`UugnT-o4N>ptHppeT04w^c?7By`w&o zkAu+bp*IW7tj~+oJ{VhH3E#``4ZwFY%BOZjY<}(nUB<Bh9LL!`Tj9=C z@gat(4T~U9J(}z`w0C7=qI3OxkOOtZ$KY`zE|j;(zNW2 zc0QRxhphkpsdkU)(3_#ZDf}@xj{@NNMzkDDQ_;{=hr#fX59*rD-RUJa@Qa$JFza`1j(!G1^~>bsY54UzVqC z;je4|Hsy!^_;b3yP@I;rirA#RrjXb$^dU*d^yfHvcVcXZmUtGyf8amj?Ps=ri=hud zUnBA8Bk|Wj&v;(#s;1wpjPEyMdUn-TGr#VKzX$$J5{Jo8VRSsY>oe&qPr?_5?~}qe z#!e?oDzQRYyY8#-mHucn@`B~V3WezkLzJl2OVws0_M4@tq9NHw;-CI@5le}(v~9NVcei+?fxa<=V#;;-vlKlPjkkK{jye*k|o ze`$LanSGsDzg`62e)x{T_iKrV_U{zEX|Jr~_oU>BJs^NwYaU;&N%$8C-@=(XBX3Q3 z^jqCWjmkyrfV%8~1G%W0`Ub*JV*$}m_}^*z@$0`+_KAx;-yFBuR$w?9XSY}Kx0Cow zIn!r8K}+iK`V09}{U!M_U71B!7@|NI68<3JvpEa+m8jfjzS8<}%a{B<3609aP__ju z6hSqn$P%Bl%M>5$^`DJK?%=oEZZbY(8R{Bpg>OE5Bk;9E<;}IM_t=+9zMRDDmYk%8u=RbTbXC}PI!OXuxHOi8FqJa zYnddb(}!8l9EIO`Z8Y+Jz{+WN-LNStrkA8{NXulc!4g8aOg*N&gZ($ceaZuYO44>t z(A&&;faMq>lFva}k7M{S>l$g7V&aptl50~=6Q7X-CcdR3+O}1cCe=p#F0RPwcE%mo&BJ%c5&$X<#jpV|h8r@Hj_@*%6 z>)#xWthW4iU)q{>&3rZ+{~r9ywVw77m8);Z`l}S_HHwtD1h(=+@)abWff1b_sBg8; zEivmvznMg%dY1IJd*B~|f1;#o)-~@$YA`9BKZi9e}+VB{UMM73>e z@qZP6=g-(}0jpo&zai#7qmuP()HY>-QCRdZ{QzrB9WuwAFF?3SENQf4;g7eKw3fi z-*g&5&d!<%Lc;J!`4&Mx0o~|VCY_ibEA6&{Kg0MhmH_z2?2+4|>tl(h6~4@*NMxb% zS-bnSsWL_-o_qL{gMX{~@A0VJ$miLbmTC8i^YJ?hUk`lWl72$D_Ic13bRS_^RG#Le zZ`F;XZ&^KoD4eM?$WKZn@@zCccU|v!+!Y?C{O}!vFCcvG_-n8=E%mkme`mtjdXxBr z&_@V&GryezPBq9D0`@2lHbgi2CI0>J6%l@k@X=3YAFLqN9z_xVgZQ`L|4#A8XcrP2 zzs}Q={tNhb;lD`y^^yMc2J}AYKIu=f_7BMTOP)w)QbUc5SmB?}fa#sc*VIk_6HQ~~ zzU0su^!q&%(Ky6{wmQ}GtVvt)RSbW?%h^DFN9$#itrzhR;$MaTwc@Y(!>yWgN$+k+ z5C1ChzgEh{IAlvRV+lvNmNB1ZtIJ_Tv#+i}GDhaQT^!q2F z2cSP8v{<~d>bpKV@hvy&6T7KXkjfb>HR|aGvGmI+S@dV(`Jlu@zbs*^mY&(^k;XBz z8@4RG=EIkh#z(lczT)RgqZh^OSxcA<3X&woq56CQlWg@pllU?)H;TS4Jdq zSuzgVB|e>)Jw@kHRz<9($BE4@DWrU_5?}q<+OG;iDa9y~Y(&d8{nAu19`i{1O=V-b z4?ZCJY~a^y2*;pL)NvEvPh5TL6n&;3mBR^R4(jEm){RwpBoXQNdx^hgYQ&y9GvhM0 z{@UdZN@3=a@*IS}2mW^R` z^KooI{B0_BT<(Xj2flZuz!z(Ob51jMuF|ZhX-a?YNTfSBbCdyhvoeq^pno zPPvTshW^W_JT&#L^I=O;@~7#iGRny-Q=+jzN`F{Hxcc)s11xdHG7B z!mOY}A_hdR7sBUzdnEEH;akPJ6b;hd53PVygMSbH*JwTKc#fUBHFCqW=d!d?&)(BC zr>A&a54&*KNjlGwPV)tkh@v=HLv9hsf2mSOpJ!k6Jwx&2r8?t!llKC>^Ye4Gao%{)KV^EF^;sR3J5_#OF8?zgVgwusmA%1Vb*L+bV@{6(ZJ7HWIxw-^pY3lgP9XoMIy7_a_mu8@c zNPX*i-f!0Pa$d%km?m**;PYJ)i9F43`0RSb=+DM(D8?FhnQ7{AKm7ghABc5j>!p~Cwh{S?|kdHEp9}QlxHdmRms(n==mAb-$nmmh`AXQ zd9nz;F8HMHyN`_9V(8t_KP<$UTtJD@a||*w-!gVpF6r(SMedr2wO6?Mq&=d=c(&@YdU6YL}L_Nv%C zE}NZ>%+`<+`n{cBrQC(t)Q3M3*&^u}dF8IZJxikc26~7)7YLh_yOnSQgp;xB_8;5M zrO|mz>iB;6e7U*~KwsYD2_;L{mXR<0>!_rU|7#MDnLkmh^xS5F%>d#%rsto8zi4qJ za*y!GjXyhw3Q^_XJmydMt`vePmst;>w{3Bc*_rw*gl`zW7sie&^lIJTipjS^thmXI z;}0w|VM)F0C%%>fzDBC)qTi?WBzf4wl%8noUCR9=d|~(wE1#~9%;DCr$5%G~67L)E zw=Ic|S95;`?$!uly1>u{DNW=P$*bqTg)bkz zOx_i|Rrs!DLZl`{m@Sv1XZ&^bqZ;_?;k(|(=bjUlW1SosjMdxS@b$vCQutJ_y8)&G z6O#~a{T_tx71Oxd$oVNQBTCTu+S!{;j;KORZvDE>wGuaE$%SiF#qYnPUGdKLc`{EdAl)}LjP zD$v(fOuwBxcMUd!jUyRj6Ae=Gh2 z_>Z?=Oa+d@=UWxA=UA04;a`TH3H=VCX+G`zeAAfl zQ&7lT;FCPLkHkA2dK+|>3(-g7T?D-c`inv}@vhT-Cz+pP>#hp;N>=loYr`kw+wQxp zglm;{e2H%_eEsmu&~~T*NByl_l(YAe&O!W( z);8Pe*NA9~t-D zyvUnk{JZfVko1h4j;>n}{F%$l^rd$Gd{|oH&*9zXuM5A)A0lL*od4}iiLLYV?72hE zO^mlYCgnUzJO_y9^BPa5oFk5ZZ%$TDyrh=J%uSB$F*oclpzBY#Y}d9N^(jI~ncYs)9~6NGOBKC^G*>cRUsM2sD| zGsW{8n$J};O?vmh-~7JFDd%qvLT`bdI9{KF-UfY@P15|8e7_34AG%rZ-D3Cqr2bPd zypBM>UpP(u$Mit6UMi6Dy=J|%goA3W<5^jxT!q9_dcDr$#Isk9o4e;H80@-!HiAL& zvr`Pd8zQH?cX+qthj`wHxBCeH{m}jJ-{cZOp+5<|8~R%k=r2I;fo|*+>L+#e2J~L& zI!~DS#+@f5zNsjB@(z7wLVUBKpMZW=0zDsk7`mxH^^Re@ncxp=WPYeZz2Dy*nRzGxRrw=FWp={U;JW zpzoL10H*x#2TG|ID<9qY(44lnvxb$U`{DDKMd#NjpPa{6@nQ7-C*cdj7qs!Qu6(~e ze`>Y~r^v+NMr-8P8}R3pNA(S(ukF$SI*n{jy^8YSUvA4|^;*%=Pz|LX=Howr|J!Vl z%wM4wLO%xmt#Nc2Ulq`gL;tnVja<<6LlLTn+QqOY>k@_c43>!EsJoQ9ZkKwypLkj- zbiP;-I%AF9_Gk0ete?LiMG(H{;LE9uM0O|EhdGb?c?wdHD&zGed_9{Z_I!DKyRp_q zBNZ*zt!5MNY!;UFTcUQ2n0+Ct&Ds7?3||<&7Sb3~UY}T>w7_Zzk$kkmpHmfyG@Z(i z$z&|Qw9fKRlpp_Y{QoVke@Q==RfnqWrX5ehmvN)6ZzL|B`TU=H z4e}lOMAW={KK>iXOfvOqwCc|`2Dp}Ju^C9 z?K(~(vHc_Hcbwl}uIF}%SIPiYC{?FlGg}<4nh$rMJQt4*L#~bS34zF|V-U)jqZe+1^hDZn05BqMY z^s{M;k!Qps>iGYA{$CCJpQwTCd47{@hN7E?B>j;}>uyn7{mao8SDJsP3LKtb4M$U!G)t zq^jH1G2?Xx@k&;I4)~d0?ig%V4;i2GoMFK^SF!XGzxn0T9d*0;E>%9whFnW%p3#Uc zPyGzPaYxkcraP?emoK*dhUvfIPo~y?Vp0e67Ikf@ZJN8Osk)|OPIZMdS6qBjpvswB zv7?swECw5_kA4t(%kwlf99H0Y>b;48=blC_YB-7_@_|h zn6$AwZgV_-TI8CUF2O6;fk#n!@@@IjB? z(1RLY^w0PwF?>FrZz5~l^t(NN!``ig6cx0ty!9I2*q>GW6xr&Acja%73dB-fyo-F6 zvb*73Ik+C0h*&qgE6?2t!Ij^zm?yFR-Vaq|ryJgtmoH1j^0a9HH~%i5i#Nd|veEu#&cDYQ=klaki2jwd;-7XL@!^Mc{vOuwrO|@fP-Zc}PZ#e_2w$Xf zuxPgBPgyy(#oTb#*Kt0X5Z=`nig(y>lUzo{#QgVYcsHA+s&ABP_<_sEM&KLkbb1rQ zXWgG`II`}y>C4>%@lRsh+or(%{*>67vF#?EN=e&I#2tPY>VdDV9~#BIG6Az zehAGC-=g80HGG!KsOXm4B}e!n>1VqHMK`?2r})P$j*DW0b<>XL`-P_Obs5z&!D-TV z`)+*r`pK4hV!oxm9gz2I-158fOUCDT=@*&H`PgGhm;e*gk54o4Hzy#NNBxOp((^Ds zjz>>+g5%OtqU(nE$dZxD?tC?tPLF=uc=4a%xbw?cey`)s8)NCz&L!i;Gud(F{8;|f zsQeyFpW?W3c`W@*$CbBZ>1ok**I0VGQu;r-^^c#`>@ESJ~2aw^U@ znak;2`4dN`y{0;@Tp3G$tK-UxvGj8sR}PG&%c^TrJjwh{W>w{m+j!4pR-Nv697}gs zn=z{N%M|B#G91S|`M5mJnNC}_e+<1C*LeKbD}Sl3pN-8Fn&evI=~8+Sw>(w+Pa^;I zDmUEmb+gh-mF~`i&Cn&DjLZG}iph=J_$_p|Kddmmj&nOG@s}jTzgPMF8jmZd?oxWa z(#_qT(0Y}AY`&jg#HksT`A^b4vB)oEM~A(0kl#tv|9(x^oj0E}^h~EHfiCly@b@Ip zpNBqPJ-+~5()Hcs=a=K`Hh-~$gN9z?H`9?#NvPE=aD)T2CdHcZm(*=*?_wq)l$ zO80NE^e-vhuk>N1-=XvsO8=ggt3>I=O7E(&@!YHQO-eseZRwBVmZwqaJvUjpvAsfX zhCW_-L(r4P8SnD0v?*7@IQoLpk0sFil%8mZdd9?mp3|-U1gCjkH1t#DkGx|b>AH3; zWp^^5CygV=-U)rYa=lyQ@m=FLQM7ABxk^8vbXQ#rD7|0lx*T%WDE*ky-TJRodW+x2 z{}GM92D7}<@x~*00i6}ABPYx)(0A6{{Qo6IpZ`|fi5q?cm zdUl(ozt{LW&J3k@Dg6fer979q{2%fgx9Dy1$h+#2?r^)`xb0uZS*i3Qw5 z>y^G(={GCAU+Lz~5Bx%IJbP`-=I##YA6ELYk68M2X!3ko>CRn#0KYS{5zEXd!=W5%+k$W7vh&Pe!HJ>8v0wHOMP~I z&c@@G>pbW(j!HYV#kF0gpC+Dno`${vx{)Vew((y~7Ufy2^irkEx=^cJPBQF?>YPbj@l>31l-=YGGTY*P9sl%DbLmM-gQdA^|Z14@_qQl3YY-t`r~ zahp2~`1L)d4}aCt%{%qbf1>pIuUUGJ*4wX?p79M!ckSsXm7cBi4C0VyA_fepH^0&^ zvSeqf((9G(>Ma*2y5rPBQmTKeyl zew|DImZc|qtj8v$7d>R@U(tHls&wZOOTWXiJKL1rrSul%-=*}P=PbY5?sq6X`v;a@ zuIb*T^o&O>-MrgP8lQ3FKW6D?K$GVlH-4qN^?9Gt>ks)2pLxfdU*B}&`L?B-ce0^B ztn_T9i=9oLCzPJ?BfoK9Vg7PHL+L#~wsiB3Eq=$9-lF{LmH($ouUGzAN*{u5#_8R; zhEk*SHyq<@(*i$zNYkSrJs1##o{AL?pJ!N(sw`~FWr#xANz%k=Vs;aIt~9Pl)ooz`Q3Tpb4t$`92?Kq zl-{NEE4BY0f-d#k|4~~%S(@&*p^ul(?<>FmsUXit;~U z@}1wH9Y5i^AVBC%Sx#TJN)s(*w z{8aY5l=3sXO^?fmo#cz;$EfEz^66fa?Ibd9W#}H+Y zlFuAA{%y)XMxNeeTz>}-WsifO%Kj_uTNfbThCk{!^DEOs_1-hePyPJrRQi9(_RRj5 zuPWA3(dkG~5-+oprhhg0OUO^0X8fKuE4YN*f6!NO7v(pQXKpoq1$h_w;0sO92gwJ? z=RRWcZoa;Wyko@V>y#fO_daa$E+5v(({_{B@BX3AZRCT;P5zzKb0_)8A(MYO`G=hT zkDB~*iK7mEOGG3VpbSD@Rhjr zY7hDRWhTF$@_Wcr+Req?VRG+&)1&W1L!EJ_Cu@52cP_!F$fxtho&OvoKQU%{63EKW z-Q=?z-=__GA0SVMOwZqtKSbVspReTq$iL_~<*y|FC&y`rJIJ3T&!oN*eP=PweoUTz zk6cSV@0aA$MdLB~nZIk}IL+r^FCxEy`~>xMk-wVUzs2kTIbzSji z#+@JTA)lsx$4AJ$_nZ7R)Kev&r~kZ;{LSPe^jm#L0?OV_zIf2=pQHS}k7x@_&AhG8n^PBVY^T}s^>Z_!_y8>sIIC+kHH~W<#pMTKg-TwFWsOKW`6ST9Nr>-I&oc2}nD#~9Aj;C|W zK5yy;m(M$T_fK zlmCc3W&U^T*yo-6)4nRuck|$^?QGLO`(xu3E%m$?J5K#qkiVR~W3RQx&F^c-edd9W zQT{se_Oj`BcIYP``JnMtZ2v*>`HFFUS3GnT$QQZ(JOm~`N69l>KO8gc9drB#z7l=c z63*UDzVK_~8?_YATO6l;Y!me76XYju^Y!|E{U5(8Po93rxP1O0KVK&wOnkj|{_|b( z5svS)mU`Y(;BDUW&q<%5d2a{H8@lV_eV{a@jIPdmrPaekGJ%Lk}`HF*d3xqHYj zA>m7r%0YY=_~0W zp8%IUaPsHT@1Xo5^W+fa-%sBDl&_?N_W5&g$yeT8*8U#y&rm+)y2!QjOXQ2phi;uF ze{Wv%+fPjYZM^TlIX&zbTC6`$flI!cJSks2tNf*q$x_k|XP^NZ?_6)}W$9}25&A=w z{P&$a{VgJ2Pd+p5E14$WNxt}Ev%}w$?;)RN9)6HKBwsl0E4hd~b^1AvPm;^upiuj8 zT&Bp6IeD&IT)*yh^88%V<>v>$WxV`5t(~~kpU+W#?rh^H+KfL+KF#&&?@|7n*^BjmpzpY1X(BPTznAyK=rHe&yuuN==$x_kwf8ul(F zU)W{$Jx-n>pUxQnWAf|B=em3){p358^P=T&nDXseU+L{E8zr9)jo(0CUqR0uEAR)v zJ6N~%@CfzKuCey(J3AooP4IJDeox~}R(eYHEdRZZMe6Z;e3f+jwcn5rzTWg>`=&pu zVSE`!uiJQ;yn}rDTH|hB-k_X9Er;zZ@PpJdyUSPU4C{=NcW@m4iu@?~!aBRJo3G!d zoI)*!dnrH9_Fvp)g%6O=_4x|^nspuq7kl2peB$i+wH5S#Zw3Aw^|yCfJ1?gGGtM)6 z&OK@Oh1=`TxsD$+zM1^x*q{r^u57lt0mJdfan{ z!{lDhxc)6A+@lD7t~`If&DwJ-@B2oT=S9om52EJ3Ie?e0q=ZcTxUX$FH$=y8N)}B{q(; zjQ7(ie>VC2R?~Bs{AJ2{(Q=T#O`>^{_IVG>wmCh#ugm8{{^@>`Vi zqUErE1wKYS3x|A_#rpVjb{!7Wn} zdX77J`uXLQ|2X;lf0!P9moLgb4=#Dq{l4gFl>aK_{lg}|pZsz1Mf&p}kw2xJ7cGb9 zDL>8l!Z7L23twvEGD|zVdFO2MIgYyrzXiWUA}5S`qiJeDd$DY;k_&Hzoee&y}nAjb@k`T+d1#J zar`>D&phDr_IJr=X&IfquNsa~&tv2>|7rZ2 zuHVige+7AFjmcmB0xP&g zIfYsd@;7?KA4X`;T`cP(Pr07Fi~MHtcE;&`@{-dN`bsvD*Ol|4GJvU74(0W^8QJ7`{D}n-=ciV{m}^T`@{ez}k5_ z<=ZYa`}?#*H~Bf_BOA>hzD#~Gcn8m057$sW!~Ui$>?NO@@ReNAW(E7mJGid9o$?|1 zG~@aX@-g!E9lnyElTVNj_8L#fkC88OyxctU9_18jIXp!9Y3B10mi;aHT<9xt>w#~O z&mK1ZKFU9#eEIiTzVGC@-kYTSGvponOwW0=&o9VlxL*1b%Abyotmb*^;R5COeIB;c zjql|v$ahgb-C^VVH7XkfmwoiiN&D#h3VPm3J#+NiM%&ibtCh8JDZ93q%dMTvPZn!Xp|cp zPx6sh2-2`p#eFJKwT>@utB6-GSCTj;^Wr#~gaUNrKu}A@qH@&(G0AFpH1eurr8KBU zsp$>M(PYhwsyUM=m2#wI zAn;(ZsEB?=m7q2rdju9kFxb5bQMvQJ)*ubrvIaT`8a`A ztG)@M7+^?l!=Vc$V|vy-8dmgVSGlIgAv3Q?H5?@_z-3T1F3SJ#$T*%F4=ZE1W0b3T zayo8@Y=p5XlyC8>6H%0kYl;7)VZ9pRl?KE8UOuV8horCaAO59LIWKkaGK9EvOH`3@ zlAfwjUDr$19A0Zs!HB3MulH&d_z(OqN=Kvds3Oi>Nz$+w)*@+5^GffOlp$Pf3RgW< zr`D~afpBG1gaIQo-EOhbM8=}2DqbakC=&ghS9@p{?kk=1s%Ul`!O2oD9*@SwK4uV{ zrS+=3Z2_bhtna)UV};W+hsc3CFSgjhSq=5o?GxA`5How~{XsOD!n9G|3-d?n)tZjv zQAC`xNI9B_!z^C*AiigCgN0FC8ZY5>2uLBFn;BT+VJ$aGO+i?#mWpMovhErWikA4< z7WNA_lUP78!VY7F>m?VlWEq5w-9r0-4hNbc)B&4kg;Esft5Mw44C5x%2(N8O*pAJf z_^W`bo@w8ZEilSi^;NB422!b7i0lV*g_UB}gR#`rbf7Br93t7PA}y3ABScs#U9t8AMWnyT(|yeuaHz!2h^|g z%&e-oTF>eo(@H5pGM<7*=hOz)+4ULCxk{Sq)_Jiu4NjpMK(hw&0dSg9oh;CRCr132!nYm&( zFy>^OL4L?f!!q6&5(m(k;8+j)B#GzMR5}%P4fIR&6-sd=HFl^c+Av8x+dLsorzQ}u z;7dj<+A^M)$0jelP=!-sEJ2SZl%psgXvRT95RN)lQIXk>sR(nyn2t2&Dmsf^!kz4L zBPI>xvf2^J<(dmOp_P-(%gv@;Tw1~xz3dI71zsLG6uG__t%q(;DkNpZOJ0IQkx0qR z2cO9!*OqFdUYwI2q47bmW6#$9?ZNgNw_$d*sn*VMgCPtBM$hK?I7!CBQLI_yavvu5 zn%Ngu1A$nv08x0X6z{++8AY0XOd8p=S{n_qCJ|}4?fODi&U=GmQYsX}7_$g2yWuR7 zbmazEPvq(~#RHgQwbfEVdKH$Z(AT<34v2%T*H-le7+f~ES6YbGK_$`!*FLOMxZuzx za~ z5px~}No&FXcn`EwkQwf1i{*NyEf{wx)h=iX!^JjaFRUSqiw*Yl+PU>gFS;#BH)dQD zK!2hNTq{C8g`#d98wnMi)^Ix5pwv&UXftIy?AR&av)#fmZw(bag> z7=J`xJ;rKVWF=;7#jLut%Pl5AkCD9U71>C=W?WQNs=#=ZciBX2V*66qO2!R!$-BzX9!XR?pM98Kw zLs2{o2{+LWl=8B7E9h-b(HxyeaX)#!rPe~y)_S%-vN_FM8C^wgU#26F2MesOquRRg zl91&b(`RweTrNs8-2y3?lxG--9(7enjs=CV6gO|S(OQR=wv3Kis;RKmso;^7+~_G{ z0}T@Mm^#_Im=kKB(NbLjxC`6M$OzcfqTS6yY&KCsI87#&0;yc8HruEwn2y!n z5}x&JW9`s~SPb*hE~Wq-AlGMR7Y(XF_M}U1hNmjn6E0=a0Q5^|Pa9cr=|)=A_Oz^& zVMBP5IH(It1cWu;oDc1#Q$XvH74BwRKMZF}4v+ykg?OLjWpv2)B-(p5Kj_jhRzo=B zvsaQV8m6PKmApcf6qXtxXn9bK4H;{Telvs^E}d%DS*PySm?fG`40g%J2w5ONWnHa^ z7wep3+Y`BD?`x&;sHxH=c(HzqJ8-q6DcvPj9g~)1i4jN>>A6n&>hvvkU|eb7v`#|x#(Iv$@M7#44wm|j+YFg=HTq=&% zS_e=xG@X!DtW|g*+%#olOysT>tX^{#=?jX877cDZIA7k(T$1YEK~3nQMl@kJFOxts z&*9MlJd!(Wtj=&>U6vw|YARC8sn20s-00Slv^*ux>2!Z54#J@3(sX&#&==e01OZ;S z+U$}($u=!EG3loa0pbvYjOW~=V@+KfI++L2`j+0oDp5^hp_#C7w-(pZG>hbc&jS#$ zOLeZplQbBph6l~MNNjeTiQVGG?e;|25-s*Fb+;0*mWv)6GF=|Q=u14HmMj?q+|rrT zQj3NL_KJn&c~x&JnUP}_>^>Uo;pY?GF`gyb0@Zy4a0KDv74U3j`2>I!KtA70f6bj* zpTuA@p+u9Vlh!lRJN5B`eq_`f6^1raH?}_bDC4(`oD4g{LM_g$VLRGBeKNzjD3FC0 z7Nq)#%<^RyoUPeTwYh$#WFv!*lsJPop6*~fI*!K&&ERZ0eqZ2%Sz>C11r?pEnP>sT zqx4~^b_JGmIk2(O5ua@OqdpukFNcRf9-jx)D)_g|j8adukB3$4q4)qID@)X-=mzU+ d1p!r(?jj|l?agu-5v(PC+d!1?=uE@^{{cw(AMgMG literal 0 HcmV?d00001 diff --git a/liblua/luac.c b/liblua/luac.c new file mode 100644 index 00000000..5081836d --- /dev/null +++ b/liblua/luac.c @@ -0,0 +1,432 @@ +/* +** $Id: luac.c,v 1.69 2011/11/29 17:46:33 lhf Exp $ +** Lua compiler (saves bytecodes to files; also list bytecodes) +** See Copyright Notice in lua.h +*/ + +#include +#include +#include +#include + +#define luac_c +#define LUA_CORE + +#include "lua.h" +#include "lauxlib.h" + +#include "lobject.h" +#include "lstate.h" +#include "lundump.h" + +static void PrintFunction(const Proto* f, int full); +#define luaU_print PrintFunction + +#define PROGNAME "luac" /* default program name */ +#define OUTPUT PROGNAME ".out" /* default output file */ + +static int listing=0; /* list bytecodes? */ +static int dumping=1; /* dump bytecodes? */ +static int stripping=0; /* strip debug information? */ +static char Output[]={ OUTPUT }; /* default output file name */ +static const char* output=Output; /* actual output file name */ +static const char* progname=PROGNAME; /* actual program name */ + +static void fatal(const char* message) +{ + fprintf(stderr,"%s: %s\n",progname,message); + exit(EXIT_FAILURE); +} + +static void cannot(const char* what) +{ + fprintf(stderr,"%s: cannot %s %s: %s\n",progname,what,output,strerror(errno)); + exit(EXIT_FAILURE); +} + +static void usage(const char* message) +{ + if (*message=='-') + fprintf(stderr,"%s: unrecognized option " LUA_QS "\n",progname,message); + else + fprintf(stderr,"%s: %s\n",progname,message); + fprintf(stderr, + "usage: %s [options] [filenames]\n" + "Available options are:\n" + " -l list (use -l -l for full listing)\n" + " -o name output to file " LUA_QL("name") " (default is \"%s\")\n" + " -p parse only\n" + " -s strip debug information\n" + " -v show version information\n" + " -- stop handling options\n" + " - stop handling options and process stdin\n" + ,progname,Output); + exit(EXIT_FAILURE); +} + +#define IS(s) (strcmp(argv[i],s)==0) + +static int doargs(int argc, char* argv[]) +{ + int i; + int version=0; + if (argv[0]!=NULL && *argv[0]!=0) progname=argv[0]; + for (i=1; itop+(i)) + +static const Proto* combine(lua_State* L, int n) +{ + if (n==1) + return toproto(L,-1); + else + { + Proto* f; + int i=n; + if (lua_load(L,reader,&i,"=(" PROGNAME ")",NULL)!=LUA_OK) fatal(lua_tostring(L,-1)); + f=toproto(L,-1); + for (i=0; ip[i]=toproto(L,i-n-1); + if (f->p[i]->sizeupvalues>0) f->p[i]->upvalues[0].instack=0; + } + f->sizelineinfo=0; + return f; + } +} + +static int writer(lua_State* L, const void* p, size_t size, void* u) +{ + UNUSED(L); + return (fwrite(p,size,1,(FILE*)u)!=1) && (size!=0); +} + +static int pmain(lua_State* L) +{ + int argc=(int)lua_tointeger(L,1); + char** argv=(char**)lua_touserdata(L,2); + const Proto* f; + int i; + if (!lua_checkstack(L,argc)) fatal("too many input files"); + for (i=0; i1); + if (dumping) + { + FILE* D= (output==NULL) ? stdout : fopen(output,"wb"); + if (D==NULL) cannot("open"); + lua_lock(L); + luaU_dump(L,f,writer,D,stripping); + lua_unlock(L); + if (ferror(D)) cannot("write"); + if (fclose(D)) cannot("close"); + } + return 0; +} + +int main(int argc, char* argv[]) +{ + lua_State* L; + int i=doargs(argc,argv); + argc-=i; argv+=i; + if (argc<=0) usage("no input files given"); + L=luaL_newstate(); + if (L==NULL) fatal("cannot create state: not enough memory"); + lua_pushcfunction(L,&pmain); + lua_pushinteger(L,argc); + lua_pushlightuserdata(L,argv); + if (lua_pcall(L,2,0,0)!=LUA_OK) fatal(lua_tostring(L,-1)); + lua_close(L); + return EXIT_SUCCESS; +} + +/* +** $Id: print.c,v 1.68 2011/09/30 10:21:20 lhf Exp $ +** print bytecodes +** See Copyright Notice in lua.h +*/ + +#include +#include + +#define luac_c +#define LUA_CORE + +#include "ldebug.h" +#include "lobject.h" +#include "lopcodes.h" + +#define VOID(p) ((const void*)(p)) + +static void PrintString(const TString* ts) +{ + const char* s=getstr(ts); + size_t i,n=ts->tsv.len; + printf("%c",'"'); + for (i=0; ik[i]; + switch (ttype(o)) + { + case LUA_TNIL: + printf("nil"); + break; + case LUA_TBOOLEAN: + printf(bvalue(o) ? "true" : "false"); + break; + case LUA_TNUMBER: + printf(LUA_NUMBER_FMT,nvalue(o)); + break; + case LUA_TSTRING: + PrintString(rawtsvalue(o)); + break; + default: /* cannot happen */ + printf("? type=%d",ttype(o)); + break; + } +} + +#define UPVALNAME(x) ((f->upvalues[x].name) ? getstr(f->upvalues[x].name) : "-") +#define MYK(x) (-1-(x)) + +static void PrintCode(const Proto* f) +{ + const Instruction* code=f->code; + int pc,n=f->sizecode; + for (pc=0; pc0) printf("[%d]\t",line); else printf("[-]\t"); + printf("%-9s\t",luaP_opnames[o]); + switch (getOpMode(o)) + { + case iABC: + printf("%d",a); + if (getBMode(o)!=OpArgN) printf(" %d",ISK(b) ? (MYK(INDEXK(b))) : b); + if (getCMode(o)!=OpArgN) printf(" %d",ISK(c) ? (MYK(INDEXK(c))) : c); + break; + case iABx: + printf("%d",a); + if (getBMode(o)==OpArgK) printf(" %d",MYK(bx)); + if (getBMode(o)==OpArgU) printf(" %d",bx); + break; + case iAsBx: + printf("%d %d",a,sbx); + break; + case iAx: + printf("%d",MYK(ax)); + break; + } + switch (o) + { + case OP_LOADK: + printf("\t; "); PrintConstant(f,bx); + break; + case OP_GETUPVAL: + case OP_SETUPVAL: + printf("\t; %s",UPVALNAME(b)); + break; + case OP_GETTABUP: + printf("\t; %s",UPVALNAME(b)); + if (ISK(c)) { printf(" "); PrintConstant(f,INDEXK(c)); } + break; + case OP_SETTABUP: + printf("\t; %s",UPVALNAME(a)); + if (ISK(b)) { printf(" "); PrintConstant(f,INDEXK(b)); } + if (ISK(c)) { printf(" "); PrintConstant(f,INDEXK(c)); } + break; + case OP_GETTABLE: + case OP_SELF: + if (ISK(c)) { printf("\t; "); PrintConstant(f,INDEXK(c)); } + break; + case OP_SETTABLE: + case OP_ADD: + case OP_SUB: + case OP_MUL: + case OP_DIV: + case OP_POW: + case OP_EQ: + case OP_LT: + case OP_LE: + if (ISK(b) || ISK(c)) + { + printf("\t; "); + if (ISK(b)) PrintConstant(f,INDEXK(b)); else printf("-"); + printf(" "); + if (ISK(c)) PrintConstant(f,INDEXK(c)); else printf("-"); + } + break; + case OP_JMP: + case OP_FORLOOP: + case OP_FORPREP: + case OP_TFORLOOP: + printf("\t; to %d",sbx+pc+2); + break; + case OP_CLOSURE: + printf("\t; %p",VOID(f->p[bx])); + break; + case OP_SETLIST: + if (c==0) printf("\t; %d",(int)code[++pc]); else printf("\t; %d",c); + break; + case OP_EXTRAARG: + printf("\t; "); PrintConstant(f,ax); + break; + default: + break; + } + printf("\n"); + } +} + +#define SS(x) ((x==1)?"":"s") +#define S(x) (int)(x),SS(x) + +static void PrintHeader(const Proto* f) +{ + const char* s=f->source ? getstr(f->source) : "=?"; + if (*s=='@' || *s=='=') + s++; + else if (*s==LUA_SIGNATURE[0]) + s="(bstring)"; + else + s="(string)"; + printf("\n%s <%s:%d,%d> (%d instruction%s at %p)\n", + (f->linedefined==0)?"main":"function",s, + f->linedefined,f->lastlinedefined, + S(f->sizecode),VOID(f)); + printf("%d%s param%s, %d slot%s, %d upvalue%s, ", + (int)(f->numparams),f->is_vararg?"+":"",SS(f->numparams), + S(f->maxstacksize),S(f->sizeupvalues)); + printf("%d local%s, %d constant%s, %d function%s\n", + S(f->sizelocvars),S(f->sizek),S(f->sizep)); +} + +static void PrintDebug(const Proto* f) +{ + int i,n; + n=f->sizek; + printf("constants (%d) for %p:\n",n,VOID(f)); + for (i=0; isizelocvars; + printf("locals (%d) for %p:\n",n,VOID(f)); + for (i=0; ilocvars[i].varname),f->locvars[i].startpc+1,f->locvars[i].endpc+1); + } + n=f->sizeupvalues; + printf("upvalues (%d) for %p:\n",n,VOID(f)); + for (i=0; iupvalues[i].instack,f->upvalues[i].idx); + } +} + +static void PrintFunction(const Proto* f, int full) +{ + int i,n=f->sizep; + PrintHeader(f); + PrintCode(f); + if (full) PrintDebug(f); + for (i=0; ip[i],full); +} diff --git a/liblua/luaconf.h b/liblua/luaconf.h new file mode 100644 index 00000000..df802c95 --- /dev/null +++ b/liblua/luaconf.h @@ -0,0 +1,551 @@ +/* +** $Id: luaconf.h,v 1.176 2013/03/16 21:10:18 roberto Exp $ +** Configuration file for Lua +** See Copyright Notice in lua.h +*/ + + +#ifndef lconfig_h +#define lconfig_h + +#include +#include + + +/* +** ================================================================== +** Search for "@@" to find all configurable definitions. +** =================================================================== +*/ + + +/* +@@ LUA_ANSI controls the use of non-ansi features. +** CHANGE it (define it) if you want Lua to avoid the use of any +** non-ansi feature or library. +*/ +#if !defined(LUA_ANSI) && defined(__STRICT_ANSI__) +#define LUA_ANSI +#endif + + +#if !defined(LUA_ANSI) && defined(_WIN32) && !defined(_WIN32_WCE) +#define LUA_WIN /* enable goodies for regular Windows platforms */ +#endif + +#if defined(LUA_WIN) +#define LUA_DL_DLL +#define LUA_USE_AFORMAT /* assume 'printf' handles 'aA' specifiers */ +#endif + + + +#if defined(LUA_USE_LINUX) +#define LUA_USE_POSIX +#define LUA_USE_DLOPEN /* needs an extra library: -ldl */ +#define LUA_USE_READLINE /* needs some extra libraries */ +#define LUA_USE_STRTODHEX /* assume 'strtod' handles hex formats */ +#define LUA_USE_AFORMAT /* assume 'printf' handles 'aA' specifiers */ +#define LUA_USE_LONGLONG /* assume support for long long */ +#endif + +#if defined(LUA_USE_MACOSX) +#define LUA_USE_POSIX +#define LUA_USE_DLOPEN /* does not need -ldl */ +#define LUA_USE_READLINE /* needs an extra library: -lreadline */ +#define LUA_USE_STRTODHEX /* assume 'strtod' handles hex formats */ +#define LUA_USE_AFORMAT /* assume 'printf' handles 'aA' specifiers */ +#define LUA_USE_LONGLONG /* assume support for long long */ +#endif + + + +/* +@@ LUA_USE_POSIX includes all functionality listed as X/Open System +@* Interfaces Extension (XSI). +** CHANGE it (define it) if your system is XSI compatible. +*/ +#if defined(LUA_USE_POSIX) +#define LUA_USE_MKSTEMP +#define LUA_USE_ISATTY +#define LUA_USE_POPEN +#define LUA_USE_ULONGJMP +#define LUA_USE_GMTIME_R +#endif + + + +/* +@@ LUA_PATH_DEFAULT is the default path that Lua uses to look for +@* Lua libraries. +@@ LUA_CPATH_DEFAULT is the default path that Lua uses to look for +@* C libraries. +** CHANGE them if your machine has a non-conventional directory +** hierarchy or if you want to install your libraries in +** non-conventional directories. +*/ +#if defined(_WIN32) /* { */ +/* +** In Windows, any exclamation mark ('!') in the path is replaced by the +** path of the directory of the executable file of the current process. +*/ +#define LUA_LDIR "!\\lua\\" +#define LUA_CDIR "!\\" +#define LUA_PATH_DEFAULT \ + LUA_LDIR"?.lua;" LUA_LDIR"?\\init.lua;" \ + LUA_CDIR"?.lua;" LUA_CDIR"?\\init.lua;" ".\\?.lua" +#define LUA_CPATH_DEFAULT \ + LUA_CDIR"?.dll;" LUA_CDIR"loadall.dll;" ".\\?.dll" + +#else /* }{ */ + +#define LUA_VDIR LUA_VERSION_MAJOR "." LUA_VERSION_MINOR "/" +#define LUA_ROOT "/usr/local/" +#define LUA_LDIR LUA_ROOT "share/lua/" LUA_VDIR +#define LUA_CDIR LUA_ROOT "lib/lua/" LUA_VDIR +#define LUA_PATH_DEFAULT \ + LUA_LDIR"?.lua;" LUA_LDIR"?/init.lua;" \ + LUA_CDIR"?.lua;" LUA_CDIR"?/init.lua;" "./?.lua" +#define LUA_CPATH_DEFAULT \ + LUA_CDIR"?.so;" LUA_CDIR"loadall.so;" "./?.so" +#endif /* } */ + + +/* +@@ LUA_DIRSEP is the directory separator (for submodules). +** CHANGE it if your machine does not use "/" as the directory separator +** and is not Windows. (On Windows Lua automatically uses "\".) +*/ +#if defined(_WIN32) +#define LUA_DIRSEP "\\" +#else +#define LUA_DIRSEP "/" +#endif + + +/* +@@ LUA_ENV is the name of the variable that holds the current +@@ environment, used to access global names. +** CHANGE it if you do not like this name. +*/ +#define LUA_ENV "_ENV" + + +/* +@@ LUA_API is a mark for all core API functions. +@@ LUALIB_API is a mark for all auxiliary library functions. +@@ LUAMOD_API is a mark for all standard library opening functions. +** CHANGE them if you need to define those functions in some special way. +** For instance, if you want to create one Windows DLL with the core and +** the libraries, you may want to use the following definition (define +** LUA_BUILD_AS_DLL to get it). +*/ +#if defined(LUA_BUILD_AS_DLL) /* { */ + +#if defined(LUA_CORE) || defined(LUA_LIB) /* { */ +#define LUA_API __declspec(dllexport) +#else /* }{ */ +#define LUA_API __declspec(dllimport) +#endif /* } */ + +#else /* }{ */ + +#define LUA_API extern + +#endif /* } */ + + +/* more often than not the libs go together with the core */ +#define LUALIB_API LUA_API +#define LUAMOD_API LUALIB_API + + +/* +@@ LUAI_FUNC is a mark for all extern functions that are not to be +@* exported to outside modules. +@@ LUAI_DDEF and LUAI_DDEC are marks for all extern (const) variables +@* that are not to be exported to outside modules (LUAI_DDEF for +@* definitions and LUAI_DDEC for declarations). +** CHANGE them if you need to mark them in some special way. Elf/gcc +** (versions 3.2 and later) mark them as "hidden" to optimize access +** when Lua is compiled as a shared library. Not all elf targets support +** this attribute. Unfortunately, gcc does not offer a way to check +** whether the target offers that support, and those without support +** give a warning about it. To avoid these warnings, change to the +** default definition. +*/ +#if defined(__GNUC__) && ((__GNUC__*100 + __GNUC_MINOR__) >= 302) && \ + defined(__ELF__) /* { */ +#define LUAI_FUNC __attribute__((visibility("hidden"))) extern +#define LUAI_DDEC LUAI_FUNC +#define LUAI_DDEF /* empty */ + +#else /* }{ */ +#define LUAI_FUNC extern +#define LUAI_DDEC extern +#define LUAI_DDEF /* empty */ +#endif /* } */ + + + +/* +@@ LUA_QL describes how error messages quote program elements. +** CHANGE it if you want a different appearance. +*/ +#define LUA_QL(x) "'" x "'" +#define LUA_QS LUA_QL("%s") + + +/* +@@ LUA_IDSIZE gives the maximum size for the description of the source +@* of a function in debug information. +** CHANGE it if you want a different size. +*/ +#define LUA_IDSIZE 60 + + +/* +@@ luai_writestring/luai_writeline define how 'print' prints its results. +** They are only used in libraries and the stand-alone program. (The #if +** avoids including 'stdio.h' everywhere.) +*/ +#if defined(LUA_LIB) || defined(lua_c) +#include +#define luai_writestring(s,l) fwrite((s), sizeof(char), (l), stdout) +#define luai_writeline() (luai_writestring("\n", 1), fflush(stdout)) +#endif + +/* +@@ luai_writestringerror defines how to print error messages. +** (A format string with one argument is enough for Lua...) +*/ +#define luai_writestringerror(s,p) \ + (fprintf(stderr, (s), (p)), fflush(stderr)) + + +/* +@@ LUAI_MAXSHORTLEN is the maximum length for short strings, that is, +** strings that are internalized. (Cannot be smaller than reserved words +** or tags for metamethods, as these strings must be internalized; +** #("function") = 8, #("__newindex") = 10.) +*/ +#define LUAI_MAXSHORTLEN 40 + + + +/* +** {================================================================== +** Compatibility with previous versions +** =================================================================== +*/ + +/* +@@ LUA_COMPAT_ALL controls all compatibility options. +** You can define it to get all options, or change specific options +** to fit your specific needs. +*/ +#if defined(LUA_COMPAT_ALL) /* { */ + +/* +@@ LUA_COMPAT_UNPACK controls the presence of global 'unpack'. +** You can replace it with 'table.unpack'. +*/ +#define LUA_COMPAT_UNPACK + +/* +@@ LUA_COMPAT_LOADERS controls the presence of table 'package.loaders'. +** You can replace it with 'package.searchers'. +*/ +#define LUA_COMPAT_LOADERS + +/* +@@ macro 'lua_cpcall' emulates deprecated function lua_cpcall. +** You can call your C function directly (with light C functions). +*/ +#define lua_cpcall(L,f,u) \ + (lua_pushcfunction(L, (f)), \ + lua_pushlightuserdata(L,(u)), \ + lua_pcall(L,1,0,0)) + + +/* +@@ LUA_COMPAT_LOG10 defines the function 'log10' in the math library. +** You can rewrite 'log10(x)' as 'log(x, 10)'. +*/ +#define LUA_COMPAT_LOG10 + +/* +@@ LUA_COMPAT_LOADSTRING defines the function 'loadstring' in the base +** library. You can rewrite 'loadstring(s)' as 'load(s)'. +*/ +#define LUA_COMPAT_LOADSTRING + +/* +@@ LUA_COMPAT_MAXN defines the function 'maxn' in the table library. +*/ +#define LUA_COMPAT_MAXN + +/* +@@ The following macros supply trivial compatibility for some +** changes in the API. The macros themselves document how to +** change your code to avoid using them. +*/ +#define lua_strlen(L,i) lua_rawlen(L, (i)) + +#define lua_objlen(L,i) lua_rawlen(L, (i)) + +#define lua_equal(L,idx1,idx2) lua_compare(L,(idx1),(idx2),LUA_OPEQ) +#define lua_lessthan(L,idx1,idx2) lua_compare(L,(idx1),(idx2),LUA_OPLT) + +/* +@@ LUA_COMPAT_MODULE controls compatibility with previous +** module functions 'module' (Lua) and 'luaL_register' (C). +*/ +#define LUA_COMPAT_MODULE + +#endif /* } */ + +/* }================================================================== */ + + + +/* +@@ LUAI_BITSINT defines the number of bits in an int. +** CHANGE here if Lua cannot automatically detect the number of bits of +** your machine. Probably you do not need to change this. +*/ +/* avoid overflows in comparison */ +#if INT_MAX-20 < 32760 /* { */ +#define LUAI_BITSINT 16 +#elif INT_MAX > 2147483640L /* }{ */ +/* int has at least 32 bits */ +#define LUAI_BITSINT 32 +#else /* }{ */ +#error "you must define LUA_BITSINT with number of bits in an integer" +#endif /* } */ + + +/* +@@ LUA_INT32 is an signed integer with exactly 32 bits. +@@ LUAI_UMEM is an unsigned integer big enough to count the total +@* memory used by Lua. +@@ LUAI_MEM is a signed integer big enough to count the total memory +@* used by Lua. +** CHANGE here if for some weird reason the default definitions are not +** good enough for your machine. Probably you do not need to change +** this. +*/ +#if LUAI_BITSINT >= 32 /* { */ +#define LUA_INT32 int +#define LUAI_UMEM size_t +#define LUAI_MEM ptrdiff_t +#else /* }{ */ +/* 16-bit ints */ +#define LUA_INT32 long +#define LUAI_UMEM unsigned long +#define LUAI_MEM long +#endif /* } */ + + +/* +@@ LUAI_MAXSTACK limits the size of the Lua stack. +** CHANGE it if you need a different limit. This limit is arbitrary; +** its only purpose is to stop Lua to consume unlimited stack +** space (and to reserve some numbers for pseudo-indices). +*/ +#if LUAI_BITSINT >= 32 +#define LUAI_MAXSTACK 1000000 +#else +#define LUAI_MAXSTACK 15000 +#endif + +/* reserve some space for error handling */ +#define LUAI_FIRSTPSEUDOIDX (-LUAI_MAXSTACK - 1000) + + + + +/* +@@ LUAL_BUFFERSIZE is the buffer size used by the lauxlib buffer system. +** CHANGE it if it uses too much C-stack space. +*/ +#define LUAL_BUFFERSIZE BUFSIZ + + + + +/* +** {================================================================== +@@ LUA_NUMBER is the type of numbers in Lua. +** CHANGE the following definitions only if you want to build Lua +** with a number type different from double. You may also need to +** change lua_number2int & lua_number2integer. +** =================================================================== +*/ + +#define LUA_NUMBER_DOUBLE +#define LUA_NUMBER double + +/* +@@ LUAI_UACNUMBER is the result of an 'usual argument conversion' +@* over a number. +*/ +#define LUAI_UACNUMBER double + + +/* +@@ LUA_NUMBER_SCAN is the format for reading numbers. +@@ LUA_NUMBER_FMT is the format for writing numbers. +@@ lua_number2str converts a number to a string. +@@ LUAI_MAXNUMBER2STR is maximum size of previous conversion. +*/ +#define LUA_NUMBER_SCAN "%lf" +#define LUA_NUMBER_FMT "%.14g" +#define lua_number2str(s,n) sprintf((s), LUA_NUMBER_FMT, (n)) +#define LUAI_MAXNUMBER2STR 32 /* 16 digits, sign, point, and \0 */ + + +/* +@@ l_mathop allows the addition of an 'l' or 'f' to all math operations +*/ +#define l_mathop(x) (x) + + +/* +@@ lua_str2number converts a decimal numeric string to a number. +@@ lua_strx2number converts an hexadecimal numeric string to a number. +** In C99, 'strtod' does both conversions. C89, however, has no function +** to convert floating hexadecimal strings to numbers. For these +** systems, you can leave 'lua_strx2number' undefined and Lua will +** provide its own implementation. +*/ +#define lua_str2number(s,p) strtod((s), (p)) + +#if defined(LUA_USE_STRTODHEX) +#define lua_strx2number(s,p) strtod((s), (p)) +#endif + + +/* +@@ The luai_num* macros define the primitive operations over numbers. +*/ + +/* the following operations need the math library */ +#if defined(lobject_c) || defined(lvm_c) +#include +#define luai_nummod(L,a,b) ((a) - l_mathop(floor)((a)/(b))*(b)) +#define luai_numpow(L,a,b) (l_mathop(pow)(a,b)) +#endif + +/* these are quite standard operations */ +#if defined(LUA_CORE) +#define luai_numadd(L,a,b) ((a)+(b)) +#define luai_numsub(L,a,b) ((a)-(b)) +#define luai_nummul(L,a,b) ((a)*(b)) +#define luai_numdiv(L,a,b) ((a)/(b)) +#define luai_numunm(L,a) (-(a)) +#define luai_numeq(a,b) ((a)==(b)) +#define luai_numlt(L,a,b) ((a)<(b)) +#define luai_numle(L,a,b) ((a)<=(b)) +#define luai_numisnan(L,a) (!luai_numeq((a), (a))) +#endif + + + +/* +@@ LUA_INTEGER is the integral type used by lua_pushinteger/lua_tointeger. +** CHANGE that if ptrdiff_t is not adequate on your machine. (On most +** machines, ptrdiff_t gives a good choice between int or long.) +*/ +#define LUA_INTEGER ptrdiff_t + +/* +@@ LUA_UNSIGNED is the integral type used by lua_pushunsigned/lua_tounsigned. +** It must have at least 32 bits. +*/ +#define LUA_UNSIGNED unsigned LUA_INT32 + + + +/* +** Some tricks with doubles +*/ + +#if defined(LUA_NUMBER_DOUBLE) && !defined(LUA_ANSI) /* { */ +/* +** The next definitions activate some tricks to speed up the +** conversion from doubles to integer types, mainly to LUA_UNSIGNED. +** +@@ LUA_MSASMTRICK uses Microsoft assembler to avoid clashes with a +** DirectX idiosyncrasy. +** +@@ LUA_IEEE754TRICK uses a trick that should work on any machine +** using IEEE754 with a 32-bit integer type. +** +@@ LUA_IEEELL extends the trick to LUA_INTEGER; should only be +** defined when LUA_INTEGER is a 32-bit integer. +** +@@ LUA_IEEEENDIAN is the endianness of doubles in your machine +** (0 for little endian, 1 for big endian); if not defined, Lua will +** check it dynamically for LUA_IEEE754TRICK (but not for LUA_NANTRICK). +** +@@ LUA_NANTRICK controls the use of a trick to pack all types into +** a single double value, using NaN values to represent non-number +** values. The trick only works on 32-bit machines (ints and pointers +** are 32-bit values) with numbers represented as IEEE 754-2008 doubles +** with conventional endianess (12345678 or 87654321), in CPUs that do +** not produce signaling NaN values (all NaNs are quiet). +*/ + +/* Microsoft compiler on a Pentium (32 bit) ? */ +#if defined(LUA_WIN) && defined(_MSC_VER) && defined(_M_IX86) /* { */ + +#define LUA_MSASMTRICK +#define LUA_IEEEENDIAN 0 +#define LUA_NANTRICK + + +/* pentium 32 bits? */ +#elif defined(__i386__) || defined(__i386) || defined(__X86__) /* }{ */ + +#define LUA_IEEE754TRICK +#define LUA_IEEELL +#define LUA_IEEEENDIAN 0 +#define LUA_NANTRICK + +/* pentium 64 bits? */ +#elif defined(__x86_64) /* }{ */ + +#define LUA_IEEE754TRICK +#define LUA_IEEEENDIAN 0 + +#elif defined(__POWERPC__) || defined(__ppc__) /* }{ */ + +#define LUA_IEEE754TRICK +#define LUA_IEEEENDIAN 1 + +#else /* }{ */ + +/* assume IEEE754 and a 32-bit integer type */ +#define LUA_IEEE754TRICK + +#endif /* } */ + +#endif /* } */ + +/* }================================================================== */ + + + + +/* =================================================================== */ + +/* +** Local configuration. You can use this space to add your redefinitions +** without modifying the main part of the file. +*/ + + + +#endif + diff --git a/liblua/lualib.h b/liblua/lualib.h new file mode 100644 index 00000000..9fd126bf --- /dev/null +++ b/liblua/lualib.h @@ -0,0 +1,55 @@ +/* +** $Id: lualib.h,v 1.43 2011/12/08 12:11:37 roberto Exp $ +** Lua standard libraries +** See Copyright Notice in lua.h +*/ + + +#ifndef lualib_h +#define lualib_h + +#include "lua.h" + + + +LUAMOD_API int (luaopen_base) (lua_State *L); + +#define LUA_COLIBNAME "coroutine" +LUAMOD_API int (luaopen_coroutine) (lua_State *L); + +#define LUA_TABLIBNAME "table" +LUAMOD_API int (luaopen_table) (lua_State *L); + +#define LUA_IOLIBNAME "io" +LUAMOD_API int (luaopen_io) (lua_State *L); + +#define LUA_OSLIBNAME "os" +LUAMOD_API int (luaopen_os) (lua_State *L); + +#define LUA_STRLIBNAME "string" +LUAMOD_API int (luaopen_string) (lua_State *L); + +#define LUA_BITLIBNAME "bit32" +LUAMOD_API int (luaopen_bit32) (lua_State *L); + +#define LUA_MATHLIBNAME "math" +LUAMOD_API int (luaopen_math) (lua_State *L); + +#define LUA_DBLIBNAME "debug" +LUAMOD_API int (luaopen_debug) (lua_State *L); + +#define LUA_LOADLIBNAME "package" +LUAMOD_API int (luaopen_package) (lua_State *L); + + +/* open all previous libraries */ +LUALIB_API void (luaL_openlibs) (lua_State *L); + + + +#if !defined(lua_assert) +#define lua_assert(x) ((void)0) +#endif + + +#endif diff --git a/liblua/lundump.c b/liblua/lundump.c new file mode 100644 index 00000000..54de011a --- /dev/null +++ b/liblua/lundump.c @@ -0,0 +1,258 @@ +/* +** $Id: lundump.c,v 2.22 2012/05/08 13:53:33 roberto Exp $ +** load precompiled Lua chunks +** See Copyright Notice in lua.h +*/ + +#include + +#define lundump_c +#define LUA_CORE + +#include "lua.h" + +#include "ldebug.h" +#include "ldo.h" +#include "lfunc.h" +#include "lmem.h" +#include "lobject.h" +#include "lstring.h" +#include "lundump.h" +#include "lzio.h" + +typedef struct { + lua_State* L; + ZIO* Z; + Mbuffer* b; + const char* name; +} LoadState; + +static l_noret error(LoadState* S, const char* why) +{ + luaO_pushfstring(S->L,"%s: %s precompiled chunk",S->name,why); + luaD_throw(S->L,LUA_ERRSYNTAX); +} + +#define LoadMem(S,b,n,size) LoadBlock(S,b,(n)*(size)) +#define LoadByte(S) (lu_byte)LoadChar(S) +#define LoadVar(S,x) LoadMem(S,&x,1,sizeof(x)) +#define LoadVector(S,b,n,size) LoadMem(S,b,n,size) + +#if !defined(luai_verifycode) +#define luai_verifycode(L,b,f) /* empty */ +#endif + +static void LoadBlock(LoadState* S, void* b, size_t size) +{ + if (luaZ_read(S->Z,b,size)!=0) error(S,"truncated"); +} + +static int LoadChar(LoadState* S) +{ + char x; + LoadVar(S,x); + return x; +} + +static int LoadInt(LoadState* S) +{ + int x; + LoadVar(S,x); + if (x<0) error(S,"corrupted"); + return x; +} + +static lua_Number LoadNumber(LoadState* S) +{ + lua_Number x; + LoadVar(S,x); + return x; +} + +static TString* LoadString(LoadState* S) +{ + size_t size; + LoadVar(S,size); + if (size==0) + return NULL; + else + { + char* s=luaZ_openspace(S->L,S->b,size); + LoadBlock(S,s,size*sizeof(char)); + return luaS_newlstr(S->L,s,size-1); /* remove trailing '\0' */ + } +} + +static void LoadCode(LoadState* S, Proto* f) +{ + int n=LoadInt(S); + f->code=luaM_newvector(S->L,n,Instruction); + f->sizecode=n; + LoadVector(S,f->code,n,sizeof(Instruction)); +} + +static void LoadFunction(LoadState* S, Proto* f); + +static void LoadConstants(LoadState* S, Proto* f) +{ + int i,n; + n=LoadInt(S); + f->k=luaM_newvector(S->L,n,TValue); + f->sizek=n; + for (i=0; ik[i]); + for (i=0; ik[i]; + int t=LoadChar(S); + switch (t) + { + case LUA_TNIL: + setnilvalue(o); + break; + case LUA_TBOOLEAN: + setbvalue(o,LoadChar(S)); + break; + case LUA_TNUMBER: + setnvalue(o,LoadNumber(S)); + break; + case LUA_TSTRING: + setsvalue2n(S->L,o,LoadString(S)); + break; + default: lua_assert(0); + } + } + n=LoadInt(S); + f->p=luaM_newvector(S->L,n,Proto*); + f->sizep=n; + for (i=0; ip[i]=NULL; + for (i=0; ip[i]=luaF_newproto(S->L); + LoadFunction(S,f->p[i]); + } +} + +static void LoadUpvalues(LoadState* S, Proto* f) +{ + int i,n; + n=LoadInt(S); + f->upvalues=luaM_newvector(S->L,n,Upvaldesc); + f->sizeupvalues=n; + for (i=0; iupvalues[i].name=NULL; + for (i=0; iupvalues[i].instack=LoadByte(S); + f->upvalues[i].idx=LoadByte(S); + } +} + +static void LoadDebug(LoadState* S, Proto* f) +{ + int i,n; + f->source=LoadString(S); + n=LoadInt(S); + f->lineinfo=luaM_newvector(S->L,n,int); + f->sizelineinfo=n; + LoadVector(S,f->lineinfo,n,sizeof(int)); + n=LoadInt(S); + f->locvars=luaM_newvector(S->L,n,LocVar); + f->sizelocvars=n; + for (i=0; ilocvars[i].varname=NULL; + for (i=0; ilocvars[i].varname=LoadString(S); + f->locvars[i].startpc=LoadInt(S); + f->locvars[i].endpc=LoadInt(S); + } + n=LoadInt(S); + for (i=0; iupvalues[i].name=LoadString(S); +} + +static void LoadFunction(LoadState* S, Proto* f) +{ + f->linedefined=LoadInt(S); + f->lastlinedefined=LoadInt(S); + f->numparams=LoadByte(S); + f->is_vararg=LoadByte(S); + f->maxstacksize=LoadByte(S); + LoadCode(S,f); + LoadConstants(S,f); + LoadUpvalues(S,f); + LoadDebug(S,f); +} + +/* the code below must be consistent with the code in luaU_header */ +#define N0 LUAC_HEADERSIZE +#define N1 (sizeof(LUA_SIGNATURE)-sizeof(char)) +#define N2 N1+2 +#define N3 N2+6 + +static void LoadHeader(LoadState* S) +{ + lu_byte h[LUAC_HEADERSIZE]; + lu_byte s[LUAC_HEADERSIZE]; + luaU_header(h); + memcpy(s,h,sizeof(char)); /* first char already read */ + LoadBlock(S,s+sizeof(char),LUAC_HEADERSIZE-sizeof(char)); + if (memcmp(h,s,N0)==0) return; + if (memcmp(h,s,N1)!=0) error(S,"not a"); + if (memcmp(h,s,N2)!=0) error(S,"version mismatch in"); + if (memcmp(h,s,N3)!=0) error(S,"incompatible"); else error(S,"corrupted"); +} + +/* +** load precompiled chunk +*/ +Closure* luaU_undump (lua_State* L, ZIO* Z, Mbuffer* buff, const char* name) +{ + LoadState S; + Closure* cl; + if (*name=='@' || *name=='=') + S.name=name+1; + else if (*name==LUA_SIGNATURE[0]) + S.name="binary string"; + else + S.name=name; + S.L=L; + S.Z=Z; + S.b=buff; + LoadHeader(&S); + cl=luaF_newLclosure(L,1); + setclLvalue(L,L->top,cl); incr_top(L); + cl->l.p=luaF_newproto(L); + LoadFunction(&S,cl->l.p); + if (cl->l.p->sizeupvalues != 1) + { + Proto* p=cl->l.p; + cl=luaF_newLclosure(L,cl->l.p->sizeupvalues); + cl->l.p=p; + setclLvalue(L,L->top-1,cl); + } + luai_verifycode(L,buff,cl->l.p); + return cl; +} + +#define MYINT(s) (s[0]-'0') +#define VERSION MYINT(LUA_VERSION_MAJOR)*16+MYINT(LUA_VERSION_MINOR) +#define FORMAT 0 /* this is the official format */ + +/* +* make header for precompiled chunks +* if you change the code below be sure to update LoadHeader and FORMAT above +* and LUAC_HEADERSIZE in lundump.h +*/ +void luaU_header (lu_byte* h) +{ + int x=1; + memcpy(h,LUA_SIGNATURE,sizeof(LUA_SIGNATURE)-sizeof(char)); + h+=sizeof(LUA_SIGNATURE)-sizeof(char); + *h++=cast_byte(VERSION); + *h++=cast_byte(FORMAT); + *h++=cast_byte(*(char*)&x); /* endianness */ + *h++=cast_byte(sizeof(int)); + *h++=cast_byte(sizeof(size_t)); + *h++=cast_byte(sizeof(Instruction)); + *h++=cast_byte(sizeof(lua_Number)); + *h++=cast_byte(((lua_Number)0.5)==0); /* is lua_Number integral? */ + memcpy(h,LUAC_TAIL,sizeof(LUAC_TAIL)-sizeof(char)); +} diff --git a/liblua/lundump.h b/liblua/lundump.h new file mode 100644 index 00000000..2b8accec --- /dev/null +++ b/liblua/lundump.h @@ -0,0 +1,28 @@ +/* +** $Id: lundump.h,v 1.39 2012/05/08 13:53:33 roberto Exp $ +** load precompiled Lua chunks +** See Copyright Notice in lua.h +*/ + +#ifndef lundump_h +#define lundump_h + +#include "lobject.h" +#include "lzio.h" + +/* load one chunk; from lundump.c */ +LUAI_FUNC Closure* luaU_undump (lua_State* L, ZIO* Z, Mbuffer* buff, const char* name); + +/* make header; from lundump.c */ +LUAI_FUNC void luaU_header (lu_byte* h); + +/* dump one chunk; from ldump.c */ +LUAI_FUNC int luaU_dump (lua_State* L, const Proto* f, lua_Writer w, void* data, int strip); + +/* data to catch conversion errors */ +#define LUAC_TAIL "\x19\x93\r\n\x1a\n" + +/* size in bytes of header of binary files */ +#define LUAC_HEADERSIZE (sizeof(LUA_SIGNATURE)-sizeof(char)+2+6+sizeof(LUAC_TAIL)-sizeof(char)) + +#endif diff --git a/liblua/lvm.c b/liblua/lvm.c new file mode 100644 index 00000000..657d5c45 --- /dev/null +++ b/liblua/lvm.c @@ -0,0 +1,867 @@ +/* +** $Id: lvm.c,v 2.155 2013/03/16 21:10:18 roberto Exp $ +** Lua virtual machine +** See Copyright Notice in lua.h +*/ + + +#include +#include +#include + +#define lvm_c +#define LUA_CORE + +#include "lua.h" + +#include "ldebug.h" +#include "ldo.h" +#include "lfunc.h" +#include "lgc.h" +#include "lobject.h" +#include "lopcodes.h" +#include "lstate.h" +#include "lstring.h" +#include "ltable.h" +#include "ltm.h" +#include "lvm.h" + + + +/* limit for table tag-method chains (to avoid loops) */ +#define MAXTAGLOOP 100 + + +const TValue *luaV_tonumber (const TValue *obj, TValue *n) { + lua_Number num; + if (ttisnumber(obj)) return obj; + if (ttisstring(obj) && luaO_str2d(svalue(obj), tsvalue(obj)->len, &num)) { + setnvalue(n, num); + return n; + } + else + return NULL; +} + + +int luaV_tostring (lua_State *L, StkId obj) { + if (!ttisnumber(obj)) + return 0; + else { + char s[LUAI_MAXNUMBER2STR]; + lua_Number n = nvalue(obj); + int l = lua_number2str(s, n); + setsvalue2s(L, obj, luaS_newlstr(L, s, l)); + return 1; + } +} + + +static void traceexec (lua_State *L) { + CallInfo *ci = L->ci; + lu_byte mask = L->hookmask; + int counthook = ((mask & LUA_MASKCOUNT) && L->hookcount == 0); + if (counthook) + resethookcount(L); /* reset count */ + if (ci->callstatus & CIST_HOOKYIELD) { /* called hook last time? */ + ci->callstatus &= ~CIST_HOOKYIELD; /* erase mark */ + return; /* do not call hook again (VM yielded, so it did not move) */ + } + if (counthook) + luaD_hook(L, LUA_HOOKCOUNT, -1); /* call count hook */ + if (mask & LUA_MASKLINE) { + Proto *p = ci_func(ci)->p; + int npc = pcRel(ci->u.l.savedpc, p); + int newline = getfuncline(p, npc); + if (npc == 0 || /* call linehook when enter a new function, */ + ci->u.l.savedpc <= L->oldpc || /* when jump back (loop), or when */ + newline != getfuncline(p, pcRel(L->oldpc, p))) /* enter a new line */ + luaD_hook(L, LUA_HOOKLINE, newline); /* call line hook */ + } + L->oldpc = ci->u.l.savedpc; + if (L->status == LUA_YIELD) { /* did hook yield? */ + if (counthook) + L->hookcount = 1; /* undo decrement to zero */ + ci->u.l.savedpc--; /* undo increment (resume will increment it again) */ + ci->callstatus |= CIST_HOOKYIELD; /* mark that it yielded */ + ci->func = L->top - 1; /* protect stack below results */ + luaD_throw(L, LUA_YIELD); + } +} + + +static void callTM (lua_State *L, const TValue *f, const TValue *p1, + const TValue *p2, TValue *p3, int hasres) { + ptrdiff_t result = savestack(L, p3); + setobj2s(L, L->top++, f); /* push function */ + setobj2s(L, L->top++, p1); /* 1st argument */ + setobj2s(L, L->top++, p2); /* 2nd argument */ + if (!hasres) /* no result? 'p3' is third argument */ + setobj2s(L, L->top++, p3); /* 3rd argument */ + /* metamethod may yield only when called from Lua code */ + luaD_call(L, L->top - (4 - hasres), hasres, isLua(L->ci)); + if (hasres) { /* if has result, move it to its place */ + p3 = restorestack(L, result); + setobjs2s(L, p3, --L->top); + } +} + + +void luaV_gettable (lua_State *L, const TValue *t, TValue *key, StkId val) { + int loop; + for (loop = 0; loop < MAXTAGLOOP; loop++) { + const TValue *tm; + if (ttistable(t)) { /* `t' is a table? */ + Table *h = hvalue(t); + const TValue *res = luaH_get(h, key); /* do a primitive get */ + if (!ttisnil(res) || /* result is not nil? */ + (tm = fasttm(L, h->metatable, TM_INDEX)) == NULL) { /* or no TM? */ + setobj2s(L, val, res); + return; + } + /* else will try the tag method */ + } + else if (ttisnil(tm = luaT_gettmbyobj(L, t, TM_INDEX))) + luaG_typeerror(L, t, "index"); + if (ttisfunction(tm)) { + callTM(L, tm, t, key, val, 1); + return; + } + t = tm; /* else repeat with 'tm' */ + } + luaG_runerror(L, "loop in gettable"); +} + + +void luaV_settable (lua_State *L, const TValue *t, TValue *key, StkId val) { + int loop; + for (loop = 0; loop < MAXTAGLOOP; loop++) { + const TValue *tm; + if (ttistable(t)) { /* `t' is a table? */ + Table *h = hvalue(t); + TValue *oldval = cast(TValue *, luaH_get(h, key)); + /* if previous value is not nil, there must be a previous entry + in the table; moreover, a metamethod has no relevance */ + if (!ttisnil(oldval) || + /* previous value is nil; must check the metamethod */ + ((tm = fasttm(L, h->metatable, TM_NEWINDEX)) == NULL && + /* no metamethod; is there a previous entry in the table? */ + (oldval != luaO_nilobject || + /* no previous entry; must create one. (The next test is + always true; we only need the assignment.) */ + (oldval = luaH_newkey(L, h, key), 1)))) { + /* no metamethod and (now) there is an entry with given key */ + setobj2t(L, oldval, val); /* assign new value to that entry */ + invalidateTMcache(h); + luaC_barrierback(L, obj2gco(h), val); + return; + } + /* else will try the metamethod */ + } + else /* not a table; check metamethod */ + if (ttisnil(tm = luaT_gettmbyobj(L, t, TM_NEWINDEX))) + luaG_typeerror(L, t, "index"); + /* there is a metamethod */ + if (ttisfunction(tm)) { + callTM(L, tm, t, key, val, 0); + return; + } + t = tm; /* else repeat with 'tm' */ + } + luaG_runerror(L, "loop in settable"); +} + + +static int call_binTM (lua_State *L, const TValue *p1, const TValue *p2, + StkId res, TMS event) { + const TValue *tm = luaT_gettmbyobj(L, p1, event); /* try first operand */ + if (ttisnil(tm)) + tm = luaT_gettmbyobj(L, p2, event); /* try second operand */ + if (ttisnil(tm)) return 0; + callTM(L, tm, p1, p2, res, 1); + return 1; +} + + +static const TValue *get_equalTM (lua_State *L, Table *mt1, Table *mt2, + TMS event) { + const TValue *tm1 = fasttm(L, mt1, event); + const TValue *tm2; + if (tm1 == NULL) return NULL; /* no metamethod */ + if (mt1 == mt2) return tm1; /* same metatables => same metamethods */ + tm2 = fasttm(L, mt2, event); + if (tm2 == NULL) return NULL; /* no metamethod */ + if (luaV_rawequalobj(tm1, tm2)) /* same metamethods? */ + return tm1; + return NULL; +} + + +static int call_orderTM (lua_State *L, const TValue *p1, const TValue *p2, + TMS event) { + if (!call_binTM(L, p1, p2, L->top, event)) + return -1; /* no metamethod */ + else + return !l_isfalse(L->top); +} + + +static int l_strcmp (const TString *ls, const TString *rs) { + const char *l = getstr(ls); + size_t ll = ls->tsv.len; + const char *r = getstr(rs); + size_t lr = rs->tsv.len; + for (;;) { + int temp = strcoll(l, r); + if (temp != 0) return temp; + else { /* strings are equal up to a `\0' */ + size_t len = strlen(l); /* index of first `\0' in both strings */ + if (len == lr) /* r is finished? */ + return (len == ll) ? 0 : 1; + else if (len == ll) /* l is finished? */ + return -1; /* l is smaller than r (because r is not finished) */ + /* both strings longer than `len'; go on comparing (after the `\0') */ + len++; + l += len; ll -= len; r += len; lr -= len; + } + } +} + + +int luaV_lessthan (lua_State *L, const TValue *l, const TValue *r) { + int res; + if (ttisnumber(l) && ttisnumber(r)) + return luai_numlt(L, nvalue(l), nvalue(r)); + else if (ttisstring(l) && ttisstring(r)) + return l_strcmp(rawtsvalue(l), rawtsvalue(r)) < 0; + else if ((res = call_orderTM(L, l, r, TM_LT)) < 0) + luaG_ordererror(L, l, r); + return res; +} + + +int luaV_lessequal (lua_State *L, const TValue *l, const TValue *r) { + int res; + if (ttisnumber(l) && ttisnumber(r)) + return luai_numle(L, nvalue(l), nvalue(r)); + else if (ttisstring(l) && ttisstring(r)) + return l_strcmp(rawtsvalue(l), rawtsvalue(r)) <= 0; + else if ((res = call_orderTM(L, l, r, TM_LE)) >= 0) /* first try `le' */ + return res; + else if ((res = call_orderTM(L, r, l, TM_LT)) < 0) /* else try `lt' */ + luaG_ordererror(L, l, r); + return !res; +} + + +/* +** equality of Lua values. L == NULL means raw equality (no metamethods) +*/ +int luaV_equalobj_ (lua_State *L, const TValue *t1, const TValue *t2) { + const TValue *tm; + lua_assert(ttisequal(t1, t2)); + switch (ttype(t1)) { + case LUA_TNIL: return 1; + case LUA_TNUMBER: return luai_numeq(nvalue(t1), nvalue(t2)); + case LUA_TBOOLEAN: return bvalue(t1) == bvalue(t2); /* true must be 1 !! */ + case LUA_TLIGHTUSERDATA: return pvalue(t1) == pvalue(t2); + case LUA_TLCF: return fvalue(t1) == fvalue(t2); + case LUA_TSHRSTR: return eqshrstr(rawtsvalue(t1), rawtsvalue(t2)); + case LUA_TLNGSTR: return luaS_eqlngstr(rawtsvalue(t1), rawtsvalue(t2)); + case LUA_TUSERDATA: { + if (uvalue(t1) == uvalue(t2)) return 1; + else if (L == NULL) return 0; + tm = get_equalTM(L, uvalue(t1)->metatable, uvalue(t2)->metatable, TM_EQ); + break; /* will try TM */ + } + case LUA_TTABLE: { + if (hvalue(t1) == hvalue(t2)) return 1; + else if (L == NULL) return 0; + tm = get_equalTM(L, hvalue(t1)->metatable, hvalue(t2)->metatable, TM_EQ); + break; /* will try TM */ + } + default: + lua_assert(iscollectable(t1)); + return gcvalue(t1) == gcvalue(t2); + } + if (tm == NULL) return 0; /* no TM? */ + callTM(L, tm, t1, t2, L->top, 1); /* call TM */ + return !l_isfalse(L->top); +} + + +void luaV_concat (lua_State *L, int total) { + lua_assert(total >= 2); + do { + StkId top = L->top; + int n = 2; /* number of elements handled in this pass (at least 2) */ + if (!(ttisstring(top-2) || ttisnumber(top-2)) || !tostring(L, top-1)) { + if (!call_binTM(L, top-2, top-1, top-2, TM_CONCAT)) + luaG_concaterror(L, top-2, top-1); + } + else if (tsvalue(top-1)->len == 0) /* second operand is empty? */ + (void)tostring(L, top - 2); /* result is first operand */ + else if (ttisstring(top-2) && tsvalue(top-2)->len == 0) { + setobjs2s(L, top - 2, top - 1); /* result is second op. */ + } + else { + /* at least two non-empty string values; get as many as possible */ + size_t tl = tsvalue(top-1)->len; + char *buffer; + int i; + /* collect total length */ + for (i = 1; i < total && tostring(L, top-i-1); i++) { + size_t l = tsvalue(top-i-1)->len; + if (l >= (MAX_SIZET/sizeof(char)) - tl) + luaG_runerror(L, "string length overflow"); + tl += l; + } + buffer = luaZ_openspace(L, &G(L)->buff, tl); + tl = 0; + n = i; + do { /* concat all strings */ + size_t l = tsvalue(top-i)->len; + memcpy(buffer+tl, svalue(top-i), l * sizeof(char)); + tl += l; + } while (--i > 0); + setsvalue2s(L, top-n, luaS_newlstr(L, buffer, tl)); + } + total -= n-1; /* got 'n' strings to create 1 new */ + L->top -= n-1; /* popped 'n' strings and pushed one */ + } while (total > 1); /* repeat until only 1 result left */ +} + + +void luaV_objlen (lua_State *L, StkId ra, const TValue *rb) { + const TValue *tm; + switch (ttypenv(rb)) { + case LUA_TTABLE: { + Table *h = hvalue(rb); + tm = fasttm(L, h->metatable, TM_LEN); + if (tm) break; /* metamethod? break switch to call it */ + setnvalue(ra, cast_num(luaH_getn(h))); /* else primitive len */ + return; + } + case LUA_TSTRING: { + setnvalue(ra, cast_num(tsvalue(rb)->len)); + return; + } + default: { /* try metamethod */ + tm = luaT_gettmbyobj(L, rb, TM_LEN); + if (ttisnil(tm)) /* no metamethod? */ + luaG_typeerror(L, rb, "get length of"); + break; + } + } + callTM(L, tm, rb, rb, ra, 1); +} + + +void luaV_arith (lua_State *L, StkId ra, const TValue *rb, + const TValue *rc, TMS op) { + TValue tempb, tempc; + const TValue *b, *c; + if ((b = luaV_tonumber(rb, &tempb)) != NULL && + (c = luaV_tonumber(rc, &tempc)) != NULL) { + lua_Number res = luaO_arith(op - TM_ADD + LUA_OPADD, nvalue(b), nvalue(c)); + setnvalue(ra, res); + } + else if (!call_binTM(L, rb, rc, ra, op)) + luaG_aritherror(L, rb, rc); +} + + +/* +** check whether cached closure in prototype 'p' may be reused, that is, +** whether there is a cached closure with the same upvalues needed by +** new closure to be created. +*/ +static Closure *getcached (Proto *p, UpVal **encup, StkId base) { + Closure *c = p->cache; + if (c != NULL) { /* is there a cached closure? */ + int nup = p->sizeupvalues; + Upvaldesc *uv = p->upvalues; + int i; + for (i = 0; i < nup; i++) { /* check whether it has right upvalues */ + TValue *v = uv[i].instack ? base + uv[i].idx : encup[uv[i].idx]->v; + if (c->l.upvals[i]->v != v) + return NULL; /* wrong upvalue; cannot reuse closure */ + } + } + return c; /* return cached closure (or NULL if no cached closure) */ +} + + +/* +** create a new Lua closure, push it in the stack, and initialize +** its upvalues. Note that the call to 'luaC_barrierproto' must come +** before the assignment to 'p->cache', as the function needs the +** original value of that field. +*/ +static void pushclosure (lua_State *L, Proto *p, UpVal **encup, StkId base, + StkId ra) { + int nup = p->sizeupvalues; + Upvaldesc *uv = p->upvalues; + int i; + Closure *ncl = luaF_newLclosure(L, nup); + ncl->l.p = p; + setclLvalue(L, ra, ncl); /* anchor new closure in stack */ + for (i = 0; i < nup; i++) { /* fill in its upvalues */ + if (uv[i].instack) /* upvalue refers to local variable? */ + ncl->l.upvals[i] = luaF_findupval(L, base + uv[i].idx); + else /* get upvalue from enclosing function */ + ncl->l.upvals[i] = encup[uv[i].idx]; + } + luaC_barrierproto(L, p, ncl); + p->cache = ncl; /* save it on cache for reuse */ +} + + +/* +** finish execution of an opcode interrupted by an yield +*/ +void luaV_finishOp (lua_State *L) { + CallInfo *ci = L->ci; + StkId base = ci->u.l.base; + Instruction inst = *(ci->u.l.savedpc - 1); /* interrupted instruction */ + OpCode op = GET_OPCODE(inst); + switch (op) { /* finish its execution */ + case OP_ADD: case OP_SUB: case OP_MUL: case OP_DIV: + case OP_MOD: case OP_POW: case OP_UNM: case OP_LEN: + case OP_GETTABUP: case OP_GETTABLE: case OP_SELF: { + setobjs2s(L, base + GETARG_A(inst), --L->top); + break; + } + case OP_LE: case OP_LT: case OP_EQ: { + int res = !l_isfalse(L->top - 1); + L->top--; + /* metamethod should not be called when operand is K */ + lua_assert(!ISK(GETARG_B(inst))); + if (op == OP_LE && /* "<=" using "<" instead? */ + ttisnil(luaT_gettmbyobj(L, base + GETARG_B(inst), TM_LE))) + res = !res; /* invert result */ + lua_assert(GET_OPCODE(*ci->u.l.savedpc) == OP_JMP); + if (res != GETARG_A(inst)) /* condition failed? */ + ci->u.l.savedpc++; /* skip jump instruction */ + break; + } + case OP_CONCAT: { + StkId top = L->top - 1; /* top when 'call_binTM' was called */ + int b = GETARG_B(inst); /* first element to concatenate */ + int total = cast_int(top - 1 - (base + b)); /* yet to concatenate */ + setobj2s(L, top - 2, top); /* put TM result in proper position */ + if (total > 1) { /* are there elements to concat? */ + L->top = top - 1; /* top is one after last element (at top-2) */ + luaV_concat(L, total); /* concat them (may yield again) */ + } + /* move final result to final position */ + setobj2s(L, ci->u.l.base + GETARG_A(inst), L->top - 1); + L->top = ci->top; /* restore top */ + break; + } + case OP_TFORCALL: { + lua_assert(GET_OPCODE(*ci->u.l.savedpc) == OP_TFORLOOP); + L->top = ci->top; /* correct top */ + break; + } + case OP_CALL: { + if (GETARG_C(inst) - 1 >= 0) /* nresults >= 0? */ + L->top = ci->top; /* adjust results */ + break; + } + case OP_TAILCALL: case OP_SETTABUP: case OP_SETTABLE: + break; + default: lua_assert(0); + } +} + + + +/* +** some macros for common tasks in `luaV_execute' +*/ + +#if !defined luai_runtimecheck +#define luai_runtimecheck(L, c) /* void */ +#endif + + +#define RA(i) (base+GETARG_A(i)) +/* to be used after possible stack reallocation */ +#define RB(i) check_exp(getBMode(GET_OPCODE(i)) == OpArgR, base+GETARG_B(i)) +#define RC(i) check_exp(getCMode(GET_OPCODE(i)) == OpArgR, base+GETARG_C(i)) +#define RKB(i) check_exp(getBMode(GET_OPCODE(i)) == OpArgK, \ + ISK(GETARG_B(i)) ? k+INDEXK(GETARG_B(i)) : base+GETARG_B(i)) +#define RKC(i) check_exp(getCMode(GET_OPCODE(i)) == OpArgK, \ + ISK(GETARG_C(i)) ? k+INDEXK(GETARG_C(i)) : base+GETARG_C(i)) +#define KBx(i) \ + (k + (GETARG_Bx(i) != 0 ? GETARG_Bx(i) - 1 : GETARG_Ax(*ci->u.l.savedpc++))) + + +/* execute a jump instruction */ +#define dojump(ci,i,e) \ + { int a = GETARG_A(i); \ + if (a > 0) luaF_close(L, ci->u.l.base + a - 1); \ + ci->u.l.savedpc += GETARG_sBx(i) + e; } + +/* for test instructions, execute the jump instruction that follows it */ +#define donextjump(ci) { i = *ci->u.l.savedpc; dojump(ci, i, 1); } + + +#define Protect(x) { {x;}; base = ci->u.l.base; } + +#define checkGC(L,c) \ + Protect( luaC_condGC(L,{L->top = (c); /* limit of live values */ \ + luaC_step(L); \ + L->top = ci->top;}) /* restore top */ \ + luai_threadyield(L); ) + + +#define arith_op(op,tm) { \ + TValue *rb = RKB(i); \ + TValue *rc = RKC(i); \ + if (ttisnumber(rb) && ttisnumber(rc)) { \ + lua_Number nb = nvalue(rb), nc = nvalue(rc); \ + setnvalue(ra, op(L, nb, nc)); \ + } \ + else { Protect(luaV_arith(L, ra, rb, rc, tm)); } } + + +#define vmdispatch(o) switch(o) +#define vmcase(l,b) case l: {b} break; +#define vmcasenb(l,b) case l: {b} /* nb = no break */ + +void luaV_execute (lua_State *L) { + CallInfo *ci = L->ci; + LClosure *cl; + TValue *k; + StkId base; + newframe: /* reentry point when frame changes (call/return) */ + lua_assert(ci == L->ci); + cl = clLvalue(ci->func); + k = cl->p->k; + base = ci->u.l.base; + /* main loop of interpreter */ + for (;;) { + Instruction i = *(ci->u.l.savedpc++); + StkId ra; + if ((L->hookmask & (LUA_MASKLINE | LUA_MASKCOUNT)) && + (--L->hookcount == 0 || L->hookmask & LUA_MASKLINE)) { + Protect(traceexec(L)); + } + /* WARNING: several calls may realloc the stack and invalidate `ra' */ + ra = RA(i); + lua_assert(base == ci->u.l.base); + lua_assert(base <= L->top && L->top < L->stack + L->stacksize); + vmdispatch (GET_OPCODE(i)) { + vmcase(OP_MOVE, + setobjs2s(L, ra, RB(i)); + ) + vmcase(OP_LOADK, + TValue *rb = k + GETARG_Bx(i); + setobj2s(L, ra, rb); + ) + vmcase(OP_LOADKX, + TValue *rb; + lua_assert(GET_OPCODE(*ci->u.l.savedpc) == OP_EXTRAARG); + rb = k + GETARG_Ax(*ci->u.l.savedpc++); + setobj2s(L, ra, rb); + ) + vmcase(OP_LOADBOOL, + setbvalue(ra, GETARG_B(i)); + if (GETARG_C(i)) ci->u.l.savedpc++; /* skip next instruction (if C) */ + ) + vmcase(OP_LOADNIL, + int b = GETARG_B(i); + do { + setnilvalue(ra++); + } while (b--); + ) + vmcase(OP_GETUPVAL, + int b = GETARG_B(i); + setobj2s(L, ra, cl->upvals[b]->v); + ) + vmcase(OP_GETTABUP, + int b = GETARG_B(i); + Protect(luaV_gettable(L, cl->upvals[b]->v, RKC(i), ra)); + ) + vmcase(OP_GETTABLE, + Protect(luaV_gettable(L, RB(i), RKC(i), ra)); + ) + vmcase(OP_SETTABUP, + int a = GETARG_A(i); + Protect(luaV_settable(L, cl->upvals[a]->v, RKB(i), RKC(i))); + ) + vmcase(OP_SETUPVAL, + UpVal *uv = cl->upvals[GETARG_B(i)]; + setobj(L, uv->v, ra); + luaC_barrier(L, uv, ra); + ) + vmcase(OP_SETTABLE, + Protect(luaV_settable(L, ra, RKB(i), RKC(i))); + ) + vmcase(OP_NEWTABLE, + int b = GETARG_B(i); + int c = GETARG_C(i); + Table *t = luaH_new(L); + sethvalue(L, ra, t); + if (b != 0 || c != 0) + luaH_resize(L, t, luaO_fb2int(b), luaO_fb2int(c)); + checkGC(L, ra + 1); + ) + vmcase(OP_SELF, + StkId rb = RB(i); + setobjs2s(L, ra+1, rb); + Protect(luaV_gettable(L, rb, RKC(i), ra)); + ) + vmcase(OP_ADD, + arith_op(luai_numadd, TM_ADD); + ) + vmcase(OP_SUB, + arith_op(luai_numsub, TM_SUB); + ) + vmcase(OP_MUL, + arith_op(luai_nummul, TM_MUL); + ) + vmcase(OP_DIV, + arith_op(luai_numdiv, TM_DIV); + ) + vmcase(OP_MOD, + arith_op(luai_nummod, TM_MOD); + ) + vmcase(OP_POW, + arith_op(luai_numpow, TM_POW); + ) + vmcase(OP_UNM, + TValue *rb = RB(i); + if (ttisnumber(rb)) { + lua_Number nb = nvalue(rb); + setnvalue(ra, luai_numunm(L, nb)); + } + else { + Protect(luaV_arith(L, ra, rb, rb, TM_UNM)); + } + ) + vmcase(OP_NOT, + TValue *rb = RB(i); + int res = l_isfalse(rb); /* next assignment may change this value */ + setbvalue(ra, res); + ) + vmcase(OP_LEN, + Protect(luaV_objlen(L, ra, RB(i))); + ) + vmcase(OP_CONCAT, + int b = GETARG_B(i); + int c = GETARG_C(i); + StkId rb; + L->top = base + c + 1; /* mark the end of concat operands */ + Protect(luaV_concat(L, c - b + 1)); + ra = RA(i); /* 'luav_concat' may invoke TMs and move the stack */ + rb = b + base; + setobjs2s(L, ra, rb); + checkGC(L, (ra >= rb ? ra + 1 : rb)); + L->top = ci->top; /* restore top */ + ) + vmcase(OP_JMP, + dojump(ci, i, 0); + ) + vmcase(OP_EQ, + TValue *rb = RKB(i); + TValue *rc = RKC(i); + Protect( + if (cast_int(equalobj(L, rb, rc)) != GETARG_A(i)) + ci->u.l.savedpc++; + else + donextjump(ci); + ) + ) + vmcase(OP_LT, + Protect( + if (luaV_lessthan(L, RKB(i), RKC(i)) != GETARG_A(i)) + ci->u.l.savedpc++; + else + donextjump(ci); + ) + ) + vmcase(OP_LE, + Protect( + if (luaV_lessequal(L, RKB(i), RKC(i)) != GETARG_A(i)) + ci->u.l.savedpc++; + else + donextjump(ci); + ) + ) + vmcase(OP_TEST, + if (GETARG_C(i) ? l_isfalse(ra) : !l_isfalse(ra)) + ci->u.l.savedpc++; + else + donextjump(ci); + ) + vmcase(OP_TESTSET, + TValue *rb = RB(i); + if (GETARG_C(i) ? l_isfalse(rb) : !l_isfalse(rb)) + ci->u.l.savedpc++; + else { + setobjs2s(L, ra, rb); + donextjump(ci); + } + ) + vmcase(OP_CALL, + int b = GETARG_B(i); + int nresults = GETARG_C(i) - 1; + if (b != 0) L->top = ra+b; /* else previous instruction set top */ + if (luaD_precall(L, ra, nresults)) { /* C function? */ + if (nresults >= 0) L->top = ci->top; /* adjust results */ + base = ci->u.l.base; + } + else { /* Lua function */ + ci = L->ci; + ci->callstatus |= CIST_REENTRY; + goto newframe; /* restart luaV_execute over new Lua function */ + } + ) + vmcase(OP_TAILCALL, + int b = GETARG_B(i); + if (b != 0) L->top = ra+b; /* else previous instruction set top */ + lua_assert(GETARG_C(i) - 1 == LUA_MULTRET); + if (luaD_precall(L, ra, LUA_MULTRET)) /* C function? */ + base = ci->u.l.base; + else { + /* tail call: put called frame (n) in place of caller one (o) */ + CallInfo *nci = L->ci; /* called frame */ + CallInfo *oci = nci->previous; /* caller frame */ + StkId nfunc = nci->func; /* called function */ + StkId ofunc = oci->func; /* caller function */ + /* last stack slot filled by 'precall' */ + StkId lim = nci->u.l.base + getproto(nfunc)->numparams; + int aux; + /* close all upvalues from previous call */ + if (cl->p->sizep > 0) luaF_close(L, oci->u.l.base); + /* move new frame into old one */ + for (aux = 0; nfunc + aux < lim; aux++) + setobjs2s(L, ofunc + aux, nfunc + aux); + oci->u.l.base = ofunc + (nci->u.l.base - nfunc); /* correct base */ + oci->top = L->top = ofunc + (L->top - nfunc); /* correct top */ + oci->u.l.savedpc = nci->u.l.savedpc; + oci->callstatus |= CIST_TAIL; /* function was tail called */ + ci = L->ci = oci; /* remove new frame */ + lua_assert(L->top == oci->u.l.base + getproto(ofunc)->maxstacksize); + goto newframe; /* restart luaV_execute over new Lua function */ + } + ) + vmcasenb(OP_RETURN, + int b = GETARG_B(i); + if (b != 0) L->top = ra+b-1; + if (cl->p->sizep > 0) luaF_close(L, base); + b = luaD_poscall(L, ra); + if (!(ci->callstatus & CIST_REENTRY)) /* 'ci' still the called one */ + return; /* external invocation: return */ + else { /* invocation via reentry: continue execution */ + ci = L->ci; + if (b) L->top = ci->top; + lua_assert(isLua(ci)); + lua_assert(GET_OPCODE(*((ci)->u.l.savedpc - 1)) == OP_CALL); + goto newframe; /* restart luaV_execute over new Lua function */ + } + ) + vmcase(OP_FORLOOP, + lua_Number step = nvalue(ra+2); + lua_Number idx = luai_numadd(L, nvalue(ra), step); /* increment index */ + lua_Number limit = nvalue(ra+1); + if (luai_numlt(L, 0, step) ? luai_numle(L, idx, limit) + : luai_numle(L, limit, idx)) { + ci->u.l.savedpc += GETARG_sBx(i); /* jump back */ + setnvalue(ra, idx); /* update internal index... */ + setnvalue(ra+3, idx); /* ...and external index */ + } + ) + vmcase(OP_FORPREP, + const TValue *init = ra; + const TValue *plimit = ra+1; + const TValue *pstep = ra+2; + if (!tonumber(init, ra)) + luaG_runerror(L, LUA_QL("for") " initial value must be a number"); + else if (!tonumber(plimit, ra+1)) + luaG_runerror(L, LUA_QL("for") " limit must be a number"); + else if (!tonumber(pstep, ra+2)) + luaG_runerror(L, LUA_QL("for") " step must be a number"); + setnvalue(ra, luai_numsub(L, nvalue(ra), nvalue(pstep))); + ci->u.l.savedpc += GETARG_sBx(i); + ) + vmcasenb(OP_TFORCALL, + StkId cb = ra + 3; /* call base */ + setobjs2s(L, cb+2, ra+2); + setobjs2s(L, cb+1, ra+1); + setobjs2s(L, cb, ra); + L->top = cb + 3; /* func. + 2 args (state and index) */ + Protect(luaD_call(L, cb, GETARG_C(i), 1)); + L->top = ci->top; + i = *(ci->u.l.savedpc++); /* go to next instruction */ + ra = RA(i); + lua_assert(GET_OPCODE(i) == OP_TFORLOOP); + goto l_tforloop; + ) + vmcase(OP_TFORLOOP, + l_tforloop: + if (!ttisnil(ra + 1)) { /* continue loop? */ + setobjs2s(L, ra, ra + 1); /* save control variable */ + ci->u.l.savedpc += GETARG_sBx(i); /* jump back */ + } + ) + vmcase(OP_SETLIST, + int n = GETARG_B(i); + int c = GETARG_C(i); + int last; + Table *h; + if (n == 0) n = cast_int(L->top - ra) - 1; + if (c == 0) { + lua_assert(GET_OPCODE(*ci->u.l.savedpc) == OP_EXTRAARG); + c = GETARG_Ax(*ci->u.l.savedpc++); + } + luai_runtimecheck(L, ttistable(ra)); + h = hvalue(ra); + last = ((c-1)*LFIELDS_PER_FLUSH) + n; + if (last > h->sizearray) /* needs more space? */ + luaH_resizearray(L, h, last); /* pre-allocate it at once */ + for (; n > 0; n--) { + TValue *val = ra+n; + luaH_setint(L, h, last--, val); + luaC_barrierback(L, obj2gco(h), val); + } + L->top = ci->top; /* correct top (in case of previous open call) */ + ) + vmcase(OP_CLOSURE, + Proto *p = cl->p->p[GETARG_Bx(i)]; + Closure *ncl = getcached(p, cl->upvals, base); /* cached closure */ + if (ncl == NULL) /* no match? */ + pushclosure(L, p, cl->upvals, base, ra); /* create a new one */ + else + setclLvalue(L, ra, ncl); /* push cashed closure */ + checkGC(L, ra + 1); + ) + vmcase(OP_VARARG, + int b = GETARG_B(i) - 1; + int j; + int n = cast_int(base - ci->func) - cl->p->numparams - 1; + if (b < 0) { /* B == 0? */ + b = n; /* get all var. arguments */ + Protect(luaD_checkstack(L, n)); + ra = RA(i); /* previous call may change the stack */ + L->top = ra + n; + } + for (j = 0; j < b; j++) { + if (j < n) { + setobjs2s(L, ra + j, base - n + j); + } + else { + setnilvalue(ra + j); + } + } + ) + vmcase(OP_EXTRAARG, + lua_assert(0); + ) + } + } +} + diff --git a/liblua/lvm.h b/liblua/lvm.h new file mode 100644 index 00000000..07e25f9c --- /dev/null +++ b/liblua/lvm.h @@ -0,0 +1,44 @@ +/* +** $Id: lvm.h,v 2.18 2013/01/08 14:06:55 roberto Exp $ +** Lua virtual machine +** See Copyright Notice in lua.h +*/ + +#ifndef lvm_h +#define lvm_h + + +#include "ldo.h" +#include "lobject.h" +#include "ltm.h" + + +#define tostring(L,o) (ttisstring(o) || (luaV_tostring(L, o))) + +#define tonumber(o,n) (ttisnumber(o) || (((o) = luaV_tonumber(o,n)) != NULL)) + +#define equalobj(L,o1,o2) (ttisequal(o1, o2) && luaV_equalobj_(L, o1, o2)) + +#define luaV_rawequalobj(o1,o2) equalobj(NULL,o1,o2) + + +/* not to called directly */ +LUAI_FUNC int luaV_equalobj_ (lua_State *L, const TValue *t1, const TValue *t2); + + +LUAI_FUNC int luaV_lessthan (lua_State *L, const TValue *l, const TValue *r); +LUAI_FUNC int luaV_lessequal (lua_State *L, const TValue *l, const TValue *r); +LUAI_FUNC const TValue *luaV_tonumber (const TValue *obj, TValue *n); +LUAI_FUNC int luaV_tostring (lua_State *L, StkId obj); +LUAI_FUNC void luaV_gettable (lua_State *L, const TValue *t, TValue *key, + StkId val); +LUAI_FUNC void luaV_settable (lua_State *L, const TValue *t, TValue *key, + StkId val); +LUAI_FUNC void luaV_finishOp (lua_State *L); +LUAI_FUNC void luaV_execute (lua_State *L); +LUAI_FUNC void luaV_concat (lua_State *L, int total); +LUAI_FUNC void luaV_arith (lua_State *L, StkId ra, const TValue *rb, + const TValue *rc, TMS op); +LUAI_FUNC void luaV_objlen (lua_State *L, StkId ra, const TValue *rb); + +#endif diff --git a/liblua/lzio.c b/liblua/lzio.c new file mode 100644 index 00000000..8b77054e --- /dev/null +++ b/liblua/lzio.c @@ -0,0 +1,76 @@ +/* +** $Id: lzio.c,v 1.35 2012/05/14 13:34:18 roberto Exp $ +** Buffered streams +** See Copyright Notice in lua.h +*/ + + +#include + +#define lzio_c +#define LUA_CORE + +#include "lua.h" + +#include "llimits.h" +#include "lmem.h" +#include "lstate.h" +#include "lzio.h" + + +int luaZ_fill (ZIO *z) { + size_t size; + lua_State *L = z->L; + const char *buff; + lua_unlock(L); + buff = z->reader(L, z->data, &size); + lua_lock(L); + if (buff == NULL || size == 0) + return EOZ; + z->n = size - 1; /* discount char being returned */ + z->p = buff; + return cast_uchar(*(z->p++)); +} + + +void luaZ_init (lua_State *L, ZIO *z, lua_Reader reader, void *data) { + z->L = L; + z->reader = reader; + z->data = data; + z->n = 0; + z->p = NULL; +} + + +/* --------------------------------------------------------------- read --- */ +size_t luaZ_read (ZIO *z, void *b, size_t n) { + while (n) { + size_t m; + if (z->n == 0) { /* no bytes in buffer? */ + if (luaZ_fill(z) == EOZ) /* try to read more */ + return n; /* no more input; return number of missing bytes */ + else { + z->n++; /* luaZ_fill consumed first byte; put it back */ + z->p--; + } + } + m = (n <= z->n) ? n : z->n; /* min. between n and z->n */ + memcpy(b, z->p, m); + z->n -= m; + z->p += m; + b = (char *)b + m; + n -= m; + } + return 0; +} + +/* ------------------------------------------------------------------------ */ +char *luaZ_openspace (lua_State *L, Mbuffer *buff, size_t n) { + if (n > buff->buffsize) { + if (n < LUA_MINBUFFER) n = LUA_MINBUFFER; + luaZ_resizebuffer(L, buff, n); + } + return buff->buffer; +} + + diff --git a/liblua/lzio.h b/liblua/lzio.h new file mode 100644 index 00000000..08682301 --- /dev/null +++ b/liblua/lzio.h @@ -0,0 +1,65 @@ +/* +** $Id: lzio.h,v 1.26 2011/07/15 12:48:03 roberto Exp $ +** Buffered streams +** See Copyright Notice in lua.h +*/ + + +#ifndef lzio_h +#define lzio_h + +#include "lua.h" + +#include "lmem.h" + + +#define EOZ (-1) /* end of stream */ + +typedef struct Zio ZIO; + +#define zgetc(z) (((z)->n--)>0 ? cast_uchar(*(z)->p++) : luaZ_fill(z)) + + +typedef struct Mbuffer { + char *buffer; + size_t n; + size_t buffsize; +} Mbuffer; + +#define luaZ_initbuffer(L, buff) ((buff)->buffer = NULL, (buff)->buffsize = 0) + +#define luaZ_buffer(buff) ((buff)->buffer) +#define luaZ_sizebuffer(buff) ((buff)->buffsize) +#define luaZ_bufflen(buff) ((buff)->n) + +#define luaZ_resetbuffer(buff) ((buff)->n = 0) + + +#define luaZ_resizebuffer(L, buff, size) \ + (luaM_reallocvector(L, (buff)->buffer, (buff)->buffsize, size, char), \ + (buff)->buffsize = size) + +#define luaZ_freebuffer(L, buff) luaZ_resizebuffer(L, buff, 0) + + +LUAI_FUNC char *luaZ_openspace (lua_State *L, Mbuffer *buff, size_t n); +LUAI_FUNC void luaZ_init (lua_State *L, ZIO *z, lua_Reader reader, + void *data); +LUAI_FUNC size_t luaZ_read (ZIO* z, void* b, size_t n); /* read next n bytes */ + + + +/* --------- Private Part ------------------ */ + +struct Zio { + size_t n; /* bytes still unread */ + const char *p; /* current position in buffer */ + lua_Reader reader; /* reader function */ + void* data; /* additional data */ + lua_State *L; /* Lua state (for reader) */ +}; + + +LUAI_FUNC int luaZ_fill (ZIO *z); + +#endif -- 2.39.2