From 0538a0b9087164db5bffcb2f74c8d7858cd9d98b Mon Sep 17 00:00:00 2001 From: Walter Schell Date: Sun, 30 Apr 2023 10:33:16 -0400 Subject: [PATCH] Added 5.4.5 sources and extracted --- lua-5.4.5/Makefile | 106 + lua-5.4.5/README | 6 + lua-5.4.5/doc/contents.html | 678 ++ lua-5.4.5/doc/index.css | 21 + lua-5.4.5/doc/logo.gif | Bin 0 -> 9893 bytes lua-5.4.5/doc/lua.1 | 155 + lua-5.4.5/doc/lua.css | 161 + lua-5.4.5/doc/luac.1 | 118 + lua-5.4.5/doc/manual.css | 21 + lua-5.4.5/doc/manual.html | 12030 ++++++++++++++++++++++++ lua-5.4.5/doc/osi-certified-72x60.png | Bin 0 -> 3774 bytes lua-5.4.5/doc/readme.html | 337 + lua-5.4.5/src/Makefile | 225 + lua-5.4.5/src/lapi.c | 1463 +++ lua-5.4.5/src/lapi.h | 52 + lua-5.4.5/src/lauxlib.c | 1112 +++ lua-5.4.5/src/lauxlib.h | 301 + lua-5.4.5/src/lbaselib.c | 549 ++ lua-5.4.5/src/lcode.c | 1871 ++++ lua-5.4.5/src/lcode.h | 104 + lua-5.4.5/src/lcorolib.c | 210 + lua-5.4.5/src/lctype.c | 64 + lua-5.4.5/src/lctype.h | 101 + lua-5.4.5/src/ldblib.c | 483 + lua-5.4.5/src/ldebug.c | 924 ++ lua-5.4.5/src/ldebug.h | 63 + lua-5.4.5/src/ldo.c | 1024 ++ lua-5.4.5/src/ldo.h | 88 + lua-5.4.5/src/ldump.c | 230 + lua-5.4.5/src/lfunc.c | 294 + lua-5.4.5/src/lfunc.h | 64 + lua-5.4.5/src/lgc.c | 1739 ++++ lua-5.4.5/src/lgc.h | 202 + lua-5.4.5/src/linit.c | 65 + lua-5.4.5/src/liolib.c | 828 ++ lua-5.4.5/src/ljumptab.h | 112 + lua-5.4.5/src/llex.c | 581 ++ lua-5.4.5/src/llex.h | 91 + lua-5.4.5/src/llimits.h | 380 + lua-5.4.5/src/lmathlib.c | 764 ++ lua-5.4.5/src/lmem.c | 215 + lua-5.4.5/src/lmem.h | 93 + lua-5.4.5/src/loadlib.c | 767 ++ lua-5.4.5/src/lobject.c | 602 ++ lua-5.4.5/src/lobject.h | 815 ++ lua-5.4.5/src/lopcodes.c | 104 + lua-5.4.5/src/lopcodes.h | 405 + lua-5.4.5/src/lopnames.h | 103 + lua-5.4.5/src/loslib.c | 428 + lua-5.4.5/src/lparser.c | 1967 ++++ lua-5.4.5/src/lparser.h | 171 + lua-5.4.5/src/lprefix.h | 45 + lua-5.4.5/src/lstate.c | 437 + lua-5.4.5/src/lstate.h | 409 + lua-5.4.5/src/lstring.c | 273 + lua-5.4.5/src/lstring.h | 57 + lua-5.4.5/src/lstrlib.c | 1874 ++++ lua-5.4.5/src/ltable.c | 980 ++ lua-5.4.5/src/ltable.h | 65 + lua-5.4.5/src/ltablib.c | 430 + lua-5.4.5/src/ltm.c | 271 + lua-5.4.5/src/ltm.h | 104 + lua-5.4.5/src/lua.c | 679 ++ lua-5.4.5/src/lua.h | 522 + lua-5.4.5/src/lua.hpp | 9 + lua-5.4.5/src/luac.c | 723 ++ lua-5.4.5/src/luaconf.h | 793 ++ lua-5.4.5/src/lualib.h | 52 + lua-5.4.5/src/lundump.c | 335 + lua-5.4.5/src/lundump.h | 36 + lua-5.4.5/src/lutf8lib.c | 291 + lua-5.4.5/src/lvm.c | 1901 ++++ lua-5.4.5/src/lvm.h | 141 + lua-5.4.5/src/lzio.c | 68 + lua-5.4.5/src/lzio.h | 66 + orig_sources/lua-5.4.5.tar.gz | Bin 0 -> 363316 bytes 76 files changed, 43848 insertions(+) create mode 100644 lua-5.4.5/Makefile create mode 100644 lua-5.4.5/README create mode 100644 lua-5.4.5/doc/contents.html create mode 100644 lua-5.4.5/doc/index.css create mode 100644 lua-5.4.5/doc/logo.gif create mode 100644 lua-5.4.5/doc/lua.1 create mode 100644 lua-5.4.5/doc/lua.css create mode 100644 lua-5.4.5/doc/luac.1 create mode 100644 lua-5.4.5/doc/manual.css create mode 100644 lua-5.4.5/doc/manual.html create mode 100644 lua-5.4.5/doc/osi-certified-72x60.png create mode 100644 lua-5.4.5/doc/readme.html create mode 100644 lua-5.4.5/src/Makefile create mode 100644 lua-5.4.5/src/lapi.c create mode 100644 lua-5.4.5/src/lapi.h create mode 100644 lua-5.4.5/src/lauxlib.c create mode 100644 lua-5.4.5/src/lauxlib.h create mode 100644 lua-5.4.5/src/lbaselib.c create mode 100644 lua-5.4.5/src/lcode.c create mode 100644 lua-5.4.5/src/lcode.h create mode 100644 lua-5.4.5/src/lcorolib.c create mode 100644 lua-5.4.5/src/lctype.c create mode 100644 lua-5.4.5/src/lctype.h create mode 100644 lua-5.4.5/src/ldblib.c create mode 100644 lua-5.4.5/src/ldebug.c create mode 100644 lua-5.4.5/src/ldebug.h create mode 100644 lua-5.4.5/src/ldo.c create mode 100644 lua-5.4.5/src/ldo.h create mode 100644 lua-5.4.5/src/ldump.c create mode 100644 lua-5.4.5/src/lfunc.c create mode 100644 lua-5.4.5/src/lfunc.h create mode 100644 lua-5.4.5/src/lgc.c create mode 100644 lua-5.4.5/src/lgc.h create mode 100644 lua-5.4.5/src/linit.c create mode 100644 lua-5.4.5/src/liolib.c create mode 100644 lua-5.4.5/src/ljumptab.h create mode 100644 lua-5.4.5/src/llex.c create mode 100644 lua-5.4.5/src/llex.h create mode 100644 lua-5.4.5/src/llimits.h create mode 100644 lua-5.4.5/src/lmathlib.c create mode 100644 lua-5.4.5/src/lmem.c create mode 100644 lua-5.4.5/src/lmem.h create mode 100644 lua-5.4.5/src/loadlib.c create mode 100644 lua-5.4.5/src/lobject.c create mode 100644 lua-5.4.5/src/lobject.h create mode 100644 lua-5.4.5/src/lopcodes.c create mode 100644 lua-5.4.5/src/lopcodes.h create mode 100644 lua-5.4.5/src/lopnames.h create mode 100644 lua-5.4.5/src/loslib.c create mode 100644 lua-5.4.5/src/lparser.c create mode 100644 lua-5.4.5/src/lparser.h create mode 100644 lua-5.4.5/src/lprefix.h create mode 100644 lua-5.4.5/src/lstate.c create mode 100644 lua-5.4.5/src/lstate.h create mode 100644 lua-5.4.5/src/lstring.c create mode 100644 lua-5.4.5/src/lstring.h create mode 100644 lua-5.4.5/src/lstrlib.c create mode 100644 lua-5.4.5/src/ltable.c create mode 100644 lua-5.4.5/src/ltable.h create mode 100644 lua-5.4.5/src/ltablib.c create mode 100644 lua-5.4.5/src/ltm.c create mode 100644 lua-5.4.5/src/ltm.h create mode 100644 lua-5.4.5/src/lua.c create mode 100644 lua-5.4.5/src/lua.h create mode 100644 lua-5.4.5/src/lua.hpp create mode 100644 lua-5.4.5/src/luac.c create mode 100644 lua-5.4.5/src/luaconf.h create mode 100644 lua-5.4.5/src/lualib.h create mode 100644 lua-5.4.5/src/lundump.c create mode 100644 lua-5.4.5/src/lundump.h create mode 100644 lua-5.4.5/src/lutf8lib.c create mode 100644 lua-5.4.5/src/lvm.c create mode 100644 lua-5.4.5/src/lvm.h create mode 100644 lua-5.4.5/src/lzio.c create mode 100644 lua-5.4.5/src/lzio.h create mode 100644 orig_sources/lua-5.4.5.tar.gz diff --git a/lua-5.4.5/Makefile b/lua-5.4.5/Makefile new file mode 100644 index 0000000..a26e3d8 --- /dev/null +++ b/lua-5.4.5/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 ios 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.5 + +# 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.5/README b/lua-5.4.5/README new file mode 100644 index 0000000..f0aa064 --- /dev/null +++ b/lua-5.4.5/README @@ -0,0 +1,6 @@ + +This is Lua 5.4.5, released on 18 Apr 2023. + +For installation instructions, license details, and +further information about Lua, see doc/readme.html. + diff --git a/lua-5.4.5/doc/contents.html b/lua-5.4.5/doc/contents.html new file mode 100644 index 0000000..1231e6d --- /dev/null +++ b/lua-5.4.5/doc/contents.html @@ -0,0 +1,678 @@ + + + +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–2023 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
+LUA_LOADED_TABLE
+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_PRELOAD_TABLE
+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
+LUAL_BUFFERSIZE
+ +

+ +

+Last update: +Sat Apr 1 17:57:05 UTC 2023 +

+ + + + diff --git a/lua-5.4.5/doc/index.css b/lua-5.4.5/doc/index.css new file mode 100644 index 0000000..c961835 --- /dev/null +++ b/lua-5.4.5/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.5/doc/logo.gif b/lua-5.4.5/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.5/doc/lua.1 b/lua-5.4.5/doc/lua.1 new file mode 100644 index 0000000..3f472fd --- /dev/null +++ b/lua-5.4.5/doc/lua.1 @@ -0,0 +1,155 @@ +.\" $Id: lua.man,v 1.14 2022/09/23 09:06:36 lhf Exp $ +.TH LUA 1 "$Date: 2022/09/23 09:06:36 $" +.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 " mod" +require library +.I mod +into global +.IR mod . +.TP +.BI \-l " g=mod" +require library +.I mod +into global +.IR g . +.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.5/doc/lua.css b/lua-5.4.5/doc/lua.css new file mode 100644 index 0000000..cbd0799 --- /dev/null +++ b/lua-5.4.5/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.5/doc/luac.1 b/lua-5.4.5/doc/luac.1 new file mode 100644 index 0000000..33a4ed0 --- /dev/null +++ b/lua-5.4.5/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.5/doc/manual.css b/lua-5.4.5/doc/manual.css new file mode 100644 index 0000000..aa0e677 --- /dev/null +++ b/lua-5.4.5/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.5/doc/manual.html b/lua-5.4.5/doc/manual.html new file mode 100644 index 0000000..9e763a4 --- /dev/null +++ b/lua-5.4.5/doc/manual.html @@ -0,0 +1,12030 @@ + + + +Lua 5.4 Reference Manual + + + + + + + +

+Lua +Lua 5.4 Reference Manual +

+ +

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

+ +Copyright © 2020–2023 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 nor run the garbage collector. +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' and written in decimal. +(For instance, 0x1.fp10 denotes 1984, +which is 0x1f / 16 multiplied by 210.) + + +

+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 (see §3.4.12). + + +

+If a variable is both assigned and read +inside a multiple assignment, +Lua ensures that all reads get the value of the variable +before the assignment. +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. + + +

+Note that this guarantee covers only accesses +syntactically inside the assignment statement. +If a function or a metamethod called during the assignment +changes the value of a variable, +Lua gives no guarantees about the order of that access. + + +

+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. + + +

+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 variadic 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). + + + + + +

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. + + +

+It is always a good practice not to rely on the +implicit coercions from strings to numbers, +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 non-negative integer +that satisfies the following condition: + +

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

+In words, +a border is any positive integer index present in the table +that is followed by an absent index, +plus two limit cases: +zero, when index 1 is absent; +and the maximum value for an integer, when that index is present. +Note that keys that are not positive integers +do not interfere with borders. + + +

+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), +so it is not a sequence, too. +The table {} is a sequence with border 0. + + +

+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 integer 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 multires expression, +then all values returned by this expression enter the list consecutively +(see §3.4.12). + + +

+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 (see §3.4.12), +unless the function is a variadic function, +which is indicated by three dots ('...') +at the end of its parameter list. +A variadic 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 (see §3.4.12). + + +

+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.4.12 – Lists of expressions, multiple results, +and adjustment

+ +

+Both function calls and vararg expressions can result in multiple values. +These expressions are called multires expressions. + + +

+When a multires expression is used as the last element +of a list of expressions, +all results from the expression are added to the +list of values produced by the list of expressions. +Note that a single expression +in a place that expects a list of expressions +is the last expression in that (singleton) list. + + +

+These are the places where Lua expects a list of expressions: + +

    + +
  • A return statement, +for instance return e1, e2, e3 (see §3.3.4).
    • + +
  • A table constructor, +for instance {e1, e2, e3} (see §3.4.9).
    • + +
  • The arguments of a function call, +for instance foo(e1, e2, e3) (see §3.4.10).
    • + +
  • A multiple assignment, +for instance a , b, c = e1, e2, e3 (see §3.3.3).
    • + +
  • A local declaration, +for instance local a , b, c = e1, e2, e3 (see §3.3.7).
    • + +
  • The initial values in a generic for loop, +for instance for k in e1, e2, e3 do ... end (see §3.3.5).
    • + +

+In the last four cases, +the list of values from the list of expressions +must be adjusted to a specific length: +the number of parameters in a call to a non-variadic function +(see §3.4.11), +the number of variables in a multiple assignment or +a local declaration, +and exactly four values for a generic for loop. +The adjustment follows these rules: +If there are more values than needed, +the extra values are thrown away; +if there are fewer values than needed, +the list is extended with nil's. +When the list of expressions ends with a multires expression, +all results from that expression enter the list of values +before the adjustment. + + +

+When a multires expression is used +in a list of expressions without being the last element, +or in a place where the syntax expects a single expression, +Lua adjusts the result list of that expression to one element. +As a particular case, +the syntax expects a single expression inside a parenthesized expression; +therefore, adding parentheses around a multires expression +forces it to produce exactly one result. + + +

+We seldom need to use a vararg expression in a place +where the syntax expects a single expression. +(Usually it is simpler to add a regular parameter before +the variadic part and use that parameter.) +When there is such a need, +we recommend assigning the vararg expression +to a single variable and using that variable +in its place. + + +

+Here are some examples of uses of mutlres expressions. +In all cases, when the construction needs +"the n-th result" and there is no such result, +it uses a nil. + +

+     print(x, f())      -- prints x and all results from f().
+     print(x, (f()))    -- prints x and the first result from f().
+     print(f(), x)      -- prints the first result from f() and x.
+     print(1 + f())     -- prints 1 added to the first result from f().
+     local x = ...      -- x gets the first vararg argument.
+     x,y = ...          -- x gets the first vararg argument,
+                        -- y gets the second vararg argument.
+     x,y,z = w, f()     -- x gets w, y gets the first result from f(),
+                        -- z gets the second result from f().
+     x,y,z = f()        -- x gets the first result from f(),
+                        -- y gets the second result from f(),
+                        -- z gets the third result from f().
+     x,y,z = f(), g()   -- x gets the first result from f(),
+                        -- y gets the first result from g(),
+                        -- z gets the second result from g().
+     x,y,z = (f())      -- x gets the first result from f(), y and z get nil.
+     return f()         -- returns all results from f().
+     return x, ...      -- returns x and 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(), 5}           -- creates a list with the first result from f() and 5.
+
+ + + + + + +

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. +(Void statements are labels and empty statements.) +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 ISO 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. + + +

+(This function was introduced in release 5.4.3.) + + + + + +

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. + + +

+This function should not be called by a finalizer. + + + + + +

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). +The value at index must be a table. + + + + + +

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). +The value at index must be a table. + + + + + +

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, lua_State *from);
+ +

+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. + + +

+The parameter from represents the coroutine that is resetting L. +If there is no such coroutine, +this parameter can be NULL. +(This parameter was introduced in release 5.4.5.) + + + + + +

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 with an appropriate parameter. +(Specifically, to get a field, +you must add the letter between parentheses in the field's comment +to the parameter what of 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 variadic 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. +(These characters are also documented in the declaration of +the structure lua_Debug, +between parentheses in the comments following each field.) + +

    + +
  • 'f': +pushes onto the stack the function that is +running at the given level; +
    • + +
  • 'l': fills in the field currentline; +
    • + +
  • 'n': fills in the fields name and namewhat; +
    • + +
  • 'r': fills in the fields ftransfer and ntransfer; +
    • + +
  • 'S': +fills in the fields source, short_src, +linedefined, lastlinedefined, and what; +
    • + +
  • 't': fills in the field istailcall; +
    • + +
  • 'u': fills in the fields +nups, nparams, and isvararg; +
    • + +
  • 'L': +pushes onto the stack a table whose indices are +the lines on the function with some associated code, +that is, the lines where you can put a break point. +(Lines with no code 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

+[-?, +?, 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

+[-?, +?, 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, +?, –] +

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

+[-?, +?, –] +

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

+Removes n bytes from 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 0 (LUA_OK) if there are no errors, +or 1 in case of errors. + + + + + +

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 0 (LUA_OK) if there are no errors, +or 1 in case of errors. + + + + + +

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 ISO 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. + + +

+A function with a NULL value represents a placeholder, +which is filled with false. + + + + + +

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] +

int 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. + + +

+This function should not be called by a finalizer. + + + + +

+

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.) + + +

+You should not assign any value to a non-existent field in a table +during its traversal. +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. +The real table is stored in the C registry (see §4.3), +indexed by the key LUA_LOADED_TABLE, a string. + + + + +

+

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 functionality is not supported by ISO 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. +The real table is stored in the C registry (see §4.3), +indexed by the key LUA_PRELOAD_TABLE, a string. + + + + +

+

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 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 +F, n, *, h, L, and l are not supported +and that there is an extra specifier, q. +Both width and precision, when present, +are limited to two digits. + + +

+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, precision). + + +

+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 length 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), +using 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, +the function closes the Lua state before exiting (see lua_close). + + + + +

+

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;
    • +
  • -l g=mod: "require" mod and assign the + result to global g;
    • +
  • -v: print version information;
    • +
  • -E: ignore environment variables;
    • +
  • -W: turn warnings on;
    • +
  • --: stop handling options;
    • +
  • -: execute stdin as a file and stop handling options.
    • +

+(The form -l g=mod was introduced in release 5.4.4.) + + +

+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 variadic 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: +Tue Apr 18 12:51:25 UTC 2023 +

+ + + + diff --git a/lua-5.4.5/doc/osi-certified-72x60.png b/lua-5.4.5/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. + +

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.5. +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 ios 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–2023 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: +Mon Mar 27 21:22:06 UTC 2023 +

+ + + + diff --git a/lua-5.4.5/src/Makefile b/lua-5.4.5/src/Makefile new file mode 100644 index 0000000..b771196 --- /dev/null +++ b/lua-5.4.5/src/Makefile @@ -0,0 +1,225 @@ +# 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 ios 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= $(LDFLAGS)" + @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) + +ios: + $(MAKE) $(ALL) SYSCFLAGS="-DLUA_USE_IOS" + +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.5/src/lapi.c b/lua-5.4.5/src/lapi.c new file mode 100644 index 0000000..34e64af --- /dev/null +++ b/lua-5.4.5/src/lapi.c @@ -0,0 +1,1463 @@ +/* +** $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) + + +/* +** Convert an acceptable index to a pointer to its respective value. +** Non-valid indices return the special nil value 'G(L)->nilvalue'. +*/ +static TValue *index2value (lua_State *L, int idx) { + CallInfo *ci = L->ci; + if (idx > 0) { + StkId o = ci->func.p + idx; + api_check(L, idx <= ci->top.p - (ci->func.p + 1), "unacceptable index"); + if (o >= L->top.p) return &G(L)->nilvalue; + else return s2v(o); + } + else if (!ispseudo(idx)) { /* negative index */ + api_check(L, idx != 0 && -idx <= L->top.p - (ci->func.p + 1), + "invalid index"); + return s2v(L->top.p + 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 (ttisCclosure(s2v(ci->func.p))) { /* C closure? */ + CClosure *func = clCvalue(s2v(ci->func.p)); + return (idx <= func->nupvalues) ? &func->upvalue[idx-1] + : &G(L)->nilvalue; + } + else { /* light C function or Lua function (through a hook)?) */ + api_check(L, ttislcf(s2v(ci->func.p)), "caller not a C function"); + return &G(L)->nilvalue; /* no upvalues */ + } + } +} + + + +/* +** Convert a valid actual index (not a pseudo-index) to its address. +*/ +l_sinline StkId index2stack (lua_State *L, int idx) { + CallInfo *ci = L->ci; + if (idx > 0) { + StkId o = ci->func.p + idx; + api_check(L, o < L->top.p, "invalid index"); + return o; + } + else { /* non-positive index */ + api_check(L, idx != 0 && -idx <= L->top.p - (ci->func.p + 1), + "invalid index"); + api_check(L, !ispseudo(idx), "invalid index"); + return L->top.p + 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.p - L->top.p > n) /* stack large enough? */ + res = 1; /* yes; check is OK */ + else /* need to grow stack */ + res = luaD_growstack(L, n, 0); + if (res && ci->top.p < L->top.p + n) + ci->top.p = L->top.p + 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.p - to->top.p >= n, "stack overflow"); + from->top.p -= n; + for (i = 0; i < n; i++) { + setobjs2s(to, to->top.p, from->top.p + i); + to->top.p++; /* 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.p - L->ci->func.p) + idx; +} + + +LUA_API int lua_gettop (lua_State *L) { + return cast_int(L->top.p - (L->ci->func.p + 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.p; + if (idx >= 0) { + api_check(L, idx <= ci->top.p - (func + 1), "new top too large"); + diff = ((func + 1) + idx) - L->top.p; + for (; diff > 0; diff--) + setnilvalue(s2v(L->top.p++)); /* clear new slots */ + } + else { + api_check(L, -(idx+1) <= (L->top.p - (func + 1)), "invalid new top"); + diff = idx + 1; /* will "subtract" index (as it is negative) */ + } + api_check(L, L->tbclist.p < L->top.p, "previous pop of an unclosed slot"); + newtop = L->top.p + diff; + if (diff < 0 && L->tbclist.p >= newtop) { + lua_assert(hastocloseCfunc(ci->nresults)); + newtop = luaF_close(L, newtop, CLOSEKTOP, 0); + } + L->top.p = 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.p == level, + "no variable to close at given level"); + level = luaF_close(L, level, CLOSEKTOP, 0); + 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.) +*/ +l_sinline 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.p - 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.p)), 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.p, 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.p, L->top.p - 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.p - 2), s2v(L->top.p - 1), L->top.p - 2); + L->top.p--; /* 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.p)); + 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 */ +} + + +l_sinline 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.p)); + 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.p), 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.p), 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.p, 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.p)); + else { + TString *ts; + ts = luaS_new(L, s); + setsvalue2s(L, L->top.p, 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.p), 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.p -= n; + while (n--) { + setobj2n(L, &cl->upvalue[n], s2v(L->top.p + n)); + /* does not need barrier because closure is white */ + lua_assert(iswhite(cl)); + } + setclCvalue(L, s2v(L->top.p), 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.p)); + else + setbfvalue(s2v(L->top.p)); + 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), p); + api_incr_top(L); + lua_unlock(L); +} + + +LUA_API int lua_pushthread (lua_State *L) { + lua_lock(L); + setthvalue(L, s2v(L->top.p), L); + api_incr_top(L); + lua_unlock(L); + return (G(L)->mainthread == L); +} + + + +/* +** get functions (Lua -> stack) +*/ + + +l_sinline 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.p, slot); + api_incr_top(L); + } + else { + setsvalue2s(L, L->top.p, str); + api_incr_top(L); + luaV_finishget(L, t, s2v(L->top.p - 1), L->top.p - 1, slot); + } + lua_unlock(L); + return ttype(s2v(L->top.p - 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.p - 1), slot, luaH_get)) { + setobj2s(L, L->top.p - 1, slot); + } + else + luaV_finishget(L, t, s2v(L->top.p - 1), L->top.p - 1, slot); + lua_unlock(L); + return ttype(s2v(L->top.p - 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.p, slot); + } + else { + TValue aux; + setivalue(&aux, n); + luaV_finishget(L, t, &aux, L->top.p, slot); + } + api_incr_top(L); + lua_unlock(L); + return ttype(s2v(L->top.p - 1)); +} + + +l_sinline int finishrawget (lua_State *L, const TValue *val) { + if (isempty(val)) /* avoid copying empty items to the stack */ + setnilvalue(s2v(L->top.p)); + else + setobj2s(L, L->top.p, val); + api_incr_top(L); + lua_unlock(L); + return ttype(s2v(L->top.p - 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.p - 1)); + L->top.p--; /* 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.p, 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.p, 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.p)); + t = LUA_TNONE; + } + else { + setobj2s(L, L->top.p, &uvalue(o)->uv[n - 1].uv); + t = ttype(s2v(L->top.p)); + } + 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.p - 1)); + L->top.p--; /* pop value */ + } + else { + setsvalue2s(L, L->top.p, str); /* push 'str' (to make it a TValue) */ + api_incr_top(L); + luaV_finishset(L, t, s2v(L->top.p - 1), s2v(L->top.p - 2), slot); + L->top.p -= 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.p - 2), slot, luaH_get)) { + luaV_finishfastset(L, t, slot, s2v(L->top.p - 1)); + } + else + luaV_finishset(L, t, s2v(L->top.p - 2), s2v(L->top.p - 1), slot); + L->top.p -= 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.p - 1)); + } + else { + TValue aux; + setivalue(&aux, n); + luaV_finishset(L, t, &aux, s2v(L->top.p - 1), slot); + } + L->top.p--; /* 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.p - 1)); + invalidateTMcache(t); + luaC_barrierback(L, obj2gco(t), s2v(L->top.p - 1)); + L->top.p -= n; + lua_unlock(L); +} + + +LUA_API void lua_rawset (lua_State *L, int idx) { + aux_rawset(L, idx, s2v(L->top.p - 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.p - 1)); + luaC_barrierback(L, obj2gco(t), s2v(L->top.p - 1)); + L->top.p--; + 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.p - 1))) + mt = NULL; + else { + api_check(L, ttistable(s2v(L->top.p - 1)), "table expected"); + mt = hvalue(s2v(L->top.p - 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.p--; + 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.p - 1)); + luaC_barrierback(L, gcvalue(o), s2v(L->top.p - 1)); + res = 1; + } + L->top.p--; + 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.p - L->top.p >= (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.p - (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.p - (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.p - 1)); /* get new 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.p, 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.p - 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 = G(L); + if (g->gcstp & GCSTPGC) /* internal stop? */ + return -1; /* all options are invalid when stopped */ + lua_lock(L); + va_start(argp, what); + switch (what) { + case LUA_GCSTOP: { + g->gcstp = GCSTPUSR; /* stopped by the user */ + break; + } + case LUA_GCRESTART: { + luaE_setdebt(g, 0); + g->gcstp = 0; /* (GCSTPGC must be already zero here) */ + 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 oldstp = g->gcstp; + g->gcstp = 0; /* allow GC to run (GCSTPGC must be zero here) */ + 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->gcstp = oldstp; /* 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 = gcrunning(g); + 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.p - 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.p - 1); + if (more) { + api_incr_top(L); + } + else /* no more elements */ + L->top.p -= 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.p < 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.p, 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.p, 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.p), 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.p; + 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.p, 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.p--; + setobj(L, val, s2v(L->top.p)); + 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.5/src/lapi.h b/lua-5.4.5/src/lapi.h new file mode 100644 index 0000000..a742427 --- /dev/null +++ b/lua-5.4.5/src/lapi.h @@ -0,0 +1,52 @@ +/* +** $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.p', checking for stack overflows */ +#define api_incr_top(L) {L->top.p++; \ + api_check(L, L->top.p <= L->ci->top.p, \ + "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.p'). +*/ +#define adjustresults(L,nres) \ + { if ((nres) <= LUA_MULTRET && L->ci->top.p < L->top.p) \ + L->ci->top.p = L->top.p; } + + +/* Ensure the stack has at least 'n' elements */ +#define api_checknelems(L,n) \ + api_check(L, (n) < (L->top.p - L->ci->func.p), \ + "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.5/src/lauxlib.c b/lua-5.4.5/src/lauxlib.c new file mode 100644 index 0000000..4ca6c65 --- /dev/null +++ b/lua-5.4.5/src/lauxlib.c @@ -0,0 +1,1112 @@ +/* +** $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. (The test for "not big enough" also gets the case when the +** computation of 'newsize' overflows.) +*/ +static size_t newbuffsize (luaL_Buffer *B, size_t sz) { + size_t newsize = (B->size / 2) * 3; /* buffer size * 1.5 */ + 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) /* 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) below 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; +} + + +/* +** Skip an optional BOM at the start of a stream. If there is an +** incomplete BOM (the first character is correct but the rest is +** not), returns the first character anyway to force an error +** (as no chunk can start with 0xEF). +*/ +static int skipBOM (FILE *f) { + int c = getc(f); /* read first character */ + if (c == 0xEF && getc(f) == 0xBB && getc(f) == 0xBF) /* correct BOM? */ + return getc(f); /* ignore BOM and return next char */ + else /* no (valid) BOM */ + return c; /* return first 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 (FILE *f, int *cp) { + int c = *cp = skipBOM(f); + if (c == '#') { /* first line is a comment (Unix exec. file)? */ + do { /* skip first line */ + c = getc(f); + } while (c != EOF && c != '\n'); + *cp = getc(f); /* next character after comment, 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); + } + lf.n = 0; + if (skipcomment(lf.f, &c)) /* read initial portion */ + lf.buff[lf.n++] = '\n'; /* add newline to correct line numbers */ + if (c == LUA_SIGNATURE[0]) { /* binary file? */ + lf.n = 0; /* remove possible newline */ + if (filename) { /* "real" file? */ + lf.f = freopen(filename, "rb", lf.f); /* reopen in binary mode */ + if (lf.f == NULL) return errfile(L, "reopen", fnameindex); + skipcomment(lf.f, &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) { + idx = lua_absindex(L,idx); + 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.5/src/lauxlib.h b/lua-5.4.5/src/lauxlib.h new file mode 100644 index 0000000..5b977e2 --- /dev/null +++ b/lua-5.4.5/src/lauxlib.h @@ -0,0 +1,301 @@ +/* +** $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) + + +/* +** Perform arithmetic operations on lua_Integer values with wrap-around +** semantics, as the Lua core does. +*/ +#define luaL_intop(op,v1,v2) \ + ((lua_Integer)((lua_Unsigned)(v1) op (lua_Unsigned)(v2))) + + +/* 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.5/src/lbaselib.c b/lua-5.4.5/src/lbaselib.c new file mode 100644 index 0000000..1d60c9d --- /dev/null +++ b/lua-5.4.5/src/lbaselib.c @@ -0,0 +1,549 @@ +/* +** $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) { + if (oldmode == -1) + luaL_pushfail(L); /* invalid call to 'lua_gc' */ + else + lua_pushstring(L, (oldmode == LUA_GCINC) ? "incremental" + : "generational"); + return 1; +} + + +/* +** check whether call to 'lua_gc' was valid (not inside a finalizer) +*/ +#define checkvalres(res) { if (res == -1) break; } + +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); + checkvalres(k); + 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); + checkvalres(res); + 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); + checkvalres(previous); + lua_pushinteger(L, previous); + return 1; + } + case LUA_GCISRUNNING: { + int res = lua_gc(L, o); + checkvalres(res); + 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); + checkvalres(res); + lua_pushinteger(L, res); + return 1; + } + } + luaL_pushfail(L); /* invalid call (inside a finalizer) */ + 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 pairscont (lua_State *L, int status, lua_KContext k) { + (void)L; (void)status; (void)k; /* unused */ + return 3; +} + +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_callk(L, 1, 3, 0, pairscont); /* get 3 values from metamethod */ + } + return 3; +} + + +/* +** Traversal function for 'ipairs' +*/ +static int ipairsaux (lua_State *L) { + lua_Integer i = luaL_checkinteger(L, 2); + i = luaL_intop(+, i, 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.5/src/lcode.c b/lua-5.4.5/src/lcode.c new file mode 100644 index 0000000..1a371ca --- /dev/null +++ b/lua-5.4.5/src/lcode.c @@ -0,0 +1,1871 @@ +/* +** $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 + +#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. +*/ +static int luaK_intK (FuncState *fs, lua_Integer n) { + TValue o; + setivalue(&o, n); + return addk(fs, &o, &o); /* use integer itself as key */ +} + +/* +** Add a float to list of constants and return its index. Floats +** with integral values need a different key, to avoid collision +** with actual integers. To that, we add to the number its smaller +** power-of-two fraction that is still significant in its scale. +** For doubles, that would be 1/2^52. +** (This method is not bulletproof: there may be another float +** with that value, and for floats larger than 2^53 the result is +** still an integer. At worst, this only wastes an entry with +** a duplicate.) +*/ +static int luaK_numberK (FuncState *fs, lua_Number r) { + TValue o; + lua_Integer ik; + setfltvalue(&o, r); + if (!luaV_flttointeger(r, &ik, F2Ieq)) /* not an integral value? */ + return addk(fs, &o, &o); /* use number itself as key */ + else { /* must build an alternative key */ + const int nbm = l_floatatt(MANT_DIG); + const lua_Number q = l_mathop(ldexp)(l_mathop(1.0), -nbm + 1); + const lua_Number k = (ik == 0) ? q : r + r*q; /* new key */ + TValue kv; + setfltvalue(&kv, k); + /* result is not an integral value, unless value is too large */ + lua_assert(!luaV_flttointeger(k, &ik, F2Ieq) || + l_mathop(fabs)(r) >= l_mathop(1e6)); + return addk(fs, &kv, &o); + } +} + + +/* +** 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; +} + + +/* +** Convert a BinOpr to an OpCode (ORDER OPR - ORDER OP) +*/ +l_sinline OpCode binopr2op (BinOpr opr, BinOpr baser, OpCode base) { + lua_assert(baser <= opr && + ((baser == OPR_ADD && opr <= OPR_SHR) || + (baser == OPR_LT && opr <= OPR_LE))); + return cast(OpCode, (cast_int(opr) - cast_int(baser)) + cast_int(base)); +} + + +/* +** Convert a UnOpr to an OpCode (ORDER OPR - ORDER OP) +*/ +l_sinline OpCode unopr2op (UnOpr opr) { + return cast(OpCode, (cast_int(opr) - cast_int(OPR_MINUS)) + + cast_int(OP_UNM)); +} + + +/* +** Convert a BinOpr to a tag method (ORDER OPR - ORDER TM) +*/ +l_sinline TMS binopr2TM (BinOpr opr) { + lua_assert(OPR_ADD <= opr && opr <= OPR_SHR); + return cast(TMS, (cast_int(opr) - cast_int(OPR_ADD)) + cast_int(TM_ADD)); +} + + +/* +** 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, BinOpr opr, + expdesc *e1, expdesc *e2, int line) { + OpCode op = binopr2op(opr, OPR_ADD, OP_ADD); + int v2 = luaK_exp2anyreg(fs, e2); /* make sure 'e2' is in a register */ + /* 'e1' must be already in a register or it is a constant */ + lua_assert((VNIL <= e1->k && e1->k <= VKSTR) || + e1->k == VNONRELOC || e1->k == VRELOC); + lua_assert(OP_ADD <= op && op <= OP_SHR); + finishbinexpval(fs, e1, e2, op, v2, 0, line, OP_MMBIN, binopr2TM(opr)); +} + + +/* +** 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); +} + + +/* +** Code binary operators with K operand. +*/ +static void codebinK (FuncState *fs, BinOpr opr, + expdesc *e1, expdesc *e2, int flip, int line) { + TMS event = binopr2TM(opr); + int v2 = e2->u.info; /* K index */ + OpCode op = binopr2op(opr, OPR_ADD, OP_ADDK); + finishbinexpval(fs, e1, e2, op, v2, flip, line, OP_MMBINK, 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 binary operators with no constant operand. +*/ +static void codebinNoK (FuncState *fs, BinOpr opr, + expdesc *e1, expdesc *e2, int flip, int line) { + if (flip) + swapexps(e1, e2); /* back to original order */ + codebinexpval(fs, opr, e1, e2, line); /* use standard operators */ +} + + +/* +** 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) { + if (tonumeral(e2, NULL) && luaK_exp2K(fs, e2)) /* K operand? */ + codebinK(fs, opr, e1, e2, flip, line); + else /* 'e2' is neither an immediate nor a K operand */ + codebinNoK(fs, opr, e1, e2, flip, line); +} + + +/* +** 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, OP_ADDI, e1, e2, flip, line, TM_ADD); + else + codearith(fs, op, e1, e2, flip, line); +} + + +/* +** Code bitwise operations; they are all commutative, 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; + if (e1->k == VKINT) { + swapexps(e1, e2); /* 'e2' will be the constant operand */ + flip = 1; + } + if (e2->k == VKINT && luaK_exp2K(fs, e2)) /* K operand? */ + codebinK(fs, opr, e1, e2, flip, line); + else /* no constants */ + codebinNoK(fs, opr, e1, e2, flip, line); +} + + +/* +** Emit code for order comparisons. When using an immediate operand, +** 'isfloat' tells whether the original value was a float. +*/ +static void codeorder (FuncState *fs, BinOpr opr, expdesc *e1, expdesc *e2) { + int r1, r2; + int im; + int isfloat = 0; + OpCode op; + if (isSCnumber(e2, &im, &isfloat)) { + /* use immediate operand */ + r1 = luaK_exp2anyreg(fs, e1); + r2 = im; + op = binopr2op(opr, OPR_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 = binopr2op(opr, OPR_LT, OP_GTI); + } + else { /* regular case, compare two registers */ + r1 = luaK_exp2anyreg(fs, e1); + r2 = luaK_exp2anyreg(fs, e2); + op = binopr2op(opr, OPR_LT, OP_LT); + } + 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)) { /* 2nd 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 opr, expdesc *e, int line) { + static const expdesc ef = {VKINT, {0}, NO_JUMP, NO_JUMP}; + luaK_dischargevars(fs, e); + switch (opr) { + case OPR_MINUS: case OPR_BNOT: /* use 'ef' as fake 2nd operand */ + if (constfolding(fs, opr + LUA_OPUNM, e, &ef)) + break; + /* else */ /* FALLTHROUGH */ + case OPR_LEN: + codeunexpval(fs, unopr2op(opr), 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 or used as an immediate + 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, opr, 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, opr, e1, e2, line); + break; + } + case OPR_EQ: case OPR_NE: { + codeeq(fs, opr, e1, e2); + break; + } + case OPR_GT: case OPR_GE: { + /* '(a > b)' <=> '(b < a)'; '(a >= b)' <=> '(b <= a)' */ + swapexps(e1, e2); + opr = cast(BinOpr, (opr - OPR_GT) + OPR_LT); + } /* FALLTHROUGH */ + case OPR_LT: case OPR_LE: { + codeorder(fs, opr, 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.5/src/lcode.h b/lua-5.4.5/src/lcode.h new file mode 100644 index 0000000..3265824 --- /dev/null +++ b/lua-5.4.5/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.5/src/lcorolib.c b/lua-5.4.5/src/lcorolib.c new file mode 100644 index 0000000..40b880b --- /dev/null +++ b/lua-5.4.5/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, L); /* close its tbc variables */ + lua_assert(stat != LUA_OK); + lua_xmove(co, L, 1); /* move error message to the caller */ + } + 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, L); + if (status == LUA_OK) { + lua_pushboolean(L, 1); + return 1; + } + else { + lua_pushboolean(L, 0); + lua_xmove(co, L, 1); /* move 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.5/src/lctype.c b/lua-5.4.5/src/lctype.c new file mode 100644 index 0000000..9542280 --- /dev/null +++ b/lua-5.4.5/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.5/src/lctype.h b/lua-5.4.5/src/lctype.h new file mode 100644 index 0000000..864e190 --- /dev/null +++ b/lua-5.4.5/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.5/src/ldblib.c b/lua-5.4.5/src/ldblib.c new file mode 100644 index 0000000..6dcbaa9 --- /dev/null +++ b/lua-5.4.5/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.5/src/ldebug.c b/lua-5.4.5/src/ldebug.c new file mode 100644 index 0000000..28b1caa --- /dev/null +++ b/lua-5.4.5/src/ldebug.c @@ -0,0 +1,924 @@ +/* +** $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 *funcnamefromcall (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 bound 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))->p->is_vararg) { + int nextra = ci->u.l.nextraargs; + if (n >= -nextra) { /* 'n' is negative */ + *pos = ci->func.p - 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.p + 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.p : ci->next->func.p; + 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.p - 1))) /* not a Lua function? */ + name = NULL; + else /* consider live variables at function start (parameters) */ + name = luaF_getlocalname(clLvalue(s2v(L->top.p - 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.p, 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.p - 1); + L->top.p--; /* 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.p)); + 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.p, t); /* push it on stack */ + api_incr_top(L); + setbtvalue(&v); /* boolean 'true' to be the value of all indices */ + if (!p->is_vararg) /* regular function? */ + i = 0; /* consider all instructions */ + else { /* vararg function */ + lua_assert(GET_OPCODE(p->code[0]) == OP_VARARGPREP); + currentline = nextline(p, currentline, 0); + i = 1; /* skip first instruction (OP_VARARGPREP) */ + } + for (; i < p->sizelineinfo; i++) { /* for each instruction */ + 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) { + /* calling function is a known function? */ + if (ci != NULL && !(ci->callstatus & CIST_TAIL)) + return funcnamefromcall(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.p - 1); + api_check(L, ttisfunction(func), "function expected"); + what++; /* skip the '>' */ + L->top.p--; /* pop function */ + } + else { + ci = ar->i_ci; + func = s2v(ci->func.p); + 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.p, 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, const Proto *p, + int pc, const char **name) { + TMS tm = (TMS)0; /* (initial value avoids warnings) */ + Instruction i = p->code[pc]; /* calling instruction */ + 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"; +} + + +/* +** Try to find a name for a function based on how it was called. +*/ +static const char *funcnamefromcall (lua_State *L, CallInfo *ci, + const char **name) { + if (ci->callstatus & CIST_HOOKED) { /* was it called inside a hook? */ + *name = "?"; + return "hook"; + } + else if (ci->callstatus & CIST_FIN) { /* was it called as a finalizer? */ + *name = "__gc"; + return "metamethod"; /* report it as such */ + } + else if (isLua(ci)) + return funcnamefromcode(L, ci_func(ci)->p, currentpc(ci), name); + else + return NULL; +} + +/* }====================================================== */ + + + +/* +** Check whether pointer 'o' points to some value in the stack frame of +** the current function and, if so, returns its index. Because 'o' may +** not point to a value in this stack, we cannot compare it with the +** region boundaries (undefined behavior in ISO C). +*/ +static int instack (CallInfo *ci, const TValue *o) { + int pos; + StkId base = ci->func.p + 1; + for (pos = 0; base + pos < ci->top.p; pos++) { + if (o == s2v(base + pos)) + return pos; + } + return -1; /* 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.p == o) { + *name = upvalname(c->p, i); + return "upvalue"; + } + } + return NULL; +} + + +static const char *formatvarinfo (lua_State *L, const char *kind, + const char *name) { + if (kind == NULL) + return ""; /* no information */ + else + return luaO_pushfstring(L, " (%s '%s')", kind, name); +} + +/* +** Build a string with a "description" for the value 'o', such as +** "variable 'x'" or "upvalue 'y'". +*/ +static const char *varinfo (lua_State *L, const TValue *o) { + CallInfo *ci = L->ci; + const char *name = NULL; /* to avoid warnings */ + const char *kind = NULL; + if (isLua(ci)) { + kind = getupvalname(ci, o, &name); /* check whether 'o' is an upvalue */ + if (!kind) { /* not an upvalue? */ + int reg = instack(ci, o); /* try a register */ + if (reg >= 0) /* is 'o' a register? */ + kind = getobjname(ci_func(ci)->p, currentpc(ci), reg, &name); + } + } + return formatvarinfo(L, kind, name); +} + + +/* +** Raise a type error +*/ +static l_noret typeerror (lua_State *L, const TValue *o, const char *op, + const char *extra) { + const char *t = luaT_objtypename(L, o); + luaG_runerror(L, "attempt to %s a %s value%s", op, t, extra); +} + + +/* +** Raise a type error with "standard" information about the faulty +** object 'o' (using 'varinfo'). +*/ +l_noret luaG_typeerror (lua_State *L, const TValue *o, const char *op) { + typeerror(L, o, op, varinfo(L, o)); +} + + +/* +** Raise an error for calling a non-callable object. Try to find a name +** for the object based on how it was called ('funcnamefromcall'); if it +** cannot get a name there, try 'varinfo'. +*/ +l_noret luaG_callerror (lua_State *L, const TValue *o) { + CallInfo *ci = L->ci; + const char *name = NULL; /* to avoid warnings */ + const char *kind = funcnamefromcall(L, ci, &name); + const char *extra = kind ? formatvarinfo(L, kind, name) : varinfo(L, o); + typeerror(L, o, "call", extra); +} + + +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.p, L->top.p - 1); /* move argument */ + setobjs2s(L, L->top.p - 1, errfunc); /* push function */ + L->top.p++; /* assume EXTRA_STACK */ + luaD_callnoyield(L, L->top.p - 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)); + setobjs2s(L, L->top.p - 2, L->top.p - 1); /* remove 'msg' */ + L->top.p--; + } + 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 difference */ + 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.p' 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.p = ci->top.p; /* 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.5/src/ldebug.h b/lua-5.4.5/src/ldebug.h new file mode 100644 index 0000000..2c3074c --- /dev/null +++ b/lua-5.4.5/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.p))) + + +#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.5/src/ldo.c b/lua-5.4.5/src/ldo.c new file mode 100644 index 0000000..2a0017c --- /dev/null +++ b/lua-5.4.5/src/ldo.c @@ -0,0 +1,1024 @@ +/* +** $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.p - 1); /* error message on current top */ + break; + } + } + L->top.p = 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.p++, L->top.p - 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 +** =================================================================== +*/ + + +/* +** Change all pointers to the stack into offsets. +*/ +static void relstack (lua_State *L) { + CallInfo *ci; + UpVal *up; + L->top.offset = savestack(L, L->top.p); + L->tbclist.offset = savestack(L, L->tbclist.p); + for (up = L->openupval; up != NULL; up = up->u.open.next) + up->v.offset = savestack(L, uplevel(up)); + for (ci = L->ci; ci != NULL; ci = ci->previous) { + ci->top.offset = savestack(L, ci->top.p); + ci->func.offset = savestack(L, ci->func.p); + } +} + + +/* +** Change back all offsets into pointers. +*/ +static void correctstack (lua_State *L) { + CallInfo *ci; + UpVal *up; + L->top.p = restorestack(L, L->top.offset); + L->tbclist.p = restorestack(L, L->tbclist.offset); + for (up = L->openupval; up != NULL; up = up->u.open.next) + up->v.p = s2v(restorestack(L, up->v.offset)); + for (ci = L->ci; ci != NULL; ci = ci->previous) { + ci->top.p = restorestack(L, ci->top.offset); + ci->func.p = restorestack(L, ci->func.offset); + 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. +** In ISO C, any pointer use after the pointer has been deallocated is +** undefined behavior. So, before the reallocation, all pointers are +** changed to offsets, and after the reallocation they are changed back +** to pointers. As during the reallocation the pointers are invalid, the +** reallocation cannot run emergency collections. +** +** 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; + int oldgcstop = G(L)->gcstopem; + lua_assert(newsize <= LUAI_MAXSTACK || newsize == ERRORSTACKSIZE); + relstack(L); /* change pointers to offsets */ + G(L)->gcstopem = 1; /* stop emergency collection */ + newstack = luaM_reallocvector(L, L->stack.p, oldsize + EXTRA_STACK, + newsize + EXTRA_STACK, StackValue); + G(L)->gcstopem = oldgcstop; /* restore emergency collection */ + if (l_unlikely(newstack == NULL)) { /* reallocation failed? */ + correctstack(L); /* change offsets back to pointers */ + if (raiseerror) + luaM_error(L); + else return 0; /* do not raise an error */ + } + L->stack.p = newstack; + correctstack(L); /* change offsets back to pointers */ + L->stack_last.p = L->stack.p + newsize; + for (i = oldsize + EXTRA_STACK; i < newsize + EXTRA_STACK; i++) + setnilvalue(s2v(newstack + i)); /* erase new segment */ + 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 if (n < LUAI_MAXSTACK) { /* avoids arithmetic overflows */ + int newsize = 2 * size; /* tentative new size */ + int needed = cast_int(L->top.p - L->stack.p) + 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; +} + + +/* +** Compute how much of the stack is being used, by computing the +** maximum top of all call frames in the stack and the current top. +*/ +static int stackinuse (lua_State *L) { + CallInfo *ci; + int res; + StkId lim = L->top.p; + for (ci = L->ci; ci != NULL; ci = ci->previous) { + if (lim < ci->top.p) lim = ci->top.p; + } + lua_assert(lim <= L->stack_last.p + EXTRA_STACK); + res = cast_int(lim - L->stack.p) + 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 max = (inuse > LUAI_MAXSTACK / 3) ? LUAI_MAXSTACK : inuse * 3; + /* 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) { + int nsize = (inuse > LUAI_MAXSTACK / 2) ? LUAI_MAXSTACK : inuse * 2; + 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.p++; +} + +/* }================================================================== */ + + +/* +** 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.p); /* preserve original 'top' */ + ptrdiff_t ci_top = savestack(L, ci->top.p); /* 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.p < ci->top.p) + L->top.p = ci->top.p; /* protect entire activation register */ + luaD_checkstack(L, LUA_MINSTACK); /* ensure minimum stack size */ + if (ci->top.p < L->top.p + LUA_MINSTACK) + ci->top.p = L->top.p + 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.p = restorestack(L, ci_top); + L->top.p = 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.p - 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.p += delta; /* if vararg, back to virtual 'func' */ + ftransfer = cast(unsigned short, firstres - ci->func.p); + luaD_hook(L, LUA_HOOKRET, -1, ftransfer, nres); /* call it */ + ci->func.p -= 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. +*/ +StkId luaD_tryfuncTM (lua_State *L, StkId func) { + const TValue *tm; + StkId p; + checkstackGCp(L, 1, func); /* space for metamethod */ + tm = luaT_gettmbyobj(L, s2v(func), TM_CALL); /* (after previous GC) */ + if (l_unlikely(ttisnil(tm))) + luaG_callerror(L, s2v(func)); /* nothing to call */ + for (p = L->top.p; p > func; p--) /* open space for metamethod */ + setobjs2s(L, p, p-1); + L->top.p++; /* stack space pre-allocated by the caller */ + setobj2s(L, func, tm); /* metamethod is the new function to be called */ + return func; +} + + +/* +** 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. +*/ +l_sinline 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.p = 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.p - nres); /* move it to proper place */ + L->top.p = 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? */ + L->ci->callstatus |= CIST_CLSRET; /* in case of yields */ + L->ci->u2.nres = nres; + res = luaF_close(L, res, CLOSEKTOP, 1); + L->ci->callstatus &= ~CIST_CLSRET; + if (L->hookmask) { /* if needed, call hook after '__close's */ + ptrdiff_t savedres = savestack(L, res); + rethook(L, L->ci, nres); + res = restorestack(L, savedres); /* hook can move stack */ + } + wanted = decodeNresults(wanted); + if (wanted == LUA_MULTRET) + wanted = nres; /* we want all results */ + } + break; + } + /* generic case */ + firstresult = L->top.p - 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.p = 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.p, 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)) + + +l_sinline CallInfo *prepCallInfo (lua_State *L, StkId func, int nret, + int mask, StkId top) { + CallInfo *ci = L->ci = next_ci(L); /* new frame */ + ci->func.p = func; + ci->nresults = nret; + ci->callstatus = mask; + ci->top.p = top; + return ci; +} + + +/* +** precall for C functions +*/ +l_sinline int precallC (lua_State *L, StkId func, int nresults, + lua_CFunction f) { + int n; /* number of returns */ + CallInfo *ci; + checkstackGCp(L, LUA_MINSTACK, func); /* ensure minimum stack size */ + L->ci = ci = prepCallInfo(L, func, nresults, CIST_C, + L->top.p + LUA_MINSTACK); + lua_assert(ci->top.p <= L->stack_last.p); + if (l_unlikely(L->hookmask & LUA_MASKCALL)) { + int narg = cast_int(L->top.p - 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 n; +} + + +/* +** 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). Return the number of +** results, if it was a C function, or -1 for a Lua function. +*/ +int luaD_pretailcall (lua_State *L, CallInfo *ci, StkId func, + int narg1, int delta) { + retry: + switch (ttypetag(s2v(func))) { + case LUA_VCCL: /* C closure */ + return precallC(L, func, LUA_MULTRET, clCvalue(s2v(func))->f); + case LUA_VLCF: /* light C function */ + return precallC(L, func, LUA_MULTRET, fvalue(s2v(func))); + case LUA_VLCL: { /* Lua function */ + Proto *p = clLvalue(s2v(func))->p; + int fsize = p->maxstacksize; /* frame size */ + int nfixparams = p->numparams; + int i; + checkstackGCp(L, fsize - delta, func); + ci->func.p -= delta; /* restore 'func' (if vararg) */ + for (i = 0; i < narg1; i++) /* move down function and arguments */ + setobjs2s(L, ci->func.p + i, func + i); + func = ci->func.p; /* moved-down function */ + for (; narg1 <= nfixparams; narg1++) + setnilvalue(s2v(func + narg1)); /* complete missing arguments */ + ci->top.p = func + 1 + fsize; /* top for new function */ + lua_assert(ci->top.p <= L->stack_last.p); + ci->u.l.savedpc = p->code; /* starting point */ + ci->callstatus |= CIST_TAIL; + L->top.p = func + narg1; /* set top */ + return -1; + } + default: { /* not a function */ + func = luaD_tryfuncTM(L, func); /* try to get '__call' metamethod */ + /* return luaD_pretailcall(L, ci, func, narg1 + 1, delta); */ + narg1++; + goto retry; /* try again */ + } + } +} + + +/* +** 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) { + retry: + switch (ttypetag(s2v(func))) { + case LUA_VCCL: /* C closure */ + precallC(L, func, nresults, clCvalue(s2v(func))->f); + return NULL; + case LUA_VLCF: /* light C function */ + precallC(L, func, nresults, fvalue(s2v(func))); + return NULL; + case LUA_VLCL: { /* Lua function */ + CallInfo *ci; + Proto *p = clLvalue(s2v(func))->p; + int narg = cast_int(L->top.p - func) - 1; /* number of real arguments */ + int nfixparams = p->numparams; + int fsize = p->maxstacksize; /* frame size */ + checkstackGCp(L, fsize, func); + L->ci = ci = prepCallInfo(L, func, nresults, 0, func + 1 + fsize); + ci->u.l.savedpc = p->code; /* starting point */ + for (; narg < nfixparams; narg++) + setnilvalue(s2v(L->top.p++)); /* complete missing arguments */ + lua_assert(ci->top.p <= L->stack_last.p); + return ci; + } + default: { /* not a function */ + func = luaD_tryfuncTM(L, func); /* try to get '__call' metamethod */ + /* return luaD_precall(L, func, nresults); */ + 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). +** This function can be called with some use of EXTRA_STACK, so it should +** check the stack before doing anything else. 'luaD_precall' already +** does that. +*/ +l_sinline void ccall (lua_State *L, StkId func, int nResults, l_uint32 inc) { + CallInfo *ci; + L->nCcalls += inc; + if (l_unlikely(getCcalls(L) >= LUAI_MAXCCALLS)) { + checkstackp(L, 0, func); /* free any use of EXTRA_STACK */ + 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' */ + func = luaF_close(L, func, status, 1); /* can yield or raise an error */ + 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.p -= narg; /* remove args from the stack */ + setsvalue2s(L, L->top.p, 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.p - n; /* first argument */ + CallInfo *ci = L->ci; + if (L->status == LUA_OK) /* starting a coroutine? */ + ccall(L, firstArg - 1, LUA_MULTRET, 0); /* 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) */ + if (isLua(ci)) { /* yielded inside a hook? */ + L->top.p = 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.p - (L->ci->func.p + 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; + if (getCcalls(L) >= LUAI_MAXCCALLS) + return resume_error(L, "C stack overflow", nargs); + L->nCcalls++; + 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.p); /* push error message */ + L->ci->top.p = L->top.p; + } + *nresults = (status == LUA_YIELD) ? L->ci->u2.nyield + : cast_int(L->top.p - (L->ci->func.p + 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.p), 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.5/src/ldo.h b/lua-5.4.5/src/ldo.h new file mode 100644 index 0000000..1aa446a --- /dev/null +++ b/lua-5.4.5/src/ldo.h @@ -0,0 +1,88 @@ +/* +** $Id: ldo.h $ +** Stack and Call structure of Lua +** See Copyright Notice in lua.h +*/ + +#ifndef ldo_h +#define ldo_h + + +#include "llimits.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.p - L->top.p <= (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,pt) (cast_charp(pt) - cast_charp(L->stack.p)) +#define restorestack(L,n) cast(StkId, cast_charp(L->stack.p) + (n)) + + +/* macro to check stack size, preserving 'p' */ +#define checkstackp(L,n,p) \ + luaD_checkstackaux(L, n, \ + ptrdiff_t t__ = savestack(L, p), /* save 'p' */ \ + p = restorestack(L, t__)) /* 'pos' part: restore 'p' */ + + +/* macro to check stack size and GC, 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 int luaD_pretailcall (lua_State *L, CallInfo *ci, StkId func, + int narg1, int delta); +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 StkId 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.5/src/ldump.c b/lua-5.4.5/src/ldump.c new file mode 100644 index 0000000..f231691 --- /dev/null +++ b/lua-5.4.5/src/ldump.c @@ -0,0 +1,230 @@ +/* +** $Id: ldump.c $ +** save precompiled Lua chunks +** See Copyright Notice in lua.h +*/ + +#define ldump_c +#define LUA_CORE + +#include "lprefix.h" + + +#include +#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); +} + + +/* +** 'dumpSize' buffer size: each byte can store up to 7 bits. (The "+6" +** rounds up the division.) +*/ +#define DIBS ((sizeof(size_t) * CHAR_BIT + 6) / 7) + +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.5/src/lfunc.c b/lua-5.4.5/src/lfunc.c new file mode 100644 index 0000000..0945f24 --- /dev/null +++ b/lua-5.4.5/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.p = &uv->u.value; /* make it closed */ + setnilvalue(uv->v.p); + 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, StkId level, UpVal **prev) { + GCObject *o = luaC_newobj(L, LUA_VUPVAL, sizeof(UpVal)); + UpVal *uv = gco2upv(o); + UpVal *next = *prev; + uv->v.p = s2v(level); /* current value lives in the stack */ + 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, 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.p; + 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.p = 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.p); /* 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.p->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.p); + 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.p) > MAXDELTA) { + L->tbclist.p += MAXDELTA; /* create a dummy node at maximum delta */ + L->tbclist.p->tbclist.delta = 0; + } + level->tbclist.delta = cast(unsigned short, level - L->tbclist.p); + L->tbclist.p = 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.p); + luaF_unlinkupval(uv); /* remove upvalue from 'openupval' list */ + setobj(L, slot, uv->v.p); /* move value to upvalue slot */ + uv->v.p = 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 first element from the tbclist plus its dummy nodes. +*/ +static void poptbclist (lua_State *L) { + StkId tbc = L->tbclist.p; + lua_assert(tbc->tbclist.delta > 0); /* first element cannot be dummy */ + tbc -= tbc->tbclist.delta; + while (tbc > L->stack.p && tbc->tbclist.delta == 0) + tbc -= MAXDELTA; /* remove dummy nodes */ + L->tbclist.p = tbc; +} + + +/* +** Close all upvalues and to-be-closed variables up to the given stack +** level. Return restored 'level'. +*/ +StkId 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.p >= level) { /* traverse tbc's down to that level */ + StkId tbc = L->tbclist.p; /* get variable index */ + poptbclist(L); /* remove it from list */ + prepcallclosemth(L, tbc, status, yy); /* close variable */ + level = restorestack(L, levelrel); + } + return level; +} + + +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.5/src/lfunc.h b/lua-5.4.5/src/lfunc.h new file mode 100644 index 0000000..3be265e --- /dev/null +++ b/lua-5.4.5/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.p != &(up)->u.value) + + +#define uplevel(up) check_exp(upisopen(up), cast(StkId, (up)->v.p)) + + +/* +** 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 StkId 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.5/src/lgc.c b/lua-5.4.5/src/lgc.c new file mode 100644 index 0000000..a3094ff --- /dev/null +++ b/lua-5.4.5/src/lgc.c @@ -0,0 +1,1739 @@ +/* +** $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, size, and offset) +** and link it to 'allgc' list. +*/ +GCObject *luaC_newobjdt (lua_State *L, int tt, size_t sz, size_t offset) { + global_State *g = G(L); + char *p = cast_charp(luaM_newobject(L, novariant(tt), sz)); + GCObject *o = cast(GCObject *, p + offset); + o->marked = luaC_white(g); + o->tt = tt; + o->next = g->allgc; + g->allgc = o; + return o; +} + + +GCObject *luaC_newobj (lua_State *L, int tt, size_t sz) { + return luaC_newobjdt(L, tt, sz, 0); +} + +/* }====================================================== */ + + + +/* +** {====================================================== +** 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.p); /* 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.p); /* 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.p; + 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.p; 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.p + 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.p - 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 oldgcstp = g->gcstp; + g->gcstp |= GCSTPGC; /* avoid GC steps */ + L->allowhook = 0; /* stop debug hooks during GC metamethod */ + setobj2s(L, L->top.p++, tm); /* push finalizer... */ + setobj2s(L, L->top.p++, &v); /* ... and its argument */ + L->ci->callstatus |= CIST_FIN; /* will run a finalizer */ + status = luaD_pcall(L, dothecall, NULL, savestack(L, L->top.p - 2), 0); + L->ci->callstatus &= ~CIST_FIN; /* not running a finalizer anymore */ + L->allowhook = oldah; /* restore hooks */ + g->gcstp = oldgcstp; /* restore state */ + if (l_unlikely(status != LUA_OK)) { /* error while running __gc? */ + luaE_warnerror(L, "__gc"); + L->top.p--; /* 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... */ + (g->gcstp & GCSTPCLS)) /* or closing state? */ + 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 +** ======================================================= +*/ + + +/* +** 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); +} + + +/* +** 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); +} + + +/* +** 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)); +} + + +/* +** 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); + setminordebt(g); /* set debt assuming next cycle will be minor */ + 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); +} + + +/* +** 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. */ + lua_assert(g->lastatomic == 0); + } + 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 +** ======================================================= +*/ + + +/* +** 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); + g->gcstp = GCSTPCLS; /* no extra finalizers after here */ + 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)); + lua_assert(g->finobj == NULL); /* no new finalizers */ + 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. (If collector is +** not running, set a reasonable debt to avoid it being called at +** every single check.) +*/ +void luaC_step (lua_State *L) { + global_State *g = G(L); + if (!gcrunning(g)) /* not running? */ + luaE_setdebt(g, -2000); + else { + 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.5/src/lgc.h b/lua-5.4.5/src/lgc.h new file mode 100644 index 0000000..538f6ed --- /dev/null +++ b/lua-5.4.5/src/lgc.h @@ -0,0 +1,202 @@ +/* +** $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) + + +/* +** Control when GC is running: +*/ +#define GCSTPUSR 1 /* bit true when GC stopped by user */ +#define GCSTPGC 2 /* bit true when GC stopped by itself */ +#define GCSTPCLS 4 /* bit true when closing Lua state */ +#define gcrunning(g) ((g)->gcstp == 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_objbarrier(L,p,o) ( \ + (isblack(p) && iswhite(o)) ? \ + luaC_barrier_(L,obj2gco(p),obj2gco(o)) : cast_void(0)) + +#define luaC_barrier(L,p,v) ( \ + iscollectable(v) ? luaC_objbarrier(L,p,gcvalue(v)) : cast_void(0)) + +#define luaC_objbarrierback(L,p,o) ( \ + (isblack(p) && iswhite(o)) ? luaC_barrierback_(L,p) : cast_void(0)) + +#define luaC_barrierback(L,p,v) ( \ + iscollectable(v) ? luaC_objbarrierback(L, p, gcvalue(v)) : 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 GCObject *luaC_newobjdt (lua_State *L, int tt, size_t sz, + size_t offset); +LUAI_FUNC void luaC_barrier_ (lua_State *L, GCObject *o, GCObject *v); +LUAI_FUNC void luaC_barrierback_ (lua_State *L, GCObject *o); +LUAI_FUNC void luaC_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.5/src/linit.c b/lua-5.4.5/src/linit.c new file mode 100644 index 0000000..69808f8 --- /dev/null +++ b/lua-5.4.5/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.5/src/liolib.c b/lua-5.4.5/src/liolib.c new file mode 100644 index 0000000..b08397d --- /dev/null +++ b/lua-5.4.5/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.5/src/ljumptab.h b/lua-5.4.5/src/ljumptab.h new file mode 100644 index 0000000..8306f25 --- /dev/null +++ b/lua-5.4.5/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.5/src/llex.c b/lua-5.4.5/src/llex.c new file mode 100644 index 0000000..5fc39a5 --- /dev/null +++ b/lua-5.4.5/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 readily 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.p++); /* 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.p--; /* 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.5/src/llex.h b/lua-5.4.5/src/llex.h new file mode 100644 index 0000000..389d2f8 --- /dev/null +++ b/lua-5.4.5/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.5/src/llimits.h b/lua-5.4.5/src/llimits.h new file mode 100644 index 0000000..1c826f7 --- /dev/null +++ b/lua-5.4.5/src/llimits.h @@ -0,0 +1,380 @@ +/* +** $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. (In strict ISO C this may cause undefined behavior, but no +** actual machine seems to bother.) +*/ +#if !defined(LUA_USE_C89) && defined(__STDC_VERSION__) && \ + __STDC_VERSION__ >= 199901L +#include +#if defined(UINTPTR_MAX) /* even in C99 this type is optional */ +#define L_P2I uintptr_t +#else /* no 'intptr'? */ +#define L_P2I uintmax_t /* use the largest available integer */ +#endif +#else /* C89 option */ +#define L_P2I size_t +#endif + +#define point2uint(p) ((unsigned int)((L_P2I)(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 + + +/* +** Inline functions +*/ +#if !defined(LUA_USE_C89) +#define l_inline inline +#elif defined(__GNUC__) +#define l_inline __inline__ +#else +#define l_inline /* empty */ +#endif + +#define l_sinline static l_inline + + +/* +** 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 (gcrunning(G(L))) { pre; luaC_fullgc(L, 0); pos; } } +#endif + +#endif diff --git a/lua-5.4.5/src/lmathlib.c b/lua-5.4.5/src/lmathlib.c new file mode 100644 index 0000000..d0b1e1e --- /dev/null +++ b/lua-5.4.5/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_Unsigned' 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 \ + (l_mathop(1.0) / (UONE << 30) / l_mathop(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)) * l_mathop(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.5/src/lmem.c b/lua-5.4.5/src/lmem.c new file mode 100644 index 0000000..9800a86 --- /dev/null +++ b/lua-5.4.5/src/lmem.c @@ -0,0 +1,215 @@ +/* +** $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" + + + +/* +** 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. +*/ + + +/* +** Macro to call the allocation function. +*/ +#define callfrealloc(g,block,os,ns) ((*g->frealloc)(g->ud, block, os, ns)) + + +/* +** When an allocation fails, it will try again after an emergency +** collection, except when it cannot run a collection. The GC should +** not be called while the 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. +*/ +#define cantryagain(g) (completestate(g) && !g->gcstopem) + + + + +#if defined(EMERGENCYGCTESTS) +/* +** First allocation will fail except when freeing a block (frees never +** fail) and when it cannot try again; 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 (ns > 0 && cantryagain(g)) + return NULL; /* fail */ + else /* normal allocation */ + return callfrealloc(g, block, os, ns); +} +#else +#define firsttry(g,block,os,ns) callfrealloc(g, block, os, ns) +#endif + + + + + +/* +** {================================================================== +** 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)); + callfrealloc(g, 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. +*/ +static void *tryagain (lua_State *L, void *block, + size_t osize, size_t nsize) { + global_State *g = G(L); + if (cantryagain(g)) { + luaC_fullgc(L, 1); /* try to free some memory... */ + return callfrealloc(g, block, osize, nsize); /* try again */ + } + else return NULL; /* cannot run an emergency collection */ +} + + +/* +** 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.5/src/lmem.h b/lua-5.4.5/src/lmem.h new file mode 100644 index 0000000..8c75a44 --- /dev/null +++ b/lua-5.4.5/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.5/src/loadlib.c b/lua-5.4.5/src/loadlib.c new file mode 100644 index 0000000..d792dff --- /dev/null +++ b/lua-5.4.5/src/loadlib.c @@ -0,0 +1,767 @@ +/* +** $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.5/src/lobject.c b/lua-5.4.5/src/lobject.c new file mode 100644 index 0000000..f73ffc6 --- /dev/null +++ b/lua-5.4.5/src/lobject.c @@ -0,0 +1,602 @@ +/* +** $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_shiftr(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 = l_mathop(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 l_mathop(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 * l_mathop(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 l_mathop(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 l_mathop(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'. It should be +** (LUA_IDSIZE + MAXNUMBER2STR) + a minimal space for basic messages, +** so that 'luaG_addinfo' can work directly on the buffer. +*/ +#define BUFVFS (LUA_IDSIZE + MAXNUMBER2STR + 95) + +/* buffer used by 'luaO_pushvfstring' */ +typedef struct BuffFS { + lua_State *L; + int pushed; /* true if there is a part of the result 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 result, and +** join it to previous partial result if there is one. +** It may call 'luaV_concat' while using one slot from EXTRA_STACK. +** This call cannot invoke metamethods, as both operands must be +** strings. It can, however, raise an error if the result is too +** long. In that case, 'luaV_concat' frees the extra slot before +** raising the error. +*/ +static void pushstr (BuffFS *buff, const char *str, size_t lstr) { + lua_State *L = buff->L; + setsvalue2s(L, L->top.p, luaS_newlstr(L, str, lstr)); + L->top.p++; /* may use one slot from EXTRA_STACK */ + if (!buff->pushed) /* no previous string on the stack? */ + buff->pushed = 1; /* now there is one */ + else /* join previous string with new one */ + luaV_concat(L, 2); +} + + +/* +** 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 numeral 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.p - 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.5/src/lobject.h b/lua-5.4.5/src/lobject.h new file mode 100644 index 0000000..556608e --- /dev/null +++ b/lua-5.4.5/src/lobject.h @@ -0,0 +1,815 @@ +/* +** $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 */ + /* not used, but may avoid warnings for uninitialized value */ + lu_byte ub; +} 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 'obj2' to 'obj1') */ +#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; + + +/* +** When reallocating the stack, change all pointers to the stack into +** proper offsets. +*/ +typedef union { + StkId p; /* actual pointer */ + ptrdiff_t offset; /* used while the stack is being reallocated */ +} StkIdRel; + + +/* 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; + union { + TValue *p; /* points to stack or to its own value */ + ptrdiff_t offset; /* used while the stack is being reallocated */ + } v; + 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.5/src/lopcodes.c b/lua-5.4.5/src/lopcodes.c new file mode 100644 index 0000000..c67aa22 --- /dev/null +++ b/lua-5.4.5/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.5/src/lopcodes.h b/lua-5.4.5/src/lopcodes.h new file mode 100644 index 0000000..4c55145 --- /dev/null +++ b/lua-5.4.5/src/lopcodes.h @@ -0,0 +1,405 @@ +/* +** $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 (signed)(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: + + (*) Opcode OP_LFALSESKIP is used to convert a condition to a boolean + value, in a code equivalent to (not cond ? false : true). (It + produces false and skips the next instruction producing true.) + + (*) Opcodes OP_MMBIN and variants follow each arithmetic and + bitwise opcode. If the operation succeeds, it skips this next + opcode. Otherwise, this opcode calls the corresponding metamethod. + + (*) Opcode OP_TESTSET is used in short-circuit expressions that need + both to jump and to produce a value, such as (a = b or c). + + (*) 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.5/src/lopnames.h b/lua-5.4.5/src/lopnames.h new file mode 100644 index 0000000..965cec9 --- /dev/null +++ b/lua-5.4.5/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.5/src/loslib.c b/lua-5.4.5/src/loslib.c new file mode 100644 index 0000000..ad5a927 --- /dev/null +++ b/lua-5.4.5/src/loslib.c @@ -0,0 +1,428 @@ +/* +** $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) /* { */ + +#if defined(LUA_USE_WINDOWS) +#define LUA_STRFTIMEOPTIONS "aAbBcdHIjmMpSUwWxXyYzZ%" \ + "||" "#c#x#d#H#I#j#m#M#S#U#w#W#y#Y" /* two-char options */ +#elif defined(LUA_USE_C89) /* ANSI C 89 (only 1-char options) */ +#define LUA_STRFTIMEOPTIONS "aAbBcdHIjmMpSUwWxXyYZ%" +#else /* C99 specification */ +#define LUA_STRFTIMEOPTIONS "aAbBcCdDeFgGhHIjmMnprRStTuUVwWxXyYzZ%" \ + "||" "EcECExEXEyEY" "OdOeOHOIOmOMOSOuOUOVOwOWOy" /* two-char options */ +#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 /* } */ +/* }================================================================== */ + + +#if !defined(l_system) +#if defined(LUA_USE_IOS) +/* Despite claiming to be ISO C, iOS does not implement 'system'. */ +#define l_system(cmd) ((cmd) == NULL ? 0 : -1) +#else +#define l_system(cmd) system(cmd) /* default definition */ +#endif +#endif + + +static int os_execute (lua_State *L) { + const char *cmd = luaL_optstring(L, 1, NULL); + int stat; + errno = 0; + stat = l_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 { + if (!(res >= 0 ? res - delta <= INT_MAX : 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.5/src/lparser.c b/lua-5.4.5/src/lparser.c new file mode 100644 index 0000000..b745f23 --- /dev/null +++ b/lua-5.4.5/src/lparser.c @@ -0,0 +1,1967 @@ +/* +** $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; +} + + +/* +** Mark that current block has a to-be-closed variable. +*/ +static void marktobeclosed (FuncState *fs) { + BlockCnt *bl = fs->bl; + bl->upval = 1; + bl->insidetbc = 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 */ + luaK_exp2anyregup(fs, var); /* but could be a constant */ + 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 gotos. +** 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 gotos */ + 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 gotos 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 gotos 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 */ + removevars(fs, bl->nactvar); /* remove block locals */ + lua_assert(bl->nactvar == fs->nactvar); /* back to level on entry */ + if (bl->isloop) /* has to fix pending breaks? */ + hasclose = createlabel(ls, luaS_newliteral(ls->L, "break"), 0, 0); + if (!hasclose && bl->previous && bl->upval) /* still need a 'close'? */ + luaK_codeABC(fs, OP_CLOSE, stklevel, 0, 0); + fs->freereg = stklevel; /* free registers */ + ls->dyd->label.n = bl->firstlabel; /* remove local labels */ + fs->bl = bl->previous; /* current block now is previous one */ + if (bl->previous) /* was it a nested block? */ + movegotosout(fs, bl); /* update pending gotos to enclosing block */ + else { + if (bl->firstgoto < ls->dyd->gt.n) /* still pending gotos? */ + 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 */ + marktobeclosed(fs); /* 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 (FuncState *fs, int level) { + if (level != -1) { /* is there a to-be-closed variable? */ + marktobeclosed(fs); + 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(fs, 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); + check_readonly(ls, &v); + 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.p, cl); /* anchor it (to avoid being collected) */ + luaD_inctop(L); + lexstate.h = luaH_new(L); /* create table for scanner */ + sethvalue2s(L, L->top.p, 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.p--; /* remove scanner's table */ + return cl; /* closure is on the stack, too */ +} + diff --git a/lua-5.4.5/src/lparser.h b/lua-5.4.5/src/lparser.h new file mode 100644 index 0000000..5e4500f --- /dev/null +++ b/lua-5.4.5/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.5/src/lprefix.h b/lua-5.4.5/src/lprefix.h new file mode 100644 index 0000000..484f2ad --- /dev/null +++ b/lua-5.4.5/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.5/src/lstate.c b/lua-5.4.5/src/lstate.c new file mode 100644 index 0000000..1fbefb4 --- /dev/null +++ b/lua-5.4.5/src/lstate.c @@ -0,0 +1,437 @@ +/* +** $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 handling 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.p = luaM_newvector(L, BASIC_STACK_SIZE + EXTRA_STACK, StackValue); + L1->tbclist.p = L1->stack.p; + for (i = 0; i < BASIC_STACK_SIZE + EXTRA_STACK; i++) + setnilvalue(s2v(L1->stack.p + i)); /* erase new stack */ + L1->top.p = L1->stack.p; + L1->stack_last.p = L1->stack.p + BASIC_STACK_SIZE; + /* initialize first ci */ + ci = &L1->base_ci; + ci->next = ci->previous = NULL; + ci->callstatus = CIST_C; + ci->func.p = L1->top.p; + ci->u.c.k = NULL; + ci->nresults = 0; + setnilvalue(s2v(L1->top.p)); /* 'function' entry for this 'ci' */ + L1->top.p++; + ci->top.p = L1->top.p + LUA_MINSTACK; + L1->ci = ci; +} + + +static void freestack (lua_State *L) { + if (L->stack.p == 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.p, 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->gcstp = 0; /* 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.p = 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); /* just collect its objects */ + else { /* closing a fully built state */ + L->ci = &L->base_ci; /* unwind CallInfo list */ + 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 = G(L); + GCObject *o; + lua_State *L1; + lua_lock(L); + luaC_checkGC(L); + /* create new thread */ + o = luaC_newobjdt(L, LUA_TTHREAD, sizeof(LX), offsetof(LX, l)); + L1 = gco2th(o); + /* anchor it on L stack */ + setthvalue2s(L, L->top.p, 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.p); /* 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.p)); /* 'function' entry for basic 'ci' */ + ci->func.p = L->stack.p; + ci->callstatus = CIST_C; + if (status == LUA_YIELD) + status = LUA_OK; + L->status = LUA_OK; /* so it can run __close metamethods */ + status = luaD_closeprotected(L, 1, status); + if (status != LUA_OK) /* errors? */ + luaD_seterrorobj(L, status, L->stack.p + 1); + else + L->top.p = L->stack.p + 1; + ci->top.p = L->top.p + LUA_MINSTACK; + luaD_reallocstack(L, cast_int(ci->top.p - L->stack.p), 0); + return status; +} + + +LUA_API int lua_resetthread (lua_State *L, lua_State *from) { + int status; + lua_lock(L); + L->nCcalls = (from) ? getCcalls(from) : 0; + 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->gcstp = GCSTPGC; /* 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.p - 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.5/src/lstate.h b/lua-5.4.5/src/lstate.h new file mode 100644 index 0000000..8bf6600 --- /dev/null +++ b/lua-5.4.5/src/lstate.h @@ -0,0 +1,409 @@ +/* +** $Id: lstate.h $ +** Global State +** See Copyright Notice in lua.h +*/ + +#ifndef lstate_h +#define lstate_h + +#include "lua.h" + + +/* Some header files included here need this definition */ +typedef struct CallInfo CallInfo; + + +#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.p - (th)->stack.p) + + +/* 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 function; +** - field 'transferinfo' is used only during call/returnhooks, +** before the function starts or after it ends. +*/ +struct CallInfo { + StkIdRel func; /* function index in the stack */ + StkIdRel 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; +}; + + +/* +** 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) /* function "called" 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 gcstp; /* control whether 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_NUMTYPES]; /* 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 */ + StkIdRel top; /* first free slot in the stack */ + global_State *l_G; + CallInfo *ci; /* call info for current function */ + StkIdRel stack_last; /* end of stack (last element + 1) */ + StkIdRel stack; /* stack base */ + UpVal *openupval; /* list of open upvalues in this stack */ + StkIdRel 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.5/src/lstring.c b/lua-5.4.5/src/lstring.c new file mode 100644 index 0000000..13dcaf4 --- /dev/null +++ b/lua-5.4.5/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.5/src/lstring.h b/lua-5.4.5/src/lstring.h new file mode 100644 index 0000000..450c239 --- /dev/null +++ b/lua-5.4.5/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.5/src/lstrlib.c b/lua-5.4.5/src/lstrlib.c new file mode 100644 index 0000000..0316716 --- /dev/null +++ b/lua-5.4.5/src/lstrlib.c @@ -0,0 +1,1874 @@ +/* +** $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 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_FMTFLAGSF) + +/* valid flags for a, A, e, E, f, F, g, and G conversions */ +#define L_FMTFLAGSF "-+#0 " + +/* valid flags for o, x, and X conversions */ +#define L_FMTFLAGSX "-#0" + +/* valid flags for d and i conversions */ +#define L_FMTFLAGSI "-+0 " + +/* valid flags for u conversions */ +#define L_FMTFLAGSU "-0" + +/* valid flags for c, p, and s conversions */ +#define L_FMTFLAGSC "-" + +#endif + + +/* +** Maximum size of each format specification (such as "%-099.99d"): +** Initial '%', flags (up to 5), width (2), period, precision (2), +** length modifier (8), conversion specifier, and final '\0', plus some +** extra. +*/ +#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 *get2digits (const char *s) { + if (isdigit(uchar(*s))) { + s++; + if (isdigit(uchar(*s))) s++; /* (2 digits at most) */ + } + return s; +} + + +/* +** Check whether a conversion specification is valid. When called, +** first character in 'form' must be '%' and last character must +** be a valid conversion specifier. 'flags' are the accepted flags; +** 'precision' signals whether to accept a precision. +*/ +static void checkformat (lua_State *L, const char *form, const char *flags, + int precision) { + const char *spec = form + 1; /* skip '%' */ + spec += strspn(spec, flags); /* skip flags */ + if (*spec != '0') { /* a width cannot start with '0' */ + spec = get2digits(spec); /* skip width */ + if (*spec == '.' && precision) { + spec++; + spec = get2digits(spec); /* skip precision */ + } + } + if (!isalpha(uchar(*spec))) /* did not go to the end? */ + luaL_error(L, "invalid conversion specification: '%s'", form); +} + + +/* +** Get a conversion specification and copy it to 'form'. +** Return the address of its last character. +*/ +static const char *getformat (lua_State *L, const char *strfrmt, + char *form) { + /* spans flags, width, and precision ('0' is included as a flag) */ + size_t len = strspn(strfrmt, L_FMTFLAGSF "123456789."); + len++; /* adds following character (should be the specifier) */ + /* still needs space for '%', '\0', plus a length modifier */ + if (len >= MAX_FORMAT - 10) + luaL_error(L, "invalid format (too long)"); + *(form++) = '%'; + memcpy(form, strfrmt, len * sizeof(char)); + *(form + len) = '\0'; + return strfrmt + len - 1; +} + + +/* +** 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; + const char *flags; + 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; /* maximum length for the result */ + char *buff = luaL_prepbuffsize(&b, maxitem); /* to put result */ + int nb = 0; /* number of bytes in result */ + if (++arg > top) + return luaL_argerror(L, arg, "no value"); + strfrmt = getformat(L, strfrmt, form); + switch (*strfrmt++) { + case 'c': { + checkformat(L, form, L_FMTFLAGSC, 0); + nb = l_sprintf(buff, maxitem, form, (int)luaL_checkinteger(L, arg)); + break; + } + case 'd': case 'i': + flags = L_FMTFLAGSI; + goto intcase; + case 'u': + flags = L_FMTFLAGSU; + goto intcase; + case 'o': case 'x': case 'X': + flags = L_FMTFLAGSX; + intcase: { + lua_Integer n = luaL_checkinteger(L, arg); + checkformat(L, form, flags, 1); + addlenmod(form, LUA_INTEGER_FRMLEN); + nb = l_sprintf(buff, maxitem, form, (LUAI_UACINT)n); + break; + } + case 'a': case 'A': + checkformat(L, form, L_FMTFLAGSF, 1); + 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); + checkformat(L, form, L_FMTFLAGSF, 1); + addlenmod(form, LUA_NUMBER_FRMLEN); + nb = l_sprintf(buff, maxitem, form, (LUAI_UACNUMBER)n); + break; + } + case 'p': { + const void *p = lua_topointer(L, arg); + checkformat(L, form, L_FMTFLAGSC, 0); + 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"); + checkformat(L, form, L_FMTFLAGSC, 1); + if (strchr(form, '.') == NULL && 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}; + + +/* +** 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) { + /* dummy structure to get native alignment requirements */ + struct cD { char c; union { LUAI_MAXALIGN; } u; }; + 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 '!': { + const int maxalign = offsetof(struct cD, u); + 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.5/src/ltable.c b/lua-5.4.5/src/ltable.c new file mode 100644 index 0000000..3c690c5 --- /dev/null +++ b/lua-5.4.5/src/ltable.c @@ -0,0 +1,980 @@ +/* +** $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 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 integers. To allow a good hash, use the remainder operator +** ('%'). If integer fits as a non-negative int, compute an int +** remainder, which is faster. Otherwise, use an unsigned-integer +** remainder, which uses all bits and ensures a non-negative result. +*/ +static Node *hashint (const Table *t, lua_Integer i) { + lua_Unsigned ui = l_castS2U(i); + if (ui <= cast_uint(INT_MAX)) + return hashmod(t, cast_int(ui)); + else + return hashmod(t, ui); +} + + +/* +** 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). +*/ +static Node *mainpositionTV (const Table *t, const TValue *key) { + switch (ttypetag(key)) { + case LUA_VNUMINT: { + lua_Integer i = ivalue(key); + return hashint(t, i); + } + case LUA_VNUMFLT: { + lua_Number n = fltvalue(key); + return hashmod(t, l_hashfloat(n)); + } + case LUA_VSHRSTR: { + TString *ts = tsvalue(key); + return hashstr(t, ts); + } + case LUA_VLNGSTR: { + TString *ts = tsvalue(key); + 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 = pvalue(key); + return hashpointer(t, p); + } + case LUA_VLCF: { + lua_CFunction f = fvalue(key); + return hashpointer(t, f); + } + default: { + GCObject *o = gcvalue(key); + return hashpointer(t, o); + } + } +} + + +l_sinline Node *mainpositionfromnode (const Table *t, Node *nd) { + TValue key; + getnodekey(cast(lua_State *, NULL), &key, nd); + return mainpositionTV(t, &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); +#if (UINT_MAX >> 14) > 3 /* unsigned int has more than 16 bits */ + size |= (size >> 16); +#if (UINT_MAX >> 30) > 3 + size |= (size >> 32); /* unsigned int has more than 32 bits */ +#endif +#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 < cast_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 = mainpositionfromnode(t, 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); +} + +#endif diff --git a/lua-5.4.5/src/ltable.h b/lua-5.4.5/src/ltable.h new file mode 100644 index 0000000..75dd9e2 --- /dev/null +++ b/lua-5.4.5/src/ltable.h @@ -0,0 +1,65 @@ +/* +** $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); +#endif + + +#endif diff --git a/lua-5.4.5/src/ltablib.c b/lua-5.4.5/src/ltablib.c new file mode 100644 index 0000000..e6bc4d0 --- /dev/null +++ b/lua-5.4.5/src/ltablib.c @@ -0,0 +1,430 @@ +/* +** $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 pos; /* where to insert new element */ + lua_Integer e = aux_getn(L, 1, TAB_RW); + e = luaL_intop(+, e, 1); /* first empty 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, 2, + "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), (LUAI_UACINT)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.5/src/ltm.c b/lua-5.4.5/src/ltm.c new file mode 100644 index 0000000..07a0608 --- /dev/null +++ b/lua-5.4.5/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.p; + 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.p = 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.p; + 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.p += 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.p); /* 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.p; + 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.p, event)) /* try original event */ + return !l_isfalse(s2v(L->top.p)); +#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.p, TM_LT)) { + L->ci->callstatus ^= CIST_LEQ; /* clear mark */ + return l_isfalse(s2v(L->top.p)); + } + /* 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.p - ci->func.p) - 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.p++, ci->func.p); + /* move fixed parameters to the top of the stack */ + for (i = 1; i <= nfixparams; i++) { + setobjs2s(L, L->top.p++, ci->func.p + i); + setnilvalue(s2v(ci->func.p + i)); /* erase original parameter (for GC) */ + } + ci->func.p += actual + 1; + ci->top.p += actual + 1; + lua_assert(L->top.p <= ci->top.p && ci->top.p <= L->stack_last.p); +} + + +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.p = where + nextra; /* next instruction will need top */ + } + for (i = 0; i < wanted && i < nextra; i++) + setobjs2s(L, where + i, ci->func.p - nextra + i); + for (; i < wanted; i++) /* complete required results with nil */ + setnilvalue(s2v(where + i)); +} + diff --git a/lua-5.4.5/src/ltm.h b/lua-5.4.5/src/ltm.h new file mode 100644 index 0000000..c309e2a --- /dev/null +++ b/lua-5.4.5/src/ltm.h @@ -0,0 +1,104 @@ +/* +** $Id: ltm.h $ +** Tag methods +** See Copyright Notice in lua.h +*/ + +#ifndef ltm_h +#define ltm_h + + +#include "lobject.h" +#include "lstate.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, + CallInfo *ci, const Proto *p); +LUAI_FUNC void luaT_getvarargs (lua_State *L, CallInfo *ci, + StkId where, int wanted); + + +#endif diff --git a/lua-5.4.5/src/lua.c b/lua-5.4.5/src/lua.c new file mode 100644 index 0000000..0ff8845 --- /dev/null +++ b/lua-5.4.5/src/lua.c @@ -0,0 +1,679 @@ +/* +** $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 mod require library 'mod' into global 'mod'\n" + " -l g=mod require library 'mod' into global 'g'\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. +** (If there is no interpreter's name either, 'script' is -1, so +** table sizes are zero.) +*/ +static void createargtable (lua_State *L, char **argv, int argc, int script) { + int i, narg; + 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)); +} + + +/* +** Receives 'globname[=modname]' and runs 'globname = require(modname)'. +*/ +static int dolibrary (lua_State *L, char *globname) { + int status; + char *modname = strchr(globname, '='); + if (modname == NULL) /* no explicit name? */ + modname = globname; /* module name is equal to global name */ + else { + *modname = '\0'; /* global name ends here */ + modname++; /* module name starts after the '=' */ + } + lua_getglobal(L, "require"); + lua_pushstring(L, modname); + status = docall(L, 1, 1); /* call 'require(modname)' */ + if (status == LUA_OK) + lua_setglobal(L, globname); /* globname = require(modname) */ + 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. In case of error, 'first' is the index of the bad +** argument. Otherwise, 'first' is -1 if there is no program name, +** 0 if there is no script name, or the index of the script name. +*/ +static int collectargs (char **argv, int *first) { + int args = 0; + int i; + if (argv[0] != NULL) { /* is there a program name? */ + if (argv[0][0]) /* not empty? */ + progname = argv[0]; /* save it */ + } + else { /* no program name */ + *first = -1; + return 0; + } + for (i = 1; argv[i] != NULL; i++) { /* handle arguments */ + *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 = 0; /* 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; + 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); + int optlim = (script > 0) ? script : argc; /* first argv not an option */ + luaL_checkversion(L); /* check that interpreter has correct version */ + 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_GCRESTART); /* start GC... */ + lua_gc(L, LUA_GCGEN, 0, 0); /* ...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, optlim)) /* execute arguments -e and -l */ + return 0; /* something failed */ + if (script > 0) { /* execute main script (if there is one) */ + if (handle_script(L, argv + script) != LUA_OK) + return 0; /* interrupt in case of error */ + } + if (args & has_i) /* -i option? */ + doREPL(L); /* do read-eval-print loop */ + else if (script < 1 && !(args & (has_e | has_v))) { /* no active option? */ + 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_gc(L, LUA_GCSTOP); /* stop GC while building state */ + 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.5/src/lua.h b/lua-5.4.5/src/lua.h new file mode 100644 index 0000000..01927c6 --- /dev/null +++ b/lua-5.4.5/src/lua.h @@ -0,0 +1,522 @@ +/* +** $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 "5" + +#define LUA_VERSION_NUM 504 +#define LUA_VERSION_RELEASE_NUM (LUA_VERSION_NUM * 100 + 5) + +#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-2023 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); + + +/* +** Type used by the debug API to collect debug information +*/ +typedef struct lua_Debug lua_Debug; + + +/* +** Functions to be called by the debugger in specific events +*/ +typedef void (*lua_Hook) (lua_State *L, lua_Debug *ar); + + +/* +** 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_State *from); + +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) + + +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-2023 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.5/src/lua.hpp b/lua-5.4.5/src/lua.hpp new file mode 100644 index 0000000..ec417f5 --- /dev/null +++ b/lua-5.4.5/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.5/src/luac.c b/lua-5.4.5/src/luac.c new file mode 100644 index 0000000..5f4a141 --- /dev/null +++ b/lua-5.4.5/src/luac.c @@ -0,0 +1,723 @@ +/* +** $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.p+(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; + } + 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%s",a,b,c,ISK); + printf(COMMENT "%d in",b-1); + break; + case OP_RETURN: + printf("%d %d %d%s",a,b,c,ISK); + 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 "exit to %d",pc+bx+3); + 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.5/src/luaconf.h b/lua-5.4.5/src/luaconf.h new file mode 100644 index 0000000..137103e --- /dev/null +++ b/lua-5.4.5/src/luaconf.h @@ -0,0 +1,793 @@ +/* +** $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 + + +#if defined(LUA_USE_IOS) +#define LUA_USE_POSIX +#define LUA_USE_DLOPEN +#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_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 + + +/* 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 and max(int)/2.) +*/ +#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 initial 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.5/src/lualib.h b/lua-5.4.5/src/lualib.h new file mode 100644 index 0000000..2625529 --- /dev/null +++ b/lua-5.4.5/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.5/src/lundump.c b/lua-5.4.5/src/lundump.c new file mode 100644 index 0000000..02aed64 --- /dev/null +++ b/lua-5.4.5/src/lundump.c @@ -0,0 +1,335 @@ +/* +** $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.p, ts); /* anchor it ('loadVector' can GC) */ + luaD_inctop(L); + loadVector(S, getstr(ts), size); /* load directly in final place */ + L->top.p--; /* 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); + if (n != 0) /* does it have debug information? */ + n = f->sizeupvalues; /* must be this many */ + 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.p, 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.5/src/lundump.h b/lua-5.4.5/src/lundump.h new file mode 100644 index 0000000..f3748a9 --- /dev/null +++ b/lua-5.4.5/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.5/src/lutf8lib.c b/lua-5.4.5/src/lutf8lib.c new file mode 100644 index 0000000..3a5b9bc --- /dev/null +++ b/lua-5.4.5/src/lutf8lib.c @@ -0,0 +1,291 @@ +/* +** $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 + + +#define MSGInvalid "invalid UTF-8 code" + +/* +** 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(c) (((c) & 0xC0) == 0x80) +#define iscontp(p) iscont(*(p)) + + +/* 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 (!iscont(cc)) /* 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, MSGInvalid); + 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 && iscontp(s + posi)) posi--; + } + else { + if (iscontp(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 && iscontp(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 (iscontp(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_Unsigned n = (lua_Unsigned)lua_tointeger(L, 2); + if (n < len) { + while (iscontp(s + n)) n++; /* go to next character */ + } + if (n >= len) /* (also handles original 'n' being negative) */ + return 0; /* no more codepoints */ + else { + utfint code; + const char *next = utf8_decode(s + n, &code, strict); + if (next == NULL || iscontp(next)) + return luaL_error(L, MSGInvalid); + 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); + const char *s = luaL_checkstring(L, 1); + luaL_argcheck(L, !iscontp(s), 1, MSGInvalid); + 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.5/src/lvm.c b/lua-5.4.5/src/lvm.c new file mode 100644 index 0000000..8493a77 --- /dev/null +++ b/lua-5.4.5/src/lvm.c @@ -0,0 +1,1901 @@ +/* +** $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. +*/ +l_sinline 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. +*/ +l_sinline 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. +*/ +l_sinline 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. +*/ +l_sinline 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. +*/ +l_sinline 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. +*/ +l_sinline 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.p); /* call TM */ + return !l_isfalse(s2v(L->top.p)); + } +} + + +/* 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.p - total' up to 'L->top.p - 1'. +*/ +void luaV_concat (lua_State *L, int total) { + if (total == 1) + return; /* "all" values already concatenated */ + do { + StkId top = L->top.p; + 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); /* may invalidate 'top' */ + 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)) { + L->top.p = top - total; /* pop strings to avoid wasting stack */ + 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 one new */ + L->top.p -= 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'.) +*/ +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.p + 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.p); + 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.p); + 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.p - 1)); + L->top.p--; +#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.p - 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.p = top - 1; /* top is one after last element (at top-2) */ + luaV_concat(L, total); /* concat them (may yield again) */ + break; + } + case OP_CLOSE: { /* yielded closing variables */ + ci->u.l.savedpc--; /* repeat instruction to close other vars. */ + break; + } + case OP_RETURN: { /* yielded closing variables */ + StkId ra = base + GETARG_A(inst); + /* adjust top to signal correct number of returns, in case the + return is "up to top" ('isIT') */ + L->top.p = ra + ci->u2.nres; + /* repeat instruction to close other vars. and complete the return */ + ci->u.l.savedpc--; + 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) { \ + StkId ra = RA(i); \ + 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) { \ + StkId ra = RA(i); \ + 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) { \ + StkId ra = RA(i); \ + 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) { \ + StkId ra = RA(i); \ + 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) { \ + StkId ra = RA(i); \ + 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) { \ + StkId ra = RA(i); \ + 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) { \ + StkId ra = RA(i); \ + 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) { \ + StkId ra = RA(i); \ + 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.p + 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.p = ci->top.p) + + +/* +** 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 cannot 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.p = (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++); \ +} + +#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.p)); + 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.p + 1; + /* main loop of interpreter */ + for (;;) { + Instruction i; /* instruction being executed */ + vmfetch(); + #if 0 + /* low-level line tracing for debugging Lua */ + printf("line: %d\n", luaG_getfuncline(cl->p, pcRel(pc, cl->p))); + #endif + lua_assert(base == ci->func.p + 1); + lua_assert(base <= L->top.p && L->top.p <= L->stack_last.p); + /* invalidate top for instructions not expecting it */ + lua_assert(isIT(i) || (cast_void(L->top.p = base), 1)); + vmdispatch (GET_OPCODE(i)) { + vmcase(OP_MOVE) { + StkId ra = RA(i); + setobjs2s(L, ra, RB(i)); + vmbreak; + } + vmcase(OP_LOADI) { + StkId ra = RA(i); + lua_Integer b = GETARG_sBx(i); + setivalue(s2v(ra), b); + vmbreak; + } + vmcase(OP_LOADF) { + StkId ra = RA(i); + int b = GETARG_sBx(i); + setfltvalue(s2v(ra), cast_num(b)); + vmbreak; + } + vmcase(OP_LOADK) { + StkId ra = RA(i); + TValue *rb = k + GETARG_Bx(i); + setobj2s(L, ra, rb); + vmbreak; + } + vmcase(OP_LOADKX) { + StkId ra = RA(i); + TValue *rb; + rb = k + GETARG_Ax(*pc); pc++; + setobj2s(L, ra, rb); + vmbreak; + } + vmcase(OP_LOADFALSE) { + StkId ra = RA(i); + setbfvalue(s2v(ra)); + vmbreak; + } + vmcase(OP_LFALSESKIP) { + StkId ra = RA(i); + setbfvalue(s2v(ra)); + pc++; /* skip next instruction */ + vmbreak; + } + vmcase(OP_LOADTRUE) { + StkId ra = RA(i); + setbtvalue(s2v(ra)); + vmbreak; + } + vmcase(OP_LOADNIL) { + StkId ra = RA(i); + int b = GETARG_B(i); + do { + setnilvalue(s2v(ra++)); + } while (b--); + vmbreak; + } + vmcase(OP_GETUPVAL) { + StkId ra = RA(i); + int b = GETARG_B(i); + setobj2s(L, ra, cl->upvals[b]->v.p); + vmbreak; + } + vmcase(OP_SETUPVAL) { + StkId ra = RA(i); + UpVal *uv = cl->upvals[GETARG_B(i)]; + setobj(L, uv->v.p, s2v(ra)); + luaC_barrier(L, uv, s2v(ra)); + vmbreak; + } + vmcase(OP_GETTABUP) { + StkId ra = RA(i); + const TValue *slot; + TValue *upval = cl->upvals[GETARG_B(i)]->v.p; + 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) { + StkId ra = RA(i); + 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) { + StkId ra = RA(i); + 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) { + StkId ra = RA(i); + 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.p; + 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) { + StkId ra = RA(i); + 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) { + StkId ra = RA(i); + 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) { + StkId ra = RA(i); + 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) { + StkId ra = RA(i); + 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.p = 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) { + StkId ra = RA(i); + 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) { + savestate(L, ci); /* in case of division by 0 */ + 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) { + savestate(L, ci); /* in case of division by 0 */ + 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) { + StkId ra = RA(i); + 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) { + StkId ra = RA(i); + 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) { + savestate(L, ci); /* in case of division by 0 */ + 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 */ + savestate(L, ci); /* in case of division by 0 */ + 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) { + StkId ra = RA(i); + 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) { + StkId ra = RA(i); + 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) { + StkId ra = RA(i); + 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) { + StkId ra = RA(i); + 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) { + StkId ra = RA(i); + 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) { + StkId ra = RA(i); + TValue *rb = vRB(i); + if (l_isfalse(rb)) + setbtvalue(s2v(ra)); + else + setbfvalue(s2v(ra)); + vmbreak; + } + vmcase(OP_LEN) { + StkId ra = RA(i); + Protect(luaV_objlen(L, ra, vRB(i))); + vmbreak; + } + vmcase(OP_CONCAT) { + StkId ra = RA(i); + int n = GETARG_B(i); /* number of elements to concatenate */ + L->top.p = ra + n; /* mark the end of concat operands */ + ProtectNT(luaV_concat(L, n)); + checkGC(L, L->top.p); /* 'luaV_concat' ensures correct top */ + vmbreak; + } + vmcase(OP_CLOSE) { + StkId ra = RA(i); + Protect(luaF_close(L, ra, LUA_OK, 1)); + vmbreak; + } + vmcase(OP_TBC) { + StkId ra = RA(i); + /* create new to-be-closed upvalue */ + halfProtect(luaF_newtbcupval(L, ra)); + vmbreak; + } + vmcase(OP_JMP) { + dojump(ci, i, 0); + vmbreak; + } + vmcase(OP_EQ) { + StkId ra = RA(i); + 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) { + StkId ra = RA(i); + 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) { + StkId ra = RA(i); + 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) { + StkId ra = RA(i); + int cond = !l_isfalse(s2v(ra)); + docondjump(); + vmbreak; + } + vmcase(OP_TESTSET) { + StkId ra = RA(i); + TValue *rb = vRB(i); + if (l_isfalse(rb) == GETARG_k(i)) + pc++; + else { + setobj2s(L, ra, rb); + donextjump(ci); + } + vmbreak; + } + vmcase(OP_CALL) { + StkId ra = RA(i); + CallInfo *newci; + int b = GETARG_B(i); + int nresults = GETARG_C(i) - 1; + if (b != 0) /* fixed number of arguments? */ + L->top.p = 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; + goto startfunc; + } + vmbreak; + } + vmcase(OP_TAILCALL) { + StkId ra = RA(i); + int b = GETARG_B(i); /* number of arguments + 1 (function) */ + int n; /* number of results when calling a C 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.p = ra + b; + else /* previous instruction set top */ + b = cast_int(L->top.p - 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.p < base); /* no pending tbc variables */ + lua_assert(base == ci->func.p + 1); + } + if ((n = luaD_pretailcall(L, ci, ra, b, delta)) < 0) /* Lua function? */ + goto startfunc; /* execute the callee */ + else { /* C function? */ + ci->func.p -= delta; /* restore 'func' (if vararg) */ + luaD_poscall(L, ci, n); /* finish caller */ + updatetrap(ci); /* 'luaD_poscall' can change hooks */ + goto ret; /* caller returns after the tail call */ + } + } + vmcase(OP_RETURN) { + StkId ra = RA(i); + int n = GETARG_B(i) - 1; /* number of results */ + int nparams1 = GETARG_C(i); + if (n < 0) /* not fixed? */ + n = cast_int(L->top.p - ra); /* get what is available */ + savepc(ci); + if (TESTARG_k(i)) { /* may there be open upvalues? */ + ci->u2.nres = n; /* save number of returns */ + if (L->top.p < ci->top.p) + L->top.p = ci->top.p; + luaF_close(L, base, CLOSEKTOP, 1); + updatetrap(ci); + updatestack(ci); + } + if (nparams1) /* vararg function? */ + ci->func.p -= ci->u.l.nextraargs + nparams1; + L->top.p = 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)) { + StkId ra = RA(i); + L->top.p = 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.p = base - 1; + for (nres = ci->nresults; l_unlikely(nres > 0); nres--) + setnilvalue(s2v(L->top.p++)); /* all results are nil */ + } + goto ret; + } + vmcase(OP_RETURN1) { + if (l_unlikely(L->hookmask)) { + StkId ra = RA(i); + L->top.p = 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.p = base - 1; /* asked for no results */ + else { + StkId ra = RA(i); + setobjs2s(L, base - 1, ra); /* at least this result */ + L->top.p = base; + for (; l_unlikely(nres > 1); nres--) + setnilvalue(s2v(L->top.p++)); /* 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) { + StkId ra = RA(i); + 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) { + StkId ra = RA(i); + savestate(L, ci); /* in case of errors */ + if (forprep(L, ra)) + pc += GETARG_Bx(i) + 1; /* skip the loop */ + vmbreak; + } + vmcase(OP_TFORPREP) { + StkId ra = RA(i); + /* 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: { + StkId ra = RA(i); + /* '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.p = 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: { + StkId ra = RA(i); + 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) { + StkId ra = RA(i); + int n = GETARG_B(i); + unsigned int last = GETARG_C(i); + Table *h = hvalue(s2v(ra)); + if (n == 0) + n = cast_int(L->top.p - ra) - 1; /* get up to the top */ + else + L->top.p = ci->top.p; /* 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) { + StkId ra = RA(i); + Proto *p = cl->p->p[GETARG_Bx(i)]; + halfProtect(pushclosure(L, p, cl->upvals, base, ra)); + checkGC(L, ra + 1); + vmbreak; + } + vmcase(OP_VARARG) { + StkId ra = RA(i); + 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.5/src/lvm.h b/lua-5.4.5/src/lvm.h new file mode 100644 index 0000000..dba1ad2 --- /dev/null +++ b/lua-5.4.5/src/lvm.h @@ -0,0 +1,141 @@ +/* +** $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); } + + +/* +** Shift right is the same as shift left with a negative 'y' +*/ +#define luaV_shiftr(x,y) luaV_shiftl(x,intop(-, 0, y)) + + + +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.5/src/lzio.c b/lua-5.4.5/src/lzio.c new file mode 100644 index 0000000..cd0a02d --- /dev/null +++ b/lua-5.4.5/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.5/src/lzio.h b/lua-5.4.5/src/lzio.h new file mode 100644 index 0000000..38f397f --- /dev/null +++ b/lua-5.4.5/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.5.tar.gz b/orig_sources/lua-5.4.5.tar.gz new file mode 100644 index 0000000000000000000000000000000000000000..f4bf9f4930cf124e5ece057586fe58f5d28a507a GIT binary patch literal 363316 zcmV(wKuDJ2-yQ}D_}%{gOY(o$>%C+7AMCz6+@tZ{?qP55mD>63QF;3Le=h%T zm6f}iCYcIjup^4Xc&08(&-qr3v{pglcQfq;3+>K}MO2^Y6=4!9FAkIsMkb5!XL&=z zS?Sa7+;y0p`$nj1U7|JuBsRS!j5N6shk}TAD8++x6D!@YJd)P9Zs^Rr$e0F*H z_wmiG3Ud`F1y(9=k|$AFXq9@!T+pR`qr~?jtj}h;aD^(h@K$Q+#RcKFpq=fGmsdCE zjD>yCrx!k09Oi|_f@N6DvB~A9v%lZn+>G1&>+*bf*XCvP)W;JM1-r+>sXKR_8p0>4 zTjp7pv8vvG7+#;K*ITt|+ucbRSL4I${*&=A_MHvR;UmDeNboTw(2Yt zMbB!&`PumF$ppAp=Ud<-Q~>GtZ6Qdt42%{J_)x_%$6G&bF?5(U>0O19pAs_Fizn#R zhBgr)uHJy;OqE3#g+)k)cl9F_?nEu_VKub#-PMW87OFEfPGN9;u5Lc6Pou%z+ADNA z>iR}q4+iJt8jRmKyZ$o1z_9fh7sHXd99|Dp%_;Pg_(8{^j(uJEhTNE!@d6{`29y^* zs!0yV_1*VsnrThHXFAqd=&LZvA+ET5lz%(q{qRde)_#&dss$Y6lDrJ|fL(i8Xxxfd z)RoE^--z`FW0W~`9vYaI}pR`&+Y+D9ScXq$tiM%t^d^N5?5+ z%h5Va{Mz6mZ+drCBlE@iOiy$ECQXg`OiOeACOwV$Ohh}v6}pov8pIfVsg~pq#yVQn>(69T>qoM%yY-{B{z@>7Arm%@3>rfwS{imYhD@L| zoLvt!f_O9VJ)N`>(VM8f5Z0SWz7W@&=)Mr#pGSN%xU-c%owga-`_E6?2wUO^o=)2c zVPcc5N@ddfS;weN;1vkmsee@MVO;G=UE*nmRQmDcCH}*OBMhFr#4nRHHKz#QYd*W6 zAQL34@;(9+a!N|ybG5~(Caj8VCs$=00K&TBIp7oN4uZ**DKqgCNdt$Rt zsZSVfY3!X$s|sS<`QNT){`~yf&$|AnD)0A!@vruOc6SbU_7C4t{lC*Y__P1>M|_&{ zmt^v{hVf7OKL>}0hp&3Qckgx%4>3ahpS_*EcYpSO{)mtJwWVGUgCnUUP;R#$RL|Z0 zUcm%=UHb2x>g^pJ>>cgzDDX%P9#i$&amN?bPUx$iYP~*33_5yt!RwaejxN;o+10=y z0P1Up%M?FZqzD)pkB+`v-`tLdBgg$9Mbdvb?ocHuH;uOz?bH!Z;fLa?B87lG|)gXeRsp@mJ%)+A3vF-2B8Z$<<9m=qHR(dmyss{Dk zB#gamWx^~Hg2D@9nuTz00HKVWm+^h>aCD|Bd!iMA%n&?1#B{F6^rQC6LZjk#FK-=c zIW4f0@`48sd(N;qqG`1$L6BXQm+2#C>g9Gn47DBL3#BY*TAq{{N?tz+kPKwWLV3O) z1{#}2RPJZk2Lw^S3TQaVblTx+HeX@JBL=m9k8MyO*I`$Qb+||)P%q$x28hO)Xy2n= z0w`dXSEwSrSbD2mRlE@5**4g7d%SJ zA}s}2eG`KpU|^Su&kk{vaz6n&3m-H%IuPb=uHr4h0sW6MeDESIy-VGg%sa?#uJd7~ z0zLK0sAxMhSVxU|rZDsXl-!9|!l-IH6Z~sAC+duSF_~*ZY(kWO?Ieyk4q^ZE8bJO8 zO5jkn=uwy0^Rpz+RS-_6IwS18%%6v3TxG^hEU0UOd|!}-HtQ_*xDUR7wbyNS?Fd5Z zAl+-|7g%BNUCuRWY^;}6qXvsf*qCkFH82Fqr%}y9Rf*o5TZ`0#7KIRjU>!-P=C@2` zKugx>2ph;@-mtHPlO5j*ry{E&z$glH78G_hf)!ep^FTZRmHSetvZuc<@Sj*!V!DQsYhRkRX}nO z)~DR4Lc~O}9xEUdSt?z_gCVJlYBAuJV^pw6pdELjiEYPpNG)HC&NemEb+*2&JF5h` z_4aG$ZHpmu{pDqW(QwgXazGG$twBkGOHv(g&gbw%9%2E;y4&o7>b61+5_rP|zTBW# zGc#ozw6iv2;;xBD#tA=TeI_)*O65?41W71Em}CSrtXajvq|B{FS8A2As4NC$RjP7p zm5Nm_UezJ8zykKH6l92J&8WnYlipK_`n=aWa>!+uX`wCPWhgED3G92dhOM(K$#Stn z;luw#`v{>;?YmCYf+EYz>=uMMAw!m1ZpZ`*Mv8QUyst8ziicD+`CV*nJhjZp8arr zGa3*3BWKWLEQl(jfHNK)K~|4Yrr0ZzY$Z$2K8-JK?ncg?tA;u&b1w=Pxj$dEol93; zxX>W=F`Sh;%yf{nou6FQN0@;sBkdpDd~`PIKO`v-51;b>hBd}7)qg1Udi%S()%_2; z3xGGhgTp`Tzdz!0{Fn2a{`kx7KwXTlF4gU)50}HfYIVBZpZ5CQ?)ms!2KL>Zo*Gjj z6_O5nQMWs|Zk;;EG)iBCvvYinhvUn^DP<*4Ds`thpMnRvV#PY{%D8iUIlTT+-3=~J zT6wX8Le8}=T8i*EX;HxI`gz_`7k7h?CoQrSdi<5kj4qp%SA+2xC>h^&2LJYH`1zz| zTz02erMjj1H`n9A_1Nq}`v0Diwk+4hNth>{@4h?uzSEYo@b=6A zofk!V)a@>pOV^lqw{?0vy!t_n?)o4lnI-NloVMUA01SM>X!q>Yd5L2LuSZaBPo2q1 z-6e32h{H`=M_v{FtS)q%h5sn^hRv&=yeQBM=(t!uZ*@GnI=h6}`boOV!r8n~Z+!fG zk0O3|=MB7DK7Ws&dz7&e5p5_&zjGJDX@AT#CAHpz7e<^sbDx<#KGNbvZW0ma*i&=l z4$rbA3Vj{ta+{>Z+G5@ucfC^=G#m7s?l(Jlx#;S+BYcLd^b7ibgqf9Z5yy2A1+KdRHg zzNy`mJ2pna!SB~ROrPU<@3g0k1QldJG4!Mb%^k)Cr~72R#OCAfoE0k-3c8M!$uqfr zw3I*D%c1Kve3c2=ER|=JxqEq@_#uKhDl;$3sMjIw9jKMuJIY~kF)|yZ7KXdQ3Ze*o zPJYPe1Z@X-7B*c;L5ZxkQAP<~9?HTQ-R{Xc4Bgo%p17fdbOi{MMM4RWkK|#2{D9O0 zGFepjf;^iB3wvi?Ht{GMOrl6L&)d$zYdtQV(p^wdA@;v;2iF9k2pOV~@q=N9=_hBQ}!Edb(7Dyq&D0 z>QTCfb|P)UV<^)Rx)2}ZB3iYjb;J-%*SJpVrgB&yrUKv4C(^Zt&M@3C%=1qq2VCp#^3IfUkBwYdV?bn2C2P&ESr zrLZL53sk7Co6?00(u57)L6@>n#ZHSQ>OJ8|$YJFn48)yqF)5A`x&|P?wb0ByF4GF> z5mSY3Qw|nj<&~r!6L&w6$*dR>S~)1%Jjd~D|0-egAi#P8b%QT33RBAujN()jh4-fM z!P!DqWqAUK7)c?*REZoevK9B3Bh>E*A|JVn1qTNn+rFW6r2LQ*56BVmATTfUaAsSJ za8%~5DdNgJW{#&`$~AVC!&S6dk}8NA^}K1}SLp+(NnOBl03d)&hKj8wNpjz28@zoo z*I1-USazQ#EW54K4_=O7)=$8ulv24WWf7K2r$ZuFB|$Oe39t0cO3SLc|6;(qr@QVm zxe{KsPCxU#VYbdOg0%&|yO}XPiRv{ljNt-dO&Wa8x_@C>VsdGewto-zj2+~*GWSNt zd_!4|D|ikyAHz5l+czziHLSBJva5Y$B<%mfOeM>h7gs)eJR53Qqb^F_9S)PCDpxi;tCHQLxHl#Q}+Z``Y2knO@~Tc%%0e zK;a#!VW*LJ=@KfBHc z%2U>a*a_S`K{IiF#D;XIQ(Zk>DU;kqd0uLel`0A90s~eWKZ?R6_j1m&kc)R*l$mPKWVFb2kiabfc#Hn( zV?l?FCSjmI$k^NcFdUC;q8ZBB%{l{>`{6d7*fv`5DUM7hno=CLjb)f~lCx9N5nbFZq>T2_98o?N1k^JFS@k#|H1BfEQ?m+2`y z7JZ368XQsj&NbJ+6(}+_3L|VOrmhg+qVYrv3*ICMmN^_Sw`;j5xkl=|BkL;+8{|Bb z8LT06YcS^MGcboMh1KF1A|b=nD6`}QWw9>UIeDOR33VEzxkYJI)jj)m&)s+TTBmO) z)p^ekl#6Ve41rFAgv&M|0|9gz~8KFJzTl+D`V)UHK(~(<3y$;0j zs_x|@o-B!2%Xqi72yLmy91$Kr>$Yk^xbC*X#iA5F$k|K#qHfd>p~S%CT;H+Po4-Yn zog^i(XHR4TGD+gCBb@-gYhq3EXPqUv+IlNy_I1bD*W2x?IA_5DhlCb(JTNbZs5s_I z_=yc`>;Vxgg!C<>yC~sTFchZ~>39bBLhpg2jMzMEf!YbCUq~#l4Tag7gSK8Hbx~U+ zrpmJQcCGZR^;I~(iv#D`!TxiK*4wFTT5rdw8b^By+Lg4V5bLXYYKPwsGL|{ zb|1+u`2=$#8J)Z5_O?E!Ul5Cg(#SV_O_aJ^L28XbmT zXSYLBysX;+Yww;B+0@D)cqoooJWOMwr^B5^*-u)4{HJWsXmqVEXn3+X_;2?9wY!ZY zNf(7b@A?(BIjcv24ZbG_-PBV91!Br|$5r0X7AQ z{&@I4_rv!&4Pm*oP-wwf?75f_1~uW;moU?u4Qa)8%= zbWeFzymFcfH0u=vOysYO7LAwsW?7PTYym*m+@#L|G1V9L=tb+_Z zW3)G28zHVxRTJ00W<5bmFC9S-KYQqPyi>9g@I4!?m|#|}!G2$_X=fh!k-{sLJpp+m zF+_}R&4bQZ4C!J87aN%fS~Acx8b5nQX$0WWIQao`7}Q}=op64~8HQi3ni34G1(z+l z9DFUG$YsX~v8-6w>f?HKHF@9%LE+rj=o2E}%o>l<%Mx&QRddNwf^VBVj%tbmKQMWE3h=?W$X0bQ(LUQskb4*{giWp zwD7GH9geIRi2YvoBiaKa&B{qCIxtaK<6 zc-D`|ZWUpK1as_FnzRAS)f1O2yF)*P5m-0UHGk(s`xzgG7xk3(TT)v(2(+bxpw~nw z;HFq`l~m2FMp$#ka6-1|iF$$;9yp^q20kdx-9g-XAak!wYW1_u{$i?6{~}K_cLvoh zZyH#8G%O{F;H;YAXDCPAf79nxx5U5bBTxdRq1ixX5Z%-S&<0ur58g1ILcU!{C?_1s zg_ssIwD@6BB!?=nm4i6OGeRyY*`OSskHzYKFn$Pu!ST?te^qU2SY5`^)r46deB>|x|xIAuX)?5lh#ld*CDy4f&R&TuYanUfkz%lv8A zN=;3j)0W^(#8>Z&QcZQNk-5QAdlhDsT+0TdHP;gv$Yb4tPWwJx?-U`vA59hqG*4GJE2e z6&}iJ0R_dbGrLdx+&&330noBZq|3qMHSBtpn)^l^A_akCO1pWDbp_h-zATpw`G(=H zvaXs7_o4YBkDwFhBoMk~;;ote6^$zwEC;Q*4xu(9WA>bp32yU5BVo*y-dK4;*LDg~ zpa$sD3#H(@Z$$>a`__tC1kAXj-04Su6DEk3(C(L|m`4UXmqoh@Cq&|T+^q%nBF5?v z3`&Lrg<~&_gIlur(QJW z;@I^P%zOa%sm|LNL1eyw zzwH!c5C;WOF}x(iWau5dLDRsC@_dBar0`1N*JxeF@A+^yfpEM9K+!;77Tk#P^^!cr zdAMTc>*Afe)bg*|@ZhOwKCW+7J|3l%54YnfaN#=+oQQOcw|v3u*eG!dP-!fxrW6k& zg_nSRf&)!(i$Z`8`)?q&1MM?cVu4T@PL@=;@KuX71do#L3J5%PJZKb4h!&le_^r5m z;825>X``U92{YscFlSs0_=*fD{$Ur7tWP(?C~H;OBw@sgq>7VM*g^mrxZ5tqbhhnnS+R9)$_FIX%UR^q^4UA3{q1kPwEG4Vo7cJo35M)Pl z^cCA9#A~$hKBfdR(yuXQ7nClXfyE!{&JgLrwr6~k<({=qyY+)d4J-ty+@n$Hyy-v~ zizTdRW@l`=We&3+DKv|*k?3b49}P{#kvkkm9KyQrKIeSB@UunJgP~;Z@`YA8!SXt_ znzc$3qfN#@jUFFm@htI;7+Pw#HWDtn9v;`t8A6yMf8BP;5oU-8)hJoA@^2-sA^`{I zUGRZEFyD;ORXWUs=kXkU6>J^Ep74l~{~!xMxfKin;cq3xGnD&Y(N~<28(gP+f`(&; zH1lw|hU3Rm6D(L@AK6Q9tru75;AEKdTbY9?n{}R62u$~3jP9`r3T_Ecm zi(xFC=wJmDT<}AH%amvCzZ6>-3?KSFTaMagX~JHX@OUFJRCvt*{1F5J2}{gSYezAb z_%(N1xLRQJFN(W)T`%+Vn*3iFZCr!a1zQky%bDxW`vwsmb}AN;5MlvynyAmuPc4DY za$R<(KwDjwx=2pcVZvX`aN~eic^};5EXC>dY*CY$Uj>Ri8)vYV+=U4Od{+$3iCWfJ z1qc;)jCDXEL@q=s?8-Z8&2L z#}&}vVr&jeD#Pq?3KtCsI3b%)AX;6!rH6`Nf|!hA&VmN#8{v9Yy;2PPw4m^DJb&Zf zv2F})o<;gHKI=8rJx*!MkN3X(Uj6L2puYD8^GI`kf%Yjy5sJ!8-q6rxZ?Ey)9|W@? zJ}>ke<4u#ix@eVQ{IrY>>((lh*aM0If0J^B?i3K=a60@cq~;KpQi1Y8F;-GE8APdD zZkxMtBpw?uHO#7s_-z=xuRV!v?n0J1p!a=34h#TWMKl;EPQhXKC;VHb)( z0rlQGzMj8xABq~q{lHot1T8y3Hp&@6Nfx5)p_^umStY@PROwB$i4hYa3(>2Z*#IX_z>}RkBDv8~lQUaa5Z?xIX?=r845uj2 zq>osz@=Jta!XsPyYJe?tU5!hpMbE{bh&itOfYcJ@bpfWukpgfvR0r+sd)?{T%f#&M z3zx6__@e=kW}u0tpdVOiO9V{-Jc-4G`n#YzVWEuUrr%|SLf0%YTySDoLOXzT#3&!8 zI$0R9!~VK13E*#*1N%$`q9EsSD4);ER=*G_W}l_+s<4cqO0dTm#~uuTM+-58s6gjn zF+rY$#0lYkbrnk8^j9o9ZC6(%2EcSXOSSg)v`O@|+1gXC6%Sr-R|)E+6OyI(t`r3FGYd0c^zfl)f;L41P?O{8ETVq5D+w1L2iY*bclU4;jzNs0zap zr8|akZ(1JRkc?E2!3NYuATd#?^Y0-xDO#eRdwkmGice!Bz7K^0lnAZ`Z_MIrD@Wp) zZBa3Gmebj*gfhbZ-5?MwgW_)yX0Cm5Z!m<60{|(q;&NFx z3~dWVKf@2`efWFAD?8ol#-BbF zKfE6wJR1?2&c`u@srpYPO#&|pIyzB(Zz=i~wfG{Ci6^ZXQNSW6TtRepgY8r58sHt1 zsG{-Eq&kL284~go{!P7ovWF@V`5s7P$AKAfw7J+0T4g0fr%2g20;0QtiVze&%Bog1 zh2ZGYlO5)f%W8t?s*#>}jIS38FEAzzis@h6naoJQ1s_gB@hya3nCW`0=N=3kZ#RFM z&cHoOlZ3|6#+Yn>`S$A4R&ZZpwO*Hxc{g3X z6N%mGSx$;gj9c)@$7z8R+1(a^9B)kBpM9j>*NJV*K^0u{uRc!A%lfKYb9wFL8;G-D z-2da_v|zos?6zQ0o^#!6yb68PwO1vlem1XNp`8WrkygN2u}Ca|v#Lb{?(wUyr2+r$ z6z-#6)&^CCP__nw+{!$Hp7|pIU9zkyd;HacE@z0^n$+&JLMMKJ(b_p)re|o>MUxnr z*KcHC{&AZ@u>-q(Zmu`Az>VeHsgob5EzAQ-pZ@2^Ymz$z`k z66WR1sQ?$1`=_kld3yx^{}J1>VXBBnDQwWWYtZ>eY!Jk_7m2x|=j9?0vE%Xo^_?xs zH|=ZE#Ik{psS(~_yVLob-W@zI7u^BiP%G~FzxC*(sP?GSf>cm(yafFdBa|wiGvhT1 zG&yhdsaj*zr%H_CwncBFfw-gkW?L63Z*o_%o+iFVsUoXrD!O7w(3%vVlDA)2dHV&+ zTcbqYLQ^dNn$Q>!nagwe?AgC$6_ZW*O871rpG=h1aKS1d1cC?(aA{-UFkkv4jySly z%Y5Hxl+JSH+R6d&*hO+2bk{?$H4GZL$T@<)cWWd>1KPKc>e@)n|5`)3uwyFm>kAoG zwh>tLP)@o zAkpG*Q7o6`g4u7)2L^UXB9N_JtIWLV3XR^AaF;4onE1fNG)x}0_ih5#OR=#BhP6}? z-X87?A}fyeiM=-+BkRZuHm1a~2G>QN8fagO81qp+dRum7y{uSLVibMQgc-7b;fd-kV^JGZeHsI-f zuqdy#ZUrCQ8gGL9S#GgxV~Rv-q*0Ld)QzZJTIb?q%nUI>R_J zo5@aOu$_XnkBUaQEQ_}B^Bk=bCN8im-+RyyOpGCsi>c?#sTy0rFWdne#x4RT72Cfd zSTwNDvF@oxOzUD)O~Z79h|iI7!Y>xF@eyK4=>|GZoF;JMG=UQbFfdbA6-;eC7Z~sH zGMgJKjSn|iO#?UW&2a1ChQ4idSb5tq_=wd7N3-r@PkarXoi5)D{eJb9&|t%M3c(>} z8PFZ$)PArnC>n$0_16Y#!N)OHo~_thPfQUUiM9gV2I(rq7RG_d!RaI6wb5_poT0OT zo$H{^nH~vG7-VfxCzKL<$^3sto&~qgPmBkERU~!&f{(>y+aO*|LZ@&*AUkz6Vgp?v zflu)IagYBK(76a&&#p>!$4a7-D#SZ3B9K9eqsL)!vF9+ln9aw_f78 zUGHOi5i(pNB>yJ$`-l#rN-6j)hLE#Fh@U8mI;-h5jXbM`o<(;wu|`BNN{>_ih8=5U z6QaceNTh+-Sx0<{BzbP^NWiDS4QQPsw5y@b*WjCq_vM@~9%~OsH{TREc6N!!Tw99dzW2_1z)2t-bTY>RU}I ztXRePZW2jAfhYkJeFlo;j>4!EH5u6^ix~(}^fMzmlQ2h$ReO@csy*5J@>^z#ey&W> z2BYSogNmrxz(n08#iVTI0qEBa99RwzdMa>7WOu;AU{L@7mSM@Dr$QhT&!Jiu_-A3z z1SBVr;o*`XObfNDk#a*iuCp6~P-X;His-WImBu#n6I^oe=2RJB6ghp2PJ67zI_m-Q zx+Y5;EKEOaI$p|fHBvSTu_vX&y)`$L@M0)Mg~TEn+n*ux2pW#;xi#{flWrh=R_f2S zWDcU`h2|b6?IF_y2oV6-iqPPQodEbx2fjo!?7fO!*~7f#4pS`UudsSoKr0z zW1lw}d(x!`$Uf)3DwMW@l`lhaR7f3aexqV}ZED5%4%A9uYdc}PP1Q)qi?9+rJ%}El zr!KspP#tK}7u1xS^6yF@uOo)Z#2d7U3MN&VoR=(cOy~_>Tj?goeQUf}@y)d)RJVwURfwSQ)Wi4NqdgCO4EZ5PkXu7p zM@;2|Z=Vk>au|*!oa(C@gR7jH?3%D5I_x~Vu@JzvwWpJwBK~;Y@G_Dj z!lz+Tw3q*6SzFgg6;?J8BR+%VvQS7)E0Eq!ey|z|$_%97qBskLcsXg~QT2~NQ%Uo7 zKN(}56Tg^yHJ3;J3ThYsCGL6zUAys~+)N1I$P@0w=IZ@EWC>`lU=jJu888gQ0P9xp zvO(_Mm0JZLY-A5F_6Lm(WH=GRd8|1c8NMB0lr}p-{3xOt#}l$|T7r#sdm7bKuea>` zVwWHS4ZC0ZE$E0sq?AHiEY};pY1|Rrp@8gZg@pS-_}LZeXweCJRaC9!i^a7-C}U6n zv8Qwx+9n_*(7fRfW=@4bf+D-X_dD&82j%{j)- z`8h{dJ4!7i z{DpOJtq$9YVy?XD8m~q8!N1iXhFEn9)9YKS}Hutcs|e}&h~keGZ|Gg zikfCi3pDtc6(Z)1qEqtohePHe4yUug!*ky~+;^qTr`Z7X3p1)i|8n0PKN8iHdQD9R za{`1qx>=`~`CpR`@jIbswx@HFpy~-|uHV`eRJ$C{LC&hwDTxjb;q|AuqG}=6b1${^ z(%7yFi5GNsy5^8+*|PJH zl;kW7xe{E5Zz)^q+!FGk^u$#Urfa;AQA~APvMZ^ZS&{GsO2g;stJf>a{v|0Ig|-A7 zjug0$-kgQg8$c_7mV;p*qP5%xUFe}^%->2%CM5UXJ?F{l2b~@cnP@`>l!uR759k0S zzkt|YI;d9fIiS2H;&=K^{0VJ0t*7XgZNz~i8e@xl&fWI?6J(k z3I$tdjxf`v3PRr#Rt&U}E2TV!;wTP0M&pp6Q2Kvw{DzJ*Uqdu3p1Y)wxA^-r$Yx*C zDifrPvE71U)=(9(*T1u{!Ia=MHCF_&yR7N9gHhw)Om}*u3LmRrz{^N`;mw$ko*cjU zMk3I~Wx%Aw=$i*uGeyw*v3SsIoTsNA9Hgj-ZFp%|9UMa{NC)+0Ff$3o_hUo*3?c>< z$2-^yi)xXP=@wNi^3eG^wCIOd;EU*)UMG7l$#zjUrJXm9HOD4|0kZ6;))s}?92HMb6VI z0OiXNt8x!Q*1JfYDDPcs#=c$6!j4i36T4&3atK~#w)|tbyLi-#m@0F~F#VP>I<^z; zKIx7V+#Vhn-Dv<>KMHw*+~hq%8vS>$&yDL%wKgGg2z-1nDr$2h4`JrLjdY5hESN5# z38iQ}(nLuP(n~F|Sg8F*oM%@SAxg1}x_HzpZV(*P*_XtFb z#Lx5E?UflJ*=$<;+*rAzVbt+-N>#H^M^#G#&|O@}fHx(7h3@u64cUGX-@w{}?+8;N z+)(0z8hMKP4xg{AJqqnjYg`vV4(HCU37x{=ziH%*>tGnb+P`wIMzSiC3}4j(^F0o2o`2gJx5z1EJZ|_!i-ab?G+lhNC!_+{vg`x z4`uN_KV<^cK;b?nf+hGpV(bwzc%q5Z%qeao=ob;+I#`Ut=jemQ^k37B`a_tyjb#UJ z#E^5{Yj$vqMr|-6s;hldkUTqzjnMZj3w{hd&k;TYeBX%vQ&LoNLdw{1WqRC8M;5w-cPdt1^1xF4m0P2VJDRHjE(XR1B; zqU%X5G)kB((lQ_m0pjw)ZQm7`4-H)x&U_yI238X@*$UHHfoLpL52|!^(!BGJ9qRSu zRwghUd`tHauT(WcVuUJXxT>rmW%o26|EZ+~Y9?}ZmYzI2W6he>1(pS@IYk&dzRVdn zxK<*Op@i!q!!V(`1ll4+qk2_AE-Tp)&;W}8#7)X|piMnI5?@<8F@8<#Yn~+-rw9R8 zaM>qRrrCpDrYXyg&;Mlevr=lfPOkP$A_fgwtZQV5V-S2Yuyj+h!Fs`7CBRn1Ntha& zrMH|SYMdE{B-ntE9-31!xC(Q8Bd5f! zz`E#{XM7Kq@l8x7D9l!+0Kt4&tIFM(X-=)tu^v>dBK6KnuXI8dQV`3)-#L%&K&%xC zxc2juR`~hem(MlvULwVOB0V1veTCfm(AwgxUXe>2joJhU6{>SkT(kgzf`xgey9o<} ze1%HhDarl-KjkaZT!G-9#hY(dm>O|WHR}c{h^VG0HS#x70PIa`6D zWRKBI{K}ZV@_453xh1>LPQc<+8+%h2%%-SDvdNo-Vjidzw&>?q^xQR!%@Oj2VqV{a<{atxaha(-bGXYTO9 zHc}J4QN#qvaQ1+Pd0Ty3RTdE+Ihpo5bmU;ltOZ(K3&A+X=jha8otc3j13Diw|8`d& zEzVtp8NS&a5PaMfWkshB6${3ncz>gBoIuQ*&$l`{Dkc7v`OuxFfNa*XbI?+0^jKot z?w(zY89c2DyjY@Z1XqWQijUqE31)D^!r$j90a<%%_GJ<Ddu3+!3sqe1;o=~s0vv?D9vXUZHf`EjwV*P zz-p2j{D2@lJFh{VDI*o(e&*lPV<6r+d)plugKl^X3EilZkuy(1A~UVu5?8 z7;99K$=T;O^l7I-%hXdq!in0>P7PcytLWSe+d+#L98l46N)c?E9c6u3(c={5_AzmD z5#>7U1;E;xwD15!!TdaEi;N7pP~1}}XH|ZgdBCoi+BmD>cb5iHe@>qNfw9-K_I@7XEwUc`Pte)OL)uTLogOYl#T(Pcg zgW}VJ&EKz5ACK}TXcl#%`1H)xx4)%9@Nw`44~hGB&vkxJhhb>Pfs29D*Od`3?!lxU zEJ&Jqi&E$>3FW~-LAXS40TvEDP%sL0O2VcGV2DE&>sDddO zTAKYGF6e78$8U50CYyNd&Oc+fwFAveUu7Md<4OXFWm}+lj6BD z`lrmkWN%!RTe}d&~poL_Xs7(@!RJoC$Q3-vI9S7lZyfn9#9KD zK)359E6*!( zi)dokb4nG)KXY!BvME;>6Y3VV8)Dx$T)}I;3@j+2F{jF9<_95fAwOYpR?ZuX;`gT` zbXztQM|YsVhpMJjm~`%(`GnL+|MD~oj#PM){)frW@V}Lti8EB)4a9&UQ=qA0mE& zb5%DRsNMSwr0YZ{itIRHkn;5D^m;InBMkMU7mxjmp2+F=)z|!x2)5iV(}?jAofk9# zV^qR(lkOwa2zibQEI!ngPp+2{Z4X*?$iOc|eSV4BlpmODMMV61x#aX8yyD$`f_>6a z7VY1^c=Pt;^()P#&3~tE5#d@CN3mPz0MKUXjS?nQ-##V%3jg^D{_`{Z=dbXe|AGJf zH+mH*>hZt+6aV=Sddk$__}|RBjm3OMUp;$ZOP1{misAGoS*Mg2EJxeEJ5YL$R61D4`^clEXiUYW3&L9mB;Pb)T20}Iy z<~_8)@>qG|Ey{z6*zRx+wJm?swlwdnWqfmT)3$)jd;WmV{Q(V1B2bY~5+!L-bHs2> zkIR`Oi_vV2=1Dpmh#(H##|6dlhie)b5o%8gI46sO#AHmTqQi2J8B>J{27T)Lk87KV zKaca&{?Qa(ya(0`8my`96=s&8=j4;{VZtPkqXAY7F}brSDETIrP-L2~RBP<0YHH}e zm8%-S7(^@|WG-ZcglvB&uuXcuXwrGkuR)Uh@sB7sEFB=L@%#&C43uxtyST!5+*~!%Mop)ERm)G^x+NDekXwZHj074*+<7!lFcq9JN=j?G4PKLOc1=A(;%~eQk2p_YluGz+zVud(wq=%Awgs~>BqD| zbw0FVehyy-lhAnE37)7kb8%*AMH!DX8fLcnx_0AlFyimaR{Yz4C^bJA^|xM@sQTNN zVeseWhjMO61Xvm88#8{Bxr-^Ngz}YL$cBA@XhVQXHvm9DzrRf2#>7{dv>+@E_!~#2 zvUCIG;_pWKYE`w6w!4rhuAhEVBIazjat_kvJPQhPk{!6s$E*X%%C^PodY0K@D*gG* zQILWffkuh%qh>vhn#Jw<`I-Blr^-L}bI!Y%n!$(&QLX!i0rmsUIo$gY>r_}LMqfMC zgNPsFB|o6=bj7ydd6cVrZbd;)8N30Qvl9?^^ezRWTxx^{jHP7iofEvwreg-43-Vb+ zDkGD?p)DflP$MJ3lx)--aC^P4I8JXd-LGf+cos`}S*-ba+dv-u5^Ml9AP^@cmT7;F z^~tR2q=G;iSXDgOw~sO^HO*DvhmQ^(ZH>`nM1nEP+cehY626xaD-)D^o5U2_RkDFt z@kHJ8`Z`N!xXja%|IHT=JgjX9e>`|db_6cwpud>MzZpvGBog0-a@AcD>MOb3=^CV8 z!wX)KKg%B!^ZL(=gTqIA5B$SDdHCnOJ@e|HfAfWVe(>=$7f3=>Y=Tl*n?M=Zv zh}zJMX^Szq9Yd?}hBDQ0z@inS9q)W4ks=fBbsJP{@3x}WqWQX5uuLB?W($4Z~jHqFWWp@Jd zwh0s`>5H<-7^@4F^iVnaYoYvq_(wfrzDt#5tJ~OX#<%zvcq(`4^)k`xAM_deBzW+v zg$$=t+d|$9>Egk7wuGF;)KS|1O@8p3Uq3dA8_cqMb(VjYAAHU$=^6Zg-D z*RvV^>#G-E9e;gnT*KXRB_U*QspE(I?}Nt&pVNOHJRTo>UhW^_Uk}HR;FlNV*nRZ4 zJfIIBUOyZkynufnA3j>{KZZwtJQ)Ax@Zg)To;-g1`0(q4U;pswLBf*9PMCzoC^ou_ znf9~-F6{&g?WG{x$)QdBazL4=-h$hPPS$opIl-yLbxB@P zh((#W{Xuf=X%&3`gZ^E~|NXY-R; zEnqVPG=Lb(XwWF)z-$J^LSU@rH2+W;ik>Fhg%ir#=-7WR*`ZeBS3VmG4AWnbcLZJn zf`PnQpSv!*5zq9CpZ4IBJuv|6HaKHDIA+r*y*`Jo;S9!Go2nKK5pJV~{Sok;i6So)fvBDmx30&f^b@7l(|?h-b;k$<+7SfBzRO66s2QANuA)3K+aEY+;05hDuz>t z9N-sw3tSqAHb^Fi&`374#32{BcXJXiHYVKAQbt*jJrURsDnaA~Uy84`84L7BZ`)0F z=63gc5X-u?fJBUMOg2SA2$ZKAnT{n%BVpfHvIh`4NuUP`#jmjH4$lL&h{QDTD8-#7 zDUNwXDI#miSFg4L(dE}Dl>@8v@9_OU&2AKSdyF~1T(&o+23F=YQoNtxxdu!?q+?IM))!N+oOD zR2RM(y?=Cz)=eN*c7YuK4N~pm1*3u769^ly!Q9}qGY6Y{bCjt;QJf9&{A7iKiB@XV z4B+oXxZ~!rW*h{Lk4~Hr%cN2QQEQjL@+yf7?9w%>z5}MPZ4Af#X#41e+g{QxT17|v z`$T2~cvrMaqOz#XO6(iAVWu_g7%toWT`mwR7hIj#j6;G@G=tfCo*6269Cg%QjM^JX zy;MnPw*Vs)^7@F%kzxKNXb)Lkv5ndjjXJ8PQ>WOXwV0$jbt9qWJ+@ljjEY14HtSNJl?m z^a9Kn{?Nf6QCKhHe(+7+1qd*v98PY47B`n*bJPeCUYTCKMiL2pUp7pvPC;t!g9DqW z`#|*dW7@(aQ7h0z#ja-Twz?dm$uA+U|DEYtO+M)8Qm@1B>8@jLSiyG0#U^(h9&>eo8JwTq4LWdp_^v6oMYW zBrBA@4$%6sj7%%;pt>Kc8WqV&GKGivJdMs3bF9df4400+#+PNQ@cPR(Q>o9(nLBgc zN+-jFG(1mH$OxBW|E0Ed?gVP{|oUgq@)WMpeWDW$@|h_MhecqLkB#y?Z=99f>mRsgv(Aii3R1lLC?0Z51}jUKBJ<0J``ih-mZD@RIV=l2 zpGXjSBFqQ;y)O_;fGC$_Vq(4zK2!}@?0_hda0pESnrsJ;A-e*2^#?0pUe`-W&A!lk zyIy_3O~|;n;4_X%BFY64zJ`5>N1UK5!6P1GhOtEV(M%jgR%Am1sa1AXU1K2dD6&Q% z_4f=@>zSK`8b&~TVz3pF;hR$e6pse2q7;lJylP~USHezfSgPx%JsVXUh7JY)6BeEQ z5ByhTEPeVkc0~037+IpIFemaqR7A4F1{p9hgA<8tyTVK2A($FFm}ZzkI6g*p0a)oT z?*2q})f=scDlQsw@#3XgS4~zfFd3IZ{nZW-&G=Y*VA7K9pf2n1UX>5YwqqiqLK z9ZS?IY7UsVHj0U5zjCiXO|Ld>rje}2Vfzuis#_f0HNNXmbky^-rB6+Qp?N4n;TG#p zXphJS>c%F!*pva&T?-P3>~9nyXXNlD>H6RSSd_wK+tl$5wcXhAl$ILt=#vsI>Z`aV$^KNt@ixH9hki>L1uT)1o=Pxq9qj-& zHfjf8qj`$)kPI^8+{f?)3E(TtneH0$82JYLThX3$)jl?}-1{DftTyUDL*p|zBan#R zD;IiC4$`u~9>64pC3v&(pd!r#0pk}%C)7(+!^Aq4W<{q)Z1>3fZ5DRb$G`o&n`;6+ zUKI*pg_q<5XwonjlTmB5Xn#R6NEhJC)bXN|LQEK_1b`8J0A>zs2!Tzl=)$)ctp!x1 zbhpMk%7XKD5h_SpVJuQ;f2uSksL3b;uqL?je<;o`WexyBX$rohJk{?=x$?nK|>1(a#Ovhy@2AxQhAO+fI4_^^kZ%| zI78+4qikXB)g@&)wA{EJY8U{-{744m(jJPRA*Qdk^EBM%LAAI5_Yo9QX z1?00SCN~=N0Kv_AFXodG;F&ZOnusG@E=YC0EJLQ@z^)Xp$n3nPd;XT4$_{kYz}xPm zjKr%0rb?vUn+a1p?Gr|zOIFZDc}|qSltLGY%Mo=7nkk9^cDf&Bl>5}DABOnDd{tBp z0a=;rQa6MruOr#yN1!r^Xu;pFCF)wp2It66!};&*JLFObnmyEo9j;F#&l_M2CkF(;7*c0%m<3rtL;2(eHFgaaHbElAv2tFKji#m2+(x@yD1Gkf^) zfw<-9OT6U|UZ4+aa4h_lVU$^_4v0Qz>y^aWyGSWPEY|H&{O^&z$uWr)=d_@n&@-nM;#uo<8wV~frlwuA1PX~^4ERfk z$U^FSVX=*9zh;XJ*OGApIhpZcj6g z4ehK}&526KJ91vqlSL!~<&M(Tf5=B>LnpmXVY=ZqOwq=BC`wz^-A#1lISpAI{FFSH za%IWs95>23)-}xrZ%oEkmkaOkv2$mz1yM$eV?~yg@Jz}%oNm`m})&OQNMmues)1o2js=|G}e^%~u9I`ey(cNF$?*5vy zl96s~Zg6z_#@tw%46E@8QuWY^;rwdPLmxIMB3>J^27r4z&9d;~m&liZkKM&jmg;i? z0yh2{7}?-!#yBdUG#IY-DY*+Qw-8aN;4GQg##rwXB3?d+uZ@%o8L-Jk$?T{`^#x_| z%I%1&!U?W#B532v61>HZ-|@l2z|;CLpvLbhm69_y=Y^VJAGcFSSMq5+v@4}(`LW?&)NU5Z$nXZSh}aH>TKhg z$?w>s^TcGXG7{N%)Iya6Q0*+I%&WGU^a4Q24 zP2IErV`s_$?zLOu*?<;@^1l@bI+QR16C}ce38QP~16Y$b7@>hnDPa&}At*67kf&a@ zr?#vS;w=P~sj=|JRJ>!%q!`cIfgi?4TS>QB}%yhxDkdjH_?b+ zBCye%-GNsG;r|dL%oNDUnqp*`$0#I_Z>`cs)kBCk*106Eu-Q;t9F1L5=h?1k@T6{%6Lm^jTnxMYaU_ zoKkHT1PbK9t z@;dlAKIQ7zgO-RDKxy0w-`b0j7w8Kw~%P-A=i`VajZdmIt?#PgV!J zYGVSb9m(@ylT%ylVrse>z^!CS5cNY6H#rh^pFixo9Sn^in9d; zIqQ1RPmlM$G$_?hupdamv!bac0eIJdBLV}OS24k<6vSNmM@HEFBNTQ2u=!v72d{`Q z!9QR+q_@OHsE=iY+{X705h|v^O!dnDVuC=&HVo9i0slU$7I3Au9a!rVA5khW;(rA9 zNcX3&Wzg@B8}{KlUI|wOr4tS5dNyiVaUAziwxfDxw8=yI&}R+;iCVP^XWn$HO@yW# z#aHw@+>DPhPA2VVbZa@kvBms`R8FTpIu*b!>Jf8|Ff|ZT3D#hlVs;f=B*d>W90gu} zR8l}4%ru#j-luWUfpA*7e&i3>TMnOM!YOD1a#o^&9U~Q1Kv!b?RQ}f#xH~AEFAQf@ zi<~DLzYI{}a@AOs6maF1=EjdL$er<-K)G;^?)8mdKCxduF*h8xMNORiU2xDBmy;^y zb6d>kd}I5uZ#1FoHU8-I^!4ro>A#a9ef9cu=fU(}%gBJdtO>w*+o7R?h%JFa0Jxh> z-qbDb3tQY5T@3Bxbci$##j#(0ub1lmvF0cnIUagmQcD+3llA<|?6>pkOE(C#4L_Ce z{v1XGxMs-?@7@Vt+z(!C)@Lo#FD2gnBzRY7jflW9@%m@M>%?9&t>9*ye!cTPgdg?4 z|EsVy^>jV26R-V8@S0EsReg;P$HOdae)lsNY9hr|mRP(CGrBFT01u?F=d^Z{G6-Bn z##8iEp$z!SV%j7?3-mR61l@lF#0N6_ekj$!>){3Ds^GkjDZoONs*rPav&!W!K9*9D zU+fYXSzdl}!(YR0=Kuf&rda zXDgV|NnN5xKy(DiKfoEuD@bJ?O%5DNkC<-H$3)HrkW7uL(Hw+yn{|X zN$b8xQDJ#j+2XP)Ay*McncTg7`5=^CJ|N8BJd}J4;eb4re%(R7>$zEcN>66l$;S4) zNd|-C;rSIGueUyII;u|cq`}MtfzXuiFatzK!2bKc9UMMRfAIQE;{E?jzUpM|eBA(` zCi#&hLkPa*Aj*qs)}}t;TnfP_6r$Pl#eXJ_3Zu((4h#r+2*;E_yu8QlQY8)}lHRG1 z_O9S@GLXsy;|4lY&MM-i6&e{iH7M?o#Kj^w2n_ECjTK&}bO?~3Q!*e?l?YYf!5b(Csf?f9(ZxJWLxG_4bF7T^2XWW=razn z)snTH6hKD*X~trNS%AtCOm~*OK~pZ68LmY?T!4wIJI5Xf=>MpFd{bpHTy>N++;BX~B8Pa(+>QC$E+5RIf7o6bPPIrdBW} z*h~$=uxCmp>+6iz0)n`*p!c-Y{3K+PixQ|+t}e>rwr6nOB%iiQ$%09M!$=|WLcdWSxbhCUdYx9ovnibhG$g?ed9Ek*2#Mm@yg zZwyunbX<(n_C6Jk9&agRf-1_A`fpC~rNnNwz@ng65^K-ewIZ!dcrYtxBrAAJXW**h z!5lIXZ3m$1Lz=s`7p85WaxUQs3ufJZp++1MB*BLS6S`rVg$&4S(4RX|36E>GJ4_=E zR-vm9@{e*YB<}zv8^kA)%CL8^_w1Pvk3-wY!R5W~?gdan^p$8dQo2CGUWD?oDNQ#Z z2V{$>IFY~|6EH5_q_U5i(rTia&MCn)q)fxa<{0g%CzbG^YGyuV`DEUfm}fp98D@cH z@NVeppx7k6#|Zol{(v1ZFRx2RX>%<~3yzW>$jmrG7{VHf>BVRIVaha2BSD9iJ$id4 zH)B?6;%fl=riTDB9~k<>OH7j_VM|0zti0fS@zg#*dOvoL$WcP^pisWMDr%^M3?(iq zNt8wg?v6BPk>b8p(J-?2K}ps~zGT6P<2_zyDx-`5oQ*`(DX;_qCrfy14|(7-T1Z`0 z#zZxEwWI$?5YYpSd^{O=O)WCGX>!ZllDb%57K?oV$WsVBrY}KOAW<6FN+!CkMzO_y; zyhM?%dE=QD5Y>Q*Avnj_82o8xlAkmDD$aW0w!%fpyiTGZ@739gjn1DkM65dBN5s;0L_+Ndd%Y2vh|`x?iW;(PXSEOy&Um zLD^hLztBGD#&=o@Y@}vFG!R~sf^s>siF9ZI)d&FeNNT11CB<0w7W-x)AuUfEWR&v> zp#@r0{URvKY(%x=UYK!ORD=lbh@9Wj}Stmh69*& zpN|X%v;FCzk|5cqt|)!ZJ5nbRNCj3^$;lL33zj^+@G>xu4go^>>) zU?sDXS%L-Ui`}h+XIg|0G_?9-$92OuS5VIMj{d56#a9WD`;z^`hdxp!OBSRfOau~y zOe!sn1(u4u4fM5StUWr6U$SR8t*o753`gvh_mCf8xhN>C4LL3-GEF&;*jEin%iaq@ zDJD+ZkrtMm1>LsD0Mc^bM9fq0MU*oP-Lxp9G1)a-ZVX+{X&@R@mU!R0YE}TeZ8qyw zd>8nOGGdtWc<8jCs%>IKtWcQPh{m`w?x9VH(^q-~dFAMis!2AF;|y=py4`7x;?^cA z>oiu#m!xN0CVvX|9ZY$$KdDxeHDtKr@IHdtkoAoAB9$yg*MNIZG%sU^`c7gR(8A5h z+#<&4gNHC1hm@U$|F^%7g6ZI)eFbeCgJJp=NR95^*(>%srMPGQ9ccBz!_GVIC!3}n z-tyJ)JG2R+w|q+WzPCW-(U&^)9S|Q?(0zVKc@+bRlneqxSk7~6k?u&Nq}f^*ElZ}V z2>@J>l|6)SDSB(1h98L1Q?I&5w>OT*_yGPYqYTf%t)4E_DU?mZ%hkCBDUuv}olyCF zp!6+y@E)fF$`Jg6mL0+h$?1?_+m6sgW$}XD zU77fFQNML>gOR)|E^<`N%mF)*- zt6@91I3{Q)#kmtEz-1y7`fx-U@?a|yF9~A7pJw3j9MRNL1qYr&HwAhE zs#n_!-;mn+`A}jKIt?8W{HIfGdW7xd=MOc@JS?`v_BRv5l2L!QDiPs~u}qB!*U*4Q zu4`@qu4!qy4)Fc94J0cmK{Eb5jf#5TX;{RN$%a5(?l`OD*o4JJwi0CfX2XcEP^;l2 zayoK5+khL&ZB?j{5*aKpbKL^G4rVJrAjYy@uIcs$qK@2jmymD0m`+!e!iw9AQkSz) z!X^(60=R3g!{*rIiR2eimMWj`6l7vUh9)FBcB}REz+GMP#Za^6Nrrdf+z=ME)j4>k zMQFPA1ftT*5aqKhfELfG-E`K9#Vl^D9AuCs%V&27BbeHEIASHdq%ZDlUot92GK}*v zgmL~rSzA!L8AVUj4aw>PyNOjhHnf=8#!ST{Vjd)qzS{-t@L#UnSXAvzcs#l>pkz66 z2%=p8|KnW#1Mm6#1pnhd@t@D0(HH-qfBh$a5AZNwloTfbE&63Vrhk7*$}#=%3I6jl z`X~PDSMzd8_mrjVGw$E zHJWxpg{E6Z2)B{f{zKo&j9+3UT>nMW)RPMJ9SgEKi=!HlDFz@~!3V(_`%QX{{l=-W zxJsUzAd&D=(HldeAx;#4O7``Z!@!L7y|7;gcgYc(<69xeXM;3ZvHUj?sfU>I7tHNT zQl?(n-?&WjJ_>~Z-A`GrNtQ~OM5H}}a3N2U8T8n&V#YyIQGC?jZRFBVSO<}1`d9uL z1W@TK6qf~m<$tHPl}q~jpInf8@H2l9)w*Ne!cB~a|Jcfj_zw!?(zb<72skGGu}f|< zO55Q_tc-^e%&BBZM(W55;-^$INP-=!5YpmH3+!Ds~q5sp~0uw3*FFR$FB3`=%n-bZ-)-AFMOB->}X_PEMykkhNYn5$f z+{0lxILeq~p3h4XC3Nprrv@c#5F8CKSVJn_Z!l^ejXI-F_O-ve#W^?_LR-&|^1bW5 zQNDMxca#HN{=q1p4X%fy{HI3`;f2FTNBQF?xuqTHjHfMs%Bk#gA-;n8{wdE|U$K9L zYsR(0SXuG|;P7=zS6@2Bmu`ZW4oOPuOUUhTX z3J1IF(^=DUx~Mo}>|syH*u$9pDLAB$!yJ*K3~p!b3nFmC#IH`(ZbDN=5!T{#O0;&H zPske08iJhiig-|3EdK?z5Kt1J>qks+tx^_t2@f-6`f=N0+95l`8Zp>9jUU)V#tOqrpRwA+qLoq}qY*MHsat+IuWBl^NDEVzjA;VuJ6aKIXX5w#n>bO-5 zOaCgzH5sZaL4>)dH1CNs_a$^= zQ-xLx$Jplsz3HPrqpaU_XC)Tw)KqA`0RY}bUN7F&@$zlG9QMUCHAt0>i=sgU+ zxgJ^l+5n2Ymzq2S(fb+B1nH z+>6Fyk>DP&h6_XaqCCy2aJdBwe*ncRy@_P6n~uySC57xeGW+r$SfwU7u8kzee8LsF z^HO{&J)F~VU-0hkJC)|!j6Zx8ex&83n5f6Gj`dGV5!uneA{I!`uo^N`ONVFqV7QS} zS^-#1d~KfPp5SL&DLb^J9T(%X@nrl9TI7qkkCu@!;66r*OFFvMkWtJ~s+?OC!k2J3 zV>Ew(&w8LF#gYrVHE{|V6J$0XFx_|z-b{>7L)BT*f+5!f6*Uff;l9FXVIP5*zM-*S zj6z%`Td`*ICO{hAo}_x$nTihvo8GvsYf6pQ+E6ONCf}5V!di?xjbtYSbE1c&#Mql7 zr6NHp%c{`4uc99rzRDq=to~#5C!3eoDnxzz_@P+AB@^*6la_LV zg@mBuL(e+Yw}Hkgbn7AumnKPXib8mlwgZQJUOxwx+lcGSFJ7GYg8WULt2q+d(a}df zSz&qgSX;MyLQkQ6ZRtm7S9{GUTQ3+E8cum3y!s)rlzJICn@+Wu0)x#?d{!Cr0G1T{ z3N6k}kAqwj7mvj7Ol)H71`WfJZtP38D4o8o=2N?*j zGG(c_EGRt(1(KKzVz&W$=xeq)MN=8}<@xc;m)2yR|8V@~`1=>9FW$VR7evo}Gz?xV zo;`9MeCFYi1NZmiVdsU%_UBRlWZ3hw8x`HB+q{>pSYK8SBhs(u%GcKhk5=e(0|{^4PjM! zYqkkr>B*P38x$PvtpX%p0isVbFp|jf8&I!#PKN+*Pf0ma`|39s&**O1Xsi%#V%eL_ zcTSd-8z6r`E$1&>RRFTVhQ@ri2$tax)o}TGCsksXuKV%aZJLlqx}v%YaXll4S%rWCG_H zM)FOknm{J=)cNQV<4ip2cSuwc+PT;)<$otsHZoDrJMJgaKvIQ?&P&}hy=SE8fXZ(n z3Xzl|-GEK0@tVwgK_)a(>NnIWq0SfveB3XjW(ENonrBNVnae}>|BrgIxc5m^iX`TW zJFKe7D*x^)`)6-$DZH=*zrA6&QUSzQl&?ZXYVr)XoN-X=18Br7d)RFNit zS=eQmQ>j3Lis@ctGOHx3rMGTd`4_hGFOs7kq@-e>dQWz=o=I5c@8L7wAV67wTHq7M z?wX=q+9sjwoUoi+?~r_pslV;k=Z32^N$p~!<3FRLPOOzA7~q##c~!1@3levgD-d+4PHLP74I5{A zCf@SUr!g0a1E~lkeFU`ddYkcM`r+IC;G}aX)n-vv&q__7We!)&?P1O^@0Vc{xj$Pv zXCLK;6PpG3M^Jl^X2hKb5;|b>r>e(z1+~s0%z%~cR=Fp@Rv0RpeEb{8gDt)^)~ zmFOVT!wRAaxusg0BhrRd2xk>f5a8bDQy^qveHs9=MOVu*W1Zb*tjF2lN9J)Q?H#TC zgi3aObDv1U3a?btlHznJELC8%g#m!(N8cY0b@9{PqghWb5NZnh=L)(EiDuzCL?T4i zQ>T+mi$i@-=PcDq9~C|WQ^rZXaZGGVnQmw#tf_S)IsV#tq-!Fx7wkY1>)sr!N=H?b zKxnc(l$HBH*N79jmuo}`dt9;i^ds8lh*l>|Iet- z>Nxs(0G|(2Uz4pA5H-BZl10qGgmB$yK<~#`^mS0gLH?=lgfHSC(4;pug-#Se0>Zg1 zbVz#HMtWQ3he4ZYuKfJKSCRqkXyuZWk{x7*t*F~uMvC~bmFBor<{ z(*l6`+-q`pYpAQKv5VD0is}?~Oa{ma;V2pvlWfx3HWfgUFsH2lJ}9Z-Ol}YjxuR zDCCq8o4TI7!?5sxJ%L(${i&kYQ%wSV4ChJ@8Wl9_(}Vb3*D(KPw=L3=LwQNvD4Sb; zkcDrj-ZlM%fNcN;)A&2}b{OUes*&{*md}V3Si3MWeVR2ZU{@8Z+H%why&=!}I^wfL zO739ZH8*9e877Sgj|xFgzQ(o)4lGV|`BjN&{(SHv?pmw}`2p9MOS&hIwre?Wz|G4LhQ{(Hmmcb% z&_K7p7dMwc_bDxK2P1}VX{vcCN^TaOZ;A#?KyTwl)S&mVz5;Cada<50mGV6a$#WVWQkI$*j+w z9|z3>{GM*3y!cR5b4t8RJNcr<010XgQZ8R!t``V4pb!REHidR#WxgQP@|a#r>EI<3 zD^Vxf#I#sfS-{$y!N}^^0F&w5)o~#Vruaw1T#C_n5JrI)&8spOYE($Pn(s-o_C^>R z?S_+d3a%GgE(w>3>Yj6rUKW#8oinTfDCZIDPsRe=ansy$9HGStud4VNE+*Qz%H-w^ z;og1$goqqOFk=d}Fj_;>7F!Nza^Y30f|DCLk__@var~zc&mx{#3O!$p}DNrHZIkN!BT?@f8 zh#y8Xyd$PMJMfNUpq5ZdnNE1%wMBfG5x)GT(Ix3il=tF4`jmG1n5?;P}^E zd;^;j5(AQ}#7J+0m1CnYu8L7E5k7S^KJI{R;vte}L5@$JAiXO2juCVB#LW$u_fTRA z=MZ;DU^D2{EwE|OH{}}=l@7}r`zuv4bsHvbgV}xy;SZhkpU^HbtpVt&S|Jpwp_kdG z0)wem{hG2~Krf#2naUPrYFougU_I}L^dC#GxsXTfE|I(yZrt0+cxcI9jkE?CLVBRB z#jGu}db}0ZCo<-%yEW=7E|VPd&qt}a0y0GuGUSln)?)A!7(y|1L^6)=(ea0rRrpsu z%Q|PTat~25Vn9E9&=?8qAiMPDH@PBcLCgoRD|7s--^vGQctdye4i0J4qGWNG${N;w zrZYv&#|^byHy60!CGda{D+&SGsF$w@$Yg{Y z`)bgSO>RwitDi!ot$5$J9VLbPS0N4~KB&Vb#)H(*iGM1ve6=Hjz=qhsfpQ z))dA_azm+dEMk~pvJ+pEX--t7b*3HJPxcSweCd6^r-dXhs1!GPLr$m-BM$A@Pd6m! zyNQo>^0!AUgJ4FXoWHI9Rz|oXbOnLtgeL-ku2nH&C5^~n2#W_gKvQvM0e6pb7aJy$ z^ZHnnb_Kf9R{+ECC_o%rC`sQegr4*|5L#~2Sgny-hJpi|QbvobT%g2W)ivHOfS364 zvYr;q&K`mBPQ@vNzDrG5$*ZO~b4^1V!qd1_0n*#YhUGJp%n7ze4}upY6cl77mI=IO zpFiS%7Icx6qo&(cOz1)GdvCI}S;tMTbRII4MCf_Pk12SKz0|OENER{QZEZvq*)PR= z2rb6xXfBX60q!SJA2Ep$d>QmqpC)cy$)gk0<_#mELjX|pc?sLFquYOf^6KsBaj4hJ zGpmErxQJjf(Xn#XXo?wFjquo7FMXIvqCgLoL0bE9*8gUhcJc6`&oL=EKB0a-h6pxY z18W%YlVKnyjRuZ{VE=Cr2jhyzK>~Y6qth!LjAZ24kH1fy5->xx7VCQF*@i=2_wV+V zEv*JMNm?Gs!35Y6AMbtnd(0IBg7z3Q%%C*_t`L(ljvqW;boF+SKAhkRbv&;-VF?)} z040(T#GGJ!0aRH@9U#)#(pUH<*q?nkb?`Z>0h*c?&IxXdUW+n0^ywE=xzN@C9B*Wv zRJ9B5n3AJ9>WHMNQFVbG)2s^D%Zz#M-H9_Vk3jVpV2g(Iw|hf_(TRH#VY5xSp4R)e zucG4WAxB66>4wo;Nh7b=dc+DQRKdYfhFa4qRO9T2pjLcIu*|CE!(njlPB6EFBI#@> zc7yFD{{y$lh)C##|n|C5rl@5z=4M96(u5f$1=G7Ew zB-Sdv2dUtdStMcWivv*5I2(8j??ZGopztaddE6sNCdDNIhDYXc`;>*?d0IH`8cT;f z_~W!J?wI60h*t+CA8Bgav;hv~0!MdfErN@jD3OglaF)8cVm^u9*=4EH`6X{4fF1V( z`WNZcYs&^KspoJJY{QA8CgCa*Y!L6YkY2XCCt!Wh>a0+m1(<=-!HecZW(Ov-Lwle} zd??`(;kRamY%k>zm0%XJy$eQH=ACv9S$+xDsfAJ+2u>l>z}2T}eQ>I5Sri>&4G}|G zsI8p7dj0B!RaNjo!U}}O&axp-U4c~0ns3OQj)|QvqU2;uEHa(SQZAU?dLw`nZTYbVjw&Ribc%J@v-u*c1ew_X` zQ7@(x2tIG?M9umz(0QTPC=!AaUXs$(EhYS+zxyvm>q>v07=TVMUM9QoGT9HA%VK?9 z%_}f{v$4}Nqb-C{60bE6n*6+2ofYS$#C3|K0G}+Gq(2y%Ut;2wLwF$q6RmM({p$Og zZ}zmt0|retPH)e>uekA_l79kLv&Kz{5`u@Cu>=dd`~v@*wWkt;rAQ2r8;=$?zRC$! zTR~{Blz`Kob4q$Zy6lA$l|l3Z8jlE6KnHLR^6vb?z&d@&MecPj_hf*o;)+xAfD%uq z6=TY!cZm*o4*=fx(J9fe6;U~o!h=^&|~-a+!VzAU?9M5t-lFPX7vC6p^(I*l?6 z=DvwG-FexftJv;2dA31LxL3H*(TD1%@0AiwqQ)jwV^=~n$y%FKt#rWBg4LlTqmr4s zAmA@ME4!0P=F=b)Je*0QjbqPs4k>8CC<4|r{AFme1M@m%w^HD1bglH8h?ZEi(}{f% z_c?A^*~wY7*}9uKv+juGeb4D`&-3T(e2=hQ4788c6VI_b;uOeEi`6@adWz_d!g?O6 z1Qlu^YyON6G9vB9K=OGynHulgd4j1_sfg~|;ky#Gn0;j()_i{tgsMH}rnt_=m79W(np z*gB_bJQc}gTz?$w5o`&T&{?|d!GZGh%hDjrmM@bX-Ad_nBBgi33H~DDG6A=pnFvJPD(l;r78Qf}Oc%v@a zD}cv!-B|Mj$XIf1UAdRlS}7wZ-g-Q<+*`B`)!Lxk-h#gHyA)zJ%;BAN?gejNe0%ct z^v$16UVZ)IkM@2L{1EJcW8Ze4iCkQBkSLPOlj!#3#0h-8M=N_aj zZ!atVq{_j-B{y=UwRk9qzjDHHP;qd_>CIByMUg$(9Y4Tdt(q5KrrPbV!v?IH%Y;wjaZ`Yg6+m$`S;X>@nyc zEtTbZA!Or- z%gw(|5H&0(PEy_3=O>tLscKbh&FoX`0&)0K<4*er{SqM^(t z9{FJ$xUD4Cu|IQII~*Ib3)=detSY*-=wm<@Ys7GGufBcx`m5uYZ#!M$=XdH4W2wr; zhiX+X$V+N+U7Hgm1(t*W_ZN`#F8|K0?>S%ao_FvpC#;czm{M#DLLU?(y*U5NrSjM- zED+L*K*=TL)`Ltp@ck8_G7!`!o<}qp;bJE$Ff_6@`SVXdJ<6K0SV4LKC3STpck<3H zg4cggClagYPDD*g^8CQ-oIFQvi|D#6CQJ;9EpjpoU3%y@;H)=fm&L$V92-gk4c03D z#I+4i)B=17qIlAe#%(6>L;@s2 zff0*{v%)LGQKo&tDipbb$PVz_fb*R$JmHsPom`GNjWu3zeqleghdB}?Pb#1f1)L!> zjE4FuzG)Rze2{Q@eh;lo+Sj@@N3r$OHCx zsx<&RK*Yaw%d%CPdmRR$gB5^2rT$LLE4j0oq=Xq&7BK@^%1>Uj_@W&~e$+Xc&^AO> zFa^U|y=qn6#@kwXUA1DtMl5pSLDFMLxD8>pwqc~XqRPT#Uv6mJiA^^ovQq%PH9KOa zHC+XDwZrV7(g1Po;o8$tb3+r*n};pn%xeURB%&QqGblZP9_LPuBLKze46f7Ti~-+` zXj9aMN@BAm!3)3}@FvoCIi^eI8R10udLPM~h%a zt{ACFr(*=w6fC6$aroY{_xzIc#V&Y%3$rr}BU%L$JFdGX+`NHDfqe}56$Vwi)zCCx zYN6AngO)q=j?F`MYyz&yVs{9wL;|06<3=DLUAUKmOj;9Nt@fWTG64;;h@42mOV}hC zb`*6*y2L9|+=La77qR2TLj;ug@!TJAma)g<9z^S7hEBCkRy=p}xZNAV4*8|qbv$iW zfGcJ~6heUJLE*4S*lJC(*IcCDR|`s#!{w=Vtm!*L?w^#h^*VsMybeGvgNH*_uH1a_ zQrn`ty?FEH&5y5ak@TdiuNAO1G0znpK-&xc{>ArE!R|??;H>wA0}ClCFw_;&&J^^d zDdwZyG2W)Gx^}q#i(2OXuiItXFl23YomcvVxW?@jzWvjy)8juzb<)FbwZbidwND9` zr#!NBqHU@1PbV*42Db}*(5r91fGf0+Uji} zQwc|3yL01`nn#xxug+Stc)O}dK=TAZ43>@|QH=$0R^ZXlQ{ic3y2dgBTpT^w;F^Le zLL?nL*y34QcD`E1pHXxjnd$r~#^^TI&B4r8E!KQpuqt{sD45!ZgCJldNc65$Go;8q zETc4Wri2J8XhaRcj(|4cYKL|k2(zme^}IgEEdZA-uu0fv0ihE!$fiIi6lMX-1NBxk ze_xe!=SJXa%TX|zkSL<^=A2;BkM@qC*&gbqjOSkj%yWWMck9oker#$P*3Q@#tc$i& z04$O~C~P9-;DTG2VZ{l{M6T~!FUO4cLtlwyg`5ADixz>9w_UOdzl$fB%$t{T5Q(38 zy|I!NYo`)B^4bw_(k(xXfHbB5mH{eiEy_Crn>9ny_QeI=ybe}bLsCqpi|=% z^G{w5^S?_7x)8a1_6c225Ashwliygsf0pY~9=sgou05Bd{9<@SAK|FO`1|kTG7t4P zn;!C2eT8zQpg~7;i^kXDcSOJ779vc0Vyks_n%$jp+(D*JcjZEsZi-?8Hgq6jFvmTD z&OjCE4(0oB=+Ga)BQwH*`Q39j$K|zC>DudfU{fQ2|GMv~;?4FRCMY>uBW&JLcN&;) zl0rntZA9q9t31-e-m7)iEzxZAHp>TOQtt-O{w@{drVm4t18r5_N>f}T*jR*$D%`%a zl`@nWWWGYlmo{o{T|+>tdxZ-JukIAcjLVaZ!t7Wy+4TGn(Jq&zoY7L|#1_-LtY?g` zL@3E>y=+PGM-AhuxXA|odX0-7xX&^00vYjW!IP|-q9+oT`Y3Z({kc=mZ$B_S?caR# zeJm-JT>9_L+Q+4TILhDCCOAm#0>)k=k0;)5Mrs#V?$cP_m7Q@DrfH(u6t~5cX27HrMlqn*IYS%MJzNF8`Bm9e z!YgHrx&7xj=E%9K#iy&ZxI~ysd13gRGzr%<=48TW1BW;;rntTK*9%C6hmoEXi!V)| z-*n^Zce)Y<79+ZZV#a6Fj-#yN*bA(bBgLtSdJj!p7>Io!IZkA{x^;7za)ri^9kj?1 zLye&@Sf9t(=LWt*O*S7XVa0qQJ6np?OYo^6~4 z@(`Je3KJkMx{JdLm(T&!b3;1q{aiyDRf4c|pS;idMH-&O`UQE?DkE_!bM%(>Oqi-L z;(61!p-hCqZLJA`QGjSE8pB@!DA+X2p6OALnpiK$orDum9|VqZted0{$Bui1;vbCX zQxuG<;oYUa)9zf+yBqJeYJC1YWqkhJXT>B&jZQY|9WiVdk? z+0)hoIb!qNCN`)#uXZl<|AE}!ic%c|P@ z@~8cJlz+OUoGKJ$`15Z+gZI7+Qp~T=>F4&$i0=quFGj!jg}Ve_8a|CE&)E_po#Utq zD3_@QgMyd0DHwPqx-rv(Aa0ls1%B5soA8O}T8HF>!AfOhc<)Kd%*aVkADiKjBDq=`W@w^*EF=HLERZCI=AT@k*s?SMoToz7q&Zv=? zamjaOTBu`0aPQwO*EIn&Yt-35M;$)HjJn*jzlGNK_O2n2P8OpQT>M-+vM z#V$HkAVpeSdVms-J1W{eJ%9D%%a=Mw-G1mjy3+v~E4n|&L+Np@`YpLf@cL8{8G5)^j)Q`a3enM={`u|dX{ysW2bLV-<-VqHi$>3M?LOq z{qXeos}T4>Pquyb&5y61pPsx9;70neCnQrp{_*XLH(wv09tR)G!=UEi=IGnpf!v>V zp!PJsX!0ZG7x(8-*yBw=AS_y*3rU&-;%aQ?Je~&JEo3;u3&tqx%%FgMXS}&u=JaWl zfsig7=&p?1UrLXv3UXHhKJBi|Mbyf_m8+V}A^vkF$V8vKp$-SxAqSwsblKe5S>lOJ z5mya+`WDrP@;N3ei$*}MZ=H5QGAf;Jy2r7qJ6q3Z6XVc;Ff;-U|31FEyAbuxzLo+!Qj{b0BYC7gG>QT6v}M%c1L2cUh#_&)@|0lQ5;nP zxuo~)tD6+UV&$~;K#PV4JFC!x!+#tMof>^Wcla{A!{egD<)S60^k{cW4fMDl$`#yq z8B^dsx&)g82xxcNxWe0z@NyzwAl+TAY6&5QtFP0SM@qrN#!q6k1VSXqQXYetN1hd$ z*;zc;+2>Vb!vQv8;WS{hFtjEho3L1X=l7;0sY+YV(P5fl+o#WSb-25->$P`@1Oc%a zj)=w7D|1T#cWOb9JbTv)!U>dih7TMC)Cr@pBAJqbYulm5KOBD@9GLi^3+`O%EKdo= zEUukT#j(RdTfOzX{qd`?9`|5FJu7zr2b%`7p04M$ zRP(D{Yx&{zAHrIG(Acie)Z_h3_>3P7qAWJ(peln>Sm zILL3gHotoH`ZTN?o@}UGq^NsK`uU$bS9bg=nml;2LuKwQsqEj2%jMC|6~2BG)%QAq zx$ji>`i<1~kDY7!W2dS=?o?NKJ(;f?z{~ntcOKBU-$jzeJ=jp^yqrM{QRV(Aqd9Mn z;Qx28@J(FdrcSOffIh78+|_s<*BC_CrZkORLig@&u$x<+@7$CgYaHQ=_{uEQKi+y8 z_9*A6JjG>B<(8aJc z{!cC~vT-s*)Za~B!tF}3lByGXlqEZa6wsLbv{hjLyWj<{w-6Pva>`%TtEtJhl95>& z>=f`h8d{a@juHQWcOz{`iK06pSQu?sPwM&8Y(^-@z|u_w^o$&;df3E~k7vQx$Cxjl zz%0zBOc{L1HcmdYqtI*=WsvYS;tzntBxH-yPv442T8wr$&5^Oo^S+oaU<`+=D%ow5 zMLEV)QNkKy-;6Qa%)kS~QZJWoSQPG4m}G-~*g93822GX^;C{`Sy8WF!ss7gp1yez9JBl=xJI9FUJ68Ab+aah{%P&n5xMt^_n3{$vLGv5NAhw5=qBW` z$B;*5Y1u;V9dUM@h7-4C$n$97W&^)o`GOOz)}be^_Vlj`0+9e^{;)T$)Uz?$$T}Z( zG!1a}HYmaE>}7F|#@6-ns#rlF69+A)LW+WGQYU{IfLN}`DGc=lsjED;E(`DExEjPY z*3E!68|=CA_T0`NUyt&G$3tUKAafD>Fxj9GmM|xBI^w$ku;$)u4Ij#1y~OFEU|sy->V zDNY*^LA$6C*h)o0VV&melU!H@ZlJNml*8rahfDg07GY7 zl#~!plyW8P{!Xw1g+v^0xJA#Dm<-9KiMnlZV}Q|o&oJjPx_zG}>Qc~N2zAp~$7+GU z5Q;B4!1KX&g>y(s_*F;GLoTyG%XjkH9o_?P*tR#Nlya#lt{HF_f)t~64bbIsGqlW% z`9UTqKU5}cC-j~E1|k6k8~J_GF__du5b0keJr&K^WuzR9HVtmCc4Y695GWoEmF8~& z<;OSy12xWV@j2@xvSbhseCAhc21%)$`lFZ!zO;pzYtnq}mheSs8yTyJaIPqe4#nQF z&NPa)KzG>|hA>Y#^xc1zD|hb>4?we=AUPy3Z=9EMv4DKM>&vGpM-~W&SzY%A#-KFj z2t8dQM|@))&rd%MTvp)C z`kzp2)lk)Nuvf$2owUMMEzm_U@!Md}`n~8Q)S#hz{)d11|Aan#N(0f>w)(E8Oj_XI zavy)T2o$tn@rQ%f`P3*bsHmWarSmCo*29#R6HJ!ugg9t&gD$aqzM5Z-D)YrAZ7|_s z^^G$`(qiJ=MJFEHJaZDE-0B2ZSfGzsW{kL}d7wjz zE(8H-t)$WthFWlLy4$Dlg!;}m%*O*!Tn%Qh=Z+77#mQ974Hfi_g-{?s(&obo6)J*r zHW#aE@xJlRKFWgBcEV&8PLeO$PYB)c(5&mKKswy%MxA$FHv!BGAKc68^!hCnxk-O| zjxQ9NN7AjB{j+i(znhxe>U>Ta3Q35Vgt_AE)`*7D_XsVen7nKdhPPP`78szU`E1pA_X*n-iw1pENEjU;;JrAgdWX~{b#0P?~ z1qdk^Nt0U?Zr2o)2N=g;>UFEYq~LB=?o546ztGtaAp|4jlG_)H$5MFRDAAbDS2g+Y5}8yeiKq?F&Q$p}qiAC~nqne8+H-sSNnKsVT+;!Pb&$iQ+Q1F4$&X zx1B``4{y70x8KdA-qNz@fox3SpwRIhP zBfKfmY$lPF6q$D=j3=03S~B9A#V_R!La_Rm?l zrMn=7l8+wU*AmjhnTqXQKL_T&57P*i=TroRy}nd7@NxEr56uIKi_(lB0Y)6Fk*R2$ z7Te4!-$22TdnHO(XFN~+95wSaq_{9~X^Ubmd5O0)!;<%hsFq}K;|$g*0hmOKEA z?L#{Ge=UCH#s3pJNMHOvUH|ArW*F&H|GFkPI6Fw6J=@h8`!e#}zfAb;gR16~udY~F z_wUZNy@+Z{aIST0lMdP%qYiHK{kqY2YF4;+;mOWhcd;YJjEdbsseXLH^K@O7%tArKT51@aC zsE$Tmas@w3)l^c?ha#EC*k0OV!2G6O?aL&@RfM0|cd8e?E0nE~;S?e6e; zc@r*`<;^|ox30w08Ud?WHNB=k+By;6v#fZQO%7)(Wx0eP!iPn&riG(7v3M27o<<}P z;5gHg?{S>{UKb@(DQK2VQO61dk#14QP)kJbOEAp-@vTOix8>!=ZRyMI0UfLqb1;d< z96uF22CY>p$Y3myiy?Fm|Dc?7>hZSG6mEf%U1-%4n22?dW=ynl2;7Ft>|#mDse#N&q64A@4}s~FPHXn`1@YXGEm?)w~n=@ z{Q*dU++7O))&D91<{|$`|2xEpwW=aT@@u58H+hM08J<;$6P#SE7wmz|fmJkcE4a{pjIA-;H3o$0Da@4|$MAcy?g!T@z?sPE}boH&c7S*@86 zhX+@)8~Yted5S0V^_0v6lK2jHDAHk2c%0o*Bg}XJ(uhq{u~w{j5jolsFoDio%lslY z(#+B_(MTR;4@oH@bd_g>&Qjh*g_}5a2nz`oU>tPczq7aIM%cW!5B$aM!-k6;jm8GE z)*BAe#%^$a1!6t%r*hA(5+)MMmL8i9%2((Qi&?F22FFWJ(vNKQ{HLLRgeR+OA zz)Kn3^A6Gyeu3!D5pa)n)bDmxGu2HeCt!N9c_6=7d5h*f0L>=uwmRjUmS&=8cH)B? z8l?U|U=gS}*$V1fX!{})t@?X#CzHhsSTmHY2nF7fZ64vBQtw#bK7aoD<;xe(4XaJ$?N{SnAuBFD0oF?Jwxfi?^r8Z=x2yDapZm`{JIz z{_$0(Fz*N!+S=l>UM~>1!^+IS9WK8+yK%bS5Y8D;C&XE~rLwR3Yg?6Id!CY02qG4y zYEJI71M7yES8h92*!^6j$XXJ&<2rsq)9qZ-NhGTWs0N56thK!Mbb9^0|)6I!H z%0jaYFL$Hr)&4}HI;A-@u$vlx^7hS-uU`2m-e@r00Mxa+juFUw5H*kwi zW{f93VFdoclGUy(G2>#{Vj7`teEUMel0Dl>+`*0GU<$x-0QTz@_8$K#{(^sP9RbSf zLSzMZ7=lAP1cx7W2!y2n8%*|$%>0<8Dpwt-5m^iFjG(Dt-r{camXSj)d>UOcy5|d% zlyN3Hk9;VIqR_3m)yBisH5qo|EI4E3;l0H;AOS}nlpUYDbl>=7J&m**Gj$uNF)$+{ ztq=Bysh+FU6#Zlh?7gd3rOAl*iT@BFvJt0+;YjE<%`$O-51}dBEt7zl(P$3v*TM()# zaMa)}#9ds@&yj1*8}KtRE9?=)4zZheCB$PdAAF2UywEHk3xl6DNMpk!q6&tWoM@Wdc%zf4hM{*m(!tX3YOZ`iEih zdY}AcOW0Rr0uloUqyZ1ji=&L9bIy&26aG@bG$3}6;Pt=hPIe;{FQfW?-5*rsF1k;v zASdnzd?zl^FvjpJ0bMez1IGX%&9(miw+LyfH;7dRk`gd;V@ZWbD6;vU6Gog^8@e$quUq=tzEnDrl zc8w(0B2`mGAF5Y3Xtx5SNuhHA#y`Qt_UiSkkUS0^?C3eH7Op`7{)C>~Rt9f|6;PQw z%HQv60gQxuhbNUL!N3Ma8FDayNLw#01fk(LJ)0K2rlg2T05ik+yorNV?`2c2r}aKp zrU=&Hx!n5!lRatIl(zv{5e1^qKL@P7*-79>n`65mZ;5%im+_MWGexv_?ATZE{jlT3M>zlid}qVX6cv|sBi>J5xk_Gq`yyZq@lUO1mXjw$1swk| zRe(MXLJZX~dFgJZ0Pz<#0D=5Vd=?BhMZx>&+_>`_wp$0AUmo7;@u{WmC;|Ghps^IL zjQyRQhJ4V~qQPz+f{Bu51cRWD?|B%s+>bL5QH!353rZ))_PU=uQVv$LPq9 z?s>>=V{g3Wh_Rvf4qZo2Rn&KUcHf;RzuL#?J;%!4zWZsd<0B~?A6M6q(p9rXYZWGy za!SaZ)LV>U?CuSHe9z;f8F z&N+(nCp3!qq9K%`wyqzhSnJg8$_HokI}aA!FwDE=W8O$zq#q1Z`>8iwcAD5Inc}Yl z^SUKP)4U9N=>EJfH?Z1J=jCnh$*^VISLf}87^eGOxF_Obh~gGF<<-A&cOGc8D;pEz zaf3j%FKkrX7ZidG=JGxtl1A(7QEPAGL^{2&L3_&1xSJCaLOFtIt8aN0Zu4b8ft$l- z;I}vKL_>Hx{40K;KSai&A~0+OI=1O003(Jg<)v$%p!zAyMe;lgjRI1d;Nn@8980IE zQj-H`$^99|GUc)ht||)xaXRkJPy%sr;IhI1g3GdLit`}CBi#<0(Mk@@{bmiAqEZ~M zH01FY5KDp@4E6z=o(P|zS+mRMjV;Zr&rZ-xNXMnAtY~-oL{{Xk#kCQ02>4=k<~wDd zbLbQNsEoT5UZff}(tKc`wjEqzl>*wXIP|6~Ccp4v@{7Q+o1T?o-PX+R4oO|h7FkXL zxHJwp9Dg9kF|`Fm3gHPq$Mxz~g+?~GLa<3f4&rV79!qxCPaYE}vH3V9q2a4y{lLaZU{*{w1Zr!rc-c=P7%pI)6F|IvP> z4}*`BNvYhc-@o`i`q(`QoS~-{(E?|Z%`0!XDTP`Pd~q_lSA? zBiJPD751QvAYrVe&IK-{hDpQt8Pb`QZ8ETjk#6PUL$#_GAPX|o^rmr4HVn|4ldu2y z?%S8IzdC;T*7(e*Rp;(9x4P-}>5=czBkm9KUBkM-yjy^b#EslAj6s?$1bp5p|L(=B z-}@cHjCY-*-$3pKaF6GNju9SC9q^{*pXt{FcFYm@%i!s(0obxhH6YyjOwj2uI6VyW zhUtUsmL)5`WdII5*6#0Ke3f_Mc;}H6h48=zWiNnMYCw`fCv^;O&D%K)avDq9CB3c5DH)u_3ee@$fEgakO%z!~ zYA^)d5!uU@MYcF&dn zt!mRSvHd9+9t*XzyD`GShwJujEO6dN(uS6vy5AV1?%TjT{~pI4#xaNSJIGt3s*18t z)0cRe45)k zh@&cq)Fjj=)kch-4y2^(gc_PaLq5yCcZwXO_8W;&)E2|Ed2p6;WM1;t24RbjYz!kQ zainH;J0TpR>qT1;b*Zo;kXpJ!2;d?zwJs87){PLu!Qnq14!08-K)JiZyldnSN#Ui< z_QV%hr<416Ws<`3f!VRB5paGF`%Rzt(0F>ymD@F~V2Edo==IS4E_KYtVcm|`_gsg} z87sLbR=^_NxWDIh?e51YuwjjdJkpx0q6*>1{-ObSBjQ96P9rBCX=Or&NszZFiOE2^ z14=|Y%>QSY!PI?;m){5O%Ln;DtJ^&m%{LRTShPQhEU^w(l(VA4Fk!Bvb0VtQ!8`!J&eOy71u!{5Ao zeS90(aPKjP-E8XwSTOo2J#2c6g)fsdWIFvt81wf@#EW&hs_2@^s0rb|!hyh{d5Os{ z2r^FLUHDrVB0-iy;&)@n9}vrMNW+N@kc2q_Jx{DgFbm9isL*p^^X5kJEGd={Wwtx> ztMi3LiGQ-xo8u`Wo+qn14;Z%uSBx<^jEIufXCR4ownr{5Z;=#{sW_VRi_Pf~^8s#4%}_|!KxDXqd@xAX zi2NBU4{Co8vPt@U99^8R?m`XR-~xfzr;3#EDpsVnWcumzfr%6qoj4|L+d5zOkcDWR zeOF(V=0>n09Is@ByM3G7Mw*auLxYiue%4h==VIBtqVz3#B2I8JU)~|l(rtUd9u85n z>;+Ww;zTKd0*7(HVFydum^dG@CLZ_N+g}1s+RD#uV0sDZ(2UPBS*dmMaByLfp#g(D zcF2G~hhxP(8#Bc?z3QWy!iXg&q)rx^0e%ISyUS92yC~hbP&L}yu&B8EI<7WtP+;!o z_maZ|Hmh4svMOSd?1F&o(SWFv6V99IR5*0b*5{dZYqEvYb_kNMP;!7m0tr{eq&&kV z@)mxw1^7`uFK`c9E;R8i&2HPrQRcSYq-0N%9WQhbEw13e34Fr0+$bI6N0K6(5H`4f z-39PIynJtdd=+`=+>`B}ZFBDRy9M3fU?3j{c83&c8!Al%;*`@vUXQ=iNX-yQQp*-rTBnwXTiMzr@a=@EW?cU2B&Za zpbgY)3cQ(1;Z|WsFcR|rvIzl;}ymPSy@nVQ` zdV1Jf2nGo@8f;J9YPv%3Mvx^)Hw?=07xj(+UBZad=;BP@^T@JfV(D>Gqu#jjI(+gZ z*f8BU{#LGPzBzS0z9`%&NHiK-6!->{iTP9mDVvy(F>qsu+0lJKE1ktm0z^LaK$ca-L>1sch>c2n8$YkE~K2G7V8~V zv58S{cA4TKPjl%Y?V`K#!nWnmy&I2uXWws>^C#=+ZxV`E zd7R^*AwQl18w9Wd$;F%sT(5w_L#Y!dFj3!t5FKUUtD4q^fT#8;FT=Eybkvfi+(#M| zOje1#gCT%F+u}XqAXcSe@AeqCYydA#O$HK>_JnimqGTYyG-B39j2%!@cC#!efYV*k z`RUemi%kQAbxTL1u~g3H1(;~Bs%d-C;04)D@}z1gsrPAb(G#>syX%@0)*J=$t6ymt z$bcw)SRr%k$X)H+w9AX~-f*PfHr;Ov6q)<(!^>(>_%$`s4TfBo(luzYDR7o5Fx=NW zIIT>9C)*3$iK@pGxl9$wd&ImpO}u6zx&+GZKbY+F0bTv-MY#`{9Y0MJA*hA@nCv%o z5S(Ulfj^#pv;S*^0cqNw;WoFZ+RJgP@z#Lr=*%g@82$@R90HuA*5ft_OYpT0z%u&j z{!cMe_$CnH4?ZZS3$(lCtux_VG>`AUi#>EC)(P2j%k=)e&W(FFMN0D;N$y(kft;-u40oW)+DT`WVqWw ze@&~H9SxI|BxdwKE6F*6=e&s`Zp^I)Rxh<&useg7oQnH^}qkbqo+dpQ39>PZsjC8}l{w}YV!kmh@;WxFkUd09^3@(q|Qa8o5|euKz4C<#KR zA-V*v^PInnAj*`k3tlUo_?SX|G|=ocH&&7vp3EtUF5dFauzA5nR6G3W{!fPv$4;N& zwVJCF{Wd3Gmk`H4{Rq8Dvf@}2Qcw2?OLSky{f;v2-etuOqM}zkq^~p^#l?RsneZ>! z(E$L%o<^NOHVwt;I7Tp!~2&;o2j6CB#~WzCMR(O4(@EdExqos3HidOa}zeYl132n?D2_9sm7V&{Rv3<@$c&ksEv1dt;* zHNAC1>_j`Z&5(amTLsiA!2zug&wf|_RWZRz*)p_wj>9Muccb(1^cs5N`h%ICXM9Ld zMJB~k6 z-WFG2bLS0GwP98%yEVeWcT*Km{{Pa{7BqIt?iAfFxy5c%lmsFL$=WuVxb7=iO5YS2 z@fIgb5&e^X)nwB#Z*gR0O3eAue~~$lxWwqmz0pwoxZo%YU-lhn#Xw*wTh|tHv8R|L zhSY$D^U73#DTN9;qFget0;1R0?Z)*8rI`?s4PuTm&RP!PlwNvL=^9lXHiPrBwcSu( z^$Pk-H+~6WlH}GC#*D-e=5B8Bp}29%o6gzR+~RCI^k~D4=rJnxm!5A;;(Tj%Io~k6 z2ia);g=bvTJ>#0&oN))Y8rwT2YWuq88=kT8YQkd3&z3*SKl~#3X_8HSh(7rx$)*@D z6X9x5vg&N#?nGUbSN#HZ^E}4~WpkT@@^^#B6dvwpwr@8$>H| zz=fMgp50a_-5L%d1#ip$x&%6> zKKU=uYvPsOl&wim;OgdJb2#hpKIoI}0-l%-!+8#rYRJn`@1K?X@CzCV$i&@@jhoHH zVBRtWlL%!rWL-!`i26-32*9H#HW}x!aTB#Hr`G>euQFehbVlxPBgXPk5!`6Q$ZtZ9 zIXWF_Xjw?uaO$m^XE(|RCZ=Qm(U>7l8o=siPIK)^fxUn5#DviU1{Gp`^?L^R`>NTU zn(#AH6t;i!3R#BRRXtr#O5|5wmB6f3(lPa9{CNCiBY+0%AeWJNfhRlff&aDJ9&kl& zS^k#&VS`!=FMT5Mr_mt|*=`$l)k2Nrvy)lkRZ3!n7hXJ1ybx;1oNFfu;AFPKs5b8~F(Hqi<*zs^MT90@TBor|iGW(+qHfj= zh>|8J=C_K;DI3q#$PB%eD4WXP{z=T5fo#1~#4do{_9%JZ3rV}>ER zcF6F74N^jEg5|VyN_joK=?xRwVHTwG2?_eAlNT?)wn7vi*l*b<=SLk|+>CB1jyuJq zCrpoFp=7Xv6-q<#Yh`I7iA4|jbS#A%x{?I)w`#VE;F`B?ck8j9xM6kR*oj4)W3w21 zASuheTG4PoC9kEz2SDO?RE1qXM&-EMcD>JIW_|fFPniwJMICd@(vy4fC3t1D_Egr9 zE;>!8>3)M>SW*+!^v}xns$}VAR8p}6PsRQt)0_vHAB+6!c*;!N1*R5fAkGg^O1EC(V zH+ykxWHLPS3YbLju;C&3uX1m4iWs_CW|2>U9^UVA)nZc`&NeD`WSHw?IVXIIVDXSo zy^c%{qyr#nE+X0KSLGnzGDfrb#FS@uv2t%T#7Mzg&D>;@dB5GvtwRB>;GNCfeJ;g+ zsoDBiA}`pz7ns>n`Ha+4xF=TY+hjD_xCF>16s-Yz_%Rj%Tf?@Pzde~tOSFalrCJM9XmhsoPuW0!7`F)SR7JNI3 zZ~CMTXm|Srlc6;=0?Jn`tGPdu-oVrXl#`7BQ3$Re)Sv?ZkGLJ=GzjF~cB)(B=mBCI~H zfDNMctmfcF;Kr6)%zu4ZyNx4kC%fZLD<(~emRK*x6F`xZDUT&@y<)u8C{wBGH#rn7 zycCl5a;AG6esw=|?ojm{;v-AL`ibds>a1#45Qv8sAUQ=A_k;KO_FdA{`wQg+Db>h^B#?=hK-f{|H0GR|28oi}cDbl3&k9G~24gbaHHcgXzB z!U=td)*I933i7Xuz4X?O(gHFvTxxDCI7kAUd(aHF+|wcME%&&VZ||ERYuiE`qe&{; zoxK!3%8z|R{wVnqITTT(#SVYDm*@;3BIuNUi>T!1lx<;STyhj*i;|owQu23{^jvur z@c`OTTT*^oF#Q@py@Vwjm}esxessk;<*LI&C5vZ{Nl^@u4DL`2GIw=L5@0z`=H)fs zrLdp{uj*MkP5FUOQhs30Z5|cSu<+jIx#9!&CW~g1i(O`oQ9B-3auI32oi5uGXb@DSF~0NOe(8n~k@@woXv@ z>ce}L`C96Z%6+hOUn*~GA~MLb&~hCaTWB8AQ@Ir!3_1G%=KU!f%{UV$7}$AS{L)`B zZ=@tO#1>@2JlC?H^6bl5F>gu@QumjIqf9|E#z&vy>uyoFl?86qtAg&t1zvqfVzaj; zU^s3@8F*;IUR6z^SNhQQ3bs?pgr}6Din8x)SxiY5N%Q#LVwgPgGpgaXi)+VaWx0jb zJmlk0qPNUcj_yW7;Cci%v}hRN(On?78{-+c++CrB1td$4hbqkc=0-Jyvo-U&V}N)x zel-5Im%#21mcg_?^CTWlcWY$h0hk)p5wt^dR$v)KCha!XIT)GX4&cs(W>UK~oqgwa z=tw@EFy}q0aGr0{)#}3{=5m>RFEof_bRe>zwX;c6LLtM;Y7uPNf%b-`5J-&X+@7RMq^-UeuK6Pj-Srm7+$Y$>J1U!*Tz)8oTGQfDE`!@M#d-r*q*LgHhhTq-43#))Nu;N2 z{Qid2IcXnzk|q2DPuf69*)U6qIOc$xDOfLj#q6jPKLKlCkvAt+OqHENT#B$Q*HmK2l9^f-us~aOAccegNZYE2m1F^ z2Ay44n*%yj+y4 zYLfAq)p{70VhFkeCKNXR7KXn@vbvj~Ls@SlwvwmpQT=1M>1_U5?U)oC!fAYXU?i(2T0r4S>`tf)vD0IEPwV#G zyuMOe;>T7Jx9EtsIa7Aja_yO7l)by2DBYM`d3JB-36F~{`~Ej1qChwlHlhrRfE2;T zbn7pc`&7!ERNqYlol17#pWYw%=994C9Y^|PGxZng@c}f|`@dk<6LrTvacwAtfA=a7 z)7IEB*xBRrss!nj?>6jCmk0*j{e8dgFi=)*PrGIr<${|{f=@vslfeCb`s($o7qaIC z=CIhO4?rs?j}lwil@k%_lZ?(O1Lu};LL3|XrSY3Sr!dOI0)lUaQlm2Wr?Diz##ncn z81e0&zB+knUHkBNV5Lob@#FVjy?7ITgpam-_topyFJBx7sfy*gkArXJ;kMR(_vXd%*I{$< zQScpdH+H^#dGhUd>B@s&A}jf(9SeWOtI-6J+=r5A&TuX~wTs(j{}#q?1k426S?IZV zhXk~lOVzvy+9jt=y(s<5zhHxI8c`vNw4ckf&7i{Zc%0j}J1kaf;h+?>LMJo&j@Hxu z)^lb)0zsQn?DKn-=(b?Uqt(VFe|8ZBfs^R%h~kL(R%U}gmJ%hEC7q4Cq&N*r)z!pj z$O_G0pu_%jFgkql`Oj<}>mOvEK0Chr=wlcaWU=gs81R+>FF2*aK&#L!5A^9)L{VXU6l2^$=Lb zI?`iD*f%4mFj-+(kA*N_I@PW?XQ-E(idFQkHz8~=9&jP<{ftvAyAi7vYcD_b4Z-SP z6Cs`4DBqSbDij(hJ%s;`5upHMK%Bpqz;!e&+oGB`3?TLc+`o|c9XodX=zbCNGQJyN zfg4xYi^~d;Fj9`1|4FCRX*;$<%fJA0r=+44MhJK)O){1FSwb`)nSBLX5Zvtl<C9N)eTHKaE;eUdLXzR8ZF=5HI{qLSh;h|}o0aE0yM#vD0aUj_gO z_&eC?z08qYzJwg-Kzo!Rk4zCqQfp)4Nce@^`5emuueCs6P4!BJL$XvN3YC9q{^oy^ zsH+Vz8f)*Wx#a-)(dQ925qus;{xoB3qDBZ3n6R>ce_Y43g4efV72L!)r6TOQLn=rdQ|3WiC*x{gT(j4XHDTco@kU9(o(mco z)Nf62(-Wf?hTf*rhj+PPXkjU4y1a~8@kLPXV1U?4jUT`Ieb=&Uz=91m&Au3M$l z#Pogrdi0UqwZOI8tXInwq+5@(zWelwte{D31z7E?xhfA1~4il3dio|8zjPG<>++o$(`%{8KEnwmDr$rhG zxl3FR6Dbxe4A(bYjR*3!oJ&U`*Po7Zs)W>t)E>XDwTUVM1TJ%R*g2)iV)$!{d5zcFZwU}go$JuxF6~tPOJdznKW|&MI!h?#Y z6pLD=bc)g0#s>rO(h-~n+z^YBoU4<1?WE#GUBB?pT|^yriyOl{;+^b}Dick%O426^K=CG~ zR%t#-N>nVPWNJyYQS4<9N(s*)oTXYo)iBHI2o%;c z;^xhto4anTrFgjU6+^Lw2p-Sg=ll5S86caB)eWA+M3LKHeJ-GG+$nra=?bJl%m%G- zj0Z^^C4vz&i^DJ73KZQtR}BMKD4aK6qoW)QtE(B3RHIsP$R{&QD{E$F>uTQayE@Rd zevU?{Vp7ekwt^_@6H3sB860X*ypgb&cUvXJ18SUZGj39S*eS+Axp9FBY}n*@N)!$J zA#$x<3Blrm;;#8rP(?p`UoA+@r#8AqjNsBatLFHhh-D``QeDp*l6R2KAm8J`HGqLV zf20QC=zaPc4y4^{_+aPIdzy#8XQXPO2t3Nd)QwQrk`y?MMhWRI-CEkOjc(mm` z`;NT#Ht}9luU8XOvwcs@6RU~40@%W$_n=dg^$KPQ1n5!x-rT$gFR(+f^PVjafQG4e z?R)BGz^*LT%O>o{dT3NBwy!tIPf;F>}3!ZzXu{RRnQ_)kg=AVukFxatFeH0Zsvai zkKM`FZ%_Wui=U5z(RcstE=Ld<0|V63L)hpX$Afx5?)U7Ueiwwa6NY19%}U9nSV7ux z4?2tu!E-aNG$f`Fov2<-V+!H(vPG>gO5TXi0&_|Q>Mh>tNHz2w&BW87Z6Be1 za*nhzYY68&HR%iNXmk(pt%4;NM#6ha01Emg<{Dt@ zNqj8=*(EAdXT)~unj)-ErPe!*J=3LGSi>dp{zFob^&FP*y!!IDXIuygQ$aT55ci8( zJ3S9_#IU-ER36j7Zef7_L3wn;Y=pCwVcP#&P}-<)MG=d-J3#L@FbtT(IkE|@=pu%H zqUV}=N@sCg#qC=5%(o0L=p}% zFS z@;$c^7sTNfxX-%Q@s7~0YUU@@DyLK>@D4!!EoMtY6=hV zd#DYJH|e^Jz_7c{PRX9rcK3AJqmnBj)A2Wd{_45?hIIOlp-Nwd1>SvM^>;iaG29X* zK)NeNkLvb_f25)FV@4L3z;G*!SIbCNTEuTtz;0kftLG9TrL6%*+4FJ_V z&6@hs7RI=0Zx(@UV(u zE9_NAEN6U0#EeHoHL|W+9XJ%Z=s82?Zhi%GWZAGOGX-YC5|GHg`RneW@_IRk3=r1* zWoj|~kD1HE;&>cok1)ZpiZFf*T-)8J6kV*3r3~W9j$dX4-#=G?LrQCvb-ejwB>SsGae>K-`@|S{jR((f#GWL z0a(eymVw1Fa6Fu_y^E|-V#qNdnYp`z&cy~{gXelyh`U;KrBUK;6^ZPg(&)CesX%k% zii*qz9J0p#RS+zZJccB*>5--zTi-ax2LcL)X*KEAt!ywm)~q+WZl4nj8`5KQ(<4^@ zJ#%H-GlWZKv^;b}ldH((4u7IY7!g?psf|(KR%pj>@a*`2ZL8ef%Prg=8#2fWvF3;q zk;cNZGSI;w(!xE{Y-vcd%*rXLu*-v!b1YIIrWoH$1vGIN^6- z*)|353MLfI3cuNfjFZbpH$kF9`21e+r?%ib^$Ne-p-Y!VlbRxU{4qKN<=&}3@Zpy3 zY&R5a?#AHZKMsbjEAa1s91i;fz)YW@f=yVxD@D0Rq)M zB= z3(FwzBxb#L3r*voQ>h+}P9BJ11_Hmrc$`UzW`p-gD!<6dNs4zvvnp6?k-Cgsh0K0% z@FTvg6Y~SeH=8ckuk&Jc>$8=qz}Mj(wx2#KqPUo5ZEqClZJ*!9BICcCID9LD;IIpL*(g8_h?5U6GM7ZLd_( z)G_fX{2^%o9GRAHAE0*EiS68?dkS1{AMvbn=N%>0UfYxCYS~ly%bm7_SeULZfVYwF zU?2z7YO0AFy_Euqmq9q0#4%8pxh49q$#N)ye2Hh>*{UqwQ?v*eI_Nz`M4_G)#wqq6!P7a)~b%D(vkZgg{yVmCv;eiG6ud$dQNH<5QHX*;* z19J?cD~d1Fl3|56GIe(|2zl_mR`Ecr6$!oEvIvkhJy*JAq7G+py@eFJ-C_z3{n8YF*Q1S_7U+HeSE21!Frv@pI$P_xv7!PPH zeyWAqv6EqX(?_k454z0eLk|g5Y6zQaC$jJ|d1<&VHwJR;xXbRvFhM7AB5(q=(7RmU zBd8ew|1ijEL#95`O_u0dPh_0f4qx!M0XTRe(M1J*bcA$R4=Y$TI+Bo(I~^aaqH}@4 z)vD&>>?Qn*38>_J7K=?B&dm9}3UNh16BeHyV5RbHcrUo{?hf+_wQ|4&!RTcaH%K#L z*~i{OvYc5<`;fh(VKQ7Qy_;$mm&DXna}m?Y?<)UQ!{{M{KiIPT#lsa=!%sh^W+1WY zi46gh)Snh{!)6GND-!`PYYw=EVeJ-eaKLGW>eD=F?YY3E-0oQTWs)vBc~eQoy1ugh zKv+F!qxp`X$44**$aV+YR@k?=w&)p~gW%!iI6iihggk|)Rni#*Y#f-~8yk!QFn>{y z6i`h$M&c7&RVok_@B-fF_&SH6Tdy0nl2SyCs+32s7kCaQvPe%_X$=Q6G~TwCV82Q5 z+kE%>_3xe^zYI8TmOfrT8kE*$u!ShG(99gNt|>(G`L`48H_j zDT`R0f6|S_dX!{VeanH`#IY0D7lUr-naB~-KHZ{G3Oo1<%;sSMyz#vT_ zITS~ZT`-Yj6Sod%58{Q>O>kTBub_hhF@yP`YmIdEHgzMMXAne;2nniggl#K&Z6URTSC;>Q{CL7 zr`l%2?0Tu`@T9pStqNS7^j|m!J^3(uj#Eu=D92;u-C=Dz`i5RIPG31G$@)l|H7^1E zTywJEDUF#M;X>o&mRM5Gsus20*KZUJtvqp^W8?edx1EDho^3wx;H~JOZ zw*8pHw#CPsK8)Zg8lq{C0$znlU{+M=gh|QR9NXmmHI4D?K~D`%)W}biiDQG!h)6$} zB1kO~L)%XoK89bi+1!6`RAGO)B>`LnHrr0km{pnVyCC>Wq?RRRxxDIykeyzX7KXE1 zdon@}X~-l9q@Wo?~#?{N?hO^FaGB6Y^b{Cbs3qNBg8 zFPD67s+(@=u4rV6X5|*3w{uE+h_(e%a&cu{6w76~K>MIS)6MlhutBAI>?345UG`Rc z+h;!4u@$SEEV2A6AN$wbTZ_HDA4Dpdy;xB}p#)ijyw}%CJU&9U92C3Y(RPEG>`G18 z{6bs(+b}~huC>@qzriApH*R7E-yyxa1o>#u=^Ho{37Wg&8qz7#cQZ^v8TW0LgnEDQ zM%vEh)B9t+Fb8*>Iu{jOaTm+?mNl5L3^lj64BcTJ-q|vgT7zuydC-W>;%+NV+Vp>U zq5UGOP-msZX0MG4F5A4|cC{n!!oL}4>H6^gwB%2Ma&N!RWCja&$Eko2QH?k&4N8#( zL(@^luo6B9sP>+xtnJUdxa1Yr9$*k?_6b*Hy1Fyex1N!r$15< z8@}PjSPZEHbCE4tg=&*pP+q&$1wQUj*12U2O1!W_V58ypYTEF40V+X8Oc3J#l~ygW zPDPdQCEndlcHD$p*8N}VYLQs^@c4djh^F9;i~oRE|G`EoLH%Fw?IC}A7$*aLZ?pd` z4!X8_k-ug!_HGXOJi`PdqM~xyhrg`sL$mXE?hd|u(q+bYLcAEq>+5P>0si1+b+$s{ z4xFq51g}Hi>4FA+F@1F|uY!xp?c5I)T)!GnW;G>sRr0u^3Y(#uT}UpTlL5kYXUv8) z=-pY-R1-{csYN1$VO3pLsET-V4chbO^9+kD_@Th|p5xYfDcMsy&GyA#ROe2_?30@- zEFBO;8320VgmsFrZtUYAkvuxUkvU!^W2e3h)odS(dr=lsw7SkUV9tHxUREY}BvIm! zKDP*GmCUkR^)KH=qBU#~t61GmLnDyeBu6*B>I*vRbd$%Fl%ShSCLl-RRQoHptyyKwxL+s{wtgYT9x!!3-)l^_s{dy=#cp)(#zA zH+4G9cwvbb_RO}uN#98NUrN7V=P{s&63BiNmi1KBXPP! zN2r+KC~!Pq<1TBBQ#5?qrNb|uj1LmhaD1@$B%XY0#%UlIB2Ctr=|nllMc z#N+9d#PiurtM)r%Ex@0s2>S6WnY}KyODYSxNsr<%g-s)M-mK5!k%DLUHBu&bmMuOp zUY1m7gA!ujTZW&l5~B@FY|EQ8%fc=rpFq{^IPxQA^rNg(H{@t?I=LtE2wEd-yjh%H zGlY6?o6l~xC;RxLtbd!(bi&3{VI(Hk5 zDY0FF85iiz+9J7!+=t7v?iBdPw~=D$MgI}k{7y^0XQ9K2*>|eeWwk(@{SFI1`@eHI z#204&@S_Z>HwBt8?HR>V1*hyrF#J0V^_ytOoN%vK>}>;Z$(dWf3;P6KI)j5s){G`E-XZ2I4XZZ@sDo2cD<6Q^*m!j26*>>9|7r^Z-L~#d zGY7X9f=r$0#4CM<{bapevI%WlNbrqcOzxugx732dc5s3udsnU~HUWHh(1`IJRtGkq zTRX?sbh^W8XIr)-RC#yiK2+c^7E zw9@Gpall}*`=$Xyx#Ewx;o7GrgMcT)7#VxjEQ||7IJ7iw|SFG(FR%XXUY=5{nZ%il?r1;G%b>#C*M#=Sp z^lm6l-5CxZjw~9cUANz;&q~}G9s9#>kTa?eY1(far9YKZMQ<<5ILcVVmkPHV=<{!~3HrP=4kfKb0k_S!M zMkS-EZ3^K}QKu3cMMwgXw@E4*{}KbckNYlMV*K#_4PR1nkL7ctO)3B(;yUnfl8hrr z@oqXGqa>=aXJ0O=IRrrrVcjk3rZPNw-VU{WjKGC-9_@bn!+nhvjLQiXnRhDr#lzNX zh~wPkTu(N@*w_W<`34{rIY9g?!ysV4m9$akTU;a9o0Kcv{%~Jo8NuSiN_vg&d?tS~ zzpr7Hi+g9l==o7r&0?QB1BSZjcBVzc42KLvj$jQB8dk&7+$DHd4}vy87>A8zEgNvA054~d%iV^rYW--Qz&tgV1S zD66Gfg6N}tjD-{Hn{W?e8m!HmHYP5zk3W)P)=RF{{4Lb{JMQRj zSCX2_!;L*FJs532&AqLg;TO#)1NR|qs&Ls-DZC`lSCIQdjNPte4T5hX^+jx3VC{ya z*l=FeVkwVM#;D^Y4p>sbqmnjT8hG&1I?caArP-*_{EO6>|NiO*Tpqgf2TwoJexut; zj~WX9(cZ`0!BvTTcC;B)ZFt*ZwTwpKUDS7t%PSY|8KV~&Wv-j4-B~SJPm9>Lp^xu% z#6O7&-wAiK9VBs^y#opJplU(g*a@*j)hWBvqP$WIK`>nQ2Wx}ktmj^rklNkdfT(x( z&*n8S8nZJZL2%mE@=>@=<>}65SR8iVtli1xA3o9slQexBvREYM6q@4ngZG;19Q}Ok zd-tdR4QF-XeB~7TBHy69&twUN&!hDl#j>bjnGhXNQ41)6kX?e;1w3{N|ehgI^n^lN|0#{!5d|M!d039 z{2-CY7Yx(0uCiwy2OcJ2fG9A&h;S2U<#|PPc6@S59|#{HX)NKyLl0y!cPaIrN?EywyJ%2A zuaiJz_{XS$}z@$#FsUk!r zcrg+Hbu(rfBN-3>#Hz4i<~sPYs>cw;uHVVuJ8L+w3KLV|AK%VZckqu#+Y?&Z;`^o} z5*FQa`&Kgq_1%4X+@RJ=4_n|rdmPj}pDR4^&2-X(4Ie=ppE_Mu?I!vl_^50r7+R*dO|{`6QgC-VLr73Av$c_11=VfDrJ_?DfJG6qKkS z8KxA_n(;8MW?^%p*S$Y?l!fHaL3_L!aQf=x9pq5pM1u-*%U7Hf;EEciNzKOTlM7uPF|5hhh?vI+*L|%=8Vu?irwKdp|Ms*_ZAg z>M{%SJR6VI<~??+%I|f0u6GllJ5JEn8R|^YF7LqzCrw})kJm7JEmGXaaPNe33;J(O z9q@PL(t<~1SB5hA0wt^tDXs$eDTsPX#Y3e{7FIteLk-0yLC0>@aB;a>Uxj26!fw!z zBl(kN5D9ahxRW8ULNx&eNO#F!)vNc-cAnO)4d1doI>vQ*c<;)-6nuLF`&I!1pLKUQ zKK;1DWw(m&cl=_>k{rO@*cNXm6matXWg-Eq%b+iEYnQ(1P9PD7QLa)DW^ldOT93Hxi5)YB+{%^*8-B$CXww_Q&$%Domp2K!`AC6Q569W-mXn8$vV?)tu9Ya#4U_~yR*kYk z=>x%b<39(ZcTow@?%g{yn`V)Tgv-?&{_um@}-hs)>d{(>V3?`!{ zf_X1Dc$^lJ7S9;?Gjj_Guy2tEV%zEh7iVW>;lq0ggf?p@C_Ep46x$?{ULsMCdw{}% z;t<0FJJI@7@<8X4fNY07|vqIxYoxFWb7=z~$aE|D94>%ye*#a`@K;y28Rgmi! z&qKGTi$yi@4Gw5knTTG#t;|Aa)lYt_%fgS*{90{V=mS$-YL4qRTwGkF!_k$ z+e+XnDj2qCyUE~|4Qm8E%uYIn!d4#Mm#NtwX;ShgwBc*alLW_+j?>F9oIrMw0IzTv zZR}(l_3w6YgTCc|DxGR`#NWBqF(Q!cbT&^RJ@90S;9-V>DpZBuRn4Mal(k!rfc_c) zOnsRDuY7=o=TEUd{UJbtE#S&HZAP64mlW{U6^|(@&l*UxhH{JADT+AD9EnHaXqDOA zqnN!+r;O0Sci!e6asff}6TX!~$*DUz>wPSX@zI&i6mC0v?sQM-;o4M!ghly-Sf}eH zV0wL&tLY7?{%+tFWjQr8374zyJf3%2KU&W3-IQri<20Z$ot!jn{fcnC=}6GVIxco$QKMYjP!tSoCMb?`C< zDhKt%OT?)ac>E}T_AEE$3?YSuRLt9{siv6tNz(oOw~a7zOFj|KtWQ5yFtb+B8}nkm z_(k%N{om0p;L7p3(;L71e_05oW#Gpbfwz}{I|;x*{{6R>YrT_p8;bk;qIL3xZ|1|= z=&QRe>ylR<-3y{vllwQyaqQaj<2T>Dc=Pt;|5%TNeY~qz^tO$>?-AaZX(6V{(lmk# zjb=l#1R)PiI?EX?Ck&|wsZ!5E#QA>j{7_7^=<3uEihy(!_82xEnuqo{xLd@;U%TbL z@aMXv6!jfd6Q}zWJOI0M++z$!QO&~z!VmAoUF2`pQtYOiwLz#k!9$HW`%>wU0^3wH zd7q1YL>naX|Hn*|T?(v}+W*~_JapKf)Qo|SZqIMmK5+-z1}D+-jv}T#{C@&i~fWL;A#DP)(90827DN8^Cj zZG%keTDh32LmFs<7A1L~G2tRnK%q0O+l6#%3k~ep6`8jJ^m%tF(Zl|A7Hw%sp23#Y+fjZ$Dh*a|Ghnm-C#XLC}QvORyb`d6oVY?;}@-zy#;>q$(*@`*UR|gDLA4cnesS^FG<`QH%pXZtdR62W*eN9kh-4u z#oUBR%5b1whzrtZ-rv!SbmIY zIqbutZwZ%qD`L;E7w@9>Wkvj19Q*k%jZobMw(G=+W+q6}^wT6(EE2Pi9?} z3h4%Bs#MV@k%!$ND|7)C%4Ue*Y{(BZcY6r|Mto7wk4`>&E&IkSdH-1wEjC*_IpA?g zyfOUD1*x$?H-;{Lcl_#Wg+K%6r4LL^zQOOq6^!u0CC1>hxO$;3T2 z9qmKW-F}6r+erq4G(AMW2a1E6_qBGnyI>GzYqQ-_0&*--k}>ybIo(_MwG1D$Rnx=xg^BM>!LKl>=X1=Pchq4Ffgb=D!a3C|C227I^hBgJ?vOD87-27lbVq*Fc zt_j!Lb8S70ttKGt`db0lTAd>|rNoBEW3^GNwPn+G$@lc>U3^}>y4ELQ*>|Ph3w^#6 zG=iDTqTPKPV!=^Hd6aMzM?NhPG&Tnda)VP7`mO?qnrC{AiA*<-f5JcgGU=fHMHjS= z&rxgWr6f>1L>cAMcuvR`VuXTK+!qT?8=tw4m@(9C1~3v8jnhmS?Rr^opiw8B+|9FU zfPvK>!HVv-lEpa{`jLwV<3}F5=>A}N?y(XYa=t64FZY8#_ENv#py*S z#9|PVKLv8h9x^nooHmoJYS(f-j*AscJ!lps=4WZy1Vy>%Fhl~Bn5eW(bGvgI*88Es z(~|Fcb_ibrvBywR;(z#P>5-4J6v7=^v4^Zyo=aB}0YmHJIJVvM7{k|=E-QF=FSo|- zal)nFfms7TvsAcS7&bO`eY>aPKCa4GX3|qe|8l>^{e_HADorDYjaQh}OtH~rmb}Ys z_7S*Fiye5HRwObDD-rm3xhcgm&9a)Hzttwoxab5LFyNKBEq9n3L!{KE<4@m1m7*w|UA$Mp@?64)=w)rZO?=$^Yv z?izD1l;iVp%-(3(=VRviE^TLuu&;-!Z+MiUoy9k?!0S9Tt6sN&G4@U6rk#BD+Iw_=iagKLgMv2hrd}zQ z#6L+{sg5E0xK4dMxpqqH*{qttEcv;`{-On)#tF@UO$j<=t80KfJ8tRzxWFvawO}|w zGM02rX}po%uMfsv6w|+ez`7d0L9#4Z=96-id)tyLdb0M0 zOSX{JHHHt#0oq*P404hi-rJHw&p7ogZH0T8CdgvSF3SSZFV+mCHd(muHn2h7R|~WZ zz-MT|8$4%`bu$WzBeF0iU@>?IT}+Ugm+V8ZPG)PgFbX(b4&+IF=^8&($}hNv&#%A- zkLC=N_+-RNY+W0YIe-CzP^EP<^w$w@>EO5M4M6a_1}mau$YW=^3j3og=_9^aw^oC6 z^k+p=O>_wvF4@n=2a47kAJFDD$=Tht*UcudmL$JD^xqzKzGY8s`pZZD%SW9r`8>NU z7S(b+rzr@&e(b+~-1(aN`s3+0`@eQmv|PH49e(}9fBmHMH7Sk#ReNyb`18)k?y$Wm zfuG6k2D4Fv0>1DC5CL62a9198v98aVN!ON$6f!8SDe^Nc>({=lUw0bAjCHU$Zrp0S zbUSBK&7Ja5MlJe{FXcC#Qiyn}@6&^aX7xNI!6_eq=2joV1IZ{T_cNLv3DXM~Nd+Fy zvVhw(FB%q{Q&gI^Q`rbhhwJAZL*#ZXP{PX+{N9huI zS;U3%<7By!xalidC0bmz{*WxaBMAG-?--)Z(`3nF+}vF3x}E(xE)EP z%g2YwDoDCYxdOciks_MZzFKtZbYG6`h~wWWfaBqpPCzH_LvZ|mg*#Hb=W-P~G_LYc zeNdS^0UDP8kLZ*Ww9Fc4FeMLWrg164b;Z51!eGCO2na?Qd?b<;{7X*atl)+A>52CRQ)M+R>M~+JTdg_63O4OF~DdR?v~{*1@u=w_>liJlH29a!`R-Cg$7Yi zAe(vP8@D1djD9dy8q#|Q)wmpwEV(yPeJj{SZe1MSC7^LW7fmqxN#rXXNqRr(MuhKV zUI{!KkH}ff;r(DV=Rkg(+&w!qh?HHG@EYX7WR}QdT<3H zd7t`q6znJ$#z56}Q??iMO@`-b4zrm3AXPIQgc~U1gZP!3$y`j=JWE2TKzOuqW;8Tk zVbj*jsJ6E)fc=YgTcf1SDT42WMlb-sJ(AWWMTGbl=E zfLP?eJG*IxQ`I^dXRBhum_T=xZoRqJ?UqY$y}Gd>U+Tfb!^hdVf+)&s_o2C>WBFmd zz4Kbe^J-R6VgbPi!UkI|^F0i@;RtZBHqIFR^y)cCvv^$k0v0l+e6PUPFDs(UaMALkGYU zlOllzVn!idQ^eNB+buctRl}Cbo^@2@XLUU<3$}2QPcTe=C!Gb40hN`ptS8F=f-8r8 z^)DtXI^5<_3!ak&Bdi0MKnZ-LpRpX_{L$=xAj5&U{8y#qcxs+zW{2(jf|td*;l+R> zsVjXo5?Unsfg;C3-^$_mi8nLg9}>DrD~$|5E$Isr=~vN8E{f#Hpu{g|C*Edg?04J8 z=BnN{GMCi?{;A`k!*N;sCHNsVDu;Gd4(~Q9a?gGnmu|{d=G4m?HOdyyIPRPWQ(YuZ z!8d_0{J<(Ld6ttWaMBWZc7qJR3&buney3MC2y-$@-o&4ThBu)J5c8AxKBvqj44l}M zql%yvAny>L7O|TmWIHxl`iyM08KN#}x#G1c7p;LP7{=dxAY$7o5&XGHMh*uggR5iY z4Yw{<;2Kdm!WKCNcv+l#q9S-z%)Qt*%1nTX>Cz>H1f`g=swFEi>=w>b&^u`XXn_$0 zl1JIp+i45Xc&=Uu}BL_mxs$g;9JMd z;ww`}-j>9ABcFnahQ?4q^rB4kw$LogNi_qz+XW@<26~llBlzSFTyO)UHx5UMkDw)* z(=SU5gvSRKyrQOK>kK?paH^K=TIkaRhEUZ2+#J;7i$BUq^yJW`AKXoYz#wz$fGogU zOLa{}(HTTAaKcY| zzg&E%R`mksw6oyNDIjNn_k#INx^DOuEtMZ-cr2j1xoucW^>nN5W&;VwAmya59f(I) zIk@J~r^je}^4m0Rf;ERHF|d|EYDZabUawRKQt1y+Jqt1YsIP04na( zA~z-U;X@u7J<9*^B+aw*q$zIqc6j)5-q z4tK!a4gBK+A|H1LlA<2arUUAr`?uQ~KlfW2ge090=4egh(*TRc3_t!br~7+I^V9dS z_Xhaphe%XJPcJci0I(naG@!bcRXKqx>kIIp$VEI+n?>q-niiDN^#X2GK+MigOwB&V z#1Lbo3BXUm?cxsc%Vm3`9XAfw9PfWDl?Y$YCj~ijjlyFQy*{OIbK~wW6Ep#Ea^dc{ zgkkHKOE5_BXcTr#1KXJep&Q3Bh93B%%p4aQ4F3ud{M<27)dhzP_J~mDcm>o`w@7#Um14Yb*jXZPu_v(fRL;_DJg1#5# z4ZDa}>vVm&l+9!wS)4>~=ixR*(jA}xXH|=aUvK{KA&z`u(kzA={4aJDvB2>s67;fV zc|Ka2*L4r#IyQOel>Vbb#x_c6YgL$UZM5pl#atE%7-|Vy=gh8oP zDQYBUy=WnpVLs}B7+4|4l3*I+X5s?U+6JF#+9HCm#6hL@um!|R@b=7g^kT%5K{lKl z-lI-Iy+GdtGb`V40G1E_XHo5iP=wzV_HMb!1(G3w@WR#7&4$zoRrtaODoCEUKN#C~ z7TLDDQWB?mi=5|aV2i}F0qiX|l@xF)TfXxyIO3l$1^4O^fuxu!^Q=0&7p;PP;1Q>gT*F=D$R z?0gvV>^H@%)C?k*#T+IYuF1BUM~UM=j+p{^B;EaZ1?ruI5UH31?OIh(@->Ny1TpA~ ziH6-nv4GYANLy69Kp0)~stLzhPgW3hI7Qnoeu}Y)E2k1+Y3QABbJcD&h;%Y(X|5|Z zitMh%ysa*)d9e!l^HR!E0Otj~)VXpo&~}8A1DnB+urN&$tcad0NGQ#mZ1)-FMV4(D z2#B8?|qUzmy@|1;v60V_5?LE`)AakzTK+B_1W_`&&p;uH-bKrIHQyp0g3I-`yS3iEbj|s=LBfiu`2dSjO-yfJHr0kP zLE1RzU|*9k!Ml7WRQD<&p;TE%#=@~mSOA_zFte0oOajZc*a$2>c4uS3domW>-Bti1 zF=;D6;g@Kvj1ssw68vggM?*kdo^zVkC-~z00Hs&<=H&--sLKy!{b0uU1>oVltftet zJ&OO`duToHV^#`Sl`?OFQl|x?gWTYUCVUnllu&~FN$6h%n;=0|P_-e`YE%;oEA=u= zk1~cWi`5)E>@5`ScTuCb?1FHP!P;*ro^W8XeeVO@YyYQ9ZHML2QaXBL#KDRk1$5 zXuaD$D4DTV6jiLA1|l)orfOo|8C}Degl5pUa1-7f;fa8*r{WJVxOXLPf@&o;P1T8- zcIxKK%UaI);C3P+fmOB=4KYQ)d*C~+8cYQUK@=gw9L9UpAtEyh1rL*5cD5ZhJlYVN zs%%DaukHp4+l}zqq&DMa36GY)t}D37v!)6G6|^4x4rl7 zif4N7{&G{9k^^4r;fxa@eN~8i6p0=+8IudCb!Fr18ls5g^lGk{?LBOQ`EBC)9nna2 z`~3En(`=S7yt~8XFUqUC&;KYj|6bQO&__7v?ETTng;&KZhB_-${J{_;vuohVsmc_c^?LO1xz;V~D1#Jr=NOYAZ{hEyQ6IqH zG1%9bSiCDs(Zj&!nA)!tHSD!t#Cd~w@y*l zCma&r@$S(ly@shS=bh;4q~3~MM!7y>uWlzV2885qblUnNQ8=xtb7XA4wI4a1Ht06H zfP;`G9<3HMnJnoLxXWt^@k{PwvR~lBSTogE5J#{*L~HZ>wsn|UNB+(SXm*3hp56;g z$2znSk!J#eL@-IgDjqS$7Hlu11BSqPvQ6LzI(>mfi1UjUy2#xXMD|RaNlf>D>p6hp z<|GpD?BGVU+N4iDr^GR0BufY+e_DKMN4(bfR9PNe2sD5KP^b2rDA; zd_3|<%SVc{G>!)}(ty{?sXkL;*qXw1w?d9{Oq9`Z9!szdjr-;`F{x%K6Gu{z4J0(x zW&W@x^A(yQ>GlIPj3o%AwCam|aaI6AK)t`VR{#e-#AZMGd_*B9joa;bH#mU{biG4-nMVnp^E(yUQr%SzHX+w3Hyl-k)k!@PhM*{7d<%{=0r)}OJ@j9WSlgy z8`IQcV8}1Kq;6Z65y!>G^=OnK=19V@V7#nra1VUTbgdSosoD6%I#hGME|dJL6u;?0 zQ}*nE8B4%1$e^w+d#|^6hih;E?djuS&irG(z;>QnMZ-UphIU`SfNka3_@dl(Cy_A<4W-&RQd~K;hY#yGE_HzFVx& zNT)fnmY}X3_fX(R?qu60vX~5@59f>OZw8ugTB4Kuzw6n|uW{t*tCw^?yQ~_~(YTT( z*aiRFY#QjmU{wx1%b$FXT*OXgLh642y3|*TPHVQTt?R&{a4jAMca>_+FMfevp%XFL z^g#l;9*qDLU>IKE*ycp&kb68bI(u?PiAOfvOc0HHn2JU|-23vmM%sUGNH{t{$tIW> zcFL-f!uY1=B<{3`9_NEe-RoY07aBumASD&*Qa19hTUD62c+}*kKy<^2*H2X|^)Ja40pEkz?R7&eo!vl~Y`}VXaCPU%1JYn9 zRYBMc_aQq`Dk6tx4p$%tF`1;dyJgJv&+5?PklM1j%|sy*Gckeq+->;Y2^7Xu+;aNi zh@>@mU?YE_*a_9E=PzU)qxUAb=mrI6K4%tzJwS0{0~F~Ed%^bJq4QO916r!J9wmRw z2R}{f{+RnjsHZYc_bza}dt(hDA`P}@{AxsW=i8{-i&^MR?%Q3>7?2|R9s*ElwD98N ze`VoAm=Hk;C$nhD z!0igB0`WOmHnr2+g}8xLd*q28ZqcNUgPB)kaJlsja^uh#VzrwH4j(tJyDyki|3(^0 zt?}LntX?pDgTyYv7n&h@XM8bn^kOiu$#U9qby;C>!Eo&1{#9fA=G!{eE1`Fb?lOCV zR##%P@Uk21a*^yv2Oey3F1r4t1XTAkmNqCV>c#HeAjCws7mTFXpbXe<@Y{8~^kV(M z-ix2|RPD(~hQReQ?3{+aD{8q?)CYt^bVCHGOK z7D;5o&S$nhuwCdZ-IT3XzW@Wpd`}OFMAZp&SohDu#BQvy!4ju+%Jeo9UVgBvzCP)cWBNtdfwRiBimUOO8&( zEObeJ0t+vz@8LKQ6sH?BzViyeebZe6`1m%UAyz18izc)PF_T7mS2$nE-E2-FWh(}TYn0bOR@tCD z^i-_Xs+jPoB1M>ISJbp5<)w^(N>M&b z&tu)<9@vJ{lA8 zzAO^mQk(jqY>B=>t%SyW82Bk#@2{Oz=r9CBAhvHsIACS^<0(^@H@{EsdX+C263haO zoXMViy6XHyod3D8Q%Gpav?%O4Je3Js4oUV~%1@Dp={l4XGkYNAe&cHwQ70QDQA zomC?9eet90iUWek;}1@gWY=L0H*7Krmb;=Jfq|=7C^<2>_%y?#+-cqH&#Ln^8N(25 zcrRnejvzdZlCA&iy2N!67PefKFx}mSd!pKjA|u&O58Gf6!^FI6K;SgEh>Qy@-Kt>z zhzo|k^r)+BSvZx1HXf5LCWdQiI41ycAfc1A~8LPj&lGA!w7EHqs-HL(pJ<_!LgUj zfQEfV`&jUxIDsCLv$NvQ?@d67lsN8cE_=pwSu-#|z#Xg#C%sRCGJNdU4Vs@8)jaeS zM-xK9LSn(-5sR|wZ9ApH7I^w0;UWmyfwnTalTqz>Te`Vjt$~}rr%(2hE*AjI^MZ;t zRB6Kp`Va4noaPY}bla$WRW_(EdUmg#n!-?pCO+h|Hd?NI3tK&Nx)OWOB3zA$Q#@(C zQRUYCr(B->r{*&1_7O}f=>dxyX>@qDZko6R{BC2E7>h?d5<5Z@pZ5Bw+3QR`n=^D; zg5QYat@rU>8Jx8w-nsOKqi=jRKA1FjMzWp;30Fd{es3q88^aJ?1AwWL^GATEgz*Vq z`?zX$*#24ZM9`E!xM9XvSU1}I!e_w?p!|^yg8Z?~*ih~vc#M{rZ4e}`Dkc;XgZdF= zwSfExm&Eo6~!rX15&mA zufAH{I$r^Ume_D?r6b=H_%9yLQHD97Fk`juFuKNahFzVrR7?J6Z%e9K&=BY`ayp`G z8RrV)@Cl<_wM6=Xsc}O1xX@4QR#rwdw=q&p+V3>!GhCIs?5th1k>tM87-Ae=$+djT z8!h_tS#R&ERwA>A*;S}7Xl?O}SotqdwB*)|)*W{TpmRQ~3aZ~w&kl;Eq{qXRW*Eg3 z(-O=Lr0IJ8!|~~N@1DGSY;$+%!=Px%pSOFtoigL{3e|wH-|mlU!8)z1P>`JC5F)U3 zvF&(y50@L=@b0+27?g}q4m>(DG2axpCBqxPQU!^PL#}aYn*pdfyC@3cG(;E3=(a{5 zfP5_HH@&6?I?e+eyM;;-O3q}eW0e;}UpU-|v?=3kvt>*pBGWSaMKdCKdZc!=`RkPl zcXn@P`^Pqo?IWf!qOc7WQJtyB9MIc04K^u3`I>i_mz<+uWqEKf6H_d&B28nZIF#Sj>?Yi5bnpoZ>reZ6arq zyP?v9yK4d&M(~{H(1py?T?%15E(YXqby`xn;H+M$WgP@pDXiI3)PyN(b;(jj3)JRk z`2r~S8YDZS=6UM_)vXAe)H2|@nHnDIj2C}cc_#L-;>Mk(OJvep*!TEWvchKIj##0D z4X0V=)hQ?Kjk1zZt}LqhrwuFG09)Q&Hp&c-`4*xd;b9#Rkbw?!?EjFz^QuU%0Q6%i4!fqE5Cu^}RME}+;23-a%^c0Y3_bK>=R-tYVV zmwSbC&g`}OUVHTwAZL^OGNfu~h6`2Y^dQ#+{jHq&UP=rOdc^Z0Vp}b0~ zhMbXD6UT1CFoKFYK@Ug9EeE8#;aj2$nqF8m zP-z_zq(ckN=ZvzpBiL=|buen|Sf$nqEtN6z^Ntbh%+>?UPVG8kiZFq!CWwf|2!$dp z07&J>Dd}X{G2Ci@9a33L6%n`B=;tI11T`Fwa5)=GH$($EdAU;8dRiTA!Sw%2d$&h> zj~-J7WOh99t^M%dP~RO=YWxo|mn_OV3Pwd@SmrMRN=ue}JYH)F>J8pcfz4U?ALK{5 zVq8@#cASZ%w;USOh};ljdhh};z06dcMI{sHnbC$c!+lh-%;b*QR#$}NCx*Gvxy(>N zR;NUbW;`#_|=zn)|G&L+YZB?blnvy~bmY159Jvhq@6~RBgK%gi)W=66hXH_73a5fwm@?)wJ zDNjdQG-r{N8rFxn87>W}2NwYdLRiLEUg2ud;2slE6RX|b6Q9wjlY8;0n!4Gh_m8_6)5+ghyK|AXs ziwMR>h(ijy>I^O9G$-+4^Glwe^gXUNO%;`Dt6@oXDe?2Ul`Xm2!y=rpdIwVFKVGH2 zP}EA>LUhs~5SWl;Gs`uS{0;HHq<^?l6Xhry+ro_y8XQBv#_H<{LrqmgX&B6v3oX(W zYf=h==GhoH#b-?kZ_}8c?=eqSU6wbqIWJ4NJLo2;bdc=!)91@mTUYC~$QBhPoY*%B ztW?~}m5ib(VOL{4n+$ca<*#QvQzR6MY7!pZvQVD_)UMHMRt8|eu}dC^-SV~?DA_iL zRjnbY1&mvWC(&%tPaTqYI%hGXy#Hpbj$4|5w*a|ZjaCmxuUL@w7ViJs-mH(K2g@%K zq_$xoaVE?ILl<}^V`@g1MK&DKwCTdG!fF8W4=5sC-1oSzMQK9P8)5FtBOLd%(FrzN zOe9d0aR$)PU>dv7(}m#(w;>ipnM<>MQ4DQZe}th8ii9*f?0@Fkupw$#CJ4? zY+QvLpUAkUd_I_OH<~{{Y#rv;2qzq^HX&^WU_Aqq|48d%Fb{2$!C$OpN-g0C>!>)L z-|BG)S)3`S!W}2`=T4)_4SXJ-0VW0T55bDmUSo~-P^qwaUbG5+9QEw*B zct|KI3ssFCq@jvdp~&|UlsCAbVU&~_Tnev-9*Mh{oDg6H{UHSw@Y)byiu!Rouh<+v_#cZ6?#4M_p9K}XBuiSl~V0jnz z-5*3@H_a!IM#%>5D9y)3Gd{#6%n^C~M1DI6^bgkpi^z+}2khyzQUSjiHCY^fw$di2 z>U?}o8FmrA8GY=0Gy0?!SJ9)IAYgz^$N=G@!ShDT?9cVWuu29GKr?WRB22xlMBpsE zalAA~JeVV4xD6WUDGXs@BXE49sI6jR7!-9eWFo@t5EPxEtdTUW0z?!QN$pr9DHn~B z5@iYT&?ygaIQUd5apyfOjVTS&A)*wbekx)O!6o}uNAPlsC*m{7m7qp26sazGOq`g> z!f1Kg>9RXh#=Vkve6_s#;#P!59FQwwjnLrIqY-LxsceG#mNVmL7OO%JHOQ9CB?$yt zk0tIZje^g!9fp*GdN?H}R*>2jx0-4|x$)J}F$eohLKhi9SPnDV7Egz&&1FG;ku)>I z&#y%nGfakHy`Y-$a3b9-#G;~LJ1cxfwY**pHfHL%AuzTWL~Cz1qICk12Af=hcr4RRzSzijDz&NPiW#oI z_6Nur3`JO`6K^DBno^~kEFdUt7M8`*6ZrJEqKRV$WS*~>he%ZYK2_x(i#II7MB}v` zABr6G3@k?nl38+pH+tIHcC=oRSXYY%CuPq6OLLqcBbz%->=7WG$q(VAku&TmT$bcW zgdwEfLupjRt!6+%iZ|V*anRCdiYJpGjDiPd*m2$=YR@1IrWv>7(&Z>JcO7_H(?Fv} zi%46Ru7r%m$xz+%++gXiX1BK;vd9xh1t-+*HZJd&OJ)UD{KY^z4onsV(-h>ZK={~O zkzftkF`8TpqvOXX$ivFGRUw3)qSk@XchI|vVk~+uP1hza4j{j(48vk+lxz`Hk%OKt z+|@|UmeiIlDdlK381>TA!_%UwJwgjJyDH&nDC$HPMqx97_SXg8l=Y$82*l1t=%wMgoc z1|5aJEumV343;xq!KOmt$1X-P&%&IC=egz`3Ats2HOi3{p=49Pe8tU-U1UTMCv~AK zs$&mL2#O*`rE``};iB_Np`#1c3uaTJ=-tw@n;|^aZ99a*ZmiCoirY+Z2&pni8IzU; zLn=|@S0ohb{;4wa+hSt6*BIL8fY%xh1W_O> z=yNM4T62w)=}!#w!DGA0*`?J^q)&2j;lDgYW=CTPD1jhECJrU!GEIxk6i{~ANp!MH zjmt)FG!Y9`O$ryEyg-c<$_B;>{SdV^vru)6;E-l^R+Cf{Q;*bZgeqPWJZwKFA=R8s zeB}HzG07k%JAyZcmWEm65kbrQ>6Z6K%X@_?w%|f$Va?7HgK~31ChwuWx=7MEmNaGr%^2ISE-HJ% zG@k(s=#A1R5Iu0UF|{dB(q-!0FhyE{fF|zKFiTpmo>O~exO?fWLMrWcDlWlKfa(&X(t!;bk*+DO{Y!RyCYmFJvD;ARDb1RN^n=J* zcdw;MpQTB^<#($}J7#%5$EJ&1jN{_nQ*y%~RgIg?lnKO{P`$MO0RD}|*NN+Xi5R_T zjZd;WO*w8Xw12vbnc~GQc6->06KQOECF@q?^4IH05=20FoIJuggu6~;Lv<~U zV30`Xhm3^XC1{>RB~O_7^Z!AN64QP%%1qc2sCXg}3WXEo^28yBB0jbvwv(CRLV^|z zLm^5cSeKEDQNL78_aJv_qd}U4`Uo!Id2do>_R$uYMQsbh4ovOo>75FxNZG|pQx2xJ zq|u){nMi5xrxKZbs75&4khyeyTZz;v(Iif>%2Dd3YN^vFl;hp48-owA_rTdO+R~Wh|~k6caDT zhEFPbK~sPLAemr$7{;Ot7ZMI3{Kc5+n%Kt529aA8*Oy=jU1KiwK7UWNgVMe_LPfhY zTQ9C(r`I6eQzA*UrgN8;dn|-G3rHh!Oz_-qZq3h;JE1j5)qoaEB*T(3T#=4i^M*Bv zJg=aFrqkn74Cvw;f-vhGSsP8o!)XA!s+u7pd;_!OvN)M4!&NOZM9yzh;5KT~2Pa6G zNR|YGi&a#qS5ICo>}Zp1X~x0`fI=4#Fv8-)AGGNf7e|AGBCnbZ#fJluONH5D#CO3- zQDi(I!-dXlQkJMW!brHxXrmO=2w_qYGg@HXWWC7I{N!ZS%FSdC*wY5k!%V#FrZD-c zvHd76N8z+U1BKCb11qyOCe2jLiJ3l}4w?&12vSbos%Fj~)UlwXE?B!rb$DD%dJB8n zWC2P6SH#b`2o|dFH&nf(*<`4pgIs=HJl7rx;g7PQqqsF0AYC~Q-r^B@aSsQ#2m1}K7km2pFXr&i6MaQU@lX_PusjcDVsmo6yg@zAyK&6T;J zRYK>Yh(zS<;{?_euo2Y6=7L2Y0X2dc1f5jbg>UMYbSt?*l{+U*B|%d8nR!}6w8-5$h!t1q779wsIctM7f&b*Vd*+ab+~kcou3l16d@Mc9)8&}*Y{x_) zX)VAWLmf$4gb5zx?lEH2$TG_Nz*|jK*%)l52XB$^aScY)2sXzLk=Bq6|7J%*WXnZE zq9*p0a{!l(-4tgfrR9pwzxueNty8=ynf)$n3$h7ZDOHt6`cxYtgt)koq%8rM$Et{F2jJ zN=9G#1!g3nkX>YQ<2<_(4FN7`>t6EpZ(hmBeN{_en4m9$h?^J~L}xdSmqGfgyTGXF~- z4XxTjf6PLIXBGfls(?_cZPZ8IWWQ1+&=a>+imNAkqh~V^XbP zYoiC$=um%?(FA@2WSY>lr^y3m7KTV?iae;uQ-TT0}!(ZBl_e@r6Ds;hPB8|u$m2+-z7pp2E&M-6q?80D&ByW} z<5hk!vRSsSSHOymrVNg$P7Tft|AE^=L62pqhB~mgZor%wTq(|U8aCcZVO|v@f!KSd zG{xkqbeHY%NnrV_EUGmWPIAq+17LfdmIjCyh#hc3=G$VFfN>U>%_*B)c0slgo~YIB z;qhM#k0lLR3o~P5a`$v4q7Pk=EWQQ$6qgELiP8YMtqaLQ_bH|xvzY!_{OpCFDOb;> z#LaMRsNwWx=XGiFywPmf-U1)8B4dr)t?pgcHLvJUv#t%X@-+Cnz83yHdX z)LSU{k3|NcP8PP62HKwwEAq9kB;0<_0PVymp_OcQ%yw(SaU`uH)@~hf5=Z+=TH39| z69|**g!?fi=}&9BRjKxG?XA8%C6;qwcV2nA68nBSI*VB%*e$bo;0fj_M@sd;h%+sS zfTo~J+`21G#)eJ2Ju*P+NH1Ne3LEhR(zy>On0XpLZW+)^SGV@ku_;9=B0T}ziS`&~ zJdF<*#qm$nra5lL0GGNozAF}Fv0A)dNWGYxlwRHh6M{M>Df{%g1n~*k&-IHW393otzcJu{uaVcRSRjg_z!-Lfv2>^o;=x${^UvK@;k1m@HjkOFlP zV4e_^_IdU9PE+2?VXrj1$&5N9ZG87_&{#Zkd<%^Jmz=Ti0q5|MC=Hji?` zMYAmC3Y8J^U6*E|jQD};DXq>y1CVZKogAlAYj=bKaoW4>_pGuxKQIos0OGEGWluCwTh%$+VQQ_#NH9CFKWM_4ME^Ai>wQ5sjz3NlOK z78vK}E{_^bR#t(l4I%v^U3_{ysKmQVN_%w@UwB?IBQ&(ovX*2=5dn(Sot&^*#(dB{ z#4r?hg6d^$Q~J1&1=0M}^}9gX64l66k)=1Hlr#5ZoO86MWl^E1#*ZRTIPxe*H~m2L z@&^C@Sb94e3vxmKPajIAbts5q|BJO@ISS%eJ=&3xnvLM=_RkJ=aH3V?1H%QA&bp}C zvp)tb3X1GBjq{;G`|CyD^)4$!dQh`#q}nC%*=p8UL?h;4npJUL6(xlhu0d9#TRAfA z6i6!T3^GCKwtcHZ(ymSKT^#d(R1JA(W3Lf|c?+6^4D~9PxoOvRZuv)(6QGzAXi#Po zDO$-uQda+^jVGIgUu2+}c6)~57CZsCM0_gK(u59#EGrp3v*=o)%HC0#i?Tsr7W@s3 z(F_;b)u0%d)YUszCg^3+6)io%@k|q8$Ae0-E;B$C-C)vpGkXF)4Oe7FoW>G#Wc_9X<6w#The-(r>CcLQ$>m~ z!_2Ej!O}u^!Oa{MXkq8*H(flcxW?Afk!0{=OBp~KqaDYk1+0<>RJ56@3!YP{Nj$rC zX-EpCp1cf+reGk}YDkwwMb4d9 zaSIJx+Ge{}=^js-oMy@046kO0>rhTp3E3!#*O9y9v18uHM-KYLBXKn#>ASDsihbceGxOXWoNcTq$B9G z=mp&YO(Uz{=pv?$+uzh=`1~HscSf7%nIc$oy0@f@kBTX?sZ*}-50bhqpT$EE&ABye za8I2VE%nn0MgY@qRDTe{SGE7nC69U9mwfV=uYKu59{X6_9+`g^-7^sDpZ64;w1lI8 zJm8$<;YWkc1iOOjw0nt94+iB|i+LqA0CfwhhTV)-qDlqzNEWEh@Oom@;FdZY!cO2$ zi(nTdkV1m(VNq!3*(Jq$H{i z)nErz=Wj?1GAO=$kXl_O1nD+jvb_`I!J9m-{-#(H;oDheCnkrcIR(Y z7HF?qz=Aogs3J+PI#SnUOQ%>3F;8td4PqjWZXD>D2|;UEe-gu1+rmO8YaP$0Kj8+q z%q_X#c%9T)R@>#cvrN0ao~YsS#0|%-#XsG4z3s$d{1>P5=CiGW23~SnM=;^qS0crn zc;&ruqCQ?ny}#A)Wt!+Jp&GN&6g*c16*J&u2ffb6{Yhu+3z1vIr$mG?pqLc2hU= zq&FdtjU+?z3-!I?sniezMpExNqqE$c&Z3Q{p?)cygD?oLgG&=R9Bq~*l}RW)iqR;} zcZ7Q^c>-DKt}<%91GE*J9H!J_p>ZI~q`x6XBS?_-;5R;Nxb+-2TP> z*qlgp9tzzst0|9?lz`iE;Om0&P#*U!K{d|EEH$x#Wq94}0Z+^SqU^?0F z&EC+x`lnAzobD|6Oa|@{bgIHDGdBWQgDjA}})B`zIl$elhe~xKIXjF_0h2%P! zQ;R<;lsGI53pttznsc@mc1=oyWYMBWgr#fXA?c{81w$-sCNf+~F&3qf5yKu+mS#rb z(NIXx#=$lVbSv5uMJaWIW8gX0b~pD!>pLO)<=A!h8UjYn5zJt=?0*+X*f!TikJfol!5SFY!O`4 z*EUpN40jo<|+J zO7|3DJdT7)RrF3GO$g)^%oV#;VqqyQ$Z732jQ$Zi z3Cx-)l6#{iACIa+H!)9XjZ0U=u9l{70Nhpe#%Zj2bS?L{Qu;YT--TK-t_DnSjbm_8 zk+A$Nt;K*HKybA|<(6o$PlycQq0_TmLquw+4C>6FRA!wf?1d!WXjA-j;9oSw3j`g6 zb%hmV^J(LFmYbtYDUB2yqiMSg)K9XQjaL8sfQK^*ER?aQ+2apjkR(^YUr)u-;0cE$ ziIPge;o?%M7>*y*yx@N8w$34+KV_b&E)A|?I(7ofjT3F1rT`~tDL=%AjwJlBcv0D= z{Xp3|gfHcZr-K;CAU+!h-MRYt)!ngFrj;5cSp2hDI73s}HA$Su#ITvFA#OVK01(!p zS1U@2G#TQI265$hFI_NP6LK;qkOiO6TAD{5h7FxKenM-1_%>wNM4^MTrk_s`Gs9|D zWVCva=z{sRnaT``QHA@nivN@d*bIF*@wKE=M7nJ1lLlW{x*&2`k~&!OG#Me;FAT#C z;%G=7p=w)@;mmM*;rPqO(oBe{NNsLHK4!Y2$BeX(d`SnZ+m_k7cJd%__#!;lz2}3{l8cX8S2sT?zWqMVaC$2xi`r@@Lx}UX09bq zN}}17(S_sk8fvFfb2V0LaW7JlNF_9v`h~Lr5*dYmNV8_XK)>(^O2hA!4WgZ`5 zAWawu;)zReaMBqs4CIZVXe|OH}ffjozk-d#8!8GQ$ZR^zdB6WxHq+fCvlr^EoViZtcMVKot4A(cFbav1@{#7xP z4$wZWA=vx^J2t-{wYVBN?F5-ZJDMkyvh8Y`(EpC-$4?^AzDH_%RC)0jqsc%FO^twI zO{q~!P~q7nyRL?PqM=w_G^lB_ff+(X0y7bViJ1{m+bIhvnNO(4ew>uV7ak-+W7DbR zhMrI6qc+88Ge!1d43N(_ay5o(yZI$)a!pFIYm>yjxzix2tdcpJ=bB82T!+&RU@}^U zNimBB_3Pn05wl8+h^#O!{e&nNB2+ZqKQSwd^dKvXzV*(Xm@v+nTb6T}l(PLeP8nK) z$^_U{8uP^$j3;5bL+>ORQ*TpadqG+LZX6c6u;jQ9zE59l`i(AjhI>4@S28BjX-c%r z(5;)VS_y%34OG%NQqu-c+W7Tqcc#S*M<2bZ~6fxRk8`@nJID{E_U0#3Aok zF`RB^TS4uiwpzV&WhX@*MkN@MI*)15jMj8HP&!e%K2tGs=9nK34695*oeS75=zdjCokcN9T@^KfjFSz)@8^PVLamMXU-+sk0SV=iy%4>i3k^D z&ACl8+j9vSKL|9baJ+4|02Q$JZw=kU@Sn?AKeawCJ>4Xfa3*15PXy z_fr>a(Bq+)#}k(F4wjAzOR$*jg4!38N~3VW!uY5XqTV01(SF6#r)no`=iJdAQDyq_ z%ij?yaj6ejpVIz_nBL;X;r8R0!U66mf*;*^EHb1gC~^VO4A7}M@suiO)*2>Xxzc3( zJ82qdHk@1SSRgK;-8SW@4y$ z=HO=8?BhiiaVc}RyQu|b1U*xUBWO;B&X-zUE&UPC-fN;?f!1qHgpIk2TX?WwDv#jX z4yy(`ZWm*@qtf8p&jCQgL&wgSSq&Trb1cH{Q4<@tBng@Nhv7g>)72DCW7KN~qkYqp z&ImxNv%>gH8iWO|7{P*2aK(gI#FPR@55=gsT5z0dTVjTBW~jakW3mw@jDUlJ8)l-& zh3W=02M7e(GIVZOhXvZz3;Gn#6rSrLtwec+4x0WZKZG@-If3wAU^5QMs#)qomd2Q8 z^Heq|oKzTvC*n6l5ThbOPOK$V1fB&?pdl0?_fHd_RFfqj8X8}z;&Va$Zdo8T9%#<2IT3`#(|>dvP*;{klmL2Om9o>+ z0X*zK-MS3F`<>9~lP4<50aXVX#~!Jnw4E_onjoW}ogjm-;3GX`+>nJF(hdkkYX=M$ zn$!xERCMhNFqm;3COJ(e&VUy9qQkQ$%&;UxN5d0{4((A5RM>r=ty<5f;$pivDZm|A z>e2m+ev|oqQAP~FS~-wQ#FeG=a3mC?%EUww1z{jr1Xl;tk>Lkrco}XRAkvReM1#UF z8d$vR1{Q1z`RX-D_@J80u#K#cNaB)U`fk-~P6TO^KfS{vZt#0pn;Tz8_dkywl$1Zm5* z?US0*2^eTJ8bPIx(D*SqF4~Rg}S4g7E3{l))PNDRLcsc z1y0E0Rs}idN?MrKFQ{QLX=!bIwlt}r{p2_!fD>aFha1HNI>s=g(nOaIQj^nxMI?{F zp^w~A_blhh`Eg2ol=LXz9o*4Aqe1Hsd2gpfrQD!|UONp!R3UnUlm+Vm^oZ0KF_IdC zVADoxSnCRTcQ`k6nSduT2AZ)j^alQ+fg*S`M6AV7b}1UkvaKKVklH*D-Lk=hw4t-v zOK>$g>^32G8*H|l3@QHK?X`Mx+39^FA4u0S+-**JM>tdu@Z1rOOnm-kzp3S8kf@@~ za#Weg7!U=tHc0dBr<7!i2U4CQUilkWQe&*a&_)Fx+A$KMH#6HISZYMg@Uq&mCEV8x z{H$%xIq1HrV=mXkU?C?HPd1U(L-J0h9qtI&ZjLB*u@7w~TQlLW!${Zm;!pTZC7JPj z&@-W;XIlkk+<}Pih@%ris1=<6^R(g?{JT;~dPy+DKtTa(G*L!;MECZ&V~68lTh%%o zzr~x7_q#-)DQ)}7!w4yo;iSE=P(e*d1pVW)$t>yr2WJy<4%y76`0Q*p)qeh+*|g&h z9O7<)vw4IP8v+~;7mG}pup|&?B7ZEmu{C+nF~(Uq8BN%)jV0`F2Pq0kGT?;M!u}$W zNj6z4W?MPWJ1WeWQVl=(_V zQYE{IX~cY?Oja?yOmG9nf_}_(1!2%4{yNOZ>(cl{oZRs_8M*0ncHQo{W>IP>9G=)f z;(0icVc8WoRw+-m?=h>~m9Wn`Z;M@Sf~iwNWm)NWT6LPR`^j+IrfQMBw#t%hD$C6X zN(pE?jphgmI?E2P={GRE835J+*PceFBAtTTTg=2vLp8i<4VjJpNGPvw!Re=qbrAAG z(sS0TOP}R}KACm?sA737Gcrgv44F3=78Bj@{YC{{Ia#hzNN(`LX-W)R+;?WW3o48S z>--*&<)ZHuCWqnTJX0Ef^U+e(BUu*A)JC&T>U~EO9Yo~QnpiO*=7_P}7=7WO5^4z@sxc_K8I~Ks^ax8CIT zG(cQ8h;Hg(*P3c^j2#HMji8Bnw@Ep2l0bP7Fi6F?Peq40HN_T%x^TJDP>T^HCp+Rt zol1!67CdBvsmniv-SjFN?|LPE7nNT6jJjAu1I_ipPC$Bwt1T4chl%3Wf8sC`9zEdq z`lGrjTC!ti73MjY<^7MyK+LI9XDU88?GTNx9tnkPX}kE4=7?WKL{1JcDJQG1qArCU z8bj*`Kl9T_mZ=Z>ZIw= zXWkQ)?7%24o6ksO{F`(vZDC#V03RI8udb63+8BR4V{dBXU~sw)Mk?x ztEFyH6kj_TDnaDhNCB~@0a@rE!7TOOBcy6wF=*X+r_g;4Tnu3ZZ1pV!uivD>iY>nj zlWRb3G*~9hcn!KL> zN5v}zX((htlSJD~~BhY%eW{6fuFQ8Njpv)NBdwU}rO!&^6tyn^CdCpDNnaxU_! zI8-_aaSNz}(5`!`#;_eMwX3#t1Kh9!ex@>y*O2-{e0%ysns!ua%(hdM?2`80`X%TO zWs#qPvTl4;FFna-DYbID;Gny`k$4~oHQ_XUGQ6RzLe;R4QXV>Hv5mOiM(jE$!)kL$ zimSG^!5dFF*4AR&S!sO+a=%C$q#eW`WM5h&Wu|sWwMi87O>Z>bAu_FmgNH~P+&x~Xhac0e?*d>KTD`sdTF4i!nm0H%RfQ8?L`@C<=!UFcIKT;G~Vt)2#hy6o#R zBQi9Il8*sJGHDhIv}8dz7zzbaqgPUlfaa2**{>%nDnvs;8fO^j>QO=bdGx5N@^e@N zCeQol*Q^iMBI!G}Z>}AP?z|r{0iJD-qjA4D_z0Qtv>h zj_jXOkpr76b|R5rNRVCa+;3!oaov;!r>7uoJS<^Cwyw-ZfB^u72%RQ{7vs1%Nhu@* zC34HSZBTTQtC@7Qo@|FkrR(_aPU}dg0jpt?Y3YRsuJk=w^LTS8&C`1)$;`zw#1uI| z%^5(=0FvcehbE3XKn)&+Q1DHp&UCg_!M_Y77!VdKhhVm=iMv@?PK8@f7v1il!Q!p*szyLP1*$k zgIkO3D7J9Oa>q3Z_?F6_p_`!lW6BR;ZDY|8v-cv~MLEH=)**&T2|>Gxg;6M*V5_*6 zUYk_UNd55(T|iMvgLUqv5BUhd+O{zi@S%uNc-!)Tu^Ks1Ewfv-P@0H_Eb$1JJh*Yd zii$K52!+DTK@#c!_KHTT$2;E7ERsnfkt87!3$xTwo}i0vJDTyLuDFhLXNu}jX_4mg zsgNPd)3_8!Y?yT2{LrN$FFZg5chO2x1F5_og=z*CDas^BVlU7g&Xw6V$FV#}Po502 zF4j}T3bLb^#Oy#6?!>1W_98dtp#=H=#yPhkXx(Z2kb@`_&Sb(PtxMA=qV}-fGsOYG zD?Yk<93RHvk-wz6OHK?UF*KY>-A)pa#&Om0c9iIQ*4W{e@Wza*7JRr!!O75*J5AXh z=|x)9M+Vzsfo+M9eS*NY#XXkdo-n2uOISYA+X4^^`#h|H43^lHh3LjGYktgBVj7WV z!)M>$j#r4D8TPe#thKT6Xq6`JVTQ|%6UKs{(WpZ#hm)Qc1P`SphGx=DzyPN}Sij8N zP+}S%Ze7&RH8ki)j`2?+Mgvg7jKHNqLWRFT0PiqJuS}@_CT9l^i7fT#Q9>^XwNxdo z;NzH6Tk=a|aOwm{uVTKxMQVmEm?KP42MClqh&I5sp9VUVdV}dCj$H^6<95lJ- zqM)Y~xU`B!b5u1tv|I3|n8g53gy~Tsw^1bI#mI}2+Hh$!AZ3Kxn0ywQ4R-zGo@F{U z+`8DLD@};j)V(Kc(NiN@$_s%)KtM-orbq&-M!|mvDsJHwClk4nRe}L1i-zOrunS-U zwt?TgP-)USlXo@R6o%zcddt2f=4b5g4ta5~b*0K^&=G}@S*P2*T2T0YlaqxI%t&G_ z8at5+S2dE4yV{A%o^L{a-zOQTA~$BQ?zB+dVTfUU?8*#D()jt+xPc(jAJg?#ta&vz~2;`t_gC|l4LK-ijlrV4|b+n@L zLC+L}1^)(_p5IGlfSx9dz6c~1s@UPGh1*|O?XuLvI=1Cp3XSJwz1eIp8}(+hc$2g@ zmv-`6JQG0hQf`VN4Z9erAv4QpHM}vot>hO?CYXG!HDQhXl6bAFJk2aQD{QzZsB+nT zVYB?n+t*lp`Q^WG2~WhWvk2n2DJTY|@)5w!Jjo)}PFQUTnWTV+B*qN{oFI)cEd4-H z&%h{9?lF`~MVjoQwPqG#R`cxyw8Ln2idZ4{Z$`6=PryzYBoY6Y`#~^K5O)j|NmS#G zgRO8zBlL9EF#&t(vS&||?HiSb5Fh@|uF;l0UK$#2S*q;@kX!(bPI*gmCJ-@&SXLYn znwpkQ5Z_6Ju0)!Eg&B}xEak#MrFQoebvuQrm878z3n92(+KDVz8kZpiFg7KNAEk9o ztQ8e^$LgplM^qewbO#bfJPsb!=%&fTP`5mBm`M}1j+zKoWv2z@&D%!XA|;`;g_CW7G>oxG z8_7AOsSl{m6CI?;<&g zwRt%?$_7ryZ9$6q{HE6v@fkc>nTXeJYxSV#tG5?eC^(!(tw-$UPLAD11yxoarE-a) z8nGDetgBSLhBDa%T?{1bqS*9qbBaG47Ex+wN8krFtcFGHrb-^@M)K==0DjJGJ5}MJ zQ&S8>?Ner`J`=yom~d${V*w-|O?TQ=y*rq#f+edVkCqdw#`2{Bk#Xu}2o{Wx=(J@K ztRSdn$KfV_OtJ?JLzX+4T~*K%dK4}T{!KJYRT{)GS3GSX1N)1G;RbMZ1{H{-^a&%< z!2$^tZn6uKVACnu1qmPAY2)F#^`cOf20%<~Bw9s-m-=MLM7$&U*~xG<86FdpiV9c# zxJ0{5hD>ix5k!W$1#yQg+7V$hjoM^%8gj|Yi-#ppc}6-EA<#&eEskeI5N&X&AbQq; zkb`$D$DL+71bZ1P!6peRwBi|CaI$R@fGZoS$Rb>{kuHenaRyI~prJ4t7bMZr@o1w- z)=)V_YCDMjG^D8<4Q?2~7mXzt6qp4R1WvqmwPjXBPGpj0B3?aUtiGfCn3G)5Hbr%9 zk2oGu-D9I2b?H+mh#m}_fs*1VOUY|jb1H<171f*kM2Ve8k4Su`YAS0|5mHWikqGi< z-xS$C4w_PenbNCICyz|bXyOdhM4Rhk^%i7<-+&hIA+mwW+Q&4w_hMkAh8dIrj?y;# zrsGCtR39nnLMWQx$P04|e!>XbCfdldJCyaYfaTtH!>1%ra6MX}@WzaTqN&nh%sjym z23Dd8hfTQB*ddd7KdHp3(NC#wW??){#Mq)uWQc>TTe?%BnI{~Mgu)TXcq>*_gqvZ> zAVe-6H;+7yOF$#>x*^{POm>lrW`cs2W8iojXoJ-%uNp-?L`s#M#~kUxMof?DGZr0?T0Dvx_K_v2qS}mhj7633F@9>~iII1}jJh!riZwLaSvAVo z03nsxZ`YhDWPGi1n0N7tZq$Ax4QBN&(% z9J8XR0yW1Q7<=kWphd<7f_i0`D7Q}=&sYY62BCk+;~?o00lEq-0yAEuP%B;mq&9S} zXaY_?KHWV}p{5c|w6w(vjTy4j5>Tu3q@%QF!6 zQUaRc{0mMnN~x&Q5KcYHk86T{NM}sQu4-(wgau(ktq$|FRkADj?R(?b)FkYtIbG1O ztV8jGmvSW~Fs5d1KqFq7Jj`jEArkuX$!sFKjmLCyr{ywalbe?=XS*%#=ltAset!|l zNbp%{Iqdhmd;#7h3}xldeFq3|a;oEgF38Pr`(n7+0){8dPriU@QM=Sa2qE&G;pTno zm*K7==iSpLqjm|%HWd=zJhg!H5{Vec7;jdgZXFy| zXI2SV#E}C*@*X+EiL8m$o7&zgSQrH}3L;_z{OI&XAWG>JSth8VNyE3K$M)s0hnAU4 zau@mQ>n-?}e{!cq^T=hC>%{GfJC1mb4CTUQu{5zVc5P^(nU(K6LNJeV!>%OqxqoA6xQSPpFt9 zbbvS1L^i3cGhlyT*(pxmyV24x`kg*=Pg; zH2MSe36jAd6xS(^yjT-%HSIGcbAg3wix-_mMJPJuhEy9$qA+3d1xjTjiDwZ2StTy5 zev1gmm7w227BIBPrC*#(0?EVkxB4+MXEY|XYOJmV(pM1wd#rL{wF@nPP-Qn@S=f}?GX8+ zc!H=n0d0$K7U zYEEBl%UD#AiY+^M-J_Ed&pQN52xq~P$RrT+)M|DY;)8x`B-?@wM$`y4E1QshaHlnU zB4`2b;P%wwp>umbQi(qjqIq~NK0>T&er3ihdugQ%hS7Y?pDp=_^q}$LgEY2IG^C+M zz=$d?1#XA|K=mR%KZI!vMF_DSV%IRgZPQ(X_n@38G{JHvsW)A_Vq^zWWT8e>jm{MY zQB~?ilEz2FX@OU5p3oFMEfnxk$CIGZ(*72JUzPa+`+Po8%!PI8taHI&c~4FT&H## z)bxwO6|q`)r>ypd9D&76B;`Li7=}c^7}}hzP9>L+G`HnS3vz*jj419qT3}jk+f>4a z8&OZBEv`6=_b0y#)SQaMvbYOW#jxnA)S)O{WUk-#f%clj+=J%>oj5yF6ne2tje-3F zvq`Cg+Z2<1$1#6#3ujfiGZ#*M6M(6<5#Bul*Y6eR6TN0L8Ijae;C9wWRBozq{=%9EdTkL8#HpF-OwwTXbOKpI7ZCBIi4T>a z@hC#=3(ztYM|UY|qOv4mGej%26Q3!%91y_q_-cv-O(~IMD?_ssNGQaT#pHhFvQ|E1 zVA^R8IA-ByBd4X#=1?3Gwk41S+sMl8WWm~z(nv$agj0}OJPx|(0GLa{ZU+|{5g&#} zw)aPvMHG!=M#sYg6=g^paAhw2kb*P^jYc3q09lh9p@dL!bJ*{zkTQ`9ovto7ta46{ z-at-{8;Y1pHjm`>t4cmW>kGk$;03^5$~1Ve1Lpk#K2KCpM=#QjOIR3tikU~%+_R87 zhEJF22NZ)xL#>q7ofN=*ArL zq_vHQYMwZ+5)HXJx_RSc{kJcWvr(nlc!#qbk9LAE>QqL>78pd2Wjp71#TW9%n0AkO zKmOhGsKrfhlL%IdhH(Ks+Hrt!pyfV}M4Z%w=P>DI(iFB(=7~Ulz`lxenM77{N@xgy=hhC&_NU(1Hx%Eq2hwpB{>$XtR(^# zonerTU@S11<`dSKCw6F%(dXz)VkQx&PxU3vN_Rn|F*6DV>NFXR)qgQcm*|8^d@ltKsd9X|ypDTsQ zYsdLYXzs~%VWYaw%}FhWeKi!q;<+oRTHZ;*7fo0~j!;x+uQ0+M^@OkY5ImbEN3P^~ z0E*$)2os1a09(up(38 zNtAp?yaxHJ!uc4T;OKzJF_G{nzQBI&?!GZ;rbk`x6uj0}3ysriDn zDdeQN83?tAJkNUOT?+uL2ipfemy)hWLzcJ=_~ynJ6{#~4S8oSrfqCdM4-&>KxTx2% z!WQdXj9YjtgM}GmFz6{4mBkwho2&-V{WVj+RYKeyyLF~>D0qLQL+rYZATs3$eFjk9@w^P$uO0>`})eBP`O0QxS zUhD`^E>Rvg2;k_h7pEY@MYpTGE6M$t;Wpp_=2Zr36m*#zDCZJthNjq#AbkU^w}c`- zANkmN>X7zipDW1!!9bZDmCc-hDH7_l+& z;zlO=i7<(@o1H4C$?4RC4w9VFjVA6c&Dg~<-~=I6<9K9d zZ-qHzhzJaO5ug`K>z{w|6I<8KD6ly6^r zNpur9!RdGl$02okH>+4ZgWlK9%wpn%;(Wd|RjW<_xY#uyvoquG7Gx`_i}sN+A~0(% zQpSl;Nfc69BDiZDF$aPW8k$tb)Tah0T+%>k0u?<`LR$cU!bh){5JM&%BE#hhC1`bN zrTJ{75C@~`8s2~>BIQFcWI}fW=GF*D$(qqb(%_YWCy$E;_@+0#gzUG@ZI-K)a7=_* z&O`}517#&Ra_|T)cxJFkY98nJiKN71`FN;GTlmzfX3}XK zJ-gFTq61N{gCK_Yo9S+slo86!!{g~q2|^BctlEW{)*?amuz&?wBam4b9RRZqgtW5+ z(Y3r;b?5?9dN;%NG{E#3TIZD4PUng>XVf(g{vTXM$_K$wR_| zTsPze2SXqC_7>t-wt@Nn<^J7D4hCWE$W2HDtd3%sXgGO_%j5zMmHveH3>2xLaS~8G z$t{yu7#KnR@fZxSR8;O!ZDsJF1=Y}BVP&}>E*7-1fJ%TI>^Fw@sWU_fe5Dl}fiNfl zc^RRIAReUZIwuK18JHu(YNy8(s}`qPw)Z(N*Nb_&imnNLyc=`@ZB$2u!gVyqmDodf zhiBDBI$SMBZg_H%)E?+??FJJRQ;R2-(+5TR7MFY>;CC_7&2BM8_6_VTjXPn}2P8G9 zmY;UVrY^q>7iA_=7F+CL{u}Whqhadn#hk@iWaxv)pb8)hzv7pgSC`cqv6;&JJyGOg zNSTHP138f>ty5UkdF@QtmXWQ7|_kNRvlF8V~!E zAWh_%1OTQEX)dRvLjq3AjOVm6DC3coWYCl5w8w7g{@cuA2_O|$I%<53fr3~_48ILJhX>;DYb0SRx7I*->v zS&7f;g*TojAtHPS;?~42Z9+xHKolJh7p{R=8TPZ`M}#d5-GZ9%CN8CeHcyt?IW1Wq zi(sA1g9#$qD91w2ji8&?$#KW2H0e1NrX;oAOaJMx^T?wP7si zp9&Vf;Pe8vun|a(3F2h5@#8x@UHA-eoKC02ux9giiLhWgzpKbjO(VWhlcr0Mxn1MQ z3BeJ$m~e*>%#D~kTHrNg9r=$m%`KLIkk1TZrzuGYJ;DIQL+wx#2&B?!h+LM`jCLA+ z_cIHXC>libiDC3ZM-~whAKNY?{6H3x?4Ka{uRf3bo0n)wM|!3hs@Nr0#i3zMXsFB+ zzX^G1mr#5tRpoW4syvN)Ks(0V;(qZ)jQvuJ0lErZVgexuh=n7{E#|gtfJzz~v5iJF z55_#eEGwpm1xAhtG-G!ZtO_6=0v#rkqVUiLT+F4G)WtBYHopZvNQY`M#G?Wb&d6e|IEKXa z2Cx(Xw&`Rl%W$2lm7xK7kt~H3A~VNg8vut*4e`|C?X=o3=zpNyhQzHl>&>8+-VO1F z(3(QhiMGIHIxuzQv2{o`ZQ;l1@Q6ZNJQ12GGeMh~I*b_&g=xfnyu9fKv<0-^Y|JG` zNw&#CIrG%AwhdUNb{M%CL(sLqm>8154{Aq9G4G>k;sS=pG${7zo7IQ>k1Hl<91GDl zh=Ex98F8orHn>Jb>-#)u62G|mFoGWq$|HVrXEwXVsgt5)flyd>#P~T)rxH6B79qeg z^J+B^r>>~9vEVsS4yn6dq)RfegSC&`T_O0#1FJASV za>ZiudRt&Cpvs1Ezk7Pf3?IuFsCnO~yO`I9FzpMrDOLm`S2!C0sIt*!le>e`7;&@@ zXTVAT3dGPGU1VtOVXi?X4eNm@>RS+3YmgYnwe@LFIWE zj0n83fG46k?|})WZjeL>X}G7uo~TGup?+)M>57;1+JSp5@GeY+Y((XFIn56RO}@^6 z0mOuo!PaLrDio6SUgfu_MKqlm5Fe!cSs+(bh|-)S(40#(*#T=EG?B47E21HJGof^G zjUZ=(MilfwvVdIYy*z_*d$}_S%Tkx?ruZg{{AA4_LFM-_9n88;kxe#RVs9`b=EyF~l{Uf#Sh}kr1nmVa zwpDRXvq8b;+ik#r$6W_&?T+TUqj}1%iwZMMKg+2KatfWY1;eaC?&x9f5zwFFW6$-Zxkw;3suniqIs$AnM$9^bul5EJ!ORPcbEODQmw1i zQCHdD@kXeLCeU!FBFUFVpve%@Q>`bL5`?K1%#)g>jmEN~3y+)n#}tXb5JN8|dQPLM$){ zcV_r#SQcCddW4wtP!}YNdQH7z8skV%4WK2Y@r@C~!|XsT9$6}W56YpU29-j9*>4@h z{xD;7xKbz0P^XkMB2h~5nLWi-J9^Bhk)s98#9r0QnAy&&Atmw75Yqum&3SWZk9UG4 zmkhLJaI(uuPx35X$xG6ggx#Q8TjpX(I^;@&86&^@Vw6m>SphR$*_1rOGh`(TMKNg^ z&#ucIAe57*E*sgnA)Z5$>h`Q*M(9^E27`qqlSM;ylfeaw2My&^U0p2dYQ$Xy+NUN^ z@AGS^wl*4~r4ke3ERGtfRRJfx3R8B7UF9HSV{%()tIpW=676 zSe#ww4`%CB@hGtViA8v>tN^F970IbOb5_z*guZX`cpLHhkwJ+hwdprSIr`h^lIjr} z?`PL#=qv=L(>si}JSq=)^nOAf2853$%5nS0%W?as7MCNABg3m>4y%$S8qJd?kEOh@ zBIKnz4C(Y10}b~X0BYoz&Z6#t%qthP;T-X<6Et3W0VCn0;>gMa;d2iIM0SBSz%DDd>%QqBM32vCSS}o%%t82yuCJ27dO}A zF(3RqhD{XgS%yLT)fE81t-y5!p+Ej^vq8#R9_Fr9W-q)9Uwdd zq#mRRNleOBw18fiHY4+^(e;HU#ZNSYHoA;Ur)YPnyJU1Z%r5gK_e5RH_mEx&CK-{} z$iy*GFq3K$g!X_t8bljeMmIupGN}Y6V&tAGE~YutBaf+O{V0JW$2<};RV=4YHeC`7 zhQJien77-{%&GZo21JYvmqaA$Y=G-NOCQJ9gxpYmtJShllb($0et{<}E z(MCd5L0}Am2J8G$j32?`FvEEkiZYHsghJK}s6*WXV5jD$x_i4*^F$`-AR&4DBI*Msd1RTKA^)Qmt(kDC zQH*5bGrayL&LsR^DBH-UC{mp^= zYBX9sydBaZk4S!j*hscWpgeMfC*_J|~unR+#h_UkkFA%dHC<2jSNS8jdv!wf#G5icOXNq-GdsaeDUY!wO z;snx>hEOzwJ&_S+ghM3_d+%W&QYQ>TIIc)&_S2|EZXV`{W(z?v5ry-cnu{hXMpzna zR~;m&(R;`_8VCnQMVyS+vWV-M29U35gExNd6;DsZ75ti`az^ewq`D;_>&`BQELU1( zD3}R9;MB4^6#*IuZGwSeJe-}&a3LlEfh--o#mJQ>?Z$B#k*st}SaX5S^X$-hUVG@A ztJV|Zb7^ka0iS897m4@T_gO!bw3U<3@tn6bCQHOvj(kuxZ46p-e)}`N+k@BR0@=B@3tKVoET7 zWNeLD6rN9n@=2Wwz~U-L>A{nYIhR@cgmU+(A(xai#Db{s1R6qk1?qzt(#G{Y8BF;@ z8deSI#ZJ+?AB)!a=lzCfb@ACv%t=u&PYQ#Skot>JRV|H3fP`r{xSs#&iZi#>CV**3 z8a$CYLW%IH(7$SGI&?M%lF$>i*_xbOV9G|;E5gr3DDfb(r-G>-mC827k2pbR9V9MC zVnO&80Vl-bEvdKqWVpgYL4)x%OlX1Z1VM656k$<=Bu%;)3K%XWuq2sy7PC_exB}-{ z7%)mFVacRO9c0MkOXGtOVcav^sTHZ|=~C1JVMAKoOyOh34C#D=)B)EwP=SkZ-o{8( zq>nxvE#My+d4-Z(NYLUmBtXOYc4#=i9W+dM6(#PSih_r!R=&7MjXY2%AzhK;RRY6E z+hS>PY{q2)m8VGx>B#2etynyV;8)dN+D3=VLcUmwVAuk13k`U@c7bD*He=1I#8CS| z*`%sZ7weWk&cZwH2ekr=x}3+Vv8|*bQ6((E5f2MTv6eJ?klwnQd>}*6usoyy5Cbit z$P~#rQ|1_m8?cN6DkoqlOPPi7#WLWUqAZ9W@(-^E@Ul}^AB7``Dh=cm;RrSnf;G~X zNv&5L;1HM%*!oS{{Ln8d4rvtjj4B#uK|{bEMxu7jp+Ib4ZV*AW|6tLi`WMmRVl0d{ z2!sPd7Cp=@V-ZPHC~QnCPr#djtt%(Vcy=bRh>dVhrgW#%!fI9LrI`x}<;19?xC)9OJz~eReFEm79t;L*e>Qi$LTr|w$kuNT;PHYa(luAdqZKr zA(}zUVK2&SFy@`q{_+UYac)sm>!7g8K-lx%n_+U|J6OqHlxey^%78$Ggy z2WD!ANI(qY)$ob;?-K-SFUl)R70NZ97*H;w++v%YsRL-#)l#m}t7;$ib$Ip$tL$CBrqnWF`v>m*eI>J|!$B!uXPj>^C*i zW=R$e!$74op$H1v2!9>)8Z64XobmjuK3V;F)C+up!4$a?q}4QpnV;#ZMDn4MN?vGx zm_Ve8s!rpY%9Rb}VgPII6$)w!*CA9LR9HC3ja(}Eg8$-|>2L&Ry2pbOoIFh=Kf=HG zoBOnYIW-n4BFuFWaMq_q@YOxT?Kc9 zB8F!Q^6%o4;OJpS(eb)2#fIVf|@*;@>7Zni<{)IIXyzFa<$AI{qbj zHEjJ^I`5#D2K*oobs=AyEXN#7Ng*pxWikLyG%7kdzWq%((M`6wS{`>hwm`l{{B`c> z3Fb{HGn3WPrz@rif+ zL>)QVLC1{&c7V40)=|eTJ9Lz9c>sV05|t;vvEp=GO5mm$T5>u1%2T(IH-`4flZNxj zyE2%pEPcfMp!ke>b~5A~%%CQHNbNw(3UdFJWIu4V|&SxAp1DwQ) zB6`w~qTZ`8JsSyoWksT}B+7BJ!*SZ)OSDfWwzG#w8*x*ik72qt1`Pda9mPz`g7Y$1 z6AczRod!`g!t{M6tBHJ=$RRB4Iz9I7T#qx7UZ8j&cn6?&dLJ_MO=FLTfvUn2W!aLw z69H!?`r-6MKV&ETA>l8R68+FKo}g21C{I(kC=uiZiGG-o=m)s)ESH}CJGn2dcc#8q z+wE*Sknr1}_PW*HZwUbhCH&=rLGe8$pFM&cA}^GnBHJa#cT2)O0oO(-%0OkQ?oO7* z#q5wM>%<*LN4rZaN~)>`rPhZ+1ka@wyDA_bdMpgNW(r-^F~S3dBktV(?%ce>zPW{Y zecd(HrS80(ynIsM=wjEvZkd@BhNaqbgGhs?Y5^7utb+QwGBc6;18fK^T(k+;z?A>L z`a{_4Oq`5tU&x!?u@!Sl@2BsNrphc-k-X|H40w`BbMgom?!T zU^KJd)8r4d6}tVwMkC^nx{KI%(?88nzY@wZ4AOB8m=?;-3$qet*b~h1g#CUf;SB{s zkwQ0_#5SxIOd!a?#DD`u$y$%L1xU@*-qzA56HIVvdyRR8%!vitL(jQFcWNp?ggrh` z(`90Vh3*`q31R+E&;S4FKl=G+b7p1%F8s&ZX#f28>(?(oHzl`EpWM8hemS`Xqeyi=dv;-VDWK1zj%qis5 z+<~2{n6*@2O+u&(Rn>(;Q`#MC*dHL{9W7y*7Z;2%i;QAu`B+ZnH5tKJod?J~Q6Zy4 zVD?js(Ub${hP#f*g5CLkN-dT<%f2LTg4AOCCqWsTanPQSp-}xhSBYT-1GC8}*pdva z8d*|74nk=t+(z%T)4b%d2&mE=rceL^744Nt#Tn$Nm1d6dhq7G5B8CCkBt-^>SkTAQ zcN&ogD=Sq|UTnWw(mu9a*-Ui4MkfaBo|jrIZLx-65;)Q+Foa=~T~pB>G^iKy6yw~n z%qA)5b61md&FV-D4$UjZU}e%H-4sE1hf@bL<+o(D=0mO0wgJ_1?h!2PLo(n#0Nh6a zkCf@@phF|2-CeSZ`a(s0MMcA@tqqx8G`$h4lVpPX(kbqnrLM5Bwn!m2_z4=pyu0mSLRXnc}X-bzn#!$-EUn4Fv+elq=gc@b*py z8Iv4OwPsPCblFhtmai;X1x=dhCHYtPdQmEKtnP(=(n;GRl*I@QNLNw z)xHk_p=0u9X@}J=m!dC0azNT+rOzc8fG7D$2dF+2xR0{Z)LOU-g_RJUEO{k;X(jTo z!UZj6E;)Pwg_qlH7}v9x(%{-=+&Z*ZT|Zi#4C7USA<~ATfw9NY?#TxYGyWs@a456R z$V4YcpLIL6f121V%Q-HS84Vrnsy=jA^-*?JiS%i)ub3m`LT>S6~70FS?V_@UCOC`RFQ0?fdb z3J};`<)4;hR{>NW1y-+8u<3>gE4QJxjy(G=g7&7J(nkm2;zk4&tUoIJ347U{y1PA!u9 zDxsfnNXa`yCa1u9+^AEg;z^UVM+MNM0+kj-4pH>0{Ru9B9bTaBa887SaK#^v1sq&W z1+d!-l-)j(FtTkM=~ty*7Cd=YQQLRl4qXRVo$(?k}n($3&RrT!hIab=4(9D$1rRL`3 z^aO!j^%(dIWb`BQWsSnIg$fPp)l)-i&u0Tlh?4674P#-DCfk<7=u5*>i))8FC^xoj zOjY@)N>Z9VC5Q2trV)vz7Sn%|m$&+%Sv}B_!TUnsK9yQb|4m*VJyTPQ@t@?S_1ul> zTXI-`*yE3om8AbBFAq*(spuN!tSlWje@YG$G+N2Jz~9NsvaUPqc^LCJ72`h+N>k5U z=5w2@bi~tQOpQTa8UEx5hAb6AkbfPO4;Vo#A25QB%A2fy(^35_q;xTRNDg5da0pV1 z>Az0OtNYaK&_0cZsB=zgF@JIb!+oHoFLF{CQ0NuI-^t5@*GpCgCHk_a_;L)dpsM(99jHfUB98mifm%djr}&gk&g+o=xAEVc)?@0c zYIbZ@P0PBN9b6aFW?edVk;JDWvwrDF9o88&|Hh0eS)D8&oYtUZ__2KGU=1|AOx!0& zn1yhDeh25%AL17je{uvB}zOox4Kp?;U`r zsi`bUshmQC%pNe7{@yY8fWJ4xHCADUb8U9b!~tflo!X4;I$$k;l(keFV++mknrLd62kNgNO*A$i53YG z7GE7hH;}^KMgdJaq!JCtUlC^jWmp+DdnX@kl=8s zL7U9(%~1^zLvAYa+yOW+gEbUbe0L15E^bHGHWt)oD;Dg~e8s|HWrgw05r!y8Eq1C# zgJN)zc;VcrZ%$$TL8>}e-<-lyqCh@7g`;ySpPj;SGDLlI3TuYsD9w=bG4dUtzByXN zzNsw6Z?blv6hqYFu>(+HY5}GIvoB8T2>A?*Cd_N#?;U_Q6<7zCDV9aF$)6m;gzD>2 z2d=y*YoQvoC?UxSSD}0RBoQc~*Hvw;$Cu>dV&&>Q$!<7a5JO}*DVR*w!OOKeESTIx zg869F);bVy@=6_`8CKNiPr_!fa>mqT#n8KphMsp&pWkW2!XY$i$z(`b6ic$Dc{vBC zOxIo3);d&{mULKUEXi&P#5@%cj#%qUt6lqr7t&$)^=oSP}Ersl2 zsm0$)V0d7j-Zw zRNoxH=`(Sb^O>k*Mr!goIm{TtYF1tnqgT0(pN{2jpB}QWICu6^oC-=s0NB(9K$zxOuc3J;0W3;z>=sUc_}n; zR9>7xDRyTzIW!#9z>M(JH%D*^g>L=g2wuTv{LK-Z-lp^RqM@*a3OP8#s;Q;^o*b5o z#^kdD7_%-E3K$-Cw~ALMkluRjURFLhfwls71lF&TW8&2bWB}qE@mwk#Ui;{zmY_et zVS~wxS6H!7&=4S@WCr!JTqvTp#XmTLR!Bkq<^+zjbn2TEIOT}27e`Qy)C^30a{^~w z!j7z-;uv80kQ^GNfb79R=@1`Va@`-43K}h@q^$XyBRFOH`I|F1WdX#iBS=VM6oFfh=Us=%+Y?>3C<74%tj3hD<7Oed%ZOH zfduDY9K!3!So`FxhI$okC?A|bQ>ska!j_NDYSDIv^1&Ij&CL+^*=bD}>0Ye^KRAT8 z&San?GbwHh_Tmsqxhv$mGgxbPJJMSf`N(%?unLhRUL8WlZPsSTyH$Exs&9_q(A!cz zJB9J9Kn|#SS}?3aIlw{OyHh?pf-#jbCH3-@<@_p;voV?Km`rD5LN_PAulbu3II6al z&rV=4{~-s$7bj3;BdpFYJ9utm~S_AzTI@r zx0@>8?#MZe74!=b2m8^C=Yh?R@xZ3W13Pm=VBy?klC3(RqrQe|WHJuPUY$VdgLFPd^&;SJPT+K+ zRlYlbMay^o|VuUQxp)@G%S(kH`a<~)E*I(Eg<7LC07Jj)DDS3dU|Y>za;Hx zMeP`)fq{%k=C*~Us-on$G%*nR;!M$30hUwLoK1am&?G5It#H*hXK*SaR6jU_rZ%nW zn?pEDqaA5e-sAGs31p-J)rK6By*h)G3N88S5VAFFc%w|)tbK6+Uq|*RvVL*5?K>q3k5_W(m*v28*t5ZmobkRRK ztwBG1>L;f)DCCIt#VI^ZeXPRMFHYg59;>1wYI#xEI{c1}UXTsSyHnVhpj6ZkPNCHc zS^wmq1|9`Xd2s}#O_$FpL03_$qA#bo3%u!Q7-J47J~)7eA!*R^g9B)$O_dzG{>ga_ zlEbX%n2HvQ6ZB)LfPZlUFHxDp+gRdEXZR8{Idv*YBR_Nqx-||wIXO#9E4$cPU^}g7 zs|D0)tJ*1$9~?jjjTWRJl^4fQ>P}F;ID@zDMfH=j8l*O^!nr!Gq87rVkgl2xlD|5F zj0zwpXBMsv?LL$roI&e%q5R+sTDu3uyE9m8!;aexM~tv`0_BGeKr57%`pHQRpx*K@ zMT>lO2&v&``JqG5YTvbw4r+-Q^$e6eIVz9g7$p#WbpQ$S-dNDfPXT{*25CLJ9TIa^ z)J6?6s*)Pw-3e?+KNQXdRivy8rlr3-fhA;=N;8Oehp<92Q{h}RQ&AfW%EiTJ2QV#- zMuazo&kC!p$_|*M0P~^I0P4ebvZ~*1-DDTeU<*}Eq&Y{8A zP6BH#jr!)qoa`Q+hmSrw+?U`xQ8s1_`9JlepwG$s$jS~YuP76M@ZuP9WZ6goNS+=aOBxBT-CXi)g|W$Q2Oc&dc>$vXO)&zR8V04)&ba2HI>y0FuXd4t|+f8lfdxi z9Cl2Z(k^*%4q07NUZIbfe{ohv#i){@WkYK*I6AFE{o<^SktJ2iyz{pXz{+_Sug;<6 zyz@8buwvfXi&MyR$}6kOhL?@u!2I1Ie0ik~FWw!)S5=pko+Y61%^_?}MYS9?eQ^d^ zIg0#5;qcKJ)F{@=Q4aezYIMoap$r5bok9&MsT5%F>=>?cRJDL3&yL|njS*m@9IhKF zdX55ij&r!7;QoT2-)l7`|JF5u5-QTdB^iU_x;>=;m9@c zo#Bs9tADz1eA6nmvi066=d!cAAB$FhY19;+pZ_0~n4X?fHyN7)2d_DGzc1Qh2;p zS*v==u_D*R!>5y({qczE*R}(*(BfN<*^x?f0yZf-Q0b^e7oo0Lr&&+ z{TLC4^dI;!X+JW_9#i?YzYy<4eF2Dj`E2{ui9KQ_Z%oVt!){Ub$?(6x5(2=)_1DX!d6eS1aWm0OaW-&vtjc`Lz*I z(_wS(^kmB;?S~)X-)xSj*YDmhEVFU^rpUgV^xgEEA5|gW{X)RpR4u^n{fE!b*b~$~ zKXdcC&mYG$EvnujQsTZpfBJhp_cQmtyNJDNxFFpFS?d$)fioRQ?KOOsdw&u?g*ZfD7o|(M<%Quf#|5E+zk9ogc zFH`nS=Stt#WYcOhTv*1KI{Mb{+*}J9OsmBIl zXmaW|NjDJYC!lDBOHpq$zm6q=R?=i$7m`P2)LgTroI#V`pJdoExQKu zLSASc$6ho4i~jq=g5NuS@IRXfKEbsP%0B`)_22n_qkqf%)5+*F0U>&w;(su(Uv&cD zy;$|nFXh_y`Qzq~@7_2!)^9X@)yDs!CcyuD(OoH6*HpRP&|HnwtSq|@Fq*{dr)^4m zw7e|8{q^!$X-u`(pAl)^mM2KzzaI9=HLM4m``_1-UlNChez+yE^UJ!tALIW@`qH7} zPYJqj*0K7S|CRcs{XXKAPus`St{n~iAuq!7mhOrDDI-VcHS#m6cM)IQC7Ar2Hy9Bx z`r>`+e&(%bVJ6T&KAdw{&i3itfL7H1@biC{6Z)eamM5XKD|6UGPC@Sl|7~pjoUXmc z;^AdtX3L_7#>XjO*zX>{k}4$qbC>GOUnExcszV;Er~@#uGW;)DmqBY|iL}|CwH&7B zvt2h=Xki9>m240Jdj3*`EA%flN9*vL|N7Ottx*CsNU5f629GXx&!&=^zEs(elfL$! zU0@$vpxxKtJFDztW?p)9K{OnDoU-+{>G$RE?qwS)9UgM2`{48F7AldYT1SMBSY?n9 zBXG=RdW5U(_Uqau11K4?D2e0?ZU8-^!ly}K5f~|1C9=IYE=e_s0Lu1fdoc$|8<+O3 zKB#fZeKo}NiBn&6I-uu6U0z4^lp1C0VtOCflsVH`RcnoGUYG6sYvN$c7EOs@WWFL< z62qhs%)TL7zHdyWxN;3?!=HX>x>5`QDIt-TJgEXfGDWhpCdnnqD+ z%kJVj`L)8z&41LR$*^D5FUa&FsYuSr|!?AEGhXi zS8Lw$J|o5WqScgHEg#{BG?KXT0~p8f!K*cAU0ydo=@k zhrHRhR8oPNui+k0Y&0`qm6q696(0|`-TTLwEmK4|ln^Xm6_?Q)~9V)*GuH(Vh#ZuCw2 zQ8pCOm3@V{;7g91?h&U$x96M#^pC1;U*XyJ8Nv>jSc^p^v?C37f(SnQZs6-xitPLn zFw9rAvIRe2yY?M_W|7^eQoh%y_;lJP35A%hc87F%Ua3>QKX0pD5VP=1$-zf$<;)`F z47eBynPU|==Rhp|Ha}nVQppzIH}X-4t!KVQTocJGT}!4ZFNQ1Yt*wAIbu~=0aCz+t z&;>Hv?*L%w>5i?mWJ@7;eB#*K_=kXYfoDjdvIC?pZ1dkZjjJG zF(=cm(@a{has2}^X*rU+P`WkdXAGkj_zgyZK7Y})BiBJ1P?EnzlRmo!8XH>L7z zzKAzf;~(cjbO7o7t8HB(Z|=c(RUO~ncu~4kA=rt`?a6#YRnZF*j z7AIkgIk+U|Xt0%#-&i3SfMn~{%O*(l$1k;gr1BR8*D#5{1T@W=8kKhD7`cy5ZM6h) z-dpgIFqM(m^;nJn{6P>%46Ikbnsu*E^U9{4L5v^N6tmO>0&^;6kdBIv$1GOngBLyU zIU4y?52bQT6d@h0+MR*COQtOQQ2fVWcoM|Uq)i2?)^G0UhfA+46Z=F!!+5+e8 zkC@+459+%WyrfETg(!k_X1vVs^l7CVb_#{{M)N*FT-lh#&R23P^LRE*!6|WV*q(Qe zQ26uC_f*4tB85-2xj_D~>2_z@KDZ^mUL8V}bN2yO&DToo3$b9t3V`3oq86ocu2>jQ!FIcUQGc$O$s0CAJ9fzatX^0?4W&hG+DO zMk*W$pPS=i8&)&Vw-a<+b7|ZgRk6TrSz!tFzPt58ZnPI@;BDjznU{B?U~1@M9fAv)%Zqp)$U1B#3bh( zh%*XlisCV}zIT=W8a(S2aD%hHA&O|?JgWeq6MBXWr)AuiDa7kS+c>d?eEsAtU?(Wi ze?1S%99EdeGjz0xQ)J$h8MY}*q?Md$FCsFL(};CFVtK<7;A(S&ZG4zi9AJ#fqd}FN zfRubt?kn_MsTLcvO{@`lS@Flbc%JHwtlf1M8o3{kw3`j=%!|mxb)+QUnJq#gl3~jw z1l@C6X{nQkEqtpY#GSJ2{t9LAI#{+x-3&@};}0*A+VXL|Hkjs8J%?hnsK+^GDc33K z5YF~CFS`sP3khew3IUYGt&-P}>z)#VG)P zvSzBz+*@H~gTxingX?{XLuYu%O@$7f3|k%k1pYpWee=2(NeqF(X)Q7Q*QqD&glC*~ zLxc_$yWo?m1!aUpdZVaqjgm_7_HmDqF6I#H>WjUvNxwWD%gj$L)?aB#;)NKH))XkN zCU^8YYb;=~`<1r+)Jm3A`4`^X7AYdm-y6)dM&WwoOImDl;%W*kVtsql!itqJ-wJ>f z)D(+az|M?Fj3g|q!`Kj5U%4eI$~+cBxAs`f1fy7!FdF4{^Mec>t0oiLf+{>lm9REt z=*DHj#!FkwP94TXF23^MiCbQ_8Q~9vBhd3%nsUm;&K7hcvxW%NN$6NjFk@}amGvb{rzj;~ z5DbZC4Xzu(QPlyP2k(zSR7Y~*OQ@ou(do0x{V%hA_;zQ4jx=fY3gNyXAuEj>9C9hwBWol*0vX)5mW4~&>T>nbz`0)^LDBbIohdfs zBd48?p%XUe*0#5aI`S~j!^e_lp=NgaZh?yjPeRec>qEsQP9}-`2h(^TYxJ#+|I!k% z$hE%RQm-xyoUVv#ew~_WouCF=YhIMXR8opq=$mBKC%oQ5^^Pdp#0dUt5^h37SEa?VrZmTX`!t?3Zvv zH~pmM7&yByFH1|c!mWG0Xl4n~kCFHMvy%M>j zm8y#!&!?^w=a-h1!SW!Ojr3_O8ztrtdTp9MeOi&MT{K(GWQo(WvjbVFB81=S@*##j zDW<2?mcyV`3$!?Qbm4ugGDD{w3D^pHHKq(RT)LAgg8%*P)@oo`0;}tz(m!sz*XOu;}{q_h+j@6p@68DR( zNGEaj)=-J|2X6~=VNk%pJ4YuVDzBxJ3Pn>I$r-pKp#ZXfGdfY*R7)R7WzQjhs(Se$ZC)*H2mo;tESnoe1KzPQT`GCi{1vp%U--jd8Zrn%;lLpe)XK`-Mj>L8Hn zPe}DdO_FqL_rCAh;=rh=sP)~nX?UMSu;x+I_jPr`ZzTeSb_|~!v(K7wQhT~EJ32=_ zZp^hzxnb;Gd0W~G$*Wm%GYqYpy?^B`7I%q1!tIt5l`<|NRUdCLD?PezN&^5yFH!(@ z&wS*H{n4&eqze1_xlZOyCfQ#wKAWC$sH8A%DVJl6J#vSg^YUduRQo;xW4-QlgLHH< zVse{>g!(KVvr{pBftXr^V~;Gw5kR&=&`@GjaO?Nc4_&446Wtts6L%7 ziqgTueECN19lL~LSYnXA<}!i1N|VM=C5)sXyQ-GWw(iUMkoDT3t03FL%gt|7eeJ)R zg-@7Qk96|#OanVgvPzSV+g$SMWz_f)Q99h-{hsfm3d$ zZbNy5QE$shcTzIf2N%aXJ%U9$WX{EACt%;&w7kA$td;2<)7SnbZs##r4#bUsNh=>A zwj(}AWSfOWs!mqb?9eT3U{d(0$nwR&R}Mg(Xw`8wN3x_QD5{n*4w`R2f3Jp|Uc3uc zW#!bvsZ;%5dCZH*370K}|&D^Qv*$+dFqIUh00q z1t^DN{)b?9=$a+{(;dKdWnJ){VjT>)Q2hR~ZN~q6vR`c3{!g8H+2|H|om2AuXV!}s z(Mb|fFhl(ay)53(i|fKKPm0@sA0>E9dHZ4}-s(VY zTZUF184jvCPa%R{Oft_;F*4igIO(3?Yn@+qRA^y2l7^%&97 z7+ZGIBhuuQPLRnTjQr4oZ1s?UQ~_cWCkF_D1qs6f} zTRPCLSRd(DT1*oFv(c=R-hn~u<9uU9O9=y%X{24C2QgU5b`soutda!tEcS>qQgq^Gt^Wm^In~H=> zKIE8KZ&hpO*l+Z|2-^fMv8Of$Z(@+C~JM-k~pNy}~)Qi%jmRmMS=STJn$owN~(L zwtCHcAc~Dv92>6Z6*)PzPkg%R^K9lfp=gQ!&Vrn+Da%ZX=ksAVcs6xWD>VJwGc!+T zeY8I-5t9IdG(MXW`^swZ9TtMyn0JHp04Gm=%D`{}#C9v%M7z2aCoI)})5-8QETEGDzEYS1lTUwW8Syi~ek`Yi+^^M?5l6 zO$9d)@>DPNvh3egh1K^iEaALI0G=&auNb8uS5N2;E%wMEE3w0ApbJgD{hpPpV)50~ zm#QjWatGz%YqG3Oz)w_c>fjQ7<8$kXluHTs`w3WxRWIL-Z?Sp+`1U*A&YUo)hgc>0 zyDJ~by(UCF>)N-87Q#f^X)pKt5XSc5iHZmot^NZ0cXnGi{*fdf#F zRJK)gu$6AZ?cW8Wyq=;;htLt}fB#0Hh$i-0>E61zy^hBNG5xrMW>-bG&TjT(Xfhd% zi_Hv{zP{(?{KQ7V%LkJ|*s?;z+7vU@(n|Zs(N5v4UYk{%Nq$XGUu7H-kbpRkcA$rc z62Kppm&AuNNWp9GAm6V~*R4wU>{Ep*N&BR8OjGZ~bfN^#$W0E#0Bd0MI>YxhuO8HZZb+ZFu5$ECATgLs<8T@gbQ8-g~M2a1BNbg$WUD<5(e zS1+2OmlL}_K!v1eU^NmnQQh!PZf_-8ju%enUxL^g$;%9tIybhVH$BnAzwWCsnXFrE zNu#5-+KnoF!Je{)V!qJUSGX5u62TB*>EfJm~R z!f4}mD10(xU36pm1s{_jy!O|V3>!{?)*g?lHIY}m-o}VWZilW|67f$J<~sLgO44&Xr+s}l<3)n5Brz`TJVk?NP}HB2T$z0 zA;<~$tX`Q+f5KqJ%GZf((O8V3uedjTv7=(l8_nDcpC-zBpVw$C=*G7i6Up&yvxa&} z%WsVoz@M|(5=n8jQ@egF+>=;_y>~C~b@ce6Mr=N^Gn9&Q!xQ{G^L~!MO7rjk$X<$Id5maPWi6$cS5pz86h7mOWnMX6+|B2}FBYZ?BPZs2rPs zcdGt(Ej?ub=2RaDdFxA6dJKA*c>4WYl8{di0NT%kBD3N$LyCE(XiG zXyK888+svKqjZUt0B5{g=~!TjJM*o>XX?XKdPa41@+OpBP9A!Q%h*AUQq^l3;8*P4 zK-QD6vR1cKzZlX8Ai3g0N=S*DYJ1T&Scs*HTIw~=4ho~R_=wN9RfZmVjn>FZh=rWe zQ+%bE4S@~M^p>ZA(qAzWQM`@goSXs{@-v8Gwop05Nhx);Q%Sfd?i5~wcOPX>$1g;6 zT)%eBu0j0zg_wopH{wSR9ZV88@P$R4IG|+PF~1e4FXSOP)Ot%nO`USoO}SKnYb85k z_2hj`b92iBz=(v~gP+u@pa7`>XNkQzq9ZjFftB-)E_jSohOi1=KY46P54Uyk6RfWe z{1lGIFjBzukDsg$cSbyzwa-MIshZ0!(ALKIA_K4(wR|+A2V)boS$ff-#C4kgc$OQi z*)Utp_bu?SL%IkEwi@NMt>GPuAu;v0`uW-o7WldWed3I9qC?w9z*4Vmd^o`tX0zOr zE99Pfbegx_`qzV75OvUe*26+?5WtCiR4DNbi4Mneb376B6+1^c+cZUH2kG_uuHo`%!5tb}@+A|fLu7@1UrlHHn z8mo^JB4_y?pA+ljx<0=vEZ>Lgoa~oM9SJC^>?;S2zyt;0wV~*uo@V?bf=y$;ID~e6 zmv7#X@=F%>bz&rlpFFLykkxs~0vS6MW+>AEOA_-2v`okeGcahPi3HV(Ydt{7ja)2E zaRgpg-kxg&Ei3?s2@H1##YXY~1Iz=@H!;~hV&!uP7;c&bU6>W_iA| zK(mxxoqx_0@b#CQ!Uo@8JRJ3U&osK07g6;;I|n8_b7e z&>byrom4U(QE=M5VETzH?R_btg%>U~G4{H#RJ*q`(hZ3bNe(VVG$FW!Ww^EN*0c{A zKmCn}R!9Eu>reLHbA?isBCy93ov^rUWM$7BT^S27C)kme2;<9u>Hz_<7<+;^0-OFiKu7S#H9 zfg0zYE?qQ>CP1j7J`J2)GTl2ir=i+Y0@)6{^JQu%2t)PnX&IrZO~o?~#U|*cP`ok% zXs%oe#9t-_JrR#|%FdJG<*b#-4|m0eBvli7>iu>Wf5$h@XiD(W129&yPysp2l6T2E ze3gsH=>Ks`3AKg4{U`2Ov;B z%n_mpEGt-i-dgOcyuGn2mEFW>vem%mnSbKmvI>sv>GmWVpd8s{ROiC8vCGXn^@RAg z@{R(F^>J>*^5w_btr1>c_AyHr%RI1TO2S-Z>oV%=s~lg&wi#&YWo%-N>h}k=gM%?0 z>G&;w%27&q7g?Y3h+R4Jwfdj;9SczV40=PYeW2=1A2S27%n4x^$|jABQ?-LKy)mI| zP&SMbuv%AwleN9pz~72AZyq)XhN`w+!NQWzZdlvk^u~mBCg`-TOc|J}u;#uCmnYSR zIC8C=Md&J-1pg>dv9Z;Y6Ok0Oy5fcQ%BfnKxU~}qAgsA~lz(H?r&5eXMu0ve=F^|@ zftuyYSZ3+Oi}rQ_G!aS5xtiIqRafLxsIa~j#;=A@&+(Vr4}x8FM9O00ThP;`J_#eQ z!;Ls#X{W(HeLWgCRjAFXT9*Pbl%&f|@D91gcb3{b${cxc9|RTuulccQO5&Z#ibClw zv0^GzunW1QdydOOIw^#54L&MqmKDGwmkw!KvDG6mFPc31(t5bZ&tU7cu*GnIxBBb0 z&pwmH2!Ug2A#L04&kl{aRhi(kLxpYNb6AJm40g-w%vx67l~22OGha|_;l6wiIK)%1 zJXTkt5=xHK)|Q1L*1l>6Xsi}FFN1REKymr4odmZC^FEB<1Z5pvTujy7x%#FLE!Css zv*Qn6AB&r^`R$)^fYq z{~>|C8fv-bOB0Ly*>8}*u_`&i#|t2@b&agwf!E~5IqRD@B*yH3IHIzL=LdbFh#&WhU|Y)k3V&l1ie)WSGHQP zc1tO)VJFFziuP&P@L|m6N*W>!(!^UWGq-)#GU8tZc8?akcadhVt^w@nmb;^oI$qGFEP#VeBAAbsT+ch0m`Yp z=Yt|JR;XL8ZQ8mQ_RM+xkk{lL;~jL*Z`LX8lvn%#ZzW-nX93~EBQLD$H9}214v!eeK`KmZFGjE_5E{|miTW41K0(NRPd0blya_sotRJ}12hY5?YEnX+EGgS$zWrkz{{k|6k z$nzMK)-j=m@0*>lJc@shLQQ^-;^Y89kjSwW$jkk=>?($w_E{DrR&v{u7|*N%;ITaR z)>xY$G_C8O1J(=Au=!RNuPWRc`Bc9?TMZEf&a2XZ#xI_C0>Y=PhMY;%jge$`@k?+> zgbPIQd0ab*6sEEt+G<~?-kE#ao$We{1d@IUBU?1N&(B;BFB~$J+n)_YJMa82n()FU zW!AnMu562--q(!KOL7sImoNAI5?v zsop$58$Tx)S+a%qdaQuQxV-&JMeipg!;I38=fcqO>-4-94{Cp?(5@&>RhkH z*?AHTgXk?M9zaTzZON%rrL0YUR9+ywA|V`|MvBO>{a+m9Kih?)69-0Jv9D{| z22Qm2-MNkx7O1(k>9=`wGkxV?(aL zlDC`4;eEb{A=x9_&;t-L_KB7e|Fx8>5-foyJR@hR22QwYskDc`94}k((0TwWSt+sy z#Wo33gl%b$bhYv*vn>7+*d9KLMLc z&hbSfWVi4<^zp@pP<><1&5@!CtsD?v%E3J1Q;^d3^`X8fywAi*?vt@hj`$=>`o+0S zf6Tu8Ud$xUD9@wdFS?QpdSn4klwu+D@%kFRwa15_2Jhl2v|-+KVv@CAU5Pre*X`jI z#KtVJ3{wGC%o*Z7vZ<){@0m1=VzUE~4PTQicK!{ zVbE(5dSecX!HZ@)fHc+gZeuHBYNVU{jqr`Oz#KRP0y+#{ri4JQ-@qk(J@3Iz49zhy z)I0`H?0y)`RtB-oFppw0kCR&rZJUyGz=CNpL(UMHz{9``Ydtoa=mU>gN0ISiH+QtX z3G!7U17WZ|Wl@=751#)jO!hQs43_91BUFnlL#vn1(q7I`&ePlq>?zB``{LoY{DFBB z_K_o^<*^kD%xA9DWBf~Vu-5ufhhxMNyJb3e4{+`DlPe1+dzsH@w$xnSe{h+#YF7v-VdpcLS z7<%uN@x^^fGAdiGpdntK5bsoxW0rbv1?QsG6>PU0fF0&kg#+Hma9(&@;Cg}ZLok-j>YVLRHh6Q-Kgvf%Yj3`th`p(r`rSn;-x*em zxcw%a9c|@rY@e23>Ar3s=+v>2%=9pG1G!`t!Lq2!R04EQX$F^at6*^F&ff@WTDu8{LQ|1|a&20iVUOxGGyoQ_U4Oeyd&uTqN z{wsYJV_Mk7-Wu4t)bk?85>mt6)O1>cHVhN*Gk~;quh>(nq@oquAQg#=XJ+BTmAzYW zaXM@-etqEHB1l(y&CRQ;*qa;e8^&z#LCP|RS>h&H`uFOPXh`RSIqxN^Zlx7a;&I&( zW`p@yPBr)1%}bj|VDE`gY}@M)!8VIy?)+&ciKyCmV-}Oi3T}u#exR58st<#iQOO}l z0`Xw0ZYG6&)QpS2bwt^AzGLc@2I*+W<+1IgA|N_Z*mW@n;6obz*J5+R$QcMB7ERA> zYMlr>5+(O3x&Rq_%R@P@V~scQO=xqCM>7L{bXb#ldOdCX!X3Qh=zI<_j&3jO4G&)< zd7@SK7NjhrcR7com~iW0x(p@2p$TrOlej|b=4N~3#nc~mcAbE;cH9>S; zdvwzLw!StxqQ|9?TmJ_uve0X84dpa^&nmh*E%LCc~8{&3|mzsy0dU>8EUK!Z#X4G^zx|yZiuczZk#P^Ew2pHt<4WDJfmv_UA z_BdbpESS?CL6P&aC-@*dca)~!ZicsCF3cmvt)+>;HA#<-sGlnUUi3r^RG+;;GN*Sha^raeJX*OlIKwlw){cV(aYKEjjZz z%-43|{`IqF#2w(PK$5@@(b886q6eNed+h(7{k$Xe4-b&W<(v7TVGa~Yzb zD(nez?d^1)7r#fGsU8+pH0FCw!vfO-Pdipo@UUp-nA@R%#j~&gOq$8xtjfB`s z^Y_b{02B1m+IR`8D{)g!vBs+gqI|g*(zf0aVQ!WDZWGq#r4F)UG{BeaJVZscrhsd@ zyN@|twoh6TA!1wrf!lejxTH7ZR%JX5V{qk6=Nr7eGbUgx%b0;ChPzM8ckG<%w6*QG zeQ953kwL_G<&^A;2Q*`?j5I~8_L#hQmW;aL+BUDZs)|%3pd)xPho0{99fe4ELV^lj z1pT*fXa8QSY&*ma=k*}j-tuuOf`%JR$G!5kfwy~r^OK`>l7tU6j|%R`QA}%UoEG+v z*GsKYZCYi-azR|!Kvmnc0d8Ge6_0Y%56rhDB0Y zFe#MZlo{qJnw;wxF+;#w~cr1jJQ|IxFPL>Cn)Kc{+Zdm=;nm<}xwuyW#i%QgGJ z8D%M9wE_{%OwFX^7LTxgrHy%NyF?`NrifqibZ~X?dZt6<`KpB^(TAMDkpcSLQPdjwG7>|F=SF0dj>+-q-0N6*;_=4Ch9V9 zg^kr)Rqj;Px{paev5Q#sZ6-ojaj~@528T32Wu&w=@?4@w^5XC5@u^Su}{r8Zgo?6dCwXi~p z>$@SThuMpj3$2QZ9w+Bi-`A9CmweOMXt|g#c2R51nJhCzG zSd=4-Rz=_G-ylp|)7rzM^l*8BmQ1IZsN?L90crBY?Yn`AMQtT!r`DbAvL72Briuof znha&9y#=?jvW>0O(UJ0DhFmX_nskpob#aGngk0&jcs0w^Kpdt|)HTdX_L^bU@`Jt;!|L?3u-)Ajs-9&om2zM9;Dxm^qQ! zuHhixxyFqctW@BEv58+9V&@YxNwHVtePE;g4yO*FDx3n!(Y2ga?scpl ziEL4|qJ&Nt${w2#E4L^2`e1RnTL(HfH{IFchk%gHtll8jD@N^E%kabSc=$waOovK$ z>(byG?Ute`LsjRuW$(@>Gb51iy)JDEdjR!t3VQ1*KWh^0*%0ZMmH-29=v;Mo3Nu0- zj@{foKthiV3CHSTK;7v#zJHVKM`#scrm?J>eJ@GAZc~_FPEovuVAHMkg>oLLb=n~S zhvf(^V8g%rC-TB{-iS^-Mzoo0l}SpiLxzr&K1T+DNa#Rjz8SJ!ho)?Va$S_dv0gD7 zBb@ux{b9rzLcu5`MAyqEbeyg1O^oR2p#T%T@L)FWEQFxJ$jF*wkO3-x9^?duYrzP2B;K|vy&Oc=|*GQ zF2n&oK-nskuf(%`jnj{fqIx$z?OrkKunJ)%aTrLR3*S`DO5f{2IPmy!!n@um|F+Qz zM}QZ^_u4(P{dhA&K{6odsEd3@cI#f=X7|E5)z`0Qp{Tl;4l*jAlO2 zP)|Npq<|r`;Je!|xlEuXC1!Pf6HbYiZC=Uu6fVQx=d;ywu_%;BbWAv98)@*HZ@xHU zyBm@z(lOsmjo?s`>wUA+mho!o+~ti>I^l*P;We$E(Si%FfvTltT5>ma&?<`(mmqna zq2t~hUuc9ac$&6Z*^_XjH*Qj(8d~4P zIBQY17>M~VL=VuB#`YG5OnfW&h6o2USSpcm-w~TlAwbfX@}I>zLUh<8IStgXL|G z5dFKU@S&C8_cy_xKEbDyF3AH@j4$Qf%GM(!x@m$ao2Z&>q9|oWOnmfpPu-4&lXw%J zy=2XdsCgOl)*<3`-4I{H6`-Obl6oqfD-4UxRmIXOH>yu{c%`a&^~y=@v`IGtHTJzJ zRhEYJkaBwq#@CCU+T%wk9X4SOU~Lcenyg9V{Ex2Fg~;L^HNJG6b?35tRl&_sbn}DV zY>eq!Ayt|Dv?=g3l{2Xo!|>K0xP7G?%wg#!3VHi>F^1y`Z4f^d3@P=DFzbWAL=U(( zYO*KXE$fm=fsT%jY2UF)Jpj9*Z%VzVZ`MkCyRz8doT(Z27Wy@V-4xuvuD1pO?9POA zznqs+K*X@LdW{UWZ;@Hl5sBR6N*KqOqesW^=M=ZTbmTb?ZaE6|6-Fy+l|6n(I+z z>u#$E!B78P(77*5&T@m}8xTEdfbBh@rKo6OasaV?|K#@NvB$PJA4-$jiJm<9h*@a5 z(Rs>a;i>onMe=1z0J*$szwqIaAwMz7`JR{uzrQlP#Wi%YDD^V5q+{Z}IB!#fem8zS zP{M63x?iRNl_#z&7QPZ8^V>A(wsF!Lo0^uVnnM?8+k+`mL%?Z4?B$MzQL4g8+Jj^D zr0&NJmGe|Tiys}Va=_&8u$PYxdHv0%azDWWRz*HO7PGj89>%usJ!Vc=c*EG4ct=mM zwxL*lPCf;4w(zrIj@Ocnu_eWpOA~cELPZfQ3>bZ~?A2_Vz`#=>%K-VYNc`x%dsE+K zIzgWti(ediR|d7y5`Ft%0n0CF6n|Z=3II_lTV3$J(mHLHE5GrhV_qCRRAAu$n?aU| z<&lvJ;ZqrmTD6=oR~3Q}pf`&?`PHqGG`Kmu#QBb)9&C7=G3_f}uFQP98P}JR!hxT_ zjVnhyyx^B3tc)j2=Wgat-nc`^dza>Avpndqi~c*TDO&$$JZ~^}g>=lshJ3|hEAEVG zV!2Kt`;*do^*y>|r+;E?z})V)IZ`nH;!^EI4%PeLgip=mHDZ9vXEAbnBiU6B^Z?Nj z@^zyUjCcA#2BgBVkd%0;$Z_t!)F9BUAw%-5;^`O|tzBs1-RDS%ctyKN08Hpw3rEM? zbzCJUTyv|}*%)sf!JsolA=}KYFSm^K^~FpNVEXV7$o^vrWhn82eEg*i-kd$m#!rej zmMXBWxHA++CPLb?lXPAiUK<&*F1m5~@=96$;CFYv7|ptcrm@BuI>Uacdxr zPacZ@0@Ao@hg&v0=#4uq7{8#=Un>_Asf$l~2{>qgh#5uxEdaoU&hnoz}v`dH-4NG31UFHO3P<~WPOWf)b&nrcfupDEg|LEHLsM0#x z3D)yOxA|UpJMrY_oM{475Y)HR6zaEN3{j`0idHMI&E zJzbYD`q3lr!naJ~z)Q%_+M9#CX_#jyjeJ`K1SfEbuy_meii?>uzZE(2`~u(>GB#B8SuenTq%4PlcRO&d<+# z*`E=w6$-EF%T9*Ap%TOds`11}{AB>hJ zN*fkC9=Ss6N*Ue!8`r4&-f2iW&|&M(D!ZoJr>}!I+JXXtXuK{t>P5Npsj6oJg9r937RLYXo-f0r5 zwFd4w7Gcr%&)xcsvN)v}<<)WS;5CgsnS81|q7n(GCyTYojrT@QC5*yTg3p-)cO?R9 z-B0|}D9j=$k=Mrd0W#Z!{|hal>vfaox{plyIZ!p6yH}cox+4)@0%wx9*u6{CDeuw$E zs>_g_v>6ZY{VPKsoS67R)HkIMzM8n*pzVD<&Nk%tO8HWq$ zuY+-~bmAK(7qYc|yTtIYs-SfA6>sU*Vh;lr&fCEp#Pc()-z=h~Z6S|ukwN4So6T6+ zXCR4m5tZtfR}zqBi3P_;P0Z|u@@@|E=S@q@P=1UP#-6%3R%|~}$LT@5hBi|4K7sORcS;%ttY#g|DURXnfFEhe%~R8u@jPQd>=iiT1M6w3QzUG$ zPX}C4{fCK*)$#8o-%Vk~$PkD()s9wK85$I{)Fhr1-)$NcgqM;Qf%6?!kC=a|@y_t= z^w)~<(5R9%?x?=4ykzrr-M|DmP5+a72|a+C?rR_Y(&Y*Bd(7&Qcfxf8;iJywn>F?} z%|GVcevD1G{QYmI;3U;n>eC+%MU=Jr`oyG+ZLV|Y=V~$82vrB9nWJ7-i!385)kIY6 zWp6!HSi1d*_8;|_-{82K>+>pWHHWq}AiN$Eo<92BfmCYC+~9$kZ5z~S++Tr@pJrlB zzeWyh?j2ay@}G$L^EZ>C?$)|1E4{e|pMFUhidnT>IalP64J*2_vSqg8Gj!^I3}MFa zsW+aJ*mk};3TGBaOs9ACSuK^tetMizioF!Puzbjb{C@yJK)%1KAN|RfcpV-e{ciD= z;`4r_a(YI7TAnc%kBAfMJ9y4lX5;8F*-kurBA`{B%IM?BtqU9!;qX=vzt6^#Vjiy> zhPi^*s%#E`;)QzTs2sn=$?r|7ANnf59whx&T5@XXUbKj*s(+z6mdFSrAQZ`V4gr-S<9^7*j>EHLPm2SC(;Vr zmxyK6smufx9S!W5Wq`%uBu9Vv+_LI`G(EGLN7xpQUOvjvLqhOabt`rips2)tU_ZU3 z{tBDR2SW+{fL%8`R!I0up#NLB$u=G0P@!0&>=6=&XEgzJkeQ(#FazY58_okxLurX~M|g&l zPnvN#0_$mm0b6*yv)GE$1;mAg%xQ_BNC5??Lefw`mvF>vcA%V9D}RU29i=XyGZGzS zZVnN*Ag|52P|gU`!p5mdYibp1LTa1H8~nxTSOuJaDtb^+;MCzPL|#!KFrKtB89K2# zw&#TQpuAeeZqN{}LO|NVa~KJr1C=xc1Uw6>Uz&6)5K86f4^Z)C?n;i`mIb}Q@w8CM zBo@k0QKE(BCt1NlmCx^WaqMzSU_&{SzL6>(&kPbdoH4bmNazA`X&p+^5oLmWM#nTG zyQeWPCp#-6+syS$$ur_1miZ{-fmfYQcO^m&*%25ryRF1WXAT`VAc@;9s5g!YYmu|C zAfsF)@3ECQ?2Zx&j);3pxebMp+w1UEs{}bEly}+uJ}+nwu{g56#G8~N0^e$t+?|H} zMW=@_4>)$<-HoJ%0(5SQIa4csBcP2ghtEOKa{9>}XV*OFN<0={8SOHDqiVdkniH4~ z(4l94i6?pzRqIu@m?kxu_IJ0LCTkJdpchE8d~=GqAfIXiHu+H10%!6%Tb08n$SEpG z@d;0qFd3>+n9Hb#96pZT87-GviaIJ%2U{%4FGx$v$j|4(qJjIl+?;%4FOd2?NDw}p zqna8puf%^`ZmI})B7r3kT~dsug1ihaOn*ZVw7yQ2LH=@H3prEO5v<8U1yTiQ0V0w< zF*2naQ@Up7kfiK@!IUrGZ$E=>=;|p zR!V_6Gbb-!m8av3Hm{$zI2{#yNm;d4Wzun(I+&AO7e}ez25ezPwJ3;*fkaQ|ofn1B5L|H{WtPXBc} zcy`)sBp!7sKf2TJ)QN^>;7N@CnZq7yKcA673UzK_$diKEfsp#R$No7!FvLeW|Isn4 zu#q#+|Hd|Mu>U(QCayyreQc~gIyO2srb7pq{~!haIsfm!^6AtnJtxiFJ2!*FW8=Bp zf>e_+jZ;TPMHR-RMMb5X)9H&?U9_Gv<1xA9xLJ!cDk>veovi9aPn++QnUO+nyf>On z8OiKudXBPFrzrYV)yZVc?#|_9n3B{)*6?LEn@`PQ>q%;y&{3dy)a*EZb`(7}k(FUi z0W8e9kr_P-j6KP1Ve54)$<(qq( zG6LI6R*_>)pZ2?b;8^Qe%;Hwh`3*cenVlXh9#tzG%PNOo2_R$wQg*JY)hU*O`*#fRWS7EoY5|Tz2+=J&$ z+x<>0XS0JR?7)~BIHI7#=%MiNyrS4@B{KwLJckNbtkKF98dajwdV(z=be(jWY^_ zFHp6_?V-H`x##mbib;5e1XM9N%|aUiGfWfNT(RYOeKjK70dgG5jcDZlfNp`>A>infQ(kf`++L} zuF2u@SCOt{SxUH^e6E*Hl@C)LagoUZl3SrtUThp;ljlM-N1OvPkq<_kyTUP$ur~;P z`A;F9ht=40H`=*s7)-0%rD3!}f#7q1{({DQr28enO|-sGq!#Hf)bwIxN2|iC6)a-f z57<12tI)W{#1BvSs?t&JhyoC)EFGv$mi-XW%Zy2uvygOus?o(&xbZ3=cSQwY6^h&- zmVl3{F>0mm)IBvFq+vO5Fn&|(RGAq1!qLJGT5Udy!^vZdIVNJ6C985gB#|Rzzqm?= z%L*foqgLS_K+<}IPHs=66O|6kDKAJ?x3^l$(fJRYOfq_0C$l+O^en*sGbdBF!sl6l z6vmy&V-}V}k>GVZc@FFw8b+iu48&`RjpxODm0bS|FLm^KS?mGFrHAS|7rN<62h5*R zKf=dB6$wdNqwV8>BLm{hmbJn%JG3rdS8fCIOF?z6%;xm4_Gu&;xZPn7Xb4lQAeS(9 z%@HJ}d0gW6f|Nx8%KJSYx0ht?ytV|2hIq9Uvl7*a6~o8ksN#xw5E>ohIn<~4z0~Hi zc|k)v+$8%5bCLWTi3U0edRJIV+_%;fiYO29iO+FX1|(;@&>Wjwh~o@#@N`0W{Vpy5Z)Qh1Ff$8Q6-&kdZc#*bh!RzU zsa?OzMW7;o(b1A2qU1VZeuxTHY?sC01J-TOBm*Y8s!6IQ(q?rKV;J#+4j|>Z5{t)D z>~O*hOtLXikD^*W+%yBARS~3k)V5fPr~)QpY*ul2C3MLcQ+t~v!I)j53KPX2uu3sl z>eX^N2xG}0L_%c>1vpj?I+8#oufi2blY5gWwrt#R@P*udZN%lWdYg=?`ALyZ6zD(| zQ4tU&6KFCCYKG%-(6$rFK{*ReSn>=lyh;mn9hYTL5NHOWF@i}yY9a#=n7t)POFEaS z=GJjWHXHGJoj@LC&=fK|2%w+`Dgg}{26RTEZev+S`Rr5(eH{m8oW@BYibG{%gH7&S z;XJ7S$Px-Zs0}TZatx^C38V|5umT(k zH{c(opbb$*6uC7CTnQ^VF2o*3Ij9s94qqTf>4m8qCg}gA)-jNFU)1$ zUn~@X=?XBg7+6%Kh?Z4C$H^vp0uxI13%n57FTRX8j`$lTT>zOag1Vx{EKs1P-fN-b zgspjuYEb)AX6{(sP&1f$IdWmO$y8*{$xRBW{luXtDFgN8l3)rJfWpGT(4;T4s==<| z1MuvWx(DcpT?ZZ|sq_+(A-9vVGVEv_rdna@T8cs4<4OTc86#(;n}SV@PU&W1XQ0gs zhDdrk{e`Ly^_ujajhV8Hu8fp&yX^EE3?qKA_^a4AEaLG$2yo{_44K>)o#z0bDNX*9dC;Ot zFcZ6{9Q*;cNQ$geVM`MQKr{j+s$|j~7@7hT9U3%ZxI!`yh`I*P!l#^iZ7Zx6zATY| z2qC#8D4DdbWTFSvglQ60Q*C0?gM0$5&xfulvMHEw5Fj}2 zLeprS(X|7D?&NKx1i8pFc>MLvQQ~8;&APQ#VVEmJwFN zV4RSwxOF<{GE=mvu~VdNEkV>pEJMJLN2TE^Aws%~-%BW=3^HISSGN8Ymwnh!bjxOh zu+o+WmV)LZi+w2KM;N^b41LJwrDS%a7^gufy4Vz#D`SWNZ~?cPtQT~N9<)5R0#Fp; z9IMS^1ERY{RwPaep$w2tFrTEMCz_sGQzXpFg@N3u1Y#nGGF2x4!8mQWGJ+&?c2I-{ zI38Nj;1ghIQHRqNX?#L$YKj46y1{AjICLeP6H_GQFJ_MLi`7=_FC|~x3 zzXv*?ZIz%1;XyH&$LuT2P&fN(EoNUF!jlTn)$FSqjeh!#XJ4Rw_6^&o-~2v%M*)h< z0iB@4l960groyNYoyy7yqY$!C36@f*TsMxmV0c-C!lGB;u5?NIQ!Xcvu`sU5lmzTP00D!5F?Wq}Bx7ZIXyUJbUcgIcsmB>DY-^*`8r#%TY}Lm2U{?Yybl&(a4VvULW8tZMpiOWKAocA8}$x_7K8ikJr?MP6hFs04NT6fcG7Luw`v!=l zhUw2&R}^C)4+J0$T2UDzA>u+smKa(~(Y|z#Xj`X3B#3uQh=muR5oo+G_ zQ;r7B(f{PNN(o0IGg81lsNbSKOyN1S3}GBGBvy8-3N7@4UglG)b6Y>+nLUjoprVq1Z$TC$|zyj1T#VTol&q9|V&^4OKDWw)~ zv8B{TmJ`vXk+g=-9a(IPB%wm9Y%M=|hkD%?_zXs%EY5wZ<1IJ1EF{a%->UET)N z2F{cw3Qm$zz)%AZG$88S9$K2FKY&;ol=vDEFb;r*>8R2Q+*G8Iz)O-!16*7L9BT7n z@Y7<|5PUSKmvDtXs5K-mt4hH|0@Yo9a7a)n+q@+N4rUO@pwp%3UXsIRf`-(EIR>sb zrJ_g#)bq3&M%k$`%$Iqo5P@k8Dj9kielWT zgX-Mlb|BUL9&FX{WQ<-k|K*cW%vhVG#RJmx3zc1TgIz^UKQTEQMWR(?J&n#&=0Vd% zTxn6mO{}=^!q_!CNlju^Y#Bx$D9nk4`>8py)+0%+yaPIhtUaQ?Eyqaxw1NRon; zVxyde@k3#A%*}L-(T0zzaQGtG4<<^ojAl;0+`?<~2-1i|WD->%KT(hhmO64bN$LB& z9ybOJ#XLH3laRZBwb@(n!eQ8jPzE|?n7ZSA;tnyG(8TD(EoS8$E=?zi0OGW>MYamy zlr$0HwupNor;m@1ZR;ZTh#}e#L(~+mP3PG95T+z^#Skiz5<3WV0W-lxGB||ifSquS zR;i6xX=I3PULGBuV%%#+r#CjLq5%h9;!?UPk9U_i$X+((f_duSk|c^cpVd%@Q&Z4p zajKY)ExZz014JCKJ`p=|CKFye9l*>iRU|};d6kbahL+%|<>;<<_-iBG^7z5(=F7CQ zS*68*CmR;x+eE>5g01fa%i4ps9$U>XV8{F)H;qaA7>P(&y0VPz9u#}x;8k`|640a= zmge20#r|Y}j+^Z~6L$09c0D3{h$EFtb7I7v31(F4hGBj~8d-sd%PiEhW)Um0yn+~6 ztV>=*0XH9!?J8&$5`_@ZRmM5yOkl~JF6P3NybR8m&*kRj^fabtq;u+&eE6-_a)m~7 zW=?^bgA#cu+2-C{P8TjEyEoU}n4PZWGJ56a;YO02Je4sk*JR9qXU6O_Q$e~hyDOIp z^|Eu!oXH4+2!NV%IBbxCGG^o>u&j){v`qM!l4>*=&Aqj%E=F@U!t9ch$E9$&DS2jN zT7fAg512kLHzz*>nokF?*~aWHdC*D*?xE6wt(grExs0B;qbff$#bm;^RBTHIAjqZV z;n2-M5Ypiq$3 zoMK3z2>vd}&kzA}=^3Dtvb)0gWGluG180(?p_);ay0*LBK8$#%OcoH)bU{;sDhoI( z%i`q>9XNwN!C**;ZqF5%({O)z3`<3~ij1UnsF|1mb9aD4P!@tk8>fnl#O9*tGDpzO zWS#2&_Hx_*>ps%@Z**DyGi{Jd-s9qG-2VX|vi`e6oL-OLqxCr2b-1|y3_8ls|L5z! zmE$i2nf~53YG414hknG8@sI1!!JzLDL+*cz{b&Erf8`Sup^AuLCx8eM#y0rKh(Q-S zCf&&jPL!+cC~SaFX9e4`ELr)8qz#qNh@S_~3YSJshCp&KET z`Ypr)$CVN!)4%eB3y)t1cb$3dbFs)mJH_xVRX_CWsCeST)gP44l|KX>AALTxmH+70vU!CUE$&3 zLTcAkL{`Ft0eCfS6vMoBuxHibWGjS#8@6UGE-JP8gdtO+M-jm%*j*CSL7>Qxc^O@e z`R2UdU`=N90;n8|y>R*(TBrbbjB-fmCQP(PKwE4=Pe39GNN45s>1$d~LeAxIhMB?> zIW8&!-C3zM7zvIWas&MM8{mh{I zstdXr24BKS?=Uh(gJuLR`QXUup${h#l`Zp^(_+G4TkFrV!f`LzxL|^&}=F0EERQg+{3aC#gkN zS_5AlUOCgzMZ7*v15Y$0E`U(<^k@NxbYc-*1!&{(YZ$J=!9bD}PesAampeR|llBq0 zO!GiYbK&gx48v(Utk`~^B1SF-E5(diwE9ezmMi}2MFD|eh z;cP|CXhlsEov-3}kc7M2gTZ)t_#qrh9xsIW8 z4GE3V;Emtu;}HlkRy4xwBZWx9ik);sQ?XokTQy19J1Z^Kn3|-PLm~p8bBF0y;SK6m zgrh~tX5rW@4N`{`T^P)OVUa8Qa^=qfN?k;oL&^`3&m_CU<|N}031X_8D!UL3J8sZ0 zvPVFJvdRBHX|ed$Ta<~o8@4DIKeC*FeEeAo52H<(%}|UwMv<{Otk3vESk*vmheXb4 zAx9ATSb~?ApNQoX7IFZ4Ap{>;K1NgjypHQ4V&lWQ1R#|r8myrJMRtY&2qk)CV~IyP zzC+fkAT$s&3q9pbtS`_>6U2Lgh}^&+laG@fmxD?o!$h>YUX;j1UN_bghDOh<5nC0F zzc8v$>r*mKP+o`-sxbXS>^YMJfNUypE25KX%vGwHRZ75wVh)Ng1%lI`!Jvt00RxG9 z(#Y90O7hcPRU}!+la#Q)BIKAeOd?T9f%U;S#pJ%iSZ0X{NrliumBIuz4d*;gKM_d2 zO1D&s9{$Hmj9#0hqTB&(o&J2d_5PFKFy=ciVm+>l3~1*{8&Wl7%SD+akwbU!qW zG|3tQkZVV*NrwvrGO#yeYIv(wSZNMkAQnRe>Jc4BxPwrJdOH@8s+}okah#${)a;P@ zq)vW}SBuCoZnIdehysx|?2Sf%7UWI{$jG=|9Cid?(re_Lu9zv5V1e3~0HRgs4lGtt z?oUXrlVs!(Qp+U0fEgKT(I5z6evt-gQ%FOQR$emYS-W!M41Wz_*vj$2At2~5da*VG zj1KB+2;QB*Ps+iUoC%np%xPdKisG8hX>mFeL=hbr*pf1Dn23ZXUlZhOIprL!qZv*5 z)m!4UxtKj3N+PLgVKplv*a6g2EpvN)MF2ugVF^E#WgVm}N&>cpftHp%2wC33`-1Bz zABMsS7wFN#_)X-pkc4t-*k~zQ7WSt>3lxy-fjB{fVEHAYE1p=4 z7%N17D9aU-at?j~yz`dQg2J!bd*}+nic$&H3~P`moX{mCS_;2vZ_Qf+4eUNVUBhnk zQefiGkkn9?bt%f$*s?ERBn66LJ{heHfo8(*n#a*3Knk=v1j(gl$I#-DpX!?7*l!32 zC8oOOxPU_42PsCnwY&yD_?9#wah!pd6uxt4v1$;+CN>@^tS{oo(OQx`y0PvGS_;(p zCN&KS;fb{a>PRAv$!CHl{?0Bi!N1taa5*4KLvlbV0~K;0=*9;u6-EP(WN!)eroyFQ zRiGYYJBj6?9RXXp<)So2uo?OkhlN78@wf=_lz{kSu-+s9nVJeGsLFL;=OE=5Qhg!s z1}jcMK?K`I0(OLiNdbeSC)lvTk$NGS?Kifw=`d2~R_s79Qz$HJ7=8J;*X9g(ZINV) zZ4hw`l4YQXA=G4S0MAe^a=E<poeU!^LuFX#G|v2{px`Z_^X6+ zAwqconzC&uUJZ`r1~QPKiG&tpDyZi8ZkK{=viO75WoXk{Y>cq$odprafJ@=+1YryV z--H}Lfws|!wGRQ&moDDs^%2n%1}(SKhl@fZ5=I+fBWAd&(Sm}8pv=JIi*_~Ua6%3N zr97)Ijgt@+4IO;18Bov+ijlLH5`MHI`jtk))|F*88XIQEu>`OeeJG5Ut%@wq#@$a5 zf{Nxz!jJGkVC*P@;6)&YVndkIcJUh+=q%3cfv>c06o|trvZdd1Bguw!Z-F~03O8g> zK!b`92Gn7dDw7r&3reVmh(`dBR!Php5;`opq6%yUbxueDEyKS7SsJ8CFsF#vg<=$e zm;g^27B-0t)JzlmA)zW0gy_j)HeOiEPWvRLr&J-8Z;+G=iE)3o!&PHm2`9Nhl>7l` zw{_{mgWttyxmbLs%sGl9(TZBhC2}(vqZX*Ca6y7-W+0$z3CtVJmHP+?wbn?!)h zB!g4qiUS0I0+#R7k4qwKF-Xn)KsD``n#CmWZ;9LQLPuAP?jeavtA_|wDwV}Ug0kpZ zVQE9ST*eD_l_HwwwNwHqYFvhk$z^fI3sF5@Slpnba*%^0=@F@`L@HUlk;!1`xP1NO z#x8lHFnJL#EGr9caLGv^p92hNg=|w4m%|qlU<3?nftbVr$$qg97M>_PMI;SJB%gTd z;j)rA94w0+EeOV7E(}V!rMX?Wkyy-gaTT~QJ`9;s1L_QGgLy;(>v++o(U@US9vdywdkM9#hQd1xmBV}nIDP`1_uL&ZQ^SdO93iQ&-sVb4u zA*Um$(N;mSaE?^y<7n3oW;oKehQdIvz_Q+&$|A7>3p+_+_KZB~8?BL1ikC$H6PT?jG}Qtq5#%O8v#+lAc{S1M_=G-yK;4nfwf4z61HNwQl#KtNl!)a;f#O* zYqe_giRDTWo!A=VIpwx$46;`Ax@+wFbg`Uy^mG?#>?2>+TSiW4b9a8MKz ziXcluxDBh<_s6%i*nhRlxiGpkt z`P$~~V~C6HCsDN0>+soVH)#-0P14o4j+sJF<^;KjOlL>A97ZAGIiUk>Zae!4eh{v& zc7+Rk&J7;S%vNh7t*Ho)Tc8z@f@0e~uhZs|+Eyop zQEISbZ^8k%3;{A0f^{2B{|lF!-=PT67abRZgU>BX>PG6B`>Yh|OuI)b*^4*>c#Mh= zJ&_sD%E9z`EhV<%pf%9{Q&A?f2P*hdVR5coVF^fqWVFw)6dO8W6?L$c!*WYhfVm=> z1*(C{nww252{8>H-reW+m*7T2ajg&I*wC@?P!lz)9uH~|Bh)h3L_pvdg)WzYfQmIoSm=P0rt@s2 z9N8s-4mm+_keW;mU}r&U4AGLu^5xF-t^A2pi0BEeOy5ec(4Q1v;ScE*35<*H$S>)o zu%=#oFFcTnh!&ApMtmZ}-xGknM~=HJ@Ip(-9w>`Atcn5-D|^ick%$i_5ichZuOJbx zpaZX@10U2$KDd*7KqvXYPKrEE--|z``Z6{XVaT4*f;3i%|AKtNJtLsovvSgl@X#5; zU^8J6(d17P-V7_o+C_cAU(1Vb~LtAcb?;ivGKid6g2Sd`Q-04ST zAFq5y&fU4;9zi_i|F7>5Y>lU**tuMz*qvNsgD__i;sDlUj1F(GiZ`^6i;3$P-yuH6 z5YsWXy`g<)c6bS!Bo4&_MpaJXwP!%1hxD%idt@+ zq?W%%Q%fyG&8Fv5RV#w6a`=hLf>pA0?@}>CVEisrCjbjWcv!WTs|ta0FeBist;ty- zDQKa+8s~czOH{Tc#bwKf*y17jIK1|GEpzFDRxaq}Zd%X^E|wn`uZ}0zIkM&1!Xag~ zZ(b$YO-9ZjYG~!dVwFZzB!@iMPsc-&gjP&8GcTB&HK?&_IJ*cu`iQ6g3%G~x8PL>af!3S?6m1sAlRjIb+Wa+B=JX_Yo;@T7E!O$&2Un5G_!Hz=!J}Oco&JU0tJ;J zw4maj_J*`QYBRH;$}QMvK~176tf56g$XOHv8syZ-ix$^Z)SxiaWLuDx0@4D*t9%k7 z3>Mf0r@N+@T9Ea4BQq0hgId-q7{qOJyj*WV`{7|#A*?n5DxN1^0|rQ!*3eulwplC; z-SUF`jH0xT@!_Htp#Wq}8gx<;CKwxofDRMHt!*x=!(KBqeRQqh^w9zEYAT4uqLdG? zEs^2u_Mb=sOZg5XI#hZ=z*y;E58q z-g2%H8VhLtX5>IcEelJf^gK~6O3mW7%g#!si-2)u6v9gq_9)S%#dzc>TY(2}9Tolx z`Fi7_j9m)*u{ zb(A`!i?hg4={#>C%q@A{Lg==Ov1@(Bg?%DxwbN%=UN@Kg=FiW%3MgMkS=7)~tzAk9w^ARegr z9LKhOY&an_xqK5Wat9v4ESd6TdJyNsg4usOn-wU7B;iOFfOw(>rkw1qMOi7mxa4Fm z24;%zCy9$8z%@>{t5icSwG0JDpdZDjK?6TC(KxIIjo6$u*)iB1@wtEn>yWU(-a?z_ zC=PVKvrDaUB^A9kVisOQRPYdN2VY`g zmt09G=mfz*!xFS}G7O31%)Brep+S0Aw2uWNvq2dA!?oq2tLyj=Y9Ni_$;mP|T z`!rfQ1|< z6De|5M%ZS9gjPbiY~tZ*K_m4TXodz|X2$#3-*c;LHwf8EX7_oAUt&Rb)v2mer%s(Z zbuQoGvwy%5QS}1prVKS|7(UIG=LFJ}Mg%KWfqsJT#ba0=(UWc1BI(PoY++`Dw^&Z~Ou^Y!P@bE&4gI#E z-tL&UJNoSoyj9HrLL1*yOsVJZoPMBd(hFNOptBk4a+oKW{E7>vXd+C2wj7Oc!mX9? zJV?iha6`{ofJj1|_+&59icEGE;0=peKGvj#gRXkNZdcJ83I#cpZr}=52-Ji<#sVz$ z1iEHWsu_-j#Cm!H6H+`TX;`ln9`n^axgq~xv!a*=aa*focoU)I>#zFowqTWG-kSul zIQe1#hC-fQl5ORVBKhG<90`bme=gU!0UNfww=Q0{>o4%IQ&tR)X1Po|c#RHUdW~4e zo-y0gZGgsQqi1cJUd+7m?cM#8Aa*{#8}ch1|>1@jh10im0%_>f&# z3}3ZoL!K^n+6-8*!oYA>N}~en*mOk@8P$eBPP5i7?{4rQr|8LsodveGcE5f0e5ZZf z+rsS=Ustk&n(%w7N+$q7cRQQvnx4wMG4Pi89~fj;L3) z#F_6D2bll)53yd+B|_XC+VeZ+M4 zI?Tk~#`UV^vuaJ9v*YpjnXluw`W2d=TffnAb?owes=zB-*}&3%ob5+Dy)s*Q>}=(@ zT*aYpivDFNm7+TNx#LJm11Xnd=$5nN1773$nD=}b6Yco`9(qf~RQF=o|KPm4WA%)t zuzic?03`>+aQ0Sx+>w)PqxSNO>(&Vy_+Ts##{TFV!Be*pHGB+^riY(x#hC-ZGmkcI zz-XUR%P^z{jER1j_(OsKH9-}?n!*W`mit_wC^kC5(JLyP|#2)ePIUU zYz#QgGR}25Mja~jTHQesuzj>A#)*MpKgDOyvQ2)wqRDSJY4W+(&wyK11=8_k5TCYjr{82YH z8#eSv#toY(jvG~KEQn{Z;0oVwPli=dC`=WP+mbfzG4acxaNt5Rf(#S!I43gzf|&iRZIPum(TUfM)qYx zzud{b+}1CjXJ2BQi@ei7qiot;c_6R^`qUP~Yzf|Ms#7ELGY= zIDu-qDEv5?7!YDLV6;Bj&m8o&{DWSn`;&jlqa+wiG^!hyup~wcV$_)N)@p>_?=q~n zZ9eyzx0&YNwhMAvQsj|`5ugR{-g3i3;2Ju#$?%EljCYqiUP-%SbA$wp*@Rn0IcS_Y zQCdf#2OKS}L8|9+%v^Qc%{h9iQ6d#K=ud<8qWps6O3n%Ro^z@vLE>rE1@Gy?WM9=h zv5b4NR-~d5!Mqc}nDIx_(g#}ybHL1=5|e`@v7Gz+V&3u5)}H1?P_&O@LP5Uo$g$;Il=TDo!eeTgOH4Zs3;!QcK-Y-m?e@fn)}9wI?20^TRsL0 zr&|fm*|MC*nDLYkYZUezed*tnQm3q)cwr~@t zoUD=50vf#40U8qz0~0f|P8O3W;JI`OcrK0Oi3Dv=C*gRE#x6&2h>xbQq~#Ka7%#nK zNsi2wrlorDQ^Z;9rNOm$gm&Ix3O+l!ItfX5b&|%z$m%BD<_wc*F7uSdsaxEjH26*%GjsBGiK}GhDluV-Zmwd? zAXFx**vCczG02!HxKVaR{<>YS<07-Fio?`au^ zmzWkjL!f-aop)g`Jog^UGLVI;0mp1}*QOjUZaiW#I>Akb~h;ggA%Y>&_aD70vea*2r`+}+v&;f_*`GYBr`QTRSH^c^*H z7Pt{(*7#E&0rw1fHClFbnM^-GXbE9k+I6D7niOg`b5ywJP)<>sjy!vky_52GTUkTz ztjLYFwGWOCj#?N)u~B977A1E?liA{q+p?HQ-W^zGe+P8b5VW+4$dUSGGpoLFCslGE zQRjKzwCzJJ^v-|oB7*e@$(kRL#XL1xND|U5v>u>n7z>YEFioLs0zUGlAi`K0u zKSxcxV~QV=p|i-p%w^17sleLt^&tYwHPhNAGcDLh*-VSZJz$5>6e&jm3W>y<8=ew+COZpq8v$ z=THOIYN$h|Ig3I6%Q{GCrov99LK)8m{Y8ZW>k!<%al=LUjIqn;nPN7e2~X z>e@xSF0cxZy6cWJNS>c;<36_Ql-{vC0B!bb;-=-|j-#Sx?eFb?Dk)_ba{a)(s315x zbR0>o$RI-BReJ^`aD@*MYihMw~KV~{9IHhtQipTNdj^wn;BU)$LMrU}wYIcuK4tj9R z>b>o>UsZA)udg2Nd42V1uH_GH5vzQfv-d+=#44ZAA{-tc%SC0C%e3oZlQRV9L#2FM z4emDR?`Xcl=>khc_cTP6S9>zZaL(3&LhJ z+W?*9MDsw36UUp4Nlx?|kI4a7?1d6b#M%kN3yggi=m;9J3u62Le6HgUsOKrglroVJ z)N@#6<~jV3=jh_6pW_epJh7TJ;D^zrc?>_~G0d2G3_nx|DCNegc4~ScFUgTmy`UfJ z#UvRTX!uLT#2PQmbNC^TVK&WU_#uxc;jMWLKh$H!kM_(_kCWlZdJey|xM6h$eyH$O zHW-6ubQ#p>#2*S1p;g>qAJu9aH}D-E-?yu%$=p%(?8$`P!kM)z)7vYjyH}=PS5C*& z3*czxIs8y_Gv}!`oJ>u^(0V~X%lc~O zzcA<(wd`xTx94wK{T~lHtKkr`R&5!gG;SaFT5npXtASYfT??vxd_O2NB^5cdDM>Uh zlf(M>Ph&U!SCT$@^soEkf9-q&|9SDhp1;`s`d{(C{)mqq|4Sy{i~iMROU>zJaCQer z!^uZR03+ZZ75^)m&!>qO{|h5AM)ybiVu!omBLdi?p3XWLra2jLd>^?w$E#Nk&H<}` zp6Wy)B^c8P$57HIIm%nElG);I=H)zDN~)`IG`(D0?eQaQgC7JtcvhY-BxJ-t{_&_j zc^SX5v)<|JUi+xkJ;A{AXO)8XJMy=3^x68UeSFyc>8#?=iU%SHis8YYjC%-Sh5`-J9-D-Me+Dvi-~o_)%sS|6{cw&15=?FPCh9&MONRRBaxONkc*w zUytjeN|teWKkT?GV5@zy!%Q~6#bv;4XEDb2N=+N^s<#8bUfL}^Ta z92^6z34*E=G=_PyUfrqdvnpjiAQK@j`;2xU{HDDz$j0WRd)EG$F6*zuc#L6y$yVfs zT}&4?i2mFF>Cd-TF+zfvJNFExyr|Bh=L#nMv9vkdItRU0C8xT2S13M%UOvO#{!E{u*_{+2>XDQ$s(7g;+acZGEarpR9X!tg zUD>k=;&p|fynNxj!3(MgYEI$t49+;q+#cRoG$3@3%}EGNhJouhZH5r>ae;=MZiw>NXJYB zI>%Ox>Rv4`z?2tEi;J(fECQJB)N=&!p3*iK>yC%byLSUKlMEwnc8|MrTyYa2uUr2`Eh|sT5y<3RQe=MV-}2tMPFTp=o=hR$ArAa6xR0rq}E4K@31HTh5<6WiSQ=&Qh8=SY<9ZMAI|zGt<(NltGP1jww*{!_#sckAetu2%PY@A9atdJ0;zOUjJ3*!x7ZcC79AK}*LLh4M`z&H zLk5Dy)S&7?@HV-L$mKhxBP@C3ky6MWQixvX7y*=RI@|$Z|Eg?jFOegtJ!<^v z#q*2pVdGC5zq8LTEUoP^OJ28Po>FKw*m|{#}W~@=Lcfc z_z-a0-znDtie`mq^_&IvOh9e2K#zpJT~j_wP~c|nAB$zr2kS=G47stfGY%&HhGSJp znWb_%I1s)T$xOMrq?jxxhs*$?0Q3+eem;u{8YfL8hqBehA`)&9%T4I;ia)DF14m{SV)vQ>)C;5nu4+`ipW z-*Sd<s^wnVcGI9Fa9Spoz!~A1x ziD=Pj%`!RFagDdK9>8v&H(zeU4D%w>-V~$&C1fp3xW>#Nc->v<<;H#-srDmwO&Cr3 zGB;HKLi>{1)Kc4L{8KF08MtgxIbrfWrn$gVg~ly&4l=uCFDhF5mTi8%FzE77w_%Hm zT6s0C9t??Pam(QaZJz{h58WT+sP>Q^OyZP6pa7Q{;(V&CU#1s~+hLB$DWMZXS5V?` zpfvm{8;G_20QJ$g_OW91_!8sORvv(-6?+Z$ueQ&CRVP@+O%4AuPGOA_14H|6U-fTKzyweC`JEk^RQC_+|D#kf&OH|>z*{s&HJ?7^9^S;T zyRjpW>LT6CQBCQ7`DsH30oOD?i6)qylQ1n+tEyABd(0$U46dx!u^y_r=(wh8V=YM? zpUm#$GE&Bax)#dVX<*RdkZRcpzb#5dxIoNQ#Ibj#Va0fr{KSO(|Da4iD2RuUccbd4 z8b;<2R*a{sZ%bi4d;u$>$YXPi)$oC6C=zjnxC!S|fa+Ud%jL{i5^cx+Ihk2E-ZSt4 zj&D1dUt2d6flBPD2B%$P%G^R_fm5}pam251icHZ0^1*Ibdzztac9V=Oem;%3KW)V0xJO<1i4x{v?w`lF#$0Ng*mmqVLyRp zKP#yPa^7p|TF)8$~F0VZ_fXu6M!H z1OUk`s`N!^&y+#fsGr5|e0d==D!#2L2n}hZhOO!3GlHQK=i)g$uPeTnPJvEt%~PleTj6Ag@%qMHXg&e!EG3oNx+*^J;w`)dL(XES_rpY$TF_- z7B@;Qiezr5!iUS%Q}5tar)4=IWz(u)Qu83i<1Zh1V+s*WM_@Sls(z+*Ii7O1>C6ch zC4YTxRplonUR~y$Vry0ocqt60Jij!b1F@_N7*DHySvk-)cKpH|2mdmAsNMEU!nxHi z$p_m^Njhb6*}UVZDoeL}!nIT5+vV^wdc!)A8F61>eJr*m^9eZ~4V90h-XbWP9r6^l zkC#Pm04d-f{|HDF(64HZHTv=#!J1`Xp_`M2DzK9+ zu*&zrR(z|r%L^c~#ZHbl!pGlL^8KVcR+alXUmCIxNLXPIF4#Ar)9fFhnKb-ub~|{D z%-?&zobb1!?s2PkaQe%tQxX(8K0j)mwwqKOnd*l*N29!q z=uBqsKs3B3j|g3w zSq`QWH;odbvgBM_ZLdpCpWdae=MCLUkrPCqueX#N43nICg+J9BS-$wz;w0KnhOWh_ zs<|cCFXM#;6n~n8^3n8~-|4$P1xE-)&M|8O=)hEeK0}@0xNt6$%Z{`Yu~yJ7ZmkJ1Ga3B8z@DCJHZWaJsrmhA6+r z81z8PMe&q$K@knq_1ZW(__=rRrqk`76o6xGYc!U|7+7)y^auhLn+2hz1Kn$d!DW0M znRE%U#_T+tUb5u|!oV<%7m*5(84aym8(Q5!DM@kSG3^1J+T76o*|b+1XS+InbyUEN z8QFAKI$mp&ZX(pU=;}_VTbRIkAJ3I4X*M@dRe7aUEs7y)d>%3495jqE0AOq|bNi6-E5zvQF=$tVA$AF#>%S zd{wEe{q@^cK|QDi<>#13QNKie)XN~)_Q+dL2pI&qv*A%P^yhWEclO%PETZww0b89( z$8hn6fKBYJngy?F1Apfl*s4`hj?vcNDu?lH`+)Gp+0HqxAas|yqui+eyOWkmdOid=07dvl2U@*I`2 z*NYt}R;pB0B9Tb~gT2Gk9V&uKig&B?ouBi0+=m7ic$LeCz21);c@TE4s{X;SGSTp% z3@Wqat+pPJKH=+%4m!#^p@TF3o@3iNKwC+8y4XhonR4nzgj`ka;##~$9Wp&;9kyjY zv|_rg$m{_!8Kx+T?S=C=#)xEh0dSEaV4M<{+^L{nhyMwHJ`@*DAJGsSH0T?C+o0O9i{SY!QxCqp){!HHP?`F~ z@|HWV=Y<-ba$8VS-3%}yMbVg0${RC9C3{25wf4@=@wN?_ZdNddCEv}PiCp*-$!%bB znz2{)-Wi00K{6l8YR3HPkvCVP@j_d|*!smlV(==%nJ2Sq@Oq~W5O8f-q1dE2UD0rO z4$1kAcqb!*QANkyG!`s#75vVzph3_`$%# zj2q5jRpm!QLCK-vWJ+ARTzriQsuuHb@V=-PFv$gKSX zW>+bJSXL4V%_C=$0_N8$NnaX~j6O)MjIDSEsRyUr3(I+iPhpgwf+UJ1+8>!P<)tUH zlBDZMwWxNfqRiH{1U*W|V@~xD-Ok40l)VyR7hjTjIL4Nb7jS$5#746{u}NoP1%`!S zrqN}nOTal`i4p|=1#G4)t&4!fNWfjx9EUK}T;9pYpoxNIs)avHZl+ZhZY3JtKAB194Ud6m-QLu-_fmnl6)@zCw z5o2DY1%l*b&NOjpL@f9@X8^5_0kjt3Nj8)c$;gXMBXwY4X28jG5Gh)rNwtE!2GL(p zlcX@J;V}2LWKpQkO?sAAj)MX~R)&U(_duolEe(Sp!=CKlNY{pmf97%m44Y1Tpp3=P zyfpY;?W@5qexvQOqIt7y`HpZEo7G?pSF{iTEhyJHhqGY5Wm}e_-YGGY`}HMOhNj7G zVan~gm94!V+I-UoL~A2E0#PKqt2=N2M7vK30ZRaS?gVbSKo4phY@y~D0x!cD#engm zjIMOtvA-*KDP{|b+f-H5dA0gXFWD@KQC%^6njP6wXp4B`1?JjKQ(iW9cyZbz-F2)T z6sH3n{8$;Bu)zkmLR~XZC)w$wbhh6RoPM)<-kqlFC$4h<}PiA+?{jR-zAtmFDZutooov_C^x;` z%Vj4FD@+Fw%S6r$;fLz735{sfsOuFBj&GD~X1<&z;1JiSSP|h>z8~#Nm5{sMB$0sU zR=cX@XLi%pjGNpD7ETm5--F|;Go^0sN8)mRHKQ zBh6h z2p;ZgsZ^X5Y>OAFpetdlhKp^Zp*XF+)lj)u5&zr|lNb1xL`!R6a9vcqqd%)NPDP_0}u2MB)K@U^+C#4uDF5q3PCHo=yp# zGlx;w?`0cwShyzyW2RlDFaY1=)}~Vi#USR;k%pG{>xKAsn`{hbQbNZfhjBxe|xBwt>TD zvA1L5V%v-%w`?O*HXhz)OIFs*B3DpUjM+-qB22ZT3oY` zcI_%^@eObFF>Y{mnM0mXz%l;KC(_j0dLX`f8^P!OZ!MaiE9~#r=Iuf9RJ+0jnTAY*@6SG~) zZifcMdb{J@5@^1t51AQE$mT+u4ITJMzkwHNnSz-!xQt##o;z@$JR~GSo;UCj$WJf` z=;sx$!bPR_5?ftx95sUi7NhWKDa{=KovSAP>WEt>f9W4`uahXgfxLlpW%!w)QUuxo_c-seCZuQFKL1&G|9Bca149eImXdl*j?wI zkdKV44eGyWwG_WuOqkVpsw3b4Flj)nLS57_PA%!`-Xa<60gd!6&-ad805ranN|Xt% ztP)UJ2@Ui5thx$^w+J@;@*;!@qOq1-=2WsSzj8#texKGviA|1JyOm5Y_e=&?T>C}m zIzbq-qI4i`I398cGiJ(wPZ&>0*&*D|n(KkBD0g_X1Y@BD-Nc%ujZ!t>D?fD)BP?ld)TSq9c9r{Z}5&)^Gg=@sG6o zyKHpza8~S4*$pUn_t|{A5gu;wQ4CGR!Gb<&%P~Dv+y|?rx|&5kq~_di zP=-l7MvOT+iB;Gshwy1%>yct@DDfi4a4N=&GdOg=ztb0}F~x#PZc+}=A<9bWv9fhj zfpIbT0eZic$m|!d{?P=Dop{m;acK000yc0-nNO_?d4ZT~EjNI(n6iF2V+)ig<5X`R z>d`#S#xEJO|0w_|kJBq@SQz_pa2(~bN`XfkhFM}Med%VtqrBlxFVrom01*VS|Vj# z%h=eNO4QK!{)TD-*IpcEIRs_ZSvIz2IF`N`10~qw#`Ue&6LhDv7hEQ2y)TC2xNJu% zv7?J}4n(7Vpd}c^(*T03$=A7gI9CrXO`63-9CHlCB*d85jF1&-rBSI)qAa||wCUj# zK}5IVz_OfGhALVOSGH~ND^(d^q)cU@C_-UHrF{{p6TJfUp{6}Tdxa8at{ny6?Z2cP zws@Og9#xExtsY2hCHv-^jQXo81SE{bx85LLWZNz$a|;Fb8)K$}R`imR!}c`5)-lh7 zrvcpK@r+rJR+g(`!@;3o^mPD+NL|RCc8UQShkS7>_o!laNvJ~`WNldqonX_RpD>`K z4D&cVR){B$1Q!3)!4{1-p-;p)$CyZqw3^6mIz1c{Pos0g=vc;%j1`7s$?aRxDgB=@ ziUo2QY2B}EXIIgL?w2jiwSCE-H~)E;prd%t6B-;VKD5DztJ>1CBAPff*>z#+0Z_~F zUXa^cO*1wlC2qkJAXKNwZ6#%8S{>odq6phu`FkZyJa`r3wxaBM%!*ciVt92(N#+dzBdnS?!%V_?uTLl_UE3LprYnwMtg@WCHL6C>mr{{)iwPLTxG_*i!cCSSAa?D?rpL@o52LfJMMj%9EWTl%mpPVXjGMJ^p{_nb`(sn#tzolSzRM0 zLXLMlqiVpQSiBNmh(suv0?G+C!SHxen3BPjOLqD;AJwr)BR?LuJG<7;*9V=mmi?f2 zdJeyBw_T_9`BD40r{62jeP0?SC&oKb81gJb9o%Wlzz4Noy z>ES`|K*O3jeVFO$ncB_Qy3WX{Gg?{a?Ct4U?^IWd{+eFR@zzW22h?Z%Bd^QHZ)^ZC z?la&wW7u~d0>zA3-TWeJSUQ7Pn(E&4Syw|HW42&NxxkNS9btg`W)iLcbnfXbQwUAg zD`4%cgLMI?{r6S|0=%{F9l6)k7MWt$B^Mo64mz$L7adoRh>okrLWcy=+I3mh<-kFN z{<)*0Rr?k!V!zTm%7#GUy@P_KNXR42@-2OnI%DP8>rqhLYS5{@TqLvl%r@FHN^VCme~KuuM6Q0-J2X9y|ya6zwCLawux_){Z3eCTakak`of=iHQ)j zNOY*z1hDbjR>77e6WVRd7)AycZ9FxSBW^MYMI4P_SAJrEjztKEblHiu zg$GPURbNn+6s1D%q&&}z{i0Fw%*&;PoID-`!;;hSCxrvE^~8)+3Sg`~WAqfMp=2gX z&p-P2O6Nq&gX92Dcf@#F$8(cKlXZGSU#Tt&wRId+wkw=RME*+2l&N7+9DV&uYaTfb$txgxZnBoD{p*r}G zQW{HJwiBe6$H^?`cXX$cwXtSX5e0Ok9uZnp<}16l>XILQL|GlDY<4VA)R#u4PkN+v zcXRRmvGg?4DF6=tcI*0VhDMVi2IiaI;a_dy<(t$j@;F7qn9OUlC6%8*E)vFLv?kyM zA^Zf9VTd(jdPDX{l7ML%d?$60_vTL9RQeH2jVZYa>p5>2TR%~E*YW*E)Ggk)1OwK?1&ZxEJsPo7DhOqgQEk|MKcb^n9@W^q&d z1@Rg}();hQ5bx4d-iSBFrOs;aL4(I67v}B`DAfVkG znj#AbvyD0Rff{G9AJ`ypHDd65c&u&j^iIrucxiDVvWs0#7x9=i6b;q)aWq=E-eTUC zU7Cl0|(VNCv&2P!r2qGcNEE*w9hXpt47uGFn&aWiZLOcmao+2L?l0(qq8B#Q$ozGaZ1UajQ_s6HLWzg(9-Q1 zqv`CKc~j8KIxMgCz|~2~_ECR;nfm-9cXo13)bIBO@C?@xI3^4*@^R5S1v*-x{9_gZ zq5nfi%vHKA6;8n@Pba~%XTh|jqgqwP&SUay$}v@%CI*9w`I1uDGFhPIIY--BBsbxF z$lm2#v&4}8O2<#C3*Sqegt_!r$~;*@MYlXq_gy;dme%LxLo%YYb8m@DKZY)^i`F!8 ze@<;{46|M9APiFuy?`5CV`(B)Vj3z;0tN(|?qaT17|XUT`cCh0%f|>wfQWz{Oe#}W2{z8!<5%=isa#vch7AQRW z*tM*^br-;$SpauD<3i%5HRqb_4wpiWM&|2s?VCvEs4rhuvAx=zmjTjhL5ZIRK5SbX zg8%M20)JQWDMn=LkR)ro(Zu{o%Q=XCC@}{dP28xL*m;PbW2!?q+;jYn zA(etB%WE!Tzs9;`YuIT@N1sdwlEv#a9??2703>#3gir`2YA>lh63U~+VBE1zK`7Hh z5go*0aD~{6-IAk+QI5qY zWh@5gggUwv4`%~Q6K3}^wyF{eyR#;agtVn^TD^Yvq}e@em9bpKJ|UtTq#_?e2~v+i zi%bU{ak?k{qoY^t<6ZY>+xz{4bN(^Vv>jBC*J|d zHJrcb=;WXWBSFI=>qLsQfM-KV_xEMcY@cD7|5W5z{BFM(EQwhZzbg{KN1=N{^MjR`vs{x zgX2)|$nwCO%~4>KK)W_dGn#G-N91N0iJ#~=w8mH_XTVu)$MQR{F4VYJ3lkrPui3~7 zsf<@cyez}ZFrHR6nchwpO=NieP+bg^DLby(;;jn@kGf#_+PY4gv=G6VK~v120G4f= zw6a5|t={?R@dJ9K`G?=G!sFTGb*wU<;)k;s9bP@@|V8_{?& ziH0%VDT#iq9+YCdk&m4u5v2K5b*q@b!W5Bc?^^4yWoa{#S)a(M4VVY8)se{Jzil~; z?-Y0)YzX*Nhgial;Mb?G=mou@?MQ&KySF6>k#=MZppGMP%P>AFfjBkfp&qx{Oou0#wwKH~FJ} zxV(j)0sgLc91^fG({REHPj~EzmFT?Fw2X5wZLoQk^%O*$>5h%_4bar!I%+aM+_PTt z(ZRUb5D(Dorz`;dW{2Kb)bC?DKr|szMkM#$H#8c<54MV3jWmB8KRo6@e&BKByUSgh z3Hrn_()4L(H=MvVBXkIMGrpC>fc#kc*E=hDlFyQympj(Wod@tMGMUfiR*yk1o6&p@ z-~SW>_xp>mKaR+Ad;7!3clV)WywONrvHX=82H8WPZ-I=)AB@OtIGjgbrkZUV(#?CA zOR~($jqAlVJ8R^!ZJ(xrqQ?hu&PwFEY}j$DdWyai2-E6;Upe4h>OTG0SrbUYLStUZl#9 zDd#?nG%m+*Ac!yWShMH)=XX;%0AeqFuv0?-rdht3;F5UJ6b%+-RRi&>3@lYORd1MJ zDO9+X9hQ_&J(+VvJt(*RXA;9c9N&a@X^>8khN5Y*yd)DTaWA_ss+Z(Z_Nb<<$!1iI zr`J_9&3Xvk@Y%vTT5Lc$*$Ift9(mw-!I=p6m|!5~ofSsmiYWPc2L|`NkVA8$@+hQp zK_1cR<_Qn!$RNVvW*Pc%eQINNsx?x`1Qk%%RfLCTP`)6NA+Tppf)AgrKR`XtBkM+9 ztFw};@YoF|p(OgkL{1AyjP#g#5FQ4lRi79IjilOHgz5WSJq#j1Ef6C40%?$+8ogr0 zC=Q56x&>Z21(=H#a9&T{H$QOI_xbf`BXj{bJ-|&3*nRUu(*^9lJ(btxUh7QVEmSZB z<9nk!#S)m53t+oSRRV>o5e<$LGr+DjD-WO&tWWqVcbBM;#Ge(vI0D7uJig3LXC(ul zE~L4E-?j>W_l<|B5o7}{_&tYjeX!WDNj~D=iExVQk{MP>ML}hSFh#cCveFN%ZaZy^bv9f1{_T|fj z%W-l611-%4C8r_O&d&zr4iLV7v%L@Sjm{BcKr)Ho6+LR<=OK#dWX+Z`d0CCnf!sVJ zLsfDNQej`zEeFNsouSV{GJp+_=YxS}I*NCsDBI(_7s|TpRr_iKN5Qw&R+2;7<+$fa zS#*(d3FDbl*!Rp><`FJ1%Dad+Ey%HriI8L%#<5)`$$Ph#YC{FOK+fZJx*E`ns<%?u z|4^9|sx0WV1hlWd)#`#1yLe3=_v}UmFRPo&#S5W=ZeDDBQ1T+NTITe+rb8;3E?fM- zLT8jX{NpMdk2b;!vo#%gErA%$m2o zaC~J%g(h0E43e3^i+Jg-?1F3&4@bHP+ojZJ1G&0oheNJt>iHX(ZPBSFLBv4nC>a1D zXCg#>*s_K+jMG_&qe?(ZAX^^zX1&L|&GNWXpgYd-uJwj)%nAki1E@6?O==hMEbwe& zCN^&}CU67tu+q69TpK6+#m*`Awt_o~94ZivY$1Y{A?IhU{(qbwozR6KJe>~4OIS?B zF>>NXcu~J9Y7-1V)_j2?1=_gCYycS|x+fs{K?6F>`mXp*KpEv^irEV2#*+;AluaI; zB8;fQ<}B~2K<(wM_L4?NyximNd#h=R&kgVn>uE>>PUCJFLD)21rexPqx|~4oE0*~O z?OhBZPW#ueNzN}VSAE8U_&qb>k^ep6N~{rnJUE3d57W=)TZ(8?Jqgo|2bdB8^E^Qg z`}h!FBiYk7sjgrHM>-6&xqK*g?D&vOBqX9-a$~HkSDMC=Z!EAY&XGNG4i?5Zl7h8U z7aUVMWiDqPvH!LZyuSX{jDiP)gt=|5(LsKyjbYm!2Nd%T*F9M-q6v0%vAn#*UuYYv zF*TcG!BdK?<1`urom81hD$1P7vO2Q#r;MnKXuX$P z?mNqx=gTk6cYaQcr;m0j+B}W0rM-}Glf+TlGA9SICy5P*ZM?Uvw$W$;1zL(hpnZ<5 z-2ywuu?O}9|B9;xwoz4Vd6^1hLtDe{k1gB#G^5JUZyc*1w7KP@nkgVW(f3(2ZFRZ_ zhwaT8vvpk;w$9|%?~|{Wym)AjUT@YTXM5G12Q)@4o&C^0d4$$H1H{a6 z&)PCJ!U9Hc+Pqu7?(bo39k)9lwR~PVFLiJV-7P0w-8=-*&Gt`M?!*_h+Cw@FZJ(d~ zc<>lK_G#5JlfQUZdwFe{C~wfQvj=rdJUGa`!fMy*=R3cn9E6GbrPZe^5=e2;yi%Ls zmu%BE8%8#_S(b~?&{hwV29(2l2KqA5yi@TcFl*et@gG(v4ScK=0d|NWO$|BenW#s( zDViwc0RZs=JNQ(?*#He)>u)-=B!ARdb?oH*v$`-JSO6bBWt|QA#U@i`UyJ3>jND&3 zd%aFTKizXs?p&J%p4DT))q3t7boTsy7tAK6;wz#>>0dS-FBV(g$iVACEn!rgRaO<(>;q=Ko7tu!G9p z#yIC1d07AOApEn-Hs_uOHS-*Xf4yb@4}T zS{BN!9D@ReAJKMvJ6-T7F$d4w&|+w~r>zH_%kqdmyo7e5uXzsFYT zcS82doGE$0etGu$?3e#+{;QGnsT}x!+-f>*{qz7XoOiqy1@Yxh`6^7WDC8c+IdO2B zBV)2+d_E8FI8v$2l{p&M!d-M16c5zG3-+WDeD@u`GOpnS4A}k7pXIU7#YIJ1{>-%# z+21G4tEKDWuq)oucPp_^@w7&HYNK1=_b{Z(C3-x1oZdEeQ1G8nfI-3ttFXnJkFw8_ zC!dQKPwC{gXBYH+^t`A&fEX%t63s88>EJGS({$qD@jc&L4Dn#XbVie8eivAm zgjNk8%PTL)!=mEPB87&*Xrdg6$XzpU`|}8gE!m3)q#I_f{4kohfe6(_t&H(un@DFv z74qZA^qVrNO@(?_B*)Qvs@I1|{r}Si{)0pJ2Euk86IZ~hj=2NB9tit~JlH=x0_?N% zSL zA-y{3{**i7kpfOboh3I90eaZ}aRZ<*zJ~y9`%oVfff%jK^eld0*IpeQXXxE>3K37& z2SMzf-UBe1KM3B>_X50q7{s%;ryCv^?$wjUmJpL>6{5z_-#Z^#?i!?;iZ48lyV7IB z3cXd1p=vE2e5`2xw)6i88V2Me@o`uHexJAAABWqohWx3#el_Gz<@ArsryhsT=W^sv zXvBhW>|e~_m7QP9Q4>MD*SlCO)6)uwgcI6u)Av9;l5?x@r_NruwO@z5UBEC)T@ zT-QI%)Ai@%m|7KdFsq4{Sl$$f68&!?jF>Z0;r?`_84H4OO!C47PVJ#v+F&bb9p&n_ zGtF_Dxzy2wKg3j%!U{fk=3e(H@SU1C^!VuhP<7J}-P?5URdch3O-31vr@TmN7g3Gc zALe|7|}65`{nAkWR^Ce=`P<^;I{ygtIXZ ztbtfw=?_@vJ?|u-Vp(vgw<@Rju6pUbAI3@6v=CtnE!~2Z&iP?8@iB(&o`i*2slzlL zP%_+%Kngob#Ohs7K&cd?6jGBX)JyP8dCt^U zVa?!2uOt5kNQd`OD@hFxMdoeJ{L_2bLR#BIWH%A%CRz`&=3G09OM4WTFp9=UjN;AO zQC!-ixQuiY4;lsDfIn<;1exI3?ymBYM1dVSYyB=#AucuBN8VZjuK!EMI%lmzOptM~ zSI-}y!p88jn~mAHufnFzVff9&taOtg!H*B0scW-Av7Q~IU0B(KM)7TACv{YY3BJvn zFA`pu@X;y~MGg=fhRJ{?iG6I(n>5OZb=qM&qf}+rbl?1^Oz2{kdDw?ml(Q#gtq{~O zKX!9Q`%d26UX#Lu@8O1bMZTBVcT9Z9@fPgXt&}F{PKot)gZXl5;&Q4qu9Ql?8H_Mo zglB1jJ@+O&z^s9Z@g4ps!c(!0KhahwZ*tLIsI10V@wfb`Ur|vfg=9x0AzDL3M<$ns zK%lr9X=9b0J3t>s<3)&uL)Y;fBbx;!1Xco?N0)f@tIWQ~x}h}FS%w38)30dRD9( z$~dr!cQjW)wFXn$=l-Zb_vs>;N1DuGNaAImK@f~EN$t^11;vs@g?cu3tL3r9k`0T} zZ>aDjDs+U84nXXlPDGE%wm6`@IQUag6F_{1LO!hIXdIOPqxB&s_d%95J&*x$o;OVx zC`!|Q>doJD&BE1rhHf~_N)TQHHbN(nv$Lw#EmfV8dqE5Rf`au;^^(jXE6D*6=zMM1 zQa1a5TM=6}KKXXkoxu9!#pT({WhRP`R0Gn~{Lt&3RGmeeA;rua9g%C*N;iC+9R-~I zVC{Nay9=1+R_M%-lM`v9KY_P+{0J4<6{_EV;!@NL@t#GsZLcaXM2Hox#M>5DFFy}0 z&SgRlN$2BX+iV6`u$|o1>vea&bl8rZxwrW1Fd=SJ(io#f;!?Iq(cTD1I72#6oAsWk zMh5RyK471BdQl@>AzYOS5?ez@$nyo{{M28sPg`ei?T$-sY!(73B3_(kkA9i?$x=>^M8%<^)X=Ak zc#268ms5PIh)W$hGfl1*tzLIeJKgSvVFmJ)qOgW{Dq0v(IZ-hT()U@ZUHj$@lI4^< z7xe9=qedkmzTyxn2S&tNFRh%V3k)DNNhrFS3TmA3-m`CC(?v83yhzYIguRt@;^D1d zrJ}VI&@5Ut#M5DP>o+{Oy37u%DuXx9Fud9GW1mR`s&$n<2Yyy*6qX|j4GIWlqfS%^ zhTHV|VfgpYFpTF86wVJdUCa}cnbQY?#vuD{5FM&Z;Xp5R4pEwLe{|c1I(rPC=REw7dR^&oDl3^;f zwGo0Wt%DQ$%TGe~<(D*S8Mf6X@$zvW371rjYq9C6@JzMcO|O^HjT*2fnV^U}VrCfG zD9W%PGSTFQEV4uZgRDR-Ki}(WV zSBQ$tO*R`w9QKWlnqfPEt@mt^)Yp&r=UyusC~5#G06!lGhYmORT?ie8hK&dvIf*9p zd`kBO5L0h6N=J7086{VU$7X-}%7`RdT*{G2yvTb<>}qZ*mVRXY-u9sVWwjz@zD<+t(#eyOSuqjH;@CS}td7%oPaNrfagr?2_<;Ik3 zy1u-sy`;|kN<)L$eOE>H?4H`;mB|AtL(#F&a9JQIgn2ng02@AphupPxx@YI753u-3 zf+s{)9IJNrtG#xu2yeE?fjfz0y{9(Fn@sOBx8<;ukH+RqvW)yEUR3=I*lSpYEuLuw8-Ihb9sDTJZ-IIKxqk$ z|48S;w1q3_2_ME!{_U-zQVsd@E`tdeDh+Pp5v>XZ@&Jw##di8UVQV-PUD;B|F+$DzPQb#htUY(_ODD%WBRpa$H}J@ z4=IJoHxEGq0H*Cdq=TCG>~C>`PgFt+%6Uzyb&3SfCn1W(g2TC-CpYp;s}t(56{*B6 zl*_CHdq?RR>i#9m4oRgG1( zrX=wPS5bI=xd9I(VsB|!<^76F=&+%aCAgeQE0#m7{Yb6`%ZfTt?pkP~ra zFNy5%?I4%f!QIPKJf=ad05)>~v&T)~iDxd;^h3liA{q(ixD&7n*XwX|EEj9x{%%Qdoh9GDe51Y^%Rco+{DfaTgbu(T2`S zaA2R$%J2XXV?9tLIvtwp)fRiQ3Ef@1)JR0@kkk;?xslpn6fN5&<*_zu^)liG#juQdMQHf`67S0#D z#uSFTyMBPg65cd78|RzmV~%uh#YpKeq>l&+A=G2yU9fgj6~^fgLeDC6Kr15-7=}wV zA01^bQO%CaS`BDFdN-rZWyZ2P-eoEqy{cGS&O`E^F99>urDzaX7xx)T2vdG?f;B6C zG8lUKWQor2Tb=WRcK`MHaWhakWDff&a{qZUhi%8NisvYJhoXK}j$3d5SU{)07+7Fd zUkemzP}qV@ItLgBqVl2rSGyZL`CC;&Q{l=Co=jo$aTKf@ery;M%+0cwJ2py#k~gSp zI8g9cJgRKo1M;Tr!GxrvXwCqp>gSq1km_<>lAaa#)E0T`Dyyl%*?%Z5X#jBSY*dXA zsM8tKkZn}#cgN}ggFF>u<9w7n5{PL+DW^UP5*H#+i}@WE?j5ZLls`YD!#C^Jt8LgI zrJ&)y@P+w`>CQt7t!WvItmMt-*mQxHt=*|;v;wnY__3bilnF@wNJN5SewwrV;Ed0^ zEdC%vT;f3az_jd>3u!G3i^*NhW6i)5~SZ$sXZtJ(*v^+B|R8PUEB+yqbr9i-B2QEf%xgXU}eK zZt7z$R9UGj2p6^wIa?^j<47_cE8PL`f-C#fg}MWM`2Q|l3}M@@U%hmnL2-QMC>fR^ zNJ}Hu6exJ;%l%{P^sL=I?jIfeNB6W)d{NAQ+djs(U**3&ZFO1)XDzCoTj2Qos8A@p z*#2r=buLx*>IF}N#`ZQG*j`j}VHb)xS;g#Ff?~ax9fJcx_1h|ysU>Bcdd=?1FQ@G{ zZ+is`3iQF6U z>J`ehhLwgkjh4ft7Q^;6h)7>kuF;-&bnx?8@1XgEN_#qqr}1Pt2`HHzn_rQW_4_EA zaqjTZJQ7s}X`S$nQ2SDZ6oL3E8qb2{I+~AAhc%3FgGCRmEw87itvBtn-svyxozK`E*B_QAO-6;W z{J5~=KRo;8xOeb#;kp0(sC88M%6|y|6<$D>)QOSxnt>5G^f!|{+46h$@zy);9=8fI z!S0K8#~)PhRksW4Qq^pf!{}<{=hx219$`N$H+*rYu_N>}g+6be{@F76gTW_m8#OmP_Ldcc51F~5wb=6>_F_7Ke+C_MOfuT4|=V1HNv);?)godE@d#cd^LRAx-X zK#^rVyP3xT?E;Q*@5NztoP_9y_-wd@okkL;4z8APtg`!OYi6XQrvNXSuT)G`N#zDd z(kJQPuy@&!{)BzW0^p_?%uGW`|K^^U{K2vcv1Ubr&&4x?kPaMR;R?HNmE3NA;Cn@@y|K6v4u8kFGl|$Qh0k-UbIJZH{_0 z9;3YwKaAm6KcC2b$FsaW;*iSeZ>E{ohH^+%Nrv}so0n{ePYK>fu%VFdZPlpXCdvEE zJewXo3Fp=r=^6teQbGYG@G4Ona{&umElaZM)Bf9vk&MkleX16~r_D2r+fSk`nC%vK|kr;6UDc}4TUTXoQ|isXQY zRhuUkC1vV}x-7ry01hv?6>)BLA5^-O(c3m;#9Fj}{DZv;Z*qmKswo5Oq1i*HXk?1cs+R;d1)L?y}@aBGR?%p8!UByUtC_S2lEh0#g$zUT&S@;fXd8!2f~US zXcac~KB?-9rOFxrimf!0$t;}5DU2T#92Ay!5-s9^E3CO^_>+Uf!@_m}jvn39Lpag& zj;ivldy+ZupPZe)@=j~rlcV#FcT9t4-9zu>+dVny{^T8dyC;Y3AH73w_XGpCdk5a` z35G}a4!iKMdkQCA@7d4r@LRvzZ##v?cIM$}q2Uka{P?KQ@JE9|QwxpfxqAR%Id^jC zn%RTY`p<&jjZQCv(M}5xnzv7>zG?%620^9`N zeK4*^8$cON79V4qfS>EIkI{TERMhOgzHHi+pkA-9mKX0n^7|Da;?>nxtvg*E_!}ljeL$bN#;3Qr@{HrDX;z#B*!^`i#;4(2ncK{x zflq|`h^xqNd7Xh`X@>~Rl8;!c4tTKdhpW4jT>OR4jb3#O4lf4hxZaneT@CSx9iW>;&sP=sJ>r$t|_w=1L``}$41 zl%~~rrBKjaA$!XynpVy$6ylb{Tjp*x59_-!;Y`#E+fwo% znJ3EyqRBaRW%(=_|G`uS3KQOR>N(6z&3!^$cIL9JBXm??lEKqRjy7d8H8_kC2|?gFT%^HCYK-f%@1)twtvVT@!vGhdfgNMR{Kr!l-#9z z{bR9A_T z!^zlyGfS*FMbQa$okk~D$&I-*R_dp7YLMbApSgI=h;XUbDW2z)j`H4vs-pnoDyIE*M1; zz*}S9^0gux9-+54b6U5KXkqM1N@4BPa>a{eX0dd>hC-HJ1D@_!?a0ZAWKkSh!8?v& zrELsB=~hw34 zZDD8*#~`TU)mI~3TbXQ({F;u|<30$E!IKXOqqXpitp;%1?)cS2TXSF2VuO_#IB8w( z9XXj9WjdTpqx*Z@JTxwrag)I} z>PoMYVf|EU6&RZ!ZP509AyzNmR$y^6S!Ir94Ift<6@P!!3JII09aR{=@T;aPs;2o> zGiI3wZ_e15QQ2rd8m&GGsj3fxI#ecDk3gpeu31&BYf3Z#2lR}=?%Qtn2MnO+9b)h? zT52~kPdn}7mUn(37<7Vpo_VfvYy@9Iee5Y$V2d2#%GnSywgs!SZ&uLj(zyTwol8|>Q6_>+LHjEpH_j&TpR&Nv|n7M z`E}rA4>=id>EnV!elT0Doi8Rl(DjTg-fFMt%UqBvNLa@<-?%h4zWzY3 zhQ{8a6c8mdLN{0+6#*z2`&10|MEY9fJQ&Z(zXjPtGmWxJ)Z@R!6{t&;SZFL&QEfip zFLdjHUnV%bVJQp7fH(sXon?rnn^Yx?r}!5gx^pU~$#Oo3bX9tk+16;2GXm#H+{q1l_TgFkzgq7oovTJKxqHOdNZA;dLS~vN*|=E8{Xr~|mf>7` z9XY-vANC$AEE#^3SpKM=ttT5h#MQU3^hq?Qu=SWJjFU87+y$3_>qRuIvcngq+XWfJ_}AxyFa!MTZcjM;0%5jtHDq0-rMeZFMtxK2gki% zg6`|!;P{u|2RQB{##=w1oVL!+g6?V1K04{NTZh%4ecbGvAGVL*1h1gxakm$A+DGjk zfbDguNdeYwLA}=iz-Y?bQb-QJ9eAR;9 zp`wZ#JN^ZiV&|ZJR1FRfjt<_ms9qP~oKivQ;ZJW{^axr!fd5EIhPXkus8jffxaoCI zd%E&Z?Xy-jI5=&eA!1&icG2t+&;xb41O{pzw-^p09eWNi^z1+(9LxDx%k<~4bpRs! zn=`C#PbEh4ddv^GS@YTVpY4SHug^d2Gj`)YTn_&5_z#V*zIy(R75@RsHFm!F=Ec9_ zKl~9NJN^SsKF5D}!m~bQiYt7=;A*Gq?glBAk*g6n99jk2^dj=fj8rAn~JUb>|fK%5u4C0I~-H ziWlha3Sw_G9Yoxhi^u_poBYKXPH;X{4t9Y+1UiXgu)%vUQ4C>V^?;-aJTU>1DZ)IO zM2!?2xyM&djLDpu9CLLF7Re~9azp{>K*(KFJs5-(*Kvwb9XXICyKEB@5x@1|D49nX zKcGs2CSprfp1`uf!K0XhP>S>tjeUzjnbC^>hL_NN=vWj2Mqs%7C7NAfOm_69NE7Z` zObEu*bpZ4_PGgi$sWv5(s9x+~30=Gat(nR@_SI3Jdj^dnP}5DTtx9It zQrgBsZh0A!6t@QGlvZf(gm-vyMqhcvI%dMb=rg=Glmb%1)q~fh(cw)Hq2c@!4@@N+ zps?#A@R=e4;Fz~a(IMtX8v^6(V6FyiLm~rX{R;^T?1cIK=`9@hwqLb-h3BM{G5aJ_ zT$!RyY&(&5s7?dxe6^-d!>RMCbI|+&tGw{4@ItXlzHT4GS?Rx8hgkY+yEMkozlew} z%vEMYs1lCjzlBPJq`_du4}<{B%wk>Cb$EPM(8Q!MP&EUqINXj#g~Uo9J<0H-_EJd` z8gRv`NMrLWy7d%Z>}t5lQY}hJ5M#by!R!<%M-awr_p^JtV=W8alznl&NCbm8z(Q^p z?Fq4JCfF}VjpjO{xaH3NIUgy*C>&18$qn*=GAw>%0m)6pFH*j&URMgbxZN1WnbrNX zdc+x#)NB>(Q3QY9&+EfKrhnY}sldLOY|uo?C7qBRr6;%i+4<>@?H><1g@#v0r_{)))a@K@ z7YaKCiN_UDj9la+qxnreknApjN=2CupiwA1FHkCS% z8=aRI=a5);xzS)gs7s^i<7HG%kUkSbpI<64&W=hYt09^N+lB3I*n?93Zv_W;#L!t* zFfwXacOiIbQATDVapR-v!e1Mv{{B9jt=WBml~#s_e=aX7Dpc5EGzu}1?2jzNBj0}0 z^e#=TyXQ zzEVypK@lawQ5gx!rL=fDk&!QeKE%@8H-wIX^osG&s>TiR{Zr zR|689&A8`iSQPkG-!y@Z-&++JRx}=EDmOc4BIvo5(RNh@%i_a^O}+yehkGQMNh&!t z{=)>1&PdKkX?PE2bO6-IFuK4)+yItdig_VoyfduZ*&XDxglRQsfts{RDst11^h$nO z4nA*gscag|^MGfVY#LMrnU$SW1JkVz_#}y&87bD9!bYIeoK6E!n#>o=X}q{|0yC0$ zfUQxWeVt1Kxa;33@70@f2N3n9Nu!q3$0}7uvyV7}0-PV?!yf0-aQdE;6N8e?C8GtY zJwm#kT9q6l(@`DSpG>E%p66u0aB9N-DbfMZq9A>N{no|$|aPFEyN>15S-g!@r! z;4DS~+sd!=|2H?I-u>TV^2g_Yd-39{MkfCIPUBzqe}BZszW>9?=lj22cp0#HU;4nC zzs1D9`J-PCx%nem4^2tXOLG?mox5ZyhfKbln-9eV4Mp*2x}1p2kG2_?bJ!b-DgsrJ zF4>AI3{}w%wuu$VQnGi{XCD{-e%$)W{`saUUyizmE&1AM9m}`Ye{y;z%67ZZDC0P| zBYY?!`pCQuDjXahO4YOTR|@iZ$Fw2ePP#wIx5M_2@~v&YViYU&wR@_*{j9&9z3u34 z>e>16kt%rH?Wv*YFKTej?s4-#Jw;1&^|jMIQ)P||sQWO+fYCT&5nAlS2)AgV2Zhg! zo8u8|wTzmEvTi~g)dWXEZuQ_m-cQAV4e#hsK|(jM+`?!aQZl?SC}RYP3f~c%8(bY$ z0_6FKuk7f4Pp(cWPjos%+pQ^0S|}4ITJ`cPIJ|tLuIZ>TCFhU$D!de@I%9LG?#S&Z zQDBv{Q2y`oe{V0*z`jhxLb-k|6@L#73HEW9EzqV3k`i}_68M#0MFYH7Gmoh+!92VX z`ij!31jG0hW%r9|bpu}Z0T2#^Eyo@nM z;5ddZGaxq7pIu5mMz3lwX~d{gYAnC|t{hcJe3fEjNh1sZ0bBsbaysKJCTMQ_YxK^R zV5Q+PH(XF1c~c%&peEL~71AnzVwt^VdOD(F+W!^xw1Dt;BCQ@Cwwh%pu!Az`cWRNh zUblD9At#!5d*Tftf`nb4Y63S?mGfN&R1WRLO`GGsGzbDpVF`xA16OecsWe@^GxDc{ zcP5n0J>V|xas*JXV;>va%XBSQ*6Q_RIMU`Cy=O||U2-<>l-tjd|6q2Hhk;jmCsY6V zihgr%=23cIhaS>=Bh&nj%B;1rBa8XnMLfL^F}a}cnN!Ib9@zx8x)U5S!0*S}PLq-G z20d5(%;JX5S<~z41N#bX$D3fx@lHpWusH_E+R{8V za6XN1gY+(4L=!RL3`K+=jz@!OH3tG#`zf9dlbe*?KJcbt$>7K&fUe~jq-z!>4fh9* zlWeE`$~m~s=J4)T@`u^U#xVW3mwybg=siQxjdGGXDai<&^(0*0Qr)6kOrB}mAatvG zb98V@*`h*DfQ469mzaz(U}qA#oQoHHk8!b#$3wB5LGBiwKCR`kK(y05X5#l9iP_Yq%y@tNCC z+eCALwufkCI~|T0@q}rhRKoMnZVyq88X@34*#lb>*5z5S9~Arat!T%_ZolfkK4^Ce zMI4Tu=MO_w&XdbwJg3Mf`crn2P!mhT{4C*^6DUQ0UB=hpIAW905*2<@DS63)&;VyJ zpp!agieJt!nRu!)+(_0S==^oWrUZJ)Nl5mzl9L4n|BNc!Ju5gWv9H=NLTlJ)y6}RD zaiQguqF5@nU4kzq3#BX)0i-?`M3yUIoZxFkCu1TYO${by2f?5;3l~?Vde9yPr8J5z z#}}n4mnGE>&M2)dxsyjiP$1ZsnAYy8B-FEB?~zp!n$@C831gsDb>2NvB+SN3+&Qp1 zy_T#rirmO?y6zA335}Hcw$rl7zQ5!8f7B=-90x?%QmhpQ zE<(OtXLAtT`vY1uBjD?GhLU+sKy?~A%-t4Gm$z_sTTZ)Y@Fy8#dV^}vK5hS84PMWq z=+zmzJw6GJqXm8q4%$BlU)AB1_4efa=b+JGfdZ4$UjWQIkY@mmBvi1ZG8%{1$sFYl zjD``W~U712}S$l#vAOvu@BN&zaz)dj|LnQ;ZavDtC|I zCYitIF_&=;OZ`6PmYSkpY`;&d>TM~lX(}7)P*uq){Zn+LjXD{Q(Y{dH=5DMjb%h5 z`S{=iZ1jdi=5gM`4*b_4uKVHf+3v1^JHxG7@exrs{Ndpm?b8f9C&<$P+KrAqo6F?k??W7 zHCOn~YQUz|1NQbCNifV-6D4{UlIW7`HX1BRUM{5sHY2*2-gt^vqI_Bi7t7J;*Q0}< z`zHszw{+XFr(Qi7U*Pw{pSq`qoQ4q=2mVP$Wvo_tCO@!r#VQKL-b9NdIwrja)_V-1 z&OsR$NtN2Gs-%u|^@;f?a42;Wi6poREV3yX@1aQ}ed7+muksj~609#cZ_UdLuk_n* zrHZ~@(krpUk#H%Z;c}`{%3_0V=Ze&OWY~n50EZ53lz!VTaUTKC+&h^!x~|1W6+At& z)O~6E5)O-Hi7RA#e%vP$X>2yks ztoW9E3=$lCG5l>>lz#9&`hYzcg+E~<3l(#N)Fw8@z!lLLS{akjL4dNd_zw3XilKW7XGiJVqlpqm;CjoF4~Q_D|lylnNwA zClX$yu-DsKk;Bf>*_%Rf=;(Q4v6qO5;|})%vc5wr98&uNX{Q)cn`DOK!vtO-Wm;Yi z9h0%hBQ7^-2wy@=>sAmi5XEDxz`BGRo2HQ9euvfJ;6(KliTzW%`DxV8l93|*M~qp^ z1dCS(a4v-Td5mDS4D*?-e@1zz|Kq_ao!dz{Yo5&6kc_odBELn`>v*0_Q5r@NiqD+)-6r&V4 z9bnm!l{ict5xxvXb|+EPMi|fnCm~O6CNX_A+o0Z4QkPBcd+nNlo{y?G94$m{cOT-_ zO(sSo2ISb!m3+QPzerKokzNq?e{7weoxgtF{<-1DIJtETn8a|A>jv$+!uihFy--GD=) z>n>9vjBJ4{hmN8$W|JwB`#%;fk2#2R`mac!=7lSdP{u~fEbQ%<7gAWyz;}V*q#}Lf zi#5DdRJTuZvsl{OD{1@->~J_#LEpc;U}RJkz@TO$2TGz2FjF1rmg+un@Xo#buw@su z8ZwiOaGlBKv8g_M$LM@YSgQp)IipMwKes_R!dt`@gIwFod|ap=JPmfLf@`Z6HI4Sn zNRhtSuCpxDg)f~8EyYJui!IllR|C!E1UWO1JmKv3tA73tD2KXY@!A}Q3_mRfpcWr5 z;BpC3slU$NKkGIu?+M-NE!TrV=(YSI}Udp6qGsO?H#Vayqz z7vGGJdA#LWVdQDgV~lbMYb+V$?^wv^J5Rn`rMz`mzvS$VGkthdXv^XYXB!)qPpwAB zkiRY?zI4r0`kdQEwUVw1mBMkF&~+}X7Rv65hS+$Kn{$6lD2AngDRl0imZ~)+=J5ES zNy(&OC9cdTdQ(D0)3>D%fAv`0DhG#px+Iw*YkR7^W|0-M_J>TqZ6G-~UAOG)nU_Nn z&u_nfIj~(0a3-z7=&?5*r$Na*l9kM@dwhXl^>nF20Gv!Ig9Xk8nVJ$YhjzUS$s7i9Qm1GaVm2W+&*YQ9H}j-tzyKOmIkVUf_4+m+JE_Blaji=W=HQboGTQ39e#(QR|rOz0<**zx_7Jw z%nB?sNV}8B>L^(_8Jk&%5hXgD%(%LB;~s1?hr}M00>Y@SW?!S*ck%kZJ=Fuki(5Ux zY)z(~Ojv`u@=~5ma1AZo&+~Hi0?Y`3A>);n+SWV?lczUpKVzh7s;@+OUU?Mh%r+3w z@(nkp)h?>BD)kD%z>KT4N18^heN<$zzYj%hxyxx^P|NEoyiLtISXc0+%f*&;iX%9CK65~01?CNOO=w>%(V0HPv|rX9q!VG$ozaTZr5*;aA#}0Q3f^Eh zDB{?QQd>sw+!+rxTXnn2rY&T_?p#NGvaY){NAtOPWb!M2s*c+xKis=$DU@Bk&X}E} z_;RP+X~8p~lo8oLsJGRiI4@dS30O^R{}_)gjl?L!xnyN!m8|4I~&TYblAdmGymwefLb+sla8k1!SD|N8S)2Cc0eIL)Xrh-r2GuF4@{WVjQrv>1CA$z9z_Q2yv2!^d; zGi6ZYKT4Lkl()5DW6p{tm+fhd!y?g1VK#&5pffdbcBMgNc@-Au zXS_l&+>gsgXoR2HQlM}z#~_6ZBRT`YisENtsWe1pZ0I+jR#JDGz8EUKKD{;+D# zLJ5he|1ozgXTSQS+V+Oy?}B+Z0Ank?BIa8wqnY4LvpRDK_SZ^|S+a8ln`;kQlDnMx z7imccuMb6}D%uUp1i4FsITtf$piHxo_)Cw-KhFq99mD;5b^H94Ie}NS5{jMh+SM=~pndIz`M`6VSXL+&N8-DAB=t&X=FF-&hOQ@R`*gf|0B>Pp!p zjh1jaNNQ#w4}R{V)Q6Y$YY5S&3M3tKSk2|H{zUQoM)N+}s@%sSEm6i_ZEF=Z)`qB7 zuc4+Ql2fs2J2Dz}r7LE*mQ4?46HsxYja9Bx&;+S+Nq0yMrMhAWP%^J~f2i1$V;x&u z&n}{IO%kY?R#OUpNs2??9-dVN&eOHi9e=6LXLI&o(Utd*>52kf1H1}#dK!!{8~j}R z1=H`Ldkki6;UM-H#Yg;lQ3%6yeB{h)DYohSgxJ+Co?}tbiIR=22+Hib02ZVAyrgr=4(t1O1Xv$4~h;MY-c1Vj9e$8x=2aZxxtlC3&18iWRLM-gG)#)A__IsF< z)QJ2!Rz!~U(mQVJi`%Sbc*RT*IA!crmx2C@bMdZdDPPrdro-9!Z_AiAyMy5(o4CgNkr_)IbtgPg+3IiSx!qF-yhRoKX)$dEyozk zw{?>vT~Pxss#RxwK9hOld0u~XvwCSxaHP$$6u^$o4zQtAc5>Ab1(=@C@^;riJ=s=S z)R0L|9FRTEUJyThS}`;3XriGl=qw&y)KwV`p{6h|)}Yp9zlTZ7YUeq~l`c&iqUQS^ z-Rd4j^%1itHKqY4jdT!?ikj5E@~`bE9b-&(whkd=6pMSAGx^+Q`uYlvTe1eUqi0gh zpumj0mAcWqMz@Q3sMt!z>Xwc6?8&0Igwb^6jD7GoH+AiwJGH*$rF7~d0U=9;>G)`> z`{46PQEbX3`J?PZX|!0lc*Q-Zbtv|OYU9N7C9%XEBPVUJg)uB^2lMOgDDt(M{*}#) z4Y$p41F0y{Ene{Xa)nKX@Xf64n%)Iyrj3D9op`Ra24VmAk{9N9==hc>?5 zpkA-<+2!>Q6Q%~5W`FLz{BbC@WDS14oT{?Qn#&f*)-^9kC$*V9TBMiHnB!oCVw+g- z!VNb8CJ;v;N;jj(eZ!|L<9FBVIBOQFH=aD{ZD*D6W^q?^9z%B;Y;qGbGz$BS#+6~} z5U0#TGP_f9qvdMO*MNe`Y^{wkL=D^5M=J>5rV*rl8LPDHN#wR3)-A{yD~H@3Bg%$* z_dp!&qZz@10{ebkVWIT+N$=u(I zA}|-(yIVl1Go`@{&D&SU0x&NKEKr{7y2_EruT`s@!^wjLgk{8$f@o6wMusoi_k36UCBNlDARgbQB;Bx z16^K6GcY6AenIEb-0*yeCxf_|fKZ6}kw-bE&ZKxoxks{W=_E0Djg3}$u4jsyjEu8R`1VBH z5i~nqP1~$8jus&NX>BsA4kkNN#@@o5T`U+v zxB8dIjs&O-kQ}wSu($@(>CIB*DUWLF*J11R!Fi`gaO_%+2GFh7%v2<)2amVF1V=H( z@uN(F#*8>e&0=o*@$_AEol)H<6aW?~A^k%C7M6hO?Tt+?Lf=?YN1tn}bKEAH#{ssM7ZJ>QE1m#7WU4o3mN> zq=m%_u&fg0ZsD!U9Qia`FxRX-XCc9A{%1#`{@3T9@fo}E-zU-Jk%Pbg+kNrh8((cd z|JslL-hkKtivRuxeC+t|H2EC-y{&_(0{=PU?8ryq6qv?*!-QZexH)IG zt3##xW2O(Ii{+&kGJTkM4=xAZ101XSaxTajlT5+;Vp<~E#Z=~Ky z45Z~y`!+A;I&EWufAud3t49%0OZ2Lw;+kWgaV}e$IxoiqkeJxNem$AuNHMqr- z2|g98`wMvY9(I6|Whlzwhsm1d1oK@Fmg8_fzN@;x_*A$}@KjnYjBruqFzWH(3VY?o z%*J-hd>abXK`~+L`CVn`(A%`4WI7P&aeUlk5dSHLV2QK%qC+1@QWT`&wp6L>fXn3K z5|8lEF$kxqmRBbWK^K8Dok)yRs?(nf>dak5%`$b!Lf{1(deQlV`gKc}P5k|?w5~%2 zq6){)Fva>>%_%1-$i(Z#0}U1v7-X)bg7exbzObMk(PfpIs3vK3no2Y$^tniD4eCTxCDu!6}?Nt!j%Q(k!EmM|c^cqcX+LpxDQfC6$w|scg;FAi5ny zGf7Qg;bn<#B&J+FpylB-RP?Ch-ux%h~hT9x`ZCx?bh;>C;iyKVG5%?+l!mk2*v6=Pjo~dwZ>iyd+KoD`#+9>p*MqV` zfjx56Hl@L%+hxVXo(&B@3+MCjjsqefp~G&HGMRjO`*w)8BUrDK<%GE{sk*q`;gZ6t z&Y)S`m`tp2yd@`VG+uL>151D=g43w-y4_)ySo;1Ia)YrXq2xwrx09qQX!sTryWwJxo zoVa)#O;Y~;WJZ!gzD|H_V37E&3gdVZdv@G6SK-2rLjYS6wWf`+IGivyrM)`|CYk{T z-*Kp6%g-g5s_R|J77DD6_)WaZQXEGhiI zf$te9H~{2gN$MivDWe&MxLGX5-u?9(OfGH=0Tu}gBh$O!3rsFX{Q-ve#jsMW28hb4 zv>~>bj68ZIx&uN5r8iOu1PEcsYVDw3o{~cAc`G#~-Z{i+_@X;a$R|-}+ofP7D&a0AoI$dg z&r?c#vc@VFy1HV(N?l1&oK!x-70NlZc<%wkmB$Ti7V z_j9W!YZ#Q~QlysdPpdA=TE&#q-aa16j9HUgev+Bqid6@|Wa~)lnL5s@xKT?$nxzsO zlCe~&s^*#Aq$AS$-U=Fe%phyfOag6iUxANZ#Fr~BJUpJq6lY62^ln$5Wq@U~3fWLS zM%xxr)dWNhBcoeSH};8{yW|Ob7z^D}(#j;26GkbS&%(cDnH%L>MJC9rgejUIzSaW? z`%QBgT`YpyKELr+vr6mZosX&_`Dn!}MgH3w-jQOGj#2&dC>4u2%5W~E{! z!mh*WswKEaJ#i1}aS!t3XLEo?SP%Ze4NjeY9SuXczByTY(>y(j?)2)o)WNJ&i zR*(ib!NW@mu)`B>wV}zOv$_o>L%N_VmVAU7A0m#dXSA79SX&e{o44r_FWOSBSW}*Q zh{`nXEqy3remqrERa5+6#fEQhlh$6aIcaPz(PWqKN^(-$Q{L9}iPKLJ1za{5IY#S8 z%7(VG3DPF{_>uu~Ur|O_gqP+tZ)P_C_>OXEDJA0oE1naTUA@S1aA>a{)?h+6xN{a& zuR)$(E-M#IKG+q@Mbk@BUBjJ07=<_4j|z zUwqSO`1gM=c6R=C|My3H?E62Ne7*sE!?py(2RFR(i$|1%gyHnB%pIV5kaLlTrt)4juxdC+(_+6^?I2@puu96V`{JeyEJ+0zR%!VV7s+LCV2!;4sgr z+r)qdO;AdrKfn`2shLbB$@DE@y`(j^V>rj}%H>!oL}|UW>+}VsD|GjbIOecekI`07 zSC=Jt0%g5gYilf$i)b|cn^%P`{8{s-Y}AITiQ8zH=^5#oFuMocK2SX~M`cdRwiwfK zi*S}s$Uu@DDez7}BA3kpgY#?D+a~j2T2VKJuLVJucnAn3ADzBbs`BB*odMS9ap4W9fs1C@$70C_Gvnrj0Q4x|wIwJ(;KL!NR z740Re9f!+E^noQho|9*hwg+VkfzlF<@pshIQdO?{(RGHFlHlzkTHHi(>nS&3+$+&t z1jQAYEmG_VELsnaVDeBa3}=yWK9A9C83%>7q<6^@gZdio$`7OsVvgO;;kN1?X-j~l za8<(dMm>0&+(ZOgqSn(5rcS@%s8tE{3alx#_g3-(R@yF8GGLGtx;U}0sEH7yiwGod z-D7WMoc7wU2W`4lpmb0av2+nnU_yv$5Vc4$^`LwLTh$crvVmYMP>e|Q{+ix#uvax< z!T{72thLBEdv7vYL>3Fem?Ur#cR(|1yhG+oU^sUM4YpoEQGxI1hcWu}VrER;c+74e zTy|GhfI`%6rXk5a!od#^cY6|%L=A2{Mi>Fjl=MRan3oJl0Bk^$zXi>iW@?9P81Qxb z&Qa5*4uTR+C5Kx?vFDf;iJ2i;!6FVWQI9X}sW|F-d%(R4_gk3Ii#y(@Q#32Uw>Xst z-sVP%!cdbn!KN*Sw=RZIC(7haU(6inb^&-RSw2kdJ(FjcV!oh+L6b|PM;9QNy5L}X zXO96Ph_A9OhxmdAUFEy7koDdI!m!I6QSc@a!vnftj&5h;ko+dFt(%G#O0Y@^dEzDS zeHMnRqA9uw`)p=7B%Ud55Bb&+6pycytzGmfKG3i(iy z#F+A=`}Ob`e9y9?k7I$e87e*$19=sU5e zq=i)tzK`yR+dl(#u(Ag>`?O}8I3OUkNYgoAj-w(jk6pIW>UGbXZ(D~uHbFVOcY;y+ z;gE61I42;)t;%ANBU103o@PDCY_YV^adhPdjs%AauMeBI$tK2=t;~HwkmN6?ymv4! zpKwDV2rt*6nSZ*mBQWTAO64v%M7SDbgHt8cf-YKslMQ*qoPv%IG%{_~prBgaBqYEw zg|_CA!31osm}dPBFVRa2zT4&tXU%bhe^l7)%&~SXO`DWY1g2f`zXR*!y#SXjilT7* z;b`eMzz`c>2N!t7NX2xJD|6vEk3bwxF{5-my%t5GwvKA53=R0>3Qn7BLE^&n0HQo7G)LzO21YZW*wHg8`8d%QRkS}F@cp5rZwy@I?UVHS;BoF!%*h;RHb=ee9FZN#<6BV)l5}S~{tq(TL zJ?lo^c-pbrE+mSsn>}qg#h0aJNrVjL;8t>J6_2Z^$WvGNEC=c0gPh_fQ&F1J-j3HG zmW_wE9vnCjSYX7^d6af|~D~SnUaIn!dTvVf9T@I5?vBq}Pf_ z%ZP$!3=LT+dj;#WVr0flDGunos?LUX4h&a`jP!Z7c;6nLMq`5DMfux|poaVq2fh__DZ6oH_1a8IB&b% zA6kb5==q9XkUt&~Os4iPC(VOShiZRCwPi;$XC7~3%RuNIw7LEZ)A|h_L(v~YJaqE< z{7bvl;ckCT73qF~`Y4sGrR5^7eN5H9p=uhxMXpwKf=*;QdwRf?|3sBbgSfm9owL(ckE(xL@wT3H#m)*ao(Uy3wrh@|reyt6LN;fzS5E zc{HHdhP;f5Rjv8vm>^dY^No%nRK%A#lG;U7qaYwd3q{Dp6EWLMt4aZYP;j&4D-_@^ z13Y1{uw(q$SRxW(rQhcOBa(oX>460gKD?kcs943;15`esjU%Zra8{yevb?K`nAYGIPafQzZW&B!uY4}j^@}-5v3Y_P^G4qqUFskVS!2E`GuXree z^*$?O3|g*5c5v{c8mO3E2%dCVqgd`E^e~=0V?gGU?b&|LvoC}HE`Jkz_nqD6iVteD z&p!h0y9Z3pJEVS#oOKgAGLfUcNZ}3kwNU;nug|$tqNleCr5s~rsvxeOjD4m2?fVS#2 z>QWGW`+*{X|5mUoh}-K*#im8BrYe1@`(fNfODZ!c8hn&sd0nB>7f&;m-kNo+)I+i@ z$ry4tCU|0g-alYpYcW{#gmH9IFkWb4HBFnh^1t5GG=s=o-p1n?6N6HuF}wg(fK`N% zJ^+CiaO%CdTVzEndKhS<0__Ypgma77*I97*3B%x;ro3`QMbFM?n$ok2JJ)Ab1^p0U zQM!m>*N{UpG8uWGwAZLg6FU`!3|P9zlx#q_2eNiZg)p(!N(s*M=#6Scb4Dk6g&+GQ z58q{Mc#029pdzuY;2OOjNy5QUW1MAt&pe#QW0HSlKon=s3d^SjFb?4yiFgdV=rF-M z&>=mfCb0)9_Y({gk*#KlZZr0*=jb!5vB(a@s4^G4WsxtHP>aHK@EfU9nwk-KW!WiL zwUErxTr+d8zwmkz;~n~PY>pv#n@IKz_$K$}IUi8?msNo9&8C20ATt+)$|?q} zOAl6A=39Dlx<6fMb#FtNg<2t`oTTWHzD1SV7vn?pi{GZ)!9(QZ8@)1y1mdMYNi)>LF59lFI4kNi%+**MPHg)!XnX3s{(Mlj|Y zI|_zn&b1bjbrmJv2#cHLEcMon$W(kwsV|L}W)rj{Z_dK0+UD<%u33$t)HY;4#~}1%A)fkb!t_%%2t_g&N7pd+G8-?*vAUubiMo)0j=V*^ zouWpg)>kV1oLexYg`N%_U*UT;OqK}`cD0MFsr|y+tVWM{&LfzOnBiCc#Tn1g=9_q z2~t8(oF!y;D%KMz4x_&=$sYCBdcFRR4HsiRLNja;Jj^*?Hzo!_+Vs&hN};3Bf;5^> z;)R5Ufhu_KAjf*YA2SiPFop<2oESr0_G>`&MrQ<`b$QwaA=TydNYR`$q6YH^lx+Lo+KuO`Qo4hG{re{a6Bo}6Ili(r<^ zqZU`nLzC=a>^?Aa1@`3JyI3^x4bVsfXr%EK6Ul)#zebA_XG+oEgHlJ|3DGUk@5b0; zN9dcu-ZH4_1Oes(|CF2eb!xaZmp!{BQ=$l?P>Z50sPBZm*kxGV}X#bzf)Rp0*AS zvxMMx2bLPq@oGvq`SBo&cc^AX4xH%7g__DyTb?*{uIOHwX^MXwiM)$NNz#$xy0p#b zSkD~-+oc1Q4cNU$foD4~pz^gdm}?%)%gpkS!QlJLfpwX%bZjh1Ih;}Fy0Fw3{;$y7TOAuYB?L}j`hq`buYInirB(aJx_Z3 zSHr1oq-+8a-7Y{-ZnnJuF{|6#uqa0l+OROq-#|&~_m_{SgXZR?)d_7)#yZONL;(j9 z6b9A+V$pLADB9m001`#N)kiPHMgDxLY?w<7QnjV;R6o-H*Y*EC3g1Vl?0-xT<9p*j zf3v;);@=uyJ^%Wf#@9P9@O|U?i|yzC^8fxLKA#6_&RIEv(!LzMwmv7P?|S{&Fc~~U zQk+EftHp%x56~1I_(Q03s1E>>cpak*v9xtrS_dk{J)`;d;P_1|=)G+PXRTfjxb0c+ zs@3WK6!f~m*?GGc{L(!?4O+)PwokjqN3G-Ds<@E|@Rwvc$LM$qw4ta|S5G9K1Q(4{F_=p!O3URcb%6 zHCye_GJbf`e;)jw^4TwET)qN7j((BvTb)AzLM7xE7g0a9Fuw-0GM-2w%n-sQ@Y~kb z!RdYg^f(_Zw@wd^;o&~sbB*JRtfrvC?gxFPw@1HpU;W1!A@mG|P1w@-U^tR=;XoNG89JPZYhAP}8!iWU`$=9m6sfp* zr0^$G-8w!Dx~~Hi70q1NYQb?gIBvBLal(Zf4vv56y@l6`65h7Yf=>Im73is^S(Uj9 z!uU40NP*h^^ew54@cX3%W{N?ahEx9XmjA6G$&PU+1{owtZ}INz@`kQhZi6(z3!Rkq z+5W+P0Wgdq3BoOmPTudrgK!qtlVFUaq`!E`!Y>?eJRvs#{C7E-;a}7&;NMI7cO2c~ zAB-}N>Cjjv!EZB!m*UqM1xLki9Cv}f;2{gY(FvKp5P;=WHFHhBF-Spzw8TAK-a_~B zIVu(8D_Xh8*WrbHiPe)yxVVz9oac(ZrSb*3A>XhY{B5}y{YgQAgDbTD>fj6!1;ooJ zLo%iwF+C$$u^7|uK_7vgP&Re?3bpZ9Q{D{t2frKO%Y#mbL31Mn8f(iJC|jX2y?uFe zpo;W#kscR0Fh!6yd*K`thsgB?Zou^|kk`WHc(Drwk=CFbtpDA@|0z=w@H0_Ay7*50 zK!6JLuIcL*zCML+{JZ;%moq+B)p}IT9vH%eqRnO{s3i=+Vk2Hj#`l@(Mbp4*ZVs@S z4-vIHyIY0&GmX{S_0|@-H|)}2j<7J}Cos4fMl%pcpv1p(oA9qRRy#Th#!u>lt*vNq zm0$_{8x)x@3*w9VF>+`EVLj5!RbZM|7UNZ;vtAO%m64gp$Y^Pz%p=8c^;}u6j_C1` z^+>qz|0&a#3MM58ns~;U#-vkP2&M6MG$U_SwOzr61Ss1lhvluSXgo6rIZV)>`#o=F zue+y5rGWK7>NlHh8n4@3)1@E~Oxgp*jWKTn*V-dztA=3^qtzXHgTGKB_`hnT|Cgrs z=-`J|#eTST(Eb_OGtmdXCBmo#Fqy^M@t_#U6c%ZdrEL{9i2h0U3~HL+hn?<8>$n)G z9jsUz56ArTPyx7@FJOnhfO8z65c&+;K(<}8GZr7x+E3$ZtpzY)i`fun^H1LvX_Q*1 zfVz4HN+td637l`CuyG)|T!yf{FJOwk{;GCCCU%SH5>-uNzh8GNqp%k65jauXGbvW_ za5l#~Vmt%uglBGL((zk;whq*IEQ!+vT4I!}es5vO&R1uL!Ev;}Kj@W;e`V+05IwM+ zpW7%$?E`J`wf3`RI)5gfW6z>tyvR%h$V&Vi@jDnGee!m{D{XFV!M?v?Pukrx0MIcq z!ft^@1&o5q!ot>;|KuT~%z#g|-|+nlOoaDVa_)aoa1 zyT`v&>RbGUqbR9;Bf#A#!0n%%83PfHf`slMaC;AsJMeDj9uJ_YJF+rN?UO`(i>2XR zC5RZI0KOe*0b#&WGe`(pG~S?!6vbLBsc%q+3J!1thj1L}_JYG!r`2l#2$K1C1Nw`= zB{2~PIV0jorX&1@1>g^bJ5TYOik*k@(YfJD zp8yyR9|Eql_|J9Zj__3$_b$w^K3{=$TgI#l0*r+N#6BvSKg~oNYsl*k}>y?EU z9GpR&iyn1Cy3%uN<4mEMF^g~*iyrn2>KI}AFtlq9Mh_l09{_jNQP8Q+k8%L1VQ#5Y z*seN{J+yr}ckU`|{9g3wPg>4=5Z?32*h~RWi8m2=X5JMK`hUXmGJ`=thQ4wL$6s@N z0N<4Z|JvT04(1OauiL7*Em0)wO4rvmlwB4pmRK&LGWgjd<;5=j_#@lR!T*+M8Foe8 zu(mt0L~KSE>*XGQ)MDoyOLnBSEKV(aGiZe!L`4=sYjDE2kag!QwjBIu70#|v=R9@I!|{`tDsm zc5YbrlW5CYz{!m4sHqt(e5i|tUH$O)rt=ld0RdUvQnwGg<|g8ysJ>=ux&HmBWtGgi z;&gXSRsRA*g-6&^y4~4j*lYW0IwS4h%L?((TNZO?b@5yISD63*|9)Ki4Fgv;+ypZ)Y+i>v%JD;5O9bc+A zWk;%{!3ws8r(1qQDR|&p1$s+=YcHj>eMtgiKbBN++Z7LP7Q#Xe_fzVDbH3fW3W(ex17dJ_Cir>8P`$|`#W4m&#Jz;IKsgjK;~gPQsTCvy&h zi@D{^WAh%XSZnz2_FCe#&!9QD^Kxn&18if;*&Y?mI8pF~ z1+rC#nU{8O+r<#7;4|e;@ac(9_jN8uSjO%kU%P|U`F~8>p)|1b4RE~Zp*Fr4-(hxu zIYo9-4qA9YN^T8N{jy$V8;nxzup}vV)5>n3<5Hvl6)-RK(Z|dSa}y1XJn`;=k{u7Y zMAjq2)XHt4T;ModuhnhxcDqWJzp-RR{4EBo4(5+)8FJuqUsw zXN3aRG1~zna44Us5v%a?XHhsGaP+O>zyEuYQjo@ywLn8f^I;2x^+zK=6FK_tj{uM8 z`Rp!TL=%^scP$sQa2U=wXaZYORA?$OM0LWrw9*MFBeklr^G16%kX$ID6i#|fu`8N? z`u4GqB4`1u{QJK~6Ocl3lh(BNoqCVq66Ga%#A4V}VQF@stqFd0rwk~n?46_m zP%p}e{)%z)Q}0ZNyb$14GZjp{sh;!TofFSh)n*O3*GIqS=D`wvc1$tw0aZ{x@TT6@r_z+ zch4TyoD+GGS6I8>K6}2?KJHP}d5+993Q8c6a*)b$hz|K7MtXa`LjnIBCvY1AoVL#4 z4q51wb;bDjF#y#9J@H;5SpIF ztj=IHOqRfHN*Dq^Qrs5~@6UH!16wLf{V&lmjYE?29tRVqO|>iR?_I+17o}$gI!CEi zeWfMLLdj${Mt5Q!JGrJy%Czv#WCXE!A%PAEenq960?{v0IVTjl2HS`M|s$KeQ@4^-uc7M>#UUZyKnQ({_~wz?cSN}YblXF&2}D*$uqrD z-0m@?!nOk*wmJ-A^s04wCX%!mdSXMAS&rghp$TZZkWfb9br_FT=*2CuGiS897z06B z?W$JVuTmd#NqqfP$>*)Xg$7dj`#fRkZ8%iW!nY?2XLa-{@otVBJSihFf|ZFgg| zFo+xK-#G#@c6-fgSN(Q2L5^A+$p#2-FXBrTq&J76a2*t^HOKwtAZW<`Z{n2YOqqcD zKrk`#(6ThCi&{$!bwp!9fsG>EaxFZpA(GV;;uGnL?%vl=wQvYG1-oa28ez?>GhEx8 ztjP^pl!AiF0;}UbD2e=kk1%o)F0LN;#K|2-RGl33-uBO0C!B7GPVe(@z-e(XTuwB@ zI5Ws(q6zMT9IGmXBjVz!?f^MDIQ>CENhLrGCDWsvxAb&*kuKuJlB3UYcohUjxq1Y= zhS~bL)$AX(Pq{h8q_A0vF&aVXfr*aGk?N6{OT?&HnUT!zGCWof*!mRrirF$W9;?jv zZW-M_yUb@rhjkMiAwz{4WkOFQ@%T9UT_*1p&+gdHJ6aHHej3oG4HAE|<1IxQ;&U=a zgB@JqFmWpg>3~h)I;Kk7t#FI=ui|Kq>XSP>E87Qcj&p=w;S5wa3y*m#Spk-N=5c`^ z0n@a!e+0JH?jFPJ{73gRDAtRC^R#{3J$3dWISYFmLR+7_t0a&{w}WvgvG*wnbGh_c zsiFeVtspwqlwhQ^k)$*gyr>6;C|P5wA~mU7iFtx?O)?bP!Lb%U`|Y>!GW_i~m+G48 zo%{Ig?WuZEumAQN`Ov8P8h=3%t7TOPHbGUg>p+nj-G{0E6~C_o^u1ybm?yveM%KCf zTorC+3O835=3(gK_M=SsB8*cNr0=FgQOgCHu{Ku^)?HX$|A*tTKPW^r5Opq^b1R^c zE2f>|SKNPeh%&w9tquCt^v^r!<#AxofnLxM_sTMS`4=Lp9SD zQv9tbA(VWK@_;H^c`Vme|53pLaiFYJuiifM@%XrM+M|kTMbe*-)DEq=O32WsNTGto6{b%yS-t>;lxk8r55m!uAicIOA*#N-Auf;T53eX1HOu;{ zh|mKaRyk;``y~W}Dj5YzspLip2D`-(naiJ`%$-(}s_k-$buS}Kqg}~865C~sP?D2f z=d@J`{_zjzAqFAPRqW-1bJOo*Oh`mmd5G5QNRk!3qu86u`kL`X)l_FDi7}y6VtHD+i}RWs(o4IxRU&2jxkIW;k2tK_nM}IvT0Z3eEXK#?Fx3liXZCkF?mar@Wd~2R%Or{kDgr)26U~h0=5Rv>pRpe z9_i*43j}OX#jAKYjHYzaii$pR!1&l%B`*9$#J4RkXC}8brFeGxd5;u$vw^a!(}?@fM=#P!(RIR zH^=AAexKBBW&QI>V|zPz8puyNAYmE2liB7wLe8~hz_dEAp+q5%)$sBu^!pmE{eHPj zk!4{MS=^P26k-*QbHz%fA~c@EHnJdf(G1sc$|3~=`yEsYW--IhOrh6w(>R%Nl8*nm zQUrRaIZ1$`+ak%l$jQE^Eff#n7*fkFy|f#-i1L`(uSo4!&~1;E;# zPALs=#}w35+oq5~qtVGyG^&j9)g52X$YH;0ANQIEXT7u4qc=0mL0P9UMkFF*4kiK7 zl#8O6OinRFwhH#o=BA58|0d<~GVE|fPN-eAexgpf8bpghy<(wG`XG2qlhsH=yV!+? zC_2q-hARsrTR8}$42CYMqRDdX#MUlh&cYJqj^L~ld~1vN!dHt@Mu%eq*RA#(fl?5F z`vj&zpU2lRU2WPcj!uJOl%wpbgfwATd?l*vdVo;VXnYMNhRJ|Z?gm%M4XiIynO7NI zMr#`w9tPHC!tNrCV9u7R>`L}TZ8%4qhw(moMjArz#b{dYpjkNDMEB?64L@MJaHnu` z@t4gDM}J+0V=OzoZQwsUQil*ckKj!iUsdSOPNj;o);($cr(=uW$2E#Vstf3TIH+I9 z+sytqT|2N11TO#NrpDBx$0Lu z|99Bz+Wqr`Cf|uEk=d!eO6D-XHhrDTqVm z+ltB-nsQMidj_T3k_dAM8k4ec2^FjV;x1svKC!3c1RQ(@c-`qeJABo7)`5TYEdURu z|N8W((>hjTg0*l7_25tdn<%yclXx?asn6=h*{gq~uMjx-?5a9Q@jUDuSh6a7cdD?$ zG4;ixk@13CXENhtG2DVOn3rUzrEv*GgVKml!@-F-?T8#q41zIVIt4DGj?!;7*~7MV z|DgFDiO6mB52V9*!m+w($ETjE8B|w+y%k4&wk<(pI8I%Zpoc-2igl|ao=Qi73<`y^ z8h)9cRp6n=oeVC^X*K;@b;^P0$Nh8$I9!a%Wi&N`7v5}D<*29Wxl*2T3ITVP7Kz%z zGgBof5@Q_R>gOuyv`A#?IhqlZ1t8}APJ?Y+-3&$4hzLbCq&YDJPLmK)SK17M6W*!< z%s1myAs0<--rre?a>?`tL<@{O%sU(gpc0Hr=F>1(+$1#)T1X3a9kX`Y%fNw*`@(@=kB^x&K$6ss4t`dZ9eW*End-;~ZH!Q#fr%kZ#uAch5e&;$ zcU%pzIv&>)VBJFr+u&zZ7;$Xsl zine@e>1b`U`{T3ro8#7@5)pK+H^t?WQDE_lx-D%fTjGxswQ``U-y6t0cnAmn@=VDw z8DmxrYOVN_sb*~lQfm_4#*^hlCDBS&_1)TqR83%=8`V7c*`J10jjD25Ad&%i65G_A z?rov%5k(;n#Yp$XyeTXWi`jKXHmg=)cS%@7+C*@&dSOXU@YIM+Vt;MZEoa(N2V@{n zSn-ooY3GDoF|90W=jn6}NJR;W^NNXhqcak#Ws~YePP~dt(TwUsO=Y2=*PPYC2kyt( zLRgrlwhX47STghFOdQcS6>g#wQmNx zsA5}eTwS6=1D@O^8H%wtE(PT@5@WZL_8>0FmE$6e$7#ipJJ#MTdt!{OlU^yv{4R>N zN7b_(QrKizxUtG`j!O&=ldO7gDoj1TCQNUVC`m+rU1ARGi0vIp>6BlwP9{}9U~MSJ z&hh~UTu501jkiE@6vph;Q!PMYw%--TLdqS$l77{uOcK>Wz0&In@ zNFqd8$?HOi;&HQ1fUfGvfdr5ZEc_a8`BAr!+z^CVX*@#b4)`8CyY2B|qL6dK$itOn z&GglNPBKjtxY?& zjbzS@db6kqz06tHnTS=N=V?&-A}l>CeQ{8#n3*OJ*%`K{*Xr7;=_T`FcZNTHdad@# zo$3Xz43UjxbzpWsgH|q)r%ZII06NK}J`%T(WCq_PNhV(sliJqYgesdEU@q}cjJ=VE z*ce-=d#j-I_WVt&|KmaDHRo^S6NV99Q1>SnRMwpz-;QY)Le-smP%dF_aL++tavduX zBvfZm)y!e>Y1xXYm%iyT+$#_3Xp~h}FI3-M4<|h$MCFpBUMO`q3LYAH6qH|IkYS@s z6(hr1nJbh9bScYMG!+3nO%&|lN#>f(S^QbMM&u);RI zYzk0Z(M`OrR=3n~x~0>|5)CQ5VMioYb&2Z&6UY%na>wHG(#-2JEjN0E+f2DqdnqI1 z{p;85cNwN>qHO?A2QD847}JyPMPphBRUGJ$^eB?>+|5p}?6oNbX)p>0$n#>t2!)}M z2ITUEVzHdGv&_tjghATKE?S`W+Q)gwFZKJF@)6c8=ERK#ygcx7mVKFrQ9eTB{y2Ug zjqiLraN8iwSva~E4&oIUzC!c+QZC~S>t`7LjV~pfn#-xFyT0mnB_mP#P2a8qep|`d zsBdn*i^r1m3e7m@0R`MuzVjvC|8e?k)@^mm?WI-3?w#LV)5ZU}2cixzgk=ak;YZxN z7LRE0ma%y|?lyny9q*hy(?8C3j+N~XS3USWftlM3!?z)G5L zTg@K=zW0STmBE~q8;q@F=`FiEph=P&c_-v!)p*8My~N8dk(0A;#7eJm)qcg=7{fFL z0iQNTdvS)dnEFv3SEEXS3zZ{7`Tt|-{z%zvp{0lptVLWL`M#2nQg$FL^NyKT^$U@R zDQE~`myRKl1&%y<07~Ws8-F1z*ksTzHxXCU%I_7usf|+0S?>U-iKDu)FEAQ?i~J}N z5(n>dy`9(&Jq%C`i^y@3z@TYBobq=P_U9Mz0_`*D=AI5zsG689=QA|Rj%DG2s7#?s za0wwTFEL+PfGiW>P>9=*Ex*%QH~_TMEq{V{SkW9Kb>P;kRx%}XOrzy6sl`BS1Ldz( zRs!xQmZbKR@V3lhEGy5Rvt>L!Leb;dj@eW@RuBUBVnm^^P-t+V#H<&UQ|JX3$%yeF z?VTQ+og6gXFfM8~;3yy71e0iju45oKhiGt-3}VV=k0)d{?l2)O>C_CI0VJ3Z2FzCc z8%`r<3-$zW(?QsXu|zT|bLh=V#TiNa@T~n`EwZh5uf=FAbaW)g=yWiTXSOkC3i8Z= zmJZtxsVJYZ@F)1fY5)~~Co>WfmhK%1cd+oa6V0R3e|7%)HJ$*V?{bu)OB-OV5}B0x zPqLx-woCkavJ;ac6yPo65o5zfa}gx3a^vgZNnj!JNyYrO4uLLqiIxsJ?Kj7oOh$1u z9x}VCGFzcOl6U@cN&+oMCt>NA=OP@(ms7gtRTCoi#S6SpBiR*C;8U&a@W`3F5SV@j z(>-;=zuc3Utm&R@Z4|_Na$oYu)|LeB)1mDvi*;nXc&6|oK53(R9bbhx5ykBrvZ`z2-4vjINLW3f#?!{|@CE zUv2N~{44(JAMvr{znauV6aco%KXt6H>v+DvP+a1Pj79E`0;>f#0p52Ucj(yUM1fby zE+`PZd90IYaI}q}dwSS94Z0_^va|<~1cV+h`xr4AdvVfFW)rOW>+$(fzkAZ`9=6Wj z1^dC@5ek2fj)HD4X!n9%5F7-!prS$no^zW4M|oy22~Fyb9T>Q?HW}4?1%QrgBt0b zo23|8pv=?tf0<_5Jq;eBAo!Vdy+-b?#eYrtrbxeaqJ^eBW}kx^ez$^TJ2x zod*=|KA;;X-JdoueAxbR^TO>1m40<_{D5A+>YhHJ@Xrq^efIWr^BF&T+j$UqJcK$P zLL3jFjfarNLnz}xgz+G{cnDcMh$vs|)job$>Gp$4|FCJV&ySBb zM;&I<-k3i>pe)*sZd$h4J#HSX2JK^`+3BtkW&F~;SIxC$)Bn&#|Kn)I*4fB{ZT;uQ zMLR2omREGexNvru4}jZiovp^NPia^f#1g-JLqX0^ z=0PXJEmjup9ke@n6?DJ-uAhQ{db)a<LKLM0MJ6Gy^4Nv8bH=_ewtaN4Y$03|Kq{w!Reco-N`S0KaNa? zNEIthV5*{jwszuQpWpkF$^Z1Ysz3Uy*Z+O>&Cb_5r2qToMPvKxZPfqmeDlq}@<09| zA2GQ|{!AeDUIZiIZaYu4T?&%^<%Dj1Ui6$w*zB91B6BIv2dDwP21+mqAziAK_@+o(?a}3fG)|W{X|&)O3-GoIJ)Qi~#8Ohv0AK6!oj#eoVR4QdHeb#b(eSe(BUHxt+8PjM01L+y5Dsr( zn=O|o$OWyw^IhKKg$b(y23&LfUyph9z`chkYuJekIS<6L4@9ZXK+ zmP`w9I?=oZhh$xgat9@4nVJEzNmw@tLeR7dVn#TAMaq>Gd313014*p^&_6*6w|;fn z$1Uq;vwMErBZ60CSB|T}S^G`@@HLPu&Pj}cIQT{uo|EfiIGaTnvyOdZ89(%qm~4HSc_ z;FzH2WnKB##yfPLD@7%=xyw8rmnvj`n-9J8MOsoRpTsBmw<$Ddx`yqMvBhd2n1^%# z-HZRGlcfX*I0sTL0C-*`^y~&-q`|Ke9_?N5D_buFze3m2ckcikmORil<0>ypIFEMa zWf0WJXlMbQn4>$< zJkoJsOB3{sA=?)w6MkaXyxga{8`QkC>RoHTiROCB5#2J`FhyIcC=fq}=!mA*F)V8` zN6_ImP4S;pak9Qsu^0mzVof)W%UW6Ls#!4Qg09zK<(@UG7woEHv_cTBJ>Vu9^y%1}M7GPcq+-r=e?SaU^xrh8GINo@Z3va@ zPh>!1nuxQYtbfSP3|$a7l#CeQ>DobZ@t0^oI3sry?rs$=8PUxE{zziXOG+BLU^5-c z<~OILoG=!VKT0;2k2y#UdRcl~Ey+DJLW5iWjV8;;&AUJFo4}t8&Sc$RB-~5fNNWv3 zcVK35(BtBPM|l7E8k+sndzNUSG7SOU8m&oW2OF8f?|DRAmxB{RCo!ZSfdvtyuNx|o z$vTUJ5luYD@3A5PDrgFs=zk&jSB~7hv)*a@_zgR35S77943~o_&2~zoxv^)8t9TFg zj96Py5Ev9;bjFdvQnBpdfhZX^7K#{ADc+kJoX~?KLb7436WTv0xorXaM05cw314=I zunZxQ2r&#o6CGR^=P|fLm0z?@?Q(|D(6Vbj5+f*bubbiAl~gV@7Q|*KzM%!V!I+ZQ zlrKfICbFTBAUQeb(5%03hiIoY&Re)s*qG%Ta91O@snx>2F2XdDiMosy3tV><*d?$s zLIZ=!DK=ay76RMMhMrX3T=!g zH8h!TqEU1r2OMNdM4{VNwzB4QaadVI)pvSTs#H)c!6GN&Xl}YY5^K&XR7NL*JNDFL z;Zup66%Gs^%#t)F0aXmH$=I7uFlLzL3y#U=HLqYyqs!2S!5+aQ=O}1ZtE!-L*7>cJ zvY-Wnzu@e5X!Y%a$SKaELsgFoOV%2gWRGycF4S;_U?{?jeo?2)>a`(3 zIW!(D$E1h};@~@K5WYQqs^lBR^UO|0q!quj#Flw@1B*PS&2|Td20fOcSz8nyQkjR* zb_h_4?zvRhI2$dx zA(k;64FX}LL*cwu3scNsR_uP0AgSgK)^b<0+bA^iEWj^YY}d*m4>)vDj&l#43O( zKL>z|1ih1{ch>f~P}^V8W!ep5+WY8&fh^l*$d`&C!zg1-F-F>|#jdO+N%2-oSknv> zW3jBSB!!jRUhaCgINL~whBlV%cYB%$=Yz?tJmU3VtQF}Pw~gmOc|{d!jd%FARuq3? zLV^NGmn$smqE;s>+`8O)MPKEPE&1onn&JgHt8&Uw@s7?rz0+1t z@0a(j6iWDxivhJ}n3+NcZzL%Ivx|{44-#kUq_+j>kcqd@K%;_-P-{oMLUEz6gC%OQ z|K_?-_=?_KX8;!pf1)>$|E5(aG`^-+E&H~lHxE%Z&lihX0eRbdkv z#q*SfM83m8!CTZ=fJr*k>gslM6{}*cfvtO&99mIGLj1O0!jXN&ZOdug7U?}MI7r6h zXs}>Lm=Q*wP{+&)rDAd|M?6w323efA#ytHFcQkZ{;iz_`D#m1xoqEBEU@TpWb=Rrb z054nA^27_XE%Iipc6>+2D!_P10I1er5mgq`wpv^^`xIeT4NHl>1fThvMU{R7@t!-z z_?=*=R4bXG0_E`vvxciXh4@wsDo-)3I0ukC9N=^_jd!Y(gb&(CtaZ#y5b;7+cBx>g zRx8;ZuzS73y#|R!Vwv17=AnrjqGS{V;S53#Lvs}#i&{&5k8IrG5o9kH9ZvV5Ppbc= z_4wl@P()HFB3(Ka7+9;c`%&Zn#6i=d`o}&qLNn$IIG??DNBh%1r-L~?iLIX4{f`+| z8MXxsjfEleYS$>=!Nb=FolfuVY4`liTOae+|9s3}uf=?{V!U!#STnS-5a>lhxd1jm z$-feK-Lh--)a=WvSKhuFzvgNn9AN^aDcxl#2p%S4b)s0nachdPo_M?TN|~nAX$dc6 zEpD~X+{)2E=VN)Aa65WPnD~)3*>Yo@#s7zVluO9z-Fs#)(~m6$6aUw&WLx*o+6Eoj zmD!4YeMcAQQL5()Z>lMnn$clHzmoB_ktmcjQB?^mVYRBVlrD)wMyPb_Ds%d&ovDF> z6_5ln4`UL0L@dc%Of9F`qf3r5X=)v3a*hV-WME0Ig693e>?KB%Bf&bd^da{M626W0 zn`r3oPPXBIv$E`^@^`ZioD+dmp#d@%&|QSBVrTE+YfOPr>&t=q^lALgG;58WODQqO z6w$(aSz(au8{CycpYOGL2PJoc2Pc&MvaR2(6mu%>8V!oBY4srg8q$_-a+cZ$XD;mh zg%sI*r%ngie^2n@R~ZLcx9ux-3bhXP-O-BkA;yH6#*6zd7e)Fj?iX{+>--}l0o=!c zXVLV!OjVy+7m@s0ORCh}9QbIfCnDSmc$&k8V@je(idMs3KIFD12;m7*rYgFeT2%io zq@%TY>JW;Bo;F+?7hTBE6&4f4p3T}GDHP5rtn*q67;}wG9fD4R7HOxglTPI^qu}P* zbRM1f8O-Tfp-_Ao6mwqe;2V0i%F>g9I-i_-VAaz?;YDM|4;IHE8i(<;AE*7r;toRq z6LYuIkLughcuF^Tc&A%}!X=Ik#1;!xUF9Y!SqIcH=2JEHJ>$DdHn^zYi#7R)jRmM( zM%mylr!m0sA~iXn%auZ$hWKS$XZTnZtJ@9DiP6?!ti41C9I*Mj%6vQt|<;qyLr%y_@XFbeHj`>c`07Sc&m6<)DTAVC>H`g zR~;cB7kAEh@@Y@Ky@&2jTL*_|>X=J<3dS?tltU)^wG73lQJiO0rrfDmp>yYB-M>Dv z!F{s#b^}M6n$-)AvZ`vA%NLb>{d!iZ=q=x+Cz%ldz=$vq!r`zloi5Wmx2Bp2Y}&4d z&!O#n3STpF3?IZW)(%nUk22+_oK z7+AD?QFYj6mDiKO8{Yv$3nnsuUHW+ZyIjV1_T&pb-h&-=H4ZaXF0lN=*6^t@ZIK%| zHltwE>C`M?iS%S!2nQXECT*55U*LhjJ&ng?`=%3j>g3RD-s9Y7RI$bPQ8bh5`fxh9 zO6JkfJ^|RG4q&t|eag8Nr85v=R9}o{t}=8PkW7oRX%<1)RNr@s#z5-0-EqW{vR&Ei zxlr5MfJIJ{NT+)6*5#S9LK@$}1}Q>JiBk)4!W7J#BVwjw@u;-)i)3tD)KzWi+`HJ= zaW6KKd3+g9RW?18ULw@^y-*fZ(m_&UI@D6`!{PIg)!sHnBoeSLIr`U8j} z-$lvjrIAw*C~Rydbefc`Jd@uzP&7SiRPHmjWD^=PRlA!m!dvO6Y&Ka_OEIGKO)dG3 zQgrAM=03mXZmR6Vxr6l&s8*o|U)HxyPtSfi?qTF)md!a3Uof7emwOo+u&oX~BKUG_ z>?euzvFyuzg>>tx2wyy<1_0Iax~gW4FP6-?)iuSGhvt}*bNCSz1QL6_UUzNfPI&QB zx~>#$O)Q~+a~9IQkqS)chhNNGX|j3Hy{v$c$Myif+I;(+xo*DzymATl!r@8q&swwj zM9xOSha8?#Q8xuRD#vWh+L(e1Gzy+9^a0H-tS{|cT#~&Giq&P|e&oFYtQux!#x}m> z*D@vT9N0<;U{ zVkN_p9e~!Vf{7aI+hS|`4K8dmnudMi?7{JPk?3%yG)m_JAMMek;&=G=jT59_wcLEu)uIt$TY)Z$FP_5k<~K_?PU6mfc6S%2b$bG|g^!4lP=1 zlQz6a8SkQ`eM2_sZ1Sn*?;fgRlA_(ukdan%#S5DbJ~NxVWrKhh2%o8qh>Ywi?$)_6 zMOaK^F*P9=sEj>%M)qM^K;$(^*~gV- zdYRl5?%xr`GU<2EFrY-e~p$I80Y; z4LaQ}3m};BQZS5}=5CVtd(G`M9L*H8-47{be0#2$66WZR-ICj^_9p%zNF{2LY6ahR!W_1JnN%IHCN5&)c3AX z(>O(8OEFDsOL#t?!wF_I{N7q&zMY(8;iI_Pwz(X`A+sxjQnZeTu4!N9wORTN`!wPB zK8P`~ML3G(<+yd_NdaPhB=}c&FMpA4;Qr%&a-DH@LN`1Dc6 zYkAr@`ZEN6b49k@h9@Ylq*wy_iv3*^K)xAlt{vZY){bwLXeJA%tkf5z zA<41yb1df#H{>mH903|V&fs{ZIGD81y(h|!51)R6W9!w9FtGJSGNcq>D?*b5WhY($ zM#7#ac&kE5cZN}=uC_?NL${rC`7SZ#Z58Tg4#pH&dj$=W7lpCKg|#D@E6s|xF4nQ6 z{FKsoY#)Z~mbhbNcQQ8EGi@M6Sk`uBzNP=ta)prl_i;SIM#Nfy*x~oec41dsFz{H& zG5~hTu_LphH4tYM?!^bv)<`1?c>AN&%pCJ zt4r(n$D-@4narXov|>z$@qxJ&G9BQPrsH6wd~mAbNu=nD=U!aUEE{>vA1?nt_TIj$ zjU(9~zyIP_F=0F0;)s_Lpw^`)7wwhwpA`FVIOeFsm3=+(C6h{NQscJ@8!5R=es zH+HzD=w^=iBD3aCi85}gn-<97TMGbF6R>FD5GptK75PCFaCpXAiybeuEVM7!w#JPk zZOM*Upb-p!Gy7a7UVV8~S-v!QIrtwVe~d~9ya zLQinPm(3`Ap+lMH*E634fhQC3H(I^HIyY2H;92K<3Fr7)beU}v!AcHCQ4SbU7-hq@ zPd^Ba$1dc((3r;Yylky)XdR2~x`ZcW>z(DZ(=(1?BWySKYUjt@>iw+O2{F>GNOXaMHuHi&fk`w(Y9U#5B`AkD8E2_sFHw6j z$_wF+MN`Td@$w{OUcaRoJ9@Xhy>oPAxD|f_KmLJ9`Fa0F0sdn)n2jeZXP>o>`S_2k zYhOM3M#X>m>c3Xk9(}X+NBo!H<Kbe;%~PfeY3jqRYzphoeV9n z$MMhkba|W_wqBuC0p}G#Seh>W%F+|`hlC)oasNz5!g^!4`{Q=eS!fsL;9G9V1qoZ3 zncT~R^c1|1DZF{LkAfN5rlJHb5<(Ea+4}E;!_Ly$*AHsG?e3dzonRnd9vr^eGGhUz zE(nRo&T08@nD$eWXdr?*8_?mhfga*g*&sEeEUiAI!f-t=-|cTld)wx8m`xKjEqm9a zL`ukB0-%|{?H(*ef78C|OJbFZ^AA}n_0`petQOQ$R|}Q?)|}J15sXQ}_5yt$p)NCH~jrul}I_zsH}Z z|90}}0Qhg%CdaXmDN*R(84Fl~l3$DmX)ysZ?cRXM=$_E{-;p1e0fITh->KQ2(Gt8h z?R;uGSat{Y88N^qz4-gT_KJ0o=82`vU9UQ8M zAN3Q&CsGf4Uh{P8bmMf}bklUpyoP!0(#`T(rQ4w!=&FMlH2%}B|L8jQZvTxdeE;Cs z&5-)Nx8sVV2r%vuBD~nAYLt2Ri@u}eruffWeNh= zI6hAz(DMW!On`Vvsf(b709=4pE{tYkr%o>>=VTsQE~OnYz_=k{*3rfFmMg@tpc(p7r}W8VD3lk9hwivuxIUvh3OiRSCBRk z>(juTjFO9FO_}*ONKy!@S3u}1h{3@}QOIX%;z{6+gnQ)_oyQ9L! zgf@F1j+EixPvc91qrUy3th{zD2&~OU z1Q3iB@Yt+(Zr3RAslMe}Si8kM~j>t~>DT~K8WE25@l#lNCu{_96I4Su8>Tr@T~bW%q z#?Om21425Dz6a${X*)!(qHeW;%A`ipfGBU|mS;G*X-8Y0khMQ>+(nyW+psfz!NbS! zY*Eb$V#kEjczS|y#i}c*Mkc1;hBGMM<0a}M*k3N9M>Cp?!%r@leVEMSEW`IjnP5`0 zW+o5_l7GYN@oXf?(}In6;j=fSU4MSa%J$<%*id$lG;lz|3L~F44iZW9Qs($!-1O`C?qU(Oy@I_H_Dda* z`twcg=JoNU<^wMjzgu_elVR8{5ZyiKSbeV~b){>nib|Rr`e#?R-;2s%|BHv&>?gkg zXuW61$X!Mg?f&NHd8G3QL=c~5!c*8;kT!H}$+Fz5!??d4ECURUdxyp|*}QGrB@1W+ z=Hz*Nm;Pd#yV8=bE#L38h4%eC>qRwo{(7;}(|pFEU30|VMwkZX>eE4 zL)4xysf0UjitHkVOYFb$Hq0zyHGew8=<}@FHzfA`7?k%?)}ng}tGI@8pdB?H`|BIN z-fFJId{11PHJ2Hu(*oSbX<710laIdqULQ(Ft%;^fjo z!K;0&pV~?Vb`7??@bHpXE|AH%8iLy+h= z?QqZ4O0kMo2z!QatR!Ls7BofCgAjq<7rajec?ALzk}AfFif4C6de`ky zyPRzcg`k%#CAb;$Jh18)a-&z*sy!zv3)x>U0h&p#vI>0K1HU1__25d~$MjfBRq?FS zxC4}n!Wr@IZ<%*3cLNaIvUt7bI@uplMc78yX47y(*!+Q$dcR=0KbzRXme)zGiNl!S z-MG)!G7bm=a1!fIibv)Wc^9 zEKR9_`vKq>Hiz&qAcITLb**znr{8EYniX|yOl z>N#pMtg8&XFo7?`8K(IALKSZcdUpjSa`Z0L z`6wDD`^R}C;=27DNam3B6&!MA#1U>uhaCPyq>FnB=>nAK(+dc}I?4ei1>rM2!wE!q zJ~}<I2-qZqor=);fHE~34!ab(mQbisC8qW3US_kYAqba|Gh&D>Um}7S z#QrW6CKV4P_*z$HNAzj6pj1A_E_SZRZ3>7wxfje#8~Ac{3B?}8OtxnObxG$~M|a9u z^rCeQS(GJ3si<+`3jmdK449nik*6SNya10Hf0DO3SpX~t_f+!@xFYJV7_wAMK`eO= z?qQg;1Smz0D7z~b9(CI@y!4jHEfqEYG?|RzK8}lCwQ|%$yfC*W{NjC|x;Cs{p%X@g5 zVxT*X$JIL6RnY2b!X~7nz{oD$$d;wfjerS|HX)}UN8t+klm;$t5-66!1#6I#!CUco z_h4T!6HZvJS(7X`*Q~_=008QTGJJAGCwKF(+~!FAbigM9c~X0TU@w{k@4;FibPv`w zp&Y<{HUDHbD$hoUfjCA7VLVN~lZkBMb!(2wmvHks@Vn(E6-Zqy=TGIb{8?7Qd~owz z4JWEFTEdHFWuFiTx;~y5KD&X}oRoXZ*;X6K7U2dq8jAH?Cwxo^pxR=aJRoaX@Gzdv zlF&HNn-z~o_U%fYg`(!@D}aB2Rg`ZK6|3ebML{E^Vqmizz=P7*I2_?G1T9pc>;pld zvKWXcL3jXK&yv0^1rVv_Flh?o#|_ka1oTBOG0|~q7qAEqtz+w_VE84AfuWMiq zmXel@55O98Fo|?*C<S=j3w4d=>8pznyoF=PUD3lz^c=#KS?&&zTiIL^#tkA) zL@n4!EfG5hxnOfb3CJre;3hUaM2!xarE{&g=0G$kbLm8KkxZ`%mMYa?++)*zDgh0y zTB0*+qh*$T3jxuu;(j@zFc{8g-RzoiL13MT{)*^mRp4#ayj$yMDc+ePNtUwmDQO9* z!lvPOe+Ac2YuSpsW*+F9utelN!0c{&7>|mi6J}Go5K*e!K{+sjI}->y;Auu1$)+ql z9E%DK6^PRYo2{DRZUESwr+cdbrt*e~NSQ{c^3^G8N}GZ~4I*UNn*fi_?M0IsgZ1k1 zx7yWlLn7flSii)vIA|T1WGBw$(CeHdy|Vtw^!!0TlEk8ReHY zTdN2ej)s+&)vUI4{NLSH+j;}rB`4@zP5DCk&@!U6w|>OWV#dSd6b+zzFcfUJW3v6q zOwM9gvx6VI_{ld8k|h3HPD=cyB%vq%go{DG-~)fqcCzwazvE=2=a&TZ#Giz#mXGqR zKI>2X8m_<=)pZ!Z_Nvjf;H26Q@E{)$Fj_vq1AhQxd3g`N`L&o=$|retpGQfiKAI=@ z$&8HpWS-oo!uwR%Ps9VtCwj7&`m0(#8(LvMncw{S${Wxt zH==Mlz?lF_(nL-XvfSF=db7i}UQ~#{A1&&)BoX5?xT)U*7@;=@FM3;VcV+7VqG}H< z|7&)hAg+$m6N*&U)X%t?N2~{g$)MV(``4gr{LQXF17cnf!Hm3Hum-| zc$oRy zO-m!<^VqOl)A-sDK|%$D9|${s#)$~v{g^UfI2gFgVb^s;^M?p4lXzMdPbjdrDGr}e zu8yfJc*cVE^K3awPAMoes}4-D*W|ejd~n}nO9$vwPSEq`2|*!a;5#TCLmWVX5m-4G zffu|k@Vw2E%BzvK9#AXOV>Y9fR<09w1o#i0`3Cx#^RHk6FVWWY{uO z|E!?k@UNjmcx@IN$sDoL`)4r(SB;8(T!JJ*M-qxE&!=XbT3|6gO>z9Oj4i?g1~WJF znqt711{8@*4K_Y5F+?S}#M5}g>ntxhgbPdr7GquF+v!TOf<0+T@T->lO6c+?6HWqII$5-iiHm=!RwEuQXo6<;FCM6Ui z+h_fMZTBSHrB@!U?{N|Xi~)w004UF*3uV||MlHIOYgKv&?OZT(|E7nlV!ypMi=IBU z9q&fR-(w(G)wkET8*6MhrM2xqRYK!XW8#Ij?Qb}!uWuSuM$_Y50Px4FBO|GMc6>gUbCO!pH z!`7F6vmm$0wB9beS!ZFPeVT#2v+3t(oDbSq3q~HfM)X0{AfXk&I+M1d(nx3yw$U{aniqWuF>G85jTrHd zHEO4q-B1#f#r)TFQuP^v(o8$c&xmc%8AN4MLac0^V-glU!4N7_my((q;rsO&5Q&M` zp22K9zJ~Ui@xE^#dYwRp0gJ(jOc_p+*24Ce#0AuB^5M;#D9JE4Bn} zihwj!nnX%It)#@MU80?9K~@OAbgA^QRni({l^I?Y_23LTT7TD0?M>DU!EW$u!gaU1 ze+1B%Fh>X`XVFz$*Qdi2426=*59A?c>Jhn9SHb&Hl9H6oClkrpuS4gjb;# zTWM><%l^+<3!O{ASPfq+&srTR#B*RDdPd~!HP$8 zMaos{nT%$UrVT0VCij@7eg%#+)RUCxTT|YX=%2HW+zbnXuQd)Ot9lfhD7=V=F{Y%i zOibsaHVIS2R6$M~H_HlGxbizyY6?|I1;^i4iK=&aEtzwRU47Z1w1iWzj8EI}rQ%%r z{r)?%B9wD!cyXVSA`>zPj#*6QfrQEsf2y>aHR2Fk9A|}eDYAAef|JA1#F8r10{1NtKlxL?{W6{(Z#BzR8Ez0q3 z)~C;90;uQtdDbd<_I6*rK7Mz!a|j_BT>r=#7W`NzH*`%nMC-3w8M^J4{`_yhv^Ev6 z1a4dYaJ~oPtL+1ny`v>?z&`EYw%A-1OI9GGUXf-Powd6Cz!Wh<)PrynQrc`l8;m!j zsUAu{O-jgQp4vce^i>7l`5BUHz8Y3_p!M|r#)sD4rw%D&6%TppmHfRpo0`o+2YzZ8o$H9F&$b=vAhK$5 z7%psDTC6GP1Oev_L?tNJTChY}w+2`HQEOmM_58dAf^deq#JJxFRU*7+m7_nbsS8-| zMqwq|GMux@GbI$tcv|0tE{TxXBNVs?=HxJ)T8Y{RVDTftCJ_*YRIVsm5^I#WnpQfX z3{I@N5GvyJB2L53uiSuQ! z(PU9C7-u9yQ(9;+q(vjyfeSlbfK?{OY%U6vfl6MMIx{E)&@&C}DL|NObzxnYc`)s4 zk*NkpRg1|O2Nk}!aW0Y-;*+Pz>1-5F0j!Ta0lS3#ZxYQs_B{imDzj!LlO)5#Iwn~N zCo^b=>DO2Vai&Q!|3YW-J@Re_mMDTs>86^%c)uRGqh@Ta&wG&)9S%(c4p00m0W1qtGTFEw&1{U`W|2NZcVCD ziA_Q|+J|zzD;@+9zQbk|G1T2II}7c!fVRjph<9m$oGs`kpHVrTj`AvVLQ(bd2*eZq1QcIZOC*fE7EF%J;hKd4HPSL7eNaPR>ta8;gTJrTp5^z(U4~xTZU8- zrg2Ugj8w?ef`A;Y@WZ2jKzwNU@$8vp%_|?)n?5{l`tWD-0rU;+ccT4)@*j7iXVD`D zK2Y5Qg^;`1T>F}oevQrix~}j?t5|q_mPca7H>cW1>$X}Jw)r0^kzjj0jRP+~a?=A_ zVe{kRdi2!I6ufm0PsQI$Eev>5vH$j1>iP|ce5#sj@}UPEu3Wix-JW(w1vx+tkhjdP zHIoDRfhz)wbxb8D;LD}j{c|0G%-76=BFxCij0iF?;9JU_wzyRTF7bxzigO3@*-ea22B|>qO|m* zO%iQa8WIGrKE=b)`u)UU^WYqKJWy!VzF&b@k2o_9ix;Yc4}hT{teup9-(KT5r`=&b z%La}O%mCdxy9yNmRV^Rs>d*z`91#xiA5^3pIboVlz*K{nK(n<+bXy~eK6MIX1Ohy; zyV0tPVW216+jf|hD%VKj(Ybb@kjs*DbdsAzPwj0txpcK?p}jY}wS4#xdUZK1=(+fj z%7h1fWb%h?@Z9}2{)6Ldhufac?;IbA`aibC5Cc>~HeC}9G1IetvH z3nz&osAyPEQ()m>Pyz(ek%ZyZ#;Gu5X`p7pdAhiLsCS@UjSYYPG&@&w?|mwI`m!Xy zZqnfTf(V)0JGd0`@dbv(WD=b|DuusQ>#42Ox`0E!DpjSjh`3R51whMzakcCOgzG3( z@bA2*-PDI%mQS~UI63;pgvoaiQ_ezZVYWAHZcqrz-ZvBTsyCfw&g)!Y!FXqq94mf* z@UlV`Qn^aNs{=zeLAobWWk$x{(64q>A=JGzQ)X~d9L8-hFYOXVtr}{;!7~iqP-r;w zEGdG~G?M`c_2xgZ&!|}5xQhR!7vxcSzKeaYSz9r)wYBH9zY0N1E2|%o$+}Uoet}D; z%gaQTq8UeP(qTnnI#@862=zlp*eR#iyo429rE_4b#Dk+_jblbi<{{PkvrU^KNME1N70?^#r=(0E&)7r7UkszwE+EJIrpf z@rKuBOP*@`iRYqSXDL{G+@iDYfLB?i^-BM|r{^x4KN5UG-!KS1H3Ee(LhHzS_r2Kg zUST**5*&kuh3gJCGbm^#V&yqBF@pR!L%0~1pJfPrf@2RuUTUkEPUkbA%~*gK5No03 zzX4^&mi5s2n>sNP&|bzOa7e&cpMg;Fe#;P&f(~h9dl8nGk}pQ=>Iq5AN^Xg~tDHPV zDW58hoo_ovrvV0KL3QT(|E8waNfx(Y0YYA@$u0BJwA+?W7N^QuS66~%p(C{_z%>lh zixwMoj;FckL)=(cJBo1JK!16RhGFbGj*5=*GB0y*B3^AtTL>yEpF{w7%r<`T2>cx- zZ#mllPyF)eBdYLO};pK$O$bp7;8X8eK+eeXL}P20%~xRL9`z?n?bR9D%J)hFyO z+=m-dyB$4!1e9JaAe&zT_|f2Wg!I}gL|SP}s;ulVI|6=~(I-SCTmx`xFogLJEU#e~ z;Bs@y8ymH1waWvDp_7CSbF+_L?`8(fZ+`iZU@A$Vc<{jHU)qe;MR^;eq(EEA@guH~ zhwDP5gQnVHV=Eg)vfU8r8TZDiT|)1({Ia8j7MLFP8isobTf=OEEDjgY(mSVmv??@J z(WkU+gUl#`fa}8GMRbM9IQO9REX&#~zSyb2c{S}h==BpbX8Gy5k%B%z1TNC@AyF;JRMuzE zJm7;yA!r**5GvR}&7T;-2e2S4y%sB?8oFqw7QNd1ySZWn?jS&5-9=46o5_YRr7NvQ zfyX4D6?D#4Z@Zf&3mMbXDoHENOD1Te(>kI>NXe@bducqjt|xrRRr7F+IyXmfM37)7 zSZ&aD9JQJnh5z+6P2!CoOLj+MkXhy8F(xDpwIe^HQ>H)Vhy%Bof6ZnQD{pv4`U2lI zb@6rHeK!!;FBeYAPnV8S$fM!5dT>LMlsJhz6DDL1l>+gAePV=>*r@+LLL|^h^V(@t zIN(4ne}@ZjmU)Cl&50Jx5r!jb8@9sqANYzcE{6}2)yWAsEy6RamemOZ%WEGxuBoHG zXo^3oy>03+^n28&FSyw3v*KalLxp6~J|KSe=4~+dtjB%mt@LnbYPLD5*%?lZ91KX0 z%-aK)gbK0mxME+V8sMd&3&54Y+5dXHl zm;@OFXosA?GC+C`KgtnfN}vgH%41Gm8(&l?t#Hv!>T+5*$9>|(KKX3?lAuf5G!djj zGF2zz8Pidu2v9>8nvjoSv+**(h4HGNGEZY6;!=ytXH9l`_O>{ge(8}S)9e5}wREK+L zns9mb+XpWC0=Z3B)ASX-N3HIPL^oH%;P{qN3XW-}5k7+-)hvdrSPZLZ}RfW|dsXk6e;%(ID6B}+8 z@dS2WE@TlX;m=)_-Rh~{#WIU7`?(Tk5!$q-fYeLIcw`@!mY!!+3S#Lb<+I)+8PciZ zY?@~0aHd$f&2|ccF4C!EQ+1fA(BP5bUU7z(Q5X&v#0%^S*Qq^ZsmrFJ+#OFdr`)PV z%Z|>)8$JdVOl@K3&YzKzU0iTnxOzLTG;HDMKtQi*X{_PPT?^sb8PWAo6DAqzM=Z{+ zJ5IzkJ!O%Vh;1+xoEyj?R(}ErUEvTTqJShNPimkGND%mvgLEplVuMVfC^6l5k*EIr z0?y`L>QSwx60u0i2`ZsFXEmy|(LjV(-zj`88maENh5`CM2!VY)VNJF!)T31qyWa2Gi-i>QD`6=7z{z< zQN_EmVhsfXT8~!p&^i^p#P-=;%1x7HKG*d+;tRZx3`7?(z=1jSiWXQ?uidHY`z-}n zPkiM=GR@?iOdD^dK30a$RZLwhN)XlivnfDIe9FL))T_WL2@tU3_-W$Jke1;9(p=$Z zS%1Q}GSzd7NV?Ru4ez>rC*Jt7w$$CPE7-;Pwo4CU5xcPEmaq}zt6g+*1!dQ=Rs4(+ z=xWU#Z za9LEGj5;q{q!1Q+%1xo`ctkRYLdY&h%O1;Mc>ot9JFui|C?6jpm|rep%Geg-ehuc z%iEw}WWw7heWf@*EA-yNY#37dK}54uemE^sMS9k{TU^aZVw;^SI^0Nj10-fT%6-uvCza!$b@+T+z@WCs2nY- zYiO@Oc<_Q31iH8no%qPs0`(Kw2coUW?TF)(y?19w^9)J zljY@;DD^Du5g#}x1WoKCGM1t~vUegNR=aLhG0`@hT`pYs+_Ghzt}PTzSH0>T@|l)L zO?q^JyWNS3cjWRwNCC>SdpuE+Up%|2;hH@gQfp0BtC?nd#sUQMMT?$d2|hXEYcv7n z)<3Lw>-Vnvl|FqIf8R679s0zORD&qm8R!gSD7YHuYDN|8q#EFPK) zxAp8~jg1^n=9=i>taBTF%@#8CUxovJ9m$&nHr`&P)CE7;mmBK3k*0m0*mez?Xed23G9ic zD102hA@#S*8z`r7v(e0WE5?#Ss6PuEz|*JJkg~4P=L037F%9NX00v+-#}lRR=hR

b6Z=NX1vR1%0?4$F!l@34H z^z-`nO;Vt;!X6qPOwuxgM@}cEu>{S8K>ICM7p_hqihS@*uIKi2B{KWNoXcQLjsEdK z!j;Jtj6byw`p9NRwp;XN*g>XO+H5xHGC)>v1Ey18t!bwH>y;2SK zN^K`s^rnh#u7}fGK6WcH=^XmJQsLcPjVF$hBHPW^XD1xp4=kk(TaE5#DxLF73}#1M z;2YP^$Ydy9poJpCJ5&U6z+RwIfK(ya1>7}S48@p2binrYx$+jl!ZHqpz^Q@Z zgR`$hdtDSQ+K5>~xBs>&{V6Jn7;VB3Ml`jkb*=RJMF31b^M#E&O~`Vw9?i~rSp-g5 z@R~hpoU5Ytup-Ya`>o=d<^INFQH}^N{Ic?syysuP7d52FL)U5E zD45Ko(!0fCX4$RcPY`2p)lgLPYWZ1NO8hd0`ueO+t2l*(G{iF~z(Z|?1;GUW|BNSV z!{ppFFFYW1W3E?DIN5sk6c<8n77m7put>#^S!4Q%K}pUAQHfx3%t6h{^_G?i@!SY8 z&1waM1Nom|i8n9kx&GF7!rK#^x;cZW@#N}|TM(}=$S**A^Kt_2Ozp0}39>Jc+#6+g zE%*C!{KF;ZAn#k>*DNR@)yh_|m?V9=DjSGHzsIw}dQ+F11OfbVYj5xP_2I$0SFhzm z1Bgr2@3gvLUSdorfM<#?BM7-e^4}t(`J!10J6%Co033$rJTT0ZgMexiFM{E+ z&@|P`P7qUxE1{?g&*8!@c|yz)895TRlaT1^eCEzjH2nhmY$S?t^lBTuyNH>^`(0%Z z28|H8I8ankFf8cs9duP5o6zv*=b}*SH7YK&Nw@yKkj&|?M2%J>xZhK58Jhb>Vj|Ua zF@!@cCw}s88SFa_bKQ7VhgJN1&3X!sST(zP2x%_#n0PI;9z1o8ta$d^*u;ryU%;mM zb3d{4)VDoUs=sr69#j_ye0S^P<1N=ny{L9fq719APT)k2r`Ht_g1~9>B@1LIj-WFh zpu0uqz~mC-;m<8GF9&_M*kD=5Hma;Sm}C3-G_xa0oq$aJEOE2T_dkEY!LIswdj3-|zZrRi1Un#* z{7{{pq|<@NAuFDR$L2DD5W;Ht(n#60qj(}9c%sJrVorxd$vR04J)lkN+KL?&y8y8F z`8h&$LkVUPGC%yrq~u(ffvf)6$m`%@wl;IuJM)OmSfh>G#RfiYh>!7e$9eG1nW-_% z6wL8h&3!7*>cTW_M!`CPYXI67{sG1cG2hPfE~caI&nts>S>wR@V^-%Sc;hhLCpF3# zl_+-`q8m>^g-o~=wd9ka3ORCQRzDejOF$i5Oo}q#+4nwuu=c?nV(6r`3VkWx>-R`{ z!7~8j+)x!QO66YY!U?Dg5KqZ~4r5eX#4bEZfTBVuHUL5CCuo#SSngy$i}5Gdlq=Xk zKwv4727X^90D3@$zdjN>D+cf6t?HlBctwM2Pl6=~)`iq-X9P1G}LEo%T3 zWia2d=W87}L0jc}(mxUgC9DlJJ~xM`U`MLi-QQ?(@L~;8UrS6AS5C){s;(0!gUCZihsi-D z8ky}@n8Ra#35+h|>wumc$>cv0|~eT^T$y`krV#5;+$vb4^)IR`0$>`UkLkF!RV7!s4(La6WBbUx{Lx(NX_;Be)(koM;m|(8cu(wcYjjMswy8glU6>Qn&1XH_# zt354)1^=yo{Sg3>@&(ivj4x`-?&wQ%4>D9zxN8f%ko8c>+}(I^Tj}5ARW8d#wdmJT zxhltj7Hu$Co_Y)Q{c4v=_~0t=IYUXj>6pZ}GdYy(R^3m=FTpWmLov;{oxIi1+Y+Bu zui{V^YM2N&?V@%i6Dg12Xi=m(P4%O13-)f^?aHgwcch+uP19AU-978x?vZkzF&ofu z#QNu}-b)Re=L3s-Eqf#C*d@-~0D{u~M-MVBa@~>ciYCovK))kyT)=%xtgSSe?rg zfEbD$A7NcB^~bglWL&%2NY*;d*+qCfo`@Yh}P8mzZjxx_Pnl{M{>z;|U^M zj-n5QNEVHKVOjMOpxQ_2$&|O@J$B@V{%do*TL;@}jM#H70ecwGye|HC5dYoG%;a;2 zf4?FA``X&$wQp4X_eT)_{n4YZ|A_zod;ID6?=<-o{=I-ZLbENvaRuBLQ3=sMn`P&P zfQ#QU5ImH6mpJfs5wzXAq8yllZjP#b>uA`9NJF==YPdZ&rGvEqM1B-4v)nX^X~+*# zfIN;a@gI0eAr?6O=o5lmq*D(G6LY3Nr7le zXVZLkdWJ8)M~{^ay!8X#jiD(}yI@VrNDzUYZo~};cgegPUGM4`8?MOqi|z%4|AjZt zM|uAoU$nE%5JN4OIQQMA6 zwDdx#91ZCSc^LIVY@ip*&uCET@Zksy=zy!-0%jStYWdk7AKWTm)Lt@AG>08b(~V99 z)W$r*Y$^u=zod^|!~h)67zXpIv#{We?)|IoT5Zn(_ao>yER|~?83fFA+WgQ#PQuj{ zU3oWx0A(~eLi@#&*>IQ;4%8EZi^IZT<&ax8!8Lw^aW7T~v2^jl*NceF09*?JI>L2W zdXZuP120C)i{0l(c>YVAcA6tERQrSIYvA|4=~VlEgir{6-+7j={O&_X-a~EHb21ZO zE_+vF)0p+ve()gcfQRH&bU#|X`erED&=60U1_iL-5(3i8rvvABaTPr?((5-H`l8~B zY>MHXu4U~5#28t<`ZHTikK^e%v0m6{x=PZE0CSrW;rtn)ABWJykYyKiEY(%P!y<#H zCqFEKU15Skl#`4qD_BQ0jX@=OOI7h0o%G^XYw4+PT95L_|*npJYq7T+J0wRj8>HLCx94 zIlV(uAhJm99~^nHD9arTdF0!;HpN7X^!|ae(%YBBHhPu!90t~_fo2kWT-;PcV14Gv ze9G2xe|Hb0GW7;y#0BplOk4#xD_lglN`BJ{n%rdt*;U~70q&ZKSv<6TWVzQh_T7Yi z+-}?4u5RdzbAQ5$*X!1lCMB6huRyf#xPM-=z{7-ttD6&@rySw6ezsmDC$k3nT;F>r z3Wk7~F~jacl#kWuiHr$^u}!mKUOOfgA}6UO!Mu` zwnkiY#~|-t#M4h*7H)gP08vp;z4@-&l2g{S54jEtIXu990W%NkGYq)NrNjkZkU=zCtz@e2 zu_Zp0nE(|MDU#~G8n&`7h1%oU3?N)%2Db=4rbW-pb38q*`#6rTkib};MmQM!uHG;+ z;J+4%>AxkS@4rLRBCqP^`E?QxLPpc^NlMy;!{=!C)&AD;yThGIm(17g-uF9)N4p36 z^&ejz9KP8)w%`1cw|fvew33l!oZXDH0^o4plt!_}bJGx$(b4lQoC3DPuoCv0V@U9m zVKh9k50ap6#+nAlg{QYcoefBDDFyC%*Mls91#P&Yw3ef*)El8)kyUljY`OV+0nLB0 zvImB3^phlQ^L$CqP@H)ZrOAsG+NYaNbpo$gR$rCTpq0|T|H2>M`;Lzm(qa=>b^sH} z_I7$xsRl>&->r`O-TwmpZ<>$Nlh3UHp0EG?>e1>~>q`Io81%o7zghc3|NDFVY5gxx zJ}H3BK8EY7LA3kuAZo*9QgL0B$+#nT7k5+xW8r}wcyIUlE!4n$5cPa5a59}{x&I2# z?M6vOS)AsTSJ27e9URm*>y+c!73THz$1%Ti7&hCYj!gjyp+6;P{C+=~lpJ?;Yz|qv z5o!(dNs_gqlLTx@3TrndqYt6k&`kp_oW777r%?}Y2ca0cbE47{z#lG?tiTH=Fd82t zw7HoPsV6LHulMHQ#m>%;#~n8_@@ir6WKr&ppb|eiEtfrxjf4$G)$ga5@rN%TeEZ(! z|FDGhselHm-EzG}nwhc1C6f4a_zDzot)Es~sNpTA{j+I%(Nwe8jh5Q*-7uKw_|H&` z?sQVwAG8oDy$z>Wr~TjoR@FtD5cX9r&QpxMgiV3yEe|}Pgs5$*E+!e)*mc8$?zQF< zXq&Lmjs+8daZ)ou5Jzq#e?vSlG->NiU^1g(5?^LwOf;G1ebD-wQO%5CMIJ$D{7x90 z;>0fZ3WRMuf~7W14EMP58v={bPWKlmHnFp?V8-LuNWSYE(|1QZy|)KPyFYeR8le`H zy}j4%cgLoX_Ha0w6=!XBy`+!usiU*>M|lAlTF|Y|LYtrQ2`(^4t_Yo zHhjFH5xv{h+Y2jh*twGqY^ooOSe{=Nyn~Bq(d?rS?@!7P-!1|xM`jE}FO&*i7t=P4 zYq!VmS3kglY)x^!+sDfmuJfPFayDt!=p}3^+!XfB3FqR+l5&mTuiFf8>n=<9PaxAj(r630$uy zgT)RfZok~!+ga+Y&Y6=1u4qpxg4f+>d95ScQaVE`p!({DS$uvi3brnC<1(9hHoA@$ zr;8vvE?(YYMlJ2RX=3%9b~LsA_-T8&wzsEA*}vUhR{eoY?V-sAKln1vq#x=u@DAnz z(+$;=N<%qaD({(=VpFYiD&rNgI;SR;#IF15!uSm2d{`vO`4b@B!}N4Eb)j6qcO6kj zhv1O@nJF~ZdS?plxTfpkA#i2|F-~?6vDo&on|Ci^w%{q}N1dunMkAU}_?7!J1(~wh zcwxcxyjR{tyV2xRKK8Z`k9Xg^?H&L1?auE0%YzP*K1gCyyg5QO0p_z$V7$8acy+bo z(=;K^ZE(E<`t#z&cVy`OeOiF;-S&eAk&$Y?f*lU`_;jV%G#vDpe*Jjfh|o_=R68g= zz!v)Y@h6hun)$hLdKwx6%k#Db^tVzZTmSAs@9p8v%iSLr7JKIRqWS>udwV(eTLd%-)&=hFzkPSS;F3f1=Et&zeDjirT;1M@yPoSJhXZaaEJD@v1 zlvtYgpoMi{ueJ>nHgMr~#2I=n(`6`VX2RBjCEJ|FioM^&zskj|6T{5`E_&N(S`oZ2 z6^ld*GNk%x^JDfAEAN0opd^^xfkrl_cF9~U#US#Up*nfNSJv}J3~nOTj5-s?TQnLw z+opt_hGq|`5i0$cla3L8CdV zWir%FW7uwZ*6Pe3z+(l&MZnNw`;9O?7=a50`N7zjEpgPMnp!#?xnZH30`QF1-K}2& zv4(^j5DU^MOUh>7nW;3rrVW`S}JcC1W{7uYTy zjmW~7%53R)FZozDE>(@OW}?dVyTHt<<>@@a(cC#&H9G@G}eTJT0r!%tHN7q);3~+B%8|?64r$1IshsKH- zZ>N_QS)L_yB6Q?-Oe(j={E!l`Spk|`R@mXrtKFmH!@nAKZRf|XJ4zMC4hv5a9jIQz zht16%_D=hsMBlzpR1LU5AVZ=@A|mGv7df1tX6VdC(@Ur-uvkZl;gGIr++m6euk~Iu zUb|}mtOdt=nw-u?@su(K3))P|@Y5DF!9kXfLwHrwRo#=@$O-*}Kv`!6sbMk3>6DM1)H1&2& zu9CiMs#0MQvsb%3CjT+(!{6-l=6cd*4gB2ccIv{YX3j(EF$t;1r>}-UW*Sd!OYW+) zgfq84VVTm`uu;UqX$Z&ua_CrT%GoAF(ysN0(p2^9w(myIzBTxWRBImpRAzh_7X$R%i7|LBzt-_ ztmyy~DB$rphjN=GSp7kXzJ#bAUgPzOQMo5t5|QR6I_OieNrmboPejuy4l5Vg8C ztR~(r=A%)52@<&UKOzSNF~};tZ(y-9i6cgQo=#OnZ?8RlUffWaTG^&pGhSJhKn&|M1dkNvzKrx3eWT2)N>J0`wZheb6NjXsV)cW&w;Mg%sAStlo)G z6x_10r~(R<1O*GSEO9&j6Xc3UzDER!xg&#B*Nu(za4k@&HFnM0RX(YK^;5Tr?27Sd zbX2?MXzi=14ilJxE2sG=Oj1u?8P1{1mrs&q-emSLYCkT|cq`gCF-#yHZ`=!jW$P%% zZ@8*H+}V2ZTW_K7J#;*iSq!J9H%KSUnE_WLp@mumCTd$h8W{jgpS6*iyhN6FeRb8| z(xX9~WrE0T8yFTuUpl#tT0qu&bVi|eyvFaFM6IEk6veC1$}mKw&y&lXG3<-D4=b=e z%JcImJ~OF1E_oK7jv9`O9aLNJFYD}apP}oi?k+|W#eyEJA*F|I1I{g2^?*(}I^0+O z<%5COKBWIt6$C>^Efqy>Dkd?wPEauPctDtPhK2?-8(#OL_ThfC1i_N5ir5K%(`@-! z2KVWD<}7X`)h)=nF64;Ggk1&m7VL|Jzp~KPeE#@ro@pFhCWeH}FBe<&-~p5lKY8j9 z=fE2u)t){oBG8Zo9)}j5RE_k`dHv90b9CA(vv3~|^=TCO4!WrV&Aw_z=mqVcpVbD<>`gk6ke zNe)7pfk2TZ9v4Cd<}jTX91jqy1KTkwEM%1w%?jlRrd2e^X5=XlTxGO*F60r{&>-ng z-mjx`?KE3KJ?jSia(?!Z0JkLbLS$zRuOaqA+hcqB7+9I&qT$6LC1#g+C}|Bh_ex7b z3FD0}n?}cmQQ_UKY_*_SPPrSqwAzKT1XH{=qi@cSyG`{WO{^)!AFkF z9<>ZLkKG!@o!}@OrG2oeb{#bZcAHR64tn9Bqk?9`l<-}iH+kPWcJIbohH&E1(E0UH zUWOr5mGW+1oV;B$TYNFuS?oAqu&aq7sem0EPtR>D>SxTRbu$)K+PNAgW&&l$ahAzS z>USevPk1SrA(e+?d>M~%bvSs2f_8nHAAHWNWd0FG5-Z1`QG!U%h4u_632=m5UI2E* zOC>*d0JV&CMx?_tR$HxAV5o)AOEbyk%0r(j$YwEki!{I2dro}Ii6yP}o&#nHHZ8Q_{)wYibWQKVbKtNQ06qeMxCo^LuYq)4 zp5?kcC9$M*E3WAQS0uXn8_qvwzRun+oT%cdEEd9 z1PRN6vTkx#!or967bq`ddN|%O%#NWtTAP3^gSo|)^+jW0cywmsr2t$nj@`9Jb9_r= zR{%-AJUB}aJ%zoIKunWq+2s&39nIMo6VSC4+?wrYARQgwc*XV`PSvV&4L!~E{D^fq%_N5-IC6~(fpV=}(qs%QQ;t{Ao>IRkzqpi@L2%k!bZfs}*Wh{_N z;yZM#Y!%+XN1j%Z7L-TkBEt?lpT++pZ0GWas0RM>89Pv5|_s|u|48B`_?j0I3FMhyS>g+ zG_pkq-fBxMG+AxS<`DPaRNop9dYZb5B zVJ#HDLas-f(f<$goqd%AE$?l))l zaz0$XTWzbit1af*wDw*8S3Val`!$wK=ha1h=eIp@w!$tsjmD679SVL70_^WMxaDGKEE7{jInzXYt@@`P#5k+95&tYim zz#OSQle-Ep_#lpiTGX9QbB-d5jn-A#_i$VtCqRC&|l7YMsV4Bx3bvq za7wZbExfqsTRNUED{pc8LKKzQe0ze@9NdGzbXw6D7$JyQB|H#assRE&CIdt#piE{9 z_(=5Y?xq{y^)d0-(3bdA(bW1?^kuQwt=NPuX9QZVEwF0Gt2(DnF@~4uaR~=6+VPOw zqZ+OksZ)C)bI2@MvvpYQ?sO}&;S#paMqax%xZb*(1=bb)R$oAmzeZr8xePYIU){)F zo7X~!EbP#l-MW@j+<=6RK@8bLtg4AYWHs|R{RNjDIQ()TqycP-! zwHs~(&`88S$VGkUYQ2*g{=SWd6H`PvY!AtDfny8yUcNcLAwV3s*zWe;ZEXV*RfQZw zZPn_Ygw;{^?@}8N7**()Kdevq2Rk|Z15{2hD$guqr30);CT7f~5bqYvV~$5|OMulB?8aS24f_Y=2VZ3iJUT+WKQ6Ot$ha=DyO*J$%8TeW&)$*ZZg1k0@ z8*^O~IT5W93}l!OlJ}sb{Pk#O=eyp~&T%)wU)%2v`Pa_=i;o*&URq!D8_EE~mx2m{ z7~YHECo-GDKSq#Pq-nxZ8U_j4lKZk831(uOPo>$a?8pjS^W>2->sK54kw_)hx0@jc zP%4#ooyjB1`Di0U5B5&-ZJNrU;F_Jkh`zo$2qS>kOw6w-;3g5nME$hR>f9dc-1~g; zq0Z<$pWI$>AQgpU7!#iS(d}%8qP)|_!rpt&#=lM|GY(3{L;9{>a?HESB=N1J=Ar;Tz9QDrTFCrFE(*v z^Jre^R0mK(bBJC|u?#=dKm$9~D!m2p=@r_Esj0$uTPnonv*qyFtSm>X1FJbqP9ub3 zqa|V*@hf@HFLtdL=*KR;#wO5f{K>Bg8KG+}_xUwSkn|dV@@ugEqqp!&UJ`6V*V*gy zhlxu*QR(6MTeJqb{F1$E=siEkC&P{Ld-IE5;(0)C@h82em4?5u}TLN3A7 zF0W^v-NJhHE|n24%0Zojo0W7mJ8(W%;;Ohy-@$*of`gz(iCMC9>q;MRRF=D67M1%g zT+zAe`xiF*myaJRvs1MH4EE77|G&1$+)i=^0=L*S=mpfe^QG|18z0&-pKjqhIr{fib{vr^cPec=3coG5G zM)XFO8xhR3605G(g)pAq)4ISG(YLOdgss`|_r$7g5V6x_;tL3j1*t3FgGFe%Oj8V9 z=3lEC@eosTLP}@zM$h1)FDw?8>4NzWRL$17dJ4eZ1GSK{UQiqv<@r?nxkvfwy8L#d zjuY%=(VE#KzGAB+2m1Cgx@sDdDH-AFwV3tKc+su@FG9qbo;v=wM`EoHndk4g?4XW z0kWj|Z*)Jxf0of*7HyPhNrx7M=s?3VkC?lIp$s^fNpMp0>Zet``u6sq>?o2>UDaWA zO7F;D24Lf$GIUlT3ql>$8c)|!Ni-e|1t>voSQ8&W=KG*mS%Yk zlot4&%oDjvC<6y{C2H>?-dfr(8F`g)|F2C6K*493crucOyfgdf?eQUOA-c>@F3>VO+WyO5sHeE>&A--0OwVoa?fUM*%#>@6fnKR-zZv%y zy>5M5pTjJ6LmUMlj>4NyPhoY(7e>-%vPN?S1(5TntHBHqx2ak_(Ip4#%pY-b*P(Jk zRn?2C({5wl4noF7@0hM2(Sf~y3=%BL)(mlht>d{{vIU*vBNvPlco3~SuN=;DCkm$S zai4N+RMMEXP=Z}>eY3Vc8K3`T(qWavX|{Zp6X@Q_?DW*^i-41$a<`6-b`Fp4{R!7^ zw2uMK)pDUiak&VEa@HgLjyebIJ2&2Hfw^4Hxfd@TddbzK-R~lLyH|8KY6Gr58KWY& zq-^1W%<=%NfWaNW9tRl(O-W}E&Nn-?1)7=e!?DJ2-{#;_^{sX)7~{GzbwJ{k<|m!G zm4_(fG<|l~m>WS8($fg^6zG9i4GJ=g(_TDDF{xLhd)*#Ei@3^BSNA2+`2L*NWb4^{ z-Enc+SqO_W`4EQQd=oxLBA(#XT*lK3?HJ+{I0k0fOnb8zp}Tkc-M*o2FI@BKna&~# z;c=xJDmxF1Cc*DC=IQ~7dj!Hp!C&~0#qgTV^@wv88^iZjk z3UBL@d#UFons}+|M+Zo=>k$!ZPDeaFnVyMcpophga`5<0np@c)J;-~s{!U|=^DC&Z z-PYMV)HH8Pa@}4n=(byJ%?2Hgn1eijF?faI6Nn2aFY{$W5yitIo*F)&Oc1Z2V4)B) zgIoxHgh_2IAXCY^^`o#`=9TM~aPMBPxLcW#-Now8?4_C-0Qt1+_=LOHd$s>=+b|lc zT1>aFfNQ_ki%Zj8)5)aQYq#;!3>~+9G=C3{-$Ua^OoxWD2T6ZaOp?AUw-O0LWe5T| zs3Q_>TkR$4Ty9GhonpQP`X}s9&A4#-9{=d|Dvjk7z+jCh<+b8yH1IyB;>!Wa<#>Of zgm7A1q*GukmxZlNUGTyJ`CpL|wSa(UXItzvJJDnIoN61U)by@Ihfh%2-~b#Zq`AekYFmAYzTW@?o5tOda@@XknbX|tdDZ19K z4qwF6gs|6$RWj6OU^x11V*Sndpw0mO_~Xo}2h4696ku^$#;1kgQmgyDE<+;WMGw^` z1FmbrnfOzCQI_AL5w4;?ci~kJE*bdl4Ga-i>m`9*U_p;w9~>S7Mxu_b=6zXsyjorP z@CBVrej7_S$wl7nF_8YF||OZsQm_n>NNrrJV$8zL5e65*pQm3H{ICY+J3#$Q5*J#l@nHl6q*qv^Br%kxz`Ji*26KCojFJ*yfHH)!C^$kk?rW7y{-|zQKuPM$xn|HYsq{!5J5I8p9-}(=nA(6HZ}{YGy`lM(P0&QO#DS zNb<0hQM-fcMl-&wdJMG&E75LATNOdk04$LGoJNUwoC3%bOD<`%Zo>={%0yJOyKcQ#Gl*l3}(3I_EZGh0!%$o6fdB+(?kL? zSW^M;QNM4+jb0#Sb2Wsn^*2i%m(IIs)Y*v=|1{^Sk1GgU;9>XTG4_ zP$EH^H54gU{dX*rdfZefeQob`_trXhD|a|e8k-8=KBY{WfTmLEt0_0TW3hFM&i~j{ zs4O!$UNM_FTr3@s=t1Ti94hAQzCbG!a^@-siq$L|xQ75E}%) zwd02;omQtRDRK3w$s6>A-tqff zQg0KG2A*2x3?Y;j<_b7QPHSjd*IMC!QS(oPnf;E4pTOoCUN`GYbLsvSb=Mf-MmRJE zmEzL@^SXS|KQ~pUTM(Yb3_d}8Fs-6N;Mss4#v&Gqf;CG{V_b98!YAHG#=y}+z-~nqdN>5re#&DCEOa=7E@D4eaMt8XliSRIt zz43)CpsA(dKNI{?z_LUzA@~-zIt@hGEJBm7x-!j6TA3W*GKzj>mEzt;1R)*4pnV)0 z31QNPnmcV+#T%@o2g9j0q>A%r}Zh5nw0g0p4JrltUhH;q0j0IO^Ynf+N$qgsP3BgU051gz2tMVjCY4H zsCbPa*LY}9at3PxE-wq`=VZ~1kR%6-+Ji1$~dKBs+iW`M4~{R%t|!1YvGzuf~T zlGDEUmQsUtlj+}ow>8rre|P;0?EgT-`pnjUH`)KKK3f0kG1~uq_02cyYu`Ku`@ctz z*8i~o`#t`&{U1#}S^rgoNRZz^oTZc52#lBw_gm(4>kaG|1Lxn>+z(3E#(wj!ztUYL=mU_NYbZ`0?l#Gf!E?ZG^YC0hjBpB#VBxeNoD={rIA zzBj+}J-_ne)9Q|vRPD%8Y3m-VU_cz<@^UsQ!27H4Ov=zt96q5|W^ef!K7fV(UPqnJ zVGI)+e1u|Oa>$Q1n59J9IN^Jup3>C7c= zDfl_-;39fvxAzW?cD_44c)QTXK=$`gt@!fY{&w^hniDOV{r0klo*eKP2C#9-Wv93t z+jho%ZxcjN;1#V)*sGMVcgGU&UJo;as7(pNysno1$jkh0@;w+HVRkb%1I!-g#zhd} zifO3XG`l?Me`02w$UEib_crsKd|d@hLBFrB8`=Tx(AhaRga>AJ(U2IlXEm#%D=TQ| z<26g0Z}AK!VVJkag0>Kudpcm;bWAfd8Atqx9r+Gk`bn zf9q?HH2?P%@PCiLS^b0m`#t_N|HqTh?jN(*>1sxDDSJEa&arn`q~`DBMZJTD#DtCt zz!kmX=oT00G|$EqdQKv80rY@p*ZFP>4P4*7e7XChBO;5vMf(YCU*Bx~_rYQH?e6}; zVbv9|Exv#!F@WM$0>J6Iw-5GqpYLzI*;!cZ=hJ*vnh%SO1==JxlzP1N+!l+s^36r! z=NpRKb&X8(=AzR4hH?&$Y&m(+Tn?xg=9Y7Gd}s?|AMeJ(==%)?zB_*TXItW|9R9hv zJotJ;X>YcUU)$0^)7e}ae7&Kx7j7!i@V2=y{Cq=cdk0%DYaJ8UsP?bv;eg(Bn79uc@lVi=8+x+(tSy#BxQ7o7jUr1?t!bJuax z`TzK<_3->(`{ob-&)?-wpZ_@dbovv}cQS|w9pScG9XaKH0VtW^d_3Io4tGrN8YSL`%PTNa^s8z&Qwk zi#DTQmY-n^do2!u(Uc^01||0>$N}X6Weq_gnFl~d?MC;Z28$S>a)CacauSjPK=0#~ z1bJTpYr_`1I|qM*48K6gtxZZ}1BMRLf}*fcATbVLMsR5aHej*=+Jm%SVkkKy@TE2+ zdGJ8ukBjK|Hx$!DsgcHz+zJk{yAk!eOGn2Nbeo142GP{K$Bn0C440ft`7I`4`X&{yN^U*SpkwAC{d= zY;E{Ah3Lu9lC(VAzjP@4$=^B^%zLnb)cDOloGJwPfCPxuv|&Gb+Ag&E(@_#CXyU(M z>@+IT?HSkrV8z6^tmy125iL(V%u$-JmF^8W4~J-pgE#+wX!I`W>(HzT{hd#j)JcI?xx{q=Hp zXYYkALFGB}@*LSbM_!)&ogchZd)(Qr7cv6o7x((;-E;o+=G~tBI*_k#4}RcZFLuA@ zU%T$-^R0bJ`TXEee*I{F9=$%41{#^!R&8sx72A4kwYFAQsjJgg>1wpq*qXV_H_vzX z)z4k^n_KyA{|%S3e{jqrC_nagIP>WJNo_B;nv|R{o9qe^W*X1mV5;+4FUSZUgY0R_Wtc_6v_WkYu`Q(gH^;b7kJ+Iea{kC3z{qO7bH@~6RxWa*obnpBR zRQ+eJ`qN7IO;!Kp-&b|~@2mRcw^r@bxVu!{|M&HJ@b9ZS`5mfmIJt(u<>XSrkpeON z9r(Y1|Hmto&t1n2{QuXF&F{eed+n>Q|LYI_|9AM){69`UasP-NHU!Xq!|1*teA72^ z7M~LI-5m_PO`+QUhaMZWe>Yw5iJ_3PCVC^`*ASWN1vq%44;#uEJBNpWhpJp_5t$Et zk zVvtSbrSffMJWOeRf0<4FF>QMS~gE zjmyPIdKf_nuC?&y5aWQ5kMD!E2(XvV1ptA1LC_K~BG%VeY6oy81cAV}I&NEl%L!`` zR};8=W!;2as>F^z>j0EdfU64O;~mx&SocGS!04Gj`JG^)Q?yBREbF>@YU=-%8@3Fvv$W0q8e)Ow#jk2(#t!~8Vxpo~}FJ4$Ph}6iaIZ}=+ zCs|&x#Y47hf;V1DILaQ*hG45k?X3dt92pve<5|Y!^qd0pG`Iw7T#ptzO+#vYtZO5; zq-JVyW$l}REv-+inmaSSPdB5Q5kg1V42E93J{(+IyDq(&maXX&sD_1A9pu>HECDz6 z>>9UKrJd|vc!9U}d);BvI1bkv_R-MeGkK1oq+FVo^_V|D0c1OO=U@f`8fF# zMsOdFG??D1atq&;l)ht@&O%)Vt`YrjYjVagI$R@kFsiH5HJpp_%gGWrBT7?0;r}gl z>HXM^iJcknc`Wv5i zWsY}v`sJli>@ZckP#fNZr4Kl=Mw~#z1rI1 zY?@~0YFKeRhlOiw&0y+G(rOvZXjpWE3Z26SgW&1&plYu9kgy3!qY0Qy0Lz1r7^7>p z|I~gXOWqiU7C>wq1Ex&YK*o$J_VN}Z+4QFjvZ|geOBJH_JGJV@mO0XNs}{}co@}VO z1)*~lZMK`bg}CQ90OVQ(O@N&2vx6J%rZV)cJn*EAQ=`}KjU8CR9^7tTFu)$5g!QtZ zA5Co;*RK#YjZ_d2#Qz^$SO)UH5h#9l`Ty}(kJl^m{~!K8zt5i+{{<$Wy?>G`#N*pC zTkHClI}81$Brk#sKGt8<)%tnYnd=HfV|F@9mXYR^`8hxswFN0KDz3*T`Kah1+>8x? zVWo+58s(QLDF9^26wQhT$x3uU-qchYEQeBp4G(jGc>{5f!2UJY{c`v4=(u;dbF_2# z{mzSpw!W4_ciakk;?Dl}K5n9Uv9PcR|1A1obI}i5hx@zxubzMv=yg7e2)ct1b*6)a zBUAup5_SdUQX|Ypr>57@B3V#L(-xuCkj}or8$E;z&_WO^e&v*>+*iTDlT5feG4E>PIeGfHF?o_#}|6Ku}I zX);q_%eqZ3t~1mHE)A}^?}O_s9;bayfKaj$x=Sq-s#sQakLj~h z+x150Rg6Aq*VcxI-XNmGk2O9PwKB$!5c-k^I7Cd4#k&MZyX?Vm17{s{y30)Vv?x&t zq#Iz9Vk5HTk|BiKe!W^wFexmzT@R%I1znYX8D2tm-1)I*7xkRPN(45;1W?0Q6!v{y z8|R@O{Mf^#xo$cVmSKt3{~a&Lfd8lHzQ3>k|6{}SSN#9K{^k$<|M&RQ{69~=^Zzd? zL`xgOXLar<0$^S(1jvhG_PYpK?xJ!^AGYQh3 zd7(Z7{XkqM{5o5KXLai_N@B9?I{~CWbGi=A>ADP7fkolN_+Or-{WJ3_&iK9oF?paP z1RZo8oyBlxm0dHNQ6##6m8ks^J)^j6EMkap6yhP`!4j}_A6i7g(oCxW5+3RSfb#e> zPJ;`lG&7w|&6$=Qzd<-6j0lGVH5@@ag8Q4%KgV%#j!%LcHJv5I`?Tl=gwSnUgV}g| z4ddGafLs_3m}@u#0}v@p2sLq4z>t7qOB@ur9>!|~$5BC*#{!`Wk257KM3aVQ+w{QI z5q*oer|K)0PX1VQUA1q%bUA1qJiC~F9KXOExfCE;s)VwJ(|inz=YnmfbU6O5K?+j zSp6=yTCe{T%<}((e*yo`_zR!c0cbw|zxMT4YmY+y|C`l6{C|I!Kh6KkgF-B-=L=RTtL+^)dbMS$mXvi+@^`>cE3YY*EJRJ?8G+)Ns2}x`zmLo-qSPWurbT(93fJ2{9+<62K2~WkN9*QmPM$J{g1r$j#pds~Mp8+Hbm~H*9GXEOk z5W(!VH=+@Qb1?rbFB7WES@ge~W-!j4KK%-e0^4WLo~^?GazKs04;R1FG~@jUFkU`% z^jM#5%;^X$6Mr$3MaL@kd6vtfX*vOl1il*HWEzJECQ!bGE%6opAQ}oKnsfW5pco@1u3)GDp1Y)^n=B&QRS^tS-C2U zhM5}+p~z7*=Q|DJQ@LE*5rDj0Bk?6ooSYi9Un z!!nqoVv)sZP}A0Z_2c`~|g+cH^c<@Q%F!O6h(r=k0oNP8Mbp=lhr zk+~WNGo>XUG=T}d;hgB&nZu7jL2z9MvHO@6qk5rwOYsP-2~(XP1cq>Ke@N#1i5@-k}gWF-Pn_H8Uy z42+A0=LkM!_TJdWWTZG#d?AR##LQW+eUK~@hO)sEh^|3DK0Ur7j{RjMfj`a zHFcYJh6_rj({XVsgFhL8`wlD>2#N)6Bjp(kuwkg(lF(DZAz|xipu`>XCdnV!nyX6e zdN9hSv9AQq6icn$irupx*fpR4_1kbY$iz#QPHlCPsIB3p-ymZVBcCi&WJiD@ z%cs}NbhkK8iXuMc<*p}37$4Jo!^1-qIc)#V8*o)RdL>YR+dVT&@Wsd?>!1M#5pV3xn(}S7#K)5h+GlgoDlK57`uTcUv~zxA7yOw#3m1$4h>mT3 zKZ0>?{j}N=qXTqjTBYV$c9;fVU)dXah=WR^;+%1<44c7q~&xln4&)J7L0bGr)R;Z)T){6hTl;)*xXgJ#B>Z~Q;ouG{Ifr=aHU#IiXn*m`IeFtUH^9jibxDuRsPIRZa4z`FV zchbJdr$nmF1_52nGTVKZiEzMO#x_PbOs5z_{*}Z?i4$#wqj)fwg0&CCQO3L474n?N zf4061(z9y!7?HY_>=cZ%9Yb;E+HQCfq*fGB6{ zsIJCDUwX0wEG?&Vg*-o3xh>0yi8x?I>YJrySY*^qk0?(_QYHm7HX<#*tIW?x>P>0>W5@|yU< z9gJ0J>tK0tulCa284gVPhsmft>35@vj=O5!bPOG8gRl)weekfxR-;>{^@c!$L9=sT zA;VGdc1NeAju-1Y?LoqJKLvBw{%DVOf3beihIh-)Fi`GyWrBOSe zMhb&!+XFByhKIOhN5#t=?`pu1)tbNLK z24$=_Hzc2+!1b?bN7#%{E`o*>E*YBFX8t>NWX^bk8}z@w8Pi!drx7%q!*SUKlco8T z$B2zULFW}@=H*issdMO?N=RM^J=xeN>=0a5H5+kTf?G}v50G3X{rYyRlf#VTAJKgO z;vm1%Mt;1J4_}v?gHJ2jHEMxW9cF1BHTTo-^Fpo%7%W9My*>e1NO@qXj54}=bP#R(Fc6g<*be-^ zgb7uH|MWY@e|^06XpQLqH(#x-e!YtNpS8z-(Es1%FT{W9|0et=4fym)t{o_PC*ay~ zcXtmPE#|H+AgBG{1p;B+>=QyrA$M{VQ7_rsz8>t#IW2=L`>5zFnExz46I4Bu@ClTSyGb|427~5cw|&wPg@-wfzQGMIb(%t7(NGxQA9QtUlc8x zgK4oFEuKu1_#A!=a`-P?EXu#>aFK+W#e~u#pfmo+r}z(3WB7fVmso(yl;V3_FYqHv z>7TrWf2e?IGD+f6GLWtw-kYP6{+-USJ^;eT+-UhD=^s9XS1T*@U;Jlt6aM=Q|N9jG z`_D~D{`4t+dj|h~@&r>P`S6+jOo}!9{4^zRZ+ZY74E>^I@@x?ip6rBzO?}S{XHS+w z)P`4WFhW;T*y-A}(s3q3R<28KMm+)PGJr7AhDT`IUjum3r%NP<<^y*-rd<+K*v7Gi z7jTbtB52q67A|@yD**NSv2y`X#>{m1?4Esj!NrXnjL2vi`_TA`)ft&49qWj3fy^WtsSwVb%Sl&en{Z+FRO5?@ z!%Ap2pqhvm`Ho-!riUHaN^8J$##+B-}Y+?A1}v+YP9tkspIjnO{^mB!k3lPe563h!aMTjVxRu>)0cy1e$mdy;GWZtu?Yc9ubomFi{)S}KDaF` zgGG>cVq6I(>2!Nws2fA>ksY0$`cCz-f6n+6(1{`(8;ly;bv71I3t=dZic0CqY^3G{ zEU!ueSDU{?ip#X@pK;G+gP7Hs2)N%9`$PzTPrMW__l{kH-TmVy+(df_fZ=av<8H%Z zX%f>g_$f9s9GC7%r9`zWuwuPHK7N)n2M5QR$y=SMv>sE#Z$T!5-ws^Q`6^;zLRsnu z;!8u*z}WxGVv!4$=~R6adwhv2!kIa?$kAW-kGFng^8G0|W1wdzFHC)2*YdFsOXZf@scetnk!`WooD%gL6qcxbX7;GWMu!g1YGJtFlnxz5 z5hn<(gszFREdBe;diGG16AQ*9SrN()O|Ocie4_2L019@BW?AqOpitP<8;q~^$Un%cBWd(-PF9bf~#^+!s zab&HZ#H^U`XE6`AchNfEMmg3Ds@eGf8qg-JHOTu@){TBLEApod{%gkar|C~wN14_mN1c*2 z0GI6JL|U#I9IH3AG!>YuSA=RD1(CPd_t`XCTeI!vL zMed*z&n6^CU@#*OPVHec%O?u~YKtJoQg8wg>2|q-bc>1;P@_mW!$MgF24f1a1M-&9 zdG$NSf!$<4Sa}T~u(uJkLaLN>T;6JSI()!$kIVme39Om77 z2I!n<%qSg05UVX6N-cIZ{&I+6) z@^BaxqUo@{h;f|o17%7Y|59>#F#35xm>!>F_G81X&% z37YWhv=bnQteH)}ni3Lwgd01wsxkP^J&(PH7h^ZCHM=D2{3qSp1+) zl)T_OVOs-xiPbt+)sd*vyRWpUEiGK1E!T*K?Tb~QVqG>c*Ehm&^!~`x$xz7FGOKge zM;L(Eum-Sw9CS~mHUWm|gK!s-G)vIx71aYPXYDR;*D4sg(S5Vdv;zn0e6Vcii|O$! zX09E1FneXO%UTg9?i&$;RqAc5z|ucj=*!Q*!arpjen{ZaK~k&K=(#jDlBr@i%HxtN z*zn5-9$`2t=hR@@8@eFTc6O|7>;2}^dmCPu z-s3$N{r=Eurb6uT9d69c)(rs?b=k$|IoUFs_tIy+l93&-aqeZ%gv*@_pUqdKRQh|j5!`>|Vcv3zF z+bPHeG!|jcX~(tb7E~lIT>-flU8_fP#akDZs5=LLd%}tUMbS7xU{(zN`#hFrdKRhC zi)L~lC@n~>i&pPiF`y;ZzfSj9D;dEpq}?>AA^WlbA2>5UNUeF^z8rKGyU1j9#fVc1 zsOk_|#qN^Oq2UM7u!b;p96svdGW+I<9YA)>)jWYI}$N0DZ_JY!!sl*aE3@7q`Fnx zXwj{QLn?JP5E}TygDHGX<)Y`e4B(S{ewqGBRoV+1t2?Bd}C->DlxvxQ0j&s!4>|LNpF&kX&&>9wEJQ%1zIXdV}4SG+*#-f{= z>g5MC{S+k1tGMc5s~UZTH;1@Asb;!;Y5L? zrUgx^F<@=DL(*P&)t*LApGJ>ii3DHmIv|x`+bJ#9JHD=vRJ0i47!`(2YhgPx^_pzm zl#xI}<7egY&kc_GHJFt2*$-5XVZAlJy^X|ga- zp(FJpRB_iS0|H=EBLmGQ(3wZHq%9+Yde_yZDXbv1B9=i-u+hwwSC$hlVjG+hOwpKz znpE+mvV3p7cChK(s+b!k(Vw@7_qQ(xR7^%bX9OcKr3O&Mnfmx9bSTmvZAOjE*?LM;v70nMo8n$$Gat2*Y$n)FvI)Y0EZ@2P18 z=~OksCD!3FS9M1+7*=O|pW&0b#h_8LABb^qBZ+0YGqv^8U@)i*Y4dV*y|BOR@>6TI zW}x5#6>OWPaABk>wAHBWpT2S|Yt_F^-8@ZC=BohaoCi**zd_h=$3Dp=pDN|w&PTdg z!mo0d;6rh{3#d72mV2L|->YhbTp(SXkKpuf+@N!mPLZo&=zf;&=Y_4eO2ev)cuq~r zwjlEpuLhRQzin1OcIKB`qZ~1%SWUe7?a~TpAZq`)_`8)(3U^`bQRwD!zV!)#Q%Zx) zgi03>PD={ktGRI9RH*LRCV+wZ)G<`5<30gHkS-~$+-B2Vsy&qE zG}j`>BH~Q7#VcWf-kQ+sLjRIUBbdLMrtu;6#cd3bl-|sna5n&CAj-y}bVq=oHTVo} zsor{=v#Q^_ZRu=5VRaYjcrv`E zZ5N(}T{x5yo;7#jSwj~deo7Y}`YqUfvHLwY;o-yPCOm9t!aqO5DDKNB{&UVs{AWW0 zo_tCJp7;%T@qGJW?|`u{TTh-ex8g}dD|`V=*aM{8Y#SJY?!%u_7lq1EOU9~Hp+dj> zrmQ%wVg(f4EBs&h2ZS~<8JMfGm_K+ctw2U%+)G_Ux4)=2QnE9+qWB_Rl{T)@$4IAslvnM9ui0Pg_SYl(>v5px`pSO!+Wz{+ z{`#~1^%rkhe^MLiGQ4K>fCX)X+!9<}HrXA~`br1pDIKO@fim^Ixq=h10yNCE<^jJp zXDPxZs1w^wtI!ZBv_q4>JIP45k&o)dBd<^=9WLrc-%RuxlgUd9V+7yY&EQ$rAkMOSweDD;xm83fOW`omS0w zwn0AOq|Fo!;so`CCGLTF%sze4a+j65|;A;{(JaAF)# z3{)8)#q8}qw-L#P(RDtH5<`#&h(BgZF)yakWSX1F7?U|FyRYSwBx83v^E#fQgNAK% zmozV?4SPLEX+9KTaVt_G78yhSK?-~T8hIzBHws;HE=0Nwx({fA6o!5c(6(g2&Y);$ zRLso3m8oX)-?J1ES)AT$cN^)(s#;4 zo~`{e)aJ4CfEns@8Yqk$I)Qi;gw+cLyhK+-uqqtnzM}=Yr&<>a96xa8oSmREp|~?0 z?!4MH631V6_h0P%NUz==?(7|Gz33fpJ>T0QD`7k*z#y_OJ|v6?0qyUN^8w@0N>VfC zhIJebAl34EH>#$XN?!7IbH?cbJ@V!BCII-uV^A{uMBCZe#&= z`eRoT>B9BA|!-8)^&Msdr5MC$JrY*sM5iy{JRgeKmKn07w~_AbM{&5n9u)x z_4v{1Y6buG@uNTZzu)6e^M5k=!~q^(PZGl83_xHh*{xYU0e7Wr8r;>s2@YZ-(BeVt zLGr<6ND&;od_41^yMy`<00E@7>S(|a9T?3|3mp&vPq24yzu($hU~kvszrNien9$jT z(nn$Xw}%JE2McYT;lUbvvx#Ty1Y!GnuHgE9_e~G?+VtuyB{uqL-yQ#)i$Ck1>JF-?dOnOSj@p;0j+GY2m zv(RpXlV;RzUv$WTx#NcZUB;pij6CcFx1yk2SmiTJLN2vvvx(^EDwxtK*a|X8ms_5^ zrRWGnc4BF=VU=EJz5pA{4C<6(HL;a*Z~LVzx#5OO7a-YE(p~b9j8ayVv&SSaD3x%Z zR#+wtMZZTs8KbBG)(!= zsn{aJ$r>(rnlLPk6;64tnk{4I1s5C$RJ78l+R11JrVX&{(A^A|1OSG5$fe{BjY3DU zK+}lXdmFaNW!bxD=bPvE*v+^u0s3}qJ12FR0(0`7ZN(@vuG?8IyTVWl*_2-Nn=H2*g15u{X!UCKB^OlJ z09z1FIueNo{^m2g*{cNFQdiBRmu?_RsLK=v-O=f#kE%fpqk$#hXt++<+&rpp;{G&8 z>HvWzD+B^Bt*{Z@5~fVDgHF>lx)UVC`Y5GTZd2;&V4MUL3o9lfUrQDUuLTqvfDi&> z&(FCzcG2YcqOuHt3_v?iezr})PO$g&X`g&C;2Bnl4MntNgik8%BmpvRA;?L5g<3`T zlB7t35nu?F5US;PjY!y5jlChB!L*8Y>wtZafv!NXR0^6%&h}Aj4_Xb~?!cm3ArMF4s1o%yKE`eWbtxixlMeBo4@Sk-YqhIaTOY^l& z=n6=OJ`z}(uj3c+0sBec0p)8#0>MW=Uzev1>556wr4K;OAooI4nJ$y4v!Smc%phmb zfN9!?_7?@B2Y)QYLPmy7QIUs}|ym3ju-P0+~+Gdqr zqcUfl7v<L6U)%U>X1bvSp)NF|gA_Q}K2Xl`GJ%(urZXpfRknp( z8?stBix4e=9Tm|S1nJ&2s|T6QA>unoMrFLYx!M)c^W8a!|}AFLGsxhc;k16T855U5zh#4MXmy3 z`%I$-$(38S4AqP@PnxD0wS+;`9LM+rOacr9;DMJe9{M#pdGq%8uMKssQJsSB3AfS&U`!F8X^%r-cp^?j(%SI}Y-S7zU8!yB`Oz_`1?uZt zx2HEB+{mkEM_;h%Pck!ls=3T%RE=%wUyfq*U9X0%^L8ms3sH9t@Ha&Kc17=pGahsoP8vVtB!< zAfEstvZo3O*apxDxKYH&IezyqI<5)Nuf<5JYmW+oHgR)=g9*eP*rOCe*bSltmM(D< zyBQ{SYPYViXQsV*KSc^bW!lA5kc&86AEJ&VVazhZ!KK23KH^IpTGu(f5U74ciK5fP zFhk}jn&g?VL?B+<7U?PQ3wY@d}zKF{+}5@*HdB$Phcc)7KAv{NM-&kqjvcDDABIC|-i58us8 z4s=a#^AqX-YAX~0k!>y+J6jGff&IF1XChw|)vZt0;0jdJ=+B7Ei z709CPD=VsE@hO&XK1hIyE09L5kXq9f$zBy!NfNELlf*EP-MzLGJJ&7$lb77K()1j- z8=~J{xbTNm$#`t|@Yft+5ZDyM)z@j#+g8m1;$N5aL5w&Jw@1jCk?9g=@s3EUi0WCW zDDlBeQY(brZ#dGD0i8+QSkx%aYpN16!kR$f&`kl+Nj|b@@H{PD0C8P><@)LQ?s0GT zX!~GqZ)Y2gau(WaaL4g=NAq2tQmdmBp7*N-bks2}ib>rBtzR>n1Jt5&!BSV2q_sLR zz461AbtARuD|tbKj<-1%!FRK-%-+29*%H z?^Poik@DYO7^>?dU#@%iX4i0uRj~(=hr8ljS94hv7V~m%PBC&p8(wAkq7r!lH!(X@ zR>12ZCTIimLXGk>2u^8p7KCnhw=oT8plxdxwbXvmfHw(XP~iWNN&%hdiNh$x`wyu@ zy$x!S?zzpDxol}eCf5#^Emd8T>hvD16std`{{D5%t>3+yym##u&1mDQ{i&zNJBs^f zr?)M>79BRlAQWNE{#l>it@UYR>tUsYt-oF2LEB}wjo*eV@xqW+c#}3|} z3fk9s6j~T4P#CaXVp*W*)Rq`GU$tHi{x35TNhX<&MehYl2Li)$7y+1Er)X0%LnjVf-*Por6}($mcR%c z*QzCkdkk~<-CjB)?w>(Lz@{EAmLNM+sI757Ml+}%{o_F03^y9@*FKRii z)G6_(yecoSMnh=0?yv_RfBT8@FF5kvu@Ts3RVq>o_k1fe72C~P^Oz+f-|2#z#Ln>~ zF4L2Al$O^FZC`-#St(bU=-V>z@7z~H6U6WLc3-_des{EU_+smLt9l@MpM4z@X16)3 zS?hD*X$F0kE;Za{cohc%z-%;X&TY>_n_1O9X*lS@7CA0@;_99?aqND3=&YPI9F>y_ zt3B}#(#hRe)k!_8>JMMY4$p3VSid9N$KR-(b5n8CiH+Ba5SuV5*#BxUFux19jlm!= zXd!_59a`gf^$s&&7X1j%p%ty&p>yb6SvDu5HD6Howa@ z8kAiZegsa6rj+B+Fe?*o@pKAvf|0gOGi`WF-=22`jjE#7iD^Ie2n~8tif00AQuYNG zhz5k-)-YLPv!Jo{&L$n}I>R}o3(>k&y!xNCjG1%wNyEp8M`lA-?5Z^raf409Clbb0 z?{GAh)u!b3Oo11W60^2VC)orNe*w~!;lb!*K5SFXU1^Nr2DM$E`+E{(=|)i61H-&it_GcrPuW_80*pQ}vylUoQFYkYE1YmCxOf@(U_c)jn z#JQPR7;Ol*fHrk(yKNhlTKh~K3`k+lgNgO2nV%J`u4z1|Np3K<#JGm|p7^B5M>7m; z2pgQNe@Q!X3Tz^-1Lzx!O}jPew>m2lzK8R9&)AVF=L(rTB3G*Ni-9SWGQ>#Ws1t$}(%mCT51n%H$USq%>A5Ew!P3pG21lf*$|}!>4wU#8Vt6DM0F5 z#*8??Bzu~?X!=x6P1~j%rdtg?CY2G5r#?qQ?Wko0woZyY^9{jjf8}*H>C0k;Y;g3d zR2#C8tUK1*d6Wr1&Q+k9(V4{4cwB^h!!W%vgWHD9Gw4K^CMlKs7So!dXBK`uJ=J9z zDFUes99UtoLbD3wK*iZZ2m7=e4$nJwj%099J|A21y5*-n50ae+-+`0eP|q@f`rRZb zV-l2MsF&$+p|hA}V@vWgt1qe;ctwX5Q`QP~i&SC;j=EI_5oUQH#MzNqW%jG_M|xLL zm?az_4n7ILea4Yi)6xOa6??$)vkN3#_2EwB(PhP8Xk;^Gk>( zk+OEvxvDqXQf0nOqsNqvkB}vq<%UZABWzB+at=wfYGtEcd#q8es!;in27lu}n5z?t z^si&;$bq`5a)Z~FsjJ?pc`mBH8gRR&xR>wtw~u!Z_U)w_98BQ70itKMgqQP5kQ=qY zS+-Kl_WXvh)AqJ*MxY#IlpFtEj`d=;BwwSr$ED3PmNO$1Udr`{O*RE)F#NRJx2R#e zQiIE6MZ0#;Ua`Sc75GNodwN8I%<39jEX70Rrb|qE&Hl(&Y`OyW8cNs;ix@SPF>EM- z2HNRlhq~JBhD_U)mWR~_^=h5$(AUY@&fP*|y03afcbNSVUSg`I z^EGCF6xep$P2oIjP&k_vUv1I$t%q&PYp&DJ=#H^FBW_-{48ryktlwDOGa&+w=UZST*VZgL+bFrd<}t-VL_B-)B5 zNL7dE_{&b2Mg}=gt_ga`d{3tZBHS<-Nek$k+;5nD21E`Gs8iJ8u@4y`A%J`FG(DLC zAwbASQiz+;LGN*SC#}8hYzOaR)_r&r(<&IB0pCs#QKghr~+F6jm={+wf8hp z3%cB*TctFM9xnrx6WE47wJh=kB9w%y1jGBYCo}?5;yPK zqIMvn00i2!=LVW5oUxxLr=XR`qvHxuHL>9iuhG<{8>D!HMfYXs*$yL9aNfAEqwBfl ze#8#jOPa~G^{ZnAUEo6p?vf@0xIgZ7;g^M@_?3ooDeG;v;X@71LQl9P1WL$yU?anQ zMTCW(Ls)Ph!PBFzoRthV|brJ1qnsn$8kb*Jd^?V-m5w%Sfr0 zK<(ICi4Nd;;4&>JV{IZ;2JJdjUtf|^4(JH%T-lH1S*&V@*gL-@Q^UaxhxRRcxD@!_ z^fG8^MjRZj(zBGWO8->)2uRO&j}Ny10}OpbzEO7B-k_KSUw|ve^0VOxB>MZDvE#YX z1vzy3O)^o3?cDxnUEVDBa_h|h*p%9;Yz>_u^K`3N25slHr%xx*7+f?#FEKV`KOeLw z9f6ABTWMdnI)WBuRwFmcPuDS6p-e1N1il8S+9cA9P}W8Ky{MOi$|hR`UoqSOex1Zq zZW3=6R-e)nC?j<6zC=UIJiC;&P1Jv)@_jk9b_(H|xNY3g>CAp_NO%!zNz%L_Pf$s$>JYO+@_zSnh#frTs>@^@ zG;}`QD&0tMT=2>#lk0}!n~knv2+OIig$yjvD~-yYjy8OMgfVmp7Dd3ZpbT~j zV<o55Y-9){Fh`_Q7mH~$Kt}TE@M~gs3a)ztFf!$|i!LN5;}j>9 zU>W!EzsqZ#4kG1{<%ikVU{q|@FeU21_l~EVG-s_5EU(Ofnlr)ttBxWj_jm|VGCYdx zIUvwlasqG!LS&qEwD(r6qS?i1U-&bkO7HeSFC1~;4VxR{C&3j61uV5^3RFx zKS@V;JhiaW&L zxIJOrVxR@J8ydTw&BhR26Ef3q7p~oT{kTDBXlut&VuaYbzLmMy+WXzJr2`YJa_UB4 z0f3u-F|02{CmxQ=TSarN`@4vHsLzR~r<0pobIZnH7UKAbMwG!+i>E3cDkMG z+6a)-KA8HWPAJI+>F^Jz@!$Fv;D5)H^fQBh|JRN2U)H}~f28og*8%@~?eSNC;D7%f ze;WTAC!fH-w`N!ACn!{#WjuI*s)B_DOhTd3 zA*>01j-GD9?|#b9T}r&Lu;^E|*x7Jegz^L4NZ=ToRrg$AVZfV?*K`MD^>^Pei|9#0&7p0i?vT z@JejAbjQ$$O^w&!XR|lB2GB#n*~vQ9UokdXn_fL7{_)Mbz2n23W5CGLrAANfNFu}L zecQC(0*4EA!35rcG1yQWPR>ZzEe{(|PcF_}24AtcSerMaAYMF;+IC`>rJ=CKP4jqW zqi7MP!0>hu*4@^YX0B0-PChx#%`6ONeYUzbivfeAp-mOcFRo13ISQ1!D|USaTJ7b- zIe3&*ZIP&rh=At|VFCqho239IG_8W{{t*5$TB`zGf&3Q-Ct5 z3!u7)>bqzvTQsF1Dy76CL4nMaB;8-}%}%fw0$Xt=XMPb~P)l7VW=+RM&_pP~jR!eX zP-DAPF+hkR_CL_qJ;qDG=dM~1RP z`r7ugNdXawK6nTxW=i&DyJR3_Eki}i(IY2I43aRFN+dkZ?@IrJ^B*mrK6e1P`RD)F zUw`%Z8$AEN`D$(T>(xha{y+ZukN6+I%bz~~dGd(^c!4%>5Hw&qG-t&v4}3Y{v8W)h z+xEfX&g~*`aR89I=v?|82p=~`>_V=_V=G_}2Ct~=!Mi+ofyadZNuZnw<`9UyelKTJk# zIN4__qZKe*A58j&Q%rk!2AI@fGJr8dmGgZZEkd9)v{_vgbsb05%jzL8Lu>ixlD}X8 zXVfT;uA|Aw?4behF>khh-2LJB_15zv3IG7c6d2)eR?NVJo?}-C;L#wxNDELIftS6) z&Bp?*7l3n80OK5U=AqF$28Jz?zt4cnKo=?m(|ia#WWol|rtXwb%F*?Z&QZR2Mt{K~ z_hStJ{`nZz0jV})al(@!*c~>cH(U!GuJDnAf<&!!*s{)iq$H)guohYwwaoDkOztdm z3}9}$;(RRx!_{W?sso=EP$Hh7%64c&5|9@n%r#$^nK?-DUJSKq9G}1$0V4}~0+8OP zNe0?W!C;l348);`caoZ6kVxqAZY65J6+ez?G9rE)oF2dpp)5!03Xt!-N%5<;gjoU5 zW?YP{qhj-%VV7ML=-(wsHtEw|0Y-he{46ktCvQGO70d>E8kz6v+xyiIE0Q~s!VIgv zyvAnq;H=}^Q%({y(fWFwH{p=NDT{&pJr|ppONOSV5#IyOKt~I;KGfs49C4lC4hU?X z%q~|2KGO0EJwZ;AVAk18LQlFgCU8{53<3;CK+5oa&EOdkCm6C6h72Sj(*+Ke$C1d> z=s~pBSd7W^Y_n1rWWhP$_M{-9(q-eN?eGRmXg2h-o~yd%Z3MFuBp|mI37_p_lGGDG z?F9u+P{0dV6?bdc+8}WRT(XdQ#gV12XgMNFXv&UDL>jD+Kg&wO7^mG>q*L-`P!#u} z#HW4*K}n(RdAq~g5PB!zjT1*Tsv7@)8!T+I52_29Mt;M4=D^}=-?mL#V3*$K9qO$V zdiUUgSuEIAax#oZ=QI*Eu4mQ|QY~fGwf9uw2MAbhcGKSO{?6|H%L5xw-L~<;W>k|+ zoKUhi(6`?mC8m4|}&rkIW)%nPY3xvM`(M zBnZl?A$UkBe|5V+!RzdV6)yvK@dg(q@d$2Mz{GQrkW7FhTf~#OC}v}Hnk-hLEd*O? z_0txK#Bi5hk`Lb&HZFyuWspNRv7pH`H$2H~Y7Sxuvoq#c&(M?E zXn-fRX>!S)ePrg6PhnKp3;S}KmZYI5X8kj*W3b)sGlC3mW5a#q5YpI;(8(0TzSGJl z>i`;l7*STa815z^%!6wg2O2&&j?G3r&GUgnn#n10aa?-mCSEmwk)T-~Mcwj44E+tm z8p0+4I)J~;p=6jxu_q=n40OYBo4kdD$At1tt~I?bKl5@!XCAVPYr&p7%ky(HyqQ@0 zspmF${-0b!oM(v+5ExVETodXkn9S=zEX1>CL9 z5DTTm*f$t<>2eAj6x4`4?W|C{#&L0un*?CvaoO5(aF&~vIVVQtX**dtT>)d$zQ;1+ z8N=J&FvTTBdm-mv(CnGD9_LU{f~VK;o&xCtNrbVWUpOi1P%=rhzy=ACPm{9%31vPU;`kQ!SfX^% zDv@<6g_bh&TzkvUux*?8af9A?O9&P`{7W*FUNh~z&W0<3t8$iG@B$M+2k?RH{CUT< zQNhZgf&uVu8l%d9a2w3veBVp1lK!k@J4uSGj3aAD4t|{0jjnfoa055IGMG7#?AZDn zi-1&fi=h#lTaGuljfF8@K=rzNlw2euT0EqNS&F9}>xm4cjhq}bIg?4iyui+Oq&=(R zE=gieJ4;SuIBGgnk65=sbTiPC<8&ffL_&x&xWP%E87|pytwb&Fb4Ppdy@6(wIY z<3MN;9)~%hX#P^}xm^w{y7I=7ueb z=xAhiGaxu`cv4`DLmUmo&wg~PfY<=NbX;;6;lLQ;RS(9Oe2?ep$(jb6o>4UNdisEt zx~>iT;E21=lE_5h7(W#^S!b%wouIY$ts7&J2<;+iLt{-tp@lTKu-rH`H^KDtCD1VJ zHoU7a>{*p(r%}cRVkxq=f0e;*NyMHO)?*t`E&xd9x1dMs^;Ycloi8D*|a=Rc79Al7u&)EUw0Nw zYZu$wk$SVCgex`Tb*mB!Cszd?QJAcIYRh0h0dxqID4NC*?utH=g7s{twcfDDJC%4* z)7lGHsyMJIItwi|pM#mNdh$c`CKlp^gSOKEWqhH1iGe_=OI@(-vmuHJ!?aR{ogUdr zOi~4&0U|R+;5DEl13Iyabzp6WztO3bT(d(oMfDpjJ7%@x9c8~tlsP>R8_1FCF)Poe zcvszur!9ZW&{}Xy2h`Snm}XAy8m-6~T$;-{i_N?5NP_HQAv=*5qtfn4O+}*62E#4* zk8=*?n-^^Hi3|2lV|0tveaArzhtL~9lStX1EZcKVUKyr}y?Q5}=hCePQcK6MtWXiw z4hG6PLH9?FEAXzF%m-;Z^pNi$HlxMO_uC&99iK*ad%#TYwdq^OeN;+fQZl7U1?=^Kxhj`zL#L7sF>-L2%F*!p!WTEcU92q+ z2k6^HubAo}O)9GOrU9E&URDOMT`3<$PIFp8tYAE*%#_D;^(2K}KPsb%u%#5~x?dQ{6J`y@01aBisah zpKP6B!_FCY)TXzg5%sws*9bKvv+f?n_jBK<-vmRw2mFz4SXJx^R1#Ht-OG|oXapUv z$)yShT!Q9=PbwM{5!^igT6Hj#Tn?BLgQ_MM6g>EneFzGm*7t+?O*L2_YU4} zAH3Ls1rF8&?^i$I?ft>q-uGLFTZgaS9`3xgG{~Pg*-mYzCa2A_YBQuLIMemrc{<@+ z84t$JugO>Svz9b<0<1%7N*_EBKCTYq&h__}jTUtgGC5`8T|7jz3L%IJsHV&s3NqU@ zfeZ6Jy!-%UdOAydVXr|_=G{*+{ybT(YQTWI5!QxDhem%g;dm2$o&m^4u&PkZwwh;* zE{c*i6v0}I`_cC9(Q)s1Yj>~XQMb@U14cvZU%HXiBxq%UCqxKh)C$&%HlsTv7+(5aMlGXt)sraU@i6k%;H zUy?es!((q~p(v zpVJD#;Q+a^7Z*3IC`+D)mJ;gJo*;Yc;hTEBVq&B&AR39$;nu#r0h4A7%W0ey;P|#l z%~H>5kZV_u&WozU^%Z#o8+OHhuPmh-GG^6`w;Gwf))Vh}XhsUA;Vd>n9YHp-q6F!p zniH?k0Y!s;Qc+2ZE$DTsTT+#J>DbCzT^x1P0R zF{57IElIwVs^~o&i))SaJ={F_(dkBu_AE`VCWi4&1|lKRVW1crM1Xx}wIFrUvd@Wy zf@8|-7sT~SHyoOt5y${q#1K8nbAWh8p)AJKMVs^c_!xzSerWB5^{s;(- zyC*28{j+JCzMIwB@l^^T=Z)3P6)&oV?zMQ!SA-uVdZUi4j+^dPeiOD5+Iw7&Px6uB zPImC>knwOn(McK2mg^ZoGjPp!Js?$!y`7O6ZZv|eH+W^xVB)_P;q{`jQzVqwsMV(+ zPg(*!Z*Ez?kvX+6v?Ld8M)%Fxd;Xq;VYyq-vDVHR5#Ov-4voZbKq&wkjE^_;L12Yz z`!H?pgN$r*UqVVp=P*wh3GQ9UPD734fncT4ExX@x4EPtg!hwr(gsk6U74pEe6VG1i zo}Cl#c0z{k#vzHL)^^Jx|9~;X;dd2_HgAaL%rkUQqXah#B{-6%eMZVO;$3gMEg}{G z_7EDq9Su%%-cET0;8w&8m+QOj_PGpoKa@4_O0Q2w7H$oQ6iq}!)`{sMyH$<1tx(jrRJqH@OhARVUYHYGdD{POk|jb1iD z_?^>RQ7^Yl9LhOocV@qctx;(uw#uxy?9?<0+u|^??W{P)2QJHSYBUCo#Q4Bzb2Dbw zWSJD@n>TL&gP}%ILVfwr;p2%O?Rj5=oo~cmg7={qc%$oxZBUrGMsX9ZXicMWc~P10 z-~>-^>yh>ho5Q-rC_0#ILr3!o?L29AD)%QKTDwiT<$a(5WlaX?F3d2<>e4-_8F(iW z=aWDlK6u;PJJ@=$zq|K@6*gce=AhpxR$h!6v{wA!q@@{KG-`G2eQw)}#bY~AnG8nI zuy71Lg@4Rb96g9mZY6G;1|GjWINaXavn`B=Lj+tyXV=pLt_Lp?)C*}-Zodss?=z}* z{kHXDonc#yh}hf~9yDsu&5gNjL;m~CTd5C>qO+E)23IEqKcKgUI@@hFZ@!BE_9hIz z4ghQnEY{IN-OQ2uY$^vTY2!%{Z*55tnhO@>V8XCuvO4oD`POU35K!1nMP?yTc32ts z=9wbfiha^l1JVg1Jvu!%bk+{{P2#+j$b=YGXc^M%t@^nHLbQc+2=*4Q@Xf}_rAkq* z#v-JbmbA(t*9Kbb21A%|VV*I$<}9{BShDeFNC!_wi+Gxofa+Q2ry6N4$u81qPSLVj zy`BB!~CeVG6DgvQ3Nl7B2_E7YCT45<<9$ zh?au4X5UJWE`vMpbxmO@7a%7X#s3^L=WO|cC3#|H7`YU&mPalBgr0k>m}-x=p1*q=_T~H* zasmBWcK=+l`+noEhSKV^s|@q%+p<>~*W0(nlOb-|p4EBn+0|{a@|-wfV*QJi^6frv zEcWH@&fbgPZ^-9%5#w>xb<-n}YF$@rTVx{J*kxcZzYEzYeEDPDCThcu+_Y(cj7t4i zrU5t6J%}wR+v%$9c0Ib!1)6uI)gZ0M$%o)tM23Sk9X8cQb(b!REUebVZS=~fqenY? zFZEDN&-GGHo920uut_TeZ}}OjlxRe54Z_M?-}~KY?n-pl>N}h>ig!0ym0e?H4e8XY zz!O6tP#3L~ghleJNK5ifI)Ff-m-+O(AW%h{9i%i)dvYDv@vWdI%OOMST#CyPw!$1% z>?*Pd4N6P!*v+SlT|0>A%LETGzvv)Gi=1BzmjM!R3L{tMw&;}xHp#n+g?`p*vxDbxt^mg}O?EEMlQe?>09oBYak7D&^ z*L$k1X@BR3n<{(r=K1da6aR5Hc>d0jLM#~^i(o-_^#R$bspO+q)w}&SPi)i7!$w_u zp6?$VyHxO0n{01q-=#7SwTZS5_P4iGY4lv1bmxCuvYr3&l8_NbAE5wX)nV#gq(%7i zyDno9T$>e!iU3eO%voD|$4}I6y<~`2e-BQn+;7QA(d};+g$C--TnGH z5r}>WC?V-D$+TK&uXoxH>echd_IeWt$ZZNWrJ=8mf2&*LwOeOE1v;I*5FsXTUFmZ zd>Ozc7Ng^n9(LuD`3GXyG_HyXK<|F;)O7)SWeZvjjRiy0C**1fnX5jg0 zWMK+7;Dyut!;(VS2(SonIjlG@w?b6EVzlKZ#WUs!w0eb|bsA)tgg(+EgbBBLt`)=h z5jUNo4|jAHPbNub(e^wZMKKx=6&nBs1*zFF1j(Ina1&D&-KdLcndeX+=&_VXj0eJd-~D(9wW{uDz;NMWdgjqqYij2C7TMcQoi>Dk z2HLq8wZAm-)0ai7V`MFCwz}J;CH{Ptj^Ko4;AmW_akMyavB;h6fL;GxhL=E4t3|5` zZe6t&5s*@X)wZr%i%o~|+<^{=hhE6m0s3CEBj#izcl`ZD&B3Ojsvg37k7^eueg>j;i=`^3Jbu#KfsF@N!;S;62AGKQ{d*3p9#q0+{s9{D3kyA*V zK$xp8?j$>E)j`A3Z!u`U3!$p_Fwpz4vbs$!%>3=#of$px=W?TF!WW^&MSmrGLj~p| zcV1r3Nuau~PU1n-GNra)N3|KJSnN%^(W#lwFAHl$y`1c6d-ZvSMh z@@Czg&vJ}z>3Hww1^+!0GNhA z<(iP}5Mcy8GzL3lq$3b!OqmyeQpNsm)JQhPfW3}*cz9h@RB2&;>tSq|ZOFCDw^2a; zg@O12F?6VW^DQgdP{w^oLU+_J_YMvY_t$q>I+4Mu-2v36FAD+KlIt%cV^bhBJR250 zN^BZfyKn#}>^Jq;J0jN_&dAAHg$|YLO=;IXbLsJ>2GI$z=A@XS4JMXZIed~)c* znOm;;I)Pgi@+HHse@P`^Lu4g_K^(+7d4f(xo}+&rwal8uYu^eAiOF@7Fk$j`6+F$f ze|yOyWx!aT9ViY$5xs{+w)^5}_isBN?C?(eb~v4{Fa<6Wu$n2@^|SXhJUHV~3kJg8 z((y%{;^Do4c&UruE+UT#Ap1-KupO)5=hynSwLy<-`1sRmE0Do!C6_OYCtnVp&|FY6 z$(zuT2XArX#F}q)7*NoEa}b*(=r-`hriU*=V3(FrL3a}ED;NNtNGV`ZhYq&Hnv*R* zf4spF0dy3SQZ(reKn=cUhBIo2r>C>A4TIQ_9Wr$z+a~AO8~VNKs2ga6MbK|MKOP@$ z^^T6Ww!c&OtS^uw%JOTtXb-Ae@7iXfdR1Uh*-8CH4=!UaF%#J893CFN+pn8V*{Qb* zV{~i2%PbFgr2{H4(cLCrmsi`?k(#O>Cq)sTCJ|!lF~TBt$drL_BW)<88=1D?Ji-Fp zbnE#-Eof{m#c-1QurU}9a}82zk`3A%>8UD?(vlr|*REZnOt>$r#K}#YrA5#fq&dEv z=THKwzLN9SD9w7!I;B{8jyCFrM(AT7<;0WCiw-JHCUxN2?%B_o7ZWmQ$6y+R6hgcS zhBoTvFsyT(wQ(yS4NP9bAdK>1iHO}X1i}Qr8dox?@lejn06rU3<9;g)A2K90FcxU0 zt8}2p@TCh-pd@~P7|}sk@scDR;`v1?YK2e-rg^&z_sHm?0J%6cD>(*`(k@djGz3H3 zO|WR}lW)BSU=UUGWqd8@;ii?RU`A@Si*Sfl>kqWOY}wq55`lxjXf7~>wGa_^2lri- zy?}+9C5H7xPcXnCP@!)|qbQ7p6*ZT@M1|FEsSVXDpXP^Rx7H^pD7=kL7*;au=-FdKS8=@DEd_<@xQ5XiK8?~a_99{GrbcV4BS!YJ|)^a)yf zj|Xv>s};IoyB*Gq5&K4IKP{y-(vLcX5S+CRbgu3z4M@koY>fMicJ0g~aU*#qE_lq~ z%?Nu+sN@^~9#Oja;T7Sjsi9tf8=E=mdur7WMJNdWl^JEXL5&un7O zVFnVAVJu27>Pzgo(8?x&mxg%#h8$sBYJ@O`7hpC`mwiB2v1AaKlM4z$?;&+qY8f5D z{Z?|-PbTaSVtqpjj90*OLV;P;O)aq1pu7SMQlxcK;;wkBV2muGqEHm!6SGt9hTM$- zw@Do-=*}x02xM)0i)BlY{^$#rN5ISkh%5NGHarpTsvIHzAv95*pOYbzj}*+orx$_V zk+Un!EvcTmOjC<9G}dBxZVZ}WgQCfru}ZM)y2LQ6rCb?7Oa&PCSKB^{IxYlQX7${V zwjEj$n%l$kyhe7C~-z5J8oYUBz7w%ex<8u;e#eN8bT`i~bSG-#vUcG_A+ZYdOe<66 zmKheZ8U52QM!0Xd!X3xc^I)#mWM$xX#LY{c!FAF8{!N5piQAImEDF46$46)UA}w~0 z+e=|g8jV&6OAd0ABZr|J4*Pb`#miHd(i)u~GP}|9C)r|Gi!1~Kfa{`*5m{Ed_E^SF z(nMibZIN}e&b-OPC4JBkId!zu646veDAb$}@mHHDH4CrB7(;ywPmTDV^u@w;AlElR zazn9xfE5&?^fT}d`7YLJDT`@N{O#uQy zK(V5{Z3pWd^WggTa5;meXMw{7Wt{iaEE@o)!J$5&A-F~Y3eB5Dd^s_bjSm7hkEl67 z7Q?*;OCZ>wodz=SkIkr#3gG_7M^j{h-(9q5q3}sCW zLG|L7G!LQ*qPC1EXS;yVsYNGxrbyuDz;nS%w`Ie|K!6SvaQe5Rx=_O~?ELZT!-F3l z($B-cMiLv=u$&-rqnERlG_6*CC3=qfI5t)8Vp>9gDtKV%4##F?7ZwV(gMt@!V*9~^ zh-Gw0-h(J}W??_<(E_JThQT7)12`rlnvFRI5C_1OJe&m`5iZk$d{X{oj@~cWlCteO z+<_?7=0y4xZA&4Mr0MnglhLez|DzwX&fI%O;+G7x~ zli@J!rwK%HnKv4eoBDME7Z*(fV>)2^&$V#+j*S8nH}%^5+cQ6~k43UTe_nsksMg&$ z;Y!4ChrkBUpUk_q{x>up0wAl_^R(5y#ZDP69gZBhVFAuox`UT^0M39qWjMPSw+#D% za!bwYB~jn=MU6C&fDtb8QCw2ADhr>cZg0@<3wS+%b&{w+FJK<=yEzT&0=<}TL>TD4 z&oJ$!SU`!h6({lBtoTCf&CVO~c;fpatV@~PflHgh-lg)p5xGg2JSIKfagxvvl*f#L znC=;JWInFA((3(hxH0B`&Y7p7UNZnkJrriZzX}bC7HRm>@Je*?Cbu7`_TW1UWHL$m z;P{50&>k9%z(zURsfi`9H!vRRGLL-6>Mr~{x#l6T4w%0>F-|UG_2DVgXf-Sl8Wro% zZE{y$GGsNEU4GMYhrMBy05vV;I8dTSpyJ60KDZHOQD@F_4R5;h>3@$WHb~Xk6t3pM zgv7t+R<@ujn35W2on=7JQ%Z6v-1qqqRiFtgKyp-Rz@#aDM5LBxn8?+ z`i5WUuABU7XDbQUD=zHWG+Cy_VcMu0>S-T*D-Ids7=d#(z_N6zqNMPMOyVrHF)#6< z4uQJ{V37W#1gpVB{f1wTSAa~oh1iM57!mTaZo#Y6fCWg^r~@5dk$q5mY1n}mrX!F>BEqTMsvTB^jEL~2s||I# z5pctyT=i^!KZ{@0ZxT{`$wH)KAmM<1@*4pt{lXtAg9Jn!!gVYW5!n}={GiOc9PS|C ztgQkECZn3@a@G4981Q$K?*VOXHra4z1eFVD2=RqybwsfVB;`pTc&|CBIl;sQm77gy zq2`l>Jaje;m2|;3@$(FVqOCv*j37q3M0k18P}OXL!QD*Zo%--~^W%G3?ALjnx0-h* z3)YvcIk|$0{pi`6;MAh(8RnNKk!DmTyE3J$>iSCsh~-Hf!xhGbV`W4a|oo}a}8LTO^e z1>crXNpglKKR862It74HvPAsl5hbw(~s~Z?a@ckI9$?agnFE z32?9HujGIHLz)N527lEvl-r26t#zP760A>Fp~AS={C21<3(c&XEy^ZcBQfEP4C;kR zL#E(#vDQCdp*uxv@&j%BdMkr$>8ziV_!2au$4*!JU>6r{~G&y6t+$ zR&~O#d&_zlrz3TDt&gp6_+`jXnAX_oP~wtWYED>r(_`a$k&hws#wo~lj{F1e5=0{gxd}pJa$t5b2-Cy_4X6qPt7W28-~oVNH=Mq@Yo`g0 zIiYK$De(ysw56FEHPfLcBIK`SO!dsCBOPVZ05)L6X8Sm&!?^TK}0ifv&6tzk>Jq4SCy`mhFZty z>YyTA;iI0S@^zS1+q$p$3icbmV~aL z4wnPgp$-etTnZoI1z1>(>;lU&FrUYSX$EZfEks4~{#S4*W@XaxMW$w-EO2q)Weuj% z;liCE+dUVxl!+E**{mF>-ciU?QRpoS`NG}Fj2l^qTcVz!L}Hm7DCa3zx9#pz@l3x& z-6rpu_GJi35=Y}S!)bHmgI5O*r&}MpQZptr>tRe%jG^3*&}y;pW^_geg!xE^D6-483r$ZfCj+WzT$!5;osAZOZi{o<>)?+|B#i+a( zqgxA(8v2&V(H6Cnzt2dJ_BXv}bl9Oz7D|UkXgO3mjrM><-bD@rxrn2Kn@ip4of+xx zyipHBSVgnKG9mb&L?P2(uy>?1!ATK4j2@xMqxbR&7q}EX+PEi2spA>MgX$WO*ZJdb z=9b8~ER7oG2D&eJYm2--sMGd@MlA=nsUnOaQnq3`ooj6Iof{_ zDx8JKI5kX@5va_649oc@J~tybn)9DmH<*2 z(sN3Sl9WNt&jfrIPMm@!F0Qk_;ZQR}$jnq2+CiKoV^+DL#Rk>gXhJ8t*1PH^=^JCK zNK84FMC8#q>c57{*iN6jCmaX9H9N$-hNXLnrn2_tuW2L|U&_uD3eS)BLz5Fm6iv!0 zcsBLuez;MiFX2*9Oo?(c19*5A&7y_(XLikzs_AQ^MOCHm6R5(@1cp#72 zv8;~cEVSWw>e_0X_MnEP^0n{{NoiE{CUKrRB1VZZf8k?SHk*Bm=TYq~a(fB4B3^sO zQ{`0erBXcV7v2`GZSb1AL}GolYP?#cWBQJXV&ee=r`#T3D{3FZVx{VO zM#LI9qq8IfAHAq$3AFg8fwjJPz4U$9LNza}g{Pq4D^-Gg6DleL06J%eRc9L_?t9QB zkl%fn0k%z%c58pAEsVG-fDCSIl%at=7^2N4S0s$bOk4_*VZpe*jrP|4J#p?hTM{aB zu18$OH$uG4c)$rup~Vj6qL{MI5rIpCIGgYx2);n(e>xs-r?ygY$Pniv=b_fH0$C>V z)*u>}yOn4W*dK}l7F`;}ceA~pmn;eqL(ex+>@G>l8gu-UT7`XDc!jcR61~izt7LDh z+C)-LJ{)>Tmwb<2*0Byg)+Mq5X0v*BQ8jDtaOYSpJv}HD`={U~J(;146e*;v7!DV+AYwYc5sM=P3fQ$R96i$`Di`>8 z9-9?{@57Tqu4zzgV;(rm>zV@_m3399rk-9yg~xBgoyyw@1JSi z2!R`xE0QSRlp>pmC7Dhxy9<6M)6@ehR);Bu1{sEDED%Jl1q7hvANQmtW=CMHfTMub zZneKcp|u5jv&Hlh^bzw3+%n|n>xdL&k0Qzg{H6PN+DDiSbEPIM9@euBo%vU6g zU{hY8I<83IMadxaqn=5HryrhO&=o1Ic2}5>?(m{t)N$G>{z+tt@$T})KHcUZK7{r3 z-mpk39kvJF`>j3^8&NirTePlne1NC7fEWmB+@j zFAZ;1fs*q=j0bpCg^m*@jmu?~N%pQ(&9z^)+c`Mm!O^Zkw^H;7|5WOo48EyEl0Mb6;o$O?nO^5FY||}#kQL%8$5(Xn=hXv z%V-1b;`SB(Y?xD~%rVI}9$37HtPOc>5#B_hf}_^4cYE*1^j6p;d&P`Cy+utCMog#0 zK?7nx)4LIb%)^%0S;Jr!-yI*k)iKWMT4WIixJfo?z#=NNEn2!=jW$4-Pd#cx%j<#G z$RHCyZT56BxUN(V=4e^@1MF*7O;Xf|pi)7{NgQ~L<8t*>r|{>(VcGRIK!^T)UM@1{ z{-{XeO}%n;Ah5fx-jCrb=9|b>EdA=4X-(@RF&6eq6!=xp$aWID)Ot=s(YgB4O)G-utD9RR*)0XY)5%t+}Po! zdx5~rS6wAkY(VNv`Q|8ky=!OCc-7l;k$PZR_~?4TBvYQ%kwRJ4uBmdHkb&M9U8V%> zkZca(KB}agNFLlT#FLb6V=^$bL_(R#;Ml{!(qCv^o_jn3)wP0p&Oy z4KT=K$x3jpI0Nt~*oV^!kYsl}mslFXPj;)7Mnoy1(Dv-Xr;H8xISNd?d`QM3!Pomd)xI zZ9CqJsxkCbRQa}|z3rDz7?uXo%MVW?v~M)d6@&(JWvVy*I~r)1V8r}p|bB%@U4GR>~gQAu2*)b$MPS+&}> zYHHM>5M4ReVl-Gz2^%sFm&ToCRNPPhw zBZbJdip?onZc;!zubDOK2)G%PlJ_bd;prAVz30L2qQh;{YH0f9$<|UmMAlFq(hu zPtl|7SP~Wt;F-)m#&{l#v4_cU5)OsZ*!U`_b455F*UNx_mkE=;((l>4i9TvzN!hnL6y{lG$|CtIfuN16YmR z-Jt$4(go3MH%d2V#!{TEf|yZ4p2=)+AH;Vs|1vNB;6~M1)AlYJj}MX_k==u?k4z7PZ47xH^?P zDWB8Q<$6M@C@m}Qb~P@hTSL~Hl2Z$_`08-y=*OCbwB!ohf(4Z4E#(=^oL!~>X2_bV z;ut_L3!tsL7BDXqgoh!mLv;XX({{H*z4U!BK-@0sfyEXyKZ&FKBFC^2DG|b7YIBh_ zLP{cD=whk%JQIpfd|h>-Qa$Jk%@>b*Fl9DE&;Ril{{08SK*6ipP&smwF*Do%0%5P zv7K{z#1tr+{m1RTH%+%W@{4SL<)j#E!iTn!TIaZXQ4I27E-CB1J0);Z8TsZQSg(rd z$1*{}s}h1#V8l{9od44iCUO_EZV#iZEX``Lph(fh+8cB;y1+5CKH{Mys&}}veRS+% z4@wi|Dbz7_F|+I^=AC8cDBn>u2ttwKajfrH>T_Sk5t0_CV%kvSh3vCFCRD(ZARb36LVfgx**9A4x+D@L|flkub{?&~wpaYat64?B*sbyn5;Lt(mZ9yg6#C6&dk( z(Zz-rl6#Mh$pC(irA^M$2@pVJa?f*#?)GJT0MEJZlTu7ISIkcP#;*vIB^m2-8(|?6 z6(Wd`U_g8m+;UtHC===?k*qULNHERt&eiVD_~JWBky-8)kmcaAV(KYw3Ns6dY!JdT zoLaIax+J9iT2mVD8m9AOSlm3-uJO2mrdTgk86?<4tVQ>xyTe?+u z2qZLqVI~}$C1<`DFSwwOIU{zpQB)gSqTSlN_O{fg{n>R`{l~!Aj2w*HXsLF^SF6_Q zc=k$d0+%iqG}OXcfWc&1z1Wu?dc8I2 zC3x(EiF1WelsCImDTuaEtD)KtvQT1XnEVXGSGJS(X)zxU(&MlKfcz+v;lQJC4H9@0@+XZol7E{J^AotJH7)y%Vd5u`r#2{K-xa z6Yo)S2Le{7DmGP&_`@QSsCeqWU{y7gvdM?+j4RUV30G)>dmFg{X%N@26v0)_Cwqfn zHWN&uBbR}cIuu7h4lxiu^M)A#?H*p@dZW3{cg zFjcXtY|>Mei?oEca0k&bjS}ViV%#H1l`j>P)o4H^wQDjUAwfo!Ge#2&m9AU|vcbL@ zw&nC+vT^}sf7bh%{ll&EXXK(7WLV6&bd(S~aiJ8%7i)1u?2GppQ+edGT;wH8Eusfe zs*?Ix?jGl}q*N?G(*23;6jBrvp0d$1xGHSUh;EM+@(8qX#(ukHRz4+dydTly5T)}- z2LWQ$=)~G)J_SibD<*df%A{%S|J`&*sn4y3aBkE_ zbrEoE4K?VTY9e4Q4}PlGnos9rat!W-HQ{QDoom&%00qrGX}vcDAi~V%!0SwFopKtl zF@_i8Z04qkH>p+<@di8t!!`z#0k0lH%~Sn=#dY=iP<@=&bI~>YKx3BuI&RW!Ow3R& z;wNi)%7uKT2gc{{m%cZ%XV{AXBt&{Xu9>Fg9Ntm4(w>qkQS@4jDQka)i9i8^;{D>R zk8-^^d<*#ytTL<#Gy|5jbXw@1q=LgVP6dWe@BpPNf~YAPIANBe+e#N`Ofe~ybdE9M z$tVFrm{ir1J*UlKf6kgCNn{#Y*@_5qg|;0p)Fw0pDN|G;1Ii0vxU6ohp;h&JUEUs1 zKGt$n!axV5%cMCL$R+CNriGH9IWJ0FG_MRRb_>UCR;!dXY6=7WsDO>RPr}eifSrz* zjcUqEPzrR~aYfsZWwUxa+?B1jyNUR{p44Ad<}W11o|n0^*E+dH1WrD-Fw(=y`EI<0 zH1`pejjg+mEY0SfiKQX+Y5;u4X9?8;Fa*t~ zS)(+ZyX6|CTIFuaO4ktDyUh!kk%s96c~U)ezY1!$va|m{T?zPDxLN$_IRuqFI*3h} z7scD_`H58SrD`vWP5BFFwH>9jYnTZ;8ji4p*Bp2W;xlNq^u@m^K!pZ?Pil?dwWjQl)Il~(8o!|??q*4096mB!bE~~|AH1NdP${K_r7mFKbnbI?} zWCDq5Z!{lkg^E+j|8JkkW{I67aj>a7t&1$faH30-{z%h3MQ>b1v(PyK zIxIh@Rmtyq|Eva{U)${bvv>(MtSxdBVBh;*wGKkhrMcmTVIUg=p{ewoPY59kXqJ}H z&mbhQqdDEySeD|%IdVu2GWWMn6R@FlgG%04ifyv31z2A$l^YoL!i@kRGckZ)R%qTe zE-LgKjtRDL)X>WtcVNaIIsAd&VHjibyMud35~e8K%d^&x>~O>96>`H(ZpOYEz5e_-345z}@C=W2_IM`O!*beKbMZ%bPKMVQ@2O=vxMzc@C0J z!5XeG#3gzL17&hy2bV1}Wu(_!WC$aIVV_+4ESS`p(!o#r=hF_iy?(#?q3bG03Cji_ zI59+jxs6dG^`5M^5^ZEFrd;!?G_Sa>*+k(M+M8Yf{#RY7R{+~jqj}pAvi3{up91$<2R59Axi!gJxMW5=3jkX=z%(<0XWmX z%hpU9e!Z8Dc3dad^puSRq*3J0K*3`Nc%q{*}|d z0wUBg)D0se7aWiKM**N8_YwSqD9^tE{<=>A-qdo*BMd21CSnsK+?JnXooG1i`q(pV zXiKE09P~UA4$Xx9%L%UESU#S;%6YhZ@{ag41T3iT{3K?N@vr`Pd}9h08wp8*8gR-k ztIcHPuZS?f|E%ByQP{(C3x8g4U1~krlNA8+3SiDQw=>uqVT-7XoTw4+pni1z^-~kSR*kUr)dJ2mHWXm%m&2cICTo z%4z?b(dEU;`4|7jD*XKJ+i&sTb@(6tyY~HetMnXxUHyJ-^*3wZe!KSF_usF>i{GrS zJy~7*?l;Nm7oSPZ&m3(IN%EV~`EX%7pdx3}ba9*ig+I*k{M+u}X+oQy{2Ts_c4*C@ ze3ACg^D$X4k1~)TipdR!yYCk>tVEPkkmt%d6|eqnKE%SUIM&IzOKHV_;ag4tle9*I zV&%ML9{`I8bUJ!CyTAuDZ1R;9gvBbhC;JE6zdznzKkB+~^e<=YKy^Ds_W`BMCAAm) z_3*c(jjL(4`hW#Hpy0qbmShb_RUCIEV;yrNB(?q)U7?1Jb2(by59b1-=v;)Sshx{7 zYnqEr0Oq38vUB0x`(rVu&uORz8Dq zaUftG;YFblbr%>NTh5RrLG@vpbC`0Nq?s$`!ri4dYB(h$(eaUcRRvx;HxDoS^udEy z>$}-s;x!(kiWNVP*BocZr8O)+mj%GmvS}Zke-J{LUjXqi1E|r3OoR65#%4%QWxx%r zk(*5@QG&RQnicTf3!MorJq}DxKWaE0K2!%MQM77@ewL5qYrX?LthE1x?O|Q4GIM(b zfaXIXxh`)i(r*d0rslA(cLIXW}MK*re=)eGbXiP_xIgw%eD^sYVQ!Ws!Z;{sN*_a8sd zQwm@l&w4&DOR~l`_jWldpeMPxNM3g7*3nceoK+T;!)!p|!~ib!iz%DixyaHn$3k&D z2Dx=1ZKv3OpC_Tq1QGfDxB|Z2m83m%+1~)j6!&N~`&f?f zp}{eB1P8c6Ltutyy^lSdPj4vL_7!3oeX=v_CX7pfXxJuEYtX9q@{s9m=&Ewgej^H0 z$`T8YRsqXptfy|QVdtFDb_QtsvCHHfuVf6drnTT*P?o+g{CowAMo7^hUC{^2hj2dh zl5}j&HF}cubIE?Lp zcY4DByYhZ%(i2`%^`MJ}8<%$(@K#OOtsewl&Md(!czpNSYfcY6LU>9SBTvu$`Z2q? zbro#NhLaPIL#J-hOv*1j6K(rBb2*5sht@aN7^+1gspv-x>YiI_m#^_uZ3!>Hq#2KUV*z zo6kDHs@o2$U0mvDR1!k_X^Mry@2DPBCW1e8(hpQXd%G_J9U%x*!~9w`fb#fRHl2=( zmGkH3Q8^o=)3eI6yxI)c7d=Da7@xT)QA);!Ap~=*FhE)%^4=K^b7Je!jS_fsSU$;U z7^LCEpF!3irPFM{Nq_njdw7~9SJQkpgOiQfa^Sy{$tdrK@i!}?K6Q&nn6-i@vOQIW z=$oydPq5tiarYs4*K!eWu7!jbnGE$=ZZs3Z) z>MG00jGRv*n(eVb-JTD10SLCS#zULKlBlUf{@^d;5s=Nl=z_Y~>! z3ESB5Hv*=l+@i-xhe~wB3xk~; zX4HXp>WP*+)D#7%H9*g#NiNcs_Z9MNMA~)-gS+uuH#G8Oa{T; zq%YxAxUFHUmtYxdA14teXpr^}-S8+K?!4ZG)AYyP{g*pG^P|0kt(QA5PmZ@lIB+FVj4abAWhaj25y664%nr957yQ+3fAp^NMq-n{rP zKK(`mmdD9_g6HbmFswtHk0)YtwA_I>nZ!^X+oD^Osoeo z%4`jz3sSh}KpEiqH|xfKJ^KEIex5#l;cJ8vSZQe&Q55kg;|fR;Ee66E1&pb7V((<8 zocw}l;=Q%o^@X*GR19-UAA2FrvKvjigsS>Yzq_5iwXWa6i+r{Y_;p3#!j{XzNIh5S z0c%jPC_uq}^6;rt+n_0+?-=^7kt^A$yZ$g6izldiC+T1y$o}Y*bG2*)FL9yts{PBj zZ5tdh0j@J%k51B%udn=CYxp7Uj;KDJ!9@Gs(f0;QgfTg^!7d7FwSz}`-Sv*RJ zT>B+hb_JDj${pBqU%?vw=&HByCwmBRI&8P&?|mZghEJcTDX{jwU!krZ>V}Un78eRItCW*Dd2UCm+);{hYlyWs#{h$ zqwkD$BDmEN4-ki>;J7Y_nv=0f=>Tt3Jtuis!!%gJ4ecRDqA!e-RB1Y`6Ve>CD*7XW ziF~#}V0C;rep|8t;%vO6;Mi!ZtfCBY`nA2?*FPS=JK8yXxpll1f3(GAhcHAQgMC_} zPZMtv2L{P?Q2K9HC(m2sC8{&8oWn@=nq=1#ik|3Ud6wks5>EDvu|q!B zjj>P(nghAVAS*4-(zE(Bdk%9*+mW6bp3q^N8(ZP53&r+9j4mdho_jAGyTrDXKrK0e zl2_qNoe8Q3g9&jZFa1EH&L$|dlfMY3EGC6)EysLC;$Y1JLvFW1#jDZ;h4MZ!k}*4b zd68Ylw9=6!$wwol$u3nr75rpw$|s<$;c=dO2GU8m*tbT+43UQzmb-E*j6xOmpfaqg zB-v|gTm&Jh=_RlmsId?^(S*KB`Gp#ExV!^C5H1w6JK{sq*_vTe#FBD%bE$dQeXbp+ z-qWPMYDMX6660^}sf-+W&Q@7RhHuSRIlO?WAO}V$cbT4ya?T$}fl2T;snqaNo%9lD ztk=4ruxL)rmRy=Wp~10hR|d<*gO2+<)aI^7^g=JK1$PW88N{!vArV-#R)5Q2gAC;w zvKjg$$0WC)LIXd9si!0-K5e|w2{ZGO&WyZAt3NG@QI?K9SZ-6hF_$|`*-YY28c%ic zA!4FCWTK1t#Ry>8ShZMTu8~OjS<_w{sar3!%EsX$o_GacU}qei0D9tmKrli3+20Zg z`beyUKiqF8Zx4=kf9_hlZFy6EbCu>ZvbFN5#G{x_P#HSSaZ@iSv5H0|OtI1=CQ9Sn z3PC_r;E`shMf=r59#h>O5zv3weYNxR?(xn`-cF=v_zPghAMp9n@fKXl{B9%p#Qof5 z4xK69a<8uY@y_8Jc&mL`83*T@vg5YM`;LP??l4{E(Ai+-EU^6V1NcFyh~=AF8gQNU z7atR^ccsaHg_gfZkN9lRUzV3J}+`#ni(QM}8x5d!oM4#n#Bl$?8Asuan zpTn`7d6~dn^P~py2D^CR8nfZd7%isR8K%U%QAsyig1<8xbL$#6umsF2 zU7zmPH4EumBaEDYK;^{xvv}8Z7GK4F6ln7#mku?atAlyqK{0Vb;|)vYtLJK3V6b2H z)8_C*7Q53z%7o6iGEgN)Pbghf^4+_+a708npER6HGqR9i_N%eQARX^+gu*Omi*Qa6 z=88mdW54+S35wM%)zyUZ>pw)bN}u3F@pn>B0e^Ofv=6oi|2`^b?>|)4TB_X}VCJD8 zcuFuEPp@eL^!DlE&-&E_ot?dlQu$Cyu6z@2B%DwFVI#@49)~@IQ{B`N;-_{BNJdH^A zYPchlJCj%vHyZJ&*gMRliM{QO;x*9Wa@2I-jiWIa-PBVPJT@{2G)EF57U~ge7g^EL z0tuao+oRJ@x|2F<;1T>Z(6m}Vi@SYZmBjl8`#U~kZ;eW|#aETm|5kNoc8~o8N8%IN z1S)kD9%bVyJu4j_Gm2=~NE8S$4q+|iDjcoW-6lG@eGNcHZdt+Y}vMg_)pXfI#IzC!SU-or%UZ>IiFDRZQuvIEZl<`hMi;M$#vKpX*R6hyH| zPchLi#6!F@Fhhp&!!pRg?Jy5=?LPmAn%8bJziB!&jL+}hyx2Lkn?1O7EwI-MR}w_z z3^ci)g(Hm6Vds`Is8X|!+G`G1Z$2658>-jN>ehmxip?Q zKI=on!qCcSTgOKVcpn$@GZcU?3ZL&UFtM<(%w?6Ooz2~kr&5=K>L8fphI=Gg-DIYQ zlykGl=@R;!_3QJ~%l4A;t0(uOcPuvJh;W5x?=U;VAumAAf;ljJaFRaPg-H8U2m?J7W9FB{EyFU4AvNjhG7WG^>ktFi zmB^^5IBAnl-n}^Zd8s7|7SamlR!3qngfwR;T~k^_f}O9`g%Qh`l(z!Dg}N~&QY^P$ zoo8qWP9&vij>$*4Y>T56g)K>$QdSYblmf{HOEuWjnsM+6ZaIn@FS-vp@E-sT^5paz zdSb4e`a~^%I0u?{8O(u`cTjPAj52Ba=qoNHO+i?MIGwBWynoJBmB&(7kTr1VMl@rE z6nW>L7o!36RQD79SdiC&Ai~et6ZJ(82?krA5TcUTGF+c?>~VzV#qx8ZHLgVM!n`_? zS*KwLpe`N6<)!Wm4>K(1jiG0hS{!kX<2ea_?H8EEnP~{-hv`$Lu>m4K3$g9;uWe2e zHp@zpq)|ylgAfHe&Cg_n7Lc#9KrN!=y+S#eOyp8TvrjW|6|CDrSK3bSD}&mMp626h zY3h7Prj zNS-Ay*jP@YlXCMhePoQ0e1GjOaIfQiYRRY3Eq8<*W6RwYI&1z8kLT2?9?b3&ewD7h zp{tH)`(w;OhlJ(C+f5~v*EFNjWvcY_8koPfdE=?blAPToM4A;Wyn4-nkdhN98*%0k zm)j^PPs>g*+}2Zqc1Z`5j$dhyo(*?oc@0?R$sN$3r#BIu2a;y1Csp4o;1x%f8IaF6 z9pvR`kQOA~+80Qu9#fad`e|En1{v!}S~WynGQ)3s0~cT-XdO!`f)l9ZJOQEU+f|{g^q%n`{_>Exve9Sc@qw&Q~a7``-SSJrqpGyEMss^J-xph0tX97yP0n^o= z+;pUOj}WKFsJ5gm1CH0VL1QlDj4F?e9VFR}op8_L%7#9x@@tkH(A+)3iY3`6F8d6^ z5a}e1+UAbuH4wjSAI5#LK{jgO(!szghk|beYAp9j8w+i{+)^5}&3o16YpY$hDaEGn z3AzP5+P{-ugmfm3?~~gmVDc&j zn(qLVJ7IOayF$vNpxlyotH>H zx@zJS4jm&+ZN7t*V!Suzv(O}`=%K>$!16k>{xT7Y#Bt8r z=#p*^O&fuRPE(u=itp{ZO(+v47o-!9I$w>SdAT5`aY{II;oepEL zv{a0>6e{#OJEIceNp_LJB|7fkB(Jx7STOY}vsJ@2^wxh%(FDg~OgYVln04SPlU$70 zmb^mG=IJyADw+)z7;SWi?{&PChGpZ}cfM9nkGA(Uh5Y^ z4;K!+1~d}@E;?8mbXOB&SOE>f0?VvyJapIK3l$XQ*;vJDeJit)pWKvA3}T z>cfR3cFNA)vK&f&bdg}nqwz<0fulVoQu1C0|DYt=O*ob4bz-0BDb-5;Yc?(Lj-#dI z}Wrl(A{#BMps635p45k2VBwS9oVmkYKeEwOx7nk;7@hnT{p1g1VK&J`M9|>Z@wU4 z1qpDMaKNujIZ5Jw!` z;A6-s6Ds;}X!Md}0W`wn>ilR~o`ln}YrF)pyl(x$?dhTQvI{nSZel2#&rcn=J>2er zR1M2xhi(FO9Xiz>D}~D)_B7m5T=ti9gZ|am-X4~w`eN>Ekv$Cuf8|K_IF7}KOKX`5 zN4b(wTDM?#ZzoxjYGahrj`?J2Of86AL0;lLa74fkeUJcpl=M-ri!F)g&BgDL=dux- zX_)N+yn5ACI?KCQc(Wa^YiUGBP5$Vz6^}Tt?w-%YMAgl_YIaEKIYVJs;F)H%&_Kgw zMvHNjXGz#W8Yy(Rr^*-DyR`1#EKj&hRXl@DpDcK(TAbr(X0m z>!7jvkDp3PbS&N|-0qk%nX9g`u0L=LSLuy7VD_`X&9lQ!G+YA^&xc6}wtBtusvDF?|q7Q@+Wpc#ew z$fDy70*Kq^RA!Q(D3KWl=;;tq4k$rTX4u2!h$~wq5gjvcL_)4oyR7hDjFT_gW=*ld zm3sJ{25D`^YI$P{;kp8AU?&T-~OFG+Y6hu$KA|AZqz z{*tK_P^~xxZDI=KvGW8Pt_;X+35ygxifb%*e$c1QHn%ZoNeL$4UFOntfy z+a*_6yYCDiHTRQf<$+J(Pn4#hC=mx-46?we{T|jPgESR`{TW6;Gq1;ReHic5kPX8I z>TH1G+amu6`$qhF$9W)%YJ8+On(UAVu z$fQSAR@vAl)X$SzHcO00_mvorKw>OaVm!LD#8|2YfOI91XyT+nX+%r7W?b)o>4ntn;NPiYkHJ;?UD?qs&dmTYk{LAbnj|fdg)wK#Ycz zVJaY&J*URiECEK~cOmuqJ@RRg%GYa}5uhL56_e_z63eehqRB>UJwWo=GtA>d$L8R`Vhw0~V z1sw|m<4t=n7M(xtya9#D9z)0R zhopt-jTWYF9Hsz*R^#N&KJD&RKNZA&+z%T~8OgD{Y8Hj0|qO?sFf=Srp zatrpreZ<_@o59VaML8O>SKdz$mxYHZ4a2RfMIh9nP5_B;e#-ibQ)3P8$lYnPz(g3@ ze8sgHU~LPb8eEJrPt-c;_&`rq&y}XQYH19i?NOU5<@(Yy=*P93w8!%ah`Crxg_L3H zC+1x7sew0liryDHr)4squa~pU+lVIB zN4a#)Dg0zn1WY5f&Zh#8**S`^?z4fLvB;-BrBDY3Nge~!*i*O%lBHbc{!4OH?C2iL zIrAdB{n3`chtv7tJqe{B#Bap&qU46fE`s<>3eOiFBb(e|@DR*TYm*5%zMv_UpwGJ# z63d}Wr9pIqOQqB)KzaINPh@qd*XZBoY2$KBMY+!Ecost&M;w|aGD?(#EJ*I;(T;7U zR0>w8im~38^~)E%T8SQ<` zWZZO{39W#j;xiKI2kxW=#}T$)>AgX~;^P4e3^Q!$SwdvEYXPD74B?$8GZQT0F7M^x z2d}~Ts=`&7ie0ilEL_MTI!=76S zkY7MJWj--gc%Qs(p6jCUi8H|8$mjYrjup8Zr)v95!Xc(rcY>>YG_Wq*>{@_QIA7ml zp6g&ceh2^Sl)Yrq?V40^Ue-2o9qg@5J(p31X55y8GFRHqcMFPzNd-5~oM;d9Xcc2Urt*GngQS2bAdZd|l^P9ZUFb_nOp=ciFq! zH_oDm7Ne;x4P&v2YGB}o5m@zQT<9Va1fuF_acYvK(FvslU_CeM$0cRlZ0gh*1?L{n zP(rUbXYKfWupz%u!zNw%*eJ>w&(QO(10M?0*r@hg)e!a_8nIxy9h%)(qTnJAok=>* zYtsZoDXN+)$VnC|&!=f89z;g%Phn-hMiO;bD3+1hxMsvE#)=wFvJ7uVICOI2SPcWiN(cW%XlO$ z436UfB&s8ff8_x9{C-2YNcbR)fmwMK0%=Sehc=u z6{ZN3dze6vXHd}qSUpu0;pl>$gp@%@aQ$b-clyd$K2r0QakM&hshBx;lK>c&HTbni z?Ze9DBOSZ7T^z!7b2wrBE~R873^p* zGNfcyHIov@K@fHlTp8knLZPq-pm+t!L4KMjZ0(h$Hyw@SwzpGzusK)@1D(JVhr00BB#-_!A}L?L9&%3BK0EFgm-!&Wr?os?Y>Fa?RUR^V|IPoNAAr~LcPrnneD_T` z?SBJ*^;h~|`Wvh8^Sf`q#edh~fB5g(_usA3^VQWS-+lYt+Hcmr{dR5j+tnw(`~JJ% ztgby-d-A*AB&%O~B6UA=BsWR&o6-4jVLK29&Zg<&HvbEMm=XE6-2o+&g3V91#NfzWSJ^%=d8fKZE&652RhLdf$tgEDnYWK22d!47y$vmUYMJ z%yH_CtEU=5@?dkbz1&9TqHdNLsoRH1QDC-7bKeLk){@;1x>0NB-=gVbpX5D%wfvC0 zSNG)d1B`^NwzM9eOs&K)$*1x%NtQ>#+t5+#pb-up!T-=WjTA%AWY>2o7|RrIqNc=(pJfCf&N`7?;4J!Z+NKJx#gPF26%cHqN=NGAUcO)b@YSZ~mR)jBR=b{z$U{Uft{btok>tQ{6On0SJui`D=E(nj(z%O*bmoAZ2eEIO>cwY=QwHgu=hCGAd<)8ohNC_(%^udoXb z<=2hiE1xP~YWxslIPK!%nU355Cg;H8$8s2|?F-jFy53|pLi`Dku(A(sY4U>i3blIr zU={!BxIY2%xRw0p`!(827I&D8wc5)?TkBYe^-+AnEKqbJvD)4@nz)ttLn`an3wO1; z{?heoIKDE3zlGPTgIxMS?9o=>o2|!w52PTTXj_%^a%%>P;4OmT6Q7NI6ZfExpzO$I zBAmaHrF8}CgO$=K%ggx(y}R9LikI9;NOX&-I5V+t|9FVyex0nWXO(7wj&Po29KGA# z-Z?sw$@*F>hJd_!x4(V7d$6ChI?giP1q|ez-UrOEMPKQQ)eHCjr1dd>dW8ou*@7b>H;BpOPTuWyqZJFo3sTD|j1sMx+{@h64qLF+^^@=) zWUG>&urkrkZ+dfVyn!`ff}z}dl=oVjomS%6-)^f%Dx$A85g`tK>I%~p8M8F8#&9#9 ziK*(7KO4J}K15Z9%g-l(-={ z-5zsAkvcC%E8Yc0u1Of$q9|9vG5JPkNF#P8J!-zzqj*|CJAfP<6Fjf@0?FP+G?mFk znva8-xGNG**=B9#8v+uY5WZJ8JN!pA_d7*agaXxuzkr#q-h2&<0n8L8+xw~n9*j7f zt|EYUWTa#ZEKL)|wi_N_$M$3^ueT}0J^6tXQ$9_E?gd`!8Yc_$a4~FmLrTDe;ijG` zS%s`onL{H@c7{E9`g~2BDRt#F(8eY&H^a-XO9fK~SmNlZgq8|--?}>WX^~%QYY`?m zjMVuRVR{HrP12O`%edkm<7@9_&)q<-&wOlpaRLhxCSG>^SE#$6g~a~Z7Mx%{q~4s( z9#Mr*bOAqSu~)HcQ`kW2f^Bhdx;HlS4eI=OGxt1S{~5A(!VOS?5r+YI#G z9o?cmg{xqv$X=3Sm)br}>T3+tc}qQ_Luudoqo)YuJ=w#Qd%9F5u@iBWTJNp)R_}XZwYU`<{(f_y?guntvw{=o$D@KhC@R!uRpA?JM5El) z@i4khNp#*DZ_dgR9gz6B@-n})DkNzfhzDrbW(wPxkJ0xtsw93R@3@c zv#`~yzSU*e>N0AjfgTSZ5Tjc%HO33aF{b@i55u&H>-GbEz4~N8FU)A4h>V3;@Tmsx zjxofjPTQCp%sc))9tjYQHXp$W`N)W&crim2?kqj)6v}+Nz?a`s;EP-Gez;)Y?A6xZ z(azK0(edHC9nZ(i*ko0hK@wA|gdEq9w*9{qTDbbJ`jXK(*CJ#)Q}!rr=h zBGU-%XkF{kdCNwKIM2X(3+WLwK(AH3cPucZK4g;Xq z7az@IbbmoM^EJ8o15=0(KrWcDF{a3k5WNzUt4;`>zKdun|6wudesY zAAS)fmpiJ<|EI*}Vo!Ttkn+cots-PX4&I);IrzOLD_;*1MDw(FT5|f$tf#Fi2kCl?^RAz`1RU;l~Z+xKCgCn_Fmp+rFUP+Q8OG7STueQE}+|? zncfb~Q{^mxpkg%BZJ>wywsFd}z^_cX`mu!&YW!f`uKmM4*0kNXY{)+h;QKp&xC6FV z2@VKbj~$oOgnoOKOXD8~+O3z>JI$@3Y&am$sd7nup`-Wi#Xo4|H}CfTQ6nGxqoDEj z;1BBJ9G;kf-J9!MQRlG~@_yu?MI_60sy?wC1y>*}AxAzY2Dw!U?*uGoC|9BJ2uBspT5A;i@*~M9r z#LXU0`j6M^$KUzS#uFe|QUk^cQ0~yDnRjjMv-6+LS6M9zH{omD&`sA;xp3j1)obT- zdcFRvZ@vDkZyoO()#CZW4j?Aoe@nNw_HH5V@s5fjd~?&N>L`S5Od?dEru%w8k9()& znL-`=m5!)`sp&|nnf`KvYUX%rcdudYw+rbwD>td?*oQmE?+)uOqFbfSCfF=m;w{ry zecJqP?QSIN)xqK3!9hiz(WF;&6l>C7KD}%%d zYQubS)H;O0Q5*P?<9`U?;F#|1R*!dh=;90gekugK_ud`WE4ORsjhXVuJAs_TPOm>S zFjBwYI)tw_g0TKLe4!K1->x7=Bi1X7;?`D0{#%&eYG^^f2lL6+GK|(9SXS$|*?5o- z*^=%p9%FG3!eC9cVjUfIuDcI9oon<+{Gru)+A58^2*1qHzv8;vqqa2`t{>USv(d(- zz8`4DD&|;B#rmx9Bl1+)`~g#Akkfa$x!L}|ZSqORUpFZLqI~>#TXrgi~!iz!{@8NJ>2- zUj5KQZzF)5dLXrWCA171_VCZNoY_YY9~^azX|F5zPcB3r2Veq|bedj#UG@+iu<)?_ zD&9W$7fp@!39CZQFQ`Y^#job&$tCXe zN=8LL9m!1k!d%Ip3JCT^Hp_%QFqhJd{?YtCkuuN~1bd18+;#YskI8!oCgzN!AI&Uv zS|x63mkg(0PcZzXH@2{D^e=KKBDO*{GSZaD^<-$D7zUG{R?eNDq`<*Um7w`$<_S>e ze+QBsChz&vCSQJ^e^`Nk$w#agKBnk*w2DU0fuyLd)GkHQ!>q-nSo{aA##=XXn!NLR z%bgc-6$ypQoTQnXvEIyix_(=C8aPrgt zrkL*g{6z8J5>xwSzp*&}d-dD3)h87H{oVK9udjXo1mnNITl@B3@!$W99~=KIo6iy8 zZThQilMln8*_)?#jPA~dW2_d!gPxrG&|`g2jk9)XakdWkF;O>HeR1E{^3IeLbWo5( z@;JlLymXq6Zn%z5IVre?m*#`bFY-}3HN)htu+n&tP6x?$BI{nkT8B3nB8mMmqUeIc zI&s}x(mm_vLm*uoXjKdm8Y{Zm68N?2FbgX` ztx?S<^bEx0Yok$dCDpf<*OJc8!JoPh4SX3m3#^VHuxp>R?JP!l$>YK| zADAieS{0qqe;w zK-m7ec|t#%8R=&1j`?);xLj#_G%H}YvuWE_r^M6k_sN!Rm12O{puN&Y>X34!a1MeH za>&$RCF!&&+~*{_#`Nlx&$^@})kKVdeE7muSx#B!sGcTB5tD4XOd{(jn^9dWdIj_f zu;UC4`{|7iF`K62(nVEbb0h}@B zsSm1tGP%{Gm~g`5-IJFuceXp4HvR;oH4=Lk-);Z6b$Ie->u1bJ{$T?@^;-!O#R5W1 zt{5rmD56AtR5Ob_tUrRCywu+fRN&AyoIq;Nzb|O-kh|l5uRmTL|9ky;vJn9F2dHEI z=sv8&j0YY6dslA+0VtDyxg-9&S(tzQ{EDB5|JO7)U-TQd@c&Oj{-5$c{qFnk|Hc3R zGkz@puba;TfMk!6Y6+C$0X4VWs8qEl+)j84-ZkfwN(DTM6${)G%R!#??~+x?WlB;S z|AyidmnlmhCm`S~zM5K*SmRTwsvvD(A)S0C0T4I@CXJ-<$AP4>=9ovi|F6$e7$6%2 zcj}v+H#>)iZ;oEe{nx6-OZox^m|mHRY)iD>Q}+n3`EycfZ~JlU)OUl|08xw5~46U*;*Sl6jT# z91}GQ{wwp9V(!AxReDoWL9;3B0Sb+F7TI6Qb4uZkUJ4HktCiMG2YB?9nXFSm|>BXC- zM3oDoDK!D$9mXnC?oh(_IsF;+)$|8i*@$$Z!6*F|J_&EzkYtjPptnfrUfQA{GvHP7xRB>Yfrvkjr70YLc@RYfB%f1K>w?o z&kW!;{5hYImXH(k-ZQVK3>W40+}nN8l-jd4MQ4qgxHcbW&`fi5sLP;K$J+yKC3N*}As`RrCHmlG_f z>k>L}$?sk=o{~|qQt35HY=eW)0NuE{kF8PZ(%oowGRh&#Gt}ah0sI|ZI9dZl1I3nu3wNWNBc1gcJLFbXToQH#JD53xLcsH$8aP5 z*;HK}N#!Y;GR?!*OVX_d_y8YStt(gyNbOVs1SX zB4OQRIWdvRe$S`LGY}DCY_BQ)h_CW7$RA;mZdvboP!5K&9{}3aK&S@7(FfP+KL|4= zJPbZd&%#PH(>Z>*&7f$@<8l%70dQB-bn-b=lyWYyX8_kLlnK(t+`1vDw%QLJ1viyI&8JZCoXN83D42qqY~Y)n_Tgwv zbF%S;r#>xd6T_*w^L?K)CRR{PqJ;I$?D>xukJ^i!HwXY$STe_il0BSu>eAWQfsdm_tTk_ zxHk|m<+r3_fYu|M7L)W0k(j3)S6rA@Dp?6pl8jl4&&B?pV_SC`_pm2?+}2%RYg+aKV&I_?%{wSeYlw=H zv&G+}yQ%JzW>0Ul#9>TAtOMru!O_X#yZr~o9*vJ)?rgm@_Go-Wq`(-Y@!9^t;hP6f z9@gaEMDmBf;|t2&^W>HV!WosY4U2Ub5BAh!trmh*A~qI5=ojM2O|YJJ)WR}Ih+ zzGM+Y=S#ip;aS870uWi}MtGUng7Ka>)|89?BS&BBxi^E-n~k{r!B4j4I1W$VSHS;m zxTmJ1uID9JfmK7@A6GyrfHLMYE(kK5Vp5MEEcpp0f_vdAKLLdiK->1tb=6=5!pN4N zs*H=Mun`PV|9u7oPhgzS@^r+R^ZW#~BE751PStLT3neo}zdxT&vw@v*?LRA0oWHePVEH z3tH4nj9d&$^d^>B;U{Z}u9*jSu%BLU_%z-8pTVy>*(Tlz5`5$Y^9wz>bPg3~p87xe z7`u}hOHDDy^3WgDSWxOl$Gd?gH7LBc5gmh|IQl|PT3_E&vM?WC4?oWT4bCCcT@7fI$y4{O$?f#U)-D1fRdP_y%qD z!W;Edk8c!~|J+OdTVJ~CCd7Yv&2#c^`EPlN*Rg+vf5{6vb^3<>kQe4a2CwmfG~raK zJ#!}b1tuWnidq00y!=o_{pR4Mt>BL7UQhhC)Ssn2Hcg%KAz@HfDZ_ua-tB+NPo)2y z&xZg0&({Bb|NZ*6vHk!1@BU@~|EK%}^`CU})d4`fq_i#@svF-OzgqrxR6*sF`G{=m z_pSECANee;Fw4bZ;U@2T`uPQ(?xRumZl*uK+uy}Jeh*f!*H&M_&pdp4{0gLs>+fIj z&)oJsdc6Q-K%2ii2Ei>KJZRq(wTH0NS`Hkphf3E5HcfAmHlLa{R=t^O1zM0=F6I}E zR?aySM{oneB+q8&J$9hR@{ZUF*sm$!#x$EC4>_I@StwVMU9?~1(~=x&oX=-JBfnSC z^NM*RE&F*+(=WN0>bTINt&Yg>TVVg@;~9%=*6LwJZ=^9Nd{`p)h@N0@vINWQx!PcT zDUuqDB`q0LBER#`-~Ow^FS{VFB6{7O;c)8_cw`l|c&TfXY%pAZLvL)XXpxpDGr zD$Jwb$NkyV>f!9{;?Va&_)AG@iUNnoDw^O@2o- znJE&^VtPYR%{i`lTG4R$bCEs<;=ybS(u?QQe>GR|}G-lzj&-IFs zzn>{iGf2A+KL-Xts5Tj4q-rk~ajHQW+A60&l@j3Yz?o99L(;AD7wP0quwn0s8#EI$2#+@>G4@3w5^Jo0eD82sh;X^lBUVd&*oex3K_yGzE zRm;N^!vd1`dGF63dI*wnK7#p>>IgFy%cY1*XqOb~ATEtp*@#NJUC=?JvDs%0mKd3j zVZL}FH7G0esvLXbL5Pq|ougvyYG}j!)vDE==`QE11?OexOhCF>O(8n-kyli$^^!+; z&u&DsLqI?uf6sF%6pZU~)hLp6)FbqghW>xPwf_^cd-wt9!bq>3;mas9z76~bXcaVl z#7LSeAn5Wk{q}6L!W`gK0}ZA8v{cvV_8p6;0NhVuM+Rl9{-gArKLa7Ce&$L2XZYe- z^bscc9bEu^z^S9`KCU59{RQ1AneWM2`0piOjVM8b9&K#D$(6R{Zh_IXI#_7!lZB!Z zX_)3CXU=gpRyZiZy`w58v!OKo$4S%yD!v6yfX?B-G zir=}=!8c?i?ZNq5*bpMUgCQQe9Jh06{~Ti*(Iib6|WvB4R?xOe$1IQ6ex-kOwq&hba<{*EnT6 z?=XDz&avglp$P)(!>->UGaYr&svH6u0uBK)r_>O(lf_Rt0z{x%f$3%FiAwA1cdZ^w z0rtBqiw;;WTv2BX$8rqk5-2%fIbgLs?XIlwZ|m?|>^@fu4sRq<`;ap#GroAt@@{VK z;Ei#A*Z81mY&jMyynxGu>@(1JWS>hRw+R) z0sB8X70loa7_bg3{EEAvX)x3v6MZwR5T#>G(JmlM;RuPplG}NkuQ!kxRz(wJLQ7}ZAl_(XHhB{N z;EQgY1U>BS)^sTX%CNra2VfGPCafVME83lI&FZc9`MhTXQ@Ds7bU43iBt5`G5GS*< zoGol99tdMqD`Q%g@;U4&%u>~d$~9tzEBI%5xyBihQ>ex57n<@a+;m>n=?+?kaF5CV z%o{Rg()1W-tg~14mF$(Ip|qY1gF;?cK{T0Wmw7R_$Q<}U7y!u6r@KMU^pJ}p@h4gT z39Yna_>Q<{kY0s7hk%x>$<3K&K!@JZYOD3 z+5oy>;IV?QTbz!{ zLZVgCZ$3ZcZ63D)vkI&Twxqx7cPovX2mONXU;{1>9f$InN}s+fIva=pC{zr1?+;r%by z|BlaIy!x=zYV=--U00a90zTcdTIva+C#u!+r%T_#e6vW!Wh31~jZ%QBxJb>dWUsK3L65@m7+k9xg*^oO0Dw{Nz7ez3N>+Pnzjr-7tRX&HUV5MQ$jJM^pFeID3BXS*m#xWoZS z3K(a8=xXn+z1=_UY#$sQKlsj%fu0W_TVgp?0Bg^gnR+-d4mih50q}e4s+fLkC7sJ0 z7t-|^B`(tblsMRQ@Mp|I z(w?OAGHXB8Ur6BW&*re$8_ZRO-d7(fAt5(NzDeG0y*t|3difu1GEvS^UsRMCu85Lk zl)-$o@dMr~N(`8mAKA$Qw*)pBwwvtJrW>}QH|2v4yu&{`FZQ;!f0C?mfB13t81uOu zb!&!vy!DHj z;g1=;=$!SgyALoMN#`1qEl)oJY&TK$HluuE9rO56@?U;_xLlw&+b1$ix2tRZn0Zu4 z&d{$0cy!L~#&a3tq=66l*tJuF$**H;Ozuri*SIeK^_~H~gGlfx8WQdN7pe)v*ii;j z(?iDUc291SbAmm$yZCifV^(WfWc3&+(uM`obs=`ta%X7^_iKy?%HfJAF~^6 zFs32sfgNQWjRFnenaK@7qRI4wyco=k8zG3hIY4RPonIf#_` zfX)KkmSZg<@$xJAW_m#54*1m)#$h=B!V};g zl5_?qvtLO(W51B0sg7^L+l%1AqbK_=`B9|yx}&9u~T(DK$Wv$VJ>~; zQt*hS3FRUp@511qjX@^E#+~!-1Nx(L-ebap7vzlGCHXNQXaSN3FD7g_>%*aeU9doB zrInU;#zaa%@C%oXrvjZS96bW;U7x|ZT7J$0ZbZ%Zw)euuqyA_?^X<5Ke_`|E9}g)Q zCz#Fof(~yF4~`GQ_LBw8;hsNyxplnd!+Ru8(Hvunp!2*_SR;-`8PBm80W%WMO~j3U zb{>8&ikvayK-a+4^^>vl?B(N+q(^r&RtZMCXbam8GV{~=~(#e6#wD0Xnn|a+g zlD922Y?KguXxrv_wiA+-5i18d8p9ApDa&V+1Qq7QJvs#@_w|3Dbd=T=-Cpv@z#RV~ zXJvbqO~(L5Es>mEFfIUwE^z z9KxOr=scWfoV%Oi(S~eSoOBPq z*dq}MGaZ)UFybylpMFZg`;@vPMaFavs77U95Wmkcc98sq{Bz1XEol^I(-d8o($Pwi z9MHW;YN|3BXP1~`P{S%Rnl?e9r&p(B{ev}?ML(y^gbW-$yFM{7%8dCLD!J)4#+fUm zaEwuLmiOuUrS8@uO6W{!*5J!YXCDppOXCWX<|Xy)oWYlg5mQxu4d=%CYCuF>5Hlm< z^f4ys1|Dr_A{6G_JzCDP(Wo>z|8P=(5+d|4lR>k^B<;inCszV+7P^!DV!T|%=904Z zG06GT(m&`8ICdntE>AOxKn84TGcVchC1p`F%B(0>5N+wQq*==spCWvO>yZf|r!S|Q zl50Zqiw*Xu=RTZ<(xrC9w1Pd~6p>Q!1CSO+2{>J=9xoM0RW^o|x0QPpH?#15cd@?8+|E%DEdT%0PI+tG4XdK)rE~11_$A-V#suUgAV#N%(r|e`3*TNUn`IBST;9TVK{J!!C!3{b zuxNnc37&{(9>KO&CiThECtkQgO6wlrAWrY;HA2gqh|iEA{fJ%$Kv#cyy?wH~zulFX z4Uh7OSjIWps=^$tC7uZhOj-&M>M=dY2gOwMbP*Lr2bUT$S~+hx5S?qvHC^BpZnpwv zMJ#W62AtJOEw1C27UBD6qj(jEP1EWYyx!U8yuFHeIK~+x4E*sGeDUP?;NA9*J1^J# zk?;*RO@nobnD@`K!J4_Du{AR1MCHdII6)7B zaGU7%BxS2QkED1R@%IS=K>NAn_(Mm&8Znu(lc#0(EKoEKjpmCJQ_U`4HNqQu1Q_NO zua?i-cUTG#nX^9bfkIOdP*a7Ye-na=+O=sXzEa2GXdh-+MMy411|i%J#Iq2fV493zWdB|=NgnGoHh43f z+C4BP$V*HE4vX1{_l-ca5ut)H_{;XxLhM#}#Tm0asBzuY^smn02FreYo(7SMg?s_6 z<{P{}zO+j7O`yL9KJpz<1k#&n7&7qAB6F5KpZ%SLe9T@#tg|b*h!P6f4v}kyCJ0)T z3h2f|hh`M~C)qgYL1)5|ddI-y5kZ;qe9B_|d6uK3iDk$r)}5^jrQvtmv#a@}exnJGzZ;I4Bl>nijye}`T|R7&2=B8 zjFSU6Dh|jPO&q(+dIvzCPfLL7Nc2GTTAsrDvmz_C92D_8IHRi~8371KAm4AfJyofG znxQ8?f^W>Ml)NWZCRr~f1s=_*%Q%&~iMK)gf~$fF?1j^OvSuSz+T7D(aTnz|mm_!@ z>&W+C<5QnP%9$9wju9Zo%pC2NXFz?0W>F&>OL>8OKA`_c`8q6>iJByPN8yH>3o?0qI zBxk`+HW^A>Ln}}boDjzF|MNm>x}Bya9CBBs%pQ7de^EW^CYc?6!PL4vQBgv13yp)w(QiDW};#e#m>}dIR0zHgbjUS_MAHU zBo(@pf;ppEahkzk8%cqp6(=nyJfrMGkDRsoqVtP}|3XPiXAOJ~U z>2ElR&FIL2fwP}<_4K*;4d|=qP13Q5UkP<0tqA|R{2Y%6tmv|gFAUFnwu(@FzL3fNujp1B$h`O%7|Gj2iYC_TOv?VnQ z6N%p7bY&e$*w2k)?r2uEk>*|^^1=a#eiBnvnJJvzOHW9t4YDuu6>PC$DQW}-QD6bD zgrS4-m%zkCm|3)_pa$}AvPF(shDSF_`)l173?s;jX=MOyeA}HEGh@gKc@v*B)Z7-h zqG~WTnH6vb2>GUiD;x!1WKM~eY`PRQ@R%%Issr$UWRvskBAXVzb#y~di(*Fpk$B&b zdm&xgPK+ukeHW*J2oyP#Wh<5{sGTvE*RLmBv}iTL%QoV0z=; zU(C#4%0J*Ezj1hf2;)KC!OTO9vY{x(eDtJIBK}%s#;?|89J3=p_QmxX+jMKI&D?lz zl;`Y{AOesON~`)MS|P^k35d7LlWBp@H3(Le-KAo(?sFS2KsA<3=8R^j!ZhaV;F?3N zUq*Ix623FOW>5hbkIXC$5i&NB!UdEKhj~BG*lNiNiF7bvF+-i@k^FgG1exT4b2tD| zn_w<_X2-xPr^C)QI?)wvxK2C~>Q1!bS;2OX{zo=dxI-24V8Xtrfm1DkIa*japHpSU z%zjD6W^8s!7$_e=?R*ZJOerh}ka;||Ijl!Y_`zk0;pdV=+EZ3{T-A|> zxDKMqsuBow+E_sX-6RR0Ue2{@r!OoahG;f=R;)0LQ@miOR5OY`@i3)9oK@aFB)Um0~g~YDLA_L7uju?Cy7ZQF{JVq*dCUIcOum@k4Rn$9X4Z%6%oj4Ko&@=5KC$+Zm z2}S%vt0ghgQ?iY7hRO-tJIIAoksongAYR-oqokUxlHg3a4A>W$B-IC0N#4KwAD@COHoAXsc0cgAfloqz{<`$!NQX6J_QI>IAV=e(y(lRym7KKzu? z)i{M;WrUb+5iJLfPj{D3j6G^ilwzECUX5X}h(@?7a8p(g=fk1(enDYOoOx9 zcK(D(hs)9C7n4z*`NV;oEA5PuY6wImnMKxB!sMtDGI*9Q(X8bfZ=z1l*g+g@UZq4x zo>V@+3x$GBB;2C2(c|hLIB)Tw@zhY@;DKz{+DU~Sz~h3n1EEVpkf~sW4G&kj%tOB7 z$s~D$`q>4DMEd)hm3D~|*SPjji4XQEBz8u$8_I{#Yj5U2q7$)S8@$^&3*=&4Y0Kqb z$!Vjw>LJriquDB$k1xH_(Ag<9FD%vv!>UUz$iq8^DL>%xu$Ht&BYC(wV3$G1tE)ww zm}<5dTX27up9|^`J!?vvyRC4wGwQsdG+-zkWFw%fwHMR|ITym_1HY~m~HtU-2HQso7%%hvGviIS-n5i<~gU`h`EFF(E zua$`rU%)y-#$Bi)O;{^b|Fe@Jx_NMORL?@d+DQY4I_#5|89CKWu zwT=gpd&I{0oxAXpK%L;-``C+^lY65&DO2x#rygUpsVc~H8?e6k_>7nM>t%>vL+uw) z>xE=K)?r!t`~M5^Ay~f7ExdRdkjtWlSo#zKcS8xAv;mU=ZY?Vf(hK`rEqx;O?|DL$6{u1y(x%l!2 zi+o>6&#ne%V6lgQ79~}^0KrXg!O^#`{D2TP;*dSK3p6*Y-A6y#R2Xe@c| z#JRi4IcICt06TOI-STVH^gGGp#A^{AC+i7KvFHc9W0bv02cDB-M-}hY;UhBZf4W)JSF=fP>G{%d@g@zIpO?ja+Rtk59efLT^3hy9w1ratyR5%-px4LX!l{m^X3cnD zwY6b&x?uEh%Gw?GADb@v)Fl4K7!C{op5V6N80B7hD_@WAEihep;)+)-kEkp*v zb-=%FDF$VA3;eInBXJp#T{^VD<4!` zAQX&y&0ySX24l4UxX_Bl*RPP##kd;sK|W6>=pvif zXfC^yaYcNbob-&Cqzc{0p0!}`I4-T*q_q@iSC4w&?Zjt2@Xk4!ecT<83*ZcRFhaVO zNf?)e{ebz8U( zw!TL9^D~O*WI!fEcW&=x=zJ#^=#3a+U7uUpk})TJL{Oo%o}i{-1uy=cpN|i>PL7VZ zwtr$!3G@MPL11P$C=iU~P1zh6Y+R>8J_ZfKkO;50aVZ6iOPG!C2qd&%bJ@eL&b!V@ z`?TNUMRpcAq6Kz(oA1L(SZCG&Efn^>phv(**$vGxH*&1z>C2Py97JU)-~n^pFuBCp zMDH&f*WJ7B1UDizBt6bd#VW}gp|lFU7l|Nhx<0L!$ObsF1+7$_l^r>tBXFy?vUlS` zXpFCXJj6rm>a}Fko&;WhytmlQZtcBt8wJV}*2i+LBaxWvA_}6eB!6nxd0khVA1UU| zv?HfXs&w71>AD?t?bmk=(;x+cnD(61^^5W?h4+gC(Yfz>_oPM*=z`jaCQn^faTU&$ zU0i83wt!U(@EVKDSo9PBH+RL)>RCTb>KR&_OK;W%gy$3%glMDzo@r$u;&l$Q32@*E zmev@N6S-J>N)x@UniKRGbOykcq&>)|ZMG3(C>gtEa|oMBuH(oojySy$4NN)7$mu&a zR2O5;q~kA~R1K&&-Aclmifw8^NQ9)xP-keEsqP3?9iVOSNBe3cdf)>y-Nz&=JzUv- z11!O;^V#&;{gMd2XW+=1O5Mp9Op(@Ek2K4N%-OqSqe+OpbiWF#rD-A8iZ_BI=&D$i zh@x5N$|-ndz2`0mnA{PiWbtEuMJ(~7qL}zm9UVN^t9$O`3C`xmwO_AHu?0%c*P#1@ zo$~o2*d#@U^QsSuJ&(>;)N`r~!qWEeP*tm%^;Qv=gZe|}M)5wviD1=N@Q*8`iR_|3 z76jK>exahCZlg@ZT@U71x;g}Y`u`IgS&t}##j7vu#mZchX8mFp|FP^krv{^RPon*m zt#k zB&2K)n=nBA1{dLg{bLv+1QOTbufmE&M$9@h=6wvAcX2#PoIwovR%^1{Xht!YEH`jc zK%X=xch%!su>i|HeHrwx_fQN`=zsV@uy{J0W~_6Lvo|u0Rao?bEX4cgfhqJ+fnOWbfFzZ3UY#a3pB*V!zf$p{T({bGPww=Isbpri6O zMBZY&CGi0b0BA$d{7_w&8gE0DNXRXymBGdPs7{NT_AoMRk`hQs5&@Q+1yL95MrtQ@ z&6Wuo2kKC=MO``RTJs@gSrr)xD{q$P6fN9dA~=B@)aF>>uo|roV^X0nFo>DV!32Gl zp_-`m(xfMKoM~rj%QyNTZ0ROl8_np!`YHg;+gBARQR6GhQ* zl|)?9gOEOoxaDh=h&r?p0B~Uo=~eaDlrrax$sE{QByECL+YfD*78Y{|t5|T^4J_qA zBedOm#hFrfVWJ9IDV8hdJos8&|@uVs)U$?I2iHVetcR`qN~xQKdBuSeAuT zwo7QL8`N;H?Tr}m1&3xy~LZ!Xf?*WaX!a-)IO z;Z43sI;~$VxWD3<*_7jcf1T9Mli3|&+(Ma?J00u!wS;zk(jsy$J%T%`jCZ77eOF^x zFz)ncXsnseRxqzL&P1g3A2Z}ouN8Bv;y)BMaF^ARa(Vao>Dsi^v1Z{zO~gFs@} zUN8R4x;tLf(PdY7Y(`3!b$l&NPO+dq6+?rh{5qTYe7fu{#&Ibw?}|?x(3bQl8muEp zu%akTvF}t8@KsI^eQjO8b61myOVOel(qTR=Bf?_Xj9H-{P_ELC(U1XA*|BiBHTe%Y zkDhdunv!wu!D`M$KDAt-r&IU>Jz8e!CDy|U(nZ4c(Ha-ii*(eo9^QQEgxOqak85+X zwy0rC$6OfYirJRCs%R$o0&cC*q0mq=NRS4)C(4tZC6nrMG|| zVvyele*a}>?#f@jJi$)m;zr9C?unrp4#9e*m?sVPdi(fIU6I8Fi5vq*-`NE|lfN!E zLL7_f2fi-RE>~P?oy|v=y(GkU&AmIjV1DM93cp{R-pI|4J&xa;yxw-s!C#Gw*+pk| zVc81x26nZ}ypt`J;!S7sazmtey2z1Aq^L*QBa|$z&Wqxs=W*aI+P5c(*dOut4aEe0 z^LMg)AHRLQE%D6)V5##apSQ#NxGO-UiB#Xg7o}?Xp|?*_r9%J+(GRq=JN)=D2q71$ zexHN9jHnYF2B+b0y{CSnz`3x+Izr&CcS){J<^eG#{tXz!Vv*Nq0KF zi!f8`bUCK%&E^hsp3z93us7e`l=Q+@Bn&8N9%Rp@Rblddj<2g<8*@g`4E`q#o7Q;S z;=GMnRuL}1OpOYbQ%$Ef-kGL^j@Eh+n;jJ{90VRgcram}4Qw}#OaphST(->5%X?kN zT|a`SUAgdM)>$*R7LrP2KAxh1Gbr$ZG6CN0ZGF;ZOE&t5%Yq&EYvi^zJckZ#WDWR% zV=OumuhnHA*Zl%hrsL2qi76Gxl9BK-ZW})(Q9Vd%Rvdw|vzi1KUi=q##K3Q^7mf_~ z3ehMMl$e_Xx-rU}{-Iu(KuA`i`U8+gS*)s2ge(rDQOw?<(6|vwNt$Vl=N7%h{TEhD z(V_FmV5Py;juYm|knKjq)mB2KQmrQe8)-LRBjjpXOA^CPcN0#!+#ual<2L5pen}Ru0j1|1ZWXuJGl3)I>Rf<#R$xH2W$FGvP-A)2$*zDHDUg z9D5aE&qA()9?(SnvUJ)%_W}(-oNhHN-eMDPU@i-b-%(KsnzX;n7nM;FOYg<)8dG#@ zvBE79nfQlg$Q8)Pk61$3-aG1c zD|6DZ&T@L64LC^nnq2)B#Q__@HA zi&%~=xYolXmn@bfo^x0CMTw%cZAbj7&|f!FVw8)j6ykR-jGA=0e!Pm(S7~f`jD4C~ zo+0BnX9!`EWoxIH)e<|am$E27n9nLUVg?KERpj`onB3AgGO2*H1vf>}ZYnuZDLO&S zK;Ty#A3r0-@MG1xpepW8niowmfQ4f*d8q`?{7=xazP1q++ZsIog?yxrL><^dKe86t zwNg~=aij?)Ze&3dJvKpVCu`P*_)?=-OjMKdK$5TF1#It>YK|x8QfQl;&*4~%=tA$b zRYM7AmPj>n97Jo3cUO|m%N(8M3aUnK+WYK-2R}Xawaf4U(59lt*?l-rhvLonb%vEh zWRA#6jkwllI(FaWI_}-deF&(-Gi-3kWq({tb^4y2L%6y02^mLvLUvo^d~&NlN$Y{9=B=omEwy&1MD2DYPR%s*`2E z3cUuYDXvjFt%`zf=Y(oRo>I66{u?j|N7e>Z3>`0pK3_xzE3r!}N%AtosG2f1HM_bT zVt@r)B`YzqXjn;Z%bJcQ&T4sinIfCCItGS}Lt}WX;ap*L)|F%@N@OTWWUyIK)ncVu z4urE)yD|k;)J9;elM(#xb}Z$zZ`Bq=5}1t}u~ouZjJnNe8YG?6Vp>)L`){zTqSVNo zuFn@+nv#qDBT}gehjV!%BjJrJ_iS39nQoA5+J`7!r8CN*Y0g^^(xy%w=M38o-|7p5 zqj^XeQ$l3{Q{?x@NQL)2-nFm5OQAR0Zcy2 zbRAO@WRYsf22%~|hEl?{_QD5|MouE`U^_icPgVUyD3TW5zjSDnEhR5$m&PyS1I=YO zeFnOy{uq@p?qWp(>>Rtc^jzvv&at1KNlH@oJd}#ZsCOmj6r7P?+kwy7>&naKQ_1|l z(&f!p zo#5_`e~eQyI>Uxtoir_unLHu3g{cJzPXp}R`wwtn#BJu}=-uJ(cj27(I6MTG_xfai z=MPQ{JK+kh^y6D-w_BQFRm`A?vq>%1TPu`ak4eRgI%$Wglo3Wq)Cw`TJC?*MN4eLXoFQNXi3W zJ$oZGx_5>CPIlrT{NSU&MZ3v)N*?{)Vtnj56VwH)NE}h@2 zYMSUU;*DrBgE&uDFW+;1b~286rirQ>O{bn^A`Ky1%IMw%K=;CI9Gt2{vi=6wG94yO z#1SU$*L)Y0d_pS#P{Mt^AKC#bIKBZHXT1yBQaS_cRbVWtj=w>fqk!|0I?2M{D;p8F zwgZMz299HDo^ME=4kVdl%Mhp2>~`(HVF@C}r_SVh*ZazfeP$HZ?YT&H!6i^Y- zvnHngz(xdzG#{I4MtMkP5epU*(M1BBlR)pd{Q4=4D>z%+kBR~Hi*%HgeYs07DoTVVOXF=dj;#G3 z(PlI5NG8Fsg1EMnO#U0D4w6l4SxAf94-;b>+>$j?|8Za&cy>)TqJp;qsii6>?LBu{!yIJHL@b+#@c zR-otOn~Tr##3;Gy@?1}X{I;f4B*po_{?Xo9rADxgA*4Ath&)lzD03Gl`1te*%jjL{ z$^Ph4&u9XqAj_3Fcz(<$TH(ukDc5H1X>v!4yvSY_R1LF&y#SmkVkJq2A^H=~Hs+NG-LXhAkJwYpf}3+0?r&RRz- zCbObO^7F}fg&0T)H{-!!JwB`@mM#%%)b*mK&wZlFEbJ%agdljr;;*BD*!()x(3-HF zI3AgR9L6a^*N2S!gi+%;2%S@Ay)ix^wZaZcp5(b`bD+5xf#777R};3e!#jr*>J|W- zMrX3;ZSm|O;Jj@D-xw_}!82@YtF|VE3PzmxL7aO|bu_zGe52tjc_VuhBeVIi{#H85 z=`tppWmMuUCxhzJ^aMCwQ zW4Ra)Bor6tbIO~ihF!9iR*f{rYBf9CPf5vf*8v}Hti9bdDEL^%U81+VC-)h`%1 zE+x{3h?SSY&^6?Qf2*Sg4;Nenfu$_C4FH^1D)ZfmU{qGcZEin#$!7DBd002F_ghv# ze?(8i&E%)o+b6Gg_T`Isc?dHjeh#6RNY!J4VRDK(Yh0yxcF>S znJOQ2$b+UwEPv=U@=da~y4nREfFSF?-VK(y)8zH>2JNMAnmJI|xFe^o8Y1^EIPX5RO*SKVv?M~5RQcRgQI-TbU#ULeKCdE4K zL*-Bs*1#+q4y3bF2)FEs{~ZatDm~(X484tC*+`Fj(qdB*JCtS-0vk01cz1uhfdCuU zg#B@SJtL~-f|ozwEB@ZDxP@Z}YE>6z#+~ls2QEz|xP>QfRUrC))7>Vn)=x$TuL{jG z+HR#6{zL@M#flj2Xt+URoc0pfLNJQJKb!;ZTbG!cT;es<4ZGcyxY?=uGa9eAGP8^H z&%wPXCMOc>%+o81IB1<>mUs8G#koe8l0Q%;PR@1?9N7gqDq&3$R@j~9=omkp_h(cf zffGd*eIjL4e}sK*#nDEr6*$nur8jR69po*Ma=!Gq{b0)7HT2?n)vC;k@Geijn z`F^{pOG!^umhb~MHCQwYDcF^>pQ)%&opT|z#&w+5Sy2pH7Fr#&d~%5dtte#Nn*Yx? z|8AYcBwwnlVGn(~E9#JCsMnloVHJopTB~irLNTO+3##6_9`z;{8|_N6HDf~?T~3JY z9K)Eg7u-itvXbglQ66S6FFEMZJAUK!CGUAEgRGBXQD*u+D{c*+w>t)uPpK>rj^+3% zpLxcKdM@!yhet%o?Ivk6No#i#I{a|9uWyKjWA!11zqSM7*Cyjwsn%>@gp5%(Bq$sj z8g@sDzuIPN@kN%7O`VK7a&(&3MQqMUIwyL2AC@q?;yGw&AkH08%RweEz)G)x><3G+ z!>|ugv;e0~Hg|J$pRobI?xt|}S^ag@a94d9?o`OfzDXff+h`^bUVnQBc~!Ey z`0OWwCfkZU;F;*omvZJFMPRycsbdPK_!W0C6Y~h)rt3G+h9;ZD%;e1B< zHccx6G+WpJ9O}bM5(ZN;X8Q%?_E?)Jn>y)QikT_f@ndm?_-4I{*+mI2H>_1NtQib% zK^lxab4+oxoNI`OA-azERQROMNAb9&(%%*h+Fia_)t#1!f0fmet0LpdKuoB~N>zFq zf1XvpOta+NOvF?$y8*WYYTwffrCqZ04lD@7?-I*Kk9a`{4UD>Wur2|;X&UYtjX#Q& zyMZk!VwQmkJ{kfDU2Q=h5hBgJk)8pWIfcpJc#)D6iMHH0xgTeoT>KVROIX2lMp+?y zB*}6nAGn>!t0}sm@XpWAsICd|WGU9XptJz#tZ~w$VlCLnJT$UL1?yeP0zV!~@SDQe(%7sS zOP1oeG=J=kCzj7P_B>goTqd!i?YWuuWA{mGZ@2m+wBfV7Rsm1bVw_Ds{O+^hyB)Vy zOrGYyE-Z#t^$Cx85s*H>H#*`5v~CbIUYiS#+?$xD$M{zUenFvq)m|@~F6B?HBXD?x zqk!S?ni2&Qvm@r%Hn4+{v#`4Z{YH$im?{N-IUoW|QQfu^JszBotD@)dCjta3buKeK5!yiiEa zfTxQZZ zDy358W@0n2n7|NqfpY$b59_jb`P@91jzpME0|;W(a*XfBcyH#fR7XXce`fwX^m^7q zpIJv51`W88widgh5>6dUJ_AiA$)?MU;oJ|ns<2rWU+La8HPRI$v_vH>_K6_l5-P{n zoRxxKg?0qwrOfAQTz@oafx^?%tJBOCRyw^&w%+b?=de04az!UPnDgbj@a8+3 zMD+tS6z!O;m}V_8_pP{eH%|n*$rTmU&aakxx%h zm&X{yd#WxbIX}#BD6_Lwc*Hiyhs#s1nkM4CZCdH6w9evkJVWR2daAn`Q(fa16eLs* zb{&C1Ik{*Qi=VDL3G`x9ZWyI@R~eytgr6|d0TMpj7iVKJ5u z962gn&pvgxYh9Yc*4Y?-Jri~=iX8K0vcgnc%7NaJd)?KuaBAO(BR6b@yum3P{b6V4 z?VGKi;j*FLUTb{E{Ot3|0Gq_=*#+iqMv=~)jTOX72MKtCOW47xW=RUM4g0lK$88Zg z@rl;z3X@{aHo*7FcHV;@in$A!eKE-{Lgo!Cg_n{$4eMg1k*_rNNL+nI_5pZcopcm%}v+eG44 z!=LJo6pF^fd>ozh)mtYa{d5+6X01@Zs^fAEA<*2)Ahu#LN~Bfv5G~m4PzPnq+;uL4^rFOm zcg*7c6*Q-8n7(JvfL+2C{gv-x^JKYivnj}C7i{|~iQn@^e-~^gp0Z>1HK77>C@-+b z7gaIVTm(dA@%Xpqtg_M<4Ucu#ef%8I#zQ^NwUXjE=gnR z!Ae^;=7Uj$x0ll>O{wxe^ zI!4%)^%A@4vI8mW<&*+`9o!Hl9b=`|nP*qX-+mAc>FSv|HsD^3VHIHX!~+oCKw z*B@^aBCY3E=*MI8I3cv9nr%1q!k6$w!B)hm_{92gytCMQZ zC(dTh1e|rsJ(qJ_DYx?$s0QC5tSBPlj=m%TG#oB)yk9K3g|dm~kWC!jf+ec2f7ibMZk3+H-`{=z-FLrP`}W(l@4o+jeeHW_ zxAx?_^>2TZtbW;P)c?$pt|rNEM(4wY?Pgj3Y?>}^^S|(i3F5!)4nVS&%}@S~9GKYT zN(6!fi?d|AnA}V;Enl)P!86o+;4|AFKidkPq>~&UnI}}fFn(4<4^T>t9-YMx zM%i`r1O$ud2}3V_##0X-axvWK*#$#FE+{d!^NsOX{7%YAihj)BJe=K3GJuj?1j*jd z8tg$if2r}wdj$H<&&P*bM{l>bcRna(XMzuM;wR|0Ve(TsUmCc?E>2oqn22v{FqmSz*b$;bvX|aqvYMXf-?I*gv-Cbe_uKyDrgI9& zIq4;j(9IlLz^2TQBb%T-%{|xv0YRKBw*_jay{Ws2;x&1B54MSfy9oR5Y6(QqF zas#VaSh`_Rke_rs_YFJBy}IldDnby*VwiLbc}?s(9}ifEL%w`%-@P3O;!aGiNhas@ zT0u#c(>hB|2p?#pWl~&Ck!RR**(sX3RzVWH5d##;j1;J2=8j<3W^HG^wC{N+HA#D2 z+@?H35d#S?Iy(u5BLqc-QM2XQzu0% z$BL?oAJn*y&X~L7VUaA+cEIHTShBraciMc@ejY(ws@t+-sC6~WIe+mRL~&%*b&Pn+ zng$4-C;VM};6imaxrsiPhA!_SJeseJR^Y~Sha1|D`}yO?22%Z?4y$u4bqn?ql@@71 z{oCn{y8%O-#sO{zp`E&a?pErZYiri!lJe%_2vAANTQg3=JAt#K{O!4@mKY$*%dskn z;GppoNDJ-`4^jwOGQw8YVw|l+$Dc&ky93MS66Y~#mcHpX6=*6Mz(H)X^RPUf@K7#k z61!vxm?L0XV6##DD(>&JKjB=~WxMP$sGx4i8z!C1j#IB7Ei%0b(miW8yOGgm)3gO_ z2r&CK4pXJcg~{OA$QC#!gz$+fmeL@>*<|eIC54O8l(b>!M(8B23|SlK{Wew3271@l zutn7K|7D(1P(w)Sh#lG;^6MV(NqI@-PJB%(Dl$z$eSE*=r45F}?%{}<~$B%j_qW3@k9`T&7R2Xh{O6l2YKr=kPjtiYH z9^KSE2R>$;kJxj&T)*ttX+KW#uG@0dS0l5@3w2ARQt;LJxIa%Y?k#QsBgYf0LXWxw9%e0y^$anDhQLeBOo%$<994f`S-_k2;c1P^Y%$Mf{AiLfnfyG zwk)DDdj>a~ZdV?Fs^@@oO93A@lp$x9++=bM?a3q_?fHH2*A>U4&vLBJf$R0Ro?*DE z`f0upeN3ji66tgiMRL>c@ibAaLZT30xxG0Z)|$JDl?g87ffP8T4nYqEz$MWFi1TsP zZy=w!5QjUNpz!{TzDdB4io@<9QHvj$_tpex=Zs~0aco5|38E~hBVZ|k!@px1ez^M* zq@b;%`DmMuiIN@OAWy$-5 zB0b%1Wz`OO0$-v*BQ&75OY^~P#uQpxe*H zVHSy04}%x5O@o;VVaI&6`epwN%Z?2v%p4}J>}=uU$j1G1^wvU!4&3YJD)G1bdMWG` zv7PW6r7s4~c09C8skds2E~oNRz&e=~7Ip>?nSOIzr{r>YIB6)@}@I z5}e9*4crt!JbF!UaRiq5!pC8htqF??&2PH3=Hw_i9O&$2zSex3;~YTF^%$et;58JrRa48^EYaOTKSNgPV}o zdyRxo5M}$$32l7+s@3g!UN-9=??;6zVx0%eBDs!zC%s@7%9nw3yg(|&3r-*N4g1I4 zoxPVLtk>SW@l%%GG%X{!e4X%KQ>gU?9w7~Vc72;K9szDNxv%tdU9S=Wn$f_CVEo0uJ6p&r&#v- zs>fw4wH9j`Cq419KxjOI`*%FPF_|lUkG#|prenC;Z!nLXw_O`13NHeg;~W9^|7K|RZ^*jxdfVA0UT=#6+2vd|%=4MyBspT(UCCh?B2RE8To#vIU5wuc%LF;&PP)X#x_PpdoCnGO&GQ&F}ui%UfrES3p*aZoo$8 zRjq`V0-~gePDg?IOjKX8z^3+QE&?~Zm<4ObWL<66FX7ht^$)REUm z$2)IT(_J>@`qRO7_TOy%$HAc;(kB&lV?wLleQM=x0Gna~K%%$*?#=Pm>mye8(*d5n z&p%kAG9)Sw_hotod_r*bJFS+)blNNbZ**ImB#4oY>?uoOB8Z1_v61~<*zca1lPPt% z7hY7#1Pe1$Be2D{t4M5?a!Iff(%_i#BDaKI?>PEE^GSr04S8|#%ZS+kR9?;4&1vbP zJYybpR-p0JPxBAZ_m%nzT@Bq#i5BbL!1J%He*S9M;Z{PPdkKv%V_W6gYsp5Rr0P8) z$u`u2d6AW6dX|L-N^B|y&gLai0Uut-@$Wgh3;PhE6Mk7athK;mXk*SJ7$NsFo8=`t zy{n?tU#18Ufn}a}W^~KGF&B;p;N#d|h^1Xh6;| z{XfjGYb+PigG{fkQ>&LaQ6^|2W7NNdZ!~tKy=~~$ZS^!)R*nB}FYExm z*#CR&`)|Mfo$>$v4*kEsUwiT||L=dskM;l7&1VPjQIV1+9CfHU`fBXWQ#gk6@yGI> z{@^_B=Q)Iv*IW5{4&k5c{$2I$X7X?s=Wc;v`0%fJq3eo$hA*>eKD_B;^%w)N;02uG zVb`TJBU7Mr^^AP4^~$hv)}M9{lBGXwM3i(4(mgq2!!93j1{$9}<^;G0;CzI>yC%uf zQB2=&+%Lm|sY%g>Sad|f`J)U~JiIA!I>1+Z8|F?$KL!C4^Lb2dqJCgJ|# zPjd9f{o}2lgG*}*>y`oLEwi^Y;wlyK!`>Jgj1PWK9uymxqn0jg3CqegPkTB@Co|1% ziU3W==xnW)zI;4EUmx!%?Z@mK^-g=^?gM=Cg188L&>44^ghB0`cHgglK-Y9@%W%zO zn6kut+Ece{j;{WjXS@D%Lb4-3+XXG!HOPT_tv^W4k2>9r%B^4!JNHpkN&!UJU{?{<0AWwTbtjl_%FK2hd~*&Bzb;`SZ=>d;Ak)&1sUj5?yWQNcc@$%Qdg5#j8{CqSby@*78Pz65}c?zVrn7-Fq z_K%Oa)e`Lv{k|Wg=UeQYEKRx<5)F8Q#13cV2AYuq&=3Q`Ox$|GOj5AY8<*&QT*!Q# zay8O`IWNEEWlaR3j&Vmn9vmL;VR05o@^g+(jL~pD93$@bfssC-Cke+Vu#HawCMcH3 zgA`k2QyqRL3dgI)mlL%hc z+Pr3^=I(F?vrgN?piQ^V>+No!>jtjC+s0y$0UgD4!@yO*4RWbQ2}~9R2q%+~vs-zE z`0}y@nG}->kVrQPt3FMq(>x>i$};?Un3Z)0q8Km#>O-;kOt=o^OtGDh62fI-j0&M2 zny19bX9$Baq-^!Tr=(*=;^3kwXH`c7{Ngs%_p6=d(BF7tnIDiBIgG>Q=Y1;L7kO`z z9XA^YHv=*_R;@xt4Qq}_N8D!VJa%--A%u(!oojqkv8gHs8fM+|aGjLJeA-8Qd)>kr zSmo`j&o>r<;p6QvIQFipviy&__SiRd+~9ut2*30`|Il5~NiKEOJD{mtyUEQy=J>YC zm9NBmqYEL~QSVNO9JWbWv3 zu}F5fwA3~_Cq(n?Ju z@_cZ2VQJE$IOjyITJU>2LBq+_HN)R44L>!4x9DG{(>olEy`m42VgOv%^)5tNTH_4i-@9V| z!rl=-JoF$j%~6v*YXY5VmyHKCt?J=M!Gorn8pXNgGp=7p3f2U71KDm{%n}ERXo`3v z2xa6Ni|CY1J#K+$4JE08$Rhr@>1ft4$g~yiB5MLZ0>(5_rxO*#`7zuPs1E+Y5G*&U zd`@FO@miat=xfq0wL61`kFLg;)FF0S&TeTkhFPEyxvbJNc$=3efE(%btoAJ?iqz1V zY6F#QDeI=h5!#{jKA7 zhdUS?VBZiZnmQ4DR3O(79h&G46z;rJou$kcB@2~bs6y1ArQKoUQ9Zr zeOIT}#hKRxZ*e`%ias#VBZnZE;ps7|WxtpBSyDNKUvAdyvtsHZFX8C-&s)8O$Bq=v zZi+D2tovYS|8^NddcU1@Yj*fYsyJ4s-9rr(78hI7g>}*qa(Xw+?_p?`P<2thSd77C zJqmXGJ;ngF*zzl;3ZtE_0TkiI?{^N5b`SPrJp|@4M}p%Zvv81C2ZwLAj^i;zj}ZjGQKdKEjFct|@eJi@vA0sA9e%M#yB zn@Riswv)gAJ@J2Uws|>6dVSG9;;!oSvaWrIovRLI^}#z@ z`4jy5C%40Vz&ekZlJ`eOGTiI)^2o_r@%E8O^qA6Qv{$PW?Yn9yk*c#labtpA5@KKp;{<)>3I+DqW^n{=E{<|E?t@96@< zLq{$kd%G__+XLiRqzRl~<0>P!jZ~iLRdV1{yONg2RZC?FMpgkL#6^z2rYT1yW6us{ zaZ|Nc$qs~65|wktlEUetYds5&w_cnaK3IG3-~ovO?AmQ#{^7wozr31C(qQ{`@4>hH z7TCu#W=eyR|L~wg|0aLu!Mg4{-?;JoUIBbC$O$vAj(b;_k`J#6SYC&vC7;qD*5=(<_)IzFi(WkJID* z-7s=^o3dNe4z_`JZzow!dcwTaEyFxB?9NFdEhZ45eDEFWl$SkD*Fq)kwfrDQ9&`QM zzs&O~?5&BHse}_N0P6yhU{d@Gmcj{qK2A`Ti0gwUet`h@y&ct)YHr#Q5z4`$FQMIovbPo7dOc;Z`@zgJp5?^BFfI&4Z z$`;V}r`f@t-98CFEl|dHZnjI6GG1h%%E!pnG`TRVi^HT4{R+8|;^s;}3>lR@ z_Yry83)w_-+%blW2?obnF}Jpd{vQCI$Gs%;^=hT85;>#=(ac|I14sC!9SFA!w-0S%^%%0p8|95#HX~n!V;#2#CaUTa_EdPZC$x7A#WxL z%Xia+-*KXsJVRe#C_b5zukDtTDO$7UV-_7_#lT`Rv-qd}AaXxoLsi(&w8;d6a}ZP; zN^xz0@~s$2(|m09<<4li8NFepQxj?~M9c`W{HAa^CBh!s9j`M^HVA0XXaV%QSEg5o zb8)11K>+&2z(mmod6RKIGN}q`#}V}4uwOfG!Kk%>PXRXCpS8}~`{9RPva+%QW4_Nm zblKUaGn>7i!E^lQ@ftVit|Wgr&&F76f-EU``kwhx{{+($ZmCk`Zr!#Tv$JG362uuBP=AoocZZYEoVxJ)g3P75QaqLa%T# zlI<=Xv!#}^U>jD6&eUB_)NlcjuDRf9n?9*Doi#Q6wyXAi3K9JZJLTmVc*J5#XwXZ( z!%*DslBddUS#TLX$uiPP1H8ITUd(1aVS)6lXXt)9RKmL`V}UGO{Yj(bY2KbtlE^}nrZkU{sxB%Dd`%O z=%bLa0!<~EY!Yq<#j?HK`A^F#~d7B#9Ww*SqB5LF+-Fw?Sm>r@%Ye)dWMSLja4Gt5^PWRo zg{`gt-@(j#iJSi?K^96GNONHK-NAsTD|mpludr?phE!j1;VG7MoF{Mn6lel?RG3}q z$Xe>|`@el&$r>tNl=eS%W6SBe zjbB5XVN1Ej6@*O84w0Oagdwo7f;10W-eikz6;Sp;gWZ+IE!oTGoe-veoXb z`6L@CFlJpZ8kyiUVh4HA2#`o*g*z*6M45|xJTGB8JDi(OBWg6UV?^c0l%Ck8&+kf1 zN&?qI%rsd(?`FRTlWMAsV4L`aWM-$yn<3 zxd-F*HC%3b1)CSXjzoFRge%a%sFoC0H~u0uvVJ|$`p^H$=+O}Ux2ZQc%R$xQM~%$0jy zz$eh{mCIss?HVmUL;5hzj*eh!1D7?UG<@ixaF*m3r|AgG7qc6xQcucRI@H95>{g2< zI57lrP>kDHY<)cYhO80ffz|RwX5gm(uT@fv<0xlEG0-V?tL1J^+-lz9V%VbaH^P?M z(l@MMfT^{!Hp-M}T1L7is66JI{h#v|-VaXfKlvk|%ML;`JuzEl9t2h$ivENo4kAcJM_oFgsYm z7WK)aiadR)ReSPYG9@=#3ewcNLgWqgsNYMZ|5E*SM_uGI{jQWGqE9aB8%uGeR@^b} zhd8^(o4gv19T5TxFHGH?2M^c=_bE}5LeLKi4bgb<~F|Ll2&S|-Ol{BvM5I~4w8ij@^ z%(|=H>&&omNMt1FrxaDqa{k`2M)d(goL2I=hE|S>obv?R&bcR*L2IroKeC(zYD~tuUTVWM)Z>GnH>nHL~DjR-6{aC`-p8 z?ed3#Nl`xD&XSF5Zgho6F^L-M!D4XQ=#iJ`c1*?=z1W^6Os(G1mBlt7kV#CQ?*7LW zNgfT-?m#-F??=T4RQ|k088Cf6pDeG@-}vi?9+!6I)Td&$C)ztG!mo3RoKb=LD5Bb! z!)Ben_qHgPqYox4D~VV==u2n_!5Q!$GzPSQ?_+-k0$etE5Ku`++JC?9;ExLVWiBz5 zOb*Cr*Oa|F&3vI~pgN~qADRt%NRenWn1Vo8TG?9IeURPOoq|?jH(dQN0|)^>E&k84 za3jNQY?!Q3l-dqQda9-1A3x3|dY<6;3`P>{(U^L=z9NTtlVu>dXa!Z zN&;TJ&=dDTtO7#_!+T15nf%~r%mPgl6FzsWaKSh!7ob{qWV|hbCJ>mNaaN>{r&>V( zrye(Yj#HwFZ4vr;aMeP0dHK%*N7x|TpAUC|F7&EE_X+FWnxOk<7(N%c((epZ{^WD` z`acDnf4&Pi|11d0;QX^Wt_)`5Lcyz&n*xhYscb98E{fPT3nQe8>4Q5O@}WF9BMnPJ zVrtjJKGIj|M5K+5L)R`F+zCxE_Z?7|a(IK5BTu&cD9B~tcer!UXo-bb=NlpXjD3PW zPv2SQxuF!4l{2IlzOW#IRj|(o+|xI6W=x{OQRfAv8g|+om4Ght!2mIIeLPrx0t@`h z9EfE$1@RgH4?yk-eQkM;tA&|1+rY=QV?x`fuLwUJ6W6F}AM`imcKR)pSR<>he8966) zC#lNW@U5&rpO*Qh=L#wgOX>WYdfjr#Gamfb z#^B_wVII@I9=oKDa8HpWJxXUj#{}g&p3eNiY>x^M;Mx=T5AjCxNx&Q#A~!0$p4mR1 zPmF=7{)XXmjz{!q!yR(i85YkOBSu;>kpDGo&^owOr3c6jv^nvclx5EMW>*myVct1!ut>5=a{bPqF zRdiUFE0NJ*AvR2SAd3tW#s$O)yXqP*w#qeU`ZS~O-4S^5A-J2(oMQx@%cSk)WiU9# zVRMs2__}WJ^~vYqYjyja$Pyu0hjm(wg4XhyRlvTrcvJzdNo~p6V8=B^m)#_4O%Qym zclX3!+fjeSTPGG+LgE-2VK62}0GU_;WMVlQbGY5vrY{;IePvD;9xQSEFuNfah)zd% z2Rce#xO5lMh@H%%f!$zeN8q^#WJHxHpRMVEIFn4g{{dYmEYQMt!UY4CP0S!}*K2I= zW>ph*L~sP6c~#-?;i?$0cU{$dB7mr0Rj|uQNUxfgh1+X+l(qGL2c~=6B{X$1CfYrm zqIqBs8^^^*io=eY!Z6J*xoA#Pmiakee#)Vb zmuJ)b5;G4gq-f1dJSGEOk1gBsNUU}} zwXw=$z9{iA|0a+1p?QR0X|brwPq-`r{uhLl4NgJ*=HR8R1A&>bPo!vFgI5P8Jj>br zOP5`B9r%aD|BS-;FAa|QqTg5?|Fyop_U*cf|9V34U*CQIulTQj#*dBv(#_}iudVrY zKFTQq%*8TM^%^b1us2VW5e13m*&R~?qZM(C##H&%$+-^^b59=L8t65^e7bR*7m$Qu zC8|q9x}@5O_qnifXs`FT-t0VRoxE;UGwNEWEAupG-3upZ=Lv#(#UbgJZf6$lp!SLuyXO#7g>MzNofcjt)dLOiHZX zHcVI=e0UGT!m%*Ik+TGw%fGv{_B)@sVdR6>yF`@tc3=3?03CnFO1S<>x2{Bwq$s^a zcNop7@K>PBCR1}b3|4_metGyHslGa)Kxxcv#(4v9F}-kE;Y{)R;E7697I_|3=84UU z(?5qXbr>m7I}|cqIM!zkV_)%bvqHS>YRAh5*A8w=ocE%3QY5g$8LAzGf~SH>;i2P< z7`3Az4&GxpPFr!yIyv{kf~DfHcTtBm{5T-pHWBZk`6Z@d#|M<|HO<4E1p^QE-DsM} zEhE4}7WWTMAWRO%iwAW1e=FW=cb`-^hWDKN65zGtS62{IA~IRlezyE;HIdE6qM`5z zG{cpg3>OcOj&Bx#Fg|yQbOkonMNL+^-*V0q3wKUGE;j#?^C~B@IY3b-96^81HZ{2M- z8KnWM=ck$}N;(*vmGjfC{AuE7!jx!t+j!e&5)LuFjYsj*Xad;XCUMIg8sLB~`lLXq zpMeuemPV3wf|TWrj5n;M{vL7+ZXJV#z{p_^vnzw(g-32_grNgKiO7rI>TSb+` zLuX`GEP@D} z%fs5>l~q@JbkzMuOTLV#8v0^no>#cUr^~+pkt-+gjd&h@6$Eby`4(u0DMk5Dr?mu*t4@RJl zk6joPb40IqkB$%jxV!&y=VyXqWh9O>8hX%21`_O({D81eo+d+i5D((n1ZYt9fB_gA zRznyF_ewbqjnc@bm^~0!Ty%uV(B@G1EKkKaxQNAjf^4oBOuWp*p{*M0E7{rd2?;y}>Q zP^ivo*A+=~#nOI#7!%dX1iTUE>LN;r_G@mU8htYxJgL4{Q8z=H2(C^?dQ})hkqm{%PlfCilsy2(0b$iJoq-Z7slIY=xnTryy-~@W0E? z$K7fZ1eR@c+KmT-7C5cWi(bFW*Rxz)ofkMJCf>nc2%vg%!7-cQ=#(QBUQ>8vk9sHE z@AN%)fBYEjmw=kp3v@7`?k{>J&W=C!7}}PVru3=#Y1njGo7OXX8dY7#YI^bDMa0Y- zHr}o=mMUI^`tU}HB+yj`-J?9s8lS#su)B@5Xau5`l>r)i_*m}G>2p80S;*_w`4Jko zFB~tT^0I+&TfUHMGQisxVt()kvHL$ER`eCRhMuS6!AOdP>>h}n@#fbOSt%ZgwL|n1 z>{199+7wlLeBt}lZ*Amm&|3H7*8a=Aown8xQBuWJ8>t^#{f=fJDO|LZPClauFRZqV zb)#){5{e5HFLR1wkA~t{s6gZ7XW*r;7Cu~RGP?0Zh-QPb?=n%Zp@-infT3Nf@N-oEIR zByA=`de-S^ML7(Q1WJQa4$7A0Y*5T+o>wvxAVGA@0j0x{@|(~a6EHMR3%k@z3Lkg6 zin{SCI;~&ERNERPAo^5C=2bVbs4V$y5MrHq6PQ@~EPE5a`DJ=T`qU6-0S$TyL9a9E z2J?eA;ru@RdL+=;(O-?(oKx�<7t2KFVh|OxOk}A4vJtVl29cUys2m0q7QRedjlC zw~p~@+uc9j-a0xysuk!pJOG5YwEG~EgM2fe&LXXm>+K*YUOM?I94SbPk@i9fY|x-_ zfF2_FQbL8gDT%xr&q{idyzBdhxj9tdQ2%YLWT_v=-|zEv?aQC{y%&6+QTf+mvakV8 z>iX~YaQfHJqMuQe|NY_%=YGeZTm1i4*Vev`^S`gIe)li`zkkM0kpKNcbH5*_XNjaa zzHg%Uizvza_QB!K9kRUNHG4a0ogz2CK@mMT>qiebb$j%XOmdZHJdNNXr>cyeT|^Hq zFL+6TH!}%!P+bK^w_DG%aixy1%7b6wRil-w>wAb z7~L8dtOumrbggkdYGFNGj?af*g9%{LDpCP)V<{nmS&nd(_=~!G*7Tg6V`L5Ylv*0t zgKBxSNFX@R%8YXoVanx_e9TEZNiK%KbxA^elm}3y!-cwVnJ5R0rPQ%lWBvn2%gf{$)~J z`3{5plAq@En?61Tj+&pJ7E}4l95Oh zYoRVp)41h6_sJ$^K6!Th=43y}vG=;O*Ij--yCBGF$xtfHErt#Yd0!S3>$t$-#x`)| z*3bGyCmN}%DdR9>t(MdjwBh2POFj=e6DJqkV1hbXOs9-Vts!9B?4tEFLDq&dsZb)P z(-K`fKx(6mw3ecM^N=w}iv!boFsB_zuw3e5iB?zk0E>?s`UVc6trDtXG_f1Ma zM3o^sYx8H%=(USY>Yq#1y&;IXQN|4|PUtGBYl^xH4kvB`*Xa#xbG9rOz}Qtz7_($z??(pTKIVRxzp5W45LXR?uU4Hv~!4svVu|OcN;~M zklU_|(-*V%I_nQnU`z*^{ZPdObj}LS13~2jTD%_db1f%bn~z88<7$c%O8126pR_c| zO7cqmxJ%6gMb``t5-PTOCeKtGXkvOndAY>LxQ93>mZTMbT$uRM?!yQ5TDWEVYxbO? z&t|i{WV2#H6(%~3TT8_+xVoZC>_^>)^U+9`7>rW4wSE+bV!=eUtYqDuS=!fPXtlK1 zG^G`uxpcE^yw*rB2U^wVR3cU}{uDnW)vcvJpIO`@%ye1uR?`fZz6mjH<_ys81c^}w zkMW#TbASrzbPx{mDY$#_vVi+?;Z6?Y2a{Sqm8i{nrPmXN|IzH@?to}JRwtACVMGzK z8QvXKR}5cM3CNlhN*$n}b6CvI&&P*bCr8Iy+dqlEG9H0rH76Qbi$w!n4Tq)F{J4chCi5SyXQSEv^-V@?1p`QW)P*Vq~BFPikaPx*;|*4>F$*GcWfr z@CA#PEkEz)KFje-m)40v$f0{K^xCx;7dL9h_YLcC12aE;3G}GN5XJ@g1f#}eHXY={ z;fc#7wV9OZW#;mBPNjg`|7sL+81Z;BdGb%ig|)ll!kWY&V$Ltg+hX?s&0-$fC9fTx zV?H2VokpHw9s*79i|MsWPK8qw=8H2q&BwPWo{_g8*{E2 zUJ3)8Io}oek7(hUfN!IzG!D349k8Sj4QfPx~Vc-}|B< zZU%6in%(WL!d0fL@Nk#2@`YwB$I}6;{9e)QwsQ}c&yy?=1* z3(WZIoMq$=oOom_?2~obT>b$7zCM{16g@7EY`iR!Z9m9(Azg||wF^qp;-hq$&oGCQ zcTfT{;8R*@#T>~wP>M9g+ufr?S}x7-RXQC5<54~Zl!ErJw)Xape>^;R_xeZAibOo_ z-KJ>WsK#M=oeH+GU>YNwWdtyFUr59kqE5Mf*}*Q$$$HoRg(f6dL5?H=6|_&eqtb~&_1s6CisqE;N^tIiZ_CUk|jL48FECt^mKmtfA_m1LL2N5gE; zy$dm~Ld4PE-Ktj(5_OsxE&zQ*?1yM<Ha@kkg@TyH%kyy-qPC8BxUP0|-p zAxM7}5O#b87Ze}>+*@r9Mu#hmlE$rf+n(SPhY0^ibY`&sebeoVCJUKd3ys77$-z8Dj)r%W=y>j5#uTsy=v&pi5jA_aFC9F)p^W>_p-9URm{E%TVcG|3lUN#Z_F-5$x!;B!C+bi|(U z`YSFS{CQr&qNgy;ia1QMM8o`gl48U}kM4?HAYaK+KVNXgF}&ZR1qHxeQ*$Nl&)_;q zM7c{&1u8l&CwPibSOetuiJ|IBA+kJyQ{y~YnRKNz2Q`fb!B5UtMk_oJL1I%z zmHYK&RA*zd{QM%lra!gJU{@qw%4u&E{B>!Zt%O~M1?L|>?pYY99E~R&R)sm$abX!b zIWHXDWrC-gT0k%@RE%Nd4zn<|w4k+Wbcs?$jZ{@PMPbBU9d62SG+uTXSKWOaOoNgu=VNxtq?&Yi{m4x-@mm_#Adoe|j!<1W8PSy^2oO-en+N!} ztiV)6GzDsSbU|r3g6#h3YgucV8{$m?e@&{w0Gr*{MHc$+_GS3j&;5TQ{~w?|KqbDg z570vYpSACPxBA@^^8fk%yS3Hdt#baa->v=2|L33aWBq@0^VtUoHOz16$vs_wc$m*~ z0~+NQ`K*ldecjD92zB4FXV6`|g@|f~k4D*b^yDIo9e!$kii!!&qKuvjV1KRq5r_V1 zn3ZSKMg?%O3FT8K)9=LQ#P4X9NG;C`gq-TNtbe!K1Cc*dz6jk0G>6$m%IR-)2j6V{ z{QIrLqX!S*{F?Bo^R&Exn*#Xh&PNKp``AU%^!M9adwWz{RsM#)TZgYDbn#T`EV0Z# zB^ijkgvR+W$AS_!%$s3FCCs}ebvH_$Iy@z-=7d$Q3F%r;kwUru*+IiSGb_mcf>zeF zcZ%MyDNU<$+V$a%W85}&`Nuj($tW+;8wvl5d^Erk^J?R(lG3F|F&8iJ%{H(x?6DL+ zTLN6a%!|43*C5j5W6zM2B?0)7Y@|_enA03S$|eSS!-^6t*-VoQ`<{X5P}_BavMay? z8`O<3nv<_cGKS>=_V5_L)x{E4QRRX%A8q z94Id_`+GQ2`;^OeQHTyDhY!1qab~mAe%Om23lbILBLP^xe3~swSPIN;g+o$wlQw+l z5_z+6!7nb2t@-jPU2HbJATHe{MU0c@)4Aq6(tFvpFvcS^$k?KhtL`oXRJPp`!JJ=ndPYmrloHX#(zj!7kDzA|6@bDr&SQ{8MjF+ zMnvEGn!t$hFjS_jJY!>EwWq5u`87&Y1VX_0uLoH69iG)z95z1)$DRUMM3*`gV6gTQ z&K?#QW#)i`#{IjLZEV^?l+P}c=csx1n9#xAqaMvL(4!w`Fa%7MqT)zUBHSXEnSOhN zsYov=KjxDppH-^FLvQL-a|Zgx?g;Cht?nMCxX6@Yy*8~`;vadl&` zQ@=+kNB+i{urcttmKre{CU;p9qEEQ0WOvLKTvSrwh*Y?1n&wg&hSa?@6aZmBp1h|C;L9hK ze=GDC$^%ztD_1lpXweaJI&{*8Fku6lQZfP5bc$R8VWc;2i5_40-uRx?;1{1!>O3fD zxumK{ML%$D!aS5Ei#hYWFtlSxHumY>t((lv5d9*fy5mZfTFIo7to< zaGdl7P}}I9e40+DdFBDt(=qL_3kQ7sIJjcDEPX8+k!BPT=?u_loV3ZwcSRkw(Y=jC zF}YN*p>l^YLc!oCO~~Z1$D>ZfDLXDXz&m*{B*b}nGp57_OM{z%ynx^E4Q#!L8zB2B zDf4_Av|4`7lHtmjDyA$mx{|z#Q?5ZNQ4};GQjEoW;b&3|wyu1)4s&fIM75r-rkA|C z4Vw|to5`c-!|#Ld0_sZB<>!}!6{5I6*rN%ooI>rmSX_A2TMmW3-?u7M=i z5f+}xqQoc%Vv~;Wg1OWXb^D%f9v8YUx675gZvg}?WZgAg`lU-(M@ay>>c~_VYS41n zj&Pmklry%KbOg{{7OVLHXj5{7>AV|LRbb#D&_l)714O38YpGD@LkU=?Ym+}6GI|7J@T|WdAfkNhIaNMB} z7K{t#2`mz&U+k%eE19IrNkK{&uI$Q}hs0?RGgxNn6qrSdjsu{d=V#|A8#&mY0+GF9 zE|f-Rw;JY2fwZJD%rpPps3P!eZLpWHOp#0A5yeuhHBN5clNSr4W^o*+QDLkRN#TXkOugmham z#s)0U>x^X+y2zFd`;vg9GG*1M$}JAuZA9-tW@T;wt{&Vv8jE9*Di;lwBCCebvABU|BRpzgkcotpzp$_1Ys+5H1 zU?LFJAQjeNOlmx!bqH&hdk?Sd2+XmZNUS~G_z`d|-yH(_R<3*RV0&xNvE4}3E(IO} z2={!-&+9gezUR(Qz*nPiU3%#{_Xj~Ph*MVHw=+`MVxTa^F4W7&_?jXcZejhK8Jn25 zRurqXs_6zL|x1QfI-;d@3#;3kBnEi|3KZn;iM|yUzr1_i6Z=DMyHMP zqgytNeyQJ?U{`~ZjnXP0nartlJ7<=xxg+qJwy%|5S& zs@3UX5{-XpfMr)OpTHJ`Gq0H%wpuu)$c^2Wgyj5N9FmTPrGiXih=j`;j?SY9Kt0D@ z(LmQ}aYM~UE1k`$F%j)@`RVU@A7F8xIh=tBp)7y7z&h zmVw`u5<`*oys{Ze8f0PE!Zd*Aw?T5cz34Xhg&GSIbnB8Y|q6kpG1P z0$9NSYR?M#rOgbqx%Dcwnc07p_on7%mVp>-b*wJujWjR>89+N3S>HBz9*&wgPJy8v z@(Tp)<>io9F{G+1Dn?>dlk@a4Gnc&ZErvD`khAe1lJW!0XBHY^t#n2m{G3guJuKOI z8F*h84P6o7Bc_;nbG25+(5{ir9X`i&Fd~C>C{F;JPa>>Gk8iSE&nNHm4=bF8Lt>0= z0d~XTE~^)4G4pQ7M)PLohQ6=;`t{vYQ)O2c=@E2c96||lIo%mOmq4UJHQrW~jY^Z|&>pu%x(zb0AQ`0qA|fn3&0UJ;rj0rg z9tCq2j0Z9$(t*xOD=87wykf``u6hDoCnx#SVULEYDXM&h^PRW%5_`<&$#W*c%gcAy zX5{8lll|_g;3?$!Z&HvR0A=p8W*OKy;{rKap5+&r6LteuU9CcRm-a+d=_M8ARqjLt zIuBe9-tKoiByu*w)$~knRjS}MY?$r4+&7GQZ!nmKy?@wZ>1L45rT??Mdq^1})VVzWjEt89?tVw{VW9Z4#=qUMw$ z1exvt@Y)C(`YlZ`AyNfuB@m1ea?a`e`pyJ}aR-AfO<-+_$CfkFXy_MKe;`CD-D!hBMBUs8UJz@3T|}Vy`Q&J`USi? zL&_vq$gV+z!|kmZ0%O}qE9ju(CKM1}i#{D?q;y04#_~kb1((qwAhaw31xy$E$(m=x zqjn8A;RcgQ2eV0N-4yw96|CCghi(PiFax*C=xzuP7k)H#*H8Fat5q2kqM-?O}in6jO?BcV-$vi)1H+*qdK7!xR#+PIN z6=$D;$N9A2G9EF{V0c}b&R04eIRm)$AZaJ$drpVX^!*8UejQK+Rgx23ZC9(8z|kl7 zEW+Cu2aPAlBPwOBiZkvFj}VXDgnh~^`7)WqvVrGxa1m>(j=FHd$o3dsmE>jS+fYcNs^*w3HR$6`M2*;_jq7O$-Q->>bncW5IE0RL zO3OToK!l>mgknlVmzc&l|C0t?QIQmm1`x>DV8eVeQdZyIk+Vbt|KtOYHH>wTmw*X) z1w#Anc$<8;pu;jbn!ImBWulZ9S#HuDm4sNb#{LR!ygXR}4PX^U0^aSWB$q!~fNPi7X06tXclC28|nbXm0fZqs`_S&u+frUd6pGp)G_ z&H^N$IY;^sdQDSZIzs{Qk+Tk*&4difI%xiqsm>x6b~*!z5iOr*Qn!od!xmSd2{^-n zFB}sn#dITk9M&Ye>X;kj{cNxh^Vw)?M$4|;*W`1703>iavKO8cLWi@N$CC-VXX82p zl%Mq7q$YhIHI2%nGuF`Kvd5w`qUdQ)aR>s03%dU!!}BP-D37xH11~zVg3`Fl%Ntdb zMx?N#NU$0PH*n(cn*{`Hz@G-=Yv`g+W0LcW%4kkMND~&v`Y^2mgIbkT z9PNfcCFG;OSH^+q!(#HO^Vj2+49r*qH#$}1GD%o9F9>z4Itz_XBkPHGAz;uoXtlNm zgHl~XvE4U5#x4sTzX%g*ygsQL`{&dVa>k!gYzL^ZaX5KUq7s-EO!|If#|VFbO`VxV zs4XKUiH{>Tf7JR5>z;%z!-Nk60k!2YijP0U4w3$a#Bbq0aSuN99%VE7ReS}46U>lWc>gFFGFy+jNgv~CB$hJRe^J{yB3(6~dJ-%)R3#QBEtMJf z?}knbuBk%Yt(SH<$C0eIMJ|MP-i~;KiuOxYA?$YW$>NdDquCw3?kZ?Ys_B`1hUms# z1#OfkfT_tag`FamL>HIdRRn`vi;0P1%}L;*{B(#)D~hbBt_`t{cpHqBax+Ac^nRDDoPjitwZxf*{u?{hs zFFC>45o_uq`Y;-WRDswN7 zFtIb-No9H=^$uC7kSKcARM{ud@PpKy0vi@20np4vO&q;4RfuIE`EvG1r%emFY~1m{ zJ=qG5$@9>4`P6dna_F$VBe%{h#k3S}K+1uwL5S2&`Dr5?Y}%nEZT@6{TSN;s`sYuT z@G}x17{ZITwio3n;H@UJ8U2mXbez0E9*2j;92B>6e1tbc2QB4-Z9`f_)b4EN8>uC4 zwa${);j^lR574Tkr`I*>YDedgZ;gdA00Ma+@-oNcCd}T~;<-kumgk@M-9|Nvn@NKPrE+FSAy#*0ZZSLCjdKXCx8r#l z@^i#j&OWO1Xd@*NL5+!ceV!8UF4@pq7&giJ!WUz#ya*2UW*CRTRtxkna^%JZUN~L3 zCl)M~O77fYe(mTpp_o_Q8ju*aM&qg%;jXzNDFWY(1jj!(=<+v_kggO5b}8!8q)olr zce$r^ugs?d`rsNcwD5Ttag!u56}0!9Nsc4C#hOG>MDXqCDV6cg;7c~ROEFzB@Jx!AKYf|WMhBWYw%2&wEhKiWEw!lVJQ0i`~joujp`jaafJ%G@dS9jv?LRI10UeubNbc`qH7a<;>6YFeVadDkEQ&Jql3JoUWm^yK8sqmZ3j(ktI4quAlL++GiQA7&FX3UQXV#g#608R4TF;HWn6Ymapf^jHT(TSZtIj0f^O6gG+ z5+|9n1JL-g_$b|8Z};S1%0Z4YZ4Ugdqbr2HJTpo+Hj{)PIVwymK}oPoT}pFSrUkN~ z@vC*d4ZY;|hdX-*+dWG=uPyBam=MhrRFr7k2J7IZoK(CukR;7K^jrjD=;}>N1D<_+ zLM3Sy=PIa5Gj-nIx>A1(#cVMC2-Hz&0)CD}QbV0b46F?y_Csa^+?aj6{Phb+gEh-j zCBqXo%CBHUPfObmfiX*`=)ho}`g_Pd8h;G_f?@Cjk{iQ6p9FuQU#>31lOl4BLwN1HF@@Nc*4O5ZVIFV?vju{N;W_3dg{1v2t`$&;=@0Xp++T1 ztP6)RNbg3n&zf{&@rmgrTc_n7{IRPJ^i5y<=)Ut&Xde8_spc2<3vN}tXJyM5L(1hw z33H)Ta;0!Y)55V#2uc)qVq#MMU-tgJuZ<&F0EYKp`%_HVwMPPh0XxaAG0uZAc8D?f zaLMKzua}>YMleB0T8(5w67Oe!>)Ku2Gb3cjyXQI2yUMPSX8KxPU0qdO7w4AIjOd&{ zA7~rWP1?(CI+#Cl_=Vq-a~+Tt@c8B7*6Y_>hsoi|-p)}%&wgj4jtdBGB9x_a5xO+S z$*_;X3ef8|P^m2@>2v@LYs%ZcNGMVi;5iaMj;YB>izM(A(@N4dDHFi7DO0}0_efm4|k4F4)^_)iBmiKPr&V}o#D6(%h%81EFPL< zz@+*Zw{Lt&z1N|vja^@HGNdQB)Kby#BANPphMI4OnvtYV};5Ue_o z-z`~v3lN(zRP=oW^ZCJs`2t>_>>UHQ(cCbQT3!y~lU5stH>Lwr2Muf*BOz-hk4~g< zReW$(+``J-hDV=?3NnbA^)IcYU&Z+dtFHi*)e%v@;lq6({c7;T61O#PudYYm{coPe zn}|EJm~EuNkL3y*uYck6NnLv>GE=EG8ReiOrUo72+81!}k+n9gCQ?UnWvDR1PyARp z+;J!HnsueL%eYW=P#hrTJ|fQCRUPNAHEV|!RV{CQb0F0+iW9ePwluPfzoyAsSsj%2Id7 zWHGVRaYq>Cz{ZNI-{GuH-VdQYK3@@byt6W(oKx`kg8y2o%Oy~kI0-bnlUDNM{=vQ| zcg?Zbw5*=`f?9!F@CAU$ETSws{ZnBBcvxpz~mH7c6l8!8^ z<_eoM$0@oVni)TJhBX!Z5iEMsVqSQpD_xZO9&Pp6N0m8)pw@snO&mn{a3gJcxq^df z^NWuuP0s|?4-UCt5K5P6DNtKOZ&5WC5a$)9&9M3`v;c@dei>OJAz302+BIidb&y3) zHs=HP^zh2~RBCLxJZ`1E!O2zL9PYenX(Mir#FSx#5k+g&2Kp8S=Hyr6$YF&(dggp( zWd#=O-EI54E^3U7&ffCpg`41N6=#klyqT&|69$8qL8in4V3e&JN6;P0&(!Nw95?QH zMR3)sXw#-RPf0^Zl?b$_@3!0L2ggTYw-q@Fm364&?|AED9$y?UAl~S{F9y7Ohe9> zzSD1yIbZ?~w4TP6EjOe@^)K1 zo~j91oGhTD=7KsI@~v@-&r*}+Qg&|@2CX^#5;*D1qM3HmFhb!$sGI`2q3aq^!1}r0})x6 z<#Jl7%&R+#14+(`J)y#{)E+>(Y{gz7P5@XqWoXUxd+~0$T|?{ggG!VRM|C#t-mcvT zlvZKGjSU&v2C~4q0`F*VT94W?rLJO_nj(21MPl_t5uI0r_0VUih#>gd$BI3_Rsz$C7jE9>Va24X+lOspkq$*L zc|H{iuXpV1uE0?E`mtEm<8so#$u0TA!3j;h7AGHURdUMwCZG~aYprD6*xdB;YeaQ6 z8Bm-L^`6|fjJ@q$e*BW6(~HkKJP@PV!feU%r!nQA`I7IvNo1VEODGHSFSt?J@#h4l zSd=*RU#5MzO$o%0aembv-%w7QTTeh!7&f?yAPv3DQkpy;jaNE7O9N3R21S-@-BY~$A2BXcV?5Gr*lNSmVbmf*Y!fTx=}BARWJGcTxyvYeLsT_ zt!;0AcdusD@Wu|hwgp_)nkMkoTx}3e)HFix=4wSWUxbuaTZ5l^icT$*GfkG%q;)2X z3lj35Sb9=>skcyDN8ysbdYR77kd>^}Y^A>AtBJMdEl@CIWiHuh9!5d8V07ZgBo;TQ zQlr&YoH+6m_zAPcZyBRVFme7+jYU2<0AB7K>I{aM51AY(V5B9gWLX6@^VX^(4aOro#*E|0e zyx#dQJBud~PDM@c?L;VN>pl(ZzKrU=4C}s(hP8#ZsTQdM;6s6f5IPFpYHWYD8=^Z4 zq;JOgaGXzW@4?~ookN_M(B5CykbJLxY?*KVgN*J{irdf? zUxPwxR9wG>#TQfDd9L^)DD*HWWXk?MO&UDzc2NvFc^gAMHRtZ?0d)1?f$Qs=R`Ly& zhAtoB->+NA*Hj0~-cNDU;nvdP-?ox(v6%b~n||^H%07MS3jd{*{JCltR2a|J8S{A9 zN)Q6^U#h#g*-D`+}Cwz(n)FW}>N%0I$L ziTGqnu@3aK4%m5;yD^g!6!~h?o{f5UI~r%`xYi($Hr+gfNT4%RGj%r0AuUK00?Ort zYiw<{csx!W0|O6*G-oB|7T0h(d_jY%J-$lu7(xkcWYO}hs9H82s=|^Pgc2~-E7X9K zi7#HmI$|~)y;~t#`P8ndu~A;<8Otgo{D$Jk`i0;vN(2i^f~0_&Zdlu>J33o7mr{h> z0vb!Fu?i0ooyN^l-haQ|3a3p(CRos6Q5uC*G?F*9?BPJ{X%OQRpURmBMPvq?TLXRZ zV1G{}iIxRLDYVGUT_|i|h^nh!)&hlT)xXjR|47|6zPt&3aNEwoCMqpf_#Kd7=kaoj zZZNt(kGvJ{tGiOB6kEAtf!%Q5;#?}&%ZE~q_B9&ASYs#msg97+XrTN zl+Mm2a(EENt8HnnnCjPf%AIBB?2FxHyLlIaA?ktxvQrFPjGbBxTSP$tKU7rAp)$k1#sh3Cu34-C;bcjKX!bwX6-}(K=pT&T|(;7?d9(N^PQhg-WaPcuIG^}%y?rHRZ*${ zJOjBwyz%U!g{GvXq8v_vWt9QTnzhc9n0K09;4GtHS2Pd2{hL9v~{4)Hb8 zYd0ER*NqrLWD$xu>Cw@2qB>yxYf@ymA)9>9br5nHJgOn2iMu`tN{n;!!RX5XK{12f z*y_em!jlr3?L0?Nlz) zi1akUWTe9}N*4_b)1d?qj{S)h-TF?Zsmb} z(ETj%+=zTem)D#@F*jp&x3?*tJ+jE)6Sr55>_V?12QA^`?*{If&QiHeu06b6y&;z# zcl*10%|uufx{wnO{9YT@rbs1TOFzl}fovtIp!}rHhj|ZU?)pi+x03Mtm0sDLlcJ7c zY=MgTeWrCr5T-Y&%A({W;HHI1?-NIhcd_poX*Ev-u?T0S>}_Fic#fXx0&#CRM;@2l z07N8_=`<9tGeLJs3?Eb64Iv2gi%q)_zh=ivCNyc<4+%pI&Ki?nP=WDTW%xvndmV&N zq>f4n0dS(E z4ifFhLzpKmNgeFH#WRZP>7q`oBuCj*dq81H`Zu^w&;URrn+1x+#~~I=f+ELmtl0`P z5x!2%#sNoZf+bYCHU49aWxV;qh^%33dFM*498Y^zi1BJcd7O<{FLryjiBH+BJ|zeg zl}NT;`jp{{S-(TMicB>onrc)lp=@2B7gANisUm_ICF87gG^IF;q0=@-v@9V~ZTxcY z@=LQr7U8j4W6`$?2SK#Lc(#48cd%~}t~;Efyk|m{hz2?~Yu`xGW3L=NLE99*%|>!D z+GEaS5QZ!-%qSI!3?dk11*$Y0n%U@|afnn)ZA(FJR-4W8VMep9f_w?oz9fMAuix+P z?eJ0l{Gi@}r|J--c91jC2iQt>&A%f(WgVH|?)`FMbLv8CU89ZY3|K18Z5N4iG=3n~x!XmsWSr|`3@0RI5`)?AP20_tBt@wrxiDG?M^@HJ5nSG>yVq(huM?h!xKP%eT&{2lgq1Gtq%CuMzLXNx zy$+eC3K9o1_6c}q4a09i4rxK~Dsd1t1%RRm^+Ti)*0N`8Z>kO-TtVwFw`ylI%Ug~# zn6!K~%R^XGwLH$)zv8xO}IXxBywJ=bw*m#7X1G${`1c5 zu{n5rbBPGsMOX^i+s-~rvo5@;alQbzOJzlfeTX(Bez0)5?I{$cAGEz`c z#%ZS3Yt?~Ra2r$v0&vJl_Y_`X!bqtB0SGI9ZQ-Af$?m?p5||S)1J=czCQ#&SP5(Y< zF~+oXwkT%xd^lAY3|DH`TyQH5;9f2-wFu#}^cW)2AFn0tR zzDja&7fJ`^?mm;tI^ARWa_3Piz94ceYt@!`G2wa1r};Tc8AAP+;EY2DOWalwJP zq`8)$IjI8L??JYj;jmt4bcNR%!t$$bt!_VRmitG%-z)azT#5lLhwgL-he<<@jNf#d zHs{d-#YfSc25M_1j)fCa(d~ETO4Nz=%#czMpB}vC&V_Hyo!ODUdb!mBdoz73N2)z; z^w%O#Y5lQpex# z>|6GKZWcVagv2rY+|yG(NCCt6gX2h9#A(2x?o~K2b5hMUXCojC99D)$9!08|dGA@G zbvR#tXHZg3KRevndZiq23T4QoXpqQ~eS#4>UzO6_g1b^y4dbO83CA%oNW%8)N%d}& z(MYjb!U_>g&VSB}tl>#0hhFU^R*(#1hwHCUy0mla?T zv1u8ME+5DFN~_etr5k@hbIRzGQ-&^c=oDrE7W~WT2^Kv^R6FQnb}> zo*i-qS3mIT_q#8eaxUU>XJjpvBB0U-^e69?63GoZZRXHDkt2zb(i2zg!^!k9^jVlZ>YnY{bL z9?6vo>v*74Kprz}QB?{UNjjH`lbN{Oy4*y1K%U*M%IcMqz`AG>xWUuH*vFHdYqk7P zApo#G9`kHhScBI@(i1h)g!WKjFH9V#eE+P{F+3Qxh(BG`p+^?UB$uB}&l9xc9K#y2 zzfT|2V)k#~tYCe=8!=x=cwXr%+1)sLY6#n5NgnS!mY>2(jVBZ-n3ElqY_3oZhPB%h zV6V@nlgiA4FwCvvJ^< zgtI6sDz7NSfazB~?#S-xtIcG2&H5wItya4l3_km3S-`aiT&PZcwjJH%@j%QSUWGXb zrK7E}D|*0reh`1zs-4tAg47%?(msKc%9xMd8pD@!g=p5g>clZputEs4pD;G}KS;7W7E*BU0J=^8atzn_= zH_HUY$JEeQ?|H5q0|;FPmY=@wu1I~FncMCBaMNr#MLY}C$bCkaLJ*a7ql3&@GU4SX zQ1&pieaQ%E!I{KYE+5^BN@m?0Nsw~g9uI7S!zBj)hGDy{Myg)VrJQE?W>Yo5Gfb6@ zm2nma&D3hENq zh|b4Gl6YxMFPOv6DEkUD>>aMe!C@Kmm~tC!v+&_4Xb{KSk!K*e5mh#$t<>IhQHE0G zR6G4?H>-kPkO&jdf$dkPnz2I}_$Uv@+_vVk@8O(IN3fOvDc{TX*~rw8Dr=5>Vp`N` z;5Ez}l2)<0d*_Lh#zZybBUcq^_HpX6w)sBAH>sitbGmBz>R7$= zX+pIiszNmqn1hwSkFX#K6iqE=rR%gJu1#*mPf+`C+M<||^&z;u1yY6Uipg(QHtk2V z{sY$^UY0C~V@9m|VQL6+~mgWNU5mZJRzB=|| za#=3;0=vS8DIt9(nxMc5U{sq-cD>h+SbA(Xs7o(K(UpUjs5wg9X5!THNM&Xgp zBf(2&`0*8|1YUm1hKrN4j$`TCd7qFaV9fxlP7mH}A3Wb_l+llF-B4oK+TFw6+%N*W zv6qaPTh$Gaj8|So*OWS!3Oq}Zo&|&)$H0Qos8@eA&~eaE))a(Nc}(+i_e(;Om@ znvi!s_cRr35wNLvNu3_VS5b=xRjOAV8J_ZdlEVqBQ#q{`CMD0h99xTA60WkMXrH@H zSBm~~>pkCwi)*Nq44nlU6!YGXxEXM~)fXWfvm&g!tHBp>ccQ>Gf)oDcn~&S$*Q-r> z+^V6PY?PA1 zxlk`Zy=q_6F^k#OFfw1{T^&c=D7}ALVp+W7V!3o(Vc}FuIcdwz_Wy!(ZxTm|bt`Pf%HTBrl?NI1$|(mDi94iGBGb&tgNh{l|B^7$3wr72QdFaKy@qiri6q+nizwRur+F8XJ>y_Ngo_ z4EcX{fj9W2mApO!(H`&N@NZo#?Bw~)pxd6blf~{$w-wxEd2?u*7d{k!UB#<@c1?_2 zc=xF%D?Roj?(}(+zCe?cJj%ZS z^PrEn)+-lZxQ|u%eDmlL{#}Rv;or4yzh0&1@cH)P!?i!GJ$khE^|#-yuYLRQ536hN zWc3fp>K7hI^87^H`* z426RrYE8vW4g2*0n`bUKno$!zcF9Dl&kQ9sf%?$eE-CI<)vhovnVZ=w%N!WA zntEH$u1i(L$9l-(*j6i<4kYR-{(g2nqqSn5=5B2T@aNW6>Lkp{5B113xB1Uyb@zGk z3cojeM(yfy&Qzu}PJU`Lav%T5nuPa3Q*2{r?)9q;23ciURc(;>E35Rz!z*#ruc>K# zPb*uftLGi!KB*c3w4yvY#iIDJ3%mCmLo?Mh5ah5dH8syt@de+!RejGkx#8#4mK(m$ ztBfh&K4-dzuRgs$K8n)le>NVuD+DW+UuCQQJ%% zIU+Bf%36yUnTo2fSHno7Rm=w`O&=5WbRyYns&d@al5I*?QfkU&!U?SZYDPo3M&@f` zZT30o3$EWfa6m}X;Lr_AP5hlX4rQYJZLZPAw)pD>ey#7h7R`KsngNPI@)YlB+!GYd zwhs<>0<92JdsghY$4|(hI?_dvuUhx{e1Bz?U)#g0(R7j(NhizujsEa_y@9dL z0RD359-QJEe1Un`j6f+VF6363sjAD$I6OaHf4lzmH$HPBKg#ie?mPw9*CV}N&pl-KV9Uj{4NLO-O0i?7c)HE$>f-^R7oe1ay{ zXJ-3Fx_9tq>$y+Q3gZ}#8cQwg9BXgHg^y02Jr2q)*Oz^LvKN+JoKg0`4+3WJ@?=wJXvIWz~iwh8S`;GeY zhZW_=wdGItUq^#kCJ)c|YZW86d92;Y|JgrD8^6FGW8O@ofX2iuO=9KgAJtXCfUUe_W-Qp3SO)dmyfIHSN!;5@9w~xdpf1 z9Q?IZWi___`z#=cuIDUQ9LP7`&nJxz3|_6kpyhNmC39J`9*zEFh~b>ZP!>yIvcRQeZMEb^ofiYVV6p1B zMFUItL0*5$-=hZW&Af$WY2qf2YvNv5h>6hnId~D zSk%w}MgCAAdSM<}wkQ{0Jf_uw;lb;zpN@84KHq(L=i#ciVIM#<7|#qbshf3j4E+xy zA$5@0ZBTYe9$ia9f5Br?Mf~M2Nil+2I9Lx)s5cpQZQ^=ECLSwJ!CLkGDv7RqfY69LQjCDZ3sG2N~rSA>&b>`i=DMk}Y@*caF557x=NP&Q4XAFiNf=oyFDNc+ zgDOw4Hf~}dHHAikAcqzWB29%|;9P_j(UQh}mt&DK|M;YkM4KBzBUV#9s~U@qg7O2< zvuko$4<7xLHpRb+TT553oiB~D$Yrch8!--Jh2j0EqF@H4S1wQ|vA&UP;Ox`@UO=J0 z=a(IJunV*sqs>YCrXA#0;~4!Zn(XSVywaA?_lG>Dd2NuxC7L!@0xW0 zax@iI<$a3N=c_R)eUjzf##Y!PZ zYo#hniCHX{$dG6A-6!Mr?HiwqPe)eEorUU!_FV6jHv=C`UB_0Dj*J! zMkH2_ht=NPGeHaG`Ph|GeOBy%7OVRy2wM_7}9Snq(e)-i@CoBg<}v_k2#hbiuEqw49) zDV!KYk!k`y2PpUuPP|`SK(<+Ij`RQiPvP)FS(2|@@zF7c=ya~0z$#}W;91FZp7Npx zHIktoWotHDO?Te7TbBGUoDXQra%WZ#I_302PR*I@${|y~noTaKJ>a;|9kNT|Zo2r-2o5BK2ev^V5r4_XS=MP|pb>;sUiiS8&6XJB^BlTE zO+Z@)5l@h2$NmBUeNK?(B&qXuJ`hNn_@}Z**|3w{4N-1_eTi$^?vVd-t}a=)q>r%; zpx%R2wsV>fdK}_@(1wQ%_A&N;XXET=_J@>;*Xb-eAca;il0BYAqe*@R8-PJjWbHAu z-4jC88D3psL|6%b9Spr_&L${xP!pjcrkJNB_UVXe3BqS|HonB|zOZur(_nwW$LYT; z!PW>|QlHxaTIAFoW_Qy|*xQdK++@#?utBPaFhW`u1hIfuBxJ`l9+o>vJ%z=QDw4hmxl||EbQDW6H%QSN5 zWq)b1_hIzvBK5qL08_WdN8=;`fPePiYpZwekQx!Eej;Wc;uEp;)9(K9&dZ&{*)A7Ris=>QSp0JyncI=#d*aB*UOP$hueVxzM6op96U(GT2*=cYqSlrr;4|$ z@4Rk7mI$7%y))Vc_w%RJ1?B`&>SPqv3xw(bc}bdsjigp4S7n0qjqqqA@BYnf@m3(U z8iwi!(q%DHmxeLVC`i)=%`X;KaA1(N(Mm&5jr1{X&bCOu0a{)DNeG2uV?hp(IAK-d zeTg=7hon^J>Mmw6CXW{iLW!}ov&2cCn#z@`d zI1jW!CZ?KalGzsEWc{eY($jaz>J;GLhC`?=D=(cD=Kdc}>r=S~5FWU+74jnc>*DMb2!EOrin`zkz)hz^R&rR;p!BJN@f{fWXTkWuqpYJ5;`oC<3X ztl2iryBjL#U=Va*0k^7@Kj1{wHD4L@437`G{E!u88OvQ_$nisl*}{#xtC;De_h+>5 zZZH7($Z+O&blhEgb@qU$U8FEZL%bppuHA91?at+g_PAU4I2U?_e~tRJ)$4Cx@Mr3% z8@zz$e-@2VyXfTkcfnD4a{S`Y&rV*vIQkzn=X+=6{KmBj!YoRwjB`%qgDGqId7#o@ zU}AXHJHu^w{jjHJ8q4Iws`qlv$;E)W}?Ba5rpwb3fY1Xv$v&jUnzw9%v{I!2z8Yzv=4DHdwm8NwYheMO$v3_)Xc<0fh zl8o5aRYR{3}(Lck7rlgDGM#S!d1Q8a3ymZ-slVZ^Rz~+Kfc0#SH|tiqSwSE-bIE ztv`J9^*7)C`7aC2cU}|os}mrL1T#v@QTAO#d0DB}}eq}Y~`&>Hy z0}BYRFU^8|IujF6<)hdz&PM%qM^rqbDF@1%LV3E6_2w0d6S0Mb!49L`qX`9IcWJzN zoh*tq2(wtSxl4z1!Rv$O75GXc7NNO2KIFxLhME!(>kD7~r+rOR@?P?ke9=389_tZu z1;}p8$<2u?r-h`+Di47IRXF_((Lth@&yRNhX9t*&0Nluxw390kajsOt;m+CxY;uk2 zO0=gK@^On@zC0!R&>N;i_dX2Amq4Z@K9Pg~;_(KNEa1fX@x{@dJ2M6ZzyIhu(ihzn$SUu~SYwWz|kKi_Ek&@#|Hj)i!G*K#^yqkN`;}J%QwtbXYKR=^`yr4;Z`f4O=;@RvzD%2pwBCLc!TYkD1(7ICGxQOIY!_;CB(@W)1TtEtn zUAIccOoF@T4dd>J9l~hv6|*}64pVC;_1vzPT=6wwW!ya39$}_3S3XJ1V&RO}oAyLw zk=m0VA!%qJ?*|$$Sf`)0$IQgoCF4br)s&N-r$&wH4fkw zR4*ri5O)l{HS}5)bA+qFkCb7!CWmVdi!kV}sLxdk8Zl-{WjZ4%BR0O1j-b7%UQSvnx`u_kw3S14Gy zuF5aNdwUsSplJ&;S`+8@PxWk6HjC5~NZ>SeI~p2oPq*li+TbE`zgz z&HK}PU64`JdmZ|>NB@rK-y-Fk&h*~B^e$f)y~k|6l)ivR1gro_<{*eHt2ro?-<8X; zdnY7%1h)q9GEn@{`S`O~#mP8=k{ey&Qku*3Ug{5m z6?Zh!FLx^FYdrk-%tb{b^Ot8dYG^IcXSz)!M51w@SBeUw_7T3AZJ5H(R4i@Wz`W1Q zVk0B#N1rsz>1|{g{6^FC4TVeJfEInru(v>_phTZ`pGXZ$vM}*591Y|11}=dr4vgtP zkuQHsi4_(Ai~IfNf-h7tcMc)X_lTxB6Oi1y5%3&3ZVo_CQdqu}Rm1KoJ(vWJv!i-5 zR{jSQf%>-JiV@!LFtr}`NVz-bD7)oRnqdjqfbHuW^UCu3wEJ%vrcxv~Oe8^b4Q`Y>5kY{Ro>5hedWlR2y9tk}~2-Y6~MddLIlCi}$ z(C%7>MjWm*^mNO<2S6?*fdU>H{)Cy`!B0=xUw5K}W8i<`FhUzsC=lFv-{WJRnBwr%`FOYfuoIGx z=bd-Ypfj5fJwC1-cX;2hK~@Ti1jf=8S#XMP3as@ukI4Z#d8zo#!7Z3)s^nMZWmi^K zR?22gR|Q!$SXM@UV|1E{ASST@@EA%f5?fA*0<~io#0g3LY|w4E-!eVw?Tcldiuww zElicfJb2Tz4uYMF>EJT&>W%AgI*Ft#i4U)W*0|$DEqR34!L-8bIZb8}RY?Rg3mddc z?0w3esO(qT&nGBLq=~#XHbLAuN_NsG%geq2hB*@f?e5?Da7y*3vMrU zO@K0V5H)jSK`SsXwW%;zHiQUanef#}g`G(Zf&a%rpod&ACE@trnmTdKfS0K#0v%Pc zqY8n6xZFzi_8R!bQ$7cmP4{kN<`~ggg9o{+l|6JT$6aB)!~17LMLjqObxSR9PYdsy z=xlR(^o`Y?pndwcf##g+VYU>$6Gj~!2SE+8c!wZ?y-W~+zfB{KNOV4#*ED8e?8k3%m0(G`1SDwkO{GFziA z*mJN8djDcDF;?pDeop+)KV(VaW%Uw>`5{fl;ip^l3N#qGyP z{S!PJ>07TE#)zQV{%}iB`Qm3E8=mJ;WLND0w!xReFs9Fn49k~XHVd^+I!(rY3j>fS zlPC1@=>p%XvXz#YP&f(lr&G=+<E;#-V4uI(@fCnG~U(X2o-n6KGs*G-3mmxL+jc z`;@Op(Ta`4PBjwKAl7Ru$pK!vV!nu$d%C((vgFbWi^i<@_wGK)EFIfsh4!#yaUEJH zt8zJ8etH>%Wcu;d?*8#(!`MJKULW|rm1LB`0e(7eC5#3mt-RQ)XvHb#w4FhHJ5C=` z4qxT(W5tes*DRC!@YE~ijd?USAs_2IEh+xILQf5nlqb?cZs7M z4OqeV&3Mm7~yXWJ2_c(MMUbg+tlC!5A}_a&_^Wx3^DWVK)oC*u@aqA%Lv-&dB3%n zJIAL7Z?+Gf?=)O3ihkqat$Gp<$Rd$fL3E7~4S6$xCbte>o^F{2c>=hBT_e0cwmQyw zB-55Qp4m2>TBpIKo(PaI#islo^;sYB+i&hlqT$|YVOP5!UUma*fbBUzGibCz{4UhG zNGp(=Rk$yGjR@S2XeWY|a_HgCU43p|n(n)v;yeckAz(Ss>}R03m*JKqQk zJhKH*ofH(}-7Iw6dq1JS!o`?w|J=<=KS~c~P@pAvO4#VrI8#%DVL&TOmTck#pA{3d z3m_ux<4_27H^{k?oD>{SV=``|^#QXVoI?+45LXa$v4B|>xl=T`h2L1iUJo~o!_nf0 zh9#Gy&O5g;wCJX0;cI&94xg_N?c*^i6Iy&o>OdN3fpRJ|g!82#B9Utd$J-~UPA3<~z zjwzrc`p%g1(oIf(t+Z>9MvU`wl8bSij z#VeJ!sgtxw0@E#v8hm0W>rb12)4@jk-|j} z0Kn3g0*eTLfRVTbSGLsMT__(#4amIu>)(E%rQ!>sH%rB9Vpd;8c-TaURn)=Ln&q| zJq%PWpi&y0IEdRzC0M zsLLTnvkzq}(oc^(agTS7j^X$W*hkTFg~Fa;ddsx|6v*P?&dan#f>`ciRz(C_#~dilBw4c^rT7nHIN>D4 zVWj}w@vuAXWVFbGp`SjfhnmsW=Y)LFc~#a*jxF2GTmsLEh0gtHDM&(_e?Z}BD&)nS zPEsJ80>mmsop^h3Hf@fA9&B1?0)vC*a~WWY=p+xkB$x{hdBG@e(M&c%4nY_WD=A|L z1lHLC-nbX-K8EbNA?F$A-Rf=Us@F(Xh={i`F$lQr!=0_;ol_#20+LoRcuMH8>YiQF zg!Gj03OA4b$0Gk2;Rky~L8F+G2?w%O15}+bmOw$#*M{6VUscen>a?-M7BTU2(OoP* zy`gMSnU@l1S==+M5wB)*o>{fH4RNr`$CVPJ_%XUGsmB5lh5*);SvtAqJ(F?ROL+Dm z9#HGpiWKF5cIPRQS;9|l(o06tLfP9-vuL)b<(!TRR{kcV@Y!=6l9fLsD~V!{*2D*$ z31l3@57%+JUS(3VKDc{y3CoP_dzb$c-#c1eRa6Jen_gij9G0H%>c$tc)E`5Nf03Xy z4oUg6G*~(mRsDK^u!=$PSk98*baaM($dvG)eNo%hZ6ktX@Ds%-Y(vBNeUQu)m*|-1 z<=-J13sWdSp!=%s>&E)MPfV#AU-1Zpo+!6LFt-S1V6C{so2%uswAyqBbLMAtnvsh! z+lG4Ph!{HY9UWgL3)s*?nQ7DO%~Aq%8tcW_ZT^IA;)%j&WH|t=D)iCJi5A?c8p!Yo zudr6^jq={^>%HCmo#(qRUfjX3EDm*!+P01`2&m8vbW6Y)n9fOOM^YPB#8${Lj`4X6h`s-AHJ+Q5Vgaezq;E67Jvy7lY`=eE25;vi-1 zGot?>V|ROu4$|(ce=^d)0lSBi7nbW03!|wYPPZ9xFqB%Ad6YUJgq@aX9!^u=mayv0 zcnEuJv1by}dX+Xt!p+fR2;7UdTgI}MXkB1-LXPt>t^w32aaJ^7bXWgRK2KGrM zF-ITN{Ff}Kxph|T!H-?~0b{^WHmziVaDPF_Y}nh|xU+XF1R$12ZY{mE^lpXV&0yaU z`m0M}5YC6HM&Ct5Qy(0m0<~N;I1gFx?~Nw1=r2d1(5>zMY#@6$p~_I;=O6Y9N-S9g zZ4XMZj$vS$Hc?~|Ai&f&M9j1Jry%n9#@3*K@ZC_kddQX^Zfh$@Xd~g~im_E?l5&lq z5R~}BOCZjYMJfPJnX+KtC?8(6uklEOHafhgk=Qj{yq0FnxMH;MYTDF7-DPR3GuMc7 zsoC(nb#&9quI>GEu&T?OF&cy+J1bT?!fTDwKOJ<3_A;?E zHmbtN>beZ$Xy2Hl|CTLGm$$U(an~!6hzjW##VE~Mn?YYYB>pp49DU`7W+b0RUyYRkho;I&Yiqa!Vg`HMZ(mevlB+&a zsChDx54zbkIax$=4llXHr2!TR@9^0x7Ub_VWceCfw9iP}zLPSI$@+~NnThywmC)`)FMaL<1_v2Im2K5)+mBhr@*=}rj89^W0c%?;HSYDLb> zgJ(X{tg0-`+ii-edYRl${>k}lR!e$YoDZ#!RbId(U;;4s4yt+s*}Vqh*J*Uxl|WXO zk4q2>qCTE==7HAr?a;CSk@B+vaIN$2%ro`k_PH1HOy15p1Oz&D;FYJ|Og_8bxD77F zJb?LZxXb~T;)gO&KHs9Z43wYIH|b{slpk(`N%2Drk)Ok>-%s8u#SaLOpG#Y0N1(94 zA*4V?o+6j95Sp8bHx^(JCD1FC-wXUg|IG(iwU-zdpw)~>oo*0fXGPwzs ziL&b2EFK|~c^TrqRa#q;WldmSwYa6rSl3LPu4+!ID*hxjS2fkHSzRi483tq?#VWCF zIX$g=Gbikk5^SdkT!QV`=`Dkjo9Zf{+Q>S~3wPcvI41;7wWT)A z90b=T>T;^$1;aW=L(*6tC|DqHAB{0oAYec@2vKVXUk&%MSiX#n z<;!>tFjgNVTA$Wptgg(#!}TaaRb7e7wn~$83#nl*4N|9B>ilb~<_Seh(~KPoDDJ#^ z66_!BAMWfOY&T28bDjguT2w14hFHKD*Cakuw(dvkSBY3{T&R+?Co?Fol%K+y{ju(; z(HPB#8rfQDUYH7LO{bDPPL^FNi19jAS+A_JUaF#KBx@&&8b?nKrEz6p~3q)+TXJv79)dYs{XhAY03 zJd-O9%qXDuUJ@vFKrt?9MX8knPL&%NBpMdW9ST|D!&BNa6pWvWu)%D<-yY%R2_Dwu zeuu5#`=%sOYWMq4gB-;GE|}I2T7&L-(>}l;yGcpxCeozQHEHSuoBiP=V-*?R3Mt9Q z!M8<|O{N|MG_sJ&P~(_$Di~;RB8g><&l(P!GNTYMpx+#?PRZgVW-i*@ZuvY^XB7fS zw&*cgnim(E^qrKYGM3^iXZ9@o87sIhImtQfqe=U`aUV|Y%eR;Bh(UKx-#1G_ zu=`NF&~f`i_K#^Bohe-t=&usx6uMLe8g3JYfm7^pBsAV_bT>4d4!Rqn=#pC|z`L<% zVFc*Ors`P8mP{F@!KLVQ#I?^||G29sN{{ezJ2`8Q$9Xmug9Kh&j`K-Tb3M-Ilc+M9 zC$p;t4v+~6yGZ$PTkuDjPr|WYK7i$c0u&D>KsMO--Ro9zUmcHPH503s0NpN~TIo`^ zM$5}3Y&FXyiMcVk*;ar(akZO)^As(7AE;)-V40Zcd07>K2 zLT=eh0UUj($};JWY%>W@VxqzIUzO>`k;KC*0$MSY$&_8b?hh$hl^-mUBRYog&HbU! z0HW&>hm=jjn1+YSGMbyurt;adBTf~*l;>xY!3-*=sHo=>tK2#-9d6ac?3!^7m-#1^ zydWxs4X~>t_A}P4Snw{g8PI4KIP*k2_3}dW*wjF~GXWao2--?=%rVnjXjOorP9&(5 zhT6pZgI9DilB*hKjawe}mXX2jVaP$cvtesMN$z1&DCazv!X;V6#1x#7q7W0)51Peq z?ZNurzg|~k322U^ZL1O6*%SsbfrEM2dn|{5I^GS~9L62$G*N2&J@0G;EuP&%(rr*y z=<{J1hMQw}<4imnt|VJHQnIC`TWqqw_y8vjDc^;tV!wQbcc-I1CWaTiY>bu++-l6! zOzvgG43ZdK3aa|pet?ob`{!45q`=F`P|wjZ`o#gcd$GQo{iErl7V9h>R>kR+>#^P= zNr?2p6%&U>pXPnq*X=&AJp;ZKbER!0z`@xSB}SsPYELGO*IWC?rd5!#1a!r2+O+HS>P+`3I56xcv!H!l|lUIwdb{mC42p|I$+&x&SaOm+tzK-o9V zP_g5e8>fQn9SMO#$=Z~h>T}8S*>Ko@QF&1o(PDLhmVw-glh`mOSH10s;oJ(pYy8J^ zjeqhl89z!rpFMb}921{l?0`@2W%!=AVRpn@$`S#9QSb;i67^KY=gb4j6iCh!=QHmH z3TQekykfA%w1KJe1nnFW2CroUZ6UYGzOCE&n2_H$h+N)MxLuDFN%~Y zH=D+5f@7PGK8|$02@E>Tv`8EEwT6kpih=fOthTV}#58 z@`s>FPz;pV#&wNub3#i%?50*ZUePaEV$iS}xp#!~_gPlKy({`{FCO~5OJPk$H0_g_ zNP3hjOs!6ciZEL@bLeu^^vVedd%2$4W%7>Ec6+%a@906y^X=U_;TQ3QdvniN_!GVn zj}Xb_V=~HGQYW#y=fG+MQ4KcEB`zy#@`I!n6xD%Lf=)eARtKtQm64cuzmwru zQirg5C9m@Yq%l-^BB4#${qxLP1xe@<-RnM9&K3q*B!}xT;0=1&!2uEs-0|k(Te96) zL>n0$ieqwZHo1!UJU?z7LTy>GTbc?S{5!4E7TnpnbJ4RCBw)N=SM0~46W;q}Ix*oaOn3?DU>4A+cZwdO-W_Us@Wr0k69 zw*h6JNcsZ5QY$fGT5mV-Q?_Pk` z)gWE6UeY1G}3sTMP3K#mMy0_rEFo1^k?>xi1;#;w%KCo954Kj!V_xp$WVs~fn`M+qWJI_laEux{;cQpqh?CpH{fisPLtfT`@ zA3uli95Xy+WqXeQ<~JOo$0j(GJh?8HcLTR4oy*Ny5^Sii(^^{VBC+qeYLlrt66iL& zg@=^HH}k3F*>a1HK(ANX|HLf2vjr*>cLU0LGLFJkxDCymBZZ%uXieSW%F0Td7~B$K7?Ty; z9M>{8mGVr|zn?<22RE~cR3v+R6&QW}s_`P2yLaUFCi79M>LhU&)v(MX1_YE5HIVU_ z*IY_T4Nbu(h&di2qwrHS$i{n&N{#523GriyaoL-DaxpBT$T@Q3YuvgeFh|)e+Q&fJ za`et4Nhi>U(=7@LPH2eBjk9P;a)m^#@IfokJkUR-$f$tmuqJU(3pPW}x~B}cFC5WA zHe2AFg~7%uBBMk>7EElEQfQPQq^^nhVd5E+Sy6Z;#hb2>h~j4N3HfS#xX3$bzCe-O zy$XP>tJuK7Z=z-;OHrY6!8M}@3@v9*!~tAjS&K}9Gl+RH-}9iP$%FI;i)3X&UIYsv zx;5DE715AlZEz~lGG?$bMzdruilL=Hi7lzzjH+l0`*!^yfqLcJyFBsJk5<7n5$vw$F~Sw#h`9ERY-#W0|xK_Jyrv?>f@PFgEc zRKj7xRkT+@{za~wg9av_)Bs)i8UsGRH&rB<;1zmOe%^D_l?ne$wz>wf zxFXLtppc&VKqig&zN1&WZ!{e+rkNv;S47JdfA;glXS5{jp6gm;owUcacX@lrRdYcB zqpTjq#tgDCGdM^GUkm-*vzlA>p0D^VM=maA6wz8%k!oH$FCW;Pccn>~y{hq$tIkncTQTs^uwtaKm(>@c z0i!ew`&}RFk59ms3sJq^%$vM6lw*2D0JAbVLBCpaQ%Drk~*Tf?Pi-IPoMZWtWH=cKhUu&1VuO+o+gQ zRcer`*~~rm*d(Ev64=OWnik%I~ox(*#Al4x7 z^^#)R>A>-ymF!>K=x@KAEYlj#D*4?QshPa4+#7RY6tPPq^ILU~oNQ!>#zIq&LpM-3 znX)fx%aU?SN}`2WZ9&$fSk#BN|3G;ka|1)F1YKE3uuX7b{UZ6c9OnIE12hy zxA7QNl@CSyLU4z*0^1xI;2@=;fsC28IT{P#HBtR;KsQ%Eopm5#8K?$qH{OV(K{0V- z>*$aWRYdz>Ba4S{yq9$&^Bv!zyJp3$9NyKwDzhht^KE6n^Ywo8ZVYQ8)YgVh*C7NZRFyG%sRKg?f*QIn@OHa4Nv?;~`-35nSqiWw7z6I-Vg7gD`7g zj;!OghnE2ff2r9>C^8IQ3r-|wEuzpcSi3a47V9#1znj9hG`8Hq7T|gPlEO>7z}MlW zExax1`}L|-KoxM~=5ELGYS)-;eQd8lZT4~wNuHT!f7jxgyiPX`dOa%EEtR(s9m&G@svTSpN1N;Co4{bd;>&l|G zJ!FkAEhZ9yg%m0Zha;X9JHS-hRnYrL?rO&heIKYa7V|ZKgEKcGFLrD+Rb3=`y9XmF zBiY`I;9e)=h#}~!8-anJc?{Uk&Y5OQ40m?-_aGI?L9+yu6`})bz}LU+^ex}4RVcT^ zt3(^CwldE9sM91v>gZXh2Cw(kt^CxtMPoX0k+ku`ukq6SY$kul)J`*FziCWiuck{8 zgsJ7Hdh(3eq=Lkm79Xy3lNi;<*DKAsJPnJ$F>ul|+%C?>Dh19aC7lr6*R|x{!}-GN zs(KX>NHhADD#s!fc08n%0Jo~hu~3C+o+^XNHz64#OWiGOd<~LmwwwKfW3TG14DaV} zs3eM^i?ztrOIjFBb)h>j3b~$VF68=GG|ehyO;sMO_-1jY-f+fPD6N17X|@->twhEX zA*V8JW>6t+wHT*{8qqf*{^!HIM*{b)+&9JN6qQ#;1MN}Uo=SeY8OIN=->7k#!&)Pi zMN}%#IZ@xVD_DdH?j#ZpCK{bRg}Wh+Ei&sZ6&?oyvlY9oEL>&%K_dvRMB4oi?HgW~ z4Y|3Z`}X=ll&NK!9aGfXczl!WL@KY7qdPdk=vU)QUR2Eel zHPs>@LE#Hy;F`t2+s0mpev{eg7v6%_Azx2 zIF?Hzf-!|%aN9vFb$%r}H_0fQBBK9>y}{j3dW;1&#Qwx5g^4$tM8QCBkts+#=txh; z5HFZhVwM|-(iR5RKxOZOHpjq#X-p_xJS(3gW;QQg!Sh?Up8CpquO$>l>}>)5_KRE_ zMHgcv6&GV3OGDFMU7C#QB38^hN1dIH~ z%pSkdX*Y^zSgF`<#-bliMf^G&v8=Z^%H>O5P=95gY3DK>;2rDbbI0OHc(bw>6P`H; zp0dNWyMw~G8ZKB0wX36{{1JD{IpKmkBbl2soQgL%FHG*P203}1gdB){)Wf@mkClCw zQ+C=FoxHt#m#z>iLyoc+ZAs1$7!g?02AjSL*HEvxlarB9UG(6hI5=k#h>Vp_A(1Rd zpYTe<@SSDxd%YlWybaslQh@ujd@^p2Z^9f{F1TaFXzLJa3Gl=!6-|`gzW$qm zW1W&;$4NP$TVtYa(ZvB?;7?-9mEa+%;hWCPC45d)lus2I3)`&7N?4c=aE-BG`rWL1 zq=~T}slIP_tZ%wsbhryGjkt{mIvOe&fd`p_F*%Mm9&uNpIYb7bMt+_DSjwG!Mo z29&va7`vrG)bv_~NSDn>tzO;7&T}h##aT#&H-x#1IKw`n?YtnXYKo>z)Z zlSm3xwDy%iC3MeDnn(#qs=>`b*393#@MosB<6(gau3`WiDmNU*hZNnG3`cm+KOs|c z7p7v(d|wY`Dz$1i;S>(uJlooT{y2DWa2Wpn>EQ5jTs8aOvR`ml=^dj|)H`|GuruO>r^{n_p}Fs||a_iJPwZ6D*BBkb|9?3M-&@IGM?ys1jH zihec{RMhWbIPh^#7VRGMl4xG23YP;6j@lmQlM5Rx%Ju{Qz`)fm5N&VVI+=sbM3trD zx=|%8vjmKBkK(8?+(mFENoJyc*M~9RZ|`H|@?>>o)g+1riVW20N>W2F!^@^QsWm## zzy_6Z-8n0i9L=TjV$dEm25hL#A?w0DvAPjW3ggz8NlEaUfzG5VrK^wC@hl%4jL1U* zkY6lGlE%T|^PR)w;LRZhbdv9c$^BCRG36bSvS;~VI2x}b6_uvoXG@#KThy_$P{CiN z@E%kI#W1KBlc9#ZrK_96)2-*vk!iw$PxuK?%yLk?uo6oGrq13@vl(2Oz_Hul5w;S~ zn?sEz%-;Q`Mw=L!D|l2FKI!E5fpzMjdZIuLM8P=+jq`oIyMJ*R} zXfOx3vvZB-SvAY!*U>DGUmq#v9KW`hQ$i12cZVSH^2aL)P2UC)XfIsIEBP5Sd<9@C0Sr@d7;iTnkVX0w$JLlX;Q zUx7+G_SZ7pUYiWdyj!PNQ3&{A{3)~-`Q}}Ei6S8J09C_)3bU5Zj z1m0xAGpbPR_u<4^87Vk)HcX`kFY3}5+`?lRbRw>Ko&Waw`N$*Hd~IA^5t|LWpFFob zCca;*Lq+y|$u*N>g*hUllQKA~_JUj#!Z=-yRbz57X!25bkbY4_t1_JA+3P?F0xbfg zUTh9Icoare7i#)1MP>?WNluS8pGhUHsYfbv>d!)fTHK4sl0!DMXII{$K|FxJA-4tAW>Sct$a5p}wEK zJW(xFiDfA#4ng+MKV>_ZjreHvCnFz>d@j0UF`@@%FYvCR?ZVi^aRFXG+ud*ZgP9J` zX6e>a(94rM4qbkAm34C_;>`2cAyPi$z^X%`+2}JTDXOA7>lJEQ$-aUL7}dbUlPj&c z&*MUx>UqJ>BM(<#S7^h$kbhMb($xaIY%+fPru`Ivi=e5{^*dKkDA=ezwGD&zl~pUw zzx!YPE)c(pL97}9&SV+`nlBtBvq4hORj~m&$Gu0<-&5{ZvhK?;O~EW_)WC3@pVRs7 zy~=_>ynarDnckJZ=M-mn#5+Pl%lliVIthPbqUT41Fp5p-G*f2r<>E#b4H)hS18{X;>(?}FQ{pE~Cx4Rw9gn%r+UvE}WRI{JCIg_Wx z9QB%7(2wazO$g=k*Ce^6Y|O4>RK!GzKT(N!wH0vgCdsu`+6K`%KeR^~rNF8~GsYBs zAQ$~mXaoPDuj}}A-Cgq2Fre8eF;@^@Vg_{^4E<`|Lg)5}pF`$UTQvfu+Lm@TorTX;h!HD4(|`q3Uw~1Ot2W zJ#gURwJuj}Zt(6}O;617n)qYHN8n|ikvU42=5S!R1&&ksD&!gxgRi&r6Rj}_l2_9S zXV)k#@?y&C+sntrq_n)Mkkw^wssA@)<*?^fwdk_Vr{R>YYRKl?GeBdV&tzCmp@%cG zqpV%|TTZKa#RWwMpf;-;Wh7V=BrplaLh!UpfN`i$y{iMLNl6)iyS>LjAPW;{EycK_ z;gGMyQ^rV`tH~F%uv>*7cz!!c$e9edZRe!pc~I-DbP2bCWZ;IRUOYO@s!DX;%sHx% z3^~p-!X3PQu3`@4cEqwp4YN1O-XshL9@b|`oxcZ(yzE8%yf8G?I6)*pl{A5|L$vR! z5G52G{?*jVoTkO^phls-fj5KKauqAdU(rmDlQRbdQD)Ghu`m2H)j?^$l>^C#T0Mq#P?t>j7atcjbt@ho|o zY&D5}!^fNE`6j-&bsp=VF^`w=JX~m%X}>*|yI01$I4SR^!FA?{Zw0m+<6K(Dz(ohi zGb3J05zU4BQN833b$$!D_b8`iKDn{m4>*F&O=JoFxhWS9#Cp>v5~UUq=^{CNh4=2M z7+Cf4>*||^>>vMzz2$_v0mbJatNIox*e|ougeF_u!2WUhElWF*Ar^&Ibb_cVYCK^N zb!5%|ukcF`Jwx*P1dNC}}M;N8xD?S?yQmZmD81SL=Z zb;ls#=^VyYDDg$U|5v8}SgjM~`VI#XPlT(`2|9Z>-?CS~;2y+nt{mLXe>G?B$gR-` zq-y{gY#?KpkPb(bg*i06jm#RQR=mAVs&-e*x5zdP4L>rpwf~i{xt097`mv?nC+^Ef zcRO*Lw~@P$72_Uvo&4DUW+Np%;L@y@B4O#F#@(`dUeVG^8rBF#d5&aBOoLALUz6|8 z{jAsYacqNdF6uS8_+VCyV!rI(*DN>o%9J{t8j9YeE*-xV_2`S*(!YUa+ishF*7>b`v?z?7oIOhPzAaL_^211+JLPsah9!Hz(WY4_!#&h_KZ0Vxn2e!F42Y-#; z8}mf^>5LQUS7@5Zb``dJGE4l`Y+qv`_Fe^Sw^6Ie^ZRDJb4eF2jZn%NKr)H`i*y04 zKgW~{KB2I^{#f(UUWu~QgL~({%yjm5K4&&^RDRM-swAIzhU*;Wn1V%%^U}V3xf6zr z=}xb%Zd&|jeZ$Vu@D`Z&Qws9m^)I=8pE&DVNM_*j;JDrt_^@PU1<&@>UBLK^zzcnEXO54($XZ8+LM1f52G*^FGG_tCNd_=|;8oliQmA z1}8e-gYXzRsnj(VK^(8(ZYkseR?wgaJVv7gBaKBnoU0F|iD9jM5}{|@6cfHbQt+mJ zh8GousjpTk>n@sI#BvMkwZwj!E)r|qostD( ztQ}MhVCoG|!rXfU5D$MbTPNl)S`x`wn2Q;l#b{W}WGyOHar5GO9Y4D6a2o({K##xA z1(L#B1bbJ;cCPIg!4r9J6^LMeH zt_Ihzb*%eL#*5gjUxS97lDqC!?$$1ln+q6>=t4gjw$tuAeLhq#i9Jl{y37qV#%qA& z%ezevGkCqTceLZKc4ww;so^MRagzaz?A?Na&g$F%x}6&h`jabw&tH%4_rmpXH!*9* z7pq#uV@KidW1vNIAG2l`@B2O3T)WAWC#bJ*YxGh6IxWmCXaQXJZq%|JZHy65p9)HB zRP`5YO_N5TUoogO-_`USKtHSjy5%*?fIZwTVU$e&P<_&9uDd2y>L*U{3(c@rreK9> z-0mDL)-v|UaWvY=)8q`;*(aM%;n!L6BxyHO013U>3}0>HJ3r+*%qA5VTg~$!E^4o3 z84jf(CwWBuyly2dvFH*&g>Gr)2h4oRlx@C{CAR`(sm52#hbhAjTZ9Z1I#Xa2(TZ4t zG_~-|(->y#?k-`zh*71>;cl00zLNHNJD14Q$faRt5pyJ*SWOa`fpg^7fMfU!J5uf) zqez)&65cADZ?h*~QjV1Z(1%9oPF9wu{=DxKx8g<^Orha^e zuC`Q}J@Jz7*mbLu0Si4mUvEgm$l*U$b^b-WxJalD>$ow*Bb@4OXp4rFJV;#71;dqJ zfXJ00tBS^Qy`()JgJ>BxGw!%H?p3zYAAY!{iA&1yLBo0Km~a;;oD=c#>(DeyLA8Cj zvvs_4O6J`dm}Td$65SJ_K0bs0chtjtu|aikbf)4pR@?dM_;3pb-{QW?*Q{-nU-ov7 zj&0CDzSThoBoaj2RRY<0qi|lZ$Mgo38=x>#P{}{C?fR%cEj0BFCDf%jpn|{Ok>GLpfZfOgRjL0LX+m(bo++70%4`j=M;W|FtIo2Z65r-&cOQ}&s zvTov0t1$eG?*2Ff6Hbo5%cx6UMDm<47bOS%4U}?^qQ4%UzS%iEeX)0P^u2f2mqNfe zo3Zoh<=%OV0Un15=(26X;+I48;)=Fp8q!)z=HjpHe{}-6ZX4;Pv~Q@Oyu7zr`L^tk zaO+5X&OFs>3N{6{Y$h)}`@nD>FxtZ$ zva5kvin5_{TGb*bG5NL`1#=IH*>Ur~03)4>F%Ly5ZR7hg;A*C)x^s{UA7 zQdJ5&f1=DZ$N@Y1!{NwXR@pAeb%jW3{*K`pX={8`QOq?|J`ufn57teVoC>A*f$A=m z5_;v9kUSq!99qhY1zUm~Kg3d{n=x$FmPdn;vBB&JNC~ERV#g(l8mitfbU^+*EheN3 zDjkQ&+(tXs1Do8`-;9T_c8enozw3aXGvIRoI$OKKcY=8du9A*%B{mCW#-6?USYSn2S7|1cb1TGmz7uT$GAXI7-;tgdwwOsC~*I^L_6v5Tkd zXMDW1yBFrJ6=~N_*v>DElB>sbk)P8pr%1OGId#zxpWtOCfo%t{D>uE(O+zU-u|`k| zXyH;_PZS)0a@?Cvf?LLq5d?ymag4`8UN$YUX$Up~g)uTD@Q3cgId4ft^S-j@D8H}c zjgkNT!+$>Tft|km^~$4_uOAfS&V#;~Ca+w4$v#%$^Ub42_;(%thkw_;{d$$2udY5^ zUxjyTj~=ak{q48wYu`e-wMX#u56SA697Np*=r4%8$shU`y_w}ES?7G*o?Yhu;D?X5 zKkarwN_2~#{E35Hvza;`DSOj)@;)C^s=%vu=K_Q(EOG>l$@Xw`!&f}}Ltq`qG6%3~ z6u4Rj5A**3;jNvk#HPdEYRV*`Q<*a@Bf;iSPPp@=8M1mwze;XTT?Bsi^vG9rig zqH0uf2y)*CWEEKGE*{@?)a)Vrw_fqzTE%~><^Nne`1UW!pJ6=TBwr_wsMSw+b~guB z*B=wxjXyW(%WwSqnfraoPqy>{l{gqRzLodb&~*}ho?SQAq=5h2-cS*@gby0La82Lh z?G2R%WIiBUu74emt)`*khZzmQOEUb5Zkzv9Hm=TuS#YIJN4x*CbGm)!&Y#04&&p4(@7!r{X<(N45phjnv8__Y zEmslnS88rWwTd4q%Y=mv-rTwKt$+6B;D{crhL2zX4SuB!VeAxJ;!;X%Rg4CoKa=;D z;q>s)w!C`gK+p_(M<`L_X2S0J1FYGky)ei%1wha~Yib43MoYYl^dPHsk-G)<{VCYTuvYNlr?Yswn5je(ygLKKGZaL%WZnYcx9A$;j*sTRb8o<_rk^_9hXnI3w2k++ zmGb1NCO3xDj`^i3AiM`4V2%5xZ)(BL-I+we;<@?oA=4@!uC8$Fee;eRdh)(hBX0j0 zwoh2(<|u66OQD;E5^ZpBTlGV0G9LwN{W+Spdb5Vq=uU~83zP!JpvBxiNwC~g6U zIiM`Rb7VSb0T1ON1s%2sN2Y`%XU!#3zha0#+%iJo8{+X5KeQ}Q;TVMS@SyS5&rNLI z1I`TYXFoXXC2rf0WP3R}Y_(fwtxoH*dD|I5=g6Jkl8RDoDYZ4L(3uo^Hmgua3T@9S zbSZ@{?Gm_2UGtne|N05(U_)H+H^?xK=B-EXJfo;;AJAdg`ni7Hl#b2r;%8S5(Qg*W z4P6xO{3{+%w_#H-BR}6jQL3ArP0!DfUqY{sX2@=7`8&$VI!0MIE=`viUY=w885E=b zOdOpRsX2w(9c|AGcZYAU-@&%Bsn%cdBj*K&H|Ajo{3g|W)wt%Hs9u6(AGyE*SEhR& zZ27Ly1H2q(qhvt?Y%XB6o8eT05Ydx2<>sl z`H1y^U9c^s{$&@WVy+4z`}}av78>wG@623%w{8 zYWRr1O{w6^zmkr9@mFu3UB_L&`iY8}GR_d?UDQ7&NeT;-%ad)8${fAgeFNp9VjIb* zv$S*v&?0CR6EcO3qFqch$o<_t3&j?|aBB&p60NMP@Q-Iyb&&V9+DlDM96|qNL{X|` z4Y=%4RMwZ__1e<1(lF;G=EBK#MbmFzz1@EIn1lDfyJLpLW;>;th!SrPp^h2UOUz1K zU2@wl;!DjcTwS(2lDjs!va6(n-@+=-Tor2PRb#tpU{x`Rx7e30Y>G#-P^gy5Rm`Gp zC^`*i2&J`>OE>#pKi;`xC%pF}XdBQ+VYHEi>wtYYkV$yy2@3X9bh4r+&Vud>3MgTK~Q_q5wp?GHNzOrQX*1AZlb>Qe&ADz3)5!-{#{BfCoMrA6BpdXysCCDG_?8k-v zNbqd*v%xvAq8dTWoEzdES7OYz-mR=4PXYgjAF#`wQS?J!Z|^`^AhsGpm`pW|)l4p9rP{130`JT88?GwPt-9p3G@mplKZt8sY;4U`%* z>P^O-X7bNX6l#d4CpJrgb6i#HNpefAoyuCX`r;wJsu|;}S-tK2mq*g5Uh!#JBowSf)+Fo9F+oWL_aDMx2dF>swV+{5z{SaHx8I>Ib*#57ka!_j>=v|Sq z7^!4W3?{L<)VpK0kyuaizBJ8RUh&1j;oiZ4^2XP9rlT&qgikRqX|aK_Fxuaum_5k{ zxb+3T%bU-xHv|aK%A3O--^vqGow-D#c*71NHrmo?!%sI#I)42?kCbqBn2e_bx0=w~ z(%Oa}_;K7P-yylIYN*Iyy7uthhBV-?2 zL3GE=zBKe-sgX^7g9AyHH=%U$(TFExDju=*Z?~6n9Rqx8C2P2GbBYlb(CCxH9XABU zb)>e_an^YC=J4S703~5_ApE#>h>j6{?o~1-ZGcU&<&3Hd*thO9*iu<7KFKyTBgZh` zn>u1(ch`4V-fr~KPIKJ!_AIzs&Qpl5^09%B5{+uZs6h8mUdyG`5ndz>CQa+_(PS%x ze}R?QKB{lX7z>FA>w%I$4}kaJ6kLNMUTZ=ZmjIb_x||J%{j5EJW(ZGP90;Ep%l%LA{0jo`-sLX z{tVnV2AV%EWenfm#F~|HO`o!K10db zG{+oyDsx`v!rhQt^qUyUM3v4Bs_B0*m;ZUsd~b6!tC zbT{}G!=+{fQh`=fl=Nj{eHnW>X4mzsfQ5<;rpY%aRY7cFBJ5NW#ID8T!i9X7@JBX& zEuM)LGsy?+Xfo_U1ODJB@cjFN{DHYlLJKA~NsLb45hh#Bik0M;Y?9C#6~OnHq9h>< zSC`ixWAw%=ILYK;^6+uc3esD5uePOy9zFIcH3%DNXEjQg>Qe9!x;C}?*I^$(_5m~Y zmY>pjggu_!STAmK@_dkkjj}09Yu}VcY+CD4(vN6Z+{|{^%(stAn{1H0ejQdMHBH+r zD>*CP-83r&(UVw5U8%X3F+FaD zja;G5?OS6efso&FwaaDM5b z6lU6=yOy`TrrCu+sU$ea!a%TVH+n=v(9e_wWy^YY!i;fAb&zzkkQa z`v39bv-989^g8e780bz}%ObL)9-;R+8nUq3PZUwboNj^Y1Bk7kc03(A**e`mINS+5 z0y)Gpdjz`2Pl`zwDy>{R4a#B<3&9hzal(i8*)V!QQx6}V#}BTutLVw_>}TLTqlXwl zA>+Z`-QH%XB#SVx7pH^l!?wVQjan5b?C9N$2sJG z+}?(7D5q(g4Q+tjqJ7`!;(y*5u6H{9#*p51(8F6VcqC;PGET0A4Ic-g!*LMyN>kbU za#PvUsq9rwWv?`qzMTpNK)|rGbI%NfD~zckkCvC4SdD+Ym51+4n;{^0$MkYyNEHMw zvXO)X)FIfQ4lhnI$OSha!_3UEA4PeHBRX{YW{N>zhuh)I_CN&bVXr~PF&esoek6<2 z_X1()K_HwY)A!3y->)E;@8j3$3UzK$gXS&{qQn9K&Tx?TIZwOP);K7A2kIPwJbmv% zPHdmTSkKzyah{EF$en%*UY7$_vHHJF@YYKJ7O9i-{5?n*{p@`Pb&)Lf^T8z!Z^H2% zh*1Iwk<$nd{4FOiQR!YPHhb9sb0nn5FH&?|7Zyc;1RYN~mut9+N0ZCluJ$fv7qOLj z_d)IY)US>k(lv%rpx*GYU$SETeS?Oi0beDK7sIU&0CRSWCj2(9Gs0*^n#MmG_tL>s z;28lkZox6$9Dmmb{JEYqCGO7kq^k7&Xc!a<3g0`#kpcG93FK@9AqSGk2@EvRB-?{{li*!VFeoq z^Hwra>V;@vTHSQ5x)8_SgPFnkoex_g3ni%*HT;k3o#8VoAtJ7^WL)VDrvu=iI+c`( zNJ=^yNkBnqUug*LeW4hmQJ7YYvW5X!m75SWP9gtSCL$^PO&O81@fe<8Wku0G#}pFd zaZ0);QnBzYRFdA@q;$1A9!9C6NVk#~$xWX1yJ*Wn4z-PAQ~^4@A}dBkAAEXrytVym zrCAEu4K2|*Aft^i@R)2df%={O?0>*unPs@SVYFmColtTU)+VhG60(Lzt4*$$gdU%s zXOqd**^Q7Rcv~Xa+YyuD03w%4l{0)<4C6tA5ZOvMH=ZNC36M}EhC z7>_XbrQRU%EB_Xznwz2Ttf@7s#o{pyj z0y4I>;0BW3E7IhgqOK2ygJlFVJttDN(Bif#@~yB*2g!MD$M|}>L=*#4qrx(weyvCd zz^{%E-n2Z8k)tyrX`1(MG%YT&t~uop-{m%p7?a?pN;nM+sN(8srh%ULkYLS})+g15 zlqjENI0EKbTe$O})c9s{LHYK2>dQib1%`u^bm^Q-1LK&M5Ee~dJnfr_vrOw4P9fb> z3??2gX4=Z5W^6K46cAnUS(X7X#4Q6;0xpKf8S^a4qjM*`DP>>d-F@D-8L2r80MUv9 zFMOb|96_*vstQJ)kah&nI+syedv&uiQN@Bz&xg)$CY`>wsStubX+sMLtKo9YYBwnZH&5Ef6^viIh~w!kO53v@DNynE|P1#>%19pu)iKx zSdo*I9Mat}N*8l@D({gY0GcjzfVq&6EIDDG*fsDmYuvJ)@9Z6Ki7I{l>u;ugR1G&8 zA~XQq;N1cYiwtvx2ExG*lEviDO^J)3Q{5dDY`|jZm6euYQJ2rMWx+cw6hEau)pZqjKezl zBMfO2H6R?V_vSRD-wz$8qHCmbxqXiou=-x)F=ZMllMImME=jW*h=Zh#k9N(C#7-R;db@k%ar^GO4dnmK2p^Dx|2;&e!?bHaAG6-=@%4bsG< zzEOX`Qw<9Gp;GxlBv%EIt!y@mg{a8s@nOC{qBvSer8$L(k)a@G=Et9DW!u zeA+TTmtm?7**G_0HmQ-NJPJ4VLNb%fuCP=k=F>^eJ?nU85_v$sd3~Qs18K;cx_lu> z#{yNO`ZH&y#A;Sfi7wBocHQkdVlwo0I$~;<4^`=+Co1BRD2RKUb5$=h;3rnSRDPis z-k-?pk$Fw_wxtsCR10b9g>pgjMhmykiu&^5ORZw=bfWU+jTZLNi~Tbf_t-oG9*fqH zj2+Efh8@hGRWTL!!cJQvEZC=#pQ8Mx7*59>3r)e4Ud&lx%=Zc;X}MK)Ox9~EOIDkR zBRvhCY}QG4d%5Vyl^fL;x^#su>kH|cwc>TJuVPlZRk8Xr`r>tHMe9;u!P`|vNE23} z(t#AXHymEFdDAim-ACn&rwVP(Oaeq4{!LM6avC|dw_M=^8&|ksUQIk+NMB4u-ztM> z;epmsH>A`Nvo>9G$%cZjPuciKvz5%cGkg+ZFC3m8hHvwCD`){R8FkR%BnlNzF~d6; zMn0$j5-)YB*$_QMI+*#(utj#P%ggEsM53K}V@__Pj|WH;lW`;L8vZ&Jl`==J25qWP zDKE(p{1_tVh62Ttqw8HTU8-R1{p5?TEGZ&?8a&v^8~LyBb-Ka0Bn zLWXV!;luY=Vr68`5abndR7bvjm!K=#!k=Ize*_jB4yDJ*f~?7#|32J(`Ta5c{?mdM z+L}%-hT}pDZJiu{e{gt2MKRq+VX_K=p zeWmv-!zP@TSED|9L!?7gWJLPtl)M*m*Bq+!GQMT_e)s`(_2g&PL0^5oe52UDn0<1{ zZU6;)+x6OHK>wkA69jk83mQFL7&h-T%)szYyJ|#Yay!xak3eYZ4!tnqTjn=xMvNB1 zPdNM0;m*t5qvON>rl4BQurbwO1ntN}(@2;}6se;DvZb zr#0(B2)6sf!LnP{9Q_SVHX(9gK@YLKFY1#tS~RO*P;C>9V4cfX*oo!cYvwiZvU?X< z{>4ttGGHfH{U6@Ap-w@V5|$NFIPe#4$r3ijOaW0LRQBTXV%;ZPlJ8NMfvK|9)|#zk zVLFI`wqWkthA7uMHJ8F9zCz)v4pc--0aRHJok-}?R(|DC1SanlOy`s}H56}4Q_=ie z%QCOM8Pjt7l>01b#I|6HX1K070%v*bboW__&!!;(O#hVqSH?Gb*DO;F)d-1PsFvD< zDa~Bc*IPf4xfI{bFX$dplt;J9@p)#~5qG(>mBi_q3tP7k+iKHixL9vWiKP+o`rEuY z<5rZz6;L!}toYhk?P2b}`}|BEy@i6yYwyZSR{42cjeH+H3jQiKOL$~&d$B|^dAQ$= z$;Eg$J;%Uy7a-|0zcYD01DGS|`kh{Bz5sYsr~qBzRNlU?g%}oInT?sn1tm&j88w8#e}tugsvy2R@D{|&k{G@A3)?2S1Lw&Ab% zh9EasW^Mid3egBU2}#;5(+O#eH#H!xZn0*ylk-P zM7Vsx@CQiWS7F$W2&aQ|!CgYC-uV>OIs`R0g{L?Ue~&{HC&>o5r5yPflWIy*`Q4z& zE{Dtj*5=@qxnJi~fUhpk$HNcS8dF=Li*S7DRF4BS=E0F-Ax!J;4!b87+5@K2{_SS) zR_%%?&O;BKI_W~6`bSt!2L_sBr^nt17Ecver`M!}wF`&ZSaPb<2a{oGDc#m0)$JzQ zJn4BGEa`;LRkwGVL>Y5)s^PW zu-~oNsPNR;-%?$CXnvv*F*Ug{12L)Tc<>xjl)k=ak*G=of3kmawDUY{juh`Zhex{y z`=|RSuQ%-R#QA3!-p)M+W3C!c;Z7xYZZCfU`-k-UtQhvE6Cvr?Mobr>gdBY{jxEc7 zJk|7#mhJR({yVJYe?Io6ZRVT^t=p7zSCMTryQ4S}CBUj1MMd+CpnW=tnl*%_sAzx2 zneFe~v29Gt`T?rrQ-4#2e|Xp6w``mZI+^&ieh6t`?Rlbnp_@a%BW!vm;a1^$-Zo%n4V3>!1^sHf)Pg^9$GoL+WZ9;X-`a zfMdWEDn_`D{Y5Pu`SiGDO)OWPsAlYi1=YO?e1}c+Fx0mg*{LaJdvIfw5GA@=xf5wX zWOOlWGn!lL3SzG}s)ikxjS(Hb@Gu6M&!Ul<6 zpdy4A%Y-Uz7MOEV!+ypKAxt#gC-9WNE-ewWvm6;MO|mPYXWlUAK0ai_ZsP2kwm`u~ z_sX&b@6;Y&nkZR2?`4w&H4R0u6d&w~|bpWJ4%%oeazGxq}kvHTrTEohk%; zzcX=b^~O#r^{Q-coh4?cgNpsJVtcqi*B0`jP1g@JSXLl9Upf-2&pU~<%Etjv$bKKr zM4&^+1{9RGVxkc*%O7CdFEP3)=O0+@*L0zDH&>5dXIXz9w zBNLj2Qb$o3U;YNuf#s*kHiyzFG4hn_aMtKU$D0adQdDxnh`n{eeU4q=oy%idyyN|Y z{hbJ)k$D6SiY+6`1DjOHZy_V7oghV;kP)F=s(?&){NHbOjtpjFPYZVV6YaY(X;zCq zdC~Ej)h`J+)xPreRH(-uHe*rA4@V-pf6>8U=hAK?))4rf#jfKv0D*w&%nvsp$ zAF_W;%Vz8}F6?~Gd|$5|=32!#sb;fcUDs<0uh)`_HR9~;ll3N&4;b%{Zuofg4At7j60Gk=-w!3qnu!YsfUTH6cm=o`bD%9UlHMd%XT6B|W8aLuA***`Pk8asy zw`?nB!*1JBqIm{ZxpRSduTK&VtjPGj^Iwl?{IvVr)}uzLnT_OZoV71E$~E_nP0c>A zBOq1|=Bv3A)uevwt9G+q8xZetc>J%L(|tIyca&;ISf@?SLu^4~%2P%dJ_YnBit)yB zFA@t!>K4E7bPlkEb*SAaLVRz!b%UZ`IrGShjj7l7zsyv4>k#YI#{6Y*L`Qe|fL4T^ z`+%Zmu`P03k4|baEakpvUeYnPhkwny2IXn(3R}bT5@zHRC#G$Tz2W$0&do7HFuAc< z6wg1s(hZtpzlR#R;Y%_MUwMzpn0YI)+Qa@#-l?Uyya-}-D3ex6qqE?NRxtrjW$ll@ zGR&28&Y$R&N`BV2mKtPPoDI}Bu1SN_1y&Vou*J>IwA$pWB?axz$xuc`Qp<)HQHid+ z+;+{>O^`HsR- zA2#|$P)rXF5|rTlGVADQ`Hx56AA*4X*fH^LpvzB-i!qF4BdV~s|FW*abfrHyuc!j@ z-{JGE<1JTd>g!Y#rx4t(EI{IWyu=zbF0_{3P3Wm2C0D)Tu>Oj4GW^0ap&Bx=Jm{>^ zdVax;y;dwK-Zj|n^ePCJo~u@AN^cE&#G*b{05494Uc`xJBS)Xbk1FIiE-f6a!xUS* z%B~vIXgPefJv3%5)g4)glvhtT`^U1RAmr~~BC+{qD>tX~!UK>HR$o+LBs$9t(-M5g zekqTE2!$j=?{?RVrk<-exDc^*| zYu5{TtZ(|FPC(L0z)`|uJ}eIJV-4jX*d5qGP}3^!eKgHxZ`j} z9J>I)F=;r0QQA+2ewqe@Jr` zu2#vpjS5aWS|cTApr}QQ<_dd-vUaxes{B*5vDMvI$_|$Mt{YFUKdBgxwSfA}A=M}j zE#q7}sQh;iNrDbxOrJu-s)#*PA}lFg=jgpHUh1qQTQq|y-DjsoidT07ayx(mDS4QY z%>cfVs6p(JH(=_7s1D=oa!dh?a66{FC>$&@g%hZAHA>0%n|_RL(v|YA_v|x*v4(*T z#6rhLdoKEjYb{QSs>?l;SBN*{=;)*eJ3=R6iuAOA>MwnQ{ZkBu7PT%5#2i$t1)3By zRw(9n>)1|l*`u~*$rcElIbc((lPg^GD^+aG*qX*rB?7HL(*m&Yy0V#Yf)eOw?dQwB zka{ZOZC>gukVC_i&j)XDJ5=BIZij2{YEoh6TlskppwBt3U7+XUhG19~7z$5SxnV~{ z*N;~i(h}SH#F0d_HZ;P(K@V8(#zj0mbgr z1Y-^*lHMRNB&gU~N>+Z=UC^r}=e@yfO|jW?CJuGq*NIfrwmD;$ZQML=ck$>rlN}Rh z+cu7&htayMCnDfpY?A9ELwgGpcP&e*%KI*S@icooc-M-(W(M8`1kDM93uw80hLfk$ z#*;-?EH5Oij139nJabD>zAhz=_<6JwWu~jFLhRnS7(k= zpH=ZJj!?T&Re1M%*_z-=EFM2I?A7-`FrZQ8J{Wz*kW|BmBdQYd>PDavT6wwm<{X6= z1KFPXstse|5ujIBXfl97R}3q?H*LqvwATROl-kp4J`SttuM5x_66DJ&>4#!ASxyLB z4bSOIhgozffPS9PJ6WG#IG3>oj#70FJZc)MR$*shVlLfI)N0uS>}U4Y`|*@*OU!U* z-gB*)q0PFaV6{rAt$?R~nMnZY{_w1gmrN$upL*-9Bu6IpAbu4!YRgKFY0XWX({JdFt{zI+phFUCme~hF(EwacnstA2RtKZo_6osn$CmtU)j}Y za?`+vYy{cnc-J5-;xR{WeHyRmT4)|IcLwmW(@*3QW`jf>{W(C|TqMZhVm*eHypEYN zPSEI-J7BY!tQ#2T35l<>%&T6iaBMt}if!_~UFEq@YiBcIk}ee8&+L6$5*s6*BCYKEorMTajW6f?}wpj4e-S1VAekII9T zwYvO-0ehbQ{$~I zB;a#?UvUb=zR8DO3GDZnh&ulzQ^GFeq%qE?u&6n-Fq(cXIDlS>>wcM2k+|jpn=6hA z%x>RRW>oN#gN;W7#&toU3$G&2ey+HT z+tFJTTUjKx$y-16ccrRoLI5?KC4@VftC8kvhVbK^*l&?RYOPt20-)eM%O*ZhO$DYT zWZhl0(4TOQL{_qJoZyqhX#>Jzg;ilsHf5K<7BMyi1O9G6I^$RtcN{f6ua+e%&g=W8 z!|D6CUUlOApWz|&&4KhFEM!+FK11@21@q}k|Acl zCjTi`ik7m*00US2yA=nur}yV+6bxsI^$K5)s#G8J<)a?mP~Uqe%umuea07V%nZoZB zXxq@`W@`(8n$}2omTsb$DbZC}>U!OYRjRJX(?X%&F*0RB!a-}`N7BWBVrOg%3v7v) zoK!i3e?fViqZ1AM05H{q!%p!TtCHAVnR-z@@L!*wQJ!09t2RFW5<>iXy%7IdXkRDR z*Wz4_DY(PA8jRyx0>n78rRLET7r#@=p9_rwl$lEbV8{0_)&R_uZGNX};CJE7=PL|~ zNMSGwp{yT$4QZ~xqv%LOiKeKPIeq>!AcrC2Q!fM5-ka5lIJ9B?%&Dtt0E=BbjPm$( zrwyGnoZieiW1fjOFfuFWogvBOvqe~Uu{O`Pn+Y$5jR&jDvXWM;&+g&VWK1Jh-X<_s zj1CK~%^uE|lFL6?AEC%Wp;+8jtz6IFhXow>c@8PD_#`QDmV7ubY;KnnZF;!!G+AsW zxlFCn>cXOUT~@i78r@bXcGgqI`K4KRr(G?|LT3y={ILA!ufYWk!W6yEVht^rz2b`mdix$t1E$k`G26H4z<4GbFmT+WqxAg>VVA zH~04Xm&)f~nN(Z@N@+I5^w{oMg~aYG;8}IV8SMtCW(j_~)~b;6-&wCrBe9b`NR5WRB53k%npoq z&~6RJ&E#*4rcv;ZaZ@A2zCPJIKHNFha{hxp?0aDpJs(kVliOHEO(jyszumpFAYF5? z7$3}3LhQMuP7>M#w&+5$QYQ;jt_~*I9-kLZ8B2ZD8^~exSKC84n6E(yn8-o>%Gp?5 z+8`}B*jYP?h19~prtU_3nyz$KFtyF4gsZ_^eztr?aacl(+%~z6s^Ie4{F9nM zSK`RIS&F5XPjedTZY0WWFbE7SH}rEYbz{=-R`y0AI!j%0=uW#Jb|otKFQE!M*I8#e z5qE|O5m{wVjP*&xfqrG{Qq}q zg5*M=Zc@ewjaiMjZy%01ie@D(nCp&+5#i-&aQt@UL^z-91)Q6xj3f&sa{q~AUCT&< zbZb5Wd}n1AH4K9yN%~UMes+CA?{IA^Y2|E6X4g;4) zgu&S($a?eU8#w|=`w(qqTOlYI08J)pkzPl=WJ?qt6RvW8dJSgl2ZNb1aqL%F>Qvix z0lPWy@x155Cmas?*!hl0_Dn{aaYjihZi0r_2@p{t@hVU?!;ugB-BXAEI5qjY(jJslcTk!f@F?!PnH>uU!(NiQ*Qp)6ZzK6_GuhrfIzIjHH``n4E$T2B zeQW@gs-X}Zs65x(kJM8C_cxP&+5wcIPyx7&5OtYSiT6fNB8uX*6`3OfE|PKMKqg{6 zIX>mI^&T8T)vLraWX`M1_YVQ<$xIUe=qZVZaNWsc_0ye;>EIIYBSN+H6*BomDF0{o zAo-4;zC=9tt+JK_Tn)XVT{kbNKE(fu5 zEeDpiB)>SbSywdF$)8UuZkUwN#4WaqWDV-7X9RBBUYay8z`z+RO?LKwG)W!2Wm zinpupC|53spo(x%{Tfm3FoJ7zShLifLpb4uAme*$zD6dmUyA2Hrz?5yAu zGc^aA*V_=M&_0(>^1WQ`=j>&SV`JYMBZ!Zy}EmsCg#^+C2BHx^ib zx5sDg^K98iG;~N`6=?jt6xbc#e7I;^7pmA_DzeOBWYs3l#ePKre7^kjyi-g@$^GQz z_R;a1m)p(Ijjn)2F^LptYRhXTrq+mA*ESiT(-j6=o@2#PW&%Ie`*7ie0;3>$5Gzn| zd$tCN#k6j z4M&}e600Hb^USF*OTT2}A)RN<`9`sQu(!9f9gbrA6jgEO9mI4$h}o^2?3*@VfG{*6 zqqtVtH3kj9Fx&Ycd3AO($%@CxAL;Ld^}nyJ`mr)DIVOps%TL;UD%v=2CQqLxYo9Qt zXMRw(wR}HWy?)s1&DHkN@s7a_+yf*eqk+sRV3}YVJog0l^eVebaA|#Vkj*vZ`!PBT z$wrt>4TIBnIc)$Xy(uQy$oh$$;&3tB0b_$AMm?f%&;?ix=m|A`CB&&h7>aV<)(qRB zCOt+`FGFZz1Uq8ECwyp5Hr1IMQ2;~SrPyc6vEyK67+R(&fgY&^2%f@gB#VF(>yMHp zod3&hEVfZQWc*vH?l+-*{0I#|8R%-GO9`QUn4f|PUI0KG?NbgDFU???O(Gy8^ayO) zD94?fP7v8BN+cs#l27K_)<-+XZ?;a3c0LVBxkq$*=}b(CAk+S= zSyH+7&$pK2A>~Ck>%81XzWF>GAQAh{cP>$OVMhDg!QGe+Q~G}UqWyx4;O}G^ul$8oBZti zE#Yvl@}iUV`|Ux7MA%(!RR_3c)kFmkt&#*5VB>;_gX9-=qC>5)fyABqCJL>1y8Pu^QN=zf6bG2 zR%+vRjwvw0A-LO4t@V;?K})5IAk0qt?Xj&%*+#m+`3?XH08P-eopZQ|O&l@ks6-nN z`@+}sZ<2n7`Y!^=B{2V4Kk#-D?gb-2kwEyNJx0=7#FnADwgXhq&Fk(%L>7+kPZ1pJ ztZJ|w@2YXFrZtuFC6={$f$Ch2Ma@A?<1n(p#AQpgrdDg!4nuXDho@X=nk0EvW4h+9sYv|sO;u%5Avz!~? zP}bBic%)X2g+yLy3z3WJNcox}R0PC?eW%7))A#X^G^{oJ5&B_$q)tefTb#~1U`e@z z9#>KmIUN1^Bsn?y{_yzp_0~@&hBv)q+CDW-J`^ytA!BN}fslp|P_QnB%5=s)`-Jdk zK3u6nQtTe=qM@a*9xV-*$R`)bdE0PwJ-$6s*URk#<|h{yhaU#nxFXsrhKcOu6>%cB zw^8g46JJ;6y-rNh>z-yEozD)>UZOP1K_7jj*~k*l)_dm%waAXt_j@J~)AHIoJ0bxC zg9BAHVyosZc$K9O-{2iVvWVIv82#urAO=tz zEk8ws{v1F?Rm-sSw>t<)x(%8OoW2@IOwmemF*tH7#0{@lSZE|7E~`$e-z5tTV0Gz| zaRKCJ36dcWRh9B&Ww_#C#ljH3apXAMw7M6|=Q>@~ggsUPYxz0|z6A;VUnOkJg9>A?^deA)SsW?_EQ_?#DFH+Z13vIo%N&06J8yCqXXS$KSN@py zU=Q`QnbQmBKIET3p+ToV?PkeBzn@>h5xH`)U>{22i16Vr`4FFYe+4ogL5j%U{gTqV zn-!gLKAH^2lz3trFCosefuzkNn_MkhP|eIWRA@-}Zq{$#u)7IaN?=2HIdzr)!dCJd z$<`oAp(gg0itRoUIqv-|<6IdNw4KI#jb&*O8`9n%_>NbST{I%ZN;-VWf`RPA0tRSZ z5R=?de+tF09WuB=6M^BtW$ONUdNnFEl05*XU!cRxusg+Nf~JHs7kKb^&TcTF#dxyZ z$;X{(E@}NHXy%#%e9{N$aGW+*B*E3E!G$+IeGqfaa&Q(9oMvrtcS~VgRH@o@shQ& z1+?~yy<={m*B=6cQMzF+xRDH41OixQOA85?}{Jg%-qf(DL` z4_jilHV(Uo2i$_HG9;M&Mz|ymsR#?x%dfrRTR*!dr2)hLVE=Gu?_is|G7F8U@6i)r z)0S4)N;VsBlsORrtt6M!g3=RovL$Pc*|qu(SvT<8%9xGrT_swdxDPD&UJLdq8;mR@ zMe^uOumEraX(F9UfO3laA^e2zHpT?caU`iSgNhH^2m43Iicwdiyq_%t?a7iSv@B13 zt9L6w(mpGOeRSoTIa*4Nz4Ki021;h#+Lp2H?g~YlA|hMAE?AC%c9~)BgF_jG>Gb4H z*r`nawmxSTvt7O_ce&fDnkDBCF?*7B#+RGB-C{Hh+Ge!_>7&6gS@+>q`f|ev;qk-k zH>LeYak(a0F?qnLPxE3p2-_9Z8g-b8jiKfU&mGwEc;=wj7@dL6e&fgLosOr{Xgbkt zi(7qgQ#%*8X?)`_0@);6dwbOrG0rFb{>IEke%w0TI($j3z*@A&=cch4H9ul8Jb*Tg zd-VHD%%nPQTsH4Cm;j+13O`Zqz(4TIp+PgKCiuWrWn<2)eAgYa;x;HJDjl~nHV#)Z z9pJEkRb`P2C4%R|20oPZ!gPoj#~hb+h|9TBa8zk28(u9c1%q@B6tuH?L;sq%kGw;^ zht7wLX5q6P$2+9(>HuO^@Wyn*Q<0=`h?oArIS$Sjl2^uPRgGgOq73AyB98K7V&&2M zAS&9&gci1PSm9w(l)D+bak(xohJD&6cpSP7?`Ulsjl(4JWq2F)I?5;l+m&lbc3^Gfv>~zmmg2~D(>CtbaD$17!v5p)SBE<< z@7!5U6eMIOWJ(-9e?_O=owX$7pu#f82itoGM>}`c6H)0J>x`(iuEsMyTw}}7@?QF}J$7475rp>x>Dnl0Sg{e#M)+>$TGp-}ThnhqMyE@Mil2#K zj8&s(w@7?OS6IU9)5R1V7%6}N-T^0O4;k zN(n?a*n%%!nNh~)%sJkgk+n3NKB4T^Z=Yp-`_QbGtj!)4aSK*42W}(pqO8`-m4zfD z(vC*`DoDUWIFV7CD}k}VRn-Uh$B`~E)Z%EAwa4D`gx7As`&VwLn7$(FG2Zzdq{+x! zzdIGg2s*SVEPeRGv=|#nI6@g6uM zW+kvu!$~N6hF3dONGAIXA8Zd~43fEnv^1jHAs&XBVdn!3t-;z3RSYni|?^AuhMua-?Wb7FYd(-B<|*rTUBLIk6%B4~XXow9q3{@iV*DB&kAcLDD4o z*7#gR@JJTVgh}aKv~!{@Iy?`QIR)LbX*E-Pj+~WgVQ^X6hH5El zH4apCG_&Z)76pk?JDXX_l(XDLJ}xG-(V{bmUid9YJdSQ&A`Z>C5!osgjSvwhCaHVV zU4BZxDY1*L3!j8g>uh?Chuh4F^q>Vj13!U;S5gyKbvi0_8eRiw$=*1FbL3n&W||*9 zij*8$I{yH;aaJf;oU8&fDT*m_mXyecP|2wVB#8wENC?IVl)#)X-i{TXQ#J}V2zJ9J z?vSsa#MJVm-_9F+|FnDh;$(kYZLx;j% zlGkU`UJt>7f9JTgQXE?ZR4E4uZh3sehfR|4kbw98PhauO{6zOZsLdaZzHlG2?|0v=tcvMq)Xy=Q*K{((&?g;o<g2w z{r}B3-~MO+|2sbR{#O^D?|7RY4}Ulela1rWwZ?FsJZBpA?fWjH&btFQlVKM3Ta12r7J5rf}8dtcvbA&&Kw3el@)^93+VSEE>t+(?+Lx zr_l(;(u8MC2co0lRYu}D$CxpB z*wb>!lSCe%_i^%_Z#8+GxMp|v$xDKu;>0xfo2@kI$zl!6zwvOKB15T2)LdMf04( z&y<#Je+FumF>AGj!+lp?r1NY76>#ts=9Dm!FoHkyK0`o_7d2XSc5m7{MR547M}0uM z-kh1xptNjuZQyrlsh`H!Fbj36@WR&hVK{GJ>xe!T)3e*?lNH$=RO;!Kx}{;bC%nYg zZPoDg3_LM;L{JYyv26Nv#xf6E$?}>Olel!y_LEJbOYRPpvW@!@;hec3rKN3P!^`}n ziQw@5v92vHnoVe7e{7n(>FL106<$~HBlLRmYbFzvN!vE9FFm*f3j&@>T3vtBhP*G_Q@}^{!OC~R0W&DeTTt<-S4N4$9#av zSc9VhMp7@zH0$NN!~&xYqrI!K8oA1@I-{Eg zX4M1SNEVgpCUK*=k&Ke1%_N9{Bw$_DKG`5O<%THpA&LoXnR}77gJ5W;w`|0?SnARh z=B^#s)R~6=y=~m?P6?Au1Ds$;vq4d}=K{EYylwl@-NKhW(*xEhujY)_)hEyM(|K_I zkMiiK9}OvLRD9O^a^m)u8(u4iWygBWC`ygw@kWm?vW`->yJ2GQe4-so16byfKJ^>O z33PIC4t(uZh7eYXA`Xuk?PA%xMIY5Kw1d%5iv1OFpQ13SeN*R6X3wlB=%Tg^W;bZ5 z`@m553aL>kJodPhFR#4|axM=lafvXb0+(oI7!OVtQDlwE3>jvyixN{ZX;i#xatsoRHbCW;pW=v}$GCr_p^1}l z4-o!Kv1cJ7wYyy<)~*D|IhM3HWil4ORx3ApIWlzJd<(v9)@Xg>T=wnhWOz0l_CdV& zY?$A5lx~a96iO?G_s++=2m9`LDTIp9DI!KGgp*}dEaRaVpuoUZ1eU8CWpb~0ik)b{ zXoj4IjOM6(vpBTrfGqGPsO$xZh2}a7Rh+Xd&dRfjO)k6q*UiuRVAa<<$6N6K?+>0I z;m^-&Xj7fZ602X{KiK~9_-K8E=?%HE|P+1z~8Z+9}Zxl}`pU)h+ zwLNoy9`uT;Ruy?o9wD#bC%xFzqlk&Tk7FG{>Y z+X5*lYCfH%s&^d<18R9?m2m521`al$Vctklb>B1VPR(Q;bZO&J6@t_mABzP+fOSY~ zLUZD5tCR7~RVj#B5F}~hgDr&ndtLT7=>R93abh^m&oR|siDxM9U|p$ozfMQThr9bP zLFOte`@SO7JLfEyJxl8deT8}Dla~W z$v!c*l{r60^-D?7F%egoQX>+%pX(l&r_?yb$QWt(N@iOqDkX3zhLnd98VIu}WY)xm zpsAI2s2e;9XT;@qL!l%VZ?>L4hZR1>N(<~vUTUvKDO%m$(aAGv4=UBQhcRR4ZtwNU z9<>LRYTFxr!hByJ@O+_CU3;V9hxyxkbMRMc4=UBQ*UjJ0-`?}xAE`a4RM%eqNe%95 zi}{Qur-Q5cTRho+O$|aNY45X+H^jJ>N7;`pd5)OV@~G#YBL=iQ3i;hK;!i@pU}!heEd88-eIDRkVcAfNZzYGGUq0!u*+z0=6Q@kJBI4| zORbWv1CgCCftICrm-tUut&iIH+sL%y9S{PuWa28|=V&eIE8-Cnppu4J^Tn$oJa?m? zqvnR%aIjs9^aWioJQ2nzwM%x?fx!q49Gy6gsfc@YXMJ_m8;LkelGB}|?K^kUd#QVL z^k!#!cMB>k{QXahOW&`@KvM_}hJ~>@Ws|2;=NwUf+^rxH2 zRk8e(*1nR#!?(IZ{dX&*3g3)&Vy#4nm2G4i9XH#%-@A7Y32oo8!P-EH4Uu}lfuBkc z=Wya)X~q*VlX7Y;`n9~g!9|{;N>3i~=qY-&oh-hro3OtKmM(6eySHVc_A3uM$#2%j zn8-*MW?}CrjET88^13>X=Y;rW@(4t#S)3FOkw}pVyjU@Vt9BpL0A_v;c-dPp!=B!| zmo`h$n?_5bY%#&H(zj_ioJAT$`gb6GFnDdDJ5&d!;qX$tcG7pLy<(VmF7wXjDlf=6 z2f8s+kwG>HuqX;4K#?KG8z|qM=?!PWfhR8Wk@I3}WGm+@0H=4Uxs&;*w>tm?5E!xN z*&r;%)Y4+U(8qY&5Un~TbRw;I(qRhG>H7^M>Cau%G`YHkA^|p~?KII$2YJ!%k1pD% zc(qv(xLn7U>%igEuP)cM<+>o9PO8hD+j8gQ_UNLzT;GWR1L#oRawp=j+ zCak*L)RyC`-pX%sM9JU4E_#THSPOO-CK{M)q74 zkMUMRNf%0LXjFG~y0nCQRXeg&hc>fM`()@3=YVk=r_s@y9iX`70JShEyGz}@wVlFp z%7G6?OY1xu+wbPO?O1whjDUfqFbN&3N!KNQ5c7_~)!^lgikp@GiXO#UYoLhz>@(P? zdXunV^+#UeQ79WC9CeNHm8>Bmmb?5}EQD_QbI?PVH_A%tP<>5v5I|81m~|tgd0=bE z$*CzNDsh2U*WYCO1J2g6I|A#%2FOOsYp#~tiEhh9OIAbMOMLEGyWd8)xLek#c42DP z$ShHC+&(qOEvFrgm3(s?wqDJK*Jbzao$1+2o0Qb3IDjY|WP}K37}QXXK>UsOM7%cs z8Hz~$_Qz3%LQZkTxsWv>d(zB5d)9s|^bd>YWH*?mcF(`@o7;ZivU{j<; z;;rQ7Qx`VWE{5xWeVSd5+PATb^Q`_XVlBAf!@;*42L40OtLH9T>^JQ zRT?-%v?9!9X9ybQ3@D7pk!2VFZhRwoHJBI?+et}=oSZhwCiz4owz)V!*jAQ9^)l@qv)*$&P@dwH|_KOo@UFV1;5^ zqg*8swWN}4Q|o2tPp6eJU~|bOTaE-SaHy3~iNw;2r<<{lNwbQuqLs=OonNAwVcJ9t|^b=~cqYf`t)bO0iruEL^8 zh~+Y$RjeHl#V@#WRfild4Mt>+R1GlMlEtH}W|e9L2-XFjl7-BWm*N?^5mE1IKNzR`%w({Na)MwaHNUIxPalrK>4-8zNcg;CRD{HM-t>@b@;*7yFQzrXBAQ&ziT~=_oS*YW~&JyYY#}Th2e+Wyuz5YbAi)_FnGPx1wqG&FS zLKSR|SN<+RWq@a0+1NtxC$y}XJyq3GGCWCR)=i4+AJYuj-a<3JkjWg#5om9W!qnTv zrSF#C1=Dg!Dv+|QyMp!1t(@@HT^VZxAfC3BtODdSYpBcP`JbR${E&(BqYZ|-KMJgz zXj^~O+=vJB(Q}+g{$)M5x2R|UXbWr)gq{OJZwyjNZVYW)!GJ;B;BOkwC!9RZZoLc; zL+eDt`8EwSv-qhJ7*!SfHWjN%5Dj~&LFR=B{N#P0DszIQT0~HW3KB0rP~!1|BOpbS zb@{DhL}x?7?-IP617u%p6fVT&nTNz5UvK`^J6ywxY(L-P^x7oK|wI z$tWB5R+sPnrCGnhV=C?RJ4{7BW3R8zz1P=E`}gDgaCXWgPtNa_%T-cdR~2h12E1AyYo~n&|3D|4mKnax9`9iO`)!OD72oju8piCo?}BGz2C*$#8>qqWUwH_d1QRY zw3y;`r~djb_=W0Ou|Vu}fE{CBhZ4r{UL#L}`Su$h_hB=30bL&4bScH_^ue$KIQR)S zCLIB$gm2OqKeC3iO8|`cDm^Dj@~6TV?Lim)x$BpRR-AU)cW$S-;!(LuQOSO)B_8I- zGCjN_bwUV?ibjoIaLz@uJpUXk7q1?EO8YY|!Z2F`m|>4=xXO_tqbT>{6d-H59mFuU zi;9p^@duSDeZmne$_Q5H904tj>J`I176ZNl2HfZJ%sv}euo73(s}cp2-ktXAlY93{ zb+)Fi#%2NY+y|(lXZ?nrNpn@_8_IpG=u}~}KDTBcq}v__!48}ciZvfN;r8rCLCtkv zbKS_N>yc)A&H8?+9Xf`PK+o(Ojt}eOAV?EWVKmLMa@)m^a6vHA{#t6P*H{gSJrc+S z?Q!Qq?Ezp4$P*TM7q4p9oOM8dUA0VW+Kd{+l8C~df#k?|G4{1EH&TCXxxX&CCb4xN z3#B)l0_@etr|mdMQ8PpBr-0>n!za47&_{$jYv6JbEO$ z6>AAUEhB!#RR{ZOB3MN!?p?Ad&)k5eJ<5l3hIb(-0p`n?;DFh+m1MUU#xzkyC5t`uk#4TZvh}Rs2iD^6C2(tg^&4uQO1LKc_4a>Z&9;71b3PAG| zj*XcHWBDg)Py^mCtcx@A1SJp5%j_k*5f5|g6jUh_&a@uOjaCJFS5>z|I`jf9^upUv z8h?`owfd0~GIvTy*J||Iqk1$SZmq^du5y0fj?x;3xlM}g+eV$%%eNS~qDr%kiUEsm z+Do?{b^GdeoqbLRb8 z$$dm&cPE3$Sq6F>4n;r?HC3;z45rg^Vzgr=ZC6B{4}SqEcrxd3d1F%~8W4W&pCp4lVM9|ad0)6rz8Hb`iv==ML1Z*(@kB&`7! zYB^ipW^^OEx)Dg*oF}a`P(5&|!zI*VkAWV!=GmcLB)uEX!$~YQGbw*tm19*|6l&(l zW*l6^vB;+T!k^2rPud6=cy`7uVP@duRJV;I^i>F#?1$VNIZ6l#0qlEv>E=0Tc}<4GePsu^q9gbqD` zk;gx6Pp_+UnW~M7fm{C*!@QKQGDmgg*RlM_hLaGOMggb7AQcbMX$^yZP`Y=eqEz!K zJ+-$*jI7*cTHx)0b@^l;U(|NE&X0H1ZS!qHPN)i32u&^{LAUoyv&;3pC@p|n4~>%yqh!$jN?5B<43%AFI3jcd z8+0y)n7iDVdHWgh+tB_J2BpFq8FfkvC7Q@0h1-{n`$&NH_?ou}f#+y+ty0QtaBL_@ z!fY%as1KCjMpd$#N1aduS-A#lX06O-2($_n6_FvpiXtIqgGei{=HQlt;9;}B*eZ5u zE^0!x;am;j{Mr21HsKDLVr^-OZ0c5&+QL5iN>*C8W%b66#KD>2cUTcp>sn~(sOGV+ zXhkma=Wb@TsbNDTCkHtLoqKPf$k*)UY-h7DpGcS*Cm_!uw@`YIx4mM1W-jpQ4wz?1 zHNqWiu6GJeFY?h2I11^(lPsT03@1#l!)bdO0E<%} zGJuBO?siWrgjX9l2!jCqe$l@|{*B^3JCqmw&0dVRu)dYiJs$cvkO4Km>$JY;b(S2xwc@oLmEiwK%@EiGwh z6dYW&S~KP+!=Yo&ghpUI3!4Y4-RVrPrhW32k}w)>>;ZRF0UOf!;2;c%4r)cAPgI$S z$wV;3*u4%Jx4@1@M}G?W%#AMyCTR>c)VkBnq~Hoa76cw?guANfRSwPiO&j}c3!uR9 z&V1J#c1?oDh#i-N1WV62()1y3e2EwqMwgKqsOy5&9-LF4vKKakEhSf=SZ9)}5zc?C z;v;hcFffrh9Q2%%9C&y<;J7^=*YxaXpxqkX%txL8!Xp_O|0TpH(tA??q_K~{Q$=f> zTcwkA*y_!O=<=p37&`7Ei*m#fqWgS(72%M4I2+N^mK#7L+mOM~%WmBg(6>`OqE0Fd zf}{OvAe=!I2q!l?#$11XjHZ0N^=xlP=gVq*3Q`khk*!h{t_Gv!7^vnVhP2Z@FSHI9 zLnmU}0;ReEdf!@V-NdFsG_)a*T_<-6lyIF4pNdlgIm*eFz<&yENW z{93<~AtyermLulN zq$WYYBNB=FMt=f@ZIdP%YMlr-q?ei)bTTfvdg;k@V zX4fNKM(#8Iji#TTaiCs5;SG8S%aFqQS3GqlDNnuOxq^qzgF1CO${=0I#wEM#$o6S=e_nca@ND z1$?hYF{Xk8??>)Y#_=WGI!2^rslG-0!*5ztYsy|P>k1?}oZRe*a?EyG_MoY;mF)kB~IGs4_H-qr$<#}4M>-AYyMpcJVY;8slX$<)}}dA0k; z-yN~*3&iXaLi6I_@b%X5mxy%gA|sI+g&?sGu)7YTonlAdXV>j+*2%A6r76!DfOnY; zhsEV%f@U!$w;D$J-`m-Leem4nlcI2{L_beo9KME^%?ClOcn6_D zE&Lj@mL%6w#Ai%Bc9v17076u3eS&v##vZmoIm5gnz0RG4chdemN_ka|t#V8Y5q8vg`t>gX?kiG_g!foWXJu44NzGeC-xi$ip$ zbyuUncZsHA$8QH1DX`H6g1NSud^>Hg{P!t!;_ndmX0j zxE4!Nm27DbEw8SutSFK81a@I{0q41}41aC@2H=z6>>9)p$L*s_7Oq!EOREcYqm1r1 zDQ<*23v@BA0u&s>U;qW-@K!+&5w3@aDj5{QmWYR|A^bhVC`YhiEyaiv!?7u>&`XI& zpoX%ByzJ7uR{rrSKovM&6JWd6k|$4u@HEYSvQ$f&$xx-mCB@7ab2xGlBFYkwmu)e-`8E5K zgrGB7O2`6+suwjd6P*C($%I3P+G|*$uiTA^NQNca1=~MyKll^ViHAN?v*5G#jlVxt zCYNVndAtGTMF}t+DAWM49o2v65`1q7%^$7aA;v&sih^u(@k?mxH}H0ThF(R-btwdO znS{;Mo>_LicQvV^ce+tLr8GPH+Q}SH`>j9v-;q4G<$^;w!?y}sG-HJ(=unZFNuD=D z3K6L<;xV9KV>_Lxz_=QA^Io2fIq$Sk@$}xkcKQJR-AdWT6=n6@uK z)3w#pouA$qo^Y$*7XZL4ugL=pA*PCF+}_N1QKBeLzPgf7qD+#tunnGywt~8SodJrI zLznpDMssu`O#?`B!dj?DSvrA;1FpbnDTK1vpg456u-v!v!9Z~TBc)x>OWw`Vguj0y ze5KbsZjfqM873W}$qyS0h37@tCWowIE!e=GCRjY?IiSrUfd#6S2i+p)K}tKjdW|@u zh?1n)(ogV7TMl1Vkl!q===$nP)r#JM7i@yTIzd#v6rAu>_7&M?;b2tz9VYcf=HSKN z*2|+8%~CVuSkg+iNG#t0eyf$dXeH-7)R#!dFdL!DZ=S(+P2O2pUi#x|vQXLb5GWZp z_0#Q5{RB<@akaXkF7L z$lC1NQ(nYIF+~@+B3Zb%y!w~F0D%G$`54>Sl}x+oJ!Fq*bd4!xXZ;$;)`z@{A&@aG z01)|n*lnTasgqM241A1Dh@Xbi=%n%IX3I=Thk}VrD54dqBM@&H#|dk(9YWj^&ayC# z8KO%UP1^TU%OvIHN5EgTFGNnzJr{tAJLpqVQwwqWXKv@&7QQL6} z%NiM5lS%h{=p5iP7uK@Bz-J*4kO%dmI5o0dYGt{)8DK#ri8VkrtU++|<$u*V;xY^7 z0MsoG7|}HuoQc3>qygk;8J>D3&vAFYaBm?gDd>`g_JSs66Ag1gch8)a9y>`@*9z}}#Y24^Oc)~~9KhSrRb$PrFxPu(IVqE95hiN!>@Wz$w7 z+aMkgy`&*o>c@4OrZNmXxM#}wB9dSb2=FQ>oEf|KIncO9m*Q3x7OhxlB~hqfJ-sAf zYrNm$!z@SyrIrx(LJ(h;?IKte?E@gishK__IaA`#T)E`7?`9Y*FwQ;>4=^GrdOL|% zO!%9U4W4-r`UOTheHI*cdLo^%MB{ z$2XwdRx~1SEFMVlOh7h;hEcG>-TmGD-HXMbx zUZB>dd{Eue(BrU)*T*Kx1Gb>Ctz`Hyfa`YxS1`In=%eY8NA2hxUm$p3w)iak+TD9> zem*-m*xT9Ke;jgTWz;5G7IP%dgrTn6QV4l>BdyvBYFu(}iVvOcbp*qLVRLGuYy#z6 z7lA(vS77{tLuSvgh=tyt))jNXF&gVm1vdc(zL+%qom?1Efw`#dz)`SW!R3p)S>N(8?mOiT!)TpN(>QBS6lTq0k`+zWz;G|FwMN6I|3`q!O?}4#mR9b zKSZ9AKV8|Xs%{fJ)+~IuJb^IsGMmiWJc#_1jhh)3-X4M3C}OpQLKyZqSVFK_EV@Qy z<#wC}OzDlUCZA?a?$O=dzZIi4a7v8tyzDI87!3kqPLA5APJh}}`2}leE+ogbBp!oh zcvfu$;=%gEM_+&Q?Vta$vY;VRmB`_FVlI|FMQIcl!)YI#8Q3CLNr-e#t_K+R1hsTU zLg_2mV+nO7MuE{TsX*LD!jV7SG>QzmC#_89sOY2%q$#u|p!;G2Ur-hm8~{F&)b31U z99Xc+id6AjA2qoY#g)cyl;l#K-?P7n$5+&l##5xbe$j-+#1XmMY(NPB>&PI#5B&`i z=b|k;#=pAq@1!Q#_F+?o2EOf6QfsO>87pjXPWYTaqgAE&5;iS~u(6@&)jJ2MDj&Lv zo#ZcLFlS_(dR$%sgP@`G)nKt#PIxa1Qe$q&%sJF6JAH9Q_0;BHOBFrHaad<$S7EiL zK8iB5CyD7R)R;+$uhhq)N|VF(QZl~4W{TQaT5=%xlvZfp-n-|nN1289GP@6^@5mM{ zxZk4he7Gc+&Ro|zy|=QmVp9-t;+AV_b<;7t&Zd&|v$AzmqKus*ZV`uYg3?3NjSK_g z#O<(*rsm z0uV0Lu_;ofbuUCmfVVdRlhjK?ZNq#N&Qy3%8;L)08mJ3o~qU4TAQ`i)n+to1(BDl z$*O=yiEe!&NRlU zPPX<=vClVK&!7GG@s7_>9lyDAXZ6~osy1?vV71U-$WOSD6IK7rq&h+xGi8@ z(QNY0+BekdAoRi@3$EZYSF7$nyR-fM*5T>1-D4R}!6|`5r>4gKvt%tTnnADIcN%Pq zy#I_n9XNQ87#y_&Il$CA`X3l9R7C+xG*PCcm<=Y~>DARuG95?&0rW{2a8zT29a>uy zHr5~?DqLK(EYyTk1;N2K>1TSyOs@4km~Q6+$AsPm^j=!$h&|k)JlRZsUHiD(G&sTUcP8P0`lRmt*d^M%_cpW&XE+vtD zxHoMl3k=qU*_FD(=~+LcO8j-+-f*$08ePsWi+)AzI=PI*6sD=j3t~B;3%=5qT3q@U zC_`oOFkgo4a0T0Q;!@jaqe301q@fh@hL$pTNA{5T^vYS3zZwijv_ga7@^D1Ad%gU8 zI+p!EW)X_F;YVFuj}?c2C6+{pu@4_{a>S;+s|k6%2;okmm!UZLFqYCf)Qez+8U}!z5)BM9AR6lI_*0;hw*{{EF`+>21^Tc)ZAt!IPf5 zy}(mQub_<&e&mMIPF#Xx6S@wcwin5kxv|)2P|v7%TBbWLIR{n4X@`e1ZsUxZoB<(5 zDh&1h(tNO{@{bIz%?2bNZ(S~O|7z!ClQT$&5kSCjBx^ELX6Lqx_8`d8>21_y->yW< z$7{eA(G8(Six*LR>GGP869Q}RFsU{b==OXBUvIq+#h#ke2(2LD(Gwqiy3FBRXas5) zGESZ*(YV)bYJyf8ZjroQYu)Re?a4t;XRQRqm9Gxx9;j!W=`vpcUWx~#S{t`ZPInzttyWwm~OzT%bxPtN0l~^yw z8*@qBNpDkjJg^I{q#ssIvXkGwao@QDC_I=%5~U(##f==w$7k>fMO2nEArW5Yj(>unF}$s_<^mJn_7m} zHekQe7L%6nq^O7L?q@X;gR7XY6#=_xh}i_&RLALf!v^^vFv-^AtaMy@lY+uHvRx+q znvl*NU!oTfss;Uf{fUkeccvZVFFr3kv1|6-wE@MNpQx~5w&YKy700vL0tpl_B0oQT z0uMvd551I1JuQ`5tthowDphril*x1bzlt-r7C>U z*K^puRUPhu^@1+!y$&iakaBO_4a~}r4UP}SmOB;IQ>5Q#?=a{Yldu*h>4-fy*`(|C zv$F;CVmKMnEJXvIPdL{}9S`Wo+DLWH(&h^97==9BtPF;}G&a-C ziV=DP;1Fgo6AEq1O^BLzGMu#g1j|`mS`F(l;zgkE16czy)A1RyHzJ8l3C{P18ct4 z&22y(1cf5Ci_0RC$FVWrl%7Bq4sIB97B?L7MB*D@oiIPf5y#5ZAH8Pf#rm#Xx zC(}p1(S=$4|Ju9S-nMNZoX`0cnt-)V8@slftV5QjNM8mNXxgDbKMh#m*m7*lkqtXu z(QWB;Zt8p=30a#vb%mv6Kb-N^JHr@N^3Ly_5gC%*-#c zZgxV#Vv8be7g{hvFJ5_J6hSC77Om%ek38o|MNJ*a#k@pk&$IV0X}E=toT^7cE`!8l z)$49ri+O0^2WJGkTK61D5oaS|6ddBh_NIM%Y@P8AQN7t60rQ*DsGu?6hlgm?h>KTJ z{gCTVy^)9<=px7{B0A7xy?2IeJgeo9tR`lryM5>lX@w~h7ItlfQ|k8&<7U9Ktm=>8 z=$Hp?DgrMsBgo8mgr^6j+U2kw*YHQNR7%tRWxbeOFw#82j8J+!MTC}2~K20GUTd)oc*RbiTjaq-F{W>=uGHKE2OXgeePZJwg6*tSDH(1C%ik&QBKdEs zh_D*4)iIJba4%6jmNVc$PZ~Nhby1H-iz;5%wH}zYiCf5J4``jjAMC=6ZsKHQMvR>r zACr2}14q6ygXheSortO#+0jIa>h-WF79%a8{U<;m-Wb8=T5PaMqlR4`Y|B_fi#)Xa zG}Nqxi!D!<{(zOBA7&Qv8GE`4Y=RcG7Tx=iHLd;R-@vCLwBa^pSyzI(hd?yuvk($w zF(FmT6Gq}prd;fWmY!x0%EN5Zaq}sS1B`al)%>tz7HsN*wd#Wk)6yOGLgPO0MHnqVr$-60nEpUC4>TVwR7rVOPsfSyPyWQpR1k3oelS)K*P>JviRcb?D%>bx5|fQ& zy&l9uR&2s?R>LOTi8w7{LRQ@1VK4NH3=uCf~4&h0h8* zNfcB=T5BWmL@x$zRNRXQcg>g)8l>L~B`eujHcFSxJSUBJ8%eJMcQ4$BoXA>WzHt5z zMp6=>eO->g-|61@J~qSu)^0T#?Ql0!0oJszd6E*O zd}X}~&6JD5r|rD=jNs&b2sgyyn1@2b=>i$0S6>2~K~z5{^;2}IVQvw%uCj96ixwlB z6Uv*X_Uy7zuZXkmZA|SC6T_2$w@<`>RFtM|;p?|!8$fe)192gij^>mErYTq-opXds zQuButGQzxvKCGFw7R&i!a6Pb4HhxbY{cwlL^cu`)qb983dL35o~nSlond%# zGLsOnA9i?!2_!cBZP&G+z)>7Y(h2Ypz8|&GBqKT`SW%ky6W(ZUOz!Qeg8ZOitCN#8 z)57m+s&=#TY!vH&Wk0QUbL=5raKPM*{6CqS zK}gZUfwKLC@HcJ=(c1wg1KIq*dex%u?PFpC_z90QZ!8U{8D>1>Py-CM&YdR}DH}rT zDWErr=aSa4Qx-fQCGnV~6>Y~h%vtuZj1A($dC!jXdvAxKhM=k5aCxwe25fYz8h|%s z6|#Vp<|mGu)z;#XN%-*_)VX0jEvOfPc>hhgGCUUDRB6<(PFvzSi9LPhfUxH8if0?B z!q-GI+5H2&{Eo|)u?Mc)sg@xn0hL-G9LN5 z1iR{L;&2z8P~gvpjRjLJksuHoKL!IuxzN`Qr4*qN7V1cV6Xn*>gst|5JtB!%AcVx^ zBLP$ivbh5Nk zPPx={$%sqgR7z>Hf2iU-@i&yiJC|hMQo34S@zrq3rDia2p*fQ>;G0P)oO8L{7RvRV zmxWZ?oY^vP5-w~xe&X+3MO-~FLkE}QIhTX-;bJ&drHHg1dN7pSt5m9J%mNzsj2lTnu1#5(zjWHTl%t-BUpP|phwheKI>HbcSYrKJntN082LK3WMS z;~iwThs=ztw#K{Ie8Ja3 zKAhSHhyLy6<5u+o+n7M?)2k(L_H_Nm(_%KFADD(;USbwtX}_&mhrb{V?LRfHo@>Ks4$_~!ie#hd$hM%Nra938>`zWIayy=TW=EQh1tf40{#?tN4yJk}85G|Tp8lX2~Jx5e;!IjFzpe|YR;sw49UI0+5}*j~+w0pQwZ-tYaG zoiCPIzuSM>+28*eT~dw2W-|@|T#^?G_%oQb(sWpq7(W_!<>=nAKVB~p9Mx|2