From 2f85ce7d93009fbbd06084470cece28b1af1731c Mon Sep 17 00:00:00 2001 From: Walter Schell Date: Fri, 30 Apr 2021 13:03:26 -0400 Subject: [PATCH] Added lua 5.4.3 sources and extracted --- lua-5.4.3/Makefile | 106 + lua-5.4.3/README | 6 + lua-5.4.3/doc/contents.html | 674 ++ lua-5.4.3/doc/index.css | 21 + lua-5.4.3/doc/logo.gif | Bin 0 -> 9893 bytes lua-5.4.3/doc/lua.1 | 149 + lua-5.4.3/doc/lua.css | 161 + lua-5.4.3/doc/luac.1 | 118 + lua-5.4.3/doc/manual.css | 21 + lua-5.4.3/doc/manual.html | 11934 ++++++++++++++++++++++++ lua-5.4.3/doc/osi-certified-72x60.png | Bin 0 -> 3774 bytes lua-5.4.3/doc/readme.html | 340 + lua-5.4.3/src/Makefile | 222 + lua-5.4.3/src/lapi.c | 1455 +++ lua-5.4.3/src/lapi.h | 49 + lua-5.4.3/src/lauxlib.c | 1105 +++ lua-5.4.3/src/lauxlib.h | 293 + lua-5.4.3/src/lbaselib.c | 528 ++ lua-5.4.3/src/lcode.c | 1814 ++++ lua-5.4.3/src/lcode.h | 104 + lua-5.4.3/src/lcorolib.c | 210 + lua-5.4.3/src/lctype.c | 64 + lua-5.4.3/src/lctype.h | 101 + lua-5.4.3/src/ldblib.c | 483 + lua-5.4.3/src/ldebug.c | 877 ++ lua-5.4.3/src/ldebug.h | 63 + lua-5.4.3/src/ldo.c | 963 ++ lua-5.4.3/src/ldo.h | 79 + lua-5.4.3/src/ldump.c | 226 + lua-5.4.3/src/lfunc.c | 294 + lua-5.4.3/src/lfunc.h | 64 + lua-5.4.3/src/lgc.c | 1728 ++++ lua-5.4.3/src/lgc.h | 189 + lua-5.4.3/src/linit.c | 65 + lua-5.4.3/src/liolib.c | 828 ++ lua-5.4.3/src/ljumptab.h | 112 + lua-5.4.3/src/llex.c | 581 ++ lua-5.4.3/src/llex.h | 91 + lua-5.4.3/src/llimits.h | 353 + lua-5.4.3/src/lmathlib.c | 764 ++ lua-5.4.3/src/lmem.c | 201 + lua-5.4.3/src/lmem.h | 93 + lua-5.4.3/src/loadlib.c | 762 ++ lua-5.4.3/src/lobject.c | 592 ++ lua-5.4.3/src/lobject.h | 800 ++ lua-5.4.3/src/lopcodes.c | 104 + lua-5.4.3/src/lopcodes.h | 392 + lua-5.4.3/src/lopnames.h | 103 + lua-5.4.3/src/loslib.c | 430 + lua-5.4.3/src/lparser.c | 1956 ++++ lua-5.4.3/src/lparser.h | 171 + lua-5.4.3/src/lprefix.h | 45 + lua-5.4.3/src/lstate.c | 439 + lua-5.4.3/src/lstate.h | 404 + lua-5.4.3/src/lstring.c | 273 + lua-5.4.3/src/lstring.h | 57 + lua-5.4.3/src/lstrlib.c | 1817 ++++ lua-5.4.3/src/ltable.c | 971 ++ lua-5.4.3/src/ltable.h | 66 + lua-5.4.3/src/ltablib.c | 429 + lua-5.4.3/src/ltm.c | 271 + lua-5.4.3/src/ltm.h | 103 + lua-5.4.3/src/lua.c | 659 ++ lua-5.4.3/src/lua.h | 518 + lua-5.4.3/src/lua.hpp | 9 + lua-5.4.3/src/luac.c | 724 ++ lua-5.4.3/src/luaconf.h | 790 ++ lua-5.4.3/src/lualib.h | 52 + lua-5.4.3/src/lundump.c | 333 + lua-5.4.3/src/lundump.h | 36 + lua-5.4.3/src/lutf8lib.c | 289 + lua-5.4.3/src/lvm.c | 1836 ++++ lua-5.4.3/src/lvm.h | 136 + lua-5.4.3/src/lzio.c | 68 + lua-5.4.3/src/lzio.h | 66 + orig_sources/lua-5.4.3.tar.gz | Bin 0 -> 358216 bytes 76 files changed, 43230 insertions(+) create mode 100644 lua-5.4.3/Makefile create mode 100644 lua-5.4.3/README create mode 100644 lua-5.4.3/doc/contents.html create mode 100644 lua-5.4.3/doc/index.css create mode 100644 lua-5.4.3/doc/logo.gif create mode 100644 lua-5.4.3/doc/lua.1 create mode 100644 lua-5.4.3/doc/lua.css create mode 100644 lua-5.4.3/doc/luac.1 create mode 100644 lua-5.4.3/doc/manual.css create mode 100644 lua-5.4.3/doc/manual.html create mode 100644 lua-5.4.3/doc/osi-certified-72x60.png create mode 100644 lua-5.4.3/doc/readme.html create mode 100644 lua-5.4.3/src/Makefile create mode 100644 lua-5.4.3/src/lapi.c create mode 100644 lua-5.4.3/src/lapi.h create mode 100644 lua-5.4.3/src/lauxlib.c create mode 100644 lua-5.4.3/src/lauxlib.h create mode 100644 lua-5.4.3/src/lbaselib.c create mode 100644 lua-5.4.3/src/lcode.c create mode 100644 lua-5.4.3/src/lcode.h create mode 100644 lua-5.4.3/src/lcorolib.c create mode 100644 lua-5.4.3/src/lctype.c create mode 100644 lua-5.4.3/src/lctype.h create mode 100644 lua-5.4.3/src/ldblib.c create mode 100644 lua-5.4.3/src/ldebug.c create mode 100644 lua-5.4.3/src/ldebug.h create mode 100644 lua-5.4.3/src/ldo.c create mode 100644 lua-5.4.3/src/ldo.h create mode 100644 lua-5.4.3/src/ldump.c create mode 100644 lua-5.4.3/src/lfunc.c create mode 100644 lua-5.4.3/src/lfunc.h create mode 100644 lua-5.4.3/src/lgc.c create mode 100644 lua-5.4.3/src/lgc.h create mode 100644 lua-5.4.3/src/linit.c create mode 100644 lua-5.4.3/src/liolib.c create mode 100644 lua-5.4.3/src/ljumptab.h create mode 100644 lua-5.4.3/src/llex.c create mode 100644 lua-5.4.3/src/llex.h create mode 100644 lua-5.4.3/src/llimits.h create mode 100644 lua-5.4.3/src/lmathlib.c create mode 100644 lua-5.4.3/src/lmem.c create mode 100644 lua-5.4.3/src/lmem.h create mode 100644 lua-5.4.3/src/loadlib.c create mode 100644 lua-5.4.3/src/lobject.c create mode 100644 lua-5.4.3/src/lobject.h create mode 100644 lua-5.4.3/src/lopcodes.c create mode 100644 lua-5.4.3/src/lopcodes.h create mode 100644 lua-5.4.3/src/lopnames.h create mode 100644 lua-5.4.3/src/loslib.c create mode 100644 lua-5.4.3/src/lparser.c create mode 100644 lua-5.4.3/src/lparser.h create mode 100644 lua-5.4.3/src/lprefix.h create mode 100644 lua-5.4.3/src/lstate.c create mode 100644 lua-5.4.3/src/lstate.h create mode 100644 lua-5.4.3/src/lstring.c create mode 100644 lua-5.4.3/src/lstring.h create mode 100644 lua-5.4.3/src/lstrlib.c create mode 100644 lua-5.4.3/src/ltable.c create mode 100644 lua-5.4.3/src/ltable.h create mode 100644 lua-5.4.3/src/ltablib.c create mode 100644 lua-5.4.3/src/ltm.c create mode 100644 lua-5.4.3/src/ltm.h create mode 100644 lua-5.4.3/src/lua.c create mode 100644 lua-5.4.3/src/lua.h create mode 100644 lua-5.4.3/src/lua.hpp create mode 100644 lua-5.4.3/src/luac.c create mode 100644 lua-5.4.3/src/luaconf.h create mode 100644 lua-5.4.3/src/lualib.h create mode 100644 lua-5.4.3/src/lundump.c create mode 100644 lua-5.4.3/src/lundump.h create mode 100644 lua-5.4.3/src/lutf8lib.c create mode 100644 lua-5.4.3/src/lvm.c create mode 100644 lua-5.4.3/src/lvm.h create mode 100644 lua-5.4.3/src/lzio.c create mode 100644 lua-5.4.3/src/lzio.h create mode 100644 orig_sources/lua-5.4.3.tar.gz diff --git a/lua-5.4.3/Makefile b/lua-5.4.3/Makefile new file mode 100644 index 0000000..fed75b3 --- /dev/null +++ b/lua-5.4.3/Makefile @@ -0,0 +1,106 @@ +# Makefile for installing 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= guess + +# Where to install. The installation starts in the src and doc directories, +# so take care if INSTALL_TOP is not an absolute path. See the local target. +# You may want to make INSTALL_LMOD and INSTALL_CMOD consistent with +# LUA_ROOT, LUA_LDIR, and LUA_CDIR in luaconf.h. +INSTALL_TOP= /usr/local +INSTALL_BIN= $(INSTALL_TOP)/bin +INSTALL_INC= $(INSTALL_TOP)/include +INSTALL_LIB= $(INSTALL_TOP)/lib +INSTALL_MAN= $(INSTALL_TOP)/man/man1 +INSTALL_LMOD= $(INSTALL_TOP)/share/lua/$V +INSTALL_CMOD= $(INSTALL_TOP)/lib/lua/$V + +# How to install. If your install program does not support "-p", then +# you may have to run ranlib on the installed liblua.a. +INSTALL= install -p +INSTALL_EXEC= $(INSTALL) -m 0755 +INSTALL_DATA= $(INSTALL) -m 0644 +# +# If you don't have "install" you can use "cp" instead. +# INSTALL= cp -p +# INSTALL_EXEC= $(INSTALL) +# INSTALL_DATA= $(INSTALL) + +# Other utilities. +MKDIR= mkdir -p +RM= rm -f + +# == END OF USER SETTINGS -- NO NEED TO CHANGE ANYTHING BELOW THIS LINE ======= + +# Convenience platforms targets. +PLATS= guess aix bsd c89 freebsd generic linux linux-readline macosx mingw posix solaris + +# What to install. +TO_BIN= lua luac +TO_INC= lua.h luaconf.h lualib.h lauxlib.h lua.hpp +TO_LIB= liblua.a +TO_MAN= lua.1 luac.1 + +# Lua version and release. +V= 5.4 +R= $V.3 + +# Targets start here. +all: $(PLAT) + +$(PLATS) help test clean: + @cd src && $(MAKE) $@ + +install: dummy + cd src && $(MKDIR) $(INSTALL_BIN) $(INSTALL_INC) $(INSTALL_LIB) $(INSTALL_MAN) $(INSTALL_LMOD) $(INSTALL_CMOD) + cd src && $(INSTALL_EXEC) $(TO_BIN) $(INSTALL_BIN) + cd src && $(INSTALL_DATA) $(TO_INC) $(INSTALL_INC) + cd src && $(INSTALL_DATA) $(TO_LIB) $(INSTALL_LIB) + cd doc && $(INSTALL_DATA) $(TO_MAN) $(INSTALL_MAN) + +uninstall: + cd src && cd $(INSTALL_BIN) && $(RM) $(TO_BIN) + cd src && cd $(INSTALL_INC) && $(RM) $(TO_INC) + cd src && cd $(INSTALL_LIB) && $(RM) $(TO_LIB) + cd doc && cd $(INSTALL_MAN) && $(RM) $(TO_MAN) + +local: + $(MAKE) install INSTALL_TOP=../install + +# make may get confused with install/ if it does not support .PHONY. +dummy: + +# Echo config parameters. +echo: + @cd src && $(MAKE) -s echo + @echo "PLAT= $(PLAT)" + @echo "V= $V" + @echo "R= $R" + @echo "TO_BIN= $(TO_BIN)" + @echo "TO_INC= $(TO_INC)" + @echo "TO_LIB= $(TO_LIB)" + @echo "TO_MAN= $(TO_MAN)" + @echo "INSTALL_TOP= $(INSTALL_TOP)" + @echo "INSTALL_BIN= $(INSTALL_BIN)" + @echo "INSTALL_INC= $(INSTALL_INC)" + @echo "INSTALL_LIB= $(INSTALL_LIB)" + @echo "INSTALL_MAN= $(INSTALL_MAN)" + @echo "INSTALL_LMOD= $(INSTALL_LMOD)" + @echo "INSTALL_CMOD= $(INSTALL_CMOD)" + @echo "INSTALL_EXEC= $(INSTALL_EXEC)" + @echo "INSTALL_DATA= $(INSTALL_DATA)" + +# Echo pkg-config data. +pc: + @echo "version=$R" + @echo "prefix=$(INSTALL_TOP)" + @echo "libdir=$(INSTALL_LIB)" + @echo "includedir=$(INSTALL_INC)" + +# Targets that do not create files (not all makes understand .PHONY). +.PHONY: all $(PLATS) help test clean install uninstall local dummy echo pc + +# (end of Makefile) diff --git a/lua-5.4.3/README b/lua-5.4.3/README new file mode 100644 index 0000000..ebd4db0 --- /dev/null +++ b/lua-5.4.3/README @@ -0,0 +1,6 @@ + +This is Lua 5.4.3, released on 15 Mar 2021. + +For installation instructions, license details, and +further information about Lua, see doc/readme.html. + diff --git a/lua-5.4.3/doc/contents.html b/lua-5.4.3/doc/contents.html new file mode 100644 index 0000000..7ecf1c7 --- /dev/null +++ b/lua-5.4.3/doc/contents.html @@ -0,0 +1,674 @@ + + + +Lua 5.4 Reference Manual - contents + + + + + + + +

+Lua +Lua 5.4 Reference Manual +

+ +

+The reference manual is the official definition of the Lua language. +
+For a complete introduction to Lua programming, see the book +Programming in Lua. + +

+start +· +contents +· +index +· +other versions +
+ +

+ +Copyright © 2020–2021 Lua.org, PUC-Rio. +Freely available under the terms of the +Lua license. + + +

Contents

+ + +

Index

+ + + + + + + +
+

Lua functions

+

+basic
+_G
+_VERSION
+assert
+collectgarbage
+dofile
+error
+getmetatable
+ipairs
+load
+loadfile
+next
+pairs
+pcall
+print
+rawequal
+rawget
+rawlen
+rawset
+require
+select
+setmetatable
+tonumber
+tostring
+type
+warn
+xpcall
+ +

+coroutine
+coroutine.close
+coroutine.create
+coroutine.isyieldable
+coroutine.resume
+coroutine.running
+coroutine.status
+coroutine.wrap
+coroutine.yield
+ +

+debug
+debug.debug
+debug.gethook
+debug.getinfo
+debug.getlocal
+debug.getmetatable
+debug.getregistry
+debug.getupvalue
+debug.getuservalue
+debug.sethook
+debug.setlocal
+debug.setmetatable
+debug.setupvalue
+debug.setuservalue
+debug.traceback
+debug.upvalueid
+debug.upvaluejoin
+ +

+io
+io.close
+io.flush
+io.input
+io.lines
+io.open
+io.output
+io.popen
+io.read
+io.stderr
+io.stdin
+io.stdout
+io.tmpfile
+io.type
+io.write
+ +file:close
+file:flush
+file:lines
+file:read
+file:seek
+file:setvbuf
+file:write
+ +

 +

 

+

+math
+math.abs
+math.acos
+math.asin
+math.atan
+math.ceil
+math.cos
+math.deg
+math.exp
+math.floor
+math.fmod
+math.huge
+math.log
+math.max
+math.maxinteger
+math.min
+math.mininteger
+math.modf
+math.pi
+math.rad
+math.random
+math.randomseed
+math.sin
+math.sqrt
+math.tan
+math.tointeger
+math.type
+math.ult
+ +

+os
+os.clock
+os.date
+os.difftime
+os.execute
+os.exit
+os.getenv
+os.remove
+os.rename
+os.setlocale
+os.time
+os.tmpname
+ +

+package
+package.config
+package.cpath
+package.loaded
+package.loadlib
+package.path
+package.preload
+package.searchers
+package.searchpath
+ +

+string
+string.byte
+string.char
+string.dump
+string.find
+string.format
+string.gmatch
+string.gsub
+string.len
+string.lower
+string.match
+string.pack
+string.packsize
+string.rep
+string.reverse
+string.sub
+string.unpack
+string.upper
+ +

+table
+table.concat
+table.insert
+table.move
+table.pack
+table.remove
+table.sort
+table.unpack
+ +

+utf8
+utf8.char
+utf8.charpattern
+utf8.codepoint
+utf8.codes
+utf8.len
+utf8.offset
+ +

metamethods

+

+__add
+__band
+__bnot
+__bor
+__bxor
+__call
+__close
+__concat
+__div
+__eq
+__gc
+__idiv
+__index
+__le
+__len
+__lt
+__metatable
+__mod
+__mode
+__mul
+__name
+__newindex
+__pairs
+__pow
+__shl
+__shr
+__sub
+__tostring
+__unm
+ +

environment
variables

+

+LUA_CPATH
+LUA_CPATH_5_4
+LUA_INIT
+LUA_INIT_5_4
+LUA_PATH
+LUA_PATH_5_4
+ +

 +

C API

+

+lua_Alloc
+lua_CFunction
+lua_Debug
+lua_Hook
+lua_Integer
+lua_KContext
+lua_KFunction
+lua_Number
+lua_Reader
+lua_State
+lua_Unsigned
+lua_WarnFunction
+lua_Writer
+ +

+lua_absindex
+lua_arith
+lua_atpanic
+lua_call
+lua_callk
+lua_checkstack
+lua_close
+lua_closeslot
+lua_compare
+lua_concat
+lua_copy
+lua_createtable
+lua_dump
+lua_error
+lua_gc
+lua_getallocf
+lua_getextraspace
+lua_getfield
+lua_getglobal
+lua_gethook
+lua_gethookcount
+lua_gethookmask
+lua_geti
+lua_getinfo
+lua_getiuservalue
+lua_getlocal
+lua_getmetatable
+lua_getstack
+lua_gettable
+lua_gettop
+lua_getupvalue
+lua_insert
+lua_isboolean
+lua_iscfunction
+lua_isfunction
+lua_isinteger
+lua_islightuserdata
+lua_isnil
+lua_isnone
+lua_isnoneornil
+lua_isnumber
+lua_isstring
+lua_istable
+lua_isthread
+lua_isuserdata
+lua_isyieldable
+lua_len
+lua_load
+lua_newstate
+lua_newtable
+lua_newthread
+lua_newuserdatauv
+lua_next
+lua_numbertointeger
+lua_pcall
+lua_pcallk
+lua_pop
+lua_pushboolean
+lua_pushcclosure
+lua_pushcfunction
+lua_pushfstring
+lua_pushglobaltable
+lua_pushinteger
+lua_pushlightuserdata
+lua_pushliteral
+lua_pushlstring
+lua_pushnil
+lua_pushnumber
+lua_pushstring
+lua_pushthread
+lua_pushvalue
+lua_pushvfstring
+lua_rawequal
+lua_rawget
+lua_rawgeti
+lua_rawgetp
+lua_rawlen
+lua_rawset
+lua_rawseti
+lua_rawsetp
+lua_register
+lua_remove
+lua_replace
+lua_resetthread
+lua_resume
+lua_rotate
+lua_setallocf
+lua_setfield
+lua_setglobal
+lua_sethook
+lua_seti
+lua_setiuservalue
+lua_setlocal
+lua_setmetatable
+lua_settable
+lua_settop
+lua_setupvalue
+lua_setwarnf
+lua_status
+lua_stringtonumber
+lua_toboolean
+lua_tocfunction
+lua_toclose
+lua_tointeger
+lua_tointegerx
+lua_tolstring
+lua_tonumber
+lua_tonumberx
+lua_topointer
+lua_tostring
+lua_tothread
+lua_touserdata
+lua_type
+lua_typename
+lua_upvalueid
+lua_upvalueindex
+lua_upvaluejoin
+lua_version
+lua_warning
+lua_xmove
+lua_yield
+lua_yieldk
+ +

 +

auxiliary library

+

+luaL_Buffer
+luaL_Reg
+luaL_Stream
+ +

+luaL_addchar
+luaL_addgsub
+luaL_addlstring
+luaL_addsize
+luaL_addstring
+luaL_addvalue
+luaL_argcheck
+luaL_argerror
+luaL_argexpected
+luaL_buffaddr
+luaL_buffinit
+luaL_buffinitsize
+luaL_bufflen
+luaL_buffsub
+luaL_callmeta
+luaL_checkany
+luaL_checkinteger
+luaL_checklstring
+luaL_checknumber
+luaL_checkoption
+luaL_checkstack
+luaL_checkstring
+luaL_checktype
+luaL_checkudata
+luaL_checkversion
+luaL_dofile
+luaL_dostring
+luaL_error
+luaL_execresult
+luaL_fileresult
+luaL_getmetafield
+luaL_getmetatable
+luaL_getsubtable
+luaL_gsub
+luaL_len
+luaL_loadbuffer
+luaL_loadbufferx
+luaL_loadfile
+luaL_loadfilex
+luaL_loadstring
+luaL_newlib
+luaL_newlibtable
+luaL_newmetatable
+luaL_newstate
+luaL_openlibs
+luaL_opt
+luaL_optinteger
+luaL_optlstring
+luaL_optnumber
+luaL_optstring
+luaL_prepbuffer
+luaL_prepbuffsize
+luaL_pushfail
+luaL_pushresult
+luaL_pushresultsize
+luaL_ref
+luaL_requiref
+luaL_setfuncs
+luaL_setmetatable
+luaL_testudata
+luaL_tolstring
+luaL_traceback
+luaL_typeerror
+luaL_typename
+luaL_unref
+luaL_where
+ +

standard library

+

+luaopen_base
+luaopen_coroutine
+luaopen_debug
+luaopen_io
+luaopen_math
+luaopen_os
+luaopen_package
+luaopen_string
+luaopen_table
+luaopen_utf8
+ +

constants

+

+LUA_ERRERR
+LUA_ERRFILE
+LUA_ERRMEM
+LUA_ERRRUN
+LUA_ERRSYNTAX
+LUA_HOOKCALL
+LUA_HOOKCOUNT
+LUA_HOOKLINE
+LUA_HOOKRET
+LUA_HOOKTAILCALL
+LUAL_BUFFERSIZE
+LUA_MASKCALL
+LUA_MASKCOUNT
+LUA_MASKLINE
+LUA_MASKRET
+LUA_MAXINTEGER
+LUA_MININTEGER
+LUA_MINSTACK
+LUA_MULTRET
+LUA_NOREF
+LUA_OK
+LUA_OPADD
+LUA_OPBAND
+LUA_OPBNOT
+LUA_OPBOR
+LUA_OPBXOR
+LUA_OPDIV
+LUA_OPEQ
+LUA_OPIDIV
+LUA_OPLE
+LUA_OPLT
+LUA_OPMOD
+LUA_OPMUL
+LUA_OPPOW
+LUA_OPSHL
+LUA_OPSHR
+LUA_OPSUB
+LUA_OPUNM
+LUA_REFNIL
+LUA_REGISTRYINDEX
+LUA_RIDX_GLOBALS
+LUA_RIDX_MAINTHREAD
+LUA_TBOOLEAN
+LUA_TFUNCTION
+LUA_TLIGHTUSERDATA
+LUA_TNIL
+LUA_TNONE
+LUA_TNUMBER
+LUA_TSTRING
+LUA_TTABLE
+LUA_TTHREAD
+LUA_TUSERDATA
+LUA_USE_APICHECK
+LUA_YIELD
+ +

+ +

+Last update: +Wed Mar 3 13:04:44 UTC 2021 +

+ + + + diff --git a/lua-5.4.3/doc/index.css b/lua-5.4.3/doc/index.css new file mode 100644 index 0000000..c961835 --- /dev/null +++ b/lua-5.4.3/doc/index.css @@ -0,0 +1,21 @@ +ul { + list-style-type: none ; +} + +ul.contents { + padding: 0 ; +} + +table { + border: none ; + border-spacing: 0 ; + border-collapse: collapse ; +} + +td { + vertical-align: top ; + padding: 0 ; + text-align: left ; + line-height: 1.25 ; + width: 15% ; +} diff --git a/lua-5.4.3/doc/logo.gif b/lua-5.4.3/doc/logo.gif new file mode 100644 index 0000000000000000000000000000000000000000..5c77eacc3b8f397fb2e87d2aaecd89128e53a117 GIT binary patch literal 9893 zcmZ`JAZZ!6FBhF{g-pRY z?mq`C!p1xV^4?ZTR7k~j;V9G1HDS87U+{!}P$o&rgc4zX0NDT~riS`~QEcMXc4?@W z^+STR)$~fm_`ABgqdI|BbFIpHF{r}hP+etgD8-NQs7W75NaJI?Ql(hqjVakK+HRty zUXfx9(Bq-+-?*K3uw9ID@9?*;-eo#?myt-t^)SGPba%#*OB5Fu=j7)HeEWuc=*-K) z!oqjj0S)u!&5gi;Bahobc>^^a9XUOHT z2|mFhODfM>_&5x-TrvTHjN4n=t}cJHz|Oj&#(Ac#A<;QYj?%w(I{6NHetKEy88L^C$rQ3l)#a6 zoT#z!d-$MNnQ|f0h4|+;?CDm7g1UnqCpv3AVbZ0g!y5D)ht6oJG9OD4(C|vg-ir+_ zH4QGgnPSh+=ffel34{g3QbJKkb?GxJXlu)W&M4!QB^7H4b450C&zK>m4Sy@4- z6QwcXU;C4g#1AgjGlY}HQLNi?RV^MlIy=8Y#lo5nG5DcI$LoBU)7F-?yK5#MO(ZKV z4S#la_H=)P#gQKG^HdgSn#J9BwwdVYIM>{c*8F@wEO$d}R+sxjn>$#7D0Sp=?`**6 zSgb455aPSEq?K#BY9czOB~w zbadnT{PaZ|6MyUb3JQ8>r#+FkD@XhNG?}o-!{}_4A*5_Nyi-4?sw$?YhV}1AdjC?B zgUxkSi}=^CG*t3gMjJh01>e6T@3$!ESeZ^i-|I!u zS;Y;*lPMP-5pj1|J68PThiJLljogBy_@_?@umOG-J7a9_muB|%_5%Y0xG`uvyho24 zIB%XLJt0uPbhhSAqhnKw*C!-wew~ll#zHvKqtx}hu;K?rot-)2DP`g3vIG)P#bW#V z#78r@yHnXrnbSui-|;3*m#OEgl|Ar3-?ZbLj*ECy&1Z-(e4BAv822YtIM?~_>A{XCM0gm<2F`yi=~k^Qpkaj;z9R!JMds*m*#io0jdc7= z_32qZaeQ{RyoLtu;NW0GM#|0W?QI53?3wlUfYmFzOS9J|wG7ON3R+r2E3FBfX*p?^~m1 z6V|U~sT|y#!d_|FC~juNn3R-(U?c)K1cYB-XL+RJsusn5sJ+RfCJjfoveJPB2E8VY ze>-6GiZ=08p%V7#QAzD2(fGeZ=h&GUh!qrTD!o3Hx0HW92SHt(m5Rzw1vQg>ESIRL zceqjS=8oh<74zz*;XjH7mM-Q|N>rkd^6&&UHrgsF*A*1*Ny>erU}PL7XDcg0?d{O* z1OHq$wC4kBW@%Z_)RY<-8R=VoJu1hW%$PbbR=GYYPsi<1pLKq2BJ*9&lH*Mr1@h?- zk$H2rr%((U;g63+%JFe|?|D5i*-R){z1;cs_IMilux#weYs=fwFeyZelpm6zO3TXT zYfVu=SRoN`fR)c~#H3%xLrrVG){XLs%W+C*j!X)3XXS=o9L4Y7Y4c4Nn3e6iqIP!B$P!~=+%bVCorwZbea_d%{9_@+x)gMD z!A=L1w$D$>lAk8s9b;tVXJZqwMyRqA-fVf9jLHaCqMT)d%(`(nU#mfn-S)W6#P; z=3~G1aSyeny@xz{sqe(QAtQ%m7HZiLcGoU!#=I^tB;>)$tUp@4#&}2onV7?oPE35i zlo$@3HMJv8Y>)4(2i;^?lJIo!@e!ZH+B3jmXa9^CL-NPx#NG&|6hO2b&vPRZ#5%&5>oeqS2brR1*C$NtWqMvwVDOx5Y@S#^ z&_6%4yRdnC(v!H)L}^Ka+LW}D-Cm1w)+quD5+xy*Ed+psxoShNndF8Bm$M#>koguj z6f7);EM(I_VR11rgmli6^)M>r$(5Du>ykxlf{`JnO5?K)MC~1O8|-vR+p3I8AN~*= zT@6_!CDC>&*w)uvnR50H4tI|iW17v5G!4tni~8OiB$0i{-skaNkDJ7=p?>-!QAtuK zGH&qwyZv(MezW5r9PF&?$r6pDH(b=RG{xXlS@d8_Q?g~x9Zwmx@oP1+_x>s#?yX&A zJ<$i~41SNKh86dSYQui}G5(udqd)BUytgYi|Dx4(X$bQst#fSOqxZjt63ThVELa(< z=wI@Opzy_vOv)kuWxt8eUN7D5>|Apl8>nubM5%c9f7!7;r$k%CGhCKXT2 z-k!qzYR%Czzyy-azx++9a_n;OQf4Lr3KX3NpT!_=3b$18MH`>vz-i^}tMTVUZ z>>6?`x}LOt@qT{D&)`uV`Y3Z+ZZooW)2=6EW~SdY0o?^b4jI6ZC)@y&ZP@Uz`5D7Z zl7dqFba9n&vrI2DRB5j@vG&K0)N-wxvoW8ny|(k~ASD{ZgPGTs%RJA)pGADun)w|a z9dCPO-ENNA_?|AQmW!TZVZ#avB>&ydPA~a9V`hh<#3X&+zS}w3vd~Kp=B*6_p}bcV zUE^_+>f5sHi>P1s`6V5{K_R*fd;9HOnbE7L83#ush~4-^y8hd8)pE5F z;(t~CR|ixR&)!V>9E-Q}W7qM?>PHTG9O>l`kbNR(){jzBZ*ds4KT^iK9nC2MFeUHP z9338RB2IKBlpAx=O+0EmU0UsJqgAF_Yqf}8Q@d%~4+9$z#-MfW^efyWWMSd6uGf_+ zqjn?n8k;pT-XZ&lpw~#O~n_8?Twhc9ed6YFyb#LI=KCJ zvxB&XLT&i`?-Sp}FiYifPlEId6de`PfSdd$>PIn)jd(&d4rO4 z)`gJ$(5q|9mZSEj+U-Jyj68(nd8|~`FqMr8&xOZFD(-ejPhfMcleKc;TX^`F^Q}P@ zH8mx*zim<8h~pUTMM@?2#=mgs!BWd|-=d!OJHi|z39ur+V?Et3D{3|8<={wSG3*04*38Uo_r^=G9s|a2cvz-V z?>h*Y_J3Cw*8EqJ+E0vUf*#IF9rqE@D5hP3xQMXi$A5?SFx~#$VJzA8YVz(7Q})(U6RbGxnUHX$I?6)oBrzO(9Gijguu~Q)mrI3TvYr5V zlecf*E;%n+iHt!C3&ov}`Pd8MvETwj-e6#3A9{!ob!->gJ&Dyi?9fPmit;{cNQQD} zRloJu`6cIqVp~w*ZEHNPfMO=t?uJUuz+PjK>|*NYH$DV0sZDM5xKUD4+E5i?XUAS~ z&ENey8k;>nVL)7Oe!#gxo%g+OLzzHbZ^Q#Hr?fQO-~Uyl_=%{Dwe=v}>VpS~e)Zfd zq6(`zp2q6M3EN{ptaCKVO!w*q^{zTx5U{s93}a&p(^r#9_g$4P^C zhOAD1#@AZmX9yCK(qOMLy4SZxI3t?z`q%(R0dXh+nA(Xct8Ixl9UWcRw{PM_lWt44 zii-UG-&9%8)deq&#<(253+VH6aJtz4m08Z|cR8Fh9?iD7Y$R^gm6wr0OlHzMRz(`> zc#of!mL@4Fxf?IyQ+0dVt(2A~UOH1LC^|9d2W<@XX~FiNC;9vL0sMRjA2{kA)_ivs zeWeS@SXj{VCnOyl*v3ad<_MUZ(*T3SXZzS^K0w(^57NRwPnw6=RAub}_Hv4CRcFz|73xTIY87ZN%Eu-R<#d?Y0Mk9Z}Bv zYr7mCuc_(%=s#ii#emwHHkH8m#t`<|2Vzt7Ll=jtqy z)$u#R!;`EfUY`u5UOo|I+42}XT)zUCA%0A-^7`I=ZfR-o#M>pI(&x#FQO~-wA&6X` z)yeVAwEKme93k?X@U%31d;)%TT8MV@)M27H{Ks-Nz!g>w@Q)m&r)ECy?&D|eyj2WD z5o~z@y`E18lT9aWgGMI%u|qa35ieo1_7QK4-^D*)V(2O9s-SjK2ozF~_xSI1JUn=b zy>CfBmtzObTZ)&fd8j^&zW*o2Cny~%la4)hePrQ&alp>0b+@msxA}OtZYdw5sBHN6 ztY2{B#7A&&qxUPlZbskj8B0%J@YVO!y3g-G)<+CB0VRNfvmr2^%A)G?(XzvKx_J8c@z3|&{Jf#Q6hf-12#XCn z7r*I(05aTlBn=FvRV={-z0+e8P%4{pPQ2F+ylIcnR!zi{>dI$k4-)qKT;6A1muF^S zK@RG@;X6RE3#zLPC5zl$yRohr!qFKRGMCf%c85Adviqy5tKWrm?BiqK zJlr6{$2}y}emwh4R~Zu<+v)!rAvhG56B@nNgK8~TG-+s&BVCBA0)MH6Qz1MY zE!g%GI++q<31}P~DeNho66M2rTY);Fw)_xu*nZscis(d#~c9jyj zlO_C&>f}=Bs;a6})6=1f$k$?UuQo zZj|=1ToL2BBQGZkFdJ#5n4sGI_w=9=6GwLu$gdFr zh@3YGgbkL}(_R~PjdJ9F=gAn_f;2xJN7|XcD)GfrMW1)WQ8+fEHZ(*N2vyEHta{ym zJ9?aozqKTFj7fv5GVqnYQ;U7M9$e-XJy*c9ovSeEAX* z_qjGGA8%scLJA^GI>}8 z0u=`bV!4{EnHef=;?l|Mk|G&AF^v?P#5t_BW^7QU-Bp)8{tk;~`REdzZuECUqksL% z({@#k_d|!*Zz7-EdY61|W+q6R@mAYKgEF4Y!6Z-K>LVxg*3OQyfuyN0BkoWHzR ze@`Hb)#sM}c1JEkE<$Ag03DiREQpYh&<73>=auitEdPKE5Zio;M8>8#N3>mg$0#?fpooPYP3zvz$nr7G*V7M zL14Z_bdBXaYg~N14k9WJj)Z~&Du{QYWN+27M0$-FY3mA?660V3@hEr#80d}w6uBc2 z&xqbW5PdYDPRl#h-K81fsXxHpZz5AyS!#Y)UzBun<3>V4@)GI(`I&(y^V|Nuxg|$> ze-xu$mXxC-bvJjTp)D$GT`3va6usUGXWYHK56@_&k5|l4vR1Rs&x#osT?6V=nbSGf zNgVWviClW^l>IX%D-Hsnz=(>8T~WS@?M&=}0=Gz!$qFHiCcqgvoX^J_MPyEqLP0_T zb4;*2p#vi+Gj-|xXMBA0c)93JEa7Bg!0Ez*S5~L7_vr6)zKF6xBOtNG78De$aK-4l zeXw5Q`YxaS?ekGnkbI$1mB|Q9bQHQsm_-1i4t)GUm|kp&@+NF2q~fM^;guaSW5drtx9X1l{5mNq(_-&+XiTn`hG7xNubGh-OWvXylx2D+uyhNHEuTL`TXFZQESqr z@1Eb*h7^$7wv@4yyalP)=k5 ztp@8qNET4Yfq*ppnVftWU#Mi{zggx?1(g1hR?AF7gL#a<0p2DqkruOp>mR#??h!I0 zR-@x!50K!O9L8=}OuaAjnD3C{Cg-mEz^5}70Z{c=dST~_(OVbQUEHQ(>p!wd^mKqDerqMHD0f3E%r6}(tKvECnk z>(}yvt*>g`NS`kR``z|Sx)B}Knx6mB7#X>$cNmgf9t?h|w!Pd{EG=yrimJ8SROySp zxuRb~X=L@Xny;x`ErtJobBCTDE_E2|(CyLn{pxKWFOZv&h2JqMsGF|GO01kDe+PLy zCZ(8^n>%hm63f2HmqH2?iyi3eCughAUJ3jj;WSJ(drz_eRlI$h2K7!_=*#0RE{Ao- z{*C5-|KIZRazbu<7{D8Zh5h?Y13)cK=N#LbkXY?s#|?c8LrbUScHD&FT@po=jF7=Q zJI5p{jk#{)GgMSu>}TW67Q*eI6dHvD9)d)Qv9+aheE8Q%){c!2T~2dz&_sUSJl^?GmyDOdBCvz1``m^V5AmdwV#F{P!Yxje4v0fRqp zR0c8$iZ^pI5Eo^>9~8zQBpiJV?j}{#S(bKkib!XHvlbwrhY>}irA;d-W^Q^~(ea4e zl0Mr=%l4D*`m}qM3wX^%3z*^8)%&}$Pbt3P> zOI`DB@Oua*(rNKvFMnQaQ+!Zge6uu-jy?DDE9}LNN5%DPX8foO0k5=z0*XJA%Lm9y ztbj*;>5IhMb>xX|4e|g(z<0lEnM5zuuOs!7$(B5nUNdeqKYH|f!C65=1I!#H6_sfR z=11rir@n9RK8cG5s}JUTpuT(eJ6@i#@aGiQ8q^L#V}Pi6={Kru?FEmZD@?f}3`I;l z;N&?eL*5j)-;QP$&9%6V!Icvenn?mi!1w&9^B-mEvpr8HKt003u*hp~LzSO_-gw)I z^7mfb?O_#4x-f(IQQz9d;Oi<$@=)a`&r@G0chPW81!^O{>$xM(O#*HriRwpQA=EX3 z)q(Zueoq!$w_u^GFC6J^H_I;EZhw9?J3(@DrR%MAF1?v>rYjb&#x|B z5wUP^;**nilr?XOC|@QARsjTzb= zPGt)L{w+KLLbZnHC*_LSkkb&sA8R{;dV%7T@fN$QuPe${#(dgB1s@H9#(J0-7`DM} zDJUqIO-BjG&iP#b#ERz|OqZ(89XU4yh4PD;6~_@jyE2xP#6BLHKCs}*EZwjFB`Yc6 z0b|q!M&DE5=u=!zZv>7aH731o3vN^&n@_hdwLfe?ON)8E<$S*%bh7($vo%BGkKhQL zqKmEgPhOFT`v?)e!oXPs(1~bKHy8;T@`2sy6zKR1nfzs$S`zr7AgVnd7He-uT};rh z*gcgFZigXx)L&RrLn9+EOZVsMY`H{Vbge06VuxE>%?2;e0%_=3A)8MB4?w@Z8_rB8 zWPUxSzs?4&-QpUHB5(^FJ`A7AS5mo6Q4Msp|kLZhOt3Y&C` zRp8q$3q{o`2t|wv(n@LB7#R4k-Uic=H^OCSRqXJtrjERL4#q>QE$|z-aHeBf+eZzn zebx;(4rkY}-rUeC>gvF8IvJmt>HD2Xm&$D5ze)ksDA%0K$X@GlgXerA&<#W>E<(ne zlk_pfilr|2pbP*qG}^t<4`$`b_;n7{O>q@5X=rIT0#F1DMDS_WA zWNXXpvh0++8j2!fi*)&6r%G^q{%gO!S#C~FFa{MZ4gHU9eX~BJ{SI>{5~-Ec>eoUu zndqE>Qz{H#Q$Y$hTi6TFm5sXO9vRXn4JRusEHtb8oR`lZ4c~Um3oDF*D)~KzLLEj< zM~46lYXldOAt9MlS=IP^Nl8Fbk{l1u(gSyJAaz)z3I-OI@Rz*c1WX1H^%PVVz|8~O zE^@R+ec87V^{X{*Z#Sdy04dRvD_;?gqaZ{^OCOonX{;6mwFubrnDFzm1Vz;0KkMq; z603#?5Z&5tl9I4TGkN>LmWx!d{JFWgiExTe-vE`N*l06rN#-yV{Z zmKLUr_Y!)v29ArE*lXIvaO0sQ7J!kX5AWK(%xOSp%2Bb-kMMdf%cP8$K%%Yg{&iI8 zLy9H`I|JUt4jRd1@?e$Ew3|<@L!{zB=>UmiV`Ib9W?UW@TQ$46xfxv3ZnX6Sw`T)& z4^$^fkmWiOrT+y}hvP=Q><17rFdzl&!Q-TLwkU?z=Zl6U#8$PM8sw&nF~Opm8uUcz z-aN4gpf)$ni(KFXa2}Cp8usb85tYDcFb-k3J!vSsEeNWgkcO046OYr z{Pf~Ng@%Tv^V4T5C@KmmDxv|ZYGi5}pO(g>pKv_VRTT@F1+IT{xw)>AlK+Gm1vfWP z`h6yCF!&dfr3;12j?%k&zf_MeEc`B3%zxZqV8_JG%74{BrW8l<;yDQkL3MU^ib_bt z$HaUzH>XWaO@%@${PAKDC@6e%a$={Uq4C1a*_lGBI1(#S$y1B5Vy~sbIHg zXlS_TBd{4CAO8qA92mL7LrYe+$|)KmDcpLkj;L`AxUa0Kwp@fju)Rw4ESvsaq4Nva z^FaB+AS7H$$Mjh53i3+nShux3oMWM-qqF151Vs4H#DtK&J!_eIpscPg0R-yyDh@@= zCfjvk8=@y5_kgd#`0twjR-;WEPGdhXX>VISeU@4^LTa0+cn3CNy>}GTa5OS-H0Ck1 zHwGsND>DlR0}Cqy^9L0cW*$~{9#(D!W>y|%X0efPKmV(Nm5tF?6Sx1};6n@t9B2TM M5|b0H5Z3qqKj-ldMF0Q* literal 0 HcmV?d00001 diff --git a/lua-5.4.3/doc/lua.1 b/lua-5.4.3/doc/lua.1 new file mode 100644 index 0000000..a46a1a6 --- /dev/null +++ b/lua-5.4.3/doc/lua.1 @@ -0,0 +1,149 @@ +.\" $Id: lua.man,v 1.14 2020/05/21 19:31:21 lhf Exp $ +.TH LUA 1 "$Date: 2020/05/21 19:31:21 $" +.SH NAME +lua \- Lua interpreter +.SH SYNOPSIS +.B lua +[ +.I options +] +[ +.I script +[ +.I args +] +] +.SH DESCRIPTION +.B lua +is the standalone Lua interpreter. +It loads and executes Lua programs, +either in textual source form or +in precompiled binary form. +(Precompiled binaries are output by +.BR luac , +the Lua compiler.) +.B lua +can be used as a batch interpreter and also interactively. +.LP +After handling the +.IR options , +the Lua program in file +.I script +is loaded and executed. +The +.I args +are available to +.I script +as strings in a global table named +.B arg +and also as arguments to its main function. +When called without arguments, +.B lua +behaves as +.B "lua \-v \-i" +if the standard input is a terminal, +and as +.B "lua \-" +otherwise. +.LP +In interactive mode, +.B lua +prompts the user, +reads lines from the standard input, +and executes them as they are read. +If the line contains an expression, +then the line is evaluated and the result is printed. +If a line does not contain a complete statement, +then a secondary prompt is displayed and +lines are read until a complete statement is formed or +a syntax error is found. +.LP +Before handling command line options and scripts, +.B lua +checks the contents of the environment variables +.B LUA_INIT_5_4 +and +.BR LUA_INIT , +in that order. +If the contents are of the form +.RI '@ filename ', +then +.I filename +is executed. +Otherwise, the contents are assumed to be a Lua statement and is executed. +When +.B LUA_INIT_5_4 +is defined, +.B LUA_INIT +is ignored. +.SH OPTIONS +.TP +.BI \-e " stat" +execute statement +.IR stat . +.TP +.B \-i +enter interactive mode after executing +.IR script . +.TP +.BI \-l " name" +require library +.I name +into global +.IR name . +.TP +.B \-v +show version information. +.TP +.B \-E +ignore environment variables. +.TP +.B \-W +turn warnings on. +.TP +.B \-\- +stop handling options. +.TP +.B \- +stop handling options and execute the standard input as a file. +.SH ENVIRONMENT VARIABLES +The following environment variables affect the execution of +.BR lua . +When defined, +the version-specific variants take priority +and the version-neutral variants are ignored. +.TP +.B LUA_INIT, LUA_INIT_5_4 +Code to be executed before command line options and scripts. +.TP +.B LUA_PATH, LUA_PATH_5_4 +Initial value of package.cpath, +the path used by require to search for Lua loaders. +.TP +.B LUA_CPATH, LUA_CPATH_5_4 +Initial value of package.cpath, +the path used by require to search for C loaders. +.SH EXIT STATUS +If a script calls os.exit, +then +.B lua +exits with the given exit status. +Otherwise, +.B lua +exits +with EXIT_SUCCESS (0 on POSIX systems) if there were no errors +and +with EXIT_FAILURE (1 on POSIX systems) if there were errors. +Errors raised in interactive mode do not cause exits. +.SH DIAGNOSTICS +Error messages should be self explanatory. +.SH "SEE ALSO" +.BR luac (1) +.br +The documentation at lua.org, +especially section 7 of the reference manual. +.SH AUTHORS +R. Ierusalimschy, +L. H. de Figueiredo, +W. Celes +.\" EOF diff --git a/lua-5.4.3/doc/lua.css b/lua-5.4.3/doc/lua.css new file mode 100644 index 0000000..cbd0799 --- /dev/null +++ b/lua-5.4.3/doc/lua.css @@ -0,0 +1,161 @@ +html { + background-color: #F8F8F8 ; +} + +body { + background-color: #FFFFFF ; + color: #000000 ; + font-family: Helvetica, Arial, sans-serif ; + text-align: justify ; + line-height: 1.25 ; + margin: 16px auto ; + padding: 32px ; + border: solid #ccc 1px ; + border-radius: 20px ; + max-width: 70em ; + width: 90% ; +} + +h1, h2, h3, h4 { + color: #000080 ; + font-family: Verdana, Geneva, sans-serif ; + font-weight: normal ; + font-style: normal ; + text-align: left ; +} + +h1 { + font-size: 28pt ; +} + +h1 img { + vertical-align: text-bottom ; +} + +h2:before { + content: "\2756" ; + padding-right: 0.5em ; +} + +a { + text-decoration: none ; +} + +a:link { + color: #000080 ; +} + +a:link:hover, a:visited:hover { + background-color: #D0D0FF ; + color: #000080 ; + border-radius: 4px ; +} + +a:link:active, a:visited:active { + color: #FF0000 ; +} + +div.menubar { + padding-bottom: 0.5em ; +} + +p.menubar { + margin-left: 2.5em ; +} + +.menubar a:hover { + margin: -3px -3px -3px -3px ; + padding: 3px 3px 3px 3px ; + border-radius: 4px ; +} + +:target { + background-color: #F0F0F0 ; + margin: -8px ; + padding: 8px ; + border-radius: 8px ; + outline: none ; +} + +hr { + display: none ; +} + +table hr { + background-color: #a0a0a0 ; + color: #a0a0a0 ; + border: 0 ; + height: 1px ; + display: block ; +} + +.footer { + color: gray ; + font-size: x-small ; + text-transform: lowercase ; +} + +input[type=text] { + border: solid #a0a0a0 2px ; + border-radius: 2em ; + background-image: url('images/search.png') ; + background-repeat: no-repeat ; + background-position: 4px center ; + padding-left: 20px ; + height: 2em ; +} + +pre.session { + background-color: #F8F8F8 ; + padding: 1em ; + border-radius: 8px ; +} + +table { + border: none ; + border-spacing: 0 ; + border-collapse: collapse ; +} + +td { + padding: 0 ; + margin: 0 ; +} + +td.gutter { + width: 4% ; +} + +table.columns td { + vertical-align: top ; + padding-bottom: 1em ; + text-align: justify ; + line-height: 1.25 ; +} + +table.book td { + vertical-align: top ; +} + +table.book td.cover { + padding-right: 1em ; +} + +table.book img { + border: solid #000080 1px ; +} + +table.book span { + font-size: small ; + text-align: left ; + display: block ; + margin-top: 0.25em ; +} + +p.logos a:link:hover, p.logos a:visited:hover { + background-color: inherit ; +} + +img { + background-color: white ; +} diff --git a/lua-5.4.3/doc/luac.1 b/lua-5.4.3/doc/luac.1 new file mode 100644 index 0000000..33a4ed0 --- /dev/null +++ b/lua-5.4.3/doc/luac.1 @@ -0,0 +1,118 @@ +.\" $Id: luac.man,v 1.29 2011/11/16 13:53:40 lhf Exp $ +.TH LUAC 1 "$Date: 2011/11/16 13:53:40 $" +.SH NAME +luac \- Lua compiler +.SH SYNOPSIS +.B luac +[ +.I options +] [ +.I filenames +] +.SH DESCRIPTION +.B luac +is the Lua compiler. +It translates programs written in the Lua programming language +into binary files containing precompiled chunks +that can be later loaded and executed. +.LP +The main advantages of precompiling chunks are: +faster loading, +protecting source code from accidental user changes, +and +off-line syntax checking. +Precompiling does not imply faster execution +because in Lua chunks are always compiled into bytecodes before being executed. +.B luac +simply allows those bytecodes to be saved in a file for later execution. +Precompiled chunks are not necessarily smaller than the corresponding source. +The main goal in precompiling is faster loading. +.LP +In the command line, +you can mix +text files containing Lua source and +binary files containing precompiled chunks. +.B luac +produces a single output file containing the combined bytecodes +for all files given. +Executing the combined file is equivalent to executing the given files. +By default, +the output file is named +.BR luac.out , +but you can change this with the +.B \-o +option. +.LP +Precompiled chunks are +.I not +portable across different architectures. +Moreover, +the internal format of precompiled chunks +is likely to change when a new version of Lua is released. +Make sure you save the source files of all Lua programs that you precompile. +.LP +.SH OPTIONS +.TP +.B \-l +produce a listing of the compiled bytecode for Lua's virtual machine. +Listing bytecodes is useful to learn about Lua's virtual machine. +If no files are given, then +.B luac +loads +.B luac.out +and lists its contents. +Use +.B \-l \-l +for a full listing. +.TP +.BI \-o " file" +output to +.IR file , +instead of the default +.BR luac.out . +(You can use +.B "'\-'" +for standard output, +but not on platforms that open standard output in text mode.) +The output file may be one of the given files because +all files are loaded before the output file is written. +Be careful not to overwrite precious files. +.TP +.B \-p +load files but do not generate any output file. +Used mainly for syntax checking and for testing precompiled chunks: +corrupted files will probably generate errors when loaded. +If no files are given, then +.B luac +loads +.B luac.out +and tests its contents. +No messages are displayed if the file loads without errors. +.TP +.B \-s +strip debug information before writing the output file. +This saves some space in very large chunks, +but if errors occur when running a stripped chunk, +then the error messages may not contain the full information they usually do. +In particular, +line numbers and names of local variables are lost. +.TP +.B \-v +show version information. +.TP +.B \-\- +stop handling options. +.TP +.B \- +stop handling options and process standard input. +.SH "SEE ALSO" +.BR lua (1) +.br +The documentation at lua.org. +.SH DIAGNOSTICS +Error messages should be self explanatory. +.SH AUTHORS +R. Ierusalimschy, +L. H. de Figueiredo, +W. Celes +.\" EOF diff --git a/lua-5.4.3/doc/manual.css b/lua-5.4.3/doc/manual.css new file mode 100644 index 0000000..aa0e677 --- /dev/null +++ b/lua-5.4.3/doc/manual.css @@ -0,0 +1,21 @@ +h3 code { + font-family: inherit ; + font-size: inherit ; +} + +pre, code { + font-size: 12pt ; +} + +span.apii { + color: gray ; + float: right ; + font-family: inherit ; + font-style: normal ; + font-size: small ; +} + +h2:before { + content: "" ; + padding-right: 0em ; +} diff --git a/lua-5.4.3/doc/manual.html b/lua-5.4.3/doc/manual.html new file mode 100644 index 0000000..b7f5d71 --- /dev/null +++ b/lua-5.4.3/doc/manual.html @@ -0,0 +1,11934 @@ + + + +Lua 5.4 Reference Manual + + + + + + + +

+Lua +Lua 5.4 Reference Manual +

+ +

+by Roberto Ierusalimschy, Luiz Henrique de Figueiredo, Waldemar Celes + +

+ +Copyright © 2020–2021 Lua.org, PUC-Rio. +Freely available under the terms of the +Lua license. + + +

+contents +· +index +· +other versions +
+ + +

+ + + + + + +

1 – Introduction

+ +

+Lua is a powerful, efficient, lightweight, embeddable scripting language. +It supports procedural programming, +object-oriented programming, functional programming, +data-driven programming, and data description. + + +

+Lua combines simple procedural syntax with powerful data description +constructs based on associative arrays and extensible semantics. +Lua is dynamically typed, +runs by interpreting bytecode with a register-based +virtual machine, +and has automatic memory management with +a generational garbage collection, +making it ideal for configuration, scripting, +and rapid prototyping. + + +

+Lua is implemented as a library, written in clean C, +the common subset of Standard C and C++. +The Lua distribution includes a host program called lua, +which uses the Lua library to offer a complete, +standalone Lua interpreter, +for interactive or batch use. +Lua is intended to be used both as a powerful, lightweight, +embeddable scripting language for any program that needs one, +and as a powerful but lightweight and efficient stand-alone language. + + +

+As an extension language, Lua has no notion of a "main" program: +it works embedded in a host client, +called the embedding program or simply the host. +(Frequently, this host is the stand-alone lua program.) +The host program can invoke functions to execute a piece of Lua code, +can write and read Lua variables, +and can register C functions to be called by Lua code. +Through the use of C functions, Lua can be augmented to cope with +a wide range of different domains, +thus creating customized programming languages sharing a syntactical framework. + + +

+Lua is free software, +and is provided as usual with no guarantees, +as stated in its license. +The implementation described in this manual is available +at Lua's official web site, www.lua.org. + + +

+Like any other reference manual, +this document is dry in places. +For a discussion of the decisions behind the design of Lua, +see the technical papers available at Lua's web site. +For a detailed introduction to programming in Lua, +see Roberto's book, Programming in Lua. + + + +

2 – Basic Concepts

+ + + +

+This section describes the basic concepts of the language. + + + + + +

2.1 – Values and Types

+ +

+Lua is a dynamically typed language. +This means that +variables do not have types; only values do. +There are no type definitions in the language. +All values carry their own type. + + +

+All values in Lua are first-class values. +This means that all values can be stored in variables, +passed as arguments to other functions, and returned as results. + + +

+There are eight basic types in Lua: +nil, boolean, number, +string, function, userdata, +thread, and table. +The type nil has one single value, nil, +whose main property is to be different from any other value; +it often represents the absence of a useful value. +The type boolean has two values, false and true. +Both nil and false make a condition false; +they are collectively called false values. +Any other value makes a condition true. +Despite its name, +false is frequently used as an alternative to nil, +with the key difference that false behaves +like a regular value in a table, +while a nil in a table represents an absent key. + + +

+The type number represents both +integer numbers and real (floating-point) numbers, +using two subtypes: integer and float. +Standard Lua uses 64-bit integers and double-precision (64-bit) floats, +but you can also compile Lua so that it +uses 32-bit integers and/or single-precision (32-bit) floats. +The option with 32 bits for both integers and floats +is particularly attractive +for small machines and embedded systems. +(See macro LUA_32BITS in file luaconf.h.) + + +

+Unless stated otherwise, +any overflow when manipulating integer values wrap around, +according to the usual rules of two-complement arithmetic. +(In other words, +the actual result is the unique representable integer +that is equal modulo 2n to the mathematical result, +where n is the number of bits of the integer type.) + + +

+Lua has explicit rules about when each subtype is used, +but it also converts between them automatically as needed (see §3.4.3). +Therefore, +the programmer may choose to mostly ignore the difference +between integers and floats +or to assume complete control over the representation of each number. + + +

+The type string represents immutable sequences of bytes. + +Lua is 8-bit clean: +strings can contain any 8-bit value, +including embedded zeros ('\0'). +Lua is also encoding-agnostic; +it makes no assumptions about the contents of a string. +The length of any string in Lua must fit in a Lua integer. + + +

+Lua can call (and manipulate) functions written in Lua and +functions written in C (see §3.4.10). +Both are represented by the type function. + + +

+The type userdata is provided to allow arbitrary C data to +be stored in Lua variables. +A userdata value represents a block of raw memory. +There are two kinds of userdata: +full userdata, +which is an object with a block of memory managed by Lua, +and light userdata, +which is simply a C pointer value. +Userdata has no predefined operations in Lua, +except assignment and identity test. +By using metatables, +the programmer can define operations for full userdata values +(see §2.4). +Userdata values cannot be created or modified in Lua, +only through the C API. +This guarantees the integrity of data owned by +the host program and C libraries. + + +

+The type thread represents independent threads of execution +and it is used to implement coroutines (see §2.6). +Lua threads are not related to operating-system threads. +Lua supports coroutines on all systems, +even those that do not support threads natively. + + +

+The type table implements associative arrays, +that is, arrays that can have as indices not only numbers, +but any Lua value except nil and NaN. +(Not a Number is a special floating-point value +used by the IEEE 754 standard to represent +undefined numerical results, such as 0/0.) +Tables can be heterogeneous; +that is, they can contain values of all types (except nil). +Any key associated to the value nil is not considered part of the table. +Conversely, any key that is not part of a table has +an associated value nil. + + +

+Tables are the sole data-structuring mechanism in Lua; +they can be used to represent ordinary arrays, lists, +symbol tables, sets, records, graphs, trees, etc. +To represent records, Lua uses the field name as an index. +The language supports this representation by +providing a.name as syntactic sugar for a["name"]. +There are several convenient ways to create tables in Lua +(see §3.4.9). + + +

+Like indices, +the values of table fields can be of any type. +In particular, +because functions are first-class values, +table fields can contain functions. +Thus tables can also carry methods (see §3.4.11). + + +

+The indexing of tables follows +the definition of raw equality in the language. +The expressions a[i] and a[j] +denote the same table element +if and only if i and j are raw equal +(that is, equal without metamethods). +In particular, floats with integral values +are equal to their respective integers +(e.g., 1.0 == 1). +To avoid ambiguities, +any float used as a key that is equal to an integer +is converted to that integer. +For instance, if you write a[2.0] = true, +the actual key inserted into the table will be the integer 2. + + +

+Tables, functions, threads, and (full) userdata values are objects: +variables do not actually contain these values, +only references to them. +Assignment, parameter passing, and function returns +always manipulate references to such values; +these operations do not imply any kind of copy. + + +

+The library function type returns a string describing the type +of a given value (see type). + + + + + +

2.2 – Environments and the Global Environment

+ +

+As we will discuss further in §3.2 and §3.3.3, +any reference to a free name +(that is, a name not bound to any declaration) var +is syntactically translated to _ENV.var. +Moreover, every chunk is compiled in the scope of +an external local variable named _ENV (see §3.3.2), +so _ENV itself is never a free name in a chunk. + + +

+Despite the existence of this external _ENV variable and +the translation of free names, +_ENV is a completely regular name. +In particular, +you can define new variables and parameters with that name. +Each reference to a free name uses the _ENV that is +visible at that point in the program, +following the usual visibility rules of Lua (see §3.5). + + +

+Any table used as the value of _ENV is called an environment. + + +

+Lua keeps a distinguished environment called the global environment. +This value is kept at a special index in the C registry (see §4.3). +In Lua, the global variable _G is initialized with this same value. +(_G is never used internally, +so changing its value will affect only your own code.) + + +

+When Lua loads a chunk, +the default value for its _ENV variable +is the global environment (see load). +Therefore, by default, +free names in Lua code refer to entries in the global environment +and, therefore, they are also called global variables. +Moreover, all standard libraries are loaded in the global environment +and some functions there operate on that environment. +You can use load (or loadfile) +to load a chunk with a different environment. +(In C, you have to load the chunk and then change the value +of its first upvalue; see lua_setupvalue.) + + + + + +

2.3 – Error Handling

+ +

+Several operations in Lua can raise an error. +An error interrupts the normal flow of the program, +which can continue by catching the error. + + +

+Lua code can explicitly raise an error by calling the +error function. +(This function never returns.) + + +

+To catch errors in Lua, +you can do a protected call, +using pcall (or xpcall). +The function pcall calls a given function in protected mode. +Any error while running the function stops its execution, +and control returns immediately to pcall, +which returns a status code. + + +

+Because Lua is an embedded extension language, +Lua code starts running by a call +from C code in the host program. +(When you use Lua standalone, +the lua application is the host program.) +Usually, this call is protected; +so, when an otherwise unprotected error occurs during +the compilation or execution of a Lua chunk, +control returns to the host, +which can take appropriate measures, +such as printing an error message. + + +

+Whenever there is an error, +an error object +is propagated with information about the error. +Lua itself only generates errors whose error object is a string, +but programs may generate errors with +any value as the error object. +It is up to the Lua program or its host to handle such error objects. +For historical reasons, +an error object is often called an error message, +even though it does not have to be a string. + + +

+When you use xpcall (or lua_pcall, in C) +you may give a message handler +to be called in case of errors. +This function is called with the original error object +and returns a new error object. +It is called before the error unwinds the stack, +so that it can gather more information about the error, +for instance by inspecting the stack and creating a stack traceback. +This message handler is still protected by the protected call; +so, an error inside the message handler +will call the message handler again. +If this loop goes on for too long, +Lua breaks it and returns an appropriate message. +The message handler is called only for regular runtime errors. +It is not called for memory-allocation errors +nor for errors while running finalizers or other message handlers. + + +

+Lua also offers a system of warnings (see warn). +Unlike errors, warnings do not interfere +in any way with program execution. +They typically only generate a message to the user, +although this behavior can be adapted from C (see lua_setwarnf). + + + + + +

2.4 – Metatables and Metamethods

+ +

+Every value in Lua can have a metatable. +This metatable is an ordinary Lua table +that defines the behavior of the original value +under certain events. +You can change several aspects of the behavior +of a value by setting specific fields in its metatable. +For instance, when a non-numeric value is the operand of an addition, +Lua checks for a function in the field __add of the value's metatable. +If it finds one, +Lua calls this function to perform the addition. + + +

+The key for each event in a metatable is a string +with the event name prefixed by two underscores; +the corresponding value is called a metavalue. +For most events, the metavalue must be a function, +which is then called a metamethod. +In the previous example, the key is the string "__add" +and the metamethod is the function that performs the addition. +Unless stated otherwise, +a metamethod may in fact be any callable value, +which is either a function or a value with a __call metamethod. + + +

+You can query the metatable of any value +using the getmetatable function. +Lua queries metamethods in metatables using a raw access (see rawget). + + +

+You can replace the metatable of tables +using the setmetatable function. +You cannot change the metatable of other types from Lua code, +except by using the debug library (§6.10). + + +

+Tables and full userdata have individual metatables, +although multiple tables and userdata can share their metatables. +Values of all other types share one single metatable per type; +that is, there is one single metatable for all numbers, +one for all strings, etc. +By default, a value has no metatable, +but the string library sets a metatable for the string type (see §6.4). + + +

+A detailed list of operations controlled by metatables is given next. +Each event is identified by its corresponding key. +By convention, all metatable keys used by Lua are composed by +two underscores followed by lowercase Latin letters. + + + +

    + +
  • __add: +the addition (+) operation. +If any operand for an addition is not a number, +Lua will try to call a metamethod. +It starts by checking the first operand (even if it is a number); +if that operand does not define a metamethod for __add, +then Lua will check the second operand. +If Lua can find a metamethod, +it calls the metamethod with the two operands as arguments, +and the result of the call +(adjusted to one value) +is the result of the operation. +Otherwise, if no metamethod is found, +Lua raises an error. +
    • + +
  • __sub: +the subtraction (-) operation. +Behavior similar to the addition operation. +
    • + +
  • __mul: +the multiplication (*) operation. +Behavior similar to the addition operation. +
    • + +
  • __div: +the division (/) operation. +Behavior similar to the addition operation. +
    • + +
  • __mod: +the modulo (%) operation. +Behavior similar to the addition operation. +
    • + +
  • __pow: +the exponentiation (^) operation. +Behavior similar to the addition operation. +
    • + +
  • __unm: +the negation (unary -) operation. +Behavior similar to the addition operation. +
    • + +
  • __idiv: +the floor division (//) operation. +Behavior similar to the addition operation. +
    • + +
  • __band: +the bitwise AND (&) operation. +Behavior similar to the addition operation, +except that Lua will try a metamethod +if any operand is neither an integer +nor a float coercible to an integer (see §3.4.3). +
    • + +
  • __bor: +the bitwise OR (|) operation. +Behavior similar to the bitwise AND operation. +
    • + +
  • __bxor: +the bitwise exclusive OR (binary ~) operation. +Behavior similar to the bitwise AND operation. +
    • + +
  • __bnot: +the bitwise NOT (unary ~) operation. +Behavior similar to the bitwise AND operation. +
    • + +
  • __shl: +the bitwise left shift (<<) operation. +Behavior similar to the bitwise AND operation. +
    • + +
  • __shr: +the bitwise right shift (>>) operation. +Behavior similar to the bitwise AND operation. +
    • + +
  • __concat: +the concatenation (..) operation. +Behavior similar to the addition operation, +except that Lua will try a metamethod +if any operand is neither a string nor a number +(which is always coercible to a string). +
    • + +
  • __len: +the length (#) operation. +If the object is not a string, +Lua will try its metamethod. +If there is a metamethod, +Lua calls it with the object as argument, +and the result of the call +(always adjusted to one value) +is the result of the operation. +If there is no metamethod but the object is a table, +then Lua uses the table length operation (see §3.4.7). +Otherwise, Lua raises an error. +
    • + +
  • __eq: +the equal (==) operation. +Behavior similar to the addition operation, +except that Lua will try a metamethod only when the values +being compared are either both tables or both full userdata +and they are not primitively equal. +The result of the call is always converted to a boolean. +
    • + +
  • __lt: +the less than (<) operation. +Behavior similar to the addition operation, +except that Lua will try a metamethod only when the values +being compared are neither both numbers nor both strings. +Moreover, the result of the call is always converted to a boolean. +
    • + +
  • __le: +the less equal (<=) operation. +Behavior similar to the less than operation. +
    • + +
  • __index: +The indexing access operation table[key]. +This event happens when table is not a table or +when key is not present in table. +The metavalue is looked up in the metatable of table. + + +

    +The metavalue for this event can be either a function, a table, +or any value with an __index metavalue. +If it is a function, +it is called with table and key as arguments, +and the result of the call +(adjusted to one value) +is the result of the operation. +Otherwise, +the final result is the result of indexing this metavalue with key. +This indexing is regular, not raw, +and therefore can trigger another __index metavalue. +

    • + +
  • __newindex: +The indexing assignment table[key] = value. +Like the index event, +this event happens when table is not a table or +when key is not present in table. +The metavalue is looked up in the metatable of table. + + +

    +Like with indexing, +the metavalue for this event can be either a function, a table, +or any value with an __newindex metavalue. +If it is a function, +it is called with table, key, and value as arguments. +Otherwise, +Lua repeats the indexing assignment over this metavalue +with the same key and value. +This assignment is regular, not raw, +and therefore can trigger another __newindex metavalue. + + +

    +Whenever a __newindex metavalue is invoked, +Lua does not perform the primitive assignment. +If needed, +the metamethod itself can call rawset +to do the assignment. +

    • + +
  • __call: +The call operation func(args). +This event happens when Lua tries to call a non-function value +(that is, func is not a function). +The metamethod is looked up in func. +If present, +the metamethod is called with func as its first argument, +followed by the arguments of the original call (args). +All results of the call +are the results of the operation. +This is the only metamethod that allows multiple results. +
    • + +
+ +

+In addition to the previous list, +the interpreter also respects the following keys in metatables: +__gc (see §2.5.3), +__close (see §3.3.8), +__mode (see §2.5.4), +and __name. +(The entry __name, +when it contains a string, +may be used by tostring and in error messages.) + + +

+For the unary operators (negation, length, and bitwise NOT), +the metamethod is computed and called with a dummy second operand, +equal to the first one. +This extra operand is only to simplify Lua's internals +(by making these operators behave like a binary operation) +and may be removed in future versions. +For most uses this extra operand is irrelevant. + + +

+Because metatables are regular tables, +they can contain arbitrary fields, +not only the event names defined above. +Some functions in the standard library +(e.g., tostring) +use other fields in metatables for their own purposes. + + +

+It is a good practice to add all needed metamethods to a table +before setting it as a metatable of some object. +In particular, the __gc metamethod works only when this order +is followed (see §2.5.3). +It is also a good practice to set the metatable of an object +right after its creation. + + + + + +

2.5 – Garbage Collection

+ + + +

+Lua performs automatic memory management. +This means that +you do not have to worry about allocating memory for new objects +or freeing it when the objects are no longer needed. +Lua manages memory automatically by running +a garbage collector to collect all dead objects. +All memory used by Lua is subject to automatic management: +strings, tables, userdata, functions, threads, internal structures, etc. + + +

+An object is considered dead +as soon as the collector can be sure the object +will not be accessed again in the normal execution of the program. +("Normal execution" here excludes finalizers, +which can resurrect dead objects (see §2.5.3), +and excludes also operations using the debug library.) +Note that the time when the collector can be sure that an object +is dead may not coincide with the programmer's expectations. +The only guarantees are that Lua will not collect an object +that may still be accessed in the normal execution of the program, +and it will eventually collect an object +that is inaccessible from Lua. +(Here, +inaccessible from Lua means that neither a variable nor +another live object refer to the object.) +Because Lua has no knowledge about C code, +it never collects objects accessible through the registry (see §4.3), +which includes the global environment (see §2.2). + + +

+The garbage collector (GC) in Lua can work in two modes: +incremental and generational. + + +

+The default GC mode with the default parameters +are adequate for most uses. +However, programs that waste a large proportion of their time +allocating and freeing memory can benefit from other settings. +Keep in mind that the GC behavior is non-portable +both across platforms and across different Lua releases; +therefore, optimal settings are also non-portable. + + +

+You can change the GC mode and parameters by calling +lua_gc in C +or collectgarbage in Lua. +You can also use these functions to control +the collector directly (e.g., to stop and restart it). + + + + + +

2.5.1 – Incremental Garbage Collection

+ +

+In incremental mode, +each GC cycle performs a mark-and-sweep collection in small steps +interleaved with the program's execution. +In this mode, +the collector uses three numbers to control its garbage-collection cycles: +the garbage-collector pause, +the garbage-collector step multiplier, +and the garbage-collector step size. + + +

+The garbage-collector pause +controls how long the collector waits before starting a new cycle. +The collector starts a new cycle when the use of memory +hits n% of the use after the previous collection. +Larger values make the collector less aggressive. +Values equal to or less than 100 mean the collector will not wait to +start a new cycle. +A value of 200 means that the collector waits for the total memory in use +to double before starting a new cycle. +The default value is 200; the maximum value is 1000. + + +

+The garbage-collector step multiplier +controls the speed of the collector relative to +memory allocation, +that is, +how many elements it marks or sweeps for each +kilobyte of memory allocated. +Larger values make the collector more aggressive but also increase +the size of each incremental step. +You should not use values less than 100, +because they make the collector too slow and +can result in the collector never finishing a cycle. +The default value is 100; the maximum value is 1000. + + +

+The garbage-collector step size controls the +size of each incremental step, +specifically how many bytes the interpreter allocates +before performing a step. +This parameter is logarithmic: +A value of n means the interpreter will allocate 2n +bytes between steps and perform equivalent work during the step. +A large value (e.g., 60) makes the collector a stop-the-world +(non-incremental) collector. +The default value is 13, +which means steps of approximately 8 Kbytes. + + + + + +

2.5.2 – Generational Garbage Collection

+ +

+In generational mode, +the collector does frequent minor collections, +which traverses only objects recently created. +If after a minor collection the use of memory is still above a limit, +the collector does a stop-the-world major collection, +which traverses all objects. +The generational mode uses two parameters: +the minor multiplier and the the major multiplier. + + +

+The minor multiplier controls the frequency of minor collections. +For a minor multiplier x, +a new minor collection will be done when memory +grows x% larger than the memory in use after the previous major +collection. +For instance, for a multiplier of 20, +the collector will do a minor collection when the use of memory +gets 20% larger than the use after the previous major collection. +The default value is 20; the maximum value is 200. + + +

+The major multiplier controls the frequency of major collections. +For a major multiplier x, +a new major collection will be done when memory +grows x% larger than the memory in use after the previous major +collection. +For instance, for a multiplier of 100, +the collector will do a major collection when the use of memory +gets larger than twice the use after the previous collection. +The default value is 100; the maximum value is 1000. + + + + + +

2.5.3 – Garbage-Collection Metamethods

+ +

+You can set garbage-collector metamethods for tables +and, using the C API, +for full userdata (see §2.4). +These metamethods, called finalizers, +are called when the garbage collector detects that the +corresponding table or userdata is dead. +Finalizers allow you to coordinate Lua's garbage collection +with external resource management such as closing files, +network or database connections, +or freeing your own memory. + + +

+For an object (table or userdata) to be finalized when collected, +you must mark it for finalization. + +You mark an object for finalization when you set its metatable +and the metatable has a __gc metamethod. +Note that if you set a metatable without a __gc field +and later create that field in the metatable, +the object will not be marked for finalization. + + +

+When a marked object becomes dead, +it is not collected immediately by the garbage collector. +Instead, Lua puts it in a list. +After the collection, +Lua goes through that list. +For each object in the list, +it checks the object's __gc metamethod: +If it is present, +Lua calls it with the object as its single argument. + + +

+At the end of each garbage-collection cycle, +the finalizers are called in +the reverse order that the objects were marked for finalization, +among those collected in that cycle; +that is, the first finalizer to be called is the one associated +with the object marked last in the program. +The execution of each finalizer may occur at any point during +the execution of the regular code. + + +

+Because the object being collected must still be used by the finalizer, +that object (and other objects accessible only through it) +must be resurrected by Lua. +Usually, this resurrection is transient, +and the object memory is freed in the next garbage-collection cycle. +However, if the finalizer stores the object in some global place +(e.g., a global variable), +then the resurrection is permanent. +Moreover, if the finalizer marks a finalizing object for finalization again, +its finalizer will be called again in the next cycle where the +object is dead. +In any case, +the object memory is freed only in a GC cycle where +the object is dead and not marked for finalization. + + +

+When you close a state (see lua_close), +Lua calls the finalizers of all objects marked for finalization, +following the reverse order that they were marked. +If any finalizer marks objects for collection during that phase, +these marks have no effect. + + +

+Finalizers cannot yield. +Except for that, they can do anything, +such as raise errors, create new objects, +or even run the garbage collector. +However, because they can run in unpredictable times, +it is good practice to restrict each finalizer +to the minimum necessary to properly release +its associated resource. + + +

+Any error while running a finalizer generates a warning; +the error is not propagated. + + + + + +

2.5.4 – Weak Tables

+ +

+A weak table is a table whose elements are +weak references. +A weak reference is ignored by the garbage collector. +In other words, +if the only references to an object are weak references, +then the garbage collector will collect that object. + + +

+A weak table can have weak keys, weak values, or both. +A table with weak values allows the collection of its values, +but prevents the collection of its keys. +A table with both weak keys and weak values allows the collection of +both keys and values. +In any case, if either the key or the value is collected, +the whole pair is removed from the table. +The weakness of a table is controlled by the +__mode field of its metatable. +This metavalue, if present, must be one of the following strings: +"k", for a table with weak keys; +"v", for a table with weak values; +or "kv", for a table with both weak keys and values. + + +

+A table with weak keys and strong values +is also called an ephemeron table. +In an ephemeron table, +a value is considered reachable only if its key is reachable. +In particular, +if the only reference to a key comes through its value, +the pair is removed. + + +

+Any change in the weakness of a table may take effect only +at the next collect cycle. +In particular, if you change the weakness to a stronger mode, +Lua may still collect some items from that table +before the change takes effect. + + +

+Only objects that have an explicit construction +are removed from weak tables. +Values, such as numbers and light C functions, +are not subject to garbage collection, +and therefore are not removed from weak tables +(unless their associated values are collected). +Although strings are subject to garbage collection, +they do not have an explicit construction and +their equality is by value; +they behave more like values than like objects. +Therefore, they are not removed from weak tables. + + +

+Resurrected objects +(that is, objects being finalized +and objects accessible only through objects being finalized) +have a special behavior in weak tables. +They are removed from weak values before running their finalizers, +but are removed from weak keys only in the next collection +after running their finalizers, when such objects are actually freed. +This behavior allows the finalizer to access properties +associated with the object through weak tables. + + +

+If a weak table is among the resurrected objects in a collection cycle, +it may not be properly cleared until the next cycle. + + + + + + + +

2.6 – Coroutines

+ +

+Lua supports coroutines, +also called collaborative multithreading. +A coroutine in Lua represents an independent thread of execution. +Unlike threads in multithread systems, however, +a coroutine only suspends its execution by explicitly calling +a yield function. + + +

+You create a coroutine by calling coroutine.create. +Its sole argument is a function +that is the main function of the coroutine. +The create function only creates a new coroutine and +returns a handle to it (an object of type thread); +it does not start the coroutine. + + +

+You execute a coroutine by calling coroutine.resume. +When you first call coroutine.resume, +passing as its first argument +a thread returned by coroutine.create, +the coroutine starts its execution by +calling its main function. +Extra arguments passed to coroutine.resume are passed +as arguments to that function. +After the coroutine starts running, +it runs until it terminates or yields. + + +

+A coroutine can terminate its execution in two ways: +normally, when its main function returns +(explicitly or implicitly, after the last instruction); +and abnormally, if there is an unprotected error. +In case of normal termination, +coroutine.resume returns true, +plus any values returned by the coroutine main function. +In case of errors, coroutine.resume returns false +plus the error object. +In this case, the coroutine does not unwind its stack, +so that it is possible to inspect it after the error +with the debug API. + + +

+A coroutine yields by calling coroutine.yield. +When a coroutine yields, +the corresponding coroutine.resume returns immediately, +even if the yield happens inside nested function calls +(that is, not in the main function, +but in a function directly or indirectly called by the main function). +In the case of a yield, coroutine.resume also returns true, +plus any values passed to coroutine.yield. +The next time you resume the same coroutine, +it continues its execution from the point where it yielded, +with the call to coroutine.yield returning any extra +arguments passed to coroutine.resume. + + +

+Like coroutine.create, +the coroutine.wrap function also creates a coroutine, +but instead of returning the coroutine itself, +it returns a function that, when called, resumes the coroutine. +Any arguments passed to this function +go as extra arguments to coroutine.resume. +coroutine.wrap returns all the values returned by coroutine.resume, +except the first one (the boolean error code). +Unlike coroutine.resume, +the function created by coroutine.wrap +propagates any error to the caller. +In this case, +the function also closes the coroutine (see coroutine.close). + + +

+As an example of how coroutines work, +consider the following code: + +

+     function foo (a)
+       print("foo", a)
+       return coroutine.yield(2*a)
+     end
+     
+     co = coroutine.create(function (a,b)
+           print("co-body", a, b)
+           local r = foo(a+1)
+           print("co-body", r)
+           local r, s = coroutine.yield(a+b, a-b)
+           print("co-body", r, s)
+           return b, "end"
+     end)
+     
+     print("main", coroutine.resume(co, 1, 10))
+     print("main", coroutine.resume(co, "r"))
+     print("main", coroutine.resume(co, "x", "y"))
+     print("main", coroutine.resume(co, "x", "y"))
+

+When you run it, it produces the following output: + +

+     co-body 1       10
+     foo     2
+     main    true    4
+     co-body r
+     main    true    11      -9
+     co-body x       y
+     main    true    10      end
+     main    false   cannot resume dead coroutine
+
+ +

+You can also create and manipulate coroutines through the C API: +see functions lua_newthread, lua_resume, +and lua_yield. + + + + + +

3 – The Language

+ + + +

+This section describes the lexis, the syntax, and the semantics of Lua. +In other words, +this section describes +which tokens are valid, +how they can be combined, +and what their combinations mean. + + +

+Language constructs will be explained using the usual extended BNF notation, +in which +{a} means 0 or more a's, and +[a] means an optional a. +Non-terminals are shown like non-terminal, +keywords are shown like kword, +and other terminal symbols are shown like ‘=’. +The complete syntax of Lua can be found in §9 +at the end of this manual. + + + + + +

3.1 – Lexical Conventions

+ +

+Lua is a free-form language. +It ignores spaces and comments between lexical elements (tokens), +except as delimiters between two tokens. +In source code, +Lua recognizes as spaces the standard ASCII whitespace +characters space, form feed, newline, +carriage return, horizontal tab, and vertical tab. + + +

+Names +(also called identifiers) +in Lua can be any string of Latin letters, +Arabic-Indic digits, and underscores, +not beginning with a digit and +not being a reserved word. +Identifiers are used to name variables, table fields, and labels. + + +

+The following keywords are reserved +and cannot be used as names: + + +

+     and       break     do        else      elseif    end
+     false     for       function  goto      if        in
+     local     nil       not       or        repeat    return
+     then      true      until     while
+
+ +

+Lua is a case-sensitive language: +and is a reserved word, but And and AND +are two different, valid names. +As a convention, +programs should avoid creating +names that start with an underscore followed by +one or more uppercase letters (such as _VERSION). + + +

+The following strings denote other tokens: + +

+     +     -     *     /     %     ^     #
+     &     ~     |     <<    >>    //
+     ==    ~=    <=    >=    <     >     =
+     (     )     {     }     [     ]     ::
+     ;     :     ,     .     ..    ...
+
+ +

+A short literal string +can be delimited by matching single or double quotes, +and can contain the following C-like escape sequences: +'\a' (bell), +'\b' (backspace), +'\f' (form feed), +'\n' (newline), +'\r' (carriage return), +'\t' (horizontal tab), +'\v' (vertical tab), +'\\' (backslash), +'\"' (quotation mark [double quote]), +and '\'' (apostrophe [single quote]). +A backslash followed by a line break +results in a newline in the string. +The escape sequence '\z' skips the following span +of whitespace characters, +including line breaks; +it is particularly useful to break and indent a long literal string +into multiple lines without adding the newlines and spaces +into the string contents. +A short literal string cannot contain unescaped line breaks +nor escapes not forming a valid escape sequence. + + +

+We can specify any byte in a short literal string, +including embedded zeros, +by its numeric value. +This can be done +with the escape sequence \xXX, +where XX is a sequence of exactly two hexadecimal digits, +or with the escape sequence \ddd, +where ddd is a sequence of up to three decimal digits. +(Note that if a decimal escape sequence is to be followed by a digit, +it must be expressed using exactly three digits.) + + +

+The UTF-8 encoding of a Unicode character +can be inserted in a literal string with +the escape sequence \u{XXX} +(with mandatory enclosing braces), +where XXX is a sequence of one or more hexadecimal digits +representing the character code point. +This code point can be any value less than 231. +(Lua uses the original UTF-8 specification here, +which is not restricted to valid Unicode code points.) + + +

+Literal strings can also be defined using a long format +enclosed by long brackets. +We define an opening long bracket of level n as an opening +square bracket followed by n equal signs followed by another +opening square bracket. +So, an opening long bracket of level 0 is written as [[, +an opening long bracket of level 1 is written as [=[, +and so on. +A closing long bracket is defined similarly; +for instance, +a closing long bracket of level 4 is written as ]====]. +A long literal starts with an opening long bracket of any level and +ends at the first closing long bracket of the same level. +It can contain any text except a closing bracket of the same level. +Literals in this bracketed form can run for several lines, +do not interpret any escape sequences, +and ignore long brackets of any other level. +Any kind of end-of-line sequence +(carriage return, newline, carriage return followed by newline, +or newline followed by carriage return) +is converted to a simple newline. +When the opening long bracket is immediately followed by a newline, +the newline is not included in the string. + + +

+As an example, in a system using ASCII +(in which 'a' is coded as 97, +newline is coded as 10, and '1' is coded as 49), +the five literal strings below denote the same string: + +

+     a = 'alo\n123"'
+     a = "alo\n123\""
+     a = '\97lo\10\04923"'
+     a = [[alo
+     123"]]
+     a = [==[
+     alo
+     123"]==]
+
+ +

+Any byte in a literal string not +explicitly affected by the previous rules represents itself. +However, Lua opens files for parsing in text mode, +and the system's file functions may have problems with +some control characters. +So, it is safer to represent +binary data as a quoted literal with +explicit escape sequences for the non-text characters. + + +

+A numeric constant (or numeral) +can be written with an optional fractional part +and an optional decimal exponent, +marked by a letter 'e' or 'E'. +Lua also accepts hexadecimal constants, +which start with 0x or 0X. +Hexadecimal constants also accept an optional fractional part +plus an optional binary exponent, +marked by a letter 'p' or 'P'. + + +

+A numeric constant with a radix point or an exponent +denotes a float; +otherwise, +if its value fits in an integer or it is a hexadecimal constant, +it denotes an integer; +otherwise (that is, a decimal integer numeral that overflows), +it denotes a float. +Hexadecimal numerals with neither a radix point nor an exponent +always denote an integer value; +if the value overflows, it wraps around +to fit into a valid integer. + + +

+Examples of valid integer constants are + +

+     3   345   0xff   0xBEBADA
+

+Examples of valid float constants are + +

+     3.0     3.1416     314.16e-2     0.31416E1     34e1
+     0x0.1E  0xA23p-4   0X1.921FB54442D18P+1
+
+ +

+A comment starts with a double hyphen (--) +anywhere outside a string. +If the text immediately after -- is not an opening long bracket, +the comment is a short comment, +which runs until the end of the line. +Otherwise, it is a long comment, +which runs until the corresponding closing long bracket. + + + + + +

3.2 – Variables

+ +

+Variables are places that store values. +There are three kinds of variables in Lua: +global variables, local variables, and table fields. + + +

+A single name can denote a global variable or a local variable +(or a function's formal parameter, +which is a particular kind of local variable): + +

+	var ::= Name
+

+Name denotes identifiers (see §3.1). + + +

+Any variable name is assumed to be global unless explicitly declared +as a local (see §3.3.7). +Local variables are lexically scoped: +local variables can be freely accessed by functions +defined inside their scope (see §3.5). + + +

+Before the first assignment to a variable, its value is nil. + + +

+Square brackets are used to index a table: + +

+	var ::= prefixexp ‘[’ exp ‘]’
+

+The meaning of accesses to table fields can be changed via metatables +(see §2.4). + + +

+The syntax var.Name is just syntactic sugar for +var["Name"]: + +

+	var ::= prefixexp ‘.’ Name
+
+ +

+An access to a global variable x +is equivalent to _ENV.x. +Due to the way that chunks are compiled, +the variable _ENV itself is never global (see §2.2). + + + + + +

3.3 – Statements

+ + + +

+Lua supports an almost conventional set of statements, +similar to those in other conventional languages. +This set includes +blocks, assignments, control structures, function calls, +and variable declarations. + + + + + +

3.3.1 – Blocks

+ +

+A block is a list of statements, +which are executed sequentially: + +

+	block ::= {stat}
+

+Lua has empty statements +that allow you to separate statements with semicolons, +start a block with a semicolon +or write two semicolons in sequence: + +

+	stat ::= ‘;’
+
+ +

+Both function calls and assignments +can start with an open parenthesis. +This possibility leads to an ambiguity in Lua's grammar. +Consider the following fragment: + +

+     a = b + c
+     (print or io.write)('done')
+

+The grammar could see this fragment in two ways: + +

+     a = b + c(print or io.write)('done')
+     
+     a = b + c; (print or io.write)('done')
+

+The current parser always sees such constructions +in the first way, +interpreting the open parenthesis +as the start of the arguments to a call. +To avoid this ambiguity, +it is a good practice to always precede with a semicolon +statements that start with a parenthesis: + +

+     ;(print or io.write)('done')
+
+ +

+A block can be explicitly delimited to produce a single statement: + +

+	stat ::= do block end
+

+Explicit blocks are useful +to control the scope of variable declarations. +Explicit blocks are also sometimes used to +add a return statement in the middle +of another block (see §3.3.4). + + + + + +

3.3.2 – Chunks

+ +

+The unit of compilation of Lua is called a chunk. +Syntactically, +a chunk is simply a block: + +

+	chunk ::= block
+
+ +

+Lua handles a chunk as the body of an anonymous function +with a variable number of arguments +(see §3.4.11). +As such, chunks can define local variables, +receive arguments, and return values. +Moreover, such anonymous function is compiled as in the +scope of an external local variable called _ENV (see §2.2). +The resulting function always has _ENV as its only external variable, +even if it does not use that variable. + + +

+A chunk can be stored in a file or in a string inside the host program. +To execute a chunk, +Lua first loads it, +precompiling the chunk's code into instructions for a virtual machine, +and then Lua executes the compiled code +with an interpreter for the virtual machine. + + +

+Chunks can also be precompiled into binary form; +see the program luac and the function string.dump for details. +Programs in source and compiled forms are interchangeable; +Lua automatically detects the file type and acts accordingly (see load). + + + + + +

3.3.3 – Assignment

+ +

+Lua allows multiple assignments. +Therefore, the syntax for assignment +defines a list of variables on the left side +and a list of expressions on the right side. +The elements in both lists are separated by commas: + +

+	stat ::= varlist ‘=’ explist
+	varlist ::= var {‘,’ var}
+	explist ::= exp {‘,’ exp}
+

+Expressions are discussed in §3.4. + + +

+Before the assignment, +the list of values is adjusted to the length of +the list of variables. +If there are more values than needed, +the excess values are thrown away. +If there are fewer values than needed, +the list is extended with nil's. +If the list of expressions ends with a function call, +then all values returned by that call enter the list of values, +before the adjustment +(except when the call is enclosed in parentheses; see §3.4). + + +

+The assignment statement first evaluates all its expressions +and only then the assignments are performed. +Thus the code + +

+     i = 3
+     i, a[i] = i+1, 20
+

+sets a[3] to 20, without affecting a[4] +because the i in a[i] is evaluated (to 3) +before it is assigned 4. +Similarly, the line + +

+     x, y = y, x
+

+exchanges the values of x and y, +and + +

+     x, y, z = y, z, x
+

+cyclically permutes the values of x, y, and z. + + +

+An assignment to a global name x = val +is equivalent to the assignment +_ENV.x = val (see §2.2). + + +

+The meaning of assignments to table fields and +global variables (which are actually table fields, too) +can be changed via metatables (see §2.4). + + + + + +

3.3.4 – Control Structures

+The control structures +if, while, and repeat have the usual meaning and +familiar syntax: + + + + +

+	stat ::= while exp do block end
+	stat ::= repeat block until exp
+	stat ::= if exp then block {elseif exp then block} [else block] end
+

+Lua also has a for statement, in two flavors (see §3.3.5). + + +

+The condition expression of a +control structure can return any value. +Both false and nil test false. +All values different from nil and false test true. +In particular, the number 0 and the empty string also test true. + + +

+In the repeat–until loop, +the inner block does not end at the until keyword, +but only after the condition. +So, the condition can refer to local variables +declared inside the loop block. + + +

+The goto statement transfers the program control to a label. +For syntactical reasons, +labels in Lua are considered statements too: + + + +

+	stat ::= goto Name
+	stat ::= label
+	label ::= ‘::’ Name ‘::’
+
+ +

+A label is visible in the entire block where it is defined, +except inside nested functions. +A goto may jump to any visible label as long as it does not +enter into the scope of a local variable. +A label should not be declared +where a label with the same name is visible, +even if this other label has been declared in an enclosing block. + + +

+Labels and empty statements are called void statements, +as they perform no actions. + + +

+The break statement terminates the execution of a +while, repeat, or for loop, +skipping to the next statement after the loop: + + +

+	stat ::= break
+

+A break ends the innermost enclosing loop. + + +

+The return statement is used to return values +from a function or a chunk +(which is handled as an anonymous function). + +Functions can return more than one value, +so the syntax for the return statement is + +

+	stat ::= return [explist] [‘;’]
+
+ +

+The return statement can only be written +as the last statement of a block. +If it is necessary to return in the middle of a block, +then an explicit inner block can be used, +as in the idiom do return end, +because now return is the last statement in its (inner) block. + + + + + +

3.3.5 – For Statement

+ +

+ +The for statement has two forms: +one numerical and one generic. + + + +

The numerical for loop

+ +

+The numerical for loop repeats a block of code while a +control variable goes through an arithmetic progression. +It has the following syntax: + +

+	stat ::= for Name ‘=’ exp ‘,’ exp [‘,’ exp] do block end
+

+The given identifier (Name) defines the control variable, +which is a new variable local to the loop body (block). + + +

+The loop starts by evaluating once the three control expressions. +Their values are called respectively +the initial value, the limit, and the step. +If the step is absent, it defaults to 1. + + +

+If both the initial value and the step are integers, +the loop is done with integers; +note that the limit may not be an integer. +Otherwise, the three values are converted to +floats and the loop is done with floats. +Beware of floating-point accuracy in this case. + + +

+After that initialization, +the loop body is repeated with the value of the control variable +going through an arithmetic progression, +starting at the initial value, +with a common difference given by the step. +A negative step makes a decreasing sequence; +a step equal to zero raises an error. +The loop continues while the value is less than +or equal to the limit +(greater than or equal to for a negative step). +If the initial value is already greater than the limit +(or less than, if the step is negative), +the body is not executed. + + +

+For integer loops, +the control variable never wraps around; +instead, the loop ends in case of an overflow. + + +

+You should not change the value of the control variable +during the loop. +If you need its value after the loop, +assign it to another variable before exiting the loop. + + + + + +

The generic for loop

+ +

+The generic for statement works over functions, +called iterators. +On each iteration, the iterator function is called to produce a new value, +stopping when this new value is nil. +The generic for loop has the following syntax: + +

+	stat ::= for namelist in explist do block end
+	namelist ::= Name {‘,’ Name}
+

+A for statement like + +

+     for var_1, ···, var_n in explist do body end
+

+works as follows. + + +

+The names var_i declare loop variables local to the loop body. +The first of these variables is the control variable. + + +

+The loop starts by evaluating explist +to produce four values: +an iterator function, +a state, +an initial value for the control variable, +and a closing value. + + +

+Then, at each iteration, +Lua calls the iterator function with two arguments: +the state and the control variable. +The results from this call are then assigned to the loop variables, +following the rules of multiple assignments (see §3.3.3). +If the control variable becomes nil, +the loop terminates. +Otherwise, the body is executed and the loop goes +to the next iteration. + + +

+The closing value behaves like a +to-be-closed variable (see §3.3.8), +which can be used to release resources when the loop ends. +Otherwise, it does not interfere with the loop. + + +

+You should not change the value of the control variable +during the loop. + + + + + + + +

3.3.6 – Function Calls as Statements

+To allow possible side-effects, +function calls can be executed as statements: + +

+	stat ::= functioncall
+

+In this case, all returned values are thrown away. +Function calls are explained in §3.4.10. + + + + + +

3.3.7 – Local Declarations

+Local variables can be declared anywhere inside a block. +The declaration can include an initialization: + +

+	stat ::= local attnamelist [‘=’ explist]
+	attnamelist ::=  Name attrib {‘,’ Name attrib}
+

+If present, an initial assignment has the same semantics +of a multiple assignment (see §3.3.3). +Otherwise, all variables are initialized with nil. + + +

+Each variable name may be postfixed by an attribute +(a name between angle brackets): + +

+	attrib ::= [‘<’ Name ‘>’]
+

+There are two possible attributes: +const, which declares a constant variable, +that is, a variable that cannot be assigned to +after its initialization; +and close, which declares a to-be-closed variable (see §3.3.8). +A list of variables can contain at most one to-be-closed variable. + + +

+A chunk is also a block (see §3.3.2), +and so local variables can be declared in a chunk outside any explicit block. + + +

+The visibility rules for local variables are explained in §3.5. + + + + + +

3.3.8 – To-be-closed Variables

+ +

+A to-be-closed variable behaves like a constant local variable, +except that its value is closed whenever the variable +goes out of scope, including normal block termination, +exiting its block by break/goto/return, +or exiting by an error. + + +

+Here, to close a value means +to call its __close metamethod. +When calling the metamethod, +the value itself is passed as the first argument +and the error object that caused the exit (if any) +is passed as a second argument; +if there was no error, the second argument is nil. + + +

+The value assigned to a to-be-closed variable +must have a __close metamethod +or be a false value. +(nil and false are ignored as to-be-closed values.) + + +

+If several to-be-closed variables go out of scope at the same event, +they are closed in the reverse order that they were declared. + + +

+If there is any error while running a closing method, +that error is handled like an error in the regular code +where the variable was defined. +After an error, +the other pending closing methods will still be called. + + +

+If a coroutine yields and is never resumed again, +some variables may never go out of scope, +and therefore they will never be closed. +(These variables are the ones created inside the coroutine +and in scope at the point where the coroutine yielded.) +Similarly, if a coroutine ends with an error, +it does not unwind its stack, +so it does not close any variable. +In both cases, +you can either use finalizers +or call coroutine.close to close the variables. +However, if the coroutine was created +through coroutine.wrap, +then its corresponding function will close the coroutine +in case of errors. + + + + + + + +

3.4 – Expressions

+ + + +

+The basic expressions in Lua are the following: + +

+	exp ::= prefixexp
+	exp ::= nil | false | true
+	exp ::= Numeral
+	exp ::= LiteralString
+	exp ::= functiondef
+	exp ::= tableconstructor
+	exp ::= ‘...’
+	exp ::= exp binop exp
+	exp ::= unop exp
+	prefixexp ::= var | functioncall | ‘(’ exp ‘)’
+
+ +

+Numerals and literal strings are explained in §3.1; +variables are explained in §3.2; +function definitions are explained in §3.4.11; +function calls are explained in §3.4.10; +table constructors are explained in §3.4.9. +Vararg expressions, +denoted by three dots ('...'), can only be used when +directly inside a vararg function; +they are explained in §3.4.11. + + +

+Binary operators comprise arithmetic operators (see §3.4.1), +bitwise operators (see §3.4.2), +relational operators (see §3.4.4), logical operators (see §3.4.5), +and the concatenation operator (see §3.4.6). +Unary operators comprise the unary minus (see §3.4.1), +the unary bitwise NOT (see §3.4.2), +the unary logical not (see §3.4.5), +and the unary length operator (see §3.4.7). + + +

+Both function calls and vararg expressions can result in multiple values. +If a function call is used as a statement (see §3.3.6), +then its return list is adjusted to zero elements, +thus discarding all returned values. +If an expression is used as the last (or the only) element +of a list of expressions, +then no adjustment is made +(unless the expression is enclosed in parentheses). +In all other contexts, +Lua adjusts the result list to one element, +either discarding all values except the first one +or adding a single nil if there are no values. + + +

+Here are some examples: + +

+     f()                -- adjusted to 0 results
+     g(f(), x)          -- f() is adjusted to 1 result
+     g(x, f())          -- g gets x plus all results from f()
+     a,b,c = f(), x     -- f() is adjusted to 1 result (c gets nil)
+     a,b = ...          -- a gets the first vararg argument, b gets
+                        -- the second (both a and b can get nil if there
+                        -- is no corresponding vararg argument)
+     
+     a,b,c = x, f()     -- f() is adjusted to 2 results
+     a,b,c = f()        -- f() is adjusted to 3 results
+     return f()         -- returns all results from f()
+     return ...         -- returns all received vararg arguments
+     return x,y,f()     -- returns x, y, and all results from f()
+     {f()}              -- creates a list with all results from f()
+     {...}              -- creates a list with all vararg arguments
+     {f(), nil}         -- f() is adjusted to 1 result
+
+ +

+Any expression enclosed in parentheses always results in only one value. +Thus, +(f(x,y,z)) is always a single value, +even if f returns several values. +(The value of (f(x,y,z)) is the first value returned by f +or nil if f does not return any values.) + + + + + +

3.4.1 – Arithmetic Operators

+Lua supports the following arithmetic operators: + +

    +
  • +: addition
    • +
  • -: subtraction
    • +
  • *: multiplication
    • +
  • /: float division
    • +
  • //: floor division
    • +
  • %: modulo
    • +
  • ^: exponentiation
    • +
  • -: unary minus
    • +
+ +

+With the exception of exponentiation and float division, +the arithmetic operators work as follows: +If both operands are integers, +the operation is performed over integers and the result is an integer. +Otherwise, if both operands are numbers, +then they are converted to floats, +the operation is performed following the machine's rules +for floating-point arithmetic +(usually the IEEE 754 standard), +and the result is a float. +(The string library coerces strings to numbers in +arithmetic operations; see §3.4.3 for details.) + + +

+Exponentiation and float division (/) +always convert their operands to floats +and the result is always a float. +Exponentiation uses the ISO C function pow, +so that it works for non-integer exponents too. + + +

+Floor division (//) is a division +that rounds the quotient towards minus infinity, +resulting in the floor of the division of its operands. + + +

+Modulo is defined as the remainder of a division +that rounds the quotient towards minus infinity (floor division). + + +

+In case of overflows in integer arithmetic, +all operations wrap around. + + + +

3.4.2 – Bitwise Operators

+Lua supports the following bitwise operators: + +

    +
  • &: bitwise AND
    • +
  • |: bitwise OR
    • +
  • ~: bitwise exclusive OR
    • +
  • >>: right shift
    • +
  • <<: left shift
    • +
  • ~: unary bitwise NOT
    • +
+ +

+All bitwise operations convert its operands to integers +(see §3.4.3), +operate on all bits of those integers, +and result in an integer. + + +

+Both right and left shifts fill the vacant bits with zeros. +Negative displacements shift to the other direction; +displacements with absolute values equal to or higher than +the number of bits in an integer +result in zero (as all bits are shifted out). + + + + + +

3.4.3 – Coercions and Conversions

+Lua provides some automatic conversions between some +types and representations at run time. +Bitwise operators always convert float operands to integers. +Exponentiation and float division +always convert integer operands to floats. +All other arithmetic operations applied to mixed numbers +(integers and floats) convert the integer operand to a float. +The C API also converts both integers to floats and +floats to integers, as needed. +Moreover, string concatenation accepts numbers as arguments, +besides strings. + + +

+In a conversion from integer to float, +if the integer value has an exact representation as a float, +that is the result. +Otherwise, +the conversion gets the nearest higher or +the nearest lower representable value. +This kind of conversion never fails. + + +

+The conversion from float to integer +checks whether the float has an exact representation as an integer +(that is, the float has an integral value and +it is in the range of integer representation). +If it does, that representation is the result. +Otherwise, the conversion fails. + + +

+Several places in Lua coerce strings to numbers when necessary. +In particular, +the string library sets metamethods that try to coerce +strings to numbers in all arithmetic operations. +If the conversion fails, +the library calls the metamethod of the other operand +(if present) or it raises an error. +Note that bitwise operators do not do this coercion. + + +

+Nonetheless, it is always a good practice not to rely on these +implicit coercions, as they are not always applied; +in particular, "1"==1 is false and "1"<1 raises an error +(see §3.4.4). +These coercions exist mainly for compatibility and may be removed +in future versions of the language. + + +

+A string is converted to an integer or a float +following its syntax and the rules of the Lua lexer. +The string may have also leading and trailing whitespaces and a sign. +All conversions from strings to numbers +accept both a dot and the current locale mark +as the radix character. +(The Lua lexer, however, accepts only a dot.) +If the string is not a valid numeral, +the conversion fails. +If necessary, the result of this first step is then converted +to a specific number subtype following the previous rules +for conversions between floats and integers. + + +

+The conversion from numbers to strings uses a +non-specified human-readable format. +To convert numbers to strings in any specific way, +use the function string.format. + + + + + +

3.4.4 – Relational Operators

+Lua supports the following relational operators: + +

    +
  • ==: equality
    • +
  • ~=: inequality
    • +
  • <: less than
    • +
  • >: greater than
    • +
  • <=: less or equal
    • +
  • >=: greater or equal
    • +

+These operators always result in false or true. + + +

+Equality (==) first compares the type of its operands. +If the types are different, then the result is false. +Otherwise, the values of the operands are compared. +Strings are equal if they have the same byte content. +Numbers are equal if they denote the same mathematical value. + + +

+Tables, userdata, and threads +are compared by reference: +two objects are considered equal only if they are the same object. +Every time you create a new object +(a table, a userdata, or a thread), +this new object is different from any previously existing object. +A function is always equal to itself. +Functions with any detectable difference +(different behavior, different definition) are always different. +Functions created at different times but with no detectable differences +may be classified as equal or not +(depending on internal caching details). + + +

+You can change the way that Lua compares tables and userdata +by using the __eq metamethod (see §2.4). + + +

+Equality comparisons do not convert strings to numbers +or vice versa. +Thus, "0"==0 evaluates to false, +and t[0] and t["0"] denote different +entries in a table. + + +

+The operator ~= is exactly the negation of equality (==). + + +

+The order operators work as follows. +If both arguments are numbers, +then they are compared according to their mathematical values, +regardless of their subtypes. +Otherwise, if both arguments are strings, +then their values are compared according to the current locale. +Otherwise, Lua tries to call the __lt or the __le +metamethod (see §2.4). +A comparison a > b is translated to b < a +and a >= b is translated to b <= a. + + +

+Following the IEEE 754 standard, +the special value NaN is considered neither less than, +nor equal to, nor greater than any value, including itself. + + + + + +

3.4.5 – Logical Operators

+The logical operators in Lua are +and, or, and not. +Like the control structures (see §3.3.4), +all logical operators consider both false and nil as false +and anything else as true. + + +

+The negation operator not always returns false or true. +The conjunction operator and returns its first argument +if this value is false or nil; +otherwise, and returns its second argument. +The disjunction operator or returns its first argument +if this value is different from nil and false; +otherwise, or returns its second argument. +Both and and or use short-circuit evaluation; +that is, +the second operand is evaluated only if necessary. +Here are some examples: + +

+     10 or 20            --> 10
+     10 or error()       --> 10
+     nil or "a"          --> "a"
+     nil and 10          --> nil
+     false and error()   --> false
+     false and nil       --> false
+     false or nil        --> nil
+     10 and 20           --> 20
+
+ + + + +

3.4.6 – Concatenation

+The string concatenation operator in Lua is +denoted by two dots ('..'). +If both operands are strings or numbers, +then the numbers are converted to strings +in a non-specified format (see §3.4.3). +Otherwise, the __concat metamethod is called (see §2.4). + + + + + +

3.4.7 – The Length Operator

+ +

+The length operator is denoted by the unary prefix operator #. + + +

+The length of a string is its number of bytes. +(That is the usual meaning of string length when each +character is one byte.) + + +

+The length operator applied on a table +returns a border in that table. +A border in a table t is any natural number +that satisfies the following condition: + +

+     (border == 0 or t[border] ~= nil) and t[border + 1] == nil
+

+In words, +a border is any (natural) index present in the table +that is followed by an absent index +(or zero, when index 1 is absent). + + +

+A table with exactly one border is called a sequence. +For instance, the table {10, 20, 30, 40, 50} is a sequence, +as it has only one border (5). +The table {10, 20, 30, nil, 50} has two borders (3 and 5), +and therefore it is not a sequence. +(The nil at index 4 is called a hole.) +The table {nil, 20, 30, nil, nil, 60, nil} +has three borders (0, 3, and 6) and three holes +(at indices 1, 4, and 5), +so it is not a sequence, too. +The table {} is a sequence with border 0. +Note that non-natural keys do not interfere +with whether a table is a sequence. + + +

+When t is a sequence, +#t returns its only border, +which corresponds to the intuitive notion of the length of the sequence. +When t is not a sequence, +#t can return any of its borders. +(The exact one depends on details of +the internal representation of the table, +which in turn can depend on how the table was populated and +the memory addresses of its non-numeric keys.) + + +

+The computation of the length of a table +has a guaranteed worst time of O(log n), +where n is the largest natural key in the table. + + +

+A program can modify the behavior of the length operator for +any value but strings through the __len metamethod (see §2.4). + + + + + +

3.4.8 – Precedence

+Operator precedence in Lua follows the table below, +from lower to higher priority: + +

+     or
+     and
+     <     >     <=    >=    ~=    ==
+     |
+     ~
+     &
+     <<    >>
+     ..
+     +     -
+     *     /     //    %
+     unary operators (not   #     -     ~)
+     ^
+

+As usual, +you can use parentheses to change the precedences of an expression. +The concatenation ('..') and exponentiation ('^') +operators are right associative. +All other binary operators are left associative. + + + + + +

3.4.9 – Table Constructors

+Table constructors are expressions that create tables. +Every time a constructor is evaluated, a new table is created. +A constructor can be used to create an empty table +or to create a table and initialize some of its fields. +The general syntax for constructors is + +

+	tableconstructor ::= ‘{’ [fieldlist] ‘}’
+	fieldlist ::= field {fieldsep field} [fieldsep]
+	field ::= ‘[’ exp ‘]’ ‘=’ exp | Name ‘=’ exp | exp
+	fieldsep ::= ‘,’ | ‘;’
+
+ +

+Each field of the form [exp1] = exp2 adds to the new table an entry +with key exp1 and value exp2. +A field of the form name = exp is equivalent to +["name"] = exp. +Fields of the form exp are equivalent to +[i] = exp, where i are consecutive integers +starting with 1; +fields in the other formats do not affect this counting. +For example, + +

+     a = { [f(1)] = g; "x", "y"; x = 1, f(x), [30] = 23; 45 }
+

+is equivalent to + +

+     do
+       local t = {}
+       t[f(1)] = g
+       t[1] = "x"         -- 1st exp
+       t[2] = "y"         -- 2nd exp
+       t.x = 1            -- t["x"] = 1
+       t[3] = f(x)        -- 3rd exp
+       t[30] = 23
+       t[4] = 45          -- 4th exp
+       a = t
+     end
+
+ +

+The order of the assignments in a constructor is undefined. +(This order would be relevant only when there are repeated keys.) + + +

+If the last field in the list has the form exp +and the expression is a function call or a vararg expression, +then all values returned by this expression enter the list consecutively +(see §3.4.10). + + +

+The field list can have an optional trailing separator, +as a convenience for machine-generated code. + + + + + +

3.4.10 – Function Calls

+A function call in Lua has the following syntax: + +

+	functioncall ::= prefixexp args
+

+In a function call, +first prefixexp and args are evaluated. +If the value of prefixexp has type function, +then this function is called +with the given arguments. +Otherwise, if present, +the prefixexp __call metamethod is called: +its first argument is the value of prefixexp, +followed by the original call arguments +(see §2.4). + + +

+The form + +

+	functioncall ::= prefixexp ‘:’ Name args
+

+can be used to emulate methods. +A call v:name(args) +is syntactic sugar for v.name(v,args), +except that v is evaluated only once. + + +

+Arguments have the following syntax: + +

+	args ::= ‘(’ [explist] ‘)’
+	args ::= tableconstructor
+	args ::= LiteralString
+

+All argument expressions are evaluated before the call. +A call of the form f{fields} is +syntactic sugar for f({fields}); +that is, the argument list is a single new table. +A call of the form f'string' +(or f"string" or f[[string]]) +is syntactic sugar for f('string'); +that is, the argument list is a single literal string. + + +

+A call of the form return functioncall not in the +scope of a to-be-closed variable is called a tail call. +Lua implements proper tail calls +(or proper tail recursion): +in a tail call, +the called function reuses the stack entry of the calling function. +Therefore, there is no limit on the number of nested tail calls that +a program can execute. +However, a tail call erases any debug information about the +calling function. +Note that a tail call only happens with a particular syntax, +where the return has one single function call as argument, +and it is outside the scope of any to-be-closed variable. +This syntax makes the calling function return exactly +the returns of the called function, +without any intervening action. +So, none of the following examples are tail calls: + +

+     return (f(x))        -- results adjusted to 1
+     return 2 * f(x)      -- result multiplied by 2
+     return x, f(x)       -- additional results
+     f(x); return         -- results discarded
+     return x or f(x)     -- results adjusted to 1
+
+ + + + +

3.4.11 – Function Definitions

+ +

+The syntax for function definition is + +

+	functiondef ::= function funcbody
+	funcbody ::= ‘(’ [parlist] ‘)’ block end
+
+ +

+The following syntactic sugar simplifies function definitions: + +

+	stat ::= function funcname funcbody
+	stat ::= local function Name funcbody
+	funcname ::= Name {‘.’ Name} [‘:’ Name]
+

+The statement + +

+     function f () body end
+

+translates to + +

+     f = function () body end
+

+The statement + +

+     function t.a.b.c.f () body end
+

+translates to + +

+     t.a.b.c.f = function () body end
+

+The statement + +

+     local function f () body end
+

+translates to + +

+     local f; f = function () body end
+

+not to + +

+     local f = function () body end
+

+(This only makes a difference when the body of the function +contains references to f.) + + +

+A function definition is an executable expression, +whose value has type function. +When Lua precompiles a chunk, +all its function bodies are precompiled too, +but they are not created yet. +Then, whenever Lua executes the function definition, +the function is instantiated (or closed). +This function instance, or closure, +is the final value of the expression. + + +

+Parameters act as local variables that are +initialized with the argument values: + +

+	parlist ::= namelist [‘,’ ‘...’] | ‘...’
+

+When a Lua function is called, +it adjusts its list of arguments to +the length of its list of parameters, +unless the function is a vararg function, +which is indicated by three dots ('...') +at the end of its parameter list. +A vararg function does not adjust its argument list; +instead, it collects all extra arguments and supplies them +to the function through a vararg expression, +which is also written as three dots. +The value of this expression is a list of all actual extra arguments, +similar to a function with multiple results. +If a vararg expression is used inside another expression +or in the middle of a list of expressions, +then its return list is adjusted to one element. +If the expression is used as the last element of a list of expressions, +then no adjustment is made +(unless that last expression is enclosed in parentheses). + + +

+As an example, consider the following definitions: + +

+     function f(a, b) end
+     function g(a, b, ...) end
+     function r() return 1,2,3 end
+

+Then, we have the following mapping from arguments to parameters and +to the vararg expression: + +

+     CALL             PARAMETERS
+     
+     f(3)             a=3, b=nil
+     f(3, 4)          a=3, b=4
+     f(3, 4, 5)       a=3, b=4
+     f(r(), 10)       a=1, b=10
+     f(r())           a=1, b=2
+     
+     g(3)             a=3, b=nil, ... -->  (nothing)
+     g(3, 4)          a=3, b=4,   ... -->  (nothing)
+     g(3, 4, 5, 8)    a=3, b=4,   ... -->  5  8
+     g(5, r())        a=5, b=1,   ... -->  2  3
+
+ +

+Results are returned using the return statement (see §3.3.4). +If control reaches the end of a function +without encountering a return statement, +then the function returns with no results. + + +

+ +There is a system-dependent limit on the number of values +that a function may return. +This limit is guaranteed to be greater than 1000. + + +

+The colon syntax +is used to emulate methods, +adding an implicit extra parameter self to the function. +Thus, the statement + +

+     function t.a.b.c:f (params) body end
+

+is syntactic sugar for + +

+     t.a.b.c.f = function (self, params) body end
+
+ + + + + + +

3.5 – Visibility Rules

+ +

+ +Lua is a lexically scoped language. +The scope of a local variable begins at the first statement after +its declaration and lasts until the last non-void statement +of the innermost block that includes the declaration. +Consider the following example: + +

+     x = 10                -- global variable
+     do                    -- new block
+       local x = x         -- new 'x', with value 10
+       print(x)            --> 10
+       x = x+1
+       do                  -- another block
+         local x = x+1     -- another 'x'
+         print(x)          --> 12
+       end
+       print(x)            --> 11
+     end
+     print(x)              --> 10  (the global one)
+
+ +

+Notice that, in a declaration like local x = x, +the new x being declared is not in scope yet, +and so the second x refers to the outside variable. + + +

+Because of the lexical scoping rules, +local variables can be freely accessed by functions +defined inside their scope. +A local variable used by an inner function is called an upvalue +(or external local variable, or simply external variable) +inside the inner function. + + +

+Notice that each execution of a local statement +defines new local variables. +Consider the following example: + +

+     a = {}
+     local x = 20
+     for i = 1, 10 do
+       local y = 0
+       a[i] = function () y = y + 1; return x + y end
+     end
+

+The loop creates ten closures +(that is, ten instances of the anonymous function). +Each of these closures uses a different y variable, +while all of them share the same x. + + + + + +

4 – The Application Program Interface

+ + + +

+ +This section describes the C API for Lua, that is, +the set of C functions available to the host program to communicate +with Lua. +All API functions and related types and constants +are declared in the header file lua.h. + + +

+Even when we use the term "function", +any facility in the API may be provided as a macro instead. +Except where stated otherwise, +all such macros use each of their arguments exactly once +(except for the first argument, which is always a Lua state), +and so do not generate any hidden side-effects. + + +

+As in most C libraries, +the Lua API functions do not check their arguments +for validity or consistency. +However, you can change this behavior by compiling Lua +with the macro LUA_USE_APICHECK defined. + + +

+The Lua library is fully reentrant: +it has no global variables. +It keeps all information it needs in a dynamic structure, +called the Lua state. + + +

+Each Lua state has one or more threads, +which correspond to independent, cooperative lines of execution. +The type lua_State (despite its name) refers to a thread. +(Indirectly, through the thread, it also refers to the +Lua state associated to the thread.) + + +

+A pointer to a thread must be passed as the first argument to +every function in the library, except to lua_newstate, +which creates a Lua state from scratch and returns a pointer +to the main thread in the new state. + + + + + +

4.1 – The Stack

+ + + +

+Lua uses a virtual stack to pass values to and from C. +Each element in this stack represents a Lua value +(nil, number, string, etc.). +Functions in the API can access this stack through the +Lua state parameter that they receive. + + +

+Whenever Lua calls C, the called function gets a new stack, +which is independent of previous stacks and of stacks of +C functions that are still active. +This stack initially contains any arguments to the C function +and it is where the C function can store temporary +Lua values and must push its results +to be returned to the caller (see lua_CFunction). + + +

+For convenience, +most query operations in the API do not follow a strict stack discipline. +Instead, they can refer to any element in the stack +by using an index: +A positive index represents an absolute stack position, +starting at 1 as the bottom of the stack; +a negative index represents an offset relative to the top of the stack. +More specifically, if the stack has n elements, +then index 1 represents the first element +(that is, the element that was pushed onto the stack first) +and +index n represents the last element; +index -1 also represents the last element +(that is, the element at the top) +and index -n represents the first element. + + + + + +

4.1.1 – Stack Size

+ +

+When you interact with the Lua API, +you are responsible for ensuring consistency. +In particular, +you are responsible for controlling stack overflow. +When you call any API function, +you must ensure the stack has enough room to accommodate the results. + + +

+There is one exception to the above rule: +When you call a Lua function +without a fixed number of results (see lua_call), +Lua ensures that the stack has enough space for all results. +However, it does not ensure any extra space. +So, before pushing anything on the stack after such a call +you should use lua_checkstack. + + +

+Whenever Lua calls C, +it ensures that the stack has space for +at least LUA_MINSTACK extra elements; +that is, you can safely push up to LUA_MINSTACK values into it. +LUA_MINSTACK is defined as 20, +so that usually you do not have to worry about stack space +unless your code has loops pushing elements onto the stack. +Whenever necessary, +you can use the function lua_checkstack +to ensure that the stack has enough space for pushing new elements. + + + + + +

4.1.2 – Valid and Acceptable Indices

+ +

+Any function in the API that receives stack indices +works only with valid indices or acceptable indices. + + +

+A valid index is an index that refers to a +position that stores a modifiable Lua value. +It comprises stack indices between 1 and the stack top +(1 ≤ abs(index) ≤ top) + +plus pseudo-indices, +which represent some positions that are accessible to C code +but that are not in the stack. +Pseudo-indices are used to access the registry (see §4.3) +and the upvalues of a C function (see §4.2). + + +

+Functions that do not need a specific mutable position, +but only a value (e.g., query functions), +can be called with acceptable indices. +An acceptable index can be any valid index, +but it also can be any positive index after the stack top +within the space allocated for the stack, +that is, indices up to the stack size. +(Note that 0 is never an acceptable index.) +Indices to upvalues (see §4.2) greater than the real number +of upvalues in the current C function are also acceptable (but invalid). +Except when noted otherwise, +functions in the API work with acceptable indices. + + +

+Acceptable indices serve to avoid extra tests +against the stack top when querying the stack. +For instance, a C function can query its third argument +without the need to check whether there is a third argument, +that is, without the need to check whether 3 is a valid index. + + +

+For functions that can be called with acceptable indices, +any non-valid index is treated as if it +contains a value of a virtual type LUA_TNONE, +which behaves like a nil value. + + + + + +

4.1.3 – Pointers to strings

+ +

+Several functions in the API return pointers (const char*) +to Lua strings in the stack. +(See lua_pushfstring, lua_pushlstring, +lua_pushstring, and lua_tolstring. +See also luaL_checklstring, luaL_checkstring, +and luaL_tolstring in the auxiliary library.) + + +

+In general, +Lua's garbage collection can free or move internal memory +and then invalidate pointers to internal strings. +To allow a safe use of these pointers, +The API guarantees that any pointer to a string in a stack index +is valid while the string value at that index is not removed from the stack. +(It can be moved to another index, though.) +When the index is a pseudo-index (referring to an upvalue), +the pointer is valid while the corresponding call is active and +the corresponding upvalue is not modified. + + +

+Some functions in the debug interface +also return pointers to strings, +namely lua_getlocal, lua_getupvalue, +lua_setlocal, and lua_setupvalue. +For these functions, the pointer is guaranteed to +be valid while the caller function is active and +the given closure (if one was given) is in the stack. + + +

+Except for these guarantees, +the garbage collector is free to invalidate +any pointer to internal strings. + + + + + + + +

4.2 – C Closures

+ +

+When a C function is created, +it is possible to associate some values with it, +thus creating a C closure +(see lua_pushcclosure); +these values are called upvalues and are +accessible to the function whenever it is called. + + +

+Whenever a C function is called, +its upvalues are located at specific pseudo-indices. +These pseudo-indices are produced by the macro +lua_upvalueindex. +The first upvalue associated with a function is at index +lua_upvalueindex(1), and so on. +Any access to lua_upvalueindex(n), +where n is greater than the number of upvalues of the +current function +(but not greater than 256, +which is one plus the maximum number of upvalues in a closure), +produces an acceptable but invalid index. + + +

+A C closure can also change the values +of its corresponding upvalues. + + + + + +

4.3 – Registry

+ +

+Lua provides a registry, +a predefined table that can be used by any C code to +store whatever Lua values it needs to store. +The registry table is always accessible at pseudo-index +LUA_REGISTRYINDEX. +Any C library can store data into this table, +but it must take care to choose keys +that are different from those used +by other libraries, to avoid collisions. +Typically, you should use as key a string containing your library name, +or a light userdata with the address of a C object in your code, +or any Lua object created by your code. +As with variable names, +string keys starting with an underscore followed by +uppercase letters are reserved for Lua. + + +

+The integer keys in the registry are used +by the reference mechanism (see luaL_ref) +and by some predefined values. +Therefore, integer keys in the registry +must not be used for other purposes. + + +

+When you create a new Lua state, +its registry comes with some predefined values. +These predefined values are indexed with integer keys +defined as constants in lua.h. +The following constants are defined: + +

    +
  • LUA_RIDX_MAINTHREAD: At this index the registry has +the main thread of the state. +(The main thread is the one created together with the state.) +
    • + +
  • LUA_RIDX_GLOBALS: At this index the registry has +the global environment. +
    • +
+ + + + +

4.4 – Error Handling in C

+ + + +

+Internally, Lua uses the C longjmp facility to handle errors. +(Lua will use exceptions if you compile it as C++; +search for LUAI_THROW in the source code for details.) +When Lua faces any error, +such as a memory allocation error or a type error, +it raises an error; +that is, it does a long jump. +A protected environment uses setjmp +to set a recovery point; +any error jumps to the most recent active recovery point. + + +

+Inside a C function you can raise an error explicitly +by calling lua_error. + + +

+Most functions in the API can raise an error, +for instance due to a memory allocation error. +The documentation for each function indicates whether +it can raise errors. + + +

+If an error happens outside any protected environment, +Lua calls a panic function (see lua_atpanic) +and then calls abort, +thus exiting the host application. +Your panic function can avoid this exit by +never returning +(e.g., doing a long jump to your own recovery point outside Lua). + + +

+The panic function, +as its name implies, +is a mechanism of last resort. +Programs should avoid it. +As a general rule, +when a C function is called by Lua with a Lua state, +it can do whatever it wants on that Lua state, +as it should be already protected. +However, +when C code operates on other Lua states +(e.g., a Lua-state argument to the function, +a Lua state stored in the registry, or +the result of lua_newthread), +it should use them only in API calls that cannot raise errors. + + +

+The panic function runs as if it were a message handler (see §2.3); +in particular, the error object is on the top of the stack. +However, there is no guarantee about stack space. +To push anything on the stack, +the panic function must first check the available space (see §4.1.1). + + + + + +

4.4.1 – Status Codes

+ +

+Several functions that report errors in the API use the following +status codes to indicate different kinds of errors or other conditions: + +

    + +
  • LUA_OK (0): no errors.
    • + +
  • LUA_ERRRUN: a runtime error.
    • + +
  • LUA_ERRMEM: +memory allocation error. +For such errors, Lua does not call the message handler. +
    • + +
  • LUA_ERRERR: error while running the message handler.
    • + +
  • LUA_ERRSYNTAX: syntax error during precompilation.
    • + +
  • LUA_YIELD: the thread (coroutine) yields.
    • + +
  • LUA_ERRFILE: a file-related error; +e.g., it cannot open or read the file.
    • + +

+These constants are defined in the header file lua.h. + + + + + + + +

4.5 – Handling Yields in C

+ +

+Internally, Lua uses the C longjmp facility to yield a coroutine. +Therefore, if a C function foo calls an API function +and this API function yields +(directly or indirectly by calling another function that yields), +Lua cannot return to foo any more, +because the longjmp removes its frame from the C stack. + + +

+To avoid this kind of problem, +Lua raises an error whenever it tries to yield across an API call, +except for three functions: +lua_yieldk, lua_callk, and lua_pcallk. +All those functions receive a continuation function +(as a parameter named k) to continue execution after a yield. + + +

+We need to set some terminology to explain continuations. +We have a C function called from Lua which we will call +the original function. +This original function then calls one of those three functions in the C API, +which we will call the callee function, +that then yields the current thread. +This can happen when the callee function is lua_yieldk, +or when the callee function is either lua_callk or lua_pcallk +and the function called by them yields. + + +

+Suppose the running thread yields while executing the callee function. +After the thread resumes, +it eventually will finish running the callee function. +However, +the callee function cannot return to the original function, +because its frame in the C stack was destroyed by the yield. +Instead, Lua calls a continuation function, +which was given as an argument to the callee function. +As the name implies, +the continuation function should continue the task +of the original function. + + +

+As an illustration, consider the following function: + +

+     int original_function (lua_State *L) {
+       ...     /* code 1 */
+       status = lua_pcall(L, n, m, h);  /* calls Lua */
+       ...     /* code 2 */
+     }
+

+Now we want to allow +the Lua code being run by lua_pcall to yield. +First, we can rewrite our function like here: + +

+     int k (lua_State *L, int status, lua_KContext ctx) {
+       ...  /* code 2 */
+     }
+     
+     int original_function (lua_State *L) {
+       ...     /* code 1 */
+       return k(L, lua_pcall(L, n, m, h), ctx);
+     }
+

+In the above code, +the new function k is a +continuation function (with type lua_KFunction), +which should do all the work that the original function +was doing after calling lua_pcall. +Now, we must inform Lua that it must call k if the Lua code +being executed by lua_pcall gets interrupted in some way +(errors or yielding), +so we rewrite the code as here, +replacing lua_pcall by lua_pcallk: + +

+     int original_function (lua_State *L) {
+       ...     /* code 1 */
+       return k(L, lua_pcallk(L, n, m, h, ctx2, k), ctx1);
+     }
+

+Note the external, explicit call to the continuation: +Lua will call the continuation only if needed, that is, +in case of errors or resuming after a yield. +If the called function returns normally without ever yielding, +lua_pcallk (and lua_callk) will also return normally. +(Of course, instead of calling the continuation in that case, +you can do the equivalent work directly inside the original function.) + + +

+Besides the Lua state, +the continuation function has two other parameters: +the final status of the call and the context value (ctx) that +was passed originally to lua_pcallk. +Lua does not use this context value; +it only passes this value from the original function to the +continuation function. +For lua_pcallk, +the status is the same value that would be returned by lua_pcallk, +except that it is LUA_YIELD when being executed after a yield +(instead of LUA_OK). +For lua_yieldk and lua_callk, +the status is always LUA_YIELD when Lua calls the continuation. +(For these two functions, +Lua will not call the continuation in case of errors, +because they do not handle errors.) +Similarly, when using lua_callk, +you should call the continuation function +with LUA_OK as the status. +(For lua_yieldk, there is not much point in calling +directly the continuation function, +because lua_yieldk usually does not return.) + + +

+Lua treats the continuation function as if it were the original function. +The continuation function receives the same Lua stack +from the original function, +in the same state it would be if the callee function had returned. +(For instance, +after a lua_callk the function and its arguments are +removed from the stack and replaced by the results from the call.) +It also has the same upvalues. +Whatever it returns is handled by Lua as if it were the return +of the original function. + + + + + +

4.6 – Functions and Types

+ +

+Here we list all functions and types from the C API in +alphabetical order. +Each function has an indicator like this: +[-o, +p, x] + + +

+The first field, o, +is how many elements the function pops from the stack. +The second field, p, +is how many elements the function pushes onto the stack. +(Any function always pushes its results after popping its arguments.) +A field in the form x|y means the function can push (or pop) +x or y elements, +depending on the situation; +an interrogation mark '?' means that +we cannot know how many elements the function pops/pushes +by looking only at its arguments. +(For instance, they may depend on what is in the stack.) +The third field, x, +tells whether the function may raise errors: +'-' means the function never raises any error; +'m' means the function may raise only out-of-memory errors; +'v' means the function may raise the errors explained in the text; +'e' means the function can run arbitrary Lua code, +either directly or through metamethods, +and therefore may raise any errors. + + + +

lua_absindex

+[-0, +0, –] +

int lua_absindex (lua_State *L, int idx);
+ +

+Converts the acceptable index idx +into an equivalent absolute index +(that is, one that does not depend on the stack size). + + + + + +

lua_Alloc

+
typedef void * (*lua_Alloc) (void *ud,
+                             void *ptr,
+                             size_t osize,
+                             size_t nsize);
+ +

+The type of the memory-allocation function used by Lua states. +The allocator function must provide a +functionality similar to realloc, +but not exactly the same. +Its arguments are +ud, an opaque pointer passed to lua_newstate; +ptr, a pointer to the block being allocated/reallocated/freed; +osize, the original size of the block or some code about what +is being allocated; +and nsize, the new size of the block. + + +

+When ptr is not NULL, +osize is the size of the block pointed by ptr, +that is, the size given when it was allocated or reallocated. + + +

+When ptr is NULL, +osize encodes the kind of object that Lua is allocating. +osize is any of +LUA_TSTRING, LUA_TTABLE, LUA_TFUNCTION, +LUA_TUSERDATA, or LUA_TTHREAD when (and only when) +Lua is creating a new object of that type. +When osize is some other value, +Lua is allocating memory for something else. + + +

+Lua assumes the following behavior from the allocator function: + + +

+When nsize is zero, +the allocator must behave like free +and then return NULL. + + +

+When nsize is not zero, +the allocator must behave like realloc. +In particular, the allocator returns NULL +if and only if it cannot fulfill the request. + + +

+Here is a simple implementation for the allocator function. +It is used in the auxiliary library by luaL_newstate. + +

+     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);
+     }
+

+Note that Standard C ensures +that free(NULL) has no effect and that +realloc(NULL,size) is equivalent to malloc(size). + + + + + +

lua_arith

+[-(2|1), +1, e] +

void lua_arith (lua_State *L, int op);
+ +

+Performs an arithmetic or bitwise operation over the two values +(or one, in the case of negations) +at the top of the stack, +with the value on the top being the second operand, +pops these values, and pushes the result of the operation. +The function follows the semantics of the corresponding Lua operator +(that is, it may call metamethods). + + +

+The value of op must be one of the following constants: + +

+ + + + +

lua_atpanic

+[-0, +0, –] +

lua_CFunction lua_atpanic (lua_State *L, lua_CFunction panicf);
+ +

+Sets a new panic function and returns the old one (see §4.4). + + + + + +

lua_call

+[-(nargs+1), +nresults, e] +

void lua_call (lua_State *L, int nargs, int nresults);
+ +

+Calls a function. +Like regular Lua calls, +lua_call respects the __call metamethod. +So, here the word "function" +means any callable value. + + +

+To do a call you must use the following protocol: +first, the function to be called is pushed onto the stack; +then, the arguments to the call are pushed +in direct order; +that is, the first argument is pushed first. +Finally you call lua_call; +nargs is the number of arguments that you pushed onto the stack. +When the function returns, +all arguments and the function value are popped +and the call results are pushed onto the stack. +The number of results is adjusted to nresults, +unless nresults is LUA_MULTRET. +In this case, all results from the function are pushed; +Lua takes care that the returned values fit into the stack space, +but it does not ensure any extra space in the stack. +The function results are pushed onto the stack in direct order +(the first result is pushed first), +so that after the call the last result is on the top of the stack. + + +

+Any error while calling and running the function is propagated upwards +(with a longjmp). + + +

+The following example shows how the host program can do the +equivalent to this Lua code: + +

+     a = f("how", t.x, 14)
+

+Here it is in C: + +

+     lua_getglobal(L, "f");                  /* function to be called */
+     lua_pushliteral(L, "how");                       /* 1st argument */
+     lua_getglobal(L, "t");                    /* table to be indexed */
+     lua_getfield(L, -1, "x");        /* push result of t.x (2nd arg) */
+     lua_remove(L, -2);                  /* remove 't' from the stack */
+     lua_pushinteger(L, 14);                          /* 3rd argument */
+     lua_call(L, 3, 1);     /* call 'f' with 3 arguments and 1 result */
+     lua_setglobal(L, "a");                         /* set global 'a' */
+

+Note that the code above is balanced: +at its end, the stack is back to its original configuration. +This is considered good programming practice. + + + + + +

lua_callk

+[-(nargs + 1), +nresults, e] +

void lua_callk (lua_State *L,
+                int nargs,
+                int nresults,
+                lua_KContext ctx,
+                lua_KFunction k);
+ +

+This function behaves exactly like lua_call, +but allows the called function to yield (see §4.5). + + + + + +

lua_CFunction

+
typedef int (*lua_CFunction) (lua_State *L);
+ +

+Type for C functions. + + +

+In order to communicate properly with Lua, +a C function must use the following protocol, +which defines the way parameters and results are passed: +a C function receives its arguments from Lua in its stack +in direct order (the first argument is pushed first). +So, when the function starts, +lua_gettop(L) returns the number of arguments received by the function. +The first argument (if any) is at index 1 +and its last argument is at index lua_gettop(L). +To return values to Lua, a C function just pushes them onto the stack, +in direct order (the first result is pushed first), +and returns in C the number of results. +Any other value in the stack below the results will be properly +discarded by Lua. +Like a Lua function, a C function called by Lua can also return +many results. + + +

+As an example, the following function receives a variable number +of numeric arguments and returns their average and their sum: + +

+     static int foo (lua_State *L) {
+       int n = lua_gettop(L);    /* number of arguments */
+       lua_Number sum = 0.0;
+       int i;
+       for (i = 1; i <= n; i++) {
+         if (!lua_isnumber(L, i)) {
+           lua_pushliteral(L, "incorrect argument");
+           lua_error(L);
+         }
+         sum += lua_tonumber(L, i);
+       }
+       lua_pushnumber(L, sum/n);        /* first result */
+       lua_pushnumber(L, sum);         /* second result */
+       return 2;                   /* number of results */
+     }
+
+ + + + +

lua_checkstack

+[-0, +0, –] +

int lua_checkstack (lua_State *L, int n);
+ +

+Ensures that the stack has space for at least n extra elements, +that is, that you can safely push up to n values into it. +It returns false if it cannot fulfill the request, +either because it would cause the stack +to be greater than a fixed maximum size +(typically at least several thousand elements) or +because it cannot allocate memory for the extra space. +This function never shrinks the stack; +if the stack already has space for the extra elements, +it is left unchanged. + + + + + +

lua_close

+[-0, +0, –] +

void lua_close (lua_State *L);
+ +

+Close all active to-be-closed variables in the main thread, +release all objects in the given Lua state +(calling the corresponding garbage-collection metamethods, if any), +and frees all dynamic memory used by this state. + + +

+On several platforms, you may not need to call this function, +because all resources are naturally released when the host program ends. +On the other hand, long-running programs that create multiple states, +such as daemons or web servers, +will probably need to close states as soon as they are not needed. + + + + + +

lua_closeslot

+[-0, +0, e] +

void lua_closeslot (lua_State *L, int index);
+ +

+Close the to-be-closed slot at the given index and set its value to nil. +The index must be the last index previously marked to be closed +(see lua_toclose) that is still active (that is, not closed yet). + + +

+A __close metamethod cannot yield +when called through this function. + + +

+(Exceptionally, this function was introduced in release 5.4.3. +It is not present in previous 5.4 releases.) + + + + + +

lua_compare

+[-0, +0, e] +

int lua_compare (lua_State *L, int index1, int index2, int op);
+ +

+Compares two Lua values. +Returns 1 if the value at index index1 satisfies op +when compared with the value at index index2, +following the semantics of the corresponding Lua operator +(that is, it may call metamethods). +Otherwise returns 0. +Also returns 0 if any of the indices is not valid. + + +

+The value of op must be one of the following constants: + +

    + +
  • LUA_OPEQ: compares for equality (==)
    • +
  • LUA_OPLT: compares for less than (<)
    • +
  • LUA_OPLE: compares for less or equal (<=)
    • + +
+ + + + +

lua_concat

+[-n, +1, e] +

void lua_concat (lua_State *L, int n);
+ +

+Concatenates the n values at the top of the stack, +pops them, and leaves the result on the top. +If n is 1, the result is the single value on the stack +(that is, the function does nothing); +if n is 0, the result is the empty string. +Concatenation is performed following the usual semantics of Lua +(see §3.4.6). + + + + + +

lua_copy

+[-0, +0, –] +

void lua_copy (lua_State *L, int fromidx, int toidx);
+ +

+Copies the element at index fromidx +into the valid index toidx, +replacing the value at that position. +Values at other positions are not affected. + + + + + +

lua_createtable

+[-0, +1, m] +

void lua_createtable (lua_State *L, int narr, int nrec);
+ +

+Creates a new empty table and pushes it onto the stack. +Parameter narr is a hint for how many elements the table +will have as a sequence; +parameter nrec is a hint for how many other elements +the table will have. +Lua may use these hints to preallocate memory for the new table. +This preallocation may help performance when you know in advance +how many elements the table will have. +Otherwise you can use the function lua_newtable. + + + + + +

lua_dump

+[-0, +0, –] +

int lua_dump (lua_State *L,
+                        lua_Writer writer,
+                        void *data,
+                        int strip);
+ +

+Dumps a function as a binary chunk. +Receives a Lua function on the top of the stack +and produces a binary chunk that, +if loaded again, +results in a function equivalent to the one dumped. +As it produces parts of the chunk, +lua_dump calls function writer (see lua_Writer) +with the given data +to write them. + + +

+If strip is true, +the binary representation may not include all debug information +about the function, +to save space. + + +

+The value returned is the error code returned by the last +call to the writer; +0 means no errors. + + +

+This function does not pop the Lua function from the stack. + + + + + +

lua_error

+[-1, +0, v] +

int lua_error (lua_State *L);
+ +

+Raises a Lua error, +using the value on the top of the stack as the error object. +This function does a long jump, +and therefore never returns +(see luaL_error). + + + + + +

lua_gc

+[-0, +0, –] +

int lua_gc (lua_State *L, int what, ...);
+ +

+Controls the garbage collector. + + +

+This function performs several tasks, +according to the value of the parameter what. +For options that need extra arguments, +they are listed after the option. + +

    + +
  • LUA_GCCOLLECT: +Performs a full garbage-collection cycle. +
    • + +
  • LUA_GCSTOP: +Stops the garbage collector. +
    • + +
  • LUA_GCRESTART: +Restarts the garbage collector. +
    • + +
  • LUA_GCCOUNT: +Returns the current amount of memory (in Kbytes) in use by Lua. +
    • + +
  • LUA_GCCOUNTB: +Returns the remainder of dividing the current amount of bytes of +memory in use by Lua by 1024. +
    • + +
  • LUA_GCSTEP (int stepsize): +Performs an incremental step of garbage collection, +corresponding to the allocation of stepsize Kbytes. +
    • + +
  • LUA_GCISRUNNING: +Returns a boolean that tells whether the collector is running +(i.e., not stopped). +
    • + +
  • LUA_GCINC (int pause, int stepmul, stepsize): +Changes the collector to incremental mode +with the given parameters (see §2.5.1). +Returns the previous mode (LUA_GCGEN or LUA_GCINC). +
    • + +
  • LUA_GCGEN (int minormul, int majormul): +Changes the collector to generational mode +with the given parameters (see §2.5.2). +Returns the previous mode (LUA_GCGEN or LUA_GCINC). +
    • + +

+For more details about these options, +see collectgarbage. + + + + + +

lua_getallocf

+[-0, +0, –] +

lua_Alloc lua_getallocf (lua_State *L, void **ud);
+ +

+Returns the memory-allocation function of a given state. +If ud is not NULL, Lua stores in *ud the +opaque pointer given when the memory-allocator function was set. + + + + + +

lua_getfield

+[-0, +1, e] +

int lua_getfield (lua_State *L, int index, const char *k);
+ +

+Pushes onto the stack the value t[k], +where t is the value at the given index. +As in Lua, this function may trigger a metamethod +for the "index" event (see §2.4). + + +

+Returns the type of the pushed value. + + + + + +

lua_getextraspace

+[-0, +0, –] +

void *lua_getextraspace (lua_State *L);
+ +

+Returns a pointer to a raw memory area associated with the +given Lua state. +The application can use this area for any purpose; +Lua does not use it for anything. + + +

+Each new thread has this area initialized with a copy +of the area of the main thread. + + +

+By default, this area has the size of a pointer to void, +but you can recompile Lua with a different size for this area. +(See LUA_EXTRASPACE in luaconf.h.) + + + + + +

lua_getglobal

+[-0, +1, e] +

int lua_getglobal (lua_State *L, const char *name);
+ +

+Pushes onto the stack the value of the global name. +Returns the type of that value. + + + + + +

lua_geti

+[-0, +1, e] +

int lua_geti (lua_State *L, int index, lua_Integer i);
+ +

+Pushes onto the stack the value t[i], +where t is the value at the given index. +As in Lua, this function may trigger a metamethod +for the "index" event (see §2.4). + + +

+Returns the type of the pushed value. + + + + + +

lua_getmetatable

+[-0, +(0|1), –] +

int lua_getmetatable (lua_State *L, int index);
+ +

+If the value at the given index has a metatable, +the function pushes that metatable onto the stack and returns 1. +Otherwise, +the function returns 0 and pushes nothing on the stack. + + + + + +

lua_gettable

+[-1, +1, e] +

int lua_gettable (lua_State *L, int index);
+ +

+Pushes onto the stack the value t[k], +where t is the value at the given index +and k is the value on the top of the stack. + + +

+This function pops the key from the stack, +pushing the resulting value in its place. +As in Lua, this function may trigger a metamethod +for the "index" event (see §2.4). + + +

+Returns the type of the pushed value. + + + + + +

lua_gettop

+[-0, +0, –] +

int lua_gettop (lua_State *L);
+ +

+Returns the index of the top element in the stack. +Because indices start at 1, +this result is equal to the number of elements in the stack; +in particular, 0 means an empty stack. + + + + + +

lua_getiuservalue

+[-0, +1, –] +

int lua_getiuservalue (lua_State *L, int index, int n);
+ +

+Pushes onto the stack the n-th user value associated with the +full userdata at the given index and +returns the type of the pushed value. + + +

+If the userdata does not have that value, +pushes nil and returns LUA_TNONE. + + + + + +

lua_insert

+[-1, +1, –] +

void lua_insert (lua_State *L, int index);
+ +

+Moves the top element into the given valid index, +shifting up the elements above this index to open space. +This function cannot be called with a pseudo-index, +because a pseudo-index is not an actual stack position. + + + + + +

lua_Integer

+
typedef ... lua_Integer;
+ +

+The type of integers in Lua. + + +

+By default this type is long long, +(usually a 64-bit two-complement integer), +but that can be changed to long or int +(usually a 32-bit two-complement integer). +(See LUA_INT_TYPE in luaconf.h.) + + +

+Lua also defines the constants +LUA_MININTEGER and LUA_MAXINTEGER, +with the minimum and the maximum values that fit in this type. + + + + + +

lua_isboolean

+[-0, +0, –] +

int lua_isboolean (lua_State *L, int index);
+ +

+Returns 1 if the value at the given index is a boolean, +and 0 otherwise. + + + + + +

lua_iscfunction

+[-0, +0, –] +

int lua_iscfunction (lua_State *L, int index);
+ +

+Returns 1 if the value at the given index is a C function, +and 0 otherwise. + + + + + +

lua_isfunction

+[-0, +0, –] +

int lua_isfunction (lua_State *L, int index);
+ +

+Returns 1 if the value at the given index is a function +(either C or Lua), and 0 otherwise. + + + + + +

lua_isinteger

+[-0, +0, –] +

int lua_isinteger (lua_State *L, int index);
+ +

+Returns 1 if the value at the given index is an integer +(that is, the value is a number and is represented as an integer), +and 0 otherwise. + + + + + +

lua_islightuserdata

+[-0, +0, –] +

int lua_islightuserdata (lua_State *L, int index);
+ +

+Returns 1 if the value at the given index is a light userdata, +and 0 otherwise. + + + + + +

lua_isnil

+[-0, +0, –] +

int lua_isnil (lua_State *L, int index);
+ +

+Returns 1 if the value at the given index is nil, +and 0 otherwise. + + + + + +

lua_isnone

+[-0, +0, –] +

int lua_isnone (lua_State *L, int index);
+ +

+Returns 1 if the given index is not valid, +and 0 otherwise. + + + + + +

lua_isnoneornil

+[-0, +0, –] +

int lua_isnoneornil (lua_State *L, int index);
+ +

+Returns 1 if the given index is not valid +or if the value at this index is nil, +and 0 otherwise. + + + + + +

lua_isnumber

+[-0, +0, –] +

int lua_isnumber (lua_State *L, int index);
+ +

+Returns 1 if the value at the given index is a number +or a string convertible to a number, +and 0 otherwise. + + + + + +

lua_isstring

+[-0, +0, –] +

int lua_isstring (lua_State *L, int index);
+ +

+Returns 1 if the value at the given index is a string +or a number (which is always convertible to a string), +and 0 otherwise. + + + + + +

lua_istable

+[-0, +0, –] +

int lua_istable (lua_State *L, int index);
+ +

+Returns 1 if the value at the given index is a table, +and 0 otherwise. + + + + + +

lua_isthread

+[-0, +0, –] +

int lua_isthread (lua_State *L, int index);
+ +

+Returns 1 if the value at the given index is a thread, +and 0 otherwise. + + + + + +

lua_isuserdata

+[-0, +0, –] +

int lua_isuserdata (lua_State *L, int index);
+ +

+Returns 1 if the value at the given index is a userdata +(either full or light), and 0 otherwise. + + + + + +

lua_isyieldable

+[-0, +0, –] +

int lua_isyieldable (lua_State *L);
+ +

+Returns 1 if the given coroutine can yield, +and 0 otherwise. + + + + + +

lua_KContext

+
typedef ... lua_KContext;
+ +

+The type for continuation-function contexts. +It must be a numeric type. +This type is defined as intptr_t +when intptr_t is available, +so that it can store pointers too. +Otherwise, it is defined as ptrdiff_t. + + + + + +

lua_KFunction

+
typedef int (*lua_KFunction) (lua_State *L, int status, lua_KContext ctx);
+ +

+Type for continuation functions (see §4.5). + + + + + +

lua_len

+[-0, +1, e] +

void lua_len (lua_State *L, int index);
+ +

+Returns the length of the value at the given index. +It is equivalent to the '#' operator in Lua (see §3.4.7) and +may trigger a metamethod for the "length" event (see §2.4). +The result is pushed on the stack. + + + + + +

lua_load

+[-0, +1, –] +

int lua_load (lua_State *L,
+              lua_Reader reader,
+              void *data,
+              const char *chunkname,
+              const char *mode);
+ +

+Loads a Lua chunk without running it. +If there are no errors, +lua_load pushes the compiled chunk as a Lua +function on top of the stack. +Otherwise, it pushes an error message. + + +

+The lua_load function uses a user-supplied reader function +to read the chunk (see lua_Reader). +The data argument is an opaque value passed to the reader function. + + +

+The chunkname argument gives a name to the chunk, +which is used for error messages and in debug information (see §4.7). + + +

+lua_load automatically detects whether the chunk is text or binary +and loads it accordingly (see program luac). +The string mode works as in function load, +with the addition that +a NULL value is equivalent to the string "bt". + + +

+lua_load uses the stack internally, +so the reader function must always leave the stack +unmodified when returning. + + +

+lua_load can return +LUA_OK, LUA_ERRSYNTAX, or LUA_ERRMEM. +The function may also return other values corresponding to +errors raised by the read function (see §4.4.1). + + +

+If the resulting function has upvalues, +its first upvalue is set to the value of the global environment +stored at index LUA_RIDX_GLOBALS in the registry (see §4.3). +When loading main chunks, +this upvalue will be the _ENV variable (see §2.2). +Other upvalues are initialized with nil. + + + + + +

lua_newstate

+[-0, +0, –] +

lua_State *lua_newstate (lua_Alloc f, void *ud);
+ +

+Creates a new independent state and returns its main thread. +Returns NULL if it cannot create the state +(due to lack of memory). +The argument f is the allocator function; +Lua will do all memory allocation for this state +through this function (see lua_Alloc). +The second argument, ud, is an opaque pointer that Lua +passes to the allocator in every call. + + + + + +

lua_newtable

+[-0, +1, m] +

void lua_newtable (lua_State *L);
+ +

+Creates a new empty table and pushes it onto the stack. +It is equivalent to lua_createtable(L, 0, 0). + + + + + +

lua_newthread

+[-0, +1, m] +

lua_State *lua_newthread (lua_State *L);
+ +

+Creates a new thread, pushes it on the stack, +and returns a pointer to a lua_State that represents this new thread. +The new thread returned by this function shares with the original thread +its global environment, +but has an independent execution stack. + + +

+Threads are subject to garbage collection, +like any Lua object. + + + + + +

lua_newuserdatauv

+[-0, +1, m] +

void *lua_newuserdatauv (lua_State *L, size_t size, int nuvalue);
+ +

+This function creates and pushes on the stack a new full userdata, +with nuvalue associated Lua values, called user values, +plus an associated block of raw memory with size bytes. +(The user values can be set and read with the functions +lua_setiuservalue and lua_getiuservalue.) + + +

+The function returns the address of the block of memory. +Lua ensures that this address is valid as long as +the corresponding userdata is alive (see §2.5). +Moreover, if the userdata is marked for finalization (see §2.5.3), +its address is valid at least until the call to its finalizer. + + + + + +

lua_next

+[-1, +(2|0), v] +

int lua_next (lua_State *L, int index);
+ +

+Pops a key from the stack, +and pushes a key–value pair from the table at the given index, +the "next" pair after the given key. +If there are no more elements in the table, +then lua_next returns 0 and pushes nothing. + + +

+A typical table traversal looks like this: + +

+     /* table is in the stack at index 't' */
+     lua_pushnil(L);  /* first key */
+     while (lua_next(L, t) != 0) {
+       /* uses 'key' (at index -2) and 'value' (at index -1) */
+       printf("%s - %s\n",
+              lua_typename(L, lua_type(L, -2)),
+              lua_typename(L, lua_type(L, -1)));
+       /* removes 'value'; keeps 'key' for next iteration */
+       lua_pop(L, 1);
+     }
+
+ +

+While traversing a table, +avoid calling lua_tolstring directly on a key, +unless you know that the key is actually a string. +Recall that lua_tolstring may change +the value at the given index; +this confuses the next call to lua_next. + + +

+This function may raise an error if the given key +is neither nil nor present in the table. +See function next for the caveats of modifying +the table during its traversal. + + + + + +

lua_Number

+
typedef ... lua_Number;
+ +

+The type of floats in Lua. + + +

+By default this type is double, +but that can be changed to a single float or a long double. +(See LUA_FLOAT_TYPE in luaconf.h.) + + + + + +

lua_numbertointeger

+
int lua_numbertointeger (lua_Number n, lua_Integer *p);
+ +

+Tries to convert a Lua float to a Lua integer; +the float n must have an integral value. +If that value is within the range of Lua integers, +it is converted to an integer and assigned to *p. +The macro results in a boolean indicating whether the +conversion was successful. +(Note that this range test can be tricky to do +correctly without this macro, due to rounding.) + + +

+This macro may evaluate its arguments more than once. + + + + + +

lua_pcall

+[-(nargs + 1), +(nresults|1), –] +

int lua_pcall (lua_State *L, int nargs, int nresults, int msgh);
+ +

+Calls a function (or a callable object) in protected mode. + + +

+Both nargs and nresults have the same meaning as +in lua_call. +If there are no errors during the call, +lua_pcall behaves exactly like lua_call. +However, if there is any error, +lua_pcall catches it, +pushes a single value on the stack (the error object), +and returns an error code. +Like lua_call, +lua_pcall always removes the function +and its arguments from the stack. + + +

+If msgh is 0, +then the error object returned on the stack +is exactly the original error object. +Otherwise, msgh is the stack index of a +message handler. +(This index cannot be a pseudo-index.) +In case of runtime errors, +this handler will be called with the error object +and its return value will be the object +returned on the stack by lua_pcall. + + +

+Typically, the message handler is used to add more debug +information to the error object, such as a stack traceback. +Such information cannot be gathered after the return of lua_pcall, +since by then the stack has unwound. + + +

+The lua_pcall function returns one of the following status codes: +LUA_OK, LUA_ERRRUN, LUA_ERRMEM, or LUA_ERRERR. + + + + + +

lua_pcallk

+[-(nargs + 1), +(nresults|1), –] +

int lua_pcallk (lua_State *L,
+                int nargs,
+                int nresults,
+                int msgh,
+                lua_KContext ctx,
+                lua_KFunction k);
+ +

+This function behaves exactly like lua_pcall, +except that it allows the called function to yield (see §4.5). + + + + + +

lua_pop

+[-n, +0, e] +

void lua_pop (lua_State *L, int n);
+ +

+Pops n elements from the stack. +It is implemented as a macro over lua_settop. + + + + + +

lua_pushboolean

+[-0, +1, –] +

void lua_pushboolean (lua_State *L, int b);
+ +

+Pushes a boolean value with value b onto the stack. + + + + + +

lua_pushcclosure

+[-n, +1, m] +

void lua_pushcclosure (lua_State *L, lua_CFunction fn, int n);
+ +

+Pushes a new C closure onto the stack. +This function receives a pointer to a C function +and pushes onto the stack a Lua value of type function that, +when called, invokes the corresponding C function. +The parameter n tells how many upvalues this function will have +(see §4.2). + + +

+Any function to be callable by Lua must +follow the correct protocol to receive its parameters +and return its results (see lua_CFunction). + + +

+When a C function is created, +it is possible to associate some values with it, +the so called upvalues; +these upvalues are then accessible to the function whenever it is called. +This association is called a C closure (see §4.2). +To create a C closure, +first the initial values for its upvalues must be pushed onto the stack. +(When there are multiple upvalues, the first value is pushed first.) +Then lua_pushcclosure +is called to create and push the C function onto the stack, +with the argument n telling how many values will be +associated with the function. +lua_pushcclosure also pops these values from the stack. + + +

+The maximum value for n is 255. + + +

+When n is zero, +this function creates a light C function, +which is just a pointer to the C function. +In that case, it never raises a memory error. + + + + + +

lua_pushcfunction

+[-0, +1, –] +

void lua_pushcfunction (lua_State *L, lua_CFunction f);
+ +

+Pushes a C function onto the stack. +This function is equivalent to lua_pushcclosure with no upvalues. + + + + + +

lua_pushfstring

+[-0, +1, v] +

const char *lua_pushfstring (lua_State *L, const char *fmt, ...);
+ +

+Pushes onto the stack a formatted string +and returns a pointer to this string (see §4.1.3). +It is similar to the ISO C function sprintf, +but has two important differences. +First, +you do not have to allocate space for the result; +the result is a Lua string and Lua takes care of memory allocation +(and deallocation, through garbage collection). +Second, +the conversion specifiers are quite restricted. +There are no flags, widths, or precisions. +The conversion specifiers can only be +'%%' (inserts the character '%'), +'%s' (inserts a zero-terminated string, with no size restrictions), +'%f' (inserts a lua_Number), +'%I' (inserts a lua_Integer), +'%p' (inserts a pointer), +'%d' (inserts an int), +'%c' (inserts an int as a one-byte character), and +'%U' (inserts a long int as a UTF-8 byte sequence). + + +

+This function may raise errors due to memory overflow +or an invalid conversion specifier. + + + + + +

lua_pushglobaltable

+[-0, +1, –] +

void lua_pushglobaltable (lua_State *L);
+ +

+Pushes the global environment onto the stack. + + + + + +

lua_pushinteger

+[-0, +1, –] +

void lua_pushinteger (lua_State *L, lua_Integer n);
+ +

+Pushes an integer with value n onto the stack. + + + + + +

lua_pushlightuserdata

+[-0, +1, –] +

void lua_pushlightuserdata (lua_State *L, void *p);
+ +

+Pushes a light userdata onto the stack. + + +

+Userdata represent C values in Lua. +A light userdata represents a pointer, a void*. +It is a value (like a number): +you do not create it, it has no individual metatable, +and it is not collected (as it was never created). +A light userdata is equal to "any" +light userdata with the same C address. + + + + + +

lua_pushliteral

+[-0, +1, m] +

const char *lua_pushliteral (lua_State *L, const char *s);
+ +

+This macro is equivalent to lua_pushstring, +but should be used only when s is a literal string. +(Lua may optimize this case.) + + + + + +

lua_pushlstring

+[-0, +1, m] +

const char *lua_pushlstring (lua_State *L, const char *s, size_t len);
+ +

+Pushes the string pointed to by s with size len +onto the stack. +Lua will make or reuse an internal copy of the given string, +so the memory at s can be freed or reused immediately after +the function returns. +The string can contain any binary data, +including embedded zeros. + + +

+Returns a pointer to the internal copy of the string (see §4.1.3). + + + + + +

lua_pushnil

+[-0, +1, –] +

void lua_pushnil (lua_State *L);
+ +

+Pushes a nil value onto the stack. + + + + + +

lua_pushnumber

+[-0, +1, –] +

void lua_pushnumber (lua_State *L, lua_Number n);
+ +

+Pushes a float with value n onto the stack. + + + + + +

lua_pushstring

+[-0, +1, m] +

const char *lua_pushstring (lua_State *L, const char *s);
+ +

+Pushes the zero-terminated string pointed to by s +onto the stack. +Lua will make or reuse an internal copy of the given string, +so the memory at s can be freed or reused immediately after +the function returns. + + +

+Returns a pointer to the internal copy of the string (see §4.1.3). + + +

+If s is NULL, pushes nil and returns NULL. + + + + + +

lua_pushthread

+[-0, +1, –] +

int lua_pushthread (lua_State *L);
+ +

+Pushes the thread represented by L onto the stack. +Returns 1 if this thread is the main thread of its state. + + + + + +

lua_pushvalue

+[-0, +1, –] +

void lua_pushvalue (lua_State *L, int index);
+ +

+Pushes a copy of the element at the given index +onto the stack. + + + + + +

lua_pushvfstring

+[-0, +1, v] +

const char *lua_pushvfstring (lua_State *L,
+                              const char *fmt,
+                              va_list argp);
+ +

+Equivalent to lua_pushfstring, except that it receives a va_list +instead of a variable number of arguments. + + + + + +

lua_rawequal

+[-0, +0, –] +

int lua_rawequal (lua_State *L, int index1, int index2);
+ +

+Returns 1 if the two values in indices index1 and +index2 are primitively equal +(that is, equal without calling the __eq metamethod). +Otherwise returns 0. +Also returns 0 if any of the indices are not valid. + + + + + +

lua_rawget

+[-1, +1, –] +

int lua_rawget (lua_State *L, int index);
+ +

+Similar to lua_gettable, but does a raw access +(i.e., without metamethods). + + + + + +

lua_rawgeti

+[-0, +1, –] +

int lua_rawgeti (lua_State *L, int index, lua_Integer n);
+ +

+Pushes onto the stack the value t[n], +where t is the table at the given index. +The access is raw, +that is, it does not use the __index metavalue. + + +

+Returns the type of the pushed value. + + + + + +

lua_rawgetp

+[-0, +1, –] +

int lua_rawgetp (lua_State *L, int index, const void *p);
+ +

+Pushes onto the stack the value t[k], +where t is the table at the given index and +k is the pointer p represented as a light userdata. +The access is raw; +that is, it does not use the __index metavalue. + + +

+Returns the type of the pushed value. + + + + + +

lua_rawlen

+[-0, +0, –] +

lua_Unsigned lua_rawlen (lua_State *L, int index);
+ +

+Returns the raw "length" of the value at the given index: +for strings, this is the string length; +for tables, this is the result of the length operator ('#') +with no metamethods; +for userdata, this is the size of the block of memory allocated +for the userdata. +For other values, this call returns 0. + + + + + +

lua_rawset

+[-2, +0, m] +

void lua_rawset (lua_State *L, int index);
+ +

+Similar to lua_settable, but does a raw assignment +(i.e., without metamethods). + + + + + +

lua_rawseti

+[-1, +0, m] +

void lua_rawseti (lua_State *L, int index, lua_Integer i);
+ +

+Does the equivalent of t[i] = v, +where t is the table at the given index +and v is the value on the top of the stack. + + +

+This function pops the value from the stack. +The assignment is raw, +that is, it does not use the __newindex metavalue. + + + + + +

lua_rawsetp

+[-1, +0, m] +

void lua_rawsetp (lua_State *L, int index, const void *p);
+ +

+Does the equivalent of t[p] = v, +where t is the table at the given index, +p is encoded as a light userdata, +and v is the value on the top of the stack. + + +

+This function pops the value from the stack. +The assignment is raw, +that is, it does not use the __newindex metavalue. + + + + + +

lua_Reader

+
typedef const char * (*lua_Reader) (lua_State *L,
+                                    void *data,
+                                    size_t *size);
+ +

+The reader function used by lua_load. +Every time lua_load needs another piece of the chunk, +it calls the reader, +passing along its data parameter. +The reader must return a pointer to a block of memory +with a new piece of the chunk +and set size to the block size. +The block must exist until the reader function is called again. +To signal the end of the chunk, +the reader must return NULL or set size to zero. +The reader function may return pieces of any size greater than zero. + + + + + +

lua_register

+[-0, +0, e] +

void lua_register (lua_State *L, const char *name, lua_CFunction f);
+ +

+Sets the C function f as the new value of global name. +It is defined as a macro: + +

+     #define lua_register(L,n,f) \
+            (lua_pushcfunction(L, f), lua_setglobal(L, n))
+
+ + + + +

lua_remove

+[-1, +0, –] +

void lua_remove (lua_State *L, int index);
+ +

+Removes the element at the given valid index, +shifting down the elements above this index to fill the gap. +This function cannot be called with a pseudo-index, +because a pseudo-index is not an actual stack position. + + + + + +

lua_replace

+[-1, +0, –] +

void lua_replace (lua_State *L, int index);
+ +

+Moves the top element into the given valid index +without shifting any element +(therefore replacing the value at that given index), +and then pops the top element. + + + + + +

lua_resetthread

+[-0, +?, –] +

int lua_resetthread (lua_State *L);
+ +

+Resets a thread, cleaning its call stack and closing all pending +to-be-closed variables. +Returns a status code: +LUA_OK for no errors in the thread +(either the original error that stopped the thread or +errors in closing methods), +or an error status otherwise. +In case of error, +leaves the error object on the top of the stack. + + + + + +

lua_resume

+[-?, +?, –] +

int lua_resume (lua_State *L, lua_State *from, int nargs,
+                          int *nresults);
+ +

+Starts and resumes a coroutine in the given thread L. + + +

+To start a coroutine, +you push the main function plus any arguments +onto the empty stack of the thread. +then you call lua_resume, +with nargs being the number of arguments. +This call returns when the coroutine suspends or finishes its execution. +When it returns, +*nresults is updated and +the top of the stack contains +the *nresults values passed to lua_yield +or returned by the body function. +lua_resume returns +LUA_YIELD if the coroutine yields, +LUA_OK if the coroutine finishes its execution +without errors, +or an error code in case of errors (see §4.4.1). +In case of errors, +the error object is on the top of the stack. + + +

+To resume a coroutine, +you remove the *nresults yielded values from its stack, +push the values to be passed as results from yield, +and then call lua_resume. + + +

+The parameter from represents the coroutine that is resuming L. +If there is no such coroutine, +this parameter can be NULL. + + + + + +

lua_rotate

+[-0, +0, –] +

void lua_rotate (lua_State *L, int idx, int n);
+ +

+Rotates the stack elements between the valid index idx +and the top of the stack. +The elements are rotated n positions in the direction of the top, +for a positive n, +or -n positions in the direction of the bottom, +for a negative n. +The absolute value of n must not be greater than the size +of the slice being rotated. +This function cannot be called with a pseudo-index, +because a pseudo-index is not an actual stack position. + + + + + +

lua_setallocf

+[-0, +0, –] +

void lua_setallocf (lua_State *L, lua_Alloc f, void *ud);
+ +

+Changes the allocator function of a given state to f +with user data ud. + + + + + +

lua_setfield

+[-1, +0, e] +

void lua_setfield (lua_State *L, int index, const char *k);
+ +

+Does the equivalent to t[k] = v, +where t is the value at the given index +and v is the value on the top of the stack. + + +

+This function pops the value from the stack. +As in Lua, this function may trigger a metamethod +for the "newindex" event (see §2.4). + + + + + +

lua_setglobal

+[-1, +0, e] +

void lua_setglobal (lua_State *L, const char *name);
+ +

+Pops a value from the stack and +sets it as the new value of global name. + + + + + +

lua_seti

+[-1, +0, e] +

void lua_seti (lua_State *L, int index, lua_Integer n);
+ +

+Does the equivalent to t[n] = v, +where t is the value at the given index +and v is the value on the top of the stack. + + +

+This function pops the value from the stack. +As in Lua, this function may trigger a metamethod +for the "newindex" event (see §2.4). + + + + + +

lua_setiuservalue

+[-1, +0, –] +

int lua_setiuservalue (lua_State *L, int index, int n);
+ +

+Pops a value from the stack and sets it as +the new n-th user value associated to the +full userdata at the given index. +Returns 0 if the userdata does not have that value. + + + + + +

lua_setmetatable

+[-1, +0, –] +

int lua_setmetatable (lua_State *L, int index);
+ +

+Pops a table or nil from the stack and +sets that value as the new metatable for the value at the given index. +(nil means no metatable.) + + +

+(For historical reasons, this function returns an int, +which now is always 1.) + + + + + +

lua_settable

+[-2, +0, e] +

void lua_settable (lua_State *L, int index);
+ +

+Does the equivalent to t[k] = v, +where t is the value at the given index, +v is the value on the top of the stack, +and k is the value just below the top. + + +

+This function pops both the key and the value from the stack. +As in Lua, this function may trigger a metamethod +for the "newindex" event (see §2.4). + + + + + +

lua_settop

+[-?, +?, e] +

void lua_settop (lua_State *L, int index);
+ +

+Accepts any index, or 0, +and sets the stack top to this index. +If the new top is greater than the old one, +then the new elements are filled with nil. +If index is 0, then all stack elements are removed. + + +

+This function can run arbitrary code when removing an index +marked as to-be-closed from the stack. + + + + + +

lua_setwarnf

+[-0, +0, –] +

void lua_setwarnf (lua_State *L, lua_WarnFunction f, void *ud);
+ +

+Sets the warning function to be used by Lua to emit warnings +(see lua_WarnFunction). +The ud parameter sets the value ud passed to +the warning function. + + + + + +

lua_State

+
typedef struct lua_State lua_State;
+ +

+An opaque structure that points to a thread and indirectly +(through the thread) to the whole state of a Lua interpreter. +The Lua library is fully reentrant: +it has no global variables. +All information about a state is accessible through this structure. + + +

+A pointer to this structure must be passed as the first argument to +every function in the library, except to lua_newstate, +which creates a Lua state from scratch. + + + + + +

lua_status

+[-0, +0, –] +

int lua_status (lua_State *L);
+ +

+Returns the status of the thread L. + + +

+The status can be LUA_OK for a normal thread, +an error code if the thread finished the execution +of a lua_resume with an error, +or LUA_YIELD if the thread is suspended. + + +

+You can call functions only in threads with status LUA_OK. +You can resume threads with status LUA_OK +(to start a new coroutine) or LUA_YIELD +(to resume a coroutine). + + + + + +

lua_stringtonumber

+[-0, +1, –] +

size_t lua_stringtonumber (lua_State *L, const char *s);
+ +

+Converts the zero-terminated string s to a number, +pushes that number into the stack, +and returns the total size of the string, +that is, its length plus one. +The conversion can result in an integer or a float, +according to the lexical conventions of Lua (see §3.1). +The string may have leading and trailing whitespaces and a sign. +If the string is not a valid numeral, +returns 0 and pushes nothing. +(Note that the result can be used as a boolean, +true if the conversion succeeds.) + + + + + +

lua_toboolean

+[-0, +0, –] +

int lua_toboolean (lua_State *L, int index);
+ +

+Converts the Lua value at the given index to a C boolean +value (0 or 1). +Like all tests in Lua, +lua_toboolean returns true for any Lua value +different from false and nil; +otherwise it returns false. +(If you want to accept only actual boolean values, +use lua_isboolean to test the value's type.) + + + + + +

lua_tocfunction

+[-0, +0, –] +

lua_CFunction lua_tocfunction (lua_State *L, int index);
+ +

+Converts a value at the given index to a C function. +That value must be a C function; +otherwise, returns NULL. + + + + + +

lua_toclose

+[-0, +0, m] +

void lua_toclose (lua_State *L, int index);
+ +

+Marks the given index in the stack as a +to-be-closed slot (see §3.3.8). +Like a to-be-closed variable in Lua, +the value at that slot in the stack will be closed +when it goes out of scope. +Here, in the context of a C function, +to go out of scope means that the running function returns to Lua, +or there is an error, +or the slot is removed from the stack through +lua_settop or lua_pop, +or there is a call to lua_closeslot. +A slot marked as to-be-closed should not be removed from the stack +by any other function in the API except lua_settop or lua_pop, +unless previously deactivated by lua_closeslot. + + +

+This function should not be called for an index +that is equal to or below an active to-be-closed slot. + + +

+Note that, both in case of errors and of a regular return, +by the time the __close metamethod runs, +the C stack was already unwound, +so that any automatic C variable declared in the calling function +(e.g., a buffer) will be out of scope. + + + + + +

lua_tointeger

+[-0, +0, –] +

lua_Integer lua_tointeger (lua_State *L, int index);
+ +

+Equivalent to lua_tointegerx with isnum equal to NULL. + + + + + +

lua_tointegerx

+[-0, +0, –] +

lua_Integer lua_tointegerx (lua_State *L, int index, int *isnum);
+ +

+Converts the Lua value at the given index +to the signed integral type lua_Integer. +The Lua value must be an integer, +or a number or string convertible to an integer (see §3.4.3); +otherwise, lua_tointegerx returns 0. + + +

+If isnum is not NULL, +its referent is assigned a boolean value that +indicates whether the operation succeeded. + + + + + +

lua_tolstring

+[-0, +0, m] +

const char *lua_tolstring (lua_State *L, int index, size_t *len);
+ +

+Converts the Lua value at the given index to a C string. +If len is not NULL, +it sets *len with the string length. +The Lua value must be a string or a number; +otherwise, the function returns NULL. +If the value is a number, +then lua_tolstring also +changes the actual value in the stack to a string. +(This change confuses lua_next +when lua_tolstring is applied to keys during a table traversal.) + + +

+lua_tolstring returns a pointer +to a string inside the Lua state (see §4.1.3). +This string always has a zero ('\0') +after its last character (as in C), +but can contain other zeros in its body. + + + + + +

lua_tonumber

+[-0, +0, –] +

lua_Number lua_tonumber (lua_State *L, int index);
+ +

+Equivalent to lua_tonumberx with isnum equal to NULL. + + + + + +

lua_tonumberx

+[-0, +0, –] +

lua_Number lua_tonumberx (lua_State *L, int index, int *isnum);
+ +

+Converts the Lua value at the given index +to the C type lua_Number (see lua_Number). +The Lua value must be a number or a string convertible to a number +(see §3.4.3); +otherwise, lua_tonumberx returns 0. + + +

+If isnum is not NULL, +its referent is assigned a boolean value that +indicates whether the operation succeeded. + + + + + +

lua_topointer

+[-0, +0, –] +

const void *lua_topointer (lua_State *L, int index);
+ +

+Converts the value at the given index to a generic +C pointer (void*). +The value can be a userdata, a table, a thread, a string, or a function; +otherwise, lua_topointer returns NULL. +Different objects will give different pointers. +There is no way to convert the pointer back to its original value. + + +

+Typically this function is used only for hashing and debug information. + + + + + +

lua_tostring

+[-0, +0, m] +

const char *lua_tostring (lua_State *L, int index);
+ +

+Equivalent to lua_tolstring with len equal to NULL. + + + + + +

lua_tothread

+[-0, +0, –] +

lua_State *lua_tothread (lua_State *L, int index);
+ +

+Converts the value at the given index to a Lua thread +(represented as lua_State*). +This value must be a thread; +otherwise, the function returns NULL. + + + + + +

lua_touserdata

+[-0, +0, –] +

void *lua_touserdata (lua_State *L, int index);
+ +

+If the value at the given index is a full userdata, +returns its memory-block address. +If the value is a light userdata, +returns its value (a pointer). +Otherwise, returns NULL. + + + + + +

lua_type

+[-0, +0, –] +

int lua_type (lua_State *L, int index);
+ +

+Returns the type of the value in the given valid index, +or LUA_TNONE for a non-valid but acceptable index. +The types returned by lua_type are coded by the following constants +defined in lua.h: +LUA_TNIL, +LUA_TNUMBER, +LUA_TBOOLEAN, +LUA_TSTRING, +LUA_TTABLE, +LUA_TFUNCTION, +LUA_TUSERDATA, +LUA_TTHREAD, +and +LUA_TLIGHTUSERDATA. + + + + + +

lua_typename

+[-0, +0, –] +

const char *lua_typename (lua_State *L, int tp);
+ +

+Returns the name of the type encoded by the value tp, +which must be one the values returned by lua_type. + + + + + +

lua_Unsigned

+
typedef ... lua_Unsigned;
+ +

+The unsigned version of lua_Integer. + + + + + +

lua_upvalueindex

+[-0, +0, –] +

int lua_upvalueindex (int i);
+ +

+Returns the pseudo-index that represents the i-th upvalue of +the running function (see §4.2). +i must be in the range [1,256]. + + + + + +

lua_version

+[-0, +0, –] +

lua_Number lua_version (lua_State *L);
+ +

+Returns the version number of this core. + + + + + +

lua_WarnFunction

+
typedef void (*lua_WarnFunction) (void *ud, const char *msg, int tocont);
+ +

+The type of warning functions, called by Lua to emit warnings. +The first parameter is an opaque pointer +set by lua_setwarnf. +The second parameter is the warning message. +The third parameter is a boolean that +indicates whether the message is +to be continued by the message in the next call. + + +

+See warn for more details about warnings. + + + + + +

lua_warning

+[-0, +0, –] +

void lua_warning (lua_State *L, const char *msg, int tocont);
+ +

+Emits a warning with the given message. +A message in a call with tocont true should be +continued in another call to this function. + + +

+See warn for more details about warnings. + + + + + +

lua_Writer

+
typedef int (*lua_Writer) (lua_State *L,
+                           const void* p,
+                           size_t sz,
+                           void* ud);
+ +

+The type of the writer function used by lua_dump. +Every time lua_dump produces another piece of chunk, +it calls the writer, +passing along the buffer to be written (p), +its size (sz), +and the ud parameter supplied to lua_dump. + + +

+The writer returns an error code: +0 means no errors; +any other value means an error and stops lua_dump from +calling the writer again. + + + + + +

lua_xmove

+[-?, +?, –] +

void lua_xmove (lua_State *from, lua_State *to, int n);
+ +

+Exchange values between different threads of the same state. + + +

+This function pops n values from the stack from, +and pushes them onto the stack to. + + + + + +

lua_yield

+[-?, +?, v] +

int lua_yield (lua_State *L, int nresults);
+ +

+This function is equivalent to lua_yieldk, +but it has no continuation (see §4.5). +Therefore, when the thread resumes, +it continues the function that called +the function calling lua_yield. +To avoid surprises, +this function should be called only in a tail call. + + + + + +

lua_yieldk

+[-?, +?, v] +

int lua_yieldk (lua_State *L,
+                int nresults,
+                lua_KContext ctx,
+                lua_KFunction k);
+ +

+Yields a coroutine (thread). + + +

+When a C function calls lua_yieldk, +the running coroutine suspends its execution, +and the call to lua_resume that started this coroutine returns. +The parameter nresults is the number of values from the stack +that will be passed as results to lua_resume. + + +

+When the coroutine is resumed again, +Lua calls the given continuation function k to continue +the execution of the C function that yielded (see §4.5). +This continuation function receives the same stack +from the previous function, +with the n results removed and +replaced by the arguments passed to lua_resume. +Moreover, +the continuation function receives the value ctx +that was passed to lua_yieldk. + + +

+Usually, this function does not return; +when the coroutine eventually resumes, +it continues executing the continuation function. +However, there is one special case, +which is when this function is called +from inside a line or a count hook (see §4.7). +In that case, lua_yieldk should be called with no continuation +(probably in the form of lua_yield) and no results, +and the hook should return immediately after the call. +Lua will yield and, +when the coroutine resumes again, +it will continue the normal execution +of the (Lua) function that triggered the hook. + + +

+This function can raise an error if it is called from a thread +with a pending C call with no continuation function +(what is called a C-call boundary), +or it is called from a thread that is not running inside a resume +(typically the main thread). + + + + + + + +

4.7 – The Debug Interface

+ +

+Lua has no built-in debugging facilities. +Instead, it offers a special interface +by means of functions and hooks. +This interface allows the construction of different +kinds of debuggers, profilers, and other tools +that need "inside information" from the interpreter. + + + +

lua_Debug

+
typedef struct lua_Debug {
+  int event;
+  const char *name;           /* (n) */
+  const char *namewhat;       /* (n) */
+  const char *what;           /* (S) */
+  const char *source;         /* (S) */
+  size_t srclen;              /* (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) */
+  unsigned short ftransfer;   /* (r) index of first value transferred */
+  unsigned short ntransfer;   /* (r) number of transferred values */
+  char short_src[LUA_IDSIZE]; /* (S) */
+  /* private part */
+  other fields
+} lua_Debug;
+ +

+A structure used to carry different pieces of +information about a function or an activation record. +lua_getstack fills only the private part +of this structure, for later use. +To fill the other fields of lua_Debug with useful information, +you must call lua_getinfo. + + +

+The fields of lua_Debug have the following meaning: + +

    + +
  • source: +the source of the chunk that created the function. +If source starts with a '@', +it means that the function was defined in a file where +the file name follows the '@'. +If source starts with a '=', +the remainder of its contents describes the source in a user-dependent manner. +Otherwise, +the function was defined in a string where +source is that string. +
    • + +
  • srclen: +The length of the string source. +
    • + +
  • short_src: +a "printable" version of source, to be used in error messages. +
    • + +
  • linedefined: +the line number where the definition of the function starts. +
    • + +
  • lastlinedefined: +the line number where the definition of the function ends. +
    • + +
  • what: +the string "Lua" if the function is a Lua function, +"C" if it is a C function, +"main" if it is the main part of a chunk. +
    • + +
  • currentline: +the current line where the given function is executing. +When no line information is available, +currentline is set to -1. +
    • + +
  • name: +a reasonable name for the given function. +Because functions in Lua are first-class values, +they do not have a fixed name: +some functions can be the value of multiple global variables, +while others can be stored only in a table field. +The lua_getinfo function checks how the function was +called to find a suitable name. +If it cannot find a name, +then name is set to NULL. +
    • + +
  • namewhat: +explains the name field. +The value of namewhat can be +"global", "local", "method", +"field", "upvalue", or "" (the empty string), +according to how the function was called. +(Lua uses the empty string when no other option seems to apply.) +
    • + +
  • istailcall: +true if this function invocation was called by a tail call. +In this case, the caller of this level is not in the stack. +
    • + +
  • nups: +the number of upvalues of the function. +
    • + +
  • nparams: +the number of parameters of the function +(always 0 for C functions). +
    • + +
  • isvararg: +true if the function is a vararg function +(always true for C functions). +
    • + +
  • ftransfer: +the index in the stack of the first value being "transferred", +that is, parameters in a call or return values in a return. +(The other values are in consecutive indices.) +Using this index, you can access and modify these values +through lua_getlocal and lua_setlocal. +This field is only meaningful during a +call hook, denoting the first parameter, +or a return hook, denoting the first value being returned. +(For call hooks, this value is always 1.) +
    • + +
  • ntransfer: +The number of values being transferred (see previous item). +(For calls of Lua functions, +this value is always equal to nparams.) +
    • + +
+ + + + +

lua_gethook

+[-0, +0, –] +

lua_Hook lua_gethook (lua_State *L);
+ +

+Returns the current hook function. + + + + + +

lua_gethookcount

+[-0, +0, –] +

int lua_gethookcount (lua_State *L);
+ +

+Returns the current hook count. + + + + + +

lua_gethookmask

+[-0, +0, –] +

int lua_gethookmask (lua_State *L);
+ +

+Returns the current hook mask. + + + + + +

lua_getinfo

+[-(0|1), +(0|1|2), m] +

int lua_getinfo (lua_State *L, const char *what, lua_Debug *ar);
+ +

+Gets information about a specific function or function invocation. + + +

+To get information about a function invocation, +the parameter ar must be a valid activation record that was +filled by a previous call to lua_getstack or +given as argument to a hook (see lua_Hook). + + +

+To get information about a function, you push it onto the stack +and start the what string with the character '>'. +(In that case, +lua_getinfo pops the function from the top of the stack.) +For instance, to know in which line a function f was defined, +you can write the following code: + +

+     lua_Debug ar;
+     lua_getglobal(L, "f");  /* get global 'f' */
+     lua_getinfo(L, ">S", &ar);
+     printf("%d\n", ar.linedefined);
+
+ +

+Each character in the string what +selects some fields of the structure ar to be filled or +a value to be pushed on the stack: + +

    + +
  • 'n': fills in the field name and namewhat; +
    • + +
  • 'S': +fills in the fields source, short_src, +linedefined, lastlinedefined, and what; +
    • + +
  • 'l': fills in the field currentline; +
    • + +
  • 't': fills in the field istailcall; +
    • + +
  • 'u': fills in the fields +nups, nparams, and isvararg; +
    • + +
  • 'f': +pushes onto the stack the function that is +running at the given level; +
    • + +
  • 'L': +pushes onto the stack a table whose indices are the +numbers of the lines that are valid on the function. +(A valid line is a line with some associated code, +that is, a line where you can put a break point. +Non-valid lines include empty lines and comments.) + + +

    +If this option is given together with option 'f', +its table is pushed after the function. + + +

    +This is the only option that can raise a memory error. +

    • + +
+ +

+This function returns 0 to signal an invalid option in what; +even then the valid options are handled correctly. + + + + + +

lua_getlocal

+[-0, +(0|1), –] +

const char *lua_getlocal (lua_State *L, const lua_Debug *ar, int n);
+ +

+Gets information about a local variable or a temporary value +of a given activation record or a given function. + + +

+In the first case, +the parameter ar must be a valid activation record that was +filled by a previous call to lua_getstack or +given as argument to a hook (see lua_Hook). +The index n selects which local variable to inspect; +see debug.getlocal for details about variable indices +and names. + + +

+lua_getlocal pushes the variable's value onto the stack +and returns its name. + + +

+In the second case, ar must be NULL and the function +to be inspected must be on the top of the stack. +In this case, only parameters of Lua functions are visible +(as there is no information about what variables are active) +and no values are pushed onto the stack. + + +

+Returns NULL (and pushes nothing) +when the index is greater than +the number of active local variables. + + + + + +

lua_getstack

+[-0, +0, –] +

int lua_getstack (lua_State *L, int level, lua_Debug *ar);
+ +

+Gets information about the interpreter runtime stack. + + +

+This function fills parts of a lua_Debug structure with +an identification of the activation record +of the function executing at a given level. +Level 0 is the current running function, +whereas level n+1 is the function that has called level n +(except for tail calls, which do not count in the stack). +When called with a level greater than the stack depth, +lua_getstack returns 0; +otherwise it returns 1. + + + + + +

lua_getupvalue

+[-0, +(0|1), –] +

const char *lua_getupvalue (lua_State *L, int funcindex, int n);
+ +

+Gets information about the n-th upvalue +of the closure at index funcindex. +It pushes the upvalue's value onto the stack +and returns its name. +Returns NULL (and pushes nothing) +when the index n is greater than the number of upvalues. + + +

+See debug.getupvalue for more information about upvalues. + + + + + +

lua_Hook

+
typedef void (*lua_Hook) (lua_State *L, lua_Debug *ar);
+ +

+Type for debugging hook functions. + + +

+Whenever a hook is called, its ar argument has its field +event set to the specific event that triggered the hook. +Lua identifies these events with the following constants: +LUA_HOOKCALL, LUA_HOOKRET, +LUA_HOOKTAILCALL, LUA_HOOKLINE, +and LUA_HOOKCOUNT. +Moreover, for line events, the field currentline is also set. +To get the value of any other field in ar, +the hook must call lua_getinfo. + + +

+For call events, event can be LUA_HOOKCALL, +the normal value, or LUA_HOOKTAILCALL, for a tail call; +in this case, there will be no corresponding return event. + + +

+While Lua is running a hook, it disables other calls to hooks. +Therefore, if a hook calls back Lua to execute a function or a chunk, +this execution occurs without any calls to hooks. + + +

+Hook functions cannot have continuations, +that is, they cannot call lua_yieldk, +lua_pcallk, or lua_callk with a non-null k. + + +

+Hook functions can yield under the following conditions: +Only count and line events can yield; +to yield, a hook function must finish its execution +calling lua_yield with nresults equal to zero +(that is, with no values). + + + + + +

lua_sethook

+[-0, +0, –] +

void lua_sethook (lua_State *L, lua_Hook f, int mask, int count);
+ +

+Sets the debugging hook function. + + +

+Argument f is the hook function. +mask specifies on which events the hook will be called: +it is formed by a bitwise OR of the constants +LUA_MASKCALL, +LUA_MASKRET, +LUA_MASKLINE, +and LUA_MASKCOUNT. +The count argument is only meaningful when the mask +includes LUA_MASKCOUNT. +For each event, the hook is called as explained below: + +

    + +
  • The call hook: is called when the interpreter calls a function. +The hook is called just after Lua enters the new function. +
    • + +
  • The return hook: is called when the interpreter returns from a function. +The hook is called just before Lua leaves the function. +
    • + +
  • The line hook: is called when the interpreter is about to +start the execution of a new line of code, +or when it jumps back in the code (even to the same line). +This event only happens while Lua is executing a Lua function. +
    • + +
  • The count hook: is called after the interpreter executes every +count instructions. +This event only happens while Lua is executing a Lua function. +
    • + +
+ +

+Hooks are disabled by setting mask to zero. + + + + + +

lua_setlocal

+[-(0|1), +0, –] +

const char *lua_setlocal (lua_State *L, const lua_Debug *ar, int n);
+ +

+Sets the value of a local variable of a given activation record. +It assigns the value on the top of the stack +to the variable and returns its name. +It also pops the value from the stack. + + +

+Returns NULL (and pops nothing) +when the index is greater than +the number of active local variables. + + +

+Parameters ar and n are as in the function lua_getlocal. + + + + + +

lua_setupvalue

+[-(0|1), +0, –] +

const char *lua_setupvalue (lua_State *L, int funcindex, int n);
+ +

+Sets the value of a closure's upvalue. +It assigns the value on the top of the stack +to the upvalue and returns its name. +It also pops the value from the stack. + + +

+Returns NULL (and pops nothing) +when the index n is greater than the number of upvalues. + + +

+Parameters funcindex and n are as in +the function lua_getupvalue. + + + + + +

lua_upvalueid

+[-0, +0, –] +

void *lua_upvalueid (lua_State *L, int funcindex, int n);
+ +

+Returns a unique identifier for the upvalue numbered n +from the closure at index funcindex. + + +

+These unique identifiers allow a program to check whether different +closures share upvalues. +Lua closures that share an upvalue +(that is, that access a same external local variable) +will return identical ids for those upvalue indices. + + +

+Parameters funcindex and n are as in +the function lua_getupvalue, +but n cannot be greater than the number of upvalues. + + + + + +

lua_upvaluejoin

+[-0, +0, –] +

void lua_upvaluejoin (lua_State *L, int funcindex1, int n1,
+                                    int funcindex2, int n2);
+ +

+Make the n1-th upvalue of the Lua closure at index funcindex1 +refer to the n2-th upvalue of the Lua closure at index funcindex2. + + + + + + + +

5 – The Auxiliary Library

+ + + +

+ +The auxiliary library provides several convenient functions +to interface C with Lua. +While the basic API provides the primitive functions for all +interactions between C and Lua, +the auxiliary library provides higher-level functions for some +common tasks. + + +

+All functions and types from the auxiliary library +are defined in header file lauxlib.h and +have a prefix luaL_. + + +

+All functions in the auxiliary library are built on +top of the basic API, +and so they provide nothing that cannot be done with that API. +Nevertheless, the use of the auxiliary library ensures +more consistency to your code. + + +

+Several functions in the auxiliary library use internally some +extra stack slots. +When a function in the auxiliary library uses less than five slots, +it does not check the stack size; +it simply assumes that there are enough slots. + + +

+Several functions in the auxiliary library are used to +check C function arguments. +Because the error message is formatted for arguments +(e.g., "bad argument #1"), +you should not use these functions for other stack values. + + +

+Functions called luaL_check* +always raise an error if the check is not satisfied. + + + + + +

5.1 – Functions and Types

+ +

+Here we list all functions and types from the auxiliary library +in alphabetical order. + + + +

luaL_addchar

+[-?, +?, m] +

void luaL_addchar (luaL_Buffer *B, char c);
+ +

+Adds the byte c to the buffer B +(see luaL_Buffer). + + + + + +

luaL_addgsub

+[-0, +0, m] +

const void luaL_addgsub (luaL_Buffer *B, const char *s,
+                         const char *p, const char *r);
+ +

+Adds a copy of the string s to the buffer B (see luaL_Buffer), +replacing any occurrence of the string p +with the string r. + + + + + +

luaL_addlstring

+[-?, +?, m] +

void luaL_addlstring (luaL_Buffer *B, const char *s, size_t l);
+ +

+Adds the string pointed to by s with length l to +the buffer B +(see luaL_Buffer). +The string can contain embedded zeros. + + + + + +

luaL_addsize

+[-?, +?, –] +

void luaL_addsize (luaL_Buffer *B, size_t n);
+ +

+Adds to the buffer B +a string of length n previously copied to the +buffer area (see luaL_prepbuffer). + + + + + +

luaL_addstring

+[-?, +?, m] +

void luaL_addstring (luaL_Buffer *B, const char *s);
+ +

+Adds the zero-terminated string pointed to by s +to the buffer B +(see luaL_Buffer). + + + + + +

luaL_addvalue

+[-1, +?, m] +

void luaL_addvalue (luaL_Buffer *B);
+ +

+Adds the value on the top of the stack +to the buffer B +(see luaL_Buffer). +Pops the value. + + +

+This is the only function on string buffers that can (and must) +be called with an extra element on the stack, +which is the value to be added to the buffer. + + + + + +

luaL_argcheck

+[-0, +0, v] +

void luaL_argcheck (lua_State *L,
+                    int cond,
+                    int arg,
+                    const char *extramsg);
+ +

+Checks whether cond is true. +If it is not, raises an error with a standard message (see luaL_argerror). + + + + + +

luaL_argerror

+[-0, +0, v] +

int luaL_argerror (lua_State *L, int arg, const char *extramsg);
+ +

+Raises an error reporting a problem with argument arg +of the C function that called it, +using a standard message +that includes extramsg as a comment: + +

+     bad argument #arg to 'funcname' (extramsg)
+

+This function never returns. + + + + + +

luaL_argexpected

+[-0, +0, v] +

void luaL_argexpected (lua_State *L,
+                       int cond,
+                       int arg,
+                       const char *tname);
+ +

+Checks whether cond is true. +If it is not, raises an error about the type of the argument arg +with a standard message (see luaL_typeerror). + + + + + +

luaL_Buffer

+
typedef struct luaL_Buffer luaL_Buffer;
+ +

+Type for a string buffer. + + +

+A string buffer allows C code to build Lua strings piecemeal. +Its pattern of use is as follows: + +

    + +
  • First declare a variable b of type luaL_Buffer.
    • + +
  • Then initialize it with a call luaL_buffinit(L, &b).
    • + +
  • +Then add string pieces to the buffer calling any of +the luaL_add* functions. +
    • + +
  • +Finish by calling luaL_pushresult(&b). +This call leaves the final string on the top of the stack. +
    • + +
+ +

+If you know beforehand the maximum size of the resulting string, +you can use the buffer like this: + +

    + +
  • First declare a variable b of type luaL_Buffer.
    • + +
  • Then initialize it and preallocate a space of +size sz with a call luaL_buffinitsize(L, &b, sz).
    • + +
  • Then produce the string into that space.
    • + +
  • +Finish by calling luaL_pushresultsize(&b, sz), +where sz is the total size of the resulting string +copied into that space (which may be less than or +equal to the preallocated size). +
    • + +
+ +

+During its normal operation, +a string buffer uses a variable number of stack slots. +So, while using a buffer, you cannot assume that you know where +the top of the stack is. +You can use the stack between successive calls to buffer operations +as long as that use is balanced; +that is, +when you call a buffer operation, +the stack is at the same level +it was immediately after the previous buffer operation. +(The only exception to this rule is luaL_addvalue.) +After calling luaL_pushresult, +the stack is back to its level when the buffer was initialized, +plus the final string on its top. + + + + + +

luaL_buffaddr

+[-0, +0, –] +

char *luaL_buffaddr (luaL_Buffer *B);
+ +

+Returns the address of the current content of buffer B +(see luaL_Buffer). +Note that any addition to the buffer may invalidate this address. + + + + + +

luaL_buffinit

+[-0, +0, –] +

void luaL_buffinit (lua_State *L, luaL_Buffer *B);
+ +

+Initializes a buffer B +(see luaL_Buffer). +This function does not allocate any space; +the buffer must be declared as a variable. + + + + + +

luaL_bufflen

+[-0, +0, –] +

size_t luaL_bufflen (luaL_Buffer *B);
+ +

+Returns the length of the current content of buffer B +(see luaL_Buffer). + + + + + +

luaL_buffinitsize

+[-?, +?, m] +

char *luaL_buffinitsize (lua_State *L, luaL_Buffer *B, size_t sz);
+ +

+Equivalent to the sequence +luaL_buffinit, luaL_prepbuffsize. + + + + + +

luaL_buffsub

+[-0, +0, –] +

void luaL_buffsub (luaL_Buffer *B, int n);
+ +

+Removes n bytes from the the buffer B +(see luaL_Buffer). +The buffer must have at least that many bytes. + + + + + +

luaL_callmeta

+[-0, +(0|1), e] +

int luaL_callmeta (lua_State *L, int obj, const char *e);
+ +

+Calls a metamethod. + + +

+If the object at index obj has a metatable and this +metatable has a field e, +this function calls this field passing the object as its only argument. +In this case this function returns true and pushes onto the +stack the value returned by the call. +If there is no metatable or no metamethod, +this function returns false without pushing any value on the stack. + + + + + +

luaL_checkany

+[-0, +0, v] +

void luaL_checkany (lua_State *L, int arg);
+ +

+Checks whether the function has an argument +of any type (including nil) at position arg. + + + + + +

luaL_checkinteger

+[-0, +0, v] +

lua_Integer luaL_checkinteger (lua_State *L, int arg);
+ +

+Checks whether the function argument arg is an integer +(or can be converted to an integer) +and returns this integer. + + + + + +

luaL_checklstring

+[-0, +0, v] +

const char *luaL_checklstring (lua_State *L, int arg, size_t *l);
+ +

+Checks whether the function argument arg is a string +and returns this string; +if l is not NULL fills its referent +with the string's length. + + +

+This function uses lua_tolstring to get its result, +so all conversions and caveats of that function apply here. + + + + + +

luaL_checknumber

+[-0, +0, v] +

lua_Number luaL_checknumber (lua_State *L, int arg);
+ +

+Checks whether the function argument arg is a number +and returns this number converted to a lua_Number. + + + + + +

luaL_checkoption

+[-0, +0, v] +

int luaL_checkoption (lua_State *L,
+                      int arg,
+                      const char *def,
+                      const char *const lst[]);
+ +

+Checks whether the function argument arg is a string and +searches for this string in the array lst +(which must be NULL-terminated). +Returns the index in the array where the string was found. +Raises an error if the argument is not a string or +if the string cannot be found. + + +

+If def is not NULL, +the function uses def as a default value when +there is no argument arg or when this argument is nil. + + +

+This is a useful function for mapping strings to C enums. +(The usual convention in Lua libraries is +to use strings instead of numbers to select options.) + + + + + +

luaL_checkstack

+[-0, +0, v] +

void luaL_checkstack (lua_State *L, int sz, const char *msg);
+ +

+Grows the stack size to top + sz elements, +raising an error if the stack cannot grow to that size. +msg is an additional text to go into the error message +(or NULL for no additional text). + + + + + +

luaL_checkstring

+[-0, +0, v] +

const char *luaL_checkstring (lua_State *L, int arg);
+ +

+Checks whether the function argument arg is a string +and returns this string. + + +

+This function uses lua_tolstring to get its result, +so all conversions and caveats of that function apply here. + + + + + +

luaL_checktype

+[-0, +0, v] +

void luaL_checktype (lua_State *L, int arg, int t);
+ +

+Checks whether the function argument arg has type t. +See lua_type for the encoding of types for t. + + + + + +

luaL_checkudata

+[-0, +0, v] +

void *luaL_checkudata (lua_State *L, int arg, const char *tname);
+ +

+Checks whether the function argument arg is a userdata +of the type tname (see luaL_newmetatable) and +returns the userdata's memory-block address (see lua_touserdata). + + + + + +

luaL_checkversion

+[-0, +0, v] +

void luaL_checkversion (lua_State *L);
+ +

+Checks whether the code making the call and the Lua library being called +are using the same version of Lua and the same numeric types. + + + + + +

luaL_dofile

+[-0, +?, m] +

int luaL_dofile (lua_State *L, const char *filename);
+ +

+Loads and runs the given file. +It is defined as the following macro: + +

+     (luaL_loadfile(L, filename) || lua_pcall(L, 0, LUA_MULTRET, 0))
+

+It returns LUA_OK if there are no errors, +or an error code in case of errors (see §4.4.1). + + + + + +

luaL_dostring

+[-0, +?, –] +

int luaL_dostring (lua_State *L, const char *str);
+ +

+Loads and runs the given string. +It is defined as the following macro: + +

+     (luaL_loadstring(L, str) || lua_pcall(L, 0, LUA_MULTRET, 0))
+

+It returns LUA_OK if there are no errors, +or an error code in case of errors (see §4.4.1). + + + + + +

luaL_error

+[-0, +0, v] +

int luaL_error (lua_State *L, const char *fmt, ...);
+ +

+Raises an error. +The error message format is given by fmt +plus any extra arguments, +following the same rules of lua_pushfstring. +It also adds at the beginning of the message the file name and +the line number where the error occurred, +if this information is available. + + +

+This function never returns, +but it is an idiom to use it in C functions +as return luaL_error(args). + + + + + +

luaL_execresult

+[-0, +3, m] +

int luaL_execresult (lua_State *L, int stat);
+ +

+This function produces the return values for +process-related functions in the standard library +(os.execute and io.close). + + + + + +

luaL_fileresult

+[-0, +(1|3), m] +

int luaL_fileresult (lua_State *L, int stat, const char *fname);
+ +

+This function produces the return values for +file-related functions in the standard library +(io.open, os.rename, file:seek, etc.). + + + + + +

luaL_getmetafield

+[-0, +(0|1), m] +

int luaL_getmetafield (lua_State *L, int obj, const char *e);
+ +

+Pushes onto the stack the field e from the metatable +of the object at index obj and returns the type of the pushed value. +If the object does not have a metatable, +or if the metatable does not have this field, +pushes nothing and returns LUA_TNIL. + + + + + +

luaL_getmetatable

+[-0, +1, m] +

int luaL_getmetatable (lua_State *L, const char *tname);
+ +

+Pushes onto the stack the metatable associated with the name tname +in the registry (see luaL_newmetatable), +or nil if there is no metatable associated with that name. +Returns the type of the pushed value. + + + + + +

luaL_getsubtable

+[-0, +1, e] +

int luaL_getsubtable (lua_State *L, int idx, const char *fname);
+ +

+Ensures that the value t[fname], +where t is the value at index idx, +is a table, +and pushes that table onto the stack. +Returns true if it finds a previous table there +and false if it creates a new table. + + + + + +

luaL_gsub

+[-0, +1, m] +

const char *luaL_gsub (lua_State *L,
+                       const char *s,
+                       const char *p,
+                       const char *r);
+ +

+Creates a copy of string s, +replacing any occurrence of the string p +with the string r. +Pushes the resulting string on the stack and returns it. + + + + + +

luaL_len

+[-0, +0, e] +

lua_Integer luaL_len (lua_State *L, int index);
+ +

+Returns the "length" of the value at the given index +as a number; +it is equivalent to the '#' operator in Lua (see §3.4.7). +Raises an error if the result of the operation is not an integer. +(This case can only happen through metamethods.) + + + + + +

luaL_loadbuffer

+[-0, +1, –] +

int luaL_loadbuffer (lua_State *L,
+                     const char *buff,
+                     size_t sz,
+                     const char *name);
+ +

+Equivalent to luaL_loadbufferx with mode equal to NULL. + + + + + +

luaL_loadbufferx

+[-0, +1, –] +

int luaL_loadbufferx (lua_State *L,
+                      const char *buff,
+                      size_t sz,
+                      const char *name,
+                      const char *mode);
+ +

+Loads a buffer as a Lua chunk. +This function uses lua_load to load the chunk in the +buffer pointed to by buff with size sz. + + +

+This function returns the same results as lua_load. +name is the chunk name, +used for debug information and error messages. +The string mode works as in the function lua_load. + + + + + +

luaL_loadfile

+[-0, +1, m] +

int luaL_loadfile (lua_State *L, const char *filename);
+ +

+Equivalent to luaL_loadfilex with mode equal to NULL. + + + + + +

luaL_loadfilex

+[-0, +1, m] +

int luaL_loadfilex (lua_State *L, const char *filename,
+                                            const char *mode);
+ +

+Loads a file as a Lua chunk. +This function uses lua_load to load the chunk in the file +named filename. +If filename is NULL, +then it loads from the standard input. +The first line in the file is ignored if it starts with a #. + + +

+The string mode works as in the function lua_load. + + +

+This function returns the same results as lua_load +or LUA_ERRFILE for file-related errors. + + +

+As lua_load, this function only loads the chunk; +it does not run it. + + + + + +

luaL_loadstring

+[-0, +1, –] +

int luaL_loadstring (lua_State *L, const char *s);
+ +

+Loads a string as a Lua chunk. +This function uses lua_load to load the chunk in +the zero-terminated string s. + + +

+This function returns the same results as lua_load. + + +

+Also as lua_load, this function only loads the chunk; +it does not run it. + + + + + +

luaL_newlib

+[-0, +1, m] +

void luaL_newlib (lua_State *L, const luaL_Reg l[]);
+ +

+Creates a new table and registers there +the functions in the list l. + + +

+It is implemented as the following macro: + +

+     (luaL_newlibtable(L,l), luaL_setfuncs(L,l,0))
+

+The array l must be the actual array, +not a pointer to it. + + + + + +

luaL_newlibtable

+[-0, +1, m] +

void luaL_newlibtable (lua_State *L, const luaL_Reg l[]);
+ +

+Creates a new table with a size optimized +to store all entries in the array l +(but does not actually store them). +It is intended to be used in conjunction with luaL_setfuncs +(see luaL_newlib). + + +

+It is implemented as a macro. +The array l must be the actual array, +not a pointer to it. + + + + + +

luaL_newmetatable

+[-0, +1, m] +

int luaL_newmetatable (lua_State *L, const char *tname);
+ +

+If the registry already has the key tname, +returns 0. +Otherwise, +creates a new table to be used as a metatable for userdata, +adds to this new table the pair __name = tname, +adds to the registry the pair [tname] = new table, +and returns 1. + + +

+In both cases, +the function pushes onto the stack the final value associated +with tname in the registry. + + + + + +

luaL_newstate

+[-0, +0, –] +

lua_State *luaL_newstate (void);
+ +

+Creates a new Lua state. +It calls lua_newstate with an +allocator based on the standard C allocation functions +and then sets a warning function and a panic function (see §4.4) +that print messages to the standard error output. + + +

+Returns the new state, +or NULL if there is a memory allocation error. + + + + + +

luaL_openlibs

+[-0, +0, e] +

void luaL_openlibs (lua_State *L);
+ +

+Opens all standard Lua libraries into the given state. + + + + + +

luaL_opt

+[-0, +0, –] +

T luaL_opt (L, func, arg, dflt);
+ +

+This macro is defined as follows: + +

+     (lua_isnoneornil(L,(arg)) ? (dflt) : func(L,(arg)))
+

+In words, if the argument arg is nil or absent, +the macro results in the default dflt. +Otherwise, it results in the result of calling func +with the state L and the argument index arg as +arguments. +Note that it evaluates the expression dflt only if needed. + + + + + +

luaL_optinteger

+[-0, +0, v] +

lua_Integer luaL_optinteger (lua_State *L,
+                             int arg,
+                             lua_Integer d);
+ +

+If the function argument arg is an integer +(or it is convertible to an integer), +returns this integer. +If this argument is absent or is nil, +returns d. +Otherwise, raises an error. + + + + + +

luaL_optlstring

+[-0, +0, v] +

const char *luaL_optlstring (lua_State *L,
+                             int arg,
+                             const char *d,
+                             size_t *l);
+ +

+If the function argument arg is a string, +returns this string. +If this argument is absent or is nil, +returns d. +Otherwise, raises an error. + + +

+If l is not NULL, +fills its referent with the result's length. +If the result is NULL +(only possible when returning d and d == NULL), +its length is considered zero. + + +

+This function uses lua_tolstring to get its result, +so all conversions and caveats of that function apply here. + + + + + +

luaL_optnumber

+[-0, +0, v] +

lua_Number luaL_optnumber (lua_State *L, int arg, lua_Number d);
+ +

+If the function argument arg is a number, +returns this number as a lua_Number. +If this argument is absent or is nil, +returns d. +Otherwise, raises an error. + + + + + +

luaL_optstring

+[-0, +0, v] +

const char *luaL_optstring (lua_State *L,
+                            int arg,
+                            const char *d);
+ +

+If the function argument arg is a string, +returns this string. +If this argument is absent or is nil, +returns d. +Otherwise, raises an error. + + + + + +

luaL_prepbuffer

+[-?, +?, m] +

char *luaL_prepbuffer (luaL_Buffer *B);
+ +

+Equivalent to luaL_prepbuffsize +with the predefined size LUAL_BUFFERSIZE. + + + + + +

luaL_prepbuffsize

+[-?, +?, m] +

char *luaL_prepbuffsize (luaL_Buffer *B, size_t sz);
+ +

+Returns an address to a space of size sz +where you can copy a string to be added to buffer B +(see luaL_Buffer). +After copying the string into this space you must call +luaL_addsize with the size of the string to actually add +it to the buffer. + + + + + +

luaL_pushfail

+[-0, +1, –] +

void luaL_pushfail (lua_State *L);
+ +

+Pushes the fail value onto the stack (see §6). + + + + + +

luaL_pushresult

+[-?, +1, m] +

void luaL_pushresult (luaL_Buffer *B);
+ +

+Finishes the use of buffer B leaving the final string on +the top of the stack. + + + + + +

luaL_pushresultsize

+[-?, +1, m] +

void luaL_pushresultsize (luaL_Buffer *B, size_t sz);
+ +

+Equivalent to the sequence luaL_addsize, luaL_pushresult. + + + + + +

luaL_ref

+[-1, +0, m] +

int luaL_ref (lua_State *L, int t);
+ +

+Creates and returns a reference, +in the table at index t, +for the object on the top of the stack (and pops the object). + + +

+A reference is a unique integer key. +As long as you do not manually add integer keys into the table t, +luaL_ref ensures the uniqueness of the key it returns. +You can retrieve an object referred by the reference r +by calling lua_rawgeti(L, t, r). +The function luaL_unref frees a reference. + + +

+If the object on the top of the stack is nil, +luaL_ref returns the constant LUA_REFNIL. +The constant LUA_NOREF is guaranteed to be different +from any reference returned by luaL_ref. + + + + + +

luaL_Reg

+
typedef struct luaL_Reg {
+  const char *name;
+  lua_CFunction func;
+} luaL_Reg;
+ +

+Type for arrays of functions to be registered by +luaL_setfuncs. +name is the function name and func is a pointer to +the function. +Any array of luaL_Reg must end with a sentinel entry +in which both name and func are NULL. + + + + + +

luaL_requiref

+[-0, +1, e] +

void luaL_requiref (lua_State *L, const char *modname,
+                    lua_CFunction openf, int glb);
+ +

+If package.loaded[modname] is not true, +calls the function openf with the string modname as an argument +and sets the call result to package.loaded[modname], +as if that function has been called through require. + + +

+If glb is true, +also stores the module into the global modname. + + +

+Leaves a copy of the module on the stack. + + + + + +

luaL_setfuncs

+[-nup, +0, m] +

void luaL_setfuncs (lua_State *L, const luaL_Reg *l, int nup);
+ +

+Registers all functions in the array l +(see luaL_Reg) into the table on the top of the stack +(below optional upvalues, see next). + + +

+When nup is not zero, +all functions are created with nup upvalues, +initialized with copies of the nup values +previously pushed on the stack +on top of the library table. +These values are popped from the stack after the registration. + + + + + +

luaL_setmetatable

+[-0, +0, –] +

void luaL_setmetatable (lua_State *L, const char *tname);
+ +

+Sets the metatable of the object on the top of the stack +as the metatable associated with name tname +in the registry (see luaL_newmetatable). + + + + + +

luaL_Stream

+
typedef struct luaL_Stream {
+  FILE *f;
+  lua_CFunction closef;
+} luaL_Stream;
+ +

+The standard representation for file handles +used by the standard I/O library. + + +

+A file handle is implemented as a full userdata, +with a metatable called LUA_FILEHANDLE +(where LUA_FILEHANDLE is a macro with the actual metatable's name). +The metatable is created by the I/O library +(see luaL_newmetatable). + + +

+This userdata must start with the structure luaL_Stream; +it can contain other data after this initial structure. +The field f points to the corresponding C stream +(or it can be NULL to indicate an incompletely created handle). +The field closef points to a Lua function +that will be called to close the stream +when the handle is closed or collected; +this function receives the file handle as its sole argument and +must return either a true value, in case of success, +or a false value plus an error message, in case of error. +Once Lua calls this field, +it changes the field value to NULL +to signal that the handle is closed. + + + + + +

luaL_testudata

+[-0, +0, m] +

void *luaL_testudata (lua_State *L, int arg, const char *tname);
+ +

+This function works like luaL_checkudata, +except that, when the test fails, +it returns NULL instead of raising an error. + + + + + +

luaL_tolstring

+[-0, +1, e] +

const char *luaL_tolstring (lua_State *L, int idx, size_t *len);
+ +

+Converts any Lua value at the given index to a C string +in a reasonable format. +The resulting string is pushed onto the stack and also +returned by the function (see §4.1.3). +If len is not NULL, +the function also sets *len with the string length. + + +

+If the value has a metatable with a __tostring field, +then luaL_tolstring calls the corresponding metamethod +with the value as argument, +and uses the result of the call as its result. + + + + + +

luaL_traceback

+[-0, +1, m] +

void luaL_traceback (lua_State *L, lua_State *L1, const char *msg,
+                     int level);
+ +

+Creates and pushes a traceback of the stack L1. +If msg is not NULL, it is appended +at the beginning of the traceback. +The level parameter tells at which level +to start the traceback. + + + + + +

luaL_typeerror

+[-0, +0, v] +

const char *luaL_typeerror (lua_State *L,
+                                      int arg,
+                                      const char *tname);
+ +

+Raises a type error for the argument arg +of the C function that called it, +using a standard message; +tname is a "name" for the expected type. +This function never returns. + + + + + +

luaL_typename

+[-0, +0, –] +

const char *luaL_typename (lua_State *L, int index);
+ +

+Returns the name of the type of the value at the given index. + + + + + +

luaL_unref

+[-0, +0, –] +

void luaL_unref (lua_State *L, int t, int ref);
+ +

+Releases the reference ref from the table at index t +(see luaL_ref). +The entry is removed from the table, +so that the referred object can be collected. +The reference ref is also freed to be used again. + + +

+If ref is LUA_NOREF or LUA_REFNIL, +luaL_unref does nothing. + + + + + +

luaL_where

+[-0, +1, m] +

void luaL_where (lua_State *L, int lvl);
+ +

+Pushes onto the stack a string identifying the current position +of the control at level lvl in the call stack. +Typically this string has the following format: + +

+     chunkname:currentline:
+

+Level 0 is the running function, +level 1 is the function that called the running function, +etc. + + +

+This function is used to build a prefix for error messages. + + + + + + + +

6 – The Standard Libraries

+ + + +

+The standard Lua libraries provide useful functions +that are implemented in C through the C API. +Some of these functions provide essential services to the language +(e.g., type and getmetatable); +others provide access to outside services (e.g., I/O); +and others could be implemented in Lua itself, +but that for different reasons +deserve an implementation in C (e.g., table.sort). + + +

+All libraries are implemented through the official C API +and are provided as separate C modules. +Unless otherwise noted, +these library functions do not adjust its number of arguments +to its expected parameters. +For instance, a function documented as foo(arg) +should not be called without an argument. + + +

+The notation fail means a false value representing +some kind of failure. +(Currently, fail is equal to nil, +but that may change in future versions. +The recommendation is to always test the success of these functions +with (not status), instead of (status == nil).) + + +

+Currently, Lua has the following standard libraries: + +

    + +
  • basic library (§6.1);
    • + +
  • coroutine library (§6.2);
    • + +
  • package library (§6.3);
    • + +
  • string manipulation (§6.4);
    • + +
  • basic UTF-8 support (§6.5);
    • + +
  • table manipulation (§6.6);
    • + +
  • mathematical functions (§6.7) (sin, log, etc.);
    • + +
  • input and output (§6.8);
    • + +
  • operating system facilities (§6.9);
    • + +
  • debug facilities (§6.10).
    • + +

+Except for the basic and the package libraries, +each library provides all its functions as fields of a global table +or as methods of its objects. + + +

+To have access to these libraries, +the C host program should call the luaL_openlibs function, +which opens all standard libraries. +Alternatively, +the host program can open them individually by using +luaL_requiref to call +luaopen_base (for the basic library), +luaopen_package (for the package library), +luaopen_coroutine (for the coroutine library), +luaopen_string (for the string library), +luaopen_utf8 (for the UTF-8 library), +luaopen_table (for the table library), +luaopen_math (for the mathematical library), +luaopen_io (for the I/O library), +luaopen_os (for the operating system library), +and luaopen_debug (for the debug library). +These functions are declared in lualib.h. + + + + + +

6.1 – Basic Functions

+ +

+The basic library provides core functions to Lua. +If you do not include this library in your application, +you should check carefully whether you need to provide +implementations for some of its facilities. + + +

+

assert (v [, message])

+ + +

+Raises an error if +the value of its argument v is false (i.e., nil or false); +otherwise, returns all its arguments. +In case of error, +message is the error object; +when absent, it defaults to "assertion failed!" + + + + +

+

collectgarbage ([opt [, arg]])

+ + +

+This function is a generic interface to the garbage collector. +It performs different functions according to its first argument, opt: + +

    + +
  • "collect": +Performs a full garbage-collection cycle. +This is the default option. +
    • + +
  • "stop": +Stops automatic execution of the garbage collector. +The collector will run only when explicitly invoked, +until a call to restart it. +
    • + +
  • "restart": +Restarts automatic execution of the garbage collector. +
    • + +
  • "count": +Returns the total memory in use by Lua in Kbytes. +The value has a fractional part, +so that it multiplied by 1024 +gives the exact number of bytes in use by Lua. +
    • + +
  • "step": +Performs a garbage-collection step. +The step "size" is controlled by arg. +With a zero value, +the collector will perform one basic (indivisible) step. +For non-zero values, +the collector will perform as if that amount of memory +(in Kbytes) had been allocated by Lua. +Returns true if the step finished a collection cycle. +
    • + +
  • "isrunning": +Returns a boolean that tells whether the collector is running +(i.e., not stopped). +
    • + +
  • "incremental": +Change the collector mode to incremental. +This option can be followed by three numbers: +the garbage-collector pause, +the step multiplier, +and the step size (see §2.5.1). +A zero means to not change that value. +
    • + +
  • "generational": +Change the collector mode to generational. +This option can be followed by two numbers: +the garbage-collector minor multiplier +and the major multiplier (see §2.5.2). +A zero means to not change that value. +
    • + +

+See §2.5 for more details about garbage collection +and some of these options. + + + + +

+

dofile ([filename])

+Opens the named file and executes its content as a Lua chunk. +When called without arguments, +dofile executes the content of the standard input (stdin). +Returns all values returned by the chunk. +In case of errors, dofile propagates the error +to its caller. +(That is, dofile does not run in protected mode.) + + + + +

+

error (message [, level])

+Raises an error (see §2.3) with @{message} as the error object. +This function never returns. + + +

+Usually, error adds some information about the error position +at the beginning of the message, if the message is a string. +The level argument specifies how to get the error position. +With level 1 (the default), the error position is where the +error function was called. +Level 2 points the error to where the function +that called error was called; and so on. +Passing a level 0 avoids the addition of error position information +to the message. + + + + +

+

_G

+A global variable (not a function) that +holds the global environment (see §2.2). +Lua itself does not use this variable; +changing its value does not affect any environment, +nor vice versa. + + + + +

+

getmetatable (object)

+ + +

+If object does not have a metatable, returns nil. +Otherwise, +if the object's metatable has a __metatable field, +returns the associated value. +Otherwise, returns the metatable of the given object. + + + + +

+

ipairs (t)

+ + +

+Returns three values (an iterator function, the table t, and 0) +so that the construction + +

+     for i,v in ipairs(t) do body end
+

+will iterate over the key–value pairs +(1,t[1]), (2,t[2]), ..., +up to the first absent index. + + + + +

+

load (chunk [, chunkname [, mode [, env]]])

+ + +

+Loads a chunk. + + +

+If chunk is a string, the chunk is this string. +If chunk is a function, +load calls it repeatedly to get the chunk pieces. +Each call to chunk must return a string that concatenates +with previous results. +A return of an empty string, nil, or no value signals the end of the chunk. + + +

+If there are no syntactic errors, +load returns the compiled chunk as a function; +otherwise, it returns fail plus the error message. + + +

+When you load a main chunk, +the resulting function will always have exactly one upvalue, +the _ENV variable (see §2.2). +However, +when you load a binary chunk created from a function (see string.dump), +the resulting function can have an arbitrary number of upvalues, +and there is no guarantee that its first upvalue will be +the _ENV variable. +(A non-main function may not even have an _ENV upvalue.) + + +

+Regardless, if the resulting function has any upvalues, +its first upvalue is set to the value of env, +if that parameter is given, +or to the value of the global environment. +Other upvalues are initialized with nil. +All upvalues are fresh, that is, +they are not shared with any other function. + + +

+chunkname is used as the name of the chunk for error messages +and debug information (see §4.7). +When absent, +it defaults to chunk, if chunk is a string, +or to "=(load)" otherwise. + + +

+The string mode controls whether the chunk can be text or binary +(that is, a precompiled chunk). +It may be the string "b" (only binary chunks), +"t" (only text chunks), +or "bt" (both binary and text). +The default is "bt". + + +

+It is safe to load malformed binary chunks; +load signals an appropriate error. +However, +Lua does not check the consistency of the code inside binary chunks; +running maliciously crafted bytecode can crash the interpreter. + + + + +

+

loadfile ([filename [, mode [, env]]])

+ + +

+Similar to load, +but gets the chunk from file filename +or from the standard input, +if no file name is given. + + + + +

+

next (table [, index])

+ + +

+Allows a program to traverse all fields of a table. +Its first argument is a table and its second argument +is an index in this table. +A call to next returns the next index of the table +and its associated value. +When called with nil as its second argument, +next returns an initial index +and its associated value. +When called with the last index, +or with nil in an empty table, +next returns nil. +If the second argument is absent, then it is interpreted as nil. +In particular, +you can use next(t) to check whether a table is empty. + + +

+The order in which the indices are enumerated is not specified, +even for numeric indices. +(To traverse a table in numerical order, +use a numerical for.) + + +

+The behavior of next is undefined if, +during the traversal, +you assign any value to a non-existent field in the table. +You may however modify existing fields. +In particular, you may set existing fields to nil. + + + + +

+

pairs (t)

+ + +

+If t has a metamethod __pairs, +calls it with t as argument and returns the first three +results from the call. + + +

+Otherwise, +returns three values: the next function, the table t, and nil, +so that the construction + +

+     for k,v in pairs(t) do body end
+

+will iterate over all key–value pairs of table t. + + +

+See function next for the caveats of modifying +the table during its traversal. + + + + +

+

pcall (f [, arg1, ···])

+ + +

+Calls the function f with +the given arguments in protected mode. +This means that any error inside f is not propagated; +instead, pcall catches the error +and returns a status code. +Its first result is the status code (a boolean), +which is true if the call succeeds without errors. +In such case, pcall also returns all results from the call, +after this first result. +In case of any error, pcall returns false plus the error object. +Note that errors caught by pcall do not call a message handler. + + + + +

+

print (···)

+Receives any number of arguments +and prints their values to stdout, +converting each argument to a string +following the same rules of tostring. + + +

+The function print is not intended for formatted output, +but only as a quick way to show a value, +for instance for debugging. +For complete control over the output, +use string.format and io.write. + + + + +

+

rawequal (v1, v2)

+Checks whether v1 is equal to v2, +without invoking the __eq metamethod. +Returns a boolean. + + + + +

+

rawget (table, index)

+Gets the real value of table[index], +without using the __index metavalue. +table must be a table; +index may be any value. + + + + +

+

rawlen (v)

+Returns the length of the object v, +which must be a table or a string, +without invoking the __len metamethod. +Returns an integer. + + + + +

+

rawset (table, index, value)

+Sets the real value of table[index] to value, +without using the __newindex metavalue. +table must be a table, +index any value different from nil and NaN, +and value any Lua value. + + +

+This function returns table. + + + + +

+

select (index, ···)

+ + +

+If index is a number, +returns all arguments after argument number index; +a negative number indexes from the end (-1 is the last argument). +Otherwise, index must be the string "#", +and select returns the total number of extra arguments it received. + + + + +

+

setmetatable (table, metatable)

+ + +

+Sets the metatable for the given table. +If metatable is nil, +removes the metatable of the given table. +If the original metatable has a __metatable field, +raises an error. + + +

+This function returns table. + + +

+To change the metatable of other types from Lua code, +you must use the debug library (§6.10). + + + + +

+

tonumber (e [, base])

+ + +

+When called with no base, +tonumber tries to convert its argument to a number. +If the argument is already a number or +a string convertible to a number, +then tonumber returns this number; +otherwise, it returns fail. + + +

+The conversion of strings can result in integers or floats, +according to the lexical conventions of Lua (see §3.1). +The string may have leading and trailing spaces and a sign. + + +

+When called with base, +then e must be a string to be interpreted as +an integer numeral in that base. +The base may be any integer between 2 and 36, inclusive. +In bases above 10, the letter 'A' (in either upper or lower case) +represents 10, 'B' represents 11, and so forth, +with 'Z' representing 35. +If the string e is not a valid numeral in the given base, +the function returns fail. + + + + +

+

tostring (v)

+ + +

+Receives a value of any type and +converts it to a string in a human-readable format. + + +

+If the metatable of v has a __tostring field, +then tostring calls the corresponding value +with v as argument, +and uses the result of the call as its result. +Otherwise, if the metatable of v has a __name field +with a string value, +tostring may use that string in its final result. + + +

+For complete control of how numbers are converted, +use string.format. + + + + +

+

type (v)

+ + +

+Returns the type of its only argument, coded as a string. +The possible results of this function are +"nil" (a string, not the value nil), +"number", +"string", +"boolean", +"table", +"function", +"thread", +and "userdata". + + + + +

+

_VERSION

+ + +

+A global variable (not a function) that +holds a string containing the running Lua version. +The current value of this variable is "Lua 5.4". + + + + +

+

warn (msg1, ···)

+ + +

+Emits a warning with a message composed by the concatenation +of all its arguments (which should be strings). + + +

+By convention, +a one-piece message starting with '@' +is intended to be a control message, +which is a message to the warning system itself. +In particular, the standard warning function in Lua +recognizes the control messages "@off", +to stop the emission of warnings, +and "@on", to (re)start the emission; +it ignores unknown control messages. + + + + +

+

xpcall (f, msgh [, arg1, ···])

+ + +

+This function is similar to pcall, +except that it sets a new message handler msgh. + + + + + + + +

6.2 – Coroutine Manipulation

+ +

+This library comprises the operations to manipulate coroutines, +which come inside the table coroutine. +See §2.6 for a general description of coroutines. + + +

+

coroutine.close (co)

+ + +

+Closes coroutine co, +that is, +closes all its pending to-be-closed variables +and puts the coroutine in a dead state. +The given coroutine must be dead or suspended. +In case of error +(either the original error that stopped the coroutine or +errors in closing methods), +returns false plus the error object; +otherwise returns true. + + + + +

+

coroutine.create (f)

+ + +

+Creates a new coroutine, with body f. +f must be a function. +Returns this new coroutine, +an object with type "thread". + + + + +

+

coroutine.isyieldable ([co])

+ + +

+Returns true when the coroutine co can yield. +The default for co is the running coroutine. + + +

+A coroutine is yieldable if it is not the main thread and +it is not inside a non-yieldable C function. + + + + +

+

coroutine.resume (co [, val1, ···])

+ + +

+Starts or continues the execution of coroutine co. +The first time you resume a coroutine, +it starts running its body. +The values val1, ... are passed +as the arguments to the body function. +If the coroutine has yielded, +resume restarts it; +the values val1, ... are passed +as the results from the yield. + + +

+If the coroutine runs without any errors, +resume returns true plus any values passed to yield +(when the coroutine yields) or any values returned by the body function +(when the coroutine terminates). +If there is any error, +resume returns false plus the error message. + + + + +

+

coroutine.running ()

+ + +

+Returns the running coroutine plus a boolean, +true when the running coroutine is the main one. + + + + +

+

coroutine.status (co)

+ + +

+Returns the status of the coroutine co, as a string: +"running", +if the coroutine is running +(that is, it is the one that called status); +"suspended", if the coroutine is suspended in a call to yield, +or if it has not started running yet; +"normal" if the coroutine is active but not running +(that is, it has resumed another coroutine); +and "dead" if the coroutine has finished its body function, +or if it has stopped with an error. + + + + +

+

coroutine.wrap (f)

+ + +

+Creates a new coroutine, with body f; +f must be a function. +Returns a function that resumes the coroutine each time it is called. +Any arguments passed to this function behave as the +extra arguments to resume. +The function returns the same values returned by resume, +except the first boolean. +In case of error, +the function closes the coroutine and propagates the error. + + + + +

+

coroutine.yield (···)

+ + +

+Suspends the execution of the calling coroutine. +Any arguments to yield are passed as extra results to resume. + + + + + + + +

6.3 – Modules

+ +

+The package library provides basic +facilities for loading modules in Lua. +It exports one function directly in the global environment: +require. +Everything else is exported in the table package. + + +

+

require (modname)

+ + +

+Loads the given module. +The function starts by looking into the package.loaded table +to determine whether modname is already loaded. +If it is, then require returns the value stored +at package.loaded[modname]. +(The absence of a second result in this case +signals that this call did not have to load the module.) +Otherwise, it tries to find a loader for the module. + + +

+To find a loader, +require is guided by the table package.searchers. +Each item in this table is a search function, +that searches for the module in a particular way. +By changing this table, +we can change how require looks for a module. +The following explanation is based on the default configuration +for package.searchers. + + +

+First require queries package.preload[modname]. +If it has a value, +this value (which must be a function) is the loader. +Otherwise require searches for a Lua loader using the +path stored in package.path. +If that also fails, it searches for a C loader using the +path stored in package.cpath. +If that also fails, +it tries an all-in-one loader (see package.searchers). + + +

+Once a loader is found, +require calls the loader with two arguments: +modname and an extra value, +a loader data, +also returned by the searcher. +The loader data can be any value useful to the module; +for the default searchers, +it indicates where the loader was found. +(For instance, if the loader came from a file, +this extra value is the file path.) +If the loader returns any non-nil value, +require assigns the returned value to package.loaded[modname]. +If the loader does not return a non-nil value and +has not assigned any value to package.loaded[modname], +then require assigns true to this entry. +In any case, require returns the +final value of package.loaded[modname]. +Besides that value, require also returns as a second result +the loader data returned by the searcher, +which indicates how require found the module. + + +

+If there is any error loading or running the module, +or if it cannot find any loader for the module, +then require raises an error. + + + + +

+

package.config

+ + +

+A string describing some compile-time configurations for packages. +This string is a sequence of lines: + +

    + +
  • The first line is the directory separator string. +Default is '\' for Windows and '/' for all other systems.
    • + +
  • The second line is the character that separates templates in a path. +Default is ';'.
    • + +
  • The third line is the string that marks the +substitution points in a template. +Default is '?'.
    • + +
  • The fourth line is a string that, in a path in Windows, +is replaced by the executable's directory. +Default is '!'.
    • + +
  • The fifth line is a mark to ignore all text after it +when building the luaopen_ function name. +Default is '-'.
    • + +
+ + + +

+

package.cpath

+ + +

+A string with the path used by require +to search for a C loader. + + +

+Lua initializes the C path package.cpath in the same way +it initializes the Lua path package.path, +using the environment variable LUA_CPATH_5_4, +or the environment variable LUA_CPATH, +or a default path defined in luaconf.h. + + + + +

+

package.loaded

+ + +

+A table used by require to control which +modules are already loaded. +When you require a module modname and +package.loaded[modname] is not false, +require simply returns the value stored there. + + +

+This variable is only a reference to the real table; +assignments to this variable do not change the +table used by require. + + + + +

+

package.loadlib (libname, funcname)

+ + +

+Dynamically links the host program with the C library libname. + + +

+If funcname is "*", +then it only links with the library, +making the symbols exported by the library +available to other dynamically linked libraries. +Otherwise, +it looks for a function funcname inside the library +and returns this function as a C function. +So, funcname must follow the lua_CFunction prototype +(see lua_CFunction). + + +

+This is a low-level function. +It completely bypasses the package and module system. +Unlike require, +it does not perform any path searching and +does not automatically adds extensions. +libname must be the complete file name of the C library, +including if necessary a path and an extension. +funcname must be the exact name exported by the C library +(which may depend on the C compiler and linker used). + + +

+This function is not supported by Standard C. +As such, it is only available on some platforms +(Windows, Linux, Mac OS X, Solaris, BSD, +plus other Unix systems that support the dlfcn standard). + + +

+This function is inherently insecure, +as it allows Lua to call any function in any readable dynamic +library in the system. +(Lua calls any function assuming the function +has a proper prototype and respects a proper protocol +(see lua_CFunction). +Therefore, +calling an arbitrary function in an arbitrary dynamic library +more often than not results in an access violation.) + + + + +

+

package.path

+ + +

+A string with the path used by require +to search for a Lua loader. + + +

+At start-up, Lua initializes this variable with +the value of the environment variable LUA_PATH_5_4 or +the environment variable LUA_PATH or +with a default path defined in luaconf.h, +if those environment variables are not defined. +A ";;" in the value of the environment variable +is replaced by the default path. + + + + +

+

package.preload

+ + +

+A table to store loaders for specific modules +(see require). + + +

+This variable is only a reference to the real table; +assignments to this variable do not change the +table used by require. + + + + +

+

package.searchers

+ + +

+A table used by require to control how to find modules. + + +

+Each entry in this table is a searcher function. +When looking for a module, +require calls each of these searchers in ascending order, +with the module name (the argument given to require) as its +sole argument. +If the searcher finds the module, +it returns another function, the module loader, +plus an extra value, a loader data, +that will be passed to that loader and +returned as a second result by require. +If it cannot find the module, +it returns a string explaining why +(or nil if it has nothing to say). + + +

+Lua initializes this table with four searcher functions. + + +

+The first searcher simply looks for a loader in the +package.preload table. + + +

+The second searcher looks for a loader as a Lua library, +using the path stored at package.path. +The search is done as described in function package.searchpath. + + +

+The third searcher looks for a loader as a C library, +using the path given by the variable package.cpath. +Again, +the search is done as described in function package.searchpath. +For instance, +if the C path is the string + +

+     "./?.so;./?.dll;/usr/local/?/init.so"
+

+the searcher for module foo +will try to open the files ./foo.so, ./foo.dll, +and /usr/local/foo/init.so, in that order. +Once it finds a C library, +this searcher first uses a dynamic link facility to link the +application with the library. +Then it tries to find a C function inside the library to +be used as the loader. +The name of this C function is the string "luaopen_" +concatenated with a copy of the module name where each dot +is replaced by an underscore. +Moreover, if the module name has a hyphen, +its suffix after (and including) the first hyphen is removed. +For instance, if the module name is a.b.c-v2.1, +the function name will be luaopen_a_b_c. + + +

+The fourth searcher tries an all-in-one loader. +It searches the C path for a library for +the root name of the given module. +For instance, when requiring a.b.c, +it will search for a C library for a. +If found, it looks into it for an open function for +the submodule; +in our example, that would be luaopen_a_b_c. +With this facility, a package can pack several C submodules +into one single library, +with each submodule keeping its original open function. + + +

+All searchers except the first one (preload) return as the extra value +the file path where the module was found, +as returned by package.searchpath. +The first searcher always returns the string ":preload:". + + +

+Searchers should raise no errors and have no side effects in Lua. +(They may have side effects in C, +for instance by linking the application with a library.) + + + + +

+

package.searchpath (name, path [, sep [, rep]])

+ + +

+Searches for the given name in the given path. + + +

+A path is a string containing a sequence of +templates separated by semicolons. +For each template, +the function replaces each interrogation mark (if any) +in the template with a copy of name +wherein all occurrences of sep +(a dot, by default) +were replaced by rep +(the system's directory separator, by default), +and then tries to open the resulting file name. + + +

+For instance, if the path is the string + +

+     "./?.lua;./?.lc;/usr/local/?/init.lua"
+

+the search for the name foo.a +will try to open the files +./foo/a.lua, ./foo/a.lc, and +/usr/local/foo/a/init.lua, in that order. + + +

+Returns the resulting name of the first file that it can +open in read mode (after closing the file), +or fail plus an error message if none succeeds. +(This error message lists all file names it tried to open.) + + + + + + + +

6.4 – String Manipulation

+ + + +

+This library provides generic functions for string manipulation, +such as finding and extracting substrings, and pattern matching. +When indexing a string in Lua, the first character is at position 1 +(not at 0, as in C). +Indices are allowed to be negative and are interpreted as indexing backwards, +from the end of the string. +Thus, the last character is at position -1, and so on. + + +

+The string library provides all its functions inside the table +string. +It also sets a metatable for strings +where the __index field points to the string table. +Therefore, you can use the string functions in object-oriented style. +For instance, string.byte(s,i) +can be written as s:byte(i). + + +

+The string library assumes one-byte character encodings. + + +

+

string.byte (s [, i [, j]])

+Returns the internal numeric codes of the characters s[i], +s[i+1], ..., s[j]. +The default value for i is 1; +the default value for j is i. +These indices are corrected +following the same rules of function string.sub. + + +

+Numeric codes are not necessarily portable across platforms. + + + + +

+

string.char (···)

+Receives zero or more integers. +Returns a string with length equal to the number of arguments, +in which each character has the internal numeric code equal +to its corresponding argument. + + +

+Numeric codes are not necessarily portable across platforms. + + + + +

+

string.dump (function [, strip])

+ + +

+Returns a string containing a binary representation +(a binary chunk) +of the given function, +so that a later load on this string returns +a copy of the function (but with new upvalues). +If strip is a true value, +the binary representation may not include all debug information +about the function, +to save space. + + +

+Functions with upvalues have only their number of upvalues saved. +When (re)loaded, +those upvalues receive fresh instances. +(See the load function for details about +how these upvalues are initialized. +You can use the debug library to serialize +and reload the upvalues of a function +in a way adequate to your needs.) + + + + +

+

string.find (s, pattern [, init [, plain]])

+ + +

+Looks for the first match of +pattern (see §6.4.1) in the string s. +If it finds a match, then find returns the indices of s +where this occurrence starts and ends; +otherwise, it returns fail. +A third, optional numeric argument init specifies +where to start the search; +its default value is 1 and can be negative. +A value of true as a fourth, optional argument plain +turns off the pattern matching facilities, +so the function does a plain "find substring" operation, +with no characters in pattern being considered magic. + + +

+If the pattern has captures, +then in a successful match +the captured values are also returned, +after the two indices. + + + + +

+

string.format (formatstring, ···)

+ + +

+Returns a formatted version of its variable number of arguments +following the description given in its first argument, +which must be a string. +The format string follows the same rules as the ISO C function sprintf. +The only differences are that the conversion specifiers and modifiers +*, h, L, l, and n are not supported +and that there is an extra specifier, q. + + +

+The specifier q formats booleans, nil, numbers, and strings +in a way that the result is a valid constant in Lua source code. +Booleans and nil are written in the obvious way +(true, false, nil). +Floats are written in hexadecimal, +to preserve full precision. +A string is written between double quotes, +using escape sequences when necessary to ensure that +it can safely be read back by the Lua interpreter. +For instance, the call + +

+     string.format('%q', 'a string with "quotes" and \n new line')
+

+may produce the string: + +

+     "a string with \"quotes\" and \
+      new line"
+

+This specifier does not support modifiers (flags, width, length). + + +

+The conversion specifiers +A, a, E, e, f, +G, and g all expect a number as argument. +The specifiers c, d, +i, o, u, X, and x +expect an integer. +When Lua is compiled with a C89 compiler, +the specifiers A and a (hexadecimal floats) +do not support modifiers. + + +

+The specifier s expects a string; +if its argument is not a string, +it is converted to one following the same rules of tostring. +If the specifier has any modifier, +the corresponding string argument should not contain embedded zeros. + + +

+The specifier p formats the pointer +returned by lua_topointer. +That gives a unique string identifier for tables, userdata, +threads, strings, and functions. +For other values (numbers, nil, booleans), +this specifier results in a string representing +the pointer NULL. + + + + +

+

string.gmatch (s, pattern [, init])

+Returns an iterator function that, +each time it is called, +returns the next captures from pattern (see §6.4.1) +over the string s. +If pattern specifies no captures, +then the whole match is produced in each call. +A third, optional numeric argument init specifies +where to start the search; +its default value is 1 and can be negative. + + +

+As an example, the following loop +will iterate over all the words from string s, +printing one per line: + +

+     s = "hello world from Lua"
+     for w in string.gmatch(s, "%a+") do
+       print(w)
+     end
+

+The next example collects all pairs key=value from the +given string into a table: + +

+     t = {}
+     s = "from=world, to=Lua"
+     for k, v in string.gmatch(s, "(%w+)=(%w+)") do
+       t[k] = v
+     end
+
+ +

+For this function, a caret '^' at the start of a pattern does not +work as an anchor, as this would prevent the iteration. + + + + +

+

string.gsub (s, pattern, repl [, n])

+Returns a copy of s +in which all (or the first n, if given) +occurrences of the pattern (see §6.4.1) have been +replaced by a replacement string specified by repl, +which can be a string, a table, or a function. +gsub also returns, as its second value, +the total number of matches that occurred. +The name gsub comes from Global SUBstitution. + + +

+If repl is a string, then its value is used for replacement. +The character % works as an escape character: +any sequence in repl of the form %d, +with d between 1 and 9, +stands for the value of the d-th captured substring; +the sequence %0 stands for the whole match; +the sequence %% stands for a single %. + + +

+If repl is a table, then the table is queried for every match, +using the first capture as the key. + + +

+If repl is a function, then this function is called every time a +match occurs, with all captured substrings passed as arguments, +in order. + + +

+In any case, +if the pattern specifies no captures, +then it behaves as if the whole pattern was inside a capture. + + +

+If the value returned by the table query or by the function call +is a string or a number, +then it is used as the replacement string; +otherwise, if it is false or nil, +then there is no replacement +(that is, the original match is kept in the string). + + +

+Here are some examples: + +

+     x = string.gsub("hello world", "(%w+)", "%1 %1")
+     --> x="hello hello world world"
+     
+     x = string.gsub("hello world", "%w+", "%0 %0", 1)
+     --> x="hello hello world"
+     
+     x = string.gsub("hello world from Lua", "(%w+)%s*(%w+)", "%2 %1")
+     --> x="world hello Lua from"
+     
+     x = string.gsub("home = $HOME, user = $USER", "%$(%w+)", os.getenv)
+     --> x="home = /home/roberto, user = roberto"
+     
+     x = string.gsub("4+5 = $return 4+5$", "%$(.-)%$", function (s)
+           return load(s)()
+         end)
+     --> x="4+5 = 9"
+     
+     local t = {name="lua", version="5.4"}
+     x = string.gsub("$name-$version.tar.gz", "%$(%w+)", t)
+     --> x="lua-5.4.tar.gz"
+
+ + + +

+

string.len (s)

+ + +

+Receives a string and returns its length. +The empty string "" has length 0. +Embedded zeros are counted, +so "a\000bc\000" has length 5. + + + + +

+

string.lower (s)

+ + +

+Receives a string and returns a copy of this string with all +uppercase letters changed to lowercase. +All other characters are left unchanged. +The definition of what an uppercase letter is depends on the current locale. + + + + +

+

string.match (s, pattern [, init])

+ + +

+Looks for the first match of +the pattern (see §6.4.1) in the string s. +If it finds one, then match returns +the captures from the pattern; +otherwise it returns fail. +If pattern specifies no captures, +then the whole match is returned. +A third, optional numeric argument init specifies +where to start the search; +its default value is 1 and can be negative. + + + + +

+

string.pack (fmt, v1, v2, ···)

+ + +

+Returns a binary string containing the values v1, v2, etc. +serialized in binary form (packed) +according to the format string fmt (see §6.4.2). + + + + +

+

string.packsize (fmt)

+ + +

+Returns the size of a string resulting from string.pack +with the given format. +The format string cannot have the variable-length options +'s' or 'z' (see §6.4.2). + + + + +

+

string.rep (s, n [, sep])

+ + +

+Returns a string that is the concatenation of n copies of +the string s separated by the string sep. +The default value for sep is the empty string +(that is, no separator). +Returns the empty string if n is not positive. + + +

+(Note that it is very easy to exhaust the memory of your machine +with a single call to this function.) + + + + +

+

string.reverse (s)

+ + +

+Returns a string that is the string s reversed. + + + + +

+

string.sub (s, i [, j])

+ + +

+Returns the substring of s that +starts at i and continues until j; +i and j can be negative. +If j is absent, then it is assumed to be equal to -1 +(which is the same as the string length). +In particular, +the call string.sub(s,1,j) returns a prefix of s +with length j, +and string.sub(s, -i) (for a positive i) +returns a suffix of s +with length i. + + +

+If, after the translation of negative indices, +i is less than 1, +it is corrected to 1. +If j is greater than the string length, +it is corrected to that length. +If, after these corrections, +i is greater than j, +the function returns the empty string. + + + + +

+

string.unpack (fmt, s [, pos])

+ + +

+Returns the values packed in string s (see string.pack) +according to the format string fmt (see §6.4.2). +An optional pos marks where +to start reading in s (default is 1). +After the read values, +this function also returns the index of the first unread byte in s. + + + + +

+

string.upper (s)

+ + +

+Receives a string and returns a copy of this string with all +lowercase letters changed to uppercase. +All other characters are left unchanged. +The definition of what a lowercase letter is depends on the current locale. + + + + + + + +

6.4.1 – Patterns

+ + + +

+Patterns in Lua are described by regular strings, +which are interpreted as patterns by the pattern-matching functions +string.find, +string.gmatch, +string.gsub, +and string.match. +This section describes the syntax and the meaning +(that is, what they match) of these strings. + + + + + +

Character Class:

+A character class is used to represent a set of characters. +The following combinations are allowed in describing a character class: + +

    + +
  • x: +(where x is not one of the magic characters +^$()%.[]*+-?) +represents the character x itself. +
    • + +
  • .: (a dot) represents all characters.
    • + +
  • %a: represents all letters.
    • + +
  • %c: represents all control characters.
    • + +
  • %d: represents all digits.
    • + +
  • %g: represents all printable characters except space.
    • + +
  • %l: represents all lowercase letters.
    • + +
  • %p: represents all punctuation characters.
    • + +
  • %s: represents all space characters.
    • + +
  • %u: represents all uppercase letters.
    • + +
  • %w: represents all alphanumeric characters.
    • + +
  • %x: represents all hexadecimal digits.
    • + +
  • %x: (where x is any non-alphanumeric character) +represents the character x. +This is the standard way to escape the magic characters. +Any non-alphanumeric character +(including all punctuation characters, even the non-magical) +can be preceded by a '%' to represent itself in a pattern. +
    • + +
  • [set]: +represents the class which is the union of all +characters in set. +A range of characters can be specified by +separating the end characters of the range, +in ascending order, with a '-'. +All classes %x described above can also be used as +components in set. +All other characters in set represent themselves. +For example, [%w_] (or [_%w]) +represents all alphanumeric characters plus the underscore, +[0-7] represents the octal digits, +and [0-7%l%-] represents the octal digits plus +the lowercase letters plus the '-' character. + + +

    +You can put a closing square bracket in a set +by positioning it as the first character in the set. +You can put a hyphen in a set +by positioning it as the first or the last character in the set. +(You can also use an escape for both cases.) + + +

    +The interaction between ranges and classes is not defined. +Therefore, patterns like [%a-z] or [a-%%] +have no meaning. +

    • + +
  • [^set]: +represents the complement of set, +where set is interpreted as above. +
    • + +

+For all classes represented by single letters (%a, %c, etc.), +the corresponding uppercase letter represents the complement of the class. +For instance, %S represents all non-space characters. + + +

+The definitions of letter, space, and other character groups +depend on the current locale. +In particular, the class [a-z] may not be equivalent to %l. + + + + + +

Pattern Item:

+A pattern item can be + +

    + +
  • +a single character class, +which matches any single character in the class; +
    • + +
  • +a single character class followed by '*', +which matches sequences of zero or more characters in the class. +These repetition items will always match the longest possible sequence; +
    • + +
  • +a single character class followed by '+', +which matches sequences of one or more characters in the class. +These repetition items will always match the longest possible sequence; +
    • + +
  • +a single character class followed by '-', +which also matches sequences of zero or more characters in the class. +Unlike '*', +these repetition items will always match the shortest possible sequence; +
    • + +
  • +a single character class followed by '?', +which matches zero or one occurrence of a character in the class. +It always matches one occurrence if possible; +
    • + +
  • +%n, for n between 1 and 9; +such item matches a substring equal to the n-th captured string +(see below); +
    • + +
  • +%bxy, where x and y are two distinct characters; +such item matches strings that start with x, end with y, +and where the x and y are balanced. +This means that, if one reads the string from left to right, +counting +1 for an x and -1 for a y, +the ending y is the first y where the count reaches 0. +For instance, the item %b() matches expressions with +balanced parentheses. +
    • + +
  • +%f[set], a frontier pattern; +such item matches an empty string at any position such that +the next character belongs to set +and the previous character does not belong to set. +The set set is interpreted as previously described. +The beginning and the end of the subject are handled as if +they were the character '\0'. +
    • + +
+ + + + +

Pattern:

+A pattern is a sequence of pattern items. +A caret '^' at the beginning of a pattern anchors the match at the +beginning of the subject string. +A '$' at the end of a pattern anchors the match at the +end of the subject string. +At other positions, +'^' and '$' have no special meaning and represent themselves. + + + + + +

Captures:

+A pattern can contain sub-patterns enclosed in parentheses; +they describe captures. +When a match succeeds, the substrings of the subject string +that match captures are stored (captured) for future use. +Captures are numbered according to their left parentheses. +For instance, in the pattern "(a*(.)%w(%s*))", +the part of the string matching "a*(.)%w(%s*)" is +stored as the first capture, and therefore has number 1; +the character matching "." is captured with number 2, +and the part matching "%s*" has number 3. + + +

+As a special case, the capture () captures +the current string position (a number). +For instance, if we apply the pattern "()aa()" on the +string "flaaap", there will be two captures: 3 and 5. + + + + + +

Multiple matches:

+The function string.gsub and the iterator string.gmatch +match multiple occurrences of the given pattern in the subject. +For these functions, +a new match is considered valid only +if it ends at least one byte after the end of the previous match. +In other words, the pattern machine never accepts the +empty string as a match immediately after another match. +As an example, +consider the results of the following code: + +

+     > string.gsub("abc", "()a*()", print);
+     --> 1   2
+     --> 3   3
+     --> 4   4
+

+The second and third results come from Lua matching an empty +string after 'b' and another one after 'c'. +Lua does not match an empty string after 'a', +because it would end at the same position of the previous match. + + + + + + + +

6.4.2 – Format Strings for Pack and Unpack

+ +

+The first argument to string.pack, +string.packsize, and string.unpack +is a format string, +which describes the layout of the structure being created or read. + + +

+A format string is a sequence of conversion options. +The conversion options are as follows: + +

    +
  • <: sets little endian
    • +
  • >: sets big endian
    • +
  • =: sets native endian
    • +
  • ![n]: sets maximum alignment to n +(default is native alignment)
    • +
  • b: a signed byte (char)
    • +
  • B: an unsigned byte (char)
    • +
  • h: a signed short (native size)
    • +
  • H: an unsigned short (native size)
    • +
  • l: a signed long (native size)
    • +
  • L: an unsigned long (native size)
    • +
  • j: a lua_Integer
    • +
  • J: a lua_Unsigned
    • +
  • T: a size_t (native size)
    • +
  • i[n]: a signed int with n bytes +(default is native size)
    • +
  • I[n]: an unsigned int with n bytes +(default is native size)
    • +
  • f: a float (native size)
    • +
  • d: a double (native size)
    • +
  • n: a lua_Number
    • +
  • cn: a fixed-sized string with n bytes
    • +
  • z: a zero-terminated string
    • +
  • s[n]: a string preceded by its length +coded as an unsigned integer with n bytes +(default is a size_t)
    • +
  • x: one byte of padding
    • +
  • Xop: an empty item that aligns +according to option op +(which is otherwise ignored)
    • +
  • ' ': (space) ignored
    • +

+(A "[n]" means an optional integral numeral.) +Except for padding, spaces, and configurations +(options "xX <=>!"), +each option corresponds to an argument in string.pack +or a result in string.unpack. + + +

+For options "!n", "sn", "in", and "In", +n can be any integer between 1 and 16. +All integral options check overflows; +string.pack checks whether the given value fits in the given size; +string.unpack checks whether the read value fits in a Lua integer. +For the unsigned options, +Lua integers are treated as unsigned values too. + + +

+Any format string starts as if prefixed by "!1=", +that is, +with maximum alignment of 1 (no alignment) +and native endianness. + + +

+Native endianness assumes that the whole system is +either big or little endian. +The packing functions will not emulate correctly the behavior +of mixed-endian formats. + + +

+Alignment works as follows: +For each option, +the format gets extra padding until the data starts +at an offset that is a multiple of the minimum between the +option size and the maximum alignment; +this minimum must be a power of 2. +Options "c" and "z" are not aligned; +option "s" follows the alignment of its starting integer. + + +

+All padding is filled with zeros by string.pack +and ignored by string.unpack. + + + + + + + +

6.5 – UTF-8 Support

+ +

+This library provides basic support for UTF-8 encoding. +It provides all its functions inside the table utf8. +This library does not provide any support for Unicode other +than the handling of the encoding. +Any operation that needs the meaning of a character, +such as character classification, is outside its scope. + + +

+Unless stated otherwise, +all functions that expect a byte position as a parameter +assume that the given position is either the start of a byte sequence +or one plus the length of the subject string. +As in the string library, +negative indices count from the end of the string. + + +

+Functions that create byte sequences +accept all values up to 0x7FFFFFFF, +as defined in the original UTF-8 specification; +that implies byte sequences of up to six bytes. + + +

+Functions that interpret byte sequences only accept +valid sequences (well formed and not overlong). +By default, they only accept byte sequences +that result in valid Unicode code points, +rejecting values greater than 10FFFF and surrogates. +A boolean argument lax, when available, +lifts these checks, +so that all values up to 0x7FFFFFFF are accepted. +(Not well formed and overlong sequences are still rejected.) + + +

+

utf8.char (···)

+ + +

+Receives zero or more integers, +converts each one to its corresponding UTF-8 byte sequence +and returns a string with the concatenation of all these sequences. + + + + +

+

utf8.charpattern

+ + +

+The pattern (a string, not a function) "[\0-\x7F\xC2-\xFD][\x80-\xBF]*" +(see §6.4.1), +which matches exactly one UTF-8 byte sequence, +assuming that the subject is a valid UTF-8 string. + + + + +

+

utf8.codes (s [, lax])

+ + +

+Returns values so that the construction + +

+     for p, c in utf8.codes(s) do body end
+

+will iterate over all UTF-8 characters in string s, +with p being the position (in bytes) and c the code point +of each character. +It raises an error if it meets any invalid byte sequence. + + + + +

+

utf8.codepoint (s [, i [, j [, lax]]])

+ + +

+Returns the code points (as integers) from all characters in s +that start between byte position i and j (both included). +The default for i is 1 and for j is i. +It raises an error if it meets any invalid byte sequence. + + + + +

+

utf8.len (s [, i [, j [, lax]]])

+ + +

+Returns the number of UTF-8 characters in string s +that start between positions i and j (both inclusive). +The default for i is 1 and for j is -1. +If it finds any invalid byte sequence, +returns fail plus the position of the first invalid byte. + + + + +

+

utf8.offset (s, n [, i])

+ + +

+Returns the position (in bytes) where the encoding of the +n-th character of s +(counting from position i) starts. +A negative n gets characters before position i. +The default for i is 1 when n is non-negative +and #s + 1 otherwise, +so that utf8.offset(s, -n) gets the offset of the +n-th character from the end of the string. +If the specified character is neither in the subject +nor right after its end, +the function returns fail. + + +

+As a special case, +when n is 0 the function returns the start of the encoding +of the character that contains the i-th byte of s. + + +

+This function assumes that s is a valid UTF-8 string. + + + + + + + +

6.6 – Table Manipulation

+ +

+This library provides generic functions for table manipulation. +It provides all its functions inside the table table. + + +

+Remember that, whenever an operation needs the length of a table, +all caveats about the length operator apply (see §3.4.7). +All functions ignore non-numeric keys +in the tables given as arguments. + + +

+

table.concat (list [, sep [, i [, j]]])

+ + +

+Given a list where all elements are strings or numbers, +returns the string list[i]..sep..list[i+1] ··· sep..list[j]. +The default value for sep is the empty string, +the default for i is 1, +and the default for j is #list. +If i is greater than j, returns the empty string. + + + + +

+

table.insert (list, [pos,] value)

+ + +

+Inserts element value at position pos in list, +shifting up the elements +list[pos], list[pos+1], ···, list[#list]. +The default value for pos is #list+1, +so that a call table.insert(t,x) inserts x at the end +of the list t. + + + + +

+

table.move (a1, f, e, t [,a2])

+ + +

+Moves elements from the table a1 to the table a2, +performing the equivalent to the following +multiple assignment: +a2[t],··· = a1[f],···,a1[e]. +The default for a2 is a1. +The destination range can overlap with the source range. +The number of elements to be moved must fit in a Lua integer. + + +

+Returns the destination table a2. + + + + +

+

table.pack (···)

+ + +

+Returns a new table with all arguments stored into keys 1, 2, etc. +and with a field "n" with the total number of arguments. +Note that the resulting table may not be a sequence, +if some arguments are nil. + + + + +

+

table.remove (list [, pos])

+ + +

+Removes from list the element at position pos, +returning the value of the removed element. +When pos is an integer between 1 and #list, +it shifts down the elements +list[pos+1], list[pos+2], ···, list[#list] +and erases element list[#list]; +The index pos can also be 0 when #list is 0, +or #list + 1. + + +

+The default value for pos is #list, +so that a call table.remove(l) removes the last element +of the list l. + + + + +

+

table.sort (list [, comp])

+ + +

+Sorts the list elements in a given order, in-place, +from list[1] to list[#list]. +If comp is given, +then it must be a function that receives two list elements +and returns true when the first element must come +before the second in the final order, +so that, after the sort, +i <= j implies not comp(list[j],list[i]). +If comp is not given, +then the standard Lua operator < is used instead. + + +

+The comp function must define a consistent order; +more formally, the function must define a strict weak order. +(A weak order is similar to a total order, +but it can equate different elements for comparison purposes.) + + +

+The sort algorithm is not stable: +Different elements considered equal by the given order +may have their relative positions changed by the sort. + + + + +

+

table.unpack (list [, i [, j]])

+ + +

+Returns the elements from the given list. +This function is equivalent to + +

+     return list[i], list[i+1], ···, list[j]
+

+By default, i is 1 and j is #list. + + + + + + + +

6.7 – Mathematical Functions

+ +

+This library provides basic mathematical functions. +It provides all its functions and constants inside the table math. +Functions with the annotation "integer/float" give +integer results for integer arguments +and float results for non-integer arguments. +The rounding functions +math.ceil, math.floor, and math.modf +return an integer when the result fits in the range of an integer, +or a float otherwise. + + +

+

math.abs (x)

+ + +

+Returns the maximum value between x and -x. (integer/float) + + + + +

+

math.acos (x)

+ + +

+Returns the arc cosine of x (in radians). + + + + +

+

math.asin (x)

+ + +

+Returns the arc sine of x (in radians). + + + + +

+

math.atan (y [, x])

+ + +

+ +Returns the arc tangent of y/x (in radians), +but uses the signs of both arguments to find the +quadrant of the result. +It also handles correctly the case of x being zero. + + +

+The default value for x is 1, +so that the call math.atan(y) +returns the arc tangent of y. + + + + +

+

math.ceil (x)

+ + +

+Returns the smallest integral value greater than or equal to x. + + + + +

+

math.cos (x)

+ + +

+Returns the cosine of x (assumed to be in radians). + + + + +

+

math.deg (x)

+ + +

+Converts the angle x from radians to degrees. + + + + +

+

math.exp (x)

+ + +

+Returns the value ex +(where e is the base of natural logarithms). + + + + +

+

math.floor (x)

+ + +

+Returns the largest integral value less than or equal to x. + + + + +

+

math.fmod (x, y)

+ + +

+Returns the remainder of the division of x by y +that rounds the quotient towards zero. (integer/float) + + + + +

+

math.huge

+ + +

+The float value HUGE_VAL, +a value greater than any other numeric value. + + + + +

+

math.log (x [, base])

+ + +

+Returns the logarithm of x in the given base. +The default for base is e +(so that the function returns the natural logarithm of x). + + + + +

+

math.max (x, ···)

+ + +

+Returns the argument with the maximum value, +according to the Lua operator <. + + + + +

+

math.maxinteger

+An integer with the maximum value for an integer. + + + + +

+

math.min (x, ···)

+ + +

+Returns the argument with the minimum value, +according to the Lua operator <. + + + + +

+

math.mininteger

+An integer with the minimum value for an integer. + + + + +

+

math.modf (x)

+ + +

+Returns the integral part of x and the fractional part of x. +Its second result is always a float. + + + + +

+

math.pi

+ + +

+The value of π. + + + + +

+

math.rad (x)

+ + +

+Converts the angle x from degrees to radians. + + + + +

+

math.random ([m [, n]])

+ + +

+When called without arguments, +returns a pseudo-random float with uniform distribution +in the range [0,1). +When called with two integers m and n, +math.random returns a pseudo-random integer +with uniform distribution in the range [m, n]. +The call math.random(n), for a positive n, +is equivalent to math.random(1,n). +The call math.random(0) produces an integer with +all bits (pseudo)random. + + +

+This function uses the xoshiro256** algorithm to produce +pseudo-random 64-bit integers, +which are the results of calls with argument 0. +Other results (ranges and floats) +are unbiased extracted from these integers. + + +

+Lua initializes its pseudo-random generator with the equivalent of +a call to math.randomseed with no arguments, +so that math.random should generate +different sequences of results each time the program runs. + + + + +

+

math.randomseed ([x [, y]])

+ + +

+When called with at least one argument, +the integer parameters x and y are +joined into a 128-bit seed that +is used to reinitialize the pseudo-random generator; +equal seeds produce equal sequences of numbers. +The default for y is zero. + + +

+When called with no arguments, +Lua generates a seed with +a weak attempt for randomness. + + +

+This function returns the two seed components +that were effectively used, +so that setting them again repeats the sequence. + + +

+To ensure a required level of randomness to the initial state +(or contrarily, to have a deterministic sequence, +for instance when debugging a program), +you should call math.randomseed with explicit arguments. + + + + +

+

math.sin (x)

+ + +

+Returns the sine of x (assumed to be in radians). + + + + +

+

math.sqrt (x)

+ + +

+Returns the square root of x. +(You can also use the expression x^0.5 to compute this value.) + + + + +

+

math.tan (x)

+ + +

+Returns the tangent of x (assumed to be in radians). + + + + +

+

math.tointeger (x)

+ + +

+If the value x is convertible to an integer, +returns that integer. +Otherwise, returns fail. + + + + +

+

math.type (x)

+ + +

+Returns "integer" if x is an integer, +"float" if it is a float, +or fail if x is not a number. + + + + +

+

math.ult (m, n)

+ + +

+Returns a boolean, +true if and only if integer m is below integer n when +they are compared as unsigned integers. + + + + + + + +

6.8 – Input and Output Facilities

+ +

+The I/O library provides two different styles for file manipulation. +The first one uses implicit file handles; +that is, there are operations to set a default input file and a +default output file, +and all input/output operations are done over these default files. +The second style uses explicit file handles. + + +

+When using implicit file handles, +all operations are supplied by table io. +When using explicit file handles, +the operation io.open returns a file handle +and then all operations are supplied as methods of the file handle. + + +

+The metatable for file handles provides metamethods +for __gc and __close that try +to close the file when called. + + +

+The table io also provides +three predefined file handles with their usual meanings from C: +io.stdin, io.stdout, and io.stderr. +The I/O library never closes these files. + + +

+Unless otherwise stated, +all I/O functions return fail on failure, +plus an error message as a second result and +a system-dependent error code as a third result, +and some non-false value on success. +On non-POSIX systems, +the computation of the error message and error code +in case of errors +may be not thread safe, +because they rely on the global C variable errno. + + +

+

io.close ([file])

+ + +

+Equivalent to file:close(). +Without a file, closes the default output file. + + + + +

+

io.flush ()

+ + +

+Equivalent to io.output():flush(). + + + + +

+

io.input ([file])

+ + +

+When called with a file name, it opens the named file (in text mode), +and sets its handle as the default input file. +When called with a file handle, +it simply sets this file handle as the default input file. +When called without arguments, +it returns the current default input file. + + +

+In case of errors this function raises the error, +instead of returning an error code. + + + + +

+

io.lines ([filename, ···])

+ + +

+Opens the given file name in read mode +and returns an iterator function that +works like file:lines(···) over the opened file. +When the iterator function fails to read any value, +it automatically closes the file. +Besides the iterator function, +io.lines returns three other values: +two nil values as placeholders, +plus the created file handle. +Therefore, when used in a generic for loop, +the file is closed also if the loop is interrupted by an +error or a break. + + +

+The call io.lines() (with no file name) is equivalent +to io.input():lines("l"); +that is, it iterates over the lines of the default input file. +In this case, the iterator does not close the file when the loop ends. + + +

+In case of errors opening the file, +this function raises the error, +instead of returning an error code. + + + + +

+

io.open (filename [, mode])

+ + +

+This function opens a file, +in the mode specified in the string mode. +In case of success, +it returns a new file handle. + + +

+The mode string can be any of the following: + +

    +
  • "r": read mode (the default);
    • +
  • "w": write mode;
    • +
  • "a": append mode;
    • +
  • "r+": update mode, all previous data is preserved;
    • +
  • "w+": update mode, all previous data is erased;
    • +
  • "a+": append update mode, previous data is preserved, + writing is only allowed at the end of file.
    • +

+The mode string can also have a 'b' at the end, +which is needed in some systems to open the file in binary mode. + + + + +

+

io.output ([file])

+ + +

+Similar to io.input, but operates over the default output file. + + + + +

+

io.popen (prog [, mode])

+ + +

+This function is system dependent and is not available +on all platforms. + + +

+Starts the program prog in a separated process and returns +a file handle that you can use to read data from this program +(if mode is "r", the default) +or to write data to this program +(if mode is "w"). + + + + +

+

io.read (···)

+ + +

+Equivalent to io.input():read(···). + + + + +

+

io.tmpfile ()

+ + +

+In case of success, +returns a handle for a temporary file. +This file is opened in update mode +and it is automatically removed when the program ends. + + + + +

+

io.type (obj)

+ + +

+Checks whether obj is a valid file handle. +Returns the string "file" if obj is an open file handle, +"closed file" if obj is a closed file handle, +or fail if obj is not a file handle. + + + + +

+

io.write (···)

+ + +

+Equivalent to io.output():write(···). + + + + +

+

file:close ()

+ + +

+Closes file. +Note that files are automatically closed when +their handles are garbage collected, +but that takes an unpredictable amount of time to happen. + + +

+When closing a file handle created with io.popen, +file:close returns the same values +returned by os.execute. + + + + +

+

file:flush ()

+ + +

+Saves any written data to file. + + + + +

+

file:lines (···)

+ + +

+Returns an iterator function that, +each time it is called, +reads the file according to the given formats. +When no format is given, +uses "l" as a default. +As an example, the construction + +

+     for c in file:lines(1) do body end
+

+will iterate over all characters of the file, +starting at the current position. +Unlike io.lines, this function does not close the file +when the loop ends. + + + + +

+

file:read (···)

+ + +

+Reads the file file, +according to the given formats, which specify what to read. +For each format, +the function returns a string or a number with the characters read, +or fail if it cannot read data with the specified format. +(In this latter case, +the function does not read subsequent formats.) +When called without arguments, +it uses a default format that reads the next line +(see below). + + +

+The available formats are + +

    + +
  • "n": +reads a numeral and returns it as a float or an integer, +following the lexical conventions of Lua. +(The numeral may have leading whitespaces and a sign.) +This format always reads the longest input sequence that +is a valid prefix for a numeral; +if that prefix does not form a valid numeral +(e.g., an empty string, "0x", or "3.4e-") +or it is too long (more than 200 characters), +it is discarded and the format returns fail. +
    • + +
  • "a": +reads the whole file, starting at the current position. +On end of file, it returns the empty string; +this format never fails. +
    • + +
  • "l": +reads the next line skipping the end of line, +returning fail on end of file. +This is the default format. +
    • + +
  • "L": +reads the next line keeping the end-of-line character (if present), +returning fail on end of file. +
    • + +
  • number: +reads a string with up to this number of bytes, +returning fail on end of file. +If number is zero, +it reads nothing and returns an empty string, +or fail on end of file. +
    • + +

+The formats "l" and "L" should be used only for text files. + + + + +

+

file:seek ([whence [, offset]])

+ + +

+Sets and gets the file position, +measured from the beginning of the file, +to the position given by offset plus a base +specified by the string whence, as follows: + +

    +
  • "set": base is position 0 (beginning of the file);
    • +
  • "cur": base is current position;
    • +
  • "end": base is end of file;
    • +

+In case of success, seek returns the final file position, +measured in bytes from the beginning of the file. +If seek fails, it returns fail, +plus a string describing the error. + + +

+The default value for whence is "cur", +and for offset is 0. +Therefore, the call file:seek() returns the current +file position, without changing it; +the call file:seek("set") sets the position to the +beginning of the file (and returns 0); +and the call file:seek("end") sets the position to the +end of the file, and returns its size. + + + + +

+

file:setvbuf (mode [, size])

+ + +

+Sets the buffering mode for a file. +There are three available modes: + +

    +
  • "no": no buffering.
    • +
  • "full": full buffering.
    • +
  • "line": line buffering.
    • +
+ +

+For the last two cases, +size is a hint for the size of the buffer, in bytes. +The default is an appropriate size. + + +

+The specific behavior of each mode is non portable; +check the underlying ISO C function setvbuf in your platform for +more details. + + + + +

+

file:write (···)

+ + +

+Writes the value of each of its arguments to file. +The arguments must be strings or numbers. + + +

+In case of success, this function returns file. + + + + + + + +

6.9 – Operating System Facilities

+ +

+This library is implemented through table os. + + +

+

os.clock ()

+ + +

+Returns an approximation of the amount in seconds of CPU time +used by the program, +as returned by the underlying ISO C function clock. + + + + +

+

os.date ([format [, time]])

+ + +

+Returns a string or a table containing date and time, +formatted according to the given string format. + + +

+If the time argument is present, +this is the time to be formatted +(see the os.time function for a description of this value). +Otherwise, date formats the current time. + + +

+If format starts with '!', +then the date is formatted in Coordinated Universal Time. +After this optional character, +if format is the string "*t", +then date returns a table with the following fields: +year, month (1–12), day (1–31), +hour (0–23), min (0–59), +sec (0–61, due to leap seconds), +wday (weekday, 1–7, Sunday is 1), +yday (day of the year, 1–366), +and isdst (daylight saving flag, a boolean). +This last field may be absent +if the information is not available. + + +

+If format is not "*t", +then date returns the date as a string, +formatted according to the same rules as the ISO C function strftime. + + +

+If format is absent, it defaults to "%c", +which gives a human-readable date and time representation +using the current locale. + + +

+On non-POSIX systems, +this function may be not thread safe +because of its reliance on C function gmtime and C function localtime. + + + + +

+

os.difftime (t2, t1)

+ + +

+Returns the difference, in seconds, +from time t1 to time t2 +(where the times are values returned by os.time). +In POSIX, Windows, and some other systems, +this value is exactly t2-t1. + + + + +

+

os.execute ([command])

+ + +

+This function is equivalent to the ISO C function system. +It passes command to be executed by an operating system shell. +Its first result is true +if the command terminated successfully, +or fail otherwise. +After this first result +the function returns a string plus a number, +as follows: + +

    + +
  • "exit": +the command terminated normally; +the following number is the exit status of the command. +
    • + +
  • "signal": +the command was terminated by a signal; +the following number is the signal that terminated the command. +
    • + +
+ +

+When called without a command, +os.execute returns a boolean that is true if a shell is available. + + + + +

+

os.exit ([code [, close]])

+ + +

+Calls the ISO C function exit to terminate the host program. +If code is true, +the returned status is EXIT_SUCCESS; +if code is false, +the returned status is EXIT_FAILURE; +if code is a number, +the returned status is this number. +The default value for code is true. + + +

+If the optional second argument close is true, +closes the Lua state before exiting. + + + + +

+

os.getenv (varname)

+ + +

+Returns the value of the process environment variable varname +or fail if the variable is not defined. + + + + +

+

os.remove (filename)

+ + +

+Deletes the file (or empty directory, on POSIX systems) +with the given name. +If this function fails, it returns fail +plus a string describing the error and the error code. +Otherwise, it returns true. + + + + +

+

os.rename (oldname, newname)

+ + +

+Renames the file or directory named oldname to newname. +If this function fails, it returns fail, +plus a string describing the error and the error code. +Otherwise, it returns true. + + + + +

+

os.setlocale (locale [, category])

+ + +

+Sets the current locale of the program. +locale is a system-dependent string specifying a locale; +category is an optional string describing which category to change: +"all", "collate", "ctype", +"monetary", "numeric", or "time"; +the default category is "all". +The function returns the name of the new locale, +or fail if the request cannot be honored. + + +

+If locale is the empty string, +the current locale is set to an implementation-defined native locale. +If locale is the string "C", +the current locale is set to the standard C locale. + + +

+When called with nil as the first argument, +this function only returns the name of the current locale +for the given category. + + +

+This function may be not thread safe +because of its reliance on C function setlocale. + + + + +

+

os.time ([table])

+ + +

+Returns the current time when called without arguments, +or a time representing the local date and time specified by the given table. +This table must have fields year, month, and day, +and may have fields +hour (default is 12), +min (default is 0), +sec (default is 0), +and isdst (default is nil). +Other fields are ignored. +For a description of these fields, see the os.date function. + + +

+When the function is called, +the values in these fields do not need to be inside their valid ranges. +For instance, if sec is -10, +it means 10 seconds before the time specified by the other fields; +if hour is 1000, +it means 1000 hours after the time specified by the other fields. + + +

+The returned value is a number, whose meaning depends on your system. +In POSIX, Windows, and some other systems, +this number counts the number +of seconds since some given start time (the "epoch"). +In other systems, the meaning is not specified, +and the number returned by time can be used only as an argument to +os.date and os.difftime. + + +

+When called with a table, +os.time also normalizes all the fields +documented in the os.date function, +so that they represent the same time as before the call +but with values inside their valid ranges. + + + + +

+

os.tmpname ()

+ + +

+Returns a string with a file name that can +be used for a temporary file. +The file must be explicitly opened before its use +and explicitly removed when no longer needed. + + +

+In POSIX systems, +this function also creates a file with that name, +to avoid security risks. +(Someone else might create the file with wrong permissions +in the time between getting the name and creating the file.) +You still have to open the file to use it +and to remove it (even if you do not use it). + + +

+When possible, +you may prefer to use io.tmpfile, +which automatically removes the file when the program ends. + + + + + + + +

6.10 – The Debug Library

+ +

+This library provides +the functionality of the debug interface (§4.7) to Lua programs. +You should exert care when using this library. +Several of its functions +violate basic assumptions about Lua code +(e.g., that variables local to a function +cannot be accessed from outside; +that userdata metatables cannot be changed by Lua code; +that Lua programs do not crash) +and therefore can compromise otherwise secure code. +Moreover, some functions in this library may be slow. + + +

+All functions in this library are provided +inside the debug table. +All functions that operate over a thread +have an optional first argument which is the +thread to operate over. +The default is always the current thread. + + +

+

debug.debug ()

+ + +

+Enters an interactive mode with the user, +running each string that the user enters. +Using simple commands and other debug facilities, +the user can inspect global and local variables, +change their values, evaluate expressions, and so on. +A line containing only the word cont finishes this function, +so that the caller continues its execution. + + +

+Note that commands for debug.debug are not lexically nested +within any function and so have no direct access to local variables. + + + + +

+

debug.gethook ([thread])

+ + +

+Returns the current hook settings of the thread, as three values: +the current hook function, the current hook mask, +and the current hook count, +as set by the debug.sethook function. + + +

+Returns fail if there is no active hook. + + + + +

+

debug.getinfo ([thread,] f [, what])

+ + +

+Returns a table with information about a function. +You can give the function directly +or you can give a number as the value of f, +which means the function running at level f of the call stack +of the given thread: +level 0 is the current function (getinfo itself); +level 1 is the function that called getinfo +(except for tail calls, which do not count in the stack); +and so on. +If f is a number greater than the number of active functions, +then getinfo returns fail. + + +

+The returned table can contain all the fields returned by lua_getinfo, +with the string what describing which fields to fill in. +The default for what is to get all information available, +except the table of valid lines. +If present, +the option 'f' +adds a field named func with the function itself. +If present, +the option 'L' +adds a field named activelines with the table of +valid lines. + + +

+For instance, the expression debug.getinfo(1,"n").name returns +a name for the current function, +if a reasonable name can be found, +and the expression debug.getinfo(print) +returns a table with all available information +about the print function. + + + + +

+

debug.getlocal ([thread,] f, local)

+ + +

+This function returns the name and the value of the local variable +with index local of the function at level f of the stack. +This function accesses not only explicit local variables, +but also parameters and temporary values. + + +

+The first parameter or local variable has index 1, and so on, +following the order that they are declared in the code, +counting only the variables that are active +in the current scope of the function. +Compile-time constants may not appear in this listing, +if they were optimized away by the compiler. +Negative indices refer to vararg arguments; +-1 is the first vararg argument. +The function returns fail +if there is no variable with the given index, +and raises an error when called with a level out of range. +(You can call debug.getinfo to check whether the level is valid.) + + +

+Variable names starting with '(' (open parenthesis) +represent variables with no known names +(internal variables such as loop control variables, +and variables from chunks saved without debug information). + + +

+The parameter f may also be a function. +In that case, getlocal returns only the name of function parameters. + + + + +

+

debug.getmetatable (value)

+ + +

+Returns the metatable of the given value +or nil if it does not have a metatable. + + + + +

+

debug.getregistry ()

+ + +

+Returns the registry table (see §4.3). + + + + +

+

debug.getupvalue (f, up)

+ + +

+This function returns the name and the value of the upvalue +with index up of the function f. +The function returns fail +if there is no upvalue with the given index. + + +

+(For Lua functions, +upvalues are the external local variables that the function uses, +and that are consequently included in its closure.) + + +

+For C functions, this function uses the empty string "" +as a name for all upvalues. + + +

+Variable name '?' (interrogation mark) +represents variables with no known names +(variables from chunks saved without debug information). + + + + +

+

debug.getuservalue (u, n)

+ + +

+Returns the n-th user value associated +to the userdata u plus a boolean, +false if the userdata does not have that value. + + + + +

+

debug.sethook ([thread,] hook, mask [, count])

+ + +

+Sets the given function as the debug hook. +The string mask and the number count describe +when the hook will be called. +The string mask may have any combination of the following characters, +with the given meaning: + +

    +
  • 'c': the hook is called every time Lua calls a function;
    • +
  • 'r': the hook is called every time Lua returns from a function;
    • +
  • 'l': the hook is called every time Lua enters a new line of code.
    • +

+Moreover, +with a count different from zero, +the hook is called also after every count instructions. + + +

+When called without arguments, +debug.sethook turns off the hook. + + +

+When the hook is called, its first parameter is a string +describing the event that has triggered its call: +"call", "tail call", "return", +"line", and "count". +For line events, +the hook also gets the new line number as its second parameter. +Inside a hook, +you can call getinfo with level 2 to get more information about +the running function. +(Level 0 is the getinfo function, +and level 1 is the hook function.) + + + + +

+

debug.setlocal ([thread,] level, local, value)

+ + +

+This function assigns the value value to the local variable +with index local of the function at level level of the stack. +The function returns fail if there is no local +variable with the given index, +and raises an error when called with a level out of range. +(You can call getinfo to check whether the level is valid.) +Otherwise, it returns the name of the local variable. + + +

+See debug.getlocal for more information about +variable indices and names. + + + + +

+

debug.setmetatable (value, table)

+ + +

+Sets the metatable for the given value to the given table +(which can be nil). +Returns value. + + + + +

+

debug.setupvalue (f, up, value)

+ + +

+This function assigns the value value to the upvalue +with index up of the function f. +The function returns fail if there is no upvalue +with the given index. +Otherwise, it returns the name of the upvalue. + + +

+See debug.getupvalue for more information about upvalues. + + + + +

+

debug.setuservalue (udata, value, n)

+ + +

+Sets the given value as +the n-th user value associated to the given udata. +udata must be a full userdata. + + +

+Returns udata, +or fail if the userdata does not have that value. + + + + +

+

debug.traceback ([thread,] [message [, level]])

+ + +

+If message is present but is neither a string nor nil, +this function returns message without further processing. +Otherwise, +it returns a string with a traceback of the call stack. +The optional message string is appended +at the beginning of the traceback. +An optional level number tells at which level +to start the traceback +(default is 1, the function calling traceback). + + + + +

+

debug.upvalueid (f, n)

+ + +

+Returns a unique identifier (as a light userdata) +for the upvalue numbered n +from the given function. + + +

+These unique identifiers allow a program to check whether different +closures share upvalues. +Lua closures that share an upvalue +(that is, that access a same external local variable) +will return identical ids for those upvalue indices. + + + + +

+

debug.upvaluejoin (f1, n1, f2, n2)

+ + +

+Make the n1-th upvalue of the Lua closure f1 +refer to the n2-th upvalue of the Lua closure f2. + + + + + + + +

7 – Lua Standalone

+ +

+Although Lua has been designed as an extension language, +to be embedded in a host C program, +it is also frequently used as a standalone language. +An interpreter for Lua as a standalone language, +called simply lua, +is provided with the standard distribution. +The standalone interpreter includes +all standard libraries. +Its usage is: + +

+     lua [options] [script [args]]
+

+The options are: + +

    +
  • -e stat: execute string stat;
    • +
  • -i: enter interactive mode after running script;
    • +
  • -l mod: "require" mod and assign the + result to global mod;
    • +
  • -v: print version information;
    • +
  • -E: ignore environment variables;
    • +
  • -W: turn warnings on;
    • +
  • --: stop handling options;
    • +
  • -: execute stdin as a file and stop handling options.
    • +

+After handling its options, lua runs the given script. +When called without arguments, +lua behaves as lua -v -i +when the standard input (stdin) is a terminal, +and as lua - otherwise. + + +

+When called without the option -E, +the interpreter checks for an environment variable LUA_INIT_5_4 +(or LUA_INIT if the versioned name is not defined) +before running any argument. +If the variable content has the format @filename, +then lua executes the file. +Otherwise, lua executes the string itself. + + +

+When called with the option -E, +Lua does not consult any environment variables. +In particular, +the values of package.path and package.cpath +are set with the default paths defined in luaconf.h. + + +

+The options -e, -l, and -W are handled in +the order they appear. +For instance, an invocation like + +

+     $ lua -e 'a=1' -llib1 script.lua
+

+will first set a to 1, then require the library lib1, +and finally run the file script.lua with no arguments. +(Here $ is the shell prompt. Your prompt may be different.) + + +

+Before running any code, +lua collects all command-line arguments +in a global table called arg. +The script name goes to index 0, +the first argument after the script name goes to index 1, +and so on. +Any arguments before the script name +(that is, the interpreter name plus its options) +go to negative indices. +For instance, in the call + +

+     $ lua -la b.lua t1 t2
+

+the table is like this: + +

+     arg = { [-2] = "lua", [-1] = "-la",
+             [0] = "b.lua",
+             [1] = "t1", [2] = "t2" }
+

+If there is no script in the call, +the interpreter name goes to index 0, +followed by the other arguments. +For instance, the call + +

+     $ lua -e "print(arg[1])"
+

+will print "-e". +If there is a script, +the script is called with arguments +arg[1], ···, arg[#arg]. +Like all chunks in Lua, +the script is compiled as a vararg function. + + +

+In interactive mode, +Lua repeatedly prompts and waits for a line. +After reading a line, +Lua first try to interpret the line as an expression. +If it succeeds, it prints its value. +Otherwise, it interprets the line as a statement. +If you write an incomplete statement, +the interpreter waits for its completion +by issuing a different prompt. + + +

+If the global variable _PROMPT contains a string, +then its value is used as the prompt. +Similarly, if the global variable _PROMPT2 contains a string, +its value is used as the secondary prompt +(issued during incomplete statements). + + +

+In case of unprotected errors in the script, +the interpreter reports the error to the standard error stream. +If the error object is not a string but +has a metamethod __tostring, +the interpreter calls this metamethod to produce the final message. +Otherwise, the interpreter converts the error object to a string +and adds a stack traceback to it. +When warnings are on, +they are simply printed in the standard error output. + + +

+When finishing normally, +the interpreter closes its main Lua state +(see lua_close). +The script can avoid this step by +calling os.exit to terminate. + + +

+To allow the use of Lua as a +script interpreter in Unix systems, +Lua skips the first line of a file chunk if it starts with #. +Therefore, Lua scripts can be made into executable programs +by using chmod +x and the #! form, +as in + +

+     #!/usr/local/bin/lua
+

+Of course, +the location of the Lua interpreter may be different in your machine. +If lua is in your PATH, +then + +

+     #!/usr/bin/env lua
+

+is a more portable solution. + + + +

8 – Incompatibilities with the Previous Version

+ + + +

+Here we list the incompatibilities that you may find when moving a program +from Lua 5.3 to Lua 5.4. + + +

+You can avoid some incompatibilities by compiling Lua with +appropriate options (see file luaconf.h). +However, +all these compatibility options will be removed in the future. +More often than not, +compatibility issues arise when these compatibility options +are removed. +So, whenever you have the chance, +you should try to test your code with a version of Lua compiled +with all compatibility options turned off. +That will ease transitions to newer versions of Lua. + + +

+Lua versions can always change the C API in ways that +do not imply source-code changes in a program, +such as the numeric values for constants +or the implementation of functions as macros. +Therefore, +you should never assume that binaries are compatible between +different Lua versions. +Always recompile clients of the Lua API when +using a new version. + + +

+Similarly, Lua versions can always change the internal representation +of precompiled chunks; +precompiled chunks are not compatible between different Lua versions. + + +

+The standard paths in the official distribution may +change between versions. + + + + + +

8.1 – Incompatibilities in the Language

+
    + +
  • +The coercion of strings to numbers in +arithmetic and bitwise operations +has been removed from the core language. +The string library does a similar job +for arithmetic (but not for bitwise) operations +using the string metamethods. +However, unlike in previous versions, +the new implementation preserves the implicit type of the numeral +in the string. +For instance, the result of "1" + "2" now is an integer, +not a float. +
    • + +
  • +Literal decimal integer constants that overflow are read as floats, +instead of wrapping around. +You can use hexadecimal notation for such constants if you +want the old behavior +(reading them as integers with wrap around). +
    • + +
  • +The use of the __lt metamethod to emulate __le +has been removed. +When needed, this metamethod must be explicitly defined. +
    • + +
  • +The semantics of the numerical for loop +over integers changed in some details. +In particular, the control variable never wraps around. +
    • + +
  • +A label for a goto cannot be declared where a label with the same +name is visible, even if this other label is declared in an enclosing +block. +
    • + +
  • +When finalizing an object, +Lua does not ignore __gc metamethods that are not functions. +Any value will be called, if present. +(Non-callable values will generate a warning, +like any other error when calling a finalizer.) +
    • + +
+ + + + +

8.2 – Incompatibilities in the Libraries

+
    + +
  • +The function print does not call tostring +to format its arguments; +instead, it has this functionality hardwired. +You should use __tostring to modify how values are printed. +
    • + +
  • +The pseudo-random number generator used by the function math.random +now starts with a somewhat random seed. +Moreover, it uses a different algorithm. +
    • + +
  • +By default, the decoding functions in the utf8 library +do not accept surrogates as valid code points. +An extra parameter in these functions makes them more permissive. +
    • + +
  • +The options "setpause" and "setstepmul" +of the function collectgarbage are deprecated. +You should use the new option "incremental" to set them. +
    • + +
  • +The function io.lines now returns four values, +instead of just one. +That can be a problem when it is used as the sole +argument to another function that has optional parameters, +such as in load(io.lines(filename, "L")). +To fix that issue, +you can wrap the call into parentheses, +to adjust its number of results to one. +
    • + +
+ + + + +

8.3 – Incompatibilities in the API

+ + +
    + +
  • +Full userdata now has an arbitrary number of associated user values. +Therefore, the functions lua_newuserdata, +lua_setuservalue, and lua_getuservalue were +replaced by lua_newuserdatauv, +lua_setiuservalue, and lua_getiuservalue, +which have an extra argument. + + +

    +For compatibility, the old names still work as macros assuming +one single user value. +Note, however, that userdata with zero user values +are more efficient memory-wise. +

    • + +
  • +The function lua_resume has an extra parameter. +This out parameter returns the number of values on +the top of the stack that were yielded or returned by the coroutine. +(In previous versions, +those values were the entire stack.) +
    • + +
  • +The function lua_version returns the version number, +instead of an address of the version number. +The Lua core should work correctly with libraries using their +own static copies of the same core, +so there is no need to check whether they are using the same +address space. +
    • + +
  • +The constant LUA_ERRGCMM was removed. +Errors in finalizers are never propagated; +instead, they generate a warning. +
    • + +
  • +The options LUA_GCSETPAUSE and LUA_GCSETSTEPMUL +of the function lua_gc are deprecated. +You should use the new option LUA_GCINC to set them. +
    • + +
+ + + + +

9 – The Complete Syntax of Lua

+ +

+Here is the complete syntax of Lua in extended BNF. +As usual in extended BNF, +{A} means 0 or more As, +and [A] means an optional A. +(For operator precedences, see §3.4.8; +for a description of the terminals +Name, Numeral, +and LiteralString, see §3.1.) + + + + +

+
+	chunk ::= block
+
+	block ::= {stat} [retstat]
+
+	stat ::=  ‘;’ | 
+		 varlist ‘=’ explist | 
+		 functioncall | 
+		 label | 
+		 break | 
+		 goto Name | 
+		 do block end | 
+		 while exp do block end | 
+		 repeat block until exp | 
+		 if exp then block {elseif exp then block} [else block] end | 
+		 for Name ‘=’ exp ‘,’ exp [‘,’ exp] do block end | 
+		 for namelist in explist do block end | 
+		 function funcname funcbody | 
+		 local function Name funcbody | 
+		 local attnamelist [‘=’ explist] 
+
+	attnamelist ::=  Name attrib {‘,’ Name attrib}
+
+	attrib ::= [‘<’ Name ‘>’]
+
+	retstat ::= return [explist] [‘;’]
+
+	label ::= ‘::’ Name ‘::’
+
+	funcname ::= Name {‘.’ Name} [‘:’ Name]
+
+	varlist ::= var {‘,’ var}
+
+	var ::=  Name | prefixexp ‘[’ exp ‘]’ | prefixexp ‘.’ Name 
+
+	namelist ::= Name {‘,’ Name}
+
+	explist ::= exp {‘,’ exp}
+
+	exp ::=  nil | false | true | Numeral | LiteralString | ‘...’ | functiondef | 
+		 prefixexp | tableconstructor | exp binop exp | unop exp 
+
+	prefixexp ::= var | functioncall | ‘(’ exp ‘)’
+
+	functioncall ::=  prefixexp args | prefixexp ‘:’ Name args 
+
+	args ::=  ‘(’ [explist] ‘)’ | tableconstructor | LiteralString 
+
+	functiondef ::= function funcbody
+
+	funcbody ::= ‘(’ [parlist] ‘)’ block end
+
+	parlist ::= namelist [‘,’ ‘...’] | ‘...’
+
+	tableconstructor ::= ‘{’ [fieldlist] ‘}’
+
+	fieldlist ::= field {fieldsep field} [fieldsep]
+
+	field ::= ‘[’ exp ‘]’ ‘=’ exp | Name ‘=’ exp | exp
+
+	fieldsep ::= ‘,’ | ‘;’
+
+	binop ::=  ‘+’ | ‘-’ | ‘*’ | ‘/’ | ‘//’ | ‘^’ | ‘%’ | 
+		 ‘&’ | ‘~’ | ‘|’ | ‘>>’ | ‘<<’ | ‘..’ | 
+		 ‘<’ | ‘<=’ | ‘>’ | ‘>=’ | ‘==’ | ‘~=’ | 
+		 and | or
+
+	unop ::= ‘-’ | not | ‘#’ | ‘~’
+
+
+ +

+ + + + + + + +

+Last update: +Mon Mar 15 13:39:42 UTC 2021 +

+ + + + diff --git a/lua-5.4.3/doc/osi-certified-72x60.png b/lua-5.4.3/doc/osi-certified-72x60.png new file mode 100644 index 0000000000000000000000000000000000000000..07df5f6ee7a7a8b2108025dcd815f73f145a83af GIT binary patch literal 3774 zcmV;v4ngsWP)$kl5 zqcT7g&?zu8?ezWYz4zUB-|zR9d+&Qy2xAN{qY(ew0A7^*gV^7jytKqPFV3{hZfovn zs%x!l>(m&Gdb8C+5XeR7>h0kj=o=X3A39;2KLYfEMt>p1YMW~dt`rpAC{lN~P>5pq zH1L4nAdCT17}*hN=LnEsvMl=5Ij^QArAa&_V~zoht-Ei~)E~(Ivhe0#jik{t$isEK znCH$TxCB8EKmcF>3@pRaHpbR%Gqm*dsZA4H{j(NjZFp^iNFW+RBx6R*X19J*`0XG5 z^Y>cR=^Hi9#ovYGlbFSr#Q*^PgCGC^gb*SC5TcBfzQLe-r2m!Quik&_g9XzTj0qSR zD`FkG_RYWDa^+#UUxL&t+!K+&(ion@Fd`5l5p7{Qsva9vegC|4^NzJUMvn)^gqWsF zvu^j=%FfCVg^cgbXDRl1DE$lsfe;BjjmFmRHER~E-MeWoNsyyNHCpG%Y}igd_(Md;&9La8_B075NDRX9gTD zIHY`}9E~aGi9Kk1@P~rmPna=*=gz~UTdTpsQmjX)J23%v9NliQS)8`xJh6Qz_nE~e z&tP|!dcJdo;JMNa3>afSx$lko8>fp-I}OiCVz(dOF1u6e8$IrsSP?=5mp~lkaFqm? zAUMxRq%ecIu3WE)Uf=%p8g z+RSY?G=VO%wAfdICj?Uzb+5jr{8m|)i#{M}JjaDIoXf#1=DYLwX;1EW&sijPvm6EkBGuOx6r~lKv`g`yH?)|&PRUr$5Ibw2HBM7C74XvE@gaPjN+@;j$J)AgYhnT-U5m+wj|Wz8K630AfO8PUoGD^^Mcq zY9C<~%wUm^u%ox5P21)KNN0$(v^OI$A~?iwsS_fRu1+`EH|CRdpA4zsk8Z#|?x@^vVEAL+2JxH%&^{JUU%B=?EU7`Ar*Q|JvqPofcBt765(*f5JI$>=3{<%K)4ei zogo$)5XP}_X$y^pIYyWTt}EAnhTq}u4sAdBvC(WC{I#x4^>$vCvQ0UDs^18sAQG9o zEaP0qjrSSv1W0FyO%9&y$@em~n@8}}EXBG6x%ew49J_q%l@As_XnNpi|MTTPr~ca_ zW%uon6dBKL*pvzYFvf<~p6K8hK9BDNNN0$7xp^hWC3n^7FoQ?P(=m(6!Pj&S2f1fqH=`(w)KcPl5aEi2}~4hF*f*g}vaS-=c7v>N8c z{yNM*%+azq=@prWtgpi~^3?^AsJqS(>=pb=6PrGH#=O{Hcho$_F#MtsK$$3e2fZvg zy}!-V%`+uFMOW87LIgu3vKuMgqwY0}*Sd;aokQp(F#-{}Ss(Iy1iekY1ZQX?1WEL? z7=zq`lH-#Hw=bHRio3yPun%`c5rI1Hb|wTSWTs|12Mg#QkkwTmy zAYul0H*_b(BnkP#!R_&p@d54uz0JKthGv3C^fdKS%~alookE`QX@%#MQN2=SFWrOha7Ij7ImStNaWsy~? zsylUeT02_-z-G4s0L!v=+Wx|cxr$tmY&$a1by8z#6HBp!*9{@mU9XQ0h@L%V_R}4g z&s#2{MCOj4`5ux-SUautC5@{U895o-biKMWWoQ09{|jx8wz}@_(ep%Yk4{90C#s6-sa}fU5{}m>#>VtE_b#5bn8O+3k{&6GoEkB;yGie;A_5Uy zqPN*tU()pE+_&~``5XX({el-xT_}%`%fsc>_0@m5{+FhXru>rpyLESe31R>cK^FFrCm+#WL$-D{Z3*9>Lg{wi}xEYn_`@Hy`-d z1N}kIY%@Eu&Bpe|Rr6N;%Yk>6&RI$lgpIO26BYT%C!dU-o4bqqQpGY?p6lPru6Hzc z@WuSDI^BYaDH*>R)~)$V1J0Edn4r(9vo>E<2XjOJr2*G124;t^U+p{iUnZN5oapCpCk(F}}<#3ZZli!Nk z^UWT;Q9qm-i`i$kJS}5P%puBJ<&krTO;*#$Y7d$o96EbQ{aF1XFpTj}wf}eI|IOba z%w}_CWu?JjkV>U-ad9L$@Mu$CU;pUQBZgt5QmI@n=W@9K(A(SF-rnxzy|_!5ekKqCQTad`sa|&&Q6jfy}iAEst?|mH*emIjg9SB zRVWlHl?r3bvh2qnf6V6(+>4TulB%kzFveeh{k1?K*t&J=m>dk9P8SjqQdn4sF;*&- z(b3VFnVH$y*$Rb%rs zefJ#z#KpyZ_0?C$jvY%)O?7a?7#}%u1OT>d*)keF*REZ=c=4j6tkr5MilS*cB_$;< zFArmEv)Oby-7}4>TD9uE_ulKT4s6Bp@^Y0*rBEo&o;?cy8#Zi^%jH+DTv4f1SFc_L zfc5LwXJ=;vKt@K!?%liR&!6Almmq$2R@G|tg$oyGnpP+jQBhF<(9qCOR8%AuiBtJCSc zyu1LQw6wIQre^Zw$^E0N)#}R1%J}$rkw`Qc#z0A{)dIkjDN`I(PfyS2=x9f~R4N64 zPe1*1=gytQ#l=RWao4V0bLY-=?Bpl*dQDA@LZMJ9l{Gar$;rvzfB$`Tb#+==T0=ua zSy@?1N{UXWyL9Q&#*G`Zv$GE#JXljxBauj2T3VD!rO9N<%F3#*uP-Sn(P%W=w{Jgx z{(NC!VNOmC0OaN6ZQHg@tJQw^;fGtdZUulVSFX&NGv~~iGoO9-nNq0~2n78w23E{L zmth7T3|W>10ISuSm6cUgRCMXmr5!tV0D!x@`?6)rcI?<8lgZ#IIehqVOiYYpi@x#3 z8xau^+1c4ER;th&( zVHk--A`l3|!os9dsYatANm8TH96x@%qM{-&FmUtc&2qVX-MV%A_U(J~%{TY#*<&ym zX3Ur|c$No?u%e>k#EBDaZEY7XUVLH`0zh|n zw_~XRz;RH!y1MS)zn_X$Km70mNs@ZKo~G$z$BuD09F}FpVzEY}F&d2ug#rLPJUpgPpKh}a^y$-i zJl@%}XHT6vRaaNHckf=MQYn>6Fk&*D<+ja0B z5C{a#&CQN-V`HPyXe3EeAP~gH#>U3RayT5ZSd1}tbaaSNDAZ^)j%n&QHMoE=7KubA zlWEeVNpiV7Dk=&gzM|0Dz(>0HA5Q-_F}_znz(xxqbU~E|+`a#EH|V zPjA|^DJLg~rs?+f_6rv-T)upnAP7fChoq;cFJHcV=gyt)zWXjs(+gZ<%kMDTlOd1+TFW%&z(D`)oKF*0@Bmd zLqkIy?RvewprGK+ojWv5%Ve?@D^>&r1p$CcrMhuv}x1&joiO~|IC>)G) + + +Lua 5.4 readme + + + + + + + +

+Lua +Welcome to Lua 5.4 +

+ +
+about +· +installation +· +changes +· +license +· +reference manual +
+ +

About Lua

+

+Lua is a powerful, efficient, lightweight, embeddable scripting language +developed by a +team +at +PUC-Rio, +the Pontifical Catholic University of Rio de Janeiro in Brazil. +Lua is +free software +used in +many products and projects +around the world. + +

+Lua's +official web site +provides complete information +about Lua, +including +an +executive summary +and +updated +documentation, +especially the +reference manual, +which may differ slightly from the +local copy +distributed in this package. + +

Installing Lua

+

+Lua is distributed in +source +form. +You need to build it before using it. +Building Lua should be straightforward +because +Lua is implemented in pure ANSI C and compiles unmodified in all known +platforms that have an ANSI C compiler. +Lua also compiles unmodified as C++. +The instructions given below for building Lua are for Unix-like platforms, +such as Linux and Mac OS X. +See also +instructions for other systems +and +customization options. + +

+If you don't have the time or the inclination to compile Lua yourself, +get a binary from +LuaBinaries. +Try also +LuaDist, +a multi-platform distribution of Lua that includes batteries. + +

Building Lua

+

+In most common Unix-like platforms, simply do "make". +Here are the details. + +

    +
  1. +Open a terminal window and move to +the top-level directory, which is named lua-5.4.3. +The Makefile there controls both the build process and the installation process. +

    +

  2. + Do "make". The Makefile will guess your platform and build Lua for it. +

    +

  3. + If the guess failed, do "make help" and see if your platform is listed. + The platforms currently supported are: +

    +

    + guess aix bsd c89 freebsd generic linux linux-readline macosx mingw posix solaris +

    +

    + If your platform is listed, just do "make xxx", where xxx + is your platform name. +

    + If your platform is not listed, try the closest one or posix, generic, + c89, in this order. +

    +

  4. +The compilation takes only a few moments +and produces three files in the src directory: +lua (the interpreter), +luac (the compiler), +and liblua.a (the library). +

    +

  5. + To check that Lua has been built correctly, do "make test" + after building Lua. This will run the interpreter and print its version. +
+

+If you're running Linux, try "make linux-readline" to build the interactive Lua interpreter with handy line-editing and history capabilities. +If you get compilation errors, +make sure you have installed the readline development package +(which is probably named libreadline-dev or readline-devel). +If you get link errors after that, +then try "make linux-readline MYLIBS=-ltermcap". + +

Installing Lua

+

+ Once you have built Lua, you may want to install it in an official + place in your system. In this case, do "make install". The official + place and the way to install files are defined in the Makefile. You'll + probably need the right permissions to install files, and so may need to do "sudo make install". + +

+ To build and install Lua in one step, do "make all install", + or "make xxx install", + where xxx is your platform name. + +

+ To install Lua locally after building it, do "make local". + This will create a directory install with subdirectories + bin, include, lib, man, share, + and install Lua as listed below. + + To install Lua locally, but in some other directory, do + "make install INSTALL_TOP=xxx", where xxx is your chosen directory. + The installation starts in the src and doc directories, + so take care if INSTALL_TOP is not an absolute path. + +

+
+ bin: +
+ lua luac +
+ include: +
+ lua.h luaconf.h lualib.h lauxlib.h lua.hpp +
+ lib: +
+ liblua.a +
+ man/man1: +
+ lua.1 luac.1 +
+ +

+ These are the only directories you need for development. + If you only want to run Lua programs, + you only need the files in bin and man. + The files in include and lib are needed for + embedding Lua in C or C++ programs. + +

Customization

+

+ Three kinds of things can be customized by editing a file: +

    +
  • Where and how to install Lua — edit Makefile. +
  • How to build Lua — edit src/Makefile. +
  • Lua features — edit src/luaconf.h. +
+ +

+ You don't actually need to edit the Makefiles because you may set the + relevant variables in the command line when invoking make. + Nevertheless, it's probably best to edit and save the Makefiles to + record the changes you've made. + +

+ On the other hand, if you need to customize some Lua features, you'll need + to edit src/luaconf.h before building and installing Lua. + The edited file will be the one installed, and + it will be used by any Lua clients that you build, to ensure consistency. + Further customization is available to experts by editing the Lua sources. + +

Building Lua on other systems

+

+ If you're not using the usual Unix tools, then the instructions for + building Lua depend on the compiler you use. You'll need to create + projects (or whatever your compiler uses) for building the library, + the interpreter, and the compiler, as follows: + +

+
+library: +
+lapi.c lcode.c lctype.c ldebug.c ldo.c ldump.c lfunc.c lgc.c llex.c lmem.c lobject.c lopcodes.c lparser.c lstate.c lstring.c ltable.c ltm.c lundump.c lvm.c lzio.c +lauxlib.c lbaselib.c lcorolib.c ldblib.c liolib.c lmathlib.c loadlib.c loslib.c lstrlib.c ltablib.c lutf8lib.c linit.c +
+interpreter: +
+ library, lua.c +
+compiler: +
+ library, luac.c +
+ +

+ To use Lua as a library in your own programs, you'll need to know how to + create and use libraries with your compiler. Moreover, to dynamically load + C libraries for Lua, you'll need to know how to create dynamic libraries + and you'll need to make sure that the Lua API functions are accessible to + those dynamic libraries — but don't link the Lua library + into each dynamic library. For Unix, we recommend that the Lua library + be linked statically into the host program and its symbols exported for + dynamic linking; src/Makefile does this for the Lua interpreter. + For Windows, we recommend that the Lua library be a DLL. + In all cases, the compiler luac should be linked statically. + +

+ As mentioned above, you may edit src/luaconf.h to customize + some features before building Lua. + +

Changes since Lua 5.3

+

+Here are the main changes introduced in Lua 5.4. +The +reference manual +lists the +incompatibilities that had to be introduced. + +

Main changes

+
    +
  • new generational mode for garbage collection +
  • to-be-closed variables +
  • const variables +
  • userdata can have multiple user values +
  • new implementation for math.random +
  • warning system +
  • debug information about function arguments and returns +
  • new semantics for the integer 'for' loop +
  • optional 'init' argument to 'string.gmatch' +
  • new functions 'lua_resetthread' and 'coroutine.close' +
  • string-to-number coercions moved to the string library +
  • allocation function allowed to fail when shrinking a memory block +
  • new format '%p' in 'string.format' +
  • utf8 library accepts codepoints up to 2^31 +
+ +

License

+

+ +[osi certified] + +Lua is free software distributed under the terms of the +MIT license +reproduced below; +it may be used for any purpose, including commercial purposes, +at absolutely no cost without having to ask us. + +The only requirement is that if you do use Lua, +then you should give us credit by including the appropriate copyright notice somewhere in your product or its documentation. + +For details, see +this. + +

+Copyright © 1994–2021 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. +

+

+ +

+Last update: +Wed Mar 3 10:16:26 UTC 2021 +

+ + + + diff --git a/lua-5.4.3/src/Makefile b/lua-5.4.3/src/Makefile new file mode 100644 index 0000000..f78c0b8 --- /dev/null +++ b/lua-5.4.3/src/Makefile @@ -0,0 +1,222 @@ +# 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= guess + +CC= gcc -std=gnu99 +CFLAGS= -O2 -Wall -Wextra -DLUA_COMPAT_5_3 $(SYSCFLAGS) $(MYCFLAGS) +LDFLAGS= $(SYSLDFLAGS) $(MYLDFLAGS) +LIBS= -lm $(SYSLIBS) $(MYLIBS) + +AR= ar rcu +RANLIB= ranlib +RM= rm -f +UNAME= uname + +SYSCFLAGS= +SYSLDFLAGS= +SYSLIBS= + +MYCFLAGS= +MYLDFLAGS= +MYLIBS= +MYOBJS= + +# Special flags for compiler modules; -Os reduces code size. +CMCFLAGS= + +# == END OF USER SETTINGS -- NO NEED TO CHANGE ANYTHING BELOW THIS LINE ======= + +PLATS= guess aix bsd c89 freebsd generic linux linux-readline 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 lcorolib.o ldblib.o liolib.o lmathlib.o loadlib.o loslib.o lstrlib.o ltablib.o lutf8lib.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) + +test: + ./$(LUA_T) -v + +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)" + @echo "UNAME= $(UNAME)" + +# Convenience targets for popular platforms. +ALL= all + +help: + @echo "Do 'make PLATFORM' where PLATFORM is one of these:" + @echo " $(PLATS)" + @echo "See doc/readme.html for complete instructions." + +guess: + @echo Guessing `$(UNAME)` + @$(MAKE) `$(UNAME)` + +AIX aix: + $(MAKE) $(ALL) CC="xlc" CFLAGS="-O2 -DLUA_USE_POSIX -DLUA_USE_DLOPEN" SYSLIBS="-ldl" SYSLDFLAGS="-brtl -bexpall" + +bsd: + $(MAKE) $(ALL) SYSCFLAGS="-DLUA_USE_POSIX -DLUA_USE_DLOPEN" SYSLIBS="-Wl,-E" + +c89: + $(MAKE) $(ALL) SYSCFLAGS="-DLUA_USE_C89" CC="gcc -std=c89" + @echo '' + @echo '*** C89 does not guarantee 64-bit integers for Lua.' + @echo '*** Make sure to compile all external Lua libraries' + @echo '*** with LUA_USE_C89 to ensure consistency' + @echo '' + +FreeBSD NetBSD OpenBSD freebsd: + $(MAKE) $(ALL) SYSCFLAGS="-DLUA_USE_LINUX -DLUA_USE_READLINE -I/usr/include/edit" SYSLIBS="-Wl,-E -ledit" CC="cc" + +generic: $(ALL) + +Linux linux: linux-noreadline + +linux-noreadline: + $(MAKE) $(ALL) SYSCFLAGS="-DLUA_USE_LINUX" SYSLIBS="-Wl,-E -ldl" + +linux-readline: + $(MAKE) $(ALL) SYSCFLAGS="-DLUA_USE_LINUX -DLUA_USE_READLINE" SYSLIBS="-Wl,-E -ldl -lreadline" + +Darwin macos macosx: + $(MAKE) $(ALL) SYSCFLAGS="-DLUA_USE_MACOSX -DLUA_USE_READLINE" SYSLIBS="-lreadline" + +mingw: + $(MAKE) "LUA_A=lua54.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" + +SunOS solaris: + $(MAKE) $(ALL) SYSCFLAGS="-DLUA_USE_POSIX -DLUA_USE_DLOPEN -D_REENTRANT" SYSLIBS="-ldl" + +# Targets that do not create files (not all makes understand .PHONY). +.PHONY: all $(PLATS) help test clean default o a depend echo + +# Compiler modules may use special flags. +llex.o: + $(CC) $(CFLAGS) $(CMCFLAGS) -c llex.c + +lparser.o: + $(CC) $(CFLAGS) $(CMCFLAGS) -c lparser.c + +lcode.o: + $(CC) $(CFLAGS) $(CMCFLAGS) -c lcode.c + +# DO NOT DELETE + +lapi.o: lapi.c lprefix.h 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 lprefix.h lua.h luaconf.h lauxlib.h +lbaselib.o: lbaselib.c lprefix.h lua.h luaconf.h lauxlib.h lualib.h +lcode.o: lcode.c lprefix.h 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 lprefix.h lua.h luaconf.h lauxlib.h lualib.h +lctype.o: lctype.c lprefix.h lctype.h lua.h luaconf.h llimits.h +ldblib.o: ldblib.c lprefix.h lua.h luaconf.h lauxlib.h lualib.h +ldebug.o: ldebug.c lprefix.h 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 lprefix.h 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 lprefix.h lua.h luaconf.h lobject.h llimits.h lstate.h \ + ltm.h lzio.h lmem.h lundump.h +lfunc.o: lfunc.c lprefix.h lua.h luaconf.h ldebug.h lstate.h lobject.h \ + llimits.h ltm.h lzio.h lmem.h ldo.h lfunc.h lgc.h +lgc.o: lgc.c lprefix.h 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 lprefix.h lua.h luaconf.h lualib.h lauxlib.h +liolib.o: liolib.c lprefix.h lua.h luaconf.h lauxlib.h lualib.h +llex.o: llex.c lprefix.h lua.h luaconf.h lctype.h llimits.h ldebug.h \ + lstate.h lobject.h ltm.h lzio.h lmem.h ldo.h lgc.h llex.h lparser.h \ + lstring.h ltable.h +lmathlib.o: lmathlib.c lprefix.h lua.h luaconf.h lauxlib.h lualib.h +lmem.o: lmem.c lprefix.h 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 lprefix.h lua.h luaconf.h lauxlib.h lualib.h +lobject.o: lobject.c lprefix.h 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 lprefix.h lopcodes.h llimits.h lua.h luaconf.h +loslib.o: loslib.c lprefix.h lua.h luaconf.h lauxlib.h lualib.h +lparser.o: lparser.c lprefix.h 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 lprefix.h 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 lprefix.h lua.h luaconf.h ldebug.h lstate.h \ + lobject.h llimits.h ltm.h lzio.h lmem.h ldo.h lstring.h lgc.h +lstrlib.o: lstrlib.c lprefix.h lua.h luaconf.h lauxlib.h lualib.h +ltable.o: ltable.c lprefix.h 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 lprefix.h lua.h luaconf.h lauxlib.h lualib.h +ltm.o: ltm.c lprefix.h 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 +lua.o: lua.c lprefix.h lua.h luaconf.h lauxlib.h lualib.h +luac.o: luac.c lprefix.h lua.h luaconf.h lauxlib.h ldebug.h lstate.h \ + lobject.h llimits.h ltm.h lzio.h lmem.h lopcodes.h lopnames.h lundump.h +lundump.o: lundump.c lprefix.h 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 +lutf8lib.o: lutf8lib.c lprefix.h lua.h luaconf.h lauxlib.h lualib.h +lvm.o: lvm.c lprefix.h 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 ljumptab.h +lzio.o: lzio.c lprefix.h lua.h luaconf.h llimits.h lmem.h lstate.h \ + lobject.h ltm.h lzio.h + +# (end of Makefile) diff --git a/lua-5.4.3/src/lapi.c b/lua-5.4.3/src/lapi.c new file mode 100644 index 0000000..f8f70cd --- /dev/null +++ b/lua-5.4.3/src/lapi.c @@ -0,0 +1,1455 @@ +/* +** $Id: lapi.c $ +** Lua API +** See Copyright Notice in lua.h +*/ + +#define lapi_c +#define LUA_CORE + +#include "lprefix.h" + + +#include +#include +#include + +#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 " $"; + + + +/* +** Test for a valid index (one that is not the 'nilvalue'). +** '!ttisnil(o)' implies 'o != &G(L)->nilvalue', so it is not needed. +** However, it covers the most common cases in a faster way. +*/ +#define isvalid(L, o) (!ttisnil(o) || o != &G(L)->nilvalue) + + +/* test for pseudo index */ +#define ispseudo(i) ((i) <= LUA_REGISTRYINDEX) + +/* test for upvalue */ +#define isupvalue(i) ((i) < LUA_REGISTRYINDEX) + + +static TValue *index2value (lua_State *L, int idx) { + CallInfo *ci = L->ci; + if (idx > 0) { + StkId o = ci->func + idx; + api_check(L, idx <= L->ci->top - (ci->func + 1), "unacceptable index"); + if (o >= L->top) return &G(L)->nilvalue; + else return s2v(o); + } + else if (!ispseudo(idx)) { /* negative index */ + api_check(L, idx != 0 && -idx <= L->top - (ci->func + 1), "invalid index"); + return s2v(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(s2v(ci->func))) /* light C function? */ + return &G(L)->nilvalue; /* it has no upvalues */ + else { + CClosure *func = clCvalue(s2v(ci->func)); + return (idx <= func->nupvalues) ? &func->upvalue[idx-1] + : &G(L)->nilvalue; + } + } +} + + +static StkId index2stack (lua_State *L, int idx) { + CallInfo *ci = L->ci; + if (idx > 0) { + StkId o = ci->func + idx; + api_check(L, o < L->top, "unacceptable index"); + return o; + } + else { /* non-positive index */ + api_check(L, idx != 0 && -idx <= L->top - (ci->func + 1), "invalid index"); + api_check(L, !ispseudo(idx), "invalid index"); + return L->top + idx; + } +} + + +LUA_API int lua_checkstack (lua_State *L, int n) { + int res; + CallInfo *ci; + lua_lock(L); + ci = L->ci; + api_check(L, n >= 0, "negative 'n'"); + if (L->stack_last - L->top > n) /* 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 - n) /* can grow without overflow? */ + res = 0; /* no */ + else /* try to grow stack */ + res = luaD_growstack(L, n, 0); + } + if (res && ci->top < L->top + n) + ci->top = L->top + n; /* 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, "stack overflow"); + from->top -= n; + for (i = 0; i < n; i++) { + setobjs2s(to, to->top, from->top + i); + to->top++; /* stack already checked by previous 'api_check' */ + } + 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 lua_Number lua_version (lua_State *L) { + UNUSED(L); + return LUA_VERSION_NUM; +} + + + +/* +** 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) { + CallInfo *ci; + StkId func, newtop; + ptrdiff_t diff; /* difference for new top */ + lua_lock(L); + ci = L->ci; + func = ci->func; + if (idx >= 0) { + api_check(L, idx <= ci->top - (func + 1), "new top too large"); + diff = ((func + 1) + idx) - L->top; + for (; diff > 0; diff--) + setnilvalue(s2v(L->top++)); /* clear new slots */ + } + else { + api_check(L, -(idx+1) <= (L->top - (func + 1)), "invalid new top"); + diff = idx + 1; /* will "subtract" index (as it is negative) */ + } + api_check(L, L->tbclist < L->top, "previous pop of an unclosed slot"); + newtop = L->top + diff; + if (diff < 0 && L->tbclist >= newtop) { + lua_assert(hastocloseCfunc(ci->nresults)); + luaF_close(L, newtop, CLOSEKTOP, 0); + } + L->top = newtop; /* correct top only after closing any upvalue */ + lua_unlock(L); +} + + +LUA_API void lua_closeslot (lua_State *L, int idx) { + StkId level; + lua_lock(L); + level = index2stack(L, idx); + api_check(L, hastocloseCfunc(L->ci->nresults) && L->tbclist == level, + "no variable to close at given level"); + luaF_close(L, level, CLOSEKTOP, 0); + level = index2stack(L, idx); /* stack may be moved */ + setnilvalue(s2v(level)); + lua_unlock(L); +} + + +/* +** Reverse the stack segment from 'from' to 'to' +** (auxiliary to 'lua_rotate') +** Note that we move(copy) only the value inside the stack. +** (We do not move additional fields that may exist.) +*/ +static void reverse (lua_State *L, StkId from, StkId to) { + for (; from < to; from++, to--) { + TValue temp; + setobj(L, &temp, s2v(from)); + setobjs2s(L, from, to); + setobj2s(L, to, &temp); + } +} + + +/* +** Let x = AB, where A is a prefix of length 'n'. Then, +** rotate x n == BA. But BA == (A^r . B^r)^r. +*/ +LUA_API void lua_rotate (lua_State *L, int idx, int n) { + StkId p, t, m; + lua_lock(L); + t = L->top - 1; /* end of stack segment being rotated */ + p = index2stack(L, idx); /* start of segment */ + api_check(L, (n >= 0 ? n : -n) <= (t - p + 1), "invalid 'n'"); + m = (n >= 0 ? t - n : p - n - 1); /* end of prefix */ + reverse(L, p, m); /* reverse the prefix with length 'n' */ + reverse(L, m + 1, t); /* reverse the suffix */ + reverse(L, p, t); /* reverse the entire segment */ + lua_unlock(L); +} + + +LUA_API void lua_copy (lua_State *L, int fromidx, int toidx) { + TValue *fr, *to; + lua_lock(L); + fr = index2value(L, fromidx); + to = index2value(L, toidx); + api_check(L, isvalid(L, to), "invalid index"); + setobj(L, to, fr); + if (isupvalue(toidx)) /* function upvalue? */ + luaC_barrier(L, clCvalue(s2v(L->ci->func)), fr); + /* LUA_REGISTRYINDEX does not need gc barrier + (collector revisits it before finishing collection) */ + lua_unlock(L); +} + + +LUA_API void lua_pushvalue (lua_State *L, int idx) { + lua_lock(L); + setobj2s(L, L->top, index2value(L, idx)); + api_incr_top(L); + lua_unlock(L); +} + + + +/* +** access functions (stack -> C) +*/ + + +LUA_API int lua_type (lua_State *L, int idx) { + const TValue *o = index2value(L, idx); + return (isvalid(L, o) ? ttype(o) : LUA_TNONE); +} + + +LUA_API const char *lua_typename (lua_State *L, int t) { + UNUSED(L); + api_check(L, LUA_TNONE <= t && t < LUA_NUMTYPES, "invalid type"); + return ttypename(t); +} + + +LUA_API int lua_iscfunction (lua_State *L, int idx) { + const TValue *o = index2value(L, idx); + return (ttislcf(o) || (ttisCclosure(o))); +} + + +LUA_API int lua_isinteger (lua_State *L, int idx) { + const TValue *o = index2value(L, idx); + return ttisinteger(o); +} + + +LUA_API int lua_isnumber (lua_State *L, int idx) { + lua_Number n; + const TValue *o = index2value(L, idx); + return tonumber(o, &n); +} + + +LUA_API int lua_isstring (lua_State *L, int idx) { + const TValue *o = index2value(L, idx); + return (ttisstring(o) || cvt2str(o)); +} + + +LUA_API int lua_isuserdata (lua_State *L, int idx) { + const TValue *o = index2value(L, idx); + return (ttisfulluserdata(o) || ttislightuserdata(o)); +} + + +LUA_API int lua_rawequal (lua_State *L, int index1, int index2) { + const TValue *o1 = index2value(L, index1); + const TValue *o2 = index2value(L, index2); + return (isvalid(L, o1) && isvalid(L, o2)) ? luaV_rawequalobj(o1, o2) : 0; +} + + +LUA_API void lua_arith (lua_State *L, int op) { + lua_lock(L); + if (op != LUA_OPUNM && op != LUA_OPBNOT) + api_checknelems(L, 2); /* all other operations expect two operands */ + else { /* for unary operations, add fake 2nd operand */ + api_checknelems(L, 1); + setobjs2s(L, L->top, L->top - 1); + api_incr_top(L); + } + /* first operand at top - 2, second at top - 1; result go to top - 2 */ + luaO_arith(L, op, s2v(L->top - 2), s2v(L->top - 1), L->top - 2); + L->top--; /* remove second operand */ + lua_unlock(L); +} + + +LUA_API int lua_compare (lua_State *L, int index1, int index2, int op) { + const TValue *o1; + const TValue *o2; + int i = 0; + lua_lock(L); /* may call tag method */ + o1 = index2value(L, index1); + o2 = index2value(L, index2); + if (isvalid(L, o1) && isvalid(L, o2)) { + switch (op) { + case LUA_OPEQ: i = luaV_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 size_t lua_stringtonumber (lua_State *L, const char *s) { + size_t sz = luaO_str2num(s, s2v(L->top)); + if (sz != 0) + api_incr_top(L); + return sz; +} + + +LUA_API lua_Number lua_tonumberx (lua_State *L, int idx, int *pisnum) { + lua_Number n = 0; + const TValue *o = index2value(L, idx); + int isnum = tonumber(o, &n); + if (pisnum) + *pisnum = isnum; + return n; +} + + +LUA_API lua_Integer lua_tointegerx (lua_State *L, int idx, int *pisnum) { + lua_Integer res = 0; + const TValue *o = index2value(L, idx); + int isnum = tointeger(o, &res); + if (pisnum) + *pisnum = isnum; + return res; +} + + +LUA_API int lua_toboolean (lua_State *L, int idx) { + const TValue *o = index2value(L, idx); + return !l_isfalse(o); +} + + +LUA_API const char *lua_tolstring (lua_State *L, int idx, size_t *len) { + TValue *o; + lua_lock(L); + o = index2value(L, idx); + if (!ttisstring(o)) { + if (!cvt2str(o)) { /* not convertible? */ + if (len != NULL) *len = 0; + lua_unlock(L); + return NULL; + } + luaO_tostring(L, o); + luaC_checkGC(L); + o = index2value(L, idx); /* previous call may reallocate the stack */ + } + if (len != NULL) + *len = vslen(o); + lua_unlock(L); + return svalue(o); +} + + +LUA_API lua_Unsigned lua_rawlen (lua_State *L, int idx) { + const TValue *o = index2value(L, idx); + switch (ttypetag(o)) { + case LUA_VSHRSTR: return tsvalue(o)->shrlen; + case LUA_VLNGSTR: return tsvalue(o)->u.lnglen; + case LUA_VUSERDATA: return uvalue(o)->len; + case LUA_VTABLE: return luaH_getn(hvalue(o)); + default: return 0; + } +} + + +LUA_API lua_CFunction lua_tocfunction (lua_State *L, int idx) { + const TValue *o = index2value(L, idx); + if (ttislcf(o)) return fvalue(o); + else if (ttisCclosure(o)) + return clCvalue(o)->f; + else return NULL; /* not a C function */ +} + + +static void *touserdata (const TValue *o) { + switch (ttype(o)) { + case LUA_TUSERDATA: return getudatamem(uvalue(o)); + case LUA_TLIGHTUSERDATA: return pvalue(o); + default: return NULL; + } +} + + +LUA_API void *lua_touserdata (lua_State *L, int idx) { + const TValue *o = index2value(L, idx); + return touserdata(o); +} + + +LUA_API lua_State *lua_tothread (lua_State *L, int idx) { + const TValue *o = index2value(L, idx); + return (!ttisthread(o)) ? NULL : thvalue(o); +} + + +/* +** Returns a pointer to the internal representation of an object. +** Note that ANSI C does not allow the conversion of a pointer to +** function to a 'void*', so the conversion here goes through +** a 'size_t'. (As the returned pointer is only informative, this +** conversion should not be a problem.) +*/ +LUA_API const void *lua_topointer (lua_State *L, int idx) { + const TValue *o = index2value(L, idx); + switch (ttypetag(o)) { + case LUA_VLCF: return cast_voidp(cast_sizet(fvalue(o))); + case LUA_VUSERDATA: case LUA_VLIGHTUSERDATA: + return touserdata(o); + default: { + if (iscollectable(o)) + return gcvalue(o); + else + return NULL; + } + } +} + + + +/* +** push functions (C -> stack) +*/ + + +LUA_API void lua_pushnil (lua_State *L) { + lua_lock(L); + setnilvalue(s2v(L->top)); + api_incr_top(L); + lua_unlock(L); +} + + +LUA_API void lua_pushnumber (lua_State *L, lua_Number n) { + lua_lock(L); + setfltvalue(s2v(L->top), n); + api_incr_top(L); + lua_unlock(L); +} + + +LUA_API void lua_pushinteger (lua_State *L, lua_Integer n) { + lua_lock(L); + setivalue(s2v(L->top), n); + api_incr_top(L); + lua_unlock(L); +} + + +/* +** Pushes on the stack a string with given length. Avoid using 's' when +** 'len' == 0 (as 's' can be NULL in that case), due to later use of +** 'memcmp' and 'memcpy'. +*/ +LUA_API const char *lua_pushlstring (lua_State *L, const char *s, size_t len) { + TString *ts; + lua_lock(L); + ts = (len == 0) ? luaS_new(L, "") : luaS_newlstr(L, s, len); + setsvalue2s(L, L->top, ts); + api_incr_top(L); + luaC_checkGC(L); + lua_unlock(L); + return getstr(ts); +} + + +LUA_API const char *lua_pushstring (lua_State *L, const char *s) { + lua_lock(L); + if (s == NULL) + setnilvalue(s2v(L->top)); + else { + TString *ts; + ts = luaS_new(L, s); + setsvalue2s(L, L->top, ts); + s = getstr(ts); /* internal copy's address */ + } + api_incr_top(L); + luaC_checkGC(L); + lua_unlock(L); + return s; +} + + +LUA_API const char *lua_pushvfstring (lua_State *L, const char *fmt, + va_list argp) { + const char *ret; + lua_lock(L); + ret = luaO_pushvfstring(L, fmt, argp); + luaC_checkGC(L); + 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); + va_start(argp, fmt); + ret = luaO_pushvfstring(L, fmt, argp); + va_end(argp); + luaC_checkGC(L); + 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(s2v(L->top), fn); + api_incr_top(L); + } + else { + CClosure *cl; + api_checknelems(L, n); + api_check(L, n <= MAXUPVAL, "upvalue index too large"); + cl = luaF_newCclosure(L, n); + cl->f = fn; + L->top -= n; + while (n--) { + setobj2n(L, &cl->upvalue[n], s2v(L->top + n)); + /* does not need barrier because closure is white */ + lua_assert(iswhite(cl)); + } + setclCvalue(L, s2v(L->top), cl); + api_incr_top(L); + luaC_checkGC(L); + } + lua_unlock(L); +} + + +LUA_API void lua_pushboolean (lua_State *L, int b) { + lua_lock(L); + if (b) + setbtvalue(s2v(L->top)); + else + setbfvalue(s2v(L->top)); + api_incr_top(L); + lua_unlock(L); +} + + +LUA_API void lua_pushlightuserdata (lua_State *L, void *p) { + lua_lock(L); + setpvalue(s2v(L->top), p); + api_incr_top(L); + lua_unlock(L); +} + + +LUA_API int lua_pushthread (lua_State *L) { + lua_lock(L); + setthvalue(L, s2v(L->top), L); + api_incr_top(L); + lua_unlock(L); + return (G(L)->mainthread == L); +} + + + +/* +** get functions (Lua -> stack) +*/ + + +static int auxgetstr (lua_State *L, const TValue *t, const char *k) { + const TValue *slot; + TString *str = luaS_new(L, k); + if (luaV_fastget(L, t, str, slot, luaH_getstr)) { + setobj2s(L, L->top, slot); + api_incr_top(L); + } + else { + setsvalue2s(L, L->top, str); + api_incr_top(L); + luaV_finishget(L, t, s2v(L->top - 1), L->top - 1, slot); + } + lua_unlock(L); + return ttype(s2v(L->top - 1)); +} + + +/* +** Get the global table in the registry. Since all predefined +** indices in the registry were inserted right when the registry +** was created and never removed, they must always be in the array +** part of the registry. +*/ +#define getGtable(L) \ + (&hvalue(&G(L)->l_registry)->array[LUA_RIDX_GLOBALS - 1]) + + +LUA_API int lua_getglobal (lua_State *L, const char *name) { + const TValue *G; + lua_lock(L); + G = getGtable(L); + return auxgetstr(L, G, name); +} + + +LUA_API int lua_gettable (lua_State *L, int idx) { + const TValue *slot; + TValue *t; + lua_lock(L); + t = index2value(L, idx); + if (luaV_fastget(L, t, s2v(L->top - 1), slot, luaH_get)) { + setobj2s(L, L->top - 1, slot); + } + else + luaV_finishget(L, t, s2v(L->top - 1), L->top - 1, slot); + lua_unlock(L); + return ttype(s2v(L->top - 1)); +} + + +LUA_API int lua_getfield (lua_State *L, int idx, const char *k) { + lua_lock(L); + return auxgetstr(L, index2value(L, idx), k); +} + + +LUA_API int lua_geti (lua_State *L, int idx, lua_Integer n) { + TValue *t; + const TValue *slot; + lua_lock(L); + t = index2value(L, idx); + if (luaV_fastgeti(L, t, n, slot)) { + setobj2s(L, L->top, slot); + } + else { + TValue aux; + setivalue(&aux, n); + luaV_finishget(L, t, &aux, L->top, slot); + } + api_incr_top(L); + lua_unlock(L); + return ttype(s2v(L->top - 1)); +} + + +static int finishrawget (lua_State *L, const TValue *val) { + if (isempty(val)) /* avoid copying empty items to the stack */ + setnilvalue(s2v(L->top)); + else + setobj2s(L, L->top, val); + api_incr_top(L); + lua_unlock(L); + return ttype(s2v(L->top - 1)); +} + + +static Table *gettable (lua_State *L, int idx) { + TValue *t = index2value(L, idx); + api_check(L, ttistable(t), "table expected"); + return hvalue(t); +} + + +LUA_API int lua_rawget (lua_State *L, int idx) { + Table *t; + const TValue *val; + lua_lock(L); + api_checknelems(L, 1); + t = gettable(L, idx); + val = luaH_get(t, s2v(L->top - 1)); + L->top--; /* remove key */ + return finishrawget(L, val); +} + + +LUA_API int lua_rawgeti (lua_State *L, int idx, lua_Integer n) { + Table *t; + lua_lock(L); + t = gettable(L, idx); + return finishrawget(L, luaH_getint(t, n)); +} + + +LUA_API int lua_rawgetp (lua_State *L, int idx, const void *p) { + Table *t; + TValue k; + lua_lock(L); + t = gettable(L, idx); + setpvalue(&k, cast_voidp(p)); + return finishrawget(L, luaH_get(t, &k)); +} + + +LUA_API void lua_createtable (lua_State *L, int narray, int nrec) { + Table *t; + lua_lock(L); + t = luaH_new(L); + sethvalue2s(L, L->top, t); + api_incr_top(L); + if (narray > 0 || nrec > 0) + luaH_resize(L, t, narray, nrec); + luaC_checkGC(L); + lua_unlock(L); +} + + +LUA_API int lua_getmetatable (lua_State *L, int objindex) { + const TValue *obj; + Table *mt; + int res = 0; + lua_lock(L); + obj = index2value(L, objindex); + switch (ttype(obj)) { + case LUA_TTABLE: + mt = hvalue(obj)->metatable; + break; + case LUA_TUSERDATA: + mt = uvalue(obj)->metatable; + break; + default: + mt = G(L)->mt[ttype(obj)]; + break; + } + if (mt != NULL) { + sethvalue2s(L, L->top, mt); + api_incr_top(L); + res = 1; + } + lua_unlock(L); + return res; +} + + +LUA_API int lua_getiuservalue (lua_State *L, int idx, int n) { + TValue *o; + int t; + lua_lock(L); + o = index2value(L, idx); + api_check(L, ttisfulluserdata(o), "full userdata expected"); + if (n <= 0 || n > uvalue(o)->nuvalue) { + setnilvalue(s2v(L->top)); + t = LUA_TNONE; + } + else { + setobj2s(L, L->top, &uvalue(o)->uv[n - 1].uv); + t = ttype(s2v(L->top)); + } + api_incr_top(L); + lua_unlock(L); + return t; +} + + +/* +** set functions (stack -> Lua) +*/ + +/* +** t[k] = value at the top of the stack (where 'k' is a string) +*/ +static void auxsetstr (lua_State *L, const TValue *t, const char *k) { + const TValue *slot; + TString *str = luaS_new(L, k); + api_checknelems(L, 1); + if (luaV_fastget(L, t, str, slot, luaH_getstr)) { + luaV_finishfastset(L, t, slot, s2v(L->top - 1)); + L->top--; /* pop value */ + } + else { + setsvalue2s(L, L->top, str); /* push 'str' (to make it a TValue) */ + api_incr_top(L); + luaV_finishset(L, t, s2v(L->top - 1), s2v(L->top - 2), slot); + L->top -= 2; /* pop value and key */ + } + lua_unlock(L); /* lock done by caller */ +} + + +LUA_API void lua_setglobal (lua_State *L, const char *name) { + const TValue *G; + lua_lock(L); /* unlock done in 'auxsetstr' */ + G = getGtable(L); + auxsetstr(L, G, name); +} + + +LUA_API void lua_settable (lua_State *L, int idx) { + TValue *t; + const TValue *slot; + lua_lock(L); + api_checknelems(L, 2); + t = index2value(L, idx); + if (luaV_fastget(L, t, s2v(L->top - 2), slot, luaH_get)) { + luaV_finishfastset(L, t, slot, s2v(L->top - 1)); + } + else + luaV_finishset(L, t, s2v(L->top - 2), s2v(L->top - 1), slot); + L->top -= 2; /* pop index and value */ + lua_unlock(L); +} + + +LUA_API void lua_setfield (lua_State *L, int idx, const char *k) { + lua_lock(L); /* unlock done in 'auxsetstr' */ + auxsetstr(L, index2value(L, idx), k); +} + + +LUA_API void lua_seti (lua_State *L, int idx, lua_Integer n) { + TValue *t; + const TValue *slot; + lua_lock(L); + api_checknelems(L, 1); + t = index2value(L, idx); + if (luaV_fastgeti(L, t, n, slot)) { + luaV_finishfastset(L, t, slot, s2v(L->top - 1)); + } + else { + TValue aux; + setivalue(&aux, n); + luaV_finishset(L, t, &aux, s2v(L->top - 1), slot); + } + L->top--; /* pop value */ + lua_unlock(L); +} + + +static void aux_rawset (lua_State *L, int idx, TValue *key, int n) { + Table *t; + lua_lock(L); + api_checknelems(L, n); + t = gettable(L, idx); + luaH_set(L, t, key, s2v(L->top - 1)); + invalidateTMcache(t); + luaC_barrierback(L, obj2gco(t), s2v(L->top - 1)); + L->top -= n; + lua_unlock(L); +} + + +LUA_API void lua_rawset (lua_State *L, int idx) { + aux_rawset(L, idx, s2v(L->top - 2), 2); +} + + +LUA_API void lua_rawsetp (lua_State *L, int idx, const void *p) { + TValue k; + setpvalue(&k, cast_voidp(p)); + aux_rawset(L, idx, &k, 1); +} + + +LUA_API void lua_rawseti (lua_State *L, int idx, lua_Integer n) { + Table *t; + lua_lock(L); + api_checknelems(L, 1); + t = gettable(L, idx); + luaH_setint(L, t, n, s2v(L->top - 1)); + luaC_barrierback(L, obj2gco(t), s2v(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 = index2value(L, objindex); + if (ttisnil(s2v(L->top - 1))) + mt = NULL; + else { + api_check(L, ttistable(s2v(L->top - 1)), "table expected"); + mt = hvalue(s2v(L->top - 1)); + } + switch (ttype(obj)) { + case LUA_TTABLE: { + hvalue(obj)->metatable = mt; + if (mt) { + luaC_objbarrier(L, gcvalue(obj), mt); + luaC_checkfinalizer(L, gcvalue(obj), mt); + } + break; + } + case LUA_TUSERDATA: { + uvalue(obj)->metatable = mt; + if (mt) { + luaC_objbarrier(L, uvalue(obj), mt); + luaC_checkfinalizer(L, gcvalue(obj), mt); + } + break; + } + default: { + G(L)->mt[ttype(obj)] = mt; + break; + } + } + L->top--; + lua_unlock(L); + return 1; +} + + +LUA_API int lua_setiuservalue (lua_State *L, int idx, int n) { + TValue *o; + int res; + lua_lock(L); + api_checknelems(L, 1); + o = index2value(L, idx); + api_check(L, ttisfulluserdata(o), "full userdata expected"); + if (!(cast_uint(n) - 1u < cast_uint(uvalue(o)->nuvalue))) + res = 0; /* 'n' not in [1, uvalue(o)->nuvalue] */ + else { + setobj(L, &uvalue(o)->uv[n - 1].uv, s2v(L->top - 1)); + luaC_barrierback(L, gcvalue(o), s2v(L->top - 1)); + res = 1; + } + L->top--; + lua_unlock(L); + return res; +} + + +/* +** '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 void lua_callk (lua_State *L, int nargs, int nresults, + lua_KContext ctx, lua_KFunction 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 && yieldable(L)) { /* 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); /* do the call */ + } + else /* no continuation or no yieldable */ + luaD_callnoyield(L, func, nresults); /* 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_callnoyield(L, c->func, c->nresults); +} + + + +LUA_API int lua_pcallk (lua_State *L, int nargs, int nresults, int errfunc, + lua_KContext ctx, lua_KFunction 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 = index2stack(L, errfunc); + api_check(L, ttisfunction(s2v(o)), "error handler must be a function"); + func = savestack(L, o); + } + c.func = L->top - (nargs+1); /* function to be called */ + if (k == NULL || !yieldable(L)) { /* 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->u2.funcidx = cast_int(savestack(L, c.func)); + ci->u.c.old_errfunc = L->errfunc; + L->errfunc = func; + setoah(ci->callstatus, L->allowhook); /* save value of 'allowhook' */ + ci->callstatus |= CIST_YPCALL; /* function can do error recovery */ + luaD_call(L, c.func, nresults); /* 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(s2v(L->top - 1)); /* get newly created function */ + if (f->nupvalues >= 1) { /* does it have an upvalue? */ + /* get global table from registry */ + const TValue *gt = getGtable(L); + /* 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 strip) { + int status; + TValue *o; + lua_lock(L); + api_checknelems(L, 1); + o = s2v(L->top - 1); + if (isLfunction(o)) + status = luaU_dump(L, getproto(o), writer, data, strip); + 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, ...) { + va_list argp; + int res = 0; + global_State *g; + lua_lock(L); + g = G(L); + va_start(argp, what); + 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: { + int data = va_arg(argp, int); + l_mem debt = 1; /* =1 to signal that it did an actual step */ + lu_byte oldrunning = g->gcrunning; + g->gcrunning = 1; /* allow GC to run */ + if (data == 0) { + luaE_setdebt(g, 0); /* do a basic step */ + luaC_step(L); + } + else { /* add 'data' to total debt */ + debt = cast(l_mem, data) * 1024 + g->GCdebt; + luaE_setdebt(g, debt); + luaC_checkGC(L); + } + g->gcrunning = oldrunning; /* restore previous state */ + if (debt > 0 && g->gcstate == GCSpause) /* end of cycle? */ + res = 1; /* signal it */ + break; + } + case LUA_GCSETPAUSE: { + int data = va_arg(argp, int); + res = getgcparam(g->gcpause); + setgcparam(g->gcpause, data); + break; + } + case LUA_GCSETSTEPMUL: { + int data = va_arg(argp, int); + res = getgcparam(g->gcstepmul); + setgcparam(g->gcstepmul, data); + break; + } + case LUA_GCISRUNNING: { + res = g->gcrunning; + break; + } + case LUA_GCGEN: { + int minormul = va_arg(argp, int); + int majormul = va_arg(argp, int); + res = isdecGCmodegen(g) ? LUA_GCGEN : LUA_GCINC; + if (minormul != 0) + g->genminormul = minormul; + if (majormul != 0) + setgcparam(g->genmajormul, majormul); + luaC_changemode(L, KGC_GEN); + break; + } + case LUA_GCINC: { + int pause = va_arg(argp, int); + int stepmul = va_arg(argp, int); + int stepsize = va_arg(argp, int); + res = isdecGCmodegen(g) ? LUA_GCGEN : LUA_GCINC; + if (pause != 0) + setgcparam(g->gcpause, pause); + if (stepmul != 0) + setgcparam(g->gcstepmul, stepmul); + if (stepsize != 0) + g->gcstepsize = stepsize; + luaC_changemode(L, KGC_INC); + break; + } + default: res = -1; /* invalid option */ + } + va_end(argp); + lua_unlock(L); + return res; +} + + + +/* +** miscellaneous functions +*/ + + +LUA_API int lua_error (lua_State *L) { + TValue *errobj; + lua_lock(L); + errobj = s2v(L->top - 1); + api_checknelems(L, 1); + /* error object is the memory error message? */ + if (ttisshrstring(errobj) && eqshrstr(tsvalue(errobj), G(L)->memerrmsg)) + luaM_error(L); /* raise a memory error */ + else + luaG_errormsg(L); /* raise a regular error */ + /* 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) { + Table *t; + int more; + lua_lock(L); + api_checknelems(L, 1); + t = gettable(L, idx); + more = luaH_next(L, 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_toclose (lua_State *L, int idx) { + int nresults; + StkId o; + lua_lock(L); + o = index2stack(L, idx); + nresults = L->ci->nresults; + api_check(L, L->tbclist < o, "given index below or equal a marked one"); + luaF_newtbcupval(L, o); /* create new to-be-closed upvalue */ + if (!hastocloseCfunc(nresults)) /* function not marked yet? */ + L->ci->nresults = codeNresults(nresults); /* mark it */ + lua_assert(hastocloseCfunc(L->ci->nresults)); + lua_unlock(L); +} + + +LUA_API void lua_concat (lua_State *L, int n) { + lua_lock(L); + api_checknelems(L, n); + if (n > 0) + luaV_concat(L, n); + else { /* nothing to concatenate */ + setsvalue2s(L, L->top, luaS_newlstr(L, "", 0)); /* push empty string */ + api_incr_top(L); + } + luaC_checkGC(L); + lua_unlock(L); +} + + +LUA_API void lua_len (lua_State *L, int idx) { + TValue *t; + lua_lock(L); + t = index2value(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); +} + + +void lua_setwarnf (lua_State *L, lua_WarnFunction f, void *ud) { + lua_lock(L); + G(L)->ud_warn = ud; + G(L)->warnf = f; + lua_unlock(L); +} + + +void lua_warning (lua_State *L, const char *msg, int tocont) { + lua_lock(L); + luaE_warning(L, msg, tocont); + lua_unlock(L); +} + + + +LUA_API void *lua_newuserdatauv (lua_State *L, size_t size, int nuvalue) { + Udata *u; + lua_lock(L); + api_check(L, 0 <= nuvalue && nuvalue < USHRT_MAX, "invalid value"); + u = luaS_newudata(L, size, nuvalue); + setuvalue(L, s2v(L->top), u); + api_incr_top(L); + luaC_checkGC(L); + lua_unlock(L); + return getudatamem(u); +} + + + +static const char *aux_upvalue (TValue *fi, int n, TValue **val, + GCObject **owner) { + switch (ttypetag(fi)) { + case LUA_VCCL: { /* C closure */ + CClosure *f = clCvalue(fi); + if (!(cast_uint(n) - 1u < cast_uint(f->nupvalues))) + return NULL; /* 'n' not in [1, f->nupvalues] */ + *val = &f->upvalue[n-1]; + if (owner) *owner = obj2gco(f); + return ""; + } + case LUA_VLCL: { /* Lua closure */ + LClosure *f = clLvalue(fi); + TString *name; + Proto *p = f->p; + if (!(cast_uint(n) - 1u < cast_uint(p->sizeupvalues))) + return NULL; /* 'n' not in [1, p->sizeupvalues] */ + *val = f->upvals[n-1]->v; + if (owner) *owner = obj2gco(f->upvals[n - 1]); + name = p->upvalues[n-1].name; + return (name == NULL) ? "(no name)" : 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(index2value(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 */ + TValue *fi; + lua_lock(L); + fi = index2value(L, funcindex); + api_checknelems(L, 1); + name = aux_upvalue(fi, n, &val, &owner); + if (name) { + L->top--; + setobj(L, val, s2v(L->top)); + luaC_barrier(L, owner, val); + } + lua_unlock(L); + return name; +} + + +static UpVal **getupvalref (lua_State *L, int fidx, int n, LClosure **pf) { + static const UpVal *const nullup = NULL; + LClosure *f; + TValue *fi = index2value(L, fidx); + api_check(L, ttisLclosure(fi), "Lua function expected"); + f = clLvalue(fi); + if (pf) *pf = f; + if (1 <= n && n <= f->p->sizeupvalues) + return &f->upvals[n - 1]; /* get its upvalue pointer */ + else + return (UpVal**)&nullup; +} + + +LUA_API void *lua_upvalueid (lua_State *L, int fidx, int n) { + TValue *fi = index2value(L, fidx); + switch (ttypetag(fi)) { + case LUA_VLCL: { /* lua closure */ + return *getupvalref(L, fidx, n, NULL); + } + case LUA_VCCL: { /* C closure */ + CClosure *f = clCvalue(fi); + if (1 <= n && n <= f->nupvalues) + return &f->upvalue[n - 1]; + /* else */ + } /* FALLTHROUGH */ + case LUA_VLCF: + return NULL; /* light C functions have no upvalues */ + default: { + api_check(L, 0, "function 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); + api_check(L, *up1 != NULL && *up2 != NULL, "invalid upvalue index"); + *up1 = *up2; + luaC_objbarrier(L, f1, *up1); +} + + diff --git a/lua-5.4.3/src/lapi.h b/lua-5.4.3/src/lapi.h new file mode 100644 index 0000000..9e99cc4 --- /dev/null +++ b/lua-5.4.3/src/lapi.h @@ -0,0 +1,49 @@ +/* +** $Id: lapi.h $ +** Auxiliary functions from Lua API +** See Copyright Notice in lua.h +*/ + +#ifndef lapi_h +#define lapi_h + + +#include "llimits.h" +#include "lstate.h" + + +/* Increments 'L->top', checking for stack overflows */ +#define api_incr_top(L) {L->top++; api_check(L, L->top <= L->ci->top, \ + "stack overflow");} + + +/* +** If a call returns too many multiple returns, the callee may not have +** stack space to accommodate all results. In this case, this macro +** increases its stack space ('L->ci->top'). +*/ +#define adjustresults(L,nres) \ + { if ((nres) <= LUA_MULTRET && L->ci->top < L->top) L->ci->top = L->top; } + + +/* Ensure the stack has at least 'n' elements */ +#define api_checknelems(L,n) api_check(L, (n) < (L->top - L->ci->func), \ + "not enough elements in the stack") + + +/* +** To reduce the overhead of returning from C functions, the presence of +** to-be-closed variables in these functions is coded in the CallInfo's +** field 'nresults', in a way that functions with no to-be-closed variables +** with zero, one, or "all" wanted results have no overhead. Functions +** with other number of wanted results, as well as functions with +** variables to be closed, have an extra check. +*/ + +#define hastocloseCfunc(n) ((n) < LUA_MULTRET) + +/* Map [-1, inf) (range of 'nresults') into (-inf, -2] */ +#define codeNresults(n) (-(n) - 3) +#define decodeNresults(n) (-(n) - 3) + +#endif diff --git a/lua-5.4.3/src/lauxlib.c b/lua-5.4.3/src/lauxlib.c new file mode 100644 index 0000000..94835ef --- /dev/null +++ b/lua-5.4.3/src/lauxlib.c @@ -0,0 +1,1105 @@ +/* +** $Id: lauxlib.c $ +** Auxiliary functions for building Lua libraries +** See Copyright Notice in lua.h +*/ + +#define lauxlib_c +#define LUA_LIB + +#include "lprefix.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. +*/ + +#include "lua.h" + +#include "lauxlib.h" + + +#if !defined(MAX_SIZET) +/* maximum value for size_t */ +#define MAX_SIZET ((size_t)(~(size_t)0)) +#endif + + +/* +** {====================================================== +** Traceback +** ======================================================= +*/ + + +#define LEVELS1 10 /* size of the first part of the stack */ +#define LEVELS2 11 /* size of the second part of the stack */ + + + +/* +** Search for 'objidx' in table at index -1. ('objidx' must be an +** absolute index.) Return 1 + string at top if it found 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 */ + /* stack: lib_name, lib_table, field_name (top) */ + lua_pushliteral(L, "."); /* place '.' between the two names */ + lua_replace(L, -3); /* (in the slot occupied by table) */ + lua_concat(L, 3); /* lib_name.field_name */ + return 1; + } + } + lua_pop(L, 1); /* remove value */ + } + return 0; /* not found */ +} + + +/* +** Search for a name for a function in all loaded modules +*/ +static int pushglobalfuncname (lua_State *L, lua_Debug *ar) { + int top = lua_gettop(L); + lua_getinfo(L, "f", ar); /* push function */ + lua_getfield(L, LUA_REGISTRYINDEX, LUA_LOADED_TABLE); + if (findfield(L, top + 1, 2)) { + const char *name = lua_tostring(L, -1); + if (strncmp(name, LUA_GNAME ".", 3) == 0) { /* name start with '_G.'? */ + lua_pushstring(L, name + 3); /* push name without prefix */ + lua_remove(L, -2); /* remove original name */ + } + lua_copy(L, -1, top + 1); /* copy name to proper place */ + lua_settop(L, top + 1); /* remove table "loaded" and name copy */ + return 1; + } + else { + lua_settop(L, top); /* remove function and global table */ + return 0; + } +} + + +static void pushfuncname (lua_State *L, lua_Debug *ar) { + if (pushglobalfuncname(L, ar)) { /* try first a global name */ + lua_pushfstring(L, "function '%s'", lua_tostring(L, -1)); + lua_remove(L, -2); /* remove name */ + } + else if (*ar->namewhat != '\0') /* is there a name from code? */ + lua_pushfstring(L, "%s '%s'", ar->namewhat, ar->name); /* use it */ + else if (*ar->what == 'm') /* main? */ + lua_pushliteral(L, "main chunk"); + else if (*ar->what != 'C') /* for Lua functions, use */ + lua_pushfstring(L, "function <%s:%d>", ar->short_src, ar->linedefined); + else /* nothing left... */ + lua_pushliteral(L, "?"); +} + + +static int lastlevel (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) { + luaL_Buffer b; + lua_Debug ar; + int last = lastlevel(L1); + int limit2show = (last - level > LEVELS1 + LEVELS2) ? LEVELS1 : -1; + luaL_buffinit(L, &b); + if (msg) { + luaL_addstring(&b, msg); + luaL_addchar(&b, '\n'); + } + luaL_addstring(&b, "stack traceback:"); + while (lua_getstack(L1, level++, &ar)) { + if (limit2show-- == 0) { /* too many levels? */ + int n = last - level - LEVELS2 + 1; /* number of levels to skip */ + lua_pushfstring(L, "\n\t...\t(skipping %d levels)", n); + luaL_addvalue(&b); /* add warning about skip */ + level += n; /* and skip to last levels */ + } + else { + lua_getinfo(L1, "Slnt", &ar); + if (ar.currentline <= 0) + lua_pushfstring(L, "\n\t%s: in ", ar.short_src); + else + lua_pushfstring(L, "\n\t%s:%d: in ", ar.short_src, ar.currentline); + luaL_addvalue(&b); + pushfuncname(L, &ar); + luaL_addvalue(&b); + if (ar.istailcall) + luaL_addstring(&b, "\n\t(...tail calls...)"); + } + } + luaL_pushresult(&b); +} + +/* }====================================================== */ + + +/* +** {====================================================== +** Error-report functions +** ======================================================= +*/ + +LUALIB_API int luaL_argerror (lua_State *L, int arg, const char *extramsg) { + lua_Debug ar; + if (!lua_getstack(L, 0, &ar)) /* no stack frame? */ + return luaL_error(L, "bad argument #%d (%s)", arg, extramsg); + lua_getinfo(L, "n", &ar); + if (strcmp(ar.namewhat, "method") == 0) { + arg--; /* do not count 'self' */ + if (arg == 0) /* error is in the self argument itself? */ + return luaL_error(L, "calling '%s' 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 '%s' (%s)", + arg, ar.name, extramsg); +} + + +LUALIB_API int luaL_typeerror (lua_State *L, int arg, const char *tname) { + const char *msg; + const char *typearg; /* name for the type of the actual argument */ + if (luaL_getmetafield(L, arg, "__name") == LUA_TSTRING) + typearg = lua_tostring(L, -1); /* use the given type name */ + else if (lua_type(L, arg) == LUA_TLIGHTUSERDATA) + typearg = "light userdata"; /* special name for messages */ + else + typearg = luaL_typename(L, arg); /* standard name */ + msg = lua_pushfstring(L, "%s expected, got %s", tname, typearg); + return luaL_argerror(L, arg, msg); +} + + +static void tag_error (lua_State *L, int arg, int tag) { + luaL_typeerror(L, arg, lua_typename(L, tag)); +} + + +/* +** The use of 'lua_pushfstring' ensures this function does not +** need reserved stack space when called. +*/ +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_pushfstring(L, ""); /* else, no information available... */ +} + + +/* +** Again, the use of 'lua_pushvfstring' ensures this function does +** not need reserved stack space when called. (At worst, it generates +** an error with "stack overflow" instead of the given message.) +*/ +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 { + luaL_pushfail(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(l_inspectstat) /* { */ + +#if defined(LUA_USE_POSIX) + +#include + +/* +** use appropriate macros to interpret 'pclose' return status +*/ +#define l_inspectstat(stat,what) \ + if (WIFEXITED(stat)) { stat = WEXITSTATUS(stat); } \ + else if (WIFSIGNALED(stat)) { stat = WTERMSIG(stat); what = "signal"; } + +#else + +#define l_inspectstat(stat,what) /* no op */ + +#endif + +#endif /* } */ + + +LUALIB_API int luaL_execresult (lua_State *L, int stat) { + if (stat != 0 && errno != 0) /* error with an 'errno'? */ + return luaL_fileresult(L, 0, NULL); + else { + const char *what = "exit"; /* type of termination */ + l_inspectstat(stat, what); /* interpret result */ + if (*what == 'e' && stat == 0) /* successful termination? */ + lua_pushboolean(L, 1); + else + luaL_pushfail(L); + lua_pushstring(L, what); + lua_pushinteger(L, stat); + return 3; /* return true/fail,what,code */ + } +} + +/* }====================================================== */ + + + +/* +** {====================================================== +** Userdata's metatable manipulation +** ======================================================= +*/ + +LUALIB_API int luaL_newmetatable (lua_State *L, const char *tname) { + if (luaL_getmetatable(L, tname) != LUA_TNIL) /* name already in use? */ + return 0; /* leave previous value on top, but return 0 */ + lua_pop(L, 1); + lua_createtable(L, 0, 2); /* create metatable */ + lua_pushstring(L, tname); + lua_setfield(L, -2, "__name"); /* metatable.__name = tname */ + 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); + luaL_argexpected(L, p != NULL, ud, tname); + return p; +} + +/* }====================================================== */ + + +/* +** {====================================================== +** Argument check functions +** ======================================================= +*/ + +LUALIB_API int luaL_checkoption (lua_State *L, int arg, const char *def, + const char *const lst[]) { + const char *name = (def) ? luaL_optstring(L, arg, def) : + luaL_checkstring(L, arg); + int i; + for (i=0; lst[i]; i++) + if (strcmp(lst[i], name) == 0) + return i; + return luaL_argerror(L, arg, + lua_pushfstring(L, "invalid option '%s'", name)); +} + + +/* +** Ensures the stack has at least 'space' extra slots, raising an error +** if it cannot fulfill the request. (The error handling needs a few +** extra slots to format the error message. In case of an error without +** this extra space, Lua will generate the same 'stack overflow' error, +** but without 'msg'.) +*/ +LUALIB_API void luaL_checkstack (lua_State *L, int space, const char *msg) { + if (l_unlikely(!lua_checkstack(L, space))) { + if (msg) + luaL_error(L, "stack overflow (%s)", msg); + else + luaL_error(L, "stack overflow"); + } +} + + +LUALIB_API void luaL_checktype (lua_State *L, int arg, int t) { + if (l_unlikely(lua_type(L, arg) != t)) + tag_error(L, arg, t); +} + + +LUALIB_API void luaL_checkany (lua_State *L, int arg) { + if (l_unlikely(lua_type(L, arg) == LUA_TNONE)) + luaL_argerror(L, arg, "value expected"); +} + + +LUALIB_API const char *luaL_checklstring (lua_State *L, int arg, size_t *len) { + const char *s = lua_tolstring(L, arg, len); + if (l_unlikely(!s)) tag_error(L, arg, LUA_TSTRING); + return s; +} + + +LUALIB_API const char *luaL_optlstring (lua_State *L, int arg, + const char *def, size_t *len) { + if (lua_isnoneornil(L, arg)) { + if (len) + *len = (def ? strlen(def) : 0); + return def; + } + else return luaL_checklstring(L, arg, len); +} + + +LUALIB_API lua_Number luaL_checknumber (lua_State *L, int arg) { + int isnum; + lua_Number d = lua_tonumberx(L, arg, &isnum); + if (l_unlikely(!isnum)) + tag_error(L, arg, LUA_TNUMBER); + return d; +} + + +LUALIB_API lua_Number luaL_optnumber (lua_State *L, int arg, lua_Number def) { + return luaL_opt(L, luaL_checknumber, arg, def); +} + + +static void interror (lua_State *L, int arg) { + if (lua_isnumber(L, arg)) + luaL_argerror(L, arg, "number has no integer representation"); + else + tag_error(L, arg, LUA_TNUMBER); +} + + +LUALIB_API lua_Integer luaL_checkinteger (lua_State *L, int arg) { + int isnum; + lua_Integer d = lua_tointegerx(L, arg, &isnum); + if (l_unlikely(!isnum)) { + interror(L, arg); + } + return d; +} + + +LUALIB_API lua_Integer luaL_optinteger (lua_State *L, int arg, + lua_Integer def) { + return luaL_opt(L, luaL_checkinteger, arg, def); +} + +/* }====================================================== */ + + +/* +** {====================================================== +** Generic Buffer manipulation +** ======================================================= +*/ + +/* userdata to box arbitrary data */ +typedef struct UBox { + void *box; + size_t bsize; +} UBox; + + +static void *resizebox (lua_State *L, int idx, size_t newsize) { + void *ud; + lua_Alloc allocf = lua_getallocf(L, &ud); + UBox *box = (UBox *)lua_touserdata(L, idx); + void *temp = allocf(ud, box->box, box->bsize, newsize); + if (l_unlikely(temp == NULL && newsize > 0)) { /* allocation error? */ + lua_pushliteral(L, "not enough memory"); + lua_error(L); /* raise a memory error */ + } + box->box = temp; + box->bsize = newsize; + return temp; +} + + +static int boxgc (lua_State *L) { + resizebox(L, 1, 0); + return 0; +} + + +static const luaL_Reg boxmt[] = { /* box metamethods */ + {"__gc", boxgc}, + {"__close", boxgc}, + {NULL, NULL} +}; + + +static void newbox (lua_State *L) { + UBox *box = (UBox *)lua_newuserdatauv(L, sizeof(UBox), 0); + box->box = NULL; + box->bsize = 0; + if (luaL_newmetatable(L, "_UBOX*")) /* creating metatable? */ + luaL_setfuncs(L, boxmt, 0); /* set its metamethods */ + lua_setmetatable(L, -2); +} + + +/* +** check whether buffer is using a userdata on the stack as a temporary +** buffer +*/ +#define buffonstack(B) ((B)->b != (B)->init.b) + + +/* +** Whenever buffer is accessed, slot 'idx' must either be a box (which +** cannot be NULL) or it is a placeholder for the buffer. +*/ +#define checkbufferlevel(B,idx) \ + lua_assert(buffonstack(B) ? lua_touserdata(B->L, idx) != NULL \ + : lua_touserdata(B->L, idx) == (void*)B) + + +/* +** Compute new size for buffer 'B', enough to accommodate extra 'sz' +** bytes. +*/ +static size_t newbuffsize (luaL_Buffer *B, size_t sz) { + size_t newsize = B->size * 2; /* double buffer size */ + if (l_unlikely(MAX_SIZET - sz < B->n)) /* overflow in (B->n + sz)? */ + return luaL_error(B->L, "buffer too large"); + if (newsize < B->n + sz) /* double is not big enough? */ + newsize = B->n + sz; + return newsize; +} + + +/* +** Returns a pointer to a free area with at least 'sz' bytes in buffer +** 'B'. 'boxidx' is the relative position in the stack where is the +** buffer's box or its placeholder. +*/ +static char *prepbuffsize (luaL_Buffer *B, size_t sz, int boxidx) { + checkbufferlevel(B, boxidx); + if (B->size - B->n >= sz) /* enough space? */ + return B->b + B->n; + else { + lua_State *L = B->L; + char *newbuff; + size_t newsize = newbuffsize(B, sz); + /* create larger buffer */ + if (buffonstack(B)) /* buffer already has a box? */ + newbuff = (char *)resizebox(L, boxidx, newsize); /* resize it */ + else { /* no box yet */ + lua_remove(L, boxidx); /* remove placeholder */ + newbox(L); /* create a new box */ + lua_insert(L, boxidx); /* move box to its intended position */ + lua_toclose(L, boxidx); + newbuff = (char *)resizebox(L, boxidx, newsize); + memcpy(newbuff, B->b, B->n * sizeof(char)); /* copy original content */ + } + B->b = newbuff; + B->size = newsize; + return newbuff + B->n; + } +} + +/* +** returns a pointer to a free area with at least 'sz' bytes +*/ +LUALIB_API char *luaL_prepbuffsize (luaL_Buffer *B, size_t sz) { + return prepbuffsize(B, sz, -1); +} + + +LUALIB_API void luaL_addlstring (luaL_Buffer *B, const char *s, size_t l) { + if (l > 0) { /* avoid 'memcpy' when 's' can be NULL */ + char *b = prepbuffsize(B, l, -1); + 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; + checkbufferlevel(B, -1); + lua_pushlstring(L, B->b, B->n); + if (buffonstack(B)) + lua_closeslot(L, -2); /* close the box */ + lua_remove(L, -2); /* remove box or placeholder from the stack */ +} + + +LUALIB_API void luaL_pushresultsize (luaL_Buffer *B, size_t sz) { + luaL_addsize(B, sz); + luaL_pushresult(B); +} + + +/* +** 'luaL_addvalue' is the only function in the Buffer system where the +** box (if existent) is not on the top of the stack. So, instead of +** calling 'luaL_addlstring', it replicates the code using -2 as the +** last argument to 'prepbuffsize', signaling that the box is (or will +** be) bellow the string being added to the buffer. (Box creation can +** trigger an emergency GC, so we should not remove the string from the +** stack before we have the space guaranteed.) +*/ +LUALIB_API void luaL_addvalue (luaL_Buffer *B) { + lua_State *L = B->L; + size_t len; + const char *s = lua_tolstring(L, -1, &len); + char *b = prepbuffsize(B, len, -2); + memcpy(b, s, len * sizeof(char)); + luaL_addsize(B, len); + lua_pop(L, 1); /* pop string */ +} + + +LUALIB_API void luaL_buffinit (lua_State *L, luaL_Buffer *B) { + B->L = L; + B->b = B->init.b; + B->n = 0; + B->size = LUAL_BUFFERSIZE; + lua_pushlightuserdata(L, (void*)B); /* push placeholder */ +} + + +LUALIB_API char *luaL_buffinitsize (lua_State *L, luaL_Buffer *B, size_t sz) { + luaL_buffinit(L, B); + return prepbuffsize(B, sz, -1); +} + +/* }====================================================== */ + + +/* +** {====================================================== +** Reference system +** ======================================================= +*/ + +/* index of free-list header (after the predefined values) */ +#define freelist (LUA_RIDX_LAST + 1) + +/* +** The previously freed references form a linked list: +** t[freelist] is the index of a first free index, or zero if list is +** empty; t[t[freelist]] is the index of the second element; etc. +*/ +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); + if (lua_rawgeti(L, t, freelist) == LUA_TNIL) { /* first access? */ + ref = 0; /* list is empty */ + lua_pushinteger(L, 0); /* initialize as an empty list */ + lua_rawseti(L, t, freelist); /* ref = t[freelist] = 0 */ + } + else { /* already initialized */ + lua_assert(lua_isinteger(L, -1)); + ref = (int)lua_tointeger(L, -1); /* ref = t[freelist] */ + } + lua_pop(L, 1); /* remove element 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_assert(lua_isinteger(L, -1)); + 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[BUFSIZ]; /* 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"; /* UTF-8 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 LUA_TNIL; + else { + int tt; + lua_pushstring(L, event); + tt = lua_rawget(L, -2); + if (tt == LUA_TNIL) /* is metafield nil? */ + lua_pop(L, 2); /* remove metatable and metafield */ + else + lua_remove(L, -2); /* remove only metatable */ + return tt; /* return metafield type */ + } +} + + +LUALIB_API int luaL_callmeta (lua_State *L, int obj, const char *event) { + obj = lua_absindex(L, obj); + if (luaL_getmetafield(L, obj, event) == LUA_TNIL) /* no metafield? */ + return 0; + lua_pushvalue(L, obj); + lua_call(L, 1, 1); + return 1; +} + + +LUALIB_API lua_Integer luaL_len (lua_State *L, int idx) { + lua_Integer l; + int isnum; + lua_len(L, idx); + l = lua_tointegerx(L, -1, &isnum); + if (l_unlikely(!isnum)) + luaL_error(L, "object length is not an integer"); + 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")) { /* metafield? */ + if (!lua_isstring(L, -1)) + luaL_error(L, "'__tostring' must return a string"); + } + else { + switch (lua_type(L, idx)) { + case LUA_TNUMBER: { + if (lua_isinteger(L, idx)) + lua_pushfstring(L, "%I", (LUAI_UACINT)lua_tointeger(L, idx)); + else + lua_pushfstring(L, "%f", (LUAI_UACNUMBER)lua_tonumber(L, idx)); + break; + } + 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: { + int tt = luaL_getmetafield(L, idx, "__name"); /* try name */ + const char *kind = (tt == LUA_TSTRING) ? lua_tostring(L, -1) : + luaL_typename(L, idx); + lua_pushfstring(L, "%s: %p", kind, lua_topointer(L, idx)); + if (tt != LUA_TNIL) + lua_remove(L, -2); /* remove '__name' */ + break; + } + } + } + return lua_tolstring(L, -1, len); +} + + +/* +** 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_checkstack(L, nup, "too many upvalues"); + for (; l->name != NULL; l++) { /* fill the table with given functions */ + if (l->func == NULL) /* place holder? */ + lua_pushboolean(L, 0); + else { + 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) { + if (lua_getfield(L, idx, fname) == LUA_TTABLE) + 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': After checking "loaded" table, 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) { + luaL_getsubtable(L, LUA_REGISTRYINDEX, LUA_LOADED_TABLE); + lua_getfield(L, -1, modname); /* LOADED[modname] */ + if (!lua_toboolean(L, -1)) { /* package not already loaded? */ + lua_pop(L, 1); /* remove field */ + lua_pushcfunction(L, openf); + lua_pushstring(L, modname); /* argument to open function */ + lua_call(L, 1, 1); /* call 'openf' to open module */ + lua_pushvalue(L, -1); /* make copy of module (call result) */ + lua_setfield(L, -3, modname); /* LOADED[modname] = module */ + } + lua_remove(L, -2); /* remove LOADED table */ + if (glb) { + lua_pushvalue(L, -1); /* copy of module */ + lua_setglobal(L, modname); /* _G[modname] = module */ + } +} + + +LUALIB_API void luaL_addgsub (luaL_Buffer *b, const char *s, + const char *p, const char *r) { + const char *wild; + size_t l = strlen(p); + 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 */ +} + + +LUALIB_API const char *luaL_gsub (lua_State *L, const char *s, + const char *p, const char *r) { + luaL_Buffer b; + luaL_buffinit(L, &b); + luaL_addgsub(&b, s, p, r); + 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) { + const char *msg = lua_tostring(L, -1); + if (msg == NULL) msg = "error object is not a string"; + lua_writestringerror("PANIC: unprotected error in call to Lua API (%s)\n", + msg); + return 0; /* return to Lua to abort */ +} + + +/* +** Warning functions: +** warnfoff: warning system is off +** warnfon: ready to start a new message +** warnfcont: previous message is to be continued +*/ +static void warnfoff (void *ud, const char *message, int tocont); +static void warnfon (void *ud, const char *message, int tocont); +static void warnfcont (void *ud, const char *message, int tocont); + + +/* +** Check whether message is a control message. If so, execute the +** control or ignore it if unknown. +*/ +static int checkcontrol (lua_State *L, const char *message, int tocont) { + if (tocont || *(message++) != '@') /* not a control message? */ + return 0; + else { + if (strcmp(message, "off") == 0) + lua_setwarnf(L, warnfoff, L); /* turn warnings off */ + else if (strcmp(message, "on") == 0) + lua_setwarnf(L, warnfon, L); /* turn warnings on */ + return 1; /* it was a control message */ + } +} + + +static void warnfoff (void *ud, const char *message, int tocont) { + checkcontrol((lua_State *)ud, message, tocont); +} + + +/* +** Writes the message and handle 'tocont', finishing the message +** if needed and setting the next warn function. +*/ +static void warnfcont (void *ud, const char *message, int tocont) { + lua_State *L = (lua_State *)ud; + lua_writestringerror("%s", message); /* write message */ + if (tocont) /* not the last part? */ + lua_setwarnf(L, warnfcont, L); /* to be continued */ + else { /* last part */ + lua_writestringerror("%s", "\n"); /* finish message with end-of-line */ + lua_setwarnf(L, warnfon, L); /* next call is a new message */ + } +} + + +static void warnfon (void *ud, const char *message, int tocont) { + if (checkcontrol((lua_State *)ud, message, tocont)) /* control message? */ + return; /* nothing else to be done */ + lua_writestringerror("%s", "Lua warning: "); /* start a new warning */ + warnfcont(ud, message, tocont); /* finish processing */ +} + + +LUALIB_API lua_State *luaL_newstate (void) { + lua_State *L = lua_newstate(l_alloc, NULL); + if (l_likely(L)) { + lua_atpanic(L, &panic); + lua_setwarnf(L, warnfoff, L); /* default is warnings off */ + } + return L; +} + + +LUALIB_API void luaL_checkversion_ (lua_State *L, lua_Number ver, size_t sz) { + lua_Number v = lua_version(L); + if (sz != LUAL_NUMSIZES) /* check numeric types */ + luaL_error(L, "core and library have incompatible numeric types"); + else if (v != ver) + luaL_error(L, "version mismatch: app. needs %f, Lua core provides %f", + (LUAI_UACNUMBER)ver, (LUAI_UACNUMBER)v); +} + diff --git a/lua-5.4.3/src/lauxlib.h b/lua-5.4.3/src/lauxlib.h new file mode 100644 index 0000000..72f70e7 --- /dev/null +++ b/lua-5.4.3/src/lauxlib.h @@ -0,0 +1,293 @@ +/* +** $Id: lauxlib.h $ +** Auxiliary functions for building Lua libraries +** See Copyright Notice in lua.h +*/ + + +#ifndef lauxlib_h +#define lauxlib_h + + +#include +#include + +#include "luaconf.h" +#include "lua.h" + + +/* global table */ +#define LUA_GNAME "_G" + + +typedef struct luaL_Buffer luaL_Buffer; + + +/* extra error code for 'luaL_loadfilex' */ +#define LUA_ERRFILE (LUA_ERRERR+1) + + +/* key, in the registry, for table of loaded modules */ +#define LUA_LOADED_TABLE "_LOADED" + + +/* key, in the registry, for table of preloaded loaders */ +#define LUA_PRELOAD_TABLE "_PRELOAD" + + +typedef struct luaL_Reg { + const char *name; + lua_CFunction func; +} luaL_Reg; + + +#define LUAL_NUMSIZES (sizeof(lua_Integer)*16 + sizeof(lua_Number)) + +LUALIB_API void (luaL_checkversion_) (lua_State *L, lua_Number ver, size_t sz); +#define luaL_checkversion(L) \ + luaL_checkversion_(L, LUA_VERSION_NUM, LUAL_NUMSIZES) + +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 arg, const char *extramsg); +LUALIB_API int (luaL_typeerror) (lua_State *L, int arg, const char *tname); +LUALIB_API const char *(luaL_checklstring) (lua_State *L, int arg, + size_t *l); +LUALIB_API const char *(luaL_optlstring) (lua_State *L, int arg, + const char *def, size_t *l); +LUALIB_API lua_Number (luaL_checknumber) (lua_State *L, int arg); +LUALIB_API lua_Number (luaL_optnumber) (lua_State *L, int arg, lua_Number def); + +LUALIB_API lua_Integer (luaL_checkinteger) (lua_State *L, int arg); +LUALIB_API lua_Integer (luaL_optinteger) (lua_State *L, int arg, + lua_Integer def); + +LUALIB_API void (luaL_checkstack) (lua_State *L, int sz, const char *msg); +LUALIB_API void (luaL_checktype) (lua_State *L, int arg, int t); +LUALIB_API void (luaL_checkany) (lua_State *L, int arg); + +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 arg, 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); + + +/* predefined 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 lua_Integer (luaL_len) (lua_State *L, int idx); + +LUALIB_API void luaL_addgsub (luaL_Buffer *b, const char *s, + const char *p, const char *r); +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_checkversion(L), luaL_newlibtable(L,l), luaL_setfuncs(L,l,0)) + +#define luaL_argcheck(L, cond,arg,extramsg) \ + ((void)(luai_likely(cond) || luaL_argerror(L, (arg), (extramsg)))) + +#define luaL_argexpected(L,cond,arg,tname) \ + ((void)(luai_likely(cond) || luaL_typeerror(L, (arg), (tname)))) + +#define luaL_checkstring(L,n) (luaL_checklstring(L, (n), NULL)) +#define luaL_optstring(L,n,d) (luaL_optlstring(L, (n), (d), NULL)) + +#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) + + +/* push the value used to represent failure/error */ +#define luaL_pushfail(L) lua_pushnil(L) + + +/* +** Internal assertions for in-house debugging +*/ +#if !defined(lua_assert) + +#if defined LUAI_ASSERT + #include + #define lua_assert(c) assert(c) +#else + #define lua_assert(c) ((void)0) +#endif + +#endif + + + +/* +** {====================================================== +** Generic Buffer manipulation +** ======================================================= +*/ + +struct luaL_Buffer { + char *b; /* buffer address */ + size_t size; /* buffer size */ + size_t n; /* number of characters in buffer */ + lua_State *L; + union { + LUAI_MAXALIGN; /* ensure maximum alignment for buffer */ + char b[LUAL_BUFFERSIZE]; /* initial buffer */ + } init; +}; + + +#define luaL_bufflen(bf) ((bf)->n) +#define luaL_buffaddr(bf) ((bf)->b) + + +#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)) + +#define luaL_buffsub(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; + +/* }====================================================== */ + +/* +** {================================================================== +** "Abstraction Layer" for basic report of messages and errors +** =================================================================== +*/ + +/* print a string */ +#if !defined(lua_writestring) +#define lua_writestring(s,l) fwrite((s), sizeof(char), (l), stdout) +#endif + +/* print a newline and flush the output */ +#if !defined(lua_writeline) +#define lua_writeline() (lua_writestring("\n", 1), fflush(stdout)) +#endif + +/* print an error message */ +#if !defined(lua_writestringerror) +#define lua_writestringerror(s,p) \ + (fprintf(stderr, (s), (p)), fflush(stderr)) +#endif + +/* }================================================================== */ + + +/* +** {============================================================ +** Compatibility with deprecated conversions +** ============================================================= +*/ +#if defined(LUA_COMPAT_APIINTCASTS) + +#define luaL_checkunsigned(L,a) ((lua_Unsigned)luaL_checkinteger(L,a)) +#define luaL_optunsigned(L,a,d) \ + ((lua_Unsigned)luaL_optinteger(L,a,(lua_Integer)(d))) + +#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))) + +#endif +/* }============================================================ */ + + + +#endif + + diff --git a/lua-5.4.3/src/lbaselib.c b/lua-5.4.3/src/lbaselib.c new file mode 100644 index 0000000..83ad306 --- /dev/null +++ b/lua-5.4.3/src/lbaselib.c @@ -0,0 +1,528 @@ +/* +** $Id: lbaselib.c $ +** Basic library +** See Copyright Notice in lua.h +*/ + +#define lbaselib_c +#define LUA_LIB + +#include "lprefix.h" + + +#include +#include +#include +#include + +#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; + for (i = 1; i <= n; i++) { /* for each argument */ + size_t l; + const char *s = luaL_tolstring(L, i, &l); /* convert it to string */ + if (i > 1) /* not the first element? */ + lua_writestring("\t", 1); /* add a tab before it */ + lua_writestring(s, l); /* print it */ + lua_pop(L, 1); /* pop result */ + } + lua_writeline(); + return 0; +} + + +/* +** Creates a warning with all given arguments. +** Check first for errors; otherwise an error may interrupt +** the composition of a warning, leaving it unfinished. +*/ +static int luaB_warn (lua_State *L) { + int n = lua_gettop(L); /* number of arguments */ + int i; + luaL_checkstring(L, 1); /* at least one argument */ + for (i = 2; i <= n; i++) + luaL_checkstring(L, i); /* make sure all arguments are strings */ + for (i = 1; i < n; i++) /* compose warning */ + lua_warning(L, lua_tostring(L, i), 1); + lua_warning(L, lua_tostring(L, n), 0); /* close warning */ + return 0; +} + + +#define SPACECHARS " \f\n\r\t\v" + +static const char *b_str2int (const char *s, int base, lua_Integer *pn) { + lua_Unsigned n = 0; + int neg = 0; + s += strspn(s, SPACECHARS); /* skip initial spaces */ + if (*s == '-') { s++; neg = 1; } /* handle sign */ + else if (*s == '+') s++; + if (!isalnum((unsigned char)*s)) /* no digit? */ + return NULL; + do { + int digit = (isdigit((unsigned char)*s)) ? *s - '0' + : (toupper((unsigned char)*s) - 'A') + 10; + if (digit >= base) return NULL; /* invalid numeral */ + n = n * base + digit; + s++; + } while (isalnum((unsigned char)*s)); + s += strspn(s, SPACECHARS); /* skip trailing spaces */ + *pn = (lua_Integer)((neg) ? (0u - n) : n); + return s; +} + + +static int luaB_tonumber (lua_State *L) { + if (lua_isnoneornil(L, 2)) { /* standard conversion? */ + if (lua_type(L, 1) == LUA_TNUMBER) { /* already a number? */ + lua_settop(L, 1); /* yes; return it */ + return 1; + } + else { + size_t l; + const char *s = lua_tolstring(L, 1, &l); + if (s != NULL && lua_stringtonumber(L, s) == l + 1) + return 1; /* successful conversion to number */ + /* else not a number */ + luaL_checkany(L, 1); /* (but there must be some parameter) */ + } + } + else { + size_t l; + const char *s; + lua_Integer n = 0; /* to avoid warnings */ + lua_Integer base = luaL_checkinteger(L, 2); + luaL_checktype(L, 1, LUA_TSTRING); /* no numbers as strings */ + s = lua_tolstring(L, 1, &l); + luaL_argcheck(L, 2 <= base && base <= 36, 2, "base out of range"); + if (b_str2int(s, (int)base, &n) == s + l) { + lua_pushinteger(L, n); + return 1; + } /* else not a number */ + } /* else not a number */ + luaL_pushfail(L); /* not a number */ + return 1; +} + + +static int luaB_error (lua_State *L) { + int level = (int)luaL_optinteger(L, 2, 1); + lua_settop(L, 1); + if (lua_type(L, 1) == LUA_TSTRING && level > 0) { + luaL_where(L, level); /* add extra information */ + 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_argexpected(L, t == LUA_TNIL || t == LUA_TTABLE, 2, "nil or table"); + if (l_unlikely(luaL_getmetafield(L, 1, "__metatable") != LUA_TNIL)) + 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_argexpected(L, t == LUA_TTABLE || t == LUA_TSTRING, 1, + "table or string"); + 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 pushmode (lua_State *L, int oldmode) { + lua_pushstring(L, (oldmode == LUA_GCINC) ? "incremental" + : "generational"); + return 1; +} + + +static int luaB_collectgarbage (lua_State *L) { + static const char *const opts[] = {"stop", "restart", "collect", + "count", "step", "setpause", "setstepmul", + "isrunning", "generational", "incremental", NULL}; + static const int optsnum[] = {LUA_GCSTOP, LUA_GCRESTART, LUA_GCCOLLECT, + LUA_GCCOUNT, LUA_GCSTEP, LUA_GCSETPAUSE, LUA_GCSETSTEPMUL, + LUA_GCISRUNNING, LUA_GCGEN, LUA_GCINC}; + int o = optsnum[luaL_checkoption(L, 1, "collect", opts)]; + switch (o) { + case LUA_GCCOUNT: { + int k = lua_gc(L, o); + int b = lua_gc(L, LUA_GCCOUNTB); + lua_pushnumber(L, (lua_Number)k + ((lua_Number)b/1024)); + return 1; + } + case LUA_GCSTEP: { + int step = (int)luaL_optinteger(L, 2, 0); + int res = lua_gc(L, o, step); + lua_pushboolean(L, res); + return 1; + } + case LUA_GCSETPAUSE: + case LUA_GCSETSTEPMUL: { + int p = (int)luaL_optinteger(L, 2, 0); + int previous = lua_gc(L, o, p); + lua_pushinteger(L, previous); + return 1; + } + case LUA_GCISRUNNING: { + int res = lua_gc(L, o); + lua_pushboolean(L, res); + return 1; + } + case LUA_GCGEN: { + int minormul = (int)luaL_optinteger(L, 2, 0); + int majormul = (int)luaL_optinteger(L, 3, 0); + return pushmode(L, lua_gc(L, o, minormul, majormul)); + } + case LUA_GCINC: { + int pause = (int)luaL_optinteger(L, 2, 0); + int stepmul = (int)luaL_optinteger(L, 3, 0); + int stepsize = (int)luaL_optinteger(L, 4, 0); + return pushmode(L, lua_gc(L, o, pause, stepmul, stepsize)); + } + default: { + int res = lua_gc(L, o); + lua_pushinteger(L, res); + return 1; + } + } +} + + +static int luaB_type (lua_State *L) { + int t = lua_type(L, 1); + luaL_argcheck(L, t != LUA_TNONE, 1, "value expected"); + lua_pushstring(L, lua_typename(L, t)); + return 1; +} + + +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) { + luaL_checkany(L, 1); + if (luaL_getmetafield(L, 1, "__pairs") == LUA_TNIL) { /* no metamethod? */ + lua_pushcfunction(L, luaB_next); /* will return generator, */ + lua_pushvalue(L, 1); /* state, */ + lua_pushnil(L); /* and initial value */ + } + else { + lua_pushvalue(L, 1); /* argument 'self' to metamethod */ + lua_call(L, 1, 3); /* get 3 values from metamethod */ + } + return 3; +} + + +/* +** Traversal function for 'ipairs' +*/ +static int ipairsaux (lua_State *L) { + lua_Integer i = luaL_checkinteger(L, 2) + 1; + lua_pushinteger(L, i); + return (lua_geti(L, 1, i) == LUA_TNIL) ? 1 : 2; +} + + +/* +** 'ipairs' function. Returns 'ipairsaux', given "table", 0. +** (The given "table" may not be a table.) +*/ +static int luaB_ipairs (lua_State *L) { + luaL_checkany(L, 1); + lua_pushcfunction(L, ipairsaux); /* iteration function */ + lua_pushvalue(L, 1); /* state */ + lua_pushinteger(L, 0); /* initial value */ + return 3; +} + + +static int load_aux (lua_State *L, int status, int envidx) { + if (l_likely(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) */ + luaL_pushfail(L); + lua_insert(L, -2); /* put before error message */ + return 2; /* return fail 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 (l_unlikely(!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, int d1, lua_KContext d2) { + (void)d1; (void)d2; /* only to match 'lua_Kfunction' prototype */ + 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 (l_unlikely(luaL_loadfile(L, fname) != LUA_OK)) + return lua_error(L); + lua_callk(L, 0, LUA_MULTRET, 0, dofilecont); + return dofilecont(L, 0, 0); +} + + +static int luaB_assert (lua_State *L) { + if (l_likely(lua_toboolean(L, 1))) /* condition is true? */ + return lua_gettop(L); /* return all arguments */ + else { /* error */ + luaL_checkany(L, 1); /* there must be a condition */ + lua_remove(L, 1); /* remove it */ + lua_pushliteral(L, "assertion failed!"); /* default message */ + lua_settop(L, 1); /* leave only message (default if no other one) */ + return luaB_error(L); /* call 'error' */ + } +} + + +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 { + lua_Integer i = luaL_checkinteger(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 - (int)i; + } +} + + +/* +** Continuation function for 'pcall' and 'xpcall'. Both functions +** already pushed a 'true' before doing the call, so in case of success +** 'finishpcall' only has to return everything in the stack minus +** 'extra' values (where 'extra' is exactly the number of items to be +** ignored). +*/ +static int finishpcall (lua_State *L, int status, lua_KContext extra) { + if (l_unlikely(status != LUA_OK && status != LUA_YIELD)) { /* error? */ + lua_pushboolean(L, 0); /* first result (false) */ + lua_pushvalue(L, -2); /* error message */ + return 2; /* return false, msg */ + } + else + return lua_gettop(L) - (int)extra; /* return all results */ +} + + +static int luaB_pcall (lua_State *L) { + int status; + luaL_checkany(L, 1); + lua_pushboolean(L, 1); /* first result if no errors */ + lua_insert(L, 1); /* put it in place */ + status = lua_pcallk(L, lua_gettop(L) - 2, LUA_MULTRET, 0, 0, finishpcall); + return finishpcall(L, status, 0); +} + + +/* +** Do a protected call with error handling. After 'lua_rotate', the +** stack will have ; so, the function passes +** 2 to 'finishpcall' to skip the 2 first values when returning results. +*/ +static int luaB_xpcall (lua_State *L) { + int status; + int n = lua_gettop(L); + luaL_checktype(L, 2, LUA_TFUNCTION); /* check error function */ + lua_pushboolean(L, 1); /* first result */ + lua_pushvalue(L, 1); /* function */ + lua_rotate(L, 3, 2); /* move them below function's arguments */ + status = lua_pcallk(L, n - 2, LUA_MULTRET, 2, 2, finishpcall); + return finishpcall(L, status, 2); +} + + +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}, + {"next", luaB_next}, + {"pairs", luaB_pairs}, + {"pcall", luaB_pcall}, + {"print", luaB_print}, + {"warn", luaB_warn}, + {"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}, + /* placeholders */ + {LUA_GNAME, NULL}, + {"_VERSION", NULL}, + {NULL, NULL} +}; + + +LUAMOD_API int luaopen_base (lua_State *L) { + /* open lib into global table */ + lua_pushglobaltable(L); + luaL_setfuncs(L, base_funcs, 0); + /* set global _G */ + lua_pushvalue(L, -1); + lua_setfield(L, -2, LUA_GNAME); + /* set global _VERSION */ + lua_pushliteral(L, LUA_VERSION); + lua_setfield(L, -2, "_VERSION"); + return 1; +} + diff --git a/lua-5.4.3/src/lcode.c b/lua-5.4.3/src/lcode.c new file mode 100644 index 0000000..80d975c --- /dev/null +++ b/lua-5.4.3/src/lcode.c @@ -0,0 +1,1814 @@ +/* +** $Id: lcode.c $ +** Code generator for Lua +** See Copyright Notice in lua.h +*/ + +#define lcode_c +#define LUA_CORE + +#include "lprefix.h" + + +#include +#include +#include + +#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" + + +/* Maximum number of registers in a Lua function (must fit in 8 bits) */ +#define MAXREGS 255 + + +#define hasjumps(e) ((e)->t != (e)->f) + + +static int codesJ (FuncState *fs, OpCode o, int sj, int k); + + + +/* semantic error */ +l_noret luaK_semerror (LexState *ls, const char *msg) { + ls->t.token = 0; /* remove "near " from final message */ + luaX_syntaxerror(ls, msg); +} + + +/* +** If expression is a numeric constant, fills 'v' with its value +** and returns 1. Otherwise, returns 0. +*/ +static int tonumeral (const expdesc *e, TValue *v) { + if (hasjumps(e)) + return 0; /* not a numeral */ + switch (e->k) { + case VKINT: + if (v) setivalue(v, e->u.ival); + return 1; + case VKFLT: + if (v) setfltvalue(v, e->u.nval); + return 1; + default: return 0; + } +} + + +/* +** Get the constant value from a constant expression +*/ +static TValue *const2val (FuncState *fs, const expdesc *e) { + lua_assert(e->k == VCONST); + return &fs->ls->dyd->actvar.arr[e->u.info].k; +} + + +/* +** If expression is a constant, fills 'v' with its value +** and returns 1. Otherwise, returns 0. +*/ +int luaK_exp2const (FuncState *fs, const expdesc *e, TValue *v) { + if (hasjumps(e)) + return 0; /* not a constant */ + switch (e->k) { + case VFALSE: + setbfvalue(v); + return 1; + case VTRUE: + setbtvalue(v); + return 1; + case VNIL: + setnilvalue(v); + return 1; + case VKSTR: { + setsvalue(fs->ls->L, v, e->u.strval); + return 1; + } + case VCONST: { + setobj(fs->ls->L, v, const2val(fs, e)); + return 1; + } + default: return tonumeral(e, v); + } +} + + +/* +** Return the previous instruction of the current code. If there +** may be a jump target between the current instruction and the +** previous one, return an invalid instruction (to avoid wrong +** optimizations). +*/ +static Instruction *previousinstruction (FuncState *fs) { + static const Instruction invalidinstruction = ~(Instruction)0; + if (fs->pc > fs->lasttarget) + return &fs->f->code[fs->pc - 1]; /* previous instruction */ + else + return cast(Instruction*, &invalidinstruction); +} + + +/* +** Create a OP_LOADNIL instruction, but try to optimize: if the previous +** instruction is also OP_LOADNIL and ranges are compatible, adjust +** range of previous instruction instead of emitting a new one. (For +** instance, 'local a; local b' will generate a single opcode.) +*/ +void luaK_nil (FuncState *fs, int from, int n) { + int l = from + n - 1; /* last register to set nil */ + Instruction *previous = previousinstruction(fs); + if (GET_OPCODE(*previous) == OP_LOADNIL) { /* previous is LOADNIL? */ + int pfrom = GETARG_A(*previous); /* get previous range */ + 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 */ +} + + +/* +** Gets the destination address of a jump instruction. Used to traverse +** a list of jumps. +*/ +static int getjump (FuncState *fs, int pc) { + int offset = GETARG_sJ(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 */ +} + + +/* +** Fix jump instruction at position 'pc' to jump to 'dest'. +** (Jump addresses are relative in Lua) +*/ +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 (!(-OFFSET_sJ <= offset && offset <= MAXARG_sJ - OFFSET_sJ)) + luaX_syntaxerror(fs->ls, "control structure too long"); + lua_assert(GET_OPCODE(*jmp) == OP_JMP); + SETARG_sJ(*jmp, offset); +} + + +/* +** Concatenate jump-list 'l2' into jump-list 'l1' +*/ +void luaK_concat (FuncState *fs, int *l1, int l2) { + if (l2 == NO_JUMP) return; /* nothing to concatenate? */ + else if (*l1 == NO_JUMP) /* no original list? */ + *l1 = l2; /* 'l1' points to 'l2' */ + else { + int list = *l1; + int next; + while ((next = getjump(fs, list)) != NO_JUMP) /* find last element */ + list = next; + fixjump(fs, list, l2); /* last element links to 'l2' */ + } +} + + +/* +** Create a jump instruction and return its position, so its destination +** can be fixed later (with 'fixjump'). +*/ +int luaK_jump (FuncState *fs) { + return codesJ(fs, OP_JMP, NO_JUMP, 0); +} + + +/* +** Code a 'return' instruction +*/ +void luaK_ret (FuncState *fs, int first, int nret) { + OpCode op; + switch (nret) { + case 0: op = OP_RETURN0; break; + case 1: op = OP_RETURN1; break; + default: op = OP_RETURN; break; + } + luaK_codeABC(fs, op, first, nret + 1, 0); +} + + +/* +** Code a "conditional jump", that is, a test or comparison opcode +** followed by a jump. Return jump position. +*/ +static int condjump (FuncState *fs, OpCode op, int A, int B, int C, int k) { + luaK_codeABCk(fs, op, A, B, C, k); + return luaK_jump(fs); +} + + +/* +** 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; +} + + +/* +** Returns the position of the instruction "controlling" a given +** jump (that is, its condition), or the jump itself if it is +** unconditional. +*/ +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; +} + + +/* +** Patch destination register for a TESTSET instruction. +** If instruction in position 'node' is not a TESTSET, return 0 ("fails"). +** Otherwise, if 'reg' is not 'NO_REG', set it as the destination +** register. Otherwise, change instruction to a simple 'TEST' (produces +** no register value) +*/ +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; + change instruction to simple test */ + *i = CREATE_ABCk(OP_TEST, GETARG_B(*i), 0, 0, GETARG_k(*i)); + } + return 1; +} + + +/* +** Traverse a list of tests ensuring no one produces a value +*/ +static void removevalues (FuncState *fs, int list) { + for (; list != NO_JUMP; list = getjump(fs, list)) + patchtestreg(fs, list, NO_REG); +} + + +/* +** Traverse a list of tests, patching their destination address and +** registers: tests producing values jump to 'vtarget' (and put their +** values in 'reg'), other tests jump to 'dtarget'. +*/ +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; + } +} + + +/* +** Path all jumps in 'list' to jump to 'target'. +** (The assert means that we cannot fix a jump to a forward address +** because we only know addresses once code is generated.) +*/ +void luaK_patchlist (FuncState *fs, int list, int target) { + lua_assert(target <= fs->pc); + patchlistaux(fs, list, target, NO_REG, target); +} + + +void luaK_patchtohere (FuncState *fs, int list) { + int hr = luaK_getlabel(fs); /* mark "here" as a jump target */ + luaK_patchlist(fs, list, hr); +} + + +/* limit for difference between lines in relative line info. */ +#define LIMLINEDIFF 0x80 + + +/* +** Save line info for a new instruction. If difference from last line +** does not fit in a byte, of after that many instructions, save a new +** absolute line info; (in that case, the special value 'ABSLINEINFO' +** in 'lineinfo' signals the existence of this absolute information.) +** Otherwise, store the difference from last line in 'lineinfo'. +*/ +static void savelineinfo (FuncState *fs, Proto *f, int line) { + int linedif = line - fs->previousline; + int pc = fs->pc - 1; /* last instruction coded */ + if (abs(linedif) >= LIMLINEDIFF || fs->iwthabs++ >= MAXIWTHABS) { + luaM_growvector(fs->ls->L, f->abslineinfo, fs->nabslineinfo, + f->sizeabslineinfo, AbsLineInfo, MAX_INT, "lines"); + f->abslineinfo[fs->nabslineinfo].pc = pc; + f->abslineinfo[fs->nabslineinfo++].line = line; + linedif = ABSLINEINFO; /* signal that there is absolute information */ + fs->iwthabs = 1; /* restart counter */ + } + luaM_growvector(fs->ls->L, f->lineinfo, pc, f->sizelineinfo, ls_byte, + MAX_INT, "opcodes"); + f->lineinfo[pc] = linedif; + fs->previousline = line; /* last line saved */ +} + + +/* +** Remove line information from the last instruction. +** If line information for that instruction is absolute, set 'iwthabs' +** above its max to force the new (replacing) instruction to have +** absolute line info, too. +*/ +static void removelastlineinfo (FuncState *fs) { + Proto *f = fs->f; + int pc = fs->pc - 1; /* last instruction coded */ + if (f->lineinfo[pc] != ABSLINEINFO) { /* relative line info? */ + fs->previousline -= f->lineinfo[pc]; /* correct last line saved */ + fs->iwthabs--; /* undo previous increment */ + } + else { /* absolute line information */ + lua_assert(f->abslineinfo[fs->nabslineinfo - 1].pc == pc); + fs->nabslineinfo--; /* remove it */ + fs->iwthabs = MAXIWTHABS + 1; /* force next line info to be absolute */ + } +} + + +/* +** Remove the last instruction created, correcting line information +** accordingly. +*/ +static void removelastinstruction (FuncState *fs) { + removelastlineinfo(fs); + fs->pc--; +} + + +/* +** Emit instruction 'i', checking for array sizes and saving also its +** line information. Return 'i' position. +*/ +int luaK_code (FuncState *fs, Instruction i) { + Proto *f = fs->f; + /* 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; + savelineinfo(fs, f, fs->ls->lastline); + return fs->pc - 1; /* index of new instruction */ +} + + +/* +** Format and emit an 'iABC' instruction. (Assertions check consistency +** of parameters versus opcode.) +*/ +int luaK_codeABCk (FuncState *fs, OpCode o, int a, int b, int c, int k) { + lua_assert(getOpMode(o) == iABC); + lua_assert(a <= MAXARG_A && b <= MAXARG_B && + c <= MAXARG_C && (k & ~1) == 0); + return luaK_code(fs, CREATE_ABCk(o, a, b, c, k)); +} + + +/* +** Format and emit an 'iABx' instruction. +*/ +int luaK_codeABx (FuncState *fs, OpCode o, int a, unsigned int bc) { + lua_assert(getOpMode(o) == iABx); + lua_assert(a <= MAXARG_A && bc <= MAXARG_Bx); + return luaK_code(fs, CREATE_ABx(o, a, bc)); +} + + +/* +** Format and emit an 'iAsBx' instruction. +*/ +int luaK_codeAsBx (FuncState *fs, OpCode o, int a, int bc) { + unsigned int b = bc + OFFSET_sBx; + lua_assert(getOpMode(o) == iAsBx); + lua_assert(a <= MAXARG_A && b <= MAXARG_Bx); + return luaK_code(fs, CREATE_ABx(o, a, b)); +} + + +/* +** Format and emit an 'isJ' instruction. +*/ +static int codesJ (FuncState *fs, OpCode o, int sj, int k) { + unsigned int j = sj + OFFSET_sJ; + lua_assert(getOpMode(o) == isJ); + lua_assert(j <= MAXARG_sJ && (k & ~1) == 0); + return luaK_code(fs, CREATE_sJ(o, j, k)); +} + + +/* +** Emit an "extra argument" instruction (format 'iAx') +*/ +static int codeextraarg (FuncState *fs, int a) { + lua_assert(a <= MAXARG_Ax); + return luaK_code(fs, CREATE_Ax(OP_EXTRAARG, a)); +} + + +/* +** Emit a "load constant" instruction, using either 'OP_LOADK' +** (if constant index 'k' fits in 18 bits) or an 'OP_LOADKX' +** instruction with "extra argument". +*/ +static 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; + } +} + + +/* +** Check register-stack level, keeping track of its maximum size +** in field 'maxstacksize' +*/ +void luaK_checkstack (FuncState *fs, int n) { + int newstack = fs->freereg + n; + if (newstack > fs->f->maxstacksize) { + if (newstack >= MAXREGS) + luaX_syntaxerror(fs->ls, + "function or expression needs too many registers"); + fs->f->maxstacksize = cast_byte(newstack); + } +} + + +/* +** Reserve 'n' registers in register stack +*/ +void luaK_reserveregs (FuncState *fs, int n) { + luaK_checkstack(fs, n); + fs->freereg += n; +} + + +/* +** Free register 'reg', if it is neither a constant index nor +** a local variable. +) +*/ +static void freereg (FuncState *fs, int reg) { + if (reg >= luaY_nvarstack(fs)) { + fs->freereg--; + lua_assert(reg == fs->freereg); + } +} + + +/* +** Free two registers in proper order +*/ +static void freeregs (FuncState *fs, int r1, int r2) { + if (r1 > r2) { + freereg(fs, r1); + freereg(fs, r2); + } + else { + freereg(fs, r2); + freereg(fs, r1); + } +} + + +/* +** Free register used by expression 'e' (if any) +*/ +static void freeexp (FuncState *fs, expdesc *e) { + if (e->k == VNONRELOC) + freereg(fs, e->u.info); +} + + +/* +** Free registers used by expressions 'e1' and 'e2' (if any) in proper +** order. +*/ +static void freeexps (FuncState *fs, expdesc *e1, expdesc *e2) { + int r1 = (e1->k == VNONRELOC) ? e1->u.info : -1; + int r2 = (e2->k == VNONRELOC) ? e2->u.info : -1; + freeregs(fs, r1, r2); +} + + +/* +** Add constant 'v' to prototype's list of constants (field 'k'). +** Use scanner's table to cache position of constants in constant list +** and try to reuse constants. Because some values should not be used +** as keys (nil cannot be a key, integer keys can collapse with float +** keys), the caller must provide a useful 'key' for indexing the cache. +** Note that all functions share the same table, so entering or exiting +** a function can make some indices wrong. +*/ +static int addk (FuncState *fs, TValue *key, TValue *v) { + TValue val; + lua_State *L = fs->ls->L; + Proto *f = fs->f; + const TValue *idx = luaH_get(fs->ls->h, key); /* query scanner table */ + int k, oldsize; + if (ttisinteger(idx)) { /* is there an index there? */ + k = cast_int(ivalue(idx)); + /* correct value? (warning: must distinguish floats from integers!) */ + if (k < fs->nk && ttypetag(&f->k[k]) == ttypetag(v) && + luaV_rawequalobj(&f->k[k], v)) + return k; /* reuse index */ + } + /* 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 */ + setivalue(&val, k); + luaH_finishset(L, fs->ls->h, key, idx, &val); + 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; +} + + +/* +** Add a string to list of constants and return its index. +*/ +static int stringK (FuncState *fs, TString *s) { + TValue o; + setsvalue(fs->ls->L, &o, s); + return addk(fs, &o, &o); /* use string itself as key */ +} + + +/* +** Add an integer to list of constants and return its index. +** Integers use userdata as keys to avoid collision with floats with +** same value; conversion to 'void*' is used only for hashing, so there +** are no "precision" problems. +*/ +static int luaK_intK (FuncState *fs, lua_Integer n) { + TValue k, o; + setpvalue(&k, cast_voidp(cast_sizet(n))); + setivalue(&o, n); + return addk(fs, &k, &o); +} + +/* +** Add a float to list of constants and return its index. +*/ +static int luaK_numberK (FuncState *fs, lua_Number r) { + TValue o; + setfltvalue(&o, r); + return addk(fs, &o, &o); /* use number itself as key */ +} + + +/* +** Add a false to list of constants and return its index. +*/ +static int boolF (FuncState *fs) { + TValue o; + setbfvalue(&o); + return addk(fs, &o, &o); /* use boolean itself as key */ +} + + +/* +** Add a true to list of constants and return its index. +*/ +static int boolT (FuncState *fs) { + TValue o; + setbtvalue(&o); + return addk(fs, &o, &o); /* use boolean itself as key */ +} + + +/* +** Add nil to list of constants and return its index. +*/ +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->ls->h); + return addk(fs, &k, &v); +} + + +/* +** Check whether 'i' can be stored in an 'sC' operand. Equivalent to +** (0 <= int2sC(i) && int2sC(i) <= MAXARG_C) but without risk of +** overflows in the hidden addition inside 'int2sC'. +*/ +static int fitsC (lua_Integer i) { + return (l_castS2U(i) + OFFSET_sC <= cast_uint(MAXARG_C)); +} + + +/* +** Check whether 'i' can be stored in an 'sBx' operand. +*/ +static int fitsBx (lua_Integer i) { + return (-OFFSET_sBx <= i && i <= MAXARG_Bx - OFFSET_sBx); +} + + +void luaK_int (FuncState *fs, int reg, lua_Integer i) { + if (fitsBx(i)) + luaK_codeAsBx(fs, OP_LOADI, reg, cast_int(i)); + else + luaK_codek(fs, reg, luaK_intK(fs, i)); +} + + +static void luaK_float (FuncState *fs, int reg, lua_Number f) { + lua_Integer fi; + if (luaV_flttointeger(f, &fi, F2Ieq) && fitsBx(fi)) + luaK_codeAsBx(fs, OP_LOADF, reg, cast_int(fi)); + else + luaK_codek(fs, reg, luaK_numberK(fs, f)); +} + + +/* +** Convert a constant in 'v' into an expression description 'e' +*/ +static void const2exp (TValue *v, expdesc *e) { + switch (ttypetag(v)) { + case LUA_VNUMINT: + e->k = VKINT; e->u.ival = ivalue(v); + break; + case LUA_VNUMFLT: + e->k = VKFLT; e->u.nval = fltvalue(v); + break; + case LUA_VFALSE: + e->k = VFALSE; + break; + case LUA_VTRUE: + e->k = VTRUE; + break; + case LUA_VNIL: + e->k = VNIL; + break; + case LUA_VSHRSTR: case LUA_VLNGSTR: + e->k = VKSTR; e->u.strval = tsvalue(v); + break; + default: lua_assert(0); + } +} + + +/* +** Fix an expression to return the number of results 'nresults'. +** 'e' must be a multi-ret expression (function call or vararg). +*/ +void luaK_setreturns (FuncState *fs, expdesc *e, int nresults) { + Instruction *pc = &getinstruction(fs, e); + if (e->k == VCALL) /* expression is an open function call? */ + SETARG_C(*pc, nresults + 1); + else { + lua_assert(e->k == VVARARG); + SETARG_C(*pc, nresults + 1); + SETARG_A(*pc, fs->freereg); + luaK_reserveregs(fs, 1); + } +} + + +/* +** Convert a VKSTR to a VK +*/ +static void str2K (FuncState *fs, expdesc *e) { + lua_assert(e->k == VKSTR); + e->u.info = stringK(fs, e->u.strval); + e->k = VK; +} + + +/* +** Fix an expression to return one result. +** If expression is not a multi-ret expression (function call or +** vararg), it already returns one result, so nothing needs to be done. +** Function calls become VNONRELOC expressions (as its result comes +** fixed in the base register of the call), while vararg expressions +** become VRELOC (as OP_VARARG puts its results where it wants). +** (Calls are created returning one result, so that does not need +** to be fixed.) +*/ +void luaK_setoneret (FuncState *fs, expdesc *e) { + if (e->k == VCALL) { /* expression is an open function call? */ + /* already returns 1 value */ + lua_assert(GETARG_C(getinstruction(fs, e)) == 2); + e->k = VNONRELOC; /* result has fixed position */ + e->u.info = GETARG_A(getinstruction(fs, e)); + } + else if (e->k == VVARARG) { + SETARG_C(getinstruction(fs, e), 2); + e->k = VRELOC; /* can relocate its simple result */ + } +} + + +/* +** Ensure that expression 'e' is not a variable (nor a ). +** (Expression still may have jump lists.) +*/ +void luaK_dischargevars (FuncState *fs, expdesc *e) { + switch (e->k) { + case VCONST: { + const2exp(const2val(fs, e), e); + break; + } + case VLOCAL: { /* already in a register */ + e->u.info = e->u.var.ridx; + e->k = VNONRELOC; /* becomes a non-relocatable value */ + break; + } + case VUPVAL: { /* move value to some (pending) register */ + e->u.info = luaK_codeABC(fs, OP_GETUPVAL, 0, e->u.info, 0); + e->k = VRELOC; + break; + } + case VINDEXUP: { + e->u.info = luaK_codeABC(fs, OP_GETTABUP, 0, e->u.ind.t, e->u.ind.idx); + e->k = VRELOC; + break; + } + case VINDEXI: { + freereg(fs, e->u.ind.t); + e->u.info = luaK_codeABC(fs, OP_GETI, 0, e->u.ind.t, e->u.ind.idx); + e->k = VRELOC; + break; + } + case VINDEXSTR: { + freereg(fs, e->u.ind.t); + e->u.info = luaK_codeABC(fs, OP_GETFIELD, 0, e->u.ind.t, e->u.ind.idx); + e->k = VRELOC; + break; + } + case VINDEXED: { + freeregs(fs, e->u.ind.t, e->u.ind.idx); + e->u.info = luaK_codeABC(fs, OP_GETTABLE, 0, e->u.ind.t, e->u.ind.idx); + e->k = VRELOC; + break; + } + case VVARARG: case VCALL: { + luaK_setoneret(fs, e); + break; + } + default: break; /* there is one value available (somewhere) */ + } +} + + +/* +** Ensure expression value is in register 'reg', making 'e' a +** non-relocatable expression. +** (Expression still may have jump lists.) +*/ +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: { + luaK_codeABC(fs, OP_LOADFALSE, reg, 0, 0); + break; + } + case VTRUE: { + luaK_codeABC(fs, OP_LOADTRUE, reg, 0, 0); + break; + } + case VKSTR: { + str2K(fs, e); + } /* FALLTHROUGH */ + case VK: { + luaK_codek(fs, reg, e->u.info); + break; + } + case VKFLT: { + luaK_float(fs, reg, e->u.nval); + break; + } + case VKINT: { + luaK_int(fs, reg, e->u.ival); + break; + } + case VRELOC: { + Instruction *pc = &getinstruction(fs, e); + SETARG_A(*pc, reg); /* instruction will put result in '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 == VJMP); + return; /* nothing to do... */ + } + } + e->u.info = reg; + e->k = VNONRELOC; +} + + +/* +** Ensure expression value is in a register, making 'e' a +** non-relocatable expression. +** (Expression still may have jump lists.) +*/ +static void discharge2anyreg (FuncState *fs, expdesc *e) { + if (e->k != VNONRELOC) { /* no fixed register yet? */ + luaK_reserveregs(fs, 1); /* get a register */ + discharge2reg(fs, e, fs->freereg-1); /* put value there */ + } +} + + +static int code_loadbool (FuncState *fs, int A, OpCode op) { + luaK_getlabel(fs); /* those instructions may be jump targets */ + return luaK_codeABC(fs, op, A, 0, 0); +} + + +/* +** 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 */ +} + + +/* +** Ensures final expression result (which includes results from its +** jump lists) is in register 'reg'. +** If expression has jumps, need to patch these jumps either to +** its final position or to "load" instructions (for those tests +** that do not produce values). +*/ +static void exp2reg (FuncState *fs, expdesc *e, int reg) { + discharge2reg(fs, e, reg); + if (e->k == VJMP) /* expression itself is a test? */ + 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_loadbool(fs, reg, OP_LFALSESKIP); /* skip next inst. */ + p_t = code_loadbool(fs, reg, OP_LOADTRUE); + /* jump around these booleans if 'e' is not a test */ + 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; +} + + +/* +** Ensures final expression result is in next available register. +*/ +void luaK_exp2nextreg (FuncState *fs, expdesc *e) { + luaK_dischargevars(fs, e); + freeexp(fs, e); + luaK_reserveregs(fs, 1); + exp2reg(fs, e, fs->freereg - 1); +} + + +/* +** Ensures final expression result is in some (any) register +** and return that register. +*/ +int luaK_exp2anyreg (FuncState *fs, expdesc *e) { + luaK_dischargevars(fs, e); + if (e->k == VNONRELOC) { /* expression already has a register? */ + if (!hasjumps(e)) /* no jumps? */ + return e->u.info; /* result is already in a register */ + if (e->u.info >= luaY_nvarstack(fs)) { /* reg. is not a local? */ + exp2reg(fs, e, e->u.info); /* put final result in it */ + return e->u.info; + } + /* else expression has jumps and cannot change its register + to hold the jump values, because it is a local variable. + Go through to the default case. */ + } + luaK_exp2nextreg(fs, e); /* default: use next available register */ + return e->u.info; +} + + +/* +** Ensures final expression result is either in a register +** or in an upvalue. +*/ +void luaK_exp2anyregup (FuncState *fs, expdesc *e) { + if (e->k != VUPVAL || hasjumps(e)) + luaK_exp2anyreg(fs, e); +} + + +/* +** Ensures final expression result is either in a register +** or it is a constant. +*/ +void luaK_exp2val (FuncState *fs, expdesc *e) { + if (hasjumps(e)) + luaK_exp2anyreg(fs, e); + else + luaK_dischargevars(fs, e); +} + + +/* +** Try to make 'e' a K expression with an index in the range of R/K +** indices. Return true iff succeeded. +*/ +static int luaK_exp2K (FuncState *fs, expdesc *e) { + if (!hasjumps(e)) { + int info; + switch (e->k) { /* move constants to 'k' */ + case VTRUE: info = boolT(fs); break; + case VFALSE: info = boolF(fs); break; + case VNIL: info = nilK(fs); break; + case VKINT: info = luaK_intK(fs, e->u.ival); break; + case VKFLT: info = luaK_numberK(fs, e->u.nval); break; + case VKSTR: info = stringK(fs, e->u.strval); break; + case VK: info = e->u.info; break; + default: return 0; /* not a constant */ + } + if (info <= MAXINDEXRK) { /* does constant fit in 'argC'? */ + e->k = VK; /* make expression a 'K' expression */ + e->u.info = info; + return 1; + } + } + /* else, expression doesn't fit; leave it unchanged */ + return 0; +} + + +/* +** Ensures final expression result is in a valid R/K index +** (that is, it is either in a register or in 'k' with an index +** in the range of R/K indices). +** Returns 1 iff expression is K. +*/ +int luaK_exp2RK (FuncState *fs, expdesc *e) { + if (luaK_exp2K(fs, e)) + return 1; + else { /* not a constant in the right range: put it in a register */ + luaK_exp2anyreg(fs, e); + return 0; + } +} + + +static void codeABRK (FuncState *fs, OpCode o, int a, int b, + expdesc *ec) { + int k = luaK_exp2RK(fs, ec); + luaK_codeABCk(fs, o, a, b, ec->u.info, k); +} + + +/* +** Generate code to store result of expression 'ex' into variable 'var'. +*/ +void luaK_storevar (FuncState *fs, expdesc *var, expdesc *ex) { + switch (var->k) { + case VLOCAL: { + freeexp(fs, ex); + exp2reg(fs, ex, var->u.var.ridx); /* compute 'ex' into proper place */ + return; + } + case VUPVAL: { + int e = luaK_exp2anyreg(fs, ex); + luaK_codeABC(fs, OP_SETUPVAL, e, var->u.info, 0); + break; + } + case VINDEXUP: { + codeABRK(fs, OP_SETTABUP, var->u.ind.t, var->u.ind.idx, ex); + break; + } + case VINDEXI: { + codeABRK(fs, OP_SETI, var->u.ind.t, var->u.ind.idx, ex); + break; + } + case VINDEXSTR: { + codeABRK(fs, OP_SETFIELD, var->u.ind.t, var->u.ind.idx, ex); + break; + } + case VINDEXED: { + codeABRK(fs, OP_SETTABLE, var->u.ind.t, var->u.ind.idx, ex); + break; + } + default: lua_assert(0); /* invalid var kind to store */ + } + freeexp(fs, ex); +} + + +/* +** Emit SELF instruction (convert expression 'e' into 'e:key(e,'). +*/ +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; /* self expression has a fixed register */ + luaK_reserveregs(fs, 2); /* function and 'self' produced by op_self */ + codeABRK(fs, OP_SELF, e->u.info, ereg, key); + freeexp(fs, key); +} + + +/* +** Negate condition 'e' (where 'e' is a comparison). +*/ +static void negatecondition (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_k(*pc, (GETARG_k(*pc) ^ 1)); +} + + +/* +** Emit instruction to jump if 'e' is 'cond' (that is, if 'cond' +** is true, code will jump if 'e' is true.) Return jump position. +** Optimize when 'e' is 'not' something, inverting the condition +** and removing the 'not'. +*/ +static int jumponcond (FuncState *fs, expdesc *e, int cond) { + if (e->k == VRELOC) { + Instruction ie = getinstruction(fs, e); + if (GET_OPCODE(ie) == OP_NOT) { + removelastinstruction(fs); /* remove previous OP_NOT */ + return condjump(fs, OP_TEST, GETARG_B(ie), 0, 0, !cond); + } + /* else go through */ + } + discharge2anyreg(fs, e); + freeexp(fs, e); + return condjump(fs, OP_TESTSET, NO_REG, e->u.info, 0, cond); +} + + +/* +** Emit code to go through if 'e' is true, jump otherwise. +*/ +void luaK_goiftrue (FuncState *fs, expdesc *e) { + int pc; /* pc of new jump */ + luaK_dischargevars(fs, e); + switch (e->k) { + case VJMP: { /* condition? */ + negatecondition(fs, e); /* jump when it is false */ + pc = e->u.info; /* save jump position */ + break; + } + case VK: case VKFLT: case VKINT: case VKSTR: case VTRUE: { + pc = NO_JUMP; /* always true; do nothing */ + break; + } + default: { + pc = jumponcond(fs, e, 0); /* jump when false */ + break; + } + } + luaK_concat(fs, &e->f, pc); /* insert new jump in false list */ + luaK_patchtohere(fs, e->t); /* true list jumps to here (to go through) */ + e->t = NO_JUMP; +} + + +/* +** Emit code to go through if 'e' is false, jump otherwise. +*/ +void luaK_goiffalse (FuncState *fs, expdesc *e) { + int pc; /* pc of new jump */ + luaK_dischargevars(fs, e); + switch (e->k) { + case VJMP: { + pc = e->u.info; /* already jump if true */ + break; + } + case VNIL: case VFALSE: { + pc = NO_JUMP; /* always false; do nothing */ + break; + } + default: { + pc = jumponcond(fs, e, 1); /* jump if true */ + break; + } + } + luaK_concat(fs, &e->t, pc); /* insert new jump in 't' list */ + luaK_patchtohere(fs, e->f); /* false list jumps to here (to go through) */ + e->f = NO_JUMP; +} + + +/* +** Code 'not e', doing constant folding. +*/ +static void codenot (FuncState *fs, expdesc *e) { + switch (e->k) { + case VNIL: case VFALSE: { + e->k = VTRUE; /* true == not nil == not false */ + break; + } + case VK: case VKFLT: case VKINT: case VKSTR: case VTRUE: { + e->k = VFALSE; /* false == not "x" == not 0.5 == not 1 == not true */ + break; + } + case VJMP: { + negatecondition(fs, e); + break; + } + case VRELOC: + case VNONRELOC: { + discharge2anyreg(fs, e); + freeexp(fs, e); + e->u.info = luaK_codeABC(fs, OP_NOT, 0, e->u.info, 0); + e->k = VRELOC; + break; + } + default: lua_assert(0); /* cannot happen */ + } + /* interchange true and false lists */ + { int temp = e->f; e->f = e->t; e->t = temp; } + removevalues(fs, e->f); /* values are useless when negated */ + removevalues(fs, e->t); +} + + +/* +** Check whether expression 'e' is a small literal string +*/ +static int isKstr (FuncState *fs, expdesc *e) { + return (e->k == VK && !hasjumps(e) && e->u.info <= MAXARG_B && + ttisshrstring(&fs->f->k[e->u.info])); +} + +/* +** Check whether expression 'e' is a literal integer. +*/ +int luaK_isKint (expdesc *e) { + return (e->k == VKINT && !hasjumps(e)); +} + + +/* +** Check whether expression 'e' is a literal integer in +** proper range to fit in register C +*/ +static int isCint (expdesc *e) { + return luaK_isKint(e) && (l_castS2U(e->u.ival) <= l_castS2U(MAXARG_C)); +} + + +/* +** Check whether expression 'e' is a literal integer in +** proper range to fit in register sC +*/ +static int isSCint (expdesc *e) { + return luaK_isKint(e) && fitsC(e->u.ival); +} + + +/* +** Check whether expression 'e' is a literal integer or float in +** proper range to fit in a register (sB or sC). +*/ +static int isSCnumber (expdesc *e, int *pi, int *isfloat) { + lua_Integer i; + if (e->k == VKINT) + i = e->u.ival; + else if (e->k == VKFLT && luaV_flttointeger(e->u.nval, &i, F2Ieq)) + *isfloat = 1; + else + return 0; /* not a number */ + if (!hasjumps(e) && fitsC(i)) { + *pi = int2sC(cast_int(i)); + return 1; + } + else + return 0; +} + + +/* +** Create expression 't[k]'. 't' must have its final result already in a +** register or upvalue. Upvalues can only be indexed by literal strings. +** Keys can be literal strings in the constant table or arbitrary +** values in registers. +*/ +void luaK_indexed (FuncState *fs, expdesc *t, expdesc *k) { + if (k->k == VKSTR) + str2K(fs, k); + lua_assert(!hasjumps(t) && + (t->k == VLOCAL || t->k == VNONRELOC || t->k == VUPVAL)); + if (t->k == VUPVAL && !isKstr(fs, k)) /* upvalue indexed by non 'Kstr'? */ + luaK_exp2anyreg(fs, t); /* put it in a register */ + if (t->k == VUPVAL) { + t->u.ind.t = t->u.info; /* upvalue index */ + t->u.ind.idx = k->u.info; /* literal string */ + t->k = VINDEXUP; + } + else { + /* register index of the table */ + t->u.ind.t = (t->k == VLOCAL) ? t->u.var.ridx: t->u.info; + if (isKstr(fs, k)) { + t->u.ind.idx = k->u.info; /* literal string */ + t->k = VINDEXSTR; + } + else if (isCint(k)) { + t->u.ind.idx = cast_int(k->u.ival); /* int. constant in proper range */ + t->k = VINDEXI; + } + else { + t->u.ind.idx = luaK_exp2anyreg(fs, k); /* register */ + t->k = VINDEXED; + } + } +} + + +/* +** Return false if folding can raise an error. +** Bitwise operations need operands convertible to integers; division +** operations cannot have 0 as divisor. +*/ +static int validop (int op, TValue *v1, TValue *v2) { + switch (op) { + case LUA_OPBAND: case LUA_OPBOR: case LUA_OPBXOR: + case LUA_OPSHL: case LUA_OPSHR: case LUA_OPBNOT: { /* conversion errors */ + lua_Integer i; + return (luaV_tointegerns(v1, &i, LUA_FLOORN2I) && + luaV_tointegerns(v2, &i, LUA_FLOORN2I)); + } + case LUA_OPDIV: case LUA_OPIDIV: case LUA_OPMOD: /* division by 0 */ + return (nvalue(v2) != 0); + default: return 1; /* everything else is valid */ + } +} + + +/* +** Try to "constant-fold" an operation; return 1 iff successful. +** (In this case, 'e1' has the final result.) +*/ +static int constfolding (FuncState *fs, int op, expdesc *e1, + const expdesc *e2) { + TValue v1, v2, res; + if (!tonumeral(e1, &v1) || !tonumeral(e2, &v2) || !validop(op, &v1, &v2)) + return 0; /* non-numeric operands or not safe to fold */ + luaO_rawarith(fs->ls->L, op, &v1, &v2, &res); /* does operation */ + if (ttisinteger(&res)) { + e1->k = VKINT; + e1->u.ival = ivalue(&res); + } + else { /* folds neither NaN nor 0.0 (to avoid problems with -0.0) */ + lua_Number n = fltvalue(&res); + if (luai_numisnan(n) || n == 0) + return 0; + e1->k = VKFLT; + e1->u.nval = n; + } + return 1; +} + + +/* +** Emit code for unary expressions that "produce values" +** (everything but 'not'). +** Expression to produce final result will be encoded in 'e'. +*/ +static void codeunexpval (FuncState *fs, OpCode op, expdesc *e, int line) { + int r = luaK_exp2anyreg(fs, e); /* opcodes operate only on registers */ + freeexp(fs, e); + e->u.info = luaK_codeABC(fs, op, 0, r, 0); /* generate opcode */ + e->k = VRELOC; /* all those operations are relocatable */ + luaK_fixline(fs, line); +} + + +/* +** Emit code for binary expressions that "produce values" +** (everything but logical operators 'and'/'or' and comparison +** operators). +** Expression to produce final result will be encoded in 'e1'. +*/ +static void finishbinexpval (FuncState *fs, expdesc *e1, expdesc *e2, + OpCode op, int v2, int flip, int line, + OpCode mmop, TMS event) { + int v1 = luaK_exp2anyreg(fs, e1); + int pc = luaK_codeABCk(fs, op, 0, v1, v2, 0); + freeexps(fs, e1, e2); + e1->u.info = pc; + e1->k = VRELOC; /* all those operations are relocatable */ + luaK_fixline(fs, line); + luaK_codeABCk(fs, mmop, v1, v2, event, flip); /* to call metamethod */ + luaK_fixline(fs, line); +} + + +/* +** Emit code for binary expressions that "produce values" over +** two registers. +*/ +static void codebinexpval (FuncState *fs, OpCode op, + expdesc *e1, expdesc *e2, int line) { + int v2 = luaK_exp2anyreg(fs, e2); /* both operands are in registers */ + lua_assert(OP_ADD <= op && op <= OP_SHR); + finishbinexpval(fs, e1, e2, op, v2, 0, line, OP_MMBIN, + cast(TMS, (op - OP_ADD) + TM_ADD)); +} + + +/* +** Code binary operators with immediate operands. +*/ +static void codebini (FuncState *fs, OpCode op, + expdesc *e1, expdesc *e2, int flip, int line, + TMS event) { + int v2 = int2sC(cast_int(e2->u.ival)); /* immediate operand */ + lua_assert(e2->k == VKINT); + finishbinexpval(fs, e1, e2, op, v2, flip, line, OP_MMBINI, event); +} + + +/* Try to code a binary operator negating its second operand. +** For the metamethod, 2nd operand must keep its original value. +*/ +static int finishbinexpneg (FuncState *fs, expdesc *e1, expdesc *e2, + OpCode op, int line, TMS event) { + if (!luaK_isKint(e2)) + return 0; /* not an integer constant */ + else { + lua_Integer i2 = e2->u.ival; + if (!(fitsC(i2) && fitsC(-i2))) + return 0; /* not in the proper range */ + else { /* operating a small integer constant */ + int v2 = cast_int(i2); + finishbinexpval(fs, e1, e2, op, int2sC(-v2), 0, line, OP_MMBINI, event); + /* correct metamethod argument */ + SETARG_B(fs->f->code[fs->pc - 1], int2sC(v2)); + return 1; /* successfully coded */ + } + } +} + + +static void swapexps (expdesc *e1, expdesc *e2) { + expdesc temp = *e1; *e1 = *e2; *e2 = temp; /* swap 'e1' and 'e2' */ +} + + +/* +** Code arithmetic operators ('+', '-', ...). If second operand is a +** constant in the proper range, use variant opcodes with K operands. +*/ +static void codearith (FuncState *fs, BinOpr opr, + expdesc *e1, expdesc *e2, int flip, int line) { + TMS event = cast(TMS, opr + TM_ADD); + if (tonumeral(e2, NULL) && luaK_exp2K(fs, e2)) { /* K operand? */ + int v2 = e2->u.info; /* K index */ + OpCode op = cast(OpCode, opr + OP_ADDK); + finishbinexpval(fs, e1, e2, op, v2, flip, line, OP_MMBINK, event); + } + else { /* 'e2' is neither an immediate nor a K operand */ + OpCode op = cast(OpCode, opr + OP_ADD); + if (flip) + swapexps(e1, e2); /* back to original order */ + codebinexpval(fs, op, e1, e2, line); /* use standard operators */ + } +} + + +/* +** Code commutative operators ('+', '*'). If first operand is a +** numeric constant, change order of operands to try to use an +** immediate or K operator. +*/ +static void codecommutative (FuncState *fs, BinOpr op, + expdesc *e1, expdesc *e2, int line) { + int flip = 0; + if (tonumeral(e1, NULL)) { /* is first operand a numeric constant? */ + swapexps(e1, e2); /* change order */ + flip = 1; + } + if (op == OPR_ADD && isSCint(e2)) /* immediate operand? */ + codebini(fs, cast(OpCode, OP_ADDI), e1, e2, flip, line, TM_ADD); + else + codearith(fs, op, e1, e2, flip, line); +} + + +/* +** Code bitwise operations; they are all associative, so the function +** tries to put an integer constant as the 2nd operand (a K operand). +*/ +static void codebitwise (FuncState *fs, BinOpr opr, + expdesc *e1, expdesc *e2, int line) { + int flip = 0; + int v2; + OpCode op; + if (e1->k == VKINT && luaK_exp2RK(fs, e1)) { + swapexps(e1, e2); /* 'e2' will be the constant operand */ + flip = 1; + } + else if (!(e2->k == VKINT && luaK_exp2RK(fs, e2))) { /* no constants? */ + op = cast(OpCode, opr + OP_ADD); + codebinexpval(fs, op, e1, e2, line); /* all-register opcodes */ + return; + } + v2 = e2->u.info; /* index in K array */ + op = cast(OpCode, opr + OP_ADDK); + lua_assert(ttisinteger(&fs->f->k[v2])); + finishbinexpval(fs, e1, e2, op, v2, flip, line, OP_MMBINK, + cast(TMS, opr + TM_ADD)); +} + + +/* +** Emit code for order comparisons. When using an immediate operand, +** 'isfloat' tells whether the original value was a float. +*/ +static void codeorder (FuncState *fs, OpCode op, expdesc *e1, expdesc *e2) { + int r1, r2; + int im; + int isfloat = 0; + if (isSCnumber(e2, &im, &isfloat)) { + /* use immediate operand */ + r1 = luaK_exp2anyreg(fs, e1); + r2 = im; + op = cast(OpCode, (op - OP_LT) + OP_LTI); + } + else if (isSCnumber(e1, &im, &isfloat)) { + /* transform (A < B) to (B > A) and (A <= B) to (B >= A) */ + r1 = luaK_exp2anyreg(fs, e2); + r2 = im; + op = (op == OP_LT) ? OP_GTI : OP_GEI; + } + else { /* regular case, compare two registers */ + r1 = luaK_exp2anyreg(fs, e1); + r2 = luaK_exp2anyreg(fs, e2); + } + freeexps(fs, e1, e2); + e1->u.info = condjump(fs, op, r1, r2, isfloat, 1); + e1->k = VJMP; +} + + +/* +** Emit code for equality comparisons ('==', '~='). +** 'e1' was already put as RK by 'luaK_infix'. +*/ +static void codeeq (FuncState *fs, BinOpr opr, expdesc *e1, expdesc *e2) { + int r1, r2; + int im; + int isfloat = 0; /* not needed here, but kept for symmetry */ + OpCode op; + if (e1->k != VNONRELOC) { + lua_assert(e1->k == VK || e1->k == VKINT || e1->k == VKFLT); + swapexps(e1, e2); + } + r1 = luaK_exp2anyreg(fs, e1); /* 1st expression must be in register */ + if (isSCnumber(e2, &im, &isfloat)) { + op = OP_EQI; + r2 = im; /* immediate operand */ + } + else if (luaK_exp2RK(fs, e2)) { /* 1st expression is constant? */ + op = OP_EQK; + r2 = e2->u.info; /* constant index */ + } + else { + op = OP_EQ; /* will compare two registers */ + r2 = luaK_exp2anyreg(fs, e2); + } + freeexps(fs, e1, e2); + e1->u.info = condjump(fs, op, r1, r2, isfloat, (opr == OPR_EQ)); + e1->k = VJMP; +} + + +/* +** Apply prefix operation 'op' to expression 'e'. +*/ +void luaK_prefix (FuncState *fs, UnOpr op, expdesc *e, int line) { + static const expdesc ef = {VKINT, {0}, NO_JUMP, NO_JUMP}; + luaK_dischargevars(fs, e); + switch (op) { + case OPR_MINUS: case OPR_BNOT: /* use 'ef' as fake 2nd operand */ + if (constfolding(fs, op + LUA_OPUNM, e, &ef)) + break; + /* else */ /* FALLTHROUGH */ + case OPR_LEN: + codeunexpval(fs, cast(OpCode, op + OP_UNM), e, line); + break; + case OPR_NOT: codenot(fs, e); break; + default: lua_assert(0); + } +} + + +/* +** Process 1st operand 'v' of binary operation 'op' before reading +** 2nd operand. +*/ +void luaK_infix (FuncState *fs, BinOpr op, expdesc *v) { + luaK_dischargevars(fs, v); + switch (op) { + case OPR_AND: { + luaK_goiftrue(fs, v); /* go ahead only if 'v' is true */ + break; + } + case OPR_OR: { + luaK_goiffalse(fs, v); /* go ahead only if 'v' is false */ + 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_IDIV: + case OPR_MOD: case OPR_POW: + case OPR_BAND: case OPR_BOR: case OPR_BXOR: + case OPR_SHL: case OPR_SHR: { + if (!tonumeral(v, NULL)) + luaK_exp2anyreg(fs, v); + /* else keep numeral, which may be folded with 2nd operand */ + break; + } + case OPR_EQ: case OPR_NE: { + if (!tonumeral(v, NULL)) + luaK_exp2RK(fs, v); + /* else keep numeral, which may be an immediate operand */ + break; + } + case OPR_LT: case OPR_LE: + case OPR_GT: case OPR_GE: { + int dummy, dummy2; + if (!isSCnumber(v, &dummy, &dummy2)) + luaK_exp2anyreg(fs, v); + /* else keep numeral, which may be an immediate operand */ + break; + } + default: lua_assert(0); + } +} + +/* +** Create code for '(e1 .. e2)'. +** For '(e1 .. e2.1 .. e2.2)' (which is '(e1 .. (e2.1 .. e2.2))', +** because concatenation is right associative), merge both CONCATs. +*/ +static void codeconcat (FuncState *fs, expdesc *e1, expdesc *e2, int line) { + Instruction *ie2 = previousinstruction(fs); + if (GET_OPCODE(*ie2) == OP_CONCAT) { /* is 'e2' a concatenation? */ + int n = GETARG_B(*ie2); /* # of elements concatenated in 'e2' */ + lua_assert(e1->u.info + 1 == GETARG_A(*ie2)); + freeexp(fs, e2); + SETARG_A(*ie2, e1->u.info); /* correct first element ('e1') */ + SETARG_B(*ie2, n + 1); /* will concatenate one more element */ + } + else { /* 'e2' is not a concatenation */ + luaK_codeABC(fs, OP_CONCAT, e1->u.info, 2, 0); /* new concat opcode */ + freeexp(fs, e2); + luaK_fixline(fs, line); + } +} + + +/* +** Finalize code for binary operation, after reading 2nd operand. +*/ +void luaK_posfix (FuncState *fs, BinOpr opr, + expdesc *e1, expdesc *e2, int line) { + luaK_dischargevars(fs, e2); + if (foldbinop(opr) && constfolding(fs, opr + LUA_OPADD, e1, e2)) + return; /* done by folding */ + switch (opr) { + case OPR_AND: { + lua_assert(e1->t == NO_JUMP); /* list closed by 'luaK_infix' */ + luaK_concat(fs, &e2->f, e1->f); + *e1 = *e2; + break; + } + case OPR_OR: { + lua_assert(e1->f == NO_JUMP); /* list closed by 'luaK_infix' */ + luaK_concat(fs, &e2->t, e1->t); + *e1 = *e2; + break; + } + case OPR_CONCAT: { /* e1 .. e2 */ + luaK_exp2nextreg(fs, e2); + codeconcat(fs, e1, e2, line); + break; + } + case OPR_ADD: case OPR_MUL: { + codecommutative(fs, opr, e1, e2, line); + break; + } + case OPR_SUB: { + if (finishbinexpneg(fs, e1, e2, OP_ADDI, line, TM_SUB)) + break; /* coded as (r1 + -I) */ + /* ELSE */ + } /* FALLTHROUGH */ + case OPR_DIV: case OPR_IDIV: case OPR_MOD: case OPR_POW: { + codearith(fs, opr, e1, e2, 0, line); + break; + } + case OPR_BAND: case OPR_BOR: case OPR_BXOR: { + codebitwise(fs, opr, e1, e2, line); + break; + } + case OPR_SHL: { + if (isSCint(e1)) { + swapexps(e1, e2); + codebini(fs, OP_SHLI, e1, e2, 1, line, TM_SHL); /* I << r2 */ + } + else if (finishbinexpneg(fs, e1, e2, OP_SHRI, line, TM_SHL)) { + /* coded as (r1 >> -I) */; + } + else /* regular case (two registers) */ + codebinexpval(fs, OP_SHL, e1, e2, line); + break; + } + case OPR_SHR: { + if (isSCint(e2)) + codebini(fs, OP_SHRI, e1, e2, 0, line, TM_SHR); /* r1 >> I */ + else /* regular case (two registers) */ + codebinexpval(fs, OP_SHR, e1, e2, line); + break; + } + case OPR_EQ: case OPR_NE: { + codeeq(fs, opr, e1, e2); + break; + } + case OPR_LT: case OPR_LE: { + OpCode op = cast(OpCode, (opr - OPR_EQ) + OP_EQ); + codeorder(fs, op, e1, e2); + break; + } + case OPR_GT: case OPR_GE: { + /* '(a > b)' <=> '(b < a)'; '(a >= b)' <=> '(b <= a)' */ + OpCode op = cast(OpCode, (opr - OPR_NE) + OP_EQ); + swapexps(e1, e2); + codeorder(fs, op, e1, e2); + break; + } + default: lua_assert(0); + } +} + + +/* +** Change line information associated with current position, by removing +** previous info and adding it again with new line. +*/ +void luaK_fixline (FuncState *fs, int line) { + removelastlineinfo(fs); + savelineinfo(fs, fs->f, line); +} + + +void luaK_settablesize (FuncState *fs, int pc, int ra, int asize, int hsize) { + Instruction *inst = &fs->f->code[pc]; + int rb = (hsize != 0) ? luaO_ceillog2(hsize) + 1 : 0; /* hash size */ + int extra = asize / (MAXARG_C + 1); /* higher bits of array size */ + int rc = asize % (MAXARG_C + 1); /* lower bits of array size */ + int k = (extra > 0); /* true iff needs extra argument */ + *inst = CREATE_ABCk(OP_NEWTABLE, ra, rb, rc, k); + *(inst + 1) = CREATE_Ax(OP_EXTRAARG, extra); +} + + +/* +** Emit a SETLIST instruction. +** 'base' is register that keeps table; +** 'nelems' is #table plus those to be stored now; +** 'tostore' is number of values (in registers 'base + 1',...) to add to +** table (or LUA_MULTRET to add up to stack top). +*/ +void luaK_setlist (FuncState *fs, int base, int nelems, int tostore) { + lua_assert(tostore != 0 && tostore <= LFIELDS_PER_FLUSH); + if (tostore == LUA_MULTRET) + tostore = 0; + if (nelems <= MAXARG_C) + luaK_codeABC(fs, OP_SETLIST, base, tostore, nelems); + else { + int extra = nelems / (MAXARG_C + 1); + nelems %= (MAXARG_C + 1); + luaK_codeABCk(fs, OP_SETLIST, base, tostore, nelems, 1); + codeextraarg(fs, extra); + } + fs->freereg = base + 1; /* free registers with list values */ +} + + +/* +** return the final target of a jump (skipping jumps to jumps) +*/ +static int finaltarget (Instruction *code, int i) { + int count; + for (count = 0; count < 100; count++) { /* avoid infinite loops */ + Instruction pc = code[i]; + if (GET_OPCODE(pc) != OP_JMP) + break; + else + i += GETARG_sJ(pc) + 1; + } + return i; +} + + +/* +** Do a final pass over the code of a function, doing small peephole +** optimizations and adjustments. +*/ +void luaK_finish (FuncState *fs) { + int i; + Proto *p = fs->f; + for (i = 0; i < fs->pc; i++) { + Instruction *pc = &p->code[i]; + lua_assert(i == 0 || isOT(*(pc - 1)) == isIT(*pc)); + switch (GET_OPCODE(*pc)) { + case OP_RETURN0: case OP_RETURN1: { + if (!(fs->needclose || p->is_vararg)) + break; /* no extra work */ + /* else use OP_RETURN to do the extra work */ + SET_OPCODE(*pc, OP_RETURN); + } /* FALLTHROUGH */ + case OP_RETURN: case OP_TAILCALL: { + if (fs->needclose) + SETARG_k(*pc, 1); /* signal that it needs to close */ + if (p->is_vararg) + SETARG_C(*pc, p->numparams + 1); /* signal that it is vararg */ + break; + } + case OP_JMP: { + int target = finaltarget(p->code, i); + fixjump(fs, i, target); + break; + } + default: break; + } + } +} diff --git a/lua-5.4.3/src/lcode.h b/lua-5.4.3/src/lcode.h new file mode 100644 index 0000000..3265824 --- /dev/null +++ b/lua-5.4.3/src/lcode.h @@ -0,0 +1,104 @@ +/* +** $Id: lcode.h $ +** 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 { + /* arithmetic operators */ + OPR_ADD, OPR_SUB, OPR_MUL, OPR_MOD, OPR_POW, + OPR_DIV, OPR_IDIV, + /* bitwise operators */ + OPR_BAND, OPR_BOR, OPR_BXOR, + OPR_SHL, OPR_SHR, + /* string operator */ + OPR_CONCAT, + /* comparison operators */ + OPR_EQ, OPR_LT, OPR_LE, + OPR_NE, OPR_GT, OPR_GE, + /* logical operators */ + OPR_AND, OPR_OR, + OPR_NOBINOPR +} BinOpr; + + +/* true if operation is foldable (that is, it is arithmetic or bitwise) */ +#define foldbinop(op) ((op) <= OPR_SHR) + + +#define luaK_codeABC(fs,o,a,b,c) luaK_codeABCk(fs,o,a,b,c,0) + + +typedef enum UnOpr { OPR_MINUS, OPR_BNOT, OPR_NOT, OPR_LEN, OPR_NOUNOPR } UnOpr; + + +/* get (pointer to) instruction of given 'expdesc' */ +#define getinstruction(fs,e) ((fs)->f->code[(e)->u.info]) + + +#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_code (FuncState *fs, Instruction i); +LUAI_FUNC int luaK_codeABx (FuncState *fs, OpCode o, int A, unsigned int Bx); +LUAI_FUNC int luaK_codeAsBx (FuncState *fs, OpCode o, int A, int Bx); +LUAI_FUNC int luaK_codeABCk (FuncState *fs, OpCode o, int A, + int B, int C, int k); +LUAI_FUNC int luaK_isKint (expdesc *e); +LUAI_FUNC int luaK_exp2const (FuncState *fs, const expdesc *e, TValue *v); +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 void luaK_int (FuncState *fs, int reg, lua_Integer n); +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_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_settablesize (FuncState *fs, int pc, + int ra, int asize, int hsize); +LUAI_FUNC void luaK_setlist (FuncState *fs, int base, int nelems, int tostore); +LUAI_FUNC void luaK_finish (FuncState *fs); +LUAI_FUNC l_noret luaK_semerror (LexState *ls, const char *msg); + + +#endif diff --git a/lua-5.4.3/src/lcorolib.c b/lua-5.4.3/src/lcorolib.c new file mode 100644 index 0000000..fedbebe --- /dev/null +++ b/lua-5.4.3/src/lcorolib.c @@ -0,0 +1,210 @@ +/* +** $Id: lcorolib.c $ +** Coroutine Library +** See Copyright Notice in lua.h +*/ + +#define lcorolib_c +#define LUA_LIB + +#include "lprefix.h" + + +#include + +#include "lua.h" + +#include "lauxlib.h" +#include "lualib.h" + + +static lua_State *getco (lua_State *L) { + lua_State *co = lua_tothread(L, 1); + luaL_argexpected(L, co, 1, "thread"); + return co; +} + + +/* +** Resumes a coroutine. Returns the number of results for non-error +** cases or -1 for errors. +*/ +static int auxresume (lua_State *L, lua_State *co, int narg) { + int status, nres; + if (l_unlikely(!lua_checkstack(co, narg))) { + lua_pushliteral(L, "too many arguments to resume"); + return -1; /* error flag */ + } + lua_xmove(L, co, narg); + status = lua_resume(co, L, narg, &nres); + if (l_likely(status == LUA_OK || status == LUA_YIELD)) { + if (l_unlikely(!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 = getco(L); + int r; + r = auxresume(L, co, lua_gettop(L) - 1); + if (l_unlikely(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 (l_unlikely(r < 0)) { /* error? */ + int stat = lua_status(co); + if (stat != LUA_OK && stat != LUA_YIELD) { /* error in the coroutine? */ + stat = lua_resetthread(co); /* close its tbc variables */ + lua_assert(stat != LUA_OK); + lua_xmove(co, L, 1); /* copy error message */ + } + if (stat != LUA_ERRMEM && /* not a memory error and ... */ + lua_type(L, -1) == LUA_TSTRING) { /* ... error object is a string? */ + luaL_where(L, 1); /* add extra info, if available */ + 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)); +} + + +#define COS_RUN 0 +#define COS_DEAD 1 +#define COS_YIELD 2 +#define COS_NORM 3 + + +static const char *const statname[] = + {"running", "dead", "suspended", "normal"}; + + +static int auxstatus (lua_State *L, lua_State *co) { + if (L == co) return COS_RUN; + else { + switch (lua_status(co)) { + case LUA_YIELD: + return COS_YIELD; + case LUA_OK: { + lua_Debug ar; + if (lua_getstack(co, 0, &ar)) /* does it have frames? */ + return COS_NORM; /* it is running */ + else if (lua_gettop(co) == 0) + return COS_DEAD; + else + return COS_YIELD; /* initial state */ + } + default: /* some error occurred */ + return COS_DEAD; + } + } +} + + +static int luaB_costatus (lua_State *L) { + lua_State *co = getco(L); + lua_pushstring(L, statname[auxstatus(L, co)]); + return 1; +} + + +static int luaB_yieldable (lua_State *L) { + lua_State *co = lua_isnone(L, 1) ? L : getco(L); + lua_pushboolean(L, lua_isyieldable(co)); + return 1; +} + + +static int luaB_corunning (lua_State *L) { + int ismain = lua_pushthread(L); + lua_pushboolean(L, ismain); + return 2; +} + + +static int luaB_close (lua_State *L) { + lua_State *co = getco(L); + int status = auxstatus(L, co); + switch (status) { + case COS_DEAD: case COS_YIELD: { + status = lua_resetthread(co); + if (status == LUA_OK) { + lua_pushboolean(L, 1); + return 1; + } + else { + lua_pushboolean(L, 0); + lua_xmove(co, L, 1); /* copy error message */ + return 2; + } + } + default: /* normal or running coroutine */ + return luaL_error(L, "cannot close a %s coroutine", statname[status]); + } +} + + +static const luaL_Reg co_funcs[] = { + {"create", luaB_cocreate}, + {"resume", luaB_coresume}, + {"running", luaB_corunning}, + {"status", luaB_costatus}, + {"wrap", luaB_cowrap}, + {"yield", luaB_yield}, + {"isyieldable", luaB_yieldable}, + {"close", luaB_close}, + {NULL, NULL} +}; + + + +LUAMOD_API int luaopen_coroutine (lua_State *L) { + luaL_newlib(L, co_funcs); + return 1; +} + diff --git a/lua-5.4.3/src/lctype.c b/lua-5.4.3/src/lctype.c new file mode 100644 index 0000000..9542280 --- /dev/null +++ b/lua-5.4.3/src/lctype.c @@ -0,0 +1,64 @@ +/* +** $Id: lctype.c $ +** 'ctype' functions for Lua +** See Copyright Notice in lua.h +*/ + +#define lctype_c +#define LUA_CORE + +#include "lprefix.h" + + +#include "lctype.h" + +#if !LUA_USE_CTYPE /* { */ + +#include + + +#if defined (LUA_UCID) /* accept UniCode IDentifiers? */ +/* consider all non-ascii codepoints to be alphabetic */ +#define NONA 0x01 +#else +#define NONA 0x00 /* default */ +#endif + + +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, + NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, /* 8. */ + NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, + NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, /* 9. */ + NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, + NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, /* a. */ + NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, + NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, /* b. */ + NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, + 0x00, 0x00, NONA, NONA, NONA, NONA, NONA, NONA, /* c. */ + NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, + NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, /* d. */ + NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, + NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, /* e. */ + NONA, NONA, NONA, NONA, NONA, NONA, NONA, NONA, + NONA, NONA, NONA, NONA, NONA, 0x00, 0x00, 0x00, /* f. */ + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 +}; + +#endif /* } */ diff --git a/lua-5.4.3/src/lctype.h b/lua-5.4.3/src/lctype.h new file mode 100644 index 0000000..864e190 --- /dev/null +++ b/lua-5.4.3/src/lctype.h @@ -0,0 +1,101 @@ +/* +** $Id: lctype.h $ +** '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)) + + +/* +** In ASCII, this 'ltolower' is correct for alphabetic characters and +** for '.'. That is enough for Lua needs. ('check_exp' ensures that +** the character either is an upper-case letter or is unchanged by +** the transformation, which holds for lower-case letters and '.'.) +*/ +#define ltolower(c) \ + check_exp(('A' <= (c) && (c) <= 'Z') || (c) == ((c) | ('A' ^ 'a')), \ + (c) | ('A' ^ 'a')) + + +/* one entry for each character and for -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/lua-5.4.3/src/ldblib.c b/lua-5.4.3/src/ldblib.c new file mode 100644 index 0000000..6dcbaa9 --- /dev/null +++ b/lua-5.4.3/src/ldblib.c @@ -0,0 +1,483 @@ +/* +** $Id: ldblib.c $ +** Interface from Lua to its debug API +** See Copyright Notice in lua.h +*/ + +#define ldblib_c +#define LUA_LIB + +#include "lprefix.h" + + +#include +#include +#include + +#include "lua.h" + +#include "lauxlib.h" +#include "lualib.h" + + +/* +** The hook table at registry[HOOKKEY] maps threads to their current +** hook function. +*/ +static const char *const HOOKKEY = "_HOOKKEY"; + + +/* +** If L1 != L, L1 can be in any state, and therefore there are no +** guarantees about its stack space; any push in L1 must be +** checked. +*/ +static void checkstack (lua_State *L, lua_State *L1, int n) { + if (l_unlikely(L != L1 && !lua_checkstack(L1, n))) + luaL_error(L, "stack overflow"); +} + + +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_argexpected(L, t == LUA_TNIL || t == LUA_TTABLE, 2, "nil or table"); + lua_settop(L, 2); + lua_setmetatable(L, 1); + return 1; /* return 1st argument */ +} + + +static int db_getuservalue (lua_State *L) { + int n = (int)luaL_optinteger(L, 2, 1); + if (lua_type(L, 1) != LUA_TUSERDATA) + luaL_pushfail(L); + else if (lua_getiuservalue(L, 1, n) != LUA_TNONE) { + lua_pushboolean(L, 1); + return 2; + } + return 1; +} + + +static int db_setuservalue (lua_State *L) { + int n = (int)luaL_optinteger(L, 3, 1); + luaL_checktype(L, 1, LUA_TUSERDATA); + luaL_checkany(L, 2); + lua_settop(L, 2); + if (!lua_setiuservalue(L, 1, n)) + luaL_pushfail(L); + return 1; +} + + +/* +** Auxiliary function used by several library functions: check for +** an optional thread as function's first argument and set 'arg' with +** 1 if this argument is present (so that functions can skip it to +** access their other arguments) +*/ +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; /* function will operate over current thread */ + } +} + + +/* +** Variations of 'lua_settable', used by 'db_getinfo' to put results +** from 'lua_getinfo' into result table. Key is always a string; +** value can be a string, an int, or a boolean. +*/ +static void settabss (lua_State *L, const char *k, const char *v) { + lua_pushstring(L, v); + lua_setfield(L, -2, k); +} + +static void settabsi (lua_State *L, const char *k, int v) { + lua_pushinteger(L, v); + lua_setfield(L, -2, k); +} + +static void settabsb (lua_State *L, const char *k, int v) { + lua_pushboolean(L, v); + lua_setfield(L, -2, k); +} + + +/* +** In function 'db_getinfo', the call to 'lua_getinfo' may push +** results on the stack; later it creates the result table to put +** these objects. Function 'treatstackoption' puts the result from +** 'lua_getinfo' on top of the result table so that it can call +** 'lua_setfield'. +*/ +static void treatstackoption (lua_State *L, lua_State *L1, const char *fname) { + if (L == L1) + lua_rotate(L, -2, 1); /* exchange object and table */ + else + lua_xmove(L1, L, 1); /* move object to the "main" stack */ + lua_setfield(L, -2, fname); /* put object into table */ +} + + +/* +** Calls 'lua_getinfo' and collects all results in a new table. +** L1 needs stack space for an optional input (function) plus +** two optional outputs (function and line table) from function +** 'lua_getinfo'. +*/ +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, "flnSrtu"); + checkstack(L, L1, 3); + luaL_argcheck(L, options[0] != '>', arg + 2, "invalid option '>'"); + if (lua_isfunction(L, arg + 1)) { /* info about a function? */ + options = lua_pushfstring(L, ">%s", options); /* add '>' to 'options' */ + lua_pushvalue(L, arg + 1); /* move function to 'L1' stack */ + lua_xmove(L, L1, 1); + } + else { /* stack level */ + if (!lua_getstack(L1, (int)luaL_checkinteger(L, arg + 1), &ar)) { + luaL_pushfail(L); /* level out of range */ + return 1; + } + } + if (!lua_getinfo(L1, options, &ar)) + return luaL_argerror(L, arg+2, "invalid option"); + lua_newtable(L); /* table to collect results */ + if (strchr(options, 'S')) { + lua_pushlstring(L, ar.source, ar.srclen); + lua_setfield(L, -2, "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, 'r')) { + settabsi(L, "ftransfer", ar.ftransfer); + settabsi(L, "ntransfer", ar.ntransfer); + } + 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); + int nvar = (int)luaL_checkinteger(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; /* return only name (there is no value) */ + } + else { /* stack-level argument */ + lua_Debug ar; + const char *name; + int level = (int)luaL_checkinteger(L, arg + 1); + if (l_unlikely(!lua_getstack(L1, level, &ar))) /* out of range? */ + return luaL_argerror(L, arg+1, "level out of range"); + checkstack(L, L1, 1); + name = lua_getlocal(L1, &ar, nvar); + if (name) { + lua_xmove(L1, L, 1); /* move local value */ + lua_pushstring(L, name); /* push name */ + lua_rotate(L, -2, 1); /* re-order */ + return 2; + } + else { + luaL_pushfail(L); /* no name (nor value) */ + return 1; + } + } +} + + +static int db_setlocal (lua_State *L) { + int arg; + const char *name; + lua_State *L1 = getthread(L, &arg); + lua_Debug ar; + int level = (int)luaL_checkinteger(L, arg + 1); + int nvar = (int)luaL_checkinteger(L, arg + 2); + if (l_unlikely(!lua_getstack(L1, level, &ar))) /* out of range? */ + return luaL_argerror(L, arg+1, "level out of range"); + luaL_checkany(L, arg+3); + lua_settop(L, arg+3); + checkstack(L, L1, 1); + lua_xmove(L, L1, 1); + name = lua_setlocal(L1, &ar, nvar); + if (name == NULL) + lua_pop(L1, 1); /* pop value (if not popped by 'lua_setlocal') */ + lua_pushstring(L, name); + return 1; +} + + +/* +** get (if 'get' is true) or set an upvalue from a closure +*/ +static int auxupvalue (lua_State *L, int get) { + const char *name; + int n = (int)luaL_checkinteger(L, 2); /* upvalue index */ + luaL_checktype(L, 1, LUA_TFUNCTION); /* closure */ + 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)); /* no-op if get is false */ + 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); +} + + +/* +** Check whether a given upvalue from a given closure exists and +** returns its index +*/ +static void *checkupval (lua_State *L, int argf, int argnup, int *pnup) { + void *id; + int nup = (int)luaL_checkinteger(L, argnup); /* upvalue index */ + luaL_checktype(L, argf, LUA_TFUNCTION); /* closure */ + id = lua_upvalueid(L, argf, nup); + if (pnup) { + luaL_argcheck(L, id != NULL, argnup, "invalid upvalue index"); + *pnup = nup; + } + return id; +} + + +static int db_upvalueid (lua_State *L) { + void *id = checkupval(L, 1, 2, NULL); + if (id != NULL) + lua_pushlightuserdata(L, id); + else + luaL_pushfail(L); + return 1; +} + + +static int db_upvaluejoin (lua_State *L) { + int n1, n2; + checkupval(L, 1, 2, &n1); + checkupval(L, 3, 4, &n2); + 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; +} + + +/* +** Call hook function registered at hook table for the current +** thread (if there is one) +*/ +static void hookf (lua_State *L, lua_Debug *ar) { + static const char *const hooknames[] = + {"call", "return", "line", "count", "tail call"}; + lua_getfield(L, LUA_REGISTRYINDEX, HOOKKEY); + lua_pushthread(L); + if (lua_rawget(L, -2) == LUA_TFUNCTION) { /* is there a hook function? */ + lua_pushstring(L, hooknames[(int)ar->event]); /* push event name */ + if (ar->currentline >= 0) + lua_pushinteger(L, ar->currentline); /* push current line */ + else lua_pushnil(L); + lua_assert(lua_getinfo(L, "lS", ar)); + lua_call(L, 2, 0); /* call hook function */ + } +} + + +/* +** Convert a string mask (for 'sethook') into a bit mask +*/ +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; +} + + +/* +** Convert a bit mask (for 'gethook') into a string 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)) { /* no hook? */ + 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 = (int)luaL_optinteger(L, arg + 3, 0); + func = hookf; mask = makemask(smask, count); + } + if (!luaL_getsubtable(L, LUA_REGISTRYINDEX, HOOKKEY)) { + /* table just created; initialize it */ + lua_pushliteral(L, "k"); + lua_setfield(L, -2, "__mode"); /** hooktable.__mode = "k" */ + lua_pushvalue(L, -1); + lua_setmetatable(L, -2); /* metatable(hooktable) = hooktable */ + } + checkstack(L, L1, 1); + lua_pushthread(L1); lua_xmove(L1, L, 1); /* key (thread) */ + lua_pushvalue(L, arg + 1); /* value (hook function) */ + lua_rawset(L, -3); /* hooktable[L1] = new Lua hook */ + lua_sethook(L1, func, mask, count); + 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) { /* no hook? */ + luaL_pushfail(L); + return 1; + } + else if (hook != hookf) /* external hook? */ + lua_pushliteral(L, "external hook"); + else { /* hook table must exist */ + lua_getfield(L, LUA_REGISTRYINDEX, HOOKKEY); + checkstack(L, L1, 1); + lua_pushthread(L1); lua_xmove(L1, L, 1); + lua_rawget(L, -2); /* 1st result = hooktable[L1] */ + lua_remove(L, -2); /* remove hook table */ + } + lua_pushstring(L, unmakemask(mask, buff)); /* 2nd result = mask */ + lua_pushinteger(L, lua_gethookcount(L1)); /* 3rd result = count */ + return 3; +} + + +static int db_debug (lua_State *L) { + for (;;) { + char buffer[250]; + lua_writestringerror("%s", "lua_debug> "); + if (fgets(buffer, sizeof(buffer), stdin) == NULL || + strcmp(buffer, "cont\n") == 0) + return 0; + if (luaL_loadbuffer(L, buffer, strlen(buffer), "=(debug command)") || + lua_pcall(L, 0, 0, 0)) + lua_writestringerror("%s\n", luaL_tolstring(L, -1, NULL)); + 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 = (int)luaL_optinteger(L, arg + 2, (L == L1) ? 1 : 0); + luaL_traceback(L, L1, msg, level); + } + return 1; +} + + +static int db_setcstacklimit (lua_State *L) { + int limit = (int)luaL_checkinteger(L, 1); + int res = lua_setcstacklimit(L, limit); + lua_pushinteger(L, res); + 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}, + {"setcstacklimit", db_setcstacklimit}, + {NULL, NULL} +}; + + +LUAMOD_API int luaopen_debug (lua_State *L) { + luaL_newlib(L, dblib); + return 1; +} + diff --git a/lua-5.4.3/src/ldebug.c b/lua-5.4.3/src/ldebug.c new file mode 100644 index 0000000..1feaab2 --- /dev/null +++ b/lua-5.4.3/src/ldebug.c @@ -0,0 +1,877 @@ +/* +** $Id: ldebug.c $ +** Debug Interface +** See Copyright Notice in lua.h +*/ + +#define ldebug_c +#define LUA_CORE + +#include "lprefix.h" + + +#include +#include +#include + +#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_VCCL) + + +static const char *funcnamefromcode (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); +} + + +/* +** Get a "base line" to find the line corresponding to an instruction. +** Base lines are regularly placed at MAXIWTHABS intervals, so usually +** an integer division gets the right place. When the source file has +** large sequences of empty/comment lines, it may need extra entries, +** so the original estimate needs a correction. +** If the original estimate is -1, the initial 'if' ensures that the +** 'while' will run at least once. +** The assertion that the estimate is a lower bound for the correct base +** is valid as long as the debug info has been generated with the same +** value for MAXIWTHABS or smaller. (Previous releases use a little +** smaller value.) +*/ +static int getbaseline (const Proto *f, int pc, int *basepc) { + if (f->sizeabslineinfo == 0 || pc < f->abslineinfo[0].pc) { + *basepc = -1; /* start from the beginning */ + return f->linedefined; + } + else { + int i = cast_uint(pc) / MAXIWTHABS - 1; /* get an estimate */ + /* estimate must be a lower bond of the correct base */ + lua_assert(i < 0 || + (i < f->sizeabslineinfo && f->abslineinfo[i].pc <= pc)); + while (i + 1 < f->sizeabslineinfo && pc >= f->abslineinfo[i + 1].pc) + i++; /* low estimate; adjust it */ + *basepc = f->abslineinfo[i].pc; + return f->abslineinfo[i].line; + } +} + + +/* +** Get the line corresponding to instruction 'pc' in function 'f'; +** first gets a base line and from there does the increments until +** the desired instruction. +*/ +int luaG_getfuncline (const Proto *f, int pc) { + if (f->lineinfo == NULL) /* no debug information? */ + return -1; + else { + int basepc; + int baseline = getbaseline(f, pc, &basepc); + while (basepc++ < pc) { /* walk until given instruction */ + lua_assert(f->lineinfo[basepc] != ABSLINEINFO); + baseline += f->lineinfo[basepc]; /* correct line */ + } + return baseline; + } +} + + +static int getcurrentline (CallInfo *ci) { + return luaG_getfuncline(ci_func(ci)->p, currentpc(ci)); +} + + +/* +** Set 'trap' for all active Lua frames. +** This function can be called during a signal, under "reasonable" +** assumptions. A new 'ci' is completely linked in the list before it +** becomes part of the "active" list, and we assume that pointers are +** atomic; see comment in next function. +** (A compiler doing interprocedural optimizations could, theoretically, +** reorder memory writes in such a way that the list could be +** temporarily broken while inserting a new element. We simply assume it +** has no good reasons to do that.) +*/ +static void settraps (CallInfo *ci) { + for (; ci != NULL; ci = ci->previous) + if (isLua(ci)) + ci->u.l.trap = 1; +} + + +/* +** This function can be called during a signal, under "reasonable" +** assumptions. +** Fields 'basehookcount' and 'hookcount' (set by 'resethookcount') +** are for debug only, and it is no problem if they get arbitrary +** values (causes at most one wrong hook call). 'hookmask' is an atomic +** value. We assume that pointers are atomic too (e.g., gcc ensures that +** for all platforms where it runs). Moreover, 'hook' is always checked +** before being called (see 'luaD_hook'). +*/ +LUA_API void lua_sethook (lua_State *L, lua_Hook func, int mask, int count) { + if (func == NULL || mask == 0) { /* turn off hooks? */ + mask = 0; + func = NULL; + } + L->hook = func; + L->basehookcount = count; + resethookcount(L); + L->hookmask = cast_byte(mask); + if (mask) + settraps(L->ci); /* to trace inside 'luaV_execute' */ +} + + +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 (const 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) { + if (clLvalue(s2v(ci->func))->p->is_vararg) { + int nextra = ci->u.l.nextraargs; + if (n >= -nextra) { /* 'n' is negative */ + *pos = ci->func - nextra - (n + 1); + return "(vararg)"; /* generic name for any vararg */ + } + } + return NULL; /* no such vararg */ +} + + +const char *luaG_findlocal (lua_State *L, CallInfo *ci, int n, StkId *pos) { + StkId base = ci->func + 1; + const char *name = NULL; + if (isLua(ci)) { + if (n < 0) /* access to vararg values? */ + return findvararg(ci, n, pos); + else + name = luaF_getlocalname(ci_func(ci)->p, n, currentpc(ci)); + } + 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? */ + /* generic name for any valid slot */ + name = isLua(ci) ? "(temporary)" : "(C temporary)"; + } + else + return NULL; /* no name */ + } + if (pos) + *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(s2v(L->top - 1))) /* not a Lua function? */ + name = NULL; + else /* consider live variables at function start (parameters) */ + name = luaF_getlocalname(clLvalue(s2v(L->top - 1))->p, n, 0); + } + else { /* active function; get information through 'ar' */ + StkId pos = NULL; /* to avoid warnings */ + name = luaG_findlocal(L, ar->i_ci, n, &pos); + if (name) { + setobjs2s(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 = NULL; /* to avoid warnings */ + const char *name; + lua_lock(L); + name = luaG_findlocal(L, ar->i_ci, n, &pos); + 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->srclen = LL("=[C]"); + ar->linedefined = -1; + ar->lastlinedefined = -1; + ar->what = "C"; + } + else { + const Proto *p = cl->l.p; + if (p->source) { + ar->source = getstr(p->source); + ar->srclen = tsslen(p->source); + } + else { + ar->source = "=?"; + ar->srclen = LL("=?"); + } + ar->linedefined = p->linedefined; + ar->lastlinedefined = p->lastlinedefined; + ar->what = (ar->linedefined == 0) ? "main" : "Lua"; + } + luaO_chunkid(ar->short_src, ar->source, ar->srclen); +} + + +static int nextline (const Proto *p, int currentline, int pc) { + if (p->lineinfo[pc] != ABSLINEINFO) + return currentline + p->lineinfo[pc]; + else + return luaG_getfuncline(p, pc); +} + + +static void collectvalidlines (lua_State *L, Closure *f) { + if (noLuaClosure(f)) { + setnilvalue(s2v(L->top)); + api_incr_top(L); + } + else { + int i; + TValue v; + const Proto *p = f->l.p; + int currentline = p->linedefined; + Table *t = luaH_new(L); /* new table to store active lines */ + sethvalue2s(L, L->top, t); /* push it on stack */ + api_incr_top(L); + setbtvalue(&v); /* boolean 'true' to be the value of all indices */ + for (i = 0; i < p->sizelineinfo; i++) { /* for all instructions */ + currentline = nextline(p, currentline, i); /* get its line */ + luaH_setint(L, t, currentline, &v); /* table[line] = true */ + } + } +} + + +static const char *getfuncname (lua_State *L, CallInfo *ci, const char **name) { + if (ci == NULL) /* no 'ci'? */ + return NULL; /* no info */ + else if (ci->callstatus & CIST_FIN) { /* is this a finalizer? */ + *name = "__gc"; + return "metamethod"; /* report it as such */ + } + /* calling function is a known Lua function? */ + else if (!(ci->callstatus & CIST_TAIL) && isLua(ci->previous)) + return funcnamefromcode(L, ci->previous, name); + else return NULL; /* no way to find a name */ +} + + +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)) ? getcurrentline(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': { + ar->namewhat = getfuncname(L, ci, &ar->name); + if (ar->namewhat == NULL) { + ar->namewhat = ""; /* not found */ + ar->name = NULL; + } + break; + } + case 'r': { + if (ci == NULL || !(ci->callstatus & CIST_TRAN)) + ar->ftransfer = ar->ntransfer = 0; + else { + ar->ftransfer = ci->u2.transferinfo.ftransfer; + ar->ntransfer = ci->u2.transferinfo.ntransfer; + } + 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; + TValue *func; + lua_lock(L); + if (*what == '>') { + ci = NULL; + func = s2v(L->top - 1); + api_check(L, ttisfunction(func), "function expected"); + what++; /* skip the '>' */ + L->top--; /* pop function */ + } + else { + ci = ar->i_ci; + func = s2v(ci->func); + lua_assert(ttisfunction(func)); + } + cl = ttisclosure(func) ? clvalue(func) : NULL; + status = auxgetinfo(L, what, ar, cl, ci); + if (strchr(what, 'f')) { + setobj2s(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 (const Proto *p, int lastpc, int reg, + const char **name); + + +/* +** Find a "name" for the constant 'c'. +*/ +static void kname (const Proto *p, int c, const char **name) { + TValue *kvalue = &p->k[c]; + *name = (ttisstring(kvalue)) ? svalue(kvalue) : "?"; +} + + +/* +** Find a "name" for the register 'c'. +*/ +static void rname (const Proto *p, int pc, int c, const char **name) { + const char *what = getobjname(p, pc, c, name); /* search for 'c' */ + if (!(what && *what == 'c')) /* did not find a constant name? */ + *name = "?"; +} + + +/* +** Find a "name" for a 'C' value in an RK instruction. +*/ +static void rkname (const Proto *p, int pc, Instruction i, const char **name) { + int c = GETARG_C(i); /* key index */ + if (GETARG_k(i)) /* is 'c' a constant? */ + kname(p, c, name); + else /* 'c' is a register */ + rname(p, pc, c, name); +} + + +static int filterpc (int pc, int jmptarget) { + if (pc < jmptarget) /* is code conditional (inside a jump)? */ + return -1; /* cannot know who sets that register */ + else return pc; /* current position sets that register */ +} + + +/* +** Try to find last instruction before 'lastpc' that modified register 'reg'. +*/ +static int findsetreg (const Proto *p, int lastpc, int reg) { + int pc; + int setreg = -1; /* keep last instruction that changed 'reg' */ + int jmptarget = 0; /* any code before this address is conditional */ + if (testMMMode(GET_OPCODE(p->code[lastpc]))) + lastpc--; /* previous instruction was not actually executed */ + for (pc = 0; pc < lastpc; pc++) { + Instruction i = p->code[pc]; + OpCode op = GET_OPCODE(i); + int a = GETARG_A(i); + int change; /* true if current instruction changed 'reg' */ + switch (op) { + case OP_LOADNIL: { /* set registers from 'a' to 'a+b' */ + int b = GETARG_B(i); + change = (a <= reg && reg <= a + b); + break; + } + case OP_TFORCALL: { /* affect all regs above its base */ + change = (reg >= a + 2); + break; + } + case OP_CALL: + case OP_TAILCALL: { /* affect all registers above base */ + change = (reg >= a); + break; + } + case OP_JMP: { /* doesn't change registers, but changes 'jmptarget' */ + int b = GETARG_sJ(i); + int dest = pc + 1 + b; + /* jump does not skip 'lastpc' and is larger than current one? */ + if (dest <= lastpc && dest > jmptarget) + jmptarget = dest; /* update 'jmptarget' */ + change = 0; + break; + } + default: /* any instruction that sets A */ + change = (testAMode(op) && reg == a); + break; + } + if (change) + setreg = filterpc(pc, jmptarget); + } + return setreg; +} + + +/* +** Check whether table being indexed by instruction 'i' is the +** environment '_ENV' +*/ +static const char *gxf (const Proto *p, int pc, Instruction i, int isup) { + int t = GETARG_B(i); /* table index */ + const char *name; /* name of indexed variable */ + if (isup) /* is an upvalue? */ + name = upvalname(p, t); + else + getobjname(p, pc, t, &name); + return (name && strcmp(name, LUA_ENV) == 0) ? "global" : "field"; +} + + +static const char *getobjname (const 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: { + int k = GETARG_C(i); /* key index */ + kname(p, k, name); + return gxf(p, pc, i, 1); + } + case OP_GETTABLE: { + int k = GETARG_C(i); /* key index */ + rname(p, pc, k, name); + return gxf(p, pc, i, 0); + } + case OP_GETI: { + *name = "integer index"; + return "field"; + } + case OP_GETFIELD: { + int k = GETARG_C(i); /* key index */ + kname(p, k, name); + return gxf(p, pc, i, 0); + } + 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: { + rkname(p, pc, i, name); + return "method"; + } + default: break; /* go through to return NULL */ + } + } + return NULL; /* could not find reasonable name */ +} + + +/* +** Try to find a name for a function based on the code that called it. +** (Only works when function was called by a Lua function.) +** Returns what the name is (e.g., "for iterator", "method", +** "metamethod") and sets '*name' to point to the name. +*/ +static const char *funcnamefromcode (lua_State *L, CallInfo *ci, + const char **name) { + TMS tm = (TMS)0; /* (initial value avoids warnings) */ + const Proto *p = ci_func(ci)->p; /* calling function */ + int pc = currentpc(ci); /* calling instruction index */ + Instruction i = p->code[pc]; /* calling instruction */ + if (ci->callstatus & CIST_HOOKED) { /* was it called inside a hook? */ + *name = "?"; + return "hook"; + } + switch (GET_OPCODE(i)) { + case OP_CALL: + case OP_TAILCALL: + return getobjname(p, pc, GETARG_A(i), name); /* get function name */ + case OP_TFORCALL: { /* for iterator */ + *name = "for iterator"; + return "for iterator"; + } + /* other instructions can do calls through metamethods */ + case OP_SELF: case OP_GETTABUP: case OP_GETTABLE: + case OP_GETI: case OP_GETFIELD: + tm = TM_INDEX; + break; + case OP_SETTABUP: case OP_SETTABLE: case OP_SETI: case OP_SETFIELD: + tm = TM_NEWINDEX; + break; + case OP_MMBIN: case OP_MMBINI: case OP_MMBINK: { + tm = cast(TMS, GETARG_C(i)); + break; + } + case OP_UNM: tm = TM_UNM; break; + case OP_BNOT: tm = TM_BNOT; break; + case OP_LEN: tm = TM_LEN; break; + case OP_CONCAT: tm = TM_CONCAT; break; + case OP_EQ: tm = TM_EQ; break; + /* no cases for OP_EQI and OP_EQK, as they don't call metamethods */ + case OP_LT: case OP_LTI: case OP_GTI: tm = TM_LT; break; + case OP_LE: case OP_LEI: case OP_GEI: tm = TM_LE; break; + case OP_CLOSE: case OP_RETURN: tm = TM_CLOSE; break; + default: + return NULL; /* cannot find a reasonable name */ + } + *name = getstr(G(L)->tmname[tm]) + 2; + return "metamethod"; +} + +/* }====================================================== */ + + + +/* +** Check whether pointer 'o' points to some value in the stack +** frame of the current function. Because 'o' may not point to a +** value in this stack, we cannot compare it with the region +** boundaries (undefined behaviour in ISO C). +*/ +static int isinstack (CallInfo *ci, const TValue *o) { + StkId pos; + for (pos = ci->func + 1; pos < ci->top; pos++) { + if (o == s2v(pos)) + return 1; + } + return 0; /* not found */ +} + + +/* +** Checks whether value 'o' came from an upvalue. (That can only happen +** with instructions OP_GETTABUP/OP_SETTABUP, which operate directly on +** upvalues.) +*/ +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; +} + + +static const char *varinfo (lua_State *L, const TValue *o) { + const char *name = NULL; /* to avoid warnings */ + CallInfo *ci = L->ci; + 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(cast(StkId, o) - (ci->func + 1)), &name); + } + return (kind) ? luaO_pushfstring(L, " (%s '%s')", kind, name) : ""; +} + + +l_noret luaG_typeerror (lua_State *L, const TValue *o, const char *op) { + const char *t = luaT_objtypename(L, o); + luaG_runerror(L, "attempt to %s a %s value%s", op, t, varinfo(L, o)); +} + + +l_noret luaG_callerror (lua_State *L, const TValue *o) { + CallInfo *ci = L->ci; + const char *name = NULL; /* to avoid warnings */ + const char *what = (isLua(ci)) ? funcnamefromcode(L, ci, &name) : NULL; + if (what != NULL) { + const char *t = luaT_objtypename(L, o); + luaG_runerror(L, "%s '%s' is not callable (a %s value)", what, name, t); + } + else + luaG_typeerror(L, o, "call"); +} + + +l_noret luaG_forerror (lua_State *L, const TValue *o, const char *what) { + luaG_runerror(L, "bad 'for' %s (number expected, got %s)", + what, luaT_objtypename(L, o)); +} + + +l_noret luaG_concaterror (lua_State *L, const TValue *p1, const TValue *p2) { + if (ttisstring(p1) || cvt2str(p1)) p1 = p2; + luaG_typeerror(L, p1, "concatenate"); +} + + +l_noret luaG_opinterror (lua_State *L, const TValue *p1, + const TValue *p2, const char *msg) { + if (!ttisnumber(p1)) /* first operand is wrong? */ + p2 = p1; /* now second is wrong */ + luaG_typeerror(L, p2, msg); +} + + +/* +** Error when both values are convertible to numbers, but not to integers +*/ +l_noret luaG_tointerror (lua_State *L, const TValue *p1, const TValue *p2) { + lua_Integer temp; + if (!luaV_tointegerns(p1, &temp, LUA_FLOORN2I)) + p2 = p1; + luaG_runerror(L, "number%s has no integer representation", varinfo(L, p2)); +} + + +l_noret luaG_ordererror (lua_State *L, const TValue *p1, const TValue *p2) { + const char *t1 = luaT_objtypename(L, p1); + const char *t2 = luaT_objtypename(L, p2); + if (strcmp(t1, t2) == 0) + luaG_runerror(L, "attempt to compare two %s values", t1); + else + luaG_runerror(L, "attempt to compare %s with %s", t1, t2); +} + + +/* add src:line information to 'msg' */ +const char *luaG_addinfo (lua_State *L, const char *msg, TString *src, + int line) { + char buff[LUA_IDSIZE]; + if (src) + luaO_chunkid(buff, getstr(src), tsslen(src)); + else { /* no source available; use "?" instead */ + buff[0] = '?'; buff[1] = '\0'; + } + return 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); + lua_assert(ttisfunction(s2v(errfunc))); + setobjs2s(L, L->top, L->top - 1); /* move argument */ + setobjs2s(L, L->top - 1, errfunc); /* push function */ + L->top++; /* assume EXTRA_STACK */ + luaD_callnoyield(L, L->top - 2, 1); /* call it */ + } + luaD_throw(L, LUA_ERRRUN); +} + + +l_noret luaG_runerror (lua_State *L, const char *fmt, ...) { + CallInfo *ci = L->ci; + const char *msg; + va_list argp; + luaC_checkGC(L); /* error message uses memory */ + va_start(argp, fmt); + msg = luaO_pushvfstring(L, fmt, argp); /* format message */ + va_end(argp); + if (isLua(ci)) /* if Lua function, add source:line information */ + luaG_addinfo(L, msg, ci_func(ci)->p->source, getcurrentline(ci)); + luaG_errormsg(L); +} + + +/* +** Check whether new instruction 'newpc' is in a different line from +** previous instruction 'oldpc'. More often than not, 'newpc' is only +** one or a few instructions after 'oldpc' (it must be after, see +** caller), so try to avoid calling 'luaG_getfuncline'. If they are +** too far apart, there is a good chance of a ABSLINEINFO in the way, +** so it goes directly to 'luaG_getfuncline'. +*/ +static int changedline (const Proto *p, int oldpc, int newpc) { + if (p->lineinfo == NULL) /* no debug information? */ + return 0; + if (newpc - oldpc < MAXIWTHABS / 2) { /* not too far apart? */ + int delta = 0; /* line diference */ + int pc = oldpc; + for (;;) { + int lineinfo = p->lineinfo[++pc]; + if (lineinfo == ABSLINEINFO) + break; /* cannot compute delta; fall through */ + delta += lineinfo; + if (pc == newpc) + return (delta != 0); /* delta computed successfully */ + } + } + /* either instructions are too far apart or there is an absolute line + info in the way; compute line difference explicitly */ + return (luaG_getfuncline(p, oldpc) != luaG_getfuncline(p, newpc)); +} + + +/* +** Traces the execution of a Lua function. Called before the execution +** of each opcode, when debug is on. 'L->oldpc' stores the last +** instruction traced, to detect line changes. When entering a new +** function, 'npci' will be zero and will test as a new line whatever +** the value of 'oldpc'. Some exceptional conditions may return to +** a function without setting 'oldpc'. In that case, 'oldpc' may be +** invalid; if so, use zero as a valid value. (A wrong but valid 'oldpc' +** at most causes an extra call to a line hook.) +** This function is not "Protected" when called, so it should correct +** 'L->top' before calling anything that can run the GC. +*/ +int luaG_traceexec (lua_State *L, const Instruction *pc) { + CallInfo *ci = L->ci; + lu_byte mask = L->hookmask; + const Proto *p = ci_func(ci)->p; + int counthook; + if (!(mask & (LUA_MASKLINE | LUA_MASKCOUNT))) { /* no hooks? */ + ci->u.l.trap = 0; /* don't need to stop again */ + return 0; /* turn off 'trap' */ + } + pc++; /* reference is always next instruction */ + ci->u.l.savedpc = pc; /* save 'pc' */ + counthook = (--L->hookcount == 0 && (mask & LUA_MASKCOUNT)); + if (counthook) + resethookcount(L); /* reset count */ + else if (!(mask & LUA_MASKLINE)) + return 1; /* no line hook and count != 0; nothing to be done now */ + if (ci->callstatus & CIST_HOOKYIELD) { /* called hook last time? */ + ci->callstatus &= ~CIST_HOOKYIELD; /* erase mark */ + return 1; /* do not call hook again (VM yielded, so it did not move) */ + } + if (!isIT(*(ci->u.l.savedpc - 1))) /* top not being used? */ + L->top = ci->top; /* correct top */ + if (counthook) + luaD_hook(L, LUA_HOOKCOUNT, -1, 0, 0); /* call count hook */ + if (mask & LUA_MASKLINE) { + /* 'L->oldpc' may be invalid; use zero in this case */ + int oldpc = (L->oldpc < p->sizecode) ? L->oldpc : 0; + int npci = pcRel(pc, p); + if (npci <= oldpc || /* call hook when jump back (loop), */ + changedline(p, oldpc, npci)) { /* or when enter new line */ + int newline = luaG_getfuncline(p, npci); + luaD_hook(L, LUA_HOOKLINE, newline, 0, 0); /* call line hook */ + } + L->oldpc = npci; /* 'pc' of last call to line hook */ + } + 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 */ + luaD_throw(L, LUA_YIELD); + } + return 1; /* keep 'trap' on */ +} + diff --git a/lua-5.4.3/src/ldebug.h b/lua-5.4.3/src/ldebug.h new file mode 100644 index 0000000..974960e --- /dev/null +++ b/lua-5.4.3/src/ldebug.h @@ -0,0 +1,63 @@ +/* +** $Id: ldebug.h $ +** 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) + + +/* Active Lua function (given call info) */ +#define ci_func(ci) (clLvalue(s2v((ci)->func))) + + +#define resethookcount(L) (L->hookcount = L->basehookcount) + +/* +** mark for entries in 'lineinfo' array that has absolute information in +** 'abslineinfo' array +*/ +#define ABSLINEINFO (-0x80) + + +/* +** MAXimum number of successive Instructions WiTHout ABSolute line +** information. (A power of two allows fast divisions.) +*/ +#if !defined(MAXIWTHABS) +#define MAXIWTHABS 128 +#endif + + +LUAI_FUNC int luaG_getfuncline (const Proto *f, int pc); +LUAI_FUNC const char *luaG_findlocal (lua_State *L, CallInfo *ci, int n, + StkId *pos); +LUAI_FUNC l_noret luaG_typeerror (lua_State *L, const TValue *o, + const char *opname); +LUAI_FUNC l_noret luaG_callerror (lua_State *L, const TValue *o); +LUAI_FUNC l_noret luaG_forerror (lua_State *L, const TValue *o, + const char *what); +LUAI_FUNC l_noret luaG_concaterror (lua_State *L, const TValue *p1, + const TValue *p2); +LUAI_FUNC l_noret luaG_opinterror (lua_State *L, const TValue *p1, + const TValue *p2, + const char *msg); +LUAI_FUNC l_noret luaG_tointerror (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 const char *luaG_addinfo (lua_State *L, const char *msg, + TString *src, int line); +LUAI_FUNC l_noret luaG_errormsg (lua_State *L); +LUAI_FUNC int luaG_traceexec (lua_State *L, const Instruction *pc); + + +#endif diff --git a/lua-5.4.3/src/ldo.c b/lua-5.4.3/src/ldo.c new file mode 100644 index 0000000..7135079 --- /dev/null +++ b/lua-5.4.3/src/ldo.c @@ -0,0 +1,963 @@ +/* +** $Id: ldo.c $ +** Stack and Call structure of Lua +** See Copyright Notice in lua.h +*/ + +#define ldo_c +#define LUA_CORE + +#include "lprefix.h" + + +#include +#include +#include + +#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" + + + +#define errorstatus(s) ((s) > LUA_YIELD) + + +/* +** {====================================================== +** 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_POSIX) /* }{ */ + +/* in POSIX, 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 /* }{ */ + +/* ISO C 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 */ +}; + + +void luaD_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; + } + case LUA_OK: { /* special case only for closing upvalues */ + setnilvalue(s2v(oldtop)); /* no error message */ + break; + } + default: { + lua_assert(errorstatus(errcode)); /* real error */ + 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 */ + global_State *g = G(L); + errcode = luaE_resetthread(L, errcode); /* close all upvalues */ + if (g->mainthread->errorJmp) { /* main thread has a handler? */ + setobjs2s(L, g->mainthread->top++, L->top - 1); /* copy error obj. */ + luaD_throw(g->mainthread, errcode); /* re-throw in main thread */ + } + else { /* no handler at all; abort */ + if (g->panic) { /* panic function? */ + lua_unlock(L); + g->panic(L); /* call panic function (last chance to jump out) */ + } + abort(); + } + } +} + + +int luaD_rawrunprotected (lua_State *L, Pfunc f, void *ud) { + l_uint32 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; +} + +/* }====================================================== */ + + +/* +** {================================================================== +** Stack reallocation +** =================================================================== +*/ +static void correctstack (lua_State *L, StkId oldstack, StkId newstack) { + CallInfo *ci; + UpVal *up; + L->top = (L->top - oldstack) + newstack; + L->tbclist = (L->tbclist - oldstack) + newstack; + for (up = L->openupval; up != NULL; up = up->u.open.next) + up->v = s2v((uplevel(up) - oldstack) + newstack); + for (ci = L->ci; ci != NULL; ci = ci->previous) { + ci->top = (ci->top - oldstack) + newstack; + ci->func = (ci->func - oldstack) + newstack; + if (isLua(ci)) + ci->u.l.trap = 1; /* signal to update 'trap' in 'luaV_execute' */ + } +} + + +/* some space for error handling */ +#define ERRORSTACKSIZE (LUAI_MAXSTACK + 200) + + +/* +** Reallocate the stack to a new size, correcting all pointers into +** it. (There are pointers to a stack from its upvalues, from its list +** of call infos, plus a few individual pointers.) The reallocation is +** done in two steps (allocation + free) because the correction must be +** done while both addresses (the old stack and the new one) are valid. +** (In ISO C, any pointer use after the pointer has been deallocated is +** undefined behavior.) +** In case of allocation error, raise an error or return false according +** to 'raiseerror'. +*/ +int luaD_reallocstack (lua_State *L, int newsize, int raiseerror) { + int oldsize = stacksize(L); + int i; + StkId newstack = luaM_reallocvector(L, NULL, 0, + newsize + EXTRA_STACK, StackValue); + lua_assert(newsize <= LUAI_MAXSTACK || newsize == ERRORSTACKSIZE); + if (l_unlikely(newstack == NULL)) { /* reallocation failed? */ + if (raiseerror) + luaM_error(L); + else return 0; /* do not raise an error */ + } + /* number of elements to be copied to the new stack */ + i = ((oldsize <= newsize) ? oldsize : newsize) + EXTRA_STACK; + memcpy(newstack, L->stack, i * sizeof(StackValue)); + for (; i < newsize + EXTRA_STACK; i++) + setnilvalue(s2v(newstack + i)); /* erase new segment */ + correctstack(L, L->stack, newstack); + luaM_freearray(L, L->stack, oldsize + EXTRA_STACK); + L->stack = newstack; + L->stack_last = L->stack + newsize; + return 1; +} + + +/* +** Try to grow the stack by at least 'n' elements. when 'raiseerror' +** is true, raises any error; otherwise, return 0 in case of errors. +*/ +int luaD_growstack (lua_State *L, int n, int raiseerror) { + int size = stacksize(L); + if (l_unlikely(size > LUAI_MAXSTACK)) { + /* if stack is larger than maximum, thread is already using the + extra space reserved for errors, that is, thread is handling + a stack error; cannot grow further than that. */ + lua_assert(stacksize(L) == ERRORSTACKSIZE); + if (raiseerror) + luaD_throw(L, LUA_ERRERR); /* error inside message handler */ + return 0; /* if not 'raiseerror', just signal it */ + } + else { + int newsize = 2 * size; /* tentative new size */ + int needed = cast_int(L->top - L->stack) + n; + if (newsize > LUAI_MAXSTACK) /* cannot cross the limit */ + newsize = LUAI_MAXSTACK; + if (newsize < needed) /* but must respect what was asked for */ + newsize = needed; + if (l_likely(newsize <= LUAI_MAXSTACK)) + return luaD_reallocstack(L, newsize, raiseerror); + else { /* stack overflow */ + /* add extra size to be able to handle the error message */ + luaD_reallocstack(L, ERRORSTACKSIZE, raiseerror); + if (raiseerror) + luaG_runerror(L, "stack overflow"); + return 0; + } + } +} + + +static int stackinuse (lua_State *L) { + CallInfo *ci; + int res; + StkId lim = L->top; + for (ci = L->ci; ci != NULL; ci = ci->previous) { + if (lim < ci->top) lim = ci->top; + } + lua_assert(lim <= L->stack_last); + res = cast_int(lim - L->stack) + 1; /* part of stack in use */ + if (res < LUA_MINSTACK) + res = LUA_MINSTACK; /* ensure a minimum size */ + return res; +} + + +/* +** If stack size is more than 3 times the current use, reduce that size +** to twice the current use. (So, the final stack size is at most 2/3 the +** previous size, and half of its entries are empty.) +** As a particular case, if stack was handling a stack overflow and now +** it is not, 'max' (limited by LUAI_MAXSTACK) will be smaller than +** stacksize (equal to ERRORSTACKSIZE in this case), and so the stack +** will be reduced to a "regular" size. +*/ +void luaD_shrinkstack (lua_State *L) { + int inuse = stackinuse(L); + int nsize = inuse * 2; /* proposed new size */ + int max = inuse * 3; /* maximum "reasonable" size */ + if (max > LUAI_MAXSTACK) { + max = LUAI_MAXSTACK; /* respect stack limit */ + if (nsize > LUAI_MAXSTACK) + nsize = LUAI_MAXSTACK; + } + /* if thread is currently not handling a stack overflow and its + size is larger than maximum "reasonable" size, shrink it */ + if (inuse <= LUAI_MAXSTACK && stacksize(L) > max) + luaD_reallocstack(L, nsize, 0); /* ok if that fails */ + else /* don't change stack */ + condmovestack(L,{},{}); /* (change only for debugging) */ + luaE_shrinkCI(L); /* shrink CI list */ +} + + +void luaD_inctop (lua_State *L) { + luaD_checkstack(L, 1); + L->top++; +} + +/* }================================================================== */ + + +/* +** Call a hook for the given event. Make sure there is a hook to be +** called. (Both 'L->hook' and 'L->hookmask', which trigger this +** function, can be changed asynchronously by signals.) +*/ +void luaD_hook (lua_State *L, int event, int line, + int ftransfer, int ntransfer) { + lua_Hook hook = L->hook; + if (hook && L->allowhook) { /* make sure there is a hook */ + int mask = CIST_HOOKED; + CallInfo *ci = L->ci; + ptrdiff_t top = savestack(L, L->top); /* preserve original 'top' */ + ptrdiff_t ci_top = savestack(L, ci->top); /* idem for 'ci->top' */ + lua_Debug ar; + ar.event = event; + ar.currentline = line; + ar.i_ci = ci; + if (ntransfer != 0) { + mask |= CIST_TRAN; /* 'ci' has transfer information */ + ci->u2.transferinfo.ftransfer = ftransfer; + ci->u2.transferinfo.ntransfer = ntransfer; + } + if (isLua(ci) && L->top < ci->top) + L->top = ci->top; /* protect entire activation register */ + luaD_checkstack(L, LUA_MINSTACK); /* ensure minimum stack size */ + if (ci->top < L->top + LUA_MINSTACK) + ci->top = L->top + LUA_MINSTACK; + L->allowhook = 0; /* cannot call hooks inside a hook */ + ci->callstatus |= mask; + 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 &= ~mask; + } +} + + +/* +** Executes a call hook for Lua functions. This function is called +** whenever 'hookmask' is not zero, so it checks whether call hooks are +** active. +*/ +void luaD_hookcall (lua_State *L, CallInfo *ci) { + L->oldpc = 0; /* set 'oldpc' for new function */ + if (L->hookmask & LUA_MASKCALL) { /* is call hook on? */ + int event = (ci->callstatus & CIST_TAIL) ? LUA_HOOKTAILCALL + : LUA_HOOKCALL; + Proto *p = ci_func(ci)->p; + ci->u.l.savedpc++; /* hooks assume 'pc' is already incremented */ + luaD_hook(L, event, -1, 1, p->numparams); + ci->u.l.savedpc--; /* correct 'pc' */ + } +} + + +/* +** Executes a return hook for Lua and C functions and sets/corrects +** 'oldpc'. (Note that this correction is needed by the line hook, so it +** is done even when return hooks are off.) +*/ +static void rethook (lua_State *L, CallInfo *ci, int nres) { + if (L->hookmask & LUA_MASKRET) { /* is return hook on? */ + StkId firstres = L->top - nres; /* index of first result */ + int delta = 0; /* correction for vararg functions */ + int ftransfer; + if (isLua(ci)) { + Proto *p = ci_func(ci)->p; + if (p->is_vararg) + delta = ci->u.l.nextraargs + p->numparams + 1; + } + ci->func += delta; /* if vararg, back to virtual 'func' */ + ftransfer = cast(unsigned short, firstres - ci->func); + luaD_hook(L, LUA_HOOKRET, -1, ftransfer, nres); /* call it */ + ci->func -= delta; + } + if (isLua(ci = ci->previous)) + L->oldpc = pcRel(ci->u.l.savedpc, ci_func(ci)->p); /* set 'oldpc' */ +} + + +/* +** Check whether 'func' has a '__call' metafield. If so, put it in the +** stack, below original 'func', so that 'luaD_precall' can call it. Raise +** an error if there is no '__call' metafield. +*/ +void luaD_tryfuncTM (lua_State *L, StkId func) { + const TValue *tm = luaT_gettmbyobj(L, s2v(func), TM_CALL); + StkId p; + if (l_unlikely(ttisnil(tm))) + luaG_callerror(L, s2v(func)); /* nothing to call */ + for (p = L->top; p > func; p--) /* open space for metamethod */ + setobjs2s(L, p, p-1); + L->top++; /* stack space pre-allocated by the caller */ + setobj2s(L, func, tm); /* metamethod is the new function to be called */ +} + + +/* +** Given 'nres' results at 'firstResult', move 'wanted' of them to 'res'. +** Handle most typical cases (zero results for commands, one result for +** expressions, multiple results for tail calls/single parameters) +** separated. +*/ +static void moveresults (lua_State *L, StkId res, int nres, int wanted) { + StkId firstresult; + int i; + switch (wanted) { /* handle typical cases separately */ + case 0: /* no values needed */ + L->top = res; + return; + case 1: /* one value needed */ + if (nres == 0) /* no results? */ + setnilvalue(s2v(res)); /* adjust with nil */ + else /* at least one result */ + setobjs2s(L, res, L->top - nres); /* move it to proper place */ + L->top = res + 1; + return; + case LUA_MULTRET: + wanted = nres; /* we want all results */ + break; + default: /* two/more results and/or to-be-closed variables */ + if (hastocloseCfunc(wanted)) { /* to-be-closed variables? */ + ptrdiff_t savedres = savestack(L, res); + L->ci->callstatus |= CIST_CLSRET; /* in case of yields */ + L->ci->u2.nres = nres; + luaF_close(L, res, CLOSEKTOP, 1); + L->ci->callstatus &= ~CIST_CLSRET; + if (L->hookmask) /* if needed, call hook after '__close's */ + rethook(L, L->ci, nres); + res = restorestack(L, savedres); /* close and hook can move stack */ + wanted = decodeNresults(wanted); + if (wanted == LUA_MULTRET) + wanted = nres; /* we want all results */ + } + break; + } + /* generic case */ + firstresult = L->top - nres; /* index of first result */ + if (nres > wanted) /* extra results? */ + nres = wanted; /* don't need them */ + for (i = 0; i < nres; i++) /* move all results to correct place */ + setobjs2s(L, res + i, firstresult + i); + for (; i < wanted; i++) /* complete wanted number of results */ + setnilvalue(s2v(res + i)); + L->top = res + wanted; /* top points after the last result */ +} + + +/* +** Finishes a function call: calls hook if necessary, moves current +** number of results to proper place, and returns to previous call +** info. If function has to close variables, hook must be called after +** that. +*/ +void luaD_poscall (lua_State *L, CallInfo *ci, int nres) { + int wanted = ci->nresults; + if (l_unlikely(L->hookmask && !hastocloseCfunc(wanted))) + rethook(L, ci, nres); + /* move results to proper place */ + moveresults(L, ci->func, nres, wanted); + /* function cannot be in any of these cases when returning */ + lua_assert(!(ci->callstatus & + (CIST_HOOKED | CIST_YPCALL | CIST_FIN | CIST_TRAN | CIST_CLSRET))); + L->ci = ci->previous; /* back to caller (after closing variables) */ +} + + + +#define next_ci(L) (L->ci->next ? L->ci->next : luaE_extendCI(L)) + + +/* +** Prepare a function for a tail call, building its call info on top +** of the current call info. 'narg1' is the number of arguments plus 1 +** (so that it includes the function itself). +*/ +void luaD_pretailcall (lua_State *L, CallInfo *ci, StkId func, int narg1) { + Proto *p = clLvalue(s2v(func))->p; + int fsize = p->maxstacksize; /* frame size */ + int nfixparams = p->numparams; + int i; + for (i = 0; i < narg1; i++) /* move down function and arguments */ + setobjs2s(L, ci->func + i, func + i); + checkstackGC(L, fsize); + func = ci->func; /* moved-down function */ + for (; narg1 <= nfixparams; narg1++) + setnilvalue(s2v(func + narg1)); /* complete missing arguments */ + ci->top = func + 1 + fsize; /* top for new function */ + lua_assert(ci->top <= L->stack_last); + ci->u.l.savedpc = p->code; /* starting point */ + ci->callstatus |= CIST_TAIL; + L->top = func + narg1; /* set top */ +} + + +/* +** Prepares the call to a function (C or Lua). For C functions, also do +** the call. The function to be called is at '*func'. The arguments +** are on the stack, right after the function. Returns the CallInfo +** to be executed, if it was a Lua function. Otherwise (a C function) +** returns NULL, with all the results on the stack, starting at the +** original function position. +*/ +CallInfo *luaD_precall (lua_State *L, StkId func, int nresults) { + lua_CFunction f; + retry: + switch (ttypetag(s2v(func))) { + case LUA_VCCL: /* C closure */ + f = clCvalue(s2v(func))->f; + goto Cfunc; + case LUA_VLCF: /* light C function */ + f = fvalue(s2v(func)); + Cfunc: { + int n; /* number of returns */ + CallInfo *ci; + checkstackGCp(L, LUA_MINSTACK, func); /* ensure minimum stack size */ + L->ci = ci = next_ci(L); + ci->nresults = nresults; + ci->callstatus = CIST_C; + ci->top = L->top + LUA_MINSTACK; + ci->func = func; + lua_assert(ci->top <= L->stack_last); + if (l_unlikely(L->hookmask & LUA_MASKCALL)) { + int narg = cast_int(L->top - func) - 1; + luaD_hook(L, LUA_HOOKCALL, -1, 1, narg); + } + lua_unlock(L); + n = (*f)(L); /* do the actual call */ + lua_lock(L); + api_checknelems(L, n); + luaD_poscall(L, ci, n); + return NULL; + } + case LUA_VLCL: { /* Lua function */ + CallInfo *ci; + Proto *p = clLvalue(s2v(func))->p; + int narg = cast_int(L->top - func) - 1; /* number of real arguments */ + int nfixparams = p->numparams; + int fsize = p->maxstacksize; /* frame size */ + checkstackGCp(L, fsize, func); + L->ci = ci = next_ci(L); + ci->nresults = nresults; + ci->u.l.savedpc = p->code; /* starting point */ + ci->top = func + 1 + fsize; + ci->func = func; + L->ci = ci; + for (; narg < nfixparams; narg++) + setnilvalue(s2v(L->top++)); /* complete missing arguments */ + lua_assert(ci->top <= L->stack_last); + return ci; + } + default: { /* not a function */ + checkstackGCp(L, 1, func); /* space for metamethod */ + luaD_tryfuncTM(L, func); /* try to get '__call' metamethod */ + goto retry; /* try again with metamethod */ + } + } +} + + +/* +** Call a function (C or Lua) through C. 'inc' can be 1 (increment +** number of recursive invocations in the C stack) or nyci (the same +** plus increment number of non-yieldable calls). +*/ +static void ccall (lua_State *L, StkId func, int nResults, int inc) { + CallInfo *ci; + L->nCcalls += inc; + if (l_unlikely(getCcalls(L) >= LUAI_MAXCCALLS)) + luaE_checkcstack(L); + if ((ci = luaD_precall(L, func, nResults)) != NULL) { /* Lua function? */ + ci->callstatus = CIST_FRESH; /* mark that it is a "fresh" execute */ + luaV_execute(L, ci); /* call it */ + } + L->nCcalls -= inc; +} + + +/* +** External interface for 'ccall' +*/ +void luaD_call (lua_State *L, StkId func, int nResults) { + ccall(L, func, nResults, 1); +} + + +/* +** Similar to 'luaD_call', but does not allow yields during the call. +*/ +void luaD_callnoyield (lua_State *L, StkId func, int nResults) { + ccall(L, func, nResults, nyci); +} + + +/* +** Finish the job of 'lua_pcallk' after it was interrupted by an yield. +** (The caller, 'finishCcall', does the final call to 'adjustresults'.) +** The main job is to complete the 'luaD_pcall' called by 'lua_pcallk'. +** If a '__close' method yields here, eventually control will be back +** to 'finishCcall' (when that '__close' method finally returns) and +** 'finishpcallk' will run again and close any still pending '__close' +** methods. Similarly, if a '__close' method errs, 'precover' calls +** 'unroll' which calls ''finishCcall' and we are back here again, to +** close any pending '__close' methods. +** Note that, up to the call to 'luaF_close', the corresponding +** 'CallInfo' is not modified, so that this repeated run works like the +** first one (except that it has at least one less '__close' to do). In +** particular, field CIST_RECST preserves the error status across these +** multiple runs, changing only if there is a new error. +*/ +static int finishpcallk (lua_State *L, CallInfo *ci) { + int status = getcistrecst(ci); /* get original status */ + if (l_likely(status == LUA_OK)) /* no error? */ + status = LUA_YIELD; /* was interrupted by an yield */ + else { /* error */ + StkId func = restorestack(L, ci->u2.funcidx); + L->allowhook = getoah(ci->callstatus); /* restore 'allowhook' */ + luaF_close(L, func, status, 1); /* can yield or raise an error */ + func = restorestack(L, ci->u2.funcidx); /* stack may be moved */ + luaD_seterrorobj(L, status, func); + luaD_shrinkstack(L); /* restore stack size in case of overflow */ + setcistrecst(ci, LUA_OK); /* clear original status */ + } + ci->callstatus &= ~CIST_YPCALL; + L->errfunc = ci->u.c.old_errfunc; + /* if it is here, there were errors or yields; unlike 'lua_pcallk', + do not change status */ + return status; +} + + +/* +** Completes the execution of a C function interrupted by an yield. +** The interruption must have happened while the function was either +** closing its tbc variables in 'moveresults' or executing +** 'lua_callk'/'lua_pcallk'. In the first case, it just redoes +** 'luaD_poscall'. In the second case, the call to 'finishpcallk' +** finishes the interrupted execution of 'lua_pcallk'. After that, it +** calls the continuation of the interrupted function and finally it +** completes the job of the 'luaD_call' that called the function. In +** the call to 'adjustresults', we do not know the number of results +** of the function called by 'lua_callk'/'lua_pcallk', so we are +** conservative and use LUA_MULTRET (always adjust). +*/ +static void finishCcall (lua_State *L, CallInfo *ci) { + int n; /* actual number of results from C function */ + if (ci->callstatus & CIST_CLSRET) { /* was returning? */ + lua_assert(hastocloseCfunc(ci->nresults)); + n = ci->u2.nres; /* just redo 'luaD_poscall' */ + /* don't need to reset CIST_CLSRET, as it will be set again anyway */ + } + else { + int status = LUA_YIELD; /* default if there were no errors */ + /* must have a continuation and must be able to call it */ + lua_assert(ci->u.c.k != NULL && yieldable(L)); + if (ci->callstatus & CIST_YPCALL) /* was inside a 'lua_pcallk'? */ + status = finishpcallk(L, ci); /* finish it */ + adjustresults(L, LUA_MULTRET); /* finish 'lua_callk' */ + lua_unlock(L); + n = (*ci->u.c.k)(L, status, ci->u.c.ctx); /* call continuation */ + lua_lock(L); + api_checknelems(L, n); + } + luaD_poscall(L, ci, n); /* finish 'luaD_call' */ +} + + +/* +** Executes "full continuation" (everything in the stack) of a +** previously interrupted coroutine until the stack is empty (or another +** interruption long-jumps out of the loop). +*/ +static void unroll (lua_State *L, void *ud) { + CallInfo *ci; + UNUSED(ud); + while ((ci = L->ci) != &L->base_ci) { /* something in the stack */ + if (!isLua(ci)) /* C function? */ + finishCcall(L, ci); /* complete its execution */ + else { /* Lua function */ + luaV_finishOp(L); /* finish interrupted instruction */ + luaV_execute(L, ci); /* execute down to higher C 'boundary' */ + } + } +} + + +/* +** Try to find a suspended protected call (a "recover point") for the +** given thread. +*/ +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 */ +} + + +/* +** Signal an error in the call to 'lua_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 int resume_error (lua_State *L, const char *msg, int narg) { + L->top -= narg; /* remove args from the stack */ + setsvalue2s(L, L->top, luaS_new(L, msg)); /* push error message */ + api_incr_top(L); + lua_unlock(L); + return LUA_ERRRUN; +} + + +/* +** Do the work for 'lua_resume' in protected mode. Most of the work +** depends on the status of the coroutine: initial state, suspended +** inside a hook, or regularly suspended (optionally with a continuation +** function), plus erroneous cases: non-suspended coroutine or dead +** coroutine. +*/ +static void resume (lua_State *L, void *ud) { + int n = *(cast(int*, ud)); /* number of arguments */ + StkId firstArg = L->top - n; /* first argument */ + CallInfo *ci = L->ci; + if (L->status == LUA_OK) /* starting a coroutine? */ + ccall(L, firstArg - 1, LUA_MULTRET, 1); /* just call its body */ + else { /* resuming from previous yield */ + lua_assert(L->status == LUA_YIELD); + L->status = LUA_OK; /* mark that it is running (again) */ + luaE_incCstack(L); /* control the C stack */ + if (isLua(ci)) { /* yielded inside a hook? */ + L->top = firstArg; /* discard arguments */ + luaV_execute(L, ci); /* just continue running Lua code */ + } + else { /* 'common' yield */ + if (ci->u.c.k != NULL) { /* does it have a continuation function? */ + lua_unlock(L); + n = (*ci->u.c.k)(L, LUA_YIELD, ci->u.c.ctx); /* call continuation */ + lua_lock(L); + api_checknelems(L, n); + } + luaD_poscall(L, ci, n); /* finish 'luaD_call' */ + } + unroll(L, NULL); /* run continuation */ + } +} + + +/* +** Unrolls a coroutine in protected mode while there are recoverable +** errors, that is, errors inside a protected call. (Any error +** interrupts 'unroll', and this loop protects it again so it can +** continue.) Stops with a normal end (status == LUA_OK), an yield +** (status == LUA_YIELD), or an unprotected error ('findpcall' doesn't +** find a recover point). +*/ +static int precover (lua_State *L, int status) { + CallInfo *ci; + while (errorstatus(status) && (ci = findpcall(L)) != NULL) { + L->ci = ci; /* go down to recovery functions */ + setcistrecst(ci, status); /* status to finish 'pcall' */ + status = luaD_rawrunprotected(L, unroll, NULL); + } + return status; +} + + +LUA_API int lua_resume (lua_State *L, lua_State *from, int nargs, + int *nresults) { + int status; + lua_lock(L); + if (L->status == LUA_OK) { /* may be starting a coroutine */ + if (L->ci != &L->base_ci) /* not in base level? */ + return resume_error(L, "cannot resume non-suspended coroutine", nargs); + else if (L->top - (L->ci->func + 1) == nargs) /* no function? */ + return resume_error(L, "cannot resume dead coroutine", nargs); + } + else if (L->status != LUA_YIELD) /* ended with errors? */ + return resume_error(L, "cannot resume dead coroutine", nargs); + L->nCcalls = (from) ? getCcalls(from) : 0; + luai_userstateresume(L, nargs); + api_checknelems(L, (L->status == LUA_OK) ? nargs + 1 : nargs); + status = luaD_rawrunprotected(L, resume, &nargs); + /* continue running after recoverable errors */ + status = precover(L, status); + if (l_likely(!errorstatus(status))) + lua_assert(status == L->status); /* normal end or yield */ + else { /* unrecoverable error */ + L->status = cast_byte(status); /* mark thread as 'dead' */ + luaD_seterrorobj(L, status, L->top); /* push error message */ + L->ci->top = L->top; + } + *nresults = (status == LUA_YIELD) ? L->ci->u2.nyield + : cast_int(L->top - (L->ci->func + 1)); + lua_unlock(L); + return status; +} + + +LUA_API int lua_isyieldable (lua_State *L) { + return yieldable(L); +} + + +LUA_API int lua_yieldk (lua_State *L, int nresults, lua_KContext ctx, + lua_KFunction k) { + CallInfo *ci; + luai_userstateyield(L, nresults); + lua_lock(L); + ci = L->ci; + api_checknelems(L, nresults); + if (l_unlikely(!yieldable(L))) { + 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->u2.nyield = nresults; /* save number of results */ + if (isLua(ci)) { /* inside a hook? */ + lua_assert(!isLuacode(ci)); + api_check(L, nresults == 0, "hooks cannot yield values"); + 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 */ + 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' */ +} + + +/* +** Auxiliary structure to call 'luaF_close' in protected mode. +*/ +struct CloseP { + StkId level; + int status; +}; + + +/* +** Auxiliary function to call 'luaF_close' in protected mode. +*/ +static void closepaux (lua_State *L, void *ud) { + struct CloseP *pcl = cast(struct CloseP *, ud); + luaF_close(L, pcl->level, pcl->status, 0); +} + + +/* +** Calls 'luaF_close' in protected mode. Return the original status +** or, in case of errors, the new status. +*/ +int luaD_closeprotected (lua_State *L, ptrdiff_t level, int status) { + CallInfo *old_ci = L->ci; + lu_byte old_allowhooks = L->allowhook; + for (;;) { /* keep closing upvalues until no more errors */ + struct CloseP pcl; + pcl.level = restorestack(L, level); pcl.status = status; + status = luaD_rawrunprotected(L, &closepaux, &pcl); + if (l_likely(status == LUA_OK)) /* no more errors? */ + return pcl.status; + else { /* an error occurred; restore saved state and repeat */ + L->ci = old_ci; + L->allowhook = old_allowhooks; + } + } +} + + +/* +** Call the C function 'func' in protected mode, restoring basic +** thread information ('allowhook', etc.) and in particular +** its stack level in case of errors. +*/ +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; + ptrdiff_t old_errfunc = L->errfunc; + L->errfunc = ef; + status = luaD_rawrunprotected(L, func, u); + if (l_unlikely(status != LUA_OK)) { /* an error occurred? */ + L->ci = old_ci; + L->allowhook = old_allowhooks; + status = luaD_closeprotected(L, old_top, status); + luaD_seterrorobj(L, status, restorestack(L, old_top)); + luaD_shrinkstack(L); /* restore stack size in case of overflow */ + } + 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 '%s')", x, mode); + luaD_throw(L, LUA_ERRSYNTAX); + } +} + + +static void f_parser (lua_State *L, void *ud) { + LClosure *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->name); + } + else { + checkmode(L, p->mode, "text"); + cl = luaY_parser(L, p->z, &p->buff, &p->dyd, p->name, c); + } + lua_assert(cl->nupvalues == cl->p->sizeupvalues); + luaF_initupvals(L, cl); +} + + +int luaD_protectedparser (lua_State *L, ZIO *z, const char *name, + const char *mode) { + struct SParser p; + int status; + incnny(L); /* 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); + decnny(L); + return status; +} + + diff --git a/lua-5.4.3/src/ldo.h b/lua-5.4.3/src/ldo.h new file mode 100644 index 0000000..6bf0ed8 --- /dev/null +++ b/lua-5.4.3/src/ldo.h @@ -0,0 +1,79 @@ +/* +** $Id: ldo.h $ +** 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" + + +/* +** Macro to check stack size and grow stack if needed. Parameters +** 'pre'/'pos' allow the macro to preserve a pointer into the +** stack across reallocations, doing the work only when needed. +** It also allows the running of one GC step when the stack is +** reallocated. +** 'condmovestack' is used in heavy tests to force a stack reallocation +** at every check. +*/ +#define luaD_checkstackaux(L,n,pre,pos) \ + if (l_unlikely(L->stack_last - L->top <= (n))) \ + { pre; luaD_growstack(L, n, 1); pos; } \ + else { condmovestack(L,pre,pos); } + +/* In general, 'pre'/'pos' are empty (nothing to save) */ +#define luaD_checkstack(L,n) luaD_checkstackaux(L,n,(void)0,(void)0) + + + +#define savestack(L,p) ((char *)(p) - (char *)L->stack) +#define restorestack(L,n) ((StkId)((char *)L->stack + (n))) + + +/* macro to check stack size, preserving 'p' */ +#define checkstackGCp(L,n,p) \ + luaD_checkstackaux(L, n, \ + ptrdiff_t t__ = savestack(L, p); /* save 'p' */ \ + luaC_checkGC(L), /* stack grow uses memory */ \ + p = restorestack(L, t__)) /* 'pos' part: restore 'p' */ + + +/* macro to check stack size and GC */ +#define checkstackGC(L,fsize) \ + luaD_checkstackaux(L, (fsize), luaC_checkGC(L), (void)0) + + +/* type of protected functions, to be ran by 'runprotected' */ +typedef void (*Pfunc) (lua_State *L, void *ud); + +LUAI_FUNC void luaD_seterrorobj (lua_State *L, int errcode, StkId oldtop); +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, + int fTransfer, int nTransfer); +LUAI_FUNC void luaD_hookcall (lua_State *L, CallInfo *ci); +LUAI_FUNC void luaD_pretailcall (lua_State *L, CallInfo *ci, StkId func, int n); +LUAI_FUNC CallInfo *luaD_precall (lua_State *L, StkId func, int nResults); +LUAI_FUNC void luaD_call (lua_State *L, StkId func, int nResults); +LUAI_FUNC void luaD_callnoyield (lua_State *L, StkId func, int nResults); +LUAI_FUNC void luaD_tryfuncTM (lua_State *L, StkId func); +LUAI_FUNC int luaD_closeprotected (lua_State *L, ptrdiff_t level, int status); +LUAI_FUNC int luaD_pcall (lua_State *L, Pfunc func, void *u, + ptrdiff_t oldtop, ptrdiff_t ef); +LUAI_FUNC void luaD_poscall (lua_State *L, CallInfo *ci, int nres); +LUAI_FUNC int luaD_reallocstack (lua_State *L, int newsize, int raiseerror); +LUAI_FUNC int luaD_growstack (lua_State *L, int n, int raiseerror); +LUAI_FUNC void luaD_shrinkstack (lua_State *L); +LUAI_FUNC void luaD_inctop (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/lua-5.4.3/src/ldump.c b/lua-5.4.3/src/ldump.c new file mode 100644 index 0000000..f848b66 --- /dev/null +++ b/lua-5.4.3/src/ldump.c @@ -0,0 +1,226 @@ +/* +** $Id: ldump.c $ +** save precompiled Lua chunks +** See Copyright Notice in lua.h +*/ + +#define ldump_c +#define LUA_CORE + +#include "lprefix.h" + + +#include + +#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; + + +/* +** All high-level dumps go through dumpVector; you can change it to +** change the endianness of the result +*/ +#define dumpVector(D,v,n) dumpBlock(D,v,(n)*sizeof((v)[0])) + +#define dumpLiteral(D, s) dumpBlock(D,s,sizeof(s) - sizeof(char)) + + +static void dumpBlock (DumpState *D, const void *b, size_t size) { + if (D->status == 0 && size > 0) { + lua_unlock(D->L); + D->status = (*D->writer)(D->L, b, size, D->data); + lua_lock(D->L); + } +} + + +#define dumpVar(D,x) dumpVector(D,&x,1) + + +static void dumpByte (DumpState *D, int y) { + lu_byte x = (lu_byte)y; + dumpVar(D, x); +} + + +/* dumpInt Buff Size */ +#define DIBS ((sizeof(size_t) * 8 / 7) + 1) + +static void dumpSize (DumpState *D, size_t x) { + lu_byte buff[DIBS]; + int n = 0; + do { + buff[DIBS - (++n)] = x & 0x7f; /* fill buffer in reverse order */ + x >>= 7; + } while (x != 0); + buff[DIBS - 1] |= 0x80; /* mark last byte */ + dumpVector(D, buff + DIBS - n, n); +} + + +static void dumpInt (DumpState *D, int x) { + dumpSize(D, x); +} + + +static void dumpNumber (DumpState *D, lua_Number x) { + dumpVar(D, x); +} + + +static void dumpInteger (DumpState *D, lua_Integer x) { + dumpVar(D, x); +} + + +static void dumpString (DumpState *D, const TString *s) { + if (s == NULL) + dumpSize(D, 0); + else { + size_t size = tsslen(s); + const char *str = getstr(s); + dumpSize(D, size + 1); + dumpVector(D, str, size); + } +} + + +static void dumpCode (DumpState *D, const Proto *f) { + dumpInt(D, f->sizecode); + dumpVector(D, f->code, f->sizecode); +} + + +static void dumpFunction(DumpState *D, const Proto *f, TString *psource); + +static void dumpConstants (DumpState *D, const Proto *f) { + int i; + int n = f->sizek; + dumpInt(D, n); + for (i = 0; i < n; i++) { + const TValue *o = &f->k[i]; + int tt = ttypetag(o); + dumpByte(D, tt); + switch (tt) { + case LUA_VNUMFLT: + dumpNumber(D, fltvalue(o)); + break; + case LUA_VNUMINT: + dumpInteger(D, ivalue(o)); + break; + case LUA_VSHRSTR: + case LUA_VLNGSTR: + dumpString(D, tsvalue(o)); + break; + default: + lua_assert(tt == LUA_VNIL || tt == LUA_VFALSE || tt == LUA_VTRUE); + } + } +} + + +static void dumpProtos (DumpState *D, const Proto *f) { + int i; + int n = f->sizep; + dumpInt(D, n); + for (i = 0; i < n; i++) + dumpFunction(D, f->p[i], f->source); +} + + +static void dumpUpvalues (DumpState *D, const Proto *f) { + int i, n = f->sizeupvalues; + dumpInt(D, n); + for (i = 0; i < n; i++) { + dumpByte(D, f->upvalues[i].instack); + dumpByte(D, f->upvalues[i].idx); + dumpByte(D, f->upvalues[i].kind); + } +} + + +static void dumpDebug (DumpState *D, const Proto *f) { + int i, n; + n = (D->strip) ? 0 : f->sizelineinfo; + dumpInt(D, n); + dumpVector(D, f->lineinfo, n); + n = (D->strip) ? 0 : f->sizeabslineinfo; + dumpInt(D, n); + for (i = 0; i < n; i++) { + dumpInt(D, f->abslineinfo[i].pc); + dumpInt(D, f->abslineinfo[i].line); + } + n = (D->strip) ? 0 : f->sizelocvars; + dumpInt(D, n); + for (i = 0; i < n; i++) { + dumpString(D, f->locvars[i].varname); + dumpInt(D, f->locvars[i].startpc); + dumpInt(D, f->locvars[i].endpc); + } + n = (D->strip) ? 0 : f->sizeupvalues; + dumpInt(D, n); + for (i = 0; i < n; i++) + dumpString(D, f->upvalues[i].name); +} + + +static void dumpFunction (DumpState *D, const Proto *f, TString *psource) { + if (D->strip || f->source == psource) + dumpString(D, NULL); /* no debug info or same source as its parent */ + else + dumpString(D, f->source); + dumpInt(D, f->linedefined); + dumpInt(D, f->lastlinedefined); + dumpByte(D, f->numparams); + dumpByte(D, f->is_vararg); + dumpByte(D, f->maxstacksize); + dumpCode(D, f); + dumpConstants(D, f); + dumpUpvalues(D, f); + dumpProtos(D, f); + dumpDebug(D, f); +} + + +static void dumpHeader (DumpState *D) { + dumpLiteral(D, LUA_SIGNATURE); + dumpByte(D, LUAC_VERSION); + dumpByte(D, LUAC_FORMAT); + dumpLiteral(D, LUAC_DATA); + dumpByte(D, sizeof(Instruction)); + dumpByte(D, sizeof(lua_Integer)); + dumpByte(D, sizeof(lua_Number)); + dumpInteger(D, LUAC_INT); + dumpNumber(D, LUAC_NUM); +} + + +/* +** 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); + dumpByte(&D, f->sizeupvalues); + dumpFunction(&D, f, NULL); + return D.status; +} + diff --git a/lua-5.4.3/src/lfunc.c b/lua-5.4.3/src/lfunc.c new file mode 100644 index 0000000..f5889a2 --- /dev/null +++ b/lua-5.4.3/src/lfunc.c @@ -0,0 +1,294 @@ +/* +** $Id: lfunc.c $ +** Auxiliary functions to manipulate prototypes and closures +** See Copyright Notice in lua.h +*/ + +#define lfunc_c +#define LUA_CORE + +#include "lprefix.h" + + +#include + +#include "lua.h" + +#include "ldebug.h" +#include "ldo.h" +#include "lfunc.h" +#include "lgc.h" +#include "lmem.h" +#include "lobject.h" +#include "lstate.h" + + + +CClosure *luaF_newCclosure (lua_State *L, int nupvals) { + GCObject *o = luaC_newobj(L, LUA_VCCL, sizeCclosure(nupvals)); + CClosure *c = gco2ccl(o); + c->nupvalues = cast_byte(nupvals); + return c; +} + + +LClosure *luaF_newLclosure (lua_State *L, int nupvals) { + GCObject *o = luaC_newobj(L, LUA_VLCL, sizeLclosure(nupvals)); + LClosure *c = gco2lcl(o); + c->p = NULL; + c->nupvalues = cast_byte(nupvals); + while (nupvals--) c->upvals[nupvals] = NULL; + return c; +} + + +/* +** fill a closure with new closed upvalues +*/ +void luaF_initupvals (lua_State *L, LClosure *cl) { + int i; + for (i = 0; i < cl->nupvalues; i++) { + GCObject *o = luaC_newobj(L, LUA_VUPVAL, sizeof(UpVal)); + UpVal *uv = gco2upv(o); + uv->v = &uv->u.value; /* make it closed */ + setnilvalue(uv->v); + cl->upvals[i] = uv; + luaC_objbarrier(L, cl, uv); + } +} + + +/* +** Create a new upvalue at the given level, and link it to the list of +** open upvalues of 'L' after entry 'prev'. +**/ +static UpVal *newupval (lua_State *L, int tbc, StkId level, UpVal **prev) { + GCObject *o = luaC_newobj(L, LUA_VUPVAL, sizeof(UpVal)); + UpVal *uv = gco2upv(o); + UpVal *next = *prev; + uv->v = s2v(level); /* current value lives in the stack */ + uv->tbc = tbc; + uv->u.open.next = next; /* link it to list of open upvalues */ + uv->u.open.previous = prev; + if (next) + next->u.open.previous = &uv->u.open.next; + *prev = uv; + if (!isintwups(L)) { /* thread not in list of threads with upvalues? */ + L->twups = G(L)->twups; /* link it to the list */ + G(L)->twups = L; + } + return uv; +} + + +/* +** Find and reuse, or create if it does not exist, an upvalue +** at the given level. +*/ +UpVal *luaF_findupval (lua_State *L, StkId level) { + UpVal **pp = &L->openupval; + UpVal *p; + lua_assert(isintwups(L) || L->openupval == NULL); + while ((p = *pp) != NULL && uplevel(p) >= level) { /* search for it */ + lua_assert(!isdead(G(L), p)); + if (uplevel(p) == level) /* corresponding upvalue? */ + return p; /* return it */ + pp = &p->u.open.next; + } + /* not found: create a new upvalue after 'pp' */ + return newupval(L, 0, level, pp); +} + + +/* +** Call closing method for object 'obj' with error message 'err'. The +** boolean 'yy' controls whether the call is yieldable. +** (This function assumes EXTRA_STACK.) +*/ +static void callclosemethod (lua_State *L, TValue *obj, TValue *err, int yy) { + StkId top = L->top; + const TValue *tm = luaT_gettmbyobj(L, obj, TM_CLOSE); + setobj2s(L, top, tm); /* will call metamethod... */ + setobj2s(L, top + 1, obj); /* with 'self' as the 1st argument */ + setobj2s(L, top + 2, err); /* and error msg. as 2nd argument */ + L->top = top + 3; /* add function and arguments */ + if (yy) + luaD_call(L, top, 0); + else + luaD_callnoyield(L, top, 0); +} + + +/* +** Check whether object at given level has a close metamethod and raise +** an error if not. +*/ +static void checkclosemth (lua_State *L, StkId level) { + const TValue *tm = luaT_gettmbyobj(L, s2v(level), TM_CLOSE); + if (ttisnil(tm)) { /* no metamethod? */ + int idx = cast_int(level - L->ci->func); /* variable index */ + const char *vname = luaG_findlocal(L, L->ci, idx, NULL); + if (vname == NULL) vname = "?"; + luaG_runerror(L, "variable '%s' got a non-closable value", vname); + } +} + + +/* +** Prepare and call a closing method. +** If status is CLOSEKTOP, the call to the closing method will be pushed +** at the top of the stack. Otherwise, values can be pushed right after +** the 'level' of the upvalue being closed, as everything after that +** won't be used again. +*/ +static void prepcallclosemth (lua_State *L, StkId level, int status, int yy) { + TValue *uv = s2v(level); /* value being closed */ + TValue *errobj; + if (status == CLOSEKTOP) + errobj = &G(L)->nilvalue; /* error object is nil */ + else { /* 'luaD_seterrorobj' will set top to level + 2 */ + errobj = s2v(level + 1); /* error object goes after 'uv' */ + luaD_seterrorobj(L, status, level + 1); /* set error object */ + } + callclosemethod(L, uv, errobj, yy); +} + + +/* +** Maximum value for deltas in 'tbclist', dependent on the type +** of delta. (This macro assumes that an 'L' is in scope where it +** is used.) +*/ +#define MAXDELTA \ + ((256ul << ((sizeof(L->stack->tbclist.delta) - 1) * 8)) - 1) + + +/* +** Insert a variable in the list of to-be-closed variables. +*/ +void luaF_newtbcupval (lua_State *L, StkId level) { + lua_assert(level > L->tbclist); + if (l_isfalse(s2v(level))) + return; /* false doesn't need to be closed */ + checkclosemth(L, level); /* value must have a close method */ + while (cast_uint(level - L->tbclist) > MAXDELTA) { + L->tbclist += MAXDELTA; /* create a dummy node at maximum delta */ + L->tbclist->tbclist.delta = 0; + } + level->tbclist.delta = cast(unsigned short, level - L->tbclist); + L->tbclist = level; +} + + +void luaF_unlinkupval (UpVal *uv) { + lua_assert(upisopen(uv)); + *uv->u.open.previous = uv->u.open.next; + if (uv->u.open.next) + uv->u.open.next->u.open.previous = uv->u.open.previous; +} + + +/* +** Close all upvalues up to the given stack level. +*/ +void luaF_closeupval (lua_State *L, StkId level) { + UpVal *uv; + StkId upl; /* stack index pointed by 'uv' */ + while ((uv = L->openupval) != NULL && (upl = uplevel(uv)) >= level) { + TValue *slot = &uv->u.value; /* new position for value */ + lua_assert(uplevel(uv) < L->top); + luaF_unlinkupval(uv); /* remove upvalue from 'openupval' list */ + setobj(L, slot, uv->v); /* move value to upvalue slot */ + uv->v = slot; /* now current value lives here */ + if (!iswhite(uv)) { /* neither white nor dead? */ + nw2black(uv); /* closed upvalues cannot be gray */ + luaC_barrier(L, uv, slot); + } + } +} + + +/* +** Remove firt element from the tbclist plus its dummy nodes. +*/ +static void poptbclist (lua_State *L) { + StkId tbc = L->tbclist; + lua_assert(tbc->tbclist.delta > 0); /* first element cannot be dummy */ + tbc -= tbc->tbclist.delta; + while (tbc > L->stack && tbc->tbclist.delta == 0) + tbc -= MAXDELTA; /* remove dummy nodes */ + L->tbclist = tbc; +} + + +/* +** Close all upvalues and to-be-closed variables up to the given stack +** level. +*/ +void luaF_close (lua_State *L, StkId level, int status, int yy) { + ptrdiff_t levelrel = savestack(L, level); + luaF_closeupval(L, level); /* first, close the upvalues */ + while (L->tbclist >= level) { /* traverse tbc's down to that level */ + StkId tbc = L->tbclist; /* get variable index */ + poptbclist(L); /* remove it from list */ + prepcallclosemth(L, tbc, status, yy); /* close variable */ + level = restorestack(L, levelrel); + } +} + + +Proto *luaF_newproto (lua_State *L) { + GCObject *o = luaC_newobj(L, LUA_VPROTO, sizeof(Proto)); + Proto *f = gco2p(o); + f->k = NULL; + f->sizek = 0; + f->p = NULL; + f->sizep = 0; + f->code = NULL; + f->sizecode = 0; + f->lineinfo = NULL; + f->sizelineinfo = 0; + f->abslineinfo = NULL; + f->sizeabslineinfo = 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->abslineinfo, f->sizeabslineinfo); + 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/lua-5.4.3/src/lfunc.h b/lua-5.4.3/src/lfunc.h new file mode 100644 index 0000000..dc1cebc --- /dev/null +++ b/lua-5.4.3/src/lfunc.h @@ -0,0 +1,64 @@ +/* +** $Id: lfunc.h $ +** 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(offsetof(CClosure, upvalue)) + \ + cast_int(sizeof(TValue)) * (n)) + +#define sizeLclosure(n) (cast_int(offsetof(LClosure, upvals)) + \ + cast_int(sizeof(TValue *)) * (n)) + + +/* test whether thread is in 'twups' list */ +#define isintwups(L) (L->twups != L) + + +/* +** maximum number of upvalues in a closure (both C and Lua). (Value +** must fit in a VM register.) +*/ +#define MAXUPVAL 255 + + +#define upisopen(up) ((up)->v != &(up)->u.value) + + +#define uplevel(up) check_exp(upisopen(up), cast(StkId, (up)->v)) + + +/* +** maximum number of misses before giving up the cache of closures +** in prototypes +*/ +#define MAXMISS 10 + + + +/* special status to close upvalues preserving the top of the stack */ +#define CLOSEKTOP (-1) + + +LUAI_FUNC Proto *luaF_newproto (lua_State *L); +LUAI_FUNC CClosure *luaF_newCclosure (lua_State *L, int nupvals); +LUAI_FUNC LClosure *luaF_newLclosure (lua_State *L, int nupvals); +LUAI_FUNC void luaF_initupvals (lua_State *L, LClosure *cl); +LUAI_FUNC UpVal *luaF_findupval (lua_State *L, StkId level); +LUAI_FUNC void luaF_newtbcupval (lua_State *L, StkId level); +LUAI_FUNC void luaF_closeupval (lua_State *L, StkId level); +LUAI_FUNC void luaF_close (lua_State *L, StkId level, int status, int yy); +LUAI_FUNC void luaF_unlinkupval (UpVal *uv); +LUAI_FUNC void luaF_freeproto (lua_State *L, Proto *f); +LUAI_FUNC const char *luaF_getlocalname (const Proto *func, int local_number, + int pc); + + +#endif diff --git a/lua-5.4.3/src/lgc.c b/lua-5.4.3/src/lgc.c new file mode 100644 index 0000000..b360eed --- /dev/null +++ b/lua-5.4.3/src/lgc.c @@ -0,0 +1,1728 @@ +/* +** $Id: lgc.c $ +** Garbage Collector +** See Copyright Notice in lua.h +*/ + +#define lgc_c +#define LUA_CORE + +#include "lprefix.h" + +#include +#include + + +#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" + + +/* +** Maximum number of elements to sweep in each single step. +** (Large enough to dissipate fixed overheads but small enough +** to allow small steps for the collector.) +*/ +#define GCSWEEPMAX 100 + +/* +** Maximum number of finalizers to call in each single step. +*/ +#define GCFINMAX 10 + + +/* +** Cost of calling one finalizer. +*/ +#define GCFINALIZECOST 50 + + +/* +** The equivalent, in bytes, of one unit of "work" (visiting a slot, +** sweeping an object, etc.) +*/ +#define WORK2MEM sizeof(TValue) + + +/* +** macro to adjust 'pause': 'pause' is actually used like +** 'pause / PAUSEADJ' (value chosen by tests) +*/ +#define PAUSEADJ 100 + + +/* mask with all color bits */ +#define maskcolors (bitmask(BLACKBIT) | WHITEBITS) + +/* mask with all GC bits */ +#define maskgcbits (maskcolors | AGEBITS) + + +/* macro to erase all color bits then set only the current white bit */ +#define makewhite(g,x) \ + (x->marked = cast_byte((x->marked & ~maskcolors) | luaC_white(g))) + +/* make an object gray (neither white nor black) */ +#define set2gray(x) resetbits(x->marked, maskcolors) + + +/* make an object black (coming from any color) */ +#define set2black(x) \ + (x->marked = cast_byte((x->marked & ~WHITEBITS) | bitmask(BLACKBIT))) + + +#define valiswhite(x) (iscollectable(x) && iswhite(gcvalue(x))) + +#define keyiswhite(n) (keyiscollectable(n) && iswhite(gckey(n))) + + +/* +** Protected access to objects in values +*/ +#define gcvalueN(o) (iscollectable(o) ? gcvalue(o) : NULL) + + +#define markvalue(g,o) { checkliveness(g->mainthread,o); \ + if (valiswhite(o)) reallymarkobject(g,gcvalue(o)); } + +#define markkey(g, n) { if keyiswhite(n) reallymarkobject(g,gckey(n)); } + +#define markobject(g,t) { if (iswhite(t)) reallymarkobject(g, obj2gco(t)); } + +/* +** mark an object that can be NULL (either because it is really optional, +** or it was stripped as debug info, or inside an uncompleted structure) +*/ +#define markobjectN(g,t) { if (t) markobject(g,t); } + +static void reallymarkobject (global_State *g, GCObject *o); +static lu_mem atomic (lua_State *L); +static void entersweep (lua_State *L); + + +/* +** {====================================================== +** Generic functions +** ======================================================= +*/ + + +/* +** one after last element in a hash array +*/ +#define gnodelast(h) gnode(h, cast_sizet(sizenode(h))) + + +static GCObject **getgclist (GCObject *o) { + switch (o->tt) { + case LUA_VTABLE: return &gco2t(o)->gclist; + case LUA_VLCL: return &gco2lcl(o)->gclist; + case LUA_VCCL: return &gco2ccl(o)->gclist; + case LUA_VTHREAD: return &gco2th(o)->gclist; + case LUA_VPROTO: return &gco2p(o)->gclist; + case LUA_VUSERDATA: { + Udata *u = gco2u(o); + lua_assert(u->nuvalue > 0); + return &u->gclist; + } + default: lua_assert(0); return 0; + } +} + + +/* +** Link a collectable object 'o' with a known type into the list 'p'. +** (Must be a macro to access the 'gclist' field in different types.) +*/ +#define linkgclist(o,p) linkgclist_(obj2gco(o), &(o)->gclist, &(p)) + +static void linkgclist_ (GCObject *o, GCObject **pnext, GCObject **list) { + lua_assert(!isgray(o)); /* cannot be in a gray list */ + *pnext = *list; + *list = o; + set2gray(o); /* now it is */ +} + + +/* +** Link a generic collectable object 'o' into the list 'p'. +*/ +#define linkobjgclist(o,p) linkgclist_(obj2gco(o), getgclist(o), &(p)) + + + +/* +** Clear keys for empty entries in tables. If entry is empty, mark its +** entry as dead. This allows the collection of the key, but keeps its +** entry in the table: its removal could break a chain and could break +** a table traversal. Other places never manipulate dead keys, because +** its associated empty value is enough to signal that the entry is +** logically empty. +*/ +static void clearkey (Node *n) { + lua_assert(isempty(gval(n))); + if (keyiscollectable(n)) + setdeadkey(n); /* unused 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 GCObject *o) { + if (o == NULL) return 0; /* non-collectable value */ + else if (novariant(o->tt) == LUA_TSTRING) { + markobject(g, o); /* strings are 'values', so are never weak */ + return 0; + } + else return iswhite(o); +} + + +/* +** Barrier that moves collector forward, that is, marks the white object +** 'v' being pointed by the black object 'o'. In the generational +** mode, 'v' must also become old, if 'o' is old; however, it cannot +** be changed directly to OLD, because it may still point to non-old +** objects. So, it is marked as OLD0. In the next cycle it will become +** OLD1, and in the next it will finally become OLD (regular old). By +** then, any object it points to will also be old. If called in the +** incremental sweep phase, it clears the black object to white (sweep +** it) to avoid other barrier calls for this same object. (That cannot +** be done is generational mode, as its sweep does not distinguish +** whites from deads.) +*/ +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)); + if (keepinvariant(g)) { /* must keep invariant? */ + reallymarkobject(g, v); /* restore invariant */ + if (isold(o)) { + lua_assert(!isold(v)); /* white object could not be old */ + setage(v, G_OLD0); /* restore generational invariant */ + } + } + else { /* sweep phase */ + lua_assert(issweepphase(g)); + if (g->gckind == KGC_INC) /* incremental mode? */ + makewhite(g, o); /* mark 'o' 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. +*/ +void luaC_barrierback_ (lua_State *L, GCObject *o) { + global_State *g = G(L); + lua_assert(isblack(o) && !isdead(g, o)); + lua_assert((g->gckind == KGC_GEN) == (isold(o) && getage(o) != G_TOUCHED1)); + if (getage(o) == G_TOUCHED2) /* already in gray list? */ + set2gray(o); /* make it gray to become touched1 */ + else /* link it in 'grayagain' and paint it gray */ + linkobjgclist(o, g->grayagain); + if (isold(o)) /* generational mode? */ + setage(o, G_TOUCHED1); /* touched in current cycle */ +} + + +void luaC_fix (lua_State *L, GCObject *o) { + global_State *g = G(L); + lua_assert(g->allgc == o); /* object must be 1st in 'allgc' list! */ + set2gray(o); /* they will be gray forever */ + setage(o, G_OLD); /* and old forever */ + g->allgc = o->next; /* remove object from 'allgc' list */ + o->next = g->fixedgc; /* link it to 'fixedgc' list */ + g->fixedgc = o; +} + + +/* +** create a new collectable object (with given type and size) and link +** it to 'allgc' list. +*/ +GCObject *luaC_newobj (lua_State *L, int tt, size_t sz) { + global_State *g = G(L); + GCObject *o = cast(GCObject *, luaM_newobject(L, novariant(tt), sz)); + o->marked = luaC_white(g); + o->tt = tt; + o->next = g->allgc; + g->allgc = o; + return o; +} + +/* }====================================================== */ + + + +/* +** {====================================================== +** Mark functions +** ======================================================= +*/ + + +/* +** Mark an object. Userdata with no user values, strings, and closed +** upvalues are visited and turned black here. Open upvalues are +** already indirectly linked through their respective threads in the +** 'twups' list, so they don't go to the gray list; nevertheless, they +** are kept gray to avoid barriers, as their values will be revisited +** by the thread or by 'remarkupvals'. Other objects are added to the +** gray list to be visited (and turned black) later. Both userdata and +** upvalues can call this function recursively, but this recursion goes +** for at most two levels: An upvalue cannot refer to another upvalue +** (only closures can), and a userdata's metatable must be a table. +*/ +static void reallymarkobject (global_State *g, GCObject *o) { + switch (o->tt) { + case LUA_VSHRSTR: + case LUA_VLNGSTR: { + set2black(o); /* nothing to visit */ + break; + } + case LUA_VUPVAL: { + UpVal *uv = gco2upv(o); + if (upisopen(uv)) + set2gray(uv); /* open upvalues are kept gray */ + else + set2black(uv); /* closed upvalues are visited here */ + markvalue(g, uv->v); /* mark its content */ + break; + } + case LUA_VUSERDATA: { + Udata *u = gco2u(o); + if (u->nuvalue == 0) { /* no user values? */ + markobjectN(g, u->metatable); /* mark its metatable */ + set2black(u); /* nothing else to mark */ + break; + } + /* else... */ + } /* FALLTHROUGH */ + case LUA_VLCL: case LUA_VCCL: case LUA_VTABLE: + case LUA_VTHREAD: case LUA_VPROTO: { + linkobjgclist(o, g->gray); /* to be visited later */ + break; + } + default: lua_assert(0); break; + } +} + + +/* +** mark metamethods for basic types +*/ +static void markmt (global_State *g) { + int i; + for (i=0; i < LUA_NUMTAGS; i++) + markobjectN(g, g->mt[i]); +} + + +/* +** mark all objects in list of being-finalized +*/ +static lu_mem markbeingfnz (global_State *g) { + GCObject *o; + lu_mem count = 0; + for (o = g->tobefnz; o != NULL; o = o->next) { + count++; + markobject(g, o); + } + return count; +} + + +/* +** For each non-marked thread, simulates a barrier between each open +** upvalue and its value. (If the thread is collected, the value will be +** assigned to the upvalue, but then it can be too late for the barrier +** to act. The "barrier" does not need to check colors: A non-marked +** thread must be young; upvalues cannot be older than their threads; so +** any visited upvalue must be young too.) Also removes the thread from +** the list, as it was already visited. Removes also threads with no +** upvalues, as they have nothing to be checked. (If the thread gets an +** upvalue later, it will be linked in the list again.) +*/ +static int remarkupvals (global_State *g) { + lua_State *thread; + lua_State **p = &g->twups; + int work = 0; /* estimate of how much work was done here */ + while ((thread = *p) != NULL) { + work++; + if (!iswhite(thread) && thread->openupval != NULL) + p = &thread->twups; /* keep marked thread with upvalues in the list */ + else { /* thread is not marked or without upvalues */ + UpVal *uv; + lua_assert(!isold(thread) || thread->openupval == NULL); + *p = thread->twups; /* remove thread from the list */ + thread->twups = thread; /* mark that it is out of list */ + for (uv = thread->openupval; uv != NULL; uv = uv->u.open.next) { + lua_assert(getage(uv) <= getage(thread)); + work++; + if (!iswhite(uv)) { /* upvalue already visited? */ + lua_assert(upisopen(uv) && isgray(uv)); + markvalue(g, uv->v); /* mark its value */ + } + } + } + } + return work; +} + + +static void cleargraylists (global_State *g) { + g->gray = g->grayagain = NULL; + g->weak = g->allweak = g->ephemeron = NULL; +} + + +/* +** mark root set and reset all gray lists, to start a new collection +*/ +static void restartcollection (global_State *g) { + cleargraylists(g); + markobject(g, g->mainthread); + markvalue(g, &g->l_registry); + markmt(g); + markbeingfnz(g); /* mark any finalizing object left from previous cycle */ +} + +/* }====================================================== */ + + +/* +** {====================================================== +** Traverse functions +** ======================================================= +*/ + + +/* +** Check whether object 'o' should be kept in the 'grayagain' list for +** post-processing by 'correctgraylist'. (It could put all old objects +** in the list and leave all the work to 'correctgraylist', but it is +** more efficient to avoid adding elements that will be removed.) Only +** TOUCHED1 objects need to be in the list. TOUCHED2 doesn't need to go +** back to a gray list, but then it must become OLD. (That is what +** 'correctgraylist' does when it finds a TOUCHED2 object.) +*/ +static void genlink (global_State *g, GCObject *o) { + lua_assert(isblack(o)); + if (getage(o) == G_TOUCHED1) { /* touched in this cycle? */ + linkobjgclist(o, g->grayagain); /* link it back in 'grayagain' */ + } /* everything else do not need to be linked back */ + else if (getage(o) == G_TOUCHED2) + changeage(o, G_TOUCHED2, G_OLD); /* advance age */ +} + + +/* +** Traverse a table with weak values and link it to proper list. During +** propagate phase, keep it in 'grayagain' list, to be revisited in the +** atomic phase. In the atomic phase, if table has any white value, +** put it in 'weak' list, to be cleared. +*/ +static void traverseweakvalue (global_State *g, Table *h) { + Node *n, *limit = gnodelast(h); + /* if there is array part, assume it may have white values (it is not + worth traversing it now just to check) */ + int hasclears = (h->alimit > 0); + for (n = gnode(h, 0); n < limit; n++) { /* traverse hash part */ + if (isempty(gval(n))) /* entry is empty? */ + clearkey(n); /* clear its key */ + else { + lua_assert(!keyisnil(n)); + markkey(g, n); + if (!hasclears && iscleared(g, gcvalueN(gval(n)))) /* a white value? */ + hasclears = 1; /* table will have to be cleared */ + } + } + if (g->gcstate == GCSatomic && hasclears) + linkgclist(h, g->weak); /* has to be cleared later */ + else + linkgclist(h, g->grayagain); /* must retraverse it in atomic phase */ +} + + +/* +** Traverse an ephemeron table and link it to proper list. Returns true +** iff any object was marked during this traversal (which implies that +** convergence has to continue). During propagation phase, keep table +** in 'grayagain' list, to be visited again in the atomic phase. In +** the atomic phase, if table has any white->white entry, it has to +** be revisited during ephemeron convergence (as that key may turn +** black). Otherwise, if it has any white key, table has to be cleared +** (in the atomic phase). In generational mode, some tables +** must be kept in some gray list for post-processing; this is done +** by 'genlink'. +*/ +static int traverseephemeron (global_State *g, Table *h, int inv) { + int marked = 0; /* true if an object is marked in this traversal */ + int hasclears = 0; /* true if table has white keys */ + int hasww = 0; /* true if table has entry "white-key -> white-value" */ + unsigned int i; + unsigned int asize = luaH_realasize(h); + unsigned int nsize = sizenode(h); + /* traverse array part */ + for (i = 0; i < asize; i++) { + if (valiswhite(&h->array[i])) { + marked = 1; + reallymarkobject(g, gcvalue(&h->array[i])); + } + } + /* traverse hash part; if 'inv', traverse descending + (see 'convergeephemerons') */ + for (i = 0; i < nsize; i++) { + Node *n = inv ? gnode(h, nsize - 1 - i) : gnode(h, i); + if (isempty(gval(n))) /* entry is empty? */ + clearkey(n); /* clear its key */ + else if (iscleared(g, gckeyN(n))) { /* key is not marked (yet)? */ + hasclears = 1; /* table must be cleared */ + if (valiswhite(gval(n))) /* value not marked yet? */ + hasww = 1; /* white-white entry */ + } + else if (valiswhite(gval(n))) { /* value not marked yet? */ + marked = 1; + reallymarkobject(g, gcvalue(gval(n))); /* mark it now */ + } + } + /* link table into proper list */ + if (g->gcstate == GCSpropagate) + linkgclist(h, g->grayagain); /* must retraverse it in atomic phase */ + else if (hasww) /* table has white->white entries? */ + linkgclist(h, g->ephemeron); /* have to propagate again */ + else if (hasclears) /* table has white keys? */ + linkgclist(h, g->allweak); /* may have to clean white keys */ + else + genlink(g, obj2gco(h)); /* check whether collector still needs to see it */ + return marked; +} + + +static void traversestrongtable (global_State *g, Table *h) { + Node *n, *limit = gnodelast(h); + unsigned int i; + unsigned int asize = luaH_realasize(h); + for (i = 0; i < asize; i++) /* traverse array part */ + markvalue(g, &h->array[i]); + for (n = gnode(h, 0); n < limit; n++) { /* traverse hash part */ + if (isempty(gval(n))) /* entry is empty? */ + clearkey(n); /* clear its key */ + else { + lua_assert(!keyisnil(n)); + markkey(g, n); + markvalue(g, gval(n)); + } + } + genlink(g, obj2gco(h)); +} + + +static lu_mem traversetable (global_State *g, Table *h) { + const char *weakkey, *weakvalue; + const TValue *mode = gfasttm(g, h->metatable, TM_MODE); + markobjectN(g, h->metatable); + if (mode && ttisstring(mode) && /* is there a weak mode? */ + (cast_void(weakkey = strchr(svalue(mode), 'k')), + cast_void(weakvalue = strchr(svalue(mode), 'v')), + (weakkey || weakvalue))) { /* is really weak? */ + if (!weakkey) /* strong keys? */ + traverseweakvalue(g, h); + else if (!weakvalue) /* strong values? */ + traverseephemeron(g, h, 0); + else /* all weak */ + linkgclist(h, g->allweak); /* nothing to traverse now */ + } + else /* not weak */ + traversestrongtable(g, h); + return 1 + h->alimit + 2 * allocsizenode(h); +} + + +static int traverseudata (global_State *g, Udata *u) { + int i; + markobjectN(g, u->metatable); /* mark its metatable */ + for (i = 0; i < u->nuvalue; i++) + markvalue(g, &u->uv[i].uv); + genlink(g, obj2gco(u)); + return 1 + u->nuvalue; +} + + +/* +** Traverse a prototype. (While a prototype is being build, its +** arrays can be larger than needed; the extra slots are filled with +** NULL, so the use of 'markobjectN') +*/ +static int traverseproto (global_State *g, Proto *f) { + int i; + markobjectN(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 */ + markobjectN(g, f->upvalues[i].name); + for (i = 0; i < f->sizep; i++) /* mark nested protos */ + markobjectN(g, f->p[i]); + for (i = 0; i < f->sizelocvars; i++) /* mark local-variable names */ + markobjectN(g, f->locvars[i].varname); + return 1 + f->sizek + f->sizeupvalues + f->sizep + f->sizelocvars; +} + + +static int traverseCclosure (global_State *g, CClosure *cl) { + int i; + for (i = 0; i < cl->nupvalues; i++) /* mark its upvalues */ + markvalue(g, &cl->upvalue[i]); + return 1 + cl->nupvalues; +} + +/* +** Traverse a Lua closure, marking its prototype and its upvalues. +** (Both can be NULL while closure is being created.) +*/ +static int traverseLclosure (global_State *g, LClosure *cl) { + int i; + markobjectN(g, cl->p); /* mark its prototype */ + for (i = 0; i < cl->nupvalues; i++) { /* visit its upvalues */ + UpVal *uv = cl->upvals[i]; + markobjectN(g, uv); /* mark upvalue */ + } + return 1 + cl->nupvalues; +} + + +/* +** Traverse a thread, marking the elements in the stack up to its top +** and cleaning the rest of the stack in the final traversal. That +** ensures that the entire stack have valid (non-dead) objects. +** Threads have no barriers. In gen. mode, old threads must be visited +** at every cycle, because they might point to young objects. In inc. +** mode, the thread can still be modified before the end of the cycle, +** and therefore it must be visited again in the atomic phase. To ensure +** these visits, threads must return to a gray list if they are not new +** (which can only happen in generational mode) or if the traverse is in +** the propagate phase (which can only happen in incremental mode). +*/ +static int traversethread (global_State *g, lua_State *th) { + UpVal *uv; + StkId o = th->stack; + if (isold(th) || g->gcstate == GCSpropagate) + linkgclist(th, g->grayagain); /* insert into 'grayagain' list */ + if (o == NULL) + return 1; /* stack not completely built yet */ + lua_assert(g->gcstate == GCSatomic || + th->openupval == NULL || isintwups(th)); + for (; o < th->top; o++) /* mark live elements in the stack */ + markvalue(g, s2v(o)); + for (uv = th->openupval; uv != NULL; uv = uv->u.open.next) + markobject(g, uv); /* open upvalues cannot be collected */ + if (g->gcstate == GCSatomic) { /* final traversal? */ + for (; o < th->stack_last + EXTRA_STACK; o++) + setnilvalue(s2v(o)); /* clear dead stack slice */ + /* 'remarkupvals' may have removed thread from 'twups' list */ + if (!isintwups(th) && th->openupval != NULL) { + th->twups = g->twups; /* link it back to the list */ + g->twups = th; + } + } + else if (!g->gcemergency) + luaD_shrinkstack(th); /* do not change stack in emergency cycle */ + return 1 + stacksize(th); +} + + +/* +** traverse one gray object, turning it to black. +*/ +static lu_mem propagatemark (global_State *g) { + GCObject *o = g->gray; + nw2black(o); + g->gray = *getgclist(o); /* remove from 'gray' list */ + switch (o->tt) { + case LUA_VTABLE: return traversetable(g, gco2t(o)); + case LUA_VUSERDATA: return traverseudata(g, gco2u(o)); + case LUA_VLCL: return traverseLclosure(g, gco2lcl(o)); + case LUA_VCCL: return traverseCclosure(g, gco2ccl(o)); + case LUA_VPROTO: return traverseproto(g, gco2p(o)); + case LUA_VTHREAD: return traversethread(g, gco2th(o)); + default: lua_assert(0); return 0; + } +} + + +static lu_mem propagateall (global_State *g) { + lu_mem tot = 0; + while (g->gray) + tot += propagatemark(g); + return tot; +} + + +/* +** Traverse all ephemeron tables propagating marks from keys to values. +** Repeat until it converges, that is, nothing new is marked. 'dir' +** inverts the direction of the traversals, trying to speed up +** convergence on chains in the same table. +** +*/ +static void convergeephemerons (global_State *g) { + int changed; + int dir = 0; + do { + GCObject *w; + GCObject *next = g->ephemeron; /* get ephemeron list */ + g->ephemeron = NULL; /* tables may return to this list when traversed */ + changed = 0; + while ((w = next) != NULL) { /* for each ephemeron table */ + Table *h = gco2t(w); + next = h->gclist; /* list is rebuilt during loop */ + nw2black(h); /* out of the list (for now) */ + if (traverseephemeron(g, h, dir)) { /* marked some value? */ + propagateall(g); /* propagate changes */ + changed = 1; /* will have to revisit all ephemeron tables */ + } + } + dir = !dir; /* invert direction next time */ + } while (changed); /* repeat until no more changes */ +} + +/* }====================================================== */ + + +/* +** {====================================================== +** Sweep Functions +** ======================================================= +*/ + + +/* +** clear entries with unmarked keys from all weaktables in list 'l' +*/ +static void clearbykeys (global_State *g, GCObject *l) { + for (; l; l = gco2t(l)->gclist) { + Table *h = gco2t(l); + Node *limit = gnodelast(h); + Node *n; + for (n = gnode(h, 0); n < limit; n++) { + if (iscleared(g, gckeyN(n))) /* unmarked key? */ + setempty(gval(n)); /* remove entry */ + if (isempty(gval(n))) /* is entry empty? */ + clearkey(n); /* clear its key */ + } + } +} + + +/* +** clear entries with unmarked values from all weaktables in list 'l' up +** to element 'f' +*/ +static void clearbyvalues (global_State *g, GCObject *l, GCObject *f) { + for (; l != f; l = gco2t(l)->gclist) { + Table *h = gco2t(l); + Node *n, *limit = gnodelast(h); + unsigned int i; + unsigned int asize = luaH_realasize(h); + for (i = 0; i < asize; i++) { + TValue *o = &h->array[i]; + if (iscleared(g, gcvalueN(o))) /* value was collected? */ + setempty(o); /* remove entry */ + } + for (n = gnode(h, 0); n < limit; n++) { + if (iscleared(g, gcvalueN(gval(n)))) /* unmarked value? */ + setempty(gval(n)); /* remove entry */ + if (isempty(gval(n))) /* is entry empty? */ + clearkey(n); /* clear its key */ + } + } +} + + +static void freeupval (lua_State *L, UpVal *uv) { + if (upisopen(uv)) + luaF_unlinkupval(uv); + luaM_free(L, uv); +} + + +static void freeobj (lua_State *L, GCObject *o) { + switch (o->tt) { + case LUA_VPROTO: + luaF_freeproto(L, gco2p(o)); + break; + case LUA_VUPVAL: + freeupval(L, gco2upv(o)); + break; + case LUA_VLCL: { + LClosure *cl = gco2lcl(o); + luaM_freemem(L, cl, sizeLclosure(cl->nupvalues)); + break; + } + case LUA_VCCL: { + CClosure *cl = gco2ccl(o); + luaM_freemem(L, cl, sizeCclosure(cl->nupvalues)); + break; + } + case LUA_VTABLE: + luaH_free(L, gco2t(o)); + break; + case LUA_VTHREAD: + luaE_freethread(L, gco2th(o)); + break; + case LUA_VUSERDATA: { + Udata *u = gco2u(o); + luaM_freemem(L, o, sizeudata(u->nuvalue, u->len)); + break; + } + case LUA_VSHRSTR: { + TString *ts = gco2ts(o); + luaS_remove(L, ts); /* remove it from hash table */ + luaM_freemem(L, ts, sizelstring(ts->shrlen)); + break; + } + case LUA_VLNGSTR: { + TString *ts = gco2ts(o); + luaM_freemem(L, ts, sizelstring(ts->u.lnglen)); + break; + } + default: lua_assert(0); + } +} + + +/* +** sweep at most 'countin' elements from a list of GCObjects erasing dead +** objects, where a dead object is one marked with the old (non current) +** white; change all non-dead objects back to white, preparing for next +** collection cycle. Return where to continue the traversal or NULL if +** list is finished. ('*countout' gets the number of elements traversed.) +*/ +static GCObject **sweeplist (lua_State *L, GCObject **p, int countin, + int *countout) { + global_State *g = G(L); + int ow = otherwhite(g); + int i; + int white = luaC_white(g); /* current white */ + for (i = 0; *p != NULL && i < countin; i++) { + GCObject *curr = *p; + int marked = curr->marked; + if (isdeadm(ow, marked)) { /* is 'curr' dead? */ + *p = curr->next; /* remove 'curr' from list */ + freeobj(L, curr); /* erase 'curr' */ + } + else { /* change mark to 'white' */ + curr->marked = cast_byte((marked & ~maskgcbits) | white); + p = &curr->next; /* go to next element */ + } + } + if (countout) + *countout = i; /* number of elements traversed */ + return (*p == NULL) ? NULL : p; +} + + +/* +** sweep a list until a live object (or end of list) +*/ +static GCObject **sweeptolive (lua_State *L, GCObject **p) { + GCObject **old = p; + do { + p = sweeplist(L, p, 1, NULL); + } while (p == old); + return p; +} + +/* }====================================================== */ + + +/* +** {====================================================== +** Finalization +** ======================================================= +*/ + +/* +** If possible, shrink string table. +*/ +static void checkSizes (lua_State *L, global_State *g) { + if (!g->gcemergency) { + if (g->strt.nuse < g->strt.size / 4) { /* string table too big? */ + l_mem olddebt = g->GCdebt; + luaS_resize(L, g->strt.size / 2); + g->GCestimate += g->GCdebt - olddebt; /* correct estimate */ + } + } +} + + +/* +** Get the next udata to be finalized from the 'tobefnz' list, and +** link it back into the 'allgc' list. +*/ +static GCObject *udata2finalize (global_State *g) { + GCObject *o = g->tobefnz; /* get first element */ + lua_assert(tofinalize(o)); + g->tobefnz = o->next; /* remove it from 'tobefnz' list */ + o->next = g->allgc; /* return it to 'allgc' list */ + g->allgc = o; + resetbit(o->marked, FINALIZEDBIT); /* object is "normal" again */ + if (issweepphase(g)) + makewhite(g, o); /* "sweep" object */ + else if (getage(o) == G_OLD1) + g->firstold1 = o; /* it is the first OLD1 object in the list */ + return o; +} + + +static void dothecall (lua_State *L, void *ud) { + UNUSED(ud); + luaD_callnoyield(L, L->top - 2, 0); +} + + +static void GCTM (lua_State *L) { + global_State *g = G(L); + const TValue *tm; + TValue v; + lua_assert(!g->gcemergency); + setgcovalue(L, &v, udata2finalize(g)); + tm = luaT_gettmbyobj(L, &v, TM_GC); + if (!notm(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++, &v); /* ... and its argument */ + L->ci->callstatus |= CIST_FIN; /* will run a finalizer */ + status = luaD_pcall(L, dothecall, NULL, savestack(L, L->top - 2), 0); + L->ci->callstatus &= ~CIST_FIN; /* not running a finalizer anymore */ + L->allowhook = oldah; /* restore hooks */ + g->gcrunning = running; /* restore state */ + if (l_unlikely(status != LUA_OK)) { /* error while running __gc? */ + luaE_warnerror(L, "__gc metamethod"); + L->top--; /* pops error object */ + } + } +} + + +/* +** Call a few finalizers +*/ +static int runafewfinalizers (lua_State *L, int n) { + global_State *g = G(L); + int i; + for (i = 0; i < n && g->tobefnz; i++) + GCTM(L); /* call one finalizer */ + return i; +} + + +/* +** call all pending finalizers +*/ +static void callallpendingfinalizers (lua_State *L) { + global_State *g = G(L); + while (g->tobefnz) + GCTM(L); +} + + +/* +** find last 'next' field in list 'p' list (to add elements in its end) +*/ +static GCObject **findlast (GCObject **p) { + while (*p != NULL) + p = &(*p)->next; + return p; +} + + +/* +** Move all unreachable objects (or 'all' objects) that need +** finalization from list 'finobj' to list 'tobefnz' (to be finalized). +** (Note that objects after 'finobjold1' cannot be white, so they +** don't need to be traversed. In incremental mode, 'finobjold1' is NULL, +** so the whole list is traversed.) +*/ +static void separatetobefnz (global_State *g, int all) { + GCObject *curr; + GCObject **p = &g->finobj; + GCObject **lastnext = findlast(&g->tobefnz); + while ((curr = *p) != g->finobjold1) { /* traverse all finalizable objects */ + lua_assert(tofinalize(curr)); + if (!(iswhite(curr) || all)) /* not being collected? */ + p = &curr->next; /* don't bother with it */ + else { + if (curr == g->finobjsur) /* removing 'finobjsur'? */ + g->finobjsur = curr->next; /* correct it */ + *p = curr->next; /* remove 'curr' from 'finobj' list */ + curr->next = *lastnext; /* link at the end of 'tobefnz' list */ + *lastnext = curr; + lastnext = &curr->next; + } + } +} + + +/* +** If pointer 'p' points to 'o', move it to the next element. +*/ +static void checkpointer (GCObject **p, GCObject *o) { + if (o == *p) + *p = o->next; +} + + +/* +** Correct pointers to objects inside 'allgc' list when +** object 'o' is being removed from the list. +*/ +static void correctpointers (global_State *g, GCObject *o) { + checkpointer(&g->survival, o); + checkpointer(&g->old1, o); + checkpointer(&g->reallyold, o); + checkpointer(&g->firstold1, o); +} + + +/* +** 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 (tofinalize(o) || /* obj. is already marked... */ + gfasttm(g, mt, TM_GC) == NULL) /* or has no finalizer? */ + return; /* nothing to be done */ + else { /* move 'o' to 'finobj' list */ + GCObject **p; + if (issweepphase(g)) { + makewhite(g, o); /* "sweep" object 'o' */ + if (g->sweepgc == &o->next) /* should not remove 'sweepgc' object */ + g->sweepgc = sweeptolive(L, g->sweepgc); /* change 'sweepgc' */ + } + else + correctpointers(g, o); + /* search for pointer pointing to 'o' */ + for (p = &g->allgc; *p != o; p = &(*p)->next) { /* empty */ } + *p = o->next; /* remove 'o' from 'allgc' list */ + o->next = g->finobj; /* link it in 'finobj' list */ + g->finobj = o; + l_setbit(o->marked, FINALIZEDBIT); /* mark it as such */ + } +} + +/* }====================================================== */ + + +/* +** {====================================================== +** Generational Collector +** ======================================================= +*/ + +static void setpause (global_State *g); + + +/* +** Sweep a list of objects to enter generational mode. Deletes dead +** objects and turns the non dead to old. All non-dead threads---which +** are now old---must be in a gray list. Everything else is not in a +** gray list. Open upvalues are also kept gray. +*/ +static void sweep2old (lua_State *L, GCObject **p) { + GCObject *curr; + global_State *g = G(L); + while ((curr = *p) != NULL) { + if (iswhite(curr)) { /* is 'curr' dead? */ + lua_assert(isdead(g, curr)); + *p = curr->next; /* remove 'curr' from list */ + freeobj(L, curr); /* erase 'curr' */ + } + else { /* all surviving objects become old */ + setage(curr, G_OLD); + if (curr->tt == LUA_VTHREAD) { /* threads must be watched */ + lua_State *th = gco2th(curr); + linkgclist(th, g->grayagain); /* insert into 'grayagain' list */ + } + else if (curr->tt == LUA_VUPVAL && upisopen(gco2upv(curr))) + set2gray(curr); /* open upvalues are always gray */ + else /* everything else is black */ + nw2black(curr); + p = &curr->next; /* go to next element */ + } + } +} + + +/* +** Sweep for generational mode. Delete dead objects. (Because the +** collection is not incremental, there are no "new white" objects +** during the sweep. So, any white object must be dead.) For +** non-dead objects, advance their ages and clear the color of +** new objects. (Old objects keep their colors.) +** The ages of G_TOUCHED1 and G_TOUCHED2 objects cannot be advanced +** here, because these old-generation objects are usually not swept +** here. They will all be advanced in 'correctgraylist'. That function +** will also remove objects turned white here from any gray list. +*/ +static GCObject **sweepgen (lua_State *L, global_State *g, GCObject **p, + GCObject *limit, GCObject **pfirstold1) { + static const lu_byte nextage[] = { + G_SURVIVAL, /* from G_NEW */ + G_OLD1, /* from G_SURVIVAL */ + G_OLD1, /* from G_OLD0 */ + G_OLD, /* from G_OLD1 */ + G_OLD, /* from G_OLD (do not change) */ + G_TOUCHED1, /* from G_TOUCHED1 (do not change) */ + G_TOUCHED2 /* from G_TOUCHED2 (do not change) */ + }; + int white = luaC_white(g); + GCObject *curr; + while ((curr = *p) != limit) { + if (iswhite(curr)) { /* is 'curr' dead? */ + lua_assert(!isold(curr) && isdead(g, curr)); + *p = curr->next; /* remove 'curr' from list */ + freeobj(L, curr); /* erase 'curr' */ + } + else { /* correct mark and age */ + if (getage(curr) == G_NEW) { /* new objects go back to white */ + int marked = curr->marked & ~maskgcbits; /* erase GC bits */ + curr->marked = cast_byte(marked | G_SURVIVAL | white); + } + else { /* all other objects will be old, and so keep their color */ + setage(curr, nextage[getage(curr)]); + if (getage(curr) == G_OLD1 && *pfirstold1 == NULL) + *pfirstold1 = curr; /* first OLD1 object in the list */ + } + p = &curr->next; /* go to next element */ + } + } + return p; +} + + +/* +** Traverse a list making all its elements white and clearing their +** age. In incremental mode, all objects are 'new' all the time, +** except for fixed strings (which are always old). +*/ +static void whitelist (global_State *g, GCObject *p) { + int white = luaC_white(g); + for (; p != NULL; p = p->next) + p->marked = cast_byte((p->marked & ~maskgcbits) | white); +} + + +/* +** Correct a list of gray objects. Return pointer to where rest of the +** list should be linked. +** Because this correction is done after sweeping, young objects might +** be turned white and still be in the list. They are only removed. +** 'TOUCHED1' objects are advanced to 'TOUCHED2' and remain on the list; +** Non-white threads also remain on the list; 'TOUCHED2' objects become +** regular old; they and anything else are removed from the list. +*/ +static GCObject **correctgraylist (GCObject **p) { + GCObject *curr; + while ((curr = *p) != NULL) { + GCObject **next = getgclist(curr); + if (iswhite(curr)) + goto remove; /* remove all white objects */ + else if (getage(curr) == G_TOUCHED1) { /* touched in this cycle? */ + lua_assert(isgray(curr)); + nw2black(curr); /* make it black, for next barrier */ + changeage(curr, G_TOUCHED1, G_TOUCHED2); + goto remain; /* keep it in the list and go to next element */ + } + else if (curr->tt == LUA_VTHREAD) { + lua_assert(isgray(curr)); + goto remain; /* keep non-white threads on the list */ + } + else { /* everything else is removed */ + lua_assert(isold(curr)); /* young objects should be white here */ + if (getage(curr) == G_TOUCHED2) /* advance from TOUCHED2... */ + changeage(curr, G_TOUCHED2, G_OLD); /* ... to OLD */ + nw2black(curr); /* make object black (to be removed) */ + goto remove; + } + remove: *p = *next; continue; + remain: p = next; continue; + } + return p; +} + + +/* +** Correct all gray lists, coalescing them into 'grayagain'. +*/ +static void correctgraylists (global_State *g) { + GCObject **list = correctgraylist(&g->grayagain); + *list = g->weak; g->weak = NULL; + list = correctgraylist(list); + *list = g->allweak; g->allweak = NULL; + list = correctgraylist(list); + *list = g->ephemeron; g->ephemeron = NULL; + correctgraylist(list); +} + + +/* +** Mark black 'OLD1' objects when starting a new young collection. +** Gray objects are already in some gray list, and so will be visited +** in the atomic step. +*/ +static void markold (global_State *g, GCObject *from, GCObject *to) { + GCObject *p; + for (p = from; p != to; p = p->next) { + if (getage(p) == G_OLD1) { + lua_assert(!iswhite(p)); + changeage(p, G_OLD1, G_OLD); /* now they are old */ + if (isblack(p)) + reallymarkobject(g, p); + } + } +} + + +/* +** Finish a young-generation collection. +*/ +static void finishgencycle (lua_State *L, global_State *g) { + correctgraylists(g); + checkSizes(L, g); + g->gcstate = GCSpropagate; /* skip restart */ + if (!g->gcemergency) + callallpendingfinalizers(L); +} + + +/* +** Does a young collection. First, mark 'OLD1' objects. Then does the +** atomic step. Then, sweep all lists and advance pointers. Finally, +** finish the collection. +*/ +static void youngcollection (lua_State *L, global_State *g) { + GCObject **psurvival; /* to point to first non-dead survival object */ + GCObject *dummy; /* dummy out parameter to 'sweepgen' */ + lua_assert(g->gcstate == GCSpropagate); + if (g->firstold1) { /* are there regular OLD1 objects? */ + markold(g, g->firstold1, g->reallyold); /* mark them */ + g->firstold1 = NULL; /* no more OLD1 objects (for now) */ + } + markold(g, g->finobj, g->finobjrold); + markold(g, g->tobefnz, NULL); + atomic(L); + + /* sweep nursery and get a pointer to its last live element */ + g->gcstate = GCSswpallgc; + psurvival = sweepgen(L, g, &g->allgc, g->survival, &g->firstold1); + /* sweep 'survival' */ + sweepgen(L, g, psurvival, g->old1, &g->firstold1); + g->reallyold = g->old1; + g->old1 = *psurvival; /* 'survival' survivals are old now */ + g->survival = g->allgc; /* all news are survivals */ + + /* repeat for 'finobj' lists */ + dummy = NULL; /* no 'firstold1' optimization for 'finobj' lists */ + psurvival = sweepgen(L, g, &g->finobj, g->finobjsur, &dummy); + /* sweep 'survival' */ + sweepgen(L, g, psurvival, g->finobjold1, &dummy); + g->finobjrold = g->finobjold1; + g->finobjold1 = *psurvival; /* 'survival' survivals are old now */ + g->finobjsur = g->finobj; /* all news are survivals */ + + sweepgen(L, g, &g->tobefnz, NULL, &dummy); + finishgencycle(L, g); +} + + +/* +** Clears all gray lists, sweeps objects, and prepare sublists to enter +** generational mode. The sweeps remove dead objects and turn all +** surviving objects to old. Threads go back to 'grayagain'; everything +** else is turned black (not in any gray list). +*/ +static void atomic2gen (lua_State *L, global_State *g) { + cleargraylists(g); + /* sweep all elements making them old */ + g->gcstate = GCSswpallgc; + sweep2old(L, &g->allgc); + /* everything alive now is old */ + g->reallyold = g->old1 = g->survival = g->allgc; + g->firstold1 = NULL; /* there are no OLD1 objects anywhere */ + + /* repeat for 'finobj' lists */ + sweep2old(L, &g->finobj); + g->finobjrold = g->finobjold1 = g->finobjsur = g->finobj; + + sweep2old(L, &g->tobefnz); + + g->gckind = KGC_GEN; + g->lastatomic = 0; + g->GCestimate = gettotalbytes(g); /* base for memory control */ + finishgencycle(L, g); +} + + +/* +** Enter generational mode. Must go until the end of an atomic cycle +** to ensure that all objects are correctly marked and weak tables +** are cleared. Then, turn all objects into old and finishes the +** collection. +*/ +static lu_mem entergen (lua_State *L, global_State *g) { + lu_mem numobjs; + luaC_runtilstate(L, bitmask(GCSpause)); /* prepare to start a new cycle */ + luaC_runtilstate(L, bitmask(GCSpropagate)); /* start new cycle */ + numobjs = atomic(L); /* propagates all and then do the atomic stuff */ + atomic2gen(L, g); + return numobjs; +} + + +/* +** Enter incremental mode. Turn all objects white, make all +** intermediate lists point to NULL (to avoid invalid pointers), +** and go to the pause state. +*/ +static void enterinc (global_State *g) { + whitelist(g, g->allgc); + g->reallyold = g->old1 = g->survival = NULL; + whitelist(g, g->finobj); + whitelist(g, g->tobefnz); + g->finobjrold = g->finobjold1 = g->finobjsur = NULL; + g->gcstate = GCSpause; + g->gckind = KGC_INC; + g->lastatomic = 0; +} + + +/* +** Change collector mode to 'newmode'. +*/ +void luaC_changemode (lua_State *L, int newmode) { + global_State *g = G(L); + if (newmode != g->gckind) { + if (newmode == KGC_GEN) /* entering generational mode? */ + entergen(L, g); + else + enterinc(g); /* entering incremental mode */ + } + g->lastatomic = 0; +} + + +/* +** Does a full collection in generational mode. +*/ +static lu_mem fullgen (lua_State *L, global_State *g) { + enterinc(g); + return entergen(L, g); +} + + +/* +** Set debt for the next minor collection, which will happen when +** memory grows 'genminormul'%. +*/ +static void setminordebt (global_State *g) { + luaE_setdebt(g, -(cast(l_mem, (gettotalbytes(g) / 100)) * g->genminormul)); +} + + +/* +** Does a major collection after last collection was a "bad collection". +** +** When the program is building a big structure, it allocates lots of +** memory but generates very little garbage. In those scenarios, +** the generational mode just wastes time doing small collections, and +** major collections are frequently what we call a "bad collection", a +** collection that frees too few objects. To avoid the cost of switching +** between generational mode and the incremental mode needed for full +** (major) collections, the collector tries to stay in incremental mode +** after a bad collection, and to switch back to generational mode only +** after a "good" collection (one that traverses less than 9/8 objects +** of the previous one). +** The collector must choose whether to stay in incremental mode or to +** switch back to generational mode before sweeping. At this point, it +** does not know the real memory in use, so it cannot use memory to +** decide whether to return to generational mode. Instead, it uses the +** number of objects traversed (returned by 'atomic') as a proxy. The +** field 'g->lastatomic' keeps this count from the last collection. +** ('g->lastatomic != 0' also means that the last collection was bad.) +*/ +static void stepgenfull (lua_State *L, global_State *g) { + lu_mem newatomic; /* count of traversed objects */ + lu_mem lastatomic = g->lastatomic; /* count from last collection */ + if (g->gckind == KGC_GEN) /* still in generational mode? */ + enterinc(g); /* enter incremental mode */ + luaC_runtilstate(L, bitmask(GCSpropagate)); /* start new cycle */ + newatomic = atomic(L); /* mark everybody */ + if (newatomic < lastatomic + (lastatomic >> 3)) { /* good collection? */ + atomic2gen(L, g); /* return to generational mode */ + setminordebt(g); + } + else { /* another bad collection; stay in incremental mode */ + g->GCestimate = gettotalbytes(g); /* first estimate */; + entersweep(L); + luaC_runtilstate(L, bitmask(GCSpause)); /* finish collection */ + setpause(g); + g->lastatomic = newatomic; + } +} + + +/* +** Does a generational "step". +** Usually, this means doing a minor collection and setting the debt to +** make another collection when memory grows 'genminormul'% larger. +** +** However, there are exceptions. If memory grows 'genmajormul'% +** larger than it was at the end of the last major collection (kept +** in 'g->GCestimate'), the function does a major collection. At the +** end, it checks whether the major collection was able to free a +** decent amount of memory (at least half the growth in memory since +** previous major collection). If so, the collector keeps its state, +** and the next collection will probably be minor again. Otherwise, +** we have what we call a "bad collection". In that case, set the field +** 'g->lastatomic' to signal that fact, so that the next collection will +** go to 'stepgenfull'. +** +** 'GCdebt <= 0' means an explicit call to GC step with "size" zero; +** in that case, do a minor collection. +*/ +static void genstep (lua_State *L, global_State *g) { + if (g->lastatomic != 0) /* last collection was a bad one? */ + stepgenfull(L, g); /* do a full step */ + else { + lu_mem majorbase = g->GCestimate; /* memory after last major collection */ + lu_mem majorinc = (majorbase / 100) * getgcparam(g->genmajormul); + if (g->GCdebt > 0 && gettotalbytes(g) > majorbase + majorinc) { + lu_mem numobjs = fullgen(L, g); /* do a major collection */ + if (gettotalbytes(g) < majorbase + (majorinc / 2)) { + /* collected at least half of memory growth since last major + collection; keep doing minor collections */ + setminordebt(g); + } + else { /* bad collection */ + g->lastatomic = numobjs; /* signal that last collection was bad */ + setpause(g); /* do a long wait for next (major) collection */ + } + } + else { /* regular case; do a minor collection */ + youngcollection(L, g); + setminordebt(g); + g->GCestimate = majorbase; /* preserve base value */ + } + } + lua_assert(isdecGCmodegen(g)); +} + +/* }====================================================== */ + + +/* +** {====================================================== +** GC control +** ======================================================= +*/ + + +/* +** Set the "time" to wait before starting a new GC cycle; cycle will +** start when memory use hits the threshold of ('estimate' * pause / +** PAUSEADJ). (Division by 'estimate' should be OK: it cannot be zero, +** because Lua cannot even start with less than PAUSEADJ bytes). +*/ +static void setpause (global_State *g) { + l_mem threshold, debt; + int pause = getgcparam(g->gcpause); + l_mem estimate = g->GCestimate / PAUSEADJ; /* adjust 'estimate' */ + lua_assert(estimate > 0); + threshold = (pause < MAX_LMEM / estimate) /* overflow? */ + ? estimate * pause /* no overflow */ + : MAX_LMEM; /* overflow; truncate to maximum */ + debt = gettotalbytes(g) - threshold; + if (debt > 0) debt = 0; + luaE_setdebt(g, debt); +} + + +/* +** Enter first sweep phase. +** The call to 'sweeptolive' makes the pointer 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. +*/ +static void entersweep (lua_State *L) { + global_State *g = G(L); + g->gcstate = GCSswpallgc; + lua_assert(g->sweepgc == NULL); + g->sweepgc = sweeptolive(L, &g->allgc); +} + + +/* +** Delete all objects in list 'p' until (but not including) object +** 'limit'. +*/ +static void deletelist (lua_State *L, GCObject *p, GCObject *limit) { + while (p != limit) { + GCObject *next = p->next; + freeobj(L, p); + p = next; + } +} + + +/* +** Call all finalizers of the objects in the given Lua state, and +** then free all objects, except for the main thread. +*/ +void luaC_freeallobjects (lua_State *L) { + global_State *g = G(L); + luaC_changemode(L, KGC_INC); + separatetobefnz(g, 1); /* separate all objects with finalizers */ + lua_assert(g->finobj == NULL); + callallpendingfinalizers(L); + deletelist(L, g->allgc, obj2gco(g->mainthread)); + deletelist(L, g->finobj, NULL); + deletelist(L, g->fixedgc, NULL); /* collect fixed objects */ + lua_assert(g->strt.nuse == 0); +} + + +static lu_mem atomic (lua_State *L) { + global_State *g = G(L); + lu_mem work = 0; + GCObject *origweak, *origall; + GCObject *grayagain = g->grayagain; /* save original list */ + g->grayagain = NULL; + lua_assert(g->ephemeron == NULL && g->weak == NULL); + lua_assert(!iswhite(g->mainthread)); + g->gcstate = GCSatomic; + markobject(g, L); /* mark running thread */ + /* registry and global metatables may be changed by API */ + markvalue(g, &g->l_registry); + markmt(g); /* mark global metatables */ + work += propagateall(g); /* empties 'gray' list */ + /* remark occasional upvalues of (maybe) dead threads */ + work += remarkupvals(g); + work += propagateall(g); /* propagate changes */ + g->gray = grayagain; + work += propagateall(g); /* traverse 'grayagain' list */ + convergeephemerons(g); + /* at this point, all strongly accessible objects are marked. */ + /* Clear values from weak tables, before checking finalizers */ + clearbyvalues(g, g->weak, NULL); + clearbyvalues(g, g->allweak, NULL); + origweak = g->weak; origall = g->allweak; + separatetobefnz(g, 0); /* separate objects to be finalized */ + work += markbeingfnz(g); /* mark objects that will be finalized */ + work += propagateall(g); /* remark, to propagate 'resurrection' */ + convergeephemerons(g); + /* at this point, all resurrected objects are marked. */ + /* remove dead objects from weak tables */ + clearbykeys(g, g->ephemeron); /* clear keys from all ephemeron tables */ + clearbykeys(g, g->allweak); /* clear keys from all 'allweak' tables */ + /* clear values from resurrected weak tables */ + clearbyvalues(g, g->weak, origweak); + clearbyvalues(g, g->allweak, origall); + luaS_clearcache(g); + g->currentwhite = cast_byte(otherwhite(g)); /* flip current white */ + lua_assert(g->gray == NULL); + return work; /* estimate of slots marked by 'atomic' */ +} + + +static int sweepstep (lua_State *L, global_State *g, + int nextstate, GCObject **nextlist) { + if (g->sweepgc) { + l_mem olddebt = g->GCdebt; + int count; + g->sweepgc = sweeplist(L, g->sweepgc, GCSWEEPMAX, &count); + g->GCestimate += g->GCdebt - olddebt; /* update estimate */ + return count; + } + else { /* enter next state */ + g->gcstate = nextstate; + g->sweepgc = nextlist; + return 0; /* no work done */ + } +} + + +static lu_mem singlestep (lua_State *L) { + global_State *g = G(L); + lu_mem work; + lua_assert(!g->gcstopem); /* collector is not reentrant */ + g->gcstopem = 1; /* no emergency collections while collecting */ + switch (g->gcstate) { + case GCSpause: { + restartcollection(g); + g->gcstate = GCSpropagate; + work = 1; + break; + } + case GCSpropagate: { + if (g->gray == NULL) { /* no more gray objects? */ + g->gcstate = GCSenteratomic; /* finish propagate phase */ + work = 0; + } + else + work = propagatemark(g); /* traverse one gray object */ + break; + } + case GCSenteratomic: { + work = atomic(L); /* work is what was traversed by 'atomic' */ + entersweep(L); + g->GCestimate = gettotalbytes(g); /* first estimate */; + break; + } + case GCSswpallgc: { /* sweep "regular" objects */ + work = sweepstep(L, g, GCSswpfinobj, &g->finobj); + break; + } + case GCSswpfinobj: { /* sweep objects with finalizers */ + work = sweepstep(L, g, GCSswptobefnz, &g->tobefnz); + break; + } + case GCSswptobefnz: { /* sweep objects to be finalized */ + work = sweepstep(L, g, GCSswpend, NULL); + break; + } + case GCSswpend: { /* finish sweeps */ + checkSizes(L, g); + g->gcstate = GCScallfin; + work = 0; + break; + } + case GCScallfin: { /* call remaining finalizers */ + if (g->tobefnz && !g->gcemergency) { + g->gcstopem = 0; /* ok collections during finalizers */ + work = runafewfinalizers(L, GCFINMAX) * GCFINALIZECOST; + } + else { /* emergency mode or no more finalizers */ + g->gcstate = GCSpause; /* finish collection */ + work = 0; + } + break; + } + default: lua_assert(0); return 0; + } + g->gcstopem = 0; + return work; +} + + +/* +** 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); +} + + +/* +** Performs a basic incremental step. The debt and step size are +** converted from bytes to "units of work"; then the function loops +** running single steps until adding that many units of work or +** finishing a cycle (pause state). Finally, it sets the debt that +** controls when next step will be performed. +*/ +static void incstep (lua_State *L, global_State *g) { + int stepmul = (getgcparam(g->gcstepmul) | 1); /* avoid division by 0 */ + l_mem debt = (g->GCdebt / WORK2MEM) * stepmul; + l_mem stepsize = (g->gcstepsize <= log2maxs(l_mem)) + ? ((cast(l_mem, 1) << g->gcstepsize) / WORK2MEM) * stepmul + : MAX_LMEM; /* overflow; keep maximum value */ + do { /* repeat until pause or enough "credit" (negative debt) */ + lu_mem work = singlestep(L); /* perform one single step */ + debt -= work; + } while (debt > -stepsize && g->gcstate != GCSpause); + if (g->gcstate == GCSpause) + setpause(g); /* pause until next cycle */ + else { + debt = (debt / stepmul) * WORK2MEM; /* convert 'work units' to bytes */ + luaE_setdebt(g, debt); + } +} + +/* +** performs a basic GC step if collector is running +*/ +void luaC_step (lua_State *L) { + global_State *g = G(L); + lua_assert(!g->gcemergency); + if (g->gcrunning) { /* running? */ + if(isdecGCmodegen(g)) + genstep(L, g); + else + incstep(L, g); + } +} + + +/* +** Perform a full collection in incremental mode. +** Before running the collection, check 'keepinvariant'; if it is true, +** there may be some objects marked as black, so the collector has +** to sweep all objects to turn them back to white (as white has not +** changed, nothing will be collected). +*/ +static void fullinc (lua_State *L, global_State *g) { + if (keepinvariant(g)) /* black objects? */ + entersweep(L); /* sweep everything to turn them back to white */ + /* finish any pending sweep phase to start a new cycle */ + luaC_runtilstate(L, bitmask(GCSpause)); + luaC_runtilstate(L, bitmask(GCScallfin)); /* run up to finalizers */ + /* estimate must be correct after a full GC cycle */ + lua_assert(g->GCestimate == gettotalbytes(g)); + luaC_runtilstate(L, bitmask(GCSpause)); /* finish collection */ + setpause(g); +} + + +/* +** Performs a full GC cycle; if 'isemergency', set a flag to avoid +** some operations which could change the interpreter state in some +** unexpected ways (running finalizers and shrinking some structures). +*/ +void luaC_fullgc (lua_State *L, int isemergency) { + global_State *g = G(L); + lua_assert(!g->gcemergency); + g->gcemergency = isemergency; /* set flag */ + if (g->gckind == KGC_INC) + fullinc(L, g); + else + fullgen(L, g); + g->gcemergency = 0; +} + +/* }====================================================== */ + + diff --git a/lua-5.4.3/src/lgc.h b/lua-5.4.3/src/lgc.h new file mode 100644 index 0000000..073e2a4 --- /dev/null +++ b/lua-5.4.3/src/lgc.h @@ -0,0 +1,189 @@ +/* +** $Id: lgc.h $ +** 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. (Open +** upvalues are an exception to this rule.) These lists have no meaning +** when the invariant is not being enforced (e.g., sweep phase). +*/ + + +/* +** Possible states of the Garbage Collector +*/ +#define GCSpropagate 0 +#define GCSenteratomic 1 +#define GCSatomic 2 +#define GCSswpallgc 3 +#define GCSswpfinobj 4 +#define GCSswptobefnz 5 +#define GCSswpend 6 +#define GCScallfin 7 +#define GCSpause 8 + + +#define issweepphase(g) \ + (GCSswpallgc <= (g)->gcstate && (g)->gcstate <= GCSswpend) + + +/* +** macro to tell when main invariant (white objects cannot point to black +** ones) must be kept. During a 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. +*/ + +#define keepinvariant(g) ((g)->gcstate <= GCSatomic) + + +/* +** some useful bit tricks +*/ +#define resetbits(x,m) ((x) &= cast_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. First three bits are +** used for object "age" in generational mode. Last bit is used +** by tests. +*/ +#define WHITE0BIT 3 /* object is white (type 0) */ +#define WHITE1BIT 4 /* object is white (type 1) */ +#define BLACKBIT 5 /* object is black */ +#define FINALIZEDBIT 6 /* object has been marked for finalization */ + +#define TESTBIT 7 + + + +#define WHITEBITS bit2mask(WHITE0BIT, WHITE1BIT) + + +#define iswhite(x) testbits((x)->marked, WHITEBITS) +#define isblack(x) testbit((x)->marked, BLACKBIT) +#define isgray(x) /* neither white nor black */ \ + (!testbits((x)->marked, WHITEBITS | bitmask(BLACKBIT))) + +#define tofinalize(x) testbit((x)->marked, FINALIZEDBIT) + +#define otherwhite(g) ((g)->currentwhite ^ WHITEBITS) +#define isdeadm(ow,m) ((m) & (ow)) +#define isdead(g,v) isdeadm(otherwhite(g), (v)->marked) + +#define changewhite(x) ((x)->marked ^= WHITEBITS) +#define nw2black(x) \ + check_exp(!iswhite(x), l_setbit((x)->marked, BLACKBIT)) + +#define luaC_white(g) cast_byte((g)->currentwhite & WHITEBITS) + + +/* object age in generational mode */ +#define G_NEW 0 /* created in current cycle */ +#define G_SURVIVAL 1 /* created in previous cycle */ +#define G_OLD0 2 /* marked old by frw. barrier in this cycle */ +#define G_OLD1 3 /* first full cycle as old */ +#define G_OLD 4 /* really old object (not to be visited) */ +#define G_TOUCHED1 5 /* old object touched this cycle */ +#define G_TOUCHED2 6 /* old object touched in previous cycle */ + +#define AGEBITS 7 /* all age bits (111) */ + +#define getage(o) ((o)->marked & AGEBITS) +#define setage(o,a) ((o)->marked = cast_byte(((o)->marked & (~AGEBITS)) | a)) +#define isold(o) (getage(o) > G_SURVIVAL) + +#define changeage(o,f,t) \ + check_exp(getage(o) == (f), (o)->marked ^= ((f)^(t))) + + +/* Default Values for GC parameters */ +#define LUAI_GENMAJORMUL 100 +#define LUAI_GENMINORMUL 20 + +/* wait memory to double before starting new cycle */ +#define LUAI_GCPAUSE 200 + +/* +** some gc parameters are stored divided by 4 to allow a maximum value +** up to 1023 in a 'lu_byte'. +*/ +#define getgcparam(p) ((p) * 4) +#define setgcparam(p,v) ((p) = (v) / 4) + +#define LUAI_GCMUL 100 + +/* how much to allocate before next GC step (log2) */ +#define LUAI_GCSTEPSIZE 13 /* 8 KB */ + + +/* +** Check whether the declared GC mode is generational. While in +** generational mode, the collector can go temporarily to incremental +** mode to improve performance. This is signaled by 'g->lastatomic != 0'. +*/ +#define isdecGCmodegen(g) (g->gckind == KGC_GEN || g->lastatomic != 0) + +/* +** Does one step of collection when debt becomes positive. 'pre'/'pos' +** allows some adjustments to be done only when needed. macro +** 'condchangemem' is used only for heavy tests (forcing a full +** GC cycle on every opportunity) +*/ +#define luaC_condGC(L,pre,pos) \ + { if (G(L)->GCdebt > 0) { pre; luaC_step(L); pos;}; \ + condchangemem(L,pre,pos); } + +/* more often than not, 'pre'/'pos' are empty */ +#define luaC_checkGC(L) luaC_condGC(L,(void)0,(void)0) + + +#define luaC_barrier(L,p,v) ( \ + (iscollectable(v) && isblack(p) && iswhite(gcvalue(v))) ? \ + luaC_barrier_(L,obj2gco(p),gcvalue(v)) : cast_void(0)) + +#define luaC_barrierback(L,p,v) ( \ + (iscollectable(v) && isblack(p) && iswhite(gcvalue(v))) ? \ + luaC_barrierback_(L,p) : cast_void(0)) + +#define luaC_objbarrier(L,p,o) ( \ + (isblack(p) && iswhite(o)) ? \ + luaC_barrier_(L,obj2gco(p),obj2gco(o)) : cast_void(0)) + +LUAI_FUNC void luaC_fix (lua_State *L, GCObject *o); +LUAI_FUNC void luaC_freeallobjects (lua_State *L); +LUAI_FUNC void luaC_step (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); +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_checkfinalizer (lua_State *L, GCObject *o, Table *mt); +LUAI_FUNC void luaC_changemode (lua_State *L, int newmode); + + +#endif diff --git a/lua-5.4.3/src/linit.c b/lua-5.4.3/src/linit.c new file mode 100644 index 0000000..69808f8 --- /dev/null +++ b/lua-5.4.3/src/linit.c @@ -0,0 +1,65 @@ +/* +** $Id: linit.c $ +** Initialization of libraries for lua.c and other clients +** See Copyright Notice in lua.h +*/ + + +#define linit_c +#define LUA_LIB + +/* +** 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. +** +** You can also *preload* libraries, so that a later 'require' can +** open the library, which is already linked to the application. +** For that, do the following code: +** +** luaL_getsubtable(L, LUA_REGISTRYINDEX, LUA_PRELOAD_TABLE); +** lua_pushcfunction(L, luaopen_modname); +** lua_setfield(L, -2, modname); +** lua_pop(L, 1); // remove PRELOAD table +*/ + +#include "lprefix.h" + + +#include + +#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[] = { + {LUA_GNAME, 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_MATHLIBNAME, luaopen_math}, + {LUA_UTF8LIBNAME, luaopen_utf8}, + {LUA_DBLIBNAME, luaopen_debug}, + {NULL, NULL} +}; + + +LUALIB_API void luaL_openlibs (lua_State *L) { + const luaL_Reg *lib; + /* "require" 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 */ + } +} + diff --git a/lua-5.4.3/src/liolib.c b/lua-5.4.3/src/liolib.c new file mode 100644 index 0000000..b08397d --- /dev/null +++ b/lua-5.4.3/src/liolib.c @@ -0,0 +1,828 @@ +/* +** $Id: liolib.c $ +** Standard I/O (and system) library +** See Copyright Notice in lua.h +*/ + +#define liolib_c +#define LUA_LIB + +#include "lprefix.h" + + +#include +#include +#include +#include +#include +#include + +#include "lua.h" + +#include "lauxlib.h" +#include "lualib.h" + + + + +/* +** Change this macro to accept other modes for 'fopen' besides +** the standard ones. +*/ +#if !defined(l_checkmode) + +/* accepted extensions to 'mode' in 'fopen' */ +#if !defined(L_MODEEXT) +#define L_MODEEXT "b" +#endif + +/* Check whether 'mode' matches '[rwa]%+?[L_MODEEXT]*' */ +static int l_checkmode (const char *mode) { + return (*mode != '\0' && strchr("rwa", *(mode++)) != NULL && + (*mode != '+' || ((void)(++mode), 1)) && /* skip if char is '+' */ + (strspn(mode, L_MODEEXT) == strlen(mode))); /* check extensions */ +} + +#endif + +/* +** {====================================================== +** l_popen spawns a new process connected to the current +** one through the file streams. +** ======================================================= +*/ + +#if !defined(l_popen) /* { */ + +#if defined(LUA_USE_POSIX) /* { */ + +#define l_popen(L,c,m) (fflush(NULL), popen(c,m)) +#define l_pclose(L,file) (pclose(file)) + +#elif defined(LUA_USE_WINDOWS) /* }{ */ + +#define l_popen(L,c,m) (_popen(c,m)) +#define l_pclose(L,file) (_pclose(file)) + +#if !defined(l_checkmodep) +/* Windows accepts "[rw][bt]?" as valid modes */ +#define l_checkmodep(m) ((m[0] == 'r' || m[0] == 'w') && \ + (m[1] == '\0' || ((m[1] == 'b' || m[1] == 't') && m[2] == '\0'))) +#endif + +#else /* }{ */ + +/* ISO C definitions */ +#define l_popen(L,c,m) \ + ((void)c, (void)m, \ + luaL_error(L, "'popen' not supported"), \ + (FILE*)0) +#define l_pclose(L,file) ((void)L, (void)file, -1) + +#endif /* } */ + +#endif /* } */ + + +#if !defined(l_checkmodep) +/* By default, Lua accepts only "r" or "w" as valid modes */ +#define l_checkmodep(m) ((m[0] == 'r' || m[0] == 'w') && m[1] == '\0') +#endif + +/* }====================================================== */ + + +#if !defined(l_getc) /* { */ + +#if defined(LUA_USE_POSIX) +#define l_getc(f) getc_unlocked(f) +#define l_lockfile(f) flockfile(f) +#define l_unlockfile(f) funlockfile(f) +#else +#define l_getc(f) getc(f) +#define l_lockfile(f) ((void)0) +#define l_unlockfile(f) ((void)0) +#endif + +#endif /* } */ + + +/* +** {====================================================== +** l_fseek: configuration for longer offsets +** ======================================================= +*/ + +#if !defined(l_fseek) /* { */ + +#if defined(LUA_USE_POSIX) /* { */ + +#include + +#define l_fseek(f,o,w) fseeko(f,o,w) +#define l_ftell(f) ftello(f) +#define l_seeknum off_t + +#elif defined(LUA_USE_WINDOWS) && !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 /* }{ */ + +/* ISO C definitions */ +#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 IOPREF_LEN (sizeof(IO_PREFIX)/sizeof(char) - 1) +#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) + luaL_pushfail(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 (l_unlikely(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 +** handle is in a consistent state. +*/ +static LStream *newprefile (lua_State *L) { + LStream *p = (LStream *)lua_newuserdatauv(L, sizeof(LStream), 0); + p->closef = NULL; /* mark file handle as 'closed' */ + luaL_setmetatable(L, LUA_FILEHANDLE); + return p; +} + + +/* +** Calls the 'close' function from a file handle. The 'volatile' avoids +** a bug in some versions of the Clang compiler (e.g., clang 3.0 for +** 32 bits). +*/ +static int aux_close (lua_State *L) { + LStream *p = tolstream(L); + volatile lua_CFunction cf = p->closef; + p->closef = NULL; /* mark stream as closed */ + return (*cf)(L); /* close it */ +} + + +static int f_close (lua_State *L) { + tofile(L); /* make sure argument is an open stream */ + return aux_close(L); +} + + +static int io_close (lua_State *L) { + if (lua_isnone(L, 1)) /* no argument? */ + lua_getfield(L, LUA_REGISTRYINDEX, IO_OUTPUT); /* use default output */ + return f_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 (l_unlikely(p->f == NULL)) + luaL_error(L, "cannot open file '%s' (%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, l_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); + errno = 0; + return luaL_execresult(L, l_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); + luaL_argcheck(L, l_checkmodep(mode), 2, "invalid mode"); + p->f = l_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 (l_unlikely(isclosed(p))) + luaL_error(L, "default %s file is closed", findex + IOPREF_LEN); + 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); + + +/* +** maximum number of arguments to 'f:lines'/'io.lines' (it + 3 must fit +** in the limit for upvalues of a closure) +*/ +#define MAXARGLINE 250 + +/* +** Auxiliary function to create the iteration function for 'lines'. +** The iteration function is a closure over 'io_readline', with +** the following upvalues: +** 1) The file being read (first value in the stack) +** 2) the number of arguments to read +** 3) a boolean, true iff file has to be closed when finished ('toclose') +** *) a variable number of format arguments (rest of the stack) +*/ +static void aux_lines (lua_State *L, int toclose) { + int n = lua_gettop(L) - 1; /* number of arguments to read */ + luaL_argcheck(L, n <= MAXARGLINE, MAXARGLINE + 2, "too many arguments"); + lua_pushvalue(L, 1); /* file */ + lua_pushinteger(L, n); /* number of arguments to read */ + lua_pushboolean(L, toclose); /* close/not close file when finished */ + lua_rotate(L, 2, 3); /* move the three values to their positions */ + 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; +} + + +/* +** Return an iteration function for 'io.lines'. If file has to be +** closed, also returns the file itself as a second result (to be +** closed as the state at the exit of a generic for). +*/ +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); /* push iteration function */ + if (toclose) { + lua_pushnil(L); /* state */ + lua_pushnil(L); /* control */ + lua_pushvalue(L, 1); /* file is the to-be-closed variable (4th result) */ + return 4; + } + else + return 1; +} + + +/* +** {====================================================== +** READ +** ======================================================= +*/ + + +/* maximum length of a numeral */ +#if !defined (L_MAXLENNUM) +#define L_MAXLENNUM 200 +#endif + + +/* auxiliary structure used by 'read_number' */ +typedef struct { + FILE *f; /* file being read */ + int c; /* current character (look ahead) */ + int n; /* number of elements in buffer 'buff' */ + char buff[L_MAXLENNUM + 1]; /* +1 for ending '\0' */ +} RN; + + +/* +** Add current char to buffer (if not out of space) and read next one +*/ +static int nextc (RN *rn) { + if (l_unlikely(rn->n >= L_MAXLENNUM)) { /* buffer overflow? */ + rn->buff[0] = '\0'; /* invalidate result */ + return 0; /* fail */ + } + else { + rn->buff[rn->n++] = rn->c; /* save current char */ + rn->c = l_getc(rn->f); /* read next one */ + return 1; + } +} + + +/* +** Accept current char if it is in 'set' (of size 2) +*/ +static int test2 (RN *rn, const char *set) { + if (rn->c == set[0] || rn->c == set[1]) + return nextc(rn); + else return 0; +} + + +/* +** Read a sequence of (hex)digits +*/ +static int readdigits (RN *rn, int hex) { + int count = 0; + while ((hex ? isxdigit(rn->c) : isdigit(rn->c)) && nextc(rn)) + count++; + return count; +} + + +/* +** Read a number: first reads a valid prefix of a numeral into a buffer. +** Then it calls 'lua_stringtonumber' to check whether the format is +** correct and to convert it to a Lua number. +*/ +static int read_number (lua_State *L, FILE *f) { + RN rn; + int count = 0; + int hex = 0; + char decp[2]; + rn.f = f; rn.n = 0; + decp[0] = lua_getlocaledecpoint(); /* get decimal point from locale */ + decp[1] = '.'; /* always accept a dot */ + l_lockfile(rn.f); + do { rn.c = l_getc(rn.f); } while (isspace(rn.c)); /* skip spaces */ + test2(&rn, "-+"); /* optional sign */ + if (test2(&rn, "00")) { + if (test2(&rn, "xX")) hex = 1; /* numeral is hexadecimal */ + else count = 1; /* count initial '0' as a valid digit */ + } + count += readdigits(&rn, hex); /* integral part */ + if (test2(&rn, decp)) /* decimal point? */ + count += readdigits(&rn, hex); /* fractional part */ + if (count > 0 && test2(&rn, (hex ? "pP" : "eE"))) { /* exponent mark? */ + test2(&rn, "-+"); /* exponent sign */ + readdigits(&rn, 0); /* exponent digits */ + } + ungetc(rn.c, rn.f); /* unread look-ahead char */ + l_unlockfile(rn.f); + rn.buff[rn.n] = '\0'; /* finish string */ + if (l_likely(lua_stringtonumber(L, rn.buff))) + return 1; /* ok, it is a valid number */ + else { /* invalid format */ + 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); /* no-op when c == EOF */ + lua_pushliteral(L, ""); + return (c != EOF); +} + + +static int read_line (lua_State *L, FILE *f, int chop) { + luaL_Buffer b; + int c; + luaL_buffinit(L, &b); + do { /* may need to read several chunks to get whole line */ + char *buff = luaL_prepbuffer(&b); /* preallocate buffer space */ + int i = 0; + l_lockfile(f); /* no memory errors can happen inside the lock */ + while (i < LUAL_BUFFERSIZE && (c = l_getc(f)) != EOF && c != '\n') + buff[i++] = c; /* read up to end of line or buffer limit */ + l_unlockfile(f); + luaL_addsize(&b, i); + } while (c != EOF && c != '\n'); /* repeat until end of line */ + if (!chop && c == '\n') /* want a newline and have one? */ + luaL_addchar(&b, c); /* add ending newline to result */ + luaL_pushresult(&b); /* close buffer */ + /* return ok if read something (either a newline or something else) */ + return (c == '\n' || lua_rawlen(L, -1) > 0); +} + + +static void read_all (lua_State *L, FILE *f) { + size_t nr; + luaL_Buffer b; + luaL_buffinit(L, &b); + do { /* read file in chunks of LUAL_BUFFERSIZE bytes */ + char *p = luaL_prepbuffer(&b); + nr = fread(p, sizeof(char), LUAL_BUFFERSIZE, f); + luaL_addsize(&b, nr); + } while (nr == LUAL_BUFFERSIZE); + 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 n, success; + 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)luaL_checkinteger(L, n); + success = (l == 0) ? test_eof(L, f) : read_chars(L, f, l); + } + else { + const char *p = luaL_checkstring(L, n); + if (*p == '*') p++; /* skip optional '*' (for compatibility) */ + switch (*p) { + 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 */ + luaL_pushfail(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); +} + + +/* +** Iteration function for 'lines'. +*/ +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); + luaL_checkstack(L, n, "too many arguments"); + 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_toboolean(L, -n)) /* read at least one value? */ + return n; /* return them */ + else { /* first result is false: 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); /* clear stack */ + lua_pushvalue(L, lua_upvalueindex(1)); /* push file at index 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 */ + int len = lua_isinteger(L, arg) + ? fprintf(f, LUA_INTEGER_FMT, + (LUAI_UACINT)lua_tointeger(L, arg)) + : fprintf(f, LUA_NUMBER_FMT, + (LUAI_UACNUMBER)lua_tonumber(L, arg)); + status = status && (len > 0); + } + else { + size_t l; + const char *s = luaL_checklstring(L, arg, &l); + status = status && (fwrite(s, sizeof(char), l, f) == l); + } + } + if (l_likely(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_Integer p3 = luaL_optinteger(L, 3, 0); + l_seeknum offset = (l_seeknum)p3; + luaL_argcheck(L, (lua_Integer)offset == p3, 3, + "not an integer in proper range"); + op = l_fseek(f, offset, mode[op]); + if (l_unlikely(op)) + return luaL_fileresult(L, 0, NULL); /* error */ + else { + lua_pushinteger(L, (lua_Integer)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], (size_t)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 meth[] = { + {"read", f_read}, + {"write", f_write}, + {"lines", f_lines}, + {"flush", f_flush}, + {"seek", f_seek}, + {"close", f_close}, + {"setvbuf", f_setvbuf}, + {NULL, NULL} +}; + + +/* +** metamethods for file handles +*/ +static const luaL_Reg metameth[] = { + {"__index", NULL}, /* place holder */ + {"__gc", f_gc}, + {"__close", f_gc}, + {"__tostring", f_tostring}, + {NULL, NULL} +}; + + +static void createmeta (lua_State *L) { + luaL_newmetatable(L, LUA_FILEHANDLE); /* metatable for file handles */ + luaL_setfuncs(L, metameth, 0); /* add metamethods to new metatable */ + luaL_newlibtable(L, meth); /* create method table */ + luaL_setfuncs(L, meth, 0); /* add file methods to method table */ + lua_setfield(L, -2, "__index"); /* metatable.__index = method table */ + lua_pop(L, 1); /* pop 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 */ + luaL_pushfail(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/lua-5.4.3/src/ljumptab.h b/lua-5.4.3/src/ljumptab.h new file mode 100644 index 0000000..8306f25 --- /dev/null +++ b/lua-5.4.3/src/ljumptab.h @@ -0,0 +1,112 @@ +/* +** $Id: ljumptab.h $ +** Jump Table for the Lua interpreter +** See Copyright Notice in lua.h +*/ + + +#undef vmdispatch +#undef vmcase +#undef vmbreak + +#define vmdispatch(x) goto *disptab[x]; + +#define vmcase(l) L_##l: + +#define vmbreak vmfetch(); vmdispatch(GET_OPCODE(i)); + + +static const void *const disptab[NUM_OPCODES] = { + +#if 0 +** you can update the following list with this command: +** +** sed -n '/^OP_/\!d; s/OP_/\&\&L_OP_/ ; s/,.*/,/ ; s/\/.*// ; p' lopcodes.h +** +#endif + +&&L_OP_MOVE, +&&L_OP_LOADI, +&&L_OP_LOADF, +&&L_OP_LOADK, +&&L_OP_LOADKX, +&&L_OP_LOADFALSE, +&&L_OP_LFALSESKIP, +&&L_OP_LOADTRUE, +&&L_OP_LOADNIL, +&&L_OP_GETUPVAL, +&&L_OP_SETUPVAL, +&&L_OP_GETTABUP, +&&L_OP_GETTABLE, +&&L_OP_GETI, +&&L_OP_GETFIELD, +&&L_OP_SETTABUP, +&&L_OP_SETTABLE, +&&L_OP_SETI, +&&L_OP_SETFIELD, +&&L_OP_NEWTABLE, +&&L_OP_SELF, +&&L_OP_ADDI, +&&L_OP_ADDK, +&&L_OP_SUBK, +&&L_OP_MULK, +&&L_OP_MODK, +&&L_OP_POWK, +&&L_OP_DIVK, +&&L_OP_IDIVK, +&&L_OP_BANDK, +&&L_OP_BORK, +&&L_OP_BXORK, +&&L_OP_SHRI, +&&L_OP_SHLI, +&&L_OP_ADD, +&&L_OP_SUB, +&&L_OP_MUL, +&&L_OP_MOD, +&&L_OP_POW, +&&L_OP_DIV, +&&L_OP_IDIV, +&&L_OP_BAND, +&&L_OP_BOR, +&&L_OP_BXOR, +&&L_OP_SHL, +&&L_OP_SHR, +&&L_OP_MMBIN, +&&L_OP_MMBINI, +&&L_OP_MMBINK, +&&L_OP_UNM, +&&L_OP_BNOT, +&&L_OP_NOT, +&&L_OP_LEN, +&&L_OP_CONCAT, +&&L_OP_CLOSE, +&&L_OP_TBC, +&&L_OP_JMP, +&&L_OP_EQ, +&&L_OP_LT, +&&L_OP_LE, +&&L_OP_EQK, +&&L_OP_EQI, +&&L_OP_LTI, +&&L_OP_LEI, +&&L_OP_GTI, +&&L_OP_GEI, +&&L_OP_TEST, +&&L_OP_TESTSET, +&&L_OP_CALL, +&&L_OP_TAILCALL, +&&L_OP_RETURN, +&&L_OP_RETURN0, +&&L_OP_RETURN1, +&&L_OP_FORLOOP, +&&L_OP_FORPREP, +&&L_OP_TFORPREP, +&&L_OP_TFORCALL, +&&L_OP_TFORLOOP, +&&L_OP_SETLIST, +&&L_OP_CLOSURE, +&&L_OP_VARARG, +&&L_OP_VARARGPREP, +&&L_OP_EXTRAARG + +}; diff --git a/lua-5.4.3/src/llex.c b/lua-5.4.3/src/llex.c new file mode 100644 index 0000000..e991517 --- /dev/null +++ b/lua-5.4.3/src/llex.c @@ -0,0 +1,581 @@ +/* +** $Id: llex.c $ +** Lexical Analyzer +** See Copyright Notice in lua.h +*/ + +#define llex_c +#define LUA_CORE + +#include "lprefix.h" + + +#include +#include + +#include "lua.h" + +#include "lctype.h" +#include "ldebug.h" +#include "ldo.h" +#include "lgc.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_SIZE/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; + TString *e = luaS_newliteral(L, LUA_ENV); /* create env name */ + luaC_fix(L, obj2gco(e)); /* never collect this name */ + for (i=0; iextra = cast_byte(i+1); /* reserved word */ + } +} + + +const char *luaX_token2str (LexState *ls, int token) { + if (token < FIRST_RESERVED) { /* single-byte symbols? */ + if (lisprint(token)) + return luaO_pushfstring(ls->L, "'%c'", token); + else /* control character */ + return luaO_pushfstring(ls->L, "'<\\%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, "'%s'", 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_FLT: case TK_INT: + save(ls, '\0'); + return luaO_pushfstring(ls->L, "'%s'", luaZ_buffer(ls->buff)); + default: + return luaX_token2str(ls, token); + } +} + + +static l_noret lexerror (LexState *ls, const char *msg, int token) { + msg = luaG_addinfo(ls->L, msg, ls->source, ls->linenumber); + 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 scanner's table so that it +** will not be collected until the end of the compilation; by that time +** it should be anchored somewhere. It also internalizes long strings, +** ensuring there is only one copy of each unique string. The table +** here is used as a set: the string enters as the key, while its value +** is irrelevant. We use the string itself as the value only because it +** is a TValue readly available. Later, the code generation can change +** this value. +*/ +TString *luaX_newstring (LexState *ls, const char *str, size_t l) { + lua_State *L = ls->L; + TString *ts = luaS_newlstr(L, str, l); /* create new string */ + const TValue *o = luaH_getstr(ls->h, ts); + if (!ttisnil(o)) /* string already present? */ + ts = keystrval(nodefromval(o)); /* get saved copy */ + else { /* not in use yet */ + TValue *stv = s2v(L->top++); /* reserve stack space for string */ + setsvalue(L, stv, ts); /* temporarily anchor the string */ + luaH_finishset(L, ls->h, stv, o, stv); /* t[string] = string */ + /* table is not a metatable, so it does not need to invalidate cache */ + 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) + lexerror(ls, "chunk has too many lines", 0); +} + + +void luaX_setinput (lua_State *L, LexState *ls, ZIO *z, TString *source, + int firstchar) { + ls->t.token = 0; + 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_newliteral(L, LUA_ENV); /* get env name */ + luaZ_resizebuffer(ls->L, ls->buff, LUA_MINBUFFER); /* initialize buffer */ +} + + + +/* +** ======================================================= +** LEXICAL ANALYZER +** ======================================================= +*/ + + +static int check_next1 (LexState *ls, int c) { + if (ls->current == c) { + next(ls); + return 1; + } + else return 0; +} + + +/* +** Check whether current char is in set 'set' (with two chars) and +** saves it +*/ +static int check_next2 (LexState *ls, const char *set) { + lua_assert(set[2] == '\0'); + if (ls->current == set[0] || ls->current == set[1]) { + save_and_next(ls); + return 1; + } + else return 0; +} + + +/* LUA_NUMBER */ +/* +** This function is quite liberal in what it accepts, as 'luaO_str2num' +** will reject ill-formed numerals. Roughly, it accepts the following +** pattern: +** +** %d(%x|%.|([Ee][+-]?))* | 0[Xx](%x|%.|([Pp][+-]?))* +** +** The only tricky part is to accept [+-] only after a valid exponent +** mark, to avoid reading '3-4' or '0xe+1' as a single number. +** +** The caller might have already read an initial dot. +*/ +static int read_numeral (LexState *ls, SemInfo *seminfo) { + TValue obj; + const char *expo = "Ee"; + int first = ls->current; + lua_assert(lisdigit(ls->current)); + save_and_next(ls); + if (first == '0' && check_next2(ls, "xX")) /* hexadecimal? */ + expo = "Pp"; + for (;;) { + if (check_next2(ls, expo)) /* exponent mark? */ + check_next2(ls, "-+"); /* optional exponent sign */ + else if (lisxdigit(ls->current) || ls->current == '.') /* '%x|%.' */ + save_and_next(ls); + else break; + } + if (lislalpha(ls->current)) /* is numeral touching a letter? */ + save_and_next(ls); /* force an error */ + save(ls, '\0'); + if (luaO_str2num(luaZ_buffer(ls->buff), &obj) == 0) /* format error? */ + lexerror(ls, "malformed number", TK_FLT); + if (ttisinteger(&obj)) { + seminfo->i = ivalue(&obj); + return TK_INT; + } + else { + lua_assert(ttisfloat(&obj)); + seminfo->r = fltvalue(&obj); + return TK_FLT; + } +} + + +/* +** read a sequence '[=*[' or ']=*]', leaving the last bracket. If +** sequence is well formed, return its number of '='s + 2; otherwise, +** return 1 if it is a single bracket (no '='s and no 2nd bracket); +** otherwise (an unfinished '[==...') return 0. +*/ +static size_t skip_sep (LexState *ls) { + size_t 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 + 2 + : (count == 0) ? 1 + : 0; +} + + +static void read_long_string (LexState *ls, SemInfo *seminfo, size_t sep) { + int line = ls->linenumber; /* initial line (for error message) */ + save_and_next(ls); /* skip 2nd '[' */ + if (currIsNewline(ls)) /* string starts with a newline? */ + inclinenumber(ls); /* skip it */ + for (;;) { + switch (ls->current) { + case EOZ: { /* error */ + const char *what = (seminfo ? "string" : "comment"); + const char *msg = luaO_pushfstring(ls->L, + "unfinished long %s (starting at line %d)", what, line); + lexerror(ls, msg, 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) + sep, + luaZ_bufflen(ls->buff) - 2 * sep); +} + + +static void esccheck (LexState *ls, int c, const char *msg) { + if (!c) { + if (ls->current != EOZ) + save_and_next(ls); /* add current to buffer for error message */ + lexerror(ls, msg, TK_STRING); + } +} + + +static int gethexa (LexState *ls) { + save_and_next(ls); + esccheck (ls, lisxdigit(ls->current), "hexadecimal digit expected"); + return luaO_hexavalue(ls->current); +} + + +static int readhexaesc (LexState *ls) { + int r = gethexa(ls); + r = (r << 4) + gethexa(ls); + luaZ_buffremove(ls->buff, 2); /* remove saved chars from buffer */ + return r; +} + + +static unsigned long readutf8esc (LexState *ls) { + unsigned long r; + int i = 4; /* chars to be removed: '\', 'u', '{', and first digit */ + save_and_next(ls); /* skip 'u' */ + esccheck(ls, ls->current == '{', "missing '{'"); + r = gethexa(ls); /* must have at least one digit */ + while (cast_void(save_and_next(ls)), lisxdigit(ls->current)) { + i++; + esccheck(ls, r <= (0x7FFFFFFFu >> 4), "UTF-8 value too large"); + r = (r << 4) + luaO_hexavalue(ls->current); + } + esccheck(ls, ls->current == '}', "missing '}'"); + next(ls); /* skip '}' */ + luaZ_buffremove(ls->buff, i); /* remove saved chars from buffer */ + return r; +} + + +static void utf8esc (LexState *ls) { + char buff[UTF8BUFFSZ]; + int n = luaO_utf8esc(buff, readutf8esc(ls)); + for (; n > 0; n--) /* add 'buff' to string */ + save(ls, buff[UTF8BUFFSZ - n]); +} + + +static int readdecesc (LexState *ls) { + int i; + int r = 0; /* result accumulator */ + for (i = 0; i < 3 && lisdigit(ls->current); i++) { /* read up to 3 digits */ + r = 10*r + ls->current - '0'; + save_and_next(ls); + } + esccheck(ls, r <= UCHAR_MAX, "decimal escape too large"); + luaZ_buffremove(ls->buff, i); /* remove read digits from buffer */ + 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 */ + save_and_next(ls); /* keep '\\' for error messages */ + 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 'u': utf8esc(ls); goto no_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 */ + luaZ_buffremove(ls->buff, 1); /* remove '\\' */ + next(ls); /* skip the 'z' */ + while (lisspace(ls->current)) { + if (currIsNewline(ls)) inclinenumber(ls); + else next(ls); + } + goto no_save; + } + default: { + esccheck(ls, lisdigit(ls->current), "invalid escape sequence"); + c = readdecesc(ls); /* digital escape '\ddd' */ + goto only_save; + } + } + read_save: + next(ls); + /* go through */ + only_save: + luaZ_buffremove(ls->buff, 1); /* remove '\\' */ + save(ls, c); + /* go through */ + 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? */ + size_t sep = skip_sep(ls); + luaZ_resetbuffer(ls->buff); /* 'skip_sep' may dirty the buffer */ + if (sep >= 2) { + 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 '[' */ + size_t sep = skip_sep(ls); + if (sep >= 2) { + read_long_string(ls, seminfo, sep); + return TK_STRING; + } + else if (sep == 0) /* '[=...' missing second bracket? */ + lexerror(ls, "invalid long string delimiter", TK_STRING); + return '['; + } + case '=': { + next(ls); + if (check_next1(ls, '=')) return TK_EQ; /* '==' */ + else return '='; + } + case '<': { + next(ls); + if (check_next1(ls, '=')) return TK_LE; /* '<=' */ + else if (check_next1(ls, '<')) return TK_SHL; /* '<<' */ + else return '<'; + } + case '>': { + next(ls); + if (check_next1(ls, '=')) return TK_GE; /* '>=' */ + else if (check_next1(ls, '>')) return TK_SHR; /* '>>' */ + else return '>'; + } + case '/': { + next(ls); + if (check_next1(ls, '/')) return TK_IDIV; /* '//' */ + else return '/'; + } + case '~': { + next(ls); + if (check_next1(ls, '=')) return TK_NE; /* '~=' */ + else return '~'; + } + case ':': { + next(ls); + if (check_next1(ls, ':')) return TK_DBCOLON; /* '::' */ + else return ':'; + } + case '"': case '\'': { /* short literal strings */ + read_string(ls, ls->current, seminfo); + return TK_STRING; + } + case '.': { /* '.', '..', '...', or number */ + save_and_next(ls); + if (check_next1(ls, '.')) { + if (check_next1(ls, '.')) + return TK_DOTS; /* '...' */ + else return TK_CONCAT; /* '..' */ + } + else if (!lisdigit(ls->current)) return '.'; + else return read_numeral(ls, seminfo); + } + case '0': case '1': case '2': case '3': case '4': + case '5': case '6': case '7': case '8': case '9': { + return read_numeral(ls, seminfo); + } + 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->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/lua-5.4.3/src/llex.h b/lua-5.4.3/src/llex.h new file mode 100644 index 0000000..389d2f8 --- /dev/null +++ b/lua-5.4.3/src/llex.h @@ -0,0 +1,91 @@ +/* +** $Id: llex.h $ +** Lexical Analyzer +** See Copyright Notice in lua.h +*/ + +#ifndef llex_h +#define llex_h + +#include + +#include "lobject.h" +#include "lzio.h" + + +/* +** Single-char tokens (terminal symbols) are represented by their own +** numeric code. Other tokens start at the following value. +*/ +#define FIRST_RESERVED (UCHAR_MAX + 1) + + +#if !defined(LUA_ENV) +#define LUA_ENV "_ENV" +#endif + + +/* +* 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_IDIV, TK_CONCAT, TK_DOTS, TK_EQ, TK_GE, TK_LE, TK_NE, + TK_SHL, TK_SHR, + TK_DBCOLON, TK_EOS, + TK_FLT, TK_INT, TK_NAME, TK_STRING +}; + +/* number of reserved words */ +#define NUM_RESERVED (cast_int(TK_WHILE-FIRST_RESERVED + 1)) + + +typedef union { + lua_Number r; + lua_Integer i; + 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 */ + Table *h; /* to avoid collection/reuse strings */ + struct Dyndata *dyd; /* dynamic structures used by the parser */ + TString *source; /* current source name */ + TString *envn; /* environment variable name */ +} 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/lua-5.4.3/src/llimits.h b/lua-5.4.3/src/llimits.h new file mode 100644 index 0000000..025f1c8 --- /dev/null +++ b/lua-5.4.3/src/llimits.h @@ -0,0 +1,353 @@ +/* +** $Id: llimits.h $ +** 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" + + +/* +** 'lu_mem' and 'l_mem' are unsigned/signed integers big enough to count +** the total memory used by Lua (in bytes). Usually, 'size_t' and +** 'ptrdiff_t' should work, but we use 'long' for 16-bit machines. +*/ +#if defined(LUAI_MEM) /* { external definitions? */ +typedef LUAI_UMEM lu_mem; +typedef LUAI_MEM l_mem; +#elif LUAI_IS32INT /* }{ */ +typedef size_t lu_mem; +typedef ptrdiff_t l_mem; +#else /* 16-bit ints */ /* }{ */ +typedef unsigned long lu_mem; +typedef long l_mem; +#endif /* } */ + + +/* chars used as small naturals (so that 'char' is reserved for characters) */ +typedef unsigned char lu_byte; +typedef signed char ls_byte; + + +/* maximum value for size_t */ +#define MAX_SIZET ((size_t)(~(size_t)0)) + +/* maximum size visible for Lua (must be representable in a lua_Integer) */ +#define MAX_SIZE (sizeof(size_t) < sizeof(lua_Integer) ? MAX_SIZET \ + : (size_t)(LUA_MAXINTEGER)) + + +#define MAX_LUMEM ((lu_mem)(~(lu_mem)0)) + +#define MAX_LMEM ((l_mem)(MAX_LUMEM >> 1)) + + +#define MAX_INT INT_MAX /* maximum value of an int */ + + +/* +** floor of the log2 of the maximum signed value for integral type 't'. +** (That is, maximum 'n' such that '2^n' fits in the given signed type.) +*/ +#define log2maxs(t) (sizeof(t) * 8 - 2) + + +/* +** test whether an unsigned value is a power of 2 (or zero) +*/ +#define ispow2(x) (((x) & ((x) - 1)) == 0) + + +/* number of chars of a literal string without the ending \0 */ +#define LL(x) (sizeof(x)/sizeof(char) - 1) + + +/* +** conversion of pointer to unsigned integer: +** this is for hashing only; there is no problem if the integer +** cannot hold the whole pointer value +*/ +#define point2uint(p) ((unsigned int)((size_t)(p) & UINT_MAX)) + + + +/* types of 'usual argument conversions' for lua_Number and lua_Integer */ +typedef LUAI_UACNUMBER l_uacNumber; +typedef LUAI_UACINT l_uacInt; + + +/* +** Internal assertions for in-house debugging +*/ +#if defined LUAI_ASSERT +#undef NDEBUG +#include +#define lua_assert(c) assert(c) +#endif + +#if defined(lua_assert) +#define check_exp(c,e) (lua_assert(c), (e)) +/* to avoid problems with conditions too long */ +#define lua_longassert(c) ((c) ? (void)0 : 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) +#define luai_apicheck(l,e) ((void)l, lua_assert(e)) +#endif + +#define api_check(l,e,msg) luai_apicheck(l,(e) && msg) + + +/* macro to avoid warnings about unused variables */ +#if !defined(UNUSED) +#define UNUSED(x) ((void)(x)) +#endif + + +/* type casts (a macro highlights casts in the code) */ +#define cast(t, exp) ((t)(exp)) + +#define cast_void(i) cast(void, (i)) +#define cast_voidp(i) cast(void *, (i)) +#define cast_num(i) cast(lua_Number, (i)) +#define cast_int(i) cast(int, (i)) +#define cast_uint(i) cast(unsigned int, (i)) +#define cast_byte(i) cast(lu_byte, (i)) +#define cast_uchar(i) cast(unsigned char, (i)) +#define cast_char(i) cast(char, (i)) +#define cast_charp(i) cast(char *, (i)) +#define cast_sizet(i) cast(size_t, (i)) + + +/* cast a signed lua_Integer to lua_Unsigned */ +#if !defined(l_castS2U) +#define l_castS2U(i) ((lua_Unsigned)(i)) +#endif + +/* +** cast a lua_Unsigned to a signed lua_Integer; this cast is +** not strict ISO C, but two-complement architectures should +** work fine. +*/ +#if !defined(l_castU2S) +#define l_castU2S(i) ((lua_Integer)(i)) +#endif + + +/* +** non-return type +*/ +#if !defined(l_noret) + +#if defined(__GNUC__) +#define l_noret void __attribute__((noreturn)) +#elif defined(_MSC_VER) && _MSC_VER >= 1200 +#define l_noret void __declspec(noreturn) +#else +#define l_noret void +#endif + +#endif + + +/* +** type for virtual-machine instructions; +** must be an unsigned with (at least) 4 bytes (see details in lopcodes.h) +*/ +#if LUAI_IS32INT +typedef unsigned int l_uint32; +#else +typedef unsigned long l_uint32; +#endif + +typedef l_uint32 Instruction; + + + +/* +** 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.) +*/ +#if !defined(LUAI_MAXSHORTLEN) +#define LUAI_MAXSHORTLEN 40 +#endif + + +/* +** Initial size for the string table (must be power of 2). +** The Lua core alone registers ~50 strings (reserved words + +** metaevent keys + a few others). Libraries would typically add +** a few dozens more. +*/ +#if !defined(MINSTRTABSIZE) +#define MINSTRTABSIZE 128 +#endif + + +/* +** Size of cache for strings in the API. 'N' is the number of +** sets (better be a prime) and "M" is the size of each set (M == 1 +** makes a direct cache.) +*/ +#if !defined(STRCACHE_N) +#define STRCACHE_N 53 +#define STRCACHE_M 2 +#endif + + +/* minimum size for string buffer */ +#if !defined(LUA_MINBUFFER) +#define LUA_MINBUFFER 32 +#endif + + +/* +** Maximum depth for nested C calls, syntactical nested non-terminals, +** and other features implemented through recursion in C. (Value must +** fit in a 16-bit unsigned integer. It must also be compatible with +** the size of the C stack.) +*/ +#if !defined(LUAI_MAXCCALLS) +#define LUAI_MAXCCALLS 200 +#endif + + +/* +** macros that are executed whenever program enters the Lua core +** ('lua_lock') and leaves the core ('lua_unlock') +*/ +#if !defined(lua_lock) +#define lua_lock(L) ((void) 0) +#define lua_unlock(L) ((void) 0) +#endif + +/* +** macro executed during Lua functions at points where the +** function can yield. +*/ +#if !defined(luai_threadyield) +#define luai_threadyield(L) {lua_unlock(L); lua_lock(L);} +#endif + + +/* +** these macros allow user-specific actions 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 + + + +/* +** The luai_num* macros define the primitive operations over numbers. +*/ + +/* floor division (defined as 'floor(a/b)') */ +#if !defined(luai_numidiv) +#define luai_numidiv(L,a,b) ((void)L, l_floor(luai_numdiv(L,a,b))) +#endif + +/* float division */ +#if !defined(luai_numdiv) +#define luai_numdiv(L,a,b) ((a)/(b)) +#endif + +/* +** modulo: defined as 'a - floor(a/b)*b'; the direct computation +** using this definition has several problems with rounding errors, +** so it is better to use 'fmod'. 'fmod' gives the result of +** 'a - trunc(a/b)*b', and therefore must be corrected when +** 'trunc(a/b) ~= floor(a/b)'. That happens when the division has a +** non-integer negative result: non-integer result is equivalent to +** a non-zero remainder 'm'; negative result is equivalent to 'a' and +** 'b' with different signs, or 'm' and 'b' with different signs +** (as the result 'm' of 'fmod' has the same sign of 'a'). +*/ +#if !defined(luai_nummod) +#define luai_nummod(L,a,b,m) \ + { (void)L; (m) = l_mathop(fmod)(a,b); \ + if (((m) > 0) ? (b) < 0 : ((m) < 0 && (b) > 0)) (m) += (b); } +#endif + +/* exponentiation */ +#if !defined(luai_numpow) +#define luai_numpow(L,a,b) \ + ((void)L, (b == 2) ? (a)*(a) : l_mathop(pow)(a,b)) +#endif + +/* the others are quite standard operations */ +#if !defined(luai_numadd) +#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_numunm(L,a) (-(a)) +#define luai_numeq(a,b) ((a)==(b)) +#define luai_numlt(a,b) ((a)<(b)) +#define luai_numle(a,b) ((a)<=(b)) +#define luai_numgt(a,b) ((a)>(b)) +#define luai_numge(a,b) ((a)>=(b)) +#define luai_numisnan(a) (!luai_numeq((a), (a))) +#endif + + + + + +/* +** macro to control inclusion of some hard tests on stack reallocation +*/ +#if !defined(HARDSTACKTESTS) +#define condmovestack(L,pre,pos) ((void)0) +#else +/* realloc stack keeping its size */ +#define condmovestack(L,pre,pos) \ + { int sz_ = stacksize(L); pre; luaD_reallocstack((L), sz_, 0); pos; } +#endif + +#if !defined(HARDMEMTESTS) +#define condchangemem(L,pre,pos) ((void)0) +#else +#define condchangemem(L,pre,pos) \ + { if (G(L)->gcrunning) { pre; luaC_fullgc(L, 0); pos; } } +#endif + +#endif diff --git a/lua-5.4.3/src/lmathlib.c b/lua-5.4.3/src/lmathlib.c new file mode 100644 index 0000000..5f5983a --- /dev/null +++ b/lua-5.4.3/src/lmathlib.c @@ -0,0 +1,764 @@ +/* +** $Id: lmathlib.c $ +** Standard mathematical library +** See Copyright Notice in lua.h +*/ + +#define lmathlib_c +#define LUA_LIB + +#include "lprefix.h" + + +#include +#include +#include +#include +#include + +#include "lua.h" + +#include "lauxlib.h" +#include "lualib.h" + + +#undef PI +#define PI (l_mathop(3.141592653589793238462643383279502884)) + + +static int math_abs (lua_State *L) { + if (lua_isinteger(L, 1)) { + lua_Integer n = lua_tointeger(L, 1); + if (n < 0) n = (lua_Integer)(0u - (lua_Unsigned)n); + lua_pushinteger(L, n); + } + else + 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_cos (lua_State *L) { + lua_pushnumber(L, l_mathop(cos)(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_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_Number y = luaL_checknumber(L, 1); + lua_Number x = luaL_optnumber(L, 2, 1); + lua_pushnumber(L, l_mathop(atan2)(y, x)); + return 1; +} + + +static int math_toint (lua_State *L) { + int valid; + lua_Integer n = lua_tointegerx(L, 1, &valid); + if (l_likely(valid)) + lua_pushinteger(L, n); + else { + luaL_checkany(L, 1); + luaL_pushfail(L); /* value is not convertible to integer */ + } + return 1; +} + + +static void pushnumint (lua_State *L, lua_Number d) { + lua_Integer n; + if (lua_numbertointeger(d, &n)) /* does 'd' fit in an integer? */ + lua_pushinteger(L, n); /* result is integer */ + else + lua_pushnumber(L, d); /* result is float */ +} + + +static int math_floor (lua_State *L) { + if (lua_isinteger(L, 1)) + lua_settop(L, 1); /* integer is its own floor */ + else { + lua_Number d = l_mathop(floor)(luaL_checknumber(L, 1)); + pushnumint(L, d); + } + return 1; +} + + +static int math_ceil (lua_State *L) { + if (lua_isinteger(L, 1)) + lua_settop(L, 1); /* integer is its own ceil */ + else { + lua_Number d = l_mathop(ceil)(luaL_checknumber(L, 1)); + pushnumint(L, d); + } + return 1; +} + + +static int math_fmod (lua_State *L) { + if (lua_isinteger(L, 1) && lua_isinteger(L, 2)) { + lua_Integer d = lua_tointeger(L, 2); + if ((lua_Unsigned)d + 1u <= 1u) { /* special cases: -1 or 0 */ + luaL_argcheck(L, d != 0, 2, "zero"); + lua_pushinteger(L, 0); /* avoid overflow with 0x80000... / -1 */ + } + else + lua_pushinteger(L, lua_tointeger(L, 1) % d); + } + else + lua_pushnumber(L, l_mathop(fmod)(luaL_checknumber(L, 1), + luaL_checknumber(L, 2))); + return 1; +} + + +/* +** next function does not use 'modf', avoiding problems with 'double*' +** (which is not compatible with 'float*') when lua_Number is not +** 'double'. +*/ +static int math_modf (lua_State *L) { + if (lua_isinteger(L ,1)) { + lua_settop(L, 1); /* number is its own integer part */ + lua_pushnumber(L, 0); /* no fractional part */ + } + else { + lua_Number n = luaL_checknumber(L, 1); + /* integer part (rounds toward zero) */ + lua_Number ip = (n < 0) ? l_mathop(ceil)(n) : l_mathop(floor)(n); + pushnumint(L, ip); + /* fractional part (test needed for inf/-inf) */ + lua_pushnumber(L, (n == ip) ? l_mathop(0.0) : (n - ip)); + } + return 2; +} + + +static int math_sqrt (lua_State *L) { + lua_pushnumber(L, l_mathop(sqrt)(luaL_checknumber(L, 1))); + return 1; +} + + +static int math_ult (lua_State *L) { + lua_Integer a = luaL_checkinteger(L, 1); + lua_Integer b = luaL_checkinteger(L, 2); + lua_pushboolean(L, (lua_Unsigned)a < (lua_Unsigned)b); + 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 !defined(LUA_USE_C89) + if (base == l_mathop(2.0)) + res = l_mathop(log2)(x); + else +#endif + if (base == l_mathop(10.0)) + res = l_mathop(log10)(x); + else + res = l_mathop(log)(x)/l_mathop(log)(base); + } + lua_pushnumber(L, res); + return 1; +} + +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) * (l_mathop(180.0) / PI)); + return 1; +} + +static int math_rad (lua_State *L) { + lua_pushnumber(L, luaL_checknumber(L, 1) * (PI / l_mathop(180.0))); + return 1; +} + + +static int math_min (lua_State *L) { + int n = lua_gettop(L); /* number of arguments */ + int imin = 1; /* index of current minimum value */ + int i; + luaL_argcheck(L, n >= 1, 1, "value expected"); + for (i = 2; i <= n; i++) { + if (lua_compare(L, i, imin, LUA_OPLT)) + imin = i; + } + lua_pushvalue(L, imin); + return 1; +} + + +static int math_max (lua_State *L) { + int n = lua_gettop(L); /* number of arguments */ + int imax = 1; /* index of current maximum value */ + int i; + luaL_argcheck(L, n >= 1, 1, "value expected"); + for (i = 2; i <= n; i++) { + if (lua_compare(L, imax, i, LUA_OPLT)) + imax = i; + } + lua_pushvalue(L, imax); + return 1; +} + + +static int math_type (lua_State *L) { + if (lua_type(L, 1) == LUA_TNUMBER) + lua_pushstring(L, (lua_isinteger(L, 1)) ? "integer" : "float"); + else { + luaL_checkany(L, 1); + luaL_pushfail(L); + } + return 1; +} + + + +/* +** {================================================================== +** Pseudo-Random Number Generator based on 'xoshiro256**'. +** =================================================================== +*/ + +/* number of binary digits in the mantissa of a float */ +#define FIGS l_floatatt(MANT_DIG) + +#if FIGS > 64 +/* there are only 64 random bits; use them all */ +#undef FIGS +#define FIGS 64 +#endif + + +/* +** LUA_RAND32 forces the use of 32-bit integers in the implementation +** of the PRN generator (mainly for testing). +*/ +#if !defined(LUA_RAND32) && !defined(Rand64) + +/* try to find an integer type with at least 64 bits */ + +#if (ULONG_MAX >> 31 >> 31) >= 3 + +/* 'long' has at least 64 bits */ +#define Rand64 unsigned long + +#elif !defined(LUA_USE_C89) && defined(LLONG_MAX) + +/* there is a 'long long' type (which must have at least 64 bits) */ +#define Rand64 unsigned long long + +#elif (LUA_MAXUNSIGNED >> 31 >> 31) >= 3 + +/* 'lua_Integer' has at least 64 bits */ +#define Rand64 lua_Unsigned + +#endif + +#endif + + +#if defined(Rand64) /* { */ + +/* +** Standard implementation, using 64-bit integers. +** If 'Rand64' has more than 64 bits, the extra bits do not interfere +** with the 64 initial bits, except in a right shift. Moreover, the +** final result has to discard the extra bits. +*/ + +/* avoid using extra bits when needed */ +#define trim64(x) ((x) & 0xffffffffffffffffu) + + +/* rotate left 'x' by 'n' bits */ +static Rand64 rotl (Rand64 x, int n) { + return (x << n) | (trim64(x) >> (64 - n)); +} + +static Rand64 nextrand (Rand64 *state) { + Rand64 state0 = state[0]; + Rand64 state1 = state[1]; + Rand64 state2 = state[2] ^ state0; + Rand64 state3 = state[3] ^ state1; + Rand64 res = rotl(state1 * 5, 7) * 9; + state[0] = state0 ^ state3; + state[1] = state1 ^ state2; + state[2] = state2 ^ (state1 << 17); + state[3] = rotl(state3, 45); + return res; +} + + +/* must take care to not shift stuff by more than 63 slots */ + + +/* +** Convert bits from a random integer into a float in the +** interval [0,1), getting the higher FIG bits from the +** random unsigned integer and converting that to a float. +*/ + +/* must throw out the extra (64 - FIGS) bits */ +#define shift64_FIG (64 - FIGS) + +/* to scale to [0, 1), multiply by scaleFIG = 2^(-FIGS) */ +#define scaleFIG (l_mathop(0.5) / ((Rand64)1 << (FIGS - 1))) + +static lua_Number I2d (Rand64 x) { + return (lua_Number)(trim64(x) >> shift64_FIG) * scaleFIG; +} + +/* convert a 'Rand64' to a 'lua_Unsigned' */ +#define I2UInt(x) ((lua_Unsigned)trim64(x)) + +/* convert a 'lua_Unsigned' to a 'Rand64' */ +#define Int2I(x) ((Rand64)(x)) + + +#else /* no 'Rand64' }{ */ + +/* get an integer with at least 32 bits */ +#if LUAI_IS32INT +typedef unsigned int lu_int32; +#else +typedef unsigned long lu_int32; +#endif + + +/* +** Use two 32-bit integers to represent a 64-bit quantity. +*/ +typedef struct Rand64 { + lu_int32 h; /* higher half */ + lu_int32 l; /* lower half */ +} Rand64; + + +/* +** If 'lu_int32' has more than 32 bits, the extra bits do not interfere +** with the 32 initial bits, except in a right shift and comparisons. +** Moreover, the final result has to discard the extra bits. +*/ + +/* avoid using extra bits when needed */ +#define trim32(x) ((x) & 0xffffffffu) + + +/* +** basic operations on 'Rand64' values +*/ + +/* build a new Rand64 value */ +static Rand64 packI (lu_int32 h, lu_int32 l) { + Rand64 result; + result.h = h; + result.l = l; + return result; +} + +/* return i << n */ +static Rand64 Ishl (Rand64 i, int n) { + lua_assert(n > 0 && n < 32); + return packI((i.h << n) | (trim32(i.l) >> (32 - n)), i.l << n); +} + +/* i1 ^= i2 */ +static void Ixor (Rand64 *i1, Rand64 i2) { + i1->h ^= i2.h; + i1->l ^= i2.l; +} + +/* return i1 + i2 */ +static Rand64 Iadd (Rand64 i1, Rand64 i2) { + Rand64 result = packI(i1.h + i2.h, i1.l + i2.l); + if (trim32(result.l) < trim32(i1.l)) /* carry? */ + result.h++; + return result; +} + +/* return i * 5 */ +static Rand64 times5 (Rand64 i) { + return Iadd(Ishl(i, 2), i); /* i * 5 == (i << 2) + i */ +} + +/* return i * 9 */ +static Rand64 times9 (Rand64 i) { + return Iadd(Ishl(i, 3), i); /* i * 9 == (i << 3) + i */ +} + +/* return 'i' rotated left 'n' bits */ +static Rand64 rotl (Rand64 i, int n) { + lua_assert(n > 0 && n < 32); + return packI((i.h << n) | (trim32(i.l) >> (32 - n)), + (trim32(i.h) >> (32 - n)) | (i.l << n)); +} + +/* for offsets larger than 32, rotate right by 64 - offset */ +static Rand64 rotl1 (Rand64 i, int n) { + lua_assert(n > 32 && n < 64); + n = 64 - n; + return packI((trim32(i.h) >> n) | (i.l << (32 - n)), + (i.h << (32 - n)) | (trim32(i.l) >> n)); +} + +/* +** implementation of 'xoshiro256**' algorithm on 'Rand64' values +*/ +static Rand64 nextrand (Rand64 *state) { + Rand64 res = times9(rotl(times5(state[1]), 7)); + Rand64 t = Ishl(state[1], 17); + Ixor(&state[2], state[0]); + Ixor(&state[3], state[1]); + Ixor(&state[1], state[2]); + Ixor(&state[0], state[3]); + Ixor(&state[2], t); + state[3] = rotl1(state[3], 45); + return res; +} + + +/* +** Converts a 'Rand64' into a float. +*/ + +/* an unsigned 1 with proper type */ +#define UONE ((lu_int32)1) + + +#if FIGS <= 32 + +/* 2^(-FIGS) */ +#define scaleFIG (l_mathop(0.5) / (UONE << (FIGS - 1))) + +/* +** get up to 32 bits from higher half, shifting right to +** throw out the extra bits. +*/ +static lua_Number I2d (Rand64 x) { + lua_Number h = (lua_Number)(trim32(x.h) >> (32 - FIGS)); + return h * scaleFIG; +} + +#else /* 32 < FIGS <= 64 */ + +/* must take care to not shift stuff by more than 31 slots */ + +/* 2^(-FIGS) = 1.0 / 2^30 / 2^3 / 2^(FIGS-33) */ +#define scaleFIG \ + ((lua_Number)1.0 / (UONE << 30) / 8.0 / (UONE << (FIGS - 33))) + +/* +** use FIGS - 32 bits from lower half, throwing out the other +** (32 - (FIGS - 32)) = (64 - FIGS) bits +*/ +#define shiftLOW (64 - FIGS) + +/* +** higher 32 bits go after those (FIGS - 32) bits: shiftHI = 2^(FIGS - 32) +*/ +#define shiftHI ((lua_Number)(UONE << (FIGS - 33)) * 2.0) + + +static lua_Number I2d (Rand64 x) { + lua_Number h = (lua_Number)trim32(x.h) * shiftHI; + lua_Number l = (lua_Number)(trim32(x.l) >> shiftLOW); + return (h + l) * scaleFIG; +} + +#endif + + +/* convert a 'Rand64' to a 'lua_Unsigned' */ +static lua_Unsigned I2UInt (Rand64 x) { + return ((lua_Unsigned)trim32(x.h) << 31 << 1) | (lua_Unsigned)trim32(x.l); +} + +/* convert a 'lua_Unsigned' to a 'Rand64' */ +static Rand64 Int2I (lua_Unsigned n) { + return packI((lu_int32)(n >> 31 >> 1), (lu_int32)n); +} + +#endif /* } */ + + +/* +** A state uses four 'Rand64' values. +*/ +typedef struct { + Rand64 s[4]; +} RanState; + + +/* +** Project the random integer 'ran' into the interval [0, n]. +** Because 'ran' has 2^B possible values, the projection can only be +** uniform when the size of the interval is a power of 2 (exact +** division). Otherwise, to get a uniform projection into [0, n], we +** first compute 'lim', the smallest Mersenne number not smaller than +** 'n'. We then project 'ran' into the interval [0, lim]. If the result +** is inside [0, n], we are done. Otherwise, we try with another 'ran', +** until we have a result inside the interval. +*/ +static lua_Unsigned project (lua_Unsigned ran, lua_Unsigned n, + RanState *state) { + if ((n & (n + 1)) == 0) /* is 'n + 1' a power of 2? */ + return ran & n; /* no bias */ + else { + lua_Unsigned lim = n; + /* compute the smallest (2^b - 1) not smaller than 'n' */ + lim |= (lim >> 1); + lim |= (lim >> 2); + lim |= (lim >> 4); + lim |= (lim >> 8); + lim |= (lim >> 16); +#if (LUA_MAXUNSIGNED >> 31) >= 3 + lim |= (lim >> 32); /* integer type has more than 32 bits */ +#endif + lua_assert((lim & (lim + 1)) == 0 /* 'lim + 1' is a power of 2, */ + && lim >= n /* not smaller than 'n', */ + && (lim >> 1) < n); /* and it is the smallest one */ + while ((ran &= lim) > n) /* project 'ran' into [0..lim] */ + ran = I2UInt(nextrand(state->s)); /* not inside [0..n]? try again */ + return ran; + } +} + + +static int math_random (lua_State *L) { + lua_Integer low, up; + lua_Unsigned p; + RanState *state = (RanState *)lua_touserdata(L, lua_upvalueindex(1)); + Rand64 rv = nextrand(state->s); /* next pseudo-random value */ + switch (lua_gettop(L)) { /* check number of arguments */ + case 0: { /* no arguments */ + lua_pushnumber(L, I2d(rv)); /* float between 0 and 1 */ + return 1; + } + case 1: { /* only upper limit */ + low = 1; + up = luaL_checkinteger(L, 1); + if (up == 0) { /* single 0 as argument? */ + lua_pushinteger(L, I2UInt(rv)); /* full random integer */ + return 1; + } + break; + } + case 2: { /* lower and upper limits */ + low = luaL_checkinteger(L, 1); + up = luaL_checkinteger(L, 2); + break; + } + default: return luaL_error(L, "wrong number of arguments"); + } + /* random integer in the interval [low, up] */ + luaL_argcheck(L, low <= up, 1, "interval is empty"); + /* project random integer into the interval [0, up - low] */ + p = project(I2UInt(rv), (lua_Unsigned)up - (lua_Unsigned)low, state); + lua_pushinteger(L, p + (lua_Unsigned)low); + return 1; +} + + +static void setseed (lua_State *L, Rand64 *state, + lua_Unsigned n1, lua_Unsigned n2) { + int i; + state[0] = Int2I(n1); + state[1] = Int2I(0xff); /* avoid a zero state */ + state[2] = Int2I(n2); + state[3] = Int2I(0); + for (i = 0; i < 16; i++) + nextrand(state); /* discard initial values to "spread" seed */ + lua_pushinteger(L, n1); + lua_pushinteger(L, n2); +} + + +/* +** Set a "random" seed. To get some randomness, use the current time +** and the address of 'L' (in case the machine does address space layout +** randomization). +*/ +static void randseed (lua_State *L, RanState *state) { + lua_Unsigned seed1 = (lua_Unsigned)time(NULL); + lua_Unsigned seed2 = (lua_Unsigned)(size_t)L; + setseed(L, state->s, seed1, seed2); +} + + +static int math_randomseed (lua_State *L) { + RanState *state = (RanState *)lua_touserdata(L, lua_upvalueindex(1)); + if (lua_isnone(L, 1)) { + randseed(L, state); + } + else { + lua_Integer n1 = luaL_checkinteger(L, 1); + lua_Integer n2 = luaL_optinteger(L, 2, 0); + setseed(L, state->s, n1, n2); + } + return 2; /* return seeds */ +} + + +static const luaL_Reg randfuncs[] = { + {"random", math_random}, + {"randomseed", math_randomseed}, + {NULL, NULL} +}; + + +/* +** Register the random functions and initialize their state. +*/ +static void setrandfunc (lua_State *L) { + RanState *state = (RanState *)lua_newuserdatauv(L, sizeof(RanState), 0); + randseed(L, state); /* initialize with a "random" seed */ + lua_pop(L, 2); /* remove pushed seeds */ + luaL_setfuncs(L, randfuncs, 1); +} + +/* }================================================================== */ + + +/* +** {================================================================== +** Deprecated functions (for compatibility only) +** =================================================================== +*/ +#if defined(LUA_COMPAT_MATHLIB) + +static int math_cosh (lua_State *L) { + lua_pushnumber(L, l_mathop(cosh)(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_tanh (lua_State *L) { + lua_pushnumber(L, l_mathop(tanh)(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_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 = (int)luaL_checkinteger(L, 2); + lua_pushnumber(L, l_mathop(ldexp)(x, ep)); + return 1; +} + +static int math_log10 (lua_State *L) { + lua_pushnumber(L, l_mathop(log10)(luaL_checknumber(L, 1))); + return 1; +} + +#endif +/* }================================================================== */ + + + +static const luaL_Reg mathlib[] = { + {"abs", math_abs}, + {"acos", math_acos}, + {"asin", math_asin}, + {"atan", math_atan}, + {"ceil", math_ceil}, + {"cos", math_cos}, + {"deg", math_deg}, + {"exp", math_exp}, + {"tointeger", math_toint}, + {"floor", math_floor}, + {"fmod", math_fmod}, + {"ult", math_ult}, + {"log", math_log}, + {"max", math_max}, + {"min", math_min}, + {"modf", math_modf}, + {"rad", math_rad}, + {"sin", math_sin}, + {"sqrt", math_sqrt}, + {"tan", math_tan}, + {"type", math_type}, +#if defined(LUA_COMPAT_MATHLIB) + {"atan2", math_atan}, + {"cosh", math_cosh}, + {"sinh", math_sinh}, + {"tanh", math_tanh}, + {"pow", math_pow}, + {"frexp", math_frexp}, + {"ldexp", math_ldexp}, + {"log10", math_log10}, +#endif + /* placeholders */ + {"random", NULL}, + {"randomseed", NULL}, + {"pi", NULL}, + {"huge", NULL}, + {"maxinteger", NULL}, + {"mininteger", NULL}, + {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, (lua_Number)HUGE_VAL); + lua_setfield(L, -2, "huge"); + lua_pushinteger(L, LUA_MAXINTEGER); + lua_setfield(L, -2, "maxinteger"); + lua_pushinteger(L, LUA_MININTEGER); + lua_setfield(L, -2, "mininteger"); + setrandfunc(L); + return 1; +} + diff --git a/lua-5.4.3/src/lmem.c b/lua-5.4.3/src/lmem.c new file mode 100644 index 0000000..9029d58 --- /dev/null +++ b/lua-5.4.3/src/lmem.c @@ -0,0 +1,201 @@ +/* +** $Id: lmem.c $ +** Interface to Memory Manager +** See Copyright Notice in lua.h +*/ + +#define lmem_c +#define LUA_CORE + +#include "lprefix.h" + + +#include + +#include "lua.h" + +#include "ldebug.h" +#include "ldo.h" +#include "lgc.h" +#include "lmem.h" +#include "lobject.h" +#include "lstate.h" + + +#if defined(EMERGENCYGCTESTS) +/* +** First allocation will fail whenever not building initial state. +** (This fail will trigger 'tryagain' and a full GC cycle at every +** allocation.) +*/ +static void *firsttry (global_State *g, void *block, size_t os, size_t ns) { + if (completestate(g) && ns > 0) /* frees never fail */ + return NULL; /* fail */ + else /* normal allocation */ + return (*g->frealloc)(g->ud, block, os, ns); +} +#else +#define firsttry(g,block,os,ns) ((*g->frealloc)(g->ud, block, os, ns)) +#endif + + + + + +/* +** 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, p, x, 0) frees the block 'p' and returns NULL. +** Particularly, frealloc(ud, NULL, 0, 0) does nothing, +** which is equivalent to free(NULL) in ISO C. +** +** - frealloc(ud, NULL, x, s) creates a new block of size 's' +** (no matter 'x'). Returns NULL if it cannot create the new block. +** +** - otherwise, frealloc(ud, b, x, y) reallocates the block 'b' from +** size 'x' to size 'y'. Returns NULL if it cannot reallocate the +** block to the new size. +*/ + + + + +/* +** {================================================================== +** Functions to allocate/deallocate arrays for the Parser +** =================================================================== +*/ + +/* +** Minimum size for arrays during parsing, to avoid overhead of +** reallocating to size 1, then 2, and then 4. All these arrays +** will be reallocated to exact sizes or erased when parsing ends. +*/ +#define MINSIZEARRAY 4 + + +void *luaM_growaux_ (lua_State *L, void *block, int nelems, int *psize, + int size_elems, int limit, const char *what) { + void *newblock; + int size = *psize; + if (nelems + 1 <= size) /* does one extra element still fit? */ + return block; /* nothing to be done */ + if (size >= limit / 2) { /* cannot double it? */ + if (l_unlikely(size >= limit)) /* cannot grow even a little? */ + luaG_runerror(L, "too many %s (limit is %d)", what, limit); + size = limit; /* still have at least one free place */ + } + else { + size *= 2; + if (size < MINSIZEARRAY) + size = MINSIZEARRAY; /* minimum size */ + } + lua_assert(nelems + 1 <= size && size <= limit); + /* 'limit' ensures that multiplication will not overflow */ + newblock = luaM_saferealloc_(L, block, cast_sizet(*psize) * size_elems, + cast_sizet(size) * size_elems); + *psize = size; /* update only when everything else is OK */ + return newblock; +} + + +/* +** In prototypes, the size of the array is also its number of +** elements (to save memory). So, if it cannot shrink an array +** to its number of elements, the only option is to raise an +** error. +*/ +void *luaM_shrinkvector_ (lua_State *L, void *block, int *size, + int final_n, int size_elem) { + void *newblock; + size_t oldsize = cast_sizet((*size) * size_elem); + size_t newsize = cast_sizet(final_n * size_elem); + lua_assert(newsize <= oldsize); + newblock = luaM_saferealloc_(L, block, oldsize, newsize); + *size = final_n; + return newblock; +} + +/* }================================================================== */ + + +l_noret luaM_toobig (lua_State *L) { + luaG_runerror(L, "memory allocation error: block too big"); +} + + +/* +** Free memory +*/ +void luaM_free_ (lua_State *L, void *block, size_t osize) { + global_State *g = G(L); + lua_assert((osize == 0) == (block == NULL)); + (*g->frealloc)(g->ud, block, osize, 0); + g->GCdebt -= osize; +} + + +/* +** In case of allocation fail, this function will do an emergency +** collection to free some memory and then try the allocation again. +** The GC should not be called while state is not fully built, as the +** collector is not yet fully initialized. Also, it should not be called +** when 'gcstopem' is true, because then the interpreter is in the +** middle of a collection step. +*/ +static void *tryagain (lua_State *L, void *block, + size_t osize, size_t nsize) { + global_State *g = G(L); + if (completestate(g) && !g->gcstopem) { + luaC_fullgc(L, 1); /* try to free some memory... */ + return (*g->frealloc)(g->ud, block, osize, nsize); /* try again */ + } + else return NULL; /* cannot free any memory without a full state */ +} + + +/* +** Generic allocation routine. +*/ +void *luaM_realloc_ (lua_State *L, void *block, size_t osize, size_t nsize) { + void *newblock; + global_State *g = G(L); + lua_assert((osize == 0) == (block == NULL)); + newblock = firsttry(g, block, osize, nsize); + if (l_unlikely(newblock == NULL && nsize > 0)) { + newblock = tryagain(L, block, osize, nsize); + if (newblock == NULL) /* still no memory? */ + return NULL; /* do not update 'GCdebt' */ + } + lua_assert((nsize == 0) == (newblock == NULL)); + g->GCdebt = (g->GCdebt + nsize) - osize; + return newblock; +} + + +void *luaM_saferealloc_ (lua_State *L, void *block, size_t osize, + size_t nsize) { + void *newblock = luaM_realloc_(L, block, osize, nsize); + if (l_unlikely(newblock == NULL && nsize > 0)) /* allocation failed? */ + luaM_error(L); + return newblock; +} + + +void *luaM_malloc_ (lua_State *L, size_t size, int tag) { + if (size == 0) + return NULL; /* that's all */ + else { + global_State *g = G(L); + void *newblock = firsttry(g, NULL, tag, size); + if (l_unlikely(newblock == NULL)) { + newblock = tryagain(L, NULL, tag, size); + if (newblock == NULL) + luaM_error(L); + } + g->GCdebt += size; + return newblock; + } +} diff --git a/lua-5.4.3/src/lmem.h b/lua-5.4.3/src/lmem.h new file mode 100644 index 0000000..8c75a44 --- /dev/null +++ b/lua-5.4.3/src/lmem.h @@ -0,0 +1,93 @@ +/* +** $Id: lmem.h $ +** Interface to Memory Manager +** See Copyright Notice in lua.h +*/ + +#ifndef lmem_h +#define lmem_h + + +#include + +#include "llimits.h" +#include "lua.h" + + +#define luaM_error(L) luaD_throw(L, LUA_ERRMEM) + + +/* +** This macro tests whether it is safe to multiply 'n' by the size of +** type 't' without overflows. Because 'e' is always constant, it avoids +** the runtime division MAX_SIZET/(e). +** (The macro is somewhat complex to avoid warnings: The 'sizeof' +** comparison avoids a runtime comparison when overflow cannot occur. +** The compiler should be able to optimize the real test by itself, but +** when it does it, it may give a warning about "comparison is always +** false due to limited range of data type"; the +1 tricks the compiler, +** avoiding this warning but also this optimization.) +*/ +#define luaM_testsize(n,e) \ + (sizeof(n) >= sizeof(size_t) && cast_sizet((n)) + 1 > MAX_SIZET/(e)) + +#define luaM_checksize(L,n,e) \ + (luaM_testsize(n,e) ? luaM_toobig(L) : cast_void(0)) + + +/* +** Computes the minimum between 'n' and 'MAX_SIZET/sizeof(t)', so that +** the result is not larger than 'n' and cannot overflow a 'size_t' +** when multiplied by the size of type 't'. (Assumes that 'n' is an +** 'int' or 'unsigned int' and that 'int' is not larger than 'size_t'.) +*/ +#define luaM_limitN(n,t) \ + ((cast_sizet(n) <= MAX_SIZET/sizeof(t)) ? (n) : \ + cast_uint((MAX_SIZET/sizeof(t)))) + + +/* +** Arrays of chars do not need any test +*/ +#define luaM_reallocvchar(L,b,on,n) \ + cast_charp(luaM_saferealloc_(L, (b), (on)*sizeof(char), (n)*sizeof(char))) + +#define luaM_freemem(L, b, s) luaM_free_(L, (b), (s)) +#define luaM_free(L, b) luaM_free_(L, (b), sizeof(*(b))) +#define luaM_freearray(L, b, n) luaM_free_(L, (b), (n)*sizeof(*(b))) + +#define luaM_new(L,t) cast(t*, luaM_malloc_(L, sizeof(t), 0)) +#define luaM_newvector(L,n,t) cast(t*, luaM_malloc_(L, (n)*sizeof(t), 0)) +#define luaM_newvectorchecked(L,n,t) \ + (luaM_checksize(L,n,sizeof(t)), luaM_newvector(L,n,t)) + +#define luaM_newobject(L,tag,s) luaM_malloc_(L, (s), tag) + +#define luaM_growvector(L,v,nelems,size,t,limit,e) \ + ((v)=cast(t *, luaM_growaux_(L,v,nelems,&(size),sizeof(t), \ + luaM_limitN(limit,t),e))) + +#define luaM_reallocvector(L, v,oldn,n,t) \ + (cast(t *, luaM_realloc_(L, v, cast_sizet(oldn) * sizeof(t), \ + cast_sizet(n) * sizeof(t)))) + +#define luaM_shrinkvector(L,v,size,fs,t) \ + ((v)=cast(t *, luaM_shrinkvector_(L, v, &(size), fs, 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_saferealloc_ (lua_State *L, void *block, size_t oldsize, + size_t size); +LUAI_FUNC void luaM_free_ (lua_State *L, void *block, size_t osize); +LUAI_FUNC void *luaM_growaux_ (lua_State *L, void *block, int nelems, + int *size, int size_elem, int limit, + const char *what); +LUAI_FUNC void *luaM_shrinkvector_ (lua_State *L, void *block, int *nelem, + int final_n, int size_elem); +LUAI_FUNC void *luaM_malloc_ (lua_State *L, size_t size, int tag); + +#endif + diff --git a/lua-5.4.3/src/loadlib.c b/lua-5.4.3/src/loadlib.c new file mode 100644 index 0000000..6f9fa37 --- /dev/null +++ b/lua-5.4.3/src/loadlib.c @@ -0,0 +1,762 @@ +/* +** $Id: loadlib.c $ +** 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. +*/ + +#define loadlib_c +#define LUA_LIB + +#include "lprefix.h" + + +#include +#include +#include + +#include "lua.h" + +#include "lauxlib.h" +#include "lualib.h" + + +/* +** LUA_IGMARK is a mark to ignore all before it when building the +** luaopen_ function name. +*/ +#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 "_" + + +/* +** key for table in the registry that keeps handles +** for all loaded C libraries +*/ +static const char *const CLIBS = "_CLIBS"; + +#define LIB_FAIL "open" + + +#define setprogdir(L) ((void)0) + + +/* +** Special type equivalent to '(void*)' for functions in gcc +** (to suppress warnings when converting function pointers) +*/ +typedef void (*voidf)(void); + + +/* +** system-dependent functions +*/ + +/* +** unload library 'lib' +*/ +static void lsys_unloadlib (void *lib); + +/* +** load C library in file 'path'. If 'seeglb', load with all names in +** the library global. +** Returns the library; in case of error, returns NULL plus an +** error string in the stack. +*/ +static void *lsys_load (lua_State *L, const char *path, int seeglb); + +/* +** Try to find a function named 'sym' in library 'lib'. +** Returns the function; in case of error, returns NULL plus an +** error string in the stack. +*/ +static lua_CFunction lsys_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 + +/* +** Macro to convert pointer-to-void* to pointer-to-function. This cast +** is undefined according to ISO C, but POSIX assumes that it works. +** (The '__extension__' in gnu compilers is only to avoid warnings.) +*/ +#if defined(__GNUC__) +#define cast_func(p) (__extension__ (lua_CFunction)(p)) +#else +#define cast_func(p) ((lua_CFunction)(p)) +#endif + + +static void lsys_unloadlib (void *lib) { + dlclose(lib); +} + + +static void *lsys_load (lua_State *L, const char *path, int seeglb) { + void *lib = dlopen(path, RTLD_NOW | (seeglb ? RTLD_GLOBAL : RTLD_LOCAL)); + if (l_unlikely(lib == NULL)) + lua_pushstring(L, dlerror()); + return lib; +} + + +static lua_CFunction lsys_sym (lua_State *L, void *lib, const char *sym) { + lua_CFunction f = cast_func(dlsym(lib, sym)); + if (l_unlikely(f == NULL)) + lua_pushstring(L, dlerror()); + return f; +} + +/* }====================================================== */ + + + +#elif defined(LUA_DL_DLL) /* }{ */ +/* +** {====================================================================== +** This is an implementation of loadlib for Windows using native functions. +** ======================================================================= +*/ + +#include + + +/* +** optional flags for LoadLibraryEx +*/ +#if !defined(LUA_LLE_FLAGS) +#define LUA_LLE_FLAGS 0 +#endif + + +#undef setprogdir + + +/* +** Replace in the path (on the top of the stack) any occurrence +** of LUA_EXEC_DIR with the executable's path. +*/ +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); /* get exec. name */ + if (n == 0 || n == nsize || (lb = strrchr(buff, '\\')) == NULL) + luaL_error(L, "unable to get ModuleFileName"); + else { + *lb = '\0'; /* cut name on the last '\\' to get the path */ + 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 lsys_unloadlib (void *lib) { + FreeLibrary((HMODULE)lib); +} + + +static void *lsys_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 lsys_sym (lua_State *L, void *lib, const char *sym) { + lua_CFunction f = (lua_CFunction)(voidf)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 lsys_unloadlib (void *lib) { + (void)(lib); /* not used */ +} + + +static void *lsys_load (lua_State *L, const char *path, int seeglb) { + (void)(path); (void)(seeglb); /* not used */ + lua_pushliteral(L, DLMSG); + return NULL; +} + + +static lua_CFunction lsys_sym (lua_State *L, void *lib, const char *sym) { + (void)(lib); (void)(sym); /* not used */ + lua_pushliteral(L, DLMSG); + return NULL; +} + +/* }====================================================== */ +#endif /* } */ + + +/* +** {================================================================== +** Set Paths +** =================================================================== +*/ + +/* +** LUA_PATH_VAR and LUA_CPATH_VAR are the names of the environment +** variables that Lua check to set its paths. +*/ +#if !defined(LUA_PATH_VAR) +#define LUA_PATH_VAR "LUA_PATH" +#endif + +#if !defined(LUA_CPATH_VAR) +#define LUA_CPATH_VAR "LUA_CPATH" +#endif + + + +/* +** 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; +} + + +/* +** Set a path +*/ +static void setpath (lua_State *L, const char *fieldname, + const char *envname, + const char *dft) { + const char *dftmark; + const char *nver = lua_pushfstring(L, "%s%s", envname, LUA_VERSUFFIX); + const char *path = getenv(nver); /* try versioned name */ + if (path == NULL) /* no versioned environment variable? */ + path = getenv(envname); /* try unversioned name */ + if (path == NULL || noenv(L)) /* no environment variable? */ + lua_pushstring(L, dft); /* use default */ + else if ((dftmark = strstr(path, LUA_PATH_SEP LUA_PATH_SEP)) == NULL) + lua_pushstring(L, path); /* nothing to change */ + else { /* path contains a ";;": insert default path in its place */ + size_t len = strlen(path); + luaL_Buffer b; + luaL_buffinit(L, &b); + if (path < dftmark) { /* is there a prefix before ';;'? */ + luaL_addlstring(&b, path, dftmark - path); /* add it */ + luaL_addchar(&b, *LUA_PATH_SEP); + } + luaL_addstring(&b, dft); /* add default */ + if (dftmark < path + len - 2) { /* is there a suffix after ';;'? */ + luaL_addchar(&b, *LUA_PATH_SEP); + luaL_addlstring(&b, dftmark + 2, (path + len - 2) - dftmark); + } + luaL_pushresult(&b); + } + setprogdir(L); + lua_setfield(L, -3, fieldname); /* package[fieldname] = path value */ + lua_pop(L, 1); /* pop versioned variable name ('nver') */ +} + +/* }================================================================== */ + + +/* +** return registry.CLIBS[path] +*/ +static void *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; +} + + +/* +** registry.CLIBS[path] = plib -- for queries +** registry.CLIBS[#CLIBS + 1] = plib -- also keep a list of all libraries +*/ +static void 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 'lsys_unloadlib' for all lib +** handles in list CLIBS +*/ +static int gctm (lua_State *L) { + lua_Integer n = luaL_len(L, 1); + for (; n >= 1; n--) { /* for each handle, in reverse order */ + lua_rawgeti(L, 1, n); /* get handle CLIBS[n] */ + lsys_unloadlib(lua_touserdata(L, -1)); + lua_pop(L, 1); /* pop handle */ + } + return 0; +} + + + +/* error codes for 'lookforfunc' */ +#define ERRLIB 1 +#define ERRFUNC 2 + +/* +** Look for a C function named 'sym' in a dynamically loaded library +** 'path'. +** First, check whether the library is already loaded; if not, try +** to load it. +** Then, if 'sym' is '*', return true (as library has been loaded). +** Otherwise, look for symbol 'sym' in the library and push a +** C function with that symbol. +** Return 0 and 'true' or a function in the stack; in case of +** errors, return an error code and an error message in the stack. +*/ +static int lookforfunc (lua_State *L, const char *path, const char *sym) { + void *reg = checkclib(L, path); /* check loaded C libraries */ + if (reg == NULL) { /* must load library? */ + reg = lsys_load(L, path, *sym == '*'); /* global symbols if 'sym'=='*' */ + if (reg == NULL) return ERRLIB; /* unable to load library */ + 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 = lsys_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 = lookforfunc(L, path, init); + if (l_likely(stat == 0)) /* no errors? */ + return 1; /* return the loaded function */ + else { /* error; error message is on stack top */ + luaL_pushfail(L); + lua_insert(L, -2); + lua_pushstring(L, (stat == ERRLIB) ? LIB_FAIL : "init"); + return 3; /* return fail, 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; +} + + +/* +** Get the next name in '*path' = 'name1;name2;name3;...', changing +** the ending ';' to '\0' to create a zero-terminated string. Return +** NULL when list ends. +*/ +static const char *getnextfilename (char **path, char *end) { + char *sep; + char *name = *path; + if (name == end) + return NULL; /* no more names */ + else if (*name == '\0') { /* from previous iteration? */ + *name = *LUA_PATH_SEP; /* restore separator */ + name++; /* skip it */ + } + sep = strchr(name, *LUA_PATH_SEP); /* find next separator */ + if (sep == NULL) /* separator not found? */ + sep = end; /* name goes until the end */ + *sep = '\0'; /* finish file name */ + *path = sep; /* will start next search from here */ + return name; +} + + +/* +** Given a path such as ";blabla.so;blublu.so", pushes the string +** +** no file 'blabla.so' +** no file 'blublu.so' +*/ +static void pusherrornotfound (lua_State *L, const char *path) { + luaL_Buffer b; + luaL_buffinit(L, &b); + luaL_addstring(&b, "no file '"); + luaL_addgsub(&b, path, LUA_PATH_SEP, "'\n\tno file '"); + luaL_addstring(&b, "'"); + luaL_pushresult(&b); +} + + +static const char *searchpath (lua_State *L, const char *name, + const char *path, + const char *sep, + const char *dirsep) { + luaL_Buffer buff; + char *pathname; /* path with name inserted */ + char *endpathname; /* its end */ + const char *filename; + /* separator is non-empty and appears in 'name'? */ + if (*sep != '\0' && strchr(name, *sep) != NULL) + name = luaL_gsub(L, name, sep, dirsep); /* replace it by 'dirsep' */ + luaL_buffinit(L, &buff); + /* add path to the buffer, replacing marks ('?') with the file name */ + luaL_addgsub(&buff, path, LUA_PATH_MARK, name); + luaL_addchar(&buff, '\0'); + pathname = luaL_buffaddr(&buff); /* writable list of file names */ + endpathname = pathname + luaL_bufflen(&buff) - 1; + while ((filename = getnextfilename(&pathname, endpathname)) != NULL) { + if (readable(filename)) /* does file exist and is readable? */ + return lua_pushstring(L, filename); /* save and return name */ + } + luaL_pushresult(&buff); /* push path to create error message */ + pusherrornotfound(L, lua_tostring(L, -1)); /* 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 */ + luaL_pushfail(L); + lua_insert(L, -2); + return 2; /* return fail + 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 (l_unlikely(path == NULL)) + luaL_error(L, "'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 (l_likely(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 '%s' from file '%s':\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); +} + + +/* +** Try to find a load function for module 'modname' at file 'filename'. +** First, change '.' to '_' in 'modname'; then, if 'modname' has +** the form X-Y (that is, it has an "ignore mark"), build a function +** name "luaopen_X" and look for it. (For compatibility, if that +** fails, it also tries "luaopen_Y".) If there is no ignore mark, +** look for a function named "luaopen_modname". +*/ +static int loadfunc (lua_State *L, const char *filename, const char *modname) { + const char *openfunc; + const char *mark; + modname = luaL_gsub(L, modname, ".", LUA_OFSEP); + mark = strchr(modname, *LUA_IGMARK); + if (mark) { + int stat; + openfunc = lua_pushlstring(L, modname, mark - modname); + openfunc = lua_pushfstring(L, LUA_POF"%s", openfunc); + stat = lookforfunc(L, filename, openfunc); + if (stat != ERRFUNC) return stat; + modname = mark + 1; /* else go ahead and try old-style name */ + } + openfunc = lua_pushfstring(L, LUA_POF"%s", modname); + return lookforfunc(L, filename, openfunc); +} + + +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, "no module '%s' in file '%s'", 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, LUA_PRELOAD_TABLE); + if (lua_getfield(L, -1, name) == LUA_TNIL) { /* not found? */ + lua_pushfstring(L, "no field package.preload['%s']", name); + return 1; + } + else { + lua_pushliteral(L, ":preload:"); + return 2; + } +} + + +static void findloader (lua_State *L, const char *name) { + int i; + luaL_Buffer msg; /* to build error message */ + /* push 'package.searchers' to index 3 in the stack */ + if (l_unlikely(lua_getfield(L, lua_upvalueindex(1), "searchers") + != LUA_TTABLE)) + luaL_error(L, "'package.searchers' must be a table"); + luaL_buffinit(L, &msg); + /* iterate over available searchers to find a loader */ + for (i = 1; ; i++) { + luaL_addstring(&msg, "\n\t"); /* error-message prefix */ + if (l_unlikely(lua_rawgeti(L, 3, i) == LUA_TNIL)) { /* no more searchers? */ + lua_pop(L, 1); /* remove nil */ + luaL_buffsub(&msg, 2); /* remove prefix */ + luaL_pushresult(&msg); /* create error message */ + luaL_error(L, "module '%s' 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 { /* no error message */ + lua_pop(L, 2); /* remove both returns */ + luaL_buffsub(&msg, 2); /* remove prefix */ + } + } +} + + +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, LUA_LOADED_TABLE); + 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_rotate(L, -2, 1); /* function <-> loader data */ + lua_pushvalue(L, 1); /* name is 1st argument to module loader */ + lua_pushvalue(L, -3); /* loader data is 2nd argument */ + /* stack: ...; loader data; loader function; mod. name; loader data */ + lua_call(L, 2, 1); /* run loader to load module */ + /* stack: ...; loader data; result from loader */ + if (!lua_isnil(L, -1)) /* non-nil return? */ + lua_setfield(L, 2, name); /* LOADED[name] = returned value */ + else + lua_pop(L, 1); /* pop nil */ + if (lua_getfield(L, 2, name) == LUA_TNIL) { /* module set no value? */ + lua_pushboolean(L, 1); /* use true as result */ + lua_copy(L, -1, -2); /* replace loader result */ + lua_setfield(L, 2, name); /* LOADED[name] = true */ + } + lua_rotate(L, -2, 1); /* loader data <-> module result */ + return 2; /* return module result and loader data */ +} + +/* }====================================================== */ + + + + +static const luaL_Reg pk_funcs[] = { + {"loadlib", ll_loadlib}, + {"searchpath", ll_searchpath}, + /* placeholders */ + {"preload", NULL}, + {"cpath", NULL}, + {"path", NULL}, + {"searchers", NULL}, + {"loaded", NULL}, + {NULL, NULL} +}; + + +static const luaL_Reg ll_funcs[] = { + {"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 predefined 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); + } + lua_setfield(L, -2, "searchers"); /* put it in field 'searchers' */ +} + + +/* +** create table CLIBS to keep track of loaded C libraries, +** setting a finalizer to close all libraries when closing state. +*/ +static void createclibstable (lua_State *L) { + luaL_getsubtable(L, LUA_REGISTRYINDEX, CLIBS); /* create CLIBS table */ + lua_createtable(L, 0, 1); /* create metatable for CLIBS */ + lua_pushcfunction(L, gctm); + lua_setfield(L, -2, "__gc"); /* set finalizer for CLIBS table */ + lua_setmetatable(L, -2); +} + + +LUAMOD_API int luaopen_package (lua_State *L) { + createclibstable(L); + luaL_newlib(L, pk_funcs); /* create 'package' table */ + createsearcherstable(L); + /* set paths */ + setpath(L, "path", LUA_PATH_VAR, LUA_PATH_DEFAULT); + setpath(L, "cpath", LUA_CPATH_VAR, 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, LUA_LOADED_TABLE); + lua_setfield(L, -2, "loaded"); + /* set field 'preload' */ + luaL_getsubtable(L, LUA_REGISTRYINDEX, LUA_PRELOAD_TABLE); + 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/lua-5.4.3/src/lobject.c b/lua-5.4.3/src/lobject.c new file mode 100644 index 0000000..0e504be --- /dev/null +++ b/lua-5.4.3/src/lobject.c @@ -0,0 +1,592 @@ +/* +** $Id: lobject.c $ +** Some generic functions over Lua objects +** See Copyright Notice in lua.h +*/ + +#define lobject_c +#define LUA_CORE + +#include "lprefix.h" + + +#include +#include +#include +#include +#include +#include + +#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" + + +/* +** Computes ceil(log2(x)) +*/ +int luaO_ceillog2 (unsigned int x) { + static const lu_byte log_2[256] = { /* log_2[i] = ceil(log2(i - 1)) */ + 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]; +} + + +static lua_Integer intarith (lua_State *L, int op, lua_Integer v1, + lua_Integer v2) { + switch (op) { + case LUA_OPADD: return intop(+, v1, v2); + case LUA_OPSUB:return intop(-, v1, v2); + case LUA_OPMUL:return intop(*, v1, v2); + case LUA_OPMOD: return luaV_mod(L, v1, v2); + case LUA_OPIDIV: return luaV_idiv(L, v1, v2); + case LUA_OPBAND: return intop(&, v1, v2); + case LUA_OPBOR: return intop(|, v1, v2); + case LUA_OPBXOR: return intop(^, v1, v2); + case LUA_OPSHL: return luaV_shiftl(v1, v2); + case LUA_OPSHR: return luaV_shiftl(v1, -v2); + case LUA_OPUNM: return intop(-, 0, v1); + case LUA_OPBNOT: return intop(^, ~l_castS2U(0), v1); + default: lua_assert(0); return 0; + } +} + + +static lua_Number numarith (lua_State *L, int op, lua_Number v1, + lua_Number v2) { + switch (op) { + case LUA_OPADD: return luai_numadd(L, v1, v2); + case LUA_OPSUB: return luai_numsub(L, v1, v2); + case LUA_OPMUL: return luai_nummul(L, v1, v2); + case LUA_OPDIV: return luai_numdiv(L, v1, v2); + case LUA_OPPOW: return luai_numpow(L, v1, v2); + case LUA_OPIDIV: return luai_numidiv(L, v1, v2); + case LUA_OPUNM: return luai_numunm(L, v1); + case LUA_OPMOD: return luaV_modf(L, v1, v2); + default: lua_assert(0); return 0; + } +} + + +int luaO_rawarith (lua_State *L, int op, const TValue *p1, const TValue *p2, + TValue *res) { + switch (op) { + case LUA_OPBAND: case LUA_OPBOR: case LUA_OPBXOR: + case LUA_OPSHL: case LUA_OPSHR: + case LUA_OPBNOT: { /* operate only on integers */ + lua_Integer i1; lua_Integer i2; + if (tointegerns(p1, &i1) && tointegerns(p2, &i2)) { + setivalue(res, intarith(L, op, i1, i2)); + return 1; + } + else return 0; /* fail */ + } + case LUA_OPDIV: case LUA_OPPOW: { /* operate only on floats */ + lua_Number n1; lua_Number n2; + if (tonumberns(p1, n1) && tonumberns(p2, n2)) { + setfltvalue(res, numarith(L, op, n1, n2)); + return 1; + } + else return 0; /* fail */ + } + default: { /* other operations */ + lua_Number n1; lua_Number n2; + if (ttisinteger(p1) && ttisinteger(p2)) { + setivalue(res, intarith(L, op, ivalue(p1), ivalue(p2))); + return 1; + } + else if (tonumberns(p1, n1) && tonumberns(p2, n2)) { + setfltvalue(res, numarith(L, op, n1, n2)); + return 1; + } + else return 0; /* fail */ + } + } +} + + +void luaO_arith (lua_State *L, int op, const TValue *p1, const TValue *p2, + StkId res) { + if (!luaO_rawarith(L, op, p1, p2, s2v(res))) { + /* could not perform raw operation; try metamethod */ + luaT_trybinTM(L, p1, p2, res, cast(TMS, (op - LUA_OPADD) + TM_ADD)); + } +} + + +int luaO_hexavalue (int c) { + if (lisdigit(c)) return c - '0'; + else return (ltolower(c) - 'a') + 10; +} + + +static int isneg (const char **s) { + if (**s == '-') { (*s)++; return 1; } + else if (**s == '+') (*s)++; + return 0; +} + + + +/* +** {================================================================== +** Lua's implementation for 'lua_strx2number' +** =================================================================== +*/ + +#if !defined(lua_strx2number) + +/* maximum number of significant digits to read (to avoid overflows + even with single floats) */ +#define MAXSIGDIG 30 + +/* +** convert a hexadecimal numeric string to a number, following +** C99 specification for 'strtod' +*/ +static lua_Number lua_strx2number (const char *s, char **endptr) { + int dot = lua_getlocaledecpoint(); + lua_Number r = 0.0; /* result (accumulator) */ + int sigdig = 0; /* number of significant digits */ + int nosigdig = 0; /* number of non-significant digits */ + int e = 0; /* exponent correction */ + int neg; /* 1 if number is negative */ + int hasdot = 0; /* true after seen a dot */ + *endptr = cast_charp(s); /* nothing is valid yet */ + while (lisspace(cast_uchar(*s))) s++; /* skip initial spaces */ + neg = isneg(&s); /* check sign */ + if (!(*s == '0' && (*(s + 1) == 'x' || *(s + 1) == 'X'))) /* check '0x' */ + return 0.0; /* invalid format (no '0x') */ + for (s += 2; ; s++) { /* skip '0x' and read numeral */ + if (*s == dot) { + if (hasdot) break; /* second dot? stop loop */ + else hasdot = 1; + } + else if (lisxdigit(cast_uchar(*s))) { + if (sigdig == 0 && *s == '0') /* non-significant digit (zero)? */ + nosigdig++; + else if (++sigdig <= MAXSIGDIG) /* can read it without overflow? */ + r = (r * cast_num(16.0)) + luaO_hexavalue(*s); + else e++; /* too many digits; ignore, but still count for exponent */ + if (hasdot) e--; /* decimal digit? correct exponent */ + } + else break; /* neither a dot nor a digit */ + } + if (nosigdig + sigdig == 0) /* no digits? */ + return 0.0; /* invalid format */ + *endptr = cast_charp(s); /* valid up to here */ + e *= 4; /* each digit multiplies/divides value by 2^4 */ + if (*s == 'p' || *s == 'P') { /* exponent part? */ + int exp1 = 0; /* exponent value */ + int neg1; /* exponent sign */ + s++; /* skip 'p' */ + neg1 = isneg(&s); /* sign */ + if (!lisdigit(cast_uchar(*s))) + return 0.0; /* invalid; 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_charp(s); /* valid up to here */ + } + if (neg) r = -r; + return l_mathop(ldexp)(r, e); +} + +#endif +/* }====================================================== */ + + +/* maximum length of a numeral to be converted to a number */ +#if !defined (L_MAXLENNUM) +#define L_MAXLENNUM 200 +#endif + +/* +** Convert string 's' to a Lua number (put in 'result'). Return NULL on +** fail or the address of the ending '\0' on success. ('mode' == 'x') +** means a hexadecimal numeral. +*/ +static const char *l_str2dloc (const char *s, lua_Number *result, int mode) { + char *endptr; + *result = (mode == 'x') ? lua_strx2number(s, &endptr) /* try to convert */ + : lua_str2number(s, &endptr); + if (endptr == s) return NULL; /* nothing recognized? */ + while (lisspace(cast_uchar(*endptr))) endptr++; /* skip trailing spaces */ + return (*endptr == '\0') ? endptr : NULL; /* OK iff no trailing chars */ +} + + +/* +** Convert string 's' to a Lua number (put in 'result') handling the +** current locale. +** This function accepts both the current locale or a dot as the radix +** mark. If the conversion fails, it may mean number has a dot but +** locale accepts something else. In that case, the code copies 's' +** to a buffer (because 's' is read-only), changes the dot to the +** current locale radix mark, and tries to convert again. +** The variable 'mode' checks for special characters in the string: +** - 'n' means 'inf' or 'nan' (which should be rejected) +** - 'x' means a hexadecimal numeral +** - '.' just optimizes the search for the common case (no special chars) +*/ +static const char *l_str2d (const char *s, lua_Number *result) { + const char *endptr; + const char *pmode = strpbrk(s, ".xXnN"); /* look for special chars */ + int mode = pmode ? ltolower(cast_uchar(*pmode)) : 0; + if (mode == 'n') /* reject 'inf' and 'nan' */ + return NULL; + endptr = l_str2dloc(s, result, mode); /* try to convert */ + if (endptr == NULL) { /* failed? may be a different locale */ + char buff[L_MAXLENNUM + 1]; + const char *pdot = strchr(s, '.'); + if (pdot == NULL || strlen(s) > L_MAXLENNUM) + return NULL; /* string too long or no dot; fail */ + strcpy(buff, s); /* copy string to buffer */ + buff[pdot - s] = lua_getlocaledecpoint(); /* correct decimal point */ + endptr = l_str2dloc(buff, result, mode); /* try again */ + if (endptr != NULL) + endptr = s + (endptr - buff); /* make relative to 's' */ + } + return endptr; +} + + +#define MAXBY10 cast(lua_Unsigned, LUA_MAXINTEGER / 10) +#define MAXLASTD cast_int(LUA_MAXINTEGER % 10) + +static const char *l_str2int (const char *s, lua_Integer *result) { + lua_Unsigned a = 0; + int empty = 1; + int neg; + while (lisspace(cast_uchar(*s))) s++; /* skip initial spaces */ + neg = isneg(&s); + if (s[0] == '0' && + (s[1] == 'x' || s[1] == 'X')) { /* hex? */ + s += 2; /* skip '0x' */ + for (; lisxdigit(cast_uchar(*s)); s++) { + a = a * 16 + luaO_hexavalue(*s); + empty = 0; + } + } + else { /* decimal */ + for (; lisdigit(cast_uchar(*s)); s++) { + int d = *s - '0'; + if (a >= MAXBY10 && (a > MAXBY10 || d > MAXLASTD + neg)) /* overflow? */ + return NULL; /* do not accept it (as integer) */ + a = a * 10 + d; + empty = 0; + } + } + while (lisspace(cast_uchar(*s))) s++; /* skip trailing spaces */ + if (empty || *s != '\0') return NULL; /* something wrong in the numeral */ + else { + *result = l_castU2S((neg) ? 0u - a : a); + return s; + } +} + + +size_t luaO_str2num (const char *s, TValue *o) { + lua_Integer i; lua_Number n; + const char *e; + if ((e = l_str2int(s, &i)) != NULL) { /* try as an integer */ + setivalue(o, i); + } + else if ((e = l_str2d(s, &n)) != NULL) { /* else try as a float */ + setfltvalue(o, n); + } + else + return 0; /* conversion failed */ + return (e - s) + 1; /* success; return string size */ +} + + +int luaO_utf8esc (char *buff, unsigned long x) { + int n = 1; /* number of bytes put in buffer (backwards) */ + lua_assert(x <= 0x7FFFFFFFu); + if (x < 0x80) /* ascii? */ + buff[UTF8BUFFSZ - 1] = cast_char(x); + else { /* need continuation bytes */ + unsigned int mfb = 0x3f; /* maximum that fits in first byte */ + do { /* add continuation bytes */ + buff[UTF8BUFFSZ - (n++)] = cast_char(0x80 | (x & 0x3f)); + x >>= 6; /* remove added bits */ + mfb >>= 1; /* now there is one less bit available in first byte */ + } while (x > mfb); /* still needs continuation byte? */ + buff[UTF8BUFFSZ - n] = cast_char((~mfb << 1) | x); /* add first byte */ + } + return n; +} + + +/* +** Maximum length of the conversion of a number to a string. Must be +** enough to accommodate both LUA_INTEGER_FMT and LUA_NUMBER_FMT. +** (For a long long int, this is 19 digits plus a sign and a final '\0', +** adding to 21. For a long double, it can go to a sign, 33 digits, +** the dot, an exponent letter, an exponent sign, 5 exponent digits, +** and a final '\0', adding to 43.) +*/ +#define MAXNUMBER2STR 44 + + +/* +** Convert a number object to a string, adding it to a buffer +*/ +static int tostringbuff (TValue *obj, char *buff) { + int len; + lua_assert(ttisnumber(obj)); + if (ttisinteger(obj)) + len = lua_integer2str(buff, MAXNUMBER2STR, ivalue(obj)); + else { + len = lua_number2str(buff, MAXNUMBER2STR, fltvalue(obj)); + if (buff[strspn(buff, "-0123456789")] == '\0') { /* looks like an int? */ + buff[len++] = lua_getlocaledecpoint(); + buff[len++] = '0'; /* adds '.0' to result */ + } + } + return len; +} + + +/* +** Convert a number object to a Lua string, replacing the value at 'obj' +*/ +void luaO_tostring (lua_State *L, TValue *obj) { + char buff[MAXNUMBER2STR]; + int len = tostringbuff(obj, buff); + setsvalue(L, obj, luaS_newlstr(L, buff, len)); +} + + + + +/* +** {================================================================== +** 'luaO_pushvfstring' +** =================================================================== +*/ + +/* size for buffer space used by 'luaO_pushvfstring' */ +#define BUFVFS 200 + +/* buffer used by 'luaO_pushvfstring' */ +typedef struct BuffFS { + lua_State *L; + int pushed; /* number of string pieces already on the stack */ + int blen; /* length of partial string in 'space' */ + char space[BUFVFS]; /* holds last part of the result */ +} BuffFS; + + +/* +** Push given string to the stack, as part of the buffer, and +** join the partial strings in the stack into one. +*/ +static void pushstr (BuffFS *buff, const char *str, size_t l) { + lua_State *L = buff->L; + setsvalue2s(L, L->top, luaS_newlstr(L, str, l)); + L->top++; /* may use one extra slot */ + buff->pushed++; + luaV_concat(L, buff->pushed); /* join partial results into one */ + buff->pushed = 1; +} + + +/* +** empty the buffer space into the stack +*/ +static void clearbuff (BuffFS *buff) { + pushstr(buff, buff->space, buff->blen); /* push buffer contents */ + buff->blen = 0; /* space now is empty */ +} + + +/* +** Get a space of size 'sz' in the buffer. If buffer has not enough +** space, empty it. 'sz' must fit in an empty buffer. +*/ +static char *getbuff (BuffFS *buff, int sz) { + lua_assert(buff->blen <= BUFVFS); lua_assert(sz <= BUFVFS); + if (sz > BUFVFS - buff->blen) /* not enough space? */ + clearbuff(buff); + return buff->space + buff->blen; +} + + +#define addsize(b,sz) ((b)->blen += (sz)) + + +/* +** Add 'str' to the buffer. If string is larger than the buffer space, +** push the string directly to the stack. +*/ +static void addstr2buff (BuffFS *buff, const char *str, size_t slen) { + if (slen <= BUFVFS) { /* does string fit into buffer? */ + char *bf = getbuff(buff, cast_int(slen)); + memcpy(bf, str, slen); /* add string to buffer */ + addsize(buff, cast_int(slen)); + } + else { /* string larger than buffer */ + clearbuff(buff); /* string comes after buffer's content */ + pushstr(buff, str, slen); /* push string */ + } +} + + +/* +** Add a number to the buffer. +*/ +static void addnum2buff (BuffFS *buff, TValue *num) { + char *numbuff = getbuff(buff, MAXNUMBER2STR); + int len = tostringbuff(num, numbuff); /* format number into 'numbuff' */ + addsize(buff, len); +} + + +/* +** this function handles only '%d', '%c', '%f', '%p', '%s', and '%%' + conventional formats, plus Lua-specific '%I' and '%U' +*/ +const char *luaO_pushvfstring (lua_State *L, const char *fmt, va_list argp) { + BuffFS buff; /* holds last part of the result */ + const char *e; /* points to next '%' */ + buff.pushed = buff.blen = 0; + buff.L = L; + while ((e = strchr(fmt, '%')) != NULL) { + addstr2buff(&buff, fmt, e - fmt); /* add 'fmt' up to '%' */ + switch (*(e + 1)) { /* conversion specifier */ + case 's': { /* zero-terminated string */ + const char *s = va_arg(argp, char *); + if (s == NULL) s = "(null)"; + addstr2buff(&buff, s, strlen(s)); + break; + } + case 'c': { /* an 'int' as a character */ + char c = cast_uchar(va_arg(argp, int)); + addstr2buff(&buff, &c, sizeof(char)); + break; + } + case 'd': { /* an 'int' */ + TValue num; + setivalue(&num, va_arg(argp, int)); + addnum2buff(&buff, &num); + break; + } + case 'I': { /* a 'lua_Integer' */ + TValue num; + setivalue(&num, cast(lua_Integer, va_arg(argp, l_uacInt))); + addnum2buff(&buff, &num); + break; + } + case 'f': { /* a 'lua_Number' */ + TValue num; + setfltvalue(&num, cast_num(va_arg(argp, l_uacNumber))); + addnum2buff(&buff, &num); + break; + } + case 'p': { /* a pointer */ + const int sz = 3 * sizeof(void*) + 8; /* enough space for '%p' */ + char *bf = getbuff(&buff, sz); + void *p = va_arg(argp, void *); + int len = lua_pointer2str(bf, sz, p); + addsize(&buff, len); + break; + } + case 'U': { /* a 'long' as a UTF-8 sequence */ + char bf[UTF8BUFFSZ]; + int len = luaO_utf8esc(bf, va_arg(argp, long)); + addstr2buff(&buff, bf + UTF8BUFFSZ - len, len); + break; + } + case '%': { + addstr2buff(&buff, "%", 1); + break; + } + default: { + luaG_runerror(L, "invalid option '%%%c' to 'lua_pushfstring'", + *(e + 1)); + } + } + fmt = e + 2; /* skip '%' and the specifier */ + } + addstr2buff(&buff, fmt, strlen(fmt)); /* rest of 'fmt' */ + clearbuff(&buff); /* empty buffer into the stack */ + lua_assert(buff.pushed == 1); + return svalue(s2v(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; +} + +/* }================================================================== */ + + +#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 srclen) { + size_t bufflen = LUA_IDSIZE; /* free space in buffer */ + if (*source == '=') { /* 'literal' source */ + if (srclen <= bufflen) /* small enough? */ + memcpy(out, source + 1, srclen * sizeof(char)); + else { /* truncate it */ + addstr(out, source + 1, bufflen - 1); + *out = '\0'; + } + } + else if (*source == '@') { /* file name */ + if (srclen <= bufflen) /* small enough? */ + memcpy(out, source + 1, srclen * sizeof(char)); + else { /* add '...' before rest of name */ + addstr(out, RETS, LL(RETS)); + bufflen -= LL(RETS); + memcpy(out, source + 1 + srclen - 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 (srclen < bufflen && nl == NULL) { /* small one-line source? */ + addstr(out, source, srclen); /* keep it */ + } + else { + if (nl != NULL) srclen = nl - source; /* stop at first newline */ + if (srclen > bufflen) srclen = bufflen; + addstr(out, source, srclen); + addstr(out, RETS, LL(RETS)); + } + memcpy(out, POS, (LL(POS) + 1) * sizeof(char)); + } +} + diff --git a/lua-5.4.3/src/lobject.h b/lua-5.4.3/src/lobject.h new file mode 100644 index 0000000..950bebb --- /dev/null +++ b/lua-5.4.3/src/lobject.h @@ -0,0 +1,800 @@ +/* +** $Id: lobject.h $ +** 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 types for collectable non-values +*/ +#define LUA_TUPVAL LUA_NUMTYPES /* upvalues */ +#define LUA_TPROTO (LUA_NUMTYPES+1) /* function prototypes */ +#define LUA_TDEADKEY (LUA_NUMTYPES+2) /* removed keys in tables */ + + + +/* +** number of all possible types (including LUA_TNONE but excluding DEADKEY) +*/ +#define LUA_TOTALTYPES (LUA_TPROTO + 2) + + +/* +** tags for Tagged Values have the following use of bits: +** bits 0-3: actual tag (a LUA_T* constant) +** bits 4-5: variant bits +** bit 6: whether value is collectable +*/ + +/* add variant bits to a type */ +#define makevariant(t,v) ((t) | ((v) << 4)) + + + +/* +** Union of all Lua values +*/ +typedef union Value { + struct GCObject *gc; /* collectable objects */ + void *p; /* light userdata */ + lua_CFunction f; /* light C functions */ + lua_Integer i; /* integer numbers */ + lua_Number n; /* float numbers */ +} Value; + + +/* +** Tagged Values. This is the basic representation of values in Lua: +** an actual value plus a tag with its type. +*/ + +#define TValuefields Value value_; lu_byte tt_ + +typedef struct TValue { + TValuefields; +} TValue; + + +#define val_(o) ((o)->value_) +#define valraw(o) (&val_(o)) + + +/* raw type tag of a TValue */ +#define rawtt(o) ((o)->tt_) + +/* tag with no variants (bits 0-3) */ +#define novariant(t) ((t) & 0x0F) + +/* type tag of a TValue (bits 0-3 for tags + variant bits 4-5) */ +#define withvariant(t) ((t) & 0x3F) +#define ttypetag(o) withvariant(rawtt(o)) + +/* type of a TValue */ +#define ttype(o) (novariant(rawtt(o))) + + +/* Macros to test type */ +#define checktag(o,t) (rawtt(o) == (t)) +#define checktype(o,t) (ttype(o) == (t)) + + +/* Macros for internal tests */ + +/* collectable object has the same tag as the original value */ +#define righttt(obj) (ttypetag(obj) == gcvalue(obj)->tt) + +/* +** Any value being manipulated by the program either is non +** collectable, or the collectable object has the right tag +** and it is not dead. The option 'L == NULL' allows other +** macros using this one to be used where L is not available. +*/ +#define checkliveness(L,obj) \ + ((void)L, lua_longassert(!iscollectable(obj) || \ + (righttt(obj) && (L == NULL || !isdead(G(L),gcvalue(obj)))))) + + +/* Macros to set values */ + +/* set a value's tag */ +#define settt_(o,t) ((o)->tt_=(t)) + + +/* main macro to copy values (from 'obj1' to 'obj2') */ +#define setobj(L,obj1,obj2) \ + { TValue *io1=(obj1); const TValue *io2=(obj2); \ + io1->value_ = io2->value_; settt_(io1, io2->tt_); \ + checkliveness(L,io1); lua_assert(!isnonstrictnil(io1)); } + +/* +** Different types of assignments, according to source and destination. +** (They are mostly equal now, but may be different in the future.) +*/ + +/* from stack to stack */ +#define setobjs2s(L,o1,o2) setobj(L,s2v(o1),s2v(o2)) +/* to stack (not from same stack) */ +#define setobj2s(L,o1,o2) setobj(L,s2v(o1),o2) +/* from table to same table */ +#define setobjt2t setobj +/* to new object */ +#define setobj2n setobj +/* to table */ +#define setobj2t setobj + + +/* +** Entries in a Lua stack. Field 'tbclist' forms a list of all +** to-be-closed variables active in this stack. Dummy entries are +** used when the distance between two tbc variables does not fit +** in an unsigned short. They are represented by delta==0, and +** their real delta is always the maximum value that fits in +** that field. +*/ +typedef union StackValue { + TValue val; + struct { + TValuefields; + unsigned short delta; + } tbclist; +} StackValue; + + +/* index to stack elements */ +typedef StackValue *StkId; + +/* convert a 'StackValue' to a 'TValue' */ +#define s2v(o) (&(o)->val) + + + +/* +** {================================================================== +** Nil +** =================================================================== +*/ + +/* Standard nil */ +#define LUA_VNIL makevariant(LUA_TNIL, 0) + +/* Empty slot (which might be different from a slot containing nil) */ +#define LUA_VEMPTY makevariant(LUA_TNIL, 1) + +/* Value returned for a key not found in a table (absent key) */ +#define LUA_VABSTKEY makevariant(LUA_TNIL, 2) + + +/* macro to test for (any kind of) nil */ +#define ttisnil(v) checktype((v), LUA_TNIL) + + +/* macro to test for a standard nil */ +#define ttisstrictnil(o) checktag((o), LUA_VNIL) + + +#define setnilvalue(obj) settt_(obj, LUA_VNIL) + + +#define isabstkey(v) checktag((v), LUA_VABSTKEY) + + +/* +** macro to detect non-standard nils (used only in assertions) +*/ +#define isnonstrictnil(v) (ttisnil(v) && !ttisstrictnil(v)) + + +/* +** By default, entries with any kind of nil are considered empty. +** (In any definition, values associated with absent keys must also +** be accepted as empty.) +*/ +#define isempty(v) ttisnil(v) + + +/* macro defining a value corresponding to an absent key */ +#define ABSTKEYCONSTANT {NULL}, LUA_VABSTKEY + + +/* mark an entry as empty */ +#define setempty(v) settt_(v, LUA_VEMPTY) + + + +/* }================================================================== */ + + +/* +** {================================================================== +** Booleans +** =================================================================== +*/ + + +#define LUA_VFALSE makevariant(LUA_TBOOLEAN, 0) +#define LUA_VTRUE makevariant(LUA_TBOOLEAN, 1) + +#define ttisboolean(o) checktype((o), LUA_TBOOLEAN) +#define ttisfalse(o) checktag((o), LUA_VFALSE) +#define ttistrue(o) checktag((o), LUA_VTRUE) + + +#define l_isfalse(o) (ttisfalse(o) || ttisnil(o)) + + +#define setbfvalue(obj) settt_(obj, LUA_VFALSE) +#define setbtvalue(obj) settt_(obj, LUA_VTRUE) + +/* }================================================================== */ + + +/* +** {================================================================== +** Threads +** =================================================================== +*/ + +#define LUA_VTHREAD makevariant(LUA_TTHREAD, 0) + +#define ttisthread(o) checktag((o), ctb(LUA_VTHREAD)) + +#define thvalue(o) check_exp(ttisthread(o), gco2th(val_(o).gc)) + +#define setthvalue(L,obj,x) \ + { TValue *io = (obj); lua_State *x_ = (x); \ + val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VTHREAD)); \ + checkliveness(L,io); } + +#define setthvalue2s(L,o,t) setthvalue(L,s2v(o),t) + +/* }================================================================== */ + + +/* +** {================================================================== +** Collectable Objects +** =================================================================== +*/ + +/* +** Common Header for all collectable objects (in macro form, to be +** included in other objects) +*/ +#define CommonHeader struct GCObject *next; lu_byte tt; lu_byte marked + + +/* Common type for all collectable objects */ +typedef struct GCObject { + CommonHeader; +} GCObject; + + +/* Bit mark for collectable types */ +#define BIT_ISCOLLECTABLE (1 << 6) + +#define iscollectable(o) (rawtt(o) & BIT_ISCOLLECTABLE) + +/* mark a tag as collectable */ +#define ctb(t) ((t) | BIT_ISCOLLECTABLE) + +#define gcvalue(o) check_exp(iscollectable(o), val_(o).gc) + +#define gcvalueraw(v) ((v).gc) + +#define setgcovalue(L,obj,x) \ + { TValue *io = (obj); GCObject *i_g=(x); \ + val_(io).gc = i_g; settt_(io, ctb(i_g->tt)); } + +/* }================================================================== */ + + +/* +** {================================================================== +** Numbers +** =================================================================== +*/ + +/* Variant tags for numbers */ +#define LUA_VNUMINT makevariant(LUA_TNUMBER, 0) /* integer numbers */ +#define LUA_VNUMFLT makevariant(LUA_TNUMBER, 1) /* float numbers */ + +#define ttisnumber(o) checktype((o), LUA_TNUMBER) +#define ttisfloat(o) checktag((o), LUA_VNUMFLT) +#define ttisinteger(o) checktag((o), LUA_VNUMINT) + +#define nvalue(o) check_exp(ttisnumber(o), \ + (ttisinteger(o) ? cast_num(ivalue(o)) : fltvalue(o))) +#define fltvalue(o) check_exp(ttisfloat(o), val_(o).n) +#define ivalue(o) check_exp(ttisinteger(o), val_(o).i) + +#define fltvalueraw(v) ((v).n) +#define ivalueraw(v) ((v).i) + +#define setfltvalue(obj,x) \ + { TValue *io=(obj); val_(io).n=(x); settt_(io, LUA_VNUMFLT); } + +#define chgfltvalue(obj,x) \ + { TValue *io=(obj); lua_assert(ttisfloat(io)); val_(io).n=(x); } + +#define setivalue(obj,x) \ + { TValue *io=(obj); val_(io).i=(x); settt_(io, LUA_VNUMINT); } + +#define chgivalue(obj,x) \ + { TValue *io=(obj); lua_assert(ttisinteger(io)); val_(io).i=(x); } + +/* }================================================================== */ + + +/* +** {================================================================== +** Strings +** =================================================================== +*/ + +/* Variant tags for strings */ +#define LUA_VSHRSTR makevariant(LUA_TSTRING, 0) /* short strings */ +#define LUA_VLNGSTR makevariant(LUA_TSTRING, 1) /* long strings */ + +#define ttisstring(o) checktype((o), LUA_TSTRING) +#define ttisshrstring(o) checktag((o), ctb(LUA_VSHRSTR)) +#define ttislngstring(o) checktag((o), ctb(LUA_VLNGSTR)) + +#define tsvalueraw(v) (gco2ts((v).gc)) + +#define tsvalue(o) check_exp(ttisstring(o), gco2ts(val_(o).gc)) + +#define setsvalue(L,obj,x) \ + { TValue *io = (obj); TString *x_ = (x); \ + val_(io).gc = obj2gco(x_); settt_(io, ctb(x_->tt)); \ + checkliveness(L,io); } + +/* set a string to the stack */ +#define setsvalue2s(L,o,s) setsvalue(L,s2v(o),s) + +/* set a string to a new object */ +#define setsvalue2n setsvalue + + +/* +** Header for a string value. +*/ +typedef struct TString { + CommonHeader; + lu_byte extra; /* reserved words for short strings; "has hash" for longs */ + lu_byte shrlen; /* length for short strings */ + unsigned int hash; + union { + size_t lnglen; /* length for long strings */ + struct TString *hnext; /* linked list for hash table */ + } u; + char contents[1]; +} TString; + + + +/* +** Get the actual string (array of bytes) from a 'TString'. +*/ +#define getstr(ts) ((ts)->contents) + + +/* get the actual string (array of bytes) from a Lua value */ +#define svalue(o) getstr(tsvalue(o)) + +/* get string length from 'TString *s' */ +#define tsslen(s) ((s)->tt == LUA_VSHRSTR ? (s)->shrlen : (s)->u.lnglen) + +/* get string length from 'TValue *o' */ +#define vslen(o) tsslen(tsvalue(o)) + +/* }================================================================== */ + + +/* +** {================================================================== +** Userdata +** =================================================================== +*/ + + +/* +** Light userdata should be a variant of userdata, but for compatibility +** reasons they are also different types. +*/ +#define LUA_VLIGHTUSERDATA makevariant(LUA_TLIGHTUSERDATA, 0) + +#define LUA_VUSERDATA makevariant(LUA_TUSERDATA, 0) + +#define ttislightuserdata(o) checktag((o), LUA_VLIGHTUSERDATA) +#define ttisfulluserdata(o) checktag((o), ctb(LUA_VUSERDATA)) + +#define pvalue(o) check_exp(ttislightuserdata(o), val_(o).p) +#define uvalue(o) check_exp(ttisfulluserdata(o), gco2u(val_(o).gc)) + +#define pvalueraw(v) ((v).p) + +#define setpvalue(obj,x) \ + { TValue *io=(obj); val_(io).p=(x); settt_(io, LUA_VLIGHTUSERDATA); } + +#define setuvalue(L,obj,x) \ + { TValue *io = (obj); Udata *x_ = (x); \ + val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VUSERDATA)); \ + checkliveness(L,io); } + + +/* Ensures that addresses after this type are always fully aligned. */ +typedef union UValue { + TValue uv; + LUAI_MAXALIGN; /* ensures maximum alignment for udata bytes */ +} UValue; + + +/* +** Header for userdata with user values; +** memory area follows the end of this structure. +*/ +typedef struct Udata { + CommonHeader; + unsigned short nuvalue; /* number of user values */ + size_t len; /* number of bytes */ + struct Table *metatable; + GCObject *gclist; + UValue uv[1]; /* user values */ +} Udata; + + +/* +** Header for userdata with no user values. These userdata do not need +** to be gray during GC, and therefore do not need a 'gclist' field. +** To simplify, the code always use 'Udata' for both kinds of userdata, +** making sure it never accesses 'gclist' on userdata with no user values. +** This structure here is used only to compute the correct size for +** this representation. (The 'bindata' field in its end ensures correct +** alignment for binary data following this header.) +*/ +typedef struct Udata0 { + CommonHeader; + unsigned short nuvalue; /* number of user values */ + size_t len; /* number of bytes */ + struct Table *metatable; + union {LUAI_MAXALIGN;} bindata; +} Udata0; + + +/* compute the offset of the memory area of a userdata */ +#define udatamemoffset(nuv) \ + ((nuv) == 0 ? offsetof(Udata0, bindata) \ + : offsetof(Udata, uv) + (sizeof(UValue) * (nuv))) + +/* get the address of the memory block inside 'Udata' */ +#define getudatamem(u) (cast_charp(u) + udatamemoffset((u)->nuvalue)) + +/* compute the size of a userdata */ +#define sizeudata(nuv,nb) (udatamemoffset(nuv) + (nb)) + +/* }================================================================== */ + + +/* +** {================================================================== +** Prototypes +** =================================================================== +*/ + +#define LUA_VPROTO makevariant(LUA_TPROTO, 0) + + +/* +** 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 (register) */ + lu_byte idx; /* index of upvalue (in stack or in outer function's list) */ + lu_byte kind; /* kind of corresponding variable */ +} 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; + + +/* +** Associates the absolute line source for a given instruction ('pc'). +** The array 'lineinfo' gives, for each instruction, the difference in +** lines from the previous instruction. When that difference does not +** fit into a byte, Lua saves the absolute line for that instruction. +** (Lua also saves the absolute line periodically, to speed up the +** computation of a line number: we can use binary search in the +** absolute-line array, but we must traverse the 'lineinfo' array +** linearly to compute a line.) +*/ +typedef struct AbsLineInfo { + int pc; + int line; +} AbsLineInfo; + +/* +** Function Prototypes +*/ +typedef struct Proto { + CommonHeader; + lu_byte numparams; /* number of fixed (named) parameters */ + lu_byte is_vararg; + lu_byte maxstacksize; /* number of registers needed by this function */ + int sizeupvalues; /* size of 'upvalues' */ + int sizek; /* size of 'k' */ + int sizecode; + int sizelineinfo; + int sizep; /* size of 'p' */ + int sizelocvars; + int sizeabslineinfo; /* size of 'abslineinfo' */ + int linedefined; /* debug information */ + int lastlinedefined; /* debug information */ + TValue *k; /* constants used by the function */ + Instruction *code; /* opcodes */ + struct Proto **p; /* functions defined inside the function */ + Upvaldesc *upvalues; /* upvalue information */ + ls_byte *lineinfo; /* information about source lines (debug information) */ + AbsLineInfo *abslineinfo; /* idem */ + LocVar *locvars; /* information about local variables (debug information) */ + TString *source; /* used for debug information */ + GCObject *gclist; +} Proto; + +/* }================================================================== */ + + +/* +** {================================================================== +** Functions +** =================================================================== +*/ + +#define LUA_VUPVAL makevariant(LUA_TUPVAL, 0) + + +/* Variant tags for functions */ +#define LUA_VLCL makevariant(LUA_TFUNCTION, 0) /* Lua closure */ +#define LUA_VLCF makevariant(LUA_TFUNCTION, 1) /* light C function */ +#define LUA_VCCL makevariant(LUA_TFUNCTION, 2) /* C closure */ + +#define ttisfunction(o) checktype(o, LUA_TFUNCTION) +#define ttisLclosure(o) checktag((o), ctb(LUA_VLCL)) +#define ttislcf(o) checktag((o), LUA_VLCF) +#define ttisCclosure(o) checktag((o), ctb(LUA_VCCL)) +#define ttisclosure(o) (ttisLclosure(o) || ttisCclosure(o)) + + +#define isLfunction(o) ttisLclosure(o) + +#define clvalue(o) check_exp(ttisclosure(o), gco2cl(val_(o).gc)) +#define clLvalue(o) check_exp(ttisLclosure(o), gco2lcl(val_(o).gc)) +#define fvalue(o) check_exp(ttislcf(o), val_(o).f) +#define clCvalue(o) check_exp(ttisCclosure(o), gco2ccl(val_(o).gc)) + +#define fvalueraw(v) ((v).f) + +#define setclLvalue(L,obj,x) \ + { TValue *io = (obj); LClosure *x_ = (x); \ + val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VLCL)); \ + checkliveness(L,io); } + +#define setclLvalue2s(L,o,cl) setclLvalue(L,s2v(o),cl) + +#define setfvalue(obj,x) \ + { TValue *io=(obj); val_(io).f=(x); settt_(io, LUA_VLCF); } + +#define setclCvalue(L,obj,x) \ + { TValue *io = (obj); CClosure *x_ = (x); \ + val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VCCL)); \ + checkliveness(L,io); } + + +/* +** Upvalues for Lua closures +*/ +typedef struct UpVal { + CommonHeader; + lu_byte tbc; /* true if it represents a to-be-closed variable */ + TValue *v; /* points to stack or to its own value */ + union { + struct { /* (when open) */ + struct UpVal *next; /* linked list */ + struct UpVal **previous; + } open; + TValue value; /* the value (when closed) */ + } u; +} UpVal; + + + +#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 getproto(o) (clLvalue(o)->p) + +/* }================================================================== */ + + +/* +** {================================================================== +** Tables +** =================================================================== +*/ + +#define LUA_VTABLE makevariant(LUA_TTABLE, 0) + +#define ttistable(o) checktag((o), ctb(LUA_VTABLE)) + +#define hvalue(o) check_exp(ttistable(o), gco2t(val_(o).gc)) + +#define sethvalue(L,obj,x) \ + { TValue *io = (obj); Table *x_ = (x); \ + val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VTABLE)); \ + checkliveness(L,io); } + +#define sethvalue2s(L,o,h) sethvalue(L,s2v(o),h) + + +/* +** Nodes for Hash tables: A pack of two TValue's (key-value pairs) +** plus a 'next' field to link colliding entries. The distribution +** of the key's fields ('key_tt' and 'key_val') not forming a proper +** 'TValue' allows for a smaller size for 'Node' both in 4-byte +** and 8-byte alignments. +*/ +typedef union Node { + struct NodeKey { + TValuefields; /* fields for value */ + lu_byte key_tt; /* key type */ + int next; /* for chaining */ + Value key_val; /* key value */ + } u; + TValue i_val; /* direct access to node's value as a proper 'TValue' */ +} Node; + + +/* copy a value into a key */ +#define setnodekey(L,node,obj) \ + { Node *n_=(node); const TValue *io_=(obj); \ + n_->u.key_val = io_->value_; n_->u.key_tt = io_->tt_; \ + checkliveness(L,io_); } + + +/* copy a value from a key */ +#define getnodekey(L,obj,node) \ + { TValue *io_=(obj); const Node *n_=(node); \ + io_->value_ = n_->u.key_val; io_->tt_ = n_->u.key_tt; \ + checkliveness(L,io_); } + + +/* +** About 'alimit': if 'isrealasize(t)' is true, then 'alimit' is the +** real size of 'array'. Otherwise, the real size of 'array' is the +** smallest power of two not smaller than 'alimit' (or zero iff 'alimit' +** is zero); 'alimit' is then used as a hint for #t. +*/ + +#define BITRAS (1 << 7) +#define isrealasize(t) (!((t)->flags & BITRAS)) +#define setrealasize(t) ((t)->flags &= cast_byte(~BITRAS)) +#define setnorealasize(t) ((t)->flags |= BITRAS) + + +typedef struct Table { + CommonHeader; + lu_byte flags; /* 1<

u.key_tt) +#define keyval(node) ((node)->u.key_val) + +#define keyisnil(node) (keytt(node) == LUA_TNIL) +#define keyisinteger(node) (keytt(node) == LUA_VNUMINT) +#define keyival(node) (keyval(node).i) +#define keyisshrstr(node) (keytt(node) == ctb(LUA_VSHRSTR)) +#define keystrval(node) (gco2ts(keyval(node).gc)) + +#define setnilkey(node) (keytt(node) = LUA_TNIL) + +#define keyiscollectable(n) (keytt(n) & BIT_ISCOLLECTABLE) + +#define gckey(n) (keyval(n).gc) +#define gckeyN(n) (keyiscollectable(n) ? gckey(n) : NULL) + + +/* +** Dead keys in tables have the tag DEADKEY but keep their original +** gcvalue. This distinguishes them from regular keys but allows them to +** be found when searched in a special way. ('next' needs that to find +** keys removed from a table during a traversal.) +*/ +#define setdeadkey(node) (keytt(node) = LUA_TDEADKEY) +#define keyisdead(node) (keytt(node) == LUA_TDEADKEY) + +/* }================================================================== */ + + + +/* +** 'module' operation for hashing (size is always a power of 2) +*/ +#define lmod(s,size) \ + (check_exp((size&(size-1))==0, (cast_int((s) & ((size)-1))))) + + +#define twoto(x) (1<<(x)) +#define sizenode(t) (twoto((t)->lsizenode)) + + +/* size of buffer for 'luaO_utf8esc' function */ +#define UTF8BUFFSZ 8 + +LUAI_FUNC int luaO_utf8esc (char *buff, unsigned long x); +LUAI_FUNC int luaO_ceillog2 (unsigned int x); +LUAI_FUNC int luaO_rawarith (lua_State *L, int op, const TValue *p1, + const TValue *p2, TValue *res); +LUAI_FUNC void luaO_arith (lua_State *L, int op, const TValue *p1, + const TValue *p2, StkId res); +LUAI_FUNC size_t luaO_str2num (const char *s, TValue *o); +LUAI_FUNC int luaO_hexavalue (int c); +LUAI_FUNC void luaO_tostring (lua_State *L, TValue *obj); +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 srclen); + + +#endif + diff --git a/lua-5.4.3/src/lopcodes.c b/lua-5.4.3/src/lopcodes.c new file mode 100644 index 0000000..c67aa22 --- /dev/null +++ b/lua-5.4.3/src/lopcodes.c @@ -0,0 +1,104 @@ +/* +** $Id: lopcodes.c $ +** Opcodes for Lua virtual machine +** See Copyright Notice in lua.h +*/ + +#define lopcodes_c +#define LUA_CORE + +#include "lprefix.h" + + +#include "lopcodes.h" + + +/* ORDER OP */ + +LUAI_DDEF const lu_byte luaP_opmodes[NUM_OPCODES] = { +/* MM OT IT T A mode opcode */ + opmode(0, 0, 0, 0, 1, iABC) /* OP_MOVE */ + ,opmode(0, 0, 0, 0, 1, iAsBx) /* OP_LOADI */ + ,opmode(0, 0, 0, 0, 1, iAsBx) /* OP_LOADF */ + ,opmode(0, 0, 0, 0, 1, iABx) /* OP_LOADK */ + ,opmode(0, 0, 0, 0, 1, iABx) /* OP_LOADKX */ + ,opmode(0, 0, 0, 0, 1, iABC) /* OP_LOADFALSE */ + ,opmode(0, 0, 0, 0, 1, iABC) /* OP_LFALSESKIP */ + ,opmode(0, 0, 0, 0, 1, iABC) /* OP_LOADTRUE */ + ,opmode(0, 0, 0, 0, 1, iABC) /* OP_LOADNIL */ + ,opmode(0, 0, 0, 0, 1, iABC) /* OP_GETUPVAL */ + ,opmode(0, 0, 0, 0, 0, iABC) /* OP_SETUPVAL */ + ,opmode(0, 0, 0, 0, 1, iABC) /* OP_GETTABUP */ + ,opmode(0, 0, 0, 0, 1, iABC) /* OP_GETTABLE */ + ,opmode(0, 0, 0, 0, 1, iABC) /* OP_GETI */ + ,opmode(0, 0, 0, 0, 1, iABC) /* OP_GETFIELD */ + ,opmode(0, 0, 0, 0, 0, iABC) /* OP_SETTABUP */ + ,opmode(0, 0, 0, 0, 0, iABC) /* OP_SETTABLE */ + ,opmode(0, 0, 0, 0, 0, iABC) /* OP_SETI */ + ,opmode(0, 0, 0, 0, 0, iABC) /* OP_SETFIELD */ + ,opmode(0, 0, 0, 0, 1, iABC) /* OP_NEWTABLE */ + ,opmode(0, 0, 0, 0, 1, iABC) /* OP_SELF */ + ,opmode(0, 0, 0, 0, 1, iABC) /* OP_ADDI */ + ,opmode(0, 0, 0, 0, 1, iABC) /* OP_ADDK */ + ,opmode(0, 0, 0, 0, 1, iABC) /* OP_SUBK */ + ,opmode(0, 0, 0, 0, 1, iABC) /* OP_MULK */ + ,opmode(0, 0, 0, 0, 1, iABC) /* OP_MODK */ + ,opmode(0, 0, 0, 0, 1, iABC) /* OP_POWK */ + ,opmode(0, 0, 0, 0, 1, iABC) /* OP_DIVK */ + ,opmode(0, 0, 0, 0, 1, iABC) /* OP_IDIVK */ + ,opmode(0, 0, 0, 0, 1, iABC) /* OP_BANDK */ + ,opmode(0, 0, 0, 0, 1, iABC) /* OP_BORK */ + ,opmode(0, 0, 0, 0, 1, iABC) /* OP_BXORK */ + ,opmode(0, 0, 0, 0, 1, iABC) /* OP_SHRI */ + ,opmode(0, 0, 0, 0, 1, iABC) /* OP_SHLI */ + ,opmode(0, 0, 0, 0, 1, iABC) /* OP_ADD */ + ,opmode(0, 0, 0, 0, 1, iABC) /* OP_SUB */ + ,opmode(0, 0, 0, 0, 1, iABC) /* OP_MUL */ + ,opmode(0, 0, 0, 0, 1, iABC) /* OP_MOD */ + ,opmode(0, 0, 0, 0, 1, iABC) /* OP_POW */ + ,opmode(0, 0, 0, 0, 1, iABC) /* OP_DIV */ + ,opmode(0, 0, 0, 0, 1, iABC) /* OP_IDIV */ + ,opmode(0, 0, 0, 0, 1, iABC) /* OP_BAND */ + ,opmode(0, 0, 0, 0, 1, iABC) /* OP_BOR */ + ,opmode(0, 0, 0, 0, 1, iABC) /* OP_BXOR */ + ,opmode(0, 0, 0, 0, 1, iABC) /* OP_SHL */ + ,opmode(0, 0, 0, 0, 1, iABC) /* OP_SHR */ + ,opmode(1, 0, 0, 0, 0, iABC) /* OP_MMBIN */ + ,opmode(1, 0, 0, 0, 0, iABC) /* OP_MMBINI*/ + ,opmode(1, 0, 0, 0, 0, iABC) /* OP_MMBINK*/ + ,opmode(0, 0, 0, 0, 1, iABC) /* OP_UNM */ + ,opmode(0, 0, 0, 0, 1, iABC) /* OP_BNOT */ + ,opmode(0, 0, 0, 0, 1, iABC) /* OP_NOT */ + ,opmode(0, 0, 0, 0, 1, iABC) /* OP_LEN */ + ,opmode(0, 0, 0, 0, 1, iABC) /* OP_CONCAT */ + ,opmode(0, 0, 0, 0, 0, iABC) /* OP_CLOSE */ + ,opmode(0, 0, 0, 0, 0, iABC) /* OP_TBC */ + ,opmode(0, 0, 0, 0, 0, isJ) /* OP_JMP */ + ,opmode(0, 0, 0, 1, 0, iABC) /* OP_EQ */ + ,opmode(0, 0, 0, 1, 0, iABC) /* OP_LT */ + ,opmode(0, 0, 0, 1, 0, iABC) /* OP_LE */ + ,opmode(0, 0, 0, 1, 0, iABC) /* OP_EQK */ + ,opmode(0, 0, 0, 1, 0, iABC) /* OP_EQI */ + ,opmode(0, 0, 0, 1, 0, iABC) /* OP_LTI */ + ,opmode(0, 0, 0, 1, 0, iABC) /* OP_LEI */ + ,opmode(0, 0, 0, 1, 0, iABC) /* OP_GTI */ + ,opmode(0, 0, 0, 1, 0, iABC) /* OP_GEI */ + ,opmode(0, 0, 0, 1, 0, iABC) /* OP_TEST */ + ,opmode(0, 0, 0, 1, 1, iABC) /* OP_TESTSET */ + ,opmode(0, 1, 1, 0, 1, iABC) /* OP_CALL */ + ,opmode(0, 1, 1, 0, 1, iABC) /* OP_TAILCALL */ + ,opmode(0, 0, 1, 0, 0, iABC) /* OP_RETURN */ + ,opmode(0, 0, 0, 0, 0, iABC) /* OP_RETURN0 */ + ,opmode(0, 0, 0, 0, 0, iABC) /* OP_RETURN1 */ + ,opmode(0, 0, 0, 0, 1, iABx) /* OP_FORLOOP */ + ,opmode(0, 0, 0, 0, 1, iABx) /* OP_FORPREP */ + ,opmode(0, 0, 0, 0, 0, iABx) /* OP_TFORPREP */ + ,opmode(0, 0, 0, 0, 0, iABC) /* OP_TFORCALL */ + ,opmode(0, 0, 0, 0, 1, iABx) /* OP_TFORLOOP */ + ,opmode(0, 0, 1, 0, 0, iABC) /* OP_SETLIST */ + ,opmode(0, 0, 0, 0, 1, iABx) /* OP_CLOSURE */ + ,opmode(0, 1, 0, 0, 1, iABC) /* OP_VARARG */ + ,opmode(0, 0, 1, 0, 1, iABC) /* OP_VARARGPREP */ + ,opmode(0, 0, 0, 0, 0, iAx) /* OP_EXTRAARG */ +}; + diff --git a/lua-5.4.3/src/lopcodes.h b/lua-5.4.3/src/lopcodes.h new file mode 100644 index 0000000..d6a47e5 --- /dev/null +++ b/lua-5.4.3/src/lopcodes.h @@ -0,0 +1,392 @@ +/* +** $Id: lopcodes.h $ +** 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 32-bit integers. + All instructions have an opcode in the first 7 bits. + Instructions can have the following formats: + + 3 3 2 2 2 2 2 2 2 2 2 2 1 1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 + 1 0 9 8 7 6 5 4 3 2 1 0 9 8 7 6 5 4 3 2 1 0 9 8 7 6 5 4 3 2 1 0 +iABC C(8) | B(8) |k| A(8) | Op(7) | +iABx Bx(17) | A(8) | Op(7) | +iAsBx sBx (signed)(17) | A(8) | Op(7) | +iAx Ax(25) | Op(7) | +isJ sJ(25) | Op(7) | + + A signed argument is represented in excess K: the represented value is + the written unsigned value minus K, where K is half the maximum for the + corresponding unsigned argument. +===========================================================================*/ + + +enum OpMode {iABC, iABx, iAsBx, iAx, isJ}; /* basic instruction formats */ + + +/* +** size and position of opcode arguments. +*/ +#define SIZE_C 8 +#define SIZE_B 8 +#define SIZE_Bx (SIZE_C + SIZE_B + 1) +#define SIZE_A 8 +#define SIZE_Ax (SIZE_Bx + SIZE_A) +#define SIZE_sJ (SIZE_Bx + SIZE_A) + +#define SIZE_OP 7 + +#define POS_OP 0 + +#define POS_A (POS_OP + SIZE_OP) +#define POS_k (POS_A + SIZE_A) +#define POS_B (POS_k + 1) +#define POS_C (POS_B + SIZE_B) + +#define POS_Bx POS_k + +#define POS_Ax POS_A + +#define POS_sJ POS_A + + +/* +** limits for opcode arguments. +** we use (signed) 'int' to manipulate most arguments, +** so they must fit in ints. +*/ + +/* Check whether type 'int' has at least 'b' bits ('b' < 32) */ +#define L_INTHASBITS(b) ((UINT_MAX >> ((b) - 1)) >= 1) + + +#if L_INTHASBITS(SIZE_Bx) +#define MAXARG_Bx ((1<>1) /* 'sBx' is signed */ + + +#if L_INTHASBITS(SIZE_Ax) +#define MAXARG_Ax ((1<> 1) + + +#define MAXARG_A ((1<> 1) + +#define int2sC(i) ((i) + OFFSET_sC) +#define sC2int(i) ((i) - OFFSET_sC) + + +/* creates a mask with 'n' 1 bits at position 'p' */ +#define MASK1(n,p) ((~((~(Instruction)0)<<(n)))<<(p)) + +/* creates a mask with 'n' 0 bits at position 'p' */ +#define MASK0(n,p) (~MASK1(n,p)) + +/* +** the following macros help to manipulate instructions +*/ + +#define GET_OPCODE(i) (cast(OpCode, ((i)>>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)<> sC */ +OP_SHLI,/* A B sC R[A] := sC << R[B] */ + +OP_ADD,/* A B C R[A] := R[B] + R[C] */ +OP_SUB,/* A B C R[A] := R[B] - R[C] */ +OP_MUL,/* A B C R[A] := R[B] * R[C] */ +OP_MOD,/* A B C R[A] := R[B] % R[C] */ +OP_POW,/* A B C R[A] := R[B] ^ R[C] */ +OP_DIV,/* A B C R[A] := R[B] / R[C] */ +OP_IDIV,/* A B C R[A] := R[B] // R[C] */ + +OP_BAND,/* A B C R[A] := R[B] & R[C] */ +OP_BOR,/* A B C R[A] := R[B] | R[C] */ +OP_BXOR,/* A B C R[A] := R[B] ~ R[C] */ +OP_SHL,/* A B C R[A] := R[B] << R[C] */ +OP_SHR,/* A B C R[A] := R[B] >> R[C] */ + +OP_MMBIN,/* A B C call C metamethod over R[A] and R[B] */ +OP_MMBINI,/* A sB C k call C metamethod over R[A] and sB */ +OP_MMBINK,/* A B C k call C metamethod over R[A] and K[B] */ + +OP_UNM,/* A B R[A] := -R[B] */ +OP_BNOT,/* A B R[A] := ~R[B] */ +OP_NOT,/* A B R[A] := not R[B] */ +OP_LEN,/* A B R[A] := #R[B] (length operator) */ + +OP_CONCAT,/* A B R[A] := R[A].. ... ..R[A + B - 1] */ + +OP_CLOSE,/* A close all upvalues >= R[A] */ +OP_TBC,/* A mark variable A "to be closed" */ +OP_JMP,/* sJ pc += sJ */ +OP_EQ,/* A B k if ((R[A] == R[B]) ~= k) then pc++ */ +OP_LT,/* A B k if ((R[A] < R[B]) ~= k) then pc++ */ +OP_LE,/* A B k if ((R[A] <= R[B]) ~= k) then pc++ */ + +OP_EQK,/* A B k if ((R[A] == K[B]) ~= k) then pc++ */ +OP_EQI,/* A sB k if ((R[A] == sB) ~= k) then pc++ */ +OP_LTI,/* A sB k if ((R[A] < sB) ~= k) then pc++ */ +OP_LEI,/* A sB k if ((R[A] <= sB) ~= k) then pc++ */ +OP_GTI,/* A sB k if ((R[A] > sB) ~= k) then pc++ */ +OP_GEI,/* A sB k if ((R[A] >= sB) ~= k) then pc++ */ + +OP_TEST,/* A k if (not R[A] == k) then pc++ */ +OP_TESTSET,/* A B k if (not R[B] == k) then pc++ else R[A] := R[B] */ + +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 k return R[A](R[A+1], ... ,R[A+B-1]) */ + +OP_RETURN,/* A B C k return R[A], ... ,R[A+B-2] (see note) */ +OP_RETURN0,/* return */ +OP_RETURN1,/* A return R[A] */ + +OP_FORLOOP,/* A Bx update counters; if loop continues then pc-=Bx; */ +OP_FORPREP,/* A Bx ; + if not to run then pc+=Bx+1; */ + +OP_TFORPREP,/* A Bx create upvalue for R[A + 3]; pc+=Bx */ +OP_TFORCALL,/* A C R[A+4], ... ,R[A+3+C] := R[A](R[A+1], R[A+2]); */ +OP_TFORLOOP,/* A Bx if R[A+2] ~= nil then { R[A]=R[A+2]; pc -= Bx } */ + +OP_SETLIST,/* A B C k R[A][C+i] := R[A+i], 1 <= i <= B */ + +OP_CLOSURE,/* A Bx R[A] := closure(KPROTO[Bx]) */ + +OP_VARARG,/* A C R[A], R[A+1], ..., R[A+C-2] = vararg */ + +OP_VARARGPREP,/*A (adjust vararg parameters) */ + +OP_EXTRAARG/* Ax extra (larger) argument for previous opcode */ +} OpCode; + + +#define NUM_OPCODES ((int)(OP_EXTRAARG) + 1) + + + +/*=========================================================================== + Notes: + (*) In OP_CALL, if (B == 0) then B = top - A. If (C == 0), then + 'top' is set to last_result+1, so next open instruction (OP_CALL, + OP_RETURN*, OP_SETLIST) may use 'top'. + + (*) In OP_VARARG, if (C == 0) then use actual number of varargs and + set top (like in OP_CALL with C == 0). + + (*) In OP_RETURN, if (B == 0) then return up to 'top'. + + (*) In OP_LOADKX and OP_NEWTABLE, the next instruction is always + OP_EXTRAARG. + + (*) In OP_SETLIST, if (B == 0) then real B = 'top'; if k, then + real C = EXTRAARG _ C (the bits of EXTRAARG concatenated with the + bits of C). + + (*) In OP_NEWTABLE, B is log2 of the hash size (which is always a + power of 2) plus 1, or zero for size zero. If not k, the array size + is C. Otherwise, the array size is EXTRAARG _ C. + + (*) For comparisons, k specifies what condition the test should accept + (true or false). + + (*) In OP_MMBINI/OP_MMBINK, k means the arguments were flipped + (the constant is the first operand). + + (*) All 'skips' (pc++) assume that next instruction is a jump. + + (*) In instructions OP_RETURN/OP_TAILCALL, 'k' specifies that the + function builds upvalues, which may need to be closed. C > 0 means + the function is vararg, so that its 'func' must be corrected before + returning; in this case, (C - 1) is its number of fixed parameters. + + (*) In comparisons with an immediate operand, C signals whether the + original operand was a float. (It must be corrected in case of + metamethods.) + +===========================================================================*/ + + +/* +** masks for instruction properties. The format is: +** bits 0-2: op mode +** bit 3: instruction set register A +** bit 4: operator is a test (next instruction must be a jump) +** bit 5: instruction uses 'L->top' set by previous instruction (when B == 0) +** bit 6: instruction sets 'L->top' for next instruction (when C == 0) +** bit 7: instruction is an MM instruction (call a metamethod) +*/ + +LUAI_DDEC(const lu_byte luaP_opmodes[NUM_OPCODES];) + +#define getOpMode(m) (cast(enum OpMode, luaP_opmodes[m] & 7)) +#define testAMode(m) (luaP_opmodes[m] & (1 << 3)) +#define testTMode(m) (luaP_opmodes[m] & (1 << 4)) +#define testITMode(m) (luaP_opmodes[m] & (1 << 5)) +#define testOTMode(m) (luaP_opmodes[m] & (1 << 6)) +#define testMMMode(m) (luaP_opmodes[m] & (1 << 7)) + +/* "out top" (set top for next instruction) */ +#define isOT(i) \ + ((testOTMode(GET_OPCODE(i)) && GETARG_C(i) == 0) || \ + GET_OPCODE(i) == OP_TAILCALL) + +/* "in top" (uses top from previous instruction) */ +#define isIT(i) (testITMode(GET_OPCODE(i)) && GETARG_B(i) == 0) + +#define opmode(mm,ot,it,t,a,m) \ + (((mm) << 7) | ((ot) << 6) | ((it) << 5) | ((t) << 4) | ((a) << 3) | (m)) + + +/* number of list items to accumulate before a SETLIST instruction */ +#define LFIELDS_PER_FLUSH 50 + +#endif diff --git a/lua-5.4.3/src/lopnames.h b/lua-5.4.3/src/lopnames.h new file mode 100644 index 0000000..965cec9 --- /dev/null +++ b/lua-5.4.3/src/lopnames.h @@ -0,0 +1,103 @@ +/* +** $Id: lopnames.h $ +** Opcode names +** See Copyright Notice in lua.h +*/ + +#if !defined(lopnames_h) +#define lopnames_h + +#include + + +/* ORDER OP */ + +static const char *const opnames[] = { + "MOVE", + "LOADI", + "LOADF", + "LOADK", + "LOADKX", + "LOADFALSE", + "LFALSESKIP", + "LOADTRUE", + "LOADNIL", + "GETUPVAL", + "SETUPVAL", + "GETTABUP", + "GETTABLE", + "GETI", + "GETFIELD", + "SETTABUP", + "SETTABLE", + "SETI", + "SETFIELD", + "NEWTABLE", + "SELF", + "ADDI", + "ADDK", + "SUBK", + "MULK", + "MODK", + "POWK", + "DIVK", + "IDIVK", + "BANDK", + "BORK", + "BXORK", + "SHRI", + "SHLI", + "ADD", + "SUB", + "MUL", + "MOD", + "POW", + "DIV", + "IDIV", + "BAND", + "BOR", + "BXOR", + "SHL", + "SHR", + "MMBIN", + "MMBINI", + "MMBINK", + "UNM", + "BNOT", + "NOT", + "LEN", + "CONCAT", + "CLOSE", + "TBC", + "JMP", + "EQ", + "LT", + "LE", + "EQK", + "EQI", + "LTI", + "LEI", + "GTI", + "GEI", + "TEST", + "TESTSET", + "CALL", + "TAILCALL", + "RETURN", + "RETURN0", + "RETURN1", + "FORLOOP", + "FORPREP", + "TFORPREP", + "TFORCALL", + "TFORLOOP", + "SETLIST", + "CLOSURE", + "VARARG", + "VARARGPREP", + "EXTRAARG", + NULL +}; + +#endif + diff --git a/lua-5.4.3/src/loslib.c b/lua-5.4.3/src/loslib.c new file mode 100644 index 0000000..3e20d62 --- /dev/null +++ b/lua-5.4.3/src/loslib.c @@ -0,0 +1,430 @@ +/* +** $Id: loslib.c $ +** Standard Operating System library +** See Copyright Notice in lua.h +*/ + +#define loslib_c +#define LUA_LIB + +#include "lprefix.h" + + +#include +#include +#include +#include +#include + +#include "lua.h" + +#include "lauxlib.h" +#include "lualib.h" + + +/* +** {================================================================== +** List of valid conversion specifiers for the 'strftime' function; +** options are grouped by length; group of length 2 start with '||'. +** =================================================================== +*/ +#if !defined(LUA_STRFTIMEOPTIONS) /* { */ + +/* options for ANSI C 89 (only 1-char options) */ +#define L_STRFTIMEC89 "aAbBcdHIjmMpSUwWxXyYZ%" + +/* options for ISO C 99 and POSIX */ +#define L_STRFTIMEC99 "aAbBcCdDeFgGhHIjmMnprRStTuUVwWxXyYzZ%" \ + "||" "EcECExEXEyEY" "OdOeOHOIOmOMOSOuOUOVOwOWOy" /* two-char options */ + +/* options for Windows */ +#define L_STRFTIMEWIN "aAbBcdHIjmMpSUwWxXyYzZ%" \ + "||" "#c#x#d#H#I#j#m#M#S#U#w#W#y#Y" /* two-char options */ + +#if defined(LUA_USE_WINDOWS) +#define LUA_STRFTIMEOPTIONS L_STRFTIMEWIN +#elif defined(LUA_USE_C89) +#define LUA_STRFTIMEOPTIONS L_STRFTIMEC89 +#else /* C99 specification */ +#define LUA_STRFTIMEOPTIONS L_STRFTIMEC99 +#endif + +#endif /* } */ +/* }================================================================== */ + + +/* +** {================================================================== +** Configuration for time-related stuff +** =================================================================== +*/ + +/* +** type to represent time_t in Lua +*/ +#if !defined(LUA_NUMTIME) /* { */ + +#define l_timet lua_Integer +#define l_pushtime(L,t) lua_pushinteger(L,(lua_Integer)(t)) +#define l_gettime(L,arg) luaL_checkinteger(L, arg) + +#else /* }{ */ + +#define l_timet lua_Number +#define l_pushtime(L,t) lua_pushnumber(L,(lua_Number)(t)) +#define l_gettime(L,arg) luaL_checknumber(L, arg) + +#endif /* } */ + + +#if !defined(l_gmtime) /* { */ +/* +** By default, Lua uses gmtime/localtime, except when POSIX is available, +** where it uses gmtime_r/localtime_r +*/ + +#if defined(LUA_USE_POSIX) /* { */ + +#define l_gmtime(t,r) gmtime_r(t,r) +#define l_localtime(t,r) localtime_r(t,r) + +#else /* }{ */ + +/* ISO C definitions */ +#define l_gmtime(t,r) ((void)(r)->tm_sec, gmtime(t)) +#define l_localtime(t,r) ((void)(r)->tm_sec, localtime(t)) + +#endif /* } */ + +#endif /* } */ + +/* }================================================================== */ + + +/* +** {================================================================== +** Configuration for 'tmpnam': +** By default, Lua uses tmpnam except when POSIX is available, where +** it uses mkstemp. +** =================================================================== +*/ +#if !defined(lua_tmpnam) /* { */ + +#if defined(LUA_USE_POSIX) /* { */ + +#include + +#define LUA_TMPNAMBUFSIZE 32 + +#if !defined(LUA_TMPNAMTEMPLATE) +#define LUA_TMPNAMTEMPLATE "/tmp/lua_XXXXXX" +#endif + +#define lua_tmpnam(b,e) { \ + strcpy(b, LUA_TMPNAMTEMPLATE); \ + e = mkstemp(b); \ + if (e != -1) close(e); \ + e = (e == -1); } + +#else /* }{ */ + +/* ISO C definitions */ +#define LUA_TMPNAMBUFSIZE L_tmpnam +#define lua_tmpnam(b,e) { e = (tmpnam(b) == NULL); } + +#endif /* } */ + +#endif /* } */ +/* }================================================================== */ + + + +static int os_execute (lua_State *L) { + const char *cmd = luaL_optstring(L, 1, NULL); + int stat; + errno = 0; + 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 (l_unlikely(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=? } +** ======================================================= +*/ + +/* +** About the overflow check: an overflow cannot occur when time +** is represented by a lua_Integer, because either lua_Integer is +** large enough to represent all int fields or it is not large enough +** to represent a time that cause a field to overflow. However, if +** times are represented as doubles and lua_Integer is int, then the +** time 0x1.e1853b0d184f6p+55 would cause an overflow when adding 1900 +** to compute the year. +*/ +static void setfield (lua_State *L, const char *key, int value, int delta) { + #if (defined(LUA_NUMTIME) && LUA_MAXINTEGER <= INT_MAX) + if (l_unlikely(value > LUA_MAXINTEGER - delta)) + luaL_error(L, "field '%s' is out-of-bound", key); + #endif + lua_pushinteger(L, (lua_Integer)value + delta); + 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); +} + + +/* +** Set all fields from structure 'tm' in the table on top of the stack +*/ +static void setallfields (lua_State *L, struct tm *stm) { + setfield(L, "year", stm->tm_year, 1900); + setfield(L, "month", stm->tm_mon, 1); + setfield(L, "day", stm->tm_mday, 0); + setfield(L, "hour", stm->tm_hour, 0); + setfield(L, "min", stm->tm_min, 0); + setfield(L, "sec", stm->tm_sec, 0); + setfield(L, "yday", stm->tm_yday, 1); + setfield(L, "wday", stm->tm_wday, 1); + setboolfield(L, "isdst", stm->tm_isdst); +} + + +static int getboolfield (lua_State *L, const char *key) { + int res; + res = (lua_getfield(L, -1, key) == LUA_TNIL) ? -1 : lua_toboolean(L, -1); + lua_pop(L, 1); + return res; +} + + +static int getfield (lua_State *L, const char *key, int d, int delta) { + int isnum; + int t = lua_getfield(L, -1, key); /* get field and its type */ + lua_Integer res = lua_tointegerx(L, -1, &isnum); + if (!isnum) { /* field is not an integer? */ + if (l_unlikely(t != LUA_TNIL)) /* some other value? */ + return luaL_error(L, "field '%s' is not an integer", key); + else if (l_unlikely(d < 0)) /* absent field; no default? */ + return luaL_error(L, "field '%s' missing in date table", key); + res = d; + } + else { + /* unsigned avoids overflow when lua_Integer has 32 bits */ + if (!(res >= 0 ? (lua_Unsigned)res <= (lua_Unsigned)INT_MAX + delta + : (lua_Integer)INT_MIN + delta <= res)) + return luaL_error(L, "field '%s' is out-of-bound", key); + res -= delta; + } + lua_pop(L, 1); + return (int)res; +} + + +static const char *checkoption (lua_State *L, const char *conv, + ptrdiff_t convlen, char *buff) { + const char *option = LUA_STRFTIMEOPTIONS; + int oplen = 1; /* length of options being checked */ + for (; *option != '\0' && oplen <= convlen; option += oplen) { + if (*option == '|') /* next block? */ + oplen++; /* will check options with next length (+1) */ + else if (memcmp(conv, option, oplen) == 0) { /* match? */ + memcpy(buff, conv, oplen); /* copy valid option to buffer */ + buff[oplen] = '\0'; + return conv + oplen; /* return next item */ + } + } + luaL_argerror(L, 1, + lua_pushfstring(L, "invalid conversion specifier '%%%s'", conv)); + return conv; /* to avoid warnings */ +} + + +static time_t l_checktime (lua_State *L, int arg) { + l_timet t = l_gettime(L, arg); + luaL_argcheck(L, (time_t)t == t, arg, "time out-of-bounds"); + return (time_t)t; +} + + +/* maximum size for an individual 'strftime' item */ +#define SIZETIMEFMT 250 + + +static int os_date (lua_State *L) { + size_t slen; + const char *s = luaL_optlstring(L, 1, "%c", &slen); + time_t t = luaL_opt(L, l_checktime, 2, time(NULL)); + const char *se = s + slen; /* 's' end */ + 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? */ + return luaL_error(L, + "date result cannot be represented in this installation"); + if (strcmp(s, "*t") == 0) { + lua_createtable(L, 0, 9); /* 9 = number of fields */ + setallfields(L, stm); + } + else { + char cc[4]; /* buffer for individual conversion specifiers */ + luaL_Buffer b; + cc[0] = '%'; + luaL_buffinit(L, &b); + while (s < se) { + if (*s != '%') /* not a conversion specifier? */ + luaL_addchar(&b, *s++); + else { + size_t reslen; + char *buff = luaL_prepbuffsize(&b, SIZETIMEFMT); + s++; /* skip '%' */ + s = checkoption(L, s, se - s, cc + 1); /* copy specifier to 'cc' */ + reslen = strftime(buff, SIZETIMEFMT, cc, stm); + luaL_addsize(&b, 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_year = getfield(L, "year", -1, 1900); + ts.tm_mon = getfield(L, "month", -1, 1); + ts.tm_mday = getfield(L, "day", -1, 0); + ts.tm_hour = getfield(L, "hour", 12, 0); + ts.tm_min = getfield(L, "min", 0, 0); + ts.tm_sec = getfield(L, "sec", 0, 0); + ts.tm_isdst = getboolfield(L, "isdst"); + t = mktime(&ts); + setallfields(L, &ts); /* update fields with normalized values */ + } + if (t != (time_t)(l_timet)t || t == (time_t)(-1)) + return luaL_error(L, + "time result cannot be represented in this installation"); + l_pushtime(L, t); + return 1; +} + + +static int os_difftime (lua_State *L) { + time_t t1 = l_checktime(L, 1); + time_t t2 = l_checktime(L, 2); + lua_pushnumber(L, (lua_Number)difftime(t1, t2)); + 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 = (int)luaL_optinteger(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/lua-5.4.3/src/lparser.c b/lua-5.4.3/src/lparser.c new file mode 100644 index 0000000..284ef1f --- /dev/null +++ b/lua-5.4.3/src/lparser.c @@ -0,0 +1,1956 @@ +/* +** $Id: lparser.c $ +** Lua Parser +** See Copyright Notice in lua.h +*/ + +#define lparser_c +#define LUA_CORE + +#include "lprefix.h" + + +#include +#include + +#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) + + +/* because all strings are unified by the scanner, the parser + can use pointer equality for string equality */ +#define eqstr(a,b) ((a) == (b)) + + +/* +** nodes for block list (list of active blocks) +*/ +typedef struct BlockCnt { + struct BlockCnt *previous; /* chain */ + int firstlabel; /* index of first label in this block */ + int 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 */ + lu_byte insidetbc; /* true if inside the scope of a to-be-closed var. */ +} BlockCnt; + + + +/* +** prototypes for recursive non-terminal functions +*/ +static void statement (LexState *ls); +static void expr (LexState *ls, expdesc *v); + + +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); +} + + +/* +** Test whether next token is 'c'; if so, skip it. +*/ +static int testnext (LexState *ls, int c) { + if (ls->t.token == c) { + luaX_next(ls); + return 1; + } + else return 0; +} + + +/* +** Check that next token is 'c'. +*/ +static void check (LexState *ls, int c) { + if (ls->t.token != c) + error_expected(ls, c); +} + + +/* +** Check that next token is 'c' and skip it. +*/ +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); } + + +/* +** Check that next token is 'what' and skip it. In case of error, +** raise an error that the expected 'what' should match a 'who' +** in line 'where' (if that is not the current line). +*/ +static void check_match (LexState *ls, int what, int who, int where) { + if (l_unlikely(!testnext(ls, what))) { + if (where == ls->linenumber) /* all in the same line? */ + error_expected(ls, what); /* do not need a complex message */ + 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 (expdesc *e, TString *s) { + e->f = e->t = NO_JUMP; + e->k = VKSTR; + e->u.strval = s; +} + + +static void codename (LexState *ls, expdesc *e) { + codestring(e, str_checkname(ls)); +} + + +/* +** Register a new local variable in the active 'Proto' (for debug +** information). +*/ +static int registerlocalvar (LexState *ls, FuncState *fs, TString *varname) { + Proto *f = fs->f; + int oldsize = f->sizelocvars; + luaM_growvector(ls->L, f->locvars, fs->ndebugvars, f->sizelocvars, + LocVar, SHRT_MAX, "local variables"); + while (oldsize < f->sizelocvars) + f->locvars[oldsize++].varname = NULL; + f->locvars[fs->ndebugvars].varname = varname; + f->locvars[fs->ndebugvars].startpc = fs->pc; + luaC_objbarrier(ls->L, f, varname); + return fs->ndebugvars++; +} + + +/* +** Create a new local variable with the given 'name'. Return its index +** in the function. +*/ +static int new_localvar (LexState *ls, TString *name) { + lua_State *L = ls->L; + FuncState *fs = ls->fs; + Dyndata *dyd = ls->dyd; + Vardesc *var; + checklimit(fs, dyd->actvar.n + 1 - fs->firstlocal, + MAXVARS, "local variables"); + luaM_growvector(L, dyd->actvar.arr, dyd->actvar.n + 1, + dyd->actvar.size, Vardesc, USHRT_MAX, "local variables"); + var = &dyd->actvar.arr[dyd->actvar.n++]; + var->vd.kind = VDKREG; /* default */ + var->vd.name = name; + return dyd->actvar.n - 1 - fs->firstlocal; +} + +#define new_localvarliteral(ls,v) \ + new_localvar(ls, \ + luaX_newstring(ls, "" v, (sizeof(v)/sizeof(char)) - 1)); + + + +/* +** Return the "variable description" (Vardesc) of a given variable. +** (Unless noted otherwise, all variables are referred to by their +** compiler indices.) +*/ +static Vardesc *getlocalvardesc (FuncState *fs, int vidx) { + return &fs->ls->dyd->actvar.arr[fs->firstlocal + vidx]; +} + + +/* +** Convert 'nvar', a compiler index level, to its corresponding +** register. For that, search for the highest variable below that level +** that is in a register and uses its register index ('ridx') plus one. +*/ +static int reglevel (FuncState *fs, int nvar) { + while (nvar-- > 0) { + Vardesc *vd = getlocalvardesc(fs, nvar); /* get previous variable */ + if (vd->vd.kind != RDKCTC) /* is in a register? */ + return vd->vd.ridx + 1; + } + return 0; /* no variables in registers */ +} + + +/* +** Return the number of variables in the register stack for the given +** function. +*/ +int luaY_nvarstack (FuncState *fs) { + return reglevel(fs, fs->nactvar); +} + + +/* +** Get the debug-information entry for current variable 'vidx'. +*/ +static LocVar *localdebuginfo (FuncState *fs, int vidx) { + Vardesc *vd = getlocalvardesc(fs, vidx); + if (vd->vd.kind == RDKCTC) + return NULL; /* no debug info. for constants */ + else { + int idx = vd->vd.pidx; + lua_assert(idx < fs->ndebugvars); + return &fs->f->locvars[idx]; + } +} + + +/* +** Create an expression representing variable 'vidx' +*/ +static void init_var (FuncState *fs, expdesc *e, int vidx) { + e->f = e->t = NO_JUMP; + e->k = VLOCAL; + e->u.var.vidx = vidx; + e->u.var.ridx = getlocalvardesc(fs, vidx)->vd.ridx; +} + + +/* +** Raises an error if variable described by 'e' is read only +*/ +static void check_readonly (LexState *ls, expdesc *e) { + FuncState *fs = ls->fs; + TString *varname = NULL; /* to be set if variable is const */ + switch (e->k) { + case VCONST: { + varname = ls->dyd->actvar.arr[e->u.info].vd.name; + break; + } + case VLOCAL: { + Vardesc *vardesc = getlocalvardesc(fs, e->u.var.vidx); + if (vardesc->vd.kind != VDKREG) /* not a regular variable? */ + varname = vardesc->vd.name; + break; + } + case VUPVAL: { + Upvaldesc *up = &fs->f->upvalues[e->u.info]; + if (up->kind != VDKREG) + varname = up->name; + break; + } + default: + return; /* other cases cannot be read-only */ + } + if (varname) { + const char *msg = luaO_pushfstring(ls->L, + "attempt to assign to const variable '%s'", getstr(varname)); + luaK_semerror(ls, msg); /* error */ + } +} + + +/* +** Start the scope for the last 'nvars' created variables. +*/ +static void adjustlocalvars (LexState *ls, int nvars) { + FuncState *fs = ls->fs; + int reglevel = luaY_nvarstack(fs); + int i; + for (i = 0; i < nvars; i++) { + int vidx = fs->nactvar++; + Vardesc *var = getlocalvardesc(fs, vidx); + var->vd.ridx = reglevel++; + var->vd.pidx = registerlocalvar(ls, fs, var->vd.name); + } +} + + +/* +** Close the scope for all variables up to level 'tolevel'. +** (debug info.) +*/ +static void removevars (FuncState *fs, int tolevel) { + fs->ls->dyd->actvar.n -= (fs->nactvar - tolevel); + while (fs->nactvar > tolevel) { + LocVar *var = localdebuginfo(fs, --fs->nactvar); + if (var) /* does it have debug information? */ + var->endpc = fs->pc; + } +} + + +/* +** Search the upvalues of the function 'fs' for one +** with the given 'name'. +*/ +static int searchupvalue (FuncState *fs, TString *name) { + int i; + Upvaldesc *up = fs->f->upvalues; + for (i = 0; i < fs->nups; i++) { + if (eqstr(up[i].name, name)) return i; + } + return -1; /* not found */ +} + + +static Upvaldesc *allocupvalue (FuncState *fs) { + 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; + return &f->upvalues[fs->nups++]; +} + + +static int newupvalue (FuncState *fs, TString *name, expdesc *v) { + Upvaldesc *up = allocupvalue(fs); + FuncState *prev = fs->prev; + if (v->k == VLOCAL) { + up->instack = 1; + up->idx = v->u.var.ridx; + up->kind = getlocalvardesc(prev, v->u.var.vidx)->vd.kind; + lua_assert(eqstr(name, getlocalvardesc(prev, v->u.var.vidx)->vd.name)); + } + else { + up->instack = 0; + up->idx = cast_byte(v->u.info); + up->kind = prev->f->upvalues[v->u.info].kind; + lua_assert(eqstr(name, prev->f->upvalues[v->u.info].name)); + } + up->name = name; + luaC_objbarrier(fs->ls->L, fs->f, name); + return fs->nups - 1; +} + + +/* +** Look for an active local variable with the name 'n' in the +** function 'fs'. If found, initialize 'var' with it and return +** its expression kind; otherwise return -1. +*/ +static int searchvar (FuncState *fs, TString *n, expdesc *var) { + int i; + for (i = cast_int(fs->nactvar) - 1; i >= 0; i--) { + Vardesc *vd = getlocalvardesc(fs, i); + if (eqstr(n, vd->vd.name)) { /* found? */ + if (vd->vd.kind == RDKCTC) /* compile-time constant? */ + init_exp(var, VCONST, fs->firstlocal + i); + else /* real variable */ + init_var(fs, var, i); + return var->k; + } + } + 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; + fs->needclose = 1; +} + + +/* +** Find a variable with the given name 'n'. If it is an upvalue, add +** this upvalue into all intermediate functions. If it is a global, set +** 'var' as 'void' as a flag. +*/ +static void singlevaraux (FuncState *fs, TString *n, expdesc *var, int base) { + if (fs == NULL) /* no more levels? */ + init_exp(var, VVOID, 0); /* default is global */ + else { + int v = searchvar(fs, n, var); /* look up locals at current level */ + if (v >= 0) { /* found? */ + if (v == VLOCAL && !base) + markupval(fs, var->u.var.vidx); /* local will be used as an upval */ + } + else { /* not found as local at current level; try upvalues */ + int idx = searchupvalue(fs, n); /* try existing upvalues */ + if (idx < 0) { /* not found? */ + singlevaraux(fs->prev, n, var, 0); /* try upper levels */ + if (var->k == VLOCAL || var->k == VUPVAL) /* local or upvalue? */ + idx = newupvalue(fs, n, var); /* will be a new upvalue */ + else /* it is a global or a constant */ + return; /* don't need to do anything at this level */ + } + init_exp(var, VUPVAL, idx); /* new or old upvalue */ + } + } +} + + +/* +** Find a variable with the given name 'n', handling global variables +** too. +*/ +static void singlevar (LexState *ls, expdesc *var) { + TString *varname = str_checkname(ls); + FuncState *fs = ls->fs; + singlevaraux(fs, varname, var, 1); + if (var->k == VVOID) { /* global name? */ + expdesc key; + singlevaraux(fs, ls->envn, var, 1); /* get environment variable */ + lua_assert(var->k != VVOID); /* this one must exist */ + codestring(&key, varname); /* key is variable name */ + luaK_indexed(fs, var, &key); /* env[varname] */ + } +} + + +/* +** Adjust the number of results from an expression list 'e' with 'nexps' +** expressions to 'nvars' values. +*/ +static void adjust_assign (LexState *ls, int nvars, int nexps, expdesc *e) { + FuncState *fs = ls->fs; + int needed = nvars - nexps; /* extra values needed */ + if (hasmultret(e->k)) { /* last expression has multiple returns? */ + int extra = needed + 1; /* discount last expression itself */ + if (extra < 0) + extra = 0; + luaK_setreturns(fs, e, extra); /* last exp. provides the difference */ + } + else { + if (e->k != VVOID) /* at least one expression? */ + luaK_exp2nextreg(fs, e); /* close last expression */ + if (needed > 0) /* missing values? */ + luaK_nil(fs, fs->freereg, needed); /* complete with nils */ + } + if (needed > 0) + luaK_reserveregs(fs, needed); /* registers for extra values */ + else /* adding 'needed' is actually a subtraction */ + fs->freereg += needed; /* remove extra values */ +} + + +#define enterlevel(ls) luaE_incCstack(ls->L) + + +#define leavelevel(ls) ((ls)->L->nCcalls--) + + +/* +** Generates an error that a goto jumps into the scope of some +** local variable. +*/ +static l_noret jumpscopeerror (LexState *ls, Labeldesc *gt) { + const char *varname = getstr(getlocalvardesc(ls->fs, gt->nactvar)->vd.name); + const char *msg = " at line %d jumps into the scope of local '%s'"; + msg = luaO_pushfstring(ls->L, msg, getstr(gt->name), gt->line, varname); + luaK_semerror(ls, msg); /* raise the error */ +} + + +/* +** Solves the goto at index 'g' to given 'label' and removes it +** from the list of pending goto's. +** If it jumps into the scope of some variable, raises an error. +*/ +static void solvegoto (LexState *ls, int g, Labeldesc *label) { + int i; + Labellist *gl = &ls->dyd->gt; /* list of goto's */ + Labeldesc *gt = &gl->arr[g]; /* goto to be resolved */ + lua_assert(eqstr(gt->name, label->name)); + if (l_unlikely(gt->nactvar < label->nactvar)) /* enter some scope? */ + jumpscopeerror(ls, gt); + luaK_patchlist(ls->fs, gt->pc, label->pc); + for (i = g; i < gl->n - 1; i++) /* remove goto from pending list */ + gl->arr[i] = gl->arr[i + 1]; + gl->n--; +} + + +/* +** Search for an active label with the given name. +*/ +static Labeldesc *findlabel (LexState *ls, TString *name) { + int i; + Dyndata *dyd = ls->dyd; + /* check labels in current function for a match */ + for (i = ls->fs->firstlabel; i < dyd->label.n; i++) { + Labeldesc *lb = &dyd->label.arr[i]; + if (eqstr(lb->name, name)) /* correct label? */ + return lb; + } + return NULL; /* label not found */ +} + + +/* +** Adds a new label/goto in the corresponding list. +*/ +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].close = 0; + l->arr[n].pc = pc; + l->n = n + 1; + return n; +} + + +static int newgotoentry (LexState *ls, TString *name, int line, int pc) { + return newlabelentry(ls, &ls->dyd->gt, name, line, pc); +} + + +/* +** Solves forward jumps. Check whether new label 'lb' matches any +** pending gotos in current block and solves them. Return true +** if any of the goto's need to close upvalues. +*/ +static int solvegotos (LexState *ls, Labeldesc *lb) { + Labellist *gl = &ls->dyd->gt; + int i = ls->fs->bl->firstgoto; + int needsclose = 0; + while (i < gl->n) { + if (eqstr(gl->arr[i].name, lb->name)) { + needsclose |= gl->arr[i].close; + solvegoto(ls, i, lb); /* will remove 'i' from the list */ + } + else + i++; + } + return needsclose; +} + + +/* +** Create a new label with the given 'name' at the given 'line'. +** 'last' tells whether label is the last non-op statement in its +** block. Solves all pending goto's to this new label and adds +** a close instruction if necessary. +** Returns true iff it added a close instruction. +*/ +static int createlabel (LexState *ls, TString *name, int line, + int last) { + FuncState *fs = ls->fs; + Labellist *ll = &ls->dyd->label; + int l = newlabelentry(ls, ll, name, line, luaK_getlabel(fs)); + if (last) { /* label is last no-op statement in the block? */ + /* assume that locals are already out of scope */ + ll->arr[l].nactvar = fs->bl->nactvar; + } + if (solvegotos(ls, &ll->arr[l])) { /* need close? */ + luaK_codeABC(fs, OP_CLOSE, luaY_nvarstack(fs), 0, 0); + return 1; + } + return 0; +} + + +/* +** Adjust pending gotos to outer level of a block. +*/ +static void movegotosout (FuncState *fs, BlockCnt *bl) { + int i; + Labellist *gl = &fs->ls->dyd->gt; + /* correct pending gotos to current block */ + for (i = bl->firstgoto; i < gl->n; i++) { /* for each pending goto */ + Labeldesc *gt = &gl->arr[i]; + /* leaving a variable scope? */ + if (reglevel(fs, gt->nactvar) > reglevel(fs, bl->nactvar)) + gt->close |= bl->upval; /* jump may need a close */ + gt->nactvar = bl->nactvar; /* update goto level */ + } +} + + +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->insidetbc = (fs->bl != NULL && fs->bl->insidetbc); + bl->previous = fs->bl; + fs->bl = bl; + lua_assert(fs->freereg == luaY_nvarstack(fs)); +} + + +/* +** generates an error for an undefined 'goto'. +*/ +static l_noret undefgoto (LexState *ls, Labeldesc *gt) { + const char *msg; + if (eqstr(gt->name, luaS_newliteral(ls->L, "break"))) { + msg = "break outside loop at line %d"; + msg = luaO_pushfstring(ls->L, msg, gt->line); + } + else { + msg = "no visible label '%s' for at line %d"; + msg = luaO_pushfstring(ls->L, msg, getstr(gt->name), gt->line); + } + luaK_semerror(ls, msg); +} + + +static void leaveblock (FuncState *fs) { + BlockCnt *bl = fs->bl; + LexState *ls = fs->ls; + int hasclose = 0; + int stklevel = reglevel(fs, bl->nactvar); /* level outside the block */ + if (bl->isloop) /* fix pending breaks? */ + hasclose = createlabel(ls, luaS_newliteral(ls->L, "break"), 0, 0); + if (!hasclose && bl->previous && bl->upval) + luaK_codeABC(fs, OP_CLOSE, stklevel, 0, 0); + fs->bl = bl->previous; + removevars(fs, bl->nactvar); + lua_assert(bl->nactvar == fs->nactvar); + fs->freereg = stklevel; /* 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 uses 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, VRELOC, 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) { + Proto *f = fs->f; + fs->prev = ls->fs; /* linked list of funcstates */ + fs->ls = ls; + ls->fs = fs; + fs->pc = 0; + fs->previousline = f->linedefined; + fs->iwthabs = 0; + fs->lasttarget = 0; + fs->freereg = 0; + fs->nk = 0; + fs->nabslineinfo = 0; + fs->np = 0; + fs->nups = 0; + fs->ndebugvars = 0; + fs->nactvar = 0; + fs->needclose = 0; + fs->firstlocal = ls->dyd->actvar.n; + fs->firstlabel = ls->dyd->label.n; + fs->bl = NULL; + f->source = ls->source; + luaC_objbarrier(ls->L, f, f->source); + f->maxstacksize = 2; /* registers 0/1 are always valid */ + 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, luaY_nvarstack(fs), 0); /* final return */ + leaveblock(fs); + lua_assert(fs->bl == NULL); + luaK_finish(fs); + luaM_shrinkvector(L, f->code, f->sizecode, fs->pc, Instruction); + luaM_shrinkvector(L, f->lineinfo, f->sizelineinfo, fs->pc, ls_byte); + luaM_shrinkvector(L, f->abslineinfo, f->sizeabslineinfo, + fs->nabslineinfo, AbsLineInfo); + luaM_shrinkvector(L, f->k, f->sizek, fs->nk, TValue); + luaM_shrinkvector(L, f->p, f->sizep, fs->np, Proto *); + luaM_shrinkvector(L, f->locvars, f->sizelocvars, fs->ndebugvars, LocVar); + luaM_shrinkvector(L, f->upvalues, f->sizeupvalues, fs->nups, Upvaldesc); + ls->fs = fs->prev; + 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 is 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 */ + codename(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 +** ======================================================================= +*/ + + +typedef struct ConsControl { + expdesc v; /* last list item read */ + expdesc *t; /* table descriptor */ + int nh; /* total number of 'record' elements */ + int na; /* number of array elements already stored */ + int tostore; /* number of array elements pending to be stored */ +} ConsControl; + + +static void recfield (LexState *ls, ConsControl *cc) { + /* recfield -> (NAME | '['exp']') = exp */ + FuncState *fs = ls->fs; + int reg = ls->fs->freereg; + expdesc tab, key, val; + if (ls->t.token == TK_NAME) { + checklimit(fs, cc->nh, MAX_INT, "items in a constructor"); + codename(ls, &key); + } + else /* ls->t.token == '[' */ + yindex(ls, &key); + cc->nh++; + checknext(ls, '='); + tab = *cc->t; + luaK_indexed(fs, &tab, &key); + expr(ls, &val); + luaK_storevar(fs, &tab, &val); + fs->freereg = reg; /* free registers */ +} + + +static void closelistfield (FuncState *fs, 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->na += cc->tostore; + cc->tostore = 0; /* no more items pending */ + } +} + + +static void lastlistfield (FuncState *fs, 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); + } + cc->na += cc->tostore; +} + + +static void listfield (LexState *ls, ConsControl *cc) { + /* listfield -> exp */ + expr(ls, &cc->v); + cc->tostore++; +} + + +static void field (LexState *ls, 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); + ConsControl cc; + luaK_code(fs, 0); /* space for extra arg. */ + cc.na = cc.nh = cc.tostore = 0; + cc.t = t; + init_exp(t, VNONRELOC, fs->freereg); /* table will be at stack top */ + luaK_reserveregs(fs, 1); + init_exp(&cc.v, VVOID, 0); /* no value (yet) */ + 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); + luaK_settablesize(fs, pc, t->u.info, cc.na, cc.nh); +} + +/* }====================================================================== */ + + +static void setvararg (FuncState *fs, int nparams) { + fs->f->is_vararg = 1; + luaK_codeABC(fs, OP_VARARGPREP, nparams, 0, 0); +} + + +static void parlist (LexState *ls) { + /* parlist -> [ {NAME ','} (NAME | '...') ] */ + FuncState *fs = ls->fs; + Proto *f = fs->f; + int nparams = 0; + int isvararg = 0; + if (ls->t.token != ')') { /* is 'parlist' not empty? */ + do { + switch (ls->t.token) { + case TK_NAME: { + new_localvar(ls, str_checkname(ls)); + nparams++; + break; + } + case TK_DOTS: { + luaX_next(ls); + isvararg = 1; + break; + } + default: luaX_syntaxerror(ls, " or '...' expected"); + } + } while (!isvararg && testnext(ls, ',')); + } + adjustlocalvars(ls, nparams); + f->numparams = cast_byte(fs->nactvar); + if (isvararg) + setvararg(fs, f->numparams); /* declared vararg */ + luaK_reserveregs(fs, fs->nactvar); /* reserve registers 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); + if (hasmultret(args.k)) + luaK_setmultret(fs, &args); + } + check_match(ls, ')', '(', line); + break; + } + case '{': { /* funcargs -> constructor */ + constructor(ls, &args); + break; + } + case TK_STRING: { /* funcargs -> STRING */ + codestring(&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 '[': { /* '[' exp ']' */ + expdesc key; + luaK_exp2anyregup(fs, v); + yindex(ls, &key); + luaK_indexed(fs, v, &key); + break; + } + case ':': { /* ':' NAME funcargs */ + expdesc key; + luaX_next(ls); + codename(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 -> FLT | INT | STRING | NIL | TRUE | FALSE | ... | + constructor | FUNCTION body | suffixedexp */ + switch (ls->t.token) { + case TK_FLT: { + init_exp(v, VKFLT, 0); + v->u.nval = ls->t.seminfo.r; + break; + } + case TK_INT: { + init_exp(v, VKINT, 0); + v->u.ival = ls->t.seminfo.i; + break; + } + case TK_STRING: { + codestring(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 '...' outside a vararg function"); + init_exp(v, VVARARG, luaK_codeABC(fs, OP_VARARG, 0, 0, 1)); + 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_BNOT; + 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_MOD; + case '^': return OPR_POW; + case '/': return OPR_DIV; + case TK_IDIV: return OPR_IDIV; + case '&': return OPR_BAND; + case '|': return OPR_BOR; + case '~': return OPR_BXOR; + case TK_SHL: return OPR_SHL; + case TK_SHR: return OPR_SHR; + 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; + } +} + + +/* +** Priority table for binary operators. +*/ +static const struct { + lu_byte left; /* left priority for each binary operator */ + lu_byte right; /* right priority */ +} priority[] = { /* ORDER OPR */ + {10, 10}, {10, 10}, /* '+' '-' */ + {11, 11}, {11, 11}, /* '*' '%' */ + {14, 13}, /* '^' (right associative) */ + {11, 11}, {11, 11}, /* '/' '//' */ + {6, 6}, {4, 4}, {5, 5}, /* '&' '|' '~' */ + {7, 7}, {7, 7}, /* '<<' '>>' */ + {9, 8}, /* '..' (right associative) */ + {3, 3}, {3, 3}, {3, 3}, /* ==, <, <= */ + {3, 3}, {3, 3}, {3, 3}, /* ~=, >, >= */ + {2, 2}, {1, 1} /* and, or */ +}; + +#define UNARY_PRIORITY 12 /* 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) { /* prefix (unary) operator? */ + int line = ls->linenumber; + luaX_next(ls); /* skip operator */ + 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); /* skip operator */ + 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 (vkisindexed(lh->v.k)) { /* assignment to table field? */ + if (lh->v.k == VINDEXUP) { /* is table an upvalue? */ + if (v->k == VUPVAL && lh->v.u.ind.t == v->u.info) { + conflict = 1; /* table is the upvalue being assigned now */ + lh->v.k = VINDEXSTR; + lh->v.u.ind.t = extra; /* assignment will use safe copy */ + } + } + else { /* table is a register */ + if (v->k == VLOCAL && lh->v.u.ind.t == v->u.var.ridx) { + conflict = 1; /* table is the local being assigned now */ + lh->v.u.ind.t = extra; /* assignment will use safe copy */ + } + /* is index the local being assigned? */ + if (lh->v.k == VINDEXED && v->k == VLOCAL && + lh->v.u.ind.idx == v->u.var.ridx) { + 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') */ + if (v->k == VLOCAL) + luaK_codeABC(fs, OP_MOVE, extra, v->u.var.ridx, 0); + else + luaK_codeABC(fs, OP_GETUPVAL, extra, v->u.info, 0); + luaK_reserveregs(fs, 1); + } +} + +/* +** Parse and compile a multiple assignment. The first "variable" +** (a 'suffixedexp') was already read by the caller. +** +** assignment -> suffixedexp restassign +** restassign -> ',' suffixedexp restassign | '=' explist +*/ +static void restassign (LexState *ls, struct LHS_assign *lh, int nvars) { + expdesc e; + check_condition(ls, vkisvar(lh->v.k), "syntax error"); + check_readonly(ls, &lh->v); + if (testnext(ls, ',')) { /* restassign -> ',' suffixedexp restassign */ + struct LHS_assign nv; + nv.prev = lh; + suffixedexp(ls, &nv.v); + if (!vkisindexed(nv.v.k)) + check_conflict(ls, lh, &nv.v); + enterlevel(ls); /* control recursion depth */ + restassign(ls, &nv, nvars+1); + leavelevel(ls); + } + else { /* restassign -> '=' explist */ + int nexps; + checknext(ls, '='); + nexps = explist(ls, &e); + if (nexps != nvars) + adjust_assign(ls, nvars, nexps, &e); + 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) { + FuncState *fs = ls->fs; + int line = ls->linenumber; + TString *name = str_checkname(ls); /* label's name */ + Labeldesc *lb = findlabel(ls, name); + if (lb == NULL) /* no label? */ + /* forward jump; will be resolved when the label is declared */ + newgotoentry(ls, name, line, luaK_jump(fs)); + else { /* found a label */ + /* backward jump; will be resolved here */ + int lblevel = reglevel(fs, lb->nactvar); /* label level */ + if (luaY_nvarstack(fs) > lblevel) /* leaving the scope of a variable? */ + luaK_codeABC(fs, OP_CLOSE, lblevel, 0, 0); + /* create jump and link it to the label */ + luaK_patchlist(fs, luaK_jump(fs), lb->pc); + } +} + + +/* +** Break statement. Semantically equivalent to "goto break". +*/ +static void breakstat (LexState *ls) { + int line = ls->linenumber; + luaX_next(ls); /* skip break */ + newgotoentry(ls, luaS_newliteral(ls->L, "break"), line, luaK_jump(ls->fs)); +} + + +/* +** Check whether there is already a label with the given 'name'. +*/ +static void checkrepeated (LexState *ls, TString *name) { + Labeldesc *lb = findlabel(ls, name); + if (l_unlikely(lb != NULL)) { /* already defined? */ + const char *msg = "label '%s' already defined on line %d"; + msg = luaO_pushfstring(ls->L, msg, getstr(name), lb->line); + luaK_semerror(ls, msg); /* error */ + } +} + + +static void labelstat (LexState *ls, TString *name, int line) { + /* label -> '::' NAME '::' */ + checknext(ls, TK_DBCOLON); /* skip double colon */ + while (ls->t.token == ';' || ls->t.token == TK_DBCOLON) + statement(ls); /* skip other no-op statements */ + checkrepeated(ls, name); /* check for repeated labels */ + createlabel(ls, name, line, block_follow(ls, 0)); +} + + +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) */ + leaveblock(fs); /* finish scope */ + if (bl2.upval) { /* upvalues? */ + int exit = luaK_jump(fs); /* normal exit must jump over fix */ + luaK_patchtohere(fs, condexit); /* repetition must close upvalues */ + luaK_codeABC(fs, OP_CLOSE, reglevel(fs, bl2.nactvar), 0, 0); + condexit = luaK_jump(fs); /* repeat after closing upvalues */ + luaK_patchtohere(fs, exit); /* normal exit comes to here */ + } + luaK_patchlist(fs, condexit, repeat_init); /* close the loop */ + leaveblock(fs); /* finish loop */ +} + + +/* +** Read an expression and generate code to put its results in next +** stack slot. +** +*/ +static void exp1 (LexState *ls) { + expdesc e; + expr(ls, &e); + luaK_exp2nextreg(ls->fs, &e); + lua_assert(e.k == VNONRELOC); +} + + +/* +** Fix for instruction at position 'pc' to jump to 'dest'. +** (Jump addresses are relative in Lua). 'back' true means +** a back jump. +*/ +static void fixforjump (FuncState *fs, int pc, int dest, int back) { + Instruction *jmp = &fs->f->code[pc]; + int offset = dest - (pc + 1); + if (back) + offset = -offset; + if (l_unlikely(offset > MAXARG_Bx)) + luaX_syntaxerror(fs->ls, "control structure too long"); + SETARG_Bx(*jmp, offset); +} + + +/* +** Generate code for a 'for' loop. +*/ +static void forbody (LexState *ls, int base, int line, int nvars, int isgen) { + /* forbody -> DO block */ + static const OpCode forprep[2] = {OP_FORPREP, OP_TFORPREP}; + static const OpCode forloop[2] = {OP_FORLOOP, OP_TFORLOOP}; + BlockCnt bl; + FuncState *fs = ls->fs; + int prep, endfor; + checknext(ls, TK_DO); + prep = luaK_codeABx(fs, forprep[isgen], base, 0); + 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 */ + fixforjump(fs, prep, luaK_getlabel(fs), 0); + if (isgen) { /* generic for? */ + luaK_codeABC(fs, OP_TFORCALL, base, 0, nvars); + luaK_fixline(fs, line); + } + endfor = luaK_codeABx(fs, forloop[isgen], base, 0); + fixforjump(fs, endfor, prep + 1, 1); + luaK_fixline(fs, line); +} + + +static void fornum (LexState *ls, TString *varname, int line) { + /* fornum -> NAME = exp,exp[,exp] forbody */ + FuncState *fs = ls->fs; + int base = fs->freereg; + new_localvarliteral(ls, "(for state)"); + new_localvarliteral(ls, "(for state)"); + new_localvarliteral(ls, "(for state)"); + 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_int(fs, fs->freereg, 1); + luaK_reserveregs(fs, 1); + } + adjustlocalvars(ls, 3); /* control variables */ + forbody(ls, base, line, 1, 0); +} + + +static void forlist (LexState *ls, TString *indexname) { + /* forlist -> NAME {,NAME} IN explist forbody */ + FuncState *fs = ls->fs; + expdesc e; + int nvars = 5; /* gen, state, control, toclose, 'indexname' */ + int line; + int base = fs->freereg; + /* create control variables */ + new_localvarliteral(ls, "(for state)"); + new_localvarliteral(ls, "(for state)"); + new_localvarliteral(ls, "(for state)"); + new_localvarliteral(ls, "(for state)"); + /* 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, 4, explist(ls, &e), &e); + adjustlocalvars(ls, 4); /* control variables */ + markupval(fs, fs->nactvar); /* last control var. must be closed */ + luaK_checkstack(fs, 3); /* extra space to call generator */ + forbody(ls, base, line, nvars - 4, 1); +} + + +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, "'=' or '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_BREAK) { /* 'if x then break' ? */ + int line = ls->linenumber; + luaK_goiffalse(ls->fs, &v); /* will jump if condition is true */ + luaX_next(ls); /* skip 'break' */ + enterblock(fs, &bl, 0); /* must enter block before 'goto' */ + newgotoentry(ls, luaS_newliteral(ls->L, "break"), line, v.t); + while (testnext(ls, ';')) {} /* skip semicolons */ + if (block_follow(ls, 0)) { /* jump 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 a 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; + int fvar = fs->nactvar; /* function's variable index */ + 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! */ + localdebuginfo(fs, fvar)->startpc = fs->pc; +} + + +static int getlocalattribute (LexState *ls) { + /* ATTRIB -> ['<' Name '>'] */ + if (testnext(ls, '<')) { + const char *attr = getstr(str_checkname(ls)); + checknext(ls, '>'); + if (strcmp(attr, "const") == 0) + return RDKCONST; /* read-only variable */ + else if (strcmp(attr, "close") == 0) + return RDKTOCLOSE; /* to-be-closed variable */ + else + luaK_semerror(ls, + luaO_pushfstring(ls->L, "unknown attribute '%s'", attr)); + } + return VDKREG; /* regular variable */ +} + + +static void checktoclose (LexState *ls, int level) { + if (level != -1) { /* is there a to-be-closed variable? */ + FuncState *fs = ls->fs; + markupval(fs, level + 1); + fs->bl->insidetbc = 1; /* in the scope of a to-be-closed variable */ + luaK_codeABC(fs, OP_TBC, reglevel(fs, level), 0, 0); + } +} + + +static void localstat (LexState *ls) { + /* stat -> LOCAL NAME ATTRIB { ',' NAME ATTRIB } ['=' explist] */ + FuncState *fs = ls->fs; + int toclose = -1; /* index of to-be-closed variable (if any) */ + Vardesc *var; /* last variable */ + int vidx, kind; /* index and kind of last variable */ + int nvars = 0; + int nexps; + expdesc e; + do { + vidx = new_localvar(ls, str_checkname(ls)); + kind = getlocalattribute(ls); + getlocalvardesc(fs, vidx)->vd.kind = kind; + if (kind == RDKTOCLOSE) { /* to-be-closed? */ + if (toclose != -1) /* one already present? */ + luaK_semerror(ls, "multiple to-be-closed variables in local list"); + toclose = fs->nactvar + nvars; + } + nvars++; + } while (testnext(ls, ',')); + if (testnext(ls, '=')) + nexps = explist(ls, &e); + else { + e.k = VVOID; + nexps = 0; + } + var = getlocalvardesc(fs, vidx); /* get last variable */ + if (nvars == nexps && /* no adjustments? */ + var->vd.kind == RDKCONST && /* last variable is const? */ + luaK_exp2const(fs, &e, &var->k)) { /* compile-time constant? */ + var->vd.kind = RDKCTC; /* variable is a compile-time constant */ + adjustlocalvars(ls, nvars - 1); /* exclude last variable */ + fs->nactvar++; /* but count it */ + } + else { + adjust_assign(ls, nvars, nexps, &e); + adjustlocalvars(ls, nvars); + } + checktoclose(ls, toclose); +} + + +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; + restassign(ls, &v, 1); + } + else { /* stat -> func */ + Instruction *inst; + check_condition(ls, v.v.k == VCALL, "syntax error"); + inst = &getinstruction(fs, &v.v); + SETARG_C(*inst, 1); /* call statement uses no results */ + } +} + + +static void retstat (LexState *ls) { + /* stat -> RETURN [explist] [';'] */ + FuncState *fs = ls->fs; + expdesc e; + int nret; /* number of values being returned */ + int first = luaY_nvarstack(fs); /* first slot to be returned */ + if (block_follow(ls, 1) || ls->t.token == ';') + 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 && !fs->bl->insidetbc) { /* tail call? */ + SET_OPCODE(getinstruction(fs,&e), OP_TAILCALL); + lua_assert(GETARG_A(getinstruction(fs,&e)) == luaY_nvarstack(fs)); + } + nret = LUA_MULTRET; /* return all values */ + } + else { + if (nret == 1) /* only one single value? */ + first = luaK_exp2anyreg(fs, &e); /* can use original slot */ + else { /* values must go to the top of the stack */ + luaK_exp2nextreg(fs, &e); + 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 */ + breakstat(ls); + break; + } + case TK_GOTO: { /* stat -> 'goto' NAME */ + luaX_next(ls); /* skip 'goto' */ + gotostat(ls); + break; + } + default: { /* stat -> func | assignment */ + exprstat(ls); + break; + } + } + lua_assert(ls->fs->f->maxstacksize >= ls->fs->freereg && + ls->fs->freereg >= luaY_nvarstack(ls->fs)); + ls->fs->freereg = luaY_nvarstack(ls->fs); /* 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; + Upvaldesc *env; + open_func(ls, fs, &bl); + setvararg(fs, 0); /* main function is always declared vararg */ + env = allocupvalue(fs); /* ...set environment upvalue */ + env->instack = 1; + env->idx = 0; + env->kind = VDKREG; + env->name = ls->envn; + luaC_objbarrier(ls->L, fs->f, env->name); + luaX_next(ls); /* read first token */ + statlist(ls); /* parse main body */ + check(ls, TK_EOS); + close_func(ls); +} + + +LClosure *luaY_parser (lua_State *L, ZIO *z, Mbuffer *buff, + Dyndata *dyd, const char *name, int firstchar) { + LexState lexstate; + FuncState funcstate; + LClosure *cl = luaF_newLclosure(L, 1); /* create main closure */ + setclLvalue2s(L, L->top, cl); /* anchor it (to avoid being collected) */ + luaD_inctop(L); + lexstate.h = luaH_new(L); /* create table for scanner */ + sethvalue2s(L, L->top, lexstate.h); /* anchor it */ + luaD_inctop(L); + funcstate.f = cl->p = luaF_newproto(L); + luaC_objbarrier(L, cl, cl->p); + funcstate.f->source = luaS_new(L, name); /* create and anchor TString */ + luaC_objbarrier(L, funcstate.f, funcstate.f->source); + 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); + L->top--; /* remove scanner's table */ + return cl; /* closure is on the stack, too */ +} + diff --git a/lua-5.4.3/src/lparser.h b/lua-5.4.3/src/lparser.h new file mode 100644 index 0000000..5e4500f --- /dev/null +++ b/lua-5.4.3/src/lparser.h @@ -0,0 +1,171 @@ +/* +** $Id: lparser.h $ +** Lua Parser +** See Copyright Notice in lua.h +*/ + +#ifndef lparser_h +#define lparser_h + +#include "llimits.h" +#include "lobject.h" +#include "lzio.h" + + +/* +** Expression and variable descriptor. +** Code generation for variables and expressions can be delayed to allow +** optimizations; An 'expdesc' structure describes a potentially-delayed +** variable/expression. It has a description of its "main" value plus a +** list of conditional jumps that can also produce its value (generated +** by short-circuit operators 'and'/'or'). +*/ + +/* kinds of variables/expressions */ +typedef enum { + VVOID, /* when 'expdesc' describes the last expression of a list, + this kind means an empty list (so, no expression) */ + VNIL, /* constant nil */ + VTRUE, /* constant true */ + VFALSE, /* constant false */ + VK, /* constant in 'k'; info = index of constant in 'k' */ + VKFLT, /* floating constant; nval = numerical float value */ + VKINT, /* integer constant; ival = numerical integer value */ + VKSTR, /* string constant; strval = TString address; + (string is fixed by the lexer) */ + VNONRELOC, /* expression has its value in a fixed register; + info = result register */ + VLOCAL, /* local variable; var.ridx = register index; + var.vidx = relative index in 'actvar.arr' */ + VUPVAL, /* upvalue variable; info = index of upvalue in 'upvalues' */ + VCONST, /* compile-time variable; + info = absolute index in 'actvar.arr' */ + VINDEXED, /* indexed variable; + ind.t = table register; + ind.idx = key's R index */ + VINDEXUP, /* indexed upvalue; + ind.t = table upvalue; + ind.idx = key's K index */ + VINDEXI, /* indexed variable with constant integer; + ind.t = table register; + ind.idx = key's value */ + VINDEXSTR, /* indexed variable with literal string; + ind.t = table register; + ind.idx = key's K index */ + VJMP, /* expression is a test/comparison; + info = pc of corresponding jump instruction */ + VRELOC, /* expression can put result in any register; + info = instruction pc */ + VCALL, /* expression is a function call; info = instruction pc */ + VVARARG /* vararg expression; info = instruction pc */ +} expkind; + + +#define vkisvar(k) (VLOCAL <= (k) && (k) <= VINDEXSTR) +#define vkisindexed(k) (VINDEXED <= (k) && (k) <= VINDEXSTR) + + +typedef struct expdesc { + expkind k; + union { + lua_Integer ival; /* for VKINT */ + lua_Number nval; /* for VKFLT */ + TString *strval; /* for VKSTR */ + int info; /* for generic use */ + struct { /* for indexed variables */ + short idx; /* index (R or "long" K) */ + lu_byte t; /* table (register or upvalue) */ + } ind; + struct { /* for local variables */ + lu_byte ridx; /* register holding the variable */ + unsigned short vidx; /* compiler index (in 'actvar.arr') */ + } var; + } u; + int t; /* patch list of 'exit when true' */ + int f; /* patch list of 'exit when false' */ +} expdesc; + + +/* kinds of variables */ +#define VDKREG 0 /* regular */ +#define RDKCONST 1 /* constant */ +#define RDKTOCLOSE 2 /* to-be-closed */ +#define RDKCTC 3 /* compile-time constant */ + +/* description of an active local variable */ +typedef union Vardesc { + struct { + TValuefields; /* constant value (if it is a compile-time constant) */ + lu_byte kind; + lu_byte ridx; /* register holding the variable */ + short pidx; /* index of the variable in the Proto's 'locvars' array */ + TString *name; /* variable name */ + } vd; + TValue k; /* constant value (if any) */ +} 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; /* number of active variables in that position */ + lu_byte close; /* goto that escapes upvalues */ +} 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 all 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 */ + 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 previousline; /* last line that was saved in 'lineinfo' */ + int nk; /* number of elements in 'k' */ + int np; /* number of elements in 'p' */ + int nabslineinfo; /* number of elements in 'abslineinfo' */ + int firstlocal; /* index of first local var (in Dyndata array) */ + int firstlabel; /* index of first label (in 'dyd->label->arr') */ + short ndebugvars; /* 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 */ + lu_byte iwthabs; /* instructions issued since last absolute line info */ + lu_byte needclose; /* function needs to close upvalues when returning */ +} FuncState; + + +LUAI_FUNC int luaY_nvarstack (FuncState *fs); +LUAI_FUNC LClosure *luaY_parser (lua_State *L, ZIO *z, Mbuffer *buff, + Dyndata *dyd, const char *name, int firstchar); + + +#endif diff --git a/lua-5.4.3/src/lprefix.h b/lua-5.4.3/src/lprefix.h new file mode 100644 index 0000000..484f2ad --- /dev/null +++ b/lua-5.4.3/src/lprefix.h @@ -0,0 +1,45 @@ +/* +** $Id: lprefix.h $ +** Definitions for Lua code that must come before any other header file +** See Copyright Notice in lua.h +*/ + +#ifndef lprefix_h +#define lprefix_h + + +/* +** Allows POSIX/XSI stuff +*/ +#if !defined(LUA_USE_C89) /* { */ + +#if !defined(_XOPEN_SOURCE) +#define _XOPEN_SOURCE 600 +#elif _XOPEN_SOURCE == 0 +#undef _XOPEN_SOURCE /* use -D_XOPEN_SOURCE=0 to undefine it */ +#endif + +/* +** Allows manipulation of large files in gcc and some other compilers +*/ +#if !defined(LUA_32BITS) && !defined(_FILE_OFFSET_BITS) +#define _LARGEFILE_SOURCE 1 +#define _FILE_OFFSET_BITS 64 +#endif + +#endif /* } */ + + +/* +** Windows stuff +*/ +#if defined(_WIN32) /* { */ + +#if !defined(_CRT_SECURE_NO_WARNINGS) +#define _CRT_SECURE_NO_WARNINGS /* avoid warnings about ISO C functions */ +#endif + +#endif /* } */ + +#endif + diff --git a/lua-5.4.3/src/lstate.c b/lua-5.4.3/src/lstate.c new file mode 100644 index 0000000..c5e3b43 --- /dev/null +++ b/lua-5.4.3/src/lstate.c @@ -0,0 +1,439 @@ +/* +** $Id: lstate.c $ +** Global State +** See Copyright Notice in lua.h +*/ + +#define lstate_c +#define LUA_CORE + +#include "lprefix.h" + + +#include +#include + +#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" + + + +/* +** thread state + extra space +*/ +typedef struct LX { + lu_byte extra_[LUA_EXTRASPACE]; + 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))) + + +/* +** A macro to create a "random" seed when a state is created; +** the seed is used to randomize string hashes. +*/ +#if !defined(luai_makeseed) + +#include + +/* +** Compute an initial seed with some level of randomness. +** Rely on Address Space Layout Randomization (if present) and +** current time. +*/ +#define addbuff(b,p,e) \ + { size_t t = cast_sizet(e); \ + memcpy(b + p, &t, sizeof(t)); p += sizeof(t); } + +static unsigned int luai_makeseed (lua_State *L) { + char buff[3 * sizeof(size_t)]; + unsigned int h = cast_uint(time(NULL)); + int p = 0; + addbuff(buff, p, L); /* heap variable */ + addbuff(buff, p, &h); /* local variable */ + addbuff(buff, p, &lua_newstate); /* public function */ + lua_assert(p == sizeof(buff)); + return luaS_hash(buff, p, h); +} + +#endif + + +/* +** set GCdebt to a new value keeping the value (totalbytes + GCdebt) +** invariant (and avoiding underflows in 'totalbytes') +*/ +void luaE_setdebt (global_State *g, l_mem debt) { + l_mem tb = gettotalbytes(g); + lua_assert(tb > 0); + if (debt < tb - MAX_LMEM) + debt = tb - MAX_LMEM; /* will make 'totalbytes == MAX_LMEM' */ + g->totalbytes = tb - debt; + g->GCdebt = debt; +} + + +LUA_API int lua_setcstacklimit (lua_State *L, unsigned int limit) { + UNUSED(L); UNUSED(limit); + return LUAI_MAXCCALLS; /* warning?? */ +} + + +CallInfo *luaE_extendCI (lua_State *L) { + CallInfo *ci; + lua_assert(L->ci->next == NULL); + ci = luaM_new(L, CallInfo); + lua_assert(L->ci->next == NULL); + L->ci->next = ci; + ci->previous = L->ci; + ci->next = NULL; + ci->u.l.trap = 0; + L->nci++; + return ci; +} + + +/* +** free all CallInfo structures not in use by a thread +*/ +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); + L->nci--; + } +} + + +/* +** free half of the CallInfo structures not in use by a thread, +** keeping the first one. +*/ +void luaE_shrinkCI (lua_State *L) { + CallInfo *ci = L->ci->next; /* first free CallInfo */ + CallInfo *next; + if (ci == NULL) + return; /* no extra elements */ + while ((next = ci->next) != NULL) { /* two extra elements? */ + CallInfo *next2 = next->next; /* next's next */ + ci->next = next2; /* remove next from the list */ + L->nci--; + luaM_free(L, next); /* free next */ + if (next2 == NULL) + break; /* no more elements */ + else { + next2->previous = ci; + ci = next2; /* continue */ + } + } +} + + +/* +** Called when 'getCcalls(L)' larger or equal to LUAI_MAXCCALLS. +** If equal, raises an overflow error. If value is larger than +** LUAI_MAXCCALLS (which means it is handling an overflow) but +** not much larger, does not report an error (to allow overflow +** handling to work). +*/ +void luaE_checkcstack (lua_State *L) { + if (getCcalls(L) == LUAI_MAXCCALLS) + luaG_runerror(L, "C stack overflow"); + else if (getCcalls(L) >= (LUAI_MAXCCALLS / 10 * 11)) + luaD_throw(L, LUA_ERRERR); /* error while handing stack error */ +} + + +LUAI_FUNC void luaE_incCstack (lua_State *L) { + L->nCcalls++; + if (l_unlikely(getCcalls(L) >= LUAI_MAXCCALLS)) + luaE_checkcstack(L); +} + + +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 + EXTRA_STACK, StackValue); + L1->tbclist = L1->stack; + for (i = 0; i < BASIC_STACK_SIZE + EXTRA_STACK; i++) + setnilvalue(s2v(L1->stack + i)); /* erase new stack */ + L1->top = L1->stack; + L1->stack_last = L1->stack + BASIC_STACK_SIZE; + /* initialize first ci */ + ci = &L1->base_ci; + ci->next = ci->previous = NULL; + ci->callstatus = CIST_C; + ci->func = L1->top; + ci->u.c.k = NULL; + ci->nresults = 0; + setnilvalue(s2v(L1->top)); /* 'function' entry for this 'ci' */ + L1->top++; + 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); + lua_assert(L->nci == 0); + luaM_freearray(L, L->stack, stacksize(L) + EXTRA_STACK); /* free stack */ +} + + +/* +** Create registry table and its predefined values +*/ +static void init_registry (lua_State *L, global_State *g) { + /* 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, ®istry->array[LUA_RIDX_MAINTHREAD - 1], L); + /* registry[LUA_RIDX_GLOBALS] = new table (table of globals) */ + sethvalue(L, ®istry->array[LUA_RIDX_GLOBALS - 1], luaH_new(L)); +} + + +/* +** 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_init(L); + luaT_init(L); + luaX_init(L); + g->gcrunning = 1; /* allow gc */ + setnilvalue(&g->nilvalue); /* now state is complete */ + luai_userstateopen(L); +} + + +/* +** preinitialize a thread with consistent values without allocating +** any memory (to avoid errors) +*/ +static void preinit_thread (lua_State *L, global_State *g) { + G(L) = g; + L->stack = NULL; + L->ci = NULL; + L->nci = 0; + L->twups = L; /* thread has no upvalues */ + L->nCcalls = 0; + L->errorJmp = NULL; + L->hook = NULL; + L->hookmask = 0; + L->basehookcount = 0; + L->allowhook = 1; + resethookcount(L); + L->openupval = NULL; + L->status = LUA_OK; + L->errfunc = 0; + L->oldpc = 0; +} + + +static void close_state (lua_State *L) { + global_State *g = G(L); + if (!completestate(g)) /* closing a partially built state? */ + luaC_freeallobjects(L); /* jucst collect its objects */ + else { /* closing a fully built state */ + luaD_closeprotected(L, 1, LUA_OK); /* close all upvalues */ + luaC_freeallobjects(L); /* collect all objects */ + luai_userstateclose(L); + } + luaM_freearray(L, G(L)->strt.hash, G(L)->strt.size); + 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) { + global_State *g; + lua_State *L1; + lua_lock(L); + g = G(L); + luaC_checkGC(L); + /* create new thread */ + L1 = &cast(LX *, luaM_newobject(L, LUA_TTHREAD, sizeof(LX)))->l; + L1->marked = luaC_white(g); + L1->tt = LUA_VTHREAD; + /* link it on list 'allgc' */ + L1->next = g->allgc; + g->allgc = obj2gco(L1); + /* anchor it on L stack */ + setthvalue2s(L, L->top, L1); + api_incr_top(L); + preinit_thread(L1, g); + L1->hookmask = L->hookmask; + L1->basehookcount = L->basehookcount; + L1->hook = L->hook; + resethookcount(L1); + /* initialize L1 extra space */ + memcpy(lua_getextraspace(L1), lua_getextraspace(g->mainthread), + LUA_EXTRASPACE); + 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_closeupval(L1, L1->stack); /* close all upvalues */ + lua_assert(L1->openupval == NULL); + luai_userstatefree(L, L1); + freestack(L1); + luaM_free(L, l); +} + + +int luaE_resetthread (lua_State *L, int status) { + CallInfo *ci = L->ci = &L->base_ci; /* unwind CallInfo list */ + setnilvalue(s2v(L->stack)); /* 'function' entry for basic 'ci' */ + ci->func = L->stack; + ci->callstatus = CIST_C; + if (status == LUA_YIELD) + status = LUA_OK; + status = luaD_closeprotected(L, 1, status); + if (status != LUA_OK) /* errors? */ + luaD_seterrorobj(L, status, L->stack + 1); + else + L->top = L->stack + 1; + ci->top = L->top + LUA_MINSTACK; + L->status = cast_byte(status); + luaD_reallocstack(L, cast_int(ci->top - L->stack), 0); + return status; +} + + +LUA_API int lua_resetthread (lua_State *L) { + int status; + lua_lock(L); + status = luaE_resetthread(L, L->status); + lua_unlock(L); + return status; +} + + +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->tt = LUA_VTHREAD; + g->currentwhite = bitmask(WHITE0BIT); + L->marked = luaC_white(g); + preinit_thread(L, g); + g->allgc = obj2gco(L); /* by now, only object is the main thread */ + L->next = NULL; + incnny(L); /* main thread is always non yieldable */ + g->frealloc = f; + g->ud = ud; + g->warnf = NULL; + g->ud_warn = NULL; + g->mainthread = L; + g->seed = luai_makeseed(L); + g->gcrunning = 0; /* no GC while building state */ + g->strt.size = g->strt.nuse = 0; + g->strt.hash = NULL; + setnilvalue(&g->l_registry); + g->panic = NULL; + g->gcstate = GCSpause; + g->gckind = KGC_INC; + g->gcstopem = 0; + g->gcemergency = 0; + g->finobj = g->tobefnz = g->fixedgc = NULL; + g->firstold1 = g->survival = g->old1 = g->reallyold = NULL; + g->finobjsur = g->finobjold1 = g->finobjrold = NULL; + g->sweepgc = NULL; + g->gray = g->grayagain = NULL; + g->weak = g->ephemeron = g->allweak = NULL; + g->twups = NULL; + g->totalbytes = sizeof(LG); + g->GCdebt = 0; + g->lastatomic = 0; + setivalue(&g->nilvalue, 0); /* to signal that state is not yet built */ + setgcparam(g->gcpause, LUAI_GCPAUSE); + setgcparam(g->gcstepmul, LUAI_GCMUL); + g->gcstepsize = LUAI_GCSTEPSIZE; + setgcparam(g->genmajormul, LUAI_GENMAJORMUL); + g->genminormul = LUAI_GENMINORMUL; + 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; + } + return L; +} + + +LUA_API void lua_close (lua_State *L) { + lua_lock(L); + L = G(L)->mainthread; /* only the main thread can be closed */ + close_state(L); +} + + +void luaE_warning (lua_State *L, const char *msg, int tocont) { + lua_WarnFunction wf = G(L)->warnf; + if (wf != NULL) + wf(G(L)->ud_warn, msg, tocont); +} + + +/* +** Generate a warning from an error message +*/ +void luaE_warnerror (lua_State *L, const char *where) { + TValue *errobj = s2v(L->top - 1); /* error object */ + const char *msg = (ttisstring(errobj)) + ? svalue(errobj) + : "error object is not a string"; + /* produce warning "error in %s (%s)" (where, msg) */ + luaE_warning(L, "error in ", 1); + luaE_warning(L, where, 1); + luaE_warning(L, " (", 1); + luaE_warning(L, msg, 1); + luaE_warning(L, ")", 0); +} + diff --git a/lua-5.4.3/src/lstate.h b/lua-5.4.3/src/lstate.h new file mode 100644 index 0000000..c1283bb --- /dev/null +++ b/lua-5.4.3/src/lstate.h @@ -0,0 +1,404 @@ +/* +** $Id: lstate.h $ +** 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, so all objects always +** belong to one (and only one) of these lists, using field 'next' of +** the 'CommonHeader' for the link: +** +** 'allgc': all objects not marked for finalization; +** 'finobj': all objects marked for finalization; +** 'tobefnz': all objects ready to be finalized; +** 'fixedgc': all objects that are not to be collected (currently +** only small strings, such as reserved words). +** +** For the generational collector, some of these lists have marks for +** generations. Each mark points to the first element in the list for +** that particular generation; that generation goes until the next mark. +** +** 'allgc' -> 'survival': new objects; +** 'survival' -> 'old': objects that survived one collection; +** 'old1' -> 'reallyold': objects that became old in last collection; +** 'reallyold' -> NULL: objects old for more than one cycle. +** +** 'finobj' -> 'finobjsur': new objects marked for finalization; +** 'finobjsur' -> 'finobjold1': survived """"; +** 'finobjold1' -> 'finobjrold': just old """"; +** 'finobjrold' -> NULL: really old """". +** +** All lists can contain elements older than their main ages, due +** to 'luaC_checkfinalizer' and 'udata2finalize', which move +** objects between the normal lists and the "marked for finalization" +** lists. Moreover, barriers can age young objects in young lists as +** OLD0, which then become OLD1. However, a list never contains +** elements younger than their main ages. +** +** The generational collector also uses a pointer 'firstold1', which +** points to the first OLD1 object in the list. It is used to optimize +** 'markold'. (Potentially OLD1 objects can be anywhere between 'allgc' +** and 'reallyold', but often the list has no OLD1 objects or they are +** after 'old1'.) Note the difference between it and 'old1': +** 'firstold1': no OLD1 objects before this point; there can be all +** ages after it. +** 'old1': no objects younger than OLD1 after this point. +*/ + +/* +** Moreover, there is another set of lists that control gray objects. +** These lists are linked by fields 'gclist'. (All objects that +** can become gray have such a field. The field is not the same +** in all objects, but it always has this name.) Any gray object +** must belong to one of these lists, and all objects in these lists +** must be gray (with two exceptions explained below): +** +** 'gray': regular gray objects, still waiting to be visited. +** 'grayagain': objects that must be revisited at the atomic phase. +** That includes +** - black objects got in a write barrier; +** - all kinds of weak tables during propagation phase; +** - all threads. +** 'weak': tables with weak values to be cleared; +** 'ephemeron': ephemeron tables with white->white entries; +** 'allweak': tables with weak keys and/or weak values to be cleared. +** +** The exceptions to that "gray rule" are: +** - TOUCHED2 objects in generational mode stay in a gray list (because +** they must be visited again at the end of the cycle), but they are +** marked black because assignments to them must activate barriers (to +** move them back to TOUCHED1). +** - Open upvales are kept gray to avoid barriers, but they stay out +** of gray lists. (They don't even have a 'gclist' field.) +*/ + + + +/* +** About 'nCcalls': This count has two parts: the lower 16 bits counts +** the number of recursive invocations in the C stack; the higher +** 16 bits counts the number of non-yieldable calls in the stack. +** (They are together so that we can change and save both with one +** instruction.) +*/ + + +/* true if this thread does not have non-yieldable calls in the stack */ +#define yieldable(L) (((L)->nCcalls & 0xffff0000) == 0) + +/* real number of C calls */ +#define getCcalls(L) ((L)->nCcalls & 0xffff) + + +/* Increment the number of non-yieldable calls */ +#define incnny(L) ((L)->nCcalls += 0x10000) + +/* Decrement the number of non-yieldable calls */ +#define decnny(L) ((L)->nCcalls -= 0x10000) + +/* Non-yieldable call increment */ +#define nyci (0x10000 | 1) + + + + +struct lua_longjmp; /* defined in ldo.c */ + + +/* +** Atomic type (relative to signals) to better ensure that 'lua_sethook' +** is thread safe +*/ +#if !defined(l_signalT) +#include +#define l_signalT sig_atomic_t +#endif + + +/* +** Extra stack space to handle TM calls and some other extras. This +** space is not included in 'stack_last'. It is used only to avoid stack +** checks, either because the element will be promptly popped or because +** there will be a stack check soon after the push. Function frames +** never use this extra space, so it does not need to be kept clean. +*/ +#define EXTRA_STACK 5 + + +#define BASIC_STACK_SIZE (2*LUA_MINSTACK) + +#define stacksize(th) cast_int((th)->stack_last - (th)->stack) + + +/* kinds of Garbage Collection */ +#define KGC_INC 0 /* incremental gc */ +#define KGC_GEN 1 /* generational gc */ + + +typedef struct stringtable { + TString **hash; + int nuse; /* number of elements */ + int size; +} stringtable; + + +/* +** Information about a call. +** About union 'u': +** - field 'l' is used only for Lua functions; +** - field 'c' is used only for C functions. +** About union 'u2': +** - field 'funcidx' is used only by C functions while doing a +** protected call; +** - field 'nyield' is used only while a function is "doing" an +** yield (from the yield until the next resume); +** - field 'nres' is used only while closing tbc variables when +** returning from a C function; +** - field 'transferinfo' is used only during call/returnhooks, +** before the function starts or after it ends. +*/ +typedef struct CallInfo { + StkId func; /* function index in the stack */ + StkId top; /* top for this function */ + struct CallInfo *previous, *next; /* dynamic call link */ + union { + struct { /* only for Lua functions */ + const Instruction *savedpc; + volatile l_signalT trap; + int nextraargs; /* # of extra arguments in vararg functions */ + } l; + struct { /* only for C functions */ + lua_KFunction k; /* continuation in case of yields */ + ptrdiff_t old_errfunc; + lua_KContext ctx; /* context info. in case of yields */ + } c; + } u; + union { + int funcidx; /* called-function index */ + int nyield; /* number of values yielded */ + int nres; /* number of values returned */ + struct { /* info about transferred values (for call/return hooks) */ + unsigned short ftransfer; /* offset of first value transferred */ + unsigned short ntransfer; /* number of values transferred */ + } transferinfo; + } u2; + short nresults; /* expected number of results from this function */ + unsigned short callstatus; +} CallInfo; + + +/* +** Bits in CallInfo status +*/ +#define CIST_OAH (1<<0) /* original value of 'allowhook' */ +#define CIST_C (1<<1) /* call is running a C function */ +#define CIST_FRESH (1<<2) /* call is on a fresh "luaV_execute" frame */ +#define CIST_HOOKED (1<<3) /* call is running a debug hook */ +#define CIST_YPCALL (1<<4) /* doing a yieldable protected call */ +#define CIST_TAIL (1<<5) /* call was tail called */ +#define CIST_HOOKYIELD (1<<6) /* last hook called yielded */ +#define CIST_FIN (1<<7) /* call is running a finalizer */ +#define CIST_TRAN (1<<8) /* 'ci' has transfer information */ +#define CIST_CLSRET (1<<9) /* function is closing tbc variables */ +/* Bits 10-12 are used for CIST_RECST (see below) */ +#define CIST_RECST 10 +#if defined(LUA_COMPAT_LT_LE) +#define CIST_LEQ (1<<13) /* using __lt for __le */ +#endif + + +/* +** Field CIST_RECST stores the "recover status", used to keep the error +** status while closing to-be-closed variables in coroutines, so that +** Lua can correctly resume after an yield from a __close method called +** because of an error. (Three bits are enough for error status.) +*/ +#define getcistrecst(ci) (((ci)->callstatus >> CIST_RECST) & 7) +#define setcistrecst(ci,st) \ + check_exp(((st) & 7) == (st), /* status must fit in three bits */ \ + ((ci)->callstatus = ((ci)->callstatus & ~(7 << CIST_RECST)) \ + | ((st) << CIST_RECST))) + + +/* active function is a Lua function */ +#define isLua(ci) (!((ci)->callstatus & CIST_C)) + +/* call is running Lua code (not a hook) */ +#define isLuacode(ci) (!((ci)->callstatus & (CIST_C | CIST_HOOKED))) + +/* assume that CIST_OAH has offset 0 and that 'v' is strictly 0/1 */ +#define setoah(st,v) ((st) = ((st) & ~CIST_OAH) | (v)) +#define getoah(st) ((st) & CIST_OAH) + + +/* +** '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' */ + l_mem totalbytes; /* number of bytes currently allocated - GCdebt */ + l_mem GCdebt; /* bytes allocated not yet compensated by the collector */ + lu_mem GCestimate; /* an estimate of the non-garbage memory in use */ + lu_mem lastatomic; /* see function 'genstep' in file 'lgc.c' */ + stringtable strt; /* hash table for strings */ + TValue l_registry; + TValue nilvalue; /* a nil value */ + 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 gcstopem; /* stops emergency collections */ + lu_byte genminormul; /* control for minor generational collections */ + lu_byte genmajormul; /* control for major generational collections */ + lu_byte gcrunning; /* true if GC is running */ + lu_byte gcemergency; /* true if this is an emergency collection */ + lu_byte gcpause; /* size of pause between successive GCs */ + lu_byte gcstepmul; /* GC "speed" */ + lu_byte gcstepsize; /* (log2 of) GC granularity */ + GCObject *allgc; /* list of all collectable objects */ + GCObject **sweepgc; /* current position of sweep in list */ + GCObject *finobj; /* list of collectable objects with finalizers */ + 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 */ + GCObject *fixedgc; /* list of objects not to be collected */ + /* fields for generational collector */ + GCObject *survival; /* start of objects that survived one GC cycle */ + GCObject *old1; /* start of old1 objects */ + GCObject *reallyold; /* objects more than one cycle old ("really old") */ + GCObject *firstold1; /* first OLD1 object in the list (if any) */ + GCObject *finobjsur; /* list of survival objects with finalizers */ + GCObject *finobjold1; /* list of old1 objects with finalizers */ + GCObject *finobjrold; /* list of really old objects with finalizers */ + struct lua_State *twups; /* list of threads with open upvalues */ + lua_CFunction panic; /* to be called in unprotected errors */ + struct lua_State *mainthread; + TString *memerrmsg; /* message for memory-allocation errors */ + TString *tmname[TM_N]; /* array with tag-method names */ + struct Table *mt[LUA_NUMTAGS]; /* metatables for basic types */ + TString *strcache[STRCACHE_N][STRCACHE_M]; /* cache for strings in API */ + lua_WarnFunction warnf; /* warning function */ + void *ud_warn; /* auxiliary data to 'warnf' */ +} global_State; + + +/* +** 'per thread' state +*/ +struct lua_State { + CommonHeader; + lu_byte status; + lu_byte allowhook; + unsigned short nci; /* number of items in 'ci' list */ + StkId top; /* first free slot in the stack */ + global_State *l_G; + CallInfo *ci; /* call info for current function */ + StkId stack_last; /* end of stack (last element + 1) */ + StkId stack; /* stack base */ + UpVal *openupval; /* list of open upvalues in this stack */ + StkId tbclist; /* list of to-be-closed variables */ + GCObject *gclist; + struct lua_State *twups; /* list of threads with open upvalues */ + struct lua_longjmp *errorJmp; /* current error recover point */ + CallInfo base_ci; /* CallInfo for first level (C calling Lua) */ + volatile lua_Hook hook; + ptrdiff_t errfunc; /* current error handling function (stack index) */ + l_uint32 nCcalls; /* number of nested (non-yieldable | C) calls */ + int oldpc; /* last pc traced */ + int basehookcount; + int hookcount; + volatile l_signalT hookmask; +}; + + +#define G(L) (L->l_G) + +/* +** 'g->nilvalue' being a nil value flags that the state was completely +** build. +*/ +#define completestate(g) ttisnil(&g->nilvalue) + + +/* +** Union of all collectable objects (only for conversions) +** ISO C99, 6.5.2.3 p.5: +** "if a union contains several structures that share a common initial +** sequence [...], and if the union object currently contains one +** of these structures, it is permitted to inspect the common initial +** part of any of them anywhere that a declaration of the complete type +** of the union is visible." +*/ +union GCUnion { + GCObject gc; /* common header */ + struct TString ts; + struct Udata u; + union Closure cl; + struct Table h; + struct Proto p; + struct lua_State th; /* thread */ + struct UpVal upv; +}; + + +/* +** ISO C99, 6.7.2.1 p.14: +** "A pointer to a union object, suitably converted, points to each of +** its members [...], and vice versa." +*/ +#define cast_u(o) cast(union GCUnion *, (o)) + +/* macros to convert a GCObject into a specific value */ +#define gco2ts(o) \ + check_exp(novariant((o)->tt) == LUA_TSTRING, &((cast_u(o))->ts)) +#define gco2u(o) check_exp((o)->tt == LUA_VUSERDATA, &((cast_u(o))->u)) +#define gco2lcl(o) check_exp((o)->tt == LUA_VLCL, &((cast_u(o))->cl.l)) +#define gco2ccl(o) check_exp((o)->tt == LUA_VCCL, &((cast_u(o))->cl.c)) +#define gco2cl(o) \ + check_exp(novariant((o)->tt) == LUA_TFUNCTION, &((cast_u(o))->cl)) +#define gco2t(o) check_exp((o)->tt == LUA_VTABLE, &((cast_u(o))->h)) +#define gco2p(o) check_exp((o)->tt == LUA_VPROTO, &((cast_u(o))->p)) +#define gco2th(o) check_exp((o)->tt == LUA_VTHREAD, &((cast_u(o))->th)) +#define gco2upv(o) check_exp((o)->tt == LUA_VUPVAL, &((cast_u(o))->upv)) + + +/* +** macro to convert a Lua object into a GCObject +** (The access to 'tt' tries to ensure that 'v' is actually a Lua object.) +*/ +#define obj2gco(v) check_exp((v)->tt >= LUA_TSTRING, &(cast_u(v)->gc)) + + +/* actual number of total bytes allocated */ +#define gettotalbytes(g) cast(lu_mem, (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); +LUAI_FUNC void luaE_shrinkCI (lua_State *L); +LUAI_FUNC void luaE_checkcstack (lua_State *L); +LUAI_FUNC void luaE_incCstack (lua_State *L); +LUAI_FUNC void luaE_warning (lua_State *L, const char *msg, int tocont); +LUAI_FUNC void luaE_warnerror (lua_State *L, const char *where); +LUAI_FUNC int luaE_resetthread (lua_State *L, int status); + + +#endif + diff --git a/lua-5.4.3/src/lstring.c b/lua-5.4.3/src/lstring.c new file mode 100644 index 0000000..13dcaf4 --- /dev/null +++ b/lua-5.4.3/src/lstring.c @@ -0,0 +1,273 @@ +/* +** $Id: lstring.c $ +** String table (keeps all strings handled by Lua) +** See Copyright Notice in lua.h +*/ + +#define lstring_c +#define LUA_CORE + +#include "lprefix.h" + + +#include + +#include "lua.h" + +#include "ldebug.h" +#include "ldo.h" +#include "lmem.h" +#include "lobject.h" +#include "lstate.h" +#include "lstring.h" + + +/* +** Maximum size for string table. +*/ +#define MAXSTRTB cast_int(luaM_limitN(MAX_INT, TString*)) + + +/* +** equality for long strings +*/ +int luaS_eqlngstr (TString *a, TString *b) { + size_t len = a->u.lnglen; + lua_assert(a->tt == LUA_VLNGSTR && b->tt == LUA_VLNGSTR); + return (a == b) || /* same instance or... */ + ((len == b->u.lnglen) && /* equal length and ... */ + (memcmp(getstr(a), getstr(b), len) == 0)); /* equal contents */ +} + + +unsigned int luaS_hash (const char *str, size_t l, unsigned int seed) { + unsigned int h = seed ^ cast_uint(l); + for (; l > 0; l--) + h ^= ((h<<5) + (h>>2) + cast_byte(str[l - 1])); + return h; +} + + +unsigned int luaS_hashlongstr (TString *ts) { + lua_assert(ts->tt == LUA_VLNGSTR); + if (ts->extra == 0) { /* no hash? */ + size_t len = ts->u.lnglen; + ts->hash = luaS_hash(getstr(ts), len, ts->hash); + ts->extra = 1; /* now it has its hash */ + } + return ts->hash; +} + + +static void tablerehash (TString **vect, int osize, int nsize) { + int i; + for (i = osize; i < nsize; i++) /* clear new elements */ + vect[i] = NULL; + for (i = 0; i < osize; i++) { /* rehash old part of the array */ + TString *p = vect[i]; + vect[i] = NULL; + while (p) { /* for each string in the list */ + TString *hnext = p->u.hnext; /* save next */ + unsigned int h = lmod(p->hash, nsize); /* new position */ + p->u.hnext = vect[h]; /* chain it into array */ + vect[h] = p; + p = hnext; + } + } +} + + +/* +** Resize the string table. If allocation fails, keep the current size. +** (This can degrade performance, but any non-zero size should work +** correctly.) +*/ +void luaS_resize (lua_State *L, int nsize) { + stringtable *tb = &G(L)->strt; + int osize = tb->size; + TString **newvect; + if (nsize < osize) /* shrinking table? */ + tablerehash(tb->hash, osize, nsize); /* depopulate shrinking part */ + newvect = luaM_reallocvector(L, tb->hash, osize, nsize, TString*); + if (l_unlikely(newvect == NULL)) { /* reallocation failed? */ + if (nsize < osize) /* was it shrinking table? */ + tablerehash(tb->hash, nsize, osize); /* restore to original size */ + /* leave table as it was */ + } + else { /* allocation succeeded */ + tb->hash = newvect; + tb->size = nsize; + if (nsize > osize) + tablerehash(newvect, osize, nsize); /* rehash for new size */ + } +} + + +/* +** Clear API string cache. (Entries cannot be empty, so fill them with +** a non-collectable string.) +*/ +void luaS_clearcache (global_State *g) { + int i, j; + for (i = 0; i < STRCACHE_N; i++) + for (j = 0; j < STRCACHE_M; j++) { + if (iswhite(g->strcache[i][j])) /* will entry be collected? */ + g->strcache[i][j] = g->memerrmsg; /* replace it with something fixed */ + } +} + + +/* +** Initialize the string table and the string cache +*/ +void luaS_init (lua_State *L) { + global_State *g = G(L); + int i, j; + stringtable *tb = &G(L)->strt; + tb->hash = luaM_newvector(L, MINSTRTABSIZE, TString*); + tablerehash(tb->hash, 0, MINSTRTABSIZE); /* clear array */ + tb->size = MINSTRTABSIZE; + /* pre-create memory-error message */ + g->memerrmsg = luaS_newliteral(L, MEMERRMSG); + luaC_fix(L, obj2gco(g->memerrmsg)); /* it should never be collected */ + for (i = 0; i < STRCACHE_N; i++) /* fill cache with valid strings */ + for (j = 0; j < STRCACHE_M; j++) + g->strcache[i][j] = g->memerrmsg; +} + + + +/* +** creates a new string object +*/ +static TString *createstrobj (lua_State *L, size_t l, int tag, unsigned int h) { + TString *ts; + GCObject *o; + size_t totalsize; /* total size of TString object */ + totalsize = sizelstring(l); + o = luaC_newobj(L, tag, totalsize); + ts = gco2ts(o); + ts->hash = h; + ts->extra = 0; + getstr(ts)[l] = '\0'; /* ending 0 */ + return ts; +} + + +TString *luaS_createlngstrobj (lua_State *L, size_t l) { + TString *ts = createstrobj(L, l, LUA_VLNGSTR, G(L)->seed); + ts->u.lnglen = l; + return ts; +} + + +void luaS_remove (lua_State *L, TString *ts) { + stringtable *tb = &G(L)->strt; + TString **p = &tb->hash[lmod(ts->hash, tb->size)]; + while (*p != ts) /* find previous element */ + p = &(*p)->u.hnext; + *p = (*p)->u.hnext; /* remove element from its list */ + tb->nuse--; +} + + +static void growstrtab (lua_State *L, stringtable *tb) { + if (l_unlikely(tb->nuse == MAX_INT)) { /* too many strings? */ + luaC_fullgc(L, 1); /* try to free some... */ + if (tb->nuse == MAX_INT) /* still too many? */ + luaM_error(L); /* cannot even create a message... */ + } + if (tb->size <= MAXSTRTB / 2) /* can grow string table? */ + luaS_resize(L, tb->size * 2); +} + + +/* +** 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) { + TString *ts; + global_State *g = G(L); + stringtable *tb = &g->strt; + unsigned int h = luaS_hash(str, l, g->seed); + TString **list = &tb->hash[lmod(h, tb->size)]; + lua_assert(str != NULL); /* otherwise 'memcmp'/'memcpy' are undefined */ + for (ts = *list; ts != NULL; ts = ts->u.hnext) { + if (l == ts->shrlen && (memcmp(str, getstr(ts), l * sizeof(char)) == 0)) { + /* found! */ + if (isdead(g, ts)) /* dead (but not collected yet)? */ + changewhite(ts); /* resurrect it */ + return ts; + } + } + /* else must create a new string */ + if (tb->nuse >= tb->size) { /* need to grow string table? */ + growstrtab(L, tb); + list = &tb->hash[lmod(h, tb->size)]; /* rehash with new size */ + } + ts = createstrobj(L, l, LUA_VSHRSTR, h); + memcpy(getstr(ts), str, l * sizeof(char)); + ts->shrlen = cast_byte(l); + ts->u.hnext = *list; + *list = ts; + tb->nuse++; + return ts; +} + + +/* +** 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 { + TString *ts; + if (l_unlikely(l >= (MAX_SIZE - sizeof(TString))/sizeof(char))) + luaM_toobig(L); + ts = luaS_createlngstrobj(L, l); + memcpy(getstr(ts), str, l * sizeof(char)); + return ts; + } +} + + +/* +** Create or reuse a zero-terminated string, first checking in the +** cache (using the string address as a key). The cache can contain +** only zero-terminated strings, so it is safe to use 'strcmp' to +** check hits. +*/ +TString *luaS_new (lua_State *L, const char *str) { + unsigned int i = point2uint(str) % STRCACHE_N; /* hash */ + int j; + TString **p = G(L)->strcache[i]; + for (j = 0; j < STRCACHE_M; j++) { + if (strcmp(str, getstr(p[j])) == 0) /* hit? */ + return p[j]; /* that is it */ + } + /* normal route */ + for (j = STRCACHE_M - 1; j > 0; j--) + p[j] = p[j - 1]; /* move out last element */ + /* new element is first in the list */ + p[0] = luaS_newlstr(L, str, strlen(str)); + return p[0]; +} + + +Udata *luaS_newudata (lua_State *L, size_t s, int nuvalue) { + Udata *u; + int i; + GCObject *o; + if (l_unlikely(s > MAX_SIZE - udatamemoffset(nuvalue))) + luaM_toobig(L); + o = luaC_newobj(L, LUA_VUSERDATA, sizeudata(nuvalue, s)); + u = gco2u(o); + u->len = s; + u->nuvalue = nuvalue; + u->metatable = NULL; + for (i = 0; i < nuvalue; i++) + setnilvalue(&u->uv[i].uv); + return u; +} + diff --git a/lua-5.4.3/src/lstring.h b/lua-5.4.3/src/lstring.h new file mode 100644 index 0000000..450c239 --- /dev/null +++ b/lua-5.4.3/src/lstring.h @@ -0,0 +1,57 @@ +/* +** $Id: lstring.h $ +** 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" + + +/* +** Memory-allocation error message must be preallocated (it cannot +** be created after memory is exhausted) +*/ +#define MEMERRMSG "not enough memory" + + +/* +** Size of a TString: Size of the header plus space for the string +** itself (including final '\0'). +*/ +#define sizelstring(l) (offsetof(TString, contents) + ((l) + 1) * sizeof(char)) + +#define luaS_newliteral(L, s) (luaS_newlstr(L, "" s, \ + (sizeof(s)/sizeof(char))-1)) + + +/* +** test whether a string is a reserved word +*/ +#define isreserved(s) ((s)->tt == LUA_VSHRSTR && (s)->extra > 0) + + +/* +** equality for short strings, which are always internalized +*/ +#define eqshrstr(a,b) check_exp((a)->tt == LUA_VSHRSTR, (a) == (b)) + + +LUAI_FUNC unsigned int luaS_hash (const char *str, size_t l, unsigned int seed); +LUAI_FUNC unsigned int luaS_hashlongstr (TString *ts); +LUAI_FUNC int luaS_eqlngstr (TString *a, TString *b); +LUAI_FUNC void luaS_resize (lua_State *L, int newsize); +LUAI_FUNC void luaS_clearcache (global_State *g); +LUAI_FUNC void luaS_init (lua_State *L); +LUAI_FUNC void luaS_remove (lua_State *L, TString *ts); +LUAI_FUNC Udata *luaS_newudata (lua_State *L, size_t s, int nuvalue); +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); +LUAI_FUNC TString *luaS_createlngstrobj (lua_State *L, size_t l); + + +#endif diff --git a/lua-5.4.3/src/lstrlib.c b/lua-5.4.3/src/lstrlib.c new file mode 100644 index 0000000..47e5b27 --- /dev/null +++ b/lua-5.4.3/src/lstrlib.c @@ -0,0 +1,1817 @@ +/* +** $Id: lstrlib.c $ +** Standard library for string operations and pattern-matching +** See Copyright Notice in lua.h +*/ + +#define lstrlib_c +#define LUA_LIB + +#include "lprefix.h" + + +#include +#include +#include +#include +#include +#include +#include +#include +#include + +#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, but must fit in +** an unsigned char. +*/ +#if !defined(LUA_MAXCAPTURES) +#define LUA_MAXCAPTURES 32 +#endif + + +/* macro to 'unsign' a character */ +#define uchar(c) ((unsigned char)(c)) + + +/* +** Some sizes are better limited to fit in 'int', but must also fit in +** 'size_t'. (We assume that 'lua_Integer' cannot be smaller than 'int'.) +*/ +#define MAX_SIZET ((size_t)(~(size_t)0)) + +#define MAXSIZE \ + (sizeof(size_t) < sizeof(int) ? MAX_SIZET : (size_t)(INT_MAX)) + + + + +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 initial string position +** (negative means back from end): clip result to [1, inf). +** The length of any string in Lua must fit in a lua_Integer, +** so there are no overflows in the casts. +** The inverted comparison avoids a possible overflow +** computing '-pos'. +*/ +static size_t posrelatI (lua_Integer pos, size_t len) { + if (pos > 0) + return (size_t)pos; + else if (pos == 0) + return 1; + else if (pos < -(lua_Integer)len) /* inverted comparison */ + return 1; /* clip to 1 */ + else return len + (size_t)pos + 1; +} + + +/* +** Gets an optional ending string position from argument 'arg', +** with default value 'def'. +** Negative means back from end: clip result to [0, len] +*/ +static size_t getendpos (lua_State *L, int arg, lua_Integer def, + size_t len) { + lua_Integer pos = luaL_optinteger(L, arg, def); + if (pos > (lua_Integer)len) + return len; + else if (pos >= 0) + return (size_t)pos; + else if (pos < -(lua_Integer)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 = posrelatI(luaL_checkinteger(L, 2), l); + size_t end = getendpos(L, 3, -1, 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 MAXSIZE / n)) + return luaL_error(L, "resulting string too large"); + else { + size_t totallen = (size_t)n * l + (size_t)(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) { /* empty 'memcpy' is not that cheap */ + 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); + lua_Integer pi = luaL_optinteger(L, 2, 1); + size_t posi = posrelatI(pi, l); + size_t pose = getendpos(L, 3, pi, l); + int n, i; + if (posi > pose) return 0; /* empty interval; return no values */ + if (l_unlikely(pose - posi >= (size_t)INT_MAX)) /* arithmetic overflow? */ + return luaL_error(L, "string slice too long"); + n = (int)(pose - posi) + 1; + luaL_checkstack(L, n, "string slice too long"); + for (i=0; iinit) { + state->init = 1; + luaL_buffinit(L, &state->B); + } + luaL_addlstring(&state->B, (const char *)b, size); + return 0; +} + + +static int str_dump (lua_State *L) { + struct str_Writer state; + int strip = lua_toboolean(L, 2); + luaL_checktype(L, 1, LUA_TFUNCTION); + lua_settop(L, 1); /* ensure function is on the top of the stack */ + state.init = 0; + if (l_unlikely(lua_dump(L, writer, &state, strip) != 0)) + return luaL_error(L, "unable to dump given function"); + luaL_pushresult(&state.B); + return 1; +} + + + +/* +** {====================================================== +** METAMETHODS +** ======================================================= +*/ + +#if defined(LUA_NOCVTS2N) /* { */ + +/* no coercion from strings to numbers */ + +static const luaL_Reg stringmetamethods[] = { + {"__index", NULL}, /* placeholder */ + {NULL, NULL} +}; + +#else /* }{ */ + +static int tonum (lua_State *L, int arg) { + if (lua_type(L, arg) == LUA_TNUMBER) { /* already a number? */ + lua_pushvalue(L, arg); + return 1; + } + else { /* check whether it is a numerical string */ + size_t len; + const char *s = lua_tolstring(L, arg, &len); + return (s != NULL && lua_stringtonumber(L, s) == len + 1); + } +} + + +static void trymt (lua_State *L, const char *mtname) { + lua_settop(L, 2); /* back to the original arguments */ + if (l_unlikely(lua_type(L, 2) == LUA_TSTRING || + !luaL_getmetafield(L, 2, mtname))) + luaL_error(L, "attempt to %s a '%s' with a '%s'", mtname + 2, + luaL_typename(L, -2), luaL_typename(L, -1)); + lua_insert(L, -3); /* put metamethod before arguments */ + lua_call(L, 2, 1); /* call metamethod */ +} + + +static int arith (lua_State *L, int op, const char *mtname) { + if (tonum(L, 1) && tonum(L, 2)) + lua_arith(L, op); /* result will be on the top */ + else + trymt(L, mtname); + return 1; +} + + +static int arith_add (lua_State *L) { + return arith(L, LUA_OPADD, "__add"); +} + +static int arith_sub (lua_State *L) { + return arith(L, LUA_OPSUB, "__sub"); +} + +static int arith_mul (lua_State *L) { + return arith(L, LUA_OPMUL, "__mul"); +} + +static int arith_mod (lua_State *L) { + return arith(L, LUA_OPMOD, "__mod"); +} + +static int arith_pow (lua_State *L) { + return arith(L, LUA_OPPOW, "__pow"); +} + +static int arith_div (lua_State *L) { + return arith(L, LUA_OPDIV, "__div"); +} + +static int arith_idiv (lua_State *L) { + return arith(L, LUA_OPIDIV, "__idiv"); +} + +static int arith_unm (lua_State *L) { + return arith(L, LUA_OPUNM, "__unm"); +} + + +static const luaL_Reg stringmetamethods[] = { + {"__add", arith_add}, + {"__sub", arith_sub}, + {"__mul", arith_mul}, + {"__mod", arith_mod}, + {"__pow", arith_pow}, + {"__div", arith_div}, + {"__idiv", arith_idiv}, + {"__unm", arith_unm}, + {"__index", NULL}, /* placeholder */ + {NULL, NULL} +}; + +#endif /* } */ + +/* }====================================================== */ + +/* +** {====================================================== +** PATTERN MATCHING +** ======================================================= +*/ + + +#define CAP_UNFINISHED (-1) +#define CAP_POSITION (-2) + + +typedef struct MatchState { + const char *src_init; /* init of source string */ + const char *src_end; /* end ('\0') of source string */ + const char *p_end; /* end ('\0') of pattern */ + lua_State *L; + int matchdepth; /* control for recursive depth (to avoid C stack overflow) */ + unsigned char level; /* total number of captures (finished or unfinished) */ + struct { + const char *init; + ptrdiff_t len; + } capture[LUA_MAXCAPTURES]; +} MatchState; + + +/* recursive function */ +static const char *match (MatchState *ms, const char *s, const char *p); + + +/* maximum recursion depth for 'match' */ +#if !defined(MAXCCALLS) +#define MAXCCALLS 200 +#endif + + +#define L_ESC '%' +#define SPECIALS "^$*+?.([%-" + + +static int check_capture (MatchState *ms, int l) { + l -= '1'; + if (l_unlikely(l < 0 || l >= 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 (l_unlikely(p == ms->p_end)) + luaL_error(ms->L, "malformed pattern (ends with '%%')"); + return p+1; + } + case '[': { + if (*p == '^') p++; + do { /* look for a ']' */ + if (l_unlikely(p == ms->p_end)) + luaL_error(ms->L, "malformed pattern (missing ']')"); + 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 (l_unlikely(p >= ms->p_end - 1)) + luaL_error(ms->L, "malformed pattern (missing arguments to '%%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 (l_unlikely(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 (l_unlikely(*p != '[')) + luaL_error(ms->L, "missing '[' after '%%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 */ + /* FALLTHROUGH */ + 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 */ + } +} + + +/* +** get information about the i-th capture. If there are no captures +** and 'i==0', return information about the whole match, which +** is the range 's'..'e'. If the capture is a string, return +** its length and put its address in '*cap'. If it is an integer +** (a position), push it on the stack and return CAP_POSITION. +*/ +static size_t get_onecapture (MatchState *ms, int i, const char *s, + const char *e, const char **cap) { + if (i >= ms->level) { + if (l_unlikely(i != 0)) + luaL_error(ms->L, "invalid capture index %%%d", i + 1); + *cap = s; + return e - s; + } + else { + ptrdiff_t capl = ms->capture[i].len; + *cap = ms->capture[i].init; + if (l_unlikely(capl == CAP_UNFINISHED)) + luaL_error(ms->L, "unfinished capture"); + else if (capl == CAP_POSITION) + lua_pushinteger(ms->L, (ms->capture[i].init - ms->src_init) + 1); + return capl; + } +} + + +/* +** Push the i-th capture on the stack. +*/ +static void push_onecapture (MatchState *ms, int i, const char *s, + const char *e) { + const char *cap; + ptrdiff_t l = get_onecapture(ms, i, s, e, &cap); + if (l != CAP_POSITION) + lua_pushlstring(ms->L, cap, l); + /* else position was already pushed */ +} + + +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 void prepstate (MatchState *ms, lua_State *L, + const char *s, size_t ls, const char *p, size_t lp) { + ms->L = L; + ms->matchdepth = MAXCCALLS; + ms->src_init = s; + ms->src_end = s + ls; + ms->p_end = p + lp; +} + + +static void reprepstate (MatchState *ms) { + ms->level = 0; + lua_assert(ms->matchdepth == MAXCCALLS); +} + + +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 = posrelatI(luaL_optinteger(L, 3, 1), ls) - 1; + if (init > ls) { /* start after string's end? */ + luaL_pushfail(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, ls - init, 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; + int anchor = (*p == '^'); + if (anchor) { + p++; lp--; /* skip anchor character */ + } + prepstate(&ms, L, s, ls, p, lp); + do { + const char *res; + reprepstate(&ms); + 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); + } + luaL_pushfail(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); +} + + +/* state for 'gmatch' */ +typedef struct GMatchState { + const char *src; /* current position */ + const char *p; /* pattern */ + const char *lastmatch; /* end of last match */ + MatchState ms; /* match state */ +} GMatchState; + + +static int gmatch_aux (lua_State *L) { + GMatchState *gm = (GMatchState *)lua_touserdata(L, lua_upvalueindex(3)); + const char *src; + gm->ms.L = L; + for (src = gm->src; src <= gm->ms.src_end; src++) { + const char *e; + reprepstate(&gm->ms); + if ((e = match(&gm->ms, src, gm->p)) != NULL && e != gm->lastmatch) { + gm->src = gm->lastmatch = e; + return push_captures(&gm->ms, src, e); + } + } + return 0; /* not found */ +} + + +static int gmatch (lua_State *L) { + size_t ls, lp; + const char *s = luaL_checklstring(L, 1, &ls); + const char *p = luaL_checklstring(L, 2, &lp); + size_t init = posrelatI(luaL_optinteger(L, 3, 1), ls) - 1; + GMatchState *gm; + lua_settop(L, 2); /* keep strings on closure to avoid being collected */ + gm = (GMatchState *)lua_newuserdatauv(L, sizeof(GMatchState), 0); + if (init > ls) /* start after string's end? */ + init = ls + 1; /* avoid overflows in 's + init' */ + prepstate(&gm->ms, L, s, ls, p, lp); + gm->src = s + init; gm->p = p; gm->lastmatch = NULL; + 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; + lua_State *L = ms->L; + const char *news = lua_tolstring(L, 3, &l); + const char *p; + while ((p = (char *)memchr(news, L_ESC, l)) != NULL) { + luaL_addlstring(b, news, p - news); + p++; /* skip ESC */ + if (*p == L_ESC) /* '%%' */ + luaL_addchar(b, *p); + else if (*p == '0') /* '%0' */ + luaL_addlstring(b, s, e - s); + else if (isdigit(uchar(*p))) { /* '%n' */ + const char *cap; + ptrdiff_t resl = get_onecapture(ms, *p - '1', s, e, &cap); + if (resl == CAP_POSITION) + luaL_addvalue(b); /* add position to accumulated result */ + else + luaL_addlstring(b, cap, resl); + } + else + luaL_error(L, "invalid use of '%c' in replacement string", L_ESC); + l -= p + 1 - news; + news = p + 1; + } + luaL_addlstring(b, news, l); +} + + +/* +** Add the replacement value to the string buffer 'b'. +** Return true if the original string was changed. (Function calls and +** table indexing resulting in nil or false do not change the subject.) +*/ +static int 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: { /* call the function */ + int n; + lua_pushvalue(L, 3); /* push the function */ + n = push_captures(ms, s, e); /* all captures as arguments */ + lua_call(L, n, 1); /* call it */ + break; + } + case LUA_TTABLE: { /* index the table */ + push_onecapture(ms, 0, s, e); /* first capture is the index */ + lua_gettable(L, 3); + break; + } + default: { /* LUA_TNUMBER or LUA_TSTRING */ + add_s(ms, b, s, e); /* add value to the buffer */ + return 1; /* something changed */ + } + } + if (!lua_toboolean(L, -1)) { /* nil or false? */ + lua_pop(L, 1); /* remove value */ + luaL_addlstring(b, s, e - s); /* keep original text */ + return 0; /* no changes */ + } + else if (l_unlikely(!lua_isstring(L, -1))) + return luaL_error(L, "invalid replacement value (a %s)", + luaL_typename(L, -1)); + else { + luaL_addvalue(b); /* add result to accumulator */ + return 1; /* something changed */ + } +} + + +static int str_gsub (lua_State *L) { + size_t srcl, lp; + const char *src = luaL_checklstring(L, 1, &srcl); /* subject */ + const char *p = luaL_checklstring(L, 2, &lp); /* pattern */ + const char *lastmatch = NULL; /* end of last match */ + int tr = lua_type(L, 3); /* replacement type */ + lua_Integer max_s = luaL_optinteger(L, 4, srcl + 1); /* max replacements */ + int anchor = (*p == '^'); + lua_Integer n = 0; /* replacement count */ + int changed = 0; /* change flag */ + MatchState ms; + luaL_Buffer b; + luaL_argexpected(L, tr == LUA_TNUMBER || tr == LUA_TSTRING || + tr == LUA_TFUNCTION || tr == LUA_TTABLE, 3, + "string/function/table"); + luaL_buffinit(L, &b); + if (anchor) { + p++; lp--; /* skip anchor character */ + } + prepstate(&ms, L, src, srcl, p, lp); + while (n < max_s) { + const char *e; + reprepstate(&ms); /* (re)prepare state for new match */ + if ((e = match(&ms, src, p)) != NULL && e != lastmatch) { /* match? */ + n++; + changed = add_value(&ms, &b, src, e, tr) | changed; + src = lastmatch = e; + } + else if (src < ms.src_end) /* otherwise, skip one character */ + luaL_addchar(&b, *src++); + else break; /* end of subject */ + if (anchor) break; + } + if (!changed) /* no changes? */ + lua_pushvalue(L, 1); /* return original string */ + else { /* something changed */ + luaL_addlstring(&b, src, ms.src_end-src); + luaL_pushresult(&b); /* create and return new string */ + } + lua_pushinteger(L, n); /* number of substitutions */ + return 2; +} + +/* }====================================================== */ + + + +/* +** {====================================================== +** STRING FORMAT +** ======================================================= +*/ + +#if !defined(lua_number2strx) /* { */ + +/* +** Hexadecimal floating-point formatter +*/ + +#define SIZELENMOD (sizeof(LUA_NUMBER_FRMLEN)/sizeof(char)) + + +/* +** Number of bits that goes into the first digit. It can be any value +** between 1 and 4; the following definition tries to align the number +** to nibble boundaries by making what is left after that first digit a +** multiple of 4. +*/ +#define L_NBFD ((l_floatatt(MANT_DIG) - 1)%4 + 1) + + +/* +** Add integer part of 'x' to buffer and return new 'x' +*/ +static lua_Number adddigit (char *buff, int n, lua_Number x) { + lua_Number dd = l_mathop(floor)(x); /* get integer part from 'x' */ + int d = (int)dd; + buff[n] = (d < 10 ? d + '0' : d - 10 + 'a'); /* add to buffer */ + return x - dd; /* return what is left */ +} + + +static int num2straux (char *buff, int sz, lua_Number x) { + /* if 'inf' or 'NaN', format it like '%g' */ + if (x != x || x == (lua_Number)HUGE_VAL || x == -(lua_Number)HUGE_VAL) + return l_sprintf(buff, sz, LUA_NUMBER_FMT, (LUAI_UACNUMBER)x); + else if (x == 0) { /* can be -0... */ + /* create "0" or "-0" followed by exponent */ + return l_sprintf(buff, sz, LUA_NUMBER_FMT "x0p+0", (LUAI_UACNUMBER)x); + } + else { + int e; + lua_Number m = l_mathop(frexp)(x, &e); /* 'x' fraction and exponent */ + int n = 0; /* character count */ + if (m < 0) { /* is number negative? */ + buff[n++] = '-'; /* add sign */ + m = -m; /* make it positive */ + } + buff[n++] = '0'; buff[n++] = 'x'; /* add "0x" */ + m = adddigit(buff, n++, m * (1 << L_NBFD)); /* add first digit */ + e -= L_NBFD; /* this digit goes before the radix point */ + if (m > 0) { /* more digits? */ + buff[n++] = lua_getlocaledecpoint(); /* add radix point */ + do { /* add as many digits as needed */ + m = adddigit(buff, n++, m * 16); + } while (m > 0); + } + n += l_sprintf(buff + n, sz - n, "p%+d", e); /* add exponent */ + lua_assert(n < sz); + return n; + } +} + + +static int lua_number2strx (lua_State *L, char *buff, int sz, + const char *fmt, lua_Number x) { + int n = num2straux(buff, sz, x); + if (fmt[SIZELENMOD] == 'A') { + int i; + for (i = 0; i < n; i++) + buff[i] = toupper(uchar(buff[i])); + } + else if (l_unlikely(fmt[SIZELENMOD] != 'a')) + return luaL_error(L, "modifiers for format '%%a'/'%%A' not implemented"); + return n; +} + +#endif /* } */ + + +/* +** Maximum size for items formatted with '%f'. This size is produced +** by format('%.99f', -maxfloat), and is equal to 99 + 3 ('-', '.', +** and '\0') + number of decimal digits to represent maxfloat (which +** is maximum exponent + 1). (99+3+1, adding some extra, 110) +*/ +#define MAX_ITEMF (110 + l_floatatt(MAX_10_EXP)) + + +/* +** All formats except '%f' do not need that large limit. The other +** float formats use exponents, so that they fit in the 99 limit for +** significant digits; 's' for large strings and 'q' add items directly +** to the buffer; all integer formats also fit in the 99 limit. The +** worst case are floats: they may need 99 significant digits, plus +** '0x', '-', '.', 'e+XXXX', and '\0'. Adding some extra, 120. +*/ +#define MAX_ITEM 120 + + +/* valid flags in a format specification */ +#if !defined(L_FMTFLAGS) +#define L_FMTFLAGS "-+ #0" +#endif + + +/* +** maximum size of each format specification (such as "%-099.99d") +*/ +#define MAX_FORMAT 32 + + +static void addquoted (luaL_Buffer *b, const char *s, size_t len) { + luaL_addchar(b, '"'); + while (len--) { + if (*s == '"' || *s == '\\' || *s == '\n') { + luaL_addchar(b, '\\'); + luaL_addchar(b, *s); + } + else if (iscntrl(uchar(*s))) { + char buff[10]; + if (!isdigit(uchar(*(s+1)))) + l_sprintf(buff, sizeof(buff), "\\%d", (int)uchar(*s)); + else + l_sprintf(buff, sizeof(buff), "\\%03d", (int)uchar(*s)); + luaL_addstring(b, buff); + } + else + luaL_addchar(b, *s); + s++; + } + luaL_addchar(b, '"'); +} + + +/* +** Serialize a floating-point number in such a way that it can be +** scanned back by Lua. Use hexadecimal format for "common" numbers +** (to preserve precision); inf, -inf, and NaN are handled separately. +** (NaN cannot be expressed as a numeral, so we write '(0/0)' for it.) +*/ +static int quotefloat (lua_State *L, char *buff, lua_Number n) { + const char *s; /* for the fixed representations */ + if (n == (lua_Number)HUGE_VAL) /* inf? */ + s = "1e9999"; + else if (n == -(lua_Number)HUGE_VAL) /* -inf? */ + s = "-1e9999"; + else if (n != n) /* NaN? */ + s = "(0/0)"; + else { /* format number as hexadecimal */ + int nb = lua_number2strx(L, buff, MAX_ITEM, + "%" LUA_NUMBER_FRMLEN "a", n); + /* ensures that 'buff' string uses a dot as the radix character */ + if (memchr(buff, '.', nb) == NULL) { /* no dot? */ + char point = lua_getlocaledecpoint(); /* try locale point */ + char *ppoint = (char *)memchr(buff, point, nb); + if (ppoint) *ppoint = '.'; /* change it to a dot */ + } + return nb; + } + /* for the fixed representations */ + return l_sprintf(buff, MAX_ITEM, "%s", s); +} + + +static void addliteral (lua_State *L, luaL_Buffer *b, int arg) { + switch (lua_type(L, arg)) { + case LUA_TSTRING: { + size_t len; + const char *s = lua_tolstring(L, arg, &len); + addquoted(b, s, len); + break; + } + case LUA_TNUMBER: { + char *buff = luaL_prepbuffsize(b, MAX_ITEM); + int nb; + if (!lua_isinteger(L, arg)) /* float? */ + nb = quotefloat(L, buff, lua_tonumber(L, arg)); + else { /* integers */ + lua_Integer n = lua_tointeger(L, arg); + const char *format = (n == LUA_MININTEGER) /* corner case? */ + ? "0x%" LUA_INTEGER_FRMLEN "x" /* use hex */ + : LUA_INTEGER_FMT; /* else use default format */ + nb = l_sprintf(buff, MAX_ITEM, format, (LUAI_UACINT)n); + } + luaL_addsize(b, nb); + break; + } + case LUA_TNIL: case LUA_TBOOLEAN: { + luaL_tolstring(L, arg, NULL); + luaL_addvalue(b); + break; + } + default: { + luaL_argerror(L, arg, "value has no literal form"); + } + } +} + + +static const char *scanformat (lua_State *L, const char *strfrmt, char *form) { + const char *p = strfrmt; + while (*p != '\0' && strchr(L_FMTFLAGS, *p) != NULL) p++; /* skip flags */ + if ((size_t)(p - strfrmt) >= sizeof(L_FMTFLAGS)/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 ('%...') */ + int maxitem = MAX_ITEM; + char *buff = luaL_prepbuffsize(&b, maxitem); /* to put formatted item */ + int nb = 0; /* number of bytes in added item */ + if (++arg > top) + return luaL_argerror(L, arg, "no value"); + strfrmt = scanformat(L, strfrmt, form); + switch (*strfrmt++) { + case 'c': { + nb = l_sprintf(buff, maxitem, form, (int)luaL_checkinteger(L, arg)); + break; + } + case 'd': case 'i': + case 'o': case 'u': case 'x': case 'X': { + lua_Integer n = luaL_checkinteger(L, arg); + addlenmod(form, LUA_INTEGER_FRMLEN); + nb = l_sprintf(buff, maxitem, form, (LUAI_UACINT)n); + break; + } + case 'a': case 'A': + addlenmod(form, LUA_NUMBER_FRMLEN); + nb = lua_number2strx(L, buff, maxitem, form, + luaL_checknumber(L, arg)); + break; + case 'f': + maxitem = MAX_ITEMF; /* extra space for '%f' */ + buff = luaL_prepbuffsize(&b, maxitem); + /* FALLTHROUGH */ + case 'e': case 'E': case 'g': case 'G': { + lua_Number n = luaL_checknumber(L, arg); + addlenmod(form, LUA_NUMBER_FRMLEN); + nb = l_sprintf(buff, maxitem, form, (LUAI_UACNUMBER)n); + break; + } + case 'p': { + const void *p = lua_topointer(L, arg); + if (p == NULL) { /* avoid calling 'printf' with argument NULL */ + p = "(null)"; /* result */ + form[strlen(form) - 1] = 's'; /* format it as a string */ + } + nb = l_sprintf(buff, maxitem, form, p); + break; + } + case 'q': { + if (form[2] != '\0') /* modifiers? */ + return luaL_error(L, "specifier '%%q' cannot have modifiers"); + addliteral(L, &b, arg); + break; + } + case 's': { + size_t l; + const char *s = luaL_tolstring(L, arg, &l); + if (form[2] == '\0') /* no modifiers? */ + luaL_addvalue(&b); /* keep entire string */ + else { + luaL_argcheck(L, l == strlen(s), arg, "string contains zeros"); + if (!strchr(form, '.') && l >= 100) { + /* no precision and string is too long to be formatted */ + luaL_addvalue(&b); /* keep entire string */ + } + else { /* format the string into 'buff' */ + nb = l_sprintf(buff, maxitem, form, s); + lua_pop(L, 1); /* remove result from 'luaL_tolstring' */ + } + } + break; + } + default: { /* also treat cases 'pnLlh' */ + return luaL_error(L, "invalid conversion '%s' to 'format'", form); + } + } + lua_assert(nb < maxitem); + luaL_addsize(&b, nb); + } + } + luaL_pushresult(&b); + return 1; +} + +/* }====================================================== */ + + +/* +** {====================================================== +** PACK/UNPACK +** ======================================================= +*/ + + +/* value used for padding */ +#if !defined(LUAL_PACKPADBYTE) +#define LUAL_PACKPADBYTE 0x00 +#endif + +/* maximum size for the binary representation of an integer */ +#define MAXINTSIZE 16 + +/* number of bits in a character */ +#define NB CHAR_BIT + +/* mask for one character (NB 1's) */ +#define MC ((1 << NB) - 1) + +/* size of a lua_Integer */ +#define SZINT ((int)sizeof(lua_Integer)) + + +/* dummy union to get native endianness */ +static const union { + int dummy; + char little; /* true iff machine is little endian */ +} nativeendian = {1}; + + +/* dummy structure to get native alignment requirements */ +struct cD { + char c; + union { double d; void *p; lua_Integer i; lua_Number n; } u; +}; + +#define MAXALIGN (offsetof(struct cD, u)) + + +/* +** information to pack/unpack stuff +*/ +typedef struct Header { + lua_State *L; + int islittle; + int maxalign; +} Header; + + +/* +** options for pack/unpack +*/ +typedef enum KOption { + Kint, /* signed integers */ + Kuint, /* unsigned integers */ + Kfloat, /* single-precision floating-point numbers */ + Knumber, /* Lua "native" floating-point numbers */ + Kdouble, /* double-precision floating-point numbers */ + Kchar, /* fixed-length strings */ + Kstring, /* strings with prefixed length */ + Kzstr, /* zero-terminated strings */ + Kpadding, /* padding */ + Kpaddalign, /* padding for alignment */ + Knop /* no-op (configuration or spaces) */ +} KOption; + + +/* +** Read an integer numeral from string 'fmt' or return 'df' if +** there is no numeral +*/ +static int digit (int c) { return '0' <= c && c <= '9'; } + +static int getnum (const char **fmt, int df) { + if (!digit(**fmt)) /* no number? */ + return df; /* return default value */ + else { + int a = 0; + do { + a = a*10 + (*((*fmt)++) - '0'); + } while (digit(**fmt) && a <= ((int)MAXSIZE - 9)/10); + return a; + } +} + + +/* +** Read an integer numeral and raises an error if it is larger +** than the maximum size for integers. +*/ +static int getnumlimit (Header *h, const char **fmt, int df) { + int sz = getnum(fmt, df); + if (l_unlikely(sz > MAXINTSIZE || sz <= 0)) + return luaL_error(h->L, "integral size (%d) out of limits [1,%d]", + sz, MAXINTSIZE); + return sz; +} + + +/* +** Initialize Header +*/ +static void initheader (lua_State *L, Header *h) { + h->L = L; + h->islittle = nativeendian.little; + h->maxalign = 1; +} + + +/* +** Read and classify next option. 'size' is filled with option's size. +*/ +static KOption getoption (Header *h, const char **fmt, int *size) { + int opt = *((*fmt)++); + *size = 0; /* default */ + switch (opt) { + case 'b': *size = sizeof(char); return Kint; + case 'B': *size = sizeof(char); return Kuint; + case 'h': *size = sizeof(short); return Kint; + case 'H': *size = sizeof(short); return Kuint; + case 'l': *size = sizeof(long); return Kint; + case 'L': *size = sizeof(long); return Kuint; + case 'j': *size = sizeof(lua_Integer); return Kint; + case 'J': *size = sizeof(lua_Integer); return Kuint; + case 'T': *size = sizeof(size_t); return Kuint; + case 'f': *size = sizeof(float); return Kfloat; + case 'n': *size = sizeof(lua_Number); return Knumber; + case 'd': *size = sizeof(double); return Kdouble; + case 'i': *size = getnumlimit(h, fmt, sizeof(int)); return Kint; + case 'I': *size = getnumlimit(h, fmt, sizeof(int)); return Kuint; + case 's': *size = getnumlimit(h, fmt, sizeof(size_t)); return Kstring; + case 'c': + *size = getnum(fmt, -1); + if (l_unlikely(*size == -1)) + luaL_error(h->L, "missing size for format option 'c'"); + return Kchar; + case 'z': return Kzstr; + case 'x': *size = 1; return Kpadding; + case 'X': return Kpaddalign; + case ' ': break; + case '<': h->islittle = 1; break; + case '>': h->islittle = 0; break; + case '=': h->islittle = nativeendian.little; break; + case '!': h->maxalign = getnumlimit(h, fmt, MAXALIGN); break; + default: luaL_error(h->L, "invalid format option '%c'", opt); + } + return Knop; +} + + +/* +** Read, classify, and fill other details about the next option. +** 'psize' is filled with option's size, 'notoalign' with its +** alignment requirements. +** Local variable 'size' gets the size to be aligned. (Kpadal option +** always gets its full alignment, other options are limited by +** the maximum alignment ('maxalign'). Kchar option needs no alignment +** despite its size. +*/ +static KOption getdetails (Header *h, size_t totalsize, + const char **fmt, int *psize, int *ntoalign) { + KOption opt = getoption(h, fmt, psize); + int align = *psize; /* usually, alignment follows size */ + if (opt == Kpaddalign) { /* 'X' gets alignment from following option */ + if (**fmt == '\0' || getoption(h, fmt, &align) == Kchar || align == 0) + luaL_argerror(h->L, 1, "invalid next option for option 'X'"); + } + if (align <= 1 || opt == Kchar) /* need no alignment? */ + *ntoalign = 0; + else { + if (align > h->maxalign) /* enforce maximum alignment */ + align = h->maxalign; + if (l_unlikely((align & (align - 1)) != 0)) /* not a power of 2? */ + luaL_argerror(h->L, 1, "format asks for alignment not power of 2"); + *ntoalign = (align - (int)(totalsize & (align - 1))) & (align - 1); + } + return opt; +} + + +/* +** Pack integer 'n' with 'size' bytes and 'islittle' endianness. +** The final 'if' handles the case when 'size' is larger than +** the size of a Lua integer, correcting the extra sign-extension +** bytes if necessary (by default they would be zeros). +*/ +static void packint (luaL_Buffer *b, lua_Unsigned n, + int islittle, int size, int neg) { + char *buff = luaL_prepbuffsize(b, size); + int i; + buff[islittle ? 0 : size - 1] = (char)(n & MC); /* first byte */ + for (i = 1; i < size; i++) { + n >>= NB; + buff[islittle ? i : size - 1 - i] = (char)(n & MC); + } + if (neg && size > SZINT) { /* negative number need sign extension? */ + for (i = SZINT; i < size; i++) /* correct extra bytes */ + buff[islittle ? i : size - 1 - i] = (char)MC; + } + luaL_addsize(b, size); /* add result to buffer */ +} + + +/* +** Copy 'size' bytes from 'src' to 'dest', correcting endianness if +** given 'islittle' is different from native endianness. +*/ +static void copywithendian (char *dest, const char *src, + int size, int islittle) { + if (islittle == nativeendian.little) + memcpy(dest, src, size); + else { + dest += size - 1; + while (size-- != 0) + *(dest--) = *(src++); + } +} + + +static int str_pack (lua_State *L) { + luaL_Buffer b; + Header h; + const char *fmt = luaL_checkstring(L, 1); /* format string */ + int arg = 1; /* current argument to pack */ + size_t totalsize = 0; /* accumulate total size of result */ + initheader(L, &h); + lua_pushnil(L); /* mark to separate arguments from string buffer */ + luaL_buffinit(L, &b); + while (*fmt != '\0') { + int size, ntoalign; + KOption opt = getdetails(&h, totalsize, &fmt, &size, &ntoalign); + totalsize += ntoalign + size; + while (ntoalign-- > 0) + luaL_addchar(&b, LUAL_PACKPADBYTE); /* fill alignment */ + arg++; + switch (opt) { + case Kint: { /* signed integers */ + lua_Integer n = luaL_checkinteger(L, arg); + if (size < SZINT) { /* need overflow check? */ + lua_Integer lim = (lua_Integer)1 << ((size * NB) - 1); + luaL_argcheck(L, -lim <= n && n < lim, arg, "integer overflow"); + } + packint(&b, (lua_Unsigned)n, h.islittle, size, (n < 0)); + break; + } + case Kuint: { /* unsigned integers */ + lua_Integer n = luaL_checkinteger(L, arg); + if (size < SZINT) /* need overflow check? */ + luaL_argcheck(L, (lua_Unsigned)n < ((lua_Unsigned)1 << (size * NB)), + arg, "unsigned overflow"); + packint(&b, (lua_Unsigned)n, h.islittle, size, 0); + break; + } + case Kfloat: { /* C float */ + float f = (float)luaL_checknumber(L, arg); /* get argument */ + char *buff = luaL_prepbuffsize(&b, sizeof(f)); + /* move 'f' to final result, correcting endianness if needed */ + copywithendian(buff, (char *)&f, sizeof(f), h.islittle); + luaL_addsize(&b, size); + break; + } + case Knumber: { /* Lua float */ + lua_Number f = luaL_checknumber(L, arg); /* get argument */ + char *buff = luaL_prepbuffsize(&b, sizeof(f)); + /* move 'f' to final result, correcting endianness if needed */ + copywithendian(buff, (char *)&f, sizeof(f), h.islittle); + luaL_addsize(&b, size); + break; + } + case Kdouble: { /* C double */ + double f = (double)luaL_checknumber(L, arg); /* get argument */ + char *buff = luaL_prepbuffsize(&b, sizeof(f)); + /* move 'f' to final result, correcting endianness if needed */ + copywithendian(buff, (char *)&f, sizeof(f), h.islittle); + luaL_addsize(&b, size); + break; + } + case Kchar: { /* fixed-size string */ + size_t len; + const char *s = luaL_checklstring(L, arg, &len); + luaL_argcheck(L, len <= (size_t)size, arg, + "string longer than given size"); + luaL_addlstring(&b, s, len); /* add string */ + while (len++ < (size_t)size) /* pad extra space */ + luaL_addchar(&b, LUAL_PACKPADBYTE); + break; + } + case Kstring: { /* strings with length count */ + size_t len; + const char *s = luaL_checklstring(L, arg, &len); + luaL_argcheck(L, size >= (int)sizeof(size_t) || + len < ((size_t)1 << (size * NB)), + arg, "string length does not fit in given size"); + packint(&b, (lua_Unsigned)len, h.islittle, size, 0); /* pack length */ + luaL_addlstring(&b, s, len); + totalsize += len; + break; + } + case Kzstr: { /* zero-terminated string */ + size_t len; + const char *s = luaL_checklstring(L, arg, &len); + luaL_argcheck(L, strlen(s) == len, arg, "string contains zeros"); + luaL_addlstring(&b, s, len); + luaL_addchar(&b, '\0'); /* add zero at the end */ + totalsize += len + 1; + break; + } + case Kpadding: luaL_addchar(&b, LUAL_PACKPADBYTE); /* FALLTHROUGH */ + case Kpaddalign: case Knop: + arg--; /* undo increment */ + break; + } + } + luaL_pushresult(&b); + return 1; +} + + +static int str_packsize (lua_State *L) { + Header h; + const char *fmt = luaL_checkstring(L, 1); /* format string */ + size_t totalsize = 0; /* accumulate total size of result */ + initheader(L, &h); + while (*fmt != '\0') { + int size, ntoalign; + KOption opt = getdetails(&h, totalsize, &fmt, &size, &ntoalign); + luaL_argcheck(L, opt != Kstring && opt != Kzstr, 1, + "variable-length format"); + size += ntoalign; /* total space used by option */ + luaL_argcheck(L, totalsize <= MAXSIZE - size, 1, + "format result too large"); + totalsize += size; + } + lua_pushinteger(L, (lua_Integer)totalsize); + return 1; +} + + +/* +** Unpack an integer with 'size' bytes and 'islittle' endianness. +** If size is smaller than the size of a Lua integer and integer +** is signed, must do sign extension (propagating the sign to the +** higher bits); if size is larger than the size of a Lua integer, +** it must check the unread bytes to see whether they do not cause an +** overflow. +*/ +static lua_Integer unpackint (lua_State *L, const char *str, + int islittle, int size, int issigned) { + lua_Unsigned res = 0; + int i; + int limit = (size <= SZINT) ? size : SZINT; + for (i = limit - 1; i >= 0; i--) { + res <<= NB; + res |= (lua_Unsigned)(unsigned char)str[islittle ? i : size - 1 - i]; + } + if (size < SZINT) { /* real size smaller than lua_Integer? */ + if (issigned) { /* needs sign extension? */ + lua_Unsigned mask = (lua_Unsigned)1 << (size*NB - 1); + res = ((res ^ mask) - mask); /* do sign extension */ + } + } + else if (size > SZINT) { /* must check unread bytes */ + int mask = (!issigned || (lua_Integer)res >= 0) ? 0 : MC; + for (i = limit; i < size; i++) { + if (l_unlikely((unsigned char)str[islittle ? i : size - 1 - i] != mask)) + luaL_error(L, "%d-byte integer does not fit into Lua Integer", size); + } + } + return (lua_Integer)res; +} + + +static int str_unpack (lua_State *L) { + Header h; + const char *fmt = luaL_checkstring(L, 1); + size_t ld; + const char *data = luaL_checklstring(L, 2, &ld); + size_t pos = posrelatI(luaL_optinteger(L, 3, 1), ld) - 1; + int n = 0; /* number of results */ + luaL_argcheck(L, pos <= ld, 3, "initial position out of string"); + initheader(L, &h); + while (*fmt != '\0') { + int size, ntoalign; + KOption opt = getdetails(&h, pos, &fmt, &size, &ntoalign); + luaL_argcheck(L, (size_t)ntoalign + size <= ld - pos, 2, + "data string too short"); + pos += ntoalign; /* skip alignment */ + /* stack space for item + next position */ + luaL_checkstack(L, 2, "too many results"); + n++; + switch (opt) { + case Kint: + case Kuint: { + lua_Integer res = unpackint(L, data + pos, h.islittle, size, + (opt == Kint)); + lua_pushinteger(L, res); + break; + } + case Kfloat: { + float f; + copywithendian((char *)&f, data + pos, sizeof(f), h.islittle); + lua_pushnumber(L, (lua_Number)f); + break; + } + case Knumber: { + lua_Number f; + copywithendian((char *)&f, data + pos, sizeof(f), h.islittle); + lua_pushnumber(L, f); + break; + } + case Kdouble: { + double f; + copywithendian((char *)&f, data + pos, sizeof(f), h.islittle); + lua_pushnumber(L, (lua_Number)f); + break; + } + case Kchar: { + lua_pushlstring(L, data + pos, size); + break; + } + case Kstring: { + size_t len = (size_t)unpackint(L, data + pos, h.islittle, size, 0); + luaL_argcheck(L, len <= ld - pos - size, 2, "data string too short"); + lua_pushlstring(L, data + pos + size, len); + pos += len; /* skip string */ + break; + } + case Kzstr: { + size_t len = strlen(data + pos); + luaL_argcheck(L, pos + len < ld, 2, + "unfinished string for format 'z'"); + lua_pushlstring(L, data + pos, len); + pos += len + 1; /* skip string plus final '\0' */ + break; + } + case Kpaddalign: case Kpadding: case Knop: + n--; /* undo increment */ + break; + } + pos += size; + } + lua_pushinteger(L, pos + 1); /* next position */ + return n + 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}, + {"pack", str_pack}, + {"packsize", str_packsize}, + {"unpack", str_unpack}, + {NULL, NULL} +}; + + +static void createmetatable (lua_State *L) { + /* table to be metatable for strings */ + luaL_newlibtable(L, stringmetamethods); + luaL_setfuncs(L, stringmetamethods, 0); + 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/lua-5.4.3/src/ltable.c b/lua-5.4.3/src/ltable.c new file mode 100644 index 0000000..33c1ab3 --- /dev/null +++ b/lua-5.4.3/src/ltable.c @@ -0,0 +1,971 @@ +/* +** $Id: ltable.c $ +** Lua tables (hash) +** See Copyright Notice in lua.h +*/ + +#define ltable_c +#define LUA_CORE + +#include "lprefix.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 +** more than half the slots between 1 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 +#include + +#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" + + +/* +** MAXABITS is the largest integer such that MAXASIZE fits in an +** unsigned int. +*/ +#define MAXABITS cast_int(sizeof(int) * CHAR_BIT - 1) + + +/* +** MAXASIZE is the maximum size of the array part. It is the minimum +** between 2^MAXABITS and the maximum size that, measured in bytes, +** fits in a 'size_t'. +*/ +#define MAXASIZE luaM_limitN(1u << MAXABITS, TValue) + +/* +** MAXHBITS is the largest integer such that 2^MAXHBITS fits in a +** signed int. +*/ +#define MAXHBITS (MAXABITS - 1) + + +/* +** MAXHSIZE is the maximum size of the hash part. It is the minimum +** between 2^MAXHBITS and the maximum size such that, measured in bytes, +** it fits in a 'size_t'. +*/ +#define MAXHSIZE luaM_limitN(1u << MAXHBITS, Node) + + +/* +** When the original hash value is good, hashing by a power of 2 +** avoids the cost of '%'. +*/ +#define hashpow2(t,n) (gnode(t, lmod((n), sizenode(t)))) + +/* +** for other types, it is better to avoid modulo by power of 2, as +** they can have many 2 factors. +*/ +#define hashmod(t,n) (gnode(t, ((n) % ((sizenode(t)-1)|1)))) + + +#define hashstr(t,str) hashpow2(t, (str)->hash) +#define hashboolean(t,p) hashpow2(t, p) + +#define hashint(t,i) hashpow2(t, i) + + +#define hashpointer(t,p) hashmod(t, point2uint(p)) + + +#define dummynode (&dummynode_) + +static const Node dummynode_ = { + {{NULL}, LUA_VEMPTY, /* value's value and type */ + LUA_VNIL, 0, {NULL}} /* key type, next, and key value */ +}; + + +static const TValue absentkey = {ABSTKEYCONSTANT}; + + + +/* +** Hash for floating-point numbers. +** The main computation should be just +** n = frexp(n, &i); return (n * INT_MAX) + i +** but there are some numerical subtleties. +** In a two-complement representation, INT_MAX does not has an exact +** representation as a float, but INT_MIN does; because the absolute +** value of 'frexp' is smaller than 1 (unless 'n' is inf/NaN), the +** absolute value of the product 'frexp * -INT_MIN' is smaller or equal +** to INT_MAX. Next, the use of 'unsigned int' avoids overflows when +** adding 'i'; the use of '~u' (instead of '-u') avoids problems with +** INT_MIN. +*/ +#if !defined(l_hashfloat) +static int l_hashfloat (lua_Number n) { + int i; + lua_Integer ni; + n = l_mathop(frexp)(n, &i) * -cast_num(INT_MIN); + if (!lua_numbertointeger(n, &ni)) { /* is 'n' inf/-inf/NaN? */ + lua_assert(luai_numisnan(n) || l_mathop(fabs)(n) == cast_num(HUGE_VAL)); + return 0; + } + else { /* normal case */ + unsigned int u = cast_uint(i) + cast_uint(ni); + return cast_int(u <= cast_uint(INT_MAX) ? u : ~u); + } +} +#endif + + +/* +** returns the 'main' position of an element in a table (that is, +** the index of its hash value). The key comes broken (tag in 'ktt' +** and value in 'vkl') so that we can call it on keys inserted into +** nodes. +*/ +static Node *mainposition (const Table *t, int ktt, const Value *kvl) { + switch (withvariant(ktt)) { + case LUA_VNUMINT: { + lua_Integer key = ivalueraw(*kvl); + return hashint(t, key); + } + case LUA_VNUMFLT: { + lua_Number n = fltvalueraw(*kvl); + return hashmod(t, l_hashfloat(n)); + } + case LUA_VSHRSTR: { + TString *ts = tsvalueraw(*kvl); + return hashstr(t, ts); + } + case LUA_VLNGSTR: { + TString *ts = tsvalueraw(*kvl); + return hashpow2(t, luaS_hashlongstr(ts)); + } + case LUA_VFALSE: + return hashboolean(t, 0); + case LUA_VTRUE: + return hashboolean(t, 1); + case LUA_VLIGHTUSERDATA: { + void *p = pvalueraw(*kvl); + return hashpointer(t, p); + } + case LUA_VLCF: { + lua_CFunction f = fvalueraw(*kvl); + return hashpointer(t, f); + } + default: { + GCObject *o = gcvalueraw(*kvl); + return hashpointer(t, o); + } + } +} + + +/* +** Returns the main position of an element given as a 'TValue' +*/ +static Node *mainpositionTV (const Table *t, const TValue *key) { + return mainposition(t, rawtt(key), valraw(key)); +} + + +/* +** Check whether key 'k1' is equal to the key in node 'n2'. This +** equality is raw, so there are no metamethods. Floats with integer +** values have been normalized, so integers cannot be equal to +** floats. It is assumed that 'eqshrstr' is simply pointer equality, so +** that short strings are handled in the default case. +** A true 'deadok' means to accept dead keys as equal to their original +** values. All dead keys are compared in the default case, by pointer +** identity. (Only collectable objects can produce dead keys.) Note that +** dead long strings are also compared by identity. +** Once a key is dead, its corresponding value may be collected, and +** then another value can be created with the same address. If this +** other value is given to 'next', 'equalkey' will signal a false +** positive. In a regular traversal, this situation should never happen, +** as all keys given to 'next' came from the table itself, and therefore +** could not have been collected. Outside a regular traversal, we +** have garbage in, garbage out. What is relevant is that this false +** positive does not break anything. (In particular, 'next' will return +** some other valid item on the table or nil.) +*/ +static int equalkey (const TValue *k1, const Node *n2, int deadok) { + if ((rawtt(k1) != keytt(n2)) && /* not the same variants? */ + !(deadok && keyisdead(n2) && iscollectable(k1))) + return 0; /* cannot be same key */ + switch (keytt(n2)) { + case LUA_VNIL: case LUA_VFALSE: case LUA_VTRUE: + return 1; + case LUA_VNUMINT: + return (ivalue(k1) == keyival(n2)); + case LUA_VNUMFLT: + return luai_numeq(fltvalue(k1), fltvalueraw(keyval(n2))); + case LUA_VLIGHTUSERDATA: + return pvalue(k1) == pvalueraw(keyval(n2)); + case LUA_VLCF: + return fvalue(k1) == fvalueraw(keyval(n2)); + case ctb(LUA_VLNGSTR): + return luaS_eqlngstr(tsvalue(k1), keystrval(n2)); + default: + return gcvalue(k1) == gcvalueraw(keyval(n2)); + } +} + + +/* +** True if value of 'alimit' is equal to the real size of the array +** part of table 't'. (Otherwise, the array part must be larger than +** 'alimit'.) +*/ +#define limitequalsasize(t) (isrealasize(t) || ispow2((t)->alimit)) + + +/* +** Returns the real size of the 'array' array +*/ +LUAI_FUNC unsigned int luaH_realasize (const Table *t) { + if (limitequalsasize(t)) + return t->alimit; /* this is the size */ + else { + unsigned int size = t->alimit; + /* compute the smallest power of 2 not smaller than 'n' */ + size |= (size >> 1); + size |= (size >> 2); + size |= (size >> 4); + size |= (size >> 8); + size |= (size >> 16); +#if (UINT_MAX >> 30) > 3 + size |= (size >> 32); /* unsigned int has more than 32 bits */ +#endif + size++; + lua_assert(ispow2(size) && size/2 < t->alimit && t->alimit < size); + return size; + } +} + + +/* +** Check whether real size of the array is a power of 2. +** (If it is not, 'alimit' cannot be changed to any other value +** without changing the real size.) +*/ +static int ispow2realasize (const Table *t) { + return (!isrealasize(t) || ispow2(t->alimit)); +} + + +static unsigned int setlimittosize (Table *t) { + t->alimit = luaH_realasize(t); + setrealasize(t); + return t->alimit; +} + + +#define limitasasize(t) check_exp(isrealasize(t), t->alimit) + + + +/* +** "Generic" get version. (Not that generic: not valid for integers, +** which may be in array part, nor for floats with integral values.) +** See explanation about 'deadok' in function 'equalkey'. +*/ +static const TValue *getgeneric (Table *t, const TValue *key, int deadok) { + Node *n = mainpositionTV(t, key); + for (;;) { /* check whether 'key' is somewhere in the chain */ + if (equalkey(key, n, deadok)) + return gval(n); /* that's it */ + else { + int nx = gnext(n); + if (nx == 0) + return &absentkey; /* not found */ + n += nx; + } + } +} + + +/* +** returns the index for 'k' if 'k' is an appropriate key to live in +** the array part of a table, 0 otherwise. +*/ +static unsigned int arrayindex (lua_Integer k) { + if (l_castS2U(k) - 1u < MAXASIZE) /* 'k' in [1, MAXASIZE]? */ + return cast_uint(k); /* 'key' is an appropriate array index */ + else + return 0; +} + + +/* +** 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 0. +*/ +static unsigned int findindex (lua_State *L, Table *t, TValue *key, + unsigned int asize) { + unsigned int i; + if (ttisnil(key)) return 0; /* first iteration */ + i = ttisinteger(key) ? arrayindex(ivalue(key)) : 0; + if (i - 1u < asize) /* is 'key' inside array part? */ + return i; /* yes; that's the index */ + else { + const TValue *n = getgeneric(t, key, 1); + if (l_unlikely(isabstkey(n))) + luaG_runerror(L, "invalid key to 'next'"); /* key not found */ + i = cast_int(nodefromval(n) - gnode(t, 0)); /* key index in hash table */ + /* hash elements are numbered after array ones */ + return (i + 1) + asize; + } +} + + +int luaH_next (lua_State *L, Table *t, StkId key) { + unsigned int asize = luaH_realasize(t); + unsigned int i = findindex(L, t, s2v(key), asize); /* find original key */ + for (; i < asize; i++) { /* try first array part */ + if (!isempty(&t->array[i])) { /* a non-empty entry? */ + setivalue(s2v(key), i + 1); + setobj2s(L, key + 1, &t->array[i]); + return 1; + } + } + for (i -= asize; cast_int(i) < sizenode(t); i++) { /* hash part */ + if (!isempty(gval(gnode(t, i)))) { /* a non-empty entry? */ + Node *n = gnode(t, i); + getnodekey(L, s2v(key), n); + setobj2s(L, key + 1, gval(n)); + return 1; + } + } + return 0; /* no more elements */ +} + + +static void freehash (lua_State *L, Table *t) { + if (!isdummy(t)) + luaM_freearray(L, t->node, cast_sizet(sizenode(t))); +} + + +/* +** {============================================================= +** Rehash +** ============================================================== +*/ + +/* +** Compute the optimal size for the array part of table 't'. 'nums' is a +** "count array" where 'nums[i]' is the number of integers in the table +** between 2^(i - 1) + 1 and 2^i. 'pna' enters with the total number of +** integer keys in the table and leaves with the number of keys that +** will go to the array part; return the optimal size. (The condition +** 'twotoi > 0' in the for loop stops the loop if 'twotoi' overflows.) +*/ +static unsigned int computesizes (unsigned int nums[], unsigned int *pna) { + int i; + unsigned int twotoi; /* 2^i (candidate for optimal size) */ + unsigned int a = 0; /* number of elements smaller than 2^i */ + unsigned int na = 0; /* number of elements to go to array part */ + unsigned int optimal = 0; /* optimal size for array part */ + /* loop while keys can fill more than half of total size */ + for (i = 0, twotoi = 1; + twotoi > 0 && *pna > twotoi / 2; + i++, twotoi *= 2) { + a += nums[i]; + if (a > twotoi/2) { /* more than half elements present? */ + optimal = twotoi; /* optimal size (till now) */ + na = a; /* all elements up to 'optimal' will go to array part */ + } + } + lua_assert((optimal == 0 || optimal / 2 < na) && na <= optimal); + *pna = na; + return optimal; +} + + +static int countint (lua_Integer key, unsigned int *nums) { + unsigned int k = arrayindex(key); + if (k != 0) { /* is 'key' an appropriate array index? */ + nums[luaO_ceillog2(k)]++; /* count as such */ + return 1; + } + else + return 0; +} + + +/* +** Count keys in array part of table 't': Fill 'nums[i]' with +** number of keys that will go into corresponding slice and return +** total number of non-nil keys. +*/ +static unsigned int numusearray (const Table *t, unsigned int *nums) { + int lg; + unsigned int ttlg; /* 2^lg */ + unsigned int ause = 0; /* summation of 'nums' */ + unsigned int i = 1; /* count to traverse all array keys */ + unsigned int asize = limitasasize(t); /* real array size */ + /* traverse each slice */ + for (lg = 0, ttlg = 1; lg <= MAXABITS; lg++, ttlg *= 2) { + unsigned int lc = 0; /* counter */ + unsigned int lim = ttlg; + if (lim > asize) { + lim = asize; /* 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 (!isempty(&t->array[i-1])) + lc++; + } + nums[lg] += lc; + ause += lc; + } + return ause; +} + + +static int numusehash (const Table *t, unsigned int *nums, unsigned int *pna) { + int totaluse = 0; /* total number of elements */ + int ause = 0; /* elements added to 'nums' (can go to array part) */ + int i = sizenode(t); + while (i--) { + Node *n = &t->node[i]; + if (!isempty(gval(n))) { + if (keyisinteger(n)) + ause += countint(keyival(n), nums); + totaluse++; + } + } + *pna += ause; + return totaluse; +} + + +/* +** Creates an array for the hash part of a table with the given +** size, or reuses the dummy node if size is zero. +** The computation for size overflow is in two steps: the first +** comparison ensures that the shift in the second one does not +** overflow. +*/ +static void setnodevector (lua_State *L, Table *t, unsigned int size) { + if (size == 0) { /* no elements to hash part? */ + t->node = cast(Node *, dummynode); /* use common 'dummynode' */ + t->lsizenode = 0; + t->lastfree = NULL; /* signal that it is using dummy node */ + } + else { + int i; + int lsize = luaO_ceillog2(size); + if (lsize > MAXHBITS || (1u << lsize) > MAXHSIZE) + luaG_runerror(L, "table overflow"); + size = twoto(lsize); + t->node = luaM_newvector(L, size, Node); + for (i = 0; i < (int)size; i++) { + Node *n = gnode(t, i); + gnext(n) = 0; + setnilkey(n); + setempty(gval(n)); + } + t->lsizenode = cast_byte(lsize); + t->lastfree = gnode(t, size); /* all positions are free */ + } +} + + +/* +** (Re)insert all elements from the hash part of 'ot' into table 't'. +*/ +static void reinsert (lua_State *L, Table *ot, Table *t) { + int j; + int size = sizenode(ot); + for (j = 0; j < size; j++) { + Node *old = gnode(ot, j); + if (!isempty(gval(old))) { + /* doesn't need barrier/invalidate cache, as entry was + already present in the table */ + TValue k; + getnodekey(L, &k, old); + luaH_set(L, t, &k, gval(old)); + } + } +} + + +/* +** Exchange the hash part of 't1' and 't2'. +*/ +static void exchangehashpart (Table *t1, Table *t2) { + lu_byte lsizenode = t1->lsizenode; + Node *node = t1->node; + Node *lastfree = t1->lastfree; + t1->lsizenode = t2->lsizenode; + t1->node = t2->node; + t1->lastfree = t2->lastfree; + t2->lsizenode = lsizenode; + t2->node = node; + t2->lastfree = lastfree; +} + + +/* +** Resize table 't' for the new given sizes. Both allocations (for +** the hash part and for the array part) can fail, which creates some +** subtleties. If the first allocation, for the hash part, fails, an +** error is raised and that is it. Otherwise, it copies the elements from +** the shrinking part of the array (if it is shrinking) into the new +** hash. Then it reallocates the array part. If that fails, the table +** is in its original state; the function frees the new hash part and then +** raises the allocation error. Otherwise, it sets the new hash part +** into the table, initializes the new part of the array (if any) with +** nils and reinserts the elements of the old hash back into the new +** parts of the table. +*/ +void luaH_resize (lua_State *L, Table *t, unsigned int newasize, + unsigned int nhsize) { + unsigned int i; + Table newt; /* to keep the new hash part */ + unsigned int oldasize = setlimittosize(t); + TValue *newarray; + /* create new hash part with appropriate size into 'newt' */ + setnodevector(L, &newt, nhsize); + if (newasize < oldasize) { /* will array shrink? */ + t->alimit = newasize; /* pretend array has new size... */ + exchangehashpart(t, &newt); /* and new hash */ + /* re-insert into the new hash the elements from vanishing slice */ + for (i = newasize; i < oldasize; i++) { + if (!isempty(&t->array[i])) + luaH_setint(L, t, i + 1, &t->array[i]); + } + t->alimit = oldasize; /* restore current size... */ + exchangehashpart(t, &newt); /* and hash (in case of errors) */ + } + /* allocate new array */ + newarray = luaM_reallocvector(L, t->array, oldasize, newasize, TValue); + if (l_unlikely(newarray == NULL && newasize > 0)) { /* allocation failed? */ + freehash(L, &newt); /* release new hash part */ + luaM_error(L); /* raise error (with array unchanged) */ + } + /* allocation ok; initialize new part of the array */ + exchangehashpart(t, &newt); /* 't' has the new hash ('newt' has the old) */ + t->array = newarray; /* set new array part */ + t->alimit = newasize; + for (i = oldasize; i < newasize; i++) /* clear new slice of the array */ + setempty(&t->array[i]); + /* re-insert elements from old hash part into new parts */ + reinsert(L, &newt, t); /* 'newt' now has the old hash */ + freehash(L, &newt); /* free old hash part */ +} + + +void luaH_resizearray (lua_State *L, Table *t, unsigned int nasize) { + int nsize = allocsizenode(t); + luaH_resize(L, t, nasize, nsize); +} + +/* +** nums[i] = number of keys 'k' where 2^(i - 1) < k <= 2^i +*/ +static void rehash (lua_State *L, Table *t, const TValue *ek) { + unsigned int asize; /* optimal size for array part */ + unsigned int na; /* number of keys in the array part */ + unsigned int nums[MAXABITS + 1]; + int i; + int totaluse; + for (i = 0; i <= MAXABITS; i++) nums[i] = 0; /* reset counts */ + setlimittosize(t); + na = numusearray(t, nums); /* count keys in array part */ + totaluse = na; /* all those keys are integer keys */ + totaluse += numusehash(t, nums, &na); /* count keys in hash part */ + /* count extra key */ + if (ttisinteger(ek)) + na += countint(ivalue(ek), nums); + totaluse++; + /* compute new size for array part */ + asize = computesizes(nums, &na); + /* resize the table to new computed sizes */ + luaH_resize(L, t, asize, totaluse - na); +} + + + +/* +** }============================================================= +*/ + + +Table *luaH_new (lua_State *L) { + GCObject *o = luaC_newobj(L, LUA_VTABLE, sizeof(Table)); + Table *t = gco2t(o); + t->metatable = NULL; + t->flags = cast_byte(maskflags); /* table has no metamethod fields */ + t->array = NULL; + t->alimit = 0; + setnodevector(L, t, 0); + return t; +} + + +void luaH_free (lua_State *L, Table *t) { + freehash(L, t); + luaM_freearray(L, t->array, luaH_realasize(t)); + luaM_free(L, t); +} + + +static Node *getfreepos (Table *t) { + if (!isdummy(t)) { + while (t->lastfree > t->node) { + t->lastfree--; + if (keyisnil(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. +*/ +void luaH_newkey (lua_State *L, Table *t, const TValue *key, TValue *value) { + Node *mp; + TValue aux; + if (l_unlikely(ttisnil(key))) + luaG_runerror(L, "table index is nil"); + else if (ttisfloat(key)) { + lua_Number f = fltvalue(key); + lua_Integer k; + if (luaV_flttointeger(f, &k, F2Ieq)) { /* does key fit in an integer? */ + setivalue(&aux, k); + key = &aux; /* insert it as an integer */ + } + else if (l_unlikely(luai_numisnan(f))) + luaG_runerror(L, "table index is NaN"); + } + if (ttisnil(value)) + return; /* do not insert nil values */ + mp = mainpositionTV(t, key); + if (!isempty(gval(mp)) || isdummy(t)) { /* main position is taken? */ + Node *othern; + Node *f = getfreepos(t); /* get a free place */ + if (f == NULL) { /* cannot find a free place? */ + rehash(L, t, key); /* grow table */ + /* whatever called 'newkey' takes care of TM cache */ + luaH_set(L, t, key, value); /* insert key into grown table */ + return; + } + lua_assert(!isdummy(t)); + othern = mainposition(t, keytt(mp), &keyval(mp)); + if (othern != mp) { /* is colliding node out of its main position? */ + /* yes; move colliding node into free position */ + while (othern + gnext(othern) != mp) /* find previous */ + othern += gnext(othern); + gnext(othern) = cast_int(f - othern); /* rechain to point to 'f' */ + *f = *mp; /* copy colliding node into free pos. (mp->next also goes) */ + if (gnext(mp) != 0) { + gnext(f) += cast_int(mp - f); /* correct 'next' */ + gnext(mp) = 0; /* now 'mp' is free */ + } + setempty(gval(mp)); + } + else { /* colliding node is in its own main position */ + /* new node will go into free position */ + if (gnext(mp) != 0) + gnext(f) = cast_int((mp + gnext(mp)) - f); /* chain new position */ + else lua_assert(gnext(f) == 0); + gnext(mp) = cast_int(f - mp); + mp = f; + } + } + setnodekey(L, mp, key); + luaC_barrierback(L, obj2gco(t), key); + lua_assert(isempty(gval(mp))); + setobj2t(L, gval(mp), value); +} + + +/* +** Search function for integers. If integer is inside 'alimit', get it +** directly from the array part. Otherwise, if 'alimit' is not equal to +** the real size of the array, key still can be in the array part. In +** this case, try to avoid a call to 'luaH_realasize' when key is just +** one more than the limit (so that it can be incremented without +** changing the real size of the array). +*/ +const TValue *luaH_getint (Table *t, lua_Integer key) { + if (l_castS2U(key) - 1u < t->alimit) /* 'key' in [1, t->alimit]? */ + return &t->array[key - 1]; + else if (!limitequalsasize(t) && /* key still may be in the array part? */ + (l_castS2U(key) == t->alimit + 1 || + l_castS2U(key) - 1u < luaH_realasize(t))) { + t->alimit = cast_uint(key); /* probably '#t' is here now */ + return &t->array[key - 1]; + } + else { + Node *n = hashint(t, key); + for (;;) { /* check whether 'key' is somewhere in the chain */ + if (keyisinteger(n) && keyival(n) == key) + return gval(n); /* that's it */ + else { + int nx = gnext(n); + if (nx == 0) break; + n += nx; + } + } + return &absentkey; + } +} + + +/* +** search function for short strings +*/ +const TValue *luaH_getshortstr (Table *t, TString *key) { + Node *n = hashstr(t, key); + lua_assert(key->tt == LUA_VSHRSTR); + for (;;) { /* check whether 'key' is somewhere in the chain */ + if (keyisshrstr(n) && eqshrstr(keystrval(n), key)) + return gval(n); /* that's it */ + else { + int nx = gnext(n); + if (nx == 0) + return &absentkey; /* not found */ + n += nx; + } + } +} + + +const TValue *luaH_getstr (Table *t, TString *key) { + if (key->tt == LUA_VSHRSTR) + return luaH_getshortstr(t, key); + else { /* for long strings, use generic case */ + TValue ko; + setsvalue(cast(lua_State *, NULL), &ko, key); + return getgeneric(t, &ko, 0); + } +} + + +/* +** main search function +*/ +const TValue *luaH_get (Table *t, const TValue *key) { + switch (ttypetag(key)) { + case LUA_VSHRSTR: return luaH_getshortstr(t, tsvalue(key)); + case LUA_VNUMINT: return luaH_getint(t, ivalue(key)); + case LUA_VNIL: return &absentkey; + case LUA_VNUMFLT: { + lua_Integer k; + if (luaV_flttointeger(fltvalue(key), &k, F2Ieq)) /* integral index? */ + return luaH_getint(t, k); /* use specialized version */ + /* else... */ + } /* FALLTHROUGH */ + default: + return getgeneric(t, key, 0); + } +} + + +/* +** Finish a raw "set table" operation, where 'slot' is where the value +** should have been (the result of a previous "get table"). +** Beware: when using this function you probably need to check a GC +** barrier and invalidate the TM cache. +*/ +void luaH_finishset (lua_State *L, Table *t, const TValue *key, + const TValue *slot, TValue *value) { + if (isabstkey(slot)) + luaH_newkey(L, t, key, value); + else + setobj2t(L, cast(TValue *, slot), value); +} + + +/* +** beware: when using this function you probably need to check a GC +** barrier and invalidate the TM cache. +*/ +void luaH_set (lua_State *L, Table *t, const TValue *key, TValue *value) { + const TValue *slot = luaH_get(t, key); + luaH_finishset(L, t, key, slot, value); +} + + +void luaH_setint (lua_State *L, Table *t, lua_Integer key, TValue *value) { + const TValue *p = luaH_getint(t, key); + if (isabstkey(p)) { + TValue k; + setivalue(&k, key); + luaH_newkey(L, t, &k, value); + } + else + setobj2t(L, cast(TValue *, p), value); +} + + +/* +** Try to find a boundary in the hash part of table 't'. From the +** caller, we know that 'j' is zero or present and that 'j + 1' is +** present. We want to find a larger key that is absent from the +** table, so that we can do a binary search between the two keys to +** find a boundary. We keep doubling 'j' until we get an absent index. +** If the doubling would overflow, we try LUA_MAXINTEGER. If it is +** absent, we are ready for the binary search. ('j', being max integer, +** is larger or equal to 'i', but it cannot be equal because it is +** absent while 'i' is present; so 'j > i'.) Otherwise, 'j' is a +** boundary. ('j + 1' cannot be a present integer key because it is +** not a valid integer in Lua.) +*/ +static lua_Unsigned hash_search (Table *t, lua_Unsigned j) { + lua_Unsigned i; + if (j == 0) j++; /* the caller ensures 'j + 1' is present */ + do { + i = j; /* 'i' is a present index */ + if (j <= l_castS2U(LUA_MAXINTEGER) / 2) + j *= 2; + else { + j = LUA_MAXINTEGER; + if (isempty(luaH_getint(t, j))) /* t[j] not present? */ + break; /* 'j' now is an absent index */ + else /* weird case */ + return j; /* well, max integer is a boundary... */ + } + } while (!isempty(luaH_getint(t, j))); /* repeat until an absent t[j] */ + /* i < j && t[i] present && t[j] absent */ + while (j - i > 1u) { /* do a binary search between them */ + lua_Unsigned m = (i + j) / 2; + if (isempty(luaH_getint(t, m))) j = m; + else i = m; + } + return i; +} + + +static unsigned int binsearch (const TValue *array, unsigned int i, + unsigned int j) { + while (j - i > 1u) { /* binary search */ + unsigned int m = (i + j) / 2; + if (isempty(&array[m - 1])) 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 present and t[i+1] is absent, or 0 if t[1] is absent +** and 'maxinteger' if t[maxinteger] is present.) +** (In the next explanation, we use Lua indices, that is, with base 1. +** The code itself uses base 0 when indexing the array part of the table.) +** The code starts with 'limit = t->alimit', a position in the array +** part that may be a boundary. +** +** (1) If 't[limit]' is empty, there must be a boundary before it. +** As a common case (e.g., after 't[#t]=nil'), check whether 'limit-1' +** is present. If so, it is a boundary. Otherwise, do a binary search +** between 0 and limit to find a boundary. In both cases, try to +** use this boundary as the new 'alimit', as a hint for the next call. +** +** (2) If 't[limit]' is not empty and the array has more elements +** after 'limit', try to find a boundary there. Again, try first +** the special case (which should be quite frequent) where 'limit+1' +** is empty, so that 'limit' is a boundary. Otherwise, check the +** last element of the array part. If it is empty, there must be a +** boundary between the old limit (present) and the last element +** (absent), which is found with a binary search. (This boundary always +** can be a new limit.) +** +** (3) The last case is when there are no elements in the array part +** (limit == 0) or its last element (the new limit) is present. +** In this case, must check the hash part. If there is no hash part +** or 'limit+1' is absent, 'limit' is a boundary. Otherwise, call +** 'hash_search' to find a boundary in the hash part of the table. +** (In those cases, the boundary is not inside the array part, and +** therefore cannot be used as a new limit.) +*/ +lua_Unsigned luaH_getn (Table *t) { + unsigned int limit = t->alimit; + if (limit > 0 && isempty(&t->array[limit - 1])) { /* (1)? */ + /* there must be a boundary before 'limit' */ + if (limit >= 2 && !isempty(&t->array[limit - 2])) { + /* 'limit - 1' is a boundary; can it be a new limit? */ + if (ispow2realasize(t) && !ispow2(limit - 1)) { + t->alimit = limit - 1; + setnorealasize(t); /* now 'alimit' is not the real size */ + } + return limit - 1; + } + else { /* must search for a boundary in [0, limit] */ + unsigned int boundary = binsearch(t->array, 0, limit); + /* can this boundary represent the real size of the array? */ + if (ispow2realasize(t) && boundary > luaH_realasize(t) / 2) { + t->alimit = boundary; /* use it as the new limit */ + setnorealasize(t); + } + return boundary; + } + } + /* 'limit' is zero or present in table */ + if (!limitequalsasize(t)) { /* (2)? */ + /* 'limit' > 0 and array has more elements after 'limit' */ + if (isempty(&t->array[limit])) /* 'limit + 1' is empty? */ + return limit; /* this is the boundary */ + /* else, try last element in the array */ + limit = luaH_realasize(t); + if (isempty(&t->array[limit - 1])) { /* empty? */ + /* there must be a boundary in the array after old limit, + and it must be a valid new limit */ + unsigned int boundary = binsearch(t->array, t->alimit, limit); + t->alimit = boundary; + return boundary; + } + /* else, new limit is present in the table; check the hash part */ + } + /* (3) 'limit' is the last element and either is zero or present in table */ + lua_assert(limit == luaH_realasize(t) && + (limit == 0 || !isempty(&t->array[limit - 1]))); + if (isdummy(t) || isempty(luaH_getint(t, cast(lua_Integer, limit + 1)))) + return limit; /* 'limit + 1' is absent */ + else /* 'limit + 1' is also present */ + return hash_search(t, limit); +} + + + +#if defined(LUA_DEBUG) + +/* export these functions for the test library */ + +Node *luaH_mainposition (const Table *t, const TValue *key) { + return mainpositionTV(t, key); +} + +int luaH_isdummy (const Table *t) { return isdummy(t); } + +#endif diff --git a/lua-5.4.3/src/ltable.h b/lua-5.4.3/src/ltable.h new file mode 100644 index 0000000..7bbbcb2 --- /dev/null +++ b/lua-5.4.3/src/ltable.h @@ -0,0 +1,66 @@ +/* +** $Id: ltable.h $ +** 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 gval(n) (&(n)->i_val) +#define gnext(n) ((n)->u.next) + + +/* +** Clear all bits of fast-access metamethods, which means that the table +** may have any of these metamethods. (First access that fails after the +** clearing will set the bit again.) +*/ +#define invalidateTMcache(t) ((t)->flags &= ~maskflags) + + +/* true when 't' is using 'dummynode' as its hash part */ +#define isdummy(t) ((t)->lastfree == NULL) + + +/* allocated size for hash nodes */ +#define allocsizenode(t) (isdummy(t) ? 0 : sizenode(t)) + + +/* returns the Node, given the value of a table entry */ +#define nodefromval(v) cast(Node *, (v)) + + +LUAI_FUNC const TValue *luaH_getint (Table *t, lua_Integer key); +LUAI_FUNC void luaH_setint (lua_State *L, Table *t, lua_Integer key, + TValue *value); +LUAI_FUNC const TValue *luaH_getshortstr (Table *t, TString *key); +LUAI_FUNC const TValue *luaH_getstr (Table *t, TString *key); +LUAI_FUNC const TValue *luaH_get (Table *t, const TValue *key); +LUAI_FUNC void luaH_newkey (lua_State *L, Table *t, const TValue *key, + TValue *value); +LUAI_FUNC void luaH_set (lua_State *L, Table *t, const TValue *key, + TValue *value); +LUAI_FUNC void luaH_finishset (lua_State *L, Table *t, const TValue *key, + const TValue *slot, TValue *value); +LUAI_FUNC Table *luaH_new (lua_State *L); +LUAI_FUNC void luaH_resize (lua_State *L, Table *t, unsigned int nasize, + unsigned int nhsize); +LUAI_FUNC void luaH_resizearray (lua_State *L, Table *t, unsigned 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 lua_Unsigned luaH_getn (Table *t); +LUAI_FUNC unsigned int luaH_realasize (const Table *t); + + +#if defined(LUA_DEBUG) +LUAI_FUNC Node *luaH_mainposition (const Table *t, const TValue *key); +LUAI_FUNC int luaH_isdummy (const Table *t); +#endif + + +#endif diff --git a/lua-5.4.3/src/ltablib.c b/lua-5.4.3/src/ltablib.c new file mode 100644 index 0000000..d80eb80 --- /dev/null +++ b/lua-5.4.3/src/ltablib.c @@ -0,0 +1,429 @@ +/* +** $Id: ltablib.c $ +** Library for Table Manipulation +** See Copyright Notice in lua.h +*/ + +#define ltablib_c +#define LUA_LIB + +#include "lprefix.h" + + +#include +#include +#include + +#include "lua.h" + +#include "lauxlib.h" +#include "lualib.h" + + +/* +** Operations that an object must define to mimic a table +** (some functions only need some of them) +*/ +#define TAB_R 1 /* read */ +#define TAB_W 2 /* write */ +#define TAB_L 4 /* length */ +#define TAB_RW (TAB_R | TAB_W) /* read/write */ + + +#define aux_getn(L,n,w) (checktab(L, n, (w) | TAB_L), luaL_len(L, n)) + + +static int checkfield (lua_State *L, const char *key, int n) { + lua_pushstring(L, key); + return (lua_rawget(L, -n) != LUA_TNIL); +} + + +/* +** Check that 'arg' either is a table or can behave like one (that is, +** has a metatable with the required metamethods) +*/ +static void checktab (lua_State *L, int arg, int what) { + if (lua_type(L, arg) != LUA_TTABLE) { /* is it not a table? */ + int n = 1; /* number of elements to pop */ + if (lua_getmetatable(L, arg) && /* must have metatable */ + (!(what & TAB_R) || checkfield(L, "__index", ++n)) && + (!(what & TAB_W) || checkfield(L, "__newindex", ++n)) && + (!(what & TAB_L) || checkfield(L, "__len", ++n))) { + lua_pop(L, n); /* pop metatable and tested metamethods */ + } + else + luaL_checktype(L, arg, LUA_TTABLE); /* force an error */ + } +} + + +static int tinsert (lua_State *L) { + lua_Integer e = aux_getn(L, 1, TAB_RW) + 1; /* first empty element */ + lua_Integer 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: { + lua_Integer i; + pos = luaL_checkinteger(L, 2); /* 2nd argument is the position */ + /* check whether 'pos' is in [1, e] */ + luaL_argcheck(L, (lua_Unsigned)pos - 1u < (lua_Unsigned)e, 2, + "position out of bounds"); + for (i = e; i > pos; i--) { /* move up elements */ + lua_geti(L, 1, i - 1); + lua_seti(L, 1, i); /* t[i] = t[i - 1] */ + } + break; + } + default: { + return luaL_error(L, "wrong number of arguments to 'insert'"); + } + } + lua_seti(L, 1, pos); /* t[pos] = v */ + return 0; +} + + +static int tremove (lua_State *L) { + lua_Integer size = aux_getn(L, 1, TAB_RW); + lua_Integer pos = luaL_optinteger(L, 2, size); + if (pos != size) /* validate 'pos' if given */ + /* check whether 'pos' is in [1, size + 1] */ + luaL_argcheck(L, (lua_Unsigned)pos - 1u <= (lua_Unsigned)size, 1, + "position out of bounds"); + lua_geti(L, 1, pos); /* result = t[pos] */ + for ( ; pos < size; pos++) { + lua_geti(L, 1, pos + 1); + lua_seti(L, 1, pos); /* t[pos] = t[pos + 1] */ + } + lua_pushnil(L); + lua_seti(L, 1, pos); /* remove entry t[pos] */ + return 1; +} + + +/* +** Copy elements (1[f], ..., 1[e]) into (tt[t], tt[t+1], ...). Whenever +** possible, copy in increasing order, which is better for rehashing. +** "possible" means destination after original range, or smaller +** than origin, or copying to another table. +*/ +static int tmove (lua_State *L) { + lua_Integer f = luaL_checkinteger(L, 2); + lua_Integer e = luaL_checkinteger(L, 3); + lua_Integer t = luaL_checkinteger(L, 4); + int tt = !lua_isnoneornil(L, 5) ? 5 : 1; /* destination table */ + checktab(L, 1, TAB_R); + checktab(L, tt, TAB_W); + if (e >= f) { /* otherwise, nothing to move */ + lua_Integer n, i; + luaL_argcheck(L, f > 0 || e < LUA_MAXINTEGER + f, 3, + "too many elements to move"); + n = e - f + 1; /* number of elements to move */ + luaL_argcheck(L, t <= LUA_MAXINTEGER - n + 1, 4, + "destination wrap around"); + if (t > e || t <= f || (tt != 1 && !lua_compare(L, 1, tt, LUA_OPEQ))) { + for (i = 0; i < n; i++) { + lua_geti(L, 1, f + i); + lua_seti(L, tt, t + i); + } + } + else { + for (i = n - 1; i >= 0; i--) { + lua_geti(L, 1, f + i); + lua_seti(L, tt, t + i); + } + } + } + lua_pushvalue(L, tt); /* return destination table */ + return 1; +} + + +static void addfield (lua_State *L, luaL_Buffer *b, lua_Integer i) { + lua_geti(L, 1, i); + if (l_unlikely(!lua_isstring(L, -1))) + luaL_error(L, "invalid value (%s) at index %I in table for 'concat'", + luaL_typename(L, -1), i); + luaL_addvalue(b); +} + + +static int tconcat (lua_State *L) { + luaL_Buffer b; + lua_Integer last = aux_getn(L, 1, TAB_R); + size_t lsep; + const char *sep = luaL_optlstring(L, 2, "", &lsep); + lua_Integer i = luaL_optinteger(L, 3, 1); + last = luaL_optinteger(L, 4, last); + 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 tpack (lua_State *L) { + int i; + int n = lua_gettop(L); /* number of elements to pack */ + lua_createtable(L, n, 1); /* create result table */ + lua_insert(L, 1); /* put it at index 1 */ + for (i = n; i >= 1; i--) /* assign elements */ + lua_seti(L, 1, i); + lua_pushinteger(L, n); + lua_setfield(L, 1, "n"); /* t.n = number of elements */ + return 1; /* return table */ +} + + +static int tunpack (lua_State *L) { + lua_Unsigned n; + lua_Integer i = luaL_optinteger(L, 2, 1); + lua_Integer e = luaL_opt(L, luaL_checkinteger, 3, luaL_len(L, 1)); + if (i > e) return 0; /* empty range */ + n = (lua_Unsigned)e - i; /* number of elements minus 1 (avoid overflows) */ + if (l_unlikely(n >= (unsigned int)INT_MAX || + !lua_checkstack(L, (int)(++n)))) + return luaL_error(L, "too many results to unpack"); + for (; i < e; i++) { /* push arg[i..e - 1] (to avoid overflows) */ + lua_geti(L, 1, i); + } + lua_geti(L, 1, e); /* push last element */ + return (int)n; +} + +/* }====================================================== */ + + + +/* +** {====================================================== +** Quicksort +** (based on 'Algorithms in MODULA-3', Robert Sedgewick; +** Addison-Wesley, 1993.) +** ======================================================= +*/ + + +/* type for array indices */ +typedef unsigned int IdxT; + + +/* +** Produce a "random" 'unsigned int' to randomize pivot choice. This +** macro is used only when 'sort' detects a big imbalance in the result +** of a partition. (If you don't want/need this "randomness", ~0 is a +** good choice.) +*/ +#if !defined(l_randomizePivot) /* { */ + +#include + +/* size of 'e' measured in number of 'unsigned int's */ +#define sof(e) (sizeof(e) / sizeof(unsigned int)) + +/* +** Use 'time' and 'clock' as sources of "randomness". Because we don't +** know the types 'clock_t' and 'time_t', we cannot cast them to +** anything without risking overflows. A safe way to use their values +** is to copy them to an array of a known type and use the array values. +*/ +static unsigned int l_randomizePivot (void) { + clock_t c = clock(); + time_t t = time(NULL); + unsigned int buff[sof(c) + sof(t)]; + unsigned int i, rnd = 0; + memcpy(buff, &c, sof(c) * sizeof(unsigned int)); + memcpy(buff + sof(c), &t, sof(t) * sizeof(unsigned int)); + for (i = 0; i < sof(buff); i++) + rnd += buff[i]; + return rnd; +} + +#endif /* } */ + + +/* arrays larger than 'RANLIMIT' may use randomized pivots */ +#define RANLIMIT 100u + + +static void set2 (lua_State *L, IdxT i, IdxT j) { + lua_seti(L, 1, i); + lua_seti(L, 1, j); +} + + +/* +** Return true iff value at stack index 'a' is less than the value at +** index 'b' (according to the order of the sort). +*/ +static int sort_comp (lua_State *L, int a, int b) { + if (lua_isnil(L, 2)) /* no function? */ + return lua_compare(L, a, b, LUA_OPLT); /* a < b */ + else { /* function */ + int res; + lua_pushvalue(L, 2); /* push function */ + 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); /* call function */ + res = lua_toboolean(L, -1); /* get result */ + lua_pop(L, 1); /* pop result */ + return res; + } +} + + +/* +** Does the partition: Pivot P is at the top of the stack. +** precondition: a[lo] <= P == a[up-1] <= a[up], +** so it only needs to do the partition from lo + 1 to up - 2. +** Pos-condition: a[lo .. i - 1] <= a[i] == P <= a[i + 1 .. up] +** returns 'i'. +*/ +static IdxT partition (lua_State *L, IdxT lo, IdxT up) { + IdxT i = lo; /* will be incremented before first use */ + IdxT j = up - 1; /* will be decremented before first use */ + /* loop invariant: a[lo .. i] <= P <= a[j .. up] */ + for (;;) { + /* next loop: repeat ++i while a[i] < P */ + while ((void)lua_geti(L, 1, ++i), sort_comp(L, -1, -2)) { + if (l_unlikely(i == up - 1)) /* a[i] < P but a[up - 1] == P ?? */ + luaL_error(L, "invalid order function for sorting"); + lua_pop(L, 1); /* remove a[i] */ + } + /* after the loop, a[i] >= P and a[lo .. i - 1] < P */ + /* next loop: repeat --j while P < a[j] */ + while ((void)lua_geti(L, 1, --j), sort_comp(L, -3, -1)) { + if (l_unlikely(j < i)) /* j < i but a[j] > P ?? */ + luaL_error(L, "invalid order function for sorting"); + lua_pop(L, 1); /* remove a[j] */ + } + /* after the loop, a[j] <= P and a[j + 1 .. up] >= P */ + if (j < i) { /* no elements out of place? */ + /* a[lo .. i - 1] <= P <= a[j + 1 .. i .. up] */ + lua_pop(L, 1); /* pop a[j] */ + /* swap pivot (a[up - 1]) with a[i] to satisfy pos-condition */ + set2(L, up - 1, i); + return i; + } + /* otherwise, swap a[i] - a[j] to restore invariant and repeat */ + set2(L, i, j); + } +} + + +/* +** Choose an element in the middle (2nd-3th quarters) of [lo,up] +** "randomized" by 'rnd' +*/ +static IdxT choosePivot (IdxT lo, IdxT up, unsigned int rnd) { + IdxT r4 = (up - lo) / 4; /* range/4 */ + IdxT p = rnd % (r4 * 2) + (lo + r4); + lua_assert(lo + r4 <= p && p <= up - r4); + return p; +} + + +/* +** Quicksort algorithm (recursive function) +*/ +static void auxsort (lua_State *L, IdxT lo, IdxT up, + unsigned int rnd) { + while (lo < up) { /* loop for tail recursion */ + IdxT p; /* Pivot index */ + IdxT n; /* to be used later */ + /* sort elements 'lo', 'p', and 'up' */ + lua_geti(L, 1, lo); + lua_geti(L, 1, up); + if (sort_comp(L, -1, -2)) /* a[up] < a[lo]? */ + set2(L, lo, up); /* swap a[lo] - a[up] */ + else + lua_pop(L, 2); /* remove both values */ + if (up - lo == 1) /* only 2 elements? */ + return; /* already sorted */ + if (up - lo < RANLIMIT || rnd == 0) /* small interval or no randomize? */ + p = (lo + up)/2; /* middle element is a good pivot */ + else /* for larger intervals, it is worth a random pivot */ + p = choosePivot(lo, up, rnd); + lua_geti(L, 1, p); + lua_geti(L, 1, lo); + if (sort_comp(L, -2, -1)) /* a[p] < a[lo]? */ + set2(L, p, lo); /* swap a[p] - a[lo] */ + else { + lua_pop(L, 1); /* remove a[lo] */ + lua_geti(L, 1, up); + if (sort_comp(L, -1, -2)) /* a[up] < a[p]? */ + set2(L, p, up); /* swap a[up] - a[p] */ + else + lua_pop(L, 2); + } + if (up - lo == 2) /* only 3 elements? */ + return; /* already sorted */ + lua_geti(L, 1, p); /* get middle element (Pivot) */ + lua_pushvalue(L, -1); /* push Pivot */ + lua_geti(L, 1, up - 1); /* push a[up - 1] */ + set2(L, p, up - 1); /* swap Pivot (a[p]) with a[up - 1] */ + p = partition(L, lo, up); + /* a[lo .. p - 1] <= a[p] == P <= a[p + 1 .. up] */ + if (p - lo < up - p) { /* lower interval is smaller? */ + auxsort(L, lo, p - 1, rnd); /* call recursively for lower interval */ + n = p - lo; /* size of smaller interval */ + lo = p + 1; /* tail call for [p + 1 .. up] (upper interval) */ + } + else { + auxsort(L, p + 1, up, rnd); /* call recursively for upper interval */ + n = up - p; /* size of smaller interval */ + up = p - 1; /* tail call for [lo .. p - 1] (lower interval) */ + } + if ((up - lo) / 128 > n) /* partition too imbalanced? */ + rnd = l_randomizePivot(); /* try a new randomization */ + } /* tail call auxsort(L, lo, up, rnd) */ +} + + +static int sort (lua_State *L) { + lua_Integer n = aux_getn(L, 1, TAB_RW); + if (n > 1) { /* non-trivial interval? */ + luaL_argcheck(L, n < INT_MAX, 1, "array too big"); + if (!lua_isnoneornil(L, 2)) /* is there a 2nd argument? */ + luaL_checktype(L, 2, LUA_TFUNCTION); /* must be a function */ + lua_settop(L, 2); /* make sure there are two arguments */ + auxsort(L, 1, (IdxT)n, 0); + } + return 0; +} + +/* }====================================================== */ + + +static const luaL_Reg tab_funcs[] = { + {"concat", tconcat}, + {"insert", tinsert}, + {"pack", tpack}, + {"unpack", tunpack}, + {"remove", tremove}, + {"move", tmove}, + {"sort", sort}, + {NULL, NULL} +}; + + +LUAMOD_API int luaopen_table (lua_State *L) { + luaL_newlib(L, tab_funcs); + return 1; +} + diff --git a/lua-5.4.3/src/ltm.c b/lua-5.4.3/src/ltm.c new file mode 100644 index 0000000..b657b78 --- /dev/null +++ b/lua-5.4.3/src/ltm.c @@ -0,0 +1,271 @@ +/* +** $Id: ltm.c $ +** Tag methods +** See Copyright Notice in lua.h +*/ + +#define ltm_c +#define LUA_CORE + +#include "lprefix.h" + + +#include + +#include "lua.h" + +#include "ldebug.h" +#include "ldo.h" +#include "lgc.h" +#include "lobject.h" +#include "lstate.h" +#include "lstring.h" +#include "ltable.h" +#include "ltm.h" +#include "lvm.h" + + +static const char udatatypename[] = "userdata"; + +LUAI_DDEF const char *const luaT_typenames_[LUA_TOTALTYPES] = { + "no value", + "nil", "boolean", udatatypename, "number", + "string", "table", "function", udatatypename, "thread", + "upvalue", "proto" /* these last 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", "__mod", "__pow", + "__div", "__idiv", + "__band", "__bor", "__bxor", "__shl", "__shr", + "__unm", "__bnot", "__lt", "__le", + "__concat", "__call", "__close" + }; + int i; + for (i=0; itmname[i] = luaS_new(L, luaT_eventname[i]); + luaC_fix(L, obj2gco(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_getshortstr(events, ename); + lua_assert(event <= TM_EQ); + if (notm(tm)) { /* no tag method? */ + events->flags |= cast_byte(1u<metatable; + break; + case LUA_TUSERDATA: + mt = uvalue(o)->metatable; + break; + default: + mt = G(L)->mt[ttype(o)]; + } + return (mt ? luaH_getshortstr(mt, G(L)->tmname[event]) : &G(L)->nilvalue); +} + + +/* +** Return the name of the type of an object. For tables and userdata +** with metatable, use their '__name' metafield, if present. +*/ +const char *luaT_objtypename (lua_State *L, const TValue *o) { + Table *mt; + if ((ttistable(o) && (mt = hvalue(o)->metatable) != NULL) || + (ttisfulluserdata(o) && (mt = uvalue(o)->metatable) != NULL)) { + const TValue *name = luaH_getshortstr(mt, luaS_new(L, "__name")); + if (ttisstring(name)) /* is '__name' a string? */ + return getstr(tsvalue(name)); /* use it as type name */ + } + return ttypename(ttype(o)); /* else use standard type name */ +} + + +void luaT_callTM (lua_State *L, const TValue *f, const TValue *p1, + const TValue *p2, const TValue *p3) { + StkId func = L->top; + setobj2s(L, func, f); /* push function (assume EXTRA_STACK) */ + setobj2s(L, func + 1, p1); /* 1st argument */ + setobj2s(L, func + 2, p2); /* 2nd argument */ + setobj2s(L, func + 3, p3); /* 3rd argument */ + L->top = func + 4; + /* metamethod may yield only when called from Lua code */ + if (isLuacode(L->ci)) + luaD_call(L, func, 0); + else + luaD_callnoyield(L, func, 0); +} + + +void luaT_callTMres (lua_State *L, const TValue *f, const TValue *p1, + const TValue *p2, StkId res) { + ptrdiff_t result = savestack(L, res); + StkId func = L->top; + setobj2s(L, func, f); /* push function (assume EXTRA_STACK) */ + setobj2s(L, func + 1, p1); /* 1st argument */ + setobj2s(L, func + 2, p2); /* 2nd argument */ + L->top += 3; + /* metamethod may yield only when called from Lua code */ + if (isLuacode(L->ci)) + luaD_call(L, func, 1); + else + luaD_callnoyield(L, func, 1); + res = restorestack(L, result); + setobjs2s(L, res, --L->top); /* move result to its place */ +} + + +static int callbinTM (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 (notm(tm)) + tm = luaT_gettmbyobj(L, p2, event); /* try second operand */ + if (notm(tm)) return 0; + luaT_callTMres(L, tm, p1, p2, res); + return 1; +} + + +void luaT_trybinTM (lua_State *L, const TValue *p1, const TValue *p2, + StkId res, TMS event) { + if (l_unlikely(!callbinTM(L, p1, p2, res, event))) { + switch (event) { + case TM_BAND: case TM_BOR: case TM_BXOR: + case TM_SHL: case TM_SHR: case TM_BNOT: { + if (ttisnumber(p1) && ttisnumber(p2)) + luaG_tointerror(L, p1, p2); + else + luaG_opinterror(L, p1, p2, "perform bitwise operation on"); + } + /* calls never return, but to avoid warnings: *//* FALLTHROUGH */ + default: + luaG_opinterror(L, p1, p2, "perform arithmetic on"); + } + } +} + + +void luaT_tryconcatTM (lua_State *L) { + StkId top = L->top; + if (l_unlikely(!callbinTM(L, s2v(top - 2), s2v(top - 1), top - 2, + TM_CONCAT))) + luaG_concaterror(L, s2v(top - 2), s2v(top - 1)); +} + + +void luaT_trybinassocTM (lua_State *L, const TValue *p1, const TValue *p2, + int flip, StkId res, TMS event) { + if (flip) + luaT_trybinTM(L, p2, p1, res, event); + else + luaT_trybinTM(L, p1, p2, res, event); +} + + +void luaT_trybiniTM (lua_State *L, const TValue *p1, lua_Integer i2, + int flip, StkId res, TMS event) { + TValue aux; + setivalue(&aux, i2); + luaT_trybinassocTM(L, p1, &aux, flip, res, event); +} + + +/* +** Calls an order tag method. +** For lessequal, LUA_COMPAT_LT_LE keeps compatibility with old +** behavior: if there is no '__le', try '__lt', based on l <= r iff +** !(r < l) (assuming a total order). If the metamethod yields during +** this substitution, the continuation has to know about it (to negate +** the result of rtop, event)) /* try original event */ + return !l_isfalse(s2v(L->top)); +#if defined(LUA_COMPAT_LT_LE) + else if (event == TM_LE) { + /* try '!(p2 < p1)' for '(p1 <= p2)' */ + L->ci->callstatus |= CIST_LEQ; /* mark it is doing 'lt' for 'le' */ + if (callbinTM(L, p2, p1, L->top, TM_LT)) { + L->ci->callstatus ^= CIST_LEQ; /* clear mark */ + return l_isfalse(s2v(L->top)); + } + /* else error will remove this 'ci'; no need to clear mark */ + } +#endif + luaG_ordererror(L, p1, p2); /* no metamethod found */ + return 0; /* to avoid warnings */ +} + + +int luaT_callorderiTM (lua_State *L, const TValue *p1, int v2, + int flip, int isfloat, TMS event) { + TValue aux; const TValue *p2; + if (isfloat) { + setfltvalue(&aux, cast_num(v2)); + } + else + setivalue(&aux, v2); + if (flip) { /* arguments were exchanged? */ + p2 = p1; p1 = &aux; /* correct them */ + } + else + p2 = &aux; + return luaT_callorderTM(L, p1, p2, event); +} + + +void luaT_adjustvarargs (lua_State *L, int nfixparams, CallInfo *ci, + const Proto *p) { + int i; + int actual = cast_int(L->top - ci->func) - 1; /* number of arguments */ + int nextra = actual - nfixparams; /* number of extra arguments */ + ci->u.l.nextraargs = nextra; + luaD_checkstack(L, p->maxstacksize + 1); + /* copy function to the top of the stack */ + setobjs2s(L, L->top++, ci->func); + /* move fixed parameters to the top of the stack */ + for (i = 1; i <= nfixparams; i++) { + setobjs2s(L, L->top++, ci->func + i); + setnilvalue(s2v(ci->func + i)); /* erase original parameter (for GC) */ + } + ci->func += actual + 1; + ci->top += actual + 1; + lua_assert(L->top <= ci->top && ci->top <= L->stack_last); +} + + +void luaT_getvarargs (lua_State *L, CallInfo *ci, StkId where, int wanted) { + int i; + int nextra = ci->u.l.nextraargs; + if (wanted < 0) { + wanted = nextra; /* get all extra arguments available */ + checkstackGCp(L, nextra, where); /* ensure stack space */ + L->top = where + nextra; /* next instruction will need top */ + } + for (i = 0; i < wanted && i < nextra; i++) + setobjs2s(L, where + i, ci->func - nextra + i); + for (; i < wanted; i++) /* complete required results with nil */ + setnilvalue(s2v(where + i)); +} + diff --git a/lua-5.4.3/src/ltm.h b/lua-5.4.3/src/ltm.h new file mode 100644 index 0000000..73b833c --- /dev/null +++ b/lua-5.4.3/src/ltm.h @@ -0,0 +1,103 @@ +/* +** $Id: ltm.h $ +** 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" and "ORDER OP" +*/ +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_MOD, + TM_POW, + TM_DIV, + TM_IDIV, + TM_BAND, + TM_BOR, + TM_BXOR, + TM_SHL, + TM_SHR, + TM_UNM, + TM_BNOT, + TM_LT, + TM_LE, + TM_CONCAT, + TM_CALL, + TM_CLOSE, + TM_N /* number of elements in the enum */ +} TMS; + + +/* +** Mask with 1 in all fast-access methods. A 1 in any of these bits +** in the flag of a (meta)table means the metatable does not have the +** corresponding metamethod field. (Bit 7 of the flag is used for +** 'isrealasize'.) +*/ +#define maskflags (~(~0u << (TM_EQ + 1))) + + +/* +** Test whether there is no tagmethod. +** (Because tagmethods use raw accesses, the result may be an "empty" nil.) +*/ +#define notm(tm) ttisnil(tm) + + +#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] + +LUAI_DDEC(const char *const luaT_typenames_[LUA_TOTALTYPES];) + + +LUAI_FUNC const char *luaT_objtypename (lua_State *L, const TValue *o); + +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); + +LUAI_FUNC void luaT_callTM (lua_State *L, const TValue *f, const TValue *p1, + const TValue *p2, const TValue *p3); +LUAI_FUNC void luaT_callTMres (lua_State *L, const TValue *f, + const TValue *p1, const TValue *p2, StkId p3); +LUAI_FUNC void luaT_trybinTM (lua_State *L, const TValue *p1, const TValue *p2, + StkId res, TMS event); +LUAI_FUNC void luaT_tryconcatTM (lua_State *L); +LUAI_FUNC void luaT_trybinassocTM (lua_State *L, const TValue *p1, + const TValue *p2, int inv, StkId res, TMS event); +LUAI_FUNC void luaT_trybiniTM (lua_State *L, const TValue *p1, lua_Integer i2, + int inv, StkId res, TMS event); +LUAI_FUNC int luaT_callorderTM (lua_State *L, const TValue *p1, + const TValue *p2, TMS event); +LUAI_FUNC int luaT_callorderiTM (lua_State *L, const TValue *p1, int v2, + int inv, int isfloat, TMS event); + +LUAI_FUNC void luaT_adjustvarargs (lua_State *L, int nfixparams, + struct CallInfo *ci, const Proto *p); +LUAI_FUNC void luaT_getvarargs (lua_State *L, struct CallInfo *ci, + StkId where, int wanted); + + +#endif diff --git a/lua-5.4.3/src/lua.c b/lua-5.4.3/src/lua.c new file mode 100644 index 0000000..46b48db --- /dev/null +++ b/lua-5.4.3/src/lua.c @@ -0,0 +1,659 @@ +/* +** $Id: lua.c $ +** Lua stand-alone interpreter +** See Copyright Notice in lua.h +*/ + +#define lua_c + +#include "lprefix.h" + + +#include +#include +#include + +#include + +#include "lua.h" + +#include "lauxlib.h" +#include "lualib.h" + + +#if !defined(LUA_PROGNAME) +#define LUA_PROGNAME "lua" +#endif + +#if !defined(LUA_INIT_VAR) +#define LUA_INIT_VAR "LUA_INIT" +#endif + +#define LUA_INITVARVERSION LUA_INIT_VAR LUA_VERSUFFIX + + +static lua_State *globalL = NULL; + +static const char *progname = LUA_PROGNAME; + + +#if defined(LUA_USE_POSIX) /* { */ + +/* +** Use 'sigaction' when available. +*/ +static void setsignal (int sig, void (*handler)(int)) { + struct sigaction sa; + sa.sa_handler = handler; + sa.sa_flags = 0; + sigemptyset(&sa.sa_mask); /* do not mask any signal */ + sigaction(sig, &sa, NULL); +} + +#else /* }{ */ + +#define setsignal signal + +#endif /* } */ + + +/* +** Hook set by signal function to stop the interpreter. +*/ +static void lstop (lua_State *L, lua_Debug *ar) { + (void)ar; /* unused arg. */ + lua_sethook(L, NULL, 0, 0); /* reset hook */ + luaL_error(L, "interrupted!"); +} + + +/* +** Function to be called at a C signal. Because a C signal cannot +** just change a Lua state (as there is no proper synchronization), +** this function only sets a hook that, when called, will stop the +** interpreter. +*/ +static void laction (int i) { + int flag = LUA_MASKCALL | LUA_MASKRET | LUA_MASKLINE | LUA_MASKCOUNT; + setsignal(i, SIG_DFL); /* if another SIGINT happens, terminate process */ + lua_sethook(globalL, lstop, flag, 1); +} + + +static void print_usage (const char *badoption) { + lua_writestringerror("%s: ", progname); + if (badoption[1] == 'e' || badoption[1] == 'l') + lua_writestringerror("'%s' needs argument\n", badoption); + else + lua_writestringerror("unrecognized option '%s'\n", badoption); + lua_writestringerror( + "usage: %s [options] [script [args]]\n" + "Available options are:\n" + " -e stat execute string 'stat'\n" + " -i enter interactive mode after executing 'script'\n" + " -l name require library 'name' into global 'name'\n" + " -v show version information\n" + " -E ignore environment variables\n" + " -W turn warnings on\n" + " -- stop handling options\n" + " - stop handling options and execute stdin\n" + , + progname); +} + + +/* +** Prints an error message, adding the program name in front of it +** (if present) +*/ +static void l_message (const char *pname, const char *msg) { + if (pname) lua_writestringerror("%s: ", pname); + lua_writestringerror("%s\n", msg); +} + + +/* +** Check whether 'status' is not OK and, if so, prints the error +** message on the top of the stack. It assumes that the error object +** is a string, as it was either generated by Lua or by 'msghandler'. +*/ +static int report (lua_State *L, int status) { + if (status != LUA_OK) { + const char *msg = lua_tostring(L, -1); + l_message(progname, msg); + lua_pop(L, 1); /* remove message */ + } + return status; +} + + +/* +** Message handler used to run all chunks +*/ +static int msghandler (lua_State *L) { + const char *msg = lua_tostring(L, 1); + if (msg == NULL) { /* is error object not a string? */ + if (luaL_callmeta(L, 1, "__tostring") && /* does it have a metamethod */ + lua_type(L, -1) == LUA_TSTRING) /* that produces a string? */ + return 1; /* that is the message */ + else + msg = lua_pushfstring(L, "(error object is a %s value)", + luaL_typename(L, 1)); + } + luaL_traceback(L, L, msg, 1); /* append a standard traceback */ + return 1; /* return the traceback */ +} + + +/* +** Interface to 'lua_pcall', which sets appropriate message function +** and C-signal handler. Used to run all chunks. +*/ +static int docall (lua_State *L, int narg, int nres) { + int status; + int base = lua_gettop(L) - narg; /* function index */ + lua_pushcfunction(L, msghandler); /* push message handler */ + lua_insert(L, base); /* put it under function and args */ + globalL = L; /* to be available to 'laction' */ + setsignal(SIGINT, laction); /* set C-signal handler */ + status = lua_pcall(L, narg, nres, base); + setsignal(SIGINT, SIG_DFL); /* reset C-signal handler */ + lua_remove(L, base); /* remove message handler from the stack */ + return status; +} + + +static void print_version (void) { + lua_writestring(LUA_COPYRIGHT, strlen(LUA_COPYRIGHT)); + lua_writeline(); +} + + +/* +** Create the 'arg' table, which stores all arguments from the +** command line ('argv'). It should be aligned so that, at index 0, +** it has 'argv[script]', which is the script name. The arguments +** to the script (everything after 'script') go to positive indices; +** other arguments (before the script name) go to negative indices. +** If there is no script name, assume interpreter's name as base. +*/ +static void createargtable (lua_State *L, char **argv, int argc, int script) { + int i, narg; + if (script == argc) script = 0; /* no script name? */ + narg = argc - (script + 1); /* number of positive indices */ + lua_createtable(L, narg, script + 1); + for (i = 0; i < argc; i++) { + lua_pushstring(L, argv[i]); + lua_rawseti(L, -2, i - script); + } + lua_setglobal(L, "arg"); +} + + +static int dochunk (lua_State *L, int status) { + if (status == LUA_OK) status = docall(L, 0, 0); + return report(L, status); +} + + +static int dofile (lua_State *L, const char *name) { + return dochunk(L, luaL_loadfile(L, name)); +} + + +static int dostring (lua_State *L, const char *s, const char *name) { + return dochunk(L, luaL_loadbuffer(L, s, strlen(s), name)); +} + + +/* +** Calls 'require(name)' and stores the result in a global variable +** with the given name. +*/ +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); +} + + +/* +** Push on the stack the contents of table 'arg' from 1 to #arg +*/ +static int pushargs (lua_State *L) { + int i, n; + if (lua_getglobal(L, "arg") != LUA_TTABLE) + luaL_error(L, "'arg' is not a table"); + n = (int)luaL_len(L, -1); + luaL_checkstack(L, n + 3, "too many arguments to script"); + for (i = 1; i <= n; i++) + lua_rawgeti(L, -i, i); + lua_remove(L, -i); /* remove table from the stack */ + return n; +} + + +static int handle_script (lua_State *L, char **argv) { + int status; + const char *fname = argv[0]; + if (strcmp(fname, "-") == 0 && strcmp(argv[-1], "--") != 0) + fname = NULL; /* stdin */ + status = luaL_loadfile(L, fname); + if (status == LUA_OK) { + int n = pushargs(L); /* push arguments to script */ + status = docall(L, n, LUA_MULTRET); + } + return report(L, status); +} + + +/* bits of various argument indicators in 'args' */ +#define has_error 1 /* bad option */ +#define has_i 2 /* -i */ +#define has_v 4 /* -v */ +#define has_e 8 /* -e */ +#define has_E 16 /* -E */ + + +/* +** Traverses all arguments from 'argv', returning a mask with those +** needed before running any Lua code (or an error code if it finds +** any invalid argument). 'first' returns the first not-handled argument +** (either the script name or a bad argument in case of error). +*/ +static int collectargs (char **argv, int *first) { + int args = 0; + int i; + for (i = 1; argv[i] != NULL; i++) { + *first = i; + if (argv[i][0] != '-') /* not an option? */ + return args; /* stop handling options */ + switch (argv[i][1]) { /* else check option */ + case '-': /* '--' */ + if (argv[i][2] != '\0') /* extra characters after '--'? */ + return has_error; /* invalid option */ + *first = i + 1; + return args; + case '\0': /* '-' */ + return args; /* script "name" is '-' */ + case 'E': + if (argv[i][2] != '\0') /* extra characters? */ + return has_error; /* invalid option */ + args |= has_E; + break; + case 'W': + if (argv[i][2] != '\0') /* extra characters? */ + return has_error; /* invalid option */ + break; + case 'i': + args |= has_i; /* (-i implies -v) *//* FALLTHROUGH */ + case 'v': + if (argv[i][2] != '\0') /* extra characters? */ + return has_error; /* invalid option */ + args |= has_v; + break; + case 'e': + args |= has_e; /* FALLTHROUGH */ + 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 has_error; /* no next argument or it is another option */ + } + break; + default: /* invalid option */ + return has_error; + } + } + *first = i; /* no script name */ + return args; +} + + +/* +** Processes options 'e' and 'l', which involve running Lua code, and +** 'W', which also affects the state. +** Returns 0 if some code raises an error. +*/ +static int runargs (lua_State *L, char **argv, int n) { + int i; + for (i = 1; i < n; i++) { + int option = argv[i][1]; + lua_assert(argv[i][0] == '-'); /* already checked */ + switch (option) { + case 'e': case 'l': { + int status; + const char *extra = argv[i] + 2; /* both options need an argument */ + if (*extra == '\0') extra = argv[++i]; + lua_assert(extra != NULL); + status = (option == 'e') + ? dostring(L, extra, "=(command line)") + : dolibrary(L, extra); + if (status != LUA_OK) return 0; + break; + } + case 'W': + lua_warning(L, "@on", 0); /* warnings on */ + break; + } + } + return 1; +} + + +static int handle_luainit (lua_State *L) { + const char *name = "=" LUA_INITVARVERSION; + const char *init = getenv(name + 1); + if (init == NULL) { + name = "=" LUA_INIT_VAR; + 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); +} + + +/* +** {================================================================== +** Read-Eval-Print Loop (REPL) +** =================================================================== +*/ + +#if !defined(LUA_PROMPT) +#define LUA_PROMPT "> " +#define LUA_PROMPT2 ">> " +#endif + +#if !defined(LUA_MAXINPUT) +#define LUA_MAXINPUT 512 +#endif + + +/* +** lua_stdin_is_tty detects whether the standard input is a 'tty' (that +** is, whether we're running lua interactively). +*/ +#if !defined(lua_stdin_is_tty) /* { */ + +#if defined(LUA_USE_POSIX) /* { */ + +#include +#define lua_stdin_is_tty() isatty(0) + +#elif defined(LUA_USE_WINDOWS) /* }{ */ + +#include +#include + +#define lua_stdin_is_tty() _isatty(_fileno(stdin)) + +#else /* }{ */ + +/* ISO C definition */ +#define lua_stdin_is_tty() 1 /* assume stdin is a tty */ + +#endif /* } */ + +#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_readline) /* { */ + +#if defined(LUA_USE_READLINE) /* { */ + +#include +#include +#define lua_initreadline(L) ((void)L, rl_readline_name="lua") +#define lua_readline(L,b,p) ((void)L, ((b)=readline(p)) != NULL) +#define lua_saveline(L,line) ((void)L, add_history(line)) +#define lua_freeline(L,b) ((void)L, free(b)) + +#else /* }{ */ + +#define lua_initreadline(L) ((void)L) +#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,line) { (void)L; (void)line; } +#define lua_freeline(L,b) { (void)L; (void)b; } + +#endif /* } */ + +#endif /* } */ + + +/* +** Return the string to be used as a prompt by the interpreter. Leave +** the string (or nil, if using the default value) on the stack, to keep +** it anchored. +*/ +static const char *get_prompt (lua_State *L, int firstline) { + if (lua_getglobal(L, firstline ? "_PROMPT" : "_PROMPT2") == LUA_TNIL) + return (firstline ? LUA_PROMPT : LUA_PROMPT2); /* use the default */ + else { /* apply 'tostring' over the value */ + const char *p = luaL_tolstring(L, -1, NULL); + lua_remove(L, -2); /* remove original value */ + return p; + } +} + +/* mark in error messages for incomplete statements */ +#define EOFMARK "" +#define marklen (sizeof(EOFMARK)/sizeof(char) - 1) + + +/* +** Check whether 'status' signals a syntax error and the error +** message at the top of the stack ends with the above mark for +** incomplete statements. +*/ +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... */ +} + + +/* +** Prompt the user, read a line, and push it into the Lua stack. +*/ +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); + if (readstatus == 0) + return 0; /* no input (prompt will be popped by caller) */ + lua_pop(L, 1); /* remove prompt */ + l = strlen(b); + if (l > 0 && b[l-1] == '\n') /* line ends with newline? */ + b[--l] = '\0'; /* remove it */ + if (firstline && b[0] == '=') /* for compatibility with 5.2, ... */ + lua_pushfstring(L, "return %s", b + 1); /* change '=' to 'return' */ + else + lua_pushlstring(L, b, l); + lua_freeline(L, b); + return 1; +} + + +/* +** Try to compile line on the stack as 'return ;'; on return, stack +** has either compiled chunk or original line (if compilation failed). +*/ +static int addreturn (lua_State *L) { + const char *line = lua_tostring(L, -1); /* original line */ + const char *retline = lua_pushfstring(L, "return %s;", line); + int status = luaL_loadbuffer(L, retline, strlen(retline), "=stdin"); + if (status == LUA_OK) { + lua_remove(L, -2); /* remove modified line */ + if (line[0] != '\0') /* non empty? */ + lua_saveline(L, line); /* keep history */ + } + else + lua_pop(L, 2); /* pop result from 'luaL_loadbuffer' and modified line */ + return status; +} + + +/* +** Read multiple lines until a complete Lua statement +*/ +static int multiline (lua_State *L) { + for (;;) { /* repeat until gets a complete statement */ + size_t len; + const char *line = lua_tolstring(L, 1, &len); /* get what it has */ + int status = luaL_loadbuffer(L, line, len, "=stdin"); /* try it */ + if (!incomplete(L, status) || !pushline(L, 0)) { + lua_saveline(L, line); /* keep history */ + return status; /* cannot or should not try to add continuation line */ + } + lua_pushliteral(L, "\n"); /* add newline... */ + lua_insert(L, -2); /* ...between the two lines */ + lua_concat(L, 3); /* join them */ + } +} + + +/* +** Read a line and try to load (compile) it first as an expression (by +** adding "return " in front of it) and second as a statement. Return +** the final status of load/call with the resulting function (if any) +** in the top of the stack. +*/ +static int loadline (lua_State *L) { + int status; + lua_settop(L, 0); + if (!pushline(L, 1)) + return -1; /* no input */ + if ((status = addreturn(L)) != LUA_OK) /* 'return ...' did not work? */ + status = multiline(L); /* try as command, maybe with continuation lines */ + lua_remove(L, 1); /* remove line from the stack */ + lua_assert(lua_gettop(L) == 1); + return status; +} + + +/* +** Prints (calling the Lua 'print' function) any values on the stack +*/ +static void l_print (lua_State *L) { + int n = lua_gettop(L); + if (n > 0) { /* any result to be printed? */ + luaL_checkstack(L, LUA_MINSTACK, "too many results to print"); + lua_getglobal(L, "print"); + lua_insert(L, 1); + if (lua_pcall(L, n, 0, 0) != LUA_OK) + l_message(progname, lua_pushfstring(L, "error calling 'print' (%s)", + lua_tostring(L, -1))); + } +} + + +/* +** Do the REPL: repeatedly read (load) a line, evaluate (call) it, and +** print any results. +*/ +static void doREPL (lua_State *L) { + int status; + const char *oldprogname = progname; + progname = NULL; /* no 'progname' on errors in interactive mode */ + lua_initreadline(L); + while ((status = loadline(L)) != -1) { + if (status == LUA_OK) + status = docall(L, 0, LUA_MULTRET); + if (status == LUA_OK) l_print(L); + else report(L, status); + } + lua_settop(L, 0); /* clear stack */ + lua_writeline(); + progname = oldprogname; +} + +/* }================================================================== */ + + +/* +** Main body of stand-alone interpreter (to be called in protected mode). +** Reads the options and handles them all. +*/ +static int pmain (lua_State *L) { + int argc = (int)lua_tointeger(L, 1); + char **argv = (char **)lua_touserdata(L, 2); + int script; + int args = collectargs(argv, &script); + luaL_checkversion(L); /* check that interpreter has correct version */ + if (argv[0] && argv[0][0]) progname = argv[0]; + if (args == has_error) { /* bad arg? */ + print_usage(argv[script]); /* 'script' has index of bad arg. */ + return 0; + } + if (args & has_v) /* option '-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"); + } + luaL_openlibs(L); /* open standard libraries */ + createargtable(L, argv, argc, script); /* create table 'arg' */ + lua_gc(L, LUA_GCGEN, 0, 0); /* GC in generational mode */ + if (!(args & has_E)) { /* no option '-E'? */ + if (handle_luainit(L) != LUA_OK) /* run LUA_INIT */ + return 0; /* error running LUA_INIT */ + } + if (!runargs(L, argv, script)) /* execute arguments -e and -l */ + return 0; /* something failed */ + if (script < argc && /* execute main script (if there is one) */ + handle_script(L, argv + script) != LUA_OK) + return 0; + if (args & has_i) /* -i option? */ + doREPL(L); /* do read-eval-print loop */ + else if (script == argc && !(args & (has_e | has_v))) { /* no arguments? */ + if (lua_stdin_is_tty()) { /* running in interactive mode? */ + print_version(); + doREPL(L); /* do read-eval-print loop */ + } + 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; + } + lua_pushcfunction(L, &pmain); /* to call 'pmain' in protected mode */ + lua_pushinteger(L, argc); /* 1st argument */ + lua_pushlightuserdata(L, argv); /* 2nd argument */ + status = lua_pcall(L, 2, 1, 0); /* do the call */ + result = lua_toboolean(L, -1); /* get result */ + report(L, status); + lua_close(L); + return (result && status == LUA_OK) ? EXIT_SUCCESS : EXIT_FAILURE; +} + diff --git a/lua-5.4.3/src/lua.h b/lua-5.4.3/src/lua.h new file mode 100644 index 0000000..820535b --- /dev/null +++ b/lua-5.4.3/src/lua.h @@ -0,0 +1,518 @@ +/* +** $Id: lua.h $ +** 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 "4" +#define LUA_VERSION_RELEASE "3" + +#define LUA_VERSION_NUM 504 +#define LUA_VERSION_RELEASE_NUM (LUA_VERSION_NUM * 100 + 0) + +#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-2021 Lua.org, PUC-Rio" +#define LUA_AUTHORS "R. Ierusalimschy, L. H. de Figueiredo, W. Celes" + + +/* mark for precompiled code ('Lua') */ +#define LUA_SIGNATURE "\x1bLua" + +/* option for multiple returns in 'lua_pcall' and 'lua_call' */ +#define LUA_MULTRET (-1) + + +/* +** Pseudo-indices +** (-LUAI_MAXSTACK is the minimum valid index; we keep some free empty +** space after that to help overflow detection) +*/ +#define LUA_REGISTRYINDEX (-LUAI_MAXSTACK - 1000) +#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_ERRERR 5 + + +typedef struct lua_State lua_State; + + +/* +** 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_NUMTYPES 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; + +/* type for continuation-function contexts */ +typedef LUA_KCONTEXT lua_KContext; + + +/* +** Type for C functions registered with Lua +*/ +typedef int (*lua_CFunction) (lua_State *L); + +/* +** Type for continuation functions +*/ +typedef int (*lua_KFunction) (lua_State *L, int status, lua_KContext ctx); + + +/* +** Type for 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); + + +/* +** Type for memory-allocation functions +*/ +typedef void * (*lua_Alloc) (void *ud, void *ptr, size_t osize, size_t nsize); + + +/* +** Type for warning functions +*/ +typedef void (*lua_WarnFunction) (void *ud, const char *msg, int tocont); + + + + +/* +** 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 int (lua_resetthread) (lua_State *L); + +LUA_API lua_CFunction (lua_atpanic) (lua_State *L, lua_CFunction panicf); + + +LUA_API 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_rotate) (lua_State *L, int idx, int n); +LUA_API void (lua_copy) (lua_State *L, int fromidx, int toidx); +LUA_API int (lua_checkstack) (lua_State *L, int n); + +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_isinteger) (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 int (lua_toboolean) (lua_State *L, int idx); +LUA_API const char *(lua_tolstring) (lua_State *L, int idx, size_t *len); +LUA_API lua_Unsigned (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, ORDER OP */ +#define LUA_OPSUB 1 +#define LUA_OPMUL 2 +#define LUA_OPMOD 3 +#define LUA_OPPOW 4 +#define LUA_OPDIV 5 +#define LUA_OPIDIV 6 +#define LUA_OPBAND 7 +#define LUA_OPBOR 8 +#define LUA_OPBXOR 9 +#define LUA_OPSHL 10 +#define LUA_OPSHR 11 +#define LUA_OPUNM 12 +#define LUA_OPBNOT 13 + +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 const char *(lua_pushlstring) (lua_State *L, const char *s, size_t len); +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 int (lua_getglobal) (lua_State *L, const char *name); +LUA_API int (lua_gettable) (lua_State *L, int idx); +LUA_API int (lua_getfield) (lua_State *L, int idx, const char *k); +LUA_API int (lua_geti) (lua_State *L, int idx, lua_Integer n); +LUA_API int (lua_rawget) (lua_State *L, int idx); +LUA_API int (lua_rawgeti) (lua_State *L, int idx, lua_Integer n); +LUA_API int (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_newuserdatauv) (lua_State *L, size_t sz, int nuvalue); +LUA_API int (lua_getmetatable) (lua_State *L, int objindex); +LUA_API int (lua_getiuservalue) (lua_State *L, int idx, int n); + + +/* +** set functions (stack -> Lua) +*/ +LUA_API void (lua_setglobal) (lua_State *L, const char *name); +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_seti) (lua_State *L, int idx, lua_Integer n); +LUA_API void (lua_rawset) (lua_State *L, int idx); +LUA_API void (lua_rawseti) (lua_State *L, int idx, lua_Integer 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 int (lua_setiuservalue) (lua_State *L, int idx, int n); + + +/* +** 'load' and 'call' functions (load and run Lua code) +*/ +LUA_API void (lua_callk) (lua_State *L, int nargs, int nresults, + lua_KContext ctx, lua_KFunction k); +#define lua_call(L,n,r) lua_callk(L, (n), (r), 0, NULL) + +LUA_API int (lua_pcallk) (lua_State *L, int nargs, int nresults, int errfunc, + lua_KContext ctx, lua_KFunction 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, int strip); + + +/* +** coroutine functions +*/ +LUA_API int (lua_yieldk) (lua_State *L, int nresults, lua_KContext ctx, + lua_KFunction k); +LUA_API int (lua_resume) (lua_State *L, lua_State *from, int narg, + int *nres); +LUA_API int (lua_status) (lua_State *L); +LUA_API int (lua_isyieldable) (lua_State *L); + +#define lua_yield(L,n) lua_yieldk(L, (n), 0, NULL) + + +/* +** Warning-related functions +*/ +LUA_API void (lua_setwarnf) (lua_State *L, lua_WarnFunction f, void *ud); +LUA_API void (lua_warning) (lua_State *L, const char *msg, int tocont); + + +/* +** 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_GCISRUNNING 9 +#define LUA_GCGEN 10 +#define LUA_GCINC 11 + +LUA_API int (lua_gc) (lua_State *L, int what, ...); + + +/* +** 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 size_t (lua_stringtonumber) (lua_State *L, const char *s); + +LUA_API lua_Alloc (lua_getallocf) (lua_State *L, void **ud); +LUA_API void (lua_setallocf) (lua_State *L, lua_Alloc f, void *ud); + +LUA_API void (lua_toclose) (lua_State *L, int idx); +LUA_API void (lua_closeslot) (lua_State *L, int idx); + + +/* +** {============================================================== +** some useful macros +** =============================================================== +*/ + +#define lua_getextraspace(L) ((void *)((char *)(L) - LUA_EXTRASPACE)) + +#define lua_tonumber(L,i) lua_tonumberx(L,(i),NULL) +#define lua_tointeger(L,i) lua_tointegerx(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_pushstring(L, "" s) + +#define lua_pushglobaltable(L) \ + ((void)lua_rawgeti(L, LUA_REGISTRYINDEX, LUA_RIDX_GLOBALS)) + +#define lua_tostring(L,i) lua_tolstring(L, (i), NULL) + + +#define lua_insert(L,idx) lua_rotate(L, (idx), 1) + +#define lua_remove(L,idx) (lua_rotate(L, (idx), -1), lua_pop(L, 1)) + +#define lua_replace(L,idx) (lua_copy(L, -1, (idx)), lua_pop(L, 1)) + +/* }============================================================== */ + + +/* +** {============================================================== +** compatibility macros +** =============================================================== +*/ +#if defined(LUA_COMPAT_APIINTCASTS) + +#define lua_pushunsigned(L,n) lua_pushinteger(L, (lua_Integer)(n)) +#define lua_tounsignedx(L,i,is) ((lua_Unsigned)lua_tointegerx(L,i,is)) +#define lua_tounsigned(L,i) lua_tounsignedx(L,(i),NULL) + +#endif + +#define lua_newuserdata(L,s) lua_newuserdatauv(L,s,1) +#define lua_getuservalue(L,idx) lua_getiuservalue(L,idx,1) +#define lua_setuservalue(L,idx) lua_setiuservalue(L,idx,1) + +#define LUA_NUMTAGS LUA_NUMTYPES + +/* }============================================================== */ + +/* +** {====================================================================== +** 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 void (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); + +LUA_API int (lua_setcstacklimit) (lua_State *L, unsigned int limit); + +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) */ + size_t srclen; /* (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) */ + unsigned short ftransfer; /* (r) index of first value transferred */ + unsigned short ntransfer; /* (r) number of transferred values */ + char short_src[LUA_IDSIZE]; /* (S) */ + /* private part */ + struct CallInfo *i_ci; /* active function */ +}; + +/* }====================================================================== */ + + +/****************************************************************************** +* Copyright (C) 1994-2021 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/lua-5.4.3/src/lua.hpp b/lua-5.4.3/src/lua.hpp new file mode 100644 index 0000000..ec417f5 --- /dev/null +++ b/lua-5.4.3/src/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/lua-5.4.3/src/luac.c b/lua-5.4.3/src/luac.c new file mode 100644 index 0000000..56ddc41 --- /dev/null +++ b/lua-5.4.3/src/luac.c @@ -0,0 +1,724 @@ +/* +** $Id: luac.c $ +** Lua compiler (saves bytecodes to files; also lists bytecodes) +** See Copyright Notice in lua.h +*/ + +#define luac_c +#define LUA_CORE + +#include "lprefix.h" + +#include +#include +#include +#include +#include + +#include "lua.h" +#include "lauxlib.h" + +#include "ldebug.h" +#include "lobject.h" +#include "lopcodes.h" +#include "lopnames.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 TString **tmname; + +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 '%s'\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 '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; + tmname=G(L)->tmname; + 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; +} + +/* +** print bytecodes +*/ + +#define UPVALNAME(x) ((f->upvalues[x].name) ? getstr(f->upvalues[x].name) : "-") +#define VOID(p) ((const void*)(p)) +#define eventname(i) (getstr(tmname[i])) + +static void PrintString(const TString* ts) +{ + const char* s=getstr(ts); + size_t i,n=tsslen(ts); + printf("\""); + for (i=0; ik[i]; + switch (ttypetag(o)) + { + case LUA_VNIL: + printf("N"); + break; + case LUA_VFALSE: + case LUA_VTRUE: + printf("B"); + break; + case LUA_VNUMFLT: + printf("F"); + break; + case LUA_VNUMINT: + printf("I"); + break; + case LUA_VSHRSTR: + case LUA_VLNGSTR: + printf("S"); + break; + default: /* cannot happen */ + printf("?%d",ttypetag(o)); + break; + } + printf("\t"); +} + +static void PrintConstant(const Proto* f, int i) +{ + const TValue* o=&f->k[i]; + switch (ttypetag(o)) + { + case LUA_VNIL: + printf("nil"); + break; + case LUA_VFALSE: + printf("false"); + break; + case LUA_VTRUE: + printf("true"); + break; + case LUA_VNUMFLT: + { + char buff[100]; + sprintf(buff,LUA_NUMBER_FMT,fltvalue(o)); + printf("%s",buff); + if (buff[strspn(buff,"-0123456789")]=='\0') printf(".0"); + break; + } + case LUA_VNUMINT: + printf(LUA_INTEGER_FMT,ivalue(o)); + break; + case LUA_VSHRSTR: + case LUA_VLNGSTR: + PrintString(tsvalue(o)); + break; + default: /* cannot happen */ + printf("?%d",ttypetag(o)); + break; + } +} + +#define COMMENT "\t; " +#define EXTRAARG GETARG_Ax(code[pc+1]) +#define EXTRAARGC (EXTRAARG*(MAXARG_C+1)) +#define ISK (isk ? "k" : "") + +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",opnames[o]); + switch (o) + { + case OP_MOVE: + printf("%d %d",a,b); + break; + case OP_LOADI: + printf("%d %d",a,sbx); + break; + case OP_LOADF: + printf("%d %d",a,sbx); + break; + case OP_LOADK: + printf("%d %d",a,bx); + printf(COMMENT); PrintConstant(f,bx); + break; + case OP_LOADKX: + printf("%d",a); + printf(COMMENT); PrintConstant(f,EXTRAARG); + break; + case OP_LOADFALSE: + printf("%d",a); + break; + case OP_LFALSESKIP: + printf("%d",a); + break; + case OP_LOADTRUE: + printf("%d",a); + break; + case OP_LOADNIL: + printf("%d %d",a,b); + printf(COMMENT "%d out",b+1); + break; + case OP_GETUPVAL: + printf("%d %d",a,b); + printf(COMMENT "%s",UPVALNAME(b)); + break; + case OP_SETUPVAL: + printf("%d %d",a,b); + printf(COMMENT "%s",UPVALNAME(b)); + break; + case OP_GETTABUP: + printf("%d %d %d",a,b,c); + printf(COMMENT "%s",UPVALNAME(b)); + printf(" "); PrintConstant(f,c); + break; + case OP_GETTABLE: + printf("%d %d %d",a,b,c); + break; + case OP_GETI: + printf("%d %d %d",a,b,c); + break; + case OP_GETFIELD: + printf("%d %d %d",a,b,c); + printf(COMMENT); PrintConstant(f,c); + break; + case OP_SETTABUP: + printf("%d %d %d%s",a,b,c,ISK); + printf(COMMENT "%s",UPVALNAME(a)); + printf(" "); PrintConstant(f,b); + if (isk) { printf(" "); PrintConstant(f,c); } + break; + case OP_SETTABLE: + printf("%d %d %d%s",a,b,c,ISK); + if (isk) { printf(COMMENT); PrintConstant(f,c); } + break; + case OP_SETI: + printf("%d %d %d%s",a,b,c,ISK); + if (isk) { printf(COMMENT); PrintConstant(f,c); } + break; + case OP_SETFIELD: + printf("%d %d %d%s",a,b,c,ISK); + printf(COMMENT); PrintConstant(f,b); + if (isk) { printf(" "); PrintConstant(f,c); } + break; + case OP_NEWTABLE: + printf("%d %d %d",a,b,c); + printf(COMMENT "%d",c+EXTRAARGC); + break; + case OP_SELF: + printf("%d %d %d%s",a,b,c,ISK); + if (isk) { printf(COMMENT); PrintConstant(f,c); } + break; + case OP_ADDI: + printf("%d %d %d",a,b,sc); + break; + case OP_ADDK: + printf("%d %d %d",a,b,c); + printf(COMMENT); PrintConstant(f,c); + break; + case OP_SUBK: + printf("%d %d %d",a,b,c); + printf(COMMENT); PrintConstant(f,c); + break; + case OP_MULK: + printf("%d %d %d",a,b,c); + printf(COMMENT); PrintConstant(f,c); + break; + case OP_MODK: + printf("%d %d %d",a,b,c); + printf(COMMENT); PrintConstant(f,c); + break; + case OP_POWK: + printf("%d %d %d",a,b,c); + printf(COMMENT); PrintConstant(f,c); + break; + case OP_DIVK: + printf("%d %d %d",a,b,c); + printf(COMMENT); PrintConstant(f,c); + break; + case OP_IDIVK: + printf("%d %d %d",a,b,c); + printf(COMMENT); PrintConstant(f,c); + break; + case OP_BANDK: + printf("%d %d %d",a,b,c); + printf(COMMENT); PrintConstant(f,c); + break; + case OP_BORK: + printf("%d %d %d",a,b,c); + printf(COMMENT); PrintConstant(f,c); + break; + case OP_BXORK: + printf("%d %d %d",a,b,c); + printf(COMMENT); PrintConstant(f,c); + break; + case OP_SHRI: + printf("%d %d %d",a,b,sc); + break; + case OP_SHLI: + printf("%d %d %d",a,b,sc); + break; + case OP_ADD: + printf("%d %d %d",a,b,c); + break; + case OP_SUB: + printf("%d %d %d",a,b,c); + break; + case OP_MUL: + printf("%d %d %d",a,b,c); + break; + case OP_MOD: + printf("%d %d %d",a,b,c); + break; + case OP_POW: + printf("%d %d %d",a,b,c); + break; + case OP_DIV: + printf("%d %d %d",a,b,c); + break; + case OP_IDIV: + printf("%d %d %d",a,b,c); + break; + case OP_BAND: + printf("%d %d %d",a,b,c); + break; + case OP_BOR: + printf("%d %d %d",a,b,c); + break; + case OP_BXOR: + printf("%d %d %d",a,b,c); + break; + case OP_SHL: + printf("%d %d %d",a,b,c); + break; + case OP_SHR: + printf("%d %d %d",a,b,c); + break; + case OP_MMBIN: + printf("%d %d %d",a,b,c); + printf(COMMENT "%s",eventname(c)); + break; + case OP_MMBINI: + printf("%d %d %d %d",a,sb,c,isk); + printf(COMMENT "%s",eventname(c)); + if (isk) printf(" flip"); + break; + case OP_MMBINK: + printf("%d %d %d %d",a,b,c,isk); + printf(COMMENT "%s ",eventname(c)); PrintConstant(f,b); + if (isk) printf(" flip"); + break; + case OP_UNM: + printf("%d %d",a,b); + break; + case OP_BNOT: + printf("%d %d",a,b); + break; + case OP_NOT: + printf("%d %d",a,b); + break; + case OP_LEN: + printf("%d %d",a,b); + break; + case OP_CONCAT: + printf("%d %d",a,b); + break; + case OP_CLOSE: + printf("%d",a); + break; + case OP_TBC: + printf("%d",a); + break; + case OP_JMP: + printf("%d",GETARG_sJ(i)); + printf(COMMENT "to %d",GETARG_sJ(i)+pc+2); + break; + case OP_EQ: + printf("%d %d %d",a,b,isk); + break; + case OP_LT: + printf("%d %d %d",a,b,isk); + break; + case OP_LE: + printf("%d %d %d",a,b,isk); + break; + case OP_EQK: + printf("%d %d %d",a,b,isk); + printf(COMMENT); PrintConstant(f,b); + break; + case OP_EQI: + printf("%d %d %d",a,sb,isk); + break; + case OP_LTI: + printf("%d %d %d",a,sb,isk); + break; + case OP_LEI: + printf("%d %d %d",a,sb,isk); + break; + case OP_GTI: + printf("%d %d %d",a,sb,isk); + break; + case OP_GEI: + printf("%d %d %d",a,sb,isk); + break; + case OP_TEST: + printf("%d %d",a,isk); + break; + case OP_TESTSET: + printf("%d %d %d",a,b,isk); + break; + case OP_CALL: + printf("%d %d %d",a,b,c); + printf(COMMENT); + if (b==0) printf("all in "); else printf("%d in ",b-1); + if (c==0) printf("all out"); else printf("%d out",c-1); + break; + case OP_TAILCALL: + printf("%d %d %d",a,b,c); + printf(COMMENT "%d in",b-1); + break; + case OP_RETURN: + printf("%d %d %d",a,b,c); + printf(COMMENT); + if (b==0) printf("all out"); else printf("%d out",b-1); + break; + case OP_RETURN0: + break; + case OP_RETURN1: + printf("%d",a); + break; + case OP_FORLOOP: + printf("%d %d",a,bx); + printf(COMMENT "to %d",pc-bx+2); + break; + case OP_FORPREP: + printf("%d %d",a,bx); + printf(COMMENT "to %d",pc+bx+2); + break; + case OP_TFORPREP: + printf("%d %d",a,bx); + printf(COMMENT "to %d",pc+bx+2); + break; + case OP_TFORCALL: + printf("%d %d",a,c); + break; + case OP_TFORLOOP: + printf("%d %d",a,bx); + printf(COMMENT "to %d",pc-bx+2); + break; + case OP_SETLIST: + printf("%d %d %d",a,b,c); + if (isk) printf(COMMENT "%d",c+EXTRAARGC); + break; + case OP_CLOSURE: + printf("%d %d",a,bx); + printf(COMMENT "%p",VOID(f->p[bx])); + break; + case OP_VARARG: + printf("%d %d",a,c); + printf(COMMENT); + if (c==0) printf("all out"); else printf("%d out",c-1); + break; + case OP_VARARGPREP: + printf("%d",a); + break; + case OP_EXTRAARG: + printf("%d",ax); + break; +#if 0 + default: + printf("%d %d %d",a,b,c); + printf(COMMENT "not handled"); + break; +#endif + } + 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/lua-5.4.3/src/luaconf.h b/lua-5.4.3/src/luaconf.h new file mode 100644 index 0000000..e64d2ee --- /dev/null +++ b/lua-5.4.3/src/luaconf.h @@ -0,0 +1,790 @@ +/* +** $Id: luaconf.h $ +** Configuration file for Lua +** See Copyright Notice in lua.h +*/ + + +#ifndef luaconf_h +#define luaconf_h + +#include +#include + + +/* +** =================================================================== +** General Configuration File for Lua +** +** Some definitions here can be changed externally, through the compiler +** (e.g., with '-D' options): They are commented out or protected +** by '#if !defined' guards. However, several other definitions +** should be changed directly here, either because they affect the +** Lua ABI (by making the changes here, you ensure that all software +** connected to Lua, such as C libraries, will be compiled with the same +** configuration); or because they are seldom changed. +** +** Search for "@@" to find all configurable definitions. +** =================================================================== +*/ + + +/* +** {==================================================================== +** System Configuration: macros to adapt (if needed) Lua to some +** particular platform, for instance restricting it to C89. +** ===================================================================== +*/ + +/* +@@ LUA_USE_C89 controls the use of non-ISO-C89 features. +** Define it if you want Lua to avoid the use of a few C99 features +** or Windows-specific features on Windows. +*/ +/* #define LUA_USE_C89 */ + + +/* +** By default, Lua on Windows use (some) specific Windows features +*/ +#if !defined(LUA_USE_C89) && defined(_WIN32) && !defined(_WIN32_WCE) +#define LUA_USE_WINDOWS /* enable goodies for regular Windows */ +#endif + + +#if defined(LUA_USE_WINDOWS) +#define LUA_DL_DLL /* enable support for DLL */ +#define LUA_USE_C89 /* broadly, Windows is C89 */ +#endif + + +#if defined(LUA_USE_LINUX) +#define LUA_USE_POSIX +#define LUA_USE_DLOPEN /* needs an extra library: -ldl */ +#endif + + +#if defined(LUA_USE_MACOSX) +#define LUA_USE_POSIX +#define LUA_USE_DLOPEN /* MacOS does not need -ldl */ +#endif + + +/* +@@ LUAI_IS32INT is true iff 'int' has (at least) 32 bits. +*/ +#define LUAI_IS32INT ((UINT_MAX >> 30) >= 3) + +/* }================================================================== */ + + + +/* +** {================================================================== +** Configuration for Number types. These options should not be +** set externally, because any other code connected to Lua must +** use the same configuration. +** =================================================================== +*/ + +/* +@@ LUA_INT_TYPE defines the type for Lua integers. +@@ LUA_FLOAT_TYPE defines the type for Lua floats. +** Lua should work fine with any mix of these options supported +** by your C compiler. The usual configurations are 64-bit integers +** and 'double' (the default), 32-bit integers and 'float' (for +** restricted platforms), and 'long'/'double' (for C compilers not +** compliant with C99, which may not have support for 'long long'). +*/ + +/* predefined options for LUA_INT_TYPE */ +#define LUA_INT_INT 1 +#define LUA_INT_LONG 2 +#define LUA_INT_LONGLONG 3 + +/* predefined options for LUA_FLOAT_TYPE */ +#define LUA_FLOAT_FLOAT 1 +#define LUA_FLOAT_DOUBLE 2 +#define LUA_FLOAT_LONGDOUBLE 3 + + +/* Default configuration ('long long' and 'double', for 64-bit Lua) */ +#define LUA_INT_DEFAULT LUA_INT_LONGLONG +#define LUA_FLOAT_DEFAULT LUA_FLOAT_DOUBLE + + +/* +@@ LUA_32BITS enables Lua with 32-bit integers and 32-bit floats. +*/ +#define LUA_32BITS 0 + + +/* +@@ LUA_C89_NUMBERS ensures that Lua uses the largest types available for +** C89 ('long' and 'double'); Windows always has '__int64', so it does +** not need to use this case. +*/ +#if defined(LUA_USE_C89) && !defined(LUA_USE_WINDOWS) +#define LUA_C89_NUMBERS 1 +#else +#define LUA_C89_NUMBERS 0 +#endif + + +#if LUA_32BITS /* { */ +/* +** 32-bit integers and 'float' +*/ +#if LUAI_IS32INT /* use 'int' if big enough */ +#define LUA_INT_TYPE LUA_INT_INT +#else /* otherwise use 'long' */ +#define LUA_INT_TYPE LUA_INT_LONG +#endif +#define LUA_FLOAT_TYPE LUA_FLOAT_FLOAT + +#elif LUA_C89_NUMBERS /* }{ */ +/* +** largest types available for C89 ('long' and 'double') +*/ +#define LUA_INT_TYPE LUA_INT_LONG +#define LUA_FLOAT_TYPE LUA_FLOAT_DOUBLE + +#else /* }{ */ +/* use defaults */ + +#define LUA_INT_TYPE LUA_INT_DEFAULT +#define LUA_FLOAT_TYPE LUA_FLOAT_DEFAULT + +#endif /* } */ + + +/* }================================================================== */ + + + +/* +** {================================================================== +** Configuration for Paths. +** =================================================================== +*/ + +/* +** 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. +*/ +#define LUA_PATH_SEP ";" +#define LUA_PATH_MARK "?" +#define LUA_EXEC_DIR "!" + + +/* +@@ 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. +*/ + +#define LUA_VDIR LUA_VERSION_MAJOR "." LUA_VERSION_MINOR +#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_SHRDIR "!\\..\\share\\lua\\" LUA_VDIR "\\" + +#if !defined(LUA_PATH_DEFAULT) +#define LUA_PATH_DEFAULT \ + LUA_LDIR"?.lua;" LUA_LDIR"?\\init.lua;" \ + LUA_CDIR"?.lua;" LUA_CDIR"?\\init.lua;" \ + LUA_SHRDIR"?.lua;" LUA_SHRDIR"?\\init.lua;" \ + ".\\?.lua;" ".\\?\\init.lua" +#endif + +#if !defined(LUA_CPATH_DEFAULT) +#define LUA_CPATH_DEFAULT \ + LUA_CDIR"?.dll;" \ + LUA_CDIR"..\\lib\\lua\\" LUA_VDIR "\\?.dll;" \ + LUA_CDIR"loadall.dll;" ".\\?.dll" +#endif + +#else /* }{ */ + +#define LUA_ROOT "/usr/local/" +#define LUA_LDIR LUA_ROOT "share/lua/" LUA_VDIR "/" +#define LUA_CDIR LUA_ROOT "lib/lua/" LUA_VDIR "/" + +#if !defined(LUA_PATH_DEFAULT) +#define LUA_PATH_DEFAULT \ + LUA_LDIR"?.lua;" LUA_LDIR"?/init.lua;" \ + LUA_CDIR"?.lua;" LUA_CDIR"?/init.lua;" \ + "./?.lua;" "./?/init.lua" +#endif + +#if !defined(LUA_CPATH_DEFAULT) +#define LUA_CPATH_DEFAULT \ + LUA_CDIR"?.so;" LUA_CDIR"loadall.so;" "./?.so" +#endif + +#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(LUA_DIRSEP) + +#if defined(_WIN32) +#define LUA_DIRSEP "\\" +#else +#define LUA_DIRSEP "/" +#endif + +#endif + +/* }================================================================== */ + + +/* +** {================================================================== +** Marks for exported symbols in the C code +** =================================================================== +*/ + +/* +@@ 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 LUA_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, +** none of which 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("internal"))) extern +#else /* }{ */ +#define LUAI_FUNC extern +#endif /* } */ + +#define LUAI_DDEC(dec) LUAI_FUNC dec +#define LUAI_DDEF /* empty */ + +/* }================================================================== */ + + +/* +** {================================================================== +** Compatibility with previous versions +** =================================================================== +*/ + +/* +@@ LUA_COMPAT_5_3 controls other macros for compatibility with Lua 5.3. +** You can define it to get all options, or change specific options +** to fit your specific needs. +*/ +#if defined(LUA_COMPAT_5_3) /* { */ + +/* +@@ LUA_COMPAT_MATHLIB controls the presence of several deprecated +** functions in the mathematical library. +** (These functions were already officially removed in 5.3; +** nevertheless they are still available here.) +*/ +#define LUA_COMPAT_MATHLIB + +/* +@@ LUA_COMPAT_APIINTCASTS controls the presence of macros for +** manipulating other integer types (lua_pushunsigned, lua_tounsigned, +** luaL_checkint, luaL_checklong, etc.) +** (These macros were also officially removed in 5.3, but they are still +** available here.) +*/ +#define LUA_COMPAT_APIINTCASTS + + +/* +@@ LUA_COMPAT_LT_LE controls the emulation of the '__le' metamethod +** using '__lt'. +*/ +#define LUA_COMPAT_LT_LE + + +/* +@@ 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. +** (Once more, these macros were officially removed in 5.3, but they are +** still available here.) +*/ +#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) + +#endif /* } */ + +/* }================================================================== */ + + + +/* +** {================================================================== +** Configuration for Numbers (low-level part). +** Change these definitions if no predefined LUA_FLOAT_* / LUA_INT_* +** satisfy your needs. +** =================================================================== +*/ + +/* +@@ LUAI_UACNUMBER is the result of a 'default argument promotion' +@@ over a floating number. +@@ l_floatatt(x) corrects float attribute 'x' to the proper float type +** by prefixing it with one of FLT/DBL/LDBL. +@@ LUA_NUMBER_FRMLEN is the length modifier for writing floats. +@@ LUA_NUMBER_FMT is the format for writing floats. +@@ lua_number2str converts a float to a string. +@@ l_mathop allows the addition of an 'l' or 'f' to all math operations. +@@ l_floor takes the floor of a float. +@@ lua_str2number converts a decimal numeral to a number. +*/ + + +/* The following definitions are good for most cases here */ + +#define l_floor(x) (l_mathop(floor)(x)) + +#define lua_number2str(s,sz,n) \ + l_sprintf((s), sz, LUA_NUMBER_FMT, (LUAI_UACNUMBER)(n)) + +/* +@@ lua_numbertointeger converts a float number with an integral value +** to an integer, or returns 0 if float is not within the range of +** a lua_Integer. (The range comparisons are tricky because of +** rounding. The tests here assume a two-complement representation, +** where MININTEGER always has an exact representation as a float; +** MAXINTEGER may not have one, and therefore its conversion to float +** may have an ill-defined value.) +*/ +#define lua_numbertointeger(n,p) \ + ((n) >= (LUA_NUMBER)(LUA_MININTEGER) && \ + (n) < -(LUA_NUMBER)(LUA_MININTEGER) && \ + (*(p) = (LUA_INTEGER)(n), 1)) + + +/* now the variable definitions */ + +#if LUA_FLOAT_TYPE == LUA_FLOAT_FLOAT /* { single float */ + +#define LUA_NUMBER float + +#define l_floatatt(n) (FLT_##n) + +#define LUAI_UACNUMBER double + +#define LUA_NUMBER_FRMLEN "" +#define LUA_NUMBER_FMT "%.7g" + +#define l_mathop(op) op##f + +#define lua_str2number(s,p) strtof((s), (p)) + + +#elif LUA_FLOAT_TYPE == LUA_FLOAT_LONGDOUBLE /* }{ long double */ + +#define LUA_NUMBER long double + +#define l_floatatt(n) (LDBL_##n) + +#define LUAI_UACNUMBER long double + +#define LUA_NUMBER_FRMLEN "L" +#define LUA_NUMBER_FMT "%.19Lg" + +#define l_mathop(op) op##l + +#define lua_str2number(s,p) strtold((s), (p)) + +#elif LUA_FLOAT_TYPE == LUA_FLOAT_DOUBLE /* }{ double */ + +#define LUA_NUMBER double + +#define l_floatatt(n) (DBL_##n) + +#define LUAI_UACNUMBER double + +#define LUA_NUMBER_FRMLEN "" +#define LUA_NUMBER_FMT "%.14g" + +#define l_mathop(op) op + +#define lua_str2number(s,p) strtod((s), (p)) + +#else /* }{ */ + +#error "numeric float type not defined" + +#endif /* } */ + + + +/* +@@ LUA_UNSIGNED is the unsigned version of LUA_INTEGER. +@@ LUAI_UACINT is the result of a 'default argument promotion' +@@ over a LUA_INTEGER. +@@ LUA_INTEGER_FRMLEN is the length modifier for reading/writing integers. +@@ LUA_INTEGER_FMT is the format for writing integers. +@@ LUA_MAXINTEGER is the maximum value for a LUA_INTEGER. +@@ LUA_MININTEGER is the minimum value for a LUA_INTEGER. +@@ LUA_MAXUNSIGNED is the maximum value for a LUA_UNSIGNED. +@@ LUA_UNSIGNEDBITS is the number of bits in a LUA_UNSIGNED. +@@ lua_integer2str converts an integer to a string. +*/ + + +/* The following definitions are good for most cases here */ + +#define LUA_INTEGER_FMT "%" LUA_INTEGER_FRMLEN "d" + +#define LUAI_UACINT LUA_INTEGER + +#define lua_integer2str(s,sz,n) \ + l_sprintf((s), sz, LUA_INTEGER_FMT, (LUAI_UACINT)(n)) + +/* +** use LUAI_UACINT here to avoid problems with promotions (which +** can turn a comparison between unsigneds into a signed comparison) +*/ +#define LUA_UNSIGNED unsigned LUAI_UACINT + + +#define LUA_UNSIGNEDBITS (sizeof(LUA_UNSIGNED) * CHAR_BIT) + + +/* now the variable definitions */ + +#if LUA_INT_TYPE == LUA_INT_INT /* { int */ + +#define LUA_INTEGER int +#define LUA_INTEGER_FRMLEN "" + +#define LUA_MAXINTEGER INT_MAX +#define LUA_MININTEGER INT_MIN + +#define LUA_MAXUNSIGNED UINT_MAX + +#elif LUA_INT_TYPE == LUA_INT_LONG /* }{ long */ + +#define LUA_INTEGER long +#define LUA_INTEGER_FRMLEN "l" + +#define LUA_MAXINTEGER LONG_MAX +#define LUA_MININTEGER LONG_MIN + +#define LUA_MAXUNSIGNED ULONG_MAX + +#elif LUA_INT_TYPE == LUA_INT_LONGLONG /* }{ long long */ + +/* use presence of macro LLONG_MAX as proxy for C99 compliance */ +#if defined(LLONG_MAX) /* { */ +/* use ISO C99 stuff */ + +#define LUA_INTEGER long long +#define LUA_INTEGER_FRMLEN "ll" + +#define LUA_MAXINTEGER LLONG_MAX +#define LUA_MININTEGER LLONG_MIN + +#define LUA_MAXUNSIGNED ULLONG_MAX + +#elif defined(LUA_USE_WINDOWS) /* }{ */ +/* in Windows, can use specific Windows types */ + +#define LUA_INTEGER __int64 +#define LUA_INTEGER_FRMLEN "I64" + +#define LUA_MAXINTEGER _I64_MAX +#define LUA_MININTEGER _I64_MIN + +#define LUA_MAXUNSIGNED _UI64_MAX + +#else /* }{ */ + +#error "Compiler does not support 'long long'. Use option '-DLUA_32BITS' \ + or '-DLUA_C89_NUMBERS' (see file 'luaconf.h' for details)" + +#endif /* } */ + +#else /* }{ */ + +#error "numeric integer type not defined" + +#endif /* } */ + +/* }================================================================== */ + + +/* +** {================================================================== +** Dependencies with C99 and other C details +** =================================================================== +*/ + +/* +@@ l_sprintf is equivalent to 'snprintf' or 'sprintf' in C89. +** (All uses in Lua have only one format item.) +*/ +#if !defined(LUA_USE_C89) +#define l_sprintf(s,sz,f,i) snprintf(s,sz,f,i) +#else +#define l_sprintf(s,sz,f,i) ((void)(sz), sprintf(s,f,i)) +#endif + + +/* +@@ lua_strx2number converts a hexadecimal numeral to a number. +** In C99, 'strtod' does that conversion. Otherwise, you can +** leave 'lua_strx2number' undefined and Lua will provide its own +** implementation. +*/ +#if !defined(LUA_USE_C89) +#define lua_strx2number(s,p) lua_str2number(s,p) +#endif + + +/* +@@ lua_pointer2str converts a pointer to a readable string in a +** non-specified way. +*/ +#define lua_pointer2str(buff,sz,p) l_sprintf(buff,sz,"%p",p) + + +/* +@@ lua_number2strx converts a float to a hexadecimal numeral. +** In C99, 'sprintf' (with format specifiers '%a'/'%A') does that. +** Otherwise, you can leave 'lua_number2strx' undefined and Lua will +** provide its own implementation. +*/ +#if !defined(LUA_USE_C89) +#define lua_number2strx(L,b,sz,f,n) \ + ((void)L, l_sprintf(b,sz,f,(LUAI_UACNUMBER)(n))) +#endif + + +/* +** 'strtof' and 'opf' variants for math functions are not valid in +** C89. Otherwise, the macro 'HUGE_VALF' is a good proxy for testing the +** availability of these variants. ('math.h' is already included in +** all files that use these macros.) +*/ +#if defined(LUA_USE_C89) || (defined(HUGE_VAL) && !defined(HUGE_VALF)) +#undef l_mathop /* variants not available */ +#undef lua_str2number +#define l_mathop(op) (lua_Number)op /* no variant */ +#define lua_str2number(s,p) ((lua_Number)strtod((s), (p))) +#endif + + +/* +@@ LUA_KCONTEXT is the type of the context ('ctx') for continuation +** functions. It must be a numerical type; Lua will use 'intptr_t' if +** available, otherwise it will use 'ptrdiff_t' (the nearest thing to +** 'intptr_t' in C89) +*/ +#define LUA_KCONTEXT ptrdiff_t + +#if !defined(LUA_USE_C89) && defined(__STDC_VERSION__) && \ + __STDC_VERSION__ >= 199901L +#include +#if defined(INTPTR_MAX) /* even in C99 this type is optional */ +#undef LUA_KCONTEXT +#define LUA_KCONTEXT intptr_t +#endif +#endif + + +/* +@@ lua_getlocaledecpoint gets the locale "radix character" (decimal point). +** Change that if you do not want to use C locales. (Code using this +** macro must include the header 'locale.h'.) +*/ +#if !defined(lua_getlocaledecpoint) +#define lua_getlocaledecpoint() (localeconv()->decimal_point[0]) +#endif + + +/* +** macros to improve jump prediction, used mostly for error handling +** and debug facilities. (Some macros in the Lua API use these macros. +** Define LUA_NOBUILTIN if you do not want '__builtin_expect' in your +** code.) +*/ +#if !defined(luai_likely) + +#if defined(__GNUC__) && !defined(LUA_NOBUILTIN) +#define luai_likely(x) (__builtin_expect(((x) != 0), 1)) +#define luai_unlikely(x) (__builtin_expect(((x) != 0), 0)) +#else +#define luai_likely(x) (x) +#define luai_unlikely(x) (x) +#endif + +#endif + + +#if defined(LUA_CORE) || defined(LUA_LIB) +/* shorter names for Lua's own use */ +#define l_likely(x) luai_likely(x) +#define l_unlikely(x) luai_unlikely(x) +#endif + + + +/* }================================================================== */ + + +/* +** {================================================================== +** Language Variations +** ===================================================================== +*/ + +/* +@@ LUA_NOCVTN2S/LUA_NOCVTS2N control how Lua performs some +** coercions. Define LUA_NOCVTN2S to turn off automatic coercion from +** numbers to strings. Define LUA_NOCVTS2N to turn off automatic +** coercion from strings to numbers. +*/ +/* #define LUA_NOCVTN2S */ +/* #define LUA_NOCVTS2N */ + + +/* +@@ LUA_USE_APICHECK turns on several consistency checks on the C API. +** Define it as a help when debugging C code. +*/ +#if defined(LUA_USE_APICHECK) +#include +#define luai_apicheck(l,e) assert(e) +#endif + +/* }================================================================== */ + + +/* +** {================================================================== +** Macros that affect the API and must be stable (that is, must be the +** same when you compile Lua and when you compile code that links to +** Lua). +** ===================================================================== +*/ + +/* +@@ 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 from consuming unlimited stack +** space (and to reserve some numbers for pseudo-indices). +** (It must fit into max(size_t)/32.) +*/ +#if LUAI_IS32INT +#define LUAI_MAXSTACK 1000000 +#else +#define LUAI_MAXSTACK 15000 +#endif + + +/* +@@ LUA_EXTRASPACE defines the size of a raw memory area associated with +** a Lua state with very fast access. +** CHANGE it if you need a different size. +*/ +#define LUA_EXTRASPACE (sizeof(void *)) + + +/* +@@ 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 + + +/* +@@ LUAL_BUFFERSIZE is the buffer size used by the lauxlib buffer system. +*/ +#define LUAL_BUFFERSIZE ((int)(16 * sizeof(void*) * sizeof(lua_Number))) + + +/* +@@ LUAI_MAXALIGN defines fields that, when used in a union, ensure +** maximum alignment for the other items in that union. +*/ +#define LUAI_MAXALIGN lua_Number n; double u; void *s; lua_Integer i; long l + +/* }================================================================== */ + + + + + +/* =================================================================== */ + +/* +** Local configuration. You can use this space to add your redefinitions +** without modifying the main part of the file. +*/ + + + + + +#endif + diff --git a/lua-5.4.3/src/lualib.h b/lua-5.4.3/src/lualib.h new file mode 100644 index 0000000..2625529 --- /dev/null +++ b/lua-5.4.3/src/lualib.h @@ -0,0 +1,52 @@ +/* +** $Id: lualib.h $ +** Lua standard libraries +** See Copyright Notice in lua.h +*/ + + +#ifndef lualib_h +#define lualib_h + +#include "lua.h" + + +/* version suffix for environment variable names */ +#define LUA_VERSUFFIX "_" LUA_VERSION_MAJOR "_" LUA_VERSION_MINOR + + +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_UTF8LIBNAME "utf8" +LUAMOD_API int (luaopen_utf8) (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); + + +#endif diff --git a/lua-5.4.3/src/lundump.c b/lua-5.4.3/src/lundump.c new file mode 100644 index 0000000..5aa55c4 --- /dev/null +++ b/lua-5.4.3/src/lundump.c @@ -0,0 +1,333 @@ +/* +** $Id: lundump.c $ +** load precompiled Lua chunks +** See Copyright Notice in lua.h +*/ + +#define lundump_c +#define LUA_CORE + +#include "lprefix.h" + + +#include +#include + +#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" + + +#if !defined(luai_verifycode) +#define luai_verifycode(L,f) /* empty */ +#endif + + +typedef struct { + lua_State *L; + ZIO *Z; + const char *name; +} LoadState; + + +static l_noret error (LoadState *S, const char *why) { + luaO_pushfstring(S->L, "%s: bad binary format (%s)", S->name, why); + luaD_throw(S->L, LUA_ERRSYNTAX); +} + + +/* +** All high-level loads go through loadVector; you can change it to +** adapt to the endianness of the input +*/ +#define loadVector(S,b,n) loadBlock(S,b,(n)*sizeof((b)[0])) + +static void loadBlock (LoadState *S, void *b, size_t size) { + if (luaZ_read(S->Z, b, size) != 0) + error(S, "truncated chunk"); +} + + +#define loadVar(S,x) loadVector(S,&x,1) + + +static lu_byte loadByte (LoadState *S) { + int b = zgetc(S->Z); + if (b == EOZ) + error(S, "truncated chunk"); + return cast_byte(b); +} + + +static size_t loadUnsigned (LoadState *S, size_t limit) { + size_t x = 0; + int b; + limit >>= 7; + do { + b = loadByte(S); + if (x >= limit) + error(S, "integer overflow"); + x = (x << 7) | (b & 0x7f); + } while ((b & 0x80) == 0); + return x; +} + + +static size_t loadSize (LoadState *S) { + return loadUnsigned(S, ~(size_t)0); +} + + +static int loadInt (LoadState *S) { + return cast_int(loadUnsigned(S, INT_MAX)); +} + + +static lua_Number loadNumber (LoadState *S) { + lua_Number x; + loadVar(S, x); + return x; +} + + +static lua_Integer loadInteger (LoadState *S) { + lua_Integer x; + loadVar(S, x); + return x; +} + + +/* +** Load a nullable string into prototype 'p'. +*/ +static TString *loadStringN (LoadState *S, Proto *p) { + lua_State *L = S->L; + TString *ts; + size_t size = loadSize(S); + if (size == 0) /* no string? */ + return NULL; + else if (--size <= LUAI_MAXSHORTLEN) { /* short string? */ + char buff[LUAI_MAXSHORTLEN]; + loadVector(S, buff, size); /* load string into buffer */ + ts = luaS_newlstr(L, buff, size); /* create string */ + } + else { /* long string */ + ts = luaS_createlngstrobj(L, size); /* create string */ + setsvalue2s(L, L->top, ts); /* anchor it ('loadVector' can GC) */ + luaD_inctop(L); + loadVector(S, getstr(ts), size); /* load directly in final place */ + L->top--; /* pop string */ + } + luaC_objbarrier(L, p, ts); + return ts; +} + + +/* +** Load a non-nullable string into prototype 'p'. +*/ +static TString *loadString (LoadState *S, Proto *p) { + TString *st = loadStringN(S, p); + if (st == NULL) + error(S, "bad format for constant string"); + return st; +} + + +static void loadCode (LoadState *S, Proto *f) { + int n = loadInt(S); + f->code = luaM_newvectorchecked(S->L, n, Instruction); + f->sizecode = n; + loadVector(S, f->code, n); +} + + +static void loadFunction(LoadState *S, Proto *f, TString *psource); + + +static void loadConstants (LoadState *S, Proto *f) { + int i; + int n = loadInt(S); + f->k = luaM_newvectorchecked(S->L, n, TValue); + f->sizek = n; + for (i = 0; i < n; i++) + setnilvalue(&f->k[i]); + for (i = 0; i < n; i++) { + TValue *o = &f->k[i]; + int t = loadByte(S); + switch (t) { + case LUA_VNIL: + setnilvalue(o); + break; + case LUA_VFALSE: + setbfvalue(o); + break; + case LUA_VTRUE: + setbtvalue(o); + break; + case LUA_VNUMFLT: + setfltvalue(o, loadNumber(S)); + break; + case LUA_VNUMINT: + setivalue(o, loadInteger(S)); + break; + case LUA_VSHRSTR: + case LUA_VLNGSTR: + setsvalue2n(S->L, o, loadString(S, f)); + break; + default: lua_assert(0); + } + } +} + + +static void loadProtos (LoadState *S, Proto *f) { + int i; + int n = loadInt(S); + f->p = luaM_newvectorchecked(S->L, n, Proto *); + f->sizep = n; + for (i = 0; i < n; i++) + f->p[i] = NULL; + for (i = 0; i < n; i++) { + f->p[i] = luaF_newproto(S->L); + luaC_objbarrier(S->L, f, f->p[i]); + loadFunction(S, f->p[i], f->source); + } +} + + +/* +** Load the upvalues for a function. The names must be filled first, +** because the filling of the other fields can raise read errors and +** the creation of the error message can call an emergency collection; +** in that case all prototypes must be consistent for the GC. +*/ +static void loadUpvalues (LoadState *S, Proto *f) { + int i, n; + n = loadInt(S); + f->upvalues = luaM_newvectorchecked(S->L, n, Upvaldesc); + f->sizeupvalues = n; + for (i = 0; i < n; i++) /* make array valid for GC */ + f->upvalues[i].name = NULL; + for (i = 0; i < n; i++) { /* following calls can raise errors */ + f->upvalues[i].instack = loadByte(S); + f->upvalues[i].idx = loadByte(S); + f->upvalues[i].kind = loadByte(S); + } +} + + +static void loadDebug (LoadState *S, Proto *f) { + int i, n; + n = loadInt(S); + f->lineinfo = luaM_newvectorchecked(S->L, n, ls_byte); + f->sizelineinfo = n; + loadVector(S, f->lineinfo, n); + n = loadInt(S); + f->abslineinfo = luaM_newvectorchecked(S->L, n, AbsLineInfo); + f->sizeabslineinfo = n; + for (i = 0; i < n; i++) { + f->abslineinfo[i].pc = loadInt(S); + f->abslineinfo[i].line = loadInt(S); + } + n = loadInt(S); + f->locvars = luaM_newvectorchecked(S->L, n, LocVar); + f->sizelocvars = n; + for (i = 0; i < n; i++) + f->locvars[i].varname = NULL; + for (i = 0; i < n; i++) { + f->locvars[i].varname = loadStringN(S, f); + f->locvars[i].startpc = loadInt(S); + f->locvars[i].endpc = loadInt(S); + } + n = loadInt(S); + for (i = 0; i < n; i++) + f->upvalues[i].name = loadStringN(S, f); +} + + +static void loadFunction (LoadState *S, Proto *f, TString *psource) { + f->source = loadStringN(S, f); + if (f->source == NULL) /* no source in dump? */ + f->source = psource; /* reuse parent's source */ + 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); + loadProtos(S, f); + loadDebug(S, f); +} + + +static void checkliteral (LoadState *S, const char *s, const char *msg) { + char buff[sizeof(LUA_SIGNATURE) + sizeof(LUAC_DATA)]; /* larger than both */ + size_t len = strlen(s); + loadVector(S, buff, len); + if (memcmp(s, buff, len) != 0) + error(S, msg); +} + + +static void fchecksize (LoadState *S, size_t size, const char *tname) { + if (loadByte(S) != size) + error(S, luaO_pushfstring(S->L, "%s size mismatch", tname)); +} + + +#define checksize(S,t) fchecksize(S,sizeof(t),#t) + +static void checkHeader (LoadState *S) { + /* skip 1st char (already read and checked) */ + checkliteral(S, &LUA_SIGNATURE[1], "not a binary chunk"); + if (loadByte(S) != LUAC_VERSION) + error(S, "version mismatch"); + if (loadByte(S) != LUAC_FORMAT) + error(S, "format mismatch"); + checkliteral(S, LUAC_DATA, "corrupted chunk"); + checksize(S, Instruction); + checksize(S, lua_Integer); + checksize(S, lua_Number); + if (loadInteger(S) != LUAC_INT) + error(S, "integer format mismatch"); + if (loadNumber(S) != LUAC_NUM) + error(S, "float format mismatch"); +} + + +/* +** Load precompiled chunk. +*/ +LClosure *luaU_undump(lua_State *L, ZIO *Z, const char *name) { + LoadState S; + LClosure *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; + checkHeader(&S); + cl = luaF_newLclosure(L, loadByte(&S)); + setclLvalue2s(L, L->top, cl); + luaD_inctop(L); + cl->p = luaF_newproto(L); + luaC_objbarrier(L, cl, cl->p); + loadFunction(&S, cl->p, NULL); + lua_assert(cl->nupvalues == cl->p->sizeupvalues); + luai_verifycode(L, cl->p); + return cl; +} + diff --git a/lua-5.4.3/src/lundump.h b/lua-5.4.3/src/lundump.h new file mode 100644 index 0000000..f3748a9 --- /dev/null +++ b/lua-5.4.3/src/lundump.h @@ -0,0 +1,36 @@ +/* +** $Id: lundump.h $ +** load precompiled Lua chunks +** See Copyright Notice in lua.h +*/ + +#ifndef lundump_h +#define lundump_h + +#include "llimits.h" +#include "lobject.h" +#include "lzio.h" + + +/* data to catch conversion errors */ +#define LUAC_DATA "\x19\x93\r\n\x1a\n" + +#define LUAC_INT 0x5678 +#define LUAC_NUM cast_num(370.5) + +/* +** Encode major-minor version in one byte, one nibble for each +*/ +#define MYINT(s) (s[0]-'0') /* assume one-digit numerals */ +#define LUAC_VERSION (MYINT(LUA_VERSION_MAJOR)*16+MYINT(LUA_VERSION_MINOR)) + +#define LUAC_FORMAT 0 /* this is the official format */ + +/* load one chunk; from lundump.c */ +LUAI_FUNC LClosure* luaU_undump (lua_State* L, ZIO* Z, const char* name); + +/* dump one chunk; from ldump.c */ +LUAI_FUNC int luaU_dump (lua_State* L, const Proto* f, lua_Writer w, + void* data, int strip); + +#endif diff --git a/lua-5.4.3/src/lutf8lib.c b/lua-5.4.3/src/lutf8lib.c new file mode 100644 index 0000000..901d985 --- /dev/null +++ b/lua-5.4.3/src/lutf8lib.c @@ -0,0 +1,289 @@ +/* +** $Id: lutf8lib.c $ +** Standard library for UTF-8 manipulation +** See Copyright Notice in lua.h +*/ + +#define lutf8lib_c +#define LUA_LIB + +#include "lprefix.h" + + +#include +#include +#include +#include + +#include "lua.h" + +#include "lauxlib.h" +#include "lualib.h" + + +#define MAXUNICODE 0x10FFFFu + +#define MAXUTF 0x7FFFFFFFu + +/* +** Integer type for decoded UTF-8 values; MAXUTF needs 31 bits. +*/ +#if (UINT_MAX >> 30) >= 1 +typedef unsigned int utfint; +#else +typedef unsigned long utfint; +#endif + + +#define iscont(p) ((*(p) & 0xC0) == 0x80) + + +/* from strlib */ +/* translate a relative string position: negative means back from end */ +static lua_Integer u_posrelat (lua_Integer pos, size_t len) { + if (pos >= 0) return pos; + else if (0u - (size_t)pos > len) return 0; + else return (lua_Integer)len + pos + 1; +} + + +/* +** Decode one UTF-8 sequence, returning NULL if byte sequence is +** invalid. The array 'limits' stores the minimum value for each +** sequence length, to check for overlong representations. Its first +** entry forces an error for non-ascii bytes with no continuation +** bytes (count == 0). +*/ +static const char *utf8_decode (const char *s, utfint *val, int strict) { + static const utfint limits[] = + {~(utfint)0, 0x80, 0x800, 0x10000u, 0x200000u, 0x4000000u}; + unsigned int c = (unsigned char)s[0]; + utfint res = 0; /* final result */ + if (c < 0x80) /* ascii? */ + res = c; + else { + int count = 0; /* to count number of continuation bytes */ + for (; c & 0x40; c <<= 1) { /* while it needs continuation bytes... */ + unsigned int cc = (unsigned char)s[++count]; /* read next byte */ + if ((cc & 0xC0) != 0x80) /* not a continuation byte? */ + return NULL; /* invalid byte sequence */ + res = (res << 6) | (cc & 0x3F); /* add lower 6 bits from cont. byte */ + } + res |= ((utfint)(c & 0x7F) << (count * 5)); /* add first byte */ + if (count > 5 || res > MAXUTF || res < limits[count]) + return NULL; /* invalid byte sequence */ + s += count; /* skip continuation bytes read */ + } + if (strict) { + /* check for invalid code points; too large or surrogates */ + if (res > MAXUNICODE || (0xD800u <= res && res <= 0xDFFFu)) + return NULL; + } + if (val) *val = res; + return s + 1; /* +1 to include first byte */ +} + + +/* +** utf8len(s [, i [, j [, lax]]]) --> number of characters that +** start in the range [i,j], or nil + current position if 's' is not +** well formed in that interval +*/ +static int utflen (lua_State *L) { + lua_Integer n = 0; /* counter for the number of characters */ + size_t len; /* string length in bytes */ + const char *s = luaL_checklstring(L, 1, &len); + lua_Integer posi = u_posrelat(luaL_optinteger(L, 2, 1), len); + lua_Integer posj = u_posrelat(luaL_optinteger(L, 3, -1), len); + int lax = lua_toboolean(L, 4); + luaL_argcheck(L, 1 <= posi && --posi <= (lua_Integer)len, 2, + "initial position out of bounds"); + luaL_argcheck(L, --posj < (lua_Integer)len, 3, + "final position out of bounds"); + while (posi <= posj) { + const char *s1 = utf8_decode(s + posi, NULL, !lax); + if (s1 == NULL) { /* conversion error? */ + luaL_pushfail(L); /* return fail ... */ + lua_pushinteger(L, posi + 1); /* ... and current position */ + return 2; + } + posi = s1 - s; + n++; + } + lua_pushinteger(L, n); + return 1; +} + + +/* +** codepoint(s, [i, [j [, lax]]]) -> returns codepoints for all +** characters that start in the range [i,j] +*/ +static int codepoint (lua_State *L) { + size_t len; + const char *s = luaL_checklstring(L, 1, &len); + lua_Integer posi = u_posrelat(luaL_optinteger(L, 2, 1), len); + lua_Integer pose = u_posrelat(luaL_optinteger(L, 3, posi), len); + int lax = lua_toboolean(L, 4); + int n; + const char *se; + luaL_argcheck(L, posi >= 1, 2, "out of bounds"); + luaL_argcheck(L, pose <= (lua_Integer)len, 3, "out of bounds"); + if (posi > pose) return 0; /* empty interval; return no values */ + if (pose - posi >= INT_MAX) /* (lua_Integer -> int) overflow? */ + return luaL_error(L, "string slice too long"); + n = (int)(pose - posi) + 1; /* upper bound for number of returns */ + luaL_checkstack(L, n, "string slice too long"); + n = 0; /* count the number of returns */ + se = s + pose; /* string end */ + for (s += posi - 1; s < se;) { + utfint code; + s = utf8_decode(s, &code, !lax); + if (s == NULL) + return luaL_error(L, "invalid UTF-8 code"); + lua_pushinteger(L, code); + n++; + } + return n; +} + + +static void pushutfchar (lua_State *L, int arg) { + lua_Unsigned code = (lua_Unsigned)luaL_checkinteger(L, arg); + luaL_argcheck(L, code <= MAXUTF, arg, "value out of range"); + lua_pushfstring(L, "%U", (long)code); +} + + +/* +** utfchar(n1, n2, ...) -> char(n1)..char(n2)... +*/ +static int utfchar (lua_State *L) { + int n = lua_gettop(L); /* number of arguments */ + if (n == 1) /* optimize common case of single char */ + pushutfchar(L, 1); + else { + int i; + luaL_Buffer b; + luaL_buffinit(L, &b); + for (i = 1; i <= n; i++) { + pushutfchar(L, i); + luaL_addvalue(&b); + } + luaL_pushresult(&b); + } + return 1; +} + + +/* +** offset(s, n, [i]) -> index where n-th character counting from +** position 'i' starts; 0 means character at 'i'. +*/ +static int byteoffset (lua_State *L) { + size_t len; + const char *s = luaL_checklstring(L, 1, &len); + lua_Integer n = luaL_checkinteger(L, 2); + lua_Integer posi = (n >= 0) ? 1 : len + 1; + posi = u_posrelat(luaL_optinteger(L, 3, posi), len); + luaL_argcheck(L, 1 <= posi && --posi <= (lua_Integer)len, 3, + "position out of bounds"); + if (n == 0) { + /* find beginning of current byte sequence */ + while (posi > 0 && iscont(s + posi)) posi--; + } + else { + if (iscont(s + posi)) + return luaL_error(L, "initial position is a continuation byte"); + if (n < 0) { + while (n < 0 && posi > 0) { /* move back */ + do { /* find beginning of previous character */ + posi--; + } while (posi > 0 && iscont(s + posi)); + n++; + } + } + else { + n--; /* do not move for 1st character */ + while (n > 0 && posi < (lua_Integer)len) { + do { /* find beginning of next character */ + posi++; + } while (iscont(s + posi)); /* (cannot pass final '\0') */ + n--; + } + } + } + if (n == 0) /* did it find given character? */ + lua_pushinteger(L, posi + 1); + else /* no such character */ + luaL_pushfail(L); + return 1; +} + + +static int iter_aux (lua_State *L, int strict) { + size_t len; + const char *s = luaL_checklstring(L, 1, &len); + lua_Integer n = lua_tointeger(L, 2) - 1; + if (n < 0) /* first iteration? */ + n = 0; /* start from here */ + else if (n < (lua_Integer)len) { + n++; /* skip current byte */ + while (iscont(s + n)) n++; /* and its continuations */ + } + if (n >= (lua_Integer)len) + return 0; /* no more codepoints */ + else { + utfint code; + const char *next = utf8_decode(s + n, &code, strict); + if (next == NULL) + return luaL_error(L, "invalid UTF-8 code"); + lua_pushinteger(L, n + 1); + lua_pushinteger(L, code); + return 2; + } +} + + +static int iter_auxstrict (lua_State *L) { + return iter_aux(L, 1); +} + +static int iter_auxlax (lua_State *L) { + return iter_aux(L, 0); +} + + +static int iter_codes (lua_State *L) { + int lax = lua_toboolean(L, 2); + luaL_checkstring(L, 1); + lua_pushcfunction(L, lax ? iter_auxlax : iter_auxstrict); + lua_pushvalue(L, 1); + lua_pushinteger(L, 0); + return 3; +} + + +/* pattern to match a single UTF-8 character */ +#define UTF8PATT "[\0-\x7F\xC2-\xFD][\x80-\xBF]*" + + +static const luaL_Reg funcs[] = { + {"offset", byteoffset}, + {"codepoint", codepoint}, + {"char", utfchar}, + {"len", utflen}, + {"codes", iter_codes}, + /* placeholders */ + {"charpattern", NULL}, + {NULL, NULL} +}; + + +LUAMOD_API int luaopen_utf8 (lua_State *L) { + luaL_newlib(L, funcs); + lua_pushlstring(L, UTF8PATT, sizeof(UTF8PATT)/sizeof(char) - 1); + lua_setfield(L, -2, "charpattern"); + return 1; +} + diff --git a/lua-5.4.3/src/lvm.c b/lua-5.4.3/src/lvm.c new file mode 100644 index 0000000..c9729bc --- /dev/null +++ b/lua-5.4.3/src/lvm.c @@ -0,0 +1,1836 @@ +/* +** $Id: lvm.c $ +** Lua virtual machine +** See Copyright Notice in lua.h +*/ + +#define lvm_c +#define LUA_CORE + +#include "lprefix.h" + +#include +#include +#include +#include +#include +#include + +#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" + + +/* +** By default, use jump tables in the main interpreter loop on gcc +** and compatible compilers. +*/ +#if !defined(LUA_USE_JUMPTABLE) +#if defined(__GNUC__) +#define LUA_USE_JUMPTABLE 1 +#else +#define LUA_USE_JUMPTABLE 0 +#endif +#endif + + + +/* limit for table tag-method chains (to avoid infinite loops) */ +#define MAXTAGLOOP 2000 + + +/* +** 'l_intfitsf' checks whether a given integer is in the range that +** can be converted to a float without rounding. Used in comparisons. +*/ + +/* number of bits in the mantissa of a float */ +#define NBM (l_floatatt(MANT_DIG)) + +/* +** Check whether some integers may not fit in a float, testing whether +** (maxinteger >> NBM) > 0. (That implies (1 << NBM) <= maxinteger.) +** (The shifts are done in parts, to avoid shifting by more than the size +** of an integer. In a worst case, NBM == 113 for long double and +** sizeof(long) == 32.) +*/ +#if ((((LUA_MAXINTEGER >> (NBM / 4)) >> (NBM / 4)) >> (NBM / 4)) \ + >> (NBM - (3 * (NBM / 4)))) > 0 + +/* limit for integers that fit in a float */ +#define MAXINTFITSF ((lua_Unsigned)1 << NBM) + +/* check whether 'i' is in the interval [-MAXINTFITSF, MAXINTFITSF] */ +#define l_intfitsf(i) ((MAXINTFITSF + l_castS2U(i)) <= (2 * MAXINTFITSF)) + +#else /* all integers fit in a float precisely */ + +#define l_intfitsf(i) 1 + +#endif + + +/* +** Try to convert a value from string to a number value. +** If the value is not a string or is a string not representing +** a valid numeral (or if coercions from strings to numbers +** are disabled via macro 'cvt2num'), do not modify 'result' +** and return 0. +*/ +static int l_strton (const TValue *obj, TValue *result) { + lua_assert(obj != result); + if (!cvt2num(obj)) /* is object not a string? */ + return 0; + else + return (luaO_str2num(svalue(obj), result) == vslen(obj) + 1); +} + + +/* +** Try to convert a value to a float. The float case is already handled +** by the macro 'tonumber'. +*/ +int luaV_tonumber_ (const TValue *obj, lua_Number *n) { + TValue v; + if (ttisinteger(obj)) { + *n = cast_num(ivalue(obj)); + return 1; + } + else if (l_strton(obj, &v)) { /* string coercible to number? */ + *n = nvalue(&v); /* convert result of 'luaO_str2num' to a float */ + return 1; + } + else + return 0; /* conversion failed */ +} + + +/* +** try to convert a float to an integer, rounding according to 'mode'. +*/ +int luaV_flttointeger (lua_Number n, lua_Integer *p, F2Imod mode) { + lua_Number f = l_floor(n); + if (n != f) { /* not an integral value? */ + if (mode == F2Ieq) return 0; /* fails if mode demands integral value */ + else if (mode == F2Iceil) /* needs ceil? */ + f += 1; /* convert floor to ceil (remember: n != f) */ + } + return lua_numbertointeger(f, p); +} + + +/* +** try to convert a value to an integer, rounding according to 'mode', +** without string coercion. +** ("Fast track" handled by macro 'tointegerns'.) +*/ +int luaV_tointegerns (const TValue *obj, lua_Integer *p, F2Imod mode) { + if (ttisfloat(obj)) + return luaV_flttointeger(fltvalue(obj), p, mode); + else if (ttisinteger(obj)) { + *p = ivalue(obj); + return 1; + } + else + return 0; +} + + +/* +** try to convert a value to an integer. +*/ +int luaV_tointeger (const TValue *obj, lua_Integer *p, F2Imod mode) { + TValue v; + if (l_strton(obj, &v)) /* does 'obj' point to a numerical string? */ + obj = &v; /* change it to point to its corresponding number */ + return luaV_tointegerns(obj, p, mode); +} + + +/* +** Try to convert a 'for' limit to an integer, preserving the semantics +** of the loop. Return true if the loop must not run; otherwise, '*p' +** gets the integer limit. +** (The following explanation assumes a positive step; it is valid for +** negative steps mutatis mutandis.) +** If the limit is an integer or can be converted to an integer, +** rounding down, that is the limit. +** Otherwise, check whether the limit can be converted to a float. If +** the float is too large, clip it to LUA_MAXINTEGER. If the float +** is too negative, the loop should not run, because any initial +** integer value is greater than such limit; so, the function returns +** true to signal that. (For this latter case, no integer limit would be +** correct; even a limit of LUA_MININTEGER would run the loop once for +** an initial value equal to LUA_MININTEGER.) +*/ +static int forlimit (lua_State *L, lua_Integer init, const TValue *lim, + lua_Integer *p, lua_Integer step) { + if (!luaV_tointeger(lim, p, (step < 0 ? F2Iceil : F2Ifloor))) { + /* not coercible to in integer */ + lua_Number flim; /* try to convert to float */ + if (!tonumber(lim, &flim)) /* cannot convert to float? */ + luaG_forerror(L, lim, "limit"); + /* else 'flim' is a float out of integer bounds */ + if (luai_numlt(0, flim)) { /* if it is positive, it is too large */ + if (step < 0) return 1; /* initial value must be less than it */ + *p = LUA_MAXINTEGER; /* truncate */ + } + else { /* it is less than min integer */ + if (step > 0) return 1; /* initial value must be greater than it */ + *p = LUA_MININTEGER; /* truncate */ + } + } + return (step > 0 ? init > *p : init < *p); /* not to run? */ +} + + +/* +** Prepare a numerical for loop (opcode OP_FORPREP). +** Return true to skip the loop. Otherwise, +** after preparation, stack will be as follows: +** ra : internal index (safe copy of the control variable) +** ra + 1 : loop counter (integer loops) or limit (float loops) +** ra + 2 : step +** ra + 3 : control variable +*/ +static int forprep (lua_State *L, StkId ra) { + TValue *pinit = s2v(ra); + TValue *plimit = s2v(ra + 1); + TValue *pstep = s2v(ra + 2); + if (ttisinteger(pinit) && ttisinteger(pstep)) { /* integer loop? */ + lua_Integer init = ivalue(pinit); + lua_Integer step = ivalue(pstep); + lua_Integer limit; + if (step == 0) + luaG_runerror(L, "'for' step is zero"); + setivalue(s2v(ra + 3), init); /* control variable */ + if (forlimit(L, init, plimit, &limit, step)) + return 1; /* skip the loop */ + else { /* prepare loop counter */ + lua_Unsigned count; + if (step > 0) { /* ascending loop? */ + count = l_castS2U(limit) - l_castS2U(init); + if (step != 1) /* avoid division in the too common case */ + count /= l_castS2U(step); + } + else { /* step < 0; descending loop */ + count = l_castS2U(init) - l_castS2U(limit); + /* 'step+1' avoids negating 'mininteger' */ + count /= l_castS2U(-(step + 1)) + 1u; + } + /* store the counter in place of the limit (which won't be + needed anymore) */ + setivalue(plimit, l_castU2S(count)); + } + } + else { /* try making all values floats */ + lua_Number init; lua_Number limit; lua_Number step; + if (l_unlikely(!tonumber(plimit, &limit))) + luaG_forerror(L, plimit, "limit"); + if (l_unlikely(!tonumber(pstep, &step))) + luaG_forerror(L, pstep, "step"); + if (l_unlikely(!tonumber(pinit, &init))) + luaG_forerror(L, pinit, "initial value"); + if (step == 0) + luaG_runerror(L, "'for' step is zero"); + if (luai_numlt(0, step) ? luai_numlt(limit, init) + : luai_numlt(init, limit)) + return 1; /* skip the loop */ + else { + /* make sure internal values are all floats */ + setfltvalue(plimit, limit); + setfltvalue(pstep, step); + setfltvalue(s2v(ra), init); /* internal index */ + setfltvalue(s2v(ra + 3), init); /* control variable */ + } + } + return 0; +} + + +/* +** Execute a step of a float numerical for loop, returning +** true iff the loop must continue. (The integer case is +** written online with opcode OP_FORLOOP, for performance.) +*/ +static int floatforloop (StkId ra) { + lua_Number step = fltvalue(s2v(ra + 2)); + lua_Number limit = fltvalue(s2v(ra + 1)); + lua_Number idx = fltvalue(s2v(ra)); /* internal index */ + idx = luai_numadd(L, idx, step); /* increment index */ + if (luai_numlt(0, step) ? luai_numle(idx, limit) + : luai_numle(limit, idx)) { + chgfltvalue(s2v(ra), idx); /* update internal index */ + setfltvalue(s2v(ra + 3), idx); /* and control variable */ + return 1; /* jump back */ + } + else + return 0; /* finish the loop */ +} + + +/* +** Finish the table access 'val = t[key]'. +** if 'slot' is NULL, 't' is not a table; otherwise, 'slot' points to +** t[k] entry (which must be empty). +*/ +void luaV_finishget (lua_State *L, const TValue *t, TValue *key, StkId val, + const TValue *slot) { + int loop; /* counter to avoid infinite loops */ + const TValue *tm; /* metamethod */ + for (loop = 0; loop < MAXTAGLOOP; loop++) { + if (slot == NULL) { /* 't' is not a table? */ + lua_assert(!ttistable(t)); + tm = luaT_gettmbyobj(L, t, TM_INDEX); + if (l_unlikely(notm(tm))) + luaG_typeerror(L, t, "index"); /* no metamethod */ + /* else will try the metamethod */ + } + else { /* 't' is a table */ + lua_assert(isempty(slot)); + tm = fasttm(L, hvalue(t)->metatable, TM_INDEX); /* table's metamethod */ + if (tm == NULL) { /* no metamethod? */ + setnilvalue(s2v(val)); /* result is nil */ + return; + } + /* else will try the metamethod */ + } + if (ttisfunction(tm)) { /* is metamethod a function? */ + luaT_callTMres(L, tm, t, key, val); /* call it */ + return; + } + t = tm; /* else try to access 'tm[key]' */ + if (luaV_fastget(L, t, key, slot, luaH_get)) { /* fast track? */ + setobj2s(L, val, slot); /* done */ + return; + } + /* else repeat (tail call 'luaV_finishget') */ + } + luaG_runerror(L, "'__index' chain too long; possible loop"); +} + + +/* +** Finish a table assignment 't[key] = val'. +** If 'slot' is NULL, 't' is not a table. Otherwise, 'slot' points +** to the entry 't[key]', or to a value with an absent key if there +** is no such entry. (The value at 'slot' must be empty, otherwise +** 'luaV_fastget' would have done the job.) +*/ +void luaV_finishset (lua_State *L, const TValue *t, TValue *key, + TValue *val, const TValue *slot) { + int loop; /* counter to avoid infinite loops */ + for (loop = 0; loop < MAXTAGLOOP; loop++) { + const TValue *tm; /* '__newindex' metamethod */ + if (slot != NULL) { /* is 't' a table? */ + Table *h = hvalue(t); /* save 't' table */ + lua_assert(isempty(slot)); /* slot must be empty */ + tm = fasttm(L, h->metatable, TM_NEWINDEX); /* get metamethod */ + if (tm == NULL) { /* no metamethod? */ + luaH_finishset(L, h, key, slot, val); /* set new value */ + invalidateTMcache(h); + luaC_barrierback(L, obj2gco(h), val); + return; + } + /* else will try the metamethod */ + } + else { /* not a table; check metamethod */ + tm = luaT_gettmbyobj(L, t, TM_NEWINDEX); + if (l_unlikely(notm(tm))) + luaG_typeerror(L, t, "index"); + } + /* try the metamethod */ + if (ttisfunction(tm)) { + luaT_callTM(L, tm, t, key, val); + return; + } + t = tm; /* else repeat assignment over 'tm' */ + if (luaV_fastget(L, t, key, slot, luaH_get)) { + luaV_finishfastset(L, t, slot, val); + return; /* done */ + } + /* else 'return luaV_finishset(L, t, key, val, slot)' (loop) */ + } + luaG_runerror(L, "'__newindex' chain too long; possible loop"); +} + + +/* +** Compare two strings 'ls' x 'rs', returning an integer less-equal- +** -greater than zero if 'ls' is less-equal-greater than 'rs'. +** The code is a little tricky because it allows '\0' in the strings +** and it uses 'strcoll' (to respect locales) for each segments +** of the strings. +*/ +static int l_strcmp (const TString *ls, const TString *rs) { + const char *l = getstr(ls); + size_t ll = tsslen(ls); + const char *r = getstr(rs); + size_t lr = tsslen(rs); + for (;;) { /* for each segment */ + int temp = strcoll(l, r); + if (temp != 0) /* not equal? */ + return temp; /* done */ + else { /* strings are equal up to a '\0' */ + size_t len = strlen(l); /* index of first '\0' in both strings */ + if (len == lr) /* 'rs' is finished? */ + return (len == ll) ? 0 : 1; /* check 'ls' */ + else if (len == ll) /* 'ls' is finished? */ + return -1; /* 'ls' is less than 'rs' ('rs' is not finished) */ + /* both strings longer than 'len'; go on comparing after the '\0' */ + len++; + l += len; ll -= len; r += len; lr -= len; + } + } +} + + +/* +** Check whether integer 'i' is less than float 'f'. If 'i' has an +** exact representation as a float ('l_intfitsf'), compare numbers as +** floats. Otherwise, use the equivalence 'i < f <=> i < ceil(f)'. +** If 'ceil(f)' is out of integer range, either 'f' is greater than +** all integers or less than all integers. +** (The test with 'l_intfitsf' is only for performance; the else +** case is correct for all values, but it is slow due to the conversion +** from float to int.) +** When 'f' is NaN, comparisons must result in false. +*/ +static int LTintfloat (lua_Integer i, lua_Number f) { + if (l_intfitsf(i)) + return luai_numlt(cast_num(i), f); /* compare them as floats */ + else { /* i < f <=> i < ceil(f) */ + lua_Integer fi; + if (luaV_flttointeger(f, &fi, F2Iceil)) /* fi = ceil(f) */ + return i < fi; /* compare them as integers */ + else /* 'f' is either greater or less than all integers */ + return f > 0; /* greater? */ + } +} + + +/* +** Check whether integer 'i' is less than or equal to float 'f'. +** See comments on previous function. +*/ +static int LEintfloat (lua_Integer i, lua_Number f) { + if (l_intfitsf(i)) + return luai_numle(cast_num(i), f); /* compare them as floats */ + else { /* i <= f <=> i <= floor(f) */ + lua_Integer fi; + if (luaV_flttointeger(f, &fi, F2Ifloor)) /* fi = floor(f) */ + return i <= fi; /* compare them as integers */ + else /* 'f' is either greater or less than all integers */ + return f > 0; /* greater? */ + } +} + + +/* +** Check whether float 'f' is less than integer 'i'. +** See comments on previous function. +*/ +static int LTfloatint (lua_Number f, lua_Integer i) { + if (l_intfitsf(i)) + return luai_numlt(f, cast_num(i)); /* compare them as floats */ + else { /* f < i <=> floor(f) < i */ + lua_Integer fi; + if (luaV_flttointeger(f, &fi, F2Ifloor)) /* fi = floor(f) */ + return fi < i; /* compare them as integers */ + else /* 'f' is either greater or less than all integers */ + return f < 0; /* less? */ + } +} + + +/* +** Check whether float 'f' is less than or equal to integer 'i'. +** See comments on previous function. +*/ +static int LEfloatint (lua_Number f, lua_Integer i) { + if (l_intfitsf(i)) + return luai_numle(f, cast_num(i)); /* compare them as floats */ + else { /* f <= i <=> ceil(f) <= i */ + lua_Integer fi; + if (luaV_flttointeger(f, &fi, F2Iceil)) /* fi = ceil(f) */ + return fi <= i; /* compare them as integers */ + else /* 'f' is either greater or less than all integers */ + return f < 0; /* less? */ + } +} + + +/* +** Return 'l < r', for numbers. +*/ +static int LTnum (const TValue *l, const TValue *r) { + lua_assert(ttisnumber(l) && ttisnumber(r)); + if (ttisinteger(l)) { + lua_Integer li = ivalue(l); + if (ttisinteger(r)) + return li < ivalue(r); /* both are integers */ + else /* 'l' is int and 'r' is float */ + return LTintfloat(li, fltvalue(r)); /* l < r ? */ + } + else { + lua_Number lf = fltvalue(l); /* 'l' must be float */ + if (ttisfloat(r)) + return luai_numlt(lf, fltvalue(r)); /* both are float */ + else /* 'l' is float and 'r' is int */ + return LTfloatint(lf, ivalue(r)); + } +} + + +/* +** Return 'l <= r', for numbers. +*/ +static int LEnum (const TValue *l, const TValue *r) { + lua_assert(ttisnumber(l) && ttisnumber(r)); + if (ttisinteger(l)) { + lua_Integer li = ivalue(l); + if (ttisinteger(r)) + return li <= ivalue(r); /* both are integers */ + else /* 'l' is int and 'r' is float */ + return LEintfloat(li, fltvalue(r)); /* l <= r ? */ + } + else { + lua_Number lf = fltvalue(l); /* 'l' must be float */ + if (ttisfloat(r)) + return luai_numle(lf, fltvalue(r)); /* both are float */ + else /* 'l' is float and 'r' is int */ + return LEfloatint(lf, ivalue(r)); + } +} + + +/* +** return 'l < r' for non-numbers. +*/ +static int lessthanothers (lua_State *L, const TValue *l, const TValue *r) { + lua_assert(!ttisnumber(l) || !ttisnumber(r)); + if (ttisstring(l) && ttisstring(r)) /* both are strings? */ + return l_strcmp(tsvalue(l), tsvalue(r)) < 0; + else + return luaT_callorderTM(L, l, r, TM_LT); +} + + +/* +** Main operation less than; return 'l < r'. +*/ +int luaV_lessthan (lua_State *L, const TValue *l, const TValue *r) { + if (ttisnumber(l) && ttisnumber(r)) /* both operands are numbers? */ + return LTnum(l, r); + else return lessthanothers(L, l, r); +} + + +/* +** return 'l <= r' for non-numbers. +*/ +static int lessequalothers (lua_State *L, const TValue *l, const TValue *r) { + lua_assert(!ttisnumber(l) || !ttisnumber(r)); + if (ttisstring(l) && ttisstring(r)) /* both are strings? */ + return l_strcmp(tsvalue(l), tsvalue(r)) <= 0; + else + return luaT_callorderTM(L, l, r, TM_LE); +} + + +/* +** Main operation less than or equal to; return 'l <= r'. +*/ +int luaV_lessequal (lua_State *L, const TValue *l, const TValue *r) { + if (ttisnumber(l) && ttisnumber(r)) /* both operands are numbers? */ + return LEnum(l, r); + else return lessequalothers(L, l, r); +} + + +/* +** Main operation for equality of Lua values; return 't1 == t2'. +** L == NULL means raw equality (no metamethods) +*/ +int luaV_equalobj (lua_State *L, const TValue *t1, const TValue *t2) { + const TValue *tm; + if (ttypetag(t1) != ttypetag(t2)) { /* not the same variant? */ + if (ttype(t1) != ttype(t2) || ttype(t1) != LUA_TNUMBER) + return 0; /* only numbers can be equal with different variants */ + else { /* two numbers with different variants */ + /* One of them is an integer. If the other does not have an + integer value, they cannot be equal; otherwise, compare their + integer values. */ + lua_Integer i1, i2; + return (luaV_tointegerns(t1, &i1, F2Ieq) && + luaV_tointegerns(t2, &i2, F2Ieq) && + i1 == i2); + } + } + /* values have same type and same variant */ + switch (ttypetag(t1)) { + case LUA_VNIL: case LUA_VFALSE: case LUA_VTRUE: return 1; + case LUA_VNUMINT: return (ivalue(t1) == ivalue(t2)); + case LUA_VNUMFLT: return luai_numeq(fltvalue(t1), fltvalue(t2)); + case LUA_VLIGHTUSERDATA: return pvalue(t1) == pvalue(t2); + case LUA_VLCF: return fvalue(t1) == fvalue(t2); + case LUA_VSHRSTR: return eqshrstr(tsvalue(t1), tsvalue(t2)); + case LUA_VLNGSTR: return luaS_eqlngstr(tsvalue(t1), tsvalue(t2)); + case LUA_VUSERDATA: { + if (uvalue(t1) == uvalue(t2)) return 1; + else if (L == NULL) return 0; + tm = fasttm(L, uvalue(t1)->metatable, TM_EQ); + if (tm == NULL) + tm = fasttm(L, uvalue(t2)->metatable, TM_EQ); + break; /* will try TM */ + } + case LUA_VTABLE: { + if (hvalue(t1) == hvalue(t2)) return 1; + else if (L == NULL) return 0; + tm = fasttm(L, hvalue(t1)->metatable, TM_EQ); + if (tm == NULL) + tm = fasttm(L, hvalue(t2)->metatable, TM_EQ); + break; /* will try TM */ + } + default: + return gcvalue(t1) == gcvalue(t2); + } + if (tm == NULL) /* no TM? */ + return 0; /* objects are different */ + else { + luaT_callTMres(L, tm, t1, t2, L->top); /* call TM */ + return !l_isfalse(s2v(L->top)); + } +} + + +/* macro used by 'luaV_concat' to ensure that element at 'o' is a string */ +#define tostring(L,o) \ + (ttisstring(o) || (cvt2str(o) && (luaO_tostring(L, o), 1))) + +#define isemptystr(o) (ttisshrstring(o) && tsvalue(o)->shrlen == 0) + +/* copy strings in stack from top - n up to top - 1 to buffer */ +static void copy2buff (StkId top, int n, char *buff) { + size_t tl = 0; /* size already copied */ + do { + size_t l = vslen(s2v(top - n)); /* length of string being copied */ + memcpy(buff + tl, svalue(s2v(top - n)), l * sizeof(char)); + tl += l; + } while (--n > 0); +} + + +/* +** Main operation for concatenation: concat 'total' values in the stack, +** from 'L->top - total' up to 'L->top - 1'. +*/ +void luaV_concat (lua_State *L, int total) { + if (total == 1) + return; /* "all" values already concatenated */ + do { + StkId top = L->top; + int n = 2; /* number of elements handled in this pass (at least 2) */ + if (!(ttisstring(s2v(top - 2)) || cvt2str(s2v(top - 2))) || + !tostring(L, s2v(top - 1))) + luaT_tryconcatTM(L); + else if (isemptystr(s2v(top - 1))) /* second operand is empty? */ + cast_void(tostring(L, s2v(top - 2))); /* result is first operand */ + else if (isemptystr(s2v(top - 2))) { /* first operand is empty string? */ + 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 = vslen(s2v(top - 1)); + TString *ts; + /* collect total length and number of strings */ + for (n = 1; n < total && tostring(L, s2v(top - n - 1)); n++) { + size_t l = vslen(s2v(top - n - 1)); + if (l_unlikely(l >= (MAX_SIZE/sizeof(char)) - tl)) + luaG_runerror(L, "string length overflow"); + tl += l; + } + if (tl <= LUAI_MAXSHORTLEN) { /* is result a short string? */ + char buff[LUAI_MAXSHORTLEN]; + copy2buff(top, n, buff); /* copy strings to buffer */ + ts = luaS_newlstr(L, buff, tl); + } + else { /* long string; copy strings directly to final result */ + ts = luaS_createlngstrobj(L, tl); + copy2buff(top, n, getstr(ts)); + } + setsvalue2s(L, top - n, ts); /* create result */ + } + 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 */ +} + + +/* +** Main operation 'ra = #rb'. +*/ +void luaV_objlen (lua_State *L, StkId ra, const TValue *rb) { + const TValue *tm; + switch (ttypetag(rb)) { + case LUA_VTABLE: { + Table *h = hvalue(rb); + tm = fasttm(L, h->metatable, TM_LEN); + if (tm) break; /* metamethod? break switch to call it */ + setivalue(s2v(ra), luaH_getn(h)); /* else primitive len */ + return; + } + case LUA_VSHRSTR: { + setivalue(s2v(ra), tsvalue(rb)->shrlen); + return; + } + case LUA_VLNGSTR: { + setivalue(s2v(ra), tsvalue(rb)->u.lnglen); + return; + } + default: { /* try metamethod */ + tm = luaT_gettmbyobj(L, rb, TM_LEN); + if (l_unlikely(notm(tm))) /* no metamethod? */ + luaG_typeerror(L, rb, "get length of"); + break; + } + } + luaT_callTMres(L, tm, rb, rb, ra); +} + + +/* +** Integer division; return 'm // n', that is, floor(m/n). +** C division truncates its result (rounds towards zero). +** 'floor(q) == trunc(q)' when 'q >= 0' or when 'q' is integer, +** otherwise 'floor(q) == trunc(q) - 1'. +*/ +lua_Integer luaV_idiv (lua_State *L, lua_Integer m, lua_Integer n) { + if (l_unlikely(l_castS2U(n) + 1u <= 1u)) { /* special cases: -1 or 0 */ + if (n == 0) + luaG_runerror(L, "attempt to divide by zero"); + return intop(-, 0, m); /* n==-1; avoid overflow with 0x80000...//-1 */ + } + else { + lua_Integer q = m / n; /* perform C division */ + if ((m ^ n) < 0 && m % n != 0) /* 'm/n' would be negative non-integer? */ + q -= 1; /* correct result for different rounding */ + return q; + } +} + + +/* +** Integer modulus; return 'm % n'. (Assume that C '%' with +** negative operands follows C99 behavior. See previous comment +** about luaV_idiv.) +*/ +lua_Integer luaV_mod (lua_State *L, lua_Integer m, lua_Integer n) { + if (l_unlikely(l_castS2U(n) + 1u <= 1u)) { /* special cases: -1 or 0 */ + if (n == 0) + luaG_runerror(L, "attempt to perform 'n%%0'"); + return 0; /* m % -1 == 0; avoid overflow with 0x80000...%-1 */ + } + else { + lua_Integer r = m % n; + if (r != 0 && (r ^ n) < 0) /* 'm/n' would be non-integer negative? */ + r += n; /* correct result for different rounding */ + return r; + } +} + + +/* +** Float modulus +*/ +lua_Number luaV_modf (lua_State *L, lua_Number m, lua_Number n) { + lua_Number r; + luai_nummod(L, m, n, r); + return r; +} + + +/* number of bits in an integer */ +#define NBITS cast_int(sizeof(lua_Integer) * CHAR_BIT) + +/* +** Shift left operation. (Shift right just negates 'y'.) +*/ +#define luaV_shiftr(x,y) luaV_shiftl(x,-(y)) + +lua_Integer luaV_shiftl (lua_Integer x, lua_Integer y) { + if (y < 0) { /* shift right? */ + if (y <= -NBITS) return 0; + else return intop(>>, x, -y); + } + else { /* shift left */ + if (y >= NBITS) return 0; + else return intop(<<, x, y); + } +} + + +/* +** create a new Lua closure, push it in the stack, and initialize +** its upvalues. +*/ +static void pushclosure (lua_State *L, Proto *p, UpVal **encup, StkId base, + StkId ra) { + int nup = p->sizeupvalues; + Upvaldesc *uv = p->upvalues; + int i; + LClosure *ncl = luaF_newLclosure(L, nup); + ncl->p = p; + setclLvalue2s(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->upvals[i] = luaF_findupval(L, base + uv[i].idx); + else /* get upvalue from enclosing function */ + ncl->upvals[i] = encup[uv[i].idx]; + luaC_objbarrier(L, ncl, ncl->upvals[i]); + } +} + + +/* +** finish execution of an opcode interrupted by a yield +*/ +void luaV_finishOp (lua_State *L) { + CallInfo *ci = L->ci; + StkId base = ci->func + 1; + Instruction inst = *(ci->u.l.savedpc - 1); /* interrupted instruction */ + OpCode op = GET_OPCODE(inst); + switch (op) { /* finish its execution */ + case OP_MMBIN: case OP_MMBINI: case OP_MMBINK: { + setobjs2s(L, base + GETARG_A(*(ci->u.l.savedpc - 2)), --L->top); + break; + } + case OP_UNM: case OP_BNOT: case OP_LEN: + case OP_GETTABUP: case OP_GETTABLE: case OP_GETI: + case OP_GETFIELD: case OP_SELF: { + setobjs2s(L, base + GETARG_A(inst), --L->top); + break; + } + case OP_LT: case OP_LE: + case OP_LTI: case OP_LEI: + case OP_GTI: case OP_GEI: + case OP_EQ: { /* note that 'OP_EQI'/'OP_EQK' cannot yield */ + int res = !l_isfalse(s2v(L->top - 1)); + L->top--; +#if defined(LUA_COMPAT_LT_LE) + if (ci->callstatus & CIST_LEQ) { /* "<=" using "<" instead? */ + ci->callstatus ^= CIST_LEQ; /* clear mark */ + res = !res; /* negate result */ + } +#endif + lua_assert(GET_OPCODE(*ci->u.l.savedpc) == OP_JMP); + if (res != GETARG_k(inst)) /* condition failed? */ + ci->u.l.savedpc++; /* skip jump instruction */ + break; + } + case OP_CONCAT: { + StkId top = L->top - 1; /* top when 'luaT_tryconcatTM' was called */ + int a = GETARG_A(inst); /* first element to concatenate */ + int total = cast_int(top - 1 - (base + a)); /* yet to concatenate */ + setobjs2s(L, top - 2, top); /* put TM result in proper position */ + L->top = top - 1; /* top is one after last element (at top-2) */ + luaV_concat(L, total); /* concat them (may yield again) */ + break; + } + case OP_CLOSE: case OP_RETURN: { /* yielded closing variables */ + ci->u.l.savedpc--; /* repeat instruction to close other vars. */ + break; + } + default: { + /* only these other opcodes can yield */ + lua_assert(op == OP_TFORCALL || op == OP_CALL || + op == OP_TAILCALL || op == OP_SETTABUP || op == OP_SETTABLE || + op == OP_SETI || op == OP_SETFIELD); + break; + } + } +} + + + + +/* +** {================================================================== +** Macros for arithmetic/bitwise/comparison opcodes in 'luaV_execute' +** =================================================================== +*/ + +#define l_addi(L,a,b) intop(+, a, b) +#define l_subi(L,a,b) intop(-, a, b) +#define l_muli(L,a,b) intop(*, a, b) +#define l_band(a,b) intop(&, a, b) +#define l_bor(a,b) intop(|, a, b) +#define l_bxor(a,b) intop(^, a, b) + +#define l_lti(a,b) (a < b) +#define l_lei(a,b) (a <= b) +#define l_gti(a,b) (a > b) +#define l_gei(a,b) (a >= b) + + +/* +** Arithmetic operations with immediate operands. 'iop' is the integer +** operation, 'fop' is the float operation. +*/ +#define op_arithI(L,iop,fop) { \ + TValue *v1 = vRB(i); \ + int imm = GETARG_sC(i); \ + if (ttisinteger(v1)) { \ + lua_Integer iv1 = ivalue(v1); \ + pc++; setivalue(s2v(ra), iop(L, iv1, imm)); \ + } \ + else if (ttisfloat(v1)) { \ + lua_Number nb = fltvalue(v1); \ + lua_Number fimm = cast_num(imm); \ + pc++; setfltvalue(s2v(ra), fop(L, nb, fimm)); \ + }} + + +/* +** Auxiliary function for arithmetic operations over floats and others +** with two register operands. +*/ +#define op_arithf_aux(L,v1,v2,fop) { \ + lua_Number n1; lua_Number n2; \ + if (tonumberns(v1, n1) && tonumberns(v2, n2)) { \ + pc++; setfltvalue(s2v(ra), fop(L, n1, n2)); \ + }} + + +/* +** Arithmetic operations over floats and others with register operands. +*/ +#define op_arithf(L,fop) { \ + TValue *v1 = vRB(i); \ + TValue *v2 = vRC(i); \ + op_arithf_aux(L, v1, v2, fop); } + + +/* +** Arithmetic operations with K operands for floats. +*/ +#define op_arithfK(L,fop) { \ + TValue *v1 = vRB(i); \ + TValue *v2 = KC(i); lua_assert(ttisnumber(v2)); \ + op_arithf_aux(L, v1, v2, fop); } + + +/* +** Arithmetic operations over integers and floats. +*/ +#define op_arith_aux(L,v1,v2,iop,fop) { \ + if (ttisinteger(v1) && ttisinteger(v2)) { \ + lua_Integer i1 = ivalue(v1); lua_Integer i2 = ivalue(v2); \ + pc++; setivalue(s2v(ra), iop(L, i1, i2)); \ + } \ + else op_arithf_aux(L, v1, v2, fop); } + + +/* +** Arithmetic operations with register operands. +*/ +#define op_arith(L,iop,fop) { \ + TValue *v1 = vRB(i); \ + TValue *v2 = vRC(i); \ + op_arith_aux(L, v1, v2, iop, fop); } + + +/* +** Arithmetic operations with K operands. +*/ +#define op_arithK(L,iop,fop) { \ + TValue *v1 = vRB(i); \ + TValue *v2 = KC(i); lua_assert(ttisnumber(v2)); \ + op_arith_aux(L, v1, v2, iop, fop); } + + +/* +** Bitwise operations with constant operand. +*/ +#define op_bitwiseK(L,op) { \ + TValue *v1 = vRB(i); \ + TValue *v2 = KC(i); \ + lua_Integer i1; \ + lua_Integer i2 = ivalue(v2); \ + if (tointegerns(v1, &i1)) { \ + pc++; setivalue(s2v(ra), op(i1, i2)); \ + }} + + +/* +** Bitwise operations with register operands. +*/ +#define op_bitwise(L,op) { \ + TValue *v1 = vRB(i); \ + TValue *v2 = vRC(i); \ + lua_Integer i1; lua_Integer i2; \ + if (tointegerns(v1, &i1) && tointegerns(v2, &i2)) { \ + pc++; setivalue(s2v(ra), op(i1, i2)); \ + }} + + +/* +** Order operations with register operands. 'opn' actually works +** for all numbers, but the fast track improves performance for +** integers. +*/ +#define op_order(L,opi,opn,other) { \ + int cond; \ + TValue *rb = vRB(i); \ + if (ttisinteger(s2v(ra)) && ttisinteger(rb)) { \ + lua_Integer ia = ivalue(s2v(ra)); \ + lua_Integer ib = ivalue(rb); \ + cond = opi(ia, ib); \ + } \ + else if (ttisnumber(s2v(ra)) && ttisnumber(rb)) \ + cond = opn(s2v(ra), rb); \ + else \ + Protect(cond = other(L, s2v(ra), rb)); \ + docondjump(); } + + +/* +** Order operations with immediate operand. (Immediate operand is +** always small enough to have an exact representation as a float.) +*/ +#define op_orderI(L,opi,opf,inv,tm) { \ + int cond; \ + int im = GETARG_sB(i); \ + if (ttisinteger(s2v(ra))) \ + cond = opi(ivalue(s2v(ra)), im); \ + else if (ttisfloat(s2v(ra))) { \ + lua_Number fa = fltvalue(s2v(ra)); \ + lua_Number fim = cast_num(im); \ + cond = opf(fa, fim); \ + } \ + else { \ + int isf = GETARG_C(i); \ + Protect(cond = luaT_callorderiTM(L, s2v(ra), im, inv, isf, tm)); \ + } \ + docondjump(); } + +/* }================================================================== */ + + +/* +** {================================================================== +** Function 'luaV_execute': main interpreter loop +** =================================================================== +*/ + +/* +** some macros for common tasks in 'luaV_execute' +*/ + + +#define RA(i) (base+GETARG_A(i)) +#define RB(i) (base+GETARG_B(i)) +#define vRB(i) s2v(RB(i)) +#define KB(i) (k+GETARG_B(i)) +#define RC(i) (base+GETARG_C(i)) +#define vRC(i) s2v(RC(i)) +#define KC(i) (k+GETARG_C(i)) +#define RKC(i) ((TESTARG_k(i)) ? k + GETARG_C(i) : s2v(base + GETARG_C(i))) + + + +#define updatetrap(ci) (trap = ci->u.l.trap) + +#define updatebase(ci) (base = ci->func + 1) + + +#define updatestack(ci) \ + { if (l_unlikely(trap)) { updatebase(ci); ra = RA(i); } } + + +/* +** Execute a jump instruction. The 'updatetrap' allows signals to stop +** tight loops. (Without it, the local copy of 'trap' could never change.) +*/ +#define dojump(ci,i,e) { pc += GETARG_sJ(i) + e; updatetrap(ci); } + + +/* for test instructions, execute the jump instruction that follows it */ +#define donextjump(ci) { Instruction ni = *pc; dojump(ci, ni, 1); } + +/* +** do a conditional jump: skip next instruction if 'cond' is not what +** was expected (parameter 'k'), else do next instruction, which must +** be a jump. +*/ +#define docondjump() if (cond != GETARG_k(i)) pc++; else donextjump(ci); + + +/* +** Correct global 'pc'. +*/ +#define savepc(L) (ci->u.l.savedpc = pc) + + +/* +** Whenever code can raise errors, the global 'pc' and the global +** 'top' must be correct to report occasional errors. +*/ +#define savestate(L,ci) (savepc(L), L->top = ci->top) + + +/* +** Protect code that, in general, can raise errors, reallocate the +** stack, and change the hooks. +*/ +#define Protect(exp) (savestate(L,ci), (exp), updatetrap(ci)) + +/* special version that does not change the top */ +#define ProtectNT(exp) (savepc(L), (exp), updatetrap(ci)) + +/* +** Protect code that can only raise errors. (That is, it cannnot change +** the stack or hooks.) +*/ +#define halfProtect(exp) (savestate(L,ci), (exp)) + +/* 'c' is the limit of live values in the stack */ +#define checkGC(L,c) \ + { luaC_condGC(L, (savepc(L), L->top = (c)), \ + updatetrap(ci)); \ + luai_threadyield(L); } + + +/* fetch an instruction and prepare its execution */ +#define vmfetch() { \ + if (l_unlikely(trap)) { /* stack reallocation or hooks? */ \ + trap = luaG_traceexec(L, pc); /* handle hooks */ \ + updatebase(ci); /* correct stack */ \ + } \ + i = *(pc++); \ + ra = RA(i); /* WARNING: any stack reallocation invalidates 'ra' */ \ +} + +#define vmdispatch(o) switch(o) +#define vmcase(l) case l: +#define vmbreak break + + +void luaV_execute (lua_State *L, CallInfo *ci) { + LClosure *cl; + TValue *k; + StkId base; + const Instruction *pc; + int trap; +#if LUA_USE_JUMPTABLE +#include "ljumptab.h" +#endif + startfunc: + trap = L->hookmask; + returning: /* trap already set */ + cl = clLvalue(s2v(ci->func)); + k = cl->p->k; + pc = ci->u.l.savedpc; + if (l_unlikely(trap)) { + if (pc == cl->p->code) { /* first instruction (not resuming)? */ + if (cl->p->is_vararg) + trap = 0; /* hooks will start after VARARGPREP instruction */ + else /* check 'call' hook */ + luaD_hookcall(L, ci); + } + ci->u.l.trap = 1; /* assume trap is on, for now */ + } + base = ci->func + 1; + /* main loop of interpreter */ + for (;;) { + Instruction i; /* instruction being executed */ + StkId ra; /* instruction's A register */ + vmfetch(); +// low-level line tracing for debugging Lua +// printf("line: %d\n", luaG_getfuncline(cl->p, pcRel(pc, cl->p))); + lua_assert(base == ci->func + 1); + lua_assert(base <= L->top && L->top < L->stack_last); + /* invalidate top for instructions not expecting it */ + lua_assert(isIT(i) || (cast_void(L->top = base), 1)); + vmdispatch (GET_OPCODE(i)) { + vmcase(OP_MOVE) { + setobjs2s(L, ra, RB(i)); + vmbreak; + } + vmcase(OP_LOADI) { + lua_Integer b = GETARG_sBx(i); + setivalue(s2v(ra), b); + vmbreak; + } + vmcase(OP_LOADF) { + int b = GETARG_sBx(i); + setfltvalue(s2v(ra), cast_num(b)); + vmbreak; + } + vmcase(OP_LOADK) { + TValue *rb = k + GETARG_Bx(i); + setobj2s(L, ra, rb); + vmbreak; + } + vmcase(OP_LOADKX) { + TValue *rb; + rb = k + GETARG_Ax(*pc); pc++; + setobj2s(L, ra, rb); + vmbreak; + } + vmcase(OP_LOADFALSE) { + setbfvalue(s2v(ra)); + vmbreak; + } + vmcase(OP_LFALSESKIP) { + setbfvalue(s2v(ra)); + pc++; /* skip next instruction */ + vmbreak; + } + vmcase(OP_LOADTRUE) { + setbtvalue(s2v(ra)); + vmbreak; + } + vmcase(OP_LOADNIL) { + int b = GETARG_B(i); + do { + setnilvalue(s2v(ra++)); + } while (b--); + vmbreak; + } + vmcase(OP_GETUPVAL) { + int b = GETARG_B(i); + setobj2s(L, ra, cl->upvals[b]->v); + vmbreak; + } + vmcase(OP_SETUPVAL) { + UpVal *uv = cl->upvals[GETARG_B(i)]; + setobj(L, uv->v, s2v(ra)); + luaC_barrier(L, uv, s2v(ra)); + vmbreak; + } + vmcase(OP_GETTABUP) { + const TValue *slot; + TValue *upval = cl->upvals[GETARG_B(i)]->v; + TValue *rc = KC(i); + TString *key = tsvalue(rc); /* key must be a string */ + if (luaV_fastget(L, upval, key, slot, luaH_getshortstr)) { + setobj2s(L, ra, slot); + } + else + Protect(luaV_finishget(L, upval, rc, ra, slot)); + vmbreak; + } + vmcase(OP_GETTABLE) { + const TValue *slot; + TValue *rb = vRB(i); + TValue *rc = vRC(i); + lua_Unsigned n; + if (ttisinteger(rc) /* fast track for integers? */ + ? (cast_void(n = ivalue(rc)), luaV_fastgeti(L, rb, n, slot)) + : luaV_fastget(L, rb, rc, slot, luaH_get)) { + setobj2s(L, ra, slot); + } + else + Protect(luaV_finishget(L, rb, rc, ra, slot)); + vmbreak; + } + vmcase(OP_GETI) { + const TValue *slot; + TValue *rb = vRB(i); + int c = GETARG_C(i); + if (luaV_fastgeti(L, rb, c, slot)) { + setobj2s(L, ra, slot); + } + else { + TValue key; + setivalue(&key, c); + Protect(luaV_finishget(L, rb, &key, ra, slot)); + } + vmbreak; + } + vmcase(OP_GETFIELD) { + const TValue *slot; + TValue *rb = vRB(i); + TValue *rc = KC(i); + TString *key = tsvalue(rc); /* key must be a string */ + if (luaV_fastget(L, rb, key, slot, luaH_getshortstr)) { + setobj2s(L, ra, slot); + } + else + Protect(luaV_finishget(L, rb, rc, ra, slot)); + vmbreak; + } + vmcase(OP_SETTABUP) { + const TValue *slot; + TValue *upval = cl->upvals[GETARG_A(i)]->v; + TValue *rb = KB(i); + TValue *rc = RKC(i); + TString *key = tsvalue(rb); /* key must be a string */ + if (luaV_fastget(L, upval, key, slot, luaH_getshortstr)) { + luaV_finishfastset(L, upval, slot, rc); + } + else + Protect(luaV_finishset(L, upval, rb, rc, slot)); + vmbreak; + } + vmcase(OP_SETTABLE) { + const TValue *slot; + TValue *rb = vRB(i); /* key (table is in 'ra') */ + TValue *rc = RKC(i); /* value */ + lua_Unsigned n; + if (ttisinteger(rb) /* fast track for integers? */ + ? (cast_void(n = ivalue(rb)), luaV_fastgeti(L, s2v(ra), n, slot)) + : luaV_fastget(L, s2v(ra), rb, slot, luaH_get)) { + luaV_finishfastset(L, s2v(ra), slot, rc); + } + else + Protect(luaV_finishset(L, s2v(ra), rb, rc, slot)); + vmbreak; + } + vmcase(OP_SETI) { + const TValue *slot; + int c = GETARG_B(i); + TValue *rc = RKC(i); + if (luaV_fastgeti(L, s2v(ra), c, slot)) { + luaV_finishfastset(L, s2v(ra), slot, rc); + } + else { + TValue key; + setivalue(&key, c); + Protect(luaV_finishset(L, s2v(ra), &key, rc, slot)); + } + vmbreak; + } + vmcase(OP_SETFIELD) { + const TValue *slot; + TValue *rb = KB(i); + TValue *rc = RKC(i); + TString *key = tsvalue(rb); /* key must be a string */ + if (luaV_fastget(L, s2v(ra), key, slot, luaH_getshortstr)) { + luaV_finishfastset(L, s2v(ra), slot, rc); + } + else + Protect(luaV_finishset(L, s2v(ra), rb, rc, slot)); + vmbreak; + } + vmcase(OP_NEWTABLE) { + int b = GETARG_B(i); /* log2(hash size) + 1 */ + int c = GETARG_C(i); /* array size */ + Table *t; + if (b > 0) + b = 1 << (b - 1); /* size is 2^(b - 1) */ + lua_assert((!TESTARG_k(i)) == (GETARG_Ax(*pc) == 0)); + if (TESTARG_k(i)) /* non-zero extra argument? */ + c += GETARG_Ax(*pc) * (MAXARG_C + 1); /* add it to size */ + pc++; /* skip extra argument */ + L->top = ra + 1; /* correct top in case of emergency GC */ + t = luaH_new(L); /* memory allocation */ + sethvalue2s(L, ra, t); + if (b != 0 || c != 0) + luaH_resize(L, t, c, b); /* idem */ + checkGC(L, ra + 1); + vmbreak; + } + vmcase(OP_SELF) { + const TValue *slot; + TValue *rb = vRB(i); + TValue *rc = RKC(i); + TString *key = tsvalue(rc); /* key must be a string */ + setobj2s(L, ra + 1, rb); + if (luaV_fastget(L, rb, key, slot, luaH_getstr)) { + setobj2s(L, ra, slot); + } + else + Protect(luaV_finishget(L, rb, rc, ra, slot)); + vmbreak; + } + vmcase(OP_ADDI) { + op_arithI(L, l_addi, luai_numadd); + vmbreak; + } + vmcase(OP_ADDK) { + op_arithK(L, l_addi, luai_numadd); + vmbreak; + } + vmcase(OP_SUBK) { + op_arithK(L, l_subi, luai_numsub); + vmbreak; + } + vmcase(OP_MULK) { + op_arithK(L, l_muli, luai_nummul); + vmbreak; + } + vmcase(OP_MODK) { + op_arithK(L, luaV_mod, luaV_modf); + vmbreak; + } + vmcase(OP_POWK) { + op_arithfK(L, luai_numpow); + vmbreak; + } + vmcase(OP_DIVK) { + op_arithfK(L, luai_numdiv); + vmbreak; + } + vmcase(OP_IDIVK) { + op_arithK(L, luaV_idiv, luai_numidiv); + vmbreak; + } + vmcase(OP_BANDK) { + op_bitwiseK(L, l_band); + vmbreak; + } + vmcase(OP_BORK) { + op_bitwiseK(L, l_bor); + vmbreak; + } + vmcase(OP_BXORK) { + op_bitwiseK(L, l_bxor); + vmbreak; + } + vmcase(OP_SHRI) { + TValue *rb = vRB(i); + int ic = GETARG_sC(i); + lua_Integer ib; + if (tointegerns(rb, &ib)) { + pc++; setivalue(s2v(ra), luaV_shiftl(ib, -ic)); + } + vmbreak; + } + vmcase(OP_SHLI) { + TValue *rb = vRB(i); + int ic = GETARG_sC(i); + lua_Integer ib; + if (tointegerns(rb, &ib)) { + pc++; setivalue(s2v(ra), luaV_shiftl(ic, ib)); + } + vmbreak; + } + vmcase(OP_ADD) { + op_arith(L, l_addi, luai_numadd); + vmbreak; + } + vmcase(OP_SUB) { + op_arith(L, l_subi, luai_numsub); + vmbreak; + } + vmcase(OP_MUL) { + op_arith(L, l_muli, luai_nummul); + vmbreak; + } + vmcase(OP_MOD) { + op_arith(L, luaV_mod, luaV_modf); + vmbreak; + } + vmcase(OP_POW) { + op_arithf(L, luai_numpow); + vmbreak; + } + vmcase(OP_DIV) { /* float division (always with floats) */ + op_arithf(L, luai_numdiv); + vmbreak; + } + vmcase(OP_IDIV) { /* floor division */ + op_arith(L, luaV_idiv, luai_numidiv); + vmbreak; + } + vmcase(OP_BAND) { + op_bitwise(L, l_band); + vmbreak; + } + vmcase(OP_BOR) { + op_bitwise(L, l_bor); + vmbreak; + } + vmcase(OP_BXOR) { + op_bitwise(L, l_bxor); + vmbreak; + } + vmcase(OP_SHR) { + op_bitwise(L, luaV_shiftr); + vmbreak; + } + vmcase(OP_SHL) { + op_bitwise(L, luaV_shiftl); + vmbreak; + } + vmcase(OP_MMBIN) { + Instruction pi = *(pc - 2); /* original arith. expression */ + TValue *rb = vRB(i); + TMS tm = (TMS)GETARG_C(i); + StkId result = RA(pi); + lua_assert(OP_ADD <= GET_OPCODE(pi) && GET_OPCODE(pi) <= OP_SHR); + Protect(luaT_trybinTM(L, s2v(ra), rb, result, tm)); + vmbreak; + } + vmcase(OP_MMBINI) { + Instruction pi = *(pc - 2); /* original arith. expression */ + int imm = GETARG_sB(i); + TMS tm = (TMS)GETARG_C(i); + int flip = GETARG_k(i); + StkId result = RA(pi); + Protect(luaT_trybiniTM(L, s2v(ra), imm, flip, result, tm)); + vmbreak; + } + vmcase(OP_MMBINK) { + Instruction pi = *(pc - 2); /* original arith. expression */ + TValue *imm = KB(i); + TMS tm = (TMS)GETARG_C(i); + int flip = GETARG_k(i); + StkId result = RA(pi); + Protect(luaT_trybinassocTM(L, s2v(ra), imm, flip, result, tm)); + vmbreak; + } + vmcase(OP_UNM) { + TValue *rb = vRB(i); + lua_Number nb; + if (ttisinteger(rb)) { + lua_Integer ib = ivalue(rb); + setivalue(s2v(ra), intop(-, 0, ib)); + } + else if (tonumberns(rb, nb)) { + setfltvalue(s2v(ra), luai_numunm(L, nb)); + } + else + Protect(luaT_trybinTM(L, rb, rb, ra, TM_UNM)); + vmbreak; + } + vmcase(OP_BNOT) { + TValue *rb = vRB(i); + lua_Integer ib; + if (tointegerns(rb, &ib)) { + setivalue(s2v(ra), intop(^, ~l_castS2U(0), ib)); + } + else + Protect(luaT_trybinTM(L, rb, rb, ra, TM_BNOT)); + vmbreak; + } + vmcase(OP_NOT) { + TValue *rb = vRB(i); + if (l_isfalse(rb)) + setbtvalue(s2v(ra)); + else + setbfvalue(s2v(ra)); + vmbreak; + } + vmcase(OP_LEN) { + Protect(luaV_objlen(L, ra, vRB(i))); + vmbreak; + } + vmcase(OP_CONCAT) { + int n = GETARG_B(i); /* number of elements to concatenate */ + L->top = ra + n; /* mark the end of concat operands */ + ProtectNT(luaV_concat(L, n)); + checkGC(L, L->top); /* 'luaV_concat' ensures correct top */ + vmbreak; + } + vmcase(OP_CLOSE) { + Protect(luaF_close(L, ra, LUA_OK, 1)); + vmbreak; + } + vmcase(OP_TBC) { + /* create new to-be-closed upvalue */ + halfProtect(luaF_newtbcupval(L, ra)); + vmbreak; + } + vmcase(OP_JMP) { + dojump(ci, i, 0); + vmbreak; + } + vmcase(OP_EQ) { + int cond; + TValue *rb = vRB(i); + Protect(cond = luaV_equalobj(L, s2v(ra), rb)); + docondjump(); + vmbreak; + } + vmcase(OP_LT) { + op_order(L, l_lti, LTnum, lessthanothers); + vmbreak; + } + vmcase(OP_LE) { + op_order(L, l_lei, LEnum, lessequalothers); + vmbreak; + } + vmcase(OP_EQK) { + TValue *rb = KB(i); + /* basic types do not use '__eq'; we can use raw equality */ + int cond = luaV_rawequalobj(s2v(ra), rb); + docondjump(); + vmbreak; + } + vmcase(OP_EQI) { + int cond; + int im = GETARG_sB(i); + if (ttisinteger(s2v(ra))) + cond = (ivalue(s2v(ra)) == im); + else if (ttisfloat(s2v(ra))) + cond = luai_numeq(fltvalue(s2v(ra)), cast_num(im)); + else + cond = 0; /* other types cannot be equal to a number */ + docondjump(); + vmbreak; + } + vmcase(OP_LTI) { + op_orderI(L, l_lti, luai_numlt, 0, TM_LT); + vmbreak; + } + vmcase(OP_LEI) { + op_orderI(L, l_lei, luai_numle, 0, TM_LE); + vmbreak; + } + vmcase(OP_GTI) { + op_orderI(L, l_gti, luai_numgt, 1, TM_LT); + vmbreak; + } + vmcase(OP_GEI) { + op_orderI(L, l_gei, luai_numge, 1, TM_LE); + vmbreak; + } + vmcase(OP_TEST) { + int cond = !l_isfalse(s2v(ra)); + docondjump(); + vmbreak; + } + vmcase(OP_TESTSET) { + TValue *rb = vRB(i); + if (l_isfalse(rb) == GETARG_k(i)) + pc++; + else { + setobj2s(L, ra, rb); + donextjump(ci); + } + vmbreak; + } + vmcase(OP_CALL) { + CallInfo *newci; + int b = GETARG_B(i); + int nresults = GETARG_C(i) - 1; + if (b != 0) /* fixed number of arguments? */ + L->top = ra + b; /* top signals number of arguments */ + /* else previous instruction set top */ + savepc(L); /* in case of errors */ + if ((newci = luaD_precall(L, ra, nresults)) == NULL) + updatetrap(ci); /* C call; nothing else to be done */ + else { /* Lua call: run function in this same C frame */ + ci = newci; + ci->callstatus = 0; /* call re-uses 'luaV_execute' */ + goto startfunc; + } + vmbreak; + } + vmcase(OP_TAILCALL) { + int b = GETARG_B(i); /* number of arguments + 1 (function) */ + int nparams1 = GETARG_C(i); + /* delta is virtual 'func' - real 'func' (vararg functions) */ + int delta = (nparams1) ? ci->u.l.nextraargs + nparams1 : 0; + if (b != 0) + L->top = ra + b; + else /* previous instruction set top */ + b = cast_int(L->top - ra); + savepc(ci); /* several calls here can raise errors */ + if (TESTARG_k(i)) { + luaF_closeupval(L, base); /* close upvalues from current call */ + lua_assert(L->tbclist < base); /* no pending tbc variables */ + lua_assert(base == ci->func + 1); + } + while (!ttisfunction(s2v(ra))) { /* not a function? */ + luaD_tryfuncTM(L, ra); /* try '__call' metamethod */ + b++; /* there is now one extra argument */ + checkstackGCp(L, 1, ra); + } + if (!ttisLclosure(s2v(ra))) { /* C function? */ + luaD_precall(L, ra, LUA_MULTRET); /* call it */ + updatetrap(ci); + updatestack(ci); /* stack may have been relocated */ + ci->func -= delta; /* restore 'func' (if vararg) */ + luaD_poscall(L, ci, cast_int(L->top - ra)); /* finish caller */ + updatetrap(ci); /* 'luaD_poscall' can change hooks */ + goto ret; /* caller returns after the tail call */ + } + ci->func -= delta; /* restore 'func' (if vararg) */ + luaD_pretailcall(L, ci, ra, b); /* prepare call frame */ + goto startfunc; /* execute the callee */ + } + vmcase(OP_RETURN) { + int n = GETARG_B(i) - 1; /* number of results */ + int nparams1 = GETARG_C(i); + if (n < 0) /* not fixed? */ + n = cast_int(L->top - ra); /* get what is available */ + savepc(ci); + if (TESTARG_k(i)) { /* may there be open upvalues? */ + if (L->top < ci->top) + L->top = ci->top; + luaF_close(L, base, CLOSEKTOP, 1); + updatetrap(ci); + updatestack(ci); + } + if (nparams1) /* vararg function? */ + ci->func -= ci->u.l.nextraargs + nparams1; + L->top = ra + n; /* set call for 'luaD_poscall' */ + luaD_poscall(L, ci, n); + updatetrap(ci); /* 'luaD_poscall' can change hooks */ + goto ret; + } + vmcase(OP_RETURN0) { + if (l_unlikely(L->hookmask)) { + L->top = ra; + savepc(ci); + luaD_poscall(L, ci, 0); /* no hurry... */ + trap = 1; + } + else { /* do the 'poscall' here */ + int nres; + L->ci = ci->previous; /* back to caller */ + L->top = base - 1; + for (nres = ci->nresults; l_unlikely(nres > 0); nres--) + setnilvalue(s2v(L->top++)); /* all results are nil */ + } + goto ret; + } + vmcase(OP_RETURN1) { + if (l_unlikely(L->hookmask)) { + L->top = ra + 1; + savepc(ci); + luaD_poscall(L, ci, 1); /* no hurry... */ + trap = 1; + } + else { /* do the 'poscall' here */ + int nres = ci->nresults; + L->ci = ci->previous; /* back to caller */ + if (nres == 0) + L->top = base - 1; /* asked for no results */ + else { + setobjs2s(L, base - 1, ra); /* at least this result */ + L->top = base; + for (; l_unlikely(nres > 1); nres--) + setnilvalue(s2v(L->top++)); /* complete missing results */ + } + } + ret: /* return from a Lua function */ + if (ci->callstatus & CIST_FRESH) + return; /* end this frame */ + else { + ci = ci->previous; + goto returning; /* continue running caller in this frame */ + } + } + vmcase(OP_FORLOOP) { + if (ttisinteger(s2v(ra + 2))) { /* integer loop? */ + lua_Unsigned count = l_castS2U(ivalue(s2v(ra + 1))); + if (count > 0) { /* still more iterations? */ + lua_Integer step = ivalue(s2v(ra + 2)); + lua_Integer idx = ivalue(s2v(ra)); /* internal index */ + chgivalue(s2v(ra + 1), count - 1); /* update counter */ + idx = intop(+, idx, step); /* add step to index */ + chgivalue(s2v(ra), idx); /* update internal index */ + setivalue(s2v(ra + 3), idx); /* and control variable */ + pc -= GETARG_Bx(i); /* jump back */ + } + } + else if (floatforloop(ra)) /* float loop */ + pc -= GETARG_Bx(i); /* jump back */ + updatetrap(ci); /* allows a signal to break the loop */ + vmbreak; + } + vmcase(OP_FORPREP) { + savestate(L, ci); /* in case of errors */ + if (forprep(L, ra)) + pc += GETARG_Bx(i) + 1; /* skip the loop */ + vmbreak; + } + vmcase(OP_TFORPREP) { + /* create to-be-closed upvalue (if needed) */ + halfProtect(luaF_newtbcupval(L, ra + 3)); + pc += GETARG_Bx(i); + i = *(pc++); /* go to next instruction */ + lua_assert(GET_OPCODE(i) == OP_TFORCALL && ra == RA(i)); + goto l_tforcall; + } + vmcase(OP_TFORCALL) { + l_tforcall: + /* 'ra' has the iterator function, 'ra + 1' has the state, + 'ra + 2' has the control variable, and 'ra + 3' has the + to-be-closed variable. The call will use the stack after + these values (starting at 'ra + 4') + */ + /* push function, state, and control variable */ + memcpy(ra + 4, ra, 3 * sizeof(*ra)); + L->top = ra + 4 + 3; + ProtectNT(luaD_call(L, ra + 4, GETARG_C(i))); /* do the call */ + updatestack(ci); /* stack may have changed */ + i = *(pc++); /* go to next instruction */ + lua_assert(GET_OPCODE(i) == OP_TFORLOOP && ra == RA(i)); + goto l_tforloop; + } + vmcase(OP_TFORLOOP) { + l_tforloop: + if (!ttisnil(s2v(ra + 4))) { /* continue loop? */ + setobjs2s(L, ra + 2, ra + 4); /* save control variable */ + pc -= GETARG_Bx(i); /* jump back */ + } + vmbreak; + } + vmcase(OP_SETLIST) { + int n = GETARG_B(i); + unsigned int last = GETARG_C(i); + Table *h = hvalue(s2v(ra)); + if (n == 0) + n = cast_int(L->top - ra) - 1; /* get up to the top */ + else + L->top = ci->top; /* correct top in case of emergency GC */ + last += n; + if (TESTARG_k(i)) { + last += GETARG_Ax(*pc) * (MAXARG_C + 1); + pc++; + } + if (last > luaH_realasize(h)) /* needs more space? */ + luaH_resizearray(L, h, last); /* preallocate it at once */ + for (; n > 0; n--) { + TValue *val = s2v(ra + n); + setobj2t(L, &h->array[last - 1], val); + last--; + luaC_barrierback(L, obj2gco(h), val); + } + vmbreak; + } + vmcase(OP_CLOSURE) { + Proto *p = cl->p->p[GETARG_Bx(i)]; + halfProtect(pushclosure(L, p, cl->upvals, base, ra)); + checkGC(L, ra + 1); + vmbreak; + } + vmcase(OP_VARARG) { + int n = GETARG_C(i) - 1; /* required results */ + Protect(luaT_getvarargs(L, ci, ra, n)); + vmbreak; + } + vmcase(OP_VARARGPREP) { + ProtectNT(luaT_adjustvarargs(L, GETARG_A(i), ci, cl->p)); + if (l_unlikely(trap)) { /* previous "Protect" updated trap */ + luaD_hookcall(L, ci); + L->oldpc = 1; /* next opcode will be seen as a "new" line */ + } + updatebase(ci); /* function has new base after adjustment */ + vmbreak; + } + vmcase(OP_EXTRAARG) { + lua_assert(0); + vmbreak; + } + } + } +} + +/* }================================================================== */ diff --git a/lua-5.4.3/src/lvm.h b/lua-5.4.3/src/lvm.h new file mode 100644 index 0000000..1bc16f3 --- /dev/null +++ b/lua-5.4.3/src/lvm.h @@ -0,0 +1,136 @@ +/* +** $Id: lvm.h $ +** Lua virtual machine +** See Copyright Notice in lua.h +*/ + +#ifndef lvm_h +#define lvm_h + + +#include "ldo.h" +#include "lobject.h" +#include "ltm.h" + + +#if !defined(LUA_NOCVTN2S) +#define cvt2str(o) ttisnumber(o) +#else +#define cvt2str(o) 0 /* no conversion from numbers to strings */ +#endif + + +#if !defined(LUA_NOCVTS2N) +#define cvt2num(o) ttisstring(o) +#else +#define cvt2num(o) 0 /* no conversion from strings to numbers */ +#endif + + +/* +** You can define LUA_FLOORN2I if you want to convert floats to integers +** by flooring them (instead of raising an error if they are not +** integral values) +*/ +#if !defined(LUA_FLOORN2I) +#define LUA_FLOORN2I F2Ieq +#endif + + +/* +** Rounding modes for float->integer coercion + */ +typedef enum { + F2Ieq, /* no rounding; accepts only integral values */ + F2Ifloor, /* takes the floor of the number */ + F2Iceil /* takes the ceil of the number */ +} F2Imod; + + +/* convert an object to a float (including string coercion) */ +#define tonumber(o,n) \ + (ttisfloat(o) ? (*(n) = fltvalue(o), 1) : luaV_tonumber_(o,n)) + + +/* convert an object to a float (without string coercion) */ +#define tonumberns(o,n) \ + (ttisfloat(o) ? ((n) = fltvalue(o), 1) : \ + (ttisinteger(o) ? ((n) = cast_num(ivalue(o)), 1) : 0)) + + +/* convert an object to an integer (including string coercion) */ +#define tointeger(o,i) \ + (l_likely(ttisinteger(o)) ? (*(i) = ivalue(o), 1) \ + : luaV_tointeger(o,i,LUA_FLOORN2I)) + + +/* convert an object to an integer (without string coercion) */ +#define tointegerns(o,i) \ + (l_likely(ttisinteger(o)) ? (*(i) = ivalue(o), 1) \ + : luaV_tointegerns(o,i,LUA_FLOORN2I)) + + +#define intop(op,v1,v2) l_castU2S(l_castS2U(v1) op l_castS2U(v2)) + +#define luaV_rawequalobj(t1,t2) luaV_equalobj(NULL,t1,t2) + + +/* +** fast track for 'gettable': if 't' is a table and 't[k]' is present, +** return 1 with 'slot' pointing to 't[k]' (position of final result). +** Otherwise, return 0 (meaning it will have to check metamethod) +** with 'slot' pointing to an empty 't[k]' (if 't' is a table) or NULL +** (otherwise). 'f' is the raw get function to use. +*/ +#define luaV_fastget(L,t,k,slot,f) \ + (!ttistable(t) \ + ? (slot = NULL, 0) /* not a table; 'slot' is NULL and result is 0 */ \ + : (slot = f(hvalue(t), k), /* else, do raw access */ \ + !isempty(slot))) /* result not empty? */ + + +/* +** Special case of 'luaV_fastget' for integers, inlining the fast case +** of 'luaH_getint'. +*/ +#define luaV_fastgeti(L,t,k,slot) \ + (!ttistable(t) \ + ? (slot = NULL, 0) /* not a table; 'slot' is NULL and result is 0 */ \ + : (slot = (l_castS2U(k) - 1u < hvalue(t)->alimit) \ + ? &hvalue(t)->array[k - 1] : luaH_getint(hvalue(t), k), \ + !isempty(slot))) /* result not empty? */ + + +/* +** Finish a fast set operation (when fast get succeeds). In that case, +** 'slot' points to the place to put the value. +*/ +#define luaV_finishfastset(L,t,slot,v) \ + { setobj2t(L, cast(TValue *,slot), v); \ + luaC_barrierback(L, gcvalue(t), v); } + + + + +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 int luaV_tonumber_ (const TValue *obj, lua_Number *n); +LUAI_FUNC int luaV_tointeger (const TValue *obj, lua_Integer *p, F2Imod mode); +LUAI_FUNC int luaV_tointegerns (const TValue *obj, lua_Integer *p, + F2Imod mode); +LUAI_FUNC int luaV_flttointeger (lua_Number n, lua_Integer *p, F2Imod mode); +LUAI_FUNC void luaV_finishget (lua_State *L, const TValue *t, TValue *key, + StkId val, const TValue *slot); +LUAI_FUNC void luaV_finishset (lua_State *L, const TValue *t, TValue *key, + TValue *val, const TValue *slot); +LUAI_FUNC void luaV_finishOp (lua_State *L); +LUAI_FUNC void luaV_execute (lua_State *L, CallInfo *ci); +LUAI_FUNC void luaV_concat (lua_State *L, int total); +LUAI_FUNC lua_Integer luaV_idiv (lua_State *L, lua_Integer x, lua_Integer y); +LUAI_FUNC lua_Integer luaV_mod (lua_State *L, lua_Integer x, lua_Integer y); +LUAI_FUNC lua_Number luaV_modf (lua_State *L, lua_Number x, lua_Number y); +LUAI_FUNC lua_Integer luaV_shiftl (lua_Integer x, lua_Integer y); +LUAI_FUNC void luaV_objlen (lua_State *L, StkId ra, const TValue *rb); + +#endif diff --git a/lua-5.4.3/src/lzio.c b/lua-5.4.3/src/lzio.c new file mode 100644 index 0000000..cd0a02d --- /dev/null +++ b/lua-5.4.3/src/lzio.c @@ -0,0 +1,68 @@ +/* +** $Id: lzio.c $ +** Buffered streams +** See Copyright Notice in lua.h +*/ + +#define lzio_c +#define LUA_CORE + +#include "lprefix.h" + + +#include + +#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; +} + diff --git a/lua-5.4.3/src/lzio.h b/lua-5.4.3/src/lzio.h new file mode 100644 index 0000000..38f397f --- /dev/null +++ b/lua-5.4.3/src/lzio.h @@ -0,0 +1,66 @@ +/* +** $Id: lzio.h $ +** 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_buffremove(buff,i) ((buff)->n -= (i)) +#define luaZ_resetbuffer(buff) ((buff)->n = 0) + + +#define luaZ_resizebuffer(L, buff, size) \ + ((buff)->buffer = luaM_reallocvchar(L, (buff)->buffer, \ + (buff)->buffsize, size), \ + (buff)->buffsize = size) + +#define luaZ_freebuffer(L, buff) luaZ_resizebuffer(L, buff, 0) + + +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 diff --git a/orig_sources/lua-5.4.3.tar.gz b/orig_sources/lua-5.4.3.tar.gz new file mode 100644 index 0000000000000000000000000000000000000000..1e7b11aa77b2cd92c66b1a185a2e844dc5da7c31 GIT binary patch literal 358216 zcmV()K;OR~iwFSfV^3fJ1MFLQbK^#K_rJ!c=%uG-q*@Xbr8#Vkq*@Kdu~^m>ku%Oz zoZ13`CW#2w;t)lD`uyH|-5@|o-Z-(HO2sUD2%?X7pWTWoulL4%?H=^M`rSTz_`G}b zhQ9alAAJwrz1idU=JVCy_1^x$+qZa+@xfsK^}Daso8J$m&8I3#FIVcTXgUAId8PIj zx%bO+{ttelTK<>bot}r0{_SCqfZx7;{ha*YLfj;Oyc@h3>>oh>`|qF>f_5DPB7+qZdsHWFy@@YI(U#>shs?pWw z@$L21<>+dPRZo6s!!K!-s|*MLo7iPMZ!S)!6UHt}iz1wXrh6}{G%%o{W3|9@L5qJ} z>RhWbwPd(zy3}o&NG-|&?^KDQBKMg}utEi4uKhC2LtS*SSCOg`EL6USEyKAQUrnZ` z7Z-n@Uf-y&P)S;1rSfJ)8darMnO80aUD`KFeJ{fLe4$HMs8X@FRx2+l3BQU0rRy{h zK34sz$oq^{{rR7$lX-wPg&%&f0A72e0jfaUJRe`SOT#P?FniGYydi?VAF^t$t z=>LJ!r2o;ZVhO(YK~De0XQ#=Sr{LLnVA6TIYAL{YuGXYd=7q}g6!soN;#!1QR9Tkh zrRwyuPM3t2V3)O#*V4OZeafpuEu-@NOcU14iETH#j3ztKkG1bm^JBLjgg-bGWCl` z=ro455h1Q#gXCOQWf+BJNQQU$0~GF9#dok8+WGeKSmm+m&5ctSU7e}xkLuH8bi45i zy`H+dR#&6Z8My}IH%_mcKqGlq{nqY&lkS=mnb!{TlEd?tq}fS*v@U z7uFl+I?`UDUFY+$LU?x|f)}6N1DZM&Zis_Zop*fv4AyN}DxXXwlDqx@HS^`pIi3YCN}Qi$MD6I8|af z+JuRxEiUq=x0ekvpPkS2wC8Wr)SAz993y-c#*oo_C zynkAudxfGwjM10sNbX>)qf@{BOeVGYNfvgy`Dv}c7EEi%giIrY){u#mhTW|p6C@31 zH$$xe-VSu#Pl}0&jj|T5#J8%Y~_!qZAbOt)6=#>mN z38Nj2z0-MJJ?uLF+m+0ppa0HhQ~y(y_xr&3HT|Er2k)r<-y6LBv;Xr)eA@Dtgz~qB z@lX0cZ{EFo_tjwV_U+!gcNn4m-@)F&>p%NHf5gZAsiR(ugF~q$P;Phc)xh2VPQe5R zefsaM8XO$HIXHa1r@$jMddSoZ$DN*2J7K5>s`KIuap>^L1ur^|J2_WZrJ=qsj1gd@~(i zU)Afvf-CMO0My#3%21IPs0I-jO;um0RUVe5PHcaN)|fG>?@)>*i^^MQR5qyTW?|yx zYZGdb6qH_=&@6;}0|;g0vP$j>ha)sq*)y#OWR3vpA+B>(rXRFll^PYddvW7X%PGcA z$_ws2?76_^h^Y0Z1VMIHUak+FxmVczFw}K`FO;&RX+>J)D0%%fKthnGvGROB3^X>4 zsNB!74+x@u70__f`Mk#!ZL!9T2MlWe4%?tWZo;mU>oCqDP%q$x28hO)Y2Tw>0w`dX z*Qg@JSb6J0)w~fVu7NEOEWjGnY_gcd1*Gc?a3ebv~?Bpyyr{ zm0gDho2XIG6owvvl3Vdg7*$G-&Ix-j_m?3VSCw-U3+kF8=NDw5%{os!?t{m$_NL8l904$k!aEK9 z0xJx@tEDE5P4ud6)?hIS8?#Nz28KX6H7Z)DD$!eTYms`;q7WhwtRv|({FbQ>Xvqd0 zVFNkLYxb3JveO&kRAf~I7)4>hg2JvwutJMf2evQ3dR3_VFfS{Q3JtI*0e}m$c4ML- z27X~)MMOG?%BlTLLVRY2@f_kXbdiCws+bn5RcErQ!u}$SaKxSp>d}{C6_6Z+^{Ftb z5HXRg#|p?qmP*&~U`*kvu(|Eot-b6&MJZKy!xs4 zs>6`E2J`a3Xt-!GIUtC>(V!&3rI}8)=W}=>4-td0?k@YFrmawu1l}-(FE=PQ%uE>v z?QG1LxNG8(al%hnp9zhyQaRKhK@!RkCK&+@YgVx^tqN<=wOVB?DvLo?m#f@brGnK< z)=h{kuz)=)1sUR5J1TMHr1w;&KJE1m9dg-KR%#1)6-o<#2K!!bVCy_j^Fr)U`0zi` zK0;_)`>s+IQ)F3~-GZ=yoYxerL_o}C-j6*OX^>#m;9=nuWgceGw^@bIl8B=rcVVPP zGO&)d#mgyqMDiH;H;v&lGSBA-4Z*DuA#->k;hCr+kTN_;eZR_uGkKM8WI*H~G&0L) zc7GDkc+rMZ(nIb^NLUd<$>f^2yhE3{|)xv@pHTWe?55j_Rsq7 zkN6z@=hMpzb@S=N#dxSXy?+14gJHjaHa(Mp*Y4gxO{tIyNr%0t-ydCd zPMjkerLWQH8NR0D>BZ=TvJxnjy49Rd!2?~gVjcBm+&Q`!U;UtNM;FJPqFh5Ems*z{ zMR*){DB$(|qUfme+tJ744%rI*{FTd$E}NB?qv9p65g#? zzQ^N$GBzTj3&j}rZbLZjkGZC#*1Pw@h?8gTHM7S@S{xT95pj+@wM6dlBuk>u*GVC_ zNjj`8=FL&xJ8?m?LC-ll8-G^Ai_^&j^3+K+^YTuE+jZEbjlQwJIw$stS^F{$gCH&6 zKesFd{tulK{(5G?6C{XsLAWWOc$>H*5Rdvmo3Q^&ulL*)mS6c%y&m?>?55nYF$xZT zzu;l|94!YY17#$rAOnh_#~oZC+j6PAN7~4SeYnaNQGjSu5^yL-Bo%%5B(5K z>OwTokCmo>@gC7R2w3igkKCYaHcPnKVou@;370{Ydr`Bq(sk0=f1t4H(fyf(61L_b zl7_?=|I%JWM=-r0=j67vfG_1>5L#~#qKLnt%hafdq|{Z=O{`3w$@Qb9{Lx+xU9aJ* zOvq-bJfqCrD~i+)5zJAUd3jE~4r%W|t>oTO0gFqJ*&wwr+zr+cMd)+#Lp~?yI>@uI z=~@a(WVNj_O7QYf7B1*^Pu^qb&Q|fn4IQK_K%gp9N_c!E4>9rsQV+-^uI~kTHVqc` zF1&o^Q8t)Hk!GHEo!H}qJ49X>Xen^b(P<^?x*Mqrk(nMbLyK z-DJqU96qbjfIHIhi5x!-kNS9)GMjoPbPubV!3mRBnV7umWil(W_d{m+@UMTB&J4jr zu8n+kR+$@Ue4s`!mq-=s`#io}#yKJ$pTL@r`ux;&R?E;|QVF-|A{u15@}bs%lEz}B zOE6y2z=&!uCe{j(+5~b#4v(JCN`jv=uaxa;ji3n$m15G;;zRCPNUpd9i);8SAM3; z;i(SQcpZz|p#wErrTJaK@)x>vzzQIZJrA?Z}8X(M+S%;HDT~_5$eb)gmO*r}nCa zF;Qw&rJ1%4V+A)r*Vz`l$EH0Nq$J9M?6fN6Aex)i<_c)rsn?1@)eH!f!jgP1P@%eR zPM0!B6SjN@UCKfgJ11Gq&Q0G8h`-TQZxIwOe>{FOclCKIaq+T zSCV>6-2F@@vtmeS<)CQu9LKZ$tCY=y0P7jl4ZgrAOd~%qic?b*-kHV+XA60q?`92|IT`-aky@5auQJK4@h%3v4 zIi7hL*VuIqSJP%msv&CB^QMJgrw^niO##aRfB-TXDz=)X>0Os?@aEB6W059d*?*j{ z>~~H+cm;ylFa?`3O6BU5MOZ4G4vAc~1jUqRywW!-EvuUTivjPS?7L6oN_g2h`ONo* z**d2P))xH!cE>Rlu6_1qnmM&02=g#6%AOw~t*I|eZz0dk<{AKd z4cK}vCev_R8TK%tK3}jhv!fEVZ+IVZdu5d;GCS8r6;c1p3fEFEQAs4qtTKonI;2@i z7)i#!dIpW7ETZv7x=ALfpcj-NB#Xuji&Ntj9hgxX*jQFB$w!+xggd_^nvEutS79kN zvEm>|@x&a!F#iB!CNpN7bkOM*A1lG4V3p;X0}}i8jl-2Qz1n~9M(-(r!aGvKP9yOs zgxNsEL&lUy$nk6^o|kOl+2j}FTCP$fWX5vtMO2c_PK4yy3G!h6?K&SQPuUP+Cu~;m z9X<+3Nx(X*c<8;uO+XT?%{%X@nzTt7354buEDUo`+k~4tPR-2;G1ocMMMg1|{5{z+ zWYEK!~z_MmTHK(M0XC9>-uX|aF zNxODN*QpBbDMJa6bhEJ?G8nU!z_HrTyBGo4%$z+6XV7n7_hwW^$jZX}?L-9%dwg=h zF>FU>?JC}@Xdm%`v8g?XGUuVf^{{jp#KHa}5Pi=7$kv)rWTJ&4HXwanNgWRM)r?ez zl4s7pTUg5~I?mhls;U1`mL|EEbDmf(-*Hi9szH;{BG*9z7X$DP{nbZIhm9s-pg+hs z*#9t|PHdtX%Gu2(1C=}CHl5ftTJR}}OedOB9JY;BSa6cG=0h4_y^>}=GK?^*BFWIK zQW#H8a$KQ=gF&WMV*H!q`F@&nZe6A(hoodEugtk46r?9*P%LMqU}B8o)dz*+#8@iw zxuB3j4s7D}?BZ>@T_xPBsIDtsWFg407IYEgx1v@7XR4$=TgEV(2jjFq6-yBeLzH{=DQl0nwgL08wlOfP) zkZ{>1WFUY}WBg@Gk%j(*2-OMzAS1NreH%aKSd5-hc{*}Ssn>xxUe~>R#FM8HYZ>ph z5uq*hm?OgDC*4*f2shnU7{`_9LBU?y7j>hC2qgw4=lYhd-uyj+>?A3PJ$oV(kVz76 z9q9z{T@!1PKkGa#)Xpn0v!C{ieZAVPi*ptna7bxk&ja%ch>BybgrCH)#vTx{LP+02 zx{DHi1w(NcN?W=qp!mG zT@pA?4i2AEw836e(*}D+)i~Ny(5|H=C1=@`YAcg^Qtqw9s#VL8p3!w50D<7R=VB^W z?#Gp>(@Hp7wKDPpWp_5=wi!g#EK2=5VtVeaOmD22UQ@WcL*>NsvinGO$tRdw*`RcZ zLXOVT$+V5S8cwVKW=nIaUujqFwmiG7z5Hb9=NN50HlLLXp{BnAI=L>OD3F=vUQrih z`hhAS(o0(%jM3c_1`7VwGenJj@++!Oo8lAX?YatC3fK7N50b9&60mj)< zv3>Wo)h|36<@(fKLm;R)qTUAIa1W@fgBTFb!&>@XhwG)X(daPzI=va2;$_ng*m(Dx z$fi~X!9#Jx;$a$FJss{W%6`%UKu!qw9$h9 zY^;u_|Hia>#^2&_U- z1(D3qpZ%RZo_$W8!a!5$?ss2Sw`~@x&OGelw}0DRzBRz60M#E4-xq%PzTn}5y&!c6 zx@}p^b2jJjEV(m`#1MIxK2&49sTAzn^SMYZZV`RJ8w+m}6Mi5OH&Qpr&-1jP>QyD* z(I#O=AIsH07Q4FQDN$L@acs*80~2u(sQ3z3E*z|MI>0%=>p#*{Ugj^Iqyo))2|*Ks zmqv<4rM_7dXx|A1WhyfxGcBEcr_Y~1AN=z3#~u;@A)vAjGVqMi-gIq*xIz_8T>qNY z1TDRE1wH)ip_lQ_$V$L^Hd-;ktXzZrzFyJJJoY1nDwVwfc_T4IjI`!qXDmjfSb<_A z6G2M`dPd`CRg^{m9*sLc;2Z{VSVSkB--8UpFPBXL2G*R*7FiCymQO_4afeuzSGM}N zUR_Nd_(4!O_ci*2$TzdXtMsY>oL$*m@hQRDCXb`+G@YLTO1W^?@Zuvl**I%%ug>c^ zwGn2jfcXN@5s0({cS0;KVc3^oX&e--lY7r>vHGTJLxlS&<^*YBtrH!NEEtIWUiTx~ z10%`Gom6yT;$e-8B|m@yMR@?Dr`T0pQ5R1Agp-+HeY*$m?){{uNq+}6ZjXaUY$D;a z?oz|eS4)%;jRlWue5`}4@M|kL{F=`uWBlZ8OBae?ptKHfY;?i1d_;Du2qPqzV=vOA z4Op(8xMbNK`YDXSs*$dFofGY6d>LNWQ`&DyY3VSKmJWkn6QO{cV!>5XHM1IF%^AZ9 z*`g=n2`W5rM|BK*P@L02+XtVRtUVf*f{x&(*YUI*wJWoVyNGhK;W;Y38@cmvI7KA6jkfUvi_cL?cdF z1t;E-KkkmO>v%wz7amzl#Urv*(8lu~FW6w@+JlyxBZRtw^K}l^DB6k;DBuoun$Qt% z0Jlcvd@CF4O9Y)jf_<<6djH+?m%lsk9~nUZpg>?O!dnMr5VAsNCb~oGS;nqz#QleG zREkzGHOX1oxiNwf2mRS3A>)9=Drb!NKW9G!fsw;U4eGIFN#G&zG2W+R%LVPJ~UqpBIv{g z9SGerQEO&@MdQi^%Ry_@A(Uoh%$_ka!EK&sB#gPz8!JyqZKn_gYJe`i@DzOat(<}H zzO~0J0%qJ*?&PDt3L8XAX!ol^%p=3C%c5O{6C&|EPHTa^h_N~ZgOcIE!!e)Dz}kb? z95Mxgb9F*-88jWg2Xipuh7jJL8`Qjnj&Om94{Dn=8&ZN9yR((LI-o-7D*ShNb$ClL zD6SfK<@dIR@B!`&w;3W>sum0%GUMHrfEfd)R7zLp9t+ay)QhHE9DDv4MvH?e(Q0$C z@hWRuLBS3N8-uD12?7N%F}bB|K03%u%+B_MIT(UI)p;8uh|Cx8x1E9v;-DZZhL?nx z484OlXc~A?o{dqO6kaL(8m-ItJzwr75RSJ12pZ_i0*z>}T9BuB5U!Z{Du3scTK-iV z9y~S8$Mvnk$D@?+;dVR)E_}y<6OoMZh84_?jS{B-g~q&W3h^*fcnR1iIM4*QCdaV=xR zE!%X1<}KiNY2JcfUbnVyf)8%uFX(9LlbP3727fmy6KfHS2K7CHz&8T}pgABHx`ZjU zwha)zLor!uZDlYW`>jM=FRz@`21X}}(Cju-mXek4^A_-K2(qI&`ikul;x($gk12tS z^lOaS1*Hq;VDX2#Geml@?HS+XbI;nR-TJ|+1{Q);?$M}p-*h01`2tonvoki`GDq2u z6q?1@Nc1z2kA|k=*jgl&v~$_{A|(mU?`bWzR)TsSY9Vqvs7tfw8!h#{W zi@JmQF)qT424s<6pn}0R3?Jg=y?}hQ;JP4D9t8)9L~ML0A{f?fMQnpcU6PF28sJNu zSWzq^LNzM}kBM|?3q)8xxEdBRoF-~`z>)~A1@|*Xz7?ca+d>$F=vD?WUy>y|Z@|`& z=>Yro6D%nbV(ldGAtk;AaN<}xFS+&roT@HVBV@_S-|4uD4mh~)f)Dh8`DTo+(orTn zj~D2xVCx|Egh!102U!5hEnx@f9oF4*Q zrZ{*1rP#t?_|W&+a?~!LChTPiuQxh|axWQxKY}12VTl<^?RbnOejT_iTvizUi^tu( zt`~!gn*3iFZCr!Y1zQky%em{$`vwsmb}Fjq5aI*oEK#4IpIQQ)MO}8cKwDlFx=2pd zVZvX`aN~eic^};5e2UZSSyhvnUk?;}H_l)!IfV%Ve3uN(iCWfJ0SEl(|W7!zmJd5OIeAa8K zdz_M%AMbtnz53a4L4EHH=8@$59PLwzA{3FCyrH4X-m3B49|W@?J}>keqozq-U9`$D zep<$cWotc?*aM0If0JT~?i4t};dc0ANX;QGr5w)(#aKzvWDuopxoz&ok$7yt)G#Y2 z;sB$WtzDCV}osSoIRx76JsOK4qgl{H6$UjX+s*u8Ls$>^umSs}rL zROwB$i4hwiAEMVaGXhTB0Z(@Fh~!2`P3~-6L97kp()tFG7*0^2NgwmU$}bUy39oGF zs{yuME4F z>96?gv|U{m7y#4lEY;fE(E5 zIG2od@(TmC`@#e5La+n+!z`)_Pkr#De<-JjjMecs*W1-<-j)#RYVH>;0R|Nr)7iV~ zOE}1W7r;hrPw5L2$>7Ii!7qh)6w;@X9|*6M!gk;-dB}K9MpYP=DBUrPd(-krLo%m= z3^t%Pf)f*kI{zMGlcFX1g~z9Tq4+d5;`>l2K#Aa5@Ww1wTR9TXY>Seqvz*L+)3P6f z&+~?XcnE6)QJP>_=1@l1zZ(RCWl;Pr!pyZ#?hS^JaR4AiR$MLWhM{fY(a-P$dLRB{ zi3-XK5Y-2BcL}pNnEhro2LWVWe)*g8FT3aLlL3HpGJAHq)r~)WDt>rBK6p1GGM%qu z3RCr;N}2>-6m)f>_})_VElTlua3-F%VnhLpoNxuv-3_)+scVQjCecOXrAc*+jx!|W z$^DzEeX@rtIPyJ^#*PCs;%IZR9kj{{h)$8RaRfwm0}&x8e4Lf7N(#Z%r8hgwBbU_# z(N$x;@fcq(6kcFV8s^hKyE~bYfE8a(Bk?VSUzq87rS~2T9B(&&o6f*JOOu4g(Z-l; zfAg7JGo6*wtj@bD2Qc#(L*WiL`$n;5s? zlaJE^cVu^40OxpP>i+B_^}bGQTMnw=nt$ls^5>kJlu33HCSX<*T!B<9xh^G?$5UTS}N0GbaLEmhPXj zdgtvi{QpO6&zh+s9;L8B7p_4UAF)9YDtNx z@YqFi9CX)1ur&-CIUjHYfA7{v91UpSLaJ+XYX0{c(#nph#IIK}s%#^$=%MsBy8Eyd zJ;N3(L>RZ7)}kNz%|auQ(b-0vU7C0Twy^n4$*5sie{bIxw>HQFY>;SixXc%eqGI-2 z^MQdK(hqR6vIf^`kQ!)Tix~6qeDt>L(t263q{Jxtpb0Z%|3r6ebvGEaNN$CbUPMjui;xvI12QV;G78OiwJqnEXc$v+OmByDFtfrxx z_GYy4azo!XI;_0y7<|O)f}>gYu_wNU&Q6zaMt;9~OK7lRJB8p7^BK?`# z= z>i02SM5R*jTMQv*i4Z?g6m?e9YZ`f03q6bOXkv|sV3Z!G{0%$S$R=wy63t{M5amt4Y7!~JFCFgc=(=Kysiy-2Nnus>a*)0C@ikzIFSf?%?igjn%7TNvEUs!!Q8ZgY8X2XCHZTfSwNuS3 zmyizz@W8+;UN)`fm)Dxp51$k7GbtaU!Fsei`mSGq(f(|<8i}l?hx2@HAVf8Ji6jrRq_;x3ffCBLZ zO!OHjk~;#UQq*K*o6Ki$h@zhv(V2ufQmoqNDXiM(dtZLbOwrGjDcWGvJakYIHEWot zyQG+utvmqzx`6}B0YXm&?uhITSQsn{0KhUV8RS$5Wa2qg>jM8Q44Q!C1Ts8a5`<}? zRy9&?NXK=4D-gZtW`2T84&Iz9Ba9-aPta+P)mUdeKwej5iGzjdhfT*z z8Lr04Mj`g3bhx+XrV?HZrKpftL}U9iWFA4okv+FYo^z57q|ZwIxsuF5w7k&V!=ycA znt($D0Jd^yaKugk{HF_FA{zEyMz8E)ZgTQ~0FSqavf4-hkT2X(IRURdBx>Sm-}as- z+IC?INARmhb@bqP+{O2jI2Cf*bO_$nmDe{~AROt21cqN|uTPv)R*)i-G_S&i7qF~LDX`NQL1~K|o>ZZ*`>oAb$eN|sO3FD&R z1IL8kpxR2B827F5$BJ*RC863OCRQPW!c!05Z;tjn@-gH`96@dkWu0ScF#Pt}$RdZ~ zTEeNmt}(dEiOH@BOQOS`qtIpZ1lYnQhV|QL_@!T~@`I1yMpYu8f@s!~^+5%mgX}wZ z@uA%|%v^U3`4b^U0A{HISbe=T3($!Hu+cJeB_NiF4}U&iY0p&!Q0d`9qP4--ysP}T zMSqPwVy5VIcMTAeoqG&Jw(XzI# zkSeTbB1U`$$z|aoIW6JzcIO9+ks!=K3NDJXK!}$+Z9J;}5lAX&-tNy2Fwco!%)OG! zBd>zm#eapn9zoY`yeGF40yy%7yJK_tejl;~G}o|*eC7-o24aA9D|pc$_wLfIf)6&b zhZp;U#s)H+3gJA~9F7cY2N0Nr9C0a)Kh)xJ6a;Kr<6@@+v!t|@XtV=< z=FOuWQW?0#>#9B`?IXV_uU1$77uU6i>(@cF&isl%RdZ1kntaoLgY<=h?I&N!=^dM*f~Gv=xWE)5D%Cf zh8TL}c85~r+M@@?fsRp5`3Ez6xtVWxl9RO0~HNzT>|$vBgcAe1q6Mv)YF(6tZJd^Muo^WiOVh%m&cfO_^R zG~!+mhjlr5Vt16`jh2lSR!6iTTxSnIbw(`}o@Klr=n`l9yvdo2q8UX^v!w+Ze8K_| z^G4Av`NhK#^ALyAnd9ZT?;h^E(&p1_2=av))scU>Z;l^{XiB}NCWAQvLLJ?#Q_TFY zNQU^W&@*)$^p zy%RzxF94Iy5@sFmfqZ}^+WWq9o%rxow4Gt1tE;k2Ha4CkYIOeRZlk+xM#qSl6>yuy zBcimJZg1n z(ewx+7Z9j&^zav*7O!h(AdmE1$~|}TQFudVqniCx#$_a?GWzzv-BjYW+B=t> z)~}h%pt;v2hp%lRSN31IYj0e0@FvN5(DcP;?Y=*26G6vv?us@CR^{$JZVl=vQc^4) zl0kWsndjps)_^dQZ5v|nGgKi>ZQ~$MjG6;woh_AkL1(9H4w)7$I}b@n&ccu@!FBkS zvZc-~Asgp_LXD?%|O2 zE)sW?_pUW#-!5liM=6Dg-7#o61TQmN{xRHLJnDH&l{sRVe#;mg+X<&ny6XhDhX+P? z8bH>MT%I5|dCwt@{yW&`#`UIBn-Dn!K0X)~wYiapF!SC3SPcY{e+A(EV>`b|+3 z=4Q@31zav9NW{p(gjNC_7M8h4#7{B`A(-sI;FCsd3Fi3^Z(Z!3|#inb;lQ1(JA5FN=LrQlqIKnL*wZWW#UE!W$@YxS-?i5er z;K#tzDB&}J502?SB?Bf0oIr=Y5NTf#uwy7w4VZ#ec=3tBj~H`$UWLk|YS8JZEyE*j zo0`d4sh>zTS9|KhrNEAK_#D8_>=*DPKwkET=Wca?BP=hMgncGt8+upKoj|Tj5ILZU z6-K7`Brj!5j{(<03L;6eHV=s*Ryqr?+Sq;(AC+%K|Ms7#Nn&QyEwMc0#BSeh^wr6pJve#OP5+rCS%P8v2a zocTfY8yIEGWGf122}fhDVpgfEljfa&>@d40w=!Yv;9F8}yv)`JM-ob`;i|F+DSN+J zx=1Z8kYbSvwD8>A84K{LNV_ngB*|ic0JSEr|*_{bACde5n8l|@qQf0}G zfCgBIA#PHx15Nhfjr+=)q48@Xck?8~I7Nu(0$T!sKFuEVXPT1u`1DdX{VQdj>!gCu zBp}g%(YiK_IK;u{8cR1N8?GvLS^;z;&hgaPB*4WKLFr6jBuO1HGtv4cp*&#WgMFhW z`3+o4e2yK2PjD_}EQ#^G=*mNoFExM&S`?Xh56vF7^5M&vU5~UUy z9QsYlP|vrcjJX1Z#^2*ys<44)(vNN*cpP{^8{*}18Q}8J>6t76k1`SJ_Q7dj!yDICi{4?2%jES3rdyZc2-D*R&a%V(O`FOk7Mk^K*N#6s$R zXl;I8FUjMMHgiIo3X?hrE?R&f&B8R+-F%2aIz;6Lm0W@V&+-*%DnfAoqCSx2rbb*; z&8mS4BIa+{--gLukWxA6G=}-jn7v6;u@xA`_ZTe2uN=@<9xfF=w_N(!DHybBW6la= zwAyCemGwFcq#w zn-Ml8YMvienvtD{6}He-Vp!>UFs!QFlVL3pwswbN#~CN5N(W)Mw5(2JLi0H4=Vvx?<}M#>BQ?<*MNAA1Cnso_7S^{_&my8bC(l8L z?HnwnwIH`^;V;MVADvpPGc)LB0RLlR;qL0A#ktL4hHrKU1Rr;gvbTnG1b$MzL-z04QgLf~nNIGBwwDrK3eqScOm zSxoV&gB2cK6mL(Lp$cRHUp3!Zv?<2CI+|GE0;@@C@B{ww?4ky7ries@`)pUexymkxa5^A_Ag#aN>rnVj5yO`oNlXV_YE|~rYZIO{77m9lV z%_W>438S4ENmAJtwT`V_HFj=o}j!eIlnfiDha*v{oljUXzTa)mV3LredB)FyS?Kl zzxfPSOyK)P$Dun;OLVbKR})Fku8Yl;xLCE}a^rCv9P;2DKICQSRv-NDi2g(=#r+Rt z2Ke{m@atvztwSz#|JUK`H(c3m&u0$@GH2lnC`Cg#EF3Ap5=y)Qu+d%-E&*lKpDk?v?ZWjG*_IQ@ z9@}+?w#jk@|6RW?IMuzo63Z!twx~1w968_5fx3Z4p1t*telj1TGkC%9cK-?>{;GY}mFMg#xCHDY-qn@)ah$y`ZgG&~x14bQ9)2L{ z-lLA>OE-&G=XJOAf1NjfS=Gnx^QZ9Xzb^4liA1Ah$h-n1SuoEM5~qh*wSO(R*I(mh zo(GsV3JuJw6~*DQwf9jf`tcFOKE7}(5N?WRnlK<`_9c7cvMBa307bGB62%1i@!d*X zB3~7CiRJ6(gn1cZj7^BMHfhC6C#O2Qz*opeqoZ?qsROMd_ zWVq)R;O-H|k&`#iPETQ_IbjEW&L)>RAUvQJe1LA(tHG=QA=w==bCkj-`EpspQl~o) z?8wXVuQdi4wfQ-1Q{achZn-D2M_|Fd1ZETphk!;qgaKQHEu4HEFTBXnCf6bFx>zlW-(Oq+D?ocny&$S(6F z3$9dnlm3Uf)$qTjwMZugU19uRD|-~rn$;eUwu3GP+hY#?^;H;@e!ohY*7grLf^v(xLr zM2<0%kX}6TFM6J+lb2ufL*nmpyG#Sp$8=xN1RS6cJ}}utG7Z4zpu_w_UHaU88L(o363&8pyZUMv^AU`S@6~vuZAJP?tW_vCN8zqQla4d zY@ZVRHIsY+A`b=*!M=Y$6Z-lbeuKdq@ z=9?dv{>SJZFfXPWcdO3KX}{Vkj;eH4=u1fR-V_3(yStMJe)&q%U`uE z&HHi@Yff(3DoE_-FX(~4pg~9krW4B1BrR%=8LsJZIdddQnyt`0Np}PB&!PJ`Cz^n8 zO#|UV?KubMWKocikLgroSne@ns!+h7PksM!Z4WO z(s|Br;3WCOAMo6;Y=bPu^Dmr`P`*X?evXEGxR5U0A5+&S@NluHlObMnebvZHHJ$cV zEkAYZmQ=^Uoe|c1kPU-ip>RT6HluKY`)1f)_uU!J6a%6LZ|NHf{p6#N1*s3L>`WL%PkrD+>>nMP z7<)ITLE-{sK&63J1_3;9FOhUgQ%>IeZaJLgQ^Gc%#mY;>@QN zB~;F6nAzs*+Ks=#h`%pd@o)dW(DY-}-+ED?=x<+!!Jii&in-w^U}2m9F+k40HD>%K zbBZa5gz}YL$cEg2SV@4XH_Q*myjq#GAS?~&A;+e&bOS~4cO!khEL+G5o=cF}+qcT| zoNZUmVY-~BK|$_h2kP_#mVsnt+hTP+%WN@I|NQni$Z(B7qr~@7vmQsy;&%P?)cwyh z@t^oP=Uq(AU_^w7)_ubO`+?>h^ghHo<<^PO*G}~y;>W1u2kfA(*cLpGqPh?4QP5Kc zZvdtQ1;ib_OK~n&8leGWDT#pR1TVAMo`FV#d=`<&$Q*NMiwHW@$Vf2b8#M>qUhhi| z1FWX|^=u#SVks|+B|mQ)7(~AW8$b;RL^+9N+TUY&GAlcoCXi)T1rPS^;~ABj<}&cZ zM;DK_#z-=9f-#BQG?wKOzLzlz6O`JUjw!UOWJ9syiMZ$Gbv~g%nWrWH>t8}_vbG`o z@$ezp5xAJc{$d{gdL*Hl$g3Nkt4>L%uSL7lHAugP3SK^VI(U%J>pxY8N00U%_=kJ) z@K1Yt=G8y_`j_tc;ln>YeEjS1gST(p7xX6-_0v!0r>9Tf@?XI#Zj*<)S0J@TH@53b zX5d9RLcwjWd*%gLuIA|ZR2U`sh)qlsTzNHuGB8#gH=C29aYA7kz@{ePx>})e&L7YR z#$XTFQv?YwmbFtuuIMnz5ZNwtV_uM_gP)}KCTE&OZD_`<$QV11k=v-DOm!TvXvJv9 zJ6}1f$b@^-1{GV~R>WE~U*{E{=|jeh;jetcjzpA_BibLeY*?Og8cGPjbcZnkxy zB68|Npwz~wKGLtyz9Fl<(A8e+v*+@Rm}iN^cLL{a69`Vy7bUAPRu?Mip{4++C8NN@ zKj;u08lfrm7CML|mEHO7HvZcoktZ9WQ1rB;Vi z!yodU?^#XlC{)ofa3Ui<3{4+7exWpZ>3w5xpJF86G6&wNB{(3+0^~OB3<(18o+6=_ z%ar+gPB#W#y1@%}aV?ABBz^?{|M+wF&xbd&8UE|5=U<(CePW!k-Et+vV{fSk5BcAR zj}O0~|2%wraQH>Be}sQMJa`1ZJSSJ`qsPS|efaR^;lbf^`1i@tqs9JXc=U(EgI^yV ze)HAmj~_oi`ugx!KYV(au${5nBO#-SRqXP10k^rNuGRdZ?)bPR^{HO92$#$CLgu7% zc(U26p1_AuNt%QrEfoqN@XDjez0uD$UrrMPv<;k0WHAZT{+a@@&MnFdp@}JZG;m@i zNWvZgMcD7eH4(Y4^f@7r=j*X|Ni z2`Cdikm0T5I>%DGt^C}#@$+DOzVhLI94Fv&2Js7JGcFMWCw7^XiXkqEp5A^n49b>X_~Mm*Cm-tNICd!ll0H#i4& zaLlGrzI+ZA!x@aXHdQS$8R&n8&JhrmW*4FRl35p%h!-b+m6 z)uNnB>~&NX6s2QAS(@OIKoU=G+;)WFdJLy9FhCgg2FNkczn{$Zps{0U`$BSW?^qj+jD8)ccS=nhzIJ*2ArE*}E{tdqW zhuMunSC3KNSBv)6)WE`=rd|?OvZjEmq%F*=B)&AoRXM5W82BrU!c;d)H~Iov=$*<$ zK4t$Ma@MfI=GzbTVDtUfI_@4Wd{R<&R69e&r|xGJb+*vy3^EX0h3@CeqA6v4P&h}4 zA-!`9A0!Tm{OY{CSYe=VCCqG)P{Exn*|Rjx)M-Q)ly)OFE}RcO9ZcA1ix@=IE$Rat zpV9CEcv2pWq7#&>bL$g)>#!{eh|RTx(Mib~*VTn@M(-c*(7Fjkr&dVX-ynA`Di{qU zlR!tk4W9-#nYq~9o8wGPcw*j<=O@b*zOz&_VgNWN1|2t#H6ssje01W3$|aTKhg!P; z+E&R#V3)30^&R+vZDTm@$D2nl-1d@3(F!`^Q78HsK$xN(5QRl;R$||{4KuA_$8g#1 z@1jC*TA(_y;e-xCkql<5d1kobanwZM9TO97aDkV!{GjtmnjL3_x~iEY%L zXq-DS`*Jmyfvy8zJ zsti)?pbYl6yb*x{L-xSl4?m)93rx4Sayt46qZeSt@P`iKhXQF4X@hU_EIl}}?bcx8I=8fhEwec3RvI0d=34-akT?L(2*PiPB|MXVt81iebJf|J1x!pxAG zpO#ZEpgCNWDo-g!Af8SSBy(FiC&(AAicD7_+A^5`GHina>N*0>Hj>QQrQ{gI1KdY7 z;Q4T=P9j?_2lHZZv^GkGbB%tp@y$d&mACqui3P-2mRvtA(jZZUTS>|v+1ttd>lKW_ zCCE&ku&=g3(oiIUBI&>-H9Qx{9XO!j=)>{$-c|R}19qjNS;s`DHq1x!p98 z%(+44Fi$XB&>WrKdok}M34$KLBrABm4)F2u8JQN`L3BS+F)BJI$@m;5 z=rl4{%xWSk87>`tjg@69@OovNxzXpv%-y+erIRULUu38RE=YcrQq#e^3_a3Z4HZ!) z!MBXTW|@|pZ?%)Hn#4Wo8iUoPVcK+8H!UiK_#S^V_?!P=Y(H?n{UiHd{29It3S{5g z?zex0_qBEyx-c!9$x5hTQrK8Zxh9ApXC=q`G_iBC|4bb=ST>+e}df)a{IF4&GE%>V%mAtts zGCHzV2<^38@Bj|Hd9TqbTtS(&VFh3An3~So6V3XJO^Ps-v0Z*J^kx)gdUGB`mARv>oME&PoN^d1K!4$cf_eo}2dG|A zE>sP>lCguqndNSAm+r!%+xZDKxvNZS`FLNg(Jq6pOdIq?bn!?@;p@~NsR0fk^XcE9 z5)9wyf9W5CxBQlW_ETE-Ro6K)!k>RRgOn*&86AsFWj4=0)G6;qV84$o_&jf%liZ)N zxMs7?jB)}}RFo91ctF-I%Vr|;%lF#A?f900SSU3t?|h#|5NRCD2mHM+5KDj{lw?|B zRvsU!xGY9PR6%eEO#zx}2hU@>0(kWYD_~yN3rWmgsgkdH68IDumKJ=*Aw$H7fR|Nn z$bopo30V?6;vr^~Nu<1H;#IP06*Q1qWoOkj2I7Ju(*+WL&oHr`Q9IO%Qe!g8bAXru z6@KGQ1we+`pb3>?rG)m3?Dxv2X{}Io{iJ83YQxa`;D5rRv;T$viY%*7p2S{@z8@pA z6&2=={0}8@;IQ=u?9t$HB15pyhIoXehW4ciU=S^jfmeVf`mz8Vdp89&e-m?UZEh4(H}%X!v3yc}_3;<4lwS(Y0}%uRqo{0`2SbBI_p z>kADS9wu$q*9%$#m`XUZ&f7c#Ae^I-Gcw+f*-m<^DZwg$>!@?WEMW{Th}W>^%OdgI z(Dvt9c+Uj88wrlhAxb+N;yM;+Qm8p(;>OCOhX2aF{v^GiwVCGdJ_*~8!n>X#=sxnJ z3q?mgPg@?Zc^GCV(xR)D4tw2x#%b*qz|Zpx79u0;!Og>MuiXO8+S(ha~PQ5C{v z+tjhf+^%hTa^TFnZ&~5|Y4A4fPzf=I>xOBPGZCPNz=>%dNzDA4xaD|lYpRZb5Iw9T zF#VdZMFTTrtoF8GF%9Mp7e5zMPRm-1K2x32LSr6%*2Aj4j$4xKPf09qL#%w{cde1} z5=rk_NPr_>ouH8+MaH`$fZ*AI0tncQo?t{IgWfo~GCV;F_!5({yM{bQ#sU9Uv?pD) zkIgLizQ;kUjr#M@7!J-6q@wroiyB^oyf3f^FbiS<-gUeSN%%p?_+{P+_7dqcv5uu# z(Zv+oVFvv+6uau<-+tQ8Re~P463=*ry9|cVq|rc3SgjG%y#d%DZ-6mV$BQl_F{z-O z0Y?2Hob1>Tf}7f-3*Tb&7?6>Y9*b&F#fiZPr6jE|iapxH%B3~6@KpjZD^RaL6!Tk6 z?N?SM_>}2&x>*MD8~UX9nN9WwxgCWloMHZuq!YS+P6X?SWyF+ZAj2@e+wk9_iH;6( zQ@tm?fa1h*dVyhpI(Q&mVDdM(rsenJtkUo-(%r8@c3cmA3;=6>Bm;VB55~_BW7ufR zx=o-Locvx~!^dv>;1f4l`-I8NAz@BFxz(@-2ya%^n{P&di_%bNrjKyBAldn%2)Twe z>1b+2W*0RX`8VuTcIcy!-*zWuEM6usog(qxOt{)N2;exQXoRyN(OP3Il9D5#47y?H7TEbl;9~*l6^{dQeo+SzFl=$&0%zUJXwNM0v3ml9& zNZnei?^k=phPvXWY{SAcd-?H&xZ&zcyyY)mAP{SCEWB1S&Ma96#2>WvQX=hMRh)9T zc5C3C(O8#szYnM)L|H9((h>Sy|poY&(qW~V<2v!#_*_!1WM5HaA$SW z=k`klahEf*4Y9f6{wbmbrN+1cPpFH@LqxDAuH z@g9ouVs&>DU3pGIR=@#eC#Gavay!S3vW|XDw80ybolr%kj(}k94Avn^xwYaLgp@Bd zWjTCgEr*ZTa(J3PO*O5f-}^=o@Jf3}h>@#A;evs{0wQ~6RdXHrz=mn3jk8)bL|&D< zulLW3efC&sa}(YDmF@1YIPDq9#zuo9?HjXWX*#UN`^fatio*-kWQaa>5JbE*WDNlK zcAI6P;+M#nfRCNxCrkAi0TUaq21aK7nlYEkC=Ir;eM;{F%PmAWDp*V=wlSul#1Su_ z!`J4N3puc1{i}Pk&nf#&1hrgRinrJieQ@|N02Mt9Nb_j$ewiM;U+#TLVEwNR)GQdX z7|X9bG;C6NfsyPCdwE?iRz70ju zW$B(S%k#B&Cck5^&Qp`S%ACl?X(uuO#kvY_AmZv$2i4Z+l-Ygc8MomSI(%I(yat28 zIUk09fK~>ep1NrPR?nmX+-tYQvmq@GWq`{O1Sw$+CTN8R6Gqp}2k<7Xv2z2PQoMaDhs$-Q7H(rd)l|^xi{&F+{fjSzDDG=H-a}9A?8wyRdOO&z& za3c(9ZlV!C=fFmbc?YEv5CA}wFq0rBYl@L>l6@@i2Y4RYh8*$D!ORRj;W>e+oomwY zxyq+;>AH5%o=@;^y3s+fiECMVh6YKan_3o;JSA=Xqh zgY3e0(-C23+6OD+_M8or6PeR~Z5TV4D>$;4RFPfS!*$MQyf8T5Ck$ZN1jGxEyn#^o zKawqlG_Aqn6vGwXewZ_plf0ohPf=DVzOT!eE60hkRJJ}9OJ9;!k(>R>0R>0WvWmlq zHmtD3YioRV>`c=i``vz>t1nd&<46&l2N~@qki^PH&r(a6nOC!DlQ|;DLe|Mhf($AW z8b-{?Q_1O!%np7I(7H+?WZ`VYIsa&UG2cDDelBz3R?JzX53^DR_e!H=_r_1}si=wF zEu4Rwzan^BQdzhqW>8*bI0Ob7sAC+UxlK~cI?(gAI_jj8C z#((gV2ps$aCPaEeY=rt)M#yb^{}9n=8eCN`{Vygc^}vRu`ZwU;=Vb*dwe7%4pZEw@ zfi?d<&?DWSzLsIXKW@|qA$cj>6_ijkB^DTD)ZR-$ubOK+6^XhPX5{LxA2tL+EUe&8v$eq3eEOb=@!g zsL_qdAQlOAkl+mUkxH}+e6ngVJS4~Ppp;>cS{eXTO*<9;GGxO(oCYJQfec8AI0|ko zV9qquVSs4|oFHp*I7hYi#5_=HHfXy>_5;^VLw*6Op<#g;=L1{R)@Xjw<_Dd3nP{!!!8yKRGYrL}Wt80^O42#**K^#S?qlTSm#JD; z5IWi;VKiz_7#`2VLPNV|SdPLuG{d=m4j+Zz36-Q-GwwT^+$=qP{GA>9&UYBBJB_;= zR(vzQ9h;6y0Th&i&b{6y{LTH>KRN^MbKBu|CC#e84A+6}%SiX+Z@7frg7}9mW8L|M*&JvofIuKW>c}-&@ixn9gS?V1}Z`i9R>slw3xmW`g)xSv5Ckz zH1y^j4gX12XZIhx9c0D}>dFY*YfiwZEvoCr0SsilQTylPG$jfO8z)}Cd$mw>g?0B> zrkD`fkP;5z%w5gD%ziU3zjTeK7Jn*qJ_G0pobu%7cJG8Q?guY6tMir#4ioQw61>Y2 z0aHXLUjHn3o!IK8C0L%*uXo;uaO3{>e-XB(p04I~;UK47-vaiwMco@-<-~9}R znrP>hhaK-$MvsRT;K330oTS5~ln+o0gT#2EP(gg9n)+~R4+^BOS-#MaMS}Fmo9Yc0 zajxkD1eU1^DKbW69&cE*q`d?KT-&4&N5En4516zS8Kh(6ppKCfsTz)7bDy3*fBt;% z%g-NciX$T|n;r^@B%Tu-#xpO^moTG~x zO%iAV3PJyXW>&y?vfeRRN6~x1-qqe|_h^3Pcd{5Gc#oO}GX z?Ktz?6~eHC6*8(p>#d3DREAAj_dOmJmdQL9=^C;DPMJdF&g~lv!?R13FOvye$wm=w z&tvJ=omo#)RZegSmf#LsP!P97~-8_Fw+gIBK;@Be4=Rd?n(sU85U$&V!6Q1C62CR~=YHuVW-D+)d#N`{^<{xfk^7;8c2 z!hop7a7;7Amm=^i}p45Ttag+&?hyd>s#p^cMUgNSNGueTS0F%i&M zp}A6r04cB~$M6Kau2=;MrIbJ)vTs23$~?&?~;sr-qdrT zbrJPd(8_LGUAm?*@|alNmG$SmLuQ=$j-usYm^XfGC_|xZ8QhnvHVkBboTduFp??Oq z2boXZ0Ab$1rM0{JowZojAId3QG@vCb=Lyd_*;xeV0k34hd(tqM5My3=nZOaWsxa62 zLH1S0&KF%6bibsQQ|CtLUPtlmqs-8q`-ehtX-1Q`<{)1<5s_qsD}=l7JqyJ7MmnM5 zM)tyst0mtp-)eBDV;)t`ze=AqB)w?K+D?iAr~fo#F~&T5$gUBvHEB{KW0Mr>agh^X zB`Nz;c3w0z&m>To6F)bTO*)_SOIkM;9_oOdngX^fN{kb&2C}g6$BeBpVt^It1U4@% zP>V!W08*xv?Nl!_`xH_rEKRNFbEDq5%7jtZluX{u8L?U~$T{LM3(V=)Qb;0IlqKcg0l|Y4yV(MF zgI)H`BAl30#6)0(?#x7&#&cDCAew7eST7AFvVT#ZAG%Ph5-U z+rR@KI7^w^0|*I-(9NgNV`fy$&qQ~Wy>amz>Ms3^(><`6by~L`SxWW3S_5t$dGU`BX5MpwG@|}jL5ri_7xTu)npK~5`4skw7+_!onjIA0dS&+%< zCE-`7zUxe7lxm05e2EkV1|Xnb3zhXS!AeF8sVl*lU_mc!^xp(>;sEh3PX=nIc?Jq5 zx6Cc6%hgq0?L*udk=I~eFeLvIX(3S(XKB*@A^WNjD6MD0qY5G}JbIYQh)&XC8kGUN z^tJb_?yQ2Pys}9x?CI0c%mwnY+u(RM_mu-w-PvK9yrAusL zPYq9#RYV_w&c&-PB_w;LAi%AV@mGK=3gPDA5i5p{^hk1u!I8RTs|s$Oj@>~LSdeg! zjCPu9Sd41MgkxLP5hy(4mD<|GP{%ECvg{j+EkWIhM9f>yk%VAD%(%qKI}ZS+axRIl z!>{6WQf@0;7EIqLav^VYP66Sz+7i+kN$50e-zKxI1oJzR)DR^$V9p6Os$s~&2t#eb zV^bO=m?dltedZJ!cNpBFhJ+!Q{WFi}88IO- zWxbIXY)yhGL~TzBAmU;m8KT@eb-Eo*#4tQETn{(+Gng!kXP76U}*35efhu0*h zB*|u;eN~6116%~Lnr$^lty_{LgEF{eLgm!4ei^9%HwCBx}x+s??|0Q zpaWW#1!pO4Z4AQMr9T4)(Ir4ZbCPHUZJyS#UJyS>i!$Dp`@Qeyv=^y1<{6Xv&nwL#G9mZ4(EY2>F;L z3WzJ?9@@NjeWgc{BpftZHp%93`2H@f+n%5>Zf&BnPGf~OQF_K@@~5EhU}m%ZNx7V? zN+rc*3@aJUGJ`P^TWdfcE0UKnKWzj5I(!JTar7|6wBW&X_|U$BHV(!8M6Uq8$-T3e z?{!LX&-^>k>cfYfcic}5MpKiEua4iLO%S~WWd+^|E_)dz*L+3*fIZ6iPy^ zo)qd7d^O?R>S#e4poP6ohLFuyWFj_dVOU;Vl15AImk_$!IU>lVWMX|_@XjQIZ zPD%j)fomqKp>1#glB^<4>uFRpnw^G46x3|5UB^#sD7Y7l18f(Dpcw@qFRorW=}Mw-L6;6$RrI3+O@ z%M0)uo7EN^f&TDP!sr}GVV!hLSE3lU;>OB-134>IyF*)*nqfFzGt{N4JDY)wB#@?9KTv(g|G1FJfT~Y=@FpRwRANp2i+y_g^ypuOgJt-0DWFau;aa14jqyc~`_#jwgzfP~Q zUpr|NSIILIA{om5y%Cfe!bS88WCm|J2-+CQbNh9m@{QSQuJ-}kjmg;LzlkWV#Nu8t zr#GE4_0s;vWs;Ln2y{q|28{ z`9}~wtgld1GW<388?~)i(BJ>yg4~0j_=Bj{Ewc!(SjQy8oV`NyTodF!%AR>`a9gO8)ScPm$xKkz?DEnKnd2qO=r6PcBC56 zNpCBVAqm@H4cRs$3t#$g_bN9&utJwfqN< z!1R2xI4p<987Fb!`;v|lQjb+)qtrlxa)A^P)dk7&Y!{pw&qT%C1U)ZCcFbwU+#-Tl0 zhJ|VW{gcP=zzv2i{xPar`WXx_#~ykz&5lcibGI6L#Iow1xvNSUPKF4rqpz=#ybpmn zb9XFPoB%{90@?beoXCOvC;7i1u9Y@WDI~p(WhGB6dQamM1g^%BzLXX*jv3yRL#%AV z0J9*InAs}x+hp3#1dl-AiK4DjVeaT5un?HS7(t;pAx?=01SfeT0L`jIX$@`|j!oI8 z%ctdRj?uk+_^>C!>tRfW7~I+?am+MHhnq=k144>0FT0zCCNx%blDm_R1byZ2qiKk z&B3Ah@B~&OlIue;#I0|VmT5YkL9@EZDH|z&d4OMj7$?6C8P)iUWUe_j26@B5i8@>r zd(ywkaZQHuOF+2dGko;WuJ{tVlrj2K$UI||5Hs_EARX+Ifys18sknIxy3)k#Z@63V ze#h}N7M!eqE@s2dcQO&)Z9}(){mc8hmJ>$RT zSKhvj-uX#z3ZwOlZZ_<+VCRm8d^(1BG2Lgj``A;Aju!VodPX)f_|oKJ?qMX14UAwQ z8fb|Ji0%U*F^9LnD~ly)hy#6-rkKV&`q^o@t7Ri6?dVCyCUgFhk)c$-p1sRLqx_Jm zi==QR{bj~Kc|A^GOMGut%~>RB>*9ejIE$5UJ)Q|!9$0pmuh(#HnN|Z`gKPw;^EBF3VM5yaLyj~#q%E;Y42-Ktd(#J8WTo> zipyFu3ITYa0+ONjB-OjllzcJx58!mHDH&;NL!bmxd|MEDsv3J%WvG&6fhG*S@I53U z#%hj~nG2bn%Usj4i+p70n@4=J`j6GKZC+k2C7*|~!Bh%61DcH=@+Bylh-;a& zl!Y_o$0k8!36z}?6MP`CO7;;s3;8_8lPbliKTaElLwd`f0#j~8ed!l3&U;P{sE%rm z{H{VT2J^*JA4@{a z>(^R!@tFc&E+%vDaA zxG1>AY<{!F364;+JuO-uVPBq|ym(>l^MfBwUY~sb{OtMbH;HhdKF1LjX3xeh+{ zkj38X-j|YRz-?=`G2frGv`|k6>;8*gAd)am+fBHH0GyddgFnAQm_OC_zSsGF_6H?QY z8h1N*I&NA4w=V%@D9M)TVcB?5qYFpiW1=zX&;WwU{e&U35uFj8eO`Qt@O)Ia{$3HV&_qo70BB zEtCytHf6Tks;+<>JsH;V`QDem^Z8C*uY9_ZBS}q680i59Z9_bT6ZX-pGc{rFXMwFJ zk_O#`Uz9}CLK5b(>7)Qh4~5Ogg#0==NMGR5o%@>%pj~0w^Q;z*5J~;b`9~;sD&};e z{bedR$eyLIA-<-^6Kicx#lI6dz$5Jd=q|H6@QErJB*5d1xy0hlZr=hKY^_a<{V~HvkX6nvO)2 z0@9q^@c!7_X+L#ObeD9kO_UIs$#Fq%Vl}_9R6vC{ z2dMen?eFUL3aBik1x`>wypv`pm7wU?{}4(oB}+IbR6Ri02W=vS6azRmVg| zKK2VWC4Nu0(IEejJG~Kewb4$#tPw;&jX@TntE*Lox;we~UDbSRK^~T9U(L4NvQnV48DtK|BT9c# zmnDFe2#SFG8r{eWB3e^r2ka6|=k)~8#7fW05 z0JFQno?er~4y>I8!lR8nnGtHZD#n^ep^nDKU9e3&MDi?13&j(pyzahZ#7Z@Bb2GW* z6I0^pxItLGFP`z8Dh9cd(P4x}&|n$qKbBzA=Z#qp7b-?K?(O7YWQk17X$@xx z$$_>Ov$o9Y@hY;-oh z;s$wwCs9)}_#46z?aHq_$t|^n-UWA<0>tx{=H*b%tMj^T-Tsm|IQZ^3%bA*?rmO})nN|*)4Rk{hk)mc|oPP(Hn6NMi_Bu$9}pY zLEjCA*qy&U$1)tucqk9vlz%NEBndk7Kytzx0UVPm7_pE>5maQ;1sQ;{ID<%5RLx4b z0=zsHF^NJ~`U+rkE`g}Ag~DTQ-OMD{!J*|gjg=ayWq5F4Q;KMD6&0S?%eqGG0yuZB zuIg#d%wv&JS8clJDbgGaylV1u*EF;tJc(NsctbsYYA`eW#IQ949F#b=pdfo<8E`Ul zv!LUH-tP+RTWQMVcDouJ#9x}@74CY?^m;hdkNQJFKXAyI`)aIxn8zdznfRK zv>L=DX?b)GCXyH6DV9D?8D4eeb~t^Qvl(SPFFRog8RfK~ z$Qn3C$zcywmQn{C>1^rCeG}}@9&#Lf&SHROTY-Cm+oEbwCYL__f+82%8Xz#5%#$j1 zp^hnu4Wo_-1*?h+9L2+;aJ|Tw!_D0|^Wqppk0G{bM1Q+C6tJCPzBF{dG{tIK@7unL zh^vuPXbG z#uD?v3I{=&JB#nYE&0T{ly%2taL~N0Nos{C+2)-{RHe%zTtm9cf?x7 zdXOHxGK+NB`r;ZV*&Jj;kLP~q^KR$WAnp+mC38ux7@fz>Qx-a5Y2kQ28Mh9!Ebf@_ z`o*h*h&7wqHf@MQS>fo8tVIwoCXqdGmeO32E3tQW`BdrrGH3wgjr#$8gmmk*MFW;p z$W`97;lxpsaFvN~pZ8iw2GiXWus&#YmMG4aOHV$gk`tL7I078)friUp-0tDGW`%4n zoc=aZFVf`&pSN|Q zW_=jQywGbr5`q$5kkHgECH$ek`!7W5N`IdifKD%7B)jn<*$LeEMvFD9X2su#5Q3MQu>=cqT1DB3NqQ;}bVJ7gx$$UWFDXAN<_u{CWx=Ne zC4j_y31siId*M{iAbJ6fM+7RM3wQwM-NmIF-roz3NlVTLUgmO7hA1j7nRXV0c)G1P z#kBM;(Sb0}t7K;;E20t$g)ed0(m@hIy@TXUeN}Xi5eeU7zhuUymGE5gr_(q?!1Hai z=`M;EUB!0K$+I=*gnNY>9et>N`rcEbNz~Y+YV4j6O|sS|RV!Vvv|x4U$f#uIE&z^Y z=S6oi$$T2%s>7M2&}#Nv4>CZZ)4?R26nzQ8~@ zuF)0LXDX^=gGmpU0{x-$is&Eq9@>Dd@RRcB(IVt@IfZU*hi2bg*5qS%LnQ6Xm>94O~S!~TTKja z)FrC|cwE=5H9x=^ORlYJ_p(|mW#q(Lk9U@Pi`Jo98$3ZGqc8j}bv4_|JL~8Lub+Q= z`sVEQA5UL?{rnGBKL~yZ_P~j6yHBnqt~p48K;}twdotS~tM_PSZ}aysdCP*7sv2U& zfGH+Z^Gn1|O}Qdr{q4VA}`+qdd|?@?&8&l8H{% zm{`0rK20@t(23Hp0n6qp;gfjr&i!W~?YqD2C4>^VE0PR$e&@(mJ@YI8>zbG0%7TMR z_89b!mdawabQiFjY85a^eI`oqc}#^&j4Se{%Zr?7P>`PreRzdiax>9?EAlIAM-2F&CR< zahW$n2kMa@#(~=k4X*u}!yVz;kX_K$7i3k@twkRLvKVqFt?$*hFJ66h^5RXWOZ@y! z{b4LsQGF2cN+`4Twwl=#Gr z-03^F2wweOok%R6yCZ5+kmo1NC9Wa7Gfr@KOD%F|7P|D%Z@^TsWS2#jEgTz4a0J#W z{=~HnZ&b`PD1s;bXxwJveuQ8LH?V(RT`h#h+g;6&A_%fG`H7=~aA+k0rS)S9MkGKY ziVqS_&+nm?N&8y2<}pGe#o{`cu1Hbon>S8IQBTllNWS~ACL7}0(uA;T4qvnPtpa2V7z&z;$iKKun5Hm{Jt#X~aa~uIEPG)eOKFApG z-H0?rT>vli2{JY_D=NSnP!s7>j!DTpCwYiYK@j(xw^)W-IT6b1FbMv^_8zKpv-LB(lvj@0h zCPW|vXdV;}i-fJ#boLrW3Q}Ves+!7E=~xp~XbR6>Ve3@@b$JzlT!s%vEL^$y;-$7h zc6r{Jvjh64*J3NX|alFk(LqyTI{ zlfUWHqTO+@NnCa9aQ_#z%>7@t%d}z0+Uh!A$psVFxVgeNe|&j%@`tESdf2U&>7c0g zDdF;zYlUvK4K@Dp^!bZGyTAwCnp(xk4~9;6b=%r$F{8mP(QI$-);Fgwo=2U6N2$dF z(K`DQ>BG__o$sZdk?uCAU{hd&2q8Hyv>9RQ)};QGj1Wqwa)HS?5g3fw-c)P&qmnQ` zi!4z;M|HqKMv7S;_fXGH;ZT?ysIGms3Y5F5087a-lRLHTQ=U}F7)mh~m{eUOE(S*0 z6{nP;EpbO7eLoU`k1jQG=Xl;C-!zaIApm8ZopUfJj7xG<$YI7g)0RlyC9X3bfxt6y zR$I9Z&Q!wD*Y4i9qUJ?O(gU-&=3nFqfEX+tLt;)0;;g`D&lhZ8-`?NqZx@D<;y8ezZDliN!9!Fvvs=9W{3+=VL0M|%2t>cFlP}w4ed~Q{yzMkbCDzFMcfGD)aR;NVsOqR$-7%z< z8)~iu97xn9s*)ZZIQV($t2@+ZlsVRSmG<6QbX59ri5#la^p zMuWde2s&`$!2dq`gw)f+!6%=|Z!F(G9q3XXz8DW&d#=WV%h54?grg4Q@4t)7JksB6 zPKB5CHJ&3m4LYJ*G`<$UBl-om5MkOATdlLx?CzB74$@mVl?&OPD2fT_#ej&xT=xh% z15ust&GsH9C^=hWY~FEq8crGU zgdrm2HX`)l^&pbM-m7)iEzxZKHX97dq}~ml{cS49O&^9P2imH^0n^q~DCyF3v&@Ukhf%Kgrbhp>j~LBYdjhVp>cM z&jbj7IRW_m#NnOn*R0Bxr%A4B4T!EFxPHzt8%P`mQopQ%4j^>%JPn3jVSJ-7G@@~^ zh&O52K{k8^{m}#4Yrjgz~&ueb#@Z;Z3YxkSDD)Cr)Xu-ooAqQ$37$ z-ZX9~lfz(FYeHZYAX&JMGRDy}MSoRpav)DdY1OK63;yYMcQxR%Cnr4ywE66lt&>LsBgw(~1qL zVB;*SET1nf^YfxbRz1ur$FwZLO`j`(pk9(v2v_5i>^IEaaToNMU4U}4}Ge@ zCb$4niHJ&35kp#v=iMNR8S98GTRJ5GQp1{4eL?5ORqiB5CRG17p;Ol;fkak_8S8!J zMska3`izDNFf{YJeoqa7@YXgOpXk7#YYa%%d?M^?QWU}{1y0e9p@YG^8yd?3ZeSB| z7*X{ahy0U_yT9M*zWIuwA>v!O6*m@td$sOcUn6BfTebW3Y@c19)Ceu;!*&I!OTQ6A zx_5wqc&p_V>&inb&oF4UB%f!m8H*X0d{?H0Iz|Nd{>|m` zOK{TbNr#}H^QHs*muKci&@73`!{?zpeBA%@QK}~oYS?i5+d@+ota5rYI=1|&&wxf~ z$tyb!IhJ&;Q)ys^P;2lud38)Fd6jN>~YIXiUjQ^S`WobQf#5ccqIv<~rPj_)2V?6*P}{ph-W|fc($6WBA_? zuQipjaL%-}Kz4y&WHP8!z-EBKjf`lB2!ew;L#D={!efd;#bT>Y6-bd5mmZ+Rov)7^(txSnNQb?ofT+3VAn-v;sM^r**utskD9d=&ye=*gzfzWMRx zv$NAz0o+I*_Jm~W$3MP#{`%{avy^Z-GME%y~Qwl*b+~R8%m=S!V_X>^tMl)iS3~qYQ+kaG<*~a(^j3stU;6 z6YxoQWmZuu|5_|-GKcujnIIE=@`gGb&JMW%6{agWG~*?n*c5Tqu%~yZK0Kdeva)Cd zM1AYDD+8d7OgHIqEb7iy^I6GOj-|WUi$+1^-}#ggn7`9!@$^9K^b8e}~O67rwdEce%DV-Q?a;fmMxG(_{HhES_AYY>=HA z--R3gAr>)s`gHKnlrzA%;-PD(cq`z4ywqSa^{FPBhfULYm6yyAd(2`-ulK|4X(uE) ziE=q5-T9etm1QQ=F*XdEAmN|F157;1Z2EThVz6lOi!nC9YycxYsuXfX@7q_`Nrm~+ ziR^(W4G*@KqlZU-KO8w(`j8a)B2?sYW#O99l2gL8Q&j_D?uTLtN-qNo+(%bncz{#d zX&l$65(zmck_M6jb6rauDd@jWXdWvM4_iQq+7eiiB=c8{WFC8JXr^fKh-VT~T5mnT zMpRA=Ml(ZeqOu8)#frbTCrMS>dJYlObWM0Rv-nY5LB_g?_lpEku^5wx#nelqDu7Ql zCtRLYxPq7h<(}bNM^SY`Yn)8*s_4nhc;g>Vz7B3pe9%RBE_9YTFRS=>J{9i{M{f1j z^XA8|!g}0;HT5*B^LCj}Y*qW)R`valFT$$agEdu2URu^YxVBHWt?ld6--Wfg2Wx7Z z&1=vO%MTbvE46*LZEdHW>P|P-2RP%nzO5_#{#CR-+=F$4Sx;Bi1zS zKWKnls+Qu$?X3cnM4C?h$F{Zo`11R(Huqp%pK^e!I;!tg0(jr4?$v9l?eAOH z^oLGWf7q(7;$|{mH2|9RwQfD2Z@!C87WZIHo%3P_fkdVIr;O&jJ%<0^zQWgWh3h)G z#3=f(#tT>DMO|oeJ7()>uA&X&Y{GVJ}Wawm^s8>*4 zfQq#&E=5!mV?xwc(f#j&7rfj;e8fsDe_b!9Cgn;-wrMa{z~^XfRmwYt z{R8NYq#?i|GOea=5CJ-9GTNV==IbvetyD zZiDxjh6jeFUM$?ODCQ^k^wnnAI#r(qO_mR$%&**A{#C7KOpKiTm7y&WYxIvV&R#zc zu33H*=+dX0oC2X&mWSILSppVN>e?~+_%R_kF{}tSQ!zWtO)&%HO-N>sagR#XvVq|{ zBJMg1CvL-#52A&e4gGp$1t(gqBhOy#IbanDB2mixVQ+A$r)0L_bw2iJ8i4I>WP;n- zi~IsDuB*kh)61Q1$dSvbxS~K!>Lf7(B+E5NE2J^H$hW_@ro7#<8mZM2?jgwpE0Ze!m5}e2sbVau^W_v9*2~KNaLEDH< zkS*{I!c!dB&@q8}X)67bRM+`6j*94cLq*v4u`9In83~maSe%e#58p*(pt~jarl}Z8 zt&x!(Dfn|Q1%JL#3f?+>Pr^?P14>S6{a_TK;lnWkS1}mf<6KFe1%~dpC^I46D8*7J z{@uY2JQ8ux;RZQV0y89`Cd#(?ZImB9ypPfM`y^49BKJbPn+80V75+j{zUTrU3^xm$ zBND=|J8~Wpngvq6JFng4J@kfct0|>~OK!WO?n0zu)UF}=U2aE~o^f!P3DggT3EK&M zr@w*7Lcx}PpLq->H4#brXUS1TGj(mHW?6KMnj=;L`fvP;A*y)o`(w zqu`yiz*bi1BAEDXuxFiL^btzX&^`adKm30}A3mjlXlq-2*Igzp@Nc<~KdS-(Em-{F zpmjbqf(r^N=wa!6%A55lCFKN@B|9OGoLnPIY@f8|=R?bUu}K?Dcv(H)BH_`%Cp;pZ zRzV>_8lwQG!kYcMTt-?L?||T!WA3n!1-~SW%a)C%|6b8 z{B}ZT6;6^b+D`~+cxcvjRUjwsbgj%gubTktg%9p!b$a<0id-i@J;N7rO(yA9%>H?? zkKavAf_1*9438v)O~PDpife?#=z9d2Qea*-3}f7^1C+_c_f6UWi!dFqv_MxZ_}nR* zuH?++`4%joHR7W|*aCz+j3mibx!W~4 zB?HEBn0nbNFey0A%H652=oh;CA&y{-gmU|0@mL7C8%6vPH7a`_IV7X;q>j_vb-TiF z$?M{ra=$=G5XuX{hvH`K)^`jinaY5#o0!Qb!zjc0# zIC>iEbIKK8Oj8u`PHTuaJwFOUNcm_Fvb+vFHUNXfsB^bPtG2EaZ-h4`n$09wea*xr(%0o-J$vKqcra285KbhvoDlL{2+VHSM8yM zRB1Ai0A7yO$OJY{_HAaR(x)oUgQt+{nhqksORCHxwVQiM{$pTNUbUR!N@NRCMjirD zkt!YXkWYB2T2ct`qCqD5e=h3f`TrBTRiFPqU9ajyW*C`Q|FR+^IlEP#KHb)Z`y%r9 zzesrdgR16~>MpOW(|GIJo=3GM=-RrqNe69>Q3p49jNRxv;Vj&{@MP<)TWyIAeMTJ+QcVNb1axc0}kYZPa5OW9EhX^62P7q`+2#cqcU-Aw(9NP~SwO(D!Bk&rD z)nOiDJ&46&1i;}D3b9d_T)_`hH5FG22!cS0`vWsD;(8(c08+Z!GXtYt!;{0E6Y;J0 z=m29H$#{r=Y<8m8i`#IiEN<^vDt0BN)(F_z%IOXL(bkF3phd~EY|=m5QKn%A)$(pq6iD|?-NS-D} zI>dZ~3S3Q!<7^QZ?;5_Lc$zb*B-2U;S_zR>z@5s9wEHKNgVxN2k28stTo@TFid9_y zs)P+*7W0MdWF#5CmLv=q)(NR$rXS#kY|UuchWZb+xdc z!{7I6%z*+oIfJYX?)Sha!63o`bb{Mb zD}n$GFJ3}rF(uE2>1A4th>MHHUUptW<)S&V<^JA&LR9lAI+KD(@4|%1K@O?8g*@uY zu;$a7IB^z(vs^Kk4iBy-M)o_BQXEg_t0@^5BxfG(P-N1e$U3{F#+WPtP9rvG#Zs}N zOyp`um<76kEoqGCv6*FbqLDn#9+FT(m@H2wouzz|3Q}?65Ec?Fz&KvNe`jw@tFV4= zA9}^^!y3hoMq`aJ>@~-CV>dW80}-b9Te)Xf35kg%T8|Bman_7DdfMh6XcFdw7oBl> z(HW?t6n19$z&%3!VTp)!UJ!?mXc7XR2}Qv zXU|@}c=7z1sCCSH?&D&>!ah&gKqt2oxX&XZZd34^vsXWarM_udDM^iJe?hOGzd1X3 z9kuXvL2lvQi+lF!$CsVLy!%)fZ}Y2qRUzDmg_)tdTz-3g>twwV+%q6fh>LSWWncBz zwk*J6JtbEX#5qjW2;FH1)(zpZ+@PQl@UO#%M~~Of$a9$yUTj0U){BJ=;_9pcut+)y z8G{Jt_&PMFn@)F}g=QIE?nczB{f$I*N^@vn*ERn1&FdduzVrdW(O|j(sB5R?G9z7= zU?a!{%0}&MSRNDyWUy>n1c#2+w&CS7y~$zZ7GQc8qS0b;wVIFpXmSIep`)dV+JH$I z{Fq+3GUH3$fHXQuH9q&bCh!kFS?$VF3nr8;rV;AKx6dV_*%P(I9b7vOrT`oVAkJQ5 z@A0qv&-mBI5uk)HWVpS<5FFVdIQpnVApHK{V4i3s^~VHP1C@aqIcvcQ5;PUeTik8l zGIGg0zyT>Z20_{J^+{^OC#z{Bq?j34Lymzt5owy)9j4-{ zl2i24DX{CVUKS=N-Y5P;z{f_c7KSCE+ce9?0Um>ag8*C%g&IC=J5H-pK-34mjt zzGa<tVe*ZwlWMfN?roJM=^>InYwcLKZVI z;#&4KN9)0$N7;8~Owmz+k(b%H3)o8*xYagHKx*)J8~DSmchD|l{!fxW43F3Q|3i1O8=-g^)%WYgpdz=CeOg60aX;WY z@oa_xhF=NdlF=Dx9dZjrJlGk|fOjktVt^N=NAs#v$(G*9SQ(h00fWvS>do7 zk}A4Fy|_WU6_81an+pK`2`;vmuU>}qaqwVE-Mp+^g8~={J=ygPUXKo-GPgW`zpn-N z5$+wHRGI|i{U2vYzyL?uYGIKC4F~Dj#OO7pMNFcX8O!HGKw0!&G{tIK?{j4eUk#p% z-VcE6NxP!V4akcqNQ3@4VDZgP0zXhP=)xX*1^i@6QTl6{*Wp_p9b-T zYG1r^nknG>g$h9M{t}!8!%ZRZemd9g{D#fX!RD8T_j-M5sau`^{gBT16fTV!oqT_M z(bXcst{;MlGG+vWppWl)7_{7vGZ0aL+Fb@DJsuxvI6m%ZX#R{LN7p=qqsHy_5djQ$ z8pyyifdBr;GqmcdW= zJfcC_A7`~;6)N7{Wo(?Z7mf&ufA=~LuEdYgdoQZqso!-~L>+fe?z`v6M0K~WN4-@D z{arg-FS}DMk3T}UvE2LaJLJ9Xt_+p4fBvGtLns;~e0JX>M5o%I@C%wAAsD1dfj@Ye?xT*`l=y(@HrZ!7uE^soqy5qb zr~Q)Rufbg2=R?w}jnE>5JgOB;Kq)QsCXAt53on6`SyyKs{)0}5Op{Q|$eb~hTL z)Zt(83;mHU78QZfAJDONF9D`7Tq!SH`vja%(JGSZSvVAs&jc6Gvfz+7O_rJ*ILqwM zFqSEoopV)L5Kq%_Z-yrj7Y8mYj03nTnkK&p0yWa@usN;d(%f%WfGH}(@k&D;e*qyO zD8XPKu<3~?7@9S^d|unq%=+xazJy#{n#_uJr%z=??pj+xk5u_6*k+>M-;(Yy@c#B>F}MkFrX|*@4YI zI3~g)!r13EQv)U_$-4+pZ)58ov)sHr`siG)*1h$ExoRXUEmP1^e);(=-}Ig3L-Gcz zRTyCHKhIW`8<%oc3hN4a91UJ12b3^#pWjpu4cl;yRBe|Y!pi&tNr zym(`LX4I++r_3#HyM21(d-RC=gJjpRE->>JAR}=jHw}eedJIkvqqSlBAirh7 zf^QLk17Mj1s8kUJyN6N0Nygkrd=>z?)Rf43=5VfPKoOs%dc$yleuQ4?;?s|PHg+JL zM{X0s0~?gR09vU5N&1}BHM}u%=P1Z(ENzzrwd#u#0QW66t4DR8i__`Vw!K z?xjI64xhSQ&z<6?n5=~7)&dftFgl2v73bEhlRVI2RPCRtR=s}f;`2v#scgaOPCB`TUorF1+KkNMy#=* zm-v8FoSV<^u$ZqXf1LlG)6mXrw1%nJ20n7!wGu^i|m~KF#eN#8KtM zO%lqJY9mHZ2lCN%A_h&oAm3%*J3$We`i;dXYKvjcJh)3|u))i}Cbc$*K73?D5lM(6 zF|*qVArM_vZArYPLUKT2DOOZ0*YDua)LJFXtZN~L!=t}H9Bt+!fO5BmdDln-lEO=y z?TIh2OegwzY0|>-h1s#F5paGF`%Rzt2zPqTmD@F~V5DY@==IS4E(6TkVbvv_g6eyY zL*|N=oD)l6k8a%G^SXAbF`m`1yhHwI%~4T?$YZZ#K)#4LL4*^=i9cEykYW7gElOT8 zl%9b6(2fTGJ4|2dzC^wEf&22oV5rsYAEA|T@BpVN_~me9Xp$FB({5+OyTFq(hRT2mVXwl0z@d48 zNiPU3PLW;sTNoWdMnYm}W3(So!*Ddisf~?JT~F@3nY_P+)=cY+GY4>96CzJQS<5wPJYYk~vRJdlkqg=kpKa-G4tyCfh9qBB^%uCZE_oFLUs*}L(2PkQz?y$<>!jhw&;yG!O47ahx|&r_JExm zB4%0LQ}f|Osel4salk?cOW9aAAF>c0_u89Y0#@15&uw6J2?@=NyE9p-_3v<8VVej{6jSE$Ky^V;9yRYMF(**^V zets`GOkl3sagtRKlOz{}VUGqx{hM&#OsB$vbH2LBtVffLo3=xcbcK=v`aOc~|DrG5|7{r_x#(okTl}0fdb{4cA1{xdT-5*d z8TPi=2?b_LQ0UsnPq()SBgz*$gp*fWrs7z{@#N`(L1Go{2xa=;D? zp-dGnfN%AN6-k=EM$=qobZKj zoh4LTj;M`pWZ?NBKe)3%Z@_7<48Ckaz#@5hN-LzjR9zk~?QLf9tQG`B{P~#D-eap6T%zg5!O+)w zkd9)xds4CwB^^9#lA4H0Q9jgntWT{gL4NxYEbv%=-SITa{8+WV+q`qJ1@U5tb9s8i zTZjV*HX3YC-DaPf__KOPSS}&MX>@U>^*pjHnJ{{s)TlRZypBHqJlHVZ zH~v~IYu22)&R#s+DLynBTRiX$924`X2B&OdLJmNAW9uh_WSQn#xVG7Uiz>~=i!2rK z9sF?rw|H+Dd~}iZTwv=LXncEhu_`}nf#Hg+YTdP)#&_2BXqd-$!7QZwpBCmFRk4mt zZ+4Yp5>M0UAmgG_d12df)Lt*xg@IgDeS82PTKM3h0tiWZZOW^1p6k*-ee;SY`&pc& zpdmk=Vj2Xi0_nk=2wX3Ly+c_OCooapz#%%$z*jY`4fjs%Q(cDXDCw#tOSum+$eE`S zdj~@Rf42F1gg`6{!@up}ZP^fBoSGaWaM}~ZtqYKWywV6)8#8P`P1((&m;gj~N%yB) z*DW>;4Aw1OjmAZ-9i2I07$bkdi9=YE)Oy@>!V+?=gRP8yy8m0u z6uu5W_=As!>0<15)H)N+Mf3RnyV%1-Vx5pZTBi5!bu{kkZW?zlbx7yO`yYq3{2_!F zT=WPlAumXx&+zt-^0UG{Maa?I(&QdLF|wrZu6tyGqI%4Xbu&X7KT(hBDc@s4u}A6d z$@4sVVlPP651d*DVkX?LRgE6k59Jg{&J6P?IRS(uf-f_7t`BpB$$}G>#8lQSN6?#S zbS%r^p3@xmvgifX7tpQ8W5kHH%?k+g!FQJqKE5yXXi5^}D%MG2O~Q&whPy4~*R+V) zkuXU}YA!Le_<2Fj5xnP30C8iq8d$y5a>4ElUvM@x$Q*D5H#7lkoFcLo9f6~eZe|zV zbN}PNSrTp((Cdb|_WUEhGW-TXb5IgQO+#P_ zsPmkGi_poGa0^~5-0?Am3}+zOX?Ck5DLk1|5?$O;XIQ`BB9m#IR`;P9Ifn{K2L**Ns5(Pw$l%z!$rv=Aa=yo{UeI(u=+g7V)PbmIRAoREdcc zM4H&Pk?b4mhp7{1p%3r>G+NIB-E$Jz^=GmQN8sSj*4xnQ9!uVbe}XCRL)we&o{`QTiZCtgUFR{T#KxzP$T4YEL{(HdFDPk*pr_tl55@U zE%R&CDs21Y*}a7K%C?q5d)Mos`R}6*WJh4g^xB`0#EYE=3Nt9k%sfBxOc20};KcOS z4Y51gv2BL;liDhvRtXMhePs5#;xCE`R<@Rr%~TvFgm4<252e>E5w1U&t9izk1a(Bx zYopy~!|YuYZ8Uf8$xh)zn+{|ua?5k(jki&E0@1cfYB3&w9>%FlA>NKWppx28Cd3bU zvsTolwwK)z+Bp@?7DKdcDw?gC`NNzV)pj{G`l7BlJ{^Y>$!qg#Fro8$FWWFblwIlg zxn1l5dH>H%QbA+4=uXjYX)3mxq9m>;NV~SqVs&3>Px_|FoK|t#6A>rrSIzz$GZ05c zqr{va|2LWQh!u>U+#8|9j}-?^__FUn5C-Ru@@{RQ344OsUg%bDI73VsSVpLzW6BBx zDX)(D zwVWar-*IcFyy;w3%??-9kp~a11%pwsKli$764zC;&2@#*I>;+?_baREURlj9SJvT9 zLv_atYG2o^e;Es`CIp7WX@jSO4?pWTG+CfNM4$YeEKrPQiBKhc{xf;0jsL&BF1Fy#OGK1feU_O)>9d#? zbc3SH>TWNwV)}pV9{2<^Wp~0^W1_Vc6NH5)?gqligX}p{31K+SPG1hHq5$fZiY~E5 z>GWz@7tHxrl8PtyFmX)+s}aIj$lKqFf@#SL6^eRbdx~gBhNVWh;OOGbIE@nEj=K%R zg$|b)8~hB>2n(WA9Q;5Hpue&H;-(CEDdJf$xX_EdtPtr5%RHyoi)tDTQk(8z$C3!f z)80md8TcT%Di9PwMdC{0qGhbZ7WtT#aX=!JmQyVAz2v z0_DPNM4f9SNi96AMk6I)=$|NvL=2}1p6q%9uD6v^nOn>MJ~%RIA5CXho7UHr{U)7X zZC1`{cU|O*|1KHUoC-OQGG_Cm`l*% zH!q7~YMnv#GV?`AXGHrNGq8?|;6@u}d=vl6q2fpf%V&a(ZC)d2u2~$bt7x~uldYG; zziqc9T#+e1HU9-tuB9qiBjv$MpGdG|bZ0?U)`tCxP$M~*Bn1J_BJC=kn9wb!5_v5d zUj63;M%Ks+bjW$3omkp#y_3UxtW5e=O*G4_fViD0mAqTnp%l5r#DsivmTcj?kP{{8 ze>sZ{CWI;?0J98Nvua?gH3MQOE15*G@tlIpBwLE?r99)G#1s$6Dmz6-JJ=Lci&S7M zM8DQk4m(*q?{+w57*A@43?JBt8g!&v?nNh~*3;YGn3gSOK{}r}Vg7jf{KePykiiG` zTXrD%QO6cH;~kHyPBG~T(_2aS1MI;ArQz{p&zeNCg&vaR_>^i$LJ!WTve~E$*SvMR zTaU%2HLC;1PVBuLNW`9UNv-W~*@mP4crE2VS`WXYD(w0(H}KuIs|{s}BOjs8juE|y zCY63UG98ZT0PQnEg|&xF-@O zz|O0{>Xgd6qkgbGG2-r$d1vhsAQMTn2I%3(SOjbw+F+eZ^1r6W66HzMB!O*YCu7vw zQ7NMVxs$hR(^%XQp|N2zRR8~GxbtS%jo|w3W+>5&gOb;*hCaTT{!KCPnmc@o0&T1kszhHG^~F}t78P;MB14N{7RU!ULi=xf2dQBl(;b-)qZ zcQ6?aPIEx{ie)wTXM7u)T7Vz15ts#W&Nur(T*0^&u-d2Y3FAhZ& zegmKf_DNk2*TxHN2~F4oSg!RrKMXiJ(L%Xj}nnj@I*< zBkh35S+tn{{%7qbLaVLpj$5smG=EoOy_`${@=T^YK6&dUqlw0uo~nM6L(xK_An6%r zy2s&H_d`dAs^<{QR~U*)OzUDbOmNMlG9ziYMc~OV1@bf|1BJJqhiWUDP^Rgngvr5H z?%U;g*)Ab!3@t*OU(9_-UJMoxIDG*eXx0wjC2v`?0Iu_873*jC?B3NgEH$N_{oeiH zU7&qRnmR+FoFMfV*^mT5@B-K+>OpaZLA3a46LV9=wc7sM=a#9!<|bVE?2T&4(M4(D zpY}yImu9Ixted2bnQs!%kEUI&CatmV>wkq?P4hR=2dgEE35ZW<2%f-JdP;F9l=k30 zlZ;bhOCJdW;rgfQWKNLg4pAr`MM1|2 z_sz#}bm{ZAN~0$7fagbgv67zRR&ORtpdntn(b1t5Y;$~aui+f*HQORXH6KpsW3%3v zK39-`UF@YhI}&q9A8@5PoZun}Z024dtUWJ?+L}!Vx8QgX_73SIcD%MtS7ibF(TU4Ey-%-KA9Ics7ql%6|d@9 zI-T~RPo{ln?rk0wkg!o1o)?sP6D9R!Ud|~WLg@}zptK?fc8=gTl_t3iF^IDx0~68b z^KrI5c~FoiE~ta=)`7kOF+llj5F}iguN=8 zM6dLr?GdxO<_Q)NV~@-?<$+mX9Y)(2gRUCr2DZ z?)r;5_>!%A{-|D6p}whyLru*loGwvX%c&#(|ym*Zz<3jn$^*sPJTEQ#p&aZ4QFL@ z8{$J*ubMfe({kr;`5|vpVF^17Q_9E_4vtXr3$Y&oo>9gw30s39MtoNC9)-hV4!Xgu zWZqz|mAoZ{-m0xZbDwzHHa-fbg*)&dC5Y@>jayDL_S(AUk1%vM8ys_= zU=QyoY-XbTP=K)Ja3kXV-Dyp|fh&?JRN*1mpCUsgN?5YKDRsQpkUBT*W6ubLf8b3U z2q|l3DG{X`5D5kAg*BeeYM}(Uu013R6UjUcVVp+-wtmK`=ZeN=p5t(4qudm0`7O3i zdik>ishCwpD_FA(CE~5ah<7)oM>qs^PJA%@+8H5BG{ZB^H=Ya9#-8^sRe8;<(_nF- zDKr*|5(mnujgd#$L(CAZXHiVeA#&4W=B|mwXOUXO#aYRal38*ICbt)T?US1Bl*2T; z-q1+s(PA+#$z%V%xYbN|d7L0veZ*^u>(GN|rdzJRO*t)e8IcWmTdJ@#Lo&`zWlUC& z79`~o_|rpACO~Pq(5{p7ZXoVz%$!Y=Z|ds)1ez#u67F1E_`SN26w70Ysx@tW0o7?)z$q;ekrb3@0R@%V-B6cer^j5B*6q7~eWj$tk1Zr_kP&ye zQ?^a*ZtfH#?A`T7>4vDvvwOQwcwB7R_rD<#1;U}C5g}FtqzE>qTYvGnPo>;R^j$a5 zDQ15E^!~s%pM(W(Int-=iLFSE51^^u{{_3Am@M{*dP4c;yQ)CU;$q8SXOB+;66F59 z+ps%XA{cP@_x-xVKv>zGRLt_F1)5EQUO*$0!2Nyp^3}`dvgZZnQ0>zPAeECxiLLC) z_y_e#`r(v;bHg|xjt&0O_)VVx7th2Tf^UUkqBQ!`fn;jNSa6yc@$H|zJbhtZ`|x*Q zrA>VC-QHFW;QKK7ILZ@F6|g@ZH(TS1+CipW%}Y zUw!lA%V%e&ufm4P!wuj5_~!ZRuTRcSf^X&Frq+J<`uWM%VRP|O@EtM}cD{Xa`t5h= z%7b4bEBU$|3xCC{(FBp)hmdIQa4tNxi`zy27RGM`%mmw6*s6Gk1f-A)mAnbsCAUpo z75?R)u|e03sL&wV&*j;AP~pMB!N9)VA$3{_!=j)SI%&MOw4V02p3}$?2-=ilpWo|= zZVQH_Pi@S3XBR;bIEmhlD2|x5G8_D{kSM7v>1^C4A7@yqt|q=imT3M08TRer_~`R5 zeq!rb{~+`9+41E^AH%31i)BmPpuFx$6^MGWUaocf>_%Az1wz;%5_$@=Xz=LZN}u zL-_9)5qbsGKhvVk%Xz~9Vn4wB3yI&cW5Kv;U`0)9;sMWL%;r>-RVeCU0?kdl#le zZ*KZzuvq&hJBpgWu6>J2io+nzB6Z;!+qsEIak{z+01)tZu+w{q6gPYc3Av{$0!&6+ ziYXpNYHiG;2)~d!pJO@TwHD}^sa~mYM3zcKq4H17U;S?qb+sl&W93~nI}VT^eI9WW z!RK-0Pcp_PYJ?y`E{-#gbYTMnzMvmtSW^puWV;PNKx#6Zihx_k{Ehwl<0fX=yV;3k zZyn>59$_~fjy>X-G7s818CU!KhP`$y2@8LSH%bcjT+qlMerq_%iE ze?$(gfctI8VPZjU_-=Y~x-IUo>a6~hpim1~xcqIAMnY~A*TY1E`4YqRSqb4z- z(Nuz&4P{!@Xp$!rp#lZ&)}_q4OCN%%Ae^i+^)bhlkO7Y|)tbM`NsJ8kcEnGsQPr)U z0Yw%>RLSWbF9GbSFo|t^0#=QwLX2p9U1HvT}4|$WRNQ6)a%PVXBIX zQvCHYO7l%!vj!%&UAZt`H2DU;zV%znr`=tF&n^yISDFc0 z^v79($PmNT@#~%=oYw?PG0FZOWZ%`-5NkR1NM^8@VdiTH56YWDENZ3FDMoi2Ukt=c zM{pW&LsSJhS10w#or;%r{l2^Ie(BfUFFoNNUpJu>HWIwob|;mgo{1*4BFPgupm-Bgt2CcShLn!nb)%tUP8+S1G!jaY|(YRl_W+BT!h+h`V<1%;>tYl;YvW z*9^rLUUa;BpY7wP=YVX^m$!Hm6NPMl^#cKQ<4)mgN>?BaVm54zV?4+>C=rYxSsZ=o zR-nk<1C=mvg~EOFH9E?{u)3TfXETZwM|?BGw6bJ&zAESKzN-UW>lbK*$|vQ#Y)go; zKBa7On9!gG!5ayEdAF5PJfOx&n{kus!%i^{%8d(5V8bTIGoonV50Pu_S_l>^io51p zK?VKneOZy1Pi=IK7=zL|E9dy1h-D``QeDp*I`4qpf3U}cYXAd#{z?tP(fi~z97wy@ z@WIxh_cRZG%ShD1Bk(v2^9({=$3~|5?32N;8Vx@AEb$&J#p4a{*>~i)$t3SbM1-h)m}R!f*AI6#l%_vYq3c!3>)o%d{c05nX!Yu{5h19qiaEt;?& ztC10<*uLH*KSjYzzV3XgVjF*q-;~V<_jq}c7?;&3cn>rJ*vg&$wsAk)k-TgNGvGaF z+^Rq3_m(5}w!^+cV=sfS_&qoxQw3Ftf{eA?d~JsYTa5+0b2I-IJa(sFzd8Ls&wn}& zM&JFnQ;r}q1_r35hp^E(jtAv_-0#^x{4NM-Ck)5JiiMI%zJwgv9&{x69LHBOdOL){{%es5}m{QET{;!BT9`Z=6<}lUs z^2^_xb0Ku#i1&X0v9T!G((@p#2#ZumcQFlgdjp0K$|EhT5nfYLG1<=Vp=qlWqB^z z3yl@F5->CS(*hYFDu~0YD!9o!LMB_^OGc_uKT{1a8&Pm64B|GXbeAb=2z-bVMHxKB z*GsF(dQ%b3drwW_C3g?Cfq^4k7YGE2U1z6c&q;)PI_*)(r4Y_|?U=uMX1^i1w`0uF zmtlc--&YwIZxRei#1kOh6(ehOd&ED|(D^YVD@9=36h)Jn^PLzxr_2QYnt`r-aMw2? zakIYKk%Xl{8|nUGy2%EnqN|t~0Vy#v9V^R3QxCGQn2*_u)D$Pp)MQQ`*hlN2QUka` z+zncL#z#2IZrlcdYMx|GePs({?6Ef;KmsbKFP00}u$XZP)#^FlYWgjZ97aY^@6!`&$SH;DU9mef4l8EXB9gjtEMf_rm#r*bQ zlpK98Lr42vxlsb+PW1tpyTg`&RW2~jpR!GeEH+~7FhG*I)6?dnr`rIto)zNMkM3!d z&_ALhyQehLNY)i-w34XEY{+3=!3~;z#H5SQ`4Pqp7C~xTJZ?+0bT@c&e9)xqZrT3W zkjYZ0C&!#hrjiWHV4t|EonC_)MI#=~OjzkU0z7T^P=d#20RR__D>0_0^JUZhQc?q; zMXzL4hXr>~H6(Ts&t5dXjh)=#wt`q@Bh(ScG4p`-zHcW>P>lz~m8%sAN3Ms5d*<8Z zUP-T=vy>-=bMY9}7p=Q$`Y+q!YGfLu{8Ap1l_eV&#aV>=*EIYy)QI}*Oc!vN*RggA zkM0d{_Z`@NO~Kp3?L@A^Z?>VU0ntpw}4F?{&{QK`mqy7*n(O*;1B<{Dq;Lxm{pqGOC2hz~AfLSd9i^z2DHptrSH z)ys?&2MFc%oTRRTloLx%0$b{L;W0DXVU*~$!<{=`!!!480&+3DL`K3KsBpVq4Jlp7nn)RnqrP| zqoiD_HIctz8*jX0$Tq{9!7X43w&rADE2LhnjpP@b6d#0s`3H3Mv-MWIrzqldwKLE9 z9%*C8k(9xeya_AGx|K9(3sl;er7O2%|55*O(mFIY4d2}8`L-j|wQBT~*lt^5M``OR zaJ8|(ChMqJOSZ%OZbIkp>6ZOAR}u#+B7%zM6_DfSzF%+4_nSU{G1%nbU&c#!{zeDqJRPpU?scpK_ta@p$MM(wbg{_ zNZrIUvk+#x#QrTP6Kaqgk3OL3zjUKE$9Y*2_4)?UZX5k^vy93D-c})VQbAg{3k13( z*tb`%qf(U{4mC}us4Z&bj3+8qlbo$9c;OeZU6q%e95l;DM2i30#Jn@LvP3X9xzt$( z3TFX$9V(Ex+vBY1L~|fW;~-v!;nO(6BMj~^te|)Xq8te;ypgH9o5{ojxV4H0qR%HJ zR~v~=*5+W{a8#7VeRY>g$H=USVbpL&A`cI!TQfcqG%c}4_Dej&LW^KvwV>;v#6$?$ zkP;XugGYDET@wv18~yQPVw)Ugj43lVF_qKo*vT-x?hDT!47=>uBM&Q6dI6iSC9;4r z0cN-^*9HS^xy$ZFb*Jk*0lr5W;Vuep1Xlv^7zXOB$@WIV)B;`4iL3>i-TPj6hwB%T zC6wT21}!_c9!L-{Iwv8aKRP~2MR;?RbNsQ!v7Mn&K63aQFaxv9I6RJ-S zRk-O&ZI|91U_PN%4w+;Yy>Q|tXvTc@u{VuuOV$=WV((#?P?bvWrfbC|F?H2k#+2mS zp8qOg^bm?4Zdm@}0Sc?(ryo-?koe}rhJZ=xPp!9RGlbWbiK3P@2Yj`#cJns4;Iu;Z z`JJ}*Uf@!8yB2=lNf+I`sYF#>Us8WCrCzkre8)jf{vjVz}pt+a*#@r}2BB^Xo^94X(udiC39Cock?6nSQ2VFt-BUq3&KKXi|R7@FjF zXD6pGQnkwS%{9L`efd288lDApvr{Y4<5xev?6e#orb8wOm#1L|&3Fs52l;fG8YcKa zY@Y!*!f=(7_pFMS5vdSlgTD`ip1Q}R8;SK8B#=)m2Wk`J@3Ak&``W2O?)`|vm` zW4Ad<1{8{f;CVNm&7vk`J$nPOoqj_CegwBdqgQ&)9z%DLP0NOaP9H?x5bB_Q-vl9n zisG--zr2yipY}dWFGT{X@WEAu9wfc8;(q z0@d6Z_6k%K5};s%n{DX}IR-rl|7$FB>yu)_PNIZdVF;gwJ?|JFW7!SjNIZ4t0(ULs zxZ~NBAQ8F_Hzn1KeYwp&`f_bX#jYQhE>D^(lB&QNNdJX%(34ZK=Q`CSd2&5Q{tuS6 zqi^UX;}(^h60M#rS@ROm&o!?H-qM);4-^`AZiyx3ylheGef3(=!pb$)xi-E(dDFQl z<=OfR58jF{N`AEYyZD-uXPd7%Y+HQI>B9)Xp<#Z;m+nQF1gb-YPMDO8O|#9QzorAc zdx~5pYV0S<#6rPlL?j$c5u~Sx{WNC`ufi|c&hNiBqOezP=>X2nayskQjG1}K$_od7 zf%K##EEm_k5UaDx!U9#cYma7ZqFAoY%{s?xin3c4`G+VvJ=G>W61Q(rDVDOf&b)s$ zh^eJydKA?-V~c*h97wX9Kd-J9d~a%coT*dM$P~@OEkIM}lsXS>3nb*?%DT)Ki=smN zpuf|NdLP)JQa$!jmYptp+r8~G-|N_lif&;7*P_!JI1~wz zyL$f9X}7mCOhOs=ZI;BG_1;L^Q9iv#+8^ear@jnbdUpd0Zdii}%TTksW#|s;@XnT@ z)EZ=q&x1y67I#}|(x(67h4!nSPmMTB4cd?eL(@^ja9&e%>uo4z8vTm(g_~y#orDkyrPK3~ z(_CdUXf9!T{W^imPJg5zFMPv|u^3W^Mv={11v8UaP~5oH1wQWZtaHm4gm_^Vz(&LG z<+S1P0%(Jbm|&>?JFQw`E{ZB)CEn>KTW-P)>;BJmStV9JJicEI(GqYV;)Ig#Z3emOuxqQA^VclK-pwJOXPBfyL{u*O=;xJvWOg3U-Qky?ci9y_ zCvJt4)lE4s0e|p<^1Jh79U{CN`c4WO_{H?qxx5N4Dz|e#l%Re!Ak1o7&^ii(x7+ec~ed>QKA-!5Qb%WRiY^3%{6Gxo6j>WGUtavs`d=G)(gqN z*=e>f{<6GqN6bFCxx&%`Mw9`#2X0s=2t zV1(s zdPM|;-ZeyPYm1Jq8rHQc6@bSL~WXTK%nmTV4$tt-ycnJf=nvrR+i%=jpFDtJWz(&&$t&Bu$!xmlwtu}_uaHDqaZ0;!sGHOB0J*E6jJ^~Z< zYa2lDV4yPds<-BifxXj&Ag`$L0A=mJ=ym*&Sr=Vk)>s6m^eYYBpy>%&;wP3tkU%dN@ z2uwfuYD{X*B)kz%rc*ke&u?3`-x+HG{zOI4k6+2`b+KJiS

-6a)F!jnqZ6I*&&R zp6x1ytWS>4$*;#5tZvLD$z$@bUuXzHoy1;a%?k z6dSRbU@mzZHhpqc1J`8VudcN8k9G&*FkUqmQ3g3;8xdQX_>n5*iZ6-7K)6LnEFP2S zZ0Onqfh`h5mn>t?OaLHjPIABHU%GLy6s8s!zAx?Au&PYpF-|5;gyw2GSCtZE#a* zekkQ?^uGybEAL5Y4PHU3az5pp63!430jz5I9K>g2FUAQc(4H>_`VTKcpf$!< zpN~W@Gv#Gipu3J$v?CtNP%07R8tR6W_$w5&#B^hU&9;_r2oHCD+f8cVSglp2D)vXPBRC$7lKUP(TOU3hW%u@T{6;aT1fDXUrbI>`)g`JVLLd< zj@6Y*icJ9D9W>(L4yywj(5;>0YdYOwv9qmPSS@QNHe+otYT{tX$qw^d5Lvy2xL#(8 zyCesOj`0*L8l_g>*ThtW-g!bdYXH7D4q4Caf<93k!F}}WJ}6fli+joJf8!3 z1z>2|WlLxRYOz~-d8e##W?Ltb?1cCN*A8;HgI_gC4zCfdaj`<41!@pQRiU)TnZTAS ziqVdx<1JOqgHd)eYt7ji+Z1$Jhc*R$9JqOd{@Zlr2f+<*wJQEte3dYgUjghv6|NEj+$=-TGzS@`i#N(KVp- zOGhUG&JB*J&s(}6d}`?p!wr+y8E$xZuO4?_Yyy?tJNBo#uo}Nt@6(8x%+=vC7leLE#RNzTuW<2^5`&TxCC;GZ|zVoNsVZojxgX5xRw+TLPic1*A*#3+@c@Nw_*1>p(h|pJ#RRc@d}OxY|GlAg$wzrX!D>-dAQTyGKdtd zDC?|KQh3TbRiFPkvQ9;21dcC&?}h3QC5{DD#i# z6&rA8@Ls3=#7ogyTH7_><`8f0TNLC6x%oOya9G9ueV~fIfp=q5v;pK-IRuH&fB6kk5SpluO9wzUty9HmzjqgxDSJB)#|Hm}-Nw^m zw#{oCbk($Pf4b*gjDXmt$d?ni_X&KjTUpVO%VjQT1J?)@D%niO8X)Xz16ddy1o~9K z(oO~XB&*21kQ+E(~!zvmE+4EAk-Pf?i zZ3THb8AdMHT=2yZiW0)EO9YgI#ZXErDYqXSeL^k?+=a;eCj5iQ(YSuo#^goz@kbKO zdI`3gzlM^3$0hykQqnhh$g$^c2gB{B18?tU2u3r`z=cSgDqOZy3NOivCFI8tgSRVL z1L2!Ud=dK=SiB**GTc|SSj!`%G0HfJ3zkIisHFAQ1|Gb$O!LnWY1T?K|0FTyf4;Z@ z%0qYl;OR%&Z=|jCh@tQw?S0H0s7mCwqs^#d!xo)O* zYq4ZC&12h!KEBrx|0F7WE9}i?pu{eF2a?J`)q=dS6Jj~EQ+B7SxK;~6FkJQrYlGtK z*y$Udrg^*zCQN9``iDPbDwbDYl?r7Z_wpuGU>r*QUw0yM1x{kPH6kA9l$AOogTMbBLokt{34U>%L!Ol%U!1*ue&+rjS!md)Cvpt={NS5czqOn&uYPNf zx>8JZFt1J^K-r<8q&y<5;6i}}Mma^7(L3Gr=8qwyM-rU7KQ?cgX`K)!`K6&JB)}RH33S2OJ?jdP=5gS;5@v}UYWxI?g0(USGD$w0smuZX2I7(51V zHH?+AndjUbWbS7G|LiY|IRc(KL9B{Am7vIBcx2Sg0n;PNc=#vw=m>Mh!Ix!y0MYUK zo&3GE)C8+AF%|ytZtlOszdzcXO3D`BHyzPo(Uk>unjxs~?$hH2wO)8Q1pnFN_~!Xs zq7-4KlOC-32-^6>9q?+4(FegtMLRiIKc!BU1!;X2u_%T=+|{eQc3N!(ck%50(4WI4 z;fVF_byZG8>)Gf54s8n|kepfZg@Y(4QNcG%RiHKF{awz&=0vZ1AMrQ~Nu`7Kc){W9 z<>`xU&Ql)uuHt5Y*lETOx1Vk5>6)89q2TsUv~kM&gf{AV!t1iD&1Srjm+roGSM%-t zXty|}-rVa2x7eB9ZK+#$A+`AWHMV|go7H)8X65-^CUz}2!<3!c#pU#7j_mR^^e<`Xd{=uSXkNc2?LAkyKkFMUt z%7Z?JXNs8uV^w5EE_M_`aQN&<@Y*0H`^VcTTal%8R|^YHt)d* zCyiwq=hrYRE>h>mF!F@M4Ek?P9q@PLCWA+0tA;XJffBZe6bAzQ6hu>{;;hmp3oD$$JIZb} zp}K&M1B$`rs@f=ut0$+kmG9uj+Db^+!jYBUgaYmRXKX`sDfF-vg^JflzkY?a6Wk;J z9hQt!+vnwZYy@(T?(5k1@Bk{em#hE9yVu3VVBSHGb}bC7oq~ajGi7kJa>tyFOpPJV zTS1nn-T^x&0^@e_m{L!$EyEY%`G^C}nxcgkH1KR3x=7DrgsPmI0!&5V=%j@U9N!yf z1RW(oa!C=rTg+tArYFxo)|{@fd+s)|LQjJ6_=~o@f&gUzdp0fb#A5caswEI;0`{w* zU-0Sq;7}Y^AcMt1+*em4@s`8jR?Iea&Sa`3lH>hZwiyXqp{yn|9SpQQv=>f~^>yQx z8?9ZYIW5hDf6}tr$yR(nGNLVfM}zvQm{HgOp3mJvo8A&8&;9VexJ}s2#|qwhc#yqn zIVtHlOBguqT8X0PKu8d@);P}|Glx`9h!X4=e1kTU@~eV==frd$ElKZd&a<@87(Bh(?uSLO{)uBoSl`05AP+G z)vTSM@WBvHv2{n%3nTz?5Ad*{*v9a}PP9JNcwxiKI85CwlJmU5Y}0|@PC$ca63vdV zd5=0EBwGb(dZ2~Z`7%f(jF+O@*m+e>{KGCx#(-q-pdq4-#S+u2u|_}eOMo;A241XM zR4lp{Rv0eqH93l6l_l^O<&1~4-DHHznuP*xW_Lt}C$2oaFMG4U*QDfiFveGygbD5> z9j6yzoPum6!D-=ITHDDs>filPI-E(T+5rOl-0Bz;`gS^-r{ErVy+mj-!*3PJL+{F_ zs;i=Q>k+_WL%_d}2LCn~V&Q`)SfBn70LLoO8>h{<6FQSZ^t$3P|K)iDIo$B@qIQZj z&IgYKx^NiGZ0_OF{$Qtc)4_M%@E#HkLGu$1mRy;yb(ss=)Cb8JN1f?R?zXchX7_v{ zu1y6Tvv>$0;OS-oU|}CVYkEWSzZMIEX{s@NQ2K@opD-dxHvfbf4gvr-1}BfRZgjH8h|q~$U!~vC*sr|c>HMa^y$EqGlKjWQZa9*rkr9{Daj@HKQ?s9E%`*8 zv_Ab;#W?0auPXPj6uKfAJxhJ_A4g5xDyaxYYp|oPYnL&$Zr3 z+l4>>zBr?N;p@q^);jEVrF8PbqkBOFYw`g{36x!Xe*ET}=da(K{vYd>u#dNOjqcjW z`yS!7X&ho6F3nL`X_y?cFbFeg(qqn$IiX)gT$Q>PB0~9lC!S&!M^~rDQ3Q;pu*b0R z&^$ECfo>7Aifxxz!{6(cuhe%`?VRpYa06^lppStZc{vXk2tT|RpOM$BrPy_vwSlR* zgNGV%{-yFP1qP~U^1cxJ#uu9b|GThkZr&GL*~@*|>kl3xy)879w3o~esgGstMf{yf z2G=b|q&gsDSSmlqcF9N95Mv{u=-un*-@H71VPP8dB-nswYm0dK%6(!> zzz0D{YBRW4h;>g;&l<~Fz)a8u;|a00PfbmWnC!c zaYiPyXOij=*UNGC5B;nss{(iqaix0)JB^Gu;j#Piq;KmaU4u#VF`FD5+BM12Y2p2u zfm6#J89>2|9@03fb<-e|xK>nC^-2RDQB{x&8nZbPw-kERx?M=OHrMEmZQ*%KfS`Am z56p3Ew3`LT2BWSK#L~Gn{U_^VcugYPDD|_V`6BWpBWsd@^U^;?*KnJOxaYC-W&MK_&^Uas7!h ziUpFstZ&2fVqRY}ahaPi$;a-b-~ybjH(qYSM8 zt`MK32^<(^z&RV%FUmBKrMYWl=w|xt=I(K!Z{#F0OvT$sVp$%47RO}%QzJ*$PRX0r zEySy!9D209tV8dkxC4mY!6&n>l!G(?GnI4blgR09zz)j-oUZOh$d$PeLDP^AXzrFb z0)JR`*N;v=dnHTRt2E}bB#LXca$D2mg;>t;GZ&=725}X-_}$6NuN9gM{FXjoH2Df+ zF3?l1*CJ!Ww5kUU&I?ni`xb!Xh7SwwvFT_Zx^4FrqMjfb3=+N&l^)#XZr)eg-R^=x z_^ZusO9{uZL^(1_&3@tw6tKLHtXD|_B}+xbOlqgOHH*4JDz;}(f~#G;#!TPb#lHZ| z&V9luDjPt_$xb+)>(Z?#pN7-Dgy- zT3a-2muOF)-o*{oEB<^EmVH;6z0eIy!5o;mEZW_>kO+=5%A16vIQD6Xps@om>NYqv zp*tx+jd@nrn6z~L_$OS(FOojvpQST(+<;m`FI9j-6pAQ!#xnw&5K|MZ;=UMV+W5># z#O$DMGl1PDZ=A5mDAcQ*1AsbV-fo^%C<_efh#zzcL>A{y=m!%X9z61JLiY!s=N`VG zq2Sx{7n249q7S|Ki76u1=|al&QybeIXSE38n%=pI3RZ%g6Rnq}lPhN6b!0kp-T^ZVX+>P@G3v^>>(-B%4svns&*~c>o{M+)PrPE zU@n%HtwNN04nr3}h>1#DH@91-UAk5+XepMD zvlN;gTCs-=R-TJjk_kiW;+VDVb0NdmmKrN~crTi0a*|R1+nq%NKeJT28`w0~c73x$ z;y%=GEHmj4qkp+yFTHn3q9PrXg-`DPE+vgUu`1^u=1CkxEU2j{HwBNxOra-|08mmc$$1FM@Uos$ zLNv$-%6=sx+EK69OUId{di)H=6O>dk=qaiIH?4s6~R8|r? zB;Eyc4W9gP3b}yw@NR6JtkmQB25SjyBE|AUX_9=;o#MR0+zrLS#X-!}XxZyy=K3y0 zXNsJ!hnH`3oT2T;H!(*O0W_;#wE!jdP35MYe)h_J2G#PXlX~Um@;n|a9BU_O7xNj> zzmmrW=uX7b%j#5xrtGF(DrCezNm;&5AcMJ1eLT5#O6%FI zoWLykxyAmXp`6AEO^Zzda%rn;fE+k(>Hb(@rs`Utns71}r1~`87Vp;wLoD*?pTU}g z>8Ul@w1%)`oNidfA{B~Vjo%JDw4`=k(4iaHAn(fxtqt%QS_OyC_{h2)2gMOF7?Z6S z*n=)6NbgHFCs-%56EpDMi_K$K}!4cyeTKTgbZ)&7oM5>3+ClM zHVNLHD(z+y7)p}g9{F#NI^VKGHvQ!z|K+33mwcaHg23jYFyANq!}cBK{wmr({Mva=)3b<%Ei&e zer<uVg*Z;d6 znO%}_9M|c-Jg_5L)bBw_T{%^4KFC=nLf!}T ztpI~jva$R^)ZW(xvmNf%&Y^J7|Ky!{ncbim)ksQ!85X8 zgmnPxCjpxDGd@Q+|1|p_$Z#Mqf@LB3oSG+@*;6=V_croBe>PlaZh5d+rpa8MZ zw{mpwxi>T59}=NSD~$|5Ey)WL=~v!L-ihSM;EA8pPTXZ^?01{T=DOZAGFN2<|J3o& z;ke5G9Q=?Pl_NVUM|T?)(X-#grJJ&qCH1OCiLwQRkGto=R2Lnm;G00SePETAJk9Ix z_%Jo2q)&V+%(;mRop_qWg*j#VU!bw3v{Hn+fMW}xYY`zS0<2@pqfeq{n;}wbC%Hh_J^c;EjE*BpMJy*U$?)QBl8H z6q9lWMzc%G*bNjY-A3@W8~D$LM(7)j6CXiKH2GeZ7zhs-%y}J653DEeNYScVwrio! z=NDpE1GIBck1zgsK2i+Q}LYOw)fXK8~ZF!{2yE-wXoch!{*Eq1efJ^_pp5CG_9|9$fJ0GQPYLOe04=kv@FK*d9#NciyE#o`zaNNE< zlvp}<9`WNN_xQ*>J~%jVn&3ioZ`PZMtH$7tdWSn8*#@HUA+dzJYe*prXpjL}&i&hM zji36>1j1&{*KxF_@o4}gV-_BNg_H6fQt|YC>`nQ;`5`nF;nWL^Cjj7vzYVCaMOjQh z-+T`457D9%wOQ!Cr&7T)x~@PS0tR*VKx&#WCT}>vP=5Rrd?xPdzFM@m+HvD89iZ~Y zrxF3~`KBN*tPyi8#Mh?_Zf>3OF+u&E69;$4B@8XUT7Wf)MnnvVOskj-QsS&&0-=Rp;s(;fWy z=VgmlTW`DYVTi2lXu3fS&=;eKn9ukViGtZMa!%wuLF)m|l(q|8_i*zRaDqz%yQOel z>OOy6I3)+-!#ta5qSJT>xeM3CSaw&p$L2{ zG~1%T1t&uSo`tKWo3^MEyYNdNxgZJIes2uZS!9^*o{~7t8_s#21~w-=9m1}Yt7Olk zaJI^@!gjUD^g|n$tO{*$gM4kYsk5O>2%*`+(~lVNVXdEQbQsjjO+D8}5+9^JCmOe> z_dT)|RX&G_2Ibf`^Eh!G z$TgEA*Q3*lmmuCrOpzXwAYH2nN{%8CkswaInrLV|6bn!rz@tUA3;xhGubgl^^kfNP zh*LDo;-?s_xO5^BmWHkcH&?9?cC8g-f|OU9luAt@+e`P} zgC3+r7wj38AP{^6p-7coO(nKlS+AeOY=-R=@hQ~?Y(E9fa;nVjD<%|a!|lgoA#M;v zu!*F|2>1TB*t>|MzM`IZ`bw0vD-QSZyNe))wwww*E#+k8_5rzxVP}Fy?Hl5iGQ_Ij zu^@-BtN}m4v$=msy8h}~-h}xAOgKP^%mU9mRL{EI-q@J=~dZEM40$j&WWLLPmSpiPZq*(#a z$wXsil)#mdpiA308Uohx6w0EkBq;U4D2i3}=i}09wtfayqTs zqyFJ|svANdk)8g=TE-kkgb*cfc+?WQPXD z-FCY4t*BPZLbGqFM24TfB?YI`5sGiNy}%c3N5sGH3kz(&=PF2w5*?O6W&;)MHuv7C zfu{HFFE^E`bHIx`oH-)oyb6Jha+F6+#w0;%fmu7dhFu~#y_)l7a}S$few%oH$23yi zKEK&X`0ac$vRs9CN3^A<@bDw5#1#ZkUdy z0F;RyUHBK`$6y||zm_6NKNx~!mJGZ(Rf?j!Uaua$*ScjLXOM610)sB(E&RPO;sf|Z zhWi@yiu$w^JqrAisr_oQK?e54y?@!$1?1<61}tTUAULDHp`CEN%&p+q3Q^Q_;}muM z#vxlC?;d^9YrN_b<%y6^a;?~IlprMb{C4tNK+OGG$F46D52s~$fz0bW`tk#r$AFpupxBto8HT)?tPm`Fk)#(;S5E^lC00 z3sNOVo{9L8gGmb3;}L^s!9GJWV2F$-3j}_k(-&BcI9X_}i`?lRvS;FqV7mWXPaG6C zCy_vB3s<9+CVlcEWJ<%PG|Vkd`i|aG4P1S*d7T3?Er6KQje3J-A1tsU9J(tJRz&0- zdE}v#j}%C0oD*oB0neBdeWpaqH3dDlM6Pm7c+qe^O0WPO^v!ExQq52%uB0HVM`+H= z{AEohE;Ln=_5(E>NR&xo#TWVFylAfh?|X#Je)PqdVoDmf+fg?=M^=#h+#L)IpL#gv zL2cobe?Uz>;U+(T+eTRLR*MBLqya!am#F5AG7Ua%e0f~RS6WEtrNgn{pWG4GUNU7Q zfA@d7-@#x#`rMmI?b&aSKf)-vtGJwogC_?b^gp8N>RGmH&xEuZm6Qd=t16nI7mZ-v zkbnkQ1}8$CRtCx)T9gNutE;@)haDa8q6LIu!EqS{&V;AZPJA`R_hA-cE>1dzS-2tmsPOt3{23Zd(pgVon`{qA&nU*v(C!fw;rEgl|eRWr4T0L9c;7O&=q_57SjWDLi+|o(y2K}@?0*BM%hZf zx-}Ann`i(l?IW^GtHt;#Z4O^g|1Q^4#;&+Zl5!QCeMZg#4I;!GG-|H(-C}`8I?bW8 z1c&YTg#ur5Cu=sb!DIlBxTwm%8qmIJiB9sr*Rz>l<4EpTFGxSTDjSi}xRNH=1^;d~ z4Rm0*EJmIhP(DWjV<$2pg+G8{>g%f0nhk5~Ch#QOh%3RVQq9HX&u}PoLL!?!*g)5n z5da4aEi7EyoX{L{h(|_e&*&%t$A)|f!i|qo;l@XMUp~`N`tJ?PMkngnL<_@CS(b9y za#%J;94k|YiP3LlVNNIx00AJzK^BIkMtlG%9)N>RaLpGU$M=Q$o;VEEop;lsnJmkN zz}tPx)`lSKYX?YV+-VU#9tbXmQvZ^u2>2cZXRjKf_UwkpWJ8wA1J#|Q6G(!g zlmlTi+=uK$DTz^@iC=;J!(@cs?3OX=pOv8{m~g}9HWP(t&BO%abGPApCs1fsam(q4 zV>+$D^%^+}#ZIX1Jg<;>9N+6e(G3dDeC{g(gn;101}Ksn_JZxbMd!=r7Nk^bJxcyK z7`~m<{XzB8W^e>5KXvcQMx`5z4&iFBFXLAu3OnC86-Zw9`><&4oPBIqGHm4*p5 z9{($!Is~ckB}DY6TaPISrB{jJq~~xXz~$itp}SljZz$v%MSsvsR~oTwBCmT#UP$o~ z0a0F2I!$g@ZdY2#Ndq(v77rd+(I28!q!Lq5H-XO#cEZbvG;jlxKI-X@-k%3n08|22JF_dYy5mr8KTsOFx8TfCd zq0}1hhQR6t;5SU{B7C74pD_$PW2wm+l79a zJwdB0u~~T84Y$!CJEsE=ws;lYRT`X3-S_#J!84++wr@XyBf8CJ(8QYS-?pFMuH!Wq zO9WOEe!_FKCqt-WLm3xiquCY9Tq?i=f+V_ugVZK2bR_P}JrxMFzCo%!eT~G95S(dO zI>H#~tcESm1bkqv&{?`ITCKhUlf-;aZ-+$H5XtfZ()G3yXWQ*LR7Hy$?gBFIYaz^i z$u&;Rwc4%k5}D1IsX&fM6JQi{P6Q&x@Y@UwTP(HfWxnVxGnBvE&+VJ3rvV53EH9w@j(ouk-!zsS8_L-YZhjV zW=k&GzPSoC(MKsw^wHjz-xKp{g77Nlu2jk^q&vwB9pVgq2jppCCReswU=T-f1N@T> zo`;@YwOkexV$UHnekbtfNfs*YTcjX-{-IdjB9r!@06wX*;mV5;!yBr<5z$_kU~jF$ znr_x$$mt8$2WEN)28~;^!B`S=+h|@BI7AclMFx!^@nh5zeriEc1kQIwO$(A*iU^t% zWui2mM=A^joRZFc<6sCUB{(2Bj1rPRVm^yh6XT4PNcvC^RDMFf6@k)w-y$AsaA;&c zMiZgEd?dQ1Hua&}5|e{c361$E@JzJcLpv+cMF^%pY~PX~ze?W6Q>IRCexKg;vR*JG zn7LYQX5H-1%8M15 zzYt$|FJs59AH0o{t^doaz;zK8wpbQ0-Q9(Is?v#KA=xqy+h7<2!@M&<05rIWjMFUL zs$l+z7lyv{IIC=tJCTGo9`h$AhHGJHEA6vjkWPi03bQd_hAc9W2903-{%-A3Tpoe_xEco+#6A&ULy1Sgqo-tk4qzVv*2dl!J-lstsJ|gTE?M_uW z552?DgisKWm@at4qU3vN8ry*qw-bJpuFe_yLxI0gAnHXw|TN4yd{hbBJl^-8m!nY=XT z=%xfu5l3O~qh1-@wRF65=?w?k_@sR>Y3`0>ISq2Cg!KE~Ksq;uAyNZ?e3DZ_fNz8m z319nYYj)B8NfAWQl;68y#t2zA+Wf+2!3!Y#kqv@8u+4#C(L=ZxEi>C7$VHV;C)~wE(wrojhWO^#BQ5uk{ z_22qxb?bZyyjo(zv6YT}PvF0JIL8^Lb#hfr{0<{EmJ{*noTXawzk6F!&Vq(OkCCPk zoyj;?7@be3*_=TDP+Dq`8feYSMnENuS}W+-7HOBaI~Yl|~lh@JdSN z9W`3?;IrJ`6|LmVBC=K?#GtjsFJk3CL(mef8Lc}`2cUaCtO}}MQ_mKHrDVLrm1cOx z6vYzE4P@SW_QT29cke!b_t>W6(uYCOk`izGaywe{?VZSxl*d*tKlk*@11#Dbw zTPpA2aw84zj_ZqI$OzuRt1}bxO^#bK)cBP^NNgOU#-(irAm(f%D2TTZeIMgpjXnVK zSj=yGO$~IN2gr2`jv`!~Nj}FSF9y4CfDuVk#>-~Qm`2>BMfS61WQV0PFV9nJ#XTMj z-9O-?F&>WV%urw7x?eeunme264hmCh=t(Ar58DHIty4`A;$LGKq<%Bkj5qqk;FOpG z0Vji6;fWcjwsCfqYjjj|dvy*(Giux8TT0Tt=O3Ixm@^8VGptAbEP|{emY%N->=bcm za@-w{tI^7Xu=oHw+4vLO+x*|u!eYQUS5;s2SZl@wNWTnxyS>g0~1;?!5EWgP@4DKywq!Gw8Tb;(lN2b7Ozg9@na z8YC5>=6QXd>Q)p>Y8i0d%%2W*#*06!JQE93e(Ub11v1uE_C1#Km)H#45lcL?!fCc> zI&>jYE-9*2G6-^Rzk}?g!6sd-h4gI(CbVa`Nyif5pkYHbk1+(CB*4`Hqp3AfmZf+tgJ2z$}9%^ z*$KK!u&f|rKPL_z5OFyB4=yi@&V;`e!OzD`W^#Pcfkn%Fh|x`G0Sbz7dt`Mbr<-C7 z$an~zE!S_|#LT+^6fAB0`=p-#+&z8*CR!xb( z2?-d0fx8tN7Z?@B5boVXU`9^>bTieEM(OytBw(ImLE%_b>OI*`8wV?;!rJz3DP^&7 zzq8ip@dlBcz}HK$TyahwB2Jo!n>607TP?xS|JS71oy_hZN&R7Vax~p(Hd2mZ0Jj=v zyzctdzyL4p)YFlHCwvW@@*2BjY9#^T#{4WWov$qa!9E4cIh{l0qVQ=}C^q2hI z9jzx9Zhdmnn}6=$1dc)hUs}6nU`7v^+x8AV`?rIpK8Aly=kw#wR?YG=NR%}H?B70v z4dZ^?Gqi2tp+$*uyj^Qn3s98!-QXes!vd!nMLke(0SBMCw_WK9;zyd(kzc-2ejz=TThE$j(CfX!`E5q2yvxIwBE zJ|;40B#a{NCnlPwTiIIXqNVyOoRk3%Z zAZS30!8|1lWmILj)9bS{geAUiBuNL!Za;m#T$NRoZj-D|Q4@)M6UUCi zsa(k@>JgS7=CjFA7thzuc#v=~7||pqy6u}j1*rd_*Q^W*fMb_D1-s=fbtJNF4y)?x zsf~tHi2Km6&PRP^cn)DPqrCq{w2Iq8fIU08T)mAhkOr~f;tkvKUyIVt30`lAyO{`QGHrB%Z50y< z6lIKwE;N|JF7#Ak+Q6+`1ySbEtTPl-5Y``I3W6dQ%~JT^xi&0_8kWI8GgsEoNgf+l z9>*s#2q&Kp=5LG&dWiSJeC^}|AvS!lVj9=+i9`KrN z0frnF+IVW(#ntqfrXntRC|v6EkoJZhc>XS|PZppT3(#Z^ROY$Y|+EfpG4TH0V7~c;#q-lcU~DobixQ zQnsk7<)tZwR-wpK5s){ypkb6$5L~LQhQo-tnCuW>1pOfe=672VVB|+@3QTM$ye9+& zmf=cFgEEO#ai9U&s;p}r?<4htpwRYmY}gDdPY$d#Z*)f0&sd7PH0!9qK^ zn(4ALUB+UPcYL|L`eIgud%?>UF-Hy1bII$mk}Lww7Bll)7C%7`f5(>0AqfOpk0}-? zjla&b^aYiIdWat;R*>2Yry3$(x$)J}F{kfzLKk@hupCCDDV7dZo6CT_7%4`Yk6()p zW;zQ2WI@&8;zYWUhebufW>x^TKVI~YNe3WhP05WBggxJU%mk%xrbt6rU5bIpCg4Bg ztuAyGgW={3&=`t%KB27ipyVABqa5v%_Nd}h7m+57rb82j$4leTaz!Lh<@u6O_epC3 zcJinva=h~6&E@rKurWi=X@K#rAar=MQI_L~G}z=4#ABLn^2I{FQ>slRS9EZFu+LA< zU@*)wbhyJo!;mV{L_sQPv#>0tp1`Mn6yX}v?(!tLJZzupnW!q$SPWbdx)`tR*znk( z31_(_kj#?%yVljrwxjimG_YEPGAVQZUz+1MnZ%qaVvhjfOnwL@jOJiX;j-jBA~YWL zZ%LsdZZ&fcQoN}Sjf0k6Jv_4kVH8|2!?yF~Q2PLB(#yCdhb~8vIoH4sm!jPf)i>P8j~-}A+y;k9!($}2PO*wJPPtvAbjktNDPMT z7)=U=5!+)EyJ2PA?hV2rQTsLMJLoY*F&0slrWq3#2asQ7Ua!e=C($CPA_qN3wWF4r z0jVvUQlZh*Bg8l;Y$82*l1t>CpGfMG25p68 zEu>n6G?u7b!KOmt$1X-P&%!*0=V#^}2|8ueFUpbSqhwRRe8tU-U1UTMCv~AK(pNeN^*nYUmm})rS9%Z%mR@nLWu`V^Exw4lvU~so&HjT zhS94{1nN|?n#D%eSHoDcfpLmINR7BmAl4CF7!rDsW%dvQe?8^#(7N8Lwm)2nV67Pbc|O$ z(TYLgg-m7G%o;pi13}*bpFfR9MP&>pradZBY*~|#+K}ISI8@*ng&&N zNE1=gm^WZV+2(Rki4i81^kZmflo^4*fGc~cC4iEgQRiVPhVlC~A)ST>QaX2<*g4JF zStsz5X}6Pc3C0AF)&m!w&Z&y*4hXhTIOvJGRZcrk7YOS0j$sv#VKvi2qIy*_NZriD zh7@MJ-0V{vErQ7WE)W7W_&jjGQ0636-Pe`}lpV=J)BZ5a4hNXtWA>Pd4<2N3WQDi_ zXj*S$2-Dkhtf+)m&d^UG=eFIZCOxJmeWu^dTIi_h{ZflAa>cTY(%f`l;cG(+a9 zW^(YNp1t@t7PKX%`-NikqBTCr&J^XWu?X?04rYxOv(n9>Do$6i>6P48zQb3o$J!Th z#d#_g7Dk7Mb#^i}+rONLi5p3Yj`N($e0+5Jbbgl|9?^HEjzVKS%0)W8WEXiLumrI1 z&CXHCjLwm22_pV*SgYi~VmK0HWmGd_@zJD&b5ZLunEz#BD6P1!lU_T znv(}%hQR}NGt&4)LU*TPyacF?nvOAADMj2rcpLG{DV1A8h~caD$CA&LvFIJjM6kIk zttcr`Zpg%>Rt?g0CQ^%jwBmP~k;lQ&!&HJnX}g8@L7Kxl^pl!Tk)>qi^e0Py^Us+h zhe*s7pFOgyUN9I)V(a8ERM$`oHiUG3$Vk{lf)+(oScI7)|6j!0Foh+fsf7Ap#S{Ku zFcc>jBn~+k_OKPPoXj)_lAdVG2{HG;AdK9K`i*Kh`#6(py`)K~kKh8HJ|$UZuWW!> z)V3h(z~oM@F3FI}lHIyAb6rY9Dt*^8T9)&j#D+@Hjo(iZE6_lg$&&Vdg14!UmO+VY zF&vbT7g`rggMjB=A5nyiX!2BLbWlMb92`WX?xT-wLYlMQdUz?F8oH$R!T)N*jEtTz zmQ-7B9;Q@tYW`Yj7+;T^DDFo*jt#7{lhLzuGoiqQpK4B?I7qiA;FS)p4(?je#k!b* zCbbeFE!Shl7Z4Fd7&B@U#l%XU;ggD9Pcp#s9c{2J&G;7qkmmpbMi^=M0v6rk z5@hhv<5iQPcyK^+sW9n?_%7Heii~@uInbX=ivKiU5DAwasg)uXA@<2xtXj1J6Qm_m{pe56eeCZwjagiDEtg)^eMV-U>MfK1dxgaFjHaEL38m2LCT3+ z)hzG>Iu?}F1#1_n4wr)oTwzZeEb1lTir6_95hxY@hH8W~GYT~xjl-u4(wZY7d=VDO z61OG;q$|h48(cz_?c(4jksaMd=D0F+_F?Lq07bB`G8iQ=)T+f2F29y@i&AH*-D@oN z(q+3my0#V!SaS=Iv=bHW1cGX%N<3DSkBHQ7oWPm@W__BZTd>H3p+=B_pr0nY@D2Tv zZX`FTa_6L|BuFy9eBq%}ma|hLnG$$I{8TK#nQfa!eGG)&lG?)RCY?nBYFnj)R8|89;d-c&jKIFdUod$Xg_Q zT#Yy44b;aDk=D=^{&o!q$(D-*MNRCz`95^((j6LQmYn3RBWpV&J+%`&OI@Fl%4sP0 z#~?s;M1Dz8ej_whOh;)my|lidl@+D;C~@P*31_mIKFQrPx+PDI)9sD`k=~If!677A zM$IIB)*>;TAoZt{N_lBP_$8*bl*F*|3(QDdakxkb#(8!nAOKv%R4zqtTyI?{(qu|` zDS{${T!3lVGcz0mH1?huF+>BHe#+n>!;)QNGBY!)-0)wkdb-;qFfkFFdDxg7?w<}^ z)gntBGru+*n1T)i|I&PQ26I95(0H8<^v4XeQD#x4rLqR5!tbq)ILUscP{OIBZ6ywX!Zh44ml6v5XynbT?7`wJqtcx8$z^6cEa79U z(vmrm(vZcq(wQ%vrya+QZ8$pXr?)eZitO7Y@$KK7VM1z}#z?*(jtel?0sHn(j8f&g zQ!< z%>%X7l`_SY(qKf|h=X4~a2{TlK^20HwJuP1L;ZE$IxzGn(}cD-buKW6@QR$6$bpLF z5E?&c(_#mNQ(?n=j@Z{`seoqI*m~7ir3n*qH)C{(`;Qs8+B)8xIgJ&4QH3ivzY+HY z|CJ(nks*lCUp~Ld3N_!PjZ@TJ!caBlnh;l@V#`Y7o=1cX2R|7!xdyc@7lxPVSv=s6 zPcd|GY11zBp?dy72iFZd&9h1-H7jj=s_DANkTYIza*P!lsz#yuaJ2O8Y75SEVIqx| zC{R5+7N)sRm1*p`o28u|NGo8@@uxWzOPa7NVE6^n5ytw=y2h+oh3WM}&>9SBlOzyiiEXdO3%2{T*+R^8N^GcSfF#|XzkT=ouRG+=S> z(T|LPLGyF6sJ4!#Na6&1!su&5x-qWSYBv+(6ERRndQ(a|I&9Q3|>%DCNTWhp5K)gV# zfa9{>CX)mVjKFL|+2pbdvWaj+jZPO2*y44WGFvq;3pOToPgO$j&;`lhTcBG(k#KG( z@{`*-k1TYz0_x(5IfTW}Zupt<^jt<92}*MWbb3YYqTI^nd>QUw9k5{3yj^uY^99tv z-Y%!9RV^?#Va1_ijo6huC$Qw0-Y!h_DUG6wK(c~9T2Z#3`K!`FEXyvVaUD}qJ7tU> zdqJ19v@k8H%w6 zbvFyjqe&&|fT!77JiZz-2iA}^%|fCkAGH<={$sBE)GNZWQh)RFVMe~zm4uq_8K9jg zCA1RFj?rvQIF5vMM4PQ6M&4*$Nkg-hxcnhn%22CnjswRHG-HC{Be8@-5aK^RcgjAJ zWQeOOSWn}VAeAZO`8dGtlUxieQ-NumRuq}3l(I~uWF1+kdM}UNzzwX};&f`L6mi2- zgve%eWv7O*R(DJ@$5dummEnFkA2m8Ny@zPVwCF*1L>y9;s|A=&{!Zz3;IM6$*2GNM zif)+~O!l3#vfSG%1etS1*Z^Z<6i9)pFtAV&X6xvUII5b2b2xGw5iTEy@qK6PsW*~g zYJ!I?vRNflW0?KamFiP?{kWyTYfT!LfH0sch;|%ghoany8>Au4>*9GVseuTd0O~8i zH#MVKL`czc=^ZY}WEyvxZ7x^(B(Z#QbGgzxb>g2LJlG2(664^IaV5+Ke{ z;L;ottBa$8@rpHyAJ3)i2jsTk_G~WYgo|cbkQ6E-ch|*Gbx(gZw|$$~HMh zqt@&Q1>&^!v+q=9aeiPNZ~??z{mPz@+#DiB+Lbg)El?9;6B=^XgoDwL;n2flo0&UZ zSf-$Tu{q?H;hw8hGUp>KI-)eLoE2o2!Ywe)&siMt)|puat~7*WlNMJS4EcI z8=;)J4+DLpEiDVx1W`hWXS(#=Cb9Q$9a4GYpA zyXujajMS(FAGLpXsD0zD8Xp)gnDnki&7So!U|~ySr)gjg71~!V`mT3bA<_eyRU_3d ziO*)E#(Wy$1~Yex^QtH*wD=0L8r{Z`X{SI^S>+`Ylxo?xDkSZi^xnlV4@lLJhbHzK zrY@%*pFzk_w{n>qR$b?Ie>6HjiaCJ>Wfqa5l{6$}^9hJE#8w6&-S5q5FbD&iXih)U8U9x1(R~8P@)RT0zgi{>^ zqtKSTiUO?i)!&OYy3~%a=1g6u8P;IZgxitu8Xi9j z?S#teCTD|KSb*$WY=5%_B`ilsz6(?nSD zpi->M%#YNS;Df;A$IJ_lbT(Zu7i2*oVLi%Ym6MlGw*}u}R4&ZwS0l%>C=()}Tbi!C zHmoPe!4e8a+_lmy3$1!-litB=ujMPpIDV>Z9Qd7C1BE^^?=2N3!X`#E|Mve-!uyXVn4ju+vV{7S1 z()h8Z3?L1vj^olIOvwW(+Dz63&&kvvp53}Mbc9k*cA7*}Fc5P!q|2frb02b4-!idB zX@*wC#*WQ`#QJ=Z9V-9ArcPko6mFTGY7uIJZBCaESV+x&|NuXL%_x=#BKW2!&a^;tpA}3Nnmc_Rry~ivX}!z z9q+M)^Aol463959p4ANIZw7?3(8xhPXK;ZR7L7`v5gIQ6;!jXNW(*7CMDqX_i_VK0 zU1{2&U{G;mV$I0ZQVfcoh-uogGg~6k5p-E}gYJN4Ce?3r5d_EStE=;Rd@fA*MVsfT z9awX^ucU*IiYc?HORn$^lDaLA$v+T{xiwpGSCt#>^iv5&0K;!oe-Oe~wf@c`kJ;Ln z9P*f>ed$IXyP2FGnRgf6GZ37g_Y_>Tgqwgo;GE>)M}y7;yMn5;dx=jEM$uP`xg|9K zbqlJ7-Hc|UN(FUE7O2YWc15YVEp;`7oxoid!7fN3g*e;8q|nZ`R%mA@7Yw9k6J_i= zf?H%5*nPktD+1K)La4g+j1$5THzxatZ99%Qy5s~lplSuqxH{!#tXfng;FEE0L=*wa zf$AD&zpDwtmC0)@>PA$~;t8RtjtA3A6AnejMApqxV(2_2oCUK7%`k_#VBe{7nDfp; z|Emct&-X`orX?z=#JHV)UnJtEe2gnVNmL!G#tN#+R}&wkPi*-BwYrK6(tfmLd&kCt z*SQ*fb6>M^=ng+-1&OfNk-(0tV1+!aGNrGOrq^|L%PO%!IuF7H> z!bBY17|@I2f>yBp#D^`ngoRF4+MZ8e+zoD;TXMniI;pFyw##v68CH8eUc<%l8;)6v zf4l8!%ZbD2FLvk6V_5}_xn#GFK-{%2MT$B8%DZDkeY}opU!&KPZlI%tYRqOeWfm1r zGF1n1%ye?w*ZF9M6CPG32GD43A2F6d(V9ztGzS#*F!ye;?kx0=&E>Y-`c^Zp8$$@% z6-5^wkM+ndg@FY_7L(1%B9uVU;HQAt4c*L>-h@0dl8m7*)c1;?5~ig0=sjn2mXp(2 zwDA1ud1I%;ac5DS}$G>1}*MN?$Nu*;C8nNfHo7!-vF$WkZ1Hrr4A~>k0ZLqo;MDE-J$fXENSavI40Oy^b8W1ut zl!Oj=!XVeYKKaz_ox{s0pdoZpCe>$WIELz&!Y$CQa?B^mk1U8Lw&C^U^Nt8y!V9Y5 zM70frAz@(r)SjR1e3@H`PZ`+j`}`tw9(CuA$$w-Y&tj4>di}($#y*~9oIfP}=x)XL zcTX;;C?A;K(^*EN@+s*);wSs4av46ih~o!W8Lfk-H$bIp3ldT2d5fcw>YjXP@EmLQ z%{wG>#nZN^RfO8DfDd3PE#MHII;hi86dtnQfQLjVVY<~ZFt%z)Zc;bPgeE4YBf$Wu_S6C?*NI009UD&U2Pt`a|9C0ymHz=OP%l zT^d})bnFC{8z)*iO#x2Qa&(9fEy>Vf@}jcL(}A*e2wuuFMF%j9L2UXAx^wmOtGi>V zOe-}?F!^V*V1|aWYZ5q*iD5HUL(FvO;UCOHFISWlDKfwr4dKf1UaDZY#$=|CAqzgH zu_&874D3I4^q9t;@U7p#u|fxD&c7ZfVusnQ$lK^bq6_BNVk*-pMiuVQD*jV~Uo-S! z$Jdfh5$Up_Pa1q-`F+S?N$6n7^I8ODzc2zfh@&CfgQ{&ohBM9ShT|_AOEDm#BDJ{* zdYI{o9x>87?j;?pZd+#Q+Q~z};fwIZr-E`+RtSwI1fT#MnyPqMb1ILGjpHexi1pMn zNOE8{MQ?Sh9#Q0&$j7>3a+W(X5qC|7z z@BhVG$Uu*_cemC23p19M&AmbHf&Y5))3Z#8P2$b2j4d3Kh)_F~nyax|lbz+E9HX{E zjENKhMtrtb#tKPD13ON>v(B32I%rlYDD&7511Z8l5Kmm3gOkd5VIXe=MQaiuAwR8b znks6W5~oIcOWh!YHR<6-0_nUPiqlF5!`a2jWB#bT1ivC;Rsusd1X8sjAW=-$$;ON} zN64FEqkB{%T`~y9hUlggjsWOQ!FH2r#DU!L20U@19B7fJ;@R6c;!IW~s8iLKwwPN#glMBj`(~gtcv!#hW zDci2*_5AO6e*7fD?7O74N0k>3_ttq4LsKJQSW{}$5>R+{$*xO=l?P&V(2%C}UQ7-m zGLDHDOw5dk+D@5B$s9sG_TZ!>zVILs8kS@!B`Te1N2UkG1V3|HW!rT zpT=RK3rmg*;rsN(rr+pdr#VNHdnIiwou+upT#OI~UsoOkPL1lW=9pzfx{Prm=uKrR z$YoMXn04wYMhC}sjYHWA5FaMZ$sfs1h#&Bd6~pPaw-wYLYOB>HOLkHuPE>*+sq>f; zNo!1%1EmwC>oXNIXO8*tz_7{`M4oUx>j>whuO@sUB!5<#vpUTQCZXiay0YV**daj> z6Nm#UZe4~<5ymC1e&$@F{U}2JIS8Tyk%(|X)|}fkvpt89@q<8<3di#tyu#6uv1xG+ zcps-LYjkz|0%_!Dul0J%l@^_r3oQo8VZe!n;(qFa4SGBj^SDA%-oY|aVF?zoT~PaC zQfU+}SQrmgLR9-A7TT{^`c&r>hv5z$-RINW|56F9&f zMew6Do5h861wP@szSnnj@e!sI7Si*8T*;ezF%U?<}){M2woL4Ks5wGrpoZB z<3egZ%^?s2{-!WHCfDJXT^n{T4Z2z>ekFb$-6GT;lyrtog2heYZwVGKg64Z4zQ}D0 z?$>emZCNnP7&t60FdHH9|#1S+n z1LsSvu9p0Wr`t8quR!ayCc?&K!wo!CFqKE}ZHHBZ9k+wA+!1N;?c)HT;h|&a%d7?t zggF*r_o#`DQ<8*C{ljn|Ch4jRr7-F>jnTfT31IQv^YXZ;o zkW#3;LI(|Boe#pA(TqTNFR&Sh?9wdjAezz=;nsOL0;~@{t>jR^0Kb7xDNgfYR#{Hr?}pKe`--+gxI^zmaA<$$V#jA4(| zK-%`0EKQKn!%C1rSnwe(GHys44oL@uqO}Ev3w3G*N+P=E1sKdY5A&NQ5@$dQe9_@q z6K0q)n4{qdM2B{%1}f~n@2XnQCgWl|I4Qs#SgO(ei++=Ncu__Sz*;$wOT?6=^l&&B zrOL#35d~o&83b4R)sf)`Wq4^$3n0>uU|55~FB({^>joCA3wo+GNcfbUl-6S7u_R|%1lO1pP0*drf^baKQVHcRA8HqxT({@QcdPm5I7Ifs_ z>ION!dN;@iXG#;`;P?vHnBGKSAF&WW2+`ElvP<;liyAyKCD<_o5UPD7heIw*OlS_W zc5+F1!Y&zHhwfq)$AVBU)FIt4*$QI3p4jQ3dR8zlutOj>D(E>&Qp2=*OKIZs zrO5@Y=f@ri93RKn+$si8GF~GhjdbZCHAx-VMDiFM`p9i{&vc^fAE@|;Nsj~G!aeQr z)@U6f@6B|mh?|tqi>F2iD@1RQwqPBA9+CRO-h}2L*tEAXq;-Y7+ngJ^Ou&_RdmGUZ z^alRWP!T*HBG%$nb}5?4vaKI*k=k4k-?GMq)S^32HYb>^#3@ZNL?X_xh z-RXTJA4u2IoK1FmM|e~haNS{!Ogz4NpP^-Bkf@@`bX1wq7?1_DHpubqqqJm$3sRmU zUik-?Qf;)xtBndiG-D=2?`F0`u+-p+K?5pB6moAf@U*r#=b-(juDM(ngN5u&JlRBA z56L^3cDN;AyV;`E#Xhu{Y|V(j3S(Vc3qavFm1xHELC=JWo-I|FF$W^HBeqTmp;vSg z%+-in@Sn;h=_SET0|gDNQAKI7G2NTzk8O^FZB_Gdd?tTF-tR(%sh7$_? ziTttL%GTgv#~5#6XEY(7HkOdD8Kfv=$$%5i5Bc&%CfP)-kgHv5hP?mx^a3LiFz^;7 z9qe@_;0e~5dIO)FDWmIXy5qRG7RBW(mnrNgQ0FTdNtOI2hBxX7rn8FaWr7dXe;qt@=63fMj49kv~u}X=ub&px)j<|i+ zxm)aV9Za1PEXz#4)2dU1(P;H(+4i zZBmY$Bv2pty`*B?r=r80nqrGWowyt+sK*G9lO6VZI(}>c+%D| zVq|Xr($q$RR&>7j+Dz}XZ0xZjM&{gvL4#?W0wI!@XWkW&?7&biollEr{+nYF<-V0F~}h^ng9B z^ng8+3yK4n#ej5eXfy(k16^*PpCDpytTNE+EbclqRv$>CAPZt7(gcEa44&zWF>fvx zW(Pn6AkB$(0d91*@bgHqM!twf0Gl7K5b{4^pNv-qSk}A5ZR^8vU=w1w=P~7LF27?F9MJ5%8N(Uj(zd8u*o{wT43d_M#lWJ2p zzysUwW7_gq<)|;n_oXkWDMppXEIUQ%Eothl-+sPe2Kgx<>&930wv+soQY$wJ4mg_| zi3{RS6Bg4WBOA&pRMiS8<)UL2+lVV{#IA!ftTu-vwJIxX+_4m6WhI83m4;^^@C!FV z#zFi+_N76RWNL?0b3`%U^eW>WBGXD(cL=hw7eNc z#N$&J0^iL_VlxEU(mDwFV5K28!+FDD9gcj^ww3wxQ>Ou(J??SL4v6NEFXIPM*L=Fw zp(1G$z?9D_?k4*Zo*_o91Kp{F*ION_)m7uA-uk+*hztz^3Yk!Vh8PBddT0QD9yYYB_)^w@!IORfeIopSk*3l6iS~WG2Ot;W zN=E!@pxI0n4YL6|$VIy2s`ko&m5A-bUUaOb;%7ugG%R6Uer|w;n$v)c0VK=S4RsuKfC@YUQQ+%H zovCcAf@>LwE+}5%VVz@d!Hl?#Qb=mz3fEB+t(4|Wl?7T-wMl5`i)id7kG^bG6Zfz% zoeHO(!Iinbiqi!-z0iP<3Ou-Rus{;92#J@{Pq4J1EG53PrKBqpPn!^Tp@)ifWV!75 zDkHl99fq~kqY4CM=w;2O(?R19DY=;NuwgF~TC)oR2DcX5QEcIm*N$lt@GTWQLpMR` z$Fv^6(?%mfX6i+@i*kZ#t^K?PB?PT17WSZQg3WSTdTmk#BXz~ka{xstZPmGlKBOW5 zL)+S*--EJ6;b_Za#cJe4xlC-;KxrZxt;8j~@!-Y*11i#lKNt)#-$E~IM-rZ9LM4SJ$W*|x>!#UCdi6n60-vVxZ|H{*o)kX zpAzK%8|U1DpmnD3Lk==bIFoUYv@S-Yh}y+^&ol-Auej&xA$%BzNB$%ATykOTwc>G>)l`x1$8!GlvZ~MK)&av|zwR_DzPKoGHroNX^#*J~G$_6Kq46>=OjGEbcND zcZD#!SlsgAE+&9z$m3!Sq_Lc?EIKzvSo2|$62lv=_j;`R+wuz0DZ{!pm$^1J9<9>& zJxp^ral%;KGa7J+rEk(xg5aSvh0jd537CBwib`W6t&94(Y6e}%G4v^fX8=l=5x6uy zsBjhV;~fT>l?nAOMA6U-vB!LEPYvrL(WTNj&jqzIXsy7z<`dU9CHb|Fv*Naje* z6iHy!DDiJW#SOgTM6y=0N-zLr(QrI1_Wp~*Ht?GlDot2t;;u&OLa-c4Z`qgl{EXGz zAukTLu2c&R%Ap`K>vX%93ku(7aIz5M7)h)}!zNOxsz&m0FFSGB^G(R_`vl`u1jg*u znG&oTAJniE>u5(EYo>7Cgs&OiXMLqF^ z(>g4R+ofOq&Ce~KDrIu%Df_oJyx^0u+W&UTOKAb`u>2B#%NJ38BSw~>y2hgHiH5F= zUfgF^rafPcuNaH4y62`2fmgZDG=$hbValb*P=W|mTpsNl8F9L~$x^=i} z;r7>cx-9Fkj%_)YLPL3(Z#K)zM!nfgjwH>^rIoxE&jb*>l$&Bm!zw&#(8%yMdfidE zt>hO?CYX4wHDQhX5`V4BT=gt3D{Qz3=y2J6VX^#)+t*lp`Q^Xx29L+Bv*6*lDJTY| z@)5w!Jij8>QmX9+kX!(bPI*gmCJ-?NSwb8Um71206WU2ctwfrDMHr9~Eak#MrB?S8 z^*Dv8m87AJ2qCy$+KCKD3YQ`HF)Squ9i??mtQ8e^N2{m}M?@TgR2vdTJPt0^+NRFM zP`5mBm_!q{j+z5jWv2z@&D%z!A|;o!s%3;$X_X&A$h){=8bvmQ{LCwfMa$)kiGoe*X|E2o4f zRi)Z;VUuCT|; z^OT8D?Uv>ada8PBfrWy@X~25KZqCHmZD>Gc$9t_R@f+_F<8Haa!I>s9-d9;{Bs?=l=*3Qbl3 zc}G+2c2(~VCaPe0YRIGM#HwL@X)I)%dKrBMgCp8)S;Q#_sEKj7tsj%@LBo*XP9|0r z^n@OO%Y=X94O5i{am*D<8_1acVqv)DTa}jz#8LW$!RTOtgbFv&1xc{!1nq)^56+a) zaNW95s7hlW#Wb_tt$jggIBv5%qIus$$h?^*mCqoczaH$}=)PazLcP!JHVmSnB87sjiaVj+9 z8B1`oZQ_6{8!F!jjF!AK30Cj%U%ZTL;cjm)S%QqqM`G|rJ1<`(>f z5w=aVkzsWxtD}C?z3qfg383J5G(q8w83RSLq{EnbZXt}RL~{)raHX+BCR2V=iB+wS zQs2z9c#;UOMVm+y2U$09r$RGVC=?Ec!jSA%tg47K!}36gG(1iobR3s}2H|x=su7s% zdW(Mgo}Xm(7RH^5STb3oOJN$e)NZJn~a)Kv4^Qt3cinODBLhvJ_z~+RMsVv{!P$ zP-@smmZXeoGnz3LRU*gusF5cI-2waQ+Hf#hQ)^|_D1!n7Rc60gbEcpH=1Vd@5Py#^ zWKx7VxOW?Ub(#eilktH*3=PbXAuAeIfzllZl1+?YU}A7gh@uMAY;R!fsXc)f85aoZ zm0_aXK4mmx83-DL{v{59q)PjIQiI2_dI)=N;J{ZCMz^% z!A?s+t|qKbkz^(a5C z2>2kAF(JFkvC%>ne+{)d%*9qotmL!qjZagPu$$%rLBp~R#SUJ|m6Vv6nz;cDc4_bk zr%hgw%a>1P9ocO>oRc#piy@n=>{L11O))>`WTo=^i%>>_&q~Q;zh~zN@H$~AD}V0Z zOMsJ89rJT;R+`fj#m(mTxd_ch#gxAA?k$(#wV6Rw2|VGb?pf!J%?6 z114X9?g6Hf)>O|4HZLpQ@_iz1X0Zw?DZ)`dwfKTB&D{TyaJ6#E6OVz;2l5n* zh{4;J4Xcw|4vR`&YcQxH!86f1S0Ekuc--_Fjszz-io9@U9n|< zJN{POam4LSQ!ZQPQZ}eeM&PY^f)mU9|q^}_UcbVnFY8M&+p~`N+vN$PF^F5(um|k4MTlPru zpq4ru%l*Qy${0PfvM4+q9?zUAyz1ySLgcRAWr@y_FQOeHUj$DO6(^t$F+L$(grN(X zKQGE=z{AC74Z&)IMuhVYTA*9q_DP-rsz4K1jBN@btQv4>ad~A~MN!d!vNB-`?2BJ5 z`nlMxcVJ<0NyYF13G0<7B~G1+kiGfL1o7v=#8C)xmpKBNQYC6mUu?^yITZ7C@UTa} zB%WmmRxNRI39?~oyb*7pUfDtPgEOVx6-M)I8&{te$DAAMkxG2wAkCj^a`0hQ^ZPDV zQ%fslFpOYh&S;58qz8K!AEc#pydm}X`n?gwAHWHo`&6mn@j-CKV3<(KL3W4ot1{Ig z7zfHmLK7_4k$O!vD+9J60v0+z)nZ)X?o^FjIAK&XoECW1<_Yb{Q-XdE^%@Cy8=Bt& z@T)RkU|i29iuwPr%4v-X8ewur+JL-_TQq5Q1n2+ytQp=2C4!ZS6W^RE>@T2RavE#M zL?o8x>cq8jjwn`D=vp01#W)D^Tf&gBz=*I{fqI-Q#_qq94!Emsz%7sd{6>t zk!!sMdY>FzrcZG!UuEkMG5;3NDbBTRuEv4`Bh(nmm+a;LRD^J<3%8Z&5EXiAY`ZYU zfnJ+<`xqTDok<#mo=zZ3!~*hpw9ld9FCP1+dFfZ0;-xO-L{tzY41Q>ZRw0Ed^kv0&yi!vY6bjTu{n~3>-Jj-Nww*EQGAoQyhvzqO~}JTnju3Mvz+5ZUT-!zyQH>J4OOI-!W6WZ_6$zp9}Vgu0Mg2tpo=oeVFJ zRKQ$Uz+s7M+2}>ua`6b`Eiq%Lnll!1zVPWXe1KxG3a({BI%z87qG}_~XhedJmTunI82!yl(=7C07Ovea zH=~sli+Y4nnFEHtV_C{MUhxFoQKp(>u8aTlJZjO-n%?giky{Wf>h||KjEif$vCIyV9T=hX8L=+&mr;m_TVV^O9 zOm9jVIdl*L#|yDA>QL)I>yjJ`R@M*(bIcG3HZX#hOwS2x%o8%y$e3|-CNTpD)TcTE zXQVnHK9~^!>vEbz#_W6;p;5zp5qf}wY^s12N$~=PASe@D*%(fzWmB~i6AF@!;xU1O zaJ_;Zt2fN+jxj=y>z}0>qVo`!77kMilh=&rlu)~q>%v0so|Tzg0Q;&x1haFNP@TG+ zL@kJnF_??IL(KMUGs_&&sp2!t{Wog!P>CdX$Wy=WT>+nr^uH8)W36 zh|-@7!m`z)1v8@{WondqU(k=z7tAPw@zp{sZV={`g;rsrxhXO3UoPP=7`=vpA9=7vAmAo4To8FNhlupVq5cpOTa9SvFH zHsG5ZUsR;dNL;-goCW4y%iKR0v*4gE#|m4lb1_cgZVcvOjKQF%TvQfoT|}+dH5$J* ztYq%8yaaG48L^|IpPGpk6F^4@W~-0!s_U6|zYtcz&Pj8GqtuKJ&3V|JA;QQ*5vLdH z%5YTRdB8v`LRe1iUMbN+yHqXgXehmkRk*PuK)FPC&>w)KyI!1vGzZ;HHHmPy|2$- z0)m3}rUn9y1t;jciG2i4758L|SXG2%0ab;1ht`uu#Qp8d9xHBSqMtC6NITi7f|~43J(w-TOg(%QQ=c~0 zSq;)daFDWL|D;&1s3sBg(s3!H;z3J+2hkZ!x~=?8AWvvgO9>wO6 zsCuRng{y<)WOSp6yGyfFF%39QAk-KhnHkIB<&JpM#7o67G$5F`(zK72PdYIvJnM8{ z1Zl+*BW7kzWBMzMZ5b~PwOR|hQ~`C);$bSMfNN3H9Blm%HQ~s~v{Gga-7#@-6uUjH zkmJ^Ee8oCDTpo`hvLLG}4p<%DC22_}q&T<_6E#zkxEZ<^wD?mp^)efoLmQbiqn0us zs+2cHEY=WGN>*BOAUQQdRolqW8_54~iLCi3qM;rH%61uqdaB}#Clf$aLjoa*)f4n0 zM7B;OCast&CX2N&a#z;hL9t-$&488i?Tat*ZUQ?v9dF?nq)zW<6|1Mw``VsOON>yQ z&zGiZ)d>Ixy9Q)dW&GWQY$bKkJW@skX3inXI1ws|LMlr{W{n}{KoCOXipog%)Ov(V z8YoSmq9;md3jk2~==Bm}$e=@HxLlzG&Hkt~53Lm9U`SlA+wTfX`49}5(4By}HNsJ{ zW;6jbxK!ZD;6JeIqQGy`Tgz_Bc5NN>_R(KuA7hjXc41}6! z_l%-J&;I54ZCKzBwt7wO~I7Hw;%|%?E zE7OsOZOK!vt3+e5AdRH?ILB>ffdmK+8kK2_1Haz)e6SL_qNTfZHEs;p#xR0OnlLuvefY=#EJ*9peWj zaviA#1>Ej|8$CGCU|rB`fL8gqGOW-a$9H`tzN3LcgEcOuUk^`6l?cyBgz^44>aw+g zAsC_c7UsV=Q=&F99U!HMCAii(9sKGI9?uozxRNGlK^$s8;$4 zE6W9O(SVr+RHEBpzcDsXl~=^CS6aal2!jHUml28xf;p;wZ;}v{Q8m)cc6v;)YVwF> zd!O@iotc}e=$g>SJ3$xFM0G?cTt{14i9K{*c2;e;#np1;h9@UM?fw?m?qz~vYVpJ} z@t{cGICSuLhWoq?UDK_e{sfTRZ1^3(2E)a8@0o{V_PVv{}0eM&a))>E0kD}p=>DN|G9MNT9_>l7AsZYz^IA$5xRg>H}- zt2$UrSymduB;zzodpNjdaN)6ohO%I|Od_U**dS6U=#yD4#S{S1h&mb<#W;>8jheR- zS>c9Kl+7fIl2%PAv5*p4wkPEjsD!W(3~GYuL}{ADp0W@G7#4y6 zY>){9(wxmwu_or*p!wn@JrzsBa+|$>Q!;?h@uUOIlVN6&IX3I~cX&su&NatKT5Sb; z9AX@E;ac5ZQJ-=V?$&FqmuOyaq{*Wo2Z!}ZkS6j>0svEoG?!h{Ar7Zy#By3`l<`PN zGUyp^nq#+g=WAxM1dxg!95p^h!J%fXC)6`Bwb~uICEH_|*`EKg1Ny(f1DOw>)?^G1 zWN(wRI&AFj1Z<_f9j@^ywpP`e7cg{Q0H|)ZvdypsCMwusEnUHqg!Mlpk@giHotyZuIaIee^RjtyYSz)K? z*at==xjX^GTC>Njv(xPJ=(|RIMx<*aAz?J&n+O)Z;Pe8vuwh7P3F2h5@#8x@Rrm~W zoKC02YtFHY=Uepiv58s6AO4VvpfW@L>eCj>|2V8R_jFxO(nXMxv{b>u(N*$ zvVQ{Pf7RLKZ+5&T9pakcRmCn@Dh>^4LPKSq_)W-5JA~pxsVcigRb^|`1KKfW74(QT zV(gJz0MKRV65|g-G%FlYRspwV15{E|i*3}Rc`#=0WhpIPEUIzD8$gw(pHQk%f(X!x z6^v}j{`7cwb{}-EWfDLUpN9pt2i~kYEM$pj$;;wW@UDs45mlfBk04QCQ>&SvGaf*i zgOS=St(H*qi@U`q@)vrXilU!63aQEHx$s6bqIQIdKn({&mlT|u{`pWXkH*DtdHB#- zT?Tz7y>X7F_|G7B4E4=$j&_A>jIm>tFwYYEq7c_4?V%$}_tHGu5wI$NUT2dFou-bek_y8TM$qyk z8ws=4#ngu(>u3}j@tZTf-YIsf6u*i?$kGAEjy{!2xmX+kKTAcc)hsxehzMK}UxKHY z!I(A;l|`xe!cEg@RMR-r)*j~Sja5=nSXo?JTwd9|vKzmw)NjhQglXC>fz5y_>%x82 z>2dISSc*K&V?EWuJSBuVT%bwOyo;>ZYyhDCMLS3CLP>+7(LP)Vdx870t7t&82~(Dy z?P4{_T}(ullbG88oUI>V(cCX@`eI-^#hD$I8g zzj;jJ+;qSAAZ4}!4Wbf}CgFhQ9IBZMSh%2BiP^yqjj!tob%<*ONeZ-!v?E@nXX&knNG<3sw^kPHyPw7bIJrN^M>hQ7HNuPgE9>PC%cTOT#Om=v#BAKi|v8IXaR|U zpGj14kzrUz^g$C9gXt|tb{US8!CpbebyRHvVFP146>wc3)i_6CKuvt%ZU}-t7fRQD zu}2lEv_PsX)e3b&W7gj^{H`P2~bhb<_l*y@1IcDaO$>AXsCo4d{0{ zt6;62kt}B>Qn*J(fHqlX{ZV$Xgb^k-C%9XhHsO zbSD0SEynytp(0sO1+6cVo$Q>d^r=`Et+CltMi_f{S+6S9RGOVzmHi!SxEXH(z0PDL z&Qb_88A58Z`Q%d4E!l*5k~6f?xY%Im0QkTRUHC3GxY);}L4mm9g_li}+kSKh@}IF{ z^OwM?()2568bBtJTpcl8pr&t((P1WRW@f!O*5`%ZLt$?SvljWA7!si3@&*?w^3Vwq zPA`wK6=u09TrAH38iwHUi_kb2Vr?0g3wQ;4$4y#sW+C(yMECM~Xdn|@1$uy(yiFIq zih2#bVjAB^&^cq*fT3&^M9VOubhuKB%MhoO%^^uj zv6(f!RXJ?<&>_PF#l&9KtC(4vs}U6O#t_p13(dJ%XpeV-RI13v_ zYE{5VugK6mQ8)Lm1*sI1bZVPCraDL%qmPhv8$BYKJ{{Q%4@-LiqE;z%h0_>eY?0s& zfm8w|Z-m?aGGPXuKQ+0nHi(F0ZfI89?m%9M#LK;w}nFpWMfmF#YBWNS;dMNZh|lkGFc|m5U{*Gh<6;~ za#Q6t5WBZgx^3flC-_3DjWIVTVXQKuc4kzm1`wtl?Vu7uJpTaJime-53s~p!;LHaZ ztAZz=JF)^Iqi(y*qNJ9fe`l9QK|ND@Bq~v3?ef6I$Y-HPnNQCy)}ejZs1fdp;?=HI zzCc%Y!o zhar{T;6+n+h5*c!i5#vlN9544*a3CHdU`SO6sst$C-X{|v3o`ibL-~s-T1EN`hON4 zAXsPBYE=`XE1(frEf|wS%>=+XHay7+dt&DD$f+GnNI5i;V$M_swb$qEHHo^ofg6vK z;NwwWB47cE)>dQ(MNlZ?g7^s$@KR7~!s`dH9Qa~$@lCw;kb`Ayk*hRF6Uk#{CYW%h z0i^!oZWdL5xy3VTCj!B)a09|vx!#M50U5gB1e!xQ=2(xOd6osMtKqnVZVINu3pXS| z>H(U6!=OAx187odGcuhRU0-NY{6rH*qm#9CBX$-!3x^fM>@x3bSH!`*_2^|_kP*4P z={P0|W>DF?khgQw{75ZJVCHjknFQt?L3T@nl* zz*MrBrrO60koj!-MN|rhL?r5LfU`Txmd4hE+)zH``4qeaQ-k?Lqb$cK*m$ujgoa;| zT{fm$xHgyqNe9vGP0;U@%FlPieiIJTu|svn8>*6{gWu&;F2fEL*=9bs58`1dY6(Cx z+~1rxpjOF3S@g`vvOt9ySysr9HCMuvC^E2x46%#7bO*g*H`^OL2L^0)ngau_AF|?+ zT0&JpC<%fFt9%iRxWK{=!+92}C5}LZ3eyd!Lu!7?r5uk7Vo)Fl;c{tm^6|kcRFo=> zrht;2Wy9mGr>f1%z~I~}SCD~*#Dav@MRuJ`jL0F+=a}A>u;EMxh9{Rd#A!nJGR(Bh zqw}$}e1d|*%rO?6GE;U4m*wQFWM>y=a<)i(93Ui*PsB;UoQ5oMF{C@xf)f)SHG;7} zJYKi24m7D0Lht}u8+N)K%yziPdW zF5V95kW1uxKx`yiq>*AA4K5a$D2VycXnq<;3TI)-FLh|INqcPYs5h<4c*b^C(MYtf+DDN%?BDJU>g5zq0dLNDRYsxp*c08T7+e7c2q%5 z7QKg@qk#ZgRKUr2Et9aGY3lfz*0^KWUh$1YT*0q7DrMyUHmV^%vhM6+$Z({T1_SBv z15PcwQxTws&?Xp4#l_jVGzVf55XaKNo6JIaj%pm2H=L1bisCKMdA1cg&u$K#b7gc~ zd@c?2THs|YwIZ=zj-3DIz$ShiRT2@IS6NNKl+RHNijt@bNwI^Xv6E`a71`j!(1uF< zBa9nmEdhX2PB#iUwT>hFMUV-{x`ZaNFPa0GGkcL&$ zbFowO?nfilJ$b+3SzUZ~6LV4&40=K!C8Qo!R8dQP_>nLT1$`(AE=1FjuuF9~5OE+y zZ|X4JJK}uG<*~SC_1@T3;sm+O{1}1=sa!Iw=G}z+coA=i;ClY6BgQ~gn*gRCVVUXq zROnwdB^|nF14-zLSZqyBE-+Oi>lNYW!jyQB$wI-njY?(fVn-aOvo`W{Be5X7aexzI z5sK7XeLP%Y!GM?XHB4xM>;yq_brfMy6CO>v81#D`N+?D$@hr-v7NP{svoQISZnct0 zks8RL%ag(fAp)PLIg?A0Q&Xj=1p;j}I+?o1hAKaViQPsM^KiBGvNHmV|UgidPAxBCTCS^H~?qXRv4KNi zHel=5Y4bzBs5qonSOBVMoQ2r{YZ!^zH4}WXfw?&Z)%}Czk?N5{hl|l8njmxx2wC*N zu#80{O`)(6a@{2y95h-1jHd?zFI4)p@DsLP9w)>S(!CiD%(Z@GBf^ zj|bFieB63r%J5QI6m*r|AGn3c2O8*#Ih=92P6T@N`oa!yS_Zj2VS?Skkk2ccL0ell z%4;x6oYejDn9DJaL{#gbu*yK#^WI~&``E3;Sv#jRIT|p0_@JU8Lj=aa1dWWH8Xy!% zg7jq~6l7FDhUo%|!lTfI*t1v)J3etByE3S#Y(V+2!ius1szlxNds+E_VM8i-D5GYG z1jHb24WGFGIYFTIqPVn3pMh~+X?hw zaTTBn0Lz0Wzi=G;l@26?9BjHM$`G_)(j1cur?Nn5nNIE%Q^=wSj4m9@ep6#p7G}`E z1yni{45Ofp@Yeyim&GNQGoF*tEu$xo6M-)QG%MnaV%8_<>mEpB9}_O;9vYQ8IIso=V(xZlc%xdNBE1sInVbS z6QjX=!d&MAXMKJcU!7B&j$@AnP8~H2vQQtj5K0!v&$KY#lStywPn4&o&jh$C>~&2* z{#|?$96ij4{OqA0=@`g6CM{Rt$c^atGQ-l4EeL9`pcjHTMSf9>DC(P#%?$4YoK{>ve?G!cL+5)qvo-TbB;>m=J;Eswh$TOePiA9|NTPT%-LAM~)1w5yvP@oHGhNVr zBo&AifjY3PG65Opil(Z4iD?Ep#Bl>uN1o$OC;4qEEv_uV6pXO#Yt*;)==i&Std5+l zpku}WJ3w20^QdE%9XiUlJODrg@ye6mSaCWoCDhRrEteX7<(bOJ8$$1qtN0|v`9k7BB6!Fd_1iH6sl zOv8?PL-c(rtBHIV%OOnd+CBEoT#r){UZ8j&cn6?&dLPpCO=FFRfvUn2W!jQm;sK|} z`{9CkKXi@zL)>4+#rvUCEJ3H-P_DXAemux&@qU;R?+3W>OqZViJGn2-cc#8qo9%2f zknmfd=DO9~Z*c+p#QkMjpV*#~&n`g@krzr(k?j)YyCv?PfNLWdVW6^92RlpSV0K89 zb>gm;!<7Hb{45`Sb?K=`}A}Q!;;fEL8QTxn*a+2RzW$A^mOF@02=}e7pVg_Fe%PI!jPsT zSXWQb-L=jYAPifE+c4sl|0n-4$-mrg-QaIF`G5GE)uVeReusbEGBcC1vb&R~oF3hB zvyw8ia(d);PjY7do1KXFFA6#pr!&c4TitBAh}T^cb~Rt-|AYT(bEx)ZGC{$?KqS4| zRp;|JJ` zJZGl24q^UJ&;S4FfBN}nb7o`!*7(=jX#V{7=#fKy%j!nH^~mhjy*nwFMgH{ozvusd z<6rOg{f8Enj~X_>Ik2Ugx0l>(aIrYkx!1huQ!tHgf8_-j(8g*UCC{f>>NCNz`#D>@C27ratpy|@E-;^WI%Z#8B_VN z^Z}Pt6p!eW%(|40XEknk={D~BN(pfnq1Jkc*r1U+3+GVl3-0RqsCXA>?|xH zjgc86zjiI8=AKq_2koIWb{Nlbz<;NgHkZyyJ3ufh@|mr)rOjOLe!~k`(nlfD^?@aj zC(4wuS{kW3A^wD_s)E4@&5kwX^ONxold#O&3C5T~M$x}`1gD4Uyn$$y3kV`nA)`ZJ z_LB?H=mF=3yI9GB9r%7qE|5FRx+HFbICr4RQ7GaLiMUN2-S6w&>o0S`|N z=?&L$eILpboW_82|hvpTtsR7b++YkX>2T@ln<+nt&=0L5|3IG*Z&cQ4^LL%U90NhOg z50R%fpef_ck@8gd1E5m!rV;LV*3 zGA22ma?SQS;j*EEDo0te5}J|=&K5*MmAEW^4cSmbwsNvqAcI73&~IfW%7nw9t$wqf zt9|bW;!mUBEnX3Mj+tGdx$)lJz|h0-HnDAO({98@>D$GRzdtRHh__tax;c+_wIIwCu*o3=ECA#h}%-W!bI2ilM3sQk zH+?xGQG=Wwk3B4pXh=muq8FoR>O9$*_*LXW6|wiAZI%G>kQocnoX)1ro%qO*;dIxJ zOtg`lJTTf7`Jod|Ez;jA^&NLei919lC)a%3s86Bd2$HZzxzM9rl|VzbP4uhz3C@Kb zo~!O~P8oy5!xxJBZQK{Ru-kK$-9ChHoC#^uT-fZn%4TOO=h$`=jK3S50d=zvb49>A zG;t5;@YN$ekh;2*F>guG>I?%!2FqI!2nmGP{OQSs)03;5o{I8;={=og(GYmTC+ZgL z4CUC+d#@$y(E}=wr)G!?j1p;{b^AM`CsZP@?qZD62h%VV16Mc)iu}uoYU%|w$$OmA z53tr{7}TK!HNkbR<$RY2K|92WPal~gg`zeET1_M;AycDHObcQaB;3#F@!M19?-P0d zHaBPJa;7??*>OK>zQUYj&8?z&M+$qZL3T(lZB64D#ER;4AsUk_7IV2G6Q7kA_A41+ z7I8X97WXe7+$T9JGqV#&(aMLze?V|PI7ikf{4%H{uUb7dr1l&(ptvZx3eYeX1`)4i zISd{&D7m0=kd1O91`IDN9$HFDv!}!`F2nGKBgqByZ{qT1H!8CORU&v#5WIhq3+Ug( z<5XxGd|s z&7OxaaZdsMu~C{jjxv|gM5V*72JgfuBog6IwqVFoAq4qrtGwSE!18`?z*c#K)o<9U zpT#aNU=N8Q3@;pl>`QHJ!SsVk~+*YYW#y4RnqvFKG>~6 zN$Fzx(83yMK9QJDwlE9f{Cqafr!UAaDE?#%rrIAhY7qvXY{6jke1yR#TQDpDfebxh z0|xStBM3a$gFra}g~3N#P$AJ!$aYH*eh5L}!4`xO@esZPVd$e>C|`gB`Rw(Llnk<2 zppUkoB6T6kRLEz0a7fv)2U`#r*%v|ZNjU}afS@yZYzb1AU-V$mKOi21&|Q_ zN`rlA@n#l}Hld<^KD?+uqFf2_@qVx5 z0y|hMXaHRb-@H345>y;j6BOB=8i9z1V_e8G@1v89)CKR}^GANo`$p#c>At|7Evjr<=-}cNCic@rwJ=@xQImtY;ksY}< zOMw&&RQqa@3-tFEz|*`+ri@B6}>oo?V`U{89@qVQHV0d7!UY(s)8iGYL`+mN1UT}VK} zi)~1VGA|(E#XcljBuH3%wGCZE3cG6sG<~%XZA7aiEP1gFiCP@_Y#%Pz;FXJmZ?<9e zp|)(KArwt1FD-%uFGvmAV0Le|Y6yGfrXtTRfCJl9uL6tjw&B&qZOPh31KMmw11*}b zXegwtFuvKs5V^?(cGYN53@#EkoE!DcF03y=Rp;uPU06yK$Y;B7bWY{7T{upLsBd;* zji4N*5wt%>z5~=ZTZ`B|nT4oL)DDzlh*~_h04hW+z!YHi#cmxzj~9dC@*4Pi3*Zd} z*2ZOuWf5)iCz~+A>T1-1D=*4gs75VHL~X)V=q@-31WM=%RaxosB)GU(xhhwp8;%#m z2oH7&CX#jVa*Z|%CN_~^juVxYHUyl!QX6Q774`TMuonH~}! zpIM_J*2M)v&LVC&nqUzijBBCaA9N=dh{uE{u(F8TKT|02ni#S_wGk1Ii6I7~2?2jf zT)vnK7?qdAP#2@$I2aVFZ#LlcnYh^gOq4PsHTj$vX1Leo;V|?$F${W1QV@Jh3{epP zUr`X~sBekkM!LcQeLB=HHsC>H$3{n=ZBWBd*i~gP+hz4Faf6sbi2=c*4Twm{74Wgc z!d?V=!wB^v%G;yA4>XgjNz;+JZ3r!H5C{uQnjT$UV$kqc3)# zC=)85?ZAYZI7BFc`4pByvqeTym_8(irXnr=l(;;z+7^$AA!^vBOGKZtIRB6y)Lori zpuO6H#8~$j?p#32Pqu2PrZ$J_n=Lq+AXos>S6h&^;*PLoI;a$M2cvb$?JQ;B7D@WzFAg!70k1`guho$}chjG>Gvp_ivD=Tm{~jmc2Q zWY`-Mx;gQE&EM?6QMIjnwgZFd`#2E3*nuJ=Q4fLg!4@<+CCX1E&+M^4$h3TE6oqd*!M5vHF%6PH_;`UhP9lO^o`*HavAKHGN17 zEz*`MFNvX8GEEA_UJ^q!N}{9D9?j7tuhu4e_bL{fpn#~RVevG-(MB|*c8Q>Dei_dx zu_CynvR@Rkt7D`5C1FoXDu;V(7|8HMZd+KYEJBV;9Rr~+_7r_3U^zw2+0-{1O_Gw- z3Riuz2d5%J^@BZVYSXH|*@QDS+LAWqJuYAEK!$5jZO9?nt361m(2}nUO6uk_XzuJU^sG|xbytV*RSz7gz%^ElhC*Ewr$z9CeY`}pi3z{1Yz@wlkFSekx>GIem=t?S8^ko-!fj1rS@_vp(L2{TSEmP5Aae{tK74R>1;3X=vc^gZdX%An5CZ|dzY2=3% zK{v*LCnjfUX=NAN3v8zqZ8U+}ZB;u3@`DZNfVTlDNae*gl)4j?FZSTgdr|#luLh}& zE3vPRE2)I=D5R?fgXFKaAR_|E&Y6X4L%R><2Yb-^T_``;gVydr@oo>++_3F-Lt$@7 zJAv{;3!oKBOZ{Z022gLgn4(3#+Jw~bv;5E^XtnR!M;o<-z10kqJlQIb;TR1qD zWTwQvXr`nx8jy>N&o*EhYQ16J6h14gwkkVdk^)RpMgyqZmmPq`I%xoKXJwU(i8#eu z^PN;-MU+BWK?}lKauAO&F_*9Qp?yIKY9~k;FI(qgro`gSK5WpCkaogO@UqNHTmsvU z8^8gS!=t?0hnL4*zS@TdUpon`xispV6H|)2cyc`YXmekJ@5F%N!^!_sKMMMsxR0#t zz~Yht0uWwoLk<}*L;#X!+i=4xN(CHwwhdP{so7 zJG7#-Tmgnx`_LuDr2`}|yxE5xK0s-gyx4~R7mr%C%MOj5Z z0aek@E>uP75DrBi?Lm3nMa!lQ!z1oB>DIPSq zyrOKt@cxD6g{%tgo6UN}T9(^h$@0>n{G!E2yHFKF`tgg7z1V~#d!)E@5QC&IHX$+5 z3j@SwyKu_RC~wh@FfB>TR)dtTEF4x`GKIi#poH}t9~J(C>e#ztVwwDGa7*lN|FM{0JS)>|Z zRNAMfQy6!xD^TOjb3%F}$R7$>vPx*q^o$%wdOCK3W@IOP4ko9!Onm=;|KUHvMyBJ` zb@c?@UCCR9+c5s+HZsY-+-}|AZ#MaV_?y+EdnSG-|GH)8W+i3iWM%ir>Ykkm<+5^e zGINrgng4P>EdNCzy}Z+zj0QZAizyh+ zb9NZm6aLSc@0jXvR0Tav@rvO;QtVj%g)S?6sSXAr>D8_}pT8;3IoRv3hcvscG|0K@ z@~1fsSHMU&ykTE86b6UcbeG>(6UcLpC(GiiZi3GcaXY=%3tkF&&a8~=?(nhB6|V7- za#^{dMyD$p3Bt#a%j59{YVw>p+2kwvP!$Y&yrf4)5K?+}aJ${kEcKW4u*>6%8hHfK z(9dcb0ebd@@!=;t& zxZDw6y;p6Beo?zOa3I^k1kB^B&tUo6pa`D@I(6DKgw%3$ho-|Skp+>3L>U(wpe&r{ zOwS>mHT_51*yP>xpJoP}7Xh=NNW62K3IC@aru3es=6YJz&%Oqu5jdLaI@jXJJw7Ak zcQvU$&?LIG@mAB73IC_Aru@RsFun*hK)WDXs)8WGY*4J!n%tEn1WB85FU$)q?VTcS} zXIPW>+kGun>VmdbsUqZWEmEbBR%C`GRjSk?pi)3)L<9tc009DoBy~X@5ETWH5tXGf zB70cWO| zCyowW`7Qjn3fhm*sq0T{+n@f4^6UC?JIdU?@MrMVcG~T$P0CY8d-k7l5}wL7G&cLa z_`j$!h%u?Tx)+uONK}P@DBudCkuYNHU}|tQ zi@YlGJA2lckaWZq$@lJk9w%CAcF4JKP({tW>?H z&^e)+1U^4unp|}x74AFG#SIRfP)|YZ{jrTi&FwM#3~7kbqLiz2L|Ch^+k<}wSWK$& zxgZ_R$=*#}n^ybe3IE7UTc8Z0W-}Md+C)l6AsOIAO=O~AoXqiP92TMIUB^=sd(;iZ zJapm$zs|BfOJlXN)eQJ{71htgf~OQxiHQ}UQ`Jo*P!<-n>QGR?_1EpK+>!XIgJoQk z+#gfNVz38Me-2;ZU6p2~4|MZ}{$e?jeS}Z&@b=8X&%~zsnbx#L?a0nBY=qMHmL;9; zTB|P^zHz!-gj#2^?^mU+OU|fzb8X_1gC~A}Q=+=v7Hh!BYj+3JR~Q)? z6U{J7=cc~*0OCJzdTr-mE>eEm4bEUz&y-&Y}mLa-&20^6JrE3hOr@PZWmQJNf1$Tx%U7y{F&n0yt zY8rjZcf!z8!gu9MvmsxkG7P`7M8igbg_=l|9ILrlZE5Di_e&im3)9BER)afq&opqu zTiN>_AGeFg;c|=nV+aU3P7;wb2{a%!MD9cryI{W&eS2J{-yNVZacC4;5WgML@w%46 zDnX-hvwD4?@jkTEa@os0#Zu_N|JM3O_})e+}w=%x!m19neOE7Q}WnNQZ#C5j>>}CsNb*qWXXi} zJkw#2Qc0$tInyGNo#HX*vy!D}T3(q_d6Q#y255fLf6JbZL*4)>O^6V5L z#hBHj@rcoCQb@at;SC~RZ4IL~$`ykz)-+|J>a5=-c^mwiFxM9T+87G#L{N6j6KBZC zp_=#^>hz4^{b7C{87+KUOJxJH5TnK}r+IGe!bLAIs4gBoKrqUKr4HUQ%f2sxD-k2e z=!q=Qvckk(9M6i1j2T@e!ie(GC+cnhEkiPw)Lj_wmb7@0vtF0*O)0bGMfiFgx3J`r zWUbtw!pO8uNQ>5*?&3bq;xWofNj!P-adr@0&3(=Z)afn<6?pS=LqUH1KJT+-U!S?df7W2*0y1NR4 zl135qC`{BUZnGb-EvS<^sN(%vyulUZdy9iXD>XCjC<28GBK)*VC{28yi|n@ zIv;7EQ~0f{jQ))|c73tf&0eEA?K2!Io&Efn(r<5b^E6s5PB+}4@A$6| z&pIfut?J%lj$uW*{BJ2T!^0XC?eC_#ifNu})Q;qk{mBb!6^gPNgI4TR1tiA|#p|^K z)ADW>#n&z@Ww_e9*^n;y!1N}q>mh71pI+LOkkad}qf%uzpfjxBmq)eLSn-L7u9#?< zYn<;@)u0ReIaPDewO-U}24lDIyTP|i5cSIV<+qgT`fvQKA~AsyhLriYhBKw=FHUp& zT~tNzrpU&gOw?cpS%pc4d164BY}i705l$h*PtHg75CJ|A((tpKg6pK_jdBjfaHXI9 z1;G0`6uq`;|94;2Y?=mTLuIaMvTX|VVBSbDK*!Ic7MwP(cWyoQMmA}W(Zq;rd4{(t zY4fawuoaNDI2kzM122&=pRxB~`b!jDYkt!pR_N*yfGLvEMVNH~O78s(2@k|c)z zqU;12l%VDpk%j|&e86!%fp|AvUyny^DSC!wT94XL%?{iv&wb_2p@FXO+HaMbLg#cn zfXr65XvHv5?6F%V@2}e0!XU7q6`hCL2@_KH>XK#9QmSIBbqkA}I40R&NDpmj;(R1v zu@OtxxgW)+nlguHlE-+c$>w0pS&n9gO=?)`VXufDE0|Q&G}1oTJo~{VgIt*}ia~m_ z7rKmr;AbTngFtsPK$81b>YvDQkP*YRv zm2;V;sHOagWdvrAzor9a^l}C1EEtyJBIvdSX!?9xGBl?4mg}WP% zcJ^6hEQ&$Ux;JlJ=0Dsp3J}kbt}{E0Tdx;!OZ=f%x|JLPNc3O^b*7>uv)`)lXY^W^ zareL=s0<@1X}-Y8(#diF*x6%mVn;mbU}Rrsyp3Lui1r>1q8ClTD5EDLHY*3>XCC4$ zGZu(ozS^=>D*bOOzm2*vU~|@#vi4yo4ico}Pa;iduy^5oL@|Yk#d3$bShNsy`1;M= zIn=c1*lCx&?m6|Exty7kg9AY4je(bF(=)AgrERejZ*NGfA8#>dPM*Qe&SZ!y4!K83 zHS~8oqmW{@t`y0hPVRa6X5^Z*anR1@*s%i+vE!%BSbzH4H|okK>}eRiisuu{(2O=V zn%EoXe}xQ_egavJuI2AEOY`#5y=!GwS#25twcwt`~C?IXWYDj}Xv_3L`e@hk5&iRyNo~yZ4M=Z(;RE+*gCECpZ#(T+twHty_vkiIHZutD>G zA14dd=T;}{m~a$!=7e>G06ZP$v2L-lvXTRnO=y`r(gd?B5J@JZXiQ_>23g8=V*ihs z{zWVA>E>b6y*V)iH|hE0sHkgnMcfC^>gyPn%*$e*d`0a_gSanOG-O}Hp@M4G>&xMS z)ajAI9mess7(Gs>5tAgejg1WuZ)gP+X=pM9ONWcceBRX5fXeypNByb~V#3|KzgO(Z zAv-2bH5P8p*T^0t#M10%b%*DeH#NggCMk7I%hGJN(#9KyBqzqCQ8x+6Nfskc7Yv`! zQX;xvoxZQu%Ov0RAkPJ14CPD~oaNfUb3tYV_}LzChSmso^`+)m%S0^A$V=0&%b?+W zp$BPtN~1rlh9#{p^sCM~$$cn;#LHbbeZ5^OqlUpAM{;2$g#~i1wGU3O;tIog3umLz znqep2)j!OweK_j%J&}wBXkh_oir_`%20)4(4=LD2)(hm)wCSC6^ah{D{~mojuttX4y&I!H70aVJxpkt&Y;s@equ-Y%jv`9?b{$CR z?#6*9TQ(++E|dr`vOjts%B<__V6Cdh=VwTdB|ysZtHFY7@>P!6zI|cob8+IKRnpJz zRAneJt2w+I>Ex=;V>4Cv=}y47OHM#T!)`9lS-XatBv^Ya&*G2RVr5;%)F2R$%6zDB zqnA!b{#kPv=O!4qZ<*1duO9sA5hrY|&VcAOv#EFfGw*cUAskq}tm5JES;DPXcWh4P zPE7sT{3DO*&ZIGJZwFC3H@;8)sV^6mI^R|URWFx2aRgX)hN)n>wH{IJ-D4qEY9)jF zV6EB>hAFHyV z`H%Op(q>`xhx;|*y=y0RkIMp4w6u-+6jMvc&qrfMRbMa9R8&B>D2xAw?dRC%nz6WY+cL{=#elRmWDF0M%-uJW= zGi7B)i$yc;(Bw@Cc-J;(RDnWU0w#!vb;>n)HK{ahvL7UO(5ZuHWi8}ZSzyB=E~B@3 zD{UUcK8Kurw;?OC*ap@sxu!HccDSysOc{a3`1|{d@i5SxEYo7`($Ct zU!KG}=l@~Nl>PB~qAs`%atU)XQB3Obw>YCPs@*UjQK0`@vg1M;Ndsp;ziAIScbq5^v& z4(dR9@~=Y}=w)Ui-~SN_(NFcnTdreLX=19u``S*H&%N@P z(RUIweD_DmA*2j13KAO6r4P_2ifYvzq{aV#MWF{0l`j8lu(km z+6eEgmdol?dpfi>V%@wj+Qi(x>h?cr`q~w`TmJfIt;!sqYB7@5Th5n1toh&3Ncrh% z*F4h9N{NhS2CU*d$@1tUxP$R5sc!{EzcyK2+B&z5;d{7qfniX7sUfg^zIlJ6t;IZf z8&D#7C3_%Mi+r>WG?YC^U6>RxFl<~*?@ z4#U(BGRs1Z*zF^wDT`*X2dY$h*~(aT8-3vU*@V(#ZJO>_&giKHJ!)>ynu|@z8;mtkHSfnjF7`K#P*75K#0i5eFvsjwna$o$#_@r+y6;62nAL z8u#>hm`hJxUzQc)9?uXTLyII zbIS6Uq+E9e@R|X?fmDcNzv*-$x5vizG4R5PWALyQFDH(+4@W1Uv~Q}_Q1BJl3h$P2 zSk`)yM<`-%2O4oi=WlM3!@+2T_HcN9pQ;}(9dYZ+4~lSEXc*F`iO+>&{k56Wn^zX z%)?zud_jMSwxKCiw_f$r6G((#nuJnauC)NuvmC7At##YOUF=u7%wTT1M{{F+wzI6? z76igJWQksy*u66yNfR%Qo7Fb5cN+NxmDUx(P|up zpVS?GRT0(^8GbgWTeLi-ugY=Ui$*6g#AS*)*d!wC!g_xnZLmF!Q(#knP^PtDa2l8H zJGFXzKw%G_{$`zFfTUl(!rrZ8Ll317O~6Rm-gRxz4=dZYLLh^GT{C@2ai_jhzMX35sHFiUGFRoP!S#O&;T!Z(ayJ4o5N5trk ztc^WBZX*=W!eX48NIDsfN6UrLCB@GluO2p!Wyci-gsIfVR;fP70XO}IRq?)f_0f32 zAd-#bpcN3wKwul?MC3}$praWyed!jiw)5Jj2Vq5h9E^emhhaZV_Z>ve9_LhN^dQ}c zG4Fj3=V5-S)OlGmCUU(x<(-F_bXR#iea>tMqJ1=1ZP1SGp%dVWE)H~(u3gBl=nCO;F-DQmkbi|M*+QHIStUF-|m2lh|9Obfs5cI1ib?A74X#56k> z6$=~++yrXLT}py~SxOT96O#}R16YLuT+;OR9S91kVR)&2&%JJH;nNNPS~@cAuBn0t zr=M<4SA&|i*>;lFZrUAoo36+7!F~f>N}JptJ?naeD|m|l&Z6O)C>410XomLln>*%? z*V7~EGg&vqWik@t__Tx!BPAo2oAROT-&TbVD=@-JL&7|+FzvuH4ZG9~VC?(hPjA(A zT?ChgQuO8a_~Z_B7>J5w+A5~YZ09OvT1|^YMjjjjEL%R2Mm~y`*;?$B!ytxxd1n6q zlx(}|)RhSP6KWBhj9lXHq`o1QbBSVhQ_@PAuUY+%4D9^J!`=s*6EX=*0!ybB+}vNo zSBO@dMA?$wRKe(?dYLA1&oL?3O-a{Pd=gr@LrYyW%?_o2cFA&`Zw;eB8k{}~lzbDV zTk6ZD@9`H*P$~T9T+M6ly**G0sa5@+9SFrZu2*eNsk-#_LPCvec2j-eG-f``&|$Rg zPngPPRxg-+On^bv4Ioj*#_Wb&e9l#Wy^deG73&rvlfOXBh^CTeVP)JtpJ%^eM_v^L zw`KafZJJeI#VswG>LO|Pj#lom4nqXT6xY;KCo|^$`>qeJLc#m%7k5u*Nc1F3&tUHT zDxNsDL=z%cPZI3XHN}3>fc>SJ5m7niG?%3L-%DAz zHUs@#n^-iGDmTJr%vd1R-KM+E5j}on!_?|?IZu774}bpmrR=?u4QQ!yW$FSUa_Jze zoVgRlUIhtR+)nQfSt*X8pN*o|=+r>xIig|qyiO7=vWoWx*^)XKon1-QW^hCyk-E&2i{tyR zZoKOH()DZOimAn=k%#v2e?LczTHBv7J%StyWm;ZZ*Pf-4!cu-X`GhCkW%b=pb4{m3 zZ}3BbjTLi+PCgysTpKUz(zGD8&U!M03IFo%mOd6ULctgV;oJ3tn@C&pvFiPF9GlJDuU6z|awt){&$fXy z-))@D^B%R-GI;cD8a8A0O|(?GELpED7QP>!5hDCP0r#A>$Z<1Ysqo< zs=dLeiMNLodmmUV$kJTav*YSB*DD$JJAE>#>gzX~FJ5fQ#+9vQwtUxt91-M|8nYmZ z+AVX5ed|>0-lAl$)X@@1G2BA`5uTrhSM(L{wqB?-4Mh4V;Drf9?7S_nR3TjJgFQ#> z=o)vA3TfNORya~J-*Jt6vtcbu8pe{$pqhy=JjX1`yCIzB+V#HEIh4@U-m)7p)Y_1Y z;oia{Veb}kEipClB0Zl8ZAUmch{D1ggr9Gy6pMZ&WOzT_$C#1T0zVxY9xq&kXQh8M zKWoiilOJ`btFnJ>MfKl+13{H(iG31dJt@Ysw{7P!9?LmPvoTGF%Eo7_J;a(w)?Ni1 zD`SuuyM0o{+J(OiOC)y&%s-_k0I0b8=TDk|-7zz5Hr1PZ%@vLjd>JaQf@;^kPz~CY zZnJ=cuCg2EKApOH52_}DDXQCZOiYFtR4Z3);8;N`?})eWVa~ z7gRopFiTIv9G8h4I*h2bKRz!hM(vy?Hbo&b;tXSZeQ=i$Yz{q4r=igRmd__;8?#;- zr+OwRj`j)vU|<%7hdgX9XMHzqw$BWJI@9}XCmlZ_9g8mf_DbyXULYrJ%xl7ksk^Ae zGZnRN@H%97{{5=09>CY>l!UQuOLUSV#r8g;t&S>bW& z!1fZ^jIswgRD|e$uM$cmPPUgogcR5F|K6g3_(L7>JEQ75Gj#gY9FfhMG(*`?sxh$J zgi3<<-$?+qW}b~=(}UVo!yw>S7gItv(?-p%PcT1CJTAgFN31=b&#oJ*ZYc}?%zIk} z?j~Rt8_aPoxh1#uN2EP<4O2%MevIJC?-^C6*jasD)WGGATR8-Hfy%!9h~!PSkX2IY z0*OR7d*UcqC9gtHTO7lH=AShWXqsB>E+t9J;&G8a_nK!?Po0$CZi;bFP| z614`Y$cZjZ8)|Vnh#pv}HaK^@X2o&9ko7PB@^a(fn1#AU%=maN9dta3TF}?@+1bQ9 zAC<1zkDX$hW|#iMM4tBLKaq;)UeCtPBPRR+q{4r6+S$c?#clvZTYT@8h~;BwOwyZj z2&Jm`#(+*5DoIPTgjKmomsjBfG|Rw_sEt5Vh-$$r0ESlD8X*Sf^sA?x%ZhIWkBz`+Lp2oPEQ}%4K z(z9@-jqSSDAoGIVw(F>%2e%| za5Jo>8ufRMcWM15LDrto0XzT;?T8@^m6fpL1*XVcso=uMr`V>FC18XICxK z!}S9#FoN6a-iQ=pbdchKn|_>p^mN}|nAe)n9p`qOFRQ1mcpNO=E-ZC=iRvW)v97|g5iy@BEzWv^}hON^8PkzN!n_k zwO)1lHE0h1jlB%NRa}}@Ecwp`Xo|Y3#AZ9RdIFrTU%C)jB*|;7n@J7D@H(FxAM^e( z^|D}UR8uXAcR^DjN-^iXut;eoVyTK))Hb#V}kk2FJK! zr;$D&T2N>67!110Rr+}}7j(q@FqN`Y@qqUV1OwMzTfD${0&b1CIK5PLi@^Yb3QIK8 z9Ftm;CVRf>mo;^zsu4`tzoLGB*Oj!^qmh@?B0*!k{y%EaP`b2kaD%wn>LyShlves#$ znB7P_(){JnGm&3pR*ckkH_!o>%{ZRM$VN?(3?GBdv}^pu1}pyX z1jC?Tp6w|t^?avaX9VQiyokVAF=(r9bJK&End@0?iJYT@14cT z*l!vZoI@u15R3@Bz5%0TEp^!`;Q964Vo~PHu>pw6DQvpo-K+U_FV9wCM%!TO?c>@* zqxu;>uzlgK?^$6?H6D!#^un2fay!yE_lo=e8G_U(b5%tw0v|aM=|ixjDqqfQ-{bmF z!$#YMzXOCde*!BT&gRb5LtwDVPi8)GhU)^(k0#qIU){HS4mJG8_ZO%lX8i04Kbc+0TSxbc8vTHF zF^RUFi^DdIP^Egw8q0KAn)<7mv5~k)3qyIgD_90Cc=s(=(kA|>=aRBC!7i+A(C#if~H-SK&qG6s8iv5b|toKrZwKs+dK3W1%X0qs>V-F z6)w!@6Vlii@v;-!6;3M{#JgsUzpe!y5o45t`Ar68Ip`3fu#BvDFy@0byt&Zxzoku1 zx+;C`cOssqy;d%6s5A#2D}x{wcUxcA>Fbl4?b9o7ut;z4flvDUuLPL%&%{qkj-DR9f#i=)kF z&8~UgXT7-bxxlgVf0wi9-1`M?3iKXgB{B)Myss0zY-o)kdU7uxATp_t?|WrOoRZF z%1cJwPzF3!oC^$->7KOJlN$3?_w6|f^WQh}V?wRzMZVg}C&pmnzT4N&&fP+x_w<#N zDA)_Fkz|ZZV&7Ye1PL5&eu8X(`TF~}@-}taw(AqI`qhbeF=u1?eL}ow_~@=X5Z&bj zK6|U-pc|UGQqI}5ZA_`r@ar9`Et|b7DztU)9pZ;;Zmoj*m7bQN;MG6xM+sA$4jQig zYd%}Ygs5WXKFr?e4ckBLLx|rNcBXK25pYwMs(Jo9jFWJ^$a($|G^`yNn>G<$FZQARCx3M=`|LoRzHN#u{1uL6>gaGZH`mdLbwVaHIgL;IYEMR&XcGzq znc_3Y@W<18o*LBQY0Pl47ciTRwY~7mio@7%vK(7mV)kT9U{h3Vj=&Gq)6K=)*w-gY zSf4Cb+>}t2MQ!yU?S?d`z^659UzTz;M!Z3H)vU<6dkw>}rH0;O#gQ${x&woXps6AN(njzvz!g z?eYPn*@w?Fdp3)JV`FDN4!b69j8=LcbXqVicb zO-c2X#C?4T&GoTKQ1aFu+$HWyTSt#Yay$Sm&`@&JCDxY&`}{xYH($*JXPz)@e0nrG zKko&gp7=gxRzdeZ@e~7D*}~GQB-Q6G`4R7KDvG-CUWNQuov1y0^d@Q5N&-1BzU2vX zs>vhc>JUH7JmmbP^nj7}I{0iv9XVAu$v6cD$pz_)p-59FG=mbDmX?+r8+-P2&)GOc zo2J-h<)|sZdF{&<)?OdeRXwwbaw|AY9X>H^jw}wj+ke^1^hf7+s>qJBUra=*waQS9 zd~e>tn8Xe>Sx^d^fC`1eQi}SWZ0!C%R?|E2xEVE8KGP8a$dcH8f$Ujcd9~(Ag)C8CYTE{Bn54>e z7xBaB0qD_d*ZzuQb;{ajZGr3qc!+pz^HMO~7r=4txwu{d{^5AS+2G*4*AUa5gHknk z>7F|{s>JsBLkfE0cG4KT6r93ZGYi0s&pQ?-)pN%wY8E53DUOjPdFRqc@pp*XNcUNe4@DI-N5=%oD zt&~XxwJ(UrK%%l##Ty*dQn3()(aMpSW!aaFc+plm6p9{sbvh^0n^<>f8u@}}f7%C} z#lIUMvJDE^DBhI}rmQQ&pS^9>ne3PBR&0JIs$B)=x9KAUyYh}`=FzD6ne zjWk`#mElgD>8~p?{YrVA31*xs+L?k=QNFpdC!t9Mp9_WT1sxi=3yrv99$xY2UU zN#8h^pVaF~ycFsZAjN~#K`f79r`cBS>2TzY2z26XTUOz{Kq1ATx4%3*j3jFEip5zx zVSE}n%+PCAWECIuuX}^;Zl!g=)m_BYkFP2{ood%DGCwxI(-*4{bRB6)U*4COo0S?p zT-Jcq9x(|MX6WQ2JDn1)qZQhK)dYy;fk#1_OL7Zjb6uS+{dF*k%)azaI7{##<4IXK zbkri;H@j`WZoa}YAnnJ_Ud2iNqr#93Q|H|P0b9qU;Q|7WV_l{q?AoQ(-0aC+mL=_n z5xF#IgntO}DcJDz_(toVfS?(|?sybe1B|lx7Fpu*4_Gh#5YU-cchVa9@f*Z_Di!4} z{`El&`MmvFFXlc#J(m-AV+$x<4L8jzQr@L56Q4MtjhA*Mx(2`MP~MyBjP8ru zW+D)zH*$%RRX4hENK#vUx?r);w#_88VUFBd>PlW0>f;e?0EMnuTR-g?MbXJ=6I`e9 zB3kbD+Dq>uCiae1(V-gzPC-df*g9@3dU7^3`cY3)hQu_mT$HZW4c8#uGBk2)injii zs0{Uhieb6CN!HoXf5gdKhA8UiUjlNDm7pB0ggQdF?^2T#&Q`XbQs~osBQKu(X8zVWPUUH`lQurpod?AT z$SreIqqYIJw~;scsOJ)pXjRoQk#s%&Dc#r`Yo9pXC=+`JqWjEfZB_b>eAQUZE2)sw3w~<+&@kK_aNSpH%*I) zv1i*|17t1I>g8!dUvJ?MSf!hT_JSX~EN$_B;y?=XcVzt3jKLR9f%og!|(LM(? zk)ImsV1!EzuOfopZB_1eaY4q{QOr};x!|;{jvDb?9X=HL#_xW+$laWRsuU_KeRnkh zu|GwKDYr=&Aw=Snj_hxudrNUXolvh|i%wKJ{I6@;)_fAqR}dJ`;Cc%N(}DXuKq^Q&!r63K^E zMi|~iPh;QPE-A3R&p#pmM?T(YiE+~I*@^RYOBKhpmmK)MCUj?qCcBazViSzugY z{K3vE=i5G5Q&h{#>^)FtwL*O5xEDqzJGgd`0jS}${BQpzU*@m}OC*e~$s#WLYuEdG zZ&06NHxx#IFocj|c4rXdc06j4UU-DU9aZ#G$plN*K_-i!m~?<>|22)ojM-QW3Q>@uEUJs%dgqvqJpKI4{)#+ zr$?)211Rxx&m0ZPK9K$WU+=?a$0TE(c_9?Ji1gi{rK6jJfcv{bKVF}BmU%;%@aacc ze0%dW$1E4pgl0cR^Uc$mLy~;^o`1FWO{Oj>!TIhv)`4?)V}BoST4VrbCidbAAR7BT zBTC{2!&^+QG3PwhwwU><&HcR^@*zAyPOMSmz^Oc|a*5^gh3hE_bq42d11#k){BJq`7%g0R;HyE>b*O~XRX5*)D@YGGUsg`qvBxIJu}6*A~s z{9J5&(m8t5@{os4Xr+n*S)WD451x-N4i;k9-(jAd&KAfX;YK^J@yaz4kii?u9r} z>60RuMDUe-+XOX`fIR4|nP#XfJ;!dGAsET}qDq&c+*~IBDd9y!sj5}R z@X4@=`A`7LMTVv+)Uv~2auLV1K_wV5W~k;FdI`mt5WK-HwAbKJ%l9G*p~@(4gTC}`=hVgFpVeOI7;g5VWqSP`Xh;yiWJ=M+&XPU7{vyM>~5T~ozU z_awuIdW=6*>h6!K^@E2t3^+!{Cm4*QcVk=DH1GiP2m3g0W*F8F*yHto@FVSirU~XHzl-bR<3dqgyVfh14mQX%@O(h#@}M{jJY6SQV#ft-QXKHX z0$cl2x1iX0r)QjEmOy9{eCGE39E zpZ@hYhkRyJHmg;WZx+)HEdugAV|+#x^EF%%Y5djQRO9X@Q=iUbPM_5&8;^LI;#uHz zGC4{==EGr3ej9z(({{YnzuGFq$G?c`Nhd7XhG-#;0P z5mQkpp0V`48L&QMWpe9I`|4FkOkq+W%`bjOSGa&%oW)EV)}XeT2Nbc&n;&4K zRz`^cbn|au-FtY9f)!Dseb^MQk-I$IDMD3*x+S6mx<8p;oVT3mkgU99iqEMw?lJLz ztfe6{U-d0DbQ6cm;r+5 z70w0XAelmW#{OWODD1dd6*ed+sG46;qDI{p1Q(QrHOOW2cLocg?HDxhS&Mtvfe}lA z)Ej!0W%yWZA2sx&cJ;OLhLJHw)BpTUoCyw_#p--X$fC50Hsf;NL(96&`}Rl6iZe61 zmyN}J;hH`=Eb{T=7~>G$K6U$lUpZ zb}M?DDQhNHxf+V1Vq92Jd4mw1&9f~>6qQL$mR~sN@g0sE<8UnNQU^Ryl5uAnQ?Ib^ zwM-ex;EY|56%q_H(plkffq>nr5>b6POKC%%aO!+HB+T`1Vc&uJ^$v}I> zC)lE5S)HkC2~#ug|GWm-F15T?{nf+d;wYJhf$lY~$KO=_Ux!^l^qOUF$?Q91fAfRw zPjBsfzIC9?>E?BHl84v|NJ<>8#lY=8Vb_H5%&=*^hMW84V3ukk0GVaTz+|4;_6673 zKP)NCF3YSNLn~UZ`IjlW&GVTFD2>nudTACA@bZY)b7^{&>dpKOqb6e$(t!{^WU6ea z&(f2sdn9IKbsa0iath`|b3)I5%)kE@&G?Nu*b1|Ew|Pwo;l-+c0p>oU0H3avIoaSj zs`Wmx8z^zEgU)e}F+u+s{0NFT@k&q#MY&0Doltt#gc?Ch+X;y0p ziFaSLD+>~xd#)bOCF)lWqk;%-kEr7vFQ(F8aB97)0Y`T$1nuFCsgVPp9O5RmN`GSm ztrP^`0xb$yA@g{Ze(T;-Yv+u3HVBDOhwDZp$Di;^gJ9q2| zL)oQXCI)5og7cEv4#9T9piPbt+IkSI=?4=AFgT5Q7+?nv<6?RSrEceIK2^7Lt}>Na}#-yp#>F*J2w^cLPPgG;p~lsHS; z^0P(aYHGpgSIIv%n7l`H&-b4VU3lK{$HN?Izhd;zozp#)@{6Tb#tol$PXr1Ml5Nk7 z@2-aSynXTQHzUyj?+$QGt)EIZJQ1FPp7gh+|G>WOIKP`dvZsTbF8}k-nti38Kf3qr+Y5?pY1iUjozx0E)XTg)5_qtu^SWul>l;6Xbp_<6Y}rxp z*SKHHkUE#u1G4|;gmLmub??x3E+yQjoxMCV@;d*8Ui@MHG~@dn<3FAJ z!rAr#`ps8AKD&Z@=kC zIRD8ms9TsLN9!Ms|DT6yZ0EVYN2pT|r)u|`S${>1a5~^T6aV#q$@edJuU>1bgd~Q; z{#xt3eb+DPz)A44sQ>HSGDF~f^4cN|p5j$4&|g~n_wO=!AKQSaF#5ibyK^9SN8D%6 zm*0Fh6&UanulmnLbouQU9FO1jZ{1_&@^tP0%8=K9%^;hL#~vp=`LwGb>_f<@3m3RM zk`^xS%Xn~g?W%kXIRz@M{7BoMaA<5dZ%g!x=8qkR$=&_cL+wA^l?{#j8~RfiPSCsZ z)%=IkOUi|8jd_^y-VtXmE7@ruc|IL-h0~Hf_8dg@7AxlXKnId=GR1^!mi;$w!MsKOZ|&s z_rLXD=Cc0Sek|^rZ%>8q-BzA*C6}5PfsEVolk?AZ$3hlPsa$8oQ@_4EcBy{nom-H+ z&^y~pDzcCN8fHD;06m_6obu1!yP<#BCPr+xd1d<0Z~5JVnMq^e4|`2M0aKE1HF^rt zl~G6U#awnGFkm?kBhtQpEt;!2^+a`a<;Kq#T*XW0Bk;(j_ctFTuV49>@V(oqy<0tg zZjJjHxA771!>Qe_XUG3qL}xkw@b%XJnR$r(rtV+-^9s1B;3VSF>0fd@Ylj-_`LzEB zQ9!Q0H}N%~i?f{tX8DPLw)=#TK+y7r$uwn`LRhK-u22o_GComFT-m@$j0fn@>OkWC(kavw+H859(B}%jXLDgAKH*zBE6d%XX9&=@lE!Xa$q4 zGDxNycv8d=A>xDs$%nSJKUfVmC7CTS5Dlm=$>$!DP6+ZI=$Q`;Om^fhX)C+TSx{6` zsw=T@c0L#uU0$J9tg2}+>l_xYzyfoU>myW$d0-2-->fUQaJf8DS76uY7xg*saamgb zkK8%@m!AN89{(>fDHZ%bTS_AMfjyF~DY*YHHR*r;-+$##n4JFV6-0L0XgnTus6M(e z?6t^-M&wC+|Cz)7nm(V8L5g*5UCfhW*@1x8l$-x|d|Zq_+WC)$c`Z*4`~C~tIM4py zl$4~DX4YhQmztW`qX+K)1u4+ufAjyp@uyekyrNv^km7s}&r0Wt%W@p{TuvXKkWikK zn~;#_%%dNYEs0jniN~ap<3?THgoOM;eU`2lJz~9AL4G#5T;1+;Il@5s~>StHi)d`Qn>>zR6-&~yBT;&d{E>=nS$t#@7XgYE#8WNN}WR-`H}5q>BupccZB^R zaI7rMXT8{SUL%jrWv7SAN0my)a;o9i0SJ|VRGq8o_R8hl?%1ae%SX6|LS}AcrP~a$ z)Xhg6^J%rQgP?mQkiL^M@yST(deJlTVdSi;)BbBhp+I^*g&8dg`mA2|0e!jB zl3W-Rc0Pa}%pV{)j5B;q$j;K0^IovPiDk+LA6v2_{5<<0>GXeg^s!#mU>8@VKOE9$ zk$(uNZnc8j?GI(B$_RLQnb)h&Vh=9qCh1s(=>-9J=NWxytejV<;(g@SJ^Ii{IZ62u zp{UP_w9-heUJ1}iLQ9)+`x@(5HvWS|VK=YY=*?>+B#Hi80M8rtguP~t_kbHEU`z$P z7|>z#P;hu(TgkiKM9)%F9vwNbNUOtOt?JzTDBkN2PzS-)0p&GQBX-`7DtCnEz z3dO7y2v@~}69+~uut0HHZhQ&7*pK=p#XuHx`@nt41s4ToNEKJ+6Nr}=YCxM7ilcSf z&*cN-6oZpoPS7=40K1mWdj#ERF;_AF!{XTa7u$=5YICS{A6^XyLEgeho{;SfB=1z;0B*Tj$)}I2|AZF z_81$g@`iB=gU{3SAYmQW8|I9IDyJ-#wMB;Y?IyfgaXh{8tf-1(UATSf0*;}EW{QTz(EB6m_;AL zBDO7rEV>;0!VpnAk|A(Wfgn&CSlg|u_!>W$H020~s{AkC2wdn|}9k<0DgodotdByBKU zMZ+jG9#9Elrj7(0D%E|&@D09%$zLDu6)^N8A!F8wVc-gY>kxe5deW5v;42rEa)T|p zQkd$9i%JfV*gBQ+a^nb_yq7`&@*Gf!d@$ntwZdq^-XQqZKc!$0R%6rM?%^6>Fx`Hi zfzb*DLP!Ap1&xJB_p5-LX#J2(Ez)188N{%FS%*jKyX0jbVDl)hLgN|(|03b5I$@-c z03dSMa*#et^@F141V~z%D3FkYnJj{OdGL!)Jr`FS_J)LbiR=oi(|xK``i* zE<7$>zz`<6F;va8%H^PTA6M(g8+ZJ*wE!vB0D~X|&TYUTi@sO?oIH@fBVo?qlis2$ zz(@`92a?pyhg^b}v{>XIwqTa7C_t7Dr1ciAPVl*b$B<8I{iDc25*ZnPAl{2=4!RZu zS?&)um^mtOVD6ALB(9g!nI-!&U~xLLC?n(h0e}>}LmqyxC=v>xpx+C$@Uy5Fozo!D zt9VhAS4h+rhxE}x?@q-Ya9m!ju5+=Qt`lI!R)-NjvXM+k(i&|a2MbvqWr?a4ww6Ha z;$7T47LwhIt^e+n$P9pBq8mOitpD=zo2EJ?lO)2aYkk0Wd-&v5{dcO|*gGLaCil zuz{|%c>Q2xgg6Xtz~~U1%~B`L00{bSmh}}|0FuYgNmgr6hA@!=_~Ie~&>BXYuLEu; z3zs@(uz>YKmj2Kh@(?jC(3L!7DKS_@xk;W3>11`?NZD0h7dDx7G%^{ITPH7Rl)MtP z9jnCFPD~n(bAs5zH8LtXkS%LKkXQ1k34l{kECjKAZ$l&_;!WgiBmfRw(NU`moE?Hl zCqppo<09~8R-1t9fMCP1bpyaHfyfP6ej9KhG3@gZsK{S*v{Z;_xlWoJvig?WW#Qt8 zECCu1$2FM-vZ@fzy9Hu;BYw~Uq&!#U3b-l-FML2@$`lJK2K8{$V6|CCkP=b1V=1C| zn0Vpc^6)C?k};;%Jz1||R*=ppi#}kLO7IIB)G`ppl0k@v$`lH4tQvGYfl5A^G)R+M zdMLJR+;H%vmE@*~%MBRfu;-L!#(Pni165=tKom@*fhMUKjw?b-QYHuGEHs$OJG3Y3 zT+nq)0-zw!=t9#6H5)a^0SL_ADx@Wy%hXP=aCSBu@iLc49%axp@;VBjqyy>z4HX7- zMxtJ03u5ZosS)@V4va>Fmq3(W{}`bRma6%#@z z5;Iaz?jom>AvFCEB&jSA$w=Jo*b&9qKjZI~y}?8A}Z*<@b5$6AU9h zxWe`935x^*3KV#)hQJi0@*PGV9bs!kGgi`!1+S^hb7aX(Uc-xu=}Q#7ief~zk@<|4 zo=U`9WQ&B>kz^lgNo{f(rxcO}ifk#U*;*btiF2i)*OXSXy<9`$e9{kWg(3{~X+%o$ z00BlWiU@EXWel0zmtFM;4=q>yllkkiN^lapXC(LnEG37eRIo%i2@s8U$tsz22ZpB1 zL5Bv77_OYm1EQ|Ms|abQUbkAeORUKtAYw>v1xf*}tC;6eHDQ`0G*+9~^B|u<>x;2# z%52K2_DU#I7-@*?r-G3ZCX!N81Oy0Ma@SRY0*ThFj^29Xi?8g#q35gPD5Ta zwGoqJF+2dcfJ;rX(|oe`td8UW6ix8R%?EfOx?g5R;-nDD0O=(2Nf~;g>8UkEg1Vd$ z8^QXj>;KLU>UL<}rJO8R}<`?n?F`NN;LESF=Yy z8vXQ1WDn3jd&2hVQ#j=5DM9fG&P0hRZD601zSc+B-DP8^G2Ts6~rZ z0${nS`Yc1Nsph4|86>4LGcY4+DlR1vDblRZF1E|b(kwr;3L{qnOV38$2a7Pe6*%L7sUmi1w_$f0Ejihv(nl82gu?#5j4KiRH00Yxe)wQ^V z#h`#!B$WZUxB@to4`J}rq_;NpSmzA!i>D3tkN6@i1R2V~G` z)^w1pm@`2`>cSiY*PBvNCIaetS`8!Y)EE|Pf>emWv<8)o!3B~oqQagKl{4HNFd&ml zy`--hs;CKN5rLu@w}qfO5BLS7dN_cs+HOm-%I3d%GRo`Y4kcAVnSQa>GW}pzQPWRe z3Qi!=Dw4fp3DgA8bdmEq8oBoq(>&~b3p4d3R>hJ&hC*RZE<9Y%k<5}zz4pf8B$Dxh zjo|!c%bc3!ea(_ASSdW^EQ}vYTQM%AYm7ExLah*rXFr%I8DMvE>g0|fACROGiO6K= zKz^bil`M7SZjwL{4hH-fG?Z8EiJOGn1+2}!f)@_ME`>7CF~fyIF(mItf(cEGPTbHm zlEW-&vJgO=c9zL4?RKHdbJDV;WXQ0WK4)B zE9x}H2lZu}5r)HY-t6m`2U9Y!s#>i{%h1k`g-z zbOAHLM^S(}0RJfFG0TcaI0@*pG&F!ZC zEm=g-m$Djq6Ey{SmsiJpZ0VEC8X)3;^@-R~Gnw?+D*!XIr6MU(Eb2mpG0X%{Ge`GO z!@oS~Rv-*kw^(CV%_=hnJlU`i-zEXZ6Ks7iSk?iw^;qJ$gdOvL{4^#VVk9DA>AD)W zS55ATAnH7zB%nz-EG_y;izCQZ51>7e?c2=NONEAXuR~hFx3xFky`Z&w8OY%8;DOX%lG{~Np zpU3I5OX0WP%$3`n1w~~}4oZ|{7dnStlBo zBFsKTC0sUFoL%Cy=axCLOMvN1ii=9~q4_)jTWBxrQv$8z<8~hl*qVj#lFJ{2n}13R zvKlS5V~0%ZHaa`G6X35~6KEufVyr4={6i*#ols=95}Q z0Hs8S#VC4Qc|ktD!uGP^zg*l2hW)@K%o6x%hHjQP<*McO(tIb1q#JDrZw#7Tlq{*mmc0vB3s)o5Hb3@s=s>fb+q$Z&8T0yIwtxAjw-M+i!pR0xCs zP>wACde9gTiwB@l%Ei%V29(R>^cCz`pCMyo_izp?*Ey4OnDK$FhLKE&2D;f=4qpdp zbcg1-k+nNNLZ}YAh)s;S3&i^;0kn{-Y9xny5cmw{`iM0oR%7LAF~_Qs$GRjF2%{!S z2S)h?H+@fG7}0evMMStb2MN*2zpQBEf^}!&#$deA17$11K1?O_HW(eGQ&z59H?A{Q zQa~E9qR(V9NsFzH3X+>*1n_#=C@JD2 zAW&q;lKj5*QfJ8!uI#-=fO`r4}MrI1RRH7aFGIWun`mq=IAli2f&`^-S`Dc zW)dPf3+)bW>{!(cC)$xv7e)p!CTX(kvkK$NWH3k2AR`uk z+Zr8kndilrRB4=~+Wt~$m>sScyaLI)mZEpkQmcqdf#CW{(Kb1_n9lMUaftvxxO_^m zl1gy0*vCp6;86&wnU1E^hByPfF%VB3p;+m@bU`_>hUVq*B0d^1F9t(9N`w;yw>VM= z;3{#5$Yr`R!&C=dfR)3sCY8Wdjb^nJAB~i{IKFXETP11XJ4irMS}S3&9I%2_!)1i= z{p#Wp+Y!#z)J)XWbkO-Kj|W)-_XjY1&J#H;sYQv}On@naItYW~vb%1Om(4ikMRaeSs{t1aspXJ?0O;Id z`c?XZx)tG=QL?!>HcO+_Aw?GkGh$fO%6_Ew=P0c%qRk=YN2zC$N8r6=JmNu2jikyh zM#I8+8bUh&ykKlJTR8(yPaxEvjMs2iF%gqmFT1Y!2%){*dwv zi0zQUd0pfPnh;xZ71bvqg{0I9U@wFaA_-k|Ft%IvJvPFA|aS7-Z^k@?e6dA~GCAt6OD>ToLqRJ!xpH z%o^eAX+(rkg<7AAX@c@XhER_SGQ^&9C;-S755Fc}sK?bqJ+n#)m{`m~@ufg;`ZE}G zsaV25;htP_@QIfEbXOHwz7xqJt;8bam@8b?p^^gYgK>(>?HXg5Efpv#gr3M_l-Sh7 z1-xM*kV18Sr4&8y^fiiY)T6H0J@~0H12>O2Yp!4h)BYg3r8y^a z1ITh&qacmDp$5THY9^7+)XC%|yFrmvP`*2wejcx{G#Cm~t50pnqt61?g~qZZ-|-WJ zJT!4Qnns2!0|Cf&C)T9k1Az?e&6pa#>NQrHAWFnyh(JA};|O;U%202|B~!IGn$tBig%T`M`w~F3 z3f&LIDysbn#dT7QJVI)fq?a%wLoFKwG0ZR0AZ-e12+}G@raWs`ZJgn+aSU5EJ~#vf z9Y!zKW`xl}eGSRGllVzH_=+V-T(qhN&?^ihAX^iWk@uWem6dj4hd4E)gehPJv)XJk9^cO z4##s|I4CjojmHHv>OM*_(yir<_`w&Y35nwjyrl7+V~bUrBsQ_}cq!wDBS&i~^631! zD=Ims_XTPi62g;fN7PY79FxxkP5fP0=77JklO{DFN<(sdA_En3Am~;EEM=sDN3z?4 zdQ&DPSQV+q*uGwMXh*_UZMkSo5p0IO#bKck&Oa_vJS8Ij7_B!6K&GZl1XZ=}>m8;1 zVyZ9X-Dt%rDTrv>NWzYgFf(FstOOf2I7%-Rv;F*bHXTOl+{zt@W(tjE4Wq9f_okeI zARkXQy+#qordS4=7(!#l2Jj5!BA-8~;hx5b0WupRpSV6YuRlz>xePcY{h?T2ie6exHm)IU%R1{c>lN!MGtqMoNZ^rIMsDwKf z;0-$_$DnS-U{XBISd*cV5G3xGMaTwtFpwOsAo40nu_2q>!U5Vm@#tJ+2YEQiM>ue< zaJ^J6Mko(JQ?`x8tI@ICNCuKLk<@}p1vMVu?Ne4r(lJ2h=?8|wA|fll7&V*j5feV%rMW;g@T5l%)sM^?v1YD z#2f-jc~)N;Cn+i#JNVu>pr{#?q-HHG{6tOkE0=_=>uPu!8)nC`M6efqDUB9iPZFka zKT@2eqD8XcM|dDIb`(eOA`oM-A zMv;gK@RVU;lgLKRG`SxNswzQqR zGApUba8|^ZHsGjT`DdvEU>CbFkwBGJASKkRat5TO9r?s#JW&L^>d0A(P&~21ywo;{ z1C>bzr_qc91b_lo96FrKBy2H8&-_3=?U$a#B=FxVf7pkPt{&Y(5|!4Elc-d!iibq4 zqMN1E29sLGOLmneniq7{0Vrx*n&ic0dB#goJyA+-&{8?dK~nUH(p4grT*3G(uylN( z;c8=-ywRAvh!>Vs1vj{?OpwnJ2DC=DX^N}iOABBG3~Pay#1V`AavxkGQFxk28jeUQ z@zhPKk~kb}6+2N9jL}>ewd9uT_uR0q^l759$~`Z z7BpH-&0!+GqKbkrjv^;WS+;tp3JS0ahAIq?kTPTG@DIo??Vp?Na5Pdr7^{3qzO#|y z-dM#Q_QHIrJi(UB0y0KpQB+pwR84yPo)MFp5~&y|t0PINqP99Gh)^!F)pjTwsU}I&GSdoRjq%eC&-V94Ls3;{Wq>8ec z2#YrEs+lDM;J8Qvq(EZpi-_RJK^Hus+8-oyjX6GY%mutpL`Ne?w7!kxr(@$BRlOMs zOH(ZABZ*6s(1^!Fpo)=Ukf^|h$N(w!PsAFFGUKD|qwdibJZpfW)L703bu*Kw)v4+l zQ7>}eB%YKe5}nlQaARiz8=cZ{rJT~!gffuqFFAZq&h(;dvF;2`pqC@yK7Sz;DcHRN z9@|6)P(M=ykl|A|av+YLe8x5?*TeYw?=}PgEf2F*Y!J8NX zBXYHx@`=?-5uMmZ<2fVw1`M)c$q3iAk$@ocNi@1ZRTGr1$dqmpt0AL4)M3Txj0>V@ zC=n3qby<8t@I$zosT#vNit@Y8GxaZGp%SN0W!U2xnlfB+LX^2AHAVQ>p-`Mi5rTuJ zm{bIrntqjh)kcLxlr61|RmoFc2HBa-FB4lz2X@Bw;V9t~$?TevdL`v-j67^?GLhs> z;s&b0U4)(1RFLvQ*;OvAvFkGEq{oy#miLeu!Eh>!gS-?flBXMerS7aezoHF4MVlHa zb0U{WaRVFK?8;Ce{GypoDj}(255nEpX9grGr~*QTtvd3M6pQz13Uv(5M{~iLks--O znXmcaP+LmkaD}3EK_SG`Zqgv0o-9{m9y5iW#Yu7zna+c9*+?Pbshy*FzlZ$sF&!jfLV-aE)IxYlTkIne*EC{x)3wPLlDoa@(E0!knm?K3RJhEB?&j<#~x+7cCDzIbMV z8lbY_LKl{#m_`WiZu5t$aO%%xUb}T%W#R1w`PBr3sb5<^0wm|66No19z51`88 z+_K$qo?O@}BE86N%ErcqerzgOr9|xU=ma@Jt%6Mi1U_hVxe5eSY&^n32b?rr!dG)- zmjpWG1jR9WGC6>qC8;saOkS(go#|Kg8>JA@6K0jZRX(9VDSyHr$|n*Sm%ou;%10@u zUj8n

RSFkz7W8qryKBfqg)YyDIQPOQ>FGiwJH_0m02ai%}#Jqe&#HNhE4WBx>j& zYUv>;Np4ZkxpSd@VhiNIpj8;`aVA(Erx%KMxp^A?;2-BKt(` zJ8}}vdG`q7DgS?dhhP^xuf)R@+vV;Q+glmE6^H{^lSvl5!79y`nv#^#Gp$Ejk}auc za;hygIVq`UlC4KtN}{c2&tx!Tb=p8`sHVbIDaJHagGErwR+S!pjKG|f9GGf^J zE7uF7n`G@+RncTj40G}HRhdr|sxf!a7vb@#K>9SvshU#sJRV{eNhI+=$4o}Wz*34p zFQQdVBw57R>rPEH2sQphdsY6J!_Y)~P~%Uu2UG1L+k+Z^qCMBe6V&zRDC)X+lDhsJ zO4*ld-|f)yKd&nh|i;Hs-95C1|O= zM(2AyTd3?timTFxSn?2kZEAX6t6aLM%mu63O^eFlV(a7b)#2niN0y!~9UIp4=2fz~ z$;cT+4YPV!+{%c`3ArT(2a}D%nK%`{~6o{&LbZw&x%F)!&>SvUs$?1UDKx~ zM4>yXCQ)oLl2-{Mz($xcL_y-=78W)m=t`Z_pT-_vXv~ov2>$Tk#d7F zV63<2^U3W+=*K4)8 z8-qDvu2&}fEk(20HDL6V%5*N?iYaV~nw(EE&5b zB39xICVGIOirZ-gvZ;)Mi`q{{*cCCkKz8NKS{pQaQu^ekr8y~0(|{`&wXUa-F;U3} z_K*u&$o@H{&bUVBw695>u8|Z3oRQoKh{t!}&1@X9v`LMZL_Ctx#%$-_ky3-^Jw}L2 zUrebX1QbLfyJo~tw(6{X+`yI)4}X~&rxf6nnTb%{ur6KsPfausaywmDI)x1fEKu|9^?CPBp$z8k>+>Cy$7>&!Nb8PP2-E6uOS z?U`nhwFm{EYSLy=7Ga{Xu}SDKLEMG+xdl(-(5#6~g0m(@z-z1^7E92+z_w)Ok7nbT zf%(YsE?Ujv_oz-Urb)n<8HMmNr9DbCwHOZpWf^$zRj3Wus`tZ?S{b?+ z29FO@{;V|XlvdEDiIO#2OvSQgZ~_`vKKQqLcS$cwlbPu0AX!!u%mhKY247U{aLU}z z@D?IjR$h_A0vAF~SN&g0PFHWCq#`wPJ(w+GUbeD^8#|cS8}rP`8$Bp*Ju&3;F$DVsy5ljO6K0Bz$^6rQ5KOVihu!}8 z5^?}J$Mj8KdTP3#Y94aEhoRmN27J(OOG%B3Gmv8y{yYMiB*v`aU3MF*Tc{S4tE|Z3 z<)Y{!%&mCcQs}miy>DqNZv}bp3WbaVvJ0IRdG@|09Z`+=nako*ld&b`P&KmQF*TW^ zXRl+%rvhtdnfOY>A3Y0;TaAXw#r%9QksIYIvfb79sRu-3JrGJ}H79w{Tj4N<`psRgmh#crHZP_RfcgGMB1 z=TsOHpP4yeDnf(cu1!q_`?8f0{^GiEiS?d{KVcJ@%N*Sx%i%HjAodJozoE|{4;@o2 zlx|qq%ds)x>NV#iGO=x}=X&+RcVodjl(0ayF+z=aJULBm$}vbj(j%Cp66iSm&Nd6P zSL971Xh-relqQ#{zggvP)~Ihb`I~JxcN>EhStv;^lq46jstQpH9!X$i4aRXPX08Vs zl4)2@!c2mbC_zb5zFOt4R_Uuv`D&BD+Tg3y3=q`X!=#i-8m_?ucO|8$tpehf(J&4b z2+C!LAVbXm9R98`Hk2T4}!CiVo z6V1303T-&)?Ee~=Ay5<4iwZES$Dqs7Nos~3gG5901dNLu#l#wx=L+p}P0(LQwgxLR zit-?8G*gspA|y#ou7IztROP7P^>Z*e>6!p^g>33#SD!SHL;Ua~_5`fJ+l=wF0X1y) zUA5+#Xh}go$0!LnGRj7xyyJ=ACC?F+XKc4AQ>0!y?UYg`?YvX<3mH{Hg)j(iyOB46 z$g+`8)S#Bp26bobwlWa-RJLeh4|21nNXS}P6u#7&8nQ2Bvs1u~Dij#1B$01L!)tOy zuofkSK=#Y36uefqgNY&!HfR=5Z1xI!X_C!e=+vR^M3YC&YC!P{_$LYGC22Ui5Y?8d zQX12!46UjW(m)d!Yuxy;4i`8ahevP^Xr*#?`QtcRGD)Twafq z1=(l|2z6I$re*T zGQEgMfja>6j~)t1&w2DI?8h!UV$HLgi^Gs z>-c1;!OU~jZ%kVCYUMtuKxej;{z~+5G#+-bMp5O0MwR1qWqbL2xU~#TQj8=gY4(tk zju?#sprz6HKv%)yr8*z_M07rY2W&|(2|WSyAGo?U6=q}z?e*vaNOph#ZnuP^jXAN_ z_^cXQ*Fva)FTCu9H?sFuuDiAosrz^~n%w>9Ry1P(bf&!(tkB!;q-E%m75YSeC`S)5 z0!Ra70;)+gfzoU#7x*~XpgQA%4sQ4E=O0QiIHJ3PIYMHJ(ix3nz#rNfAw^DNQEDZqgtam{ICxR_TSAqyKRpj$C9@ zO4evgA{3e5Wrjz0*6;C%JoLm%4l|L2tywa{sg$fFj(R*R9J|-n3+pyu#QF`&6#I?Q zG-`-PQz4=|K6O8upaLVFruPvvRH#6#LhZG1|Btw&>@9d%0(jxUorY%7x$4EOPe2NvC#YRe=!^P(v$p}c}}e8m#>am^DAs}fZugCm0~ zf3D>9s+RgQAD`=w_3X#G{c3A>aE#oAEMJ15No352|rRqB-uOCR;^K9C}TTq_?dlFCTQ2tF$yo5(htkWLAD zbd<0Jq$&#@C>rnz<4D$dCj>21JV^MqzFsNwL|X_)5yN2)G;(`pu6&VPi@H$$Ta7%V z>SrHvo_k)m&T|g>_k;S@HsE&Wug~Ql`Y&O)_Wb#Z`T1o-q<$GD!_f2doGx$vopsZG!2qbUb?%4MH;ep`v&q+xhFOV3tUV zX6_rG-6YpJ?(7&2obDYsE6Z{kW0p}qlTl!E^p=+^0NpC7w`ar!;L}b}j&8#NSpf~> z>ll;kRknf-GJ=~pR4BPIGzq@IYR>N=!9a^Zm<)-&onQA+u)kPepxyF*Zr+{<}2B6KC)T}$x zUEcZY1xXZ{iKc^xvSR{J|3uaa|I(t~%X__(|N2G#>p$hcu74#)F8Nn5a`}=|@%fHt zSxQ1$u4acecVp&aof-((=M2+K6oDq~4@08OREG!_p=&Qw z6RU4wR_NB&^w;lb8HSgbiaSG~e21NPB`-Yp9@{aHeyRaSWpmf2oJ{P6g*&-ek$5BCkrbb=55GOUoIaW!R_M zG!2IWoo6NpC{o@Udp`Wb#fs&KrHP#~$gM!2+nA*%6A{@Sp#@NA(Hi9vQ$4u5wFSZ* zr5a}tT+E~JU1sPzYUnItBgU-pr#=Gi8S-kh?C3I?et^&t!nU;Q#C0`E(r)IcSI?oG zqBahBwwb+p@^)KUL%&+F8EtzW937mfFiK**$_6Y-?uaI{#T~b0F_FBhuFU=p=%^uR zX%&$p^~+{fee+GKh9KG_ho?{ zW2hB-SD<{GBXJb1%TIof3U|lYJ|t6Sk$;)Xm@83%wd1Qj1eR-vwM~Xtu#d7K7LCj0 zbJDQ7Qc%|xEXJZlSxjdb>7p1A+EztbnbucL67|$5T)HHn7MYS5=vL5U!4=b-3yn>q zG_5M59Fu=4o zeY}YBhWBK^m?AJs_%f%hXJJYe2Q~9g2iTZB0@XD53(3p zGpV(=VF)>#2eJ=WlcHljqk`e%4Hs<{#S>X#9^y^-fG&B=bW-?9Iwa>f@ZpAKM~U`8ap($F_)7KB7f9JU*2Z z$||R5*M}x&2+)U0`L-I|J)pm%`3koRED_z)5LI63yBB;ORaVInPCWmee0QGV8i$Vu z;gW{1J_7o^xTIbXHlx`C&`EAGkEA$pt$8rXiGJfLIpB)DP@;ucJ7IW%(d_~qBSUsU zj1YkDb%X)+KBcHpCf0#^539_)hX;9&PJH@3KB)JJ)vN(Oj4sVe-VCyM;4r zSEjdDPIs?Nzpk8)sSm)>%zJoHb2I0uHk?dN!qECa4`z1i+xi1O;2@R45D&*=I8$6D zP-iZ}h$a4!5SJtOS?_1D`+T*$jNCWqq@(H3eh*?)&ifVOV`mmkX%r?9(6d$H#;Dl+ z(Z*!8ui%KME&U-A+!qGDqLzIn_vZYl+5i5ay&4W7Yt@z^O5@f^uX)rwTMfj*?^;l; zllwuLDXGYrO-Z78xf(tu{?piv|COXq9{uaS_+L9;*LR*<@xPv9{I3^ZZT~0!*B|j` z$N!Sa_o9Dw*j#gZ8FcU9;5hlf2w(*KgW`Wh^Z7LK;(uWz#_0ZNU+i%AdqeUc5B!8w38%u}5xqy%Fc;TTH#oJV=fRWe(=>%5#NOG$M#j;5E3t37^& zZSad=2T#)Tg@law=Rcp+Cokhy*6p3W?zN7aol^`<->noZ=Of*79O1!9w-q#kKYbIF z=|Z7iqe!?a3$JZM)7DTMfBL3SD24|YuLi?6t-no2&wmz!Vsp@J zG;f4?l zKeSGQ+`(sh_UYi$+fRp|zWKEE>EAw`e0uz8_tW!FZ$ACu)4NZ9TGJU{7DLB6X!Nl2 zL$~5AXK$7ZP9Mb$E;r7=!+=0hw&tR);`GS!7=$Xj$pZm>^Nr^tSHM4IJMwR<;%Ow) zQGB^%<9TKXzz1scXiRD!vQ~Rq&swtT!%J_+)dE}XlOIBR8Ro9{lk;Olw6)IlKG4V7 zivs&Bitg3=N@3+u!QHMdDqP4FqTG;$i%P|+Ozu!r7o%wxa!=m)MOg*Pq_68C%aHeX zP>Y_fG1$YpXXIAZJ4KYnp2@*6z?vYaNz}&EJ?7{}opBo_k`Nk^dKoE21p23tC)j9NB!K6p4kZyv@SuJwO zyvc)K%-0D@teMw}rpskiVOPrYO6}!h0s{D;8mI!5HGRpeXBDaB&t1-||3f^cw3y7M z;iR;?lD@dWeMH3+MK)SORFiioPtJZf$%C$)sBbngK7?Sku(+IpXf|YV(b`*j$EPO; z$FI&`cUymH7SIwq!veWTuX%jhKIkMXm^ir zNJy`u@z^ubs^=PL0czxq?Hg+;Qa_|CoKz{+LSDB9rK;}Igsj)j*+{$O-Qq|CC@8Ipj`lnP2M zFsM+)_g2(copc&s=Mb82rsm+6Gxb={MU@}U+@2qaQR5-NZGWpA11K65qSbQ+*fRmK$-X=i`gRTV zEJ1;rxqmE{wH~Y+Su^C8#;!J)xEszFC1rHV>D=Jpu}EghktM}sH#uYm5Cx!z81dp+ zOwjabA~}$)E*6n+i&$<#r#O795|OLR7E_eCqg8f-5s~WIa=;1gQt+sZmz-kATCH;U zm|KpoXEits6_`^B__9@s4x>4x?%clJQQvZgaO0M{am#5kq_V{Dt-|!26;Uo9PQJ$Y zLt>z^hq1DVH}q9!`Z96$T5SxRSHt{aY-ecEY0WYy)p3b8vTnR?pC7*5h8gBXhPx?9 z0ZPbPm~e}kLGZe})XR;%G*ayh>>4PV^kZ(Qe}wiqwW+1HPxw*n(;2vIQaNGnJ*K(9 zQ-#JYa}F}9WgjV8`zA)(WP`6==i&}XxtsV@CWpT^l1#O=MZx5XtME~%Z9!%nt z;+O!J8RC4ZtX-xTjN4(3K`F6KF|Q@V>eSmL?I}XvAj>02A@>uEUqOk(fl^)DT>S8@ zZ?G#{n%Xq2}9+{rsG8BP$$jq=Uoq|<(kX@j0trrw`H&usT+}t z2q}q%p-fCUX{Uz&38%kCX@#MEyRZ7UCt!jv_W7F~)l~Nn>i@G;F>XT_czCerooasZ z1^4hKhMkpNgj5&lPLFCz_sd_@bpUa_-X_rmQ+pDorD|1m%67b&gp0wI)jHNgeG?rO zRc)*#Y3GyKom^zfctC9AY@Y@O9Zac~oh;m)|t45k(%GV+MyWL_3m*lf_Lqp8{0hwp(sU#*(Bv_Rr|N zZJ@HB508B1z88vrR2Dc@iz+8dFH%GHIu=JCwK!EJ6UQn2kS)p8M>QIq@%jflRudwswcIKc=d^YEt%&rJQiu39%&(u3K2M3tpq8L_VO3zuMvZPV+c%C98FdW>L{EXjQcYkbV1ppjD_0pMLoOyDqM;zE z_EzjC(CjBAwLs2$4ZS>|9M2(NCVUQ4^Ep6J{sU^!rtjhzf&f84zQ1sD88{HkwSof# zdq720PHHxUXL?4Y`(C~d&(CtyB2AQdH_MUw!aZz~Y|ehwD0Gt+p=fo6G6bhEOPhUG<~}od?TFV8+4b{zG))MD?D2AJ!>W>dEOp0nS%j3=@UrdGn_d=lX1R5 zg>pnj{Ji3N7d%Y>kQ}Z`pOyAZ8H9~$ZS2nH7c!&bH4A$BAw8to-=}lHM0zXa_)R=!7L+OfXZjocPb|fog%kWX|vzD-cv``BqFtk3K&u z**(MMY3<%LE2tZS(=_}$7+8sdX%8?Q6}V+-FmQlzmnk+Ua~RoAtbQR(Gx08V^f(xf zF7bZD{CBLvVT+zs=4@@c9@MF3m^DwU;yGC_C7qw4uEUXy$FOd28%9MI@a9y{@j}8T zi368D0NBoH87F*;8>JRSGPhHq$L0Q~ckrs+wA`DrDOoTfdXVDLn~&Qu#TcgJH=Mdv zKhrHa8gr)V%;_0V9s10y%1=nVy39L4*R1^UQW#E{erY~~Vp$h3o|OHva+t2~_=P!! z{$=(+z3rETGqYck57n8Hbi(Dbc}HPYmaf=@Yp2F*%;9D9g%1`p;=aQASZqt?6LM)9 zD(^|XMNl|AbK6D0bTp4~-4GcmJ91y>8b9b3G;tl_&2EF1 z(cCN5)fJaX8s%j~XEOU0M8kV>kkDoB>MZeCa_Ob!vD8dzt#L7>wsJI4l;ghnW2@Ki zo;MoJZWm7Q^!WOq)jmIK>f2clkoF*Qol*g5HZaF`)@gUgN}0zu`)yqq28e?$b8Etr zO7Wd24yF<}jS{1>G2`8{KJ|Z}{kCkH^n8 z8&EDM@x&gXH3qrVRb!CHe5Z_$WmT&@H&&)@<9g!xdNev` z%~j4GPm}9CP9EbBvflk;7+owcJ@1cU;=Mrs3-8sX|021-m^J>(*&rE4srQz{EcoxZ zzs^fKw)yWS-izyr?WkhgZQ@n`-4;b;%U4y2Q3JlGI@{aW~}9Q)C*? z#z^614Ngc`$q;4G7(*gx*(RQnJ}07qy1pgH2S4@>j@q5hX#qIawnk%VjA187K#w3K zu~`vb0@1x#7+l8Jk;$15Ys}8W=_Ol!APfxRcoC`KnbFWnxS>@Bl#&!D9&;bi$;*xJ zpG|x9;A~eXuZ|0tHY1zvO2=<)&~1Vm7hV17oC^~;v*X!NCC%mrsw%IPszotnjYlNL zql1PqqTKdYQ0}1-3`VVvf&9u8ag@G(yC0Z3TNI@N%1ZRtREKfIhA~}gS~Y^I4oK`o z>s3K9B{i10g4_yP*!i1;f>(wZ4-$HSC+K?pInfWLq+lZ(Bz=S+@k#It={cY8Y*iHT zm*LN|GQl9l2=rO-qEcD=^vgy;y{HA{=a@%Pe?*h*VH|LR)Xt5s5t(P-W(hmmjlfbd0k=NvxLoR@cC z#8#P#vhn8&V79p8(Ru^LkSB2(jqf}^1H1Y9hM!NQ$63rw_*yoTQFbYm2?y7ttS|bi z5?&!XoDBD&s*=pbOqL(S zid=07dvl2U@*EYb*NYt}R;pB0HjzmJgT2EO8Y**2ig&9snxFG|+=m7icpb|Jw%+#~ zmk@TYs(xTtnUMHU1{G5BRa+lOpYU@9++OU9@;WLS~1;Lc=iC93{w!H#5-V&CWmuq z%i-z!zIxryMW@k21)FmBE8njb@)iq|7LxJDI^a#zY2w1^BN}3Z27OC!8)Q3n6+FLX z>cQvNII~f9uDmp5sv4EMY(0Gmo4uVEXhL)ngS3JxhI#Mh~rH0W2 zLt=T*vN!w&B4sHTivkRHh0oT#(+CX`>hAQ?cnIH6HYm@dNra=_4b;H2V%n&f`%FI? ztL0HOm^q6vGlym|K5!1JDoGLwN)8PtQ{vL);%m%OwU~#4cSW^;NiI+;SK67TCEmcT z)vG_PT)%6nLakt;OkSRz7TzVhGCbHEZB}Jqd-e)m$r4agYH@T@H8Bwx}g|R|;kcnbFCHjCy7ucyIr}eP|zQ3k6@1z#UU9T^&VaASU2ivxJFD z_IF!@=~DrB%goA}U8MwKSxF=`kDN&gm|v?*eQ888`XIG3w&EFND>&m`Sk5#=aG4g!8fa41w zHk$2;O*;!KFf0T!jV?o70?q+Tlpy$Dz-G$Qx(G;&1l&cv^<(+&CnkbZ}TKL1{ zW?E(8R)SWW5m`apU8&Wyz2=YwqCZ>K>pdSEND?;R2aw} zk)jovR4W8*5d9rBNeZJH4s%~i7KQrUq-QPVI5+@gWh|(84^+C}S}+JQ?8$ycx;9Mw z6PFWUP<7%1Wh{o~slj(@Uk!Hg7j2gn&6{P*cZ93htOjFzqJ;=(LAl;JoCWhO+p-k( zPKlY^ug|eEG)=Y#Q*PI-Z0+^X=20IItqtV}M3L~W?y&(7?LH+0EaB<76S(ODJ*aW8 zm6>BmybNO$1ICLoy5e!i{-NBhm@O!7Q&lnP)#@|7WYZ!>b;ayycHB>)E#i$Am~b~u zdD+;($7zpr*RghRoDOtoWMwqMMi<-)b9 z(<0e3fyfv01Q9%s@myTdmEj18?f^J|0Z=G5U)EfYwS9@=e`O|Yer-Y60SJg%>(z63 z zPC0Lh*Wt3Xl3O4GzOxyV&2WvN$q@H4rKCTq6t$2o#hclNvvkN}&}L3RqQ*#_#VRTY z%MnAG7mZzww5E|j$q}i4>L}yPmCdKrR#R?QWlLd{12>g_8A;MHcWFE1?wq^+A))Sh zNjVhga-zWb--A!bE}+_UqYZkgIrdLG67EzF|8FbUt$d3mg(?h{)}b0iJK=$`#T zBuwiKodV33Zaj00;Nh;8O2t{hws@fmx)R1}xY#xtd(-M$4V8-(@t^x)@&f;yXlV^h zE>?6lZX5VVv8$|b#1iLsf%R5!MIBu$(C*r`xZg4nk7Zbfx{YC|-giT@Ao=>Ij0;UW53ly5O zE+d|*7*;@f0dLX;ecv!#&y!MaiE9~#8xItME0cVTX($QPH1 z9mcRq3*c7Aej4LW#FAndys57+5n$ANJ&{BEBwB=GXkdH-3ICKohkku)*%k1sFTSuH z0I^%fv4{8eEXv)Zyt;||1m%17veBYK5U?-NGVGC4+2rCbx%eBIXaoL^`>m71=8qLy z_Oy0SXmL_rOw4vEyB!(<>+OzrOQ89pK4fMvA)5=dPx&Jp-HAi zhGW>%4la)F!tOfvg#27&ZBYM3tEKqOV#2J(Qyl>ZfJp;l73!jfacW6d_Xf#W4``%s zdA@Vx0-*7oRH9UHWtE=FN_UvoXVq0WyhX6#mlq*S5RJ9uGN+Pt`IRFA_WQIZN^Ek( z+O1@Ixo7gb;@U4d*9pRy6{Q1l!|{+dz7jKKz$c8Sr0fvxXU$uIttfYRvjlUYEZxMK zrHxWG;443M4TWN)Wj`;YRV;Eg*km0cx5?H$qU^b+7l0Ph8f7Ibav1 zoIRt*oD_3iYpy6~1VlPkdN8x)YS_9n!=|dwhJE&Xf{}p@2gZH>DY!4O3QZ!^vcpOY zCqoJX^tu=5)Fivq0$KHr2jSoiY5IG@MS9ECD$0@=>xAc1nyz*91IYfp5f zFTVfE!`b?+-yr^pc7Kc9V)v4HYLY2z@}Mi~w;Pmy5|0sMjxb^scFG}q+ShudSQ|>b$uXRY@!|{)-S6)71!_#O zq%ayf1=$c~rSw?Yx~T}W7{CBM*h*yfi&y_>g2s+GX@xj6dNctWxTL(O)`h%4%(a#q zz*$ULKXlmwWpkYB%|pGKr`Z@JWA-5hAmuUpuZa`)n9g4*nX$n=^yPPfMK&2HlnEvgf_R-RrK`}omU(=4^3Y-_70ZJQo5u4Ws*V?M9Gqkm# z)ET2bVLRB>W>LgxiIjCMV`FD3QA6YV8>$IhdvTcM5R_GC+1Q%lSo&fNc3_Vi*SB6z z(4Ep=aG9X>z8H?eHi<`{}eh%vDl zAuH5MqtX_MvhW!LCxuf45#5FZ%W_s3s%SM_*|x#2RAqdTGL?m*2!$1u_C=&l0}IrL zn)V3o6-t=bb`*TO|B^D?;%$C;R53!fdLi+V?3-^g>aVI0k}wwEdV_e8ZM&SzEfm;a zjF}Ev(Mw7W+tUDB$7~p$25^tZGiE_rS+0r=2ZwXf*8vz}bs=}!DaNiE^2M#(ql(!j zp$=`3wPhuAf=zpVz*tu@%#-j$A)Y)ESo~85TQuH;KKY!p-NOO#96HyFj#=!;m|!?& z+`bu|QvMl>SfGWGR{Y9db`?$Na@kT_+c*4qlb?43I*Ru^iNP`9Lj#Pss?97bqJ~3z zT^FVv0JR+N1-ZS|1Y>hiVik;iAvr~BE6FO;>IknDMbhTV-ziDr(MuTj6lK(7ma}pa z!+S%@KM!jc7V>qREK{v;$Ph;J=?NqHSi;yhl(EmIupdhsVjyIQ!-r~9$Nv8f^3XHy z5{E@KA4n2Cf{Z_HyX=u?3HC@{f$_==RXmO)fEs9CUYcpc7k>;vjF4aa3+UlnMGsix zLy5uW6dz9*&8H`f=wk_EUnoOydwTIlY$GG$6#s^VA=Y7~F_fH_`07#wwCqxc556sV zMiDp9xE`SrLD@iR11EVgH_7B}v!}5>$Gav;#%yV9AAYQw^Gqa7T9I67E(AmJcsP&N zAbu=fbqhMBmgam)u&q0F3r1WjkK?MjSe+~SB-{oX`I+1f>JE2gU(2ea6!t{v>@wD+ z#(^O_Zp&0*l-Dbb1P7{*0sd&=AfD!7K&^FZD>f~yrndci$*uW+mE87!XL@ViPjCDG zLV}C_0D@~ikl^MHdt-7-rnMC$hddIQDqVYIqLn|I5q)Qa3>K8)t9%|+!BDWBUtNAq}$I!c|N!fZl& z9-du4B!$%v!>7W}nk8-ULw!RtcT3OUBZ{^$qdyZJG~>dVe}xGL1#_2!J%pl2ruzR) zlG^_enrc3Xrfg|+&qsTfz_{qY357M+QkX>#xg_RcWTX%gFUX#rBEFEO$e;yd@a+eS z9hTMG>i#X5MBy|I=HZQjP1e;)ZJSj}c;L0UCeRq$_SEP~ePg?C=>+$tL zyW6y1^v=%V*>=)(YM&psPI~&g^7BU`+}8r2idyMaeBCw`mDm*h-FO%S5KDl{1JZ6C zz3H8In`egyy#ozv=Ja8vt7mFAUh6s|r_N|)o$i~nZtqN2i~gQo&GC*)?FZCn{gBt? zlOr1djJpf`W(@nzW1yHZt9xE#4NGSbOHtJ2LIscuNGXU@Cd&lmjv_+;EWXVOxm4l9}r$xur6Qbklsn8)IvvysU zbvbYlp&xg2d}-faMXXhN$Ju}pTi$TMgQ^my2X(8|azQ zNNb;r`*6;}yBV@clp4 zO)Q{Aq64!gfQer=3bquP&`w*%fHAmW6OxiR;)_)=NGhDR&&2o+Y;`GLX^wpDM&`_kVto57zMi)Oyz=_pXzQF3p*7RLfWBV>tb`iK+gaa zesa>0$o2MO%r;?kGmg0zRJa)c7OS)(!$gJumOJr4g}K4mlV0l6xlU9fQy_UtEO<`p zj^GREL^Vi_iK+$&!egL=UEu%}zg+O;Fwu*Od|#_g$yx0lQIkn1;%#tnjC$>;b;LBDLxFe8*g4Qu}wJw0j| znMu-fk6yggHPP)LA;7yGF_6|V+hqBqIzowxuRViPSx`oo)CetHcPh5H`iZ@I%(NjF zhJ~cok@Eq+Xjb`&y{t^Jy5knr>jO9BvEnhy&(vhCJr{zQ)IrUmI?|A$8B1F>5Tt9z z=_==UW~Y+1m1dI<1=JRuSN4d8t}*tf zCCT@2thZa&r!F*p3^Bmo^bY^krdqyf%p#8u)Q#!8Ha}9i0_1XFJVvVkCVAl&hzvuJ z850_^Ba&oD)8JdFi<~ug+NRQvU}|hy?_*zX*E42_V@#Tb;p6(47~+}3laL{dE4Fh_ z))-DuteB(Z?J8OgT0G56pl}CL3xG7#!r%ejH=VOyyLn<6*a{_JX5?hP$WoJ+h1UV| ztLcK?K+3dpOjR~qnKx^n%E_dJ`3cz2vrD0waS5~;LKX3|#vzv?95U!Vx1C{(79?Xb z*oWN~CS8V_+bm~zVUb%IncC*B+3|@X+aj%G`UfkJ_au7_Vk8(9pPXCsIwVG*M4z?& zV5*F(F5w(onwD$?O8q*S{YrJUl~^@r$!rEZ*{+PM1q02)Yi;AE_d#y^rNt%4{&YEA z#ADVC)K#Cy(P-g%WqBKBX&wS@Kb>Fr8yjF3rI;151u}}Li`D9r%vlx+XV0?UAs}ly zKEJ4}lIMNV8<&nN$5(6_+_vPV*Q$#+Wxl(K@A+Rbrn=MemD)Ur)Ms;a>chB2h`BY+ zAK5eMKUTM<)s+`owp?SJoIR~R6!dZnmeqRT>WpIhfe14HTJGrLd_gme22I2@D zgX#E||@2S2I{ze}74vh;V#@K{0>v%F9@O**`l)}-Y_ zGQzBLV~9&XhAyv*iZpQ_r?v%z*-mw^gDHnNzzwdxG!Y>&WfLaM0)kCQlc6q+L=_ufML47kL;H{YD|(%RD^Ed{t1J{ zZ*6Todj{QFbp@%0|98y8695$mGiRGgd*ZDzl_$Yp5n&kA351(T@EM0V6szYF&`n84 z$ue=!P>_qgOsWC2T(cr6vL&XF6^c{lbgv_wxo7mh`*)3cf|KELyi9E}hkll}g7N`H zabs$4P}VL)nG>^3-!Dj*ouKi}H!zs1@H$TBTV#f#O>e{=hs;+g5xb^8cEZY#CI3g*QaUewBWsJhB594_D*z23U3<<6{@J0=fV z52kOu=LwZR^Sd^N-2&5ehnPKQmIg6?mNl^$>2_r@JrekETZja{uXANAA zK#H?H#5bYS6MHA7u_7aDUn z_p#+YzjcmEMl~n2afBK0j`|1XyrJ!&Cc9Qs_agbn4%40UlVj8PtCLR8Ji*~;*C`9_ z!qNErbk}>+ZaQyTnOd(~&Gw-w(`~k2KX8PE?8l6!?F?Yo`_{5Q`u()O9{FFJ|FdgM zD@5un(fd~E8UJ`&QZ@uc>6TC4lmrtXqui?~R~g9fYPCHlc?_o#IzBzu^x=S?rR_-UyU&(>Li@MbA9?~ zP?-3hQA3hKMr-z7WunkRs}oRPWBlx3;uU{!a~YFH~T2&C=|&P%;x%N1@mN0Cw@ z-r5Ki-0TM#43W2AB<`By&>CTxeDY?s9m^HKy7A&ZElijez6T@opfV=z;pG@!hViuW zkg08V&~`;XpEY~uXD4d;6EF;5DVwg^<*f?@kJMl-+qzMk&Jf?2ol*>z0G4eS zdTnT8ASEl*)<7i778zrCjL2Gf$xPN)?{(*_anNq#J(_+gFKn66R5)n0GZnhBHRQZ( zH&;P|?=8OqZ56AvWhi_o@#7yKmIBiLV=eSxo^Ym5n99Y~Bm$B8863D!VfDKE1)K?Bi>z3M(&dF$sFp1>S&qFzo7qAa zaNHlXQ|Dq@uxFJdlI4nh8Qs*fY<)4u!d(yI2-`(#ynN!1jI z9Owx(M_jQnj3<+57$cWcTB5C>6eqKi3cN4pY|>wZbfV2Vg=aD8~T568)@Pvq1B z%mdi!NW{cnHmuM)nC{U5N*7b`zAx$QR`KJx*qvtPiU9V`6p3Naa79IO_T>%IJ z-uQC#?=dG!hl*9~Kt)w~&;K|{IoM|*+qzPGT-crvcI&q58jsTWpG_t?z03w79C1IV z7gYj*{iJT1Q^~>dHXg^}{LY+*+_i0!0!2p=7dJd_vn8=gwL&-7^XM{8$x}?xN!~P% z`r+~xdItEr-fr&L4oLI@eK?`Tm}j zk&h0>#RKsG%|49O^_Ly`V$r#e(*O~I!yl2rao-@Qw{LCbuNqT+kKcY+m)~-a^PQ!x z4bneyG&CjJ)d?qM%~%{F^tnzB`|u;AU+=8sC_Y1RKJHi_cOJoQ$TT{a*E|IcJd9!= z#h>pdTED*t`@;w~x3_OUyt|Jj*awZ|70XGPVbJY+IMvoi{$NDD!r^@INHlvjM4I<9 zmpGZ_8e{rvHownhuRiqx@%of|KSJ&$M#0DjA;h6XA0sX@?ioLCI@Wu3GWdABbkKY0 z0ayu2$!uB*!U1MshNI0*GJnUhZ6vUZc#3dj7m~tsKuk=oItPZC+TmhUb{;G2jDvS_ zt0Jt&@c(I*_B?C2>MV`gg+2SFF*xz(Mk;yyR>g+)nJ(L)*fqU53=IKW@ugQ5zc9to zP{l1trhEG^?zkL-XdZh7-rEn3&?kJtAB1x2!ZGAGG&Ka`cZZeQb}hWAhz5(Ys*Q7@ z%v+CxU*Z}l~aKEcLC@4%>D9~tG>&xM;osTxZweAXu$55w+$Dt`}IsdmwU~w zQgv4_INv*SKY}GNT@%1|FHQ&)szEe34%rX8#{4X1YfB42O)C95)7x-R4cAqqbutF>rZjw^?3VKdmTrz_yspy!T3y^MM z(*=|1f=n4GLNRdrA0&k;raa(e0eDxd@@thC*nqPbMtJt(w3;qEA11V-2XQs7Mim(9 zY=Finiaq}s=jDqa+Vjw^_9vom3VLUa2_zaJZjS!!-$`)Bb1`I!ooweAeDZc7UBd3z z*Pv6pJ>8rQ_N-pR%PL)hzE`*&VoXYXfdUx8qPu)Og20`wU~p3`t0OhuTybJZyv>Mi zG1_P}49b}IY(gBP^bTVd5_86E-5$JZU{WMd#%VR>TQ1HGCoRyu7xHT7DhQ~Hg;QzC z#>$=*@|A6cF2~6Q474;Gl$?f8Z9f~7+d%gI_3A#rH`+yv4ag*d_r$1gpNA;=ll4`~ z`VfW;%)&c6esMc`uZ8*Q@5D1;>Cl zHCEy~+UvO2NL9F-1(z_EIfVkxjAI_*;-Xx9(0$_7#zIB1&f>VPlH{G+L$$2}O(4(l zI$RCtL)BX)?5UeTc|Wmsj46IkVp6Nh9VTod+%( zdL87FOL>68pe-ADe;)Ss+_Gfewzwj{F}!?2H!98bBD9wXrw%V6_X5cqmoc2so9Kk< zmXWuq(`(+&!XbAN5t?SnE=A@6FNCGLvi-5~Hk=(JY?rcO4dfb;{nNOjsps!qw(+5w z0#RmBN67#MnUWyN-s_<14+m!_t&^i&N|2k=a}$p}MgNErLw~4>fjT* zW7r!L?n!dxfwRE|4`}Fc-fi~(e13dNmxu6nIv6iuNfyV*%NOCr)>Tnk6adcV3lvGv zTtg-mXc=d10+J&%paXdCil+dSQI3rm2cK?7$qG#wmeHw2i8^eV@s2*%Ue0PSX>7C? zc)P>iYQo%5XEdy*Aq_Y^xOJy*FN`uJQI68(1o~dFY#C_pV+e8DzlKeAerY*{GY-Vd zmZ_IKy$Mrtz5e~d8El!D)->PjL0g+i_-8x{l?a&U`Ec0Bm-rdi4sEk^1mX*IOSTNO zd3Y#x+xU|1{3UQ%a$~HCS6FwEqc-q6&b&Nw4kgCAk3xV`2OMiKW$|TRv9GWYyS^q@ z=8l>2r8GD&3M(nCIn&<8vuDt;o7xyef^k48&5*H>VIGOMGfCLo7R+W8|@N z5lij{pACPR7OTvUE+e97{J;~9TcR*Pe?rB)7)PBI@3&iE@?jmBxKhaxfgylXF5z2#t^*wcMaaH@D( zU|R^qRz3n@YiKan`M&A6UD~E9XdKGNIpdcne9!m5GZ5RIgTs~$($=nB*jkv|a%=(4 z(TH9=w%yluyT}>Wx0k*6(~6XfN00ff-L|9Lw2qwFKIptdi0t{JNBs83{ALXpzY7Pq zok}liwa0V|+CD%1{@~&L@+rl#a=!Sr_VW5Mjdybz z7bAPJfVW^C89fp^y2r_KnA<61efTIttq%RrH+ZB(9lSy|$-nGTb)u2&3 zP+k6T962?mi?GD@TzE3epVQ(SRQ4W>S+0?X+xL&cGTVwi`Lg)~*cM{pU&*sRioUx~ zzKM;kWuj1e3WbMlP!~_ML0#l-Q2H?S&|S*1PPk{Q%BKun|7mE$>CT5z$Ah;p zZoV`@}du_yK5+i&rc z@pL6%z@T^jDzAOME2_HkC$7E0{yyp8EWHZ{obZ;hTZ!Eyr!~ri8QlVhh9O-p(V5HR z&Gxmqg1w9?dlqPO_c0sLhgzsPY(Mre#ZOTqx7^ZL%%`cUM{$}Y^Si*hx3Ovf>0NpL>Whj$hZGV6BN=i87I$5|>CYn^ zv}8vekY15>v%_fO23}Klelo_#G5z-IrtLg^n}H2akAmG004DQC!Ta%EfVYo>*nM;6EaiJOKd~hmq*+CtG57Y)NtW?GDO=(TkH@XF z-?zi}#89;s4?a|QebfFwHP``J!hhIUfsf{`m8apNt08|Z4_yuUV>#$b$REu=b2;6| zaZhc3L9VV6#^9$vhLLFBgL!&wBIu+6Obh0(yod-E-adVrZRkSy_;;-g%| zQ_tsu#Axb>cw9UZxvi(iZq`@-(FjHmqj5Y794qDrPe2aZvc4*lDmC$O=zIJ75htV2 z*I4~4a0j%U44xc+=O@Px7KNNB3ZAHw@fftEoOS+xRVbsM8}+PFOpu5vMdt z9sTEH%*!ZB)`}T;-KVHlY68%vyYsf{ro6bff!?cz4c_EHz~G*Xq;?V2sFk4(hiP@+ z_OVdGMHd$X9cA;8#D+oWtiD)|RPev;$3UW}d=6ESx9`K2Ue-(1WSPu*Nn72ud{7^; z!g`*Zt32g7h*Oo5zgE3Oua8^9Yg&k~g{E%7O7!_Se6KcZ^<)mrN*bo|fRZ7mI0ffd%+ERdEqN34XA&oV@(f~(=+7w!GG-RH2ry(n|RbH z@Xj%B31s7}y4?N)ryiT@Ha|j6!ewLos#@giTC!*C6xN!y2N_3K_5Kk`ObqB~kIcAw z!N$pPmkp9v8dj5##K)x6z1OBtpAKp+tXvbL_%^ara;eK(-;&1_pDs-7Q04WV1Hy)2 zvg1h72ivwjjWR-z_K#G)K<0XwTtR&^h%zCIS=?bCT2YQs6r@}b!~E0DZ7+Zb6M>g@*e<dO)Tu&_KFH`Ij|R~2qO4F+@%QT~IjX1iRi?H8 zbQp~nA=*z|$8!u!6qFEJ3CJ4VHPus@o$)l%(@awg2ewqzCPs8nesWVXT>t>sVcn@+ zlRVa0IcwI1OBNKM_kk48<|8^>u#RL*S%|!4q3JY5CwR(I0%Q`vR-AQ)_g9K*FXE{( z1mQ-|kv#38rkC$BtsderA3w`EKa_4`zAKPQ*)KCM@fA&_vWr>J zoKUQW8w#?#+D1lBkK_n=)SxJR^{PAl@12>X@#(w`{`eYe$L4WJJSQHXw|i%>%UVn( z_B!aX%FGuXhGft32gf+j6uIdlihwjDj%P6RIiSpGZJ$@F3f!D7l6j<8ISgC8Zu7>J zq{bb#n!l8!XOb>}!hg@#jxkW@cMYFn&8sj7%17Pjy7OpZ@Q4X$$Q3#jCtwPm5XR%o z!Z8#4Q3z2}jBVH`nTN)JNqPQL7czU2w{`FaZpBEUVOce@I|s+^zDJQ`;*guYLrF1@ z+$uOFlTK)a%bSE7kNT%8nXJz7al!9iu>Sm*B73=fTe0kFKsutgz0PUX;gOG7!YjCr**@8j+}U=08$*kT*KW0@ zv0ObJZkJ4_$=qLz8M1e|z|uA_Anm)I6 zJki~wib@B}sV)$#lH>ORJ6j}vr-b0trCQBhIKJyEH%RWUY}`5?YmS5L5DMorGrxrcOE z&8Dqdm)GX?S+o1b?zWx1KB5R)m^a-QB{JC0QbmsR#DQbf(5H)dig~`4Q+%rkM;)v) zO}<~bMqhW%+MUj+zecm_SXhNtI(L=%55u2i#cAU?HAt3IvQyW0jE(}APAnB?9dkG} zto71Lwzt5rF_VM>GpR7D8Q&`Vjx=3Fv%rg0%R|^(StlOe`c*1g-vZ5|9YH)DMz?;$ zgR9Hzu&Oe6W*$^jnk&n}ahx@>UX77DhF4VqRFW)dJn@y}CTW03J@%WuZIdFWey;ZxZrA`JkTn za=LErJag|m@!U0yqG2?2&RzH4eG-jXYce|`>sVn&Fr&jsf^)PkG>N4xal-fb8HYaq zoWh|=JT$9KV!z`)QXy$T*CNeR44P`YHXbQ>+Epm2U5K4wS_s*Cs+4>lX3>-(l5w(P za*-WV#9x&h5Rr>L*TrlQ&NQlO9L$tX78IxpuNO^3KRT;BFeulPD8R~eI>y}y^U+bu zFG_}3UEMdO88t)Z5#GyRCedUtyJODuf=}!WJL^?N+)6ACf!bk~P zPRS7yyx>?!&Iy0kw!|Huh*%5Y}rsM+~;QLOtF0*>8f4` z+)L$`7{VjECSEDGPuP!A78=u8IEb=xs`6$eCs(Ayt7^az=afcJN1Kfo$kq}};$T6M zW6cz0Rrm)EF?mkin;dLHuaK!TK)F#R+o{j5YA>lXKhw})W`C_Be|1l~@ClQ0Iz!P> znULxc6vDh5B!CSc!ej1Y+nw(DS;n>s6F8eFl(V1h1!%>SvUh(gB{YRLwL@Jg9i6)j zKFWcVqe`w>zYRy(I*HiT4PR=jkR6k^2lmYuu$&#K*AIu7@Z4(4 zicccye2%{8-}2{2qScpfMQNufJJ*nPAlb`<++dpg2fQO0a|~*wtj2vyk}Z?qZ~UFB8Q>OWyg7eZ1qVTMHe))Bb@}_7BFu7>!SP3lz!};9e7k>ZL0U$&gry| zPnS30zu*tLQ2TQ0#n$s@>3r~PJWRH({_Cm#w&Cxq7ccPN9rz#qTmSmYZF&!XUw--J zSN~OivAy&BtFP+xy}tAHS1j`8ZmvFG!Oz8L4k zXwxd-sR}sc@akDDyNRX?o1VH^L)#A&)}clK`vid4WAHd}e57epMc@Y*xxMlmpb0LY0YHE*H#J>*X@}^Hj=yB@j{wp&VjtUPXp8wU9*z1SyZ8GjY+B9NL)8OJRC;>arrDzaX7nv%>s4s7xQe<{NK0STh zT%!N#M*IAr)qj0{(g;*o`@?>U{BNGjf${oPQBZ|%C`(nva}1;{a-Fb1(Ls}~8l-c8 zaUd!m+Fx3oVDq=CL{MRZodWxH)JYHgvtdjyVEkV0*eEu8-k`2QV&k7E3qHIDSL>me7n}e-}lTWgwbTmuPt8F+Lg|FwX@WtDT6_AG&T9z^vS&R=SIMW4Qd3L9w(JH#( z%i;AjqppebMhU<8QrS1!|CNRZJ!`g`2i<0&_`H}8{N((&P$+!4{bF5pE>-sG1)BjZ3J~tME4i=>MVzc+b}T`0 ztC$^w148xNDwU}vWt@7A&goBQt)n-+f&~ToU`=wlQ3>kbeDk8Vv%OQ#P>hSlgY({- z&RMrmJlhId(R`VP<9Lz|uI{Qqdn7(6%7;qQLwYrsZE{&GMq!z<=Fo@_7U#`&}bA0e)w|CHZt1_HT z;%PitP6A3f!v+)NcKI%fW}G2(G>_yAOR5OGW6<`@A;pKhipH}54#)EmDmI1@ZdmB{ zvElXfta;Sx_RfB4og6lQEchL&A^mMvoJA-X@6;_y&Y1y&r`lK@MmY_dh*3VCI&TYw zZRgET81A)DciuJ6&d$zH3OoMG?oTJZgC7ge{rAVskJbs%S7B$HVZrL<&qFVvA7`2(6@W{&t-~LIOj{?? z-Fo)xQM>a1T|lD0>Y&~Auu7lW2i;zw;Foj{=#pU_JAxy$j^Ba~m>Vlp$(~i)3d3zq z_dW#Zdh`Stk^X>v$pYY}7|cvVNq=)sApT%kt5&lj_2%N4 zK}ZJE+MG!o>{6pH*GDMXAh)Ce(%{k)f!nq{Yo?-PypE zQB*$8d05=BiG4t7pumG!V3CXr{;qs47nrV*-DieGQnBelU(DKoeTqMaj3Li4H`M62O z>&eRq594U+4NiMQXr3M3V5$52;__lWn8#2muIz%~LXG7SRA#G!mI z{>nSLbWV@Y+uoT4-gOSWV_@g>wDW^^2JD<3w!ZgHfSpr}u`Zog?4>f4!@XN9^ynDdk4Lfsz?M&>KjpXcrYgyr1Hp=(GFQuBWbemB~^ z3`XHxyyNcyYBf-Nq*cUF*S~gFY;;5-EBT&P-yVa|mt%{>S?s=ng4Zc60n z^1Brv;?>nxtvg*E_#0+ldqkhP#>cn0@{Hr@ELNNZ*x_q6#;4(2nPbeOflq|`M61Ye zd7Xh`sY(dUl8;!c4tN+{W_5Rxi@))?(W|cK5IeH=43|CBq%MK$6Ae&$&i0^AmyaiL z?{xY=B6n+jAep;BK7i=#<8FA9K8Vyab)KT#N056CeWf2tUj}y{Kwu@*X39ktUt(G0 zhTrHDhEGH0N;VNI=niYIIO(Ggfw4V7lb*F(C_=DRwW7S$+Z9reeHSHe0@LceQYh%I zkUicMP4DIviVewe=5n{1$Ms!Vh>&&9T3O(+Bbk|@R7YfIDt&VYQy$$nBAmJ0O`mnp zq}oPXHm1noT9L+HxTNPM`@KACyzD-JI`Z6puqrzs?Yij)P`}dJ&tqFk9whT*xj-~I zr>-oYCBrh9%0OYln@&B4nW?!?sLRe=wsnM#3XGiAttVDzDeAhnVNx>~qb;vVu}sT0 znYS&+Dd8uF#n`7RjYqaOE*QLOGBm^|6Z8YC^K0{H96I)_8E&Dt6eJ~jr(9`TPF-CpO^zv4Y=oRRNg&%fh6 zYBW0ScC!H=b}}E%PkR3SuDpKbU+`kH%~St^7v45|rw8ZVrhmgrU$6@56TbF7wYq2L zCnt1`{EheNsEOCq{@_|CjRKzTb41jv9v{D9N-fRx)qg8E2E6@xVPY73FTZWtrW5t%~*p{KHjfz`^U$*wUN|})-fOqjh16J z_a{4>kMx&wSb$6g-6@jcO}UMZ8H_pOnE`Ln-v#hN&VSw0gGRGbalt5(0Nxt&mai4r z@Cw~6nbW#;L?=NM{HjVMvNRh4FxwX^(kOe)5R&d@k!lM)+#Tzf zidSEabZuqMfb7+Dv>x|CaIAlPNEq3GXKXcqlUCcWCfb_&nihkk%)m+Oa_`8=<|fnO zWE$PyKvOMkqfmFpByYqIY4g}IU?2L`&+IA@6Z*_UvhX|s;ZQ8 z>(uJ9-gy0E$SWVnY)m}Nf`Zq-#2e}YCkMvIJ0dHutS4gpq={d|7cu3ccv9By8;UeK z$EOE9+~-;+y~aVe*Ucd^WyPi425k*G&5)&Bs34Vlbff?vQ;(~0ikl36QCE7E4C|*- ztH9UwgQWr$trU+YxufaulW0;R!G=1?Wn@|gI_gWQ8mr4nz2zlIO?)x zpE6i{GFp8SQdNHl>M*)kUIsu$Pe7*zu31&hYYGSs2lR~f>YGmIEryKp4l(!|&6ew# zx9!$R(>uQq3_8I)&%9T$>Vp?vZ!q3wrZ>k2UG7b}9(?<))4@unAemJ=uhi9P+W*YPBkgnWUF}SkE2_D(_B1+1}?X+eh~qc1iWW z!LG3qfZSP6>yN(cR1oB@d%BZ$nCoIUZnvAU=TK*=x{j1fb6W@H2y2*$s?*+cV^vP$9Mf5jE3 zOO#mHEmcw7Kj0s9TZ2D1T|y}f#(?Moi1sqX(haH-##8(k{giVmrpa3YOT>sj z#*{5(icb?1yHclEp@xPL#oi^cLwzErjbyo?U>WmRB4V=nJNH8sAZEp_kXH^OghZNU zO7}styJ|2=;Pin1Ml`tD@?spPS5<&AL>Hd;Vu^t^Q+z#$rYQ&Ae3k&YMdLBTh@tm1 zV$(wo%(+Ma$P7`t5M)u?H&@BT9S^#ZVzlb?3Zsi97&$XdsLj7|Y{3mm0~3rA47x+% zs}nf$kbt&J6No`b!;6H%KdOnJiqEPFt35N5ET7V=kRp$5Yzp=`@J?urYmU7D7BF4J zFcC9YU?dfK<7F!9y=eyB&gFZQ13MWIc}ac-oT54SFLud_fs`^-Rhkn)Yky^AUHiZ>$Mu^?SnH| z181k5ZWFq22!KyoC$G^(t$Ex$>A{GgWq2DjzlX=5`v#8%*qnHNVjs0nY4E1gK5W9v zS54?0D%iNOlb>)Ywhvmz)!^{p_~58X^*R9Oj0#E*e|XcRSJ2`C{Ew7-h#T~6I)g{V zO|Ns-)0KZ{b(_`T;H=d}#JoQ1pt&ZX2kLYP4AeYnG8{xY_8eg7*?~ehmh*1Y^yjd7 z07s3ZE>^dv65}*I1bU9GJL+F|e(GHX;u*{nMde9UL_d?v85_c zVAN5HHRVref+@7xsg@0fr7QcV-a{NDK5VECtc+AYz|>3fzbJLzYmXLikN1 z>U7FPHBD&3NbcD*G4~Amg?=s~%0fA%FnVyLjkYegK*YE~-~8DX=G5D=m2jsCND4^B zMB#eF&sk(fCwA26&gRJsP_T$B4IR9WrW~|=5)UjT9ej{?JNCQuW(H`#99a4}ehWWg zDlPj0e!WNl-P7MJ3j=-+Ta0B}0PpY+1HUb+0_<@JvLJem>z5!SAyx<}dawAQYw@}JL#=3x? z@&$gcfBP-`a6azv*LwA02TSPUb!g30-mz~>`rI>U6oHyj+axe+IE&`t^A^;AC zi4+}TMw=lp&NhbS#5N>cDAvD_SfNhr&mZ2vNn!g{t5{|`6A-ii(mce{U)iNGZZjpgWQ4JQe++|;e+!lJ zL4(1F@dyE!nZ>%O>+rf;(8Q!MP&EUqINXj#g~UpKdXnKy?WK|?G~kL=k;dj%bn7X+ z*wt{8rCJmQJErvSjM*ttjv$QL?kD$j$66M;Df_N?kq8EHfQ8&H+7n{cq_p&m8qIY? z=f|D>Yd%tjQ8=8GlN;m#Wmx>k0+O4GU!;6ly{;5=al0`Ly{Y?W^@x*VsM#vmqX_=G zpVyn|&5oHPKqvV(_oLfc`4cnkRl`H_r_Q}4ZuB)$471E)=X1M19HdBu$jc~qQQK?e zsDIM@p}_8lY{Nr(37sn#r6;$1_x$Yp*7pbPLfxyQ!?@>Ef;0Pep|DescuWz64MjdO zn%`^%k{uvWDZ=sr)C+~@1xg2tTn#pyu@uDpbUe(IFBD!Bo=F(wJ1QY~!I-{s*(S1N z#jV`yoHyPyp}{W^fK_vmEC-}GTG30XxKsFQMa5h+X#fXD%uxzo>uiTOhs3(e^*ZxG zT^gYk8sL79U2V5R?0TFL|wjiybvQeYN$m1cboLd$2YsvdKwiI7DgMRsVq4gGrF}6 zsHO4@X=R2vOh6I1OT^qi8Zq<{$-+?>LG&B+%fW z{|vIADhfM?37#BrHWATygJ6!pbTAl37kGvl0Oh3^FFnTFmMuH#xf~WS)I8Cr$z-8S z6NaQ#@k7<~ace_GnCB%AOU6W)rz*Hs?Ktz8Ic~rQDdgp(S8B*Af=+XY`DBKA@Z~gK z+&OXSXm`ZcDD<|DFAvP+ACzk3sN4oVa@3$vORh#0LcY;Q96M*DfU+djn8yc$NDB?S*zzcQQ@7MvNK|Ls_3D}qFS5|jPeWDDIANHj5w1g z5gi6>4Rwv7^uJTV$u-_lGm7r2lX?_!$Uh0S-8<3#kc-V{!ydDTmNQ~8;%$%!Lbb2o1D#aObs$s zgp1x^aK4-_Vpf^vS#hwYiA)?;^leG%mpps?R43eW>YDKq0N4>%gpXe=EZ5o<&8uly zgH-$BdOa8-rN_??ty*=a$;7UAx+0m=CX1Dzh_6u4(JV#)SIS53<8Eu7{?EJrSxo*F z`G1~2x9)$Q)BVra|GEG9L;mdhADn!?|LKL70b2&8kG%O=OzfKB5y;321}YpJ9!k~j`6~ta zylvW$U#FcPHeKQTy;`q?>Czkbv|yKmb1mwI=8a;yrTbb4wi`iB}^qjStEd7yCDcyS%W#>1$oDa9){_*jawLvL&}B}24!@Rukd}KxvkS)^B}xNd_6;VIdV-#IVIB>ns`iU z(n6Uy(V&)J!SU~FbtOZMDWP`6*Pf*~)!7|OTaJ*5`zuyS3+4YU|L^t^?T5=mERtH> z1il1`*go2@p~^HtQsNF#2B-3?Xb@7`TlJdy63oLJp|2>dN>E(%WL9^OAgvZjGA#zv zcq7_J2m593cExk=+gtn~k#Lx2`OIom%9K)af0x$w%PVy~>6y``PuWCU7oQ zIp4Ba<=af$loRepgCL+37An}-yNWAFWvS_P$z2G(nMfV?fV;TM5y!laeQ4++)3sdj zr`M0+{FZAQn<?^b#KLlfz zlT{Gki?2uYh76Du8IiE^2sAu`m>=5ugRp_suJ6Z!g$F(qj>ZXkb=ZB$ofs!|Z0=zQ z&eCjG{UCOfF({_&votJ~40r{Jm~6S3z)v|aAITb-IBsw!mtY5E;QQ}*#9RC4o&S<> zIF2v222a|?`t#qHFTVcD&;R=TtNMS=e}BlIeg0FE&u75HJCHr%K>)8{5#7;eOlFYG zAD9A`1z$Y6O_Jeq98p;RFrK2}3aZ!nD8bk9Ab(5q)WG>Pz75j5bP-L&gfA4aemEWt zrqvt>SnY>+I!ta-wiw5Z6iWt2SHg5H!ysL=7-_gaaQp(>tyj*$bvB1@w~{}|PBw%& zX}$bIh(+%migT2c$Vo{=;H)>{@|Nlr-D2`i+lHV=#?kS?8D)zJIROq{SzKarvw-c; z>2fAsup<9r8IOlzJBJVeW&)yY-#BBSoVleuoj(zGnxJf&a=j+`U7=8{75%{Y(IvnWKG~#fc!ikMflIik7NQ6XlZG4wT;e0?ge>jVnO@xVXOSRMfecA!~ zHZ8d*DO?4`k>V=6md9qo-d5fH%~5y@tlG^=)ba) zmz7u=dfB5Vj#D$hq3f!mIb_srzER?c*1d#e% z5LvE7u7RHwos5NmG&Go)eT#z9EL>cbwu06uD5X(!Ild@Wxh$!Ba7Jlu$(<|`f&#&A zh_rUkB%zk|d5^48(5w>GOc?g5s`GA9geBP~=8Fms|coH)*8Qzcmia zI3~F_p&=P8^w=t36w`*{aLXYe;12IVr!KBD15~x1e1te46ULWD3O&k?3-(Zi=VNTR6`xr=2eRlZ-K&M{57M#4^ zoSy#})axuzV7}%HfO!Y<44{#O3YJtx>&*;nn=2lU>x3|4i(MN z>HdBiI_{7u4dk4oQrGX(s=Aym z1Igz%CrTkJ12jP)l2!~>w4D|a_xndD=Z${f?5=dfi(|mM;M~ zqj?vN)P*uq)^0RcLjXD{Q(Y{dH=5Chjb%h5`Eb8wHhMxL^EmHe8~)cOuKWJ!+3tgx zu62|OmMNLP{f@lK<5V}?Fz0XO@pBYTkjnVxfli>%)i&?C&D&fVz1?p1U$+mAx}J=! zUZYcuTD6}N6SKrbljVz#5NZp?WfYWUI}$#wx8@4pV-47}cEH|VBZ>dlY@kHXLK0n^ z-A02Y$;+jbz-B}j(;H72OO#Iw;bJ)&{d|1zWB>G^_l9mj_SC1%@df@q{GoGp$Z6PM zao|76sEpMr&*TA1SFEB?>?m3s(=q8au-+38bq>n7NUGFcRV8(!>rf2Ak3-oakx1e) zz#^OC%GySgHu}XKfT!{pnG&ooIB(6%46pRdFQtmUa?&fY&A~q@h}&|iQc7ZjZs&^B zdt}&zm;i?kZIpi5E^!|L&)hqiH@d>bMio3gv($ZQ{1Og}WeG`QMRenEYWAEmTBs9& z81RE{@@75?;cDzV4hIAN2ai&2IPLs0ru!lg=6ZbJA^|ktcxn9lfIa-JiO> z=CRV0GD(OWyIqwwt2U8EbC=Aj>zS=oQPb&^8d)Lz_!uNO_-y#gv?%@Hee@A~FbaRd zM#|+k$DPCTcC+&I8?rzScuRJ8*MV%!j7^tuAtLw)SXSo}cJxTdA!xXZ8{0)PX4_&F z<^^q1hhjyo*Q32}8|p$6$v=LJ_5~jEX8&Xd8xaEQleXEt~PSA;yecOXx*Ka&ht zC={M(H^!>3;dqR;YDOt(D>*+5uI!(@gDDkAj!q=JNMWzHwIYY@V z#Bqmv0U61mWe%x*fwWVMB1|$v@o@sLkTNYVhmOgB)c^kA zjLz+(oHcLeY+S}#Dv{r!>2*9$rYH>~2y&6V7^~B2n^OGZGC&1iv>>N_q^>kyJ*?Vt zB~RT0_$#Ux#nmd}Mn0H^1*fQASXy{NgAjz$!fsJK%ue&z==U-TJZO10po+qlgO?$_Q3aj9Pign+wdvmE5_K+F_XsS%s~YqL;~cN^o`?lwMkG zE~gJ^l}-&vh_I{c9;|IQ=iCnX=62D1&Jl;`q=0Rf1^;{?f&YmprWY&TEZGk^hZL__ z*>Z$;Ux_YEOj=Fr|KQ+hIA(Jv8Wi{Tin{?vf!1B7LKxWqSq>dVWy~fy9`}DNS{`!{ zY4=}|K+OwRUZISQ)>_!x&o88~o`G)z!AV8>$QNsPsiRMO)a)udtMDR zmlNd7K=OpM-_QE}uRuA}6^qyAFl2bN7=T)QynxFkT+*eAh;UC6%g>fK{B4YG{eH$? z|C+h$p*?y)qUU;%(N>er=-Bh1jg8u_3Z?a_?X9Ao)tNp_B_TYm$1f?LH>?~ ze7^JK%T-F%h4o9$-Z;~TH-)w=zHqj&Vfm}o=os?%WyF`RnM$8>yQo&uRiRQiP7}J$ zh1Eg{Ezvj|FLHD4ZwbY)6fkSZ{nJvlrosvGN{#e7PUg;on+KFc~PNkHy4g)g^Nn$Vr`|9f;Y4 z+&q(?0^iJ&o&f_WROQTKJ5=l2e2_QBnC3$P+QWU499|a;4a62Ye8&rQ&5B_`N2)tO zTAL+xeGPSB`zXV?Lc!PJR~UMQV00)jM~qQF$7;Z=z%qlhJBh50@*|V6nS~fpqQl9I zt6Mkj!8UV9>`^HojOuFkHM)HlukYJaJs`Ze)f3FtWa`a?HK;2u<;g79(8B#ZFIO+X zj1U+yUTLXq&66;Bdb9R3MyjUzN|fi7N0F{<0}(CXaAR8Sq8h7GuMiB(xLSLpY1Gl~S)|yZ zl#jy6TmSUao=R6e{lMzVk+3cc!1X5w9;7Th=L#;OzO#0gV-yH_$bq zeX&Gm`Vcc6S$mMq{X=&~D^8bs7`%qa-(M+sgWaHrV=qc=8NqXBJlJg2?JAqLkR7{o z9re+=?$R91=jM?~Df_WHZkzmY@1mtpcJ(@Ac9`PJomRUE?|@Q9WCNkTR)gZaXlW&2 zHL?9;Jhn6vqYUSgmBD2JlS(f;VmpqJt%t4K!uXNgF;b`$IyPY_H(D4ays5-j^*#LW z4*mD}-qzMusmgi-2}a3UO5$v#J-WHX3r^B5@RAOL-=cX^TVP=7DMf4&qhr|_$-W7- zD`byI(jEp8+*)C63E~xYSK%y>oOWu@5@p!Xx{TgTqnWvWrb_#~`qgsecl!Z_aR$xn&nI#{9~97c9F=_=vV2iAUqehSjDt82XpJ7npH2S zysZTrb5<<5aZhU;7l=*@vl&bWovDelD-9yctFS;n;T4K8Yg|4;BmBgc0)=}y1}R(^ z(HRI<6h9MFr3FQ$;%_CbUhs)q*{q1xl#oRMk|S-&!4S!BKAgWxgL3IRV7%Id$>S>C zDj?GyZy})12oJ!ae$l6jF%U3!(xS<{sNv&hC@TeJ%$Pu&!~ms;(tT39hnZkecGAx; z3{2EmFvy^W+jbyfw98sv;2RBlH!OdyAXV)aDrWZN6u^fd7F9GnkwGb30rfY!#oiPkR4 z8^7#(o-KeJHC8dW>}g{}`ZlAw0C-90^La`H`9IZiS#K>)7IYb`gzhl0eP0no{_eq&W2L;aOGS zJY758@t3yvY|b7my7C?}T~VNGfLEbTPl6FfgCA=@VdgG$kHM@R9K;+W`-opJ3SpSZ zi=25a#WtOv5WCvN^G6PcrM2wwVv7ub-3-ap9c+)>F@b|~t8~A&AVsnU_)~GKf-Zk{ ztA! zD?eaFt5{{@K1O*jL(HSkeC9Z?xMSmw;*PSaT*PShxSi#UxmcPfi67hP>9!O{wDJ{e zz)T&Tze3n-m1-7`PuN@6T-LNHat|ylO-C!HE!XSgqh^sh<{WdlURkfrm9tghNYK`q z(qEkJLD3M(JlrQcC@VT9LvG*&q?X|p`NI(JD@S$A?%+%AvTS*sI2qN$IVJ*hDbIBB4RcvRG+ z_LYBaN9h=2va@vvA){E_%bdyQF4NanaNLqLpdCGvY6b;nh&j}*nGT#`S@K9oj_g^O3* zbDD=@Kd3fNJYNz^+%a;}1GX@RW$j>oy&XlqR?|PTnX%!vIc^{oCA!56K3}e|$q>Go zwO!M@0L`>9a8eak8Cc3hmDC_gDyS}VO1*zM3zJw|f)k}oJ{34EG<{opsg@BM9JUaf^m1k_`oi$&5E7o?Ng%pNV$%O}inFlw<)EO_CDn*bAtBM_wzqsV>3r!3=l z*XuZI7OFR%Jn3y`mGEY9S9BgjcN%Q+A!cY43L1?o!_*;8nTKR{r{qS<)ts*Z1(n%a z55^ERY+oO(AbgufkoIM)(y}L!+j>~HAZx4~a(jv>8}8i$anQ5qGMK%iC?V<3I8tP{ z|0s$*8*Jakxb1zFJ{k2ne>KlkfK2)U=~u~k7%7vve-uSvF0yyGfKq2j>s9uR5i*_E z%^Dx&8}Ij44j20D4_CGx9*{h&he>ihi%7bIytm|RUw%I_C?q3>TT=J__MSEL_*Zp@=gZ+9k5>yDd51bYl#n6F*+kp)dyQJ=plG1B zobxcP4k+Ov*OMXsqOMJCeYSz$?SqiIM5e$_bo$35sEvEac|qoe=R>>}#H9oTK+J_Z z$}wvuB{Rx6l2S_NZNV#Rw7_${P$cdie8BRQ4<{31g*$>K#;fU=)x*&O1U*eFtKCp+ z+Vh+@a;a|Huu-XH@);PP4rljwjC;{JBj1GurwF}7iWd18oO%8trUfXbd!X-q-*aUA zq`ml>w4dHWwB*U^=N; zYCGjUZ9N?}Umu*edj!X>SdGVk4-+#oP9sipqpM!t5bTCbz z$z#rrdK^xHkme6e2&IB+15hurcB6CFd{}60sC0kK>|u1Vy!1k54-@aj<-mJ^V|Cw{ z%v9D(mK&sJCRktdxOsNeJZb!N)WGE7-HJ#yoR3{nq_V3Tr9OglBZ?#F;Yg}N9giDz zyDWBG)lVZsTXt6=2?;22#jON;qkcp1jil0-MB{Kz_?X1L&lnkvU9x6iRL9Vcl@ zu8bG5W#%Ai)4o*Rw--?PozCEwr26MHHFiB{NHC5t&u2*atI?QsnsOpew#$z&kPr=+ z#^S1UjNza8NZK1d-NVK?wz23|E^l7eUXCd1b26x4F4ZNR7o^+RU+5^xEN&1_HSY3d zm5V}298rK_pdSFy3i7E1*@KH@xsYJjR97oeb}5VuBV2uxct{9Z{G1na3(xScg=z}1 zNAyslPbC%O9CJ={+0xYcfIeMRO-$-*foi#oP0p&pEuLItYRJwP2M9Yv$ub({P{c%u zrgkk`@JQxGhz-bnsR1|7PqB5JbxS|Kr=YBQ_la7sRyJgfKeIa=XJNMM<1Nvq)Pe^eRB@3B3jThv6&#Gml4p(^A%YdnxS5P0f{AX!!GeIL=t&Gx zJBH$-W2JP-cu*-WbKE+?G}i}bX9qtOUciJ&0I+3v+`pVBH{tR&lc>~TyPPg`98FUG zy*Z=Bo-g*(l{Rt=tHL;*#GYB^%~iOt-HL&#s5Na{!O=mvDebI9Fwv?f_?9DwT4w8* zCYo<+Bq1PdV6@Z43txNBE%_mFRIX{`6NP=N4 z;wfnnMXXpX#@=<*5oXgh_j-#2`N{My_zV*VQGbA$eKxGXSrAcKl{Un*ijhaJpCki#S zZw(D#mFTGiWRB`1iH0^=ju-K49NQ8OVi_0Z2=mxeql(7(*6O&QhNDQ<7v^GCn=6HD z#`bY)F^rI^#LXP)wzK>zM|fx32q}UOYyj z)tX{#_(g(A93(#@H6_OO#A*26Dox16NGH^!*aIr3CgqPnvYC*;4Leyksk-|`dIc=; z9a@DFP>IywfYk7~BQ!RSpiGiN63oLG*`LWXKpf0sRNTllNW)1sLvw~(ZLVQZnoE)9 zsXwi{ENc~0QZmtaC^KeFZh12^y%nntfXUX8)-!dSRdJ)1fHX@b9!SPgrK*}|dXtVw z>w7C`=qY0+K{E-o!F>fjb`f8$&}n)+k15WUx#`=k7Ds?(vzEwEJqFJeQq=@R4I`sl zPdB#E%U$vgBN*D)(!q{#f32?w+!r2}qb2_J<9gia}BI0k5CKH7+Bb9KDoXBp54thGj1sw9y zt7Hj+Kb;*TG6Eq{1g-4o2*x(q3py0u(eVl3R7c{RBuxjorGiY4j15mjhcxCxHe0S>M{)dfaK2xr!BW z9RV{+Tp=QJvX&i#dVtc5kR4uC;i**=2uwZB^~_NOi~(lAqQ^PZ0P)t}C=@4r@LJEC zhAjJkGG1VDZ|nGQ$bCiOX%Su;HJq8*eC-+v?4^`0 zMy|8;-f{g3FopSF$l_dn0S{POwN*8R_Oy#M)f`^*2_|NIeu_Wh4cKHmTx@%Vz;OCk<_<``Sbvd|djYfXuW5dZ6FV1b7iBBh3QT{K&esCJdyU@o&LO=DC!ah#oth;lcAFom{Bq%PI4 z!tsr05-*~0!U`@__>@t^=kxazb|=;bq#UdQPUoCjNiMzd+PEYN0TiE0jbt)Orf(uN zh%0Fo>=+K_yP~izg(!5EcAdVURDkYy5yu1-ix1kO=sKYUZ=kGKYi*51auJQDzj;;I z0+&^J%C2Onnz)UInVymI2&3;~7rCC9qcSH=T8!!BL^w+)WYk24&UgtWk%i`f!TB|w zev)ge)p?sZdlAv^#Qy&j_6TW`JRgX$dABw4qpm3u$Ft8rGRa5>2 zI4e^>@a|F%RY;Ti!M~x??qDB6+gQnhL1WuB;}3!&{Mi-E==pih!^b@K)bC7%xjRN4 zHy5QpEU!j&Kt^duZg3z|;ognTk1R$RAu#_jAP7GL0|SyDE+bL!mFSd7mjBv@i*M~p zOEi|K>^HfTVC$!u$GG@Fuy52((0%=DTAR9^cWE z66h6JQ)ut45$rHEofF)b1^L$ZQJ99*Je zUfNUYHoZOIUWNNDOz6cO@6##jzVItf<$<@kk)kcsWKFPXi{Y({A#4$4@}@7kIJzzX z-iq~+iVawvVT#Fs5(Z5!jUG+(Vd{c|>76|WQm?Tup)H5_f(O};xU!J--2%d}%N+6R z25&?M(Ts15qubdyBwJ@}>!zZG60A}}o_NW7pM~M7XgF@dcwz1Vuj4cZ5nxN#W-AwO z`%yi@P>)m|@773bx=1j4)eLaM1~dU+n0%Z_Vodo}4Nm=JSu8LwlLg1r#t34OVrP4* zFk=_3P7nwBw+rA3I$e87{{+BJ(B64ZNeinQd>7pjw|@rgU}X<%_G!&FaX>(7 zk*0IL97jc59=mKe(d(Qy-ZT$)Y=Uxl?*yZ0!y({~aZW&pTa`s^EK={Co@PDCr0JBY z#=v}XrAC57h1ZA8+hh~t$yPe)5G47_DeoQ3%O~7W2*S&CXy%`;;0O#lhEcf-4&kfD zSm#jYwV;Dmn`HMHF{hy81C30ZDJZB`Hwg)FOrfoLWH14nE2crd!&~vvf-kH223d0) z;U5(-1+guVO4A0#`-f?l{LH{Qc`v|ai=rqTe>j@)4KT#|SHT6|8B#GFgvQ(;&La@V zQ_T1pPp?J6rPxH!P!ZJe;R;TJY!c$a^Z=s6)*W`AY*0Bjffqo1QxHJ;xspqcS)U5s z-S8G7L3WUT(LE{oW)g)1n`8C~=Y{3Kn7+~V8aXmitQ#_w!o{hrmKe+T_0JCIugjI& zl|rFhhJR`=WdefFgYDZ9{Gnn)qHItXDCUB}M?>1Mz`}?b27=88TH)cerh_@3J?=-c z)c`QW>GUoO{R`;iZJjzy;18n@0zZuM!Ph+SCmArdWB}JS{ij;lcw zQ#;mWpFRgGBP!S$Co?$5qmlXyA?o77XXchGvW$;28Keo`e2Rz{QA~#|ZKD>9<`~tJ zVqMY6fZInaLq-%1l{7Q)!YuA-#L~D@@8B*sbquzeKlaWJ`rY0^<1OspUs~xgUmbK? z4gS(c8ylr^F7HspC$zl5ZxvI627|ih^5UveAo~LlQp@;MducEZyNC5k7PXc(j#z&c zG|bhg)!ny8jeZMrhiqeJM!j%=xm*tXa!1XRLZOc3oXz-B)&?#I%6iQ!iWM#FB!H^= zURQDyZ^AZmrA)=9fOawF%GjHTF_##4>}|ZaVeVNM>&7#NRdyj!^Oo7qmQ(y#T9!n> zP!1_2mrf}W_|k+MV;M*nALJBocsb17_IA7mv1~lN_29r^zyc$;@WX`M(&*GUhZ7ZP zwQyK&pQd;0Y3=}I2zI8DG$<0lqL}GWt)NUk(zrJG*;5;#AMHe}hE0R;Hn%zD8Mn9? zSotpTegJ+zfxn+kD)F9#Ri4nMotMUi4{L9l!m$zkoxFBLRz@T|V|d6&*^f`36irfj z4nR()Rdq5n_LUy7HUK8l5m9P)@vgHaD0ZELdT;esiy==SLGO|ptiQ>+1Hc*#h*9mT7 zV{0!#&&ip-Gn;ZC_jwr3FH`R1r?gawSE|qeB;&x`!*jM9?}PE)nyxqUI*$A0Tg|cG z=`bB|+FOPy2amFH;XMu8*qHodADG%#!MQI&@K#Dtv#vuuNR7-5G zf)&6q1*gDTSOKl9ib3XbigbaV$XCf6#;9P3%h_loIuX`svGrRa9Xywg67(Dy*NUuKbdT_nk95iXV~Zb544n*HZh%!IEOH5ayp zf<~*`>vs;`6w38)zum6j7MjfCOVo-AuAp0Z)=q9nHVpi_ut8(hI#p#EH^mqkQ}$hM zI3sXszCLSqx!oP7GH#Z5{ghtO-P!m3=oSuX3pj_9V3dLLrqg-bJS0HRSM-7$r-*Vg zwSPKo9JJe1`vujO?ads1yj?B>p@&JwvHq8)^&32oqQ8&WujTdmr&hDg-TsOylE6fL zluFhba}n1%p=w{R7_ISr&UE$cfUEwAs+Ij$XYHk7N5RXN78WaTtpD1~PwK*`rV9Y`3p%~y*$7tqtc;-|xfYpm!9z7rp>+^E zskBD1TubO-Y(8T^<}cf`{hW872mf3CI{5ZmyU!IL)WiP%8F1e{U~=>!EnMWRo6r%B z94$r)U$C!*@+WzH=0#ayU4zdBh;~pHS;oU*NPMM|fsQ5Cv{2?IU{DsLtw@VuO0-Do z1GS3~Gm$NKTkhLXyKqhNGM2uwWieAwrmB0_}GD@(#u2A=j2OCR$&8k-FA(?<=gmA}#Ow7vr2kZtZ_I92? zj?M?hyG#sHX%APfk$akE5Sh!{cpPK?J_-ng_n-=}3J%Z*An*YWz!!ImtfWOR18rNN zo!o|SfD!XB3l6_w7+lkoS4Pul7934edUwHg+va9b{PhJ`lrCb}HRQaEOh#TPB{pi* z#9T!o1C}l_B^wa#fUG1^(Fd%xQi7vBT25O*SJBs5;m1DI!*3ZI9_RxTV?<0WxJK`L zl5a2~5GMoPGcTv{n4}*W5QW3CqGxG2j3cc^A|=BvI!y2?bVx6$N$i12(E`InWUE=C zON~A2JsMnVEV8*WYR(03S>#J4RH$$r{6(6ThGqm_S+?j_EhMwl81h?24qkuZ^CZTr z^yS!`M(|RR%pCAb?gex{pzv?20O6O10vgEpl%+VUyHb_Im09VkWiYe~)V-Bgb2Ej$&s1fh&tL|E3*i9Wkg;(3&g%t%_~ipW^NUImrA-&kZdW}@=$J1$r`}}gja+vj8#{dUPXOn z>DJENWR~@tLfebT(O=n7W$m!YfT>(G)=b6B#AxFW zm0oa-MNCkRQMA6x0U}mfF4h%-9=a}!?UpxtHZmRrW3I8IU|1GiYav;;QDR8HxLM9p zZ{3JI#TS+O-gs#?Ksz|zES##HUTBZcy(k$>&7s>)&YSH8nnQ83d$uZnf-7*YgKDcN zxU|oZ{895A0F_jrAS@$|fS=WlhdmRth%hU5~>LO%^}nA@$_^ zxOZ^W{Z(~DB98Hbx(HLbuJfD6^Z+58h<@(&&Kd`eH%;h<`F;GWQsND+T+s%Qhk?s9 zx_=1gQ;qQ(co<1=`B0SJj)F-Er+xfj&Z1Q5HT)X`)Z$rm2`>%jWS;;@^gAcx7p5eD>KeX z>t0buvnBNT`A#4P1wJKD;Z%hN*4D3Vt{C%)nPH2pVUG2>F);(u29Ksu@@huAQOu9MkO(hO1#cVV6z}(ACejr; z&oab`G0$ah2DEw^hhoaFOw(i{Xah67k-kG0(6$XQy;a2Nk(^h0%bu~EpYcLq^`P=c8_2v{KSOl|N9<{hq{)A-xV)ubLE3hY_ ze!1i~H1ajjNF8XT{(_0*KpS17oryE0=;c8PUGIeG7U*qbtgs{W$Y38C)NF#xa)F|l zMJLzjm4wt9GJ5suKx2$$IbpMmvWxZ2Dp0#9@FwA4o={`b1L&fj5sJ`=wkFXa9-)uA zQhsRd+aTFlqyP-{qy?k8ohGz1pfN~Nsl8k*Oq6htURozd)!_4TS$7hPq_$EIz%B`@ zr44343eNZE-R9ZhLGK^~Y3TtP561U^YB$;$D1-6V*aI}U7f>S~(7*>YeiX(q<592G zImrR-0bbnGKME9@0dwU+ncV~B^sLkCWT4FazFghcnKx(6gTpK#_}zh}Ms&QI5>CHA z$l@KURSf$lGIyyQmE(y+=Zfx?ai)01k(j$!lq5+Yu1ni!j@8;Buw6Ps*?`?^6L_}+ z11euTgSqCxyv!^Q84P~E99VY;OUJU3bioXtbkKNsX>}@FlShg&u#kIvg2KQWKrDK$0Y&?}13=7#@!qc{KPyFAnzTSC({@?ZOFTZ@T z^VOH^|NWo%zkkTzr-7PtR=udew7|4CJ|(B`t*vLnWbh1$eiCh6Ehc<1fu{Dri9(%2 zc>tKidmd%zrLEV}Em#k@J2l=MoE$ZS-kWC7ZT5P=*So>1X1nu4(CY-<^HwkTsdIi7 zG*7;7opnx*nR|(8?n5i%i4?-D0bBxqZEPHz?FT@Q^TBfC?BE1m?&Ag8 zIKJ38JBFW=pf=h#KRGyV?t|ovPGcLoGy5B+RsM}_ZEUCx?r-RR&`!cazsis+#xeLPhHn>QE+Wzzn>80@Zr35S* z$J6C4|F?$ZI>!ATB%LI^#S6L18@ju>4blW}ic;Fm`v?04z%GU(2sbb?b-x2I!dbkP z1Y;Z_{fkFA{K2uN6LK-Y|1Kvp{1^2X`0pkCcO2c~KNw*eQz5bBgTH17FU6lTilmCa zIOYQVz@r@gqH{R?AOOp$YUY}rF#tk>bi_Sf-a_~BJ*qC`Cz{U4&*6pqh}D}(xVVy^ zoa2UmrSb#1A-}L2{A;-w{YgQA<1w`U>Y$5=0>WjKAqi8Dn3j>GSXk=!ppU>xD3db% zgxdJjkS_y%;BN!`c+hS$Xl{f+V{Q2XWh+#sw=Z7~RFR%8(&HirrU=qyFPvi{0l7E9 zZGLM5q{47HUhG0aq%$Z7Yk#-!|H{+^JSOU)gWuEx0#u-POV_N%RT&*<$ChRZ|gxUDhH$@tymMNgFo`F(H|JsCuG!!=eNteqIcJ~EL z(N`~O7i7A(h%Qm5CGG)RZe^6!0zPXeYIi0LE}jDCc>j!tZJh(jtxT5*R-dhtJDz{y zbb(eLC9B^X7~=C)_b@n#7WfZ3z2d*J@jeheu$!OTC`UC1?eMkMvt>GeCXQ*(qG7zq zOazEZ{2uW;7$AM}ZoeyS!fs-={oMlZ{ul+7_y3Iz|IK51o!6Zq5}Ye!d?X_BTY>*5 z_|V{CIKPRfEX{~a^T1Y*4;r2Bea+fUk*H(=FS3{f`}3DCwuZ3Y_)QPrY(=+G5jA(n zP-U+XYr?#l7#;zL=q{(7u96l%iod`MKsy|003SV{wb`Nxsn8_2qa-W9 zvso$@tFY2>bHIo}L&|^!=dP{OH=UE8Dq9=;gM%)qeIUTyCBPk>eIEmncY=g2FL1{W zaJBR9pg$Kf-r3QTH1X;6)B3fSonTG9V$4$ z5gfwlqSFfwo9$+=2_Q&}-wo(r1TJ}IIA$3UM=~AZFDwB6P`L9Hf2mMtziem;{)zJljEyH6^`RDr1av7+oMgCnQ z{y(THz7rUNW`)LewW-7v&+CgeE4C)wR`h2r% z&N`1CH=pTt)#=Wu&#!U-sbOxYgVnA&Vm-EfIZEy-Z2VsI=}%hDd=TFA$=FN*Pl-1X zcnsbZhx>oQ@-l-#K!(0@2*+P@e5T%&GyK}#n-1m=Ag|l1xed_`>`K?yHk4f!E0$O; zqB8i|AbrFxJ^YdF=HP!r6bHMaL0H=zSt2&0i}iAkKWMS@jwL(NS{A1kz8SQ_4x%E9 zpfxyQT*$g}7F!N}v{q)=zGrXPP&!Q=QTAW5 zH!vPntTv@=-PKyKFRYh*H|F5cCe<3|sO zx!2;4VP0#7f=cRLYWT53AQkp5A3Gmd_oHabTENMSY_6#pEqtiEgI)dd_onj|%mD#e z-BK3{yXJD?v8cXgYPtUXsb!VSx#DzpO;!H}Lxoq^Q@XI(W!P)`YC0qB-^&W|&|4M@ zX?2fVd6dzCd;iZ+pZbn@{r&&;&R5Uv{J$?K|L<4z|J?uo5r204cP4&{{{Cu7v0%}r zejbIB^kEU;O$c}ZWe0%g$MxagB_pq~pKf;kQYhEzl|rFl`vG8oD1w#ej{KK63I5XR z>=^*Rp<{mew+cDq|AsN?YPHJC?ch7f7Pmx$pYkSsntky_B_PiImp-hbF}$o~gJd0F z5MDUFJy{F!3p)Xs^&3B`SXjrZq`?Zdg~uWOLa9mMR|R@Y|JGhgYx|NM!+tHf#kMOR zJb^_e3m%|~TNFX8F3zcBGqA_e)Gs~F>%%<47@Ab18ry|2AYeJJc%aF$%I-{H)!<=f zDwysI<|K0nYL&An99wB%u4&>ujAH0us0n{Q8U!wV&Y1(ol-oVJA#ta*u%_QMzO2O> zlZS6=21Fig{>CPPXKWNcr+*%vLWez?&`{hlbQ7|bj-rtpw6z)hrqlMA{7sd;0*AF6 za`3UK*j%dMq(M#n1*dZkvWoeH&1>@=t5|FJANE?}wa=hAc<^#+Owet!z1bcW&3Neo zgAy9h-d_&VxElY?_4`6BNk78jFcv>gGP2hY)#OMyyo6)V4GPr6z{#J5Oyo0`h0JmY z+c2|eKq&Tuzd!%?_J1XeJZT&2_x~^9-Piv9|JC#D|Lp&N#Gk$YYe|$ufCl`IFPGxn zqAdi`Fz}JW0K>KA0sY1bl&YlPmv->f#Sp6CJ7u{3@tHFBb&fk&#_k|ryMxsEWvJUR zM_jPu*>gPNp}u{`Jn4(8IfV>Tu0VLBMh5iJ*5y`}FX2nI!;<7=O)I;Bj(d!rKES-t z0URUy&rOgm^7*<8N_M>25}6MSQ!96Za<<}duvWLpuZnXzTKyiz5<&?Fl^5L=x&^G0 zJ)~6drGr;3*f;O+B9eTMt`xjfz}zKE$0LB!xFn;+jl}4Nsh_eF^CCfrCbvt&m@ZUx zkXS+DP<)K7VEF@k@+x~)s97Bo954c>xQQCE3UA(x!uf#1Iu-x>zl)TqF_x(K8Y-HP zS}5FlGV(K#iJu^mJJWObE?q zK@&(W6sia(J*L12jX!dbqTpaRWb(~i=x&$oaPDiA4QxK3 z)#Gr`>3YGcGcD>R(dxIl&v#lUJ(YA9hORS7|g( zLdkVQrxeE1O)`HM5Sh>>OX-5+TjNKq(aI}W%OiK_gVE4(4kx!+rps{b;)sJOdNz(a zrO_~10(&T7RP;!(OE_&m-*HVMsVw!sMCU4wQ_Y(aOqe#Vt*|R_2_qwvo*C#IwpjI* z)*MR_li3(OO?m9(wJbTb!aI{9!e(9sIw1HJm4gUmwMZo)Q0OA0+jHr0JbaJKu~5&v zZg)-LzHTaq9UP@U%HUUHsN&`k5v%94Y3Snw7D1q$yRNH zRvxHQACn7w^`c}aJ)ramR^9`hBw@hWk)GvlU`m+CNEx}?x;0j!9?U7cy1=%(cUl<4 z9q=C<3m3b+X0@w+JDVWKuZ?5_gs&Izr3%-YLs7U63f7wAesf4HWdApD%7URxz!(^cgqwohGeV89W>)g8ZBEwY z16q`Vg31Ex&)zE$`u~nFavCnKp7w~y9Y$209`xSyyUkP1KSRguc{t!aDHus5nqdeM zWHQkNcR`L}6vCNqakb?DIX*ahtDvM3JA|^UQ4&;oySzvj@nXrb$T;!_0;A+D0$#&x z{@85v4_jy4oMKYgEJd7*p!C4RN#%&;NX#W-RIGhS=64w$s|RfT759qSGBh5m%y(`X z-9Nj`Cq;*K6C5E!g&JifO(XI6I6BKE?-b8&+wK-x5NmuK(1r~XpV?EA0?_cm7UO~r zu5g&R6@+vmrbrG`rJh!}#rjuqG)H~M9UgA&lQDJEtRAepu)O{c$76p`h-e_{Tr}raKr=?n zMZ}-D|LF2!ddpj**&Chyopn0BLXo_hF!adySusmBs$5Vc62Lo`XLiq?5iS=AazYN=OIt|s zm!d@1@iEE+s%+%3TvuO51q;N1vQoYJ`pn1U)5>X2DyAK)-0qlGhV&LedN;X9##S;* zRQvos8XSx`O1TVZw;ECAY1E6%BML@pB_iVr=s=%e$AlRb&1AOnap!PFW%3dW=R;i= z<4M|47gq@x`V=Wtu(-lR8Yb-%ppbG8D)%rrni8bf)~!L+mp8a6*3bF2Ggn5-KxkqBVtPx6b@~oUS zE5Sei>AXa@ab3k;J~%i1K86cKbd`r_pNu3~(L0L0sjROVPgG5HX0lkB2A97>0klGa z6``vRU9@s=8dPfWaH{iE!*pQsWRs!QnK)le5{fQJ!}cekSN+LRbhB+lhLXA476tP4 z;yf~uy0Pzitz-J@@!Jv9i>L~{(Q!7|yIR7`Z&stCs7Z=d6*=F&R(89B9k4=6x_eCC5+ywGhn!UzG{>W7mxBS_L#tSx!Sk&hY8H=l z^NIxmHmKrNJRC;TqMgcK!oML9OcTgD=+xZL(n&;|e}&gbXuh#J$nC4$ciV#5fLZBm}AlzB1O`5QxjZN2UVxms*-sH zc^DEc-mqI8xr`~XvtF(;Ik>7)amnbr(@>GzLL&Kvzc zsoTo>akIX?9efeUBOQ>i4Bp9X^Q9hV-7#RA?blGEkjH9x`4swnjn;m@T&AF-u!$`0 z%0-I43CFo&rBV?Z&tV%`kh*AwYdB?*f`R=GDh0Ec;W1O_HC+u(W}LF&-&cx2zi3#7 zj6G&}Dh*_y7Srz|L0Cbj^gTFVR>{r23gqE+4_D@wThEDU`~+NLz>eQ?H!j;Bu1dKx zsG?#(=vm)I%Qsr33FVa{u~vVlJJZ|^)O6e0J~N{_25BBP2=|76hK8VMZGfh}V$3p( z;4Q^*#J)K42UbCExk#j8&39DDN=IP1LDQX(LLK1w9|jSV0L`|l6k;E+wx@Fp1Kcsi zyVS-cWPxaOvJ^rnqkMJ8moswM?^-9l#zD8&T|Ig;!yK=38eSBZ^Kl55tv( zk&PULQ7$_dRncTQcET=~Fne8zQVDPl0=~6HeBq}>DWk)&f$LU#jzB30zO$oRRN7dPW*T|FmdYZlfJH8Zr0h;SIlFLvE*Va`Cr^7mohE z498e@cw5K+>_{C#@H~PqW&Bj3e|9QWoVCtr^M4%U@jk9m6jEJ4_rpQ`Lf&Tff9cwR zZ6I*@CpR^Y)Q^^2A}@-BLL_1fn`j1>*muX~LS{2~rmu9U>nSvrj^wIe@%-OmvupLw z4;p+Yrj#$7_?1nyN=mv?$%`q`e1hXCAp}ZqAm$CYSU4gu$@}9zy#;Zod|Od@BU3JF zWY3^U)%-kx+Mm1oST8q0I%DAyZZZZ}WV zm|!hjLOnPXz$S`qz$D(xW9qZIarWvT>nj9KL%OOCQalfP2bQdg?3^mBaJY5xS!2B5 z)|t#WcL=wjEZik6CZ=3RdxsIBhQrTrMhZEY7zASiZ3<089i?ZsvBS1?|DgFD3D#`& z52V9*!eN|g$ETjE8B|w+y%k4&wk<*HHBMxcpi4lQiaDwyo=Qi73<`y^8h)AHRp6z^ zoeVC^X*K<=I^`JU<9<2=94dYcSR^v_9_@a~WDgTTr@=O^ZiXUiM1&$6(wrCqN6-(cD=h}WsZUh_=9_V0NZj87BhX!7%xb5&#(*#OKmF8p z5OY^Xfeje)Knve26pOhZkD-^v&$hn4EZVKhicV(GcryF+)6s@6$q4s>6%A!DC1xV) zxI7~y8XJvOD6%Y|_^eEZPCSrRXtIi|Miy=!>#>y!CI@BhwK%JP(_W9Y@dL0n9@=QT zA8QWA)+6gaJl%_?k0q-5i*@*U0CIfXWc0i6lETmzX~#ngb1iBR2NU*FwB=JvM{C>3 zpLAPCC(T18BIwj#ipwRVz~UEMwzQ>ei9bx#%7Ln$A0YGKAsqP2GbP7lj9E3Pwc<~v znzbEBtx0$rPnHvvUnyDDcWW0?HGy?LsOG_s{xqy=RF&KE=a0-2rLvX3I2QApY-J=q z8NDa&O^s^6miV4fj`HRQ7fms5{)@w6c9D|7t5w)tPu7qgB6V54u*5ESYh*4l-nNOJ zGdQW!HBdLOi%F_fdqV4&p%hj7bTkK~qIkvmszf%@$!*n|OLc-EUV^4*M(?4fvQW?q z*6QHKMs8s;n=GSmENoi#he|+~1803G@mNVf+a?RU);7r`14z2KyqPZ);A1{XXeR4? zHcPWm5bp!`yIz3uy>*fSVDP3K80^g_Z!BaiZEe&mM}uG24rjb(JlM+G0dax#Bho+~ zFeHCidTe5=nNcMMZ3P}BXrS_2R$Zb0lQMxHa55`fovSKUY(LtA zkK47#y&t;|La&eCRp!otZTK2nW@yL;bU;+wUrXmI&BuY5YOlpW>#G-QP|%0ZYcaqD z)*_&Pu7KoT5{pElqrmEWH|6HtR0YaRqe-k~hOxI+ubn<*w%} z^~%|}B$u6wFdnBBN8(v~r|k()wl;jF2=%+D_?}e5cSs?5Vd2Iq(>5+KJjSxpzo9Vo z^g1}b!=e}x{e6kKm?O5dD5X>W#M+=#J;2&fKA`0TjLnd;?i=r)_nu$%~4WaMYrL4 zMHShslK)VNj{zlKM05>p6c1ZLM|m8uQ46pYx}1p+WhJi*C5rXT+6XcdAlDT@Hn8w( zv@bvrF}WcKvC_4K&h7I(cy`<4V@x6EY?Fs8N#*D(9Gwi0DC)ESCtI8=b8@sU7EX%Z z-Jxp-?m_2BGBBmkIWx)XW%09F5qp?bvSHoZ6}r%z8TDpS5qg=ke=`xQKF`yj^jTPX zR{HFqR53G6AhI)TPp{RrRntp`%kB(+`1D%smD|+|UKt`-%j&?Ca|W$kB2SI!QUP?5 zNqr;^Daj0eN#;hro+gE{xr0^KI>21wp_rK?53w<}P&Z~l>CO33v;X};`!y#Ot)N`O-r$~tz~mxWf=#H-ppu(IuG6v=BQt%+X1G@#*3lfS ztUjo|yS`O=M2N~I2gp#0coaM|@+jcDzM8{EmnxiwwK7+zDd;+wFNZ1uc$z5K!Di-y z&sqFsySA^;$glw%|Jz0f1d$*0Nu73Koevk*@a+PSKUmztLXnihFmFquW9L$TD+pQ( za=JxxsxXl49a$}a+%w!yxqi(S^FH~1Ik(MK%c+a5YE%uKms-3{r%^a3Z>uXJBf5vR z!O{koIlZaj7BsjVOXgfR{eHK1*wC&JeM`UVe?l#C{hM#T*{-+UfGE&A4w7O>5TwA< z-WiGM?9qQ6QQ#w#9mv9p<^vPQ%*2tykdr;0{6Q*oXm_{lHgFj&$lg5ycFH-%C7S^d z7`+dQ^Kcm78rP*Ft`laxRKdHk40Q+xNrqq>eKrIruIL6{l&kykINi{>O^JpS-moK* zKe@zpfeGXYBDrI6d1>ZznU)*9!fmEpslAku@&5Jm_OBVHX##TqPX{g^1sE@qZe(Lx z2vr>Dkd!czh1*S;t}MkVyk#&72gvhc!U#pIkp|@2hr+g;wzAC33YtNB&<@(Z_F5-- z$S?K#m>m$-EhcJ>2E07*TA014hfzL4tCDUPp0oSMt2sk^@Fb|oWG`c2=i1Abe{SjRuya2Ssz=@lA~&I1bOs=W3~y#M3$ z*{s{@mfK6Kh}}ECyQYi(z6YW7Q3j07PZG@symvWEiGh(x0csAD(a891=t{w8o=iv>7DEmU$wOjt4mj*i zE;zdz1X01j;sQA@V2$qNici>}=N^N*8nBYan`Yx}z&Fm&rZUyD@<_3LE`4Q33p9pu zgY<-atQybQo|t&qC3151%2?^IuG+6y8)KNJAmG!+XfMui7E?dU<7!kXaG`Q!DF5G< z?vItl7}}`l7+l1~k?$)BDP`BiGVhpaReunPn8KA1cIg-*8Nu-O^Hf=vcJ zf)jCat^8hro?0libbALtO&kD@y^zt|T;xXyrZ{+)>u1Fl@L_;rSVS(H1O|-~K;EI> zB<#;G;ssiUlFa}es8BUATh3=_5FX3I15ufRq~H=lT3%uXiz@cckA={j%vv2@t zC;Nf~Z_lDR#t6Z!SFL19{Fg?{VN#2M*apf|tgHmwQ7oC(C*f_GBVJaXJ>N0AXxoZ+ z;9jFBoD~Xn4x*TK*m4Se$we}9JBW8@2i?6<4m%iq-{D_&^I3(ma|fEM$$U$w*Jy2Gk*65 zj>bY~Me@N;2lIGl+l{6mzzia~*CcZ#6#+CBh6F$O+^<6YWJW^L(Y+(#4i>(00*AEw zug+h;Mv))-E@vl+R!aRQAyC}sB?!9yP7&WS9yc~XG)F=CwOs!y*bFS}ZC1>)b<}fF zN(6M!ZXKOy+8D*rc*snt%FKg0NEejLDT%Ed{e)#)o&Y%LUry;7Sp2_D5Z_| zb^I3QHx$Tk$flTLylKKaDyJ5@X1`OR87CoN7)?SIy`yeJE`$Fs<*EPA-|zG1#sAgm zZl1D@_3?jU2Xo^8KgamLUw{4ef8ziC5r204Uz6*I0swdTQHPGZj^_)E>?V%wSmgdF zz*-s?;C;srjLyPN766qUgAxIl*E;J42X6^FXNS$RpmR!$w5=U0IUx9W*~f_C*o)JC zGMiw{pHI$@`<>H9=djuRHP{dSfl&DG_&DhFf>tl+1;Igp{4**P;61k)aFlNbQ{Juy z`hWFm5Ffm1@XdJVw13?Bo>x+A(-#)JNkM|UBxLrAD zckdajU4x2u-?mO4)kyE`{1I(Hg_BnM!R3#dz4O!W4^~&$_9}GmtB}(|@8H$>!^g}O z+7BNyRJezP+`_M0&GzAA2E4xi`4!gmKc~X#{^t~4-+zC=C(R!oht6)Zecuu@g%1wz zTfT1L`EMI@{sp56# ztljC{C;d9*PtTh7Nt>p8?_m`hPK6Z+&F@if^$_xB0BE7zT17uO4It||Kg%rAx?A4B z|Nh|Y;OuB+ck+whk0a9|QnyPJn5ybut)2MK-|zjG$^Z4Vsz3T$um5}T<(FS?d-}hf zufKZ!AN}7S@#p6MQmQ|>(VGry;TX-g$qaWkj~1NE>Je%`jKXohf{*Oll1%O|O7-i$ z9@;bn@MLpdGmCB+$orpur6 z_eq$(tL)KO#K;ZbP@rk)9jSeFyJhMpRIU<2D|;L7H&hM*{r4;ra?uRd`r|k1^6j2f zozJ|;jBhYdIA*iC&^^_6*2;zf@A<4Ho0)=uG8sKMLzTGD~Ml8-@=;q7WA{u^DWQ58XUt0sh z3~=F?;tS#}dqW1j6}(azeDpiKGL@t*e_Jw@qcy2*pit)EyYq;HW2i_k>D_d2HBYAT zZ=6f6s$&ys+>*TrPAA$d;gGCbaPFX_tWz^Uh9>JKK?s^wLCgrppGdi~B99NcZ%JbP zr+x$}+ zVvM|~qMm1GS-47-DX2<)MSDx0JbQHHNzh-WXu4Onna)KxWGiGIF+xXY?uc1CQ%CW$ zbT=qg1I3^!I406nJrX;pP_5%ufGB~EP0?E z0aTiwa31Z-#~`SYCD0|D`kYQ83tFUzE}Xp zWSAPj(*FB0o<};Sa0y?R*qn)pL|&Py*NXe0C8df^U>Vn#l1(WI6pUe8qUm)EYm-b! zbO=^c`UfdZW|1m9XJEstsg`kNDhq0bNK-6WSB&iC40eaHz{i}+7MU6zb~>lr85qTe zEVn1HpkTJE6k=*R#>YOx&t$- zWkpj8&x#Svk{Q;h>n#=|{Att?!+yUJNHi$vqCHE;Qc{Udw56j7<8sR3$*-2vcd3U1 zgB}+TJi`0OSJw=jzOzgUm1zj*ZE8&-`#s4Ne#ax?x*V+%I*BnJ2`mT^ece!zJPBB! zi)i9Gppz96QbAM5M7J2hzw)o|b$e&6lOy({Au5BJ7%m48# zATTJxaGfKArDEB^15q+;4HQD8QoJ|0JD~?hgk-~5C$zs;lGg%weRKgU2|u=punZxQ z5HJiv6E0pC=P|fLl_y%Kb~!_6Xo@!SLJ^txh&v6HDmvs+Fbd$5XOWZ&#@cx(a$vle4ImrXKNwaspR2XTG)& zB#F<)iI8SO9n<)HqXk8l2CGUem1a?Z_a{JVGPe^-MpR>u8MTO3)%)B=9Fdfd3Hhy1 z1X1E~9zHzArz(-nNY}fJX@9#!gZ-a8>30?P4>2E ztDeXa1(_02=ysKj-#LFERu*CNSG_7#ZZMWXk&|$EKiwS(K4=vxqwmKZJ5aI!sl>(# zX9@^rNg9)oDR%H=gU@FWGtBY@2kG;gS1_j0WoW}-N9~bwn6s)?RTM(&1XfB}(1O8V zsC0-nA#iF6=#ltTxQv7Mw@t(v^A7km5J7<2HGCxIb)fb<=@x7-Sf!%6iMk2pm}~W1 zb{7N?a1CHO3dR?jUz-?FK6cH*;Q`TT%-XaeK{+(;E63cKIQW(tgkN8Lp`;hZ(ab(Y zgcJX22_^IJ29|J4Tj>tq1bQquu{Iz)L^6k>%?_Xx-E*TbZDi(;5V!V?xTRSVv;MNy zMi?f*(j0yfa5+7o044tHTQUxl2$d*5w$V<5CUPOL*cwuRsT{gpOqpF|c42iyd=N(6 zZCLhRi)y61Ma^ej($puH98#zoVTS|*f9SMqatTY*xkJI+7Qy3}KjRy;EmenOnJ0S_ zT0wtuWJIw*PCvYVY5#fTka!p(&cr(h?F)6}ji17^hjv5@2?jaxx?)j^KV`8@Yf~L$ z*rrb-!Pek$N92STa_@L*rWmIbwYW@~8~|L7IVS2n4U%vP{OCCVTqNiXHNCU;g@xjd zMVDXIiC^ubGYE1kn-^UwUIe3zHKiCaq87VCgrxslEjmmy>zCz?zS;s;ZWVb{ZBzb8 z^zXz|w|~`J#$rC0%*rF)%8Iojolmy$fFqx%LaqKQeytV7f0>Y=K$6~{g*a4KWTiHj zQH>l$Tb8-ZrdVl&a9~eP|kv!atOcU^LFp7+0$FaeJh27BEn)oPJ}r) zbeKxo05OjmxfLOCrcNSX5PO(-3w6Bjz6iDA&MOob3OiV$7W-eW3xyZ-*FDQiNCTYZJDk6+rBBB$Vhq&mJl^bNf zUdGsyN(n`8V$?5Tw)df=V8<9J9FIly0%Xe4D4wT_l8!6QzC-W|7kiEA-&7!Vl_*&} z2`-@Emxyd@qA0Q?P9pWI;_n)RWITp5FmtesaWkOD<1`sMZ2ZBFNghnfk9v7ee<* z#2PKi(SgO@Zb_eWU?{Kew*_Licw{S!^kvCE$r2`0O5PBGTo$y!`ariy5 zafkBcUM@PE?n9qc|4Zxf$MjP~0xIGT<5XZ^&C>1%jsGJDP1N?!eO}sT%oiYRzjH_X z!@s73IX#K3p4k158CDq>9R`=epmR0Yvo@c>%hw0(cJIwu=ltl6kNN9=J?5|1Vm?|i z-iVu6GqkY~=tV+#4tU+NukzF|u+=MXUyc7C>TCzwJti-jlG<58@Gt@VNHjJeC{Hn3 z5^n%rDbtivqT=nB#jW<4TRE!2d@N5BZbuIZlQy!_QLYEG_nXN*Jh7Y`(srln}pS>%2KK$4!WRH zrK_yxXLgnaa`&e#bsomFk;^`txkFe^v%+|eN?~dV=sCi!l65UvOwha^n7zat%O%`J zmOez~D*@1Gzlnza?quK6IxEXwD*rI+z>#sKiY4hXFVG!@4P$5T@heS%QLD^>`o$OV zucmPe16)dW|B5N1h0?OZBV8%G>xcfn(8C9{1jv5qp;*%_Cod(gE$i6TGQY_88XX=!*S9twycvUvcii*ecU_ao=r_oJ5NI z#T<(!|0qNN_c3r-G`*%nxmHpkmiV*2I->68z(?~a5#(0D(|k4@QyN6lof#(cKDRwV z2v3l*4$$S)()w>99j%~Ihbt`fMcp+k(1i?LVKJ@5FbwXALdu-MYOghcJ=f@NI%p?o z1a#IsZC9Q$nrxmK-SMfPgPh(K3dNT}G3Ub$exXmRjO!>k^69w;R=q70zO3)~LDx9c zAsmJKaoS%j?l6=tv3NUysJ{M+r*!3lmvAL0T;doze8pVVRc@k^b?_QvMpR=|F}|y0 zgLL}6Sd(Gc7~R=rl-c8Q8Uq|J;*kToTq(q9h(ESU~yi&@3$^k7#cE=v8@+Suqq2 z=|V+?IpLIiY^V}aLV(#qr4pJ_I9p7fgf&$3t}NwjX^MkWejfB9eke+KT!uz!*5Xx+ z3fQ}%hA^5(xe)NZ>Ieb3xO2vnPkZX?J#=^0JUB$_vRu+rFrMkA95T_LWhg$4;ykM| z<#xpiK|3Go{`HX!?vshF8-UT&tX^=mQdPTLzNqZ$&$CKJZ}~1g$&3I1MudS74u^f| zbeX=nHPuXD({?p{4{hgD_?nSpfF6dic8EFylqnBw0+FTV8LG#I$#PMFH>2?~y(;Tx zI!7a|2nBCGvjB}SKxg@)>afi!uP1{y)^0}&CNh6r`gr_@+@7}g4l`9Q zu>9lJ@R_kikV_T5_hxI=)GT2Mq+}aq25pSWY?d(J$$;2BjmKoHq*HI|^v-OL;ppkB z*y6h=n#uiYI2~Li^Jr+F18h+TFxr^pNr*72@47N7dR+!2)1qveMG!XC@13Ht zXgO)M9kHZrS2lYt)V4NYk&`51s2)6tNF@9GLz#_??_h%zA*RI1fjIF9X1)~~y+eKLY94zwcpTCM*cIibTgds2 zwXYV9H#@J756<3#DDrKTj9wZ!1%blGW+IYF$;vZ%#(|=(NWF5ObsXC~kZsZ3bP?W4 zM`g3g+Qy01n{OKzz~V^FbzFEswh=gX$se3MSpS%66?*jjYxC@^`_oAeBM`G}&H?R$ z@g%+6%g}&rCgu^r=VN2=Mx>8rU+ycUTUQ|X;R|X2P%WRUYS#F|#GGDT+c|k@jyXAp zAGw`JV&B@@a*dl#dGS)htrQb5T0#M59i;mZ72wYgW0<+BV|$K!SpgxBuXum9`8J(; z#k?Bu$|czGfhWN~Yt7~pIU5Nda(GHbDbjINj-8LSF$EWB#W`8%1Dah}Uq-pOoF*bx zmxcS0!91{Pn3)+HWs)iVykc2XHL>BM)QTJd_oayync2VG+NlOYPMRz|GeE)F zXDJ$zTW3~rXMiTikc*3z3`=$ZTB`~sYOHTTt?f6suq`9%09!z$zxIi<2gl<@qQipH zD4mPxFjXB0zQwOE_W)7JRDe}Ypv)^{d@Im~Y_Eq3N6p8X{sF68M)DhnSUPhz1Tvc1 z$kuBg2xz{sE#cE`ozQ4khej+2D<^3WX31GJ*(+9Klp!#+X@)#kP?toaSMlB(*!4T3 z*uF{Wpa$N)X|<~Cu5`HDB%Pm9vfweOM1LoRj=St*^uzHriT+& z)8=$~rTsE0F@gyIjAufaX|S9w;<2P=quopU`|#DIYs-vvv;3CPOA6P$J*B;$N3)1x zQzHCJ_WjB3qgrt)%r=^4H#~BSvg!?Rn6Vk||^AEd&jS(su#4mFzow&Vn) zPB9~5YC5f?d!Hk!JVazmllg!^~Zl~dBrl9RvNI{$` zgWD=5h`x~c#u-|*OfC&)_5>EKF7i!`tZNF_)Eqc}-QJ+Hyii<>$~d>`l!~mcL?+E8 zJ+~FI@u0I(>TKg#ry{DkYCfmFIlP+2DGFPPX<}Q#^Z6W3Fr(pj)(Z3Oza*O-g{!vB zz!(mh6A_f6bv$%U)-s>X(y!a63CCDn>_aWWQ7kXV4<}Cw5UU!&zruU@v-AP}8tz|? zl%m`>%!D8EQ36%=yRtb&!|@%TKFYWpEBX);;e3{hQM#G$XwU(1jUsUOF-wI ze`o^8H}1@}PutGgr>zprWZ{&R`hqkhITmb=F|^@^yhV;9K%>VQ95(_7lNP%7MA`BF z<8N?mz1lH`j=o5SluBzwG>D+=xM*Xn>3M>;DwMot7*)2^7Rfj1wl^i;C8oTsLjBCa zm||D2pg}T>H#VlQb|eF&S@G8OI+m12DUHYWVaR@DJ4SXVlY>3e22zA&j8^8m`p+%v zcEioYg+y;5Y{$h;VHU=&Xj_@j(Z@@9o#?Gi>_G8IDL*lNkUj67r6~7t-HY^5r zn(JB)*=5`HLprN`HmG~-E`s@|L)+iqI?h`crPPDZ*(irMUY!^8y5u#lP*mB=R&J`E z>*~$Ycm6r~B1vGGOzjO;1wjBt%opuw#e|uawD<59nu?~5Uh{il zYMmT5e+0(PDNvdx-xpmUx?~njp%r8IiZ9I7kLds(CmoLxHBX!v3r7uHbmG^_xxEa_BoWKSv1OQ)hi9ze-tnU-;t5vhcc<>#Gg7}& zo6*jwt!?yBLEQL5Z>+V{dC?8e3xtyEe|yBU3_xZk{C7lIp-R>1R_Sc5hK` zq6$8-8D+^GTP{Tj>fQAC9FuR=<=_kL{o@G{_EPaEJ?8P%V&9aMw_QzJ!-RJB8gAt^ z-n7SfXK$47S@$B!rllGy6ITfSDT~vde2rA!#n!uS)kk5O$(-%kQXb^2^2d%#9rW@!&Wzl4vf?UwD%Z4uQfLPRS~1qK}T&?>aY$+ zQ#z}a-KEX}Ni>PJed87*g9^(Bwj{@B8^SIfYockgyu6ZBElLcQQ8j;T_4=<5TJ7_* z=AMTk$4~Wh+HutZC=oXqdRfYD?XJVCwfmBn8w07Q3(u6xoa8UB7WO7gm?eMEo$1i4 zl<#Z0!*TBnQIWR{_F3kX&LB$ZV$p)u0HVG{ib<6miH#Hj<0MrAr&2yjMY@mh<-zY5 z>D}{2quK2SyWSkU|M!WkH}>McO^3_LZ0qVt+gKm}ZM**E^RKP=Z!a+a!&hJZC;!7A z^5?{VlgZ~8aHPPRVUQb9+mp$xgok)g47hkC32O;%|H`rhP;cx|Y@Gkgi_gZv5WJVa zp<$9_fKN>p!{gPtK1EgD_oSQswgVueZ0ptf&K1b4td*lkjiJyf%qJ{IufSP#SbhOHrj? z)A)j%&M>oQIJmMCA02}f+AF7(LOBJlUn?nXy_h^f?bU)zm-C41oX-1P$U5Fg&i*03`VT&`2i2#^WbKUDu=RZ5e=$KauCL_XJUK!uU_8w{(1Z# z)6l{h4l0-Dedy3V}Ytn)7O(> zoX(IT2}Zl1^z-LM~10W3G-vO0Wxs z>&YlWfFJ={;E$R;Ne)zwQSIu5%j6t${984i$tOf+l-r1sJC(g{HdMhrM#*@b+>niM zoG#QwOsp>$cA*|t4bWz-28Z%zf9;(1pZ)U5a4$%o(a+C+`Mll7Uje?VZf!oR^3PwM z!EgLID+MNr6Xs^r7SNw_Rm@OSRS%Sa$a#A0JiT?FesqgsLLc)+=l5|6Vg4TH#YwBJ zpH==H{i5r?Q2BGb7wx9~qGdl&ei$2|Tfghq@7nddetnfc#wyV^D8l?N_Jcte=5Nst zn4iTwbgW{SUqwG)Mil+fa-JyviFxXrSr0$jPne&?dT2Y{vwLTE&hDGtHM?g{$DDrI z-Ew+m_rva>X%2HxxKAzj(G2YTGaGDS-;y&1CBF5m`BX;pr3lL8v6I2j}3J+ z|Hr_x!CD30TEDHOV-ZoiX%VDDoaQ%X4R9WS@=RY3+6G}N1%Q6RG5Ed5ZST3RpCx|1 z{fyDz4g9bBEj1>F3a%MW33{*0A1$(f|b21ynFYJd#|=2Mb$vY7uGiFb+6#lT+{j( zZOoMJne-!MU`D~h$=|`c0EmN^LES{VFhM_}apd`}>+5N0srbvHXvLEp4ml!_3Ql6o z(EN%i*{8C-AR*c<>KOoACWVf^-@7R{*DrqXJ-jaX|FZY@U2R;++Bkgw>wJn1XC;!b zz<`s?+$J~+W9)E(AvfSmW;{NuMruI^q1LD+1C#N5_Ge%9vUlz7mcULXGw1h&H5045 z_xnrjs@hdoi6<=c;m{Z}fR&%A)nKyE-KWVQh0-P?*Inm;9`}v~>22cS%+(GHiZjAy z<6z^yR+#Fg@8~iGwuNweD=%Va5x??~cfDy6Vp;C!go?ovU&CpA= zG8Ja&D!t4S=y@tgH|a!OZpumx6@PbLxfspNPn}&%!Q;7VMw55c8sLtEqmH%2s8tj% zC#7i=n11Km?W5xdOUYjce;xgG^4IBK-z_ypTR1y)wQUd~si3?m+99hc1qpK!DyMq)M>ZfjAD@5Ycqh@ zcHD@JBJ0AMt3T17X(8mKi3Z7qabAubu_)Yb;cGd6XY9=)f>yqE+pG}G27&qD^{Z#Q zN8X%JP%2U(Y*kZrZ%3sR>^5^WT6&cm0ExP@k9xAH30QQlHlC~v#@qgqo9^P(a}w8r ze3_2KI*N3&NF5!LUx#0*F}QL$>jBVYFdN$Y41l2WT=*_2Vid#gRlf$3oQ`ho2(`~< zQ?YWmLY$1VjG;`%=>$O8-u))HM453~zfN}~$Z_=ZA6beJZHGRNbmX@1q z<&9w6DIfjX=|<4q0pNxPq=bb)bj)CH-7%e12`;ix57mwXkD3Q>AN=c{AAd!+&`b1O z%*a%G0wqo4b zZY~T6(FSIH<}fG2>|HjDKp7(@ zH_9L|Cg4QXwu}sBO|3^XJYK>J*7MR{b|Z@Rn~|W^csd&m z^UG{_+rHlrdh}FyUq=>U!x%$VO?os|kukD~CnVk|8}?mgk<`8Vs)IjCud~0+(%}az z%G&GDf{LltkWpBv0vVf)&ixt%2j6?Hh4p*PGlzeVW}4{-8a3xqcZpXdJe4G@gzcuG zVA4&&wq3tx4`Fh&aM15q)6Fx`v@W=^IV+-}W#zx3W%29B4Gn&58(hw9aMfd)EYKP} zri)>p?9RR96az%J<-4wjmpgk0JK&3#@=DvorxH2=Q8{`VwVvevgt_gDsEP=20H z&M1ISeb5`kNB->&(ee%5H!cBUbcsAsp}~aiWl0Ja-xK#Z8`1l6no&|Wyko>nlizrK zH5+R3yc8o(e2)6mjfaP=G2d@i8!CWwrDGwujXc7~Cx_pw`SQ{3@yYhli9YTe?(gsJ zoNxp5)$0TQ{rF_pXFc9M`F{KL@veEsXS%}*+4qi*ULPFL7B>ddeyZQA=v=^sLfRVE zDcj>JLHEN+DLZ6y@6qvmbRY13rs)9_57k_%j)qLQiy$mO}*0F70oIP4!+xVih0N)^LFNQB}E>^^1rfn_i0&wD^4tA-CTKmoEfQT#iZJ*5e zlZFp6^>On*sO^qhc}Musl@8QfZ%WZj_w9mTj&Vb4%(=hQ<+f;@%RCa7n*k8wrdthwF~lm@ge=CHg~lp zU0;6OYmb`xVe7&)YVo>w->lDZXZXi)SY8sI2G;iQV3#Q+`)&ALTwk@{HdeD#-NtT&K?Jn~Es)j=+O%_|Gxn`GT_tsAy8+G^jIRgZMs@=b4b z<(iB|Bmm3OJz4w2M}UzpbRPz(7U8H^lwR#LU2o+dy6_tps&Ao8DuG1sjOf%vz9-E~ zbgn;(UJErW(Rg80pb<`M(`|vY_%~vk_HT?n{ZzCJHJ=je#LT%k=7;R-mV4I<8r+JO zJnFU7Db7?TxGK3&x`t={%D`#8p9(>pjeTJ&8?2V1Va(|6HZ95TM-o}2;bHwcSKtx2 z`K}JE8UpS+yA2##aO%<1GbX7KB%P=w6)`Pm$b$-$MaR&ESQYB2MFVySP$=X&I|7ue zTw-lRF%nU5G9J##raaBZfyQOI3*ksZy(q^L>9ReVUIe^GvTs9%4U<6@Cio$malYVT zVck)W$BugFo{)KCf8hzkqQkSFUi(|;I(Q9wcY_io#0|;phKA|>3BFjgZhs9}WMqAb zrWSY&=Y-+FE+vFwT#?&S0Wl0!(My)f{ zK%k4|rrXKwyGK9lK0n?+JbCbCgnfgki-m;Nbweuc&_R8|u|N6ctYmk8?jV2;7>JQ@ zxB*!+8w|P}xR4=jff^R+N2APcQ?Dj_ZgIPmU5pUmh!FX;Gypd;kZ=^O&5nCp=KZW0 z;U)&`q|Tj6n<_+|&BJG|4RSfQOzb{wS4K5$&-&()h3H$jh>4+4HZ1@+1)Dpdy!1 z_dTOaOAQ85Q`1he@i6VtxY$*zM?GQ!hcyu|2YaRutJj0JFrMi-w?2&g)GT8K=#+WT zjCWj3-iw$cl-ik~;mjxIUx1i@@nOW=-f=7If&OxYs!Dw1NPP*qGxxaKz`Z!Ho_RoL zd=xmTq?`D%%(+ov0<=xU(x*vv1$|5dm$n#T$AApY5kTQ>cCvSPV3>&@g*L275l9=> zV#W0t^`nfK9P!CLe^~Bwq<%bl3?s&vJ-|Nu0Lf}%e*5dJ2l#FWVGW&V-`}u=vXA>l z`6+BvF&Yw}+7&r?(rNOYPGpO&%L>wJR5z~;+B`?M&=l+QW4Ww&mW`NRxjC%I+%w1# z)r&%NzZ_`!r4VxiPDIaP;4LQ=-b%K$Ib@4L$mSaQoQ6)s-t?f_YFpZ8Ye#s9PG(uv zxGS2Kh)0g?0)vH_<>+hZVHK;E*q|jf%`qx~x%g}qo6`!`AdgJ|CH+*P2Nf5)A_&wL z0}~}+jq`fe^ldGGNv%X)GPomQ=$?he5YF%xy=yHJCdv%_;s;~8#hSnd`-|ma#e|Ym zwf?JBHBzv)EGz4cO0k-z=T3cyMRkL%sFQ?qGQE4Kk^Dl4mgFfc-srQT-Bzi&4s)KI z^=EPbHkk8hI8a1nhNd_V8a=Tvw$OmFUWi~TBrMepKddIt5c|k;cLW0|=581_z}F`& z?4*{8o&7?A{!jw($|jhi7>nVmpj7eO!pM}X; z>RNX2eV0DP7Au-0ek)0t-_#`hB%f$8=ofmB57y36zuR|`jP?AQfS=@(a@G1#pUr3c zNnYb}Ysp-6$?K>ZTMJF9|9}VmK$LS}14xfkF$b589;gcH~ z^T|DhPi6F}^q-gq)KC26Kh?*+tdG5#uxk>1_Mb%!(~VcPes;9Ne{#R&^-VOOH(^9^ zI^axzk~Gs(gw2T#wqNav0TLIY@HI>JElb4o3^(IX00Z;t@cHTX_j|hafZTXWmfH(o(xG9a?J}g2K8rd1z}+8WaZ!Owfg(tuk|;K{lEFH_E+`(zRUmn4_`k1;<54n zehmNbFTVKdcmMC-;?Mej%jC27_x?<7?n{CZz368ecr60FJFx7@IWp|8PYt(`;f01a+(JKi5?g8<$hjNcSEL@*7mc=^tU_>o* z_0LLE&4 z?llLba1AIkof>L|{M0=A`O3)k=NE^(d~Bha?-hMVrA~E89q zk)qGK$vB&k!w~XJGL%*(=S9KZ+6H>yDxF@$U<3+hco!H!KRcV9SFi~BMdihLukzw5 zySfijB3ZW7-Z4r-^pf{}{O;YA-I=epf82hycXC`^tGY4#dZm=ddw1{?7gTwUf)+)3O9Dbxd)VE*+m(?mr08+^;)&wp`8!h+`l@dRdLW>pCw;^ z?K|F0PJW=MlBRFp-fyg_;hfgDgH#c7hnf;UX#4(F2ld;#1~m}LdyMI~^T*V8V&1?~ z%$&Q%_S^Ym`z?>{0WQOQ5C5cl-iQC9{;;i5&YQbS??6<};CMVPu35LaK^j`zPL)D@ zN}`6X&*Ekwx68EAo_0r_2M^lkBiISMeh#mSe!C5<0rZC7c5v%0jf19`?*Jerm1NYA z6OkuMt;Qg(l-aN#6Di-cZjzRQJaJ3tbEJVHD}oInZDp;IXb!b8G!e~9K0`o_&_XAM z{9~Ql8D)2r#AR{+b)7VQMudz>XXPog4K{>u zp*-$TLhm-d z+{7ZH#qMt;IWds$prPav-b?VTTT0hWpnG5g9K7>pbMI?FgiI!q^bCHMNb4H5{p|SU zyWKzU93p(q!3kxOnKn!3hFV!b~+MGT@!e3FiY2<^+|H_rL+o&Zfg`nrGaI zJ?wDDo2_tcGCId6nfQ}Zle$`d(l0V%Ea*OiLTS0h&89szgW$rW<6UYC<=;D?{F|<8 zy;OtSy5TH_vni=?dGN8Psi$<&QC?9{O6I@TllE-nxSo=jG-5Uej}Fp0i+nY+cZoF2cK~WWenSmlmcpd5UYH~m;MBKxMeu`a3quhy9o8i56SxQDh*{o1B z0W5&tkk{Kys(^z$6xnaya^0Krj_Lt^$9YVn%-zfLDKDo@9o3Is`wdf8ggyG6j zR9=o8sTxsmywD;yyPY<>?)%1k`}*bX=?~lco%o*6heHtPhkRovRoj_NW{H$b z#4E>c3Xh{auE6t4GhAPWbbc#-S&P zX5O67Xbz|?;bJ_$&M~rC<^h><+uCi~vq^CY2j6K*caE*g>9j>_)Db>8f8E=6mqUQb z6wKdTXLOjU!J2Cq31EDi#A8;Vj1hsJnkx??;mhb#kT`^hvJP*`H;t|livG;Rb@}q0 z;4!GLA9jJrK5du0Q*-_M;o!Afi^lcOE^8*!IdyQ7Ubm_Iir-E+@{qjQI|`M&*soNg z+X|FQ0UYEo_QQl4*HoWy~G8lyfTBKY01eDp0n- z4a70^XjqKSsn&8{rwFL_Nxi7Rn0QC8kO?@pi}S44^6c-u{PyJa@$M1u=0hLZR1|)S z<9l>ZnH%quSR2Bf7x8-7dEt!?up~aDj=^I0w3j=FBw!}XaGgExeMr%TDLM|F8OTqp z9EgdJptIpXZ!rthTDa3seyH#Dh=E$hE~BnVgKciK*mZ2`HoHsJ1!+P*@eth@$06OZ z&0Cl2Y#Bk=3KIAmA6(Z!pxp7Z(E?S>iB+d$2o3GBxEj>*SvaQ1Q>$D}USPXQ#A-R< zJi}5lw|@q)i%%HGy!XXCgp!tONbPt!Z5~M+RH{mH9Aco)q_>s*t-P4H{lpwf?l`mC zL}t~u9d+3k;Y%mYP3W=+MLi;cv+q`$>(pw}K7_@LMt&ne2v#}L zX~eu-7HV4UKpC2Obsc>GHHro!9hOCCkE`0(hdhT+F{Qj*N-CjC2P(yiE61>AbLH_l z3ID3IEcgQW(2k@ROGhk2a#}PPY01d6A7a3kuxg|LswL)sKzQWjHefPCAg0X+djyCn ztuEGun+Mm<7MnUqNTrmGSxDhYJLz4v%8dOaJD&~H3BbzOWvr?Qs3NG7(jIlH7P@!$DW|4HGh&LP0$rbU17jKYFXl;cQBd0F7-uMLuq*l*HjvJwB*w^7l{lmdtTxZMc_qVnmva~*d#WN^A;!> zRf5j21&8o!rcpIUZEyccjU8Bg)UQ{Mc47A7RBdMPXk4~vT=0S#(U2c}T%2Epj_hx3 zW#mv+H)88tsaohA3`bn}IBMItsk~Zoj2w;| zs#+&n)UuX##sMjTg#dt zKX@6~X;UgSjP~`{jy~@H9cxMR+?~F{n&$R)y$hivD59+pGf{{7a@AWHxKMG z`_ZPBIMz}c(y1JGbfkH2mlQYk!EGgivLz+|4dir!EeQyss16^19H0!DmjAiGRtT=D zgJL%72j*=AOybc^vovp&iL4SN$A?Su>!*K6U+=j4Nil|j0kdvyYY*ALLiLH}>?GWD zI%d1cT0ma66CQ0l%F30uBPE=58-Swpc;j{Zl3c@P$=CjlmK~W|ywKh_j#xjut@<(r zW$UGSPwIqM`Y7a&+T;(rikf)QAkq+U;R6Mx4B`nC17tLP4vE4Yc%)dc7BA6&iseK# zfw|H>;Y*CO%n?*FC+8{fXeT7MLEvK%c5UudII`3?GZFkd!alS+(67chfAKU22kYp4 zuGaz6DSI=M(xxIlu#tHH31QDxuo*6sULBBv=o_=1JcCaqJ_&)Hb6rHzD7|Um<-iW+ zVFIe_C^w+hvZuq;S9znDZh<%j`X+=ac8oGEGI{B?H#RpkzPk6_#JoJ6%tpc2T2akq zXR`FE-fnnVqYAm+SkMiHBb$)PnN+!v@%PGW9a9K*FCQ7>EiI1F=G{xbL`fG$YHs*L zk@E!)XEDmk%4oXD0Is(CPZ~2So};b9N!bN?JiXkbzBjC`RG87m^EzIIP`&EvC!nit zQf|Bxbs{elU5aiTy&-}ZWcgsB5D4548y93cxs@es=%hJK9OIH*ji;#klfxM1UVO_89W1we^T~ z+#iXt;$cxBjH2bg09(bE^(c5*2H_7FCs!(PXqd{FfiO~f%Mp^24{2h12_cn}FD2sO zh$L<$w^T|su8pcn&yAifws_*xfS|fa3AynX!qGl|DEsVAn_#k7Fy>{?6P!T?dl zI05#oSf=3-{2eE61rvlw{EFzK2=A!6Oxn>W8vM82IQ_C4zlz;J^qs5b?c@gB$#rU$ z%LY}ZtKz&F6ZR0KAPlMBj*%7trPm7>EiM7xBQzaVdL0#_t@I_;R(3Tz!Cbh}XB;3} z1JLykF#i>MVeA50Zb9YZW9_VUWdJGQi?U&1_Q}`V&4BwYFCQ`LAqx}_ANu^uTgis1 zTvL)1cq;{dBoy*!Ly2^yseahRn8%RpFhq97qj73a(fd(x-7!K7rbm2bahu?4n2m|W zkpfzF=hTl@rQSxL()JBn;66M+1$f8=cgM_42*uBS;h~ zS1b)cwXKegn`72l|pLpU*jz=rFU z3T-Af0)YYOu5TV$bIE5VpR@Jr=XsMwjOlruq)pvRA!x(%CZff-xN90Q=IY8jOvoWu z&m)nw!W`jVuwY_CR8YS(V}`k{u6qAV0%%p+D21gqw2z zy3L}t$#^FEg722P#G2|}7zpZD2!a!*%dbeteM4jL7@)tkfL(E^-}BEn+k#ERwwK9RH?TjBZ-zM@OZ;jLy3aso|@^30}X zO~Sy+`rA%u>aeGp;`e56yE+{G9`^VPEjIsbcvyU>ku2T^%&*?P4HlmDv=5_|Ufr3N zZB80?Mi3+Webyt(_5hPmBlaB=DbJN*1`FwoalHf@o)RY_et0B z>}l}#j2y8hnd1Ag=`@?XxQ-Gpa5x>5oV1Gc^z4;%e@o^qGu0dPbvb( zGqA?Zyo)J5cPFx9@9IrU93N+q1+dSSupGfHeAqIl!CkFpNi(Z+1Cx2cH; zK&!wNIoPKlPgl3kB$M)*cMk6ODk=-NjDFgbA2OYu=oZs(%kmS?&rhNxa=*gV@WcR4 zRmTGr{nVL9hh0ibiGkwfXahjsM;Vmbjtb`4_%K{T;zr?(!Mgqg`%wCDtiU$PVi@@BQ;{EM%oQQ_;TB;=%u_L+b*eIbcJcc^whOi z9Tw=*99C#_yV{e(8kdT6_y#{3HsRBF&7sO}{Xp+hnPpcTGa00Zj8Jnx)3Ws(8?@!q z)x?;#gRn~V(nPse zgcjn)nc(C}38opEM=TxPc7k;4dMeT?6WhvENN$irs{Ra+RMjCS7kEv|uD_rQL=fbD zgVibb;(%PCBrM%|hiCrc0xlNa=W(sB5;Y+z*tfqvXAN4lVPECe*djw%dViPZx`6TC z{KO)%#-($xaHASwzIMddWY<$+#v&e)h&w)ZwUerS(Lr-3nl@5dMp9OYFiqRU@`~PW zL<`W!>5j9YcqYgOBOx@Nw7aXT-bSE8>%lls>r5aH-{){2H_2AyT(|2;?(V8&AbFPp z|0-x!tgMv^`|VWP`$8-v`byz@NU?5>OQV(%Ut`0f#dL`5|`18*j3nWMyP<<&S;q}00HG~{v)rR2-< zJ0=QeHQ`{|HQbi%s~^B+adA58vTTV$c(A1~g`wk(8`Nss&3cE5IP3)<=iUwKgf}m3 zpL!py7*Sj5(RPhDrauy>xwMsaBuhn44k(R6wfw;G5RHm!J4}XB%v&YIMa5Oi4QKVV zkpu63M~+e1(X$YFS~L~4jj2ND#7H+#KyhcjPISr1R#k}%lOVny40n8ACznvXZTwGO zmxC7F)>iG$vdeka2KT%Os*FtaBFf$-F3yVHdt3-dO5dtzmg|q8K&lDOR&7hGISl5S zC$gE`Xq5h}te?qzITDoV*u$*!GHTL>%K_eiL1Q>FcRtgLqRfI*P;}86=X6-r9fcA=GsrPH21)=fl&*{B&i#W}PP za|6Iq{&_|+^SCIhrq5L?6=C^Aw{EptPgRc>*h2GpWyRXGk}4ereaf;0XS0OB=ZNtWGxKl8uZJR8UcPkdcxNT)ntl%2P;Q6SG>Ks1ML)j_;AgGny#dhXe> zPS+PoR;y9<0jkT&qb@!9tljTKrR#BhU@QV-)O|HJl3zNzY2cb8^HFa|)u@yfQ^pd4 zIV+|;?mS9iCwn#;{aFiAxBY=}+xJ)V74!h3N}r`aoVw%z-(tY3!515Q+21@PPZu2+ ztO0{-rz1V?8cqE^cO%eEF1_lJ;R^6pqu#OPM>qPRtoZh_DZWn(qcK=ybXpn7gH$j_ z-D-wfDNS16*tG>5N6m9pq$4^&|D-UaLvQzJ)aQYV41OZT{%iDTL;>S$;g zF5EVHM-jG$Fy?OY9&1sbU`jM0;p5~LtG`3uigKDZ8_!I%Vmv8C{iA9FWcth+GKMww zeBdNJrj>b=S)5KWW7rDp^@r&TyGC+;>avcFtxJViNwkL=f%_&JGP2TcBB0byo)cXh zKA)Uy(vF96Rm6`SZI?F&_Aw8G!>o4x;Z~eCzI)OFjWPDX@nf1+m_7DAagAjlC_T>%t@ zG+;6TQzt&qW=KM*!Sc?n^41k2HiZkXu)eC7Z(*4j8YX*f-bq$Nl#G@K4mHXUSsTq+ z77b%l9~m<+7@3Em-yJ(lG^r%Z*Q%jjnXMIy-ZCMr?QllR=PE=)Co(#S`KB_u#kv{? zs!A-lT&0~!Xge58I~JR~&`i4Eo>-Y3^@Kw{qBi=)(;IUobL`mH-bEaAMGba|m(qia zW|O=!)Zeg6lsISPh8!zycpGj(?S+HY^~avWpv@LnW4;41+l!ZEs3_PBHQ^k<30w+D z6(LpN-q8a9rVNOL?HhCGEygqz5D5iugZ)D=vm~=!5;NM0vV?0LZAx!KN+W@aaD7qkeISmzWWw#+_$uz!c_w2oHnpyj{SJhXyp45P6k+6>RB zeA?i+tQZDif`T_=JV6%F0Dsk%ZyBd$G6w(0KWy@(xubPyOX;N*4UOxWKjVSe=7#q+ zY5fh(xDNT>eq04Y&3vULE2z!frfh7^-M z|1I)#)FUE_J#5@1KZ&p6%LY;uLF3HdD3r{lvb)9OV)?BSPmthjHBeOdYUSy4s=>Pi z((70CU8N~xm>`)!MGa~jAO|7%|7#pt=SKg#Oa{ww*5hllzWVh?JS*0lx#(nM+85jV`zPNX9ln0~t$vt;z*2WVtuL4t z6c7p6O6hficrz>uE+N9oL`+n~_X?QyM0ofa6vu--2u4)EZ)!6yLb0OALexV+1rFmuGVjttDCB>J|Pg)@}Qz+k3LL@`ZX?vRrgGqZHpYiz^N2$hj5N-K^8 zg${p!-YQ}f=KRIEIL>&3x{FNHz1uI61znb^)Eb2NPmFhl<-UoSXf<7mKhVgDpZ!|~ z`vZr$X}s#gs_wpSJyniaGrM*Oc`odjL@o4=JWY+PIr!Y!#Ib2#g-wg+e(dRKY=>yn zfS2|>s4ozF59{OoJ=aLHsCL4ljHt5Ca3ZIZ+Zq-@#dq_C2xKIVkWU_<*^)~zxr|r% zQ%kMPq5D>QOmEHB`U#vk(vUKmKd&Z#a`Jl0x)5oR05y>dyqLi;)%QXn$!2WERROB) zL-l`_kI*4GB-J~V?%1vi@k(O!#drv)F=X4+FJ@;$0&aGl!rkBy6_CPkq>Z8DfZ?-Q z4D*?;iBhV$Gz}BPM~Y#${i8btcVF%vu~0mf;oveUDHMNf(yE4oQGZsGwrf<^bqiHp zr8g>Bcg5;XhEJiaNlMLI48qNVW`skjNZggCh~CWQM42*M2%3m_e46B~)s7X%W%9|b zHw!h8 z>YvB~YqQRp!!$e2XPF&U>QuRCi=t}M2>UuC{5!AxCYrZC4>X6|!+ zHkYUQd@!stTnX^Dhz~GPh{ZOaA7Vxt{-QEum(3lxc+8rd1@9cD&smLfMM{(p8=^Z; zK?5teowW3mf(r$5JVt zWB^I54KhTJV$u8Al`!5p2N>HfDNa2(brH2{XRGI{T|v2VCI8p-?bawCwmMZS0PfGq zdP~k+&&{|NA+9iA_*>4xoRxL5VL>d`7;J*ZtG+%7()SEb4QOzwdTA8E;WQAgMtf@v zErYI|V7xB~A<8>V+)U}1^FzDQFtns$CmR8cCKPO)BM)0z$P%Pk>YO(3HJYZ?Wcxe? zpsxqk@tzDUJImCt14f99^0!$&CD*FI%`(KP5)qcFeCQ`e7KCz%t#D&7XL5L+g~x=o zibp|jifN^$9nI^`GD8s?3VTes0+5x{@uO<%q{(3N&`}o@NOGh^V-wyQb9fRjf#G#} zTQbi+;?02NK$X*er79kGXxmcNG}?LTgR=!V^!c!6RETVG;-GN(GcDusYwKE+y9Bds zh>0HA>lPYAKNnHVtAVtN)@1DCQB1-DuoQRBv`6zU*ljJtMYirOCK)#lrO7aO)IACw z-sdmXSORxo@iaR$#eob!x)gUad*KKdl$FO+>4RSmzYzW6aY_C`4LL10Jf4gmaF zj$A&=9Ub;enU9H`wycsZ8xAt@eCcS@7S)*B=!; zQn`ToRA5GZ*&Tan9wCQnig0Z~7qSsJS-2ao+*Zand9}-ORV~JK)UL{Dpj8_TE7WMA zzFF&X32#FMF=wcWw*r&c4(5lN-K+cA5T_`pvKZYS?G^uENW^{Y6Nh2~5|n08gW zvbj`5aI7d&pQh%~_XS6{?tbMp>O1nt)@I&Sr{6sr(eBZ5p9&i==ZKBZSG$+yY@W9w z?zQ}lXkeEj3#PE>>Uhz9dO~}#68YqgNPTobs1&paZ+BtiV|r6<^CFrPwS&jZAH7D* zAuZ?B6u^3ihNbf%o5!!v>LzMjx_2!+Gu)wFM%1uw&znsrXXM<26W^@iD&IjPlI6te z-nqnW=q_ae>f878&ttLDunVyDTR`?K0Yc{HBV00C!fuayRr@AJ>3Lwj6;E-zsH>hr&?>>9|l7dh|geyq&L404;*q5GF zp8{unn4e8#8-5~A-RS?~SX=jxzhlia-y7&o8Ttm;ZZBW^$=P%ZO%c)m-66LBqyH-L z-`)6)f9>$^cf@~RU*Cx0zi%M^`{VVs-{Zgk7JoMWJ5N4`e=l*(>L?5RfZz>EdYs!H9yddALKr&UCy=POTnQ2DHuxE18PY&_Yv z)Ro-$3sidR_=@D&Y%oZUMRwEXJ>PqFOx%rzQ0E~&Y>f9SMyg;K8;%!?S~IX9XNsBB%dd1H-8u?^0nIwNXPeTlZ;^ki%CED zmfR#yolyRVO?&@x!=}=BXKPu1i_j@+H-8jk@T+uk$s8p$ns3PLWKnK67?OX)*v?hp zWgY8=*^^<>!LyT8EkV3}Duoz7AX8Rlz8e}ty8ni<^wa$d6Z^HsJ?V|x%CHkl?~}qN zL8j|##(0g50>W0NV4meL8?_a;j;jEvaOF=Y>>UFeE=^#IrXm6ec|40QlVV@_ty=Bo z4p`L2PJTZrrbV(m2qWeO5ycK1?Qn(m6eTRK)P3y{f_9v&scsF&xv+X;N;ocy*`$Zk z8oJ@~Aeh>H`Vu*9Q*>Bv>g8tK(NQo4H4tc{2#q7=+~HsQxhw55ARQ83DM4$B0bgO} z3e*oZO;!F3=6*q)GA}qyc)_C0c1UiO?T(TX-n+>L0S3zOA^z=+Ixv$8`Z!w zNj)y_s-a?37m2dQg!EuCybZ))u8vAFTwx4B*0(3#}^h!tv?uIn?s+Qdyk?p1k5x!wiGc;){-YWCPT*~Ql;qLS0Ia$(_j z4|pKGrYsE7xMv1(ZYuotwrLB;py<6zCm*{k!uG}haZ#w={X0spvc{I0WOOGzr$Z*0 zhgyDp_Gi%zt~%d+7}iy3;?6VNYD0w^%0q-((vt4|5MkHq&YFAdiBD}Npc!NRSkqU>RyL(DdwetlKy51c9hHxHdFtjlot!s) zyh?9~z<8cUIT-qG-Uu@gzgCJFzh$Byza!G3ubSrh+br!@8O^{a8L1G5&+*>NgYA>o zN4vEyxvx8?KkObI?;RdAe|&Lx^lJOWe~U}rIYl_rT1F9W_C_qd15;pL8p9edOv6k@ z$IiEM3e*nAO89SqA)!x>(TMC@k%aUm-r_keBV7vVQ6Qy@Zu9jivQ!L%s~gH{Bf3Tn zQ8kzHDhZygFn`a{{O7Ctu-D_CED^isYko#??n#v!&sTY$ZUq$wUWrV-rlY|trTzKy zcz8b#e6*4lpTM&Nlt{OCPzP%@G^+n@71{r%|0??5ycp(ZzqSH+vHthV$7^41RQ11K zeDUS)`rqH;&+30=@>v1wXa;To`^ny;!=#P-xbn7~W>+1({`o*PFcn_W1MlxWyN4RM z2eA@b;P5J&Oh!fg3Sfc5O0sg=&x_hCbh7deOu^lH=5%&Ld1IY&D(?a$(2lBTbD&A| zCLCm-*UQFJiC}x>4s^a$YYmEVHfkkj8O(7?Z+fPqk05vC>4H1EPxaDncuE(nD2A`? zxbzHg&eLpE(w!ab?ym?W-pz>CQ!Q!#^wr_>-Q6EgI$>t?)q|z8CA~yLC2^czDf=pQ z(md?a-%PI4x1T-y=8ez)cA4rkp&?AW^%{@0Kvy2-NhA5uD=7O~e_d;l)^|GTT};|b zu9~H8vfRdZ$IKFTf*@Ollh9;;*domNHcre=`{6^Xs!L`y;_h8u<`lzWc{U%ByPXh+uvR8tSy+62U5|#R)p8xWM#dh+fqBjE1>@B zj#+$mtIE7CasE1+#b|h&EKQamr!HN8z>Ip@bJxV$Iqg_#{r=sd)f2{ znc4%F4L{_9&ZQsNGP&n}nb^aQ`O|*8zO`e`N|ywSF*#4qVf1`3Rg@$&8a9L@KsD=oZ~;%od&s zd9K47iC;xLQ^+)$T|Icu^QRAST0-ousFFukCH_XqS(=(?bSf2MKpudzN`TF+`PrpCfeX;lB zgQZjVd&zvj`_uj1g9m#1?bCK1S^EUCss$`%4-88MA7DHyZ+WR=QB}KB_p?q`%%%Fe4xwp>BH5_l>ZXZ0~-?g?G zc}YiHzdc4d1I&CoXmtq-F;}BbkJDuO>GMg7P(*r!C_ZaL=L9CH*lO5!Y7f+g8Wmm=ImSYoi)%l7G6!gE8^s#w4&BVwn zvyqhifI3Nxlo1~8g_c+^UI z9}pBC)LN0TD?3&vCJGUl4u@={&1JT1_?+TOH!fFAp?i|nyJF~uX6VuqWF33uC46r~ zxKav7z1cjGW`nXYBMq z-odOHklva$_~D^WzptGRb1N3eqSL$_6{Cz#gpS_CY31G@0x1D?3#4;hVMn_!_l{4F z{_NPb-5X?6ZG9B7ZoZ zUIwPYVjX6VL%QX0#}t)O>!Y~Fe%Ao+hQ@o6ozI5pgfmtaw40Q{$1P~&23EvY!UfdG zE)fIN$p)jCs5WJQZJoc4F{5n>+`XtClYUVot`3G){C2Ik+Yb)eG1YO+)q$J-ot?{*Pq6Ku4C(1O< z+ncI&nzJ{@AGbGYvi17ZZpZ8<>xHHo6&5pljmu;FAG1E<&Aw=^$8FKTFP!e6E=(Hc zyh=UBRqFBatDzz@U5)Qc?&`EeGPgfsnex|aqnNLUpIHNIUm=48m@!AdyX%CO%*}G2 zlZ=#6MfR2TkCGbn!2hgd`j{)@w4~K14~<0MEHjw7IzPR~n9MsC*h$v&IK>3P287XJ z)35pa$qR~MFA0Lbt}VGp@~79FHC=&Ks_=X2P)T6TtP{wen(>e;vCcgRxOMb$fA3)T!N!+s-pgoqlMiz^XhvrmhqOc$q=R7T%|aBn zxN#njry&^$%hD3UmrGh^h+17ArIc6z!?315Uk9Nkm9H7!`SrTUgT zw8JJj#~$_7x^cR4TQJlPw%J2)XnW&ma1bSEXsfh|BQQ{{CX$_y6}PRX#n|nC0$-?v zbgT7#4vRI?uxz|ay5_fAe>i}rMd4QP=r$A?bT(BIqK-Re^CO9(*zS|r>AhP@d1bN) zWKu@L2+5DYLo=I2)y7li3z`%dQejXYtALC!9ptinfdCA$mH19PpO^sYQG0r_xKWr{ z*{)bOUZXmJ7&OgnqriS|0`8X!u>uX$Q$tX*SU;M(ojtiB%$j%;kS8JSgDyLfa}{MU z3lJbK!h0z*cmDMiYqwn~L6I&jLIYBT6WGBJIWx8Z}$6g9~xWRKlWV+O@c z70hs5(|`Q=FM}2$qeyrpuXkb~im+@vFoVH$A;E$zOTv!-2)SY|-=l)W!jYk>o5n_a zxL#4I&FxyWt71}v_0zP8{ECTabkexycvqY0a%^gCM}TlQ$C|eJKo?6&Z5@9 zOp4)Ecx5=E(v!&*&KUb5?O_GBhedIjq!%uACnO(LPe+SrCeE-e{3|+p+GphEYP(B; zS*f6h>qP0%Z9oOXss}pde@$w9l}7j)qof zHeUCV_R&GIjCfOCMI3~`$!O*22>0oB<~;N!*R9~hA!>`uL|uh>3-v{#iFx#IIe+3c zFEkF9iB&=tmrJdB_z4p#8{8`=Z0K%cb2NIgea%92ZxmRJ>{E18=$~jPOWp4TmV(9mixyqImLhRhekS z0M@t-YmpR9r`@zrTH3k>Q6{$Mdj&WgCR>{z;svIG- ziU-+^Jjd0mjke5%KGGWMXT9;84RYk2j8;j{x`|)GrymJuOA0TI(nd<)ReiRxYP+jwu=!V$DP}w-y~jJTk`s#>bIL8@r_3}NNc>1 z5RB<2)zMit(QR~kl#8K933Q*d95qkF8l{~OC>*DKxMg-7HwC**DW}8@3FupuW@Ad^ zE-#wAZvwk_XDtJqcsz7*J)BpN98ION+n2`QFS#wgl20r@0v>qu2GJ4M)XFF=n}+PO{y@7qP%@ z4Qe8ro^}rxx-NZPXeUxy*XjB8@v+srD8?SFfB*Cu^DSqdwEBAv%n~*&+VJ^VpjCWL zA0nL4u$2Hh0j4lPDd9Cp=k-Ma^MgFF6TI38q(sCkcSw!-G-{(33Hz40!^ja?0cLRx zBvR)Q89`5!lt*MW3~*%pQWECSMLHf6=C+53CGZ|8REcf!HRNG8GOu5}fP?2>cFCa9 z(B}brXJFFYmmYg_j9RJ@r|pt6OV%?>Yc|HXIIb2aG7U;G(e6cfh!u-nFHY{CIx0ZG zf1jVZ$z)x&w!7EZqz3GM+kk+jiDkiAw+Nl9wqxj(3VwTx74zp zYAhU&E=;@@K@KQ~j=<_84MRE+PQ}5;K}?Htn)IHy6_(5|~H2q1=R3 z7bOsY%6MOm=WHrUGJ;3!0EM^5-3ZsJTP<6!HyT#mXc8|wl)6>TA1+JpGq+7-4DG5Z zmOUNQ0j>^rMGWOa*hX%6Yh+v*tq+=>+SrC62~-OX`r0!kjZ6g30;yRv5uPldt(&h^;!9V?WDWFHRh>jC;ZhyWpmXh>HL&$Hx?W;B$1d4fOK+RHeLc~f-WLH zz}bt~_+gg9jzs7m#Y5y0INWm8QmgdjND4`|!huLCx}drvG!>GU9xCH8Ej%X@5vYpP z4VH@n*6^K(oJs@`?PvmLEQw0eJ94aSmC?W_kycSc2vgS{Qn;DDgX5F!o$nUhVc0GT zel;Ot_-<`-c`GaAUnpami~{0E&=^BS#5WuYxN~yw`qeXd5ol7s!G^dq7vQzfhxnQ# zT*b>N1&Xx0c6Vk4Q+C60zoYPdTQ~(jaA)>PFRO{}P*vQHV7^2_zr?y@WGs7F@K`dPejhDd1vMv=2`*vKsfJ6PXCdS5Ii(ws ziXMbBDArk^VNAeSk=X2zK(_);Kmr#$^#`H}<}*SBcA_G4tOgd^Ake9{Pm#y#)(stA zleN3Xdzb1jkGjc51WmGc*VTXZdTx&S!=2{rv5^qoh!Fr?<+Rs3-cU6H8Ed;AlHbtF zTJ{YK$Q>+=q8pTS$U*G*b2U16#T=#I#OGOj{mV$}hFp zXoRP-WtM1sT~r$p+)w8n57QNv0<5KI6)=AIh~qza)=!UOFI0=8#>j9x67xn4$@O|Q zrR@>jt4<4Zp}#Vc8KGqx-O5tKt5Y)Cw8BdWU}i%ii}IGXF9Ok|?%NZR=5P;!>GYy6 z7$F4xQXYse)eyvhk^wyml*w&@7|eeo+;k&C0VTe2v?V<^G_`pZeO4}YYc^pkBgTEV z7FdnrRiD$K7^6${bc%zQ?08u2F%7qiG^o9ZITRLbzI9mR?hGq)&LwPe@!4p3mI%cZQaRUyVpvHJjBtu-@2Yt+(g2_AXeE!s%jpCC~D@b{O`2v z;P5N4r25zt*^QIHh7>i6BF1yn?=aj1ppmJ4P+l4WiE5*h8Gqj-gRv`OI%p5razVl~ zp1yc>az~6kxY+KUzTVye>Q#*#qqcf=PpZ{%_dldI88EIeFn?5^@(+G;_pCK<-Z2II~45D^9P zHg+@uZPiqxsaZePTA7v)0uvOq5pK*)O_W5uMkp3!(a+vMN%`~f?(TP|$Ga!pgnsS3 zK9XO%2hZPcR`c@u;@>C(hA$--gfQq!@DrI$@Q)KDmUx<|lsSWhwiK}}$AX#K=5uMj zDnGIc4LyEr%=*oSeymc7_w5$Q0g_7fU1$8*b3WF{FoM|Ad|R$E6x^`$m&n)G#<2u= z&Di~#05^#lChn(qR+sj0=iU_Kw@pUp#rXb$1FI+k!(hlogI#0P#o!$;d%J%1Us-3< zcW1M~2QIbKy~BfNFS?2Q_l5ks|LnzwEwWL8#Wk1>hxiw4{I9Uekblu4EB`)sku_;Q zgRh#5Q+r_Rz+88|Hl_Ug9bRne#1_%Ks#6`HgccCJhGGSNXbuhR)T@jZz{gkUC#Io_ z*lnp)o6lCjXY;ZguMVo_C_7IGij9|uYsAm&J-^iTUZC&0^qQK$uj!|}W@Ln}x7?T4 zBti0P`YEqr{l{6p4{As+ z@k8F}>Gxe7PCu&CX{F-;CvkFu5}Gcb;xO(^E{dU#?tp~nJ!;;0PuhHX z8v0^hsxU?G^=hJCN@!x!-lIN@vg?KZ@O+1>DQW`~d)8wsl6qE0CCFj8;Ikv_ zI2TyfhLS@;bSrn}TZ9}cT(JiSmyuNSRT@yKoLX&aZ!9Eo3R(d}p_5r1iBB6cH4LciQl(0)Mw=3#dWVf(Uze^Rwi)p{f!Ocs$mL0fUC~?)?r9Z%b zyM}{cM@d++OYcfw;ix=!zoIJld$^)qR+lkdL7nI2R3kyYpR;_qZ}r@cub72p=&F2m z`22MH`@KZqm@&Jjd9jFUxGl;qBJPJ;QeZ>-k`qIIWCX(&W;j(?Z>p<+0S<^}o258f z_Qv&%-tekvN=>`Ny0-DV`5D|6Ql4vx9~LzDt=?)@7`jayk;603E+@f$O!y)N2 zSNfSFoK7s9wk-PGJ#nJ*!HD3~xDlrp0dLN~vFL-^)~C(!0vmvwh2LlmXQx-$Rg1dP z8p>~Yhe&AMMW+#Gttao5ZS%>$GsaR|7hAFM$nr8x9??JL;?^uS+tk z=_W0fVp|$yy)~Xr`Z*8|TYATGT}&)yRh2Tq7%za2xeA^)l}<)YS6&1n}TR0--Ko|w&t9_ zCthtsh@CEzTtHBKNL%?n7NP4hPcgbIzt$|`A*GaroX+P>p5mgfS}d071NR?PE!Mbp z3gGTRT1Z_lB#sP=Vxs=s!{U5He}_@02@bR9&Fl$Zu{C7}`t}LAYC4js8FBSm&UzQJ z=r;a`pk>(i3l*H_?||IJ#S`RxNAUI5W+VS%waUECSHKZM&2+it#;`-;;t9aJK zVtia&^X>0O(sn&ScR$bI&91)veUzOf+Nql+tWND6`^x|}4waF!0$UK;!01?}Pnbk=@OVrU;$fq5 zATnXBTdZTnQwg7C^PJ$OgRyePRnmt(6AU4jX;gn87WEKsjxjI$=Wtax8f* z>yj2N#*z+LbgDHYTv_k99J*ZcIWP=?BXNdV-D{1w>zx`*rPChg+N`Bj19h|AqRKHfb#`Q*Q5bgmyzjB#^VbD?yA>k1Fn z2fdD=BmP~0VK%2;$Q7JJNojqW-HhA4E}?%%MR$`naM{_Ik-!Oc36yNs1!s2w2Y@{X z9W-_)&JZGYbnXjuQ{4ku6u4+d_)L9kof<~9ZA=pob*=eXXJO@4lxm(nKWlQDkqP2? z0y&pF*y=$gW@&z!j&n*H)fis4hiH*hIqcfLWELM@^15uNK415$JnuZH7U%L2jJf-! z=cGo=psBe|CnLHCPtQO`W}}()hAyk_!tK`wua9@1hvxG$(=rYLabp^)I}b*8@LNo! zdLTIu!K{|@MTj(o`m~DyUlFd}%@%5K+Z(^ksf7fmsJNYX9#CpLxHXuYAOb$oI7*c) zH>Gn_*QW}!peZFNk*0LNo080I8cVR65`&vDRnv20q2%FED-~~>l1Hf*B^pPmnnwpz zHuQ*TuB2n0kWH7AvoyrhEjc{C*5=ms$0_n2Z@jix*zyV$w%ay)hnp5{NvS)kh1@>t zt=Z(mi*m5%C)Nr=6H^pPs%vc)fFaYOAGm4<69kKRr#S zuDh<2+39J!O`m4u_#30aM{w>Dnmb_v%qhE{^@im*>xFV_kpxVJN&tYsY=LxuyuQmP zaGqEZ;f#z%B{E&PN%t$lmRpXD4x6?b#&wb}#8stTW;k4@&U3azeOcEIv$ZM9Qd$1D|Z|9JfE;n4{|>1;5o=*xpI)~ZWo zPuzM*YQu2x1qboSETehREwJYu55@)At_S?tbO>89R)9l0@y{>Ue4pEu0eh&!l)VFS zxXfD7{EDy5dp)q+e(`xT^^bw+QyBrNfMPHy?skcO#u-PqaQ`F8izOnP|t z;K7%V>#tuuc(4&M8dv!!2=1Y?#_OfJ+~DQH_7c%r3$GtM-l&eL?#zBRmW?@bBB5Io zJIwdF4S747!fD$*>Nk*ZH;S%>sY^k#4(~@2A_rN@$4Rco42~@cBjrYI#`2h(u^qRS zIZQZ~GKtfq-*MwBx}K_-wwmlsd8-l%70}tlv1FJCb4*?VIqVC2Z?RcrDS}Nu~(+ z{%#gd!MC_tYhWM1&jVvE?Nf@1;9$O>l|M&~-n3oZd|x|ViJ;5Gz|Z*_y1dB>&h31V z_mWhaPyXR)!gVRo2HQzL>SqAx?mvQU&6WF?nv%`y2+AicCyHJccP09U&iJTOv1B@@ zM8=SsQ>2dGB`V6jb$F8(;L zP+ev?UMZV9Ts$4na4qf|4i$HHzoTn^_MRyj{E|;2*2IIrv+}T?Ln(_0*{TmgFb4Y8 zP9L3hTAjLRA=T$DZ>2Bt)^#H7p0Qda1T!0+a<@GwvN=#rZk`^U{-Rpj=VHC76e(Spb4>>#vMSc zPh{i*I^6-ZE$*1)x{wJQITs+9?|IC?NYLCtl%?x?5D?k`=Y0Ys9pF|&xd&=Kt`MY$O z5mq8IYe)!0a{6lz@Us^0VmR_BRv6(1Qi>Rq7;! zaT_&v+E~S#a%llel{Qj6WuIHOq?4}`Xz%Fl*9=^Pw@A>T0v~SS#b)x}ZZ5@^$vxy? zV;3A(U+;o@={FaJXbf=*&%mQ@P|MQJvim>uirO6%M!ku)IR=&adSYSR>`rYc*+9MK zwb60>^)|YfH3IOE2|y)fIXkPRTxm>sH5=AaE;pu}jjoU~1VmhMN$bh7zqLbYQsCBB zV~N9QJ?YoYDYJ%@&4r#f6#BF|WkaD)n+wg$Q95dyzJF@E>)v;YIbc26^HG$irGB}oaI2j_zl|}OH_R({4xj)%GJ~7NS)aCH4RY%D2Bs6eWNK^+J~uK zEYcNZH*u|-uXbNGbh1Zrov*U1MV-7W14TalnW)c8*Qk}J=RJ3FK*bGTKW+WaDXjL- zd+N-`4Yp0@e}A$4N5%dJ9RIIu{d1T7&)VaSFKYHbkJs0JxBvMq{;d5EPd;1!)IsFg zZa5v~?u?X+B-Y^xvTi|?ht>t$YQ}4A@|QGKS(ae&y4Jy4!-X%u6#ePy!^PjlVwvoo$&T{ z-^;s%BRajFjZ1icl#xjZ`HA8aDGByhp3(y>boV>vxTwZ3@WBT-_MJffx6d4Vk?hcf z@6XbX>U+F~+v|INc;$7JtJRnVufP9cd;h`4mtUIsoQ?C6w}%-do(9mc6;r`DOqvju^PN0B-dRMa_soojxEi}ds+fZeFiAILctOOe49UOPDjJJrIbQo zeC}`pw|~ew?oo`DUyINA{jd42!vD?EVSe^&Gk|ySe;ezMzcBpY7vTTC_~Ogo`M=-d z&+>mV`C|S(OM~iQsCR_-{;v zM^=Qdw{h=({Q3m~bNj!g(9-eQ8j<%`XjK z?o`3Pbr4Am5E@(qe+8( z!zT=K&Uv7$VJH;$0A$2&@;Peo9^)n#)We*UJ*fe`O&W6cz5r_@7MHt+e?f-7BjnB& zr||&;`+3Px7&wrS1TbQ_Bz87-+2HN1t=AYT!H9RcjU*2rYW!i9AOAw4dR27fF=Vsw zBkFF#z3%eSv5ao>5MvNs&HK`LP9|`v*+kwVxqF9yOefbiL(4gyIKv4fE5GcIfeP^h zcmnFq=DNzbo7y?<$ypU$TXDYC>0Q2FZTj0rZhj2Q%od+M{F6cS6KFYJp6$PPIQ+q1 zIyKB|nB-af))-C^0RKopSS_3WW2EsSBQ%SWUPBZ9JH<}o62qRs27pnG;4+f4n?|%d zi!cXyzE)OZ&|?1Y6;P%qQYC7^h36=FLcaxdA|I{dKL0w)fVv9ZBaNgK?sk1|eA_;w zZ8h#DR{||SX;!v$0%*NF^p9t#l(%l@EP1G}Lk@%Vy7vEJ|M$xIUyMnz`gJt`cgp`? z+54Zz?)-NTzn}lV$)7#{{p2$ba7b3?ENb8TR>#;BNO7kZ=3?8wix2(ax9#@(;nDNm zqvY^=a?6~HbtWZwMlyTAV4KJD-Nr#=7c#oq4zb6*LqYruV~250X%j5h~)Heq-aj@FFOXB@2t z2DNF~%X9Mn6+a2a9!`hji`0oGjzckb5eJ6{+YcVB-K?!wY{LA9wFeY(k+Hv!Qw{j& z!u9#{-4`Bdk(_MVB9Mpj&Fh_Sw~q+Z;$gC(><E{UQHw#vVU@@d5v!>WxtKhh&w1DC7E9-4Ff;RX_Gs$Dco-YI$7$^1lD9 zeMwb+5qj<4-~XSF&WNhNyrb$xz5eo-_4=!SU$6i03wli}98{$H!T+G@KT6dfSHdr< z`v3m>s!soXRiFLRs$&}WAyxPOeZB7g`>M`yJ17&+q*IZ}4aNf0}&e{t5eO0MKs7=)Pin!&m7j6=19nFz|MT zTKgYw-@Wg^V@PD-FLy$U@KIZ%i&#Bxmd%9RUx~czWigy2g;>i&|2%&tRDj z7$4Yi<@tDcOOS16x7PpMgMPH8Ee~x5U(ms@xGqLhr_JJ;lwD&9`W)iFm+r- z1Zz~PU;6~HhOdk_pvTsG)Xq8zB`03c)X3s0yM{v{qrTkKk&>PyPg^#s^Cm+FttyZFLE_n^?1P&FdKMn47G|O)KDnBvGIwjgG^)=u$udq=nS z``xo{G3t(_$p%1+(t^-Q`cn#Ta|Tz!V$@lVqgb^oZ)!^tHstKymf${|XfVGu<(9E$ zBY&qXod-=Bq(*WFZOEBobfiXfFlnkYG+c^_%Nb=jBc`r?#&28h^82eWCVpn%fY+&I zf0y;96!i}aV}2>7A&X0*&7Jk7KwfAKyFRR!ZgW!_ddluo=x=)7)j6_lEL~ylTQ%#s zJ4t=n@4BN5uJ_b}?zBtW0>lP1sQs?9#Y2$j7$7s^1KO;g69MdW&44WMh_btnYjYX0 z`dsS5*On&ly2Y?R3geixD{Zq&|6SLTVq}EF)%{xN|6+n*ve#Q%UQF`Qr5RQl&p{a) z+c20mleSt1GZ~cKN`=8|LqN>zc~Cdke8kvttkDES5Kv+Wp<#F{_Mg^yWH}ncss)f3 z$H0`y8_2j(rC#1+BcRcyg#v5=wCZ$J>BqdbTs5x{GmTsj z2;%=ATv%4*e1T$+g{6& zOKuI!Z};Gb7{<@Nc<^8e|18DWXUU(oj}G<@UOs^p=xs4e7)gQwUMBra5b6QpLtP=c z)Csf6x$AYZ#1>TAv?a6}>HHhIF(hyDc;J$L<~RW!uL_hTsWwl(JKa8bo@`b6-o=M! zN4wkKbve=VLwdElf4u8|?7iTh2b`SDtoYaA5&!E5^~v7hft2y`@Ptc|jC%+4&;H@g z_CEbO*pq(`Pv~DM=4ki(-R%=8gl%Ey{mHkx^5f_=SN!_mM2h&+w|o1$T^B9WA5Dlqkmp<`TP9O!LBss_*<^+_}e2Lr)N8d`-j}D-NR#f`(pn@ zdd&aA$A>eX9Jw_?s^SQIzdlv|!ujdi>D;63liF>7(^OI`8 z&m1pKjv32xd0K9M^4`&ktG&^nkofW0RXTFiqO?KRIp~59n?Vq>$qDwL57kXO5`{}? zCf)oD6j`ehkYs`l123U>5SsA|{J4xDoAU#9rs0Xid#|(ha2u2Pzpb59hkwRt@ zv{}8`1YlPZl#d@mv=Fu`2I4=j8Rn)&8BZ5yB3o>F%i&}+C?chGlY}o~YmGFn2YAcl zk+jt6x+RN}-d38!NzM0RQCy}MS=yI!-D5(}HmUUZg&Pgwj0R;~u1ADy^LTcmjFzRs zys^c+?QUFmdJnCwY8B_)t;fKN(|7-iRj zXxonKjl!)@C!X7GhD1O?H`BO`D4{s+{CMgY^@7Ak1a`v&UaMCxA?RCzf6Ac|DSS*jW%NE zbUsi7puAQH&=+?hJDralQ{J9-5qjYB_O!F|6ffT7Zv*dq?znN_E+N6lCCE?R3-cND zgK(MX>ueRz=GJ4FrEJ-E2H-h&x(?jwx&o`fvW!vXuP^f6g?p8bi>p-%9>@m6n(Eq_|O&S;o9ii*G;}Y_-*&U0vN`d|SY4 z#c*J*aRydEq$nY3lB&RvK(VC`ic*ij2f}ewLC&c_R1tBe49(}#@NBytggTOM2!_*q zmD1TCi?6E=+?TEd&BAkt=_PRb?#Sf;v05d{8cd2SES`6wvqvcuM}%RaszhH=xZL{w z7Kk_GR4?4fv>S23msv9^&$oOw*G}fSrF@)1Qd`O>S@q+q+7k-aKu1_;h(FD%eVJ3l zFUoDR#wq5Hq+>AL$N3{!E9ci9%V<*nwe7f1BLI?IUi^!i66Y+31?G5eqohWirh720 z-<~?o8$@Dm+oO0Uqx9po^>INLb9MFFB)Ve!pmxohAW+CT>(Hv#BuAG0-1zTNx+*P7bOFCR|>mpm;2_( zIndA;uOjcMOh5JHkWK zMVFtj1fpUHbEC6q$^tBU#&M?!JfwOm9-orf(w?iis&D~imi2i^qt_RJWP#b%{}}VH zAq^2`uf3TJ5naIjv$DddE*HuFY`MX>`1`HH=0ttjtO+FsL0`3XhB62oP&VyK$274EqsThJ6C-@QPptFe2{G z>;7{;b-8N|rQ1yMQ*ww1k;1u z^gtUz-+Z3hei$Nb$C&4)E8{D(>PE}6kG_CVhxY5@ttjFz9KV@x1o3IC4gnvTIMaAgqMta? zPd3pj_e>OAh7IGHm)8i-+dikQNbPWh`OQ!6DCb3mjEw8KFy>nbp zHkn+N=Q{Y~A>4PcR1l*HZX?qR46tLU!;-L5ArVTOXrP9{iY6%@*@ml1>Uw3AU1MJ= z#+@1JJ1Le~yEVJ#IL>H=0yJ;KwMr&gvV3Zrlf-O|DE%fIi#YjYg#!%&hOC&}uJGOB zRaTbixh!`(Im-CB<~tr9LCvWByRYD?bo^4G0C!H^Ea8ijMK;cRMcbC4oGeivIyE>x zrCl*x^IZ#=Pkusjqb)%zg>Dz(tMt29`6u^Wo3z|C8a53aT#<-8@XBK03rkBlHh&~Z z^6A7SnPa^<^ro8?_WXj^Vq~O}BrkUkskUUf*bKtZw3wzt=D^t6V5;=kaa~$MAsK0n zXa>Pw6uD6N{DP-^M=bH_2>>y$&2NSn=hk1> zT55Da?o4akJkJjE;M*&EM-ORGSyWswuC?KF_1XDAuZCSKH*^!(zYvVH{VEJ#NH*(D zvs?~BKh^Z0RpI4MsuB1Z@P41`{(nO}sE%;g@A3{Y%)%PGET2M#(Ou#wpvOlRo?dqc z749;00z2&9Q=Rc!Aq377gOYUII9`lUP6A^?Rm?a}>G+n~%-I&Xa|%J` z(;xAxWx+XeA=K5^_x_VmBQt7SUcZt&LJU1AiUuz_*lZt_xmMVFGjIIHF{8X6m&0u$Vox^vQ6*{d)Er#}NkvZ>dq-Z|j zXd^mAwQqugN`ae9O_|`(zEdWQHUripzPXVGDME}#(I8PLBW*1ZSVP8CQu^YF`}-y&tkCh0Wlp_0YOg0d1uV= zw?}lwu!=|!VC~HDdaX{Mo4Qb8+c`bl1ra>q;=FDK5RI{m`a$zZd3oV zoAEI3g#tzD==TnkX;Yw)cCD8}Xb!Cf0awqSLV#1`_ zZ4l^UR>bamnkfg|6>MX2!wiZs;$K;e)Ud@~I7<8d39Nk()|c*TSJ`u(lH(MD@;S}P z5uq3jZ|Brpc0)8{MJ6C<0dUxkJW9Y{YFKgscZ$YEb;p8gP+CJ^Ae6HWQdd)=&m!3Y zODpJHk>{s6x8*r86$iXXeYdoXMaJEXi1L^vWmZ5_Bl77tHF}6t!lA(4Dla|J6zVvF zE^dhU(bLSFCTLb@52L96#OnEO0pKUQRXj z>iEstTPqyeP3ivQ$OcV>)%YU|6P?#=;jEcw^f<@CO{1`}2?ve0WS@DVyg@jsZ2QuH z6}XY08X*Bw_`|lAF5A7n*&Bo+qU*1ZcaNTLpKNn;sZ=ct?&XwsCX&)j1f|)^Qzqu6 zJV^#MTRgjWE3K!d;T z|K-Z`*RA6&```6H)bM}4c>MeQ|8MeV@Bd};=Ldi#QS~`e8Gs%kymSwS1LNLNHf)c3-DGUzuDUlJM~B)Fw&B!=hjpmqyEfjfJjGWA?9eQ5!J1wa#U=UkXsA{H0)Z}8o+6Bx zf7J;=NGF#P=!`Yq2<8gEAGE6_%1AoNaNU`nmBkR}mUX3KUZUl`Rq|PjgY9R>`+Enw zdj~HLAGBB2ZvMCyYziDHuLMG+%Y(AS!0nCLQ-+qnpYoG$an!lexE-jG1EKo%0Hnon z5ZB_ScwNw~#C1t_)*k7o6tiaQCF$C+_otI@UEv*TDIxD3tZ)3W0+nh_$6mth4O2r- zQ_LsSlYer&HhLLNpl{Zn_6{Cz z%$>TOqm$F)-JRD*yQc?-rvjE@o8Fv&EuiEyU>wkWezbgJy?-$`eS-_`{a_u1DJA-S-hr4_DXfYq^0&?D~ydWT~ zyM00!DddA3Ma)a_wr>Wz3Qo&#WgnKE2kt*BPu13VEBX6*Hto^7zmp;=D6d?Sz48F| zWuvSiCk%x~EqG+qUQb#b8-dTm0tI7*dKkU{h*2g!7GIJqxr1q`n=GA8vh)%^`UU=r zi$(o6A1tvrvy^dK0(7Py#f1J5YK-6K#gqyNnR0qh>jghXIsa2k@eda;$;Mea)eNkw z$9s2F^1qWA)dwJK%1xF(n*Pxvyjor5|I$BOTlnu&`tR5D-+yjt@~^+9Z%^^xCr>Cv zRt%o{&#YRb&tK>4?adF+!tgI%CQp|L;mJ=ZZ0b+laGvT?NZNSSh7r1%!cNz(l}<1j z@{(P4H|h!G%L;^vH9R8Q{szF49$z8_G#}jUxOQnwVIRj9FK~}_rfApn78gC76+pdl z>|6lKME1z_9Jqegi>OB%{(4!uOM|pD6k?{ga4E*TmOS)hd>gjZMAC z`imF|$yan#poqDIj>e8X;}OUvZz`RC`0%Y-9uQV@uM%0g5%ni_KnXxY&Gw`UHYYYz zeAS(e-WjZ-CL`0V;~g>H5i?0fDvUE1a`Khg7B0-bw)kS|uu?S}FioV3{6H{(>EQ>q z)*6`3cK*y~V!!_DUq94|n3xdo^!h2~u~?~$#oMrjb+8!nPK_&JlFs)Bj=Blt z9^28`sqfS;`xlH)iB6Q&v7xB3-C$#ZS{OrdSk_86W+M$J;Pht7;A)GPNO_%4dl%Ak z-5_ptW(w~2#6K~@-;*fCi~W<3VDI4Mi8Rq40xYX7XMus;#Hg_^rrf_#MFYg0CVKrj(_5AU<<64aWYTl}l2vPN(Uc z+T&|n5y>pEMUMY`aI*cQknfMd8H1*sy)f;0<$F0@)e)}REme%>v4+!8@1mHL><*Wd zFr3XMty26qBwB;}O2HO#3TrrxT?U8^BC{07kg1CyYZOQYvB?N|Ktal{_|9)?!+=l& zvc5zp$tLielNcIoYev2$W#qF=0XQ7pm`%ip3X$qdHj63<9&t?2O5~b28|8nSdCwk> za^k_5G%G>*k?B>LO`ll1EI`3d$Seyl0fi!_-Y~wVD_-i88$!oW4YPOYXu6vGDI*<@ zDTafYXfXmig!Z0E>=zzmM5WL>1UF}WmmqzYx}hYO!hPIIb!CJd>wlh&1jUst#K;Jg zV{7E40iXTFfP3EQS6K_;*7hqPp7U&xhA~r7wJNP#?QtoJ7DU_Uf{bEyr+zw}=B4A^ z+eJr>!+AvyF=n@kK==mdLNv@xol8a-U}LLiQPUOkl4c*tShyB&g=y3M>b zt;e~UzJn>z#yi~KPm8f*X(HAEprXCYq#VQa!Fc$q|Fi2TTMN*Dz2nXb*zVQ1n52^& zD}nZkT~)yh-N5<~zr&o7*sJa zRJ6ALWMlYp$6IRh(5$RP{tVIvvJv4ys(WNxO6H{A3G?H0UoWNyq|m&~$Dqz6!nz@K zn;v)pZH8Gx-oK8z$zR=S{Obt+btC!L$zMkuV^vSgbk3##QgRFt=^1MHRBu^9s$!{L zlc#A6RMZl;XV+jBs}X$0$1oA;}qBX$K#!Jc=M3l);IOEi*iAWKwW%MCvJbY&T zZYCjrKdnT6?cYGK;)it9kKwCmxI8Oy~cIFc@3z zKP|D}hY=G6W9ooHp$MEXC7tz;n!B{I@KDaCHT(_t?hWEOZv~FNq3cMs_O?NPhY#y- zy#}SKHTr-Nq9x`;`)9jH91q*a&hz$j?)TqjIhlW*VQpi~u9?A<@Y)cq%A`g7w>ug( z+=gm--gAIKyV;T&g|prI zqLXr%m;L-apV}46r)A?}#M+iZ-HKmpQB=IJd-&A4`Ef}Y!;9=D?PtCGDjj-mP@DPv zc*z@cZ*E#Af@*=tAqDF6(cBruLahxe50}(OZH&baO`_(7+k|fo_L69HZt5e^q;g+v zaa&rnK3ky?bG9#4K{|Eaz*66kBGJbq&nH8vTg$D^S&t9^QpXx#`vlaUT5XC6(}P@> zuprB*>NTx{=wkRtSn6yFG#Wa7G%G?@W{#xtKy|%$*R(X&ysfQP znLJE3HiMgGm)pU|0mhO&jXZUd`VuE&aduLa70HJCN4~k9E?dV<$DlhIouwByXRcFQ ztE*VzdcatcrT!?6$#v}JxQRWNBx*surlhD`NQO$|NcMTdg|| zQfd@?02&FWc31<;nA`70Kk&s*V4ghVG;2t+ZojS7y}pUKLveE2EbvzeeDL?l#zEE* z_BG~lBMy?2w8YJtZ>|ct zS2b%ybJbCo^ryRre|aKG07KCvLB*yRuKO~UZhDru(MxV}5RVp8>ylTw)~sil^>0!; zHcCdgfb^S&lw+TjaDQ{-L)2R4?X!MosY^^&S1mZTfV%onwCf=W9~yD|3~vMD$Kkyl zF1K%<_yH83JlU-z$P&*v?wBO^SRij(cGQyu7rW3mI$3QTTKm4z?#AXhY50l$oJ37E zht#NL2BE&HqTYS#xg!-q)yPXvd5mQO>*BH zEji6m&$4$FMT*SgFnt`d?m5>YjutP z!b1m6N(p(&ZR$U9)WR`dtr`CFbBk{VSwP_-zw-oiSw-6{vs$&$Al3p!FJ0v&2VnTQ zwd4oZjwU-6!^oE9KwPJR4aB90X^yZjA-s33eVuvB%I_oQVk)hk092s8cJqf9{5MOU zK6P{Mn*RFa#mXP$-h(VDV3n$;VP$m$$n1M#>aO0c~!SS;$_uEXc4Uc0C`htaLo-Y9SXq|Et#y zdf-*6cO-c9wt4S6a+fOZFzzfWLCrq)C8OJx$@d_qDAcEGQtW?XsAn-j%&;J-fM@NE=~S`wL?sN zGyjgE?q|b!nwmLOhcHN8Hh@OshNE_lm7R!8RE|rR^TU|uW`@(UufivPGy@tqyZFVV z^?{X}L;54?|7*(&3cONO+%7GfN4(0W!h@yO-iA*WrZFbRqIpEEbxtIzaN#V4=BMC` z2@x)BZ8C?=OV8E5SxbH9Q=i=<^}wed+#~hKrykuS^~9&1+#~hWr=H#;^*f*X-91v@ zNNU3*@oe3dapp1_dcG+F&ZwA^z9Pd!>~@0;Tp3F!rRNp=*HG|M_}Qw|(W|IZ?&=_k z&{3BHZs{b263D9y2}B7}Ni6VjL;mhJ*x%E!3A5`&DROlok*bVyE+WwDF@dJNRLR`H zH9)!Mno>=v)Y9=CXhtK~WTvTE)v-X<r`I)uaFi^Nag;~=C7e=N+UyaHB z@hiu(R=xYwEz|U5u?k?pc@Tv9JA{pJ?6X|*u~Pp19Hi$<_;v0Q?i2UBfLfqt`Q#(? zdv%Rah@ngKQ8~TmZqNlvrzF%c2tTLc=R03-orcvH@q(IGd_nFfT@9?bf7_yd>?|&~ zK{?_|@tSz|JET>-K+^t8@gG(?E8LZ_C!t%)`6ea=K`9NJ38PH36yYxATT3&xC<0?Y zpG-M&ujRsRQ&HX1E#QF0)Um2mr+orLkS;5&!e+BwYCMz{G}nX164*?=#jDisssnL2|u&UpLZ5hl!vAWCr zYCOCRHwgD$F!N`)ael)E3F#$mYQ3;y*`Y}r?XP&LLH;VU^@c9G64g|cS+5A!WR*P- zi!XZk+R^Z&eU2!joA^zud5pIrWq9-UHKsSLDc@>!I%W)Z|DSBOt*vN6tig!O)7*fs ze}x9@?@9x{ZfHPb0bj=j9Dlp7C44=<3t!La!qZ=&3oo?`Pw(4>r`0YTX$eo~cj4)r zEY@xB<_f?HukO z3hZU;$&>l5crvFIu>hv*0a0$T4Xonr)GM#_Cj|M!({wtOl-P6^iav`7i!~ z(8eYM3sn}22XD1ik&))6s+`4sxDQWY!pTisU9E@`cD!BUox_8j?URr^O5H%WKW#Qr z@-w(<_##`CHLkM9NT+#}*ZhR9`(GRW*JJOaJ97|LYI_*B||_{~Imqk7^@d zhBvGpSkTUqTPjzV^X!gzedT@kln-)PpiE*%uF8p6!x)xYiweKCU@77fG>Gl4Rb+@% zwL{at50a7YBOf)3M^T-zfEM?ZF~fC;+8#7~(V#_f&e-R1C0Ta@UF>^`KMdnaq(xhuVb&Jv}SG|jM`x5uGMIPn;svATzqh^ zXOb_rZO6@IKQA%(=UIeqj2Q}b`pgi?X@!5z?>%J*H!(C+-b^0DC@5b)p8Cc#4y7>w zZEEl7*tt7irL?L<|C2~ zlG|dIWR5EL34hF$;$BRW@uYB*am6;N;=xvovyphzx!380yfl2HyR3e3ZP-6WO823x z7PqPuQjsb0_j51GedkQ<+1k4xm7aJIxS_t} zfuhKvW5lCiv|beOg1ix7TG%gQZwvBI^?nvKe(>g;osmDG`ZOKwzT9(S$Dj8Op6~w1 zuf9Lp-9OxZetNR~Y=4(ch3T+>Rb)>cNdyrB?LWOL`hrNSN!^$`{&Cnxs+EmyQcp21 z#vvrpBUR!{)#@Dl=w30U`)&>14Kjq-%V!nTo^*C2FLmL%5iDsk7_9;m%8|0ew!wRH z6S0oLbTvJqfZF8c!t2slO?%Lt{nMlDTna`#9((6!jQvY+b75owJpI0_A2Bp;lf_BK zY40*UH>sS=TTRm|5Hi8-(~t_2TTMoz9+K?U3(AY|`S7^*xhTVDx2S60nPU%WUTvRz zTT676PA@_dn8ehQ;G#Apd0y`cp+|8FRtw|5?-`!QWpU|G5xG+NO+#54&|4}~x9rk^ zv2py@l5FRtD%5%_%x{Z5W3#E4;gInf2YM1`-(ZX5(u1q=c{i~V8MT~#2ACFVjnqD% zy@-U^W8IL4wwET4cbvaALzMwe<==g%{r-3FzY71SIA_0V9gF$DFCTvy#eZP@*T-wW z^MAj^pXL8_@|goXxgBSW$5{b^yk#-G--T(r&-& zuoZJB4E^hoh(Z{7?1ZqQP%c*ajFPZlEg5bS{<#UJbPj_-0qF|MQ??Wzp~Oxsk2k&M zi)?+QRvBa^Sj%}S}0_5VQN!eU(jk|%Q6#@x}mj+MkcsPSW0@evRiP0Pa z;WL67Wglje63PcW?v(x1aXK@Ce@mv*(@*>a$%LGQDY7MOy1t$G&S@R4z|(etSTOFt zD^I!nj{Q7IuaThrxg-@FP4}8t96Et@<6&mP3Uq0vQ_4(*yT(#vn9%Q0q3hV~Z{0>w zyqZzrm#{40&y%&AwHH!QQv-ZKw3}&LKa97F+ka6dXiHNyk6(n5n4&IM7`kKAYadO6 z=8OiFK%)^l<#WrZzDj$Og7z~)L)Nx5-8E4ox>L-VW``=$HM&ztNcC|_t=y-y)nS|z z#)>LtvfQ|l8D<5l2mpIv?B%&|2PIhwzpE_+Y+SVS>?hw8>V!B=pZC~>0?$|_K77!& z6BoI(vkZjSgNC!fiCR@#lI27-2^EOc2Bzh7`^Rupb9=+5ylWM2*S@$614anpO*zaV z`^YD)eY6_#QcI)%kfMme5@O2n-#wjaHCz8-e z{q+;KGC@E)tXLrP4^dBlnwO??JhK1z2eP0 z1>OPQ@J3DxLS#F)Gw(jSP0wr4(}1n8{;pC-Bx%S{I4PZ^^fn8Lt|9B>6M|nGtxlzI zj<1JA_|FE7(a(PC<;D6Ix&nDF2Jgy?4f+Dtt-soDNd_;?pz3P7ReDS6m#dlL{|`(Hr<#?Dbf~-RPBS@SE?SxY3Gy~iu4?Mh;Wt?14W%%O(i;|_5p+5bcbsy3H<~8IO64-2&#ta+eM~hs-6%n+3(sgj z2hZ69<(yt;czNwQbJjCudz`d^C~`*$fgFf`A=z*c-MbZqp71$LeEZpOnr>~abrm$o z)tcij9B!QW#tPc&^p*+iReD2V*u=RGD&GOlVvg@7&u*wz>n!IndR=8|P|#-JLRse% z^E-GGcZXX>{#1#~2-u=f0rP#XQT^;DEL#CrCYq;BGmToNz-OCsV2<9o9q%T%6;iaA zL2sSNlU+_&)!?p_{W3iH&mW0JRYAEr$cMiG*eWiK$-}YSLL`osRfWJG4)*pRSkZ%p zwY_~{u~F{btMT+UDTi+5wON(Vpg<8}qV1h>Dv2o!^5-h-)N0&)_5I18=hV5*bt+aR zE?OCmm*W@n`bU^^-nhKo+vyn=It4hc)wccY_yj_3bA22BWRpXU_&8EsLiv4}lUZq} zI&umX>7=v=fp>F{-9*ctTX5=cg_=qYhmKojo_}-?T|Zqm*rN>zOALb^;b%WJXUI!8 zSW`DrrtPReo37&(1a04gel`UShW^6#phVnhH%SCbg;}996arr)*jJ8J$hTn>DGp5B z{db+vglD&E_tW)cl+ilE9MNEc@PT#65t6N+WLUa<((a8YaZn<4m349LEqXaIsa&RC zOeK3g<1&mS{!C!F7}b>vuk?{#($I#^*@eLM6YvpJR>vqfGCeLv$}T|m^ewQfLndbD z@Zk7l`{3lk1G)%!A5WXsHMu13CpT8NzO9vGF*H@y%)74HpF-D?_rIJBvCimMrIF8y zVwk0)^4BDkG1+*ry??x0CmPQV5BGPs4~RHM=}(ScFG>!&X1DnncYs8BLqK$!YsOBL ziK0@NED>R#2FK|URAOFowAa#w;i)OVZEJ(nVW4qi;&V0#w8t-`Kzu5VLWb$W4AQLs z*oAj;fs4{#b=}3w=-Z>+?dK2bD~Uhwp&ZRIHK<{hd(*SFDY9epUC12B33Hm=jN4IR zT?%VHy=aRPY4yBk3&6BpD7G*r@1{d?nU&>$zCaLU7UKB^a$5Vwi*ZzZPUX7~8gAhR zlA0Ib8oHv{>w+9hY4vuphyuAbYCE%Y-RXbwlG`y_ki&4_@yiQW{*WuVx^k@hw-PT8 zY|3!hs26T~6#zt|F6&AJL>YG>#F?=nj%10BNUn(Mc~DbH!}8B+OT%v*X<47oBxx*Z z+ZHv|u>aMXAb;4VK&;S@B2+xfry(G=ExvY{@@((qbnkfQaDRVyhfGW!wAZ1r|Egp8 zu1Mk2G0MQt>jiYoF|JBG+XSn7a+?DxL%l9&DofLPeUaVx)s}S=v*~Mjpn*w!s`&s;Ge^7yH5d%c+;~HH*m3@wZ3ECr5R%!~SHRda;&p zULpGjFBcXfw95v8sgW*m$(cvG#344$axn?H<}l^lzfPQS=o)ZWM($I@&6m->CdR$g z^SPd`PF8%K!u6N)x&HFr=eu{L`goTA=2VaQ#oWHX)e@g&u`6!61}UvDP?9joqr7>g^ogLeluErS_=yibgG5`GGuk$H1TXOc~>=tqNCkpx5H+#gxga0|BEHI zlP|nirxxdy>M$E|dG5#g^rBu4=kSVoxZ;&p`S z@-@UhiLNZBWeHb6L|<)}bft^?WJ84S?re9U5$SvHDZKh15GH>bPmWY1m%U>2dug2*#Kg);t^j6T?OPEqk z^_q`7HTv;=^lH_h?uY%om*1YeKHfcgzJ0P?KM$C~(o^Q1@&e#~!zb&&t`HqjFqhwa4*6I{q+Lb==IV z#=}=-hiCUbtY5Pw-!Ih8g{ipf#HMRSMB2+r@h0l`-R}~&F%;K?ZqG@-!)u(br7;6; z(GTeyTD968K8Ie{?wn`ua7wtw?E!Ri+YOgMCuCB&-f~l+1Y3h$H>2Sog3UIDuPa7| z=2-W8n(mJ9B=<_>7<83g6%*R1sTib|aa2Px62LJCdyWR4fM=$OBdFYzk9f8v;FLGa zH4PGQE;*+4j1EbCf5XYl2d7zBq#;&VmaFn#pT>H64WbBf2hz_ht-4{|I8P`Qy!(~m~f~M97 z3u~(Dg65PjM4MLe+JDkA7S1&$4et{fnN3}>YoZIbgIx>;;($qZGG>R9A*nTt_Gb!S zASGpOyH1LEApHV(ljFhoV=-uR&0TGb;|8tGTljlY$ zk@!?5xs`sL4GSkU<#dDY7kaO(Ey;|KZ^)h?HSUaFGi#=%i&@#5>HJP+eI1-q;TiK*n5a9&I*fU9uIC(7>sQ-u3^3>Ju8dhjAHd+gR^BUYe&w( zCek`U-!L}q*0|T|tZGC$mZV$AiE(LBjX~& zh$iQ1@+Y>*Os6)#8egK60mZc@oe)+`m(52h24lUC1My~$>Y%wsE|T8nWgTaeyy)iu z3%I3w)^ZFcW=3GaY%>p1nwpiC`{=b#lIx6I`N6@+saWHS3m?PnKG%^C)XXU>8M)<2g%Q_qPbg?2Ej$V^$Qx}qVF8Y2E zWulJ@6=-gB#_1%zDyw|MAir^g+s5YUcM?jIO^q{>(3c zW|hQ&sw0GrU+Fg-op<8uCwP}~KDP9AD^7h`Np@NJ4o-H{JnID7cjHPK<4PHhdbu8# zHj7&}zN9#_`C^K}D?Y4*veu|uViF4$(!DaMFe?M0u6x2Ni_b|s(tC!&EYkoOUjge|C7&mj%K?8U)3#~SCV3zhGA@HhX1xjLmt|2n3Q-GS>W zH@x;tUHwiia=47ufIAJvy?A}FbFz1M;4js1Fu}6{qG!E?7mG^J8?}n-XRVl>#SIY` zj~aGrHH1uFv};$| zt2UUXg4n2g-;PKnv$@7rOYy35GbCocW^WiPHbVjXb4u8+7BQSx#$ZkfJkUWWJFwO6 z%*nJ}up ze3-&{Fh}9+R(!ohJNF*8onLF%cJ4E5>MO7C35psaYo=MWb*)~=Ku*s@nu2w;1grIG zHu4g0at({wm3IQi4sogseoF-f>wzw=xE_V;!OA_WI8aduZE_$3)Qb&nTrSXo$f#1sMGusT{}x)ll=5r{n)*4H~I%|AkifWVBnixyS1UlY2GcoojJV zX16BSTzh+Oa!ZCc^X+c#Z)`8h?q6zX&pr5nb15>jzo0{@YGr>Bw2%iRYk?kr>n%IV zC&_j)COSAE_g8VhbkfFUcFT}C?t4Bd37JJOIa;7^dXwSy8HgO2O6R1l6K^rb1Avq5 zBtM&h5D-)$tG-?7t&&RsaLgt&VsePOjK_%Wa}DBM5jeQGpf^Tc0cU zm`(hROwvM^TYP_%kCHD|K;;y?;E(hau3E|luUh1{I4*epF1u~=q!o=F^#^sElf>vb zshb+~?bc&gkY7EbMEY}s3=uBGqf=7w%9GIvg_xSeL`T+W9@6!5x~t-wG4k)m$dr;d zE&b?54!G~B!~QyEeCs{vL={)@mV;xY%K%5m{VslaP==p*D3?d4TWx%3KpQw!eu&@# zMyIfbk-ienz-ho42p?fr!{6L?nu|1W8g9U&UWi>#r5ES67ufsM;3{l_Z!Y(v);(&9 zX|-!-)Td3~?C1+t$DO?(B`@g+S}6fzwVr?}Y5_w$9i~|S?P;e)7(9+)BE{^;rxj=( zv1}O{MG_Q@t<~fZ7XjCK$r&3HnKF3Sk)ryV)o-99*txnNrx&TI9f4#1o=qIjH5mA} z zxn%4_4s(?pHvJYGqhmX_|JjsxR7AOL=6`HyZFRPW&yYn-FqOgEdHw6J$H^6(F`p&wxzcWgSh-{&NJms*+8yF8=148z5k8-HR zJLhW3e<8%7&%6g|mcrk3_;r2Dmhus?HL>+wZL|RC9);huR#to=D6WqV%C=zl{ zhY%;DqsX5F3NWQ7fP~K@#@U7{Z#AlvLy++YeIy;Ep_6Nwt(b0hczg@{O+l?GDwb1q%Co zc>3$rU$32TbCPP^YKn#09gW=>&8`p{5}A3p%h2wkdE5}!*jsE&DZFV@-=>9H)yLiQ zrGp7JIc+1T0N}m98#EVU6A!MY_X0>A|Rd@_A3=gdZ_ZZzu&tb__N1;b|qWjXMVgJ-x)yNuLxF=sN0gC2Q$(ybzxtXPuUD`4PmXp^03#L3Oum)@?AVuE z^0MNHU|a^_HJ8G+*zrA17Hvg%a&{7Fo<{geZR|XVCJ&tW*GXIEa7EjIMcmOzOp+yx zx8s2jyW7{3k3w^n0v~@;xFPS)dSZv{W}YHpk(Ci9lhz(~h5=pfs-;^=c5KC90eT@< zTV`gX5umkzdZ3^kH}5biX_agVM_`E~nW$Em*?7l(3PPYSM=jl(Yerd=0!o)IAXo_l zcF9$?ATX6z8Zsk($!3l7n3?Du_aS;o8kOq1tICUa zS3GV3TBUHTnOr`%2c&2mbS#Lqdvu54s_{gIJ%=kH3N0n#kLxLna&fScXI4d2(i16J z?&bFr+HC2|62!|_P4Xv40Uh^}wk^FDWHK*ZKilqu4GTH$9c9BdPWsvEa22-Q{c+DR zhxsWT3NAJ7+9^_`@lQ{aB}B#|v(6>eb4eJrQ8P+p)u8;D<}U^RmsD}X+hja+o2Czz z=GFF(dw)9lcKg{eEEc?n$$9MKKzIu+;*<%1nRLeIHF zknF-K9B7&SZ3ec3yo?BM@)0=5Ol*Q(-8q9?lXo5;ta4*ZE_G!QL)8O5`wA1!I>A)^ z)N}~;26NIoHU_6HKIR-vFlpt3miKpK?IK?ywJ3OR%kcwXac85z3l^>`!5u+iPJQO6 zI=Fp6`*udU&Vfg?XGcBEwcIngImqckiPTU6Zy)Sri5oowBJ_DSg4$1EN)^+eSr&ER zF*6Jygm1l8llJ%O>M+TM%#Fh@0G9gG>CoJr$z?HXOwE>XD*$b##VE=hv1=K0#fqQ* zT}HBTkM{}~^})*1ip@AXyg4%9HrUsR`)VrdS4mf*p0mbrn2CYpN zPvEpf#4Alac_oVrT|pCZ?P1E`h5FfO$|&5t8Owaa*8YazKGLAXFA;SON{ja4s3}I=CYh!ky~N8nrsssQLC4?SVX@X53^}D^s!ZQ zjloKEiSDX7YQUKj3tgl523#oA61RDYlC%H(b;k7x^gmgu!ihG1^*gT|| zU{u6U`FfI1Sz}SodKXsb;Je)uj1}6(j`=7M!q$z@*@R+!^UCL2bsm0ebIYS_T7HBwzv(zbY!c7``t8mn$2+PW zE|X!iH^+G}d&d(`IaUa}$HFRn zHY!~!Ub&SFWmT8k(=u1Iq(ovU3)!R`I7w!zjqQc|&*!IWe9Vi*{St+7J*a?i{TMlSWYy!a|;uX z`ua8TFngB`dGWB?WjUR6yss`u8#@PBa;B3&dBM(hv^{I;P{>kFdz780IBGgvk6MKx zHWrlTG@V2ii4f8ZZc5Upj!Sl2D^ttQrK6|#K8I*hww0B*aU^;)6{8EClaYmrU*+6u zrm=WVCo50$Q>iu*E__Pq_^9CXsnXlo$n;l+N{9A+vl@ha0~k*s;xNZNZ2-cEZ~)MV zVAnBw2hNVg0QEBH;)OoEnZ0|vD!LFJuQG6_(!!;0mOS?X96)r11~qcbis2j`y7E@X zVbzYcyRB-^y9v_pcUTTK-xcXQ!OTi+}-mPZ5h%~DiMeUQdAE&99x8`oae z2C!W#pTtXdMj@&!9Zqh_{UBT0M#@U~fTykpUDL;|=~m2xDp%N`logiQCvqsh%PQ`K8!K4bS;cw6V~a2uP_4MJsbuzjrQv>q zmv2FOCbKLSSmsE2vZ7f=T_lgx@85&qm)Gt@z!q1pK_bqS4i)-N%ax09T)L}M#PQFQ zoxS6e(-(UOhVv#X#S{XF+g^XqCcX}pca~01&wESJ&D9dzx!A>RNkRC>fGu@PD=k@O z^T#7tJJ$v>%2Pg$s=OQl-l2g{^zHw2P7hAD_x34Prtqb zd^E14Q5Qpm)bsxp5}VF$&atBOTyHjE#}QD`Da|$22sABTH&rE+s$)cpPIYW1_%CfL z-pSYb)J;j7K86DrW~xc+xb?)pNj!Vf21_#Vr*M*-O|tY-AKynM45Jco62%Oeya^ql)g+yGUgDfyV66^ND0^vX(+i&LQ|D>DO&y7y_a44U)T@{{^Avl-;Z)noILdT(P@-(bV8`tP-+bVtTfJ>$JbX210$ zdLFou!Zci@P7Gt%K~ZXiqp6|LK1VcuQd1hMw!9eIoA!#b(5j0Y^!pz{ksG!AK{jhr z`m5uWD!v+YFUz``TTffMm`QUUmZV%8RkRd=G4&Sp5%QbZ(J%S4HMU9=%`8LLItcrTMtX&A#wT62oHGipwFpC=P+3OzYkcD5P&mc;|sPpp^ zKURLFgku-u!jp-Et2YFR2|E1gq<1lC^LMvSJF)m5^U9|AbHssqk^3##>NQb?h~2QG ztKzO3k6(lqM3xx0S7*i0aV5KSsV4|8AL({W2E@%Qt{b-bw=j@_)evryo!@DW+H8p` zfVa$dE#dW&F(71wQ^yu_fFdg|Ue0e>Z!X*IAyiqC*-AclXYS=27G0GWwsFEP19 zQwi%MZy>@$-|+s9J}4w^V;?5-`=BE`zb{n^$LFt18H?FnWaptK!oZNo#9c#@Cas;8$FhN$!qIm%TeE107R)m`Xc2A~ zh+7y**S?p#C)-CaPj}iXJOYA-k<|TYNSe!bE+c@O3pZS$@4nlYI@G1sTMxv{ZlAj?woUfN9d<2_grVsN0umAjWT`N?sa zod$C|k>f^~ZwPLV*cKG@jV(svepp#bLDz-b4=5qcnT_qvB*I|a&mCeo#lQ-dy7YJ)F(ih^LtURuuK9%w`33YxP%r_YbCYHt+>&-YZSF5;5++S z2@DS|v}kH9s*1*^plJ&;=GWvjE2pnsy@GJ-mgni=_dAErccHgKNpH9>Z#!~4@uNTM z8*ty9xXXYw9KUUNn}~IYFx4bxl6|XdG%YVK6AwY)jJ6(YyQn#$2~3j1@eVpleu$>o zx!!X?qz;>MJNm!_8iP;j>asm)82BInRzRu03d0*Rl7kPwKixmvetxjG|3s7{u;2=? zm)=_7_%@)m9`QOom;cFl8S+FH1+i^EX;j^n8RMN*nV6NJe zA~NJF+4DnywsdtCqwJfg83Q1QyNcXG;Otl#^yaA{+lGCzR0HW0O`Uv^=XBN&_g!MV zm&BA9)o2;f?Cs{c1R>fcI)uF?D|~D2#|)6>XOqw#J2H^Pk1tKOx5N)f=|pPO`TzMg3jlj zm673RTM{?fkcY0u^vD>=Zsa=QZtHwloTWp$-6Ch{rMZSu|9aV?a-J)LS~nbUHDW0` z0??IegE-G6=?HURfGXRxL~luT4ksBfMN@>|aIXzFG}BF(z4 z*R~`?c5au!UVc|)qv++2O`E8V9l7PxfQ)MWH?9G9(LKb))9rNA4!fQl+bSA&qt#%o z$JyJ;b%+j!XgYkV&H64~Qd!uniTmi2T}O|1_g~ndm|WVWoX?x*CB2HA$Io!3Od|?! zxHT>8eczqNs7z7TMz=pR(7`A%a|97n949 zVFG=2NNJMx?6zWUw@N-HM}l~Bt>T&2BQkYc{hS3>8JeTgo0)Yin`OcPpA(b~nQZ6835d1wxO-!r_iJwFpwtkSCgTHp9`vDKOxAR3}yQ+;9yLK{K^q!FT zBdh+EX$b;jaVSP>mI8mWenG=qda4q3PFZa$leaq4Q9JshTzml6&P{1ME%=jHr+Wv_ zcYo9l86q3%uGV(!84dGhFM4XM>0tLycUAW4)w8{WC-LK6<@vin=&58lG-2a*?eX7f zsN{WA)$4;-Pkhtd!)8-^o*f*Xgj9HHOt!y!5K_5^#zZ@Z2RqxQG=6SOy8Hh^vfcj| zC1KN&9w885)lup_qO|n$yRJYW+`1J;Y7Qt?7ObuPlPBi4T`+j?otoEilX*8D5~V z#N9BGYGkv7qx$2KX(Ke+Slu9=lS!*+*|0XnRTgeGJfs=Ez@w<|F(kr-abDf?l1xD4pZ_+F4uIa1(^0N7P6QqQuB6pCSr z6}xwQnCx__I&=VBi|<^MQCq+{jg7uBAFM%+y^7#%Lq_3WCxTB$k3pe~6OV8LaLEi~ z?oPaV)+=fu?{{V_LMkev(oY%>A%?g|oEo7hd!-3Q3n$iW#6ia|((yPOd62c}NHBE$ zk)gV{o6g<&$%w_7#C~vP@ieG?Qsg&XQHmJHw}m5q4<2d`{}f_*^QIqncPD$53-n$(-;g${ zeg|nAqiotjD2Vw>&O>I?=}u$-Er9c&-TR%6RV|vSZKEZSe5*jgFsoQf+MhX@EX zaq#h_dW~rzKguUo}e9B zb2i)A>ZBUW9V|>L;nUcz@BV|^G`zA5G}Zrr^ z6t>hf9k`-1Y3U()FWhw|P6ZhEZ!=OU08^ON7D2~SK6rHp8Zn{B^JZ@7b<8_F&8-7njgNu@vq#Yyo|HeTs#>7wE zrzJd zja+-8@dYi@&HO1LNO1Y?+o)`#jL(sT?}1+IA08eZZ0rfgri0bE1GrD0l?pGTDrO&7 zk~}Y$B3kJh*tl?jlJkpt9Fe5;IW%d^iu@?;#=Nu}kwN0sxIG0H--cY1&7p1P=uloB z!JL$?;Q*Pg$5(gvD&#W(BmRs_poZv5gwY8Q@}H0af8_L9BrUgQ>1w6shwpOTWpC^9 zb`3bgq<8=L0vbVGW(UO~fW;duvc2cWdwxXyJ^TQdu=Q!MjLN!caH7ovvcnAhs z-XUK62h(?HPUp!cfdwvovqU^UAg6@_P&?M(CDi(+waJg`^!V4cR)wW$?7Fqz0 zc7HrM+CDu#+1~lipb|bOZfjKB;u0&WYNP8LNIDsX{u5`-=ciBvUQ-s_f*&0ny*_A~ zL*1YE3VCsFj?OI#yt2VJgw*b^{rJlr?^4LsUu9*Po@WW+NC~PKb;y-L?)GgI(oI}j zX!fw|w!$iYXO=NFm*ah?F7^s$c~XOxnvMExi3(B^hG>}%qU($&dbl0tz(bvD`CwTfZi z&IOg2SuGgy{~lA(K`Xq_VZiV9#2CRCb0^P7q10E;7bOBR`5?GMv z5aR8WZ>pH<*9(VM)iu{OZ%?4e1o;kdU<0?}QUK_6g|3h(1YyF#rl-gLpw?kn)nC`? ztpeM+R-VI<%Bw_h#MJAr=%2*4Z@yPE4T2yKUQi1^~TXXz3=c!1MbbkE#DAZ>6l>EcqV*BD&%ucI;kWy zD!q_e`|u|PjLu*NbJWT;E$CQYznUR7$qszNM)$Hvfp$_BL-Yx){X_AS5H zqch`VvSHrKr`j6rN0UQ4%~}VYYx>Fq5>c8H;IlChYp@TZeH7jC(rG}tS}_$i$t9+5 zmXgL1@_3g;3R&KuC94#$MMwo7?F<>2mQxN_Vod+gB%o1ZgG@aVsn}Qw0Cole!vjc? zYTFa=)@Te+A3~CL)QCcj61pZ{z;2KOiGr+B$&hBVcN|wZaxVA8GC77yJ-g{;V=;*K z#?d7y%4JSC)}Fa{2hR(f8^GfcsnZho)LfflwK#tqmQIPyQ&~CYDCc}ic7x9k3lR&$FT%*$9`Tsw|vRl z6_Q$BkhOv!#}b^k#OKi!qqII9-A*ZP-c*&`!1~6hzubx8eQ6nBku|d{_Bwl63GO_e zMI)dJnqh?dclUj~=%WeRk0A%uTZPK|JfY~9ueOiB19eOOk?7;j;p>AF;1qctKgMya zV2KK0<{LP|W@qq)agv^=`KWd_#1N4Ji0ipS7|5%)ypocDfk~LLwVVD5em+?wiz^?( zun^?4sOV%YpqpD+kpUHCNdf!Q(W#7vj-D?%Yf;`YryV_)mofe>x^>3mlfnM*P%+VJ zmk6y_c9N%t`urLw0(1?v;y4HZwwr*XzZ6S=8%E)KPrf}m{L>@;dGzN*V+T4;4{|Q~ z)_L*H>#0|hXQTrY6S6L)WxSD628M4nd{!}>=HLq??@%Xp9zIM&Fh=rI1RZh<`_U;c zaL(j-8)o^ztRQr|#DtIliJC{Ukb&rRUa}?hf4NidQ!%J&hYoiT?b00vKa&j^5^0*# z)82SEEAfBwp0k-xUmx$D?jIh!{O?!acS80@+z->&bZLPpz3uhDUSY( z@7m<<|@`QdL2+SwxRO)FSCSJ}N*uuh;J1Q}=`VSY{9SFX|7O)`dG5T8R|>3LNO-$^6jP z|ANLNK&ENEOk2}i>Xc)Uapd6k0ZgTKM?%?CulVc|lpN{@i3|;|msMph`gv_2yW_qq zhUt`}mw2!qbF)F-24J%QCZbUyo?{;AyE_e^u&!jZxtG;;afgw0o79+#eO{aDrp<#A)6CR&ahxsR)%v}U_#X^i_{ zFtVOguN#2lQ<5WK_fE*UOFVpe^^$PuE^};Dd-$DqpC4yEI9|{vGMt3k8W2Au!-~mZ zG%yh|r;L2Zs|@1%s`*3U-F|)!5|my|+QU<)(JM9(DUa%~Z3?%II%Ktr%D7=g@b~u8 zcSAcRDhSK&Tr`8uS8fVL!dS3WtM|Ue1*gY;;!8G47A(i+%jSo@4y$CnESzBY{7*XVCFY38rBa=nNBsn=hj=PDiCq8OqJHjo;4iT;N^V3OsJ(-QhstvF1lkdrXVbEpBpygR# z%$X?I;o}YLywMJO@Q@l>9yXiLqv20<5dF03cL~!xdFwBDx9o;c%iWYBgIzZ*c9R;& zQ(TQX$nlCTW!lSw4qmv9AdN-_GPzAVyvCOBf?ZeV)E!1342N-@@csQ&{3d>pa1u)t zDiwot!`J>7!kxv1KdN9*lR~vIUXbS$#QTDu-BiNJ54lmycx}PhB zBKWj{F40_JbLgVQvE4kfpdSYPIlog$a30w*#^j4K+%I|@A9oZIjzm9!R$;xJ+rjma zSs`90JNlGkMA*U@RE(?)L+@C#!y_^}g5lZ&mJnZU|HyVo50j0xwIIkJ>GIBk?-1V< zf}B7j-t`fHA>o4FY6Lg;4_$%gQ}SaW>o50z|DB5A63Ooc;6WiWl7EFICfCYr_2iZ^ zA}2X%)mx$uOYtF>^$wZIE zXEAE=+@_sV8B zNsH1`+Lpbbbw?q$XKqY0YzJB_gq`9`34kcrJ1zlsJIcUsg)mk3pP05W|Mg01e&=S0 zEl#o3aV_E5g2jK*GB@+a9IwmNoy>AQfTr;An&IoMB;Gpz_=hjd9XRne^EaJCFfRFJ zHoR?zo`@-saz4?j9i(oF#Wxye`~v6p>QroQP3We|^{`wSRwmuE$l%o2@*fr)Ly5!7 zccG4F%vm9&OWA<N}TFeNcK=WY8a$A<|td#or55 zw4D%#lBg1W-3)rhu3uRorAl8|!i@<7+A^Oi%%=zQh(WxCDAm(=A9l@(L>2 zReF>UAxp%T^f;P;iM?V z@QlL5dGRkaGRj;p{cC9%7YmCk;tvoe9R?8OYz7<*R^|_^b|=)qMTEkKr{;KQI%lf> z$F=hp^X$)Cvmng5AZjvNlelLY4Asm-<|A-e4NeTTsHz0^Rt5&dtrjNAuz2}si9^B@2Cwsu z6s)#1pM(fsLIf!JR(w1NAYN%V2hznmLqrP=I4&e{L`ff>bnh{lNR<&1!HkcY{;VeeMaU+M z==3`8W!2P9$~Z2_9-KqURBBV>$Bjpi6>!ljO?a<>Q@==u0|Gd7tdA>~@Cm@M!-wgX zIqGf59T>~JH*<%Im~Hx_20Px%U1@cbp^i~;&2o`gRCbe=JCIruuaa?;+)bRO+KOJ+-x>>T}DqS2vK-P~kcO!CoX z!@(X-aNc2CX1f`Nek9b76D=nj3JY9}3!qcQ#{dV;zA@<^tBDMq<5A>vn~%)IZtBMX z??EmyCi1GbA_~s^i;f4P|BYvhQucXghp^ZbS6%r8^#x&cjm4|Rtw^py7jy$dQy++K z!c*l>Wl}}ZDAoiR!qPO1##0n)4EAb=3|FA$U&SSN4pB3m&{7&3&0xwZpshxFAe-Ah zj1#rspWnOxNudJK8g6mONaNg%QpY>D?#go9+4GuT>GaMXUk3^VM_9l4s0Rk3Vd=65 z7NK-#Ki8F8XBVztrirwFRx3%SH4KpDVfxPT4LzNxWM`Zv&oi%f;jqi&TEL32*GY1*4SriXy11%%n8=Z%mTn>( zfnsJ)a6`ht)&sT6g%LW@_1+?PN#_KXuEAkMSkTAd6-*K0#q!vPfafJnZ{31+ud!&a z$pFw_tjrrp!*q&yxPdlfmSUb+d6JB$6L@Nz^5xqWnMqs05r@1-KPNdNDctzeQPm>* zc=hV`1@-dNhO(4n5PrO$T}kwWTR|()X0_Oj$#@j( zh6sKJDif(Wav4MR%{N?Czlp|6x%M(`JGwb`g6FE};tRE4Jd|9EQC8Qe=bd~jprcEp|6@x*9D#np>*s*7Ecv3p<-DZu< zOB&YR(e8;^dUjB1Z~_FRBBHD+k5GlidjmA86Z;r%1!nxisa?Gle_1nH7=DSZ7{=b@ ztejen2wZnAQtv+OgEj`;h&D~v)QI#pE=kF;kp0?Y8=r6z1{ka@b*~ixg{$bYCyHy= zyL^I(EJ+K=J$n&F1q8^}Yy_qdUb6@k-3?>D;_C_|zwTJ#W|Q}fVf<(nG(aAh)~{&m zKMBqvI>J@uOGgg{C4lUzQ`wGH_x(bP2Nyi zIGIxxS6421*(F#AA(`$2MKZa8h*N?Vx_aG*d_2se+z129@WqdC;o`m$k%ED2Nm{lt z!wc8cTJSaWLyKx$r4!f>=o!MlxYrgEREd)-Cc0%-OIx3V*#S{`M`NN*4A1~{6Snq5 zt=`1sPfk-W=vbyS)?06eQr5W?j4k`1S4$y5j7~I?!L&{pnaEzQdjAQcDvK`d)71?b zfV(sym)G0)yF)Y0aoJ&y(0E7Zs|D1_$*m4LKETxu(_Yp*CgGrJ7#BMGU+PH(8;gi0DMdF;m^0^ZzCxD&x9?XWUeK4!*Daun%FG)o~_kdNpA}fXy*1-yJw1k7$fcA1r2&^|C zZJ9n3P8^Ft5s9eM8Q5-gqwYQw^j>2aqOJ4Q!5M4l4jG++VDM5I^9GVB)*_$Oh?N}! zychKCV7^6$9ATuRP^5WzK_Z<$=dl5v2(mvdO4=Mip-CsVe2V*v1C&wkLWRikozFyq za?nS)_Ch5LFfu5JFZGQeZCxST!_%uSH%OtKgcqTHGG0nLt?-lMqP$BfQ4{z4aV^~Y zNcz>lE=FSE=gFt@sIW(ZP?8bR3tfhD#*deT;W|_Y%lsQN8HNr#TDFrpV(pO!)u&Jy>jgda-w)KcS1&-%OA@ekIqWBwolW z`w8>f=GCk|G=52RbU}OjQplgDy&M-vMCoY?fiUt-VxOMy&5iq+jrw$R6Rb|ZpJW6S zX?6w2u<=|YunO~GpF)&O%U~EvVQq@B*o)c=VxMHyamr4*U2l0V+ixI6{43eIbe-%o zRq!HNjeKJ{ThQ@M%WOF4R9C*6RoB|PSAUSKWGA3;ycMigV7MQM5lcS?j%Fa2j$^oO z-1tj8!NMb)|M)g_G{|p6E3g$Q2_jy&M!V6pD)H_Y*Csj;NKF{VCfaS#w{w<(Jmn7B za$p5^xm!%r+1gt32BxyV64xKjoK0>n*(3Vi%FB6%fzleD0`D#(N5)lN(%P?dFKD6_ zQyf;r#C%>+$mEgsiVQI)iUi17`@WYIK0v4hJoVIFG%r zZphM$vuq*|oN9Iw)}JuHO*L8+y$NtzNa=^1 zlpB*wqgRQ_gi!~=c^jb0d@L%w)_o^NBxjiqFihqfxmase(9RCk=nY>Uu z$0S5CKwUUY;+Fck;>cJ;r&QD9heP936GaKc!YY2|t7pP-it58%>COvJO5F-@4WHaT zG2-qNaKY2`+|ZYrlj#pTJNqmt?a)C$0UMM>9T1V)sS~Mz^2X;NW^^uB#JL~#cV0XZ z970UwPGz5H@q=pNQZkhpd@iZ~n-zOzohe^n)y|7rWa!VhdSS=3>b}=@_Gl$5KRp!f z<)zM&2m;FF=x4KmRkE|6@4V`Z996=&-=FZPJTs5uiZ6j|*gieT8jUtti?|Ym{CR*- z+t^idi-OW>VH6u30Y|uHB40JdbYycU4l8bSgjzx+e>%?j-gX2_X*#n;F(i_3wVsiz zS|4i2ftri5Tj@Srn58m{m*u_KfDah;+SYKRQaiKn!6#^<58^%=_t}6giOdbbud#nV z@XU<&RqZfeyrn{G^^IXdz&ce}5amGdSLH%fy?kE|Pgf3tWDi| zL>Cun)04^-gQ~za0<}0V;FiT+Q&bC~V}#DHkdLwN==`l`2}Zz?rBws-;*n){oRE;? z7DvpW)?qUzcfM7b+X)yYEZ6hVJMq~m70Pud5ffanf46RZkZV}!+DF!>L&9TLl(10d zs2Ht~vW^U{=@jVHwBWsau>q|77bSQ;YJkQRc2NCrAHv46*C1-UdEq2v85m3lcR;0& z!)47b(@wP#^j;f$8)tc#a0Q~x>~u_UmKu?qhoC5D~)5yAOY2fI?#ga07 z=GNXjR5CT6hp%piXhnv|-po7BlUyI*r8m$m(4skN#d6_?Oq*P_H4heRU_&F0^Q#=@ z$O2-`HMKZM2Vok~mWCybYJ&T-iTJuOQ(kYVpwRzH?Zp;|n#}4iYQRs$8KLZ=qA?19 z*&;FY!j^Lsk=a=8)!e?kmHW$O@-7ucMHjbTD0N4=PhAf-;VQhe_~JuOjh4dQW(;V6 z*5swetRUKpBINE>Z(cP9u5I+HSh}Y{ah(V`l2ONXteA*6c4T;qtJLYF7 zD{Ws8z9?}8;J1!g;p-RxJAfzFDo~7s zeq7a6HoPT~siBu{lH63c#)9C*j&GO@@8tqT_lhz_7f%r6nhP$tz7|B z4$ZAK)VC7pynRa-9_He>=x0A%ZM3?<$+sLABXxIeDUtLxT31CsALN3o8Z2j=Xq?e) zFNT!^CWB_=m6Dgw)eo(V7fM&>Trcjjbke+J-q-bC{x*^|u|5V0V9nn7!8cZT@iKs% zD3>Y+Pa__`(U2@U7jd5X?;gM40`T1&Nz~3HrI2Vsh2IHW1)qO{gioABMU%=vOq1; zc;REleS9Br3a*%ER`d}du9qs@;i}flx48HVrm@Yl#Z+5tocItI=LEY(Ei9V$-BN@| zz~c|5!O>pwx?eHfi1L^{VtZTBL$Vgq_q}6JOMTm$-dK4v8e>y(RPJ2uq>lnt*G^Vj zuhb^G|%Z{cMFXNfA0l2p3`F*Juih7gcf+gRj-Funt}y?>=t}q#2)uZR5>N z3W?9%&og)0oDxA|E~$X5Q5_BIv-4>swAfBvkC9k17^@#t>LfR0e^yC8!=*MWkx8w= zWgm{c8eEsWnVnkDkA+GRRi4m|D{uhva~M4DBrOT%e%qR-a}#8e0irvnNjWPaytxJh z@H{>W$nBT}N7l?Pb<`OWrLaFFyU*I`53`C2#`ROBdGbHlb6+k<(}@#b*&tzTZxik$ zU`_hhYBX_`XjHoOHCRm#;cNsW?@>*-J>^IQ?%W19APK5bnndoE{mEtwaH5~N?#W>w z!F;oEeD7K|sAeoi>9rHKkU&l|WgV#%QZ&;%oZ z(AA*a_S#cz3B?#S+(;1piMtfWt4z*{{%uW-K_fCv-XBcFT@Y3(#4|>Q8fFVhO5smZJ0;2_;&x=1dK?Ei!<@_U4W& znlu(c_ls+twy8SYui!Qg-j-yD$xKu(r zg2VhUabz>8>p{C-@53gG4O^Iqx=UpNi{-Fwd9JBN%h1WAqCDx7uc_h3I#pG$>iL^6 zA4JR9$a@K^9Yqw8)YLZ%GNRcpN{sZvoi)gX=S%CsL+0ufBSowX8}q5OLdVhS z^u%x2fc{L#$TZ`+Y-8rmYWOfK+u!dcf|7UIe5{!#5bwbCl=sE9B-4i26wJgc_@uVK z=bl=Mn?Xw9rsK;}Y@V5_+@wYYZoT7OLTJ8*pask*&ju3Emsn8C5Y6Epme@W>-9LO> zK!1d*A+lO^5Q-jWQHHyL$lk9_U|Z%i#j9oFk^MA^V8-@j=nuz_p)FC3{`>K5h(Na6 zSV{1+57+tpM&j5F5$Iy(SOH=Zxo{%zzPJYJ-@InN;Y?&h^TZTz=Pu$}yUFKfN*^uP z&tbkEHuO8vVEJm4LInkkL6VeKt3f ziVU|9ptK#;AUqZUN2Ts?!Gv4&)7+bx7tWBXV;ALZG)p)c7%YNuS`53wn zd3w@drB>Uh3x%phL^Usi4NZeGKuWNB$mVh=MKgTqL@gWe?YkYfK;hZoSgZL2no@dG z+&KvC@h+qW&?Zz$-axuz@uP`FvzaTlJ)cI}SPN0O4_YMwVthOZ11(xXWlX12==5-e z@+Oem=QP<_Ax2XbMN5WK-@i1HVH}AQRxHpvPi(6q3hTW;@mN8;I<37RpZs9D=lFs( z3L(wHhxOc{ED#eYTSa$kCxrZWU2hpUL&!Qell_O6nsR&8=xR<+CYd}^K@>qJI*-B( z8;N8K>+w??m!3UjCRKsN9Fazz0P&jMm;vp{hOks>LCng^l|fyL#?DSk5as@%0jFpl zwOCWtki_Q}3B=#H2T@{sc9Rctw@yv4L%rj$wj&KH8s?8Fe8&#bd~bZtiRV!d8&A77 z8>+Rg5%;gvSO+5EIGx=r)|JE!T^{#_ise!H;-h}V76~rH%2Vo<{MJ)vEwc04`Tw!^ z?|p3~Nun@3|Jt9TtXW$U7Bt|#%o^i97-Kiv7`%YHd&cd)Gu~2DL5|`=re)c!6 znUPslLcYw*p7$AcwhdL8S(%ZMk#P@p^_jl}3DqDyKxEhFFo{k%*L26GBZr1z?r8=> zU3nHCZ!HU`7g^9Ppt^`SzHx3Fl3d39?SoM_lx|QZ)>0uVHjMxe%4OsNJ6yOC0AwZx z@XHF#yTY%7p2IQ0HjWy4rhfqz?194{_#K8Z7P4(X8lnRSve`oia|@)(I!vEbshWat>xylskix(WQj49hn~PCCD^cj}7#k z+|y*ZYZ=d;P68t6N}Dr!j*M3qXM`;@=O}IMExFYz3>~iO5V;D;VJ~wd9`_L@r1|!b z(m|D|_(e`b_+9URiAPKKC9UZ5g2*bp2dks}C{EBR8lDW;?VQ2Wl~?Uu*8cqu2CE6`kE_m%VjPxT%OS zf7v}qmi~_4d&LDCscxevZ*NB33%J|-ZH$HJHNQ@QtdAzxd44mZFZ6HvHGPYqGtWVy zCas+bV@0B8Fi1z_iz_lst`0fTplgjqa_iv%3~dH;Cp z7h%snL~GW~o6leDZEKhy-&+wva7dG3H{1)yZy*sul>9sTjbaA0zx$eref1v$aCUnx z^(Lv=^+rM)@KR|>k zhPq~CiKwbgNx$I6>x)aP}$0qpTg#@>)`W|P~iq`P3 z+;Z4GO@|eY`MGTm!2Szu5z{_m!p1B3M}^XC>}-UBMA*1fnQ*vcD0|y|2usyee`r{$ zWD`TFQwGo6o(!!{2&TC`9Mn1`a8bX0st8eiIekLm`+xt?5A4YDH!EMSJo>7b^uD5! z@L&8JtMK#f*I(nm>+nDPckR1xR_QtXy86x9H-A|BdUgHLx8JU<`2p0 z7oSPR&kT(lN%Du``Cx84pp<8m?)*0Y5B@M$_aD3c#|dqI@*ns&8oV_H=tZ}8o{h*< zdX$2cl#g#X`@()c#hM%$6{J}?NA?ek%wttL9P8xVSNo>F@GYlPNgBg`zH;8M4}cAZ zyC`}%y}$=|O9k#v_7ApyI^JJD@|DPYm(z8)Sz3Af4yBYN)gJuC7167jt=?hb6>ceD zjteroqq>p1l2wp7F0PJFRmf}Sa=6K(4~3*&!R1m^G8_(s z1mlKVH+kJCM5nnPfDXL)_3jt-onq!Z-7AVjisH81BBo4^FyQR3HiUE7P^kbiIA&4*PxSQ!=LTD@SJr z7@9eqP>EXf&cy7-XeMhuMtawra#r|+o^h3x>D%}3=qZI{j;0--CMa2B1Ans^=FpS; zX(Vs4bZcqmAI{H+3UD?OwJDs-Wg;@=7h4x;cf{dY93n#gV@TU6DYegr(B?u<)!#=d zPQLg$k<#iYhXI0!9E@Bc$o5Lo9Jows0Az~fwAKqO%yrk`82hFJT%jSb{L{|+4$h}D z5Nx}LSVo_0P1_0M5+EA3Nz~%C>fK3XdK?Z!&*z*U>unp~-wLr}bRR8HPHK+1DC7YQgPZ9@a)SzN9tul%D zK6zkUp*;BZJ@$Xc6hoICZ`r4Bi{u{YGL$i@3Nt>6!kz-{=>?*5F#|kE`$bzq5W5nx zNHL1$FclhR&S@htjpU5dd@=h_v12p`{7xZo8rS_qEcKbr8cV#=~HC zDor+bykY!cQa>6Oxcef*Iff=_h3x?V?9H(+{Me{&0C%z046rNjm&P4o=v3i4Z@5vh z$bh%1+;06KFjQs<=CjjqE#Z|0ANX!1FO z2@dL5gQ~%#&2{kCE%PeQv%yqI$3m0w(1qhSOiM&e>I`&CLDb?wo&Uw`*+{og<1$Ljxd^H~R2c1>cni%Y|d zN0-&;1=WMf3-PB;dVvaPZ}(ZCBLsnJkX@?=P#!-?CzDaWa{kmjDyIGJuXSMbA(;#%C^YmCCtctilZQb(2&`I;0h)FJvg2+x@enmJCfE_Ry3$dt{l`bghr9bP zotN&}D4$5s2m=$iy{K>t#ovf>h&*frMz~}*9b6)-)k-0F<9sYNf^FO}AGa3f-XoVk zau~2(RV5V1&ADh1w~=;Iyi3c8pBrYsbU7$}AtLa8BCuHqE(2&B65#RV1KG>z7|mekMu@jt)8O zHaHvN{TK$(0jSSF`0fs|8*fRO^W{>$OWlcg&*N|ne2JRLAO@ZEC4-!{ZqVo?Sbx>W zfRq!_LwkpAc$5xzUhcwa`t$Do^POM#(cZz<^PT4>$6L?#cATSKfTx^^daaYJ`|RP7 zzlh9tnmhlcWLZlI;dt+TFZZ`z?I8Z)_Di)ZNm5Ixg^9wjX7l9bicJHf zXzV{lJsvtVB3RHfRgW{55e~uVA*3e280V*K5zwPq57?iUq_7syxS;3p4R@-kh=tt? z+0(eQe4L45gE6Z?+Bq7L#tx&$)+&6JN?!;^4>DOXa)xBs9gj-?Fmh4*2xP|cmZejG z6N46()=3b)&d9=DciVf$VJaK-;k{op8=WfD^Dc06HrjtD2G!I)TpWtg^2hOY}!xMx5a z;Q3eU#z#N;{)K*?K7Qfr>k(LKX%|trGCZUN{Spxe!Wad`sbXaBWU8F}oUrA+wcAyd zmAPFEb4nk3CJwUH50k`rg1UFo?e_)QADnUunT_BjE|gw1e;qZgQ)k?@!QzGk z^W%n1Q5Ej+ns9~>A38kqxZsw*yc}Gf(>w>_0OBfjwUHW{K_!6IvO4UgEF^!=T9dW_|nvajgJ?;9`ImsX4 zz_#wwX{A}YnN$fMBXe+s!AJfc(8sek4fauJIQE`q0%I>PyAm!O+&Y8LH!)F}3w~!@ zJkv6`E_HL}$}nJaKY7k`Rt`*y7K~_0*~RZ;Vp~jF(dU79;q&e_Sy}`atxYa(U0}yu z(*WBx3 z!)|a~m)On8*rarTH>#eK)UaWGF5!mu5F=g9a~3OLI*k+395hP$BZ7&1wnkued^mnv z5)kWz1^2T9KSi*Iefl#ycK`6!NssJ4FCo-HMGDAdy_aYNFIm6 zf3rM!-Wo4aoq6RPM&tL*qyhZ0;0nxL*yZbWl?U$R{b{YL1|c3NwU}0C=bGJyO+Rj zpvFSvL=)aG1tlub;c@^}K&!t2d>~xNrwigk(%PD0uEv7WiF3(j*nKW#sNU10z7m#S zgEJe6@wfI=Mh-kD(5xcEx2Dh>T)KTPsYJ@piuT$_-Fl%_Itmx@$Se2)JLB*K&=cwk$m7$XiH}!&&$7oc-1Pkh7MmEkL5rlmO zj&*igv|k!C4tjXrDh_t}6!N6& zP9I}Vc>aQ{HIrHT6@G!xq~r6De)tli^5@ISZ-iZK7UX-*7K4lKC>zg)E=lmG4PP%d zkJ2muu{jr?5jkSPz?r(Gjbw{B-rto}NW>y{hZuH_aY0C};$t9|Lco#B)Ti3z8-(kU zb2T>Syzi~%&K{|E7tZ^-_3<1BEtD}!@1NW3khbQjV%W0cy}WdW;t7gbBd!^ zB#ImR#s6Jcuw)QWTC%;l~3>t4*#u zv*AFCP)vYG!FgKYx}m0U1&)A1JrbZndPVub{Z}Y4G-(%1l|_}tF)~OayaK5{pG`R} z7}mSt!EpW^k~k@1Pc;ILLc$UQML?5>qj)3aAJkW+c~P7-OL_o*UHV$hl|ledBhtMZ z?#Sc^C6>gEMtmyv4s(TKZ+oM74Rp91H63{4Xv{^|_0%MmwG0Byk%Wl3dc?{_mbA1$ zLZ{;P==78Bq)uyi1V0Tltya%svCpfLc>iF3$LAuhP^mWfs#5yjD9_C9v7g{jd?M>W zrH;bGbX2Bih2vv}5e*xP0wKmBtnOTfqt&|GbS}5A0m#TLE4ZC}S5R@J`{ku8qm>mS zEN3zy7gye>z}OD$<*V3N2tLqzm?-?s)c-MM$23&7&pGa#qR0|lyHgQ}BLEG902=8j zCi=N}h<65N$WVS*2I;#U=0UFA=O0k>%1!1sb%%!W`OT|mJBN0&`?szI_ImD0f?%M& zCNQ*cgb`ZooDx9B+`DC~1Q&CtHA<8)gL5n>TFg7KvKYMAMlR_FCbi_CaW1;%bSDcz zvjT!921*tkMEos^4?2uT2pQ&MFv7bn*+n?R=v+())`8r^+*K@o?8_{RTk1k6B=d-I z=wHrOzeI)tkXXE?zNGerZJra&;dq)~!{SdfU~48foY~Q&TanamZ=OLbFVjFD+;t(b zr}!^`jatQt6_?;Rz-#={En-F3aj#lR^=QIpVEG#T@y=ZA?s}kU;)TN+02qwAV9!cgpnW-V= z+$?gsgg$4z>Ky#Cy`=o=$i3(ti_JJ9T;bU}OwVx03y`y54h$chq|bFB(*AFalasSv zqr(&U(2+-EK?t9+sEq&pP)_d&t1Mw4&%X{~poe12?2@=;SY|$;CT(4&0WN7BV&JYC z`){b?q)k3~^X%Z4rG_Y2NGq6G9f`#d(ww1mO{pIVb~FpAXGlIVW$?|_jWLm8x&7)q zMMH2RX6#-1ik!-M3gFUSo2cO`Uqqy;`eWwNg0ni{%PQRfi z=E|v0)bjH=(7elF4xGFLofRm`r0JutxVAL~VG-iAuFkXGITv~!NvT8Dz@Zz_loe9s zoqwJW`_NO}Pxxa&UI&5*KW9(WXB{LMY<)tAO76~Zea^AR5t?VqPleXFs=0IX>PTjt znjwI?v=En<+Rr@9u);Woo>BUA#5s=VB=|L-VWw)PA($VgMISyT_9t! z41*_6aG;T#5GQ?RqXa=S!U(&+x97OMG5i|xQFNCbA}7~yG+Zal-{JA>bVYf1nw<$K z-N%BZa!*6~99i`Tjl%*74~hGlNV2U-N>$8ME$MY6e{b^EP`xENT}!yFD_E`dnnM*O zYfn1lLf$U>P*BsB-B!4*Kda4xjt(7=!X6Hb3oKCqQ#)P&7dm=Z5XO?cSw2hpUbjFo zWtjo_bkpsDATQ}D;!S>rq~sxWiR_b>#`Es%@zp6>JjQB%R6<*W^Eg$Q2{-gs8$uv= z$cz#{BnP|#X{9zNQi9?7jRIZ1h}REKupL~f3@pQZXj&Xf2kva7CI$b9dAgf)8tT}6 zWQ=Zr)wNsN7|ac)5!$V~L~igK!T8yT%TGq*izfe?oB*(79-uzg4OUbQMv)rrc9>5D zlyn2Os5ic8N$(CJPKQx#NiTIAuWiG+Tu>O*KN&elvZFcSp2L+5eOBhEEIFXLdxRBR zuTL%Z34|fi8XCpQg6B05kZd2ueX$bO>d3nNzE$4@-v|^UejBlt)9sGVLAR)Lx{Ib=NDUjIiOr_)tDw+!VkE%N48lD{`a& z(DXVhkbJb2j}RUjV?k|3f|cYb?-*A>=3~WqJ;I|VxgcUhHfEgAG^FT5!W{eZIx^=n z5sH;@?$qcsZVycpfrf5PoUKlbA~<=NZi|c`!y&B)r1H}gD`m)>xn4?25<(w|xnxZf zZW=Ci7=#6ye57Sjq1V|N6&6p@ixh6rQST;sx!u9ysaL73HLlUI{#%MCI1Z!AX*$5f z09UD`OT@P1xOq0~PP#xw)BYU0if-{ooi8O~=_qz@uT-U@`TT*Z(&vz^bR(-0?UGaWt!l+FVIcB5mZn87^ww>gp zdnJiUlWE6otub-#I&UY5?Kiz(C-2Bg#X5va^|PSEaQzmv%)J_^FE5V+H~FzmZ_1Y(g; z?Zk=@M;zSXW5_BKD*A|JbYx=*G{WQZ{AgL8gwwIBy#%qgZ}q|L=%Mw(3pRaf!W`?* zPZhX5+&%)SYL>@7*97V+bgDd73YP`;G~7~L_LuWi{_JaS4=ZGSF^{vz@f3(@qMx0lB&nHWwB5PhtJ0Sg>p)f4* zOwvkdplvaw#W>2dB|A*}ImNQF zOy3m5qT*`~CRCFf)ebVTr+7(pM}0Q3ATO|U@FE!uyJsuO?jRXawP-3hnX76aQ_R0; zO6-`9NmAPdg@YDTbQ#0Q8QN~-ePONR*>pumIHroI*XmSB+7XFj8&C36Ae%003Pl~E zfPk!8^kzxfajJ` z9k$3x5rlOBgiuUiU=>uIT)yyT1PFl9Z!5F}Z{I`AW_vfLf-(J_1)&n<9p(|PBi=uF zzxD;{mDkW&+Q$QEuRo5;lyo}R7h;S`y|jzWS$dLCyq^z6IWD=6s>{0bbi;VFBmcxuU6 zW)o8bkDQ0hU}Zoz2RsXWGQ$DvCGdYZBv(Eejx)%|AcXkapfPC}Qp$~Vin6nE3DVHm zyHUC0uT)YqcZK{pU zsjrGh!@)rvb2ymm5TL4fH&y9TOquQhwl5KwV(h>|+(Uhv?BDf3Ck7T16rAu59hmFWvj9bbRC5W39z zFfgNY(M|?zC^evFgA9}X^pb%d79Ve0b%B1#9xb0u(gNFN;uRAN^UqCPWHTa$;r?~| z)kk0vhDvD-QpO4q?WoK-8dbe|CQ{3K0qW>u1*jvq01FkMjusZ63RQ@c>LB9Oop2z7gQS5DX_Gpfn+9ih(flEHZzd-%eHC#cD0*RHzhvIt|srl4-`Tca#m| z*!;=>P#>X*T)FRWoL3rK6VSSN>f>7 zi2E0~jK(RiXh<2R1Y+59YFv(MH}bCw0@v@6jbG|fuW1Z>Z7_GqpTDBIia2+BbE@m0 z%wiCqAbMVP_Ze1(DUdyNvA7lE0!U04ms5nVoPi*w0l}`aVx!J}s_4Vrt^7H>J-Er) zf^TztFNG+1v=X3Du)i`54d+o_-fc%2T#ed2lli{{m!=<8{Ay)+-9*1t!9f=w&i2m3 zoM^an%10#3bePzd$L@`_dKry0bvL(96_b8{7nq0^75I6xwY|H4TsE%IFdJ^1AP;BF zpaVOoMB)rh$W+C!r@+v>*FQg$mdufGJ_5LO>a0^+G@2jf*}=iy&enc;7(aR5fZU`s zp%eFg(m>Th19J)vx&VSk?c~iq?e3L76$B(?!$#dOz>;-=Ck%F(E)xxXkI9&#w9Q|E znZe^40QOA1$ArzB!R4ZrB5G19ew-963lH<`g(Qnr zi7>SO7HcxVnifJ8xEQ5FsB}y5(TA)WD@?`D!kGS=!zPt)_4QEDb!j|oeLr&waKK<|jwWO-klK6CY?a46)_-@@s9_m->fz0J48B|M4}aP_Y%m{m_3ha4{@Vn~!2 zE66zH(T)(OaZZm+;XuU%f+$@^C)FChDvP6kjvN6mVE8 zOiIUeB#jaoNzYZIg36la7|;q+QSgvWkBuG4hS5A5p0YLyuJ{gYbdlGNM)@X9)ej=K zdzjfuH<+T$Ximm6wVu!l2ufZOkqTfT6*P{p{X*{z0u~<+SYVj;NzW1@!=hDf;xmMI zp3F?Jh`YR%hwr?S=3a@bGG(M>e^`EyL&kd*MsrqsZdoLClv6JTlE)AXwOQxF1z4|M zLa(qMP?b>U(q$@ky1s%0(cH>M_oDk=iqqr+?bMOe0F-|ow6Nf`g%7)~tY}mI> z%WO?9lwMBwTezMZnsVTGA~Y>PzLr-rk=~FB{Pn?LG2~&=eq?JtfZ_M zr*t0)3nj++72MBfZ1NFMP8dih>gc@oD$ zyxYAxjp8DEcl*X!^w0_^mGw$2R#9OF+%N*GzKp9cM1nw6vMbJ)u{1oPICWNKvkF}D zm`x{6W07+}yhhJ?-8d`2XZ;QNjT+Xe!$(FJ&Ul8tW-a(om|H~^|wZFUl zIGK&clYB}Ef3)7gNPUT1GGk1%^y_F&ihoVP6mmVP+vI_!loxz54cXzJr2vZ)O~|zx z%d!me!Qing&>|5ous(R~n~WYO!e!=Cz>VE9C7qUQh==vDXD#J5@i4>#>S691uLD9k zor%T8V9R(UEtHMp03^yIj6QP!eExAmxbW;Cw%)9~ORJvbLz8@LkQ8|*(IVpF;-SqD zIoSS&!R!OTo%bVPOJh$BVoJ5oJT9$b+D-uBztK5psU;0jVnlz5|I_rzAWLhg)Hz!N zgU?#$zTbfTZG?I2`ML4=(Cn04J1zY`@(L!Gt$ww-_GKyBG{tQ#+ z>k$CMvId`v)IO40KGL#V+r}YWH;04foD%^e_FgB4@-3yyOOqz|XrliE7Q5$Iu+$#o zY(OdX(mp#!rPHZ4B6llXQdsu*vyV_!6jrq6dh$xn95Sk43^fY3#$$Sz-;@{xtQq`$ z#2ALCf*lP;hLp^T+#K+rgW54`X5RR9q&iXF5jSsApBQJPxf67_jB9gVsziGXm7b5L zA4NGG{rEUcZ99&xo|HHag0Pd|$`J483Wa$9#Vb$_^5aBdYp*Q5>1ZUky{*cFWj6-y zZwzv&j;}KdA4>X{g8pRIs0zhJkwVQ{!ikwA>}>H8d)HnNE7YA5mqVN){br=d`NUL| z_lOx~l4|tGd$%P^yi6wr5P*}aVuF&^?J}KIh26Q=0shVs|6Tj;n^k(gy87swufJLQ!`h>7zy5CR(Kqyd z?GgOnAClECJ&~%P8J_GU`NQyhFt;6W-e;5U{5Jm&{_vguAG>`@CIp+G{0Hg%2m>$1 zSm6QA6Da{Pi3CQDb6Q+@Q*5wC5p6%_b(^bXr^$9czL`)A!+s7|1s)&#$jUhd(71XS z@Y$1|`x6y(+Xsg`rgTVS$a;d6^M)-b(!+y?)kORwa{CV-p<`$H5uEDy8Qud_o5Xw< zC)=g$rkY)jkJr zj$gkyzH>+WCXJPRHf`9h@b`E&b%8WNp-o~AjRtz?2jPF z*P9AkJ4U=8(*O8KV)>V*7x-!;M4CZ&+8ws+N0bS^3m5HxuwwwCQ6COfM=BAaYC)&c zaXj-~%v>>TVI`fD7hAh~Zw`0(%CVp0$eG}KR2QZ0V{xQS@M(&yq5V5As&CfmMC&RC{+D>p&XWLJZh zVGnJVfN;x&dn&N%jQ4r*#8VJX?~f-lJo{ z#1n){RJ;q2Hj?*gI`-McoRf*;hGFfE<>f}ZraMK=Xm=7)9zJBB1Y)Img>85!zitFy z`B3^&?S~M3*Jv+UvS2dSXfEeXtz#gDK5@UYK+%cB8gk!g>{j9rsjOcw+|}~>3)idW z_{tFe7G5h4a_I-LM_Yk!wjTT4k%DNV*i_QXtr;kSw+Mz0d^WO8+=Cv1vL%~|aK0x? zYYWx~E2UAEm$P?zce~LPFS(PD=mt}9W@2Ce`4G#!IuDscQ zbF}lES5Z;%d$=iJJ^&+V4YHXdCk}q^eL}}Z#>`C1||q1ez3~~GK`!n z2+CO-9mM#rV*RqUxBL`dK5S*}b~{?HFuNeJoWdB+44xU*-_jNH{fs(b#HnKH-LMg58)PA$vBA{?+sFg0e3{LAs*vk z(+0X@=FTEjT8wGDHH>fLFmgn(u!MHhkAe67>M2x-7X04JOqJizz@>EK2* zmGMP48wE3QcP1XY&B{D01UWi1e9>;U_>Xcja0*-qC9Dm9BQvAD`4Scb$SPd7_Y(=c z2XQuS#R~64NTK~KUK0toSPqA(8^BDNT&0(uNK z^`OZrWR1!#8u79<=*ZKjYuZf7Ew6z#HhI1o-iB?epwY*gH;*NzQrP{*)v3?N`&?U# zbiwhH&Zh^H5r|rlri5R{6?Yh4JI_1rN^*T>Bh!o1C6ILSyzRe2-Tf>iw9dBRjN>6W z=k(@?DukkQ7(9!;id~z+7g85&i-XfevYBmA=ZBk_X99aqklz#bfGSQnv|<-in%v%I zplfdF7VRlq1v^C;lZ>v^_Hk03biT?{=>Z)|`_>;lMIi4*9wvCxr7GPWi<8oNXSK7s zAkNa+<2Z_!{=8ey!EPtKv(tV^-o)SNZ(u6ZMYu?hKydnTVbcm@5!xsI;np9 zIKji|2K?z@_jzlKV;O4Mh9|xW#qW@ZIb4V>8JlSfvN!DtRS*mQGNh;hmXc{f$YqH} zv8m%>@S2k7tTWo276m&0@N;Euer=RU(kPG@(5B23wiP6YXct0&G#I4kt}+TLXf~RU z@7{5r`ISF($GfX@t6zVOn*CbctQ$7#R<}A0Tb)+78icI|)vZQht5J2UN!V&q-D(=P znpU^E3|n1Btu)Bu?j7QM3#P_+;W$pU*XUsUGqK@*p!=(j`t-t#_JPP)hy@=i@a`DH zd#cornZdl{pYTY4thD(6PRM&k48@Bn>U5{wvsSL$xC=V@iGohtlJ~;}`(`h;_KtQQ z2ak>q-|U#K&+5AFzj^gy@7T0_F{kD3zHPZ%*YfCx!=vNFa6WtcFX@@{uyTS9_5oZek#$}1}ByR$` zA`9SaF3ta$AufXup<|4=wdr)eeIjuVF2{{;=Or{ zLL{=8FUiFom_mF2a>1CL4m^#z-v>I?!TtB{3()lGsy{n#@AuzfBYYlTU2m7){VG~7 zcT|`Ev%uzJV0)XBHpr2!JY+%+UZ1==_{ox$`~3vbyxTdgxPqZMI+gEMwFem0_jvKq zJ$|g5)3u>Wa>@WEAz2@E=8pSIFffd|(2#l%=PWUzVHe? z@CFL^G+b+fZ_#AgIVB{l7!VMggn-3IgzLhK4X5quVUPYX!@_Kjx1POu9S^G`GoQD} z*xH>OqGE*T&HMUZ=|qKJuk2SkRSWcavAeVP{9{(S_)3oI;fTPZ@jGw<-44y}?a(|` z&H@N3MiSiydbn?Er(6mA(v-^|n+u`Z4_58kKkQ?5+kMN1{KEjgzw`3~*j^?$AZ$H! zTuvSO?UgQ#e;8=Do|o@5w}ztTfIz3xCG~}l-kWFtppjp_+51P0eDIHg#_NNh|3M=^ z-~H(yH1h60Zs=!Q`~N6NKRY=5M~(c;KWu0a|33cg9{sTQNeBL8uV^^QAKL|v=tp-s z_~?njq59Y^fYKk^W%m>MAbx*zpM%4X?()mW_W`W=_%0v)l~=Ex?e2d(_v&@#y&BG# z2ChPTCy&9kig)RPUvO8iV;%;>Y+R+f)sI(^0Kc;OZzu7`Z{cSanb4d4S05qvKHEPy z{)pxu*LrWKwBK`DZy)S$Z+*=0+j|F#N~Xupwij#oU$0`>RrMqPh0Y2UyEx60xY@&T z@8Np&_&fhydjbSYD!^C*$^w1rdDq%LJO5pOl~tl}9lll#U3V=Na~J+ey>>pO*UL}( z*2_=&*743!C7#di0AkX|Z|U~d-Yuj(-ceD6Z*Ce@9fgmLNQ4U1bocx8xN}PGD%7!8 z>WDg+ijJh3=`Gi&W{$UZ_da&+3D3t(r#$N6&heYWkGg{D;W2Mnw@hI5as9is#mLl) zgTuXpgOU!TPM7GY)VQ~NdR<4GV9?ixJD)P>!}>vw|6!w6;RlXd!+sq9LtqA{a&NbM znnRq5@9&S(7~nPc=CE3qT{&+|N=MEJ{jP>@`f2MBzFG^y>XYz=4mf|igc!95 zuP};RTaEZ1VScNj!TckL2OGyQFuHF!t3Rfrel}pkxi@f(#2*ObBGqVhbkw@WTKCuJ zmH2(5@wibK?+|{Op*zKOyF+a&3|c?1n`f;_OIy)wu^7#gz(gCv(Y+b7o2uu!^J${WAoI51z6fA_lw8( z`ZBd z_s&tvSn}F}|Ku^`aR4ST?oPTF_lpjq1D3UwU&Xlx|DvhUK4E#1*#-3|+W6J1IJtzs zCTHI_9>OFWxQ$^Wna4%kefmJ>jL~PXz?~BAaDGADByF zMt^U9A4`$p5`sNPf9@*$%0}cY1QT;M(f4MSI;{dXwM}-?`(q40>5MF_Yu$+)iil~D zZHhD{@-!LPCx)Nor=@e}Cn<0+QzdAAnRx=#`QN@IV#zxGw8@v>X75(uUvdfSgpVoE z9F3sSb08^d8nsJN^e}62*$n?dtMSH+j3)1#+%o4$TzbsO|2|Zr*X@Ce2G?}mV;Ig- zKgxq9h|o{@Px8&g{uYe~HH(ktB7V{x37q^;6F&X_{7)4BEituU_8ar#zgNFrTYdD0 zwXav#AAS4n8oa{z@2|gG{dfHLKjX*7f6L}`1bCDFYT7)%aA@{s-36n&v%v^!Z}6Ze z=RWjUAC%*)T?U%1!+p$&%{5fq_qBE~<=^b*wi8+R3Kr74!4OI8j}b)|6xNCB=6d02FB<^q;y|l>fY4ac)h733 ze&nYVp%EXm15MeI2cAX zQMSTjBN=otVJ8J6a!pwB*$=j#6Dm4&Tf?B5bz zwMNem0aVi>j-J=24a4wm?Y;hC>)Gxx&Qu;f-+j4zjE~k#^!e^SJzDp?@awJZ9eni2 zJ^ID<{Mvls)z;CEt!M2!cUo)7lP3xM+IEG*M0^?`jN)nNFa++hU0fAlfq-kd{%nBYCzIn$?iPx$iHNJ4%0mhCyw89?A?>vM8 zvK@}m&(5-GHb*Yy+n#mq=IV|T=-tHZT0o5N`i zyPZxbBd%7v!qe^d$<_pwns?Zsxza@H(B(4J9P=RLkg35+(rQw4&q;cXnanA5bV2!` zi5LO-@MWOVj1s(MR5Nfk9;cIK5?P1ol&VD0E1*|^9cL+4N7NyvlkTW+QI%MFGV7gF z?r)~fv^qN$2QcI81FTj+03?&-*SnG}45!{|A*FhXhX?XM6vLf0Qs$EXTv-ijksLb|73jN(c z1rBY^38eP?`<(U;xm*7C>f_b&zgM3p>+oNFfLi8{_T4JXxYP2#xAjI4fHL`)JK|r> z!u*linAlYN2Faf1_K+P>T zDpc)>wR_%U{MUWzqYu@fVOmqbJk z;l6L>gF%r_^Fd2KPLbMEEWCn+S6kTVVX_8yuNM5K2)=fZvFiw9Moqz=f|+A}jJht& zbJxIh(;-(-`O}i`6z#8qFH$8cg&A^uE;p`bP38oZSYLN?2|IO_Px^N0S)s2e_X_-H z`Kd1mB*8KqO%89;Yv8Y_V7)H^^0!$RR>{0dagI5W1^<=#!lL%w;Z^shpz>f7*aH+A z?JUy273Y*K9i0;H7*?xWH67s5yUb*r(&~x*!ITQV+;+yLLyk_)y9LHl+63b!?e?$} zb}4{SZExH<;4p{fO(#jq<&UBuP~Xk9PX9KHn|3=s?bK<|OVd9doxq+TvRBkP!8l~j z$z9d2H%z;e9x#k4Cho_y``Z1irUzz2k1~1JO^J#GL{q8*z#9xrrZk;|?=$){>Z{of zw1^PtLW5D<==R*qO&)LecK%Se3^S)Q6FuHntU6e|Ed0D<0RPoj*uQ^1<0sbt=93%~ z9DdOpp!4~^wY5j^F4F&g_uV)D=KuZ~KY{*NH=h~6ZTNFGB`qQ6!2QU)o-$mN+jDRC zSzT(+$`qXyYU0X#oIx|q(W%BJL&VO~X)muT?_i!l11;__J;w|`Ql96oR@9iB!39pG z7+OSKsbo%r+j0n^>BE))7#ReEK&O1Ye1Ic=A}feUDNlF@{Wilw@#Q63u{ga&BG zg>-B=NSED4vy)K{S)QTRi4=$}OQwA0*aySzSyuLK1$#S$GvtS25qIxEL_Gb(;a*MkK8hZ>k;-5`{)1ef3qAAlnY-u9hYJd;$k>wJ8 zm4MVvB{1F!NLxIQfvJG-RmX&jO!# zc7oZl%jjKwkm*FrjO`V57V%X! z0{J5>c`fT*4=S%vvI9Vy3J6s|IQrmP^#@_5gonXr=~-CxWirDrHyIR7d0fncJ^=1& z(j9*a6{QqQ>>0qN0cC=;F}Lo?-2L$A;|m-ML6eE_$p+LEm~icnt}Cz#=O2VY`-D%w z9b4^(j)I$_o90s}cur;6_&rzHlC68w(;l3wNk#^~@W^)y+QD#M?r_&0Fsf2kdB8qY zt`(IPJFjrPzCw%WICvD)#jmWa#MM2ugfr$Zj4SIhn6Oh^>PQ9lutMqH$rT!NZSgy_ z(6JzniRU^v?XJsW8^EdJXh{{jeAMesr9QlYfGKPxx%jox*CZcz&k$#M+Hoy|NvTGZ z&>+c&HUAjw?>WAKZVCn98W$rxc1aYm*}kdkpod2Jj<7skKv-QdKeT#lam?Vh+^_9I z<$L$ACw$x%Enll!_MEftp%TqIDEVq=NOk%6_?vVURejRz>5Uc-j46iox7?!4jF0H#8~Zap+dnvbb?4FDie#He?eKSeL7BPUC7Uq4-x`zI2#aK3 zU6DRAhwyJPE5;x>r}W1Nt$D-7hmCO603BgN=J9X7h{_(GMSLItk#%l_cZV&-?rC8~ zA@)CWY_*P!*Qk&IakJ^rh<@;yTRZ3%LDm(c@VzU|i1; zWCh4HLdKHs6UGhgV z(_Q}w?5PuF;+-HlM@}%m(34B&P;ut5|C5igJDIVN6fh`v{V9!wqIPt)YuHbNziS)O z83<~Q&*hr+^+z%}=Hu(($N9g(A!MS9LbRfXxt<%TK5nJ>C}tpWhmMeKtDbb^4*h*9psd?j`@NFWp@eBEP)mIr+Ezx4gu= z*uTQR3?U_!Jq!w`rq%qee{jd|9(yS-$(z}|Nc{cg8EOo z`RV{5UQ${D4b_crj$bVQ2~|+pcs3;4`o~s#;*WfiR+vTOuyB)iJ^l0oPamUE_HL%X zyxHHyw0(D0uh&*zz|Smvd;9{#jO*`S@XyS9B~t2RDjP>2?Nj(sUqCD295RCV8b4Y~ zPH~lFR>mv(&F=m&`MW)Rnmk%w%wYxYXdRGK?U4S?Ivmt)Lr6y?YHEq=E*BQ{M zvLU*@ww5qY@q=XbdV7^w=<7d;rJO}bEEk@g;{AygF40qQh}0U*^N1*y>b;PR^CCmU zc?^p?<2M(;1Qf|BNCi9=7Vhv0Z6y5)wb==DrxE!|(C6^fTPM?zmyF;ALTA;9M)1Ii zMc80N}Vmb7G0 zi5$*9zx_{(U$#N)MD*qV(m!i>70vLs^;P%l*L*|GJ|GSRr>ch)X5$psR8L30kNdN! z^|jeIhjsS8o@@^_mw1X;^M$Z9l}xdFFB0JC(+o%*8aI`mc-xWP0Rg{^N^wscF#89z zI{fX)lT8%DSao-Gj+JY&sgRxWK!HLqgh(Yw9zLYWy;F^Ix6jpO3FF;BRBWWzbJXSD zrh$tu9vw{O`wGsV>WPR*PNye2S%$Yq=(g~mCr^@Z$x~Ur|LBF$M3Vn&@+}cxrc5}G zm05v6u5mr#sr^z>Hi^5@_>RljzKT+If z(6;Y>3Jic?Z8G9WeOs)-RDn3OWlkX~#j@SOGeuPgq#EZh(g_}8eGRzC&}214iz&)m z#SG{Ns#*)XWWP$jQOQYq_4+xS%^A9%c=3oD&+$HOS1sJk6Q%X4pJC-{Xv6#!t96m-PUkBI=Vj0wE}W=27)$_yU^u5hndD zT>yT-sh8|Nt|3tUMcpcx|H)XM?T;0LQyX?=w?G_ zo^d8pI4HsWqgo`hp)~!6PG5x0(T-I*U9pyD-5QDn^e9-?L~B6#iDueZJdZ`f$vaXBV4dy`C>f1am0MX`B>zE?}ZGK z0#@prMG9m_DUgQ%vycrTHh%zYjA1OR)S5!Ziy;c`bYp{Pz;nlIf^%EQ$9XsW9ZC^w zyj&Ixj1!Y_CGd#lePwR{vb~^6E>dQ6!Xu$YX>c`(EGf({@jV2-Wt=~9Q_x;1o$&6G z*q_*>h}ywHz+cLA&XKvf>SN`QSSG}g)NiMPtWZ{x68%x+2+R)T%8cD%vV`pw-qp^{ z3tzo)j5_jag39`^?f1$|M}4hI$AN}`VMl zIKrJ?<0Gd*;#hg`0PBf&kv>pomTwa#}G@hiFSw6F<9QZbv^~=wPh2Um7$SslhW32y# z_SX@7Mm#P^y}}MbKuFf)T*T9Jz<6qaQ5HX}p?DrBNCh+x3}zh$4CSRW-y=5JaknUJ z6kIUw$UxSB=0k+w1QfVRvnfxTN+tTKIxcFi=%Lul+N-3P1u^b^gizKgQC36U&;uAf zrmC*>KoR;S>6~)c0f{5F>27djc#lzYLXOIKx*VJg3&)}hDbeUcpcYOGKbnJ1h}K3) zWeH74UkrkbfS|a3C<3Ae&k}$l)M^olE=|C4%(4vF(2IPMT6xW{q=t*M8$q~V7NJLu zv6THZl!Dko7j^)5^#tKO{v>p7tCcJ#DDm&xgukP^?>Q3@QCv8icBL)-ilF zQscV6Rz*T_$0PJ&G(}BmtnY(~KaQYL>$zF2Mp(5(;E}RdK-Vyp2l;khbkX~#tNf+x zvn4IAQt9!FKfT^MKEBg<`|IlRuh-wb`1N{w9e#Q7{N3AMum6P4p1pXt)Tnh$iTzTT zy8=Glvs&urp+}+7@y9~n!Q>hp<-_G694&qZznC%5H^pxuy};!UyS)^1oH!jMk1Akk zh$Bh0V@Zu)37)EW)aa@V~ zKhAnz*7bva=K6oEee=!N>)#sx4|u<}j<5gi|M5@wvHl;p`Rw}fvO76N=eq5DI81v} zjy(GaCy%pU!-HE(mOM^@#xHQ#!dZcOy8B`FsF&MEKkw|kezo<> z9XPJ_iy&4UDB*;b(UXMm6|1mAzu4X9fgNU%tssF;k}~7fZgIfdu!m9 zz$U|XlY!fG!#4D$xYL4n_-E_c-q!Yyk~QwYUq+=Q6@c1N-v6 zZKnj2U&q#%+?%|xab5oF9Rqv^k>FD_BsvOQr~(aRM;S<^FHvJGSD!4rcE7o>^wREA zRucUJ${Pg(20y_f7*P%K(!XxA%0fWbV;=arZL`U|Pj9rrh=!mCc9c;x3N(OcCN~VG z45nyoI69aQ6p@EvMd?1-h+j8=YmZy9TW$@A>sv2g7jK z31W!a0{DLG48aKuC%M;mF#PY=yUr^?7lM&Dlz`|4N8|azaQ?egp)dF(uKWz`jdy;- z(L&GwVL+b0RgNXFDvjitOl7Q=jx?>F76Nqrte4|^8cpfhJ#dw(F zu5-5d*(41}pP&A|UFWnN1Avxe4Jq;ROZjFxK;sVh)e^=|I7h`3;2x6h6i#NZlz7H| zAw^ps-|TTSh3s#epY%iQ8(<;GpFZg=KK!)dHi@xQEk8h&vteN_edSW{h;lb}l!9m& zt`bl6I8~;40NA@eg>$w1ln301n(uAzg^h>3;hg5%ar55X=EpxAQglu*oAWsxULPJD zAB644bDG0FfB1asc+1E8NS>k@1{p!;Su3};9}P5~VKD+`B%Ycm9R2Jp{9Y7IW5$85 zfzRv*V;qMXO*77e76(>K$;H^)upbze!|wyt5Lgy2Kl zCeO2(kcf>~+0W31hA2u|KBFY4FemQO$}zdG|NEq+v@UOVk_QIn_!njSwP)FM3{cb( ziKQ`W@q#DV!P{d6i1)IBSc6=Z+oIb(P5G1&mq9=wO$ZMQ`@5t&M8Cj;e1nYQ!f9v# z`UsO969o?Z+hlvrglyDoQ`M$~;Dp8oqDdV@-H8_X5=0%lk6FI(W@9;oT_ey7IZHWr zH-*fvB)bFgO~#CT*r>yI5%5ypZ<#KTZXa{^B43S?PGLnGGI?>*J@{gWL?p~~ScJof zzYTr*F=>)1bw?K&(;1)|m3=|{KF44}ayatODettTQJhY?==;-okJK4`i%VlgXC~F^soIfr7gWiB+ zN0RIEG^LPaz@{eilFd$1pW*)3sXhLV;9fV_4@~x>s>CbMLqpTR=jf@_t0-oSd>- zjHY@umr_L#UPK&b+dA&>F4X`WcPjE|S`946YA|rTw)Iwc27F3}AvkzGaOVoI>%bkj z>Q4F{@vtqJt}xkPv5sd#~&xIBt! zHXQPFu?cP_3`_{iXa{JYcjT53nGg^khFV?GHL(5mrpK`YS2!R~8Ha(EYaKSZnbz8l zP#Ib8m1Ao9q^`cyCoKdA~cfLGDIQ1n&P@%3Enh*=%4^}^~aanC%gOGZ3+7DD36F`ysND$ z%+XrnnUKJA3jsnkrU&_;n2MgxqoU{;Q$a>c=M4v-eR4`2NW#UdCb5w7dl`clJ4NuOc3famEOfQ%uv#ljDOo+du3)U-L)8H`p`{)+Hot zi25VqKON)mHnhatla??OP2|+wBGY`k!qGDdK}GGFv=jH#^EldvDOM4ZOOZhc_XBY)+TJZ4Xh_?;s355cn)-Pq zz((Oc8YB*sDbj6VC&rzn2MYhoPstW^*4qfS9&n^7FKkEOoaIOp&A|Dtu;$5Cm6X^b zNuGVCNRG!k52p2fsk$Y`Ch~@vZN!kLRc=I^X)OH=U@WTfY5F-T#qkAn zhOdx1e`$r`t3W#pT-qBrZ={vdXkp+?MWQP@KDRoF(3mfT7*ki!5cz+y%pp$-O%Q;{ zbJKl-PGu-okJC}mgXC{VNF95O$cPf#`Gke$^E5*_4vTzINIL883&Tw|r&qIa!3ay@ z2px1_>6$<(b1gXL2=xYwD)0gnFHnIjKCFnm&Yv-tH zR!Pt-Q7VQ9O`r<^a9VuPbSefb^mhAw5>s_eUY|r4hJ$V^25&n-wZsGleTIdqX1b43 zB*_6B#d0$B5Z}itT%{NA|GiFSVT3=$^IY5 z8tDC(_|#`?at1uF!2`%Kt3-R{**jnVSd_FzHH;NIjb3>C6Wqs3vrAPBk1tzc2B_H> zE^;_Xt=VPUXG(K7-AozqJU(m&v)#mk9BO_=ZV*1`)u-HhimJLmt!~Nea{1|{YM4mJ`dJ!81ZU1p z))^sOLo2KhoDjzF|L3{XOFQiraKv2&Fni>&{YCkpo6K?e1ye^hc|t4RfAi{i>*bLa z)GgxxnuezsA+r(Bj_RU&t2I$&jKx6x(y~(lnu&_J5j#_(!RYTb6E@U|SzqetGfC)D za^_j4`DqG+Z6rC0Eu2vx_e`jd3x@vcs$Wv&-3_9JIMskz@(Zp0h8ig0ti)c9MLS6g zjzJqLWuB%}5QfEn2#TVR5E>^mf3kiplTU-X#yDA-t zz76q{6B)3C6Q2V8Cj2CVy{Y3r?Y1E4$G2(DPK zn_&5SBpibB9f-A=Yplg2_tVF9PHS!(nVEfpE*m8FvLF^@g> zC$*e%Pr~L|7C{-D8_x4-E;Q0&0$^~oXbUlEC@jbBIgy8sQ9vq7Cu&DJKdd)sM;dX< zC)J!7BX#f;Ho}KXV>k~F@T?$HxFJLVy~ljSLt0F;3v3Oi_&mP?&;#mH69gdX0{#6a zAq*{9F!1%`ww^vcaM)MR8(v8FoX-YzB8>z8y8IN62(8c!B6O4{uB~|XG+WZY1qYFL z&*7bgt59X5%JOH8B8qq%I3PF%MwPi?96@(%NQF^a^mDqd-+!-ImzpQEJ8enD!bDm& zI9*yt683ZBm^+%)Sfmw~Ah~b=qMyW4m1YWO_tFzmYJ<$nYz14aSc)1!L6k$lDPc69 z{3S3kabFfKN~nPxoNSS!mf_Kja_m~y0K*2d(pT9(8+En-TV_l|A!p)Kbeg*Y*Heye zCWSqIAK_kiY=xiTYs{&ql1-N#1|E~`NM&>XM>;-FFVacwTSxcvB+sYhd5E_SIquPw z?L?@8GHh{}Q=lTDL|CyzLG6qgx_Uj~qD9*fUbTU*nS1Z{18LOoWRjl20FxW{{$gqd zQ|P@uaSKK8QLy5)lzB2%zRzR z02tJXT&0_cXr|in0X<7cq$XWJ(yufi+@j!j8P|-qn^YonmcCz5=^kiv33!nZ6A_Fo~L@= zrJ_Azv0{ON<|0Q7zKjbAKPtW$B^{Hv2Bp}8ugfy(9kYJmobgWFb2{krb&-*}*?3zb z{-HgP*yssaojHl*815b9!Kr+XI0XVqxD*TIYDx(j3*pkhrChP8oedQF0$?Zo3VP-E~JqQG{Gfar&W|H*!W|Y!6(+ z42PrMP0kOA9uSj)?nMD#Tfvr+htnvdFDVNYIA&XY(LE0Y4&3Lhr%PKM(A~7f;%9du zV9YE)CGn0P7$D2EfdPWWR%d56<|+kvkhhNnv0-*@__iZFLUqnN$}|bY5beWH8BL8- z_LWA6=@!v);P`ZR`NY_xR!1pDiRaZA2J>iytFJa;<#09_Sice!#Y9@^&$!|-(qZSR zm$bOhYj!anW~tBV$7#&YD9eRFM8eC{wh|^sm5{-+bctpy*LWRua)u7#V6!qMLh_{2 z`63hwHj!|P&PIm|ZQ#7cH^oy!frAIKU2Cf=>;N7Yq#X!d8iLFOD{OSQ%48n$6;CF~ z&(hB>KqS)LSFE&6l(@oahN@|>w;r)GqT5hDj9z;a2NIo#{o3H&&R855!%9;w|5B0} z#Z?cPdK%59%4~G$Rff)fsHt1A@)j02a^Vx+%>&E z!PtWPyZls8hv-p*hYHfZk{UF4(xvLYWF-CJ1T81@KyIX<|WbZIIg@Y(6mD?rlFU zdYE7v7#8|s3lItURX$q|rwYwn60dbsTB~pX&;&k(AxnChGGvz%%wU*d{E~Z<884!L z+|?-=d+dD&P4@XCzlpl(CQ=r)ZqjMne6RM#(_|SqtuzOBP8>JFoR1d(_`)oGSlFAYj}x7&|D>pi9N=%ZDZt;+=Yo(Wa~*(`~@Y-J>&J;^)f{pF{2EQR}&6 zKGtDb`uqP0@gZ2g&MmxnYLLsKh1mHN0*j%9O;&_xPYm0V6H7N-6Ao=pmM%DhK9iwzmI`E9#I?8yj?jDg*|I?i|VtVHt zMk0RzPuZZ!>=MY@3cABopXymVhJ+cnT9pQu;WS6ThLxoCGZ_}mGsH*^S~;C%6k@_E zWumZ!TDd7@zZjSCHi8?6L&>N(D<;KYPn|(VK^LgD!$CL$Qz2G#&W74F5N*b`SluL= zUd1N8rsqq8`I|IYep=+SNiVIucknIX$$NA4&=yK%?V|e9fnM)}3#UAy8a3mA)zXHw z;DXV^DQkD!e{4GMQ{(s>BRDVsc!JxUZ;WqQ0-T{s;EPJ2$$Q=5vX&^mZ6PuUt^@vc zOED;`Ti}0n24VMP?0?l+)g9?=aqg=?nC)$OwbUC{y6bol^oDqlYW5J%cWkr{5d^zS z3k9-SaX9$h4;9CBZ`M^WMGlW(#cE;Bs(QBQKpY57KA1Mm0(%cAP}~7$hwXmJ0YbsJ zR}aR$dN4-&j|&~gl+mxCk}_67USuZnYODgjbz5|xN1TftkeF--Mrb{d?lzjcQ5Cic z@l4W9B1)*%G0|92T66dkRTQB(wJ|&4uav_EIp={J!@ez;4xd#!M#UA(`yv+s~+M!a6g^=a;6=3{ng)8xa z)XWqUrMrVrJ7gvhFg#J{T zM1KF>>4lhaKCf^+!bJnxjL2ySq2MoCbeMcXy?_kB9}(YiSw}vqE}CNfQZ35X%jn}g zj3OEtkjT)D+xr(fugN(&BZgPo=X$mz%t;;*OlYkqltkuXvh&OF;nvB~@z(Z_3@Cv- zU@VBr3#Dr!oSaX4E#6~i zfdg7#p|?3SoNRSw9nV5B--~zzdX(DG5OX6(YSw*zQk;X3ELAmNt{Wz^Hyh{uHRHN_ zr=8#~q=uxynW{h~xfqm6q1PgjLQR3E#SGc>MpmGevXinS1#|#z^-}f@TnLTPm5+kB zYn{B7Y$}n!+mH7ao7t`XsC+?z+JrT+oIglp<*G=6s4GdH+I3dd)#eUBlEufe5BO$5s8J97f^I;y`rnyDpw6s0Lk74^ii#%gU|Xxv+~1t;Q6v zasggr#TScy;`!z-_h~iLhlw&nJ9FU;x`6PU7J?9sbiY$A*F#*+VLArhJHaX!LvkJ$ zJ5OOEqE%;tzJkv5w~{pb*`&$VVGJN+muwDPGYM-Pk;M@wH==tf#wj^_$0q80#Mx>5 zb<-7sF_?~qmJ1TW2FEB+~XE)N!88T<@ijBq~_RhT*mN3&Qt0g}KN6=NJDv?Cf)|FH3 z%6iXTUM;yJ3dxMeyo%W1hj~8sqdGcxt{3;rNfMkPjSI70nc4@G@~%ef2Rr3+Ft9O- zOy*_p6MG(=m#F7a8H9!H;i0PbH0!4#&IZ+o%#Gr`gA>83d+?8|Zi%d-KNbYnX?CGP zo^GQ|#9a^OSh`&Pe)|6#Tv(4NE5wU0?7zxflV;Ll*Zz_0I;Y#B6iTA^m95Y?q~@?$ znJ4P>hPux4k`(QMaDc$74&9*`y2NUF7njb>P|gh-s_KkX&XBd?xy{?nL*|6k8ml=~ zl?PLBD&Xb|tw#Y15*Ur=S(`HTyojw$i`tt$+zo@>=54hw`L}Gg+#r~QSCTw72Xz>r z9)t66!2U4^5dw+p;Ipt|p82xMfcY^d%tc&I5@!lSzSSBlH|kN$C7=!56VMyYNnO>r zme0Ym4_^lTt9=tg6#8F&5Gia|8~J zNh9c4)psjWSbS`#I5X>Ng~Qq4z|5@gm6-J)P&N($mlh5n+Mgr9=Z`>=iXx5G4$G-z zDaFKcF?4`Or*bkw&e`E)n?UPY`RO=bd)rQ6yF7v3LKE2j^a+@l=Y*++Zhs^h)<96C zCqKXr4It9fURipo+slv4^cuh+XE3m2>J5ox=fsjnivU8B7kKi=i4v2gX`v*#2&Zs# z!n6QqFfBszkZDyY^v{U+=y>+1p(Xo}I0j6M<)_8@WYLMo`4w)T_^n@`tqif2!MyL+ z2*J^%&AGrd`9)I-BsRUCP*PlKT)2{vg7W0!Do`V468Uwc@?w`&W!}X!m*m)Dwk7ca zRsU!`(40$cmu_xDl}N}fsC~gj`lwEenszWIY}_S~k|Y8wISZmL%#GAe>Xa=LG_KR3 zWQ$sI(z9j*%3LZk5*EQM&M8W`xkPXRIjG4o!eNP6AHbwSUtkI|*?0;1EJM{%>!oo= ziYwF3R8~^-KiJYu?zSXF*f>XVlTw-3%tDT7$y|klIR6k|hd~j9lFe;ttTHTxBA^A1 zR}nBWeyunh#UP8fsP$gPcbW{zI+G$^T(t75jx@C%Fiq^#Bt$gVIz{aAaHZr{(u0sb zinQfxm54gD5dd(p2Oha%La?gB;(Olo$H{o3OlughEDLwpDxnE( zP{YAiH)6!+9GYoP9p@aISi8G~#AY)Y2O1&-ojZh7PmyX9x(IJy43o074f|GyH~u0? zv_4yKf5FkRU5@zuJgJ>0vpc|ug(4$II@a@RUF+&pMdVg`1b0*s??|=!uEMZj9O=){ zR5O{bV6JAM8Tuy)OkX8m>jAejqVyQ2*_k=!LsHbjmi5z9QT4st#@{0bfyA!8PW+j5 zcf6>h%c}6ujFc?v_*yTVqCkBLh8juvWjggaYS~YWBT`(x6`wGmDQQtOOh-~*Me&zn z-zjCcE1e$t+PZ#cQIm*E&7vAouDlr#7Q<#tbNzsFm41wxtb)pph0CqTDae`aq^p!? zj1&8n^BD4}<*GNW+!wvk(oN5?#!Qfc5w4HMD4$$(hYjo7&6iG?A(i&HGS6v)8a8yy zx$&)-!MLr8W`Zx^)*4No@3X1+pbGG@y_;;DBqK=k7aY|-UiOqLEjp?67Vtw%@%zB< zKX1+YDs?_T!A_(6Mk@*Kk&zjWzvAK+u$X$_ z>jJHE`K1=Td~n%GLTuM;w$lsdW{#->`^D*v-0Rrm_|?hFZRZqxZ5RHzrQ zs|MzsYpE`7cRDLJM24qp9BD)swMct}konblp1=1T&Sb_FipBWYlfSuv?P81C0^qqu z4ZbK;Z~t=JB%3m33pc1AqAPnO#n+Zxf>iYXEd2gHdBpApQl_=-wJS95W$^!)(wbnG{JxoN?;ahWz}Yl9d{}`6y8ANs*<=(Q<1jc0hvgmh z4F#TsZPfwlw!IT_c_I%slm7{4LMZ?Rly)-R(G98e{hI8q(f)@yn|a%+cSsQ+=)leo z##3NO+M)O9@TMixy~oM!4}NsmN;P_ggVFI%PR@GY2cquI$yIkU^7VYNg~6kSy9gO< zTE%;uj|=&NC2!^1ZX1aWKr6j6#rfjgNV8EF8kpjJ6&YAZiwHE8E|(+9ifryN=NFAs z3VZYYO(`#IrN4lhW=jgiXwJ~=D&ES91ux^dFEzaASWfkE9%+#ocIJvnr z@!mA0X|#rl*zKqwU_bB)!XpavtYN)zWE!|t=CoygUgm2%4*LN-ZOf$}v(K8dHJ3yp zv(W^NoI&9Xlnd~FZ|ajaTeHzaTo&v&U?aOV;W>0@B749O9COi%_^md3xbEkeiX4Y_ z=}W2bl#GNIa?^M!iTXj3vf>Dwm(`@V@G1atMhv{>I^oE0yAZV^VTn09pdrK5=^&~V z3WQ_@sz3l~l+7v|M#$Nm;y=Vr82HT}VJE4Mw&Ahs(8pEA}P@my@;s)ua8rL!B z^h@%16<(4_rkKCe89SbHyS*P5bhixqH@$izP^N3Kx*8_9bo zepa4oPHgbv#Z+YvuSMfwCIrG!ULkPsMOuo4(~>V<+!SXUA`N*{Qt+3lf;})+#~O;e zCY{0UA}@X}u)!i`VhgT&@W3T^CAsF@)j&}~CT*J$k0~_Mjg%Orpel3toeO*>9jqU( zq^woC7#=;JR+eYTc*!|En9SHZB4)M3g6c&oN(<(VK%S47BD@QcU8lloOJB*P0&)~k z_qcTMhfA_sxLtm+Cmx=O$vZTR5978guDE2(2c&dF%Usr`A-{@ zwWJ~6HRTf7B~_X)s(NG<-}%5@9_Z*oI8+MNSV@xSDTWagv3<>zAP}n)aJ*z1!#fE} zQf*m#nS_-rFE3LdhZX|B2w7+hk2QKFEc3XM>_mCnBxeRT3ljLRlq(-_Dqfe7y>z$H z30x=3-{Q)9Wi4(Mk0O@SI?LN~!^}6{W+@7C>}gdV%X0n;j7i8Q^VROtV-}`%oBxQE ze8J&dTD*u`udm%PqNp2h^PtPFBN2i zsfM+^7b{8YnU9%^EaUEAJHfQ08creCot%POhOYYgx(%n(O!Zgj-P|BdUkm z#`NphIkx9_T&6}&DBeAj42QrVENprr^=19bp$3zDP zmkg7>;8RDsLA-n~vm)|~FbRSW3p#Ggeh-3@C$nNk*%xpm0MK}vgcS;VKKKD@FLd)hv`*6#uF1g z0K=|Md=PImo)DV=RB?`{0ru_fJ2)`nD{yl3=J2OoIOiSqiO1!=JlWs*+3~O^TnaJ~ zj!jxCvb@q8^%v%uzfZ+v2WaQYv3Qzb z)zGAa1t?)?Ll|lCMk-^<- za(`xYB?2sJG{m+*3)LnDRBO7N+ZcL6`r`Duhb%X;1yo1R)iahDZo|+}#oL%Ir^&Gr zW)8_8`}nI`q9QK#V;>rfupW!3%SM4}cc*dnVXz)gWv!eSt4x4s;hg| z;N1IsGIdTzP1XRs`>4N&%Rj9|Q1o{0&N!1Dux>TowLa*@(Ec9WazKa2!)S zc|+0?AjuqAhPXRPZ&!C3mLOt$s%%V)-d9%aGoz?t#D(t~w!D0+sgf?ADxVeHLKMbg zcwI-JV+RjI;yx}9dnAB*fyGDlh4O`HW4ItIz34cPSXa`>TL4@NbrlgkYhu!^Z$xnD zW+PL&B@4+cV!?bOI!}Oe66k`&N$N&1)_G)#86ld;Vfib8f}5$T z4Ew|&AIvAgD;ektduc9bVMbh;=`drq<2RKDHOYX&ygKN+RN7$5HZrWrIAekV;Y``T zr+K{VW5>xLo??69Xr_6{&se`zKG9?A&{tCip6{8lCuRO5k2_8{wMQ6rwl4oqpy%V8 zi_h}dD7mWA`i_Hio~AAy1vkL{(cW35MzD<`q&Xsj9Plu!$0DA;@#zzm(fbdR@y6xb z(3~$pS|9O&d!LQ9ppkdYtV~x@=YJEq%{i6i^;60 zk^Fq_Q6UCWvC5dNt%=*3vFH-97BMes`h*V}!EZkqXF>y1v?T`TOM32ocgW-NJx^j6rmFK5I3j+_D=bjDqIyhQ9q7 z8{wU_g24j3O(J)$puy*EigksGtk`q6r2<63VG5QL-d=j|7><*x0K^O@eWNgzi&0Z7zjmrlxaTg4pDhmxR}sW)LG*yF95YMZ6`=~FmH(tz2(sD z)VV{vLPH{;Ifo4z$HcBH{Xj!%{t(Ku$*#Py0#$g>p}J(zc_Z=4*Yu%wQZr4sI6aZZ z^^cDs^_S>i#|BojZIV5VXv3mMN&1Xt7r4O^2eW-LAxO{>K`@?XQ&gC?kby$2W!q&- zV$u}X2=#gRZX3<9V{Mn}ax#qvk=X%KcwQyU*2I)l(x)QJ913!?!GK5dgvN^kq7ZN( zi18&>n!}dGnN-Mesro}evAtW=PX2QoAyer4UYKa#$fsK>T`Z$m{4M?Kx3F;07_VlEg(h#kxT_pO^pMLOUL!i3!xrAv0|{*1=!HEt^) zp-|AQ7O*D`@de=3#LN`aN1(Y%^0raBVfCk$3*~H*1OJER(x~&rY}mYC_A*PS^p?I@ zTWoy?9UQR<9*SkE;nAYF;SOnYg4-?mDp^}yZG(76XyU)#uF@i0bpINxORPmCk(sAd z(>`gOVm@m3w86O%my(|;b0Fts24?Dle2lPq0_)mNvoo~v&3aQx<<5!i@*WXes+7R) zG6FWNXe&4X?U5^pkCoZmSd1eC5K7+w;5m!Rw|)-zo~>)m7vmL-$MgEy57;|Ur_w_!1@IpEA3__ z3fufR=aI0(r|A?}ql$x}w^aEIa!Cp{vd;JxY0c8<47*@5l7 z=toKGsVEOKm=zqLg}G4KuM2N!dCybnr#%eeFw^&0JS#ZS-4URCmkOBRSdQcKnKGP| z<`QMJctjMsZjvTb?q)lo!w+Zs`i7WH*8E|pUNfNaO|okhYKR6_&Dc{zg2G{JVRyXP zR-0_-y-2$wlhMD59G!NnqRXZvSktxgF-&WE#dFXwCY(E>mV-=SJC$C+?G`M>4#Vz0 z(E^+z*svhcwavEosteIw+ts&n&6WIR_-6%FnS&;^BuTZWdH=?*(06%aA@&gV$N%;8 zY4XVVXCXx}z;eqivD`MhLgnG~Vc+hO6*j;n4;MA}mh)_ZZ5r6R=^4VrDfSk)7jiGP{ZlB*)+8YWDr$-q>28h@Ua zzf7~_Tr$K|FuMV_11iqD7fQQi=`C2$FvTUDcZa+nga$^4I#?Hg-ZTw&jm96v8pFVr zX3Fp$zE&ZDC~c98R_B`dn5^Si$a;ve6kSkw=VxbBg@JgoF6QW`5a#Z*cG9FB&DlQW@0X^cVN;UqJfZ80PX$)t zz8(*=9^L2Y1D9(O3l7h1VEUd$^7nL-Z#aXoTSq^yI8i0p0VYBNE}F`yeB1I(Q_bun zsDYbu)YmNCl3$uC-M2Is6U!$Ajjl?OGmYl#db$KE(m`RqtflU2&Q5DQXI&9oo7Pg+yC)p()#oyF1;cn-Dr_cfEp4;m{MKd-8YH=>%H7YE(LM%OvL_weTd_>s@T6!%Jw56 z_6?Nk8{{~PJFNm)=<9=DM>cjtxLKv^%;j3f1LdysOp;}yXI^oR+D150t){!;fyS^N z^(!3Y_12rCovr8p1-E4Dd4_I4fDtG``S#w=?%>DAM#_T+cn5S?&}Td|?B|B-ZW-SIg}-vs6KiOn zv@jNak$Z*f`cx7fdB_8a=LtPYUTytyviEA|6?{ND@D-K=A2=B1S3$B0{Q2In-Lft* za%-2k$7A=EjbP{vkOqOH!;t{hF1pv*#Y|iPFp*zZd9oF@ZSo1 z6Uz~7o8($;PSYVgM$^QXH;K$!~wI_;2i!;C+(0~ zA{_=#r=N4coKGr4j!!ODjY};$T~=e1Uo{-3$O!Iz-Tk=L77G64M`b0NXQ&Omd`#58 zb8MLx!f!3RMv~(A#?TJu^BS>vu!Xu#32PkAP+QtIyV9g+rm|;fpN5{FjW@_6Vxpp4 zme4p@s#I}iY%`&lcqR4Bb8fMBtFmbM966X4LhJV1XcAd$aKU02lGJ@c@*+H{YpO1hSD`fzX|@4Gg;Sa4 zGBDUS*AFl;`!5+J#MvpAipXaeodU<4VAHPdq8>T!n-wjt(>@N%O)R%5fjf~(EI30h zE$ZfGoODsRX5soia(AffRX%yIl+)x!nPg{Z9q;h30F>~(^EXLc^)&iZwhyIE>_;W~ zg5;dGqjPHxmTP>KeHv-!RBd*)%DJ{;yJBMHl{KN4Y@mA6#CcM_k7m!zD=bF6?+CQM zFgF*2I!#?YB4Ap!Uhi_}u$(V4>nA#x^9H<_I)=+kADvL^UKjAc<-GW%NPxzR`gqTv?0_oY zhrr!dlog0P#))W{3qXt&h+;zgR60ScFB!wd*~=KqJ~AK%A}iwy8+l z>bX=hOt;R3?2_*Gx@`i``mrx{jz>VE2TUw?Ie@O}NTCQk$VSmgU%hn_(obj6W7Z1g zt12$n5CTm{41!xt#Sb%0p^-x4^Y;N|l#EkV-*O8nr4etD_U6UzKHPt3z@pzNf8qAQ z(eWJXil@%%x1{8&dIHtHu=D*1s&?Q*-A*i4)4B}Gh&eJEB?&=fMW*-wn%m6Pkfwax zWNGL1QEGb*$3>`)nEBhbm!}I z0;1UkTVM-f_q^+gi`HcAF{kK&Lr%3|KwMzIL#q9&$t;M-;^}Y9Mj8295`Y^UtY-@x z6|kN%dDW>dfoCbT7o-wWzt36*ti^`GIKi+9Cr)EjV(W_p-5R&^whto3eJivw8GDGp zz_JXq6-nf_uxDgFXQ6G(a7z0n{U`uzakKb{hrO7gINFL09`XtkyQrRzoi+Q$$|H%m zm?;*H*jSgpN`5{#{Bix&&MQ3FGNQMk5Nx@`s{bZEc(Mr_a<+cay)M|W7S(e$SSNR4`YDD`cyV(h*5;MnrdX_v$ON00SMgBrVaE3 z!|L#tywxsAL#WmZPX=pcc&~}oF(|41Sr*uIe6TBqCB~Lz2U1qcDFM9aDWHwvjlz8C zHJ{no#>@+qYT4vC;yvYz4}{``po2rICATfgp>x&lCP9ME6?v@i5q7|;G!?l-w&cbW z(-3t%ffWW~fSmJ?AbyG*GPmH3gR6W_8EyH~*QFU$7_XH+`wf@?W4&oRflv^;gE`zl1I3#OA^sl zX!;u|qu_T3BnF8Q^RbAAmt&ttj71DnxV5^Pzl*bRGc9H9ZpS6xRwC-$N6PkNgcU^s zE$CbnK!eh6lk*3~ZpK1XC?$Aa)x<>3S)%HZgkQlsNNbxI)97bJl8KY$?Jb4dbOoJf zn3z>^zz4jSRrF}8QBCBhj_`z>>ZVYoOtLamS%_L>zKghz2F|0EY)LRtLi;8btdUcoVDKxW6HD8v+T zEj^+`-P(kk`9j? zOi$|^9Sq&isy@8>MO=aY@c)?~*x2Q7R=!?&^i?tGeZ^;LrT1mOu?j!me*HE6yAJ=u zf7ibIW|f}9-`{+@_U#|mzFu8_^zFB6tE-Rxu)6l>>+in#L$dm1r&0YgLlT-Ke;A$* z=C+%ry|YPoew+UXf0*|D$8I0QS=s#LKggMl?VLml*cUBLw)64L1hXk7`#D^rM7IEe zR?f+3?T;WBXTZPmI43>#05i&M9~|yL6Ltehlg1F}-ypkQId9xGkDnCNK6F|+e;PbP zbpt-L{qeJn;7NC!;Un{e3iHL!^5_A|hS8(5_`xu}j-CKJA3b5{#m{)^!9yf#i(4KKoA9_q^^7Vv^Gqdc9LG#!`~$$-I~az@{M ziQjeDfik>Yms&*>FiC&jh(%* z(4T$+)6Op%Z~;-?&vfLpCz*5F+R)faY6Q<`1$%gLXOyd?#4XmSPYb$X{|J}ZJzhf} zFW2mZoY7!}w#8_4-6Y)A?0FaC837XxPd3dEkf|18r<;5TJmL_w4g7J~h=N%5!*qCq z`4hML{R#R=9w9m;d)*t%@pLE?#Om>Rj%j<`qXs8|tX4w&d)fjalHMoiN!lCVv`zsz$DQN>h8RE#*pw+UUt=_4xd$5{ zt0?0=8===T<=MpK;s$6{@)+<;lLROC_7O_;JRnc4O&A>vcdnD2!Cx(0XN&Z@t{~x9 z)o^af@EY5I)dGeQ2G-=@aa^ z?9@ALtCk4fh}8$hLkiL|b4Rdiv!*i{+V?z^+JU_WY*U`0G=YQ{J&Xjy5dx@g>Afd! z#F!5c4}|wul&ZgonDQ&XG?)M%+C72!Zf|ex?H$Rwx)V}3e6JRDbXMFQ4f14(wgWB) zz>@9Vs?+A1_Ob}#QjwJ%C#@e}#%ZTtA&Mhcu4BYoRyRQKJmK%+0~e;X$xZaRG<4}Q z;n8emxB@qxJKWHI)XN?|G?2pnrYNU6Ub+Q);Yn-jpw{d3#@&D+PU8T#gV0XhKX)tj z&ZiaYa=DZ@J`_DDD8eGS|kR@@^Y*-A~^SubvRTuMAWOG)vl|(0HceZ=h5)l);}B(2(R@gvT>>iG&srfmyk#(HVus=xjQrr-~ubG@vt4A z{$P@hb5zNVq#`q=EQ6Gq;UWCb)%);euW`ww zuA=Yr8@Z(DBQM_UZzmoCz(8-;t{+bV&y(qVRE9fVMFbi*^#IP!N*QKbfHx<|sfW{8 z>m(JsLPf7j_vlwk%IdQqfotkcTq&!)HS{LOhyE(PBn>%&^x4+Y?)J&i@z(Z_Cr7(~ z*#Y*9q&j}oLHWG*{wG9ozE5GW>1j_=PP?J;Ra}XC{>Y{i<=vy1xIa!P?9sf15#woR4KhO4&f&CB_M-|~FoeRXsa$^(Z3L4WiT0p^Jy|mV z8>2RU!^04Ndr0T()$TrTlyo3CD5DdYIWQ~FJVLVP@UQOrTE`PJgW#j;gF{<{M8#EXpwRCNYuhs`caN-vby>Gmqh7R3|z5)B%m0li(C^=~t?h^RN? zWYqrhAxw8Q8ndY-vH|{i%LwTSxUc?w9R2-^{o9(ay>~2gE@wRld`H_5{qzr$7~iYb zgi^Ruo}BiP1tGW|DZC=`I5$faY(aT}~>UUd_fN&}zn7`m&Uic0oT%OohKO z{b?otbpT^PoWC&+zj2=D@5@in9%{NGLB_|NugO2B?UfPMSYXBjrY&1eNXH$cDTbeN zwb+RjQDm0A%Z?6yV zJ4zkP5wsvUyxeZNdrfY1y1`6*;vQygePFB_%Hm6mqexB1d|CRX|I%&);D^fHxf*Sy z8gIlEPLrT+lT1nLjOQAbEk(*5lj+No+XUP6J3Q8C+dWrGpgZcFqgxdXxo0mS&ljv0 z!j=K63jcE7?l?n%ZgK(-1!N%sZlOfw7i377A!zzGre-mLv!nPCs>qvLnYnvl$BeyA z0!7)}fk*);POs@Lj=+*&_&AJsH6co&RZh{#oKXdb1D$08*6O(coCC%t27fKMTf#tM0~XbD$=3}Da?|n3 zu%U1kqJiHzp>3~TvpPV}ih8AFl~gkuU7_oWYwiV_k^rbcnI{3V6QdUatqf`;=Q&a< zUWfXaiNT+DclMr(2w%RZ-J|-uN#GKVeosefdlgUdeQ?ti=-LF2C7}X$^s*XAXKSHf z&z_TUO_NCatrdO^8{#7x&D?29a^VQluyOeW?S%S;W%up2ibZmSc&KXQPAz6x=WFg> zx>M{91UTyDTC;@8(_J;S@=a)%t1SdVGKeJ-)?7vR;70XTx%ZMu0^eyb$uhq*Xt!p4 zE$vZxp~3ak#HKe zN=aBDAgCN*O9}+ND{6?uB>*O+Za!ky0z}d}RHylHIXr^!`NSqJ2wSTZYadw)xj*mn z)|to^kmYhFu+dprtKfP6D5s^Frxi=+$8hz{_pQ*`=zqsyG zT{!HXnUg6Zx))wk%8)YaQFVDn*X5pwV3ux46c1A1nC|wvBl1DV(fgWbA)IW;7mMpe z%pjujY092ROBcl%bBxm*?VEm@KSSRa>dtdDa5E)Jta}5`?^zA|)u6?#ggAE+8ehh? z%CVPHEFkHsgNG!cP$T0-S`^*0G_)aNQ?WtTFNsPc@j{M&;;<*|LxfJaSLTk^0+XJN z#Eu{Y9b40BR`J~*3O@DHrlQH?q!D~j4t-br@fsq&0j~FFAgn2Lq!VDn z{UT}IFWL>X@TORs0cO}XmIvuUwo%uq(Mg?brYI|NdwESpRR`e0BgI=3P>gqlz^{ zUyVIX+Ic=3y)Qn}ADqYiG>35VdMiH7A^cO_zstVeOnnw{?iLt^5C5L!x~|w~_%fYj zgPR@}NHPEmUI398v|S!CvK2a4&&c;$?;|V1{blzcS^CRHM5ssIiaU1j(`QH@<#n-BM@p6??Ee1u2smO$r758AMVqqo5^?hCq{VFBylCW z+SZXUv$&RP^daJrg+=k}!B{@>Rtx;868bE3eDWmu4rA*99uJb$>+c3^d~u$K{P<6+ zZSUhCz__l10Ol5{+6?s%H$cJ}{*OA$M@cG4g9UAO(YL#HG^Zwuhuz&jMvtm?JIZ|7 zJ=y2#JJ>;ftr*@kyrw;Ic$r++Ljim33czLV^n1+*^z|ZNV6uYapsW0BI3$&eM14?w zNtCB@q_>#f)|&p0kGRzm?GF9EAEW1M?3^r(+a(eWc!ImdJw?Tci^mek!`qBh*>q?Mkt|@gQPnlVO&$6rZujQc8UL-VV*(hodu0 zH!14rxr38@UsRa3riJFqa8|Ka(?g(1ch1Z0cAyytp1_;HVt@e^#Z|+=Ww7-#sgw#V z7DWOlj{QFR#d(eh^>i23Kibs%p* zbBquwV`G2_UDP}kMjk_$ivd+F03M|~QUneznPOV@LBKC=Q~AouSq}VdHN{Py@BW)tFZPau-h-ib@0e>EV6f0=aPtSFWx-f-=PoqZ(GQ15$A^zg&-eCU zn&*}Pj|7$EV@D!vz*(vNTurtvdh3G{;zL2W|Jf&EeEW%zA?=YEFLESs^icgf|19|S zWVwe45&5Qx=w%e$5Io00NBf#P%Tb;q_m+NfWF`#upqm6`D(44)lkK_)NKW{L!eHT& zhYT_b5FtBCP&51DE5*#xJ*(8!?js%viyVT?A3t&nritMBH5VfArfaJ6Zh=tmh#y6fsSY zTlTLPXeGA7s980!c#e9e&)hsf=QKk{l3O=#Sdfftx6X8~<|DKL^Aa^v=$;mf&tmJe z*n`F{)>CE@jxiUH99=Sf5c1?G8cwdN8U9{s_@NfOdGE42S>R~w1pu61Xof^#Jpxf`Yq zDkvqGM(Sju(lI{<;*C1m?+qn!qsr$rAQSJKaTk3{nuT_!UUH^1GNcOQy2bRCCL@>y znvIJxp@FwqaRQsxot#y^#hi&6@KSD|0*!}E!0CsN_4)~)G6xhsBSKfVv2>J%875vH z&Qlr}C7WuT>_J@!fEPU4eYwAN{N`{6Lwfx4?UUzQ$6M`plv&M|I6VbcKpX)?W0oRb zgX9Ijw2F3_IUP!^U1SA_!oBkb2>3L1qy=_Ugu$lmI|KW-OWV=;yfiAz>X$6H1uOC5 zms82^ho(?`;qBVm4t<#WyExJByqZ z*nHI~8Lz}Y*P^C z9p33XuzZ>?s!3w_FLIUm|I44q{{y2gv(ta7|Hq@XZ&$yI^Z((afBS#@6Mn4!hi*Rm zf9z$a6EWILWb&)-C>zg)q&)dZ7Z4sgask=fefG&7AfJ&YaCVKWjNCT5@=R~71E0l} zG(E1GDC>7*6<8)ULr2ywhb?2z7G-f$)mFjYiBvL_)5DU|>7s2t3y!y*ogCg-yL0Cb zNgeDpZeRXKXID!N@<~Y0t!BedjATp5H5g4@NU# zlGRb?3RCjotpv+!v4q^ZYRf=-9Q(9)GUSx3qjo#AFH=ua%gu8^e4pO1SLMiCN0GS| z-WFOz3ws05Sd;D*%o5)&kDNQ}@&0ZYR=iD#tZ4_EASN`EG$UPMR_K;to*DKPJ;wrx zm_dZHu(zmFR&+RB3$}MP|2Qm}>%;zSmQ7%9@!bW+mi5cA#tOiy*dv$}|AO^r0-ui) zR43y4pow1~ze#aL*<9K?7dy63pv20i@(zTJ-@(4hljwir>^wVn)OCCN1WPyQedjDMA8+eoj z2iU6~01#FC+9LOWZ~2%p*c(v&A}R4D=Ial(*=9BhQnk~O;63*{*sn5M4$!(He1U?&O7chiL5aiW(zLtnlpK7x{%?Uo}bnz-syxKTc4ih=of zYVl89Kjb37hN=XjX_LJL=OCyykSfyx;i}&PB`!vHYfR zG9|(u+8tK5A_^xP1hgl#0Q%i)&dbBO5Yt5vfPOJBQM5rOWRwj}nuE%51U)#I*Unoo zYAs+$fM51!t+n=c@UD}rtgOJ8Z_{^e_N-}5r*Eh59RGQ^#tqsl$|TfoQvK+J00I$N67t?7+cpW|K zDf*cXlrVEm)(oT9w5SP+8wfXla^0!`{MknJc^+W4Tx5q*i6ncq^~>)5@y^SgLqPfg zz^Lj7H>P>c<*zKuh@V#qi~MB@v|->`jA}kJnsYe2skkB9SuMlZ4-s--SI*2r{R%U` zb|*+%bY2KbEQ*xknrZj}{sxB%Dd`#&z@xyk9L+DOY!YqCoKCSW$)gbEj-hVY4jo}~s^V0^}B-NY6yK!Ci$C3w| zmF4ED4uZrp>^AL`2BVIP7Ik?JiLEn4gO2WqbHMoK;~A#f@@I3+Fn~l0g$}L>9i$yD zkRL6{FJ}Bg@>mjbB64V?!Cm6@*O%AVTtINu^t9Oagdw>o^}5-7;G6NUocx z(lRpyZCgriEw@8Q*=p|Ad~Obu5!1GphD_iYae%yN1V|*M!ZnrEqRd4$nia5}El$d( z(K4FVF(T|ENS95RFg*eVeVUq%7$Aq=WJLYVI?=bfrgCy{+X(%}#QdpQ3K(DD9u6R~cqDf{s|% zBrEdK^3Q28M2+y;fBxsAmGtkOT=e2~E zn^H1O+q@api5X{?m?rl;hfkneYevDcT$e@*%a96;GoK^an!s31DQh1(I-Dih#c6kl z^?=#URH-K=EFEZ0Lw1{O?G7lsv7e8cSiO8S{faCNlu)?g3&_At|39mw^u|%n^1QE8 zY?n*foVeAz#>KF;;5WjS%Ca`BQh=#7( z-XfaB3nwYrm(al%!NBaN1zXf3$1HLfDp%ymI?06GXej_wYX*^1)q`Fqk^W27+Z}b0 z&-B_-ZiqfPuWu~466?vn$4pXow?_}cu=+Un{oPCK7Y*JGgx$r3`8{{5@x87i3^^YE{MLF`cY zlL=Nu7-)TjuI3VCwyW7Cjo}cZp=oWtQV^G}mS(3-xX^pOeA3r~rs#~1$|sjk8R%O( zR{r2alD;bqV*Jl(XbZ~<(ZH;?oja$RSmSWVNVe}%#59Zcd&e5H2MBRm%H$eWWMZ}$ zh_BZp2I4W93jAdqcP_Q>E-Rb6yvAq#0_4a77k_Kt(`7YGEU(w~CA!sZ+A+}Z;@L!I zmc$-Y`sPF<2TrE>X`T<$?nne&{xC2p%E#MTvf<2)t`Nz`QDZ$=3{D#z@*GQNkbOlj zw#NxmtJid8vDpW+(D)?Xz4t4UH5#PdzI5uo9p>*)-}4$}!0y}GczKQf#$VrcxI!yu zFBOwK(cXR@ew}mc40BXL5!J@@H|zAh*LkrVeK1*BNyN}WUqagl&Vc`*F`xx}pQ_Fi z5a6=Of`Can(*FBZ2Y;B$FEfdmWO6{Rzow+sY3l1e1Jya@GS6)JLyAP3!4w3#(#qDt z?)~((?i7*=yWwhs89)g5Y4LxRg&P@eW5cAIqKtSr(qk>I{_tTYk?{n_Coqy=kH*W> z^%b$q&-m>-LXg;Er+gcwy_hMVA4FGF2&#mjYXbp z`B9L|!0&M9j!_H?vCcL^_!*M~eV)Fv%yUC2C@rQ)FMQEJ1gl`552mMYX3UsGMWN1f z${6glIVu5NWc@y3==!L?{0J8Kw;2%2bOPcv03Lwc5&GKj99IJqbT)yHYsQ4OM_&9e&lNNMZ0$u@jyhV4)3^fKPZw>R9_VvhRgM@pEBhnk7p}>{7gV`MB zAiy=p@E_uhX5)Z4GDL2edp)y#J{udGQuPhP=Nyml6J|iZFCQ?3D-PukF0(4j(sRid zTPst6^^mYpgiBZ)04FC%iTBl7+h;{wFITJ!OZ#Yu1}-k`SB?0@Nh)YXn{d5$NjXB6 zV6RYz-5nWai23B0^o5A$0Ee%nMx2~#ch*q>Lb?eiYX&OnFQo#PezE9Cv9>FiKF~e+ zb~pfk-JJRs?*|E|)%!lKe(cbsj1KE^B{Dk9#fC8tWRYRaxPUleS6$(uR=Va)pL+CN z9D&F0g1gzwIY!`_Oxj*v27_Z9HaAIxuj>Y1AAK6WmbcG|ED@5mSf^DhXf3Z<1?+2! zM=&EL80Yvqxf?Y;JdR4zH z++NG0tgZhEnC?-V(A3G8X!mf6=Ds~_9QPh64qIvp!~DSHl{pD2j$*-vzW#scd<`h7s4Bj4b4@eIcDm&X{nxZ$0xPg9d5BQk7GL+*ewGEnH7%m9D8 z%FBMXW>a9D#Q(NOTJgZ7YhL{#)+O0vc1fVcAEsw$9X-Ki6>rh~4mbL@2Kz=}#47*x zp+k?^MvRa7H+f73x(-{m<&jwJI%;E;$9z%ZWByGZ>qGMh!O~z+m!EJo1N<)tDI1)- z`qja6TL1!6YM)5Ox*D$zOlFp`$Coa<>^kr-i~kvh@n0Go^F_ZgKmKcd?b~&m|96ez zzaITN|L;HL$Hsr@=5zel*6cbPW)uPDVwtE^jn;VBn{|^R1&L+pf+>N~(l|nct9-*wPK zicbc|Qu<-O%(h)R5JWUgO03;BOjsIxcn>4cvFgH+vlbf$p}n;Btxpm$^zrd+BHVks z&wSm1mcNH3Gr&o^sv4H0D7{3N8BO2tcc9)TQ*$^BmWWJ#y?ZAqzdE6qY|L-QDGG2g zop4#)>Ha+-%ZOT}RqQJK~JI3V3N5%0zM zC8lA=2bAvA&BL4p0}uA^sGG+vBfvuD_YY1WOb*722Xy&=OCD~EPbwV4d)Ivl@Y?aq zD~Kr(7ayxEQ1|z8&YX>TL*WsqhbuWE&L5yVx|svQ_}nGZ6BR!!CHR|gkUjut9!l34{} zc|KZr*Vjqo}TyUadEw!_% zxom?Vi;AmBS~|K&Rj1nGe|OtWMj6Md`Kc<3GL+zmvto8CBbeZtF!$PG+iv@e!yzWO zaVR*8`QTb?61U8u<_Mt^KdD%%XW#^qrJ>}UAa!~z+YM`}zJ(lnTScO3<_2tQFFmcg zQD6D_CDN8oHk`v zq=VUz9jS{iGO*2gVia{6#WHN)`SosPc+09QYC3Fxr3GJxRPcptJe9-Jh$tE+_9FID zW2br!@>sDNpLJH-@h7Y%8~r>wc#AtR3D$8(e0#X&khtk!OG=Xw$Y2yafovZ9?b8(Vd;CqAxrq$sC}m_m(ehzwxl3yhy8)&@x42J?H>lk zQSVmY4-t-G;{Gza;etp&{TqI7W#t9*bGaOo0T6ctP<(6B3kJ@~SUopaS!eL-&EE0h z&N1rg%LDrb6w%1Rn~xtl$_67)$Hy*Eius|JyGO@|f8O1HzViz~u{07#A`Lv~BNGbt zNxnzeCy$eXJctMJOae40I&l4u45K0JgL|d?#$7efdM9S`9U+IMF_vA%4Bg#qIGdzj zxl}B{hbh%&mofp+w)?~Y&K(CY@Ck;=vrmuHmS&^n^Bi3#sTkQA>_$1@!g&I*#3b@EFL3SAcS3)PTZMKTnr!uYKo^`}OW0#U@|VP>$(p+tn0vwZ%R^GKlI{ zX1zqXk&7sQ*yoV$3iT}M7@13y3eEf+IHL)AvM-smu$)A~G$IqNZ83^t*>LD?553M% ze`-tD*xQt2An-`Imk;!GgUwX|4r42f_B#dUyoLW=emZKGn;@`ko6~kY5VXK) zwVri)ZNATh(zl-Bn3%o>e<6S>sfS}W#?dKzDZHkL!w&UMxZmkp?*8y0ngjtg%QsHH zPu-t&3Y;B(>>;!*N=@lgv(vEYvNo;ejx@EQpM~n<>KXX( z=8Eo724xNTo;TQHW6c|ZsAXw@+8#bU`cwLR9NaAAb?f{Hwc8ht7g2fHK)7C>$-NTb z?K9EV`-9m2-w=NJ0=+HIyQBV4>T2vBh*|FDbBV0fTEuc2`U&>Zg9~kfnlScT@|n__ z$PS=!>xZrV=X*O%ExVzlim5hIKQ@vbO@Xz(XeO;}N2 z#o8oJ zsg}&EYGP4|@Y^87D&{&cvA9-r#(eY3^ak{)0nP#%bP|GIYupaz2XDgpefWGN&~VJp z#%#{abuk9k^fVi0(;FsieUuNRT4_EKVg2(lSS0}60xpOA>h;z!UTwSk$J<*+$48YC zuzK8sl+#7lW@u9|_+~ysM7Kf^wu7KNM$&qDq#)Bow-eafK~Sp}(V>S(ij%&8{;}Li zS#=r%z_#f{<8gv_HD}wPWIv|`n)X2qp+u#YqJ4FjF-Qx<(t0rO8Hi+D>R^dhS9Ac2 zjuQIa)FexN{h4qa=ud$9flP;3LL2Kj>rkm!2ZPv8dWo?*umwB+?L!&z=|yXL(KhkM zeg!U`fJa__Iv94(isbiAF4vCL0b6UcCr{|Li(lzs5(Uf)Gyu6R%F3Vx>RcslO=EV! zA*XfVI=z8yt~MvS;=2ZhQtg=`d@-fmg<5czOecAmK-{NH*J7|2n3v{Ui{CCkb*cxA zb2GW6{Sa@Cb`G&7Q!vVGu~9TPwe89{eKCEjvwjx^Pqd)f_hn2#=bYd?5LDiw&Eo+- z*OJ1OIa{Pgs;0r9lt7pwNJ~?!BrnvDx6oWcbj{!(p{Ax|auGFwCU!3CawHXP~_gHfus z){o*)ESRWPFs#}$OZyrOt%epHrfjoQmxYwgml_S^K&uLhQdFZa`p$Efa&0sKZV_ff zEO@JFhD%?Cm^O7LNOyw7%7DjsM!F_Ih3=#u4)P(md-1Y>`*QA14&n#nN>7ET&3dWV zBZmLc^!;w1Xge0dqEb~v57H^#98|yxUsA2XiX=NNpr12X%FZvxhg&B{$6MP!iux@c zfus4x8heS=>0Dy}x(+bwab+cdx(<(^!z1bNXcBke<-t0o_1Cyk4BB$lBuM*tL%DK& zb~q`UK6UDLhXoNY5{b7dheNhnC131pp?RHn;D$`YXxGPz?K{J-)Dkt#0I#9clR#iAFC(hT`q+P>Lm&fcC0883DUd zJO-44_Aj>f_KtrzJb3f+2hV^+ob6&$>{6zg6wj@n+XpAH1=z;oXpC_7`sZ8Glkd5R zQ>b3}bzkRU3y>)C7#lIA}*)6*ML!}Fn&lFrHdGAZouF?TCK z2k->M7*{DI+A3WiH{*|#)+tG;=&VthlRlL*Q8An{0;0r)c{0<#&AP)*VoW)E@V}kp zeVUF7O4k_KmhvH4#;NRFmQNnz_HpQbhFR%RbQq@14&4&?JLaNwxs`{gF_>TiPaNZ3 zYl6A-+rrhLj-m@EVoDi#V9xE8WS2!o!)VZ*UnKq6gnZJLST|72PK#+aogwk*P!}}G zXQLUDBdmi5G=@^=c29H8){befN9h@CJrCpVe2`5iPlj;Y0bNVBcaIPt|EceyD6QeBuOI7ZuYX~1|BRNcPg}-Z|#c^Xg5&Y(V6-4fucf z_NH)+B%;VAi#Q95%L$$!6wlf|Nl;ZKJeDAE zdYqeJQ^#C36E2l$pr+9v_`%uAaD@jVC~V58a;H9zYA%eIpI&sY=})aP*A@wv@|#;l zepO0eD^C};hWW#X9lw5+nek-9iZHh}E-EF@+_@vWjNnvG35cYHh%tWLG6PdW30kVg zmS|JZL=|xp6gu2B;U)`*0p{~^yX{ffcX!(+)#&k!C=J3F#*`qa0_)P&Aj9adPl(MX zV4O&Wo)F(bR;@wy0J((~qwrNJT-(K5!Bqui6a&kcq~w76!u_?Xu$Lze(_9`mWEWyQ z?Ot}Xp{+yf@$uz07j&gA9iDGH@V{onD8{0Ykc)~X5-xuFFqi}-)XhfhHAtn$@QRV! zWb8LF&O0wFg1w;fVKSmiK_4KSem67Nwyc0uv@<11cx*vlIcV&i=qnRzVH4sy0b5OS zx&U|Gw?)eNS9>P>`{$qW6Z!uDbpl%Qg?)hL`v0tb^Ub4gzlr>R;K{fD_W${3{8;}V z-F)@|LQV5)dh(GjKs?N+xd9Eci)>oN`JNVY4MH7w>>0F(w-8d<=+Q8}j-FhkvBOWL zPfDes$ND#`9T5Lh z<(bfJKyz4KbU8(;?%=DfUw+y;Ji2oS&aa6FI`0-2aJK-D-Fi>4WbfN3s{XXSwYNtl zH|1~WyLI?dV)0I;77xq+6OxO_OK6l0GAuf9!+aZ7-NC#|Qk$XRsl!vUYK~d?nvmWF zl`51Uo*gvYGqZy9Z)j!hc23c~vrE%zowj}a-Uzpieb})UPBP32^hUz}B7Y6A#N5mH zs-TqGQ4qm1e6tNq4|^XsqdW`nzy?(#3}@skl8j(^fIU3MA9b;WRg~Sn$ogD!sG=`vXO;*YI9?Eo}4< zO*6JtdOez=KLz6=!S~EcbLZ2=AlpMIZ!>zu(7d;P9-n z5Uu$^ICd1kBIs110E4xYaQ3LURxf+d*Y4k?Y-8OPqBM7zJVho;K=|@cR9!`?x6P|TCe7*Lf^B~u+3efpE-2yz$ zC7~ZJ0qld}0I2DSt1W_^dL2qS@f&AL#z@{uYQ$)mEV3j-pKw*l?uc!I^%oelBBo+G8 zu7>Uj4_pCXKB@d$uD?(ouqvy$qB%i}j*!!;lkS8G8_<-3381Fa<23n0y?G1t_`>(b z_pAcH_>5BLeoo6J)kaq|3fDG(jE0B`6qGl(=AsFSnZ0$$lEeX$_X|Tt+a(HEaXHca zE3Ykpbz2Ez$zUzJ=X`silO#7J*T&!mXZ^XhoRSvHpOxbuPcV-x7g3~AYIL-V^a2f9 zE8M(9d(@4uC{tu~h{rv`JS@T(q{Jk=2R<)(FKT|CRSMT2d=maakE#8GlmB}2>h%V{ zcn?qB%kQ%loD4k3DsBK|fq8Mk7d>ni`_@lC9vvUL@4<+dq|&ZfA%3w8XTu0NFKeAy z3ri2#EkZa(&a#-)7SldZn)*;S(la3}Zj)5;P1eMctQgrJOQj1ZGCBGr}9=BK79CYMHZfHIv;b>E}XG# zEWh2-9#uEfaZlhl?g^l_(LMRJJDFsu2UJJLw8t(S@ZrPYisjPfm1sn|R79jRK%-I8 zBq!e$b<{>jHxk9k`8H^^{FEibl@V3dSY~u3c@?Kzfl{Ib{K(|?}<^!Nj$t9-sW<-@^frmhE6<;$BnG&z1LY)sK z;GD2Mp7lN%X&aH}$hcAp)#_fcWy~Djo~2WT13jpeTQFxL9Ua+>2P$30`ycKIARcyo z7f=L>0iVKghdx+TESM*-NR)uDqrR?WrY^=gDPg$!Ctn^Cr$NkMk#;A*EK+nF0R22W zJ4e~b!TuD8>=kpNG&;N3Fi#4krRxUOfRBQ{?Vj?)TFnV8rrA!$!x;wPr4{!Y4POaE zTy9X>4IeBogS6+&cAl2tIf*ug$O#SN&3UR4^D8ygi7xy8)PYcR`25H1<82pI5iGkL zP$8Xh!D=K8%9^MLhsVTh!l*z(WAxo=^CB)n?K6-1!OkY80*uFI{K;Ajk!A%F6p@N(x&H6s8!4Y8e?{ zQ-s4UtbaXY6Z6)}VwxI}1sn`J&#Vyb6+4=!vpE1T2s`{~`(Xdb_=o!sRNWg+ssjF% zIe>~N!VhM2+9*G|Wy9!~>YWL8H7M&RtpbwCoQjr8pEALm4FTg67(to8fbn*NEwGk1 zuYa;@d4rmLUJX?=)59bh|H1&vu3$EXEeK~`F*R&8cS?~%yDb~Y38gqB9Suu4nZytY zmo*%nM-hN}j=Q9RuF~R$nvF(xI!!Oe?2cbxN);~IKC%~k^M286bTs@=Kj{Ohe>^GD zi&$I6{zQ_ZGNegIC<_^*hu%UIi%%R&(R2x`+!a>RV6oeqVqa0E#iFrpJDmYju^HWX zfY5DiWMa|1&kVH;e6o}nimWHsAWCfU8Jb7gxV3WYLI-u4I+(s5yVrrpPuoEw8m7No z%9zwx;dX@lFB}lS3I_HSikUZ8Yh?`W3hCV8b4&*#GFXN31hCmS!g}-oC(HG0 z{5E^H!f7}p#@H6=HXQD#vsb7#2CTYTh43!z zh^W#@O3JIui3qNKI`DqOlDfqWiJXmaH67Dil`41*8)kcv`-U;^6$aR__YYev-3+=@ zxqX=jy6P4h5=Bf9Ts$dyBd|fxI9?aP(@rs}EoO}{mWR$+wFiplV7zD6=}@TR>CoH- zr$fv9a7S7?HOIHkqw8)$fAeRBSQ3tgmk^i_68}i{43TKf`r9|0Fw-l)*%`BZb=Wp#{J<5rFhtH^FQ|CD;~l+J?w>c4yZM zpGF2eMlG5M)dF#z)46CYRSsxDQ1(^dBQ*c%VD~vCs0eiLuq3JLS)~oa3(rvy)6F9c%38?KEZqqsx#oISSHikbiJ{D~7;eF;b~H=(q_5RLi1I zOSur;5WlfJQS@JBbO@*v%MSs^f=;I988LWm15T>ZPLmF1lhC>;$mA+mwZ#wJ3N`=+ zK8q1y4G$N7wCiYh_*tux=;x#6)I}rq;Rugz;9O(y?vxLBfQLTNF*+K;)p|_A>7t}F z?8meAZVw+ti#nY9n_NkGiB5_oVwC6g zBq)lqvMB80Q>)25-={Zx>y;{80*I?v(a9 z+>A6T%RGuegrcs5`OCtg^oel@~dg39Tc+XZHb2ZQ=PUZ8gPVR6ky?x{(E9m_Uw^CZLMJXFdg~Tw< z)~Y806lUi$ym)Xx#9}{lLxO2W@MfJt+tM?hlBOyowkck=S+9VK%#RcbniT~bU2v=7 z&tRb*)k6#>DJb=ORhLu7*@P*tpPu>(Y*x6N8v z5-o#zFKHK=YV)Lp|Ai*N-ELDbKS)f*2sy%}HP%E#cIqyNAN+N8F)o-@4IJ|^SOB|+ z(x@c_>R?VIU^gB-A_jXHCLwMCL7FGl+xxpk6z;K5$7G?CoK3xa7;1ORW`M>MTH5{M zsc}}UT`8}S)c!c!TuVYiHT`s|Q&tSLd3N}n(3xqTwSawM$qQEP21aw54=?4U(@Lnk z2Koy$&zeY`ML9|#C{2;+5ywz(UuYYY&`q{A?<8P!_@qkbG?xwXoM22z+SyJCj08G$FP) z0#(2%_I)LgKq;hK+2ODr*;mJ(81G+$hnU+%TQg#|<;EtT1B4*K(-FS#q!2=!O+BWJ z(LEU#8X*0+=O#7owFBkJ8EdF<*(1@JP`t6HIRpX12E~A(VOtbllt0!6)cLD%O9p1Fff}AFa+xHgnk$1kmYrpWr;+u* zo6s3_HCmmme!o!HNNo3&k1}%#{MZ)q@3|*80*0+bo@@F6R&(G2IHRJ z*b%}XU^B;$mXVSqz#*&uEB$44PePYj!UuwY+AtGGm++ss2OoNmG8 zG*jKuYWSGUWa0>mrxiY}PEfMJqbef=&b@LkA}d5SjCEwYsYG=wePyidNcV9V&LS5P zoR%xhR7(VGMIu6cn2_KaTu7%)K4f%PP?;-x^8{y;RgV-r;%>VO=c zHWcdbGX){6Rr^s=QtO>mGL{ENm_ar722wg?_8xVMKFHGuEk%F;qPKKZx@=k*vlobPI4_p%|!OR zO^mkWIz(x{<^*YntZs`a#BdnW1!7Q;H^*jZ$Mn1rPsLnKs3GGGEA5wyICeK4%37TA zmwjnP={vzVbaVr{!9Zu?NQpI7t%;n0p{2`uE)88)Nzu~+p?|Kw&*YCpg*Nj0KsSTB zovmlvBugH=KH1(oINIq{_{~t=-qo78#j21+QQd?D5)c*Et9n*;%x0B`TfpI* zmDM96-2iVb^`4t_i&W`8s7;mJdyCpb1Li#&-~~{rY2YJFI12!IRW^L6si->Wu}cO) zn{MLVH%!y{Dh*L!RC#O2m(VpoD>6K8!tUJ{-z`$NJpHuq)~Zt6Olq_!r87fHv8pq3 zi*4C%oI_~69nZTVLr09|^u4-I)>0A?)tHD^XX?Ps_eYhb!a;WJ$Rh2m*P5D{7;ZuX zdgq~xxtS>R+l>ULE;wKEH=SIgQLVlK6$)l_b0$Mey!VYP11dbc0g>8_A}c~I>!zCm z0~?=*@ghkQQ!sl+nba=A8?z=*)Cj>I>0%_-1ry*ze2l%0Ws&WG=-1ry1|cE^en@Gb zBmtG>iIjvZGp5lgI4V^V{zzjHeCXYLZ|1JoFSv9ptUh$AMwg|<&`a@GgxkY?>79ST=S#pbHD7jB!wfI;y7rp z_Iw6OJ<*g&qR1sYFJsr4(PjQ#y1m@)$iI{Z8zspMm`q0y2zz;El;vtFc_=c}Qy>AV6u$xnwndk5PcOIEKfSp}F7ITcitAkZ4K+@+jUyfaW1oqFiG zz_-xDn3e{N^5}#TSk4cTFN+XWPRF`Ze+)%kKY9<0lhOqI9La$~R{4&lJ{v-%2YmOs zF?)LB>KBmwYI31cVj*mlUBQN)7PcP(W7?gd>EAr{7l?Z_dLR4+!{7%bC4+xH4*o)S zPW!hDTnooij@v&nE@*yI-bt_=&NK>J35#CEp1Uj9MD@d!H0f!S6#r3m{Cz;a>(iDI zg6zSY$$D%|UHxiJME0xh4LUjuGqJRIK}Ie`U(F~uZwQVGto+pA`YKcv>#!t0s*>N` zfxI2gfAfmFa<67omER-au@9p?_A zsOmFI_y;o7uplvU?l1=F-AMLXokA);F`Z=VwAh0`cGYjY?u+l;cis!lgMT^e`P_cN zt*ZB|Z25dhxs)7X3XW2W4i2Q5JC=!jh~gbgD1?g!Xh(F;-w$*Q$$<58n=a-L9QFS> zwW|SX0gqoEZoPW7b(kE!+1oiv=-Fou>bQWw0H7?DOAMu{HS!_G$YZc)pvPKDnzPX~ z8#eja7YQXO0z60J$Eh5-YL4VPVp>Tm9%Ta9vyZ&rQjFS#k6`}pX(@i5hC7j&RAqk3 zrsp&nsc9>rrzZPX5P^F9mDNS~J15306Hh<{_j>th@*Dk?ylrkY-z6WIya~&B&jO1?g|#5DRg||4 z=6<+y{N`}q8!DWx*Jp4GeJh*%M>Emnr^K#!6>(sTD2-NLI90_g%1ZT^Nh7K*O#ujR zn=8%a_oVq4V1T)y_`CJjN#u0s*s<>D2E%v9%8%WR6G<`nF*zD}Z2>YG*+9pnDku;70OD+`4>j2WxM>ZE}*!=DVizhNzt~w&sf*y3i~yLyq)P^bH;Y zE|VQKhpzgkXlz8N3A3d$7bB+y;8L&WFx0gNByG{D{2kE` z;D$H^=Mht`-EvSRy4m`5Ftcw@F+jePh@0-vnXyX5jgrPG@ee~Mdp)?|&qrB(fcT4eOs_}$^ zE?s%d*B zwqvO1`v~TXgALQvzk0KG4BSS0!$4|zIY^6H?Umh{jZhslvQ>42teFBYk?K|P!MRTh zD{~tjeIhEzBx?4*w3B`p7bC2`15j2+ME!ve&w+ebbMBS6twq1;zUV*yyQlFc(aSt$ z8)@)ku^Xe!6>guV8?TAXR8xnHN}&-`gP~;IbGZ1(O&WF+siVXYRCvE9ey*Hlw-*F! zx>owhxKVX379iz55zE3|9p|q-Yo``${4wn}40RY{}*^02^y_FFaMuLCO`Cm(QxdrMHr-5d7+DU%eKiC)LuDKT5 zmeq4{Yg5TbHuZV)E8-R;I!eC*r*!4A6mUuD(kM&8O*$2N7V!hWF+TuA(vfA=T;Y)B zI>n$pv*M@Do27z3f=zE*%nPq{rHj(vqpd#spfYEWOBpbyjgtr;ZZz9ouHYQb{Nh8C zmS=Lg2bWwh38l-l6{xMDx2PHmi1P~5X4rieS^&f!zKkr9kSq}h?ONEYI=3I!KlAxw z252chksh0_$XMxYa7~ZbhdZx3I*2?kRx0~uoggMA%l1*X(FuBu>Bj^t0=jwGTt{eBfBBy6n zl4H}Hm!uhsN(9=|cl+7r2ggU@XDd?S%hgtd7;x)1+&xm63cT?Im+_P?Qrt~nXu^G! zhjIt@o|^#{;*L+R<7J|BRn$OHT8s)n>m364j32SZpUYnICtYDS{*$A}%s?&*y*KPm zIGYwuw4TNW9}^*zT10_jrjTKUICGl!=cLQis-Ikx)H`^(V@BQKj3v!h)15iMa&ZmV z*?%4%Fhoi|TFywvt}Ogw1y7nawJQ?o>%e?woZX#ikZCnHhhI*IRf?Tf(`*p0PR~?L zrre}~5t0p!?qjQQ6Q4Cr`9(RsRT#A9@JryND~qPq=BcUPvts>pQ3Nn3aUk)1!mM(q-TA3ULC!!gVccmOqG3%k3IkSHx2CTR5t-arbuZKA^M; z8*XmM(6*2T)*X09XVZqVmML`=!_*eZ11S=#CyMC4BCLmRhKdM+udV5j=v4TWVh?jg zL_#@_*S4i~D&_KE6umu499O$Z=iZ=wboW@X=eJ5=TJgfI+dQmTRQ33943CZvclTdb zeTCoH5BLCmY||+ffpA}|(1w$-0-Z*h(jI7YIzS#71L&s)8x|1bDz9N*qsY}zjc;Pj z?qe;_nlwR$4|bXD7UCqqd@Zkmo;tq}O4*BX5>;{Y0nT_P&8T4{cPCsIW|T;WBAC3G z3WfJOjxtwZD17}~tm<(&Y2o4?`pdxyO@j{Cyz5kQ%KRpv5)aop$-42m8D!Up>g+P0 zI3Mag`P(x0t`D^FTZ)k;zBKMgJXH&GB+Eao8Ru%3(%Wq!gTjpN&HVM<9j zg$X3i(J4vTn(!)3jDj_$ccFOV5}!nKDfeHH2+c;W;7@ULaheZ9(o-@z&jwWHd$H}a zt(TuF?wd^ojt1lpZ}%ZhCE6&-PRlPGiT~aI`r)(GOnw3eid@Kf!<8MMCp`V8pj>L<s6HwO*%QXK~S(8lPYOC`C^L^~+TiUG!W?d!i zR$I-?WKnXcnW=u8K^`5$xeG!15HlFH42@MC*Z63D)|4XukGaP&!(=H79!A#|Na>5c zV>nN{`}kksn|@FBclY4G$A@q5G``r{JHmfgR#uYVE3Pfe(?M$yj##k$JvjLbk!TdK z_Kq!;HXgJ;!YdzVmvGwA(WP^n^gNv-;tIbafW4)~J{1>~DlX2)_JgAO78l3G}l}7j~L0yt3xQ@XK4z zpU+v=(VJ)X?NYSpH+%N&{pjsMF!KKm-@ZQh*}nZMeEWR&r;T7YcHv3TVmEBkd=SBV zYd`q<@6qdn!+D$aOYj=0?GJk)Tz=S#8yrRrq7k+a_P4h}jN(UOv;CcL>vzJ}JO3TL z-uZ94iYF0HMMLlHL?~zbJ`MZ6jQYL|`@W2(wS~T^7O4W@LxY15Itt!uY=5>JqB{$u zuP0eP!7}e`_oUkG*$B97)EG><=%i=ebU7|oyz73u>&u7_(}8Axg5Qu;=V4s{c{Hjj z`nmTcJ3EK&sME*ae0TC&)4$$gh!j)bgTv=Lhqy4Iy}zv?`Ck3dF~9jAWON@k@ff=1 zYtU$on(J?2^Q9)9JlFhdX!Iy(WZM4UX42w$cZ(wLWnIj))L!^gU%{uo`pSLl+fMQ= zwuVoBjsJerNxq>z*!Dpa4;>yYZT?*+`3{@Ozv0kNo?D7xS_L)6yLHYw z9(59gK>RQD-Q4UXPvC!>i!}ZpX#BK;v3t^Zy_2jHd;mNjqFHq@L%O6~+we*C-t2E3 z{`utf;qJlV?(v`RtgWls!DHPl#Nx!b#22$uQbeHhqGzvvPw*zwmuR=73&6GhKs7JO zaji*jIMd+hri9y+Ql;ysLj~z5l^^9&xyYurn3Y^O`k7jZz|?@3C~5A<83Xt_p79@H zib8xcqXYwbTLxfxCez!uj@~PcZx zfX32k?81}8Xm7KX4=&d`;j)Ry1RI(crCCTvBYD%v9uCBw2FW$?soZ(cL{`8h9WWLT z&i7PmH(5}W@_EcXg~A4gsJi-PJy4id{Ue?5k2GB4%e&wQ)^^VDQ0cM4?|=lmh?iS* zgOU9_idKA};fiHbavTxpxgTa^FmM*{eCY)nSvIPO`WOt2mF2>j)#^3`un{&KgenJ|-1R-fPl8uw~e)e0h z-PJukLO9+%_dGYsu90T?wYs{xs=8jx@F@svBw&)65c$9D5B z3`Nuhg)*n$vlz3q9JR9&i7IUUGji07d*IXy7^Sz<2iiM8V?O{h4TeIlLf`bNI~sq~ z)kt(+iMZrc4*fyVtz6nC)?{$LsJpo8sWm{f^<3cNyvjuSD zR3~FnYG;FU{6BVl&OV5GAoFTd?6fK@oTihawOWQ%xG5Xe6US{n?06_J3l$Sy3 z(e35#{tB;x!VTG^ z8Loqn%YBiCkmifJ5tJC`7K7230fJ%%yRp@cp@JtBG~0QGpr`;RP!!s6Qyz}RK~*z* z&gNm}pQ3d)!3I^Ok+XsfK!-(&#PP=@T||1CVGhjE1f`26hUrj((xCA*TESKi^N@LE zVnyru>fpy630>a~!Q~af#)v-E#EYF{$(doBVbk1I%i5()r9UydL>h?Bq$HxRd7Ci! zuLk=!6rSRdFdyf#sxMKJqfXW^N=*O?We7~Y$NX|Dz@(Xp+ccF-iAruD79%J~< zm`Q~vJ;&HO51WX@Vb$N0^T8zV&L$+-^z!l4`FHvG=zuu;dMTzWDbd3_C#3-9QNxPO zoGRnCn@GhsFykWZQt2(paswSM@Rj7>P`CtXKiH<1<0VLr57$Isu%-rQqhXHbMJkcq zT_~?a?1$)T6N;HGLr3!tZ4k{zW!%aG`=Gmd;JFd`j4rP^gJN#R>~3#UJbz@7!6$C7 z8rg+jMGjiR$=?p#Go7V!hg^GjyLv+|J?{2*_ga~-D0Cqw9{BwZtWDXFcrAl0|2wjk zq=NF3IvW*z40P)!_1;Rt?^pU&b506EhOq?_^ZQKej372{mdZcm!_Hz{XqQ(f4$|&I z&NI?#f(Bv{PAhrO!kFwFved=D-f)gQE~fy9NFvi|{99*&?vxlll(!o~5L*|Uc5!vh zj+Y!_(zGAaX{UQJZ%lqc1;(ezn1vi|I*3_F9aU1TRRiXrlIc{E_t~(lK^_Soqcu+d zQWIDAG!80gZN(|}Dp}AK!wU=oB55lE;6%9;B-)RMFi%=?DcF09rxZ%lMV(m5j`GXS zkiwD-KH@$>0|1e1mMAD62Ux5KiX6GIW-H7^_&PNkNBN`)R#55M=#Md$@#YJ|poSsc zoh!9+Je_%gz0-p7BpL(?eJ0l?4aI(Cv^x?JII;n18gO~;@^>;vW`q} z_kOvsId!46!P|*#m*&y?3cf1CnNoqSC46kic!%xHsj%urmC8&x;k+A0(uLEw)X>na zD`zU?n$Y#>2)Xqk}uMV zC)StX(&k`MSTS&!s$yV@wQX`pa680SGA^G+@52>0=>j;I?)nPHHI}17qqRjj|2+Ja zT~J5s$tAGKRDj$;h!q*VM_-EKs>*uQqbM%*lqW_Fg-J|;meMRz6mxoAGa!T+2n=u& z(_wteI(^g};s{b{WRtToGqEt~jxKYGYV7&WPq&l2m=3IMkv@Bv?p9z8ZK>=m7PHf%1eqSxS!yObV|a1)bwqM<40SZV%1taGo2V97bb#sp4C zO5g>v-D_H}jiUy}Rxy(C5$&P|gsnH6j2e=OdqW)4&?C4*Qe{md|a~d}Fv1tPO0Ol-!CbIE4G9FKI1MXPjXBlHA*P!N-p!a1luS@p7Bt)Jr$IMR0ki?p~|4yiRx? z;zC(>a=F4K5GGyRNn7Ujd?gpDdmS=O2@(f0_E~S{4a09i4rxK~s&EiC0f3?i^+Ti) z*0OJGZ&HU3uAp_8TeY*9=PgGXOj^F0w>`CYghrc?-;cB&c~D0v30dPl&DDRHh^Qm-mgH7&i|%+?~Cq-izV z@S4Tmx?836PJa;T{Nr88NI^vzrr310xHb?{laL7sb6kcJ%NT~q<2rGYW|Z8!jlSA(T;Lu+`!M*~XKos0qD77eJ=&iVG4xjMCcqB)wJ$Cf?4uXqO`L=P)+}(eqAPvtfTkV?AM|gXRagT~&9QMd< zpPJ||2Z!~FDzACrb!awdL=DNbt%)edBfyeA;Yq^Mkx}j*kn7GkXM_^W zi>qPKuHEN=c^skq9jm5}zu(!nV!*5NLL#9Q;OqT2h#^`)yN^=YD zOj$*YmvbZ}$G{*-+p{U@-6*4xV)KL+BAA?hoEKTclu!b@+RMlVZ;;-vsDX9z%-Wzc z>ysZiI;$)#IwQ%L;AJCjK`=GU0BD<{z6kkE03QrJr z+?h-(OT;Q=H-Mk}6^+{Mgqg}ibJ*=Lr|yYd z<%-;|p;yBe)+i&^TK?Qm9O^}Xp)*~I0YL>~6jRY(g-AuuKV@$TJoMw;qE|qE#+bn8 z;N*uluU;!>Q%F>KJl9$MnN$2my)KLBzc6h6oZxm6GnjL^=NFL{Xt6HR0I3o5qz4i9 zyi$ZQlMuyV=A1Km_qjcilZxwjpj1E}Gi*_13K&Vcm&D0T+-_ZtB0V5auUBdHs~K2b zR0-VRjndf3lf7$Njz|aste3|m*9oienuvO$Zko~_D(%IIFg{+d(H{0A^ZKn!H8Caa8|J1-;J2BCOoh7mF#XDJvD^wuq1&Z#PSnZsmYWg z26NJ*itQDu!?1Q|3hediY?{nK2*cbuK0e%i%4tF#H?n=?Xd6!&@9K0FkG-sB?F_IR zcIiUHfI6Wq(v&<=13gMwJ)Lxc;$cIqgf6E`Esnw-oO{{fvzOZk`$xx~FeI{|Vd00HW_K%+TcAcBJGvCIDM%eV%$@NR-nYUb5=PUn*gY*dEBxg0(M7Ce;VqEb zDTD9vz~)rE&*0xM9KKb8)vMN&sSV$3s?vFmb+j>T&f_?pT5VNn6`%993#97RX%e~6 z2%C{>Q(C@zR}ED8Bqw7j18^v9)_l_)3tBPk1?U+aDY0E9-c!>H7AA5^_yP@kA20E# zSjN<;+(ySNd^idk#PN3Ij7XkK$!4^b+RHUcimFU;cQEVaDd+{cHvt{kWOk-WLR40W zQhzLL-ah~8|DYw5LoubPA-|3q4|1yY!4QK$6R$Z|+p#nA7aCr%ocS#dHIF|fw0 zZ>7OoArZPR72Nhw!zGIIeTq9&q6u@5Yx#6|;Kh`#S`f9a8hp&b%3pz4kOVrdHgoND z3K-WWx8f(LeK^Hb%rpC_-=S<$^%+2afz#@BroI=QsN8bVjT^AfOXr>OI3JcvF5@C8 zV@Xq$;DJzww!l$N63#y=&JOhlb=50}w1gE09Ce;aA<$;ZjFj?0{A$N$2IUEkdj4q2 z+p4F{dwZK_^fbYgrMbW^1+|-oQIFlDT>1>Y8BaJzWuzcQ+ZLenMpw$j)w>gk3CVVo zy7Y1x-C;P>SWc1+2Y}iw)z}SB@`OEOWuZBHWA@fDWSkW8#@B_=n+TpR#gZ73v3Dl# zbenaK@pLnhh1XsxpbeI!oQs-BsS(#&DGb^WI);PvnX@z|`6#m%Z{{SB;xPjdUP7xg zOkgw@#Zt~qLadt5+unf*>*fZd@Zjc=;B7Yi_^KiyIL5703^f=G5&qnHgg7HaEB0&L-tOsKr zxDxL=PXk-07lyZ{IYb~evGjaWYbw|#U{mpmem)4?qNWt8rB59hp7PwtlZExOoUaSB zo##Cc+C{z&mw8!s&fKP}gcZ8>;&8(SOjJsSUIKzGO!|u@y+J1HrH(d2ZmscP$VBTzA9ye?(_Fdcl*$tXEAvG(kLo{@Ga)ZW6dlI+oRWH}B8Eaoc zaXnJA>-byZtVcq&>TW}+UDe!n;e-5lZe+GZJwmc4P-S}7XRm&0RYxQ$t&UM?<;mhW zgB(y5XQqpRT^J~XSkr}}LRZgm&)#t`Bufjo`r_cYvi;@q*XOyOH>L2VICD6Z22%SU}nbT~P>%#eFFF(2LT+uO$Y1}a6U*xtOhx4ese^OytyhmiUbX{TLR4d7D zt6u#7f;@5(poujod|`fxk*0J*lj9W}q8cJb_2V|Qv4j*HnkY?VzSAQ%ZD;?-*eD%) zs9t}yLs>z>2!?hgZ?JjEhs6;a!c%T$=&%UL$q*|BHpht9_`o$CwwzzkR*8gyl1 zUbI+QSwZuEC{j#DjFmchtxN1R@o}QV;Af<`U3I@jzak#Mn9P-c3?1oJa$*8S}PG&rS+J(9yWLCzfG6iIsC6 z-}g8^d}jycW8{_?m0Yh&VPxltarq`Iw@e!HqfFJaXQ=xPxlZEZLShG zwfv+U%_iNPn>yl&g&w**JxYGVV{~SXU#B}W&9_s1g)l|b!|XfoCwLCXhK@oXNy7(! zmY=W^cxA|sm!F(X{deLc=;x~2ekBUJ<1c|MvAdSoj*noIyKK`wSyA_{QrHG&Gv z9eXgau}>U?Hsy|xQBiYmOR^)u-G+v4qb^0b?+(0k-;BcwjD}uVZj&<=%btJu{i7dP zujOx69s9^hT>%J~=WV--H%K75FO*WrKockPegtkQG%{PDqqwLh#qTwQJO`H57xhZ_=jxu3y&lDnV~^Pmi=LH-k)1;ns?78o%v<{4}O@#`_J9pqf8b* z`%engfkw67s2vZEy&1*GJOWO1do=#Y;kNfjz_*cWCt%XbImJ=^kD@;WUY#2}Id_q- z^*0n4@|D^WoNZSt=S%hpP-`G8@xw8tGl`xu`+yIXRejZ&T&Q7Zj|~{u{tB6xm27v) zaj#*#aOxF3aV9z)A%{vYI;Z7mFq=|LQE_8!^XY;tE}3spP?+WiqJ;Dv9f1eA2BR#d zm@lYBzLq+3F|x~=%WEw+)-!Z4TXNyxmr$PmIGRZ=Hk?F>)0kbBS=Q8IEo>H(ts;Q& zr3P6RrF&-r-1cRT%ybYxJk#6`ZB66Q){G5pP0rBPJPd6q{%rThw#%*1<_=Da>4&1s zQ>|l)g|=o>XuHG-+S<|g($&%Thte3^=0wq*eI^7ch4Kf?s~inez3%*1Te2I--yQ96 zf2S?E3*_&PG&mTYVYHnjgmemi+!_M=_9uZghpuI#YFIOFMJ;AWgC1Lmh;eWmnI=R! zvoI5dBJp&JBv_Tga$|;$TTRN-@pw}qhIr#PQe<{BYIoYF?QZLqeQ{ylv{$iufHoX- z{a2r>r0vp@v^Bkn0(4)WP-yk+6IT{6pkYCiZ0FFBZqy1)^r_2+ugB`F&=0czqHQ|GZOr`qVm`+ou53TKzqKj42 z3iFCU615M$v=I{BjX(m)yNX&vW1;)|(h~4B#(^?!gJZ!55ei%?Ol|YeH^enX0<S)Voxn=oRnh)p%<2!SZ3G$`5Ck*P^}@{XERK4crv(p>A=4Bkaw^I>i3CN;x~7R|PjgT;*~$ zm{%o2ZK`q&a=$+KOQp(q^x-Bui0WLoi7aYqo!Rh`t1Pyw`<3<=$12A|OgbOtA``O@ zs&XB#Ri3OTF-%`i@^S$LVu}(IjhHSZw|}&~)4TFl@xkC|s^S2EQ$*Tc1_qA)fLYrJ zf3I7Qi|I&e56dP3a-XhzrudB4+1Rm0?p%BM{Oj8AY!@mvjsfw@hiO2*QgZ% zl|Ij}I&9t0q#OYz=tNQWinC(c?84yHcnVr>tTxEL)T~EyFdbn)r3sY95}3B{ezvw+ z@h&dPA>Oc9ecU|*OZY)5fRPNU2y z;Wk=v@MS)lyfhHSK=Qs?=grXgLMeyUOeXtElEE~ij#_lJe%ZMyE@zj<;Spu_qF;2; zg`F0WLj95Lt~VS-6%A124<(`(W^`o}Y;j&=S{+y(yxRKdX!pgl-50kWta_vGAvA*# z#SoKvdAGnI{4f&I2Z`YZ<$2`MwI%o#JSJVlpZ}bdW2l9L_3(sx(^1c+kT+y9f8ElrAt(!s?21&&1oGtl8;yfs-1bB}mIV zj{>Lx!rqy4?jra=9i#es!_jbgUftYR%CE+wVNSU{$j;KIUL!TTWb0kS{UYrbB|hgs z`>y19r)20zvvjG)A&<&D$K=I5^*|J`qDluS&I!VL-1KQFrsufc1%`}5yQz=)G>qs~ zloSuONtI_<8@DbHm{P+ckl%*}ai+p9a4kZMC`j|J%W+7VcYIPtqR365466-1p_=!a zB}KKNXIJFe9X$G}(GoW#ZmqF;@gZL>6Hk%xIfTqJM5A!TV`0K0G@ z*$#HU;V)YE@p%h=nzx*yoa^`=225LAw&Cgo2O_wKzQyZZF?)hlk9AIdURugSE z*b7K*Xg}XsO`X#mgEYv8XTaf*y|0pAj_4q4Oy0A+3h_RM`^uVoCqSU~cJ}w*ylVNY zDgW@+`s%8V+ugP>gCwj_qik>&csHgD4CVhBW)0>v8m*P=kb#3SL;xSK9TIj%lnhZV zj@8Q_`@^RH3I`rA0OhO;hi18wH5-?sUfz&%uZ68p8l4og)*0BWFP5VkAhWgJ1CFV} zX&H{`9*>>nE9{m}5iZI&gNrW3kXBvfcD3qN7`DV zu?@jS#pBJabm9$#Yza6Spw=Te-F|WL$L29I(gSQr{ua=b=>!%Ko3uQQ%1`(FXmAw~ z9`fXo8Pvf`7&-EXzA@~$)KCeZk8nVNhP{ELOC`2`1_u?&had;tq|+;|2m?Elig3d%TmJV2rCAxB*9lEDdg)1wsja10?lunhu2YOI+JdmmGOD z-XbmOBWwex_pl+`xls)J96Wy5frm|Yw)IX}ll*6P4U~#kjd^rH3awy_csz~9)8Y~~ z0E3{+I}>QTFNCN&y1c|#s}fi`7<$>7Pf!-1CPG6@F;7YC(=pQ$gwObNa)H}@Y31st z;r^13fPYbetr4lDKDPt3$f+~T?xvTpw;xG##l9h7!-gKh2x(am!~$NCkoD5QQ0^r4 z6c$IWgp|75sHJ@&4daB-zdE%T(kqF0f;=OlxxrN#4*?JNz*}>Kp;8fF(#Ym9{4qn135S-2ZwEw(lQ5!X21@4(&iKeoX8B38CloSbR*F6VfW*YO>*?j ze4hL9N26&_Z(y!L)1%QXXXU#&3IJ(}`E%V8^irEjtrw4^X31#BTQ*Tz&^*D)qG`J* zlWLh|8o6^fzcBgnFfMf2@Vu1(Q@6$^c|=T8k6hZ0DslT1_x5Q_ftlC%UHS*`r7iUa8z;n6|f z{oDDXtUzitj9C#Rq++D53}cZ|kOmE!zgJqpfkDN0{iw;((|6hG4B+2^L#QJwFP)Xy8ys_6&^-J2gR3CcD`&8cVUH&LSZ<>sQDf> zKCCuQg|!FPSexeE%@cGm3_1uDAxilJPE`HWl|j$(_@GM-Sy7g;+~tHEKV)$&+_<}9 znN9nDLeuRg1CWmlXIDqZ-IZ5U4}FwvuM$QJyD}55-Epm*?!|}Bq*wZo4|+9!g}SuW zt3N*H&&*LbcmdDG-a9MjH?K_0VNp=!oXx2i z&RBcT1C<5?+ri8JDQ?572Yo%$SSBY{yf8sbFKc+C0nZ|ZT5XK`h48+i8h<#O2nMCrM zDp5|!ofE!`t%naQGQL{@why)o;o2>xR@gN%nYv$KX^LOcbf?1U&w7nUT&Rz)m}?9nr8H=g zAW9afWn!5dQw4fKh&#YIs8n6vtz$L{rij60ot1)X)SQpL74Esd5q|_|GZL;9HxSe+ z$3v;Ow7j~u{@~#^-~RDWe_m?6^O~4nod8*8n6p`qvhO0w17o^>f1Z4iER2klZcUKm zS5_N*PfN#tVAEP@e8tz1f7~L~J=>u)`?# zXhH$lU7~DWCyQcD!Yr0-Zqp%M^7^3J1isSnJ!r>{4|#E*p_W93`odTGje#Zrc`q42 zzUbXOT^0Po0hQ#~=6sN|QnF7~`?ojlK;M6Sesqh}%Gj8+aZPP?;Fn0)PodKDBgg0I zg6b+^^}JWPyk-;_7di5~npVL^%JJHhQ^ZN$ChoMriyD%+xE)kB(##tg39KWac*}Eq z#|@m12Cxw*ggzx&l5@xJh)*(|4TlM@Vf+$3z$*bvJRjf=fGpfyz-?nz8|BGcm1U5qQOi&Ef*lbB+KRRXwK-^+2uLcf zpwfqe2Ltv<0#X+}nET=N=6hH&_>?4PvfH$P@C*bWg^kAfR&Z3CWl`OeCzg*q+y(uq z0SDd~sNF%{ned5Z!OE}`hzr@~zNu0Df!L@)=nyreW8|hVLxmmlDN`sB0eEQ0(E)40 z0}mAIFLETaT#C#)enE}#FAYT%?uc~T(kE)JQFLWK2-}d6a_hx(g&Uwtza%`D}0x8Nj80xF=7zD63Punn+Tg~QaOU8bG6UWr@QE|3_mqjz7hVFI) zeWf`_NG4~Lx2rR(AR%#MgdtwF4vdF!D(?gD z?ZqZG%aQ-W#R&MJ)*OBa8X%)s0~RsFP^PwJ6-y>PydeT-?G8CR*gG%8n;>X{~mLmQcQLpQQ2lG3z*7fHQ9smyK>QS=MAxu zfhIWSPGXMI7Vck8F>&$<`Hur4i8a400|i!Gj6;akRg5CYh0}E$B?D~SY4~$s#T{Mr z%N+{(8jt8bqjYZO{vw1%4Xp*bDYu7&Ml|p8N>O3dB*7Q63mfpWAyyM^VBW9cUNa|K zHJ|Uu$>6dKexGSf`qIUuM@y__*jkq$aH4sG-6m4QQY=i*3Ma$ltcgpYLZC6vChFyH zoUp*fIDqyfvip|ORs zXn1ctLU(y24MbxeoXk4iT^#tA8hJk+IV+Fw4WQJ%NE4GHdGj3FHJ!AoNll@|bN=MqgalE7XvE9+`WI{;G z$XTUAO#<1EHV&RWckSV`0Ce62OFBYHm3H%+2SDD>0%a;Re1nC^!T`T%;8LX5Y;UiLUp(D&aM^V4Hs+2IP3(D)%Uan(H#zQv9R}~8 z4Hfj@7}PDb#62y&b8@pyQ!p_0SAzD9zYaBxRv!~U@a-ODT&FmdLHgkkB(RqWBJj6m zgb@j#W-b~%fS@Qr61Tg(3rFj9&#rI__c`CqZZ%(drkB=yhHE`s)IH zQP{`Y;9t(D!(a3HTv2%SKo`bNb=b7m5`Q8)nAjcoaOVZyPJZ)^;Tz98CB`)^n-ruQ z!*WlN%F?%fEA$7a+5T`%1nKf;9|)S~QRbJOA-2KM9$`$M6$X;;N^FW&pOKXefR=_J znPiXY<&!0f*DRJBk~PvvB0rsQvR$8Bp5sh$CtbN$B)br3EgCU|{@`JSUd@s?8Q}Sp#!}@ldTwM)S zS|p+EE+<;|p5&BnXLQI008 z;QLm*XT&{`>?S7p`(iXJ<9rU*CyWkO@%ftM>;)#iDHH;m<4(ha=?4rqV5{0zMFB0?R#@mItqd zWKhE#-FpXH&tNaue%MQ19F^2(>=91PA_+ER2S=F`%aLu9Xc7C|btX9{b(t1qqS@)8 zM;f+41<1@OHD&yc-q7$q2mWx1qIHL)Vl?3)n^GM}XGmf+=b!CtNFv%(B$6P23S*m- zJt##*VFrz@G;fyR!P`&*3ee$lKO>EdSWe-ErgCElLre=fRL`d*R-(gN6+xSQ@5}PS zCtP>6DCUKSw@Ta|kYy&X0zdmP4S6$j3D|vuJOSLmt`S}zTODUTmT5~HPi-4cLD1w< zj|E7WgHC>r2Q1nC;~!47-E{A?u&X@?FHM0q!1f%XX(ZYoe;3N{Qj5B3WinNIsH#GG za#;+UyryF=88$M2%{yq(0*@uj9Dcv-Tr~%Hd2Y%dRlwNh&NspWPi+BIOaz5^Hwzv2 z9ua86d_JLDB&VStM7e+r3bX}J2^)QmQ)+5B3TS1;AW9r#^Ky#!%S5ETZ@N%-gPbeb zo05I(r;`reVl(@}3A3OEaRo6K3z(Hil%SF9{l*&g`?zTwj+Q?(Ex8>+5+bDi)QgD#Vb{}sgtxw0@E#v zx?p->C@IAlKufwDhlQSE9b^rfB)&Cdq>WZ6n58nx5Nwt4BZZ3|0Dz@!1r`zh04;ks zg9cY@*ja=)xM*q`8is0i=u%W=I{#Yao7G29BBPDON$o)}G?(U7W-TtW7L;)UO<2g3 zNuG*mY%K%FQSrT05-><4dWBfXA=sDNnakzZ$)7^i}*qd zsAv(NgxF=06g#knncJc~YN~n&bN^8-r~##+I{iPsz#%fMuZS{!_~kzjqsg@x*C z%C~AcM<@OC$vf|O=ja%Y&wzatEmtV)8OCQwu~dpuR7lcaf$clu#SkOrdgj0Z+Qq*CZ?U9U4 zA|3~u))`aap!r+|m?ApK11|{{fXAT%A%JydmQJpD&tx3-5}rMX2h=*YB1JjK)ma0{Ea4|N=_Mm+ zq3YPBDf2qBY63R}D}R$w_*9t=$*Lccl|->eYvKb@1Tv1{hwC_9uQI7wAKX2~4VDf?Rlgn}tYV-nma`;a z6`i3UawR-ysnT(EJBZ*I5J52t+tAQnA0!I>1^Rb+`FDgyrxYFx=)S7^da-`*hWQiY zD;|N+W92po<`%&WtQD7dbG3a+MjP6E!DNh1Gjcv*D?`s55kn^qgOiJF2^(6fGHrUj zS;=-xV?Cd^&7aXtJW&{pHU)rHg+3b0(1JTv1DVj^71oNqQQq5qwYR&!^KAF|^II6I z!J*Dk$JP-B0TsG|ZV5O8(>dwvNNU51*b4bqG2XDN9mPRtld6i`j|jae1gt&A+HB!O z9g@0A)iZ8D8yGx24mziy#`tJzY&|`~x$W*hKWMP_8PR{3WBmq24Co9bCH)oBzae`W zk~fd*5euWy7*4kpaWIrek$IFlAcUP(XdX^e-&U~d^<)Hl>|WnwpY$qijE-5LK|1xa z%y=$(OMIjnpK;f*+>z?r9>lmGd!BiK**B$!7V@J8OEB^dHdlNA;GdTF?@J`2-M<`v z4**v(3K;zA>%7E*IiaP5ywKlX*lEfTc8H-=?pyt+Txd%UX=?9Df z!&|hoCBpqBA+up`Z{yD1tq_1%9=W#k{rm4$2;L0#4WYlf6b9jZ&{_<5ifHO$mZVV2 zMTqi{^+9RS*b@D&C={}_0iO?K4<}R^3jF-TK}lKUQqcCG6zdoUrfCyJ76AfGeM7`N zi+>6tk8f;O2ngQ`m8*wr`Qf&*f+|D zmz^s-(x8nl?`b417~kQ4I=YTA4$hZp-3>54jMV4aEeAF<`zF#MHKL_u||}H z*r)ub8|zke;{*46FeZK3i0*`N?D5@E$J|hDp;qM7Jb3D(PpZnoyxpcaix=75?4O*) zVzr{T#re?sSmgyw0ww^1@1m+Vklkw_e$|Lhy9&sv@^J-XK_s}-?jq2-x*l2} zk}PWi^Rmq?UBtR(;&fGWlB)QV)LhlHnr3yW;6)gubsVe2w&}=Hjps6Zw+?bRVB6%v zL<-XhJ{GDMc@)_$4+kVwD6)zdqIU172 zgh27qjVWQ!3VRKhUJR-q_(Zt-1Q)5w-h5LfD3aE^5ABVsTLZp!aa^o}@n#r+^ErB_ zy532N-FEkaCN)sB8;5M$*bz%cO*61^yK2@W9oOtEzooFy6WRs;eKLdwbrvpBl$i#n z-57Y1pRn|IS~N^dO_GqJNPu*Ct~?BF_tfrHNaSXkZFBdi-|hL z1`pSxKu2{Yl5JHc=N3{!_Zg&a>PfJFuz$F-cd*^649|HE zv}#eUOboGvF|J9RpM2eq)~^z=+PF{^X-{TQT`50>HTz@TQ=j|(%DgZ=%9>6k zdz3A^@bHs$sK)I55h%-g`;%4^(!a zaF8XBv$DR22g_> z#Q-jt;0s!V?)tL-?!5vPIcKw?Jl6!z zq%4)OlwUcsXW`FS!F9n2jbR^6J7>+iaB5$?y?93qx_kP*RS|;SheB6QIv?`C&pPN# z>6$=)l_<~1g(}c+n=lNVVvi$g@ouBLq0wyE+Ym*U+%f^)O+*VLK+iT+$3nJb$}kNt zM5iOJeeU|lT|H6A^cUONX=gGi@`)HE@Zxf~NJ{x07$z-Z7Uw228z{U?2$q^kx_~!0NXaLc531`WsVNAnAWf{%Q zXIQw&?Cxc|nyeoCg8xqduR89ia8`SG7!;)w-DIcZcZzG;(X(g62B;$=4GeEZc2&e! z&@DV33V`kB6q&jldA~3u{ICU9E-=J8>giBY;0raB68MF&r;JBCy~yF zLW6Nn7Q;1-I(ZGQW&IAN-uT>!osLF>=Sh`+GzWF&B;YPEery<1$6Y%CN^$&~#(%uf z_^1Dp@gx8C*@K75F*e1Ux1xCRm+{o1D4xjUBCQ~4eRorO2LmRYx zUZsf_=5VUtXYWIEY*L|oIL}#IRW#ISp6nrd8HZGEl-rFA1r-3$O1AU&8E)yEoP9{G zwTfyZ0M2^3-7JvnFh7jey+vM*nu&N)l&F{?*++A!tC8|~(d*?j@#uycI}^0iv>d&Ip&i8k?X= zPz=;@#tDb?(xFWgc2le7OY}>3$~3HI;az&XX5Ommc12U?8C{=MBCN@XrhW1WLyroD zsg-W22vhmFLl;8buclk-7s|jBM+-!II#Mxj6ZZAS4mum-9H@8q9O$_*!IRTUfRBVuHNz*Pi; z#r(Mc=9P&y!FmvmK(XQDOyK=x?5`g?m1t`w>V#_zo^AMO6UgunDnSF1?F9h}v^jb> zx0;PmptbPX{IUB81zHCl&8>3u{UJptFpu{3U*Mw{0`P3Z1}eZ{*5w=!I3FCN4P342 z$Iyr~KpZ+UTz~-^tcKGMG=}nx%|uaucF9SH05K`!_%izLm=>ExK`@{+%I`aq&g6_; zNBmBPV@X|G>eW@wr-{ap@~J@Un7bg?hi=)N*gDeHZEs=lF>)OZLwBIR5F8-Ez@5x4 zR`T1;dwAQgLvhZNHdjs}(#VfnhfrHq?3$(mSLJTIqQ=cCs&JZVRSoJ%2O$z0?Ed(& zVuLuHtXFy6MdGKt)KKeA$;t8ZP+s%OPZMIp;q}IX*ofx%3?DW63fGLCP8LHzwoxY> zq})^LuAu1W`yv5Jy)*R!1aZB`2}xkgw(Sy4o>BSbbf1ADmvSdgOO2OK!S~4}ja&>h zlLb-&r?S>y9?&?9mBo4CVW@e#m6D2LFNqq&1_S4M1x zi~Q##$2+Pi8$62VjSb^(smBg_#fY*vx;k+i&!yCE4#__JF>x4A1haO0El#qBA!yKS zk`3NblqzG4=@lhL3p>m4*6UiVsSi;Uh3j#gPcx3uqenz^klN5c0K%<37fV|ZjEvdc zhIRhUcFpNKMv$5my{iphAc0G~jVVIeXt*rPM34>8w|0ncUjOKaNVbGr4;`$KJ~Uy| z^vH^J{*Y5KD*$z=dGfY$h5Z$LjBWEry1V~u=chNX{n9MZ{qfe*H?M8?y_Ko?j;iy| z9?GsCN#fcLI0EBrl3+u9xq1=WNra(^pk27| zL+ZwQ?a`|TxgVZ!zxGgSb@1a(yiRj5rjoiMC7x+S9Q@S8o#~BMR#xJ)rM*{5YRTMY6|Nf%(d>>iN#xy(70Db02S~P7-(V*{VEZKtLH$ z0~vpL&E;5ACwo3Y%<&MJx1OMBDc)lwHKJQ4ScxIVRln5f`KXLyfJo3tVrl-S5-?+N*8emF1SNR^n> zUIoB*BJ6kLH&H9eQY2I^xMt)_-gcG|9Et*#wamrMTnr`oo(CmO9;7$DqWf~Phh7TN zt;rsIh=vq3fRpQ0F@sI6S{2JT43c{zwj{Y3RnZp6;Xi0_E31%@&@rV%9}3BWBzdJv zG-zfToWX8~lee)1t;!nHh6!XB$L%#X(gab>vnOC>hw2aKqkxhIAt6uDJ}QWwXYJuo z35O{NXRuhvzsQwy(7^OY4bYXZF-7uwQ$>O)2A9mL&--q=GU1=e$}m`s?{p;Dqd0C7 zSLFEy6w)&v$fOb9cl2`iwdTjf#7pG6hiJLt&wifxoR);$b6soHhR%fcE^iOHYAz}C zjn$*r=qJ|upTiCCwb0Kk%K-3}N`)Ap*OgEQ2+}s!l2HS2<`kaBg{NLe1x>Mb!y?1y z@(uMQj7bu$hL@LI^q){|gc~1AE^^$@6-C5$);yV`Y!`BqIK(CI&rK)Gx*D?c)rp3| z!kHQdKnNm)FUaxC1wq=dxvGw};eI@u^PS!AUj^h#*eQBoqQT0{9QFj-)uNoQag)Ic z-qqR6ON(bKe#?=uz8OWdmMK!rYv<(yn+K{g3A0xD5kr_N$d6V##y|nWr>qKYjEEifXUijhHFWGI148xsoH?amqzn_(} zZWoUKykh_2Mt}X~WR=!|+iNX_JR<=&VJttT&x%x~2_a?r&WXe9T zElbKRDTx+hwFOy^VpXHgM8>F4k~K-0V{2Md6QjsURwjkib=SJdny#9m>Or|`j*!|s z6iP;Mk*QU-Zz65;;maVCyQ?VSh8lp>+l}vnyAHX4mPkw&0a@;3jhBrC^BnRv9-~s3 z9mK*NcUU{H&4B?98#FYKG4l?`l>odZs^1If=IYH^2NITnYQT2mjYt|469Kc14hd03 zv=272_&UaWSvNA@@g2HrR@}f~npc5hT;R3fRPs0?3XOubYvfmAUFPn08}O|WTkc>B@VtIW;iX;RtMJkm-d6Pe zdethR3b=7|w_|y=E6hJUu~)4v4M}r3#%L>kI^y1l5qZMhzG4b!EV`9e7?>#IF1f&<=x*aVhP#5|QQ&~1oxSH_u!F9cb;U**h~bU=(MA5T znYSBNJG()Du3pT2M|U_!hjJ0*=dhCGZCn-Kgvzqb5f1PJ$UL<5)J>RvgkkX;(q-Be|;+EA)NH#aPVONc7I!i2QM}(T3_G$!|9pNfpWVo(K0j zImbRgufqro{LEv(etyO@TcT03T$P4hSbrsPz_%1b(s9rw?$(*axsDN!ms(l{A^`^^U26-qF8BkRIjFMAP5_lpX$pq zVv|Y|XWD$Y(oJGiA78Ju>LSkH1CD{yH{o`1HdYPbY#O8!nzGv#-+MT(UR_nMA_8ef z-%{mRq{5Cz6x{q;6*(44nC7W6sCpBUGqTj(!p7Gix#sQIKREWP-ejOMe?ukl*j&^& zu3pi?XwZJ$fl=`2B6q=~zoKcTlr^c0KJm@sT)p9(u~2|?4L55qeA}6fCqhnT+RUIr z+-fsUjWjlCMEuW2MV|!jYq@WVG$<;su7(Vwwmp@+xf#a~uU@Nhn!{Qnl|@u4&^b}x zv@2MI3GO5^4vQF_J*B%Ljx93lEfpRG0<#sntt_0f{-6;AS0bIkht5Y{mkqhOqWkvx zK~%2usZqaMRV%q#0ZIgpsAZFIBe;v|w<-3a8bKg8;num(M*T%p@&*0P~>-%D$U+2?+FF@i#4=Mw78Nkxjl73xX`9{C4>6eA@JJ>Zf z2g3Xo*b2*nwqltz=K#k~^$?fY&$UYh4&=9*M$eNW<#On}Ge*Y;8$<(r7AJCPL@-7s z&~FE^)cKX@+%%`WaESgJ_6B!D=`j}A5c?CK-Xh*?66*%NMP?xJU=9g7hIql860_Ps zlz=U;2C8}&bh7diopuJrloDUF@;PE=i}EErzjo`XudMf4LSe+-7T|Bc$hGl6G1^Oc zKH;%6HG$8C$qn7I;Rvpuqs~rzPeXMn%#OTsub&QV;dn+j1a>qK_>1*KTgJ*?jEv11 zR3|oXSJq>D-iXbt1m?!U+FxT(B2o8z5$EbJH>0vTrK20piM-0qbbi~gM-z!>F?ak% zr`;@{Vx@As6^nj274hqA#Lsq|QZdXS`k??OeZor( zD0Z61@AZPj@iuIGOQE_?i|M2@`50#NabfBrMq7taOMs_Vsc7Pb2JWK-RB!Bl5$lxv zI!>#hshU%5i!KiE0)HA?t^^NB4c~HRF5z>cqI{~zSlDJoR>H!3h--`m8{f^lN17Vz zk@Wpjbrg!AQ>Tx{(>atNf)VKerbcBARW8CRAr_cA#Gc4CgT;0khSlY|IO2#uCOTR) z*l1PIP;YAQXC9g9INeYLcjeeVXHwC$(1+geT8=pJdDWcLn)Z=L}MZuZ_lSnd1 zwDy%iC8flhq8#xY9F5~yfvj1)rx;RX+~R9H9u|n;Dh9Bja-&InNYQP{XpHy#Q!*uY zVJgT`iy&79 z2Atu+X$}sKIpWU0VcEpF;n9a(Jl{JwINV>~O+?|V)>}{13v`)gLw;eE~4EsqUe(N zdovnsxW>KRP+9h819leK9kMMor-P#CshWt;p1CX4_~6i^Zitk}0OFyIoEoi5{fFaE zR^qH`P)k^LTtXO@9!FnIM-;`dGiYLj*1PZ5$U53S#x+OS<73$^O&s7|!XkK+N*alN zHWD7u?_oIbaZi?=KJ$`jUZ@I}0}S)nnH1A=8!XE91OLFl)h-ZiZ`?YWgU!Upq~f|! zCBUo%jB$_Rs4?6{a3)EPl|j!3WZv)WV+`hOb!FA0ywwP9pvj9X(SCBbWkI+Ij#O0WCGo6Xq}xUe9I1YJBW zh5ipqg!g8TVWcd&_hI84<37d44^%f`KS`a&MgUNLqz$=C$XVbWl1B?~l#pF=`;#8O0oB9kQD7 zK5Je_*)OhezT*Eg%xkW3aD7jU&tKrd=!~MA@|f`4X~2GNeBBsLI9{~B5B8@p6#H#B zu~tP2j&KT7slki7Xw%ma&?vDsk{WUV85CoWRExE7c}YCPt0Q(x@tF92tqv90u)olR zTM1h$Mkl4-tM>L!v|Tt|4#Z(XW^0Z)ME1|*r{E-p3vY($a$32R9K5A zS6MM1yq=U=i>?umJY1$-*=Y{)%Gq*mu^9fWIG0$%SxHwOCLSau1R@sJZ_;+Q?#r-p z3G>44x#?V#V<~ywFrY%FF^`?xRHR2tBT-ECO2&16<8%$033e|7 zW1pZ22HChd6FJ^cbxro;$8@BoFmj1u(#}zSMAtD26p;WcqMaANfJrlHC#~`!h%)z~ zGtMa~MID+krsxB?u!2Gx_z!(u$FJ+|vWkWQ%|@v*0zc_(PU#0k4uGNJ4-vj*<9-9= z#AWzrWo4yBxs1aNNIH3PUXN_cEq1iY8Hx<0NmgVQmZ<8>`P7s~RoR43i{Zf-Z5t3okPi*$!ygq+B^t<@`)@E38!PSull*n(R_A8vJ^vKrefp0LDHzqETKk|POSY-*pOIV?D$*~{?ISa8rriX?_hR#NvsQ&~hYZ0%m) z3E_x0Wp#1ET`W7~I8dEAvt}l4J&Y97v3oSHXj*9aAR}DPrkwS)vL)^{csKNm2?o24 zHiIe>bW^m|Z;^*R>U&lRT@Cs4n~{o2woT5Z4Np zbv3aU)?_c36dxgYIu*dU{g7Vv0BTZF2Hu)Z3=|&LXHehYfKo&k@tY$e?pAdzzRs^W|ExLfSsI^+ zn5pa@T<}E{EJiYSA@Wtk2q%Yu+>;ND<2)xF$}L0~7ba?eA+*@3_U7vv<5(jpAwtyEbRAQy5%{ zNldfmR`xi1+CqZYe40JUwpzs4;^R&8d=p<>JDK&`$+%O6Ch#4FS3KU$9&wz--2|_M zPW6M%M6OpD-{K5{H-qk+Asff2`8u`0x*llJUb-UdNPP@ zllu4~A5Uqrf_^ z8%S3A7^A>)w_dZ<&zko3S{4A#Bfipqv;T^0_V4EXmXALfgkex`r+Z(|i!F+S+uPaK z>=gDkuqs*5000xA_ZD^Ut|+43UDGsev7~nwf;UcT@p>{sg%s^N1r?@A0f977x;kt+ z&HL;E-|0zK%k@C{8rr(05X;M;#^-%*gr)b_;RKnjs9{jxyQTH{3Uico&N2BD-I1b$ z%zNhxcAcp`c5`r;=!MLK7V2gpj|1#y`(S^2D~bld=wEp4;)s^6Kr<-OYP2N{Nk?)dV}6MtlUb<6VOWfk z2hIeT_gT)js!Si!`f+Y+@ms3sL=Rlq3%WK?zv0-o_;$rT87ruRGLO+H{z%i(3FjIp zzlT2I$5U>K3EY2Bpp`+6mocTOuSOQ@F7i~wV+*f!pM9!aE)i;4_2bqmMg_kkTe5A~ zHWwm=FN;`}DI)`k2P7OPULM(rv|(=dofDuinQj^s;rMQUk}*b#iRRHv5j``m4j6@+$_wxE}8IY0daeq;)!W6mkbeR#1Dpei& zEXiNb@oP$W8B#)uyVh81+&$sy8Ksp)sd9rE+)t(8YTadT_-oF+z=(Dl1lyu z+j)-%vr=r((g$@pl<@C7G-|C(K2$M1KR(+oLd$ zM<=g$4o{x%y*c{c7^!g~;L6R|`CN4G{GBn6BgiUWD`v`ywq+X9T3hDgOkzxcY27x` zOJ(0sL3w#+Gx@e^ynpRTeDX6oEO8957bJ`%W2@ZZn5+bwnIeQlae?OsU5JX(x(YT0 zrj#Z@H2aHiLLl119J{B9`7_2ym|Y|u`Vza`QFW=^3`kv<&M~^p^cSAp(QG&+Qwz-4 zL%;ZvlfORB)>ie${rjq?VJ|Qg$c6=A=U_A%yQ?qTCAoPJNiE(nJR?<*4=;#GN2({H zw~)fR*?p&*o7{DOSx@RqnJ500DnnrwW`sdtNV_n1RR>YXub7b<}z9m~j^)(OyoH;4PH zkD>=_j|}@S#^EplJW5E2$6>%&i}FNLM0+ON$&q67#QXijXmVkhV%6==Y_FVRjg~WA z>nNB`+t+lwSFJc2Pub7-cx!hrOkydbw4Jb>Ul=Y^kLj{Fqg_rRFQ+~aHp9zI0^1H? zS8ZByokJ-&vBps9vNQ}q)Dw9LQ?hH*NpNlXDS|){Jc{vH$jhcBHci1spfE;21^&=o zUl(nuXx=A#juL%3-Wd7cKYWo7?3CqiRvxZA__~~QzaEJ3+sgTuX`Mf-@cH)PL;SlA z|HHp)fBa^Zp0BPxSpD{!hksamxVrw}+i!u!KKR2b{8)SVhivsr4x;V@^b3U1><@$U z{@ilYyn8n3%rEnQ@WaQ$fA01`%5saJ{U=9@WkX0L$$PU-_P&@<&aKN%_Z);0EOG<~ z`}S!3k?&vjM{x9#oeW^r$~hhgxBsK)4*`o^<0t30{{w!bq+}jJF-{?uEe!^6#=voM zzC?%D=9l}xzWGazVj-~dLIrGAIEpqlL?Quf@PqZ`QwpWRAtx}y%@+CJmtN*!n@a>{l{gqT|0wUVp{p$VJiThJ zNdf=4zM(R12_H0h;aa}M>l>;J$b3LHTmL2=TTMgd4|5s<{%p~P5Xmw@KqqmMaEI1N z@Plvg@+-1HdHIMlP?(pR5fvK3S05(Dbc#m0iq-u7vKWHw_p&WP(_dm2=bZt^+qvvq z6_>Nij8h~c$4R$$<#}_TaxI|G|IC zA3nK=?ZohVrckz1My)Y{Bf%dzR+~srHm=TuSy-h`N4x*CbFzKw)}O*BPpeO^Zry5f zX<#<^5pf-1v8_tQEmslnS88rWwaOooWx_%SuW#M@qks1L;D{crhL2zXO@5^f9lUM@ zB`&1IR$?^x{HeUZ2&adSw&m4R2ZC1EJ3@)-MuU>aTj67zwmg;viDaUiN`` zVkHAv14ws+(@71B@oaz+$R)_Oz8YB+uq((%HU^SFcZH$?`qhTf^rj!jxin2N{->B? z2WmD>8?0$+;jZdHf5Wrw*nXP8@wVJ15%f2ecs$2L}$I z@UTw2GSPVLym(p>-0k|L3T&GK+d%;x$M!9+&5>bf5pkd`TF^*Ax_GVQn<=-~Ip`pl zS+->e$Gc>?gYFlXo$`Y9GmT*b7y!cQj@OxIjd8;w_N%RYDgueT$~rkVCgfW8SWz~8$(39TpXwSW`&>usb8)TaSqI~xJ; zq}biCQ?1-G=s@|eN8?NA`4V~t36sy!Ff}x(J}xaXLqSyQ6>R{1o7DKXe5?bWdlO!@ z{M6|_A((fmZM?UwR3}e0xiOq}%oL@7@E(AGHSU_esRcWCXRic{=jOwQOuKrxy29=E zty^yB+51Y3xc#TtKEW9+Aesi^$fazz+F987)3zRnt+=U@+LG;Qny(D=Y0WTw+m&H% z-*A}Q($schnA_E1Zl{L1T{BGIwjU-Ys9j>X5fHGsHbWXu+(fI@st)-2Hp97J zpf;*9n~R#+Q0XdKT+QwDs)`p^x_DQK1;46WaZ{^``g6xn9m1A2wv`ydR^1S6t;!He zfGxa4Dp9+MhJXEJihXWw&f`t zgHRnFG~WKXg{^zQnZf<+2Zz1HZ5xtoFBeDcPW!aoZC|vmJ0s{Ex%H1MQK}=Qw&oQ& zl|oPF73xZ%?RkYRq|k+30yn8Eo>TW(@=` z*!(VjcI6QL=7HSMMd8lB;sN!VHkT>#^Gy_`dim+>>^PfOwVu+Z~rp{9>;*^&yr{7dQB7k~No=~dkI%b%#2 zDdX%d-bMXmQjoAPxd+(>sm#&K-PceqDz=f0yZ7&hO=9+uutl`}h(@@-yJtbz1^{l| z$IwM9D=YltDODX71FiN#^KeF>e>0|#tg--H_9!ar%kW}tX<2EQlW=n3Y&+5P+m~;* z-#y|;)$eYZA+c#nr6%IT+e4^h2K53{aHdOc+ZBAFDKyh%t0TE>Gl{xNI`}QD^3+wK zc3w8OTLxB%Nxa3rY++M8nuS8OQZ6xzx}oSaoUxDA$}ZgOfBkgpmYwk4^Pp`&ABE9I z7On&K;Xo$!$@W<4mm!Ej-iIf?D~v0VUJNKn%fXgBe(rCc)>T+eR(SPhudc$qbcKW3 zA>BzlNEO7)ksvqI%p4FSLZHQk-H+-&C`R!x*Gqesqs^N zm47Cx+*VuM8ti!T#G{9rL|2QJ+sHK>da@*#REtQ5LIoTO)nZUs5^$#$b)u37b-mw- zN&>djB1>2j7QGfr!jijliUwsBF>3K5Y!?us79XOLKh+lfXAJ)D>wrp&8Wyc<6c8nv z76$`$r742zwvF~j21L{d-l{P6$l`I#Kw%e%FkV-^d}`~yv^4eFx=5#W)aZ&H9lFaA z!-L-MahZQcWfDcui_B~hWDa)r<3j&Iz-$ik;hBbVosK5v&=BXc3QM;2Ze;}-3iv<# zfGzfv;v@Qcdk4z=uvrYkWTpvQo;XHXIs*Ls|;$YaErFvY6 zF`nU(>_=0~2B6n{64z2`%m^Wh+gp1P1tZ=%Ya^$$y}a(WNYilM{PyYc+B=e2jWwF3 z9byPMr?Q(p8@JU|4r;BxyVWdn4BR-)TLKEP2E^)8@0Qs@Vj9SM(ll$C#ODWxdj|)~ z6kpw%jeG1&J;UsKXk3ai@U$4>winngZ$7=+5FkJ+uMc;8E00O9<+ z^TrP?v>)8xt}Z|RU4PfwFpUJDgK={aM0LzxNkjjY8rkGGIFM|46G~^Fj9fx?&=EiX zcKd#zV}Nh%Yz;SUL261k20v~cqSe2jdrG*Z z4X`POicwVo`_`={o8hWCBN;yC$Q!fMT?&=mx+06kOAx>J}*aTP0xxw%~J2vo1 zoPjosescfKE4fiR!dsr`R*3 zC$!=A_dRP(-=aVZ6kiAXSh*dHS5}@zylqEJ@k_g8WM^G2a8+shqMHy6bqs4)T#(I~ zjD>GfrM0L(A#PO&2{B?XjMPY3M?;h&aB#u9R)UQM3x;l`l)wxYMTMwI=Wmc04a^%C zjYdKw@4~GWy@csy+H7_LKbtrZb@6d;f{+IU7q(>5g4;2G{KTH(EYO=t^N)E4CLg0h z5+8S#Kgn>v;c}m6~2`%EwYc6O1K)iQGaf zu+mH-8o7Mfu?D7@4(Y$PtU=beXcz!dV`;eW^3QYQ=ytNIRLb=H-2fYFa_#|6p zaEQsBYsgubOSoCGIWMyY7HGKGLlPMSo%<B4-I&+tz3cQ z;0qoFMyZdMBy1XHv4q2?Phq83vSYFhL90Lj-y;eogD_lOUVnrRu9tAO$;0fyqo5U} zx9)ypOA9@G&Rxnke!|2-5>feNY0NDr3*js)==MnaJ`q6r$nv>^)9Bh;x zN?QB2GGfzOpRzwh!{TPP!)E^YsItk1*{fG!MUuulW?9MU>h|87t=*Gn&vv#sQd~Be zot%C|f2djK^~q?A@GajOj^W)#D=X8eS+NX1sjw`mgZ+i2Q%>cv|Ux z;Xda3|E#aBfAdG<{{!#W9z0lm@Vo!dzvE;5e|YiP`Dbf(RSXJ@LZvKC8QD>e(R&kb z$XT->vTnJcTafwyVe2PdkNPtZx6n~z~;W;lqvq+^fh z?!ZhjaE!hl&TMNykRJ7$bn&jP&-5d^H+wG-h8_gMSvGsW`~;uh#V?p)8@guan@bEE zT(}Tr;zKsFF$4w<%mo5?_TIT`Z=b+8PeJA_@(B*NJ7~k}YOoj9E_Mjk zs$*m^E;}pU16Mo9-{(*lNz$MgUf|%S>>EvoGe{+zu5#!vP~hNh>@_6D9!Rr5^cu*c zP}oWrQa}I%9nUytU={19r`>jTG`-mE=`f_yJ#22#%}~2Y^-JW&c7?vk)Ehq5bt~83 zH)%i`kWoV6F!%-lw^H2~O&DCP4KqS5+G$sto2?-1R-`BVqk-xitOd>ykX@6~f@1`loD(;3TcS( zdJWxeQp&aQm?B=_OJwF}V;V+tOioZbBzD}-JCp7?3-}Jerhi!L9;{#!VcyQhO3@Gv zOsku&RTq=gdo?mRzw@C0WT7Pgn}*bIy)%5q6-2}}mYfLv(QF7@RX0hoh}1O3V~MvV z?JI3TQh;IAn1%qLf`msXf+M{pHy6GVC$~5zD-HPDU|gnz@ld2JJ7*Z_eKKi~Dug8d z(P)qZA~imKY|y3BWEACRAyL05vyVkS=-~}ACqO?&jg(V!v7S!UlP5>VTiY*#)aM*# z7h0kNLPi@Qp=2t*2Lty%V6aS6KYnD)WK^9}I5Jjl&~Z=d2CX!`WRiM(a+Xi0m!}_v zta8h*_#U03ZRJyVxL)GhDaIn3UIx)-!;H0fAw}yHRl`dTYTeaEZ>BOIa7=xK;+kiwNj|EL?fEg3VyG*RTnmzg%zJ&mKt4Ue7FysZ{!O6#z}$JXmJR@` zVID45U^pTK2+G;uYt}tdP!K4Rp+@W}De*jPzDOi^ouXtSHk3*8tz$J(GxozcgxL(Q zp<;_+g+CP|)LI++YI};xgOy4`X)|qO>ANMzU%fb)%!UMFY-`C4q;aQg zWM>p3c{my_BZ%oa(W#|2x0T3(z}Ltm_;nm7>?sn_3QTngi-d}vG9&Q5JU)2c_S8kr z&4`$3cCqoSJkNXPh(m0bYZ+owf-4hYGcdw}tE+Lr`(jj%H5;@#4Q)s%@@bAEU^cdm zyUyf8XKIZ)eDX9N4I8A?ogv3dfdMP%ir4I(>dnPirg99Ykm4!+&QdH~b<~VahJFH? zD>lnA0EW0_U^>9X@GN77McH=lgtw&ZYK#L{3~Y{E_6sITQR2-56qdsW7EpDP$Pm(g z06OP#+-k3GRwhhO(CHbnK5|;l-rKXIFO*tdm1e~I+w7K+55JPu8r$p zN!=@njNt7Wdih}5AS})x`jyZZ(pDV1$8A=|i?f|75B0P`x z=tdgaEW5y2NQ{PpFb|$1&hY_j{4}2J>>Y23PIvvAZ)XG4Q8t?*KmgsK-9pSf4swNt z!M@Siz3fjdag)}G?hcWwf-P;Rl@*|1NtaLaWx+Zv6b1kz1p)N87}sfdIbOXdbj0y+ z9Z4RX6eTAQ@tYwLHk`ADAkU2Zv~p|5%O9L4xbW4zMRzwGkMRflbE$#HJNM*_?QoaWu$2}5lH6jPCnw3hpooHD#AR*#64XOH`ZdhC#kMevp znd+`tj^S>`E9`R^iuC!(Y=}~jth19)E9*KN7bSAaO?bx<0wWzXvQfzn1+TX~9jT^18IQ(VK0w|;*dpbRCjpVz4^Ly_ z;=|~Mxjy{#c}z5aY<`)POHngMRe)vaFyLK+kz1?1^4%Z8OPUPns-T^LhL@roZ6g)e zT*837Zu;a)(+rAQQ%5#Fiy<6OC%vNIKbdmDNsb#H<3>||<`lb~#S|(&;%Ir=a;_OZ zxC}^+fl#cInNFbJNl94O08|@&7%~hxGCG&oC5=j)_$!~*h(sPen|mSkC`hpg-Qp)+umq&!R9f`7J~xyt}{05%$7i z=wbM_c(;O<4AXHJZPTNW$rL-ci{X@m3LvObmzr|SL!^u8bqt4N$GW_%P6H&BnK$Mn zHac{GL^+)_!>-}4(<~{U<7&{R3Ki)RB>aEdT;l(^Ph|ho85dvN{Aa%X&)VuY4<3GN z?0?qK{%39dcl)1z%g5UP(BiZC561i5dcAu?V;*SW^K5xE=I@ixz6VbE_!+v!UvKk+ zGl?vI{CX6Zj+C4U4) z9S*Zc*^;cu>;FF7eewM<{Ql1+EwnY8o{uJ_7TS7q{Qbe<5f$0E?at9-v~$K&3AKX* zN_~J_dlOUjv5`C9RFkG%mC2gX{wuvy8MWY)y&MnF3coQzEk>k%ZjjY{;hN+8^3=-r zqYtQ>ZGy}u?>(q$E z)N`uyAA?}k8+oC{x6E(Yd=)KIA9MDQ!<`qqN5_Z%O+j^9VPmSo2-=Z{rlDjzD%GoQ zheou{?Ilc9iry771$d3Ti@f>0Zo#5iw@_^x-e;jGFWdu*aFm2yuCucH*btxHwCPcu ziqOQGk2m$^i@mR!rq)`koh{9V?0n+Iz9n;+H9}caG)l@4#J3ZCi-3AwDS#T`kxNG6 z^0$5EmjmYQ^*LvhJ}?wHEA!A?G0T2ZH51Z6NWomp$fPC#tvX1$Jxn5rX+|J0IALdm z$w$4dl{tm-dnQ+sl{R7Ya~JN_)=y-9#5dbZikJ+j=?Hz~CTF=_F5EhUZl84W?zXel z68jiDGPWH%UA3=BUON?2x-%Y*Dzh>QZ?rZ>K)`R28RCx$KY=YXa{Eba5OtRcN=O#dK1aF^bzes+4URF z&x4nhJKN!C!(EJ>O-3KA)t^Y8L-a*8HVtmgbdc!bYpi}eLEx%SGV%!mdP1+EqD%rW z=&4UMmO&R5Jj45g(T9LIux>`pF6{1S<>SZn(6uVv594d6${VVM%O?Rg7R3C-a!ft; z$TDQYt8X^V8#S~cck4bn+|eC3^^RyT8yZ9qBqXe{c&EytlPgkaTAV}8COJImgXyS( zg>L_o8gvtlfb^UUuyM-gp+i7U=+)#dhT%JT`hxzFsoV>!517j75wi~PRcExv^mdyV z+;S<|&U9qYfBZ#wyosx@#0#dY&JAESDGr5FR?ovgpTW07<$Bpf07(aJ)69LBdq-a0 zzi)5bIs-KM{K%Vx@7vs^VZ+U);Y|h1;u2i#dg8n7=c+NH3zF%$GXz>6k(00>74hmn z^JX;YCFlw~bvCF}7ay9RXh=&FOvcbilAX&k0%gegr)@Q-<>_Bqd%~9TA2;lu} z=}Cj(NrUMu<81G*kpO7c)i0=FUSx97ln@{;i6R+QEtRv=>7>)0E~(&+_D3ux3ro@R zBMXLO?(z)t=cwM8ZR^mqd?@#uI8PoCBZ)l;2}NX4X|#`-#S3o?xt=bzxjF{+embIV zwhL;%75=q!bYF`R@bI8a3(R}=R(9in(&#yp=U{J%?N;KTvZfAlzwDe+%KXe5JT&m%hQuvtkY#$u zxh&#SY%0};hL4z{VL=nq|d7<$r z>kP6!8b^!y9!{KGG^!@>6PZo&+Mk&wHE?Gf5^6;3!0?JP$IJ=6SBh@3Z@ zxr-0k$eEbBmMu`S`MGjy!8^4~mnJH%k)_s_9oQfx04sJtvY+H$=>b5%8NH(l{8v*$FfV`Gb-ox=%HT0jKsQ!*edC;TslPOEk^DUOgQxmnBWgyhN)*(9^{! zhTX{tl+rV|IxeARD0Y;kadK}m4Oo7XZF6js3O7$lz~+rTbU#TTlA@85M(lM2?s4n_ zFC!k&(jD&~?C(V2jO-0)P;6?Da7#@Ha3OD~ogg)ul9ip@Hh@rf{NJy4jto{~PfK?A zQ|-GsZKdU(qU<`1{-S_WotYfYe~f#@&ES8dJD-1jQ2-3 zd^~nWYxEAt$!ZNz1}UNHrG&Fn@hzgqbWt}(%|14D@cPaED;$e`gprn8p;#;`NN9Rp zy&XZQ9kK5q#nU1ZoL`MeaQiUQxMO8Sg-zF{LuB@S#WuS@Vn_n?nbeqN@wJ2>#afCf z*5k#qh~^$5I#zb{^Y}a+$NEFS$8h6hT*IVx1k)qo%j_>@}BN{*LIJe!XQEFx*OzUoH z?j4(&17JZwf*dYZb0?}v{nl4?Ipl*Qf7P7mBT7D_$|tqOt5YEtA-14J;t3-RQ+_>u zV!W{&iv)&|y5%oCodaxP9cnjAi|H-5YEbYiXJMGwj(X+(%Um6|4zNyB%wO(}>9DRI z$%?KEA4$|KwnYxx(b+7vncNr6OFG8(@UNNIusW?>VPtq-!hYOvV%o;U+g^X>+#LG@ zlbeW9?&8y{T$DM6d!*3{z9ftAmG>u%*|iFDJsQmAmfDKR_dtjaCD4@YIS-y_v=VSp z)`a&f!%n%Y+^OE86sH4gvP;If`A~htS~NIaVAaP48{FKSt64jf0y&zdBN-LRDNakf z%~a*Zwri$tf;3{Ma^@flK;tpCFPafgt+vl;vEz9#7V%u(m+-ggEXaARc^%Z9fNwmU5ff~D`OC9Tmr#-2%x(gRKJz3IqHG|^P#)U(Ku!i?j}s=*@6 zu*J*#vN?;^!dKfvqs~g*u?0tU>2#-mstN`|`~D>Ynr}9_Go=?EfP`)OqVgdTS#Fq? z;5+u~cmxzEq!)S{!OkBYanYTq!yo;?i-1WEgssen(+=O^(_NaF28Z_#Tl+`5fJ9CO zhs5tgCh@ZM0v_v|z9{6JVjbRyXANAUdkqOM9n>YIJVj1`38I-0DY~)-A5x8#thvQT zvkVLj9xWXeCEtgj+YUxcF5Xix@}l&Y_0)sJ5Eq|LRQ-?O@VVrBkMI<=n55nO`)KUm z_H&2nbjgmx8ME6yf@9ir)S|MV4DmD#274?#G$Wi2cAE+hEPROK6ffo+Eiw(Ab;CVt z;_}p<(VwhV6LqXsr@4*#Og7sJb((=z7Q=faY!s@h*u+KoO;oSx&XYoeWxVS~(;rML zqp=oFpE;l!9iiozYll?)#sNu`9SmYqY8(-4H6}{;GCM8uOG0tO7|3ywWSg z=D-Nvqi?dGD_d>rNr;zqjS_Wn6TDgp%uzlcwB_{>ec!(xrv1xl+Y!?FpZ5Uvg2T53 zYAtREhLylgc&fS#J0iMWyu{Fr*wzhaPCZ>W_XVepnT2ZSVkexK+k4dTbSBd#zNh)z zY|2nSANHDG1Ox%4?$!h%4n>guFt8Fx>?$QFzv>?7C&+kzIA0xX_M3^oJn(fQ9kgxE z7>XNTjO+a{x&vN;Ai}h590Tv7MOj}YzP-@c)<;D4rX}vqm9&y~UFhCf{&x7T9lEs) zy^{qR4F-41a~`&ZaZF;|_33`|*UWM9ffYZ?4wNpypjXu)ZW}Ct#Rg ziCsc_Pv!700>>WJa+B>4; zvaPh8x`1vD8$n?k61e;#!7{vHKGBWXtft#Vh#xQDsN!f4b>{Q5l#A;P+{V()n35yr zYZg=6Eym$+>&@AB2{gB%c0YH!e9l%$K$nbIYwtD^RIJMNR+cmYSte#RV<>9-Pe|Os zvZh!5^B232B^U~z7ow&S;grz;M4Uh+I)S_J%rj=mwdW$qE^ct{&BFn6nsMio&IddL z=N@S9JDQq;bXfW2c>1x457}n1!-1MX_`{Qo-uhHX(Y?;~B5N(gvBMj301H6kn8SfB zL}?uI)uU9v%#)^>2;da0L%9RCamjmuC7n?6Iy1WTB86k)c_jA5`%cOkq1Gs7%9L9O zx1ZVjj>sBB@tRdiMWvEvC>Qz1AlkjfJnVv3wtnI_qYwrV2~v=nTFtO@uIQeHRAG+2 z7?i5>#A*lX@NspJvQ8H_7_jHk?_RX6dRz9<~r9;j6grVPSfdN#C zC_(ZHgTrtOWG*?REqjxvET7;f$HtCGi|c{_7hWNr{+zf(9c?da`?tt`^m^sOKJyGm8P_lFwJe8C;UDU`XKBhz^A_-h1=S_2f^ z{U}DyGg}XoOM&$VnP8`u`3C1lWXcN12tLW2Y#$yctjv16DSHGqh`IJ3@^=H!+Jjhp zWz;%6Eg)7-=)0z~+55NTr1EZM_TDrZpUADxVsNbJSB4V2GvWtPo+WrLHhp`+`P2tK zZ&aLCfYPIa$cNd2$+3wQniZce;L^%}w;rJOy#71|fnh(fUg_&mmDJH5AMWTl`rdm{ z-avuC)$yjX0lynS%|s26L5xO2v2PJsNvQ)_i2e^SB zSr3C>owBJaFd$+Rl5*7kg2FWi{TccJU={+0k>bLY62D!UdbvCBEnl1+URV}O+k^jh ziG00YBL56TuanVhFfD1F?JzBgXROUfJTn_;5#4V28%6eokS9Qtg`{~qzJIYeKUZ$~ zjdK2Pz?ILJ{>w=EuSX^C@LofL6Bra7TPUlPwUVSy!Ug0nWNYfV``VkWI^l)3sGl`; zl>)68slynLUv)dsMboLioG0X|xZ)x!a@HM@oLw)Lx@)gRw%S}sF;qN2Wqt|Dus*;2 zn@NpEQoK$COpFZ+uFW6Lmy)z^tX)u~pin4ob0${u^H-mv7cU_5l{b?4=1F^tLgjk7 z&t@izr^q5O$yjO`Ru`JYYoy{vYV=c~09i)?7ne%i9dlYFg{~NK_+dHFUrWp4hv{OS z#T+zbq`~m!7bq=|l3%W=@u@1ueyWp--JsGU@y+Kk``1sSVv?AW$b*qbO#}zf9Qkam zc3=HQVOrwwExfJ%rE>OHCI{4zGHJ~)Nwa&Fki4DoxruUzVHYGX?c23>LSBDoT_BC@ zP1YGT5_g>hm!h8D=CrO>q(xZ-1)N5OrSHaI)ai)@AxcXPE3!{!LzLDtN_4=N?t1A- zOC&LGV64MVdpK!je`WNH;%iJ=8cg-oo4w=1on!J04+7F^T*XZ;zKlvmBz=FqeQQa2 z;lL}-;##BCxfDVYCb@rPG>HU-kBASpDVp2+rFp;O3`t{=Rf3 zO&2!ciN@Kg+ZLomP`g0{%2!1R@Mh4oco0jHsD})7pxyTirWc%-2 z<=xp-`~{{&N2ygwPBoczrxdI1NY;ZWF2-`|pD?wc-a~A+8wonwh=d)knKpfz^~4{? z_I$4^QBRxUV<5>ron8fYT@JcJUkog0>J>Yv8<7V3l}{$r{BNZb!HgXAcw^!(9|7?H z-)RYw3xT@HX(AM6HDaxO;N>VXl(b-OCL&&gm#4|W%aPgOJf-JwK%yp*Y=y|bMvE#p zE+YwYfBEp|-IaP;7={;;#F(hK?D-_o;mRf{<$OBhh-G(0!HU88bek$6>i`#kK1D;0 zrPheZf-@D6)#j}?cI1(EA)2PPLqPEKTTId-^^AI;R_HsX^5lHy8XMLR2D35Z*e~;j z(?{0@=H|G;i=GZQI2!b^bIpsc1Kt#!@Q=n>vBOeWVCl32@YVyOW z%>7IM7`f5TIYn}$9VnUCpfvfn;bw1{*)jJ&>Sqo2x?u+LP| z#B>;pjx2ymX($B8DbMx#1GUos-OcQub^ui^yvpE_rP9_a>QjiM0cc*&Op@q5My%`(c9!BK=EWvdnc3n zLemjf!@{{f0?SvDVVoJOD;g@;&!&k>A|*I+i=8rCgSzUDfZMm<$eI%I6Ct*<|6|K{ z<_I#n^{l z_jo%myu(~YM1&rScECP4c0e6MEgrw28IYWwPbr@u3FoX)#93lt&cys=<95ZF z3A+j`Yv@6&y?n8KbbRpIYtGJ=pPY3kv*8f$>`i2idez~J?Zcg;W`BQo|3yqOQu}LOLoasr!x>%{s8yH^=FO7Ib$-6K91p1|dwKW8 zHZr1T`4EZMcfNB80t++R-wy7QbQoU+Nmp@t`Ou6}zXo-6Xkpz5>d=goYrDyWOdD|d z!?PU6jc3ct7uzQ=;Ki0_e>;RK;oo&26*O3+nB;=~S3sVJIu~@hox(lG0tQcEeszcM z@y5_5XnNI^@0zLW*K1Y`CRe{=CRz}JYk5t5{ok9&fnHioxOmUM7ZP^yvM9UxV9*)n zNQB*`P&)oH%lZk1RGD%tz}N5*1IRDZTzD=8X2<~=J zYrWuF&{Cx$$b_>&XJTto!i-*?&4z#ifFx+p%{fQJPK-PrQ71JS4TPHkX?BpKI*9;s zkxu}0frp3OZDPD4lB_;-CP;P5*hW%Uc8L0}McrG7#KPfy6A7%&?gZQM?g>|Fe3B5< zu%yjiQ|CV`Is#1z84c?o2Qh*JzlVoFtgg<+MxM0MT(Xs*(~# z(&j9mf}F`IYl4I>q)du4sQ4^1p&pTPd+-Q8=F|AL&rBM3$-e62B3&Xj;8;5ZX-&GD zIE_o)y;&j;!m!&(Zjp3Ui(0EZ_7Jd+Ge1h>zD$rXa7qFHr=<7CNR30oC)XHx526@6 zOG_wlSi5g_5|qd#^@iS}^tplGjsw_r5gk9%KbYVJR2!pDF5PY#TAtZt}!md-3rP=#Oy*==;NC z%=~FWOw&82>oeonLP0H?GN!g02r1$K1=A5gW^;Dg4FYxffSL+NF&wZdCX9fs__)(0kQnw0iq{-iksI~@x(T967`EJZ|31XR|HHf zAkuTUQg?Y5rPj(?yxO}>s#o=$jjuJSVZXYIEu@@DZ^i%)I5u<>O!5lb!@)e9?R49a zzI)@oT7a1oPTJ%jLo|FI8{Yv#I5&djNI<^UoO(}V(E+^$ZU8B?lej`t>J)V*T^o!X zhOZnLK3XHrgLn@7hV(h2xVH`Ax*JnJe<6=)&2%?tXyQG7pPB+6$q+BTv->_Dk>`)fF3tYn56rEHI?Kio--DkxC6t z$Nf6^CSt7{^!XW3u?~SG=gx3#(IBR>2vS|r^b93kmD%HTxvW%XHeO>zS&S^uJ#-Cg z#I)3xUr(2Z{)X!Yy#mNlH^wBJnvvf|bO>T!GGJwZSi$lAp&w0ujoTO2{tv%@YCZtF ziUCk zzg=5heeef(^zAp_{2^QYqNAw!%+L%Z%l^~{bFB~MV=?VTi%JXb{H2%op5BEpFMv&V$;LplA-P8O>(T5${*Je)6o%@b|0)>X% z!K{~OOM^ji2?y}X`I3Do2@}GHzZ4^U;@t?y_yp-K`_4;->t0@VC&hR=noz=pZM@Dn z%ZHL3j*MlsY)Lh9*HEbe(R=xz^O3zk$hra>!b`5p;ukhv-^jLxSp#ZfZw)c2M-s}t zpXQt+Vv0u1ctf%*En-93``5nXm24NS`mmA?U$Q?SbFzd%OP9n}c08CtF>Hr4>S$^( z8oE5xKhG}5rN(gwzzj^^IA{(8JW@__T;!n>mZ z2+w9YIQs=oGdkul6$OnWyUaV7j$K_|HqfR`%+)C75M5!TwRL<4ICXGwk3J>B;;;y$q8do4JiEGV*&6epuQ#R9-~eXxIYtQd7UE(ZBB(4IVdOw01bw|YAXlFn&48lZ>O z+|g17=$&VZH&8O~)wYan_f{xo6A{_^b-{8Bw2K_${~yXIOs8*Nhn>pwuj_MeG27+K zYL~n1)GRrBhS`&}Grrv1?G~e9&^D_b$N;T)$vSXijFNu)FhY3z@alDC|51FaXY$%#tGt&ELBgUp6F>|a$C<-&I0 zxv+r`C5tW{BF1CJ<=f$Mt`r;{Fpy@{62^=_9>%SWq!Qyj8uskUDt7-LB3w^ zpw>tkMPR!Mjad$?jhr^56u721u{sTh`G{#7w`;h;%!Dcb@!8A6ofo%mt!4@mGB`3N z4xhcG)9%(<7IIKwnd5`)y@R8jTkDx9i;cBM)Y|d(ty>SW>fvcy#*s&iHXCQ-86U2( zWoUUX{n(kft)>XV`++oh6q2jl2xlXFxAXbxq{r6s8<5fI!lB}4A{b-UINB`|=g<|F z`15q#1qVh0KmhN6AK@sg@qQ=0v=U8jf%NHoeUrWK8CCH`EhK>Ow-}`aq8n@p7_ZDY z=X2%^@8Zbnn$4(Cb{lj~^MQS6R!i1q4~w`3OU!}WD0(QX^$TSo$r!b(k+n(^un8blBQbE{c${}8xy!Q6Yd7TmD>q+EUlH{f@B9wZR9vp#pcO)UQD2WJ zs5TUZ`E|y58E7p(`MJw()vZlaE|K_Q3$;+A;-n#TFuVsCA#MjAHAtBl&kDdfDR?rD z(34dz+M=2k$V}Cb7W(L;{!J;_0K4XL7SU zg06druICkBjo!P*X03^1DGiPw?ra@J8Xf;U>&u#Orb zE_dc~q-dlRSN)v*O9=**`uETSV?+EX5YG{4p^K#AXMUy0L50?Wq)GCv@!g2vk=;8L zCZ&7cDTub{@H`B|olmByZX1%_8^EQR|9yu1Q%*)aS!0M#)hV3FLZ_TgF*Vav*0n(^ z+2FkgOWYu)Sswac#s9=m6)a4og?2fn7D2yhTFnMNN6yN$FubU2L$x}!8V4#mo?CQm zi-JU{oz1Oe%31EBn3Pl6Xwex&FZ>oH9!EDX5rBa!%HSD*`MTaj)-#-&kr9(N)9bud;r`y zEfp+IR)Lw6;IW4BR z!tLyIHsz>eeSAg9!!g>7YATT{;%tOPKl@7L%O=Iz-1=#I>-F)Q!=0m6u#D!#ty>S) zm7gLR^s>{Pj7W~+9vY|}gD!xl&I4WH44*c;ty|4zFqRfPYdH`djV^N%&pAfLX^zw8 zX|jyVlgb*v4@?ZZm@quVI+%JZ4!>G|Ig*u*rr_kpmXMTV}()vov z=4=EQoE+``&(1N7pBryA|Eb?raR#O&7UaZ^SYXuGa@pfd9-tR<_MLAvdz86mclXKj zf}j$lc>`>$Izx$3sAOLkQ>s0-&>HwO&S>#9aPAc7xg{576miu6r8TfdtZOzP3?SIB z#GLZve(Ek&3$&6@s-ogHmTwO8GcLq8{TQZ}0~!GWwH|>uQjGO336}OP8OHTnWchJS z*U!VV={f6nor_t)5oQgBqnUvpf15JNj3gviha+-n>{pi<6fONr*HJNi&xt|(1sdBk zvmr=X7N{lFMz9tZoY7r>V;KrGR!m|USqpefK-vw!i;tcA4yLnr+4$gvcji;0Rlx~( z=e+r}tdD8v*D5OVI9m>v7W)(5@5+QldFC2pT?;M|tj(G?s?`#RiTCXY;a7kzFLKiJ zii0_zi0IKGOks@ZOwMK~!DkKl)}TeCYgIAa6wPx3el}>?_UE8h6|+{`INW#DMLNr; zPyq*@FxG^TgwgV$_c;P;yr|Ktv&+=p34+6KJ?aD6^~TbK29;&AYXiS4OZ_CqhIy!y z!V6p1N5{N=tt0wW&Q7nRPgZ1iP^qU^>gtA(p70V|w^h^EGw{Sj4M9B&>9Xn98OuCq zXUl6^OajJ1+mAPiF1b5Y%D(MKgmdPCl)tr!4KMSP7J|e3+q%kZ62N}5391@_Zi1sD4ZSX?={(T0~_-%n9 z=F7JO07K!dys1T;y*Nf=o4&!h007z=tBI=EBj5iw;IN5Mc$|R2bVNgMGLKWjL+1|u zxv&7K{QoK}Xy{)O7L$BDe^bDw8-K=>ErA{e#RGy;X*nMoT5ei?!2a=faX7|9|M8}A z(XSy4jyw<0m#DbN2OpaQpeooD?mLX)>wZ6RJm%M!$}~6{a8wd$1R7^pn?rXx8f62# z+c4dV6B|R5qJAN{-*n_2SOe-6U?bHnMSce=`eW zDG69twNExkZE!=BK@i0Rw#+@xJ3(+Y(_21fTI3Uk*EZ0f4R|6Vt4cc+92ngLEQ zr1_wz+j9ZjKV7%|=x*W5p6LN=RHQkhb@lf1{B#kV|KlP$>c=CBJ{6z!zMMGK6^7R; zVA-)=D~fj`xv$ZmjI5*7sc)3oJD+IB(g2ouq)+??asr)PoC9BbnInW%qWCUizN1|% zd$$~*`h|8d8cMMzB<@obCbe(syv6L96$M=knBn{eEp;Cn>Yk7qmBM3>_lxDVcR|MD zVG@@JLlU?|E5mqjLQx>cF5r>5rxO{$T=mu*eb}f z3oz1j|3?%Pi@CeVg2MX4BT^{DSzFn`z%_-XIk5do)@%f8*~l(YDM`993`0{+;l)bJ zWT8NGlhDA5VOUWt3DG;C==U?Zd_)`e)0_euxrsX8afe(_!|W6k-27R8SFiYO_?Fg+q>z1kG98_cMgtJk3gKiG6{~nC1}HGF6@lgIMwQ$vo?<5&#hD?eahy52-#iX&HY5wYDJpvb zVxhUtQi^ky#aVfp*yOUyf8G474_1A(bG!xr|Nh|F5&rzVhBnoiEVKIM{e$fvkB`>( zTen~_epO3ON<)!Px=s_sC`k4SO!|r3hk;!PB!{`OwV138{(nB|m2Z(wBBK4ebaKM( zrtG`=iOtQ&gHAU`n@css_?2B%sR-@v|3Ier7LM`LueN6n`h#9kX;qQeo!Ma`$PRQ0YyVTdlTtP*a$ z%D}+}G|U?*s_uGb-Km+Z`!8)gszQ)D(R4cbcv%UG76e|J`Y;aR z{$7{;O*+6Sr-B$wiZe{HSK%3|J6Kn0-LKQp@!{_N3y`_0%D%4%_0Bl2WM7j9tz+6g z8lR8&Xm>f@-T*_1qq~Ev(zsJLSii~Nm$W`WXg#H3r1o&6SO}Y3CPi1}sZXs5$WL+W z@aY2=unkUhw^!i6>yJoB9)JkzYQBwiPd(|NHdY3FidMcSE7<60f(O zJ%bfK!AeW)s$OZYMk$(Z@951_Y7Z*awTH217jEy>n>}g|D%G|(y1{&39q@diQeAuF z(TBy`dwuX1Y7Z*awbv`&FW%m>0gNwm(A^)YJ*ZUIUU8!aceTZ0PLs3Y<>D>A*?&b1 zLM3VMvyL~!xVA^xPi=XQnA7&C=bj@5v^@&>=Of<^e0R@rMcRHz-E#y(+b@lKUf36f zeS;Hidr0{jpLamx^)sK)%0+zoJU&IL|3;qa_15w6&f$LcYU_CWdpJ0LE92y@lDD^B zpS;zy$t^}}GZW?GtG>q{K@= zDu4%xgrV9NK3)|pq7e%W4}c+gulC5C>mXs5(d5kT7}ItF)%BNJC0hp~J6{4VOYbfp zpRih=wDGr*X~jDr1ZK&^Rlv{DTGA(?91@_irdjiQmt}bFMnA``4YlE5yA`?<_Bc2QqQBCjzqS^vEt*m_iK3+*oU*1hwpOw#q8>C!5)2x%`CIKFQ$WTV0{S zyA@J}Z$>+@R-(hoHtvm%o9*52+_{54*gFm*ZQdJu zT^&b@Li{rM2qM)iP6~%eq{xJGOw8c2Gr;_Oxt{}G_Lj`BH}2eNv?{To#`i_pVnS~< z-ZsMF+@nD>{syEE2CpsjM(W@+8eNFjPUBs}UNI~>mqllDS(N0Q1KpUZ$RL{pSQLd2 zpvaKp4V3TB^oFzGz!Mk6*mtm?5E!xN`5>%B?9yVs(5HCY z5Un~PbRw;I)@2IO9rz6+iN{?`Ho3ZmA^|ovI*m*-CKP37Fh1{~;?-tX;BsACt_z3L zAYHC!%k@AyouY!-&iFiCZeYvF98%@Rw%i!ckaW4ymMh1=gr&>PY&pK_O_uu* z!Vg8dWVtI_?rIKTe(?pHlF?O5iL2Zg4lv5gXH!~Kzkv<2FvSt2aA9ajRi(VNiCLx_fIoh2;hZJ{aF$=h4`HH`i^) z(o=H`3@n97=weN}F7bm{bPTQrFK<-btn^p(DArm7MI7Xx!A8}agaxZV_6m2<*OB5WpPt0-489`$u z-vWoNSF_=D*_}J5diK&LB{eDzAPP1aA;Kw!Oq3%Kf8#w7uZ@3(B9g!Tag?EyQ(SQ_ zWKGDPH1`kr@$xb^Mk(lYJKc9l41*kUzM0b&jX_Dwr*QN6@SP$p5^p6ppSrN2b}?N4 ztCRd{+_{cjTx9j<5o^H(FTaTy91Ec{Tt}6gWH=Q0WSU>{?h?2gs?x+Eq7`8wJ44W@ zU_fC!jy%TzaFdUcr-O+Rv7MBz$jNErd|FI3Vw>x$04BeckVg5?^kZn2_c4@jZqTNW zQB_K}#=<1Q3ltz+)Ye|n8#d(hLz4)KOt)snL+ba*$EHHGa4Aahp04o=^WzB20ZNpJ( z0UaRyz3+H3T;Q+HS-%6jujg*>T$8$WWhD1O0} zOC55!G#KwWQZ>M2D;AHknkm%?5VYm^g;y-H@*v)b4aEw&T&#=#G`cd` z2?D`z+33201I|JnA9$9K4|tAvCHX_4mU{icRP&Z>z#}rc5%;2KF3nO^Y>r$0E<<&I zXI|OdLhvWFt(ZSm)l)J&NoUr}%KY!M92nnHGs%$A97qyqag5^B+k5xFTYeWz%OR;i z$};Z?)>F4~!ddrZtPy~C+E%s-kk724E|2Gcf^P9cM$Qj680!8ou#%!}{b6e(9?U1t zbK(IY>%qN6MFT)vV0$3+9T55xkV^_IG&sPQNF_RkKdl^kn&%jTWc+1{e_4UgB{j@loo%+a=^V`*ONy_W0Vl9Q7yP+ZtF2!bdzN#hK z%U;>Rh9u(p9XO{c)K-s#)-%?1ka@&&Yy_nDyO^8!s$Pf;7KAvDoNt-#HSoeye|;DH zLIthZAa=XJkg>Nz1!H)xkuSkw`;CwLuo=66E~{?iegiMmhob~=@DpxKIs!}y-=r~r zWF2RZ02uLAdQOt;PleAr!ybBc*Dn#RIPJ9W+)i`FqjE`M$$ru@5A$QW9^R2cAp}OE zQKK1LaM3K+zrf1HtB0S;{)~$-%>Pl6+s822f%`$Z=0hi3pFJt4x$bMO8wqti(rvF< z?=Q7P#~>2uoBfd^#QI1G(!>)OO{=Qjb`d087>veXtzoLy*bRwA637IdN%veW0$>Wr z6P85}FKgGFeZXK{^-OEpjGDxfh{C>s2bRA1dk3gW8$TF4TCL0O*YP{_qpM0*e2AuF z{XRPKuUlOQeq=4M(6YO&u(t9T1HU`v1woZFLA0v8<_}DFd6OF}*ZkHi*D`)uMf}8N z2YYKGSVb-Fow6v8-H@d{%7}A{w;?D27R#98fZ4T`Y_}gqHBnV4hxma>6q}o?jkceC zs>u)Mqe0I5yp8MGJ;&-IQj_Bu+5)VsH1dY_=*^fAn|W7gFH{*A9*NaLk)&pvmQQkx zP`I9Z&;++9jtRp|{N^Z7OvmX)ko`x0E;L9S8jl=oSmtH*Ac?pu0L>FPHs+d)6*ttO z2E1Qb7iZ=PN)Z^C*=u+s9v0RuC@B-pwI3^tRt0-kWw%2*^aCyR%G*#Hf0qTd29X-F zaB4``YV_KpdNdzyt;R?$IX`bnY0bmjCdKw`qfYDPTMV30rP*d;z@nY@(yfP`KnpwC zh<4;_M8S9i1_)^pk4#Q+JYO8|7Qn{p-3yEW=VL5S*(utLj!yW3dB1jc7g5;V${=!9 zfgT4$5s*Vo)od$+>9m{}?^sDWR?SmRBLp^YZhHeobMEgk3cYI@(zYYThPm0<;|ij?7*J@))jaHTODPe*EngqDhK|HJskr;`iP8epNev*v9@ccQBs zfwaw;(kcVh1D86yk2>rL&?DD8yR?g>_mT5_5{u1D%3oLISXCBh&~_7Qv~c_yiu9*B(I&cADdp8uF4KNK~2bH+Kh*4##%L^Lmyz|@lQIlt8}hZ zwNf!~8{9C^OZ75yTvvV_%a3h934v)8aw-f{@c`Y{Fzg4Vkyk28HJ{K^dt1cF%3U@} zygjf^pX}v}+71`|Kv;4Tg@6W4&&@SM>8Rk^ve83K<|Z7DmV$Aj2%;iVQ9kz7XUh(KX2ehPd|us+ajIx9qu# za^1@bsepyhh*;R%kLPxM+_k4tT(T$qp*^Bw^W?@E=FgZ>@ocB1#rE^)&Lk6KJfXK*57q5_2Fz$BJOQLg!*RShc!FoH*CmvDrZ zEAI3sJ`>&{4}VF=`bLI7A8%?==avUwj8BYZl~v#|JD)2X0@ci&dRkt#vBfrZV~7Ca zc#c2txmyiS24s|3Q~=eE5dn@iT+nIW3aN9*O9s2=Q)=<%1+4nN!A3-Arkqwa?g3hj zI&lH5OCnhtwhNF#n*KJ9|&j8#oA=DcNG;P~mhI;&TKTgVHnf zJjx(OZ$pn)(O6axH+}wj+;hh>qc4Jgqk@oXL8*sNS3rl;_A~$%r#@%^4ZYLrog{=; z8#)NX0R48+KOz4{k)IvPi~eRW##>n5WPFbYJ`!X=jc+@xFZ!Kj%}~XQt+m;t1@!VJ9mtKoc2N2*wDefajZ)cer&a&)mH=e zy2Kz+NN46FY)M_WjE9Uc_>DV5(`Z5;L(_CR8K8JIYMFZon#NkAqMcE2aMiSC%uj}c z$D9g{z=#$$6IQ3&on6ibxSDU<6pyHr3d7)NzZwc>7=^+q z%#JbFpP!;BA8$R~+tK;58lS?{gn49Bs>0P^v>XN1T*Q!e+GmE=;bQPaY+ImIH$d-Q zORbyeREUN)2$E}^4mldxX$Z$&FWf|$&r2(Y%C~Zap-hM&;r(KT+)u((d{xm!EU!6A zYxhbRGb@buHpwqXl$q1z@xF%Cdv3~Y@2N4Li&;>aKA9T)AGPa(=HV&)CLCvqmBzfR$5Jo{b zJk&9ohjU`DWwxB2B~f*vx5&-bY!Zom`?VezUlX-7ffj>6nWs+73DtLtEAKwtPAcwD z#AU?y!i$E#MvW3;!=jS>rIIe-3|sgd%>%s31{fiWr&VF!$=oR+-wOC%jbcm%hu)Li zqm1KAxOI$4%Tj%t_=kUJQLQO^y{apSJiJNqVf1ax&yVmX>_bsv*iBpsG#abuP$M}3 zhjfn>CWgf~;RMvO-_n*472KifPA!>LD>@+R13UVoiim5>RT@*F`DbS(eyal9gK8Q6 z+VI3Spr{@KU6>JO_wlwCh&*;MpKd2rwZlrRW`J8cEv7SLZ|BwSpMG=9t}hU^O9;*L zgTq%_$6q4Wsf&$7Y7~ORI>7EKhwj-&|JA`Wmr;rWsuKM?d4Bi`UbemtqQyH1?Ykv8MWYJR#IJr1PcUt!}4t$SjDt7#K zh_M2jJs_BCtJ!x@TSq^pOj-Da?^g3hl<0rJM7hQJ8M#Y<2PH|62j=+6)fBC&Ae@j3tiiN0%*Kt&Z=nF4c`Py5FS85$-I|#kdSm zZ~}t?6okWD1wBN#J|3!MPzYNh9npWtmc4K0aVTn%3_D|do{=|ghp^wx&_^f^F?@yJ<yQ3-B+qTR@KDb1En$mhtk47<61kb=c`Kw4k@_MY1Nt>~ z8gmsGm!n?MFY*azo)#+JxO1n|_!|D*YOsqdI(4JmnfHR!Xq+}gL%f3!i$DJvF!4dw1p3p)@JelGa7|%M?;EyP**e)PP?L9hlq!nTudZa2DwAX_Y=ftwt)OmSXMp15$ff@Hs98FZ zrU4{5Wi8aBJe@$q0axI(6hc{UP$W8BSnk{TU?8~v-k@F2OWrHcgn#f+_)4#N+#uDi zGE6!`lOZ-33eSu3O^#T_TC#yXO|X2#b3mIz0t-~D4!TXwgOqr7^$KxB5hZKn_kV&< zqwVlz1^La&imtD&q*nA6ykHXy)(N8WrR0>SvaiTC3kRdx?=Y<|G6&E1wqDqbzV6wr zrRDqCf2=OqguXUUF>M_{>b%2lDAoR&u|uo@I7x4ayLz#}hbC`C??{Nt~G4So$9fx%hWJe0LoX5npP zS-A$2n?eo->HM0FuO>~5$nV+BkzLiDbP}Pba^=%E@>VTa#aCRLj-*S zj3ow~EHKOnup}V7z$rri;#LO{hNuX8n)Wm~8yu;0rP##x-rovHC%Vey#B52@j?RGS z=!cwh%Vdq_>es8Sh8%j8t3cXHa=z3vFoqWyRy_yAQVM%u#lThG^9NYR=yEu-VU6IW zIfnZ_o(eD@OKbU`;j9xzx_02(Ws3NgB_1zr}}H zkRM2|$L%cMjCA@mIPCalvmvad%CrA}lp7DH+AFO7}W~Vac#L^}!e6bQd7c$!Y}? z>Q7Kf;E}3&ER%;P7c^Y11R26mJ?PvvogjJj%stt`d2_tbz>ehzcapoHb7RVAPCZe` zIlXM~VnlSy;J{b4U(m^83qfSlC+mtO`ILr@4Z+h;BIk!S{-6^O*)E<@7maiyx z;VTV$f9sCQ>&M~vJbS`^)@VM}Ph}BUGC)QXGa^mjDuBJ$#Ih8@A7pw;h9PN%@p(IQ z2-gf3`#xuMuB0u-TBw<;l%~$;EhC}P;fyWYjsm+lhpS?UubxCOkNs%zT+N4+k;?Ch zaMSSn(EK%X9)q-pjP>>4(!Z0MWNLyzkK6Aq~7X{V%6!qS7Vb=;1l#QQ^+`F0k zcICeP6pcHp-IkbIBXwnR%=fhEcBNYex7NNy9#n|N0YwlIC z_-2c@NUj=_>S#C{3|dQS{ZK}sV(~+#f@M9FC1{k5jVw4(Sh-h?6&uD-TLjSKn*jFj z5n$3<*D&p&7-xwbj*D)Vt2q3l^xwmd?=KK*S8P z63PwdQBg;HCPd;uf>m9uanK0qn}frX#^F65c5n2td}2&(cd@=ic_{k4o zzjN0rc+`I*WnFqZ@}B&y)}LP>W$X6KuixzBpWmFVm2YQfq+jDKFk`v2uUyBz+1fk7 zK3{J=d-~tUJLXb0dUNa6>Xk{N`E_(DtE%nOV%V8{jC9+`=ll3-S$G=@{2rQf+*(qx+$U(&{inCKzu!7MdAfTn!znpgVQ6gK+<%&_HOf}d>-McC+eqy{WeZFW zDj>JZoq#De^^X1r1`Ab@jTgOyDJkX*S#NfE`7xUf#jz1>C5Ies5n+cHex;3p#AgE+ zS8XF_{>l{gdJCrAz*{^G#HtgUyK!Uhrn*oxA zEHNM$t_29AbLNnc3f*U{3&dfOdO^mW^+q!^qU~)cf3y(*vDgUs!Hw)wHrwFb$sQB7 z_I6+F-)fG4P0gnOTi0hhn;BaX8$}Ss&QAB@>)8v+)Qw6SN+)k@{lM`7d7z~hJM;9-9wLI%Or*ba~y?)zAg zU$F|9-nJa8$&2jxOzFAT4=k|t7RUHDM&`Yp%%zSrA%XB|=N{RJHSaZ>)HAAEmdQC@ z&T-Y>+2P@gJ2+z|$3Q;t6oGnwZhgI`hMb!0p6_5kUAtUlR^KV;T6>rgBZGk92%%*D z#ZCj~onesw%-jCSzFmoykJo@L&6+}u?wv<*JF9C##+~exkLgOOK(Fs3BYLYyDE7ph zrf5h6j~@G|o>dO*TqAqJka6-fiRPVNOH<#`aLerNTKi7#-8?5x_@JGr@80rPHrHv%+cpHcV{bDdslTLoyV1rJ(;7a;o)gBZG~A>+AHZb=XSSSE1jw&M-Ydv2XGf znbO;uy=qP72}~`1U~3homZ5x2zjyp_5%OEra`mZE;Czi{O@fV-}mY65|?#h5-%}-RA zB3tq&(~9GuY=I04RMKHThKC^`UP~m+eo`s5nkcndDU~AX)p}oXJwxYHi>|UpnAF=T zK2m37aO3naN4w}YTy$W6xQOWPeTY>$aY2^+6N&zK{wG%?Zb@k3VJ$ zosT8gLXM$7gQ>Yr+cHa)oX`lB)`MKkg#C4_lpkxeq0884tuU%9kN45*vJPp1IYc1>Mx%VQ1#>Ey2VwyarpR-LegV$yi@ffZou zMz>!FL7_;U@}i8yT5QZWrALQ_gBu1NqD_bV(Fj}N?}*gFB3MfI8r3i=RyC9k30dL0 zeohP_l)Yh;VnmRR$vzfC4m1jokJ(zil%x+OW{b#&h9PI6j3hFpBwme&Iu993TQh7> zBJ1;9?@wV?%kVWHmO{(K9-$Ao1oD1~%FO2JN5^cF@6CtNY=A)w`KqH;jlAEX+w-ay z336R;RL3){Au?7YB@TX$uncpt+P&W1HJ~ZvmdEaOdZd1rt!9rHSaLtee0~!#^wo9{ zmm~cZt#k#EyD$*kz@kVN`#0>p9Y;o* zuO0}oSO;aYlsHB&$?5SqB4&f!JqN5&95>V)UsJe#Ss_M5wE%;M%gao2m6@jo(LD_Ga;l}!R5TYk+f!ZLC|7nFCcnw(FH`zj8_@> zAdCFg(MoGc;59IGBYy6}HQ^Q7&_s;B>`X2=EfjkanSgax?`cCgTw|a|;BgiJUU$f- zqemC7XoaZ~zOH!}coWaaWp|lRksppR<3>D;0At+Ic%R9GMI3zx$n(VEPQ{+Da-F6` z)bhhhSO8jT^qbJ$h(v=@vCHqAx*Krp!A-5WD0&gj{BcZKb07Mab9+QK2DUR`WPCP?DdHAj71WjK6BFvFg(!lTJa`pyr0=3$DV#YY>7knskOs5Io{#@vG9BOR*XDZni1l z-w@=hivgRIR|@TIaq2cx7cXx_I@WvD8kV_8HI7PJi?-_xTvfYfv4m`r-jf;*DIYVc zOg!t4<3x0d@L&~-5Oqwu+c%wCP?~{MtRCD^crAn(OfJyotWyQDxvTAGb8Pp12XPw2 ztP=HDEVtukbn=AoSTw4?L-~eK#$H?=b-HpU>Q=SosyZqz7-_%iu9&il%Sk1nI%KAH zShJqKs?8i;NQm?*3_I3dN`NPbqbFXHKJrjy#y;)<MoMd3-GkmXcXmy&u(FMQNUivg$m zAr^?$#fyMM#|0Udo_>t(3@YREP=8DgEMlU=v#TAPtfJGAjabXOl#4!jR0jv&$Jq>l;OC&8#_| zjK-a_j#FjRdk#2-Eu0r;c-@BPvls=&56I}s=P1fKe=>K@nLV-WY=~)71q7t?$z8@z z(ur$|hz|PnvocGbay)I=_WoQfR3 zu$7iDbQxlrDVZ<(%Sl!incCG1b!(K4B(K&Fb)m&LPA9@b)A{iTj-e<}}p zaYfAXRmT8Qj)b1AKORxyokh}^^?WweFet2dIN$@PG@5FAmSJC*zPCqhE){IZ=yMo} z(WE2}lAE`G1M>g_xGCG9f=s0F=IH^LsLAy-*Ct_E~r{hDSDIoT&7y?$in^!689Ne6>;pE zGs}IP#ReO)1$|f3kKRm&8Y@k$z!j)%tis05Y60a9-wHW}l{GBvFE(1Ik4&l`{|#ea zaGXx5S5e~q|0Y~TJyvPdP}F!#H`MDSWcti2!WQ2v!QDWeeoZNplOJ&V&m~6JPFm<* zEaeLkLk)$eUsXlM^%{{hd_+azhcR#RJW5tT;n7n=mFcrI8{)lcdG7TtHs0|sjfDYI z4-uau(?SJ<&8pSTU&B;}*Jw5ZZG=;GB$N}w8>=SVu&E1>+Vm8+wLHbI^0YU*9LrPuDo-(cvOLAF z`jmzJwu$>AZ#c#1lI9xKr{(NaO5;~~3dkT2;hR1~doz8C-{rYBTWZ#4c|OT?(D2PY zLto+CJ*Qvt&JV6E&|#Q=090^k^SA(3!fZREUa2M-dzgF|6GxTF zVoF%uUiX0xmX=i5Qio7S-L$mJ3AC(veera&i2?_l{nyPVC=4&8EQaf!JK@;P9e&hS!80?Vy~aXyTOg36D* zH(Rd`o}FyH-qra2BPe(x1?%jI7z z&tC2PEBaW4&$kaB;@@@nAO2nY<2S4H96#&pfBeJR!`1Z%-+l|v;r-hB+Jn_UWUK#* z!Ni{#W}VKmKMczs&!^&uvO{0RKZZ1R(-SFN3^;YGXK7*S^VK0ese1 z*Vk5V-+oSxlK`>7fZc8J2l{QJy8y5vMK>Q(pimNe$$R2NfAqjd&n_X+5-P3p>{qy_h_s{R2-#@>9e*gUb`Tg_z=l9R= gpWi>fe}4b`{`vj$`{(!1|IyF?7Xet01puHF0N{(J0{{R3 literal 0 HcmV?d00001