From 92b3e7a7e14a1a4532d2d596b82478daa0cea3f9 Mon Sep 17 00:00:00 2001 From: Walter Schell Date: Sun, 30 Apr 2023 10:45:43 -0400 Subject: [PATCH] Removed 5.4.4 --- lua-5.4.4-tests/all.lua | 311 - lua-5.4.4-tests/api.lua | 1533 --- lua-5.4.4-tests/attrib.lua | 515 - lua-5.4.4-tests/big.lua | 82 - lua-5.4.4-tests/bitwise.lua | 351 - lua-5.4.4-tests/bwcoercion.lua | 78 - lua-5.4.4-tests/calls.lua | 481 - lua-5.4.4-tests/closure.lua | 270 - lua-5.4.4-tests/code.lua | 449 - lua-5.4.4-tests/constructs.lua | 377 - lua-5.4.4-tests/coroutine.lua | 1143 --- lua-5.4.4-tests/cstack.lua | 171 - lua-5.4.4-tests/db.lua | 1036 -- lua-5.4.4-tests/errors.lua | 661 -- lua-5.4.4-tests/events.lua | 488 - lua-5.4.4-tests/files.lua | 940 -- lua-5.4.4-tests/gc.lua | 691 -- lua-5.4.4-tests/gengc.lua | 172 - lua-5.4.4-tests/goto.lua | 271 - lua-5.4.4-tests/heavy.lua | 173 - lua-5.4.4-tests/libs/lib1.c | 44 - lua-5.4.4-tests/libs/lib11.c | 10 - lua-5.4.4-tests/libs/lib2.c | 23 - lua-5.4.4-tests/libs/lib21.c | 10 - lua-5.4.4-tests/libs/lib22.c | 25 - lua-5.4.4-tests/libs/makefile | 27 - lua-5.4.4-tests/literals.lua | 342 - lua-5.4.4-tests/locals.lua | 1137 --- lua-5.4.4-tests/ltests/ltests.c | 1977 ---- lua-5.4.4-tests/ltests/ltests.h | 144 - lua-5.4.4-tests/main.lua | 528 -- lua-5.4.4-tests/math.lua | 1024 -- lua-5.4.4-tests/nextvar.lua | 805 -- lua-5.4.4-tests/pm.lua | 421 - lua-5.4.4-tests/sort.lua | 310 - lua-5.4.4-tests/strings.lua | 518 - lua-5.4.4-tests/tpack.lua | 322 - lua-5.4.4-tests/tracegc.lua | 40 - lua-5.4.4-tests/utf8.lua | 247 - lua-5.4.4-tests/vararg.lua | 151 - lua-5.4.4-tests/verybig.lua | 152 - lua-5.4.4/CMakeLists.txt | 166 - lua-5.4.4/LuaConfig.cmake.in | 9 - lua-5.4.4/Makefile | 106 - lua-5.4.4/README | 6 - lua-5.4.4/doc/contents.html | 674 -- lua-5.4.4/doc/index.css | 21 - lua-5.4.4/doc/logo.gif | Bin 9893 -> 0 bytes lua-5.4.4/doc/lua.1 | 149 - lua-5.4.4/doc/lua.css | 161 - lua-5.4.4/doc/luac.1 | 118 - lua-5.4.4/doc/manual.css | 21 - lua-5.4.4/doc/manual.html | 11959 ------------------------ lua-5.4.4/doc/osi-certified-72x60.png | Bin 3774 -> 0 bytes lua-5.4.4/doc/readme.html | 340 - lua-5.4.4/include/lauxlib.h | 301 - lua-5.4.4/include/lua.h | 518 - lua-5.4.4/include/lua.hpp | 9 - lua-5.4.4/include/luaconf.h | 786 -- lua-5.4.4/include/lualib.h | 52 - lua-5.4.4/src/Makefile | 222 - lua-5.4.4/src/lapi.c | 1466 --- lua-5.4.4/src/lapi.h | 49 - lua-5.4.4/src/lauxlib.c | 1106 --- lua-5.4.4/src/lbaselib.c | 549 -- lua-5.4.4/src/lcode.c | 1832 ---- lua-5.4.4/src/lcode.h | 104 - lua-5.4.4/src/lcorolib.c | 210 - lua-5.4.4/src/lctype.c | 64 - lua-5.4.4/src/lctype.h | 101 - lua-5.4.4/src/ldblib.c | 483 - lua-5.4.4/src/ldebug.c | 918 -- lua-5.4.4/src/ldebug.h | 63 - lua-5.4.4/src/ldo.c | 997 -- lua-5.4.4/src/ldo.h | 79 - lua-5.4.4/src/ldump.c | 226 - lua-5.4.4/src/lfunc.c | 294 - lua-5.4.4/src/lfunc.h | 64 - lua-5.4.4/src/lgc.c | 1731 ---- lua-5.4.4/src/lgc.h | 199 - lua-5.4.4/src/linit.c | 65 - lua-5.4.4/src/liolib.c | 828 -- lua-5.4.4/src/ljumptab.h | 112 - lua-5.4.4/src/llex.c | 581 -- lua-5.4.4/src/llex.h | 91 - lua-5.4.4/src/llimits.h | 367 - lua-5.4.4/src/lmathlib.c | 764 -- lua-5.4.4/src/lmem.c | 201 - lua-5.4.4/src/lmem.h | 93 - lua-5.4.4/src/loadlib.c | 762 -- lua-5.4.4/src/lobject.c | 592 -- lua-5.4.4/src/lobject.h | 800 -- lua-5.4.4/src/lopcodes.c | 104 - lua-5.4.4/src/lopcodes.h | 405 - lua-5.4.4/src/lopnames.h | 103 - lua-5.4.4/src/loslib.c | 430 - lua-5.4.4/src/lparser.c | 1966 ---- lua-5.4.4/src/lparser.h | 171 - lua-5.4.4/src/lprefix.h | 45 - lua-5.4.4/src/lstate.c | 440 - lua-5.4.4/src/lstate.h | 404 - lua-5.4.4/src/lstring.c | 273 - lua-5.4.4/src/lstring.h | 57 - lua-5.4.4/src/lstrlib.c | 1874 ---- lua-5.4.4/src/ltable.c | 980 -- lua-5.4.4/src/ltable.h | 66 - lua-5.4.4/src/ltablib.c | 430 - lua-5.4.4/src/ltm.c | 271 - lua-5.4.4/src/ltm.h | 103 - lua-5.4.4/src/lua.c | 666 -- lua-5.4.4/src/luac.c | 725 -- lua-5.4.4/src/lundump.c | 333 - lua-5.4.4/src/lundump.h | 36 - lua-5.4.4/src/lutf8lib.c | 286 - lua-5.4.4/src/lvm.c | 1840 ---- lua-5.4.4/src/lvm.h | 136 - lua-5.4.4/src/lzio.c | 68 - lua-5.4.4/src/lzio.h | 66 - orig_sources/lua-5.4.4-tests.tar.gz | Bin 134094 -> 0 bytes orig_sources/lua-5.4.4.tar.gz | Bin 360876 -> 0 bytes 120 files changed, 62137 deletions(-) delete mode 100644 lua-5.4.4-tests/all.lua delete mode 100644 lua-5.4.4-tests/api.lua delete mode 100644 lua-5.4.4-tests/attrib.lua delete mode 100644 lua-5.4.4-tests/big.lua delete mode 100644 lua-5.4.4-tests/bitwise.lua delete mode 100644 lua-5.4.4-tests/bwcoercion.lua delete mode 100644 lua-5.4.4-tests/calls.lua delete mode 100644 lua-5.4.4-tests/closure.lua delete mode 100644 lua-5.4.4-tests/code.lua delete mode 100644 lua-5.4.4-tests/constructs.lua delete mode 100644 lua-5.4.4-tests/coroutine.lua delete mode 100644 lua-5.4.4-tests/cstack.lua delete mode 100644 lua-5.4.4-tests/db.lua delete mode 100644 lua-5.4.4-tests/errors.lua delete mode 100644 lua-5.4.4-tests/events.lua delete mode 100644 lua-5.4.4-tests/files.lua delete mode 100644 lua-5.4.4-tests/gc.lua delete mode 100644 lua-5.4.4-tests/gengc.lua delete mode 100644 lua-5.4.4-tests/goto.lua delete mode 100644 lua-5.4.4-tests/heavy.lua delete mode 100644 lua-5.4.4-tests/libs/lib1.c delete mode 100644 lua-5.4.4-tests/libs/lib11.c delete mode 100644 lua-5.4.4-tests/libs/lib2.c delete mode 100644 lua-5.4.4-tests/libs/lib21.c delete mode 100644 lua-5.4.4-tests/libs/lib22.c delete mode 100644 lua-5.4.4-tests/libs/makefile delete mode 100644 lua-5.4.4-tests/literals.lua delete mode 100644 lua-5.4.4-tests/locals.lua delete mode 100644 lua-5.4.4-tests/ltests/ltests.c delete mode 100644 lua-5.4.4-tests/ltests/ltests.h delete mode 100644 lua-5.4.4-tests/main.lua delete mode 100644 lua-5.4.4-tests/math.lua delete mode 100644 lua-5.4.4-tests/nextvar.lua delete mode 100644 lua-5.4.4-tests/pm.lua delete mode 100644 lua-5.4.4-tests/sort.lua delete mode 100644 lua-5.4.4-tests/strings.lua delete mode 100644 lua-5.4.4-tests/tpack.lua delete mode 100644 lua-5.4.4-tests/tracegc.lua delete mode 100644 lua-5.4.4-tests/utf8.lua delete mode 100644 lua-5.4.4-tests/vararg.lua delete mode 100644 lua-5.4.4-tests/verybig.lua delete mode 100644 lua-5.4.4/CMakeLists.txt delete mode 100644 lua-5.4.4/LuaConfig.cmake.in delete mode 100644 lua-5.4.4/Makefile delete mode 100644 lua-5.4.4/README delete mode 100644 lua-5.4.4/doc/contents.html delete mode 100644 lua-5.4.4/doc/index.css delete mode 100644 lua-5.4.4/doc/logo.gif delete mode 100644 lua-5.4.4/doc/lua.1 delete mode 100644 lua-5.4.4/doc/lua.css delete mode 100644 lua-5.4.4/doc/luac.1 delete mode 100644 lua-5.4.4/doc/manual.css delete mode 100644 lua-5.4.4/doc/manual.html delete mode 100644 lua-5.4.4/doc/osi-certified-72x60.png delete mode 100644 lua-5.4.4/doc/readme.html delete mode 100644 lua-5.4.4/include/lauxlib.h delete mode 100644 lua-5.4.4/include/lua.h delete mode 100644 lua-5.4.4/include/lua.hpp delete mode 100644 lua-5.4.4/include/luaconf.h delete mode 100644 lua-5.4.4/include/lualib.h delete mode 100644 lua-5.4.4/src/Makefile delete mode 100644 lua-5.4.4/src/lapi.c delete mode 100644 lua-5.4.4/src/lapi.h delete mode 100644 lua-5.4.4/src/lauxlib.c delete mode 100644 lua-5.4.4/src/lbaselib.c delete mode 100644 lua-5.4.4/src/lcode.c delete mode 100644 lua-5.4.4/src/lcode.h delete mode 100644 lua-5.4.4/src/lcorolib.c delete mode 100644 lua-5.4.4/src/lctype.c delete mode 100644 lua-5.4.4/src/lctype.h delete mode 100644 lua-5.4.4/src/ldblib.c delete mode 100644 lua-5.4.4/src/ldebug.c delete mode 100644 lua-5.4.4/src/ldebug.h delete mode 100644 lua-5.4.4/src/ldo.c delete mode 100644 lua-5.4.4/src/ldo.h delete mode 100644 lua-5.4.4/src/ldump.c delete mode 100644 lua-5.4.4/src/lfunc.c delete mode 100644 lua-5.4.4/src/lfunc.h delete mode 100644 lua-5.4.4/src/lgc.c delete mode 100644 lua-5.4.4/src/lgc.h delete mode 100644 lua-5.4.4/src/linit.c delete mode 100644 lua-5.4.4/src/liolib.c delete mode 100644 lua-5.4.4/src/ljumptab.h delete mode 100644 lua-5.4.4/src/llex.c delete mode 100644 lua-5.4.4/src/llex.h delete mode 100644 lua-5.4.4/src/llimits.h delete mode 100644 lua-5.4.4/src/lmathlib.c delete mode 100644 lua-5.4.4/src/lmem.c delete mode 100644 lua-5.4.4/src/lmem.h delete mode 100644 lua-5.4.4/src/loadlib.c delete mode 100644 lua-5.4.4/src/lobject.c delete mode 100644 lua-5.4.4/src/lobject.h delete mode 100644 lua-5.4.4/src/lopcodes.c delete mode 100644 lua-5.4.4/src/lopcodes.h delete mode 100644 lua-5.4.4/src/lopnames.h delete mode 100644 lua-5.4.4/src/loslib.c delete mode 100644 lua-5.4.4/src/lparser.c delete mode 100644 lua-5.4.4/src/lparser.h delete mode 100644 lua-5.4.4/src/lprefix.h delete mode 100644 lua-5.4.4/src/lstate.c delete mode 100644 lua-5.4.4/src/lstate.h delete mode 100644 lua-5.4.4/src/lstring.c delete mode 100644 lua-5.4.4/src/lstring.h delete mode 100644 lua-5.4.4/src/lstrlib.c delete mode 100644 lua-5.4.4/src/ltable.c delete mode 100644 lua-5.4.4/src/ltable.h delete mode 100644 lua-5.4.4/src/ltablib.c delete mode 100644 lua-5.4.4/src/ltm.c delete mode 100644 lua-5.4.4/src/ltm.h delete mode 100644 lua-5.4.4/src/lua.c delete mode 100644 lua-5.4.4/src/luac.c delete mode 100644 lua-5.4.4/src/lundump.c delete mode 100644 lua-5.4.4/src/lundump.h delete mode 100644 lua-5.4.4/src/lutf8lib.c delete mode 100644 lua-5.4.4/src/lvm.c delete mode 100644 lua-5.4.4/src/lvm.h delete mode 100644 lua-5.4.4/src/lzio.c delete mode 100644 lua-5.4.4/src/lzio.h delete mode 100644 orig_sources/lua-5.4.4-tests.tar.gz delete mode 100644 orig_sources/lua-5.4.4.tar.gz diff --git a/lua-5.4.4-tests/all.lua b/lua-5.4.4-tests/all.lua deleted file mode 100644 index a8e4402..0000000 --- a/lua-5.4.4-tests/all.lua +++ /dev/null @@ -1,311 +0,0 @@ -#!../lua --- $Id: testes/all.lua $ --- See Copyright Notice at the end of this file - - -local version = "Lua 5.4" -if _VERSION ~= version then - io.stderr:write("This test suite is for ", version, - ", not for ", _VERSION, "\nExiting tests") - return -end - - -_G.ARG = arg -- save arg for other tests - - --- next variables control the execution of some tests --- true means no test (so an undefined variable does not skip a test) --- defaults are for Linux; test everything. --- Make true to avoid long or memory consuming tests -_soft = rawget(_G, "_soft") or false --- Make true to avoid non-portable tests -_port = rawget(_G, "_port") or false --- Make true to avoid messages about tests not performed -_nomsg = rawget(_G, "_nomsg") or false - - -local usertests = rawget(_G, "_U") - -if usertests then - -- tests for sissies ;) Avoid problems - _soft = true - _port = true - _nomsg = true -end - --- tests should require debug when needed -debug = nil - - -if usertests then - T = nil -- no "internal" tests for user tests -else - T = rawget(_G, "T") -- avoid problems with 'strict' module -end - - ---[=[ - example of a long [comment], - [[spanning several [lines]]] - -]=] - -print("\n\tStarting Tests") - -do - -- set random seed - local random_x, random_y = math.randomseed() - print(string.format("random seeds: %d, %d", random_x, random_y)) -end - -print("current path:\n****" .. package.path .. "****\n") - - -local initclock = os.clock() -local lastclock = initclock -local walltime = os.time() - -local collectgarbage = collectgarbage - -do -- ( - --- track messages for tests not performed -local msgs = {} -function Message (m) - if not _nomsg then - print(m) - msgs[#msgs+1] = string.sub(m, 3, -3) - end -end - -assert(os.setlocale"C") - -local T,print,format,write,assert,type,unpack,floor = - T,print,string.format,io.write,assert,type,table.unpack,math.floor - --- use K for 1000 and M for 1000000 (not 2^10 -- 2^20) -local function F (m) - local function round (m) - m = m + 0.04999 - return format("%.1f", m) -- keep one decimal digit - end - if m < 1000 then return m - else - m = m / 1000 - if m < 1000 then return round(m).."K" - else - return round(m/1000).."M" - end - end -end - -local Cstacklevel - -local showmem -if not T then - local max = 0 - showmem = function () - local m = collectgarbage("count") * 1024 - max = (m > max) and m or max - print(format(" ---- total memory: %s, max memory: %s ----\n", - F(m), F(max))) - end - Cstacklevel = function () return 0 end -- no info about stack level -else - showmem = function () - T.checkmemory() - local total, numblocks, maxmem = T.totalmem() - local count = collectgarbage("count") - print(format( - "\n ---- total memory: %s (%.0fK), max use: %s, blocks: %d\n", - F(total), count, F(maxmem), numblocks)) - print(format("\t(strings: %d, tables: %d, functions: %d, ".. - "\n\tudata: %d, threads: %d)", - T.totalmem"string", T.totalmem"table", T.totalmem"function", - T.totalmem"userdata", T.totalmem"thread")) - end - - Cstacklevel = function () - local _, _, ncalls = T.stacklevel() - return ncalls -- number of C calls - end -end - - -local Cstack = Cstacklevel() - --- --- redefine dofile to run files through dump/undump --- -local function report (n) print("\n***** FILE '"..n.."'*****") end -local olddofile = dofile -local dofile = function (n, strip) - showmem() - local c = os.clock() - print(string.format("time: %g (+%g)", c - initclock, c - lastclock)) - lastclock = c - report(n) - local f = assert(loadfile(n)) - local b = string.dump(f, strip) - f = assert(load(b)) - return f() -end - -dofile('main.lua') - --- trace GC cycles -require"tracegc".start() - -report"gc.lua" -local f = assert(loadfile('gc.lua')) -f() - -dofile('db.lua') -assert(dofile('calls.lua') == deep and deep) -olddofile('strings.lua') -olddofile('literals.lua') -dofile('tpack.lua') -assert(dofile('attrib.lua') == 27) -dofile('gengc.lua') -assert(dofile('locals.lua') == 5) -dofile('constructs.lua') -dofile('code.lua', true) -if not _G._soft then - report('big.lua') - local f = coroutine.wrap(assert(loadfile('big.lua'))) - assert(f() == 'b') - assert(f() == 'a') -end -dofile('cstack.lua') -dofile('nextvar.lua') -dofile('pm.lua') -dofile('utf8.lua') -dofile('api.lua') -assert(dofile('events.lua') == 12) -dofile('vararg.lua') -dofile('closure.lua') -dofile('coroutine.lua') -dofile('goto.lua', true) -dofile('errors.lua') -dofile('math.lua') -dofile('sort.lua', true) -dofile('bitwise.lua') -assert(dofile('verybig.lua', true) == 10); collectgarbage() -dofile('files.lua') - -if #msgs > 0 then - local m = table.concat(msgs, "\n ") - warn("#tests not performed:\n ", m, "\n") -end - -print("(there should be two warnings now)") -warn("@on") -warn("#This is ", "an expected", " warning") -warn("@off") -warn("******** THIS WARNING SHOULD NOT APPEAR **********") -warn("******** THIS WARNING ALSO SHOULD NOT APPEAR **********") -warn("@on") -warn("#This is", " another one") - --- no test module should define 'debug' -assert(debug == nil) - -local debug = require "debug" - -print(string.format("%d-bit integers, %d-bit floats", - string.packsize("j") * 8, string.packsize("n") * 8)) - -debug.sethook(function (a) assert(type(a) == 'string') end, "cr") - --- to survive outside block -_G.showmem = showmem - - -assert(Cstack == Cstacklevel(), - "should be at the same C-stack level it was when started the tests") - -end --) - -local _G, showmem, print, format, clock, time, difftime, - assert, open, warn = - _G, showmem, print, string.format, os.clock, os.time, os.difftime, - assert, io.open, warn - --- file with time of last performed test -local fname = T and "time-debug.txt" or "time.txt" -local lasttime - -if not usertests then - -- open file with time of last performed test - local f = io.open(fname) - if f then - lasttime = assert(tonumber(f:read'a')) - f:close(); - else -- no such file; assume it is recording time for first time - lasttime = nil - end -end - --- erase (almost) all globals -print('cleaning all!!!!') -for n in pairs(_G) do - if not ({___Glob = 1, tostring = 1})[n] then - _G[n] = undef - end -end - - -collectgarbage() -collectgarbage() -collectgarbage() -collectgarbage() -collectgarbage() -collectgarbage();showmem() - -local clocktime = clock() - initclock -walltime = difftime(time(), walltime) - -print(format("\n\ntotal time: %.2fs (wall time: %gs)\n", clocktime, walltime)) - -if not usertests then - lasttime = lasttime or clocktime -- if no last time, ignore difference - -- check whether current test time differs more than 5% from last time - local diff = (clocktime - lasttime) / lasttime - local tolerance = 0.05 -- 5% - if (diff >= tolerance or diff <= -tolerance) then - warn(format("#time difference from previous test: %+.1f%%", - diff * 100)) - end - assert(open(fname, "w")):write(clocktime):close() -end - -print("final OK !!!") - - - ---[[ -***************************************************************************** -* Copyright (C) 1994-2016 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. -***************************************************************************** -]] - diff --git a/lua-5.4.4-tests/api.lua b/lua-5.4.4-tests/api.lua deleted file mode 100644 index bd85a92..0000000 --- a/lua-5.4.4-tests/api.lua +++ /dev/null @@ -1,1533 +0,0 @@ --- $Id: testes/api.lua $ --- See Copyright Notice in file all.lua - -if T==nil then - (Message or print)('\n >>> testC not active: skipping API tests <<<\n') - return -end - -local debug = require "debug" - -local pack = table.pack - - --- standard error message for memory errors -local MEMERRMSG = "not enough memory" - -function tcheck (t1, t2) - assert(t1.n == (t2.n or #t2) + 1) - for i = 2, t1.n do assert(t1[i] == t2[i - 1]) end -end - - -local function checkerr (msg, f, ...) - local stat, err = pcall(f, ...) - assert(not stat and string.find(err, msg)) -end - - -print('testing C API') - -a = T.testC("pushvalue R; return 1") -assert(a == debug.getregistry()) - - --- absindex -assert(T.testC("settop 10; absindex -1; return 1") == 10) -assert(T.testC("settop 5; absindex -5; return 1") == 1) -assert(T.testC("settop 10; absindex 1; return 1") == 1) -assert(T.testC("settop 10; absindex R; return 1") < -10) - --- testing alignment -a = T.d2s(12458954321123.0) -assert(a == string.pack("d", 12458954321123.0)) -assert(T.s2d(a) == 12458954321123.0) - -a,b,c = T.testC("pushnum 1; pushnum 2; pushnum 3; return 2") -assert(a == 2 and b == 3 and not c) - -f = T.makeCfunc("pushnum 1; pushnum 2; pushnum 3; return 2") -a,b,c = f() -assert(a == 2 and b == 3 and not c) - --- test that all trues are equal -a,b,c = T.testC("pushbool 1; pushbool 2; pushbool 0; return 3") -assert(a == b and a == true and c == false) -a,b,c = T.testC"pushbool 0; pushbool 10; pushnil;\ - tobool -3; tobool -3; tobool -3; return 3" -assert(a==false and b==true and c==false) - - -a,b,c = T.testC("gettop; return 2", 10, 20, 30, 40) -assert(a == 40 and b == 5 and not c) - -t = pack(T.testC("settop 5; return *", 2, 3)) -tcheck(t, {n=4,2,3}) - -t = pack(T.testC("settop 0; settop 15; return 10", 3, 1, 23)) -assert(t.n == 10 and t[1] == nil and t[10] == nil) - -t = pack(T.testC("remove -2; return *", 2, 3, 4)) -tcheck(t, {n=2,2,4}) - -t = pack(T.testC("insert -1; return *", 2, 3)) -tcheck(t, {n=2,2,3}) - -t = pack(T.testC("insert 3; return *", 2, 3, 4, 5)) -tcheck(t, {n=4,2,5,3,4}) - -t = pack(T.testC("replace 2; return *", 2, 3, 4, 5)) -tcheck(t, {n=3,5,3,4}) - -t = pack(T.testC("replace -2; return *", 2, 3, 4, 5)) -tcheck(t, {n=3,2,3,5}) - -t = pack(T.testC("remove 3; return *", 2, 3, 4, 5)) -tcheck(t, {n=3,2,4,5}) - -t = pack(T.testC("copy 3 4; return *", 2, 3, 4, 5)) -tcheck(t, {n=4,2,3,3,5}) - -t = pack(T.testC("copy -3 -1; return *", 2, 3, 4, 5)) -tcheck(t, {n=4,2,3,4,3}) - -do -- testing 'rotate' - local t = {10, 20, 30, 40, 50, 60} - for i = -6, 6 do - local s = string.format("rotate 2 %d; return 7", i) - local t1 = pack(T.testC(s, 10, 20, 30, 40, 50, 60)) - tcheck(t1, t) - table.insert(t, 1, table.remove(t)) - end - - t = pack(T.testC("rotate -2 1; return *", 10, 20, 30, 40)) - tcheck(t, {10, 20, 40, 30}) - t = pack(T.testC("rotate -2 -1; return *", 10, 20, 30, 40)) - tcheck(t, {10, 20, 40, 30}) - - -- some corner cases - t = pack(T.testC("rotate -1 0; return *", 10, 20, 30, 40)) - tcheck(t, {10, 20, 30, 40}) - t = pack(T.testC("rotate -1 1; return *", 10, 20, 30, 40)) - tcheck(t, {10, 20, 30, 40}) - t = pack(T.testC("rotate 5 -1; return *", 10, 20, 30, 40)) - tcheck(t, {10, 20, 30, 40}) -end - - --- testing warnings -T.testC([[ - warningC "#This shold be a" - warningC " single " - warning "warning" - warningC "#This should be " - warning "another one" -]]) - - --- testing message handlers -do - local f = T.makeCfunc[[ - getglobal error - pushstring bola - pcall 1 1 1 # call 'error' with given handler - pushstatus - return 2 # return error message and status - ]] - - local msg, st = f(string.upper) -- function handler - assert(st == "ERRRUN" and msg == "BOLA") - local msg, st = f(string.len) -- function handler - assert(st == "ERRRUN" and msg == 4) - -end - -t = pack(T.testC("insert 3; pushvalue 3; remove 3; pushvalue 2; remove 2; \ - insert 2; pushvalue 1; remove 1; insert 1; \ - insert -2; pushvalue -2; remove -3; return *", - 2, 3, 4, 5, 10, 40, 90)) -tcheck(t, {n=7,2,3,4,5,10,40,90}) - -t = pack(T.testC("concat 5; return *", "alo", 2, 3, "joao", 12)) -tcheck(t, {n=1,"alo23joao12"}) - --- testing MULTRET -t = pack(T.testC("call 2,-1; return *", - function (a,b) return 1,2,3,4,a,b end, "alo", "joao")) -tcheck(t, {n=6,1,2,3,4,"alo", "joao"}) - -do -- test returning more results than fit in the caller stack - local a = {} - for i=1,1000 do a[i] = true end; a[999] = 10 - local b = T.testC([[pcall 1 -1 0; pop 1; tostring -1; return 1]], - table.unpack, a) - assert(b == "10") -end - - --- testing globals -_G.a = 14; _G.b = "a31" -local a = {T.testC[[ - getglobal a; - getglobal b; - getglobal b; - setglobal a; - return * -]]} -assert(a[2] == 14 and a[3] == "a31" and a[4] == nil and _G.a == "a31") - - --- testing arith -assert(T.testC("pushnum 10; pushnum 20; arith /; return 1") == 0.5) -assert(T.testC("pushnum 10; pushnum 20; arith -; return 1") == -10) -assert(T.testC("pushnum 10; pushnum -20; arith *; return 1") == -200) -assert(T.testC("pushnum 10; pushnum 3; arith ^; return 1") == 1000) -assert(T.testC("pushnum 10; pushstring 20; arith /; return 1") == 0.5) -assert(T.testC("pushstring 10; pushnum 20; arith -; return 1") == -10) -assert(T.testC("pushstring 10; pushstring -20; arith *; return 1") == -200) -assert(T.testC("pushstring 10; pushstring 3; arith ^; return 1") == 1000) -assert(T.testC("arith /; return 1", 2, 0) == 10.0/0) -a = T.testC("pushnum 10; pushint 3; arith \\; return 1") -assert(a == 3.0 and math.type(a) == "float") -a = T.testC("pushint 10; pushint 3; arith \\; return 1") -assert(a == 3 and math.type(a) == "integer") -a = assert(T.testC("pushint 10; pushint 3; arith +; return 1")) -assert(a == 13 and math.type(a) == "integer") -a = assert(T.testC("pushnum 10; pushint 3; arith +; return 1")) -assert(a == 13 and math.type(a) == "float") -a,b,c = T.testC([[pushnum 1; - pushstring 10; arith _; - pushstring 5; return 3]]) -assert(a == 1 and b == -10 and c == "5") -mt = {__add = function (a,b) return setmetatable({a[1] + b[1]}, mt) end, - __mod = function (a,b) return setmetatable({a[1] % b[1]}, mt) end, - __unm = function (a) return setmetatable({a[1]* 2}, mt) end} -a,b,c = setmetatable({4}, mt), - setmetatable({8}, mt), - setmetatable({-3}, mt) -x,y,z = T.testC("arith +; return 2", 10, a, b) -assert(x == 10 and y[1] == 12 and z == nil) -assert(T.testC("arith %; return 1", a, c)[1] == 4%-3) -assert(T.testC("arith _; arith +; arith %; return 1", b, a, c)[1] == - 8 % (4 + (-3)*2)) - --- errors in arithmetic -checkerr("divide by zero", T.testC, "arith \\", 10, 0) -checkerr("%%0", T.testC, "arith %", 10, 0) - - --- testing lessthan and lessequal -assert(T.testC("compare LT 2 5, return 1", 3, 2, 2, 4, 2, 2)) -assert(T.testC("compare LE 2 5, return 1", 3, 2, 2, 4, 2, 2)) -assert(not T.testC("compare LT 3 4, return 1", 3, 2, 2, 4, 2, 2)) -assert(T.testC("compare LE 3 4, return 1", 3, 2, 2, 4, 2, 2)) -assert(T.testC("compare LT 5 2, return 1", 4, 2, 2, 3, 2, 2)) -assert(not T.testC("compare LT 2 -3, return 1", "4", "2", "2", "3", "2", "2")) -assert(not T.testC("compare LT -3 2, return 1", "3", "2", "2", "4", "2", "2")) - --- non-valid indices produce false -assert(not T.testC("compare LT 1 4, return 1")) -assert(not T.testC("compare LE 9 1, return 1")) -assert(not T.testC("compare EQ 9 9, return 1")) - -local b = {__lt = function (a,b) return a[1] < b[1] end} -local a1,a3,a4 = setmetatable({1}, b), - setmetatable({3}, b), - setmetatable({4}, b) -assert(T.testC("compare LT 2 5, return 1", a3, 2, 2, a4, 2, 2)) -assert(T.testC("compare LE 2 5, return 1", a3, 2, 2, a4, 2, 2)) -assert(T.testC("compare LT 5 -6, return 1", a4, 2, 2, a3, 2, 2)) -a,b = T.testC("compare LT 5 -6, return 2", a1, 2, 2, a3, 2, 20) -assert(a == 20 and b == false) -a,b = T.testC("compare LE 5 -6, return 2", a1, 2, 2, a3, 2, 20) -assert(a == 20 and b == false) -a,b = T.testC("compare LE 5 -6, return 2", a1, 2, 2, a1, 2, 20) -assert(a == 20 and b == true) - - -do -- testing lessthan and lessequal with metamethods - local mt = {__lt = function (a,b) return a[1] < b[1] end, - __le = function (a,b) return a[1] <= b[1] end, - __eq = function (a,b) return a[1] == b[1] end} - local function O (x) - return setmetatable({x}, mt) - end - - local a, b = T.testC("compare LT 2 3; pushint 10; return 2", O(1), O(2)) - assert(a == true and b == 10) - local a, b = T.testC("compare LE 2 3; pushint 10; return 2", O(3), O(2)) - assert(a == false and b == 10) - local a, b = T.testC("compare EQ 2 3; pushint 10; return 2", O(3), O(3)) - assert(a == true and b == 10) -end - --- testing length -local t = setmetatable({x = 20}, {__len = function (t) return t.x end}) -a,b,c = T.testC([[ - len 2; - Llen 2; - objsize 2; - return 3 -]], t) -assert(a == 20 and b == 20 and c == 0) - -t.x = "234"; t[1] = 20 -a,b,c = T.testC([[ - len 2; - Llen 2; - objsize 2; - return 3 -]], t) -assert(a == "234" and b == 234 and c == 1) - -t.x = print; t[1] = 20 -a,c = T.testC([[ - len 2; - objsize 2; - return 2 -]], t) -assert(a == print and c == 1) - - --- testing __concat - -a = setmetatable({x="u"}, {__concat = function (a,b) return a.x..'.'..b.x end}) -x,y = T.testC([[ - pushnum 5 - pushvalue 2; - pushvalue 2; - concat 2; - pushvalue -2; - return 2; -]], a, a) -assert(x == a..a and y == 5) - --- concat with 0 elements -assert(T.testC("concat 0; return 1") == "") - --- concat with 1 element -assert(T.testC("concat 1; return 1", "xuxu") == "xuxu") - - - --- testing lua_is - -function B(x) return x and 1 or 0 end - -function count (x, n) - n = n or 2 - local prog = [[ - isnumber %d; - isstring %d; - isfunction %d; - iscfunction %d; - istable %d; - isuserdata %d; - isnil %d; - isnull %d; - return 8 - ]] - prog = string.format(prog, n, n, n, n, n, n, n, n) - local a,b,c,d,e,f,g,h = T.testC(prog, x) - return B(a)+B(b)+B(c)+B(d)+B(e)+B(f)+B(g)+(100*B(h)) -end - -assert(count(3) == 2) -assert(count('alo') == 1) -assert(count('32') == 2) -assert(count({}) == 1) -assert(count(print) == 2) -assert(count(function () end) == 1) -assert(count(nil) == 1) -assert(count(io.stdin) == 1) -assert(count(nil, 15) == 100) - - --- testing lua_to... - -function to (s, x, n) - n = n or 2 - return T.testC(string.format("%s %d; return 1", s, n), x) -end - -local null = T.pushuserdata(0) -local hfunc = string.gmatch("", "") -- a "heavy C function" (with upvalues) -assert(debug.getupvalue(hfunc, 1)) -assert(to("tostring", {}) == nil) -assert(to("tostring", "alo") == "alo") -assert(to("tostring", 12) == "12") -assert(to("tostring", 12, 3) == nil) -assert(to("objsize", {}) == 0) -assert(to("objsize", {1,2,3}) == 3) -assert(to("objsize", "alo\0\0a") == 6) -assert(to("objsize", T.newuserdata(0)) == 0) -assert(to("objsize", T.newuserdata(101)) == 101) -assert(to("objsize", 124) == 0) -assert(to("objsize", true) == 0) -assert(to("tonumber", {}) == 0) -assert(to("tonumber", "12") == 12) -assert(to("tonumber", "s2") == 0) -assert(to("tonumber", 1, 20) == 0) -assert(to("topointer", 10) == null) -assert(to("topointer", true) == null) -assert(to("topointer", nil) == null) -assert(to("topointer", "abc") ~= null) -assert(to("topointer", string.rep("x", 10)) == - to("topointer", string.rep("x", 10))) -- short strings -do -- long strings - local s1 = string.rep("x", 300) - local s2 = string.rep("x", 300) - assert(to("topointer", s1) ~= to("topointer", s2)) -end -assert(to("topointer", T.pushuserdata(20)) ~= null) -assert(to("topointer", io.read) ~= null) -- light C function -assert(to("topointer", hfunc) ~= null) -- "heavy" C function -assert(to("topointer", function () end) ~= null) -- Lua function -assert(to("topointer", io.stdin) ~= null) -- full userdata -assert(to("func2num", 20) == 0) -assert(to("func2num", T.pushuserdata(10)) == 0) -assert(to("func2num", io.read) ~= 0) -- light C function -assert(to("func2num", hfunc) ~= 0) -- "heavy" C function (with upvalue) -a = to("tocfunction", math.deg) -assert(a(3) == math.deg(3) and a == math.deg) - - -print("testing panic function") -do - -- trivial error - assert(T.checkpanic("pushstring hi; error") == "hi") - - -- using the stack inside panic - assert(T.checkpanic("pushstring hi; error;", - [[checkstack 5 XX - pushstring ' alo' - pushstring ' mundo' - concat 3]]) == "hi alo mundo") - - -- "argerror" without frames - assert(T.checkpanic("loadstring 4") == - "bad argument #4 (string expected, got no value)") - - - -- memory error - T.totalmem(T.totalmem()+10000) -- set low memory limit (+10k) - assert(T.checkpanic("newuserdata 20000") == MEMERRMSG) - T.totalmem(0) -- restore high limit - - -- stack error - if not _soft then - local msg = T.checkpanic[[ - pushstring "function f() f() end" - loadstring -1; call 0 0 - getglobal f; call 0 0 - ]] - assert(string.find(msg, "stack overflow")) - end - - -- exit in panic still close to-be-closed variables - assert(T.checkpanic([[ - pushstring "return {__close = function () Y = 'ho'; end}" - newtable - loadstring -2 - call 0 1 - setmetatable -2 - toclose -1 - pushstring "hi" - error - ]], - [[ - getglobal Y - concat 2 # concat original error with global Y - ]]) == "hiho") - - -end - --- testing deep C stack -if not _soft then - print("testing stack overflow") - collectgarbage("stop") - checkerr("XXXX", T.testC, "checkstack 1000023 XXXX") -- too deep - -- too deep (with no message) - checkerr("^stack overflow$", T.testC, "checkstack 1000023 ''") - local s = string.rep("pushnil;checkstack 1 XX;", 1000000) - checkerr("overflow", T.testC, s) - collectgarbage("restart") - print'+' -end - -local lim = _soft and 500 or 12000 -local prog = {"checkstack " .. (lim * 2 + 100) .. "msg", "newtable"} -for i = 1,lim do - prog[#prog + 1] = "pushnum " .. i - prog[#prog + 1] = "pushnum " .. i * 10 -end - -prog[#prog + 1] = "rawgeti R 2" -- get global table in registry -prog[#prog + 1] = "insert " .. -(2*lim + 2) - -for i = 1,lim do - prog[#prog + 1] = "settable " .. -(2*(lim - i + 1) + 1) -end - -prog[#prog + 1] = "return 2" - -prog = table.concat(prog, ";") -local g, t = T.testC(prog) -assert(g == _G) -for i = 1,lim do assert(t[i] == i*10); t[i] = undef end -assert(next(t) == nil) -prog, g, t = nil - --- testing errors - -a = T.testC([[ - loadstring 2; pcall 0 1 0; - pushvalue 3; insert -2; pcall 1 1 0; - pcall 0 0 0; - return 1 -]], "x=150", function (a) assert(a==nil); return 3 end) - -assert(type(a) == 'string' and x == 150) - -function check3(p, ...) - local arg = {...} - assert(#arg == 3) - assert(string.find(arg[3], p)) -end -check3(":1:", T.testC("loadstring 2; return *", "x=")) -check3("%.", T.testC("loadfile 2; return *", ".")) -check3("xxxx", T.testC("loadfile 2; return *", "xxxx")) - --- test errors in non protected threads -function checkerrnopro (code, msg) - local th = coroutine.create(function () end) -- create new thread - local stt, err = pcall(T.testC, th, code) -- run code there - assert(not stt and string.find(err, msg)) -end - -if not _soft then - collectgarbage("stop") -- avoid __gc with full stack - checkerrnopro("pushnum 3; call 0 0", "attempt to call") - print"testing stack overflow in unprotected thread" - function f () f() end - checkerrnopro("getglobal 'f'; call 0 0;", "stack overflow") - collectgarbage("restart") -end -print"+" - - --- testing table access - -do -- getp/setp - local a = {} - local a1 = T.testC("rawsetp 2 1; return 1", a, 20) - assert(a == a1) - assert(a[T.pushuserdata(1)] == 20) - local a1, res = T.testC("rawgetp -1 1; return 2", a) - assert(a == a1 and res == 20) -end - - -do -- using the table itself as index - local a = {} - a[a] = 10 - local prog = "gettable -1; return *" - local res = {T.testC(prog, a)} - assert(#res == 2 and res[1] == prog and res[2] == 10) - - local prog = "settable -2; return *" - local res = {T.testC(prog, a, 20)} - assert(a[a] == 20) - assert(#res == 1 and res[1] == prog) - - -- raw - a[a] = 10 - local prog = "rawget -1; return *" - local res = {T.testC(prog, a)} - assert(#res == 2 and res[1] == prog and res[2] == 10) - - local prog = "rawset -2; return *" - local res = {T.testC(prog, a, 20)} - assert(a[a] == 20) - assert(#res == 1 and res[1] == prog) - - -- using the table as the value to set - local prog = "rawset -1; return *" - local res = {T.testC(prog, 30, a)} - assert(a[30] == a) - assert(#res == 1 and res[1] == prog) - - local prog = "settable -1; return *" - local res = {T.testC(prog, 40, a)} - assert(a[40] == a) - assert(#res == 1 and res[1] == prog) - - local prog = "rawseti -1 100; return *" - local res = {T.testC(prog, a)} - assert(a[100] == a) - assert(#res == 1 and res[1] == prog) - - local prog = "seti -1 200; return *" - local res = {T.testC(prog, a)} - assert(a[200] == a) - assert(#res == 1 and res[1] == prog) -end - -a = {x=0, y=12} -x, y = T.testC("gettable 2; pushvalue 4; gettable 2; return 2", - a, 3, "y", 4, "x") -assert(x == 0 and y == 12) -T.testC("settable -5", a, 3, 4, "x", 15) -assert(a.x == 15) -a[a] = print -x = T.testC("gettable 2; return 1", a) -- table and key are the same object! -assert(x == print) -T.testC("settable 2", a, "x") -- table and key are the same object! -assert(a[a] == "x") - -b = setmetatable({p = a}, {}) -getmetatable(b).__index = function (t, i) return t.p[i] end -k, x = T.testC("gettable 3, return 2", 4, b, 20, 35, "x") -assert(x == 15 and k == 35) -k = T.testC("getfield 2 y, return 1", b) -assert(k == 12) -getmetatable(b).__index = function (t, i) return a[i] end -getmetatable(b).__newindex = function (t, i,v ) a[i] = v end -y = T.testC("insert 2; gettable -5; return 1", 2, 3, 4, "y", b) -assert(y == 12) -k = T.testC("settable -5, return 1", b, 3, 4, "x", 16) -assert(a.x == 16 and k == 4) -a[b] = 'xuxu' -y = T.testC("gettable 2, return 1", b) -assert(y == 'xuxu') -T.testC("settable 2", b, 19) -assert(a[b] == 19) - --- -do -- testing getfield/setfield with long keys - local t = {_012345678901234567890123456789012345678901234567890123456789 = 32} - local a = T.testC([[ - getfield 2 _012345678901234567890123456789012345678901234567890123456789 - return 1 - ]], t) - assert(a == 32) - local a = T.testC([[ - pushnum 33 - setglobal _012345678901234567890123456789012345678901234567890123456789 - ]]) - assert(_012345678901234567890123456789012345678901234567890123456789 == 33) - _012345678901234567890123456789012345678901234567890123456789 = nil -end - --- testing next -a = {} -t = pack(T.testC("next; return *", a, nil)) -tcheck(t, {n=1,a}) -a = {a=3} -t = pack(T.testC("next; return *", a, nil)) -tcheck(t, {n=3,a,'a',3}) -t = pack(T.testC("next; pop 1; next; return *", a, nil)) -tcheck(t, {n=1,a}) - - - --- testing upvalues - -do - local A = T.testC[[ pushnum 10; pushnum 20; pushcclosure 2; return 1]] - t, b, c = A([[pushvalue U0; pushvalue U1; pushvalue U2; return 3]]) - assert(b == 10 and c == 20 and type(t) == 'table') - a, b = A([[tostring U3; tonumber U4; return 2]]) - assert(a == nil and b == 0) - A([[pushnum 100; pushnum 200; replace U2; replace U1]]) - b, c = A([[pushvalue U1; pushvalue U2; return 2]]) - assert(b == 100 and c == 200) - A([[replace U2; replace U1]], {x=1}, {x=2}) - b, c = A([[pushvalue U1; pushvalue U2; return 2]]) - assert(b.x == 1 and c.x == 2) - T.checkmemory() -end - - --- testing absent upvalues from C-function pointers -assert(T.testC[[isnull U1; return 1]] == true) -assert(T.testC[[isnull U100; return 1]] == true) -assert(T.testC[[pushvalue U1; return 1]] == nil) - -local f = T.testC[[ pushnum 10; pushnum 20; pushcclosure 2; return 1]] -assert(T.upvalue(f, 1) == 10 and - T.upvalue(f, 2) == 20 and - T.upvalue(f, 3) == nil) -T.upvalue(f, 2, "xuxu") -assert(T.upvalue(f, 2) == "xuxu") - - --- large closures -do - local A = "checkstack 300 msg;" .. - string.rep("pushnum 10;", 255) .. - "pushcclosure 255; return 1" - A = T.testC(A) - for i=1,255 do - assert(A(("pushvalue U%d; return 1"):format(i)) == 10) - end - assert(A("isnull U256; return 1")) - assert(not A("isnil U256; return 1")) -end - - - --- testing get/setuservalue --- bug in 5.1.2 -checkerr("got number", debug.setuservalue, 3, {}) -checkerr("got nil", debug.setuservalue, nil, {}) -checkerr("got light userdata", debug.setuservalue, T.pushuserdata(1), {}) - --- testing multiple user values -local b = T.newuserdata(0, 10) -for i = 1, 10 do - local v, p = debug.getuservalue(b, i) - assert(v == nil and p) -end -do -- indices out of range - local v, p = debug.getuservalue(b, -2) - assert(v == nil and not p) - local v, p = debug.getuservalue(b, 11) - assert(v == nil and not p) -end -local t = {true, false, 4.56, print, {}, b, "XYZ"} -for k, v in ipairs(t) do - debug.setuservalue(b, v, k) -end -for k, v in ipairs(t) do - local v1, p = debug.getuservalue(b, k) - assert(v1 == v and p) -end - -assert(not debug.getuservalue(4)) - -debug.setuservalue(b, function () return 10 end, 10) -collectgarbage() -- function should not be collected -assert(debug.getuservalue(b, 10)() == 10) - -debug.setuservalue(b, 134) -collectgarbage() -- number should not be a problem for collector -assert(debug.getuservalue(b) == 134) - - --- test barrier for uservalues -do - local oldmode = collectgarbage("incremental") - T.gcstate("atomic") - assert(T.gccolor(b) == "black") - debug.setuservalue(b, {x = 100}) - T.gcstate("pause") -- complete collection - assert(debug.getuservalue(b).x == 100) -- uvalue should be there - collectgarbage(oldmode) -end - --- long chain of userdata -for i = 1, 1000 do - local bb = T.newuserdata(0, 1) - debug.setuservalue(bb, b) - b = bb -end -collectgarbage() -- nothing should not be collected -for i = 1, 1000 do - b = debug.getuservalue(b) -end -assert(debug.getuservalue(b).x == 100) -b = nil - - --- testing locks (refs) - --- reuse of references -local i = T.ref{} -T.unref(i) -assert(T.ref{} == i) - -Arr = {} -Lim = 100 -for i=1,Lim do -- lock many objects - Arr[i] = T.ref({}) -end - -assert(T.ref(nil) == -1 and T.getref(-1) == nil) -T.unref(-1); T.unref(-1) - -for i=1,Lim do -- unlock all them - T.unref(Arr[i]) -end - -function printlocks () - local f = T.makeCfunc("gettable R; return 1") - local n = f("n") - print("n", n) - for i=0,n do - print(i, f(i)) - end -end - - -for i=1,Lim do -- lock many objects - Arr[i] = T.ref({}) -end - -for i=1,Lim,2 do -- unlock half of them - T.unref(Arr[i]) -end - -assert(type(T.getref(Arr[2])) == 'table') - - -assert(T.getref(-1) == nil) - - -a = T.ref({}) - -collectgarbage() - -assert(type(T.getref(a)) == 'table') - - --- colect in cl the `val' of all collected userdata -tt = {} -cl = {n=0} -A = nil; B = nil -local F -F = function (x) - local udval = T.udataval(x) - table.insert(cl, udval) - local d = T.newuserdata(100) -- create garbage - d = nil - assert(debug.getmetatable(x).__gc == F) - assert(load("table.insert({}, {})"))() -- create more garbage - assert(not collectgarbage()) -- GC during GC (no op) - local dummy = {} -- create more garbage during GC - if A ~= nil then - assert(type(A) == "userdata") - assert(T.udataval(A) == B) - debug.getmetatable(A) -- just access it - end - A = x -- ressurect userdata - B = udval - return 1,2,3 -end -tt.__gc = F - --- test whether udate collection frees memory in the right time -do - collectgarbage(); - collectgarbage(); - local x = collectgarbage("count"); - local a = T.newuserdata(5001) - assert(T.testC("objsize 2; return 1", a) == 5001) - assert(collectgarbage("count") >= x+4) - a = nil - collectgarbage(); - assert(collectgarbage("count") <= x+1) - -- udata without finalizer - x = collectgarbage("count") - collectgarbage("stop") - for i=1,1000 do T.newuserdata(0) end - assert(collectgarbage("count") > x+10) - collectgarbage() - assert(collectgarbage("count") <= x+1) - -- udata with finalizer - collectgarbage() - x = collectgarbage("count") - collectgarbage("stop") - a = {__gc = function () end} - for i=1,1000 do debug.setmetatable(T.newuserdata(0), a) end - assert(collectgarbage("count") >= x+10) - collectgarbage() -- this collection only calls TM, without freeing memory - assert(collectgarbage("count") >= x+10) - collectgarbage() -- now frees memory - assert(collectgarbage("count") <= x+1) - collectgarbage("restart") -end - - -collectgarbage("stop") - --- create 3 userdatas with tag `tt' -a = T.newuserdata(0); debug.setmetatable(a, tt); na = T.udataval(a) -b = T.newuserdata(0); debug.setmetatable(b, tt); nb = T.udataval(b) -c = T.newuserdata(0); debug.setmetatable(c, tt); nc = T.udataval(c) - --- create userdata without meta table -x = T.newuserdata(4) -y = T.newuserdata(0) - -checkerr("FILE%* expected, got userdata", io.input, a) -checkerr("FILE%* expected, got userdata", io.input, x) - -assert(debug.getmetatable(x) == nil and debug.getmetatable(y) == nil) - -d=T.ref(a); -e=T.ref(b); -f=T.ref(c); -t = {T.getref(d), T.getref(e), T.getref(f)} -assert(t[1] == a and t[2] == b and t[3] == c) - -t=nil; a=nil; c=nil; -T.unref(e); T.unref(f) - -collectgarbage() - --- check that unref objects have been collected -assert(#cl == 1 and cl[1] == nc) - -x = T.getref(d) -assert(type(x) == 'userdata' and debug.getmetatable(x) == tt) -x =nil -tt.b = b -- create cycle -tt=nil -- frees tt for GC -A = nil -b = nil -T.unref(d); -n5 = T.newuserdata(0) -debug.setmetatable(n5, {__gc=F}) -n5 = T.udataval(n5) -collectgarbage() -assert(#cl == 4) --- check order of collection -assert(cl[2] == n5 and cl[3] == nb and cl[4] == na) - -collectgarbage"restart" - - -a, na = {}, {} -for i=30,1,-1 do - a[i] = T.newuserdata(0) - debug.setmetatable(a[i], {__gc=F}) - na[i] = T.udataval(a[i]) -end -cl = {} -a = nil; collectgarbage() -assert(#cl == 30) -for i=1,30 do assert(cl[i] == na[i]) end -na = nil - - -for i=2,Lim,2 do -- unlock the other half - T.unref(Arr[i]) -end - -x = T.newuserdata(41); debug.setmetatable(x, {__gc=F}) -assert(T.testC("objsize 2; return 1", x) == 41) -cl = {} -a = {[x] = 1} -x = T.udataval(x) -collectgarbage() --- old `x' cannot be collected (`a' still uses it) -assert(#cl == 0) -for n in pairs(a) do a[n] = undef end -collectgarbage() -assert(#cl == 1 and cl[1] == x) -- old `x' must be collected - --- testing lua_equal -assert(T.testC("compare EQ 2 4; return 1", print, 1, print, 20)) -assert(T.testC("compare EQ 3 2; return 1", 'alo', "alo")) -assert(T.testC("compare EQ 2 3; return 1", nil, nil)) -assert(not T.testC("compare EQ 2 3; return 1", {}, {})) -assert(not T.testC("compare EQ 2 3; return 1")) -assert(not T.testC("compare EQ 2 3; return 1", 3)) - --- testing lua_equal with fallbacks -do - local map = {} - local t = {__eq = function (a,b) return map[a] == map[b] end} - local function f(x) - local u = T.newuserdata(0) - debug.setmetatable(u, t) - map[u] = x - return u - end - assert(f(10) == f(10)) - assert(f(10) ~= f(11)) - assert(T.testC("compare EQ 2 3; return 1", f(10), f(10))) - assert(not T.testC("compare EQ 2 3; return 1", f(10), f(20))) - t.__eq = nil - assert(f(10) ~= f(10)) -end - -print'+' - - - --- testing changing hooks during hooks -_G.t = {} -T.sethook([[ - # set a line hook after 3 count hooks - sethook 4 0 ' - getglobal t; - pushvalue -3; append -2 - pushvalue -2; append -2 - ']], "c", 3) -local a = 1 -- counting -a = 1 -- counting -a = 1 -- count hook (set line hook) -a = 1 -- line hook -a = 1 -- line hook -debug.sethook() -t = _G.t -assert(t[1] == "line") -line = t[2] -assert(t[3] == "line" and t[4] == line + 1) -assert(t[5] == "line" and t[6] == line + 2) -assert(t[7] == nil) - - -------------------------------------------------------------------------- -do -- testing errors during GC - warn("@off") - collectgarbage("stop") - local a = {} - for i=1,20 do - a[i] = T.newuserdata(i) -- creates several udata - end - for i=1,20,2 do -- mark half of them to raise errors during GC - debug.setmetatable(a[i], - {__gc = function (x) error("@expected error in gc") end}) - end - for i=2,20,2 do -- mark the other half to count and to create more garbage - debug.setmetatable(a[i], {__gc = function (x) load("A=A+1")() end}) - end - a = nil - _G.A = 0 - collectgarbage() - assert(A == 10) -- number of normal collections - collectgarbage("restart") - warn("@on") -end -------------------------------------------------------------------------- --- test for userdata vals -do - local a = {}; local lim = 30 - for i=0,lim do a[i] = T.pushuserdata(i) end - for i=0,lim do assert(T.udataval(a[i]) == i) end - for i=0,lim do assert(T.pushuserdata(i) == a[i]) end - for i=0,lim do a[a[i]] = i end - for i=0,lim do a[T.pushuserdata(i)] = i end - assert(type(tostring(a[1])) == "string") -end - - -------------------------------------------------------------------------- --- testing multiple states -T.closestate(T.newstate()); -L1 = T.newstate() -assert(L1) - -assert(T.doremote(L1, "X='a'; return 'a'") == 'a') - - -assert(#pack(T.doremote(L1, "function f () return 'alo', 3 end; f()")) == 0) - -a, b = T.doremote(L1, "return f()") -assert(a == 'alo' and b == '3') - -T.doremote(L1, "_ERRORMESSAGE = nil") --- error: `sin' is not defined -a, _, b = T.doremote(L1, "return sin(1)") -assert(a == nil and b == 2) -- 2 == run-time error - --- error: syntax error -a, b, c = T.doremote(L1, "return a+") -assert(a == nil and c == 3 and type(b) == "string") -- 3 == syntax error - -T.loadlib(L1) -a, b, c = T.doremote(L1, [[ - string = require'string' - a = require'_G'; assert(a == _G and require("_G") == a) - io = require'io'; assert(type(io.read) == "function") - assert(require("io") == io) - a = require'table'; assert(type(a.insert) == "function") - a = require'debug'; assert(type(a.getlocal) == "function") - a = require'math'; assert(type(a.sin) == "function") - return string.sub('okinama', 1, 2) -]]) -assert(a == "ok") - -T.closestate(L1); - - -L1 = T.newstate() -T.loadlib(L1) -T.doremote(L1, "a = {}") -T.testC(L1, [[getglobal "a"; pushstring "x"; pushint 1; - settable -3]]) -assert(T.doremote(L1, "return a.x") == "1") - -T.closestate(L1) - -L1 = nil - -print('+') -------------------------------------------------------------------------- --- testing to-be-closed variables -------------------------------------------------------------------------- -print"testing to-be-closed variables" - -do - local openresource = {} - - local function newresource () - local x = setmetatable({10}, {__close = function(y) - assert(openresource[#openresource] == y) - openresource[#openresource] = nil - y[1] = y[1] + 1 - end}) - openresource[#openresource + 1] = x - return x - end - - local a, b = T.testC([[ - call 0 1 # create resource - pushnil - toclose -2 # mark call result to be closed - toclose -1 # mark nil to be closed (will be ignored) - return 2 - ]], newresource) - assert(a[1] == 11 and b == nil) - assert(#openresource == 0) -- was closed - - -- repeat the test, but calling function in a 'multret' context - local a = {T.testC([[ - call 0 1 # create resource - toclose 2 # mark it to be closed - return 2 - ]], newresource)} - assert(type(a[1]) == "string" and a[2][1] == 11) - assert(#openresource == 0) -- was closed - - -- closing by error - local a, b = pcall(T.makeCfunc[[ - call 0 1 # create resource - toclose -1 # mark it to be closed - error # resource is the error object - ]], newresource) - assert(a == false and b[1] == 11) - assert(#openresource == 0) -- was closed - - -- non-closable value - local a, b = pcall(T.makeCfunc[[ - newtable # create non-closable object - toclose -1 # mark it to be closed (should raise an error) - abort # will not be executed - ]]) - assert(a == false and - string.find(b, "non%-closable value")) - - local function check (n) - assert(#openresource == n) - end - - -- closing resources with 'closeslot' - _ENV.xxx = true - local a = T.testC([[ - pushvalue 2 # stack: S, NR, CH, NR - call 0 1 # create resource; stack: S, NR, CH, R - toclose -1 # mark it to be closed - pushvalue 2 # stack: S, NR, CH, R, NR - call 0 1 # create another resource; stack: S, NR, CH, R, R - toclose -1 # mark it to be closed - pushvalue 3 # stack: S, NR, CH, R, R, CH - pushint 2 # there should be two open resources - call 1 0 # stack: S, NR, CH, R, R - closeslot -1 # close second resource - pushvalue 3 # stack: S, NR, CH, R, R, CH - pushint 1 # there should be one open resource - call 1 0 # stack: S, NR, CH, R, R - closeslot 4 - setglobal "xxx" # previous op. erased the slot - pop 1 # pop other resource from the stack - pushint * - return 1 # return stack size - ]], newresource, check) - assert(a == 3 and _ENV.xxx == nil) -- no extra items left in the stack - - -- closing resources with 'pop' - local a = T.testC([[ - pushvalue 2 # stack: S, NR, CH, NR - call 0 1 # create resource; stack: S, NR, CH, R - toclose -1 # mark it to be closed - pushvalue 2 # stack: S, NR, CH, R, NR - call 0 1 # create another resource; stack: S, NR, CH, R, R - toclose -1 # mark it to be closed - pushvalue 3 # stack: S, NR, CH, R, R, CH - pushint 2 # there should be two open resources - call 1 0 # stack: S, NR, CH, R, R - pop 1 # pop second resource - pushvalue 3 # stack: S, NR, CH, R, CH - pushint 1 # there should be one open resource - call 1 0 # stack: S, NR, CH, R - pop 1 # pop other resource from the stack - pushvalue 3 # stack: S, NR, CH, CH - pushint 0 # there should be no open resources - call 1 0 # stack: S, NR, CH - pushint * - return 1 # return stack size - ]], newresource, check) - assert(a == 3) -- no extra items left in the stack - - -- non-closable value - local a, b = pcall(T.makeCfunc[[ - pushint 32 - toclose -1 - ]]) - assert(not a and string.find(b, "(C temporary)")) - -end - - ---[[ -** {================================================================== -** Testing memory limits -** =================================================================== ---]] - -print("memory-allocation errors") - -checkerr("block too big", T.newuserdata, math.maxinteger) -collectgarbage() -local f = load"local a={}; for i=1,100000 do a[i]=i end" -T.alloccount(10) -checkerr(MEMERRMSG, f) -T.alloccount() -- remove limit - - --- test memory errors; increase limit for maximum memory by steps, --- o that we get memory errors in all allocations of a given --- task, until there is enough memory to complete the task without --- errors. -function testbytes (s, f) - collectgarbage() - local M = T.totalmem() - local oldM = M - local a,b = nil - while true do - collectgarbage(); collectgarbage() - T.totalmem(M) - a, b = T.testC("pcall 0 1 0; pushstatus; return 2", f) - T.totalmem(0) -- remove limit - if a and b == "OK" then break end -- stop when no more errors - if b ~= "OK" and b ~= MEMERRMSG then -- not a memory error? - error(a, 0) -- propagate it - end - M = M + 7 -- increase memory limit - end - print(string.format("minimum memory for %s: %d bytes", s, M - oldM)) - return a -end - --- test memory errors; increase limit for number of allocations one --- by one, so that we get memory errors in all allocations of a given --- task, until there is enough allocations to complete the task without --- errors. - -function testalloc (s, f) - collectgarbage() - local M = 0 - local a,b = nil - while true do - collectgarbage(); collectgarbage() - T.alloccount(M) - a, b = T.testC("pcall 0 1 0; pushstatus; return 2", f) - T.alloccount() -- remove limit - if a and b == "OK" then break end -- stop when no more errors - if b ~= "OK" and b ~= MEMERRMSG then -- not a memory error? - error(a, 0) -- propagate it - end - M = M + 1 -- increase allocation limit - end - print(string.format("minimum allocations for %s: %d allocations", s, M)) - return a -end - - -local function testamem (s, f) - testalloc(s, f) - return testbytes(s, f) -end - - --- doing nothing -b = testamem("doing nothing", function () return 10 end) -assert(b == 10) - --- testing memory errors when creating a new state - -testamem("state creation", function () - local st = T.newstate() - if st then T.closestate(st) end -- close new state - return st -end) - -testamem("empty-table creation", function () - return {} -end) - -testamem("string creation", function () - return "XXX" .. "YYY" -end) - -testamem("coroutine creation", function() - return coroutine.create(print) -end) - - --- testing to-be-closed variables -testamem("to-be-closed variables", function() - local flag - do - local x = - setmetatable({}, {__close = function () flag = true end}) - flag = false - local x = {} - end - return flag -end) - - --- testing threads - --- get main thread from registry (at index LUA_RIDX_MAINTHREAD == 1) -mt = T.testC("rawgeti R 1; return 1") -assert(type(mt) == "thread" and coroutine.running() == mt) - - - -function expand (n,s) - if n==0 then return "" end - local e = string.rep("=", n) - return string.format("T.doonnewstack([%s[ %s;\n collectgarbage(); %s]%s])\n", - e, s, expand(n-1,s), e) -end - -G=0; collectgarbage(); a =collectgarbage("count") -load(expand(20,"G=G+1"))() -assert(G==20); collectgarbage(); -- assert(gcinfo() <= a+1) - -testamem("running code on new thread", function () - return T.doonnewstack("x=1") == 0 -- try to create thread -end) - - --- testing memory x compiler - -testamem("loadstring", function () - return load("x=1") -- try to do load a string -end) - - -local testprog = [[ -local function foo () return end -local t = {"x"} -a = "aaa" -for i = 1, #t do a=a..t[i] end -return true -]] - --- testing memory x dofile -_G.a = nil -local t =os.tmpname() -local f = assert(io.open(t, "w")) -f:write(testprog) -f:close() -testamem("dofile", function () - local a = loadfile(t) - return a and a() -end) -assert(os.remove(t)) -assert(_G.a == "aaax") - - --- other generic tests - -testamem("gsub", function () - local a, b = string.gsub("alo alo", "(a)", function (x) return x..'b' end) - return (a == 'ablo ablo') -end) - -testamem("dump/undump", function () - local a = load(testprog) - local b = a and string.dump(a) - a = b and load(b) - return a and a() -end) - -local t = os.tmpname() -testamem("file creation", function () - local f = assert(io.open(t, 'w')) - assert (not io.open"nomenaoexistente") - io.close(f); - return not loadfile'nomenaoexistente' -end) -assert(os.remove(t)) - -testamem("table creation", function () - local a, lim = {}, 10 - for i=1,lim do a[i] = i; a[i..'a'] = {} end - return (type(a[lim..'a']) == 'table' and a[lim] == lim) -end) - -testamem("constructors", function () - local a = {10, 20, 30, 40, 50; a=1, b=2, c=3, d=4, e=5} - return (type(a) == 'table' and a.e == 5) -end) - -local a = 1 -close = nil -testamem("closure creation", function () - function close (b) - return function (x) return b + x end - end - return (close(2)(4) == 6) -end) - -testamem("using coroutines", function () - local a = coroutine.wrap(function () - coroutine.yield(string.rep("a", 10)) - return {} - end) - assert(string.len(a()) == 10) - return a() -end) - -do -- auxiliary buffer - local lim = 100 - local a = {}; for i = 1, lim do a[i] = "01234567890123456789" end - testamem("auxiliary buffer", function () - return (#table.concat(a, ",") == 20*lim + lim - 1) - end) -end - -testamem("growing stack", function () - local function foo (n) - if n == 0 then return 1 else return 1 + foo(n - 1) end - end - return foo(100) -end) - --- }================================================================== - - -do -- testing failing in 'lua_checkstack' - local res = T.testC([[rawcheckstack 500000; return 1]]) - assert(res == false) - local L = T.newstate() - T.alloccount(0) -- will be unable to reallocate the stack - res = T.testC(L, [[rawcheckstack 5000; return 1]]) - T.alloccount() - T.closestate(L) - assert(res == false) -end - -do -- closing state with no extra memory - local L = T.newstate() - T.alloccount(0) - T.closestate(L) - T.alloccount() -end - -do -- garbage collection with no extra memory - local L = T.newstate() - T.loadlib(L) - local res = (T.doremote(L, [[ - _ENV = require"_G" - local T = require"T" - local a = {} - for i = 1, 1000 do a[i] = 'i' .. i end -- grow string table - local stsize, stuse = T.querystr() - assert(stuse > 1000) - local function foo (n) - if n > 0 then foo(n - 1) end - end - foo(180) -- grow stack - local _, stksize = T.stacklevel() - assert(stksize > 180) - a = nil - T.alloccount(0) - collectgarbage() - T.alloccount() - -- stack and string table could not be reallocated, - -- so they kept their sizes (without errors) - assert(select(2, T.stacklevel()) == stksize) - assert(T.querystr() == stsize) - return 'ok' - ]])) - assert(res == 'ok') - T.closestate(L) -end - -print'+' - --- testing some auxlib functions -local function gsub (a, b, c) - a, b = T.testC("gsub 2 3 4; gettop; return 2", a, b, c) - assert(b == 5) - return a -end - -assert(gsub("alo.alo.uhuh.", ".", "//") == "alo//alo//uhuh//") -assert(gsub("alo.alo.uhuh.", "alo", "//") == "//.//.uhuh.") -assert(gsub("", "alo", "//") == "") -assert(gsub("...", ".", "/.") == "/././.") -assert(gsub("...", "...", "") == "") - - --- testing luaL_newmetatable -local mt_xuxu, res, top = T.testC("newmetatable xuxu; gettop; return 3") -assert(type(mt_xuxu) == "table" and res and top == 3) -local d, res, top = T.testC("newmetatable xuxu; gettop; return 3") -assert(mt_xuxu == d and not res and top == 3) -d, res, top = T.testC("newmetatable xuxu1; gettop; return 3") -assert(mt_xuxu ~= d and res and top == 3) - -x = T.newuserdata(0); -y = T.newuserdata(0); -T.testC("pushstring xuxu; gettable R; setmetatable 2", x) -assert(getmetatable(x) == mt_xuxu) - --- testing luaL_testudata --- correct metatable -local res1, res2, top = T.testC([[testudata -1 xuxu - testudata 2 xuxu - gettop - return 3]], x) -assert(res1 and res2 and top == 4) - --- wrong metatable -res1, res2, top = T.testC([[testudata -1 xuxu1 - testudata 2 xuxu1 - gettop - return 3]], x) -assert(not res1 and not res2 and top == 4) - --- non-existent type -res1, res2, top = T.testC([[testudata -1 xuxu2 - testudata 2 xuxu2 - gettop - return 3]], x) -assert(not res1 and not res2 and top == 4) - --- userdata has no metatable -res1, res2, top = T.testC([[testudata -1 xuxu - testudata 2 xuxu - gettop - return 3]], y) -assert(not res1 and not res2 and top == 4) - --- erase metatables -do - local r = debug.getregistry() - assert(r.xuxu == mt_xuxu and r.xuxu1 == d) - r.xuxu = nil; r.xuxu1 = nil -end - -print'OK' - diff --git a/lua-5.4.4-tests/attrib.lua b/lua-5.4.4-tests/attrib.lua deleted file mode 100644 index b1076c7..0000000 --- a/lua-5.4.4-tests/attrib.lua +++ /dev/null @@ -1,515 +0,0 @@ --- $Id: testes/attrib.lua $ --- See Copyright Notice in file all.lua - -print "testing require" - -assert(require"string" == string) -assert(require"math" == math) -assert(require"table" == table) -assert(require"io" == io) -assert(require"os" == os) -assert(require"coroutine" == coroutine) - -assert(type(package.path) == "string") -assert(type(package.cpath) == "string") -assert(type(package.loaded) == "table") -assert(type(package.preload) == "table") - -assert(type(package.config) == "string") -print("package config: "..string.gsub(package.config, "\n", "|")) - -do - -- create a path with 'max' templates, - -- each with 1-10 repetitions of '?' - local max = _soft and 100 or 2000 - local t = {} - for i = 1,max do t[i] = string.rep("?", i%10 + 1) end - t[#t + 1] = ";" -- empty template - local path = table.concat(t, ";") - -- use that path in a search - local s, err = package.searchpath("xuxu", path) - -- search fails; check that message has an occurrence of - -- '??????????' with ? replaced by xuxu and at least 'max' lines - assert(not s and - string.find(err, string.rep("xuxu", 10)) and - #string.gsub(err, "[^\n]", "") >= max) - -- path with one very long template - local path = string.rep("?", max) - local s, err = package.searchpath("xuxu", path) - assert(not s and string.find(err, string.rep('xuxu', max))) -end - -do - local oldpath = package.path - package.path = {} - local s, err = pcall(require, "no-such-file") - assert(not s and string.find(err, "package.path")) - package.path = oldpath -end - - -do print"testing 'require' message" - local oldpath = package.path - local oldcpath = package.cpath - - package.path = "?.lua;?/?" - package.cpath = "?.so;?/init" - - local st, msg = pcall(require, 'XXX') - - local expected = [[module 'XXX' not found: - no field package.preload['XXX'] - no file 'XXX.lua' - no file 'XXX/XXX' - no file 'XXX.so' - no file 'XXX/init']] - - assert(msg == expected) - - package.path = oldpath - package.cpath = oldcpath -end - -print('+') - - --- The next tests for 'require' assume some specific directories and --- libraries. - -if not _port then --[ - -local dirsep = string.match(package.config, "^([^\n]+)\n") - --- auxiliary directory with C modules and temporary files -local DIR = "libs" .. dirsep - --- prepend DIR to a name and correct directory separators -local function D (x) - x = string.gsub(x, "/", dirsep) - return DIR .. x -end - --- prepend DIR and pospend proper C lib. extension to a name -local function DC (x) - local ext = (dirsep == '\\') and ".dll" or ".so" - return D(x .. ext) -end - - -local function createfiles (files, preextras, posextras) - for n,c in pairs(files) do - io.output(D(n)) - io.write(string.format(preextras, n)) - io.write(c) - io.write(string.format(posextras, n)) - io.close(io.output()) - end -end - -function removefiles (files) - for n in pairs(files) do - os.remove(D(n)) - end -end - -local files = { - ["names.lua"] = "do return {...} end\n", - ["err.lua"] = "B = 15; a = a + 1;", - ["synerr.lua"] = "B =", - ["A.lua"] = "", - ["B.lua"] = "assert(...=='B');require 'A'", - ["A.lc"] = "", - ["A"] = "", - ["L"] = "", - ["XXxX"] = "", - ["C.lua"] = "package.loaded[...] = 25; require'C'", -} - -AA = nil -local extras = [[ -NAME = '%s' -REQUIRED = ... -return AA]] - -createfiles(files, "", extras) - --- testing explicit "dir" separator in 'searchpath' -assert(package.searchpath("C.lua", D"?", "", "") == D"C.lua") -assert(package.searchpath("C.lua", D"?", ".", ".") == D"C.lua") -assert(package.searchpath("--x-", D"?", "-", "X") == D"XXxX") -assert(package.searchpath("---xX", D"?", "---", "XX") == D"XXxX") -assert(package.searchpath(D"C.lua", "?", dirsep) == D"C.lua") -assert(package.searchpath(".\\C.lua", D"?", "\\") == D"./C.lua") - -local oldpath = package.path - -package.path = string.gsub("D/?.lua;D/?.lc;D/?;D/??x?;D/L", "D/", DIR) - -local try = function (p, n, r, ext) - NAME = nil - local rr, x = require(p) - assert(NAME == n) - assert(REQUIRED == p) - assert(rr == r) - assert(ext == x) -end - -a = require"names" -assert(a[1] == "names" and a[2] == D"names.lua") - -_G.a = nil -local st, msg = pcall(require, "err") -assert(not st and string.find(msg, "arithmetic") and B == 15) -st, msg = pcall(require, "synerr") -assert(not st and string.find(msg, "error loading module")) - -assert(package.searchpath("C", package.path) == D"C.lua") -assert(require"C" == 25) -assert(require"C" == 25) -AA = nil -try('B', 'B.lua', true, "libs/B.lua") -assert(package.loaded.B) -assert(require"B" == true) -assert(package.loaded.A) -assert(require"C" == 25) -package.loaded.A = nil -try('B', nil, true, nil) -- should not reload package -try('A', 'A.lua', true, "libs/A.lua") -package.loaded.A = nil -os.remove(D'A.lua') -AA = {} -try('A', 'A.lc', AA, "libs/A.lc") -- now must find second option -assert(package.searchpath("A", package.path) == D"A.lc") -assert(require("A") == AA) -AA = false -try('K', 'L', false, "libs/L") -- default option -try('K', 'L', false, "libs/L") -- default option (should reload it) -assert(rawget(_G, "_REQUIREDNAME") == nil) - -AA = "x" -try("X", "XXxX", AA, "libs/XXxX") - - -removefiles(files) - - --- testing require of sub-packages - -local _G = _G - -package.path = string.gsub("D/?.lua;D/?/init.lua", "D/", DIR) - -files = { - ["P1/init.lua"] = "AA = 10", - ["P1/xuxu.lua"] = "AA = 20", -} - -createfiles(files, "_ENV = {}\n", "\nreturn _ENV\n") -AA = 0 - -local m, ext = assert(require"P1") -assert(ext == "libs/P1/init.lua") -assert(AA == 0 and m.AA == 10) -assert(require"P1" == m) -assert(require"P1" == m) - -assert(package.searchpath("P1.xuxu", package.path) == D"P1/xuxu.lua") -m.xuxu, ext = assert(require"P1.xuxu") -assert(AA == 0 and m.xuxu.AA == 20) -assert(ext == "libs/P1/xuxu.lua") -assert(require"P1.xuxu" == m.xuxu) -assert(require"P1.xuxu" == m.xuxu) -assert(require"P1" == m and m.AA == 10) - - -removefiles(files) - - -package.path = "" -assert(not pcall(require, "file_does_not_exist")) -package.path = "??\0?" -assert(not pcall(require, "file_does_not_exist1")) - -package.path = oldpath - --- check 'require' error message -local fname = "file_does_not_exist2" -local m, err = pcall(require, fname) -for t in string.gmatch(package.path..";"..package.cpath, "[^;]+") do - t = string.gsub(t, "?", fname) - assert(string.find(err, t, 1, true)) -end - -do -- testing 'package.searchers' not being a table - local searchers = package.searchers - package.searchers = 3 - local st, msg = pcall(require, 'a') - assert(not st and string.find(msg, "must be a table")) - package.searchers = searchers -end - -local function import(...) - local f = {...} - return function (m) - for i=1, #f do m[f[i]] = _G[f[i]] end - end -end - --- cannot change environment of a C function -assert(not pcall(module, 'XUXU')) - - - --- testing require of C libraries - - -local p = "" -- On Mac OS X, redefine this to "_" - --- check whether loadlib works in this system -local st, err, when = package.loadlib(DC"lib1", "*") -if not st then - local f, err, when = package.loadlib("donotexist", p.."xuxu") - assert(not f and type(err) == "string" and when == "absent") - ;(Message or print)('\n >>> cannot load dynamic library <<<\n') - print(err, when) -else - -- tests for loadlib - local f = assert(package.loadlib(DC"lib1", p.."onefunction")) - local a, b = f(15, 25) - assert(a == 25 and b == 15) - - f = assert(package.loadlib(DC"lib1", p.."anotherfunc")) - assert(f(10, 20) == "10%20\n") - - -- check error messages - local f, err, when = package.loadlib(DC"lib1", p.."xuxu") - assert(not f and type(err) == "string" and when == "init") - f, err, when = package.loadlib("donotexist", p.."xuxu") - assert(not f and type(err) == "string" and when == "open") - - -- symbols from 'lib1' must be visible to other libraries - f = assert(package.loadlib(DC"lib11", p.."luaopen_lib11")) - assert(f() == "exported") - - -- test C modules with prefixes in names - package.cpath = DC"?" - local lib2, ext = require"lib2-v2" - assert(string.find(ext, "libs/lib2-v2", 1, true)) - -- check correct access to global environment and correct - -- parameters - assert(_ENV.x == "lib2-v2" and _ENV.y == DC"lib2-v2") - assert(lib2.id("x") == true) -- a different "id" implementation - - -- test C submodules - local fs, ext = require"lib1.sub" - assert(_ENV.x == "lib1.sub" and _ENV.y == DC"lib1") - assert(string.find(ext, "libs/lib1", 1, true)) - assert(fs.id(45) == 45) -end - -_ENV = _G - - --- testing preload - -do - local p = package - package = {} - p.preload.pl = function (...) - local _ENV = {...} - function xuxu (x) return x+20 end - return _ENV - end - - local pl, ext = require"pl" - assert(require"pl" == pl) - assert(pl.xuxu(10) == 30) - assert(pl[1] == "pl" and pl[2] == ":preload:" and ext == ":preload:") - - package = p - assert(type(package.path) == "string") -end - -print('+') - -end --] - -print("testing assignments, logical operators, and constructors") - -local res, res2 = 27 - -a, b = 1, 2+3 -assert(a==1 and b==5) -a={} -function f() return 10, 11, 12 end -a.x, b, a[1] = 1, 2, f() -assert(a.x==1 and b==2 and a[1]==10) -a[f()], b, a[f()+3] = f(), a, 'x' -assert(a[10] == 10 and b == a and a[13] == 'x') - -do - local f = function (n) local x = {}; for i=1,n do x[i]=i end; - return table.unpack(x) end; - local a,b,c - a,b = 0, f(1) - assert(a == 0 and b == 1) - A,b = 0, f(1) - assert(A == 0 and b == 1) - a,b,c = 0,5,f(4) - assert(a==0 and b==5 and c==1) - a,b,c = 0,5,f(0) - assert(a==0 and b==5 and c==nil) -end - -a, b, c, d = 1 and nil, 1 or nil, (1 and (nil or 1)), 6 -assert(not a and b and c and d==6) - -d = 20 -a, b, c, d = f() -assert(a==10 and b==11 and c==12 and d==nil) -a,b = f(), 1, 2, 3, f() -assert(a==10 and b==1) - -assert(ab == true) -assert((10 and 2) == 2) -assert((10 or 2) == 10) -assert((10 or assert(nil)) == 10) -assert(not (nil and assert(nil))) -assert((nil or "alo") == "alo") -assert((nil and 10) == nil) -assert((false and 10) == false) -assert((true or 10) == true) -assert((false or 10) == 10) -assert(false ~= nil) -assert(nil ~= false) -assert(not nil == true) -assert(not not nil == false) -assert(not not 1 == true) -assert(not not a == true) -assert(not not (6 or nil) == true) -assert(not not (nil and 56) == false) -assert(not not (nil and true) == false) -assert(not 10 == false) -assert(not {} == false) -assert(not 0.5 == false) -assert(not "x" == false) - -assert({} ~= {}) -print('+') - -a = {} -a[true] = 20 -a[false] = 10 -assert(a[1<2] == 20 and a[1>2] == 10) - -function f(a) return a end - -local a = {} -for i=3000,-3000,-1 do a[i + 0.0] = i; end -a[10e30] = "alo"; a[true] = 10; a[false] = 20 -assert(a[10e30] == 'alo' and a[not 1] == 20 and a[10<20] == 10) -for i=3000,-3000,-1 do assert(a[i] == i); end -a[print] = assert -a[f] = print -a[a] = a -assert(a[a][a][a][a][print] == assert) -a[print](a[a[f]] == a[print]) -assert(not pcall(function () local a = {}; a[nil] = 10 end)) -assert(not pcall(function () local a = {[nil] = 10} end)) -assert(a[nil] == undef) -a = nil - -a = {10,9,8,7,6,5,4,3,2; [-3]='a', [f]=print, a='a', b='ab'} -a, a.x, a.y = a, a[-3] -assert(a[1]==10 and a[-3]==a.a and a[f]==print and a.x=='a' and not a.y) -a[1], f(a)[2], b, c = {['alo']=assert}, 10, a[1], a[f], 6, 10, 23, f(a), 2 -a[1].alo(a[2]==10 and b==10 and c==print) - -a.aVeryLongName012345678901234567890123456789012345678901234567890123456789 = 10 -local function foo () - return a.aVeryLongName012345678901234567890123456789012345678901234567890123456789 -end -assert(foo() == 10 and -a.aVeryLongName012345678901234567890123456789012345678901234567890123456789 == -10) - - - --- test of large float/integer indices - --- compute maximum integer where all bits fit in a float -local maxint = math.maxinteger - --- trim (if needed) to fit in a float -while maxint ~= (maxint + 0.0) or (maxint - 1) ~= (maxint - 1.0) do - maxint = maxint // 2 -end - -maxintF = maxint + 0.0 -- float version - -assert(maxintF == maxint and math.type(maxintF) == "float" and - maxintF >= 2.0^14) - --- floats and integers must index the same places -a[maxintF] = 10; a[maxintF - 1.0] = 11; -a[-maxintF] = 12; a[-maxintF + 1.0] = 13; - -assert(a[maxint] == 10 and a[maxint - 1] == 11 and - a[-maxint] == 12 and a[-maxint + 1] == 13) - -a[maxint] = 20 -a[-maxint] = 22 - -assert(a[maxintF] == 20 and a[maxintF - 1.0] == 11 and - a[-maxintF] == 22 and a[-maxintF + 1.0] == 13) - -a = nil - - --- test conflicts in multiple assignment -do - local a,i,j,b - a = {'a', 'b'}; i=1; j=2; b=a - i, a[i], a, j, a[j], a[i+j] = j, i, i, b, j, i - assert(i == 2 and b[1] == 1 and a == 1 and j == b and b[2] == 2 and - b[3] == 1) - a = {} - local function foo () -- assigining to upvalues - b, a.x, a = a, 10, 20 - end - foo() - assert(a == 20 and b.x == 10) -end - --- repeat test with upvalues -do - local a,i,j,b - a = {'a', 'b'}; i=1; j=2; b=a - local function foo () - i, a[i], a, j, a[j], a[i+j] = j, i, i, b, j, i - end - foo() - assert(i == 2 and b[1] == 1 and a == 1 and j == b and b[2] == 2 and - b[3] == 1) - local t = {} - (function (a) t[a], a = 10, 20 end)(1); - assert(t[1] == 10) -end - --- bug in 5.2 beta -local function foo () - local a - return function () - local b - a, b = 3, 14 -- local and upvalue have same index - return a, b - end -end - -local a, b = foo()() -assert(a == 3 and b == 14) - -print('OK') - -return res - diff --git a/lua-5.4.4-tests/big.lua b/lua-5.4.4-tests/big.lua deleted file mode 100644 index 39e293e..0000000 --- a/lua-5.4.4-tests/big.lua +++ /dev/null @@ -1,82 +0,0 @@ --- $Id: testes/big.lua $ --- See Copyright Notice in file all.lua - -if _soft then - return 'a' -end - -print "testing large tables" - -local debug = require"debug" - -local lim = 2^18 + 1000 -local prog = { "local y = {0" } -for i = 1, lim do prog[#prog + 1] = i end -prog[#prog + 1] = "}\n" -prog[#prog + 1] = "X = y\n" -prog[#prog + 1] = ("assert(X[%d] == %d)"):format(lim - 1, lim - 2) -prog[#prog + 1] = "return 0" -prog = table.concat(prog, ";") - -local env = {string = string, assert = assert} -local f = assert(load(prog, nil, nil, env)) - -f() -assert(env.X[lim] == lim - 1 and env.X[lim + 1] == lim) -for k in pairs(env) do env[k] = undef end - --- yields during accesses larger than K (in RK) -setmetatable(env, { - __index = function (t, n) coroutine.yield('g'); return _G[n] end, - __newindex = function (t, n, v) coroutine.yield('s'); _G[n] = v end, -}) - -X = nil -co = coroutine.wrap(f) -assert(co() == 's') -assert(co() == 'g') -assert(co() == 'g') -assert(co() == 0) - -assert(X[lim] == lim - 1 and X[lim + 1] == lim) - --- errors in accesses larger than K (in RK) -getmetatable(env).__index = function () end -getmetatable(env).__newindex = function () end -local e, m = pcall(f) -assert(not e and m:find("global 'X'")) - --- errors in metamethods -getmetatable(env).__newindex = function () error("hi") end -local e, m = xpcall(f, debug.traceback) -assert(not e and m:find("'newindex'")) - -f, X = nil - -coroutine.yield'b' - -if 2^32 == 0 then -- (small integers) { - -print "testing string length overflow" - -local repstrings = 192 -- number of strings to be concatenated -local ssize = math.ceil(2.0^32 / repstrings) + 1 -- size of each string - -assert(repstrings * ssize > 2.0^32) -- it should be larger than maximum size - -local longs = string.rep("\0", ssize) -- create one long string - --- create function to concatenate 'repstrings' copies of its argument -local rep = assert(load( - "local a = ...; return " .. string.rep("a", repstrings, ".."))) - -local a, b = pcall(rep, longs) -- call that function - --- it should fail without creating string (result would be too large) -assert(not a and string.find(b, "overflow")) - -end -- } - -print'OK' - -return 'a' diff --git a/lua-5.4.4-tests/bitwise.lua b/lua-5.4.4-tests/bitwise.lua deleted file mode 100644 index 9509f7f..0000000 --- a/lua-5.4.4-tests/bitwise.lua +++ /dev/null @@ -1,351 +0,0 @@ --- $Id: testes/bitwise.lua $ --- See Copyright Notice in file all.lua - -print("testing bitwise operations") - -require "bwcoercion" - -local numbits = string.packsize('j') * 8 - -assert(~0 == -1) - -assert((1 << (numbits - 1)) == math.mininteger) - --- basic tests for bitwise operators; --- use variables to avoid constant folding -local a, b, c, d -a = 0xFFFFFFFFFFFFFFFF -assert(a == -1 and a & -1 == a and a & 35 == 35) -a = 0xF0F0F0F0F0F0F0F0 -assert(a | -1 == -1) -assert(a ~ a == 0 and a ~ 0 == a and a ~ ~a == -1) -assert(a >> 4 == ~a) -a = 0xF0; b = 0xCC; c = 0xAA; d = 0xFD -assert(a | b ~ c & d == 0xF4) - -a = 0xF0.0; b = 0xCC.0; c = "0xAA.0"; d = "0xFD.0" -assert(a | b ~ c & d == 0xF4) - -a = 0xF0000000; b = 0xCC000000; -c = 0xAA000000; d = 0xFD000000 -assert(a | b ~ c & d == 0xF4000000) -assert(~~a == a and ~a == -1 ~ a and -d == ~d + 1) - -a = a << 32 -b = b << 32 -c = c << 32 -d = d << 32 -assert(a | b ~ c & d == 0xF4000000 << 32) -assert(~~a == a and ~a == -1 ~ a and -d == ~d + 1) - -assert(-1 >> 1 == (1 << (numbits - 1)) - 1 and 1 << 31 == 0x80000000) -assert(-1 >> (numbits - 1) == 1) -assert(-1 >> numbits == 0 and - -1 >> -numbits == 0 and - -1 << numbits == 0 and - -1 << -numbits == 0) - -assert(1 >> math.mininteger == 0) -assert(1 >> math.maxinteger == 0) -assert(1 << math.mininteger == 0) -assert(1 << math.maxinteger == 0) - -assert((2^30 - 1) << 2^30 == 0) -assert((2^30 - 1) >> 2^30 == 0) - -assert(1 >> -3 == 1 << 3 and 1000 >> 5 == 1000 << -5) - - --- coercion from strings to integers -assert("0xffffffffffffffff" | 0 == -1) -assert("0xfffffffffffffffe" & "-1" == -2) -assert(" \t-0xfffffffffffffffe\n\t" & "-1" == 2) -assert(" \n -45 \t " >> " -2 " == -45 * 4) -assert("1234.0" << "5.0" == 1234 * 32) -assert("0xffff.0" ~ "0xAAAA" == 0x5555) -assert(~"0x0.000p4" == -1) - -assert(("7" .. 3) << 1 == 146) -assert(0xffffffff >> (1 .. "9") == 0x1fff) -assert(10 | (1 .. "9") == 27) - -do - local st, msg = pcall(function () return 4 & "a" end) - assert(string.find(msg, "'band'")) - - local st, msg = pcall(function () return ~"a" end) - assert(string.find(msg, "'bnot'")) -end - - --- out of range number -assert(not pcall(function () return "0xffffffffffffffff.0" | 0 end)) - --- embedded zeros -assert(not pcall(function () return "0xffffffffffffffff\0" | 0 end)) - -print'+' - - -package.preload.bit32 = function () --{ - --- no built-in 'bit32' library: implement it using bitwise operators - -local bit = {} - -function bit.bnot (a) - return ~a & 0xFFFFFFFF -end - - --- --- in all vararg functions, avoid creating 'arg' table when there are --- only 2 (or less) parameters, as 2 parameters is the common case --- - -function bit.band (x, y, z, ...) - if not z then - return ((x or -1) & (y or -1)) & 0xFFFFFFFF - else - local arg = {...} - local res = x & y & z - for i = 1, #arg do res = res & arg[i] end - return res & 0xFFFFFFFF - end -end - -function bit.bor (x, y, z, ...) - if not z then - return ((x or 0) | (y or 0)) & 0xFFFFFFFF - else - local arg = {...} - local res = x | y | z - for i = 1, #arg do res = res | arg[i] end - return res & 0xFFFFFFFF - end -end - -function bit.bxor (x, y, z, ...) - if not z then - return ((x or 0) ~ (y or 0)) & 0xFFFFFFFF - else - local arg = {...} - local res = x ~ y ~ z - for i = 1, #arg do res = res ~ arg[i] end - return res & 0xFFFFFFFF - end -end - -function bit.btest (...) - return bit.band(...) ~= 0 -end - -function bit.lshift (a, b) - return ((a & 0xFFFFFFFF) << b) & 0xFFFFFFFF -end - -function bit.rshift (a, b) - return ((a & 0xFFFFFFFF) >> b) & 0xFFFFFFFF -end - -function bit.arshift (a, b) - a = a & 0xFFFFFFFF - if b <= 0 or (a & 0x80000000) == 0 then - return (a >> b) & 0xFFFFFFFF - else - return ((a >> b) | ~(0xFFFFFFFF >> b)) & 0xFFFFFFFF - end -end - -function bit.lrotate (a ,b) - b = b & 31 - a = a & 0xFFFFFFFF - a = (a << b) | (a >> (32 - b)) - return a & 0xFFFFFFFF -end - -function bit.rrotate (a, b) - return bit.lrotate(a, -b) -end - -local function checkfield (f, w) - w = w or 1 - assert(f >= 0, "field cannot be negative") - assert(w > 0, "width must be positive") - assert(f + w <= 32, "trying to access non-existent bits") - return f, ~(-1 << w) -end - -function bit.extract (a, f, w) - local f, mask = checkfield(f, w) - return (a >> f) & mask -end - -function bit.replace (a, v, f, w) - local f, mask = checkfield(f, w) - v = v & mask - a = (a & ~(mask << f)) | (v << f) - return a & 0xFFFFFFFF -end - -return bit - -end --} - - -print("testing bitwise library") - -local bit32 = require'bit32' - -assert(bit32.band() == bit32.bnot(0)) -assert(bit32.btest() == true) -assert(bit32.bor() == 0) -assert(bit32.bxor() == 0) - -assert(bit32.band() == bit32.band(0xffffffff)) -assert(bit32.band(1,2) == 0) - - --- out-of-range numbers -assert(bit32.band(-1) == 0xffffffff) -assert(bit32.band((1 << 33) - 1) == 0xffffffff) -assert(bit32.band(-(1 << 33) - 1) == 0xffffffff) -assert(bit32.band((1 << 33) + 1) == 1) -assert(bit32.band(-(1 << 33) + 1) == 1) -assert(bit32.band(-(1 << 40)) == 0) -assert(bit32.band(1 << 40) == 0) -assert(bit32.band(-(1 << 40) - 2) == 0xfffffffe) -assert(bit32.band((1 << 40) - 4) == 0xfffffffc) - -assert(bit32.lrotate(0, -1) == 0) -assert(bit32.lrotate(0, 7) == 0) -assert(bit32.lrotate(0x12345678, 0) == 0x12345678) -assert(bit32.lrotate(0x12345678, 32) == 0x12345678) -assert(bit32.lrotate(0x12345678, 4) == 0x23456781) -assert(bit32.rrotate(0x12345678, -4) == 0x23456781) -assert(bit32.lrotate(0x12345678, -8) == 0x78123456) -assert(bit32.rrotate(0x12345678, 8) == 0x78123456) -assert(bit32.lrotate(0xaaaaaaaa, 2) == 0xaaaaaaaa) -assert(bit32.lrotate(0xaaaaaaaa, -2) == 0xaaaaaaaa) -for i = -50, 50 do - assert(bit32.lrotate(0x89abcdef, i) == bit32.lrotate(0x89abcdef, i%32)) -end - -assert(bit32.lshift(0x12345678, 4) == 0x23456780) -assert(bit32.lshift(0x12345678, 8) == 0x34567800) -assert(bit32.lshift(0x12345678, -4) == 0x01234567) -assert(bit32.lshift(0x12345678, -8) == 0x00123456) -assert(bit32.lshift(0x12345678, 32) == 0) -assert(bit32.lshift(0x12345678, -32) == 0) -assert(bit32.rshift(0x12345678, 4) == 0x01234567) -assert(bit32.rshift(0x12345678, 8) == 0x00123456) -assert(bit32.rshift(0x12345678, 32) == 0) -assert(bit32.rshift(0x12345678, -32) == 0) -assert(bit32.arshift(0x12345678, 0) == 0x12345678) -assert(bit32.arshift(0x12345678, 1) == 0x12345678 // 2) -assert(bit32.arshift(0x12345678, -1) == 0x12345678 * 2) -assert(bit32.arshift(-1, 1) == 0xffffffff) -assert(bit32.arshift(-1, 24) == 0xffffffff) -assert(bit32.arshift(-1, 32) == 0xffffffff) -assert(bit32.arshift(-1, -1) == bit32.band(-1 * 2, 0xffffffff)) - -assert(0x12345678 << 4 == 0x123456780) -assert(0x12345678 << 8 == 0x1234567800) -assert(0x12345678 << -4 == 0x01234567) -assert(0x12345678 << -8 == 0x00123456) -assert(0x12345678 << 32 == 0x1234567800000000) -assert(0x12345678 << -32 == 0) -assert(0x12345678 >> 4 == 0x01234567) -assert(0x12345678 >> 8 == 0x00123456) -assert(0x12345678 >> 32 == 0) -assert(0x12345678 >> -32 == 0x1234567800000000) - -print("+") --- some special cases -local c = {0, 1, 2, 3, 10, 0x80000000, 0xaaaaaaaa, 0x55555555, - 0xffffffff, 0x7fffffff} - -for _, b in pairs(c) do - assert(bit32.band(b) == b) - assert(bit32.band(b, b) == b) - assert(bit32.band(b, b, b, b) == b) - assert(bit32.btest(b, b) == (b ~= 0)) - assert(bit32.band(b, b, b) == b) - assert(bit32.band(b, b, b, ~b) == 0) - assert(bit32.btest(b, b, b) == (b ~= 0)) - assert(bit32.band(b, bit32.bnot(b)) == 0) - assert(bit32.bor(b, bit32.bnot(b)) == bit32.bnot(0)) - assert(bit32.bor(b) == b) - assert(bit32.bor(b, b) == b) - assert(bit32.bor(b, b, b) == b) - assert(bit32.bor(b, b, 0, ~b) == 0xffffffff) - assert(bit32.bxor(b) == b) - assert(bit32.bxor(b, b) == 0) - assert(bit32.bxor(b, b, b) == b) - assert(bit32.bxor(b, b, b, b) == 0) - assert(bit32.bxor(b, 0) == b) - assert(bit32.bnot(b) ~= b) - assert(bit32.bnot(bit32.bnot(b)) == b) - assert(bit32.bnot(b) == (1 << 32) - 1 - b) - assert(bit32.lrotate(b, 32) == b) - assert(bit32.rrotate(b, 32) == b) - assert(bit32.lshift(bit32.lshift(b, -4), 4) == bit32.band(b, bit32.bnot(0xf))) - assert(bit32.rshift(bit32.rshift(b, 4), -4) == bit32.band(b, bit32.bnot(0xf))) -end - --- for this test, use at most 24 bits (mantissa of a single float) -c = {0, 1, 2, 3, 10, 0x800000, 0xaaaaaa, 0x555555, 0xffffff, 0x7fffff} -for _, b in pairs(c) do - for i = -40, 40 do - local x = bit32.lshift(b, i) - local y = math.floor(math.fmod(b * 2.0^i, 2.0^32)) - assert(math.fmod(x - y, 2.0^32) == 0) - end -end - -assert(not pcall(bit32.band, {})) -assert(not pcall(bit32.bnot, "a")) -assert(not pcall(bit32.lshift, 45)) -assert(not pcall(bit32.lshift, 45, print)) -assert(not pcall(bit32.rshift, 45, print)) - -print("+") - - --- testing extract/replace - -assert(bit32.extract(0x12345678, 0, 4) == 8) -assert(bit32.extract(0x12345678, 4, 4) == 7) -assert(bit32.extract(0xa0001111, 28, 4) == 0xa) -assert(bit32.extract(0xa0001111, 31, 1) == 1) -assert(bit32.extract(0x50000111, 31, 1) == 0) -assert(bit32.extract(0xf2345679, 0, 32) == 0xf2345679) - -assert(not pcall(bit32.extract, 0, -1)) -assert(not pcall(bit32.extract, 0, 32)) -assert(not pcall(bit32.extract, 0, 0, 33)) -assert(not pcall(bit32.extract, 0, 31, 2)) - -assert(bit32.replace(0x12345678, 5, 28, 4) == 0x52345678) -assert(bit32.replace(0x12345678, 0x87654321, 0, 32) == 0x87654321) -assert(bit32.replace(0, 1, 2) == 2^2) -assert(bit32.replace(0, -1, 4) == 2^4) -assert(bit32.replace(-1, 0, 31) == (1 << 31) - 1) -assert(bit32.replace(-1, 0, 1, 2) == (1 << 32) - 7) - - --- testing conversion of floats - -assert(bit32.bor(3.0) == 3) -assert(bit32.bor(-4.0) == 0xfffffffc) - --- large floats and large-enough integers? -if 2.0^50 < 2.0^50 + 1.0 and 2.0^50 < (-1 >> 1) then - assert(bit32.bor(2.0^32 - 5.0) == 0xfffffffb) - assert(bit32.bor(-2.0^32 - 6.0) == 0xfffffffa) - assert(bit32.bor(2.0^48 - 5.0) == 0xfffffffb) - assert(bit32.bor(-2.0^48 - 6.0) == 0xfffffffa) -end - -print'OK' - diff --git a/lua-5.4.4-tests/bwcoercion.lua b/lua-5.4.4-tests/bwcoercion.lua deleted file mode 100644 index cd735ab..0000000 --- a/lua-5.4.4-tests/bwcoercion.lua +++ /dev/null @@ -1,78 +0,0 @@ -local tonumber, tointeger = tonumber, math.tointeger -local type, getmetatable, rawget, error = type, getmetatable, rawget, error -local strsub = string.sub - -local print = print - -_ENV = nil - --- Try to convert a value to an integer, without assuming any coercion. -local function toint (x) - x = tonumber(x) -- handle numerical strings - if not x then - return false -- not coercible to a number - end - return tointeger(x) -end - - --- If operation fails, maybe second operand has a metamethod that should --- have been called if not for this string metamethod, so try to --- call it. -local function trymt (x, y, mtname) - if type(y) ~= "string" then -- avoid recalling original metamethod - local mt = getmetatable(y) - local mm = mt and rawget(mt, mtname) - if mm then - return mm(x, y) - end - end - -- if any test fails, there is no other metamethod to be called - error("attempt to '" .. strsub(mtname, 3) .. - "' a " .. type(x) .. " with a " .. type(y), 4) -end - - -local function checkargs (x, y, mtname) - local xi = toint(x) - local yi = toint(y) - if xi and yi then - return xi, yi - else - return trymt(x, y, mtname), nil - end -end - - -local smt = getmetatable("") - -smt.__band = function (x, y) - local x, y = checkargs(x, y, "__band") - return y and x & y or x -end - -smt.__bor = function (x, y) - local x, y = checkargs(x, y, "__bor") - return y and x | y or x -end - -smt.__bxor = function (x, y) - local x, y = checkargs(x, y, "__bxor") - return y and x ~ y or x -end - -smt.__shl = function (x, y) - local x, y = checkargs(x, y, "__shl") - return y and x << y or x -end - -smt.__shr = function (x, y) - local x, y = checkargs(x, y, "__shr") - return y and x >> y or x -end - -smt.__bnot = function (x) - local x, y = checkargs(x, x, "__bnot") - return y and ~x or x -end - diff --git a/lua-5.4.4-tests/calls.lua b/lua-5.4.4-tests/calls.lua deleted file mode 100644 index ff72d8f..0000000 --- a/lua-5.4.4-tests/calls.lua +++ /dev/null @@ -1,481 +0,0 @@ --- $Id: testes/calls.lua $ --- See Copyright Notice in file all.lua - -print("testing functions and calls") - -local debug = require "debug" - --- get the opportunity to test 'type' too ;) - -assert(type(1<2) == 'boolean') -assert(type(true) == 'boolean' and type(false) == 'boolean') -assert(type(nil) == 'nil' - and type(-3) == 'number' - and type'x' == 'string' - and type{} == 'table' - and type(type) == 'function') - -assert(type(assert) == type(print)) -function f (x) return a:x (x) end -assert(type(f) == 'function') -assert(not pcall(type)) - - --- testing local-function recursion -fact = false -do - local res = 1 - local function fact (n) - if n==0 then return res - else return n*fact(n-1) - end - end - assert(fact(5) == 120) -end -assert(fact == false) - --- testing declarations -a = {i = 10} -self = 20 -function a:x (x) return x+self.i end -function a.y (x) return x+self end - -assert(a:x(1)+10 == a.y(1)) - -a.t = {i=-100} -a["t"].x = function (self, a,b) return self.i+a+b end - -assert(a.t:x(2,3) == -95) - -do - local a = {x=0} - function a:add (x) self.x, a.y = self.x+x, 20; return self end - assert(a:add(10):add(20):add(30).x == 60 and a.y == 20) -end - -local a = {b={c={}}} - -function a.b.c.f1 (x) return x+1 end -function a.b.c:f2 (x,y) self[x] = y end -assert(a.b.c.f1(4) == 5) -a.b.c:f2('k', 12); assert(a.b.c.k == 12) - -print('+') - -t = nil -- 'declare' t -function f(a,b,c) local d = 'a'; t={a,b,c,d} end - -f( -- this line change must be valid - 1,2) -assert(t[1] == 1 and t[2] == 2 and t[3] == nil and t[4] == 'a') -f(1,2, -- this one too - 3,4) -assert(t[1] == 1 and t[2] == 2 and t[3] == 3 and t[4] == 'a') - -function fat(x) - if x <= 1 then return 1 - else return x*load("return fat(" .. x-1 .. ")", "")() - end -end - -assert(load "load 'assert(fat(6)==720)' () ")() -a = load('return fat(5), 3') -a,b = a() -assert(a == 120 and b == 3) -print('+') - -function err_on_n (n) - if n==0 then error(); exit(1); - else err_on_n (n-1); exit(1); - end -end - -do - function dummy (n) - if n > 0 then - assert(not pcall(err_on_n, n)) - dummy(n-1) - end - end -end - -dummy(10) - -function deep (n) - if n>0 then deep(n-1) end -end -deep(10) -deep(180) - - -print"testing tail calls" - -function deep (n) if n>0 then return deep(n-1) else return 101 end end -assert(deep(30000) == 101) -a = {} -function a:deep (n) if n>0 then return self:deep(n-1) else return 101 end end -assert(a:deep(30000) == 101) - -do -- tail calls x varargs - local function foo (x, ...) local a = {...}; return x, a[1], a[2] end - - local function foo1 (x) return foo(10, x, x + 1) end - - local a, b, c = foo1(-2) - assert(a == 10 and b == -2 and c == -1) - - -- tail calls x metamethods - local t = setmetatable({}, {__call = foo}) - local function foo2 (x) return t(10, x) end - a, b, c = foo2(100) - assert(a == t and b == 10 and c == 100) - - a, b = (function () return foo() end)() - assert(a == nil and b == nil) - - local X, Y, A - local function foo (x, y, ...) X = x; Y = y; A = {...} end - local function foo1 (...) return foo(...) end - - local a, b, c = foo1() - assert(X == nil and Y == nil and #A == 0) - - a, b, c = foo1(10) - assert(X == 10 and Y == nil and #A == 0) - - a, b, c = foo1(10, 20) - assert(X == 10 and Y == 20 and #A == 0) - - a, b, c = foo1(10, 20, 30) - assert(X == 10 and Y == 20 and #A == 1 and A[1] == 30) -end - - - -do -- tail calls x chain of __call - local n = 10000 -- depth - - local function foo () - if n == 0 then return 1023 - else n = n - 1; return foo() - end - end - - -- build a chain of __call metamethods ending in function 'foo' - for i = 1, 100 do - foo = setmetatable({}, {__call = foo}) - end - - -- call the first one as a tail call in a new coroutine - -- (to ensure stack is not preallocated) - assert(coroutine.wrap(function() return foo() end)() == 1023) -end - -print('+') - - -do -- testing chains of '__call' - local N = 20 - local u = table.pack - for i = 1, N do - u = setmetatable({i}, {__call = u}) - end - - local Res = u("a", "b", "c") - - assert(Res.n == N + 3) - for i = 1, N do - assert(Res[i][1] == i) - end - assert(Res[N + 1] == "a" and Res[N + 2] == "b" and Res[N + 3] == "c") -end - - -a = nil -(function (x) a=x end)(23) -assert(a == 23 and (function (x) return x*2 end)(20) == 40) - - --- testing closures - --- fixed-point operator -Z = function (le) - local function a (f) - return le(function (x) return f(f)(x) end) - end - return a(a) - end - - --- non-recursive factorial - -F = function (f) - return function (n) - if n == 0 then return 1 - else return n*f(n-1) end - end - end - -fat = Z(F) - -assert(fat(0) == 1 and fat(4) == 24 and Z(F)(5)==5*Z(F)(4)) - -local function g (z) - local function f (a,b,c,d) - return function (x,y) return a+b+c+d+a+x+y+z end - end - return f(z,z+1,z+2,z+3) -end - -f = g(10) -assert(f(9, 16) == 10+11+12+13+10+9+16+10) - -Z, F, f = nil -print('+') - --- testing multiple returns - -function unlpack (t, i) - i = i or 1 - if (i <= #t) then - return t[i], unlpack(t, i+1) - end -end - -function equaltab (t1, t2) - assert(#t1 == #t2) - for i = 1, #t1 do - assert(t1[i] == t2[i]) - end -end - -local pack = function (...) return (table.pack(...)) end - -function f() return 1,2,30,4 end -function ret2 (a,b) return a,b end - -local a,b,c,d = unlpack{1,2,3} -assert(a==1 and b==2 and c==3 and d==nil) -a = {1,2,3,4,false,10,'alo',false,assert} -equaltab(pack(unlpack(a)), a) -equaltab(pack(unlpack(a), -1), {1,-1}) -a,b,c,d = ret2(f()), ret2(f()) -assert(a==1 and b==1 and c==2 and d==nil) -a,b,c,d = unlpack(pack(ret2(f()), ret2(f()))) -assert(a==1 and b==1 and c==2 and d==nil) -a,b,c,d = unlpack(pack(ret2(f()), (ret2(f())))) -assert(a==1 and b==1 and c==nil and d==nil) - -a = ret2{ unlpack{1,2,3}, unlpack{3,2,1}, unlpack{"a", "b"}} -assert(a[1] == 1 and a[2] == 3 and a[3] == "a" and a[4] == "b") - - --- testing calls with 'incorrect' arguments -rawget({}, "x", 1) -rawset({}, "x", 1, 2) -assert(math.sin(1,2) == math.sin(1)) -table.sort({10,9,8,4,19,23,0,0}, function (a,b) return a 10 or a[i]() ~= x -assert(i == 11 and a[1]() == 1 and a[3]() == 3 and i == 4) - - --- testing closures created in 'then' and 'else' parts of 'if's -a = {} -for i = 1, 10 do - if i % 3 == 0 then - local y = 0 - a[i] = function (x) local t = y; y = x; return t end - elseif i % 3 == 1 then - goto L1 - error'not here' - ::L1:: - local y = 1 - a[i] = function (x) local t = y; y = x; return t end - elseif i % 3 == 2 then - local t - goto l4 - ::l4a:: a[i] = t; goto l4b - error("should never be here!") - ::l4:: - local y = 2 - t = function (x) local t = y; y = x; return t end - goto l4a - error("should never be here!") - ::l4b:: - end -end - -for i = 1, 10 do - assert(a[i](i * 10) == i % 3 and a[i]() == i * 10) -end - -print'+' - - --- test for correctly closing upvalues in tail calls of vararg functions -local function t () - local function c(a,b) assert(a=="test" and b=="OK") end - local function v(f, ...) c("test", f() ~= 1 and "FAILED" or "OK") end - local x = 1 - return v(function() return x end) -end -t() - - --- test for debug manipulation of upvalues -local debug = require'debug' - -do - local a , b, c = 3, 5, 7 - foo1 = function () return a+b end; - foo2 = function () return b+a end; - do - local a = 10 - foo3 = function () return a+b end; - end -end - -assert(debug.upvalueid(foo1, 1)) -assert(debug.upvalueid(foo1, 2)) -assert(not debug.upvalueid(foo1, 3)) -assert(debug.upvalueid(foo1, 1) == debug.upvalueid(foo2, 2)) -assert(debug.upvalueid(foo1, 2) == debug.upvalueid(foo2, 1)) -assert(debug.upvalueid(foo3, 1)) -assert(debug.upvalueid(foo1, 1) ~= debug.upvalueid(foo3, 1)) -assert(debug.upvalueid(foo1, 2) == debug.upvalueid(foo3, 2)) - -assert(debug.upvalueid(string.gmatch("x", "x"), 1) ~= nil) - -assert(foo1() == 3 + 5 and foo2() == 5 + 3) -debug.upvaluejoin(foo1, 2, foo2, 2) -assert(foo1() == 3 + 3 and foo2() == 5 + 3) -assert(foo3() == 10 + 5) -debug.upvaluejoin(foo3, 2, foo2, 1) -assert(foo3() == 10 + 5) -debug.upvaluejoin(foo3, 2, foo2, 2) -assert(foo3() == 10 + 3) - -assert(not pcall(debug.upvaluejoin, foo1, 3, foo2, 1)) -assert(not pcall(debug.upvaluejoin, foo1, 1, foo2, 3)) -assert(not pcall(debug.upvaluejoin, foo1, 0, foo2, 1)) -assert(not pcall(debug.upvaluejoin, print, 1, foo2, 1)) -assert(not pcall(debug.upvaluejoin, {}, 1, foo2, 1)) -assert(not pcall(debug.upvaluejoin, foo1, 1, print, 1)) - -print'OK' diff --git a/lua-5.4.4-tests/code.lua b/lua-5.4.4-tests/code.lua deleted file mode 100644 index 543743f..0000000 --- a/lua-5.4.4-tests/code.lua +++ /dev/null @@ -1,449 +0,0 @@ --- $Id: testes/code.lua $ --- See Copyright Notice in file all.lua - -if T==nil then - (Message or print)('\n >>> testC not active: skipping opcode tests <<<\n') - return -end -print "testing code generation and optimizations" - --- to test constant propagation -local k0aux = 0 -local k0 = k0aux -local k1 = 1 -local k3 = 3 -local k6 = k3 + (k3 << k0) -local kFF0 = 0xFF0 -local k3_78 = 3.78 -local x, k3_78_4 = 10, k3_78 / 4 -assert(x == 10) - -local kx = "x" - -local kTrue = true -local kFalse = false - -local kNil = nil - --- this code gave an error for the code checker -do - local function f (a) - for k,v,w in a do end - end -end - - --- testing reuse in constant table -local function checkKlist (func, list) - local k = T.listk(func) - assert(#k == #list) - for i = 1, #k do - assert(k[i] == list[i] and math.type(k[i]) == math.type(list[i])) - end -end - -local function foo () - local a - a = k3; - a = 0; a = 0.0; a = -7 + 7 - a = k3_78/4; a = k3_78_4 - a = -k3_78/4; a = k3_78/4; a = -3.78/4 - a = -3.79/4; a = 0.0; a = -0; - a = k3; a = 3.0; a = 3; a = 3.0 -end - -checkKlist(foo, {3.78/4, -3.78/4, -3.79/4}) - - -foo = function (f, a) - f(100 * 1000) - f(100.0 * 1000) - f(-100 * 1000) - f(-100 * 1000.0) - f(100000) - f(100000.0) - f(-100000) - f(-100000.0) - end - -checkKlist(foo, {100000, 100000.0, -100000, -100000.0}) - - --- floats x integers -foo = function (t, a) - t[a] = 1; t[a] = 1.0 - t[a] = 1; t[a] = 1.0 - t[a] = 2; t[a] = 2.0 - t[a] = 0; t[a] = 0.0 - t[a] = 1; t[a] = 1.0 - t[a] = 2; t[a] = 2.0 - t[a] = 0; t[a] = 0.0 -end - -checkKlist(foo, {1, 1.0, 2, 2.0, 0, 0.0}) - - --- testing opcodes - --- check that 'f' opcodes match '...' -function check (f, ...) - local arg = {...} - local c = T.listcode(f) - for i=1, #arg do - local opcode = string.match(c[i], "%u%w+") - -- print(arg[i], opcode) - assert(arg[i] == opcode) - end - assert(c[#arg+2] == undef) -end - - --- check that 'f' opcodes match '...' and that 'f(p) == r'. -function checkR (f, p, r, ...) - local r1 = f(p) - assert(r == r1 and math.type(r) == math.type(r1)) - check(f, ...) -end - - --- check that 'a' and 'b' has the same opcodes -function checkequal (a, b) - a = T.listcode(a) - b = T.listcode(b) - assert(#a == #b) - for i = 1, #a do - a[i] = string.gsub(a[i], '%b()', '') -- remove line number - b[i] = string.gsub(b[i], '%b()', '') -- remove line number - assert(a[i] == b[i]) - end -end - - --- some basic instructions -check(function () -- function does not create upvalues - (function () end){f()} -end, 'CLOSURE', 'NEWTABLE', 'EXTRAARG', 'GETTABUP', 'CALL', - 'SETLIST', 'CALL', 'RETURN0') - -check(function (x) -- function creates upvalues - (function () return x end){f()} -end, 'CLOSURE', 'NEWTABLE', 'EXTRAARG', 'GETTABUP', 'CALL', - 'SETLIST', 'CALL', 'RETURN') - - --- sequence of LOADNILs -check(function () - local kNil = nil - local a,b,c - local d; local e; - local f,g,h; - d = nil; d=nil; b=nil; a=kNil; c=nil; -end, 'LOADNIL', 'RETURN0') - -check(function () - local a,b,c,d = 1,1,1,1 - d=nil;c=nil;b=nil;a=nil -end, 'LOADI', 'LOADI', 'LOADI', 'LOADI', 'LOADNIL', 'RETURN0') - -do - local a,b,c,d = 1,1,1,1 - d=nil;c=nil;b=nil;a=nil - assert(a == nil and b == nil and c == nil and d == nil) -end - - --- single return -check (function (a,b,c) return a end, 'RETURN1') - - --- infinite loops -check(function () while kTrue do local a = -1 end end, -'LOADI', 'JMP', 'RETURN0') - -check(function () while 1 do local a = -1 end end, -'LOADI', 'JMP', 'RETURN0') - -check(function () repeat local x = 1 until true end, -'LOADI', 'RETURN0') - - --- concat optimization -check(function (a,b,c,d) return a..b..c..d end, - 'MOVE', 'MOVE', 'MOVE', 'MOVE', 'CONCAT', 'RETURN1') - --- not -check(function () return not not nil end, 'LOADFALSE', 'RETURN1') -check(function () return not not kFalse end, 'LOADFALSE', 'RETURN1') -check(function () return not not true end, 'LOADTRUE', 'RETURN1') -check(function () return not not k3 end, 'LOADTRUE', 'RETURN1') - --- direct access to locals -check(function () - local a,b,c,d - a = b*a - c.x, a[b] = -((a + d/b - a[b]) ^ a.x), b -end, - 'LOADNIL', - 'MUL', 'MMBIN', - 'DIV', 'MMBIN', 'ADD', 'MMBIN', 'GETTABLE', 'SUB', 'MMBIN', - 'GETFIELD', 'POW', 'MMBIN', 'UNM', 'SETTABLE', 'SETFIELD', 'RETURN0') - - --- direct access to constants -check(function () - local a,b - local c = kNil - a[kx] = 3.2 - a.x = b - a[b] = 'x' -end, - 'LOADNIL', 'SETFIELD', 'SETFIELD', 'SETTABLE', 'RETURN0') - --- "get/set table" with numeric indices -check(function (a) - local k255 = 255 - a[1] = a[100] - a[k255] = a[256] - a[256] = 5 -end, - 'GETI', 'SETI', - 'LOADI', 'GETTABLE', 'SETI', - 'LOADI', 'SETTABLE', 'RETURN0') - -check(function () - local a,b - a = a - a - b = a/a - b = 5-4 -end, - 'LOADNIL', 'SUB', 'MMBIN', 'DIV', 'MMBIN', 'LOADI', 'RETURN0') - -check(function () - local a,b - a[kTrue] = false -end, - 'LOADNIL', 'LOADTRUE', 'SETTABLE', 'RETURN0') - - --- equalities -checkR(function (a) if a == 1 then return 2 end end, 1, 2, - 'EQI', 'JMP', 'LOADI', 'RETURN1') - -checkR(function (a) if -4.0 == a then return 2 end end, -4, 2, - 'EQI', 'JMP', 'LOADI', 'RETURN1') - -checkR(function (a) if a == "hi" then return 2 end end, 10, nil, - 'EQK', 'JMP', 'LOADI', 'RETURN1') - -checkR(function (a) if a == 10000 then return 2 end end, 1, nil, - 'EQK', 'JMP', 'LOADI', 'RETURN1') -- number too large - -checkR(function (a) if -10000 == a then return 2 end end, -10000, 2, - 'EQK', 'JMP', 'LOADI', 'RETURN1') -- number too large - --- comparisons - -checkR(function (a) if -10 <= a then return 2 end end, -10, 2, - 'GEI', 'JMP', 'LOADI', 'RETURN1') - -checkR(function (a) if 128.0 > a then return 2 end end, 129, nil, - 'LTI', 'JMP', 'LOADI', 'RETURN1') - -checkR(function (a) if -127.0 < a then return 2 end end, -127, nil, - 'GTI', 'JMP', 'LOADI', 'RETURN1') - -checkR(function (a) if 10 < a then return 2 end end, 11, 2, - 'GTI', 'JMP', 'LOADI', 'RETURN1') - -checkR(function (a) if 129 < a then return 2 end end, 130, 2, - 'LOADI', 'LT', 'JMP', 'LOADI', 'RETURN1') - -checkR(function (a) if a >= 23.0 then return 2 end end, 25, 2, - 'GEI', 'JMP', 'LOADI', 'RETURN1') - -checkR(function (a) if a >= 23.1 then return 2 end end, 0, nil, - 'LOADK', 'LE', 'JMP', 'LOADI', 'RETURN1') - -checkR(function (a) if a > 2300.0 then return 2 end end, 0, nil, - 'LOADF', 'LT', 'JMP', 'LOADI', 'RETURN1') - - --- constant folding -local function checkK (func, val) - check(func, 'LOADK', 'RETURN1') - checkKlist(func, {val}) - assert(func() == val) -end - -local function checkI (func, val) - check(func, 'LOADI', 'RETURN1') - checkKlist(func, {}) - assert(func() == val) -end - -local function checkF (func, val) - check(func, 'LOADF', 'RETURN1') - checkKlist(func, {}) - assert(func() == val) -end - -checkF(function () return 0.0 end, 0.0) -checkI(function () return k0 end, 0) -checkI(function () return -k0//1 end, 0) -checkK(function () return 3^-1 end, 1/3) -checkK(function () return (1 + 1)^(50 + 50) end, 2^100) -checkK(function () return (-2)^(31 - 2) end, -0x20000000 + 0.0) -checkF(function () return (-k3^0 + 5) // 3.0 end, 1.0) -checkI(function () return -k3 % 5 end, 2) -checkF(function () return -((2.0^8 + -(-1)) % 8)/2 * 4 - 3 end, -5.0) -checkF(function () return -((2^8 + -(-1)) % 8)//2 * 4 - 3 end, -7.0) -checkI(function () return 0xF0.0 | 0xCC.0 ~ 0xAA & 0xFD end, 0xF4) -checkI(function () return ~(~kFF0 | kFF0) end, 0) -checkI(function () return ~~-1024.0 end, -1024) -checkI(function () return ((100 << k6) << -4) >> 2 end, 100) - --- borders around MAXARG_sBx ((((1 << 17) - 1) >> 1) == 65535) -local a = 17; local sbx = ((1 << a) - 1) >> 1 -- avoid folding -local border = 65535 -checkI(function () return border end, sbx) -checkI(function () return -border end, -sbx) -checkI(function () return border + 1 end, sbx + 1) -checkK(function () return border + 2 end, sbx + 2) -checkK(function () return -(border + 1) end, -(sbx + 1)) - -local border = 65535.0 -checkF(function () return border end, sbx + 0.0) -checkF(function () return -border end, -sbx + 0.0) -checkF(function () return border + 1 end, (sbx + 1.0)) -checkK(function () return border + 2 end, (sbx + 2.0)) -checkK(function () return -(border + 1) end, -(sbx + 1.0)) - - --- immediate operands -checkR(function (x) return x + k1 end, 10, 11, 'ADDI', 'MMBINI', 'RETURN1') -checkR(function (x) return x - 127 end, 10, -117, 'ADDI', 'MMBINI', 'RETURN1') -checkR(function (x) return 128 + x end, 0.0, 128.0, - 'ADDI', 'MMBINI', 'RETURN1') -checkR(function (x) return x * -127 end, -1.0, 127.0, - 'MULK', 'MMBINK', 'RETURN1') -checkR(function (x) return 20 * x end, 2, 40, 'MULK', 'MMBINK', 'RETURN1') -checkR(function (x) return x ^ -2 end, 2, 0.25, 'POWK', 'MMBINK', 'RETURN1') -checkR(function (x) return x / 40 end, 40, 1.0, 'DIVK', 'MMBINK', 'RETURN1') -checkR(function (x) return x // 1 end, 10.0, 10.0, - 'IDIVK', 'MMBINK', 'RETURN1') -checkR(function (x) return x % (100 - 10) end, 91, 1, - 'MODK', 'MMBINK', 'RETURN1') -checkR(function (x) return k1 << x end, 3, 8, 'SHLI', 'MMBINI', 'RETURN1') -checkR(function (x) return x << 127 end, 10, 0, 'SHRI', 'MMBINI', 'RETURN1') -checkR(function (x) return x << -127 end, 10, 0, 'SHRI', 'MMBINI', 'RETURN1') -checkR(function (x) return x >> 128 end, 8, 0, 'SHRI', 'MMBINI', 'RETURN1') -checkR(function (x) return x >> -127 end, 8, 0, 'SHRI', 'MMBINI', 'RETURN1') -checkR(function (x) return x & 1 end, 9, 1, 'BANDK', 'MMBINK', 'RETURN1') -checkR(function (x) return 10 | x end, 1, 11, 'BORK', 'MMBINK', 'RETURN1') -checkR(function (x) return -10 ~ x end, -1, 9, 'BXORK', 'MMBINK', 'RETURN1') - --- K operands in arithmetic operations -checkR(function (x) return x + 0.0 end, 1, 1.0, 'ADDK', 'MMBINK', 'RETURN1') --- check(function (x) return 128 + x end, 'ADDK', 'MMBINK', 'RETURN1') -checkR(function (x) return x * -10000 end, 2, -20000, - 'MULK', 'MMBINK', 'RETURN1') --- check(function (x) return 20 * x end, 'MULK', 'MMBINK', 'RETURN1') -checkR(function (x) return x ^ 0.5 end, 4, 2.0, 'POWK', 'MMBINK', 'RETURN1') -checkR(function (x) return x / 2.0 end, 4, 2.0, 'DIVK', 'MMBINK', 'RETURN1') -checkR(function (x) return x // 10000 end, 10000, 1, - 'IDIVK', 'MMBINK', 'RETURN1') -checkR(function (x) return x % (100.0 - 10) end, 91, 1.0, - 'MODK', 'MMBINK', 'RETURN1') - --- no foldings (and immediate operands) -check(function () return -0.0 end, 'LOADF', 'UNM', 'RETURN1') -check(function () return k3/0 end, 'LOADI', 'DIVK', 'MMBINK', 'RETURN1') -check(function () return 0%0 end, 'LOADI', 'MODK', 'MMBINK', 'RETURN1') -check(function () return -4//0 end, 'LOADI', 'IDIVK', 'MMBINK', 'RETURN1') -check(function (x) return x >> 2.0 end, 'LOADF', 'SHR', 'MMBIN', 'RETURN1') -check(function (x) return x << 128 end, 'LOADI', 'SHL', 'MMBIN', 'RETURN1') -check(function (x) return x & 2.0 end, 'LOADF', 'BAND', 'MMBIN', 'RETURN1') - --- basic 'for' loops -check(function () for i = -10, 10.5 do end end, -'LOADI', 'LOADK', 'LOADI', 'FORPREP', 'FORLOOP', 'RETURN0') -check(function () for i = 0xfffffff, 10.0, 1 do end end, -'LOADK', 'LOADF', 'LOADI', 'FORPREP', 'FORLOOP', 'RETURN0') - --- bug in constant folding for 5.1 -check(function () return -nil end, 'LOADNIL', 'UNM', 'RETURN1') - - -check(function () - local a,b,c - b[c], a = c, b - b[a], a = c, b - a, b = c, a - a = a -end, - 'LOADNIL', - 'MOVE', 'MOVE', 'SETTABLE', - 'MOVE', 'MOVE', 'MOVE', 'SETTABLE', - 'MOVE', 'MOVE', 'MOVE', - -- no code for a = a - 'RETURN0') - - --- x == nil , x ~= nil --- checkequal(function (b) if (a==nil) then a=1 end; if a~=nil then a=1 end end, --- function () if (a==9) then a=1 end; if a~=9 then a=1 end end) - --- check(function () if a==nil then a='a' end end, --- 'GETTABUP', 'EQ', 'JMP', 'SETTABUP', 'RETURN') - -do -- tests for table access in upvalues - local t - check(function () t[kx] = t.y end, 'GETTABUP', 'SETTABUP') - check(function (a) t[a()] = t[a()] end, - 'MOVE', 'CALL', 'GETUPVAL', 'MOVE', 'CALL', - 'GETUPVAL', 'GETTABLE', 'SETTABLE') -end - --- de morgan -checkequal(function () local a; if not (a or b) then b=a end end, - function () local a; if (not a and not b) then b=a end end) - -checkequal(function (l) local a; return 0 <= a and a <= l end, - function (l) local a; return not (not(a >= 0) or not(a <= l)) end) - - --- if-break optimizations -check(function (a, b) - while a do - if b then break else a = a + 1 end - end - end, -'TEST', 'JMP', 'TEST', 'JMP', 'ADDI', 'MMBINI', 'JMP', 'RETURN0') - -checkequal(function () return 6 or true or nil end, - function () return k6 or kTrue or kNil end) - -checkequal(function () return 6 and true or nil end, - function () return k6 and kTrue or kNil end) - - -do -- string constants - local k0 = "00000000000000000000000000000000000000000000000000" - local function f1 () - local k = k0 - return function () - return function () return k end - end - end - - local f2 = f1() - local f3 = f2() - assert(f3() == k0) - checkK(f3, k0) - -- string is not needed by other functions - assert(T.listk(f1)[1] == nil) - assert(T.listk(f2)[1] == nil) -end - -print 'OK' - diff --git a/lua-5.4.4-tests/constructs.lua b/lua-5.4.4-tests/constructs.lua deleted file mode 100644 index a74a8c0..0000000 --- a/lua-5.4.4-tests/constructs.lua +++ /dev/null @@ -1,377 +0,0 @@ --- $Id: testes/constructs.lua $ --- See Copyright Notice in file all.lua - -;;print "testing syntax";; - -local debug = require "debug" - - -local function checkload (s, msg) - assert(string.find(select(2, load(s)), msg)) -end - --- testing semicollons -do ;;; end -; do ; a = 3; assert(a == 3) end; -; - - --- invalid operations should not raise errors when not executed -if false then a = 3 // 0; a = 0 % 0 end - - --- testing priorities - -assert(2^3^2 == 2^(3^2)); -assert(2^3*4 == (2^3)*4); -assert(2.0^-2 == 1/4 and -2^- -2 == - - -4); -assert(not nil and 2 and not(2>3 or 3<2)); -assert(-3-1-5 == 0+0-9); -assert(-2^2 == -4 and (-2)^2 == 4 and 2*2-3-1 == 0); -assert(-3%5 == 2 and -3+5 == 2) -assert(2*1+3/3 == 3 and 1+2 .. 3*1 == "33"); -assert(not(2+1 > 3*1) and "a".."b" > "a"); - -assert(0xF0 | 0xCC ~ 0xAA & 0xFD == 0xF4) -assert(0xFD & 0xAA ~ 0xCC | 0xF0 == 0xF4) -assert(0xF0 & 0x0F + 1 == 0x10) - -assert(3^4//2^3//5 == 2) - -assert(-3+4*5//2^3^2//9+4%10/3 == (-3)+(((4*5)//(2^(3^2)))//9)+((4%10)/3)) - -assert(not ((true or false) and nil)) -assert( true or false and nil) - --- old bug -assert((((1 or false) and true) or false) == true) -assert((((nil and true) or false) and true) == false) - -local a,b = 1,nil; -assert(-(1 or 2) == -1 and (1 and 2)+(-1.25 or -4) == 0.75); -x = ((b or a)+1 == 2 and (10 or a)+1 == 11); assert(x); -x = (((2<3) or 1) == true and (2<3 and 4) == 4); assert(x); - -x,y=1,2; -assert((x>y) and x or y == 2); -x,y=2,1; -assert((x>y) and x or y == 2); - -assert(1234567890 == tonumber('1234567890') and 1234567890+1 == 1234567891) - -do -- testing operators with diffent kinds of constants - -- operands to consider: - -- * fit in register - -- * constant doesn't fit in register - -- * floats with integral values - local operand = {3, 100, 5.0, -10, -5.0, 10000, -10000} - local operator = {"+", "-", "*", "/", "//", "%", "^", - "&", "|", "^", "<<", ">>", - "==", "~=", "<", ">", "<=", ">=",} - for _, op in ipairs(operator) do - local f = assert(load(string.format([[return function (x,y) - return x %s y - end]], op)))(); - for _, o1 in ipairs(operand) do - for _, o2 in ipairs(operand) do - local gab = f(o1, o2) - - _ENV.XX = o1 - code = string.format("return XX %s %s", op, o2) - res = assert(load(code))() - assert(res == gab) - - _ENV.XX = o2 - local code = string.format("return (%s) %s XX", o1, op) - local res = assert(load(code))() - assert(res == gab) - - code = string.format("return (%s) %s %s", o1, op, o2) - res = assert(load(code))() - assert(res == gab) - end - end - end -end - - --- silly loops -repeat until 1; repeat until true; -while false do end; while nil do end; - -do -- test old bug (first name could not be an `upvalue') - local a; function f(x) x={a=1}; x={x=1}; x={G=1} end -end - -function f (i) - if type(i) ~= 'number' then return i,'jojo'; end; - if i > 0 then return i, f(i-1); end; -end - -x = {f(3), f(5), f(10);}; -assert(x[1] == 3 and x[2] == 5 and x[3] == 10 and x[4] == 9 and x[12] == 1); -assert(x[nil] == nil) -x = {f'alo', f'xixi', nil}; -assert(x[1] == 'alo' and x[2] == 'xixi' and x[3] == nil); -x = {f'alo'..'xixi'}; -assert(x[1] == 'aloxixi') -x = {f{}} -assert(x[2] == 'jojo' and type(x[1]) == 'table') - - -local f = function (i) - if i < 10 then return 'a'; - elseif i < 20 then return 'b'; - elseif i < 30 then return 'c'; - end; -end - -assert(f(3) == 'a' and f(12) == 'b' and f(26) == 'c' and f(100) == nil) - -for i=1,1000 do break; end; -n=100; -i=3; -t = {}; -a=nil -while not a do - a=0; for i=1,n do for i=i,1,-1 do a=a+1; t[i]=1; end; end; -end -assert(a == n*(n+1)/2 and i==3); -assert(t[1] and t[n] and not t[0] and not t[n+1]) - -function f(b) - local x = 1; - repeat - local a; - if b==1 then local b=1; x=10; break - elseif b==2 then x=20; break; - elseif b==3 then x=30; - else local a,b,c,d=math.sin(1); x=x+1; - end - until x>=12; - return x; -end; - -assert(f(1) == 10 and f(2) == 20 and f(3) == 30 and f(4)==12) - - -local f = function (i) - if i < 10 then return 'a' - elseif i < 20 then return 'b' - elseif i < 30 then return 'c' - else return 8 - end -end - -assert(f(3) == 'a' and f(12) == 'b' and f(26) == 'c' and f(100) == 8) - -local a, b = nil, 23 -x = {f(100)*2+3 or a, a or b+2} -assert(x[1] == 19 and x[2] == 25) -x = {f=2+3 or a, a = b+2} -assert(x.f == 5 and x.a == 25) - -a={y=1} -x = {a.y} -assert(x[1] == 1) - -function f(i) - while 1 do - if i>0 then i=i-1; - else return; end; - end; -end; - -function g(i) - while 1 do - if i>0 then i=i-1 - else return end - end -end - -f(10); g(10); - -do - function f () return 1,2,3; end - local a, b, c = f(); - assert(a==1 and b==2 and c==3) - a, b, c = (f()); - assert(a==1 and b==nil and c==nil) -end - -local a,b = 3 and f(); -assert(a==1 and b==nil) - -function g() f(); return; end; -assert(g() == nil) -function g() return nil or f() end -a,b = g() -assert(a==1 and b==nil) - -print'+'; - -do -- testing constants - local prog = [[local x = 10]] - checkload(prog, "unknown attribute 'XXX'") - - checkload([[local xxx = 20; xxx = 10]], - ":1: attempt to assign to const variable 'xxx'") - - checkload([[ - local xx; - local xxx = 20; - local yyy; - local function foo () - local abc = xx + yyy + xxx; - return function () return function () xxx = yyy end end - end - ]], ":6: attempt to assign to const variable 'xxx'") - - checkload([[ - local x = nil - x = io.open() - ]], ":2: attempt to assign to const variable 'x'") -end - -f = [[ -return function ( a , b , c , d , e ) - local x = a >= b or c or ( d and e ) or nil - return x -end , { a = 1 , b = 2 >= 1 , } or { 1 }; -]] -f = string.gsub(f, "%s+", "\n"); -- force a SETLINE between opcodes -f,a = load(f)(); -assert(a.a == 1 and a.b) - -function g (a,b,c,d,e) - if not (a>=b or c or d and e or nil) then return 0; else return 1; end; -end - -function h (a,b,c,d,e) - while (a>=b or c or (d and e) or nil) do return 1; end; - return 0; -end; - -assert(f(2,1) == true and g(2,1) == 1 and h(2,1) == 1) -assert(f(1,2,'a') == 'a' and g(1,2,'a') == 1 and h(1,2,'a') == 1) -assert(f(1,2,'a') -~= -- force SETLINE before nil -nil, "") -assert(f(1,2,'a') == 'a' and g(1,2,'a') == 1 and h(1,2,'a') == 1) -assert(f(1,2,nil,1,'x') == 'x' and g(1,2,nil,1,'x') == 1 and - h(1,2,nil,1,'x') == 1) -assert(f(1,2,nil,nil,'x') == nil and g(1,2,nil,nil,'x') == 0 and - h(1,2,nil,nil,'x') == 0) -assert(f(1,2,nil,1,nil) == nil and g(1,2,nil,1,nil) == 0 and - h(1,2,nil,1,nil) == 0) - -assert(1 and 2<3 == true and 2<3 and 'a'<'b' == true) -x = 2<3 and not 3; assert(x==false) -x = 2<1 or (2>1 and 'a'); assert(x=='a') - - -do - local a; if nil then a=1; else a=2; end; -- this nil comes as PUSHNIL 2 - assert(a==2) -end - -function F(a) - assert(debug.getinfo(1, "n").name == 'F') - return a,2,3 -end - -a,b = F(1)~=nil; assert(a == true and b == nil); -a,b = F(nil)==nil; assert(a == true and b == nil) - ----------------------------------------------------------------- ------------------------------------------------------------------- - --- sometimes will be 0, sometimes will not... -_ENV.GLOB1 = math.random(0, 1) - --- basic expressions with their respective values -local basiccases = { - {"nil", nil}, - {"false", false}, - {"true", true}, - {"10", 10}, - {"(0==_ENV.GLOB1)", 0 == _ENV.GLOB1}, -} - -local prog - -if _ENV.GLOB1 == 0 then - basiccases[2][1] = "F" -- constant false - - prog = [[ - local F = false - if %s then IX = true end - return %s -]] -else - basiccases[4][1] = "k10" -- constant 10 - - prog = [[ - local k10 = 10 - if %s then IX = true end - return %s - ]] -end - -print('testing short-circuit optimizations (' .. _ENV.GLOB1 .. ')') - - --- operators with their respective values -local binops = { - {" and ", function (a,b) if not a then return a else return b end end}, - {" or ", function (a,b) if a then return a else return b end end}, -} - -local cases = {} - --- creates all combinations of '(cases[i] op cases[n-i])' plus --- 'not(cases[i] op cases[n-i])' (syntax + value) -local function createcases (n) - local res = {} - for i = 1, n - 1 do - for _, v1 in ipairs(cases[i]) do - for _, v2 in ipairs(cases[n - i]) do - for _, op in ipairs(binops) do - local t = { - "(" .. v1[1] .. op[1] .. v2[1] .. ")", - op[2](v1[2], v2[2]) - } - res[#res + 1] = t - res[#res + 1] = {"not" .. t[1], not t[2]} - end - end - end - end - return res -end - --- do not do too many combinations for soft tests -local level = _soft and 3 or 4 - -cases[1] = basiccases -for i = 2, level do cases[i] = createcases(i) end -print("+") - -local i = 0 -for n = 1, level do - for _, v in pairs(cases[n]) do - local s = v[1] - local p = load(string.format(prog, s, s), "") - IX = false - assert(p() == v[2] and IX == not not v[2]) - i = i + 1 - if i % 60000 == 0 then print('+') end - end -end ------------------------------------------------------------------- - --- testing some syntax errors (chosen through 'gcov') -checkload("for x do", "expected") -checkload("x:call", "expected") - -print'OK' diff --git a/lua-5.4.4-tests/coroutine.lua b/lua-5.4.4-tests/coroutine.lua deleted file mode 100644 index 76c9d6e..0000000 --- a/lua-5.4.4-tests/coroutine.lua +++ /dev/null @@ -1,1143 +0,0 @@ --- $Id: testes/coroutine.lua $ --- See Copyright Notice in file all.lua - -print "testing coroutines" - -local debug = require'debug' - -local f - -local main, ismain = coroutine.running() -assert(type(main) == "thread" and ismain) -assert(not coroutine.resume(main)) -assert(not coroutine.isyieldable(main) and not coroutine.isyieldable()) -assert(not pcall(coroutine.yield)) - - --- trivial errors -assert(not pcall(coroutine.resume, 0)) -assert(not pcall(coroutine.status, 0)) - - --- tests for multiple yield/resume arguments - -local function eqtab (t1, t2) - assert(#t1 == #t2) - for i = 1, #t1 do - local v = t1[i] - assert(t2[i] == v) - end -end - -_G.x = nil -- declare x -function foo (a, ...) - local x, y = coroutine.running() - assert(x == f and y == false) - -- next call should not corrupt coroutine (but must fail, - -- as it attempts to resume the running coroutine) - assert(coroutine.resume(f) == false) - assert(coroutine.status(f) == "running") - local arg = {...} - assert(coroutine.isyieldable(x)) - for i=1,#arg do - _G.x = {coroutine.yield(table.unpack(arg[i]))} - end - return table.unpack(a) -end - -f = coroutine.create(foo) -assert(coroutine.isyieldable(f)) -assert(type(f) == "thread" and coroutine.status(f) == "suspended") -assert(string.find(tostring(f), "thread")) -local s,a,b,c,d -s,a,b,c,d = coroutine.resume(f, {1,2,3}, {}, {1}, {'a', 'b', 'c'}) -assert(coroutine.isyieldable(f)) -assert(s and a == nil and coroutine.status(f) == "suspended") -s,a,b,c,d = coroutine.resume(f) -eqtab(_G.x, {}) -assert(s and a == 1 and b == nil) -assert(coroutine.isyieldable(f)) -s,a,b,c,d = coroutine.resume(f, 1, 2, 3) -eqtab(_G.x, {1, 2, 3}) -assert(s and a == 'a' and b == 'b' and c == 'c' and d == nil) -s,a,b,c,d = coroutine.resume(f, "xuxu") -eqtab(_G.x, {"xuxu"}) -assert(s and a == 1 and b == 2 and c == 3 and d == nil) -assert(coroutine.status(f) == "dead") -s, a = coroutine.resume(f, "xuxu") -assert(not s and string.find(a, "dead") and coroutine.status(f) == "dead") - - --- yields in tail calls -local function foo (i) return coroutine.yield(i) end -f = coroutine.wrap(function () - for i=1,10 do - assert(foo(i) == _G.x) - end - return 'a' -end) -for i=1,10 do _G.x = i; assert(f(i) == i) end -_G.x = 'xuxu'; assert(f('xuxu') == 'a') - --- recursive -function pf (n, i) - coroutine.yield(n) - pf(n*i, i+1) -end - -f = coroutine.wrap(pf) -local s=1 -for i=1,10 do - assert(f(1, 1) == s) - s = s*i -end - --- sieve -function gen (n) - return coroutine.wrap(function () - for i=2,n do coroutine.yield(i) end - end) -end - - -function filter (p, g) - return coroutine.wrap(function () - while 1 do - local n = g() - if n == nil then return end - if math.fmod(n, p) ~= 0 then coroutine.yield(n) end - end - end) -end - -local x = gen(80) -local a = {} -while 1 do - local n = x() - if n == nil then break end - table.insert(a, n) - x = filter(n, x) -end - -assert(#a == 22 and a[#a] == 79) -x, a = nil - - -print("to-be-closed variables in coroutines") - -local function func2close (f) - return setmetatable({}, {__close = f}) -end - -do - -- ok to close a dead coroutine - local co = coroutine.create(print) - assert(coroutine.resume(co, "testing 'coroutine.close'")) - assert(coroutine.status(co) == "dead") - local st, msg = coroutine.close(co) - assert(st and msg == nil) - -- also ok to close it again - st, msg = coroutine.close(co) - assert(st and msg == nil) - - - -- cannot close the running coroutine - local st, msg = pcall(coroutine.close, coroutine.running()) - assert(not st and string.find(msg, "running")) - - local main = coroutine.running() - - -- cannot close a "normal" coroutine - ;(coroutine.wrap(function () - local st, msg = pcall(coroutine.close, main) - assert(not st and string.find(msg, "normal")) - end))() - - -- cannot close a coroutine while closing it - do - local co - co = coroutine.create( - function() - local x = func2close(function() - coroutine.close(co) -- try to close it again - end) - coroutine.yield(20) - end) - local st, msg = coroutine.resume(co) - assert(st and msg == 20) - st, msg = coroutine.close(co) - assert(not st and string.find(msg, "running coroutine")) - end - - -- to-be-closed variables in coroutines - local X - - -- closing a coroutine after an error - local co = coroutine.create(error) - local st, msg = coroutine.resume(co, 100) - assert(not st and msg == 100) - st, msg = coroutine.close(co) - assert(not st and msg == 100) - -- after closing, no more errors - st, msg = coroutine.close(co) - assert(st and msg == nil) - - co = coroutine.create(function () - local x = func2close(function (self, err) - assert(err == nil); X = false - end) - X = true - coroutine.yield() - end) - coroutine.resume(co) - assert(X) - assert(coroutine.close(co)) - assert(not X and coroutine.status(co) == "dead") - - -- error closing a coroutine - local x = 0 - co = coroutine.create(function() - local y = func2close(function (self,err) - assert(err == 111) - x = 200 - error(200) - end) - local x = func2close(function (self, err) - assert(err == nil); error(111) - end) - coroutine.yield() - end) - coroutine.resume(co) - assert(x == 0) - local st, msg = coroutine.close(co) - assert(st == false and coroutine.status(co) == "dead" and msg == 200) - assert(x == 200) - -- after closing, no more errors - st, msg = coroutine.close(co) - assert(st and msg == nil) -end - -do - -- versus pcall in coroutines - local X = false - local Y = false - function foo () - local x = func2close(function (self, err) - Y = debug.getinfo(2) - X = err - end) - error(43) - end - co = coroutine.create(function () return pcall(foo) end) - local st1, st2, err = coroutine.resume(co) - assert(st1 and not st2 and err == 43) - assert(X == 43 and Y.what == "C") - - -- recovering from errors in __close metamethods - local track = {} - - local function h (o) - local hv = o - return 1 - end - - local function foo () - local x = func2close(function(_,msg) - track[#track + 1] = msg or false - error(20) - end) - local y = func2close(function(_,msg) - track[#track + 1] = msg or false - return 1000 - end) - local z = func2close(function(_,msg) - track[#track + 1] = msg or false - error(10) - end) - coroutine.yield(1) - h(func2close(function(_,msg) - track[#track + 1] = msg or false - error(2) - end)) - end - - local co = coroutine.create(pcall) - - local st, res = coroutine.resume(co, foo) -- call 'foo' protected - assert(st and res == 1) -- yield 1 - local st, res1, res2 = coroutine.resume(co) -- continue - assert(coroutine.status(co) == "dead") - assert(st and not res1 and res2 == 20) -- last error (20) - assert(track[1] == false and track[2] == 2 and track[3] == 10 and - track[4] == 10) -end - - --- yielding across C boundaries - -co = coroutine.wrap(function() - assert(not pcall(table.sort,{1,2,3}, coroutine.yield)) - assert(coroutine.isyieldable()) - coroutine.yield(20) - return 30 - end) - -assert(co() == 20) -assert(co() == 30) - - -local f = function (s, i) return coroutine.yield(i) end - -local f1 = coroutine.wrap(function () - return xpcall(pcall, function (...) return ... end, - function () - local s = 0 - for i in f, nil, 1 do pcall(function () s = s + i end) end - error({s}) - end) - end) - -f1() -for i = 1, 10 do assert(f1(i) == i) end -local r1, r2, v = f1(nil) -assert(r1 and not r2 and v[1] == (10 + 1)*10/2) - - -function f (a, b) a = coroutine.yield(a); error{a + b} end -function g(x) return x[1]*2 end - -co = coroutine.wrap(function () - coroutine.yield(xpcall(f, g, 10, 20)) - end) - -assert(co() == 10) -r, msg = co(100) -assert(not r and msg == 240) - - --- unyieldable C call -do - local function f (c) - assert(not coroutine.isyieldable()) - return c .. c - end - - local co = coroutine.wrap(function (c) - assert(coroutine.isyieldable()) - local s = string.gsub("a", ".", f) - return s - end) - assert(co() == "aa") -end - - - -do -- testing single trace of coroutines - local X - local co = coroutine.create(function () - coroutine.yield(10) - return 20; - end) - local trace = {} - local function dotrace (event) - trace[#trace + 1] = event - end - debug.sethook(co, dotrace, "clr") - repeat until not coroutine.resume(co) - local correcttrace = {"call", "line", "call", "return", "line", "return"} - assert(#trace == #correcttrace) - for k, v in pairs(trace) do - assert(v == correcttrace[k]) - end -end - --- errors in coroutines -function foo () - assert(debug.getinfo(1).currentline == debug.getinfo(foo).linedefined + 1) - assert(debug.getinfo(2).currentline == debug.getinfo(goo).linedefined) - coroutine.yield(3) - error(foo) -end - -function goo() foo() end -x = coroutine.wrap(goo) -assert(x() == 3) -local a,b = pcall(x) -assert(not a and b == foo) - -x = coroutine.create(goo) -a,b = coroutine.resume(x) -assert(a and b == 3) -a,b = coroutine.resume(x) -assert(not a and b == foo and coroutine.status(x) == "dead") -a,b = coroutine.resume(x) -assert(not a and string.find(b, "dead") and coroutine.status(x) == "dead") - - --- co-routines x for loop -function all (a, n, k) - if k == 0 then coroutine.yield(a) - else - for i=1,n do - a[k] = i - all(a, n, k-1) - end - end -end - -local a = 0 -for t in coroutine.wrap(function () all({}, 5, 4) end) do - a = a+1 -end -assert(a == 5^4) - - --- access to locals of collected corroutines -local C = {}; setmetatable(C, {__mode = "kv"}) -local x = coroutine.wrap (function () - local a = 10 - local function f () a = a+10; return a end - while true do - a = a+1 - coroutine.yield(f) - end - end) - -C[1] = x; - -local f = x() -assert(f() == 21 and x()() == 32 and x() == f) -x = nil -collectgarbage() -assert(C[1] == undef) -assert(f() == 43 and f() == 53) - - --- old bug: attempt to resume itself - -function co_func (current_co) - assert(coroutine.running() == current_co) - assert(coroutine.resume(current_co) == false) - coroutine.yield(10, 20) - assert(coroutine.resume(current_co) == false) - coroutine.yield(23) - return 10 -end - -local co = coroutine.create(co_func) -local a,b,c = coroutine.resume(co, co) -assert(a == true and b == 10 and c == 20) -a,b = coroutine.resume(co, co) -assert(a == true and b == 23) -a,b = coroutine.resume(co, co) -assert(a == true and b == 10) -assert(coroutine.resume(co, co) == false) -assert(coroutine.resume(co, co) == false) - - --- other old bug when attempting to resume itself --- (trigger C-code assertions) -do - local A = coroutine.running() - local B = coroutine.create(function() return coroutine.resume(A) end) - local st, res = coroutine.resume(B) - assert(st == true and res == false) - - local X = false - A = coroutine.wrap(function() - local _ = func2close(function () X = true end) - return pcall(A, 1) - end) - st, res = A() - assert(not st and string.find(res, "non%-suspended") and X == true) -end - - --- bug in 5.4.1 -do - -- coroutine ran close metamethods with invalid status during a - -- reset. - local co - co = coroutine.wrap(function() - local x = func2close(function() return pcall(co) end) - error(111) - end) - local st, errobj = pcall(co) - assert(not st and errobj == 111) - st, errobj = pcall(co) - assert(not st and string.find(errobj, "dead coroutine")) -end - - --- attempt to resume 'normal' coroutine -local co1, co2 -co1 = coroutine.create(function () return co2() end) -co2 = coroutine.wrap(function () - assert(coroutine.status(co1) == 'normal') - assert(not coroutine.resume(co1)) - coroutine.yield(3) - end) - -a,b = coroutine.resume(co1) -assert(a and b == 3) -assert(coroutine.status(co1) == 'dead') - --- infinite recursion of coroutines -a = function(a) coroutine.wrap(a)(a) end -assert(not pcall(a, a)) -a = nil - - --- access to locals of erroneous coroutines -local x = coroutine.create (function () - local a = 10 - _G.f = function () a=a+1; return a end - error('x') - end) - -assert(not coroutine.resume(x)) --- overwrite previous position of local `a' -assert(not coroutine.resume(x, 1, 1, 1, 1, 1, 1, 1)) -assert(_G.f() == 11) -assert(_G.f() == 12) - - -if not T then - (Message or print) - ('\n >>> testC not active: skipping coroutine API tests <<<\n') -else - print "testing yields inside hooks" - - local turn - - function fact (t, x) - assert(turn == t) - if x == 0 then return 1 - else return x*fact(t, x-1) - end - end - - local A, B = 0, 0 - - local x = coroutine.create(function () - T.sethook("yield 0", "", 2) - A = fact("A", 6) - end) - - local y = coroutine.create(function () - T.sethook("yield 0", "", 3) - B = fact("B", 7) - end) - - while A==0 or B==0 do -- A ~= 0 when 'x' finishes (similar for 'B','y') - if A==0 then turn = "A"; assert(T.resume(x)) end - if B==0 then turn = "B"; assert(T.resume(y)) end - - -- check that traceback works correctly after yields inside hooks - debug.traceback(x) - debug.traceback(y) - end - - assert(B // A == 7) -- fact(7) // fact(6) - - do -- hooks vs. multiple values - local done - local function test (n) - done = false - return coroutine.wrap(function () - local a = {} - for i = 1, n do a[i] = i end - -- 'pushint' just to perturb the stack - T.sethook("pushint 10; yield 0", "", 1) -- yield at each op. - local a1 = {table.unpack(a)} -- must keep top between ops. - assert(#a1 == n) - for i = 1, n do assert(a[i] == i) end - done = true - end) - end - -- arguments to the coroutine are just to perturb its stack - local co = test(0); while not done do co(30) end - co = test(1); while not done do co(20, 10) end - co = test(3); while not done do co() end - co = test(100); while not done do co() end - end - - local line = debug.getinfo(1, "l").currentline + 2 -- get line number - local function foo () - local x = 10 --<< this line is 'line' - x = x + 10 - _G.XX = x - end - - -- testing yields in line hook - local co = coroutine.wrap(function () - T.sethook("setglobal X; yield 0", "l", 0); foo(); return 10 end) - - _G.XX = nil; - _G.X = nil; co(); assert(_G.X == line) - _G.X = nil; co(); assert(_G.X == line + 1) - _G.X = nil; co(); assert(_G.X == line + 2 and _G.XX == nil) - _G.X = nil; co(); assert(_G.X == line + 3 and _G.XX == 20) - assert(co() == 10) - - -- testing yields in count hook - co = coroutine.wrap(function () - T.sethook("yield 0", "", 1); foo(); return 10 end) - - _G.XX = nil; - local c = 0 - repeat c = c + 1; local a = co() until a == 10 - assert(_G.XX == 20 and c >= 5) - - co = coroutine.wrap(function () - T.sethook("yield 0", "", 2); foo(); return 10 end) - - _G.XX = nil; - local c = 0 - repeat c = c + 1; local a = co() until a == 10 - assert(_G.XX == 20 and c >= 5) - _G.X = nil; _G.XX = nil - - do - -- testing debug library on a coroutine suspended inside a hook - -- (bug in 5.2/5.3) - c = coroutine.create(function (a, ...) - T.sethook("yield 0", "l") -- will yield on next two lines - assert(a == 10) - return ... - end) - - assert(coroutine.resume(c, 1, 2, 3)) -- start coroutine - local n,v = debug.getlocal(c, 0, 1) -- check its local - assert(n == "a" and v == 1) - assert(debug.setlocal(c, 0, 1, 10)) -- test 'setlocal' - local t = debug.getinfo(c, 0) -- test 'getinfo' - assert(t.currentline == t.linedefined + 1) - assert(not debug.getinfo(c, 1)) -- no other level - assert(coroutine.resume(c)) -- run next line - v = {coroutine.resume(c)} -- finish coroutine - assert(v[1] == true and v[2] == 2 and v[3] == 3 and v[4] == undef) - assert(not coroutine.resume(c)) - end - - do - -- testing debug library on last function in a suspended coroutine - -- (bug in 5.2/5.3) - local c = coroutine.create(function () T.testC("yield 1", 10, 20) end) - local a, b = coroutine.resume(c) - assert(a and b == 20) - assert(debug.getinfo(c, 0).linedefined == -1) - a, b = debug.getlocal(c, 0, 2) - assert(b == 10) - end - - - print "testing coroutine API" - - -- reusing a thread - assert(T.testC([[ - newthread # create thread - pushvalue 2 # push body - pushstring 'a a a' # push argument - xmove 0 3 2 # move values to new thread - resume -1, 1 # call it first time - pushstatus - xmove 3 0 0 # move results back to stack - setglobal X # result - setglobal Y # status - pushvalue 2 # push body (to call it again) - pushstring 'b b b' - xmove 0 3 2 - resume -1, 1 # call it again - pushstatus - xmove 3 0 0 - return 1 # return result - ]], function (...) return ... end) == 'b b b') - - assert(X == 'a a a' and Y == 'OK') - - - -- resuming running coroutine - C = coroutine.create(function () - return T.testC([[ - pushnum 10; - pushnum 20; - resume -3 2; - pushstatus - gettop; - return 3]], C) - end) - local a, b, c, d = coroutine.resume(C) - assert(a == true and string.find(b, "non%-suspended") and - c == "ERRRUN" and d == 4) - - a, b, c, d = T.testC([[ - rawgeti R 1 # get main thread - pushnum 10; - pushnum 20; - resume -3 2; - pushstatus - gettop; - return 4]]) - assert(a == coroutine.running() and string.find(b, "non%-suspended") and - c == "ERRRUN" and d == 4) - - - -- using a main thread as a coroutine (dubious use!) - local state = T.newstate() - - -- check that yielddable is working correctly - assert(T.testC(state, "newthread; isyieldable -1; remove 1; return 1")) - - -- main thread is not yieldable - assert(not T.testC(state, "rawgeti R 1; isyieldable -1; remove 1; return 1")) - - T.testC(state, "settop 0") - - T.loadlib(state) - - assert(T.doremote(state, [[ - coroutine = require'coroutine'; - X = function (x) coroutine.yield(x, 'BB'); return 'CC' end; - return 'ok']])) - - t = table.pack(T.testC(state, [[ - rawgeti R 1 # get main thread - pushstring 'XX' - getglobal X # get function for body - pushstring AA # arg - resume 1 1 # 'resume' shadows previous stack! - gettop - setglobal T # top - setglobal B # second yielded value - setglobal A # fist yielded value - rawgeti R 1 # get main thread - pushnum 5 # arg (noise) - resume 1 1 # after coroutine ends, previous stack is back - pushstatus - return * - ]])) - assert(t.n == 4 and t[2] == 'XX' and t[3] == 'CC' and t[4] == 'OK') - assert(T.doremote(state, "return T") == '2') - assert(T.doremote(state, "return A") == 'AA') - assert(T.doremote(state, "return B") == 'BB') - - T.closestate(state) - - print'+' - -end - - --- leaving a pending coroutine open -_X = coroutine.wrap(function () - local a = 10 - local x = function () a = a+1 end - coroutine.yield() - end) - -_X() - - -if not _soft then - -- bug (stack overflow) - local j = 2^9 - local lim = 1000000 -- (C stack limit; assume 32-bit machine) - local t = {lim - 10, lim - 5, lim - 1, lim, lim + 1} - for i = 1, #t do - local j = t[i] - co = coroutine.create(function() - local t = {} - for i = 1, j do t[i] = i end - return table.unpack(t) - end) - local r, msg = coroutine.resume(co) - assert(not r) - end - co = nil -end - - -assert(coroutine.running() == main) - -print"+" - - -print"testing yields inside metamethods" - -local function val(x) - if type(x) == "table" then return x.x else return x end -end - -local mt = { - __eq = function(a,b) coroutine.yield(nil, "eq"); return val(a) == val(b) end, - __lt = function(a,b) coroutine.yield(nil, "lt"); return val(a) < val(b) end, - __le = function(a,b) coroutine.yield(nil, "le"); return a - b <= 0 end, - __add = function(a,b) coroutine.yield(nil, "add"); - return val(a) + val(b) end, - __sub = function(a,b) coroutine.yield(nil, "sub"); return val(a) - val(b) end, - __mul = function(a,b) coroutine.yield(nil, "mul"); return val(a) * val(b) end, - __div = function(a,b) coroutine.yield(nil, "div"); return val(a) / val(b) end, - __idiv = function(a,b) coroutine.yield(nil, "idiv"); - return val(a) // val(b) end, - __pow = function(a,b) coroutine.yield(nil, "pow"); return val(a) ^ val(b) end, - __mod = function(a,b) coroutine.yield(nil, "mod"); return val(a) % val(b) end, - __unm = function(a,b) coroutine.yield(nil, "unm"); return -val(a) end, - __bnot = function(a,b) coroutine.yield(nil, "bnot"); return ~val(a) end, - __shl = function(a,b) coroutine.yield(nil, "shl"); - return val(a) << val(b) end, - __shr = function(a,b) coroutine.yield(nil, "shr"); - return val(a) >> val(b) end, - __band = function(a,b) - coroutine.yield(nil, "band") - return val(a) & val(b) - end, - __bor = function(a,b) coroutine.yield(nil, "bor"); - return val(a) | val(b) end, - __bxor = function(a,b) coroutine.yield(nil, "bxor"); - return val(a) ~ val(b) end, - - __concat = function(a,b) - coroutine.yield(nil, "concat"); - return val(a) .. val(b) - end, - __index = function (t,k) coroutine.yield(nil, "idx"); return t.k[k] end, - __newindex = function (t,k,v) coroutine.yield(nil, "nidx"); t.k[k] = v end, -} - - -local function new (x) - return setmetatable({x = x, k = {}}, mt) -end - - -local a = new(10) -local b = new(12) -local c = new"hello" - -local function run (f, t) - local i = 1 - local c = coroutine.wrap(f) - while true do - local res, stat = c() - if res then assert(t[i] == undef); return res, t end - assert(stat == t[i]) - i = i + 1 - end -end - - -assert(run(function () if (a>=b) then return '>=' else return '<' end end, - {"le", "sub"}) == "<") -assert(run(function () if (a<=b) then return '<=' else return '>' end end, - {"le", "sub"}) == "<=") -assert(run(function () if (a==b) then return '==' else return '~=' end end, - {"eq"}) == "~=") - -assert(run(function () return a & b + a end, {"add", "band"}) == 2) - -assert(run(function () return 1 + a end, {"add"}) == 11) -assert(run(function () return a - 25 end, {"sub"}) == -15) -assert(run(function () return 2 * a end, {"mul"}) == 20) -assert(run(function () return a ^ 2 end, {"pow"}) == 100) -assert(run(function () return a / 2 end, {"div"}) == 5) -assert(run(function () return a % 6 end, {"mod"}) == 4) -assert(run(function () return a // 3 end, {"idiv"}) == 3) - -assert(run(function () return a + b end, {"add"}) == 22) -assert(run(function () return a - b end, {"sub"}) == -2) -assert(run(function () return a * b end, {"mul"}) == 120) -assert(run(function () return a ^ b end, {"pow"}) == 10^12) -assert(run(function () return a / b end, {"div"}) == 10/12) -assert(run(function () return a % b end, {"mod"}) == 10) -assert(run(function () return a // b end, {"idiv"}) == 0) - --- repeat tests with larger constants (to use 'K' opcodes) -local a1000 = new(1000) - -assert(run(function () return a1000 + 1000 end, {"add"}) == 2000) -assert(run(function () return a1000 - 25000 end, {"sub"}) == -24000) -assert(run(function () return 2000 * a end, {"mul"}) == 20000) -assert(run(function () return a1000 / 1000 end, {"div"}) == 1) -assert(run(function () return a1000 % 600 end, {"mod"}) == 400) -assert(run(function () return a1000 // 500 end, {"idiv"}) == 2) - - - -assert(run(function () return a % b end, {"mod"}) == 10) - -assert(run(function () return ~a & b end, {"bnot", "band"}) == ~10 & 12) -assert(run(function () return a | b end, {"bor"}) == 10 | 12) -assert(run(function () return a ~ b end, {"bxor"}) == 10 ~ 12) -assert(run(function () return a << b end, {"shl"}) == 10 << 12) -assert(run(function () return a >> b end, {"shr"}) == 10 >> 12) - -assert(run(function () return 10 & b end, {"band"}) == 10 & 12) -assert(run(function () return a | 2 end, {"bor"}) == 10 | 2) -assert(run(function () return a ~ 2 end, {"bxor"}) == 10 ~ 2) -assert(run(function () return a >> 2 end, {"shr"}) == 10 >> 2) -assert(run(function () return 1 >> a end, {"shr"}) == 1 >> 10) -assert(run(function () return a << 2 end, {"shl"}) == 10 << 2) -assert(run(function () return 1 << a end, {"shl"}) == 1 << 10) -assert(run(function () return 2 ~ a end, {"bxor"}) == 2 ~ 10) - - -assert(run(function () return a..b end, {"concat"}) == "1012") - -assert(run(function() return a .. b .. c .. a end, - {"concat", "concat", "concat"}) == "1012hello10") - -assert(run(function() return "a" .. "b" .. a .. "c" .. c .. b .. "x" end, - {"concat", "concat", "concat"}) == "ab10chello12x") - - -do -- a few more tests for comparison operators - local mt1 = { - __le = function (a,b) - coroutine.yield(10) - return (val(a) <= val(b)) - end, - __lt = function (a,b) - coroutine.yield(10) - return val(a) < val(b) - end, - } - local mt2 = { __lt = mt1.__lt, __le = mt1.__le } - - local function run (f) - local co = coroutine.wrap(f) - local res - repeat - res = co() - until res ~= 10 - return res - end - - local function test () - local a1 = setmetatable({x=1}, mt1) - local a2 = setmetatable({x=2}, mt2) - assert(a1 < a2) - assert(a1 <= a2) - assert(1 < a2) - assert(1 <= a2) - assert(2 > a1) - assert(2 >= a2) - return true - end - - run(test) - -end - -assert(run(function () - a.BB = print - return a.BB - end, {"nidx", "idx"}) == print) - --- getuptable & setuptable -do local _ENV = _ENV - f = function () AAA = BBB + 1; return AAA end -end -g = new(10); g.k.BBB = 10; -debug.setupvalue(f, 1, g) -assert(run(f, {"idx", "nidx", "idx"}) == 11) -assert(g.k.AAA == 11) - -print"+" - -print"testing yields inside 'for' iterators" - -local f = function (s, i) - if i%2 == 0 then coroutine.yield(nil, "for") end - if i < s then return i + 1 end - end - -assert(run(function () - local s = 0 - for i in f, 4, 0 do s = s + i end - return s - end, {"for", "for", "for"}) == 10) - - - --- tests for coroutine API -if T==nil then - (Message or print)('\n >>> testC not active: skipping coroutine API tests <<<\n') - print "OK"; return -end - -print('testing coroutine API') - -local function apico (...) - local x = {...} - return coroutine.wrap(function () - return T.testC(table.unpack(x)) - end) -end - -local a = {apico( -[[ - pushstring errorcode - pcallk 1 0 2; - invalid command (should not arrive here) -]], -[[return *]], -"stackmark", -error -)()} -assert(#a == 4 and - a[3] == "stackmark" and - a[4] == "errorcode" and - _G.status == "ERRRUN" and - _G.ctx == 2) -- 'ctx' to pcallk - -local co = apico( - "pushvalue 2; pushnum 10; pcallk 1 2 3; invalid command;", - coroutine.yield, - "getglobal status; getglobal ctx; pushvalue 2; pushstring a; pcallk 1 0 4; invalid command", - "getglobal status; getglobal ctx; return *") - -assert(co() == 10) -assert(co(20, 30) == 'a') -a = {co()} -assert(#a == 10 and - a[2] == coroutine.yield and - a[5] == 20 and a[6] == 30 and - a[7] == "YIELD" and a[8] == 3 and - a[9] == "YIELD" and a[10] == 4) -assert(not pcall(co)) -- coroutine is dead now - - -f = T.makeCfunc("pushnum 3; pushnum 5; yield 1;") -co = coroutine.wrap(function () - assert(f() == 23); assert(f() == 23); return 10 -end) -assert(co(23,16) == 5) -assert(co(23,16) == 5) -assert(co(23,16) == 10) - - --- testing coroutines with C bodies -f = T.makeCfunc([[ - pushnum 102 - yieldk 1 U2 - cannot be here! -]], -[[ # continuation - pushvalue U3 # accessing upvalues inside a continuation - pushvalue U4 - return * -]], 23, "huu") - -x = coroutine.wrap(f) -assert(x() == 102) -eqtab({x()}, {23, "huu"}) - - -f = T.makeCfunc[[pushstring 'a'; pushnum 102; yield 2; ]] - -a, b, c, d = T.testC([[newthread; pushvalue 2; xmove 0 3 1; resume 3 0; - pushstatus; xmove 3 0 0; resume 3 0; pushstatus; - return 4; ]], f) - -assert(a == 'YIELD' and b == 'a' and c == 102 and d == 'OK') - - --- testing chain of suspendable C calls - -local count = 3 -- number of levels - -f = T.makeCfunc([[ - remove 1; # remove argument - pushvalue U3; # get selection function - call 0 1; # call it (result is 'f' or 'yield') - pushstring hello # single argument for selected function - pushupvalueindex 2; # index of continuation program - callk 1 -1 .; # call selected function - errorerror # should never arrive here -]], -[[ - # continuation program - pushnum 34 # return value - return * # return all results -]], -function () -- selection function - count = count - 1 - if count == 0 then return coroutine.yield - else return f - end -end -) - -co = coroutine.wrap(function () return f(nil) end) -assert(co() == "hello") -- argument to 'yield' -a = {co()} --- three '34's (one from each pending C call) -assert(#a == 3 and a[1] == a[2] and a[2] == a[3] and a[3] == 34) - - --- testing yields with continuations - -co = coroutine.wrap(function (...) return - T.testC([[ # initial function - yieldk 1 2 - cannot be here! - ]], - [[ # 1st continuation - yieldk 0 3 - cannot be here! - ]], - [[ # 2nd continuation - yieldk 0 4 - cannot be here! - ]], - [[ # 3th continuation - pushvalue 6 # function which is last arg. to 'testC' here - pushnum 10; pushnum 20; - pcall 2 0 0 # call should throw an error and return to next line - pop 1 # remove error message - pushvalue 6 - getglobal status; getglobal ctx - pcallk 2 2 5 # call should throw an error and jump to continuation - cannot be here! - ]], - [[ # 4th (and last) continuation - return * - ]], - -- function called by 3th continuation - function (a,b) x=a; y=b; error("errmsg") end, - ... -) -end) - -local a = {co(3,4,6)} -assert(a[1] == 6 and a[2] == undef) -a = {co()}; assert(a[1] == undef and _G.status == "YIELD" and _G.ctx == 2) -a = {co()}; assert(a[1] == undef and _G.status == "YIELD" and _G.ctx == 3) -a = {co(7,8)}; --- original arguments -assert(type(a[1]) == 'string' and type(a[2]) == 'string' and - type(a[3]) == 'string' and type(a[4]) == 'string' and - type(a[5]) == 'string' and type(a[6]) == 'function') --- arguments left from fist resume -assert(a[7] == 3 and a[8] == 4) --- arguments to last resume -assert(a[9] == 7 and a[10] == 8) --- error message and nothing more -assert(a[11]:find("errmsg") and #a == 11) --- check arguments to pcallk -assert(x == "YIELD" and y == 4) - -assert(not pcall(co)) -- coroutine should be dead - - --- bug in nCcalls -local co = coroutine.wrap(function () - local a = {pcall(pcall,pcall,pcall,pcall,pcall,pcall,pcall,error,"hi")} - return pcall(assert, table.unpack(a)) -end) - -local a = {co()} -assert(a[10] == "hi") - -print'OK' diff --git a/lua-5.4.4-tests/cstack.lua b/lua-5.4.4-tests/cstack.lua deleted file mode 100644 index ca76c87..0000000 --- a/lua-5.4.4-tests/cstack.lua +++ /dev/null @@ -1,171 +0,0 @@ --- $Id: testes/cstack.lua $ --- See Copyright Notice in file all.lua - - -local tracegc = require"tracegc" - -print"testing stack overflow detection" - --- Segmentation faults in these tests probably result from a C-stack --- overflow. To avoid these errors, you should set a smaller limit for --- the use of C stack by Lua, by changing the constant 'LUAI_MAXCCALLS'. --- Alternatively, you can ensure a larger stack for the program. - - -local function checkerror (msg, f, ...) - local s, err = pcall(f, ...) - assert(not s and string.find(err, msg)) -end - -do print("testing stack overflow in message handling") - local count = 0 - local function loop (x, y, z) - count = count + 1 - return 1 + loop(x, y, z) - end - tracegc.stop() -- __gc should not be called with a full stack - local res, msg = xpcall(loop, loop) - tracegc.start() - assert(msg == "error in error handling") - print("final count: ", count) -end - - --- bug since 2.5 (C-stack overflow in recursion inside pattern matching) -do print("testing recursion inside pattern matching") - local function f (size) - local s = string.rep("a", size) - local p = string.rep(".?", size) - return string.match(s, p) - end - local m = f(80) - assert(#m == 80) - checkerror("too complex", f, 2000) -end - - -do print("testing stack-overflow in recursive 'gsub'") - local count = 0 - local function foo () - count = count + 1 - string.gsub("a", ".", foo) - end - checkerror("stack overflow", foo) - print("final count: ", count) - - print("testing stack-overflow in recursive 'gsub' with metatables") - local count = 0 - local t = setmetatable({}, {__index = foo}) - foo = function () - count = count + 1 - string.gsub("a", ".", t) - end - checkerror("stack overflow", foo) - print("final count: ", count) -end - - -do -- bug in 5.4.0 - print("testing limits in coroutines inside deep calls") - local count = 0 - local lim = 1000 - local function stack (n) - if n > 0 then return stack(n - 1) + 1 - else coroutine.wrap(function () - count = count + 1 - stack(lim) - end)() - end - end - - local st, msg = xpcall(stack, function () return "ok" end, lim) - assert(not st and msg == "ok") - print("final count: ", count) -end - - -do - print("nesting of resuming yielded coroutines") - local count = 0 - - local function body () - coroutine.yield() - local f = coroutine.wrap(body) - f(); -- start new coroutine (will stop in previous yield) - count = count + 1 - f() -- call it recursively - end - - local f = coroutine.wrap(body) - f() - assert(not pcall(f)) - print("final count: ", count) -end - - -do -- bug in 5.4.2 - print("nesting coroutines running after recoverable errors") - local count = 0 - local function foo() - count = count + 1 - pcall(1) -- create an error - -- running now inside 'precover' ("protected recover") - coroutine.wrap(foo)() -- call another coroutine - end - checkerror("C stack overflow", foo) - print("final count: ", count) -end - - -if T then - print("testing stack recovery") - local N = 0 -- trace number of calls - local LIM = -1 -- will store N just before stack overflow - - -- trace stack size; after stack overflow, it should be - -- the maximum allowed stack size. - local stack1 - local dummy - - local function err(msg) - assert(string.find(msg, "stack overflow")) - local _, stacknow = T.stacklevel() - assert(stacknow == stack1 + 200) - end - - -- When LIM==-1, the 'if' is not executed, so this function only - -- counts and stores the stack limits up to overflow. Then, LIM - -- becomes N, and then the 'if' code is run when the stack is - -- full. Then, there is a stack overflow inside 'xpcall', after which - -- the stack must have been restored back to its maximum normal size. - local function f() - dummy, stack1 = T.stacklevel() - if N == LIM then - xpcall(f, err) - local _, stacknow = T.stacklevel() - assert(stacknow == stack1) - return - end - N = N + 1 - f() - end - - local topB, sizeB -- top and size Before overflow - local topA, sizeA -- top and size After overflow - topB, sizeB = T.stacklevel() - tracegc.stop() -- __gc should not be called with a full stack - xpcall(f, err) - tracegc.start() - topA, sizeA = T.stacklevel() - -- sizes should be comparable - assert(topA == topB and sizeA < sizeB * 2) - print(string.format("maximum stack size: %d", stack1)) - LIM = N -- will stop recursion at maximum level - N = 0 -- to count again - tracegc.stop() -- __gc should not be called with a full stack - f() - tracegc.start() - print"+" -end - -print'OK' diff --git a/lua-5.4.4-tests/db.lua b/lua-5.4.4-tests/db.lua deleted file mode 100644 index f891e9b..0000000 --- a/lua-5.4.4-tests/db.lua +++ /dev/null @@ -1,1036 +0,0 @@ --- $Id: testes/db.lua $ --- See Copyright Notice in file all.lua - --- testing debug library - -local debug = require "debug" - -local function dostring(s) return assert(load(s))() end - -print"testing debug library and debug information" - -do -local a=1 -end - -assert(not debug.gethook()) - -local testline = 19 -- line where 'test' is defined -function test (s, l, p) -- this must be line 19 - collectgarbage() -- avoid gc during trace - local function f (event, line) - assert(event == 'line') - local l = table.remove(l, 1) - if p then print(l, line) end - assert(l == line, "wrong trace!!") - end - debug.sethook(f,"l"); load(s)(); debug.sethook() - assert(#l == 0) -end - - -do - assert(not pcall(debug.getinfo, print, "X")) -- invalid option - assert(not pcall(debug.getinfo, 0, ">")) -- invalid option - assert(not debug.getinfo(1000)) -- out of range level - assert(not debug.getinfo(-1)) -- out of range level - local a = debug.getinfo(print) - assert(a.what == "C" and a.short_src == "[C]") - a = debug.getinfo(print, "L") - assert(a.activelines == nil) - local b = debug.getinfo(test, "SfL") - assert(b.name == nil and b.what == "Lua" and b.linedefined == testline and - b.lastlinedefined == b.linedefined + 10 and - b.func == test and not string.find(b.short_src, "%[")) - assert(b.activelines[b.linedefined + 1] and - b.activelines[b.lastlinedefined]) - assert(not b.activelines[b.linedefined] and - not b.activelines[b.lastlinedefined + 1]) -end - - --- test file and string names truncation -a = "function f () end" -local function dostring (s, x) return load(s, x)() end -dostring(a) -assert(debug.getinfo(f).short_src == string.format('[string "%s"]', a)) -dostring(a..string.format("; %s\n=1", string.rep('p', 400))) -assert(string.find(debug.getinfo(f).short_src, '^%[string [^\n]*%.%.%."%]$')) -dostring(a..string.format("; %s=1", string.rep('p', 400))) -assert(string.find(debug.getinfo(f).short_src, '^%[string [^\n]*%.%.%."%]$')) -dostring("\n"..a) -assert(debug.getinfo(f).short_src == '[string "..."]') -dostring(a, "") -assert(debug.getinfo(f).short_src == '[string ""]') -dostring(a, "@xuxu") -assert(debug.getinfo(f).short_src == "xuxu") -dostring(a, "@"..string.rep('p', 1000)..'t') -assert(string.find(debug.getinfo(f).short_src, "^%.%.%.p*t$")) -dostring(a, "=xuxu") -assert(debug.getinfo(f).short_src == "xuxu") -dostring(a, string.format("=%s", string.rep('x', 500))) -assert(string.find(debug.getinfo(f).short_src, "^x*$")) -dostring(a, "=") -assert(debug.getinfo(f).short_src == "") -a = nil; f = nil; - - -repeat - local g = {x = function () - local a = debug.getinfo(2) - assert(a.name == 'f' and a.namewhat == 'local') - a = debug.getinfo(1) - assert(a.name == 'x' and a.namewhat == 'field') - return 'xixi' - end} - local f = function () return 1+1 and (not 1 or g.x()) end - assert(f() == 'xixi') - g = debug.getinfo(f) - assert(g.what == "Lua" and g.func == f and g.namewhat == "" and not g.name) - - function f (x, name) -- local! - name = name or 'f' - local a = debug.getinfo(1) - assert(a.name == name and a.namewhat == 'local') - return x - end - - -- breaks in different conditions - if 3>4 then break end; f() - if 3<4 then a=1 else break end; f() - while 1 do local x=10; break end; f() - local b = 1 - if 3>4 then return math.sin(1) end; f() - a = 3<4; f() - a = 3<4 or 1; f() - repeat local x=20; if 4>3 then f() else break end; f() until 1 - g = {} - f(g).x = f(2) and f(10)+f(9) - assert(g.x == f(19)) - function g(x) if not x then return 3 end return (x('a', 'x')) end - assert(g(f) == 'a') -until 1 - -test([[if -math.sin(1) -then - a=1 -else - a=2 -end -]], {2,3,4,7}) - -test([[ -local function foo() -end -foo() -A = 1 -A = 2 -A = 3 -]], {2, 3, 2, 4, 5, 6}) - - -test([[-- -if nil then - a=1 -else - a=2 -end -]], {2,5,6}) - -test([[a=1 -repeat - a=a+1 -until a==3 -]], {1,3,4,3,4}) - -test([[ do - return -end -]], {2}) - -test([[local a -a=1 -while a<=3 do - a=a+1 -end -]], {1,2,3,4,3,4,3,4,3,5}) - -test([[while math.sin(1) do - if math.sin(1) - then break - end -end -a=1]], {1,2,3,6}) - -test([[for i=1,3 do - a=i -end -]], {1,2,1,2,1,2,1,3}) - -test([[for i,v in pairs{'a','b'} do - a=tostring(i) .. v -end -]], {1,2,1,2,1,3}) - -test([[for i=1,4 do a=1 end]], {1,1,1,1}) - - -do -- testing line info/trace with large gaps in source - - local a = {1, 2, 3, 10, 124, 125, 126, 127, 128, 129, 130, - 255, 256, 257, 500, 1000} - local s = [[ - local b = {10} - a = b[1] X + Y b[1] - b = 4 - ]] - for _, i in ipairs(a) do - local subs = {X = string.rep("\n", i)} - for _, j in ipairs(a) do - subs.Y = string.rep("\n", j) - local s = string.gsub(s, "[XY]", subs) - test(s, {1, 2 + i, 2 + i + j, 2 + i, 2 + i + j, 3 + i + j}) - end - end -end - - -do -- testing active lines - local function checkactivelines (f, lines) - local t = debug.getinfo(f, "SL") - for _, l in pairs(lines) do - l = l + t.linedefined - assert(t.activelines[l]) - t.activelines[l] = undef - end - assert(next(t.activelines) == nil) -- no extra lines - end - - checkactivelines(function (...) -- vararg function - -- 1st line is empty - -- 2nd line is empty - -- 3th line is empty - local a = 20 - -- 5th line is empty - local b = 30 - -- 7th line is empty - end, {4, 6, 8}) - - checkactivelines(function (a) - -- 1st line is empty - -- 2nd line is empty - local a = 20 - local b = 30 - -- 5th line is empty - end, {3, 4, 6}) - - checkactivelines(function (a, b, ...) end, {0}) - - checkactivelines(function (a, b) - end, {1}) - - for _, n in pairs{0, 1, 2, 10, 50, 100, 1000, 10000} do - checkactivelines( - load(string.format("%s return 1", string.rep("\n", n))), - {n + 1}) - end - -end - -print'+' - --- invalid levels in [gs]etlocal -assert(not pcall(debug.getlocal, 20, 1)) -assert(not pcall(debug.setlocal, -1, 1, 10)) - - --- parameter names -local function foo (a,b,...) local d, e end -local co = coroutine.create(foo) - -assert(debug.getlocal(foo, 1) == 'a') -assert(debug.getlocal(foo, 2) == 'b') -assert(not debug.getlocal(foo, 3)) -assert(debug.getlocal(co, foo, 1) == 'a') -assert(debug.getlocal(co, foo, 2) == 'b') -assert(not debug.getlocal(co, foo, 3)) - -assert(not debug.getlocal(print, 1)) - - -local function foo () return (debug.getlocal(1, -1)) end -assert(not foo(10)) - - --- varargs -local function foo (a, ...) - local t = table.pack(...) - for i = 1, t.n do - local n, v = debug.getlocal(1, -i) - assert(n == "(vararg)" and v == t[i]) - end - assert(not debug.getlocal(1, -(t.n + 1))) - assert(not debug.setlocal(1, -(t.n + 1), 30)) - if t.n > 0 then - (function (x) - assert(debug.setlocal(2, -1, x) == "(vararg)") - assert(debug.setlocal(2, -t.n, x) == "(vararg)") - end)(430) - assert(... == 430) - end -end - -foo() -foo(print) -foo(200, 3, 4) -local a = {} -for i = 1, (_soft and 100 or 1000) do a[i] = i end -foo(table.unpack(a)) -a = nil - - - -do -- test hook presence in debug info - assert(not debug.gethook()) - local count = 0 - local function f () - assert(debug.getinfo(1).namewhat == "hook") - local sndline = string.match(debug.traceback(), "\n(.-)\n") - assert(string.find(sndline, "hook")) - count = count + 1 - end - debug.sethook(f, "l") - local a = 0 - _ENV.a = a - a = 1 - debug.sethook() - assert(count == 4) -end - - --- hook table has weak keys -assert(getmetatable(debug.getregistry()._HOOKKEY).__mode == 'k') - - -a = {}; L = nil -local glob = 1 -local oldglob = glob -debug.sethook(function (e,l) - collectgarbage() -- force GC during a hook - local f, m, c = debug.gethook() - assert(m == 'crl' and c == 0) - if e == "line" then - if glob ~= oldglob then - L = l-1 -- get the first line where "glob" has changed - oldglob = glob - end - elseif e == "call" then - local f = debug.getinfo(2, "f").func - a[f] = 1 - else assert(e == "return") - end -end, "crl") - - -function f(a,b) - collectgarbage() - local _, x = debug.getlocal(1, 1) - local _, y = debug.getlocal(1, 2) - assert(x == a and y == b) - assert(debug.setlocal(2, 3, "pera") == "AA".."AA") - assert(debug.setlocal(2, 4, "maçã") == "B") - x = debug.getinfo(2) - assert(x.func == g and x.what == "Lua" and x.name == 'g' and - x.nups == 2 and string.find(x.source, "^@.*db%.lua$")) - glob = glob+1 - assert(debug.getinfo(1, "l").currentline == L+1) - assert(debug.getinfo(1, "l").currentline == L+2) -end - -function foo() - glob = glob+1 - assert(debug.getinfo(1, "l").currentline == L+1) -end; foo() -- set L --- check line counting inside strings and empty lines - -_ = 'alo\ -alo' .. [[ - -]] ---[[ -]] -assert(debug.getinfo(1, "l").currentline == L+11) -- check count of lines - - -function g (...) - local arg = {...} - do local a,b,c; a=math.sin(40); end - local feijao - local AAAA,B = "xuxu", "mamão" - f(AAAA,B) - assert(AAAA == "pera" and B == "maçã") - do - local B = 13 - local x,y = debug.getlocal(1,5) - assert(x == 'B' and y == 13) - end -end - -g() - - -assert(a[f] and a[g] and a[assert] and a[debug.getlocal] and not a[print]) - - --- tests for manipulating non-registered locals (C and Lua temporaries) - -local n, v = debug.getlocal(0, 1) -assert(v == 0 and n == "(C temporary)") -local n, v = debug.getlocal(0, 2) -assert(v == 2 and n == "(C temporary)") -assert(not debug.getlocal(0, 3)) -assert(not debug.getlocal(0, 0)) - -function f() - assert(select(2, debug.getlocal(2,3)) == 1) - assert(not debug.getlocal(2,4)) - debug.setlocal(2, 3, 10) - return 20 -end - -function g(a,b) return (a+1) + f() end - -assert(g(0,0) == 30) - - -debug.sethook(nil); -assert(not debug.gethook()) - - --- minimal tests for setuservalue/getuservalue -do - assert(not debug.setuservalue(io.stdin, 10)) - local a, b = debug.getuservalue(io.stdin, 10) - assert(a == nil and not b) -end - --- testing iteraction between multiple values x hooks -do - local function f(...) return 3, ... end - local count = 0 - local a = {} - for i = 1, 100 do a[i] = i end - debug.sethook(function () count = count + 1 end, "", 1) - local t = {table.unpack(a)} - assert(#t == 100) - t = {table.unpack(a, 1, 3)} - assert(#t == 3) - t = {f(table.unpack(a, 1, 30))} - assert(#t == 31) -end - - --- testing access to function arguments - -local function collectlocals (level) - local tab = {} - for i = 1, math.huge do - local n, v = debug.getlocal(level + 1, i) - if not (n and string.find(n, "^[a-zA-Z0-9_]+$")) then - break -- consider only real variables - end - tab[n] = v - end - return tab -end - - -X = nil -a = {} -function a:f (a, b, ...) local arg = {...}; local c = 13 end -debug.sethook(function (e) - assert(e == "call") - dostring("XX = 12") -- test dostring inside hooks - -- testing errors inside hooks - assert(not pcall(load("a='joao'+1"))) - debug.sethook(function (e, l) - assert(debug.getinfo(2, "l").currentline == l) - local f,m,c = debug.gethook() - assert(e == "line") - assert(m == 'l' and c == 0) - debug.sethook(nil) -- hook is called only once - assert(not X) -- check that - X = collectlocals(2) - end, "l") -end, "c") - -a:f(1,2,3,4,5) -assert(X.self == a and X.a == 1 and X.b == 2 and X.c == nil) -assert(XX == 12) -assert(not debug.gethook()) - - --- testing access to local variables in return hook (bug in 5.2) -do - local X = false - - local function foo (a, b, ...) - do local x,y,z end - local c, d = 10, 20 - return - end - - local function aux () - if debug.getinfo(2).name == "foo" then - X = true -- to signal that it found 'foo' - local tab = {a = 100, b = 200, c = 10, d = 20} - for n, v in pairs(collectlocals(2)) do - assert(tab[n] == v) - tab[n] = undef - end - assert(next(tab) == nil) -- 'tab' must be empty - end - end - - debug.sethook(aux, "r"); foo(100, 200); debug.sethook() - assert(X) - -end - - -local function eqseq (t1, t2) - assert(#t1 == #t2) - for i = 1, #t1 do - assert(t1[i] == t2[i]) - end -end - - -do print("testing inspection of parameters/returned values") - local on = false - local inp, out - - local function hook (event) - if not on then return end - local ar = debug.getinfo(2, "ruS") - local t = {} - for i = ar.ftransfer, ar.ftransfer + ar.ntransfer - 1 do - local _, v = debug.getlocal(2, i) - t[#t + 1] = v - end - if event == "return" then - out = t - else - inp = t - end - end - - debug.sethook(hook, "cr") - - on = true; math.sin(3); on = false - eqseq(inp, {3}); eqseq(out, {math.sin(3)}) - - on = true; select(2, 10, 20, 30, 40); on = false - eqseq(inp, {2, 10, 20, 30, 40}); eqseq(out, {20, 30, 40}) - - local function foo (a, ...) return ... end - local function foo1 () on = not on; return foo(20, 10, 0) end - foo1(); on = false - eqseq(inp, {20}); eqseq(out, {10, 0}) - - debug.sethook() -end - - - --- testing upvalue access -local function getupvalues (f) - local t = {} - local i = 1 - while true do - local name, value = debug.getupvalue(f, i) - if not name then break end - assert(not t[name]) - t[name] = value - i = i + 1 - end - return t -end - -local a,b,c = 1,2,3 -local function foo1 (a) b = a; return c end -local function foo2 (x) a = x; return c+b end -assert(not debug.getupvalue(foo1, 3)) -assert(not debug.getupvalue(foo1, 0)) -assert(not debug.setupvalue(foo1, 3, "xuxu")) -local t = getupvalues(foo1) -assert(t.a == nil and t.b == 2 and t.c == 3) -t = getupvalues(foo2) -assert(t.a == 1 and t.b == 2 and t.c == 3) -assert(debug.setupvalue(foo1, 1, "xuxu") == "b") -assert(({debug.getupvalue(foo2, 3)})[2] == "xuxu") --- upvalues of C functions are allways "called" "" (the empty string) -assert(debug.getupvalue(string.gmatch("x", "x"), 1) == "") - - --- testing count hooks -local a=0 -debug.sethook(function (e) a=a+1 end, "", 1) -a=0; for i=1,1000 do end; assert(1000 < a and a < 1012) -debug.sethook(function (e) a=a+1 end, "", 4) -a=0; for i=1,1000 do end; assert(250 < a and a < 255) -local f,m,c = debug.gethook() -assert(m == "" and c == 4) -debug.sethook(function (e) a=a+1 end, "", 4000) -a=0; for i=1,1000 do end; assert(a == 0) - -do - debug.sethook(print, "", 2^24 - 1) -- count upperbound - local f,m,c = debug.gethook() - assert(({debug.gethook()})[3] == 2^24 - 1) -end - -debug.sethook() - - --- tests for tail calls -local function f (x) - if x then - assert(debug.getinfo(1, "S").what == "Lua") - assert(debug.getinfo(1, "t").istailcall == true) - local tail = debug.getinfo(2) - assert(tail.func == g1 and tail.istailcall == true) - assert(debug.getinfo(3, "S").what == "main") - print"+" - end -end - -function g(x) return f(x) end - -function g1(x) g(x) end - -local function h (x) local f=g1; return f(x) end - -h(true) - -local b = {} -debug.sethook(function (e) table.insert(b, e) end, "cr") -h(false) -debug.sethook() -local res = {"return", -- first return (from sethook) - "call", "tail call", "call", "tail call", - "return", "return", - "call", -- last call (to sethook) -} -for i = 1, #res do assert(res[i] == table.remove(b, 1)) end - -b = 0 -debug.sethook(function (e) - if e == "tail call" then - b = b + 1 - assert(debug.getinfo(2, "t").istailcall == true) - else - assert(debug.getinfo(2, "t").istailcall == false) - end - end, "c") -h(false) -debug.sethook() -assert(b == 2) -- two tail calls - -lim = _soft and 3000 or 30000 -local function foo (x) - if x==0 then - assert(debug.getinfo(2).what == "main") - local info = debug.getinfo(1) - assert(info.istailcall == true and info.func == foo) - else return foo(x-1) - end -end - -foo(lim) - - -print"+" - - --- testing local function information -co = load[[ - local A = function () - return x - end - return -]] - -local a = 0 --- 'A' should be visible to debugger only after its complete definition -debug.sethook(function (e, l) - if l == 3 then a = a + 1; assert(debug.getlocal(2, 1) == "(temporary)") - elseif l == 4 then a = a + 1; assert(debug.getlocal(2, 1) == "A") - end -end, "l") -co() -- run local function definition -debug.sethook() -- turn off hook -assert(a == 2) -- ensure all two lines where hooked - --- testing traceback - -assert(debug.traceback(print) == print) -assert(debug.traceback(print, 4) == print) -assert(string.find(debug.traceback("hi", 4), "^hi\n")) -assert(string.find(debug.traceback("hi"), "^hi\n")) -assert(not string.find(debug.traceback("hi"), "'debug.traceback'")) -assert(string.find(debug.traceback("hi", 0), "'debug.traceback'")) -assert(string.find(debug.traceback(), "^stack traceback:\n")) - -do -- C-function names in traceback - local st, msg = (function () return pcall end)()(debug.traceback) - assert(st == true and string.find(msg, "pcall")) -end - - --- testing nparams, nups e isvararg -local t = debug.getinfo(print, "u") -assert(t.isvararg == true and t.nparams == 0 and t.nups == 0) - -t = debug.getinfo(function (a,b,c) end, "u") -assert(t.isvararg == false and t.nparams == 3 and t.nups == 0) - -t = debug.getinfo(function (a,b,...) return t[a] end, "u") -assert(t.isvararg == true and t.nparams == 2 and t.nups == 1) - -t = debug.getinfo(1) -- main -assert(t.isvararg == true and t.nparams == 0 and t.nups == 1 and - debug.getupvalue(t.func, 1) == "_ENV") - -t = debug.getinfo(math.sin) -- C function -assert(t.isvararg == true and t.nparams == 0 and t.nups == 0) - -t = debug.getinfo(string.gmatch("abc", "a")) -- C closure -assert(t.isvararg == true and t.nparams == 0 and t.nups > 0) - - - --- testing debugging of coroutines - -local function checktraceback (co, p, level) - local tb = debug.traceback(co, nil, level) - local i = 0 - for l in string.gmatch(tb, "[^\n]+\n?") do - assert(i == 0 or string.find(l, p[i])) - i = i+1 - end - assert(p[i] == undef) -end - - -local function f (n) - if n > 0 then f(n-1) - else coroutine.yield() end -end - -local co = coroutine.create(f) -coroutine.resume(co, 3) -checktraceback(co, {"yield", "db.lua", "db.lua", "db.lua", "db.lua"}) -checktraceback(co, {"db.lua", "db.lua", "db.lua", "db.lua"}, 1) -checktraceback(co, {"db.lua", "db.lua", "db.lua"}, 2) -checktraceback(co, {"db.lua"}, 4) -checktraceback(co, {}, 40) - - -co = coroutine.create(function (x) - local a = 1 - coroutine.yield(debug.getinfo(1, "l")) - coroutine.yield(debug.getinfo(1, "l").currentline) - return a - end) - -local tr = {} -local foo = function (e, l) if l then table.insert(tr, l) end end -debug.sethook(co, foo, "lcr") - -local _, l = coroutine.resume(co, 10) -local x = debug.getinfo(co, 1, "lfLS") -assert(x.currentline == l.currentline and x.activelines[x.currentline]) -assert(type(x.func) == "function") -for i=x.linedefined + 1, x.lastlinedefined do - assert(x.activelines[i]) - x.activelines[i] = undef -end -assert(next(x.activelines) == nil) -- no 'extra' elements -assert(not debug.getinfo(co, 2)) -local a,b = debug.getlocal(co, 1, 1) -assert(a == "x" and b == 10) -a,b = debug.getlocal(co, 1, 2) -assert(a == "a" and b == 1) -debug.setlocal(co, 1, 2, "hi") -assert(debug.gethook(co) == foo) -assert(#tr == 2 and - tr[1] == l.currentline-1 and tr[2] == l.currentline) - -a,b,c = pcall(coroutine.resume, co) -assert(a and b and c == l.currentline+1) -checktraceback(co, {"yield", "in function <"}) - -a,b = coroutine.resume(co) -assert(a and b == "hi") -assert(#tr == 4 and tr[4] == l.currentline+2) -assert(debug.gethook(co) == foo) -assert(not debug.gethook()) -checktraceback(co, {}) - - --- check get/setlocal in coroutines -co = coroutine.create(function (x) - local a, b = coroutine.yield(x) - assert(a == 100 and b == nil) - return x -end) -a, b = coroutine.resume(co, 10) -assert(a and b == 10) -a, b = debug.getlocal(co, 1, 1) -assert(a == "x" and b == 10) -assert(not debug.getlocal(co, 1, 5)) -assert(debug.setlocal(co, 1, 1, 30) == "x") -assert(not debug.setlocal(co, 1, 5, 40)) -a, b = coroutine.resume(co, 100) -assert(a and b == 30) - - --- check traceback of suspended (or dead with error) coroutines - -function f(i) - if i == 0 then error(i) - else coroutine.yield(); f(i-1) - end -end - - -co = coroutine.create(function (x) f(x) end) -a, b = coroutine.resume(co, 3) -t = {"'coroutine.yield'", "'f'", "in function <"} -while coroutine.status(co) == "suspended" do - checktraceback(co, t) - a, b = coroutine.resume(co) - table.insert(t, 2, "'f'") -- one more recursive call to 'f' -end -t[1] = "'error'" -checktraceback(co, t) - - --- test acessing line numbers of a coroutine from a resume inside --- a C function (this is a known bug in Lua 5.0) - -local function g(x) - coroutine.yield(x) -end - -local function f (i) - debug.sethook(function () end, "l") - for j=1,1000 do - g(i+j) - end -end - -local co = coroutine.wrap(f) -co(10) -pcall(co) -pcall(co) - - -assert(type(debug.getregistry()) == "table") - - --- test tagmethod information -local a = {} -local function f (t) - local info = debug.getinfo(1); - assert(info.namewhat == "metamethod") - a.op = info.name - return info.name -end -setmetatable(a, { - __index = f; __add = f; __div = f; __mod = f; __concat = f; __pow = f; - __mul = f; __idiv = f; __unm = f; __len = f; __sub = f; - __shl = f; __shr = f; __bor = f; __bxor = f; - __eq = f; __le = f; __lt = f; __unm = f; __len = f; __band = f; - __bnot = f; -}) - -local b = setmetatable({}, getmetatable(a)) - -assert(a[3] == "index" and a^3 == "pow" and a..a == "concat") -assert(a/3 == "div" and 3%a == "mod") -assert(a+3 == "add" and 3-a == "sub" and a*3 == "mul" and - -a == "unm" and #a == "len" and a&3 == "band") -assert(a + 30000 == "add" and a - 3.0 == "sub" and a * 3.0 == "mul" and - -a == "unm" and #a == "len" and a & 3 == "band") -assert(a|3 == "bor" and 3~a == "bxor" and a<<3 == "shl" and a>>1 == "shr") -assert (a==b and a.op == "eq") -assert (a>=b and a.op == "le") -assert ("x">=a and a.op == "le") -assert (a>b and a.op == "lt") -assert (a>10 and a.op == "lt") -assert(~a == "bnot") - -do -- testing for-iterator name - local function f() - assert(debug.getinfo(1).name == "for iterator") - end - - for i in f do end -end - - -do -- testing debug info for finalizers - local name = nil - - -- create a piece of garbage with a finalizer - setmetatable({}, {__gc = function () - local t = debug.getinfo(1) -- get function information - assert(t.namewhat == "metamethod") - name = t.name - end}) - - -- repeat until previous finalizer runs (setting 'name') - repeat local a = {} until name - assert(name == "__gc") -end - - -do - print("testing traceback sizes") - - local function countlines (s) - return select(2, string.gsub(s, "\n", "")) - end - - local function deep (lvl, n) - if lvl == 0 then - return (debug.traceback("message", n)) - else - return (deep(lvl-1, n)) - end - end - - local function checkdeep (total, start) - local s = deep(total, start) - local rest = string.match(s, "^message\nstack traceback:\n(.*)$") - local cl = countlines(rest) - -- at most 10 lines in first part, 11 in second, plus '...' - assert(cl <= 10 + 11 + 1) - local brk = string.find(rest, "%.%.%.") - if brk then -- does message have '...'? - local rest1 = string.sub(rest, 1, brk) - local rest2 = string.sub(rest, brk, #rest) - assert(countlines(rest1) == 10 and countlines(rest2) == 11) - else - assert(cl == total - start + 2) - end - end - - for d = 1, 51, 10 do - for l = 1, d do - -- use coroutines to ensure complete control of the stack - coroutine.wrap(checkdeep)(d, l) - end - end - -end - - -print("testing debug functions on chunk without debug info") -prog = [[-- program to be loaded without debug information (strip) -local debug = require'debug' -local a = 12 -- a local variable - -local n, v = debug.getlocal(1, 1) -assert(n == "(temporary)" and v == debug) -- unkown name but known value -n, v = debug.getlocal(1, 2) -assert(n == "(temporary)" and v == 12) -- unkown name but known value - --- a function with an upvalue -local f = function () local x; return a end -n, v = debug.getupvalue(f, 1) -assert(n == "(no name)" and v == 12) -assert(debug.setupvalue(f, 1, 13) == "(no name)") -assert(a == 13) - -local t = debug.getinfo(f) -assert(t.name == nil and t.linedefined > 0 and - t.lastlinedefined == t.linedefined and - t.short_src == "?") -assert(debug.getinfo(1).currentline == -1) - -t = debug.getinfo(f, "L").activelines -assert(next(t) == nil) -- active lines are empty - --- dump/load a function without debug info -f = load(string.dump(f)) - -t = debug.getinfo(f) -assert(t.name == nil and t.linedefined > 0 and - t.lastlinedefined == t.linedefined and - t.short_src == "?") -assert(debug.getinfo(1).currentline == -1) - -return a -]] - - --- load 'prog' without debug info -local f = assert(load(string.dump(load(prog), true))) - -assert(f() == 13) - -do -- bug in 5.4.0: line hooks in stripped code - local function foo () - local a = 1 - local b = 2 - return b - end - - local s = load(string.dump(foo, true)) - local line = true - debug.sethook(function (e, l) - assert(e == "line") - line = l - end, "l") - assert(s() == 2); debug.sethook(nil) - assert(line == nil) -- hook called withoug debug info for 1st instruction -end - -do -- tests for 'source' in binary dumps - local prog = [[ - return function (x) - return function (y) - return x + y - end - end - ]] - local name = string.rep("x", 1000) - local p = assert(load(prog, name)) - -- load 'p' as a binary chunk with debug information - local c = string.dump(p) - assert(#c > 1000 and #c < 2000) -- no repetition of 'source' in dump - local f = assert(load(c)) - local g = f() - local h = g(3) - assert(h(5) == 8) - assert(debug.getinfo(f).source == name and -- all functions have 'source' - debug.getinfo(g).source == name and - debug.getinfo(h).source == name) - -- again, without debug info - local c = string.dump(p, true) - assert(#c < 500) -- no 'source' in dump - local f = assert(load(c)) - local g = f() - local h = g(30) - assert(h(50) == 80) - assert(debug.getinfo(f).source == '=?' and -- no function has 'source' - debug.getinfo(g).source == '=?' and - debug.getinfo(h).source == '=?') -end - -print"OK" - diff --git a/lua-5.4.4-tests/errors.lua b/lua-5.4.4-tests/errors.lua deleted file mode 100644 index 55bdab8..0000000 --- a/lua-5.4.4-tests/errors.lua +++ /dev/null @@ -1,661 +0,0 @@ --- $Id: testes/errors.lua $ --- See Copyright Notice in file all.lua - -print("testing errors") - -local debug = require"debug" - --- avoid problems with 'strict' module (which may generate other error messages) -local mt = getmetatable(_G) or {} -local oldmm = mt.__index -mt.__index = nil - -local function checkerr (msg, f, ...) - local st, err = pcall(f, ...) - assert(not st and string.find(err, msg)) -end - - -local function doit (s) - local f, msg = load(s) - if not f then return msg end - local cond, msg = pcall(f) - return (not cond) and msg -end - - -local function checkmessage (prog, msg, debug) - local m = doit(prog) - if debug then print(m, msg) end - assert(string.find(m, msg, 1, true)) -end - -local function checksyntax (prog, extra, token, line) - local msg = doit(prog) - if not string.find(token, "^<%a") and not string.find(token, "^char%(") - then token = "'"..token.."'" end - token = string.gsub(token, "(%p)", "%%%1") - local pt = string.format([[^%%[string ".*"%%]:%d: .- near %s$]], - line, token) - assert(string.find(msg, pt)) - assert(string.find(msg, msg, 1, true)) -end - - --- test error message with no extra info -assert(doit("error('hi', 0)") == 'hi') - --- test error message with no info -assert(doit("error()") == nil) - - --- test common errors/errors that crashed in the past -assert(doit("table.unpack({}, 1, n=2^30)")) -assert(doit("a=math.sin()")) -assert(not doit("tostring(1)") and doit("tostring()")) -assert(doit"tonumber()") -assert(doit"repeat until 1; a") -assert(doit"return;;") -assert(doit"assert(false)") -assert(doit"assert(nil)") -assert(doit("function a (... , ...) end")) -assert(doit("function a (, ...) end")) -assert(doit("local t={}; t = t[#t] + 1")) - -checksyntax([[ - local a = {4 - -]], "'}' expected (to close '{' at line 1)", "", 3) - - -do -- testing errors in goto/break - local function checksyntax (prog, msg, line) - local st, err = load(prog) - assert(string.find(err, "line " .. line)) - assert(string.find(err, msg, 1, true)) - end - - checksyntax([[ - ::A:: a = 1 - ::A:: - ]], "label 'A' already defined", 1) - - checksyntax([[ - a = 1 - goto A - do ::A:: end - ]], "no visible label 'A'", 2) - -end - - -if not T then - (Message or print) - ('\n >>> testC not active: skipping memory message test <<<\n') -else - print "testing memory error message" - local a = {} - for i = 1, 10000 do a[i] = true end -- preallocate array - collectgarbage() - T.totalmem(T.totalmem() + 10000) - -- force a memory error (by a small margin) - local st, msg = pcall(function() - for i = 1, 100000 do a[i] = tostring(i) end - end) - T.totalmem(0) - assert(not st and msg == "not enough" .. " memory") -end - - --- tests for better error messages - -checkmessage("a = {} + 1", "arithmetic") -checkmessage("a = {} | 1", "bitwise operation") -checkmessage("a = {} < 1", "attempt to compare") -checkmessage("a = {} <= 1", "attempt to compare") - -checkmessage("a=1; bbbb=2; a=math.sin(3)+bbbb(3)", "global 'bbbb'") -checkmessage("a={}; do local a=1 end a:bbbb(3)", "method 'bbbb'") -checkmessage("local a={}; a.bbbb(3)", "field 'bbbb'") -assert(not string.find(doit"a={13}; local bbbb=1; a[bbbb](3)", "'bbbb'")) -checkmessage("a={13}; local bbbb=1; a[bbbb](3)", "number") -checkmessage("a=(1)..{}", "a table value") - --- calls -checkmessage("local a; a(13)", "local 'a'") -checkmessage([[ - local a = setmetatable({}, {__add = 34}) - a = a + 1 -]], "metamethod 'add'") -checkmessage([[ - local a = setmetatable({}, {__lt = {}}) - a = a > a -]], "metamethod 'lt'") - --- tail calls -checkmessage("local a={}; return a.bbbb(3)", "field 'bbbb'") -checkmessage("a={}; do local a=1 end; return a:bbbb(3)", "method 'bbbb'") - -checkmessage("a = #print", "length of a function value") -checkmessage("a = #3", "length of a number value") - -aaa = nil -checkmessage("aaa.bbb:ddd(9)", "global 'aaa'") -checkmessage("local aaa={bbb=1}; aaa.bbb:ddd(9)", "field 'bbb'") -checkmessage("local aaa={bbb={}}; aaa.bbb:ddd(9)", "method 'ddd'") -checkmessage("local a,b,c; (function () a = b+1.1 end)()", "upvalue 'b'") -assert(not doit"local aaa={bbb={ddd=next}}; aaa.bbb:ddd(nil)") - --- upvalues being indexed do not go to the stack -checkmessage("local a,b,cc; (function () a = cc[1] end)()", "upvalue 'cc'") -checkmessage("local a,b,cc; (function () a.x = 1 end)()", "upvalue 'a'") - -checkmessage("local _ENV = {x={}}; a = a + 1", "global 'a'") - -checkmessage("b=1; local aaa={}; x=aaa+b", "local 'aaa'") -checkmessage("aaa={}; x=3.3/aaa", "global 'aaa'") -checkmessage("aaa=2; b=nil;x=aaa*b", "global 'b'") -checkmessage("aaa={}; x=-aaa", "global 'aaa'") - --- short circuit -checkmessage("a=1; local a,bbbb=2,3; a = math.sin(1) and bbbb(3)", - "local 'bbbb'") -checkmessage("a=1; local a,bbbb=2,3; a = bbbb(1) or a(3)", "local 'bbbb'") -checkmessage("local a,b,c,f = 1,1,1; f((a and b) or c)", "local 'f'") -checkmessage("local a,b,c = 1,1,1; ((a and b) or c)()", "call a number value") -assert(not string.find(doit"aaa={}; x=(aaa or aaa)+(aaa and aaa)", "'aaa'")) -assert(not string.find(doit"aaa={}; (aaa or aaa)()", "'aaa'")) - -checkmessage("print(print < 10)", "function with number") -checkmessage("print(print < print)", "two function values") -checkmessage("print('10' < 10)", "string with number") -checkmessage("print(10 < '23')", "number with string") - --- float->integer conversions -checkmessage("local a = 2.0^100; x = a << 2", "local a") -checkmessage("local a = 1 >> 2.0^100", "has no integer representation") -checkmessage("local a = 10.1 << 2.0^100", "has no integer representation") -checkmessage("local a = 2.0^100 & 1", "has no integer representation") -checkmessage("local a = 2.0^100 & 1e100", "has no integer representation") -checkmessage("local a = 2.0 | 1e40", "has no integer representation") -checkmessage("local a = 2e100 ~ 1", "has no integer representation") -checkmessage("string.sub('a', 2.0^100)", "has no integer representation") -checkmessage("string.rep('a', 3.3)", "has no integer representation") -checkmessage("return 6e40 & 7", "has no integer representation") -checkmessage("return 34 << 7e30", "has no integer representation") -checkmessage("return ~-3e40", "has no integer representation") -checkmessage("return ~-3.009", "has no integer representation") -checkmessage("return 3.009 & 1", "has no integer representation") -checkmessage("return 34 >> {}", "table value") -checkmessage("a = 24 // 0", "divide by zero") -checkmessage("a = 1 % 0", "'n%0'") - - --- type error for an object which is neither in an upvalue nor a register. --- The following code will try to index the value 10 that is stored in --- the metatable, without moving it to a register. -checkmessage("local a = setmetatable({}, {__index = 10}).x", - "attempt to index a number value") - - --- numeric for loops -checkmessage("for i = {}, 10 do end", "table") -checkmessage("for i = io.stdin, 10 do end", "FILE") -checkmessage("for i = {}, 10 do end", "initial value") -checkmessage("for i = 1, 'x', 10 do end", "string") -checkmessage("for i = 1, {}, 10 do end", "limit") -checkmessage("for i = 1, {} do end", "limit") -checkmessage("for i = 1, 10, print do end", "step") -checkmessage("for i = 1, 10, print do end", "function") - --- passing light userdata instead of full userdata -_G.D = debug -checkmessage([[ - -- create light udata - local x = D.upvalueid(function () return debug end, 1) - D.setuservalue(x, {}) -]], "light userdata") -_G.D = nil - -do -- named objects (field '__name') - checkmessage("math.sin(io.input())", "(number expected, got FILE*)") - _G.XX = setmetatable({}, {__name = "My Type"}) - assert(string.find(tostring(XX), "^My Type")) - checkmessage("io.input(XX)", "(FILE* expected, got My Type)") - checkmessage("return XX + 1", "on a My Type value") - checkmessage("return ~io.stdin", "on a FILE* value") - checkmessage("return XX < XX", "two My Type values") - checkmessage("return {} < XX", "table with My Type") - checkmessage("return XX < io.stdin", "My Type with FILE*") - _G.XX = nil - - if T then -- extra tests for 'luaL_tolstring' - -- bug in 5.4.3; 'luaL_tolstring' with negative indices - local x = setmetatable({}, {__name="TABLE"}) - assert(T.testC("Ltolstring -1; return 1", x) == tostring(x)) - - local a, b = T.testC("pushint 10; Ltolstring -2; return 2", x) - assert(a == 10 and b == tostring(x)) - - setmetatable(x, {__tostring=function (o) - assert(o == x) - return "ABC" - end}) - local a, b, c = T.testC("pushint 10; Ltolstring -2; return 3", x) - assert(a == x and b == 10 and c == "ABC") - end -end - --- global functions -checkmessage("(io.write or print){}", "io.write") -checkmessage("(collectgarbage or print){}", "collectgarbage") - --- errors in functions without debug info -do - local f = function (a) return a + 1 end - f = assert(load(string.dump(f, true))) - assert(f(3) == 4) - checkerr("^%?:%-1:", f, {}) - - -- code with a move to a local var ('OP_MOV A B' with A3+1, - {d = x and aaa[x or y]}} -]], "global 'aaa'") - -checkmessage([[ -local x,y = {},1 -if math.sin(1) == 0 then return 3 end -- return -x.a()]], "field 'a'") - -checkmessage([[ -prefix = nil -insert = nil -while 1 do - local a - if nil then break end - insert(prefix, a) -end]], "global 'insert'") - -checkmessage([[ -- tail call - return math.sin("a") -]], "sin") - -checkmessage([[collectgarbage("nooption")]], "invalid option") - -checkmessage([[x = print .. "a"]], "concatenate") -checkmessage([[x = "a" .. false]], "concatenate") -checkmessage([[x = {} .. 2]], "concatenate") - -checkmessage("getmetatable(io.stdin).__gc()", "no value") - -checkmessage([[ -local Var -local function main() - NoSuchName (function() Var=0 end) -end -main() -]], "global 'NoSuchName'") -print'+' - -a = {}; setmetatable(a, {__index = string}) -checkmessage("a:sub()", "bad self") -checkmessage("string.sub('a', {})", "#2") -checkmessage("('a'):sub{}", "#1") - -checkmessage("table.sort({1,2,3}, table.sort)", "'table.sort'") -checkmessage("string.gsub('s', 's', setmetatable)", "'setmetatable'") - --- tests for errors in coroutines - -local function f (n) - local c = coroutine.create(f) - local a,b = coroutine.resume(c) - return b -end -assert(string.find(f(), "C stack overflow")) - -checkmessage("coroutine.yield()", "outside a coroutine") - -f = coroutine.wrap(function () table.sort({1,2,3}, coroutine.yield) end) -checkerr("yield across", f) - - --- testing size of 'source' info; size of buffer for that info is --- LUA_IDSIZE, declared as 60 in luaconf. Get one position for '\0'. -idsize = 60 - 1 -local function checksize (source) - -- syntax error - local _, msg = load("x", source) - msg = string.match(msg, "^([^:]*):") -- get source (1st part before ':') - assert(msg:len() <= idsize) -end - -for i = 60 - 10, 60 + 10 do -- check border cases around 60 - checksize("@" .. string.rep("x", i)) -- file names - checksize(string.rep("x", i - 10)) -- string sources - checksize("=" .. string.rep("x", i)) -- exact sources -end - - --- testing line error - -local function lineerror (s, l) - local err,msg = pcall(load(s)) - local line = tonumber(string.match(msg, ":(%d+):")) - assert(line == l or (not line and not l)) -end - -lineerror("local a\n for i=1,'a' do \n print(i) \n end", 2) -lineerror("\n local a \n for k,v in 3 \n do \n print(k) \n end", 3) -lineerror("\n\n for k,v in \n 3 \n do \n print(k) \n end", 4) -lineerror("function a.x.y ()\na=a+1\nend", 1) - -lineerror("a = \na\n+\n{}", 3) -lineerror("a = \n3\n+\n(\n4\n/\nprint)", 6) -lineerror("a = \nprint\n+\n(\n4\n/\n7)", 3) - -lineerror("a\n=\n-\n\nprint\n;", 3) - -lineerror([[ -a -( -23) -]], 1) - -lineerror([[ -local a = {x = 13} -a -. -x -( -23 -) -]], 2) - -lineerror([[ -local a = {x = 13} -a -. -x -( -23 + a -) -]], 6) - -local p = [[ - function g() f() end - function f(x) error('a', X) end -g() -]] -X=3;lineerror((p), 3) -X=0;lineerror((p), false) -X=1;lineerror((p), 2) -X=2;lineerror((p), 1) - - -lineerror([[ -local b = false -if not b then - error 'test' -end]], 3) - -lineerror([[ -local b = false -if not b then - if not b then - if not b then - error 'test' - end - end -end]], 5) - -do - -- Force a negative estimate for base line. Error in instruction 2 - -- (after VARARGPREP, GETGLOBAL), with first absolute line information - -- (forced by too many lines) in instruction 0. - local s = string.format("%s return __A.x", string.rep("\n", 300)) - lineerror(s, 301) -end - - -if not _soft then - -- several tests that exaust the Lua stack - collectgarbage() - print"testing stack overflow" - C = 0 - -- get line where stack overflow will happen - local l = debug.getinfo(1, "l").currentline + 1 - local function auxy () C=C+1; auxy() end -- produce a stack overflow - function y () - collectgarbage("stop") -- avoid running finalizers without stack space - auxy() - collectgarbage("restart") - end - - local function checkstackmessage (m) - print("(expected stack overflow after " .. C .. " calls)") - C = 0 -- prepare next count - return (string.find(m, "stack overflow")) - end - -- repeated stack overflows (to check stack recovery) - assert(checkstackmessage(doit('y()'))) - assert(checkstackmessage(doit('y()'))) - assert(checkstackmessage(doit('y()'))) - - - -- error lines in stack overflow - local l1 - local function g(x) - l1 = debug.getinfo(x, "l").currentline + 2 - collectgarbage("stop") -- avoid running finalizers without stack space - auxy() - collectgarbage("restart") - end - local _, stackmsg = xpcall(g, debug.traceback, 1) - print('+') - local stack = {} - for line in string.gmatch(stackmsg, "[^\n]*") do - local curr = string.match(line, ":(%d+):") - if curr then table.insert(stack, tonumber(curr)) end - end - local i=1 - while stack[i] ~= l1 do - assert(stack[i] == l) - i = i+1 - end - assert(i > 15) - - - -- error in error handling - local res, msg = xpcall(error, error) - assert(not res and type(msg) == 'string') - print('+') - - local function f (x) - if x==0 then error('a\n') - else - local aux = function () return f(x-1) end - local a,b = xpcall(aux, aux) - return a,b - end - end - f(3) - - local function loop (x,y,z) return 1 + loop(x, y, z) end - - local res, msg = xpcall(loop, function (m) - assert(string.find(m, "stack overflow")) - checkerr("error handling", loop) - assert(math.sin(0) == 0) - return 15 - end) - assert(msg == 15) - - local f = function () - for i = 999900, 1000000, 1 do table.unpack({}, 1, i) end - end - checkerr("too many results", f) - -end - - -do - -- non string messages - local t = {} - local res, msg = pcall(function () error(t) end) - assert(not res and msg == t) - - res, msg = pcall(function () error(nil) end) - assert(not res and msg == nil) - - local function f() error{msg='x'} end - res, msg = xpcall(f, function (r) return {msg=r.msg..'y'} end) - assert(msg.msg == 'xy') - - -- 'assert' with extra arguments - res, msg = pcall(assert, false, "X", t) - assert(not res and msg == "X") - - -- 'assert' with no message - res, msg = pcall(function () assert(false) end) - local line = string.match(msg, "%w+%.lua:(%d+): assertion failed!$") - assert(tonumber(line) == debug.getinfo(1, "l").currentline - 2) - - -- 'assert' with non-string messages - res, msg = pcall(assert, false, t) - assert(not res and msg == t) - - res, msg = pcall(assert, nil, nil) - assert(not res and msg == nil) - - -- 'assert' without arguments - res, msg = pcall(assert) - assert(not res and string.find(msg, "value expected")) -end - --- xpcall with arguments -a, b, c = xpcall(string.find, error, "alo", "al") -assert(a and b == 1 and c == 2) -a, b, c = xpcall(string.find, function (x) return {} end, true, "al") -assert(not a and type(b) == "table" and c == nil) - - -print("testing tokens in error messages") -checksyntax("syntax error", "", "error", 1) -checksyntax("1.000", "", "1.000", 1) -checksyntax("[[a]]", "", "[[a]]", 1) -checksyntax("'aa'", "", "'aa'", 1) -checksyntax("while << do end", "", "<<", 1) -checksyntax("for >> do end", "", ">>", 1) - --- test invalid non-printable char in a chunk -checksyntax("a\1a = 1", "", "<\\1>", 1) - --- test 255 as first char in a chunk -checksyntax("\255a = 1", "", "<\\255>", 1) - -doit('I = load("a=9+"); a=3') -assert(a==3 and not I) -print('+') - -lim = 1000 -if _soft then lim = 100 end -for i=1,lim do - doit('a = ') - doit('a = 4+nil') -end - - --- testing syntax limits - -local function testrep (init, rep, close, repc, finalresult) - local s = init .. string.rep(rep, 100) .. close .. string.rep(repc, 100) - local res, msg = load(s) - assert(res) -- 100 levels is OK - if (finalresult) then - assert(res() == finalresult) - end - s = init .. string.rep(rep, 500) - local res, msg = load(s) -- 500 levels not ok - assert(not res and (string.find(msg, "too many") or - string.find(msg, "overflow"))) -end - -testrep("local a; a", ",a", "= 1", ",1") -- multiple assignment -testrep("local a; a=", "{", "0", "}") -testrep("return ", "(", "2", ")", 2) -testrep("local function a (x) return x end; return ", "a(", "2.2", ")", 2.2) -testrep("", "do ", "", " end") -testrep("", "while a do ", "", " end") -testrep("local a; ", "if a then else ", "", " end") -testrep("", "function foo () ", "", " end") -testrep("local a = ''; return ", "a..", "'a'", "", "a") -testrep("local a = 1; return ", "a^", "a", "", 1) - -checkmessage("a = f(x" .. string.rep(",x", 260) .. ")", "too many registers") - - --- testing other limits - --- upvalues -local lim = 127 -local s = "local function fooA ()\n local " -for j = 1,lim do - s = s.."a"..j..", " -end -s = s.."b,c\n" -s = s.."local function fooB ()\n local " -for j = 1,lim do - s = s.."b"..j..", " -end -s = s.."b\n" -s = s.."function fooC () return b+c" -local c = 1+2 -for j = 1,lim do - s = s.."+a"..j.."+b"..j - c = c + 2 -end -s = s.."\nend end end" -local a,b = load(s) -assert(c > 255 and string.find(b, "too many upvalues") and - string.find(b, "line 5")) - --- local variables -s = "\nfunction foo ()\n local " -for j = 1,300 do - s = s.."a"..j..", " -end -s = s.."b\n" -local a,b = load(s) -assert(string.find(b, "line 2") and string.find(b, "too many local variables")) - -mt.__index = oldmm - -print('OK') diff --git a/lua-5.4.4-tests/events.lua b/lua-5.4.4-tests/events.lua deleted file mode 100644 index 17a7366..0000000 --- a/lua-5.4.4-tests/events.lua +++ /dev/null @@ -1,488 +0,0 @@ --- $Id: testes/events.lua $ --- See Copyright Notice in file all.lua - -print('testing metatables') - -local debug = require'debug' - -X = 20; B = 30 - -_ENV = setmetatable({}, {__index=_G}) - -collectgarbage() - -X = X+10 -assert(X == 30 and _G.X == 20) -B = false -assert(B == false) -_ENV["B"] = undef -assert(B == 30) - -assert(getmetatable{} == nil) -assert(getmetatable(4) == nil) -assert(getmetatable(nil) == nil) -a={name = "NAME"}; setmetatable(a, {__metatable = "xuxu", - __tostring=function(x) return x.name end}) -assert(getmetatable(a) == "xuxu") -assert(tostring(a) == "NAME") --- cannot change a protected metatable -assert(pcall(setmetatable, a, {}) == false) -a.name = "gororoba" -assert(tostring(a) == "gororoba") - -local a, t = {10,20,30; x="10", y="20"}, {} -assert(setmetatable(a,t) == a) -assert(getmetatable(a) == t) -assert(setmetatable(a,nil) == a) -assert(getmetatable(a) == nil) -assert(setmetatable(a,t) == a) - - -function f (t, i, e) - assert(not e) - local p = rawget(t, "parent") - return (p and p[i]+3), "dummy return" -end - -t.__index = f - -a.parent = {z=25, x=12, [4] = 24} -assert(a[1] == 10 and a.z == 28 and a[4] == 27 and a.x == "10") - -collectgarbage() - -a = setmetatable({}, t) -function f(t, i, v) rawset(t, i, v-3) end -setmetatable(t, t) -- causes a bug in 5.1 ! -t.__newindex = f -a[1] = 30; a.x = "101"; a[5] = 200 -assert(a[1] == 27 and a.x == 98 and a[5] == 197) - -do -- bug in Lua 5.3.2 - local mt = {} - mt.__newindex = mt - local t = setmetatable({}, mt) - t[1] = 10 -- will segfault on some machines - assert(mt[1] == 10) -end - - -local c = {} -a = setmetatable({}, t) -t.__newindex = c -t.__index = c -a[1] = 10; a[2] = 20; a[3] = 90; -for i = 4, 20 do a[i] = i * 10 end -assert(a[1] == 10 and a[2] == 20 and a[3] == 90) -for i = 4, 20 do assert(a[i] == i * 10) end -assert(next(a) == nil) - - -do - local a; - a = setmetatable({}, {__index = setmetatable({}, - {__index = setmetatable({}, - {__index = function (_,n) return a[n-3]+4, "lixo" end})})}) - a[0] = 20 - for i=0,10 do - assert(a[i*3] == 20 + i*4) - end -end - - -do -- newindex - local foi - local a = {} - for i=1,10 do a[i] = 0; a['a'..i] = 0; end - setmetatable(a, {__newindex = function (t,k,v) foi=true; rawset(t,k,v) end}) - foi = false; a[1]=0; assert(not foi) - foi = false; a['a1']=0; assert(not foi) - foi = false; a['a11']=0; assert(foi) - foi = false; a[11]=0; assert(foi) - foi = false; a[1]=undef; assert(not foi) - a[1] = undef - foi = false; a[1]=nil; assert(foi) -end - - -setmetatable(t, nil) -function f (t, ...) return t, {...} end -t.__call = f - -do - local x,y = a(table.unpack{'a', 1}) - assert(x==a and y[1]=='a' and y[2]==1 and y[3]==undef) - x,y = a() - assert(x==a and y[1]==undef) -end - - -local b = setmetatable({}, t) -setmetatable(b,t) - -function f(op) - return function (...) cap = {[0] = op, ...} ; return (...) end -end -t.__add = f("add") -t.__sub = f("sub") -t.__mul = f("mul") -t.__div = f("div") -t.__idiv = f("idiv") -t.__mod = f("mod") -t.__unm = f("unm") -t.__pow = f("pow") -t.__len = f("len") -t.__band = f("band") -t.__bor = f("bor") -t.__bxor = f("bxor") -t.__shl = f("shl") -t.__shr = f("shr") -t.__bnot = f("bnot") -t.__lt = f("lt") -t.__le = f("le") - - -local function checkcap (t) - assert(#cap + 1 == #t) - for i = 1, #t do - assert(cap[i - 1] == t[i]) - assert(math.type(cap[i - 1]) == math.type(t[i])) - end -end - --- Some tests are done inside small anonymous functions to ensure --- that constants go to constant table even in debug compilation, --- when the constant table is very small. -assert(b+5 == b); checkcap{"add", b, 5} -assert(5.2 + b == 5.2); checkcap{"add", 5.2, b} -assert(b+'5' == b); checkcap{"add", b, '5'} -assert(5+b == 5); checkcap{"add", 5, b} -assert('5'+b == '5'); checkcap{"add", '5', b} -b=b-3; assert(getmetatable(b) == t); checkcap{"sub", b, 3} -assert(5-a == 5); checkcap{"sub", 5, a} -assert('5'-a == '5'); checkcap{"sub", '5', a} -assert(a*a == a); checkcap{"mul", a, a} -assert(a/0 == a); checkcap{"div", a, 0} -assert(a/0.0 == a); checkcap{"div", a, 0.0} -assert(a%2 == a); checkcap{"mod", a, 2} -assert(a // (1/0) == a); checkcap{"idiv", a, 1/0} -;(function () assert(a & "hi" == a) end)(); checkcap{"band", a, "hi"} -;(function () assert(10 & a == 10) end)(); checkcap{"band", 10, a} -;(function () assert(a | 10 == a) end)(); checkcap{"bor", a, 10} -assert(a | "hi" == a); checkcap{"bor", a, "hi"} -assert("hi" ~ a == "hi"); checkcap{"bxor", "hi", a} -;(function () assert(10 ~ a == 10) end)(); checkcap{"bxor", 10, a} -assert(-a == a); checkcap{"unm", a, a} -assert(a^4.0 == a); checkcap{"pow", a, 4.0} -assert(a^'4' == a); checkcap{"pow", a, '4'} -assert(4^a == 4); checkcap{"pow", 4, a} -assert('4'^a == '4'); checkcap{"pow", '4', a} -assert(#a == a); checkcap{"len", a, a} -assert(~a == a); checkcap{"bnot", a, a} -assert(a << 3 == a); checkcap{"shl", a, 3} -assert(1.5 >> a == 1.5); checkcap{"shr", 1.5, a} - --- for comparison operators, all results are true -assert(5.0 > a); checkcap{"lt", a, 5.0} -assert(a >= 10); checkcap{"le", 10, a} -assert(a <= -10.0); checkcap{"le", a, -10.0} -assert(a < -10); checkcap{"lt", a, -10} - - --- test for rawlen -t = setmetatable({1,2,3}, {__len = function () return 10 end}) -assert(#t == 10 and rawlen(t) == 3) -assert(rawlen"abc" == 3) -assert(not pcall(rawlen, io.stdin)) -assert(not pcall(rawlen, 34)) -assert(not pcall(rawlen)) - --- rawlen for long strings -assert(rawlen(string.rep('a', 1000)) == 1000) - - -t = {} -t.__lt = function (a,b,c) - collectgarbage() - assert(c == nil) - if type(a) == 'table' then a = a.x end - if type(b) == 'table' then b = b.x end - return aOp(1)) and not(Op(1)>Op(2)) and (Op(2)>Op(1))) - assert(not(Op('a')>Op('a')) and not(Op('a')>Op('b')) and (Op('b')>Op('a'))) - assert((Op(1)>=Op(1)) and not(Op(1)>=Op(2)) and (Op(2)>=Op(1))) - assert((1 >= Op(1)) and not(1 >= Op(2)) and (Op(2) >= 1)) - assert((Op('a')>=Op('a')) and not(Op('a')>=Op('b')) and (Op('b')>=Op('a'))) - assert(('a' >= Op('a')) and not(Op('a') >= 'b') and (Op('b') >= Op('a'))) - assert(Op(1) == Op(1) and Op(1) ~= Op(2)) - assert(Op('a') == Op('a') and Op('a') ~= Op('b')) - assert(a == a and a ~= b) - assert(Op(3) == c) -end - -test(Op(1), Op(2), Op(3)) - - --- test `partial order' - -local function rawSet(x) - local y = {} - for _,k in pairs(x) do y[k] = 1 end - return y -end - -local function Set(x) - return setmetatable(rawSet(x), t) -end - -t.__lt = function (a,b) - for k in pairs(a) do - if not b[k] then return false end - b[k] = undef - end - return next(b) ~= nil -end - -t.__le = function (a,b) - for k in pairs(a) do - if not b[k] then return false end - end - return true -end - -assert(Set{1,2,3} < Set{1,2,3,4}) -assert(not(Set{1,2,3,4} < Set{1,2,3,4})) -assert((Set{1,2,3,4} <= Set{1,2,3,4})) -assert((Set{1,2,3,4} >= Set{1,2,3,4})) -assert(not (Set{1,3} <= Set{3,5})) -assert(not(Set{1,3} <= Set{3,5})) -assert(not(Set{1,3} >= Set{3,5})) - - -t.__eq = function (a,b) - for k in pairs(a) do - if not b[k] then return false end - b[k] = undef - end - return next(b) == nil -end - -local s = Set{1,3,5} -assert(s == Set{3,5,1}) -assert(not rawequal(s, Set{3,5,1})) -assert(rawequal(s, s)) -assert(Set{1,3,5,1} == rawSet{3,5,1}) -assert(rawSet{1,3,5,1} == Set{3,5,1}) -assert(Set{1,3,5} ~= Set{3,5,1,6}) - --- '__eq' is not used for table accesses -t[Set{1,3,5}] = 1 -assert(t[Set{1,3,5}] == undef) - - -do -- test invalidating flags - local mt = {__eq = true} - local a = setmetatable({10}, mt) - local b = setmetatable({10}, mt) - mt.__eq = nil - assert(a ~= b) -- no metamethod - mt.__eq = function (x,y) return x[1] == y[1] end - assert(a == b) -- must use metamethod now -end - - -if not T then - (Message or print)('\n >>> testC not active: skipping tests for \z -userdata <<<\n') -else - local u1 = T.newuserdata(0, 1) - local u2 = T.newuserdata(0, 1) - local u3 = T.newuserdata(0, 1) - assert(u1 ~= u2 and u1 ~= u3) - debug.setuservalue(u1, 1); - debug.setuservalue(u2, 2); - debug.setuservalue(u3, 1); - debug.setmetatable(u1, {__eq = function (a, b) - return debug.getuservalue(a) == debug.getuservalue(b) - end}) - debug.setmetatable(u2, {__eq = function (a, b) - return true - end}) - assert(u1 == u3 and u3 == u1 and u1 ~= u2) - assert(u2 == u1 and u2 == u3 and u3 == u2) - assert(u2 ~= {}) -- different types cannot be equal - assert(rawequal(u1, u1) and not rawequal(u1, u3)) - - local mirror = {} - debug.setmetatable(u3, {__index = mirror, __newindex = mirror}) - for i = 1, 10 do u3[i] = i end - for i = 1, 10 do assert(u3[i] == i) end -end - - -t.__concat = function (a,b,c) - assert(c == nil) - if type(a) == 'table' then a = a.val end - if type(b) == 'table' then b = b.val end - if A then return a..b - else - return setmetatable({val=a..b}, t) - end -end - -c = {val="c"}; setmetatable(c, t) -d = {val="d"}; setmetatable(d, t) - -A = true -assert(c..d == 'cd') -assert(0 .."a".."b"..c..d.."e".."f"..(5+3).."g" == "0abcdef8g") - -A = false -assert((c..d..c..d).val == 'cdcd') -x = c..d -assert(getmetatable(x) == t and x.val == 'cd') -x = 0 .."a".."b"..c..d.."e".."f".."g" -assert(x.val == "0abcdefg") - - --- concat metamethod x numbers (bug in 5.1.1) -c = {} -local x -setmetatable(c, {__concat = function (a,b) - assert(type(a) == "number" and b == c or type(b) == "number" and a == c) - return c -end}) -assert(c..5 == c and 5 .. c == c) -assert(4 .. c .. 5 == c and 4 .. 5 .. 6 .. 7 .. c == c) - - --- test comparison compatibilities -local t1, t2, c, d -t1 = {}; c = {}; setmetatable(c, t1) -d = {} -t1.__eq = function () return true end -t1.__lt = function () return true end -t1.__le = function () return false end -setmetatable(d, t1) -assert(c == d and c < d and not(d <= c)) -t2 = {} -t2.__eq = t1.__eq -t2.__lt = t1.__lt -setmetatable(d, t2) -assert(c == d and c < d and not(d <= c)) - - - --- test for several levels of calls -local i -local tt = { - __call = function (t, ...) - i = i+1 - if t.f then return t.f(...) - else return {...} - end - end -} - -local a = setmetatable({}, tt) -local b = setmetatable({f=a}, tt) -local c = setmetatable({f=b}, tt) - -i = 0 -x = c(3,4,5) -assert(i == 3 and x[1] == 3 and x[3] == 5) - - -assert(_G.X == 20) - -print'+' - -local _g = _G -_ENV = setmetatable({}, {__index=function (_,k) return _g[k] end}) - - -a = {} -rawset(a, "x", 1, 2, 3) -assert(a.x == 1 and rawget(a, "x", 3) == 1) - -print '+' - --- testing metatables for basic types -mt = {__index = function (a,b) return a+b end, - __len = function (x) return math.floor(x) end} -debug.setmetatable(10, mt) -assert(getmetatable(-2) == mt) -assert((10)[3] == 13) -assert((10)["3"] == 13) -assert(#3.45 == 3) -debug.setmetatable(23, nil) -assert(getmetatable(-2) == nil) - -debug.setmetatable(true, mt) -assert(getmetatable(false) == mt) -mt.__index = function (a,b) return a or b end -assert((true)[false] == true) -assert((false)[false] == false) -debug.setmetatable(false, nil) -assert(getmetatable(true) == nil) - -debug.setmetatable(nil, mt) -assert(getmetatable(nil) == mt) -mt.__add = function (a,b) return (a or 1) + (b or 2) end -assert(10 + nil == 12) -assert(nil + 23 == 24) -assert(nil + nil == 3) -debug.setmetatable(nil, nil) -assert(getmetatable(nil) == nil) - -debug.setmetatable(nil, {}) - - --- loops in delegation -a = {}; setmetatable(a, a); a.__index = a; a.__newindex = a -assert(not pcall(function (a,b) return a[b] end, a, 10)) -assert(not pcall(function (a,b,c) a[b] = c end, a, 10, true)) - --- bug in 5.1 -T, K, V = nil -grandparent = {} -grandparent.__newindex = function(t,k,v) T=t; K=k; V=v end - -parent = {} -parent.__newindex = parent -setmetatable(parent, grandparent) - -child = setmetatable({}, parent) -child.foo = 10 --> CRASH (on some machines) -assert(T == parent and K == "foo" and V == 10) - -print 'OK' - -return 12 - - diff --git a/lua-5.4.4-tests/files.lua b/lua-5.4.4-tests/files.lua deleted file mode 100644 index 16cf9b6..0000000 --- a/lua-5.4.4-tests/files.lua +++ /dev/null @@ -1,940 +0,0 @@ --- $Id: testes/files.lua $ --- See Copyright Notice in file all.lua - -local debug = require "debug" - -local maxint = math.maxinteger - -assert(type(os.getenv"PATH") == "string") - -assert(io.input(io.stdin) == io.stdin) -assert(not pcall(io.input, "non-existent-file")) -assert(io.output(io.stdout) == io.stdout) - - -local function testerr (msg, f, ...) - local stat, err = pcall(f, ...) - return (not stat and string.find(err, msg, 1, true)) -end - - -local function checkerr (msg, f, ...) - assert(testerr(msg, f, ...)) -end - - --- cannot close standard files -assert(not io.close(io.stdin) and - not io.stdout:close() and - not io.stderr:close()) - --- cannot call close method without an argument (new in 5.3.5) -checkerr("got no value", io.stdin.close) - - -assert(type(io.input()) == "userdata" and io.type(io.output()) == "file") -assert(type(io.stdin) == "userdata" and io.type(io.stderr) == "file") -assert(not io.type(8)) -local a = {}; setmetatable(a, {}) -assert(not io.type(a)) - -assert(getmetatable(io.input()).__name == "FILE*") - -local a,b,c = io.open('xuxu_nao_existe') -assert(not a and type(b) == "string" and type(c) == "number") - -a,b,c = io.open('/a/b/c/d', 'w') -assert(not a and type(b) == "string" and type(c) == "number") - -local file = os.tmpname() -local f, msg = io.open(file, "w") -if not f then - (Message or print)("'os.tmpname' file cannot be open; skipping file tests") - -else --{ most tests here need tmpname -f:close() - -print('testing i/o') - -local otherfile = os.tmpname() - -checkerr("invalid mode", io.open, file, "rw") -checkerr("invalid mode", io.open, file, "rb+") -checkerr("invalid mode", io.open, file, "r+bk") -checkerr("invalid mode", io.open, file, "") -checkerr("invalid mode", io.open, file, "+") -checkerr("invalid mode", io.open, file, "b") -assert(io.open(file, "r+b")):close() -assert(io.open(file, "r+")):close() -assert(io.open(file, "rb")):close() - -assert(os.setlocale('C', 'all')) - -io.input(io.stdin); io.output(io.stdout); - -os.remove(file) -assert(not loadfile(file)) -checkerr("", dofile, file) -assert(not io.open(file)) -io.output(file) -assert(io.output() ~= io.stdout) - -if not _port then -- invalid seek - local status, msg, code = io.stdin:seek("set", 1000) - assert(not status and type(msg) == "string" and type(code) == "number") -end - -assert(io.output():seek() == 0) -assert(io.write("alo alo"):seek() == string.len("alo alo")) -assert(io.output():seek("cur", -3) == string.len("alo alo")-3) -assert(io.write("joao")) -assert(io.output():seek("end") == string.len("alo joao")) - -assert(io.output():seek("set") == 0) - -assert(io.write('"álo"', "{a}\n", "second line\n", "third line \n")) -assert(io.write('çfourth_line')) -io.output(io.stdout) -collectgarbage() -- file should be closed by GC -assert(io.input() == io.stdin and rawequal(io.output(), io.stdout)) -print('+') - --- test GC for files -collectgarbage() -for i=1,120 do - for i=1,5 do - io.input(file) - assert(io.open(file, 'r')) - io.lines(file) - end - collectgarbage() -end - -io.input():close() -io.close() - -assert(os.rename(file, otherfile)) -assert(not os.rename(file, otherfile)) - -io.output(io.open(otherfile, "ab")) -assert(io.write("\n\n\t\t ", 3450, "\n")); -io.close() - - -do - -- closing file by scope - local F = nil - do - local f = assert(io.open(file, "w")) - F = f - end - assert(tostring(F) == "file (closed)") -end -assert(os.remove(file)) - - -do - -- test writing/reading numbers - local f = assert(io.open(file, "w")) - f:write(maxint, '\n') - f:write(string.format("0X%x\n", maxint)) - f:write("0xABCp-3", '\n') - f:write(0, '\n') - f:write(-maxint, '\n') - f:write(string.format("0x%X\n", -maxint)) - f:write("-0xABCp-3", '\n') - assert(f:close()) - local f = assert(io.open(file, "r")) - assert(f:read("n") == maxint) - assert(f:read("n") == maxint) - assert(f:read("n") == 0xABCp-3) - assert(f:read("n") == 0) - assert(f:read("*n") == -maxint) -- test old format (with '*') - assert(f:read("n") == -maxint) - assert(f:read("*n") == -0xABCp-3) -- test old format (with '*') -end -assert(os.remove(file)) - - --- testing multiple arguments to io.read -do - local f = assert(io.open(file, "w")) - f:write[[ -a line -another line -1234 -3.45 -one -two -three -]] - local l1, l2, l3, l4, n1, n2, c, dummy - assert(f:close()) - local f = assert(io.open(file, "r")) - l1, l2, n1, n2, dummy = f:read("l", "L", "n", "n") - assert(l1 == "a line" and l2 == "another line\n" and - n1 == 1234 and n2 == 3.45 and dummy == nil) - assert(f:close()) - local f = assert(io.open(file, "r")) - l1, l2, n1, n2, c, l3, l4, dummy = f:read(7, "l", "n", "n", 1, "l", "l") - assert(l1 == "a line\n" and l2 == "another line" and c == '\n' and - n1 == 1234 and n2 == 3.45 and l3 == "one" and l4 == "two" - and dummy == nil) - assert(f:close()) - local f = assert(io.open(file, "r")) - -- second item failing - l1, n1, n2, dummy = f:read("l", "n", "n", "l") - assert(l1 == "a line" and not n1) -end -assert(os.remove(file)) - - - --- test yielding during 'dofile' -f = assert(io.open(file, "w")) -f:write[[ -local x, z = coroutine.yield(10) -local y = coroutine.yield(20) -return x + y * z -]] -assert(f:close()) -f = coroutine.wrap(dofile) -assert(f(file) == 10) -assert(f(100, 101) == 20) -assert(f(200) == 100 + 200 * 101) -assert(os.remove(file)) - - -f = assert(io.open(file, "w")) --- test number termination -f:write[[ --12.3- -0xffff+ .3|5.E-3X +234e+13E 0xDEADBEEFDEADBEEFx -0x1.13Ap+3e -]] --- very long number -f:write("1234"); for i = 1, 1000 do f:write("0") end; f:write("\n") --- invalid sequences (must read and discard valid prefixes) -f:write[[ -.e+ 0.e; --; 0xX; -]] -assert(f:close()) -f = assert(io.open(file, "r")) -assert(f:read("n") == -12.3); assert(f:read(1) == "-") -assert(f:read("n") == -0xffff); assert(f:read(2) == "+ ") -assert(f:read("n") == 0.3); assert(f:read(1) == "|") -assert(f:read("n") == 5e-3); assert(f:read(1) == "X") -assert(f:read("n") == 234e13); assert(f:read(1) == "E") -assert(f:read("n") == 0Xdeadbeefdeadbeef); assert(f:read(2) == "x\n") -assert(f:read("n") == 0x1.13aP3); assert(f:read(1) == "e") - -do -- attempt to read too long number - assert(not f:read("n")) -- fails - local s = f:read("L") -- read rest of line - assert(string.find(s, "^00*\n$")) -- lots of 0's left -end - -assert(not f:read("n")); assert(f:read(2) == "e+") -assert(not f:read("n")); assert(f:read(1) == ";") -assert(not f:read("n")); assert(f:read(2) == "-;") -assert(not f:read("n")); assert(f:read(1) == "X") -assert(not f:read("n")); assert(f:read(1) == ";") -assert(not f:read("n")); assert(not f:read(0)) -- end of file -assert(f:close()) -assert(os.remove(file)) - - --- test line generators -assert(not pcall(io.lines, "non-existent-file")) -assert(os.rename(otherfile, file)) -io.output(otherfile) -local n = 0 -local f = io.lines(file) -while f() do n = n + 1 end; -assert(n == 6) -- number of lines in the file -checkerr("file is already closed", f) -checkerr("file is already closed", f) --- copy from file to otherfile -n = 0 -for l in io.lines(file) do io.write(l, "\n"); n = n + 1 end -io.close() -assert(n == 6) --- copy from otherfile back to file -local f = assert(io.open(otherfile)) -assert(io.type(f) == "file") -io.output(file) -assert(not io.output():read()) -n = 0 -for l in f:lines() do io.write(l, "\n"); n = n + 1 end -assert(tostring(f):sub(1, 5) == "file ") -assert(f:close()); io.close() -assert(n == 6) -checkerr("closed file", io.close, f) -assert(tostring(f) == "file (closed)") -assert(io.type(f) == "closed file") -io.input(file) -f = io.open(otherfile):lines() -n = 0 -for l in io.lines() do assert(l == f()); n = n + 1 end -f = nil; collectgarbage() -assert(n == 6) -assert(os.remove(otherfile)) - -do -- bug in 5.3.1 - io.output(otherfile) - io.write(string.rep("a", 300), "\n") - io.close() - local t ={}; for i = 1, 250 do t[i] = 1 end - t = {io.lines(otherfile, table.unpack(t))()} - -- everything ok here - assert(#t == 250 and t[1] == 'a' and t[#t] == 'a') - t[#t + 1] = 1 -- one too many - checkerr("too many arguments", io.lines, otherfile, table.unpack(t)) - collectgarbage() -- ensure 'otherfile' is closed - assert(os.remove(otherfile)) -end - -io.input(file) -do -- test error returns - local a,b,c = io.input():write("xuxu") - assert(not a and type(b) == "string" and type(c) == "number") -end -checkerr("invalid format", io.read, "x") -assert(io.read(0) == "") -- not eof -assert(io.read(5, 'l') == '"álo"') -assert(io.read(0) == "") -assert(io.read() == "second line") -local x = io.input():seek() -assert(io.read() == "third line ") -assert(io.input():seek("set", x)) -assert(io.read('L') == "third line \n") -assert(io.read(1) == "ç") -assert(io.read(string.len"fourth_line") == "fourth_line") -assert(io.input():seek("cur", -string.len"fourth_line")) -assert(io.read() == "fourth_line") -assert(io.read() == "") -- empty line -assert(io.read('n') == 3450) -assert(io.read(1) == '\n') -assert(not io.read(0)) -- end of file -assert(not io.read(1)) -- end of file -assert(not io.read(30000)) -- end of file -assert(({io.read(1)})[2] == undef) -assert(not io.read()) -- end of file -assert(({io.read()})[2] == undef) -assert(not io.read('n')) -- end of file -assert(({io.read('n')})[2] == undef) -assert(io.read('a') == '') -- end of file (OK for 'a') -assert(io.read('a') == '') -- end of file (OK for 'a') -collectgarbage() -print('+') -io.close(io.input()) -checkerr(" input file is closed", io.read) - -assert(os.remove(file)) - -local t = '0123456789' -for i=1,10 do t = t..t; end -assert(string.len(t) == 10*2^10) - -io.output(file) -io.write("alo"):write("\n") -io.close() -checkerr(" output file is closed", io.write) -local f = io.open(file, "a+b") -io.output(f) -collectgarbage() - -assert(io.write(' ' .. t .. ' ')) -assert(io.write(';', 'end of file\n')) -f:flush(); io.flush() -f:close() -print('+') - -io.input(file) -assert(io.read() == "alo") -assert(io.read(1) == ' ') -assert(io.read(string.len(t)) == t) -assert(io.read(1) == ' ') -assert(io.read(0)) -assert(io.read('a') == ';end of file\n') -assert(not io.read(0)) -assert(io.close(io.input())) - - --- test errors in read/write -do - local function ismsg (m) - -- error message is not a code number - return (type(m) == "string" and not tonumber(m)) - end - - -- read - local f = io.open(file, "w") - local r, m, c = f:read() - assert(not r and ismsg(m) and type(c) == "number") - assert(f:close()) - -- write - f = io.open(file, "r") - r, m, c = f:write("whatever") - assert(not r and ismsg(m) and type(c) == "number") - assert(f:close()) - -- lines - f = io.open(file, "w") - r, m = pcall(f:lines()) - assert(r == false and ismsg(m)) - assert(f:close()) -end - -assert(os.remove(file)) - --- test for L format -io.output(file); io.write"\n\nline\nother":close() -io.input(file) -assert(io.read"L" == "\n") -assert(io.read"L" == "\n") -assert(io.read"L" == "line\n") -assert(io.read"L" == "other") -assert(not io.read"L") -io.input():close() - -local f = assert(io.open(file)) -local s = "" -for l in f:lines("L") do s = s .. l end -assert(s == "\n\nline\nother") -f:close() - -io.input(file) -s = "" -for l in io.lines(nil, "L") do s = s .. l end -assert(s == "\n\nline\nother") -io.input():close() - -s = "" -for l in io.lines(file, "L") do s = s .. l end -assert(s == "\n\nline\nother") - -s = "" -for l in io.lines(file, "l") do s = s .. l end -assert(s == "lineother") - -io.output(file); io.write"a = 10 + 34\na = 2*a\na = -a\n":close() -local t = {} -assert(load(io.lines(file, "L"), nil, nil, t))() -assert(t.a == -((10 + 34) * 2)) - - -do -- testing closing file in line iteration - - -- get the to-be-closed variable from a loop - local function gettoclose (lv) - lv = lv + 1 - local stvar = 0 -- to-be-closed is 4th state variable in the loop - for i = 1, 1000 do - local n, v = debug.getlocal(lv, i) - if n == "(for state)" then - stvar = stvar + 1 - if stvar == 4 then return v end - end - end - end - - local f - for l in io.lines(file) do - f = gettoclose(1) - assert(io.type(f) == "file") - break - end - assert(io.type(f) == "closed file") - - f = nil - local function foo (name) - for l in io.lines(name) do - f = gettoclose(1) - assert(io.type(f) == "file") - error(f) -- exit loop with an error - end - end - local st, msg = pcall(foo, file) - assert(st == false and io.type(msg) == "closed file") - -end - - --- test for multipe arguments in 'lines' -io.output(file); io.write"0123456789\n":close() -for a,b in io.lines(file, 1, 1) do - if a == "\n" then assert(not b) - else assert(tonumber(a) == tonumber(b) - 1) - end -end - -for a,b,c in io.lines(file, 1, 2, "a") do - assert(a == "0" and b == "12" and c == "3456789\n") -end - -for a,b,c in io.lines(file, "a", 0, 1) do - if a == "" then break end - assert(a == "0123456789\n" and not b and not c) -end -collectgarbage() -- to close file in previous iteration - -io.output(file); io.write"00\n10\n20\n30\n40\n":close() -for a, b in io.lines(file, "n", "n") do - if a == 40 then assert(not b) - else assert(a == b - 10) - end -end - - --- test load x lines -io.output(file); -io.write[[ -local y -= X -X = -X * -2 + -X; -X = -X -- y; -]]:close() -_G.X = 1 -assert(not load((io.lines(file)))) -collectgarbage() -- to close file in previous iteration -load((io.lines(file, "L")))() -assert(_G.X == 2) -load((io.lines(file, 1)))() -assert(_G.X == 4) -load((io.lines(file, 3)))() -assert(_G.X == 8) - -print('+') - -local x1 = "string\n\n\\com \"\"''coisas [[estranhas]] ]]'" -io.output(file) -assert(io.write(string.format("x2 = %q\n-- comment without ending EOS", x1))) -io.close() -assert(loadfile(file))() -assert(x1 == x2) -print('+') -assert(os.remove(file)) -assert(not os.remove(file)) -assert(not os.remove(otherfile)) - --- testing loadfile -local function testloadfile (s, expres) - io.output(file) - if s then io.write(s) end - io.close() - local res = assert(loadfile(file))() - assert(os.remove(file)) - assert(res == expres) -end - --- loading empty file -testloadfile(nil, nil) - --- loading file with initial comment without end of line -testloadfile("# a non-ending comment", nil) - - --- checking Unicode BOM in files -testloadfile("\xEF\xBB\xBF# some comment\nreturn 234", 234) -testloadfile("\xEF\xBB\xBFreturn 239", 239) -testloadfile("\xEF\xBB\xBF", nil) -- empty file with a BOM - - --- checking line numbers in files with initial comments -testloadfile("# a comment\nreturn require'debug'.getinfo(1).currentline", 2) - - --- loading binary file -io.output(io.open(file, "wb")) -assert(io.write(string.dump(function () return 10, '\0alo\255', 'hi' end))) -io.close() -a, b, c = assert(loadfile(file))() -assert(a == 10 and b == "\0alo\255" and c == "hi") -assert(os.remove(file)) - --- bug in 5.2.1 -do - io.output(io.open(file, "wb")) - -- save function with no upvalues - assert(io.write(string.dump(function () return 1 end))) - io.close() - f = assert(loadfile(file, "b", {})) - assert(type(f) == "function" and f() == 1) - assert(os.remove(file)) -end - --- loading binary file with initial comment -io.output(io.open(file, "wb")) -assert(io.write("#this is a comment for a binary file\0\n", - string.dump(function () return 20, '\0\0\0' end))) -io.close() -a, b, c = assert(loadfile(file))() -assert(a == 20 and b == "\0\0\0" and c == nil) -assert(os.remove(file)) - - --- 'loadfile' with 'env' -do - local f = io.open(file, 'w') - f:write[[ - if (...) then a = 15; return b, c, d - else return _ENV - end - ]] - f:close() - local t = {b = 12, c = "xuxu", d = print} - local f = assert(loadfile(file, 't', t)) - local b, c, d = f(1) - assert(t.a == 15 and b == 12 and c == t.c and d == print) - assert(f() == t) - f = assert(loadfile(file, 't', nil)) - assert(f() == nil) - f = assert(loadfile(file)) - assert(f() == _G) - assert(os.remove(file)) -end - - --- 'loadfile' x modes -do - io.open(file, 'w'):write("return 10"):close() - local s, m = loadfile(file, 'b') - assert(not s and string.find(m, "a text chunk")) - io.open(file, 'w'):write("\27 return 10"):close() - local s, m = loadfile(file, 't') - assert(not s and string.find(m, "a binary chunk")) - assert(os.remove(file)) -end - - -io.output(file) -assert(io.write("qualquer coisa\n")) -assert(io.write("mais qualquer coisa")) -io.close() -assert(io.output(assert(io.open(otherfile, 'wb'))) - :write("outra coisa\0\1\3\0\0\0\0\255\0") - :close()) - -local filehandle = assert(io.open(file, 'r+')) -local otherfilehandle = assert(io.open(otherfile, 'rb')) -assert(filehandle ~= otherfilehandle) -assert(type(filehandle) == "userdata") -assert(filehandle:read('l') == "qualquer coisa") -io.input(otherfilehandle) -assert(io.read(string.len"outra coisa") == "outra coisa") -assert(filehandle:read('l') == "mais qualquer coisa") -filehandle:close(); -assert(type(filehandle) == "userdata") -io.input(otherfilehandle) -assert(io.read(4) == "\0\1\3\0") -assert(io.read(3) == "\0\0\0") -assert(io.read(0) == "") -- 255 is not eof -assert(io.read(1) == "\255") -assert(io.read('a') == "\0") -assert(not io.read(0)) -assert(otherfilehandle == io.input()) -otherfilehandle:close() -assert(os.remove(file)) -assert(os.remove(otherfile)) -collectgarbage() - -io.output(file) - :write[[ - 123.4 -56e-2 not a number -second line -third line - -and the rest of the file -]] - :close() -io.input(file) -local _,a,b,c,d,e,h,__ = io.read(1, 'n', 'n', 'l', 'l', 'l', 'a', 10) -assert(io.close(io.input())) -assert(_ == ' ' and not __) -assert(type(a) == 'number' and a==123.4 and b==-56e-2) -assert(d=='second line' and e=='third line') -assert(h==[[ - -and the rest of the file -]]) -assert(os.remove(file)) -collectgarbage() - --- testing buffers -do - local f = assert(io.open(file, "w")) - local fr = assert(io.open(file, "r")) - assert(f:setvbuf("full", 2000)) - f:write("x") - assert(fr:read("all") == "") -- full buffer; output not written yet - f:close() - fr:seek("set") - assert(fr:read("all") == "x") -- `close' flushes it - f = assert(io.open(file), "w") - assert(f:setvbuf("no")) - f:write("x") - fr:seek("set") - assert(fr:read("all") == "x") -- no buffer; output is ready - f:close() - f = assert(io.open(file, "a")) - assert(f:setvbuf("line")) - f:write("x") - fr:seek("set", 1) - assert(fr:read("all") == "") -- line buffer; no output without `\n' - f:write("a\n"):seek("set", 1) - assert(fr:read("all") == "xa\n") -- now we have a whole line - f:close(); fr:close() - assert(os.remove(file)) -end - - -if not _soft then - print("testing large files (> BUFSIZ)") - io.output(file) - for i=1,5001 do io.write('0123456789123') end - io.write('\n12346'):close() - io.input(file) - local x = io.read('a') - io.input():seek('set', 0) - local y = io.read(30001)..io.read(1005)..io.read(0).. - io.read(1)..io.read(100003) - assert(x == y and string.len(x) == 5001*13 + 6) - io.input():seek('set', 0) - y = io.read() -- huge line - assert(x == y..'\n'..io.read()) - assert(not io.read()) - io.close(io.input()) - assert(os.remove(file)) - x = nil; y = nil -end - -if not _port then - local progname - do -- get name of running executable - local arg = arg or ARG - local i = 0 - while arg[i] do i = i - 1 end - progname = '"' .. arg[i + 1] .. '"' - end - print("testing popen/pclose and execute") - -- invalid mode for popen - checkerr("invalid mode", io.popen, "cat", "") - checkerr("invalid mode", io.popen, "cat", "r+") - checkerr("invalid mode", io.popen, "cat", "rw") - do -- basic tests for popen - local file = os.tmpname() - local f = assert(io.popen("cat - > " .. file, "w")) - f:write("a line") - assert(f:close()) - local f = assert(io.popen("cat - < " .. file, "r")) - assert(f:read("a") == "a line") - assert(f:close()) - assert(os.remove(file)) - end - - local tests = { - -- command, what, code - {"ls > /dev/null", "ok"}, - {"not-to-be-found-command", "exit"}, - {"exit 3", "exit", 3}, - {"exit 129", "exit", 129}, - {"kill -s HUP $$", "signal", 1}, - {"kill -s KILL $$", "signal", 9}, - {"sh -c 'kill -s HUP $$'", "exit"}, - {progname .. ' -e " "', "ok"}, - {progname .. ' -e "os.exit(0, true)"', "ok"}, - {progname .. ' -e "os.exit(20, true)"', "exit", 20}, - } - print("\n(some error messages are expected now)") - for _, v in ipairs(tests) do - local x, y, z = io.popen(v[1]):close() - local x1, y1, z1 = os.execute(v[1]) - assert(x == x1 and y == y1 and z == z1) - if v[2] == "ok" then - assert(x and y == 'exit' and z == 0) - else - assert(not x and y == v[2]) -- correct status and 'what' - -- correct code if known (but always different from 0) - assert((v[3] == nil and z > 0) or v[3] == z) - end - end -end - - --- testing tmpfile -f = io.tmpfile() -assert(io.type(f) == "file") -f:write("alo") -f:seek("set") -assert(f:read"a" == "alo") - -end --} - -print'+' - -print("testing date/time") - -assert(os.date("") == "") -assert(os.date("!") == "") -assert(os.date("\0\0") == "\0\0") -assert(os.date("!\0\0") == "\0\0") -local x = string.rep("a", 10000) -assert(os.date(x) == x) -local t = os.time() -D = os.date("*t", t) -assert(os.date(string.rep("%d", 1000), t) == - string.rep(os.date("%d", t), 1000)) -assert(os.date(string.rep("%", 200)) == string.rep("%", 100)) - -local function checkDateTable (t) - _G.D = os.date("*t", t) - assert(os.time(D) == t) - load(os.date([[assert(D.year==%Y and D.month==%m and D.day==%d and - D.hour==%H and D.min==%M and D.sec==%S and - D.wday==%w+1 and D.yday==%j)]], t))() - _G.D = nil -end - -checkDateTable(os.time()) -if not _port then - -- assume that time_t can represent these values - checkDateTable(0) - checkDateTable(1) - checkDateTable(1000) - checkDateTable(0x7fffffff) - checkDateTable(0x80000000) -end - -checkerr("invalid conversion specifier", os.date, "%") -checkerr("invalid conversion specifier", os.date, "%9") -checkerr("invalid conversion specifier", os.date, "%") -checkerr("invalid conversion specifier", os.date, "%O") -checkerr("invalid conversion specifier", os.date, "%E") -checkerr("invalid conversion specifier", os.date, "%Ea") - -checkerr("not an integer", os.time, {year=1000, month=1, day=1, hour='x'}) -checkerr("not an integer", os.time, {year=1000, month=1, day=1, hour=1.5}) - -checkerr("missing", os.time, {hour = 12}) -- missing date - - -if string.packsize("i") == 4 then -- 4-byte ints - checkerr("field 'year' is out-of-bound", os.time, - {year = -(1 << 31) + 1899, month = 1, day = 1}) -end - -if not _port then - -- test Posix-specific modifiers - assert(type(os.date("%Ex")) == 'string') - assert(type(os.date("%Oy")) == 'string') - - -- test large dates (assume at least 4-byte ints and time_t) - local t0 = os.time{year = 1970, month = 1, day = 0} - local t1 = os.time{year = 1970, month = 1, day = 0, sec = (1 << 31) - 1} - assert(t1 - t0 == (1 << 31) - 1) - t0 = os.time{year = 1970, month = 1, day = 1} - t1 = os.time{year = 1970, month = 1, day = 1, sec = -(1 << 31)} - assert(t1 - t0 == -(1 << 31)) - - -- test out-of-range dates (at least for Unix) - if maxint >= 2^62 then -- cannot do these tests in Small Lua - -- no arith overflows - checkerr("out-of-bound", os.time, {year = -maxint, month = 1, day = 1}) - if string.packsize("i") == 4 then -- 4-byte ints - if testerr("out-of-bound", os.date, "%Y", 2^40) then - -- time_t has 4 bytes and therefore cannot represent year 4000 - print(" 4-byte time_t") - checkerr("cannot be represented", os.time, {year=4000, month=1, day=1}) - else - -- time_t has 8 bytes; an int year cannot represent a huge time - print(" 8-byte time_t") - checkerr("cannot be represented", os.date, "%Y", 2^60) - - -- this is the maximum year - assert(tonumber(os.time - {year=(1 << 31) + 1899, month=12, day=31, hour=23, min=59, sec=59})) - - -- this is too much - checkerr("represented", os.time, - {year=(1 << 31) + 1899, month=12, day=31, hour=23, min=59, sec=60}) - end - - -- internal 'int' fields cannot hold these values - checkerr("field 'day' is out-of-bound", os.time, - {year = 0, month = 1, day = 2^32}) - - checkerr("field 'month' is out-of-bound", os.time, - {year = 0, month = -((1 << 31) + 1), day = 1}) - - checkerr("field 'year' is out-of-bound", os.time, - {year = (1 << 31) + 1900, month = 1, day = 1}) - - else -- 8-byte ints - -- assume time_t has 8 bytes too - print(" 8-byte time_t") - assert(tonumber(os.date("%Y", 2^60))) - - -- but still cannot represent a huge year - checkerr("cannot be represented", os.time, {year=2^60, month=1, day=1}) - end - end -end - -do - local D = os.date("*t") - local t = os.time(D) - if D.isdst == nil then - print("no daylight saving information") - else - assert(type(D.isdst) == 'boolean') - end - D.isdst = nil - local t1 = os.time(D) - assert(t == t1) -- if isdst is absent uses correct default -end - -local D = os.date("*t") -t = os.time(D) -D.year = D.year-1; -local t1 = os.time(D) --- allow for leap years -assert(math.abs(os.difftime(t,t1)/(24*3600) - 365) < 2) - --- should not take more than 1 second to execute these two lines -t = os.time() -t1 = os.time(os.date("*t")) -local diff = os.difftime(t1,t) -assert(0 <= diff and diff <= 1) -diff = os.difftime(t,t1) -assert(-1 <= diff and diff <= 0) - -local t1 = os.time{year=2000, month=10, day=1, hour=23, min=12} -local t2 = os.time{year=2000, month=10, day=1, hour=23, min=10, sec=19} -assert(os.difftime(t1,t2) == 60*2-19) - --- since 5.3.3, 'os.time' normalizes table fields -t1 = {year = 2005, month = 1, day = 1, hour = 1, min = 0, sec = -3602} -os.time(t1) -assert(t1.day == 31 and t1.month == 12 and t1.year == 2004 and - t1.hour == 23 and t1.min == 59 and t1.sec == 58 and - t1.yday == 366) - -io.output(io.stdout) -local t = os.date('%d %m %Y %H %M %S') -local d, m, a, h, min, s = string.match(t, - "(%d+) (%d+) (%d+) (%d+) (%d+) (%d+)") -d = tonumber(d) -m = tonumber(m) -a = tonumber(a) -h = tonumber(h) -min = tonumber(min) -s = tonumber(s) -io.write(string.format('test done on %2.2d/%2.2d/%d', d, m, a)) -io.write(string.format(', at %2.2d:%2.2d:%2.2d\n', h, min, s)) -io.write(string.format('%s\n', _VERSION)) - - diff --git a/lua-5.4.4-tests/gc.lua b/lua-5.4.4-tests/gc.lua deleted file mode 100644 index 381c554..0000000 --- a/lua-5.4.4-tests/gc.lua +++ /dev/null @@ -1,691 +0,0 @@ --- $Id: testes/gc.lua $ --- See Copyright Notice in file all.lua - -print('testing incremental garbage collection') - -local debug = require"debug" - -assert(collectgarbage("isrunning")) - -collectgarbage() - -local oldmode = collectgarbage("incremental") - --- changing modes should return previous mode -assert(collectgarbage("generational") == "incremental") -assert(collectgarbage("generational") == "generational") -assert(collectgarbage("incremental") == "generational") -assert(collectgarbage("incremental") == "incremental") - - -local function nop () end - -local function gcinfo () - return collectgarbage"count" * 1024 -end - - --- test weird parameters to 'collectgarbage' -do - -- save original parameters - local a = collectgarbage("setpause", 200) - local b = collectgarbage("setstepmul", 200) - local t = {0, 2, 10, 90, 500, 5000, 30000, 0x7ffffffe} - for i = 1, #t do - local p = t[i] - for j = 1, #t do - local m = t[j] - collectgarbage("setpause", p) - collectgarbage("setstepmul", m) - collectgarbage("step", 0) - collectgarbage("step", 10000) - end - end - -- restore original parameters - collectgarbage("setpause", a) - collectgarbage("setstepmul", b) - collectgarbage() -end - - -_G["while"] = 234 - - --- --- tests for GC activation when creating different kinds of objects --- -local function GC1 () - local u - local b -- (above 'u' it in the stack) - local finish = false - u = setmetatable({}, {__gc = function () finish = true end}) - b = {34} - repeat u = {} until finish - assert(b[1] == 34) -- 'u' was collected, but 'b' was not - - finish = false; local i = 1 - u = setmetatable({}, {__gc = function () finish = true end}) - repeat i = i + 1; u = tostring(i) .. tostring(i) until finish - assert(b[1] == 34) -- 'u' was collected, but 'b' was not - - finish = false - u = setmetatable({}, {__gc = function () finish = true end}) - repeat local i; u = function () return i end until finish - assert(b[1] == 34) -- 'u' was collected, but 'b' was not -end - -local function GC2 () - local u - local finish = false - u = {setmetatable({}, {__gc = function () finish = true end})} - local b = {34} - repeat u = {{}} until finish - assert(b[1] == 34) -- 'u' was collected, but 'b' was not - - finish = false; local i = 1 - u = {setmetatable({}, {__gc = function () finish = true end})} - repeat i = i + 1; u = {tostring(i) .. tostring(i)} until finish - assert(b[1] == 34) -- 'u' was collected, but 'b' was not - - finish = false - u = {setmetatable({}, {__gc = function () finish = true end})} - repeat local i; u = {function () return i end} until finish - assert(b[1] == 34) -- 'u' was collected, but 'b' was not -end - -local function GC() GC1(); GC2() end - - -do - print("creating many objects") - - local limit = 5000 - - for i = 1, limit do - local a = {}; a = nil - end - - local a = "a" - - for i = 1, limit do - a = i .. "b"; - a = string.gsub(a, '(%d%d*)', "%1 %1") - a = "a" - end - - - - a = {} - - function a:test () - for i = 1, limit do - load(string.format("function temp(a) return 'a%d' end", i), "")() - assert(temp() == string.format('a%d', i)) - end - end - - a:test() - -end - - --- collection of functions without locals, globals, etc. -do local f = function () end end - - -print("functions with errors") -prog = [[ -do - a = 10; - function foo(x,y) - a = sin(a+0.456-0.23e-12); - return function (z) return sin(%x+z) end - end - local x = function (w) a=a+w; end -end -]] -do - local step = 1 - if _soft then step = 13 end - for i=1, string.len(prog), step do - for j=i, string.len(prog), step do - pcall(load(string.sub(prog, i, j), "")) - end - end -end - -foo = nil -print('long strings') -x = "01234567890123456789012345678901234567890123456789012345678901234567890123456789" -assert(string.len(x)==80) -s = '' -k = math.min(300, (math.maxinteger // 80) // 2) -for n = 1, k do s = s..x; j=tostring(n) end -assert(string.len(s) == k*80) -s = string.sub(s, 1, 10000) -s, i = string.gsub(s, '(%d%d%d%d)', '') -assert(i==10000 // 4) -s = nil -x = nil - -assert(_G["while"] == 234) - - --- --- test the "size" of basic GC steps (whatever they mean...) --- -do -print("steps") - - print("steps (2)") - - local function dosteps (siz) - collectgarbage() - local a = {} - for i=1,100 do a[i] = {{}}; local b = {} end - local x = gcinfo() - local i = 0 - repeat -- do steps until it completes a collection cycle - i = i+1 - until collectgarbage("step", siz) - assert(gcinfo() < x) - return i -- number of steps - end - - collectgarbage"stop" - - if not _port then - assert(dosteps(10) < dosteps(2)) - end - - -- collector should do a full collection with so many steps - assert(dosteps(20000) == 1) - assert(collectgarbage("step", 20000) == true) - assert(collectgarbage("step", 20000) == true) - - assert(not collectgarbage("isrunning")) - collectgarbage"restart" - assert(collectgarbage("isrunning")) - -end - - -if not _port then - -- test the pace of the collector - collectgarbage(); collectgarbage() - local x = gcinfo() - collectgarbage"stop" - repeat - local a = {} - until gcinfo() > 3 * x - collectgarbage"restart" - assert(collectgarbage("isrunning")) - repeat - local a = {} - until gcinfo() <= x * 2 -end - - -print("clearing tables") -lim = 15 -a = {} --- fill a with `collectable' indices -for i=1,lim do a[{}] = i end -b = {} -for k,v in pairs(a) do b[k]=v end --- remove all indices and collect them -for n in pairs(b) do - a[n] = undef - assert(type(n) == 'table' and next(n) == nil) - collectgarbage() -end -b = nil -collectgarbage() -for n in pairs(a) do error'cannot be here' end -for i=1,lim do a[i] = i end -for i=1,lim do assert(a[i] == i) end - - -print('weak tables') -a = {}; setmetatable(a, {__mode = 'k'}); --- fill a with some `collectable' indices -for i=1,lim do a[{}] = i end --- and some non-collectable ones -for i=1,lim do a[i] = i end -for i=1,lim do local s=string.rep('@', i); a[s] = s..'#' end -collectgarbage() -local i = 0 -for k,v in pairs(a) do assert(k==v or k..'#'==v); i=i+1 end -assert(i == 2*lim) - -a = {}; setmetatable(a, {__mode = 'v'}); -a[1] = string.rep('b', 21) -collectgarbage() -assert(a[1]) -- strings are *values* -a[1] = undef --- fill a with some `collectable' values (in both parts of the table) -for i=1,lim do a[i] = {} end -for i=1,lim do a[i..'x'] = {} end --- and some non-collectable ones -for i=1,lim do local t={}; a[t]=t end -for i=1,lim do a[i+lim]=i..'x' end -collectgarbage() -local i = 0 -for k,v in pairs(a) do assert(k==v or k-lim..'x' == v); i=i+1 end -assert(i == 2*lim) - -a = {}; setmetatable(a, {__mode = 'kv'}); -local x, y, z = {}, {}, {} --- keep only some items -a[1], a[2], a[3] = x, y, z -a[string.rep('$', 11)] = string.rep('$', 11) --- fill a with some `collectable' values -for i=4,lim do a[i] = {} end -for i=1,lim do a[{}] = i end -for i=1,lim do local t={}; a[t]=t end -collectgarbage() -assert(next(a) ~= nil) -local i = 0 -for k,v in pairs(a) do - assert((k == 1 and v == x) or - (k == 2 and v == y) or - (k == 3 and v == z) or k==v); - i = i+1 -end -assert(i == 4) -x,y,z=nil -collectgarbage() -assert(next(a) == string.rep('$', 11)) - - --- 'bug' in 5.1 -a = {} -local t = {x = 10} -local C = setmetatable({key = t}, {__mode = 'v'}) -local C1 = setmetatable({[t] = 1}, {__mode = 'k'}) -a.x = t -- this should not prevent 't' from being removed from - -- weak table 'C' by the time 'a' is finalized - -setmetatable(a, {__gc = function (u) - assert(C.key == nil) - assert(type(next(C1)) == 'table') - end}) - -a, t = nil -collectgarbage() -collectgarbage() -assert(next(C) == nil and next(C1) == nil) -C, C1 = nil - - --- ephemerons -local mt = {__mode = 'k'} -a = {{10},{20},{30},{40}}; setmetatable(a, mt) -x = nil -for i = 1, 100 do local n = {}; a[n] = {k = {x}}; x = n end -GC() -local n = x -local i = 0 -while n do n = a[n].k[1]; i = i + 1 end -assert(i == 100) -x = nil -GC() -for i = 1, 4 do assert(a[i][1] == i * 10); a[i] = undef end -assert(next(a) == nil) - -local K = {} -a[K] = {} -for i=1,10 do a[K][i] = {}; a[a[K][i]] = setmetatable({}, mt) end -x = nil -local k = 1 -for j = 1,100 do - local n = {}; local nk = k%10 + 1 - a[a[K][nk]][n] = {x, k = k}; x = n; k = nk -end -GC() -local n = x -local i = 0 -while n do local t = a[a[K][k]][n]; n = t[1]; k = t.k; i = i + 1 end -assert(i == 100) -K = nil -GC() --- assert(next(a) == nil) - - --- testing errors during GC -if T then - collectgarbage("stop") -- stop collection - local u = {} - local s = {}; setmetatable(s, {__mode = 'k'}) - setmetatable(u, {__gc = function (o) - local i = s[o] - s[i] = true - assert(not s[i - 1]) -- check proper finalization order - if i == 8 then error("@expected@") end -- error during GC - end}) - - for i = 6, 10 do - local n = setmetatable({}, getmetatable(u)) - s[n] = i - end - - warn("@on"); warn("@store") - collectgarbage() - assert(string.find(_WARN, "error in __gc")) - assert(string.match(_WARN, "@(.-)@") == "expected"); _WARN = false - for i = 8, 10 do assert(s[i]) end - - for i = 1, 5 do - local n = setmetatable({}, getmetatable(u)) - s[n] = i - end - - collectgarbage() - for i = 1, 10 do assert(s[i]) end - - getmetatable(u).__gc = nil - warn("@normal") - -end -print '+' - - --- testing userdata -if T==nil then - (Message or print)('\n >>> testC not active: skipping userdata GC tests <<<\n') - -else - - local function newproxy(u) - return debug.setmetatable(T.newuserdata(0), debug.getmetatable(u)) - end - - collectgarbage("stop") -- stop collection - local u = newproxy(nil) - debug.setmetatable(u, {__gc = true}) - local s = 0 - local a = {[u] = 0}; setmetatable(a, {__mode = 'vk'}) - for i=1,10 do a[newproxy(u)] = i end - for k in pairs(a) do assert(getmetatable(k) == getmetatable(u)) end - local a1 = {}; for k,v in pairs(a) do a1[k] = v end - for k,v in pairs(a1) do a[v] = k end - for i =1,10 do assert(a[i]) end - getmetatable(u).a = a1 - getmetatable(u).u = u - do - local u = u - getmetatable(u).__gc = function (o) - assert(a[o] == 10-s) - assert(a[10-s] == undef) -- udata already removed from weak table - assert(getmetatable(o) == getmetatable(u)) - assert(getmetatable(o).a[o] == 10-s) - s=s+1 - end - end - a1, u = nil - assert(next(a) ~= nil) - collectgarbage() - assert(s==11) - collectgarbage() - assert(next(a) == nil) -- finalized keys are removed in two cycles -end - - --- __gc x weak tables -local u = setmetatable({}, {__gc = true}) --- __gc metamethod should be collected before running -setmetatable(getmetatable(u), {__mode = "v"}) -getmetatable(u).__gc = function (o) os.exit(1) end -- cannot happen -u = nil -collectgarbage() - -local u = setmetatable({}, {__gc = true}) -local m = getmetatable(u) -m.x = {[{0}] = 1; [0] = {1}}; setmetatable(m.x, {__mode = "kv"}); -m.__gc = function (o) - assert(next(getmetatable(o).x) == nil) - m = 10 -end -u, m = nil -collectgarbage() -assert(m==10) - -do -- tests for string keys in weak tables - collectgarbage(); collectgarbage() - local m = collectgarbage("count") -- current memory - local a = setmetatable({}, {__mode = "kv"}) - a[string.rep("a", 2^22)] = 25 -- long string key -> number value - a[string.rep("b", 2^22)] = {} -- long string key -> colectable value - a[{}] = 14 -- colectable key - assert(collectgarbage("count") > m + 2^13) -- 2^13 == 2 * 2^22 in KB - collectgarbage() - assert(collectgarbage("count") >= m + 2^12 and - collectgarbage("count") < m + 2^13) -- one key was collected - local k, v = next(a) -- string key with number value preserved - assert(k == string.rep("a", 2^22) and v == 25) - assert(next(a, k) == nil) -- everything else cleared - assert(a[string.rep("b", 2^22)] == undef) - a[k] = undef -- erase this last entry - k = nil - collectgarbage() - assert(next(a) == nil) - -- make sure will not try to compare with dead key - assert(a[string.rep("b", 100)] == undef) - assert(collectgarbage("count") <= m + 1) -- eveything collected -end - - --- errors during collection -if T then - warn("@store") - u = setmetatable({}, {__gc = function () error "@expected error" end}) - u = nil - collectgarbage() - assert(string.find(_WARN, "@expected error")); _WARN = false - warn("@normal") -end - - -if not _soft then - print("long list") - local a = {} - for i = 1,200000 do - a = {next = a} - end - a = nil - collectgarbage() -end - --- create many threads with self-references and open upvalues -print("self-referenced threads") -local thread_id = 0 -local threads = {} - -local function fn (thread) - local x = {} - threads[thread_id] = function() - thread = x - end - coroutine.yield() -end - -while thread_id < 1000 do - local thread = coroutine.create(fn) - coroutine.resume(thread, thread) - thread_id = thread_id + 1 -end - - --- Create a closure (function inside 'f') with an upvalue ('param') that --- points (through a table) to the closure itself and to the thread --- ('co' and the initial value of 'param') where closure is running. --- Then, assert that table (and therefore everything else) will be --- collected. -do - local collected = false -- to detect collection - collectgarbage(); collectgarbage("stop") - do - local function f (param) - ;(function () - assert(type(f) == 'function' and type(param) == 'thread') - param = {param, f} - setmetatable(param, {__gc = function () collected = true end}) - coroutine.yield(100) - end)() - end - local co = coroutine.create(f) - assert(coroutine.resume(co, co)) - end - -- Now, thread and closure are not reacheable any more. - collectgarbage() - assert(collected) - collectgarbage("restart") -end - - -do - collectgarbage() - collectgarbage"stop" - collectgarbage("step", 0) -- steps should not unblock the collector - local x = gcinfo() - repeat - for i=1,1000 do _ENV.a = {} end -- no collection during the loop - until gcinfo() > 2 * x - collectgarbage"restart" -end - - -if T then -- tests for weird cases collecting upvalues - - local function foo () - local a = {x = 20} - coroutine.yield(function () return a.x end) -- will run collector - assert(a.x == 20) -- 'a' is 'ok' - a = {x = 30} -- create a new object - assert(T.gccolor(a) == "white") -- of course it is new... - coroutine.yield(100) -- 'a' is still local to this thread - end - - local t = setmetatable({}, {__mode = "kv"}) - collectgarbage(); collectgarbage('stop') - -- create coroutine in a weak table, so it will never be marked - t.co = coroutine.wrap(foo) - local f = t.co() -- create function to access local 'a' - T.gcstate("atomic") -- ensure all objects are traversed - assert(T.gcstate() == "atomic") - assert(t.co() == 100) -- resume coroutine, creating new table for 'a' - assert(T.gccolor(t.co) == "white") -- thread was not traversed - T.gcstate("pause") -- collect thread, but should mark 'a' before that - assert(t.co == nil and f() == 30) -- ensure correct access to 'a' - - collectgarbage("restart") - - -- test barrier in sweep phase (backing userdata to gray) - local u = T.newuserdata(0, 1) -- create a userdata - collectgarbage() - collectgarbage"stop" - local a = {} -- avoid 'u' as first element in 'allgc' - T.gcstate"atomic" - T.gcstate"sweepallgc" - local x = {} - assert(T.gccolor(u) == "black") -- userdata is "old" (black) - assert(T.gccolor(x) == "white") -- table is "new" (white) - debug.setuservalue(u, x) -- trigger barrier - assert(T.gccolor(u) == "gray") -- userdata changed back to gray - collectgarbage"restart" - - print"+" -end - - -if T then - local debug = require "debug" - collectgarbage("stop") - local x = T.newuserdata(0) - local y = T.newuserdata(0) - debug.setmetatable(y, {__gc = nop}) -- bless the new udata before... - debug.setmetatable(x, {__gc = nop}) -- ...the old one - assert(T.gccolor(y) == "white") - T.checkmemory() - collectgarbage("restart") -end - - -if T then - print("emergency collections") - collectgarbage() - collectgarbage() - T.totalmem(T.totalmem() + 200) - for i=1,200 do local a = {} end - T.totalmem(0) - collectgarbage() - local t = T.totalmem("table") - local a = {{}, {}, {}} -- create 4 new tables - assert(T.totalmem("table") == t + 4) - t = T.totalmem("function") - a = function () end -- create 1 new closure - assert(T.totalmem("function") == t + 1) - t = T.totalmem("thread") - a = coroutine.create(function () end) -- create 1 new coroutine - assert(T.totalmem("thread") == t + 1) -end - - --- create an object to be collected when state is closed -do - local setmetatable,assert,type,print,getmetatable = - setmetatable,assert,type,print,getmetatable - local tt = {} - tt.__gc = function (o) - assert(getmetatable(o) == tt) - -- create new objects during GC - local a = 'xuxu'..(10+3)..'joao', {} - ___Glob = o -- ressurrect object! - setmetatable({}, tt) -- creates a new one with same metatable - print(">>> closing state " .. "<<<\n") - end - local u = setmetatable({}, tt) - ___Glob = {u} -- avoid object being collected before program end -end - --- create several objects to raise errors when collected while closing state -if T then - local error, assert, find, warn = error, assert, string.find, warn - local n = 0 - local lastmsg - local mt = {__gc = function (o) - n = n + 1 - assert(n == o[1]) - if n == 1 then - _WARN = false - elseif n == 2 then - assert(find(_WARN, "@expected warning")) - lastmsg = _WARN -- get message from previous error (first 'o') - else - assert(lastmsg == _WARN) -- subsequent error messages are equal - end - warn("@store"); _WARN = false - error"@expected warning" - end} - for i = 10, 1, -1 do - -- create object and preserve it until the end - table.insert(___Glob, setmetatable({i}, mt)) - end -end - --- just to make sure -assert(collectgarbage'isrunning') - -do -- check that the collector is not reentrant in incremental mode - local res = true - setmetatable({}, {__gc = function () - res = collectgarbage() - end}) - collectgarbage() - assert(not res) -end - - -collectgarbage(oldmode) - -print('OK') diff --git a/lua-5.4.4-tests/gengc.lua b/lua-5.4.4-tests/gengc.lua deleted file mode 100644 index 3d4f67f..0000000 --- a/lua-5.4.4-tests/gengc.lua +++ /dev/null @@ -1,172 +0,0 @@ --- $Id: testes/gengc.lua $ --- See Copyright Notice in file all.lua - -print('testing generational garbage collection') - -local debug = require"debug" - -assert(collectgarbage("isrunning")) - -collectgarbage() - -local oldmode = collectgarbage("generational") - - --- ensure that table barrier evolves correctly -do - local U = {} - -- full collection makes 'U' old - collectgarbage() - assert(not T or T.gcage(U) == "old") - - -- U refers to a new table, so it becomes 'touched1' - U[1] = {x = {234}} - assert(not T or (T.gcage(U) == "touched1" and T.gcage(U[1]) == "new")) - - -- both U and the table survive one more collection - collectgarbage("step", 0) - assert(not T or (T.gcage(U) == "touched2" and T.gcage(U[1]) == "survival")) - - -- both U and the table survive yet another collection - -- now everything is old - collectgarbage("step", 0) - assert(not T or (T.gcage(U) == "old" and T.gcage(U[1]) == "old1")) - - -- data was not corrupted - assert(U[1].x[1] == 234) -end - - -do - -- ensure that 'firstold1' is corrected when object is removed from - -- the 'allgc' list - local function foo () end - local old = {10} - collectgarbage() -- make 'old' old - assert(not T or T.gcage(old) == "old") - setmetatable(old, {}) -- new table becomes OLD0 (barrier) - assert(not T or T.gcage(getmetatable(old)) == "old0") - collectgarbage("step", 0) -- new table becomes OLD1 and firstold1 - assert(not T or T.gcage(getmetatable(old)) == "old1") - setmetatable(getmetatable(old), {__gc = foo}) -- get it out of allgc list - collectgarbage("step", 0) -- should not seg. fault -end - - -do -- bug in 5.4.0 --- When an object aged OLD1 is finalized, it is moved from the list --- 'finobj' to the *beginning* of the list 'allgc', but that part of the --- list was not being visited by 'markold'. - local A = {} - A[1] = false -- old anchor for object - - -- obj finalizer - local function gcf (obj) - A[1] = obj -- anchor object - assert(not T or T.gcage(obj) == "old1") - obj = nil -- remove it from the stack - collectgarbage("step", 0) -- do a young collection - print(getmetatable(A[1]).x) -- metatable was collected - end - - collectgarbage() -- make A old - local obj = {} -- create a new object - collectgarbage("step", 0) -- make it a survival - assert(not T or T.gcage(obj) == "survival") - setmetatable(obj, {__gc = gcf, x = "+"}) -- create its metatable - assert(not T or T.gcage(getmetatable(obj)) == "new") - obj = nil -- clear object - collectgarbage("step", 0) -- will call obj's finalizer -end - - -do -- another bug in 5.4.0 - local old = {10} - collectgarbage() -- make 'old' old - local co = coroutine.create( - function () - local x = nil - local f = function () - return x[1] - end - x = coroutine.yield(f) - coroutine.yield() - end - ) - local _, f = coroutine.resume(co) -- create closure over 'x' in coroutine - collectgarbage("step", 0) -- make upvalue a survival - old[1] = {"hello"} -- 'old' go to grayagain as 'touched1' - coroutine.resume(co, {123}) -- its value will be new - co = nil - collectgarbage("step", 0) -- hit the barrier - assert(f() == 123 and old[1][1] == "hello") - collectgarbage("step", 0) -- run the collector once more - -- make sure old[1] was not collected - assert(f() == 123 and old[1][1] == "hello") -end - - -do -- bug introduced in commit 9cf3299fa - local t = setmetatable({}, {__mode = "kv"}) -- all-weak table - collectgarbage() -- full collection - assert(not T or T.gcage(t) == "old") - t[1] = {10} - assert(not T or (T.gcage(t) == "touched1" and T.gccolor(t) == "gray")) - collectgarbage("step", 0) -- minor collection - assert(not T or (T.gcage(t) == "touched2" and T.gccolor(t) == "black")) - collectgarbage("step", 0) -- minor collection - assert(not T or T.gcage(t) == "old") -- t should be black, but it was gray - t[1] = {10} -- no barrier here, so t was still old - collectgarbage("step", 0) -- minor collection - -- t, being old, is ignored by the collection, so it is not cleared - assert(t[1] == nil) -- fails with the bug -end - - -if T == nil then - (Message or print)('\n >>> testC not active: \z - skipping some generational tests <<<\n') - print 'OK' - return -end - - --- ensure that userdata barrier evolves correctly -do - local U = T.newuserdata(0, 1) - -- full collection makes 'U' old - collectgarbage() - assert(T.gcage(U) == "old") - - -- U refers to a new table, so it becomes 'touched1' - debug.setuservalue(U, {x = {234}}) - assert(T.gcage(U) == "touched1" and - T.gcage(debug.getuservalue(U)) == "new") - - -- both U and the table survive one more collection - collectgarbage("step", 0) - assert(T.gcage(U) == "touched2" and - T.gcage(debug.getuservalue(U)) == "survival") - - -- both U and the table survive yet another collection - -- now everything is old - collectgarbage("step", 0) - assert(T.gcage(U) == "old" and - T.gcage(debug.getuservalue(U)) == "old1") - - -- data was not corrupted - assert(debug.getuservalue(U).x[1] == 234) -end - --- just to make sure -assert(collectgarbage'isrunning') - - - --- just to make sure -assert(collectgarbage'isrunning') - -collectgarbage(oldmode) - -print('OK') - diff --git a/lua-5.4.4-tests/goto.lua b/lua-5.4.4-tests/goto.lua deleted file mode 100644 index 4ac6d7d..0000000 --- a/lua-5.4.4-tests/goto.lua +++ /dev/null @@ -1,271 +0,0 @@ --- $Id: testes/goto.lua $ --- See Copyright Notice in file all.lua - -collectgarbage() - -local function errmsg (code, m) - local st, msg = load(code) - assert(not st and string.find(msg, m)) -end - --- cannot see label inside block -errmsg([[ goto l1; do ::l1:: end ]], "label 'l1'") -errmsg([[ do ::l1:: end goto l1; ]], "label 'l1'") - --- repeated label -errmsg([[ ::l1:: ::l1:: ]], "label 'l1'") -errmsg([[ ::l1:: do ::l1:: end]], "label 'l1'") - - --- undefined label -errmsg([[ goto l1; local aa ::l1:: ::l2:: print(3) ]], "local 'aa'") - --- jumping over variable definition -errmsg([[ -do local bb, cc; goto l1; end -local aa -::l1:: print(3) -]], "local 'aa'") - --- jumping into a block -errmsg([[ do ::l1:: end goto l1 ]], "label 'l1'") -errmsg([[ goto l1 do ::l1:: end ]], "label 'l1'") - --- cannot continue a repeat-until with variables -errmsg([[ - repeat - if x then goto cont end - local xuxu = 10 - ::cont:: - until xuxu < x -]], "local 'xuxu'") - --- simple gotos -local x -do - local y = 12 - goto l1 - ::l2:: x = x + 1; goto l3 - ::l1:: x = y; goto l2 -end -::l3:: ::l3_1:: assert(x == 13) - - --- long labels -do - local prog = [[ - do - local a = 1 - goto l%sa; a = a + 1 - ::l%sa:: a = a + 10 - goto l%sb; a = a + 2 - ::l%sb:: a = a + 20 - return a - end - ]] - local label = string.rep("0123456789", 40) - prog = string.format(prog, label, label, label, label) - assert(assert(load(prog))() == 31) -end - - --- ok to jump over local dec. to end of block -do - goto l1 - local a = 23 - x = a - ::l1::; -end - -while true do - goto l4 - goto l1 -- ok to jump over local dec. to end of block - goto l1 -- multiple uses of same label - local x = 45 - ::l1:: ;;; -end -::l4:: assert(x == 13) - -if print then - goto l1 -- ok to jump over local dec. to end of block - error("should not be here") - goto l2 -- ok to jump over local dec. to end of block - local x - ::l1:: ; ::l2:: ;; -else end - --- to repeat a label in a different function is OK -local function foo () - local a = {} - goto l3 - ::l1:: a[#a + 1] = 1; goto l2; - ::l2:: a[#a + 1] = 2; goto l5; - ::l3:: - ::l3a:: a[#a + 1] = 3; goto l1; - ::l4:: a[#a + 1] = 4; goto l6; - ::l5:: a[#a + 1] = 5; goto l4; - ::l6:: assert(a[1] == 3 and a[2] == 1 and a[3] == 2 and - a[4] == 5 and a[5] == 4) - if not a[6] then a[6] = true; goto l3a end -- do it twice -end - -::l6:: foo() - - -do -- bug in 5.2 -> 5.3.2 - local x - ::L1:: - local y -- cannot join this SETNIL with previous one - assert(y == nil) - y = true - if x == nil then - x = 1 - goto L1 - else - x = x + 1 - end - assert(x == 2 and y == true) -end - --- bug in 5.3 -do - local first = true - local a = false - if true then - goto LBL - ::loop:: - a = true - ::LBL:: - if first then - first = false - goto loop - end - end - assert(a) -end - -do -- compiling infinite loops - goto escape -- do not run the infinite loops - ::a:: goto a - ::b:: goto c - ::c:: goto b -end -::escape:: --------------------------------------------------------------------------------- --- testing closing of upvalues - -local debug = require 'debug' - -local function foo () - local t = {} - do - local i = 1 - local a, b, c, d - t[1] = function () return a, b, c, d end - ::l1:: - local b - do - local c - t[#t + 1] = function () return a, b, c, d end -- t[2], t[4], t[6] - if i > 2 then goto l2 end - do - local d - t[#t + 1] = function () return a, b, c, d end -- t[3], t[5] - i = i + 1 - local a - goto l1 - end - end - end - ::l2:: return t -end - -local a = foo() -assert(#a == 6) - --- all functions share same 'a' -for i = 2, 6 do - assert(debug.upvalueid(a[1], 1) == debug.upvalueid(a[i], 1)) -end - --- 'b' and 'c' are shared among some of them -for i = 2, 6 do - -- only a[1] uses external 'b'/'b' - assert(debug.upvalueid(a[1], 2) ~= debug.upvalueid(a[i], 2)) - assert(debug.upvalueid(a[1], 3) ~= debug.upvalueid(a[i], 3)) -end - -for i = 3, 5, 2 do - -- inner functions share 'b'/'c' with previous ones - assert(debug.upvalueid(a[i], 2) == debug.upvalueid(a[i - 1], 2)) - assert(debug.upvalueid(a[i], 3) == debug.upvalueid(a[i - 1], 3)) - -- but not with next ones - assert(debug.upvalueid(a[i], 2) ~= debug.upvalueid(a[i + 1], 2)) - assert(debug.upvalueid(a[i], 3) ~= debug.upvalueid(a[i + 1], 3)) -end - --- only external 'd' is shared -for i = 2, 6, 2 do - assert(debug.upvalueid(a[1], 4) == debug.upvalueid(a[i], 4)) -end - --- internal 'd's are all different -for i = 3, 5, 2 do - for j = 1, 6 do - assert((debug.upvalueid(a[i], 4) == debug.upvalueid(a[j], 4)) - == (i == j)) - end -end - --------------------------------------------------------------------------------- --- testing if x goto optimizations - -local function testG (a) - if a == 1 then - goto l1 - error("should never be here!") - elseif a == 2 then goto l2 - elseif a == 3 then goto l3 - elseif a == 4 then - goto l1 -- go to inside the block - error("should never be here!") - ::l1:: a = a + 1 -- must go to 'if' end - else - goto l4 - ::l4a:: a = a * 2; goto l4b - error("should never be here!") - ::l4:: goto l4a - error("should never be here!") - ::l4b:: - end - do return a end - ::l2:: do return "2" end - ::l3:: do return "3" end - ::l1:: return "1" -end - -assert(testG(1) == "1") -assert(testG(2) == "2") -assert(testG(3) == "3") -assert(testG(4) == 5) -assert(testG(5) == 10) - -do - -- if x back goto out of scope of upvalue - local X - goto L1 - - ::L2:: goto L3 - - ::L1:: do - local a = setmetatable({}, {__close = function () X = true end}) - assert(X == nil) - if a then goto L2 end -- jumping back out of scope of 'a' - end - - ::L3:: assert(X == true) -- checks that 'a' was correctly closed -end --------------------------------------------------------------------------------- - - -print'OK' diff --git a/lua-5.4.4-tests/heavy.lua b/lua-5.4.4-tests/heavy.lua deleted file mode 100644 index 4731c74..0000000 --- a/lua-5.4.4-tests/heavy.lua +++ /dev/null @@ -1,173 +0,0 @@ --- $Id: heavy.lua,v 1.7 2017/12/29 15:42:15 roberto Exp $ --- See Copyright Notice in file all.lua - -local function teststring () - print("creating a string too long") - do - local a = "x" - local st, msg = pcall(function () - while true do - a = a .. a.. a.. a.. a.. a.. a.. a.. a.. a - .. a .. a.. a.. a.. a.. a.. a.. a.. a.. a - .. a .. a.. a.. a.. a.. a.. a.. a.. a.. a - .. a .. a.. a.. a.. a.. a.. a.. a.. a.. a - .. a .. a.. a.. a.. a.. a.. a.. a.. a.. a - .. a .. a.. a.. a.. a.. a.. a.. a.. a.. a - .. a .. a.. a.. a.. a.. a.. a.. a.. a.. a - .. a .. a.. a.. a.. a.. a.. a.. a.. a.. a - .. a .. a.. a.. a.. a.. a.. a.. a.. a.. a - .. a .. a.. a.. a.. a.. a.. a.. a.. a.. a - print(string.format("string with %d bytes", #a)) - end - end) - assert(not st and - (string.find(msg, "string length overflow") or - string.find(msg, "not enough memory"))) - print("string length overflow with " .. #a * 100) - end - print('+') -end - -local function loadrep (x, what) - local p = 1<<20 - local s = string.rep(x, p) - local count = 0 - local function f() - count = count + p - if count % (0x80*p) == 0 then - io.stderr:write("(", count // 2^20, " M)") - end - return s - end - local st, msg = load(f, "=big") - print("\nmemory: ", collectgarbage'count' * 1024) - msg = string.match(msg, "^[^\n]+") -- get only first line - print(string.format("total: 0x%x %s ('%s')", count, what, msg)) - return st, msg -end - - -function controlstruct () - print("control structure too long") - local lim = ((1 << 24) - 2) // 3 - local s = string.rep("a = a + 1\n", lim) - s = "while true do " .. s .. "end" - assert(load(s)) - print("ok with " .. lim .. " lines") - lim = lim + 3 - s = string.rep("a = a + 1\n", lim) - s = "while true do " .. s .. "end" - local st, msg = load(s) - assert(not st and string.find(msg, "too long")) - print(msg) -end - - -function manylines () - print("loading chunk with too many lines") - local st, msg = loadrep("\n", "lines") - assert(not st and string.find(msg, "too many lines")) - print('+') -end - - -function hugeid () - print("loading chunk with huge identifier") - local st, msg = loadrep("a", "chars") - assert(not st and - (string.find(msg, "lexical element too long") or - string.find(msg, "not enough memory"))) - print('+') -end - -function toomanyinst () - print("loading chunk with too many instructions") - local st, msg = loadrep("a = 10; ", "instructions") - print('+') -end - - -local function loadrepfunc (prefix, f) - local count = -1 - local function aux () - count = count + 1 - if count == 0 then - return prefix - else - if count % (0x100000) == 0 then - io.stderr:write("(", count // 2^20, " M)") - end - return f(count) - end - end - local st, msg = load(aux, "k") - print("\nmemory: ", collectgarbage'count' * 1024) - msg = string.match(msg, "^[^\n]+") -- get only first line - print("expected error: ", msg) -end - - -function toomanyconst () - print("loading function with too many constants") - loadrepfunc("function foo () return {0,", - function (n) - -- convert 'n' to a string in the format [["...",]], - -- where '...' is a kind of number in base 128 - -- (in a range that does not include either the double quote - -- and the escape.) - return string.char(34, - ((n // 128^0) & 127) + 128, - ((n // 128^1) & 127) + 128, - ((n // 128^2) & 127) + 128, - ((n // 128^3) & 127) + 128, - ((n // 128^4) & 127) + 128, - 34, 44) - end) -end - - -function toomanystr () - local a = {} - local st, msg = pcall(function () - for i = 1, math.huge do - if i % (0x100000) == 0 then - io.stderr:write("(", i // 2^20, " M)") - end - a[i] = string.pack("I", i) - end - end) - local size = #a - a = collectgarbage'count' - print("\nmemory:", a * 1024) - print("expected error:", msg) - print("size:", size) -end - - -function toomanyidx () - local a = {} - local st, msg = pcall(function () - for i = 1, math.huge do - if i % (0x100000) == 0 then - io.stderr:write("(", i // 2^20, " M)") - end - a[i] = i - end - end) - print("\nmemory: ", collectgarbage'count' * 1024) - print("expected error: ", msg) - print("size:", #a) -end - - - --- teststring() --- controlstruct() --- manylines() --- hugeid() --- toomanyinst() --- toomanyconst() --- toomanystr() -toomanyidx() - -print "OK" diff --git a/lua-5.4.4-tests/libs/lib1.c b/lua-5.4.4-tests/libs/lib1.c deleted file mode 100644 index 56b6ef4..0000000 --- a/lua-5.4.4-tests/libs/lib1.c +++ /dev/null @@ -1,44 +0,0 @@ -#include "lua.h" -#include "lauxlib.h" - -static int id (lua_State *L) { - return lua_gettop(L); -} - - -static const struct luaL_Reg funcs[] = { - {"id", id}, - {NULL, NULL} -}; - - -/* function used by lib11.c */ -LUAMOD_API int lib1_export (lua_State *L) { - lua_pushstring(L, "exported"); - return 1; -} - - -LUAMOD_API int onefunction (lua_State *L) { - luaL_checkversion(L); - lua_settop(L, 2); - lua_pushvalue(L, 1); - return 2; -} - - -LUAMOD_API int anotherfunc (lua_State *L) { - luaL_checkversion(L); - lua_pushfstring(L, "%d%%%d\n", (int)lua_tointeger(L, 1), - (int)lua_tointeger(L, 2)); - return 1; -} - - -LUAMOD_API int luaopen_lib1_sub (lua_State *L) { - lua_setglobal(L, "y"); /* 2nd arg: extra value (file name) */ - lua_setglobal(L, "x"); /* 1st arg: module name */ - luaL_newlib(L, funcs); - return 1; -} - diff --git a/lua-5.4.4-tests/libs/lib11.c b/lua-5.4.4-tests/libs/lib11.c deleted file mode 100644 index 377d0c4..0000000 --- a/lua-5.4.4-tests/libs/lib11.c +++ /dev/null @@ -1,10 +0,0 @@ -#include "lua.h" - -/* function from lib1.c */ -int lib1_export (lua_State *L); - -LUAMOD_API int luaopen_lib11 (lua_State *L) { - return lib1_export(L); -} - - diff --git a/lua-5.4.4-tests/libs/lib2.c b/lua-5.4.4-tests/libs/lib2.c deleted file mode 100644 index bc9651e..0000000 --- a/lua-5.4.4-tests/libs/lib2.c +++ /dev/null @@ -1,23 +0,0 @@ -#include "lua.h" -#include "lauxlib.h" - -static int id (lua_State *L) { - return lua_gettop(L); -} - - -static const struct luaL_Reg funcs[] = { - {"id", id}, - {NULL, NULL} -}; - - -LUAMOD_API int luaopen_lib2 (lua_State *L) { - lua_settop(L, 2); - lua_setglobal(L, "y"); /* y gets 2nd parameter */ - lua_setglobal(L, "x"); /* x gets 1st parameter */ - luaL_newlib(L, funcs); - return 1; -} - - diff --git a/lua-5.4.4-tests/libs/lib21.c b/lua-5.4.4-tests/libs/lib21.c deleted file mode 100644 index a39b683..0000000 --- a/lua-5.4.4-tests/libs/lib21.c +++ /dev/null @@ -1,10 +0,0 @@ -#include "lua.h" - - -int luaopen_lib2 (lua_State *L); - -LUAMOD_API int luaopen_lib21 (lua_State *L) { - return luaopen_lib2(L); -} - - diff --git a/lua-5.4.4-tests/libs/lib22.c b/lua-5.4.4-tests/libs/lib22.c deleted file mode 100644 index 8e65650..0000000 --- a/lua-5.4.4-tests/libs/lib22.c +++ /dev/null @@ -1,25 +0,0 @@ -#include "lua.h" -#include "lauxlib.h" - -static int id (lua_State *L) { - lua_pushboolean(L, 1); - lua_insert(L, 1); - return lua_gettop(L); -} - - -static const struct luaL_Reg funcs[] = { - {"id", id}, - {NULL, NULL} -}; - - -LUAMOD_API int luaopen_lib2 (lua_State *L) { - lua_settop(L, 2); - lua_setglobal(L, "y"); /* y gets 2nd parameter */ - lua_setglobal(L, "x"); /* x gets 1st parameter */ - luaL_newlib(L, funcs); - return 1; -} - - diff --git a/lua-5.4.4-tests/libs/makefile b/lua-5.4.4-tests/libs/makefile deleted file mode 100644 index a133092..0000000 --- a/lua-5.4.4-tests/libs/makefile +++ /dev/null @@ -1,27 +0,0 @@ -# change this variable to point to the directory with Lua headers -# of the version being tested -LUA_DIR = ../../ - -CC = gcc - -# compilation should generate Dynamic-Link Libraries -CFLAGS = -Wall -std=gnu99 -O2 -I$(LUA_DIR) -fPIC -shared - -# libraries used by the tests -all: lib1.so lib11.so lib2.so lib21.so lib2-v2.so - touch all - -lib1.so: lib1.c $(LUA_DIR)/luaconf.h - $(CC) $(CFLAGS) -o lib1.so lib1.c - -lib11.so: lib11.c $(LUA_DIR)/luaconf.h - $(CC) $(CFLAGS) -o lib11.so lib11.c - -lib2.so: lib2.c $(LUA_DIR)/luaconf.h - $(CC) $(CFLAGS) -o lib2.so lib2.c - -lib21.so: lib21.c $(LUA_DIR)/luaconf.h - $(CC) $(CFLAGS) -o lib21.so lib21.c - -lib2-v2.so: lib21.c $(LUA_DIR)/luaconf.h - $(CC) $(CFLAGS) -o lib2-v2.so lib22.c diff --git a/lua-5.4.4-tests/literals.lua b/lua-5.4.4-tests/literals.lua deleted file mode 100644 index d5a769e..0000000 --- a/lua-5.4.4-tests/literals.lua +++ /dev/null @@ -1,342 +0,0 @@ --- $Id: testes/literals.lua $ --- See Copyright Notice in file all.lua - -print('testing scanner') - -local debug = require "debug" - - -local function dostring (x) return assert(load(x), "")() end - -dostring("x \v\f = \t\r 'a\0a' \v\f\f") -assert(x == 'a\0a' and string.len(x) == 3) - --- escape sequences -assert('\n\"\'\\' == [[ - -"'\]]) - -assert(string.find("\a\b\f\n\r\t\v", "^%c%c%c%c%c%c%c$")) - --- assume ASCII just for tests: -assert("\09912" == 'c12') -assert("\99ab" == 'cab') -assert("\099" == '\99') -assert("\099\n" == 'c\10') -assert('\0\0\0alo' == '\0' .. '\0\0' .. 'alo') - -assert(010 .. 020 .. -030 == "1020-30") - --- hexadecimal escapes -assert("\x00\x05\x10\x1f\x3C\xfF\xe8" == "\0\5\16\31\60\255\232") - -local function lexstring (x, y, n) - local f = assert(load('return ' .. x .. - ', require"debug".getinfo(1).currentline', '')) - local s, l = f() - assert(s == y and l == n) -end - -lexstring("'abc\\z \n efg'", "abcefg", 2) -lexstring("'abc\\z \n\n\n'", "abc", 4) -lexstring("'\\z \n\t\f\v\n'", "", 3) -lexstring("[[\nalo\nalo\n\n]]", "alo\nalo\n\n", 5) -lexstring("[[\nalo\ralo\n\n]]", "alo\nalo\n\n", 5) -lexstring("[[\nalo\ralo\r\n]]", "alo\nalo\n", 4) -lexstring("[[\ralo\n\ralo\r\n]]", "alo\nalo\n", 4) -lexstring("[[alo]\n]alo]]", "alo]\n]alo", 2) - -assert("abc\z - def\z - ghi\z - " == 'abcdefghi') - - --- UTF-8 sequences -assert("\u{0}\u{00000000}\x00\0" == string.char(0, 0, 0, 0)) - --- limits for 1-byte sequences -assert("\u{0}\u{7F}" == "\x00\x7F") - --- limits for 2-byte sequences -assert("\u{80}\u{7FF}" == "\xC2\x80\xDF\xBF") - --- limits for 3-byte sequences -assert("\u{800}\u{FFFF}" == "\xE0\xA0\x80\xEF\xBF\xBF") - --- limits for 4-byte sequences -assert("\u{10000}\u{1FFFFF}" == "\xF0\x90\x80\x80\xF7\xBF\xBF\xBF") - --- limits for 5-byte sequences -assert("\u{200000}\u{3FFFFFF}" == "\xF8\x88\x80\x80\x80\xFB\xBF\xBF\xBF\xBF") - --- limits for 6-byte sequences -assert("\u{4000000}\u{7FFFFFFF}" == - "\xFC\x84\x80\x80\x80\x80\xFD\xBF\xBF\xBF\xBF\xBF") - - --- Error in escape sequences -local function lexerror (s, err) - local st, msg = load('return ' .. s, '') - if err ~= '' then err = err .. "'" end - assert(not st and string.find(msg, "near .-" .. err)) -end - -lexerror([["abc\x"]], [[\x"]]) -lexerror([["abc\x]], [[\x]]) -lexerror([["\x]], [[\x]]) -lexerror([["\x5"]], [[\x5"]]) -lexerror([["\x5]], [[\x5]]) -lexerror([["\xr"]], [[\xr]]) -lexerror([["\xr]], [[\xr]]) -lexerror([["\x.]], [[\x.]]) -lexerror([["\x8%"]], [[\x8%%]]) -lexerror([["\xAG]], [[\xAG]]) -lexerror([["\g"]], [[\g]]) -lexerror([["\g]], [[\g]]) -lexerror([["\."]], [[\%.]]) - -lexerror([["\999"]], [[\999"]]) -lexerror([["xyz\300"]], [[\300"]]) -lexerror([[" \256"]], [[\256"]]) - --- errors in UTF-8 sequences -lexerror([["abc\u{100000000}"]], [[abc\u{100000000]]) -- too large -lexerror([["abc\u11r"]], [[abc\u1]]) -- missing '{' -lexerror([["abc\u"]], [[abc\u"]]) -- missing '{' -lexerror([["abc\u{11r"]], [[abc\u{11r]]) -- missing '}' -lexerror([["abc\u{11"]], [[abc\u{11"]]) -- missing '}' -lexerror([["abc\u{11]], [[abc\u{11]]) -- missing '}' -lexerror([["abc\u{r"]], [[abc\u{r]]) -- no digits - --- unfinished strings -lexerror("[=[alo]]", "") -lexerror("[=[alo]=", "") -lexerror("[=[alo]", "") -lexerror("'alo", "") -lexerror("'alo \\z \n\n", "") -lexerror("'alo \\z", "") -lexerror([['alo \98]], "") - --- valid characters in variable names -for i = 0, 255 do - local s = string.char(i) - assert(not string.find(s, "[a-zA-Z_]") == not load(s .. "=1", "")) - assert(not string.find(s, "[a-zA-Z_0-9]") == - not load("a" .. s .. "1 = 1", "")) -end - - --- long variable names - -var1 = string.rep('a', 15000) .. '1' -var2 = string.rep('a', 15000) .. '2' -prog = string.format([[ - %s = 5 - %s = %s + 1 - return function () return %s - %s end -]], var1, var2, var1, var1, var2) -local f = dostring(prog) -assert(_G[var1] == 5 and _G[var2] == 6 and f() == -1) -var1, var2, f = nil -print('+') - --- escapes -- -assert("\n\t" == [[ - - ]]) -assert([[ - - $debug]] == "\n $debug") -assert([[ [ ]] ~= [[ ] ]]) --- long strings -- -b = "001234567890123456789012345678901234567891234567890123456789012345678901234567890012345678901234567890123456789012345678912345678901234567890123456789012345678900123456789012345678901234567890123456789123456789012345678901234567890123456789001234567890123456789012345678901234567891234567890123456789012345678901234567890012345678901234567890123456789012345678912345678901234567890123456789012345678900123456789012345678901234567890123456789123456789012345678901234567890123456789001234567890123456789012345678901234567891234567890123456789012345678901234567890012345678901234567890123456789012345678912345678901234567890123456789012345678900123456789012345678901234567890123456789123456789012345678901234567890123456789001234567890123456789012345678901234567891234567890123456789012345678901234567890012345678901234567890123456789012345678912345678901234567890123456789012345678900123456789012345678901234567890123456789123456789012345678901234567890123456789" -assert(string.len(b) == 960) -prog = [=[ -print('+') - -a1 = [["this is a 'string' with several 'quotes'"]] -a2 = "'quotes'" - -assert(string.find(a1, a2) == 34) -print('+') - -a1 = [==[temp = [[an arbitrary value]]; ]==] -assert(load(a1))() -assert(temp == 'an arbitrary value') --- long strings -- -b = "001234567890123456789012345678901234567891234567890123456789012345678901234567890012345678901234567890123456789012345678912345678901234567890123456789012345678900123456789012345678901234567890123456789123456789012345678901234567890123456789001234567890123456789012345678901234567891234567890123456789012345678901234567890012345678901234567890123456789012345678912345678901234567890123456789012345678900123456789012345678901234567890123456789123456789012345678901234567890123456789001234567890123456789012345678901234567891234567890123456789012345678901234567890012345678901234567890123456789012345678912345678901234567890123456789012345678900123456789012345678901234567890123456789123456789012345678901234567890123456789001234567890123456789012345678901234567891234567890123456789012345678901234567890012345678901234567890123456789012345678912345678901234567890123456789012345678900123456789012345678901234567890123456789123456789012345678901234567890123456789" -assert(string.len(b) == 960) -print('+') - -a = [[00123456789012345678901234567890123456789123456789012345678901234567890123456789 -00123456789012345678901234567890123456789123456789012345678901234567890123456789 -00123456789012345678901234567890123456789123456789012345678901234567890123456789 -00123456789012345678901234567890123456789123456789012345678901234567890123456789 -00123456789012345678901234567890123456789123456789012345678901234567890123456789 -00123456789012345678901234567890123456789123456789012345678901234567890123456789 -00123456789012345678901234567890123456789123456789012345678901234567890123456789 -00123456789012345678901234567890123456789123456789012345678901234567890123456789 -00123456789012345678901234567890123456789123456789012345678901234567890123456789 -00123456789012345678901234567890123456789123456789012345678901234567890123456789 -00123456789012345678901234567890123456789123456789012345678901234567890123456789 -00123456789012345678901234567890123456789123456789012345678901234567890123456789 -00123456789012345678901234567890123456789123456789012345678901234567890123456789 -00123456789012345678901234567890123456789123456789012345678901234567890123456789 -00123456789012345678901234567890123456789123456789012345678901234567890123456789 -00123456789012345678901234567890123456789123456789012345678901234567890123456789 -00123456789012345678901234567890123456789123456789012345678901234567890123456789 -00123456789012345678901234567890123456789123456789012345678901234567890123456789 -00123456789012345678901234567890123456789123456789012345678901234567890123456789 -00123456789012345678901234567890123456789123456789012345678901234567890123456789 -00123456789012345678901234567890123456789123456789012345678901234567890123456789 -00123456789012345678901234567890123456789123456789012345678901234567890123456789 -00123456789012345678901234567890123456789123456789012345678901234567890123456789 -]] -assert(string.len(a) == 1863) -assert(string.sub(a, 1, 40) == string.sub(b, 1, 40)) -x = 1 -]=] - -print('+') -x = nil -dostring(prog) -assert(x) - -prog = nil -a = nil -b = nil - - -do -- reuse of long strings - - -- get the address of a string - local function getadd (s) return string.format("%p", s) end - - local s1 = "01234567890123456789012345678901234567890123456789" - local s2 = "01234567890123456789012345678901234567890123456789" - local s3 = "01234567890123456789012345678901234567890123456789" - local function foo() return s1 end - local function foo1() return s3 end - local function foo2() - return "01234567890123456789012345678901234567890123456789" - end - local a1 = getadd(s1) - assert(a1 == getadd(s2)) - assert(a1 == getadd(foo())) - assert(a1 == getadd(foo1())) - assert(a1 == getadd(foo2())) - - local sd = "0123456789" .. "0123456789012345678901234567890123456789" - assert(sd == s1 and getadd(sd) ~= a1) -end - - --- testing line ends -prog = [[ -a = 1 -- a comment -b = 2 - - -x = [=[ -hi -]=] -y = "\ -hello\r\n\ -" -return require"debug".getinfo(1).currentline -]] - -for _, n in pairs{"\n", "\r", "\n\r", "\r\n"} do - local prog, nn = string.gsub(prog, "\n", n) - assert(dostring(prog) == nn) - assert(_G.x == "hi\n" and _G.y == "\nhello\r\n\n") -end - - --- testing comments and strings with long brackets -a = [==[]=]==] -assert(a == "]=") - -a = [==[[===[[=[]]=][====[]]===]===]==] -assert(a == "[===[[=[]]=][====[]]===]===") - -a = [====[[===[[=[]]=][====[]]===]===]====] -assert(a == "[===[[=[]]=][====[]]===]===") - -a = [=[]]]]]]]]]=] -assert(a == "]]]]]]]]") - - ---[===[ -x y z [==[ blu foo -]== -] -]=]==] -error error]=]===] - --- generate all strings of four of these chars -local x = {"=", "[", "]", "\n"} -local len = 4 -local function gen (c, n) - if n==0 then coroutine.yield(c) - else - for _, a in pairs(x) do - gen(c..a, n-1) - end - end -end - -for s in coroutine.wrap(function () gen("", len) end) do - assert(s == load("return [====[\n"..s.."]====]", "")()) -end - - --- testing decimal point locale -if os.setlocale("pt_BR") or os.setlocale("ptb") then - assert(tonumber("3,4") == 3.4 and tonumber"3.4" == 3.4) - assert(tonumber(" -.4 ") == -0.4) - assert(tonumber(" +0x.41 ") == 0X0.41) - assert(not load("a = (3,4)")) - assert(assert(load("return 3.4"))() == 3.4) - assert(assert(load("return .4,3"))() == .4) - assert(assert(load("return 4."))() == 4.) - assert(assert(load("return 4.+.5"))() == 4.5) - - assert(" 0x.1 " + " 0x,1" + "-0X.1\t" == 0x0.1) - - assert(not tonumber"inf" and not tonumber"NAN") - - assert(assert(load(string.format("return %q", 4.51)))() == 4.51) - - local a,b = load("return 4.5.") - assert(string.find(b, "'4%.5%.'")) - - assert(os.setlocale("C")) -else - (Message or print)( - '\n >>> pt_BR locale not available: skipping decimal point tests <<<\n') -end - - --- testing %q x line ends -local s = "a string with \r and \n and \r\n and \n\r" -local c = string.format("return %q", s) -assert(assert(load(c))() == s) - --- testing errors -assert(not load"a = 'non-ending string") -assert(not load"a = 'non-ending string\n'") -assert(not load"a = '\\345'") -assert(not load"a = [=x]") - -local function malformednum (n, exp) - local s, msg = load("return " .. n) - assert(not s and string.find(msg, exp)) -end - -malformednum("0xe-", "near ") -malformednum("0xep-p", "malformed number") -malformednum("1print()", "malformed number") - -print('OK') diff --git a/lua-5.4.4-tests/locals.lua b/lua-5.4.4-tests/locals.lua deleted file mode 100644 index 62a88df..0000000 --- a/lua-5.4.4-tests/locals.lua +++ /dev/null @@ -1,1137 +0,0 @@ --- $Id: testes/locals.lua $ --- See Copyright Notice in file all.lua - -print('testing local variables and environments') - -local debug = require"debug" - -local tracegc = require"tracegc" - - --- bug in 5.1: - -local function f(x) x = nil; return x end -assert(f(10) == nil) - -local function f() local x; return x end -assert(f(10) == nil) - -local function f(x) x = nil; local y; return x, y end -assert(f(10) == nil and select(2, f(20)) == nil) - -do - local i = 10 - do local i = 100; assert(i==100) end - do local i = 1000; assert(i==1000) end - assert(i == 10) - if i ~= 10 then - local i = 20 - else - local i = 30 - assert(i == 30) - end -end - - - -f = nil - -local f -x = 1 - -a = nil -load('local a = {}')() -assert(a == nil) - -function f (a) - local _1, _2, _3, _4, _5 - local _6, _7, _8, _9, _10 - local x = 3 - local b = a - local c,d = a,b - if (d == b) then - local x = 'q' - x = b - assert(x == 2) - else - assert(nil) - end - assert(x == 3) - local f = 10 -end - -local b=10 -local a; repeat local b; a,b=1,2; assert(a+1==b); until a+b==3 - - -assert(x == 1) - -f(2) -assert(type(f) == 'function') - - -local function getenv (f) - local a,b = debug.getupvalue(f, 1) - assert(a == '_ENV') - return b -end - --- test for global table of loaded chunks -assert(getenv(load"a=3") == _G) -local c = {}; local f = load("a = 3", nil, nil, c) -assert(getenv(f) == c) -assert(c.a == nil) -f() -assert(c.a == 3) - --- old test for limits for special instructions -do - local i = 2 - local p = 4 -- p == 2^i - repeat - for j=-3,3 do - assert(load(string.format([[local a=%s; - a=a+%s; - assert(a ==2^%s)]], j, p-j, i), '')) () - assert(load(string.format([[local a=%s; - a=a-%s; - assert(a==-2^%s)]], -j, p-j, i), '')) () - assert(load(string.format([[local a,b=0,%s; - a=b-%s; - assert(a==-2^%s)]], -j, p-j, i), '')) () - end - p = 2 * p; i = i + 1 - until p <= 0 -end - -print'+' - - -if rawget(_G, "T") then - -- testing clearing of dead elements from tables - collectgarbage("stop") -- stop GC - local a = {[{}] = 4, [3] = 0, alo = 1, - a1234567890123456789012345678901234567890 = 10} - - local t = T.querytab(a) - - for k,_ in pairs(a) do a[k] = undef end - collectgarbage() -- restore GC and collect dead fields in 'a' - for i=0,t-1 do - local k = querytab(a, i) - assert(k == nil or type(k) == 'number' or k == 'alo') - end - - -- testing allocation errors during table insertions - local a = {} - local function additems () - a.x = true; a.y = true; a.z = true - a[1] = true - a[2] = true - end - for i = 1, math.huge do - T.alloccount(i) - local st, msg = pcall(additems) - T.alloccount() - local count = 0 - for k, v in pairs(a) do - assert(a[k] == v) - count = count + 1 - end - if st then assert(count == 5); break end - end -end - - --- testing lexical environments - -assert(_ENV == _G) - -do -local dummy -local _ENV = (function (...) return ... end)(_G, dummy) -- { - -do local _ENV = {assert=assert}; assert(true) end -mt = {_G = _G} -local foo,x -A = false -- "declare" A -do local _ENV = mt - function foo (x) - A = x - do local _ENV = _G; A = 1000 end - return function (x) return A .. x end - end -end -assert(getenv(foo) == mt) -x = foo('hi'); assert(mt.A == 'hi' and A == 1000) -assert(x('*') == mt.A .. '*') - -do local _ENV = {assert=assert, A=10}; - do local _ENV = {assert=assert, A=20}; - assert(A==20);x=A - end - assert(A==10 and x==20) -end -assert(x==20) - - -do -- constants - local a, b, c = 10, 20, 30 - b = a + c + b -- 'b' is not constant - assert(a == 10 and b == 60 and c == 30) - local function checkro (name, code) - local st, msg = load(code) - local gab = string.format("attempt to assign to const variable '%s'", name) - assert(not st and string.find(msg, gab)) - end - checkro("y", "local x, y , z = 10, 20, 30; x = 11; y = 12") - checkro("x", "local x , y, z = 10, 20, 30; x = 11") - checkro("z", "local x , y, z = 10, 20, 30; y = 10; z = 11") - checkro("foo", "local foo = 10; function foo() end") - checkro("foo", "local foo = {}; function foo() end") - - checkro("z", [[ - local a, z , b = 10; - function foo() a = 20; z = 32; end - ]]) - - checkro("var1", [[ - local a, var1 = 10; - function foo() a = 20; z = function () var1 = 12; end end - ]]) -end - - -print"testing to-be-closed variables" - -local function stack(n) n = ((n == 0) or stack(n - 1)) end - -local function func2close (f, x, y) - local obj = setmetatable({}, {__close = f}) - if x then - return x, obj, y - else - return obj - end -end - - -do - local a = {} - do - local b = false -- not to be closed - local x = setmetatable({"x"}, {__close = function (self) - a[#a + 1] = self[1] end}) - local w, y , z = func2close(function (self, err) - assert(err == nil); a[#a + 1] = "y" - end, 10, 20) - local c = nil -- not to be closed - a[#a + 1] = "in" - assert(w == 10 and z == 20) - end - a[#a + 1] = "out" - assert(a[1] == "in" and a[2] == "y" and a[3] == "x" and a[4] == "out") -end - -do - local X = false - - local x, closescope = func2close(function (_, msg) - stack(10); - assert(msg == nil) - X = true - end, 100) - assert(x == 100); x = 101; -- 'x' is not read-only - - -- closing functions do not corrupt returning values - local function foo (x) - local _ = closescope - return x, X, 23 - end - - local a, b, c = foo(1.5) - assert(a == 1.5 and b == false and c == 23 and X == true) - - X = false - foo = function (x) - local _ = func2close(function (_, msg) - -- without errors, enclosing function should be still active when - -- __close is called - assert(debug.getinfo(2).name == "foo") - assert(msg == nil) - end) - local _ = closescope - local y = 15 - return y - end - - assert(foo() == 15 and X == true) - - X = false - foo = function () - local x = closescope - return x - end - - assert(foo() == closescope and X == true) - -end - - --- testing to-be-closed x compile-time constants --- (there were some bugs here in Lua 5.4-rc3, due to a confusion --- between compile levels and stack levels of variables) -do - local flag = false - local x = setmetatable({}, - {__close = function() assert(flag == false); flag = true end}) - local y = nil - local z = nil - do - local a = x - end - assert(flag) -- 'x' must be closed here -end - -do - -- similar problem, but with implicit close in for loops - local flag = false - local x = setmetatable({}, - {__close = function () assert(flag == false); flag = true end}) - -- return an empty iterator, nil, nil, and 'x' to be closed - local function a () - return (function () return nil end), nil, nil, x - end - local v = 1 - local w = 1 - local x = 1 - local y = 1 - local z = 1 - for k in a() do - a = k - end -- ending the loop must close 'x' - assert(flag) -- 'x' must be closed here -end - - - -do - -- calls cannot be tail in the scope of to-be-closed variables - local X, Y - local function foo () - local _ = func2close(function () Y = 10 end) - assert(X == true and Y == nil) -- 'X' not closed yet - return 1,2,3 - end - - local function bar () - local _ = func2close(function () X = false end) - X = true - do - return foo() -- not a tail call! - end - end - - local a, b, c, d = bar() - assert(a == 1 and b == 2 and c == 3 and X == false and Y == 10 and d == nil) -end - - -do - -- bug in 5.4.3: previous condition (calls cannot be tail in the - -- scope of to-be-closed variables) must be valid for tbc variables - -- created by 'for' loops. - - local closed = false - - local function foo () - return function () return true end, 0, 0, - func2close(function () closed = true end) - end - - local function tail() return closed end - - local function foo1 () - for k in foo() do return tail() end - end - - assert(foo1() == false) - assert(closed == true) -end - - -do print("testing errors in __close") - - -- original error is in __close - local function foo () - - local x = - func2close(function (self, msg) - assert(string.find(msg, "@y")) - error("@x") - end) - - local x1 = - func2close(function (self, msg) - assert(string.find(msg, "@y")) - end) - - local gc = func2close(function () collectgarbage() end) - - local y = - func2close(function (self, msg) - assert(string.find(msg, "@z")) -- error in 'z' - error("@y") - end) - - local z = - func2close(function (self, msg) - assert(msg == nil) - error("@z") - end) - - return 200 - end - - local stat, msg = pcall(foo, false) - assert(string.find(msg, "@x")) - - - -- original error not in __close - local function foo () - - local x = - func2close(function (self, msg) - -- after error, 'foo' was discarded, so caller now - -- must be 'pcall' - assert(debug.getinfo(2).name == "pcall") - assert(string.find(msg, "@x1")) - end) - - local x1 = - func2close(function (self, msg) - assert(debug.getinfo(2).name == "pcall") - assert(string.find(msg, "@y")) - error("@x1") - end) - - local gc = func2close(function () collectgarbage() end) - - local y = - func2close(function (self, msg) - assert(debug.getinfo(2).name == "pcall") - assert(string.find(msg, "@z")) - error("@y") - end) - - local first = true - local z = - func2close(function (self, msg) - assert(debug.getinfo(2).name == "pcall") - -- 'z' close is called once - assert(first and msg == 4) - first = false - error("@z") - end) - - error(4) -- original error - end - - local stat, msg = pcall(foo, true) - assert(string.find(msg, "@x1")) - - -- error leaving a block - local function foo (...) - do - local x1 = - func2close(function (self, msg) - assert(string.find(msg, "@X")) - error("@Y") - end) - - local x123 = - func2close(function (_, msg) - assert(msg == nil) - error("@X") - end) - end - os.exit(false) -- should not run - end - - local st, msg = xpcall(foo, debug.traceback) - assert(string.match(msg, "^[^ ]* @Y")) - - -- error in toclose in vararg function - local function foo (...) - local x123 = func2close(function () error("@x123") end) - end - - local st, msg = xpcall(foo, debug.traceback) - assert(string.match(msg, "^[^ ]* @x123")) - assert(string.find(msg, "in metamethod 'close'")) -end - - -do -- errors due to non-closable values - local function foo () - local x = {} - os.exit(false) -- should not run - end - local stat, msg = pcall(foo) - assert(not stat and - string.find(msg, "variable 'x' got a non%-closable value")) - - local function foo () - local xyz = setmetatable({}, {__close = print}) - getmetatable(xyz).__close = nil -- remove metamethod - end - local stat, msg = pcall(foo) - assert(not stat and string.find(msg, "metamethod 'close'")) - - local function foo () - local a1 = func2close(function (_, msg) - assert(string.find(msg, "number value")) - error(12) - end) - local a2 = setmetatable({}, {__close = print}) - local a3 = func2close(function (_, msg) - assert(msg == nil) - error(123) - end) - getmetatable(a2).__close = 4 -- invalidate metamethod - end - local stat, msg = pcall(foo) - assert(not stat and msg == 12) -end - - -do -- tbc inside close methods - local track = {} - local function foo () - local x = func2close(function () - local xx = func2close(function (_, msg) - assert(msg == nil) - track[#track + 1] = "xx" - end) - track[#track + 1] = "x" - end) - track[#track + 1] = "foo" - return 20, 30, 40 - end - local a, b, c, d = foo() - assert(a == 20 and b == 30 and c == 40 and d == nil) - assert(track[1] == "foo" and track[2] == "x" and track[3] == "xx") - - -- again, with errors - local track = {} - local function foo () - local x0 = func2close(function (_, msg) - assert(msg == 202) - track[#track + 1] = "x0" - end) - local x = func2close(function () - local xx = func2close(function (_, msg) - assert(msg == 101) - track[#track + 1] = "xx" - error(202) - end) - track[#track + 1] = "x" - error(101) - end) - track[#track + 1] = "foo" - return 20, 30, 40 - end - local st, msg = pcall(foo) - assert(not st and msg == 202) - assert(track[1] == "foo" and track[2] == "x" and track[3] == "xx" and - track[4] == "x0") -end - - -local function checktable (t1, t2) - assert(#t1 == #t2) - for i = 1, #t1 do - assert(t1[i] == t2[i]) - end -end - - -do -- test for tbc variable high in the stack - - -- function to force a stack overflow - local function overflow (n) - overflow(n + 1) - end - - -- error handler will create tbc variable handling a stack overflow, - -- high in the stack - local function errorh (m) - assert(string.find(m, "stack overflow")) - local x = func2close(function (o) o[1] = 10 end) - return x - end - - local flag - local st, obj - -- run test in a coroutine so as not to swell the main stack - local co = coroutine.wrap(function () - -- tbc variable down the stack - local y = func2close(function (obj, msg) - assert(msg == nil) - obj[1] = 100 - flag = obj - end) - tracegc.stop() - st, obj = xpcall(overflow, errorh, 0) - tracegc.start() - end) - co() - assert(not st and obj[1] == 10 and flag[1] == 100) -end - - -if rawget(_G, "T") then - - -- memory error inside closing function - local function foo () - local y = func2close(function () T.alloccount() end) - local x = setmetatable({}, {__close = function () - T.alloccount(0); local x = {} -- force a memory error - end}) - error(1000) -- common error inside the function's body - end - - stack(5) -- ensure a minimal number of CI structures - - -- despite memory error, 'y' will be executed and - -- memory limit will be lifted - local _, msg = pcall(foo) - assert(msg == "not enough memory") - - local closemsg - local close = func2close(function (self, msg) - T.alloccount() - closemsg = msg - end) - - -- set a memory limit and return a closing object to remove the limit - local function enter (count) - stack(10) -- reserve some stack space - T.alloccount(count) - closemsg = nil - return close - end - - local function test () - local x = enter(0) -- set a memory limit - local y = {} -- raise a memory error - end - - local _, msg = pcall(test) - assert(msg == "not enough memory" and closemsg == "not enough memory") - - - -- repeat test with extra closing upvalues - local function test () - local xxx = func2close(function (self, msg) - assert(msg == "not enough memory"); - error(1000) -- raise another error - end) - local xx = func2close(function (self, msg) - assert(msg == "not enough memory"); - end) - local x = enter(0) -- set a memory limit - local y = {} -- raise a memory error - end - - local _, msg = pcall(test) - assert(msg == 1000 and closemsg == "not enough memory") - - do -- testing 'toclose' in C string buffer - collectgarbage() - local s = string.rep('a', 10000) -- large string - local m = T.totalmem() - collectgarbage("stop") - s = string.upper(s) -- allocate buffer + new string (10K each) - -- ensure buffer was deallocated - assert(T.totalmem() - m <= 11000) - collectgarbage("restart") - end - - do -- now some tests for freeing buffer in case of errors - local lim = 10000 -- some size larger than the static buffer - local extra = 2000 -- some extra memory (for callinfo, etc.) - - local s = string.rep("a", lim) - - -- concat this table needs two buffer resizes (one for each 's') - local a = {s, s} - - collectgarbage(); collectgarbage() - - m = T.totalmem() - collectgarbage("stop") - - -- error in the first buffer allocation - T. totalmem(m + extra) - assert(not pcall(table.concat, a)) - -- first buffer was not even allocated - assert(T.totalmem() - m <= extra) - - -- error in the second buffer allocation - T. totalmem(m + lim + extra) - assert(not pcall(table.concat, a)) - -- first buffer was released by 'toclose' - assert(T.totalmem() - m <= extra) - - -- error in creation of final string - T.totalmem(m + 2 * lim + extra) - assert(not pcall(table.concat, a)) - -- second buffer was released by 'toclose' - assert(T.totalmem() - m <= extra) - - -- userdata, buffer, buffer, final string - T.totalmem(m + 4*lim + extra) - assert(#table.concat(a) == 2*lim) - - T.totalmem(0) -- remove memory limit - collectgarbage("restart") - - print'+' - end - - - do - -- '__close' vs. return hooks in C functions - local trace = {} - - local function hook (event) - trace[#trace + 1] = event .. " " .. (debug.getinfo(2).name or "?") - end - - -- create tbc variables to be used by C function - local x = func2close(function (_,msg) - trace[#trace + 1] = "x" - end) - - local y = func2close(function (_,msg) - trace[#trace + 1] = "y" - end) - - debug.sethook(hook, "r") - local t = {T.testC([[ - toclose 2 # x - pushnum 10 - pushint 20 - toclose 3 # y - return 2 - ]], x, y)} - debug.sethook() - - -- hooks ran before return hook from 'testC' - checktable(trace, - {"return sethook", "y", "return ?", "x", "return ?", "return testC"}) - -- results are correct - checktable(t, {10, 20}) - end -end - - -do -- '__close' vs. return hooks in Lua functions - local trace = {} - - local function hook (event) - trace[#trace + 1] = event .. " " .. debug.getinfo(2).name - end - - local function foo (...) - local x = func2close(function (_,msg) - trace[#trace + 1] = "x" - end) - - local y = func2close(function (_,msg) - debug.sethook(hook, "r") - end) - - return ... - end - - local t = {foo(10,20,30)} - debug.sethook() - checktable(t, {10, 20, 30}) - checktable(trace, - {"return sethook", "return close", "x", "return close", "return foo"}) -end - - -print "to-be-closed variables in coroutines" - -do - -- yielding inside closing metamethods - - local trace = {} - local co = coroutine.wrap(function () - - trace[#trace + 1] = "nowX" - - -- will be closed after 'y' - local x = func2close(function (_, msg) - assert(msg == nil) - trace[#trace + 1] = "x1" - coroutine.yield("x") - trace[#trace + 1] = "x2" - end) - - return pcall(function () - do -- 'z' will be closed first - local z = func2close(function (_, msg) - assert(msg == nil) - trace[#trace + 1] = "z1" - coroutine.yield("z") - trace[#trace + 1] = "z2" - end) - end - - trace[#trace + 1] = "nowY" - - -- will be closed after 'z' - local y = func2close(function(_, msg) - assert(msg == nil) - trace[#trace + 1] = "y1" - coroutine.yield("y") - trace[#trace + 1] = "y2" - end) - - return 10, 20, 30 - end) - end) - - assert(co() == "z") - assert(co() == "y") - assert(co() == "x") - checktable({co()}, {true, 10, 20, 30}) - checktable(trace, {"nowX", "z1", "z2", "nowY", "y1", "y2", "x1", "x2"}) - -end - - -do - -- yielding inside closing metamethods while returning - -- (bug in 5.4.3) - - local extrares -- result from extra yield (if any) - - local function check (body, extra, ...) - local t = table.pack(...) -- expected returns - local co = coroutine.wrap(body) - if extra then - extrares = co() -- runs until first (extra) yield - end - local res = table.pack(co()) -- runs until yield inside '__close' - assert(res.n == 2 and res[2] == nil) - local res2 = table.pack(co()) -- runs until end of function - assert(res2.n == t.n) - for i = 1, #t do - if t[i] == "x" then - assert(res2[i] == res[1]) -- value that was closed - else - assert(res2[i] == t[i]) - end - end - end - - local function foo () - local x = func2close(coroutine.yield) - local extra = func2close(function (self) - assert(self == extrares) - coroutine.yield(100) - end) - extrares = extra - return table.unpack{10, x, 30} - end - check(foo, true, 10, "x", 30) - assert(extrares == 100) - - local function foo () - local x = func2close(coroutine.yield) - return - end - check(foo, false) - - local function foo () - local x = func2close(coroutine.yield) - local y, z = 20, 30 - return x - end - check(foo, false, "x") - - local function foo () - local x = func2close(coroutine.yield) - local extra = func2close(coroutine.yield) - return table.unpack({}, 1, 100) -- 100 nils - end - check(foo, true, table.unpack({}, 1, 100)) - -end - -do - -- yielding inside closing metamethods after an error - - local co = coroutine.wrap(function () - - local function foo (err) - - local z = func2close(function(_, msg) - assert(msg == nil or msg == err + 20) - coroutine.yield("z") - return 100, 200 - end) - - local y = func2close(function(_, msg) - -- still gets the original error (if any) - assert(msg == err or (msg == nil and err == 1)) - coroutine.yield("y") - if err then error(err + 20) end -- creates or changes the error - end) - - local x = func2close(function(_, msg) - assert(msg == err or (msg == nil and err == 1)) - coroutine.yield("x") - return 100, 200 - end) - - if err == 10 then error(err) else return 10, 20 end - end - - coroutine.yield(pcall(foo, nil)) -- no error - coroutine.yield(pcall(foo, 1)) -- error in __close - return pcall(foo, 10) -- 'foo' will raise an error - end) - - local a, b = co() -- first foo: no error - assert(a == "x" and b == nil) -- yields inside 'x'; Ok - a, b = co() - assert(a == "y" and b == nil) -- yields inside 'y'; Ok - a, b = co() - assert(a == "z" and b == nil) -- yields inside 'z'; Ok - local a, b, c = co() - assert(a and b == 10 and c == 20) -- returns from 'pcall(foo, nil)' - - local a, b = co() -- second foo: error in __close - assert(a == "x" and b == nil) -- yields inside 'x'; Ok - a, b = co() - assert(a == "y" and b == nil) -- yields inside 'y'; Ok - a, b = co() - assert(a == "z" and b == nil) -- yields inside 'z'; Ok - local st, msg = co() -- reports the error in 'y' - assert(not st and msg == 21) - - local a, b = co() -- third foo: error in function body - assert(a == "x" and b == nil) -- yields inside 'x'; Ok - a, b = co() - assert(a == "y" and b == nil) -- yields inside 'y'; Ok - a, b = co() - assert(a == "z" and b == nil) -- yields inside 'z'; Ok - local st, msg = co() -- gets final error - assert(not st and msg == 10 + 20) - -end - - -do - -- an error in a wrapped coroutine closes variables - local x = false - local y = false - local co = coroutine.wrap(function () - local xv = func2close(function () x = true end) - do - local yv = func2close(function () y = true end) - coroutine.yield(100) -- yield doesn't close variable - end - coroutine.yield(200) -- yield doesn't close variable - error(23) -- error does - end) - - local b = co() - assert(b == 100 and not x and not y) - b = co() - assert(b == 200 and not x and y) - local a, b = pcall(co) - assert(not a and b == 23 and x and y) -end - - -do - - -- error in a wrapped coroutine raising errors when closing a variable - local x = 0 - local co = coroutine.wrap(function () - local xx = func2close(function (_, msg) - x = x + 1; - assert(string.find(msg, "@XXX")) - error("@YYY") - end) - local xv = func2close(function () x = x + 1; error("@XXX") end) - coroutine.yield(100) - error(200) - end) - assert(co() == 100); assert(x == 0) - local st, msg = pcall(co); assert(x == 2) - assert(not st and string.find(msg, "@YYY")) -- should get error raised - - local x = 0 - local y = 0 - co = coroutine.wrap(function () - local xx = func2close(function (_, err) - y = y + 1; - assert(string.find(err, "XXX")) - error("YYY") - end) - local xv = func2close(function () - x = x + 1; error("XXX") - end) - coroutine.yield(100) - return 200 - end) - assert(co() == 100); assert(x == 0) - local st, msg = pcall(co) - assert(x == 1 and y == 1) - -- should get first error raised - assert(not st and string.find(msg, "%w+%.%w+:%d+: YYY")) - -end - - --- a suspended coroutine should not close its variables when collected -local co -co = coroutine.wrap(function() - -- should not run - local x = func2close(function () os.exit(false) end) - co = nil - coroutine.yield() -end) -co() -- start coroutine -assert(co == nil) -- eventually it will be collected -collectgarbage() - - -if rawget(_G, "T") then - print("to-be-closed variables x coroutines in C") - do - local token = 0 - local count = 0 - local f = T.makeCfunc[[ - toclose 1 - toclose 2 - return . - ]] - - local obj = func2close(function (_, msg) - count = count + 1 - token = coroutine.yield(count, token) - end) - - local co = coroutine.wrap(f) - local ct, res = co(obj, obj, 10, 20, 30, 3) -- will return 10, 20, 30 - -- initial token value, after closing 2nd obj - assert(ct == 1 and res == 0) - -- run until yield when closing 1st obj - ct, res = co(100) - assert(ct == 2 and res == 100) - res = {co(200)} -- run until end - assert(res[1] == 10 and res[2] == 20 and res[3] == 30 and res[4] == nil) - assert(token == 200) - end - - do - local f = T.makeCfunc[[ - toclose 1 - return . - ]] - - local obj = func2close(function () - local temp - local x = func2close(function () - coroutine.yield(temp) - return 1,2,3 -- to be ignored - end) - temp = coroutine.yield("closing obj") - return 1,2,3 -- to be ignored - end) - - local co = coroutine.wrap(f) - local res = co(obj, 10, 30, 1) -- will return only 30 - assert(res == "closing obj") - res = co("closing x") - assert(res == "closing x") - res = {co()} - assert(res[1] == 30 and res[2] == nil) - end - - do - -- still cannot yield inside 'closeslot' - local f = T.makeCfunc[[ - toclose 1 - closeslot 1 - ]] - local obj = func2close(coroutine.yield) - local co = coroutine.create(f) - local st, msg = coroutine.resume(co, obj) - assert(not st and string.find(msg, "attempt to yield across")) - - -- nor outside a coroutine - local f = T.makeCfunc[[ - toclose 1 - ]] - local st, msg = pcall(f, obj) - assert(not st and string.find(msg, "attempt to yield from outside")) - end -end - - - --- to-be-closed variables in generic for loops -do - local numopen = 0 - local function open (x) - numopen = numopen + 1 - return - function () -- iteraction function - x = x - 1 - if x > 0 then return x end - end, - nil, -- state - nil, -- control variable - func2close(function () numopen = numopen - 1 end) -- closing function - end - - local s = 0 - for i in open(10) do - s = s + i - end - assert(s == 45 and numopen == 0) - - local s = 0 - for i in open(10) do - if i < 5 then break end - s = s + i - end - assert(s == 35 and numopen == 0) - - local s = 0 - for i in open(10) do - for j in open(10) do - if i + j < 5 then goto endloop end - s = s + i - end - end - ::endloop:: - assert(s == 375 and numopen == 0) -end - -print('OK') - -return 5,f - -end -- } - diff --git a/lua-5.4.4-tests/ltests/ltests.c b/lua-5.4.4-tests/ltests/ltests.c deleted file mode 100644 index 97834e3..0000000 --- a/lua-5.4.4-tests/ltests/ltests.c +++ /dev/null @@ -1,1977 +0,0 @@ -/* -** $Id: ltests.c $ -** Internal Module for Debugging of the Lua Implementation -** See Copyright Notice in lua.h -*/ - -#define ltests_c -#define LUA_CORE - -#include "lprefix.h" - - -#include -#include -#include -#include -#include - -#include "lua.h" - -#include "lapi.h" -#include "lauxlib.h" -#include "lcode.h" -#include "lctype.h" -#include "ldebug.h" -#include "ldo.h" -#include "lfunc.h" -#include "lmem.h" -#include "lopcodes.h" -#include "lopnames.h" -#include "lstate.h" -#include "lstring.h" -#include "ltable.h" -#include "lualib.h" - - - -/* -** The whole module only makes sense with LUA_DEBUG on -*/ -#if defined(LUA_DEBUG) - - -void *l_Trick = 0; - - -#define obj_at(L,k) s2v(L->ci->func + (k)) - - -static int runC (lua_State *L, lua_State *L1, const char *pc); - - -static void setnameval (lua_State *L, const char *name, int val) { - lua_pushinteger(L, val); - lua_setfield(L, -2, name); -} - - -static void pushobject (lua_State *L, const TValue *o) { - setobj2s(L, L->top, o); - api_incr_top(L); -} - - -static void badexit (const char *fmt, const char *s1, const char *s2) { - fprintf(stderr, fmt, s1); - if (s2) - fprintf(stderr, "extra info: %s\n", s2); - /* avoid assertion failures when exiting */ - l_memcontrol.numblocks = l_memcontrol.total = 0; - exit(EXIT_FAILURE); -} - - -static int tpanic (lua_State *L) { - const char *msg = lua_tostring(L, -1); - if (msg == NULL) msg = "error object is not a string"; - return (badexit("PANIC: unprotected error in call to Lua API (%s)\n", - msg, NULL), - 0); /* do not return to Lua */ -} - - -/* -** Warning function for tests. First, it concatenates all parts of -** a warning in buffer 'buff'. Then, it has three modes: -** - 0.normal: messages starting with '#' are shown on standard output; -** - other messages abort the tests (they represent real warning -** conditions; the standard tests should not generate these conditions -** unexpectedly); -** - 1.allow: all messages are shown; -** - 2.store: all warnings go to the global '_WARN'; -*/ -static void warnf (void *ud, const char *msg, int tocont) { - lua_State *L = cast(lua_State *, ud); - static char buff[200] = ""; /* should be enough for tests... */ - static int onoff = 0; - static int mode = 0; /* start in normal mode */ - static int lasttocont = 0; - if (!lasttocont && !tocont && *msg == '@') { /* control message? */ - if (buff[0] != '\0') - badexit("Control warning during warning: %s\naborting...\n", msg, buff); - if (strcmp(msg, "@off") == 0) - onoff = 0; - else if (strcmp(msg, "@on") == 0) - onoff = 1; - else if (strcmp(msg, "@normal") == 0) - mode = 0; - else if (strcmp(msg, "@allow") == 0) - mode = 1; - else if (strcmp(msg, "@store") == 0) - mode = 2; - else - badexit("Invalid control warning in test mode: %s\naborting...\n", - msg, NULL); - return; - } - lasttocont = tocont; - if (strlen(msg) >= sizeof(buff) - strlen(buff)) - badexit("warnf-buffer overflow (%s)\n", msg, buff); - strcat(buff, msg); /* add new message to current warning */ - if (!tocont) { /* message finished? */ - lua_unlock(L); - luaL_checkstack(L, 1, "warn stack space"); - lua_getglobal(L, "_WARN"); - if (!lua_toboolean(L, -1)) - lua_pop(L, 1); /* ok, no previous unexpected warning */ - else { - badexit("Unhandled warning in store mode: %s\naborting...\n", - lua_tostring(L, -1), buff); - } - lua_lock(L); - switch (mode) { - case 0: { /* normal */ - if (buff[0] != '#' && onoff) /* unexpected warning? */ - badexit("Unexpected warning in test mode: %s\naborting...\n", - buff, NULL); - } /* FALLTHROUGH */ - case 1: { /* allow */ - if (onoff) - fprintf(stderr, "Lua warning: %s\n", buff); /* print warning */ - break; - } - case 2: { /* store */ - lua_unlock(L); - luaL_checkstack(L, 1, "warn stack space"); - lua_pushstring(L, buff); - lua_setglobal(L, "_WARN"); /* assign message to global '_WARN' */ - lua_lock(L); - break; - } - } - buff[0] = '\0'; /* prepare buffer for next warning */ - } -} - - -/* -** {====================================================================== -** Controlled version for realloc. -** ======================================================================= -*/ - -#define MARK 0x55 /* 01010101 (a nice pattern) */ - -typedef union Header { - LUAI_MAXALIGN; - struct { - size_t size; - int type; - } d; -} Header; - - -#if !defined(EXTERNMEMCHECK) - -/* full memory check */ -#define MARKSIZE 16 /* size of marks after each block */ -#define fillmem(mem,size) memset(mem, -MARK, size) - -#else - -/* external memory check: don't do it twice */ -#define MARKSIZE 0 -#define fillmem(mem,size) /* empty */ - -#endif - - -Memcontrol l_memcontrol = - {0, 0UL, 0UL, 0UL, 0UL, (~0UL), - {0UL, 0UL, 0UL, 0UL, 0UL, 0UL, 0UL, 0UL, 0UL}}; - - -static void freeblock (Memcontrol *mc, Header *block) { - if (block) { - size_t size = block->d.size; - int i; - for (i = 0; i < MARKSIZE; i++) /* check marks after block */ - lua_assert(*(cast_charp(block + 1) + size + i) == MARK); - mc->objcount[block->d.type]--; - fillmem(block, sizeof(Header) + size + MARKSIZE); /* erase block */ - free(block); /* actually free block */ - mc->numblocks--; /* update counts */ - mc->total -= size; - } -} - - -void *debug_realloc (void *ud, void *b, size_t oldsize, size_t size) { - Memcontrol *mc = cast(Memcontrol *, ud); - Header *block = cast(Header *, b); - int type; - if (mc->memlimit == 0) { /* first time? */ - char *limit = getenv("MEMLIMIT"); /* initialize memory limit */ - mc->memlimit = limit ? strtoul(limit, NULL, 10) : ULONG_MAX; - } - if (block == NULL) { - type = (oldsize < LUA_NUMTAGS) ? oldsize : 0; - oldsize = 0; - } - else { - block--; /* go to real header */ - type = block->d.type; - lua_assert(oldsize == block->d.size); - } - if (size == 0) { - freeblock(mc, block); - return NULL; - } - if (mc->failnext) { - mc->failnext = 0; - return NULL; /* fake a single memory allocation error */ - } - if (mc->countlimit != ~0UL && size != oldsize) { /* count limit in use? */ - if (mc->countlimit == 0) - return NULL; /* fake a memory allocation error */ - mc->countlimit--; - } - if (size > oldsize && mc->total+size-oldsize > mc->memlimit) - return NULL; /* fake a memory allocation error */ - else { - Header *newblock; - int i; - size_t commonsize = (oldsize < size) ? oldsize : size; - size_t realsize = sizeof(Header) + size + MARKSIZE; - if (realsize < size) return NULL; /* arithmetic overflow! */ - newblock = cast(Header *, malloc(realsize)); /* alloc a new block */ - if (newblock == NULL) - return NULL; /* really out of memory? */ - if (block) { - memcpy(newblock + 1, block + 1, commonsize); /* copy old contents */ - freeblock(mc, block); /* erase (and check) old copy */ - } - /* initialize new part of the block with something weird */ - fillmem(cast_charp(newblock + 1) + commonsize, size - commonsize); - /* initialize marks after block */ - for (i = 0; i < MARKSIZE; i++) - *(cast_charp(newblock + 1) + size + i) = MARK; - newblock->d.size = size; - newblock->d.type = type; - mc->total += size; - if (mc->total > mc->maxmem) - mc->maxmem = mc->total; - mc->numblocks++; - mc->objcount[type]++; - return newblock + 1; - } -} - - -/* }====================================================================== */ - - - -/* -** {===================================================================== -** Functions to check memory consistency. -** Most of these checks are done through asserts, so this code does -** not make sense with asserts off. For this reason, it uses 'assert' -** directly, instead of 'lua_assert'. -** ====================================================================== -*/ - -#include - -/* -** Check GC invariants. For incremental mode, a black object cannot -** point to a white one. For generational mode, really old objects -** cannot point to young objects. Both old1 and touched2 objects -** cannot point to new objects (but can point to survivals). -** (Threads and open upvalues, despite being marked "really old", -** continue to be visited in all collections, and therefore can point to -** new objects. They, and only they, are old but gray.) -*/ -static int testobjref1 (global_State *g, GCObject *f, GCObject *t) { - if (isdead(g,t)) return 0; - if (issweepphase(g)) - return 1; /* no invariants */ - else if (g->gckind == KGC_INC) - return !(isblack(f) && iswhite(t)); /* basic incremental invariant */ - else { /* generational mode */ - if ((getage(f) == G_OLD && isblack(f)) && !isold(t)) - return 0; - if (((getage(f) == G_OLD1 || getage(f) == G_TOUCHED2) && isblack(f)) && - getage(t) == G_NEW) - return 0; - return 1; - } -} - - -static void printobj (global_State *g, GCObject *o) { - printf("||%s(%p)-%c%c(%02X)||", - ttypename(novariant(o->tt)), (void *)o, - isdead(g,o) ? 'd' : isblack(o) ? 'b' : iswhite(o) ? 'w' : 'g', - "ns01oTt"[getage(o)], o->marked); - if (o->tt == LUA_VSHRSTR || o->tt == LUA_VLNGSTR) - printf(" '%s'", getstr(gco2ts(o))); -} - - -void lua_printobj (lua_State *L, struct GCObject *o) { - printobj(G(L), o); -} - -static int testobjref (global_State *g, GCObject *f, GCObject *t) { - int r1 = testobjref1(g, f, t); - if (!r1) { - printf("%d(%02X) - ", g->gcstate, g->currentwhite); - printobj(g, f); - printf(" -> "); - printobj(g, t); - printf("\n"); - } - return r1; -} - - -static void checkobjref (global_State *g, GCObject *f, GCObject *t) { - assert(testobjref(g, f, t)); -} - - -/* -** Version where 't' can be NULL. In that case, it should not apply the -** macro 'obj2gco' over the object. ('t' may have several types, so this -** definition must be a macro.) Most checks need this version, because -** the check may run while an object is still being created. -*/ -#define checkobjrefN(g,f,t) { if (t) checkobjref(g,f,obj2gco(t)); } - - -static void checkvalref (global_State *g, GCObject *f, const TValue *t) { - assert(!iscollectable(t) || (righttt(t) && testobjref(g, f, gcvalue(t)))); -} - - -static void checktable (global_State *g, Table *h) { - unsigned int i; - unsigned int asize = luaH_realasize(h); - Node *n, *limit = gnode(h, sizenode(h)); - GCObject *hgc = obj2gco(h); - checkobjrefN(g, hgc, h->metatable); - for (i = 0; i < asize; i++) - checkvalref(g, hgc, &h->array[i]); - for (n = gnode(h, 0); n < limit; n++) { - if (!isempty(gval(n))) { - TValue k; - getnodekey(g->mainthread, &k, n); - assert(!keyisnil(n)); - checkvalref(g, hgc, &k); - checkvalref(g, hgc, gval(n)); - } - } -} - - -static void checkudata (global_State *g, Udata *u) { - int i; - GCObject *hgc = obj2gco(u); - checkobjrefN(g, hgc, u->metatable); - for (i = 0; i < u->nuvalue; i++) - checkvalref(g, hgc, &u->uv[i].uv); -} - - -static void checkproto (global_State *g, Proto *f) { - int i; - GCObject *fgc = obj2gco(f); - checkobjrefN(g, fgc, f->source); - for (i=0; isizek; i++) { - if (iscollectable(f->k + i)) - checkobjref(g, fgc, gcvalue(f->k + i)); - } - for (i=0; isizeupvalues; i++) - checkobjrefN(g, fgc, f->upvalues[i].name); - for (i=0; isizep; i++) - checkobjrefN(g, fgc, f->p[i]); - for (i=0; isizelocvars; i++) - checkobjrefN(g, fgc, f->locvars[i].varname); -} - - -static void checkCclosure (global_State *g, CClosure *cl) { - GCObject *clgc = obj2gco(cl); - int i; - for (i = 0; i < cl->nupvalues; i++) - checkvalref(g, clgc, &cl->upvalue[i]); -} - - -static void checkLclosure (global_State *g, LClosure *cl) { - GCObject *clgc = obj2gco(cl); - int i; - checkobjrefN(g, clgc, cl->p); - for (i=0; inupvalues; i++) { - UpVal *uv = cl->upvals[i]; - if (uv) { - checkobjrefN(g, clgc, uv); - if (!upisopen(uv)) - checkvalref(g, obj2gco(uv), uv->v); - } - } -} - - -static int lua_checkpc (CallInfo *ci) { - if (!isLua(ci)) return 1; - else { - StkId f = ci->func; - Proto *p = clLvalue(s2v(f))->p; - return p->code <= ci->u.l.savedpc && - ci->u.l.savedpc <= p->code + p->sizecode; - } -} - - -static void checkstack (global_State *g, lua_State *L1) { - StkId o; - CallInfo *ci; - UpVal *uv; - assert(!isdead(g, L1)); - if (L1->stack == NULL) { /* incomplete thread? */ - assert(L1->openupval == NULL && L1->ci == NULL); - return; - } - for (uv = L1->openupval; uv != NULL; uv = uv->u.open.next) - assert(upisopen(uv)); /* must be open */ - assert(L1->top <= L1->stack_last); - assert(L1->tbclist <= L1->top); - for (ci = L1->ci; ci != NULL; ci = ci->previous) { - assert(ci->top <= L1->stack_last); - assert(lua_checkpc(ci)); - } - for (o = L1->stack; o < L1->stack_last; o++) - checkliveness(L1, s2v(o)); /* entire stack must have valid values */ -} - - -static void checkrefs (global_State *g, GCObject *o) { - switch (o->tt) { - case LUA_VUSERDATA: { - checkudata(g, gco2u(o)); - break; - } - case LUA_VUPVAL: { - checkvalref(g, o, gco2upv(o)->v); - break; - } - case LUA_VTABLE: { - checktable(g, gco2t(o)); - break; - } - case LUA_VTHREAD: { - checkstack(g, gco2th(o)); - break; - } - case LUA_VLCL: { - checkLclosure(g, gco2lcl(o)); - break; - } - case LUA_VCCL: { - checkCclosure(g, gco2ccl(o)); - break; - } - case LUA_VPROTO: { - checkproto(g, gco2p(o)); - break; - } - case LUA_VSHRSTR: - case LUA_VLNGSTR: { - assert(!isgray(o)); /* strings are never gray */ - break; - } - default: assert(0); - } -} - - -/* -** Check consistency of an object: -** - Dead objects can only happen in the 'allgc' list during a sweep -** phase (controlled by the caller through 'maybedead'). -** - During pause, all objects must be white. -** - In generational mode: -** * objects must be old enough for their lists ('listage'). -** * old objects cannot be white. -** * old objects must be black, except for 'touched1', 'old0', -** threads, and open upvalues. -*/ -static void checkobject (global_State *g, GCObject *o, int maybedead, - int listage) { - if (isdead(g, o)) - assert(maybedead); - else { - assert(g->gcstate != GCSpause || iswhite(o)); - if (g->gckind == KGC_GEN) { /* generational mode? */ - assert(getage(o) >= listage); - assert(!iswhite(o) || !isold(o)); - if (isold(o)) { - assert(isblack(o) || - getage(o) == G_TOUCHED1 || - getage(o) == G_OLD0 || - o->tt == LUA_VTHREAD || - (o->tt == LUA_VUPVAL && upisopen(gco2upv(o)))); - } - } - checkrefs(g, o); - } -} - - -static lu_mem checkgraylist (global_State *g, GCObject *o) { - int total = 0; /* count number of elements in the list */ - ((void)g); /* better to keep it available if we need to print an object */ - while (o) { - assert(!!isgray(o) ^ (getage(o) == G_TOUCHED2)); - assert(!testbit(o->marked, TESTBIT)); - if (keepinvariant(g)) - l_setbit(o->marked, TESTBIT); /* mark that object is in a gray list */ - total++; - switch (o->tt) { - case LUA_VTABLE: o = gco2t(o)->gclist; break; - case LUA_VLCL: o = gco2lcl(o)->gclist; break; - case LUA_VCCL: o = gco2ccl(o)->gclist; break; - case LUA_VTHREAD: o = gco2th(o)->gclist; break; - case LUA_VPROTO: o = gco2p(o)->gclist; break; - case LUA_VUSERDATA: - assert(gco2u(o)->nuvalue > 0); - o = gco2u(o)->gclist; - break; - default: assert(0); /* other objects cannot be in a gray list */ - } - } - return total; -} - - -/* -** Check objects in gray lists. -*/ -static lu_mem checkgrays (global_State *g) { - int total = 0; /* count number of elements in all lists */ - if (!keepinvariant(g)) return total; - total += checkgraylist(g, g->gray); - total += checkgraylist(g, g->grayagain); - total += checkgraylist(g, g->weak); - total += checkgraylist(g, g->allweak); - total += checkgraylist(g, g->ephemeron); - return total; -} - - -/* -** Check whether 'o' should be in a gray list. If so, increment -** 'count' and check its TESTBIT. (It must have been previously set by -** 'checkgraylist'.) -*/ -static void incifingray (global_State *g, GCObject *o, lu_mem *count) { - if (!keepinvariant(g)) - return; /* gray lists not being kept in these phases */ - if (o->tt == LUA_VUPVAL) { - /* only open upvalues can be gray */ - assert(!isgray(o) || upisopen(gco2upv(o))); - return; /* upvalues are never in gray lists */ - } - /* these are the ones that must be in gray lists */ - if (isgray(o) || getage(o) == G_TOUCHED2) { - (*count)++; - assert(testbit(o->marked, TESTBIT)); - resetbit(o->marked, TESTBIT); /* prepare for next cycle */ - } -} - - -static lu_mem checklist (global_State *g, int maybedead, int tof, - GCObject *newl, GCObject *survival, GCObject *old, GCObject *reallyold) { - GCObject *o; - lu_mem total = 0; /* number of object that should be in gray lists */ - for (o = newl; o != survival; o = o->next) { - checkobject(g, o, maybedead, G_NEW); - incifingray(g, o, &total); - assert(!tof == !tofinalize(o)); - } - for (o = survival; o != old; o = o->next) { - checkobject(g, o, 0, G_SURVIVAL); - incifingray(g, o, &total); - assert(!tof == !tofinalize(o)); - } - for (o = old; o != reallyold; o = o->next) { - checkobject(g, o, 0, G_OLD1); - incifingray(g, o, &total); - assert(!tof == !tofinalize(o)); - } - for (o = reallyold; o != NULL; o = o->next) { - checkobject(g, o, 0, G_OLD); - incifingray(g, o, &total); - assert(!tof == !tofinalize(o)); - } - return total; -} - - -int lua_checkmemory (lua_State *L) { - global_State *g = G(L); - GCObject *o; - int maybedead; - lu_mem totalin; /* total of objects that are in gray lists */ - lu_mem totalshould; /* total of objects that should be in gray lists */ - if (keepinvariant(g)) { - assert(!iswhite(g->mainthread)); - assert(!iswhite(gcvalue(&g->l_registry))); - } - assert(!isdead(g, gcvalue(&g->l_registry))); - assert(g->sweepgc == NULL || issweepphase(g)); - totalin = checkgrays(g); - - /* check 'fixedgc' list */ - for (o = g->fixedgc; o != NULL; o = o->next) { - assert(o->tt == LUA_VSHRSTR && isgray(o) && getage(o) == G_OLD); - } - - /* check 'allgc' list */ - maybedead = (GCSatomic < g->gcstate && g->gcstate <= GCSswpallgc); - totalshould = checklist(g, maybedead, 0, g->allgc, - g->survival, g->old1, g->reallyold); - - /* check 'finobj' list */ - totalshould += checklist(g, 0, 1, g->finobj, - g->finobjsur, g->finobjold1, g->finobjrold); - - /* check 'tobefnz' list */ - for (o = g->tobefnz; o != NULL; o = o->next) { - checkobject(g, o, 0, G_NEW); - incifingray(g, o, &totalshould); - assert(tofinalize(o)); - assert(o->tt == LUA_VUSERDATA || o->tt == LUA_VTABLE); - } - if (keepinvariant(g)) - assert(totalin == totalshould); - return 0; -} - -/* }====================================================== */ - - - -/* -** {====================================================== -** Disassembler -** ======================================================= -*/ - - -static char *buildop (Proto *p, int pc, char *buff) { - char *obuff = buff; - Instruction i = p->code[pc]; - OpCode o = GET_OPCODE(i); - const char *name = opnames[o]; - int line = luaG_getfuncline(p, pc); - int lineinfo = (p->lineinfo != NULL) ? p->lineinfo[pc] : 0; - if (lineinfo == ABSLINEINFO) - buff += sprintf(buff, "(__"); - else - buff += sprintf(buff, "(%2d", lineinfo); - buff += sprintf(buff, " - %4d) %4d - ", line, pc); - switch (getOpMode(o)) { - case iABC: - sprintf(buff, "%-12s%4d %4d %4d%s", name, - GETARG_A(i), GETARG_B(i), GETARG_C(i), - GETARG_k(i) ? " (k)" : ""); - break; - case iABx: - sprintf(buff, "%-12s%4d %4d", name, GETARG_A(i), GETARG_Bx(i)); - break; - case iAsBx: - sprintf(buff, "%-12s%4d %4d", name, GETARG_A(i), GETARG_sBx(i)); - break; - case iAx: - sprintf(buff, "%-12s%4d", name, GETARG_Ax(i)); - break; - case isJ: - sprintf(buff, "%-12s%4d", name, GETARG_sJ(i)); - break; - } - return obuff; -} - - -#if 0 -void luaI_printcode (Proto *pt, int size) { - int pc; - for (pc=0; pcmaxstacksize); - setnameval(L, "numparams", p->numparams); - for (pc=0; pcsizecode; pc++) { - char buff[100]; - lua_pushinteger(L, pc+1); - lua_pushstring(L, buildop(p, pc, buff)); - lua_settable(L, -3); - } - return 1; -} - - -static int printcode (lua_State *L) { - int pc; - Proto *p; - luaL_argcheck(L, lua_isfunction(L, 1) && !lua_iscfunction(L, 1), - 1, "Lua function expected"); - p = getproto(obj_at(L, 1)); - printf("maxstack: %d\n", p->maxstacksize); - printf("numparams: %d\n", p->numparams); - for (pc=0; pcsizecode; pc++) { - char buff[100]; - printf("%s\n", buildop(p, pc, buff)); - } - return 0; -} - - -static int listk (lua_State *L) { - Proto *p; - int i; - luaL_argcheck(L, lua_isfunction(L, 1) && !lua_iscfunction(L, 1), - 1, "Lua function expected"); - p = getproto(obj_at(L, 1)); - lua_createtable(L, p->sizek, 0); - for (i=0; isizek; i++) { - pushobject(L, p->k+i); - lua_rawseti(L, -2, i+1); - } - return 1; -} - - -static int listabslineinfo (lua_State *L) { - Proto *p; - int i; - luaL_argcheck(L, lua_isfunction(L, 1) && !lua_iscfunction(L, 1), - 1, "Lua function expected"); - p = getproto(obj_at(L, 1)); - luaL_argcheck(L, p->abslineinfo != NULL, 1, "function has no debug info"); - lua_createtable(L, 2 * p->sizeabslineinfo, 0); - for (i=0; i < p->sizeabslineinfo; i++) { - lua_pushinteger(L, p->abslineinfo[i].pc); - lua_rawseti(L, -2, 2 * i + 1); - lua_pushinteger(L, p->abslineinfo[i].line); - lua_rawseti(L, -2, 2 * i + 2); - } - return 1; -} - - -static int listlocals (lua_State *L) { - Proto *p; - int pc = cast_int(luaL_checkinteger(L, 2)) - 1; - int i = 0; - const char *name; - luaL_argcheck(L, lua_isfunction(L, 1) && !lua_iscfunction(L, 1), - 1, "Lua function expected"); - p = getproto(obj_at(L, 1)); - while ((name = luaF_getlocalname(p, ++i, pc)) != NULL) - lua_pushstring(L, name); - return i-1; -} - -/* }====================================================== */ - - - -static void printstack (lua_State *L) { - int i; - int n = lua_gettop(L); - printf("stack: >>\n"); - for (i = 1; i <= n; i++) { - printf("%3d: %s\n", i, luaL_tolstring(L, i, NULL)); - lua_pop(L, 1); - } - printf("<<\n"); -} - - -static int get_limits (lua_State *L) { - lua_createtable(L, 0, 6); - setnameval(L, "IS32INT", LUAI_IS32INT); - setnameval(L, "MAXARG_Ax", MAXARG_Ax); - setnameval(L, "MAXARG_Bx", MAXARG_Bx); - setnameval(L, "OFFSET_sBx", OFFSET_sBx); - setnameval(L, "LFPF", LFIELDS_PER_FLUSH); - setnameval(L, "NUM_OPCODES", NUM_OPCODES); - return 1; -} - - -static int mem_query (lua_State *L) { - if (lua_isnone(L, 1)) { - lua_pushinteger(L, l_memcontrol.total); - lua_pushinteger(L, l_memcontrol.numblocks); - lua_pushinteger(L, l_memcontrol.maxmem); - return 3; - } - else if (lua_isnumber(L, 1)) { - unsigned long limit = cast(unsigned long, luaL_checkinteger(L, 1)); - if (limit == 0) limit = ULONG_MAX; - l_memcontrol.memlimit = limit; - return 0; - } - else { - const char *t = luaL_checkstring(L, 1); - int i; - for (i = LUA_NUMTAGS - 1; i >= 0; i--) { - if (strcmp(t, ttypename(i)) == 0) { - lua_pushinteger(L, l_memcontrol.objcount[i]); - return 1; - } - } - return luaL_error(L, "unknown type '%s'", t); - } -} - - -static int alloc_count (lua_State *L) { - if (lua_isnone(L, 1)) - l_memcontrol.countlimit = ~0L; - else - l_memcontrol.countlimit = luaL_checkinteger(L, 1); - return 0; -} - - -static int alloc_failnext (lua_State *L) { - UNUSED(L); - l_memcontrol.failnext = 1; - return 0; -} - - -static int settrick (lua_State *L) { - if (ttisnil(obj_at(L, 1))) - l_Trick = NULL; - else - l_Trick = gcvalue(obj_at(L, 1)); - return 0; -} - - -static int gc_color (lua_State *L) { - TValue *o; - luaL_checkany(L, 1); - o = obj_at(L, 1); - if (!iscollectable(o)) - lua_pushstring(L, "no collectable"); - else { - GCObject *obj = gcvalue(o); - lua_pushstring(L, isdead(G(L), obj) ? "dead" : - iswhite(obj) ? "white" : - isblack(obj) ? "black" : "gray"); - } - return 1; -} - - -static int gc_age (lua_State *L) { - TValue *o; - luaL_checkany(L, 1); - o = obj_at(L, 1); - if (!iscollectable(o)) - lua_pushstring(L, "no collectable"); - else { - static const char *gennames[] = {"new", "survival", "old0", "old1", - "old", "touched1", "touched2"}; - GCObject *obj = gcvalue(o); - lua_pushstring(L, gennames[getage(obj)]); - } - return 1; -} - - -static int gc_printobj (lua_State *L) { - TValue *o; - luaL_checkany(L, 1); - o = obj_at(L, 1); - if (!iscollectable(o)) - printf("no collectable\n"); - else { - GCObject *obj = gcvalue(o); - printobj(G(L), obj); - printf("\n"); - } - return 0; -} - - -static int gc_state (lua_State *L) { - static const char *statenames[] = { - "propagate", "atomic", "enteratomic", "sweepallgc", "sweepfinobj", - "sweeptobefnz", "sweepend", "callfin", "pause", ""}; - static const int states[] = { - GCSpropagate, GCSenteratomic, GCSatomic, GCSswpallgc, GCSswpfinobj, - GCSswptobefnz, GCSswpend, GCScallfin, GCSpause, -1}; - int option = states[luaL_checkoption(L, 1, "", statenames)]; - if (option == -1) { - lua_pushstring(L, statenames[G(L)->gcstate]); - return 1; - } - else { - global_State *g = G(L); - if (G(L)->gckind == KGC_GEN) - luaL_error(L, "cannot change states in generational mode"); - lua_lock(L); - if (option < g->gcstate) { /* must cross 'pause'? */ - luaC_runtilstate(L, bitmask(GCSpause)); /* run until pause */ - } - luaC_runtilstate(L, bitmask(option)); - lua_assert(G(L)->gcstate == option); - lua_unlock(L); - return 0; - } -} - - -static int hash_query (lua_State *L) { - if (lua_isnone(L, 2)) { - luaL_argcheck(L, lua_type(L, 1) == LUA_TSTRING, 1, "string expected"); - lua_pushinteger(L, tsvalue(obj_at(L, 1))->hash); - } - else { - TValue *o = obj_at(L, 1); - Table *t; - luaL_checktype(L, 2, LUA_TTABLE); - t = hvalue(obj_at(L, 2)); - lua_pushinteger(L, luaH_mainposition(t, o) - t->node); - } - return 1; -} - - -static int stacklevel (lua_State *L) { - unsigned long a = 0; - lua_pushinteger(L, (L->top - L->stack)); - lua_pushinteger(L, stacksize(L)); - lua_pushinteger(L, L->nCcalls); - lua_pushinteger(L, L->nci); - lua_pushinteger(L, (unsigned long)&a); - return 5; -} - - -static int table_query (lua_State *L) { - const Table *t; - int i = cast_int(luaL_optinteger(L, 2, -1)); - unsigned int asize; - luaL_checktype(L, 1, LUA_TTABLE); - t = hvalue(obj_at(L, 1)); - asize = luaH_realasize(t); - if (i == -1) { - lua_pushinteger(L, asize); - lua_pushinteger(L, allocsizenode(t)); - lua_pushinteger(L, isdummy(t) ? 0 : t->lastfree - t->node); - lua_pushinteger(L, t->alimit); - return 4; - } - else if ((unsigned int)i < asize) { - lua_pushinteger(L, i); - pushobject(L, &t->array[i]); - lua_pushnil(L); - } - else if ((i -= asize) < sizenode(t)) { - TValue k; - getnodekey(L, &k, gnode(t, i)); - if (!isempty(gval(gnode(t, i))) || - ttisnil(&k) || - ttisnumber(&k)) { - pushobject(L, &k); - } - else - lua_pushliteral(L, ""); - pushobject(L, gval(gnode(t, i))); - if (gnext(&t->node[i]) != 0) - lua_pushinteger(L, gnext(&t->node[i])); - else - lua_pushnil(L); - } - return 3; -} - - -static int string_query (lua_State *L) { - stringtable *tb = &G(L)->strt; - int s = cast_int(luaL_optinteger(L, 1, 0)) - 1; - if (s == -1) { - lua_pushinteger(L ,tb->size); - lua_pushinteger(L ,tb->nuse); - return 2; - } - else if (s < tb->size) { - TString *ts; - int n = 0; - for (ts = tb->hash[s]; ts != NULL; ts = ts->u.hnext) { - setsvalue2s(L, L->top, ts); - api_incr_top(L); - n++; - } - return n; - } - else return 0; -} - - -static int tref (lua_State *L) { - int level = lua_gettop(L); - luaL_checkany(L, 1); - lua_pushvalue(L, 1); - lua_pushinteger(L, luaL_ref(L, LUA_REGISTRYINDEX)); - (void)level; /* to avoid warnings */ - lua_assert(lua_gettop(L) == level+1); /* +1 for result */ - return 1; -} - -static int getref (lua_State *L) { - int level = lua_gettop(L); - lua_rawgeti(L, LUA_REGISTRYINDEX, luaL_checkinteger(L, 1)); - (void)level; /* to avoid warnings */ - lua_assert(lua_gettop(L) == level+1); - return 1; -} - -static int unref (lua_State *L) { - int level = lua_gettop(L); - luaL_unref(L, LUA_REGISTRYINDEX, cast_int(luaL_checkinteger(L, 1))); - (void)level; /* to avoid warnings */ - lua_assert(lua_gettop(L) == level); - return 0; -} - - -static int upvalue (lua_State *L) { - int n = cast_int(luaL_checkinteger(L, 2)); - luaL_checktype(L, 1, LUA_TFUNCTION); - if (lua_isnone(L, 3)) { - const char *name = lua_getupvalue(L, 1, n); - if (name == NULL) return 0; - lua_pushstring(L, name); - return 2; - } - else { - const char *name = lua_setupvalue(L, 1, n); - lua_pushstring(L, name); - return 1; - } -} - - -static int newuserdata (lua_State *L) { - size_t size = cast_sizet(luaL_optinteger(L, 1, 0)); - int nuv = luaL_optinteger(L, 2, 0); - char *p = cast_charp(lua_newuserdatauv(L, size, nuv)); - while (size--) *p++ = '\0'; - return 1; -} - - -static int pushuserdata (lua_State *L) { - lua_Integer u = luaL_checkinteger(L, 1); - lua_pushlightuserdata(L, cast_voidp(cast_sizet(u))); - return 1; -} - - -static int udataval (lua_State *L) { - lua_pushinteger(L, cast(long, lua_touserdata(L, 1))); - return 1; -} - - -static int doonnewstack (lua_State *L) { - lua_State *L1 = lua_newthread(L); - size_t l; - const char *s = luaL_checklstring(L, 1, &l); - int status = luaL_loadbuffer(L1, s, l, s); - if (status == LUA_OK) - status = lua_pcall(L1, 0, 0, 0); - lua_pushinteger(L, status); - return 1; -} - - -static int s2d (lua_State *L) { - lua_pushnumber(L, cast_num(*cast(const double *, luaL_checkstring(L, 1)))); - return 1; -} - - -static int d2s (lua_State *L) { - double d = cast(double, luaL_checknumber(L, 1)); - lua_pushlstring(L, cast_charp(&d), sizeof(d)); - return 1; -} - - -static int num2int (lua_State *L) { - lua_pushinteger(L, lua_tointeger(L, 1)); - return 1; -} - - -static int newstate (lua_State *L) { - void *ud; - lua_Alloc f = lua_getallocf(L, &ud); - lua_State *L1 = lua_newstate(f, ud); - if (L1) { - lua_atpanic(L1, tpanic); - lua_pushlightuserdata(L, L1); - } - else - lua_pushnil(L); - return 1; -} - - -static lua_State *getstate (lua_State *L) { - lua_State *L1 = cast(lua_State *, lua_touserdata(L, 1)); - luaL_argcheck(L, L1 != NULL, 1, "state expected"); - return L1; -} - - -static int loadlib (lua_State *L) { - static const luaL_Reg libs[] = { - {LUA_GNAME, luaopen_base}, - {"coroutine", luaopen_coroutine}, - {"debug", luaopen_debug}, - {"io", luaopen_io}, - {"os", luaopen_os}, - {"math", luaopen_math}, - {"string", luaopen_string}, - {"table", luaopen_table}, - {"T", luaB_opentests}, - {NULL, NULL} - }; - lua_State *L1 = getstate(L); - int i; - luaL_requiref(L1, "package", luaopen_package, 0); - lua_assert(lua_type(L1, -1) == LUA_TTABLE); - /* 'requiref' should not reload module already loaded... */ - luaL_requiref(L1, "package", NULL, 1); /* seg. fault if it reloads */ - /* ...but should return the same module */ - lua_assert(lua_compare(L1, -1, -2, LUA_OPEQ)); - luaL_getsubtable(L1, LUA_REGISTRYINDEX, LUA_PRELOAD_TABLE); - for (i = 0; libs[i].name; i++) { - lua_pushcfunction(L1, libs[i].func); - lua_setfield(L1, -2, libs[i].name); - } - return 0; -} - -static int closestate (lua_State *L) { - lua_State *L1 = getstate(L); - lua_close(L1); - return 0; -} - -static int doremote (lua_State *L) { - lua_State *L1 = getstate(L); - size_t lcode; - const char *code = luaL_checklstring(L, 2, &lcode); - int status; - lua_settop(L1, 0); - status = luaL_loadbuffer(L1, code, lcode, code); - if (status == LUA_OK) - status = lua_pcall(L1, 0, LUA_MULTRET, 0); - if (status != LUA_OK) { - lua_pushnil(L); - lua_pushstring(L, lua_tostring(L1, -1)); - lua_pushinteger(L, status); - return 3; - } - else { - int i = 0; - while (!lua_isnone(L1, ++i)) - lua_pushstring(L, lua_tostring(L1, i)); - lua_pop(L1, i-1); - return i-1; - } -} - - -static int log2_aux (lua_State *L) { - unsigned int x = (unsigned int)luaL_checkinteger(L, 1); - lua_pushinteger(L, luaO_ceillog2(x)); - return 1; -} - - -struct Aux { jmp_buf jb; const char *paniccode; lua_State *L; }; - -/* -** does a long-jump back to "main program". -*/ -static int panicback (lua_State *L) { - struct Aux *b; - lua_checkstack(L, 1); /* open space for 'Aux' struct */ - lua_getfield(L, LUA_REGISTRYINDEX, "_jmpbuf"); /* get 'Aux' struct */ - b = (struct Aux *)lua_touserdata(L, -1); - lua_pop(L, 1); /* remove 'Aux' struct */ - runC(b->L, L, b->paniccode); /* run optional panic code */ - longjmp(b->jb, 1); - return 1; /* to avoid warnings */ -} - -static int checkpanic (lua_State *L) { - struct Aux b; - void *ud; - lua_State *L1; - const char *code = luaL_checkstring(L, 1); - lua_Alloc f = lua_getallocf(L, &ud); - b.paniccode = luaL_optstring(L, 2, ""); - b.L = L; - L1 = lua_newstate(f, ud); /* create new state */ - if (L1 == NULL) { /* error? */ - lua_pushnil(L); - return 1; - } - lua_atpanic(L1, panicback); /* set its panic function */ - lua_pushlightuserdata(L1, &b); - lua_setfield(L1, LUA_REGISTRYINDEX, "_jmpbuf"); /* store 'Aux' struct */ - if (setjmp(b.jb) == 0) { /* set jump buffer */ - runC(L, L1, code); /* run code unprotected */ - lua_pushliteral(L, "no errors"); - } - else { /* error handling */ - /* move error message to original state */ - lua_pushstring(L, lua_tostring(L1, -1)); - } - lua_close(L1); - return 1; -} - - - -/* -** {==================================================================== -** function to test the API with C. It interprets a kind of assembler -** language with calls to the API, so the test can be driven by Lua code -** ===================================================================== -*/ - - -static void sethookaux (lua_State *L, int mask, int count, const char *code); - -static const char *const delimits = " \t\n,;"; - -static void skip (const char **pc) { - for (;;) { - if (**pc != '\0' && strchr(delimits, **pc)) (*pc)++; - else if (**pc == '#') { /* comment? */ - while (**pc != '\n' && **pc != '\0') (*pc)++; /* until end-of-line */ - } - else break; - } -} - -static int getnum_aux (lua_State *L, lua_State *L1, const char **pc) { - int res = 0; - int sig = 1; - skip(pc); - if (**pc == '.') { - res = cast_int(lua_tointeger(L1, -1)); - lua_pop(L1, 1); - (*pc)++; - return res; - } - else if (**pc == '*') { - res = lua_gettop(L1); - (*pc)++; - return res; - } - else if (**pc == '-') { - sig = -1; - (*pc)++; - } - if (!lisdigit(cast_uchar(**pc))) - luaL_error(L, "number expected (%s)", *pc); - while (lisdigit(cast_uchar(**pc))) res = res*10 + (*(*pc)++) - '0'; - return sig*res; -} - -static const char *getstring_aux (lua_State *L, char *buff, const char **pc) { - int i = 0; - skip(pc); - if (**pc == '"' || **pc == '\'') { /* quoted string? */ - int quote = *(*pc)++; - while (**pc != quote) { - if (**pc == '\0') luaL_error(L, "unfinished string in C script"); - buff[i++] = *(*pc)++; - } - (*pc)++; - } - else { - while (**pc != '\0' && !strchr(delimits, **pc)) - buff[i++] = *(*pc)++; - } - buff[i] = '\0'; - return buff; -} - - -static int getindex_aux (lua_State *L, lua_State *L1, const char **pc) { - skip(pc); - switch (*(*pc)++) { - case 'R': return LUA_REGISTRYINDEX; - case 'G': return luaL_error(L, "deprecated index 'G'"); - case 'U': return lua_upvalueindex(getnum_aux(L, L1, pc)); - default: (*pc)--; return getnum_aux(L, L1, pc); - } -} - - -static const char *const statcodes[] = {"OK", "YIELD", "ERRRUN", - "ERRSYNTAX", MEMERRMSG, "ERRGCMM", "ERRERR"}; - -/* -** Avoid these stat codes from being collected, to avoid possible -** memory error when pushing them. -*/ -static void regcodes (lua_State *L) { - unsigned int i; - for (i = 0; i < sizeof(statcodes) / sizeof(statcodes[0]); i++) { - lua_pushboolean(L, 1); - lua_setfield(L, LUA_REGISTRYINDEX, statcodes[i]); - } -} - - -#define EQ(s1) (strcmp(s1, inst) == 0) - -#define getnum (getnum_aux(L, L1, &pc)) -#define getstring (getstring_aux(L, buff, &pc)) -#define getindex (getindex_aux(L, L1, &pc)) - - -static int testC (lua_State *L); -static int Cfunck (lua_State *L, int status, lua_KContext ctx); - -/* -** arithmetic operation encoding for 'arith' instruction -** LUA_OPIDIV -> \ -** LUA_OPSHL -> < -** LUA_OPSHR -> > -** LUA_OPUNM -> _ -** LUA_OPBNOT -> ! -*/ -static const char ops[] = "+-*%^/\\&|~<>_!"; - -static int runC (lua_State *L, lua_State *L1, const char *pc) { - char buff[300]; - int status = 0; - if (pc == NULL) return luaL_error(L, "attempt to runC null script"); - for (;;) { - const char *inst = getstring; - if EQ("") return 0; - else if EQ("absindex") { - lua_pushnumber(L1, lua_absindex(L1, getindex)); - } - else if EQ("append") { - int t = getindex; - int i = lua_rawlen(L1, t); - lua_rawseti(L1, t, i + 1); - } - else if EQ("arith") { - int op; - skip(&pc); - op = strchr(ops, *pc++) - ops; - lua_arith(L1, op); - } - else if EQ("call") { - int narg = getnum; - int nres = getnum; - lua_call(L1, narg, nres); - } - else if EQ("callk") { - int narg = getnum; - int nres = getnum; - int i = getindex; - lua_callk(L1, narg, nres, i, Cfunck); - } - else if EQ("checkstack") { - int sz = getnum; - const char *msg = getstring; - if (*msg == '\0') - msg = NULL; /* to test 'luaL_checkstack' with no message */ - luaL_checkstack(L1, sz, msg); - } - else if EQ("rawcheckstack") { - int sz = getnum; - lua_pushboolean(L1, lua_checkstack(L1, sz)); - } - else if EQ("compare") { - const char *opt = getstring; /* EQ, LT, or LE */ - int op = (opt[0] == 'E') ? LUA_OPEQ - : (opt[1] == 'T') ? LUA_OPLT : LUA_OPLE; - int a = getindex; - int b = getindex; - lua_pushboolean(L1, lua_compare(L1, a, b, op)); - } - else if EQ("concat") { - lua_concat(L1, getnum); - } - else if EQ("copy") { - int f = getindex; - lua_copy(L1, f, getindex); - } - else if EQ("func2num") { - lua_CFunction func = lua_tocfunction(L1, getindex); - lua_pushnumber(L1, cast_sizet(func)); - } - else if EQ("getfield") { - int t = getindex; - lua_getfield(L1, t, getstring); - } - else if EQ("getglobal") { - lua_getglobal(L1, getstring); - } - else if EQ("getmetatable") { - if (lua_getmetatable(L1, getindex) == 0) - lua_pushnil(L1); - } - else if EQ("gettable") { - lua_gettable(L1, getindex); - } - else if EQ("gettop") { - lua_pushinteger(L1, lua_gettop(L1)); - } - else if EQ("gsub") { - int a = getnum; int b = getnum; int c = getnum; - luaL_gsub(L1, lua_tostring(L1, a), - lua_tostring(L1, b), - lua_tostring(L1, c)); - } - else if EQ("insert") { - lua_insert(L1, getnum); - } - else if EQ("iscfunction") { - lua_pushboolean(L1, lua_iscfunction(L1, getindex)); - } - else if EQ("isfunction") { - lua_pushboolean(L1, lua_isfunction(L1, getindex)); - } - else if EQ("isnil") { - lua_pushboolean(L1, lua_isnil(L1, getindex)); - } - else if EQ("isnull") { - lua_pushboolean(L1, lua_isnone(L1, getindex)); - } - else if EQ("isnumber") { - lua_pushboolean(L1, lua_isnumber(L1, getindex)); - } - else if EQ("isstring") { - lua_pushboolean(L1, lua_isstring(L1, getindex)); - } - else if EQ("istable") { - lua_pushboolean(L1, lua_istable(L1, getindex)); - } - else if EQ("isudataval") { - lua_pushboolean(L1, lua_islightuserdata(L1, getindex)); - } - else if EQ("isuserdata") { - lua_pushboolean(L1, lua_isuserdata(L1, getindex)); - } - else if EQ("len") { - lua_len(L1, getindex); - } - else if EQ("Llen") { - lua_pushinteger(L1, luaL_len(L1, getindex)); - } - else if EQ("loadfile") { - luaL_loadfile(L1, luaL_checkstring(L1, getnum)); - } - else if EQ("loadstring") { - const char *s = luaL_checkstring(L1, getnum); - luaL_loadstring(L1, s); - } - else if EQ("newmetatable") { - lua_pushboolean(L1, luaL_newmetatable(L1, getstring)); - } - else if EQ("newtable") { - lua_newtable(L1); - } - else if EQ("newthread") { - lua_newthread(L1); - } - else if EQ("resetthread") { - lua_pushinteger(L1, lua_resetthread(L1)); - } - else if EQ("newuserdata") { - lua_newuserdata(L1, getnum); - } - else if EQ("next") { - lua_next(L1, -2); - } - else if EQ("objsize") { - lua_pushinteger(L1, lua_rawlen(L1, getindex)); - } - else if EQ("pcall") { - int narg = getnum; - int nres = getnum; - status = lua_pcall(L1, narg, nres, getnum); - } - else if EQ("pcallk") { - int narg = getnum; - int nres = getnum; - int i = getindex; - status = lua_pcallk(L1, narg, nres, 0, i, Cfunck); - } - else if EQ("pop") { - lua_pop(L1, getnum); - } - else if EQ("printstack") { - int n = getnum; - if (n != 0) { - printf("%s\n", luaL_tolstring(L1, n, NULL)); - lua_pop(L1, 1); - } - else printstack(L1); - } - else if EQ("print") { - const char *msg = getstring; - printf("%s\n", msg); - } - else if EQ("warningC") { - const char *msg = getstring; - lua_warning(L1, msg, 1); - } - else if EQ("warning") { - const char *msg = getstring; - lua_warning(L1, msg, 0); - } - else if EQ("pushbool") { - lua_pushboolean(L1, getnum); - } - else if EQ("pushcclosure") { - lua_pushcclosure(L1, testC, getnum); - } - else if EQ("pushint") { - lua_pushinteger(L1, getnum); - } - else if EQ("pushnil") { - lua_pushnil(L1); - } - else if EQ("pushnum") { - lua_pushnumber(L1, (lua_Number)getnum); - } - else if EQ("pushstatus") { - lua_pushstring(L1, statcodes[status]); - } - else if EQ("pushstring") { - lua_pushstring(L1, getstring); - } - else if EQ("pushupvalueindex") { - lua_pushinteger(L1, lua_upvalueindex(getnum)); - } - else if EQ("pushvalue") { - lua_pushvalue(L1, getindex); - } - else if EQ("pushfstringI") { - lua_pushfstring(L1, lua_tostring(L, -2), (int)lua_tointeger(L, -1)); - } - else if EQ("pushfstringS") { - lua_pushfstring(L1, lua_tostring(L, -2), lua_tostring(L, -1)); - } - else if EQ("pushfstringP") { - lua_pushfstring(L1, lua_tostring(L, -2), lua_topointer(L, -1)); - } - else if EQ("rawget") { - int t = getindex; - lua_rawget(L1, t); - } - else if EQ("rawgeti") { - int t = getindex; - lua_rawgeti(L1, t, getnum); - } - else if EQ("rawgetp") { - int t = getindex; - lua_rawgetp(L1, t, cast_voidp(cast_sizet(getnum))); - } - else if EQ("rawset") { - int t = getindex; - lua_rawset(L1, t); - } - else if EQ("rawseti") { - int t = getindex; - lua_rawseti(L1, t, getnum); - } - else if EQ("rawsetp") { - int t = getindex; - lua_rawsetp(L1, t, cast_voidp(cast_sizet(getnum))); - } - else if EQ("remove") { - lua_remove(L1, getnum); - } - else if EQ("replace") { - lua_replace(L1, getindex); - } - else if EQ("resume") { - int i = getindex; - int nres; - status = lua_resume(lua_tothread(L1, i), L, getnum, &nres); - } - else if EQ("return") { - int n = getnum; - if (L1 != L) { - int i; - for (i = 0; i < n; i++) { - int idx = -(n - i); - switch (lua_type(L1, idx)) { - case LUA_TBOOLEAN: - lua_pushboolean(L, lua_toboolean(L1, idx)); - break; - default: - lua_pushstring(L, lua_tostring(L1, idx)); - break; - } - } - } - return n; - } - else if EQ("rotate") { - int i = getindex; - lua_rotate(L1, i, getnum); - } - else if EQ("setfield") { - int t = getindex; - const char *s = getstring; - lua_setfield(L1, t, s); - } - else if EQ("seti") { - int t = getindex; - lua_seti(L1, t, getnum); - } - else if EQ("setglobal") { - const char *s = getstring; - lua_setglobal(L1, s); - } - else if EQ("sethook") { - int mask = getnum; - int count = getnum; - const char *s = getstring; - sethookaux(L1, mask, count, s); - } - else if EQ("setmetatable") { - int idx = getindex; - lua_setmetatable(L1, idx); - } - else if EQ("settable") { - lua_settable(L1, getindex); - } - else if EQ("settop") { - lua_settop(L1, getnum); - } - else if EQ("testudata") { - int i = getindex; - lua_pushboolean(L1, luaL_testudata(L1, i, getstring) != NULL); - } - else if EQ("error") { - lua_error(L1); - } - else if EQ("abort") { - abort(); - } - else if EQ("throw") { -#if defined(__cplusplus) -static struct X { int x; } x; - throw x; -#else - luaL_error(L1, "C++"); -#endif - break; - } - else if EQ("tobool") { - lua_pushboolean(L1, lua_toboolean(L1, getindex)); - } - else if EQ("tocfunction") { - lua_pushcfunction(L1, lua_tocfunction(L1, getindex)); - } - else if EQ("tointeger") { - lua_pushinteger(L1, lua_tointeger(L1, getindex)); - } - else if EQ("tonumber") { - lua_pushnumber(L1, lua_tonumber(L1, getindex)); - } - else if EQ("topointer") { - lua_pushlightuserdata(L1, cast_voidp(lua_topointer(L1, getindex))); - } - else if EQ("touserdata") { - lua_pushlightuserdata(L1, lua_touserdata(L1, getindex)); - } - else if EQ("tostring") { - const char *s = lua_tostring(L1, getindex); - const char *s1 = lua_pushstring(L1, s); - (void)s1; /* to avoid warnings */ - lua_longassert((s == NULL && s1 == NULL) || strcmp(s, s1) == 0); - } - else if EQ("Ltolstring") { - luaL_tolstring(L1, getindex, NULL); - } - else if EQ("type") { - lua_pushstring(L1, luaL_typename(L1, getnum)); - } - else if EQ("xmove") { - int f = getindex; - int t = getindex; - lua_State *fs = (f == 0) ? L1 : lua_tothread(L1, f); - lua_State *ts = (t == 0) ? L1 : lua_tothread(L1, t); - int n = getnum; - if (n == 0) n = lua_gettop(fs); - lua_xmove(fs, ts, n); - } - else if EQ("isyieldable") { - lua_pushboolean(L1, lua_isyieldable(lua_tothread(L1, getindex))); - } - else if EQ("yield") { - return lua_yield(L1, getnum); - } - else if EQ("yieldk") { - int nres = getnum; - int i = getindex; - return lua_yieldk(L1, nres, i, Cfunck); - } - else if EQ("toclose") { - lua_toclose(L1, getnum); - } - else if EQ("closeslot") { - lua_closeslot(L1, getnum); - } - else luaL_error(L, "unknown instruction %s", buff); - } - return 0; -} - - -static int testC (lua_State *L) { - lua_State *L1; - const char *pc; - if (lua_isuserdata(L, 1)) { - L1 = getstate(L); - pc = luaL_checkstring(L, 2); - } - else if (lua_isthread(L, 1)) { - L1 = lua_tothread(L, 1); - pc = luaL_checkstring(L, 2); - } - else { - L1 = L; - pc = luaL_checkstring(L, 1); - } - return runC(L, L1, pc); -} - - -static int Cfunc (lua_State *L) { - return runC(L, L, lua_tostring(L, lua_upvalueindex(1))); -} - - -static int Cfunck (lua_State *L, int status, lua_KContext ctx) { - lua_pushstring(L, statcodes[status]); - lua_setglobal(L, "status"); - lua_pushinteger(L, ctx); - lua_setglobal(L, "ctx"); - return runC(L, L, lua_tostring(L, ctx)); -} - - -static int makeCfunc (lua_State *L) { - luaL_checkstring(L, 1); - lua_pushcclosure(L, Cfunc, lua_gettop(L)); - return 1; -} - - -/* }====================================================== */ - - -/* -** {====================================================== -** tests for C hooks -** ======================================================= -*/ - -/* -** C hook that runs the C script stored in registry.C_HOOK[L] -*/ -static void Chook (lua_State *L, lua_Debug *ar) { - const char *scpt; - const char *const events [] = {"call", "ret", "line", "count", "tailcall"}; - lua_getfield(L, LUA_REGISTRYINDEX, "C_HOOK"); - lua_pushlightuserdata(L, L); - lua_gettable(L, -2); /* get C_HOOK[L] (script saved by sethookaux) */ - scpt = lua_tostring(L, -1); /* not very religious (string will be popped) */ - lua_pop(L, 2); /* remove C_HOOK and script */ - lua_pushstring(L, events[ar->event]); /* may be used by script */ - lua_pushinteger(L, ar->currentline); /* may be used by script */ - runC(L, L, scpt); /* run script from C_HOOK[L] */ -} - - -/* -** sets 'registry.C_HOOK[L] = scpt' and sets 'Chook' as a hook -*/ -static void sethookaux (lua_State *L, int mask, int count, const char *scpt) { - if (*scpt == '\0') { /* no script? */ - lua_sethook(L, NULL, 0, 0); /* turn off hooks */ - return; - } - lua_getfield(L, LUA_REGISTRYINDEX, "C_HOOK"); /* get C_HOOK table */ - if (!lua_istable(L, -1)) { /* no hook table? */ - lua_pop(L, 1); /* remove previous value */ - lua_newtable(L); /* create new C_HOOK table */ - lua_pushvalue(L, -1); - lua_setfield(L, LUA_REGISTRYINDEX, "C_HOOK"); /* register it */ - } - lua_pushlightuserdata(L, L); - lua_pushstring(L, scpt); - lua_settable(L, -3); /* C_HOOK[L] = script */ - lua_sethook(L, Chook, mask, count); -} - - -static int sethook (lua_State *L) { - if (lua_isnoneornil(L, 1)) - lua_sethook(L, NULL, 0, 0); /* turn off hooks */ - else { - const char *scpt = luaL_checkstring(L, 1); - const char *smask = luaL_checkstring(L, 2); - int count = cast_int(luaL_optinteger(L, 3, 0)); - 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; - sethookaux(L, mask, count, scpt); - } - return 0; -} - - -static int coresume (lua_State *L) { - int status, nres; - lua_State *co = lua_tothread(L, 1); - luaL_argcheck(L, co, 1, "coroutine expected"); - status = lua_resume(co, L, 0, &nres); - if (status != LUA_OK && status != LUA_YIELD) { - lua_pushboolean(L, 0); - lua_insert(L, -2); - return 2; /* return false + error message */ - } - else { - lua_pushboolean(L, 1); - return 1; - } -} - -/* }====================================================== */ - - - -static const struct luaL_Reg tests_funcs[] = { - {"checkmemory", lua_checkmemory}, - {"closestate", closestate}, - {"d2s", d2s}, - {"doonnewstack", doonnewstack}, - {"doremote", doremote}, - {"gccolor", gc_color}, - {"gcage", gc_age}, - {"gcstate", gc_state}, - {"pobj", gc_printobj}, - {"getref", getref}, - {"hash", hash_query}, - {"log2", log2_aux}, - {"limits", get_limits}, - {"listcode", listcode}, - {"printcode", printcode}, - {"listk", listk}, - {"listabslineinfo", listabslineinfo}, - {"listlocals", listlocals}, - {"loadlib", loadlib}, - {"checkpanic", checkpanic}, - {"newstate", newstate}, - {"newuserdata", newuserdata}, - {"num2int", num2int}, - {"pushuserdata", pushuserdata}, - {"querystr", string_query}, - {"querytab", table_query}, - {"ref", tref}, - {"resume", coresume}, - {"s2d", s2d}, - {"sethook", sethook}, - {"stacklevel", stacklevel}, - {"testC", testC}, - {"makeCfunc", makeCfunc}, - {"totalmem", mem_query}, - {"alloccount", alloc_count}, - {"allocfailnext", alloc_failnext}, - {"trick", settrick}, - {"udataval", udataval}, - {"unref", unref}, - {"upvalue", upvalue}, - {NULL, NULL} -}; - - -static void checkfinalmem (void) { - lua_assert(l_memcontrol.numblocks == 0); - lua_assert(l_memcontrol.total == 0); -} - - -int luaB_opentests (lua_State *L) { - void *ud; - lua_Alloc f = lua_getallocf(L, &ud); - lua_atpanic(L, &tpanic); - lua_setwarnf(L, &warnf, L); - lua_pushboolean(L, 0); - lua_setglobal(L, "_WARN"); /* _WARN = false */ - regcodes(L); - atexit(checkfinalmem); - lua_assert(f == debug_realloc && ud == cast_voidp(&l_memcontrol)); - lua_setallocf(L, f, ud); /* exercise this function */ - luaL_newlib(L, tests_funcs); - return 1; -} - -#endif - diff --git a/lua-5.4.4-tests/ltests/ltests.h b/lua-5.4.4-tests/ltests/ltests.h deleted file mode 100644 index cb3a0b4..0000000 --- a/lua-5.4.4-tests/ltests/ltests.h +++ /dev/null @@ -1,144 +0,0 @@ -/* -** $Id: ltests.h $ -** Internal Header for Debugging of the Lua Implementation -** See Copyright Notice in lua.h -*/ - -#ifndef ltests_h -#define ltests_h - - -#include -#include - -/* test Lua with compatibility code */ -#define LUA_COMPAT_MATHLIB -#define LUA_COMPAT_LT_LE - - -#define LUA_DEBUG - - -/* turn on assertions */ -#define LUAI_ASSERT - - -/* to avoid warnings, and to make sure value is really unused */ -#define UNUSED(x) (x=0, (void)(x)) - - -/* test for sizes in 'l_sprintf' (make sure whole buffer is available) */ -#undef l_sprintf -#if !defined(LUA_USE_C89) -#define l_sprintf(s,sz,f,i) (memset(s,0xAB,sz), snprintf(s,sz,f,i)) -#else -#define l_sprintf(s,sz,f,i) (memset(s,0xAB,sz), sprintf(s,f,i)) -#endif - - -/* get a chance to test code without jump tables */ -#define LUA_USE_JUMPTABLE 0 - - -/* use 32-bit integers in random generator */ -#define LUA_RAND32 - - -/* memory-allocator control variables */ -typedef struct Memcontrol { - int failnext; - unsigned long numblocks; - unsigned long total; - unsigned long maxmem; - unsigned long memlimit; - unsigned long countlimit; - unsigned long objcount[LUA_NUMTYPES]; -} Memcontrol; - -LUA_API Memcontrol l_memcontrol; - - -/* -** generic variable for debug tricks -*/ -extern void *l_Trick; - - - -/* -** Function to traverse and check all memory used by Lua -*/ -LUAI_FUNC int lua_checkmemory (lua_State *L); - -/* -** Function to print an object GC-friendly -*/ -struct GCObject; -LUAI_FUNC void lua_printobj (lua_State *L, struct GCObject *o); - - -/* test for lock/unlock */ - -struct L_EXTRA { int lock; int *plock; }; -#undef LUA_EXTRASPACE -#define LUA_EXTRASPACE sizeof(struct L_EXTRA) -#define getlock(l) cast(struct L_EXTRA*, lua_getextraspace(l)) -#define luai_userstateopen(l) \ - (getlock(l)->lock = 0, getlock(l)->plock = &(getlock(l)->lock)) -#define luai_userstateclose(l) \ - lua_assert(getlock(l)->lock == 1 && getlock(l)->plock == &(getlock(l)->lock)) -#define luai_userstatethread(l,l1) \ - lua_assert(getlock(l1)->plock == getlock(l)->plock) -#define luai_userstatefree(l,l1) \ - lua_assert(getlock(l)->plock == getlock(l1)->plock) -#define lua_lock(l) lua_assert((*getlock(l)->plock)++ == 0) -#define lua_unlock(l) lua_assert(--(*getlock(l)->plock) == 0) - - - -LUA_API int luaB_opentests (lua_State *L); - -LUA_API void *debug_realloc (void *ud, void *block, - size_t osize, size_t nsize); - -#if defined(lua_c) -#define luaL_newstate() lua_newstate(debug_realloc, &l_memcontrol) -#define luaL_openlibs(L) \ - { (luaL_openlibs)(L); \ - luaL_requiref(L, "T", luaB_opentests, 1); \ - lua_pop(L, 1); } -#endif - - - -/* change some sizes to give some bugs a chance */ - -#undef LUAL_BUFFERSIZE -#define LUAL_BUFFERSIZE 23 -#define MINSTRTABSIZE 2 -#define MAXIWTHABS 3 - -#define STRCACHE_N 23 -#define STRCACHE_M 5 - -#undef LUAI_USER_ALIGNMENT_T -#define LUAI_USER_ALIGNMENT_T union { char b[sizeof(void*) * 8]; } - - -/* make stack-overflow tests run faster */ -#undef LUAI_MAXSTACK -#define LUAI_MAXSTACK 50000 - - -/* test mode uses more stack space */ -#undef LUAI_MAXCCALLS -#define LUAI_MAXCCALLS 180 - - -/* force Lua to use its own implementations */ -#undef lua_strx2number -#undef lua_number2strx - - -#endif - diff --git a/lua-5.4.4-tests/main.lua b/lua-5.4.4-tests/main.lua deleted file mode 100644 index 9def638..0000000 --- a/lua-5.4.4-tests/main.lua +++ /dev/null @@ -1,528 +0,0 @@ -# testing special comment on first line --- $Id: testes/main.lua $ --- See Copyright Notice in file all.lua - --- most (all?) tests here assume a reasonable "Unix-like" shell -if _port then return end - --- use only "double quotes" inside shell scripts (better change to --- run on Windows) - - -print ("testing stand-alone interpreter") - -assert(os.execute()) -- machine has a system command - -local arg = arg or ARG - -local prog = os.tmpname() -local otherprog = os.tmpname() -local out = os.tmpname() - -local progname -do - local i = 0 - while arg[i] do i=i-1 end - progname = arg[i+1] -end -print("progname: "..progname) - -local prepfile = function (s, p) - p = p or prog - io.output(p) - io.write(s) - assert(io.close()) -end - -local function getoutput () - io.input(out) - local t = io.read("a") - io.input():close() - assert(os.remove(out)) - return t -end - -local function checkprogout (s) - -- expected result must end with new line - assert(string.sub(s, -1) == "\n") - local t = getoutput() - for line in string.gmatch(s, ".-\n") do - assert(string.find(t, line, 1, true)) - end -end - -local function checkout (s) - local t = getoutput() - if s ~= t then print(string.format("'%s' - '%s'\n", s, t)) end - assert(s == t) - return t -end - - -local function RUN (p, ...) - p = string.gsub(p, "lua", '"'..progname..'"', 1) - local s = string.format(p, ...) - assert(os.execute(s)) -end - -local function NoRun (msg, p, ...) - p = string.gsub(p, "lua", '"'..progname..'"', 1) - local s = string.format(p, ...) - s = string.format("%s 2> %s", s, out) -- will send error to 'out' - assert(not os.execute(s)) - assert(string.find(getoutput(), msg, 1, true)) -- check error message -end - -RUN('lua -v') - -print(string.format("(temporary program file used in these tests: %s)", prog)) - --- running stdin as a file -prepfile"" -RUN('lua - < %s > %s', prog, out) -checkout("") - -prepfile[[ - print( -1, a -) -]] -RUN('lua - < %s > %s', prog, out) -checkout("1\tnil\n") - -RUN('echo "print(10)\nprint(2)\n" | lua > %s', out) -checkout("10\n2\n") - - --- test option '-' -RUN('echo "print(arg[1])" | lua - -h > %s', out) -checkout("-h\n") - --- test environment variables used by Lua - -prepfile("print(package.path)") - --- test LUA_PATH -RUN('env LUA_INIT= LUA_PATH=x lua %s > %s', prog, out) -checkout("x\n") - --- test LUA_PATH_version -RUN('env LUA_INIT= LUA_PATH_5_4=y LUA_PATH=x lua %s > %s', prog, out) -checkout("y\n") - --- test LUA_CPATH -prepfile("print(package.cpath)") -RUN('env LUA_INIT= LUA_CPATH=xuxu lua %s > %s', prog, out) -checkout("xuxu\n") - --- test LUA_CPATH_version -RUN('env LUA_INIT= LUA_CPATH_5_4=yacc LUA_CPATH=x lua %s > %s', prog, out) -checkout("yacc\n") - --- test LUA_INIT (and its access to 'arg' table) -prepfile("print(X)") -RUN('env LUA_INIT="X=tonumber(arg[1])" lua %s 3.2 > %s', prog, out) -checkout("3.2\n") - --- test LUA_INIT_version -prepfile("print(X)") -RUN('env LUA_INIT_5_4="X=10" LUA_INIT="X=3" lua %s > %s', prog, out) -checkout("10\n") - --- test LUA_INIT for files -prepfile("x = x or 10; print(x); x = x + 1") -RUN('env LUA_INIT="@%s" lua %s > %s', prog, prog, out) -checkout("10\n11\n") - --- test errors in LUA_INIT -NoRun('LUA_INIT:1: msg', 'env LUA_INIT="error(\'msg\')" lua') - --- test option '-E' -local defaultpath, defaultCpath - -do - prepfile("print(package.path, package.cpath)") - RUN('env LUA_INIT="error(10)" LUA_PATH=xxx LUA_CPATH=xxx lua -E %s > %s', - prog, out) - local output = getoutput() - defaultpath = string.match(output, "^(.-)\t") - defaultCpath = string.match(output, "\t(.-)$") - - -- running with an empty environment - RUN('env -i lua %s > %s', prog, out) - local out = getoutput() - assert(defaultpath == string.match(output, "^(.-)\t")) - assert(defaultCpath == string.match(output, "\t(.-)$")) -end - --- paths did not change -assert(not string.find(defaultpath, "xxx") and - string.find(defaultpath, "lua") and - not string.find(defaultCpath, "xxx") and - string.find(defaultCpath, "lua")) - - --- test replacement of ';;' to default path -local function convert (p) - prepfile("print(package.path)") - RUN('env LUA_PATH="%s" lua %s > %s', p, prog, out) - local expected = getoutput() - expected = string.sub(expected, 1, -2) -- cut final end of line - if string.find(p, ";;") then - p = string.gsub(p, ";;", ";"..defaultpath..";") - p = string.gsub(p, "^;", "") -- remove ';' at the beginning - p = string.gsub(p, ";$", "") -- remove ';' at the end - end - assert(p == expected) -end - -convert(";") -convert(";;") -convert("a;;b") -convert(";;b") -convert("a;;") -convert("a;b;;c") - - --- test -l over multiple libraries -prepfile("print(1); a=2; return {x=15}") -prepfile(("print(a); print(_G['%s'].x)"):format(prog), otherprog) -RUN('env LUA_PATH="?;;" lua -l %s -l%s -lstring -l io %s > %s', prog, otherprog, otherprog, out) -checkout("1\n2\n15\n2\n15\n") - --- test explicit global names in -l -prepfile("print(str.upper'alo alo', m.max(10, 20))") -RUN("lua -l 'str=string' '-lm=math' -e 'print(m.sin(0))' %s > %s", prog, out) -checkout("0.0\nALO ALO\t20\n") - --- test 'arg' table -local a = [[ - assert(#arg == 3 and arg[1] == 'a' and - arg[2] == 'b' and arg[3] == 'c') - assert(arg[-1] == '--' and arg[-2] == "-e " and arg[-3] == '%s') - assert(arg[4] == undef and arg[-4] == undef) - local a, b, c = ... - assert(... == 'a' and a == 'a' and b == 'b' and c == 'c') -]] -a = string.format(a, progname) -prepfile(a) -RUN('lua "-e " -- %s a b c', prog) -- "-e " runs an empty command - --- test 'arg' availability in libraries -prepfile"assert(arg)" -prepfile("assert(arg)", otherprog) -RUN('env LUA_PATH="?;;" lua -l%s - < %s', prog, otherprog) - --- test messing up the 'arg' table -RUN('echo "print(...)" | lua -e "arg[1] = 100" - > %s', out) -checkout("100\n") -NoRun("'arg' is not a table", 'echo "" | lua -e "arg = 1" -') - --- test error in 'print' -RUN('echo 10 | lua -e "print=nil" -i > /dev/null 2> %s', out) -assert(string.find(getoutput(), "error calling 'print'")) - --- test 'debug.debug' -RUN('echo "io.stderr:write(1000)\ncont" | lua -e "require\'debug\'.debug()" 2> %s', out) -checkout("lua_debug> 1000lua_debug> ") - - -print("testing warnings") - --- no warnings by default -RUN('echo "io.stderr:write(1); warn[[XXX]]" | lua 2> %s', out) -checkout("1") - -prepfile[[ -warn("@allow") -- unknown control, ignored -warn("@off", "XXX", "@off") -- these are not control messages -warn("@off") -- this one is -warn("@on", "YYY", "@on") -- not control, but warn is off -warn("@off") -- keep it off -warn("@on") -- restart warnings -warn("", "@on") -- again, no control, real warning -warn("@on") -- keep it "started" -warn("Z", "Z", "Z") -- common warning -]] -RUN('lua -W %s 2> %s', prog, out) -checkout[[ -Lua warning: @offXXX@off -Lua warning: @on -Lua warning: ZZZ -]] - -prepfile[[ -warn("@allow") --- create two objects to be finalized when closing state --- the errors in the finalizers must generate warnings -u1 = setmetatable({}, {__gc = function () error("XYZ") end}) -u2 = setmetatable({}, {__gc = function () error("ZYX") end}) -]] -RUN('lua -W %s 2> %s', prog, out) -checkprogout("ZYX)\nXYZ)\n") - --- bug since 5.2: finalizer called when closing a state could --- subvert finalization order -prepfile[[ --- should be called last -print("creating 1") -setmetatable({}, {__gc = function () print(1) end}) - -print("creating 2") -setmetatable({}, {__gc = function () - print("2") - print("creating 3") - -- this finalizer should not be called, as object will be - -- created after 'lua_close' has been called - setmetatable({}, {__gc = function () print(3) end}) - print(collectgarbage()) -- cannot call collector here - os.exit(0, true) -end}) -]] -RUN('lua -W %s > %s', prog, out) -checkout[[ -creating 1 -creating 2 -2 -creating 3 -nil -1 -]] - - --- test many arguments -prepfile[[print(({...})[30])]] -RUN('lua %s %s > %s', prog, string.rep(" a", 30), out) -checkout("a\n") - -RUN([[lua "-eprint(1)" -ea=3 -e "print(a)" > %s]], out) -checkout("1\n3\n") - --- test iteractive mode -prepfile[[ -(6*2-6) -- === -a = -10 -print(a) -a]] -RUN([[lua -e"_PROMPT='' _PROMPT2=''" -i < %s > %s]], prog, out) -checkprogout("6\n10\n10\n\n") - -prepfile("a = [[b\nc\nd\ne]]\n=a") -RUN([[lua -e"_PROMPT='' _PROMPT2=''" -i < %s > %s]], prog, out) -checkprogout("b\nc\nd\ne\n\n") - -prompt = "alo" -prepfile[[ -- -a = 2 -]] -RUN([[lua "-e_PROMPT='%s'" -i < %s > %s]], prompt, prog, out) -local t = getoutput() -assert(string.find(t, prompt .. ".*" .. prompt .. ".*" .. prompt)) - --- using the prompt default -prepfile[[ -- -a = 2 -]] -RUN([[lua -i < %s > %s]], prog, out) -local t = getoutput() -prompt = "> " -- the default -assert(string.find(t, prompt .. ".*" .. prompt .. ".*" .. prompt)) - - --- non-string prompt -prompt = - "local C = 0;\z - _PROMPT=setmetatable({},{__tostring = function () \z - C = C + 1; return C end})" -prepfile[[ -- -a = 2 -]] -RUN([[lua -e "%s" -i < %s > %s]], prompt, prog, out) -local t = getoutput() -assert(string.find(t, [[ -1 -- -2a = 2 -3 -]], 1, true)) - - --- test for error objects -prepfile[[ -debug = require "debug" -m = {x=0} -setmetatable(m, {__tostring = function(x) - return tostring(debug.getinfo(4).currentline + x.x) -end}) -error(m) -]] -NoRun(progname .. ": 6\n", [[lua %s]], prog) - -prepfile("error{}") -NoRun("error object is a table value", [[lua %s]], prog) - - --- chunk broken in many lines -s = [=[ -- -function f ( x ) - local a = [[ -xuxu -]] - local b = "\ -xuxu\n" - if x == 11 then return 1 + 12 , 2 + 20 end --[[ test multiple returns ]] - return x + 1 - --\\ -end -return( f( 100 ) ) -assert( a == b ) -do return f( 11 ) end ]=] -s = string.gsub(s, ' ', '\n\n') -- change all spaces for newlines -prepfile(s) -RUN([[lua -e"_PROMPT='' _PROMPT2=''" -i < %s > %s]], prog, out) -checkprogout("101\n13\t22\n\n") - -prepfile[[#comment in 1st line without \n at the end]] -RUN('lua %s', prog) - -prepfile[[#test line number when file starts with comment line -debug = require"debug" -print(debug.getinfo(1).currentline) -]] -RUN('lua %s > %s', prog, out) -checkprogout('3\n') - --- close Lua with an open file -prepfile(string.format([[io.output(%q); io.write('alo')]], out)) -RUN('lua %s', prog) -checkout('alo') - --- bug in 5.2 beta (extra \0 after version line) -RUN([[lua -v -e"print'hello'" > %s]], out) -t = getoutput() -assert(string.find(t, "PUC%-Rio\nhello")) - - --- testing os.exit -prepfile("os.exit(nil, true)") -RUN('lua %s', prog) -prepfile("os.exit(0, true)") -RUN('lua %s', prog) -prepfile("os.exit(true, true)") -RUN('lua %s', prog) -prepfile("os.exit(1, true)") -NoRun("", "lua %s", prog) -- no message -prepfile("os.exit(false, true)") -NoRun("", "lua %s", prog) -- no message - - --- to-be-closed variables in main chunk -prepfile[[ - local x = setmetatable({}, - {__close = function (self, err) - assert(err == nil) - print("Ok") - end}) - local e1 = setmetatable({}, {__close = function () print(120) end}) - os.exit(true, true) -]] -RUN('lua %s > %s', prog, out) -checkprogout("120\nOk\n") - - --- remove temporary files -assert(os.remove(prog)) -assert(os.remove(otherprog)) -assert(not os.remove(out)) - --- invalid options -NoRun("unrecognized option '-h'", "lua -h") -NoRun("unrecognized option '---'", "lua ---") -NoRun("unrecognized option '-Ex'", "lua -Ex") -NoRun("unrecognized option '-vv'", "lua -vv") -NoRun("unrecognized option '-iv'", "lua -iv") -NoRun("'-e' needs argument", "lua -e") -NoRun("syntax error", "lua -e a") -NoRun("'-l' needs argument", "lua -l") - - -if T then -- test library? - print("testing 'not enough memory' to create a state") - NoRun("not enough memory", "env MEMLIMIT=100 lua") - - -- testing 'warn' - warn("@store") - warn("@123", "456", "789") - assert(_WARN == "@123456789"); _WARN = false - - warn("zip", "", " ", "zap") - assert(_WARN == "zip zap"); _WARN = false - warn("ZIP", "", " ", "ZAP") - assert(_WARN == "ZIP ZAP"); _WARN = false - warn("@normal") -end - -do - -- 'warn' must get at least one argument - local st, msg = pcall(warn) - assert(string.find(msg, "string expected")) - - -- 'warn' does not leave unfinished warning in case of errors - -- (message would appear in next warning) - st, msg = pcall(warn, "SHOULD NOT APPEAR", {}) - assert(string.find(msg, "string expected")) -end - -print('+') - -print('testing Ctrl C') -do - -- interrupt a script - local function kill (pid) - return os.execute(string.format('kill -INT %s 2> /dev/null', pid)) - end - - -- function to run a script in background, returning its output file - -- descriptor and its pid - local function runback (luaprg) - -- shell script to run 'luaprg' in background and echo its pid - local shellprg = string.format('%s -e "%s" & echo $!', progname, luaprg) - local f = io.popen(shellprg, "r") -- run shell script - local pid = f:read() -- get pid for Lua script - print("(if test fails now, it may leave a Lua script running in \z - background, pid " .. pid .. ")") - return f, pid - end - - -- Lua script that runs protected infinite loop and then prints '42' - local f, pid = runback[[ - pcall(function () print(12); while true do end end); print(42)]] - -- wait until script is inside 'pcall' - assert(f:read() == "12") - kill(pid) -- send INT signal to Lua script - -- check that 'pcall' captured the exception and script continued running - assert(f:read() == "42") -- expected output - assert(f:close()) - print("done") - - -- Lua script in a long unbreakable search - local f, pid = runback[[ - print(15); string.find(string.rep('a', 100000), '.*b')]] - -- wait (so script can reach the loop) - assert(f:read() == "15") - assert(os.execute("sleep 1")) - -- must send at least two INT signals to stop this Lua script - local n = 100 - for i = 0, 100 do -- keep sending signals - if not kill(pid) then -- until it fails - n = i -- number of non-failed kills - break - end - end - assert(f:close()) - assert(n >= 2) - print(string.format("done (with %d kills)", n)) - -end - -print("OK") diff --git a/lua-5.4.4-tests/math.lua b/lua-5.4.4-tests/math.lua deleted file mode 100644 index 48c1efe..0000000 --- a/lua-5.4.4-tests/math.lua +++ /dev/null @@ -1,1024 +0,0 @@ --- $Id: testes/math.lua $ --- See Copyright Notice in file all.lua - -print("testing numbers and math lib") - -local minint = math.mininteger -local maxint = math.maxinteger - -local intbits = math.floor(math.log(maxint, 2) + 0.5) + 1 -assert((1 << intbits) == 0) - -assert(minint == 1 << (intbits - 1)) -assert(maxint == minint - 1) - --- number of bits in the mantissa of a floating-point number -local floatbits = 24 -do - local p = 2.0^floatbits - while p < p + 1.0 do - p = p * 2.0 - floatbits = floatbits + 1 - end -end - -local function isNaN (x) - return (x ~= x) -end - -assert(isNaN(0/0)) -assert(not isNaN(1/0)) - - -do - local x = 2.0^floatbits - assert(x > x - 1.0 and x == x + 1.0) - - print(string.format("%d-bit integers, %d-bit (mantissa) floats", - intbits, floatbits)) -end - -assert(math.type(0) == "integer" and math.type(0.0) == "float" - and not math.type("10")) - - -local function checkerror (msg, f, ...) - local s, err = pcall(f, ...) - assert(not s and string.find(err, msg)) -end - -local msgf2i = "number.* has no integer representation" - --- float equality -function eq (a,b,limit) - if not limit then - if floatbits >= 50 then limit = 1E-11 - else limit = 1E-5 - end - end - -- a == b needed for +inf/-inf - return a == b or math.abs(a-b) <= limit -end - - --- equality with types -function eqT (a,b) - return a == b and math.type(a) == math.type(b) -end - - --- basic float notation -assert(0e12 == 0 and .0 == 0 and 0. == 0 and .2e2 == 20 and 2.E-1 == 0.2) - -do - local a,b,c = "2", " 3e0 ", " 10 " - assert(a+b == 5 and -b == -3 and b+"2" == 5 and "10"-c == 0) - assert(type(a) == 'string' and type(b) == 'string' and type(c) == 'string') - assert(a == "2" and b == " 3e0 " and c == " 10 " and -c == -" 10 ") - assert(c%a == 0 and a^b == 08) - a = 0 - assert(a == -a and 0 == -0) -end - -do - local x = -1 - local mz = 0/x -- minus zero - t = {[0] = 10, 20, 30, 40, 50} - assert(t[mz] == t[0] and t[-0] == t[0]) -end - -do -- tests for 'modf' - local a,b = math.modf(3.5) - assert(a == 3.0 and b == 0.5) - a,b = math.modf(-2.5) - assert(a == -2.0 and b == -0.5) - a,b = math.modf(-3e23) - assert(a == -3e23 and b == 0.0) - a,b = math.modf(3e35) - assert(a == 3e35 and b == 0.0) - a,b = math.modf(-1/0) -- -inf - assert(a == -1/0 and b == 0.0) - a,b = math.modf(1/0) -- inf - assert(a == 1/0 and b == 0.0) - a,b = math.modf(0/0) -- NaN - assert(isNaN(a) and isNaN(b)) - a,b = math.modf(3) -- integer argument - assert(eqT(a, 3) and eqT(b, 0.0)) - a,b = math.modf(minint) - assert(eqT(a, minint) and eqT(b, 0.0)) -end - -assert(math.huge > 10e30) -assert(-math.huge < -10e30) - - --- integer arithmetic -assert(minint < minint + 1) -assert(maxint - 1 < maxint) -assert(0 - minint == minint) -assert(minint * minint == 0) -assert(maxint * maxint * maxint == maxint) - - --- testing floor division and conversions - -for _, i in pairs{-16, -15, -3, -2, -1, 0, 1, 2, 3, 15} do - for _, j in pairs{-16, -15, -3, -2, -1, 1, 2, 3, 15} do - for _, ti in pairs{0, 0.0} do -- try 'i' as integer and as float - for _, tj in pairs{0, 0.0} do -- try 'j' as integer and as float - local x = i + ti - local y = j + tj - assert(i//j == math.floor(i/j)) - end - end - end -end - -assert(1//0.0 == 1/0) -assert(-1 // 0.0 == -1/0) -assert(eqT(3.5 // 1.5, 2.0)) -assert(eqT(3.5 // -1.5, -3.0)) - -do -- tests for different kinds of opcodes - local x, y - x = 1; assert(x // 0.0 == 1/0) - x = 1.0; assert(x // 0 == 1/0) - x = 3.5; assert(eqT(x // 1, 3.0)) - assert(eqT(x // -1, -4.0)) - - x = 3.5; y = 1.5; assert(eqT(x // y, 2.0)) - x = 3.5; y = -1.5; assert(eqT(x // y, -3.0)) -end - -assert(maxint // maxint == 1) -assert(maxint // 1 == maxint) -assert((maxint - 1) // maxint == 0) -assert(maxint // (maxint - 1) == 1) -assert(minint // minint == 1) -assert(minint // minint == 1) -assert((minint + 1) // minint == 0) -assert(minint // (minint + 1) == 1) -assert(minint // 1 == minint) - -assert(minint // -1 == -minint) -assert(minint // -2 == 2^(intbits - 2)) -assert(maxint // -1 == -maxint) - - --- negative exponents -do - assert(2^-3 == 1 / 2^3) - assert(eq((-3)^-3, 1 / (-3)^3)) - for i = -3, 3 do -- variables avoid constant folding - for j = -3, 3 do - -- domain errors (0^(-n)) are not portable - if not _port or i ~= 0 or j > 0 then - assert(eq(i^j, 1 / i^(-j))) - end - end - end -end - --- comparison between floats and integers (border cases) -if floatbits < intbits then - assert(2.0^floatbits == (1 << floatbits)) - assert(2.0^floatbits - 1.0 == (1 << floatbits) - 1.0) - assert(2.0^floatbits - 1.0 ~= (1 << floatbits)) - -- float is rounded, int is not - assert(2.0^floatbits + 1.0 ~= (1 << floatbits) + 1) -else -- floats can express all integers with full accuracy - assert(maxint == maxint + 0.0) - assert(maxint - 1 == maxint - 1.0) - assert(minint + 1 == minint + 1.0) - assert(maxint ~= maxint - 1.0) -end -assert(maxint + 0.0 == 2.0^(intbits - 1) - 1.0) -assert(minint + 0.0 == minint) -assert(minint + 0.0 == -2.0^(intbits - 1)) - - --- order between floats and integers -assert(1 < 1.1); assert(not (1 < 0.9)) -assert(1 <= 1.1); assert(not (1 <= 0.9)) -assert(-1 < -0.9); assert(not (-1 < -1.1)) -assert(1 <= 1.1); assert(not (-1 <= -1.1)) -assert(-1 < -0.9); assert(not (-1 < -1.1)) -assert(-1 <= -0.9); assert(not (-1 <= -1.1)) -assert(minint <= minint + 0.0) -assert(minint + 0.0 <= minint) -assert(not (minint < minint + 0.0)) -assert(not (minint + 0.0 < minint)) -assert(maxint < minint * -1.0) -assert(maxint <= minint * -1.0) - -do - local fmaxi1 = 2^(intbits - 1) - assert(maxint < fmaxi1) - assert(maxint <= fmaxi1) - assert(not (fmaxi1 <= maxint)) - assert(minint <= -2^(intbits - 1)) - assert(-2^(intbits - 1) <= minint) -end - -if floatbits < intbits then - print("testing order (floats cannot represent all integers)") - local fmax = 2^floatbits - local ifmax = fmax | 0 - assert(fmax < ifmax + 1) - assert(fmax - 1 < ifmax) - assert(-(fmax - 1) > -ifmax) - assert(not (fmax <= ifmax - 1)) - assert(-fmax > -(ifmax + 1)) - assert(not (-fmax >= -(ifmax - 1))) - - assert(fmax/2 - 0.5 < ifmax//2) - assert(-(fmax/2 - 0.5) > -ifmax//2) - - assert(maxint < 2^intbits) - assert(minint > -2^intbits) - assert(maxint <= 2^intbits) - assert(minint >= -2^intbits) -else - print("testing order (floats can represent all integers)") - assert(maxint < maxint + 1.0) - assert(maxint < maxint + 0.5) - assert(maxint - 1.0 < maxint) - assert(maxint - 0.5 < maxint) - assert(not (maxint + 0.0 < maxint)) - assert(maxint + 0.0 <= maxint) - assert(not (maxint < maxint + 0.0)) - assert(maxint + 0.0 <= maxint) - assert(maxint <= maxint + 0.0) - assert(not (maxint + 1.0 <= maxint)) - assert(not (maxint + 0.5 <= maxint)) - assert(not (maxint <= maxint - 1.0)) - assert(not (maxint <= maxint - 0.5)) - - assert(minint < minint + 1.0) - assert(minint < minint + 0.5) - assert(minint <= minint + 0.5) - assert(minint - 1.0 < minint) - assert(minint - 1.0 <= minint) - assert(not (minint + 0.0 < minint)) - assert(not (minint + 0.5 < minint)) - assert(not (minint < minint + 0.0)) - assert(minint + 0.0 <= minint) - assert(minint <= minint + 0.0) - assert(not (minint + 1.0 <= minint)) - assert(not (minint + 0.5 <= minint)) - assert(not (minint <= minint - 1.0)) -end - -do - local NaN = 0/0 - assert(not (NaN < 0)) - assert(not (NaN > minint)) - assert(not (NaN <= -9)) - assert(not (NaN <= maxint)) - assert(not (NaN < maxint)) - assert(not (minint <= NaN)) - assert(not (minint < NaN)) - assert(not (4 <= NaN)) - assert(not (4 < NaN)) -end - - --- avoiding errors at compile time -local function checkcompt (msg, code) - checkerror(msg, assert(load(code))) -end -checkcompt("divide by zero", "return 2 // 0") -checkcompt(msgf2i, "return 2.3 >> 0") -checkcompt(msgf2i, ("return 2.0^%d & 1"):format(intbits - 1)) -checkcompt("field 'huge'", "return math.huge << 1") -checkcompt(msgf2i, ("return 1 | 2.0^%d"):format(intbits - 1)) -checkcompt(msgf2i, "return 2.3 ~ 0.0") - - --- testing overflow errors when converting from float to integer (runtime) -local function f2i (x) return x | x end -checkerror(msgf2i, f2i, math.huge) -- +inf -checkerror(msgf2i, f2i, -math.huge) -- -inf -checkerror(msgf2i, f2i, 0/0) -- NaN - -if floatbits < intbits then - -- conversion tests when float cannot represent all integers - assert(maxint + 1.0 == maxint + 0.0) - assert(minint - 1.0 == minint + 0.0) - checkerror(msgf2i, f2i, maxint + 0.0) - assert(f2i(2.0^(intbits - 2)) == 1 << (intbits - 2)) - assert(f2i(-2.0^(intbits - 2)) == -(1 << (intbits - 2))) - assert((2.0^(floatbits - 1) + 1.0) // 1 == (1 << (floatbits - 1)) + 1) - -- maximum integer representable as a float - local mf = maxint - (1 << (floatbits - intbits)) + 1 - assert(f2i(mf + 0.0) == mf) -- OK up to here - mf = mf + 1 - assert(f2i(mf + 0.0) ~= mf) -- no more representable -else - -- conversion tests when float can represent all integers - assert(maxint + 1.0 > maxint) - assert(minint - 1.0 < minint) - assert(f2i(maxint + 0.0) == maxint) - checkerror("no integer rep", f2i, maxint + 1.0) - checkerror("no integer rep", f2i, minint - 1.0) -end - --- 'minint' should be representable as a float no matter the precision -assert(f2i(minint + 0.0) == minint) - - --- testing numeric strings - -assert("2" + 1 == 3) -assert("2 " + 1 == 3) -assert(" -2 " + 1 == -1) -assert(" -0xa " + 1 == -9) - - --- Literal integer Overflows (new behavior in 5.3.3) -do - -- no overflows - assert(eqT(tonumber(tostring(maxint)), maxint)) - assert(eqT(tonumber(tostring(minint)), minint)) - - -- add 1 to last digit as a string (it cannot be 9...) - local function incd (n) - local s = string.format("%d", n) - s = string.gsub(s, "%d$", function (d) - assert(d ~= '9') - return string.char(string.byte(d) + 1) - end) - return s - end - - -- 'tonumber' with overflow by 1 - assert(eqT(tonumber(incd(maxint)), maxint + 1.0)) - assert(eqT(tonumber(incd(minint)), minint - 1.0)) - - -- large numbers - assert(eqT(tonumber("1"..string.rep("0", 30)), 1e30)) - assert(eqT(tonumber("-1"..string.rep("0", 30)), -1e30)) - - -- hexa format still wraps around - assert(eqT(tonumber("0x1"..string.rep("0", 30)), 0)) - - -- lexer in the limits - assert(minint == load("return " .. minint)()) - assert(eqT(maxint, load("return " .. maxint)())) - - assert(eqT(10000000000000000000000.0, 10000000000000000000000)) - assert(eqT(-10000000000000000000000.0, -10000000000000000000000)) -end - - --- testing 'tonumber' - --- 'tonumber' with numbers -assert(tonumber(3.4) == 3.4) -assert(eqT(tonumber(3), 3)) -assert(eqT(tonumber(maxint), maxint) and eqT(tonumber(minint), minint)) -assert(tonumber(1/0) == 1/0) - --- 'tonumber' with strings -assert(tonumber("0") == 0) -assert(not tonumber("")) -assert(not tonumber(" ")) -assert(not tonumber("-")) -assert(not tonumber(" -0x ")) -assert(not tonumber{}) -assert(tonumber'+0.01' == 1/100 and tonumber'+.01' == 0.01 and - tonumber'.01' == 0.01 and tonumber'-1.' == -1 and - tonumber'+1.' == 1) -assert(not tonumber'+ 0.01' and not tonumber'+.e1' and - not tonumber'1e' and not tonumber'1.0e+' and - not tonumber'.') -assert(tonumber('-012') == -010-2) -assert(tonumber('-1.2e2') == - - -120) - -assert(tonumber("0xffffffffffff") == (1 << (4*12)) - 1) -assert(tonumber("0x"..string.rep("f", (intbits//4))) == -1) -assert(tonumber("-0x"..string.rep("f", (intbits//4))) == 1) - --- testing 'tonumber' with base -assert(tonumber(' 001010 ', 2) == 10) -assert(tonumber(' 001010 ', 10) == 001010) -assert(tonumber(' -1010 ', 2) == -10) -assert(tonumber('10', 36) == 36) -assert(tonumber(' -10 ', 36) == -36) -assert(tonumber(' +1Z ', 36) == 36 + 35) -assert(tonumber(' -1z ', 36) == -36 + -35) -assert(tonumber('-fFfa', 16) == -(10+(16*(15+(16*(15+(16*15))))))) -assert(tonumber(string.rep('1', (intbits - 2)), 2) + 1 == 2^(intbits - 2)) -assert(tonumber('ffffFFFF', 16)+1 == (1 << 32)) -assert(tonumber('0ffffFFFF', 16)+1 == (1 << 32)) -assert(tonumber('-0ffffffFFFF', 16) - 1 == -(1 << 40)) -for i = 2,36 do - local i2 = i * i - local i10 = i2 * i2 * i2 * i2 * i2 -- i^10 - assert(tonumber('\t10000000000\t', i) == i10) -end - -if not _soft then - -- tests with very long numerals - assert(tonumber("0x"..string.rep("f", 13)..".0") == 2.0^(4*13) - 1) - assert(tonumber("0x"..string.rep("f", 150)..".0") == 2.0^(4*150) - 1) - assert(tonumber("0x"..string.rep("f", 300)..".0") == 2.0^(4*300) - 1) - assert(tonumber("0x"..string.rep("f", 500)..".0") == 2.0^(4*500) - 1) - assert(tonumber('0x3.' .. string.rep('0', 1000)) == 3) - assert(tonumber('0x' .. string.rep('0', 1000) .. 'a') == 10) - assert(tonumber('0x0.' .. string.rep('0', 13).."1") == 2.0^(-4*14)) - assert(tonumber('0x0.' .. string.rep('0', 150).."1") == 2.0^(-4*151)) - assert(tonumber('0x0.' .. string.rep('0', 300).."1") == 2.0^(-4*301)) - assert(tonumber('0x0.' .. string.rep('0', 500).."1") == 2.0^(-4*501)) - - assert(tonumber('0xe03' .. string.rep('0', 1000) .. 'p-4000') == 3587.0) - assert(tonumber('0x.' .. string.rep('0', 1000) .. '74p4004') == 0x7.4) -end - --- testing 'tonumber' for invalid formats - -local function f (...) - if select('#', ...) == 1 then - return (...) - else - return "***" - end -end - -assert(not f(tonumber('fFfa', 15))) -assert(not f(tonumber('099', 8))) -assert(not f(tonumber('1\0', 2))) -assert(not f(tonumber('', 8))) -assert(not f(tonumber(' ', 9))) -assert(not f(tonumber(' ', 9))) -assert(not f(tonumber('0xf', 10))) - -assert(not f(tonumber('inf'))) -assert(not f(tonumber(' INF '))) -assert(not f(tonumber('Nan'))) -assert(not f(tonumber('nan'))) - -assert(not f(tonumber(' '))) -assert(not f(tonumber(''))) -assert(not f(tonumber('1 a'))) -assert(not f(tonumber('1 a', 2))) -assert(not f(tonumber('1\0'))) -assert(not f(tonumber('1 \0'))) -assert(not f(tonumber('1\0 '))) -assert(not f(tonumber('e1'))) -assert(not f(tonumber('e 1'))) -assert(not f(tonumber(' 3.4.5 '))) - - --- testing 'tonumber' for invalid hexadecimal formats - -assert(not tonumber('0x')) -assert(not tonumber('x')) -assert(not tonumber('x3')) -assert(not tonumber('0x3.3.3')) -- two decimal points -assert(not tonumber('00x2')) -assert(not tonumber('0x 2')) -assert(not tonumber('0 x2')) -assert(not tonumber('23x')) -assert(not tonumber('- 0xaa')) -assert(not tonumber('-0xaaP ')) -- no exponent -assert(not tonumber('0x0.51p')) -assert(not tonumber('0x5p+-2')) - - --- testing hexadecimal numerals - -assert(0x10 == 16 and 0xfff == 2^12 - 1 and 0XFB == 251) -assert(0x0p12 == 0 and 0x.0p-3 == 0) -assert(0xFFFFFFFF == (1 << 32) - 1) -assert(tonumber('+0x2') == 2) -assert(tonumber('-0xaA') == -170) -assert(tonumber('-0xffFFFfff') == -(1 << 32) + 1) - --- possible confusion with decimal exponent -assert(0E+1 == 0 and 0xE+1 == 15 and 0xe-1 == 13) - - --- floating hexas - -assert(tonumber(' 0x2.5 ') == 0x25/16) -assert(tonumber(' -0x2.5 ') == -0x25/16) -assert(tonumber(' +0x0.51p+8 ') == 0x51) -assert(0x.FfffFFFF == 1 - '0x.00000001') -assert('0xA.a' + 0 == 10 + 10/16) -assert(0xa.aP4 == 0XAA) -assert(0x4P-2 == 1) -assert(0x1.1 == '0x1.' + '+0x.1') -assert(0Xabcdef.0 == 0x.ABCDEFp+24) - - -assert(1.1 == 1.+.1) -assert(100.0 == 1E2 and .01 == 1e-2) -assert(1111111111 - 1111111110 == 1000.00e-03) -assert(1.1 == '1.'+'.1') -assert(tonumber'1111111111' - tonumber'1111111110' == - tonumber" +0.001e+3 \n\t") - -assert(0.1e-30 > 0.9E-31 and 0.9E30 < 0.1e31) - -assert(0.123456 > 0.123455) - -assert(tonumber('+1.23E18') == 1.23*10.0^18) - --- testing order operators -assert(not(1<1) and (1<2) and not(2<1)) -assert(not('a'<'a') and ('a'<'b') and not('b'<'a')) -assert((1<=1) and (1<=2) and not(2<=1)) -assert(('a'<='a') and ('a'<='b') and not('b'<='a')) -assert(not(1>1) and not(1>2) and (2>1)) -assert(not('a'>'a') and not('a'>'b') and ('b'>'a')) -assert((1>=1) and not(1>=2) and (2>=1)) -assert(('a'>='a') and not('a'>='b') and ('b'>='a')) -assert(1.3 < 1.4 and 1.3 <= 1.4 and not (1.3 < 1.3) and 1.3 <= 1.3) - --- testing mod operator -assert(eqT(-4 % 3, 2)) -assert(eqT(4 % -3, -2)) -assert(eqT(-4.0 % 3, 2.0)) -assert(eqT(4 % -3.0, -2.0)) -assert(eqT(4 % -5, -1)) -assert(eqT(4 % -5.0, -1.0)) -assert(eqT(4 % 5, 4)) -assert(eqT(4 % 5.0, 4.0)) -assert(eqT(-4 % -5, -4)) -assert(eqT(-4 % -5.0, -4.0)) -assert(eqT(-4 % 5, 1)) -assert(eqT(-4 % 5.0, 1.0)) -assert(eqT(4.25 % 4, 0.25)) -assert(eqT(10.0 % 2, 0.0)) -assert(eqT(-10.0 % 2, 0.0)) -assert(eqT(-10.0 % -2, 0.0)) -assert(math.pi - math.pi % 1 == 3) -assert(math.pi - math.pi % 0.001 == 3.141) - -do -- very small numbers - local i, j = 0, 20000 - while i < j do - local m = (i + j) // 2 - if 10^-m > 0 then - i = m + 1 - else - j = m - end - end - -- 'i' is the smallest possible ten-exponent - local b = 10^-(i - (i // 10)) -- a very small number - assert(b > 0 and b * b == 0) - local delta = b / 1000 - assert(eq((2.1 * b) % (2 * b), (0.1 * b), delta)) - assert(eq((-2.1 * b) % (2 * b), (2 * b) - (0.1 * b), delta)) - assert(eq((2.1 * b) % (-2 * b), (0.1 * b) - (2 * b), delta)) - assert(eq((-2.1 * b) % (-2 * b), (-0.1 * b), delta)) -end - - --- basic consistency between integer modulo and float modulo -for i = -10, 10 do - for j = -10, 10 do - if j ~= 0 then - assert((i + 0.0) % j == i % j) - end - end -end - -for i = 0, 10 do - for j = -10, 10 do - if j ~= 0 then - assert((2^i) % j == (1 << i) % j) - end - end -end - -do -- precision of module for large numbers - local i = 10 - while (1 << i) > 0 do - assert((1 << i) % 3 == i % 2 + 1) - i = i + 1 - end - - i = 10 - while 2^i < math.huge do - assert(2^i % 3 == i % 2 + 1) - i = i + 1 - end -end - -assert(eqT(minint % minint, 0)) -assert(eqT(maxint % maxint, 0)) -assert((minint + 1) % minint == minint + 1) -assert((maxint - 1) % maxint == maxint - 1) -assert(minint % maxint == maxint - 1) - -assert(minint % -1 == 0) -assert(minint % -2 == 0) -assert(maxint % -2 == -1) - --- non-portable tests because Windows C library cannot compute --- fmod(1, huge) correctly -if not _port then - local function anan (x) assert(isNaN(x)) end -- assert Not a Number - anan(0.0 % 0) - anan(1.3 % 0) - anan(math.huge % 1) - anan(math.huge % 1e30) - anan(-math.huge % 1e30) - anan(-math.huge % -1e30) - assert(1 % math.huge == 1) - assert(1e30 % math.huge == 1e30) - assert(1e30 % -math.huge == -math.huge) - assert(-1 % math.huge == math.huge) - assert(-1 % -math.huge == -1) -end - - --- testing unsigned comparisons -assert(math.ult(3, 4)) -assert(not math.ult(4, 4)) -assert(math.ult(-2, -1)) -assert(math.ult(2, -1)) -assert(not math.ult(-2, -2)) -assert(math.ult(maxint, minint)) -assert(not math.ult(minint, maxint)) - - -assert(eq(math.sin(-9.8)^2 + math.cos(-9.8)^2, 1)) -assert(eq(math.tan(math.pi/4), 1)) -assert(eq(math.sin(math.pi/2), 1) and eq(math.cos(math.pi/2), 0)) -assert(eq(math.atan(1), math.pi/4) and eq(math.acos(0), math.pi/2) and - eq(math.asin(1), math.pi/2)) -assert(eq(math.deg(math.pi/2), 90) and eq(math.rad(90), math.pi/2)) -assert(math.abs(-10.43) == 10.43) -assert(eqT(math.abs(minint), minint)) -assert(eqT(math.abs(maxint), maxint)) -assert(eqT(math.abs(-maxint), maxint)) -assert(eq(math.atan(1,0), math.pi/2)) -assert(math.fmod(10,3) == 1) -assert(eq(math.sqrt(10)^2, 10)) -assert(eq(math.log(2, 10), math.log(2)/math.log(10))) -assert(eq(math.log(2, 2), 1)) -assert(eq(math.log(9, 3), 2)) -assert(eq(math.exp(0), 1)) -assert(eq(math.sin(10), math.sin(10%(2*math.pi)))) - - -assert(tonumber(' 1.3e-2 ') == 1.3e-2) -assert(tonumber(' -1.00000000000001 ') == -1.00000000000001) - --- testing constant limits --- 2^23 = 8388608 -assert(8388609 + -8388609 == 0) -assert(8388608 + -8388608 == 0) -assert(8388607 + -8388607 == 0) - - - -do -- testing floor & ceil - assert(eqT(math.floor(3.4), 3)) - assert(eqT(math.ceil(3.4), 4)) - assert(eqT(math.floor(-3.4), -4)) - assert(eqT(math.ceil(-3.4), -3)) - assert(eqT(math.floor(maxint), maxint)) - assert(eqT(math.ceil(maxint), maxint)) - assert(eqT(math.floor(minint), minint)) - assert(eqT(math.floor(minint + 0.0), minint)) - assert(eqT(math.ceil(minint), minint)) - assert(eqT(math.ceil(minint + 0.0), minint)) - assert(math.floor(1e50) == 1e50) - assert(math.ceil(1e50) == 1e50) - assert(math.floor(-1e50) == -1e50) - assert(math.ceil(-1e50) == -1e50) - for _, p in pairs{31,32,63,64} do - assert(math.floor(2^p) == 2^p) - assert(math.floor(2^p + 0.5) == 2^p) - assert(math.ceil(2^p) == 2^p) - assert(math.ceil(2^p - 0.5) == 2^p) - end - checkerror("number expected", math.floor, {}) - checkerror("number expected", math.ceil, print) - assert(eqT(math.tointeger(minint), minint)) - assert(eqT(math.tointeger(minint .. ""), minint)) - assert(eqT(math.tointeger(maxint), maxint)) - assert(eqT(math.tointeger(maxint .. ""), maxint)) - assert(eqT(math.tointeger(minint + 0.0), minint)) - assert(not math.tointeger(0.0 - minint)) - assert(not math.tointeger(math.pi)) - assert(not math.tointeger(-math.pi)) - assert(math.floor(math.huge) == math.huge) - assert(math.ceil(math.huge) == math.huge) - assert(not math.tointeger(math.huge)) - assert(math.floor(-math.huge) == -math.huge) - assert(math.ceil(-math.huge) == -math.huge) - assert(not math.tointeger(-math.huge)) - assert(math.tointeger("34.0") == 34) - assert(not math.tointeger("34.3")) - assert(not math.tointeger({})) - assert(not math.tointeger(0/0)) -- NaN -end - - --- testing fmod for integers -for i = -6, 6 do - for j = -6, 6 do - if j ~= 0 then - local mi = math.fmod(i, j) - local mf = math.fmod(i + 0.0, j) - assert(mi == mf) - assert(math.type(mi) == 'integer' and math.type(mf) == 'float') - if (i >= 0 and j >= 0) or (i <= 0 and j <= 0) or mi == 0 then - assert(eqT(mi, i % j)) - end - end - end -end -assert(eqT(math.fmod(minint, minint), 0)) -assert(eqT(math.fmod(maxint, maxint), 0)) -assert(eqT(math.fmod(minint + 1, minint), minint + 1)) -assert(eqT(math.fmod(maxint - 1, maxint), maxint - 1)) - -checkerror("zero", math.fmod, 3, 0) - - -do -- testing max/min - checkerror("value expected", math.max) - checkerror("value expected", math.min) - assert(eqT(math.max(3), 3)) - assert(eqT(math.max(3, 5, 9, 1), 9)) - assert(math.max(maxint, 10e60) == 10e60) - assert(eqT(math.max(minint, minint + 1), minint + 1)) - assert(eqT(math.min(3), 3)) - assert(eqT(math.min(3, 5, 9, 1), 1)) - assert(math.min(3.2, 5.9, -9.2, 1.1) == -9.2) - assert(math.min(1.9, 1.7, 1.72) == 1.7) - assert(math.min(-10e60, minint) == -10e60) - assert(eqT(math.min(maxint, maxint - 1), maxint - 1)) - assert(eqT(math.min(maxint - 2, maxint, maxint - 1), maxint - 2)) -end --- testing implicit conversions - -local a,b = '10', '20' -assert(a*b == 200 and a+b == 30 and a-b == -10 and a/b == 0.5 and -b == -20) -assert(a == '10' and b == '20') - - -do - print("testing -0 and NaN") - local mz = -0.0 - local z = 0.0 - assert(mz == z) - assert(1/mz < 0 and 0 < 1/z) - local a = {[mz] = 1} - assert(a[z] == 1 and a[mz] == 1) - a[z] = 2 - assert(a[z] == 2 and a[mz] == 2) - local inf = math.huge * 2 + 1 - local mz = -1/inf - local z = 1/inf - assert(mz == z) - assert(1/mz < 0 and 0 < 1/z) - local NaN = inf - inf - assert(NaN ~= NaN) - assert(not (NaN < NaN)) - assert(not (NaN <= NaN)) - assert(not (NaN > NaN)) - assert(not (NaN >= NaN)) - assert(not (0 < NaN) and not (NaN < 0)) - local NaN1 = 0/0 - assert(NaN ~= NaN1 and not (NaN <= NaN1) and not (NaN1 <= NaN)) - local a = {} - assert(not pcall(rawset, a, NaN, 1)) - assert(a[NaN] == undef) - a[1] = 1 - assert(not pcall(rawset, a, NaN, 1)) - assert(a[NaN] == undef) - -- strings with same binary representation as 0.0 (might create problems - -- for constant manipulation in the pre-compiler) - local a1, a2, a3, a4, a5 = 0, 0, "\0\0\0\0\0\0\0\0", 0, "\0\0\0\0\0\0\0\0" - assert(a1 == a2 and a2 == a4 and a1 ~= a3) - assert(a3 == a5) -end - - -print("testing 'math.random'") - -local random, max, min = math.random, math.max, math.min - -local function testnear (val, ref, tol) - return (math.abs(val - ref) < ref * tol) -end - - --- low-level!! For the current implementation of random in Lua, --- the first call after seed 1007 should return 0x7a7040a5a323c9d6 -do - -- all computations should work with 32-bit integers - local h = 0x7a7040a5 -- higher half - local l = 0xa323c9d6 -- lower half - - math.randomseed(1007) - -- get the low 'intbits' of the 64-bit expected result - local res = (h << 32 | l) & ~(~0 << intbits) - assert(random(0) == res) - - math.randomseed(1007, 0) - -- using higher bits to generate random floats; (the '% 2^32' converts - -- 32-bit integers to floats as unsigned) - local res - if floatbits <= 32 then - -- get all bits from the higher half - res = (h >> (32 - floatbits)) % 2^32 - else - -- get 32 bits from the higher half and the rest from the lower half - res = (h % 2^32) * 2^(floatbits - 32) + ((l >> (64 - floatbits)) % 2^32) - end - local rand = random() - assert(eq(rand, 0x0.7a7040a5a323c9d6, 2^-floatbits)) - assert(rand * 2^floatbits == res) -end - -do - -- testing return of 'randomseed' - local x, y = math.randomseed() - local res = math.random(0) - x, y = math.randomseed(x, y) -- should repeat the state - assert(math.random(0) == res) - math.randomseed(x, y) -- again should repeat the state - assert(math.random(0) == res) - -- keep the random seed for following tests - print(string.format("random seeds: %d, %d", x, y)) -end - -do -- test random for floats - local randbits = math.min(floatbits, 64) -- at most 64 random bits - local mult = 2^randbits -- to make random float into an integral - local counts = {} -- counts for bits - for i = 1, randbits do counts[i] = 0 end - local up = -math.huge - local low = math.huge - local rounds = 100 * randbits -- 100 times for each bit - local totalrounds = 0 - ::doagain:: -- will repeat test until we get good statistics - for i = 0, rounds do - local t = random() - assert(0 <= t and t < 1) - up = max(up, t) - low = min(low, t) - assert(t * mult % 1 == 0) -- no extra bits - local bit = i % randbits -- bit to be tested - if (t * 2^bit) % 1 >= 0.5 then -- is bit set? - counts[bit + 1] = counts[bit + 1] + 1 -- increment its count - end - end - totalrounds = totalrounds + rounds - if not (eq(up, 1, 0.001) and eq(low, 0, 0.001)) then - goto doagain - end - -- all bit counts should be near 50% - local expected = (totalrounds / randbits / 2) - for i = 1, randbits do - if not testnear(counts[i], expected, 0.10) then - goto doagain - end - end - print(string.format("float random range in %d calls: [%f, %f]", - totalrounds, low, up)) -end - - -do -- test random for full integers - local up = 0 - local low = 0 - local counts = {} -- counts for bits - for i = 1, intbits do counts[i] = 0 end - local rounds = 100 * intbits -- 100 times for each bit - local totalrounds = 0 - ::doagain:: -- will repeat test until we get good statistics - for i = 0, rounds do - local t = random(0) - up = max(up, t) - low = min(low, t) - local bit = i % intbits -- bit to be tested - -- increment its count if it is set - counts[bit + 1] = counts[bit + 1] + ((t >> bit) & 1) - end - totalrounds = totalrounds + rounds - local lim = maxint >> 10 - if not (maxint - up < lim and low - minint < lim) then - goto doagain - end - -- all bit counts should be near 50% - local expected = (totalrounds / intbits / 2) - for i = 1, intbits do - if not testnear(counts[i], expected, 0.10) then - goto doagain - end - end - print(string.format( - "integer random range in %d calls: [minint + %.0fppm, maxint - %.0fppm]", - totalrounds, (minint - low) / minint * 1e6, - (maxint - up) / maxint * 1e6)) -end - -do - -- test distribution for a dice - local count = {0, 0, 0, 0, 0, 0} - local rep = 200 - local totalrep = 0 - ::doagain:: - for i = 1, rep * 6 do - local r = random(6) - count[r] = count[r] + 1 - end - totalrep = totalrep + rep - for i = 1, 6 do - if not testnear(count[i], totalrep, 0.05) then - goto doagain - end - end -end - -do - local function aux (x1, x2) -- test random for small intervals - local mark = {}; local count = 0 -- to check that all values appeared - while true do - local t = random(x1, x2) - assert(x1 <= t and t <= x2) - if not mark[t] then -- new value - mark[t] = true - count = count + 1 - if count == x2 - x1 + 1 then -- all values appeared; OK - goto ok - end - end - end - ::ok:: - end - - aux(-10,0) - aux(1, 6) - aux(1, 2) - aux(1, 13) - aux(1, 31) - aux(1, 32) - aux(1, 33) - aux(-10, 10) - aux(-10,-10) -- unit set - aux(minint, minint) -- unit set - aux(maxint, maxint) -- unit set - aux(minint, minint + 9) - aux(maxint - 3, maxint) -end - -do - local function aux(p1, p2) -- test random for large intervals - local max = minint - local min = maxint - local n = 100 - local mark = {}; local count = 0 -- to count how many different values - ::doagain:: - for _ = 1, n do - local t = random(p1, p2) - if not mark[t] then -- new value - assert(p1 <= t and t <= p2) - max = math.max(max, t) - min = math.min(min, t) - mark[t] = true - count = count + 1 - end - end - -- at least 80% of values are different - if not (count >= n * 0.8) then - goto doagain - end - -- min and max not too far from formal min and max - local diff = (p2 - p1) >> 4 - if not (min < p1 + diff and max > p2 - diff) then - goto doagain - end - end - aux(0, maxint) - aux(1, maxint) - aux(3, maxint // 3) - aux(minint, -1) - aux(minint // 2, maxint // 2) - aux(minint, maxint) - aux(minint + 1, maxint) - aux(minint, maxint - 1) - aux(0, 1 << (intbits - 5)) -end - - -assert(not pcall(random, 1, 2, 3)) -- too many arguments - --- empty interval -assert(not pcall(random, minint + 1, minint)) -assert(not pcall(random, maxint, maxint - 1)) -assert(not pcall(random, maxint, minint)) - - - -print('OK') diff --git a/lua-5.4.4-tests/nextvar.lua b/lua-5.4.4-tests/nextvar.lua deleted file mode 100644 index 9e23e57..0000000 --- a/lua-5.4.4-tests/nextvar.lua +++ /dev/null @@ -1,805 +0,0 @@ --- $Id: testes/nextvar.lua $ --- See Copyright Notice in file all.lua - -print('testing tables, next, and for') - -local function checkerror (msg, f, ...) - local s, err = pcall(f, ...) - assert(not s and string.find(err, msg)) -end - - -local a = {} - --- make sure table has lots of space in hash part -for i=1,100 do a[i.."+"] = true end -for i=1,100 do a[i.."+"] = undef end --- fill hash part with numeric indices testing size operator -for i=1,100 do - a[i] = true - assert(#a == i) -end - --- testing ipairs -local x = 0 -for k,v in ipairs{10,20,30;x=12} do - x = x + 1 - assert(k == x and v == x * 10) -end - -for _ in ipairs{x=12, y=24} do assert(nil) end - --- test for 'false' x ipair -x = false -local i = 0 -for k,v in ipairs{true,false,true,false} do - i = i + 1 - x = not x - assert(x == v) -end -assert(i == 4) - --- iterator function is always the same -assert(type(ipairs{}) == 'function' and ipairs{} == ipairs{}) - - -do -- overflow (must wrap-around) - local f = ipairs{} - local k, v = f({[math.mininteger] = 10}, math.maxinteger) - assert(k == math.mininteger and v == 10) - k, v = f({[math.mininteger] = 10}, k) - assert(k == nil) -end - -if not T then - (Message or print) - ('\n >>> testC not active: skipping tests for table sizes <<<\n') -else --[ --- testing table sizes - - -local function mp2 (n) -- minimum power of 2 >= n - local mp = 2^math.ceil(math.log(n, 2)) - assert(n == 0 or (mp/2 < n and n <= mp)) - return mp -end - - -local function check (t, na, nh) - local a, h = T.querytab(t) - if a ~= na or h ~= nh then - print(na, nh, a, h) - assert(nil) - end -end - - --- testing C library sizes -do - local s = 0 - for _ in pairs(math) do s = s + 1 end - check(math, 0, mp2(s)) -end - - --- testing constructor sizes -local sizes = {0, 1, 2, 3, 4, 5, 7, 8, 9, 15, 16, 17, - 30, 31, 32, 33, 34, 254, 255, 256, 500, 1000} - -for _, sa in ipairs(sizes) do -- 'sa' is size of the array part - local arr = {"return {"} - for i = 1, sa do arr[1 + i] = "1," end -- build array part - for _, sh in ipairs(sizes) do -- 'sh' is size of the hash part - for j = 1, sh do -- build hash part - arr[1 + sa + j] = string.format('k%x=%d,', j, j) - end - arr[1 + sa + sh + 1] = "}" - local prog = table.concat(arr) - local f = assert(load(prog)) - collectgarbage("stop") - f() -- call once to ensure stack space - -- make sure table is not resized after being created - if sa == 0 or sh == 0 then - T.alloccount(2); -- header + array or hash part - else - T.alloccount(3); -- header + array part + hash part - end - local t = f() - T.alloccount(); - collectgarbage("restart") - assert(#t == sa) - check(t, sa, mp2(sh)) - end -end - - --- tests with unknown number of elements -local a = {} -for i=1,sizes[#sizes] do a[i] = i end -- build auxiliary table -for k in ipairs(sizes) do - local t = {table.unpack(a,1,k)} - assert(#t == k) - check(t, k, 0) - t = {1,2,3,table.unpack(a,1,k)} - check(t, k+3, 0) - assert(#t == k + 3) -end - - --- testing tables dynamically built -local lim = 130 -local a = {}; a[2] = 1; check(a, 0, 1) -a = {}; a[0] = 1; check(a, 0, 1); a[2] = 1; check(a, 0, 2) -a = {}; a[0] = 1; a[1] = 1; check(a, 1, 1) -a = {} -for i = 1,lim do - a[i] = 1 - assert(#a == i) - check(a, mp2(i), 0) -end - -a = {} -for i = 1,lim do - a['a'..i] = 1 - assert(#a == 0) - check(a, 0, mp2(i)) -end - -a = {} -for i=1,16 do a[i] = i end -check(a, 16, 0) -do - for i=1,11 do a[i] = undef end - for i=30,50 do a[i] = true; a[i] = undef end -- force a rehash (?) - check(a, 0, 8) -- 5 elements in the table - a[10] = 1 - for i=30,50 do a[i] = true; a[i] = undef end -- force a rehash (?) - check(a, 0, 8) -- only 6 elements in the table - for i=1,14 do a[i] = true; a[i] = undef end - for i=18,50 do a[i] = true; a[i] = undef end -- force a rehash (?) - check(a, 0, 4) -- only 2 elements ([15] and [16]) -end - --- reverse filling -for i=1,lim do - local a = {} - for i=i,1,-1 do a[i] = i end -- fill in reverse - check(a, mp2(i), 0) -end - --- size tests for vararg -lim = 35 -function foo (n, ...) - local arg = {...} - check(arg, n, 0) - assert(select('#', ...) == n) - arg[n+1] = true - check(arg, mp2(n+1), 0) - arg.x = true - check(arg, mp2(n+1), 1) -end -local a = {} -for i=1,lim do a[i] = true; foo(i, table.unpack(a)) end - - --- Table length with limit smaller than maximum value at array -local a = {} -for i = 1,64 do a[i] = true end -- make its array size 64 -for i = 1,64 do a[i] = nil end -- erase all elements -assert(T.querytab(a) == 64) -- array part has 64 elements -a[32] = true; a[48] = true; -- binary search will find these ones -a[51] = true -- binary search will miss this one -assert(#a == 48) -- this will set the limit -assert(select(4, T.querytab(a)) == 48) -- this is the limit now -a[50] = true -- this will set a new limit -assert(select(4, T.querytab(a)) == 50) -- this is the limit now --- but the size is larger (and still inside the array part) -assert(#a == 51) - -end --] - - --- test size operation on tables with nils -assert(#{} == 0) -assert(#{nil} == 0) -assert(#{nil, nil} == 0) -assert(#{nil, nil, nil} == 0) -assert(#{nil, nil, nil, nil} == 0) -assert(#{1, 2, 3, nil, nil} == 3) -print'+' - - -local nofind = {} - -a,b,c = 1,2,3 -a,b,c = nil - - --- next uses always the same iteraction function -assert(next{} == next{}) - -local function find (name) - local n,v - while 1 do - n,v = next(_G, n) - if not n then return nofind end - assert(_G[n] ~= undef) - if n == name then return v end - end -end - -local function find1 (name) - for n,v in pairs(_G) do - if n==name then return v end - end - return nil -- not found -end - - -assert(print==find("print") and print == find1("print")) -assert(_G["print"]==find("print")) -assert(assert==find1("assert")) -assert(nofind==find("return")) -assert(not find1("return")) -_G["ret" .. "urn"] = undef -assert(nofind==find("return")) -_G["xxx"] = 1 -assert(xxx==find("xxx")) - --- invalid key to 'next' -checkerror("invalid key", next, {10,20}, 3) - --- both 'pairs' and 'ipairs' need an argument -checkerror("bad argument", pairs) -checkerror("bad argument", ipairs) - -print('+') - -a = {} -for i=0,10000 do - if math.fmod(i,10) ~= 0 then - a['x'..i] = i - end -end - -n = {n=0} -for i,v in pairs(a) do - n.n = n.n+1 - assert(i and v and a[i] == v) -end -assert(n.n == 9000) -a = nil - -do -- clear global table - local a = {} - for n,v in pairs(_G) do a[n]=v end - for n,v in pairs(a) do - if not package.loaded[n] and type(v) ~= "function" and - not string.find(n, "^[%u_]") then - _G[n] = undef - end - collectgarbage() - end -end - - --- - -local function checknext (a) - local b = {} - do local k,v = next(a); while k do b[k] = v; k,v = next(a,k) end end - for k,v in pairs(b) do assert(a[k] == v) end - for k,v in pairs(a) do assert(b[k] == v) end -end - -checknext{1,x=1,y=2,z=3} -checknext{1,2,x=1,y=2,z=3} -checknext{1,2,3,x=1,y=2,z=3} -checknext{1,2,3,4,x=1,y=2,z=3} -checknext{1,2,3,4,5,x=1,y=2,z=3} - -assert(#{} == 0) -assert(#{[-1] = 2} == 0) -for i=0,40 do - local a = {} - for j=1,i do a[j]=j end - assert(#a == i) -end - --- 'maxn' is now deprecated, but it is easily defined in Lua -function table.maxn (t) - local max = 0 - for k in pairs(t) do - max = (type(k) == 'number') and math.max(max, k) or max - end - return max -end - -assert(table.maxn{} == 0) -assert(table.maxn{["1000"] = true} == 0) -assert(table.maxn{["1000"] = true, [24.5] = 3} == 24.5) -assert(table.maxn{[1000] = true} == 1000) -assert(table.maxn{[10] = true, [100*math.pi] = print} == 100*math.pi) - -table.maxn = nil - --- int overflow -a = {} -for i=0,50 do a[2^i] = true end -assert(a[#a]) - -print('+') - - -do -- testing 'next' with all kinds of keys - local a = { - [1] = 1, -- integer - [1.1] = 2, -- float - ['x'] = 3, -- short string - [string.rep('x', 1000)] = 4, -- long string - [print] = 5, -- C function - [checkerror] = 6, -- Lua function - [coroutine.running()] = 7, -- thread - [true] = 8, -- boolean - [io.stdin] = 9, -- userdata - [{}] = 10, -- table - } - local b = {}; for i = 1, 10 do b[i] = true end - for k, v in pairs(a) do - assert(b[v]); b[v] = undef - end - assert(next(b) == nil) -- 'b' now is empty -end - - --- erasing values -local t = {[{1}] = 1, [{2}] = 2, [string.rep("x ", 4)] = 3, - [100.3] = 4, [4] = 5} - -local n = 0 -for k, v in pairs( t ) do - n = n+1 - assert(t[k] == v) - t[k] = undef - collectgarbage() - assert(t[k] == undef) -end -assert(n == 5) - - -do - print("testing next x GC of deleted keys") - -- bug in 5.4.1 - local co = coroutine.wrap(function (t) - for k, v in pairs(t) do - local k1 = next(t) -- all previous keys were deleted - assert(k == k1) -- current key is the first in the table - t[k] = nil - local expected = (type(k) == "table" and k[1] or - type(k) == "function" and k() or - string.sub(k, 1, 1)) - assert(expected == v) - coroutine.yield(v) - end - end) - local t = {} - t[{1}] = 1 -- add several unanchored, collectable keys - t[{2}] = 2 - t[string.rep("a", 50)] = "a" -- long string - t[string.rep("b", 50)] = "b" - t[{3}] = 3 - t[string.rep("c", 10)] = "c" -- short string - t[function () return 10 end] = 10 - local count = 7 - while co(t) do - collectgarbage("collect") -- collect dead keys - count = count - 1 - end - assert(count == 0 and next(t) == nil) -- traversed the whole table -end - - -local function test (a) - assert(not pcall(table.insert, a, 2, 20)); - table.insert(a, 10); table.insert(a, 2, 20); - table.insert(a, 1, -1); table.insert(a, 40); - table.insert(a, #a+1, 50) - table.insert(a, 2, -2) - assert(a[2] ~= undef) - assert(a["2"] == undef) - assert(not pcall(table.insert, a, 0, 20)); - assert(not pcall(table.insert, a, #a + 2, 20)); - assert(table.remove(a,1) == -1) - assert(table.remove(a,1) == -2) - assert(table.remove(a,1) == 10) - assert(table.remove(a,1) == 20) - assert(table.remove(a,1) == 40) - assert(table.remove(a,1) == 50) - assert(table.remove(a,1) == nil) - assert(table.remove(a) == nil) - assert(table.remove(a, #a) == nil) -end - -a = {n=0, [-7] = "ban"} -test(a) -assert(a.n == 0 and a[-7] == "ban") - -a = {[-7] = "ban"}; -test(a) -assert(a.n == nil and #a == 0 and a[-7] == "ban") - -a = {[-1] = "ban"} -test(a) -assert(#a == 0 and table.remove(a) == nil and a[-1] == "ban") - -a = {[0] = "ban"} -assert(#a == 0 and table.remove(a) == "ban" and a[0] == undef) - -table.insert(a, 1, 10); table.insert(a, 1, 20); table.insert(a, 1, -1) -assert(table.remove(a) == 10) -assert(table.remove(a) == 20) -assert(table.remove(a) == -1) -assert(table.remove(a) == nil) - -a = {'c', 'd'} -table.insert(a, 3, 'a') -table.insert(a, 'b') -assert(table.remove(a, 1) == 'c') -assert(table.remove(a, 1) == 'd') -assert(table.remove(a, 1) == 'a') -assert(table.remove(a, 1) == 'b') -assert(table.remove(a, 1) == nil) -assert(#a == 0 and a.n == nil) - -a = {10,20,30,40} -assert(table.remove(a, #a + 1) == nil) -assert(not pcall(table.remove, a, 0)) -assert(a[#a] == 40) -assert(table.remove(a, #a) == 40) -assert(a[#a] == 30) -assert(table.remove(a, 2) == 20) -assert(a[#a] == 30 and #a == 2) - -do -- testing table library with metamethods - local function test (proxy, t) - for i = 1, 10 do - table.insert(proxy, 1, i) - end - assert(#proxy == 10 and #t == 10 and proxy[1] ~= undef) - for i = 1, 10 do - assert(t[i] == 11 - i) - end - table.sort(proxy) - for i = 1, 10 do - assert(t[i] == i and proxy[i] == i) - end - assert(table.concat(proxy, ",") == "1,2,3,4,5,6,7,8,9,10") - for i = 1, 8 do - assert(table.remove(proxy, 1) == i) - end - assert(#proxy == 2 and #t == 2) - local a, b, c = table.unpack(proxy) - assert(a == 9 and b == 10 and c == nil) - end - - -- all virtual - local t = {} - local proxy = setmetatable({}, { - __len = function () return #t end, - __index = t, - __newindex = t, - }) - test(proxy, t) - - -- only __newindex - local count = 0 - t = setmetatable({}, { - __newindex = function (t,k,v) count = count + 1; rawset(t,k,v) end}) - test(t, t) - assert(count == 10) -- after first 10, all other sets are not new - - -- no __newindex - t = setmetatable({}, { - __index = function (_,k) return k + 1 end, - __len = function (_) return 5 end}) - assert(table.concat(t, ";") == "2;3;4;5;6") - -end - - -do -- testing overflow in table.insert (must wrap-around) - - local t = setmetatable({}, - {__len = function () return math.maxinteger end}) - table.insert(t, 20) - local k, v = next(t) - assert(k == math.mininteger and v == 20) -end - -if not T then - (Message or print) - ('\n >>> testC not active: skipping tests for table library on non-tables <<<\n') -else --[ - local debug = require'debug' - local tab = {10, 20, 30} - local mt = {} - local u = T.newuserdata(0) - checkerror("table expected", table.insert, u, 40) - checkerror("table expected", table.remove, u) - debug.setmetatable(u, mt) - checkerror("table expected", table.insert, u, 40) - checkerror("table expected", table.remove, u) - mt.__index = tab - checkerror("table expected", table.insert, u, 40) - checkerror("table expected", table.remove, u) - mt.__newindex = tab - checkerror("table expected", table.insert, u, 40) - checkerror("table expected", table.remove, u) - mt.__len = function () return #tab end - table.insert(u, 40) - assert(#u == 4 and #tab == 4 and u[4] == 40 and tab[4] == 40) - assert(table.remove(u) == 40) - table.insert(u, 1, 50) - assert(#u == 4 and #tab == 4 and u[4] == 30 and tab[1] == 50) - - mt.__newindex = nil - mt.__len = nil - local tab2 = {} - local u2 = T.newuserdata(0) - debug.setmetatable(u2, {__newindex = function (_, k, v) tab2[k] = v end}) - table.move(u, 1, 4, 1, u2) - assert(#tab2 == 4 and tab2[1] == tab[1] and tab2[4] == tab[4]) - -end -- ] - -print('+') - -a = {} -for i=1,1000 do - a[i] = i; a[i - 1] = undef -end -assert(next(a,nil) == 1000 and next(a,1000) == nil) - -assert(next({}) == nil) -assert(next({}, nil) == nil) - -for a,b in pairs{} do error"not here" end -for i=1,0 do error'not here' end -for i=0,1,-1 do error'not here' end -a = nil; for i=1,1 do assert(not a); a=1 end; assert(a) -a = nil; for i=1,1,-1 do assert(not a); a=1 end; assert(a) - -do - print("testing floats in numeric for") - local a - -- integer count - a = 0; for i=1, 1, 1 do a=a+1 end; assert(a==1) - a = 0; for i=10000, 1e4, -1 do a=a+1 end; assert(a==1) - a = 0; for i=1, 0.99999, 1 do a=a+1 end; assert(a==0) - a = 0; for i=9999, 1e4, -1 do a=a+1 end; assert(a==0) - a = 0; for i=1, 0.99999, -1 do a=a+1 end; assert(a==1) - - -- float count - a = 0; for i=0, 0.999999999, 0.1 do a=a+1 end; assert(a==10) - a = 0; for i=1.0, 1, 1 do a=a+1 end; assert(a==1) - a = 0; for i=-1.5, -1.5, 1 do a=a+1 end; assert(a==1) - a = 0; for i=1e6, 1e6, -1 do a=a+1 end; assert(a==1) - a = 0; for i=1.0, 0.99999, 1 do a=a+1 end; assert(a==0) - a = 0; for i=99999, 1e5, -1.0 do a=a+1 end; assert(a==0) - a = 0; for i=1.0, 0.99999, -1 do a=a+1 end; assert(a==1) -end - -do -- changing the control variable - local a - a = 0; for i = 1, 10 do a = a + 1; i = "x" end; assert(a == 10) - a = 0; for i = 10.0, 1, -1 do a = a + 1; i = "x" end; assert(a == 10) -end - --- conversion -a = 0; for i="10","1","-2" do a=a+1 end; assert(a==5) - -do -- checking types - local c - local function checkfloat (i) - assert(math.type(i) == "float") - c = c + 1 - end - - c = 0; for i = 1.0, 10 do checkfloat(i) end - assert(c == 10) - - c = 0; for i = -1, -10, -1.0 do checkfloat(i) end - assert(c == 10) - - local function checkint (i) - assert(math.type(i) == "integer") - c = c + 1 - end - - local m = math.maxinteger - c = 0; for i = m, m - 10, -1 do checkint(i) end - assert(c == 11) - - c = 0; for i = 1, 10.9 do checkint(i) end - assert(c == 10) - - c = 0; for i = 10, 0.001, -1 do checkint(i) end - assert(c == 10) - - c = 0; for i = 1, "10.8" do checkint(i) end - assert(c == 10) - - c = 0; for i = 9, "3.4", -1 do checkint(i) end - assert(c == 6) - - c = 0; for i = 0, " -3.4 ", -1 do checkint(i) end - assert(c == 4) - - c = 0; for i = 100, "96.3", -2 do checkint(i) end - assert(c == 2) - - c = 0; for i = 1, math.huge do if i > 10 then break end; checkint(i) end - assert(c == 10) - - c = 0; for i = -1, -math.huge, -1 do - if i < -10 then break end; checkint(i) - end - assert(c == 10) - - - for i = math.mininteger, -10e100 do assert(false) end - for i = math.maxinteger, 10e100, -1 do assert(false) end - -end - - -do -- testing other strange cases for numeric 'for' - - local function checkfor (from, to, step, t) - local c = 0 - for i = from, to, step do - c = c + 1 - assert(i == t[c]) - end - assert(c == #t) - end - - local maxi = math.maxinteger - local mini = math.mininteger - - checkfor(mini, maxi, maxi, {mini, -1, maxi - 1}) - - checkfor(mini, math.huge, maxi, {mini, -1, maxi - 1}) - - checkfor(maxi, mini, mini, {maxi, -1}) - - checkfor(maxi, mini, -maxi, {maxi, 0, -maxi}) - - checkfor(maxi, -math.huge, mini, {maxi, -1}) - - checkfor(maxi, mini, 1, {}) - checkfor(mini, maxi, -1, {}) - - checkfor(maxi - 6, maxi, 3, {maxi - 6, maxi - 3, maxi}) - checkfor(mini + 4, mini, -2, {mini + 4, mini + 2, mini}) - - local step = maxi // 10 - local c = mini - for i = mini, maxi, step do - assert(i == c) - c = c + step - end - - c = maxi - for i = maxi, mini, -step do - assert(i == c) - c = c - step - end - - checkfor(maxi, maxi, maxi, {maxi}) - checkfor(maxi, maxi, mini, {maxi}) - checkfor(mini, mini, maxi, {mini}) - checkfor(mini, mini, mini, {mini}) -end - - -checkerror("'for' step is zero", function () - for i = 1, 10, 0 do end -end) - -checkerror("'for' step is zero", function () - for i = 1, -10, 0 do end -end) - -checkerror("'for' step is zero", function () - for i = 1.0, -10, 0.0 do end -end) - -collectgarbage() - - --- testing generic 'for' - -local function f (n, p) - local t = {}; for i=1,p do t[i] = i*10 end - return function (_, n, ...) - assert(select("#", ...) == 0) -- no extra arguments - if n > 0 then - n = n-1 - return n, table.unpack(t) - end - end, nil, n -end - -local x = 0 -for n,a,b,c,d in f(5,3) do - x = x+1 - assert(a == 10 and b == 20 and c == 30 and d == nil) -end -assert(x == 5) - - - --- testing __pairs and __ipairs metamethod -a = {} -do - local x,y,z = pairs(a) - assert(type(x) == 'function' and y == a and z == nil) -end - -local function foo (e,i) - assert(e == a) - if i <= 10 then return i+1, i+2 end -end - -local function foo1 (e,i) - i = i + 1 - assert(e == a) - if i <= e.n then return i,a[i] end -end - -setmetatable(a, {__pairs = function (x) return foo, x, 0 end}) - -local i = 0 -for k,v in pairs(a) do - i = i + 1 - assert(k == i and v == k+1) -end - -a.n = 5 -a[3] = 30 - --- testing ipairs with metamethods -a = {n=10} -setmetatable(a, { __index = function (t,k) - if k <= t.n then return k * 10 end - end}) -i = 0 -for k,v in ipairs(a) do - i = i + 1 - assert(k == i and v == i * 10) -end -assert(i == a.n) - - --- testing yield inside __pairs -do - local t = setmetatable({10, 20, 30}, {__pairs = function (t) - local inc = coroutine.yield() - return function (t, i) - if i > 1 then return i - inc, t[i - inc] else return nil end - end, t, #t + 1 - end}) - - local res = {} - local co = coroutine.wrap(function () - for i,p in pairs(t) do res[#res + 1] = p end - end) - - co() -- start coroutine - co(1) -- continue after yield - assert(res[1] == 30 and res[2] == 20 and res[3] == 10 and #res == 3) - -end - -print"OK" diff --git a/lua-5.4.4-tests/pm.lua b/lua-5.4.4-tests/pm.lua deleted file mode 100644 index 94bb63c..0000000 --- a/lua-5.4.4-tests/pm.lua +++ /dev/null @@ -1,421 +0,0 @@ --- $Id: testes/pm.lua $ --- See Copyright Notice in file all.lua - -print('testing pattern matching') - -local function checkerror (msg, f, ...) - local s, err = pcall(f, ...) - assert(not s and string.find(err, msg)) -end - - -function f(s, p) - local i,e = string.find(s, p) - if i then return string.sub(s, i, e) end -end - -a,b = string.find('', '') -- empty patterns are tricky -assert(a == 1 and b == 0); -a,b = string.find('alo', '') -assert(a == 1 and b == 0) -a,b = string.find('a\0o a\0o a\0o', 'a', 1) -- first position -assert(a == 1 and b == 1) -a,b = string.find('a\0o a\0o a\0o', 'a\0o', 2) -- starts in the midle -assert(a == 5 and b == 7) -a,b = string.find('a\0o a\0o a\0o', 'a\0o', 9) -- starts in the midle -assert(a == 9 and b == 11) -a,b = string.find('a\0a\0a\0a\0\0ab', '\0ab', 2); -- finds at the end -assert(a == 9 and b == 11); -a,b = string.find('a\0a\0a\0a\0\0ab', 'b') -- last position -assert(a == 11 and b == 11) -assert(not string.find('a\0a\0a\0a\0\0ab', 'b\0')) -- check ending -assert(not string.find('', '\0')) -assert(string.find('alo123alo', '12') == 4) -assert(not string.find('alo123alo', '^12')) - -assert(string.match("aaab", ".*b") == "aaab") -assert(string.match("aaa", ".*a") == "aaa") -assert(string.match("b", ".*b") == "b") - -assert(string.match("aaab", ".+b") == "aaab") -assert(string.match("aaa", ".+a") == "aaa") -assert(not string.match("b", ".+b")) - -assert(string.match("aaab", ".?b") == "ab") -assert(string.match("aaa", ".?a") == "aa") -assert(string.match("b", ".?b") == "b") - -assert(f('aloALO', '%l*') == 'alo') -assert(f('aLo_ALO', '%a*') == 'aLo') - -assert(f(" \n\r*&\n\r xuxu \n\n", "%g%g%g+") == "xuxu") - -assert(f('aaab', 'a*') == 'aaa'); -assert(f('aaa', '^.*$') == 'aaa'); -assert(f('aaa', 'b*') == ''); -assert(f('aaa', 'ab*a') == 'aa') -assert(f('aba', 'ab*a') == 'aba') -assert(f('aaab', 'a+') == 'aaa') -assert(f('aaa', '^.+$') == 'aaa') -assert(not f('aaa', 'b+')) -assert(not f('aaa', 'ab+a')) -assert(f('aba', 'ab+a') == 'aba') -assert(f('a$a', '.$') == 'a') -assert(f('a$a', '.%$') == 'a$') -assert(f('a$a', '.$.') == 'a$a') -assert(not f('a$a', '$$')) -assert(not f('a$b', 'a$')) -assert(f('a$a', '$') == '') -assert(f('', 'b*') == '') -assert(not f('aaa', 'bb*')) -assert(f('aaab', 'a-') == '') -assert(f('aaa', '^.-$') == 'aaa') -assert(f('aabaaabaaabaaaba', 'b.*b') == 'baaabaaabaaab') -assert(f('aabaaabaaabaaaba', 'b.-b') == 'baaab') -assert(f('alo xo', '.o$') == 'xo') -assert(f(' \n isto é assim', '%S%S*') == 'isto') -assert(f(' \n isto é assim', '%S*$') == 'assim') -assert(f(' \n isto é assim', '[a-z]*$') == 'assim') -assert(f('um caracter ? extra', '[^%sa-z]') == '?') -assert(f('', 'a?') == '') -assert(f('á', 'á?') == 'á') -assert(f('ábl', 'á?b?l?') == 'ábl') -assert(f(' ábl', 'á?b?l?') == '') -assert(f('aa', '^aa?a?a') == 'aa') -assert(f(']]]áb', '[^]]') == 'á') -assert(f("0alo alo", "%x*") == "0a") -assert(f("alo alo", "%C+") == "alo alo") -print('+') - - -function f1(s, p) - p = string.gsub(p, "%%([0-9])", function (s) - return "%" .. (tonumber(s)+1) - end) - p = string.gsub(p, "^(^?)", "%1()", 1) - p = string.gsub(p, "($?)$", "()%1", 1) - local t = {string.match(s, p)} - return string.sub(s, t[1], t[#t] - 1) -end - -assert(f1('alo alx 123 b\0o b\0o', '(..*) %1') == "b\0o b\0o") -assert(f1('axz123= 4= 4 34', '(.+)=(.*)=%2 %1') == '3= 4= 4 3') -assert(f1('=======', '^(=*)=%1$') == '=======') -assert(not string.match('==========', '^([=]*)=%1$')) - -local function range (i, j) - if i <= j then - return i, range(i+1, j) - end -end - -local abc = string.char(range(0, 127)) .. string.char(range(128, 255)); - -assert(string.len(abc) == 256) - -function strset (p) - local res = {s=''} - string.gsub(abc, p, function (c) res.s = res.s .. c end) - return res.s -end; - -assert(string.len(strset('[\200-\210]')) == 11) - -assert(strset('[a-z]') == "abcdefghijklmnopqrstuvwxyz") -assert(strset('[a-z%d]') == strset('[%da-uu-z]')) -assert(strset('[a-]') == "-a") -assert(strset('[^%W]') == strset('[%w]')) -assert(strset('[]%%]') == '%]') -assert(strset('[a%-z]') == '-az') -assert(strset('[%^%[%-a%]%-b]') == '-[]^ab') -assert(strset('%Z') == strset('[\1-\255]')) -assert(strset('.') == strset('[\1-\255%z]')) -print('+'); - -assert(string.match("alo xyzK", "(%w+)K") == "xyz") -assert(string.match("254 K", "(%d*)K") == "") -assert(string.match("alo ", "(%w*)$") == "") -assert(not string.match("alo ", "(%w+)$")) -assert(string.find("(álo)", "%(á") == 1) -local a, b, c, d, e = string.match("âlo alo", "^(((.).).* (%w*))$") -assert(a == 'âlo alo' and b == 'âl' and c == 'â' and d == 'alo' and e == nil) -a, b, c, d = string.match('0123456789', '(.+(.?)())') -assert(a == '0123456789' and b == '' and c == 11 and d == nil) -print('+') - -assert(string.gsub('ülo ülo', 'ü', 'x') == 'xlo xlo') -assert(string.gsub('alo úlo ', ' +$', '') == 'alo úlo') -- trim -assert(string.gsub(' alo alo ', '^%s*(.-)%s*$', '%1') == 'alo alo') -- double trim -assert(string.gsub('alo alo \n 123\n ', '%s+', ' ') == 'alo alo 123 ') -t = "abç d" -a, b = string.gsub(t, '(.)', '%1@') -assert('@'..a == string.gsub(t, '', '@') and b == 5) -a, b = string.gsub('abçd', '(.)', '%0@', 2) -assert(a == 'a@b@çd' and b == 2) -assert(string.gsub('alo alo', '()[al]', '%1') == '12o 56o') -assert(string.gsub("abc=xyz", "(%w*)(%p)(%w+)", "%3%2%1-%0") == - "xyz=abc-abc=xyz") -assert(string.gsub("abc", "%w", "%1%0") == "aabbcc") -assert(string.gsub("abc", "%w+", "%0%1") == "abcabc") -assert(string.gsub('áéí', '$', '\0óú') == 'áéí\0óú') -assert(string.gsub('', '^', 'r') == 'r') -assert(string.gsub('', '$', 'r') == 'r') -print('+') - - -do -- new (5.3.3) semantics for empty matches - assert(string.gsub("a b cd", " *", "-") == "-a-b-c-d-") - - local res = "" - local sub = "a \nbc\t\td" - local i = 1 - for p, e in string.gmatch(sub, "()%s*()") do - res = res .. string.sub(sub, i, p - 1) .. "-" - i = e - end - assert(res == "-a-b-c-d-") -end - - -assert(string.gsub("um (dois) tres (quatro)", "(%(%w+%))", string.upper) == - "um (DOIS) tres (QUATRO)") - -do - local function setglobal (n,v) rawset(_G, n, v) end - string.gsub("a=roberto,roberto=a", "(%w+)=(%w%w*)", setglobal) - assert(_G.a=="roberto" and _G.roberto=="a") -end - -function f(a,b) return string.gsub(a,'.',b) end -assert(string.gsub("trocar tudo em |teste|b| é |beleza|al|", "|([^|]*)|([^|]*)|", f) == - "trocar tudo em bbbbb é alalalalalal") - -local function dostring (s) return load(s, "")() or "" end -assert(string.gsub("alo $a='x'$ novamente $return a$", - "$([^$]*)%$", - dostring) == "alo novamente x") - -x = string.gsub("$x=string.gsub('alo', '.', string.upper)$ assim vai para $return x$", - "$([^$]*)%$", dostring) -assert(x == ' assim vai para ALO') - -t = {} -s = 'a alo jose joao' -r = string.gsub(s, '()(%w+)()', function (a,w,b) - assert(string.len(w) == b-a); - t[a] = b-a; - end) -assert(s == r and t[1] == 1 and t[3] == 3 and t[7] == 4 and t[13] == 4) - - -function isbalanced (s) - return not string.find(string.gsub(s, "%b()", ""), "[()]") -end - -assert(isbalanced("(9 ((8))(\0) 7) \0\0 a b ()(c)() a")) -assert(not isbalanced("(9 ((8) 7) a b (\0 c) a")) -assert(string.gsub("alo 'oi' alo", "%b''", '"') == 'alo " alo') - - -local t = {"apple", "orange", "lime"; n=0} -assert(string.gsub("x and x and x", "x", function () t.n=t.n+1; return t[t.n] end) - == "apple and orange and lime") - -t = {n=0} -string.gsub("first second word", "%w%w*", function (w) t.n=t.n+1; t[t.n] = w end) -assert(t[1] == "first" and t[2] == "second" and t[3] == "word" and t.n == 3) - -t = {n=0} -assert(string.gsub("first second word", "%w+", - function (w) t.n=t.n+1; t[t.n] = w end, 2) == "first second word") -assert(t[1] == "first" and t[2] == "second" and t[3] == undef) - -checkerror("invalid replacement value %(a table%)", - string.gsub, "alo", ".", {a = {}}) -checkerror("invalid capture index %%2", string.gsub, "alo", ".", "%2") -checkerror("invalid capture index %%0", string.gsub, "alo", "(%0)", "a") -checkerror("invalid capture index %%1", string.gsub, "alo", "(%1)", "a") -checkerror("invalid use of '%%'", string.gsub, "alo", ".", "%x") - - -if not _soft then - print("big strings") - local a = string.rep('a', 300000) - assert(string.find(a, '^a*.?$')) - assert(not string.find(a, '^a*.?b$')) - assert(string.find(a, '^a-.?$')) - - -- bug in 5.1.2 - a = string.rep('a', 10000) .. string.rep('b', 10000) - assert(not pcall(string.gsub, a, 'b')) -end - --- recursive nest of gsubs -function rev (s) - return string.gsub(s, "(.)(.+)", function (c,s1) return rev(s1)..c end) -end - -local x = "abcdef" -assert(rev(rev(x)) == x) - - --- gsub with tables -assert(string.gsub("alo alo", ".", {}) == "alo alo") -assert(string.gsub("alo alo", "(.)", {a="AA", l=""}) == "AAo AAo") -assert(string.gsub("alo alo", "(.).", {a="AA", l="K"}) == "AAo AAo") -assert(string.gsub("alo alo", "((.)(.?))", {al="AA", o=false}) == "AAo AAo") - -assert(string.gsub("alo alo", "().", {'x','yy','zzz'}) == "xyyzzz alo") - -t = {}; setmetatable(t, {__index = function (t,s) return string.upper(s) end}) -assert(string.gsub("a alo b hi", "%w%w+", t) == "a ALO b HI") - - --- tests for gmatch -local a = 0 -for i in string.gmatch('abcde', '()') do assert(i == a+1); a=i end -assert(a==6) - -t = {n=0} -for w in string.gmatch("first second word", "%w+") do - t.n=t.n+1; t[t.n] = w -end -assert(t[1] == "first" and t[2] == "second" and t[3] == "word") - -t = {3, 6, 9} -for i in string.gmatch ("xuxx uu ppar r", "()(.)%2") do - assert(i == table.remove(t, 1)) -end -assert(#t == 0) - -t = {} -for i,j in string.gmatch("13 14 10 = 11, 15= 16, 22=23", "(%d+)%s*=%s*(%d+)") do - t[tonumber(i)] = tonumber(j) -end -a = 0 -for k,v in pairs(t) do assert(k+1 == v+0); a=a+1 end -assert(a == 3) - - -do -- init parameter in gmatch - local s = 0 - for k in string.gmatch("10 20 30", "%d+", 3) do - s = s + tonumber(k) - end - assert(s == 50) - - s = 0 - for k in string.gmatch("11 21 31", "%d+", -4) do - s = s + tonumber(k) - end - assert(s == 32) - - -- there is an empty string at the end of the subject - s = 0 - for k in string.gmatch("11 21 31", "%w*", 9) do - s = s + 1 - end - assert(s == 1) - - -- there are no empty strings after the end of the subject - s = 0 - for k in string.gmatch("11 21 31", "%w*", 10) do - s = s + 1 - end - assert(s == 0) -end - - --- tests for `%f' (`frontiers') - -assert(string.gsub("aaa aa a aaa a", "%f[%w]a", "x") == "xaa xa x xaa x") -assert(string.gsub("[[]] [][] [[[[", "%f[[].", "x") == "x[]] x]x] x[[[") -assert(string.gsub("01abc45de3", "%f[%d]", ".") == ".01abc.45de.3") -assert(string.gsub("01abc45 de3x", "%f[%D]%w", ".") == "01.bc45 de3.") -assert(string.gsub("function", "%f[\1-\255]%w", ".") == ".unction") -assert(string.gsub("function", "%f[^\1-\255]", ".") == "function.") - -assert(string.find("a", "%f[a]") == 1) -assert(string.find("a", "%f[^%z]") == 1) -assert(string.find("a", "%f[^%l]") == 2) -assert(string.find("aba", "%f[a%z]") == 3) -assert(string.find("aba", "%f[%z]") == 4) -assert(not string.find("aba", "%f[%l%z]")) -assert(not string.find("aba", "%f[^%l%z]")) - -local i, e = string.find(" alo aalo allo", "%f[%S].-%f[%s].-%f[%S]") -assert(i == 2 and e == 5) -local k = string.match(" alo aalo allo", "%f[%S](.-%f[%s].-%f[%S])") -assert(k == 'alo ') - -local a = {1, 5, 9, 14, 17,} -for k in string.gmatch("alo alo th02 is 1hat", "()%f[%w%d]") do - assert(table.remove(a, 1) == k) -end -assert(#a == 0) - - --- malformed patterns -local function malform (p, m) - m = m or "malformed" - local r, msg = pcall(string.find, "a", p) - assert(not r and string.find(msg, m)) -end - -malform("(.", "unfinished capture") -malform(".)", "invalid pattern capture") -malform("[a") -malform("[]") -malform("[^]") -malform("[a%]") -malform("[a%") -malform("%b") -malform("%ba") -malform("%") -malform("%f", "missing") - --- \0 in patterns -assert(string.match("ab\0\1\2c", "[\0-\2]+") == "\0\1\2") -assert(string.match("ab\0\1\2c", "[\0-\0]+") == "\0") -assert(string.find("b$a", "$\0?") == 2) -assert(string.find("abc\0efg", "%\0") == 4) -assert(string.match("abc\0efg\0\1e\1g", "%b\0\1") == "\0efg\0\1e\1") -assert(string.match("abc\0\0\0", "%\0+") == "\0\0\0") -assert(string.match("abc\0\0\0", "%\0%\0?") == "\0\0") - --- magic char after \0 -assert(string.find("abc\0\0","\0.") == 4) -assert(string.find("abcx\0\0abc\0abc","x\0\0abc\0a.") == 4) - - -do -- test reuse of original string in gsub - local s = string.rep("a", 100) - local r = string.gsub(s, "b", "c") -- no match - assert(string.format("%p", s) == string.format("%p", r)) - - r = string.gsub(s, ".", {x = "y"}) -- no substitutions - assert(string.format("%p", s) == string.format("%p", r)) - - local count = 0 - r = string.gsub(s, ".", function (x) - assert(x == "a") - count = count + 1 - return nil -- no substitution - end) - r = string.gsub(r, ".", {b = 'x'}) -- "a" is not a key; no subst. - assert(count == 100) - assert(string.format("%p", s) == string.format("%p", r)) - - count = 0 - r = string.gsub(s, ".", function (x) - assert(x == "a") - count = count + 1 - return x -- substitution... - end) - assert(count == 100) - -- no reuse in this case - assert(r == s and string.format("%p", s) ~= string.format("%p", r)) -end - -print('OK') - diff --git a/lua-5.4.4-tests/sort.lua b/lua-5.4.4-tests/sort.lua deleted file mode 100644 index ef405d9..0000000 --- a/lua-5.4.4-tests/sort.lua +++ /dev/null @@ -1,310 +0,0 @@ --- $Id: testes/sort.lua $ --- See Copyright Notice in file all.lua - -print "testing (parts of) table library" - -print "testing unpack" - -local unpack = table.unpack - -local maxI = math.maxinteger -local minI = math.mininteger - - -local function checkerror (msg, f, ...) - local s, err = pcall(f, ...) - assert(not s and string.find(err, msg)) -end - - -checkerror("wrong number of arguments", table.insert, {}, 2, 3, 4) - -local x,y,z,a,n -a = {}; lim = _soft and 200 or 2000 -for i=1, lim do a[i]=i end -assert(select(lim, unpack(a)) == lim and select('#', unpack(a)) == lim) -x = unpack(a) -assert(x == 1) -x = {unpack(a)} -assert(#x == lim and x[1] == 1 and x[lim] == lim) -x = {unpack(a, lim-2)} -assert(#x == 3 and x[1] == lim-2 and x[3] == lim) -x = {unpack(a, 10, 6)} -assert(next(x) == nil) -- no elements -x = {unpack(a, 11, 10)} -assert(next(x) == nil) -- no elements -x,y = unpack(a, 10, 10) -assert(x == 10 and y == nil) -x,y,z = unpack(a, 10, 11) -assert(x == 10 and y == 11 and z == nil) -a,x = unpack{1} -assert(a==1 and x==nil) -a,x = unpack({1,2}, 1, 1) -assert(a==1 and x==nil) - -do - local maxi = (1 << 31) - 1 -- maximum value for an int (usually) - local mini = -(1 << 31) -- minimum value for an int (usually) - checkerror("too many results", unpack, {}, 0, maxi) - checkerror("too many results", unpack, {}, 1, maxi) - checkerror("too many results", unpack, {}, 0, maxI) - checkerror("too many results", unpack, {}, 1, maxI) - checkerror("too many results", unpack, {}, mini, maxi) - checkerror("too many results", unpack, {}, -maxi, maxi) - checkerror("too many results", unpack, {}, minI, maxI) - unpack({}, maxi, 0) - unpack({}, maxi, 1) - unpack({}, maxI, minI) - pcall(unpack, {}, 1, maxi + 1) - local a, b = unpack({[maxi] = 20}, maxi, maxi) - assert(a == 20 and b == nil) - a, b = unpack({[maxi] = 20}, maxi - 1, maxi) - assert(a == nil and b == 20) - local t = {[maxI - 1] = 12, [maxI] = 23} - a, b = unpack(t, maxI - 1, maxI); assert(a == 12 and b == 23) - a, b = unpack(t, maxI, maxI); assert(a == 23 and b == nil) - a, b = unpack(t, maxI, maxI - 1); assert(a == nil and b == nil) - t = {[minI] = 12.3, [minI + 1] = 23.5} - a, b = unpack(t, minI, minI + 1); assert(a == 12.3 and b == 23.5) - a, b = unpack(t, minI, minI); assert(a == 12.3 and b == nil) - a, b = unpack(t, minI + 1, minI); assert(a == nil and b == nil) -end - -do -- length is not an integer - local t = setmetatable({}, {__len = function () return 'abc' end}) - assert(#t == 'abc') - checkerror("object length is not an integer", table.insert, t, 1) -end - -print "testing pack" - -a = table.pack() -assert(a[1] == undef and a.n == 0) - -a = table.pack(table) -assert(a[1] == table and a.n == 1) - -a = table.pack(nil, nil, nil, nil) -assert(a[1] == nil and a.n == 4) - - --- testing move -do - - checkerror("table expected", table.move, 1, 2, 3, 4) - - local function eqT (a, b) - for k, v in pairs(a) do assert(b[k] == v) end - for k, v in pairs(b) do assert(a[k] == v) end - end - - local a = table.move({10,20,30}, 1, 3, 2) -- move forward - eqT(a, {10,10,20,30}) - - -- move forward with overlap of 1 - a = table.move({10, 20, 30}, 1, 3, 3) - eqT(a, {10, 20, 10, 20, 30}) - - -- moving to the same table (not being explicit about it) - a = {10, 20, 30, 40} - table.move(a, 1, 4, 2, a) - eqT(a, {10, 10, 20, 30, 40}) - - a = table.move({10,20,30}, 2, 3, 1) -- move backward - eqT(a, {20,30,30}) - - a = {} -- move to new table - assert(table.move({10,20,30}, 1, 3, 1, a) == a) - eqT(a, {10,20,30}) - - a = {} - assert(table.move({10,20,30}, 1, 0, 3, a) == a) -- empty move (no move) - eqT(a, {}) - - a = table.move({10,20,30}, 1, 10, 1) -- move to the same place - eqT(a, {10,20,30}) - - -- moving on the fringes - a = table.move({[maxI - 2] = 1, [maxI - 1] = 2, [maxI] = 3}, - maxI - 2, maxI, -10, {}) - eqT(a, {[-10] = 1, [-9] = 2, [-8] = 3}) - - a = table.move({[minI] = 1, [minI + 1] = 2, [minI + 2] = 3}, - minI, minI + 2, -10, {}) - eqT(a, {[-10] = 1, [-9] = 2, [-8] = 3}) - - a = table.move({45}, 1, 1, maxI) - eqT(a, {45, [maxI] = 45}) - - a = table.move({[maxI] = 100}, maxI, maxI, minI) - eqT(a, {[minI] = 100, [maxI] = 100}) - - a = table.move({[minI] = 100}, minI, minI, maxI) - eqT(a, {[minI] = 100, [maxI] = 100}) - - a = setmetatable({}, { - __index = function (_,k) return k * 10 end, - __newindex = error}) - local b = table.move(a, 1, 10, 3, {}) - eqT(a, {}) - eqT(b, {nil,nil,10,20,30,40,50,60,70,80,90,100}) - - b = setmetatable({""}, { - __index = error, - __newindex = function (t,k,v) - t[1] = string.format("%s(%d,%d)", t[1], k, v) - end}) - table.move(a, 10, 13, 3, b) - assert(b[1] == "(3,100)(4,110)(5,120)(6,130)") - local stat, msg = pcall(table.move, b, 10, 13, 3, b) - assert(not stat and msg == b) -end - -do - -- for very long moves, just check initial accesses and interrupt - -- move with an error - local function checkmove (f, e, t, x, y) - local pos1, pos2 - local a = setmetatable({}, { - __index = function (_,k) pos1 = k end, - __newindex = function (_,k) pos2 = k; error() end, }) - local st, msg = pcall(table.move, a, f, e, t) - assert(not st and not msg and pos1 == x and pos2 == y) - end - checkmove(1, maxI, 0, 1, 0) - checkmove(0, maxI - 1, 1, maxI - 1, maxI) - checkmove(minI, -2, -5, -2, maxI - 6) - checkmove(minI + 1, -1, -2, -1, maxI - 3) - checkmove(minI, -2, 0, minI, 0) -- non overlapping - checkmove(minI + 1, -1, 1, minI + 1, 1) -- non overlapping -end - -checkerror("too many", table.move, {}, 0, maxI, 1) -checkerror("too many", table.move, {}, -1, maxI - 1, 1) -checkerror("too many", table.move, {}, minI, -1, 1) -checkerror("too many", table.move, {}, minI, maxI, 1) -checkerror("wrap around", table.move, {}, 1, maxI, 2) -checkerror("wrap around", table.move, {}, 1, 2, maxI) -checkerror("wrap around", table.move, {}, minI, -2, 2) - - -print"testing sort" - - --- strange lengths -local a = setmetatable({}, {__len = function () return -1 end}) -assert(#a == -1) -table.sort(a, error) -- should not compare anything -a = setmetatable({}, {__len = function () return maxI end}) -checkerror("too big", table.sort, a) - --- test checks for invalid order functions -local function check (t) - local function f(a, b) assert(a and b); return true end - checkerror("invalid order function", table.sort, t, f) -end - -check{1,2,3,4} -check{1,2,3,4,5} -check{1,2,3,4,5,6} - - -function check (a, f) - f = f or function (x,y) return x = math.maxinteger -local mini = math.mininteger - - -local function checkerror (msg, f, ...) - local s, err = pcall(f, ...) - assert(not s and string.find(err, msg)) -end - - --- testing string comparisons -assert('alo' < 'alo1') -assert('' < 'a') -assert('alo\0alo' < 'alo\0b') -assert('alo\0alo\0\0' > 'alo\0alo\0') -assert('alo' < 'alo\0') -assert('alo\0' > 'alo') -assert('\0' < '\1') -assert('\0\0' < '\0\1') -assert('\1\0a\0a' <= '\1\0a\0a') -assert(not ('\1\0a\0b' <= '\1\0a\0a')) -assert('\0\0\0' < '\0\0\0\0') -assert(not('\0\0\0\0' < '\0\0\0')) -assert('\0\0\0' <= '\0\0\0\0') -assert(not('\0\0\0\0' <= '\0\0\0')) -assert('\0\0\0' <= '\0\0\0') -assert('\0\0\0' >= '\0\0\0') -assert(not ('\0\0b' < '\0\0a\0')) - --- testing string.sub -assert(string.sub("123456789",2,4) == "234") -assert(string.sub("123456789",7) == "789") -assert(string.sub("123456789",7,6) == "") -assert(string.sub("123456789",7,7) == "7") -assert(string.sub("123456789",0,0) == "") -assert(string.sub("123456789",-10,10) == "123456789") -assert(string.sub("123456789",1,9) == "123456789") -assert(string.sub("123456789",-10,-20) == "") -assert(string.sub("123456789",-1) == "9") -assert(string.sub("123456789",-4) == "6789") -assert(string.sub("123456789",-6, -4) == "456") -assert(string.sub("123456789", mini, -4) == "123456") -assert(string.sub("123456789", mini, maxi) == "123456789") -assert(string.sub("123456789", mini, mini) == "") -assert(string.sub("\000123456789",3,5) == "234") -assert(("\000123456789"):sub(8) == "789") - --- testing string.find -assert(string.find("123456789", "345") == 3) -a,b = string.find("123456789", "345") -assert(string.sub("123456789", a, b) == "345") -assert(string.find("1234567890123456789", "345", 3) == 3) -assert(string.find("1234567890123456789", "345", 4) == 13) -assert(not string.find("1234567890123456789", "346", 4)) -assert(string.find("1234567890123456789", ".45", -9) == 13) -assert(not string.find("abcdefg", "\0", 5, 1)) -assert(string.find("", "") == 1) -assert(string.find("", "", 1) == 1) -assert(not string.find("", "", 2)) -assert(not string.find('', 'aaa', 1)) -assert(('alo(.)alo'):find('(.)', 1, 1) == 4) - -assert(string.len("") == 0) -assert(string.len("\0\0\0") == 3) -assert(string.len("1234567890") == 10) - -assert(#"" == 0) -assert(#"\0\0\0" == 3) -assert(#"1234567890" == 10) - --- testing string.byte/string.char -assert(string.byte("a") == 97) -assert(string.byte("\xe4") > 127) -assert(string.byte(string.char(255)) == 255) -assert(string.byte(string.char(0)) == 0) -assert(string.byte("\0") == 0) -assert(string.byte("\0\0alo\0x", -1) == string.byte('x')) -assert(string.byte("ba", 2) == 97) -assert(string.byte("\n\n", 2, -1) == 10) -assert(string.byte("\n\n", 2, 2) == 10) -assert(string.byte("") == nil) -assert(string.byte("hi", -3) == nil) -assert(string.byte("hi", 3) == nil) -assert(string.byte("hi", 9, 10) == nil) -assert(string.byte("hi", 2, 1) == nil) -assert(string.char() == "") -assert(string.char(0, 255, 0) == "\0\255\0") -assert(string.char(0, string.byte("\xe4"), 0) == "\0\xe4\0") -assert(string.char(string.byte("\xe4l\0óu", 1, -1)) == "\xe4l\0óu") -assert(string.char(string.byte("\xe4l\0óu", 1, 0)) == "") -assert(string.char(string.byte("\xe4l\0óu", -10, 100)) == "\xe4l\0óu") - -checkerror("out of range", string.char, 256) -checkerror("out of range", string.char, -1) -checkerror("out of range", string.char, math.maxinteger) -checkerror("out of range", string.char, math.mininteger) - -assert(string.upper("ab\0c") == "AB\0C") -assert(string.lower("\0ABCc%$") == "\0abcc%$") -assert(string.rep('teste', 0) == '') -assert(string.rep('tés\00tê', 2) == 'tés\0têtés\000tê') -assert(string.rep('', 10) == '') - -if string.packsize("i") == 4 then - -- result length would be 2^31 (int overflow) - checkerror("too large", string.rep, 'aa', (1 << 30)) - checkerror("too large", string.rep, 'a', (1 << 30), ',') -end - --- repetitions with separator -assert(string.rep('teste', 0, 'xuxu') == '') -assert(string.rep('teste', 1, 'xuxu') == 'teste') -assert(string.rep('\1\0\1', 2, '\0\0') == '\1\0\1\0\0\1\0\1') -assert(string.rep('', 10, '.') == string.rep('.', 9)) -assert(not pcall(string.rep, "aa", maxi // 2 + 10)) -assert(not pcall(string.rep, "", maxi // 2 + 10, "aa")) - -assert(string.reverse"" == "") -assert(string.reverse"\0\1\2\3" == "\3\2\1\0") -assert(string.reverse"\0001234" == "4321\0") - -for i=0,30 do assert(string.len(string.rep('a', i)) == i) end - -assert(type(tostring(nil)) == 'string') -assert(type(tostring(12)) == 'string') -assert(string.find(tostring{}, 'table:')) -assert(string.find(tostring(print), 'function:')) -assert(#tostring('\0') == 1) -assert(tostring(true) == "true") -assert(tostring(false) == "false") -assert(tostring(-1203) == "-1203") -assert(tostring(1203.125) == "1203.125") -assert(tostring(-0.5) == "-0.5") -assert(tostring(-32767) == "-32767") -if math.tointeger(2147483647) then -- no overflow? (32 bits) - assert(tostring(-2147483647) == "-2147483647") -end -if math.tointeger(4611686018427387904) then -- no overflow? (64 bits) - assert(tostring(4611686018427387904) == "4611686018427387904") - assert(tostring(-4611686018427387904) == "-4611686018427387904") -end - -if tostring(0.0) == "0.0" then -- "standard" coercion float->string - assert('' .. 12 == '12' and 12.0 .. '' == '12.0') - assert(tostring(-1203 + 0.0) == "-1203.0") -else -- compatible coercion - assert(tostring(0.0) == "0") - assert('' .. 12 == '12' and 12.0 .. '' == '12') - assert(tostring(-1203 + 0.0) == "-1203") -end - -do -- tests for '%p' format - -- not much to test, as C does not specify what '%p' does. - -- ("The value of the pointer is converted to a sequence of printing - -- characters, in an implementation-defined manner.") - local null = "(null)" -- nulls are formatted by Lua - assert(string.format("%p", 4) == null) - assert(string.format("%p", true) == null) - assert(string.format("%p", nil) == null) - assert(string.format("%p", {}) ~= null) - assert(string.format("%p", print) ~= null) - assert(string.format("%p", coroutine.running()) ~= null) - assert(string.format("%p", io.stdin) ~= null) - assert(string.format("%p", io.stdin) == string.format("%p", io.stdin)) - assert(string.format("%p", print) == string.format("%p", print)) - assert(string.format("%p", print) ~= string.format("%p", assert)) - - assert(#string.format("%90p", {}) == 90) - assert(#string.format("%-60p", {}) == 60) - assert(string.format("%10p", false) == string.rep(" ", 10 - #null) .. null) - assert(string.format("%-12p", 1.5) == null .. string.rep(" ", 12 - #null)) - - do - local t1 = {}; local t2 = {} - assert(string.format("%p", t1) ~= string.format("%p", t2)) - end - - do -- short strings are internalized - local s1 = string.rep("a", 10) - local s2 = string.rep("aa", 5) - assert(string.format("%p", s1) == string.format("%p", s2)) - end - - do -- long strings aren't internalized - local s1 = string.rep("a", 300); local s2 = string.rep("a", 300) - assert(string.format("%p", s1) ~= string.format("%p", s2)) - end -end - -x = '"ílo"\n\\' -assert(string.format('%q%s', x, x) == '"\\"ílo\\"\\\n\\\\""ílo"\n\\') -assert(string.format('%q', "\0") == [["\0"]]) -assert(load(string.format('return %q', x))() == x) -x = "\0\1\0023\5\0009" -assert(load(string.format('return %q', x))() == x) -assert(string.format("\0%c\0%c%x\0", string.byte("\xe4"), string.byte("b"), 140) == - "\0\xe4\0b8c\0") -assert(string.format('') == "") -assert(string.format("%c",34)..string.format("%c",48)..string.format("%c",90)..string.format("%c",100) == - string.format("%1c%-c%-1c%c", 34, 48, 90, 100)) -assert(string.format("%s\0 is not \0%s", 'not be', 'be') == 'not be\0 is not \0be') -assert(string.format("%%%d %010d", 10, 23) == "%10 0000000023") -assert(tonumber(string.format("%f", 10.3)) == 10.3) -assert(string.format('"%-50s"', 'a') == '"a' .. string.rep(' ', 49) .. '"') - -assert(string.format("-%.20s.20s", string.rep("%", 2000)) == - "-"..string.rep("%", 20)..".20s") -assert(string.format('"-%20s.20s"', string.rep("%", 2000)) == - string.format("%q", "-"..string.rep("%", 2000)..".20s")) - -do - local function checkQ (v) - local s = string.format("%q", v) - local nv = load("return " .. s)() - assert(v == nv and math.type(v) == math.type(nv)) - end - checkQ("\0\0\1\255\u{234}") - checkQ(math.maxinteger) - checkQ(math.mininteger) - checkQ(math.pi) - checkQ(0.1) - checkQ(true) - checkQ(nil) - checkQ(false) - checkQ(math.huge) - checkQ(-math.huge) - assert(string.format("%q", 0/0) == "(0/0)") -- NaN - checkerror("no literal", string.format, "%q", {}) -end - -assert(string.format("\0%s\0", "\0\0\1") == "\0\0\0\1\0") -checkerror("contains zeros", string.format, "%10s", "\0") - --- format x tostring -assert(string.format("%s %s", nil, true) == "nil true") -assert(string.format("%s %.4s", false, true) == "false true") -assert(string.format("%.3s %.3s", false, true) == "fal tru") -local m = setmetatable({}, {__tostring = function () return "hello" end, - __name = "hi"}) -assert(string.format("%s %.10s", m, m) == "hello hello") -getmetatable(m).__tostring = nil -- will use '__name' from now on -assert(string.format("%.4s", m) == "hi: ") - -getmetatable(m).__tostring = function () return {} end -checkerror("'__tostring' must return a string", tostring, m) - - -assert(string.format("%x", 0.0) == "0") -assert(string.format("%02x", 0.0) == "00") -assert(string.format("%08X", 0xFFFFFFFF) == "FFFFFFFF") -assert(string.format("%+08d", 31501) == "+0031501") -assert(string.format("%+08d", -30927) == "-0030927") - - -do -- longest number that can be formatted - local i = 1 - local j = 10000 - while i + 1 < j do -- binary search for maximum finite float - local m = (i + j) // 2 - if 10^m < math.huge then i = m else j = m end - end - assert(10^i < math.huge and 10^j == math.huge) - local s = string.format('%.99f', -(10^i)) - assert(string.len(s) >= i + 101) - assert(tonumber(s) == -(10^i)) - - -- limit for floats - assert(10^38 < math.huge) - local s = string.format('%.99f', -(10^38)) - assert(string.len(s) >= 38 + 101) - assert(tonumber(s) == -(10^38)) -end - - --- testing large numbers for format -do -- assume at least 32 bits - local max, min = 0x7fffffff, -0x80000000 -- "large" for 32 bits - assert(string.sub(string.format("%8x", -1), -8) == "ffffffff") - assert(string.format("%x", max) == "7fffffff") - assert(string.sub(string.format("%x", min), -8) == "80000000") - assert(string.format("%d", max) == "2147483647") - assert(string.format("%d", min) == "-2147483648") - assert(string.format("%u", 0xffffffff) == "4294967295") - assert(string.format("%o", 0xABCD) == "125715") - - max, min = 0x7fffffffffffffff, -0x8000000000000000 - if max > 2.0^53 then -- only for 64 bits - assert(string.format("%x", (2^52 | 0) - 1) == "fffffffffffff") - assert(string.format("0x%8X", 0x8f000003) == "0x8F000003") - assert(string.format("%d", 2^53) == "9007199254740992") - assert(string.format("%i", -2^53) == "-9007199254740992") - assert(string.format("%x", max) == "7fffffffffffffff") - assert(string.format("%x", min) == "8000000000000000") - assert(string.format("%d", max) == "9223372036854775807") - assert(string.format("%d", min) == "-9223372036854775808") - assert(string.format("%u", ~(-1 << 64)) == "18446744073709551615") - assert(tostring(1234567890123) == '1234567890123') - end -end - - -do print("testing 'format %a %A'") - local function matchhexa (n) - local s = string.format("%a", n) - -- result matches ISO C requirements - assert(string.find(s, "^%-?0x[1-9a-f]%.?[0-9a-f]*p[-+]?%d+$")) - assert(tonumber(s) == n) -- and has full precision - s = string.format("%A", n) - assert(string.find(s, "^%-?0X[1-9A-F]%.?[0-9A-F]*P[-+]?%d+$")) - assert(tonumber(s) == n) - end - for _, n in ipairs{0.1, -0.1, 1/3, -1/3, 1e30, -1e30, - -45/247, 1, -1, 2, -2, 3e-20, -3e-20} do - matchhexa(n) - end - - assert(string.find(string.format("%A", 0.0), "^0X0%.?0*P%+?0$")) - assert(string.find(string.format("%a", -0.0), "^%-0x0%.?0*p%+?0$")) - - if not _port then -- test inf, -inf, NaN, and -0.0 - assert(string.find(string.format("%a", 1/0), "^inf")) - assert(string.find(string.format("%A", -1/0), "^%-INF")) - assert(string.find(string.format("%a", 0/0), "^%-?nan")) - assert(string.find(string.format("%a", -0.0), "^%-0x0")) - end - - if not pcall(string.format, "%.3a", 0) then - (Message or print)("\n >>> modifiers for format '%a' not available <<<\n") - else - assert(string.find(string.format("%+.2A", 12), "^%+0X%x%.%x0P%+?%d$")) - assert(string.find(string.format("%.4A", -12), "^%-0X%x%.%x000P%+?%d$")) - end -end - - --- testing some flags (all these results are required by ISO C) -assert(string.format("%#12o", 10) == " 012") -assert(string.format("%#10x", 100) == " 0x64") -assert(string.format("%#-17X", 100) == "0X64 ") -assert(string.format("%013i", -100) == "-000000000100") -assert(string.format("%2.5d", -100) == "-00100") -assert(string.format("%.u", 0) == "") -assert(string.format("%+#014.0f", 100) == "+000000000100.") -assert(string.format("% 1.0E", 100) == " 1E+02") -assert(string.format("%-16c", 97) == "a ") -assert(string.format("%+.3G", 1.5) == "+1.5") -assert(string.format("% .1g", 2^10) == " 1e+03") -assert(string.format("%.0s", "alo") == "") -assert(string.format("%.s", "alo") == "") - --- errors in format - -local function check (fmt, msg) - checkerror(msg, string.format, fmt, 10) -end - -local aux = string.rep('0', 600) -check("%100.3d", "invalid conversion") -check("%1"..aux..".3d", "too long") -check("%1.100d", "invalid conversion") -check("%10.1"..aux.."004d", "too long") -check("%t", "invalid conversion") -check("%"..aux.."d", "too long") -check("%d %d", "no value") -check("%010c", "invalid conversion") -check("%.10c", "invalid conversion") -check("%0.34s", "invalid conversion") -check("%#i", "invalid conversion") -check("%3.1p", "invalid conversion") -check("%0.s", "invalid conversion") -check("%10q", "cannot have modifiers") -check("%F", "invalid conversion") -- useless and not in C89 - - -assert(load("return 1\n--comment without ending EOL")() == 1) - - -checkerror("table expected", table.concat, 3) -checkerror("at index " .. maxi, table.concat, {}, " ", maxi, maxi) --- '%' escapes following minus signal -checkerror("at index %" .. mini, table.concat, {}, " ", mini, mini) -assert(table.concat{} == "") -assert(table.concat({}, 'x') == "") -assert(table.concat({'\0', '\0\1', '\0\1\2'}, '.\0.') == "\0.\0.\0\1.\0.\0\1\2") -local a = {}; for i=1,300 do a[i] = "xuxu" end -assert(table.concat(a, "123").."123" == string.rep("xuxu123", 300)) -assert(table.concat(a, "b", 20, 20) == "xuxu") -assert(table.concat(a, "", 20, 21) == "xuxuxuxu") -assert(table.concat(a, "x", 22, 21) == "") -assert(table.concat(a, "3", 299) == "xuxu3xuxu") -assert(table.concat({}, "x", maxi, maxi - 1) == "") -assert(table.concat({}, "x", mini + 1, mini) == "") -assert(table.concat({}, "x", maxi, mini) == "") -assert(table.concat({[maxi] = "alo"}, "x", maxi, maxi) == "alo") -assert(table.concat({[maxi] = "alo", [maxi - 1] = "y"}, "-", maxi - 1, maxi) - == "y-alo") - -assert(not pcall(table.concat, {"a", "b", {}})) - -a = {"a","b","c"} -assert(table.concat(a, ",", 1, 0) == "") -assert(table.concat(a, ",", 1, 1) == "a") -assert(table.concat(a, ",", 1, 2) == "a,b") -assert(table.concat(a, ",", 2) == "b,c") -assert(table.concat(a, ",", 3) == "c") -assert(table.concat(a, ",", 4) == "") - -if not _port then - - local locales = { "ptb", "pt_BR.iso88591", "ISO-8859-1" } - local function trylocale (w) - for i = 1, #locales do - if os.setlocale(locales[i], w) then - print(string.format("'%s' locale set to '%s'", w, locales[i])) - return locales[i] - end - end - print(string.format("'%s' locale not found", w)) - return false - end - - if trylocale("collate") then - assert("alo" < "álo" and "álo" < "amo") - end - - if trylocale("ctype") then - assert(string.gsub("áéíóú", "%a", "x") == "xxxxx") - assert(string.gsub("áÁéÉ", "%l", "x") == "xÁxÉ") - assert(string.gsub("áÁéÉ", "%u", "x") == "áxéx") - assert(string.upper"áÁé{xuxu}ção" == "ÁÁÉ{XUXU}ÇÃO") - end - - os.setlocale("C") - assert(os.setlocale() == 'C') - assert(os.setlocale(nil, "numeric") == 'C') - -end - - --- bug in Lua 5.3.2 --- 'gmatch' iterator does not work across coroutines -do - local f = string.gmatch("1 2 3 4 5", "%d+") - assert(f() == "1") - co = coroutine.wrap(f) - assert(co() == "2") -end - - -if T==nil then - (Message or print) - ("\n >>> testC not active: skipping 'pushfstring' tests <<<\n") -else - - print"testing 'pushfstring'" - - -- formats %U, %f, %I already tested elsewhere - - local blen = 200 -- internal buffer length in 'luaO_pushfstring' - - local function callpfs (op, fmt, n) - local x = {T.testC("pushfstring" .. op .. "; return *", fmt, n)} - -- stack has code, 'fmt', 'n', and result from operation - assert(#x == 4) -- make sure nothing else was left in the stack - return x[4] - end - - local function testpfs (op, fmt, n) - assert(callpfs(op, fmt, n) == string.format(fmt, n)) - end - - testpfs("I", "", 0) - testpfs("I", string.rep("a", blen - 1), 0) - testpfs("I", string.rep("a", blen), 0) - testpfs("I", string.rep("a", blen + 1), 0) - - local str = string.rep("ab", blen) .. "%d" .. string.rep("d", blen / 2) - testpfs("I", str, 2^14) - testpfs("I", str, -2^15) - - str = "%d" .. string.rep("cd", blen) - testpfs("I", str, 2^14) - testpfs("I", str, -2^15) - - str = string.rep("c", blen - 2) .. "%d" - testpfs("I", str, 2^14) - testpfs("I", str, -2^15) - - for l = 12, 14 do - local str1 = string.rep("a", l) - for i = 0, 500, 13 do - for j = 0, 500, 13 do - str = string.rep("a", i) .. "%s" .. string.rep("d", j) - testpfs("S", str, str1) - testpfs("S", str, str) - end - end - end - - str = "abc %c def" - testpfs("I", str, string.byte("A")) - testpfs("I", str, 255) - - str = string.rep("a", blen - 1) .. "%p" .. string.rep("cd", blen) - testpfs("P", str, {}) - - str = string.rep("%%", 3 * blen) .. "%p" .. string.rep("%%", 2 * blen) - testpfs("P", str, {}) -end - - -print('OK') - diff --git a/lua-5.4.4-tests/tpack.lua b/lua-5.4.4-tests/tpack.lua deleted file mode 100644 index 2b9953f..0000000 --- a/lua-5.4.4-tests/tpack.lua +++ /dev/null @@ -1,322 +0,0 @@ --- $Id: testes/tpack.lua $ --- See Copyright Notice in file all.lua - -local pack = string.pack -local packsize = string.packsize -local unpack = string.unpack - -print "testing pack/unpack" - --- maximum size for integers -local NB = 16 - -local sizeshort = packsize("h") -local sizeint = packsize("i") -local sizelong = packsize("l") -local sizesize_t = packsize("T") -local sizeLI = packsize("j") -local sizefloat = packsize("f") -local sizedouble = packsize("d") -local sizenumber = packsize("n") -local little = (pack("i2", 1) == "\1\0") -local align = packsize("!xXi16") - -assert(1 <= sizeshort and sizeshort <= sizeint and sizeint <= sizelong and - sizefloat <= sizedouble) - -print("platform:") -print(string.format( - "\tshort %d, int %d, long %d, size_t %d, float %d, double %d,\n\z - \tlua Integer %d, lua Number %d", - sizeshort, sizeint, sizelong, sizesize_t, sizefloat, sizedouble, - sizeLI, sizenumber)) -print("\t" .. (little and "little" or "big") .. " endian") -print("\talignment: " .. align) - - --- check errors in arguments -function checkerror (msg, f, ...) - local status, err = pcall(f, ...) - -- print(status, err, msg) - assert(not status and string.find(err, msg)) -end - --- minimum behavior for integer formats -assert(unpack("B", pack("B", 0xff)) == 0xff) -assert(unpack("b", pack("b", 0x7f)) == 0x7f) -assert(unpack("b", pack("b", -0x80)) == -0x80) - -assert(unpack("H", pack("H", 0xffff)) == 0xffff) -assert(unpack("h", pack("h", 0x7fff)) == 0x7fff) -assert(unpack("h", pack("h", -0x8000)) == -0x8000) - -assert(unpack("L", pack("L", 0xffffffff)) == 0xffffffff) -assert(unpack("l", pack("l", 0x7fffffff)) == 0x7fffffff) -assert(unpack("l", pack("l", -0x80000000)) == -0x80000000) - - -for i = 1, NB do - -- small numbers with signal extension ("\xFF...") - local s = string.rep("\xff", i) - assert(pack("i" .. i, -1) == s) - assert(packsize("i" .. i) == #s) - assert(unpack("i" .. i, s) == -1) - - -- small unsigned number ("\0...\xAA") - s = "\xAA" .. string.rep("\0", i - 1) - assert(pack("I" .. i, 0xAA) == s:reverse()) - assert(unpack(">I" .. i, s:reverse()) == 0xAA) -end - -do - local lnum = 0x13121110090807060504030201 - local s = pack("i" .. i, ("\xFF"):rep(i - sizeLI) .. s:reverse()) == -lnum) - assert(unpack("i" .. i, "\1" .. ("\x00"):rep(i - 1)) - end -end - -for i = 1, sizeLI do - local lstr = "\1\2\3\4\5\6\7\8\9\10\11\12\13" - local lnum = 0x13121110090807060504030201 - local n = lnum & (~(-1 << (i * 8))) - local s = string.sub(lstr, 1, i) - assert(pack("i" .. i, n) == s:reverse()) - assert(unpack(">i" .. i, s:reverse()) == n) -end - --- sign extension -do - local u = 0xf0 - for i = 1, sizeLI - 1 do - assert(unpack("I"..i, "\xf0"..("\xff"):rep(i - 1)) == u) - u = u * 256 + 0xff - end -end - --- mixed endianness -do - assert(pack(">i2 i2", "\10\0\0\20") - assert(a == 10 and b == 20) - assert(pack("=i4", 2001) == pack("i4", 2001)) -end - -print("testing invalid formats") - -checkerror("out of limits", pack, "i0", 0) -checkerror("out of limits", pack, "i" .. NB + 1, 0) -checkerror("out of limits", pack, "!" .. NB + 1, 0) -checkerror("%(17%) out of limits %[1,16%]", pack, "Xi" .. NB + 1) -checkerror("invalid format option 'r'", pack, "i3r", 0) -checkerror("16%-byte integer", unpack, "i16", string.rep('\3', 16)) -checkerror("not power of 2", pack, "!4i3", 0); -checkerror("missing size", pack, "c", "") -checkerror("variable%-length format", packsize, "s") -checkerror("variable%-length format", packsize, "z") - --- overflow in option size (error will be in digit after limit) -checkerror("invalid format", packsize, "c1" .. string.rep("0", 40)) - -if packsize("i") == 4 then - -- result would be 2^31 (2^3 repetitions of 2^28 strings) - local s = string.rep("c268435456", 2^3) - checkerror("too large", packsize, s) - -- one less is OK - s = string.rep("c268435456", 2^3 - 1) .. "c268435455" - assert(packsize(s) == 0x7fffffff) -end - --- overflow in packing -for i = 1, sizeLI - 1 do - local umax = (1 << (i * 8)) - 1 - local max = umax >> 1 - local min = ~max - checkerror("overflow", pack, "I" .. i, umax + 1) - - checkerror("overflow", pack, ">i" .. i, umax) - checkerror("overflow", pack, ">i" .. i, max + 1) - checkerror("overflow", pack, "i" .. i, pack(">i" .. i, max)) == max) - assert(unpack("I" .. i, pack(">I" .. i, umax)) == umax) -end - --- Lua integer size -assert(unpack(">j", pack(">j", math.maxinteger)) == math.maxinteger) -assert(unpack("f", 24)) -end - -print "testing pack/unpack of floating-point numbers" - -for _, n in ipairs{0, -1.1, 1.9, 1/0, -1/0, 1e20, -1e20, 0.1, 2000.7} do - assert(unpack("n", pack("n", n)) == n) - assert(unpack("n", pack(">n", n)) == n) - assert(pack("f", n):reverse()) - assert(pack(">d", n) == pack("f", pack(">f", n)) == n) - assert(unpack("d", pack(">d", n)) == n) -end - -print "testing pack/unpack of strings" -do - local s = string.rep("abc", 1000) - assert(pack("zB", s, 247) == s .. "\0\xF7") - local s1, b = unpack("zB", s .. "\0\xF9") - assert(b == 249 and s1 == s) - s1 = pack("s", s) - assert(unpack("s", s1) == s) - - checkerror("does not fit", pack, "s1", s) - - checkerror("contains zeros", pack, "z", "alo\0"); - - checkerror("unfinished string", unpack, "zc10000000", "alo") - - for i = 2, NB do - local s1 = pack("s" .. i, s) - assert(unpack("s" .. i, s1) == s and #s1 == #s + i) - end -end - -do - local x = pack("s", "alo") - checkerror("too short", unpack, "s", x:sub(1, -2)) - checkerror("too short", unpack, "c5", "abcd") - checkerror("out of limits", pack, "s100", "alo") -end - -do - assert(pack("c0", "") == "") - assert(packsize("c0") == 0) - assert(unpack("c0", "") == "") - assert(pack("!4 c6", "abcdef") == "abcdef") - assert(pack("c3", "123") == "123") - assert(pack("c0", "") == "") - assert(pack("c8", "123456") == "123456\0\0") - assert(pack("c88", "") == string.rep("\0", 88)) - assert(pack("c188", "ab") == "ab" .. string.rep("\0", 188 - 2)) - local a, b, c = unpack("!4 z c3", "abcdefghi\0xyz") - assert(a == "abcdefghi" and b == "xyz" and c == 14) - checkerror("longer than", pack, "c3", "1234") -end - - --- testing multiple types and sequence -do - local x = pack("!8 b Xh i4 i8 c1 Xi8", -12, 100, 200, "\xEC") - assert(#x == packsize(">!8 b Xh i4 i8 c1 Xi8")) - assert(x == "\xf4" .. "\0\0\0" .. - "\0\0\0\100" .. - "\0\0\0\0\0\0\0\xC8" .. - "\xEC" .. "\0\0\0\0\0\0\0") - local a, b, c, d, pos = unpack(">!8 c1 Xh i4 i8 b Xi8 XI XH", x) - assert(a == "\xF4" and b == 100 and c == 200 and d == -20 and (pos - 1) == #x) - - x = pack(">!4 c3 c4 c2 z i4 c5 c2 Xi4", - "abc", "abcd", "xz", "hello", 5, "world", "xy") - assert(x == "abcabcdxzhello\0\0\0\0\0\5worldxy\0") - local a, b, c, d, e, f, g, pos = unpack(">!4 c3 c4 c2 z i4 c5 c2 Xh Xi4", x) - assert(a == "abc" and b == "abcd" and c == "xz" and d == "hello" and - e == 5 and f == "world" and g == "xy" and (pos - 1) % 4 == 0) - - x = pack(" b b Xd b Xb x", 1, 2, 3) - assert(packsize(" b b Xd b Xb x") == 4) - assert(x == "\1\2\3\0") - a, b, c, pos = unpack("bbXdb", x) - assert(a == 1 and b == 2 and c == 3 and pos == #x) - - -- only alignment - assert(packsize("!8 xXi8") == 8) - local pos = unpack("!8 xXi8", "0123456701234567"); assert(pos == 9) - assert(packsize("!8 xXi2") == 2) - local pos = unpack("!8 xXi2", "0123456701234567"); assert(pos == 3) - assert(packsize("!2 xXi2") == 2) - local pos = unpack("!2 xXi2", "0123456701234567"); assert(pos == 3) - assert(packsize("!2 xXi8") == 2) - local pos = unpack("!2 xXi8", "0123456701234567"); assert(pos == 3) - assert(packsize("!16 xXi16") == 16) - local pos = unpack("!16 xXi16", "0123456701234567"); assert(pos == 17) - - checkerror("invalid next option", pack, "X") - checkerror("invalid next option", unpack, "XXi", "") - checkerror("invalid next option", unpack, "X i", "") - checkerror("invalid next option", pack, "Xc1") -end - -do -- testing initial position - local x = pack("i4i4i4i4", 1, 2, 3, 4) - for pos = 1, 16, 4 do - local i, p = unpack("i4", x, pos) - assert(i == pos//4 + 1 and p == pos + 4) - end - - -- with alignment - for pos = 0, 12 do -- will always round position to power of 2 - local i, p = unpack("!4 i4", x, pos + 1) - assert(i == (pos + 3)//4 + 1 and p == i*4 + 1) - end - - -- negative indices - local i, p = unpack("!4 i4", x, -4) - assert(i == 4 and p == 17) - local i, p = unpack("!4 i4", x, -7) - assert(i == 4 and p == 17) - local i, p = unpack("!4 i4", x, -#x) - assert(i == 1 and p == 5) - - -- limits - for i = 1, #x + 1 do - assert(unpack("c0", x, i) == "") - end - checkerror("out of string", unpack, "c0", x, #x + 2) - -end - -print "OK" - diff --git a/lua-5.4.4-tests/tracegc.lua b/lua-5.4.4-tests/tracegc.lua deleted file mode 100644 index 9c5c1b3..0000000 --- a/lua-5.4.4-tests/tracegc.lua +++ /dev/null @@ -1,40 +0,0 @@ --- track collections - -local M = {} - --- import list -local setmetatable, stderr, collectgarbage = - setmetatable, io.stderr, collectgarbage - -_ENV = nil - -local active = false - - --- each time a table is collected, remark it for finalization on next --- cycle -local mt = {} -function mt.__gc (o) - stderr:write'.' -- mark progress - if active then - setmetatable(o, mt) -- remark object for finalization - end -end - - -function M.start () - if not active then - active = true - setmetatable({}, mt) -- create initial object - end -end - - -function M.stop () - if active then - active = false - collectgarbage() -- call finalizer for the last time - end -end - -return M diff --git a/lua-5.4.4-tests/utf8.lua b/lua-5.4.4-tests/utf8.lua deleted file mode 100644 index 461e223..0000000 --- a/lua-5.4.4-tests/utf8.lua +++ /dev/null @@ -1,247 +0,0 @@ --- $Id: testes/utf8.lua $ --- See Copyright Notice in file all.lua - -print "testing UTF-8 library" - -local utf8 = require'utf8' - - -local function checkerror (msg, f, ...) - local s, err = pcall(f, ...) - assert(not s and string.find(err, msg)) -end - - -local function len (s) - return #string.gsub(s, "[\x80-\xBF]", "") -end - - -local justone = "^" .. utf8.charpattern .. "$" - --- 't' is the list of codepoints of 's' -local function checksyntax (s, t) - -- creates a string "return '\u{t[1]}...\u{t[n]}'" - local ts = {"return '"} - for i = 1, #t do ts[i + 1] = string.format("\\u{%x}", t[i]) end - ts[#t + 2] = "'" - ts = table.concat(ts) - -- its execution should result in 's' - assert(assert(load(ts))() == s) -end - -assert(not utf8.offset("alo", 5)) -assert(not utf8.offset("alo", -4)) - --- 'check' makes several tests over the validity of string 's'. --- 't' is the list of codepoints of 's'. -local function check (s, t, nonstrict) - local l = utf8.len(s, 1, -1, nonstrict) - assert(#t == l and len(s) == l) - assert(utf8.char(table.unpack(t)) == s) -- 't' and 's' are equivalent - - assert(utf8.offset(s, 0) == 1) - - checksyntax(s, t) - - -- creates new table with all codepoints of 's' - local t1 = {utf8.codepoint(s, 1, -1, nonstrict)} - assert(#t == #t1) - for i = 1, #t do assert(t[i] == t1[i]) end -- 't' is equal to 't1' - - for i = 1, l do -- for all codepoints - local pi = utf8.offset(s, i) -- position of i-th char - local pi1 = utf8.offset(s, 2, pi) -- position of next char - assert(string.find(string.sub(s, pi, pi1 - 1), justone)) - assert(utf8.offset(s, -1, pi1) == pi) - assert(utf8.offset(s, i - l - 1) == pi) - assert(pi1 - pi == #utf8.char(utf8.codepoint(s, pi, pi, nonstrict))) - for j = pi, pi1 - 1 do - assert(utf8.offset(s, 0, j) == pi) - end - for j = pi + 1, pi1 - 1 do - assert(not utf8.len(s, j)) - end - assert(utf8.len(s, pi, pi, nonstrict) == 1) - assert(utf8.len(s, pi, pi1 - 1, nonstrict) == 1) - assert(utf8.len(s, pi, -1, nonstrict) == l - i + 1) - assert(utf8.len(s, pi1, -1, nonstrict) == l - i) - assert(utf8.len(s, 1, pi, nonstrict) == i) - end - - local i = 0 - for p, c in utf8.codes(s, nonstrict) do - i = i + 1 - assert(c == t[i] and p == utf8.offset(s, i)) - assert(utf8.codepoint(s, p, p, nonstrict) == c) - end - assert(i == #t) - - i = 0 - for c in string.gmatch(s, utf8.charpattern) do - i = i + 1 - assert(c == utf8.char(t[i])) - end - assert(i == #t) - - for i = 1, l do - assert(utf8.offset(s, i) == utf8.offset(s, i - l - 1, #s + 1)) - end - -end - - -do -- error indication in utf8.len - local function check (s, p) - local a, b = utf8.len(s) - assert(not a and b == p) - end - check("abc\xE3def", 4) - check("汉字\x80", #("汉字") + 1) - check("\xF4\x9F\xBF", 1) - check("\xF4\x9F\xBF\xBF", 1) -end - --- errors in utf8.codes -do - local function errorcodes (s) - checkerror("invalid UTF%-8 code", - function () - for c in utf8.codes(s) do assert(c) end - end) - end - errorcodes("ab\xff") - errorcodes("\u{110000}") - - -- calling interation function with invalid arguments - local f = utf8.codes("") - assert(f("", 2) == nil) - assert(f("", -1) == nil) - assert(f("", math.mininteger) == nil) -end - --- error in initial position for offset -checkerror("position out of bounds", utf8.offset, "abc", 1, 5) -checkerror("position out of bounds", utf8.offset, "abc", 1, -4) -checkerror("position out of bounds", utf8.offset, "", 1, 2) -checkerror("position out of bounds", utf8.offset, "", 1, -1) -checkerror("continuation byte", utf8.offset, "𦧺", 1, 2) -checkerror("continuation byte", utf8.offset, "𦧺", 1, 2) -checkerror("continuation byte", utf8.offset, "\x80", 1) - --- error in indices for len -checkerror("out of bounds", utf8.len, "abc", 0, 2) -checkerror("out of bounds", utf8.len, "abc", 1, 4) - - -local s = "hello World" -local t = {string.byte(s, 1, -1)} -for i = 1, utf8.len(s) do assert(t[i] == string.byte(s, i)) end -check(s, t) - -check("汉字/漢字", {27721, 23383, 47, 28450, 23383,}) - -do - local s = "áéí\128" - local t = {utf8.codepoint(s,1,#s - 1)} - assert(#t == 3 and t[1] == 225 and t[2] == 233 and t[3] == 237) - checkerror("invalid UTF%-8 code", utf8.codepoint, s, 1, #s) - checkerror("out of bounds", utf8.codepoint, s, #s + 1) - t = {utf8.codepoint(s, 4, 3)} - assert(#t == 0) - checkerror("out of bounds", utf8.codepoint, s, -(#s + 1), 1) - checkerror("out of bounds", utf8.codepoint, s, 1, #s + 1) - -- surrogates - assert(utf8.codepoint("\u{D7FF}") == 0xD800 - 1) - assert(utf8.codepoint("\u{E000}") == 0xDFFF + 1) - assert(utf8.codepoint("\u{D800}", 1, 1, true) == 0xD800) - assert(utf8.codepoint("\u{DFFF}", 1, 1, true) == 0xDFFF) - assert(utf8.codepoint("\u{7FFFFFFF}", 1, 1, true) == 0x7FFFFFFF) -end - -assert(utf8.char() == "") -assert(utf8.char(0, 97, 98, 99, 1) == "\0abc\1") - -assert(utf8.codepoint(utf8.char(0x10FFFF)) == 0x10FFFF) -assert(utf8.codepoint(utf8.char(0x7FFFFFFF), 1, 1, true) == (1<<31) - 1) - -checkerror("value out of range", utf8.char, 0x7FFFFFFF + 1) -checkerror("value out of range", utf8.char, -1) - -local function invalid (s) - checkerror("invalid UTF%-8 code", utf8.codepoint, s) - assert(not utf8.len(s)) -end - --- UTF-8 representation for 0x11ffff (value out of valid range) -invalid("\xF4\x9F\xBF\xBF") - --- surrogates -invalid("\u{D800}") -invalid("\u{DFFF}") - --- overlong sequences -invalid("\xC0\x80") -- zero -invalid("\xC1\xBF") -- 0x7F (should be coded in 1 byte) -invalid("\xE0\x9F\xBF") -- 0x7FF (should be coded in 2 bytes) -invalid("\xF0\x8F\xBF\xBF") -- 0xFFFF (should be coded in 3 bytes) - - --- invalid bytes -invalid("\x80") -- continuation byte -invalid("\xBF") -- continuation byte -invalid("\xFE") -- invalid byte -invalid("\xFF") -- invalid byte - - --- empty string -check("", {}) - --- minimum and maximum values for each sequence size -s = "\0 \x7F\z - \xC2\x80 \xDF\xBF\z - \xE0\xA0\x80 \xEF\xBF\xBF\z - \xF0\x90\x80\x80 \xF4\x8F\xBF\xBF" -s = string.gsub(s, " ", "") -check(s, {0,0x7F, 0x80,0x7FF, 0x800,0xFFFF, 0x10000,0x10FFFF}) - -do - -- original UTF-8 values - local s = "\u{4000000}\u{7FFFFFFF}" - assert(#s == 12) - check(s, {0x4000000, 0x7FFFFFFF}, true) - - s = "\u{200000}\u{3FFFFFF}" - assert(#s == 10) - check(s, {0x200000, 0x3FFFFFF}, true) - - s = "\u{10000}\u{1fffff}" - assert(#s == 8) - check(s, {0x10000, 0x1FFFFF}, true) -end - -x = "日本語a-4\0éó" -check(x, {26085, 26412, 35486, 97, 45, 52, 0, 233, 243}) - - --- Supplementary Characters -check("𣲷𠜎𠱓ð¡»ð µ¼ab𠺢", - {0x23CB7, 0x2070E, 0x20C53, 0x2107B, 0x20D7C, 0x61, 0x62, 0x20EA2,}) - -check("𨳊𩶘𦧺𨳒𥄫𤓓\xF4\x8F\xBF\xBF", - {0x28CCA, 0x29D98, 0x269FA, 0x28CD2, 0x2512B, 0x244D3, 0x10ffff}) - - -local i = 0 -for p, c in string.gmatch(x, "()(" .. utf8.charpattern .. ")") do - i = i + 1 - assert(utf8.offset(x, i) == p) - assert(utf8.len(x, p) == utf8.len(x) - i + 1) - assert(utf8.len(c) == 1) - for j = 1, #c - 1 do - assert(utf8.offset(x, 0, p + j - 1) == p) - end -end - -print'ok' - diff --git a/lua-5.4.4-tests/vararg.lua b/lua-5.4.4-tests/vararg.lua deleted file mode 100644 index 44848d2..0000000 --- a/lua-5.4.4-tests/vararg.lua +++ /dev/null @@ -1,151 +0,0 @@ --- $Id: testes/vararg.lua $ --- See Copyright Notice in file all.lua - -print('testing vararg') - -function f(a, ...) - local x = {n = select('#', ...), ...} - for i = 1, x.n do assert(a[i] == x[i]) end - return x.n -end - -function c12 (...) - assert(arg == _G.arg) -- no local 'arg' - local x = {...}; x.n = #x - local res = (x.n==2 and x[1] == 1 and x[2] == 2) - if res then res = 55 end - return res, 2 -end - -function vararg (...) return {n = select('#', ...), ...} end - -local call = function (f, args) return f(table.unpack(args, 1, args.n)) end - -assert(f() == 0) -assert(f({1,2,3}, 1, 2, 3) == 3) -assert(f({"alo", nil, 45, f, nil}, "alo", nil, 45, f, nil) == 5) - -assert(vararg().n == 0) -assert(vararg(nil, nil).n == 2) - -assert(c12(1,2)==55) -a,b = assert(call(c12, {1,2})) -assert(a == 55 and b == 2) -a = call(c12, {1,2;n=2}) -assert(a == 55 and b == 2) -a = call(c12, {1,2;n=1}) -assert(not a) -assert(c12(1,2,3) == false) -local a = vararg(call(next, {_G,nil;n=2})) -local b,c = next(_G) -assert(a[1] == b and a[2] == c and a.n == 2) -a = vararg(call(call, {c12, {1,2}})) -assert(a.n == 2 and a[1] == 55 and a[2] == 2) -a = call(print, {'+'}) -assert(a == nil) - -local t = {1, 10} -function t:f (...) local arg = {...}; return self[...]+#arg end -assert(t:f(1,4) == 3 and t:f(2) == 11) -print('+') - -lim = 20 -local i, a = 1, {} -while i <= lim do a[i] = i+0.3; i=i+1 end - -function f(a, b, c, d, ...) - local more = {...} - assert(a == 1.3 and more[1] == 5.3 and - more[lim-4] == lim+0.3 and not more[lim-3]) -end - -function g(a,b,c) - assert(a == 1.3 and b == 2.3 and c == 3.3) -end - -call(f, a) -call(g, a) - -a = {} -i = 1 -while i <= lim do a[i] = i; i=i+1 end -assert(call(math.max, a) == lim) - -print("+") - - --- new-style varargs - -function oneless (a, ...) return ... end - -function f (n, a, ...) - local b - assert(arg == _G.arg) -- no local 'arg' - if n == 0 then - local b, c, d = ... - return a, b, c, d, oneless(oneless(oneless(...))) - else - n, b, a = n-1, ..., a - assert(b == ...) - return f(n, a, ...) - end -end - -a,b,c,d,e = assert(f(10,5,4,3,2,1)) -assert(a==5 and b==4 and c==3 and d==2 and e==1) - -a,b,c,d,e = f(4) -assert(a==nil and b==nil and c==nil and d==nil and e==nil) - - --- varargs for main chunks -f = load[[ return {...} ]] -x = f(2,3) -assert(x[1] == 2 and x[2] == 3 and x[3] == undef) - - -f = load[[ - local x = {...} - for i=1,select('#', ...) do assert(x[i] == select(i, ...)) end - assert(x[select('#', ...)+1] == undef) - return true -]] - -assert(f("a", "b", nil, {}, assert)) -assert(f()) - -a = {select(3, table.unpack{10,20,30,40})} -assert(#a == 2 and a[1] == 30 and a[2] == 40) -a = {select(1)} -assert(next(a) == nil) -a = {select(-1, 3, 5, 7)} -assert(a[1] == 7 and a[2] == undef) -a = {select(-2, 3, 5, 7)} -assert(a[1] == 5 and a[2] == 7 and a[3] == undef) -pcall(select, 10000) -pcall(select, -10000) - - --- bug in 5.2.2 - -function f(p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, -p11, p12, p13, p14, p15, p16, p17, p18, p19, p20, -p21, p22, p23, p24, p25, p26, p27, p28, p29, p30, -p31, p32, p33, p34, p35, p36, p37, p38, p39, p40, -p41, p42, p43, p44, p45, p46, p48, p49, p50, ...) - local a1,a2,a3,a4,a5,a6,a7 - local a8,a9,a10,a11,a12,a13,a14 -end - --- assertion fail here -f() - --- missing arguments in tail call -do - local function f(a,b,c) return c, b end - local function g() return f(1,2) end - local a, b = g() - assert(a == nil and b == 2) -end -print('OK') - diff --git a/lua-5.4.4-tests/verybig.lua b/lua-5.4.4-tests/verybig.lua deleted file mode 100644 index 8fb7b13..0000000 --- a/lua-5.4.4-tests/verybig.lua +++ /dev/null @@ -1,152 +0,0 @@ --- $Id: testes/verybig.lua $ --- See Copyright Notice in file all.lua - -print "testing RK" - --- testing opcodes with RK arguments larger than K limit -local function foo () - local dummy = { - -- fill first 256 entries in table of constants - 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, - 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, - 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, - 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, - 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, - 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, - 97, 98, 99, 100, 101, 102, 103, 104, - 105, 106, 107, 108, 109, 110, 111, 112, - 113, 114, 115, 116, 117, 118, 119, 120, - 121, 122, 123, 124, 125, 126, 127, 128, - 129, 130, 131, 132, 133, 134, 135, 136, - 137, 138, 139, 140, 141, 142, 143, 144, - 145, 146, 147, 148, 149, 150, 151, 152, - 153, 154, 155, 156, 157, 158, 159, 160, - 161, 162, 163, 164, 165, 166, 167, 168, - 169, 170, 171, 172, 173, 174, 175, 176, - 177, 178, 179, 180, 181, 182, 183, 184, - 185, 186, 187, 188, 189, 190, 191, 192, - 193, 194, 195, 196, 197, 198, 199, 200, - 201, 202, 203, 204, 205, 206, 207, 208, - 209, 210, 211, 212, 213, 214, 215, 216, - 217, 218, 219, 220, 221, 222, 223, 224, - 225, 226, 227, 228, 229, 230, 231, 232, - 233, 234, 235, 236, 237, 238, 239, 240, - 241, 242, 243, 244, 245, 246, 247, 248, - 249, 250, 251, 252, 253, 254, 255, 256, - } - assert(24.5 + 0.6 == 25.1) - local t = {foo = function (self, x) return x + self.x end, x = 10} - t.t = t - assert(t:foo(1.5) == 11.5) - assert(t.t:foo(0.5) == 10.5) -- bug in 5.2 alpha - assert(24.3 == 24.3) - assert((function () return t.x end)() == 10) -end - - -foo() -foo = nil - -if _soft then return 10 end - -print "testing large programs (>64k)" - --- template to create a very big test file -prog = [[$ - -local a,b - -b = {$1$ - b30009 = 65534, - b30010 = 65535, - b30011 = 65536, - b30012 = 65537, - b30013 = 16777214, - b30014 = 16777215, - b30015 = 16777216, - b30016 = 16777217, - b30017 = 0x7fffff, - b30018 = -0x7fffff, - b30019 = 0x1ffffff, - b30020 = -0x1ffffd, - b30021 = -65534, - b30022 = -65535, - b30023 = -65536, - b30024 = -0xffffff, - b30025 = 15012.5, - $2$ -}; - -assert(b.a50008 == 25004 and b["a11"] == -5.5) -assert(b.a33007 == -16503.5 and b.a50009 == -25004.5) -assert(b["b"..30024] == -0xffffff) - -function b:xxx (a,b) return a+b end -assert(b:xxx(10, 12) == 22) -- pushself with non-constant index -b["xxx"] = undef - -s = 0; n=0 -for a,b in pairs(b) do s=s+b; n=n+1 end --- with 32-bit floats, exact value of 's' depends on summation order -assert(81800000.0 < s and s < 81860000 and n == 70001) - -a = nil; b = nil -print'+' - -function f(x) b=x end - -a = f{$3$} or 10 - -assert(a==10) -assert(b[1] == "a10" and b[2] == 5 and b[#b-1] == "a50009") - - -function xxxx (x) return b[x] end - -assert(xxxx(3) == "a11") - -a = nil; b=nil -xxxx = nil - -return 10 - -]] - --- functions to fill in the $n$ - -local function sig (x) - return (x % 2 == 0) and '' or '-' -end - -F = { -function () -- $1$ - for i=10,50009 do - io.write('a', i, ' = ', sig(i), 5+((i-10)/2), ',\n') - end -end, - -function () -- $2$ - for i=30026,50009 do - io.write('b', i, ' = ', sig(i), 15013+((i-30026)/2), ',\n') - end -end, - -function () -- $3$ - for i=10,50009 do - io.write('"a', i, '", ', sig(i), 5+((i-10)/2), ',\n') - end -end, -} - -file = os.tmpname() -io.output(file) -for s in string.gmatch(prog, "$([^$]+)") do - local n = tonumber(s) - if not n then io.write(s) else F[n]() end -end -io.close() -result = dofile(file) -assert(os.remove(file)) -print'OK' -return result - diff --git a/lua-5.4.4/CMakeLists.txt b/lua-5.4.4/CMakeLists.txt deleted file mode 100644 index dd36dbe..0000000 --- a/lua-5.4.4/CMakeLists.txt +++ /dev/null @@ -1,166 +0,0 @@ -set(LUA_LIB_SRCS - "src/lapi.c" - "src/lcode.c" - "src/lctype.c" - "src/ldebug.c" - "src/ldo.c" - "src/ldump.c" - "src/lfunc.c" - "src/lgc.c" - "src/llex.c" - "src/lmem.c" - "src/lobject.c" - "src/lopcodes.c" - "src/lparser.c" - "src/lstate.c" - "src/lstring.c" - "src/ltable.c" - "src/ltm.c" - "src/lundump.c" - "src/lvm.c" - "src/lzio.c" - "src/lauxlib.c" - "src/lbaselib.c" - "src/lcorolib.c" - "src/ldblib.c" - "src/liolib.c" - "src/lmathlib.c" - "src/loadlib.c" - "src/loslib.c" - "src/lstrlib.c" - "src/ltablib.c" - "src/lutf8lib.c" - "src/linit.c" -) - -set(TARGETS_TO_INSTALL lua_internal lua_include) - -if(LUA_BUILD_AS_CXX) - set_source_files_properties(${LUA_LIB_SRCS} "src/lua.c" "src/luac.c" PROPERTIES LANGUAGE CXX ) -endif() - -add_library(lua_internal INTERFACE) - -add_library(lua_include INTERFACE) - -target_include_directories(lua_include INTERFACE - $ - $ -) - -target_link_libraries(lua_internal INTERFACE lua_include) - -if(LUA_ENABLE_SHARED) - add_library(lua_shared SHARED ${LUA_LIB_SRCS}) - target_link_libraries(lua_shared PRIVATE lua_internal PUBLIC lua_include) - set_target_properties(lua_shared PROPERTIES - VERSION "${PACKAGE_VERSION}" - ) - if(WIN32) - target_compile_definitions(lua_shared PRIVATE LUA_BUILD_AS_DLL) - endif() - list(APPEND TARGETS_TO_INSTALL lua_shared) - if(BUILD_SHARED_LIBS) - add_library(Lua::Library ALIAS lua_shared) - elseif(NOT TOP_LEVEL) - set_target_properties(lua_shared PROPERTIES - EXCLUDE_FROM_ALL ON - ) - endif() -endif() - -add_library(lua_static STATIC ${LUA_LIB_SRCS}) -target_link_libraries(lua_static PRIVATE lua_internal PUBLIC lua_include) -set_target_properties(lua_static PROPERTIES - VERSION "${PACKAGE_VERSION}" -) -list(APPEND TARGETS_TO_INSTALL lua_static) -if(NOT BUILD_SHARED_LIBS OR NOT LUA_ENABLE_SHARED) - add_library(Lua::Library ALIAS lua_static) -endif() - - -if(UNIX) - if(NOT EMSCRIPTEN) - find_library(LIBM m) - #TODO: Redo this with find_package - if(NOT LIBM) - message(FATAL_ERROR "libm not found and is required by lua") - endif() - target_link_libraries(lua_internal INTERFACE m) - - target_compile_definitions(lua_internal - INTERFACE LUA_USE_POSIX - ) - if(LUA_SUPPORT_DL) - target_compile_definitions(lua_internal INTERFACE "LUA_USE_DLOPEN") - target_link_libraries(lua_internal INTERFACE dl) - endif() - endif() - - target_compile_options(lua_internal - INTERFACE "-Wall" "-Wextra" - ) -elseif(Win32) - target_compile_options(lua_internal - INTERFACE "/Wall" - ) -endif() - -if(LUA_BUILD_BINARY) - include(CheckIncludeFile) - CHECK_INCLUDE_FILE("readline/readline.h" HAVE_READLINE_READLINE_H) - - add_executable(lua "src/lua.c") - # Can not use lua_shared because some symbols are not exported - target_link_libraries(lua PRIVATE lua_static) - set_target_properties(lua PROPERTIES - RUNTIME_OUTPUT_DIRECTORY ${PROJECT_BINARY_DIR} - ) - if (HAVE_READLINE_READLINE_H) - target_compile_definitions(lua PRIVATE "LUA_USE_READLINE") - target_link_libraries(lua PUBLIC readline) - endif() - list(APPEND TARGETS_TO_INSTALL lua) -endif() - -if(LUA_BUILD_COMPILER) - add_executable(luac "src/luac.c") - target_link_libraries(luac PRIVATE lua_static) - set_target_properties(luac PROPERTIES - RUNTIME_OUTPUT_DIRECTORY ${PROJECT_BINARY_DIR} - ) - list(APPEND TARGETS_TO_INSTALL luac) -endif() - -install(TARGETS ${TARGETS_TO_INSTALL} - EXPORT LuaTargets -) - -install(DIRECTORY include/ TYPE INCLUDE) - -include(CMakePackageConfigHelpers) - -get_target_property(LUA_EXPORT_LIBRARY Lua::Library ALIASED_TARGET) -write_basic_package_version_file( - LuaConfigVersion.cmake - VERSION ${PACKAGE_VERSION} - COMPATIBILITY SameMajorVersion -) - -install(EXPORT LuaTargets - FILE LuaTargets.cmake - DESTINATION "lib/cmake" - NAMESPACE Lua:: -) - -configure_package_config_file( - LuaConfig.cmake.in - "${CMAKE_CURRENT_BINARY_DIR}/LuaConfig.cmake" - INSTALL_DESTINATION "lib/cmake" -) - -install(FILES "${CMAKE_CURRENT_BINARY_DIR}/LuaConfig.cmake" - "${CMAKE_CURRENT_BINARY_DIR}/LuaConfigVersion.cmake" - DESTINATION "lib/cmake" -) diff --git a/lua-5.4.4/LuaConfig.cmake.in b/lua-5.4.4/LuaConfig.cmake.in deleted file mode 100644 index 8f32b2c..0000000 --- a/lua-5.4.4/LuaConfig.cmake.in +++ /dev/null @@ -1,9 +0,0 @@ -@PACKAGE_INIT@ - -include("${CMAKE_CURRENT_LIST_DIR}/LuaTargets.cmake") - -set_and_check(LUA_INCLUDE_DIR "${PACKAGE_PREFIX_DIR}/include") -add_library(Lua::Library ALIAS "Lua::@LUA_EXPORT_LIBRARY@") -set(LUA_LIBRARIES "Lua::Library") - -check_required_components(Lua) diff --git a/lua-5.4.4/Makefile b/lua-5.4.4/Makefile deleted file mode 100644 index fef1af4..0000000 --- a/lua-5.4.4/Makefile +++ /dev/null @@ -1,106 +0,0 @@ -# Makefile for installing Lua -# See doc/readme.html for installation and customization instructions. - -# == CHANGE THE SETTINGS BELOW TO SUIT YOUR ENVIRONMENT ======================= - -# Your platform. See PLATS for possible values. -PLAT= guess - -# Where to install. The installation starts in the src and doc directories, -# so take care if INSTALL_TOP is not an absolute path. See the local target. -# You may want to make INSTALL_LMOD and INSTALL_CMOD consistent with -# LUA_ROOT, LUA_LDIR, and LUA_CDIR in luaconf.h. -INSTALL_TOP= /usr/local -INSTALL_BIN= $(INSTALL_TOP)/bin -INSTALL_INC= $(INSTALL_TOP)/include -INSTALL_LIB= $(INSTALL_TOP)/lib -INSTALL_MAN= $(INSTALL_TOP)/man/man1 -INSTALL_LMOD= $(INSTALL_TOP)/share/lua/$V -INSTALL_CMOD= $(INSTALL_TOP)/lib/lua/$V - -# How to install. If your install program does not support "-p", then -# you may have to run ranlib on the installed liblua.a. -INSTALL= install -p -INSTALL_EXEC= $(INSTALL) -m 0755 -INSTALL_DATA= $(INSTALL) -m 0644 -# -# If you don't have "install" you can use "cp" instead. -# INSTALL= cp -p -# INSTALL_EXEC= $(INSTALL) -# INSTALL_DATA= $(INSTALL) - -# Other utilities. -MKDIR= mkdir -p -RM= rm -f - -# == END OF USER SETTINGS -- NO NEED TO CHANGE ANYTHING BELOW THIS LINE ======= - -# Convenience platforms targets. -PLATS= guess aix bsd c89 freebsd generic linux linux-readline macosx mingw posix solaris - -# What to install. -TO_BIN= lua luac -TO_INC= lua.h luaconf.h lualib.h lauxlib.h lua.hpp -TO_LIB= liblua.a -TO_MAN= lua.1 luac.1 - -# Lua version and release. -V= 5.4 -R= $V.4 - -# 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.4/README b/lua-5.4.4/README deleted file mode 100644 index c394c69..0000000 --- a/lua-5.4.4/README +++ /dev/null @@ -1,6 +0,0 @@ - -This is Lua 5.4.4, released on 13 Jan 2022. - -For installation instructions, license details, and -further information about Lua, see doc/readme.html. - diff --git a/lua-5.4.4/doc/contents.html b/lua-5.4.4/doc/contents.html deleted file mode 100644 index ab82eb4..0000000 --- a/lua-5.4.4/doc/contents.html +++ /dev/null @@ -1,674 +0,0 @@ - - - -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–2022 Lua.org, PUC-Rio. -Freely available under the terms of the -Lua license. - - -

Contents

- - -

Index

- - - - - - - -
-

Lua functions

-

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

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

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

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

 -

 

-

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

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

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

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

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

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

metamethods

-

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

environment
variables

-

-LUA_CPATH
-LUA_CPATH_5_4
-LUA_INIT
-LUA_INIT_5_4
-LUA_PATH
-LUA_PATH_5_4
- -

 -

C API

-

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

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

 -

auxiliary library

-

-luaL_Buffer
-luaL_Reg
-luaL_Stream
- -

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

standard library

-

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

constants

-

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

- -

-Last update: -Thu Jan 13 11:32:22 UTC 2022 -

- - - - diff --git a/lua-5.4.4/doc/index.css b/lua-5.4.4/doc/index.css deleted file mode 100644 index c961835..0000000 --- a/lua-5.4.4/doc/index.css +++ /dev/null @@ -1,21 +0,0 @@ -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.4/doc/logo.gif b/lua-5.4.4/doc/logo.gif deleted file mode 100644 index 5c77eacc3b8f397fb2e87d2aaecd89128e53a117..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 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* diff --git a/lua-5.4.4/doc/lua.1 b/lua-5.4.4/doc/lua.1 deleted file mode 100644 index a46a1a6..0000000 --- a/lua-5.4.4/doc/lua.1 +++ /dev/null @@ -1,149 +0,0 @@ -.\" $Id: lua.man,v 1.14 2020/05/21 19:31:21 lhf Exp $ -.TH LUA 1 "$Date: 2020/05/21 19:31:21 $" -.SH NAME -lua \- Lua interpreter -.SH SYNOPSIS -.B lua -[ -.I options -] -[ -.I script -[ -.I args -] -] -.SH DESCRIPTION -.B lua -is the standalone Lua interpreter. -It loads and executes Lua programs, -either in textual source form or -in precompiled binary form. -(Precompiled binaries are output by -.BR luac , -the Lua compiler.) -.B lua -can be used as a batch interpreter and also interactively. -.LP -After handling the -.IR options , -the Lua program in file -.I script -is loaded and executed. -The -.I args -are available to -.I script -as strings in a global table named -.B arg -and also as arguments to its main function. -When called without arguments, -.B lua -behaves as -.B "lua \-v \-i" -if the standard input is a terminal, -and as -.B "lua \-" -otherwise. -.LP -In interactive mode, -.B lua -prompts the user, -reads lines from the standard input, -and executes them as they are read. -If the line contains an expression, -then the line is evaluated and the result is printed. -If a line does not contain a complete statement, -then a secondary prompt is displayed and -lines are read until a complete statement is formed or -a syntax error is found. -.LP -Before handling command line options and scripts, -.B lua -checks the contents of the environment variables -.B LUA_INIT_5_4 -and -.BR LUA_INIT , -in that order. -If the contents are of the form -.RI '@ filename ', -then -.I filename -is executed. -Otherwise, the contents are assumed to be a Lua statement and is executed. -When -.B LUA_INIT_5_4 -is defined, -.B LUA_INIT -is ignored. -.SH OPTIONS -.TP -.BI \-e " stat" -execute statement -.IR stat . -.TP -.B \-i -enter interactive mode after executing -.IR script . -.TP -.BI \-l " name" -require library -.I name -into global -.IR name . -.TP -.B \-v -show version information. -.TP -.B \-E -ignore environment variables. -.TP -.B \-W -turn warnings on. -.TP -.B \-\- -stop handling options. -.TP -.B \- -stop handling options and execute the standard input as a file. -.SH ENVIRONMENT VARIABLES -The following environment variables affect the execution of -.BR lua . -When defined, -the version-specific variants take priority -and the version-neutral variants are ignored. -.TP -.B LUA_INIT, LUA_INIT_5_4 -Code to be executed before command line options and scripts. -.TP -.B LUA_PATH, LUA_PATH_5_4 -Initial value of package.cpath, -the path used by require to search for Lua loaders. -.TP -.B LUA_CPATH, LUA_CPATH_5_4 -Initial value of package.cpath, -the path used by require to search for C loaders. -.SH EXIT STATUS -If a script calls os.exit, -then -.B lua -exits with the given exit status. -Otherwise, -.B lua -exits -with EXIT_SUCCESS (0 on POSIX systems) if there were no errors -and -with EXIT_FAILURE (1 on POSIX systems) if there were errors. -Errors raised in interactive mode do not cause exits. -.SH DIAGNOSTICS -Error messages should be self explanatory. -.SH "SEE ALSO" -.BR luac (1) -.br -The documentation at lua.org, -especially section 7 of the reference manual. -.SH AUTHORS -R. Ierusalimschy, -L. H. de Figueiredo, -W. Celes -.\" EOF diff --git a/lua-5.4.4/doc/lua.css b/lua-5.4.4/doc/lua.css deleted file mode 100644 index cbd0799..0000000 --- a/lua-5.4.4/doc/lua.css +++ /dev/null @@ -1,161 +0,0 @@ -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.4/doc/luac.1 b/lua-5.4.4/doc/luac.1 deleted file mode 100644 index 33a4ed0..0000000 --- a/lua-5.4.4/doc/luac.1 +++ /dev/null @@ -1,118 +0,0 @@ -.\" $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.4/doc/manual.css b/lua-5.4.4/doc/manual.css deleted file mode 100644 index aa0e677..0000000 --- a/lua-5.4.4/doc/manual.css +++ /dev/null @@ -1,21 +0,0 @@ -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.4/doc/manual.html b/lua-5.4.4/doc/manual.html deleted file mode 100644 index 61a8220..0000000 --- a/lua-5.4.4/doc/manual.html +++ /dev/null @@ -1,11959 +0,0 @@ - - - -Lua 5.4 Reference Manual - - - - - - - -

-Lua -Lua 5.4 Reference Manual -

- -

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

- -Copyright © 2020–2022 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'. - - -

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

-Examples of valid integer constants are - -

-     3   345   0xff   0xBEBADA
-

-Examples of valid float constants are - -

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

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

3.2 – Variables

- -

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

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

-	var ::= Name
-

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

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

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

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

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

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

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

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

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

3.3 – Statements

- - - -

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

3.3.1 – Blocks

- -

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

-	block ::= {stat}
-

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

-	stat ::= ‘;’
-
- -

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

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

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

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

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

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

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

-	stat ::= do block end
-

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

3.3.2 – Chunks

- -

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

-	chunk ::= block
-
- -

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

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

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

3.3.3 – Assignment

- -

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

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

-Expressions are discussed in §3.4. - - -

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

-If a variable is both assigned and read -inside a multiple assignment, -Lua ensures 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. - - -

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

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

-	stat ::= break
-

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

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

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

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

3.3.5 – For Statement

- -

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

The numerical for loop

- -

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

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

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

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

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

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

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

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

The generic for loop

- -

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

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

-A for statement like - -

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

-works as follows. - - -

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

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

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

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

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

3.3.6 – Function Calls as Statements

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

-	stat ::= functioncall
-

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

3.3.7 – Local Declarations

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

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

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

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

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

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

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

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

3.3.8 – To-be-closed Variables

- -

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

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

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

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

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

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

3.4 – Expressions

- - - -

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

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

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

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

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

-Here are some examples: - -

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

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

3.4.1 – Arithmetic Operators

-Lua supports the following arithmetic operators: - -

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

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

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

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

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

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

3.4.2 – Bitwise Operators

-Lua supports the following bitwise operators: - -

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

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

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

3.4.3 – Coercions and Conversions

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

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

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

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

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

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

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

3.4.4 – Relational Operators

-Lua supports the following relational operators: - -

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

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

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

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

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

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

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

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

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

3.4.5 – Logical Operators

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

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

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

3.4.6 – Concatenation

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

3.4.7 – The Length Operator

- -

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

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

-The length operator applied on a table -returns a border in that table. -A border in a table t is any 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 function call or a vararg expression, -then all values returned by this expression enter the list consecutively -(see §3.4.10). - - -

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

3.4.10 – Function Calls

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

-	functioncall ::= prefixexp args
-

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

-The form - -

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

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

-Arguments have the following syntax: - -

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

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

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

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

3.4.11 – Function Definitions

- -

-The syntax for function definition is - -

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

-The following syntactic sugar simplifies function definitions: - -

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

-The statement - -

-     function f () body end
-

-translates to - -

-     f = function () body end
-

-The statement - -

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

-translates to - -

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

-The statement - -

-     local function f () body end
-

-translates to - -

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

-not to - -

-     local f = function () body end
-

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

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

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

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

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

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

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

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

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

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

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

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

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

-is syntactic sugar for - -

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

3.5 – Visibility Rules

- -

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

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

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

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

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

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

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

4 – The Application Program Interface

- - - -

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

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

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

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

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

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

4.1 – The Stack

- - - -

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

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

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

4.1.1 – Stack Size

- -

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

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

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

4.1.2 – Valid and Acceptable Indices

- -

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

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

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

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

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

4.1.3 – Pointers to strings

- -

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

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

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

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

4.2 – C Closures

- -

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

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

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

4.3 – Registry

- -

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

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

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

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

4.4 – Error Handling in C

- - - -

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

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

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

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

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

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

4.4.1 – Status Codes

- -

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

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

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

4.5 – Handling Yields in C

- -

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

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

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

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

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

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

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

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

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

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

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

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

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

4.6 – Functions and Types

- -

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

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

lua_absindex

-[-0, +0, –] -

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

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

lua_Alloc

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

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

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

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

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

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

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

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

-     static void *l_alloc (void *ud, void *ptr, size_t osize,
-                                                size_t nsize) {
-       (void)ud;  (void)osize;  /* not used */
-       if (nsize == 0) {
-         free(ptr);
-         return NULL;
-       }
-       else
-         return realloc(ptr, nsize);
-     }
-

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

lua_arith

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

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

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

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

- - - - -

lua_atpanic

-[-0, +0, –] -

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

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

lua_call

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

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

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

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

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

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

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

-Here it is in C: - -

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

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

lua_callk

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

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

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

lua_CFunction

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

-Type for C functions. - - -

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

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

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

lua_checkstack

-[-0, +0, –] -

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

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

lua_close

-[-0, +0, –] -

void lua_close (lua_State *L);
- -

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

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

lua_closeslot

-[-0, +0, e] -

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

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

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

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

lua_compare

-[-0, +0, e] -

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

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

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

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

lua_concat

-[-n, +1, e] -

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

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

lua_copy

-[-0, +0, –] -

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

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

lua_createtable

-[-0, +1, m] -

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

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

lua_dump

-[-0, +0, –] -

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

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

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

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

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

lua_error

-[-1, +0, v] -

int lua_error (lua_State *L);
- -

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

lua_gc

-[-0, +0, –] -

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

-Controls the garbage collector. - - -

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

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

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

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

lua_rawgeti

-[-0, +1, –] -

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

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

-Returns the type of the pushed value. - - - - - -

lua_rawgetp

-[-0, +1, –] -

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

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

-Returns the type of the pushed value. - - - - - -

lua_rawlen

-[-0, +0, –] -

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

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

lua_rawset

-[-2, +0, m] -

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

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

lua_rawseti

-[-1, +0, m] -

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

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

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

lua_rawsetp

-[-1, +0, m] -

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

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

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

lua_Reader

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

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

lua_register

-[-0, +0, e] -

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

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

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

lua_remove

-[-1, +0, –] -

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

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

lua_replace

-[-1, +0, –] -

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

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

lua_resetthread

-[-0, +?, –] -

int lua_resetthread (lua_State *L);
- -

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

lua_resume

-[-?, +?, –] -

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

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

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

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

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

lua_rotate

-[-0, +0, –] -

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

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

lua_setallocf

-[-0, +0, –] -

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

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

lua_setfield

-[-1, +0, e] -

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

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

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

lua_setglobal

-[-1, +0, e] -

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

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

lua_seti

-[-1, +0, e] -

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

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

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

lua_setiuservalue

-[-1, +0, –] -

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

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

lua_setmetatable

-[-1, +0, –] -

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

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

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

lua_settable

-[-2, +0, e] -

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

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

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

lua_settop

-[-?, +?, e] -

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

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

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

lua_setwarnf

-[-0, +0, –] -

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

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

lua_State

-
typedef struct lua_State lua_State;
- -

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

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

lua_status

-[-0, +0, –] -

int lua_status (lua_State *L);
- -

-Returns the status of the thread L. - - -

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

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

lua_stringtonumber

-[-0, +1, –] -

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

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

lua_toboolean

-[-0, +0, –] -

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

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

lua_tocfunction

-[-0, +0, –] -

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

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

lua_toclose

-[-0, +0, m] -

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

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

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

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

lua_tointeger

-[-0, +0, –] -

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

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

lua_tointegerx

-[-0, +0, –] -

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

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

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

lua_tolstring

-[-0, +0, m] -

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

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

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

lua_tonumber

-[-0, +0, –] -

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

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

lua_tonumberx

-[-0, +0, –] -

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

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

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

lua_topointer

-[-0, +0, –] -

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

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

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

lua_tostring

-[-0, +0, m] -

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

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

lua_tothread

-[-0, +0, –] -

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

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

lua_touserdata

-[-0, +0, –] -

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

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

lua_type

-[-0, +0, –] -

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

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

lua_typename

-[-0, +0, –] -

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

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

lua_Unsigned

-
typedef ... lua_Unsigned;
- -

-The unsigned version of lua_Integer. - - - - - -

lua_upvalueindex

-[-0, +0, –] -

int lua_upvalueindex (int i);
- -

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

lua_version

-[-0, +0, –] -

lua_Number lua_version (lua_State *L);
- -

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

lua_WarnFunction

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

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

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

lua_warning

-[-0, +0, –] -

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

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

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

lua_Writer

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

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

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

lua_xmove

-[-?, +?, –] -

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

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

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

lua_yield

-[-?, +?, v] -

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

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

lua_yieldk

-[-?, +?, v] -

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

-Yields a coroutine (thread). - - -

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

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

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

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

4.7 – The Debug Interface

- -

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

lua_Debug

-
typedef struct lua_Debug {
-  int event;
-  const char *name;           /* (n) */
-  const char *namewhat;       /* (n) */
-  const char *what;           /* (S) */
-  const char *source;         /* (S) */
-  size_t srclen;              /* (S) */
-  int currentline;            /* (l) */
-  int linedefined;            /* (S) */
-  int lastlinedefined;        /* (S) */
-  unsigned char nups;         /* (u) number of upvalues */
-  unsigned char nparams;      /* (u) number of parameters */
-  char isvararg;              /* (u) */
-  char istailcall;            /* (t) */
-  unsigned short ftransfer;   /* (r) index of first value transferred */
-  unsigned short ntransfer;   /* (r) number of transferred values */
-  char short_src[LUA_IDSIZE]; /* (S) */
-  /* private part */
-  other fields
-} lua_Debug;
- -

-A structure used to carry different pieces of -information about a function or an activation record. -lua_getstack fills only the private part -of this structure, for later use. -To fill the other fields of lua_Debug with useful information, -you must call lua_getinfo 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 vararg function -(always true for C functions). -
    • - -
  • ftransfer: -the index in the stack of the first value being "transferred", -that is, parameters in a call or return values in a return. -(The other values are in consecutive indices.) -Using this index, you can access and modify these values -through lua_getlocal and lua_setlocal. -This field is only meaningful during a -call hook, denoting the first parameter, -or a return hook, denoting the first value being returned. -(For call hooks, this value is always 1.) -
    • - -
  • ntransfer: -The number of values being transferred (see previous item). -(For calls of Lua functions, -this value is always equal to nparams.) -
    • - -
- - - - -

lua_gethook

-[-0, +0, –] -

lua_Hook lua_gethook (lua_State *L);
- -

-Returns the current hook function. - - - - - -

lua_gethookcount

-[-0, +0, –] -

int lua_gethookcount (lua_State *L);
- -

-Returns the current hook count. - - - - - -

lua_gethookmask

-[-0, +0, –] -

int lua_gethookmask (lua_State *L);
- -

-Returns the current hook mask. - - - - - -

lua_getinfo

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

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

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

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

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

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

-Each character in the string what -selects some fields of the structure ar to be filled or -a value to be pushed on the stack. -(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 the buffer B -(see luaL_Buffer). -The buffer must have at least that many bytes. - - - - - -

luaL_callmeta

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

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

-Calls a metamethod. - - -

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

luaL_checkany

-[-0, +0, v] -

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

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

luaL_checkinteger

-[-0, +0, v] -

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

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

luaL_checklstring

-[-0, +0, v] -

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

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

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

luaL_checknumber

-[-0, +0, v] -

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

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

luaL_checkoption

-[-0, +0, v] -

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

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

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

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

luaL_checkstack

-[-0, +0, v] -

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

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

luaL_checkstring

-[-0, +0, v] -

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

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

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

luaL_checktype

-[-0, +0, v] -

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

-Checks whether the function argument arg has type t. -See lua_type for the encoding of types for t. - - - - - -

luaL_checkudata

-[-0, +0, v] -

void *luaL_checkudata (lua_State *L, int arg, const char *tname);
- -

-Checks whether the function argument arg is a userdata -of the type tname (see luaL_newmetatable) and -returns the userdata's memory-block address (see lua_touserdata). - - - - - -

luaL_checkversion

-[-0, +0, v] -

void luaL_checkversion (lua_State *L);
- -

-Checks whether the code making the call and the Lua library being called -are using the same version of Lua and the same numeric types. - - - - - -

luaL_dofile

-[-0, +?, m] -

int luaL_dofile (lua_State *L, const char *filename);
- -

-Loads and runs the given file. -It is defined as the following macro: - -

-     (luaL_loadfile(L, filename) || lua_pcall(L, 0, LUA_MULTRET, 0))
-

-It returns LUA_OK if there are no errors, -or an error code in case of errors (see §4.4.1). - - - - - -

luaL_dostring

-[-0, +?, –] -

int luaL_dostring (lua_State *L, const char *str);
- -

-Loads and runs the given string. -It is defined as the following macro: - -

-     (luaL_loadstring(L, str) || lua_pcall(L, 0, LUA_MULTRET, 0))
-

-It returns LUA_OK if there are no errors, -or an error code in case of errors (see §4.4.1). - - - - - -

luaL_error

-[-0, +0, v] -

int luaL_error (lua_State *L, const char *fmt, ...);
- -

-Raises an error. -The error message format is given by fmt -plus any extra arguments, -following the same rules of lua_pushfstring. -It also adds at the beginning of the message the file name and -the line number where the error occurred, -if this information is available. - - -

-This function never returns, -but it is an idiom to use it in C functions -as return luaL_error(args). - - - - - -

luaL_execresult

-[-0, +3, m] -

int luaL_execresult (lua_State *L, int stat);
- -

-This function produces the return values for -process-related functions in the standard library -(os.execute and io.close). - - - - - -

luaL_fileresult

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

int luaL_fileresult (lua_State *L, int stat, const char *fname);
- -

-This function produces the return values for -file-related functions in the standard library -(io.open, os.rename, file:seek, etc.). - - - - - -

luaL_getmetafield

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

int luaL_getmetafield (lua_State *L, int obj, const char *e);
- -

-Pushes onto the stack the field e from the metatable -of the object at index obj and returns the type of the pushed value. -If the object does not have a metatable, -or if the metatable does not have this field, -pushes nothing and returns LUA_TNIL. - - - - - -

luaL_getmetatable

-[-0, +1, m] -

int luaL_getmetatable (lua_State *L, const char *tname);
- -

-Pushes onto the stack the metatable associated with the name tname -in the registry (see luaL_newmetatable), -or nil if there is no metatable associated with that name. -Returns the type of the pushed value. - - - - - -

luaL_getsubtable

-[-0, +1, e] -

int luaL_getsubtable (lua_State *L, int idx, const char *fname);
- -

-Ensures that the value t[fname], -where t is the value at index idx, -is a table, -and pushes that table onto the stack. -Returns true if it finds a previous table there -and false if it creates a new table. - - - - - -

luaL_gsub

-[-0, +1, m] -

const char *luaL_gsub (lua_State *L,
-                       const char *s,
-                       const char *p,
-                       const char *r);
- -

-Creates a copy of string s, -replacing any occurrence of the string p -with the string r. -Pushes the resulting string on the stack and returns it. - - - - - -

luaL_len

-[-0, +0, e] -

lua_Integer luaL_len (lua_State *L, int index);
- -

-Returns the "length" of the value at the given index -as a number; -it is equivalent to the '#' operator in Lua (see §3.4.7). -Raises an error if the result of the operation is not an integer. -(This case can only happen through metamethods.) - - - - - -

luaL_loadbuffer

-[-0, +1, –] -

int luaL_loadbuffer (lua_State *L,
-                     const char *buff,
-                     size_t sz,
-                     const char *name);
- -

-Equivalent to luaL_loadbufferx with mode equal to NULL. - - - - - -

luaL_loadbufferx

-[-0, +1, –] -

int luaL_loadbufferx (lua_State *L,
-                      const char *buff,
-                      size_t sz,
-                      const char *name,
-                      const char *mode);
- -

-Loads a buffer as a Lua chunk. -This function uses lua_load to load the chunk in the -buffer pointed to by buff with size sz. - - -

-This function returns the same results as lua_load. -name is the chunk name, -used for debug information and error messages. -The string mode works as in the function lua_load. - - - - - -

luaL_loadfile

-[-0, +1, m] -

int luaL_loadfile (lua_State *L, const char *filename);
- -

-Equivalent to luaL_loadfilex with mode equal to NULL. - - - - - -

luaL_loadfilex

-[-0, +1, m] -

int luaL_loadfilex (lua_State *L, const char *filename,
-                                            const char *mode);
- -

-Loads a file as a Lua chunk. -This function uses lua_load to load the chunk in the file -named filename. -If filename is NULL, -then it loads from the standard input. -The first line in the file is ignored if it starts with a #. - - -

-The string mode works as in the function lua_load. - - -

-This function returns the same results as lua_load -or LUA_ERRFILE for file-related errors. - - -

-As lua_load, this function only loads the chunk; -it does not run it. - - - - - -

luaL_loadstring

-[-0, +1, –] -

int luaL_loadstring (lua_State *L, const char *s);
- -

-Loads a string as a Lua chunk. -This function uses lua_load to load the chunk in -the zero-terminated string s. - - -

-This function returns the same results as lua_load. - - -

-Also as lua_load, this function only loads the chunk; -it does not run it. - - - - - -

luaL_newlib

-[-0, +1, m] -

void luaL_newlib (lua_State *L, const luaL_Reg l[]);
- -

-Creates a new table and registers there -the functions in the list l. - - -

-It is implemented as the following macro: - -

-     (luaL_newlibtable(L,l), luaL_setfuncs(L,l,0))
-

-The array l must be the actual array, -not a pointer to it. - - - - - -

luaL_newlibtable

-[-0, +1, m] -

void luaL_newlibtable (lua_State *L, const luaL_Reg l[]);
- -

-Creates a new table with a size optimized -to store all entries in the array l -(but does not actually store them). -It is intended to be used in conjunction with luaL_setfuncs -(see luaL_newlib). - - -

-It is implemented as a macro. -The array l must be the actual array, -not a pointer to it. - - - - - -

luaL_newmetatable

-[-0, +1, m] -

int luaL_newmetatable (lua_State *L, const char *tname);
- -

-If the registry already has the key tname, -returns 0. -Otherwise, -creates a new table to be used as a metatable for userdata, -adds to this new table the pair __name = tname, -adds to the registry the pair [tname] = new table, -and returns 1. - - -

-In both cases, -the function pushes onto the stack the final value associated -with tname in the registry. - - - - - -

luaL_newstate

-[-0, +0, –] -

lua_State *luaL_newstate (void);
- -

-Creates a new Lua state. -It calls lua_newstate with an -allocator based on the standard C allocation functions -and then sets a warning function and a panic function (see §4.4) -that print messages to the standard error output. - - -

-Returns the new state, -or NULL if there is a memory allocation error. - - - - - -

luaL_openlibs

-[-0, +0, e] -

void luaL_openlibs (lua_State *L);
- -

-Opens all standard Lua libraries into the given state. - - - - - -

luaL_opt

-[-0, +0, –] -

T luaL_opt (L, func, arg, dflt);
- -

-This macro is defined as follows: - -

-     (lua_isnoneornil(L,(arg)) ? (dflt) : func(L,(arg)))
-

-In words, if the argument arg is nil or absent, -the macro results in the default dflt. -Otherwise, it results in the result of calling func -with the state L and the argument index arg as -arguments. -Note that it evaluates the expression dflt only if needed. - - - - - -

luaL_optinteger

-[-0, +0, v] -

lua_Integer luaL_optinteger (lua_State *L,
-                             int arg,
-                             lua_Integer d);
- -

-If the function argument arg is an integer -(or it is convertible to an integer), -returns this integer. -If this argument is absent or is nil, -returns d. -Otherwise, raises an error. - - - - - -

luaL_optlstring

-[-0, +0, v] -

const char *luaL_optlstring (lua_State *L,
-                             int arg,
-                             const char *d,
-                             size_t *l);
- -

-If the function argument arg is a string, -returns this string. -If this argument is absent or is nil, -returns d. -Otherwise, raises an error. - - -

-If l is not NULL, -fills its referent with the result's length. -If the result is NULL -(only possible when returning d and d == NULL), -its length is considered zero. - - -

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

luaL_optnumber

-[-0, +0, v] -

lua_Number luaL_optnumber (lua_State *L, int arg, lua_Number d);
- -

-If the function argument arg is a number, -returns this number as a lua_Number. -If this argument is absent or is nil, -returns d. -Otherwise, raises an error. - - - - - -

luaL_optstring

-[-0, +0, v] -

const char *luaL_optstring (lua_State *L,
-                            int arg,
-                            const char *d);
- -

-If the function argument arg is a string, -returns this string. -If this argument is absent or is nil, -returns d. -Otherwise, raises an error. - - - - - -

luaL_prepbuffer

-[-?, +?, m] -

char *luaL_prepbuffer (luaL_Buffer *B);
- -

-Equivalent to luaL_prepbuffsize -with the predefined size LUAL_BUFFERSIZE. - - - - - -

luaL_prepbuffsize

-[-?, +?, m] -

char *luaL_prepbuffsize (luaL_Buffer *B, size_t sz);
- -

-Returns an address to a space of size sz -where you can copy a string to be added to buffer B -(see luaL_Buffer). -After copying the string into this space you must call -luaL_addsize with the size of the string to actually add -it to the buffer. - - - - - -

luaL_pushfail

-[-0, +1, –] -

void luaL_pushfail (lua_State *L);
- -

-Pushes the fail value onto the stack (see §6). - - - - - -

luaL_pushresult

-[-?, +1, m] -

void luaL_pushresult (luaL_Buffer *B);
- -

-Finishes the use of buffer B leaving the final string on -the top of the stack. - - - - - -

luaL_pushresultsize

-[-?, +1, m] -

void luaL_pushresultsize (luaL_Buffer *B, size_t sz);
- -

-Equivalent to the sequence luaL_addsize, luaL_pushresult. - - - - - -

luaL_ref

-[-1, +0, m] -

int luaL_ref (lua_State *L, int t);
- -

-Creates and returns a reference, -in the table at index t, -for the object on the top of the stack (and pops the object). - - -

-A reference is a unique integer key. -As long as you do not manually add integer keys into the table t, -luaL_ref ensures the uniqueness of the key it returns. -You can retrieve an object referred by the reference r -by calling lua_rawgeti(L, t, r). -The function luaL_unref frees a reference. - - -

-If the object on the top of the stack is nil, -luaL_ref returns the constant LUA_REFNIL. -The constant LUA_NOREF is guaranteed to be different -from any reference returned by luaL_ref. - - - - - -

luaL_Reg

-
typedef struct luaL_Reg {
-  const char *name;
-  lua_CFunction func;
-} luaL_Reg;
- -

-Type for arrays of functions to be registered by -luaL_setfuncs. -name is the function name and func is a pointer to -the function. -Any array of luaL_Reg must end with a sentinel entry -in which both name and func are NULL. - - - - - -

luaL_requiref

-[-0, +1, e] -

void luaL_requiref (lua_State *L, const char *modname,
-                    lua_CFunction openf, int glb);
- -

-If package.loaded[modname] is not true, -calls the function openf with the string modname as an argument -and sets the call result to package.loaded[modname], -as if that function has been called through require. - - -

-If glb is true, -also stores the module into the global modname. - - -

-Leaves a copy of the module on the stack. - - - - - -

luaL_setfuncs

-[-nup, +0, m] -

void luaL_setfuncs (lua_State *L, const luaL_Reg *l, int nup);
- -

-Registers all functions in the array l -(see luaL_Reg) into the table on the top of the stack -(below optional upvalues, see next). - - -

-When nup is not zero, -all functions are created with nup upvalues, -initialized with copies of the nup values -previously pushed on the stack -on top of the library table. -These values are popped from the stack after the registration. - - -

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

const char *luaL_typeerror (lua_State *L,
-                                      int arg,
-                                      const char *tname);
- -

-Raises a type error for the argument arg -of the C function that called it, -using a standard message; -tname is a "name" for the expected type. -This function never returns. - - - - - -

luaL_typename

-[-0, +0, –] -

const char *luaL_typename (lua_State *L, int index);
- -

-Returns the name of the type of the value at the given index. - - - - - -

luaL_unref

-[-0, +0, –] -

void luaL_unref (lua_State *L, int t, int ref);
- -

-Releases the reference ref from the table at index t -(see luaL_ref). -The entry is removed from the table, -so that the referred object can be collected. -The reference ref is also freed to be used again. - - -

-If ref is LUA_NOREF or LUA_REFNIL, -luaL_unref does nothing. - - - - - -

luaL_where

-[-0, +1, m] -

void luaL_where (lua_State *L, int lvl);
- -

-Pushes onto the stack a string identifying the current position -of the control at level lvl in the call stack. -Typically this string has the following format: - -

-     chunkname:currentline:
-

-Level 0 is the running function, -level 1 is the function that called the running function, -etc. - - -

-This function is used to build a prefix for error messages. - - - - - - - -

6 – The Standard Libraries

- - - -

-The standard Lua libraries provide useful functions -that are implemented in C through the C API. -Some of these functions provide essential services to the language -(e.g., type and getmetatable); -others provide access to outside services (e.g., I/O); -and others could be implemented in Lua itself, -but that for different reasons -deserve an implementation in C (e.g., table.sort). - - -

-All libraries are implemented through the official C API -and are provided as separate C modules. -Unless otherwise noted, -these library functions do not adjust its number of arguments -to its expected parameters. -For instance, a function documented as foo(arg) -should not be called without an argument. - - -

-The notation fail means a false value representing -some kind of failure. -(Currently, fail is equal to nil, -but that may change in future versions. -The recommendation is to always test the success of these functions -with (not status), instead of (status == nil).) - - -

-Currently, Lua has the following standard libraries: - -

    - -
  • basic library (§6.1);
    • - -
  • coroutine library (§6.2);
    • - -
  • package library (§6.3);
    • - -
  • string manipulation (§6.4);
    • - -
  • basic UTF-8 support (§6.5);
    • - -
  • table manipulation (§6.6);
    • - -
  • mathematical functions (§6.7) (sin, log, etc.);
    • - -
  • input and output (§6.8);
    • - -
  • operating system facilities (§6.9);
    • - -
  • debug facilities (§6.10).
    • - -

-Except for the basic and the package libraries, -each library provides all its functions as fields of a global table -or as methods of its objects. - - -

-To have access to these libraries, -the C host program should call the luaL_openlibs function, -which opens all standard libraries. -Alternatively, -the host program can open them individually by using -luaL_requiref to call -luaopen_base (for the basic library), -luaopen_package (for the package library), -luaopen_coroutine (for the coroutine library), -luaopen_string (for the string library), -luaopen_utf8 (for the UTF-8 library), -luaopen_table (for the table library), -luaopen_math (for the mathematical library), -luaopen_io (for the I/O library), -luaopen_os (for the operating system library), -and luaopen_debug (for the debug library). -These functions are declared in lualib.h. - - - - - -

6.1 – Basic Functions

- -

-The basic library provides core functions to Lua. -If you do not include this library in your application, -you should check carefully whether you need to provide -implementations for some of its facilities. - - -

-

assert (v [, message])

- - -

-Raises an error if -the value of its argument v is false (i.e., nil or false); -otherwise, returns all its arguments. -In case of error, -message is the error object; -when absent, it defaults to "assertion failed!" - - - - -

-

collectgarbage ([opt [, arg]])

- - -

-This function is a generic interface to the garbage collector. -It performs different functions according to its first argument, opt: - -

    - -
  • "collect": -Performs a full garbage-collection cycle. -This is the default option. -
    • - -
  • "stop": -Stops automatic execution of the garbage collector. -The collector will run only when explicitly invoked, -until a call to restart it. -
    • - -
  • "restart": -Restarts automatic execution of the garbage collector. -
    • - -
  • "count": -Returns the total memory in use by Lua in Kbytes. -The value has a fractional part, -so that it multiplied by 1024 -gives the exact number of bytes in use by Lua. -
    • - -
  • "step": -Performs a garbage-collection step. -The step "size" is controlled by arg. -With a zero value, -the collector will perform one basic (indivisible) step. -For non-zero values, -the collector will perform as if that amount of memory -(in Kbytes) had been allocated by Lua. -Returns true if the step finished a collection cycle. -
    • - -
  • "isrunning": -Returns a boolean that tells whether the collector is running -(i.e., not stopped). -
    • - -
  • "incremental": -Change the collector mode to incremental. -This option can be followed by three numbers: -the garbage-collector pause, -the step multiplier, -and the step size (see §2.5.1). -A zero means to not change that value. -
    • - -
  • "generational": -Change the collector mode to generational. -This option can be followed by two numbers: -the garbage-collector minor multiplier -and the major multiplier (see §2.5.2). -A zero means to not change that value. -
    • - -

-See §2.5 for more details about garbage collection -and some of these options. - - -

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

-

package.loadlib (libname, funcname)

- - -

-Dynamically links the host program with the C library libname. - - -

-If funcname is "*", -then it only links with the library, -making the symbols exported by the library -available to other dynamically linked libraries. -Otherwise, -it looks for a function funcname inside the library -and returns this function as a C function. -So, funcname must follow the lua_CFunction prototype -(see lua_CFunction). - - -

-This is a low-level function. -It completely bypasses the package and module system. -Unlike require, -it does not perform any path searching and -does not automatically adds extensions. -libname must be the complete file name of the C library, -including if necessary a path and an extension. -funcname must be the exact name exported by the C library -(which may depend on the C compiler and linker used). - - -

-This function is not supported by Standard C. -As such, it is only available on some platforms -(Windows, Linux, Mac OS X, Solaris, BSD, -plus other Unix systems that support the dlfcn standard). - - -

-This function is inherently insecure, -as it allows Lua to call any function in any readable dynamic -library in the system. -(Lua calls any function assuming the function -has a proper prototype and respects a proper protocol -(see lua_CFunction). -Therefore, -calling an arbitrary function in an arbitrary dynamic library -more often than not results in an access violation.) - - - - -

-

package.path

- - -

-A string with the path used by require -to search for a Lua loader. - - -

-At start-up, Lua initializes this variable with -the value of the environment variable LUA_PATH_5_4 or -the environment variable LUA_PATH or -with a default path defined in luaconf.h, -if those environment variables are not defined. -A ";;" in the value of the environment variable -is replaced by the default path. - - - - -

-

package.preload

- - -

-A table to store loaders for specific modules -(see require). - - -

-This variable is only a reference to the real table; -assignments to this variable do not change the -table used by require. - - - - -

-

package.searchers

- - -

-A table used by require to control how to find modules. - - -

-Each entry in this table is a searcher function. -When looking for a module, -require calls each of these searchers in ascending order, -with the module name (the argument given to require) as its -sole argument. -If the searcher finds the module, -it returns another function, the module loader, -plus an extra value, a loader data, -that will be passed to that loader and -returned as a second result by require. -If it cannot find the module, -it returns a string explaining why -(or nil if it has nothing to say). - - -

-Lua initializes this table with four searcher functions. - - -

-The first searcher simply looks for a loader in the -package.preload table. - - -

-The second searcher looks for a loader as a Lua library, -using the path stored at package.path. -The search is done as described in function package.searchpath. - - -

-The third searcher looks for a loader as a C library, -using the path given by the variable package.cpath. -Again, -the search is done as described in function package.searchpath. -For instance, -if the C path is the string - -

-     "./?.so;./?.dll;/usr/local/?/init.so"
-

-the searcher for module foo -will try to open the files ./foo.so, ./foo.dll, -and /usr/local/foo/init.so, in that order. -Once it finds a C library, -this searcher first uses a dynamic link facility to link the -application with the library. -Then it tries to find a C function inside the library to -be used as the loader. -The name of this C function is the string "luaopen_" -concatenated with a copy of the module name where each dot -is replaced by an underscore. -Moreover, if the module name has a hyphen, -its suffix after (and including) the first hyphen is removed. -For instance, if the module name is a.b.c-v2.1, -the function name will be luaopen_a_b_c. - - -

-The fourth searcher tries an all-in-one loader. -It searches the C path for a library for -the root name of the given module. -For instance, when requiring a.b.c, -it will search for a C library for a. -If found, it looks into it for an open function for -the submodule; -in our example, that would be luaopen_a_b_c. -With this facility, a package can pack several C submodules -into one single library, -with each submodule keeping its original open function. - - -

-All searchers except the first one (preload) return as the extra value -the file path where the module was found, -as returned by package.searchpath. -The first searcher always returns the string ":preload:". - - -

-Searchers should raise no errors and have no side effects in Lua. -(They may have side effects in C, -for instance by linking the application with a library.) - - - - -

-

package.searchpath (name, path [, sep [, rep]])

- - -

-Searches for the given name in the given path. - - -

-A path is a string containing a sequence of -templates separated by semicolons. -For each template, -the function replaces each interrogation mark (if any) -in the template with a copy of name -wherein all occurrences of sep -(a dot, by default) -were replaced by rep -(the system's directory separator, by default), -and then tries to open the resulting file name. - - -

-For instance, if the path is the string - -

-     "./?.lua;./?.lc;/usr/local/?/init.lua"
-

-the search for the name foo.a -will try to open the files -./foo/a.lua, ./foo/a.lc, and -/usr/local/foo/a/init.lua, in that order. - - -

-Returns the resulting name of the first file that it can -open in read mode (after closing the file), -or fail plus an error message if none succeeds. -(This error message lists all file names it tried to open.) - - - - - - - -

6.4 – String Manipulation

- - - -

-This library provides generic functions for string manipulation, -such as finding and extracting substrings, and pattern matching. -When indexing a string in Lua, the first character is at position 1 -(not at 0, as in C). -Indices are allowed to be negative and are interpreted as indexing backwards, -from the end of the string. -Thus, the last character is at position -1, and so on. - - -

-The string library provides all its functions inside the table -string. -It also sets a metatable for strings -where the __index field points to the string table. -Therefore, you can use the string functions in object-oriented style. -For instance, string.byte(s,i) -can be written as s:byte(i). - - -

-The string library assumes one-byte character encodings. - - -

-

string.byte (s [, i [, j]])

-Returns the internal numeric codes of the characters s[i], -s[i+1], ..., s[j]. -The default value for i is 1; -the default value for j is i. -These indices are corrected -following the same rules of function string.sub. - - -

-Numeric codes are not necessarily portable across platforms. - - - - -

-

string.char (···)

-Receives zero or more integers. -Returns a string with length equal to the number of arguments, -in which each character has the internal numeric code equal -to its corresponding argument. - - -

-Numeric codes are not necessarily portable across platforms. - - - - -

-

string.dump (function [, strip])

- - -

-Returns a string containing a binary representation -(a binary chunk) -of the given function, -so that a later load on this string returns -a copy of the function (but with new upvalues). -If strip is a true value, -the binary representation may not include all debug information -about the function, -to save space. - - -

-Functions with upvalues have only their number of upvalues saved. -When (re)loaded, -those upvalues receive fresh instances. -(See the load function for details about -how these upvalues are initialized. -You can use the debug library to serialize -and reload the upvalues of a function -in a way adequate to your needs.) - - - - -

-

string.find (s, pattern [, init [, plain]])

- - -

-Looks for the first match of -pattern (see §6.4.1) in the string s. -If it finds a match, then find returns the indices of s -where this occurrence starts and ends; -otherwise, it returns fail. -A third, optional numeric argument init specifies -where to start the search; -its default value is 1 and can be negative. -A 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 size of a string resulting from string.pack -with the given format. -The format string cannot have the variable-length options -'s' or 'z' (see §6.4.2). - - - - -

-

string.rep (s, n [, sep])

- - -

-Returns a string that is the concatenation of n copies of -the string s separated by the string sep. -The default value for sep is the empty string -(that is, no separator). -Returns the empty string if n is not positive. - - -

-(Note that it is very easy to exhaust the memory of your machine -with a single call to this function.) - - - - -

-

string.reverse (s)

- - -

-Returns a string that is the string s reversed. - - - - -

-

string.sub (s, i [, j])

- - -

-Returns the substring of s that -starts at i and continues until j; -i and j can be negative. -If j is absent, then it is assumed to be equal to -1 -(which is the same as the string length). -In particular, -the call string.sub(s,1,j) returns a prefix of s -with length j, -and string.sub(s, -i) (for a positive i) -returns a suffix of s -with length i. - - -

-If, after the translation of negative indices, -i is less than 1, -it is corrected to 1. -If j is greater than the string length, -it is corrected to that length. -If, after these corrections, -i is greater than j, -the function returns the empty string. - - - - -

-

string.unpack (fmt, s [, pos])

- - -

-Returns the values packed in string s (see string.pack) -according to the format string fmt (see §6.4.2). -An optional pos marks where -to start reading in s (default is 1). -After the read values, -this function also returns the index of the first unread byte in s. - - - - -

-

string.upper (s)

- - -

-Receives a string and returns a copy of this string with all -lowercase letters changed to uppercase. -All other characters are left unchanged. -The definition of what a lowercase letter is depends on the current locale. - - - - - - - -

6.4.1 – Patterns

- - - -

-Patterns in Lua are described by regular strings, -which are interpreted as patterns by the pattern-matching functions -string.find, -string.gmatch, -string.gsub, -and string.match. -This section describes the syntax and the meaning -(that is, what they match) of these strings. - - - - - -

Character Class:

-A character class is used to represent a set of characters. -The following combinations are allowed in describing a character class: - -

    - -
  • x: -(where x is not one of the magic characters -^$()%.[]*+-?) -represents the character x itself. -
    • - -
  • .: (a dot) represents all characters.
    • - -
  • %a: represents all letters.
    • - -
  • %c: represents all control characters.
    • - -
  • %d: represents all digits.
    • - -
  • %g: represents all printable characters except space.
    • - -
  • %l: represents all lowercase letters.
    • - -
  • %p: represents all punctuation characters.
    • - -
  • %s: represents all space characters.
    • - -
  • %u: represents all uppercase letters.
    • - -
  • %w: represents all alphanumeric characters.
    • - -
  • %x: represents all hexadecimal digits.
    • - -
  • %x: (where x is any non-alphanumeric character) -represents the character x. -This is the standard way to escape the magic characters. -Any non-alphanumeric character -(including all punctuation characters, even the non-magical) -can be preceded by a '%' to represent itself in a pattern. -
    • - -
  • [set]: -represents the class which is the union of all -characters in set. -A range of characters can be specified by -separating the end characters of the range, -in ascending order, with a '-'. -All classes %x described above can also be used as -components in set. -All other characters in set represent themselves. -For example, [%w_] (or [_%w]) -represents all alphanumeric characters plus the underscore, -[0-7] represents the octal digits, -and [0-7%l%-] represents the octal digits plus -the lowercase letters plus the '-' character. - - -

    -You can put a closing square bracket in a set -by positioning it as the first character in the set. -You can put a hyphen in a set -by positioning it as the first or the last character in the set. -(You can also use an escape for both cases.) - - -

    -The interaction between ranges and classes is not defined. -Therefore, patterns like [%a-z] or [a-%%] -have no meaning. -

    • - -
  • [^set]: -represents the complement of set, -where set is interpreted as above. -
    • - -

-For all classes represented by single letters (%a, %c, etc.), -the corresponding uppercase letter represents the complement of the class. -For instance, %S represents all non-space characters. - - -

-The definitions of letter, space, and other character groups -depend on the current locale. -In particular, the class [a-z] may not be equivalent to %l. - - - - - -

Pattern Item:

-A pattern item can be - -

    - -
  • -a single character class, -which matches any single character in the class; -
    • - -
  • -a single character class followed by '*', -which matches sequences of zero or more characters in the class. -These repetition items will always match the longest possible sequence; -
    • - -
  • -a single character class followed by '+', -which matches sequences of one or more characters in the class. -These repetition items will always match the longest possible sequence; -
    • - -
  • -a single character class followed by '-', -which also matches sequences of zero or more characters in the class. -Unlike '*', -these repetition items will always match the shortest possible sequence; -
    • - -
  • -a single character class followed by '?', -which matches zero or one occurrence of a character in the class. -It always matches one occurrence if possible; -
    • - -
  • -%n, for n between 1 and 9; -such item matches a substring equal to the n-th captured string -(see below); -
    • - -
  • -%bxy, where x and y are two distinct characters; -such item matches strings that start with x, end with y, -and where the x and y are balanced. -This means that, if one reads the string from left to right, -counting +1 for an x and -1 for a y, -the ending y is the first y where the count reaches 0. -For instance, the item %b() matches expressions with -balanced parentheses. -
    • - -
  • -%f[set], a frontier pattern; -such item matches an empty string at any position such that -the next character belongs to set -and the previous character does not belong to set. -The set set is interpreted as previously described. -The beginning and the end of the subject are handled as if -they were the character '\0'. -
    • - -
- - - - -

Pattern:

-A pattern is a sequence of pattern items. -A caret '^' at the beginning of a pattern anchors the match at the -beginning of the subject string. -A '$' at the end of a pattern anchors the match at the -end of the subject string. -At other positions, -'^' and '$' have no special meaning and represent themselves. - - - - - -

Captures:

-A pattern can contain sub-patterns enclosed in parentheses; -they describe captures. -When a match succeeds, the substrings of the subject string -that match captures are stored (captured) for future use. -Captures are numbered according to their left parentheses. -For instance, in the pattern "(a*(.)%w(%s*))", -the part of the string matching "a*(.)%w(%s*)" is -stored as the first capture, and therefore has number 1; -the character matching "." is captured with number 2, -and the part matching "%s*" has number 3. - - -

-As a special case, the capture () captures -the current string position (a number). -For instance, if we apply the pattern "()aa()" on the -string "flaaap", there will be two captures: 3 and 5. - - - - - -

Multiple matches:

-The function string.gsub and the iterator string.gmatch -match multiple occurrences of the given pattern in the subject. -For these functions, -a new match is considered valid only -if it ends at least one byte after the end of the previous match. -In other words, the pattern machine never accepts the -empty string as a match immediately after another match. -As an example, -consider the results of the following code: - -

-     > string.gsub("abc", "()a*()", print);
-     --> 1   2
-     --> 3   3
-     --> 4   4
-

-The second and third results come from Lua matching an empty -string after 'b' and another one after 'c'. -Lua does not match an empty string after 'a', -because it would end at the same position of the previous match. - - - - - - - -

6.4.2 – Format Strings for Pack and Unpack

- -

-The first argument to string.pack, -string.packsize, and string.unpack -is a format string, -which describes the layout of the structure being created or read. - - -

-A format string is a sequence of conversion options. -The conversion options are as follows: - -

    -
  • <: sets little endian
    • -
  • >: sets big endian
    • -
  • =: sets native endian
    • -
  • ![n]: sets maximum alignment to n -(default is native alignment)
    • -
  • b: a signed byte (char)
    • -
  • B: an unsigned byte (char)
    • -
  • h: a signed short (native size)
    • -
  • H: an unsigned short (native size)
    • -
  • l: a signed long (native size)
    • -
  • L: an unsigned long (native size)
    • -
  • j: a lua_Integer
    • -
  • J: a lua_Unsigned
    • -
  • T: a size_t (native size)
    • -
  • i[n]: a signed int with n bytes -(default is native size)
    • -
  • I[n]: an unsigned int with n bytes -(default is native size)
    • -
  • f: a float (native size)
    • -
  • d: a double (native size)
    • -
  • n: a lua_Number
    • -
  • cn: a fixed-sized string with n bytes
    • -
  • z: a zero-terminated string
    • -
  • s[n]: a string preceded by its length -coded as an unsigned integer with n bytes -(default is a size_t)
    • -
  • x: one byte of padding
    • -
  • Xop: an empty item that aligns -according to option op -(which is otherwise ignored)
    • -
  • ' ': (space) ignored
    • -

-(A "[n]" means an optional integral numeral.) -Except for padding, spaces, and configurations -(options "xX <=>!"), -each option corresponds to an argument in string.pack -or a result in string.unpack. - - -

-For options "!n", "sn", "in", and "In", -n can be any integer between 1 and 16. -All integral options check overflows; -string.pack checks whether the given value fits in the given size; -string.unpack checks whether the read value fits in a Lua integer. -For the unsigned options, -Lua integers are treated as unsigned values too. - - -

-Any format string starts as if prefixed by "!1=", -that is, -with maximum alignment of 1 (no alignment) -and native endianness. - - -

-Native endianness assumes that the whole system is -either big or little endian. -The packing functions will not emulate correctly the behavior -of mixed-endian formats. - - -

-Alignment works as follows: -For each option, -the format gets extra padding until the data starts -at an offset that is a multiple of the minimum between the -option size and the maximum alignment; -this minimum must be a power of 2. -Options "c" and "z" are not aligned; -option "s" follows the alignment of its starting integer. - - -

-All padding is filled with zeros by string.pack -and ignored by string.unpack. - - - - - - - -

6.5 – UTF-8 Support

- -

-This library provides basic support for UTF-8 encoding. -It provides all its functions inside the table utf8. -This library does not provide any support for Unicode other -than the handling of the encoding. -Any operation that needs the meaning of a character, -such as character classification, is outside its scope. - - -

-Unless stated otherwise, -all functions that expect a byte position as a parameter -assume that the given position is either the start of a byte sequence -or one plus the length of the subject string. -As in the string library, -negative indices count from the end of the string. - - -

-Functions that create byte sequences -accept all values up to 0x7FFFFFFF, -as defined in the original UTF-8 specification; -that implies byte sequences of up to six bytes. - - -

-Functions that interpret byte sequences only accept -valid sequences (well formed and not overlong). -By default, they only accept byte sequences -that result in valid Unicode code points, -rejecting values greater than 10FFFF and surrogates. -A boolean argument lax, when available, -lifts these checks, -so that all values up to 0x7FFFFFFF are accepted. -(Not well formed and overlong sequences are still rejected.) - - -

-

utf8.char (···)

- - -

-Receives zero or more integers, -converts each one to its corresponding UTF-8 byte sequence -and returns a string with the concatenation of all these sequences. - - - - -

-

utf8.charpattern

- - -

-The pattern (a string, not a function) "[\0-\x7F\xC2-\xFD][\x80-\xBF]*" -(see §6.4.1), -which matches exactly one UTF-8 byte sequence, -assuming that the subject is a valid UTF-8 string. - - - - -

-

utf8.codes (s [, lax])

- - -

-Returns values so that the construction - -

-     for p, c in utf8.codes(s) do body end
-

-will iterate over all UTF-8 characters in string s, -with p being the position (in bytes) and c the code point -of each character. -It raises an error if it meets any invalid byte sequence. - - - - -

-

utf8.codepoint (s [, i [, j [, lax]]])

- - -

-Returns the code points (as integers) from all characters in s -that start between byte position i and j (both included). -The default for i is 1 and for j is i. -It raises an error if it meets any invalid byte sequence. - - - - -

-

utf8.len (s [, i [, j [, lax]]])

- - -

-Returns the number of UTF-8 characters in string s -that start between positions i and j (both inclusive). -The default for i is 1 and for j is -1. -If it finds any invalid byte sequence, -returns fail plus the position of the first invalid byte. - - - - -

-

utf8.offset (s, n [, i])

- - -

-Returns the position (in bytes) where the encoding of the -n-th character of s -(counting from position i) starts. -A negative n gets characters before position i. -The default for i is 1 when n is non-negative -and #s + 1 otherwise, -so that utf8.offset(s, -n) gets the offset of the -n-th character from the end of the string. -If the specified character is neither in the subject -nor right after its end, -the function returns fail. - - -

-As a special case, -when n is 0 the function returns the start of the encoding -of the character that contains the i-th byte of s. - - -

-This function assumes that s is a valid UTF-8 string. - - - - - - - -

6.6 – Table Manipulation

- -

-This library provides generic functions for table manipulation. -It provides all its functions inside the table table. - - -

-Remember that, whenever an operation needs the length of a table, -all caveats about the length operator apply (see §3.4.7). -All functions ignore non-numeric keys -in the tables given as arguments. - - -

-

table.concat (list [, sep [, i [, j]]])

- - -

-Given a list where all elements are strings or numbers, -returns the string list[i]..sep..list[i+1] ··· sep..list[j]. -The default value for sep is the empty string, -the default for i is 1, -and the default for j is #list. -If i is greater than j, returns the empty string. - - - - -

-

table.insert (list, [pos,] value)

- - -

-Inserts element value at position pos in list, -shifting up the elements -list[pos], list[pos+1], ···, list[#list]. -The default value for pos is #list+1, -so that a call table.insert(t,x) inserts x at the end -of the list t. - - - - -

-

table.move (a1, f, e, t [,a2])

- - -

-Moves elements from the table a1 to the table a2, -performing the equivalent to the following -multiple assignment: -a2[t],··· = a1[f],···,a1[e]. -The default for a2 is a1. -The destination range can overlap with the source range. -The number of elements to be moved must fit in a Lua integer. - - -

-Returns the destination table a2. - - - - -

-

table.pack (···)

- - -

-Returns a new table with all arguments stored into keys 1, 2, etc. -and with a field "n" with the total number of arguments. -Note that the resulting table may not be a sequence, -if some arguments are nil. - - - - -

-

table.remove (list [, pos])

- - -

-Removes from list the element at position pos, -returning the value of the removed element. -When pos is an integer between 1 and #list, -it shifts down the elements -list[pos+1], list[pos+2], ···, list[#list] -and erases element list[#list]; -The index pos can also be 0 when #list is 0, -or #list + 1. - - -

-The default value for pos is #list, -so that a call table.remove(l) removes the last element -of the list l. - - - - -

-

table.sort (list [, comp])

- - -

-Sorts the list elements in a given order, in-place, -from list[1] to list[#list]. -If comp is given, -then it must be a function that receives two list elements -and returns true when the first element must come -before the second in the final order, -so that, after the sort, -i <= j implies not comp(list[j],list[i]). -If comp is not given, -then the standard Lua operator < is used instead. - - -

-The comp function must define a consistent order; -more formally, the function must define a strict weak order. -(A weak order is similar to a total order, -but it can equate different elements for comparison purposes.) - - -

-The sort algorithm is not stable: -Different elements considered equal by the given order -may have their relative positions changed by the sort. - - - - -

-

table.unpack (list [, i [, j]])

- - -

-Returns the elements from the given list. -This function is equivalent to - -

-     return list[i], list[i+1], ···, list[j]
-

-By default, i is 1 and j is #list. - - - - - - - -

6.7 – Mathematical Functions

- -

-This library provides basic mathematical functions. -It provides all its functions and constants inside the table math. -Functions with the annotation "integer/float" give -integer results for integer arguments -and float results for non-integer arguments. -The rounding functions -math.ceil, math.floor, and math.modf -return an integer when the result fits in the range of an integer, -or a float otherwise. - - -

-

math.abs (x)

- - -

-Returns the maximum value between x and -x. (integer/float) - - - - -

-

math.acos (x)

- - -

-Returns the arc cosine of x (in radians). - - - - -

-

math.asin (x)

- - -

-Returns the arc sine of x (in radians). - - - - -

-

math.atan (y [, x])

- - -

- -Returns the arc tangent of y/x (in radians), -but uses the signs of both arguments to find the -quadrant of the result. -It also handles correctly the case of x being zero. - - -

-The default value for x is 1, -so that the call math.atan(y) -returns the arc tangent of y. - - - - -

-

math.ceil (x)

- - -

-Returns the smallest integral value greater than or equal to x. - - - - -

-

math.cos (x)

- - -

-Returns the cosine of x (assumed to be in radians). - - - - -

-

math.deg (x)

- - -

-Converts the angle x from radians to degrees. - - - - -

-

math.exp (x)

- - -

-Returns the value ex -(where e is the base of natural logarithms). - - - - -

-

math.floor (x)

- - -

-Returns the largest integral value less than or equal to x. - - - - -

-

math.fmod (x, y)

- - -

-Returns the remainder of the division of x by y -that rounds the quotient towards zero. (integer/float) - - - - -

-

math.huge

- - -

-The float value HUGE_VAL, -a value greater than any other numeric value. - - - - -

-

math.log (x [, base])

- - -

-Returns the logarithm of x in the given base. -The default for base is e -(so that the function returns the natural logarithm of x). - - - - -

-

math.max (x, ···)

- - -

-Returns the argument with the maximum value, -according to the Lua operator <. - - - - -

-

math.maxinteger

-An integer with the maximum value for an integer. - - - - -

-

math.min (x, ···)

- - -

-Returns the argument with the minimum value, -according to the Lua operator <. - - - - -

-

math.mininteger

-An integer with the minimum value for an integer. - - - - -

-

math.modf (x)

- - -

-Returns the integral part of x and the fractional part of x. -Its second result is always a float. - - - - -

-

math.pi

- - -

-The value of π. - - - - -

-

math.rad (x)

- - -

-Converts the angle x from degrees to radians. - - - - -

-

math.random ([m [, n]])

- - -

-When called without arguments, -returns a pseudo-random float with uniform distribution -in the range [0,1). -When called with two integers m and n, -math.random returns a pseudo-random integer -with uniform distribution in the range [m, n]. -The call math.random(n), for a positive n, -is equivalent to math.random(1,n). -The call math.random(0) produces an integer with -all bits (pseudo)random. - - -

-This function uses the xoshiro256** algorithm to produce -pseudo-random 64-bit integers, -which are the results of calls with argument 0. -Other results (ranges and floats) -are unbiased extracted from these integers. - - -

-Lua initializes its pseudo-random generator with the equivalent of -a call to math.randomseed with no arguments, -so that math.random should generate -different sequences of results each time the program runs. - - - - -

-

math.randomseed ([x [, y]])

- - -

-When called with at least one argument, -the integer parameters x and y are -joined into a 128-bit seed that -is used to reinitialize the pseudo-random generator; -equal seeds produce equal sequences of numbers. -The default for y is zero. - - -

-When called with no arguments, -Lua generates a seed with -a weak attempt for randomness. - - -

-This function returns the two seed components -that were effectively used, -so that setting them again repeats the sequence. - - -

-To ensure a required level of randomness to the initial state -(or contrarily, to have a deterministic sequence, -for instance when debugging a program), -you should call math.randomseed with explicit arguments. - - - - -

-

math.sin (x)

- - -

-Returns the sine of x (assumed to be in radians). - - - - -

-

math.sqrt (x)

- - -

-Returns the square root of x. -(You can also use the expression x^0.5 to compute this value.) - - - - -

-

math.tan (x)

- - -

-Returns the tangent of x (assumed to be in radians). - - - - -

-

math.tointeger (x)

- - -

-If the value x is convertible to an integer, -returns that integer. -Otherwise, returns fail. - - - - -

-

math.type (x)

- - -

-Returns "integer" if x is an integer, -"float" if it is a float, -or fail if x is not a number. - - - - -

-

math.ult (m, n)

- - -

-Returns a boolean, -true if and only if integer m is below integer n when -they are compared as unsigned integers. - - - - - - - -

6.8 – Input and Output Facilities

- -

-The I/O library provides two different styles for file manipulation. -The first one uses implicit file handles; -that is, there are operations to set a default input file and a -default output file, -and all input/output operations are done over these default files. -The second style uses explicit file handles. - - -

-When using implicit file handles, -all operations are supplied by table io. -When using explicit file handles, -the operation io.open returns a file handle -and then all operations are supplied as methods of the file handle. - - -

-The metatable for file handles provides metamethods -for __gc and __close that try -to close the file when called. - - -

-The table io also provides -three predefined file handles with their usual meanings from C: -io.stdin, io.stdout, and io.stderr. -The I/O library never closes these files. - - -

-Unless otherwise stated, -all I/O functions return fail on failure, -plus an error message as a second result and -a system-dependent error code as a third result, -and some non-false value on success. -On non-POSIX systems, -the computation of the error message and error code -in case of errors -may be not thread safe, -because they rely on the global C variable errno. - - -

-

io.close ([file])

- - -

-Equivalent to file:close(). -Without a file, closes the default output file. - - - - -

-

io.flush ()

- - -

-Equivalent to io.output():flush(). - - - - -

-

io.input ([file])

- - -

-When called with a file name, it opens the named file (in text mode), -and sets its handle as the default input file. -When called with a file handle, -it simply sets this file handle as the default input file. -When called without arguments, -it returns the current default input file. - - -

-In case of errors this function raises the error, -instead of returning an error code. - - - - -

-

io.lines ([filename, ···])

- - -

-Opens the given file name in read mode -and returns an iterator function that -works like file:lines(···) over the opened file. -When the iterator function fails to read any value, -it automatically closes the file. -Besides the iterator function, -io.lines returns three other values: -two nil values as placeholders, -plus the created file handle. -Therefore, when used in a generic for loop, -the file is closed also if the loop is interrupted by an -error or a break. - - -

-The call io.lines() (with no file name) is equivalent -to io.input():lines("l"); -that is, it iterates over the lines of the default input file. -In this case, the iterator does not close the file when the loop ends. - - -

-In case of errors opening the file, -this function raises the error, -instead of returning an error code. - - - - -

-

io.open (filename [, mode])

- - -

-This function opens a file, -in the mode specified in the string mode. -In case of success, -it returns a new file handle. - - -

-The mode string can be any of the following: - -

    -
  • "r": read mode (the default);
    • -
  • "w": write mode;
    • -
  • "a": append mode;
    • -
  • "r+": update mode, all previous data is preserved;
    • -
  • "w+": update mode, all previous data is erased;
    • -
  • "a+": append update mode, previous data is preserved, - writing is only allowed at the end of file.
    • -

-The mode string can also have a 'b' at the end, -which is needed in some systems to open the file in binary mode. - - - - -

-

io.output ([file])

- - -

-Similar to io.input, but operates over the default output file. - - - - -

-

io.popen (prog [, mode])

- - -

-This function is system dependent and is not available -on all platforms. - - -

-Starts the program prog in a separated process and returns -a file handle that you can use to read data from this program -(if mode is "r", the default) -or to write data to this program -(if mode is "w"). - - - - -

-

io.read (···)

- - -

-Equivalent to io.input():read(···). - - - - -

-

io.tmpfile ()

- - -

-In case of success, -returns a handle for a temporary file. -This file is opened in update mode -and it is automatically removed when the program ends. - - - - -

-

io.type (obj)

- - -

-Checks whether obj is a valid file handle. -Returns the string "file" if obj is an open file handle, -"closed file" if obj is a closed file handle, -or fail if obj is not a file handle. - - - - -

-

io.write (···)

- - -

-Equivalent to io.output():write(···). - - - - -

-

file:close ()

- - -

-Closes file. -Note that files are automatically closed when -their handles are garbage collected, -but that takes an unpredictable amount of time to happen. - - -

-When closing a file handle created with io.popen, -file:close returns the same values -returned by os.execute. - - - - -

-

file:flush ()

- - -

-Saves any written data to file. - - - - -

-

file:lines (···)

- - -

-Returns an iterator function that, -each time it is called, -reads the file according to the given formats. -When no format is given, -uses "l" as a default. -As an example, the construction - -

-     for c in file:lines(1) do body end
-

-will iterate over all characters of the file, -starting at the current position. -Unlike io.lines, this function does not close the file -when the loop ends. - - - - -

-

file:read (···)

- - -

-Reads the file file, -according to the given formats, which specify what to read. -For each format, -the function returns a string or a number with the characters read, -or fail if it cannot read data with the specified format. -(In this latter case, -the function does not read subsequent formats.) -When called without arguments, -it uses a default format that reads the next line -(see below). - - -

-The available formats are - -

    - -
  • "n": -reads a numeral and returns it as a float or an integer, -following the lexical conventions of Lua. -(The numeral may have leading whitespaces and a sign.) -This format always reads the longest input sequence that -is a valid prefix for a numeral; -if that prefix does not form a valid numeral -(e.g., an empty string, "0x", or "3.4e-") -or it is too long (more than 200 characters), -it is discarded and the format returns fail. -
    • - -
  • "a": -reads the whole file, starting at the current position. -On end of file, it returns the empty string; -this format never fails. -
    • - -
  • "l": -reads the next line skipping the end of line, -returning fail on end of file. -This is the default format. -
    • - -
  • "L": -reads the next line keeping the end-of-line character (if present), -returning fail on end of file. -
    • - -
  • number: -reads a string with up to this number of bytes, -returning fail on end of file. -If number is zero, -it reads nothing and returns an empty string, -or fail on end of file. -
    • - -

-The formats "l" and "L" should be used only for text files. - - - - -

-

file:seek ([whence [, offset]])

- - -

-Sets and gets the file position, -measured from the beginning of the file, -to the position given by offset plus a base -specified by the string whence, as follows: - -

    -
  • "set": base is position 0 (beginning of the file);
    • -
  • "cur": base is current position;
    • -
  • "end": base is end of file;
    • -

-In case of success, seek returns the final file position, -measured in bytes from the beginning of the file. -If seek fails, it returns fail, -plus a string describing the error. - - -

-The default value for whence is "cur", -and for offset is 0. -Therefore, the call file:seek() returns the current -file position, without changing it; -the call file:seek("set") sets the position to the -beginning of the file (and returns 0); -and the call file:seek("end") sets the position to the -end of the file, and returns its size. - - - - -

-

file:setvbuf (mode [, size])

- - -

-Sets the buffering mode for a file. -There are three available modes: - -

    -
  • "no": no buffering.
    • -
  • "full": full buffering.
    • -
  • "line": line buffering.
    • -
- -

-For the last two cases, -size is a hint for the size of the buffer, in bytes. -The default is an appropriate size. - - -

-The specific behavior of each mode is non portable; -check the underlying ISO C function setvbuf in your platform for -more details. - - - - -

-

file:write (···)

- - -

-Writes the value of each of its arguments to file. -The arguments must be strings or numbers. - - -

-In case of success, this function returns file. - - - - - - - -

6.9 – Operating System Facilities

- -

-This library is implemented through table os. - - -

-

os.clock ()

- - -

-Returns an approximation of the amount in seconds of CPU time -used by the program, -as returned by the underlying ISO C function clock. - - - - -

-

os.date ([format [, time]])

- - -

-Returns a string or a table containing date and time, -formatted according to the given string format. - - -

-If the time argument is present, -this is the time to be formatted -(see the os.time function for a description of this value). -Otherwise, date formats the current time. - - -

-If format starts with '!', -then the date is formatted in Coordinated Universal Time. -After this optional character, -if format is the string "*t", -then date returns a table with the following fields: -year, month (1–12), day (1–31), -hour (0–23), min (0–59), -sec (0–61, due to leap seconds), -wday (weekday, 1–7, Sunday is 1), -yday (day of the year, 1–366), -and isdst (daylight saving flag, a boolean). -This last field may be absent -if the information is not available. - - -

-If format is not "*t", -then date returns the date as a string, -formatted according to the same rules as the ISO C function strftime. - - -

-If format is absent, it defaults to "%c", -which gives a human-readable date and time representation -using the current locale. - - -

-On non-POSIX systems, -this function may be not thread safe -because of its reliance on C function gmtime and C function localtime. - - - - -

-

os.difftime (t2, t1)

- - -

-Returns the difference, in seconds, -from time t1 to time t2 -(where the times are values returned by os.time). -In POSIX, Windows, and some other systems, -this value is exactly t2-t1. - - - - -

-

os.execute ([command])

- - -

-This function is equivalent to the ISO C function system. -It passes command to be executed by an operating system shell. -Its first result is true -if the command terminated successfully, -or fail otherwise. -After this first result -the function returns a string plus a number, -as follows: - -

    - -
  • "exit": -the command terminated normally; -the following number is the exit status of the command. -
    • - -
  • "signal": -the command was terminated by a signal; -the following number is the signal that terminated the command. -
    • - -
- -

-When called without a command, -os.execute returns a boolean that is true if a shell is available. - - - - -

-

os.exit ([code [, close]])

- - -

-Calls the ISO C function exit to terminate the host program. -If code is true, -the returned status is EXIT_SUCCESS; -if code is false, -the returned status is EXIT_FAILURE; -if code is a number, -the returned status is this number. -The default value for code is true. - - -

-If the optional second argument close is true, -closes the Lua state before exiting. - - - - -

-

os.getenv (varname)

- - -

-Returns the value of the process environment variable varname -or fail if the variable is not defined. - - - - -

-

os.remove (filename)

- - -

-Deletes the file (or empty directory, on POSIX systems) -with the given name. -If this function fails, it returns fail -plus a string describing the error and the error code. -Otherwise, it returns true. - - - - -

-

os.rename (oldname, newname)

- - -

-Renames the file or directory named oldname to newname. -If this function fails, it returns fail, -plus a string describing the error and the error code. -Otherwise, it returns true. - - - - -

-

os.setlocale (locale [, category])

- - -

-Sets the current locale of the program. -locale is a system-dependent string specifying a locale; -category is an optional string describing which category to change: -"all", "collate", "ctype", -"monetary", "numeric", or "time"; -the default category is "all". -The function returns the name of the new locale, -or fail if the request cannot be honored. - - -

-If locale is the empty string, -the current locale is set to an implementation-defined native locale. -If locale is the string "C", -the current locale is set to the standard C locale. - - -

-When called with nil as the first argument, -this function only returns the name of the current locale -for the given category. - - -

-This function may be not thread safe -because of its reliance on C function setlocale. - - - - -

-

os.time ([table])

- - -

-Returns the current time when called without arguments, -or a time representing the local date and time specified by the given table. -This table must have fields year, month, and day, -and may have fields -hour (default is 12), -min (default is 0), -sec (default is 0), -and isdst (default is nil). -Other fields are ignored. -For a description of these fields, see the os.date function. - - -

-When the function is called, -the values in these fields do not need to be inside their valid ranges. -For instance, if sec is -10, -it means 10 seconds before the time specified by the other fields; -if hour is 1000, -it means 1000 hours after the time specified by the other fields. - - -

-The returned value is a number, whose meaning depends on your system. -In POSIX, Windows, and some other systems, -this number counts the number -of seconds since some given start time (the "epoch"). -In other systems, the meaning is not specified, -and the number returned by time can be used only as an argument to -os.date and os.difftime. - - -

-When called with a table, -os.time also normalizes all the fields -documented in the os.date function, -so that they represent the same time as before the call -but with values inside their valid ranges. - - - - -

-

os.tmpname ()

- - -

-Returns a string with a file name that can -be used for a temporary file. -The file must be explicitly opened before its use -and explicitly removed when no longer needed. - - -

-In POSIX systems, -this function also creates a file with that name, -to avoid security risks. -(Someone else might create the file with wrong permissions -in the time between getting the name and creating the file.) -You still have to open the file to use it -and to remove it (even if you do not use it). - - -

-When possible, -you may prefer to use io.tmpfile, -which automatically removes the file when the program ends. - - - - - - - -

6.10 – The Debug Library

- -

-This library provides -the functionality of the debug interface (§4.7) to Lua programs. -You should exert care when using this library. -Several of its functions -violate basic assumptions about Lua code -(e.g., that variables local to a function -cannot be accessed from outside; -that userdata metatables cannot be changed by Lua code; -that Lua programs do not crash) -and therefore can compromise otherwise secure code. -Moreover, some functions in this library may be slow. - - -

-All functions in this library are provided -inside the debug table. -All functions that operate over a thread -have an optional first argument which is the -thread to operate over. -The default is always the current thread. - - -

-

debug.debug ()

- - -

-Enters an interactive mode with the user, -running each string that the user enters. -Using simple commands and other debug facilities, -the user can inspect global and local variables, -change their values, evaluate expressions, and so on. -A line containing only the word cont finishes this function, -so that the caller continues its execution. - - -

-Note that commands for debug.debug are not lexically nested -within any function and so have no direct access to local variables. - - - - -

-

debug.gethook ([thread])

- - -

-Returns the current hook settings of the thread, as three values: -the current hook function, the current hook mask, -and the current hook count, -as set by the debug.sethook function. - - -

-Returns fail if there is no active hook. - - - - -

-

debug.getinfo ([thread,] f [, what])

- - -

-Returns a table with information about a function. -You can give the function directly -or you can give a number as the value of f, -which means the function running at level f of the call stack -of the given thread: -level 0 is the current function (getinfo itself); -level 1 is the function that called getinfo -(except for tail calls, which do not count in the stack); -and so on. -If f is a number greater than the number of active functions, -then getinfo returns fail. - - -

-The returned table can contain all the fields returned by lua_getinfo, -with the string what describing which fields to fill in. -The default for what is to get all information available, -except the table of valid lines. -If present, -the option 'f' -adds a field named func with the function itself. -If present, -the option 'L' -adds a field named activelines with the table of -valid lines. - - -

-For instance, the expression debug.getinfo(1,"n").name returns -a name for the current function, -if a reasonable name can be found, -and the expression debug.getinfo(print) -returns a table with all available information -about the print function. - - - - -

-

debug.getlocal ([thread,] f, local)

- - -

-This function returns the name and the value of the local variable -with index local of the function at level f of the stack. -This function accesses not only explicit local variables, -but also parameters and temporary values. - - -

-The first parameter or local variable has index 1, and so on, -following the order that they are declared in the code, -counting only the variables that are active -in the current scope of the function. -Compile-time constants may not appear in this listing, -if they were optimized away by the compiler. -Negative indices refer to vararg arguments; --1 is the first vararg argument. -The function returns fail -if there is no variable with the given index, -and raises an error when called with a level out of range. -(You can call debug.getinfo to check whether the level is valid.) - - -

-Variable names starting with '(' (open parenthesis) -represent variables with no known names -(internal variables such as loop control variables, -and variables from chunks saved without debug information). - - -

-The parameter f may also be a function. -In that case, getlocal returns only the name of function parameters. - - - - -

-

debug.getmetatable (value)

- - -

-Returns the metatable of the given value -or nil if it does not have a metatable. - - - - -

-

debug.getregistry ()

- - -

-Returns the registry table (see §4.3). - - - - -

-

debug.getupvalue (f, up)

- - -

-This function returns the name and the value of the upvalue -with index up of the function f. -The function returns fail -if there is no upvalue with the given index. - - -

-(For Lua functions, -upvalues are the external local variables that the function uses, -and that are consequently included in its closure.) - - -

-For C functions, this function uses the empty string "" -as a name for all upvalues. - - -

-Variable name '?' (interrogation mark) -represents variables with no known names -(variables from chunks saved without debug information). - - - - -

-

debug.getuservalue (u, n)

- - -

-Returns the n-th user value associated -to the userdata u plus a boolean, -false if the userdata does not have that value. - - - - -

-

debug.sethook ([thread,] hook, mask [, count])

- - -

-Sets the given function as the debug hook. -The string mask and the number count describe -when the hook will be called. -The string mask may have any combination of the following characters, -with the given meaning: - -

    -
  • 'c': the hook is called every time Lua calls a function;
    • -
  • 'r': the hook is called every time Lua returns from a function;
    • -
  • 'l': the hook is called every time Lua enters a new line of code.
    • -

-Moreover, -with a count different from zero, -the hook is called also after every count instructions. - - -

-When called without arguments, -debug.sethook turns off the hook. - - -

-When the hook is called, its first parameter is a string -describing the event that has triggered its call: -"call", "tail call", "return", -"line", and "count". -For line events, -the hook also gets the new line number as its second parameter. -Inside a hook, -you can call getinfo with level 2 to get more information about -the running function. -(Level 0 is the getinfo function, -and level 1 is the hook function.) - - - - -

-

debug.setlocal ([thread,] level, local, value)

- - -

-This function assigns the value value to the local variable -with index local of the function at level level of the stack. -The function returns fail if there is no local -variable with the given index, -and raises an error when called with a level out of range. -(You can call getinfo to check whether the level is valid.) -Otherwise, it returns the name of the local variable. - - -

-See debug.getlocal for more information about -variable indices and names. - - - - -

-

debug.setmetatable (value, table)

- - -

-Sets the metatable for the given value to the given table -(which can be nil). -Returns value. - - - - -

-

debug.setupvalue (f, up, value)

- - -

-This function assigns the value value to the upvalue -with index up of the function f. -The function returns fail if there is no upvalue -with the given index. -Otherwise, it returns the name of the upvalue. - - -

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

-

debug.setuservalue (udata, value, n)

- - -

-Sets the given value as -the n-th user value associated to the given udata. -udata must be a full userdata. - - -

-Returns udata, -or fail if the userdata does not have that value. - - - - -

-

debug.traceback ([thread,] [message [, level]])

- - -

-If message is present but is neither a string nor nil, -this function returns message without further processing. -Otherwise, -it returns a string with a traceback of the call stack. -The optional message string is appended -at the beginning of the traceback. -An optional level number tells at which level -to start the traceback -(default is 1, the function calling traceback). - - - - -

-

debug.upvalueid (f, n)

- - -

-Returns a unique identifier (as a light userdata) -for the upvalue numbered n -from the given function. - - -

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

-

debug.upvaluejoin (f1, n1, f2, n2)

- - -

-Make the n1-th upvalue of the Lua closure f1 -refer to the n2-th upvalue of the Lua closure f2. - - - - - - - -

7 – Lua Standalone

- -

-Although Lua has been designed as an extension language, -to be embedded in a host C program, -it is also frequently used as a standalone language. -An interpreter for Lua as a standalone language, -called simply lua, -is provided with the standard distribution. -The standalone interpreter includes -all standard libraries. -Its usage is: - -

-     lua [options] [script [args]]
-

-The options are: - -

    -
  • -e stat: execute string stat;
    • -
  • -i: enter interactive mode after running script;
    • -
  • -l mod: "require" mod and assign the - result to global mod;
    • -
  • -v: print version information;
    • -
  • -E: ignore environment variables;
    • -
  • -W: turn warnings on;
    • -
  • --: stop handling options;
    • -
  • -: execute stdin as a file and stop handling options.
    • -

-After handling its options, lua runs the given script. -When called without arguments, -lua behaves as lua -v -i -when the standard input (stdin) is a terminal, -and as lua - otherwise. - - -

-When called without the option -E, -the interpreter checks for an environment variable LUA_INIT_5_4 -(or LUA_INIT if the versioned name is not defined) -before running any argument. -If the variable content has the format @filename, -then lua executes the file. -Otherwise, lua executes the string itself. - - -

-When called with the option -E, -Lua does not consult any environment variables. -In particular, -the values of package.path and package.cpath -are set with the default paths defined in luaconf.h. - - -

-The options -e, -l, and -W are handled in -the order they appear. -For instance, an invocation like - -

-     $ lua -e 'a=1' -llib1 script.lua
-

-will first set a to 1, then require the library lib1, -and finally run the file script.lua with no arguments. -(Here $ is the shell prompt. Your prompt may be different.) - - -

-Before running any code, -lua collects all command-line arguments -in a global table called arg. -The script name goes to index 0, -the first argument after the script name goes to index 1, -and so on. -Any arguments before the script name -(that is, the interpreter name plus its options) -go to negative indices. -For instance, in the call - -

-     $ lua -la b.lua t1 t2
-

-the table is like this: - -

-     arg = { [-2] = "lua", [-1] = "-la",
-             [0] = "b.lua",
-             [1] = "t1", [2] = "t2" }
-

-If there is no script in the call, -the interpreter name goes to index 0, -followed by the other arguments. -For instance, the call - -

-     $ lua -e "print(arg[1])"
-

-will print "-e". -If there is a script, -the script is called with arguments -arg[1], ···, arg[#arg]. -Like all chunks in Lua, -the script is compiled as a vararg function. - - -

-In interactive mode, -Lua repeatedly prompts and waits for a line. -After reading a line, -Lua first try to interpret the line as an expression. -If it succeeds, it prints its value. -Otherwise, it interprets the line as a statement. -If you write an incomplete statement, -the interpreter waits for its completion -by issuing a different prompt. - - -

-If the global variable _PROMPT contains a string, -then its value is used as the prompt. -Similarly, if the global variable _PROMPT2 contains a string, -its value is used as the secondary prompt -(issued during incomplete statements). - - -

-In case of unprotected errors in the script, -the interpreter reports the error to the standard error stream. -If the error object is not a string but -has a metamethod __tostring, -the interpreter calls this metamethod to produce the final message. -Otherwise, the interpreter converts the error object to a string -and adds a stack traceback to it. -When warnings are on, -they are simply printed in the standard error output. - - -

-When finishing normally, -the interpreter closes its main Lua state -(see lua_close). -The script can avoid this step by -calling os.exit to terminate. - - -

-To allow the use of Lua as a -script interpreter in Unix systems, -Lua skips the first line of a file chunk if it starts with #. -Therefore, Lua scripts can be made into executable programs -by using chmod +x and the #! form, -as in - -

-     #!/usr/local/bin/lua
-

-Of course, -the location of the Lua interpreter may be different in your machine. -If lua is in your PATH, -then - -

-     #!/usr/bin/env lua
-

-is a more portable solution. - - - -

8 – Incompatibilities with the Previous Version

- - - -

-Here we list the incompatibilities that you may find when moving a program -from Lua 5.3 to Lua 5.4. - - -

-You can avoid some incompatibilities by compiling Lua with -appropriate options (see file luaconf.h). -However, -all these compatibility options will be removed in the future. -More often than not, -compatibility issues arise when these compatibility options -are removed. -So, whenever you have the chance, -you should try to test your code with a version of Lua compiled -with all compatibility options turned off. -That will ease transitions to newer versions of Lua. - - -

-Lua versions can always change the C API in ways that -do not imply source-code changes in a program, -such as the numeric values for constants -or the implementation of functions as macros. -Therefore, -you should never assume that binaries are compatible between -different Lua versions. -Always recompile clients of the Lua API when -using a new version. - - -

-Similarly, Lua versions can always change the internal representation -of precompiled chunks; -precompiled chunks are not compatible between different Lua versions. - - -

-The standard paths in the official distribution may -change between versions. - - - - - -

8.1 – Incompatibilities in the Language

-
    - -
  • -The coercion of strings to numbers in -arithmetic and bitwise operations -has been removed from the core language. -The string library does a similar job -for arithmetic (but not for bitwise) operations -using the string metamethods. -However, unlike in previous versions, -the new implementation preserves the implicit type of the numeral -in the string. -For instance, the result of "1" + "2" now is an integer, -not a float. -
    • - -
  • -Literal decimal integer constants that overflow are read as floats, -instead of wrapping around. -You can use hexadecimal notation for such constants if you -want the old behavior -(reading them as integers with wrap around). -
    • - -
  • -The use of the __lt metamethod to emulate __le -has been removed. -When needed, this metamethod must be explicitly defined. -
    • - -
  • -The semantics of the numerical for loop -over integers changed in some details. -In particular, the control variable never wraps around. -
    • - -
  • -A label for a goto cannot be declared where a label with the same -name is visible, even if this other label is declared in an enclosing -block. -
    • - -
  • -When finalizing an object, -Lua does not ignore __gc metamethods that are not functions. -Any value will be called, if present. -(Non-callable values will generate a warning, -like any other error when calling a finalizer.) -
    • - -
- - - - -

8.2 – Incompatibilities in the Libraries

-
    - -
  • -The function print does not call tostring -to format its arguments; -instead, it has this functionality hardwired. -You should use __tostring to modify how values are printed. -
    • - -
  • -The pseudo-random number generator used by the function math.random -now starts with a somewhat random seed. -Moreover, it uses a different algorithm. -
    • - -
  • -By default, the decoding functions in the utf8 library -do not accept surrogates as valid code points. -An extra parameter in these functions makes them more permissive. -
    • - -
  • -The options "setpause" and "setstepmul" -of the function collectgarbage are deprecated. -You should use the new option "incremental" to set them. -
    • - -
  • -The function io.lines now returns four values, -instead of just one. -That can be a problem when it is used as the sole -argument to another function that has optional parameters, -such as in load(io.lines(filename, "L")). -To fix that issue, -you can wrap the call into parentheses, -to adjust its number of results to one. -
    • - -
- - - - -

8.3 – Incompatibilities in the API

- - -
    - -
  • -Full userdata now has an arbitrary number of associated user values. -Therefore, the functions lua_newuserdata, -lua_setuservalue, and lua_getuservalue were -replaced by lua_newuserdatauv, -lua_setiuservalue, and lua_getiuservalue, -which have an extra argument. - - -

    -For compatibility, the old names still work as macros assuming -one single user value. -Note, however, that userdata with zero user values -are more efficient memory-wise. -

    • - -
  • -The function lua_resume has an extra parameter. -This out parameter returns the number of values on -the top of the stack that were yielded or returned by the coroutine. -(In previous versions, -those values were the entire stack.) -
    • - -
  • -The function lua_version returns the version number, -instead of an address of the version number. -The Lua core should work correctly with libraries using their -own static copies of the same core, -so there is no need to check whether they are using the same -address space. -
    • - -
  • -The constant LUA_ERRGCMM was removed. -Errors in finalizers are never propagated; -instead, they generate a warning. -
    • - -
  • -The options LUA_GCSETPAUSE and LUA_GCSETSTEPMUL -of the function lua_gc are deprecated. -You should use the new option LUA_GCINC to set them. -
    • - -
- - - - -

9 – The Complete Syntax of Lua

- -

-Here is the complete syntax of Lua in extended BNF. -As usual in extended BNF, -{A} means 0 or more As, -and [A] means an optional A. -(For operator precedences, see §3.4.8; -for a description of the terminals -Name, Numeral, -and LiteralString, see §3.1.) - - - - -

-
-	chunk ::= block
-
-	block ::= {stat} [retstat]
-
-	stat ::=  ‘;’ | 
-		 varlist ‘=’ explist | 
-		 functioncall | 
-		 label | 
-		 break | 
-		 goto Name | 
-		 do block end | 
-		 while exp do block end | 
-		 repeat block until exp | 
-		 if exp then block {elseif exp then block} [else block] end | 
-		 for Name ‘=’ exp ‘,’ exp [‘,’ exp] do block end | 
-		 for namelist in explist do block end | 
-		 function funcname funcbody | 
-		 local function Name funcbody | 
-		 local attnamelist [‘=’ explist] 
-
-	attnamelist ::=  Name attrib {‘,’ Name attrib}
-
-	attrib ::= [‘<’ Name ‘>’]
-
-	retstat ::= return [explist] [‘;’]
-
-	label ::= ‘::’ Name ‘::’
-
-	funcname ::= Name {‘.’ Name} [‘:’ Name]
-
-	varlist ::= var {‘,’ var}
-
-	var ::=  Name | prefixexp ‘[’ exp ‘]’ | prefixexp ‘.’ Name 
-
-	namelist ::= Name {‘,’ Name}
-
-	explist ::= exp {‘,’ exp}
-
-	exp ::=  nil | false | true | Numeral | LiteralString | ‘...’ | functiondef | 
-		 prefixexp | tableconstructor | exp binop exp | unop exp 
-
-	prefixexp ::= var | functioncall | ‘(’ exp ‘)’
-
-	functioncall ::=  prefixexp args | prefixexp ‘:’ Name args 
-
-	args ::=  ‘(’ [explist] ‘)’ | tableconstructor | LiteralString 
-
-	functiondef ::= function funcbody
-
-	funcbody ::= ‘(’ [parlist] ‘)’ block end
-
-	parlist ::= namelist [‘,’ ‘...’] | ‘...’
-
-	tableconstructor ::= ‘{’ [fieldlist] ‘}’
-
-	fieldlist ::= field {fieldsep field} [fieldsep]
-
-	field ::= ‘[’ exp ‘]’ ‘=’ exp | Name ‘=’ exp | exp
-
-	fieldsep ::= ‘,’ | ‘;’
-
-	binop ::=  ‘+’ | ‘-’ | ‘*’ | ‘/’ | ‘//’ | ‘^’ | ‘%’ | 
-		 ‘&’ | ‘~’ | ‘|’ | ‘>>’ | ‘<<’ | ‘..’ | 
-		 ‘<’ | ‘<=’ | ‘>’ | ‘>=’ | ‘==’ | ‘~=’ | 
-		 and | or
-
-	unop ::= ‘-’ | not | ‘#’ | ‘~’
-
-
- -

- - - - - - - -

-Last update: -Thu Jan 13 11:33:16 UTC 2022 -

- - - - diff --git a/lua-5.4.4/doc/osi-certified-72x60.png b/lua-5.4.4/doc/osi-certified-72x60.png deleted file mode 100644 index 07df5f6ee7a7a8b2108025dcd815f73f145a83af..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 3774 zcmV;v4ngsWP)$kl5 zqcT7g&?zu8?ezWYz4zUB-|zR9d+&Qy2xAN{qY(ew0A7^*gV^7jytKqPFV3{hZfovn zs%x!l>(m&Gdb8C+5XeR7>h0kj=o=X3A39;2KLYfEMt>p1YMW~dt`rpAC{lN~P>5pq zH1L4nAdCT17}*hN=LnEsvMl=5Ij^QArAa&_V~zoht-Ei~)E~(Ivhe0#jik{t$isEK znCH$TxCB8EKmcF>3@pRaHpbR%Gqm*dsZA4H{j(NjZFp^iNFW+RBx6R*X19J*`0XG5 z^Y>cR=^Hi9#ovYGlbFSr#Q*^PgCGC^gb*SC5TcBfzQLe-r2m!Quik&_g9XzTj0qSR zD`FkG_RYWDa^+#UUxL&t+!K+&(ion@Fd`5l5p7{Qsva9vegC|4^NzJUMvn)^gqWsF zvu^j=%FfCVg^cgbXDRl1DE$lsfe;BjjmFmRHER~E-MeWoNsyyNHCpG%Y}igd_(Md;&9La8_B075NDRX9gTD zIHY`}9E~aGi9Kk1@P~rmPna=*=gz~UTdTpsQmjX)J23%v9NliQS)8`xJh6Qz_nE~e z&tP|!dcJdo;JMNa3>afSx$lko8>fp-I}OiCVz(dOF1u6e8$IrsSP?=5mp~lkaFqm? zAUMxRq%ecIu3WE)Uf=%p8g z+RSY?G=VO%wAfdICj?Uzb+5jr{8m|)i#{M}JjaDIoXf#1=DYLwX;1EW&sijPvm6EkBGuOx6r~lKv`g`yH?)|&PRUr$5Ibw2HBM7C74XvE@gaPjN+@;j$J)AgYhnT-U5m+wj|Wz8K630AfO8PUoGD^^Mcq zY9C<~%wUm^u%ox5P21)KNN0$(v^OI$A~?iwsS_fRu1+`EH|CRdpA4zsk8Z#|?x@^vVEAL+2JxH%&^{JUU%B=?EU7`Ar*Q|JvqPofcBt765(*f5JI$>=3{<%K)4ei zogo$)5XP}_X$y^pIYyWTt}EAnhTq}u4sAdBvC(WC{I#x4^>$vCvQ0UDs^18sAQG9o zEaP0qjrSSv1W0FyO%9&y$@em~n@8}}EXBG6x%ew49J_q%l@As_XnNpi|MTTPr~ca_ zW%uon6dBKL*pvzYFvf<~p6K8hK9BDNNN0$7xp^hWC3n^7FoQ?P(=m(6!Pj&S2f1fqH=`(w)KcPl5aEi2}~4hF*f*g}vaS-=c7v>N8c z{yNM*%+azq=@prWtgpi~^3?^AsJqS(>=pb=6PrGH#=O{Hcho$_F#MtsK$$3e2fZvg zy}!-V%`+uFMOW87LIgu3vKuMgqwY0}*Sd;aokQp(F#-{}Ss(Iy1iekY1ZQX?1WEL? z7=zq`lH-#Hw=bHRio3yPun%`c5rI1Hb|wTSWTs|12Mg#QkkwTmy zAYul0H*_b(BnkP#!R_&p@d54uz0JKthGv3C^fdKS%~alookE`QX@%#MQN2=SFWrOha7Ij7ImStNaWsy~? zsylUeT02_-z-G4s0L!v=+Wx|cxr$tmY&$a1by8z#6HBp!*9{@mU9XQ0h@L%V_R}4g z&s#2{MCOj4`5ux-SUautC5@{U895o-biKMWWoQ09{|jx8wz}@_(ep%Yk4{90C#s6-sa}fU5{}m>#>VtE_b#5bn8O+3k{&6GoEkB;yGie;A_5Uy zqPN*tU()pE+_&~``5XX({el-xT_}%`%fsc>_0@m5{+FhXru>rpyLESe31R>cK^FFrCm+#WL$-D{Z3*9>Lg{wi}xEYn_`@Hy`-d z1N}kIY%@Eu&Bpe|Rr6N;%Yk>6&RI$lgpIO26BYT%C!dU-o4bqqQpGY?p6lPru6Hzc z@WuSDI^BYaDH*>R)~)$V1J0Edn4r(9vo>E<2XjOJr2*G124;t^U+p{iUnZN5oapCpCk(F}}<#3ZZli!Nk z^UWT;Q9qm-i`i$kJS}5P%puBJ<&krTO;*#$Y7d$o96EbQ{aF1XFpTj}wf}eI|IOba z%w}_CWu?JjkV>U-ad9L$@Mu$CU;pUQBZgt5QmI@n=W@9K(A(SF-rnxzy|_!5ekKqCQTad`sa|&&Q6jfy}iAEst?|mH*emIjg9SB zRVWlHl?r3bvh2qnf6V6(+>4TulB%kzFveeh{k1?K*t&J=m>dk9P8SjqQdn4sF;*&- z(b3VFnVH$y*$Rb%rs zefJ#z#KpyZ_0?C$jvY%)O?7a?7#}%u1OT>d*)keF*REZ=c=4j6tkr5MilS*cB_$;< zFArmEv)Oby-7}4>TD9uE_ulKT4s6Bp@^Y0*rBEo&o;?cy8#Zi^%jH+DTv4f1SFc_L zfc5LwXJ=;vKt@K!?%liR&!6Almmq$2R@G|tg$oyGnpP+jQBhF<(9qCOR8%AuiBtJCSc zyu1LQw6wIQre^Zw$^E0N)#}R1%J}$rkw`Qc#z0A{)dIkjDN`I(PfyS2=x9f~R4N64 zPe1*1=gytQ#l=RWao4V0bLY-=?Bpl*dQDA@LZMJ9l{Gar$;rvzfB$`Tb#+==T0=ua zSy@?1N{UXWyL9Q&#*G`Zv$GE#JXljxBauj2T3VD!rO9N<%F3#*uP-Sn(P%W=w{Jgx z{(NC!VNOmC0OaN6ZQHg@tJQw^;fGtdZUulVSFX&NGv~~iGoO9-nNq0~2n78w23E{L zmth7T3|W>10ISuSm6cUgRCMXmr5!tV0D!x@`?6)rcI?<8lgZ#IIehqVOiYYpi@x#3 z8xau^+1c4ER;th&( zVHk--A`l3|!os9dsYatANm8TH96x@%qM{-&FmUtc&2qVX-MV%A_U(J~%{TY#*<&ym zX3Ur|c$No?u%e>k#EBDaZEY7XUVLH`0zh|n zw_~XRz;RH!y1MS)zn_X$Km70mNs@ZKo~G$z$BuD09F}FpVzEY}F&d2ug#rLPJUpgPpKh}a^y$-i zJl@%}XHT6vRaaNHckf=MQYn>6Fk&*D<+ja0B z5C{a#&CQN-V`HPyXe3EeAP~gH#>U3RayT5ZSd1}tbaaSNDAZ^)j%n&QHMoE=7KubA zlWEeVNpiV7Dk=&gzM|0Dz(>0HA5Q-_F}_znz(xxqbU~E|+`a#EH|V zPjA|^DJLg~rs?+f_6rv-T)upnAP7fChoq;cFJHcV=gyt)zWXjs(+gZ<%kMDTlOd1+TFW%&z(D`)oKF*0@Bmd zLqkIy?RvewprGK+ojWv5%Ve?@D^>&r1p$CcrMhuv}x1&joiO~|IC>)G) - - -Lua 5.4 readme - - - - - - - -

-Lua -Welcome to Lua 5.4 -

- -
-about -· -installation -· -changes -· -license -· -reference manual -
- -

About Lua

-

-Lua is a powerful, efficient, lightweight, embeddable scripting language -developed by a -team -at -PUC-Rio, -the Pontifical Catholic University of Rio de Janeiro in Brazil. -Lua is -free software -used in -many products and projects -around the world. - -

-Lua's -official web site -provides complete information -about Lua, -including -an -executive summary -and -updated -documentation, -especially the -reference manual, -which may differ slightly from the -local copy -distributed in this package. - -

Installing Lua

-

-Lua is distributed in -source -form. -You need to build it before using it. -Building Lua should be straightforward -because -Lua is implemented in pure ANSI C and compiles unmodified in all known -platforms that have an ANSI C compiler. -Lua also compiles unmodified as C++. -The instructions given below for building Lua are for Unix-like platforms, -such as Linux and Mac OS X. -See also -instructions for other systems -and -customization options. - -

-If you don't have the time or the inclination to compile Lua yourself, -get a binary from -LuaBinaries. -Try also -LuaDist, -a multi-platform distribution of Lua that includes batteries. - -

Building Lua

-

-In most common Unix-like platforms, simply do "make". -Here are the details. - -

    -
  1. -Open a terminal window and move to -the top-level directory, which is named lua-5.4.4. -The Makefile there controls both the build process and the installation process. -

    -

  2. - Do "make". The Makefile will guess your platform and build Lua for it. -

    -

  3. - If the guess failed, do "make help" and see if your platform is listed. - The platforms currently supported are: -

    -

    - guess aix bsd c89 freebsd generic linux linux-readline macosx mingw posix solaris -

    -

    - If your platform is listed, just do "make xxx", where xxx - is your platform name. -

    - If your platform is not listed, try the closest one or posix, generic, - c89, in this order. -

    -

  4. -The compilation takes only a few moments -and produces three files in the src directory: -lua (the interpreter), -luac (the compiler), -and liblua.a (the library). -

    -

  5. - To check that Lua has been built correctly, do "make test" - after building Lua. This will run the interpreter and print its version. -
-

-If you're running Linux, try "make linux-readline" to build the interactive Lua interpreter with handy line-editing and history capabilities. -If you get compilation errors, -make sure you have installed the readline development package -(which is probably named libreadline-dev or readline-devel). -If you get link errors after that, -then try "make linux-readline MYLIBS=-ltermcap". - -

Installing Lua

-

- Once you have built Lua, you may want to install it in an official - place in your system. In this case, do "make install". The official - place and the way to install files are defined in the Makefile. You'll - probably need the right permissions to install files, and so may need to do "sudo make install". - -

- To build and install Lua in one step, do "make all install", - or "make xxx install", - where xxx is your platform name. - -

- To install Lua locally after building it, do "make local". - This will create a directory install with subdirectories - bin, include, lib, man, share, - and install Lua as listed below. - - To install Lua locally, but in some other directory, do - "make install INSTALL_TOP=xxx", where xxx is your chosen directory. - The installation starts in the src and doc directories, - so take care if INSTALL_TOP is not an absolute path. - -

-
- bin: -
- lua luac -
- include: -
- lua.h luaconf.h lualib.h lauxlib.h lua.hpp -
- lib: -
- liblua.a -
- man/man1: -
- lua.1 luac.1 -
- -

- These are the only directories you need for development. - If you only want to run Lua programs, - you only need the files in bin and man. - The files in include and lib are needed for - embedding Lua in C or C++ programs. - -

Customization

-

- Three kinds of things can be customized by editing a file: -

    -
  • Where and how to install Lua — edit Makefile. -
  • How to build Lua — edit src/Makefile. -
  • Lua features — edit src/luaconf.h. -
- -

- You don't actually need to edit the Makefiles because you may set the - relevant variables in the command line when invoking make. - Nevertheless, it's probably best to edit and save the Makefiles to - record the changes you've made. - -

- On the other hand, if you need to customize some Lua features, you'll need - to edit src/luaconf.h before building and installing Lua. - The edited file will be the one installed, and - it will be used by any Lua clients that you build, to ensure consistency. - Further customization is available to experts by editing the Lua sources. - -

Building Lua on other systems

-

- If you're not using the usual Unix tools, then the instructions for - building Lua depend on the compiler you use. You'll need to create - projects (or whatever your compiler uses) for building the library, - the interpreter, and the compiler, as follows: - -

-
-library: -
-lapi.c lcode.c lctype.c ldebug.c ldo.c ldump.c lfunc.c lgc.c llex.c lmem.c lobject.c lopcodes.c lparser.c lstate.c lstring.c ltable.c ltm.c lundump.c lvm.c lzio.c -lauxlib.c lbaselib.c lcorolib.c ldblib.c liolib.c lmathlib.c loadlib.c loslib.c lstrlib.c ltablib.c lutf8lib.c linit.c -
-interpreter: -
- library, lua.c -
-compiler: -
- library, luac.c -
- -

- To use Lua as a library in your own programs, you'll need to know how to - create and use libraries with your compiler. Moreover, to dynamically load - C libraries for Lua, you'll need to know how to create dynamic libraries - and you'll need to make sure that the Lua API functions are accessible to - those dynamic libraries — but don't link the Lua library - into each dynamic library. For Unix, we recommend that the Lua library - be linked statically into the host program and its symbols exported for - dynamic linking; src/Makefile does this for the Lua interpreter. - For Windows, we recommend that the Lua library be a DLL. - In all cases, the compiler luac should be linked statically. - -

- As mentioned above, you may edit src/luaconf.h to customize - some features before building Lua. - -

Changes since Lua 5.3

-

-Here are the main changes introduced in Lua 5.4. -The -reference manual -lists the -incompatibilities that had to be introduced. - -

Main changes

-
    -
  • new generational mode for garbage collection -
  • to-be-closed variables -
  • const variables -
  • userdata can have multiple user values -
  • new implementation for math.random -
  • warning system -
  • debug information about function arguments and returns -
  • new semantics for the integer 'for' loop -
  • optional 'init' argument to 'string.gmatch' -
  • new functions 'lua_resetthread' and 'coroutine.close' -
  • string-to-number coercions moved to the string library -
  • allocation function allowed to fail when shrinking a memory block -
  • new format '%p' in 'string.format' -
  • utf8 library accepts codepoints up to 2^31 -
- -

License

-

- -[osi certified] - -Lua is free software distributed under the terms of the -MIT license -reproduced below; -it may be used for any purpose, including commercial purposes, -at absolutely no cost without having to ask us. - -The only requirement is that if you do use Lua, -then you should give us credit by including the appropriate copyright notice somewhere in your product or its documentation. - -For details, see -this. - -

-Copyright © 1994–2022 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 Jan 3 09:54:18 UTC 2022 -

- - - - diff --git a/lua-5.4.4/include/lauxlib.h b/lua-5.4.4/include/lauxlib.h deleted file mode 100644 index 5b977e2..0000000 --- a/lua-5.4.4/include/lauxlib.h +++ /dev/null @@ -1,301 +0,0 @@ -/* -** $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.4/include/lua.h b/lua-5.4.4/include/lua.h deleted file mode 100644 index e661839..0000000 --- a/lua-5.4.4/include/lua.h +++ /dev/null @@ -1,518 +0,0 @@ -/* -** $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 "4" - -#define LUA_VERSION_NUM 504 -#define LUA_VERSION_RELEASE_NUM (LUA_VERSION_NUM * 100 + 4) - -#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-2022 Lua.org, PUC-Rio" -#define LUA_AUTHORS "R. Ierusalimschy, L. H. de Figueiredo, W. Celes" - - -/* mark for precompiled code ('Lua') */ -#define LUA_SIGNATURE "\x1bLua" - -/* option for multiple returns in 'lua_pcall' and 'lua_call' */ -#define LUA_MULTRET (-1) - - -/* -** Pseudo-indices -** (-LUAI_MAXSTACK is the minimum valid index; we keep some free empty -** space after that to help overflow detection) -*/ -#define LUA_REGISTRYINDEX (-LUAI_MAXSTACK - 1000) -#define lua_upvalueindex(i) (LUA_REGISTRYINDEX - (i)) - - -/* thread status */ -#define LUA_OK 0 -#define LUA_YIELD 1 -#define LUA_ERRRUN 2 -#define LUA_ERRSYNTAX 3 -#define LUA_ERRMEM 4 -#define LUA_ERRERR 5 - - -typedef struct lua_State lua_State; - - -/* -** basic types -*/ -#define LUA_TNONE (-1) - -#define LUA_TNIL 0 -#define LUA_TBOOLEAN 1 -#define LUA_TLIGHTUSERDATA 2 -#define LUA_TNUMBER 3 -#define LUA_TSTRING 4 -#define LUA_TTABLE 5 -#define LUA_TFUNCTION 6 -#define LUA_TUSERDATA 7 -#define LUA_TTHREAD 8 - -#define LUA_NUMTYPES 9 - - - -/* minimum Lua stack available to a C function */ -#define LUA_MINSTACK 20 - - -/* predefined values in the registry */ -#define LUA_RIDX_MAINTHREAD 1 -#define LUA_RIDX_GLOBALS 2 -#define LUA_RIDX_LAST LUA_RIDX_GLOBALS - - -/* type of numbers in Lua */ -typedef LUA_NUMBER lua_Number; - - -/* type for integer functions */ -typedef LUA_INTEGER lua_Integer; - -/* unsigned integer type */ -typedef LUA_UNSIGNED lua_Unsigned; - -/* type for continuation-function contexts */ -typedef LUA_KCONTEXT lua_KContext; - - -/* -** Type for C functions registered with Lua -*/ -typedef int (*lua_CFunction) (lua_State *L); - -/* -** Type for continuation functions -*/ -typedef int (*lua_KFunction) (lua_State *L, int status, lua_KContext ctx); - - -/* -** Type for functions that read/write blocks when loading/dumping Lua chunks -*/ -typedef const char * (*lua_Reader) (lua_State *L, void *ud, size_t *sz); - -typedef int (*lua_Writer) (lua_State *L, const void *p, size_t sz, void *ud); - - -/* -** Type for memory-allocation functions -*/ -typedef void * (*lua_Alloc) (void *ud, void *ptr, size_t osize, size_t nsize); - - -/* -** Type for warning functions -*/ -typedef void (*lua_WarnFunction) (void *ud, const char *msg, int tocont); - - - - -/* -** generic extra include file -*/ -#if defined(LUA_USER_H) -#include LUA_USER_H -#endif - - -/* -** RCS ident string -*/ -extern const char lua_ident[]; - - -/* -** state manipulation -*/ -LUA_API lua_State *(lua_newstate) (lua_Alloc f, void *ud); -LUA_API void (lua_close) (lua_State *L); -LUA_API lua_State *(lua_newthread) (lua_State *L); -LUA_API int (lua_resetthread) (lua_State *L); - -LUA_API lua_CFunction (lua_atpanic) (lua_State *L, lua_CFunction panicf); - - -LUA_API lua_Number (lua_version) (lua_State *L); - - -/* -** basic stack manipulation -*/ -LUA_API int (lua_absindex) (lua_State *L, int idx); -LUA_API int (lua_gettop) (lua_State *L); -LUA_API void (lua_settop) (lua_State *L, int idx); -LUA_API void (lua_pushvalue) (lua_State *L, int idx); -LUA_API void (lua_rotate) (lua_State *L, int idx, int n); -LUA_API void (lua_copy) (lua_State *L, int fromidx, int toidx); -LUA_API int (lua_checkstack) (lua_State *L, int n); - -LUA_API void (lua_xmove) (lua_State *from, lua_State *to, int n); - - -/* -** access functions (stack -> C) -*/ - -LUA_API int (lua_isnumber) (lua_State *L, int idx); -LUA_API int (lua_isstring) (lua_State *L, int idx); -LUA_API int (lua_iscfunction) (lua_State *L, int idx); -LUA_API int (lua_isinteger) (lua_State *L, int idx); -LUA_API int (lua_isuserdata) (lua_State *L, int idx); -LUA_API int (lua_type) (lua_State *L, int idx); -LUA_API const char *(lua_typename) (lua_State *L, int tp); - -LUA_API lua_Number (lua_tonumberx) (lua_State *L, int idx, int *isnum); -LUA_API lua_Integer (lua_tointegerx) (lua_State *L, int idx, int *isnum); -LUA_API int (lua_toboolean) (lua_State *L, int idx); -LUA_API const char *(lua_tolstring) (lua_State *L, int idx, size_t *len); -LUA_API lua_Unsigned (lua_rawlen) (lua_State *L, int idx); -LUA_API lua_CFunction (lua_tocfunction) (lua_State *L, int idx); -LUA_API void *(lua_touserdata) (lua_State *L, int idx); -LUA_API lua_State *(lua_tothread) (lua_State *L, int idx); -LUA_API const void *(lua_topointer) (lua_State *L, int idx); - - -/* -** Comparison and arithmetic functions -*/ - -#define LUA_OPADD 0 /* ORDER TM, ORDER OP */ -#define LUA_OPSUB 1 -#define LUA_OPMUL 2 -#define LUA_OPMOD 3 -#define LUA_OPPOW 4 -#define LUA_OPDIV 5 -#define LUA_OPIDIV 6 -#define LUA_OPBAND 7 -#define LUA_OPBOR 8 -#define LUA_OPBXOR 9 -#define LUA_OPSHL 10 -#define LUA_OPSHR 11 -#define LUA_OPUNM 12 -#define LUA_OPBNOT 13 - -LUA_API void (lua_arith) (lua_State *L, int op); - -#define LUA_OPEQ 0 -#define LUA_OPLT 1 -#define LUA_OPLE 2 - -LUA_API int (lua_rawequal) (lua_State *L, int idx1, int idx2); -LUA_API int (lua_compare) (lua_State *L, int idx1, int idx2, int op); - - -/* -** push functions (C -> stack) -*/ -LUA_API void (lua_pushnil) (lua_State *L); -LUA_API void (lua_pushnumber) (lua_State *L, lua_Number n); -LUA_API void (lua_pushinteger) (lua_State *L, lua_Integer n); -LUA_API const char *(lua_pushlstring) (lua_State *L, const char *s, size_t len); -LUA_API const char *(lua_pushstring) (lua_State *L, const char *s); -LUA_API const char *(lua_pushvfstring) (lua_State *L, const char *fmt, - va_list argp); -LUA_API const char *(lua_pushfstring) (lua_State *L, const char *fmt, ...); -LUA_API void (lua_pushcclosure) (lua_State *L, lua_CFunction fn, int n); -LUA_API void (lua_pushboolean) (lua_State *L, int b); -LUA_API void (lua_pushlightuserdata) (lua_State *L, void *p); -LUA_API int (lua_pushthread) (lua_State *L); - - -/* -** get functions (Lua -> stack) -*/ -LUA_API int (lua_getglobal) (lua_State *L, const char *name); -LUA_API int (lua_gettable) (lua_State *L, int idx); -LUA_API int (lua_getfield) (lua_State *L, int idx, const char *k); -LUA_API int (lua_geti) (lua_State *L, int idx, lua_Integer n); -LUA_API int (lua_rawget) (lua_State *L, int idx); -LUA_API int (lua_rawgeti) (lua_State *L, int idx, lua_Integer n); -LUA_API int (lua_rawgetp) (lua_State *L, int idx, const void *p); - -LUA_API void (lua_createtable) (lua_State *L, int narr, int nrec); -LUA_API void *(lua_newuserdatauv) (lua_State *L, size_t sz, int nuvalue); -LUA_API int (lua_getmetatable) (lua_State *L, int objindex); -LUA_API int (lua_getiuservalue) (lua_State *L, int idx, int n); - - -/* -** set functions (stack -> Lua) -*/ -LUA_API void (lua_setglobal) (lua_State *L, const char *name); -LUA_API void (lua_settable) (lua_State *L, int idx); -LUA_API void (lua_setfield) (lua_State *L, int idx, const char *k); -LUA_API void (lua_seti) (lua_State *L, int idx, lua_Integer n); -LUA_API void (lua_rawset) (lua_State *L, int idx); -LUA_API void (lua_rawseti) (lua_State *L, int idx, lua_Integer n); -LUA_API void (lua_rawsetp) (lua_State *L, int idx, const void *p); -LUA_API int (lua_setmetatable) (lua_State *L, int objindex); -LUA_API int (lua_setiuservalue) (lua_State *L, int idx, int n); - - -/* -** 'load' and 'call' functions (load and run Lua code) -*/ -LUA_API void (lua_callk) (lua_State *L, int nargs, int nresults, - lua_KContext ctx, lua_KFunction k); -#define lua_call(L,n,r) lua_callk(L, (n), (r), 0, NULL) - -LUA_API int (lua_pcallk) (lua_State *L, int nargs, int nresults, int errfunc, - lua_KContext ctx, lua_KFunction k); -#define lua_pcall(L,n,r,f) lua_pcallk(L, (n), (r), (f), 0, NULL) - -LUA_API int (lua_load) (lua_State *L, lua_Reader reader, void *dt, - const char *chunkname, const char *mode); - -LUA_API int (lua_dump) (lua_State *L, lua_Writer writer, void *data, int strip); - - -/* -** coroutine functions -*/ -LUA_API int (lua_yieldk) (lua_State *L, int nresults, lua_KContext ctx, - lua_KFunction k); -LUA_API int (lua_resume) (lua_State *L, lua_State *from, int narg, - int *nres); -LUA_API int (lua_status) (lua_State *L); -LUA_API int (lua_isyieldable) (lua_State *L); - -#define lua_yield(L,n) lua_yieldk(L, (n), 0, NULL) - - -/* -** Warning-related functions -*/ -LUA_API void (lua_setwarnf) (lua_State *L, lua_WarnFunction f, void *ud); -LUA_API void (lua_warning) (lua_State *L, const char *msg, int tocont); - - -/* -** garbage-collection function and options -*/ - -#define LUA_GCSTOP 0 -#define LUA_GCRESTART 1 -#define LUA_GCCOLLECT 2 -#define LUA_GCCOUNT 3 -#define LUA_GCCOUNTB 4 -#define LUA_GCSTEP 5 -#define LUA_GCSETPAUSE 6 -#define LUA_GCSETSTEPMUL 7 -#define LUA_GCISRUNNING 9 -#define LUA_GCGEN 10 -#define LUA_GCINC 11 - -LUA_API int (lua_gc) (lua_State *L, int what, ...); - - -/* -** miscellaneous functions -*/ - -LUA_API int (lua_error) (lua_State *L); - -LUA_API int (lua_next) (lua_State *L, int idx); - -LUA_API void (lua_concat) (lua_State *L, int n); -LUA_API void (lua_len) (lua_State *L, int idx); - -LUA_API size_t (lua_stringtonumber) (lua_State *L, const char *s); - -LUA_API lua_Alloc (lua_getallocf) (lua_State *L, void **ud); -LUA_API void (lua_setallocf) (lua_State *L, lua_Alloc f, void *ud); - -LUA_API void (lua_toclose) (lua_State *L, int idx); -LUA_API void (lua_closeslot) (lua_State *L, int idx); - - -/* -** {============================================================== -** some useful macros -** =============================================================== -*/ - -#define lua_getextraspace(L) ((void *)((char *)(L) - LUA_EXTRASPACE)) - -#define lua_tonumber(L,i) lua_tonumberx(L,(i),NULL) -#define lua_tointeger(L,i) lua_tointegerx(L,(i),NULL) - -#define lua_pop(L,n) lua_settop(L, -(n)-1) - -#define lua_newtable(L) lua_createtable(L, 0, 0) - -#define lua_register(L,n,f) (lua_pushcfunction(L, (f)), lua_setglobal(L, (n))) - -#define lua_pushcfunction(L,f) lua_pushcclosure(L, (f), 0) - -#define lua_isfunction(L,n) (lua_type(L, (n)) == LUA_TFUNCTION) -#define lua_istable(L,n) (lua_type(L, (n)) == LUA_TTABLE) -#define lua_islightuserdata(L,n) (lua_type(L, (n)) == LUA_TLIGHTUSERDATA) -#define lua_isnil(L,n) (lua_type(L, (n)) == LUA_TNIL) -#define lua_isboolean(L,n) (lua_type(L, (n)) == LUA_TBOOLEAN) -#define lua_isthread(L,n) (lua_type(L, (n)) == LUA_TTHREAD) -#define lua_isnone(L,n) (lua_type(L, (n)) == LUA_TNONE) -#define lua_isnoneornil(L, n) (lua_type(L, (n)) <= 0) - -#define lua_pushliteral(L, s) lua_pushstring(L, "" s) - -#define lua_pushglobaltable(L) \ - ((void)lua_rawgeti(L, LUA_REGISTRYINDEX, LUA_RIDX_GLOBALS)) - -#define lua_tostring(L,i) lua_tolstring(L, (i), NULL) - - -#define lua_insert(L,idx) lua_rotate(L, (idx), 1) - -#define lua_remove(L,idx) (lua_rotate(L, (idx), -1), lua_pop(L, 1)) - -#define lua_replace(L,idx) (lua_copy(L, -1, (idx)), lua_pop(L, 1)) - -/* }============================================================== */ - - -/* -** {============================================================== -** compatibility macros -** =============================================================== -*/ -#if defined(LUA_COMPAT_APIINTCASTS) - -#define lua_pushunsigned(L,n) lua_pushinteger(L, (lua_Integer)(n)) -#define lua_tounsignedx(L,i,is) ((lua_Unsigned)lua_tointegerx(L,i,is)) -#define lua_tounsigned(L,i) lua_tounsignedx(L,(i),NULL) - -#endif - -#define lua_newuserdata(L,s) lua_newuserdatauv(L,s,1) -#define lua_getuservalue(L,idx) lua_getiuservalue(L,idx,1) -#define lua_setuservalue(L,idx) lua_setiuservalue(L,idx,1) - -#define LUA_NUMTAGS LUA_NUMTYPES - -/* }============================================================== */ - -/* -** {====================================================================== -** Debug API -** ======================================================================= -*/ - - -/* -** Event codes -*/ -#define LUA_HOOKCALL 0 -#define LUA_HOOKRET 1 -#define LUA_HOOKLINE 2 -#define LUA_HOOKCOUNT 3 -#define LUA_HOOKTAILCALL 4 - - -/* -** Event masks -*/ -#define LUA_MASKCALL (1 << LUA_HOOKCALL) -#define LUA_MASKRET (1 << LUA_HOOKRET) -#define LUA_MASKLINE (1 << LUA_HOOKLINE) -#define LUA_MASKCOUNT (1 << LUA_HOOKCOUNT) - -typedef struct lua_Debug lua_Debug; /* activation record */ - - -/* Functions to be called by the debugger in specific events */ -typedef void (*lua_Hook) (lua_State *L, lua_Debug *ar); - - -LUA_API int (lua_getstack) (lua_State *L, int level, lua_Debug *ar); -LUA_API int (lua_getinfo) (lua_State *L, const char *what, lua_Debug *ar); -LUA_API const char *(lua_getlocal) (lua_State *L, const lua_Debug *ar, int n); -LUA_API const char *(lua_setlocal) (lua_State *L, const lua_Debug *ar, int n); -LUA_API const char *(lua_getupvalue) (lua_State *L, int funcindex, int n); -LUA_API const char *(lua_setupvalue) (lua_State *L, int funcindex, int n); - -LUA_API void *(lua_upvalueid) (lua_State *L, int fidx, int n); -LUA_API void (lua_upvaluejoin) (lua_State *L, int fidx1, int n1, - int fidx2, int n2); - -LUA_API void (lua_sethook) (lua_State *L, lua_Hook func, int mask, int count); -LUA_API lua_Hook (lua_gethook) (lua_State *L); -LUA_API int (lua_gethookmask) (lua_State *L); -LUA_API int (lua_gethookcount) (lua_State *L); - -LUA_API int (lua_setcstacklimit) (lua_State *L, unsigned int limit); - -struct lua_Debug { - int event; - const char *name; /* (n) */ - const char *namewhat; /* (n) 'global', 'local', 'field', 'method' */ - const char *what; /* (S) 'Lua', 'C', 'main', 'tail' */ - const char *source; /* (S) */ - size_t srclen; /* (S) */ - int currentline; /* (l) */ - int linedefined; /* (S) */ - int lastlinedefined; /* (S) */ - unsigned char nups; /* (u) number of upvalues */ - unsigned char nparams;/* (u) number of parameters */ - char isvararg; /* (u) */ - char istailcall; /* (t) */ - unsigned short ftransfer; /* (r) index of first value transferred */ - unsigned short ntransfer; /* (r) number of transferred values */ - char short_src[LUA_IDSIZE]; /* (S) */ - /* private part */ - struct CallInfo *i_ci; /* active function */ -}; - -/* }====================================================================== */ - - -/****************************************************************************** -* Copyright (C) 1994-2022 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.4/include/lua.hpp b/lua-5.4.4/include/lua.hpp deleted file mode 100644 index ec417f5..0000000 --- a/lua-5.4.4/include/lua.hpp +++ /dev/null @@ -1,9 +0,0 @@ -// 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.4/include/luaconf.h b/lua-5.4.4/include/luaconf.h deleted file mode 100644 index d42d14b..0000000 --- a/lua-5.4.4/include/luaconf.h +++ /dev/null @@ -1,786 +0,0 @@ -/* -** $Id: luaconf.h $ -** Configuration file for Lua -** See Copyright Notice in lua.h -*/ - - -#ifndef luaconf_h -#define luaconf_h - -#include -#include - - -/* -** =================================================================== -** General Configuration File for Lua -** -** Some definitions here can be changed externally, through the compiler -** (e.g., with '-D' options): They are commented out or protected -** by '#if !defined' guards. However, several other definitions -** should be changed directly here, either because they affect the -** Lua ABI (by making the changes here, you ensure that all software -** connected to Lua, such as C libraries, will be compiled with the same -** configuration); or because they are seldom changed. -** -** Search for "@@" to find all configurable definitions. -** =================================================================== -*/ - - -/* -** {==================================================================== -** System Configuration: macros to adapt (if needed) Lua to some -** particular platform, for instance restricting it to C89. -** ===================================================================== -*/ - -/* -@@ LUA_USE_C89 controls the use of non-ISO-C89 features. -** Define it if you want Lua to avoid the use of a few C99 features -** or Windows-specific features on Windows. -*/ -/* #define LUA_USE_C89 */ - - -/* -** By default, Lua on Windows use (some) specific Windows features -*/ -#if !defined(LUA_USE_C89) && defined(_WIN32) && !defined(_WIN32_WCE) -#define LUA_USE_WINDOWS /* enable goodies for regular Windows */ -#endif - - -#if defined(LUA_USE_WINDOWS) -#define LUA_DL_DLL /* enable support for DLL */ -#define LUA_USE_C89 /* broadly, Windows is C89 */ -#endif - - -#if defined(LUA_USE_LINUX) -#define LUA_USE_POSIX -#define LUA_USE_DLOPEN /* needs an extra library: -ldl */ -#endif - - -#if defined(LUA_USE_MACOSX) -#define LUA_USE_POSIX -#define LUA_USE_DLOPEN /* MacOS does not need -ldl */ -#endif - - -/* -@@ LUAI_IS32INT is true iff 'int' has (at least) 32 bits. -*/ -#define LUAI_IS32INT ((UINT_MAX >> 30) >= 3) - -/* }================================================================== */ - - - -/* -** {================================================================== -** Configuration for Number types. These options should not be -** set externally, because any other code connected to Lua must -** use the same configuration. -** =================================================================== -*/ - -/* -@@ LUA_INT_TYPE defines the type for Lua integers. -@@ LUA_FLOAT_TYPE defines the type for Lua floats. -** Lua should work fine with any mix of these options supported -** by your C compiler. The usual configurations are 64-bit integers -** and 'double' (the default), 32-bit integers and 'float' (for -** restricted platforms), and 'long'/'double' (for C compilers not -** compliant with C99, which may not have support for 'long long'). -*/ - -/* predefined options for LUA_INT_TYPE */ -#define LUA_INT_INT 1 -#define LUA_INT_LONG 2 -#define LUA_INT_LONGLONG 3 - -/* predefined options for LUA_FLOAT_TYPE */ -#define LUA_FLOAT_FLOAT 1 -#define LUA_FLOAT_DOUBLE 2 -#define LUA_FLOAT_LONGDOUBLE 3 - - -/* Default configuration ('long long' and 'double', for 64-bit Lua) */ -#define LUA_INT_DEFAULT LUA_INT_LONGLONG -#define LUA_FLOAT_DEFAULT LUA_FLOAT_DOUBLE - - -/* -@@ LUA_32BITS enables Lua with 32-bit integers and 32-bit floats. -*/ -#define LUA_32BITS 0 - - -/* -@@ LUA_C89_NUMBERS ensures that Lua uses the largest types available for -** C89 ('long' and 'double'); Windows always has '__int64', so it does -** not need to use this case. -*/ -#if defined(LUA_USE_C89) && !defined(LUA_USE_WINDOWS) -#define LUA_C89_NUMBERS 1 -#else -#define LUA_C89_NUMBERS 0 -#endif - - -#if LUA_32BITS /* { */ -/* -** 32-bit integers and 'float' -*/ -#if LUAI_IS32INT /* use 'int' if big enough */ -#define LUA_INT_TYPE LUA_INT_INT -#else /* otherwise use 'long' */ -#define LUA_INT_TYPE LUA_INT_LONG -#endif -#define LUA_FLOAT_TYPE LUA_FLOAT_FLOAT - -#elif LUA_C89_NUMBERS /* }{ */ -/* -** largest types available for C89 ('long' and 'double') -*/ -#define LUA_INT_TYPE LUA_INT_LONG -#define LUA_FLOAT_TYPE LUA_FLOAT_DOUBLE - -#else /* }{ */ -/* use defaults */ - -#define LUA_INT_TYPE LUA_INT_DEFAULT -#define LUA_FLOAT_TYPE LUA_FLOAT_DEFAULT - -#endif /* } */ - - -/* }================================================================== */ - - - -/* -** {================================================================== -** Configuration for Paths. -** =================================================================== -*/ - -/* -** LUA_PATH_SEP is the character that separates templates in a path. -** LUA_PATH_MARK is the string that marks the substitution points in a -** template. -** LUA_EXEC_DIR in a Windows path is replaced by the executable's -** directory. -*/ -#define LUA_PATH_SEP ";" -#define LUA_PATH_MARK "?" -#define LUA_EXEC_DIR "!" - - -/* -@@ LUA_PATH_DEFAULT is the default path that Lua uses to look for -** Lua libraries. -@@ LUA_CPATH_DEFAULT is the default path that Lua uses to look for -** C libraries. -** CHANGE them if your machine has a non-conventional directory -** hierarchy or if you want to install your libraries in -** non-conventional directories. -*/ - -#define LUA_VDIR LUA_VERSION_MAJOR "." LUA_VERSION_MINOR -#if defined(_WIN32) /* { */ -/* -** In Windows, any exclamation mark ('!') in the path is replaced by the -** path of the directory of the executable file of the current process. -*/ -#define LUA_LDIR "!\\lua\\" -#define LUA_CDIR "!\\" -#define LUA_SHRDIR "!\\..\\share\\lua\\" LUA_VDIR "\\" - -#if !defined(LUA_PATH_DEFAULT) -#define LUA_PATH_DEFAULT \ - LUA_LDIR"?.lua;" LUA_LDIR"?\\init.lua;" \ - LUA_CDIR"?.lua;" LUA_CDIR"?\\init.lua;" \ - LUA_SHRDIR"?.lua;" LUA_SHRDIR"?\\init.lua;" \ - ".\\?.lua;" ".\\?\\init.lua" -#endif - -#if !defined(LUA_CPATH_DEFAULT) -#define LUA_CPATH_DEFAULT \ - LUA_CDIR"?.dll;" \ - LUA_CDIR"..\\lib\\lua\\" LUA_VDIR "\\?.dll;" \ - LUA_CDIR"loadall.dll;" ".\\?.dll" -#endif - -#else /* }{ */ - -#define LUA_ROOT "/usr/local/" -#define LUA_LDIR LUA_ROOT "share/lua/" LUA_VDIR "/" -#define LUA_CDIR LUA_ROOT "lib/lua/" LUA_VDIR "/" - -#if !defined(LUA_PATH_DEFAULT) -#define LUA_PATH_DEFAULT \ - LUA_LDIR"?.lua;" LUA_LDIR"?/init.lua;" \ - LUA_CDIR"?.lua;" LUA_CDIR"?/init.lua;" \ - "./?.lua;" "./?/init.lua" -#endif - -#if !defined(LUA_CPATH_DEFAULT) -#define LUA_CPATH_DEFAULT \ - LUA_CDIR"?.so;" LUA_CDIR"loadall.so;" "./?.so" -#endif - -#endif /* } */ - - -/* -@@ LUA_DIRSEP is the directory separator (for submodules). -** CHANGE it if your machine does not use "/" as the directory separator -** and is not Windows. (On Windows Lua automatically uses "\".) -*/ -#if !defined(LUA_DIRSEP) - -#if defined(_WIN32) -#define LUA_DIRSEP "\\" -#else -#define LUA_DIRSEP "/" -#endif - -#endif - -/* }================================================================== */ - - -/* -** {================================================================== -** Marks for exported symbols in the C code -** =================================================================== -*/ - -/* -@@ LUA_API is a mark for all core API functions. -@@ LUALIB_API is a mark for all auxiliary library functions. -@@ LUAMOD_API is a mark for all standard library opening functions. -** CHANGE them if you need to define those functions in some special way. -** For instance, if you want to create one Windows DLL with the core and -** the libraries, you may want to use the following definition (define -** LUA_BUILD_AS_DLL to get it). -*/ -#if defined(LUA_BUILD_AS_DLL) /* { */ - -#if defined(LUA_CORE) || defined(LUA_LIB) /* { */ -#define LUA_API __declspec(dllexport) -#else /* }{ */ -#define LUA_API __declspec(dllimport) -#endif /* } */ - -#else /* }{ */ - -#define LUA_API extern - -#endif /* } */ - - -/* -** More often than not the libs go together with the core. -*/ -#define LUALIB_API LUA_API -#define LUAMOD_API LUA_API - - -/* -@@ LUAI_FUNC is a mark for all extern functions that are not to be -** exported to outside modules. -@@ LUAI_DDEF and LUAI_DDEC are marks for all extern (const) variables, -** none of which to be exported to outside modules (LUAI_DDEF for -** definitions and LUAI_DDEC for declarations). -** CHANGE them if you need to mark them in some special way. Elf/gcc -** (versions 3.2 and later) mark them as "hidden" to optimize access -** when Lua is compiled as a shared library. Not all elf targets support -** this attribute. Unfortunately, gcc does not offer a way to check -** whether the target offers that support, and those without support -** give a warning about it. To avoid these warnings, change to the -** default definition. -*/ -#if defined(__GNUC__) && ((__GNUC__*100 + __GNUC_MINOR__) >= 302) && \ - defined(__ELF__) /* { */ -#define LUAI_FUNC __attribute__((visibility("internal"))) extern -#else /* }{ */ -#define LUAI_FUNC extern -#endif /* } */ - -#define LUAI_DDEC(dec) LUAI_FUNC dec -#define LUAI_DDEF /* empty */ - -/* }================================================================== */ - - -/* -** {================================================================== -** Compatibility with previous versions -** =================================================================== -*/ - -/* -@@ LUA_COMPAT_5_3 controls other macros for compatibility with Lua 5.3. -** You can define it to get all options, or change specific options -** to fit your specific needs. -*/ -#if defined(LUA_COMPAT_5_3) /* { */ - -/* -@@ LUA_COMPAT_MATHLIB controls the presence of several deprecated -** functions in the mathematical library. -** (These functions were already officially removed in 5.3; -** nevertheless they are still available here.) -*/ -#define LUA_COMPAT_MATHLIB - -/* -@@ LUA_COMPAT_APIINTCASTS controls the presence of macros for -** manipulating other integer types (lua_pushunsigned, lua_tounsigned, -** luaL_checkint, luaL_checklong, etc.) -** (These macros were also officially removed in 5.3, but they are still -** available here.) -*/ -#define LUA_COMPAT_APIINTCASTS - - -/* -@@ LUA_COMPAT_LT_LE controls the emulation of the '__le' metamethod -** using '__lt'. -*/ -#define LUA_COMPAT_LT_LE - - -/* -@@ The following macros supply trivial compatibility for some -** changes in the API. The macros themselves document how to -** change your code to avoid using them. -** (Once more, these macros were officially removed in 5.3, but they are -** still available here.) -*/ -#define lua_strlen(L,i) lua_rawlen(L, (i)) - -#define lua_objlen(L,i) lua_rawlen(L, (i)) - -#define lua_equal(L,idx1,idx2) lua_compare(L,(idx1),(idx2),LUA_OPEQ) -#define lua_lessthan(L,idx1,idx2) lua_compare(L,(idx1),(idx2),LUA_OPLT) - -#endif /* } */ - -/* }================================================================== */ - - - -/* -** {================================================================== -** Configuration for Numbers (low-level part). -** Change these definitions if no predefined LUA_FLOAT_* / LUA_INT_* -** satisfy your needs. -** =================================================================== -*/ - -/* -@@ LUAI_UACNUMBER is the result of a 'default argument promotion' -@@ over a floating number. -@@ l_floatatt(x) corrects float attribute 'x' to the proper float type -** by prefixing it with one of FLT/DBL/LDBL. -@@ LUA_NUMBER_FRMLEN is the length modifier for writing floats. -@@ LUA_NUMBER_FMT is the format for writing floats. -@@ lua_number2str converts a float to a string. -@@ l_mathop allows the addition of an 'l' or 'f' to all math operations. -@@ l_floor takes the floor of a float. -@@ lua_str2number converts a decimal numeral to a number. -*/ - - -/* The following definitions are good for most cases here */ - -#define l_floor(x) (l_mathop(floor)(x)) - -#define lua_number2str(s,sz,n) \ - l_sprintf((s), sz, LUA_NUMBER_FMT, (LUAI_UACNUMBER)(n)) - -/* -@@ lua_numbertointeger converts a float number with an integral value -** to an integer, or returns 0 if float is not within the range of -** a lua_Integer. (The range comparisons are tricky because of -** rounding. The tests here assume a two-complement representation, -** where MININTEGER always has an exact representation as a float; -** MAXINTEGER may not have one, and therefore its conversion to float -** may have an ill-defined value.) -*/ -#define lua_numbertointeger(n,p) \ - ((n) >= (LUA_NUMBER)(LUA_MININTEGER) && \ - (n) < -(LUA_NUMBER)(LUA_MININTEGER) && \ - (*(p) = (LUA_INTEGER)(n), 1)) - - -/* now the variable definitions */ - -#if LUA_FLOAT_TYPE == LUA_FLOAT_FLOAT /* { single float */ - -#define LUA_NUMBER float - -#define l_floatatt(n) (FLT_##n) - -#define LUAI_UACNUMBER double - -#define LUA_NUMBER_FRMLEN "" -#define LUA_NUMBER_FMT "%.7g" - -#define l_mathop(op) op##f - -#define lua_str2number(s,p) strtof((s), (p)) - - -#elif LUA_FLOAT_TYPE == LUA_FLOAT_LONGDOUBLE /* }{ long double */ - -#define LUA_NUMBER long double - -#define l_floatatt(n) (LDBL_##n) - -#define LUAI_UACNUMBER long double - -#define LUA_NUMBER_FRMLEN "L" -#define LUA_NUMBER_FMT "%.19Lg" - -#define l_mathop(op) op##l - -#define lua_str2number(s,p) strtold((s), (p)) - -#elif LUA_FLOAT_TYPE == LUA_FLOAT_DOUBLE /* }{ double */ - -#define LUA_NUMBER double - -#define l_floatatt(n) (DBL_##n) - -#define LUAI_UACNUMBER double - -#define LUA_NUMBER_FRMLEN "" -#define LUA_NUMBER_FMT "%.14g" - -#define l_mathop(op) op - -#define lua_str2number(s,p) strtod((s), (p)) - -#else /* }{ */ - -#error "numeric float type not defined" - -#endif /* } */ - - - -/* -@@ LUA_UNSIGNED is the unsigned version of LUA_INTEGER. -@@ LUAI_UACINT is the result of a 'default argument promotion' -@@ over a LUA_INTEGER. -@@ LUA_INTEGER_FRMLEN is the length modifier for reading/writing integers. -@@ LUA_INTEGER_FMT is the format for writing integers. -@@ LUA_MAXINTEGER is the maximum value for a LUA_INTEGER. -@@ LUA_MININTEGER is the minimum value for a LUA_INTEGER. -@@ LUA_MAXUNSIGNED is the maximum value for a LUA_UNSIGNED. -@@ lua_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.) -*/ -#if LUAI_IS32INT -#define LUAI_MAXSTACK 1000000 -#else -#define LUAI_MAXSTACK 15000 -#endif - - -/* -@@ LUA_EXTRASPACE defines the size of a raw memory area associated with -** a Lua state with very fast access. -** CHANGE it if you need a different size. -*/ -#define LUA_EXTRASPACE (sizeof(void *)) - - -/* -@@ LUA_IDSIZE gives the maximum size for the description of the source -@@ of a function in debug information. -** CHANGE it if you want a different size. -*/ -#define LUA_IDSIZE 60 - - -/* -@@ LUAL_BUFFERSIZE is the buffer size used by the lauxlib buffer system. -*/ -#define LUAL_BUFFERSIZE ((int)(16 * sizeof(void*) * sizeof(lua_Number))) - - -/* -@@ LUAI_MAXALIGN defines fields that, when used in a union, ensure -** maximum alignment for the other items in that union. -*/ -#define LUAI_MAXALIGN lua_Number n; double u; void *s; lua_Integer i; long l - -/* }================================================================== */ - - - - - -/* =================================================================== */ - -/* -** Local configuration. You can use this space to add your redefinitions -** without modifying the main part of the file. -*/ - - - - - -#endif - diff --git a/lua-5.4.4/include/lualib.h b/lua-5.4.4/include/lualib.h deleted file mode 100644 index 2625529..0000000 --- a/lua-5.4.4/include/lualib.h +++ /dev/null @@ -1,52 +0,0 @@ -/* -** $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.4/src/Makefile b/lua-5.4.4/src/Makefile deleted file mode 100644 index 1907381..0000000 --- a/lua-5.4.4/src/Makefile +++ /dev/null @@ -1,222 +0,0 @@ -# Makefile for building Lua -# See ../doc/readme.html for installation and customization instructions. - -# == CHANGE THE SETTINGS BELOW TO SUIT YOUR ENVIRONMENT ======================= - -# Your platform. See PLATS for possible values. -PLAT= guess - -CC= gcc -std=gnu99 -CFLAGS= -O2 -Wall -Wextra -DLUA_COMPAT_5_3 $(SYSCFLAGS) $(MYCFLAGS) -LDFLAGS= $(SYSLDFLAGS) $(MYLDFLAGS) -LIBS= -lm $(SYSLIBS) $(MYLIBS) - -AR= ar rcu -RANLIB= ranlib -RM= rm -f -UNAME= uname - -SYSCFLAGS= -SYSLDFLAGS= -SYSLIBS= - -MYCFLAGS= -MYLDFLAGS= -MYLIBS= -MYOBJS= - -# Special flags for compiler modules; -Os reduces code size. -CMCFLAGS= - -# == END OF USER SETTINGS -- NO NEED TO CHANGE ANYTHING BELOW THIS LINE ======= - -PLATS= guess aix bsd c89 freebsd generic linux linux-readline macosx mingw posix solaris - -LUA_A= liblua.a -CORE_O= lapi.o lcode.o lctype.o ldebug.o ldo.o ldump.o lfunc.o lgc.o llex.o lmem.o lobject.o lopcodes.o lparser.o lstate.o lstring.o ltable.o ltm.o lundump.o lvm.o lzio.o -LIB_O= lauxlib.o lbaselib.o lcorolib.o ldblib.o liolib.o lmathlib.o loadlib.o loslib.o lstrlib.o ltablib.o lutf8lib.o linit.o -BASE_O= $(CORE_O) $(LIB_O) $(MYOBJS) - -LUA_T= lua -LUA_O= lua.o - -LUAC_T= luac -LUAC_O= luac.o - -ALL_O= $(BASE_O) $(LUA_O) $(LUAC_O) -ALL_T= $(LUA_A) $(LUA_T) $(LUAC_T) -ALL_A= $(LUA_A) - -# Targets start here. -default: $(PLAT) - -all: $(ALL_T) - -o: $(ALL_O) - -a: $(ALL_A) - -$(LUA_A): $(BASE_O) - $(AR) $@ $(BASE_O) - $(RANLIB) $@ - -$(LUA_T): $(LUA_O) $(LUA_A) - $(CC) -o $@ $(LDFLAGS) $(LUA_O) $(LUA_A) $(LIBS) - -$(LUAC_T): $(LUAC_O) $(LUA_A) - $(CC) -o $@ $(LDFLAGS) $(LUAC_O) $(LUA_A) $(LIBS) - -test: - ./$(LUA_T) -v - -clean: - $(RM) $(ALL_T) $(ALL_O) - -depend: - @$(CC) $(CFLAGS) -MM l*.c - -echo: - @echo "PLAT= $(PLAT)" - @echo "CC= $(CC)" - @echo "CFLAGS= $(CFLAGS)" - @echo "LDFLAGS= $(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) - -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.4/src/lapi.c b/lua-5.4.4/src/lapi.c deleted file mode 100644 index 5ee6579..0000000 --- a/lua-5.4.4/src/lapi.c +++ /dev/null @@ -1,1466 +0,0 @@ -/* -** $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 + idx; - api_check(L, idx <= L->ci->top - (ci->func + 1), "unacceptable index"); - if (o >= L->top) return &G(L)->nilvalue; - else return s2v(o); - } - else if (!ispseudo(idx)) { /* negative index */ - api_check(L, idx != 0 && -idx <= L->top - (ci->func + 1), "invalid index"); - return s2v(L->top + idx); - } - else if (idx == LUA_REGISTRYINDEX) - return &G(L)->l_registry; - else { /* upvalues */ - idx = LUA_REGISTRYINDEX - idx; - api_check(L, idx <= MAXUPVAL + 1, "upvalue index too large"); - if (ttisCclosure(s2v(ci->func))) { /* C closure? */ - CClosure *func = clCvalue(s2v(ci->func)); - 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)), "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 + idx; - api_check(L, o < L->top, "invalid index"); - return o; - } - else { /* non-positive index */ - api_check(L, idx != 0 && -idx <= L->top - (ci->func + 1), "invalid index"); - api_check(L, !ispseudo(idx), "invalid index"); - return L->top + idx; - } -} - - -LUA_API int lua_checkstack (lua_State *L, int n) { - int res; - CallInfo *ci; - lua_lock(L); - ci = L->ci; - api_check(L, n >= 0, "negative 'n'"); - if (L->stack_last - L->top > n) /* stack large enough? */ - res = 1; /* yes; check is OK */ - else { /* no; need to grow stack */ - int inuse = cast_int(L->top - L->stack) + EXTRA_STACK; - if (inuse > LUAI_MAXSTACK - n) /* can grow without overflow? */ - res = 0; /* no */ - else /* try to grow stack */ - res = luaD_growstack(L, n, 0); - } - if (res && ci->top < L->top + n) - ci->top = L->top + n; /* adjust frame top */ - lua_unlock(L); - return res; -} - - -LUA_API void lua_xmove (lua_State *from, lua_State *to, int n) { - int i; - if (from == to) return; - lua_lock(to); - api_checknelems(from, n); - api_check(from, G(from) == G(to), "moving among independent states"); - api_check(from, to->ci->top - to->top >= n, "stack overflow"); - from->top -= n; - for (i = 0; i < n; i++) { - setobjs2s(to, to->top, from->top + i); - to->top++; /* stack already checked by previous 'api_check' */ - } - lua_unlock(to); -} - - -LUA_API lua_CFunction lua_atpanic (lua_State *L, lua_CFunction panicf) { - lua_CFunction old; - lua_lock(L); - old = G(L)->panic; - G(L)->panic = panicf; - lua_unlock(L); - return old; -} - - -LUA_API lua_Number lua_version (lua_State *L) { - UNUSED(L); - return LUA_VERSION_NUM; -} - - - -/* -** basic stack manipulation -*/ - - -/* -** convert an acceptable stack index into an absolute index -*/ -LUA_API int lua_absindex (lua_State *L, int idx) { - return (idx > 0 || ispseudo(idx)) - ? idx - : cast_int(L->top - L->ci->func) + idx; -} - - -LUA_API int lua_gettop (lua_State *L) { - return cast_int(L->top - (L->ci->func + 1)); -} - - -LUA_API void lua_settop (lua_State *L, int idx) { - CallInfo *ci; - StkId func, newtop; - ptrdiff_t diff; /* difference for new top */ - lua_lock(L); - ci = L->ci; - func = ci->func; - if (idx >= 0) { - api_check(L, idx <= ci->top - (func + 1), "new top too large"); - diff = ((func + 1) + idx) - L->top; - for (; diff > 0; diff--) - setnilvalue(s2v(L->top++)); /* clear new slots */ - } - else { - api_check(L, -(idx+1) <= (L->top - (func + 1)), "invalid new top"); - diff = idx + 1; /* will "subtract" index (as it is negative) */ - } - api_check(L, L->tbclist < L->top, "previous pop of an unclosed slot"); - newtop = L->top + diff; - if (diff < 0 && L->tbclist >= newtop) { - lua_assert(hastocloseCfunc(ci->nresults)); - luaF_close(L, newtop, CLOSEKTOP, 0); - } - L->top = newtop; /* correct top only after closing any upvalue */ - lua_unlock(L); -} - - -LUA_API void lua_closeslot (lua_State *L, int idx) { - StkId level; - lua_lock(L); - level = index2stack(L, idx); - api_check(L, hastocloseCfunc(L->ci->nresults) && L->tbclist == level, - "no variable to close at given level"); - luaF_close(L, level, CLOSEKTOP, 0); - level = index2stack(L, idx); /* stack may be moved */ - setnilvalue(s2v(level)); - lua_unlock(L); -} - - -/* -** Reverse the stack segment from 'from' to 'to' -** (auxiliary to 'lua_rotate') -** Note that we move(copy) only the value inside the stack. -** (We do not move additional fields that may exist.) -*/ -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 - 1; /* end of stack segment being rotated */ - p = index2stack(L, idx); /* start of segment */ - api_check(L, (n >= 0 ? n : -n) <= (t - p + 1), "invalid 'n'"); - m = (n >= 0 ? t - n : p - n - 1); /* end of prefix */ - reverse(L, p, m); /* reverse the prefix with length 'n' */ - reverse(L, m + 1, t); /* reverse the suffix */ - reverse(L, p, t); /* reverse the entire segment */ - lua_unlock(L); -} - - -LUA_API void lua_copy (lua_State *L, int fromidx, int toidx) { - TValue *fr, *to; - lua_lock(L); - fr = index2value(L, fromidx); - to = index2value(L, toidx); - api_check(L, isvalid(L, to), "invalid index"); - setobj(L, to, fr); - if (isupvalue(toidx)) /* function upvalue? */ - luaC_barrier(L, clCvalue(s2v(L->ci->func)), fr); - /* LUA_REGISTRYINDEX does not need gc barrier - (collector revisits it before finishing collection) */ - lua_unlock(L); -} - - -LUA_API void lua_pushvalue (lua_State *L, int idx) { - lua_lock(L); - setobj2s(L, L->top, index2value(L, idx)); - api_incr_top(L); - lua_unlock(L); -} - - - -/* -** access functions (stack -> C) -*/ - - -LUA_API int lua_type (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return (isvalid(L, o) ? ttype(o) : LUA_TNONE); -} - - -LUA_API const char *lua_typename (lua_State *L, int t) { - UNUSED(L); - api_check(L, LUA_TNONE <= t && t < LUA_NUMTYPES, "invalid type"); - return ttypename(t); -} - - -LUA_API int lua_iscfunction (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return (ttislcf(o) || (ttisCclosure(o))); -} - - -LUA_API int lua_isinteger (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return ttisinteger(o); -} - - -LUA_API int lua_isnumber (lua_State *L, int idx) { - lua_Number n; - const TValue *o = index2value(L, idx); - return tonumber(o, &n); -} - - -LUA_API int lua_isstring (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return (ttisstring(o) || cvt2str(o)); -} - - -LUA_API int lua_isuserdata (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return (ttisfulluserdata(o) || ttislightuserdata(o)); -} - - -LUA_API int lua_rawequal (lua_State *L, int index1, int index2) { - const TValue *o1 = index2value(L, index1); - const TValue *o2 = index2value(L, index2); - return (isvalid(L, o1) && isvalid(L, o2)) ? luaV_rawequalobj(o1, o2) : 0; -} - - -LUA_API void lua_arith (lua_State *L, int op) { - lua_lock(L); - if (op != LUA_OPUNM && op != LUA_OPBNOT) - api_checknelems(L, 2); /* all other operations expect two operands */ - else { /* for unary operations, add fake 2nd operand */ - api_checknelems(L, 1); - setobjs2s(L, L->top, L->top - 1); - api_incr_top(L); - } - /* first operand at top - 2, second at top - 1; result go to top - 2 */ - luaO_arith(L, op, s2v(L->top - 2), s2v(L->top - 1), L->top - 2); - L->top--; /* remove second operand */ - lua_unlock(L); -} - - -LUA_API int lua_compare (lua_State *L, int index1, int index2, int op) { - const TValue *o1; - const TValue *o2; - int i = 0; - lua_lock(L); /* may call tag method */ - o1 = index2value(L, index1); - o2 = index2value(L, index2); - if (isvalid(L, o1) && isvalid(L, o2)) { - switch (op) { - case LUA_OPEQ: i = luaV_equalobj(L, o1, o2); break; - case LUA_OPLT: i = luaV_lessthan(L, o1, o2); break; - case LUA_OPLE: i = luaV_lessequal(L, o1, o2); break; - default: api_check(L, 0, "invalid option"); - } - } - lua_unlock(L); - return i; -} - - -LUA_API size_t lua_stringtonumber (lua_State *L, const char *s) { - size_t sz = luaO_str2num(s, s2v(L->top)); - if (sz != 0) - api_incr_top(L); - return sz; -} - - -LUA_API lua_Number lua_tonumberx (lua_State *L, int idx, int *pisnum) { - lua_Number n = 0; - const TValue *o = index2value(L, idx); - int isnum = tonumber(o, &n); - if (pisnum) - *pisnum = isnum; - return n; -} - - -LUA_API lua_Integer lua_tointegerx (lua_State *L, int idx, int *pisnum) { - lua_Integer res = 0; - const TValue *o = index2value(L, idx); - int isnum = tointeger(o, &res); - if (pisnum) - *pisnum = isnum; - return res; -} - - -LUA_API int lua_toboolean (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - return !l_isfalse(o); -} - - -LUA_API const char *lua_tolstring (lua_State *L, int idx, size_t *len) { - TValue *o; - lua_lock(L); - o = index2value(L, idx); - if (!ttisstring(o)) { - if (!cvt2str(o)) { /* not convertible? */ - if (len != NULL) *len = 0; - lua_unlock(L); - return NULL; - } - luaO_tostring(L, o); - luaC_checkGC(L); - o = index2value(L, idx); /* previous call may reallocate the stack */ - } - if (len != NULL) - *len = vslen(o); - lua_unlock(L); - return svalue(o); -} - - -LUA_API lua_Unsigned lua_rawlen (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - switch (ttypetag(o)) { - case LUA_VSHRSTR: return tsvalue(o)->shrlen; - case LUA_VLNGSTR: return tsvalue(o)->u.lnglen; - case LUA_VUSERDATA: return uvalue(o)->len; - case LUA_VTABLE: return luaH_getn(hvalue(o)); - default: return 0; - } -} - - -LUA_API lua_CFunction lua_tocfunction (lua_State *L, int idx) { - const TValue *o = index2value(L, idx); - if (ttislcf(o)) return fvalue(o); - else if (ttisCclosure(o)) - return clCvalue(o)->f; - else return NULL; /* not a C function */ -} - - -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)); - api_incr_top(L); - lua_unlock(L); -} - - -LUA_API void lua_pushnumber (lua_State *L, lua_Number n) { - lua_lock(L); - setfltvalue(s2v(L->top), n); - api_incr_top(L); - lua_unlock(L); -} - - -LUA_API void lua_pushinteger (lua_State *L, lua_Integer n) { - lua_lock(L); - setivalue(s2v(L->top), n); - api_incr_top(L); - lua_unlock(L); -} - - -/* -** Pushes on the stack a string with given length. Avoid using 's' when -** 'len' == 0 (as 's' can be NULL in that case), due to later use of -** 'memcmp' and 'memcpy'. -*/ -LUA_API const char *lua_pushlstring (lua_State *L, const char *s, size_t len) { - TString *ts; - lua_lock(L); - ts = (len == 0) ? luaS_new(L, "") : luaS_newlstr(L, s, len); - setsvalue2s(L, L->top, ts); - api_incr_top(L); - luaC_checkGC(L); - lua_unlock(L); - return getstr(ts); -} - - -LUA_API const char *lua_pushstring (lua_State *L, const char *s) { - lua_lock(L); - if (s == NULL) - setnilvalue(s2v(L->top)); - else { - TString *ts; - ts = luaS_new(L, s); - setsvalue2s(L, L->top, ts); - s = getstr(ts); /* internal copy's address */ - } - api_incr_top(L); - luaC_checkGC(L); - lua_unlock(L); - return s; -} - - -LUA_API const char *lua_pushvfstring (lua_State *L, const char *fmt, - va_list argp) { - const char *ret; - lua_lock(L); - ret = luaO_pushvfstring(L, fmt, argp); - luaC_checkGC(L); - lua_unlock(L); - return ret; -} - - -LUA_API const char *lua_pushfstring (lua_State *L, const char *fmt, ...) { - const char *ret; - va_list argp; - lua_lock(L); - va_start(argp, fmt); - ret = luaO_pushvfstring(L, fmt, argp); - va_end(argp); - luaC_checkGC(L); - lua_unlock(L); - return ret; -} - - -LUA_API void lua_pushcclosure (lua_State *L, lua_CFunction fn, int n) { - lua_lock(L); - if (n == 0) { - setfvalue(s2v(L->top), fn); - api_incr_top(L); - } - else { - CClosure *cl; - api_checknelems(L, n); - api_check(L, n <= MAXUPVAL, "upvalue index too large"); - cl = luaF_newCclosure(L, n); - cl->f = fn; - L->top -= n; - while (n--) { - setobj2n(L, &cl->upvalue[n], s2v(L->top + n)); - /* does not need barrier because closure is white */ - lua_assert(iswhite(cl)); - } - setclCvalue(L, s2v(L->top), cl); - api_incr_top(L); - luaC_checkGC(L); - } - lua_unlock(L); -} - - -LUA_API void lua_pushboolean (lua_State *L, int b) { - lua_lock(L); - if (b) - setbtvalue(s2v(L->top)); - else - setbfvalue(s2v(L->top)); - api_incr_top(L); - lua_unlock(L); -} - - -LUA_API void lua_pushlightuserdata (lua_State *L, void *p) { - lua_lock(L); - setpvalue(s2v(L->top), p); - api_incr_top(L); - lua_unlock(L); -} - - -LUA_API int lua_pushthread (lua_State *L) { - lua_lock(L); - setthvalue(L, s2v(L->top), L); - api_incr_top(L); - lua_unlock(L); - return (G(L)->mainthread == L); -} - - - -/* -** get functions (Lua -> stack) -*/ - - -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, slot); - api_incr_top(L); - } - else { - setsvalue2s(L, L->top, str); - api_incr_top(L); - luaV_finishget(L, t, s2v(L->top - 1), L->top - 1, slot); - } - lua_unlock(L); - return ttype(s2v(L->top - 1)); -} - - -/* -** Get the global table in the registry. Since all predefined -** indices in the registry were inserted right when the registry -** was created and never removed, they must always be in the array -** part of the registry. -*/ -#define getGtable(L) \ - (&hvalue(&G(L)->l_registry)->array[LUA_RIDX_GLOBALS - 1]) - - -LUA_API int lua_getglobal (lua_State *L, const char *name) { - const TValue *G; - lua_lock(L); - G = getGtable(L); - return auxgetstr(L, G, name); -} - - -LUA_API int lua_gettable (lua_State *L, int idx) { - const TValue *slot; - TValue *t; - lua_lock(L); - t = index2value(L, idx); - if (luaV_fastget(L, t, s2v(L->top - 1), slot, luaH_get)) { - setobj2s(L, L->top - 1, slot); - } - else - luaV_finishget(L, t, s2v(L->top - 1), L->top - 1, slot); - lua_unlock(L); - return ttype(s2v(L->top - 1)); -} - - -LUA_API int lua_getfield (lua_State *L, int idx, const char *k) { - lua_lock(L); - return auxgetstr(L, index2value(L, idx), k); -} - - -LUA_API int lua_geti (lua_State *L, int idx, lua_Integer n) { - TValue *t; - const TValue *slot; - lua_lock(L); - t = index2value(L, idx); - if (luaV_fastgeti(L, t, n, slot)) { - setobj2s(L, L->top, slot); - } - else { - TValue aux; - setivalue(&aux, n); - luaV_finishget(L, t, &aux, L->top, slot); - } - api_incr_top(L); - lua_unlock(L); - return ttype(s2v(L->top - 1)); -} - - -l_sinline int finishrawget (lua_State *L, const TValue *val) { - if (isempty(val)) /* avoid copying empty items to the stack */ - setnilvalue(s2v(L->top)); - else - setobj2s(L, L->top, val); - api_incr_top(L); - lua_unlock(L); - return ttype(s2v(L->top - 1)); -} - - -static Table *gettable (lua_State *L, int idx) { - TValue *t = index2value(L, idx); - api_check(L, ttistable(t), "table expected"); - return hvalue(t); -} - - -LUA_API int lua_rawget (lua_State *L, int idx) { - Table *t; - const TValue *val; - lua_lock(L); - api_checknelems(L, 1); - t = gettable(L, idx); - val = luaH_get(t, s2v(L->top - 1)); - L->top--; /* remove key */ - return finishrawget(L, val); -} - - -LUA_API int lua_rawgeti (lua_State *L, int idx, lua_Integer n) { - Table *t; - lua_lock(L); - t = gettable(L, idx); - return finishrawget(L, luaH_getint(t, n)); -} - - -LUA_API int lua_rawgetp (lua_State *L, int idx, const void *p) { - Table *t; - TValue k; - lua_lock(L); - t = gettable(L, idx); - setpvalue(&k, cast_voidp(p)); - return finishrawget(L, luaH_get(t, &k)); -} - - -LUA_API void lua_createtable (lua_State *L, int narray, int nrec) { - Table *t; - lua_lock(L); - t = luaH_new(L); - sethvalue2s(L, L->top, t); - api_incr_top(L); - if (narray > 0 || nrec > 0) - luaH_resize(L, t, narray, nrec); - luaC_checkGC(L); - lua_unlock(L); -} - - -LUA_API int lua_getmetatable (lua_State *L, int objindex) { - const TValue *obj; - Table *mt; - int res = 0; - lua_lock(L); - obj = index2value(L, objindex); - switch (ttype(obj)) { - case LUA_TTABLE: - mt = hvalue(obj)->metatable; - break; - case LUA_TUSERDATA: - mt = uvalue(obj)->metatable; - break; - default: - mt = G(L)->mt[ttype(obj)]; - break; - } - if (mt != NULL) { - sethvalue2s(L, L->top, mt); - api_incr_top(L); - res = 1; - } - lua_unlock(L); - return res; -} - - -LUA_API int lua_getiuservalue (lua_State *L, int idx, int n) { - TValue *o; - int t; - lua_lock(L); - o = index2value(L, idx); - api_check(L, ttisfulluserdata(o), "full userdata expected"); - if (n <= 0 || n > uvalue(o)->nuvalue) { - setnilvalue(s2v(L->top)); - t = LUA_TNONE; - } - else { - setobj2s(L, L->top, &uvalue(o)->uv[n - 1].uv); - t = ttype(s2v(L->top)); - } - api_incr_top(L); - lua_unlock(L); - return t; -} - - -/* -** set functions (stack -> Lua) -*/ - -/* -** t[k] = value at the top of the stack (where 'k' is a string) -*/ -static void auxsetstr (lua_State *L, const TValue *t, const char *k) { - const TValue *slot; - TString *str = luaS_new(L, k); - api_checknelems(L, 1); - if (luaV_fastget(L, t, str, slot, luaH_getstr)) { - luaV_finishfastset(L, t, slot, s2v(L->top - 1)); - L->top--; /* pop value */ - } - else { - setsvalue2s(L, L->top, str); /* push 'str' (to make it a TValue) */ - api_incr_top(L); - luaV_finishset(L, t, s2v(L->top - 1), s2v(L->top - 2), slot); - L->top -= 2; /* pop value and key */ - } - lua_unlock(L); /* lock done by caller */ -} - - -LUA_API void lua_setglobal (lua_State *L, const char *name) { - const TValue *G; - lua_lock(L); /* unlock done in 'auxsetstr' */ - G = getGtable(L); - auxsetstr(L, G, name); -} - - -LUA_API void lua_settable (lua_State *L, int idx) { - TValue *t; - const TValue *slot; - lua_lock(L); - api_checknelems(L, 2); - t = index2value(L, idx); - if (luaV_fastget(L, t, s2v(L->top - 2), slot, luaH_get)) { - luaV_finishfastset(L, t, slot, s2v(L->top - 1)); - } - else - luaV_finishset(L, t, s2v(L->top - 2), s2v(L->top - 1), slot); - L->top -= 2; /* pop index and value */ - lua_unlock(L); -} - - -LUA_API void lua_setfield (lua_State *L, int idx, const char *k) { - lua_lock(L); /* unlock done in 'auxsetstr' */ - auxsetstr(L, index2value(L, idx), k); -} - - -LUA_API void lua_seti (lua_State *L, int idx, lua_Integer n) { - TValue *t; - const TValue *slot; - lua_lock(L); - api_checknelems(L, 1); - t = index2value(L, idx); - if (luaV_fastgeti(L, t, n, slot)) { - luaV_finishfastset(L, t, slot, s2v(L->top - 1)); - } - else { - TValue aux; - setivalue(&aux, n); - luaV_finishset(L, t, &aux, s2v(L->top - 1), slot); - } - L->top--; /* pop value */ - lua_unlock(L); -} - - -static void aux_rawset (lua_State *L, int idx, TValue *key, int n) { - Table *t; - lua_lock(L); - api_checknelems(L, n); - t = gettable(L, idx); - luaH_set(L, t, key, s2v(L->top - 1)); - invalidateTMcache(t); - luaC_barrierback(L, obj2gco(t), s2v(L->top - 1)); - L->top -= n; - lua_unlock(L); -} - - -LUA_API void lua_rawset (lua_State *L, int idx) { - aux_rawset(L, idx, s2v(L->top - 2), 2); -} - - -LUA_API void lua_rawsetp (lua_State *L, int idx, const void *p) { - TValue k; - setpvalue(&k, cast_voidp(p)); - aux_rawset(L, idx, &k, 1); -} - - -LUA_API void lua_rawseti (lua_State *L, int idx, lua_Integer n) { - Table *t; - lua_lock(L); - api_checknelems(L, 1); - t = gettable(L, idx); - luaH_setint(L, t, n, s2v(L->top - 1)); - luaC_barrierback(L, obj2gco(t), s2v(L->top - 1)); - L->top--; - lua_unlock(L); -} - - -LUA_API int lua_setmetatable (lua_State *L, int objindex) { - TValue *obj; - Table *mt; - lua_lock(L); - api_checknelems(L, 1); - obj = index2value(L, objindex); - if (ttisnil(s2v(L->top - 1))) - mt = NULL; - else { - api_check(L, ttistable(s2v(L->top - 1)), "table expected"); - mt = hvalue(s2v(L->top - 1)); - } - switch (ttype(obj)) { - case LUA_TTABLE: { - hvalue(obj)->metatable = mt; - if (mt) { - luaC_objbarrier(L, gcvalue(obj), mt); - luaC_checkfinalizer(L, gcvalue(obj), mt); - } - break; - } - case LUA_TUSERDATA: { - uvalue(obj)->metatable = mt; - if (mt) { - luaC_objbarrier(L, uvalue(obj), mt); - luaC_checkfinalizer(L, gcvalue(obj), mt); - } - break; - } - default: { - G(L)->mt[ttype(obj)] = mt; - break; - } - } - L->top--; - lua_unlock(L); - return 1; -} - - -LUA_API int lua_setiuservalue (lua_State *L, int idx, int n) { - TValue *o; - int res; - lua_lock(L); - api_checknelems(L, 1); - o = index2value(L, idx); - api_check(L, ttisfulluserdata(o), "full userdata expected"); - if (!(cast_uint(n) - 1u < cast_uint(uvalue(o)->nuvalue))) - res = 0; /* 'n' not in [1, uvalue(o)->nuvalue] */ - else { - setobj(L, &uvalue(o)->uv[n - 1].uv, s2v(L->top - 1)); - luaC_barrierback(L, gcvalue(o), s2v(L->top - 1)); - res = 1; - } - L->top--; - lua_unlock(L); - return res; -} - - -/* -** 'load' and 'call' functions (run Lua code) -*/ - - -#define checkresults(L,na,nr) \ - api_check(L, (nr) == LUA_MULTRET || (L->ci->top - L->top >= (nr) - (na)), \ - "results from function overflow current stack size") - - -LUA_API void lua_callk (lua_State *L, int nargs, int nresults, - lua_KContext ctx, lua_KFunction k) { - StkId func; - lua_lock(L); - api_check(L, k == NULL || !isLua(L->ci), - "cannot use continuations inside hooks"); - api_checknelems(L, nargs+1); - api_check(L, L->status == LUA_OK, "cannot do calls on non-normal thread"); - checkresults(L, nargs, nresults); - func = L->top - (nargs+1); - if (k != NULL && yieldable(L)) { /* need to prepare continuation? */ - L->ci->u.c.k = k; /* save continuation */ - L->ci->u.c.ctx = ctx; /* save context */ - luaD_call(L, func, nresults); /* do the call */ - } - else /* no continuation or no yieldable */ - luaD_callnoyield(L, func, nresults); /* just do the call */ - adjustresults(L, nresults); - lua_unlock(L); -} - - - -/* -** Execute a protected call. -*/ -struct CallS { /* data to 'f_call' */ - StkId func; - int nresults; -}; - - -static void f_call (lua_State *L, void *ud) { - struct CallS *c = cast(struct CallS *, ud); - luaD_callnoyield(L, c->func, c->nresults); -} - - - -LUA_API int lua_pcallk (lua_State *L, int nargs, int nresults, int errfunc, - lua_KContext ctx, lua_KFunction k) { - struct CallS c; - int status; - ptrdiff_t func; - lua_lock(L); - api_check(L, k == NULL || !isLua(L->ci), - "cannot use continuations inside hooks"); - api_checknelems(L, nargs+1); - api_check(L, L->status == LUA_OK, "cannot do calls on non-normal thread"); - checkresults(L, nargs, nresults); - if (errfunc == 0) - func = 0; - else { - StkId o = index2stack(L, errfunc); - api_check(L, ttisfunction(s2v(o)), "error handler must be a function"); - func = savestack(L, o); - } - c.func = L->top - (nargs+1); /* function to be called */ - if (k == NULL || !yieldable(L)) { /* no continuation or no yieldable? */ - c.nresults = nresults; /* do a 'conventional' protected call */ - status = luaD_pcall(L, f_call, &c, savestack(L, c.func), func); - } - else { /* prepare continuation (call is already protected by 'resume') */ - CallInfo *ci = L->ci; - ci->u.c.k = k; /* save continuation */ - ci->u.c.ctx = ctx; /* save context */ - /* save information for error recovery */ - ci->u2.funcidx = cast_int(savestack(L, c.func)); - ci->u.c.old_errfunc = L->errfunc; - L->errfunc = func; - setoah(ci->callstatus, L->allowhook); /* save value of 'allowhook' */ - ci->callstatus |= CIST_YPCALL; /* function can do error recovery */ - luaD_call(L, c.func, nresults); /* do the call */ - ci->callstatus &= ~CIST_YPCALL; - L->errfunc = ci->u.c.old_errfunc; - status = LUA_OK; /* if it is here, there were no errors */ - } - adjustresults(L, nresults); - lua_unlock(L); - return status; -} - - -LUA_API int lua_load (lua_State *L, lua_Reader reader, void *data, - const char *chunkname, const char *mode) { - ZIO z; - int status; - lua_lock(L); - if (!chunkname) chunkname = "?"; - luaZ_init(L, &z, reader, data); - status = luaD_protectedparser(L, &z, chunkname, mode); - if (status == LUA_OK) { /* no errors? */ - LClosure *f = clLvalue(s2v(L->top - 1)); /* get newly created function */ - if (f->nupvalues >= 1) { /* does it have an upvalue? */ - /* get global table from registry */ - const TValue *gt = getGtable(L); - /* set global table as 1st upvalue of 'f' (may be LUA_ENV) */ - setobj(L, f->upvals[0]->v, gt); - luaC_barrier(L, f->upvals[0], gt); - } - } - lua_unlock(L); - return status; -} - - -LUA_API int lua_dump (lua_State *L, lua_Writer writer, void *data, int strip) { - int status; - TValue *o; - lua_lock(L); - api_checknelems(L, 1); - o = s2v(L->top - 1); - if (isLfunction(o)) - status = luaU_dump(L, getproto(o), writer, data, strip); - else - status = 1; - lua_unlock(L); - return status; -} - - -LUA_API int lua_status (lua_State *L) { - return L->status; -} - - -/* -** Garbage-collection function -*/ -LUA_API int lua_gc (lua_State *L, int what, ...) { - va_list argp; - int res = 0; - global_State *g = 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 - 1); - api_checknelems(L, 1); - /* error object is the memory error message? */ - if (ttisshrstring(errobj) && eqshrstr(tsvalue(errobj), G(L)->memerrmsg)) - luaM_error(L); /* raise a memory error */ - else - luaG_errormsg(L); /* raise a regular error */ - /* code unreachable; will unlock when control actually leaves the kernel */ - return 0; /* to avoid warnings */ -} - - -LUA_API int lua_next (lua_State *L, int idx) { - Table *t; - int more; - lua_lock(L); - api_checknelems(L, 1); - t = gettable(L, idx); - more = luaH_next(L, t, L->top - 1); - if (more) { - api_incr_top(L); - } - else /* no more elements */ - L->top -= 1; /* remove key */ - lua_unlock(L); - return more; -} - - -LUA_API void lua_toclose (lua_State *L, int idx) { - int nresults; - StkId o; - lua_lock(L); - o = index2stack(L, idx); - nresults = L->ci->nresults; - api_check(L, L->tbclist < o, "given index below or equal a marked one"); - luaF_newtbcupval(L, o); /* create new to-be-closed upvalue */ - if (!hastocloseCfunc(nresults)) /* function not marked yet? */ - L->ci->nresults = codeNresults(nresults); /* mark it */ - lua_assert(hastocloseCfunc(L->ci->nresults)); - lua_unlock(L); -} - - -LUA_API void lua_concat (lua_State *L, int n) { - lua_lock(L); - api_checknelems(L, n); - if (n > 0) - luaV_concat(L, n); - else { /* nothing to concatenate */ - setsvalue2s(L, L->top, luaS_newlstr(L, "", 0)); /* push empty string */ - api_incr_top(L); - } - luaC_checkGC(L); - lua_unlock(L); -} - - -LUA_API void lua_len (lua_State *L, int idx) { - TValue *t; - lua_lock(L); - t = index2value(L, idx); - luaV_objlen(L, L->top, t); - api_incr_top(L); - lua_unlock(L); -} - - -LUA_API lua_Alloc lua_getallocf (lua_State *L, void **ud) { - lua_Alloc f; - lua_lock(L); - if (ud) *ud = G(L)->ud; - f = G(L)->frealloc; - lua_unlock(L); - return f; -} - - -LUA_API void lua_setallocf (lua_State *L, lua_Alloc f, void *ud) { - lua_lock(L); - G(L)->ud = ud; - G(L)->frealloc = f; - lua_unlock(L); -} - - -void lua_setwarnf (lua_State *L, lua_WarnFunction f, void *ud) { - lua_lock(L); - G(L)->ud_warn = ud; - G(L)->warnf = f; - lua_unlock(L); -} - - -void lua_warning (lua_State *L, const char *msg, int tocont) { - lua_lock(L); - luaE_warning(L, msg, tocont); - lua_unlock(L); -} - - - -LUA_API void *lua_newuserdatauv (lua_State *L, size_t size, int nuvalue) { - Udata *u; - lua_lock(L); - api_check(L, 0 <= nuvalue && nuvalue < USHRT_MAX, "invalid value"); - u = luaS_newudata(L, size, nuvalue); - setuvalue(L, s2v(L->top), u); - api_incr_top(L); - luaC_checkGC(L); - lua_unlock(L); - return getudatamem(u); -} - - - -static const char *aux_upvalue (TValue *fi, int n, TValue **val, - GCObject **owner) { - switch (ttypetag(fi)) { - case LUA_VCCL: { /* C closure */ - CClosure *f = clCvalue(fi); - if (!(cast_uint(n) - 1u < cast_uint(f->nupvalues))) - return NULL; /* 'n' not in [1, f->nupvalues] */ - *val = &f->upvalue[n-1]; - if (owner) *owner = obj2gco(f); - return ""; - } - case LUA_VLCL: { /* Lua closure */ - LClosure *f = clLvalue(fi); - TString *name; - Proto *p = f->p; - if (!(cast_uint(n) - 1u < cast_uint(p->sizeupvalues))) - return NULL; /* 'n' not in [1, p->sizeupvalues] */ - *val = f->upvals[n-1]->v; - if (owner) *owner = obj2gco(f->upvals[n - 1]); - name = p->upvalues[n-1].name; - return (name == NULL) ? "(no name)" : getstr(name); - } - default: return NULL; /* not a closure */ - } -} - - -LUA_API const char *lua_getupvalue (lua_State *L, int funcindex, int n) { - const char *name; - TValue *val = NULL; /* to avoid warnings */ - lua_lock(L); - name = aux_upvalue(index2value(L, funcindex), n, &val, NULL); - if (name) { - setobj2s(L, L->top, val); - api_incr_top(L); - } - lua_unlock(L); - return name; -} - - -LUA_API const char *lua_setupvalue (lua_State *L, int funcindex, int n) { - const char *name; - TValue *val = NULL; /* to avoid warnings */ - GCObject *owner = NULL; /* to avoid warnings */ - TValue *fi; - lua_lock(L); - fi = index2value(L, funcindex); - api_checknelems(L, 1); - name = aux_upvalue(fi, n, &val, &owner); - if (name) { - L->top--; - setobj(L, val, s2v(L->top)); - luaC_barrier(L, owner, val); - } - lua_unlock(L); - return name; -} - - -static UpVal **getupvalref (lua_State *L, int fidx, int n, LClosure **pf) { - static const UpVal *const nullup = NULL; - LClosure *f; - TValue *fi = index2value(L, fidx); - api_check(L, ttisLclosure(fi), "Lua function expected"); - f = clLvalue(fi); - if (pf) *pf = f; - if (1 <= n && n <= f->p->sizeupvalues) - return &f->upvals[n - 1]; /* get its upvalue pointer */ - else - return (UpVal**)&nullup; -} - - -LUA_API void *lua_upvalueid (lua_State *L, int fidx, int n) { - TValue *fi = index2value(L, fidx); - switch (ttypetag(fi)) { - case LUA_VLCL: { /* lua closure */ - return *getupvalref(L, fidx, n, NULL); - } - case LUA_VCCL: { /* C closure */ - CClosure *f = clCvalue(fi); - if (1 <= n && n <= f->nupvalues) - return &f->upvalue[n - 1]; - /* else */ - } /* FALLTHROUGH */ - case LUA_VLCF: - return NULL; /* light C functions have no upvalues */ - default: { - api_check(L, 0, "function expected"); - return NULL; - } - } -} - - -LUA_API void lua_upvaluejoin (lua_State *L, int fidx1, int n1, - int fidx2, int n2) { - LClosure *f1; - UpVal **up1 = getupvalref(L, fidx1, n1, &f1); - UpVal **up2 = getupvalref(L, fidx2, n2, NULL); - api_check(L, *up1 != NULL && *up2 != NULL, "invalid upvalue index"); - *up1 = *up2; - luaC_objbarrier(L, f1, *up1); -} - - diff --git a/lua-5.4.4/src/lapi.h b/lua-5.4.4/src/lapi.h deleted file mode 100644 index 9e99cc4..0000000 --- a/lua-5.4.4/src/lapi.h +++ /dev/null @@ -1,49 +0,0 @@ -/* -** $Id: lapi.h $ -** Auxiliary functions from Lua API -** See Copyright Notice in lua.h -*/ - -#ifndef lapi_h -#define lapi_h - - -#include "llimits.h" -#include "lstate.h" - - -/* Increments 'L->top', checking for stack overflows */ -#define api_incr_top(L) {L->top++; api_check(L, L->top <= L->ci->top, \ - "stack overflow");} - - -/* -** If a call returns too many multiple returns, the callee may not have -** stack space to accommodate all results. In this case, this macro -** increases its stack space ('L->ci->top'). -*/ -#define adjustresults(L,nres) \ - { if ((nres) <= LUA_MULTRET && L->ci->top < L->top) L->ci->top = L->top; } - - -/* Ensure the stack has at least 'n' elements */ -#define api_checknelems(L,n) api_check(L, (n) < (L->top - L->ci->func), \ - "not enough elements in the stack") - - -/* -** To reduce the overhead of returning from C functions, the presence of -** to-be-closed variables in these functions is coded in the CallInfo's -** field 'nresults', in a way that functions with no to-be-closed variables -** with zero, one, or "all" wanted results have no overhead. Functions -** with other number of wanted results, as well as functions with -** variables to be closed, have an extra check. -*/ - -#define hastocloseCfunc(n) ((n) < LUA_MULTRET) - -/* Map [-1, inf) (range of 'nresults') into (-inf, -2] */ -#define codeNresults(n) (-(n) - 3) -#define decodeNresults(n) (-(n) - 3) - -#endif diff --git a/lua-5.4.4/src/lauxlib.c b/lua-5.4.4/src/lauxlib.c deleted file mode 100644 index 8ed1da1..0000000 --- a/lua-5.4.4/src/lauxlib.c +++ /dev/null @@ -1,1106 +0,0 @@ -/* -** $Id: lauxlib.c $ -** Auxiliary functions for building Lua libraries -** See Copyright Notice in lua.h -*/ - -#define lauxlib_c -#define LUA_LIB - -#include "lprefix.h" - - -#include -#include -#include -#include -#include - - -/* -** This file uses only the official API of Lua. -** Any function declared here could be written as an application function. -*/ - -#include "lua.h" - -#include "lauxlib.h" - - -#if !defined(MAX_SIZET) -/* maximum value for size_t */ -#define MAX_SIZET ((size_t)(~(size_t)0)) -#endif - - -/* -** {====================================================== -** Traceback -** ======================================================= -*/ - - -#define LEVELS1 10 /* size of the first part of the stack */ -#define LEVELS2 11 /* size of the second part of the stack */ - - - -/* -** Search for 'objidx' in table at index -1. ('objidx' must be an -** absolute index.) Return 1 + string at top if it found a good name. -*/ -static int findfield (lua_State *L, int objidx, int level) { - if (level == 0 || !lua_istable(L, -1)) - return 0; /* not found */ - lua_pushnil(L); /* start 'next' loop */ - while (lua_next(L, -2)) { /* for each pair in table */ - if (lua_type(L, -2) == LUA_TSTRING) { /* ignore non-string keys */ - if (lua_rawequal(L, objidx, -1)) { /* found object? */ - lua_pop(L, 1); /* remove value (but keep name) */ - return 1; - } - else if (findfield(L, objidx, level - 1)) { /* try recursively */ - /* stack: lib_name, lib_table, field_name (top) */ - lua_pushliteral(L, "."); /* place '.' between the two names */ - lua_replace(L, -3); /* (in the slot occupied by table) */ - lua_concat(L, 3); /* lib_name.field_name */ - return 1; - } - } - lua_pop(L, 1); /* remove value */ - } - return 0; /* not found */ -} - - -/* -** Search for a name for a function in all loaded modules -*/ -static int pushglobalfuncname (lua_State *L, lua_Debug *ar) { - int top = lua_gettop(L); - lua_getinfo(L, "f", ar); /* push function */ - lua_getfield(L, LUA_REGISTRYINDEX, LUA_LOADED_TABLE); - if (findfield(L, top + 1, 2)) { - const char *name = lua_tostring(L, -1); - if (strncmp(name, LUA_GNAME ".", 3) == 0) { /* name start with '_G.'? */ - lua_pushstring(L, name + 3); /* push name without prefix */ - lua_remove(L, -2); /* remove original name */ - } - lua_copy(L, -1, top + 1); /* copy name to proper place */ - lua_settop(L, top + 1); /* remove table "loaded" and name copy */ - return 1; - } - else { - lua_settop(L, top); /* remove function and global table */ - return 0; - } -} - - -static void pushfuncname (lua_State *L, lua_Debug *ar) { - if (pushglobalfuncname(L, ar)) { /* try first a global name */ - lua_pushfstring(L, "function '%s'", lua_tostring(L, -1)); - lua_remove(L, -2); /* remove name */ - } - else if (*ar->namewhat != '\0') /* is there a name from code? */ - lua_pushfstring(L, "%s '%s'", ar->namewhat, ar->name); /* use it */ - else if (*ar->what == 'm') /* main? */ - lua_pushliteral(L, "main chunk"); - else if (*ar->what != 'C') /* for Lua functions, use */ - lua_pushfstring(L, "function <%s:%d>", ar->short_src, ar->linedefined); - else /* nothing left... */ - lua_pushliteral(L, "?"); -} - - -static int lastlevel (lua_State *L) { - lua_Debug ar; - int li = 1, le = 1; - /* find an upper bound */ - while (lua_getstack(L, le, &ar)) { li = le; le *= 2; } - /* do a binary search */ - while (li < le) { - int m = (li + le)/2; - if (lua_getstack(L, m, &ar)) li = m + 1; - else le = m; - } - return le - 1; -} - - -LUALIB_API void luaL_traceback (lua_State *L, lua_State *L1, - const char *msg, int level) { - luaL_Buffer b; - lua_Debug ar; - int last = lastlevel(L1); - int limit2show = (last - level > LEVELS1 + LEVELS2) ? LEVELS1 : -1; - luaL_buffinit(L, &b); - if (msg) { - luaL_addstring(&b, msg); - luaL_addchar(&b, '\n'); - } - luaL_addstring(&b, "stack traceback:"); - while (lua_getstack(L1, level++, &ar)) { - if (limit2show-- == 0) { /* too many levels? */ - int n = last - level - LEVELS2 + 1; /* number of levels to skip */ - lua_pushfstring(L, "\n\t...\t(skipping %d levels)", n); - luaL_addvalue(&b); /* add warning about skip */ - level += n; /* and skip to last levels */ - } - else { - lua_getinfo(L1, "Slnt", &ar); - if (ar.currentline <= 0) - lua_pushfstring(L, "\n\t%s: in ", ar.short_src); - else - lua_pushfstring(L, "\n\t%s:%d: in ", ar.short_src, ar.currentline); - luaL_addvalue(&b); - pushfuncname(L, &ar); - luaL_addvalue(&b); - if (ar.istailcall) - luaL_addstring(&b, "\n\t(...tail calls...)"); - } - } - luaL_pushresult(&b); -} - -/* }====================================================== */ - - -/* -** {====================================================== -** Error-report functions -** ======================================================= -*/ - -LUALIB_API int luaL_argerror (lua_State *L, int arg, const char *extramsg) { - lua_Debug ar; - if (!lua_getstack(L, 0, &ar)) /* no stack frame? */ - return luaL_error(L, "bad argument #%d (%s)", arg, extramsg); - lua_getinfo(L, "n", &ar); - if (strcmp(ar.namewhat, "method") == 0) { - arg--; /* do not count 'self' */ - if (arg == 0) /* error is in the self argument itself? */ - return luaL_error(L, "calling '%s' on bad self (%s)", - ar.name, extramsg); - } - if (ar.name == NULL) - ar.name = (pushglobalfuncname(L, &ar)) ? lua_tostring(L, -1) : "?"; - return luaL_error(L, "bad argument #%d to '%s' (%s)", - arg, ar.name, extramsg); -} - - -LUALIB_API int luaL_typeerror (lua_State *L, int arg, const char *tname) { - const char *msg; - const char *typearg; /* name for the type of the actual argument */ - if (luaL_getmetafield(L, arg, "__name") == LUA_TSTRING) - typearg = lua_tostring(L, -1); /* use the given type name */ - else if (lua_type(L, arg) == LUA_TLIGHTUSERDATA) - typearg = "light userdata"; /* special name for messages */ - else - typearg = luaL_typename(L, arg); /* standard name */ - msg = lua_pushfstring(L, "%s expected, got %s", tname, typearg); - return luaL_argerror(L, arg, msg); -} - - -static void tag_error (lua_State *L, int arg, int tag) { - luaL_typeerror(L, arg, lua_typename(L, tag)); -} - - -/* -** The use of 'lua_pushfstring' ensures this function does not -** need reserved stack space when called. -*/ -LUALIB_API void luaL_where (lua_State *L, int level) { - lua_Debug ar; - if (lua_getstack(L, level, &ar)) { /* check function at level */ - lua_getinfo(L, "Sl", &ar); /* get info about it */ - if (ar.currentline > 0) { /* is there info? */ - lua_pushfstring(L, "%s:%d: ", ar.short_src, ar.currentline); - return; - } - } - lua_pushfstring(L, ""); /* else, no information available... */ -} - - -/* -** Again, the use of 'lua_pushvfstring' ensures this function does -** not need reserved stack space when called. (At worst, it generates -** an error with "stack overflow" instead of the given message.) -*/ -LUALIB_API int luaL_error (lua_State *L, const char *fmt, ...) { - va_list argp; - va_start(argp, fmt); - luaL_where(L, 1); - lua_pushvfstring(L, fmt, argp); - va_end(argp); - lua_concat(L, 2); - return lua_error(L); -} - - -LUALIB_API int luaL_fileresult (lua_State *L, int stat, const char *fname) { - int en = errno; /* calls to Lua API may change this value */ - if (stat) { - lua_pushboolean(L, 1); - return 1; - } - else { - luaL_pushfail(L); - if (fname) - lua_pushfstring(L, "%s: %s", fname, strerror(en)); - else - lua_pushstring(L, strerror(en)); - lua_pushinteger(L, en); - return 3; - } -} - - -#if !defined(l_inspectstat) /* { */ - -#if defined(LUA_USE_POSIX) - -#include - -/* -** use appropriate macros to interpret 'pclose' return status -*/ -#define l_inspectstat(stat,what) \ - if (WIFEXITED(stat)) { stat = WEXITSTATUS(stat); } \ - else if (WIFSIGNALED(stat)) { stat = WTERMSIG(stat); what = "signal"; } - -#else - -#define l_inspectstat(stat,what) /* no op */ - -#endif - -#endif /* } */ - - -LUALIB_API int luaL_execresult (lua_State *L, int stat) { - if (stat != 0 && errno != 0) /* error with an 'errno'? */ - return luaL_fileresult(L, 0, NULL); - else { - const char *what = "exit"; /* type of termination */ - l_inspectstat(stat, what); /* interpret result */ - if (*what == 'e' && stat == 0) /* successful termination? */ - lua_pushboolean(L, 1); - else - luaL_pushfail(L); - lua_pushstring(L, what); - lua_pushinteger(L, stat); - return 3; /* return true/fail,what,code */ - } -} - -/* }====================================================== */ - - - -/* -** {====================================================== -** Userdata's metatable manipulation -** ======================================================= -*/ - -LUALIB_API int luaL_newmetatable (lua_State *L, const char *tname) { - if (luaL_getmetatable(L, tname) != LUA_TNIL) /* name already in use? */ - return 0; /* leave previous value on top, but return 0 */ - lua_pop(L, 1); - lua_createtable(L, 0, 2); /* create metatable */ - lua_pushstring(L, tname); - lua_setfield(L, -2, "__name"); /* metatable.__name = tname */ - lua_pushvalue(L, -1); - lua_setfield(L, LUA_REGISTRYINDEX, tname); /* registry.name = metatable */ - return 1; -} - - -LUALIB_API void luaL_setmetatable (lua_State *L, const char *tname) { - luaL_getmetatable(L, tname); - lua_setmetatable(L, -2); -} - - -LUALIB_API void *luaL_testudata (lua_State *L, int ud, const char *tname) { - void *p = lua_touserdata(L, ud); - if (p != NULL) { /* value is a userdata? */ - if (lua_getmetatable(L, ud)) { /* does it have a metatable? */ - luaL_getmetatable(L, tname); /* get correct metatable */ - if (!lua_rawequal(L, -1, -2)) /* not the same? */ - p = NULL; /* value is a userdata with wrong metatable */ - lua_pop(L, 2); /* remove both metatables */ - return p; - } - } - return NULL; /* value is not a userdata with a metatable */ -} - - -LUALIB_API void *luaL_checkudata (lua_State *L, int ud, const char *tname) { - void *p = luaL_testudata(L, ud, tname); - luaL_argexpected(L, p != NULL, ud, tname); - return p; -} - -/* }====================================================== */ - - -/* -** {====================================================== -** Argument check functions -** ======================================================= -*/ - -LUALIB_API int luaL_checkoption (lua_State *L, int arg, const char *def, - const char *const lst[]) { - const char *name = (def) ? luaL_optstring(L, arg, def) : - luaL_checkstring(L, arg); - int i; - for (i=0; lst[i]; i++) - if (strcmp(lst[i], name) == 0) - return i; - return luaL_argerror(L, arg, - lua_pushfstring(L, "invalid option '%s'", name)); -} - - -/* -** Ensures the stack has at least 'space' extra slots, raising an error -** if it cannot fulfill the request. (The error handling needs a few -** extra slots to format the error message. In case of an error without -** this extra space, Lua will generate the same 'stack overflow' error, -** but without 'msg'.) -*/ -LUALIB_API void luaL_checkstack (lua_State *L, int space, const char *msg) { - if (l_unlikely(!lua_checkstack(L, space))) { - if (msg) - luaL_error(L, "stack overflow (%s)", msg); - else - luaL_error(L, "stack overflow"); - } -} - - -LUALIB_API void luaL_checktype (lua_State *L, int arg, int t) { - if (l_unlikely(lua_type(L, arg) != t)) - tag_error(L, arg, t); -} - - -LUALIB_API void luaL_checkany (lua_State *L, int arg) { - if (l_unlikely(lua_type(L, arg) == LUA_TNONE)) - luaL_argerror(L, arg, "value expected"); -} - - -LUALIB_API const char *luaL_checklstring (lua_State *L, int arg, size_t *len) { - const char *s = lua_tolstring(L, arg, len); - if (l_unlikely(!s)) tag_error(L, arg, LUA_TSTRING); - return s; -} - - -LUALIB_API const char *luaL_optlstring (lua_State *L, int arg, - const char *def, size_t *len) { - if (lua_isnoneornil(L, arg)) { - if (len) - *len = (def ? strlen(def) : 0); - return def; - } - else return luaL_checklstring(L, arg, len); -} - - -LUALIB_API lua_Number luaL_checknumber (lua_State *L, int arg) { - int isnum; - lua_Number d = lua_tonumberx(L, arg, &isnum); - if (l_unlikely(!isnum)) - tag_error(L, arg, LUA_TNUMBER); - return d; -} - - -LUALIB_API lua_Number luaL_optnumber (lua_State *L, int arg, lua_Number def) { - return luaL_opt(L, luaL_checknumber, arg, def); -} - - -static void interror (lua_State *L, int arg) { - if (lua_isnumber(L, arg)) - luaL_argerror(L, arg, "number has no integer representation"); - else - tag_error(L, arg, LUA_TNUMBER); -} - - -LUALIB_API lua_Integer luaL_checkinteger (lua_State *L, int arg) { - int isnum; - lua_Integer d = lua_tointegerx(L, arg, &isnum); - if (l_unlikely(!isnum)) { - interror(L, arg); - } - return d; -} - - -LUALIB_API lua_Integer luaL_optinteger (lua_State *L, int arg, - lua_Integer def) { - return luaL_opt(L, luaL_checkinteger, arg, def); -} - -/* }====================================================== */ - - -/* -** {====================================================== -** Generic Buffer manipulation -** ======================================================= -*/ - -/* userdata to box arbitrary data */ -typedef struct UBox { - void *box; - size_t bsize; -} UBox; - - -static void *resizebox (lua_State *L, int idx, size_t newsize) { - void *ud; - lua_Alloc allocf = lua_getallocf(L, &ud); - UBox *box = (UBox *)lua_touserdata(L, idx); - void *temp = allocf(ud, box->box, box->bsize, newsize); - if (l_unlikely(temp == NULL && newsize > 0)) { /* allocation error? */ - lua_pushliteral(L, "not enough memory"); - lua_error(L); /* raise a memory error */ - } - box->box = temp; - box->bsize = newsize; - return temp; -} - - -static int boxgc (lua_State *L) { - resizebox(L, 1, 0); - return 0; -} - - -static const luaL_Reg boxmt[] = { /* box metamethods */ - {"__gc", boxgc}, - {"__close", boxgc}, - {NULL, NULL} -}; - - -static void newbox (lua_State *L) { - UBox *box = (UBox *)lua_newuserdatauv(L, sizeof(UBox), 0); - box->box = NULL; - box->bsize = 0; - if (luaL_newmetatable(L, "_UBOX*")) /* creating metatable? */ - luaL_setfuncs(L, boxmt, 0); /* set its metamethods */ - lua_setmetatable(L, -2); -} - - -/* -** check whether buffer is using a userdata on the stack as a temporary -** buffer -*/ -#define buffonstack(B) ((B)->b != (B)->init.b) - - -/* -** Whenever buffer is accessed, slot 'idx' must either be a box (which -** cannot be NULL) or it is a placeholder for the buffer. -*/ -#define checkbufferlevel(B,idx) \ - lua_assert(buffonstack(B) ? lua_touserdata(B->L, idx) != NULL \ - : lua_touserdata(B->L, idx) == (void*)B) - - -/* -** Compute new size for buffer 'B', enough to accommodate extra 'sz' -** bytes. -*/ -static size_t newbuffsize (luaL_Buffer *B, size_t sz) { - size_t newsize = B->size * 2; /* double buffer size */ - if (l_unlikely(MAX_SIZET - sz < B->n)) /* overflow in (B->n + sz)? */ - return luaL_error(B->L, "buffer too large"); - if (newsize < B->n + sz) /* double is not big enough? */ - newsize = B->n + sz; - return newsize; -} - - -/* -** Returns a pointer to a free area with at least 'sz' bytes in buffer -** 'B'. 'boxidx' is the relative position in the stack where is the -** buffer's box or its placeholder. -*/ -static char *prepbuffsize (luaL_Buffer *B, size_t sz, int boxidx) { - checkbufferlevel(B, boxidx); - if (B->size - B->n >= sz) /* enough space? */ - return B->b + B->n; - else { - lua_State *L = B->L; - char *newbuff; - size_t newsize = newbuffsize(B, sz); - /* create larger buffer */ - if (buffonstack(B)) /* buffer already has a box? */ - newbuff = (char *)resizebox(L, boxidx, newsize); /* resize it */ - else { /* no box yet */ - lua_remove(L, boxidx); /* remove placeholder */ - newbox(L); /* create a new box */ - lua_insert(L, boxidx); /* move box to its intended position */ - lua_toclose(L, boxidx); - newbuff = (char *)resizebox(L, boxidx, newsize); - memcpy(newbuff, B->b, B->n * sizeof(char)); /* copy original content */ - } - B->b = newbuff; - B->size = newsize; - return newbuff + B->n; - } -} - -/* -** returns a pointer to a free area with at least 'sz' bytes -*/ -LUALIB_API char *luaL_prepbuffsize (luaL_Buffer *B, size_t sz) { - return prepbuffsize(B, sz, -1); -} - - -LUALIB_API void luaL_addlstring (luaL_Buffer *B, const char *s, size_t l) { - if (l > 0) { /* avoid 'memcpy' when 's' can be NULL */ - char *b = prepbuffsize(B, l, -1); - memcpy(b, s, l * sizeof(char)); - luaL_addsize(B, l); - } -} - - -LUALIB_API void luaL_addstring (luaL_Buffer *B, const char *s) { - luaL_addlstring(B, s, strlen(s)); -} - - -LUALIB_API void luaL_pushresult (luaL_Buffer *B) { - lua_State *L = B->L; - checkbufferlevel(B, -1); - lua_pushlstring(L, B->b, B->n); - if (buffonstack(B)) - lua_closeslot(L, -2); /* close the box */ - lua_remove(L, -2); /* remove box or placeholder from the stack */ -} - - -LUALIB_API void luaL_pushresultsize (luaL_Buffer *B, size_t sz) { - luaL_addsize(B, sz); - luaL_pushresult(B); -} - - -/* -** 'luaL_addvalue' is the only function in the Buffer system where the -** box (if existent) is not on the top of the stack. So, instead of -** calling 'luaL_addlstring', it replicates the code using -2 as the -** last argument to 'prepbuffsize', signaling that the box is (or will -** be) bellow the string being added to the buffer. (Box creation can -** trigger an emergency GC, so we should not remove the string from the -** stack before we have the space guaranteed.) -*/ -LUALIB_API void luaL_addvalue (luaL_Buffer *B) { - lua_State *L = B->L; - size_t len; - const char *s = lua_tolstring(L, -1, &len); - char *b = prepbuffsize(B, len, -2); - memcpy(b, s, len * sizeof(char)); - luaL_addsize(B, len); - lua_pop(L, 1); /* pop string */ -} - - -LUALIB_API void luaL_buffinit (lua_State *L, luaL_Buffer *B) { - B->L = L; - B->b = B->init.b; - B->n = 0; - B->size = LUAL_BUFFERSIZE; - lua_pushlightuserdata(L, (void*)B); /* push placeholder */ -} - - -LUALIB_API char *luaL_buffinitsize (lua_State *L, luaL_Buffer *B, size_t sz) { - luaL_buffinit(L, B); - return prepbuffsize(B, sz, -1); -} - -/* }====================================================== */ - - -/* -** {====================================================== -** Reference system -** ======================================================= -*/ - -/* index of free-list header (after the predefined values) */ -#define freelist (LUA_RIDX_LAST + 1) - -/* -** The previously freed references form a linked list: -** t[freelist] is the index of a first free index, or zero if list is -** empty; t[t[freelist]] is the index of the second element; etc. -*/ -LUALIB_API int luaL_ref (lua_State *L, int t) { - int ref; - if (lua_isnil(L, -1)) { - lua_pop(L, 1); /* remove from stack */ - return LUA_REFNIL; /* 'nil' has a unique fixed reference */ - } - t = lua_absindex(L, t); - if (lua_rawgeti(L, t, freelist) == LUA_TNIL) { /* first access? */ - ref = 0; /* list is empty */ - lua_pushinteger(L, 0); /* initialize as an empty list */ - lua_rawseti(L, t, freelist); /* ref = t[freelist] = 0 */ - } - else { /* already initialized */ - lua_assert(lua_isinteger(L, -1)); - ref = (int)lua_tointeger(L, -1); /* ref = t[freelist] */ - } - lua_pop(L, 1); /* remove element from stack */ - if (ref != 0) { /* any free element? */ - lua_rawgeti(L, t, ref); /* remove it from list */ - lua_rawseti(L, t, freelist); /* (t[freelist] = t[ref]) */ - } - else /* no free elements */ - ref = (int)lua_rawlen(L, t) + 1; /* get a new reference */ - lua_rawseti(L, t, ref); - return ref; -} - - -LUALIB_API void luaL_unref (lua_State *L, int t, int ref) { - if (ref >= 0) { - t = lua_absindex(L, t); - lua_rawgeti(L, t, freelist); - lua_assert(lua_isinteger(L, -1)); - lua_rawseti(L, t, ref); /* t[ref] = t[freelist] */ - lua_pushinteger(L, ref); - lua_rawseti(L, t, freelist); /* t[freelist] = ref */ - } -} - -/* }====================================================== */ - - -/* -** {====================================================== -** Load functions -** ======================================================= -*/ - -typedef struct LoadF { - int n; /* number of pre-read characters */ - FILE *f; /* file being read */ - char buff[BUFSIZ]; /* area for reading file */ -} LoadF; - - -static const char *getF (lua_State *L, void *ud, size_t *size) { - LoadF *lf = (LoadF *)ud; - (void)L; /* not used */ - if (lf->n > 0) { /* are there pre-read characters to be read? */ - *size = lf->n; /* return them (chars already in buffer) */ - lf->n = 0; /* no more pre-read characters */ - } - else { /* read a block from file */ - /* 'fread' can return > 0 *and* set the EOF flag. If next call to - 'getF' called 'fread', it might still wait for user input. - The next check avoids this problem. */ - if (feof(lf->f)) return NULL; - *size = fread(lf->buff, 1, sizeof(lf->buff), lf->f); /* read block */ - } - return lf->buff; -} - - -static int errfile (lua_State *L, const char *what, int fnameindex) { - const char *serr = strerror(errno); - const char *filename = lua_tostring(L, fnameindex) + 1; - lua_pushfstring(L, "cannot %s %s: %s", what, filename, serr); - lua_remove(L, fnameindex); - return LUA_ERRFILE; -} - - -static int skipBOM (LoadF *lf) { - const char *p = "\xEF\xBB\xBF"; /* UTF-8 BOM mark */ - int c; - lf->n = 0; - do { - c = getc(lf->f); - if (c == EOF || c != *(const unsigned char *)p++) return c; - lf->buff[lf->n++] = c; /* to be read by the parser */ - } while (*p != '\0'); - lf->n = 0; /* prefix matched; discard it */ - return getc(lf->f); /* return next character */ -} - - -/* -** reads the first character of file 'f' and skips an optional BOM mark -** in its beginning plus its first line if it starts with '#'. Returns -** true if it skipped the first line. In any case, '*cp' has the -** first "valid" character of the file (after the optional BOM and -** a first-line comment). -*/ -static int skipcomment (LoadF *lf, int *cp) { - int c = *cp = skipBOM(lf); - if (c == '#') { /* first line is a comment (Unix exec. file)? */ - do { /* skip first line */ - c = getc(lf->f); - } while (c != EOF && c != '\n'); - *cp = getc(lf->f); /* skip end-of-line, if present */ - return 1; /* there was a comment */ - } - else return 0; /* no comment */ -} - - -LUALIB_API int luaL_loadfilex (lua_State *L, const char *filename, - const char *mode) { - LoadF lf; - int status, readstatus; - int c; - int fnameindex = lua_gettop(L) + 1; /* index of filename on the stack */ - if (filename == NULL) { - lua_pushliteral(L, "=stdin"); - lf.f = stdin; - } - else { - lua_pushfstring(L, "@%s", filename); - lf.f = fopen(filename, "r"); - if (lf.f == NULL) return errfile(L, "open", fnameindex); - } - if (skipcomment(&lf, &c)) /* read initial portion */ - lf.buff[lf.n++] = '\n'; /* add line to correct line numbers */ - if (c == LUA_SIGNATURE[0] && filename) { /* binary file? */ - lf.f = freopen(filename, "rb", lf.f); /* reopen in binary mode */ - if (lf.f == NULL) return errfile(L, "reopen", fnameindex); - skipcomment(&lf, &c); /* re-read initial portion */ - } - if (c != EOF) - lf.buff[lf.n++] = c; /* 'c' is the first character of the stream */ - status = lua_load(L, getF, &lf, lua_tostring(L, -1), mode); - readstatus = ferror(lf.f); - if (filename) fclose(lf.f); /* close file (even in case of errors) */ - if (readstatus) { - lua_settop(L, fnameindex); /* ignore results from 'lua_load' */ - return errfile(L, "read", fnameindex); - } - lua_remove(L, fnameindex); - return status; -} - - -typedef struct LoadS { - const char *s; - size_t size; -} LoadS; - - -static const char *getS (lua_State *L, void *ud, size_t *size) { - LoadS *ls = (LoadS *)ud; - (void)L; /* not used */ - if (ls->size == 0) return NULL; - *size = ls->size; - ls->size = 0; - return ls->s; -} - - -LUALIB_API int luaL_loadbufferx (lua_State *L, const char *buff, size_t size, - const char *name, const char *mode) { - LoadS ls; - ls.s = buff; - ls.size = size; - return lua_load(L, getS, &ls, name, mode); -} - - -LUALIB_API int luaL_loadstring (lua_State *L, const char *s) { - return luaL_loadbuffer(L, s, strlen(s), s); -} - -/* }====================================================== */ - - - -LUALIB_API int luaL_getmetafield (lua_State *L, int obj, const char *event) { - if (!lua_getmetatable(L, obj)) /* no metatable? */ - return LUA_TNIL; - else { - int tt; - lua_pushstring(L, event); - tt = lua_rawget(L, -2); - if (tt == LUA_TNIL) /* is metafield nil? */ - lua_pop(L, 2); /* remove metatable and metafield */ - else - lua_remove(L, -2); /* remove only metatable */ - return tt; /* return metafield type */ - } -} - - -LUALIB_API int luaL_callmeta (lua_State *L, int obj, const char *event) { - obj = lua_absindex(L, obj); - if (luaL_getmetafield(L, obj, event) == LUA_TNIL) /* no metafield? */ - return 0; - lua_pushvalue(L, obj); - lua_call(L, 1, 1); - return 1; -} - - -LUALIB_API lua_Integer luaL_len (lua_State *L, int idx) { - lua_Integer l; - int isnum; - lua_len(L, idx); - l = lua_tointegerx(L, -1, &isnum); - if (l_unlikely(!isnum)) - luaL_error(L, "object length is not an integer"); - lua_pop(L, 1); /* remove object */ - return l; -} - - -LUALIB_API const char *luaL_tolstring (lua_State *L, int idx, size_t *len) { - 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.4/src/lbaselib.c b/lua-5.4.4/src/lbaselib.c deleted file mode 100644 index 1d60c9d..0000000 --- a/lua-5.4.4/src/lbaselib.c +++ /dev/null @@ -1,549 +0,0 @@ -/* -** $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.4/src/lcode.c b/lua-5.4.4/src/lcode.c deleted file mode 100644 index 06425a1..0000000 --- a/lua-5.4.4/src/lcode.c +++ /dev/null @@ -1,1832 +0,0 @@ -/* -** $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; -} - - -/* -** Emit code for unary expressions that "produce values" -** (everything but 'not'). -** Expression to produce final result will be encoded in 'e'. -*/ -static void codeunexpval (FuncState *fs, OpCode op, expdesc *e, int line) { - int r = luaK_exp2anyreg(fs, e); /* opcodes operate only on registers */ - freeexp(fs, e); - e->u.info = luaK_codeABC(fs, op, 0, r, 0); /* generate opcode */ - e->k = VRELOC; /* all those operations are relocatable */ - luaK_fixline(fs, line); -} - - -/* -** Emit code for binary expressions that "produce values" -** (everything but logical operators 'and'/'or' and comparison -** operators). -** Expression to produce final result will be encoded in 'e1'. -*/ -static void finishbinexpval (FuncState *fs, expdesc *e1, expdesc *e2, - OpCode op, int v2, int flip, int line, - OpCode mmop, TMS event) { - int v1 = luaK_exp2anyreg(fs, e1); - int pc = luaK_codeABCk(fs, op, 0, v1, v2, 0); - freeexps(fs, e1, e2); - e1->u.info = pc; - e1->k = VRELOC; /* all those operations are relocatable */ - luaK_fixline(fs, line); - luaK_codeABCk(fs, mmop, v1, v2, event, flip); /* to call metamethod */ - luaK_fixline(fs, line); -} - - -/* -** Emit code for binary expressions that "produce values" over -** two registers. -*/ -static void codebinexpval (FuncState *fs, OpCode op, - expdesc *e1, expdesc *e2, int line) { - int v2 = luaK_exp2anyreg(fs, e2); /* both operands are in registers */ - lua_assert(OP_ADD <= op && op <= OP_SHR); - finishbinexpval(fs, e1, e2, op, v2, 0, line, OP_MMBIN, - cast(TMS, (op - OP_ADD) + TM_ADD)); -} - - -/* -** Code binary operators with immediate operands. -*/ -static void codebini (FuncState *fs, OpCode op, - expdesc *e1, expdesc *e2, int flip, int line, - TMS event) { - int v2 = int2sC(cast_int(e2->u.ival)); /* immediate operand */ - lua_assert(e2->k == VKINT); - finishbinexpval(fs, e1, e2, op, v2, flip, line, OP_MMBINI, event); -} - - -/* Try to code a binary operator negating its second operand. -** For the metamethod, 2nd operand must keep its original value. -*/ -static int finishbinexpneg (FuncState *fs, expdesc *e1, expdesc *e2, - OpCode op, int line, TMS event) { - if (!luaK_isKint(e2)) - return 0; /* not an integer constant */ - else { - lua_Integer i2 = e2->u.ival; - if (!(fitsC(i2) && fitsC(-i2))) - return 0; /* not in the proper range */ - else { /* operating a small integer constant */ - int v2 = cast_int(i2); - finishbinexpval(fs, e1, e2, op, int2sC(-v2), 0, line, OP_MMBINI, event); - /* correct metamethod argument */ - SETARG_B(fs->f->code[fs->pc - 1], int2sC(v2)); - return 1; /* successfully coded */ - } - } -} - - -static void swapexps (expdesc *e1, expdesc *e2) { - expdesc temp = *e1; *e1 = *e2; *e2 = temp; /* swap 'e1' and 'e2' */ -} - - -/* -** Code arithmetic operators ('+', '-', ...). If second operand is a -** constant in the proper range, use variant opcodes with K operands. -*/ -static void codearith (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int flip, int line) { - TMS event = cast(TMS, opr + TM_ADD); - if (tonumeral(e2, NULL) && luaK_exp2K(fs, e2)) { /* K operand? */ - int v2 = e2->u.info; /* K index */ - OpCode op = cast(OpCode, opr + OP_ADDK); - finishbinexpval(fs, e1, e2, op, v2, flip, line, OP_MMBINK, event); - } - else { /* 'e2' is neither an immediate nor a K operand */ - OpCode op = cast(OpCode, opr + OP_ADD); - if (flip) - swapexps(e1, e2); /* back to original order */ - codebinexpval(fs, op, e1, e2, line); /* use standard operators */ - } -} - - -/* -** Code commutative operators ('+', '*'). If first operand is a -** numeric constant, change order of operands to try to use an -** immediate or K operator. -*/ -static void codecommutative (FuncState *fs, BinOpr op, - expdesc *e1, expdesc *e2, int line) { - int flip = 0; - if (tonumeral(e1, NULL)) { /* is first operand a numeric constant? */ - swapexps(e1, e2); /* change order */ - flip = 1; - } - if (op == OPR_ADD && isSCint(e2)) /* immediate operand? */ - codebini(fs, cast(OpCode, OP_ADDI), e1, e2, flip, line, TM_ADD); - else - codearith(fs, op, e1, e2, flip, line); -} - - -/* -** Code bitwise operations; they are all associative, so the function -** tries to put an integer constant as the 2nd operand (a K operand). -*/ -static void codebitwise (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int line) { - int flip = 0; - int v2; - OpCode op; - if (e1->k == VKINT && luaK_exp2RK(fs, e1)) { - swapexps(e1, e2); /* 'e2' will be the constant operand */ - flip = 1; - } - else if (!(e2->k == VKINT && luaK_exp2RK(fs, e2))) { /* no constants? */ - op = cast(OpCode, opr + OP_ADD); - codebinexpval(fs, op, e1, e2, line); /* all-register opcodes */ - return; - } - v2 = e2->u.info; /* index in K array */ - op = cast(OpCode, opr + OP_ADDK); - lua_assert(ttisinteger(&fs->f->k[v2])); - finishbinexpval(fs, e1, e2, op, v2, flip, line, OP_MMBINK, - cast(TMS, opr + TM_ADD)); -} - - -/* -** Emit code for order comparisons. When using an immediate operand, -** 'isfloat' tells whether the original value was a float. -*/ -static void codeorder (FuncState *fs, OpCode op, expdesc *e1, expdesc *e2) { - int r1, r2; - int im; - int isfloat = 0; - if (isSCnumber(e2, &im, &isfloat)) { - /* use immediate operand */ - r1 = luaK_exp2anyreg(fs, e1); - r2 = im; - op = cast(OpCode, (op - OP_LT) + OP_LTI); - } - else if (isSCnumber(e1, &im, &isfloat)) { - /* transform (A < B) to (B > A) and (A <= B) to (B >= A) */ - r1 = luaK_exp2anyreg(fs, e2); - r2 = im; - op = (op == OP_LT) ? OP_GTI : OP_GEI; - } - else { /* regular case, compare two registers */ - r1 = luaK_exp2anyreg(fs, e1); - r2 = luaK_exp2anyreg(fs, e2); - } - freeexps(fs, e1, e2); - e1->u.info = condjump(fs, op, r1, r2, isfloat, 1); - e1->k = VJMP; -} - - -/* -** Emit code for equality comparisons ('==', '~='). -** 'e1' was already put as RK by 'luaK_infix'. -*/ -static void codeeq (FuncState *fs, BinOpr opr, expdesc *e1, expdesc *e2) { - int r1, r2; - int im; - int isfloat = 0; /* not needed here, but kept for symmetry */ - OpCode op; - if (e1->k != VNONRELOC) { - lua_assert(e1->k == VK || e1->k == VKINT || e1->k == VKFLT); - swapexps(e1, e2); - } - r1 = luaK_exp2anyreg(fs, e1); /* 1st expression must be in register */ - if (isSCnumber(e2, &im, &isfloat)) { - op = OP_EQI; - r2 = im; /* immediate operand */ - } - else if (luaK_exp2RK(fs, e2)) { /* 1st expression is constant? */ - op = OP_EQK; - r2 = e2->u.info; /* constant index */ - } - else { - op = OP_EQ; /* will compare two registers */ - r2 = luaK_exp2anyreg(fs, e2); - } - freeexps(fs, e1, e2); - e1->u.info = condjump(fs, op, r1, r2, isfloat, (opr == OPR_EQ)); - e1->k = VJMP; -} - - -/* -** Apply prefix operation 'op' to expression 'e'. -*/ -void luaK_prefix (FuncState *fs, UnOpr op, expdesc *e, int line) { - static const expdesc ef = {VKINT, {0}, NO_JUMP, NO_JUMP}; - luaK_dischargevars(fs, e); - switch (op) { - case OPR_MINUS: case OPR_BNOT: /* use 'ef' as fake 2nd operand */ - if (constfolding(fs, op + LUA_OPUNM, e, &ef)) - break; - /* else */ /* FALLTHROUGH */ - case OPR_LEN: - codeunexpval(fs, cast(OpCode, op + OP_UNM), e, line); - break; - case OPR_NOT: codenot(fs, e); break; - default: lua_assert(0); - } -} - - -/* -** Process 1st operand 'v' of binary operation 'op' before reading -** 2nd operand. -*/ -void luaK_infix (FuncState *fs, BinOpr op, expdesc *v) { - luaK_dischargevars(fs, v); - switch (op) { - case OPR_AND: { - luaK_goiftrue(fs, v); /* go ahead only if 'v' is true */ - break; - } - case OPR_OR: { - luaK_goiffalse(fs, v); /* go ahead only if 'v' is false */ - break; - } - case OPR_CONCAT: { - luaK_exp2nextreg(fs, v); /* operand must be on the stack */ - break; - } - case OPR_ADD: case OPR_SUB: - case OPR_MUL: case OPR_DIV: case OPR_IDIV: - case OPR_MOD: case OPR_POW: - case OPR_BAND: case OPR_BOR: case OPR_BXOR: - case OPR_SHL: case OPR_SHR: { - if (!tonumeral(v, NULL)) - luaK_exp2anyreg(fs, v); - /* else keep numeral, which may be folded with 2nd operand */ - break; - } - case OPR_EQ: case OPR_NE: { - if (!tonumeral(v, NULL)) - luaK_exp2RK(fs, v); - /* else keep numeral, which may be an immediate operand */ - break; - } - case OPR_LT: case OPR_LE: - case OPR_GT: case OPR_GE: { - int dummy, dummy2; - if (!isSCnumber(v, &dummy, &dummy2)) - luaK_exp2anyreg(fs, v); - /* else keep numeral, which may be an immediate operand */ - break; - } - default: lua_assert(0); - } -} - -/* -** Create code for '(e1 .. e2)'. -** For '(e1 .. e2.1 .. e2.2)' (which is '(e1 .. (e2.1 .. e2.2))', -** because concatenation is right associative), merge both CONCATs. -*/ -static void codeconcat (FuncState *fs, expdesc *e1, expdesc *e2, int line) { - Instruction *ie2 = previousinstruction(fs); - if (GET_OPCODE(*ie2) == OP_CONCAT) { /* is 'e2' a concatenation? */ - int n = GETARG_B(*ie2); /* # of elements concatenated in 'e2' */ - lua_assert(e1->u.info + 1 == GETARG_A(*ie2)); - freeexp(fs, e2); - SETARG_A(*ie2, e1->u.info); /* correct first element ('e1') */ - SETARG_B(*ie2, n + 1); /* will concatenate one more element */ - } - else { /* 'e2' is not a concatenation */ - luaK_codeABC(fs, OP_CONCAT, e1->u.info, 2, 0); /* new concat opcode */ - freeexp(fs, e2); - luaK_fixline(fs, line); - } -} - - -/* -** Finalize code for binary operation, after reading 2nd operand. -*/ -void luaK_posfix (FuncState *fs, BinOpr opr, - expdesc *e1, expdesc *e2, int line) { - luaK_dischargevars(fs, e2); - if (foldbinop(opr) && constfolding(fs, opr + LUA_OPADD, e1, e2)) - return; /* done by folding */ - switch (opr) { - case OPR_AND: { - lua_assert(e1->t == NO_JUMP); /* list closed by 'luaK_infix' */ - luaK_concat(fs, &e2->f, e1->f); - *e1 = *e2; - break; - } - case OPR_OR: { - lua_assert(e1->f == NO_JUMP); /* list closed by 'luaK_infix' */ - luaK_concat(fs, &e2->t, e1->t); - *e1 = *e2; - break; - } - case OPR_CONCAT: { /* e1 .. e2 */ - luaK_exp2nextreg(fs, e2); - codeconcat(fs, e1, e2, line); - break; - } - case OPR_ADD: case OPR_MUL: { - codecommutative(fs, opr, e1, e2, line); - break; - } - case OPR_SUB: { - if (finishbinexpneg(fs, e1, e2, OP_ADDI, line, TM_SUB)) - break; /* coded as (r1 + -I) */ - /* ELSE */ - } /* FALLTHROUGH */ - case OPR_DIV: case OPR_IDIV: case OPR_MOD: case OPR_POW: { - codearith(fs, opr, e1, e2, 0, line); - break; - } - case OPR_BAND: case OPR_BOR: case OPR_BXOR: { - codebitwise(fs, opr, e1, e2, line); - break; - } - case OPR_SHL: { - if (isSCint(e1)) { - swapexps(e1, e2); - codebini(fs, OP_SHLI, e1, e2, 1, line, TM_SHL); /* I << r2 */ - } - else if (finishbinexpneg(fs, e1, e2, OP_SHRI, line, TM_SHL)) { - /* coded as (r1 >> -I) */; - } - else /* regular case (two registers) */ - codebinexpval(fs, OP_SHL, e1, e2, line); - break; - } - case OPR_SHR: { - if (isSCint(e2)) - codebini(fs, OP_SHRI, e1, e2, 0, line, TM_SHR); /* r1 >> I */ - else /* regular case (two registers) */ - codebinexpval(fs, OP_SHR, e1, e2, line); - break; - } - case OPR_EQ: case OPR_NE: { - codeeq(fs, opr, e1, e2); - break; - } - case OPR_LT: case OPR_LE: { - OpCode op = cast(OpCode, (opr - OPR_EQ) + OP_EQ); - codeorder(fs, op, e1, e2); - break; - } - case OPR_GT: case OPR_GE: { - /* '(a > b)' <=> '(b < a)'; '(a >= b)' <=> '(b <= a)' */ - OpCode op = cast(OpCode, (opr - OPR_NE) + OP_EQ); - swapexps(e1, e2); - codeorder(fs, op, e1, e2); - break; - } - default: lua_assert(0); - } -} - - -/* -** Change line information associated with current position, by removing -** previous info and adding it again with new line. -*/ -void luaK_fixline (FuncState *fs, int line) { - removelastlineinfo(fs); - savelineinfo(fs, fs->f, line); -} - - -void luaK_settablesize (FuncState *fs, int pc, int ra, int asize, int hsize) { - Instruction *inst = &fs->f->code[pc]; - int rb = (hsize != 0) ? luaO_ceillog2(hsize) + 1 : 0; /* hash size */ - int extra = asize / (MAXARG_C + 1); /* higher bits of array size */ - int rc = asize % (MAXARG_C + 1); /* lower bits of array size */ - int k = (extra > 0); /* true iff needs extra argument */ - *inst = CREATE_ABCk(OP_NEWTABLE, ra, rb, rc, k); - *(inst + 1) = CREATE_Ax(OP_EXTRAARG, extra); -} - - -/* -** Emit a SETLIST instruction. -** 'base' is register that keeps table; -** 'nelems' is #table plus those to be stored now; -** 'tostore' is number of values (in registers 'base + 1',...) to add to -** table (or LUA_MULTRET to add up to stack top). -*/ -void luaK_setlist (FuncState *fs, int base, int nelems, int tostore) { - lua_assert(tostore != 0 && tostore <= LFIELDS_PER_FLUSH); - if (tostore == LUA_MULTRET) - tostore = 0; - if (nelems <= MAXARG_C) - luaK_codeABC(fs, OP_SETLIST, base, tostore, nelems); - else { - int extra = nelems / (MAXARG_C + 1); - nelems %= (MAXARG_C + 1); - luaK_codeABCk(fs, OP_SETLIST, base, tostore, nelems, 1); - codeextraarg(fs, extra); - } - fs->freereg = base + 1; /* free registers with list values */ -} - - -/* -** return the final target of a jump (skipping jumps to jumps) -*/ -static int finaltarget (Instruction *code, int i) { - int count; - for (count = 0; count < 100; count++) { /* avoid infinite loops */ - Instruction pc = code[i]; - if (GET_OPCODE(pc) != OP_JMP) - break; - else - i += GETARG_sJ(pc) + 1; - } - return i; -} - - -/* -** Do a final pass over the code of a function, doing small peephole -** optimizations and adjustments. -*/ -void luaK_finish (FuncState *fs) { - int i; - Proto *p = fs->f; - for (i = 0; i < fs->pc; i++) { - Instruction *pc = &p->code[i]; - lua_assert(i == 0 || isOT(*(pc - 1)) == isIT(*pc)); - switch (GET_OPCODE(*pc)) { - case OP_RETURN0: case OP_RETURN1: { - if (!(fs->needclose || p->is_vararg)) - break; /* no extra work */ - /* else use OP_RETURN to do the extra work */ - SET_OPCODE(*pc, OP_RETURN); - } /* FALLTHROUGH */ - case OP_RETURN: case OP_TAILCALL: { - if (fs->needclose) - SETARG_k(*pc, 1); /* signal that it needs to close */ - if (p->is_vararg) - SETARG_C(*pc, p->numparams + 1); /* signal that it is vararg */ - break; - } - case OP_JMP: { - int target = finaltarget(p->code, i); - fixjump(fs, i, target); - break; - } - default: break; - } - } -} diff --git a/lua-5.4.4/src/lcode.h b/lua-5.4.4/src/lcode.h deleted file mode 100644 index 3265824..0000000 --- a/lua-5.4.4/src/lcode.h +++ /dev/null @@ -1,104 +0,0 @@ -/* -** $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.4/src/lcorolib.c b/lua-5.4.4/src/lcorolib.c deleted file mode 100644 index 785a1e8..0000000 --- a/lua-5.4.4/src/lcorolib.c +++ /dev/null @@ -1,210 +0,0 @@ -/* -** $Id: lcorolib.c $ -** Coroutine Library -** See Copyright Notice in lua.h -*/ - -#define lcorolib_c -#define LUA_LIB - -#include "lprefix.h" - - -#include - -#include "lua.h" - -#include "lauxlib.h" -#include "lualib.h" - - -static lua_State *getco (lua_State *L) { - lua_State *co = lua_tothread(L, 1); - luaL_argexpected(L, co, 1, "thread"); - return co; -} - - -/* -** Resumes a coroutine. Returns the number of results for non-error -** cases or -1 for errors. -*/ -static int auxresume (lua_State *L, lua_State *co, int narg) { - int status, nres; - if (l_unlikely(!lua_checkstack(co, narg))) { - lua_pushliteral(L, "too many arguments to resume"); - return -1; /* error flag */ - } - lua_xmove(L, co, narg); - status = lua_resume(co, L, narg, &nres); - if (l_likely(status == LUA_OK || status == LUA_YIELD)) { - if (l_unlikely(!lua_checkstack(L, nres + 1))) { - lua_pop(co, nres); /* remove results anyway */ - lua_pushliteral(L, "too many results to resume"); - return -1; /* error flag */ - } - lua_xmove(co, L, nres); /* move yielded values */ - return nres; - } - else { - lua_xmove(co, L, 1); /* move error message */ - return -1; /* error flag */ - } -} - - -static int luaB_coresume (lua_State *L) { - lua_State *co = getco(L); - int r; - r = auxresume(L, co, lua_gettop(L) - 1); - if (l_unlikely(r < 0)) { - lua_pushboolean(L, 0); - lua_insert(L, -2); - return 2; /* return false + error message */ - } - else { - lua_pushboolean(L, 1); - lua_insert(L, -(r + 1)); - return r + 1; /* return true + 'resume' returns */ - } -} - - -static int luaB_auxwrap (lua_State *L) { - lua_State *co = lua_tothread(L, lua_upvalueindex(1)); - int r = auxresume(L, co, lua_gettop(L)); - if (l_unlikely(r < 0)) { /* error? */ - int stat = lua_status(co); - if (stat != LUA_OK && stat != LUA_YIELD) { /* error in the coroutine? */ - stat = lua_resetthread(co); /* close its tbc variables */ - lua_assert(stat != LUA_OK); - lua_xmove(co, L, 1); /* 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); - 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.4/src/lctype.c b/lua-5.4.4/src/lctype.c deleted file mode 100644 index 9542280..0000000 --- a/lua-5.4.4/src/lctype.c +++ /dev/null @@ -1,64 +0,0 @@ -/* -** $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.4/src/lctype.h b/lua-5.4.4/src/lctype.h deleted file mode 100644 index 864e190..0000000 --- a/lua-5.4.4/src/lctype.h +++ /dev/null @@ -1,101 +0,0 @@ -/* -** $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.4/src/ldblib.c b/lua-5.4.4/src/ldblib.c deleted file mode 100644 index 6dcbaa9..0000000 --- a/lua-5.4.4/src/ldblib.c +++ /dev/null @@ -1,483 +0,0 @@ -/* -** $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.4/src/ldebug.c b/lua-5.4.4/src/ldebug.c deleted file mode 100644 index a716d95..0000000 --- a/lua-5.4.4/src/ldebug.c +++ /dev/null @@ -1,918 +0,0 @@ -/* -** $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->is_vararg) { - int nextra = ci->u.l.nextraargs; - if (n >= -nextra) { /* 'n' is negative */ - *pos = ci->func - nextra - (n + 1); - return "(vararg)"; /* generic name for any vararg */ - } - } - return NULL; /* no such vararg */ -} - - -const char *luaG_findlocal (lua_State *L, CallInfo *ci, int n, StkId *pos) { - StkId base = ci->func + 1; - const char *name = NULL; - if (isLua(ci)) { - if (n < 0) /* access to vararg values? */ - return findvararg(ci, n, pos); - else - name = luaF_getlocalname(ci_func(ci)->p, n, currentpc(ci)); - } - if (name == NULL) { /* no 'standard' name? */ - StkId limit = (ci == L->ci) ? L->top : ci->next->func; - if (limit - base >= n && n > 0) { /* is 'n' inside 'ci' stack? */ - /* generic name for any valid slot */ - name = isLua(ci) ? "(temporary)" : "(C temporary)"; - } - else - return NULL; /* no name */ - } - if (pos) - *pos = base + (n - 1); - return name; -} - - -LUA_API const char *lua_getlocal (lua_State *L, const lua_Debug *ar, int n) { - const char *name; - lua_lock(L); - if (ar == NULL) { /* information about non-active function? */ - if (!isLfunction(s2v(L->top - 1))) /* not a Lua function? */ - name = NULL; - else /* consider live variables at function start (parameters) */ - name = luaF_getlocalname(clLvalue(s2v(L->top - 1))->p, n, 0); - } - else { /* active function; get information through 'ar' */ - StkId pos = NULL; /* to avoid warnings */ - name = luaG_findlocal(L, ar->i_ci, n, &pos); - if (name) { - setobjs2s(L, L->top, pos); - api_incr_top(L); - } - } - lua_unlock(L); - return name; -} - - -LUA_API const char *lua_setlocal (lua_State *L, const lua_Debug *ar, int n) { - StkId pos = NULL; /* to avoid warnings */ - const char *name; - lua_lock(L); - name = luaG_findlocal(L, ar->i_ci, n, &pos); - if (name) { - setobjs2s(L, pos, L->top - 1); - L->top--; /* pop value */ - } - lua_unlock(L); - return name; -} - - -static void funcinfo (lua_Debug *ar, Closure *cl) { - if (noLuaClosure(cl)) { - ar->source = "=[C]"; - ar->srclen = LL("=[C]"); - ar->linedefined = -1; - ar->lastlinedefined = -1; - ar->what = "C"; - } - else { - const Proto *p = cl->l.p; - if (p->source) { - ar->source = getstr(p->source); - ar->srclen = tsslen(p->source); - } - else { - ar->source = "=?"; - ar->srclen = LL("=?"); - } - ar->linedefined = p->linedefined; - ar->lastlinedefined = p->lastlinedefined; - ar->what = (ar->linedefined == 0) ? "main" : "Lua"; - } - luaO_chunkid(ar->short_src, ar->source, ar->srclen); -} - - -static int nextline (const Proto *p, int currentline, int pc) { - if (p->lineinfo[pc] != ABSLINEINFO) - return currentline + p->lineinfo[pc]; - else - return luaG_getfuncline(p, pc); -} - - -static void collectvalidlines (lua_State *L, Closure *f) { - if (noLuaClosure(f)) { - setnilvalue(s2v(L->top)); - api_incr_top(L); - } - else { - int i; - TValue v; - const Proto *p = f->l.p; - int currentline = p->linedefined; - Table *t = luaH_new(L); /* new table to store active lines */ - sethvalue2s(L, L->top, t); /* push it on stack */ - api_incr_top(L); - setbtvalue(&v); /* boolean 'true' to be the value of all indices */ - 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 - 1); - api_check(L, ttisfunction(func), "function expected"); - what++; /* skip the '>' */ - L->top--; /* pop function */ - } - else { - ci = ar->i_ci; - func = s2v(ci->func); - lua_assert(ttisfunction(func)); - } - cl = ttisclosure(func) ? clvalue(func) : NULL; - status = auxgetinfo(L, what, ar, cl, ci); - if (strchr(what, 'f')) { - setobj2s(L, L->top, func); - api_incr_top(L); - } - if (strchr(what, 'L')) - collectvalidlines(L, cl); - lua_unlock(L); - return status; -} - - -/* -** {====================================================== -** Symbolic Execution -** ======================================================= -*/ - -static const char *getobjname (const Proto *p, int lastpc, int reg, - const char **name); - - -/* -** Find a "name" for the constant 'c'. -*/ -static void kname (const Proto *p, int c, const char **name) { - TValue *kvalue = &p->k[c]; - *name = (ttisstring(kvalue)) ? svalue(kvalue) : "?"; -} - - -/* -** Find a "name" for the register 'c'. -*/ -static void rname (const Proto *p, int pc, int c, const char **name) { - const char *what = getobjname(p, pc, c, name); /* search for 'c' */ - if (!(what && *what == 'c')) /* did not find a constant name? */ - *name = "?"; -} - - -/* -** Find a "name" for a 'C' value in an RK instruction. -*/ -static void rkname (const Proto *p, int pc, Instruction i, const char **name) { - int c = GETARG_C(i); /* key index */ - if (GETARG_k(i)) /* is 'c' a constant? */ - kname(p, c, name); - else /* 'c' is a register */ - rname(p, pc, c, name); -} - - -static int filterpc (int pc, int jmptarget) { - if (pc < jmptarget) /* is code conditional (inside a jump)? */ - return -1; /* cannot know who sets that register */ - else return pc; /* current position sets that register */ -} - - -/* -** Try to find last instruction before 'lastpc' that modified register 'reg'. -*/ -static int findsetreg (const Proto *p, int lastpc, int reg) { - int pc; - int setreg = -1; /* keep last instruction that changed 'reg' */ - int jmptarget = 0; /* any code before this address is conditional */ - if (testMMMode(GET_OPCODE(p->code[lastpc]))) - lastpc--; /* previous instruction was not actually executed */ - for (pc = 0; pc < lastpc; pc++) { - Instruction i = p->code[pc]; - OpCode op = GET_OPCODE(i); - int a = GETARG_A(i); - int change; /* true if current instruction changed 'reg' */ - switch (op) { - case OP_LOADNIL: { /* set registers from 'a' to 'a+b' */ - int b = GETARG_B(i); - change = (a <= reg && reg <= a + b); - break; - } - case OP_TFORCALL: { /* affect all regs above its base */ - change = (reg >= a + 2); - break; - } - case OP_CALL: - case OP_TAILCALL: { /* affect all registers above base */ - change = (reg >= a); - break; - } - case OP_JMP: { /* doesn't change registers, but changes 'jmptarget' */ - int b = GETARG_sJ(i); - int dest = pc + 1 + b; - /* jump does not skip 'lastpc' and is larger than current one? */ - if (dest <= lastpc && dest > jmptarget) - jmptarget = dest; /* update 'jmptarget' */ - change = 0; - break; - } - default: /* any instruction that sets A */ - change = (testAMode(op) && reg == a); - break; - } - if (change) - setreg = filterpc(pc, jmptarget); - } - return setreg; -} - - -/* -** Check whether table being indexed by instruction 'i' is the -** environment '_ENV' -*/ -static const char *gxf (const Proto *p, int pc, Instruction i, int isup) { - int t = GETARG_B(i); /* table index */ - const char *name; /* name of indexed variable */ - if (isup) /* is an upvalue? */ - name = upvalname(p, t); - else - getobjname(p, pc, t, &name); - return (name && strcmp(name, LUA_ENV) == 0) ? "global" : "field"; -} - - -static const char *getobjname (const Proto *p, int lastpc, int reg, - const char **name) { - int pc; - *name = luaF_getlocalname(p, reg + 1, lastpc); - if (*name) /* is a local? */ - return "local"; - /* else try symbolic execution */ - pc = findsetreg(p, lastpc, reg); - if (pc != -1) { /* could find instruction? */ - Instruction i = p->code[pc]; - OpCode op = GET_OPCODE(i); - switch (op) { - case OP_MOVE: { - int b = GETARG_B(i); /* move from 'b' to 'a' */ - if (b < GETARG_A(i)) - return getobjname(p, pc, b, name); /* get name for 'b' */ - break; - } - case OP_GETTABUP: { - int k = GETARG_C(i); /* key index */ - kname(p, k, name); - return gxf(p, pc, i, 1); - } - case OP_GETTABLE: { - int k = GETARG_C(i); /* key index */ - rname(p, pc, k, name); - return gxf(p, pc, i, 0); - } - case OP_GETI: { - *name = "integer index"; - return "field"; - } - case OP_GETFIELD: { - int k = GETARG_C(i); /* key index */ - kname(p, k, name); - return gxf(p, pc, i, 0); - } - case OP_GETUPVAL: { - *name = upvalname(p, GETARG_B(i)); - return "upvalue"; - } - case OP_LOADK: - case OP_LOADKX: { - int b = (op == OP_LOADK) ? GETARG_Bx(i) - : GETARG_Ax(p->code[pc + 1]); - if (ttisstring(&p->k[b])) { - *name = svalue(&p->k[b]); - return "constant"; - } - break; - } - case OP_SELF: { - rkname(p, pc, i, name); - return "method"; - } - default: break; /* go through to return NULL */ - } - } - return NULL; /* could not find reasonable name */ -} - - -/* -** Try to find a name for a function based on the code that called it. -** (Only works when function was called by a Lua function.) -** Returns what the name is (e.g., "for iterator", "method", -** "metamethod") and sets '*name' to point to the name. -*/ -static const char *funcnamefromcode (lua_State *L, 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. Because 'o' may not point to a -** value in this stack, we cannot compare it with the region -** boundaries (undefined behaviour in ISO C). -*/ -static int isinstack (CallInfo *ci, const TValue *o) { - StkId pos; - for (pos = ci->func + 1; pos < ci->top; pos++) { - if (o == s2v(pos)) - return 1; - } - return 0; /* not found */ -} - - -/* -** Checks whether value 'o' came from an upvalue. (That can only happen -** with instructions OP_GETTABUP/OP_SETTABUP, which operate directly on -** upvalues.) -*/ -static const char *getupvalname (CallInfo *ci, const TValue *o, - const char **name) { - LClosure *c = ci_func(ci); - int i; - for (i = 0; i < c->nupvalues; i++) { - if (c->upvals[i]->v == o) { - *name = upvalname(c->p, i); - return "upvalue"; - } - } - return NULL; -} - - -static const char *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 && isinstack(ci, o)) /* no? try a register */ - kind = getobjname(ci_func(ci)->p, currentpc(ci), - cast_int(cast(StkId, o) - (ci->func + 1)), &name); - } - return 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, L->top - 1); /* move argument */ - setobjs2s(L, L->top - 1, errfunc); /* push function */ - L->top++; /* assume EXTRA_STACK */ - luaD_callnoyield(L, L->top - 2, 1); /* call it */ - } - luaD_throw(L, LUA_ERRRUN); -} - - -l_noret luaG_runerror (lua_State *L, const char *fmt, ...) { - CallInfo *ci = L->ci; - const char *msg; - va_list argp; - luaC_checkGC(L); /* error message uses memory */ - va_start(argp, fmt); - msg = luaO_pushvfstring(L, fmt, argp); /* format message */ - va_end(argp); - if (isLua(ci)) /* if Lua function, add source:line information */ - luaG_addinfo(L, msg, ci_func(ci)->p->source, getcurrentline(ci)); - luaG_errormsg(L); -} - - -/* -** Check whether new instruction 'newpc' is in a different line from -** previous instruction 'oldpc'. More often than not, 'newpc' is only -** one or a few instructions after 'oldpc' (it must be after, see -** caller), so try to avoid calling 'luaG_getfuncline'. If they are -** too far apart, there is a good chance of a ABSLINEINFO in the way, -** so it goes directly to 'luaG_getfuncline'. -*/ -static int changedline (const Proto *p, int oldpc, int newpc) { - if (p->lineinfo == NULL) /* no debug information? */ - return 0; - if (newpc - oldpc < MAXIWTHABS / 2) { /* not too far apart? */ - int delta = 0; /* line diference */ - int pc = oldpc; - for (;;) { - int lineinfo = p->lineinfo[++pc]; - if (lineinfo == ABSLINEINFO) - break; /* cannot compute delta; fall through */ - delta += lineinfo; - if (pc == newpc) - return (delta != 0); /* delta computed successfully */ - } - } - /* either instructions are too far apart or there is an absolute line - info in the way; compute line difference explicitly */ - return (luaG_getfuncline(p, oldpc) != luaG_getfuncline(p, newpc)); -} - - -/* -** Traces the execution of a Lua function. Called before the execution -** of each opcode, when debug is on. 'L->oldpc' stores the last -** instruction traced, to detect line changes. When entering a new -** function, 'npci' will be zero and will test as a new line whatever -** the value of 'oldpc'. Some exceptional conditions may return to -** a function without setting 'oldpc'. In that case, 'oldpc' may be -** invalid; if so, use zero as a valid value. (A wrong but valid 'oldpc' -** at most causes an extra call to a line hook.) -** This function is not "Protected" when called, so it should correct -** 'L->top' before calling anything that can run the GC. -*/ -int luaG_traceexec (lua_State *L, const Instruction *pc) { - CallInfo *ci = L->ci; - lu_byte mask = L->hookmask; - const Proto *p = ci_func(ci)->p; - int counthook; - if (!(mask & (LUA_MASKLINE | LUA_MASKCOUNT))) { /* no hooks? */ - ci->u.l.trap = 0; /* don't need to stop again */ - return 0; /* turn off 'trap' */ - } - pc++; /* reference is always next instruction */ - ci->u.l.savedpc = pc; /* save 'pc' */ - counthook = (--L->hookcount == 0 && (mask & LUA_MASKCOUNT)); - if (counthook) - resethookcount(L); /* reset count */ - else if (!(mask & LUA_MASKLINE)) - return 1; /* no line hook and count != 0; nothing to be done now */ - if (ci->callstatus & CIST_HOOKYIELD) { /* called hook last time? */ - ci->callstatus &= ~CIST_HOOKYIELD; /* erase mark */ - return 1; /* do not call hook again (VM yielded, so it did not move) */ - } - if (!isIT(*(ci->u.l.savedpc - 1))) /* top not being used? */ - L->top = ci->top; /* correct top */ - if (counthook) - luaD_hook(L, LUA_HOOKCOUNT, -1, 0, 0); /* call count hook */ - if (mask & LUA_MASKLINE) { - /* 'L->oldpc' may be invalid; use zero in this case */ - int oldpc = (L->oldpc < p->sizecode) ? L->oldpc : 0; - int npci = pcRel(pc, p); - if (npci <= oldpc || /* call hook when jump back (loop), */ - changedline(p, oldpc, npci)) { /* or when enter new line */ - int newline = luaG_getfuncline(p, npci); - luaD_hook(L, LUA_HOOKLINE, newline, 0, 0); /* call line hook */ - } - L->oldpc = npci; /* 'pc' of last call to line hook */ - } - if (L->status == LUA_YIELD) { /* did hook yield? */ - if (counthook) - L->hookcount = 1; /* undo decrement to zero */ - ci->u.l.savedpc--; /* undo increment (resume will increment it again) */ - ci->callstatus |= CIST_HOOKYIELD; /* mark that it yielded */ - luaD_throw(L, LUA_YIELD); - } - return 1; /* keep 'trap' on */ -} - diff --git a/lua-5.4.4/src/ldebug.h b/lua-5.4.4/src/ldebug.h deleted file mode 100644 index 974960e..0000000 --- a/lua-5.4.4/src/ldebug.h +++ /dev/null @@ -1,63 +0,0 @@ -/* -** $Id: ldebug.h $ -** Auxiliary functions from Debug Interface module -** See Copyright Notice in lua.h -*/ - -#ifndef ldebug_h -#define ldebug_h - - -#include "lstate.h" - - -#define pcRel(pc, p) (cast_int((pc) - (p)->code) - 1) - - -/* Active Lua function (given call info) */ -#define ci_func(ci) (clLvalue(s2v((ci)->func))) - - -#define resethookcount(L) (L->hookcount = L->basehookcount) - -/* -** mark for entries in 'lineinfo' array that has absolute information in -** 'abslineinfo' array -*/ -#define ABSLINEINFO (-0x80) - - -/* -** MAXimum number of successive Instructions WiTHout ABSolute line -** information. (A power of two allows fast divisions.) -*/ -#if !defined(MAXIWTHABS) -#define MAXIWTHABS 128 -#endif - - -LUAI_FUNC int luaG_getfuncline (const Proto *f, int pc); -LUAI_FUNC const char *luaG_findlocal (lua_State *L, CallInfo *ci, int n, - StkId *pos); -LUAI_FUNC l_noret luaG_typeerror (lua_State *L, const TValue *o, - const char *opname); -LUAI_FUNC l_noret luaG_callerror (lua_State *L, const TValue *o); -LUAI_FUNC l_noret luaG_forerror (lua_State *L, const TValue *o, - const char *what); -LUAI_FUNC l_noret luaG_concaterror (lua_State *L, const TValue *p1, - const TValue *p2); -LUAI_FUNC l_noret luaG_opinterror (lua_State *L, const TValue *p1, - const TValue *p2, - const char *msg); -LUAI_FUNC l_noret luaG_tointerror (lua_State *L, const TValue *p1, - const TValue *p2); -LUAI_FUNC l_noret luaG_ordererror (lua_State *L, const TValue *p1, - const TValue *p2); -LUAI_FUNC l_noret luaG_runerror (lua_State *L, const char *fmt, ...); -LUAI_FUNC const char *luaG_addinfo (lua_State *L, const char *msg, - TString *src, int line); -LUAI_FUNC l_noret luaG_errormsg (lua_State *L); -LUAI_FUNC int luaG_traceexec (lua_State *L, const Instruction *pc); - - -#endif diff --git a/lua-5.4.4/src/ldo.c b/lua-5.4.4/src/ldo.c deleted file mode 100644 index a48e35f..0000000 --- a/lua-5.4.4/src/ldo.c +++ /dev/null @@ -1,997 +0,0 @@ -/* -** $Id: ldo.c $ -** Stack and Call structure of Lua -** See Copyright Notice in lua.h -*/ - -#define ldo_c -#define LUA_CORE - -#include "lprefix.h" - - -#include -#include -#include - -#include "lua.h" - -#include "lapi.h" -#include "ldebug.h" -#include "ldo.h" -#include "lfunc.h" -#include "lgc.h" -#include "lmem.h" -#include "lobject.h" -#include "lopcodes.h" -#include "lparser.h" -#include "lstate.h" -#include "lstring.h" -#include "ltable.h" -#include "ltm.h" -#include "lundump.h" -#include "lvm.h" -#include "lzio.h" - - - -#define errorstatus(s) ((s) > LUA_YIELD) - - -/* -** {====================================================== -** Error-recovery functions -** ======================================================= -*/ - -/* -** LUAI_THROW/LUAI_TRY define how Lua does exception handling. By -** default, Lua handles errors with exceptions when compiling as -** C++ code, with _longjmp/_setjmp when asked to use them, and with -** longjmp/setjmp otherwise. -*/ -#if !defined(LUAI_THROW) /* { */ - -#if defined(__cplusplus) && !defined(LUA_USE_LONGJMP) /* { */ - -/* C++ exceptions */ -#define LUAI_THROW(L,c) throw(c) -#define LUAI_TRY(L,c,a) \ - try { a } catch(...) { if ((c)->status == 0) (c)->status = -1; } -#define luai_jmpbuf int /* dummy variable */ - -#elif defined(LUA_USE_POSIX) /* }{ */ - -/* in POSIX, try _longjmp/_setjmp (more efficient) */ -#define LUAI_THROW(L,c) _longjmp((c)->b, 1) -#define LUAI_TRY(L,c,a) if (_setjmp((c)->b) == 0) { a } -#define luai_jmpbuf jmp_buf - -#else /* }{ */ - -/* ISO C handling with long jumps */ -#define LUAI_THROW(L,c) longjmp((c)->b, 1) -#define LUAI_TRY(L,c,a) if (setjmp((c)->b) == 0) { a } -#define luai_jmpbuf jmp_buf - -#endif /* } */ - -#endif /* } */ - - - -/* chain list of long jump buffers */ -struct lua_longjmp { - struct lua_longjmp *previous; - luai_jmpbuf b; - volatile int status; /* error code */ -}; - - -void luaD_seterrorobj (lua_State *L, int errcode, StkId oldtop) { - switch (errcode) { - case LUA_ERRMEM: { /* memory error? */ - setsvalue2s(L, oldtop, G(L)->memerrmsg); /* reuse preregistered msg. */ - break; - } - case LUA_ERRERR: { - setsvalue2s(L, oldtop, luaS_newliteral(L, "error in error handling")); - break; - } - case LUA_OK: { /* special case only for closing upvalues */ - setnilvalue(s2v(oldtop)); /* no error message */ - break; - } - default: { - lua_assert(errorstatus(errcode)); /* real error */ - setobjs2s(L, oldtop, L->top - 1); /* error message on current top */ - break; - } - } - L->top = oldtop + 1; -} - - -l_noret luaD_throw (lua_State *L, int errcode) { - if (L->errorJmp) { /* thread has an error handler? */ - L->errorJmp->status = errcode; /* set status */ - LUAI_THROW(L, L->errorJmp); /* jump to it */ - } - else { /* thread has no error handler */ - global_State *g = G(L); - errcode = luaE_resetthread(L, errcode); /* close all upvalues */ - if (g->mainthread->errorJmp) { /* main thread has a handler? */ - setobjs2s(L, g->mainthread->top++, L->top - 1); /* copy error obj. */ - luaD_throw(g->mainthread, errcode); /* re-throw in main thread */ - } - else { /* no handler at all; abort */ - if (g->panic) { /* panic function? */ - lua_unlock(L); - g->panic(L); /* call panic function (last chance to jump out) */ - } - abort(); - } - } -} - - -int luaD_rawrunprotected (lua_State *L, Pfunc f, void *ud) { - l_uint32 oldnCcalls = L->nCcalls; - struct lua_longjmp lj; - lj.status = LUA_OK; - lj.previous = L->errorJmp; /* chain new error handler */ - L->errorJmp = &lj; - LUAI_TRY(L, &lj, - (*f)(L, ud); - ); - L->errorJmp = lj.previous; /* restore old error handler */ - L->nCcalls = oldnCcalls; - return lj.status; -} - -/* }====================================================== */ - - -/* -** {================================================================== -** Stack reallocation -** =================================================================== -*/ -static void correctstack (lua_State *L, StkId oldstack, StkId newstack) { - CallInfo *ci; - UpVal *up; - L->top = (L->top - oldstack) + newstack; - L->tbclist = (L->tbclist - oldstack) + newstack; - for (up = L->openupval; up != NULL; up = up->u.open.next) - up->v = s2v((uplevel(up) - oldstack) + newstack); - for (ci = L->ci; ci != NULL; ci = ci->previous) { - ci->top = (ci->top - oldstack) + newstack; - ci->func = (ci->func - oldstack) + newstack; - if (isLua(ci)) - ci->u.l.trap = 1; /* signal to update 'trap' in 'luaV_execute' */ - } -} - - -/* some space for error handling */ -#define ERRORSTACKSIZE (LUAI_MAXSTACK + 200) - - -/* -** Reallocate the stack to a new size, correcting all pointers into -** it. (There are pointers to a stack from its upvalues, from its list -** of call infos, plus a few individual pointers.) The reallocation is -** done in two steps (allocation + free) because the correction must be -** done while both addresses (the old stack and the new one) are valid. -** (In ISO C, any pointer use after the pointer has been deallocated is -** undefined behavior.) -** In case of allocation error, raise an error or return false according -** to 'raiseerror'. -*/ -int luaD_reallocstack (lua_State *L, int newsize, int raiseerror) { - int oldsize = stacksize(L); - int i; - StkId newstack = luaM_reallocvector(L, NULL, 0, - newsize + EXTRA_STACK, StackValue); - lua_assert(newsize <= LUAI_MAXSTACK || newsize == ERRORSTACKSIZE); - if (l_unlikely(newstack == NULL)) { /* reallocation failed? */ - if (raiseerror) - luaM_error(L); - else return 0; /* do not raise an error */ - } - /* number of elements to be copied to the new stack */ - i = ((oldsize <= newsize) ? oldsize : newsize) + EXTRA_STACK; - memcpy(newstack, L->stack, i * sizeof(StackValue)); - for (; i < newsize + EXTRA_STACK; i++) - setnilvalue(s2v(newstack + i)); /* erase new segment */ - correctstack(L, L->stack, newstack); - luaM_freearray(L, L->stack, oldsize + EXTRA_STACK); - L->stack = newstack; - L->stack_last = L->stack + newsize; - return 1; -} - - -/* -** Try to grow the stack by at least 'n' elements. when 'raiseerror' -** is true, raises any error; otherwise, return 0 in case of errors. -*/ -int luaD_growstack (lua_State *L, int n, int raiseerror) { - int size = stacksize(L); - if (l_unlikely(size > LUAI_MAXSTACK)) { - /* if stack is larger than maximum, thread is already using the - extra space reserved for errors, that is, thread is handling - a stack error; cannot grow further than that. */ - lua_assert(stacksize(L) == ERRORSTACKSIZE); - if (raiseerror) - luaD_throw(L, LUA_ERRERR); /* error inside message handler */ - return 0; /* if not 'raiseerror', just signal it */ - } - else { - int newsize = 2 * size; /* tentative new size */ - int needed = cast_int(L->top - L->stack) + n; - if (newsize > LUAI_MAXSTACK) /* cannot cross the limit */ - newsize = LUAI_MAXSTACK; - if (newsize < needed) /* but must respect what was asked for */ - newsize = needed; - if (l_likely(newsize <= LUAI_MAXSTACK)) - return luaD_reallocstack(L, newsize, raiseerror); - else { /* stack overflow */ - /* add extra size to be able to handle the error message */ - luaD_reallocstack(L, ERRORSTACKSIZE, raiseerror); - if (raiseerror) - luaG_runerror(L, "stack overflow"); - return 0; - } - } -} - - -static int stackinuse (lua_State *L) { - CallInfo *ci; - int res; - StkId lim = L->top; - for (ci = L->ci; ci != NULL; ci = ci->previous) { - if (lim < ci->top) lim = ci->top; - } - lua_assert(lim <= L->stack_last); - res = cast_int(lim - L->stack) + 1; /* part of stack in use */ - if (res < LUA_MINSTACK) - res = LUA_MINSTACK; /* ensure a minimum size */ - return res; -} - - -/* -** If stack size is more than 3 times the current use, reduce that size -** to twice the current use. (So, the final stack size is at most 2/3 the -** previous size, and half of its entries are empty.) -** As a particular case, if stack was handling a stack overflow and now -** it is not, 'max' (limited by LUAI_MAXSTACK) will be smaller than -** stacksize (equal to ERRORSTACKSIZE in this case), and so the stack -** will be reduced to a "regular" size. -*/ -void luaD_shrinkstack (lua_State *L) { - int inuse = stackinuse(L); - int nsize = inuse * 2; /* proposed new size */ - int max = inuse * 3; /* maximum "reasonable" size */ - if (max > LUAI_MAXSTACK) { - max = LUAI_MAXSTACK; /* respect stack limit */ - if (nsize > LUAI_MAXSTACK) - nsize = LUAI_MAXSTACK; - } - /* if thread is currently not handling a stack overflow and its - size is larger than maximum "reasonable" size, shrink it */ - if (inuse <= LUAI_MAXSTACK && stacksize(L) > max) - luaD_reallocstack(L, nsize, 0); /* ok if that fails */ - else /* don't change stack */ - condmovestack(L,{},{}); /* (change only for debugging) */ - luaE_shrinkCI(L); /* shrink CI list */ -} - - -void luaD_inctop (lua_State *L) { - luaD_checkstack(L, 1); - L->top++; -} - -/* }================================================================== */ - - -/* -** Call a hook for the given event. Make sure there is a hook to be -** called. (Both 'L->hook' and 'L->hookmask', which trigger this -** function, can be changed asynchronously by signals.) -*/ -void luaD_hook (lua_State *L, int event, int line, - int ftransfer, int ntransfer) { - lua_Hook hook = L->hook; - if (hook && L->allowhook) { /* make sure there is a hook */ - int mask = CIST_HOOKED; - CallInfo *ci = L->ci; - ptrdiff_t top = savestack(L, L->top); /* preserve original 'top' */ - ptrdiff_t ci_top = savestack(L, ci->top); /* idem for 'ci->top' */ - lua_Debug ar; - ar.event = event; - ar.currentline = line; - ar.i_ci = ci; - if (ntransfer != 0) { - mask |= CIST_TRAN; /* 'ci' has transfer information */ - ci->u2.transferinfo.ftransfer = ftransfer; - ci->u2.transferinfo.ntransfer = ntransfer; - } - if (isLua(ci) && L->top < ci->top) - L->top = ci->top; /* protect entire activation register */ - luaD_checkstack(L, LUA_MINSTACK); /* ensure minimum stack size */ - if (ci->top < L->top + LUA_MINSTACK) - ci->top = L->top + LUA_MINSTACK; - L->allowhook = 0; /* cannot call hooks inside a hook */ - ci->callstatus |= mask; - lua_unlock(L); - (*hook)(L, &ar); - lua_lock(L); - lua_assert(!L->allowhook); - L->allowhook = 1; - ci->top = restorestack(L, ci_top); - L->top = restorestack(L, top); - ci->callstatus &= ~mask; - } -} - - -/* -** Executes a call hook for Lua functions. This function is called -** whenever 'hookmask' is not zero, so it checks whether call hooks are -** active. -*/ -void luaD_hookcall (lua_State *L, CallInfo *ci) { - L->oldpc = 0; /* set 'oldpc' for new function */ - if (L->hookmask & LUA_MASKCALL) { /* is call hook on? */ - int event = (ci->callstatus & CIST_TAIL) ? LUA_HOOKTAILCALL - : LUA_HOOKCALL; - Proto *p = ci_func(ci)->p; - ci->u.l.savedpc++; /* hooks assume 'pc' is already incremented */ - luaD_hook(L, event, -1, 1, p->numparams); - ci->u.l.savedpc--; /* correct 'pc' */ - } -} - - -/* -** Executes a return hook for Lua and C functions and sets/corrects -** 'oldpc'. (Note that this correction is needed by the line hook, so it -** is done even when return hooks are off.) -*/ -static void rethook (lua_State *L, CallInfo *ci, int nres) { - if (L->hookmask & LUA_MASKRET) { /* is return hook on? */ - StkId firstres = L->top - nres; /* index of first result */ - int delta = 0; /* correction for vararg functions */ - int ftransfer; - if (isLua(ci)) { - Proto *p = ci_func(ci)->p; - if (p->is_vararg) - delta = ci->u.l.nextraargs + p->numparams + 1; - } - ci->func += delta; /* if vararg, back to virtual 'func' */ - ftransfer = cast(unsigned short, firstres - ci->func); - luaD_hook(L, LUA_HOOKRET, -1, ftransfer, nres); /* call it */ - ci->func -= delta; - } - if (isLua(ci = ci->previous)) - L->oldpc = pcRel(ci->u.l.savedpc, ci_func(ci)->p); /* set 'oldpc' */ -} - - -/* -** Check whether 'func' has a '__call' metafield. If so, put it in the -** stack, below original 'func', so that 'luaD_precall' can call it. Raise -** an error if there is no '__call' metafield. -*/ -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 > func; p--) /* open space for metamethod */ - setobjs2s(L, p, p-1); - L->top++; /* stack space pre-allocated by the caller */ - setobj2s(L, func, tm); /* metamethod is the new function to be called */ - 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 = res; - return; - case 1: /* one value needed */ - if (nres == 0) /* no results? */ - setnilvalue(s2v(res)); /* adjust with nil */ - else /* at least one result */ - setobjs2s(L, res, L->top - nres); /* move it to proper place */ - L->top = res + 1; - return; - case LUA_MULTRET: - wanted = nres; /* we want all results */ - break; - default: /* two/more results and/or to-be-closed variables */ - if (hastocloseCfunc(wanted)) { /* to-be-closed variables? */ - ptrdiff_t savedres = savestack(L, res); - L->ci->callstatus |= CIST_CLSRET; /* in case of yields */ - L->ci->u2.nres = nres; - luaF_close(L, res, CLOSEKTOP, 1); - L->ci->callstatus &= ~CIST_CLSRET; - if (L->hookmask) /* if needed, call hook after '__close's */ - rethook(L, L->ci, nres); - res = restorestack(L, savedres); /* close and hook can move stack */ - wanted = decodeNresults(wanted); - if (wanted == LUA_MULTRET) - wanted = nres; /* we want all results */ - } - break; - } - /* generic case */ - firstresult = L->top - nres; /* index of first result */ - if (nres > wanted) /* extra results? */ - nres = wanted; /* don't need them */ - for (i = 0; i < nres; i++) /* move all results to correct place */ - setobjs2s(L, res + i, firstresult + i); - for (; i < wanted; i++) /* complete wanted number of results */ - setnilvalue(s2v(res + i)); - L->top = res + wanted; /* top points after the last result */ -} - - -/* -** Finishes a function call: calls hook if necessary, moves current -** number of results to proper place, and returns to previous call -** info. If function has to close variables, hook must be called after -** that. -*/ -void luaD_poscall (lua_State *L, CallInfo *ci, int nres) { - int wanted = ci->nresults; - if (l_unlikely(L->hookmask && !hastocloseCfunc(wanted))) - rethook(L, ci, nres); - /* move results to proper place */ - moveresults(L, ci->func, nres, wanted); - /* function cannot be in any of these cases when returning */ - lua_assert(!(ci->callstatus & - (CIST_HOOKED | CIST_YPCALL | CIST_FIN | CIST_TRAN | CIST_CLSRET))); - L->ci = ci->previous; /* back to caller (after closing variables) */ -} - - - -#define next_ci(L) (L->ci->next ? L->ci->next : luaE_extendCI(L)) - - -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 = func; - ci->nresults = nret; - ci->callstatus = mask; - ci->top = 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 + LUA_MINSTACK); - lua_assert(ci->top <= L->stack_last); - if (l_unlikely(L->hookmask & LUA_MASKCALL)) { - int narg = cast_int(L->top - func) - 1; - luaD_hook(L, LUA_HOOKCALL, -1, 1, narg); - } - lua_unlock(L); - n = (*f)(L); /* do the actual call */ - lua_lock(L); - api_checknelems(L, n); - luaD_poscall(L, ci, n); - return 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 -= delta; /* restore 'func' (if vararg) */ - for (i = 0; i < narg1; i++) /* move down function and arguments */ - setobjs2s(L, ci->func + i, func + i); - func = ci->func; /* moved-down function */ - for (; narg1 <= nfixparams; narg1++) - setnilvalue(s2v(func + narg1)); /* complete missing arguments */ - ci->top = func + 1 + fsize; /* top for new function */ - lua_assert(ci->top <= L->stack_last); - ci->u.l.savedpc = p->code; /* starting point */ - ci->callstatus |= CIST_TAIL; - L->top = func + narg1; /* set top */ - 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 - 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++)); /* complete missing arguments */ - lua_assert(ci->top <= L->stack_last); - 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). -*/ -l_sinline void ccall (lua_State *L, StkId func, int nResults, int inc) { - CallInfo *ci; - L->nCcalls += inc; - if (l_unlikely(getCcalls(L) >= LUAI_MAXCCALLS)) - luaE_checkcstack(L); - if ((ci = luaD_precall(L, func, nResults)) != NULL) { /* Lua function? */ - ci->callstatus = CIST_FRESH; /* mark that it is a "fresh" execute */ - luaV_execute(L, ci); /* call it */ - } - L->nCcalls -= inc; -} - - -/* -** External interface for 'ccall' -*/ -void luaD_call (lua_State *L, StkId func, int nResults) { - ccall(L, func, nResults, 1); -} - - -/* -** Similar to 'luaD_call', but does not allow yields during the call. -*/ -void luaD_callnoyield (lua_State *L, StkId func, int nResults) { - ccall(L, func, nResults, nyci); -} - - -/* -** Finish the job of 'lua_pcallk' after it was interrupted by an yield. -** (The caller, 'finishCcall', does the final call to 'adjustresults'.) -** The main job is to complete the 'luaD_pcall' called by 'lua_pcallk'. -** If a '__close' method yields here, eventually control will be back -** to 'finishCcall' (when that '__close' method finally returns) and -** 'finishpcallk' will run again and close any still pending '__close' -** methods. Similarly, if a '__close' method errs, 'precover' calls -** 'unroll' which calls ''finishCcall' and we are back here again, to -** close any pending '__close' methods. -** Note that, up to the call to 'luaF_close', the corresponding -** 'CallInfo' is not modified, so that this repeated run works like the -** first one (except that it has at least one less '__close' to do). In -** particular, field CIST_RECST preserves the error status across these -** multiple runs, changing only if there is a new error. -*/ -static int finishpcallk (lua_State *L, CallInfo *ci) { - int status = getcistrecst(ci); /* get original status */ - if (l_likely(status == LUA_OK)) /* no error? */ - status = LUA_YIELD; /* was interrupted by an yield */ - else { /* error */ - StkId func = restorestack(L, ci->u2.funcidx); - L->allowhook = getoah(ci->callstatus); /* restore 'allowhook' */ - luaF_close(L, func, status, 1); /* can yield or raise an error */ - func = restorestack(L, ci->u2.funcidx); /* stack may be moved */ - luaD_seterrorobj(L, status, func); - luaD_shrinkstack(L); /* restore stack size in case of overflow */ - setcistrecst(ci, LUA_OK); /* clear original status */ - } - ci->callstatus &= ~CIST_YPCALL; - L->errfunc = ci->u.c.old_errfunc; - /* if it is here, there were errors or yields; unlike 'lua_pcallk', - do not change status */ - return status; -} - - -/* -** Completes the execution of a C function interrupted by an yield. -** The interruption must have happened while the function was either -** closing its tbc variables in 'moveresults' or executing -** 'lua_callk'/'lua_pcallk'. In the first case, it just redoes -** 'luaD_poscall'. In the second case, the call to 'finishpcallk' -** finishes the interrupted execution of 'lua_pcallk'. After that, it -** calls the continuation of the interrupted function and finally it -** completes the job of the 'luaD_call' that called the function. In -** the call to 'adjustresults', we do not know the number of results -** of the function called by 'lua_callk'/'lua_pcallk', so we are -** conservative and use LUA_MULTRET (always adjust). -*/ -static void finishCcall (lua_State *L, CallInfo *ci) { - int n; /* actual number of results from C function */ - if (ci->callstatus & CIST_CLSRET) { /* was returning? */ - lua_assert(hastocloseCfunc(ci->nresults)); - n = ci->u2.nres; /* just redo 'luaD_poscall' */ - /* don't need to reset CIST_CLSRET, as it will be set again anyway */ - } - else { - int status = LUA_YIELD; /* default if there were no errors */ - /* must have a continuation and must be able to call it */ - lua_assert(ci->u.c.k != NULL && yieldable(L)); - if (ci->callstatus & CIST_YPCALL) /* was inside a 'lua_pcallk'? */ - status = finishpcallk(L, ci); /* finish it */ - adjustresults(L, LUA_MULTRET); /* finish 'lua_callk' */ - lua_unlock(L); - n = (*ci->u.c.k)(L, status, ci->u.c.ctx); /* call continuation */ - lua_lock(L); - api_checknelems(L, n); - } - luaD_poscall(L, ci, n); /* finish 'luaD_call' */ -} - - -/* -** Executes "full continuation" (everything in the stack) of a -** previously interrupted coroutine until the stack is empty (or another -** interruption long-jumps out of the loop). -*/ -static void unroll (lua_State *L, void *ud) { - CallInfo *ci; - UNUSED(ud); - while ((ci = L->ci) != &L->base_ci) { /* something in the stack */ - if (!isLua(ci)) /* C function? */ - finishCcall(L, ci); /* complete its execution */ - else { /* Lua function */ - luaV_finishOp(L); /* finish interrupted instruction */ - luaV_execute(L, ci); /* execute down to higher C 'boundary' */ - } - } -} - - -/* -** Try to find a suspended protected call (a "recover point") for the -** given thread. -*/ -static CallInfo *findpcall (lua_State *L) { - CallInfo *ci; - for (ci = L->ci; ci != NULL; ci = ci->previous) { /* search for a pcall */ - if (ci->callstatus & CIST_YPCALL) - return ci; - } - return NULL; /* no pending pcall */ -} - - -/* -** Signal an error in the call to 'lua_resume', not in the execution -** of the coroutine itself. (Such errors should not be handled by any -** coroutine error handler and should not kill the coroutine.) -*/ -static int resume_error (lua_State *L, const char *msg, int narg) { - L->top -= narg; /* remove args from the stack */ - setsvalue2s(L, L->top, luaS_new(L, msg)); /* push error message */ - api_incr_top(L); - lua_unlock(L); - return LUA_ERRRUN; -} - - -/* -** Do the work for 'lua_resume' in protected mode. Most of the work -** depends on the status of the coroutine: initial state, suspended -** inside a hook, or regularly suspended (optionally with a continuation -** function), plus erroneous cases: non-suspended coroutine or dead -** coroutine. -*/ -static void resume (lua_State *L, void *ud) { - int n = *(cast(int*, ud)); /* number of arguments */ - StkId firstArg = L->top - n; /* first argument */ - CallInfo *ci = L->ci; - if (L->status == LUA_OK) /* starting a coroutine? */ - ccall(L, firstArg - 1, LUA_MULTRET, 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 = firstArg; /* discard arguments */ - luaV_execute(L, ci); /* just continue running Lua code */ - } - else { /* 'common' yield */ - if (ci->u.c.k != NULL) { /* does it have a continuation function? */ - lua_unlock(L); - n = (*ci->u.c.k)(L, LUA_YIELD, ci->u.c.ctx); /* call continuation */ - lua_lock(L); - api_checknelems(L, n); - } - luaD_poscall(L, ci, n); /* finish 'luaD_call' */ - } - unroll(L, NULL); /* run continuation */ - } -} - - -/* -** Unrolls a coroutine in protected mode while there are recoverable -** errors, that is, errors inside a protected call. (Any error -** interrupts 'unroll', and this loop protects it again so it can -** continue.) Stops with a normal end (status == LUA_OK), an yield -** (status == LUA_YIELD), or an unprotected error ('findpcall' doesn't -** find a recover point). -*/ -static int precover (lua_State *L, int status) { - CallInfo *ci; - while (errorstatus(status) && (ci = findpcall(L)) != NULL) { - L->ci = ci; /* go down to recovery functions */ - setcistrecst(ci, status); /* status to finish 'pcall' */ - status = luaD_rawrunprotected(L, unroll, NULL); - } - return status; -} - - -LUA_API int lua_resume (lua_State *L, lua_State *from, int nargs, - int *nresults) { - int status; - lua_lock(L); - if (L->status == LUA_OK) { /* may be starting a coroutine */ - if (L->ci != &L->base_ci) /* not in base level? */ - return resume_error(L, "cannot resume non-suspended coroutine", nargs); - else if (L->top - (L->ci->func + 1) == nargs) /* no function? */ - return resume_error(L, "cannot resume dead coroutine", nargs); - } - else if (L->status != LUA_YIELD) /* ended with errors? */ - return resume_error(L, "cannot resume dead coroutine", nargs); - L->nCcalls = (from) ? getCcalls(from) : 0; - 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); /* push error message */ - L->ci->top = L->top; - } - *nresults = (status == LUA_YIELD) ? L->ci->u2.nyield - : cast_int(L->top - (L->ci->func + 1)); - lua_unlock(L); - return status; -} - - -LUA_API int lua_isyieldable (lua_State *L) { - return yieldable(L); -} - - -LUA_API int lua_yieldk (lua_State *L, int nresults, lua_KContext ctx, - lua_KFunction k) { - CallInfo *ci; - luai_userstateyield(L, nresults); - lua_lock(L); - ci = L->ci; - api_checknelems(L, nresults); - if (l_unlikely(!yieldable(L))) { - if (L != G(L)->mainthread) - luaG_runerror(L, "attempt to yield across a C-call boundary"); - else - luaG_runerror(L, "attempt to yield from outside a coroutine"); - } - L->status = LUA_YIELD; - ci->u2.nyield = nresults; /* save number of results */ - if (isLua(ci)) { /* inside a hook? */ - lua_assert(!isLuacode(ci)); - api_check(L, nresults == 0, "hooks cannot yield values"); - api_check(L, k == NULL, "hooks cannot continue after yielding"); - } - else { - if ((ci->u.c.k = k) != NULL) /* is there a continuation? */ - ci->u.c.ctx = ctx; /* save context */ - luaD_throw(L, LUA_YIELD); - } - lua_assert(ci->callstatus & CIST_HOOKED); /* must be inside a hook */ - lua_unlock(L); - return 0; /* return to 'luaD_hook' */ -} - - -/* -** Auxiliary structure to call 'luaF_close' in protected mode. -*/ -struct CloseP { - StkId level; - int status; -}; - - -/* -** Auxiliary function to call 'luaF_close' in protected mode. -*/ -static void closepaux (lua_State *L, void *ud) { - struct CloseP *pcl = cast(struct CloseP *, ud); - luaF_close(L, pcl->level, pcl->status, 0); -} - - -/* -** Calls 'luaF_close' in protected mode. Return the original status -** or, in case of errors, the new status. -*/ -int luaD_closeprotected (lua_State *L, ptrdiff_t level, int status) { - CallInfo *old_ci = L->ci; - lu_byte old_allowhooks = L->allowhook; - for (;;) { /* keep closing upvalues until no more errors */ - struct CloseP pcl; - pcl.level = restorestack(L, level); pcl.status = status; - status = luaD_rawrunprotected(L, &closepaux, &pcl); - if (l_likely(status == LUA_OK)) /* no more errors? */ - return pcl.status; - else { /* an error occurred; restore saved state and repeat */ - L->ci = old_ci; - L->allowhook = old_allowhooks; - } - } -} - - -/* -** Call the C function 'func' in protected mode, restoring basic -** thread information ('allowhook', etc.) and in particular -** its stack level in case of errors. -*/ -int luaD_pcall (lua_State *L, Pfunc func, void *u, - ptrdiff_t old_top, ptrdiff_t ef) { - int status; - CallInfo *old_ci = L->ci; - lu_byte old_allowhooks = L->allowhook; - ptrdiff_t old_errfunc = L->errfunc; - L->errfunc = ef; - status = luaD_rawrunprotected(L, func, u); - if (l_unlikely(status != LUA_OK)) { /* an error occurred? */ - L->ci = old_ci; - L->allowhook = old_allowhooks; - status = luaD_closeprotected(L, old_top, status); - luaD_seterrorobj(L, status, restorestack(L, old_top)); - luaD_shrinkstack(L); /* restore stack size in case of overflow */ - } - L->errfunc = old_errfunc; - return status; -} - - - -/* -** Execute a protected parser. -*/ -struct SParser { /* data to 'f_parser' */ - ZIO *z; - Mbuffer buff; /* dynamic structure used by the scanner */ - Dyndata dyd; /* dynamic structures used by the parser */ - const char *mode; - const char *name; -}; - - -static void checkmode (lua_State *L, const char *mode, const char *x) { - if (mode && strchr(mode, x[0]) == NULL) { - luaO_pushfstring(L, - "attempt to load a %s chunk (mode is '%s')", x, mode); - luaD_throw(L, LUA_ERRSYNTAX); - } -} - - -static void f_parser (lua_State *L, void *ud) { - LClosure *cl; - struct SParser *p = cast(struct SParser *, ud); - int c = zgetc(p->z); /* read first character */ - if (c == LUA_SIGNATURE[0]) { - checkmode(L, p->mode, "binary"); - cl = luaU_undump(L, p->z, p->name); - } - else { - checkmode(L, p->mode, "text"); - cl = luaY_parser(L, p->z, &p->buff, &p->dyd, p->name, c); - } - lua_assert(cl->nupvalues == cl->p->sizeupvalues); - luaF_initupvals(L, cl); -} - - -int luaD_protectedparser (lua_State *L, ZIO *z, const char *name, - const char *mode) { - struct SParser p; - int status; - incnny(L); /* cannot yield during parsing */ - p.z = z; p.name = name; p.mode = mode; - p.dyd.actvar.arr = NULL; p.dyd.actvar.size = 0; - p.dyd.gt.arr = NULL; p.dyd.gt.size = 0; - p.dyd.label.arr = NULL; p.dyd.label.size = 0; - luaZ_initbuffer(L, &p.buff); - status = luaD_pcall(L, f_parser, &p, savestack(L, L->top), L->errfunc); - luaZ_freebuffer(L, &p.buff); - luaM_freearray(L, p.dyd.actvar.arr, p.dyd.actvar.size); - luaM_freearray(L, p.dyd.gt.arr, p.dyd.gt.size); - luaM_freearray(L, p.dyd.label.arr, p.dyd.label.size); - decnny(L); - return status; -} - - diff --git a/lua-5.4.4/src/ldo.h b/lua-5.4.4/src/ldo.h deleted file mode 100644 index 911e67f..0000000 --- a/lua-5.4.4/src/ldo.h +++ /dev/null @@ -1,79 +0,0 @@ -/* -** $Id: ldo.h $ -** Stack and Call structure of Lua -** See Copyright Notice in lua.h -*/ - -#ifndef ldo_h -#define ldo_h - - -#include "lobject.h" -#include "lstate.h" -#include "lzio.h" - - -/* -** Macro to check stack size and grow stack if needed. Parameters -** 'pre'/'pos' allow the macro to preserve a pointer into the -** stack across reallocations, doing the work only when needed. -** It also allows the running of one GC step when the stack is -** reallocated. -** 'condmovestack' is used in heavy tests to force a stack reallocation -** at every check. -*/ -#define luaD_checkstackaux(L,n,pre,pos) \ - if (l_unlikely(L->stack_last - L->top <= (n))) \ - { pre; luaD_growstack(L, n, 1); pos; } \ - else { condmovestack(L,pre,pos); } - -/* In general, 'pre'/'pos' are empty (nothing to save) */ -#define luaD_checkstack(L,n) luaD_checkstackaux(L,n,(void)0,(void)0) - - - -#define savestack(L,p) ((char *)(p) - (char *)L->stack) -#define restorestack(L,n) ((StkId)((char *)L->stack + (n))) - - -/* macro to check stack size, preserving 'p' */ -#define checkstackGCp(L,n,p) \ - luaD_checkstackaux(L, n, \ - ptrdiff_t t__ = savestack(L, p); /* save 'p' */ \ - luaC_checkGC(L), /* stack grow uses memory */ \ - p = restorestack(L, t__)) /* 'pos' part: restore 'p' */ - - -/* macro to check stack size and GC */ -#define checkstackGC(L,fsize) \ - luaD_checkstackaux(L, (fsize), luaC_checkGC(L), (void)0) - - -/* type of protected functions, to be ran by 'runprotected' */ -typedef void (*Pfunc) (lua_State *L, void *ud); - -LUAI_FUNC void luaD_seterrorobj (lua_State *L, int errcode, StkId oldtop); -LUAI_FUNC int luaD_protectedparser (lua_State *L, ZIO *z, const char *name, - const char *mode); -LUAI_FUNC void luaD_hook (lua_State *L, int event, int line, - int fTransfer, int nTransfer); -LUAI_FUNC void luaD_hookcall (lua_State *L, CallInfo *ci); -LUAI_FUNC 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.4/src/ldump.c b/lua-5.4.4/src/ldump.c deleted file mode 100644 index f848b66..0000000 --- a/lua-5.4.4/src/ldump.c +++ /dev/null @@ -1,226 +0,0 @@ -/* -** $Id: ldump.c $ -** save precompiled Lua chunks -** See Copyright Notice in lua.h -*/ - -#define ldump_c -#define LUA_CORE - -#include "lprefix.h" - - -#include - -#include "lua.h" - -#include "lobject.h" -#include "lstate.h" -#include "lundump.h" - - -typedef struct { - lua_State *L; - lua_Writer writer; - void *data; - int strip; - int status; -} DumpState; - - -/* -** All high-level dumps go through dumpVector; you can change it to -** change the endianness of the result -*/ -#define dumpVector(D,v,n) dumpBlock(D,v,(n)*sizeof((v)[0])) - -#define dumpLiteral(D, s) dumpBlock(D,s,sizeof(s) - sizeof(char)) - - -static void dumpBlock (DumpState *D, const void *b, size_t size) { - if (D->status == 0 && size > 0) { - lua_unlock(D->L); - D->status = (*D->writer)(D->L, b, size, D->data); - lua_lock(D->L); - } -} - - -#define dumpVar(D,x) dumpVector(D,&x,1) - - -static void dumpByte (DumpState *D, int y) { - lu_byte x = (lu_byte)y; - dumpVar(D, x); -} - - -/* dumpInt Buff Size */ -#define DIBS ((sizeof(size_t) * 8 / 7) + 1) - -static void dumpSize (DumpState *D, size_t x) { - lu_byte buff[DIBS]; - int n = 0; - do { - buff[DIBS - (++n)] = x & 0x7f; /* fill buffer in reverse order */ - x >>= 7; - } while (x != 0); - buff[DIBS - 1] |= 0x80; /* mark last byte */ - dumpVector(D, buff + DIBS - n, n); -} - - -static void dumpInt (DumpState *D, int x) { - dumpSize(D, x); -} - - -static void dumpNumber (DumpState *D, lua_Number x) { - dumpVar(D, x); -} - - -static void dumpInteger (DumpState *D, lua_Integer x) { - dumpVar(D, x); -} - - -static void dumpString (DumpState *D, const TString *s) { - if (s == NULL) - dumpSize(D, 0); - else { - size_t size = tsslen(s); - const char *str = getstr(s); - dumpSize(D, size + 1); - dumpVector(D, str, size); - } -} - - -static void dumpCode (DumpState *D, const Proto *f) { - dumpInt(D, f->sizecode); - dumpVector(D, f->code, f->sizecode); -} - - -static void dumpFunction(DumpState *D, const Proto *f, TString *psource); - -static void dumpConstants (DumpState *D, const Proto *f) { - int i; - int n = f->sizek; - dumpInt(D, n); - for (i = 0; i < n; i++) { - const TValue *o = &f->k[i]; - int tt = ttypetag(o); - dumpByte(D, tt); - switch (tt) { - case LUA_VNUMFLT: - dumpNumber(D, fltvalue(o)); - break; - case LUA_VNUMINT: - dumpInteger(D, ivalue(o)); - break; - case LUA_VSHRSTR: - case LUA_VLNGSTR: - dumpString(D, tsvalue(o)); - break; - default: - lua_assert(tt == LUA_VNIL || tt == LUA_VFALSE || tt == LUA_VTRUE); - } - } -} - - -static void dumpProtos (DumpState *D, const Proto *f) { - int i; - int n = f->sizep; - dumpInt(D, n); - for (i = 0; i < n; i++) - dumpFunction(D, f->p[i], f->source); -} - - -static void dumpUpvalues (DumpState *D, const Proto *f) { - int i, n = f->sizeupvalues; - dumpInt(D, n); - for (i = 0; i < n; i++) { - dumpByte(D, f->upvalues[i].instack); - dumpByte(D, f->upvalues[i].idx); - dumpByte(D, f->upvalues[i].kind); - } -} - - -static void dumpDebug (DumpState *D, const Proto *f) { - int i, n; - n = (D->strip) ? 0 : f->sizelineinfo; - dumpInt(D, n); - dumpVector(D, f->lineinfo, n); - n = (D->strip) ? 0 : f->sizeabslineinfo; - dumpInt(D, n); - for (i = 0; i < n; i++) { - dumpInt(D, f->abslineinfo[i].pc); - dumpInt(D, f->abslineinfo[i].line); - } - n = (D->strip) ? 0 : f->sizelocvars; - dumpInt(D, n); - for (i = 0; i < n; i++) { - dumpString(D, f->locvars[i].varname); - dumpInt(D, f->locvars[i].startpc); - dumpInt(D, f->locvars[i].endpc); - } - n = (D->strip) ? 0 : f->sizeupvalues; - dumpInt(D, n); - for (i = 0; i < n; i++) - dumpString(D, f->upvalues[i].name); -} - - -static void dumpFunction (DumpState *D, const Proto *f, TString *psource) { - if (D->strip || f->source == psource) - dumpString(D, NULL); /* no debug info or same source as its parent */ - else - dumpString(D, f->source); - dumpInt(D, f->linedefined); - dumpInt(D, f->lastlinedefined); - dumpByte(D, f->numparams); - dumpByte(D, f->is_vararg); - dumpByte(D, f->maxstacksize); - dumpCode(D, f); - dumpConstants(D, f); - dumpUpvalues(D, f); - dumpProtos(D, f); - dumpDebug(D, f); -} - - -static void dumpHeader (DumpState *D) { - dumpLiteral(D, LUA_SIGNATURE); - dumpByte(D, LUAC_VERSION); - dumpByte(D, LUAC_FORMAT); - dumpLiteral(D, LUAC_DATA); - dumpByte(D, sizeof(Instruction)); - dumpByte(D, sizeof(lua_Integer)); - dumpByte(D, sizeof(lua_Number)); - dumpInteger(D, LUAC_INT); - dumpNumber(D, LUAC_NUM); -} - - -/* -** dump Lua function as precompiled chunk -*/ -int luaU_dump(lua_State *L, const Proto *f, lua_Writer w, void *data, - int strip) { - DumpState D; - D.L = L; - D.writer = w; - D.data = data; - D.strip = strip; - D.status = 0; - dumpHeader(&D); - dumpByte(&D, f->sizeupvalues); - dumpFunction(&D, f, NULL); - return D.status; -} - diff --git a/lua-5.4.4/src/lfunc.c b/lua-5.4.4/src/lfunc.c deleted file mode 100644 index f5889a2..0000000 --- a/lua-5.4.4/src/lfunc.c +++ /dev/null @@ -1,294 +0,0 @@ -/* -** $Id: lfunc.c $ -** Auxiliary functions to manipulate prototypes and closures -** See Copyright Notice in lua.h -*/ - -#define lfunc_c -#define LUA_CORE - -#include "lprefix.h" - - -#include - -#include "lua.h" - -#include "ldebug.h" -#include "ldo.h" -#include "lfunc.h" -#include "lgc.h" -#include "lmem.h" -#include "lobject.h" -#include "lstate.h" - - - -CClosure *luaF_newCclosure (lua_State *L, int nupvals) { - GCObject *o = luaC_newobj(L, LUA_VCCL, sizeCclosure(nupvals)); - CClosure *c = gco2ccl(o); - c->nupvalues = cast_byte(nupvals); - return c; -} - - -LClosure *luaF_newLclosure (lua_State *L, int nupvals) { - GCObject *o = luaC_newobj(L, LUA_VLCL, sizeLclosure(nupvals)); - LClosure *c = gco2lcl(o); - c->p = NULL; - c->nupvalues = cast_byte(nupvals); - while (nupvals--) c->upvals[nupvals] = NULL; - return c; -} - - -/* -** fill a closure with new closed upvalues -*/ -void luaF_initupvals (lua_State *L, LClosure *cl) { - int i; - for (i = 0; i < cl->nupvalues; i++) { - GCObject *o = luaC_newobj(L, LUA_VUPVAL, sizeof(UpVal)); - UpVal *uv = gco2upv(o); - uv->v = &uv->u.value; /* make it closed */ - setnilvalue(uv->v); - cl->upvals[i] = uv; - luaC_objbarrier(L, cl, uv); - } -} - - -/* -** Create a new upvalue at the given level, and link it to the list of -** open upvalues of 'L' after entry 'prev'. -**/ -static UpVal *newupval (lua_State *L, int tbc, StkId level, UpVal **prev) { - GCObject *o = luaC_newobj(L, LUA_VUPVAL, sizeof(UpVal)); - UpVal *uv = gco2upv(o); - UpVal *next = *prev; - uv->v = s2v(level); /* current value lives in the stack */ - uv->tbc = tbc; - uv->u.open.next = next; /* link it to list of open upvalues */ - uv->u.open.previous = prev; - if (next) - next->u.open.previous = &uv->u.open.next; - *prev = uv; - if (!isintwups(L)) { /* thread not in list of threads with upvalues? */ - L->twups = G(L)->twups; /* link it to the list */ - G(L)->twups = L; - } - return uv; -} - - -/* -** Find and reuse, or create if it does not exist, an upvalue -** at the given level. -*/ -UpVal *luaF_findupval (lua_State *L, StkId level) { - UpVal **pp = &L->openupval; - UpVal *p; - lua_assert(isintwups(L) || L->openupval == NULL); - while ((p = *pp) != NULL && uplevel(p) >= level) { /* search for it */ - lua_assert(!isdead(G(L), p)); - if (uplevel(p) == level) /* corresponding upvalue? */ - return p; /* return it */ - pp = &p->u.open.next; - } - /* not found: create a new upvalue after 'pp' */ - return newupval(L, 0, level, pp); -} - - -/* -** Call closing method for object 'obj' with error message 'err'. The -** boolean 'yy' controls whether the call is yieldable. -** (This function assumes EXTRA_STACK.) -*/ -static void callclosemethod (lua_State *L, TValue *obj, TValue *err, int yy) { - StkId top = L->top; - const TValue *tm = luaT_gettmbyobj(L, obj, TM_CLOSE); - setobj2s(L, top, tm); /* will call metamethod... */ - setobj2s(L, top + 1, obj); /* with 'self' as the 1st argument */ - setobj2s(L, top + 2, err); /* and error msg. as 2nd argument */ - L->top = top + 3; /* add function and arguments */ - if (yy) - luaD_call(L, top, 0); - else - luaD_callnoyield(L, top, 0); -} - - -/* -** Check whether object at given level has a close metamethod and raise -** an error if not. -*/ -static void checkclosemth (lua_State *L, StkId level) { - const TValue *tm = luaT_gettmbyobj(L, s2v(level), TM_CLOSE); - if (ttisnil(tm)) { /* no metamethod? */ - int idx = cast_int(level - L->ci->func); /* variable index */ - const char *vname = luaG_findlocal(L, L->ci, idx, NULL); - if (vname == NULL) vname = "?"; - luaG_runerror(L, "variable '%s' got a non-closable value", vname); - } -} - - -/* -** Prepare and call a closing method. -** If status is CLOSEKTOP, the call to the closing method will be pushed -** at the top of the stack. Otherwise, values can be pushed right after -** the 'level' of the upvalue being closed, as everything after that -** won't be used again. -*/ -static void prepcallclosemth (lua_State *L, StkId level, int status, int yy) { - TValue *uv = s2v(level); /* value being closed */ - TValue *errobj; - if (status == CLOSEKTOP) - errobj = &G(L)->nilvalue; /* error object is nil */ - else { /* 'luaD_seterrorobj' will set top to level + 2 */ - errobj = s2v(level + 1); /* error object goes after 'uv' */ - luaD_seterrorobj(L, status, level + 1); /* set error object */ - } - callclosemethod(L, uv, errobj, yy); -} - - -/* -** Maximum value for deltas in 'tbclist', dependent on the type -** of delta. (This macro assumes that an 'L' is in scope where it -** is used.) -*/ -#define MAXDELTA \ - ((256ul << ((sizeof(L->stack->tbclist.delta) - 1) * 8)) - 1) - - -/* -** Insert a variable in the list of to-be-closed variables. -*/ -void luaF_newtbcupval (lua_State *L, StkId level) { - lua_assert(level > L->tbclist); - if (l_isfalse(s2v(level))) - return; /* false doesn't need to be closed */ - checkclosemth(L, level); /* value must have a close method */ - while (cast_uint(level - L->tbclist) > MAXDELTA) { - L->tbclist += MAXDELTA; /* create a dummy node at maximum delta */ - L->tbclist->tbclist.delta = 0; - } - level->tbclist.delta = cast(unsigned short, level - L->tbclist); - L->tbclist = level; -} - - -void luaF_unlinkupval (UpVal *uv) { - lua_assert(upisopen(uv)); - *uv->u.open.previous = uv->u.open.next; - if (uv->u.open.next) - uv->u.open.next->u.open.previous = uv->u.open.previous; -} - - -/* -** Close all upvalues up to the given stack level. -*/ -void luaF_closeupval (lua_State *L, StkId level) { - UpVal *uv; - StkId upl; /* stack index pointed by 'uv' */ - while ((uv = L->openupval) != NULL && (upl = uplevel(uv)) >= level) { - TValue *slot = &uv->u.value; /* new position for value */ - lua_assert(uplevel(uv) < L->top); - luaF_unlinkupval(uv); /* remove upvalue from 'openupval' list */ - setobj(L, slot, uv->v); /* move value to upvalue slot */ - uv->v = slot; /* now current value lives here */ - if (!iswhite(uv)) { /* neither white nor dead? */ - nw2black(uv); /* closed upvalues cannot be gray */ - luaC_barrier(L, uv, slot); - } - } -} - - -/* -** Remove firt element from the tbclist plus its dummy nodes. -*/ -static void poptbclist (lua_State *L) { - StkId tbc = L->tbclist; - lua_assert(tbc->tbclist.delta > 0); /* first element cannot be dummy */ - tbc -= tbc->tbclist.delta; - while (tbc > L->stack && tbc->tbclist.delta == 0) - tbc -= MAXDELTA; /* remove dummy nodes */ - L->tbclist = tbc; -} - - -/* -** Close all upvalues and to-be-closed variables up to the given stack -** level. -*/ -void luaF_close (lua_State *L, StkId level, int status, int yy) { - ptrdiff_t levelrel = savestack(L, level); - luaF_closeupval(L, level); /* first, close the upvalues */ - while (L->tbclist >= level) { /* traverse tbc's down to that level */ - StkId tbc = L->tbclist; /* get variable index */ - poptbclist(L); /* remove it from list */ - prepcallclosemth(L, tbc, status, yy); /* close variable */ - level = restorestack(L, levelrel); - } -} - - -Proto *luaF_newproto (lua_State *L) { - GCObject *o = luaC_newobj(L, LUA_VPROTO, sizeof(Proto)); - Proto *f = gco2p(o); - f->k = NULL; - f->sizek = 0; - f->p = NULL; - f->sizep = 0; - f->code = NULL; - f->sizecode = 0; - f->lineinfo = NULL; - f->sizelineinfo = 0; - f->abslineinfo = NULL; - f->sizeabslineinfo = 0; - f->upvalues = NULL; - f->sizeupvalues = 0; - f->numparams = 0; - f->is_vararg = 0; - f->maxstacksize = 0; - f->locvars = NULL; - f->sizelocvars = 0; - f->linedefined = 0; - f->lastlinedefined = 0; - f->source = NULL; - return f; -} - - -void luaF_freeproto (lua_State *L, Proto *f) { - luaM_freearray(L, f->code, f->sizecode); - luaM_freearray(L, f->p, f->sizep); - luaM_freearray(L, f->k, f->sizek); - luaM_freearray(L, f->lineinfo, f->sizelineinfo); - luaM_freearray(L, f->abslineinfo, f->sizeabslineinfo); - luaM_freearray(L, f->locvars, f->sizelocvars); - luaM_freearray(L, f->upvalues, f->sizeupvalues); - luaM_free(L, f); -} - - -/* -** Look for n-th local variable at line 'line' in function 'func'. -** Returns NULL if not found. -*/ -const char *luaF_getlocalname (const Proto *f, int local_number, int pc) { - int i; - for (i = 0; isizelocvars && f->locvars[i].startpc <= pc; i++) { - if (pc < f->locvars[i].endpc) { /* is variable active? */ - local_number--; - if (local_number == 0) - return getstr(f->locvars[i].varname); - } - } - return NULL; /* not found */ -} - diff --git a/lua-5.4.4/src/lfunc.h b/lua-5.4.4/src/lfunc.h deleted file mode 100644 index dc1cebc..0000000 --- a/lua-5.4.4/src/lfunc.h +++ /dev/null @@ -1,64 +0,0 @@ -/* -** $Id: lfunc.h $ -** Auxiliary functions to manipulate prototypes and closures -** See Copyright Notice in lua.h -*/ - -#ifndef lfunc_h -#define lfunc_h - - -#include "lobject.h" - - -#define sizeCclosure(n) (cast_int(offsetof(CClosure, upvalue)) + \ - cast_int(sizeof(TValue)) * (n)) - -#define sizeLclosure(n) (cast_int(offsetof(LClosure, upvals)) + \ - cast_int(sizeof(TValue *)) * (n)) - - -/* test whether thread is in 'twups' list */ -#define isintwups(L) (L->twups != L) - - -/* -** maximum number of upvalues in a closure (both C and Lua). (Value -** must fit in a VM register.) -*/ -#define MAXUPVAL 255 - - -#define upisopen(up) ((up)->v != &(up)->u.value) - - -#define uplevel(up) check_exp(upisopen(up), cast(StkId, (up)->v)) - - -/* -** maximum number of misses before giving up the cache of closures -** in prototypes -*/ -#define MAXMISS 10 - - - -/* special status to close upvalues preserving the top of the stack */ -#define CLOSEKTOP (-1) - - -LUAI_FUNC Proto *luaF_newproto (lua_State *L); -LUAI_FUNC CClosure *luaF_newCclosure (lua_State *L, int nupvals); -LUAI_FUNC LClosure *luaF_newLclosure (lua_State *L, int nupvals); -LUAI_FUNC void luaF_initupvals (lua_State *L, LClosure *cl); -LUAI_FUNC UpVal *luaF_findupval (lua_State *L, StkId level); -LUAI_FUNC void luaF_newtbcupval (lua_State *L, StkId level); -LUAI_FUNC void luaF_closeupval (lua_State *L, StkId level); -LUAI_FUNC void luaF_close (lua_State *L, StkId level, int status, int yy); -LUAI_FUNC void luaF_unlinkupval (UpVal *uv); -LUAI_FUNC void luaF_freeproto (lua_State *L, Proto *f); -LUAI_FUNC const char *luaF_getlocalname (const Proto *func, int local_number, - int pc); - - -#endif diff --git a/lua-5.4.4/src/lgc.c b/lua-5.4.4/src/lgc.c deleted file mode 100644 index 42a73d8..0000000 --- a/lua-5.4.4/src/lgc.c +++ /dev/null @@ -1,1731 +0,0 @@ -/* -** $Id: lgc.c $ -** Garbage Collector -** See Copyright Notice in lua.h -*/ - -#define lgc_c -#define LUA_CORE - -#include "lprefix.h" - -#include -#include - - -#include "lua.h" - -#include "ldebug.h" -#include "ldo.h" -#include "lfunc.h" -#include "lgc.h" -#include "lmem.h" -#include "lobject.h" -#include "lstate.h" -#include "lstring.h" -#include "ltable.h" -#include "ltm.h" - - -/* -** Maximum number of elements to sweep in each single step. -** (Large enough to dissipate fixed overheads but small enough -** to allow small steps for the collector.) -*/ -#define GCSWEEPMAX 100 - -/* -** Maximum number of finalizers to call in each single step. -*/ -#define GCFINMAX 10 - - -/* -** Cost of calling one finalizer. -*/ -#define GCFINALIZECOST 50 - - -/* -** The equivalent, in bytes, of one unit of "work" (visiting a slot, -** sweeping an object, etc.) -*/ -#define WORK2MEM sizeof(TValue) - - -/* -** macro to adjust 'pause': 'pause' is actually used like -** 'pause / PAUSEADJ' (value chosen by tests) -*/ -#define PAUSEADJ 100 - - -/* mask with all color bits */ -#define maskcolors (bitmask(BLACKBIT) | WHITEBITS) - -/* mask with all GC bits */ -#define maskgcbits (maskcolors | AGEBITS) - - -/* macro to erase all color bits then set only the current white bit */ -#define makewhite(g,x) \ - (x->marked = cast_byte((x->marked & ~maskcolors) | luaC_white(g))) - -/* make an object gray (neither white nor black) */ -#define set2gray(x) resetbits(x->marked, maskcolors) - - -/* make an object black (coming from any color) */ -#define set2black(x) \ - (x->marked = cast_byte((x->marked & ~WHITEBITS) | bitmask(BLACKBIT))) - - -#define valiswhite(x) (iscollectable(x) && iswhite(gcvalue(x))) - -#define keyiswhite(n) (keyiscollectable(n) && iswhite(gckey(n))) - - -/* -** Protected access to objects in values -*/ -#define gcvalueN(o) (iscollectable(o) ? gcvalue(o) : NULL) - - -#define markvalue(g,o) { checkliveness(g->mainthread,o); \ - if (valiswhite(o)) reallymarkobject(g,gcvalue(o)); } - -#define markkey(g, n) { if keyiswhite(n) reallymarkobject(g,gckey(n)); } - -#define markobject(g,t) { if (iswhite(t)) reallymarkobject(g, obj2gco(t)); } - -/* -** mark an object that can be NULL (either because it is really optional, -** or it was stripped as debug info, or inside an uncompleted structure) -*/ -#define markobjectN(g,t) { if (t) markobject(g,t); } - -static void reallymarkobject (global_State *g, GCObject *o); -static lu_mem atomic (lua_State *L); -static void entersweep (lua_State *L); - - -/* -** {====================================================== -** Generic functions -** ======================================================= -*/ - - -/* -** one after last element in a hash array -*/ -#define gnodelast(h) gnode(h, cast_sizet(sizenode(h))) - - -static GCObject **getgclist (GCObject *o) { - switch (o->tt) { - case LUA_VTABLE: return &gco2t(o)->gclist; - case LUA_VLCL: return &gco2lcl(o)->gclist; - case LUA_VCCL: return &gco2ccl(o)->gclist; - case LUA_VTHREAD: return &gco2th(o)->gclist; - case LUA_VPROTO: return &gco2p(o)->gclist; - case LUA_VUSERDATA: { - Udata *u = gco2u(o); - lua_assert(u->nuvalue > 0); - return &u->gclist; - } - default: lua_assert(0); return 0; - } -} - - -/* -** Link a collectable object 'o' with a known type into the list 'p'. -** (Must be a macro to access the 'gclist' field in different types.) -*/ -#define linkgclist(o,p) linkgclist_(obj2gco(o), &(o)->gclist, &(p)) - -static void linkgclist_ (GCObject *o, GCObject **pnext, GCObject **list) { - lua_assert(!isgray(o)); /* cannot be in a gray list */ - *pnext = *list; - *list = o; - set2gray(o); /* now it is */ -} - - -/* -** Link a generic collectable object 'o' into the list 'p'. -*/ -#define linkobjgclist(o,p) linkgclist_(obj2gco(o), getgclist(o), &(p)) - - - -/* -** Clear keys for empty entries in tables. If entry is empty, mark its -** entry as dead. This allows the collection of the key, but keeps its -** entry in the table: its removal could break a chain and could break -** a table traversal. Other places never manipulate dead keys, because -** its associated empty value is enough to signal that the entry is -** logically empty. -*/ -static void clearkey (Node *n) { - lua_assert(isempty(gval(n))); - if (keyiscollectable(n)) - setdeadkey(n); /* unused key; remove it */ -} - - -/* -** tells whether a key or value can be cleared from a weak -** table. Non-collectable objects are never removed from weak -** tables. Strings behave as 'values', so are never removed too. for -** other objects: if really collected, cannot keep them; for objects -** being finalized, keep them in keys, but not in values -*/ -static int iscleared (global_State *g, const GCObject *o) { - if (o == NULL) return 0; /* non-collectable value */ - else if (novariant(o->tt) == LUA_TSTRING) { - markobject(g, o); /* strings are 'values', so are never weak */ - return 0; - } - else return iswhite(o); -} - - -/* -** Barrier that moves collector forward, that is, marks the white object -** 'v' being pointed by the black object 'o'. In the generational -** mode, 'v' must also become old, if 'o' is old; however, it cannot -** be changed directly to OLD, because it may still point to non-old -** objects. So, it is marked as OLD0. In the next cycle it will become -** OLD1, and in the next it will finally become OLD (regular old). By -** then, any object it points to will also be old. If called in the -** incremental sweep phase, it clears the black object to white (sweep -** it) to avoid other barrier calls for this same object. (That cannot -** be done is generational mode, as its sweep does not distinguish -** whites from deads.) -*/ -void luaC_barrier_ (lua_State *L, GCObject *o, GCObject *v) { - global_State *g = G(L); - lua_assert(isblack(o) && iswhite(v) && !isdead(g, v) && !isdead(g, o)); - if (keepinvariant(g)) { /* must keep invariant? */ - reallymarkobject(g, v); /* restore invariant */ - if (isold(o)) { - lua_assert(!isold(v)); /* white object could not be old */ - setage(v, G_OLD0); /* restore generational invariant */ - } - } - else { /* sweep phase */ - lua_assert(issweepphase(g)); - if (g->gckind == KGC_INC) /* incremental mode? */ - makewhite(g, o); /* mark 'o' as white to avoid other barriers */ - } -} - - -/* -** barrier that moves collector backward, that is, mark the black object -** pointing to a white object as gray again. -*/ -void luaC_barrierback_ (lua_State *L, GCObject *o) { - global_State *g = G(L); - lua_assert(isblack(o) && !isdead(g, o)); - lua_assert((g->gckind == KGC_GEN) == (isold(o) && getage(o) != G_TOUCHED1)); - if (getage(o) == G_TOUCHED2) /* already in gray list? */ - set2gray(o); /* make it gray to become touched1 */ - else /* link it in 'grayagain' and paint it gray */ - linkobjgclist(o, g->grayagain); - if (isold(o)) /* generational mode? */ - setage(o, G_TOUCHED1); /* touched in current cycle */ -} - - -void luaC_fix (lua_State *L, GCObject *o) { - global_State *g = G(L); - lua_assert(g->allgc == o); /* object must be 1st in 'allgc' list! */ - set2gray(o); /* they will be gray forever */ - setage(o, G_OLD); /* and old forever */ - g->allgc = o->next; /* remove object from 'allgc' list */ - o->next = g->fixedgc; /* link it to 'fixedgc' list */ - g->fixedgc = o; -} - - -/* -** create a new collectable object (with given type and size) and link -** it to 'allgc' list. -*/ -GCObject *luaC_newobj (lua_State *L, int tt, size_t sz) { - global_State *g = G(L); - GCObject *o = cast(GCObject *, luaM_newobject(L, novariant(tt), sz)); - o->marked = luaC_white(g); - o->tt = tt; - o->next = g->allgc; - g->allgc = o; - return o; -} - -/* }====================================================== */ - - - -/* -** {====================================================== -** Mark functions -** ======================================================= -*/ - - -/* -** Mark an object. Userdata with no user values, strings, and closed -** upvalues are visited and turned black here. Open upvalues are -** already indirectly linked through their respective threads in the -** 'twups' list, so they don't go to the gray list; nevertheless, they -** are kept gray to avoid barriers, as their values will be revisited -** by the thread or by 'remarkupvals'. Other objects are added to the -** gray list to be visited (and turned black) later. Both userdata and -** upvalues can call this function recursively, but this recursion goes -** for at most two levels: An upvalue cannot refer to another upvalue -** (only closures can), and a userdata's metatable must be a table. -*/ -static void reallymarkobject (global_State *g, GCObject *o) { - switch (o->tt) { - case LUA_VSHRSTR: - case LUA_VLNGSTR: { - set2black(o); /* nothing to visit */ - break; - } - case LUA_VUPVAL: { - UpVal *uv = gco2upv(o); - if (upisopen(uv)) - set2gray(uv); /* open upvalues are kept gray */ - else - set2black(uv); /* closed upvalues are visited here */ - markvalue(g, uv->v); /* mark its content */ - break; - } - case LUA_VUSERDATA: { - Udata *u = gco2u(o); - if (u->nuvalue == 0) { /* no user values? */ - markobjectN(g, u->metatable); /* mark its metatable */ - set2black(u); /* nothing else to mark */ - break; - } - /* else... */ - } /* FALLTHROUGH */ - case LUA_VLCL: case LUA_VCCL: case LUA_VTABLE: - case LUA_VTHREAD: case LUA_VPROTO: { - linkobjgclist(o, g->gray); /* to be visited later */ - break; - } - default: lua_assert(0); break; - } -} - - -/* -** mark metamethods for basic types -*/ -static void markmt (global_State *g) { - int i; - for (i=0; i < LUA_NUMTAGS; i++) - markobjectN(g, g->mt[i]); -} - - -/* -** mark all objects in list of being-finalized -*/ -static lu_mem markbeingfnz (global_State *g) { - GCObject *o; - lu_mem count = 0; - for (o = g->tobefnz; o != NULL; o = o->next) { - count++; - markobject(g, o); - } - return count; -} - - -/* -** For each non-marked thread, simulates a barrier between each open -** upvalue and its value. (If the thread is collected, the value will be -** assigned to the upvalue, but then it can be too late for the barrier -** to act. The "barrier" does not need to check colors: A non-marked -** thread must be young; upvalues cannot be older than their threads; so -** any visited upvalue must be young too.) Also removes the thread from -** the list, as it was already visited. Removes also threads with no -** upvalues, as they have nothing to be checked. (If the thread gets an -** upvalue later, it will be linked in the list again.) -*/ -static int remarkupvals (global_State *g) { - lua_State *thread; - lua_State **p = &g->twups; - int work = 0; /* estimate of how much work was done here */ - while ((thread = *p) != NULL) { - work++; - if (!iswhite(thread) && thread->openupval != NULL) - p = &thread->twups; /* keep marked thread with upvalues in the list */ - else { /* thread is not marked or without upvalues */ - UpVal *uv; - lua_assert(!isold(thread) || thread->openupval == NULL); - *p = thread->twups; /* remove thread from the list */ - thread->twups = thread; /* mark that it is out of list */ - for (uv = thread->openupval; uv != NULL; uv = uv->u.open.next) { - lua_assert(getage(uv) <= getage(thread)); - work++; - if (!iswhite(uv)) { /* upvalue already visited? */ - lua_assert(upisopen(uv) && isgray(uv)); - markvalue(g, uv->v); /* mark its value */ - } - } - } - } - return work; -} - - -static void cleargraylists (global_State *g) { - g->gray = g->grayagain = NULL; - g->weak = g->allweak = g->ephemeron = NULL; -} - - -/* -** mark root set and reset all gray lists, to start a new collection -*/ -static void restartcollection (global_State *g) { - cleargraylists(g); - markobject(g, g->mainthread); - markvalue(g, &g->l_registry); - markmt(g); - markbeingfnz(g); /* mark any finalizing object left from previous cycle */ -} - -/* }====================================================== */ - - -/* -** {====================================================== -** Traverse functions -** ======================================================= -*/ - - -/* -** Check whether object 'o' should be kept in the 'grayagain' list for -** post-processing by 'correctgraylist'. (It could put all old objects -** in the list and leave all the work to 'correctgraylist', but it is -** more efficient to avoid adding elements that will be removed.) Only -** TOUCHED1 objects need to be in the list. TOUCHED2 doesn't need to go -** back to a gray list, but then it must become OLD. (That is what -** 'correctgraylist' does when it finds a TOUCHED2 object.) -*/ -static void genlink (global_State *g, GCObject *o) { - lua_assert(isblack(o)); - if (getage(o) == G_TOUCHED1) { /* touched in this cycle? */ - linkobjgclist(o, g->grayagain); /* link it back in 'grayagain' */ - } /* everything else do not need to be linked back */ - else if (getage(o) == G_TOUCHED2) - changeage(o, G_TOUCHED2, G_OLD); /* advance age */ -} - - -/* -** Traverse a table with weak values and link it to proper list. During -** propagate phase, keep it in 'grayagain' list, to be revisited in the -** atomic phase. In the atomic phase, if table has any white value, -** put it in 'weak' list, to be cleared. -*/ -static void traverseweakvalue (global_State *g, Table *h) { - Node *n, *limit = gnodelast(h); - /* if there is array part, assume it may have white values (it is not - worth traversing it now just to check) */ - int hasclears = (h->alimit > 0); - for (n = gnode(h, 0); n < limit; n++) { /* traverse hash part */ - if (isempty(gval(n))) /* entry is empty? */ - clearkey(n); /* clear its key */ - else { - lua_assert(!keyisnil(n)); - markkey(g, n); - if (!hasclears && iscleared(g, gcvalueN(gval(n)))) /* a white value? */ - hasclears = 1; /* table will have to be cleared */ - } - } - if (g->gcstate == GCSatomic && hasclears) - linkgclist(h, g->weak); /* has to be cleared later */ - else - linkgclist(h, g->grayagain); /* must retraverse it in atomic phase */ -} - - -/* -** Traverse an ephemeron table and link it to proper list. Returns true -** iff any object was marked during this traversal (which implies that -** convergence has to continue). During propagation phase, keep table -** in 'grayagain' list, to be visited again in the atomic phase. In -** the atomic phase, if table has any white->white entry, it has to -** be revisited during ephemeron convergence (as that key may turn -** black). Otherwise, if it has any white key, table has to be cleared -** (in the atomic phase). In generational mode, some tables -** must be kept in some gray list for post-processing; this is done -** by 'genlink'. -*/ -static int traverseephemeron (global_State *g, Table *h, int inv) { - int marked = 0; /* true if an object is marked in this traversal */ - int hasclears = 0; /* true if table has white keys */ - int hasww = 0; /* true if table has entry "white-key -> white-value" */ - unsigned int i; - unsigned int asize = luaH_realasize(h); - unsigned int nsize = sizenode(h); - /* traverse array part */ - for (i = 0; i < asize; i++) { - if (valiswhite(&h->array[i])) { - marked = 1; - reallymarkobject(g, gcvalue(&h->array[i])); - } - } - /* traverse hash part; if 'inv', traverse descending - (see 'convergeephemerons') */ - for (i = 0; i < nsize; i++) { - Node *n = inv ? gnode(h, nsize - 1 - i) : gnode(h, i); - if (isempty(gval(n))) /* entry is empty? */ - clearkey(n); /* clear its key */ - else if (iscleared(g, gckeyN(n))) { /* key is not marked (yet)? */ - hasclears = 1; /* table must be cleared */ - if (valiswhite(gval(n))) /* value not marked yet? */ - hasww = 1; /* white-white entry */ - } - else if (valiswhite(gval(n))) { /* value not marked yet? */ - marked = 1; - reallymarkobject(g, gcvalue(gval(n))); /* mark it now */ - } - } - /* link table into proper list */ - if (g->gcstate == GCSpropagate) - linkgclist(h, g->grayagain); /* must retraverse it in atomic phase */ - else if (hasww) /* table has white->white entries? */ - linkgclist(h, g->ephemeron); /* have to propagate again */ - else if (hasclears) /* table has white keys? */ - linkgclist(h, g->allweak); /* may have to clean white keys */ - else - genlink(g, obj2gco(h)); /* check whether collector still needs to see it */ - return marked; -} - - -static void traversestrongtable (global_State *g, Table *h) { - Node *n, *limit = gnodelast(h); - unsigned int i; - unsigned int asize = luaH_realasize(h); - for (i = 0; i < asize; i++) /* traverse array part */ - markvalue(g, &h->array[i]); - for (n = gnode(h, 0); n < limit; n++) { /* traverse hash part */ - if (isempty(gval(n))) /* entry is empty? */ - clearkey(n); /* clear its key */ - else { - lua_assert(!keyisnil(n)); - markkey(g, n); - markvalue(g, gval(n)); - } - } - genlink(g, obj2gco(h)); -} - - -static lu_mem traversetable (global_State *g, Table *h) { - const char *weakkey, *weakvalue; - const TValue *mode = gfasttm(g, h->metatable, TM_MODE); - markobjectN(g, h->metatable); - if (mode && ttisstring(mode) && /* is there a weak mode? */ - (cast_void(weakkey = strchr(svalue(mode), 'k')), - cast_void(weakvalue = strchr(svalue(mode), 'v')), - (weakkey || weakvalue))) { /* is really weak? */ - if (!weakkey) /* strong keys? */ - traverseweakvalue(g, h); - else if (!weakvalue) /* strong values? */ - traverseephemeron(g, h, 0); - else /* all weak */ - linkgclist(h, g->allweak); /* nothing to traverse now */ - } - else /* not weak */ - traversestrongtable(g, h); - return 1 + h->alimit + 2 * allocsizenode(h); -} - - -static int traverseudata (global_State *g, Udata *u) { - int i; - markobjectN(g, u->metatable); /* mark its metatable */ - for (i = 0; i < u->nuvalue; i++) - markvalue(g, &u->uv[i].uv); - genlink(g, obj2gco(u)); - return 1 + u->nuvalue; -} - - -/* -** Traverse a prototype. (While a prototype is being build, its -** arrays can be larger than needed; the extra slots are filled with -** NULL, so the use of 'markobjectN') -*/ -static int traverseproto (global_State *g, Proto *f) { - int i; - markobjectN(g, f->source); - for (i = 0; i < f->sizek; i++) /* mark literals */ - markvalue(g, &f->k[i]); - for (i = 0; i < f->sizeupvalues; i++) /* mark upvalue names */ - markobjectN(g, f->upvalues[i].name); - for (i = 0; i < f->sizep; i++) /* mark nested protos */ - markobjectN(g, f->p[i]); - for (i = 0; i < f->sizelocvars; i++) /* mark local-variable names */ - markobjectN(g, f->locvars[i].varname); - return 1 + f->sizek + f->sizeupvalues + f->sizep + f->sizelocvars; -} - - -static int traverseCclosure (global_State *g, CClosure *cl) { - int i; - for (i = 0; i < cl->nupvalues; i++) /* mark its upvalues */ - markvalue(g, &cl->upvalue[i]); - return 1 + cl->nupvalues; -} - -/* -** Traverse a Lua closure, marking its prototype and its upvalues. -** (Both can be NULL while closure is being created.) -*/ -static int traverseLclosure (global_State *g, LClosure *cl) { - int i; - markobjectN(g, cl->p); /* mark its prototype */ - for (i = 0; i < cl->nupvalues; i++) { /* visit its upvalues */ - UpVal *uv = cl->upvals[i]; - markobjectN(g, uv); /* mark upvalue */ - } - return 1 + cl->nupvalues; -} - - -/* -** Traverse a thread, marking the elements in the stack up to its top -** and cleaning the rest of the stack in the final traversal. That -** ensures that the entire stack have valid (non-dead) objects. -** Threads have no barriers. In gen. mode, old threads must be visited -** at every cycle, because they might point to young objects. In inc. -** mode, the thread can still be modified before the end of the cycle, -** and therefore it must be visited again in the atomic phase. To ensure -** these visits, threads must return to a gray list if they are not new -** (which can only happen in generational mode) or if the traverse is in -** the propagate phase (which can only happen in incremental mode). -*/ -static int traversethread (global_State *g, lua_State *th) { - UpVal *uv; - StkId o = th->stack; - if (isold(th) || g->gcstate == GCSpropagate) - linkgclist(th, g->grayagain); /* insert into 'grayagain' list */ - if (o == NULL) - return 1; /* stack not completely built yet */ - lua_assert(g->gcstate == GCSatomic || - th->openupval == NULL || isintwups(th)); - for (; o < th->top; o++) /* mark live elements in the stack */ - markvalue(g, s2v(o)); - for (uv = th->openupval; uv != NULL; uv = uv->u.open.next) - markobject(g, uv); /* open upvalues cannot be collected */ - if (g->gcstate == GCSatomic) { /* final traversal? */ - for (; o < th->stack_last + EXTRA_STACK; o++) - setnilvalue(s2v(o)); /* clear dead stack slice */ - /* 'remarkupvals' may have removed thread from 'twups' list */ - if (!isintwups(th) && th->openupval != NULL) { - th->twups = g->twups; /* link it back to the list */ - g->twups = th; - } - } - else if (!g->gcemergency) - luaD_shrinkstack(th); /* do not change stack in emergency cycle */ - return 1 + stacksize(th); -} - - -/* -** traverse one gray object, turning it to black. -*/ -static lu_mem propagatemark (global_State *g) { - GCObject *o = g->gray; - nw2black(o); - g->gray = *getgclist(o); /* remove from 'gray' list */ - switch (o->tt) { - case LUA_VTABLE: return traversetable(g, gco2t(o)); - case LUA_VUSERDATA: return traverseudata(g, gco2u(o)); - case LUA_VLCL: return traverseLclosure(g, gco2lcl(o)); - case LUA_VCCL: return traverseCclosure(g, gco2ccl(o)); - case LUA_VPROTO: return traverseproto(g, gco2p(o)); - case LUA_VTHREAD: return traversethread(g, gco2th(o)); - default: lua_assert(0); return 0; - } -} - - -static lu_mem propagateall (global_State *g) { - lu_mem tot = 0; - while (g->gray) - tot += propagatemark(g); - return tot; -} - - -/* -** Traverse all ephemeron tables propagating marks from keys to values. -** Repeat until it converges, that is, nothing new is marked. 'dir' -** inverts the direction of the traversals, trying to speed up -** convergence on chains in the same table. -** -*/ -static void convergeephemerons (global_State *g) { - int changed; - int dir = 0; - do { - GCObject *w; - GCObject *next = g->ephemeron; /* get ephemeron list */ - g->ephemeron = NULL; /* tables may return to this list when traversed */ - changed = 0; - while ((w = next) != NULL) { /* for each ephemeron table */ - Table *h = gco2t(w); - next = h->gclist; /* list is rebuilt during loop */ - nw2black(h); /* out of the list (for now) */ - if (traverseephemeron(g, h, dir)) { /* marked some value? */ - propagateall(g); /* propagate changes */ - changed = 1; /* will have to revisit all ephemeron tables */ - } - } - dir = !dir; /* invert direction next time */ - } while (changed); /* repeat until no more changes */ -} - -/* }====================================================== */ - - -/* -** {====================================================== -** Sweep Functions -** ======================================================= -*/ - - -/* -** clear entries with unmarked keys from all weaktables in list 'l' -*/ -static void clearbykeys (global_State *g, GCObject *l) { - for (; l; l = gco2t(l)->gclist) { - Table *h = gco2t(l); - Node *limit = gnodelast(h); - Node *n; - for (n = gnode(h, 0); n < limit; n++) { - if (iscleared(g, gckeyN(n))) /* unmarked key? */ - setempty(gval(n)); /* remove entry */ - if (isempty(gval(n))) /* is entry empty? */ - clearkey(n); /* clear its key */ - } - } -} - - -/* -** clear entries with unmarked values from all weaktables in list 'l' up -** to element 'f' -*/ -static void clearbyvalues (global_State *g, GCObject *l, GCObject *f) { - for (; l != f; l = gco2t(l)->gclist) { - Table *h = gco2t(l); - Node *n, *limit = gnodelast(h); - unsigned int i; - unsigned int asize = luaH_realasize(h); - for (i = 0; i < asize; i++) { - TValue *o = &h->array[i]; - if (iscleared(g, gcvalueN(o))) /* value was collected? */ - setempty(o); /* remove entry */ - } - for (n = gnode(h, 0); n < limit; n++) { - if (iscleared(g, gcvalueN(gval(n)))) /* unmarked value? */ - setempty(gval(n)); /* remove entry */ - if (isempty(gval(n))) /* is entry empty? */ - clearkey(n); /* clear its key */ - } - } -} - - -static void freeupval (lua_State *L, UpVal *uv) { - if (upisopen(uv)) - luaF_unlinkupval(uv); - luaM_free(L, uv); -} - - -static void freeobj (lua_State *L, GCObject *o) { - switch (o->tt) { - case LUA_VPROTO: - luaF_freeproto(L, gco2p(o)); - break; - case LUA_VUPVAL: - freeupval(L, gco2upv(o)); - break; - case LUA_VLCL: { - LClosure *cl = gco2lcl(o); - luaM_freemem(L, cl, sizeLclosure(cl->nupvalues)); - break; - } - case LUA_VCCL: { - CClosure *cl = gco2ccl(o); - luaM_freemem(L, cl, sizeCclosure(cl->nupvalues)); - break; - } - case LUA_VTABLE: - luaH_free(L, gco2t(o)); - break; - case LUA_VTHREAD: - luaE_freethread(L, gco2th(o)); - break; - case LUA_VUSERDATA: { - Udata *u = gco2u(o); - luaM_freemem(L, o, sizeudata(u->nuvalue, u->len)); - break; - } - case LUA_VSHRSTR: { - TString *ts = gco2ts(o); - luaS_remove(L, ts); /* remove it from hash table */ - luaM_freemem(L, ts, sizelstring(ts->shrlen)); - break; - } - case LUA_VLNGSTR: { - TString *ts = gco2ts(o); - luaM_freemem(L, ts, sizelstring(ts->u.lnglen)); - break; - } - default: lua_assert(0); - } -} - - -/* -** sweep at most 'countin' elements from a list of GCObjects erasing dead -** objects, where a dead object is one marked with the old (non current) -** white; change all non-dead objects back to white, preparing for next -** collection cycle. Return where to continue the traversal or NULL if -** list is finished. ('*countout' gets the number of elements traversed.) -*/ -static GCObject **sweeplist (lua_State *L, GCObject **p, int countin, - int *countout) { - global_State *g = G(L); - int ow = otherwhite(g); - int i; - int white = luaC_white(g); /* current white */ - for (i = 0; *p != NULL && i < countin; i++) { - GCObject *curr = *p; - int marked = curr->marked; - if (isdeadm(ow, marked)) { /* is 'curr' dead? */ - *p = curr->next; /* remove 'curr' from list */ - freeobj(L, curr); /* erase 'curr' */ - } - else { /* change mark to 'white' */ - curr->marked = cast_byte((marked & ~maskgcbits) | white); - p = &curr->next; /* go to next element */ - } - } - if (countout) - *countout = i; /* number of elements traversed */ - return (*p == NULL) ? NULL : p; -} - - -/* -** sweep a list until a live object (or end of list) -*/ -static GCObject **sweeptolive (lua_State *L, GCObject **p) { - GCObject **old = p; - do { - p = sweeplist(L, p, 1, NULL); - } while (p == old); - return p; -} - -/* }====================================================== */ - - -/* -** {====================================================== -** Finalization -** ======================================================= -*/ - -/* -** If possible, shrink string table. -*/ -static void checkSizes (lua_State *L, global_State *g) { - if (!g->gcemergency) { - if (g->strt.nuse < g->strt.size / 4) { /* string table too big? */ - l_mem olddebt = g->GCdebt; - luaS_resize(L, g->strt.size / 2); - g->GCestimate += g->GCdebt - olddebt; /* correct estimate */ - } - } -} - - -/* -** Get the next udata to be finalized from the 'tobefnz' list, and -** link it back into the 'allgc' list. -*/ -static GCObject *udata2finalize (global_State *g) { - GCObject *o = g->tobefnz; /* get first element */ - lua_assert(tofinalize(o)); - g->tobefnz = o->next; /* remove it from 'tobefnz' list */ - o->next = g->allgc; /* return it to 'allgc' list */ - g->allgc = o; - resetbit(o->marked, FINALIZEDBIT); /* object is "normal" again */ - if (issweepphase(g)) - makewhite(g, o); /* "sweep" object */ - else if (getage(o) == G_OLD1) - g->firstold1 = o; /* it is the first OLD1 object in the list */ - return o; -} - - -static void dothecall (lua_State *L, void *ud) { - UNUSED(ud); - luaD_callnoyield(L, L->top - 2, 0); -} - - -static void GCTM (lua_State *L) { - global_State *g = G(L); - const TValue *tm; - TValue v; - lua_assert(!g->gcemergency); - setgcovalue(L, &v, udata2finalize(g)); - tm = luaT_gettmbyobj(L, &v, TM_GC); - if (!notm(tm)) { /* is there a finalizer? */ - int status; - lu_byte oldah = L->allowhook; - int oldgcstp = g->gcstp; - g->gcstp |= GCSTPGC; /* avoid GC steps */ - L->allowhook = 0; /* stop debug hooks during GC metamethod */ - setobj2s(L, L->top++, tm); /* push finalizer... */ - setobj2s(L, L->top++, &v); /* ... and its argument */ - L->ci->callstatus |= CIST_FIN; /* will run a finalizer */ - status = luaD_pcall(L, dothecall, NULL, savestack(L, L->top - 2), 0); - L->ci->callstatus &= ~CIST_FIN; /* not running a finalizer anymore */ - L->allowhook = oldah; /* restore hooks */ - g->gcstp = oldgcstp; /* restore state */ - if (l_unlikely(status != LUA_OK)) { /* error while running __gc? */ - luaE_warnerror(L, "__gc"); - L->top--; /* pops error object */ - } - } -} - - -/* -** Call a few finalizers -*/ -static int runafewfinalizers (lua_State *L, int n) { - global_State *g = G(L); - int i; - for (i = 0; i < n && g->tobefnz; i++) - GCTM(L); /* call one finalizer */ - return i; -} - - -/* -** call all pending finalizers -*/ -static void callallpendingfinalizers (lua_State *L) { - global_State *g = G(L); - while (g->tobefnz) - GCTM(L); -} - - -/* -** find last 'next' field in list 'p' list (to add elements in its end) -*/ -static GCObject **findlast (GCObject **p) { - while (*p != NULL) - p = &(*p)->next; - return p; -} - - -/* -** Move all unreachable objects (or 'all' objects) that need -** finalization from list 'finobj' to list 'tobefnz' (to be finalized). -** (Note that objects after 'finobjold1' cannot be white, so they -** don't need to be traversed. In incremental mode, 'finobjold1' is NULL, -** so the whole list is traversed.) -*/ -static void separatetobefnz (global_State *g, int all) { - GCObject *curr; - GCObject **p = &g->finobj; - GCObject **lastnext = findlast(&g->tobefnz); - while ((curr = *p) != g->finobjold1) { /* traverse all finalizable objects */ - lua_assert(tofinalize(curr)); - if (!(iswhite(curr) || all)) /* not being collected? */ - p = &curr->next; /* don't bother with it */ - else { - if (curr == g->finobjsur) /* removing 'finobjsur'? */ - g->finobjsur = curr->next; /* correct it */ - *p = curr->next; /* remove 'curr' from 'finobj' list */ - curr->next = *lastnext; /* link at the end of 'tobefnz' list */ - *lastnext = curr; - lastnext = &curr->next; - } - } -} - - -/* -** If pointer 'p' points to 'o', move it to the next element. -*/ -static void checkpointer (GCObject **p, GCObject *o) { - if (o == *p) - *p = o->next; -} - - -/* -** Correct pointers to objects inside 'allgc' list when -** object 'o' is being removed from the list. -*/ -static void correctpointers (global_State *g, GCObject *o) { - checkpointer(&g->survival, o); - checkpointer(&g->old1, o); - checkpointer(&g->reallyold, o); - checkpointer(&g->firstold1, o); -} - - -/* -** if object 'o' has a finalizer, remove it from 'allgc' list (must -** search the list to find it) and link it in 'finobj' list. -*/ -void luaC_checkfinalizer (lua_State *L, GCObject *o, Table *mt) { - global_State *g = G(L); - if (tofinalize(o) || /* obj. is already marked... */ - gfasttm(g, mt, TM_GC) == NULL || /* or has no finalizer... */ - (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 -** ======================================================= -*/ - -static void setpause (global_State *g); - - -/* -** Sweep a list of objects to enter generational mode. Deletes dead -** objects and turns the non dead to old. All non-dead threads---which -** are now old---must be in a gray list. Everything else is not in a -** gray list. Open upvalues are also kept gray. -*/ -static void sweep2old (lua_State *L, GCObject **p) { - GCObject *curr; - global_State *g = G(L); - while ((curr = *p) != NULL) { - if (iswhite(curr)) { /* is 'curr' dead? */ - lua_assert(isdead(g, curr)); - *p = curr->next; /* remove 'curr' from list */ - freeobj(L, curr); /* erase 'curr' */ - } - else { /* all surviving objects become old */ - setage(curr, G_OLD); - if (curr->tt == LUA_VTHREAD) { /* threads must be watched */ - lua_State *th = gco2th(curr); - linkgclist(th, g->grayagain); /* insert into 'grayagain' list */ - } - else if (curr->tt == LUA_VUPVAL && upisopen(gco2upv(curr))) - set2gray(curr); /* open upvalues are always gray */ - else /* everything else is black */ - nw2black(curr); - p = &curr->next; /* go to next element */ - } - } -} - - -/* -** Sweep for generational mode. Delete dead objects. (Because the -** collection is not incremental, there are no "new white" objects -** during the sweep. So, any white object must be dead.) For -** non-dead objects, advance their ages and clear the color of -** new objects. (Old objects keep their colors.) -** The ages of G_TOUCHED1 and G_TOUCHED2 objects cannot be advanced -** here, because these old-generation objects are usually not swept -** here. They will all be advanced in 'correctgraylist'. That function -** will also remove objects turned white here from any gray list. -*/ -static GCObject **sweepgen (lua_State *L, global_State *g, GCObject **p, - GCObject *limit, GCObject **pfirstold1) { - static const lu_byte nextage[] = { - G_SURVIVAL, /* from G_NEW */ - G_OLD1, /* from G_SURVIVAL */ - G_OLD1, /* from G_OLD0 */ - G_OLD, /* from G_OLD1 */ - G_OLD, /* from G_OLD (do not change) */ - G_TOUCHED1, /* from G_TOUCHED1 (do not change) */ - G_TOUCHED2 /* from G_TOUCHED2 (do not change) */ - }; - int white = luaC_white(g); - GCObject *curr; - while ((curr = *p) != limit) { - if (iswhite(curr)) { /* is 'curr' dead? */ - lua_assert(!isold(curr) && isdead(g, curr)); - *p = curr->next; /* remove 'curr' from list */ - freeobj(L, curr); /* erase 'curr' */ - } - else { /* correct mark and age */ - if (getage(curr) == G_NEW) { /* new objects go back to white */ - int marked = curr->marked & ~maskgcbits; /* erase GC bits */ - curr->marked = cast_byte(marked | G_SURVIVAL | white); - } - else { /* all other objects will be old, and so keep their color */ - setage(curr, nextage[getage(curr)]); - if (getage(curr) == G_OLD1 && *pfirstold1 == NULL) - *pfirstold1 = curr; /* first OLD1 object in the list */ - } - p = &curr->next; /* go to next element */ - } - } - return p; -} - - -/* -** Traverse a list making all its elements white and clearing their -** age. In incremental mode, all objects are 'new' all the time, -** except for fixed strings (which are always old). -*/ -static void whitelist (global_State *g, GCObject *p) { - int white = luaC_white(g); - for (; p != NULL; p = p->next) - p->marked = cast_byte((p->marked & ~maskgcbits) | white); -} - - -/* -** Correct a list of gray objects. Return pointer to where rest of the -** list should be linked. -** Because this correction is done after sweeping, young objects might -** be turned white and still be in the list. They are only removed. -** 'TOUCHED1' objects are advanced to 'TOUCHED2' and remain on the list; -** Non-white threads also remain on the list; 'TOUCHED2' objects become -** regular old; they and anything else are removed from the list. -*/ -static GCObject **correctgraylist (GCObject **p) { - GCObject *curr; - while ((curr = *p) != NULL) { - GCObject **next = getgclist(curr); - if (iswhite(curr)) - goto remove; /* remove all white objects */ - else if (getage(curr) == G_TOUCHED1) { /* touched in this cycle? */ - lua_assert(isgray(curr)); - nw2black(curr); /* make it black, for next barrier */ - changeage(curr, G_TOUCHED1, G_TOUCHED2); - goto remain; /* keep it in the list and go to next element */ - } - else if (curr->tt == LUA_VTHREAD) { - lua_assert(isgray(curr)); - goto remain; /* keep non-white threads on the list */ - } - else { /* everything else is removed */ - lua_assert(isold(curr)); /* young objects should be white here */ - if (getage(curr) == G_TOUCHED2) /* advance from TOUCHED2... */ - changeage(curr, G_TOUCHED2, G_OLD); /* ... to OLD */ - nw2black(curr); /* make object black (to be removed) */ - goto remove; - } - remove: *p = *next; continue; - remain: p = next; continue; - } - return p; -} - - -/* -** Correct all gray lists, coalescing them into 'grayagain'. -*/ -static void correctgraylists (global_State *g) { - GCObject **list = correctgraylist(&g->grayagain); - *list = g->weak; g->weak = NULL; - list = correctgraylist(list); - *list = g->allweak; g->allweak = NULL; - list = correctgraylist(list); - *list = g->ephemeron; g->ephemeron = NULL; - correctgraylist(list); -} - - -/* -** Mark black 'OLD1' objects when starting a new young collection. -** Gray objects are already in some gray list, and so will be visited -** in the atomic step. -*/ -static void markold (global_State *g, GCObject *from, GCObject *to) { - GCObject *p; - for (p = from; p != to; p = p->next) { - if (getage(p) == G_OLD1) { - lua_assert(!iswhite(p)); - changeage(p, G_OLD1, G_OLD); /* now they are old */ - if (isblack(p)) - reallymarkobject(g, p); - } - } -} - - -/* -** Finish a young-generation collection. -*/ -static void finishgencycle (lua_State *L, global_State *g) { - correctgraylists(g); - checkSizes(L, g); - g->gcstate = GCSpropagate; /* skip restart */ - if (!g->gcemergency) - callallpendingfinalizers(L); -} - - -/* -** Does a young collection. First, mark 'OLD1' objects. Then does the -** atomic step. Then, sweep all lists and advance pointers. Finally, -** finish the collection. -*/ -static void youngcollection (lua_State *L, global_State *g) { - GCObject **psurvival; /* to point to first non-dead survival object */ - GCObject *dummy; /* dummy out parameter to 'sweepgen' */ - lua_assert(g->gcstate == GCSpropagate); - if (g->firstold1) { /* are there regular OLD1 objects? */ - markold(g, g->firstold1, g->reallyold); /* mark them */ - g->firstold1 = NULL; /* no more OLD1 objects (for now) */ - } - markold(g, g->finobj, g->finobjrold); - markold(g, g->tobefnz, NULL); - atomic(L); - - /* sweep nursery and get a pointer to its last live element */ - g->gcstate = GCSswpallgc; - psurvival = sweepgen(L, g, &g->allgc, g->survival, &g->firstold1); - /* sweep 'survival' */ - sweepgen(L, g, psurvival, g->old1, &g->firstold1); - g->reallyold = g->old1; - g->old1 = *psurvival; /* 'survival' survivals are old now */ - g->survival = g->allgc; /* all news are survivals */ - - /* repeat for 'finobj' lists */ - dummy = NULL; /* no 'firstold1' optimization for 'finobj' lists */ - psurvival = sweepgen(L, g, &g->finobj, g->finobjsur, &dummy); - /* sweep 'survival' */ - sweepgen(L, g, psurvival, g->finobjold1, &dummy); - g->finobjrold = g->finobjold1; - g->finobjold1 = *psurvival; /* 'survival' survivals are old now */ - g->finobjsur = g->finobj; /* all news are survivals */ - - sweepgen(L, g, &g->tobefnz, NULL, &dummy); - finishgencycle(L, g); -} - - -/* -** Clears all gray lists, sweeps objects, and prepare sublists to enter -** generational mode. The sweeps remove dead objects and turn all -** surviving objects to old. Threads go back to 'grayagain'; everything -** else is turned black (not in any gray list). -*/ -static void atomic2gen (lua_State *L, global_State *g) { - cleargraylists(g); - /* sweep all elements making them old */ - g->gcstate = GCSswpallgc; - sweep2old(L, &g->allgc); - /* everything alive now is old */ - g->reallyold = g->old1 = g->survival = g->allgc; - g->firstold1 = NULL; /* there are no OLD1 objects anywhere */ - - /* repeat for 'finobj' lists */ - sweep2old(L, &g->finobj); - g->finobjrold = g->finobjold1 = g->finobjsur = g->finobj; - - sweep2old(L, &g->tobefnz); - - g->gckind = KGC_GEN; - g->lastatomic = 0; - g->GCestimate = gettotalbytes(g); /* base for memory control */ - finishgencycle(L, g); -} - - -/* -** Enter generational mode. Must go until the end of an atomic cycle -** to ensure that all objects are correctly marked and weak tables -** are cleared. Then, turn all objects into old and finishes the -** collection. -*/ -static lu_mem entergen (lua_State *L, global_State *g) { - lu_mem numobjs; - luaC_runtilstate(L, bitmask(GCSpause)); /* prepare to start a new cycle */ - luaC_runtilstate(L, bitmask(GCSpropagate)); /* start new cycle */ - numobjs = atomic(L); /* propagates all and then do the atomic stuff */ - atomic2gen(L, g); - return numobjs; -} - - -/* -** Enter incremental mode. Turn all objects white, make all -** intermediate lists point to NULL (to avoid invalid pointers), -** and go to the pause state. -*/ -static void enterinc (global_State *g) { - whitelist(g, g->allgc); - g->reallyold = g->old1 = g->survival = NULL; - whitelist(g, g->finobj); - whitelist(g, g->tobefnz); - g->finobjrold = g->finobjold1 = g->finobjsur = NULL; - g->gcstate = GCSpause; - g->gckind = KGC_INC; - g->lastatomic = 0; -} - - -/* -** Change collector mode to 'newmode'. -*/ -void luaC_changemode (lua_State *L, int newmode) { - global_State *g = G(L); - if (newmode != g->gckind) { - if (newmode == KGC_GEN) /* entering generational mode? */ - entergen(L, g); - else - enterinc(g); /* entering incremental mode */ - } - g->lastatomic = 0; -} - - -/* -** Does a full collection in generational mode. -*/ -static lu_mem fullgen (lua_State *L, global_State *g) { - enterinc(g); - return entergen(L, g); -} - - -/* -** Set debt for the next minor collection, which will happen when -** memory grows 'genminormul'%. -*/ -static void setminordebt (global_State *g) { - luaE_setdebt(g, -(cast(l_mem, (gettotalbytes(g) / 100)) * g->genminormul)); -} - - -/* -** Does a major collection after last collection was a "bad collection". -** -** When the program is building a big structure, it allocates lots of -** memory but generates very little garbage. In those scenarios, -** the generational mode just wastes time doing small collections, and -** major collections are frequently what we call a "bad collection", a -** collection that frees too few objects. To avoid the cost of switching -** between generational mode and the incremental mode needed for full -** (major) collections, the collector tries to stay in incremental mode -** after a bad collection, and to switch back to generational mode only -** after a "good" collection (one that traverses less than 9/8 objects -** of the previous one). -** The collector must choose whether to stay in incremental mode or to -** switch back to generational mode before sweeping. At this point, it -** does not know the real memory in use, so it cannot use memory to -** decide whether to return to generational mode. Instead, it uses the -** number of objects traversed (returned by 'atomic') as a proxy. The -** field 'g->lastatomic' keeps this count from the last collection. -** ('g->lastatomic != 0' also means that the last collection was bad.) -*/ -static void stepgenfull (lua_State *L, global_State *g) { - lu_mem newatomic; /* count of traversed objects */ - lu_mem lastatomic = g->lastatomic; /* count from last collection */ - if (g->gckind == KGC_GEN) /* still in generational mode? */ - enterinc(g); /* enter incremental mode */ - luaC_runtilstate(L, bitmask(GCSpropagate)); /* start new cycle */ - newatomic = atomic(L); /* mark everybody */ - if (newatomic < lastatomic + (lastatomic >> 3)) { /* good collection? */ - atomic2gen(L, g); /* return to generational mode */ - setminordebt(g); - } - else { /* another bad collection; stay in incremental mode */ - g->GCestimate = gettotalbytes(g); /* first estimate */; - entersweep(L); - luaC_runtilstate(L, bitmask(GCSpause)); /* finish collection */ - setpause(g); - g->lastatomic = newatomic; - } -} - - -/* -** Does a generational "step". -** Usually, this means doing a minor collection and setting the debt to -** make another collection when memory grows 'genminormul'% larger. -** -** However, there are exceptions. If memory grows 'genmajormul'% -** larger than it was at the end of the last major collection (kept -** in 'g->GCestimate'), the function does a major collection. At the -** end, it checks whether the major collection was able to free a -** decent amount of memory (at least half the growth in memory since -** previous major collection). If so, the collector keeps its state, -** and the next collection will probably be minor again. Otherwise, -** we have what we call a "bad collection". In that case, set the field -** 'g->lastatomic' to signal that fact, so that the next collection will -** go to 'stepgenfull'. -** -** 'GCdebt <= 0' means an explicit call to GC step with "size" zero; -** in that case, do a minor collection. -*/ -static void genstep (lua_State *L, global_State *g) { - if (g->lastatomic != 0) /* last collection was a bad one? */ - stepgenfull(L, g); /* do a full step */ - else { - lu_mem majorbase = g->GCestimate; /* memory after last major collection */ - lu_mem majorinc = (majorbase / 100) * getgcparam(g->genmajormul); - if (g->GCdebt > 0 && gettotalbytes(g) > majorbase + majorinc) { - lu_mem numobjs = fullgen(L, g); /* do a major collection */ - if (gettotalbytes(g) < majorbase + (majorinc / 2)) { - /* collected at least half of memory growth since last major - collection; keep doing minor collections */ - setminordebt(g); - } - else { /* bad collection */ - g->lastatomic = numobjs; /* signal that last collection was bad */ - setpause(g); /* do a long wait for next (major) collection */ - } - } - else { /* regular case; do a minor collection */ - youngcollection(L, g); - setminordebt(g); - g->GCestimate = majorbase; /* preserve base value */ - } - } - lua_assert(isdecGCmodegen(g)); -} - -/* }====================================================== */ - - -/* -** {====================================================== -** GC control -** ======================================================= -*/ - - -/* -** Set the "time" to wait before starting a new GC cycle; cycle will -** start when memory use hits the threshold of ('estimate' * pause / -** PAUSEADJ). (Division by 'estimate' should be OK: it cannot be zero, -** because Lua cannot even start with less than PAUSEADJ bytes). -*/ -static void setpause (global_State *g) { - l_mem threshold, debt; - int pause = getgcparam(g->gcpause); - l_mem estimate = g->GCestimate / PAUSEADJ; /* adjust 'estimate' */ - lua_assert(estimate > 0); - threshold = (pause < MAX_LMEM / estimate) /* overflow? */ - ? estimate * pause /* no overflow */ - : MAX_LMEM; /* overflow; truncate to maximum */ - debt = gettotalbytes(g) - threshold; - if (debt > 0) debt = 0; - luaE_setdebt(g, debt); -} - - -/* -** Enter first sweep phase. -** The call to 'sweeptolive' makes the pointer point to an object -** inside the list (instead of to the header), so that the real sweep do -** not need to skip objects created between "now" and the start of the -** real sweep. -*/ -static void entersweep (lua_State *L) { - global_State *g = G(L); - g->gcstate = GCSswpallgc; - lua_assert(g->sweepgc == NULL); - g->sweepgc = sweeptolive(L, &g->allgc); -} - - -/* -** Delete all objects in list 'p' until (but not including) object -** 'limit'. -*/ -static void deletelist (lua_State *L, GCObject *p, GCObject *limit) { - while (p != limit) { - GCObject *next = p->next; - freeobj(L, p); - p = next; - } -} - - -/* -** Call all finalizers of the objects in the given Lua state, and -** then free all objects, except for the main thread. -*/ -void luaC_freeallobjects (lua_State *L) { - global_State *g = G(L); - 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 -*/ -void luaC_step (lua_State *L) { - global_State *g = G(L); - lua_assert(!g->gcemergency); - if (gcrunning(g)) { /* running? */ - if(isdecGCmodegen(g)) - genstep(L, g); - else - incstep(L, g); - } -} - - -/* -** Perform a full collection in incremental mode. -** Before running the collection, check 'keepinvariant'; if it is true, -** there may be some objects marked as black, so the collector has -** to sweep all objects to turn them back to white (as white has not -** changed, nothing will be collected). -*/ -static void fullinc (lua_State *L, global_State *g) { - if (keepinvariant(g)) /* black objects? */ - entersweep(L); /* sweep everything to turn them back to white */ - /* finish any pending sweep phase to start a new cycle */ - luaC_runtilstate(L, bitmask(GCSpause)); - luaC_runtilstate(L, bitmask(GCScallfin)); /* run up to finalizers */ - /* estimate must be correct after a full GC cycle */ - lua_assert(g->GCestimate == gettotalbytes(g)); - luaC_runtilstate(L, bitmask(GCSpause)); /* finish collection */ - setpause(g); -} - - -/* -** Performs a full GC cycle; if 'isemergency', set a flag to avoid -** some operations which could change the interpreter state in some -** unexpected ways (running finalizers and shrinking some structures). -*/ -void luaC_fullgc (lua_State *L, int isemergency) { - global_State *g = G(L); - lua_assert(!g->gcemergency); - g->gcemergency = isemergency; /* set flag */ - if (g->gckind == KGC_INC) - fullinc(L, g); - else - fullgen(L, g); - g->gcemergency = 0; -} - -/* }====================================================== */ - - diff --git a/lua-5.4.4/src/lgc.h b/lua-5.4.4/src/lgc.h deleted file mode 100644 index 4a12563..0000000 --- a/lua-5.4.4/src/lgc.h +++ /dev/null @@ -1,199 +0,0 @@ -/* -** $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_barrier(L,p,v) ( \ - (iscollectable(v) && isblack(p) && iswhite(gcvalue(v))) ? \ - luaC_barrier_(L,obj2gco(p),gcvalue(v)) : cast_void(0)) - -#define luaC_barrierback(L,p,v) ( \ - (iscollectable(v) && isblack(p) && iswhite(gcvalue(v))) ? \ - luaC_barrierback_(L,p) : cast_void(0)) - -#define luaC_objbarrier(L,p,o) ( \ - (isblack(p) && iswhite(o)) ? \ - luaC_barrier_(L,obj2gco(p),obj2gco(o)) : cast_void(0)) - -LUAI_FUNC void luaC_fix (lua_State *L, GCObject *o); -LUAI_FUNC void luaC_freeallobjects (lua_State *L); -LUAI_FUNC void luaC_step (lua_State *L); -LUAI_FUNC void luaC_runtilstate (lua_State *L, int statesmask); -LUAI_FUNC void luaC_fullgc (lua_State *L, int isemergency); -LUAI_FUNC GCObject *luaC_newobj (lua_State *L, int tt, size_t sz); -LUAI_FUNC void luaC_barrier_ (lua_State *L, GCObject *o, GCObject *v); -LUAI_FUNC void luaC_barrierback_ (lua_State *L, GCObject *o); -LUAI_FUNC void luaC_checkfinalizer (lua_State *L, GCObject *o, Table *mt); -LUAI_FUNC void luaC_changemode (lua_State *L, int newmode); - - -#endif diff --git a/lua-5.4.4/src/linit.c b/lua-5.4.4/src/linit.c deleted file mode 100644 index 69808f8..0000000 --- a/lua-5.4.4/src/linit.c +++ /dev/null @@ -1,65 +0,0 @@ -/* -** $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.4/src/liolib.c b/lua-5.4.4/src/liolib.c deleted file mode 100644 index b08397d..0000000 --- a/lua-5.4.4/src/liolib.c +++ /dev/null @@ -1,828 +0,0 @@ -/* -** $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.4/src/ljumptab.h b/lua-5.4.4/src/ljumptab.h deleted file mode 100644 index 8306f25..0000000 --- a/lua-5.4.4/src/ljumptab.h +++ /dev/null @@ -1,112 +0,0 @@ -/* -** $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.4/src/llex.c b/lua-5.4.4/src/llex.c deleted file mode 100644 index e991517..0000000 --- a/lua-5.4.4/src/llex.c +++ /dev/null @@ -1,581 +0,0 @@ -/* -** $Id: llex.c $ -** Lexical Analyzer -** See Copyright Notice in lua.h -*/ - -#define llex_c -#define LUA_CORE - -#include "lprefix.h" - - -#include -#include - -#include "lua.h" - -#include "lctype.h" -#include "ldebug.h" -#include "ldo.h" -#include "lgc.h" -#include "llex.h" -#include "lobject.h" -#include "lparser.h" -#include "lstate.h" -#include "lstring.h" -#include "ltable.h" -#include "lzio.h" - - - -#define next(ls) (ls->current = zgetc(ls->z)) - - - -#define currIsNewline(ls) (ls->current == '\n' || ls->current == '\r') - - -/* ORDER RESERVED */ -static const char *const luaX_tokens [] = { - "and", "break", "do", "else", "elseif", - "end", "false", "for", "function", "goto", "if", - "in", "local", "nil", "not", "or", "repeat", - "return", "then", "true", "until", "while", - "//", "..", "...", "==", ">=", "<=", "~=", - "<<", ">>", "::", "", - "", "", "", "" -}; - - -#define save_and_next(ls) (save(ls, ls->current), next(ls)) - - -static l_noret lexerror (LexState *ls, const char *msg, int token); - - -static void save (LexState *ls, int c) { - Mbuffer *b = ls->buff; - if (luaZ_bufflen(b) + 1 > luaZ_sizebuffer(b)) { - size_t newsize; - if (luaZ_sizebuffer(b) >= MAX_SIZE/2) - lexerror(ls, "lexical element too long", 0); - newsize = luaZ_sizebuffer(b) * 2; - luaZ_resizebuffer(ls->L, b, newsize); - } - b->buffer[luaZ_bufflen(b)++] = cast_char(c); -} - - -void luaX_init (lua_State *L) { - int i; - TString *e = luaS_newliteral(L, LUA_ENV); /* create env name */ - luaC_fix(L, obj2gco(e)); /* never collect this name */ - for (i=0; iextra = cast_byte(i+1); /* reserved word */ - } -} - - -const char *luaX_token2str (LexState *ls, int token) { - if (token < FIRST_RESERVED) { /* single-byte symbols? */ - if (lisprint(token)) - return luaO_pushfstring(ls->L, "'%c'", token); - else /* control character */ - return luaO_pushfstring(ls->L, "'<\\%d>'", token); - } - else { - const char *s = luaX_tokens[token - FIRST_RESERVED]; - if (token < TK_EOS) /* fixed format (symbols and reserved words)? */ - return luaO_pushfstring(ls->L, "'%s'", s); - else /* names, strings, and numerals */ - return s; - } -} - - -static const char *txtToken (LexState *ls, int token) { - switch (token) { - case TK_NAME: case TK_STRING: - case TK_FLT: case TK_INT: - save(ls, '\0'); - return luaO_pushfstring(ls->L, "'%s'", luaZ_buffer(ls->buff)); - default: - return luaX_token2str(ls, token); - } -} - - -static l_noret lexerror (LexState *ls, const char *msg, int token) { - msg = luaG_addinfo(ls->L, msg, ls->source, ls->linenumber); - if (token) - luaO_pushfstring(ls->L, "%s near %s", msg, txtToken(ls, token)); - luaD_throw(ls->L, LUA_ERRSYNTAX); -} - - -l_noret luaX_syntaxerror (LexState *ls, const char *msg) { - lexerror(ls, msg, ls->t.token); -} - - -/* -** Creates a new string and anchors it in scanner's table so that it -** will not be collected until the end of the compilation; by that time -** it should be anchored somewhere. It also internalizes long strings, -** ensuring there is only one copy of each unique string. The table -** here is used as a set: the string enters as the key, while its value -** is irrelevant. We use the string itself as the value only because it -** is a TValue readly available. Later, the code generation can change -** this value. -*/ -TString *luaX_newstring (LexState *ls, const char *str, size_t l) { - lua_State *L = ls->L; - TString *ts = luaS_newlstr(L, str, l); /* create new string */ - const TValue *o = luaH_getstr(ls->h, ts); - if (!ttisnil(o)) /* string already present? */ - ts = keystrval(nodefromval(o)); /* get saved copy */ - else { /* not in use yet */ - TValue *stv = s2v(L->top++); /* reserve stack space for string */ - setsvalue(L, stv, ts); /* temporarily anchor the string */ - luaH_finishset(L, ls->h, stv, o, stv); /* t[string] = string */ - /* table is not a metatable, so it does not need to invalidate cache */ - luaC_checkGC(L); - L->top--; /* remove string from stack */ - } - return ts; -} - - -/* -** increment line number and skips newline sequence (any of -** \n, \r, \n\r, or \r\n) -*/ -static void inclinenumber (LexState *ls) { - int old = ls->current; - lua_assert(currIsNewline(ls)); - next(ls); /* skip '\n' or '\r' */ - if (currIsNewline(ls) && ls->current != old) - next(ls); /* skip '\n\r' or '\r\n' */ - if (++ls->linenumber >= MAX_INT) - lexerror(ls, "chunk has too many lines", 0); -} - - -void luaX_setinput (lua_State *L, LexState *ls, ZIO *z, TString *source, - int firstchar) { - ls->t.token = 0; - ls->L = L; - ls->current = firstchar; - ls->lookahead.token = TK_EOS; /* no look-ahead token */ - ls->z = z; - ls->fs = NULL; - ls->linenumber = 1; - ls->lastline = 1; - ls->source = source; - ls->envn = luaS_newliteral(L, LUA_ENV); /* get env name */ - luaZ_resizebuffer(ls->L, ls->buff, LUA_MINBUFFER); /* initialize buffer */ -} - - - -/* -** ======================================================= -** LEXICAL ANALYZER -** ======================================================= -*/ - - -static int check_next1 (LexState *ls, int c) { - if (ls->current == c) { - next(ls); - return 1; - } - else return 0; -} - - -/* -** Check whether current char is in set 'set' (with two chars) and -** saves it -*/ -static int check_next2 (LexState *ls, const char *set) { - lua_assert(set[2] == '\0'); - if (ls->current == set[0] || ls->current == set[1]) { - save_and_next(ls); - return 1; - } - else return 0; -} - - -/* LUA_NUMBER */ -/* -** This function is quite liberal in what it accepts, as 'luaO_str2num' -** will reject ill-formed numerals. Roughly, it accepts the following -** pattern: -** -** %d(%x|%.|([Ee][+-]?))* | 0[Xx](%x|%.|([Pp][+-]?))* -** -** The only tricky part is to accept [+-] only after a valid exponent -** mark, to avoid reading '3-4' or '0xe+1' as a single number. -** -** The caller might have already read an initial dot. -*/ -static int read_numeral (LexState *ls, SemInfo *seminfo) { - TValue obj; - const char *expo = "Ee"; - int first = ls->current; - lua_assert(lisdigit(ls->current)); - save_and_next(ls); - if (first == '0' && check_next2(ls, "xX")) /* hexadecimal? */ - expo = "Pp"; - for (;;) { - if (check_next2(ls, expo)) /* exponent mark? */ - check_next2(ls, "-+"); /* optional exponent sign */ - else if (lisxdigit(ls->current) || ls->current == '.') /* '%x|%.' */ - save_and_next(ls); - else break; - } - if (lislalpha(ls->current)) /* is numeral touching a letter? */ - save_and_next(ls); /* force an error */ - save(ls, '\0'); - if (luaO_str2num(luaZ_buffer(ls->buff), &obj) == 0) /* format error? */ - lexerror(ls, "malformed number", TK_FLT); - if (ttisinteger(&obj)) { - seminfo->i = ivalue(&obj); - return TK_INT; - } - else { - lua_assert(ttisfloat(&obj)); - seminfo->r = fltvalue(&obj); - return TK_FLT; - } -} - - -/* -** read a sequence '[=*[' or ']=*]', leaving the last bracket. If -** sequence is well formed, return its number of '='s + 2; otherwise, -** return 1 if it is a single bracket (no '='s and no 2nd bracket); -** otherwise (an unfinished '[==...') return 0. -*/ -static size_t skip_sep (LexState *ls) { - size_t count = 0; - int s = ls->current; - lua_assert(s == '[' || s == ']'); - save_and_next(ls); - while (ls->current == '=') { - save_and_next(ls); - count++; - } - return (ls->current == s) ? count + 2 - : (count == 0) ? 1 - : 0; -} - - -static void read_long_string (LexState *ls, SemInfo *seminfo, size_t sep) { - int line = ls->linenumber; /* initial line (for error message) */ - save_and_next(ls); /* skip 2nd '[' */ - if (currIsNewline(ls)) /* string starts with a newline? */ - inclinenumber(ls); /* skip it */ - for (;;) { - switch (ls->current) { - case EOZ: { /* error */ - const char *what = (seminfo ? "string" : "comment"); - const char *msg = luaO_pushfstring(ls->L, - "unfinished long %s (starting at line %d)", what, line); - lexerror(ls, msg, TK_EOS); - break; /* to avoid warnings */ - } - case ']': { - if (skip_sep(ls) == sep) { - save_and_next(ls); /* skip 2nd ']' */ - goto endloop; - } - break; - } - case '\n': case '\r': { - save(ls, '\n'); - inclinenumber(ls); - if (!seminfo) luaZ_resetbuffer(ls->buff); /* avoid wasting space */ - break; - } - default: { - if (seminfo) save_and_next(ls); - else next(ls); - } - } - } endloop: - if (seminfo) - seminfo->ts = luaX_newstring(ls, luaZ_buffer(ls->buff) + sep, - luaZ_bufflen(ls->buff) - 2 * sep); -} - - -static void esccheck (LexState *ls, int c, const char *msg) { - if (!c) { - if (ls->current != EOZ) - save_and_next(ls); /* add current to buffer for error message */ - lexerror(ls, msg, TK_STRING); - } -} - - -static int gethexa (LexState *ls) { - save_and_next(ls); - esccheck (ls, lisxdigit(ls->current), "hexadecimal digit expected"); - return luaO_hexavalue(ls->current); -} - - -static int readhexaesc (LexState *ls) { - int r = gethexa(ls); - r = (r << 4) + gethexa(ls); - luaZ_buffremove(ls->buff, 2); /* remove saved chars from buffer */ - return r; -} - - -static unsigned long readutf8esc (LexState *ls) { - unsigned long r; - int i = 4; /* chars to be removed: '\', 'u', '{', and first digit */ - save_and_next(ls); /* skip 'u' */ - esccheck(ls, ls->current == '{', "missing '{'"); - r = gethexa(ls); /* must have at least one digit */ - while (cast_void(save_and_next(ls)), lisxdigit(ls->current)) { - i++; - esccheck(ls, r <= (0x7FFFFFFFu >> 4), "UTF-8 value too large"); - r = (r << 4) + luaO_hexavalue(ls->current); - } - esccheck(ls, ls->current == '}', "missing '}'"); - next(ls); /* skip '}' */ - luaZ_buffremove(ls->buff, i); /* remove saved chars from buffer */ - return r; -} - - -static void utf8esc (LexState *ls) { - char buff[UTF8BUFFSZ]; - int n = luaO_utf8esc(buff, readutf8esc(ls)); - for (; n > 0; n--) /* add 'buff' to string */ - save(ls, buff[UTF8BUFFSZ - n]); -} - - -static int readdecesc (LexState *ls) { - int i; - int r = 0; /* result accumulator */ - for (i = 0; i < 3 && lisdigit(ls->current); i++) { /* read up to 3 digits */ - r = 10*r + ls->current - '0'; - save_and_next(ls); - } - esccheck(ls, r <= UCHAR_MAX, "decimal escape too large"); - luaZ_buffremove(ls->buff, i); /* remove read digits from buffer */ - return r; -} - - -static void read_string (LexState *ls, int del, SemInfo *seminfo) { - save_and_next(ls); /* keep delimiter (for error messages) */ - while (ls->current != del) { - switch (ls->current) { - case EOZ: - lexerror(ls, "unfinished string", TK_EOS); - break; /* to avoid warnings */ - case '\n': - case '\r': - lexerror(ls, "unfinished string", TK_STRING); - break; /* to avoid warnings */ - case '\\': { /* escape sequences */ - int c; /* final character to be saved */ - save_and_next(ls); /* keep '\\' for error messages */ - switch (ls->current) { - case 'a': c = '\a'; goto read_save; - case 'b': c = '\b'; goto read_save; - case 'f': c = '\f'; goto read_save; - case 'n': c = '\n'; goto read_save; - case 'r': c = '\r'; goto read_save; - case 't': c = '\t'; goto read_save; - case 'v': c = '\v'; goto read_save; - case 'x': c = readhexaesc(ls); goto read_save; - case 'u': utf8esc(ls); goto no_save; - case '\n': case '\r': - inclinenumber(ls); c = '\n'; goto only_save; - case '\\': case '\"': case '\'': - c = ls->current; goto read_save; - case EOZ: goto no_save; /* will raise an error next loop */ - case 'z': { /* zap following span of spaces */ - luaZ_buffremove(ls->buff, 1); /* remove '\\' */ - next(ls); /* skip the 'z' */ - while (lisspace(ls->current)) { - if (currIsNewline(ls)) inclinenumber(ls); - else next(ls); - } - goto no_save; - } - default: { - esccheck(ls, lisdigit(ls->current), "invalid escape sequence"); - c = readdecesc(ls); /* digital escape '\ddd' */ - goto only_save; - } - } - read_save: - next(ls); - /* go through */ - only_save: - luaZ_buffremove(ls->buff, 1); /* remove '\\' */ - save(ls, c); - /* go through */ - no_save: break; - } - default: - save_and_next(ls); - } - } - save_and_next(ls); /* skip delimiter */ - seminfo->ts = luaX_newstring(ls, luaZ_buffer(ls->buff) + 1, - luaZ_bufflen(ls->buff) - 2); -} - - -static int llex (LexState *ls, SemInfo *seminfo) { - luaZ_resetbuffer(ls->buff); - for (;;) { - switch (ls->current) { - case '\n': case '\r': { /* line breaks */ - inclinenumber(ls); - break; - } - case ' ': case '\f': case '\t': case '\v': { /* spaces */ - next(ls); - break; - } - case '-': { /* '-' or '--' (comment) */ - next(ls); - if (ls->current != '-') return '-'; - /* else is a comment */ - next(ls); - if (ls->current == '[') { /* long comment? */ - size_t sep = skip_sep(ls); - luaZ_resetbuffer(ls->buff); /* 'skip_sep' may dirty the buffer */ - if (sep >= 2) { - read_long_string(ls, NULL, sep); /* skip long comment */ - luaZ_resetbuffer(ls->buff); /* previous call may dirty the buff. */ - break; - } - } - /* else short comment */ - while (!currIsNewline(ls) && ls->current != EOZ) - next(ls); /* skip until end of line (or end of file) */ - break; - } - case '[': { /* long string or simply '[' */ - size_t sep = skip_sep(ls); - if (sep >= 2) { - read_long_string(ls, seminfo, sep); - return TK_STRING; - } - else if (sep == 0) /* '[=...' missing second bracket? */ - lexerror(ls, "invalid long string delimiter", TK_STRING); - return '['; - } - case '=': { - next(ls); - if (check_next1(ls, '=')) return TK_EQ; /* '==' */ - else return '='; - } - case '<': { - next(ls); - if (check_next1(ls, '=')) return TK_LE; /* '<=' */ - else if (check_next1(ls, '<')) return TK_SHL; /* '<<' */ - else return '<'; - } - case '>': { - next(ls); - if (check_next1(ls, '=')) return TK_GE; /* '>=' */ - else if (check_next1(ls, '>')) return TK_SHR; /* '>>' */ - else return '>'; - } - case '/': { - next(ls); - if (check_next1(ls, '/')) return TK_IDIV; /* '//' */ - else return '/'; - } - case '~': { - next(ls); - if (check_next1(ls, '=')) return TK_NE; /* '~=' */ - else return '~'; - } - case ':': { - next(ls); - if (check_next1(ls, ':')) return TK_DBCOLON; /* '::' */ - else return ':'; - } - case '"': case '\'': { /* short literal strings */ - read_string(ls, ls->current, seminfo); - return TK_STRING; - } - case '.': { /* '.', '..', '...', or number */ - save_and_next(ls); - if (check_next1(ls, '.')) { - if (check_next1(ls, '.')) - return TK_DOTS; /* '...' */ - else return TK_CONCAT; /* '..' */ - } - else if (!lisdigit(ls->current)) return '.'; - else return read_numeral(ls, seminfo); - } - case '0': case '1': case '2': case '3': case '4': - case '5': case '6': case '7': case '8': case '9': { - return read_numeral(ls, seminfo); - } - case EOZ: { - return TK_EOS; - } - default: { - if (lislalpha(ls->current)) { /* identifier or reserved word? */ - TString *ts; - do { - save_and_next(ls); - } while (lislalnum(ls->current)); - ts = luaX_newstring(ls, luaZ_buffer(ls->buff), - luaZ_bufflen(ls->buff)); - seminfo->ts = ts; - if (isreserved(ts)) /* reserved word? */ - return ts->extra - 1 + FIRST_RESERVED; - else { - return TK_NAME; - } - } - else { /* single-char tokens ('+', '*', '%', '{', '}', ...) */ - int c = ls->current; - next(ls); - return c; - } - } - } - } -} - - -void luaX_next (LexState *ls) { - ls->lastline = ls->linenumber; - if (ls->lookahead.token != TK_EOS) { /* is there a look-ahead token? */ - ls->t = ls->lookahead; /* use this one */ - ls->lookahead.token = TK_EOS; /* and discharge it */ - } - else - ls->t.token = llex(ls, &ls->t.seminfo); /* read next token */ -} - - -int luaX_lookahead (LexState *ls) { - lua_assert(ls->lookahead.token == TK_EOS); - ls->lookahead.token = llex(ls, &ls->lookahead.seminfo); - return ls->lookahead.token; -} - diff --git a/lua-5.4.4/src/llex.h b/lua-5.4.4/src/llex.h deleted file mode 100644 index 389d2f8..0000000 --- a/lua-5.4.4/src/llex.h +++ /dev/null @@ -1,91 +0,0 @@ -/* -** $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.4/src/llimits.h b/lua-5.4.4/src/llimits.h deleted file mode 100644 index 52a32f9..0000000 --- a/lua-5.4.4/src/llimits.h +++ /dev/null @@ -1,367 +0,0 @@ -/* -** $Id: llimits.h $ -** Limits, basic types, and some other 'installation-dependent' definitions -** See Copyright Notice in lua.h -*/ - -#ifndef llimits_h -#define llimits_h - - -#include -#include - - -#include "lua.h" - - -/* -** 'lu_mem' and 'l_mem' are unsigned/signed integers big enough to count -** the total memory used by Lua (in bytes). Usually, 'size_t' and -** 'ptrdiff_t' should work, but we use 'long' for 16-bit machines. -*/ -#if defined(LUAI_MEM) /* { external definitions? */ -typedef LUAI_UMEM lu_mem; -typedef LUAI_MEM l_mem; -#elif LUAI_IS32INT /* }{ */ -typedef size_t lu_mem; -typedef ptrdiff_t l_mem; -#else /* 16-bit ints */ /* }{ */ -typedef unsigned long lu_mem; -typedef long l_mem; -#endif /* } */ - - -/* chars used as small naturals (so that 'char' is reserved for characters) */ -typedef unsigned char lu_byte; -typedef signed char ls_byte; - - -/* maximum value for size_t */ -#define MAX_SIZET ((size_t)(~(size_t)0)) - -/* maximum size visible for Lua (must be representable in a lua_Integer) */ -#define MAX_SIZE (sizeof(size_t) < sizeof(lua_Integer) ? MAX_SIZET \ - : (size_t)(LUA_MAXINTEGER)) - - -#define MAX_LUMEM ((lu_mem)(~(lu_mem)0)) - -#define MAX_LMEM ((l_mem)(MAX_LUMEM >> 1)) - - -#define MAX_INT INT_MAX /* maximum value of an int */ - - -/* -** floor of the log2 of the maximum signed value for integral type 't'. -** (That is, maximum 'n' such that '2^n' fits in the given signed type.) -*/ -#define log2maxs(t) (sizeof(t) * 8 - 2) - - -/* -** test whether an unsigned value is a power of 2 (or zero) -*/ -#define ispow2(x) (((x) & ((x) - 1)) == 0) - - -/* number of chars of a literal string without the ending \0 */ -#define LL(x) (sizeof(x)/sizeof(char) - 1) - - -/* -** conversion of pointer to unsigned integer: -** this is for hashing only; there is no problem if the integer -** cannot hold the whole pointer value -*/ -#define point2uint(p) ((unsigned int)((size_t)(p) & UINT_MAX)) - - - -/* types of 'usual argument conversions' for lua_Number and lua_Integer */ -typedef LUAI_UACNUMBER l_uacNumber; -typedef LUAI_UACINT l_uacInt; - - -/* -** Internal assertions for in-house debugging -*/ -#if defined LUAI_ASSERT -#undef NDEBUG -#include -#define lua_assert(c) assert(c) -#endif - -#if defined(lua_assert) -#define check_exp(c,e) (lua_assert(c), (e)) -/* to avoid problems with conditions too long */ -#define lua_longassert(c) ((c) ? (void)0 : lua_assert(0)) -#else -#define lua_assert(c) ((void)0) -#define check_exp(c,e) (e) -#define lua_longassert(c) ((void)0) -#endif - -/* -** assertion for checking API calls -*/ -#if !defined(luai_apicheck) -#define luai_apicheck(l,e) ((void)l, lua_assert(e)) -#endif - -#define api_check(l,e,msg) luai_apicheck(l,(e) && msg) - - -/* macro to avoid warnings about unused variables */ -#if !defined(UNUSED) -#define UNUSED(x) ((void)(x)) -#endif - - -/* type casts (a macro highlights casts in the code) */ -#define cast(t, exp) ((t)(exp)) - -#define cast_void(i) cast(void, (i)) -#define cast_voidp(i) cast(void *, (i)) -#define cast_num(i) cast(lua_Number, (i)) -#define cast_int(i) cast(int, (i)) -#define cast_uint(i) cast(unsigned int, (i)) -#define cast_byte(i) cast(lu_byte, (i)) -#define cast_uchar(i) cast(unsigned char, (i)) -#define cast_char(i) cast(char, (i)) -#define cast_charp(i) cast(char *, (i)) -#define cast_sizet(i) cast(size_t, (i)) - - -/* cast a signed lua_Integer to lua_Unsigned */ -#if !defined(l_castS2U) -#define l_castS2U(i) ((lua_Unsigned)(i)) -#endif - -/* -** cast a lua_Unsigned to a signed lua_Integer; this cast is -** not strict ISO C, but two-complement architectures should -** work fine. -*/ -#if !defined(l_castU2S) -#define l_castU2S(i) ((lua_Integer)(i)) -#endif - - -/* -** non-return type -*/ -#if !defined(l_noret) - -#if defined(__GNUC__) -#define l_noret void __attribute__((noreturn)) -#elif defined(_MSC_VER) && _MSC_VER >= 1200 -#define l_noret void __declspec(noreturn) -#else -#define l_noret void -#endif - -#endif - - -/* -** 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.4/src/lmathlib.c b/lua-5.4.4/src/lmathlib.c deleted file mode 100644 index e0c61a1..0000000 --- a/lua-5.4.4/src/lmathlib.c +++ /dev/null @@ -1,764 +0,0 @@ -/* -** $Id: lmathlib.c $ -** Standard mathematical library -** See Copyright Notice in lua.h -*/ - -#define lmathlib_c -#define LUA_LIB - -#include "lprefix.h" - - -#include -#include -#include -#include -#include - -#include "lua.h" - -#include "lauxlib.h" -#include "lualib.h" - - -#undef PI -#define PI (l_mathop(3.141592653589793238462643383279502884)) - - -static int math_abs (lua_State *L) { - if (lua_isinteger(L, 1)) { - lua_Integer n = lua_tointeger(L, 1); - if (n < 0) n = (lua_Integer)(0u - (lua_Unsigned)n); - lua_pushinteger(L, n); - } - else - lua_pushnumber(L, l_mathop(fabs)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_sin (lua_State *L) { - lua_pushnumber(L, l_mathop(sin)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_cos (lua_State *L) { - lua_pushnumber(L, l_mathop(cos)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_tan (lua_State *L) { - lua_pushnumber(L, l_mathop(tan)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_asin (lua_State *L) { - lua_pushnumber(L, l_mathop(asin)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_acos (lua_State *L) { - lua_pushnumber(L, l_mathop(acos)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_atan (lua_State *L) { - lua_Number y = luaL_checknumber(L, 1); - lua_Number x = luaL_optnumber(L, 2, 1); - lua_pushnumber(L, l_mathop(atan2)(y, x)); - return 1; -} - - -static int math_toint (lua_State *L) { - int valid; - lua_Integer n = lua_tointegerx(L, 1, &valid); - if (l_likely(valid)) - lua_pushinteger(L, n); - else { - luaL_checkany(L, 1); - luaL_pushfail(L); /* value is not convertible to integer */ - } - return 1; -} - - -static void pushnumint (lua_State *L, lua_Number d) { - lua_Integer n; - if (lua_numbertointeger(d, &n)) /* does 'd' fit in an integer? */ - lua_pushinteger(L, n); /* result is integer */ - else - lua_pushnumber(L, d); /* result is float */ -} - - -static int math_floor (lua_State *L) { - if (lua_isinteger(L, 1)) - lua_settop(L, 1); /* integer is its own floor */ - else { - lua_Number d = l_mathop(floor)(luaL_checknumber(L, 1)); - pushnumint(L, d); - } - return 1; -} - - -static int math_ceil (lua_State *L) { - if (lua_isinteger(L, 1)) - lua_settop(L, 1); /* integer is its own ceil */ - else { - lua_Number d = l_mathop(ceil)(luaL_checknumber(L, 1)); - pushnumint(L, d); - } - return 1; -} - - -static int math_fmod (lua_State *L) { - if (lua_isinteger(L, 1) && lua_isinteger(L, 2)) { - lua_Integer d = lua_tointeger(L, 2); - if ((lua_Unsigned)d + 1u <= 1u) { /* special cases: -1 or 0 */ - luaL_argcheck(L, d != 0, 2, "zero"); - lua_pushinteger(L, 0); /* avoid overflow with 0x80000... / -1 */ - } - else - lua_pushinteger(L, lua_tointeger(L, 1) % d); - } - else - lua_pushnumber(L, l_mathop(fmod)(luaL_checknumber(L, 1), - luaL_checknumber(L, 2))); - return 1; -} - - -/* -** next function does not use 'modf', avoiding problems with 'double*' -** (which is not compatible with 'float*') when lua_Number is not -** 'double'. -*/ -static int math_modf (lua_State *L) { - if (lua_isinteger(L ,1)) { - lua_settop(L, 1); /* number is its own integer part */ - lua_pushnumber(L, 0); /* no fractional part */ - } - else { - lua_Number n = luaL_checknumber(L, 1); - /* integer part (rounds toward zero) */ - lua_Number ip = (n < 0) ? l_mathop(ceil)(n) : l_mathop(floor)(n); - pushnumint(L, ip); - /* fractional part (test needed for inf/-inf) */ - lua_pushnumber(L, (n == ip) ? l_mathop(0.0) : (n - ip)); - } - return 2; -} - - -static int math_sqrt (lua_State *L) { - lua_pushnumber(L, l_mathop(sqrt)(luaL_checknumber(L, 1))); - return 1; -} - - -static int math_ult (lua_State *L) { - lua_Integer a = luaL_checkinteger(L, 1); - lua_Integer b = luaL_checkinteger(L, 2); - lua_pushboolean(L, (lua_Unsigned)a < (lua_Unsigned)b); - return 1; -} - -static int math_log (lua_State *L) { - lua_Number x = luaL_checknumber(L, 1); - lua_Number res; - if (lua_isnoneornil(L, 2)) - res = l_mathop(log)(x); - else { - lua_Number base = luaL_checknumber(L, 2); -#if !defined(LUA_USE_C89) - if (base == l_mathop(2.0)) - res = l_mathop(log2)(x); - else -#endif - if (base == l_mathop(10.0)) - res = l_mathop(log10)(x); - else - res = l_mathop(log)(x)/l_mathop(log)(base); - } - lua_pushnumber(L, res); - return 1; -} - -static int math_exp (lua_State *L) { - lua_pushnumber(L, l_mathop(exp)(luaL_checknumber(L, 1))); - return 1; -} - -static int math_deg (lua_State *L) { - lua_pushnumber(L, luaL_checknumber(L, 1) * (l_mathop(180.0) / PI)); - return 1; -} - -static int math_rad (lua_State *L) { - lua_pushnumber(L, luaL_checknumber(L, 1) * (PI / l_mathop(180.0))); - return 1; -} - - -static int math_min (lua_State *L) { - int n = lua_gettop(L); /* number of arguments */ - int imin = 1; /* index of current minimum value */ - int i; - luaL_argcheck(L, n >= 1, 1, "value expected"); - for (i = 2; i <= n; i++) { - if (lua_compare(L, i, imin, LUA_OPLT)) - imin = i; - } - lua_pushvalue(L, imin); - return 1; -} - - -static int math_max (lua_State *L) { - int n = lua_gettop(L); /* number of arguments */ - int imax = 1; /* index of current maximum value */ - int i; - luaL_argcheck(L, n >= 1, 1, "value expected"); - for (i = 2; i <= n; i++) { - if (lua_compare(L, imax, i, LUA_OPLT)) - imax = i; - } - lua_pushvalue(L, imax); - return 1; -} - - -static int math_type (lua_State *L) { - if (lua_type(L, 1) == LUA_TNUMBER) - lua_pushstring(L, (lua_isinteger(L, 1)) ? "integer" : "float"); - else { - luaL_checkany(L, 1); - luaL_pushfail(L); - } - return 1; -} - - - -/* -** {================================================================== -** Pseudo-Random Number Generator based on 'xoshiro256**'. -** =================================================================== -*/ - -/* number of binary digits in the mantissa of a float */ -#define FIGS l_floatatt(MANT_DIG) - -#if FIGS > 64 -/* there are only 64 random bits; use them all */ -#undef FIGS -#define FIGS 64 -#endif - - -/* -** LUA_RAND32 forces the use of 32-bit integers in the implementation -** of the PRN generator (mainly for testing). -*/ -#if !defined(LUA_RAND32) && !defined(Rand64) - -/* try to find an integer type with at least 64 bits */ - -#if (ULONG_MAX >> 31 >> 31) >= 3 - -/* 'long' has at least 64 bits */ -#define Rand64 unsigned long - -#elif !defined(LUA_USE_C89) && defined(LLONG_MAX) - -/* there is a 'long long' type (which must have at least 64 bits) */ -#define Rand64 unsigned long long - -#elif (LUA_MAXUNSIGNED >> 31 >> 31) >= 3 - -/* 'lua_Integer' has at least 64 bits */ -#define Rand64 lua_Unsigned - -#endif - -#endif - - -#if defined(Rand64) /* { */ - -/* -** Standard implementation, using 64-bit integers. -** If 'Rand64' has more than 64 bits, the extra bits do not interfere -** with the 64 initial bits, except in a right shift. Moreover, the -** final result has to discard the extra bits. -*/ - -/* avoid using extra bits when needed */ -#define trim64(x) ((x) & 0xffffffffffffffffu) - - -/* rotate left 'x' by 'n' bits */ -static Rand64 rotl (Rand64 x, int n) { - return (x << n) | (trim64(x) >> (64 - n)); -} - -static Rand64 nextrand (Rand64 *state) { - Rand64 state0 = state[0]; - Rand64 state1 = state[1]; - Rand64 state2 = state[2] ^ state0; - Rand64 state3 = state[3] ^ state1; - Rand64 res = rotl(state1 * 5, 7) * 9; - state[0] = state0 ^ state3; - state[1] = state1 ^ state2; - state[2] = state2 ^ (state1 << 17); - state[3] = rotl(state3, 45); - return res; -} - - -/* must take care to not shift stuff by more than 63 slots */ - - -/* -** Convert bits from a random integer into a float in the -** interval [0,1), getting the higher FIG bits from the -** random unsigned integer and converting that to a float. -*/ - -/* must throw out the extra (64 - FIGS) bits */ -#define shift64_FIG (64 - FIGS) - -/* to scale to [0, 1), multiply by scaleFIG = 2^(-FIGS) */ -#define scaleFIG (l_mathop(0.5) / ((Rand64)1 << (FIGS - 1))) - -static lua_Number I2d (Rand64 x) { - return (lua_Number)(trim64(x) >> shift64_FIG) * scaleFIG; -} - -/* convert a 'Rand64' to a 'lua_Unsigned' */ -#define I2UInt(x) ((lua_Unsigned)trim64(x)) - -/* convert a 'lua_Unsigned' to a 'Rand64' */ -#define Int2I(x) ((Rand64)(x)) - - -#else /* no 'Rand64' }{ */ - -/* get an integer with at least 32 bits */ -#if LUAI_IS32INT -typedef unsigned int lu_int32; -#else -typedef unsigned long lu_int32; -#endif - - -/* -** Use two 32-bit integers to represent a 64-bit quantity. -*/ -typedef struct Rand64 { - lu_int32 h; /* higher half */ - lu_int32 l; /* lower half */ -} Rand64; - - -/* -** If 'lu_int32' has more than 32 bits, the extra bits do not interfere -** with the 32 initial bits, except in a right shift and comparisons. -** Moreover, the final result has to discard the extra bits. -*/ - -/* avoid using extra bits when needed */ -#define trim32(x) ((x) & 0xffffffffu) - - -/* -** basic operations on 'Rand64' values -*/ - -/* build a new Rand64 value */ -static Rand64 packI (lu_int32 h, lu_int32 l) { - Rand64 result; - result.h = h; - result.l = l; - return result; -} - -/* return i << n */ -static Rand64 Ishl (Rand64 i, int n) { - lua_assert(n > 0 && n < 32); - return packI((i.h << n) | (trim32(i.l) >> (32 - n)), i.l << n); -} - -/* i1 ^= i2 */ -static void Ixor (Rand64 *i1, Rand64 i2) { - i1->h ^= i2.h; - i1->l ^= i2.l; -} - -/* return i1 + i2 */ -static Rand64 Iadd (Rand64 i1, Rand64 i2) { - Rand64 result = packI(i1.h + i2.h, i1.l + i2.l); - if (trim32(result.l) < trim32(i1.l)) /* carry? */ - result.h++; - return result; -} - -/* return i * 5 */ -static Rand64 times5 (Rand64 i) { - return Iadd(Ishl(i, 2), i); /* i * 5 == (i << 2) + i */ -} - -/* return i * 9 */ -static Rand64 times9 (Rand64 i) { - return Iadd(Ishl(i, 3), i); /* i * 9 == (i << 3) + i */ -} - -/* return 'i' rotated left 'n' bits */ -static Rand64 rotl (Rand64 i, int n) { - lua_assert(n > 0 && n < 32); - return packI((i.h << n) | (trim32(i.l) >> (32 - n)), - (trim32(i.h) >> (32 - n)) | (i.l << n)); -} - -/* for offsets larger than 32, rotate right by 64 - offset */ -static Rand64 rotl1 (Rand64 i, int n) { - lua_assert(n > 32 && n < 64); - n = 64 - n; - return packI((trim32(i.h) >> n) | (i.l << (32 - n)), - (i.h << (32 - n)) | (trim32(i.l) >> n)); -} - -/* -** implementation of 'xoshiro256**' algorithm on 'Rand64' values -*/ -static Rand64 nextrand (Rand64 *state) { - Rand64 res = times9(rotl(times5(state[1]), 7)); - Rand64 t = Ishl(state[1], 17); - Ixor(&state[2], state[0]); - Ixor(&state[3], state[1]); - Ixor(&state[1], state[2]); - Ixor(&state[0], state[3]); - Ixor(&state[2], t); - state[3] = rotl1(state[3], 45); - return res; -} - - -/* -** Converts a 'Rand64' into a float. -*/ - -/* an unsigned 1 with proper type */ -#define UONE ((lu_int32)1) - - -#if FIGS <= 32 - -/* 2^(-FIGS) */ -#define scaleFIG (l_mathop(0.5) / (UONE << (FIGS - 1))) - -/* -** get up to 32 bits from higher half, shifting right to -** throw out the extra bits. -*/ -static lua_Number I2d (Rand64 x) { - lua_Number h = (lua_Number)(trim32(x.h) >> (32 - FIGS)); - return h * scaleFIG; -} - -#else /* 32 < FIGS <= 64 */ - -/* must take care to not shift stuff by more than 31 slots */ - -/* 2^(-FIGS) = 1.0 / 2^30 / 2^3 / 2^(FIGS-33) */ -#define scaleFIG \ - (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.4/src/lmem.c b/lua-5.4.4/src/lmem.c deleted file mode 100644 index 9029d58..0000000 --- a/lua-5.4.4/src/lmem.c +++ /dev/null @@ -1,201 +0,0 @@ -/* -** $Id: lmem.c $ -** Interface to Memory Manager -** See Copyright Notice in lua.h -*/ - -#define lmem_c -#define LUA_CORE - -#include "lprefix.h" - - -#include - -#include "lua.h" - -#include "ldebug.h" -#include "ldo.h" -#include "lgc.h" -#include "lmem.h" -#include "lobject.h" -#include "lstate.h" - - -#if defined(EMERGENCYGCTESTS) -/* -** First allocation will fail whenever not building initial state. -** (This fail will trigger 'tryagain' and a full GC cycle at every -** allocation.) -*/ -static void *firsttry (global_State *g, void *block, size_t os, size_t ns) { - if (completestate(g) && ns > 0) /* frees never fail */ - return NULL; /* fail */ - else /* normal allocation */ - return (*g->frealloc)(g->ud, block, os, ns); -} -#else -#define firsttry(g,block,os,ns) ((*g->frealloc)(g->ud, block, os, ns)) -#endif - - - - - -/* -** About the realloc function: -** void *frealloc (void *ud, void *ptr, size_t osize, size_t nsize); -** ('osize' is the old size, 'nsize' is the new size) -** -** - frealloc(ud, p, x, 0) frees the block 'p' and returns NULL. -** Particularly, frealloc(ud, NULL, 0, 0) does nothing, -** which is equivalent to free(NULL) in ISO C. -** -** - frealloc(ud, NULL, x, s) creates a new block of size 's' -** (no matter 'x'). Returns NULL if it cannot create the new block. -** -** - otherwise, frealloc(ud, b, x, y) reallocates the block 'b' from -** size 'x' to size 'y'. Returns NULL if it cannot reallocate the -** block to the new size. -*/ - - - - -/* -** {================================================================== -** Functions to allocate/deallocate arrays for the Parser -** =================================================================== -*/ - -/* -** Minimum size for arrays during parsing, to avoid overhead of -** reallocating to size 1, then 2, and then 4. All these arrays -** will be reallocated to exact sizes or erased when parsing ends. -*/ -#define MINSIZEARRAY 4 - - -void *luaM_growaux_ (lua_State *L, void *block, int nelems, int *psize, - int size_elems, int limit, const char *what) { - void *newblock; - int size = *psize; - if (nelems + 1 <= size) /* does one extra element still fit? */ - return block; /* nothing to be done */ - if (size >= limit / 2) { /* cannot double it? */ - if (l_unlikely(size >= limit)) /* cannot grow even a little? */ - luaG_runerror(L, "too many %s (limit is %d)", what, limit); - size = limit; /* still have at least one free place */ - } - else { - size *= 2; - if (size < MINSIZEARRAY) - size = MINSIZEARRAY; /* minimum size */ - } - lua_assert(nelems + 1 <= size && size <= limit); - /* 'limit' ensures that multiplication will not overflow */ - newblock = luaM_saferealloc_(L, block, cast_sizet(*psize) * size_elems, - cast_sizet(size) * size_elems); - *psize = size; /* update only when everything else is OK */ - return newblock; -} - - -/* -** In prototypes, the size of the array is also its number of -** elements (to save memory). So, if it cannot shrink an array -** to its number of elements, the only option is to raise an -** error. -*/ -void *luaM_shrinkvector_ (lua_State *L, void *block, int *size, - int final_n, int size_elem) { - void *newblock; - size_t oldsize = cast_sizet((*size) * size_elem); - size_t newsize = cast_sizet(final_n * size_elem); - lua_assert(newsize <= oldsize); - newblock = luaM_saferealloc_(L, block, oldsize, newsize); - *size = final_n; - return newblock; -} - -/* }================================================================== */ - - -l_noret luaM_toobig (lua_State *L) { - luaG_runerror(L, "memory allocation error: block too big"); -} - - -/* -** Free memory -*/ -void luaM_free_ (lua_State *L, void *block, size_t osize) { - global_State *g = G(L); - lua_assert((osize == 0) == (block == NULL)); - (*g->frealloc)(g->ud, block, osize, 0); - g->GCdebt -= osize; -} - - -/* -** In case of allocation fail, this function will do an emergency -** collection to free some memory and then try the allocation again. -** The GC should not be called while state is not fully built, as the -** collector is not yet fully initialized. Also, it should not be called -** when 'gcstopem' is true, because then the interpreter is in the -** middle of a collection step. -*/ -static void *tryagain (lua_State *L, void *block, - size_t osize, size_t nsize) { - global_State *g = G(L); - if (completestate(g) && !g->gcstopem) { - luaC_fullgc(L, 1); /* try to free some memory... */ - return (*g->frealloc)(g->ud, block, osize, nsize); /* try again */ - } - else return NULL; /* cannot free any memory without a full state */ -} - - -/* -** Generic allocation routine. -*/ -void *luaM_realloc_ (lua_State *L, void *block, size_t osize, size_t nsize) { - void *newblock; - global_State *g = G(L); - lua_assert((osize == 0) == (block == NULL)); - newblock = firsttry(g, block, osize, nsize); - if (l_unlikely(newblock == NULL && nsize > 0)) { - newblock = tryagain(L, block, osize, nsize); - if (newblock == NULL) /* still no memory? */ - return NULL; /* do not update 'GCdebt' */ - } - lua_assert((nsize == 0) == (newblock == NULL)); - g->GCdebt = (g->GCdebt + nsize) - osize; - return newblock; -} - - -void *luaM_saferealloc_ (lua_State *L, void *block, size_t osize, - size_t nsize) { - void *newblock = luaM_realloc_(L, block, osize, nsize); - if (l_unlikely(newblock == NULL && nsize > 0)) /* allocation failed? */ - luaM_error(L); - return newblock; -} - - -void *luaM_malloc_ (lua_State *L, size_t size, int tag) { - if (size == 0) - return NULL; /* that's all */ - else { - global_State *g = G(L); - void *newblock = firsttry(g, NULL, tag, size); - if (l_unlikely(newblock == NULL)) { - newblock = tryagain(L, NULL, tag, size); - if (newblock == NULL) - luaM_error(L); - } - g->GCdebt += size; - return newblock; - } -} diff --git a/lua-5.4.4/src/lmem.h b/lua-5.4.4/src/lmem.h deleted file mode 100644 index 8c75a44..0000000 --- a/lua-5.4.4/src/lmem.h +++ /dev/null @@ -1,93 +0,0 @@ -/* -** $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.4/src/loadlib.c b/lua-5.4.4/src/loadlib.c deleted file mode 100644 index 6f9fa37..0000000 --- a/lua-5.4.4/src/loadlib.c +++ /dev/null @@ -1,762 +0,0 @@ -/* -** $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.4/src/lobject.c b/lua-5.4.4/src/lobject.c deleted file mode 100644 index 301aa90..0000000 --- a/lua-5.4.4/src/lobject.c +++ /dev/null @@ -1,592 +0,0 @@ -/* -** $Id: lobject.c $ -** Some generic functions over Lua objects -** See Copyright Notice in lua.h -*/ - -#define lobject_c -#define LUA_CORE - -#include "lprefix.h" - - -#include -#include -#include -#include -#include -#include - -#include "lua.h" - -#include "lctype.h" -#include "ldebug.h" -#include "ldo.h" -#include "lmem.h" -#include "lobject.h" -#include "lstate.h" -#include "lstring.h" -#include "lvm.h" - - -/* -** Computes ceil(log2(x)) -*/ -int luaO_ceillog2 (unsigned int x) { - static const lu_byte log_2[256] = { /* log_2[i] = ceil(log2(i - 1)) */ - 0,1,2,2,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5, - 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6, - 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7, - 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7, - 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, - 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, - 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, - 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8 - }; - int l = 0; - x--; - while (x >= 256) { l += 8; x >>= 8; } - return l + log_2[x]; -} - - -static lua_Integer intarith (lua_State *L, int op, lua_Integer v1, - lua_Integer v2) { - switch (op) { - case LUA_OPADD: return intop(+, v1, v2); - case LUA_OPSUB:return intop(-, v1, v2); - case LUA_OPMUL:return intop(*, v1, v2); - case LUA_OPMOD: return luaV_mod(L, v1, v2); - case LUA_OPIDIV: return luaV_idiv(L, v1, v2); - case LUA_OPBAND: return intop(&, v1, v2); - case LUA_OPBOR: return intop(|, v1, v2); - case LUA_OPBXOR: return intop(^, v1, v2); - case LUA_OPSHL: return luaV_shiftl(v1, v2); - case LUA_OPSHR: return luaV_shiftl(v1, -v2); - case LUA_OPUNM: return intop(-, 0, v1); - case LUA_OPBNOT: return intop(^, ~l_castS2U(0), v1); - default: lua_assert(0); return 0; - } -} - - -static lua_Number numarith (lua_State *L, int op, lua_Number v1, - lua_Number v2) { - switch (op) { - case LUA_OPADD: return luai_numadd(L, v1, v2); - case LUA_OPSUB: return luai_numsub(L, v1, v2); - case LUA_OPMUL: return luai_nummul(L, v1, v2); - case LUA_OPDIV: return luai_numdiv(L, v1, v2); - case LUA_OPPOW: return luai_numpow(L, v1, v2); - case LUA_OPIDIV: return luai_numidiv(L, v1, v2); - case LUA_OPUNM: return luai_numunm(L, v1); - case LUA_OPMOD: return luaV_modf(L, v1, v2); - default: lua_assert(0); return 0; - } -} - - -int luaO_rawarith (lua_State *L, int op, const TValue *p1, const TValue *p2, - TValue *res) { - switch (op) { - case LUA_OPBAND: case LUA_OPBOR: case LUA_OPBXOR: - case LUA_OPSHL: case LUA_OPSHR: - case LUA_OPBNOT: { /* operate only on integers */ - lua_Integer i1; lua_Integer i2; - if (tointegerns(p1, &i1) && tointegerns(p2, &i2)) { - setivalue(res, intarith(L, op, i1, i2)); - return 1; - } - else return 0; /* fail */ - } - case LUA_OPDIV: case LUA_OPPOW: { /* operate only on floats */ - lua_Number n1; lua_Number n2; - if (tonumberns(p1, n1) && tonumberns(p2, n2)) { - setfltvalue(res, numarith(L, op, n1, n2)); - return 1; - } - else return 0; /* fail */ - } - default: { /* other operations */ - lua_Number n1; lua_Number n2; - if (ttisinteger(p1) && ttisinteger(p2)) { - setivalue(res, intarith(L, op, ivalue(p1), ivalue(p2))); - return 1; - } - else if (tonumberns(p1, n1) && tonumberns(p2, n2)) { - setfltvalue(res, numarith(L, op, n1, n2)); - return 1; - } - else return 0; /* fail */ - } - } -} - - -void luaO_arith (lua_State *L, int op, const TValue *p1, const TValue *p2, - StkId res) { - if (!luaO_rawarith(L, op, p1, p2, s2v(res))) { - /* could not perform raw operation; try metamethod */ - luaT_trybinTM(L, p1, p2, res, cast(TMS, (op - LUA_OPADD) + TM_ADD)); - } -} - - -int luaO_hexavalue (int c) { - if (lisdigit(c)) return c - '0'; - else return (ltolower(c) - 'a') + 10; -} - - -static int isneg (const char **s) { - if (**s == '-') { (*s)++; return 1; } - else if (**s == '+') (*s)++; - return 0; -} - - - -/* -** {================================================================== -** Lua's implementation for 'lua_strx2number' -** =================================================================== -*/ - -#if !defined(lua_strx2number) - -/* maximum number of significant digits to read (to avoid overflows - even with single floats) */ -#define MAXSIGDIG 30 - -/* -** convert a hexadecimal numeric string to a number, following -** C99 specification for 'strtod' -*/ -static lua_Number lua_strx2number (const char *s, char **endptr) { - int dot = lua_getlocaledecpoint(); - lua_Number r = 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' */ -#define BUFVFS 200 - -/* buffer used by 'luaO_pushvfstring' */ -typedef struct BuffFS { - lua_State *L; - int pushed; /* number of string pieces already on the stack */ - int blen; /* length of partial string in 'space' */ - char space[BUFVFS]; /* holds last part of the result */ -} BuffFS; - - -/* -** Push given string to the stack, as part of the buffer, and -** join the partial strings in the stack into one. -*/ -static void pushstr (BuffFS *buff, const char *str, size_t l) { - lua_State *L = buff->L; - setsvalue2s(L, L->top, luaS_newlstr(L, str, l)); - L->top++; /* may use one extra slot */ - buff->pushed++; - luaV_concat(L, buff->pushed); /* join partial results into one */ - buff->pushed = 1; -} - - -/* -** empty the buffer space into the stack -*/ -static void clearbuff (BuffFS *buff) { - pushstr(buff, buff->space, buff->blen); /* push buffer contents */ - buff->blen = 0; /* space now is empty */ -} - - -/* -** Get a space of size 'sz' in the buffer. If buffer has not enough -** space, empty it. 'sz' must fit in an empty buffer. -*/ -static char *getbuff (BuffFS *buff, int sz) { - lua_assert(buff->blen <= BUFVFS); lua_assert(sz <= BUFVFS); - if (sz > BUFVFS - buff->blen) /* not enough space? */ - clearbuff(buff); - return buff->space + buff->blen; -} - - -#define addsize(b,sz) ((b)->blen += (sz)) - - -/* -** Add 'str' to the buffer. If string is larger than the buffer space, -** push the string directly to the stack. -*/ -static void addstr2buff (BuffFS *buff, const char *str, size_t slen) { - if (slen <= BUFVFS) { /* does string fit into buffer? */ - char *bf = getbuff(buff, cast_int(slen)); - memcpy(bf, str, slen); /* add string to buffer */ - addsize(buff, cast_int(slen)); - } - else { /* string larger than buffer */ - clearbuff(buff); /* string comes after buffer's content */ - pushstr(buff, str, slen); /* push string */ - } -} - - -/* -** Add a number to the buffer. -*/ -static void addnum2buff (BuffFS *buff, TValue *num) { - char *numbuff = getbuff(buff, MAXNUMBER2STR); - int len = tostringbuff(num, numbuff); /* format number into 'numbuff' */ - addsize(buff, len); -} - - -/* -** this function handles only '%d', '%c', '%f', '%p', '%s', and '%%' - conventional formats, plus Lua-specific '%I' and '%U' -*/ -const char *luaO_pushvfstring (lua_State *L, const char *fmt, va_list argp) { - BuffFS buff; /* holds last part of the result */ - const char *e; /* points to next '%' */ - buff.pushed = buff.blen = 0; - buff.L = L; - while ((e = strchr(fmt, '%')) != NULL) { - addstr2buff(&buff, fmt, e - fmt); /* add 'fmt' up to '%' */ - switch (*(e + 1)) { /* conversion specifier */ - case 's': { /* zero-terminated string */ - const char *s = va_arg(argp, char *); - if (s == NULL) s = "(null)"; - addstr2buff(&buff, s, strlen(s)); - break; - } - case 'c': { /* an 'int' as a character */ - char c = cast_uchar(va_arg(argp, int)); - addstr2buff(&buff, &c, sizeof(char)); - break; - } - case 'd': { /* an 'int' */ - TValue num; - setivalue(&num, va_arg(argp, int)); - addnum2buff(&buff, &num); - break; - } - case 'I': { /* a 'lua_Integer' */ - TValue num; - setivalue(&num, cast(lua_Integer, va_arg(argp, l_uacInt))); - addnum2buff(&buff, &num); - break; - } - case 'f': { /* a 'lua_Number' */ - TValue num; - setfltvalue(&num, cast_num(va_arg(argp, l_uacNumber))); - addnum2buff(&buff, &num); - break; - } - case 'p': { /* a pointer */ - const int sz = 3 * sizeof(void*) + 8; /* enough space for '%p' */ - char *bf = getbuff(&buff, sz); - void *p = va_arg(argp, void *); - int len = lua_pointer2str(bf, sz, p); - addsize(&buff, len); - break; - } - case 'U': { /* a 'long' as a UTF-8 sequence */ - char bf[UTF8BUFFSZ]; - int len = luaO_utf8esc(bf, va_arg(argp, long)); - addstr2buff(&buff, bf + UTF8BUFFSZ - len, len); - break; - } - case '%': { - addstr2buff(&buff, "%", 1); - break; - } - default: { - luaG_runerror(L, "invalid option '%%%c' to 'lua_pushfstring'", - *(e + 1)); - } - } - fmt = e + 2; /* skip '%' and the specifier */ - } - addstr2buff(&buff, fmt, strlen(fmt)); /* rest of 'fmt' */ - clearbuff(&buff); /* empty buffer into the stack */ - lua_assert(buff.pushed == 1); - return svalue(s2v(L->top - 1)); -} - - -const char *luaO_pushfstring (lua_State *L, const char *fmt, ...) { - const char *msg; - va_list argp; - va_start(argp, fmt); - msg = luaO_pushvfstring(L, fmt, argp); - va_end(argp); - return msg; -} - -/* }================================================================== */ - - -#define RETS "..." -#define PRE "[string \"" -#define POS "\"]" - -#define addstr(a,b,l) ( memcpy(a,b,(l) * sizeof(char)), a += (l) ) - -void luaO_chunkid (char *out, const char *source, size_t srclen) { - size_t bufflen = LUA_IDSIZE; /* free space in buffer */ - if (*source == '=') { /* 'literal' source */ - if (srclen <= bufflen) /* small enough? */ - memcpy(out, source + 1, srclen * sizeof(char)); - else { /* truncate it */ - addstr(out, source + 1, bufflen - 1); - *out = '\0'; - } - } - else if (*source == '@') { /* file name */ - if (srclen <= bufflen) /* small enough? */ - memcpy(out, source + 1, srclen * sizeof(char)); - else { /* add '...' before rest of name */ - addstr(out, RETS, LL(RETS)); - bufflen -= LL(RETS); - memcpy(out, source + 1 + srclen - bufflen, bufflen * sizeof(char)); - } - } - else { /* string; format as [string "source"] */ - const char *nl = strchr(source, '\n'); /* find first new line (if any) */ - addstr(out, PRE, LL(PRE)); /* add prefix */ - bufflen -= LL(PRE RETS POS) + 1; /* save space for prefix+suffix+'\0' */ - if (srclen < bufflen && nl == NULL) { /* small one-line source? */ - addstr(out, source, srclen); /* keep it */ - } - else { - if (nl != NULL) srclen = nl - source; /* stop at first newline */ - if (srclen > bufflen) srclen = bufflen; - addstr(out, source, srclen); - addstr(out, RETS, LL(RETS)); - } - memcpy(out, POS, (LL(POS) + 1) * sizeof(char)); - } -} - diff --git a/lua-5.4.4/src/lobject.h b/lua-5.4.4/src/lobject.h deleted file mode 100644 index 0e05b3e..0000000 --- a/lua-5.4.4/src/lobject.h +++ /dev/null @@ -1,800 +0,0 @@ -/* -** $Id: lobject.h $ -** Type definitions for Lua objects -** See Copyright Notice in lua.h -*/ - - -#ifndef lobject_h -#define lobject_h - - -#include - - -#include "llimits.h" -#include "lua.h" - - -/* -** Extra types for collectable non-values -*/ -#define LUA_TUPVAL LUA_NUMTYPES /* upvalues */ -#define LUA_TPROTO (LUA_NUMTYPES+1) /* function prototypes */ -#define LUA_TDEADKEY (LUA_NUMTYPES+2) /* removed keys in tables */ - - - -/* -** number of all possible types (including LUA_TNONE but excluding DEADKEY) -*/ -#define LUA_TOTALTYPES (LUA_TPROTO + 2) - - -/* -** tags for Tagged Values have the following use of bits: -** bits 0-3: actual tag (a LUA_T* constant) -** bits 4-5: variant bits -** bit 6: whether value is collectable -*/ - -/* add variant bits to a type */ -#define makevariant(t,v) ((t) | ((v) << 4)) - - - -/* -** Union of all Lua values -*/ -typedef union Value { - struct GCObject *gc; /* collectable objects */ - void *p; /* light userdata */ - lua_CFunction f; /* light C functions */ - lua_Integer i; /* integer numbers */ - lua_Number n; /* float numbers */ -} Value; - - -/* -** Tagged Values. This is the basic representation of values in Lua: -** an actual value plus a tag with its type. -*/ - -#define TValuefields Value value_; lu_byte tt_ - -typedef struct TValue { - TValuefields; -} TValue; - - -#define val_(o) ((o)->value_) -#define valraw(o) (val_(o)) - - -/* raw type tag of a TValue */ -#define rawtt(o) ((o)->tt_) - -/* tag with no variants (bits 0-3) */ -#define novariant(t) ((t) & 0x0F) - -/* type tag of a TValue (bits 0-3 for tags + variant bits 4-5) */ -#define withvariant(t) ((t) & 0x3F) -#define ttypetag(o) withvariant(rawtt(o)) - -/* type of a TValue */ -#define ttype(o) (novariant(rawtt(o))) - - -/* Macros to test type */ -#define checktag(o,t) (rawtt(o) == (t)) -#define checktype(o,t) (ttype(o) == (t)) - - -/* Macros for internal tests */ - -/* collectable object has the same tag as the original value */ -#define righttt(obj) (ttypetag(obj) == gcvalue(obj)->tt) - -/* -** Any value being manipulated by the program either is non -** collectable, or the collectable object has the right tag -** and it is not dead. The option 'L == NULL' allows other -** macros using this one to be used where L is not available. -*/ -#define checkliveness(L,obj) \ - ((void)L, lua_longassert(!iscollectable(obj) || \ - (righttt(obj) && (L == NULL || !isdead(G(L),gcvalue(obj)))))) - - -/* Macros to set values */ - -/* set a value's tag */ -#define settt_(o,t) ((o)->tt_=(t)) - - -/* main macro to copy values (from '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; - -/* convert a 'StackValue' to a 'TValue' */ -#define s2v(o) (&(o)->val) - - - -/* -** {================================================================== -** Nil -** =================================================================== -*/ - -/* Standard nil */ -#define LUA_VNIL makevariant(LUA_TNIL, 0) - -/* Empty slot (which might be different from a slot containing nil) */ -#define LUA_VEMPTY makevariant(LUA_TNIL, 1) - -/* Value returned for a key not found in a table (absent key) */ -#define LUA_VABSTKEY makevariant(LUA_TNIL, 2) - - -/* macro to test for (any kind of) nil */ -#define ttisnil(v) checktype((v), LUA_TNIL) - - -/* macro to test for a standard nil */ -#define ttisstrictnil(o) checktag((o), LUA_VNIL) - - -#define setnilvalue(obj) settt_(obj, LUA_VNIL) - - -#define isabstkey(v) checktag((v), LUA_VABSTKEY) - - -/* -** macro to detect non-standard nils (used only in assertions) -*/ -#define isnonstrictnil(v) (ttisnil(v) && !ttisstrictnil(v)) - - -/* -** By default, entries with any kind of nil are considered empty. -** (In any definition, values associated with absent keys must also -** be accepted as empty.) -*/ -#define isempty(v) ttisnil(v) - - -/* macro defining a value corresponding to an absent key */ -#define ABSTKEYCONSTANT {NULL}, LUA_VABSTKEY - - -/* mark an entry as empty */ -#define setempty(v) settt_(v, LUA_VEMPTY) - - - -/* }================================================================== */ - - -/* -** {================================================================== -** Booleans -** =================================================================== -*/ - - -#define LUA_VFALSE makevariant(LUA_TBOOLEAN, 0) -#define LUA_VTRUE makevariant(LUA_TBOOLEAN, 1) - -#define ttisboolean(o) checktype((o), LUA_TBOOLEAN) -#define ttisfalse(o) checktag((o), LUA_VFALSE) -#define ttistrue(o) checktag((o), LUA_VTRUE) - - -#define l_isfalse(o) (ttisfalse(o) || ttisnil(o)) - - -#define setbfvalue(obj) settt_(obj, LUA_VFALSE) -#define setbtvalue(obj) settt_(obj, LUA_VTRUE) - -/* }================================================================== */ - - -/* -** {================================================================== -** Threads -** =================================================================== -*/ - -#define LUA_VTHREAD makevariant(LUA_TTHREAD, 0) - -#define ttisthread(o) checktag((o), ctb(LUA_VTHREAD)) - -#define thvalue(o) check_exp(ttisthread(o), gco2th(val_(o).gc)) - -#define setthvalue(L,obj,x) \ - { TValue *io = (obj); lua_State *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VTHREAD)); \ - checkliveness(L,io); } - -#define setthvalue2s(L,o,t) setthvalue(L,s2v(o),t) - -/* }================================================================== */ - - -/* -** {================================================================== -** Collectable Objects -** =================================================================== -*/ - -/* -** Common Header for all collectable objects (in macro form, to be -** included in other objects) -*/ -#define CommonHeader struct GCObject *next; lu_byte tt; lu_byte marked - - -/* Common type for all collectable objects */ -typedef struct GCObject { - CommonHeader; -} GCObject; - - -/* Bit mark for collectable types */ -#define BIT_ISCOLLECTABLE (1 << 6) - -#define iscollectable(o) (rawtt(o) & BIT_ISCOLLECTABLE) - -/* mark a tag as collectable */ -#define ctb(t) ((t) | BIT_ISCOLLECTABLE) - -#define gcvalue(o) check_exp(iscollectable(o), val_(o).gc) - -#define gcvalueraw(v) ((v).gc) - -#define setgcovalue(L,obj,x) \ - { TValue *io = (obj); GCObject *i_g=(x); \ - val_(io).gc = i_g; settt_(io, ctb(i_g->tt)); } - -/* }================================================================== */ - - -/* -** {================================================================== -** Numbers -** =================================================================== -*/ - -/* Variant tags for numbers */ -#define LUA_VNUMINT makevariant(LUA_TNUMBER, 0) /* integer numbers */ -#define LUA_VNUMFLT makevariant(LUA_TNUMBER, 1) /* float numbers */ - -#define ttisnumber(o) checktype((o), LUA_TNUMBER) -#define ttisfloat(o) checktag((o), LUA_VNUMFLT) -#define ttisinteger(o) checktag((o), LUA_VNUMINT) - -#define nvalue(o) check_exp(ttisnumber(o), \ - (ttisinteger(o) ? cast_num(ivalue(o)) : fltvalue(o))) -#define fltvalue(o) check_exp(ttisfloat(o), val_(o).n) -#define ivalue(o) check_exp(ttisinteger(o), val_(o).i) - -#define fltvalueraw(v) ((v).n) -#define ivalueraw(v) ((v).i) - -#define setfltvalue(obj,x) \ - { TValue *io=(obj); val_(io).n=(x); settt_(io, LUA_VNUMFLT); } - -#define chgfltvalue(obj,x) \ - { TValue *io=(obj); lua_assert(ttisfloat(io)); val_(io).n=(x); } - -#define setivalue(obj,x) \ - { TValue *io=(obj); val_(io).i=(x); settt_(io, LUA_VNUMINT); } - -#define chgivalue(obj,x) \ - { TValue *io=(obj); lua_assert(ttisinteger(io)); val_(io).i=(x); } - -/* }================================================================== */ - - -/* -** {================================================================== -** Strings -** =================================================================== -*/ - -/* Variant tags for strings */ -#define LUA_VSHRSTR makevariant(LUA_TSTRING, 0) /* short strings */ -#define LUA_VLNGSTR makevariant(LUA_TSTRING, 1) /* long strings */ - -#define ttisstring(o) checktype((o), LUA_TSTRING) -#define ttisshrstring(o) checktag((o), ctb(LUA_VSHRSTR)) -#define ttislngstring(o) checktag((o), ctb(LUA_VLNGSTR)) - -#define tsvalueraw(v) (gco2ts((v).gc)) - -#define tsvalue(o) check_exp(ttisstring(o), gco2ts(val_(o).gc)) - -#define setsvalue(L,obj,x) \ - { TValue *io = (obj); TString *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(x_->tt)); \ - checkliveness(L,io); } - -/* set a string to the stack */ -#define setsvalue2s(L,o,s) setsvalue(L,s2v(o),s) - -/* set a string to a new object */ -#define setsvalue2n setsvalue - - -/* -** Header for a string value. -*/ -typedef struct TString { - CommonHeader; - lu_byte extra; /* reserved words for short strings; "has hash" for longs */ - lu_byte shrlen; /* length for short strings */ - unsigned int hash; - union { - size_t lnglen; /* length for long strings */ - struct TString *hnext; /* linked list for hash table */ - } u; - char contents[1]; -} TString; - - - -/* -** Get the actual string (array of bytes) from a 'TString'. -*/ -#define getstr(ts) ((ts)->contents) - - -/* get the actual string (array of bytes) from a Lua value */ -#define svalue(o) getstr(tsvalue(o)) - -/* get string length from 'TString *s' */ -#define tsslen(s) ((s)->tt == LUA_VSHRSTR ? (s)->shrlen : (s)->u.lnglen) - -/* get string length from 'TValue *o' */ -#define vslen(o) tsslen(tsvalue(o)) - -/* }================================================================== */ - - -/* -** {================================================================== -** Userdata -** =================================================================== -*/ - - -/* -** Light userdata should be a variant of userdata, but for compatibility -** reasons they are also different types. -*/ -#define LUA_VLIGHTUSERDATA makevariant(LUA_TLIGHTUSERDATA, 0) - -#define LUA_VUSERDATA makevariant(LUA_TUSERDATA, 0) - -#define ttislightuserdata(o) checktag((o), LUA_VLIGHTUSERDATA) -#define ttisfulluserdata(o) checktag((o), ctb(LUA_VUSERDATA)) - -#define pvalue(o) check_exp(ttislightuserdata(o), val_(o).p) -#define uvalue(o) check_exp(ttisfulluserdata(o), gco2u(val_(o).gc)) - -#define pvalueraw(v) ((v).p) - -#define setpvalue(obj,x) \ - { TValue *io=(obj); val_(io).p=(x); settt_(io, LUA_VLIGHTUSERDATA); } - -#define setuvalue(L,obj,x) \ - { TValue *io = (obj); Udata *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VUSERDATA)); \ - checkliveness(L,io); } - - -/* Ensures that addresses after this type are always fully aligned. */ -typedef union UValue { - TValue uv; - LUAI_MAXALIGN; /* ensures maximum alignment for udata bytes */ -} UValue; - - -/* -** Header for userdata with user values; -** memory area follows the end of this structure. -*/ -typedef struct Udata { - CommonHeader; - unsigned short nuvalue; /* number of user values */ - size_t len; /* number of bytes */ - struct Table *metatable; - GCObject *gclist; - UValue uv[1]; /* user values */ -} Udata; - - -/* -** Header for userdata with no user values. These userdata do not need -** to be gray during GC, and therefore do not need a 'gclist' field. -** To simplify, the code always use 'Udata' for both kinds of userdata, -** making sure it never accesses 'gclist' on userdata with no user values. -** This structure here is used only to compute the correct size for -** this representation. (The 'bindata' field in its end ensures correct -** alignment for binary data following this header.) -*/ -typedef struct Udata0 { - CommonHeader; - unsigned short nuvalue; /* number of user values */ - size_t len; /* number of bytes */ - struct Table *metatable; - union {LUAI_MAXALIGN;} bindata; -} Udata0; - - -/* compute the offset of the memory area of a userdata */ -#define udatamemoffset(nuv) \ - ((nuv) == 0 ? offsetof(Udata0, bindata) \ - : offsetof(Udata, uv) + (sizeof(UValue) * (nuv))) - -/* get the address of the memory block inside 'Udata' */ -#define getudatamem(u) (cast_charp(u) + udatamemoffset((u)->nuvalue)) - -/* compute the size of a userdata */ -#define sizeudata(nuv,nb) (udatamemoffset(nuv) + (nb)) - -/* }================================================================== */ - - -/* -** {================================================================== -** Prototypes -** =================================================================== -*/ - -#define LUA_VPROTO makevariant(LUA_TPROTO, 0) - - -/* -** Description of an upvalue for function prototypes -*/ -typedef struct Upvaldesc { - TString *name; /* upvalue name (for debug information) */ - lu_byte instack; /* whether it is in stack (register) */ - lu_byte idx; /* index of upvalue (in stack or in outer function's list) */ - lu_byte kind; /* kind of corresponding variable */ -} Upvaldesc; - - -/* -** Description of a local variable for function prototypes -** (used for debug information) -*/ -typedef struct LocVar { - TString *varname; - int startpc; /* first point where variable is active */ - int endpc; /* first point where variable is dead */ -} LocVar; - - -/* -** Associates the absolute line source for a given instruction ('pc'). -** The array 'lineinfo' gives, for each instruction, the difference in -** lines from the previous instruction. When that difference does not -** fit into a byte, Lua saves the absolute line for that instruction. -** (Lua also saves the absolute line periodically, to speed up the -** computation of a line number: we can use binary search in the -** absolute-line array, but we must traverse the 'lineinfo' array -** linearly to compute a line.) -*/ -typedef struct AbsLineInfo { - int pc; - int line; -} AbsLineInfo; - -/* -** Function Prototypes -*/ -typedef struct Proto { - CommonHeader; - lu_byte numparams; /* number of fixed (named) parameters */ - lu_byte is_vararg; - lu_byte maxstacksize; /* number of registers needed by this function */ - int sizeupvalues; /* size of 'upvalues' */ - int sizek; /* size of 'k' */ - int sizecode; - int sizelineinfo; - int sizep; /* size of 'p' */ - int sizelocvars; - int sizeabslineinfo; /* size of 'abslineinfo' */ - int linedefined; /* debug information */ - int lastlinedefined; /* debug information */ - TValue *k; /* constants used by the function */ - Instruction *code; /* opcodes */ - struct Proto **p; /* functions defined inside the function */ - Upvaldesc *upvalues; /* upvalue information */ - ls_byte *lineinfo; /* information about source lines (debug information) */ - AbsLineInfo *abslineinfo; /* idem */ - LocVar *locvars; /* information about local variables (debug information) */ - TString *source; /* used for debug information */ - GCObject *gclist; -} Proto; - -/* }================================================================== */ - - -/* -** {================================================================== -** Functions -** =================================================================== -*/ - -#define LUA_VUPVAL makevariant(LUA_TUPVAL, 0) - - -/* Variant tags for functions */ -#define LUA_VLCL makevariant(LUA_TFUNCTION, 0) /* Lua closure */ -#define LUA_VLCF makevariant(LUA_TFUNCTION, 1) /* light C function */ -#define LUA_VCCL makevariant(LUA_TFUNCTION, 2) /* C closure */ - -#define ttisfunction(o) checktype(o, LUA_TFUNCTION) -#define ttisLclosure(o) checktag((o), ctb(LUA_VLCL)) -#define ttislcf(o) checktag((o), LUA_VLCF) -#define ttisCclosure(o) checktag((o), ctb(LUA_VCCL)) -#define ttisclosure(o) (ttisLclosure(o) || ttisCclosure(o)) - - -#define isLfunction(o) ttisLclosure(o) - -#define clvalue(o) check_exp(ttisclosure(o), gco2cl(val_(o).gc)) -#define clLvalue(o) check_exp(ttisLclosure(o), gco2lcl(val_(o).gc)) -#define fvalue(o) check_exp(ttislcf(o), val_(o).f) -#define clCvalue(o) check_exp(ttisCclosure(o), gco2ccl(val_(o).gc)) - -#define fvalueraw(v) ((v).f) - -#define setclLvalue(L,obj,x) \ - { TValue *io = (obj); LClosure *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VLCL)); \ - checkliveness(L,io); } - -#define setclLvalue2s(L,o,cl) setclLvalue(L,s2v(o),cl) - -#define setfvalue(obj,x) \ - { TValue *io=(obj); val_(io).f=(x); settt_(io, LUA_VLCF); } - -#define setclCvalue(L,obj,x) \ - { TValue *io = (obj); CClosure *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VCCL)); \ - checkliveness(L,io); } - - -/* -** Upvalues for Lua closures -*/ -typedef struct UpVal { - CommonHeader; - lu_byte tbc; /* true if it represents a to-be-closed variable */ - TValue *v; /* points to stack or to its own value */ - union { - struct { /* (when open) */ - struct UpVal *next; /* linked list */ - struct UpVal **previous; - } open; - TValue value; /* the value (when closed) */ - } u; -} UpVal; - - - -#define ClosureHeader \ - CommonHeader; lu_byte nupvalues; GCObject *gclist - -typedef struct CClosure { - ClosureHeader; - lua_CFunction f; - TValue upvalue[1]; /* list of upvalues */ -} CClosure; - - -typedef struct LClosure { - ClosureHeader; - struct Proto *p; - UpVal *upvals[1]; /* list of upvalues */ -} LClosure; - - -typedef union Closure { - CClosure c; - LClosure l; -} Closure; - - -#define getproto(o) (clLvalue(o)->p) - -/* }================================================================== */ - - -/* -** {================================================================== -** Tables -** =================================================================== -*/ - -#define LUA_VTABLE makevariant(LUA_TTABLE, 0) - -#define ttistable(o) checktag((o), ctb(LUA_VTABLE)) - -#define hvalue(o) check_exp(ttistable(o), gco2t(val_(o).gc)) - -#define sethvalue(L,obj,x) \ - { TValue *io = (obj); Table *x_ = (x); \ - val_(io).gc = obj2gco(x_); settt_(io, ctb(LUA_VTABLE)); \ - checkliveness(L,io); } - -#define sethvalue2s(L,o,h) sethvalue(L,s2v(o),h) - - -/* -** Nodes for Hash tables: A pack of two TValue's (key-value pairs) -** plus a 'next' field to link colliding entries. The distribution -** of the key's fields ('key_tt' and 'key_val') not forming a proper -** 'TValue' allows for a smaller size for 'Node' both in 4-byte -** and 8-byte alignments. -*/ -typedef union Node { - struct NodeKey { - TValuefields; /* fields for value */ - lu_byte key_tt; /* key type */ - int next; /* for chaining */ - Value key_val; /* key value */ - } u; - TValue i_val; /* direct access to node's value as a proper 'TValue' */ -} Node; - - -/* copy a value into a key */ -#define setnodekey(L,node,obj) \ - { Node *n_=(node); const TValue *io_=(obj); \ - n_->u.key_val = io_->value_; n_->u.key_tt = io_->tt_; \ - checkliveness(L,io_); } - - -/* copy a value from a key */ -#define getnodekey(L,obj,node) \ - { TValue *io_=(obj); const Node *n_=(node); \ - io_->value_ = n_->u.key_val; io_->tt_ = n_->u.key_tt; \ - checkliveness(L,io_); } - - -/* -** About 'alimit': if 'isrealasize(t)' is true, then 'alimit' is the -** real size of 'array'. Otherwise, the real size of 'array' is the -** smallest power of two not smaller than 'alimit' (or zero iff 'alimit' -** is zero); 'alimit' is then used as a hint for #t. -*/ - -#define BITRAS (1 << 7) -#define isrealasize(t) (!((t)->flags & BITRAS)) -#define setrealasize(t) ((t)->flags &= cast_byte(~BITRAS)) -#define setnorealasize(t) ((t)->flags |= BITRAS) - - -typedef struct Table { - CommonHeader; - lu_byte flags; /* 1<

u.key_tt) -#define keyval(node) ((node)->u.key_val) - -#define keyisnil(node) (keytt(node) == LUA_TNIL) -#define keyisinteger(node) (keytt(node) == LUA_VNUMINT) -#define keyival(node) (keyval(node).i) -#define keyisshrstr(node) (keytt(node) == ctb(LUA_VSHRSTR)) -#define keystrval(node) (gco2ts(keyval(node).gc)) - -#define setnilkey(node) (keytt(node) = LUA_TNIL) - -#define keyiscollectable(n) (keytt(n) & BIT_ISCOLLECTABLE) - -#define gckey(n) (keyval(n).gc) -#define gckeyN(n) (keyiscollectable(n) ? gckey(n) : NULL) - - -/* -** Dead keys in tables have the tag DEADKEY but keep their original -** gcvalue. This distinguishes them from regular keys but allows them to -** be found when searched in a special way. ('next' needs that to find -** keys removed from a table during a traversal.) -*/ -#define setdeadkey(node) (keytt(node) = LUA_TDEADKEY) -#define keyisdead(node) (keytt(node) == LUA_TDEADKEY) - -/* }================================================================== */ - - - -/* -** 'module' operation for hashing (size is always a power of 2) -*/ -#define lmod(s,size) \ - (check_exp((size&(size-1))==0, (cast_int((s) & ((size)-1))))) - - -#define twoto(x) (1<<(x)) -#define sizenode(t) (twoto((t)->lsizenode)) - - -/* size of buffer for 'luaO_utf8esc' function */ -#define UTF8BUFFSZ 8 - -LUAI_FUNC int luaO_utf8esc (char *buff, unsigned long x); -LUAI_FUNC int luaO_ceillog2 (unsigned int x); -LUAI_FUNC int luaO_rawarith (lua_State *L, int op, const TValue *p1, - const TValue *p2, TValue *res); -LUAI_FUNC void luaO_arith (lua_State *L, int op, const TValue *p1, - const TValue *p2, StkId res); -LUAI_FUNC size_t luaO_str2num (const char *s, TValue *o); -LUAI_FUNC int luaO_hexavalue (int c); -LUAI_FUNC void luaO_tostring (lua_State *L, TValue *obj); -LUAI_FUNC const char *luaO_pushvfstring (lua_State *L, const char *fmt, - va_list argp); -LUAI_FUNC const char *luaO_pushfstring (lua_State *L, const char *fmt, ...); -LUAI_FUNC void luaO_chunkid (char *out, const char *source, size_t srclen); - - -#endif - diff --git a/lua-5.4.4/src/lopcodes.c b/lua-5.4.4/src/lopcodes.c deleted file mode 100644 index c67aa22..0000000 --- a/lua-5.4.4/src/lopcodes.c +++ /dev/null @@ -1,104 +0,0 @@ -/* -** $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.4/src/lopcodes.h b/lua-5.4.4/src/lopcodes.h deleted file mode 100644 index 7c27451..0000000 --- a/lua-5.4.4/src/lopcodes.h +++ /dev/null @@ -1,405 +0,0 @@ -/* -** $Id: lopcodes.h $ -** Opcodes for Lua virtual machine -** See Copyright Notice in lua.h -*/ - -#ifndef lopcodes_h -#define lopcodes_h - -#include "llimits.h" - - -/*=========================================================================== - We assume that instructions are unsigned 32-bit integers. - All instructions have an opcode in the first 7 bits. - Instructions can have the following formats: - - 3 3 2 2 2 2 2 2 2 2 2 2 1 1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 - 1 0 9 8 7 6 5 4 3 2 1 0 9 8 7 6 5 4 3 2 1 0 9 8 7 6 5 4 3 2 1 0 -iABC C(8) | B(8) |k| A(8) | Op(7) | -iABx Bx(17) | A(8) | Op(7) | -iAsBx sBx (signed)(17) | A(8) | Op(7) | -iAx Ax(25) | Op(7) | -isJ sJ(25) | Op(7) | - - A signed argument is represented in excess K: the represented value is - the written unsigned value minus K, where K is half the maximum for the - corresponding unsigned argument. -===========================================================================*/ - - -enum OpMode {iABC, iABx, iAsBx, iAx, isJ}; /* basic instruction formats */ - - -/* -** size and position of opcode arguments. -*/ -#define SIZE_C 8 -#define SIZE_B 8 -#define SIZE_Bx (SIZE_C + SIZE_B + 1) -#define SIZE_A 8 -#define SIZE_Ax (SIZE_Bx + SIZE_A) -#define SIZE_sJ (SIZE_Bx + SIZE_A) - -#define SIZE_OP 7 - -#define POS_OP 0 - -#define POS_A (POS_OP + SIZE_OP) -#define POS_k (POS_A + SIZE_A) -#define POS_B (POS_k + 1) -#define POS_C (POS_B + SIZE_B) - -#define POS_Bx POS_k - -#define POS_Ax POS_A - -#define POS_sJ POS_A - - -/* -** limits for opcode arguments. -** we use (signed) 'int' to manipulate most arguments, -** so they must fit in ints. -*/ - -/* Check whether type 'int' has at least 'b' bits ('b' < 32) */ -#define L_INTHASBITS(b) ((UINT_MAX >> ((b) - 1)) >= 1) - - -#if L_INTHASBITS(SIZE_Bx) -#define MAXARG_Bx ((1<>1) /* 'sBx' is signed */ - - -#if L_INTHASBITS(SIZE_Ax) -#define MAXARG_Ax ((1<> 1) - - -#define MAXARG_A ((1<> 1) - -#define int2sC(i) ((i) + OFFSET_sC) -#define sC2int(i) ((i) - OFFSET_sC) - - -/* creates a mask with 'n' 1 bits at position 'p' */ -#define MASK1(n,p) ((~((~(Instruction)0)<<(n)))<<(p)) - -/* creates a mask with 'n' 0 bits at position 'p' */ -#define MASK0(n,p) (~MASK1(n,p)) - -/* -** the following macros help to manipulate instructions -*/ - -#define GET_OPCODE(i) (cast(OpCode, ((i)>>POS_OP) & MASK1(SIZE_OP,0))) -#define SET_OPCODE(i,o) ((i) = (((i)&MASK0(SIZE_OP,POS_OP)) | \ - ((cast(Instruction, o)<>(pos)) & MASK1(size,0))) -#define setarg(i,v,pos,size) ((i) = (((i)&MASK0(size,pos)) | \ - ((cast(Instruction, v)<> sC */ -OP_SHLI,/* A B sC R[A] := sC << R[B] */ - -OP_ADD,/* A B C R[A] := R[B] + R[C] */ -OP_SUB,/* A B C R[A] := R[B] - R[C] */ -OP_MUL,/* A B C R[A] := R[B] * R[C] */ -OP_MOD,/* A B C R[A] := R[B] % R[C] */ -OP_POW,/* A B C R[A] := R[B] ^ R[C] */ -OP_DIV,/* A B C R[A] := R[B] / R[C] */ -OP_IDIV,/* A B C R[A] := R[B] // R[C] */ - -OP_BAND,/* A B C R[A] := R[B] & R[C] */ -OP_BOR,/* A B C R[A] := R[B] | R[C] */ -OP_BXOR,/* A B C R[A] := R[B] ~ R[C] */ -OP_SHL,/* A B C R[A] := R[B] << R[C] */ -OP_SHR,/* A B C R[A] := R[B] >> R[C] */ - -OP_MMBIN,/* A B C call C metamethod over R[A] and R[B] (*) */ -OP_MMBINI,/* A sB C k call C metamethod over R[A] and sB */ -OP_MMBINK,/* A B C k call C metamethod over R[A] and K[B] */ - -OP_UNM,/* A B R[A] := -R[B] */ -OP_BNOT,/* A B R[A] := ~R[B] */ -OP_NOT,/* A B R[A] := not R[B] */ -OP_LEN,/* A B R[A] := #R[B] (length operator) */ - -OP_CONCAT,/* A B R[A] := R[A].. ... ..R[A + B - 1] */ - -OP_CLOSE,/* A close all upvalues >= R[A] */ -OP_TBC,/* A mark variable A "to be closed" */ -OP_JMP,/* sJ pc += sJ */ -OP_EQ,/* A B k if ((R[A] == R[B]) ~= k) then pc++ */ -OP_LT,/* A B k if ((R[A] < R[B]) ~= k) then pc++ */ -OP_LE,/* A B k if ((R[A] <= R[B]) ~= k) then pc++ */ - -OP_EQK,/* A B k if ((R[A] == K[B]) ~= k) then pc++ */ -OP_EQI,/* A sB k if ((R[A] == sB) ~= k) then pc++ */ -OP_LTI,/* A sB k if ((R[A] < sB) ~= k) then pc++ */ -OP_LEI,/* A sB k if ((R[A] <= sB) ~= k) then pc++ */ -OP_GTI,/* A sB k if ((R[A] > sB) ~= k) then pc++ */ -OP_GEI,/* A sB k if ((R[A] >= sB) ~= k) then pc++ */ - -OP_TEST,/* A k if (not R[A] == k) then pc++ */ -OP_TESTSET,/* A B k if (not R[B] == k) then pc++ else R[A] := R[B] (*) */ - -OP_CALL,/* A B C R[A], ... ,R[A+C-2] := R[A](R[A+1], ... ,R[A+B-1]) */ -OP_TAILCALL,/* A B C k return R[A](R[A+1], ... ,R[A+B-1]) */ - -OP_RETURN,/* A B C k return R[A], ... ,R[A+B-2] (see note) */ -OP_RETURN0,/* return */ -OP_RETURN1,/* A return R[A] */ - -OP_FORLOOP,/* A Bx update counters; if loop continues then pc-=Bx; */ -OP_FORPREP,/* A Bx ; - if not to run then pc+=Bx+1; */ - -OP_TFORPREP,/* A Bx create upvalue for R[A + 3]; pc+=Bx */ -OP_TFORCALL,/* A C R[A+4], ... ,R[A+3+C] := R[A](R[A+1], R[A+2]); */ -OP_TFORLOOP,/* A Bx if R[A+2] ~= nil then { R[A]=R[A+2]; pc -= Bx } */ - -OP_SETLIST,/* A B C k R[A][C+i] := R[A+i], 1 <= i <= B */ - -OP_CLOSURE,/* A Bx R[A] := closure(KPROTO[Bx]) */ - -OP_VARARG,/* A C R[A], R[A+1], ..., R[A+C-2] = vararg */ - -OP_VARARGPREP,/*A (adjust vararg parameters) */ - -OP_EXTRAARG/* Ax extra (larger) argument for previous opcode */ -} OpCode; - - -#define NUM_OPCODES ((int)(OP_EXTRAARG) + 1) - - - -/*=========================================================================== - Notes: - - (*) 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.4/src/lopnames.h b/lua-5.4.4/src/lopnames.h deleted file mode 100644 index 965cec9..0000000 --- a/lua-5.4.4/src/lopnames.h +++ /dev/null @@ -1,103 +0,0 @@ -/* -** $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.4/src/loslib.c b/lua-5.4.4/src/loslib.c deleted file mode 100644 index 3e20d62..0000000 --- a/lua-5.4.4/src/loslib.c +++ /dev/null @@ -1,430 +0,0 @@ -/* -** $Id: loslib.c $ -** Standard Operating System library -** See Copyright Notice in lua.h -*/ - -#define loslib_c -#define LUA_LIB - -#include "lprefix.h" - - -#include -#include -#include -#include -#include - -#include "lua.h" - -#include "lauxlib.h" -#include "lualib.h" - - -/* -** {================================================================== -** List of valid conversion specifiers for the 'strftime' function; -** options are grouped by length; group of length 2 start with '||'. -** =================================================================== -*/ -#if !defined(LUA_STRFTIMEOPTIONS) /* { */ - -/* options for ANSI C 89 (only 1-char options) */ -#define L_STRFTIMEC89 "aAbBcdHIjmMpSUwWxXyYZ%" - -/* options for ISO C 99 and POSIX */ -#define L_STRFTIMEC99 "aAbBcCdDeFgGhHIjmMnprRStTuUVwWxXyYzZ%" \ - "||" "EcECExEXEyEY" "OdOeOHOIOmOMOSOuOUOVOwOWOy" /* two-char options */ - -/* options for Windows */ -#define L_STRFTIMEWIN "aAbBcdHIjmMpSUwWxXyYzZ%" \ - "||" "#c#x#d#H#I#j#m#M#S#U#w#W#y#Y" /* two-char options */ - -#if defined(LUA_USE_WINDOWS) -#define LUA_STRFTIMEOPTIONS L_STRFTIMEWIN -#elif defined(LUA_USE_C89) -#define LUA_STRFTIMEOPTIONS L_STRFTIMEC89 -#else /* C99 specification */ -#define LUA_STRFTIMEOPTIONS L_STRFTIMEC99 -#endif - -#endif /* } */ -/* }================================================================== */ - - -/* -** {================================================================== -** Configuration for time-related stuff -** =================================================================== -*/ - -/* -** type to represent time_t in Lua -*/ -#if !defined(LUA_NUMTIME) /* { */ - -#define l_timet lua_Integer -#define l_pushtime(L,t) lua_pushinteger(L,(lua_Integer)(t)) -#define l_gettime(L,arg) luaL_checkinteger(L, arg) - -#else /* }{ */ - -#define l_timet lua_Number -#define l_pushtime(L,t) lua_pushnumber(L,(lua_Number)(t)) -#define l_gettime(L,arg) luaL_checknumber(L, arg) - -#endif /* } */ - - -#if !defined(l_gmtime) /* { */ -/* -** By default, Lua uses gmtime/localtime, except when POSIX is available, -** where it uses gmtime_r/localtime_r -*/ - -#if defined(LUA_USE_POSIX) /* { */ - -#define l_gmtime(t,r) gmtime_r(t,r) -#define l_localtime(t,r) localtime_r(t,r) - -#else /* }{ */ - -/* ISO C definitions */ -#define l_gmtime(t,r) ((void)(r)->tm_sec, gmtime(t)) -#define l_localtime(t,r) ((void)(r)->tm_sec, localtime(t)) - -#endif /* } */ - -#endif /* } */ - -/* }================================================================== */ - - -/* -** {================================================================== -** Configuration for 'tmpnam': -** By default, Lua uses tmpnam except when POSIX is available, where -** it uses mkstemp. -** =================================================================== -*/ -#if !defined(lua_tmpnam) /* { */ - -#if defined(LUA_USE_POSIX) /* { */ - -#include - -#define LUA_TMPNAMBUFSIZE 32 - -#if !defined(LUA_TMPNAMTEMPLATE) -#define LUA_TMPNAMTEMPLATE "/tmp/lua_XXXXXX" -#endif - -#define lua_tmpnam(b,e) { \ - strcpy(b, LUA_TMPNAMTEMPLATE); \ - e = mkstemp(b); \ - if (e != -1) close(e); \ - e = (e == -1); } - -#else /* }{ */ - -/* ISO C definitions */ -#define LUA_TMPNAMBUFSIZE L_tmpnam -#define lua_tmpnam(b,e) { e = (tmpnam(b) == NULL); } - -#endif /* } */ - -#endif /* } */ -/* }================================================================== */ - - - -static int os_execute (lua_State *L) { - const char *cmd = luaL_optstring(L, 1, NULL); - int stat; - errno = 0; - stat = system(cmd); - if (cmd != NULL) - return luaL_execresult(L, stat); - else { - lua_pushboolean(L, stat); /* true if there is a shell */ - return 1; - } -} - - -static int os_remove (lua_State *L) { - const char *filename = luaL_checkstring(L, 1); - return luaL_fileresult(L, remove(filename) == 0, filename); -} - - -static int os_rename (lua_State *L) { - const char *fromname = luaL_checkstring(L, 1); - const char *toname = luaL_checkstring(L, 2); - return luaL_fileresult(L, rename(fromname, toname) == 0, NULL); -} - - -static int os_tmpname (lua_State *L) { - char buff[LUA_TMPNAMBUFSIZE]; - int err; - lua_tmpnam(buff, err); - if (l_unlikely(err)) - return luaL_error(L, "unable to generate a unique filename"); - lua_pushstring(L, buff); - return 1; -} - - -static int os_getenv (lua_State *L) { - lua_pushstring(L, getenv(luaL_checkstring(L, 1))); /* if NULL push nil */ - return 1; -} - - -static int os_clock (lua_State *L) { - lua_pushnumber(L, ((lua_Number)clock())/(lua_Number)CLOCKS_PER_SEC); - return 1; -} - - -/* -** {====================================================== -** Time/Date operations -** { year=%Y, month=%m, day=%d, hour=%H, min=%M, sec=%S, -** wday=%w+1, yday=%j, isdst=? } -** ======================================================= -*/ - -/* -** About the overflow check: an overflow cannot occur when time -** is represented by a lua_Integer, because either lua_Integer is -** large enough to represent all int fields or it is not large enough -** to represent a time that cause a field to overflow. However, if -** times are represented as doubles and lua_Integer is int, then the -** time 0x1.e1853b0d184f6p+55 would cause an overflow when adding 1900 -** to compute the year. -*/ -static void setfield (lua_State *L, const char *key, int value, int delta) { - #if (defined(LUA_NUMTIME) && LUA_MAXINTEGER <= INT_MAX) - if (l_unlikely(value > LUA_MAXINTEGER - delta)) - luaL_error(L, "field '%s' is out-of-bound", key); - #endif - lua_pushinteger(L, (lua_Integer)value + delta); - lua_setfield(L, -2, key); -} - - -static void setboolfield (lua_State *L, const char *key, int value) { - if (value < 0) /* undefined? */ - return; /* does not set field */ - lua_pushboolean(L, value); - lua_setfield(L, -2, key); -} - - -/* -** Set all fields from structure 'tm' in the table on top of the stack -*/ -static void setallfields (lua_State *L, struct tm *stm) { - setfield(L, "year", stm->tm_year, 1900); - setfield(L, "month", stm->tm_mon, 1); - setfield(L, "day", stm->tm_mday, 0); - setfield(L, "hour", stm->tm_hour, 0); - setfield(L, "min", stm->tm_min, 0); - setfield(L, "sec", stm->tm_sec, 0); - setfield(L, "yday", stm->tm_yday, 1); - setfield(L, "wday", stm->tm_wday, 1); - setboolfield(L, "isdst", stm->tm_isdst); -} - - -static int getboolfield (lua_State *L, const char *key) { - int res; - res = (lua_getfield(L, -1, key) == LUA_TNIL) ? -1 : lua_toboolean(L, -1); - lua_pop(L, 1); - return res; -} - - -static int getfield (lua_State *L, const char *key, int d, int delta) { - int isnum; - int t = lua_getfield(L, -1, key); /* get field and its type */ - lua_Integer res = lua_tointegerx(L, -1, &isnum); - if (!isnum) { /* field is not an integer? */ - if (l_unlikely(t != LUA_TNIL)) /* some other value? */ - return luaL_error(L, "field '%s' is not an integer", key); - else if (l_unlikely(d < 0)) /* absent field; no default? */ - return luaL_error(L, "field '%s' missing in date table", key); - res = d; - } - else { - /* unsigned avoids overflow when lua_Integer has 32 bits */ - if (!(res >= 0 ? (lua_Unsigned)res <= (lua_Unsigned)INT_MAX + delta - : (lua_Integer)INT_MIN + delta <= res)) - return luaL_error(L, "field '%s' is out-of-bound", key); - res -= delta; - } - lua_pop(L, 1); - return (int)res; -} - - -static const char *checkoption (lua_State *L, const char *conv, - ptrdiff_t convlen, char *buff) { - const char *option = LUA_STRFTIMEOPTIONS; - int oplen = 1; /* length of options being checked */ - for (; *option != '\0' && oplen <= convlen; option += oplen) { - if (*option == '|') /* next block? */ - oplen++; /* will check options with next length (+1) */ - else if (memcmp(conv, option, oplen) == 0) { /* match? */ - memcpy(buff, conv, oplen); /* copy valid option to buffer */ - buff[oplen] = '\0'; - return conv + oplen; /* return next item */ - } - } - luaL_argerror(L, 1, - lua_pushfstring(L, "invalid conversion specifier '%%%s'", conv)); - return conv; /* to avoid warnings */ -} - - -static time_t l_checktime (lua_State *L, int arg) { - l_timet t = l_gettime(L, arg); - luaL_argcheck(L, (time_t)t == t, arg, "time out-of-bounds"); - return (time_t)t; -} - - -/* maximum size for an individual 'strftime' item */ -#define SIZETIMEFMT 250 - - -static int os_date (lua_State *L) { - size_t slen; - const char *s = luaL_optlstring(L, 1, "%c", &slen); - time_t t = luaL_opt(L, l_checktime, 2, time(NULL)); - const char *se = s + slen; /* 's' end */ - struct tm tmr, *stm; - if (*s == '!') { /* UTC? */ - stm = l_gmtime(&t, &tmr); - s++; /* skip '!' */ - } - else - stm = l_localtime(&t, &tmr); - if (stm == NULL) /* invalid date? */ - return luaL_error(L, - "date result cannot be represented in this installation"); - if (strcmp(s, "*t") == 0) { - lua_createtable(L, 0, 9); /* 9 = number of fields */ - setallfields(L, stm); - } - else { - char cc[4]; /* buffer for individual conversion specifiers */ - luaL_Buffer b; - cc[0] = '%'; - luaL_buffinit(L, &b); - while (s < se) { - if (*s != '%') /* not a conversion specifier? */ - luaL_addchar(&b, *s++); - else { - size_t reslen; - char *buff = luaL_prepbuffsize(&b, SIZETIMEFMT); - s++; /* skip '%' */ - s = checkoption(L, s, se - s, cc + 1); /* copy specifier to 'cc' */ - reslen = strftime(buff, SIZETIMEFMT, cc, stm); - luaL_addsize(&b, reslen); - } - } - luaL_pushresult(&b); - } - return 1; -} - - -static int os_time (lua_State *L) { - time_t t; - if (lua_isnoneornil(L, 1)) /* called without args? */ - t = time(NULL); /* get current time */ - else { - struct tm ts; - luaL_checktype(L, 1, LUA_TTABLE); - lua_settop(L, 1); /* make sure table is at the top */ - ts.tm_year = getfield(L, "year", -1, 1900); - ts.tm_mon = getfield(L, "month", -1, 1); - ts.tm_mday = getfield(L, "day", -1, 0); - ts.tm_hour = getfield(L, "hour", 12, 0); - ts.tm_min = getfield(L, "min", 0, 0); - ts.tm_sec = getfield(L, "sec", 0, 0); - ts.tm_isdst = getboolfield(L, "isdst"); - t = mktime(&ts); - setallfields(L, &ts); /* update fields with normalized values */ - } - if (t != (time_t)(l_timet)t || t == (time_t)(-1)) - return luaL_error(L, - "time result cannot be represented in this installation"); - l_pushtime(L, t); - return 1; -} - - -static int os_difftime (lua_State *L) { - time_t t1 = l_checktime(L, 1); - time_t t2 = l_checktime(L, 2); - lua_pushnumber(L, (lua_Number)difftime(t1, t2)); - return 1; -} - -/* }====================================================== */ - - -static int os_setlocale (lua_State *L) { - static const int cat[] = {LC_ALL, LC_COLLATE, LC_CTYPE, LC_MONETARY, - LC_NUMERIC, LC_TIME}; - static const char *const catnames[] = {"all", "collate", "ctype", "monetary", - "numeric", "time", NULL}; - const char *l = luaL_optstring(L, 1, NULL); - int op = luaL_checkoption(L, 2, "all", catnames); - lua_pushstring(L, setlocale(cat[op], l)); - return 1; -} - - -static int os_exit (lua_State *L) { - int status; - if (lua_isboolean(L, 1)) - status = (lua_toboolean(L, 1) ? EXIT_SUCCESS : EXIT_FAILURE); - else - status = (int)luaL_optinteger(L, 1, EXIT_SUCCESS); - if (lua_toboolean(L, 2)) - lua_close(L); - if (L) exit(status); /* 'if' to avoid warnings for unreachable 'return' */ - return 0; -} - - -static const luaL_Reg syslib[] = { - {"clock", os_clock}, - {"date", os_date}, - {"difftime", os_difftime}, - {"execute", os_execute}, - {"exit", os_exit}, - {"getenv", os_getenv}, - {"remove", os_remove}, - {"rename", os_rename}, - {"setlocale", os_setlocale}, - {"time", os_time}, - {"tmpname", os_tmpname}, - {NULL, NULL} -}; - -/* }====================================================== */ - - - -LUAMOD_API int luaopen_os (lua_State *L) { - luaL_newlib(L, syslib); - return 1; -} - diff --git a/lua-5.4.4/src/lparser.c b/lua-5.4.4/src/lparser.c deleted file mode 100644 index 3abe3d7..0000000 --- a/lua-5.4.4/src/lparser.c +++ /dev/null @@ -1,1966 +0,0 @@ -/* -** $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 */ - codestring(&key, varname); /* key is variable name */ - luaK_indexed(fs, var, &key); /* env[varname] */ - } -} - - -/* -** Adjust the number of results from an expression list 'e' with 'nexps' -** expressions to 'nvars' values. -*/ -static void adjust_assign (LexState *ls, int nvars, int nexps, expdesc *e) { - FuncState *fs = ls->fs; - int needed = nvars - nexps; /* extra values needed */ - if (hasmultret(e->k)) { /* last expression has multiple returns? */ - int extra = needed + 1; /* discount last expression itself */ - if (extra < 0) - extra = 0; - luaK_setreturns(fs, e, extra); /* last exp. provides the difference */ - } - else { - if (e->k != VVOID) /* at least one expression? */ - luaK_exp2nextreg(fs, e); /* close last expression */ - if (needed > 0) /* missing values? */ - luaK_nil(fs, fs->freereg, needed); /* complete with nils */ - } - if (needed > 0) - luaK_reserveregs(fs, needed); /* registers for extra values */ - else /* adding 'needed' is actually a subtraction */ - fs->freereg += needed; /* remove extra values */ -} - - -#define enterlevel(ls) luaE_incCstack(ls->L) - - -#define leavelevel(ls) ((ls)->L->nCcalls--) - - -/* -** Generates an error that a goto jumps into the scope of some -** local variable. -*/ -static l_noret jumpscopeerror (LexState *ls, Labeldesc *gt) { - const char *varname = getstr(getlocalvardesc(ls->fs, gt->nactvar)->vd.name); - const char *msg = " at line %d jumps into the scope of local '%s'"; - msg = luaO_pushfstring(ls->L, msg, getstr(gt->name), gt->line, varname); - luaK_semerror(ls, msg); /* raise the error */ -} - - -/* -** Solves the goto at index 'g' to given 'label' and removes it -** from the list of pending goto's. -** If it jumps into the scope of some variable, raises an error. -*/ -static void solvegoto (LexState *ls, int g, Labeldesc *label) { - int i; - Labellist *gl = &ls->dyd->gt; /* list of goto's */ - Labeldesc *gt = &gl->arr[g]; /* goto to be resolved */ - lua_assert(eqstr(gt->name, label->name)); - if (l_unlikely(gt->nactvar < label->nactvar)) /* enter some scope? */ - jumpscopeerror(ls, gt); - luaK_patchlist(ls->fs, gt->pc, label->pc); - for (i = g; i < gl->n - 1; i++) /* remove goto from pending list */ - gl->arr[i] = gl->arr[i + 1]; - gl->n--; -} - - -/* -** Search for an active label with the given name. -*/ -static Labeldesc *findlabel (LexState *ls, TString *name) { - int i; - Dyndata *dyd = ls->dyd; - /* check labels in current function for a match */ - for (i = ls->fs->firstlabel; i < dyd->label.n; i++) { - Labeldesc *lb = &dyd->label.arr[i]; - if (eqstr(lb->name, name)) /* correct label? */ - return lb; - } - return NULL; /* label not found */ -} - - -/* -** Adds a new label/goto in the corresponding list. -*/ -static int newlabelentry (LexState *ls, Labellist *l, TString *name, - int line, int pc) { - int n = l->n; - luaM_growvector(ls->L, l->arr, n, l->size, - Labeldesc, SHRT_MAX, "labels/gotos"); - l->arr[n].name = name; - l->arr[n].line = line; - l->arr[n].nactvar = ls->fs->nactvar; - l->arr[n].close = 0; - l->arr[n].pc = pc; - l->n = n + 1; - return n; -} - - -static int newgotoentry (LexState *ls, TString *name, int line, int pc) { - return newlabelentry(ls, &ls->dyd->gt, name, line, pc); -} - - -/* -** Solves forward jumps. Check whether new label 'lb' matches any -** pending gotos in current block and solves them. Return true -** if any of the goto's need to close upvalues. -*/ -static int solvegotos (LexState *ls, Labeldesc *lb) { - Labellist *gl = &ls->dyd->gt; - int i = ls->fs->bl->firstgoto; - int needsclose = 0; - while (i < gl->n) { - if (eqstr(gl->arr[i].name, lb->name)) { - needsclose |= gl->arr[i].close; - solvegoto(ls, i, lb); /* will remove 'i' from the list */ - } - else - i++; - } - return needsclose; -} - - -/* -** Create a new label with the given 'name' at the given 'line'. -** 'last' tells whether label is the last non-op statement in its -** block. Solves all pending goto's to this new label and adds -** a close instruction if necessary. -** Returns true iff it added a close instruction. -*/ -static int createlabel (LexState *ls, TString *name, int line, - int last) { - FuncState *fs = ls->fs; - Labellist *ll = &ls->dyd->label; - int l = newlabelentry(ls, ll, name, line, luaK_getlabel(fs)); - if (last) { /* label is last no-op statement in the block? */ - /* assume that locals are already out of scope */ - ll->arr[l].nactvar = fs->bl->nactvar; - } - if (solvegotos(ls, &ll->arr[l])) { /* need close? */ - luaK_codeABC(fs, OP_CLOSE, luaY_nvarstack(fs), 0, 0); - return 1; - } - return 0; -} - - -/* -** Adjust pending gotos to outer level of a block. -*/ -static void movegotosout (FuncState *fs, BlockCnt *bl) { - int i; - Labellist *gl = &fs->ls->dyd->gt; - /* correct pending gotos to current block */ - for (i = bl->firstgoto; i < gl->n; i++) { /* for each pending goto */ - Labeldesc *gt = &gl->arr[i]; - /* leaving a variable scope? */ - if (reglevel(fs, gt->nactvar) > reglevel(fs, bl->nactvar)) - gt->close |= bl->upval; /* jump may need a close */ - gt->nactvar = bl->nactvar; /* update goto level */ - } -} - - -static void enterblock (FuncState *fs, BlockCnt *bl, lu_byte isloop) { - bl->isloop = isloop; - bl->nactvar = fs->nactvar; - bl->firstlabel = fs->ls->dyd->label.n; - bl->firstgoto = fs->ls->dyd->gt.n; - bl->upval = 0; - bl->insidetbc = (fs->bl != NULL && fs->bl->insidetbc); - bl->previous = fs->bl; - fs->bl = bl; - lua_assert(fs->freereg == luaY_nvarstack(fs)); -} - - -/* -** generates an error for an undefined 'goto'. -*/ -static l_noret undefgoto (LexState *ls, Labeldesc *gt) { - const char *msg; - if (eqstr(gt->name, luaS_newliteral(ls->L, "break"))) { - msg = "break outside loop at line %d"; - msg = luaO_pushfstring(ls->L, msg, gt->line); - } - else { - msg = "no visible label '%s' for at line %d"; - msg = luaO_pushfstring(ls->L, msg, getstr(gt->name), gt->line); - } - luaK_semerror(ls, msg); -} - - -static void leaveblock (FuncState *fs) { - BlockCnt *bl = fs->bl; - LexState *ls = fs->ls; - int hasclose = 0; - int stklevel = reglevel(fs, bl->nactvar); /* level outside the block */ - if (bl->isloop) /* fix pending breaks? */ - hasclose = createlabel(ls, luaS_newliteral(ls->L, "break"), 0, 0); - if (!hasclose && bl->previous && bl->upval) - luaK_codeABC(fs, OP_CLOSE, stklevel, 0, 0); - fs->bl = bl->previous; - removevars(fs, bl->nactvar); - lua_assert(bl->nactvar == fs->nactvar); - fs->freereg = stklevel; /* free registers */ - ls->dyd->label.n = bl->firstlabel; /* remove local labels */ - if (bl->previous) /* inner block? */ - movegotosout(fs, bl); /* update pending gotos to outer block */ - else { - if (bl->firstgoto < ls->dyd->gt.n) /* pending gotos in outer block? */ - undefgoto(ls, &ls->dyd->gt.arr[bl->firstgoto]); /* error */ - } -} - - -/* -** adds a new prototype into list of prototypes -*/ -static Proto *addprototype (LexState *ls) { - Proto *clp; - lua_State *L = ls->L; - FuncState *fs = ls->fs; - Proto *f = fs->f; /* prototype of current function */ - if (fs->np >= f->sizep) { - int oldsize = f->sizep; - luaM_growvector(L, f->p, fs->np, f->sizep, Proto *, MAXARG_Bx, "functions"); - while (oldsize < f->sizep) - f->p[oldsize++] = NULL; - } - f->p[fs->np++] = clp = luaF_newproto(L); - luaC_objbarrier(L, f, clp); - return clp; -} - - -/* -** codes instruction to create new closure in parent function. -** The OP_CLOSURE instruction uses the last available register, -** so that, if it invokes the GC, the GC knows which registers -** are in use at that time. - -*/ -static void codeclosure (LexState *ls, expdesc *v) { - FuncState *fs = ls->fs->prev; - init_exp(v, VRELOC, luaK_codeABx(fs, OP_CLOSURE, 0, fs->np - 1)); - luaK_exp2nextreg(fs, v); /* fix it at the last register */ -} - - -static void open_func (LexState *ls, FuncState *fs, BlockCnt *bl) { - Proto *f = fs->f; - fs->prev = ls->fs; /* linked list of funcstates */ - fs->ls = ls; - ls->fs = fs; - fs->pc = 0; - fs->previousline = f->linedefined; - fs->iwthabs = 0; - fs->lasttarget = 0; - fs->freereg = 0; - fs->nk = 0; - fs->nabslineinfo = 0; - fs->np = 0; - fs->nups = 0; - fs->ndebugvars = 0; - fs->nactvar = 0; - fs->needclose = 0; - fs->firstlocal = ls->dyd->actvar.n; - fs->firstlabel = ls->dyd->label.n; - fs->bl = NULL; - f->source = ls->source; - luaC_objbarrier(ls->L, f, f->source); - f->maxstacksize = 2; /* registers 0/1 are always valid */ - enterblock(fs, bl, 0); -} - - -static void close_func (LexState *ls) { - lua_State *L = ls->L; - FuncState *fs = ls->fs; - Proto *f = fs->f; - luaK_ret(fs, luaY_nvarstack(fs), 0); /* final return */ - leaveblock(fs); - lua_assert(fs->bl == NULL); - luaK_finish(fs); - luaM_shrinkvector(L, f->code, f->sizecode, fs->pc, Instruction); - luaM_shrinkvector(L, f->lineinfo, f->sizelineinfo, fs->pc, ls_byte); - luaM_shrinkvector(L, f->abslineinfo, f->sizeabslineinfo, - fs->nabslineinfo, AbsLineInfo); - luaM_shrinkvector(L, f->k, f->sizek, fs->nk, TValue); - luaM_shrinkvector(L, f->p, f->sizep, fs->np, Proto *); - luaM_shrinkvector(L, f->locvars, f->sizelocvars, fs->ndebugvars, LocVar); - luaM_shrinkvector(L, f->upvalues, f->sizeupvalues, fs->nups, Upvaldesc); - ls->fs = fs->prev; - luaC_checkGC(L); -} - - - -/*============================================================*/ -/* GRAMMAR RULES */ -/*============================================================*/ - - -/* -** check whether current token is in the follow set of a block. -** 'until' closes syntactical blocks, but do not close scope, -** so it is handled in separate. -*/ -static int block_follow (LexState *ls, int withuntil) { - switch (ls->t.token) { - case TK_ELSE: case TK_ELSEIF: - case TK_END: case TK_EOS: - return 1; - case TK_UNTIL: return withuntil; - default: return 0; - } -} - - -static void statlist (LexState *ls) { - /* statlist -> { stat [';'] } */ - while (!block_follow(ls, 1)) { - if (ls->t.token == TK_RETURN) { - statement(ls); - return; /* 'return' must be last statement */ - } - statement(ls); - } -} - - -static void fieldsel (LexState *ls, expdesc *v) { - /* fieldsel -> ['.' | ':'] NAME */ - FuncState *fs = ls->fs; - expdesc key; - luaK_exp2anyregup(fs, v); - luaX_next(ls); /* skip the dot or colon */ - codename(ls, &key); - luaK_indexed(fs, v, &key); -} - - -static void yindex (LexState *ls, expdesc *v) { - /* index -> '[' expr ']' */ - luaX_next(ls); /* skip the '[' */ - expr(ls, v); - luaK_exp2val(ls->fs, v); - checknext(ls, ']'); -} - - -/* -** {====================================================================== -** Rules for Constructors -** ======================================================================= -*/ - - -typedef struct ConsControl { - expdesc v; /* last list item read */ - expdesc *t; /* table descriptor */ - int nh; /* total number of 'record' elements */ - int na; /* number of array elements already stored */ - int tostore; /* number of array elements pending to be stored */ -} ConsControl; - - -static void recfield (LexState *ls, ConsControl *cc) { - /* recfield -> (NAME | '['exp']') = exp */ - FuncState *fs = ls->fs; - int reg = ls->fs->freereg; - expdesc tab, key, val; - if (ls->t.token == TK_NAME) { - checklimit(fs, cc->nh, MAX_INT, "items in a constructor"); - codename(ls, &key); - } - else /* ls->t.token == '[' */ - yindex(ls, &key); - cc->nh++; - checknext(ls, '='); - tab = *cc->t; - luaK_indexed(fs, &tab, &key); - expr(ls, &val); - luaK_storevar(fs, &tab, &val); - fs->freereg = reg; /* free registers */ -} - - -static void closelistfield (FuncState *fs, ConsControl *cc) { - if (cc->v.k == VVOID) return; /* there is no list item */ - luaK_exp2nextreg(fs, &cc->v); - cc->v.k = VVOID; - if (cc->tostore == LFIELDS_PER_FLUSH) { - luaK_setlist(fs, cc->t->u.info, cc->na, cc->tostore); /* flush */ - cc->na += cc->tostore; - cc->tostore = 0; /* no more items pending */ - } -} - - -static void lastlistfield (FuncState *fs, ConsControl *cc) { - if (cc->tostore == 0) return; - if (hasmultret(cc->v.k)) { - luaK_setmultret(fs, &cc->v); - luaK_setlist(fs, cc->t->u.info, cc->na, LUA_MULTRET); - cc->na--; /* do not count last expression (unknown number of elements) */ - } - else { - if (cc->v.k != VVOID) - luaK_exp2nextreg(fs, &cc->v); - luaK_setlist(fs, cc->t->u.info, cc->na, cc->tostore); - } - cc->na += cc->tostore; -} - - -static void listfield (LexState *ls, ConsControl *cc) { - /* listfield -> exp */ - expr(ls, &cc->v); - cc->tostore++; -} - - -static void field (LexState *ls, ConsControl *cc) { - /* field -> listfield | recfield */ - switch(ls->t.token) { - case TK_NAME: { /* may be 'listfield' or 'recfield' */ - if (luaX_lookahead(ls) != '=') /* expression? */ - listfield(ls, cc); - else - recfield(ls, cc); - break; - } - case '[': { - recfield(ls, cc); - break; - } - default: { - listfield(ls, cc); - break; - } - } -} - - -static void constructor (LexState *ls, expdesc *t) { - /* constructor -> '{' [ field { sep field } [sep] ] '}' - sep -> ',' | ';' */ - FuncState *fs = ls->fs; - int line = ls->linenumber; - int pc = luaK_codeABC(fs, OP_NEWTABLE, 0, 0, 0); - ConsControl cc; - luaK_code(fs, 0); /* space for extra arg. */ - cc.na = cc.nh = cc.tostore = 0; - cc.t = t; - init_exp(t, VNONRELOC, fs->freereg); /* table will be at stack top */ - luaK_reserveregs(fs, 1); - init_exp(&cc.v, VVOID, 0); /* no value (yet) */ - checknext(ls, '{'); - do { - lua_assert(cc.v.k == VVOID || cc.tostore > 0); - if (ls->t.token == '}') break; - closelistfield(fs, &cc); - field(ls, &cc); - } while (testnext(ls, ',') || testnext(ls, ';')); - check_match(ls, '}', '{', line); - lastlistfield(fs, &cc); - luaK_settablesize(fs, pc, t->u.info, cc.na, cc.nh); -} - -/* }====================================================================== */ - - -static void setvararg (FuncState *fs, int nparams) { - fs->f->is_vararg = 1; - luaK_codeABC(fs, OP_VARARGPREP, nparams, 0, 0); -} - - -static void parlist (LexState *ls) { - /* parlist -> [ {NAME ','} (NAME | '...') ] */ - FuncState *fs = ls->fs; - Proto *f = fs->f; - int nparams = 0; - int isvararg = 0; - if (ls->t.token != ')') { /* is 'parlist' not empty? */ - do { - switch (ls->t.token) { - case TK_NAME: { - new_localvar(ls, str_checkname(ls)); - nparams++; - break; - } - case TK_DOTS: { - luaX_next(ls); - isvararg = 1; - break; - } - default: luaX_syntaxerror(ls, " or '...' expected"); - } - } while (!isvararg && testnext(ls, ',')); - } - adjustlocalvars(ls, nparams); - f->numparams = cast_byte(fs->nactvar); - if (isvararg) - setvararg(fs, f->numparams); /* declared vararg */ - luaK_reserveregs(fs, fs->nactvar); /* reserve registers for parameters */ -} - - -static void body (LexState *ls, expdesc *e, int ismethod, int line) { - /* body -> '(' parlist ')' block END */ - FuncState new_fs; - BlockCnt bl; - new_fs.f = addprototype(ls); - new_fs.f->linedefined = line; - open_func(ls, &new_fs, &bl); - checknext(ls, '('); - if (ismethod) { - new_localvarliteral(ls, "self"); /* create 'self' parameter */ - adjustlocalvars(ls, 1); - } - parlist(ls); - checknext(ls, ')'); - statlist(ls); - new_fs.f->lastlinedefined = ls->linenumber; - check_match(ls, TK_END, TK_FUNCTION, line); - codeclosure(ls, e); - close_func(ls); -} - - -static int explist (LexState *ls, expdesc *v) { - /* explist -> expr { ',' expr } */ - int n = 1; /* at least one expression */ - expr(ls, v); - while (testnext(ls, ',')) { - luaK_exp2nextreg(ls->fs, v); - expr(ls, v); - n++; - } - return n; -} - - -static void funcargs (LexState *ls, expdesc *f, int line) { - FuncState *fs = ls->fs; - expdesc args; - int base, nparams; - switch (ls->t.token) { - case '(': { /* funcargs -> '(' [ explist ] ')' */ - luaX_next(ls); - if (ls->t.token == ')') /* arg list is empty? */ - args.k = VVOID; - else { - explist(ls, &args); - if (hasmultret(args.k)) - luaK_setmultret(fs, &args); - } - check_match(ls, ')', '(', line); - break; - } - case '{': { /* funcargs -> constructor */ - constructor(ls, &args); - break; - } - case TK_STRING: { /* funcargs -> STRING */ - codestring(&args, ls->t.seminfo.ts); - luaX_next(ls); /* must use 'seminfo' before 'next' */ - break; - } - default: { - luaX_syntaxerror(ls, "function arguments expected"); - } - } - lua_assert(f->k == VNONRELOC); - base = f->u.info; /* base register for call */ - if (hasmultret(args.k)) - nparams = LUA_MULTRET; /* open call */ - else { - if (args.k != VVOID) - luaK_exp2nextreg(fs, &args); /* close last argument */ - nparams = fs->freereg - (base+1); - } - init_exp(f, VCALL, luaK_codeABC(fs, OP_CALL, base, nparams+1, 2)); - luaK_fixline(fs, line); - fs->freereg = base+1; /* call remove function and arguments and leaves - (unless changed) one result */ -} - - - - -/* -** {====================================================================== -** Expression parsing -** ======================================================================= -*/ - - -static void primaryexp (LexState *ls, expdesc *v) { - /* primaryexp -> NAME | '(' expr ')' */ - switch (ls->t.token) { - case '(': { - int line = ls->linenumber; - luaX_next(ls); - expr(ls, v); - check_match(ls, ')', '(', line); - luaK_dischargevars(ls->fs, v); - return; - } - case TK_NAME: { - singlevar(ls, v); - return; - } - default: { - luaX_syntaxerror(ls, "unexpected symbol"); - } - } -} - - -static void suffixedexp (LexState *ls, expdesc *v) { - /* suffixedexp -> - primaryexp { '.' NAME | '[' exp ']' | ':' NAME funcargs | funcargs } */ - FuncState *fs = ls->fs; - int line = ls->linenumber; - primaryexp(ls, v); - for (;;) { - switch (ls->t.token) { - case '.': { /* fieldsel */ - fieldsel(ls, v); - break; - } - case '[': { /* '[' exp ']' */ - expdesc key; - luaK_exp2anyregup(fs, v); - yindex(ls, &key); - luaK_indexed(fs, v, &key); - break; - } - case ':': { /* ':' NAME funcargs */ - expdesc key; - luaX_next(ls); - codename(ls, &key); - luaK_self(fs, v, &key); - funcargs(ls, v, line); - break; - } - case '(': case TK_STRING: case '{': { /* funcargs */ - luaK_exp2nextreg(fs, v); - funcargs(ls, v, line); - break; - } - default: return; - } - } -} - - -static void simpleexp (LexState *ls, expdesc *v) { - /* simpleexp -> FLT | INT | STRING | NIL | TRUE | FALSE | ... | - constructor | FUNCTION body | suffixedexp */ - switch (ls->t.token) { - case TK_FLT: { - init_exp(v, VKFLT, 0); - v->u.nval = ls->t.seminfo.r; - break; - } - case TK_INT: { - init_exp(v, VKINT, 0); - v->u.ival = ls->t.seminfo.i; - break; - } - case TK_STRING: { - codestring(v, ls->t.seminfo.ts); - break; - } - case TK_NIL: { - init_exp(v, VNIL, 0); - break; - } - case TK_TRUE: { - init_exp(v, VTRUE, 0); - break; - } - case TK_FALSE: { - init_exp(v, VFALSE, 0); - break; - } - case TK_DOTS: { /* vararg */ - FuncState *fs = ls->fs; - check_condition(ls, fs->f->is_vararg, - "cannot use '...' outside a vararg function"); - init_exp(v, VVARARG, luaK_codeABC(fs, OP_VARARG, 0, 0, 1)); - break; - } - case '{': { /* constructor */ - constructor(ls, v); - return; - } - case TK_FUNCTION: { - luaX_next(ls); - body(ls, v, 0, ls->linenumber); - return; - } - default: { - suffixedexp(ls, v); - return; - } - } - luaX_next(ls); -} - - -static UnOpr getunopr (int op) { - switch (op) { - case TK_NOT: return OPR_NOT; - case '-': return OPR_MINUS; - case '~': return OPR_BNOT; - case '#': return OPR_LEN; - default: return OPR_NOUNOPR; - } -} - - -static BinOpr getbinopr (int op) { - switch (op) { - case '+': return OPR_ADD; - case '-': return OPR_SUB; - case '*': return OPR_MUL; - case '%': return OPR_MOD; - case '^': return OPR_POW; - case '/': return OPR_DIV; - case TK_IDIV: return OPR_IDIV; - case '&': return OPR_BAND; - case '|': return OPR_BOR; - case '~': return OPR_BXOR; - case TK_SHL: return OPR_SHL; - case TK_SHR: return OPR_SHR; - case TK_CONCAT: return OPR_CONCAT; - case TK_NE: return OPR_NE; - case TK_EQ: return OPR_EQ; - case '<': return OPR_LT; - case TK_LE: return OPR_LE; - case '>': return OPR_GT; - case TK_GE: return OPR_GE; - case TK_AND: return OPR_AND; - case TK_OR: return OPR_OR; - default: return OPR_NOBINOPR; - } -} - - -/* -** Priority table for binary operators. -*/ -static const struct { - lu_byte left; /* left priority for each binary operator */ - lu_byte right; /* right priority */ -} priority[] = { /* ORDER OPR */ - {10, 10}, {10, 10}, /* '+' '-' */ - {11, 11}, {11, 11}, /* '*' '%' */ - {14, 13}, /* '^' (right associative) */ - {11, 11}, {11, 11}, /* '/' '//' */ - {6, 6}, {4, 4}, {5, 5}, /* '&' '|' '~' */ - {7, 7}, {7, 7}, /* '<<' '>>' */ - {9, 8}, /* '..' (right associative) */ - {3, 3}, {3, 3}, {3, 3}, /* ==, <, <= */ - {3, 3}, {3, 3}, {3, 3}, /* ~=, >, >= */ - {2, 2}, {1, 1} /* and, or */ -}; - -#define UNARY_PRIORITY 12 /* priority for unary operators */ - - -/* -** subexpr -> (simpleexp | unop subexpr) { binop subexpr } -** where 'binop' is any binary operator with a priority higher than 'limit' -*/ -static BinOpr subexpr (LexState *ls, expdesc *v, int limit) { - BinOpr op; - UnOpr uop; - enterlevel(ls); - uop = getunopr(ls->t.token); - if (uop != OPR_NOUNOPR) { /* prefix (unary) operator? */ - int line = ls->linenumber; - luaX_next(ls); /* skip operator */ - subexpr(ls, v, UNARY_PRIORITY); - luaK_prefix(ls->fs, uop, v, line); - } - else simpleexp(ls, v); - /* expand while operators have priorities higher than 'limit' */ - op = getbinopr(ls->t.token); - while (op != OPR_NOBINOPR && priority[op].left > limit) { - expdesc v2; - BinOpr nextop; - int line = ls->linenumber; - luaX_next(ls); /* skip operator */ - luaK_infix(ls->fs, op, v); - /* read sub-expression with higher priority */ - nextop = subexpr(ls, &v2, priority[op].right); - luaK_posfix(ls->fs, op, v, &v2, line); - op = nextop; - } - leavelevel(ls); - return op; /* return first untreated operator */ -} - - -static void expr (LexState *ls, expdesc *v) { - subexpr(ls, v, 0); -} - -/* }==================================================================== */ - - - -/* -** {====================================================================== -** Rules for Statements -** ======================================================================= -*/ - - -static void block (LexState *ls) { - /* block -> statlist */ - FuncState *fs = ls->fs; - BlockCnt bl; - enterblock(fs, &bl, 0); - statlist(ls); - leaveblock(fs); -} - - -/* -** structure to chain all variables in the left-hand side of an -** assignment -*/ -struct LHS_assign { - struct LHS_assign *prev; - expdesc v; /* variable (global, local, upvalue, or indexed) */ -}; - - -/* -** check whether, in an assignment to an upvalue/local variable, the -** upvalue/local variable is begin used in a previous assignment to a -** table. If so, save original upvalue/local value in a safe place and -** use this safe copy in the previous assignment. -*/ -static void check_conflict (LexState *ls, struct LHS_assign *lh, expdesc *v) { - FuncState *fs = ls->fs; - int extra = fs->freereg; /* eventual position to save local variable */ - int conflict = 0; - for (; lh; lh = lh->prev) { /* check all previous assignments */ - if (vkisindexed(lh->v.k)) { /* assignment to table field? */ - if (lh->v.k == VINDEXUP) { /* is table an upvalue? */ - if (v->k == VUPVAL && lh->v.u.ind.t == v->u.info) { - conflict = 1; /* table is the upvalue being assigned now */ - lh->v.k = VINDEXSTR; - lh->v.u.ind.t = extra; /* assignment will use safe copy */ - } - } - else { /* table is a register */ - if (v->k == VLOCAL && lh->v.u.ind.t == v->u.var.ridx) { - conflict = 1; /* table is the local being assigned now */ - lh->v.u.ind.t = extra; /* assignment will use safe copy */ - } - /* is index the local being assigned? */ - if (lh->v.k == VINDEXED && v->k == VLOCAL && - lh->v.u.ind.idx == v->u.var.ridx) { - conflict = 1; - lh->v.u.ind.idx = extra; /* previous assignment will use safe copy */ - } - } - } - } - if (conflict) { - /* copy upvalue/local value to a temporary (in position 'extra') */ - if (v->k == VLOCAL) - luaK_codeABC(fs, OP_MOVE, extra, v->u.var.ridx, 0); - else - luaK_codeABC(fs, OP_GETUPVAL, extra, v->u.info, 0); - luaK_reserveregs(fs, 1); - } -} - -/* -** Parse and compile a multiple assignment. The first "variable" -** (a 'suffixedexp') was already read by the caller. -** -** assignment -> suffixedexp restassign -** restassign -> ',' suffixedexp restassign | '=' explist -*/ -static void restassign (LexState *ls, struct LHS_assign *lh, int nvars) { - expdesc e; - check_condition(ls, vkisvar(lh->v.k), "syntax error"); - check_readonly(ls, &lh->v); - if (testnext(ls, ',')) { /* restassign -> ',' suffixedexp restassign */ - struct LHS_assign nv; - nv.prev = lh; - suffixedexp(ls, &nv.v); - if (!vkisindexed(nv.v.k)) - check_conflict(ls, lh, &nv.v); - enterlevel(ls); /* control recursion depth */ - restassign(ls, &nv, nvars+1); - leavelevel(ls); - } - else { /* restassign -> '=' explist */ - int nexps; - checknext(ls, '='); - nexps = explist(ls, &e); - if (nexps != nvars) - adjust_assign(ls, nvars, nexps, &e); - else { - luaK_setoneret(ls->fs, &e); /* close last expression */ - luaK_storevar(ls->fs, &lh->v, &e); - return; /* avoid default */ - } - } - init_exp(&e, VNONRELOC, ls->fs->freereg-1); /* default assignment */ - luaK_storevar(ls->fs, &lh->v, &e); -} - - -static int cond (LexState *ls) { - /* cond -> exp */ - expdesc v; - expr(ls, &v); /* read condition */ - if (v.k == VNIL) v.k = VFALSE; /* 'falses' are all equal here */ - luaK_goiftrue(ls->fs, &v); - return v.f; -} - - -static void gotostat (LexState *ls) { - FuncState *fs = ls->fs; - int line = ls->linenumber; - TString *name = str_checkname(ls); /* label's name */ - Labeldesc *lb = findlabel(ls, name); - if (lb == NULL) /* no label? */ - /* forward jump; will be resolved when the label is declared */ - newgotoentry(ls, name, line, luaK_jump(fs)); - else { /* found a label */ - /* backward jump; will be resolved here */ - int lblevel = reglevel(fs, lb->nactvar); /* label level */ - if (luaY_nvarstack(fs) > lblevel) /* leaving the scope of a variable? */ - luaK_codeABC(fs, OP_CLOSE, lblevel, 0, 0); - /* create jump and link it to the label */ - luaK_patchlist(fs, luaK_jump(fs), lb->pc); - } -} - - -/* -** Break statement. Semantically equivalent to "goto break". -*/ -static void breakstat (LexState *ls) { - int line = ls->linenumber; - luaX_next(ls); /* skip break */ - newgotoentry(ls, luaS_newliteral(ls->L, "break"), line, luaK_jump(ls->fs)); -} - - -/* -** Check whether there is already a label with the given 'name'. -*/ -static void checkrepeated (LexState *ls, TString *name) { - Labeldesc *lb = findlabel(ls, name); - if (l_unlikely(lb != NULL)) { /* already defined? */ - const char *msg = "label '%s' already defined on line %d"; - msg = luaO_pushfstring(ls->L, msg, getstr(name), lb->line); - luaK_semerror(ls, msg); /* error */ - } -} - - -static void labelstat (LexState *ls, TString *name, int line) { - /* label -> '::' NAME '::' */ - checknext(ls, TK_DBCOLON); /* skip double colon */ - while (ls->t.token == ';' || ls->t.token == TK_DBCOLON) - statement(ls); /* skip other no-op statements */ - checkrepeated(ls, name); /* check for repeated labels */ - createlabel(ls, name, line, block_follow(ls, 0)); -} - - -static void whilestat (LexState *ls, int line) { - /* whilestat -> WHILE cond DO block END */ - FuncState *fs = ls->fs; - int whileinit; - int condexit; - BlockCnt bl; - luaX_next(ls); /* skip WHILE */ - whileinit = luaK_getlabel(fs); - condexit = cond(ls); - enterblock(fs, &bl, 1); - checknext(ls, TK_DO); - block(ls); - luaK_jumpto(fs, whileinit); - check_match(ls, TK_END, TK_WHILE, line); - leaveblock(fs); - luaK_patchtohere(fs, condexit); /* false conditions finish the loop */ -} - - -static void repeatstat (LexState *ls, int line) { - /* repeatstat -> REPEAT block UNTIL cond */ - int condexit; - FuncState *fs = ls->fs; - int repeat_init = luaK_getlabel(fs); - BlockCnt bl1, bl2; - enterblock(fs, &bl1, 1); /* loop block */ - enterblock(fs, &bl2, 0); /* scope block */ - luaX_next(ls); /* skip REPEAT */ - statlist(ls); - check_match(ls, TK_UNTIL, TK_REPEAT, line); - condexit = cond(ls); /* read condition (inside scope block) */ - leaveblock(fs); /* finish scope */ - if (bl2.upval) { /* upvalues? */ - int exit = luaK_jump(fs); /* normal exit must jump over fix */ - luaK_patchtohere(fs, condexit); /* repetition must close upvalues */ - luaK_codeABC(fs, OP_CLOSE, reglevel(fs, bl2.nactvar), 0, 0); - condexit = luaK_jump(fs); /* repeat after closing upvalues */ - luaK_patchtohere(fs, exit); /* normal exit comes to here */ - } - luaK_patchlist(fs, condexit, repeat_init); /* close the loop */ - leaveblock(fs); /* finish loop */ -} - - -/* -** Read an expression and generate code to put its results in next -** stack slot. -** -*/ -static void exp1 (LexState *ls) { - expdesc e; - expr(ls, &e); - luaK_exp2nextreg(ls->fs, &e); - lua_assert(e.k == VNONRELOC); -} - - -/* -** Fix for instruction at position 'pc' to jump to 'dest'. -** (Jump addresses are relative in Lua). 'back' true means -** a back jump. -*/ -static void fixforjump (FuncState *fs, int pc, int dest, int back) { - Instruction *jmp = &fs->f->code[pc]; - int offset = dest - (pc + 1); - if (back) - offset = -offset; - if (l_unlikely(offset > MAXARG_Bx)) - luaX_syntaxerror(fs->ls, "control structure too long"); - SETARG_Bx(*jmp, offset); -} - - -/* -** Generate code for a 'for' loop. -*/ -static void forbody (LexState *ls, int base, int line, int nvars, int isgen) { - /* forbody -> DO block */ - static const OpCode forprep[2] = {OP_FORPREP, OP_TFORPREP}; - static const OpCode forloop[2] = {OP_FORLOOP, OP_TFORLOOP}; - BlockCnt bl; - FuncState *fs = ls->fs; - int prep, endfor; - checknext(ls, TK_DO); - prep = luaK_codeABx(fs, forprep[isgen], base, 0); - enterblock(fs, &bl, 0); /* scope for declared variables */ - adjustlocalvars(ls, nvars); - luaK_reserveregs(fs, nvars); - block(ls); - leaveblock(fs); /* end of scope for declared variables */ - fixforjump(fs, prep, luaK_getlabel(fs), 0); - if (isgen) { /* generic for? */ - luaK_codeABC(fs, OP_TFORCALL, base, 0, nvars); - luaK_fixline(fs, line); - } - endfor = luaK_codeABx(fs, forloop[isgen], base, 0); - fixforjump(fs, endfor, prep + 1, 1); - luaK_fixline(fs, line); -} - - -static void fornum (LexState *ls, TString *varname, int line) { - /* fornum -> NAME = exp,exp[,exp] forbody */ - FuncState *fs = ls->fs; - int base = fs->freereg; - new_localvarliteral(ls, "(for state)"); - new_localvarliteral(ls, "(for state)"); - new_localvarliteral(ls, "(for state)"); - new_localvar(ls, varname); - checknext(ls, '='); - exp1(ls); /* initial value */ - checknext(ls, ','); - exp1(ls); /* limit */ - if (testnext(ls, ',')) - exp1(ls); /* optional step */ - else { /* default step = 1 */ - luaK_int(fs, fs->freereg, 1); - luaK_reserveregs(fs, 1); - } - adjustlocalvars(ls, 3); /* control variables */ - forbody(ls, base, line, 1, 0); -} - - -static void forlist (LexState *ls, TString *indexname) { - /* forlist -> NAME {,NAME} IN explist forbody */ - FuncState *fs = ls->fs; - expdesc e; - int nvars = 5; /* gen, state, control, toclose, 'indexname' */ - int line; - int base = fs->freereg; - /* create control variables */ - new_localvarliteral(ls, "(for state)"); - new_localvarliteral(ls, "(for state)"); - new_localvarliteral(ls, "(for state)"); - new_localvarliteral(ls, "(for state)"); - /* create declared variables */ - new_localvar(ls, indexname); - while (testnext(ls, ',')) { - new_localvar(ls, str_checkname(ls)); - nvars++; - } - checknext(ls, TK_IN); - line = ls->linenumber; - adjust_assign(ls, 4, explist(ls, &e), &e); - adjustlocalvars(ls, 4); /* control variables */ - 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, cl); /* anchor it (to avoid being collected) */ - luaD_inctop(L); - lexstate.h = luaH_new(L); /* create table for scanner */ - sethvalue2s(L, L->top, lexstate.h); /* anchor it */ - luaD_inctop(L); - funcstate.f = cl->p = luaF_newproto(L); - luaC_objbarrier(L, cl, cl->p); - funcstate.f->source = luaS_new(L, name); /* create and anchor TString */ - luaC_objbarrier(L, funcstate.f, funcstate.f->source); - lexstate.buff = buff; - lexstate.dyd = dyd; - dyd->actvar.n = dyd->gt.n = dyd->label.n = 0; - luaX_setinput(L, &lexstate, z, funcstate.f->source, firstchar); - mainfunc(&lexstate, &funcstate); - lua_assert(!funcstate.prev && funcstate.nups == 1 && !lexstate.fs); - /* all scopes should be correctly finished */ - lua_assert(dyd->actvar.n == 0 && dyd->gt.n == 0 && dyd->label.n == 0); - L->top--; /* remove scanner's table */ - return cl; /* closure is on the stack, too */ -} - diff --git a/lua-5.4.4/src/lparser.h b/lua-5.4.4/src/lparser.h deleted file mode 100644 index 5e4500f..0000000 --- a/lua-5.4.4/src/lparser.h +++ /dev/null @@ -1,171 +0,0 @@ -/* -** $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.4/src/lprefix.h b/lua-5.4.4/src/lprefix.h deleted file mode 100644 index 484f2ad..0000000 --- a/lua-5.4.4/src/lprefix.h +++ /dev/null @@ -1,45 +0,0 @@ -/* -** $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.4/src/lstate.c b/lua-5.4.4/src/lstate.c deleted file mode 100644 index 1ffe1a0..0000000 --- a/lua-5.4.4/src/lstate.c +++ /dev/null @@ -1,440 +0,0 @@ -/* -** $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 = luaM_newvector(L, BASIC_STACK_SIZE + EXTRA_STACK, StackValue); - L1->tbclist = L1->stack; - for (i = 0; i < BASIC_STACK_SIZE + EXTRA_STACK; i++) - setnilvalue(s2v(L1->stack + i)); /* erase new stack */ - L1->top = L1->stack; - L1->stack_last = L1->stack + BASIC_STACK_SIZE; - /* initialize first ci */ - ci = &L1->base_ci; - ci->next = ci->previous = NULL; - ci->callstatus = CIST_C; - ci->func = L1->top; - ci->u.c.k = NULL; - ci->nresults = 0; - setnilvalue(s2v(L1->top)); /* 'function' entry for this 'ci' */ - L1->top++; - ci->top = L1->top + LUA_MINSTACK; - L1->ci = ci; -} - - -static void freestack (lua_State *L) { - if (L->stack == NULL) - return; /* stack not completely built yet */ - L->ci = &L->base_ci; /* free the entire 'ci' list */ - luaE_freeCI(L); - lua_assert(L->nci == 0); - luaM_freearray(L, L->stack, stacksize(L) + EXTRA_STACK); /* free stack */ -} - - -/* -** Create registry table and its predefined values -*/ -static void init_registry (lua_State *L, global_State *g) { - /* create registry */ - Table *registry = luaH_new(L); - sethvalue(L, &g->l_registry, registry); - luaH_resize(L, registry, LUA_RIDX_LAST, 0); - /* registry[LUA_RIDX_MAINTHREAD] = L */ - setthvalue(L, ®istry->array[LUA_RIDX_MAINTHREAD - 1], L); - /* registry[LUA_RIDX_GLOBALS] = new table (table of globals) */ - sethvalue(L, ®istry->array[LUA_RIDX_GLOBALS - 1], luaH_new(L)); -} - - -/* -** open parts of the state that may cause memory-allocation errors. -*/ -static void f_luaopen (lua_State *L, void *ud) { - global_State *g = G(L); - UNUSED(ud); - stack_init(L, L); /* init stack */ - init_registry(L, g); - luaS_init(L); - luaT_init(L); - luaX_init(L); - g->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 = 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; - lua_State *L1; - lua_lock(L); - g = G(L); - luaC_checkGC(L); - /* create new thread */ - L1 = &cast(LX *, luaM_newobject(L, LUA_TTHREAD, sizeof(LX)))->l; - L1->marked = luaC_white(g); - L1->tt = LUA_VTHREAD; - /* link it on list 'allgc' */ - L1->next = g->allgc; - g->allgc = obj2gco(L1); - /* anchor it on L stack */ - setthvalue2s(L, L->top, L1); - api_incr_top(L); - preinit_thread(L1, g); - L1->hookmask = L->hookmask; - L1->basehookcount = L->basehookcount; - L1->hook = L->hook; - resethookcount(L1); - /* initialize L1 extra space */ - memcpy(lua_getextraspace(L1), lua_getextraspace(g->mainthread), - LUA_EXTRASPACE); - luai_userstatethread(L, L1); - stack_init(L1, L); /* init stack */ - lua_unlock(L); - return L1; -} - - -void luaE_freethread (lua_State *L, lua_State *L1) { - LX *l = fromstate(L1); - luaF_closeupval(L1, L1->stack); /* close all upvalues */ - lua_assert(L1->openupval == NULL); - luai_userstatefree(L, L1); - freestack(L1); - luaM_free(L, l); -} - - -int luaE_resetthread (lua_State *L, int status) { - CallInfo *ci = L->ci = &L->base_ci; /* unwind CallInfo list */ - setnilvalue(s2v(L->stack)); /* 'function' entry for basic 'ci' */ - ci->func = L->stack; - ci->callstatus = CIST_C; - if (status == LUA_YIELD) - status = LUA_OK; - 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 + 1); - else - L->top = L->stack + 1; - ci->top = L->top + LUA_MINSTACK; - luaD_reallocstack(L, cast_int(ci->top - L->stack), 0); - return status; -} - - -LUA_API int lua_resetthread (lua_State *L) { - int status; - lua_lock(L); - status = luaE_resetthread(L, L->status); - lua_unlock(L); - return status; -} - - -LUA_API lua_State *lua_newstate (lua_Alloc f, void *ud) { - int i; - lua_State *L; - global_State *g; - LG *l = cast(LG *, (*f)(ud, NULL, LUA_TTHREAD, sizeof(LG))); - if (l == NULL) return NULL; - L = &l->l.l; - g = &l->g; - L->tt = LUA_VTHREAD; - g->currentwhite = bitmask(WHITE0BIT); - L->marked = luaC_white(g); - preinit_thread(L, g); - g->allgc = obj2gco(L); /* by now, only object is the main thread */ - L->next = NULL; - incnny(L); /* main thread is always non yieldable */ - g->frealloc = f; - g->ud = ud; - g->warnf = NULL; - g->ud_warn = NULL; - g->mainthread = L; - g->seed = luai_makeseed(L); - g->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 - 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.4/src/lstate.h b/lua-5.4.4/src/lstate.h deleted file mode 100644 index 61e82cd..0000000 --- a/lua-5.4.4/src/lstate.h +++ /dev/null @@ -1,404 +0,0 @@ -/* -** $Id: lstate.h $ -** Global State -** See Copyright Notice in lua.h -*/ - -#ifndef lstate_h -#define lstate_h - -#include "lua.h" - -#include "lobject.h" -#include "ltm.h" -#include "lzio.h" - - -/* -** Some notes about garbage-collected objects: All objects in Lua must -** be kept somehow accessible until being freed, so all objects always -** belong to one (and only one) of these lists, using field 'next' of -** the 'CommonHeader' for the link: -** -** 'allgc': all objects not marked for finalization; -** 'finobj': all objects marked for finalization; -** 'tobefnz': all objects ready to be finalized; -** 'fixedgc': all objects that are not to be collected (currently -** only small strings, such as reserved words). -** -** For the generational collector, some of these lists have marks for -** generations. Each mark points to the first element in the list for -** that particular generation; that generation goes until the next mark. -** -** 'allgc' -> 'survival': new objects; -** 'survival' -> 'old': objects that survived one collection; -** 'old1' -> 'reallyold': objects that became old in last collection; -** 'reallyold' -> NULL: objects old for more than one cycle. -** -** 'finobj' -> 'finobjsur': new objects marked for finalization; -** 'finobjsur' -> 'finobjold1': survived """"; -** 'finobjold1' -> 'finobjrold': just old """"; -** 'finobjrold' -> NULL: really old """". -** -** All lists can contain elements older than their main ages, due -** to 'luaC_checkfinalizer' and 'udata2finalize', which move -** objects between the normal lists and the "marked for finalization" -** lists. Moreover, barriers can age young objects in young lists as -** OLD0, which then become OLD1. However, a list never contains -** elements younger than their main ages. -** -** The generational collector also uses a pointer 'firstold1', which -** points to the first OLD1 object in the list. It is used to optimize -** 'markold'. (Potentially OLD1 objects can be anywhere between 'allgc' -** and 'reallyold', but often the list has no OLD1 objects or they are -** after 'old1'.) Note the difference between it and 'old1': -** 'firstold1': no OLD1 objects before this point; there can be all -** ages after it. -** 'old1': no objects younger than OLD1 after this point. -*/ - -/* -** Moreover, there is another set of lists that control gray objects. -** These lists are linked by fields 'gclist'. (All objects that -** can become gray have such a field. The field is not the same -** in all objects, but it always has this name.) Any gray object -** must belong to one of these lists, and all objects in these lists -** must be gray (with two exceptions explained below): -** -** 'gray': regular gray objects, still waiting to be visited. -** 'grayagain': objects that must be revisited at the atomic phase. -** That includes -** - black objects got in a write barrier; -** - all kinds of weak tables during propagation phase; -** - all threads. -** 'weak': tables with weak values to be cleared; -** 'ephemeron': ephemeron tables with white->white entries; -** 'allweak': tables with weak keys and/or weak values to be cleared. -** -** The exceptions to that "gray rule" are: -** - TOUCHED2 objects in generational mode stay in a gray list (because -** they must be visited again at the end of the cycle), but they are -** marked black because assignments to them must activate barriers (to -** move them back to TOUCHED1). -** - Open upvales are kept gray to avoid barriers, but they stay out -** of gray lists. (They don't even have a 'gclist' field.) -*/ - - - -/* -** About 'nCcalls': This count has two parts: the lower 16 bits counts -** the number of recursive invocations in the C stack; the higher -** 16 bits counts the number of non-yieldable calls in the stack. -** (They are together so that we can change and save both with one -** instruction.) -*/ - - -/* true if this thread does not have non-yieldable calls in the stack */ -#define yieldable(L) (((L)->nCcalls & 0xffff0000) == 0) - -/* real number of C calls */ -#define getCcalls(L) ((L)->nCcalls & 0xffff) - - -/* Increment the number of non-yieldable calls */ -#define incnny(L) ((L)->nCcalls += 0x10000) - -/* Decrement the number of non-yieldable calls */ -#define decnny(L) ((L)->nCcalls -= 0x10000) - -/* Non-yieldable call increment */ -#define nyci (0x10000 | 1) - - - - -struct lua_longjmp; /* defined in ldo.c */ - - -/* -** Atomic type (relative to signals) to better ensure that 'lua_sethook' -** is thread safe -*/ -#if !defined(l_signalT) -#include -#define l_signalT sig_atomic_t -#endif - - -/* -** Extra stack space to handle TM calls and some other extras. This -** space is not included in 'stack_last'. It is used only to avoid stack -** checks, either because the element will be promptly popped or because -** there will be a stack check soon after the push. Function frames -** never use this extra space, so it does not need to be kept clean. -*/ -#define EXTRA_STACK 5 - - -#define BASIC_STACK_SIZE (2*LUA_MINSTACK) - -#define stacksize(th) cast_int((th)->stack_last - (th)->stack) - - -/* kinds of Garbage Collection */ -#define KGC_INC 0 /* incremental gc */ -#define KGC_GEN 1 /* generational gc */ - - -typedef struct stringtable { - TString **hash; - int nuse; /* number of elements */ - int size; -} stringtable; - - -/* -** Information about a call. -** About union 'u': -** - field 'l' is used only for Lua functions; -** - field 'c' is used only for C functions. -** About union 'u2': -** - field 'funcidx' is used only by C functions while doing a -** protected call; -** - field 'nyield' is used only while a function is "doing" an -** yield (from the yield until the next resume); -** - field 'nres' is used only while closing tbc variables when -** returning from a function; -** - field 'transferinfo' is used only during call/returnhooks, -** before the function starts or after it ends. -*/ -typedef struct CallInfo { - StkId func; /* function index in the stack */ - StkId top; /* top for this function */ - struct CallInfo *previous, *next; /* dynamic call link */ - union { - struct { /* only for Lua functions */ - const Instruction *savedpc; - volatile l_signalT trap; - int nextraargs; /* # of extra arguments in vararg functions */ - } l; - struct { /* only for C functions */ - lua_KFunction k; /* continuation in case of yields */ - ptrdiff_t old_errfunc; - lua_KContext ctx; /* context info. in case of yields */ - } c; - } u; - union { - int funcidx; /* called-function index */ - int nyield; /* number of values yielded */ - int nres; /* number of values returned */ - struct { /* info about transferred values (for call/return hooks) */ - unsigned short ftransfer; /* offset of first value transferred */ - unsigned short ntransfer; /* number of values transferred */ - } transferinfo; - } u2; - short nresults; /* expected number of results from this function */ - unsigned short callstatus; -} CallInfo; - - -/* -** Bits in CallInfo status -*/ -#define CIST_OAH (1<<0) /* original value of 'allowhook' */ -#define CIST_C (1<<1) /* call is running a C function */ -#define CIST_FRESH (1<<2) /* call is on a fresh "luaV_execute" frame */ -#define CIST_HOOKED (1<<3) /* call is running a debug hook */ -#define CIST_YPCALL (1<<4) /* doing a yieldable protected call */ -#define CIST_TAIL (1<<5) /* call was tail called */ -#define CIST_HOOKYIELD (1<<6) /* last hook called yielded */ -#define CIST_FIN (1<<7) /* 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_NUMTAGS]; /* metatables for basic types */ - TString *strcache[STRCACHE_N][STRCACHE_M]; /* cache for strings in API */ - lua_WarnFunction warnf; /* warning function */ - void *ud_warn; /* auxiliary data to 'warnf' */ -} global_State; - - -/* -** 'per thread' state -*/ -struct lua_State { - CommonHeader; - lu_byte status; - lu_byte allowhook; - unsigned short nci; /* number of items in 'ci' list */ - StkId top; /* first free slot in the stack */ - global_State *l_G; - CallInfo *ci; /* call info for current function */ - StkId stack_last; /* end of stack (last element + 1) */ - StkId stack; /* stack base */ - UpVal *openupval; /* list of open upvalues in this stack */ - StkId tbclist; /* list of to-be-closed variables */ - GCObject *gclist; - struct lua_State *twups; /* list of threads with open upvalues */ - struct lua_longjmp *errorJmp; /* current error recover point */ - CallInfo base_ci; /* CallInfo for first level (C calling Lua) */ - volatile lua_Hook hook; - ptrdiff_t errfunc; /* current error handling function (stack index) */ - l_uint32 nCcalls; /* number of nested (non-yieldable | C) calls */ - int oldpc; /* last pc traced */ - int basehookcount; - int hookcount; - volatile l_signalT hookmask; -}; - - -#define G(L) (L->l_G) - -/* -** 'g->nilvalue' being a nil value flags that the state was completely -** build. -*/ -#define completestate(g) ttisnil(&g->nilvalue) - - -/* -** Union of all collectable objects (only for conversions) -** ISO C99, 6.5.2.3 p.5: -** "if a union contains several structures that share a common initial -** sequence [...], and if the union object currently contains one -** of these structures, it is permitted to inspect the common initial -** part of any of them anywhere that a declaration of the complete type -** of the union is visible." -*/ -union GCUnion { - GCObject gc; /* common header */ - struct TString ts; - struct Udata u; - union Closure cl; - struct Table h; - struct Proto p; - struct lua_State th; /* thread */ - struct UpVal upv; -}; - - -/* -** ISO C99, 6.7.2.1 p.14: -** "A pointer to a union object, suitably converted, points to each of -** its members [...], and vice versa." -*/ -#define cast_u(o) cast(union GCUnion *, (o)) - -/* macros to convert a GCObject into a specific value */ -#define gco2ts(o) \ - check_exp(novariant((o)->tt) == LUA_TSTRING, &((cast_u(o))->ts)) -#define gco2u(o) check_exp((o)->tt == LUA_VUSERDATA, &((cast_u(o))->u)) -#define gco2lcl(o) check_exp((o)->tt == LUA_VLCL, &((cast_u(o))->cl.l)) -#define gco2ccl(o) check_exp((o)->tt == LUA_VCCL, &((cast_u(o))->cl.c)) -#define gco2cl(o) \ - check_exp(novariant((o)->tt) == LUA_TFUNCTION, &((cast_u(o))->cl)) -#define gco2t(o) check_exp((o)->tt == LUA_VTABLE, &((cast_u(o))->h)) -#define gco2p(o) check_exp((o)->tt == LUA_VPROTO, &((cast_u(o))->p)) -#define gco2th(o) check_exp((o)->tt == LUA_VTHREAD, &((cast_u(o))->th)) -#define gco2upv(o) check_exp((o)->tt == LUA_VUPVAL, &((cast_u(o))->upv)) - - -/* -** macro to convert a Lua object into a GCObject -** (The access to 'tt' tries to ensure that 'v' is actually a Lua object.) -*/ -#define obj2gco(v) check_exp((v)->tt >= LUA_TSTRING, &(cast_u(v)->gc)) - - -/* actual number of total bytes allocated */ -#define gettotalbytes(g) cast(lu_mem, (g)->totalbytes + (g)->GCdebt) - -LUAI_FUNC void luaE_setdebt (global_State *g, l_mem debt); -LUAI_FUNC void luaE_freethread (lua_State *L, lua_State *L1); -LUAI_FUNC CallInfo *luaE_extendCI (lua_State *L); -LUAI_FUNC void luaE_freeCI (lua_State *L); -LUAI_FUNC void luaE_shrinkCI (lua_State *L); -LUAI_FUNC void luaE_checkcstack (lua_State *L); -LUAI_FUNC void luaE_incCstack (lua_State *L); -LUAI_FUNC void luaE_warning (lua_State *L, const char *msg, int tocont); -LUAI_FUNC void luaE_warnerror (lua_State *L, const char *where); -LUAI_FUNC int luaE_resetthread (lua_State *L, int status); - - -#endif - diff --git a/lua-5.4.4/src/lstring.c b/lua-5.4.4/src/lstring.c deleted file mode 100644 index 13dcaf4..0000000 --- a/lua-5.4.4/src/lstring.c +++ /dev/null @@ -1,273 +0,0 @@ -/* -** $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.4/src/lstring.h b/lua-5.4.4/src/lstring.h deleted file mode 100644 index 450c239..0000000 --- a/lua-5.4.4/src/lstring.h +++ /dev/null @@ -1,57 +0,0 @@ -/* -** $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.4/src/lstrlib.c b/lua-5.4.4/src/lstrlib.c deleted file mode 100644 index 0b4fdbb..0000000 --- a/lua-5.4.4/src/lstrlib.c +++ /dev/null @@ -1,1874 +0,0 @@ -/* -** $Id: lstrlib.c $ -** Standard library for string operations and pattern-matching -** See Copyright Notice in lua.h -*/ - -#define lstrlib_c -#define LUA_LIB - -#include "lprefix.h" - - -#include -#include -#include -#include -#include -#include -#include -#include -#include - -#include "lua.h" - -#include "lauxlib.h" -#include "lualib.h" - - -/* -** maximum number of captures that a pattern can do during -** pattern-matching. This limit is arbitrary, but must fit in -** an unsigned char. -*/ -#if !defined(LUA_MAXCAPTURES) -#define LUA_MAXCAPTURES 32 -#endif - - -/* macro to 'unsign' a character */ -#define uchar(c) ((unsigned char)(c)) - - -/* -** Some sizes are better limited to fit in 'int', but must also fit in -** 'size_t'. (We assume that 'lua_Integer' cannot be smaller than 'int'.) -*/ -#define MAX_SIZET ((size_t)(~(size_t)0)) - -#define MAXSIZE \ - (sizeof(size_t) < sizeof(int) ? MAX_SIZET : (size_t)(INT_MAX)) - - - - -static int str_len (lua_State *L) { - size_t l; - luaL_checklstring(L, 1, &l); - lua_pushinteger(L, (lua_Integer)l); - return 1; -} - - -/* -** translate a relative initial string position -** (negative means back from end): clip result to [1, inf). -** The length of any string in Lua must fit in a lua_Integer, -** so there are no overflows in the casts. -** The inverted comparison avoids a possible overflow -** computing '-pos'. -*/ -static size_t posrelatI (lua_Integer pos, size_t len) { - if (pos > 0) - return (size_t)pos; - else if (pos == 0) - return 1; - else if (pos < -(lua_Integer)len) /* inverted comparison */ - return 1; /* clip to 1 */ - else return len + (size_t)pos + 1; -} - - -/* -** Gets an optional ending string position from argument 'arg', -** with default value 'def'. -** Negative means back from end: clip result to [0, len] -*/ -static size_t getendpos (lua_State *L, int arg, lua_Integer def, - size_t len) { - lua_Integer pos = luaL_optinteger(L, arg, def); - if (pos > (lua_Integer)len) - return len; - else if (pos >= 0) - return (size_t)pos; - else if (pos < -(lua_Integer)len) - return 0; - else return len + (size_t)pos + 1; -} - - -static int str_sub (lua_State *L) { - size_t l; - const char *s = luaL_checklstring(L, 1, &l); - size_t start = posrelatI(luaL_checkinteger(L, 2), l); - size_t end = getendpos(L, 3, -1, l); - if (start <= end) - lua_pushlstring(L, s + start - 1, (end - start) + 1); - else lua_pushliteral(L, ""); - return 1; -} - - -static int str_reverse (lua_State *L) { - size_t l, i; - luaL_Buffer b; - const char *s = luaL_checklstring(L, 1, &l); - char *p = luaL_buffinitsize(L, &b, l); - for (i = 0; i < l; i++) - p[i] = s[l - i - 1]; - luaL_pushresultsize(&b, l); - return 1; -} - - -static int str_lower (lua_State *L) { - size_t l; - size_t i; - luaL_Buffer b; - const char *s = luaL_checklstring(L, 1, &l); - char *p = luaL_buffinitsize(L, &b, l); - for (i=0; i MAXSIZE / n)) - return luaL_error(L, "resulting string too large"); - else { - size_t totallen = (size_t)n * l + (size_t)(n - 1) * lsep; - luaL_Buffer b; - char *p = luaL_buffinitsize(L, &b, totallen); - while (n-- > 1) { /* first n-1 copies (followed by separator) */ - memcpy(p, s, l * sizeof(char)); p += l; - if (lsep > 0) { /* empty 'memcpy' is not that cheap */ - memcpy(p, sep, lsep * sizeof(char)); - p += lsep; - } - } - memcpy(p, s, l * sizeof(char)); /* last copy (not followed by separator) */ - luaL_pushresultsize(&b, totallen); - } - return 1; -} - - -static int str_byte (lua_State *L) { - size_t l; - const char *s = luaL_checklstring(L, 1, &l); - lua_Integer pi = luaL_optinteger(L, 2, 1); - size_t posi = posrelatI(pi, l); - size_t pose = getendpos(L, 3, pi, l); - int n, i; - if (posi > pose) return 0; /* empty interval; return no values */ - if (l_unlikely(pose - posi >= (size_t)INT_MAX)) /* arithmetic overflow? */ - return luaL_error(L, "string slice too long"); - n = (int)(pose - posi) + 1; - luaL_checkstack(L, n, "string slice too long"); - for (i=0; iinit) { - state->init = 1; - luaL_buffinit(L, &state->B); - } - luaL_addlstring(&state->B, (const char *)b, size); - return 0; -} - - -static int str_dump (lua_State *L) { - struct str_Writer state; - int strip = lua_toboolean(L, 2); - luaL_checktype(L, 1, LUA_TFUNCTION); - lua_settop(L, 1); /* ensure function is on the top of the stack */ - state.init = 0; - if (l_unlikely(lua_dump(L, writer, &state, strip) != 0)) - return luaL_error(L, "unable to dump given function"); - luaL_pushresult(&state.B); - return 1; -} - - - -/* -** {====================================================== -** METAMETHODS -** ======================================================= -*/ - -#if defined(LUA_NOCVTS2N) /* { */ - -/* no coercion from strings to numbers */ - -static const luaL_Reg stringmetamethods[] = { - {"__index", NULL}, /* placeholder */ - {NULL, NULL} -}; - -#else /* }{ */ - -static int tonum (lua_State *L, int arg) { - if (lua_type(L, arg) == LUA_TNUMBER) { /* already a number? */ - lua_pushvalue(L, arg); - return 1; - } - else { /* check whether it is a numerical string */ - size_t len; - const char *s = lua_tolstring(L, arg, &len); - return (s != NULL && lua_stringtonumber(L, s) == len + 1); - } -} - - -static void trymt (lua_State *L, const char *mtname) { - lua_settop(L, 2); /* back to the original arguments */ - if (l_unlikely(lua_type(L, 2) == LUA_TSTRING || - !luaL_getmetafield(L, 2, mtname))) - luaL_error(L, "attempt to %s a '%s' with a '%s'", mtname + 2, - luaL_typename(L, -2), luaL_typename(L, -1)); - lua_insert(L, -3); /* put metamethod before arguments */ - lua_call(L, 2, 1); /* call metamethod */ -} - - -static int arith (lua_State *L, int op, const char *mtname) { - if (tonum(L, 1) && tonum(L, 2)) - lua_arith(L, op); /* result will be on the top */ - else - trymt(L, mtname); - return 1; -} - - -static int arith_add (lua_State *L) { - return arith(L, LUA_OPADD, "__add"); -} - -static int arith_sub (lua_State *L) { - return arith(L, LUA_OPSUB, "__sub"); -} - -static int arith_mul (lua_State *L) { - return arith(L, LUA_OPMUL, "__mul"); -} - -static int arith_mod (lua_State *L) { - return arith(L, LUA_OPMOD, "__mod"); -} - -static int arith_pow (lua_State *L) { - return arith(L, LUA_OPPOW, "__pow"); -} - -static int arith_div (lua_State *L) { - return arith(L, LUA_OPDIV, "__div"); -} - -static int arith_idiv (lua_State *L) { - return arith(L, LUA_OPIDIV, "__idiv"); -} - -static int arith_unm (lua_State *L) { - return arith(L, LUA_OPUNM, "__unm"); -} - - -static const luaL_Reg stringmetamethods[] = { - {"__add", arith_add}, - {"__sub", arith_sub}, - {"__mul", arith_mul}, - {"__mod", arith_mod}, - {"__pow", arith_pow}, - {"__div", arith_div}, - {"__idiv", arith_idiv}, - {"__unm", arith_unm}, - {"__index", NULL}, /* placeholder */ - {NULL, NULL} -}; - -#endif /* } */ - -/* }====================================================== */ - -/* -** {====================================================== -** PATTERN MATCHING -** ======================================================= -*/ - - -#define CAP_UNFINISHED (-1) -#define CAP_POSITION (-2) - - -typedef struct MatchState { - const char *src_init; /* init of source string */ - const char *src_end; /* end ('\0') of source string */ - const char *p_end; /* end ('\0') of pattern */ - lua_State *L; - int matchdepth; /* control for recursive depth (to avoid C stack overflow) */ - unsigned char level; /* total number of captures (finished or unfinished) */ - struct { - const char *init; - ptrdiff_t len; - } capture[LUA_MAXCAPTURES]; -} MatchState; - - -/* recursive function */ -static const char *match (MatchState *ms, const char *s, const char *p); - - -/* maximum recursion depth for 'match' */ -#if !defined(MAXCCALLS) -#define MAXCCALLS 200 -#endif - - -#define L_ESC '%' -#define SPECIALS "^$*+?.([%-" - - -static int check_capture (MatchState *ms, int l) { - l -= '1'; - if (l_unlikely(l < 0 || l >= ms->level || - ms->capture[l].len == CAP_UNFINISHED)) - return luaL_error(ms->L, "invalid capture index %%%d", l + 1); - return l; -} - - -static int capture_to_close (MatchState *ms) { - int level = ms->level; - for (level--; level>=0; level--) - if (ms->capture[level].len == CAP_UNFINISHED) return level; - return luaL_error(ms->L, "invalid pattern capture"); -} - - -static const char *classend (MatchState *ms, const char *p) { - switch (*p++) { - case L_ESC: { - if (l_unlikely(p == ms->p_end)) - luaL_error(ms->L, "malformed pattern (ends with '%%')"); - return p+1; - } - case '[': { - if (*p == '^') p++; - do { /* look for a ']' */ - if (l_unlikely(p == ms->p_end)) - luaL_error(ms->L, "malformed pattern (missing ']')"); - if (*(p++) == L_ESC && p < ms->p_end) - p++; /* skip escapes (e.g. '%]') */ - } while (*p != ']'); - return p+1; - } - default: { - return p; - } - } -} - - -static int match_class (int c, int cl) { - int res; - switch (tolower(cl)) { - case 'a' : res = isalpha(c); break; - case 'c' : res = iscntrl(c); break; - case 'd' : res = isdigit(c); break; - case 'g' : res = isgraph(c); break; - case 'l' : res = islower(c); break; - case 'p' : res = ispunct(c); break; - case 's' : res = isspace(c); break; - case 'u' : res = isupper(c); break; - case 'w' : res = isalnum(c); break; - case 'x' : res = isxdigit(c); break; - case 'z' : res = (c == 0); break; /* deprecated option */ - default: return (cl == c); - } - return (islower(cl) ? res : !res); -} - - -static int matchbracketclass (int c, const char *p, const char *ec) { - int sig = 1; - if (*(p+1) == '^') { - sig = 0; - p++; /* skip the '^' */ - } - while (++p < ec) { - if (*p == L_ESC) { - p++; - if (match_class(c, uchar(*p))) - return sig; - } - else if ((*(p+1) == '-') && (p+2 < ec)) { - p+=2; - if (uchar(*(p-2)) <= c && c <= uchar(*p)) - return sig; - } - else if (uchar(*p) == c) return sig; - } - return !sig; -} - - -static int singlematch (MatchState *ms, const char *s, const char *p, - const char *ep) { - if (s >= ms->src_end) - return 0; - else { - int c = uchar(*s); - switch (*p) { - case '.': return 1; /* matches any char */ - case L_ESC: return match_class(c, uchar(*(p+1))); - case '[': return matchbracketclass(c, p, ep-1); - default: return (uchar(*p) == c); - } - } -} - - -static const char *matchbalance (MatchState *ms, const char *s, - const char *p) { - if (l_unlikely(p >= ms->p_end - 1)) - luaL_error(ms->L, "malformed pattern (missing arguments to '%%b')"); - if (*s != *p) return NULL; - else { - int b = *p; - int e = *(p+1); - int cont = 1; - while (++s < ms->src_end) { - if (*s == e) { - if (--cont == 0) return s+1; - } - else if (*s == b) cont++; - } - } - return NULL; /* string ends out of balance */ -} - - -static const char *max_expand (MatchState *ms, const char *s, - const char *p, const char *ep) { - ptrdiff_t i = 0; /* counts maximum expand for item */ - while (singlematch(ms, s + i, p, ep)) - i++; - /* keeps trying to match with the maximum repetitions */ - while (i>=0) { - const char *res = match(ms, (s+i), ep+1); - if (res) return res; - i--; /* else didn't match; reduce 1 repetition to try again */ - } - return NULL; -} - - -static const char *min_expand (MatchState *ms, const char *s, - const char *p, const char *ep) { - for (;;) { - const char *res = match(ms, s, ep+1); - if (res != NULL) - return res; - else if (singlematch(ms, s, p, ep)) - s++; /* try with one more repetition */ - else return NULL; - } -} - - -static const char *start_capture (MatchState *ms, const char *s, - const char *p, int what) { - const char *res; - int level = ms->level; - if (level >= LUA_MAXCAPTURES) luaL_error(ms->L, "too many captures"); - ms->capture[level].init = s; - ms->capture[level].len = what; - ms->level = level+1; - if ((res=match(ms, s, p)) == NULL) /* match failed? */ - ms->level--; /* undo capture */ - return res; -} - - -static const char *end_capture (MatchState *ms, const char *s, - const char *p) { - int l = capture_to_close(ms); - const char *res; - ms->capture[l].len = s - ms->capture[l].init; /* close capture */ - if ((res = match(ms, s, p)) == NULL) /* match failed? */ - ms->capture[l].len = CAP_UNFINISHED; /* undo capture */ - return res; -} - - -static const char *match_capture (MatchState *ms, const char *s, int l) { - size_t len; - l = check_capture(ms, l); - len = ms->capture[l].len; - if ((size_t)(ms->src_end-s) >= len && - memcmp(ms->capture[l].init, s, len) == 0) - return s+len; - else return NULL; -} - - -static const char *match (MatchState *ms, const char *s, const char *p) { - if (l_unlikely(ms->matchdepth-- == 0)) - luaL_error(ms->L, "pattern too complex"); - init: /* using goto's to optimize tail recursion */ - if (p != ms->p_end) { /* end of pattern? */ - switch (*p) { - case '(': { /* start capture */ - if (*(p + 1) == ')') /* position capture? */ - s = start_capture(ms, s, p + 2, CAP_POSITION); - else - s = start_capture(ms, s, p + 1, CAP_UNFINISHED); - break; - } - case ')': { /* end capture */ - s = end_capture(ms, s, p + 1); - break; - } - case '$': { - if ((p + 1) != ms->p_end) /* is the '$' the last char in pattern? */ - goto dflt; /* no; go to default */ - s = (s == ms->src_end) ? s : NULL; /* check end of string */ - break; - } - case L_ESC: { /* escaped sequences not in the format class[*+?-]? */ - switch (*(p + 1)) { - case 'b': { /* balanced string? */ - s = matchbalance(ms, s, p + 2); - if (s != NULL) { - p += 4; goto init; /* return match(ms, s, p + 4); */ - } /* else fail (s == NULL) */ - break; - } - case 'f': { /* frontier? */ - const char *ep; char previous; - p += 2; - if (l_unlikely(*p != '[')) - luaL_error(ms->L, "missing '[' after '%%f' in pattern"); - ep = classend(ms, p); /* points to what is next */ - previous = (s == ms->src_init) ? '\0' : *(s - 1); - if (!matchbracketclass(uchar(previous), p, ep - 1) && - matchbracketclass(uchar(*s), p, ep - 1)) { - p = ep; goto init; /* return match(ms, s, ep); */ - } - s = NULL; /* match failed */ - break; - } - case '0': case '1': case '2': case '3': - case '4': case '5': case '6': case '7': - case '8': case '9': { /* capture results (%0-%9)? */ - s = match_capture(ms, s, uchar(*(p + 1))); - if (s != NULL) { - p += 2; goto init; /* return match(ms, s, p + 2) */ - } - break; - } - default: goto dflt; - } - break; - } - default: dflt: { /* pattern class plus optional suffix */ - const char *ep = classend(ms, p); /* points to optional suffix */ - /* does not match at least once? */ - if (!singlematch(ms, s, p, ep)) { - if (*ep == '*' || *ep == '?' || *ep == '-') { /* accept empty? */ - p = ep + 1; goto init; /* return match(ms, s, ep + 1); */ - } - else /* '+' or no suffix */ - s = NULL; /* fail */ - } - else { /* matched once */ - switch (*ep) { /* handle optional suffix */ - case '?': { /* optional */ - const char *res; - if ((res = match(ms, s + 1, ep + 1)) != NULL) - s = res; - else { - p = ep + 1; goto init; /* else return match(ms, s, ep + 1); */ - } - break; - } - case '+': /* 1 or more repetitions */ - s++; /* 1 match already done */ - /* FALLTHROUGH */ - case '*': /* 0 or more repetitions */ - s = max_expand(ms, s, p, ep); - break; - case '-': /* 0 or more repetitions (minimum) */ - s = min_expand(ms, s, p, ep); - break; - default: /* no suffix */ - s++; p = ep; goto init; /* return match(ms, s + 1, ep); */ - } - } - break; - } - } - } - ms->matchdepth++; - return s; -} - - - -static const char *lmemfind (const char *s1, size_t l1, - const char *s2, size_t l2) { - if (l2 == 0) return s1; /* empty strings are everywhere */ - else if (l2 > l1) return NULL; /* avoids a negative 'l1' */ - else { - const char *init; /* to search for a '*s2' inside 's1' */ - l2--; /* 1st char will be checked by 'memchr' */ - l1 = l1-l2; /* 's2' cannot be found after that */ - while (l1 > 0 && (init = (const char *)memchr(s1, *s2, l1)) != NULL) { - init++; /* 1st char is already checked */ - if (memcmp(init, s2+1, l2) == 0) - return init-1; - else { /* correct 'l1' and 's1' to try again */ - l1 -= init-s1; - s1 = init; - } - } - return NULL; /* not found */ - } -} - - -/* -** get information about the i-th capture. If there are no captures -** and 'i==0', return information about the whole match, which -** is the range 's'..'e'. If the capture is a string, return -** its length and put its address in '*cap'. If it is an integer -** (a position), push it on the stack and return CAP_POSITION. -*/ -static size_t get_onecapture (MatchState *ms, int i, const char *s, - const char *e, const char **cap) { - if (i >= ms->level) { - if (l_unlikely(i != 0)) - luaL_error(ms->L, "invalid capture index %%%d", i + 1); - *cap = s; - return e - s; - } - else { - ptrdiff_t capl = ms->capture[i].len; - *cap = ms->capture[i].init; - if (l_unlikely(capl == CAP_UNFINISHED)) - luaL_error(ms->L, "unfinished capture"); - else if (capl == CAP_POSITION) - lua_pushinteger(ms->L, (ms->capture[i].init - ms->src_init) + 1); - return capl; - } -} - - -/* -** Push the i-th capture on the stack. -*/ -static void push_onecapture (MatchState *ms, int i, const char *s, - const char *e) { - const char *cap; - ptrdiff_t l = get_onecapture(ms, i, s, e, &cap); - if (l != CAP_POSITION) - lua_pushlstring(ms->L, cap, l); - /* else position was already pushed */ -} - - -static int push_captures (MatchState *ms, const char *s, const char *e) { - int i; - int nlevels = (ms->level == 0 && s) ? 1 : ms->level; - luaL_checkstack(ms->L, nlevels, "too many captures"); - for (i = 0; i < nlevels; i++) - push_onecapture(ms, i, s, e); - return nlevels; /* number of strings pushed */ -} - - -/* check whether pattern has no special characters */ -static int nospecials (const char *p, size_t l) { - size_t upto = 0; - do { - if (strpbrk(p + upto, SPECIALS)) - return 0; /* pattern has a special character */ - upto += strlen(p + upto) + 1; /* may have more after \0 */ - } while (upto <= l); - return 1; /* no special chars found */ -} - - -static void prepstate (MatchState *ms, lua_State *L, - const char *s, size_t ls, const char *p, size_t lp) { - ms->L = L; - ms->matchdepth = MAXCCALLS; - ms->src_init = s; - ms->src_end = s + ls; - ms->p_end = p + lp; -} - - -static void reprepstate (MatchState *ms) { - ms->level = 0; - lua_assert(ms->matchdepth == MAXCCALLS); -} - - -static int str_find_aux (lua_State *L, int find) { - size_t ls, lp; - const char *s = luaL_checklstring(L, 1, &ls); - const char *p = luaL_checklstring(L, 2, &lp); - size_t init = posrelatI(luaL_optinteger(L, 3, 1), ls) - 1; - if (init > ls) { /* start after string's end? */ - luaL_pushfail(L); /* cannot find anything */ - return 1; - } - /* explicit request or no special characters? */ - if (find && (lua_toboolean(L, 4) || nospecials(p, lp))) { - /* do a plain search */ - const char *s2 = lmemfind(s + init, ls - init, p, lp); - if (s2) { - lua_pushinteger(L, (s2 - s) + 1); - lua_pushinteger(L, (s2 - s) + lp); - return 2; - } - } - else { - MatchState ms; - const char *s1 = s + init; - int anchor = (*p == '^'); - if (anchor) { - p++; lp--; /* skip anchor character */ - } - prepstate(&ms, L, s, ls, p, lp); - do { - const char *res; - reprepstate(&ms); - if ((res=match(&ms, s1, p)) != NULL) { - if (find) { - lua_pushinteger(L, (s1 - s) + 1); /* start */ - lua_pushinteger(L, res - s); /* end */ - return push_captures(&ms, NULL, 0) + 2; - } - else - return push_captures(&ms, s1, res); - } - } while (s1++ < ms.src_end && !anchor); - } - luaL_pushfail(L); /* not found */ - return 1; -} - - -static int str_find (lua_State *L) { - return str_find_aux(L, 1); -} - - -static int str_match (lua_State *L) { - return str_find_aux(L, 0); -} - - -/* state for 'gmatch' */ -typedef struct GMatchState { - const char *src; /* current position */ - const char *p; /* pattern */ - const char *lastmatch; /* end of last match */ - MatchState ms; /* match state */ -} GMatchState; - - -static int gmatch_aux (lua_State *L) { - GMatchState *gm = (GMatchState *)lua_touserdata(L, lua_upvalueindex(3)); - const char *src; - gm->ms.L = L; - for (src = gm->src; src <= gm->ms.src_end; src++) { - const char *e; - reprepstate(&gm->ms); - if ((e = match(&gm->ms, src, gm->p)) != NULL && e != gm->lastmatch) { - gm->src = gm->lastmatch = e; - return push_captures(&gm->ms, src, e); - } - } - return 0; /* not found */ -} - - -static int gmatch (lua_State *L) { - size_t ls, lp; - const char *s = luaL_checklstring(L, 1, &ls); - const char *p = luaL_checklstring(L, 2, &lp); - size_t init = posrelatI(luaL_optinteger(L, 3, 1), ls) - 1; - GMatchState *gm; - lua_settop(L, 2); /* keep strings on closure to avoid being collected */ - gm = (GMatchState *)lua_newuserdatauv(L, sizeof(GMatchState), 0); - if (init > ls) /* start after string's end? */ - init = ls + 1; /* avoid overflows in 's + init' */ - prepstate(&gm->ms, L, s, ls, p, lp); - gm->src = s + init; gm->p = p; gm->lastmatch = NULL; - lua_pushcclosure(L, gmatch_aux, 3); - return 1; -} - - -static void add_s (MatchState *ms, luaL_Buffer *b, const char *s, - const char *e) { - size_t l; - lua_State *L = ms->L; - const char *news = lua_tolstring(L, 3, &l); - const char *p; - while ((p = (char *)memchr(news, L_ESC, l)) != NULL) { - luaL_addlstring(b, news, p - news); - p++; /* skip ESC */ - if (*p == L_ESC) /* '%%' */ - luaL_addchar(b, *p); - else if (*p == '0') /* '%0' */ - luaL_addlstring(b, s, e - s); - else if (isdigit(uchar(*p))) { /* '%n' */ - const char *cap; - ptrdiff_t resl = get_onecapture(ms, *p - '1', s, e, &cap); - if (resl == CAP_POSITION) - luaL_addvalue(b); /* add position to accumulated result */ - else - luaL_addlstring(b, cap, resl); - } - else - luaL_error(L, "invalid use of '%c' in replacement string", L_ESC); - l -= p + 1 - news; - news = p + 1; - } - luaL_addlstring(b, news, l); -} - - -/* -** Add the replacement value to the string buffer 'b'. -** Return true if the original string was changed. (Function calls and -** table indexing resulting in nil or false do not change the subject.) -*/ -static int add_value (MatchState *ms, luaL_Buffer *b, const char *s, - const char *e, int tr) { - lua_State *L = ms->L; - switch (tr) { - case LUA_TFUNCTION: { /* call the function */ - int n; - lua_pushvalue(L, 3); /* push the function */ - n = push_captures(ms, s, e); /* all captures as arguments */ - lua_call(L, n, 1); /* call it */ - break; - } - case LUA_TTABLE: { /* index the table */ - push_onecapture(ms, 0, s, e); /* first capture is the index */ - lua_gettable(L, 3); - break; - } - default: { /* LUA_TNUMBER or LUA_TSTRING */ - add_s(ms, b, s, e); /* add value to the buffer */ - return 1; /* something changed */ - } - } - if (!lua_toboolean(L, -1)) { /* nil or false? */ - lua_pop(L, 1); /* remove value */ - luaL_addlstring(b, s, e - s); /* keep original text */ - return 0; /* no changes */ - } - else if (l_unlikely(!lua_isstring(L, -1))) - return luaL_error(L, "invalid replacement value (a %s)", - luaL_typename(L, -1)); - else { - luaL_addvalue(b); /* add result to accumulator */ - return 1; /* something changed */ - } -} - - -static int str_gsub (lua_State *L) { - size_t srcl, lp; - const char *src = luaL_checklstring(L, 1, &srcl); /* subject */ - const char *p = luaL_checklstring(L, 2, &lp); /* pattern */ - const char *lastmatch = NULL; /* end of last match */ - int tr = lua_type(L, 3); /* replacement type */ - lua_Integer max_s = luaL_optinteger(L, 4, srcl + 1); /* max replacements */ - int anchor = (*p == '^'); - lua_Integer n = 0; /* replacement count */ - int changed = 0; /* change flag */ - MatchState ms; - luaL_Buffer b; - luaL_argexpected(L, tr == LUA_TNUMBER || tr == LUA_TSTRING || - tr == LUA_TFUNCTION || tr == LUA_TTABLE, 3, - "string/function/table"); - luaL_buffinit(L, &b); - if (anchor) { - p++; lp--; /* skip anchor character */ - } - prepstate(&ms, L, src, srcl, p, lp); - while (n < max_s) { - const char *e; - reprepstate(&ms); /* (re)prepare state for new match */ - if ((e = match(&ms, src, p)) != NULL && e != lastmatch) { /* match? */ - n++; - changed = add_value(&ms, &b, src, e, tr) | changed; - src = lastmatch = e; - } - else if (src < ms.src_end) /* otherwise, skip one character */ - luaL_addchar(&b, *src++); - else break; /* end of subject */ - if (anchor) break; - } - if (!changed) /* no changes? */ - lua_pushvalue(L, 1); /* return original string */ - else { /* something changed */ - luaL_addlstring(&b, src, ms.src_end-src); - luaL_pushresult(&b); /* create and return new string */ - } - lua_pushinteger(L, n); /* number of substitutions */ - return 2; -} - -/* }====================================================== */ - - - -/* -** {====================================================== -** STRING FORMAT -** ======================================================= -*/ - -#if !defined(lua_number2strx) /* { */ - -/* -** Hexadecimal floating-point formatter -*/ - -#define SIZELENMOD (sizeof(LUA_NUMBER_FRMLEN)/sizeof(char)) - - -/* -** Number of bits that goes into the first digit. It can be any value -** between 1 and 4; the following definition tries to align the number -** to nibble boundaries by making what is left after that first digit a -** multiple of 4. -*/ -#define L_NBFD ((l_floatatt(MANT_DIG) - 1)%4 + 1) - - -/* -** Add integer part of 'x' to buffer and return new 'x' -*/ -static lua_Number adddigit (char *buff, int n, lua_Number x) { - lua_Number dd = l_mathop(floor)(x); /* get integer part from 'x' */ - int d = (int)dd; - buff[n] = (d < 10 ? d + '0' : d - 10 + 'a'); /* add to buffer */ - return x - dd; /* return what is left */ -} - - -static int num2straux (char *buff, int sz, lua_Number x) { - /* if 'inf' or 'NaN', format it like '%g' */ - if (x != x || x == (lua_Number)HUGE_VAL || x == -(lua_Number)HUGE_VAL) - return l_sprintf(buff, sz, LUA_NUMBER_FMT, (LUAI_UACNUMBER)x); - else if (x == 0) { /* can be -0... */ - /* create "0" or "-0" followed by exponent */ - return l_sprintf(buff, sz, LUA_NUMBER_FMT "x0p+0", (LUAI_UACNUMBER)x); - } - else { - int e; - lua_Number m = l_mathop(frexp)(x, &e); /* 'x' fraction and exponent */ - int n = 0; /* character count */ - if (m < 0) { /* is number negative? */ - buff[n++] = '-'; /* add sign */ - m = -m; /* make it positive */ - } - buff[n++] = '0'; buff[n++] = 'x'; /* add "0x" */ - m = adddigit(buff, n++, m * (1 << L_NBFD)); /* add first digit */ - e -= L_NBFD; /* this digit goes before the radix point */ - if (m > 0) { /* more digits? */ - buff[n++] = lua_getlocaledecpoint(); /* add radix point */ - do { /* add as many digits as needed */ - m = adddigit(buff, n++, m * 16); - } while (m > 0); - } - n += l_sprintf(buff + n, sz - n, "p%+d", e); /* add exponent */ - lua_assert(n < sz); - return n; - } -} - - -static int lua_number2strx (lua_State *L, char *buff, int sz, - const char *fmt, lua_Number x) { - int n = num2straux(buff, sz, x); - if (fmt[SIZELENMOD] == 'A') { - int i; - for (i = 0; i < n; i++) - buff[i] = toupper(uchar(buff[i])); - } - else if (l_unlikely(fmt[SIZELENMOD] != 'a')) - return luaL_error(L, "modifiers for format '%%a'/'%%A' not implemented"); - return n; -} - -#endif /* } */ - - -/* -** Maximum size for items formatted with '%f'. This size is produced -** by format('%.99f', -maxfloat), and is equal to 99 + 3 ('-', '.', -** and '\0') + number of decimal digits to represent maxfloat (which -** is maximum exponent + 1). (99+3+1, adding some extra, 110) -*/ -#define MAX_ITEMF (110 + l_floatatt(MAX_10_EXP)) - - -/* -** All formats except '%f' do not need that large limit. The other -** float formats use exponents, so that they fit in the 99 limit for -** significant digits; 's' for large strings and 'q' add items directly -** to the buffer; all integer formats also fit in the 99 limit. The -** worst case are floats: they may need 99 significant digits, plus -** '0x', '-', '.', 'e+XXXX', and '\0'. Adding some extra, 120. -*/ -#define MAX_ITEM 120 - - -/* valid flags in a format specification */ -#if !defined(L_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.4/src/ltable.c b/lua-5.4.4/src/ltable.c deleted file mode 100644 index 1b1cd24..0000000 --- a/lua-5.4.4/src/ltable.c +++ /dev/null @@ -1,980 +0,0 @@ -/* -** $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 <= (unsigned int)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); - size |= (size >> 16); -#if (UINT_MAX >> 30) > 3 - size |= (size >> 32); /* unsigned int has more than 32 bits */ -#endif - size++; - lua_assert(ispow2(size) && size/2 < t->alimit && t->alimit < size); - return size; - } -} - - -/* -** Check whether real size of the array is a power of 2. -** (If it is not, 'alimit' cannot be changed to any other value -** without changing the real size.) -*/ -static int ispow2realasize (const Table *t) { - return (!isrealasize(t) || ispow2(t->alimit)); -} - - -static unsigned int setlimittosize (Table *t) { - t->alimit = luaH_realasize(t); - setrealasize(t); - return t->alimit; -} - - -#define limitasasize(t) check_exp(isrealasize(t), t->alimit) - - - -/* -** "Generic" get version. (Not that generic: not valid for integers, -** which may be in array part, nor for floats with integral values.) -** See explanation about 'deadok' in function 'equalkey'. -*/ -static const TValue *getgeneric (Table *t, const TValue *key, int deadok) { - Node *n = mainpositionTV(t, key); - for (;;) { /* check whether 'key' is somewhere in the chain */ - if (equalkey(key, n, deadok)) - return gval(n); /* that's it */ - else { - int nx = gnext(n); - if (nx == 0) - return &absentkey; /* not found */ - n += nx; - } - } -} - - -/* -** returns the index for 'k' if 'k' is an appropriate key to live in -** the array part of a table, 0 otherwise. -*/ -static unsigned int arrayindex (lua_Integer k) { - if (l_castS2U(k) - 1u < MAXASIZE) /* 'k' in [1, MAXASIZE]? */ - return cast_uint(k); /* 'key' is an appropriate array index */ - else - return 0; -} - - -/* -** returns the index of a 'key' for table traversals. First goes all -** elements in the array part, then elements in the hash part. The -** beginning of a traversal is signaled by 0. -*/ -static unsigned int findindex (lua_State *L, Table *t, TValue *key, - unsigned int asize) { - unsigned int i; - if (ttisnil(key)) return 0; /* first iteration */ - i = ttisinteger(key) ? arrayindex(ivalue(key)) : 0; - if (i - 1u < asize) /* is 'key' inside array part? */ - return i; /* yes; that's the index */ - else { - const TValue *n = getgeneric(t, key, 1); - if (l_unlikely(isabstkey(n))) - luaG_runerror(L, "invalid key to 'next'"); /* key not found */ - i = cast_int(nodefromval(n) - gnode(t, 0)); /* key index in hash table */ - /* hash elements are numbered after array ones */ - return (i + 1) + asize; - } -} - - -int luaH_next (lua_State *L, Table *t, StkId key) { - unsigned int asize = luaH_realasize(t); - unsigned int i = findindex(L, t, s2v(key), asize); /* find original key */ - for (; i < asize; i++) { /* try first array part */ - if (!isempty(&t->array[i])) { /* a non-empty entry? */ - setivalue(s2v(key), i + 1); - setobj2s(L, key + 1, &t->array[i]); - return 1; - } - } - for (i -= asize; cast_int(i) < sizenode(t); i++) { /* hash part */ - if (!isempty(gval(gnode(t, i)))) { /* a non-empty entry? */ - Node *n = gnode(t, i); - getnodekey(L, s2v(key), n); - setobj2s(L, key + 1, gval(n)); - return 1; - } - } - return 0; /* no more elements */ -} - - -static void freehash (lua_State *L, Table *t) { - if (!isdummy(t)) - luaM_freearray(L, t->node, cast_sizet(sizenode(t))); -} - - -/* -** {============================================================= -** Rehash -** ============================================================== -*/ - -/* -** Compute the optimal size for the array part of table 't'. 'nums' is a -** "count array" where 'nums[i]' is the number of integers in the table -** between 2^(i - 1) + 1 and 2^i. 'pna' enters with the total number of -** integer keys in the table and leaves with the number of keys that -** will go to the array part; return the optimal size. (The condition -** 'twotoi > 0' in the for loop stops the loop if 'twotoi' overflows.) -*/ -static unsigned int computesizes (unsigned int nums[], unsigned int *pna) { - int i; - unsigned int twotoi; /* 2^i (candidate for optimal size) */ - unsigned int a = 0; /* number of elements smaller than 2^i */ - unsigned int na = 0; /* number of elements to go to array part */ - unsigned int optimal = 0; /* optimal size for array part */ - /* loop while keys can fill more than half of total size */ - for (i = 0, twotoi = 1; - twotoi > 0 && *pna > twotoi / 2; - i++, twotoi *= 2) { - a += nums[i]; - if (a > twotoi/2) { /* more than half elements present? */ - optimal = twotoi; /* optimal size (till now) */ - na = a; /* all elements up to 'optimal' will go to array part */ - } - } - lua_assert((optimal == 0 || optimal / 2 < na) && na <= optimal); - *pna = na; - return optimal; -} - - -static int countint (lua_Integer key, unsigned int *nums) { - unsigned int k = arrayindex(key); - if (k != 0) { /* is 'key' an appropriate array index? */ - nums[luaO_ceillog2(k)]++; /* count as such */ - return 1; - } - else - return 0; -} - - -/* -** Count keys in array part of table 't': Fill 'nums[i]' with -** number of keys that will go into corresponding slice and return -** total number of non-nil keys. -*/ -static unsigned int numusearray (const Table *t, unsigned int *nums) { - int lg; - unsigned int ttlg; /* 2^lg */ - unsigned int ause = 0; /* summation of 'nums' */ - unsigned int i = 1; /* count to traverse all array keys */ - unsigned int asize = limitasasize(t); /* real array size */ - /* traverse each slice */ - for (lg = 0, ttlg = 1; lg <= MAXABITS; lg++, ttlg *= 2) { - unsigned int lc = 0; /* counter */ - unsigned int lim = ttlg; - if (lim > asize) { - lim = asize; /* adjust upper limit */ - if (i > lim) - break; /* no more elements to count */ - } - /* count elements in range (2^(lg - 1), 2^lg] */ - for (; i <= lim; i++) { - if (!isempty(&t->array[i-1])) - lc++; - } - nums[lg] += lc; - ause += lc; - } - return ause; -} - - -static int numusehash (const Table *t, unsigned int *nums, unsigned int *pna) { - int totaluse = 0; /* total number of elements */ - int ause = 0; /* elements added to 'nums' (can go to array part) */ - int i = sizenode(t); - while (i--) { - Node *n = &t->node[i]; - if (!isempty(gval(n))) { - if (keyisinteger(n)) - ause += countint(keyival(n), nums); - totaluse++; - } - } - *pna += ause; - return totaluse; -} - - -/* -** Creates an array for the hash part of a table with the given -** size, or reuses the dummy node if size is zero. -** The computation for size overflow is in two steps: the first -** comparison ensures that the shift in the second one does not -** overflow. -*/ -static void setnodevector (lua_State *L, Table *t, unsigned int size) { - if (size == 0) { /* no elements to hash part? */ - t->node = cast(Node *, dummynode); /* use common 'dummynode' */ - t->lsizenode = 0; - t->lastfree = NULL; /* signal that it is using dummy node */ - } - else { - int i; - int lsize = luaO_ceillog2(size); - if (lsize > MAXHBITS || (1u << lsize) > MAXHSIZE) - luaG_runerror(L, "table overflow"); - size = twoto(lsize); - t->node = luaM_newvector(L, size, Node); - for (i = 0; i < (int)size; i++) { - Node *n = gnode(t, i); - gnext(n) = 0; - setnilkey(n); - setempty(gval(n)); - } - t->lsizenode = cast_byte(lsize); - t->lastfree = gnode(t, size); /* all positions are free */ - } -} - - -/* -** (Re)insert all elements from the hash part of 'ot' into table 't'. -*/ -static void reinsert (lua_State *L, Table *ot, Table *t) { - int j; - int size = sizenode(ot); - for (j = 0; j < size; j++) { - Node *old = gnode(ot, j); - if (!isempty(gval(old))) { - /* doesn't need barrier/invalidate cache, as entry was - already present in the table */ - TValue k; - getnodekey(L, &k, old); - luaH_set(L, t, &k, gval(old)); - } - } -} - - -/* -** Exchange the hash part of 't1' and 't2'. -*/ -static void exchangehashpart (Table *t1, Table *t2) { - lu_byte lsizenode = t1->lsizenode; - Node *node = t1->node; - Node *lastfree = t1->lastfree; - t1->lsizenode = t2->lsizenode; - t1->node = t2->node; - t1->lastfree = t2->lastfree; - t2->lsizenode = lsizenode; - t2->node = node; - t2->lastfree = lastfree; -} - - -/* -** Resize table 't' for the new given sizes. Both allocations (for -** the hash part and for the array part) can fail, which creates some -** subtleties. If the first allocation, for the hash part, fails, an -** error is raised and that is it. Otherwise, it copies the elements from -** the shrinking part of the array (if it is shrinking) into the new -** hash. Then it reallocates the array part. If that fails, the table -** is in its original state; the function frees the new hash part and then -** raises the allocation error. Otherwise, it sets the new hash part -** into the table, initializes the new part of the array (if any) with -** nils and reinserts the elements of the old hash back into the new -** parts of the table. -*/ -void luaH_resize (lua_State *L, Table *t, unsigned int newasize, - unsigned int nhsize) { - unsigned int i; - Table newt; /* to keep the new hash part */ - unsigned int oldasize = setlimittosize(t); - TValue *newarray; - /* create new hash part with appropriate size into 'newt' */ - setnodevector(L, &newt, nhsize); - if (newasize < oldasize) { /* will array shrink? */ - t->alimit = newasize; /* pretend array has new size... */ - exchangehashpart(t, &newt); /* and new hash */ - /* re-insert into the new hash the elements from vanishing slice */ - for (i = newasize; i < oldasize; i++) { - if (!isempty(&t->array[i])) - luaH_setint(L, t, i + 1, &t->array[i]); - } - t->alimit = oldasize; /* restore current size... */ - exchangehashpart(t, &newt); /* and hash (in case of errors) */ - } - /* allocate new array */ - newarray = luaM_reallocvector(L, t->array, oldasize, newasize, TValue); - if (l_unlikely(newarray == NULL && newasize > 0)) { /* allocation failed? */ - freehash(L, &newt); /* release new hash part */ - luaM_error(L); /* raise error (with array unchanged) */ - } - /* allocation ok; initialize new part of the array */ - exchangehashpart(t, &newt); /* 't' has the new hash ('newt' has the old) */ - t->array = newarray; /* set new array part */ - t->alimit = newasize; - for (i = oldasize; i < newasize; i++) /* clear new slice of the array */ - setempty(&t->array[i]); - /* re-insert elements from old hash part into new parts */ - reinsert(L, &newt, t); /* 'newt' now has the old hash */ - freehash(L, &newt); /* free old hash part */ -} - - -void luaH_resizearray (lua_State *L, Table *t, unsigned int nasize) { - int nsize = allocsizenode(t); - luaH_resize(L, t, nasize, nsize); -} - -/* -** nums[i] = number of keys 'k' where 2^(i - 1) < k <= 2^i -*/ -static void rehash (lua_State *L, Table *t, const TValue *ek) { - unsigned int asize; /* optimal size for array part */ - unsigned int na; /* number of keys in the array part */ - unsigned int nums[MAXABITS + 1]; - int i; - int totaluse; - for (i = 0; i <= MAXABITS; i++) nums[i] = 0; /* reset counts */ - setlimittosize(t); - na = numusearray(t, nums); /* count keys in array part */ - totaluse = na; /* all those keys are integer keys */ - totaluse += numusehash(t, nums, &na); /* count keys in hash part */ - /* count extra key */ - if (ttisinteger(ek)) - na += countint(ivalue(ek), nums); - totaluse++; - /* compute new size for array part */ - asize = computesizes(nums, &na); - /* resize the table to new computed sizes */ - luaH_resize(L, t, asize, totaluse - na); -} - - - -/* -** }============================================================= -*/ - - -Table *luaH_new (lua_State *L) { - GCObject *o = luaC_newobj(L, LUA_VTABLE, sizeof(Table)); - Table *t = gco2t(o); - t->metatable = NULL; - t->flags = cast_byte(maskflags); /* table has no metamethod fields */ - t->array = NULL; - t->alimit = 0; - setnodevector(L, t, 0); - return t; -} - - -void luaH_free (lua_State *L, Table *t) { - freehash(L, t); - luaM_freearray(L, t->array, luaH_realasize(t)); - luaM_free(L, t); -} - - -static Node *getfreepos (Table *t) { - if (!isdummy(t)) { - while (t->lastfree > t->node) { - t->lastfree--; - if (keyisnil(t->lastfree)) - return t->lastfree; - } - } - return NULL; /* could not find a free place */ -} - - - -/* -** inserts a new key into a hash table; first, check whether key's main -** position is free. If not, check whether colliding node is in its main -** position or not: if it is not, move colliding node to an empty place and -** put new key in its main position; otherwise (colliding node is in its main -** position), new key goes to an empty position. -*/ -void luaH_newkey (lua_State *L, Table *t, const TValue *key, TValue *value) { - Node *mp; - TValue aux; - if (l_unlikely(ttisnil(key))) - luaG_runerror(L, "table index is nil"); - else if (ttisfloat(key)) { - lua_Number f = fltvalue(key); - lua_Integer k; - if (luaV_flttointeger(f, &k, F2Ieq)) { /* does key fit in an integer? */ - setivalue(&aux, k); - key = &aux; /* insert it as an integer */ - } - else if (l_unlikely(luai_numisnan(f))) - luaG_runerror(L, "table index is NaN"); - } - if (ttisnil(value)) - return; /* do not insert nil values */ - mp = mainpositionTV(t, key); - if (!isempty(gval(mp)) || isdummy(t)) { /* main position is taken? */ - Node *othern; - Node *f = getfreepos(t); /* get a free place */ - if (f == NULL) { /* cannot find a free place? */ - rehash(L, t, key); /* grow table */ - /* whatever called 'newkey' takes care of TM cache */ - luaH_set(L, t, key, value); /* insert key into grown table */ - return; - } - lua_assert(!isdummy(t)); - othern = 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); -} - -int luaH_isdummy (const Table *t) { return isdummy(t); } - -#endif diff --git a/lua-5.4.4/src/ltable.h b/lua-5.4.4/src/ltable.h deleted file mode 100644 index 7bbbcb2..0000000 --- a/lua-5.4.4/src/ltable.h +++ /dev/null @@ -1,66 +0,0 @@ -/* -** $Id: ltable.h $ -** Lua tables (hash) -** See Copyright Notice in lua.h -*/ - -#ifndef ltable_h -#define ltable_h - -#include "lobject.h" - - -#define gnode(t,i) (&(t)->node[i]) -#define gval(n) (&(n)->i_val) -#define gnext(n) ((n)->u.next) - - -/* -** Clear all bits of fast-access metamethods, which means that the table -** may have any of these metamethods. (First access that fails after the -** clearing will set the bit again.) -*/ -#define invalidateTMcache(t) ((t)->flags &= ~maskflags) - - -/* true when 't' is using 'dummynode' as its hash part */ -#define isdummy(t) ((t)->lastfree == NULL) - - -/* allocated size for hash nodes */ -#define allocsizenode(t) (isdummy(t) ? 0 : sizenode(t)) - - -/* returns the Node, given the value of a table entry */ -#define nodefromval(v) cast(Node *, (v)) - - -LUAI_FUNC const TValue *luaH_getint (Table *t, lua_Integer key); -LUAI_FUNC void luaH_setint (lua_State *L, Table *t, lua_Integer key, - TValue *value); -LUAI_FUNC const TValue *luaH_getshortstr (Table *t, TString *key); -LUAI_FUNC const TValue *luaH_getstr (Table *t, TString *key); -LUAI_FUNC const TValue *luaH_get (Table *t, const TValue *key); -LUAI_FUNC void luaH_newkey (lua_State *L, Table *t, const TValue *key, - TValue *value); -LUAI_FUNC void luaH_set (lua_State *L, Table *t, const TValue *key, - TValue *value); -LUAI_FUNC void luaH_finishset (lua_State *L, Table *t, const TValue *key, - const TValue *slot, TValue *value); -LUAI_FUNC Table *luaH_new (lua_State *L); -LUAI_FUNC void luaH_resize (lua_State *L, Table *t, unsigned int nasize, - unsigned int nhsize); -LUAI_FUNC void luaH_resizearray (lua_State *L, Table *t, unsigned int nasize); -LUAI_FUNC void luaH_free (lua_State *L, Table *t); -LUAI_FUNC int luaH_next (lua_State *L, Table *t, StkId key); -LUAI_FUNC lua_Unsigned luaH_getn (Table *t); -LUAI_FUNC unsigned int luaH_realasize (const Table *t); - - -#if defined(LUA_DEBUG) -LUAI_FUNC Node *luaH_mainposition (const Table *t, const TValue *key); -LUAI_FUNC int luaH_isdummy (const Table *t); -#endif - - -#endif diff --git a/lua-5.4.4/src/ltablib.c b/lua-5.4.4/src/ltablib.c deleted file mode 100644 index 868d78f..0000000 --- a/lua-5.4.4/src/ltablib.c +++ /dev/null @@ -1,430 +0,0 @@ -/* -** $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, 1, - "position out of bounds"); - lua_geti(L, 1, pos); /* result = t[pos] */ - for ( ; pos < size; pos++) { - lua_geti(L, 1, pos + 1); - lua_seti(L, 1, pos); /* t[pos] = t[pos + 1] */ - } - lua_pushnil(L); - lua_seti(L, 1, pos); /* remove entry t[pos] */ - return 1; -} - - -/* -** Copy elements (1[f], ..., 1[e]) into (tt[t], tt[t+1], ...). Whenever -** possible, copy in increasing order, which is better for rehashing. -** "possible" means destination after original range, or smaller -** than origin, or copying to another table. -*/ -static int tmove (lua_State *L) { - lua_Integer f = luaL_checkinteger(L, 2); - lua_Integer e = luaL_checkinteger(L, 3); - lua_Integer t = luaL_checkinteger(L, 4); - int tt = !lua_isnoneornil(L, 5) ? 5 : 1; /* destination table */ - checktab(L, 1, TAB_R); - checktab(L, tt, TAB_W); - if (e >= f) { /* otherwise, nothing to move */ - lua_Integer n, i; - luaL_argcheck(L, f > 0 || e < LUA_MAXINTEGER + f, 3, - "too many elements to move"); - n = e - f + 1; /* number of elements to move */ - luaL_argcheck(L, t <= LUA_MAXINTEGER - n + 1, 4, - "destination wrap around"); - if (t > e || t <= f || (tt != 1 && !lua_compare(L, 1, tt, LUA_OPEQ))) { - for (i = 0; i < n; i++) { - lua_geti(L, 1, f + i); - lua_seti(L, tt, t + i); - } - } - else { - for (i = n - 1; i >= 0; i--) { - lua_geti(L, 1, f + i); - lua_seti(L, tt, t + i); - } - } - } - lua_pushvalue(L, tt); /* return destination table */ - return 1; -} - - -static void addfield (lua_State *L, luaL_Buffer *b, lua_Integer i) { - lua_geti(L, 1, i); - if (l_unlikely(!lua_isstring(L, -1))) - luaL_error(L, "invalid value (%s) at index %I in table for 'concat'", - luaL_typename(L, -1), (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.4/src/ltm.c b/lua-5.4.4/src/ltm.c deleted file mode 100644 index b657b78..0000000 --- a/lua-5.4.4/src/ltm.c +++ /dev/null @@ -1,271 +0,0 @@ -/* -** $Id: ltm.c $ -** Tag methods -** See Copyright Notice in lua.h -*/ - -#define ltm_c -#define LUA_CORE - -#include "lprefix.h" - - -#include - -#include "lua.h" - -#include "ldebug.h" -#include "ldo.h" -#include "lgc.h" -#include "lobject.h" -#include "lstate.h" -#include "lstring.h" -#include "ltable.h" -#include "ltm.h" -#include "lvm.h" - - -static const char udatatypename[] = "userdata"; - -LUAI_DDEF const char *const luaT_typenames_[LUA_TOTALTYPES] = { - "no value", - "nil", "boolean", udatatypename, "number", - "string", "table", "function", udatatypename, "thread", - "upvalue", "proto" /* these last cases are used for tests only */ -}; - - -void luaT_init (lua_State *L) { - static const char *const luaT_eventname[] = { /* ORDER TM */ - "__index", "__newindex", - "__gc", "__mode", "__len", "__eq", - "__add", "__sub", "__mul", "__mod", "__pow", - "__div", "__idiv", - "__band", "__bor", "__bxor", "__shl", "__shr", - "__unm", "__bnot", "__lt", "__le", - "__concat", "__call", "__close" - }; - int i; - for (i=0; itmname[i] = luaS_new(L, luaT_eventname[i]); - luaC_fix(L, obj2gco(G(L)->tmname[i])); /* never collect these names */ - } -} - - -/* -** function to be used with macro "fasttm": optimized for absence of -** tag methods -*/ -const TValue *luaT_gettm (Table *events, TMS event, TString *ename) { - const TValue *tm = luaH_getshortstr(events, ename); - lua_assert(event <= TM_EQ); - if (notm(tm)) { /* no tag method? */ - events->flags |= cast_byte(1u<metatable; - break; - case LUA_TUSERDATA: - mt = uvalue(o)->metatable; - break; - default: - mt = G(L)->mt[ttype(o)]; - } - return (mt ? luaH_getshortstr(mt, G(L)->tmname[event]) : &G(L)->nilvalue); -} - - -/* -** Return the name of the type of an object. For tables and userdata -** with metatable, use their '__name' metafield, if present. -*/ -const char *luaT_objtypename (lua_State *L, const TValue *o) { - Table *mt; - if ((ttistable(o) && (mt = hvalue(o)->metatable) != NULL) || - (ttisfulluserdata(o) && (mt = uvalue(o)->metatable) != NULL)) { - const TValue *name = luaH_getshortstr(mt, luaS_new(L, "__name")); - if (ttisstring(name)) /* is '__name' a string? */ - return getstr(tsvalue(name)); /* use it as type name */ - } - return ttypename(ttype(o)); /* else use standard type name */ -} - - -void luaT_callTM (lua_State *L, const TValue *f, const TValue *p1, - const TValue *p2, const TValue *p3) { - StkId func = L->top; - setobj2s(L, func, f); /* push function (assume EXTRA_STACK) */ - setobj2s(L, func + 1, p1); /* 1st argument */ - setobj2s(L, func + 2, p2); /* 2nd argument */ - setobj2s(L, func + 3, p3); /* 3rd argument */ - L->top = func + 4; - /* metamethod may yield only when called from Lua code */ - if (isLuacode(L->ci)) - luaD_call(L, func, 0); - else - luaD_callnoyield(L, func, 0); -} - - -void luaT_callTMres (lua_State *L, const TValue *f, const TValue *p1, - const TValue *p2, StkId res) { - ptrdiff_t result = savestack(L, res); - StkId func = L->top; - setobj2s(L, func, f); /* push function (assume EXTRA_STACK) */ - setobj2s(L, func + 1, p1); /* 1st argument */ - setobj2s(L, func + 2, p2); /* 2nd argument */ - L->top += 3; - /* metamethod may yield only when called from Lua code */ - if (isLuacode(L->ci)) - luaD_call(L, func, 1); - else - luaD_callnoyield(L, func, 1); - res = restorestack(L, result); - setobjs2s(L, res, --L->top); /* move result to its place */ -} - - -static int callbinTM (lua_State *L, const TValue *p1, const TValue *p2, - StkId res, TMS event) { - const TValue *tm = luaT_gettmbyobj(L, p1, event); /* try first operand */ - if (notm(tm)) - tm = luaT_gettmbyobj(L, p2, event); /* try second operand */ - if (notm(tm)) return 0; - luaT_callTMres(L, tm, p1, p2, res); - return 1; -} - - -void luaT_trybinTM (lua_State *L, const TValue *p1, const TValue *p2, - StkId res, TMS event) { - if (l_unlikely(!callbinTM(L, p1, p2, res, event))) { - switch (event) { - case TM_BAND: case TM_BOR: case TM_BXOR: - case TM_SHL: case TM_SHR: case TM_BNOT: { - if (ttisnumber(p1) && ttisnumber(p2)) - luaG_tointerror(L, p1, p2); - else - luaG_opinterror(L, p1, p2, "perform bitwise operation on"); - } - /* calls never return, but to avoid warnings: *//* FALLTHROUGH */ - default: - luaG_opinterror(L, p1, p2, "perform arithmetic on"); - } - } -} - - -void luaT_tryconcatTM (lua_State *L) { - StkId top = L->top; - if (l_unlikely(!callbinTM(L, s2v(top - 2), s2v(top - 1), top - 2, - TM_CONCAT))) - luaG_concaterror(L, s2v(top - 2), s2v(top - 1)); -} - - -void luaT_trybinassocTM (lua_State *L, const TValue *p1, const TValue *p2, - int flip, StkId res, TMS event) { - if (flip) - luaT_trybinTM(L, p2, p1, res, event); - else - luaT_trybinTM(L, p1, p2, res, event); -} - - -void luaT_trybiniTM (lua_State *L, const TValue *p1, lua_Integer i2, - int flip, StkId res, TMS event) { - TValue aux; - setivalue(&aux, i2); - luaT_trybinassocTM(L, p1, &aux, flip, res, event); -} - - -/* -** Calls an order tag method. -** For lessequal, LUA_COMPAT_LT_LE keeps compatibility with old -** behavior: if there is no '__le', try '__lt', based on l <= r iff -** !(r < l) (assuming a total order). If the metamethod yields during -** this substitution, the continuation has to know about it (to negate -** the result of rtop, event)) /* try original event */ - return !l_isfalse(s2v(L->top)); -#if defined(LUA_COMPAT_LT_LE) - else if (event == TM_LE) { - /* try '!(p2 < p1)' for '(p1 <= p2)' */ - L->ci->callstatus |= CIST_LEQ; /* mark it is doing 'lt' for 'le' */ - if (callbinTM(L, p2, p1, L->top, TM_LT)) { - L->ci->callstatus ^= CIST_LEQ; /* clear mark */ - return l_isfalse(s2v(L->top)); - } - /* else error will remove this 'ci'; no need to clear mark */ - } -#endif - luaG_ordererror(L, p1, p2); /* no metamethod found */ - return 0; /* to avoid warnings */ -} - - -int luaT_callorderiTM (lua_State *L, const TValue *p1, int v2, - int flip, int isfloat, TMS event) { - TValue aux; const TValue *p2; - if (isfloat) { - setfltvalue(&aux, cast_num(v2)); - } - else - setivalue(&aux, v2); - if (flip) { /* arguments were exchanged? */ - p2 = p1; p1 = &aux; /* correct them */ - } - else - p2 = &aux; - return luaT_callorderTM(L, p1, p2, event); -} - - -void luaT_adjustvarargs (lua_State *L, int nfixparams, CallInfo *ci, - const Proto *p) { - int i; - int actual = cast_int(L->top - ci->func) - 1; /* number of arguments */ - int nextra = actual - nfixparams; /* number of extra arguments */ - ci->u.l.nextraargs = nextra; - luaD_checkstack(L, p->maxstacksize + 1); - /* copy function to the top of the stack */ - setobjs2s(L, L->top++, ci->func); - /* move fixed parameters to the top of the stack */ - for (i = 1; i <= nfixparams; i++) { - setobjs2s(L, L->top++, ci->func + i); - setnilvalue(s2v(ci->func + i)); /* erase original parameter (for GC) */ - } - ci->func += actual + 1; - ci->top += actual + 1; - lua_assert(L->top <= ci->top && ci->top <= L->stack_last); -} - - -void luaT_getvarargs (lua_State *L, CallInfo *ci, StkId where, int wanted) { - int i; - int nextra = ci->u.l.nextraargs; - if (wanted < 0) { - wanted = nextra; /* get all extra arguments available */ - checkstackGCp(L, nextra, where); /* ensure stack space */ - L->top = where + nextra; /* next instruction will need top */ - } - for (i = 0; i < wanted && i < nextra; i++) - setobjs2s(L, where + i, ci->func - nextra + i); - for (; i < wanted; i++) /* complete required results with nil */ - setnilvalue(s2v(where + i)); -} - diff --git a/lua-5.4.4/src/ltm.h b/lua-5.4.4/src/ltm.h deleted file mode 100644 index 73b833c..0000000 --- a/lua-5.4.4/src/ltm.h +++ /dev/null @@ -1,103 +0,0 @@ -/* -** $Id: ltm.h $ -** Tag methods -** See Copyright Notice in lua.h -*/ - -#ifndef ltm_h -#define ltm_h - - -#include "lobject.h" - - -/* -* WARNING: if you change the order of this enumeration, -* grep "ORDER TM" and "ORDER OP" -*/ -typedef enum { - TM_INDEX, - TM_NEWINDEX, - TM_GC, - TM_MODE, - TM_LEN, - TM_EQ, /* last tag method with fast access */ - TM_ADD, - TM_SUB, - TM_MUL, - TM_MOD, - TM_POW, - TM_DIV, - TM_IDIV, - TM_BAND, - TM_BOR, - TM_BXOR, - TM_SHL, - TM_SHR, - TM_UNM, - TM_BNOT, - TM_LT, - TM_LE, - TM_CONCAT, - TM_CALL, - TM_CLOSE, - TM_N /* number of elements in the enum */ -} TMS; - - -/* -** Mask with 1 in all fast-access methods. A 1 in any of these bits -** in the flag of a (meta)table means the metatable does not have the -** corresponding metamethod field. (Bit 7 of the flag is used for -** 'isrealasize'.) -*/ -#define maskflags (~(~0u << (TM_EQ + 1))) - - -/* -** Test whether there is no tagmethod. -** (Because tagmethods use raw accesses, the result may be an "empty" nil.) -*/ -#define notm(tm) ttisnil(tm) - - -#define gfasttm(g,et,e) ((et) == NULL ? NULL : \ - ((et)->flags & (1u<<(e))) ? NULL : luaT_gettm(et, e, (g)->tmname[e])) - -#define fasttm(l,et,e) gfasttm(G(l), et, e) - -#define ttypename(x) luaT_typenames_[(x) + 1] - -LUAI_DDEC(const char *const luaT_typenames_[LUA_TOTALTYPES];) - - -LUAI_FUNC const char *luaT_objtypename (lua_State *L, const TValue *o); - -LUAI_FUNC const TValue *luaT_gettm (Table *events, TMS event, TString *ename); -LUAI_FUNC const TValue *luaT_gettmbyobj (lua_State *L, const TValue *o, - TMS event); -LUAI_FUNC void luaT_init (lua_State *L); - -LUAI_FUNC void luaT_callTM (lua_State *L, const TValue *f, const TValue *p1, - const TValue *p2, const TValue *p3); -LUAI_FUNC void luaT_callTMres (lua_State *L, const TValue *f, - const TValue *p1, const TValue *p2, StkId p3); -LUAI_FUNC void luaT_trybinTM (lua_State *L, const TValue *p1, const TValue *p2, - StkId res, TMS event); -LUAI_FUNC void luaT_tryconcatTM (lua_State *L); -LUAI_FUNC void luaT_trybinassocTM (lua_State *L, const TValue *p1, - const TValue *p2, int inv, StkId res, TMS event); -LUAI_FUNC void luaT_trybiniTM (lua_State *L, const TValue *p1, lua_Integer i2, - int inv, StkId res, TMS event); -LUAI_FUNC int luaT_callorderTM (lua_State *L, const TValue *p1, - const TValue *p2, TMS event); -LUAI_FUNC int luaT_callorderiTM (lua_State *L, const TValue *p1, int v2, - int inv, int isfloat, TMS event); - -LUAI_FUNC void luaT_adjustvarargs (lua_State *L, int nfixparams, - struct CallInfo *ci, const Proto *p); -LUAI_FUNC void luaT_getvarargs (lua_State *L, struct CallInfo *ci, - StkId where, int wanted); - - -#endif diff --git a/lua-5.4.4/src/lua.c b/lua-5.4.4/src/lua.c deleted file mode 100644 index 0f19004..0000000 --- a/lua-5.4.4/src/lua.c +++ /dev/null @@ -1,666 +0,0 @@ -/* -** $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. -*/ -static void createargtable (lua_State *L, char **argv, int argc, int script) { - int i, narg; - if (script == argc) script = 0; /* no script name? */ - narg = argc - (script + 1); /* number of positive indices */ - lua_createtable(L, narg, script + 1); - for (i = 0; i < argc; i++) { - lua_pushstring(L, argv[i]); - lua_rawseti(L, -2, i - script); - } - lua_setglobal(L, "arg"); -} - - -static int dochunk (lua_State *L, int status) { - if (status == LUA_OK) status = docall(L, 0, 0); - return report(L, status); -} - - -static int dofile (lua_State *L, const char *name) { - return dochunk(L, luaL_loadfile(L, name)); -} - - -static int dostring (lua_State *L, const char *s, const char *name) { - return dochunk(L, luaL_loadbuffer(L, s, strlen(s), name)); -} - - -/* -** 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). 'first' returns the first not-handled argument -** (either the script name or a bad argument in case of error). -*/ -static int collectargs (char **argv, int *first) { - int args = 0; - int i; - for (i = 1; argv[i] != NULL; i++) { - *first = i; - if (argv[i][0] != '-') /* not an option? */ - return args; /* stop handling options */ - switch (argv[i][1]) { /* else check option */ - case '-': /* '--' */ - if (argv[i][2] != '\0') /* extra characters after '--'? */ - return has_error; /* invalid option */ - *first = i + 1; - return args; - case '\0': /* '-' */ - return args; /* script "name" is '-' */ - case 'E': - if (argv[i][2] != '\0') /* extra characters? */ - return has_error; /* invalid option */ - args |= has_E; - break; - case 'W': - if (argv[i][2] != '\0') /* extra characters? */ - return has_error; /* invalid option */ - break; - case 'i': - args |= has_i; /* (-i implies -v) *//* FALLTHROUGH */ - case 'v': - if (argv[i][2] != '\0') /* extra characters? */ - return has_error; /* invalid option */ - args |= has_v; - break; - case 'e': - args |= has_e; /* FALLTHROUGH */ - case 'l': /* both options need an argument */ - if (argv[i][2] == '\0') { /* no concatenated argument? */ - i++; /* try next 'argv' */ - if (argv[i] == NULL || argv[i][0] == '-') - return has_error; /* no next argument or it is another option */ - } - break; - default: /* invalid option */ - return has_error; - } - } - *first = i; /* no script name */ - return args; -} - - -/* -** Processes options 'e' and 'l', which involve running Lua code, and -** 'W', which also affects the state. -** Returns 0 if some code raises an error. -*/ -static int runargs (lua_State *L, char **argv, int n) { - int i; - for (i = 1; i < n; i++) { - int option = argv[i][1]; - lua_assert(argv[i][0] == '-'); /* already checked */ - switch (option) { - case 'e': case 'l': { - int status; - char *extra = argv[i] + 2; /* both options need an argument */ - if (*extra == '\0') extra = argv[++i]; - lua_assert(extra != NULL); - status = (option == 'e') - ? dostring(L, extra, "=(command line)") - : dolibrary(L, extra); - if (status != LUA_OK) return 0; - break; - } - case 'W': - lua_warning(L, "@on", 0); /* warnings on */ - break; - } - } - return 1; -} - - -static int handle_luainit (lua_State *L) { - const char *name = "=" LUA_INITVARVERSION; - const char *init = getenv(name + 1); - if (init == NULL) { - name = "=" LUA_INIT_VAR; - init = getenv(name + 1); /* try alternative name */ - } - if (init == NULL) return LUA_OK; - else if (init[0] == '@') - return dofile(L, init+1); - else - return dostring(L, init, name); -} - - -/* -** {================================================================== -** Read-Eval-Print Loop (REPL) -** =================================================================== -*/ - -#if !defined(LUA_PROMPT) -#define LUA_PROMPT "> " -#define LUA_PROMPT2 ">> " -#endif - -#if !defined(LUA_MAXINPUT) -#define LUA_MAXINPUT 512 -#endif - - -/* -** lua_stdin_is_tty detects whether the standard input is a 'tty' (that -** is, whether we're running lua interactively). -*/ -#if !defined(lua_stdin_is_tty) /* { */ - -#if defined(LUA_USE_POSIX) /* { */ - -#include -#define lua_stdin_is_tty() isatty(0) - -#elif defined(LUA_USE_WINDOWS) /* }{ */ - -#include -#include - -#define lua_stdin_is_tty() _isatty(_fileno(stdin)) - -#else /* }{ */ - -/* ISO C definition */ -#define lua_stdin_is_tty() 1 /* assume stdin is a tty */ - -#endif /* } */ - -#endif /* } */ - - -/* -** lua_readline defines how to show a prompt and then read a line from -** the standard input. -** lua_saveline defines how to "save" a read line in a "history". -** lua_freeline defines how to free a line read by lua_readline. -*/ -#if !defined(lua_readline) /* { */ - -#if defined(LUA_USE_READLINE) /* { */ - -#include -#include -#define lua_initreadline(L) ((void)L, rl_readline_name="lua") -#define lua_readline(L,b,p) ((void)L, ((b)=readline(p)) != NULL) -#define lua_saveline(L,line) ((void)L, add_history(line)) -#define lua_freeline(L,b) ((void)L, free(b)) - -#else /* }{ */ - -#define lua_initreadline(L) ((void)L) -#define lua_readline(L,b,p) \ - ((void)L, fputs(p, stdout), fflush(stdout), /* show prompt */ \ - fgets(b, LUA_MAXINPUT, stdin) != NULL) /* get line */ -#define lua_saveline(L,line) { (void)L; (void)line; } -#define lua_freeline(L,b) { (void)L; (void)b; } - -#endif /* } */ - -#endif /* } */ - - -/* -** Return the string to be used as a prompt by the interpreter. Leave -** the string (or nil, if using the default value) on the stack, to keep -** it anchored. -*/ -static const char *get_prompt (lua_State *L, int firstline) { - if (lua_getglobal(L, firstline ? "_PROMPT" : "_PROMPT2") == LUA_TNIL) - return (firstline ? LUA_PROMPT : LUA_PROMPT2); /* use the default */ - else { /* apply 'tostring' over the value */ - const char *p = luaL_tolstring(L, -1, NULL); - lua_remove(L, -2); /* remove original value */ - return p; - } -} - -/* mark in error messages for incomplete statements */ -#define EOFMARK "" -#define marklen (sizeof(EOFMARK)/sizeof(char) - 1) - - -/* -** Check whether 'status' signals a syntax error and the error -** message at the top of the stack ends with the above mark for -** incomplete statements. -*/ -static int incomplete (lua_State *L, int status) { - if (status == LUA_ERRSYNTAX) { - size_t lmsg; - const char *msg = lua_tolstring(L, -1, &lmsg); - if (lmsg >= marklen && strcmp(msg + lmsg - marklen, EOFMARK) == 0) { - lua_pop(L, 1); - return 1; - } - } - return 0; /* else... */ -} - - -/* -** Prompt the user, read a line, and push it into the Lua stack. -*/ -static int pushline (lua_State *L, int firstline) { - char buffer[LUA_MAXINPUT]; - char *b = buffer; - size_t l; - const char *prmt = get_prompt(L, firstline); - int readstatus = lua_readline(L, b, prmt); - if (readstatus == 0) - return 0; /* no input (prompt will be popped by caller) */ - lua_pop(L, 1); /* remove prompt */ - l = strlen(b); - if (l > 0 && b[l-1] == '\n') /* line ends with newline? */ - b[--l] = '\0'; /* remove it */ - if (firstline && b[0] == '=') /* for compatibility with 5.2, ... */ - lua_pushfstring(L, "return %s", b + 1); /* change '=' to 'return' */ - else - lua_pushlstring(L, b, l); - lua_freeline(L, b); - return 1; -} - - -/* -** Try to compile line on the stack as 'return ;'; on return, stack -** has either compiled chunk or original line (if compilation failed). -*/ -static int addreturn (lua_State *L) { - const char *line = lua_tostring(L, -1); /* original line */ - const char *retline = lua_pushfstring(L, "return %s;", line); - int status = luaL_loadbuffer(L, retline, strlen(retline), "=stdin"); - if (status == LUA_OK) { - lua_remove(L, -2); /* remove modified line */ - if (line[0] != '\0') /* non empty? */ - lua_saveline(L, line); /* keep history */ - } - else - lua_pop(L, 2); /* pop result from 'luaL_loadbuffer' and modified line */ - return status; -} - - -/* -** Read multiple lines until a complete Lua statement -*/ -static int multiline (lua_State *L) { - for (;;) { /* repeat until gets a complete statement */ - size_t len; - const char *line = lua_tolstring(L, 1, &len); /* get what it has */ - int status = luaL_loadbuffer(L, line, len, "=stdin"); /* try it */ - if (!incomplete(L, status) || !pushline(L, 0)) { - lua_saveline(L, line); /* keep history */ - return status; /* cannot or should not try to add continuation line */ - } - lua_pushliteral(L, "\n"); /* add newline... */ - lua_insert(L, -2); /* ...between the two lines */ - lua_concat(L, 3); /* join them */ - } -} - - -/* -** Read a line and try to load (compile) it first as an expression (by -** adding "return " in front of it) and second as a statement. Return -** the final status of load/call with the resulting function (if any) -** in the top of the stack. -*/ -static int loadline (lua_State *L) { - int status; - lua_settop(L, 0); - if (!pushline(L, 1)) - return -1; /* no input */ - if ((status = addreturn(L)) != LUA_OK) /* 'return ...' did not work? */ - status = multiline(L); /* try as command, maybe with continuation lines */ - lua_remove(L, 1); /* remove line from the stack */ - lua_assert(lua_gettop(L) == 1); - return status; -} - - -/* -** Prints (calling the Lua 'print' function) any values on the stack -*/ -static void l_print (lua_State *L) { - int n = lua_gettop(L); - if (n > 0) { /* any result to be printed? */ - luaL_checkstack(L, LUA_MINSTACK, "too many results to print"); - lua_getglobal(L, "print"); - lua_insert(L, 1); - if (lua_pcall(L, n, 0, 0) != LUA_OK) - l_message(progname, lua_pushfstring(L, "error calling 'print' (%s)", - lua_tostring(L, -1))); - } -} - - -/* -** Do the REPL: repeatedly read (load) a line, evaluate (call) it, and -** print any results. -*/ -static void doREPL (lua_State *L) { - int status; - const char *oldprogname = progname; - progname = NULL; /* no 'progname' on errors in interactive mode */ - lua_initreadline(L); - while ((status = loadline(L)) != -1) { - if (status == LUA_OK) - status = docall(L, 0, LUA_MULTRET); - if (status == LUA_OK) l_print(L); - else report(L, status); - } - lua_settop(L, 0); /* clear stack */ - lua_writeline(); - progname = oldprogname; -} - -/* }================================================================== */ - - -/* -** Main body of stand-alone interpreter (to be called in protected mode). -** Reads the options and handles them all. -*/ -static int pmain (lua_State *L) { - int argc = (int)lua_tointeger(L, 1); - char **argv = (char **)lua_touserdata(L, 2); - int script; - int args = collectargs(argv, &script); - luaL_checkversion(L); /* check that interpreter has correct version */ - if (argv[0] && argv[0][0]) progname = argv[0]; - if (args == has_error) { /* bad arg? */ - print_usage(argv[script]); /* 'script' has index of bad arg. */ - return 0; - } - if (args & has_v) /* option '-v'? */ - print_version(); - if (args & has_E) { /* option '-E'? */ - lua_pushboolean(L, 1); /* signal for libraries to ignore env. vars. */ - lua_setfield(L, LUA_REGISTRYINDEX, "LUA_NOENV"); - } - luaL_openlibs(L); /* open standard libraries */ - createargtable(L, argv, argc, script); /* create table 'arg' */ - lua_gc(L, LUA_GCGEN, 0, 0); /* GC in generational mode */ - if (!(args & has_E)) { /* no option '-E'? */ - if (handle_luainit(L) != LUA_OK) /* run LUA_INIT */ - return 0; /* error running LUA_INIT */ - } - if (!runargs(L, argv, script)) /* execute arguments -e and -l */ - return 0; /* something failed */ - if (script < argc && /* execute main script (if there is one) */ - handle_script(L, argv + script) != LUA_OK) - return 0; - if (args & has_i) /* -i option? */ - doREPL(L); /* do read-eval-print loop */ - else if (script == argc && !(args & (has_e | has_v))) { /* no arguments? */ - if (lua_stdin_is_tty()) { /* running in interactive mode? */ - print_version(); - doREPL(L); /* do read-eval-print loop */ - } - else dofile(L, NULL); /* executes stdin as a file */ - } - lua_pushboolean(L, 1); /* signal no errors */ - return 1; -} - - -int main (int argc, char **argv) { - int status, result; - lua_State *L = luaL_newstate(); /* create state */ - if (L == NULL) { - l_message(argv[0], "cannot create state: not enough memory"); - return EXIT_FAILURE; - } - lua_pushcfunction(L, &pmain); /* to call 'pmain' in protected mode */ - lua_pushinteger(L, argc); /* 1st argument */ - lua_pushlightuserdata(L, argv); /* 2nd argument */ - status = lua_pcall(L, 2, 1, 0); /* do the call */ - result = lua_toboolean(L, -1); /* get result */ - report(L, status); - lua_close(L); - return (result && status == LUA_OK) ? EXIT_SUCCESS : EXIT_FAILURE; -} - diff --git a/lua-5.4.4/src/luac.c b/lua-5.4.4/src/luac.c deleted file mode 100644 index f6db9cf..0000000 --- a/lua-5.4.4/src/luac.c +++ /dev/null @@ -1,725 +0,0 @@ -/* -** $Id: luac.c $ -** Lua compiler (saves bytecodes to files; also lists bytecodes) -** See Copyright Notice in lua.h -*/ - -#define luac_c -#define LUA_CORE - -#include "lprefix.h" - -#include -#include -#include -#include -#include - -#include "lua.h" -#include "lauxlib.h" - -#include "ldebug.h" -#include "lobject.h" -#include "lopcodes.h" -#include "lopnames.h" -#include "lstate.h" -#include "lundump.h" - -static void PrintFunction(const Proto* f, int full); -#define luaU_print PrintFunction - -#define PROGNAME "luac" /* default program name */ -#define OUTPUT PROGNAME ".out" /* default output file */ - -static int listing=0; /* list bytecodes? */ -static int dumping=1; /* dump bytecodes? */ -static int stripping=0; /* strip debug information? */ -static char Output[]={ OUTPUT }; /* default output file name */ -static const char* output=Output; /* actual output file name */ -static const char* progname=PROGNAME; /* actual program name */ -static TString **tmname; - -static void fatal(const char* message) -{ - fprintf(stderr,"%s: %s\n",progname,message); - exit(EXIT_FAILURE); -} - -static void cannot(const char* what) -{ - fprintf(stderr,"%s: cannot %s %s: %s\n",progname,what,output,strerror(errno)); - exit(EXIT_FAILURE); -} - -static void usage(const char* message) -{ - if (*message=='-') - fprintf(stderr,"%s: unrecognized option '%s'\n",progname,message); - else - fprintf(stderr,"%s: %s\n",progname,message); - fprintf(stderr, - "usage: %s [options] [filenames]\n" - "Available options are:\n" - " -l list (use -l -l for full listing)\n" - " -o name output to file 'name' (default is \"%s\")\n" - " -p parse only\n" - " -s strip debug information\n" - " -v show version information\n" - " -- stop handling options\n" - " - stop handling options and process stdin\n" - ,progname,Output); - exit(EXIT_FAILURE); -} - -#define IS(s) (strcmp(argv[i],s)==0) - -static int doargs(int argc, char* argv[]) -{ - int i; - int version=0; - if (argv[0]!=NULL && *argv[0]!=0) progname=argv[0]; - for (i=1; itop+(i))) - -static const Proto* combine(lua_State* L, int n) -{ - if (n==1) - return toproto(L,-1); - else - { - Proto* f; - int i=n; - if (lua_load(L,reader,&i,"=(" PROGNAME ")",NULL)!=LUA_OK) fatal(lua_tostring(L,-1)); - f=toproto(L,-1); - for (i=0; ip[i]=toproto(L,i-n-1); - if (f->p[i]->sizeupvalues>0) f->p[i]->upvalues[0].instack=0; - } - luaM_freearray(L,f->lineinfo,f->sizelineinfo); - f->sizelineinfo=0; - return f; - } -} - -static int writer(lua_State* L, const void* p, size_t size, void* u) -{ - UNUSED(L); - return (fwrite(p,size,1,(FILE*)u)!=1) && (size!=0); -} - -static int pmain(lua_State* L) -{ - int argc=(int)lua_tointeger(L,1); - char** argv=(char**)lua_touserdata(L,2); - const Proto* f; - int i; - tmname=G(L)->tmname; - if (!lua_checkstack(L,argc)) fatal("too many input files"); - for (i=0; i1); - if (dumping) - { - FILE* D= (output==NULL) ? stdout : fopen(output,"wb"); - if (D==NULL) cannot("open"); - lua_lock(L); - luaU_dump(L,f,writer,D,stripping); - lua_unlock(L); - if (ferror(D)) cannot("write"); - if (fclose(D)) cannot("close"); - } - return 0; -} - -int main(int argc, char* argv[]) -{ - lua_State* L; - int i=doargs(argc,argv); - argc-=i; argv+=i; - if (argc<=0) usage("no input files given"); - L=luaL_newstate(); - if (L==NULL) fatal("cannot create state: not enough memory"); - lua_pushcfunction(L,&pmain); - lua_pushinteger(L,argc); - lua_pushlightuserdata(L,argv); - if (lua_pcall(L,2,0,0)!=LUA_OK) fatal(lua_tostring(L,-1)); - lua_close(L); - return EXIT_SUCCESS; -} - -/* -** print bytecodes -*/ - -#define UPVALNAME(x) ((f->upvalues[x].name) ? getstr(f->upvalues[x].name) : "-") -#define VOID(p) ((const void*)(p)) -#define eventname(i) (getstr(tmname[i])) - -static void PrintString(const TString* ts) -{ - const char* s=getstr(ts); - size_t i,n=tsslen(ts); - printf("\""); - for (i=0; ik[i]; - switch (ttypetag(o)) - { - case LUA_VNIL: - printf("N"); - break; - case LUA_VFALSE: - case LUA_VTRUE: - printf("B"); - break; - case LUA_VNUMFLT: - printf("F"); - break; - case LUA_VNUMINT: - printf("I"); - break; - case LUA_VSHRSTR: - case LUA_VLNGSTR: - printf("S"); - break; - default: /* cannot happen */ - printf("?%d",ttypetag(o)); - break; - } - printf("\t"); -} - -static void PrintConstant(const Proto* f, int i) -{ - const TValue* o=&f->k[i]; - switch (ttypetag(o)) - { - case LUA_VNIL: - printf("nil"); - break; - case LUA_VFALSE: - printf("false"); - break; - case LUA_VTRUE: - printf("true"); - break; - case LUA_VNUMFLT: - { - char buff[100]; - sprintf(buff,LUA_NUMBER_FMT,fltvalue(o)); - printf("%s",buff); - if (buff[strspn(buff,"-0123456789")]=='\0') printf(".0"); - break; - } - case LUA_VNUMINT: - printf(LUA_INTEGER_FMT,ivalue(o)); - break; - case LUA_VSHRSTR: - case LUA_VLNGSTR: - PrintString(tsvalue(o)); - break; - default: /* cannot happen */ - printf("?%d",ttypetag(o)); - break; - } -} - -#define COMMENT "\t; " -#define EXTRAARG GETARG_Ax(code[pc+1]) -#define EXTRAARGC (EXTRAARG*(MAXARG_C+1)) -#define ISK (isk ? "k" : "") - -static void PrintCode(const Proto* f) -{ - const Instruction* code=f->code; - int pc,n=f->sizecode; - for (pc=0; pc0) printf("[%d]\t",line); else printf("[-]\t"); - printf("%-9s\t",opnames[o]); - switch (o) - { - case OP_MOVE: - printf("%d %d",a,b); - break; - case OP_LOADI: - printf("%d %d",a,sbx); - break; - case OP_LOADF: - printf("%d %d",a,sbx); - break; - case OP_LOADK: - printf("%d %d",a,bx); - printf(COMMENT); PrintConstant(f,bx); - break; - case OP_LOADKX: - printf("%d",a); - printf(COMMENT); PrintConstant(f,EXTRAARG); - break; - case OP_LOADFALSE: - printf("%d",a); - break; - case OP_LFALSESKIP: - printf("%d",a); - break; - case OP_LOADTRUE: - printf("%d",a); - break; - case OP_LOADNIL: - printf("%d %d",a,b); - printf(COMMENT "%d out",b+1); - break; - case OP_GETUPVAL: - printf("%d %d",a,b); - printf(COMMENT "%s",UPVALNAME(b)); - break; - case OP_SETUPVAL: - printf("%d %d",a,b); - printf(COMMENT "%s",UPVALNAME(b)); - break; - case OP_GETTABUP: - printf("%d %d %d",a,b,c); - printf(COMMENT "%s",UPVALNAME(b)); - printf(" "); PrintConstant(f,c); - break; - case OP_GETTABLE: - printf("%d %d %d",a,b,c); - break; - case OP_GETI: - printf("%d %d %d",a,b,c); - break; - case OP_GETFIELD: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_SETTABUP: - printf("%d %d %d%s",a,b,c,ISK); - printf(COMMENT "%s",UPVALNAME(a)); - printf(" "); PrintConstant(f,b); - if (isk) { printf(" "); PrintConstant(f,c); } - break; - case OP_SETTABLE: - printf("%d %d %d%s",a,b,c,ISK); - if (isk) { printf(COMMENT); PrintConstant(f,c); } - break; - case OP_SETI: - printf("%d %d %d%s",a,b,c,ISK); - if (isk) { printf(COMMENT); PrintConstant(f,c); } - break; - case OP_SETFIELD: - printf("%d %d %d%s",a,b,c,ISK); - printf(COMMENT); PrintConstant(f,b); - if (isk) { printf(" "); PrintConstant(f,c); } - break; - case OP_NEWTABLE: - printf("%d %d %d",a,b,c); - printf(COMMENT "%d",c+EXTRAARGC); - break; - case OP_SELF: - printf("%d %d %d%s",a,b,c,ISK); - if (isk) { printf(COMMENT); PrintConstant(f,c); } - break; - case OP_ADDI: - printf("%d %d %d",a,b,sc); - break; - case OP_ADDK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_SUBK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_MULK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_MODK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_POWK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_DIVK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_IDIVK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_BANDK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_BORK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_BXORK: - printf("%d %d %d",a,b,c); - printf(COMMENT); PrintConstant(f,c); - break; - case OP_SHRI: - printf("%d %d %d",a,b,sc); - break; - case OP_SHLI: - printf("%d %d %d",a,b,sc); - break; - case OP_ADD: - printf("%d %d %d",a,b,c); - break; - case OP_SUB: - printf("%d %d %d",a,b,c); - break; - case OP_MUL: - printf("%d %d %d",a,b,c); - break; - case OP_MOD: - printf("%d %d %d",a,b,c); - break; - case OP_POW: - printf("%d %d %d",a,b,c); - break; - case OP_DIV: - printf("%d %d %d",a,b,c); - break; - case OP_IDIV: - printf("%d %d %d",a,b,c); - break; - case OP_BAND: - printf("%d %d %d",a,b,c); - break; - case OP_BOR: - printf("%d %d %d",a,b,c); - break; - case OP_BXOR: - printf("%d %d %d",a,b,c); - break; - case OP_SHL: - printf("%d %d %d",a,b,c); - break; - case OP_SHR: - printf("%d %d %d",a,b,c); - break; - case OP_MMBIN: - printf("%d %d %d",a,b,c); - printf(COMMENT "%s",eventname(c)); - break; - case OP_MMBINI: - printf("%d %d %d %d",a,sb,c,isk); - printf(COMMENT "%s",eventname(c)); - if (isk) printf(" flip"); - break; - case OP_MMBINK: - printf("%d %d %d %d",a,b,c,isk); - printf(COMMENT "%s ",eventname(c)); PrintConstant(f,b); - if (isk) printf(" flip"); - break; - case OP_UNM: - printf("%d %d",a,b); - break; - case OP_BNOT: - printf("%d %d",a,b); - break; - case OP_NOT: - printf("%d %d",a,b); - break; - case OP_LEN: - printf("%d %d",a,b); - break; - case OP_CONCAT: - printf("%d %d",a,b); - break; - case OP_CLOSE: - printf("%d",a); - break; - case OP_TBC: - printf("%d",a); - break; - case OP_JMP: - printf("%d",GETARG_sJ(i)); - printf(COMMENT "to %d",GETARG_sJ(i)+pc+2); - break; - case OP_EQ: - printf("%d %d %d",a,b,isk); - break; - case OP_LT: - printf("%d %d %d",a,b,isk); - break; - case OP_LE: - printf("%d %d %d",a,b,isk); - break; - case OP_EQK: - printf("%d %d %d",a,b,isk); - printf(COMMENT); PrintConstant(f,b); - break; - case OP_EQI: - printf("%d %d %d",a,sb,isk); - break; - case OP_LTI: - printf("%d %d %d",a,sb,isk); - break; - case OP_LEI: - printf("%d %d %d",a,sb,isk); - break; - case OP_GTI: - printf("%d %d %d",a,sb,isk); - break; - case OP_GEI: - printf("%d %d %d",a,sb,isk); - break; - case OP_TEST: - printf("%d %d",a,isk); - break; - case OP_TESTSET: - printf("%d %d %d",a,b,isk); - break; - case OP_CALL: - printf("%d %d %d",a,b,c); - printf(COMMENT); - if (b==0) printf("all in "); else printf("%d in ",b-1); - if (c==0) printf("all out"); else printf("%d out",c-1); - break; - case OP_TAILCALL: - printf("%d %d %d%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.4/src/lundump.c b/lua-5.4.4/src/lundump.c deleted file mode 100644 index 5aa55c4..0000000 --- a/lua-5.4.4/src/lundump.c +++ /dev/null @@ -1,333 +0,0 @@ -/* -** $Id: lundump.c $ -** load precompiled Lua chunks -** See Copyright Notice in lua.h -*/ - -#define lundump_c -#define LUA_CORE - -#include "lprefix.h" - - -#include -#include - -#include "lua.h" - -#include "ldebug.h" -#include "ldo.h" -#include "lfunc.h" -#include "lmem.h" -#include "lobject.h" -#include "lstring.h" -#include "lundump.h" -#include "lzio.h" - - -#if !defined(luai_verifycode) -#define luai_verifycode(L,f) /* empty */ -#endif - - -typedef struct { - lua_State *L; - ZIO *Z; - const char *name; -} LoadState; - - -static l_noret error (LoadState *S, const char *why) { - luaO_pushfstring(S->L, "%s: bad binary format (%s)", S->name, why); - luaD_throw(S->L, LUA_ERRSYNTAX); -} - - -/* -** All high-level loads go through loadVector; you can change it to -** adapt to the endianness of the input -*/ -#define loadVector(S,b,n) loadBlock(S,b,(n)*sizeof((b)[0])) - -static void loadBlock (LoadState *S, void *b, size_t size) { - if (luaZ_read(S->Z, b, size) != 0) - error(S, "truncated chunk"); -} - - -#define loadVar(S,x) loadVector(S,&x,1) - - -static lu_byte loadByte (LoadState *S) { - int b = zgetc(S->Z); - if (b == EOZ) - error(S, "truncated chunk"); - return cast_byte(b); -} - - -static size_t loadUnsigned (LoadState *S, size_t limit) { - size_t x = 0; - int b; - limit >>= 7; - do { - b = loadByte(S); - if (x >= limit) - error(S, "integer overflow"); - x = (x << 7) | (b & 0x7f); - } while ((b & 0x80) == 0); - return x; -} - - -static size_t loadSize (LoadState *S) { - return loadUnsigned(S, ~(size_t)0); -} - - -static int loadInt (LoadState *S) { - return cast_int(loadUnsigned(S, INT_MAX)); -} - - -static lua_Number loadNumber (LoadState *S) { - lua_Number x; - loadVar(S, x); - return x; -} - - -static lua_Integer loadInteger (LoadState *S) { - lua_Integer x; - loadVar(S, x); - return x; -} - - -/* -** Load a nullable string into prototype 'p'. -*/ -static TString *loadStringN (LoadState *S, Proto *p) { - lua_State *L = S->L; - TString *ts; - size_t size = loadSize(S); - if (size == 0) /* no string? */ - return NULL; - else if (--size <= LUAI_MAXSHORTLEN) { /* short string? */ - char buff[LUAI_MAXSHORTLEN]; - loadVector(S, buff, size); /* load string into buffer */ - ts = luaS_newlstr(L, buff, size); /* create string */ - } - else { /* long string */ - ts = luaS_createlngstrobj(L, size); /* create string */ - setsvalue2s(L, L->top, ts); /* anchor it ('loadVector' can GC) */ - luaD_inctop(L); - loadVector(S, getstr(ts), size); /* load directly in final place */ - L->top--; /* pop string */ - } - luaC_objbarrier(L, p, ts); - return ts; -} - - -/* -** Load a non-nullable string into prototype 'p'. -*/ -static TString *loadString (LoadState *S, Proto *p) { - TString *st = loadStringN(S, p); - if (st == NULL) - error(S, "bad format for constant string"); - return st; -} - - -static void loadCode (LoadState *S, Proto *f) { - int n = loadInt(S); - f->code = luaM_newvectorchecked(S->L, n, Instruction); - f->sizecode = n; - loadVector(S, f->code, n); -} - - -static void loadFunction(LoadState *S, Proto *f, TString *psource); - - -static void loadConstants (LoadState *S, Proto *f) { - int i; - int n = loadInt(S); - f->k = luaM_newvectorchecked(S->L, n, TValue); - f->sizek = n; - for (i = 0; i < n; i++) - setnilvalue(&f->k[i]); - for (i = 0; i < n; i++) { - TValue *o = &f->k[i]; - int t = loadByte(S); - switch (t) { - case LUA_VNIL: - setnilvalue(o); - break; - case LUA_VFALSE: - setbfvalue(o); - break; - case LUA_VTRUE: - setbtvalue(o); - break; - case LUA_VNUMFLT: - setfltvalue(o, loadNumber(S)); - break; - case LUA_VNUMINT: - setivalue(o, loadInteger(S)); - break; - case LUA_VSHRSTR: - case LUA_VLNGSTR: - setsvalue2n(S->L, o, loadString(S, f)); - break; - default: lua_assert(0); - } - } -} - - -static void loadProtos (LoadState *S, Proto *f) { - int i; - int n = loadInt(S); - f->p = luaM_newvectorchecked(S->L, n, Proto *); - f->sizep = n; - for (i = 0; i < n; i++) - f->p[i] = NULL; - for (i = 0; i < n; i++) { - f->p[i] = luaF_newproto(S->L); - luaC_objbarrier(S->L, f, f->p[i]); - loadFunction(S, f->p[i], f->source); - } -} - - -/* -** Load the upvalues for a function. The names must be filled first, -** because the filling of the other fields can raise read errors and -** the creation of the error message can call an emergency collection; -** in that case all prototypes must be consistent for the GC. -*/ -static void loadUpvalues (LoadState *S, Proto *f) { - int i, n; - n = loadInt(S); - f->upvalues = luaM_newvectorchecked(S->L, n, Upvaldesc); - f->sizeupvalues = n; - for (i = 0; i < n; i++) /* make array valid for GC */ - f->upvalues[i].name = NULL; - for (i = 0; i < n; i++) { /* following calls can raise errors */ - f->upvalues[i].instack = loadByte(S); - f->upvalues[i].idx = loadByte(S); - f->upvalues[i].kind = loadByte(S); - } -} - - -static void loadDebug (LoadState *S, Proto *f) { - int i, n; - n = loadInt(S); - f->lineinfo = luaM_newvectorchecked(S->L, n, ls_byte); - f->sizelineinfo = n; - loadVector(S, f->lineinfo, n); - n = loadInt(S); - f->abslineinfo = luaM_newvectorchecked(S->L, n, AbsLineInfo); - f->sizeabslineinfo = n; - for (i = 0; i < n; i++) { - f->abslineinfo[i].pc = loadInt(S); - f->abslineinfo[i].line = loadInt(S); - } - n = loadInt(S); - f->locvars = luaM_newvectorchecked(S->L, n, LocVar); - f->sizelocvars = n; - for (i = 0; i < n; i++) - f->locvars[i].varname = NULL; - for (i = 0; i < n; i++) { - f->locvars[i].varname = loadStringN(S, f); - f->locvars[i].startpc = loadInt(S); - f->locvars[i].endpc = loadInt(S); - } - n = loadInt(S); - for (i = 0; i < n; i++) - f->upvalues[i].name = loadStringN(S, f); -} - - -static void loadFunction (LoadState *S, Proto *f, TString *psource) { - f->source = loadStringN(S, f); - if (f->source == NULL) /* no source in dump? */ - f->source = psource; /* reuse parent's source */ - f->linedefined = loadInt(S); - f->lastlinedefined = loadInt(S); - f->numparams = loadByte(S); - f->is_vararg = loadByte(S); - f->maxstacksize = loadByte(S); - loadCode(S, f); - loadConstants(S, f); - loadUpvalues(S, f); - loadProtos(S, f); - loadDebug(S, f); -} - - -static void checkliteral (LoadState *S, const char *s, const char *msg) { - char buff[sizeof(LUA_SIGNATURE) + sizeof(LUAC_DATA)]; /* larger than both */ - size_t len = strlen(s); - loadVector(S, buff, len); - if (memcmp(s, buff, len) != 0) - error(S, msg); -} - - -static void fchecksize (LoadState *S, size_t size, const char *tname) { - if (loadByte(S) != size) - error(S, luaO_pushfstring(S->L, "%s size mismatch", tname)); -} - - -#define checksize(S,t) fchecksize(S,sizeof(t),#t) - -static void checkHeader (LoadState *S) { - /* skip 1st char (already read and checked) */ - checkliteral(S, &LUA_SIGNATURE[1], "not a binary chunk"); - if (loadByte(S) != LUAC_VERSION) - error(S, "version mismatch"); - if (loadByte(S) != LUAC_FORMAT) - error(S, "format mismatch"); - checkliteral(S, LUAC_DATA, "corrupted chunk"); - checksize(S, Instruction); - checksize(S, lua_Integer); - checksize(S, lua_Number); - if (loadInteger(S) != LUAC_INT) - error(S, "integer format mismatch"); - if (loadNumber(S) != LUAC_NUM) - error(S, "float format mismatch"); -} - - -/* -** Load precompiled chunk. -*/ -LClosure *luaU_undump(lua_State *L, ZIO *Z, const char *name) { - LoadState S; - LClosure *cl; - if (*name == '@' || *name == '=') - S.name = name + 1; - else if (*name == LUA_SIGNATURE[0]) - S.name = "binary string"; - else - S.name = name; - S.L = L; - S.Z = Z; - checkHeader(&S); - cl = luaF_newLclosure(L, loadByte(&S)); - setclLvalue2s(L, L->top, cl); - luaD_inctop(L); - cl->p = luaF_newproto(L); - luaC_objbarrier(L, cl, cl->p); - loadFunction(&S, cl->p, NULL); - lua_assert(cl->nupvalues == cl->p->sizeupvalues); - luai_verifycode(L, cl->p); - return cl; -} - diff --git a/lua-5.4.4/src/lundump.h b/lua-5.4.4/src/lundump.h deleted file mode 100644 index f3748a9..0000000 --- a/lua-5.4.4/src/lundump.h +++ /dev/null @@ -1,36 +0,0 @@ -/* -** $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.4/src/lutf8lib.c b/lua-5.4.4/src/lutf8lib.c deleted file mode 100644 index e7bf098..0000000 --- a/lua-5.4.4/src/lutf8lib.c +++ /dev/null @@ -1,286 +0,0 @@ -/* -** $Id: lutf8lib.c $ -** Standard library for UTF-8 manipulation -** See Copyright Notice in lua.h -*/ - -#define lutf8lib_c -#define LUA_LIB - -#include "lprefix.h" - - -#include -#include -#include -#include - -#include "lua.h" - -#include "lauxlib.h" -#include "lualib.h" - - -#define MAXUNICODE 0x10FFFFu - -#define MAXUTF 0x7FFFFFFFu - -/* -** Integer type for decoded UTF-8 values; MAXUTF needs 31 bits. -*/ -#if (UINT_MAX >> 30) >= 1 -typedef unsigned int utfint; -#else -typedef unsigned long utfint; -#endif - - -#define iscont(p) ((*(p) & 0xC0) == 0x80) - - -/* from strlib */ -/* translate a relative string position: negative means back from end */ -static lua_Integer u_posrelat (lua_Integer pos, size_t len) { - if (pos >= 0) return pos; - else if (0u - (size_t)pos > len) return 0; - else return (lua_Integer)len + pos + 1; -} - - -/* -** Decode one UTF-8 sequence, returning NULL if byte sequence is -** invalid. The array 'limits' stores the minimum value for each -** sequence length, to check for overlong representations. Its first -** entry forces an error for non-ascii bytes with no continuation -** bytes (count == 0). -*/ -static const char *utf8_decode (const char *s, utfint *val, int strict) { - static const utfint limits[] = - {~(utfint)0, 0x80, 0x800, 0x10000u, 0x200000u, 0x4000000u}; - unsigned int c = (unsigned char)s[0]; - utfint res = 0; /* final result */ - if (c < 0x80) /* ascii? */ - res = c; - else { - int count = 0; /* to count number of continuation bytes */ - for (; c & 0x40; c <<= 1) { /* while it needs continuation bytes... */ - unsigned int cc = (unsigned char)s[++count]; /* read next byte */ - if ((cc & 0xC0) != 0x80) /* not a continuation byte? */ - return NULL; /* invalid byte sequence */ - res = (res << 6) | (cc & 0x3F); /* add lower 6 bits from cont. byte */ - } - res |= ((utfint)(c & 0x7F) << (count * 5)); /* add first byte */ - if (count > 5 || res > MAXUTF || res < limits[count]) - return NULL; /* invalid byte sequence */ - s += count; /* skip continuation bytes read */ - } - if (strict) { - /* check for invalid code points; too large or surrogates */ - if (res > MAXUNICODE || (0xD800u <= res && res <= 0xDFFFu)) - return NULL; - } - if (val) *val = res; - return s + 1; /* +1 to include first byte */ -} - - -/* -** utf8len(s [, i [, j [, lax]]]) --> number of characters that -** start in the range [i,j], or nil + current position if 's' is not -** well formed in that interval -*/ -static int utflen (lua_State *L) { - lua_Integer n = 0; /* counter for the number of characters */ - size_t len; /* string length in bytes */ - const char *s = luaL_checklstring(L, 1, &len); - lua_Integer posi = u_posrelat(luaL_optinteger(L, 2, 1), len); - lua_Integer posj = u_posrelat(luaL_optinteger(L, 3, -1), len); - int lax = lua_toboolean(L, 4); - luaL_argcheck(L, 1 <= posi && --posi <= (lua_Integer)len, 2, - "initial position out of bounds"); - luaL_argcheck(L, --posj < (lua_Integer)len, 3, - "final position out of bounds"); - while (posi <= posj) { - const char *s1 = utf8_decode(s + posi, NULL, !lax); - if (s1 == NULL) { /* conversion error? */ - luaL_pushfail(L); /* return fail ... */ - lua_pushinteger(L, posi + 1); /* ... and current position */ - return 2; - } - posi = s1 - s; - n++; - } - lua_pushinteger(L, n); - return 1; -} - - -/* -** codepoint(s, [i, [j [, lax]]]) -> returns codepoints for all -** characters that start in the range [i,j] -*/ -static int codepoint (lua_State *L) { - size_t len; - const char *s = luaL_checklstring(L, 1, &len); - lua_Integer posi = u_posrelat(luaL_optinteger(L, 2, 1), len); - lua_Integer pose = u_posrelat(luaL_optinteger(L, 3, posi), len); - int lax = lua_toboolean(L, 4); - int n; - const char *se; - luaL_argcheck(L, posi >= 1, 2, "out of bounds"); - luaL_argcheck(L, pose <= (lua_Integer)len, 3, "out of bounds"); - if (posi > pose) return 0; /* empty interval; return no values */ - if (pose - posi >= INT_MAX) /* (lua_Integer -> int) overflow? */ - return luaL_error(L, "string slice too long"); - n = (int)(pose - posi) + 1; /* upper bound for number of returns */ - luaL_checkstack(L, n, "string slice too long"); - n = 0; /* count the number of returns */ - se = s + pose; /* string end */ - for (s += posi - 1; s < se;) { - utfint code; - s = utf8_decode(s, &code, !lax); - if (s == NULL) - return luaL_error(L, "invalid UTF-8 code"); - lua_pushinteger(L, code); - n++; - } - return n; -} - - -static void pushutfchar (lua_State *L, int arg) { - lua_Unsigned code = (lua_Unsigned)luaL_checkinteger(L, arg); - luaL_argcheck(L, code <= MAXUTF, arg, "value out of range"); - lua_pushfstring(L, "%U", (long)code); -} - - -/* -** utfchar(n1, n2, ...) -> char(n1)..char(n2)... -*/ -static int utfchar (lua_State *L) { - int n = lua_gettop(L); /* number of arguments */ - if (n == 1) /* optimize common case of single char */ - pushutfchar(L, 1); - else { - int i; - luaL_Buffer b; - luaL_buffinit(L, &b); - for (i = 1; i <= n; i++) { - pushutfchar(L, i); - luaL_addvalue(&b); - } - luaL_pushresult(&b); - } - return 1; -} - - -/* -** offset(s, n, [i]) -> index where n-th character counting from -** position 'i' starts; 0 means character at 'i'. -*/ -static int byteoffset (lua_State *L) { - size_t len; - const char *s = luaL_checklstring(L, 1, &len); - lua_Integer n = luaL_checkinteger(L, 2); - lua_Integer posi = (n >= 0) ? 1 : len + 1; - posi = u_posrelat(luaL_optinteger(L, 3, posi), len); - luaL_argcheck(L, 1 <= posi && --posi <= (lua_Integer)len, 3, - "position out of bounds"); - if (n == 0) { - /* find beginning of current byte sequence */ - while (posi > 0 && iscont(s + posi)) posi--; - } - else { - if (iscont(s + posi)) - return luaL_error(L, "initial position is a continuation byte"); - if (n < 0) { - while (n < 0 && posi > 0) { /* move back */ - do { /* find beginning of previous character */ - posi--; - } while (posi > 0 && iscont(s + posi)); - n++; - } - } - else { - n--; /* do not move for 1st character */ - while (n > 0 && posi < (lua_Integer)len) { - do { /* find beginning of next character */ - posi++; - } while (iscont(s + posi)); /* (cannot pass final '\0') */ - n--; - } - } - } - if (n == 0) /* did it find given character? */ - lua_pushinteger(L, posi + 1); - else /* no such character */ - luaL_pushfail(L); - return 1; -} - - -static int iter_aux (lua_State *L, int strict) { - size_t len; - const char *s = luaL_checklstring(L, 1, &len); - lua_Unsigned n = (lua_Unsigned)lua_tointeger(L, 2); - if (n < len) { - while (iscont(s + n)) n++; /* skip continuation bytes */ - } - 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) - return luaL_error(L, "invalid UTF-8 code"); - lua_pushinteger(L, n + 1); - lua_pushinteger(L, code); - return 2; - } -} - - -static int iter_auxstrict (lua_State *L) { - return iter_aux(L, 1); -} - -static int iter_auxlax (lua_State *L) { - return iter_aux(L, 0); -} - - -static int iter_codes (lua_State *L) { - int lax = lua_toboolean(L, 2); - luaL_checkstring(L, 1); - lua_pushcfunction(L, lax ? iter_auxlax : iter_auxstrict); - lua_pushvalue(L, 1); - lua_pushinteger(L, 0); - return 3; -} - - -/* pattern to match a single UTF-8 character */ -#define UTF8PATT "[\0-\x7F\xC2-\xFD][\x80-\xBF]*" - - -static const luaL_Reg funcs[] = { - {"offset", byteoffset}, - {"codepoint", codepoint}, - {"char", utfchar}, - {"len", utflen}, - {"codes", iter_codes}, - /* placeholders */ - {"charpattern", NULL}, - {NULL, NULL} -}; - - -LUAMOD_API int luaopen_utf8 (lua_State *L) { - luaL_newlib(L, funcs); - lua_pushlstring(L, UTF8PATT, sizeof(UTF8PATT)/sizeof(char) - 1); - lua_setfield(L, -2, "charpattern"); - return 1; -} - diff --git a/lua-5.4.4/src/lvm.c b/lua-5.4.4/src/lvm.c deleted file mode 100644 index 2ec3440..0000000 --- a/lua-5.4.4/src/lvm.c +++ /dev/null @@ -1,1840 +0,0 @@ -/* -** $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); /* call TM */ - return !l_isfalse(s2v(L->top)); - } -} - - -/* macro used by 'luaV_concat' to ensure that element at 'o' is a string */ -#define tostring(L,o) \ - (ttisstring(o) || (cvt2str(o) && (luaO_tostring(L, o), 1))) - -#define isemptystr(o) (ttisshrstring(o) && tsvalue(o)->shrlen == 0) - -/* copy strings in stack from top - n up to top - 1 to buffer */ -static void copy2buff (StkId top, int n, char *buff) { - size_t tl = 0; /* size already copied */ - do { - size_t l = vslen(s2v(top - n)); /* length of string being copied */ - memcpy(buff + tl, svalue(s2v(top - n)), l * sizeof(char)); - tl += l; - } while (--n > 0); -} - - -/* -** Main operation for concatenation: concat 'total' values in the stack, -** from 'L->top - total' up to 'L->top - 1'. -*/ -void luaV_concat (lua_State *L, int total) { - if (total == 1) - return; /* "all" values already concatenated */ - do { - StkId top = L->top; - int n = 2; /* number of elements handled in this pass (at least 2) */ - if (!(ttisstring(s2v(top - 2)) || cvt2str(s2v(top - 2))) || - !tostring(L, s2v(top - 1))) - luaT_tryconcatTM(L); - else if (isemptystr(s2v(top - 1))) /* second operand is empty? */ - cast_void(tostring(L, s2v(top - 2))); /* result is first operand */ - else if (isemptystr(s2v(top - 2))) { /* first operand is empty string? */ - setobjs2s(L, top - 2, top - 1); /* result is second op. */ - } - else { - /* at least two non-empty string values; get as many as possible */ - size_t tl = vslen(s2v(top - 1)); - TString *ts; - /* collect total length and number of strings */ - for (n = 1; n < total && tostring(L, s2v(top - n - 1)); n++) { - size_t l = vslen(s2v(top - n - 1)); - if (l_unlikely(l >= (MAX_SIZE/sizeof(char)) - tl)) - luaG_runerror(L, "string length overflow"); - tl += l; - } - if (tl <= LUAI_MAXSHORTLEN) { /* is result a short string? */ - char buff[LUAI_MAXSHORTLEN]; - copy2buff(top, n, buff); /* copy strings to buffer */ - ts = luaS_newlstr(L, buff, tl); - } - else { /* long string; copy strings directly to final result */ - ts = luaS_createlngstrobj(L, tl); - copy2buff(top, n, getstr(ts)); - } - setsvalue2s(L, top - n, ts); /* create result */ - } - total -= n-1; /* got 'n' strings to create 1 new */ - L->top -= n-1; /* popped 'n' strings and pushed one */ - } while (total > 1); /* repeat until only 1 result left */ -} - - -/* -** Main operation 'ra = #rb'. -*/ -void luaV_objlen (lua_State *L, StkId ra, const TValue *rb) { - const TValue *tm; - switch (ttypetag(rb)) { - case LUA_VTABLE: { - Table *h = hvalue(rb); - tm = fasttm(L, h->metatable, TM_LEN); - if (tm) break; /* metamethod? break switch to call it */ - setivalue(s2v(ra), luaH_getn(h)); /* else primitive len */ - return; - } - case LUA_VSHRSTR: { - setivalue(s2v(ra), tsvalue(rb)->shrlen); - return; - } - case LUA_VLNGSTR: { - setivalue(s2v(ra), tsvalue(rb)->u.lnglen); - return; - } - default: { /* try metamethod */ - tm = luaT_gettmbyobj(L, rb, TM_LEN); - if (l_unlikely(notm(tm))) /* no metamethod? */ - luaG_typeerror(L, rb, "get length of"); - break; - } - } - luaT_callTMres(L, tm, rb, rb, ra); -} - - -/* -** Integer division; return 'm // n', that is, floor(m/n). -** C division truncates its result (rounds towards zero). -** 'floor(q) == trunc(q)' when 'q >= 0' or when 'q' is integer, -** otherwise 'floor(q) == trunc(q) - 1'. -*/ -lua_Integer luaV_idiv (lua_State *L, lua_Integer m, lua_Integer n) { - if (l_unlikely(l_castS2U(n) + 1u <= 1u)) { /* special cases: -1 or 0 */ - if (n == 0) - luaG_runerror(L, "attempt to divide by zero"); - return intop(-, 0, m); /* n==-1; avoid overflow with 0x80000...//-1 */ - } - else { - lua_Integer q = m / n; /* perform C division */ - if ((m ^ n) < 0 && m % n != 0) /* 'm/n' would be negative non-integer? */ - q -= 1; /* correct result for different rounding */ - return q; - } -} - - -/* -** Integer modulus; return 'm % n'. (Assume that C '%' with -** negative operands follows C99 behavior. See previous comment -** about luaV_idiv.) -*/ -lua_Integer luaV_mod (lua_State *L, lua_Integer m, lua_Integer n) { - if (l_unlikely(l_castS2U(n) + 1u <= 1u)) { /* special cases: -1 or 0 */ - if (n == 0) - luaG_runerror(L, "attempt to perform 'n%%0'"); - return 0; /* m % -1 == 0; avoid overflow with 0x80000...%-1 */ - } - else { - lua_Integer r = m % n; - if (r != 0 && (r ^ n) < 0) /* 'm/n' would be non-integer negative? */ - r += n; /* correct result for different rounding */ - return r; - } -} - - -/* -** Float modulus -*/ -lua_Number luaV_modf (lua_State *L, lua_Number m, lua_Number n) { - lua_Number r; - luai_nummod(L, m, n, r); - return r; -} - - -/* number of bits in an integer */ -#define NBITS cast_int(sizeof(lua_Integer) * CHAR_BIT) - -/* -** Shift left operation. (Shift right just negates 'y'.) -*/ -#define luaV_shiftr(x,y) luaV_shiftl(x,intop(-, 0, y)) - - -lua_Integer luaV_shiftl (lua_Integer x, lua_Integer y) { - if (y < 0) { /* shift right? */ - if (y <= -NBITS) return 0; - else return intop(>>, x, -y); - } - else { /* shift left */ - if (y >= NBITS) return 0; - else return intop(<<, x, y); - } -} - - -/* -** create a new Lua closure, push it in the stack, and initialize -** its upvalues. -*/ -static void pushclosure (lua_State *L, Proto *p, UpVal **encup, StkId base, - StkId ra) { - int nup = p->sizeupvalues; - Upvaldesc *uv = p->upvalues; - int i; - LClosure *ncl = luaF_newLclosure(L, nup); - ncl->p = p; - setclLvalue2s(L, ra, ncl); /* anchor new closure in stack */ - for (i = 0; i < nup; i++) { /* fill in its upvalues */ - if (uv[i].instack) /* upvalue refers to local variable? */ - ncl->upvals[i] = luaF_findupval(L, base + uv[i].idx); - else /* get upvalue from enclosing function */ - ncl->upvals[i] = encup[uv[i].idx]; - luaC_objbarrier(L, ncl, ncl->upvals[i]); - } -} - - -/* -** finish execution of an opcode interrupted by a yield -*/ -void luaV_finishOp (lua_State *L) { - CallInfo *ci = L->ci; - StkId base = ci->func + 1; - Instruction inst = *(ci->u.l.savedpc - 1); /* interrupted instruction */ - OpCode op = GET_OPCODE(inst); - switch (op) { /* finish its execution */ - case OP_MMBIN: case OP_MMBINI: case OP_MMBINK: { - setobjs2s(L, base + GETARG_A(*(ci->u.l.savedpc - 2)), --L->top); - break; - } - case OP_UNM: case OP_BNOT: case OP_LEN: - case OP_GETTABUP: case OP_GETTABLE: case OP_GETI: - case OP_GETFIELD: case OP_SELF: { - setobjs2s(L, base + GETARG_A(inst), --L->top); - break; - } - case OP_LT: case OP_LE: - case OP_LTI: case OP_LEI: - case OP_GTI: case OP_GEI: - case OP_EQ: { /* note that 'OP_EQI'/'OP_EQK' cannot yield */ - int res = !l_isfalse(s2v(L->top - 1)); - L->top--; -#if defined(LUA_COMPAT_LT_LE) - if (ci->callstatus & CIST_LEQ) { /* "<=" using "<" instead? */ - ci->callstatus ^= CIST_LEQ; /* clear mark */ - res = !res; /* negate result */ - } -#endif - lua_assert(GET_OPCODE(*ci->u.l.savedpc) == OP_JMP); - if (res != GETARG_k(inst)) /* condition failed? */ - ci->u.l.savedpc++; /* skip jump instruction */ - break; - } - case OP_CONCAT: { - StkId top = L->top - 1; /* top when 'luaT_tryconcatTM' was called */ - int a = GETARG_A(inst); /* first element to concatenate */ - int total = cast_int(top - 1 - (base + a)); /* yet to concatenate */ - setobjs2s(L, top - 2, top); /* put TM result in proper position */ - L->top = top - 1; /* top is one after last element (at top-2) */ - luaV_concat(L, total); /* concat them (may yield again) */ - break; - } - case OP_CLOSE: { /* 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 = 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) { \ - TValue *v1 = vRB(i); \ - int imm = GETARG_sC(i); \ - if (ttisinteger(v1)) { \ - lua_Integer iv1 = ivalue(v1); \ - pc++; setivalue(s2v(ra), iop(L, iv1, imm)); \ - } \ - else if (ttisfloat(v1)) { \ - lua_Number nb = fltvalue(v1); \ - lua_Number fimm = cast_num(imm); \ - pc++; setfltvalue(s2v(ra), fop(L, nb, fimm)); \ - }} - - -/* -** Auxiliary function for arithmetic operations over floats and others -** with two register operands. -*/ -#define op_arithf_aux(L,v1,v2,fop) { \ - lua_Number n1; lua_Number n2; \ - if (tonumberns(v1, n1) && tonumberns(v2, n2)) { \ - pc++; setfltvalue(s2v(ra), fop(L, n1, n2)); \ - }} - - -/* -** Arithmetic operations over floats and others with register operands. -*/ -#define op_arithf(L,fop) { \ - TValue *v1 = vRB(i); \ - TValue *v2 = vRC(i); \ - op_arithf_aux(L, v1, v2, fop); } - - -/* -** Arithmetic operations with K operands for floats. -*/ -#define op_arithfK(L,fop) { \ - TValue *v1 = vRB(i); \ - TValue *v2 = KC(i); lua_assert(ttisnumber(v2)); \ - op_arithf_aux(L, v1, v2, fop); } - - -/* -** Arithmetic operations over integers and floats. -*/ -#define op_arith_aux(L,v1,v2,iop,fop) { \ - if (ttisinteger(v1) && ttisinteger(v2)) { \ - lua_Integer i1 = ivalue(v1); lua_Integer i2 = ivalue(v2); \ - pc++; setivalue(s2v(ra), iop(L, i1, i2)); \ - } \ - else op_arithf_aux(L, v1, v2, fop); } - - -/* -** Arithmetic operations with register operands. -*/ -#define op_arith(L,iop,fop) { \ - TValue *v1 = vRB(i); \ - TValue *v2 = vRC(i); \ - op_arith_aux(L, v1, v2, iop, fop); } - - -/* -** Arithmetic operations with K operands. -*/ -#define op_arithK(L,iop,fop) { \ - TValue *v1 = vRB(i); \ - TValue *v2 = KC(i); lua_assert(ttisnumber(v2)); \ - op_arith_aux(L, v1, v2, iop, fop); } - - -/* -** Bitwise operations with constant operand. -*/ -#define op_bitwiseK(L,op) { \ - TValue *v1 = vRB(i); \ - TValue *v2 = KC(i); \ - lua_Integer i1; \ - lua_Integer i2 = ivalue(v2); \ - if (tointegerns(v1, &i1)) { \ - pc++; setivalue(s2v(ra), op(i1, i2)); \ - }} - - -/* -** Bitwise operations with register operands. -*/ -#define op_bitwise(L,op) { \ - TValue *v1 = vRB(i); \ - TValue *v2 = vRC(i); \ - lua_Integer i1; lua_Integer i2; \ - if (tointegerns(v1, &i1) && tointegerns(v2, &i2)) { \ - pc++; setivalue(s2v(ra), op(i1, i2)); \ - }} - - -/* -** Order operations with register operands. 'opn' actually works -** for all numbers, but the fast track improves performance for -** integers. -*/ -#define op_order(L,opi,opn,other) { \ - int cond; \ - TValue *rb = vRB(i); \ - if (ttisinteger(s2v(ra)) && ttisinteger(rb)) { \ - lua_Integer ia = ivalue(s2v(ra)); \ - lua_Integer ib = ivalue(rb); \ - cond = opi(ia, ib); \ - } \ - else if (ttisnumber(s2v(ra)) && ttisnumber(rb)) \ - cond = opn(s2v(ra), rb); \ - else \ - Protect(cond = other(L, s2v(ra), rb)); \ - docondjump(); } - - -/* -** Order operations with immediate operand. (Immediate operand is -** always small enough to have an exact representation as a float.) -*/ -#define op_orderI(L,opi,opf,inv,tm) { \ - int cond; \ - int im = GETARG_sB(i); \ - if (ttisinteger(s2v(ra))) \ - cond = opi(ivalue(s2v(ra)), im); \ - else if (ttisfloat(s2v(ra))) { \ - lua_Number fa = fltvalue(s2v(ra)); \ - lua_Number fim = cast_num(im); \ - cond = opf(fa, fim); \ - } \ - else { \ - int isf = GETARG_C(i); \ - Protect(cond = luaT_callorderiTM(L, s2v(ra), im, inv, isf, tm)); \ - } \ - docondjump(); } - -/* }================================================================== */ - - -/* -** {================================================================== -** Function 'luaV_execute': main interpreter loop -** =================================================================== -*/ - -/* -** some macros for common tasks in 'luaV_execute' -*/ - - -#define RA(i) (base+GETARG_A(i)) -#define RB(i) (base+GETARG_B(i)) -#define vRB(i) s2v(RB(i)) -#define KB(i) (k+GETARG_B(i)) -#define RC(i) (base+GETARG_C(i)) -#define vRC(i) s2v(RC(i)) -#define KC(i) (k+GETARG_C(i)) -#define RKC(i) ((TESTARG_k(i)) ? k + GETARG_C(i) : s2v(base + GETARG_C(i))) - - - -#define updatetrap(ci) (trap = ci->u.l.trap) - -#define updatebase(ci) (base = ci->func + 1) - - -#define updatestack(ci) \ - { if (l_unlikely(trap)) { updatebase(ci); ra = RA(i); } } - - -/* -** Execute a jump instruction. The 'updatetrap' allows signals to stop -** tight loops. (Without it, the local copy of 'trap' could never change.) -*/ -#define dojump(ci,i,e) { pc += GETARG_sJ(i) + e; updatetrap(ci); } - - -/* for test instructions, execute the jump instruction that follows it */ -#define donextjump(ci) { Instruction ni = *pc; dojump(ci, ni, 1); } - -/* -** do a conditional jump: skip next instruction if 'cond' is not what -** was expected (parameter 'k'), else do next instruction, which must -** be a jump. -*/ -#define docondjump() if (cond != GETARG_k(i)) pc++; else donextjump(ci); - - -/* -** Correct global 'pc'. -*/ -#define savepc(L) (ci->u.l.savedpc = pc) - - -/* -** Whenever code can raise errors, the global 'pc' and the global -** 'top' must be correct to report occasional errors. -*/ -#define savestate(L,ci) (savepc(L), L->top = ci->top) - - -/* -** Protect code that, in general, can raise errors, reallocate the -** stack, and change the hooks. -*/ -#define Protect(exp) (savestate(L,ci), (exp), updatetrap(ci)) - -/* special version that does not change the top */ -#define ProtectNT(exp) (savepc(L), (exp), updatetrap(ci)) - -/* -** Protect code that can only raise errors. (That is, it 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 = (c)), \ - updatetrap(ci)); \ - luai_threadyield(L); } - - -/* fetch an instruction and prepare its execution */ -#define vmfetch() { \ - if (l_unlikely(trap)) { /* stack reallocation or hooks? */ \ - trap = luaG_traceexec(L, pc); /* handle hooks */ \ - updatebase(ci); /* correct stack */ \ - } \ - i = *(pc++); \ - ra = RA(i); /* WARNING: any stack reallocation invalidates 'ra' */ \ -} - -#define vmdispatch(o) switch(o) -#define vmcase(l) case l: -#define vmbreak break - - -void luaV_execute (lua_State *L, CallInfo *ci) { - LClosure *cl; - TValue *k; - StkId base; - const Instruction *pc; - int trap; -#if LUA_USE_JUMPTABLE -#include "ljumptab.h" -#endif - startfunc: - trap = L->hookmask; - returning: /* trap already set */ - cl = clLvalue(s2v(ci->func)); - k = cl->p->k; - pc = ci->u.l.savedpc; - if (l_unlikely(trap)) { - if (pc == cl->p->code) { /* first instruction (not resuming)? */ - if (cl->p->is_vararg) - trap = 0; /* hooks will start after VARARGPREP instruction */ - else /* check 'call' hook */ - luaD_hookcall(L, ci); - } - ci->u.l.trap = 1; /* assume trap is on, for now */ - } - base = ci->func + 1; - /* main loop of interpreter */ - for (;;) { - Instruction i; /* instruction being executed */ - StkId ra; /* instruction's A register */ - vmfetch(); - #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 + 1); - lua_assert(base <= L->top && L->top < L->stack_last); - /* invalidate top for instructions not expecting it */ - lua_assert(isIT(i) || (cast_void(L->top = base), 1)); - vmdispatch (GET_OPCODE(i)) { - vmcase(OP_MOVE) { - setobjs2s(L, ra, RB(i)); - vmbreak; - } - vmcase(OP_LOADI) { - lua_Integer b = GETARG_sBx(i); - setivalue(s2v(ra), b); - vmbreak; - } - vmcase(OP_LOADF) { - int b = GETARG_sBx(i); - setfltvalue(s2v(ra), cast_num(b)); - vmbreak; - } - vmcase(OP_LOADK) { - TValue *rb = k + GETARG_Bx(i); - setobj2s(L, ra, rb); - vmbreak; - } - vmcase(OP_LOADKX) { - TValue *rb; - rb = k + GETARG_Ax(*pc); pc++; - setobj2s(L, ra, rb); - vmbreak; - } - vmcase(OP_LOADFALSE) { - setbfvalue(s2v(ra)); - vmbreak; - } - vmcase(OP_LFALSESKIP) { - setbfvalue(s2v(ra)); - pc++; /* skip next instruction */ - vmbreak; - } - vmcase(OP_LOADTRUE) { - setbtvalue(s2v(ra)); - vmbreak; - } - vmcase(OP_LOADNIL) { - int b = GETARG_B(i); - do { - setnilvalue(s2v(ra++)); - } while (b--); - vmbreak; - } - vmcase(OP_GETUPVAL) { - int b = GETARG_B(i); - setobj2s(L, ra, cl->upvals[b]->v); - vmbreak; - } - vmcase(OP_SETUPVAL) { - UpVal *uv = cl->upvals[GETARG_B(i)]; - setobj(L, uv->v, s2v(ra)); - luaC_barrier(L, uv, s2v(ra)); - vmbreak; - } - vmcase(OP_GETTABUP) { - const TValue *slot; - TValue *upval = cl->upvals[GETARG_B(i)]->v; - TValue *rc = KC(i); - TString *key = tsvalue(rc); /* key must be a string */ - if (luaV_fastget(L, upval, key, slot, luaH_getshortstr)) { - setobj2s(L, ra, slot); - } - else - Protect(luaV_finishget(L, upval, rc, ra, slot)); - vmbreak; - } - vmcase(OP_GETTABLE) { - const TValue *slot; - TValue *rb = vRB(i); - TValue *rc = vRC(i); - lua_Unsigned n; - if (ttisinteger(rc) /* fast track for integers? */ - ? (cast_void(n = ivalue(rc)), luaV_fastgeti(L, rb, n, slot)) - : luaV_fastget(L, rb, rc, slot, luaH_get)) { - setobj2s(L, ra, slot); - } - else - Protect(luaV_finishget(L, rb, rc, ra, slot)); - vmbreak; - } - vmcase(OP_GETI) { - const TValue *slot; - TValue *rb = vRB(i); - int c = GETARG_C(i); - if (luaV_fastgeti(L, rb, c, slot)) { - setobj2s(L, ra, slot); - } - else { - TValue key; - setivalue(&key, c); - Protect(luaV_finishget(L, rb, &key, ra, slot)); - } - vmbreak; - } - vmcase(OP_GETFIELD) { - const TValue *slot; - TValue *rb = vRB(i); - TValue *rc = KC(i); - TString *key = tsvalue(rc); /* key must be a string */ - if (luaV_fastget(L, rb, key, slot, luaH_getshortstr)) { - setobj2s(L, ra, slot); - } - else - Protect(luaV_finishget(L, rb, rc, ra, slot)); - vmbreak; - } - vmcase(OP_SETTABUP) { - const TValue *slot; - TValue *upval = cl->upvals[GETARG_A(i)]->v; - TValue *rb = KB(i); - TValue *rc = RKC(i); - TString *key = tsvalue(rb); /* key must be a string */ - if (luaV_fastget(L, upval, key, slot, luaH_getshortstr)) { - luaV_finishfastset(L, upval, slot, rc); - } - else - Protect(luaV_finishset(L, upval, rb, rc, slot)); - vmbreak; - } - vmcase(OP_SETTABLE) { - const TValue *slot; - TValue *rb = vRB(i); /* key (table is in 'ra') */ - TValue *rc = RKC(i); /* value */ - lua_Unsigned n; - if (ttisinteger(rb) /* fast track for integers? */ - ? (cast_void(n = ivalue(rb)), luaV_fastgeti(L, s2v(ra), n, slot)) - : luaV_fastget(L, s2v(ra), rb, slot, luaH_get)) { - luaV_finishfastset(L, s2v(ra), slot, rc); - } - else - Protect(luaV_finishset(L, s2v(ra), rb, rc, slot)); - vmbreak; - } - vmcase(OP_SETI) { - const TValue *slot; - int c = GETARG_B(i); - TValue *rc = RKC(i); - if (luaV_fastgeti(L, s2v(ra), c, slot)) { - luaV_finishfastset(L, s2v(ra), slot, rc); - } - else { - TValue key; - setivalue(&key, c); - Protect(luaV_finishset(L, s2v(ra), &key, rc, slot)); - } - vmbreak; - } - vmcase(OP_SETFIELD) { - const TValue *slot; - TValue *rb = KB(i); - TValue *rc = RKC(i); - TString *key = tsvalue(rb); /* key must be a string */ - if (luaV_fastget(L, s2v(ra), key, slot, luaH_getshortstr)) { - luaV_finishfastset(L, s2v(ra), slot, rc); - } - else - Protect(luaV_finishset(L, s2v(ra), rb, rc, slot)); - vmbreak; - } - vmcase(OP_NEWTABLE) { - int b = GETARG_B(i); /* log2(hash size) + 1 */ - int c = GETARG_C(i); /* array size */ - Table *t; - if (b > 0) - b = 1 << (b - 1); /* size is 2^(b - 1) */ - lua_assert((!TESTARG_k(i)) == (GETARG_Ax(*pc) == 0)); - if (TESTARG_k(i)) /* non-zero extra argument? */ - c += GETARG_Ax(*pc) * (MAXARG_C + 1); /* add it to size */ - pc++; /* skip extra argument */ - L->top = ra + 1; /* correct top in case of emergency GC */ - t = luaH_new(L); /* memory allocation */ - sethvalue2s(L, ra, t); - if (b != 0 || c != 0) - luaH_resize(L, t, c, b); /* idem */ - checkGC(L, ra + 1); - vmbreak; - } - vmcase(OP_SELF) { - const TValue *slot; - TValue *rb = vRB(i); - TValue *rc = RKC(i); - TString *key = tsvalue(rc); /* key must be a string */ - setobj2s(L, ra + 1, rb); - if (luaV_fastget(L, rb, key, slot, luaH_getstr)) { - setobj2s(L, ra, slot); - } - else - Protect(luaV_finishget(L, rb, rc, ra, slot)); - vmbreak; - } - vmcase(OP_ADDI) { - op_arithI(L, l_addi, luai_numadd); - vmbreak; - } - vmcase(OP_ADDK) { - op_arithK(L, l_addi, luai_numadd); - vmbreak; - } - vmcase(OP_SUBK) { - op_arithK(L, l_subi, luai_numsub); - vmbreak; - } - vmcase(OP_MULK) { - op_arithK(L, l_muli, luai_nummul); - vmbreak; - } - vmcase(OP_MODK) { - op_arithK(L, luaV_mod, luaV_modf); - vmbreak; - } - vmcase(OP_POWK) { - op_arithfK(L, luai_numpow); - vmbreak; - } - vmcase(OP_DIVK) { - op_arithfK(L, luai_numdiv); - vmbreak; - } - vmcase(OP_IDIVK) { - op_arithK(L, luaV_idiv, luai_numidiv); - vmbreak; - } - vmcase(OP_BANDK) { - op_bitwiseK(L, l_band); - vmbreak; - } - vmcase(OP_BORK) { - op_bitwiseK(L, l_bor); - vmbreak; - } - vmcase(OP_BXORK) { - op_bitwiseK(L, l_bxor); - vmbreak; - } - vmcase(OP_SHRI) { - TValue *rb = vRB(i); - int ic = GETARG_sC(i); - lua_Integer ib; - if (tointegerns(rb, &ib)) { - pc++; setivalue(s2v(ra), luaV_shiftl(ib, -ic)); - } - vmbreak; - } - vmcase(OP_SHLI) { - TValue *rb = vRB(i); - int ic = GETARG_sC(i); - lua_Integer ib; - if (tointegerns(rb, &ib)) { - pc++; setivalue(s2v(ra), luaV_shiftl(ic, ib)); - } - vmbreak; - } - vmcase(OP_ADD) { - op_arith(L, l_addi, luai_numadd); - vmbreak; - } - vmcase(OP_SUB) { - op_arith(L, l_subi, luai_numsub); - vmbreak; - } - vmcase(OP_MUL) { - op_arith(L, l_muli, luai_nummul); - vmbreak; - } - vmcase(OP_MOD) { - op_arith(L, luaV_mod, luaV_modf); - vmbreak; - } - vmcase(OP_POW) { - op_arithf(L, luai_numpow); - vmbreak; - } - vmcase(OP_DIV) { /* float division (always with floats) */ - op_arithf(L, luai_numdiv); - vmbreak; - } - vmcase(OP_IDIV) { /* floor division */ - op_arith(L, luaV_idiv, luai_numidiv); - vmbreak; - } - vmcase(OP_BAND) { - op_bitwise(L, l_band); - vmbreak; - } - vmcase(OP_BOR) { - op_bitwise(L, l_bor); - vmbreak; - } - vmcase(OP_BXOR) { - op_bitwise(L, l_bxor); - vmbreak; - } - vmcase(OP_SHR) { - op_bitwise(L, luaV_shiftr); - vmbreak; - } - vmcase(OP_SHL) { - op_bitwise(L, luaV_shiftl); - vmbreak; - } - vmcase(OP_MMBIN) { - Instruction pi = *(pc - 2); /* original arith. expression */ - TValue *rb = vRB(i); - TMS tm = (TMS)GETARG_C(i); - StkId result = RA(pi); - lua_assert(OP_ADD <= GET_OPCODE(pi) && GET_OPCODE(pi) <= OP_SHR); - Protect(luaT_trybinTM(L, s2v(ra), rb, result, tm)); - vmbreak; - } - vmcase(OP_MMBINI) { - Instruction pi = *(pc - 2); /* original arith. expression */ - int imm = GETARG_sB(i); - TMS tm = (TMS)GETARG_C(i); - int flip = GETARG_k(i); - StkId result = RA(pi); - Protect(luaT_trybiniTM(L, s2v(ra), imm, flip, result, tm)); - vmbreak; - } - vmcase(OP_MMBINK) { - Instruction pi = *(pc - 2); /* original arith. expression */ - TValue *imm = KB(i); - TMS tm = (TMS)GETARG_C(i); - int flip = GETARG_k(i); - StkId result = RA(pi); - Protect(luaT_trybinassocTM(L, s2v(ra), imm, flip, result, tm)); - vmbreak; - } - vmcase(OP_UNM) { - TValue *rb = vRB(i); - lua_Number nb; - if (ttisinteger(rb)) { - lua_Integer ib = ivalue(rb); - setivalue(s2v(ra), intop(-, 0, ib)); - } - else if (tonumberns(rb, nb)) { - setfltvalue(s2v(ra), luai_numunm(L, nb)); - } - else - Protect(luaT_trybinTM(L, rb, rb, ra, TM_UNM)); - vmbreak; - } - vmcase(OP_BNOT) { - TValue *rb = vRB(i); - lua_Integer ib; - if (tointegerns(rb, &ib)) { - setivalue(s2v(ra), intop(^, ~l_castS2U(0), ib)); - } - else - Protect(luaT_trybinTM(L, rb, rb, ra, TM_BNOT)); - vmbreak; - } - vmcase(OP_NOT) { - TValue *rb = vRB(i); - if (l_isfalse(rb)) - setbtvalue(s2v(ra)); - else - setbfvalue(s2v(ra)); - vmbreak; - } - vmcase(OP_LEN) { - Protect(luaV_objlen(L, ra, vRB(i))); - vmbreak; - } - vmcase(OP_CONCAT) { - int n = GETARG_B(i); /* number of elements to concatenate */ - L->top = ra + n; /* mark the end of concat operands */ - ProtectNT(luaV_concat(L, n)); - checkGC(L, L->top); /* 'luaV_concat' ensures correct top */ - vmbreak; - } - vmcase(OP_CLOSE) { - Protect(luaF_close(L, ra, LUA_OK, 1)); - vmbreak; - } - vmcase(OP_TBC) { - /* create new to-be-closed upvalue */ - halfProtect(luaF_newtbcupval(L, ra)); - vmbreak; - } - vmcase(OP_JMP) { - dojump(ci, i, 0); - vmbreak; - } - vmcase(OP_EQ) { - int cond; - TValue *rb = vRB(i); - Protect(cond = luaV_equalobj(L, s2v(ra), rb)); - docondjump(); - vmbreak; - } - vmcase(OP_LT) { - op_order(L, l_lti, LTnum, lessthanothers); - vmbreak; - } - vmcase(OP_LE) { - op_order(L, l_lei, LEnum, lessequalothers); - vmbreak; - } - vmcase(OP_EQK) { - TValue *rb = KB(i); - /* basic types do not use '__eq'; we can use raw equality */ - int cond = luaV_rawequalobj(s2v(ra), rb); - docondjump(); - vmbreak; - } - vmcase(OP_EQI) { - int cond; - int im = GETARG_sB(i); - if (ttisinteger(s2v(ra))) - cond = (ivalue(s2v(ra)) == im); - else if (ttisfloat(s2v(ra))) - cond = luai_numeq(fltvalue(s2v(ra)), cast_num(im)); - else - cond = 0; /* other types cannot be equal to a number */ - docondjump(); - vmbreak; - } - vmcase(OP_LTI) { - op_orderI(L, l_lti, luai_numlt, 0, TM_LT); - vmbreak; - } - vmcase(OP_LEI) { - op_orderI(L, l_lei, luai_numle, 0, TM_LE); - vmbreak; - } - vmcase(OP_GTI) { - op_orderI(L, l_gti, luai_numgt, 1, TM_LT); - vmbreak; - } - vmcase(OP_GEI) { - op_orderI(L, l_gei, luai_numge, 1, TM_LE); - vmbreak; - } - vmcase(OP_TEST) { - int cond = !l_isfalse(s2v(ra)); - docondjump(); - vmbreak; - } - vmcase(OP_TESTSET) { - TValue *rb = vRB(i); - if (l_isfalse(rb) == GETARG_k(i)) - pc++; - else { - setobj2s(L, ra, rb); - donextjump(ci); - } - vmbreak; - } - vmcase(OP_CALL) { - CallInfo *newci; - int b = GETARG_B(i); - int nresults = GETARG_C(i) - 1; - if (b != 0) /* fixed number of arguments? */ - L->top = ra + b; /* top signals number of arguments */ - /* else previous instruction set top */ - savepc(L); /* in case of errors */ - if ((newci = luaD_precall(L, ra, nresults)) == NULL) - updatetrap(ci); /* C call; nothing else to be done */ - else { /* Lua call: run function in this same C frame */ - ci = newci; - goto startfunc; - } - vmbreak; - } - vmcase(OP_TAILCALL) { - 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 = ra + b; - else /* previous instruction set top */ - b = cast_int(L->top - ra); - savepc(ci); /* several calls here can raise errors */ - if (TESTARG_k(i)) { - luaF_closeupval(L, base); /* close upvalues from current call */ - lua_assert(L->tbclist < base); /* no pending tbc variables */ - lua_assert(base == ci->func + 1); - } - if ((n = luaD_pretailcall(L, ci, ra, b, delta)) < 0) /* Lua function? */ - goto startfunc; /* execute the callee */ - else { /* C function? */ - ci->func -= 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) { - int n = GETARG_B(i) - 1; /* number of results */ - int nparams1 = GETARG_C(i); - if (n < 0) /* not fixed? */ - n = cast_int(L->top - ra); /* get what is available */ - savepc(ci); - if (TESTARG_k(i)) { /* may there be open upvalues? */ - ci->u2.nres = n; /* save number of returns */ - if (L->top < ci->top) - L->top = ci->top; - luaF_close(L, base, CLOSEKTOP, 1); - updatetrap(ci); - updatestack(ci); - } - if (nparams1) /* vararg function? */ - ci->func -= ci->u.l.nextraargs + nparams1; - L->top = ra + n; /* set call for 'luaD_poscall' */ - luaD_poscall(L, ci, n); - updatetrap(ci); /* 'luaD_poscall' can change hooks */ - goto ret; - } - vmcase(OP_RETURN0) { - if (l_unlikely(L->hookmask)) { - L->top = ra; - savepc(ci); - luaD_poscall(L, ci, 0); /* no hurry... */ - trap = 1; - } - else { /* do the 'poscall' here */ - int nres; - L->ci = ci->previous; /* back to caller */ - L->top = base - 1; - for (nres = ci->nresults; l_unlikely(nres > 0); nres--) - setnilvalue(s2v(L->top++)); /* all results are nil */ - } - goto ret; - } - vmcase(OP_RETURN1) { - if (l_unlikely(L->hookmask)) { - L->top = ra + 1; - savepc(ci); - luaD_poscall(L, ci, 1); /* no hurry... */ - trap = 1; - } - else { /* do the 'poscall' here */ - int nres = ci->nresults; - L->ci = ci->previous; /* back to caller */ - if (nres == 0) - L->top = base - 1; /* asked for no results */ - else { - setobjs2s(L, base - 1, ra); /* at least this result */ - L->top = base; - for (; l_unlikely(nres > 1); nres--) - setnilvalue(s2v(L->top++)); /* complete missing results */ - } - } - ret: /* return from a Lua function */ - if (ci->callstatus & CIST_FRESH) - return; /* end this frame */ - else { - ci = ci->previous; - goto returning; /* continue running caller in this frame */ - } - } - vmcase(OP_FORLOOP) { - if (ttisinteger(s2v(ra + 2))) { /* integer loop? */ - lua_Unsigned count = l_castS2U(ivalue(s2v(ra + 1))); - if (count > 0) { /* still more iterations? */ - lua_Integer step = ivalue(s2v(ra + 2)); - lua_Integer idx = ivalue(s2v(ra)); /* internal index */ - chgivalue(s2v(ra + 1), count - 1); /* update counter */ - idx = intop(+, idx, step); /* add step to index */ - chgivalue(s2v(ra), idx); /* update internal index */ - setivalue(s2v(ra + 3), idx); /* and control variable */ - pc -= GETARG_Bx(i); /* jump back */ - } - } - else if (floatforloop(ra)) /* float loop */ - pc -= GETARG_Bx(i); /* jump back */ - updatetrap(ci); /* allows a signal to break the loop */ - vmbreak; - } - vmcase(OP_FORPREP) { - savestate(L, ci); /* in case of errors */ - if (forprep(L, ra)) - pc += GETARG_Bx(i) + 1; /* skip the loop */ - vmbreak; - } - vmcase(OP_TFORPREP) { - /* create to-be-closed upvalue (if needed) */ - halfProtect(luaF_newtbcupval(L, ra + 3)); - pc += GETARG_Bx(i); - i = *(pc++); /* go to next instruction */ - lua_assert(GET_OPCODE(i) == OP_TFORCALL && ra == RA(i)); - goto l_tforcall; - } - vmcase(OP_TFORCALL) { - l_tforcall: - /* 'ra' has the iterator function, 'ra + 1' has the state, - 'ra + 2' has the control variable, and 'ra + 3' has the - to-be-closed variable. The call will use the stack after - these values (starting at 'ra + 4') - */ - /* push function, state, and control variable */ - memcpy(ra + 4, ra, 3 * sizeof(*ra)); - L->top = ra + 4 + 3; - ProtectNT(luaD_call(L, ra + 4, GETARG_C(i))); /* do the call */ - updatestack(ci); /* stack may have changed */ - i = *(pc++); /* go to next instruction */ - lua_assert(GET_OPCODE(i) == OP_TFORLOOP && ra == RA(i)); - goto l_tforloop; - } - vmcase(OP_TFORLOOP) { - l_tforloop: - if (!ttisnil(s2v(ra + 4))) { /* continue loop? */ - setobjs2s(L, ra + 2, ra + 4); /* save control variable */ - pc -= GETARG_Bx(i); /* jump back */ - } - vmbreak; - } - vmcase(OP_SETLIST) { - int n = GETARG_B(i); - unsigned int last = GETARG_C(i); - Table *h = hvalue(s2v(ra)); - if (n == 0) - n = cast_int(L->top - ra) - 1; /* get up to the top */ - else - L->top = ci->top; /* correct top in case of emergency GC */ - last += n; - if (TESTARG_k(i)) { - last += GETARG_Ax(*pc) * (MAXARG_C + 1); - pc++; - } - if (last > luaH_realasize(h)) /* needs more space? */ - luaH_resizearray(L, h, last); /* preallocate it at once */ - for (; n > 0; n--) { - TValue *val = s2v(ra + n); - setobj2t(L, &h->array[last - 1], val); - last--; - luaC_barrierback(L, obj2gco(h), val); - } - vmbreak; - } - vmcase(OP_CLOSURE) { - Proto *p = cl->p->p[GETARG_Bx(i)]; - halfProtect(pushclosure(L, p, cl->upvals, base, ra)); - checkGC(L, ra + 1); - vmbreak; - } - vmcase(OP_VARARG) { - int n = GETARG_C(i) - 1; /* required results */ - Protect(luaT_getvarargs(L, ci, ra, n)); - vmbreak; - } - vmcase(OP_VARARGPREP) { - ProtectNT(luaT_adjustvarargs(L, GETARG_A(i), ci, cl->p)); - if (l_unlikely(trap)) { /* previous "Protect" updated trap */ - luaD_hookcall(L, ci); - L->oldpc = 1; /* next opcode will be seen as a "new" line */ - } - updatebase(ci); /* function has new base after adjustment */ - vmbreak; - } - vmcase(OP_EXTRAARG) { - lua_assert(0); - vmbreak; - } - } - } -} - -/* }================================================================== */ diff --git a/lua-5.4.4/src/lvm.h b/lua-5.4.4/src/lvm.h deleted file mode 100644 index 1bc16f3..0000000 --- a/lua-5.4.4/src/lvm.h +++ /dev/null @@ -1,136 +0,0 @@ -/* -** $Id: lvm.h $ -** Lua virtual machine -** See Copyright Notice in lua.h -*/ - -#ifndef lvm_h -#define lvm_h - - -#include "ldo.h" -#include "lobject.h" -#include "ltm.h" - - -#if !defined(LUA_NOCVTN2S) -#define cvt2str(o) ttisnumber(o) -#else -#define cvt2str(o) 0 /* no conversion from numbers to strings */ -#endif - - -#if !defined(LUA_NOCVTS2N) -#define cvt2num(o) ttisstring(o) -#else -#define cvt2num(o) 0 /* no conversion from strings to numbers */ -#endif - - -/* -** You can define LUA_FLOORN2I if you want to convert floats to integers -** by flooring them (instead of raising an error if they are not -** integral values) -*/ -#if !defined(LUA_FLOORN2I) -#define LUA_FLOORN2I F2Ieq -#endif - - -/* -** Rounding modes for float->integer coercion - */ -typedef enum { - F2Ieq, /* no rounding; accepts only integral values */ - F2Ifloor, /* takes the floor of the number */ - F2Iceil /* takes the ceil of the number */ -} F2Imod; - - -/* convert an object to a float (including string coercion) */ -#define tonumber(o,n) \ - (ttisfloat(o) ? (*(n) = fltvalue(o), 1) : luaV_tonumber_(o,n)) - - -/* convert an object to a float (without string coercion) */ -#define tonumberns(o,n) \ - (ttisfloat(o) ? ((n) = fltvalue(o), 1) : \ - (ttisinteger(o) ? ((n) = cast_num(ivalue(o)), 1) : 0)) - - -/* convert an object to an integer (including string coercion) */ -#define tointeger(o,i) \ - (l_likely(ttisinteger(o)) ? (*(i) = ivalue(o), 1) \ - : luaV_tointeger(o,i,LUA_FLOORN2I)) - - -/* convert an object to an integer (without string coercion) */ -#define tointegerns(o,i) \ - (l_likely(ttisinteger(o)) ? (*(i) = ivalue(o), 1) \ - : luaV_tointegerns(o,i,LUA_FLOORN2I)) - - -#define intop(op,v1,v2) l_castU2S(l_castS2U(v1) op l_castS2U(v2)) - -#define luaV_rawequalobj(t1,t2) luaV_equalobj(NULL,t1,t2) - - -/* -** fast track for 'gettable': if 't' is a table and 't[k]' is present, -** return 1 with 'slot' pointing to 't[k]' (position of final result). -** Otherwise, return 0 (meaning it will have to check metamethod) -** with 'slot' pointing to an empty 't[k]' (if 't' is a table) or NULL -** (otherwise). 'f' is the raw get function to use. -*/ -#define luaV_fastget(L,t,k,slot,f) \ - (!ttistable(t) \ - ? (slot = NULL, 0) /* not a table; 'slot' is NULL and result is 0 */ \ - : (slot = f(hvalue(t), k), /* else, do raw access */ \ - !isempty(slot))) /* result not empty? */ - - -/* -** Special case of 'luaV_fastget' for integers, inlining the fast case -** of 'luaH_getint'. -*/ -#define luaV_fastgeti(L,t,k,slot) \ - (!ttistable(t) \ - ? (slot = NULL, 0) /* not a table; 'slot' is NULL and result is 0 */ \ - : (slot = (l_castS2U(k) - 1u < hvalue(t)->alimit) \ - ? &hvalue(t)->array[k - 1] : luaH_getint(hvalue(t), k), \ - !isempty(slot))) /* result not empty? */ - - -/* -** Finish a fast set operation (when fast get succeeds). In that case, -** 'slot' points to the place to put the value. -*/ -#define luaV_finishfastset(L,t,slot,v) \ - { setobj2t(L, cast(TValue *,slot), v); \ - luaC_barrierback(L, gcvalue(t), v); } - - - - -LUAI_FUNC int luaV_equalobj (lua_State *L, const TValue *t1, const TValue *t2); -LUAI_FUNC int luaV_lessthan (lua_State *L, const TValue *l, const TValue *r); -LUAI_FUNC int luaV_lessequal (lua_State *L, const TValue *l, const TValue *r); -LUAI_FUNC int luaV_tonumber_ (const TValue *obj, lua_Number *n); -LUAI_FUNC int luaV_tointeger (const TValue *obj, lua_Integer *p, F2Imod mode); -LUAI_FUNC int luaV_tointegerns (const TValue *obj, lua_Integer *p, - F2Imod mode); -LUAI_FUNC int luaV_flttointeger (lua_Number n, lua_Integer *p, F2Imod mode); -LUAI_FUNC void luaV_finishget (lua_State *L, const TValue *t, TValue *key, - StkId val, const TValue *slot); -LUAI_FUNC void luaV_finishset (lua_State *L, const TValue *t, TValue *key, - TValue *val, const TValue *slot); -LUAI_FUNC void luaV_finishOp (lua_State *L); -LUAI_FUNC void luaV_execute (lua_State *L, CallInfo *ci); -LUAI_FUNC void luaV_concat (lua_State *L, int total); -LUAI_FUNC lua_Integer luaV_idiv (lua_State *L, lua_Integer x, lua_Integer y); -LUAI_FUNC lua_Integer luaV_mod (lua_State *L, lua_Integer x, lua_Integer y); -LUAI_FUNC lua_Number luaV_modf (lua_State *L, lua_Number x, lua_Number y); -LUAI_FUNC lua_Integer luaV_shiftl (lua_Integer x, lua_Integer y); -LUAI_FUNC void luaV_objlen (lua_State *L, StkId ra, const TValue *rb); - -#endif diff --git a/lua-5.4.4/src/lzio.c b/lua-5.4.4/src/lzio.c deleted file mode 100644 index cd0a02d..0000000 --- a/lua-5.4.4/src/lzio.c +++ /dev/null @@ -1,68 +0,0 @@ -/* -** $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.4/src/lzio.h b/lua-5.4.4/src/lzio.h deleted file mode 100644 index 38f397f..0000000 --- a/lua-5.4.4/src/lzio.h +++ /dev/null @@ -1,66 +0,0 @@ -/* -** $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.4-tests.tar.gz b/orig_sources/lua-5.4.4-tests.tar.gz deleted file mode 100644 index 31b820b01953eb42efb81c1cbfb7ec6ff312db2b..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 134094 zcmV(+K;6F|iwFSr4&Y$`1MFOTbK6Fe&)@tMv+$|}+8|AUlpR@CY8jcfRnhAxI=Pgr zRe>Z(AqD|109sN~zR!NY?wP@hpd>rlySl1lED1B1eoRkKzh;_padP$l* zcY~lEtlaPZ%1;NM7rh?+b?}e=+AnuH+)s}$o$hyb&wh!<&dZk=XLn!VkLdiRTx|HP zlGKfb_%67f-8(MzCiB?6f6V{E&y&Bk+t0D!jaEzi{c!q9kQ#WI9*Dowi*wHt2hs8_ z_UG5BIEhk!;t4ku>9r@ka4Mo19{ohj{J?888bLI11M%656F&;YzA%n}2ufx&{F%7= zc`!UbJUtQrwVw?Ep0FW=AGMQo>c#P^o7hi1(-;v_Vn`$_bO<65#lo;Oqy?zz2XDhD z)dMv-OBf%+!L6VA;ha$>MiaoXm#*Tlfk}Yxt9R}G@EsU-<2evv;)(m&;}&6yz-BCA zF&J+{?=}^m-Pm`>ftQF$6sB<$NU7Xrr`qj9;9U&|Ogo7kxz({q?*-mD|F zSsT+xE=J;|U^tvc3p_$JLdcbseOI@Ze!9cV7H)domTekr(x#VGXe!tsq(v@h7BD8S z#Macpk73myZ8qh!6|a+39Ak!J2|}+vhEMS^M7xdlD-OSppFsc4w9l&5L0Sj z3^wy!MjBGL$0TlOFYTH?zBFd5aKhH@SV9VOL4t)^5}Z@vUnys?M`oZcbEI5=Mq|dx7zj$>bhvk34+`w&s&Np zBx5r17eGGs=YFb0%WJg|uO;KOQX1icMo7z`2|wpi+_4FY`31Y}w(*m}BQqSLGUhn} z)4*djklD%BTMFU;QQ72E05cKjE||z0xT}UzvXRy=rJL?8cqJy)IJ7cpno^8vqk^zMjpIV5`Vi~n3*WTolWU(YFo(saM z)nZKMN6tke8MXN(8YKu8 zEeclsZDx z2s98090=|&Zt>C{2hM{MN*GqMt+6MAVT8bxR!~S7uR=~SDCB`LnO}?PYO#C{tAalS zRyCp?2ViE{6j@+FUihhadw4Vu+gQaAc4(XXu=|NQi6RQ7itN6kuU=%mxv)Zueb};@ zZ!$Bt=##Q@-w=F|4~L%2h52l24rKvYD|h>{nMDM=g2nh?!ifyc6;sW92_-Vpc?OX? zCBE@Ge?QKhFUilG73NWaHOI|7SrRi-ML<#*=Jvw%LrNC6n^{cZiFa7|y9pMnp@Le2 z`{xsbGzf?>STb$QCj@OYHuJqLhirolqMlKnjul-6p!-?nCIoR9_^$eDS8;mLp6HGPIo>2&9m}R|ObE$tw2N z#Hs~S?w?0#R1$YaH;$vYx;Pvomb((HLM?)^pWgV1S3fIC;`JIRK%QKuxmWeCIYzdR zdNV>TIMPN8)2W0@l!kI-3niPt1ko@{x?y(HH*Or7#*><4;1!R7Gv?t&IU6#mM&jvo zb_}z96EQB@Wx#XO1c1c-k0{KZpKzrI|A5zULu8Um%+8|(%+TNkz}YNoJXIetdVhE> ze(4WS4o}{R^Y^D8j^2oq(~;<(oela!@ihB90NOt~KYbj0-2|9nH0nCx8Kf|UuOE8%x7tiPXBd*z~Bx;%e~@Gwx%s;mZ1E9?!^hEvfP2p#YHZi zM-K{)j9TLVjyUZ%4uZe8*58EkO_QuI(WZ3lI*LA-xhHg++8|KoL`^aZ64N%jS4d|P zE1AHdV-J4zKYIeZF7cdz8E9W_+K2AY$RtDP!NCN8q%gH|CN77)XY zo5BCp+o9S_EZ&7Y*^BLTPp2>W0wAz{I`V!Yc}I2C0~_BifHK}NFYVY z63{xF(xN5_-0)%1|Gvxc2XRLj0=yEw>#9orak(ONL z^fomp>)}3b6$%v8*U-+Vu5LywJ(7{4XHt_fnJraVnC0~ZO*#)0(ntoJ=Ij*(x!W8m z(9qc{GW9T!dn&EXvZZ7-xn|b(2+0cAXvZYjVQ>ReE`<^a%I0T&41RgC74lS#D+IQ{ zjGzHTOoZG~l43suftUx;7%pCIRrnsy5|)aAi;-=k zP|DJpZOVd{m6f@g+R9~_TKF-PNur9I+s+JGB8}HQ^Q1{hVNSn*uDMxd3rm|lVr}wS zNcCZGsl^hvKMx}++hPiEf8oTF>d$#KnHqKnx>CrVfU(K(3ETpJ(`z`soh>noqeYH8 z+ZQyJ3KBUlt&GQ}c%JXaJb4eGjNpapBJIwO;(cdJDwfFzf7maK!%VsJ^}c9jz0F*^ z*wyJpcv6@F%~O?4; zd{gi1QuG0Liiw~8B(SZx&`PE0i^kKx^3!-)I0`cln!?`Q?X{ea{X!hA+;$YtEphhY zpf!XMYtZO3FJ9200X!tk3x!AHJ28iB;d$UlVvkMYeapM-tc~LQ8#??Uiw&_w6W=9YHjO4LD!IGtlV!S0Q5i58=L*JXGNGx*RcLm9 z`V|{$Dj~(5to73=8wO2+)l~AK2L%4YS5ycA3nU@5*i{zuYEiu7&*-nmlUuIFfuCGk zz%um-{dkq4JE8807ZMz1^PG-Zynu>HOFC-d8Rs1G7|;QdC5bjw!eZJt*HFUJeCW&& zSu4nrr@^FQ`Xi?K8%&qPLjW__vgn4)Dk9>kFN;0AfFrzh#}VR`Nw)BzIs+w6Xf>Ak zBCA))HJPI^$z4hh`QrfG^?y7XNMa|y(pEg`A0AucP5-$6ZoqJ- zz%%55io;*t54Z~y`}lV-qQhs%=HT>XG(?kRGddlPGT>hh&j*(14-d~tFmH#aAV7iz z%qgP*%#E2GLwToDXt--VFLjz;;gH#ieZj#m0$F(!T2aKd9dSkU92W zddJ}2`yaOB*j;<={>O{%|KI=kpZHX-eaPj%=h}y_0(x~pgk!1E{yv>Nt3bijhk`J0 z?3kP8_Qz2C@WT&G<$yyk7oO!aA~m|#uq3P7KRZ-MkFQ_9{upjoZ)ZG^2g}z>Sx}ah z4Qj}X8f0UqZafuSu+hhz9NVi45VDe^upGlm4Ts0)bQQ!PX1$QB&2lV=WhrkeBRn&u zu-qwB#8SH*QjTh-4jw?~30{k5!shBK+CFeQ0HSelNg3FMe@SqubKxVvvoD)#W%Gjl7WF?~5fBM9qAJBF7g?FpT|}PCxx{Y68lllUjY&t#cPz zAX=;gS}v+Ex$-E8men+ttK|B#8>~Dr+|$Kk+sNu#t}Mk;Ryp_5*qc)baA#6HPK)G@ z6Oi_9_3#XB;-zV{M4-5rjS(%oNI{jwHbL$b0e98_H^P-Dt`mG5TuBt-H8}4yvx^@x z4Mg@p5t|a`)JaU+>Fs>KyVL7Bw(WG=ow5uIwHec(8rjPIJk>}GRuD$DAy3XSQp%a5d56Hu5j_J#Y&J0QjVN(zcSs`)>Pni4DJQYnX8 zR5g`%q+l@Ipnk&RC<-(`{OlB-I~hma%AChC^yckKmzJnCp%z~_YF23(MU**N)qwrn z`&g4D(I<^~XbZxrf6N%n_}kxSCZwG9_jCT#3)*vQvY4~_7FGb7)v<(wpDuoS6*cU2 z@@3d5Ed!kZvv$_(M1}k*ki-6Up{mk|nlM&>g!?_qvASRG!vTTmeOB1Z9fL2Azz#dz zT>VpNg>A`cdSPFx!m4g}F7rz3I>i_UA7OvXSz{a0sB-Rr^IkpYen{LDjn<~=JDaDk zkaX*KvBXZDAa|_pCYEAv8PG9Z?bK?}bsvMQUQo5zFimS`6E>FmV<$?udYf=@%G?#b zuMk>yGiQvg)va5|`|$PTlIojR+VF435qz(=omXt=a#eZ90VjT5biNeAhSm%8$O2*J z>+`eR>^>VKhpF6}X3V|>vwrDDBywUef8tD6&TxsGO9 zym3&o+LF(fBg#UpSRTSr5UqaO;}Kt)51?-SDctJXA>HDgL~%%^JU8)@duiGQ$MJZQ z^6dlDvA;=Dk3qfjZGy^B>+7JIitCfVhNg6Jq0Sc3dmz-YS#lkzQyZi7Rv?6$Bh@JM z3PYa;*5gsfKP8CbaU2rlW|>8u3|zw_1Rin#-dOorL?L)#=7oTplqG$cHOQ+(aN(*d zKaK)d_EFF+Z2nJ(Cwvb^$TQ<@c^)!H3KVL}1w3xLN{Ux&91a7X=w>;Kk+Hi1q5MBP zlp)8Nc=_{{EFvxt60}Vf%81m*@!bg(EkEcg{qj?{RzzgLa z#BU_glSgp(d%!%?U@xKlMc(aX-FT{ts}wG$2xMnKcv1uG99(+ zxtqwS>~^Yt;-&HvI~K-Z$Zlto1ERzFN*HChL6mtRRp?rVmw+uJkA>b>iGe>{*dknV9{})HVw68>nUS ztJEc6bhDaKjYX~KkR*Tgz{uQ#b}1q(v6ojhTB>lsRUKmoye&9KySj3x)6ym2qW^;# zU3dt{$j+O8xKwm_CdT;l#S)8D-h>=rWUQiE*|Pw}rCJohsYdvh4SJRoqIHxPRqQl>WeSoB0 zlHfxu4#X~1d>%V~@E;hzTOQxY<7`;gAl+yW*#f?13n&ej3VLnJ?OJYc&4Srq$fVRn z;pJi7#|`U!DH^E9>>M{!KKGmU&ey?{_EKrEh#=Enx1hjQF{9ZCPdeq=RrtygfKxaE z$WJ|L(GUJN(c2HAm-q5ZIp=2cDXTZ68wwe(< z{lflP``YQLFmFp=>MC!6TjkTUa<1Bdme{0HjxNjSu(Yr~r>5Pc-%j!SCFSF^u|C;- zkksG-Qr!)t3ddxRr3D-I7+T#&Osn`m0g&nz&XE%5#{m`j)1`q97J)R(3rj1VX6u}` zZ+Us^B57J%f^;}OKFS}X@o#j`U$t~>jMSg&{F`=-Q;3f#@*vWPl$~zR*i*-C81wJp zgQ*l)>GpD7?2H$_xKQThK2B=MJ9Xq4ahYOqC9keztxjH%s4U~Yu`=W;s)F9eE!)0r zx3}?Mdz>vQ0_y4nbbhp>o^=g$y{YI`UbUP;y$8=UUH8A)d(-tcjwDfZ{x+VXrqt>} zi2#Hukdh?|>O;xP_*%C6*m58BP|FlHvP=+QW063ssdv5K{c&F7#+GYkfuN-6zUO|X zEfT28jLeM8jEszxWK%XfUUWJIGvwl@hT|20L=d~tcsfQ)hGpQCqGDbDG9SlPFqr~V z2PJbj^LVq~tOXi>Yq$uDGPoHXvWjUA0@-0Qs1|!s*90aC6 z-MZHqn{1HKuBHrj^JVvCx8Ppit10%pGaJ9NretfoZsDw(rLxMhnhIIIzZIZ%FztHS zVyae$3F|#!TKV7B6j@47gPQa|&ogf)1WDSjx3!^l-M8QoDLwvmk}A%G;Rjrn?~2s%-GtO>5BT(tK7D zFg`R-gMQ*D=O2wv4Ero6y?TLPwI!t~t-ZR`ad}b9%Aq-NQXLQsR`%P{GRM$tBMD8Z znxkquEf2Y@93rP>tc-ltOY;0g*J1J*E@$MJOfYT&`A}5k$H!EXfgMCIUI;a?>Ld|z zIHBj~>)A-Z5#ATo71C*}$7OW)V{{^;k!d%r$)Y$XTcu#%G1`N)w;x;7DjpOg417qg zWYMktNVpB{ncs>|=I90$@!S*BOKk@gnx-8xXpbUf$=<+#ZqxZYRh1meq9znM zOY8b=oqe!v;D@JDTkfZB(_M?GP;8my3atoEVJmQR%EpW4N%dVt)v!ZqSe7ruMVU^? zEx?&W9kB;ZnCTyol~~GIxJSDIGA!suU3qJC^AqnK@${A@jWOFNbDWq5F@HN=OaQA+ zz#mjfY}i_YcN6TaDS7EGF~UxJFmBUl6M?dB<;ZC5u?pvjw_1YdhOGJ1fgfa^|yw#w{pEkZmCD} zMR`I_rEGJ>R$Hd3*^H;O2`d5}iahgF>`_AN$)j=p+|iZY4W$K3_kv$&mCy_Ladbi! z(V>l&_aZ7I8*Vk9Q_mXCHzDV+r^U3)ZREAvw?AIjV3JsdVoQ$$Q6}$pJ?P>g@j>+C zHm)&ZHM$I82e)>y;80_P+hi}XuRpNcp({KEc<3B-yLi3Ikcc##Tm5@`P!!U!iIwlb zGTEcc97T1+D5EfbwUXnjhBDL5T3DRUD1>-?i{L_46hvv|IRP$rDMP-}%H6qAmLqtU z(N9qx^CZJpwN!c2lo%0*t;6FWcE zc3;U)`K=$FhJ_9BVXUsH@NMM@BQ$?OW`u9PNh|%<%&s_Dm3JtX4u9pC36aIzVxXet z%G?gQ6VfupVYN28IFLEUA4F{|vWA9(il#+fR|MBPbnFYY=_nUd^q;?~D?Z8T;!Qt0 z=sL`+iNjKmV_s^E9f+;fa+g4u7TOf7eLp~Xh3jqBYhHL>W*8h9_6j_^GAG3?dP?`< z;5h}ak9*Mf3%N}Q?D%2!&}?vrIdL5eV9a=|scN@7el7A)^y+l%DjWFOr4p4(EzcsO z)1LuSU`ecq9a6#mJbXdv*>*O$^z^E_E7pD-@@hm{UUluo_ooQ4~mm-r;#E4H?3^ z@|^rMd0d^M7yf80G#`WK;n#>FG&MXQ!0TNALx)%RXo{@x!EfH24EfZg3y`wQbdX~# ziF$_9p=)C_Q zxu<)vEAwL#Sqz78#2S|nX!znT5YUT8#b#CMxNS`o5PK{f<(??KU>&Ecbt*FZ$+3Tl zOkc4g$J)}Q&tG~CVi#TC1JbcpTcedk^%*RivWi~S+^^(JS}n)Z2|$S0_p>tm;<)ha zapimFIYK+fH!@>?qxsA zuNs?HWNTgx0dgEd_75Zbg`t&=$onbSVdIkR%;JsFQV{>uHM&-mr#o)2yhIL|!9_Yo{_>!EcbxgfEMbG(nr^BpY3v@K+e&Ps4 z0JA$}MFa>vjX_11eu0L`SEQS0oY-#$Y3I!wcENYdB+vuWSV~+V?~k*6){4TI={Yt< z`(z19PHzW+Im_4&n!*$I0P|-a$VoY#j)10KI%ZnNs_ab7_Kk;9sDV^#0@oO>+ki*t!uKjm_?|)PKCb2gb~r&@f6}Pg zku~_Gj&aSpg$ljN9+)mrV|{vr5vF|~UNxu4yz%4`vrCE^SlUKQ!**faEbr|f+`Iq9 zgPVT>0KMGe2rE`Bk+r}+sU_QpAY<7XJNr5g3VFJ%FPf$ADe0YX)}PulG}qTX`9y@m zDCmm%sq=!u0AKQl(u0Puu~nx!eCyma3)V$eeD;bf)~mcP`n^v8)N2*3q)5mSy$*;t zv)!m`?&U^l{~NXw?U7j=$H$THG@?9^@bgf@GTWyS3AHDY{w2UVk2P)i+d6x2OQy=jR3J-?dA6iMc)u(pI=ODf!t}Q5W$f#Q6oO~ z$o6OHI#?hEha)L)@8xsGaKk958+0BTv@>emow`O_$o`-aHT=o1KDi4*&AAKwC1*X2 zn}4F>`&bN?sD)Ciiz7`wZR^8Kw6DI^+3~U1Mg8Jund*s1>bPl3gjqIN<;m^cNqAroJ9wntdm>r zK%|CM#xpuHx2{RN6*9+OjdEI3oJ`iL71(OP$}AG9Tahg>Bq!X$db%nxNf;#}ljFj6 zw02CO$STH?4kXZtOu$>47GJ0&1twuJ z3+=qF2@05>?gk~xu7P6Gk`NP#q^QMq>%cX44({my;_t8MoQz-m?LS2i1-F{FxM)fa zEWMJr($%@cjzBNZxV0@+WkA`s5!q_{w;7J;t&MowK_~!V-w84A01l);%DNn50N05h zjyiIKP)K+XY<4hK!rQS{_teZzH*M;@U(>Cuw_n$|FbQtch03Z&WJxN{7u!0*UBGsX zDq>J979{{zY5im~S<^J1j?Pi!U(Lr<&V~!Ju`XDw{=9R7$vQCUX0e)|m&4dGy*L>H zfcZlD5f6YxIHM9_gpi{GoT67A=!*i1NqRx_rkIXbdLqygNw*k8f$$Gqu}4}n#kNvS zh+@MVt02KRThQffcv_T{oKxFmIaH?W(3wG)G}R$sKv&L)2-;x48m{W-ZdyBQ3@xMv@Mb`J66S z364p_Fwh&)vI3+dQcyw3XQY0I4m8w>{EStzV&90#2r>ROOM&qE3{_b|K_Jn#+aV(S zRGD$MnY(<>0VXHScIL1+GkJCxSzj8#uB>O&8HyozIzFd$%vHEU(hI|bA_*4sxoLKs z=!aTD;YP?*<;kUoa&0uUX$acT%?uCIZOs%1!v#v9i^!lf>~Q~|ie0OIEBBFdT1+Pr zrMea|wuV_x2bRcRrS2Wen##beDUG`7T{Q_oxT&Jj3eg;_il^F;)AarqY>b5Rl}@K- z*BP3yTJf?SqRBj5db?MRBi=WM(G%G~Jab<+zINnm8#Afv5wt>spyY7yh2J`X(}uux zQ9)C0R3SQTmb4vj+f+)vQRy{E;8%@8G2quAr>7)`a76XGmiaFXx0K-`a5|4>itSKWpFDi^LEej_ z$>Jrb?(!2LO<9->ZfpeX##iwY27nGm-XCws5bR1Cx33x%L}6yW=_vZIO#(;e%ojRD z&HsW8#GWBA0Azc8+;%HD>xz^EYMS(OQAqBweVcFOvY|S6j=Z-c5Aofnw@0(0NFDnQ z_C!>g=}&ogOHdsE(DTqw{^-gFd27ww3SpkbB3Wlms&#MLrKViRZdmW;?ex+#jA7w2 zfxQ}FLQq@AcwSt%rm7MFXG#gYeY`gkVx6nL-N$Zfr^G|&7gxeJ zJS}D?$GzE+J2cAuUlW)NLk01MCDQr`zQj_rFO# zhiW*fT}nRKPSLKUeR=aA*-A7`?h5h_@gdjwcv6faCVKz03o>beRis zd!QA|`3`GDaM!U`eqUMIcho=HgA=0Zcg{#(U`->F+ubUsI1 znOW9}TvNqw0Pky>Sq=0HUt-tFx&jrDc4_-2rL3ILdRs*GvBXO;ra7N^b{xY1(iLLH z2=eV^%^^_({+PlI>sh8KggjFe@L85x>V(l8BlE-iXBle6`$>`L;}t%$%Q)tWHadt~ zVi@OEb=`+F1Y!hx965f{L}|J3#tj`h&V?g2sjL%Bj9?iZhN6{OS9z ze*XFBo3D7E#;J}o`!M>iWjRYQ-zh8BF}M5(d-7&$XP{Cu^ZVnNt>r>|bNsSc&)Ssv zmmRCE=9ibVRk4xhg|^tMX|~v_X_C|vJ!6qKaF-x=rH9X)1_4`0*{0=y7C~+M#Lwvb z*^)+3IX?;kR8QZ0lN>tMd~d!HZvlGWjNg32Yls{R%DGjwoSUjN3>}LD2V=#s(3?*K zEhV;5IZwU*urAAmTZqag1lX!dXGEncaA!pFuBnVMIVyFR67tHerWO?&b1m0{W->o3 zXT^DuaA=>j;m6yK=V(gc?su5NL)etneeTY(zqXi;$HugqXWTHMaS=OF=HpFl#c}jv zh8ufzJ4SfjdhTo_nn)HJjf{mP43bN6FG>Gw_6?E_Q5yF`qY__w)6F z(vbt}SH14REbAgo`{IWJ4KJ{-#K839Of)Z3nL?Q?yWQhk_BUdbb@8p`gdxHo4n@v? z_9QTcVxYD`QGV{uC3Mr+9!FIy>9xl=g{5E~P{GyLCe=k95hKUa#8py#&X!%lTcg zR6T8op7jC-&whP?AVAi7MWe%2sFx8&TaOatCZLB2#_?F8CBDPz-4w$LOS!^P89?P0 zgjn8aOg)jcvX3=Mosz%O`1&{$;TOt5WdiUxOG~+k`zft<#sI97Ehyk?5C7cK0FWiY zN#nPy1K7T5NDyNJ^L`>yFdjNSAX?7mv^%0jMfI@J;y}}b*#SdQQ;fX$@>xh8FELOU zV8A!1NqbEsvg6HoxLy%%tDXfKKUClL+(#2o=;dv1&=kg?LUkp9@yxN4s33Rd#t>4= zOcfDrWWs0ObiP7P>djX_{I#>$AoWI*)y6f>LK38wgiUBE{xJHv75(s2D|-4L`1jgn zdKjqo(+$?H*M|_at^H70=C=0dW4qJ~qva?1|LK3|(#Xc-)GIQEw2dR*&FOqHb7n@8 z!B}dCEF)GkOD6@6n)<&S1AQG;kE5ISIt%uCJ{!Beu5@~*KJPb#pHplgM)knj7mM-R za=u+p=)uMn^G(KNO)A2+nMB{F4-?lKUy31l~lN&p~aBbrYm48b#B z6pPE07ziZ+gf{NniQe}=`3J!~S292=0OS&1d^-3(^c9n$iZL~}&<2D728jV;B|z+0 z2@P1+KZhM(p7^nrC8Fthv61v>0R_9U{zh>{EYsCT8MAFQXR=WCOO6cryhB~%=;4{2 z_eqDgY(-T)=~?=?YNvv3^s;@aVh1fS2&{c^|>kucZlU`e6ehixd5B- zyc<(kIR_TqxL_w4oG!_tnzP$d`^ECC6`?+EDq9n71moF!eR8Tmk*-4=LO5{C@=O_h znN(UGD^5C$X>f_UAPkp2sWGQy#DC96nhrkNu>522-S^gx8tD7}yHkt@Mmak~HB~W4 z4K?Y+9sOR|YA=(B9Rbuqv!*MaokBVllrcPVfkp z?vCZkLYR;CqWh7!;mLxui9kaY=k4o7ygx5z_JYMVe0%vYx(z+YmBA74zmLeC~mAQz*H)-0dw#vr6ng1rea=i6oG3G)&9%KuS@#a;s^*50)!m4?$~V z$$=0fN7%pQteTO&agD8pEd@z~BXOFZV5q~(Hp`o8`=eqkUsbA$M&r7g7%P|pw8nq? z+uz~}6djH-1gNRR<&nh?R{~f{7$}CkgI>ZkUZY9yIv`7PTAaWaAw^12@Q5luj{F3j zuKFOXJfO&s05viR!9}hwPdR&{-JBS)@McuXUF=w3@Dd-iA(45{3*zVscXx^w< ztT-5A^z4_TH$Q#*<%>7pAAS47^Z)qitD`Sz)k_*$FFGT}{>>b(LR;i~E*e6KiOH%~ zJ#~xq40Efqr!!`FYgp&UcyocJo3qwZ7XGZ?@AA@Dt11>GFlG>~c07l^a$$7UgNkCI zN^L&l-8DRG9^YOb1GPGQISU*yx0kQr|McZ75Kzti854Em&NpZ640;b=g&=*??^chi zLll10`N@#oj6ln~t@xY%H)uhV8smd+`u)5cI0X+m9x4|)8J4rjyh(l`#a`xYKA8m$ z)5;n#6~nYKC2PN`*sHrxHq_ z@g5i&_Gpfwe;b^t-ty^$=H|=J>il8`sBms|GMVMPgK`Coh!j(x{mH|33%JfV)#&gE z(HS%pv`#y0ujZ^Nbk_-no0?UT75Ks#{3f)8Mj%aPDLxZTBnl?5B z8m-SS?yhI}=Nc?onAXnvQQwtjAed&Mj2hVGf$9$Gv1=_jX9<`-Qncu6_=fOON!}%v zF>plU7kM4e=I7&CF&}T>EEvyL5#XL(M+~_R#FS2FEQR=(?079NoD0#F^sEoMl)rQWh!8%uuY1l9dSwRQN25r*=(`il+&_6Y1Mi% z85@1~RL7a{Z9J{>!d<>`D7c^EYYaa9CM)5%)PvCK!nYJFgpm&TzWNOE*ha;i zd{UHT!vP#|f-WZ}T$oWyxdF+KkAdg4Gb@oW)ef2FSk^7I!rb8PS@lZih!)gsT^YZu zXGAN}czi5(=&_@$aC`U+4bQ5b^tw?Wpp;aAaP5%Aa&c4vlXFFIE#DSp^ULx&AjCe zm#D9d(~AsZrj5&(BFf%-PUHyoZFN`TyU@<@Jh3dAw*-a_k1tsCdJQc7dl0hP=sHKX z%+#tUH>Co3)KgK%=NE2v2CJqeHan;a{M7AK@%A13w?18;b~tqk{JMMBX1pqhmXj7PC--Q*1gehzY7VONk6+lEj2s0Q z6wk+B5ilaojgtGgIzH9_&}sx5LE7<$=nsGR19Ol3F6UQ&pvR0$`C?)f+hf2M6*6-h zoBKS5cZ)emGE_fr)WfVnEm!-eUzi?RgwX4vEUC<1U!ks|A%nV~l55A!I-A#ZHvjMF ztacSUEtZ@S@1rnW*XQfIe0k$8llhwIsN>*<(f4#T3?*r{9r+d=MJLoYrbS0jDS{_U zaHJH+U(jz&{Bu6)e*6y3x_|rq=l_HsAb#zG&VFaVO%lPo#R@3xpaYLTUmJKgySKlO ze{=XB|7Q0Oy8p(B9(&nA_u${M{p>z`IkRKuKsf&R?dTyAo8s-$^2g=)_uY}2|Ujj|5VvY>4I<34FuBk8CAuI38d8|C=yf^bDy_qj7 zZ?r6n3g~ZMTuF2bg&R)i0=wn<#DV-u;rm0I7?FT5+72`BDhws7ZisVu*g-DKkJ`_5&q{$vN)h2RHRRHfHoZ$ z%au$RhL5naJ5wG=J5_+|R6^+>Z6wPWC<(n&>z2Kys9Jpd`sM7E+`t~=-rmTt%_2gx z;7bQ~(e>a=l%ua&ZSnPE)31l#d-~p}b|U^Wo)w3G zzWe9cdO0+2mveYo&Poh5W~6H^$+YevDtYnZMPm6g>Bt+XPClQH)^I#g8RD2H^Yv`> zu<-|AdIU!RXz*0hAS%SkzmM&*LS&6j*Vr-+?S zfevXTeQdXnmD&sHF2@&UBf=>?JgpuaubZ^v_s~p(FDFK8qMErowwaN?yK9h~UEMJ(^BqJSk&Xgt67R<_0?lRnxFFAD`ib;iyS}FdEvJr1ki5 zzT}UooVT;q&;)v;@~JYsLcR5Rb+KMGziiG#=?Bl)3c@w>v0A8<9B!|vI^@)3)u-uz z8v$JpmKERjVD+%-24&RcYET-iV3ME#MTb|%F;3$WsYOi8#b~aTotPCH>x#9~aSR08 z6vPnG*#Q|H!9U%lLOue9CBH8NahokQ?j!ANRnKXX- z>VN+7?N48Q3Eu&jGTS*iLON=#SG8PGP^=cIlZJhBF)fEBTt;Ba#AeHrZqe`qiQ=6@ ztO5_S6@5u8MrCXi7itB}=PA}(8SHc%Cl<-+2`xVX4P%QLfh`;lE1Sv-JZJt2CI zfi6voS#=R5G7_7_lM+UbAL{@Cj7mdtV3-xVwOXzT=}+tk7MIn;?@$w!FhGY-&*933 z0nD(-6Eep*NE`LgnQraa07nBr`a!mM#01bybKBk`4&J+oSJtIM=u^7U=LcI}XySz8 zP@tK>SQ0^n51eL+n2x(o!V8~?U*}1sfhR1Zuye+Fb&j@l$}j47k>ZGQ_lyg$l|Y7h zT7@XCcZ5Sb3JmQ?hE~(4brecHX1>^o~unse|8P2cIQ6V-|PtS*%m=jK-4!W1~o)KBkfh?ZBwF0_L)9 zcJs|Q7{E)>38W#h73rJ$9B*Q3Jbu9>o9MVfsZj1l!(wO@KjR#M>eQc4BA}RULE=)8 z!#Cfcu;rVbsVrS*)RABjSCRugFr*dy23fYYrI2yuk$Xm2%+;`EIi&{u@LIz zOgI93PPd99j!vj_wJl+lyFQe1$ur6_Q#70v{vCcb3D!QS+RRJi8D7U=W zwzU6}b+k01vcPRjrH%6rYoKe!)^W2my4@!*{3!3%BEf2`20V?Z!)nuyDZ+0nIIUU8 zzSJPL4-@~u!CG%d^YQWxynRE;MLa?(l7~OP?Ed+tfGB>l4@%wAP1tpF+2#XHBq-{l zK-bZJuz@_b)^11`M3p(vHhG4t9qL}Xu|J(od>D5+j^u#EZilb-V!76=ygj}W4o_O~ zjWCUTiKAuHVP;u=Sp+9>7x{RxOvIpv{jQYBlrSf%P(@HTCa=57Gbq>FK_FBlzPPN8 z^H5R6rDv|l%x>0n%f9>RKvO8HpzD@v@J+YAM!=r;JT<0gXpVeqg7WM0W`eP0ZtAAgQspaPsDOmZTY)f^~xY;6mb%t-9|qIdJf*^K=I|}asW<1vA;Dw zx42bWXymVF7KJhi{PHOhD-4Gn-vKHm@+tAXGnn5F1a9R}izx)qUDz-}I-MmmF<~bG zST#Zy1IMd2WhAERht2OrL=W@IzHiOsFM6XCSyM{nI#tL$v~Wy7GN!1gyA^nv$2WLSn=tYG_!*iah-0Eiu}O%&mz;0B9mQP zlu#?!YV3znr+E7uCb4@v@3MT56-%^k93r~hb#~qMKWS!308J92f9irF=MRO7<>mQc zK9xMz369L9LU>y)OR+;{haR(McbOuEBRKJ~$v6DWoh9z(c!T6^Jkq@)S9v3@CF$+O z0*Jt7Ogo$IqyhOgwESnIP=E$=#m^`n0iU(s=5fs-v{@-0SQWHSBx~^~k*{QH0~ATT zC!1hevSFozT0qZNeEKK{Dhjit7$s`cgkQQOPVK3FV<8V8bxQPxWA>i!FJ}MTCI^K4s!p1 zGm#t!TOceu-Yx7CMszHW%Iw1ID6?XeitIwEWjYsAM{*-atu||xD}tQ2mR}92JZ(R; zy}YX}rmc%a!wbN9G4*kLF}1L3JtRqw9mn!wO8l=%Bhl+R@02hHYm$0EW#ow;%2*%r z3&ozB$F{Nvv1Y(tXP8jY7m-DKyKSQ3s3`(~X(>7zvR`IV7{SC` z7$$mfXJY}*MMRdpf`@qDIfkOI1OR;8!<-9Poy?+>O=3yfx*T7!YtFnvLE}sfP&{=O z@Wfe|v(#}3H$i?dRco}-@qN4i!}gEzQzesw^^C%hZ&FoBhvR4sasDYRN0;)0_y@N& z26}fCE_)OzOYo`mL2J_7w?U)Bx0*p-4uIuqo$hsYNZ!GsPqs~OQRY%HZbZRWhI|x# zYVuP|?u*Z|6sGQ;&ETpS9~?HEGJf^@_i&;}xZpNnFC1JUs%sLO7RQq-7}QI~GA$Th zdc9UX5Od=%9u3^^rN!exMH<+YsyVxZInUAbMf<+F&(+v5hmcnS@zGQ<)a`NxhTxGi z7b#2r*nQ9TH%2t2-kIU3JUQ%#q~24+1e~O9S{*D`HgBzN^Q#YTYuJ$weiJxAeBnc< z=jL6Y(i}tC)m1BM-!$*ZO014Z7f~oXxEDZ5r4(}m!E!La!RMSpyZXG_IS9W1&ck}4 z-T;^nNSRXSJP?1V;ut&jO7_e#RV9MkwMgV6KCkkwB8-poS6Y-~5%WS*^CGft&C--g z8Q1N$+Wb2c*Q;m`#?%!zVxs;)mdCv=Yc^q>qI0q8XNDfVrlYytQK@9-R49%K#ohqA zkMgb_LS4rcSWXyMrmAm*##fr%MzrBKdJJC*dS!Z5yfXi*s;X|P!C^sw!|&voGr4@D zw*!{AzO69Oa>@uIf70D6n~GO%O$Abtx}_@po~#}?vLCd*Xx(q!1Ny(;>b3I2=(yc` zg}F9b5e%j;Y1RsUGJrpWM`u(D#&SU_}P{ltRxPU}5 zKGKfvpzSFNjHi-}m@Y-s8&fi9n%0Qxny14$<$b zlS4w@0LN1Nb-cKIHlLmR0C$RzL-DSkc>e|CVi?)dXKarSWkr1N*Ft-z6cvp8Ns3L~IDKSK?ByK;ySYz%Z2~nsDy`w;B7&~lGqM)Q)u`wor zQsPw#)EM>su#Mb`S= zRxjwo-Mg@~h(Pj#ugxn0%$G*$0op|_>58b#$y5zpg@o%kJoYr>_mZ9iLBzI+rmFrJ zs9~r3Iurj9D#&J7f}tf#9XJ>fxjLgXn=DJ0uq_0RA;=0ajhh~4hfuC<7sSMF`Ux7n zNXg!z;h+SN&6KNW2;0gipoXMD@;h}GXlsm0CG zW=Jbr5hn!$TKg-0{*`E6x%VrM8=jQ(|A5|>hKnz06mA@T9+LU^D}EeE8Q~LLo8Wzd;@iM@X5hK#fC|*Hg8s>nL@K!G?H~w zEm&7MB@po>(b6q_6qf7g^+(`8IGX>4+3@V^Ed~KtxfL)hjA+I(hpA|06o*EMAyh{! zv<}u3&EcSvM}zUIs6EF7zaedjE$JE1XOS(y(VXqeDv|myRGBwUElqTa$d)bf!TMEO zJ|zf8L|eBz65?3*V|0rSMZJED&>3HB@rq;U>oUT>w6M2THF`lec9SNa}D z>NQ96$zNw*;PHumK_ai^0CMjmiLi}#iTB+&x@uIT{9xJRTU0~bfJ&wX)fX`uorIph zfM1v4cTHt}`{MZai0I+%Q5vTY#e`V`{j?? zX2%~|DzKQkU|v-N*HQR02B@-9w-6kvhb{Sq^6X@{XI&%O3C~YpZcK1!y4`HY_KAn>v=hQKJJ*HE1~Hmip&ZAp=v-TI zOdLT4%Nfrfl0GUH6<+cpiBo?N*z7rGVun?8qi%4%-qSJ;bZH}fYKh1EY615hOnbhi zlZk4GI|+5wT4;Ey2lz%JnfdEp&N6rjA`Js;F3<5Qt8QN@5Vk0)5K!6f)A8&C{pR3u z2sgKPvC+s}a0#?v$sXiJ#o(mqRb?cr36Yrb3?uI-vkZwBMAypUxSTfevIw2NYc-LY zXw_640F&RRMEo?yV7gCt1n}dC!LgAj+_+7)4tqta3qNJpP^ZD12WLA2zU*Q!Yl_(u z*?y|%R!AO&sz>IP32r^N$B!0Ws<)Uv?gIU!U|c9)fR3%{3Z_x*kyM~2v5~5EIvq`M z$Z^S!lV@6@AT=>c>s_`~Svg&_c-U%mxK7AFR2%*@95kXMsfr43VqnYCX-YQ0cRKqF z@Z*GaXNiYXg6IX8Dvcs`=*o%xV6g!IYX0W;pY1~a>+funUv*^*IsHtF}7?z_wk-!&)NRp?AL=(kQg+C@Wz1vqz z03z{!OayxJ)_glJ#R#I9p-1r){Z=eu&5CA{=XEzv(bL^LeR@c0lkVo| z=#Z4?@b*i)4+8)?gno~x+0EDcBGE)B9SaVAMo2M&>U3j<79%+LwkyQ0MEO)u<$FW* zQN33^YItBEul{KeCjQqB}(;`_vo_h{}imhaxvRn0JI6J(Sv<$>f? z*kthBER-%_)h&_VcP+(ykA*;Ln|;J!5r?B;TaF9K0G3GN>1IJIGb-o_F zIl#SVK`sY;aolcBpl&+VwTH8XtB)-U=nfCyMx*g4`fa?JFFzLUOBb#Qv}*iz#F7+9 z3EsCIDFEMz-%D`9Xs|A)t2X+HQ{hBe>OVA=x_H6jckNTC>noam69yHzofy@z0wZ z)Q-c>gON5b<#Xx|JBr3`RvjF%ZPaTAgWf>hOZfMjain1x?=7rFfftq}MP5Q7c%+hm zSe@c`ZU-tcBWSRw*uUvmyD8FxOaAz2BmD=A^dGy7^dFx*(#=N>^}}Zx>IWF=hh2vH z;gg3-ie6<%uCgo0(x%5~ztIiUoGwqx$%=z9+sRCt?lz_qWsnB8wgYXkD>OKOu7_6m z;FvS@Fha@f9wD=Z)6K6n<7Y&X&Quqn4p_5m^_vU+Bl^%ZMfqX1dT?&0i#f%w2Usl{ z1@qK!Daz`Ggb$mAp!^@w-6jzFHa2V7NnJZ1x@~tttbXCE_8<+q0+Ra)N0vgl@jHa@ z4*K?vj9x9j3ADNClD{dI756YqP&_^XivHFK`SlLtzhh#dahNZ*%0PAQXRp6d!r`alJZ3W>$UJF7!K8e0Zmd`6>s_T_T^wET>D8}HEIPL!WtM= zoZ>H(H!!mhn&YIeOk`-Q$#Xa%{2^nmvZ~vG>mz| zmz1b2V1SVR*BL}*lFcBv{JvX$=+CgCQ9v)$45YOs?r$%!QO25-v6SyT@??i9z5M2N z)ac}aKL?9ImG(7tLd~?lkUCJD9`4Z2HC0SAh5WSi+^Q!#RB2c1C_botKpCvqh_nXK z7Y~ZTa5M(OSX#S0`2IG`k8;3qfDs3=ZB{DlrCLKFODgP8LrdLkEYu1=o?2DR(gz$3@}bvCYp}g*P-=&sL8Ts@IcQ9>fb@eQ4fC~)};k9=Is0&eGXUne4kyF z;F3C9mCI$p5qwanJQWwHw6T?38DeEfl{uUYZMxb*m^62}PdQTkH0qj#)JQ08bNowX z76#pg<;5S*=YSMEC_CNPWlLFiIZ4(`!40g8OI=7WT`d@@=mQMqTj<6baBMWQfzd1D z`XW527RIgEp-f9+`qUO(1d7_nk{6zqq$zhr>ftfr^44Y6)MED8v{2!FRoLf7P2mEK zZ!(OskXuZwe@O|I?`i(bzigS(l!wzR?X#q&^n^S9fJSL}Gx*wE>r8w%YlpSgD~SAstKF^{=I|!UY@x~QcvqZFzsN4-f` zcPPwGv~`7heuW}f0n6`yal;0vLa2e?Q+ECSQ?dWlwt1h=1oRsJuU_x|eb4^$AV0YG zyZz@s<44>-=Pc64l!n^g$$HAZ;{V3ubHCoEo}*3U_umfHkw^(YpRZ~ z&ZB`^DM1t-Fd!3IyPv|jFeNp}cu`9C(G<(5%{LWYDo45zHw=vBNv%sLzd{+X7ii7TgbrCtob>aB^T-x`Pb9Co9=jaF$hx>eG_lJ4}rSx2B#Gjv2=edxH$I8ws z6IwoGN+8&0yPJ|yg>qO%8|my~Ll{Ol?0i(LFxkxt-zLgA1mp5@?^ZQ=Gs= zQZYi{CMAQ$1E`GUkf5=KGSy zz$Qho-X)ihG(yDdBifiRLQVW5)Wqgv+t`E~`4DJic{=^5HlSXp31H$wZG7A~pkAmA z;IIS8LaO96vb}{3V+v|joA|J?!2hd{-+%d!&;KErT7KpT0N42c+&k#`{NH|_ANi?h8|we$`$c;bkHVvyd~tR zc<7}*%^tCoAsNi)({V8~?$Y#HN8Qu!O;BbIleeX^3jdeD2h3P%syrS5OttTDveY`UDOp% zOhdERwz8@X*Bq2;g4SUwl|24xnp~M1OAytU&LWWtM&F)~e z=B%AnSu$k>hXpt!ah6Lg8tWB4S5XnIagD~qX(3K(9MX=gPrFx*<#;;b5K+483a2`( zFqY|1XjiLH=dxNTvc=i}rkSOC9P<&1H#3qVcF1zP?60MMb`u8V)F zj`5G_Z!Uj(-ISv)-4m}gjzX;_$PN!V=)WKK-(OwXw(~`2&>40nnTyfP$2b&vILVRs zxa8g+Z!k8)rM>zUs3yxh(N#q1HIuUhqYkHskyG}J*HY?6QC{)wlkY1DuOFmLP83Xx zimL)FBDAHm}c~z1J9q_%FmWX9E$kQ9yiT$*)qddVk z4(_CbjvntzI85mL1nv4-R*UE#4>VQo8NJs2joRo{Td=TD$Tb2l3}~I2IlDY-xI27v zhdk(GeO*Q$BFwSbX7`$u^YAr8dLl}&5Yz8OZ~0a8UfS>9hn1F~w+B_lbwlX0$#(zjSCP+6dd%*9t9HjhNJ#5rYZQQf`vox^Z1c zSbmF?ABT3B9w}@9cIH_I&O;1_wqd^un>?elgeJEe6Q(qO-?vSq)$bQ}zyD@`xpgF}Ss$Mn?Oqpx z;Ba>Ul;vd$5Fx48!f3g96t=_RgX&0*t)5~qYPKVsvL$I8c`<5a&LZ}^l>n@x@daly z-xApo$#7ps^3l{H?-?!@q0UfYdgv@PkNoncLO(=w*Y|qp1UrJ#NJ>j9U}6FglZN9! z1>;bb9oXNUwxa2W#F!bwWp9CDdS@7fl#*r%8aYVrZ2Zo|y5gG66^8s;uHkwIm+Rpf z3r1I%2?VOmG189hjp|3rk`aYBB`<-z7f5g6=OrTqQtY0DhneVk{DB#J^>rPoSZnAv z>LT$6g~D|Ofu)1NwT(Z9`xD)P)*S379^kJbC-jh^LxB!0o*#ff_tKh{P2uD6m8|bl zHRinjL5KW8r(fI;>Zzm~8MsfGjiXNSW>Mj2o3^MeD*78nf8KMMqntTFx3p&Ha;d~; z<9^rI{7>h&MwVTHDtpt=3Rmfx8;_S z2Yjn2@Ywy&=GR7kfNZXCC^TXCUCciA=>e7oM!4TUxI-WJO(ZHkh?A)KTj;consTd2 z9etN25WX~0iM_$zaBl?n)y>}J-fzx5UeC~Pt>5-C_?N>!wbAh^e$uovM>HP*g}WyN zVK2+}vV1S=!L54l!CrQ6j~LkhY(-zUDDWXJYMWSC>rls7<_;_^u5>+{B1NEJfVAUq zYnIBZ52mnL;?3sPDy?WjRut`508stC%(=Um%fsK-#S};iw1T;oY(DJPilP(T;)k|x z>?-r9!zz;`1*;rBI4y}D6$j#{Q__xlhWycUVKIVPdf*1x>$djYJ2UE|@Cg*sU%oP|tA;`;rAKP2NhmOb z4BEZayd`V07BGwVOo>|}3DR*V&)QwRsGK8Ld>p2HiAyNbY;GYx3vXQDYDQA+qEz!aF zmJQMEB102zFk@MYkCx7(mgRRs)(p#Xrkxzk1HcmRgeB(oROv1DTiJtF-fMMRT>xlB z$hMdJBU6v6T9DAf_*|ux7fd`?i_FRkHsEafr7!c-mosUqr zj0+L-GQRo7TK1CI5QByw{5RjQV6ta;8V>jgYpI+~=0Ff&6|5J-F;!ELQ!5`UHVm`7 zp?nd8a)x<5q1?D(2I(mJY19SR7@n?YXK^dqG6G~6$=La(;5I&-G_7JSaQj6fAlYA< z9GDZEx@6#vIc^;U$^#|gSjZ!XBANnL8%7}To}vvaK_7Oo7hhq_R1RcQ3!3(&WTRiT zM4n;s1F5>0^VLnKWXCyzYm74#+;NWHku(fa%%)F~1Pr4m3{ zO;|wR66+kS%zrhNA+@=ls{WXspjm4};@lS_PNpoY%!+ABR!)n>`T}lM(cm)r=4mv% z96G5Zja`*L4tobDH&5r1@D?ZLL}85A@+6Q`^kW)O7n6-Q2Hp%rB8`xYtp00>gPNlX zNyr>}kX^UmWD06FFtpSSQqzs+*R4S5z zFJe1#IrKn@2JnW;w%>?l3W`J)gCc@pS%xHwP)G1#^x_4N!@u&J+G#2-;TBBDMt`1U zldvruTGW-Ose$twuKSq=miB2%tDT07{DhG3${{7q;Gz)) zIF2+y**lh4x+Ul^R4_I+w$x?_U>Z8UhmuPN+wU1$Jvf=<5}DaX{SKGIY}*Wt3r5zu z#PJ;;hggnH%_UMy@v1L=(>H6a9)yc!!@d@qOXjOr+n5LZ7^}@^NJKMFo3OrA^1_4E z$s7YG3yr!$qWPrp=~l6gLg^k1uI+)tS0d!Q>lsl1H;auEOqvC%W^skj1f#RVa|>3H z7-(`9n7skV-yEP4mTmkL18ms6RIl2Wlh|=%&S-ZvyK5Dgb&k!>*8{&gz1vnF)_TT@ zZ+qY1_79aN_qtS=28o%b@waIb2K+AIzNve)pI$RL=Sc5Dd4^`|3z{XAJ!5B7@N*Nj zoy+OKw7RBBgrS0uXYrLKF93WX=wK2In4yC7tfg#|KoOkycz1XXI5Fv5pNla_pvGa~ z;-MGS?hV5S8Ofovhrjo>4h-JJ@+u0X+ejT2%HFf|*3l6Oj{|LzfH%xQs%3VLqJ1I| za4NkcJ8gGW*!R552&zxLYoC*9(-9Cco`?+cq8HG=&f%Inp$pn+E6OTTWW||wqdN%0 z__XTvOsuDvHgnE*YY7v7Ph6Q}TC#fh=997px{N9tr1(Am#5OcXu7$pO#FEWQM@x)~ z(XZ>}iZTI6S4DUU8@+9T}2=UAO{O&xUTz-rUM^nF;B)bERyPV%_7$sws_ok2$jN+BN`iE>io;iaB=h*! zIIV9Si_9lYG`-aE%7aj5ak{-P0)S)j&l-(n4 zyECLbxzZ;md7qpI8Is>Z$5W5(cR9V2+pt^0Y3okZQ`b*RRc{gLVX75|%3^`6#AVr= zN|x+uNbJWgEL|63UW#sCU2HInceIt9!m4fvpn|xQ;Ww6;j^}ujDvtmVXKVNWtN0u~0Y} zT&~6*en_?_A=BzWsG?Yk#Ok)H;ub~qzBP0nYN^sPb@kASv4*`xNm@oOLGy4hq_`6< z3RaG2sfvxX(vjt=B7)>N$+{D9>WDY()PR=N(*O7U3o7>itd#vH=KsigS?=fmgCn{3 zyZ!$^9aze?UR^6|Dn8}{8{5$AxMx2Nv?B#+h-{o}UBEqy>Ivz~nInQ(D^N6C z&cxJs{B}IGbWra}RR{RL;zN5i2Lc9benr*X?0XwBdqG79YMsvBCReFs$=)CoCD0ZL z$$GW|Mi^k&^L*6l$p3b>E*Yqx^Jp)#jra}5^6uVIT7BGeALp;s;g63isH~LB!__^g zy>RI-oW|s_Fo9b;b1 zL1ph1df<}IRV!cV!NIGlr+@=rd&nxCDYkIDd6l{w$+jGDSht!BC#lq(tCvkkMEeT} zz?5vW)naa>AlkxLQw<5e#>jaOOV=6$4xwaoCh|)U?{$(HT(KOiWSuq1zy`2R&-AIU zvB{ciN^S|W3JVfNOt!HKE+-V(%G$v~ITs?Md23ossa{QOHnW#OTeohles4H-B9S$j zX#atBDO<3E&YOs!!|1GksWN1$pL%??qB9?5c@Sj=Icy{<&O$BZQ_VQl$QQ=vV98!u z$X`j}EL2#`Lzl|Q#71<>tsiVmnIkM~Y!P-?kU&pq(0WDoB`L;?Rw71cV_V6o^V^W9WV7C^$)S$3d22k(FSHv!|CAU!fz}eNip2Jv5Pkxx zZ}u*&XWErr{aB<-m$5AJ)Mqsk@p}P+ZT5nKtIFi|`1D%_@j;UxaV7Eimq?@2^QZUM zU$eA>1T_;_{Rxv4!XCbar-&93i64fF!U0E62GShgeuk1Ubw539Y=M70bQGS;+Id&8 z(Q6aaqE=sJY1QeB0xBc*>|MnSk;ZeWnJ0|mpLKfs2WnWCXwHgWZS2#w_pXjWC?a5O zR&*0^4px1JvV4MfLgBK!10?~D$a^5L!v`X3K|V@0rmX~0Yq9X@v06WksM=!AE&lCe zTQt{qCH>J3ZKHBB881+FY7G0e(3wp86^A7Z0rW78U}iAe#9%s}gz8+RL$JZcG~$ul zEgQj$LrHtzGAN*NFaujgkFkTWrLba?BA9H{s-OceQ)X_8A`Lwrc4fLX-KWnFA5Qm+ zhYwYYt3&m6V0zt*#d>H46lZ~}7KiZfajGFyhLO{EKT5?eW6<3zZqk7P^}wa|?jq3K zBP`c4x)X`|m~q7`vy_!7ukDC%lt#6RjjJJ6BkUjH|^&Y?qPk4{=CXBy6`u5pZU&gq9t8g~5 z3}s^827FN10fG>OETgC5rJx4q#jLzoPdO|TAi-0@dyx+k`kr`~E$s!>qo|ShNg6WG zY9tcu^nJ*M{PbpuR__(6kVEAQbFM(;-nA|0mF6hkWsK#hiQPnnV!FM67lt!jsCOL{ z4n-Mwmpd)gb)mlU_Wt*F7+^-L?jtMLcCF`z8ud$vp!x(Dis5OKES}+4s(K?9-EyrU zCqX`s_M!u}M?^3@3J{=G{6_ik_hcm2;li~3k#aM6Ig1`YeoW0gC8L-nqnES9-0F$-@U=`> zoQzGGLDV@9hVllrcPN;~mW@p`Ey@?)CiN|z1QqQf2R7kzZ ztQVPj*s~rgQ{uCGHV8Z+n^^7dz$WPD&(V3qyh2|N-9?ICYTj|UC-wFRn0xb1g=Qr^6HgMx z87)M9CDBF4{E7@J#tWMZc05a!-{V>9ZR;I-oR8+dyvDvsFUDw|jplV~zDfTQ42JpL zw8V6v_^=h>XLBh*Y3uV2K0BlLwo@j>1-hlm+tT(k&nfdvd@`{te#9lpv2@Wj1m7C} zGkPQiUE_kf*aO1IH&|$SMpiln=^6P?M?SRg!?L@ti^1}^yMJiDyxEsm?dm)ArHw1^ zt}Y1Q9;jEQneL(K3jOV=SLQp9$Y38CGvGuRd`q>{QcYapRf~fcSZ>zj#i_)tD5&ew z{gnfOSWi2l=k0KD>v6}2Q-xe9)vgw6`{lwz&m^mdDvjnc@<>Ctk{hRlvfr45?>=r; zf}7QG@rqT_>QkqC?c-cO&h5ut{kZ$NfYhL(g`kLk&pVuq!5X~U;e1eV*Z{W2A}5Sw zlBib^-Gic})9EA)cgsggQegIvlbhJs$?@(-cXms$NorC90OS}FCC5P@ECirm)lB5O$M(=2*>Q=0?iAeKZ~T} zq3I{W(?u&z;Ze3lMnsLE>p2K^yAYY@AR)tOJSvvO`B=}p z+f&k#yQz<@nJbj8!g^-Ao8F=@7PkgIA=g59krJv4Hd>7pG;_)AK{G{_Vj?!(?3u_h z+;lW=XuJwwa3cVg7!Uh8@V)zW;aro&wgfwDA*-Wq&ByE)B?cIlsiy0= zH5;X*6Ks&)JbC);$De=s=_~C04`2PS=SNST(dVyTJpbwF=%;V+^EY2Thv&ci1wTJM zdiE?4MRM}iI7}{m@0dw%_B8-(~LUvbL*^yzalf&x!JLg=ILN z4apAp*^ftG{_yRy0QL=cQRSFSG^aspsK1Sr8SePd@JFqa)+x#Jxawgv>eHVA|0((i z{xBNSR~fx@>KbgPZZ{~lK-QxFuss6EV7aZLFFHVJ;oIc;57l1S63`noyFEOY3Hzl( z8)y@Gvu`-Sz9 zq%2I5?|=L&ZO6L5Pk;R3>CyAVML(xf2o8unFo3erKla3s1^D&Rv!B0mAzceWE`?5JDfH3)JzLnN=HKt7`=v%L=L{t61! zJD}%;wq%o3vEz2m`>Y3GbsG8{pNv;`(N2plvXb;ca*qJ@8I>@W>Xx$(oBZIwI&9z@ zb&~8o;ZL{A_F!0yALR%4_z`}9CkJ{QFcIHMXTMGK$iA)2VD+^%yxmVAS&{{=JK^Js zyXw$W5&1m{FBeS=uq1qj6}ArGpZ-weD#sDn&n@> z(s^9pNR~e^2!HncV;5+a-|t|;y)A>u@0*6c`PhcCt&L=Qt9^U}`Gc)3^z@t<4*B`V z?uEzbmfoq|3i-h&&%bJ;mN;3P8o|ze-d`ldgo-LJ1}_v=q@ zmm3Q4xH!{1uP8BPM1;znsbbp-wa>bD?`Cen??MH8uiH{AyW87Vu$hs^a@F?Tyh@*C^Ot3TAJ;%-fOmZi0kUbUQkb zPHt-e*n7+p`UN!6ZeluJsP{#BH;?W_`_O5*akLM%cN3vhU{rwI-`?r&=4)I9|9}rq zpTdU^@Zsnv`V+qRQYLfr_5L;xADSOXpY{(@tED?El@A}_Y|Qr+Ug^uW@=ek=pa$<= zihnRS_~XY+m|7BJ9K$%z7o+iF85N898YtHHM=y?k`sU5@$p!#4IU#O#pOffHR#`MC zJ~-$dq?Rdbc3%mAmIJ(BNX^2k7+Hz)T!O}3uvmWrzh!7rfd&HYZCzh>+4ePsrR-jm zY1r)jT)%B}mE5k9Z>!R7ns(GqYpSNS_A`u>PIt@N_RwtFK?)v9%QzEbsij0oKm4 z`yUSu7+2`rMjtONW@RncrjPIF9pXk6?O@pVUD)6M^6Wbe`@5ZC=ctdAPUo#?zuWp~ zP@CvArf^W8x*g;OQIzs=!0tk47#Mbn295XZj|6r%(yNBh*LAV??MFkt9TBN+ljSqD z@PJI$?5X+j%a4J5MpRhlrq_zTz)SysJo~s6geQT$*1H7kr;i5K{(R8ze1W|~z`po& zSf*#63hYm6%{-t>e)8n#hmV@b3^|3378VfAdh+8>9|H<+;2#vMc1B%Gp1jxs3~B6l znzoX0%c5MJo{v}M&}8_%mgs86S*g#FnAJ84ZCZ@|R!X@Q&b365*jq($+QjhgN))&E z(WZ-^LJ+$hVUPF4+~89PVy-4Z1N$U`XpkpDr0jE>ncdMDNvvdCH&#cD3$zK%{! z6;@%3HlwXqthrT+7=H&{$XV~MUHjW)7hDH#8@DTPu00Nd!`Z)E?a}p9R8J=JDtdrW zI#TT2VA09)h2J$es6GPLpF-V2vRea-?m%Rbz+TdI+EHb7K?2GQ_axi*`D#ZaP*P96 z{_&^3{PfjdYhKgNG=2M6s z?uM%(LX>WlBEQ8B(Ww7dW<#V>v5+w!`62p`Q7~{0UfL&q;gBSYAGEQudd~BX$By~2 z=SSc@2t#{Nft4Dgrltp{=-aKMv6J1tV}kP4|FndeKU*)1?TOB9MOM>fSxX@ZM8OHG zuo6;o)uDFzWBW#+1LDJ#(KiEca%R4%Y~(M+j2fAF>X%4h~){_>Z<9zC;{f;O~q z-g@dp{%oRA!g4vEFHQ=vHSm{!6;u)P?95ltOSDEG$OI1hg+Y7GoZAqrv;_Dm07eP2 z{hmy#@f}4`Lmrs;ak`}&f$B6G_|+tFJRIUMF8+$JQi+Ps7x+n=-Mt;N_<(r^+s^Ti z=Y`HcfP;bKKaSQAteX{)g)VG9GckSs)z7w2-uqg;ch?xKRHs<*aSstdrWJ^YavL@c z4?&gKBnLnIAfY<1Z;Om4Z`>Hx3bm&9uY~e9)(Bd8Z@UJ>-5dYJjjCCF=7xJbbDSLL zMKvI=J;u;`Jy>TgM0SiV(-U%4&1@H7@;}X;c)H@Qch)tE26)(#2L@*n*?l%1k2nDW z2aZ&ITN;qsoPsRVsp8lJ7fgK)t?pe#r*{ayYhlh=@1AG+IgSZh^MskLrB`5wdd(;le zxg29iw`ShbfkT}%L6*zFa(rH51UMuIKynWcDL!rE5ZQj?p<-E+_UITrY#b^ZPfkl= zgfc3<45a}oN>1lIUo1K01U?;a#>4e$JVO6CvKlgB^m};6S6(`BC+{+Sw0jK5oG;i; zNcnN)uY0d^3Ucwf37=9EYX{!k*~d5dDZOJw;X%z_n<`~@In!S|f8CDwQ5*lW3M*4d zES4)~rc*8ogAxDMH|}f0~6`1 z-P=1*VbWw2ce1_S-JXe|lI`Uf>AiP{AjQ32?2MwB?`6?re4TRiha&EDF!$wS3TAbv zQHlyjQ8#+ZMvBGzwMmCg5C6nPK5&J9kiIfhvP&hqUlVUc@5%j63iMv@-@OYHb@#3s zroqGB{+$DQ`8vOQ_rc!&?X1h=hIi>+v)P3A>D{|cwFKbv1ALAJ)4M${X-u=JSQT1; zj0`-}bZ7aDc1lIM6fH=&yHfrp6&egRkS;*1om$WO>^hiQRdh0Xuc&#}7t^}b$`?ph z;AF$D@WX9$l!P{WoHY4Q4p?Yso%{d`v^jQqw{!mhCY$x90}9=f?qz17H6@;pJj^l^ zlxm~vHST;$>#+BhYec-nC-MWoU>$0DgIurPJPe3Ya_c+?D3_j39KICSgc4bc0c|-N zFCOx%=nk9Iyl!EilrZdyADWpyw7P@aVRp z1M!_>V+AcaWl8jvTNB2LRpUL3l+ngtcktI;`bEEQu=^~qfmz;1-@?{A6M9O zOu<^|nGp&vqf75CoJX(7JuSr;>Ky)EbujZg2v-?%TU4d;t)VuY%) zjb{!Oqvj|Q^Q75J@#O*i#!!h@`gqu=^!9v2NQBM<`NkPlC5+xi!qPsFZ&@x;J}qE? zVRO&r#yOpCG)Xq)rcB7hvf4Zqa=O69oqizDLmO(R!==LT=#}cldy_;~w?If`mH}q~ z>vD8S5_u*ja-b-T$RDXnlKX=;vV zue6+Wb=3$3_(CaE)4}!N(7ZATePvp=d$`)=LN#G;m+LREyl^B%bMD~3>XE~~A%%a&%K z8n?K7EZBtY)y}L1#kkbxf!bY%7SNO3fch}~^Ow&HfQEm>v(`St+$`>gQr%1l2Opd; z%Vz>H1~Rj!qC(^vlw-W6j&{bC)Z&)?IbZU6DkrWcCtmf`K~zdbU8Jgr`&J$-r-ss< zKv(egDKV6}`4cM}K&4$34D+yhX{rkADUX~HrXL?G()Q@Zix(W9=hZ7E&DMG3;0~~! zoz3R&W>K*MPHwPXjiUr=Br&mirnCmQu|xPEb;BnN-n)Us53`4nm3$TkTAs|b=c5T) zo&bnIgBBg$Y!01oULUM?mzS4L#wfi2Rpc6rxDRmoY|xGgYN73sYG#|3!G6R;$I7CL zv#2xPVd97PJ{tyL#MAk5Y<%`POM5x*z!hgkL*pj%U7N%PdFRrCX;cQtK|v$jX02!h z|HhGfXp$O`q#Hy0)r3O0f}xn`sH|fNn*tE;*|t2Aw4ew8zg%I3_wW(e30S9A+Gq+} zF~M8$l5Wf|XEE$Rm2Hi3i%^J!AHD+ad-ZM% z&__LIxhWYX%+4cZ&a`M235R-#Tg#|FHvPT`Vz~@ST$}mhOaV&mqMVGxiQvH|7nXsI z?8Ty=%k6@fB87*;a-2B3SVn*O<>&wS;oD~vO4}UBdFt)kui3fX359zyh9h}0Z({0T zpiLbT3E+bJ+6p2F>;^DB!phRo|26RCA0%pub<@%KQ^7=#Y)J+D*59QH%0fQv=aT^d z2o)V@Ri0DUlIaxXBi)w&5EenF(`k^X>zijkKEW_gbn`*M-Tb`SrAWNSsBgTvSd5oT zQiYMA7G}F#phyWb#g}i#N?R&U1{`sE=&Kfer&Wh>yYa6)L#)Ch z{3B1YZj6#$`PS_A`=-k&ydtr)aV67;)scPGkuw;$*OjbW*N?NT z>jZ_oNjH##adH}J9qQ?Pv1$*?#c*A^@m`iuGeLEng;)5Nq{?{D(=J@IQp(x?66P&!a4j0iZ7HkLm}WpfOZ9<7Zk5&tEX3N_9qdliYd`H%vQ-* z!o&?tp4ajf3i|o;tX;lJljvf)UXlqQDlltHHCe3=j51*@t?16Faqd}jX2oseooA;7 z$KVKdwoH-SzqRH2svlJW|J%G$452wi!%7XF;nX!Sa}r2<=V9EWyxwm!+zaqwejy*; z=JFv6O;E*AB|J$13D*GsgIZR!)^J0A4_$zd@Su8d8vq3hOOr%eEHAD^G!i zYw;~~&w6wbx%pW|nZXz2CH$WHm}runLaJ0b7^{s1LYF`B2CgATC8U?0BwYIqy@rawC!Wq zF5_avi~?785*k>5#>@4&)T}8|E-%aRbVP|exdnAm3YQ7xPB0~@oN}rL>h`w8fR3Cf zZ%Z}qCq^&W3LVz(YQ5xQnzZnNL0Qu-V4A20cNriCyoEm~xAd8Z@!wa)AZo6Fs;_c8 zO6rO@6iVFf6UnL;(_j~rC~;sb42QO|(8OuIuJsu6O2%H}{P4Qr z=ce7B*XlJ}aYX9}`o_+5Te@WtZSI7u& zP5N$8TzJleellg_mNB0r5EQZix>KJdpaPm)TO0t2&XihaHW47wA9>GtLajoQI8@dR z%bynG;d-$w-&zSkFVI5^m`nKHlPV)KApG9}(Bh=aNRAZ=`T z=Tn*!bwOUu+k*;bPF^E9od< z0mW-)q*Qik)EVd@jBKDL&`={DA7ICn^xzWcApOT+CB zg2M_8%h7`q3Sdd?sD&KZbUAm1jQrRM@aVW1KN_?os~r|IVg?CtkfjR@!)M5;b}Pi6 zT795HVO2R50AkDH_EO_Cx8*(*=z9^xGZdgqW2ftf&1>kvj$`B7m31s^9gg%wCAA>~ z(_o(s^UXV5B^oVJ9Ov9KhWsVGs+FKp#%7tbR@L}s2Q~xcxsA$F;`_>KaT#2NMg(X8 z`7|)Mlfr~iAJ~fy%H3700A9BRZnOXm3_W==al6nvy>wrw*_P?FC%Ty6siks5T|=&@ z%yvp*(XEWr@l?kvD3kX)5{=sWNRwy~GCULqqjS3Q2>Ud;RJX>%8~2)(9iht{FsRTm zwfv-Mc%oIEktdJ#M_G&VepzX&tO-qFIdz}dwDi>zUr z%XF_rse{qWoiJL9&@9W;3sR?dyK380mgih$jPj_!=b1-tLw7;9@zHa)5u<~fALUBa zvBPw_RITebpZ^nfox@(KnRq*1z-63I#5zJ}Z5)2`H|t5r4DMs68{xW^58AH-I{_u# zDd(lI-!m7sYsre@MVSRa3627%CLeA>%T-SOsz0wZmNP9wg-UEy#fz1DrN{$6q4$65 zyu*Z0xH6vVT@Kg3IZOq`(^<^VmC^(zM6t-oIm5rx`N#@-vM7dUqN1&sC7wpjxjh}H zZ>{-YMnjo=nM1JNv~f2k<4sE(oAHObcYKR`DN06MkjhiiBN{=PaSf&Vs0MYEJfT}& zlfV79jWP4b=+i8rX{XI=+ugZkjbEEJOZ^$Ixk%wAvAA`lJ*;vMvL>{fB4L4noFwod zK~s(usp=}kN&K%e;XDZiv>2V%GWwm@?8Qh~kHB*}#CN{8xqTszcW6v?EEo2Z;ZF-F z#wW2XR3+7=Nnmq&a}@AXvEjF#*q%&=rRI10^3KZRL*{u>-4bB4)006VYb@;-%Qlr@FmpwkDqSM%$-G5+F(_fn zmlx(hT=3F=E8Bw{(=jshoveG8+<DTzv9ewF_{_}=s_w+TT&BvjhHa_S z&TtLTXDdoc+V^i9$i#H;)o47y-yG7v23UR#uoDkhNR`947b4oEPuYt>{d2G-sBPUG)HKuygP0O){Ibi0R;DzkpTz#hv z!d@$=niJfg6pKM|GB$9Y3X>&?vt8)>+7*>1x2Fu)Io^ch(0YE`;hkHKqop)R_HMhYCc z`i08Ez_){6EgfSQuAvsVAUHz7y6>Czi5EVKKu!o5MMhZQCu8 zyR+Ws&1EICZk9pz*&MjFG%>5=R zE*vX^=;$xsiuwAZM~`04FyK2M2%dX^wuHpcgArcv(a%835&-w`rD3bwpiwwI$;!*x zMKnuDsQD?3YGYkbETxYdbY*h~;Ssp%y~CWsEjnm12a|aiygT|U@3|IR#4PGZr`I^9 zM2`6Wh>l9=L3{)c?`iVeFuI^mX+;Rd6Wz)aczEA#g>M8${XPZIe1d;Ts)WbU5u5%I zJA?lINC=jv=#IE7&&z4Cpo?AdBxxm=iN-s@BCPYAL@+dM2>RUG2YO3Er6-k2PXd)L zrBXvWNM2Gck{*BQb|*$m!ez_tTTebvI||iDXYqVd}(Qqq*qTc^zRXw z5-JT4;rKpf_oR>a2*pZDM~y~rmmTBHp+jM+=^o8zW9zG)XbP6soTGIXbSSC<|vt!qTC8=+kHt|3H+x;v zH&Z;TE1pvz)lijQU6mmGZf%Fs5bb0kVN?z7FpXV7B4)m1^g$`E#xWVIV&s5|p01fx z{m~;1NI?+bZ-O5ZDvZS_GbW$@a1>H3(2eP{B}_Lq`UDBrah>cuxYexH4}7il!=Tl5sq&$0yJuZh)ew@C&F*K8CAzb6UqrMQ4kdGOhSGs&aK8NPyp3X_9ff zlD5%>+2Zsq5;tqTwaF+wL;zhmLJdEJ#|gc*+n%xVkZtnbvI&a)UhCK#z;t4y>g*>b zBvEA&t8=Rgg+~CX#W!$Wd7C(#yRS}Kg;Y__b-B`1CY_WdWGs%Oa0c7)pXx5M{ADfk zJyp0zoWBp$yRxe>U+m4AQtgS5TFcDdIyN$I#XhDd-}Y^Zwm0ff_sz+*!zLq(9=$0r zNvXBh+}_viGebqT%2A$o=#r@RR~Bo#0^jgV<*uua%^tobzEE~HLER*+I%oOxF};A) z;HH9GD0hGk%)VxcQ{~#~Ty$f;qLKh_EhfwCooWcD!iYronT_9Z30_3EBw~lD1}y^1 zO!ouki*C__XfPjL>erGtDJf6~nCLQ!{bZi!eExO}x40gGxfRh@zIPxG3LUW<6=51C zz0IU!WF(6r{xLu|#+kC3N2!t3N)OuUnpP0l6o?UB%b+d8<5~<6x57oecYot|Rx=(> zY@|d@^x%-rk^@It!P5X1z##F_a?QYvGf4fI8y5M`6lJ(&MTg|-HNVye%_0vy3{qjR> zypZ>K674Q{s9hBAka$HusbzvQ@0Hfw;Js_dzdO7}gTN!~g5^)G*i@q5DGb0M3Gl$L0;QEK+AlVKq5USE- zf`kK8MENkXOuT?5AbU-l-3Wv;ap^LblBZ7-6<5`` zmCw%-SbEeg4;8bI7!s_yIG?eEMx!+$wv@^O%p-e7E99QvB#>xAIS8)c5AEA2f^%@SJ)_KiC3ZFP_ShftTfqq(->ldU<xi8pjW>2QahuM@)x-IQe&;HD{(EdrAM8xQVFcmR zAXVNAZ{AE-JHnf;s_-6F!HstXH@3hPuxbaG=ecVj6{FFPprB-&2H0VDok^GXDqUW# z2Rk+dC961SR{)-`r#k|Kl2w3rDga02+Z_Qy$tu9R6@caL5K9JGi(S91YGW7kcRRKP zC9A!EUB&Nw*OdV!s{n6T0Ip}}I|77~7QnVZ)PM#^dv=3_MJ-Std{E2NT^A9Q+0;-W7Q46f_;IDB0dg!}Q!ca`TtU4!?5!n@{Yl!g%a~^8yABXa?mobORL8g3 zy`|0ero6U3IBij5z#0#W%4+ighFj;lf%e^2F%)qHtrlY84m@_*s#WW(o{(&;^}gzy zq0PGn1-H#0wAR}?cryVgklcJy1%95Ht};Upt&%97-9KXI6w zN;pN=(_>-@*3>zguJ{CdAp50uN(Wd)iW$r1gaC}b|7dlL3!QG?a(@u zDgxDM-mfPdfS@9PIebo==epi^I(pLOiXjY8*3I%77RVkvTsQ_4s{nr$9y=uv&Gp56 zvRWYqJnLTD7+U{ehLu6gZQ7SRMgc%KS&B zn7Wp;DYqUt?j0O$+Hishd;8xN4-}mz=wd;F^PtQI3;2Q>N}L84dJz=xW)hE^23tX| zF9>6BfGqVF++5-^`PC19jW|Ub>N`AT&(RV3mOO!u?O8fxe5$UsC+3oW7@c&^I!|a6 zXk?(R0oNC#T9g3sCoVZK=GPxx{%1E$=J=^ z#WQDe6mJ_H#n=xp@tzuQHpl|OG7TV?KfEvDV>AytgC){sn;YfV3#Z#T%6ywvMv`K& zz~p$ROOIZ&XEb(74&|lsk8rBm{SXNIjX!Af8#I-K5l8Xq z8dIBuqAQtbDjT)bbCsLrJv_oR1{%awT3rLj$Bub&Vv~YgEd}`S>J@sg2dyJ5V?1Yz z8^c}VYS?Hb3YnW4EU3M0S?nH0c4fO%9Ux^mdB|qGh8}P-9NJHILY%@%hy$ZGrjW{P z*Is6)XrMKpD0_S>M&8m8T6BQI?aXct5}JAD6U+jkyQ8WtG3->wI9=vg zf-hOEV}02OtVYWZsXl+95CvvWP;T8taW1{aGohVDox?x;LAo1iflg2Qg~il)4#-~E zC%SCnhQEWYCN(|W|HCco3Q6}4wJr6u@O@!ARo3$a-)8LPI1W#VtP%d(CM{MuQICCh zc<<0@xUTUNO9Pf(8(UJ>qR5z$M~_)hz?woiP4olwZuH}1M$7t_jaS)Lx|wpQ+iDRTF0VaQ4vGX zXl<6O(&BP0Qp4v2vPafK|GbdLxFX~uo*uWNY`F>_0SYXV%f^kt<`g?_E7<*y0NeA> zY7N-XpnJ3(G-}_SmN4z;)r&q%uy#7MZV0yt??V@gW;=rp2^{)8*X}AqD~BK^YkjBl zSV){B78T4r?=S&2zlgFw{6W)Hu6NE?tMK5gr`K?xey7i%*E!nlUfbzk*XI|M)g+AS zU1w__W~+(t5c6pbG|RTvhl2ibI-(l%7-;O^vUUx)^0;Wz2R8n)KTsJE@J4gKJc(0B zNQn-YDYJm~Ee>7eTl=khh67hL;hsYfRQxzid^E3F*b(NG|FU&=vUq6w&h*(p^$e){ ztuFu?g^pR2C*`b|TG>C9=>ytaVncij;nP)&rukJ~eZ@$W_r3b6``1)GsIPiYUa84V zC+)sizI)C2BGmy^)izZDoKKPd zqrlo)GTEz##X^?N9Qha*EmM!X>*LHY?t{oET)Yr$Z}y z;Pp2vYlGNfzjygf7;D9+Wt>_f7>VUX!)W=LM8n(C*^xXa1T~b_`uCq5e=7OENjUTw zlYjr)b@{)u?*06pm;Zaecfb34{_lUrkDvcrPybDle>bcc-X}xj4i?Lkip<`10Ri%~ z;#*1F;6_i7AQlq2i@br!6KT9uDnYm=4S;4`%6*5=fg*a^W^ZAMm4?7O(ers!yq%XL z0l*=#ThZlwttjMjjPa0{=g4R**tG<2kbIpOli3Sg4VCK&Fe1;^D1W%b8~E&mf^|~3 z9=4TZbJ9UTN0?`FR-jaTddaO1k@K1@*9#QJh`|jvL7|FI z$LcoNshVoi*&%s0C}-Qm%aXlRd3ki0etB(&Q4B>^vjc4Y0u$HJdsO6@WntnUb}DMdyeT{@@@)&^RG3j7In{ zid+223lh34XRyuk&Oy|a746{L#8ebf-USA>1QeYYD|CQ5Nkj8?Z7plsjK3pBZToF( zt7fen1&i?orzr5tTzF+Ve|8EfJr$Rr_E9BwVWw1+;i$BuG_WQV*E#WG^vLW1Ou#xP z8-eKsE0)fK|APC7635*=-eDL8Zd0wteL+mzhCdKw=w zKHdjf!M@x&-c>~%&q-;uE&6;;SyT`mjz;;$m|1;JyqM{a+D`o4ZWUuh_PtaIYO9Pe zN*r;_Td`z37OM+|2cUxSQL^I4o@9-RG-oJ*OEs2AxVA%lzFIWP4+DoDdY*&Ed$Zxi zU^DsigcuTtRuqum#q%?^0E(mm`;c++>tV^==gkzH$t=w$k&aoR{Fu#r1!t!^7aaLR zt<8`#t1%kzP>)r)$OHpundnRCJ7KO~O$rBv2NEUmQ0~s0G-}J9m^9TbPQ>AQ*HQ=q zXMVQyZsG^87A7FQ(U$S{OkSN0Yp19HBJA)jS^7vL!3@{V%NTEB$ze#n&>$++roAk!~j+X zu;S4VEf%9uTwK)`N*7SlHs#Q~27I|}h`<%@a{?6CIh8M}{623eJ`<9btN{|Wo5|)% z6k+wW0G4AgreltVHqxP;a8znpaG-Nr=Lik|RJ)O*mXb;Pxf0=154 zHmpi^BZ0wvhPzV*v(;;o-RD3j@DPP}OG{$O_P%Z~9E3uCcQ7P9;v+P|qtV^rcx+5H z6*<6F1vFHxGDCD8Mz_&zOlA=)GHLul6H;@8o2yf?(hF7v3bd%NOoyCVDg@YPK=Gs* z#;dl8G{$l_6odNmztQ0H%Kq?YyZrB7p6}I18~l) z76ZyK-^n(9DWtb%S%TPkWQ zoS_%YKrl6(3S{3CdWw+o4X|797IW3ZfB*N`+~VCljFVPOp*&<#@ebt{uw^|{aZ$9c zgOxjt6Uwv2{e|AVh?PD}S#ZuTL}h#(h%Quryi;{AJUL37q!!!{=&D-GPR9DAsIA$~ zOt{=&O``~NE9z7mN-<_dkV&A@+`+zT%wDVOTKqXR!m24Y?_dF#?eI z-NwD&1%hiHVEjCBpbR>*;(RRC+1Sl=^x0bC3lIDdta|@Bp#q^;!OyLt13&t2*RO<| zMFF)k(OW?Z4W?iOw~yo08G(g|<4S9<{MNkEZinp{igfnZ1NQ(2OMBSB?pX3<8ZVP< zE$fePI+p0ff*x78tZ_NSHa(%O9@i0RB5Nj_FmGmjA~aeP^Fmu$dAUPVcU`*dT5>GS z#J896tArE&7?_=o$K4%9x0f$x{fziIEp<*Vpe8!fn%p+_eAjoV6(z54t1cYBemQ$} z=XMAGi*LXBV{(00{skS0U(VuAXIE?+{B}AWK(IX`j1hlhFjW};W3%3@cLfwnVHZNI zk*kqNB(~E@R>_Sq8NX)KUEEpyF;2a<`k&fcZx!@m-MUL)1HC`^s3j1;-rNcFc<0{6 zI#<>qi3};Sf1{xt{&U z*-VxUMSYw!Ptp$UFW5PfWH#%jdz0n^XAP0b7rc5v+=pHZCm0n`f@*G@!BMmo?Z3Qf zCIwI$OfcuI<`Y<~+RaFHutCXrj*rVp!$ML+#Ab9?;#^ThKPQ#~ofzKdEwqrlk1iZi z-{%upjE@!g(-BP${?6%lPXUU0l*wYBGA`dErw{?zZc`9Z<91lzn}gOpt1nni6F17o zC&MlJeQ7tN0l+`28i$Rtd=DA8RYEpb0~_GASv>0ZBtLXtWrvmqa@BdCG36ZsV8pfy|TDO|82d?sE>n@dUhs?j8U#n$u&A-P5lnjz91!bj z7@&>r3t+qdMj!bF7Ta&2Nppj}c;B?xk+&oyV;le{Oxbchz_#AM@C+w_twUF3ZcgC* z8iW%OjLzRe0Dg7l-IfIhDc>=P?eUAhy+W1+V5q`0pUV~_86A%05B&Qz^rWXgUim6z zR}HV`oUbuDLr%!R$-aD|fSEqod`UHh%mlBW&qSjq7@O+V-DC&`X($AlLZ_YdF|N>m zA+9dg$CXz=|;sPfxlfswc!2N8IT z4jw9>8RoscR4>p)BlrRh?5i)#e#^V6u4GA=Kxb!KRBSEYJF@^--FiD?x7?p~>t zTxm=1c)Xgsx0BmT%?P`<6s8t4xTGjb`F=)`v9;>T(lcOCa!WqO{)E`|il}lEZBn^t1t&+X84iM&z->peqa;Ii>X>58+IS~nFgz})_n`S({ zni)=5TFKyy+@P63CR=qg=bE#6Ss&z`6+#{J0XRqMtQ7@vpJB&J=QhMS&YIkr)Jk=x z!h1SwbO1{TlF|`i(y=rRm0bqQlIy?Rhwz!Q2czCu#A4%Vp*@&6Zw?8Yt_N~`C1|s@ z8kvUe_f!lc0fGsK&;zBX4IqdhFq4nJMIenIb0ktoLQ~t1hIiRaJ8%Bu#~;7@?yJASCk$fF zqM$Q!f9FMX7(J8O7wOe>&i8-*I-ic@3I1t#1K0a%+#+2@SoH?W6qe67PnGJeaC5l= z`p#Pvjo4d81~+7>oD3IJ%cZ|7+nt6KH~Fp5x|l6*@Mn&ZhUSuZ3MQ5r}B z%;!XGkqwLpx0q7oH_OaN0;>6QqVW#=(I!aMGpEdDuuN{v4hdQc<5f4X-c@NOhONM` zbDXs$K01m!9sIqu(mqDkFaG!cBbA;|=}i@tcCWO+@PxXy2?!N8Mm%bJRN@c3T3;+V z6ru0hvFY#)8YRmAqjP68xQz<@KQi60md0M@k7--}Wi+(f%PMHNwn{GaqGI{^$vt5y z972!o zd&Ayksg-t&X(xu_;KmFtPP`CSc)2q{th787x!d7kRP?pjXdi>J*&Y;=artX8*I$p| zr-gQ4tiz!7dH(;*V-isEOKU2RB>Wn$e8SEX`p%2Gq0@&7bczGlv!85Q!Hsy}auu`{ zlP8JUj9Jg&FHV|POidy)?3sI_KJY8`&28_M7P1$|#GbrL{eWlZ#jLzoPm2{>4bR$q z7LCzXkzgz_@eqQ6O$hbQFXq53l_-j6Y-2X*Zln7BmP2V!XPD)BszF^M-*pY7+=Y~H zfmF|{cAe`+xB&6zp5>)tKPY?%(l)PJ-oj+WeaR184?b`06TJyiSdN&fgEM;s;)I?1 z)rF(jBPWT8vI^2-?rw|YX%Uaw@D6_zxEyY`{lTSiUe3yMu>e|1FqzdFDp4ecyC>F{ zidl+@f~bl#%Xw$H8kIA-zIs_~br)(X81RK{LP53wLPag98ihU-H;3`+9opTVucxc> zVyY9kZitmxa?dM_UOTBE1SPnw|`FlW^|nP+3c5={)Yg%+SDBB2hqQ1Reo7Dv$+ zlAl;ZEd~L!5}`j`pNx08>Jmi6r4Du}3M9Dl`pm%$xq{=O{o7IdKfCP*Z(i*oV_-9a zqT>={bvic}WWNq;1-by&$CBL09O);F;&?_mNAxYkWHS@|sg&>PdZ;n?aN>y8Do3Hp zK0l;mhwV=4IDKmqS&S|pVakMplFwuKWpkI*_AbIG@V;@R*zDcn7pRD{NDdbl{p8nq zF;Dg|D`&c8M*x>LO{4moW*%lSrjGYg>%0}dpm?~TYl!oluP&8~i{D=sU#lBmxl|_1 zv@GVcp_9`baq+^63~6$&QYlVaXl)7RiMc{hCe;TmPcN z!8Wi9^mSm)%@>`awq{e+DP6J^bG`m}sP1>hxZVWpZ%GTCP-A69Pi?YG=}`+*Y6d8= zh`|P05@xY}z*x0@)7wn;0SCk5l29-j zeW7AU`v=AN@5}Muqvi^Qoc3Mu7DheqN4NN)lesceh*3z%B)`!rw}hIt&e1^3E+kAG zTu-#1eR-D`lu8|I`}9FkwUl+@rrAXc%~=C0k2eL`COaq7eCF6Txa+%E1f>v*_0Nus z%}TVXa8fKflhvY_Ehpne%lU?BfEJyZ{@RW*OE;*b34y~kw<1Wdj&H5l3KWxTIR_vL zR+I&{l7ZM;39Wr$R=5r$kE+cs%;Wl1hQCOR!bzNI4sc^08bbmMc0qxckmlZW zm1PW8Xm0I(rN304yXtRb-c9!LAb}?3nDDptiH?)Ll%W0I`juTIBDJ~%XGo=6ydRyr zgbBg!GJizXU9&9zlwKWUA<=Wom#A;0i}ur<8LrL=ijCq4qDXL32b4S+YIf-mDD*rH zE%lsTHmBs_cygHN%EP^ZuV1PTADXGZ^17wEp;F5Vtd=qWRX28=Fl#cYoQAaOIG47S z&4jF&34!ZJ07UMC$hHCSWsq*4Gu>yRLjxlsXuc02Bd2RpDv|D#y(_G2ye&Du|9~`K) zRma2Ie7cyC4n+-fgT8T+tLwT~2>;KFs|#K^jR3U#b-vG`D~v-kESQV&Vu1W$74A5zlj&OeisGY<) zZQd&;ti`L8^=C?^NKwS3BI1ap1URE=DN!Dy>O(B60qai|1a6IjP14L^Ha*>tqZ7Y{ z9YxU@PbYj+th?>1Hz2DF#^Zpbaa%>*C8~Ec*JF8fAP&gku_l|u4d*ih{ZaLyL%Dl*W zR+LXs)w{%VF3=(i4DoNiPY09UR|3Xxn7{kNEeeDoM zn2AW9PbO@`V4v%1rK>oEux@bCv&k)+6kwgPt7OooDxRU7F=1gtAZ$TQg0_`IHmO>) z>L6vRVc=J+g<|W|60Kx*t`@4}`-0ZhOS~7!4cf&E#wUQFZgcnw{qP|VfY7q6~s zIy}tWYdH(HthjPKS3U)anQd=Uxx=mKh|xq0P08Y5ca)q-dS$MXpMQeAdu1^gB8ygN z|Nf`Za5_iY_t8y1j+`87Iw-}7#H%ww(!x<(_5O;;Fc;&Edb&WPB{uW`i&ADfuW%{4 zS!5~6@4-dDYJkoj=t{iza`xvq^#sKwj}8^y)|SQq7AQAPjr3>F$bO{ih485o7(Xb= zo=5;hH~itGITO~yjddsi`3y(0)odFNNcD^Zx)Y9i@Z7;NJ$)Y&a9j!;^5mLNS2a*} zt4y+no7TS~laFn+u1LHPDse@E*+wPvh{9FXwAj++YhK@7JMm`W#k1HWhE&wSsd)lz8|g@^cI~XtD0eL03T0Tc&blJ9#FmVNZtSuaFvXaaGMCm^Jd$f+do%Nts0n z^|sW_y}E^6*SZF}m0FTpz-QED`K04OH}qQnE230~?^yX20)ZND#2E2De`w++Myr zK7-2lAgL3%ADa_E;k#-s-B7-}kwV8X%cp1?-xLe2oHRBhGLF8{5*@2R@+e9bsl1${ zPuL4v-F^VTf$wkRFaAvDq(ljPP$%L7q|@fQ!3Ia$>pIhCSRs?u4oFuMs2rt^B)4F) zxJezh$}(Rog})F^h7Jaf%v#p780fZNdg6~A7K|2VZXdfSc;3f}*KmTHFqtHQy(k{$ zrUGaEQClU}$cdS-2et+WhN|rs8NE3tCX+qvkBVXi#}wsZH?hO%dWcE1CJCWwMI;Vt z5ss5Mv`1H#Xg(@bK1wf@+=j!8hJX0T+>w&4cJk>RqrwjFQFgG7J@|lW{|84;4Ppj?i4Ui;i2m>Ux z^zF*gk5oeNJFZlP<;|&+JrnvQ7ToI|oAb}#so-#|T85Y zRcen*!K6s3b|J)RAPwB%5`cOqSG1G^RK!+VtQhbi_5Q^55Gz)Dz}k|e-EFmq+EK65 z^;(YZ=!Z9MJ^E7=Z2uqfbiR=Be&Cuo{ZjSOBQ66=MxH!=oXL}g1{F1net#fyfSUtz zhy2}s{n&p^+giPbbNO+<*ixW)>{nkoZ?kUg>!unMtid>~hHU^M(k3JG)tp_g1C}^D zI7y0S;UZG7w8Xn%=e-wYbWI2e4=JyYIGO3d zy9x-D52d`I1V`a0S@m)^^w$e2N-Q+3wh~bt^J%4MD4>Kbkx(VTfr>cLjZQb9hk`1D zWz>Y>5ZV%ikTADu1vuj4K!8XiiuqGBhU1Sz2^uP@0S@ULhs?UjHbA0!EFDFVF*5T5 zlu&4bnB@&&b5=^y(VV`WVh96e@&sQEBiL}{4OJ<juEq6~M^pk>@mwNO>(iemSdZ2AZ8a=^q^(;*ff}w#&l&gLZi|?su zvT}Yc&dd-@hqFwwoAbTfeaG<^vaGUv42n>yjPo3+)FFFO9#}?5&_-+%a6le4 zim7DDF1;8TV^y@yvadE|mM&U7tqH~Csf+m(sh*C~-|)qE#Et4zn>I%+)9ERRy1`r^ctoclbb~tUkQVGaH2EpGloT;7bA&;?$#2j8Ie@~LP?JJ zy$&(W8n(pZakHG4xM!xn-FeTsYR@VIt2P!QxGX$mIaK&KDE5oUCmo->I1_ z-=Ph@B$))rbfnFc-Jas~-2+Uy6lfEjf~MH-u4PeL!OLvUaSGk;)>|dAn4yu zI)T!&TYSF&zX5(<=7WGI{1LzZTcEvnMFU0hIVs!@nPHc8`rwTrpy z8EuOU~A8WqZ=fM{sHj4i%Z%b<|d$z8yl|yO<3j4 zWopvZE9owr*_ZNA8JqE63i#(-J?!{eXw^(1ZcMMd6^Xr+ps#5|qQ26?PM{d96B(L0 zR;#C@hCMW`)AG2mori|7e@RqDH{cNtFixiyufeRLbW_ilN8C<=(CSK``lV$? zD6vZ`L}h9*-_jojjUbu$=V&oER+6EN5nnDsv+gYfw9( z7)z&Ch`IR3@8ZVqDZT$&fBgJE?9Tkp%>TW=zu(LJ{NMY%{onKd{4;*M{6A*;Z;}JZ zy9VlnkKy~7&H$tn++a5E>G*uf2U>!ZbGS;P^Z95!#ax=0TP`{;E~At2426Z`h!Zh# zmSqtREY)@JT)e4_Y)CExby z+JxKHj2q=jgk;KnMyxj_gHA(x_D$TN=TOLv+kspgS5?_SjUtA+hecAAtTo&n!h({< z2(v=?;7hP>4Y7+|XNJ0A9L(*kLgzek*Nn_DB^BVA=4wM~I_lH%a<(cqs!L>o0+r@x zn9NWa8%fs)1%Bsz3t*`lzkYNZgMNh)#^@r$(_(SEDSR?pBH=4ii^iP}ed%=Iv&vU4 zZ*38$0@l2Jk)ojU_U+r5+$jH+qX?3k2_H1)x+Dcl{;`~kAbG$UjFgb zD=*}=`@`V_sp+(41`z!ht90Az&=hI)qq9YMf9p`k#4;&<1m}bEr#F++GC^x;c2~r2 z>2(0>KnV=Gg%}va`T6-=%mNh6>7FIO&DCq4{n1W*dx z&tLbjyQy2&3e1&y#^wS{#U9C0S!3RFA11tEjd{}&me31F0e}t$mG`*M4-dV^>V8Wu zG2wTJyVx6<2_Zp|$|4i}xPk<`=$2w4=jmf?M{08;l+Z5@dPo_ z%!<@-$V%+4uxe~8C%P4xh>z8M=>o$cVP#Y@E*1rf2?Eh9pLa+H0IfHzkCgVkD*^%? zgtTxw*&JMATHbTK|DG3%lXB*=A$)?kmpSiiu~(wH5kXYWP+9K!^wM)6bnKjlFaapTb{+gpn>`<`R6A zRGTG=XhJ@6K8>h&Xh9JBo*D?MBEl&;RyE3^WNOv9LeWvsf1mYqz%3dQo-xPx>6L&} zfC3}9wk{uPfx)BrxAXprFfJj5NrezIN5F2G!SO;9&5WV*lccEN#yd(v+I}`T>g`hq zeC@!;Cyvq31Mt!4W57>2+J^=GG0C(&=+jjqBeuLz>!(=>$G6P(F00G{+P2yP`{Wjj zZ(3wia{?S1nfK|_Q_WzYV$ZK6dF=J17ln%Z?bR-5v=2w4QS*Vbui#DXrYK zoD<7qFy@#~aQ7uQ0ZvFZN781L#I;=y^?f)*tI$B-hr_LCsKBC(SwSomfu$!-9AEwL zSKL$^nH05Woi!1tO=QW!Bh=mW;nUv0rXiulWQzAXy}R)3+U18e;7l0wF&Q7Va%bS2 z1=|{Fhg-loC7oI{EEmIdxeA>|8rgIzwR(&nI~5g~W~<$<5TgSBp>?)08YfUg8_;Ac6a&Kt!3&D)nJZ*w>shELqKU)^M^+T+9(^I3 zI`~HCA!yc4)1t=f;F#u&Z%hx6In@nT8&1cTFyI?_(}H88S=Gh= zN61i*_dg8^b|d=mF{839v?#5ij4l0WNR)~dApxQO2q?l1-2;pOe(!%YfZjf?nfv43 zM<7-}d}#MRYF{SK!~q zi+Qkg7TxBu$?SGF(asQ;7h}0>;_b7TMf1V0a4C;iyHLUq#wBSL%9&*{1p`}n0N!O^z(NdhHQj#NOX&VEBb2AoD{K63?b`EWYi_lyZM5oi_{}1p)UkRoqRrj z%W=FBmfdpQ1`FLQlqMtVUZtH)>`8&`+bfr>GTPWfcs5>?L$)}a&o6vJti%Z<2UT&y z^n_L>M-{iDn_HE>{`T2dwRI{@P`DE^<_oPFOVB~7mz}Em)TymgX>D4bm#ghHZc-Y< zNb*5!_iB7`(>j(XFsDRQu2rb5!*KE=SQcbGgWhv+p_;5=ovIg&H{W!=R0d#ytE;h= z7l2er=XQXaUv^}hl%r5E5!U#Sxeyt|e(8qA->~~8iy)mY!+4}`q>58QTC~9!$-c#) znS4Kc^G2JqyU5dQEiAZlcClVHQzH6JS?fw#+(HRvgv;*^$L@i)DHwQYXNgr${QYJ0 z97sxhRihfw;I*l#stC7e}su9sAHc;bcYio8#ReMyOI_ylGxOX^@>EA2yh^>Xa7geQ45t?!&c=3)Hg59NxZ{?IE;@Xj z))r+RB}O9hZc(l*tpqbK>Uo8BH(jy6U(bCj6x^tvjAdKE&dko-;TUrlsWIY~EE=f1 z*kblNG1jgccatWYX7B3_3H@ruuW$eP;q7+zFedYd_uBbLI3V(#!svv|xM*AZsG0ou zmp9-4_}AztdLrBB=+To@I##trFAgJ>=FJ*RE`wp4G|Nb|xtueD1)M!HS?d{D#HTkI zILb~g&j<4Nw_(ZhmFxoYPkv`q;tpSU;#Tpg$Ey391I#wxhYWHPv1qv zEm(%`ZjMCbPP}404e_`eQm}A>Z(|V5%4v4yM0f7^FpAmtydp4Nb~>>Z(fH!AEutBe zuJ!TPVchB57zkIehsxDg9Sgt~v1_RQ3Wd{6Uo>46@Esqcu;oF+(UkWvC%lktqoAP= z!}+p_fur5D>`YZ0LmTU*)&goVy%XFdW1r^tn?5YnPA3`QuOYCfmwou$ihk>Fu8>vN z`Qs0+D7xfc?@=Fq;j7+W_89(ADb!4Cl+5XPgGDc2U0pFlE=0_GQzexLSv{=OM+7kcj;hfjrdqsL z$Frh(esB#8R|DnAKx4NWz+yp#JW$x%(2j|mVy-ad=E;z^6Dsc2buheq{#q=2Yb=Z~ zN808e=0C58r#~ROY^kBKO25mhWt>zg?o6VonUI^9$~LVIg-V`V*#l=7_7kll)F+PNCbq<&Q!&|$<$5T#n&HmE;Y2K3!hszz%Dxg!D2U}#)+j~5 zC@dz^`MZFOyAq#;?k4LMrC74!gy4WDQ8ki=#ZiPN!UHc6T+Fe4DF^jpzFhKY?gaNk zzh=)TVlqF}j|b}sW)h(YBT zTc-G#1y*@#*L^wD))7+wtVP+LdidRjac05jc`)3nFR!V+@66|_^WWt7H20q( zUP5D}Xg`z!NURZc?rq+I3GUZK@tYOYUkAkh9(v+6C9)ACrND*{R2mMTAYY4dpcX|T zML9=tEt%H=k)-Y0iM}GR<;-@YB==GP(&TICUypt|`stg${PfjdTG2OOJ^$v}k57)C zrL2^YFc8IHIiIdq4Ak>CL_lP#I6}?LYCgx5x{^gX^;_h zlq||hQ9ycK$)c)fV2KZPMovL3hv^seQYL8NI0}{2mCk0M&6w27|Bka<%`enB&#pR)^=w8_fOM!GEuUie%ZozgeWbnw z;bNo=U=!?+KS53gA!=`vbA~0(Mon$&?ID;KG@Z#$*$S1+H0o3%^;6hxqc+I(I9BWuy26(3d!ZxzAQmBzH`3 zbi9|!3X$a*Sa&*>-ZZN$-c4}v=KsjCrTEkUeVdJ7FekbPFdgc)AvmXkEeYo7 zT9so4911sqp$^GI4Bdc4{o+kab!ASpFTb63MY9^@3P5M8iOnNy&U)jCqfN@9cBb%Z zD=G$NIF#@cetBvRDB~UEuxQW)zS?h8utV1|v8!$wgDBy1+)|gV=r`%a7PMmNmNkg; zS`U&sie?MA-Pwer7r{FawfKyE%)3rBuk4_qy$H-5khC!eHVUF@Ks9wEd;mY)u5wqv z56Iewys%1l<(olhb_8V=)0Mi?TOrIyrJ#1O@kOY~$Y>$mb+Vv{ptQ_ZsW)tUSqlnQ zgn=D^QLv0_!Lf^5C=?%qc@O3K$tJndiFW*@GqKmrLa#xpxah#|PA9qK`tF2wqzlRB zGEq9AgkOughc&Mz7kXgaTwWM@SemFKUTq&Tlu2nbRN9-()hu3zV#fha4b8bk2ky?d z-|gK-&u1aj0))_A0F52}`ycJtD4IT#N0*KmwUyUv(_Jh$vRS*jPOrn}HHfTPiV6s& znQ#NSY*~PQm+|1c?6{&)uatcGZed;$(5y zi*4~AMNx!*>PzO8%{pDS8pVI=i(lyYxOnwS6;faPLJ4Y~q>Oy_i!e*_=#gd8L>`)t z0%h?;c>LHa`S`I&X_RZPQp4arA#9Oi7Cp4du8#xfxPXh78JP|0)?dENe6ab!0SapQ zCcG8eODO7tgGUM=v*F)rscX@Hu!mW~i+(RLE3e=0X{p<{q5=_qhf~nuaftU^bH|PJ z3nK7J8i!9gZzna3JtO|deBIxJ#gzmSHOZkHjfTb1~)DjKxT6q0wvBxca9=4c& z=OfqRo{^h`3ZBH2YNKT@K4-t(N`avSkq;chCKQ4oaDie6B1MP~%8)~m!higZWid^= zbCtAw@SMY0c|+iXbK4LOws(-bbYQwfS*p*%l&|V&uQ{0*T^Jfs@TXeKV((;@W$tWW zIb5kN`YlVhmBlIo-8qcEyug4T%Vl{oL$VqI(Z_1<@fXpLD>OY&rIghVTDRdZGSg34 zBJ6>(9mWj>-8c?uM5-B3$AIeCz{ps59;sc(PUr4xrancqrI;QaS^A(u8eb+bi@-L} zUZ}V0;Nz}L+|hM9OgA+NEyDFOx7uqi+EN*g1NPByovCOnS}17C@9_qV*)7Dd&1`|Z zj6Fpd2Vqh4!Ez~UC#-OeZy9FEeQ|qoc*c-+w$UlPL%eOVPr^d5KjpDTh)tMwM zv707+M5K}##g0*lB7REp0~d2Ttvu#wU{9%r)-$6okzs+meB>fm`m`C+TnU#rx7^;e<&c3Vy}`Pzk}oOUmcj~pY&6S z|MeD`=6`1VuU5o|K{<(5))EGEK-(9T?{Z4qq%|B+Ijad zdJh5)_T%esnEyx{agL>SO4obGPGojuVyIw|;sI6YP) zV(Z88lh`CbvkOtOB6(mNPr>a@UC{z>oBQe3*CgK21^VxmgTW6+-+vW{t)29DEVo&2 z*1m&}`~=LiZI+7T`?CFYsAq-bfWih$RA6NlE^n!uDF>Ua95oViny*5x`1A982t;yc3HQTcj5d&f897k#`Llu z=UvR5`2I?tDlUpS1aq+sDOQ$Zx2~Gat+nm7P}jDd)G9(_-VzhuyH^D(su}9t7sWeh zj0}HKtuWE- z-J*P7t!cDL&f+a1{hHS7b% z$%FeUXtd>9!a1sXom@}gxt21YdtEwTIg;oKa?a^;Dv7wVu2TGxqIo$!nG|q+!%+Oo zIqatMVt7hsfJT73(zEBrARKas>L$eN<oLSI%_wpqmC@DhRC8V%Vt-oPw@f+p=LhR}_@yYTJ1fco)8y ze@X=-Qhd{z84r)+S-baYZ=cxU%{*pGj{jk&kGqU>(NdQEZp);QFlf2cQ@GrV$~*gx zQ;f>E%tZDregven9Lr^iiSGErS(57DzhzUA;O zlg~Z)EQz5b4Y(diAcu4?{TYxU=h>izstoI>U~Oe3q&p#FSm2@go;M0=O$jAhoYGXW z3L6Sbl6Sv{SD0%Ffl4cDbNw&Bq zWh>)HlGLtAdEEGsB$8`V4l{nF63R7I5;Jo?(uNbc?$*j9V^H{*40ef> ztt6kZtD+|5iYZ9+-n>|;?B=#Z;LmtovauK%36176m5Ne=?-jH8?DCuvZE0scopgsi z{0oYz3s+3IRY^=G^W670MGOKGLgm+~0aXR*EmCFcih`1vib(RhG z4scw9^ibpVJuOyJSRH77?Vytbc1g1Z9|NV~DO9;KaFc^%3uJg}VDB;95L6o`)Zvow zAy5{cQt3f|(C%rP=kU@4;l%CAxDBaGJ<}mh_jeE|2OTQx4sl7pLtK_RWJ(uz3TD*p zlDOmPB4d@i+pU(v9Z%)DcDc^hk{zq;?L5%-e8eSlQx2nMG_$+iv|7B>km3DR<1nNY z$2^Fbma_0xm)(C|u%~ae3Ky;1o> zz1Pe`)$WaNVMaJ~Yh~TS7_y|R>gh84I4%am*nNS#0*igPNK40aNVk;f?bp8*y##-e z7&T;@jgq0I+acS*hgnz*vMYJ~x|D=m?%#%oF;4XuNRC|Lt9Id9>(bX5;L8b{a`2^+ z-TV^P8&WXB&PKVjPHdYGryz2b165Gn_Z|(D*v69AFnd+)>p!(){ZP+14f4OXXT-F4 zebZg~@xqdZy4z!ep4bta@dZsEa6DuM$W^g0t{*!+@?Q*`t`4l?75qHz2Yb`6b|-+J z438SGzIx`?rZXvo+sFOdk@Uku3E`F&4YwPFh41vr(aXlFV8P;*-xe293egVeUgxet*E*jRTKkpbRaW8SYVw8>c_L)XppMU+DXaLCMHZHK`B| zIE#KBuh=}DUtQYLvp20Xya`?u6kIzVos*QGuR$T`3plHw`il&<;p@}&? zDkq(~Y+GF^wCjR$TEkx1u^~uCr48f<+-W7oa=K39)&Wfj27uUdjD2!PoOX$Sqt;}C z0UN>u0nyT5TKiWvztOZ`_~mp#uT+1hVvp;J;kcw|Pebdq4%{L)De>4TQFl21lP11z zO}w!Ql)ko%jADr;rQ5B{nHAhe%G$LcwfkgR zoEWDC)+fnC|6{5)muy^WM_R+0Nql^|E z&!t2T_o%c2dyej!nCIGxjz62f+c}ZQE;&R@{EU~sHFOX~FN+AHX^qZr&pWg6J5{dP z71uE-kY87zS6e{F4{ZQm0T7;3@`Z9}nzYJG6;W|bNvjWQUgl_SS@*J6sc9x3!M+dB z3_daS7B{J)HQ2)ScQ7voB5l1&Ynse=YEshLDnJHhxMkRedQF0Zb!Ou)w+rX?`@CAy zEBv8Pb_$%FzQkA`s3ON($x@j>41gpe{jm&^6-7c+t}~NR%ze>IEgzoql8pL=K?vcf z=jb81d@FL5$Mo>Z6QQ$?ZrxKFS8+`93#dW&l=?Kal!K%|{7HX8zqsEFsC{6pO&eF@B%GujavCFNM!1BuI(7#b5|Wz!wxP{m3_BYI1G-of2xe zEozPQ@$e#OkRovK0Vsy~ogBQD~ z9~(aE-`6cT+u6#jFO^lsxbY0}Ah6wR>=K1=`+B_$8;Ax~7Q!b6B_#(W}acEp8R%>%Jj4YaLON^{FtLFN3k-KLqAb=>Tn@V%+a zk~e|!6hkF6Kh>9*t45=aaYO30N^4c*lYZfp7zRoVq(lR|++}Lfq~L=ZmnDgEnMMeo zroOTH2swgFVcXc!3f?B}_hMPZ zmf%^;vN9#LKC#O36+crQji{%Vhl8>_5NN>+Bzh)IQL3 z-fPucu}a%)LKUdYo{x1s7x!D~yknYQgIA>F1KW;^T1byMP$HdalyF_W$XP{Fpn&YZ;ntVW>=;NJIPZ$zGHb z`aWU>R1wr4zXOV@^ocpFi+{Dl!|y-NkMIA3 zjvb%b{pTA0pL_ZKy`Jy?ljpzt|NK*aJpUg({Wo#{33~WMF+GUY>+@n$5^Wk^+aC*bhId)0$N8|krL{N=frTus^Y^K%JFQQ z#JWb5p-w2&avz3|-9ukkxRi+h~|J8UmzNzoyzjd=-o+Pa|7LbFoB&>GX3XJ{7S zttur8LW=Q%@gbQtSPzHC9fBf=p@LtesU37Pyb{@>=K0VOuwdW(7VZ{z2X}{eM;P4t-KWEsEm4wm z0?5ef`~nBtRQQ~zSPZHISQLW*#HrF7Ot$C^;>5sAxEUktMR)!$2DowI?e6l;z#Iaik=t`_M40ouGoCoXP0HV-?2S4yh#k6aO*wQCh`vU5U7;PyIB--Um=)NxG+X0l@)XxM z5H_?tXjBib!zgs<95xyNWiiHVD%6;>J?IsY2A5_msJ(iP4`Ti~wbqlam;Y2hIBso@6}3HCmUpd-avuy+G5y&Wr7E zDPl+nrm9(A6;Z6lTxmIp|8MA2f-zf)D~hWN<%e^?Ee2KK2dmR^!QUfzkXE~&{O`$p zy;z;T!7_=ntgNNu+fABC?2=&zXejL>3LpH<(+Z#G@OMg($9gks)Gcedx^uutCyz=?}Gi5?N8$5B6w+gQh`{F+?WyuhT|HT-MCYeh|7U8xWV z8@+FhsBg2M(#cNgPggyRscRpZ88ojha=@~sD!hXf&2&%F@X-50kvwEwug10wEj zj-EWdXk)@NA56FUsJ&~Go7*p_$#$sCcA!xi@WgQPyQ5{{WF441Lz)PawF zull;BMBvpOd8fv2d*Z6~FrShU4TZPkSi+NB~P zQnuH52m9bAkh|F`#zX^jBs7YdiU0*)vb?w7Km|f$4&PSq=8e_qVm!uR{w9ueE1Kr; zuLuA3ThR=@&qSw*_Sv6jRjF1KbdGZXltQqNE+g?X{59iW)(lO_a3tpOF{3ff`H?kN z*eLeJ7Ou7#3*dYEtYxGsq)frD(t*AgLi2NuacGe04fj3;7d3+=Spq+q){a~T7#h13 zlM*SxP4F-!eMCIhnBAxEuvB6L;=c)D6#k!>8(6{T6sA?eQ)kz#6pgnn_=>eT&n&xc zi)vnkvJBx)9jz&xYr>p+(wJ=Dh-MoqH|^-RsP88=LLFbj*ckh7Q8}w4>+M02JJD~r zRja5Div zXRL8D_-bc)r`P@iklhLV>_t(h_m6|lSMA=5DB6QXJKoEBU%~nD7jR~ z@g&FXxV9Q2y;70Y#_?WMTeDl=+&^k79gN$xwO-WL!Znc9*88fyi!Vm-bub=J)Ze;s zZfKh87#Cb*#b0VWKo0cE{?|(3PD=xW-P!BWxl&s#$>j?OpkZW}7SVgAvM~_U1#u!1 zKH`I6KetlPcwa`s0Bd^%r|{Y*DmM$_?R<{oKX5i3F@bGwvN zXGYdUCcwXU5$4#d7@Zy#G?tyIe8q>lr-;6L%ATAFyDUYrD!{M^gdHRQqRU>nj4*0% zF}f6?LQDbwcPm8(ix-#CWHCP%LGIjKof|wV@-?NjM$VvcDEhWMmCNy=J39NO?2glI z+K72E9SL@V+Bf+02zNjTpi~1BN9j-__frx=B|xIJ2(Y{XPag7kcN?pJC7)2%ObmE` zU|r5_f~eN_VN{PNGm#=QqLH<94VuSl(?MxK7*#gh)JSC*VG~P-V6d+6QoBM@%b=PJ za3(ZN7hw~Yi5yntLmmz)+uxDyNZclEw9@OKA!2Z|MrIc6c)%Dz7}IRY#Bwn;A67In z)KFQBPJTdqj%2DXmxyRr5qUSl8^6&tn@%oL*U%)G3GOm69UK%}RrI0l1>5?z;k zf_QyqOh0}$kE{pK0?)o-KuI~SX9CILgGOd zmi7jd(~V%o+DiyVF`xLQ4q8z%WoJ&2Qr83WU&tVgBs*3o(#Ay!OZvmrExEVTf>T#C z7@M>LBzcxp;Mk0xDkmJm|E|6`+=?E=tt0kjJo#Lo_( zuviT=T|``-lcWMKYX0~gCk`&EyJzQmm2=3_s@V1*%EZ7T3=utx6tkt7Ea`)%&v1BH z6YMhS;&uAq-u*8gBn>yhAo&4wI;%sQ)v$DAD-ki=$zPK}qR;p^+P^q;?%~#9XAOv} z2S-GeQqITJuJ=|6(3YbjS%hM*aQS#X` zFtAl)-uV*T@r0n7jT}{1moo`oxZLY&cLVfPE!RVDs5KPCs$W^5_7%zGN5`6X38#)| zTp3uEOSBzP$<%bdJC&MJynGARbn6SaG4WzOcJ+M4S~@+{xsE{B&=+t^(iyZ|(YZ!i z(K)9il53=&PKnKta2VK++Os_@Y{fuygqtYT53XnTK(^Am(_)33oX>N7a%ZLz!L}AD z*coGSr+9NaL5y|*aQYH%(-vP;iIwd`^i0?wpV%B~8bL}_ma!A77u%ZN`i&SrV=uq} z7qP=Dk?GgH=8l9m6H0?ZTIu?Gs9?p&mEyR1dn6$fkZ{WSfYfd3&~O=!izl0Y`MC1i z(RU5Ge>tyoOi5_6j!k-viF<ei5G4&q0kOX*w?r(~im+kr5l>H{Q<%R}3Zk7A&1#d}60x~7w$p@1x|{r0 z4M8f)%YL-)xE#K<5}2w_#>dbgP3&I6@+}@Bv}{n?%zQ(bfYb>K41l7X`Q{p1B`-qa z*-E6E(j87&y{VS zB~JHFBk7AaeDkoP4Y&2V!^(bJ*AJLT2oK2?dSIAqd-o$iOukbkMHF3vQA)Y6fsx8MX&DDXl(^W`?A<_rl1NfvIS~d1CIY2s;KgG6w#3-N79HF&liioI4F2Wt zuLuA3yVV(uLQ|@ZAl$+3cdwsR4$OiR*mY*mXdvLoh&IBl`F+>-FRjSFZ1kfSn8yYF z-D%{}UgO0fe{Hm*>whj$%c+OVUdSe(j#I- zeog6Ku=E$kYJAVwif=GZfLu7pc<<#9PRWo%l#X0$CD8CI@4|uMB_2bVdD5IElRk^-r&TL+6$i`xmI~UeE zKHQq;-QGD8bBh^K-3dARsCN;nJ;$31%rogo*0oR_j$z(G25l-obwHAiIUhAEUByR0 zPAna_b5O`J; zsTiwPNXvyH6@2;2tfU+BlOMlVUS&%U+{?{ZU%%Wuc>@2wzQsPN0`lcd7#p;=XyNa4 zOI=;|0hN8Qt*mr5vc#MQBL()>8wc^LDyE4VNDzVk@NSXNz#Wg9BFm(Sb}~fAlseOy zwLv*67Bb0Y#lBbFkAtSYvZY7s^NVI6vPVXirQKpW$5gf`ayl&&3UKXhXq_1Ox~(ly zvaJ(agSQWE48y(k=B-s+c_(AZ%{3!uQ?TOg*lcW-F z1oELfgBAS+!=hLh39_9vVh=kD)O!r}g2}iLF_Hr=LXUqsDzBX0hL>QnO6bO}i%O?Z zg4eXynq1_w11leTZcw`FaG)cKZ^hnnmK3e2K(<8ni$4uWlEMTaP-GDuk=ec6u6>$t@jy>$M*9%G<=;5fr>MDck6l*KI>2bo3FT%7?7qH7?5gy~0N z4(crm=|%Tt_Oi#+0sezi=VdoG6^wJT@hUw9bdl3#K;VfEKYNK5d+M&#)v^1!7+8uO ztI~(Q565*oww@EI(~idhV5|~QD)rdMvypYywHQ!KTi6t}wDaWJP6TJXVHKB2INWvA zI}d{MamH#5R5e?@)IL16+Az=$P!r6!ELxy|J%i}^iMy#)ZpC(6H43fD%CapQ(uVii z_g<~L7lrRcRsCf3nqyA9Ebn#p|Ij|TH*V*VXv0JiX4zsij6p=BL3*Flv9>YQ_Iz~g z)#*hfj#!JtH?2`?+&XQ&dBbNiBO5l=EK$Fv?k`ULaE*dc-K|AKsRcN1-nd&(!dUV! zxmeNf6DIhm?DrWVy4tAUPb_qBoiRK#crjPp(|#W?yA4hCGh3ZJ>xMg6W7N{6&(s77 zn{xhr5WCo7I*lDW6Ra;?K2$1roDGDs z0@mtsyz;mtfMxl=Zf#?uERp_;swWXC%hA4c<#HX4eoN~atD~LGmEY!>yf@qHa!<3DEX_x^akWW=QE{b!Va9(qAPk_^+3<#BPe1fSa_lp&EjfchS3X zbc#2)B6@c^2P!DW=^7`8I1GcIYxo!OYG2MLE2U&%aZ{`%LdD`_ESLJ`BR z(yD}pQCZsQXrkHe9#~(y@Y%V>nUl<^)9u=BmK104(&j7C1cW2ZB0BD5y=V`uSGV`p z?k7+B>H1{sxgc;`oemn3nJ%Rslj}SW+AD1nt!EXB8n5OpYj&@1rmV(9}&UGii&*P?8?fluFC40 zb=^IpjdXK&3#XGz8W};4C@(;OHqt^1^q>(g>(LfR~noXk@LjR0Ag1U7F zXy5|9YxF|r^}Xyt(lev7?%Yn#40qD(eCKj+u6;>q{2q40 zWry$3FJ`Ohc}Gwo7+#|qK)O`z>F1cy&3P5Y$JR^ure9xUn(I#P{pIg|?S1qSMX|_W z4PaBE63{Qd`0~plltGnWd7ZHrxEO;{WA!2y+rI3 zkr9YPDtKqs@#(Zl+HuD+jdRzf>p94RDP>CFZHu$bcyH)JkaK;|w71+?4C}Uc%ig7$ zINzK^XZ8lAK|$=kg@5lNUQoh47~Up7V%%%V3rtL$KU2#1cXBNcJob$kzTzO+#t#~e zMiAhb1O`di(t0(w46<#j9M+&x!_O8A7$Q6LOn|f=H1r8ifzX8owC@@QbBY1X;iNNp zo80DBG5|702@4hmFcch#7Xz?zW1j&KGJN&sUCUDbmF`n1H^t4IWPedY%2!7{Qennm z_!1d%UO2L-!%%>qSQejHKlJ_1j^kX|HsJ7`K3ZlssqYx{;^U^T#l+H^pVhzOL$^MG zR~0UU7_q46#X?d_2?q-$YunTbcY%zyfKT`vSN0H>+p>hfu4eCC1u~+Pal@e!oh%@Y zkARmgm4R?0UOqOp?C3xGMMR}5BLRK_h`u4?Bu=XQ>ho@8m+UQpy8ek#*3#XxDsgfm zfS+`4(_}Fm?){!9_>=CfVifKTmGq+qn)4@JSa=09fEJRe@{@-+m?E;4BQ^ zertihWejikBLTVP2d`UaXUf1#_ejfRZnt%RTCGZH4ZUace1+MaF+nqezQX8(c=d+Y zr)@{SVNgZg!JX5rn=D6jNCyc*(v6QwJtIKGfcY3J90Fa^^6VX~ z^Ne|9-wM{&?~HDjXw9+yXY$`dZ!J)P@yXcHiYO~tmoC!Vd8d{HH(#oe^ zkK&X^N5{v~Q#ONyzT$_wR{i-&Sq%MpmS^jZ%-$Hqe40h;N>)XQ6=wSB+Gq9{aPRF~ zjsob{w1jo`tO5=1*7S>j>pN+7+pG849RwlzH!rx{%o-nOcLdMjeIJ z-%Yc%*waV=;b%iHet8fJO`G7c=n+Ibo6j#G*#7ng%xO4LDSIs8)snVqm{ViQr{FY`NyZIGntRT_rhGgvf{oETJ8f2L1oUDTj<^d? zgr#y@OFc+fF@)vHeK`6deQ?M7AS9wS4HZiW)Wjo2+^lY>g&L-4^(v!caZete8n!va zdwm?Mp4uWX^#)2#gJW87@b|7&(x5$I=gAui?L1{O zTD0|2_SLqwgk%^&%ficOHiPYvV=!{Nb*+x0guRP%0~Ja-<3%DyLaVtnT6T?StXDZ^ zG8A>kd3uqoCQCbCYk5oxW5K6Hc*Y+((UV4Xn~=;Vun)8MMw-lNf_11G$`k;NBErco zE~wbD4Q+qajQbCJ2N*`I(oFAPuB@$7VJS&rHV9>bv!8s4D^yKPwIaA7QB{IC7 ziIuvm2yoi#bXh45uvs!3x`9#Ks0%_&Hby`kx(hx$B}=}lf^92LS|_S385-~CqLem_ z?aelH&lrkV!}&p#kH1%WmPCiq@tv)?u=~!jl@7v(aVI*KImxEul;V&8nm{TIV2*(F zCmH#$Z9vl^l-m0n(4vGtwGg!hd*|NXjkouE zZ|^U?yr_S4jZWBp#-jn5y+Z%iB@ zL(r-(-^NoMm3VCZK1JIQJ!~6_@8tyg>Ysf2o8Nx%^;cvh`sYsB@h9D3v$O@+IdChy<4uC>d>kmDnJbwc6DS zU)HrrV(US-5@o33RQ z0SQ*FPBiSO8WxCtezTesp~=ENByUrcc#h%UAmm>m1xCX^T8p3FH5|Y12TS)Fb&h-8 zNp{9I0s!~A2&Yqi6XfeNb;hah+`Lr}V>)$H3k4v4+uTvsyqC)}_lzXLN%AF1*46W~ zq2WoZ`n_rNr~*P+YrXpX#3wTtOkRpUUqoDrzSzp+^A}zM#QG*-?;cdT0ktQ5U8(PA zue0enMJb()UPDDWqAAe&=Px49vaDZO#3U!yW-^)qkp?R`urF080N7B**Otv>HqCMr zi8x`m=dHZz#J86eJjL>l(Ir*>Wjd}RCBN_W?`Q$epqQ+L^mMv2B!@D5uX8WamFM2` zeX!oh2ytI3+?+CUn*4A*sp8I`zlf_TwzALfzi+4S8a7+4AjbE1KRP-7pw3hispMGTfMP z6K=RWF28a%U6nsC(Rwk*$_*d;iN6U?Lev2B?vMN@`iUG6FENlUoV^1$B=4O+Y@uz| zUgYgX$^=jFOSM>!q$|f7)xac=Ni1rb7$#K>5o?Ts-@WCSeltg31ewtwfuk|jiUyJ` zvbt;*HL_U3wklD_-GolnS*y6^W9zA@O*{OEk?ScYo3tm_cHcD8dE2|3%trJfU5>jL z{Kwcn+7yZGk#P$}xELi`n~%`|W_WZsIbr(Ys76ohalM$$n(OwhnTkA{Hk19Z+aDZs z!fxD4J5k)?NtIzUEqSMh5=-r^_usV~>Bra_nKEx%UNTJf-#*b=^k31-Ve`1b) zGUa7;tpjOwyXz+~f|{jITV72Z$($C-^+VMHYZ&vk3iE{T+O&9W{*WvFfd3(j2&{02 zL$V18v5|eoj6*Fp=lUS*2)sj%a$t+RBysw9(d^?QWQ%8zfRPGvpi2qChhVqfO`1$8 zGc1$`3Xx?-pv-9PCtfpd+3Z&n`}s`XL#<3WC1JhDh7Eh8@SPODGvOf7C@Va%rHMOj z&2APNpE@1H#w=d8I@+LcdH_2>#J{O=yrE@iuX!_{q;wx{GpzCLc%m+3Y1`lD7+PGe z<~XD~ER&;}#0?Sn-e z3?0Tg4IFFsqO$r=95t74*Q#-adSW8%V(5XIu`$48tbA|yhGV9?QU6mKK0J&ji=|&* zsjEM7J%6eUk#JSblX0pX?)0Em98D{twb#&Y<*X|Lu39uqjhf7!c|Gr;xBkHcaE~gV z4xtkdy}04*%&>M6N?Js+DKZZbSdhgI8iI%uJR)AAw0|n?L2x)LPtUV)n(KhRSeQ7% z`@1s|y09{41_X26CQEfTR8J@x;^^f1Y{(()NE?9;4XBhmkq=LJ&6ig7Mad zuus@>LPneNLuebCzi%JbH#DpXovUn%fAz@1%?7l~PJ1C(ER*F{enI>*yL9HHwJg!S2Ua?9g{$?0;M%Qo~hrr+oqqRPW7 zn`k~lZ}zBFq$PR0Ga1Mj_jjCWdu8u7hqc*Ekew!!XqwpR_IWcLx_M243DMXacINPA z#stsf_py0@TlKzY-oGPPoNHR>4I>m5DFEbeI9aye4J#RZp<~0!iBXY;FuWH>uZq;R zXIbXR<|^!gq9f%UWTE@JV4t$ z^lTcXxb^d%drptcuwtliz1MibivSb<5>v^5`Y=liAiuyH130q4234_u3M#IZvE3~H z$auf#(rD;ic?&r2?l?y;qL#hMZz{{`UJOU2Osz_@zmXhXD6zpv5-%bnO1xhRDL1I3}C-Kql??=o0w8hrjyaT?K2pS+?})(hX8n@`Ilk7;s%01DsY>dFc)HiX&Yl?EYKfVg2qlPXj#=L)V#%VRG2 zA{7GK9box}(ARquA3Gvhlq#HFpPk7BtlNa~TFt-{`Z~RC+-D{XQ;`Z7KPR7B((EAC zW%qjPH2u<^Cbkl-9BtcYQL-#Zn$yo;;KAz~b>J$W4&h9s1)bU4I3u1(HI}#I(GHn(<++1bOu1wemT=xX0!-z zlf@KTGozGl@`bK@{mLUxWnRcvfA#z~U!lV?wH|gk9BU^YiDRm!z<=KCc3M9dGX*sq z*bD;j%nga^`jK>9V}*HYsg78TWbomJr(yschFaH}0{X5{AKy;MFtbghito z?G>e>UeQV#4lP^b=C33r2}V1hSbP{)#C!Ja85MrPk(uyzJbmot*V%k-<3q(E-=jZ$ z`jqmkG{_*itOJ~;Z-Kzqw`zA5y%&eIcgFRbF2Je^n&={{W8W9Yx_WqbW(m4YA_P=4 z##-~ZkndU!6A7K$q4y^%ocD0cflgRUaUZb;$Vkf!c3pE8aYp2tRzPu(oEwNF62@0| z#EF2>1IQb@ZU-!4xRW;sc5Q(HDeJD7y;oIVq+=YdB&v9Uvx0Zf&dO5{Yu7`G8=E-m zz>Ik->g1(Y_|Qs~h19YlqE=}>ZGqJiQe8Ywn`V`h(5MIRR<$r6=AvA-Z;=vU6)U~^ zYYs#kneA{GMVmni+cJmKQnELkJ#Sfwpaur*SKiK8HJ+PmKAM)bHDXF2-Do!<>r0hK zAozDRJ6A`GQEIM{;R`vbiH_1e6%@wbUVi=?AL`hFjyx4jBa)5PI1XMVbBqe3=AzEF zaF@;+Bd$V|8aH&ldVlghq{DOc#5)N|z>7+vI)FM|yv9C00Swj4!=CCQHLh(fVObBPApw8_D~-S|rdprSCF`Sa}ll zE036bd!q^gntFY{8mVV6j{DG@sMit<_?cB752=|rNx%HXMm|xCe5kO;wl72Nv^^~~ z1`YRdI2@x9J&D(x3`emkOS{R1C@{A*6&|^FE#BCvQ?HA`G4vc8)lNJpF-166xqQ(| zIZLi_bj4v;R8IstJ0ni;wK@Ls+2EymscnPi5*RzPA)o&lj;!c>S?oc+@Xgljbho+^E!F`rozuC17Aez*`RLTX`@X~B55 zn62O}m3D8@=S&S7D@{zlo;o?a>>kqQrEu_2H!r5G0&-wiEA&9S;*7|4-|fLOpHUB_ z7tafx!G!YA;957)^RsE5!A2Kc1TCG0N~X_i24ssJv?#m{BAU-AbOp9!wz|X|7JS8n z{DN+`1%I~0DQ7=6e#0$89L-=n3sg)2olSsioLzXj&bN4dX)xwWrt2b-Z>}&{A1^!! zzQb{f+*kz#Ufg0PH%cv|v-G@c+gBM$QYF$-IegC3C5P>@&Wu~76ghJik1mFgy(aZn zQREXluYsmMTieV5xdH_in5>tKh?USZ+LjiY-r@3~4{h(_PQP;aqr9$Sk@mtPN%KIiIHItJzz%DEPi!s0Q~h_Ww@CS1C~l zaxrw}?d~GTq~}#m2Fgf6v1*#y3S2c-8nrGIN^U{3BkS5^H66ilU6;&9DlJ1Sdko7= ziVonI6QaxegwY93XSOkqY_C=x!jj=gyv1-t?_S?nVM>h9&yG9egk8hAVpJTd9iyxv zqWpX%OEBzq9Nty(;0o(xyp}>TDk2(KLchcg-%l%2b)Jnu6JNU^Y^$z88wf zK342?n!Xi#V;kW&-ODl5G*e0I&knhc_0rh@{}Aua>UV(DHeq>xA)4~%s`exXN3eWn-_TEnvlOE<;4U#x*R(Mr|86aMtvk$zfqD^OEj=z0vJtT zFw}JF0f7bX&nD+SjMYS(!%7I&6Iot)M)aMMcrJ2yBJUDh8;v5bo~9&ZlZ^;;PvY%x8FLYzccQ|n*{yxw)$m- z{{Pm`|428rlh5!Wr$>5(@IVySj=;-*lI=Wio+AG_8*qMM%72l}r-b#sWqraZ!Xd zwU{l<0`_Sj;;f$`*<%+EKy3Wp@+=0*1pWhaDFd zi~ieOc^eNfZ6d<9t$X%#1l;?SG9SFc`uKAE9m?@Wmd`HDAF#{9EJ=~RXk42`i`k}GL*Dhj$B zLw?&Mpw~2B*{ZzgJS!9q-lv;c-yEYh+)nU7n3lg^-P!x2&;eU>m9ApYMFU zMOEufeyP7J1FC9*!m?AHOI;~nk)UQehPg`39@+61i;6*x;-x_2is0onx<>4Zw$LZ) z$!Z znA49^(T&pa>;|h_&Q`DuokytF_#OKKk+$=F-0R=nRn*xmRH_hgvSj^|+>Y=)Dj;<5 zZt@xWoxTm?k%N(Zlf5D59*(-X>CVN8K(u4q;<~nR%{Z$&HSjh?ae{JPx^3)memU#< z3B&MK&Emb9Pnw_Vmcy&aw3;*zN?(YCx0)|)?IxD%uEhkNT*0lIi~=Sg2m!E{Fm86BdX}w(*(6)4~VU_lzc;!=BGkYZI!T(;hN99hJfGv@5 zHoI%-lR-vN_3?g!rclk`w%aRnZot4+X=S(CR?zZ)X&{3}Xqu4ySjT_FvC z?cvjw`w`3ZlCG(+Rd^!;fKWbA_stJS>19St{-N?lL{LSKtPv;rMvp}Sp}hA9rIrpK zY2RddMhDtkFF@@%5?)sm>~qD!pEI{qx5j+CGr1g+h?fU^(cN2=*T&`e z0*;iU*DRh3ax9~C(~P!!-&9@&fW)N;j}WnzU*Qwi=WJ;PmjaMA_$q4StW#uw+u6!B z%`r*{hv={?WKzg$S?hX=rd>5g@)iqtF3Vpy2X)CP@2junw)BMXW*8@2?FF0IiyBz7 zZPdtovW71mbs(8*=?;u{nn=1aHkcKqwU$weSgal)A@2N$SvY@ z*RR_0oOQe_|E^-+o2&tdipoY2Mw`#pOXk@{#o^Zdkvn1B|4MIDZJoGwS|c~h3SHUk z#}qay=vQrOO@#@AJNe370n>?i=sKKD9S!X+G^>nu9Kwa+6%o$AN+*+d6J#J ztKiqxkM=a97zB=j!1Xs1$-_f!V?(ig%beIc;OKkmoloo)76?D|2>*dk?iJViziZnE z`TDAz#cXCnL20Ku3$r7H{3#Fin~wAMYN{o${rS%MHK+S~bwot^-H!d0cq;S&-}fTp z`i;@TygtpP ziv`{`H!*d##H3eIQQ<4yZ&QHMG4T#Jv;trJ+CDl^0FhXZF6_sdLt`h&D4i(h2r|EJ zaOKUD6A%05O`<2L_IUhw5@bG-nB0#kAJDyL%OU@Dkx({0hvcs7M| zGabiyHal!)Kq9jmi`*Ik$8sN}=rvo8EQQZ8l2is7sDz2T`zM-g((q0RYSkKaY|?p8hLNRRNQ#}w0h zg&?vd$;3YD2??@88xCb|H^PKxF1XK7pl15cRqf>o$LCIz*$vbO53xS=G<4uc20qsC zBMUxOAz|5lprMpIXJ-v#6@+u|`ixrfhudC1_0Qw5xKmY~>fPn(&3&4Sy z^F-wqpbZ{_9h!K49Q074_Z2h?$w{By4FqyX-Og+x%(1uUVnJ<~Tg!t%<^{XjgZ+XLEKoEYz(r zgsDvaFpD*^8{IZ;(J#J~{SLj;Xr$N#S_jjD5&XrM@&a&hJ(k_1s@Rwos&&BbZiUb) zLSZeH&Q+#i1_H)JvaX^q!`^baT2pC0PUfj54Kj}tEp(~Ch85M_uL-v?)ksxoqeH1Zj+e1pq^7h;t+8;I*=YCi+>Za1-LG(;scfw@iNe4&&aRP zfR}b>boWv=w{hD$a6+oGo=GStJ8yCvT8>d!ewWcZ!!j@l404lT9FV~<)e0Q?W~TJM zd|Q80(E!|pF$gYg3M5XXYn3y66g+}|+gce@(4^{C#&*=X>f*f(#e1rgs@=V|Hvp`< z>DhFOk^TzfO$~>!C~^6GQ)9TjH6u<@2DkQy+q@Y?uO+H)yzf9x$FWv0&cu!_tR5~} zExWdGBZ{6yT0|R$BF@>1mgvhNCOs(|=eoavp!-&>CT;zBz&7x>thD%6O%7IizXKh^ zLn0Q}RaxDf*U}tj6ad0uIA0fy*Z*|e2}v8op=R@Cb|XRqv8?3^yU6%uO-`O%4J5ACjiV*R%F zAko6OQX8O`zP*o|8%qIfmM$(8_DMRu1pKIPzL?D3`gU@Xav?;VPAPU9M~d)U(iokw zuL>*of&9iFB$P2BG>+q9qOl*eDs#5t#l<3>dl>2hvj`fU5ap|U`ZPAi!&X{EyiQq5 zdU9nSyqYc@zigvyYN~*F48ni+y}6Qu_`#mn4A)2D!#T-%p{*FqX5D;w4ifO=w~GwJ z=`{Vel)~hXFXIqK&-+!&cjK6;{GNI+D(|B&pzLszF$0o;KArLeJocy}$25lO4QQNW zQb;o{C(b?3=gX6qr_-~2U-_`0;|3jaSPv^_V#kG8SLdjOLdy3 ziaH@_-ngIqNba5V@Z;^{Vm5&aR^z41jQNenugK)iX2x=nMk(K#&B%ND)PoLt9n=fJ zu=nZ+!`El0)2UBMZprZ84qY^Am1M5ZmPsk3W~%CSjUh(?ejpl~bk z_dYf3!!@arX7U{k7<@CJrZYHg#Yw{Wozxp=g0L>q_+G81G60B>f_++juV^84n)>P+ zz+D?`<8M{)5Yz0d)n%HUZ)-C`d2kq?F0+d)U2JYN2KM#GSIMHT&5atCJ4x3Wg_w{S zP-f^g)7_or7Q1Z4G@Ie@WYc`P^Hd=)t}q?1r@r%KHt+Bwc%McypThwEeZYi@5`=1!S#!!monH-oo5K~!SrCV|@< zzy_WV-35f#e_odFyWxka;ws)CBnRBOhUPS+OLkNsnJyL0Y3i`Dii?k@4C4E+?YCuI zjch$NZaQ?oHhqI}U4v=BHqRoIWPFFl8<=-;;&;1UzkPPrwhMFE*Z^LUayRj=Gro71 z_}`eQ5QEJ{@sVAuNmuF%3{=M2jPqH_cC^`aJXxKmUYe2pFSg)(wn9^;?^d&AY9mqB z!+b~AHJ#GiC(S0Zo@TFanhngRIYlyrM!f{;{R{YTh*7iPdks{y6I8qtRBtD!emxZQ z#q0O2g;PghFaVXN2)muVtlT)1r<<6*K7-N4-1lJu*;WQ1xxr-m=E?ZF>3@MG1ynNw zi}PmhP;K`B&j?8=hJY;h3f2Hv6N?K}FJrZejnodcJ?6a9Y2Dao=j;Cwk9}4#(%*-z zZsCii5q%(+|DIYBAH~?`fC>^yu`$ z+$53Flf1J|Ig@lM;a7WXKOv?-91acBTTA)ibb9Ka2B)W#Civu}(eQ)Qv$K}I^0Lnn z{%LYLg8HYY3ux0Dl-ytLjqU$FqR<~5N~4GYh@b!V#TQ?&Ck`@hT9J}1A15Puk&NsYP=ucYNZ~o00lCC!6q;ATX^8(NlUcy!!T`^_^q4>4E7RdH z3h^l{Z2Z#+dm-QU!GlgO6tm^4be){1L+LyViKYA6@^ldT3tyXB%|@^ z={wIm#klL~#btoB0uSLMrkQEg0ONlO6z!H>I0du>5`4peuyW9_!Uj7zIi13c$}c#f zoDo9n349+^7Fm4HB8zg7QtP3Bpua~Eczy5iU*q(=s z^;5!Hjk&)8bHoD(A3ihK0rzKs^H^}>zt0X8{^~jg8|sKdRY~u&LM=yt{m9fpHT}Y_ zsk*j<4Yl<{UESelR(+b-pbB7pM}4wX|)OIi!RL1x^K@YCW+W z_LviwYtV543ZdCn@HCxWJPUO4T90D1l5#XqwjsOd6sH*Hq}w6gDz?Y)MmB0WIia<> z_R%2*cmjTCm0zp3#h07j3^dL`2`N0&FU#*1y5yqb<%V}%^{!ifceJOm9_{Uw-#`Cc zy~a<4x0kByW%*U@o31LfN6m3x9)sKn$S4bZX?Oohj1D(f;Sb(6(qT1FB@3%hW{WjF*wP6pG#`=DIRF5~Z5=6#_q z{9aM?uDWQUWL2d#CEbF%mUEk`8Y%%U&a+G4YT|2%=I{Acs@AYIQ~t^DMDMu77W`KE z?QrAU>X!j;+%<1JEd*_bseF5K!mp2y$kR@}$G*NvCfPaWK3F8eyKez` zCmy{1BbN8hJS^XFa*k4E7~|a!jW6ToPdkGBgzqPOKjHiF@c9K*66&T##C?tr!j@vA zuyHzEhjPKgzE19ibbl6b`9S6TOZ2XM`nYOQ=RO+xWOL@YU+8Ac0T;*_h zvP^I0RC_Y@lEo-nE|SG9N0&Q0d*Yo9hi462_mV{D3vJA}u{55tOQnOKxZF?pe!}+; z5#LrWXYm>0Eg!l8jh_(ygzzVXKOy`H;ZF$v<3V_KR}gFuP=9m!t~+d)y)Rynyh+UEcXoQXD+ zXt!f7t5B&X_Xk({CCeK_mkL>VT5t5^NaIVaZc9AA#=5py#ulj(tf{cdzi`2 znKe=qI?rwjT$mA`=Bzw-)l;h@~qXn`-0kMLv0F}1@+IBbK|d`Y44$RMpb!K8+0a*~6M%q! z`0L~hK=Ctu8V==Oq38x+3+Gm>-w!W5lb=$LGv5oj7C~wd~?hUHNwE3FJ`NS1cCv!PTm|UkRe*O`gBorg1^p~n*2L?4?7jc z94p>wLq%S5ETn@Gz=lJ%U@awk7_0aa+A{VPTJ0(_Mhh@)84FmO<8BxBzG){ax(?`I zFu9ZQq5F1`%$+R0hy_h_o2vN? zElg=(D7ES=#~9-Lz3I=FuYU0x@^vY_7{Oz)_EqY*85`U;{a(Azw^F@spH1ZDl@AYm zdC{sW3CswJcwD*@)ux_%fZ?|Q85Qoj+nbacm+mv2k$3_IOBiMBX?hMc=QXEoFI~?a^GC~u zNR0)FNYmmScC|qeqLVqZt7`h;I_>z%U`Sopmq6wn6ybgST%3nWpb?)^S~bA`F=f0h z+5h8Aeo*WGZT9~M2Zz0|X#d|2`#;(L{}?|-`+q(CKfwB*xq%LsO-ntUzR4D|DM{Vi zGr&slNf5(R%D|@H%M-uh1}Tjmm*ZHXI42s2CpvW)iElb7RKz+B3cOS<-%=4?zh7~? zdWj2b5Vb+5uEE8OF-32vCYqQuJy%PnequV5Ts_26G0{te8l1NeFf|Bm3_G5m{6hze|l31fg#kjeKoZle+a zWFsD!CY|I*t>VZair~9|p5W(^Js2E)*Ex`=-I2q9m1FhxTyF+wtQEFn1QVztgFaDV zr{&cXZ0j&;$9le#{b)EGwVp`W`DA}I9QGR80D!}BA{%4I-ny zW=73NngAbPvyl}!@98L!)~tar2NkJ&J!qeQzTz-!#Aks)K}E!#YFyDx#E|pzY?{FrFkJ?R(El72V)A=f)^m^H?Jmjxtj$ z0~J1@*C^u_Lx7pS8-L^H>=fz_d_f49&1i+)Ecu=jubBdL5Y%12S$3b(l7pwT?w_+b zjUm{SoYf2-27;zbmE!kpquchLgRpn^q*3l^88Bu*O`y+V4-Q*T*2CvT8S^=w0jQyC zg0VX-PwZ3*5)5vI{C}8Bt#v-t=#Mo%@N-iF#n)Im7vc^L|86B>!GI4fqgqaBDojA%U7j$XV<+hQq!S zZNl1|mW@sX$^$<8Of2uJNRXj>nh-*_~T^rCF)>2(e z?>wF8)bjWGv6Cbr5)^$*RB&$5TVDLssJ12z9{i@;2JOtdrB>!iYw%DCtsQHpwruL#tn#hJ>)+Ag)(TeY6r8P=mL-KsB!&2#TvE^-Cz}*Z zqkRsS=?H$w(xVk)#!t6_t^zALR$Cvg6T0l}H!X z^qO%fEZ%S1oQck{o{|hXA|OS04O-aSy92Yi^GenGd(5f9Oze8ZYi7rzmJS^W&Th2D z0k%ySN1)4=R~S;CPd~7vrp3Xuvc+?ncTRtfvFoM=k75)sLwMRqbwn&NYf)-2vag9- zU6dJ!9C3>)s1=G7qXQ0eAMH*SCPq}wNH+s}rf$s?DdjV5K{ywKdyco=l=XHRsjt~u zT*VfY&OFX8x0a+{X=j<;q?TBUp#hf^Qt&PQqVz*B?m1<}z$4t3tHc|0`<=zOho_sA zBNhUJi&c(EPVssnUA|4pj)ba!)7Bfm26&)=1v7m{AtDJ|4od3OCR!+j{}iDvCIs1_gP zM5P&=;n3y_`gqf(JVSJ^ju}j|aklhil}uSBDtXmD(7<{38#z+aaHy%NhqC^yM{%&0 zvxTh+rtDVhpt!9S)gPW~1?gA>$ury}aV^`}&6vymnJqW!r*A8tt}CD3Rz7`KcuI;5 zN=@0c6&mpNnp-4%P3#KL-WF$zX@CbF2Ic;wVu%IVWUjI#0_ZZyCMs&E&TdjI-I`sy z?ft%HFRRy<*EUIKj68Z?oLK+jMD@K-7-grM*$tIZ77y zZlq?*rk$2FVXbYY<{(zyE8sx#8hvL;t-c z+@0$!&64Kr>)d{~_t<1i17bbTxZfKHMcB?}YH4X|1r;K15maV5NN<$1M8!t=}?W5^dz?YdZ$2+l1&(+lFF&m*eg1qjXVGL~{ElX!AR0 zGw&oSURCfeC=KLo?LfZ!p=~Nk({{D*DykLIkHfII%s~Dt2Hu^`+9mq07=$$$MphCx zN3H&Gs2jZnEJj=();yeYml+XACgH3yD7gby|puPviajrk&5WK$& zv8O-`!nhiv?Ck}Nk_h!>^ zT13i?MKMLVMc<&Q%0j)FgYdh)lDymnzavxOt#kWYX;{2DhczGt(Jg%*YWO^kNM$F$>p3_3Q2=DBnhhyVTEsDD{eRc-PHCY%9)wYSQ8qqpl zWLR2^=2KPD<_GL2*Rqk$p}TnahksWyOf!uw4onC$bvLQ47f7dr7V!v4w{#m-o^{$R zx?Q*r8Ejn7rC4r>$ro1cvbkS`lk_E>+n_^xg&z5~hvJ4#-M*{6^_9nK>DteY#MZc(}F}{1$Ah~VBhOk>8J&m0!Hh!kA-PZazpIj!{w9SfO zad`TEvmE}A1rmqxwn+>9swMp+6IT>QI}?{$>sH@(q&Lka!l?Bj39yu!rh+%voIzUt zgK5o5zp48m7ryJzugQ=`b{uT!*jz>+blYutu%w^>5BQ;FgNQFgc2>=fDDMp%c4GLT z1SX5&DU-{R?$Nu-F0ZuK8}FA$3}V89-HzF7==}#hG+X zKv}T7f^oyM{#(4+WEE(kfe4^7^xD<88BMtZrDjo0S6=hRQLQ`MEu~1cv8(NN$0ayx zc{8>owUzkgJ4kcW)Q7Mw-%DN$co5EmWhi`zf6?#3Mk>O{Z zcX&flgFVLQv$yU5Rvi3m`i;gjyT}9psKzH$2XDR;7Iydy&NmRLk^D0k%s&3DwfAGeYNiCoA!#0CQ+r$!@-N@ALjn^{hhD`VFPw&)zpb3shB#tb&1X9&5c@uYG5cYpK|8O zz0vI4vJYS*mVr9!q|+P|!9u0kl-#XFCZ1h*FTOCDVpVLO^E97lBt4oYw!PpsUy+9S9s6D4BN~d`NwFmNp`Wc?pa@L+Es+wtCDvXZf`IhuJd5CeU)BV71rVkA7Egt zN{4|5#B^zFhNo~)vLYHL$9tUMadiWB;#E+koALEugk3Y35i z*@+Zb)YaXsBNy2Q*p-fY$ztmo7@M9q@nx&fDO8Nhc6qR*Puot{%1x-W-em}($d%Ib zSIV@1x<+l_h~I}UJ|tO?E5L4aKxXzvaHDJrqJaxgIC!DLMvPV$7b%Z%QIBtRr;vY| zBjtxOZCD8$&1Tm* zZzbAp+gi|ckYdf4^;GZASlVmiGFaN`o|F|gsZ!h!07Wb0h&(mdr$9vh$G*7%)7+`7 z5Xi+4awQY~!aiTwR+}}dFH54RYOtdZEyx4k6XR_WBacCj3g_8%6Mw;ha^c(Tl>8Qf zK46kxG{wCK@yi`t%wHdf?;+0rD!;<;NKt4%!N^o`SS;OBrEk?6rB$Qv=*UejHg^@R zH7kbcX90WJD7`>WV~eiX=bA#Zyx^5+R9&QGOSR$Idlj)sYCwN0az>NKALHkB@qw}r z!wUR6%^P4*tR@&>agmbm0W6qO?QjleUy{2DMcLNHf)?ENa;aJ@+m^~M3#D?M)EQYivrn{5@8m}vSyM|O?+2;YY4E4`s@Q} zk@)mOW8sSAXF0}sezg^-6SNWi+AKb zG#}D%Hq;7kgZq)xPRhV)VvE$xKrw`-Z_FI4OU6YymD#DzPH!ZBG|wq?o5Uo=o60sr zAH)EpvJ>wj+YPQX1n>Oq7-H*M#@xc_{j{D6e(x)YS~}1+lRL41``%xc_e^UvN@H>B zZz~-;x1aJ^nZ?__;d-PLppJ;Zw#72;#izHGPuG5d(Y(i3sCY$ds(udE8T;icyF)JwMcvAalxi-3U6sHNw9^TRp^8FSl;3J zEJ`(c&FsQUrnglV64X<`KRdr|bD6eR*saJ^kHqCUY85FY1RpWhbJ)dGrM+Zl_A{+s2;7RxkRAhQ&N*7*R|}*?VNL`Xw30o;FfZqh_{{A@Hxl? z1lt_x%%7x}L=DH1PG;I$iN?^jUo0b9%GISk+!g*I_cp>Pun)Tg)5i{q$fBhVJi;a` za#F90oGMaUC}ZAd2#`M7yA{vwYKrqq(#x7yMZ<~JV5~ElpOAFYvpslC6>@*|frpM; zTh%HtME{da)h#=tTa3GKxms>Xn>q52O*tC|&6#4ll8e~?nimgz!iAsL&v;#VwF%s3 z58#bGk-ItTqG}g;vT8&r8h|4uY!RHcO9`kLkZ%}2U|&Z7sFVwA8A)&UwCAcLaM{lH zzJd%z2}219j%GP2@CyDEdK;|n6m|oltUgkpQjU%gwKjCm7JDQqy2^w;TQv3fi1Vb@ zp5$2H_$rxRrrcn2DN||q{DbD~2Xt?Jui29U80zStW*Azu)41ZEv!gVs>bFdZar14d zgw$rVHk623`o3CeM2$mD@i;;SjKWWxV34NN<(YlO2mWbTNDS` z_$aew$bT$D-RbbIa^ZOE)Q&8WJ8y`E17KpzZM?+8{dY4#4oGfGNU9}qYf_+^G@k}4l7Jct=crdi5#Iv^8^!kA z1!T4dEL!63W#SU17V4}UYyFAji<%N~se~0ROQ@Ln;J9cTYcW%agQF2>8f&=wTor}k zK4y7Xzooo5B7!FNP#L-lzYm4oQy+=-tWim%tXDSpjD7oU(c!}X`R{-Kds}UNe^Tel zjRP1~VsO=;9>vC5MW(9IJ#oY)JBE`Lrm$!e4b$$z#sxB{iybIKpf*T$L&9`;ObsNy zSVwhtUT@{w2cBOm1{v0HyJda>9Qsi;y+34jO9ZBnQbjJ(+G#F2et&>zHW=0>bjB@< z;*H`YvNY*TNK5U$Oyi&u{u_8prKjG?^N9h2cZ z{W4m8_$RE9Pji*`4dmsPEi*mNq%v)bI!5i1F&m~gEG{-)nk6jiz0h2IucnUD+1YX< zSh)(B(+SOboGN0w3X3~oA-vJRjp$C3xT#qQPDZus+SMEFc5EK72TjjB=)3xF<>A89 zO2Um}y7xWE@%xdVB0O0l>COB;Y7>fDSj1;Ra1~VRBgK=T47((o}GGi+6*FiHntN z@M`yZD=amSMlxQ^@?1QlMQOJ1pcWb=%ZKUSgX9cJ$*=E+wwv@p(oA1R#FiLwv@GhZ zI4H?zHnt)NTG1D$tDD(e@18~fIDDf5h8jrqN$q0#h5%PUsJ{h&Z1IG54~!9L;v(yN zKKx+;w4l<)6&!NY`R>`Chl3cHf&hAf6y-CEna2N z*hb-^FPAaoTgr?_kK9d^j)07tVbrolA#Nmbg+2!s)y<&o@*dbJ`_xl!z$0g8Mc7(( z?}t@Q>2xaFB(2(q*SckwGoWc`1BFL4^XfFwzDf1G$Bza4@#A8{535?9>U=DcolvE3 z9<(n=&gTieYwVo1u$cc3{TM%N_P=fU|9ZVJJ}Bn@3;VsF^8fu9KM%B1i%LZ$xv@Ru zYIF{z%-lJFf9R`|8cCZyXgP=&`pU+lU{=3x-YVeheKq$O?yvXKIYjcz?Nyw+m zIM`ttB0oc?{|dIM*;~xcDrSTxP9X*tKJO$Gbic^ZgJ}+};FO`VcIntkZjIU~bc~42dvARIoh2zRRS~e>e}#nwJg4{ zP?7~}AUW`aUa05 zDPn|&Mooi51aB~gI{M={fUU=Z-_!}C$u0qe1z#vzg32b4$pCf<=YkvW8c~t)7KPG7 z#!b$J=!i983C-1*<*N~nS0`foHp*&mcSHA=8q7)Nh)9(HcF94P0Egf0VDUoW0$Wa7 zwy8APG*I+0M<%Q4rs-l`lQ7j0W{{NC%T!ZHw1P=gKs3QW(84z66JEAj6}$SfJov?C z{pNRHdCj>tZbKSVBY|T%$6O*S^uY@Jzz}S=3tuHIVaaVvnrV=h*L+?>j$h4w1I&d5 z;6HJr%J2NW+>4)idpQp&60bQ8<|!KmU^I%E7r@KH9b%z(l>}o=HJuGC%3%SMtPZ)B z8_xI5!vwR`3~(Fiya{yP>Xa*R5PU1s_8vF{v}cwK(x2 zF!d?3?sL2%K^Baq8;T?OzSRg2` zgDpB;f=o|~naic)tC{CBPLMWFr~EO7PrmmD577#~BBt z=&YrXcD&A24d%`jqg7a~Tw~T@O!)wP$?1T3fSOVn+DO5acjw9Ss%7K)@^{Z){rdSg ze<|&ozM&^yeD%dQL;Y^JrWS4)$+g=^RruALbV1?#H&pOy@Txz&y=Q&5<@#PwPwM(U zR-LbD$qTM~wO;MiU4W};!L}~HFnvzOW4rF1`VD2u6(e>K>wuHs)d7IO8YgxFWEQZg zT&pxP-&T)?|Lt%&fndQf(21Pu=~Bno|}VLgABF~YT2IYQ*e zoZ&scX$I>F-~}eZ;x?^YPt5&Q^%(sen0aMWY8wZI1-xmqUI=BMb>dOoKCYBPL_yu&SxPm;dVnkHV$3$o7ViX_*j%kp__NZL&#paT_Yb~9~84F;XX}NNwBUr=H z92&{OAsv5>q2%oNUiF|TM>(K1m|xrj^$Q!fz0(5yPLgrT$L0$!c=Cjjgh(;!a7k>Q zO@SwY)XYbqEjwm`yjN=LX_Dr+eAY>;CLr7$%k zg(B>eC%%;oy-LUh2>cBvMQhT!U3k)}E%TDf_}Z3`e6s@>Xo{JTdZY9*n@*KycxA00 zZN^|L=7b#Q>|4MCA`~n$*QC~(FV45*$&-=$c2s!nejPn|GInIQ&V=Hh!SQgi%;uPU zC>wzYoH=`k$cbo&FpQt51JV2SFdE$X)`qJfla|_IUVVOor>wK?8mQ~BIzyn;+%}qp z!p_4)_c1h`+2{lbuQQ=v52wTiN1`Y~H+}O^Fzn?;6nq)X$*wiD_0Y9zWAkA4AQmK; zPT2IsOYAQryCY-W2RKb7rPFNE_KbQ-Pkz!e2QTgt4Ei3P_D0@VC{Y$Zzb02Ly|rp} zoI6#?nf?Z@|6Qn;At*jQdX79HUcnuAXf-?GW7bkIYs zfIj6x#}!SXIROk(?QxPxmqkLKYmk(K30H+$3a+St9&rQapeSsTg)#@nu$mc#R%v=W zgd?$!Qq42((Rupj(R4MLu>L}|bDIW&g+U3%bEzuzTlP|9r*-=69FMbEH(#Cug2$|M zr1(XrQ@n7q`?*NJTV;#%l<}MfjHwAj9aoPi6nsT6&nPmH_0`v!W}|3+n~*nXF5F`} z(@*e_Et}@XW&^9oA}1%`e*5j&nQD4X!_3YG2C>nR4RlxxVg zwpoyZvx^H~Z2Qnu5x=&?#vFAu7!yMBJ<~0wsDyI6c%=~+#YQ6KyMaYTAz2JkO;g{_ za;4ix+2^1D(lB7(TG4fy&e8tMhMiV`iWe@~mZ=$%0#19J0ulsyIy3ECq`)`@!PW{@ z<9w<&J@=)=Ut^W>tL2oC(2uGDM@#iro>C81pJ#y_Fw%yUeeB_&!NlU9;)|*K;IIGs zud%9n!fIG?W!}yt2BL~8L&9eEE-hG4@qIXxl68pX_)}a0o{(0ZtOF3ao|zS9Q?3fe zc{z4&CUo+HZ-4*SY!`gjYOLaW7XItsf2#}cKIC#^K*fRaKnq%0ia@t;7=>}_4Z87T z(_xj+q+s4nV}*8klXEN$axfh^q?kmBS^(Fur^r}sqTM6ooh12Eu_%r&g|=+asGWvG ziK#LaB}DO#h_trV=Va$aJUw6TScpxS!Lf``b(h+x3YMUoV&vJdJoR+21?1Bbg9h*K zMwAa!Wp%wr?|Z8Es@X+5QpL8!z6tA4R;L)78M7vu92B9-3R6d18<(@0LGv+g#O6z{ zfhM*QEnXvZB-2}z`c`<#%`J-I{xsi%q;c0e>4j%4yFJjDVtec;cwWLz)1@sbFhZq5t+IVDI`G9i9@^gcMm6aH!=>5V?Gc%Xx(51$$12Lg59ot{o@=7bI$> zJ}?2m!i=!Sn5*nH5U07DHY=M#Vv_7HvV^_1N!<1@Oa_VWo=*?_2FAU7zaEBn?k03Y z?7U*I*lJMSKFj+;G`)VSJ6DZz!o8USYIA7XY5JCjOwUjLp_z0P!ZsH5PM2|9+$c^?9w>_~n7~NvwRAT7 z)2XH2bT{UpL|A}}MxHQ8cz2R1>B60k8#!M}s47VdTv%CZVez)=`Bq1|N=Wf4XNpNyvEQ|KOg9Ea*EJ9Ub&{D!ft8$REM8UvX9;Yx( zF(!*oBwCSo8jAQRw~ik7)gp;E9+Cy?CD1T!78K-{-58_)>)*ZD>-;90olXghb1Oj> z{46k9oI{C_WJ^p8)UWPuxkz~50um|ZUS%RvKv zIi>j^uIZYAlwD6MQ`O^7W$p)#v2J-#7JgJjAr7=rh+=2`$eHNtYrhgeok8ScD7t@+ z3U!*3@Fs+A;i*#@0i z(3u4tbl_miVaCzQ@9zvrxQBLJ> z;AYhF05ekpvi{%z{~R72+aU*E{nhi|d_@;22nR6q{)s2gO@??z_AZ;#C1e|;%VJ!? zWL}L806ltHM5QqO^%uW(F#YxOUsq!SK#yM5Vfy(L_s5A!jirKD@VF>d+7iVG4DP)o z1+1FnMx9p>7Ot@tWH%s@tJUSINpmXoVq^x=*(%(8ur`2{Q7rae&T)g^*7%0U;p~k=f8o`eSde~zSy1` z`^L60P*nF~xquT}(9*+A_T-Dz94}bdOubR^TDnF}Rdb%Xq0DRxO-JAf2)^^hSKo-j zQQxN^D+Vl+bYD&N`f!h=gXodG5rV>q$h-FT}IqFr0Z#5Oj93xgG<3gczCGn=9DqJ;rb~z>QaCerp zMKg_wQ~6 znh}wLrKxI&&|b7la^_!&x85^}A5&>YkL2Ms>9D*fHKA$3R0jxAM~7d+(Equ;(ti5+ zv3|<_pUbNs*Z=b{I_!rf|IfkTC;!hMnbpMN?-y9Uq>kX6#y?_b6GUGGqcMkmumxe^!B~5 zJ7|&eSomf$@}53bh+4`;Tm@6*=2Ey9fNHAxIut=w0dZpiNWk$eU)yLdPo>0A;U?qGnglmS6LRay^k0W~AusgD@=!lM# z^^9XEbVG@NHx#dkE_?A;ZghL+9YEs=q2z5(9yHakx46%_Z*+2nADQL08Jw2eNusRf z?L5VFQ7EuTZN8>@dE1rugh(e+P%!}wpdW>-ysh%ClyJs$*1XV;esa!fbM##kjKg(K zB(wKYBo2zbhB2HRcSU$`5u^O$GZA(llF`F-rUnxY-7&f7bVWx%P*?H+zZU2K&w zyHvpW#?1Fo%TzE*atvTXV+fwVuamY=v@)yD(t%whO|b zz0zG}{^L=vOK}l<9Gx ztg7i`$UU!qK6aklrpL5;Vk@evG~Ad9O9!~Q^rYi^_{_-+vX__7c)Go6X~xv7!N;uv}Va3_JCFHy-ODePZ^U=LN>TH(aHMoZ$JqJ)To`@ zyp!Au08Ha@(h2nw-2|gN<-5n=W_ErN*i)?cN_f%i!CqJBTThrN4}rWd6zjz0a`4P5 z*r_YoOXFUtC_c0+4XcXw(q6f-sRVG@RIr1)3J;7dbEk56yA_4OP)4vz`B0aKUCxx} zO)qJ&B8%r>9CX+DFOA6`L>?(Nhul^t;gOct-Y8 z9deOAv>?JF)`wp41F>MP#JM9SSgdR>D`A$q+Hk<9@y`q45gyuiq>ukpoeOSn?Y;nAbldM9KNJ$v-pM1L)% znz89Jdh{sdEf5#0rpd^A^vIJJ9s3OuIIur_9d%)}u?Q{6Pk~Ev-x;-Zb$2GL$@0o^DDA~!kU&*!vvrk7C;IB(5@%;!X+S}kDglXg;z*E zojy0;!f;D0l zK}FLmvl{4H_VP7%D}yS4%V>j$8a~5*5_9NbjtLLa4avG=cMrms$5_^2(+5hLrBM|3-s(t#^co@8C%&Uiu*O`Z0vqof`b7n4u)B? zmSSeV2*hRoSj2(^;ezZdR*nPWsDV_OV!Z-iz2x=lP6?l^Y9_G_WT-brpt-0UnP}v= zT=v|F1w0B(kwI$|53!Y{?aVY%y|)jQ7YKz8O0i21C2D;tpcQY1OPhAJ4-Sc0k`o%p5FbeAaL84^InTTNS=$_|~vl3;S%v~QgA($Z3l zxRQlGwKt1F5kqZEo~7FjJ?R@}edb?}W_VTlgp}AfoqPnON}ov%1=;5HOVEx;Hh1%9Yho zvF;Lp)lXB^%YI#{zAj)=tl+uG%D9v)=~O|6OxaCZdA~CzPcFXSLCpeIV=jL9xl{|R z6EkQ4j8tk6G=0=zou?Qf0JYDk+gFKfNYCK6Y-qmhv0%DA@7c3DsHOo6U+$fIe}N`A zDsYS|GuSPI?&`J(eQzDftm^sxgB7oNL{o#;RWZ5!Z`f^o)3uE?^^i>t@E{ zh&-ef#Gv$iL|U5rujT^ndNA@xG3{!c;oYe5PWpp{c6aBI+D5%e<|A+$zz*yJq1e z6}MVd_x5qCP^@?YlX9JAMM}GXSaleW-dK|4( zw6Aj2bm3Y1YXyEKg0Y#P*r z;*+xvb2_H0iH6-Ld$~BON1Mq_S2vU&gYQ*yt(U|LRZ)!eTIQiw^%PZ;`gtd^Uxe$# zdUY(7e@XuJdNRGQh12F<6T@4N(yQc6#^Hbl-Cnn6OyHs4iY;3tfU0O65mfuzs$ITa zvESE}5MiTj#15`DIX{Okz!JbP7v6bxnJsxX#H_!WY32vBcI=p681tCv_#8TDTa8ym zVm>F6O9HC!IED8Zqt2K^>&!xyYV#ZyU~nARuVmX1bmOaJp{!y?x62gJD4wG=ppNCY z%5%=+5vZ{XSWTz5N)Rlfno-8?m*zxPP2J3JnZm4SNt4?$NfwvN6}65g{K)Ti?Vu7N z$CLn^5#CYO)$e!e3wER=x8f=VO6NJ0G(?zr30<8~by|l$T-W2bdYG=$g|ZAI>yy01 z-e7r=;HRV-vf`JKYZm*bjNK|q@ccAg9RrqO1MbpKH&nLWrJrK0oee1J-q~`q_Qul0 z$857ei;5DYWZk0`Ikm5drA8ydTb$01h!iV=Q&?_ro)Ȗ{CkWR);P4=r*t8sqKN)kLUQNOJV)!CR0?ltKi-$G!(#%9w z4>~ZU{nkCP@XQp^45EADk(nvr>4o>jGpNKfAUxHG(y+H>faje)eCAQ^4UP`GbtAoD zf(g-Ke-4=Xj450nqWq@L%oY0$u?UIRzyf(*vYEf|nsP?N;N&TW&}#+{0=A52m5??X zQJxG^Kol4Hx&QFtL%&frMnmRsVKY$S=7W|iS=lh*@iBlLZGebQL)zBrA+{i(-RJm+ z0Du(2yKt*j+u3Y-5p1gCi?2TOHUWH-)_UfK#*)!uPGO<;|)l?4KKY7CF5RwFFL@LlBE7MzWueQdorDAGrYQ1hTTCl-_VP} ze7{3&b>`5XEG=?qbLn-&W~2w~xPWH~7X6}_BrSUS?PtHBhXZpKfY!`yClg@U;hgOS zLks9L`ElgD>H`U!7}s*#sXPwBcs-ZXP;^)&x_7YkP#1I|ur=|$ShQG_Lu8ic8LCak zv+2c(^vficsSzs9LHH>Psj8RqH5$nGlnpCE0B9JeCN=DN`M8FsmURq^%~Ly9Ja`n< z95fur&L+@(p^p6{gV>p^?q?!J^FG$`aEld5HZmtvc>27X1gIZoIS5BCv}=WF=qA7J zQx)Gne{MbR|C)_a?P{Yg4Nrid5Gzh{*Qzi4HW`i2(+lxYT6drS;>9PQem38a`#7Ki zC0L^Fe%Bz6LS-ZUX)JzD43%2P=}7+|(WxKl8zKnPPH2?Ys=3hE{lIRgIqd5n%s5zn z9HQo-sFCn-f}pM_-S2s)Q_Aq8N1zK0?%^Fp*ggKV(~~6!pL-#h;zemMa=1tj@%PDTh`3x81H(vu$gBwdK$4p3qHjyrS@pXPa}r| zVIYU6BsUW*eH#S^9=_0PV?rH09U9C-2lddxO{j)0=3xo-FetFtX7nsFAkj0y-;AG? z+x<*q*AGUzx)Hy&+Wl+LO#dbd%mM{-p)NZ?@ZjX#H`vgGWhWaa;TMC3Y@@SBr zJD)eRb3L23%Cgh<_RvejI%MNxe9GP=?sIetkOD>T2QEU|+3I%#$~Ic@oHe>tWuQpE z;wcvB7vVd)l78h2s-?QrpzTFfk4alyYF9TNz{@^*yTk+c9WEt!7b`a?SDn4}U8nex z?&#+kx-QA5z2bFR6$r5uR$fQ_$Z|p<9YcPDH>2hTMD!nRGO#C?!Z0+sdoiHsYh`gS zSH=L>q)g>>F&#I=sy+%|c5aF$^r(Khk;`A}IOI`nHx1Wpo^OjX$_#?H7t~Y?TBLX9 zWjgKXt=J9^isUurDa^ zx<0}(Eg0}-OrP2wvSIm1h22YyCYlCR6yguq_ASNj(w$PBh#=m%c2mAnuC?GzjP_Vr z4r4#Q)duA1HWoO`3iBet81iK^KhV0jPDFP;#(V8`@gWhgdo#V~}#%*!a&+@3 zTP^6R?#Jf#H50!%6=|X26>&p%$cRl@NV(|o?QWQDbp>4u@>SxVTw(DQr2U?+Z1+5M ze`vjT9H0~i*R7)3y-Q(p{WOZ!`E^hwFmY@zmuHE!WN@!ubW}Kw*|eh^j6|6`O2-N2 zj+dJ7(CR4HylNPc! z@VX@-sEPH_8w|4oT<|N+`k-KwHyqZn;dhi9?C*wL_C(iOdP?59@}jfbn~r`Z;tkD| zde27$^Acc7?+fJ_q~pL?mTd;IQ>v;Ks(>x3xKmzDF=$tMZuxiR&W602ESo(?c+t^0 z@KxV=r605JZpDkja|ag{iYp4KWmmjmc1o+Yt8HGaCC;cYQ(fn{d(?V~yn!B#XSsS* zkenori6WJG_Nd>g1VO9{Bqk8KBX8;&?AKu#LxQzLt+r=sa!@3QBedSfPBu;rhAoL4 zuu@g$>7~<}+;#X1!J!n1BpIJ3rT`I079(;R@))$3y3%>>NkmkLH z>P$=c+g>w%D4lP$>;+({QGh$9!1&dnxtCU6%+n#p{)v=^ruf`Fn`xg{G1h@s@yi&t zWbdeVbaW6NsjB$vG2Q{IkIp6~;O6~N)%!#9{!rdGTt9Ua#NaQyahgqv=0Mun9*twz z3Z@K!1qGmA3BV{i4AQBFAtVZE}_CU?*NZgw%J{+YI>J5IX>+~3`J;) zwd?O(W(SHdLYo?PDzlAFO=vP*1_jX0ZlIbwZ-nYpfE7dcv6x*W{MkHW8*E)G39M#q zxmYWuRBM&(09`u>m8~#9ey^{LDti6R_z<+`Zy9-56kF!{QK-|=q1#AFo<<=M-wXeD^E zegyRwI5=grDlu?z&)xwrn^tj0D6dU~Yu>g|@qCPeDw$9e)+>Ujv5vy@K=y9>RD;o- zL>lA5fLD|QA$UVO@vYs?sN7Bj>4LC6=mHEJ3sKtda$FnyRs|m+Xw*HVUt-DGJ*CQO;@8w9HXz?S@q_7cGvY~#zqyw0V2R3*%R2^ zK*jU8%0*Z_mg`D49YJ0n17Q@v-xV0h?|%4$?J$)_re+)*a8z^ND1)Zq!0fFe7gbv z`=_D%pI`IX>Ln?=6InK-$4>Yr8Q#DYCQh79x)MkRO8Z$%rzDE6>G|v?Fu}O_0WnMB z*=iM<=e$*!y|ZL&i8V|y!A=wQTg(k}(e{=zN>8S2E479TAUw?M1p?Mn`~wS}K(&B5 znZ4~y(l_bkXFu~ko3Z<&qzfdbo!;nKoLxxkaZ0{iC2f@x`~nWNl0TV~@a1WGj`x9w z%Jov(6|N7H!>}JFgQOSt#>eLe+7XeHFQeX{D$7;Lx3k4H(^oHcf=p`?xU$!su7Ks5 zD}%q{tA;Qve}U&?0h( zLy`k%d0Wpb9OnDVR0E9%029!hAag=;VftQ*)}`?&znmrdw_m$UA6GS+CGhHABomEi zJX=kvG4JoBygb3CON~nZ02{Eb4SLIfCmD(vp|b#1m=eLLUkpD67HWy2W=zo0H|In_ zKs5+x-O*LJ&J9KTCIQYx<+eKuhL4DE;zF8Vfv-uI8|Jw*(K31I+vcQ;#hj zG!#@BXIIRdLbVLY_!%?c%Cu;U9}3xz+75>n&|oE__$nj5j!(~(mWb+zU&8Aa)$)vw zQ<7haoV#)=3{v99qCb(@#;0(4z&S5IL5DaAv<-3}=S;>(WC&JJy?BLbv%l@jpf_}M zQskRBdQqFLx%7o2jb5mpw#?RZIfHHs6*TPp1-ut28aL4*NXQz5dz!5Djt={S-MU9+ zkRS0Wt9o^)p(gWlk>Z+q#k4hkY&^PUT8gYfk-OfM1>L zf!w%vaaNm?!|EZrw!^5d=GyY9ma(nepd!}V4+~4)e7`5ZQLdF6*-e3cs4{==xkq?k z4pCh1rl@gPp0RP3TIgD@ zw8A_)2#PBm2SW#}r^i3iQdi?!Ug?G|f6Rr>^*YwE&x(wj&3}=K7H?FtMU@x~j^N0fpA_aI^ptFA z<>o{zbPteA9$;ZPPG(W*ONseO8|AggKI_Plp@tTOj3Bn~WO*jC3dLuC%Z<>qsX&I* z1pQcbh5sreY(XtAu|gnZXvV(yv3i=B6ngr^`}&vGa-g}IUF#>Qwytt7o`5oE*F=tdAvfpHnR%>Y?Nv}R+Y?t)^4e1twDx0B!>!%NCQ0diRsub_g3akB znciBdESORVnahX7I)r({bi?A1j^CT~Wf{$j%gEsJ)W}%ZYFfUa*G5rES3%j-eSN>h zRUm#j*m5S>qi_#(6lz^9QZs}$&tzVSXOt;$?y!5b3y)N}qU82@EzxFX-UV#_9DS0~ zvfD7$>|;Yv9GD|Fm}8XcXI|fF6qb7mub{64tm=8@Q5k%;`(BT<9-1|w7qa_6uNw5} z&`Vq`w@&0fA#W7BL|iQ4Vs|d6E8aLafTqpGFpdL#Y^b<(V7<3w}xbz1g$?;c1v}&&o`G1 zio1H9die?%I{SiPn#;*-N!gw9dBR{b-Vt)ul5+?ksDy> zmeLa=gbO^ZYt%Zb9mVN{#>4RDT1}p3?^5Fj>ehgRz^Vq>=4417ka0m)j-ry0t!KmJ z?+OXyb^8r=mfyYy@hcA7z3|C;7{y`>im+=pAnY{>qBQVt_~S!Q2Tx)N!r(+yZSQs% zlX0n@x@^+&>^5>f!wV3S(f|-r;RfY&z(*?IZ%w;#4B7FoO<%kT;|I2R$(>^#mwBYaK1wY z*F}^##ZEk}ZH6X>p9gG0*7|4tPOKLY*Gv8#>d!ESR36 zf5Wux29}<(@gFg^`J)&FF&5&c6uy4mvhK%k<_?!~nWNVP20BgP-<4%&(DtsNA>VYr zTcwLz=w4Ih*G49NO;Vn85bE=Tsca8nk?(+ZjYdGisMnVPD4s5sTVy_ zCJjsrS35BWRwzxlI4)TvC0#@lW)D?}ZiYl``3pBE7X&45F?X(3|OMui;s%Nku@nmG7 zF3#&4@C8ZG?N%cV9i*YcTY(g1>4PFkHB7G#s4d!?f#4$x-pKU|0QQ(SVbwpF{^|=0vne(ds*;qZlSFRUOduRj_pB_ZckfPE^f-=unqU73NJ; zjW$TQEgLx&&fCf2vcapmH)xnZmb00MlBIJb22gAlJTn{yo`F>7a+s>Xm+bnmxICHe zN7l*FLV~S@mo0^BaoJsO0Thq>O6JWY>P|BB3cY(=mf4cCAP&zrwDV5V=_PCzv}cf~ zt%R3BtI%YsGpDeZ2VV8y9$3)|;v5G>(zIkO+VW8~$h#;_&OyJfFo?;jEEa~dVNQAw zvx~|2The(#gU@zTq+d4MH7XtezbSmui|zH$KQiBBvty&?JWUqkE579mG=% zk^#0p+}wJ%>V$3?cCH+~Ve2a=X+muGkPrZXZgAin$66*{=sD)ua;5&3J7yTQuR(;; z>71F}-B#(48S_+a_N)lXCYpdAu$sVljXZb{udAN5y-hE6cv}skk5>)^$SZV`4E6(k zW}VK61X;b7v`6hREgX=H^fxH3vQ@8_-YQQ^N)*<#2a+ix1`t~XM5S@6(fG|g9^>trmVpqTR2l^oclTly%&ZF%+i$@B~l*V_4ji&N{c zA2y0N#T)U8W=E#o$aJQx*kYme)#okyf_^yMScBFnAeUl;JXEW#v?#7_-*5tlLsFLd z^u=e3HTsMlp?2wankb;}^6aco-1s)pAASoM_^Xp}0^g|8+}=Vy3Mp#dVYTp$l9>4T zOiKyduwu#edhN56q%?l(wSvTVEm8DIRNU+I7SD(Ql1SkAE?N-2Qf{-x^bT)}I0DxU zmT^Fn$11-dlP^;==!Kn2-61)sN6EQ<0l2A1YZF8!AWHSVkLq=2_YK<=&BPxj0Yb8==Ho@Xu>-*_26tp&RCPJIjE&{>teM=b6M1#mqU)fn%%Sy$D-Z91k zr=}B+P`Zfm1g)ShC$kZr)I`**5X>r;3)D9~8@{mw&S_P%^{Ph^1dh91R4kQ$=>SKneSYzGQ&^=YahxB$L->=xmqPi478aTHaAkk z0X>FpE3fOA;~p4i|c7o57L zy8&Cw8l=SAVcdQ~y&kv#8@Ak&4vA8+dZE@J4au&aYEL3D2T8HWSZm|9BqJnG7MwI9#7_+z@jwb@mLdV z8<;5N?6sMorCtCG!uJ-}d|@Gxa9hSJUfW3G|pAv&r#dYkVM#CC)VO_L|EcGQ$ zksYf8Z~W3ZhUks+SWen2i&Q9TbZ}30OeIGPA{O1!J6c7pv(MGX_$#4%@oS@@kPL%(+i+_VD#lb>B%6 zn86k%$g^2DU!G^Q4;+_^ke6J#I8T-d!@s}dYqk23Ra@d+VIO#6-!M=JO1u*L(|Y_}&=bkZkUxznc;>(1EjGE}Ps7+k@&@Uqmq7V3F< z&s0NDv1u1d$-%%Db?8V~=ig5|`r7;a1+L?BIJ=^$H?C)2e8WboOHP;B?;5Z8@ytVO zHbt~}SKKt2BjrZ5+-t-9@kiu^NQnYVt)rOWwM_aZo2_zci}yA~`!{Z#E^lA=UPqQ4 zq;lIuX*)4M{-_0)NQ*n~UylZ4}vxQ9#g&(`1BguK!&DQ3k zLVcK@^IG)Wtzzd*8--x_$4t#FX2EX0u`k9_`$m7Mq=%(m18Nq|&%GRVis-g7O{QaD zrzjc-4U(cv82?f)8v0@{n}pIc(XxThg4*S>Zh?_iVB|CM9wG0QV8=e$?-J}-Auq7~ z<%uCoog+IU7a3-A7E!a6=Ak~gk7pLi7VoFzyDti0`3h8;oU3suT7Gsc8+n;PZCcHN zA=E;!*c$TNMMAn=cG`V=HJd0RuDrb`We-c~CEGog9I`1srki+-ofx+04$gi@mk=Q^ z;o?JvuLLJE%W{c+HTZ*MKccCwc*lWCP5bGJ$X0vk=YH%LB0FsDacFwH9ryv>9mk~- z47W&cK;XhlH=XBj3q-sP!c7}i1rcwB=x>D>Y=sb$j7pHL061(0$lQIwQ69F)&LJ=E zWa{5FkXDgY)r5AZW-%lTDzHk&;FNz-g8-FKh(fOAHlmB_n`0NR9s`9rs=ypth<8Is zz=ATg>AF#|*eaK2#LKg0aW?AbGb)}=oVW4Dx0^8&5%7=%V+?I{9^94s19Cj3vnV~s zlo!>wDH1TA8pm59&bLA&TOqc#gSuHU&4wb?C@4cmILP1C;UvCOMqK1nT!7h{r3c01 zoZTZo?P|m;xoK6Xnq5rY2fdSx2q* zb^A@L>|pf7<0w`N0Qz8>wv_c$6hXD`8=IQ(nF;j(WWTn&qJTzAc1EHbtMsjOZaQE z(2FN7tdY2SkyH^d9CqK=>^85+02Q_qtU+$`3T%tVgu33R-z)pb`+%FKdQE7!pVDLf zw6CA`&%~MqnDyC)J7;oEa=nu>GV4RNi&3K5no+)hBt?td&=@65(&j|bMs&9diHD6N zne+3ur_gaJir~;5nRxf)heRarBVUD0HT4}Qu22I63LvlmLTw6I1tVA4PmE!t?e>Ix z91U)Vw81{n(pIaYoU%9ETC`HFEV1#jsrD}e#8w2^q+wtG=qO0ojLvcw&kQ-0ZfI}QUm^3xE&u1-U6J5SBYeq27|6C@LNGjmRWCMJF+mnR4%=Tyr>?dY11 zn_j3WLA9c$)J#R-e{p#^RM8^l+9%6~NV~J}9#Dppb6d0$>!zf{FmN{Ca$u%#`?=xCN^BTW& z);`Wsbx$eQ{D%6h5;Zk9jOwXyW~D`!DnE8ENB-2d#aC8d1eExI#@G>CtfFOgiOiK;llhx+}VA9W-G3No0xR%IDYKsy)YYPdN4 ze$S6On;<(1J^cygL1h7(s&}s-a0A|2MVSq6`5xyzEc@9%zj^YE|!5a z5BVYzKiyed4N(yXZQ^Xk4V(55+FmtQ`)%^GiEZp|K?vq>_`vE6Cwhal^G zKx~{qo%iMf#-eGF;}uFF(+xW;dJ>SU*t}>}Vop0q6W&q|bfen2wnRm^zog0?_Z=8bSq5TnT3^d=Oz+Fg7R4@ z@j~VyLpzadKdyIVnav`N)sDDQTSMA)y=}5KX^eCQjz%mYg&2>Vtqogi#UnI;qMe7L z466$mvx&G)9w0)Ap)t2@32{%IHFZE$3fo}n;kS_vhB2GMQ}mmq zOGX+!Gw)bWWNX6lL40QML443Vv#;-|pF@uM$BTvi!oL2czcmEiPd|UgpJM#K`OOCn z{YO8WO|F1Xbhd;&t`!RkB@&9=Ge?aKJd9nnSLKo}fD|ql{jQVF}lV+L zLhCKM--`b<3|h(_oKF{ab7Q z*wntc{~uTN|AJ=d`Ileg^z2O@24Z>(^VPCpzMQ>MK#2zWau(Q_e9t?bo-Q8#1^xzt zTd&qDdNjrQ_b&0jeQ5)}D>NfvdNt^iB*0~4Ll6;lAAYn2WTbFZzD-6C6OF*_=BNZP zDnO`K?%PeMYUKV$RS*=;z_fEeXw|$*M*E5N(r(;-ZR0*7h_0@=^6j2}{ZV!4u6|$9 za0dG5ql$)q#3S=jq1jSG&xrM|FjqB$gb z8_KM1ym5lTSKu`GF{|;Y*vq{fOG>$qOOu&=Ts0+sgRlNZz4{yX-DtvZM;}i#1Uz$k z;8j5triLaxNj`@Esu%a!+1cNWxEE(}vf`SXF58RRFSKUMO~^9=2R> zZ6k3;TBMvCq2Ln5$T=d~Yo3IiN?LKUIdr=_!m3n8*0~TMugOVV8pygVx&jt5e!zL6S?!~%% zpkV^1{E&Z$Zkj_Z6R8EEUe#~r3Pd9~8J;N=>ESDx4G9WH(+liiWy81y&EVuT4#UoA z9EE2AhwUN*2~&Wf3~vI#X?&huTwZ0buO~Ot+59^=-K^fcUEjWQq$FK#?_5gihkNHq zXSE`XRV7qKoumTc%e}uUp?h12=xlFKF(dp?u4vEj+fMSX0%Gsw-pO7k**n|oj5OrQ z*-LvbQowtEU1-&51fx0_R5h(z4Z6nzV)$HX;*@}jo8RrbUlKRjd%NHIrIP&$b6}N; z2YpWpoIlhBYDHkEL9jmru2lpsOW;<4eJoIU#POSdGnp~7Z2k=+1zK~QW!m03oczr? z6!ibS*&1Fpo6T+u{(I##QGNEZljU`}@MC@|Mb!G9l^d!;}_rpCrqx5X>ABnW{s z_6G-tN5{ezo86CF%~q?RGO*#Sc37>Dlc%}da!h@l!6POR{0HdPf8f*Jf52aBCH5dS z*ry7o6i&>)hkqUx@j!HDwTbi`Uj-7SZ;{iKgBb@1Di538P7D4JGQAlHl%PAG ztwxmis|G9KqhBCI!C1j>!j|t-LtUJ-k)gY!NBrmCc;`M%Qem52(u}mYRX;Za68t>q zb`x204m5)PTq5v{ghm z@C-Z}jmO&x?bDwS1RT9r;JfN^_?y4|w|ssfwaCBw_eyg7+kea7Dhm+_;;)5(FE#*v zR0J$X{E^gI%|W-TY<{;&mJ4S0 z%{`>iy%v6vGOPJKU6ja_kbLs>7r#|V{_*dgfAgEKTYjrLF&yll61T27MaMsJ1Eg@1 zZ4)@nov`6z1`_^q)|S7+MDJWf_>Id7+o@1n>hM>eca!1JmvZd74$l;xp`WM`vNYmJ zd(KFgsE%Gb5nK}aU4=oI=oe**LoJ1MxS5!!?aH{7Et2`ag0QT){an74NFh-{tZ=H5X1BTvP zho%%EF;ZVhhHV^tuEKX{%%=+Z5yz6~IW4UkubKw$+pBfAcB_~V6)3-dmsC`fstC7> zbUsPOoROO&tnYz1NwzwBtpew>`rIa#N4F2~>pk1G-L)#K7$@^3=2>C;r@g({?80SK zKD^!yO<0GfxfjwBPIg2T)gy{FB3k8?b0^r_3pRI&wgcr3{wkkcER}vp9Qj6>iqMtY zZhM9eQxHYeg!agiqE!+GiJ2v&DSg=em~>U{EqWE$$b~DzbOcqy4NezzG4xnf^T;RA zR#nlPk$&Sgif{d$fs-IKb_$2_YLRDeFj+dR2pDe!%nhesq;FgnUu5ZUXhQX&!#l?9 zJZc$D)te@K?RG_lRj?@)jg#NdV(AqLz6}A?ORO zx1s<1IeeH5eP2*Ke?Ifz-%cpH1suP;KN1?$k6YZDiJ+PdIU8RQ*;Z`aB8(Cm+}^^k zckkW>cS@&p3*TgP8p_n!u_;`VAz_tyWnPqgNx(uulCAfu4^-H)k$07;Z3j=4OPMGX zpy1_Se&M(5ghzNp;xmzzm?D(a5~X8PKorFX@W76t%vP5Bl&5EyIfe+s;eoRcA?mkf z)b)Fj6%Dd-`?0M(zvr&08rW;21IF=PP5-?n-V(39)ykWLQ0gt127siH`HN4vH6Ts| zfF(y}v>MByZ$cy0vQ_2liouC`UerfZM$~^{`nVzG{)yvZ+!N*GJ|1R=c%a44syQ%B z>SiXR2#EUYYiUch_3_f4-Ru1bTl!`{r1=%MPDhE;vlRmwCNoE=9Y{T0AW|W*s+4@! zRoxBIj?bN!k zkXVe_(Lde02)yP$y;z_LaJtBA^txzn;^F@ueW2mWjy_1PMJAxt%*FaieIADpK>)tvJ)-ZB|UmjJp5(d})<;Q^Ah z!t%)(>lGEAFzPCpZVeh8MV3*hTNM{iR{`yWdFavcjbX~d&szcr^Vs9Dr*ZPcZtYkSjA>}j0s0n?_VtUu8;}7a8 zVtEzD$QYxmWGUDAxLk3CxLap++{9~l>r{F4Bv^L=T2n-aDlwa|=6q2y^(Cv}8+9CzI+`HEV%JwwfXVW!RG;Z!#5D{_ z%KEIPtd%POPZHy zhNsbKO!plpr+9OIrc71%P3@IxsbpxCES2JgH2R3v-AAY4$6I*B_%uu}E@?HKhQ*~{ zYzYHnd(zX03sLKIbIjZN?u=30b{a~R)*yrx-Ki)-}ZTD6ICq^BisVn$LayX5dmt$c@l;?yjoQ*icy6*c5uVP{WMZd2o(a z!;DejC9`pYanhgYs=8*xt&o&enx%V9#Q(^qU@a41kAAn?-97;|L&tN;>y|tgVDK@_ zg>|V(1L$mYg#rF!{Qw((yJqn9FHx4*-T$ZP|Aj$vKePwfX8*4kzC;E8uYMHve)9kN zF@6gEUuydA?E&WLuyf5hdFIS6T5eQQzXZuX{k{@?`K#v!CRQ(RlJyrA(NuIS74y=H zrSj+UJhQI_-YziFhRJrWqa*mmh@2R>kP~k9^>Kg#0ko6$R43x*G{JmbfDM5ag_1V> z33d2F&&s>&Dhwrl1H5m0R_Yv&So zeFD$V9P}Ck^`jFP5%nB21R_s*wTRHa{JvL zuHTC8&jS{kxD8}$r=mU-ibeIs#9YtBdq~=5g5F2Ey%-~p$7nb#!8I{0-kr|kUQ@!h zbdk_T&B%ND)a$_!vcnl`_=jX=J3BMQ-<(ozwB{;bVLp4a{L17sx@iHxa;ok%5Yd8JbHu~d{rK&xofDwQnfA}^uQS$-HvzYuT+wVAj<71>vH zICBnW9@)}X$%Zri?i;jY^F}5lOGU!O>MXZjO_2?GbiGC)dY~C1($wmFHOvru>}rp@ zBfQ0`-X;r*1@qlE6j&(2?9Wm{-BQ`0Y?6Ta7ADCY#nMPjHwtx{pgdeFaUQD@dT+s5 zb>X}$XC}QnPX>w5qZD7lyiBrj2BbThQL0-NPS>g!qsCKaJkzX11vZD-ONz}Yl%(ct z7)mAp6%v64Xap2l7)(wS)U(jNzq3j}C(&42Wi)gY?KP7ZVbkeWztDlWSkEp9L&B*L zTA?SXc}>*e!3Vphtpg+R^PG{fCzH&>YMX8dV8-zoF7U9##_EMS)h-#U)SvdQX>Xdn zy9$F_Raos`6jqPpMXHvabU3*$;_e(PteqpqSvd}7S1WF5=6hVg zZz*j3fi+A3SJNi}h{EvB-tLX)rCX=FkFi{xf?I}*QS1Jfo4O0?nw&NGvpsK(ii6g+ z%2;U>XkWN9g4)RKN}>tBSDZ5aWdvVvo5Fuq60!CmY#)T}!?1l6wvUnfN|#2ZF8O{< zr>J!`Eia}UvgnS@a!T64yt#MY-aE(pE_ThOv=I%huPi2vP{++4^?qcDA}SAt-|S(( zTFrhtg2QZc(2hXrZ636vUf8lM6m#gRd&y_-yQA8A_<}cKy#^H@;(L+4n6Kcj3cJ=V z=PyN!dE0x9*?~CN30lWwxPOkvX^w$}5f=(Zi^Xcbv^GM{pgrY5FYo_^jrr$A+e=A^ zTDQGhI||)=mIJxK@7Q{{g@m_~G9rbi*De)rp$SzIQ;b|c;XXB6Y&v{rH#y%hF$w9z zQXM_nnH5gT0Uxn6WkjQP4#ggv>mKs>uq}!n!Dgg54M)Z|S!d{NXrFwd(lN+^Wv+s8 zc{>CCE6@jJIF|1zo_4GwA0uq94ri#?mX2sTRU#6mTiQ@VWFIM_>e58URfp?>Tx#hJ zNN(S;NXHqv-OEY$zekzM7Ggj{k8^ZY6x5Uu-?LP#sA2a~W?s>LOyUu$0|V;0eLh3v z5_g=BQ+Z?4GTv~A>qM^g=mR=SVpdKo`(V=MwW&ft_@w2lHBv$yp2p%cmxDqNbyC z%eaJ?Ec8{@^KQk3MlaEU%vwnAC9mS0`?WnNJ!l`?*?vIM{)F(sQ4I$awdmFzWcyYR z?E2{~1=w%!p$>=tfh0(d3W2scludFnh5Z(OccQbF6V!o(djB6KWcBq~N|)`wO32jp z`Fz3OaK-umXf@?O6MDBIdx+nrbLD*De?2BcpRZ49{=<|*3g zz?M11W>Ms2?Dqo{%_&4PDdu&U3QL_O%9ES|fH)~NWxL?oI1c_KPxTo%V?lRn42|=X z42CB^Aq(T2#tI+FTWlh=kfVrfFQTKMii!iu!?}t6MCxxlHlNx(`!iAxeT$uM7AaZZ zdxh^pSyuU;(3(l1n%$&0Ohj!{zUHPq7$k>9Y8DV~=(D^#hHuwRBbq6;fyMACf;9~s zjM2J9Qg4WN>wpor_C?Cxj}7HYQj!f3E%L#=b8j!#*A}R%*z3j@(7bevck+OV8coez zxAewoTEt!v*-eH-GQj&>^k^~OES~+&Gi$(P3}XO0Wf&S+gCLo2IXFs=mN{ zK+BGrFHV&KvsOK2Z5C_yGTBbD9GJKE*OF0LV?1Qd9f}Pvw%BGWsP@pxg=DcvZX2ah zRAWd!A2i_=6H{HM#8-xiO21pN*Do9G*QwnoEVZ3q{XH=7v96w^f7X7h1N=}B zr>A7$A6apK_?h(p-k*jR@M$=zc#D?7f%nX_9=K4Zc(Jr9Wo6Mc$K27Z})cBQe=X1&rz~6Yi$~-Q{0kG zDLBMd&}I>=^%%<@*`!&q5|DvbdOz5$^x>oNAu9z^uYldwZ&pHK%c{T&Si=&2@`$mCpYRjtYf$02UPrCb#|%F&hgetB|;{jjC}Gii)yO!>3FiiO^^VT^H_a=dIcBP zJMnQC;e<027*fOCs@ZMPp7odkIm%t6YVDUiA~Cd(G&?Ldo8Boepvs9Q2s6gg{m|6% z!1rC$4-`Td-vb+qMp9lFquXUF@)m_|Ewl$;qstDp$ zZO2>rnj$`QdOHB^0&~nB+*{#dMduY@G(k1&oF|Wh|I$5{II+Rk3ja3+TtQQIVR%qi zxKwg-8veVLFBz~~fEEEL!P~Z>CMC)Qe93^ z5Fj*4R(6nY=_+lMdhyF%u|yAByBD)d!S{Ax zM=F}9OG@z~xdHPOgLf=vMTYN=GKSJ!tyiVk_f^1=3(SuzOW>&tj&{Ue__)VK_&IH7 zk$dQZVRXP0-}yJ?(!N@1e1bg9&RmDD#3WlIaL-Z%yypgE?s6A z>NWd2pY|B+v$E#elKQVQJ$jlkEM^cLNv#Ts&Iu}0m4sJ0KNF|K+eJZ8GwNQ z5U*X%gw;0VsDIc$>K*g}lx`4|$B$w$AA8MS?2WQzZYOKiwbNtWwGCFsG? zK^PtNc=(3sF6jUnucGyxxcs}Fv@Os3}v zhE^QU(#4nz2qv>+*?Gn#O>2Sx-%#&q?R?4a|6{t*C?6KOdb@ynSZ+RU!0ephJdEoJ_QbXuq>D{cxS7e`? zqJdYEdoO@1rR*4x&(m>saqGRkN|sz2Uv;@~)Bolw71t^WPBbS1T%cdUct*F6={e#~ zVCVX7l}^V5NxXt5h!TxS_83f(Hzi+$n>pW5Cdf!SaPrKifafNePSZu#G8UY!CKC(- z(8LcdUkqdL3unyZu3{TTx89el#Ef8-J2cZJq1p_n8PyK327E5!%LjhAUGEFi8DgE5GG>yEf=p&9X zYFq?Cn8CJS6HzTu`CUBpfFv`0?yaLs!@`1Y%i0 zCD*MMt0LBH+`{s87{!_w|o6ow_EYNe^mV(*ihwj)K^#yEis+(UI+e%KNzg3*N4sS z2o7CJ(NWjH90N$PBmiTF9=rj&U{N-^R1Sdr$OavikB}PY9-57XQF!i)$CZfdz!<$y zequ*%SNY2dh%N|0w%7*ZIswe*jP>0%7@Qp`N5x3kxc z!yNxPCwYv<)uu=atqO`!gwyf$>{(@CN_|3D+kwuWsx#Q3(&9*c=eO&s4z0>-GE$Hh z;~#s?HxB!)a2mmC9H8kNfTE@AtE6-^=*oCWI!l&V085@5bd13h>l>OV^L_e8^EuJ1 z{A1C|N2H-#y@!+bo!>HVOS-bc8%r7HzL{s%ldv0E-$?W`U&TjQzVW7BKz6mdw4ZgH zhc#;iM>2dQB7GA-shC<{C0`X3OK_B%WUw726GM-T2m_LR$5M%taG=Z?a}Hm|qv?b_ z6a9u=Aqe)%B%9{myL2(jt169XZTLF+8Ncz?`b<~LZ#-f$WO`||0chIiY6L3Eb^Eyz ztL(CDNw~Rmw}<6>b>;D!uYxz;)EL&Qo>g1d`&TIjcC2>Gv438@nxcm!RD6~BrD)Pl ze|eB^FqR>;l&bK!qE_S5ZsSd>>$H%ggu%qT%|Kklz)}HM42Q$T>;{nV>myLtdpAb27Pmm|$zps(`U4f3 z1%qTRQ`WXv{2mua6Y;!mk;;``WfxG<%NxL~IUg%=ut7Iu?oX|`v25`*V}z2KQ<798 z;mg;0Z%~}HZd(fWy2r;CuxoY*S;eW5G_EbQ+o2%{BS+Dqlc$nLj>5s33pQKEfuWJe zop$$*?1t~&#NN@yHUipR8cA46_GWYeA>_guAyEdYDF=)z;6Djoj9`X&QA_H^0|Agh z2=pObA71beG(21%iRdPz>GNF&)nSm7?JkP6e>AN!+yDDMZZ{+)EB6# zam|J?ZA-lPZC`T+M?$M?)E8;q83`F%BANP+B4&&p&rjj!%`TQ3z zK2eJ9!C^Gu)NPg1cu_T->W5u?pq%&2i@V{=K~FTXFxRu` z{(!fE9l5CXofi0;&coq)Pk8as1vO315Agjn{=Ts|%>pz)N*#ycVRU>P4`4Dv_`A6* z-R7IZo%@xpq|%-Gtcld2&(NmR9VzuVj(fesIP4u9L8A``N8#ZP#Wm5Eiyv(+j`aJ- zW{2)K5BhSY9v$`j2Z#NBc-T7(j|YS3AR4%6tjik9aH%D#aO+Xv=su8-N&Xwf@&XY) z_Y!aKd0^>|tq9c1@zqtjPQ2!H+Ytx#H3DSrkZ(AfqW8sbzxH0h!|ztvLPEJ!j0~j+ z1L^qXUgzU*eG+w!lg`E2UiV|n>Wv>C&QCh~XCLpK?^D)UXH*rX-Mvi>p6*}Yrx5>y2=RKULkjLQf z=ur>ZJ^qeTjJwjIKh-jFr$2ZU_Yd33aXMxX-Co+ks4X4(d#6;JdRCjdF=bw9rE7D> z2Sq|0i16DGx*tCL_1^x+q4aqN6i6i>#o`u~p^R4r~88A2S zyFPMudsKVNxSuwEmF9VJN#2Zn7l2k>-m_=Vyqnp1c9FRvkQeMF0SCi+lVlT$H}v%B z)6=Q%IHm5;ll^Y|oK)`ImHqJBz4cyqZyh2P?VT5w&L&jdK2J!jMn$0tU1Wv<+NOfD z8x+x#%Nzy+1`US>WNnGYN9uRsRdhW@+^hCX@*s+5zBaV+^_m18Tz`;x5Rnm|=q6RE zaD7lVS~q1n(c!mtq3~M}E9{>QhqS1du>n`8k4^FuZ93e=-NAXW+{Oakm9K5wHk{)g zgi*g6Uf8|aw_8-s5TeU^Q8)b58N2Ay{cyurccKGS?Hn!QMw5OMLlp_-j`_OU|C=uEAr(b{R%VidZJ9NWwRL3NQ){K#;d#<83SxQ1m(zU&?c0<6mG5QCC_W8>q!3jQtL@nh+Ta>MoPtG5!4kI3E#n#5h#|Cw818$n?wL?_qoWHdUI&G@pswKChjrDAW*Wr0-iz&BKc1}BK z<|YIjgDz9?1~C%}U9(k1{-qzpe%q0>lTv{ZX$$LxvuTa!`sS{s0#D#meCT7umb%$$ z`(pmSZCV9TrY6}ADVcQNjG+6?&5-~KBqHE~M)i}kH|X}dG41c10xt0A;&=)4tt~#^&KB2RGG5H`+*l6gj$wci zl69s@FZOy~-=krr)HGz5F_(Kzd#Xwl$W7RRA4*3mPH%5VIm+9pC-E1@x2j zV#&#kQm)iyMeCFPnOQhRZVkPw90Ns9JVy5GvH_sHu$HHwZTesMEL)L@p7XS5#z(V@ za?Y;6I|EXrdjd9>h|7gnup}HQv^1}9k}KMQo-1^ZFsNa9f{-@UGRSJfv( zn@MN#%4vFSHhbNj->U9lL$|zFuU&~iXj^758I8TYu}5j>t41xijUk`2p0Q%o2X!;& ztO@Syd`Fu3wZbm3#>>d}(0Z-sJ+vvljGdrj1yx%EZ!_OB2ikwkKgIY@OZ2$>zzN{C z%PP%#l&w)5SPqv z70F5->6~#^mMKC`+?{PfRk+%(eu4YMfodRvvHQZ%Gk(QaT4jXav#I+wbKa64f&F^o zyvBd8-16Tz0AGILynOAvB>N-h{e|=Xe6~W(p$%~E0Eh{h4KURJlWe)9(oG8E>SwX9 zwFY7!DvGm7b~$yB{A~Sg79Cg$j|ihDnbD+ZS^As2!huvT@UuLo5lm!D!<|)kTmZP2 zDpDZGyl_fI5$`e7Uv(I6peg^7tKK_rQ(`duOBLYRD69~(vZztr%5sm;GkTPj*}r3+k1Yc8zzY%L)6URImJidKE8%Y5lOMrl^d zDqA)weQvEkfbm}S}>W3Ra1aadjUZa!~+{d^;M%0BhE+}nQ{kKQ*3p5 zu55kLY#$nYx_sd(5<)1Q8!Dh;7zsr9O91}v8u1K=XAXBD^} zOCW@1s{*SjV8a>wCUb{uLeO)vSB!d597RzW9*0NaVR#S@!hYDpRKU*UN!wrJ84ik8 z^$Xu|m+ByRR%H97Yl)m#sB(GxVdWa;Txo+U>aFQbM^(D1LlzLHDag=$k;uO}o-G#X zc-g`gut+>S;pLU+3{BF`LaW4YJw~!Zg5ox}iuD!eS!1a~KtolafeoGfqS&f%bDPv4 zsDKCDSNr}_D?cwXyhc|EB(18j>7iYZ9BEG@(FX5=&Wr?>Q$t!n>zMOcEKLZ+UJ!DS z=a3|){nNqe!Rg`Y(dqGN6rM)WX%wGEJ^ydH-bvJs z4))Frj&JRXT?}rYz1f`P>R=IAt?n(#J%kE6$iS`qotod^!OPJo2d6y@!*tMcanKz! zM)ktR$5xm7S&wRb;(*^|c~16)uv`oYo#3~zJyI&!nYy^}&%9y2U_pF;1% zGEDJwJeSCr(ShD;@@a$|+(x8!IL|IIUE~FZC!rbIGy!gHs?9~||21C0HON^g^psv^*s=|e8(tl1Qk73DelYJdI9 zhPM^H+3WP1fnOov<|ScXaVdL_5FDzi*w{4J6%LKACMrv~+IbL2LofirJ$q(9C%2YA z!t=twsCF2dHT!!fDh}f&X!M8J3U1_EY9p=q?S(SC&<>SocwNWVZe&(B_*k%Me=UB; zW{GF^x?b|t1)bWYAdg<{aiI8prK{vIQFMhj+UiJ83c(`A*ZTNKAB*nb#=qS55w8-d zt&c^|aSMs%PF_Uvk6a`jEhnfHsiKV3r#u~`KD$ubH{mGG_KGLcxNmK(PvwbRW^V(3 zX25F_Jd4g0*%PUx;CY9FJgFnK@3EL#^zp!6l7~n4n4A&VuK?XVVs`VuKjZ^~K?u5s zcQrECR1Y0~nrb1hN<1^LPqzX;Gr-SkfvrKE7Kd%xawXKF;B{Uo^z^(`NKrD5-*h(Z zOcS(LFg`qaoBct^!H&*uJ}0bGgI_=LgTkOkJm|+b<^vh?cp!sb9LEbYju(ZYDUPB6 zeYORZ`tJ-yJyrwy%mv+nOl1T0ZF#@A$t9yPNyK4UVtt3ozZ_QuThgm@I~-jPZS_#( zO3Pf#z#iL@GE2w(W7b?o`T#`ng19`zQK%RSdae~qjg1FQVeomxxC+3funhwK&S#r@ zJPSN27Ftcw)jPjRmB!VUFW-$L<$bE6ki%A& zIVWXnve(X_O1sK366xaY?jZD)dE=h6TY%_ORW%GtK)v#z{bzk|e4s`ky)ek=OQ}~> zDH%tLOLDIQXmi`gM}mWrA1E~NCp zZhK>kEx`D^Gh>Y*^slnhaDDr(bdWaheRHDr5t6=+>9E}|(ila6pvVtXLt%QDbvRAi zE$jwPBiS4UircxQI99P4t5?y}k#_~nx$xj{ggcF|lB)LL2t=s>4%*%!45rm3HvF=v zsEDIHYHjbF5(rfIeQ}#{>I5(eo&4 z^dWoH;>V+wSGncr>oUJ$?RrnWEb_7#y&Yn0;Y>QZPs2|dPN{^|Nt$BMK#1J!tJ@?Ud1*B5`fvT>i13xbu)$VE>Oa4lGUl_~A_?pbc0qM#guU^;{lfe9FRQ2n70-QZ zT|vtYk;L+a$fOhVmnPPyycQm;X=Ae|1^8ai8^iAy7C5wFJiw3NqH3$qQR*xU9K27U zIWcXz9IJ;`kpFhJnDDDxzceRM3`?%xQ3-3X22^Z)TRUocJr#$qru|pkg^Cfx9$1Wt zdSb>9dt?Stg*$TAR&nV`m+8T!Fgw36_It2wd5d#~AKCyDj!pS?N< zv2yjtl|#cQVy-COTv5DRMb&fgvv{Y9;ty2O(M}cZICM1?MF*akwh#pz)Yhc|cd9Kq zED7#PGdWGyN-=DyluKe~HMka7zx_57P3`@PdG{%%3XLP*3Pr609I%o7!uEi%KMG3YeqOYIe>V8SRj>{L!O6#lE8DD$n3S-?9g% zSZQ$nw%4s`MMwd5br(tLoJ`&(x4B2>b=^sH?lGG7`W6Fwwi>PUdTzs;{HE6`H9vdU zS4B+or|BhY7qaPjHcm}Qr~0ZpHk-_h5H(kXx&w;CACBU|x`@N->%fV{mAe;u4@f0i zqgbMI2BkALCyjDyc{#+D55KB7)q$MG5fm{=?LT}Y;*$OEA{nQb;~z2qD=<>{T(JKg z#6RVK{ZW39oi9-BCi$mPWvL8if5kz>@#LA^kgw(>%a_XH)QT2~He_0R-)T9gxm1b9aMD#a&QhyQ=#|3Ai0!T&=||Gkrc8^zl1zWJD>qLVn~JPw(V(eH3<1*T4AeOwLd? zqSrt~Xq5pn=u6Uv(J*3CoH+*Y1%#+0`-r_(f@Oev6|uZ5C(#sLbLmEwY)FDUs2rF4 zcDhW~9=2yGrXb9{a~)pUQ_*RH)7AUsNpyCH2FCbtdUh8WJHjOeSkS=!T|wwx;z?+k zpHLi+vvLH&Q^2{mzJsAyVq60ex}gA+1W}q|X;5`kkrNJLsmxf=zA9a(;}x6yT#<2& zSlXcbG>n2#(O3a^0D;8T$=#UfIQKO0vx^JZ@tP9hW8kKktAObAC5d-H;~bEia}K-a z8w|-V9_DC;L6b&@@6s2GPEO0Yphwh0mqVJBMmUV!CF=cERBU9TH4K6kdt;45zhb+U_EeDTXt3Z^SFDqmdc*H@6 z?op;w0>_chw8p8jSZVR-a&={*s?KDVg35%bS2o#myhsIBu4gt!L>2}aV=P1MwW);k z@3cg^pSA;<+jaP;CPWJZ94p zYgG-2T6b+WurR&|Cb%*)4i>UVk;tcFHBXb&=y5CdsCmm`Ps-d}lZi7SbT&2DD)WMN zj!bw?*Pr&#&Oo%n^5S3r*Z+(E?|=25pvVO;9;okr%dw6mSCszg`uH;x%TU2w^UAzd z##+V^(vW6l-W&p?*PiNJmF65o-aU|c5m4V9S_w0>5=4`gy&_uHmNaf@zC>eXhRn2t z54c zrW4h^D%x3UIA?Ci7Orr+K%>W`?pS@BEs*uRBUIO;v5vJi+Uoi?qWp3{q&RBSzejnw z0QmuBiz&v@7%ZEvcvjJWpj7Vf{ty4h|F*K;KWR}}wo$7%opfix@mqk$RA}hk?gNk> z_psECtwkbYDcbkn)9H2oiteoCIqCfDFeyr~1ZmRZ#TJLF5FiWXG1aq9jHBdVhqFEU z*Zc+qP&;I3q`7i&g(=w-qlnbpDx^6F0xKl|)X?EluE9ED-Q zzqg{ur_9`?$Y-B@rfS_#%Mljg7?D;|EUs}&(a*4fRYfs*(#E2Pl2oa(xO(ZH-i?%` zFY`)oLJW=#|1j_2u?b%hq974j0V)bDvJkAJkgArZ$hRHJ=|-12)Qp}!?L{qd!*Jc8 zD6KM6&?1>$nk52A+tyH&oyoS9CFk;jw4&Bzv$WoJT&)E~n#J|Z{>9n0IrXI8!(vAxGjCTub=@?KYz3k(Y5H;~cMI1!)&wzX)kd(&ugf zZa|U0TBK+}?EppG3msGpKW(Yu%XtF z2nr&QDjYq9gRkghj@cL7Ld$)p1m}gl+lJB=ZiM>mQ-QK;a{xZ80$@?#X1=_Y%~I`$ zz61!f;(c%mNp_|oN@AITF8p)`a&i{pfC-^@3Zu+XTs-*vBE~MmhfjDY^$VP#=b^m( zRFAU(!0|sO00Q!uNUa%ZSWXC9HSGD8*Cal9AGUGcDZLSYl+XADC$mkQC#3Jpf%GVYb$0$d*X4ITBIB)>6#oJ$J&(C`y}Pk2UgME$*<0 zJJzUs^_U}tn0UoS8ShaMZKSY9E>fK-+5gx7$$#;$|I`2L|L_0&zfC&*(-4HC|HhZu zSfhk>5FVks%t0T`ZF__M(E)EGeRw*ES-9-=&|Rc=Cu`}qtGP;Fzqs{Y=_dL|Nh@4qrdy-|LuRS&wn@|y%)bY#Foe5 zVfZP3crobFhbTP!1wZ-Z@CAN2i0F6B4?le#lkBJJ`#=3R|I5GoFaIC^8x+go^Z)wq z{)_+l|K;!g_y6pll_=D%{piJu=Y;L}6WlT3!@==q{N(7xCtT4Win$s6{wF=AOPUrV zIkQT{R_C}n5g1~>*=p8bdtlyEqHSA4QlZn(c0BWq_*xFsk$jWmv{=j_Jf#Waf`ftEc6bV#P@(xemfQoKc(;DoJS!It z+1c2cdoS9k=gT#o3-=Nb-_g+qKXj*}#b{{topM#v58g-ZxZS%mw)Ii`kxqT*F!*z z0nh~dL1EBH=W8qB@KhaI)_2Rt7ee(i8n|fHQWOG)HE?kPPtNuq;A=ab%i{|eR`!z@ zT^2lHjdc{MsEN=lY($1JmEuqdJZ&2J2u~&rl~?)c5UrD~3^Lh%*zG;>vSGF#dG3-W zUZ>r69Hw_OTcoNN7C)j^b-A4gq6U^9>FWc22kq$e={~ zlGlrrX4;i6?D^8|2@Yjw12jt?FXet zP^d|bxxCja;bR!Ji`%RvhOCwPpFuJPXt|fW>ysje{m5>JoISM)1(igjSlU0 z`CZG}Vs%;}sivp0cJZbT=k0bJwtHc_AKtZezM%(6nT_{ChmH5cmV-DlrD>l@%+;L@ zh9uh~f5<~qKvi+*)F30^l#Vx)cDEUY%b8ZmEK0~YI7C={*ojoIQIl9@(2cvX!@=ih z?tq3i(3*K4{y~%G2k;Nh^K&>%&yV3BjBR5cAtdgV^9W%h1db3Iotowm!beyj!V)o- zhzU2Ah_OVBC1NZQV~H3`#8@K65|~MM-op|-Y7Um@VTm4==wXQ-mgr%L9+v21i9VL- zV~IZX085~pHSc4IJ_7d<7;l;!u9!saByK0YcG7PrgLZPzP7ck>qjqxKPN3fjbUT4w zC(!96>TB&VPZ^D20_&WTrvQAPl17lL3oL6!IK7qV@sMKVT%172SRNRSc@ zD@4)H0TV-o%Vu!{)Z9uW7cBH2RThEL`9EFUjaA$nw4>8P3()dcg!I+k)=~;225!VAjr;v zn@d?tUJkIx&pBJ8q+lcsGG=^^gPI8Xq02yll0cciks9|7aK~z3ots_C!4uM%kYZ%uOoXb< zQHT=~9^fyWjS#0J#9};qSS(UQ9nmb(G}1icwj9wU(k$XMMzQKh6w}mWl{lXfPH2QP z8sU^iIHys3q=B()kFo_}u^y2O7Q?BHaBicXCL5gM2zY@f$rb|xm#nENCwdX z7CRvN#$reX(ShzD5<`U45Ft54NDmPbM1&L(AxT7sW?f)eB#j7ZBRaxjNEi`PMuemh z9qA4tg+xdq(GjgDEQVAPA(=!-C(*I)Ad*Xj^b#S#M8{YRsUvZCPt!(Y3D z?i0(wVn{DB(o0MhM4Cm!NHj5-6Cu&W$R=W>mv}&|3X2V>gO)lX?so?mthjqXLeZcb z8SYD}8sx~fUJ=zW7*azkVWBiW>#k7>>gyV#e|@AZx0`|cUUvC) zs9w_t;`v5!hfQdHl{l^MQM>zHJM2T#vd7d%E^eU8)T}azH?YoDgL_GCsBrXumCr7g zN_)!*phK@Jt`O~L>=K&X`_o8{gzsPLQ;b>LfCRF@>rG+78DU z&LqM|1@i7P3~r)dB;`Au(v*}x=#)n|J>UHS4bcp!Z%v|s_ShsEfZv%!1M?4oaU`n~ z@c~#pm-;6v%Gbdsxu{(9A&&{Sv(r7jxsU(eL^IHa&X@vUo7{+9qD&K3~ z+xW7pPvG6{@G%VYA9)q*?66Lx`@RH+pAwxqL2`avwTeFipnsqY;Hf*0wnd%7aQ;LY z1jw%S9!~h%+k_*-R9M>AC*3EPmzSvN>T2Q*x4O1cjY?E#|6?s@v#FklEYfpajVyhk zk4hyCam4QpKmmiVehB0ky+LLUJG;T;8DIRO{+t~Df{az^k_se!mTq;i#6)y^%Dcv+ zX1$A#uF=sbKGwSod-FgHg6LgO(2u52A;o9dDadm2CVSS8W~wiLY;a7F?VaGMdd&yl zAo)8?W_>5=0PrLs3J}zZ(;*L6EML-Ym7Oy^FsSacOS#lQ2KM>hqkCU4uufxV!_r_i zcC6W9)dNiVj<`+|^@B|9`)|5+RfHy)G?%*3OPV&r8N2TA#gMF=&Y*s5 zgFpx$(wt|5G({-;N=qs76cU6b1n0fUy_|hm3S6dgY3ZCQm%;s@$#*OK;H!+oQLdMn z6TT!l+vc1^QOtuxL$*_6;#SWfl5Kh-Unz&>8tT%^0Hcg9qKB2Z3c~1Cr4rX+h#xlL zSGo4{q-^OcYa5={nx-{eCf^k`*!4Du>-!NkN|mqC?xS^jSyJ6B)vnXcFVJ92@wk$7 zdp@2{!f^z94!}(o^XXzp@^*WS)=TBDuGm5+ELwx^=lX^pKtn&ZzXy;MJ{sT78?{4)!zsKhrd@(v1q92bq z4OHL;c5;PsEquZ4q#t9rp=2gLtkG}#c@*~1B<>sB*y&+3{32l`LOGaYXm7ON?RQ=r zp3vpkL-=oFqt!x9Y_GQgHG9c;8jnKz1^6(U;8Ue2cyR?xG49pd@#G?ClRJSpN;g_B z+xxFhQJnh=+BekGdH>mPviQ@Vg8FeYs2|>|NR!o|K6rcBf)eN93^0M_MhZ%>NFy{& zCA^97HvrfZEYR3a6Z)&ZG}T|7Q2&T&8+Yc(qDQZn@eY|P3WQ!@uy_b73;{UKuG#-7|Z2m{^_$HAk`urc~|K9m$W^`k1 ztlIw{JNrM*|F@4GHE;L--{bR5Jn4-V{U|5_C2XIUHmrnjaS4=wi5nQUHSSS#U3_2! zWjm*H+@&|$Rl151ksmXL(R`jvEA8qo9&=PxQaa!{X3?8tv3BPq8q(P`eg8r3b3T`1 zbf6sfzo0ti^U=F@yB6TTUq~;r@o>`|X4MX^w#m(hC~Leqe$m-~dq{|4PA9q~$8{cz zF@HG^)ZTq?oxxhkpZ4eB6DK&0&jQ7cweL<8V+tWmGQwht-BT?q$R=R zhTVMA+k6NIy7Op;C|tLBY-(V2`hNfZ{rml&(dTOgKv%KMJdyX=jE>JAcIM-++N@?r zGRXG@Y9-TX(xLfE7u}-Cf^i#;l5RL6w6D(!h#X&Q*7puI$FLUBkfC+r~e8VE&JMiq?Pg_mls2zT3&I|6BR* zcl!KW$$!P{rMX0C$O&5og2Yt-n5QI9Ov4!n0T^avb9H~9&Gn)BcuCLN;7NOVKZD|wGbjfY)8MCb;M75P zF&Mz?Lc8I|FdpIMKWR+AS?~m@syJoAUB;wOm$iUQr}f7_Rn6R~vX!)!{;f8s#nn5N zaWrP%v^$sk∓53(`rp7{H+Cuh)j8ODQOmemvlD08Sf(WZcjra|Rk0A_gQ9bWZlm zVm#$1BH7uazWw>#o405C&)Wxgb{Hbehca&z6*mp<45l&}E4zhcmW6e)fAr!}lR-cq zlG#-qCOGL)S#-8FOGeu8f-u3Tt~mIz|GkOEsu*rmxS8SOI(&tRJA@86Pae?F?hAll zr1`9QG7m@j!Ey&ajHk0aZh65lSJX}oh50aH?uH8BK>Fi`b z_{_b6++F&%IpyylJ<00FS)#J1Z}(dV4pp1vJIH8~LB)k`*a9p>gj*R^@ASfSo+-Ck zQ(_=p-=x#97eP^rt1QB}1M@ON(J(?04zh#b=Z!lR1G&COoun{+cIs4;ALPmww!pTJ z+yo1AV(*x54gI`4c;IXBS}o4cf#vrrquQuZEo`)51JAWs1bQ%wq7{I>a2sC09jQUP zj|Ho;nMY`AOI)_t^_dnKf>pm>_d$^Q8-`iPB7ELKD&VLbKGg)3WnMsxqC-1s(&Mc% z*j)5$l1-d)#pNbacV`|X__wBhP4F)^hr6QM6p24L9VU^UCZbZka|iSFZwIql@WAGN z85r1GJeI>DiHY(vb=zcA@%ThJft(~H%+7$0A7`anX4vQ)W>x4+`P74{U(7Cw%tWjM z(_|cpL;-AVh=IN+2|AIQZI(nk%{tnh=kH#=JUBT${C^Jbu+#6{X+F|^ zl^m0?|I^`L&R#>tojZ?=PzHrt`>odpog*8HPJMIdv5n3l?&>F<{r2Ijqc;afXPq-w zV9VwPxV0f4|4czOg6?}^bVxg!AS4BU{D8y78#{?r^RRbOM`xsiQSwRR#>^J@7Cx1e zo{bLl>hx^C^@EFsN`>ap0^{$U~Q-DM~0dUh+}#{w_5w{_Gu0_C*NuOQ2@g} z(PKFt<`pFz49k;znqb5~ORP_AnGg@S^VwySZOrXtPHAE;3eQ4F|Lil)?Wg#&{QQ42 zD!`@Z|Hil9eG6&1^Z#x9x8LQHKmYeK=l?fs6?3!afA_fG%N)T^4mNB(

(Y_>wOt zj0%9G1!vR((fpV3G^Z*k)*jet^uh);3i&$`TPZq?3)Q4nBAzs}NqDZyq>&hqO-nKf zs13{{fv}KC5g!Y=RJ3NwrjiJfOXL1KiR?M|RSADDXMwIC_d`X=30g)Cp0Sd{MoVHa}L{^}SwP-y=)7t)Oy2dJs!p z4f}5^dv>yaHEN=5rcHix+M{EX03b|&sBjQJ!dl3{u`6Pc8np-oU7fgP5Qlk|W_b`t zqdumi<0GqW=1S+a>E0qjFGs$R54|RKg@I`ZA$R2Ot})h!x_c*LlB`-h9d5w zg)HOW@-{M*2|+jy(PJtcVoCN*pJ2s$u(LhEIFzF&0kF0-93q>+sK^M6I8FH*j#~%| z=M(8^@wsz9ob>~KUAfC}$b{Cw2)k(0re6dF75I8(A{~%oRw0c5pnH7^-;?fAE!_xL zm-kFKlKM>(6iXwkB7#{=qRT1G<>;y^m^HTXT=?mU=%y5cs!LL;i2<2s5tmY`@p5BETKkt-P;4i&= zTT)k1et$vXL**xPKcYh1iMO|j71Bf?U>aFrrSn;DJmmVUE3+<4QR@>FL(h-|4iyMQ z_?v?q^LhyTeTuUxbV@!)7PA>LGBprHxwHWEBB!dV3dmb=dLH#PjaxcAH5lfl0jVQM ziv&}KP1p*Gk|~b5Uh8t4m{Z9j?z_B;T80GmMpeyvMp=c}CKnjvF#s<8F-{h##ZTRi z3Uz(XlF7TtIq>a~Rh-`2qlRT&3i0gw&YJzA`|gZg3Y%5$9ApD%rm7JGt{Me9Ph>8H zn@JCRj0W~P;8e7Bt5hXF0N>m7ov!DG>bi@A;1TIrD+GE>n7rI?x6fXm9KU<@+F(Ha zYpDJaPsnzUJ7cw!lNsr<*Jhg~HQ)r5?_Dy}PpHBsexZ@HF={G|c9;*Ke%GcEE zJUOz6L={NA%Yz3i#j7@ZNxNHo7V8|&p6>I%ilBJoQiB*xQREOlgnKlF7JGYb9l}uxPyU;uS7e2>3^s9!gmNi*}Ttk9VaEjE=qbwfn(OX9p)o zZw}tHULUl6sLERnbA8G8nb!R?_J@?|jqjMYp;6S`jKdk6jKTqGr75sdS6vdSn&?Xg zpyI82jV?Rx$o)Ge1a$<=w;|OHxx7bY_#!rR5qbg#ibs<1MGJht z#GIYDw)yFh0jxU8s_*r;U9yPzE0TUCW?455p6VfkUt3$u^m*#-dDT;D_<`KFZB|fn z?@*u~Mv9{7pw~9UW=rDmU@O8q#=ZKUzS-BfBGG=R*9AwJGrm((!VZsw1zMpl91V^| zzCTdeO1NHcz95qr%yG*iUizdDnDG8L?c;HTkWKB9eDtqB(`%2J*Lqil`tC0o z^_{ywB2b!CmkiVa$xhWLB!@y&NtFoO0_zPd#y~m*=!3G#5T{MNWwG)tlH-~3xLy;J}I5o0jxrQ}pra{U39@*I(4saFv%^N>D;H(Buf_LrX zqgTlLlz6P^-e^CV{;^{iJw=8Ss9IT!kgJF9)i?uCIaR0xIc6YqOQK_{6cXSwFdf*> zWl$g5tvV!ZBva+tNHvsMmsPt{s>F`!kmd&!WC23J)`5X~Z$rS*RfaqYh@EE6Q#Jse zaJ+5|19Yc7(o-i^MLKS^+MrEq#&8EEM`VO3I#N&Iw{+VabQkp8Z%p=1csJ;rbu;kn zqgfHUOY!8s8;HzToYCIXBmh|J1-*qSb(OQ{5N&no@GZs1A}zHp;W$Opn&Z#H33|zR zoJ@p9EyCtewJF+gd8vw|Div38PIFSyl~fbCj)t>%em;(H&r-+8yK1;qZ}Qw{Oe3Pf zR}~*7&KT0E(&560i-9J~yoeUWyiuZq@)WpA6nmEputaZqW#Dh2lx=-AgDzNM4L7^6ihNVJZapObbcif4VjxydeR zZNPTVaJo&0c#8?@P9HsJ6z=-V5xGjM^*HURIj|}r9f*5`v4;w*?tm{a+<;l zk!_2)$CDZWdaxb5M9u9vn=PjaYwgKIrOd_32!*|ejjm9m36X(9D5mYe7Fsr`RWUE@TQBOE3QCS$aDS)wQ%&XQ^Q$! zwOzGtG6+zV;+-cn04H_Uh^Q-xVa>9T9oRqS=3Ex1eKf!v*5*~chw96LI88rA(R6wa z8$@MTbtH<$uIT72VzQ(MtUj#o4SN?c^awb@53gFC!=si1<1Vy7WL6neQLc$oBB{z; zZM)qtrG6Uf)Q#Da3d_A&^0PNqwD}B&5w-)kyy_gcUvPt}d20V|oWfvZ^X?A5V>q=B zQX}~F*C3O8cKojO`rt*gns3I^?MbD%R608Ni@#;_5=!xE=ayWXNiQJ)xgr;3V(Hgk z@28df(`x;G?|!dxf2a9V_19lr4d)zp4sy;qNo3F~32Z(vJT-MltR_wsO-%{PeC2)_ z_93_(w#H~>n~Zni$zc1*1E^2bWnD#$K>v;p=3za+53H-V-TpY%eXMf5Qe_X-3ZNz2wA!h z2-{A>feY$;FhQP@^GwN~CnbGuRDN+AdD{!xp1*QHjKh3AAbLDxB6;uoQByght+D(4{`Q8Yh_t5Q2*z&!+rgdBL`*QwRwm_1 z-%3R8!4J$Ar`QxD`ZtSpW{zptGOv3_SlaYAf_fihZ@Jl z$zyg#>6_<_g?`whPr6P@D3U)ggx91uqlC&iQTq|?Jupc|1vP=B$~m8D_&YlXGsAH{ zM5UP;Sq7AulmN=WKX}3itm(BHmdYM<2o>v;V@-$#@&KTOGms}Rim(PUu~9{XmMi;(m>z<7N9mgj!+7ImQ?@9cvc;+?Ti_XvNO#q| zLCM8On6&N1$07np^QgqrpSP60IVkMU!0FGx+n)hqF{tmQ$zs;CJM#>?@)UD``YuE{ zZ|KEc%~0%uPS#a>06job_r$r^gXUETjx+;pJC}xLVkkd6_O`Y}Q)`#;o zNKNZtBqb3c_*-BKNtIjpLJJ?T=BKySlB~_1m|&Wj?TwtN?TxgGJ@%1fZ-n$%FrtPc z5h{=*mX^Xi8eYuX#hACh9`o#oGD?WiG&e1tUI~G|oBoJq28)lV4phCt=`dnHEH`7M z;BAx^q)5TYAQw|OOyG+>$S~LWnIY87<6{*e)b~CX@hj&M=Cl`7T5#4poD5(^_hNIL z1HRl|gcV4tI)?^JqkB5PIP3>#>!fUlxk=#Ssr*jUOqOuw_3=Ctj zJ=#t|*y#ga&haLf3l&t|E&PV-1b_L@HO9ceLp6>aGYYWt)@{*D3PM;*Ze; zBTu8{JJNQdMhT8Tv3^!YLq^g&8__Y#P*%V>3Wc?tu5~Bm@Rx1aqm4Ve;8`j&CP|_fp8=+joa25;~qxlmBai?nE4HyNorEEuK zwmxWziTVpta*H|^580&8Jcm;>M&RKPO=aNE!(KTc#v-P`VL;kOQZk>@l~m7ILP@*| zH1wzQHY@PUaOCYq$i>U7+=bQ|*c6Y)HB!hbR1_y9J%^NrV}DL>NZkm6&0IxP#M(yN z=TSVP9>DT1$R0#3EhV5Kx?yYKa(^XJuSQ+p z(tG~;tIjkn+iK#*k|M|L7dv*gtJ!3BYUgKEqO=vD5Ta!R!~3hIGqypb-qm;>bHdqZ zfd*$>3|R^-;x#rvzW7j2kSs$Bemaf3B;x0ksp1m^nr5%U&VH1McQ-<7M7)8y0G@#g zJMF^>dGj0Q4iIPNjc8i=~{4haC-Lq z@XRJz#8cm1=-U*0x|K#n)kTDZRMt)!g&tluF+Vp$6!7S(yI!xn;n~v@ib=#fI4&y$ zxa*qBX7*fFgSXd}by{|v-g#2M&I%g9&=8yrA-jC@!s}NpSKMlOGc<22 zax|a8T__d}A{=f)f)b1={H(53DjbIKWOdO`Fej@^K~L5z7){Ti|FdLbyDKc1mQUvq zO?EjcTW`SJiQWzl2SG}Eu-tfJ{W6Vu+497I$e=rSA5>O09(Eb;akq-JB@nwpx-<6u6m=$e(m7lAqCsND@O`9 zq4>jwl+f#^OOzTt%Fksf16nsGVW~B;17v>-T#uGAjQ^KdC0I_jmL)JC1 z+d-^O-<|w;hzsf;ftug~Sm{Z-4sK{!@ejev!A5JWu7%i5;+5YwR(sqd1T#wx@P8#Q zo-(V#S&G?Z5(}H-HKW&v@Gay99-d_b;B~YNh_ljs>@P1TxMI0Fia8gESutD}l8d7U zPC`om(lSGgx2ZjfL}_=- z#%U{q)DFF9qAV^7i-x*ISuxLoELO%4?#pknP`(L^WUTrkP7&vEcNEQjgW)b&>S~Yg z^j@jEh)4Zo8dTIp9Lr2oywH>a1G&8C-w7t*gC6*UBXu}oi!`(-!rK?QX?s8I(M9I* zw1xL>NIb6&&N|0$TgNXBDluR4XPo&UfwA|b_sIvfgN)Enh-_Y7;X8J`ImDz2AUf?; z?NaE^2AKt5pnu*~mucSzRx%=|UO6F^nA*>R{pY9c!=r=4qnF3xBLMr0w)0|N#&54n zl}@LmwTep%-fyDUeANckDJUA$gZtlthzb9&$sAVF{ZyJ27=`2M8#I_P8bDGk#QV=% zN}rH{e81jkrU+L4e?Kj;`=cz2fl1mwdDYp6DXOU-&+Q*A{Nb;30a-B6CG-hZg7Gbx zm)MqGLZN!O2C524KU$ZS*n6QNEu_D_iF8#Pt6IoGUk)$*^EKh6fA+$&1iXY7>KA$0 zyrV5l581?&uEq80pY!rJFD#iE=$qGR56v2;y{ByMHSHOD2IG6Cv9lva4B8M>`3oRs zQ^97C!>}g~g|I4I=MS54+BUI*F}`TXVGL`;FewL%HF2=Ku-e8Cus!k!I5foDFGjtcdHgI8}a|*pCL8eRD?7&GBsc4e`F9T|X%o61=>o{MwYS`n0dMKx_-d z1ukEjvY2kXtC7Ehad=4=p)fX6dhtWQ^wXzIX*kqUAdQrZ>z~y;iP)AFD=Ed}xecnQ zlbFwqgG^(Vl1y9??s6@tKgu3@8abb1)>8O4ooGeoY671G5@Oajsj9G^KD+dd&1uof z^DTZy;L5JR3*W5RbD>SM{>3JRj?-lLtf^5(@S-MKecM=U>N8|C-Uy}o#a3)l`Yike z#2zb`hOw-frPNM$kKI&@J^#L=>!JgLV|Po0KlT!%TR;zYlSCpKV7XG!R5gQ5HC+~1 z&&0v0G+)k{L?3%|kVP|0k@LLsinzq|Mzok;<^baN)gYVe5ez=r9%cQ%due5=JTY|O zSH*bkal=%j(>+aH>g9d*NboO6b#jSYkrNBF`Le^l^urOoTLS*JwH1@tUeyPXf^AHj z0?W|H^~TK{IddISIESZ?nukZ| z!JnK8$xmNN^fyEzJ(ShomlS+%6@2b3c>MC^DIAhhDrtWBind?AeTg`}JUnQ>IPJVW zIO)7>zdL>HD|__rjU2pBOE}W{mrZ&3ML&+lo&Q-xel0K^n`yaCl1U`XqnO#{9l{p# zF~3*YHOtEzb}lSkd!%SczY!J8>4L_^-HolIp3;!J1}Cc)c==kxw!N_3#wbXRyOxXx z-K^smrxQL8EH<~C^UBo@($v~Aml=8IMwb5<;>NIu_t+l4UN@#2mUl=vGnx09Xzgvg zV_9ckJgvwHP8@cVX5ThYZ(g;a2kCFDct>pn4({OTS#xvm;8@e^6+{?V_ zQx<~xy|@HYp;gjo_k_N!>#goDb{7i|sdCjLFLJxTkai4{N`bNaaX;GpPfF9TWyQtZ zPm0qo(!HV1J@*ba&*Wj$(Xrvb>X<8CwZ-U$(S&ux6qd9!i9W&FFR5!8{EoJ&^0(pl z#-0C^$j?GhQZ}#F_h#wK?pG3k##LQ{!8CnXYf}8rzyDz~qZI`Y` zDg!*Pv%S24@AN#q_mBjYwTOZmEP?z!4Tq3}bII3-_zfd6&CE}_NTs_!{fn>7gmO4Z zF2r<^XhPJ2hT%{ezmnxJeqm~Huq1|yINJE3wXwnwO-)WM#OSy6Rb6VTANKVirwD?o z0N_Vo1;LuOZAMqQUzD_;OzHIVOd)4ziF1^PRg4dyhq(Gd(UPkE4BhW$WIwY8tjR%| z(D$_;Tp_LDk#CAk4Hy9hFKd!5OFknrh@qp3uSH!Z(}1kyw(UCEap-Dw+P;U@UYya| zsy9p0G$_+xmn|D`0M_cvKs1Os7zimbLY!-RGKF<(N8AgnIN<16%X@qMrZ zA|y~CK4&B!ur59N7ay9?kPAqMgM6Did{^wTtZL^GOZuqv-L5M9!93$m!qml+OS_tH zIYwW!(%RF&9u}7+$fd01M54`(BiK;|-Z|O_eb+CAUB-EZqs~+hF7nB&ihvw*n$GlA zIiBEMzzV;hIz5U}eqfc)Q;HC{SMm;A9!t}eA)X#94`jA+WKo5=Q_ZwxO-{asfb*c} z&Wlmc4#m|^^B1g=cf2p``otF zBAp=bj&7i;xl*ioqE&J7L|J@0`k0B+qe4M`P7ZneN@w1)Jo@H>BaIqu=B2r0cUQ%T ztQ3ru0)ijBIs}R0uZKr34t`?tCuUx`?#;Iaqb5u4a3oE9HR zL?&;-6Y_|$p)U=|ady25ATU}tNB&qQ+v5N&>no-lGM>R=xw_d%3B&Wbf{EGG6I>$G ziZxh^YBj&goh5+va}gQ~!!UB>GIenRTa1lDV^w4QB$;p^Z@BstWUI_V@=DpKK7FDV~j} z@(%yE@S-KbJ0aJ3_mNIG$A|={bWIsl)Zo07f35-r|G?P6|jAEf5yM< zMw|;che%EH)S3rlieTG0P& zXYxS{y&ORAhqihM0611W+^DMx5?tFJvlUpSqqw_Li%iX)M0nrZwN*CB$BDg=MNG0? zgH+`p*$-_zB*o@}mUPClQG=8*T0>|QEFk5TRRd+)gX%0o0#G56(GgMDzapZD`a108 zQv8JQlxv%4xE;`wdR&RIYCuFvC;&jwWwxN8Uf5xvQWS^;51;&rF22H<>LiVufn&VriU~`@D<)&o+mnO#@&1dB86w-)9?`gXA@tg)S@u(nnl6rs7H=`3lm%TI ztp9??TA1kMC|a9=WJrq!3;|Tyo||+>YM4di}McyK=~Jrx(Q|Y_W3b7edJY_da0rIrwEf?Et+5zjSxqnCd7Au#vWn z@h-A%d5wngCW4TZ>-Aq2<7v=E*&2?^CA^LZrn6)?3&*AHjOTxX+$|8pE!;M{da1er z86fqWNS*b-EBQ4*16hYmhwcbyN%JU$(E>4{^jSZWW-4!EO`6S zkGZj)>p7Edew|3VS(cW)dd^DJn%K1fFefi4JmlJXSktRV;KoB_w`#F}vumzF(Ht2y zPkh9?qd8H~_Agy+ho`aR70qEpWdMj^Nu*YLi6&E;Av?rLxP9>`+JIsrWv+AnxV;bgeLQJ`9MPpX2*11xdbA8`ZXS*AZjN22JH zu)PRr&TcG*kMl5?_yiEqd6Hb@Ha+EGCB5KpWbIhXu@9Js4d;lZvPj<$iKX_lpcMQ( z|9Mi|E$wESzlf(n#jd)kUigtLySr=q`Nm8Y0-oaQ&1b#ySw*!|C z5v2~la9ZBXv~26-zZz&=1Le-w8#zGAO~Bnzoc4hg%~=Jy!11gw(P+y>+muLL`{-ES z7$_c&i<>g4LM%&wN&Bji!1vm*-cp+JKw8DV=CiU}+cS&&|8N4p_5Q}-jzl2h> zuw6(Pr84?j&_91J>xJ?^iv;`67?_}f0F`n8@}@IynPo(UTuXD)3a+TkxGyFcy(B%? zO``o)D@c2@csjRUo8vn~IN5&4wg1IO0oLIox6GNL+%4cJE80WgoTuY_n|U?wvfXtL zyG3;QwJYDALgg>Oke1xk;8XMRN%@J^oMi=(U8~$HQ!X<^UdiiF7>MQ=8aT<|4QaGwNJYiyJ5q|XnRhB!7Lf8 z_&01;i{8()WIs*PGzN))BK)w!B^HrBoufZJIvWlV>Nw|GcNPt~iB(6^III7O#quQ? zRP?Y^gNM1a_d6e|Uj0xvNk&mPv2EpC+14xC8o2QXYsyq8po9Oaq>btw_0S}3aO6Uf zY)v_)fID|Q^z(pLq*ahv1Qj(blFTKEA?C^xVN!9u23^>>cv`K@@bB6MS|}-A_{1kx zh4700p@l(H(dpeBA9@Kr*n};+mmoMdKT){+?Rwv)Gts(+6 z%6yugB>IeRo4>amRUqD)|E-3g3;PEId7Uoi_9t0XxmJr8l-$EuZQ0|NOkD;*V{!0b zutS^yxz2+2f$1-=2UI;mE!awFP!GyzTdOX1^zasZo^ag;*FCf9w$C6_z8=^V78b1i zZUNa|QJl38jmH|noo^91uRk*r@Vp!>-o0+80uo!z4 z>EAsc3u<=|l5W}2T82Jn6oR%>u)A)-C6ov9N;J!^Oio;9Wmp-?>Y8}YFwd)7$S-5N+N>@|% z^fw;>3oK>q^Vfgn8uhr^B6f4v5pda3nW1t2(DWMrAvg?*zUl;5TBHADE2m zzfs2J6L!Y+`IJSlq0_&}U&7BIwrnv`sRGtiaQMw2yzE#i_86_}HGrLyn$$rkR$HQ9 zk)k)y#!m4t3DaD`OIOhfnhZ+RLJuUB#U~onnXU!Voj@PgSObV(23&D6k(1tXWgVS~ zj_7xF4MccFdqCRzo>q`^=?^O)7KnE4X1n6hNAF9lTbVT&wdWFN38Ple^*n&(QP4WF z5f&eCR}MXp23DWl6B2DsFk51Y=i2z!mu#FC*we3RF_*YrTW`O zYJjhO))JHWF-zN)lk^QOf3o+qu0KtyN*^ta>mYd5wQ~gNpj`S>r_{R%C|-4eSfL2d zo*y5#5B86;F2+39y*yI3Y(S8AGc}zcg#1xA`UPz)v)o>*g)bY~Z|bl8Ufnx?30^*~ zK}tk13BM6&ko3KR&eQc(zuB|1SF%epy5VA)yauk(WEErr@0fEH4qy?YmA-$GHJoRbBtw$#- zrWob(MMhh&Y(03@E*glnPDBpX?vRTRpsV@}`f`20$MR4{& z&g+*gfhi+(JB=-AZHe|d-yFAbO&zq_J(sIy-Ay)k<>}N=FEX+RR$ZFCZluc|u9&Xk z(-(RA$R2kns2y5uTQ4|%{WVaQV9-!QE*Xou+}5h4tghSDIjL^emNOxgo0gxf8MbnS zypGEJG9xk<-E=S8tHn%efKyl*$eWMv@x{!OASc8Qs-CK3b6=USsA|lDmZ|(0M#f?M zAa$ChUPB`K88WUve77=JDA}xisiaHih4(d9;Z;T|vrJU4w1Bl@r=)^8?dWy1yxCSo z$GfKO53px^@{$=XNnOkGf}Y@xlAP^^N?!_Ol(oxdcifgSVn89rD98)eUh3}EXG)oW zrHf!(^FT~7zHu`C1f*BK*S!IUsL04g?6#u zbdj}PW?+ekd;^=UpI0sAbbaik#n-^~Y+Uuk=H0~R)t{N;gLr^gq$Xxd*3ZoRvY;a5 zIQ}A*^c{iZ`#KIUqQU_!p02ziTo$)$n&Nxw`&*-c{N}im1%>z73}<3OY|Asf z={(Cz_}^iu;}_2yr97DjAJNa^ECN(wkT&VHG@6-z zibo@ScsNa_)2Lsy-nsG{>8ATenz0JPNng#R^Dx%5&BOdYoYnW}>j!}|4zI8|7!2-; z2Z*)Ov3hSYn?)FHVG^x|VJ&zZ6zlz~l%m%fW^DPnwU8{jPeeB(S%O5fW&l>^Zc`zm zNl3uApZGOPv%leKCE?8vx6oLZ=T^Oy`YiJ)-Em$%OPiIp@@c{zr&wO6Fp+}+uW~k%89EKbQKx#iEUp|3Y14+PkY~<-dG6C~@3Z{rEc!?!%kKEB@^;L_?91^y zTDe;(?Gj+Ew=J2jGnGU$bP+?~zpS_3GaDk&sM*S#c!t!DON8!Xu_m18(NT2e_ckfM z+MRbYqw7;EO3GJISAp9=!>S6S*f_;SGgvHRxq8B7&R`#DM}UsfQ66)|5&`FYR!Mmn z%e^uXEtUF}ou|CnKmDP#-)lqFBU1|d@RR>skR<^dMndm79*qcN^%ZYmg@dJ9QP z&5`nXMlxOp1ybYs>@&YD;WvpT>lp>7kXx|NCF8{jikKgg+i&6l5dKxaEgz1UVg1x4 z*k2Rn@>j_j_9!$EWT+@XI)fc`aTpt&sE|@|L?mNMVLj~dDyjxKQiIUGco0($dTg^&t6i;-8=cdOQgRJpLytQe1yYo%D_ zI9{U^;U5}*a*Ib@pl@nEwL2M{PyIu3l|L2?K`mcRj#g{dZ1=1xpM5c69)DB4x4fI; z09Zez1dTcnECnDjKEdr==sm{%GVcE+ljqZ#O}R6!X>KOzDTQZ;f7Nffg{mpOsnT_v zg;LE5x*)lv!YGM_lcebbBN~*c@2Wh;z=PFan5Ge4C@oW@_6SB z@Ml!KMMY`MR59G5$Tyecu?Uk`3yO_nU0pn|N409BXGX$y zx)fbTvtA5%&ClaB@Ailct$~YRHET1;>oZh<_5Zm2+wxer`Xv kpWDyv=k{~^x&7RJZa=r5+t2Oif8FQ*0};NY#{eJ*0IPiV;s5{u diff --git a/orig_sources/lua-5.4.4.tar.gz b/orig_sources/lua-5.4.4.tar.gz deleted file mode 100644 index f33e458126c4fc59807ac847b671fc434b1aa7d3..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 360876 zcmV(tK%S%H_3m$x3jZ<@b(b$-#y&f|3>Zn`lvkp z{6Clfcgo6LO_NN8G1w7BVLVfprRRL7Mp~;N@w=J!f`xYH#UiRt^olTvl@|xf2P2b3 z__MsB;jHxOckVja=j257FV3!i9H{ZdK#d0D@$mY`k$OM4y!ougH)`~8I96Y7KHjOp z^{3(8&GpsbdW==ierUrlNtvk>2mqUf%Xr>io{dM0U7F;1H~~!$UQ}veKtm^LhTl0Y z{yf*2Rz+gTaMgIOn>3MH6gl3h0z-M`GnHV43c^hLMUsU&Z)2}KQ3Y72d=FcOQ#HIE zjn6JG|2n?8Rbj5;q`*q$P4Xlv3$0SGm7p_pH7T!uNy|^I!7PPb7 z@$%~CoUyPk`t-sFi^IIoSg;I>IX1ccc=p%3o11Z)e_fsr@7lbKp89wqqG0z}ICbZ) zQ$zSfb;~^KGFH|5_rvQG^=hj&ZM!=O<7#|(-G4G3#(q==x|(x2eE(!l6i%w~tFxyt z7G6yM_nbQYPiEzF@VyIiy01Ptb;djg&&~srE|O(K0ftkxB9$^PRGKBQ_XQ-bMTmKs zrb$+)Rwr$>Nq8}KSs8iFy$9B(tc+FW#Q>!e(Hyg%4isJjyz5mQKdFFq(hBv#zYpr{ z+*X~1qUc#oI6oVoJ(&Ra>U;-$gbE-XzbOQ%mVwdY0UxSZ=6LI;Ert%WCcUdL@>4>l zdhrCE+R!E<#MK*+oT;)1qp%3c@UDJ>!kwtaJ*H+~ zTYH60M_u2j>%rihT!Zl&XV+iG7Z|oa<6<~cm&5CUsyT&z5WaexW4~EO*5_O_e{q+3w?+xE+6IJ4tYNO(vY*CIJ{7sq~^O=_B{7rfq^O=t3e4&Md3Fxr;Vtrmc?6_{% zye19hphsR6dP?DK3Xc_VaI=fM6llZZsdIL3FK({CxDM;#5p6c`=Lv5T&JcUy(RBek zaUG5K&nt8%S2Tz*`cf^)9gKCfs@I>$q}GpQVR!3CYyFjA8bc;z8W}W(Or$jIZVZ_q zX*jzcY6S3R(0e**Bbql+dm*GZk$fShH_?3|us@IZW?*M4e>!b5s`sCtwh^+#5j>r? z5x&GGTb0VB_p^>so4_j&v{V16+QYcole)yy3~BV^$xHl)3r7e%d5K>pVQNkhzSn$q zK|v-+Smk{LCghWpy60+((@aM?C8#4__H)<$z3v%J#%& zp;DhP+S1rNnO4=qw)4MT$^7y8?|jzvKUI0Z4UB)j|FiS<@Nl2%|DE2!AN`--#@9}ZJw$!U(a3r+^%I)@p>bbi= zD41ZcOaHx9y}hG@y`%jd1sTFcOsGXtPwPAe52wGQQ6pj?h$PPqZSC83L$>xXx9Xe$;+hXjI(p<*h?4 zrv-LWUhv>y&lxsHM6EU@2(qj4GJWJsz1;4Hp|%5jp_Bzp%abxg$?GQp5`rvQD9`u9 zKx5O0%KZ%cfFSBu0SzaaPCH!D<}1v2#Gv-?u?-63I_xUB4i{+z>IJ;e0MR%T?R(Tq z00qqQ3RR>SOK+8{iZ{Z<6|e<@Iaq_bT;q$N)OcdVmZ({HR4D3?z*&&Wn{wF|Z;e!T82g2OVRlFrQp#NTm4_>6Dcc~kbc?a3eb>6R3 zpr>9L6>WzG>!?xB6owvvk~{HA7*%a&f`2XNM4hoOCUaegO^EWZox~BxA?$x%1IV91 z2^^{zJ?avBewO693c~4BXN0|%`SXyBtIW8G1$9l3^9!=jW}U?z_rVvi_PWik9RV)?hIS8?#Nz28KX6H7Z)DD$$#BYms`;q7WhwtRv~v{FbQ> zXvrEKVFNkL8}^lOvg2FfRAf~I7)4>ug2JvwutJMf2evQ3dXuY%Fe^%r3JtI*27pVm zc5R{{27X~$MnpP@%BcNKLVRI|;S}O9bdiCws+bn5RcErQ+&+;;IATvZ_2>(+3P=vZ z`j{J4h?q#$V+CX)OQmagFeG(REe70jj0zSBwBt@RvF(@+spX5&*`{W?&eoT8XO%#= z-hA!6X)$E3!MrRm8ZKH)4hW*JH7H4NNvh+``5d0eLoC2pcbk1s-Bzec0&keWmm3so zW~PjTcGhN0+%@sYIN@ik&xA%;sT^vMAPHp%lZ=3dHLF;dl)1I&O07~BmBpZ}%2jTy zQo-uQt2#s$Siqi@f(-Gj8I?G4(t9dXpZ9u44!P_yEwlx^45fuXfqk#muyvLtSuS=c zeE6SeA0f1!5<6-XPMHZ&ew@Hc65{siD zcVVPPGO&)d!OJmuMDiH;H(9`Eq@K?a8iHFPLT2zn!ZT4tAZ2)x_1c^(*G4-+{^h+Stb~q)8%f$q) zk%i9r9x1l;ARZ8|$z5AD&Wjq$9-Mrhtler2Zf(-n4j7xH3f?&2sBMzW+LY%fFgj2t zN*dNS8pdF}%igs$8VuCg<>;nmorBuyZ9DEHW1B^7RW2wUljG8Y`}avUlf~!5vmdW- zM&n_Bgc+zZ(*D8C2WO-HLy`jV@G0-FSY!NB{ny()+&kRwZPfpG zIQ*mj`#nC#e>%VEkH6dw)W!JfQr&)he>v={R;Szjyw~q`&&TI7u(n`>QTiI3o#Sgf9A6GjDJy|esXNX26gn#ZX$!srz`!SrcF#_ompDf7dIaV6)S0Z*T>|Hb zINY>#O#j^`1ew8*u47eMS)&G$Hnq_tK-qt*(Jo*PtsKu&gO-B?c?V=6!E(| zui@SD`8)jFrHqY;XhSjjox2cD`$MKFsr4SbFyiEyd(G_ekrppz%rw*`VhfpASE&{^i+d1bOPXoOoHQ#_cNX(njCer`DXLN6_$VTqdFbzo7zpe zV`CH?{C>s5^f{jQPJ7BoP(cP1Lr+@J++kdBx=+?iY(DPJS+P=4zK{yVG+F8lal5Vb zbQ=00nAC=7pdU+3|KdHOa}coHb04`uQE!%Tv&Edmd^g} zm=d=7Ad-gI7yr^+L`N{4Amik=v4Ah-U=Uhw5Tb~`rpwf*h@{k2&~>a#p2_v2rTocW z4qdO|t4zpdsXU|1-OKaD4-w2!nR!`8y$)&bK&|B7Q4WiXk=Y=%Fx(AR5Jl*7@V>*gNyGiAULB5=EMM-gXuqC)^?O!az%bYmQD!S=U}mT_9&(8nOtB1VnLh)zB$s z`a%RvNYYJ)%*)`jY7Mw!y*QQQr~YvlzopEko(bKFHi zpQSTH@Q`aGU!9cZ1{xoz5zIMK#p*tfFPCwSiN~j~=Ho8^YCFq$=+CKyTXzu+vRwI4 zYd}e3G13JXFKJ*zwHFg>g-C4zxgm$2p3h2x$B9?S_LWA^gqTV(X=(8x_aq^qH*K+Q zfX*)(APbD@D@!aFma*0-HWI5WjorCIs{s%_w#F~1Zbyh*Te(R1jFjH$JQ!}r+sqD9 z$(SoY)8+6~i)y@<#qG#}nk|#;K4U|kj5U1&5zg%IYw+Gne}w326;PKN7bWr z5A8(SgvU^(BXl7?#znMhOY4Xsn67c1)J^5EKuiU`p--f156Qi*oL9c?eo=EJ4YjXr zqlfk*YGNgIv|QFf!OS;!Y=t9|qFL7bRbSM;0b`=AI>U?D-N_!Zq?~b6j4yiu^yX?2 zlIc@><;<8UwW^X-TZgfP8=&iKGu~s}9t#o@WlnZl=5i3t&1!Q6wCU6<#h_{i1WI8^ zz89!aT{opm8KemtzJo4hp^BXrOVoS9k&wg6Ll}rV;bKx8C3FoyfNP+5T0+=0Sk<1nLG~U=*g79~i}{C<^aQ ztjh8P5HXTMgsBoaTx2WmF-NH15kx+47Yhy!Jhpv9=}7q@CmxU^;z3|u=Hbk?7U8JO zT~oxBdCVM7y_9S0Du=6Rvm{jzHR^fO!mrW?Qj@xXL&%!kRSroOS=gw8Z4nC~f}^?ioACZDsC_jQNJL z99QrhYCeW>D7J4}ENfV2QDj&9$Vk}#g_%m0F)yxs_IjE*wIK-8Fw2XMA0e%&E=+GA z&&}ov0DBGCdL|}Qb6Y9)Frhx1u`;ux61A^+A8~s{nZ+_Y(|H+D|I7;4QZG?SB+9HZ zh#xtmS#cOi#=v?8jiW50_C~r%CaItolpw^j+6;?R?G+uEQ5slVR?Nvqn>mC#za*NC zCX-iTDb=y!AV~4V9KbOD0AnIECY*H8=@uU=!J=T5#fk$G`}VcNl{3A{fAB`{D1gE{ zQo~Lo@yLbQK*U4F6idkQY$u+VY~Wev7vowi6C-5Ca_U7?l1)y9KbY^9&Y-xo1tn%^j!u=7gB*oa;QL zm`eVhY#Fkvqa-24WB`(Gd7Q&|5g+JqrUuS8>Qol8g z5{}oMG{K~8JEQHCIro&I1W3Bs*p3*C*-GG8?dM&LfNW;Y9)&aLxBHz5l@YQsH-9@( zg2E1;9B>TVl3Ck|_sW|`d|+&152DO@sBk?j90sws`vgRn^FOk+Iuw~`p@P>emEZ4L^G7Ln{@^%cf@Tvv2C>AV;q@IG^IFf8_O`~Bx%KmG{AZ(&3t4S zVOmC#p;@Ico}A>kL2!H^=k+B;(w=NK6h%$xv3Bb4MshN6MguoRxx!3ly(D zC>+MdQjyOExfF6>6R&3%Z`18E=3Z5$wXFOGJ-I|7=gCy+BJYS2Mt1i&FVjPl_83LUK372g`1_J0b#-Aq?S?EuQP^|y}GD3UaxAtR>#ppSerz5w7dL4-4Ro%-+ zJXsR4mhoHJ4s4n z&z{HxWRk>NM>+v~*TkCS&pJzTwe?2K?CXxPuQ%IOan6DR4hb#ncwk-*QE|+b@Dm%> z*aIR~2Y}ztOqFHp z?ON$s>#J~n7YEL>gZ<|et+!LxwBC+UHIDWav@2;z$ywB;+Q_7ym3t$xYSeP1XLQ{M zKp;5oxtNNT`*B6$G!o86t&IFY*_}^_oR z@(JcfHYi=9kfXD7GHs)-g45`~+0tCHB(WLWhzKbJ)pOAwe_t*yWS|_gNT1W#0U>zPs zzy`BSfN?fdY}ehl`h}lHxjr`65C|%csJFp4+ym zfS`Bg?)90GgzBn%XJll=FMa{GJpe-CE4aEmbPlJXmD2*l#`HXOhi?tADM0nd!}p~h zzAt(BU@u4=f^J(D^PJ5&JWEc7ks2cJ(uZoSHc&Tp|1=@E)MVZRX$V^MJ@ASos7lU6udF&wp5CSUeAOp`B?M>H4 zh$~dp#PzRPP0`XzN6^DB9(o<`jI0EF&qgaIn3Zd=-`6YJna6&l@JeM*K;B3U5u;o4 zurn4Tx>&)*Mka!m4D^h~&t6d)0eCb{et;YXby!p@=O90cyE$*6`vZ zIN3OBZm%ZwoZ1L8Rls}!=m=EWfs+u6OBnVgSQ-aK>-63;TdcmRw;{s)6mx>K@U0Ua zj;t7n{a*JY+5;oa%1J6ZFi}|JV#yDnK)F1C(NpZIuBZ!l{RGL(ul}?L@9zDqrb&MW zHg1oDM{FwLv+hvC%~wm55sd|pYb@45SNOG69DdER$rwL*+tPvJ7bvX*92;HmtRIox zD#8c}=Gdz=X#J2>ly90q_%VzXiJAduZd8=O|jrA zshaZ|Va*xC3E842>Iq(W;Ed`R_@Fp<2XX6x%)K(H<^t1;H? zO+SHv(t2~f4#BOTFK;3m^VTco-wF?gyQ+*~{J?fWZXKD3ql1S(51tLkaK?^Cb0>!S zT?te^qU2SY5`=M51Xoik_9*f$oUx!X_EkQW$yhlA-E0&qXE>Lz%t?)b>4=NO$%aZsfzu-8FF82c`|3sYpT6YKIk0XV%X*DBL+cuL~k`S z(fJb70pJBJ>IGPo`qq%wvAQkf)s=lH36}#L9q@=WdY)vy_5o}I4rkf8WcI`_OFWd- z0t$*S`=VGh=6K~DzuV`GkU^!^bbqKW?8MEh%OmLeg8VO^r^v23ly0%k@0yRLF zUML0M{Z?e)yWd(di+~w-lso#}H9;e<#$kGr+NUc^`(fqpcyxG6Fd?7(rydfWPe& zWDo}hQ8BzE#AN6lyg}2zi}HMo+NAJG;n!$g#_#!XH-T`x1whe2Ul!bm2CD^miU;9} znXmG9?o!LYYQux4run$ORrz?7Qa;>{r@)2pIB+7;G2Ze8vty&gDL|z$FPlOUhv7mJlsEEAU%!_rReB zEz?FpVN+(v3t-N;81NMtQ2fI#9$BAmhEdk4vPr^-6-gB*XRw6;G{_M;V*1pB6iz|t z7zYAFn2u{18*bUA8#HeLzf1EL^zyp3eG`0e6MsRXrB7#GUm5(}s7|a!FdEeN2m;>> z41nf*c_zuNnskN2CbnLehb-lcDS{oRhC_=N_Oj$}+zt3C1yCKMq=ICp- zM~K&`@;;^nGSaUxW*3w$Ou*s~b!Uk5VB0gk$#T!yr``I&qXrg&RPNEJbl!9zjQIjq zG_x}{-7-hnj})54*husCs{Cxx^k68NyL_QlPO!XAt!Ay# z#AuT-P@~7kSv*U8BZijRt&N0>u1Cvyv4lAUq!I+og7J>+s_uuXrSQQpTJ6A`)&)B; zmxat8ya@}2^e*ZS-j8t+W;7s+`~oi+Y{T#&Zr%&Xq6OClsq&~eNF-w8LlMESZYyFN zG~Ol2sI39M#EBKfG9py7V(^$~m$pEJ<%6qXA;W2+h6k*P;977$W8_;w*J@h`V-VfS z0Om`wWakao8ZsSV-+qE6MM|ul1Qt@_TL34HrSp?3>WtyOi64o-$SPv4`S%U~MZPZv4f_pji)HS1Y`?PT(z&;_#2u^7hE zi4Imk!8tz!xJ)r||E1W%VEEAY*>cn_OB438gvT3+q1v}P`sLB6@(Z)4sU9bgVw@h4j-ZzNouv1Y*LWl*-S)x8aKeYrp%XQhE z0&RI!=ps2)hY5dijvEKO%KP9ZXDLpvXH`vReibP8Y&?gx@ma5_?r}<6e!Tb9_v&ZI1@*l*m`9rP3$#xuicnN$@`i>kdwY%V{venI@p+-& z7;l>7)kUiebfuOv&EqX5gRLpV32c(uLZgMa!jun8bp*m=1-|J4#UM6O5U$}hb z#~%%VGy_dE1^vKETOw!z;7QD<)ZdEkgt;<~n|>E13SG0raKVXT3GD#V5u<#V>SSTa z4*SchAb`JF4(u}(h=QEQp?tn5TKz(#n0=PMtHLsdD#0FO9D6VT9xcQWq8y!r`4o8) z5+{WF)m12U(_gXdv|U{m7y#4lEY;fE(G5e_Dn5;k_&yX0P$IY%yfKTftsIGGwnfR* zSx#raY1xm#^1NXn9>Ur{l_nUL5y}YrcY{E%42r)+n7Q`Jy}=MN4gjRcimOH4FtjZc z{R}^#_u)U5ctLpys`_B=4q;XYv)`=dpn%NFuYNQ6sw-!o4gj2!S=s4UH~#dw_~HHd z;Ms`CbUuzLOx1rXX%cu*(9wzNdrQ%`sKw`jOgwGHhyoTl;R>R&8*HCa*AVZRL>G;R zCe<-I&XABN_iyU$lRZ>{$oD`RI}XfTviiASB>?=V|=|(c!4o#n9u&~&SXXcR(v>(#J3QBVW#V~o_jEGyxsh1dJgVc znj|!iHpXQ8n=jm&>8zY)HR-M#z|3O|gb+UpQZ&)WOrKta=bBhfANWWUnjOL2UT#*zxXsYFY4=V&BcwAZy?TsasQ7` z(}GoX)onplTyWhhyb68NwO1ym{(N4$LOToK6Rm(rUL}^mq-@cEd-CcVX~4fah5Pv9 z+MtRM%GN-TTbW1DGk+wYOO{n-kH4zua)zj_Y3)ucbm9jXt*zr_dWJ?_G>MUU{YD1n z@4F0&9oWrtbF;1mZY<|co%}#;VIENW^glmcliVTL-=tTs&%%xK=^D~pCgir1FfY!X z3UFDvf6D5ex5x1RpRhe^riyr!!UkQq23>r@20@H_o|r3oUQ~gIJvjJ3zOzO7rhQGC zST^)AHNqQgcRGL5yMyON)g1s1wc?)tOOH;9YL7ZCNCg$gOVB?tLaFk3ZoEc;Cg+Vl zWoxYZREbgCHt20M5O-AHZ0kbhP3}t8)5O;(Rb&-SMOO?7T9e{a^7fZj-u{y1tx+O( z&=iZmBs2y@=JH%Vd-hLR#bi^y7QRcyClh5gT(EKofgpkcT-q2o%$GiiBMvU_GT*lv zrL$PNwsHVGc99$h-SrS`4TDC`2OPoQyEPJ`0qt8zb#0{Pf2|>{?3haYdL^UEHUf(t zN^hgP4_nbQY{5c=aocGv`jOwPG!hw|ZN%B7i6>wSo8Od-8iw`v)BEDq26=!D5-kpw z`C?I2%zkS=Ft9@sfo$zsX68*-X!M?hyOgQI#0Ms(Ve+uOcN4H$h>blktfh+Z_HbVi zS#h*a?7it2S;tJ$6n2++&+plB!q@jhb~Z=Cqv?<0Z;FPs<_^` z6?|}Oya@)+1{TY9K#@qTd`(M;xtIQ1ZxQSlgHdQ$Xc>I6Z4=GQz3iNEXBfw3Guep@ zwo|b7QPC(CMcy`ko}*R5#07Tcdk-3di7_Oynt9Hgvatnx7S{I{g8m1dWe2$b8ezAy+j}S{rH_&n7G=USR37j~9ftj(YU~22Rz<7_B+1yxZ ze7M1C8oFt3MjH<|^lhWV%G-{?N31S5nspz0;%n&aboplF_p7&r1{=0h2o5pJfbJNl z_JeIf-WVjWzcyG4K8~^SY{lMsVv68Mv?bs+NLL}YFb+fxP9F)cjeaxd44nn+TnBZ| z^hkKZAZv>{p_JH5=Kl-wEVy-kYCHg}BB|>ad@Ls02JvbVI)wuQ*{Q1$8|VrNe3DNk zV&&b14r(W&{)smh;U656qw8~CH$~6K5X18;8_@Hs=wrgJ_E!AZR{WU1^%BqRdLP@1 zkl_L$`M0Ux$8->tO2Kb2gq$Tp{6taISxv8L{uh45G@u! zA`QjPI_66x$#Y{z8YOpyy9%sY&X{DkNX}UZL)VJCe3*byasE^yw~L#0nOj=~5l7TS zv{9blGV!4Vfi&3=Jb1ZylQf#`bUNKT4}qsRN0?y<*~c?=h;CAc*eu6D{=#zkEN-zY`^lEr8? zBM&q2DOt<{-u?*n#3)HY9+hOB2{kT^Dp8DO7{-jCgN}T$zB}Z$wRc`veajhz6{{HE zP9g~?5G7!u&p?sfQ5cn?CL`Nqehxwu{mh8YB+QXw)t;oVYESmQ`Ykg>KUbz`gHiL) zK}FQ8VWRGmVp6v90QBny4lD-$*W^|plo^4QBD(B)sj`CcxZ_Q05yckMRA+dQNm%I39QKy&_J9oHiYTcXj3UjTR_Jx*>t#7uxF+=ady>?DHmL zPrCE~+2`C>xzbj!@?|KFa;ZbjZ&WO=O|2N;fm#V{Z6|EIsTvD;5mthy2hjuc)P)xm zssl~>f|_zu{#^m&b;K~4c!M^P;h^hdoE7%jOBNg-Z!n$MP7Q#KmYE{~u|zEVS-#Sqs|ujf!-Yg^ zgO7Pv`R|GXZ);b?md#t(bxBdrc=fCHB|Bh7ocxp`(C2JJD*ZTbAlV-R%- zd-+e6wRMG5VMP-$;xkAt3x(vY1nKSM2dj~w%s>h*inBn7my;gof zVfRbF1szd{lu~Gm<$BFGjXR<{6p%fwkZ?Z;Kf6X9EjmH3^Rm@^vA7lpWef@+_LL4o z+XRFJnm7Ex%&8DaP-K@Fe-G5KzhG_cT;C!^IWS20A$Hm$2q-1dMW*Yp+34xXFD{U+ z32ssht<{^Vyo27L!-o&?l#BZ=hd2xZP+-zt2s(e_X(W!gl*S9ScpL=*+t#?)NnnAyjGLn7LL~9^=twBQ7YLs;dJJBc<#H0`>wS4EE|G;VMcZ2U+$aZN1~ciuc^skPJmEH zH|rEL|0~iVekb(I_H<4XR6POB^|v+!)i%d-kh3avN}|IO7^sI26A?xnU~8rx-# z9F=UE5ry63FW!O=VQGpUSw5#8gJ#{+F9d zJXU+>veWuCa~U-Ey5#V+E%eI%BX{kIYXonSoCi%`ENl0@tW5+Ri`d1BNYDC=yg#0xq*U318+XxVv4N^%y4 zTnVnjx0Ee)ZVCBNdg7`F(=}emD5knC*p<}HtVs9*rQvh+)vG0C|B@7qLR$h3M+)3W zZ%*a(2G9ziWtr_3ZPV2U_pR)5WlM=(FO^Ta7dn~iCLc!LV zBh0j^g3$Mb6$5SLQYnw2IEn+0(KsY1l>XlvzoFyI*ANYh=Pt?RE&hH2+3X8iWrCD3 zwp%dF8mc1p`gayKm=c_(=87P8mlfT1Flro}=}wPS;bRpHco}IgycrYHlj9fPN(8#N z449M{ee>XIrU-gJ77v=W^Yqk%gA^692`>$+gJVbq>7c$0W+tKder#x;LBycqcn5o7 zQC1n5Zc)V|51qe5i+*?wzKEXbb+YG*Y!`J?*m>hvb8JEwAj^JgZBdxbQ2`c(;YQEm z(c#w2^Co7p6uM|*!N=k8)qw{9X_}DY5i*7%A*P{h>e&Cq(G0U1`=m{)1kWpjfPzDv z4VFD$TfKOuuD}j_riIPrBm- zw}%HtcN##}k6fN0H+hecM*kh`bK`nbtxbp=0v{iYirU=BLzsDQBb}nB71Jd&p%jfr znkdOZdZ{HA3$@>f6AdN}B<42K7s>Mg)WdvkofvR1m*Wf8er{nv?7gw<9)W0)_<3Ht zy)q*tn@x+KTPt@oj5?l9sp>q`QPq+FbQhO0;7!3_p}W1RA=@wF8(3TL9bqbjTS{C| zBTrG^;q$e%N1?rGh3f*y;oR9ZrBfLEH;tTe9Sj3l`(A z%?^&ys0~I$b+vB_l4nP;5&E8G!HRVx-jYO|*sJ_j^18}2f6M`r<;8rv`WopJ(! zF2jn17kmtEd73em&wHWqkt=#UtuSuK^7e;KZ%bML_oGy>?wiDn%Jj(UOtlAJbUmqs zMhTNeS_WhxKwMn9?Yji?p`q)-nIA;Ifz`xJw!(ClAR2SkgGybUH1GUlhk8A^l?e<7 z-_rfVD^-n<7@ShFT|fn@<}P7%hAFLTBXu9Zk+ zDB-%uFifZ}fwoA|s9u$j%Sv_xG{9m2ag%Z#Xj2c5#MjnNj9(M`nr8{dDMG*%T=of- zY4)I(Y09$W^FP`AtdttAldClzv27zCdTEZvlBxT@Hz1lWo=2~%UU^cFKj zjWffLWL?D6LF=1@`hdmv^^KY&AaE`5NpKL~z{!rWBnIH3uMJVS+*Gu+;R9G^h)F`1w6?0Xp|HnQg2dtr4zD{f>;Lr&UthPVy#fXwO^*R z!Y}u}dajB05-H{r>G^=@E9BOP*5;FXNiK0TY7-n(sLnxg(EMyWl&?s01%iJTZ@yV>YQ#m=tQx2wqUMJEZK&1-%9Qh^!&9>vyEIwnYz2mrJw`L} zD+lzI$1{b`E!ll`3Kpl@*qg#&Hbpg(P2MCF^FReD9aS!_(pF?Xsnq4Ds1@xOh(yo& z%goG>D-w+)vizaeL_W$9=Bm|jFanQ6&GVy5GqUrr!WOzp3@bekhE;FhWcfhLn$@QDPt} z1nED`2zd-Gx>^=#7$sP&sU9)zHNfl8_rg=tWIOb@i;8!Bb#{c4j*hIHPIVI zOppv`4``UT)wfk;5%H0eX}?294yMdnpw+byjAML`PA%4%8Tc`v^D*;pclFWY+(ww; zo81Ay$6ZmDcj{2FVEl>qH~Pj2#Ju@@tD~b*;$N8$-DwKQW-U7hEtN)(CC2UU8ODk0 zE6Z1_2whZ3^)F$YzwMSXQZ8RvjeMft$8zK#&@HyjW}&+El%I)ihp`@Tj8Ve~rv*Xd z`Zc-6IQL9^DyU6{{4HcBFWJZn<{VwrL|p&TP3Ms!wEQi_8D^j4+zH4C?&*x}E9QEc zFS>=m(-gBW8)H<#!F9 zYirWN0}KW8^Pnv)PE`M)Y(*X?ccw?&+RW*7Py0pg|tEAH+{|3Uwp)`Mq*SbPk%(qTTHXxXOPX}v$GXSY!Gco4opNj;aYSl6~;{`ukh z@0Y2M$Aczl7Ih;3eB$cc-_RiVICz7H#C^NxI=`pGFtX#o#lY$7%7_>Da9WQChwlF# zjz(L*zqj1m7(0kHfE*>9-EK)cs$FuitQGw>_Ud9LSu7FQ66;<&cAw zH3@WO>wxjlgm^r2jtz)wK(iv7ooWLTpMzTbGy_55W3fVKcU4@|CD}T>^rt+|U|eNmNvEs%nqTY$SqC_zr%K0iH$mFAQk_&J+i=78{kTJQn7U9Se` z1t`f*$jng-pXSSD2}_;MJg_4#%fHqb1=Qvf+NMC@h~08eWRJjtdj-@b6l*h#ZR46@ zfl8J9U@fi?XGyU=u13naZTND9J6NiCr%! zRT%%wxlxLySYk}5ThwldedBNiulO=hQ9@%*mCMWzLf%4t!hBN98;j!irz3P*HWWv9 zpudNzrc{`8?o50_YNUU8ngvHHyh;DVCUH6P+lsaGC&;%Ty58`jp3fvr=I3+&v&wh#bLD?#nQwkv`X8fnz`WG@m%_8byz{}oW6uin#=l3sn7bp|{JiIX zh5;oQEXFeYWXJhu=8cih9{A7l1<+j83peaP@g(sl;DpsWgETyV&j)WC2-!@S_s{~% zW95mrC=V)PyTduuw)|Dw(!4Jh@y*FiTLqc-`~f}i2Q(;&Kt)1Hl%z$?F~c=IE@zG` zM&~OuPtw^y1aas-&MA&RT+_gaPmwZ@LBriT7&v8(}% zLB#Sw=0ZkD$o6*v+obo4CY|T}1|-QJ|A=zK(gCs>&%bcSK=~Hk`#Bo&;Xt}{f6QE; zz{AC=PKJ2R^;IKn)NIyQwfxkrTXGQtxkXs-K{gDcd2;h zmX<_uM7JgFI8{&8j?4-6kzAk`QXQ@g#P&rBO= z1GxGdO%ct}KSWO$;=o^lR^0+D-hIMxVG~HB+l;~q?wetI+;?X1JYd8J|BmTZ<#lQWBLi2-Bf9pkos=s|127g|B zDCUMlfR%B+G2=IxyO@GXC|}uyY}f~gHUy}2!vp|AK)t_iOnj9|3&PTXzj16TOE*w1 z{%)kNmt_lSyK{-+`spVnV$QZJ=P+H)v!Ea+*@4^qfOQ~Q*|u0+&oWy~r9Zzt4pLAf z&?xbJ)U3x*v$$P9KXd={RQV@<&UqJ8GZ+yes&(Hmz;%Ley-R^8R~n%KV=0+>=L9da>6n4%f_xT{%E%;e zXp0Cs)W}FMB^xyd++OcXj?=4V`}O%gp2bpL7HfXqHZX{O2{wQl5Qq~J%e248`easi zQb8aMtSTPt+eaCdn&vX_!$${?w#H~OBEgvDZ5Hct3E#_@l?lqdO=1e|D%nu1c%trk zeVrvVT;^%X|N55@JgjX9e>{9hb_6cwu)mnczaB~KBog0-a@AcD>T9{(=^CV8!wX(M zcs6*D&+C7$4v!w~J@60rX?U`5q{nx*A&krB|`@_e-4nO$mC-(*Y2}S+q}V~n z)1q-gVHv=tCg8eSp>fV1&c-527|S zW7=X2ZpYASyrIl=9I$A`XvaHWNuwEMZ5YN{NW} zqLvNI=bR@JA|#zKCLovjT~$QREeM>~7W`Ul@@nYeh;#Gtv% zXXOp+f5aysm1ea48_CmmoSCfIrHQn1i<&RCK6f7+<&3XQ4Kr%-TE2c}su*}klfNiP z>Ac1`(9G@0b3mJq!cwW#;neVleCB)FQ9BA%Gz^?+h=rl)BgZe4CULxP4DM5mE$wIzFyFYfroDJf?Zt8B9O$7;Qt>#asPaHbAFEh`ufG! zC*PbHXKc4zNx|4#>cK<)_u=EiFX=xIA0HfkS?nL-Uk?u+!7ne!mHOy$aY!FNym@$V z_yYcYa`b4i{}>+q@$lf+M~B~j{p9iE$4B2B{_2O%4->XCc6%grG_i_Z-Y(!Ym)x?N z;M0kZTe?2gs}|vMxgN-z6%HkvJ?aU37?q@1BGOu+00OT(irgFhZ1Y8$7@%$7WFm`6 zn3vZSh;?pJUI7#)YE5YLR2spfcFRqEmb*0YUcFQex;(Km-!7KDs*;}iKVerfYvNT$D+;hf;q;<_Y1Bt(Bq-TolC z_B4y8P<^j%Ex<+-I%;=_sRoqEJ&@t8Z zYLy5wt;#vLlBJ}#!A(1K-%)NUj)3e=yZh_Bym2FM+|)lAH}xR=>1XqkSuJ3t0{^?1 zr)ba!<8L;Dq7N{-aW?o+8d97l+lGb7TgBL8F8P?22d{ko5g4XFBhv@G1R?!{W_97Z z>_$A(FMisCPxj=>z1`p(*ugQIMhWdXSPW+{-r7{P=wxvJGklAHs3ecpi&wutxKSvO+9fQV>q3sLVx4mPLn5Z$ug_bhTf_#O*H&6-&Ciqgkqs@VUZS;QIWD~c$--B4z ztp&7Qd`GcK2|{Q(-GOv0Ng4^?z0xay&`CloP$+(lRd<*butg-Mfw?H|G)ZyHGV4oPMB!sgo#^5#XDQ* zbOs#=jzahIWzm$fJ}8`{#E{-Oh7S^lM1D0XFIE`nTM2aP}$7eKr0G^Zwqey~sb#8rvZymNJ0kOH3Fght&l1 zW6j6|93P!Hp>jzj;i1+pfLB#g1=yu)R(%J)VA~ju`|;+{3%9)_I<$(8c+`nL1`wub z2SjC2o0Zr%Zo|xK*fCtT`@5(RoEBW2*lqz#_rs59+XB<=tw={dVe|sb82->f z{7@h*B5m+Z-USHhrL0MAfU4Uou<~h42Cq!7UL$P-zAqalR;M5t_TiyTjeRKk`U!2} zv8WYvJwdNhe8I_J2Vv?)O(4s;5zrhimnzTsMIfF|4$t%^)nA=)ySpfYTO z0_r*n&NiCN*`*`_L;>!j8c;r5s*}i;%fY-D9IcH~Ma{`D7(!6oQSo>8y1LDEnpfg(xZ(ltC6$Q?MKLG0Iksl7Y{Y(Xmkqvt7|3$b?~pXsC6M()C4# zO5lRzS1ETKyvxudO{P#0WfFYL7;M&Q$@x}0-Kt5PqpmSnT^goMXLZx!r4ZlaZw7z! zAB^n>?zewr|ARlnx8VZW_qO}(AK`he9fmH<%4WKfbXb8bH-g-TI~t>cp8~oX`q9TI zxsomjlHpqu$kBX2f=u8C3qRy(6T2ka&91yTjc^w>k1zO%8(}vSGaF#zb0=}5g3gO; zpVXpL5;lX9Q&LO;`8m`Y@<7{_TtDan=W{c-OE5(o1Q8|!+;gUfC@PKR4@PoqiJNFR zaorEuMeb9vK`GDy!F7~I|1Fy1LFd4ZCV3PP$>@Oy4s}clg%i%HN+DV%Ntf0{VyoV(2P* zG?L!&HG+qeUC&PU6V%68jo?97Z^naL*E#p|jp>D}n_m#9G9}NSo9z$CF%jD|;pli8)z1154OAubLs9w9{5Gx1LQ;h{^Q``!yrI znM@+s2a}yLHp#Nh46WHbo&z`z=DjApsL9sC7ks&6W<6_d^(S)2;0h}!_F4>v-pHhU zSYcF0Ti5CZPaA8uqRbEUj|34ZU+$jsHT138<5Uk(<3q<}mpQ>-o?|Q)oBnKQn_kSnv5L`&Uxi_`f$|4^rVKY@26 z_HXdKaY}W66yuuBIy1`oQ}G(9V9o=w{aLOTnO{Ej2Tstn6yigfZCT*?EQm;QVLssR zeSug4gy2&=htL$DnS$^bvMYdBf3O1Pb-j?h@|BuE^cD#oR|f3` zpK(AH@kNmEHPlHw;)J^i9`O(}1}D1OXX10SA{!b=t+KP~8Us;NkzogU%g-?{pt+Q( zjS0jjMv4)Wzd0p9@o3P%Op#w)C^>GSnQi*2#Kzm?vyiE%4d!?51ta&7f$484fg zuxAsa%Ztf6kZ0jJ6YOrJe>Ostb~Z%4EKqT&IiTdm=suPm%)S0Jy`Z(3MtGlu?Z>N) zN)dFf`O$@Z$&sar6>rpmT&;eO7XACIs+WX*C_*M~wM$})?bpre~ zRUu5jO&!}4+O;iD4xD-SC%%sVJoqW?ZVC~Z>xOBXGfkog2#VtZDc<~>xaD|lYo?Ka zEq>WX59k(RepOQH6hFJN? z?^>hdJxS|$PDucfuP)-q%p~L8Q9w|3paKFGwWk;_%8)?L4Gm9_Aiu<%@~$C|k&nT@ z741n^?PD{`z3*{IZ=>E$bQOT>2#NZ={-U?=AZ-oo0Zigp0QLaSLQ;MZP=A?sLg7UF zOsr#RR&+4MR;oe2g~_h^__v?8b0ndEvP2oLV4%Senlu`Sfv+`+y1#=NToUk!>Uhy% zBnBtcGr;9B1j&vKAuz5LUHBGb>wv12uJ3pasyMG1VYs9f#{PrW!g6U1QGApD2o0{W+p7F5y$F%%@oK@!PUQiZD%N^{2p#hxFk7Pi;?L!qZ zL|``BvThUT1xUql4IjJhgHPOK?Gs`(hkQTz^j3pHAoyFa-h46wn3je@6P1L^1*zZ{ zMaaY)n6Ba#nO)RmO4zVd8Sa2ee%qatvH0M?u#B{X=fY%9`-Bntk~Os|E{GDDQVb)p zJ7R=E`9%@H5Q*cAa>M%c%n+YBSmtFzuw&)|)eYgv{YWjC7CWEqJZ`+r7#4Hg|>9WMn5*>|La$ou~?A?c1qa;Doos@c)m~t zgaaImIY?|!rjY zzOFc9a?AN&X_V!)(C|{70T%^5}j?gYT`4>2sc@j`4w`dc^mJcD6Lm_H_?&jG-QQiP;zC;B_^kH+$al!&@?2xG1)~|RNkFr=guHOqKsiH zj?hSXic^-uN7i!qh%JYwX=$oiDgE9zih#egca#`8N)${PC@i3|XZC8YBOll>?X+>u zkA|qda`*NAq}XSFo;Ekp-Cx=6{))4SCdKgd&(%}6vJ$S#|`-(yt zzA-?&V94S~2W9DDLz@N`sUMgx?Xav3ybnKQ%=EyEHdeXQ=Ov1DvZuGLo_;^AM^XHo z{SWh()nd%7$qYtKx6#~z)hCbO53$i`_WIsioi3#%fc4pV|^YdK|hAK?aUu!#;| z7o(t|avd#pbrz$!-ENdn5X&^*OQaMhViF|3RqZ z<;eFxN{|r_n#L0`bG+QQqNF$CHZ_?!WRH`|b4fSa!LUTK4&=q~MFLD8JeXRd1TTY* zlOwVNi)IL7_-;C0?o9h&b=)4=Kq;L$DcXjygSi5c#gvom!XB=3KI4JG*-&8s!zLh_ zdgKj+!j6(`DI~EC7N;1l@btrsqMQN`&3TGJL-l=K!e0?5#!}h(L^XXWY(;POD+ew( zlC)MFMzmptLtk6tlY3{Hz1i>f>s)=Qk~T<+;55!?H-QviHnx~r!o0T$^xU1X`f68}x3c+}|># zICC3-TgoT%gI%>YLD!ba1z?j?TkK+Lx*5`a-(jKgaA#sM{;2c|?93}Ei=K&pH&=Sd z7OKtkGh4>ll!BaoJpil6dtVt$aVInrB;h1)%4q)(KXPs$3e)V2dF zed6PP1@!&*;2!Dz^tBB8{c)o{2+1p9_MmjDA)V1$Eh~9}%ZncR(qT~3Aeuta!amLBE{furb=hwEFUz5t|)JLZR*hM{NW*7!_Bh_LJmMLbR z!9_y+Gox|f3r7iB40a&vy#QH;LBQbafY{!~-6|5+lJ3hd3OU%Q{YxC;jNZfV5 zw0GSv{ixB2$siU91d-4c^^r;}5PY&~FnA`%;Hi{hk6Ic4Q%yS+|1xC5K1hR+)IbKL zM3f0P7BFWT2r|H=3{H_X8Lp#Rdm=(8aUHZ>c@KaIs3E@q)zGlQjPrplYHKtqu=$tb(K46aAw~b-ex2a~((d^#Uh2c3JpP57JpuYYs~+-Ls7?MgSR{xVz#wl5>ylfU5-b_?Pk zwv2V#C+4R#;;KhhNeH!}j7J4ZQJoYdHfB??+t4tue;ti%Dhnz?g$@G(1X@gA3c0_| zgxEwx4h_9|N28vS)!F?AZwGk;gSs*T_ZkTpwMFl`aR38ZZ`A(zI87LX%EpOT@Ln$z zU18llmPaQ}UWz0Vz*@Zud_3;(qXAvzoL_|Co69 zv*2CU2$(=S@%k6R>%`?ZE5Y)de!cTP1Y`HV|BJ9S^=vh-6R-V8@R|@OmVJ#5$HSaz zq^2UThjV+& zo>H+Q+@8nMuRFJ(=X108l&sZqwI0~>CP|Hh*VC{00=x5J(=jF_Pa4dO6bMcE4l_`7 z1nj^5%i+=E^arosB;NneivhyjM=7Nr&n=^BqOY!7y+9*iimP*D^RSS8W)`{5Vad zfnT}azIXf+V#snE!vbK|A!0A8DSd1|XA##rdTvnR$$=D=? zm|gS)SV_u_l}(C<=9v@vZVeo5=b!qOdZcT>Q2MQMYg)j$?D{+O{fMh&nk zoxtX$1!|F~3P8%VvYqN>W}iZWiKVG^GB?*dSDEk)o07@9c~0C(L1=i;ds=FK60+%K z0Yr1xmqmLi)QkAerUCG~+|#jlzQ$LUHpGV61H}c6$Vku>c<{rDMiSEpH@`9ILQzwC zhkg(ZeK0g{`8Lah)si3-_0p7Dir7$%DvTr884MigxJb3)F$>Ii*iuL$Rg@+5-vPmc z6T8_0cY|IDa}R6RiexqnAFP~_tl%x30ThG>bHud#od6imO49XiaN3wz&FD@R%%0Gs zf<*<^SmiDk^*H2?gi;8Td&>+|O_2f9AHt`kToM?1140sZE|0_<1fK-V0;DPI9qv7Q zc4$lzgd6c-HunPP9{Nf&2q_gH;fO)8*c86GfVXK{%m9vgV=(XY!p$W^zbKnGdcU0R zTSKN+*Z%Vr@-*lHC1miL5Ll_snY=DeZxdu%U^!)ALOZVC>5 z;#xEt2?~5*bY*T2AS58VJD*^Xd1Enq6`fJ`#6>yOUHTa(!(cP(tZqHBo=H&=W>#Q! zMu`Td>~B1wGVM;L|%hg(~ufbw1q@ToWn}{hupNn8?~M%kSd6n0_kBYUp#4x zX;cR6(l_3-y7Lt*<&{m|!k#?~&0L@_yB(gowS;fF`)~idiTe=8_VwJkf|qTKU{B%C zx}{5OVowdvl2t?>!JUg&T}nyzmx2JdLdIVKt|)|?hexa!I?^M_um&P^$yOEIJRQ4( zr1v1@9{K(>6SElAj0wlKs-sYNqA#_ziJ^{L;&j=!7F&XMCsHwQJx3CP1u-8Lr#3wR zn94-bf`?zl$+p~9xGb35QuIRJ=$s(KZM7vNdy>#;B%RA_E5ZDZBsD}B4w!R7jcORO zFv3tJf^6P=!fP|Lx^GHal5HuTja{<#DctbgY5 zJR_!Srkp_Xf~`p~g?QVO0*KZbNQNl$P@Qf^ld-Naodcd0Wpgh5LbIS7-&rAO%$iwY zL3mAbN+Hdb(UFZ)LR`HMP}1B7qz}v9V#rf9(`kc5wv?w1J`==l@s}=KcS{npV7F7v zCGZuAmMN!ALUVAv{{U(voNqaMz(los=ybn_(kP)KY?v2B_xad_HncxIRQf{u)D@-A zc}MCb0v*t@EI5aAYhw`3F1-vKM27$c%}HX~f6;NzNAxu((g=f^VBykS2pr!o z(77lP1EIT-9|Xgi?YMGJ%wiP+Ov))gF|&-cUGtoEbb4(WnrglAfW zkKecYW5;8|7gkWt^lJVpf5le`k^7PY%`*y60&NzgW6XvYFcGLf*2ZgyybbiVB!vwk zv0gG{E3K@ZVQ6Fwck@VEAdku^S{$jPDBxS!3K;|jxl-Q?@HeJB+>#rgd<5OL$Ns8{W1kqYJ#6HUZJySs)rzmUvK`YF6Z{U#nN~UEt43G-b-;q0@rOwuu8x zgnY~r1;mwc4{cV!zS5&e5)PUyn`HAie1DhLZBI}bw>D8(r?EntC_Upc`BS*>VBWX= zX}O%PAh9M#%@c-|jAog^7>TVlV9gcH%b1_Gfqxx7gxNTH7-CvbFdaU$ub_=XaX-;3 zfNyf|?B#o%Qrt8D4z&94Vdow96NAyz8Y39qublWV^{!x zm7!7+-sor13>oLik+kOpXBuM;Yt=O5XT!S-=FP8(6RXxSkUuAB~ulp_&LmmJLo zlP-{63Ok5Zvww+BQd{D=$rwQb!8pHeTSi5BcRzOO&O>tGBsbpmjLC0 z(iFdt>Xi6(YE?Hg#oW2&gGwQq*umy3G?c_c0>3F;34bg)u0@Gex42}Knn;Pb)Z&+r9{AYTM%q6b&` z4Yz0%5)A-nEBIM;7^p9cx+!fxIAtH3zr`OxLn%I;Ak}xp{9^Rsm=g2CRwlYH46%Be zfuD0sQ%e;bdSFzSyF$4wBtZ7|H%FSWB3109{$6w zG9~09Rz-3gDWs8GFnq!}WqM0?Ya}RIC=I!*gW)4Q4xWtS@IdB^M60hfg^kEoSCFZA z+!>9_TF7!n-6mqQf;QqmzNEjTwHfgzK(LIq7rr62^~;fj`gIyQCe%--+Vlw9$satF z*~c*C#P&B6!;(>dwki>Y?_ilqw4xyAMy_ja0j_9ix(@LDwhbgJDM2#+J&lTb-)UIH zZOw*2UG6xmI1;-7&`Y{<}r zU|qLbUk}~YWl)VYb#TG?TZPI>f-{yE;E)!f>Dm*BN-sl{i8=?iS*Lc>St}N^xUq7O zL8?%_Hlh(s?K>O@8eY z67?O6t(nB(f=Ivy$gJRlV2%Acy~cj+)L2|4&rR%Qc&X?O&D7X1;&mYVddtz(#`>Py zuY(A{|Mre^%V+thQ9`XqqY?b`uiVTkbCeme-PEW zW%A~AM8bdHNHzR-ijUT|g-r;koBqB{f>)$NqTaAHM(TFj89?3*`Zm;gq~`CLKg0dH zL0b8Cc}v`^a3oL>P=Ym_lT6p&j`V7E(%TB8Ucxq53%O18!iWA(dlhDt4qkT3C=p3? z3pORPf2~_&8J0F?E{7=1k$A_Dv)(G(N@R<}a(J9^b{IY{NtDpNTb&w|YDwTTkb9!K zAeEYpI^#|X+P}HQIXoOeTQ80WdpCRI!QSoO@cCr=Y;poxv;PI1z zW%KHcr!9Y0OAH(HNkV=9kY}y0*gwKG<62>?EQ3R!#&=6sUpm5~m<7?rR zxrTSKthzFHRVj7K5HWl7^)<2rBI0N6#B#-%MTC2h&3a0<9O!?Nb`1h%X#+R(qjUT4VNdAT!dm4wN+~1F0pW?%$G#O zt&Y9e?I+xU8LM|(ubL2DY3mG#PqVI>Uv4Me?g(G1H}*Mo`=TT#IN~aM^7gKAN}utj z+Gfg3Mw>3PVmO_Vj#XUY^-$Q8P$NS&9vqqvPhlk@Yd;i2r2Qrvn&$Z#G^>l8lECtp z2l(ZOaq`=cs*S%$=I&#g%+z1`)RU{Ami|?aYckYd0wx!qI;4ls#h1|KqS2p1N*i+t zF*6@1(!nknn5>JG0iCCyt4*B$4R;Hk?>L^u;*#~x#rd%FolJ!H2hr&wtyLBViPlv$ zY+dsn5R)m}=UZ8(3#aq^s+ac}?UgmwL(!AF3hp)nqw47ANhl5zh`iG@r?r2~U z+p_0K3Tbns!{>wHXl?EWMPxPcJ^Fm$iS#y=vPDbUgZyA}Fg^H)7WpFXqh(|rxQ~(I zl8$#8G71+;m9s-3d@F}DM)L&u>_VCh0JovYSS~taBI?E?s2dN;6S@+;x1aO~hJhZa zsBzc}_ccZh`$)v}4UHXT6zU4O8y4l9IKY96nhlP=JNF&(~#q{P^pBc=R8%IFe`W(qadj|?yLh)-7ku{xN|%d4d% z3Q?MwO7V<5W!8H@v++Z|gi9s@W~MEr_Y8@*#i^ckDCPr=RnnS>EM$3%k}5^jKTaEl zL*C4v15<9qsp%Il&U;P{sLs_KiDQMg4CY@b)I9js?ViweXkT0C2#qsCrWSzeB`uBR zWmI1xr=lyX8PL;gMFyEMiEcrGtf9;iDAFc|`FJoH;UN_Ma)G~$fkQ3z zGhiioJP*f5<44^?8U%BZvcg>Dl;Vq`X3XX{Tb$qsHQUpoS@;pEN9 z_b<*~ym@P>>&}OdLgK;v*(2A%XC4bWbbmh{bzXREe;yB>jCy`v0?*pvL;v$3{49u7 z{M|Nye?PKqyy$NuPK01Z(ajCG?2&$#Zu)pI*!-RA(|GW!(Yo)R3OEn z)o%c;(Y?9Rz$lewKBX=5NspEPrDx@9&tXiX4XMYXZ&L7%(-Ffbao zO(sPc@^JX@;X`XErd(=sJ`VVDn3YY(&I>QHtyi+0F&Stz(8zZZ`Tii}nAl>jlz7o0 zCBaYa)|ZN>=adW`K_}k*L0nMhAd0W*Lu&yWLMV{<^^?RR4<;}|HF*%Z) z#{|9}U^F-cYB*&d%{ns^Pk$EJdLnJmP54Dg{4b;P;+)uo;GdW*iuRYO;2?XRK8E<13dJ`1Rf8}9_#aTT&g+TksHrfk4A@IVWh%MzY)R-QcZJW^#vwZSWK+I@Oewk}lPZ?#x3| znHL(83mhgo8pz#bLv8>bel;D5Dh0Yf!Ajhsjlm(e?iby%IiY8)@dbXr1r-0Wx6^*^ zp6D*=TAL`-GPCZ&y@{{+jpZ0Byg5M4=Wc&jw^zWCAuVu<3gVqK?Wq*SEEgs+j8^%r ztnwhKI>4RO-*h!-E`!kbaDOP0;P9&iAH`z|U^!VRY3twz_N<&DK0jB`>7iy0VFyDY zwv}eOEGK**JSPH4VBvy^az`CAB>A8+yeaW}x{U_;huqy8F$o;)? zRd{zNH@_>J@Q_%UF9?a!I3`u8(h$gjW<<=E`hKq?du7*GRdzO!-02Tpuv`Y%x5YZqh^ejaZ5|cm!d?GqV zjR}ASokN%IRu24iCXJ`LyF%^&m|b23#1T~%yh5Oga7rcE9$3NR4k7alQscn5GGxNU%YcoeE!{w=f9KH5kI%t zhZJ??b#i0_Vsb1rDuNp5&Y23#(k%c?(8lWS7m-E;W)ldsDHdcivhGax5m47L_-l6S zS`GTJgb`~R@0KqGI-5aCViZyOle#PctVB=*B<|=&RuF@mUUtAP!8~Cfz;j-aWYoii zV?@x1tQS1D$KGLP0h%t0YckxkPS~O$=fmxp!@U!+TYM3 z7U&R}@46tVeI{fs+FQ|)m$+EkiU*iB4)*k#O5uLkT;L$3rjQbQ3K)7F_B+3 zy^ln(N^?yMyqJ}2Js}OKj4D3F064d%5J$)jrOL60QHI2zz9!S0s7mV)IJTecAIkaC z`+iRgNnTJXZuCZ++!00`+OeN*NYHnKA$Ib&M=XP2Mxi`-TmH3(kR<5P1I-Cf1aM5M zV#G=sMNpAV7jyth4-G0=Q8guIgFNlxC4pS8clJDbnN)ylV1^YZ}@Rp2n>TyrCXH zH8?lK$FMa79F!1SP>_{a2As^KFX;HL=prdcO}DGaf=O}RKIM$ffNAn}@{m!&XfXHU z#{}?VL@I0@l0{4sQyWo5Hb}aZ(7}e&(OhDr0o+fbJ|f{Sd>QmqpC)cy$)gk0<~1Xs zLja!Lc>&w7quYOf`s(f3NvPM$GpmErxQJjf2vWIfH2FDLjquo7Ej$z>QJ|c4WrbXD z2U-7{VTyvIhdv*JtMjuRCE0870f0$Qlr%~w@y_GcblC4LqU_uoPAToRuR-rn`eh6yC zm&7NgT0Z8ab|;wIL6LMeyfnf}<5M&)JS%73(Rn)s9r=QeLKQUB(s^UUE#Ff0UNKzD z>vhm^W)&uP$FMlKI2g0?s=EJZEHNK^;UGwJXYn1lC7)QAvhKJH4w{!WNv)7ews|K~ zRq3z@*ATQr<_fpBYhF#j9kEvNJxB$w%pwU}UtHrfn}clV@!Su6Lhrm9#61EAW-iGU zqw~0V%0eeBEgW}^r9&QkYFZX|Ob7$x)j^D%O>LVt#G$NkbVt@A2pE&d9(bO*xgrT; z@9eTv>HIQi0OXDP0eysY>a|4!mQ+ZB-n8MwQIl|$iEp3xTFA-L-4n1rXmysT&X!Bh zYNnbKnH@L+9PNQ7Nr1TB!*9(B*<8vaD#0vbdl!tZ%v20e|n8$WJ z5+BdgAJ4lVXWfs}-zMrs9=_o7wocTn4+EVSdW|9>DB&e3P2Ez$ANsrhQnar0_lW`M z^x|c*8!wankh#oPH|4y}Z0C{(D>4x_Y zf@9K>^MTj7+>;@yic99R1tp$NE6!aly-Rc;Odu<1pUH}-#6saqT()$OR8a3Ad0Sr< zT`?lzTkMz2*t8PL6)&B}83LYfqfK{FwCF0fdrqFMkrVC}Zglja`ssV6M3bnoN!8eu z5KXeyCRHmPu(V)x=*XyK<}Lt^Ws{;inPff2^xq4z~wZV@=Nh4Gu4m1IS4Ef zMWanXW)Meyh?!==Fg#;d-_QpAcp+(P9B6W;$M zZOx*4KU*y8*=p)z>Cr_S?KrLt1)Ci+`#jh>XKFkZ$z)uA9OW5o36{`Vy6oYh#a9DM)D|W0v}{jjeP`( zSLh}mZTTQCAMMVizDYP(aI1;ojk;v703O$MYt0WJW68C3?Os-ErHq_->+#HTZ_zqb zYl9ME3HrkCQdhG*ytB@|;LVHQp1wVM^QY5S-@N#vy&nWW1bg7bx7}y$64xALS0M8w zx;>d~kgxY>WpDHMFnP;@E>$(eiUCthrskK3_L`DV!pMPRi?kLG1@Tu-I1VreAxMSW zg}93%d$K!zfb>ZZYW6(cZDvQ<99l+jp;TO;A#EAo;CNqO}INr5FH^yCFF#Sgx7>wC@@ zyyqP}%PDK5Af^=Cg3t%WNLLqszEbixg#`j9CzMOF@ci@7kF%!8m%yo~#3yd#PT#pj@cIwxL}K;aiKuBoo}VyDxrXqbbLPBTYLSy! z=+Z;K0aL}2T^3okaBL`Z5?HJF6W2C8Q89s`D4z7Aahr+z5rQ4u!2Wr4wGe)AcQixp zAxQh=Cyoljp_K@f){iL|kpPL1gEyu|oE2Ufjx+5GR-wohM0SAZ2AuD7;R(O=`CBO{ zv7_;d^9%c_Jscp3(6j`KjmfRDaD@6QzG)Rze2{Q@eh;lo+Sj@@j}aOv7T3XSMHiL6 zdE+b>^%RY!^aDEbk)YB0x+r{Ble1=JYwDI|tK4up3__VA0Da1rm6%s@XOlxW=g6GO zT@ZqR-jts_Z}CMtjQpr`GNEmVs^Huvli2{JY_D=NSn@FvoCIi^eIg!Cc4GX=*l z(NWi47cK#WL%!vK=J(>)iFlox1a6}_oHAz3c;o^#>N&|V&UlVxlA@r6HZt_su6>4h zdOT)u@dcINL-|k%p2h0PSW+bW9Ge}aCY_EER8z2&7R2Fu%ii-VPO?(*{ucHl7)G=T zCU#tRO+be5Mtux}Yh-hDtD$MY)Iz6C2Q7Ex9h*n&*zBaSMYIwLe9ei+5Rfk1OF<^B z;e1m2PZybh23bT-B;h4&k_7@t%d}z0+Uh!A$pI7B zxVgf&e|mLx^2ex7df2U&>7c0g8R7DjYlTj<4K@Dh^u^2Ic7YGNHMNS79}L~y)op8c zix~}WiDr9qx4u1n`6B8RJW4Gdh}PMcNFUZFNxqjVBi(6G!KT0l5khiaXfwi`u*v&Z zGD0YEl?zPHiNIh?Bd529KPd_G^T-nQF;@p1WTcqoaS!j=DI5xu1J$+9R)Km~6<{e@ zXL3^8KIKV;RHPJRf!W$M;$mR5U2#eo+7c%U>HCo=d~~RhJIC`D`KE!!2mvVLY{J2u zFfPeaA%__!V_PD5m$=S&1Om^*S#9+;kg0^Duid$EMa_${uLovvP3*`M05MoPhQyp0 z#94tyLr;aLk?9)C2yk)qWQ}VIstA#E@L+>yY0>#=5r0O}b!4XVrx>H#ST_eVTUo96 zx?olGY>2l+9|Qp#L85o1nh{0zVHt&qGbKb&P9v%o9uL}ps~y^HAk40;>Un*ETL3Ow zV3V-Ta>~&kn296>I-xKNSRSaiqWSx}pgT7LS6hyPQPSRs?uv=DqaW=ZLm3h4rikZX z1k7`SQ+MkhNd4HITavF3*w`hDVen<2RZXv?7C$?H=r`g>p z#~q}%a91v5d!i^Npcexo26Nma=nPbm?ohrDhYtM#JThY(nBP5zT=X|irE72EflZA7 z{_DP{iZ|PPn4sirjj?&h-Dx;w#1n>yklTpRhu4Eh3wy8DS+_*9_1kPPB$IkKc=mUx zAUAy&njC1W@>ZJR8o|aQR8-;iovoCi%pmg>O1`vFbK@EUisfruICyoZKxRsnjYeU1 zEE>jnKSZ?4WhrO0l$rc-c9->x@s$WAS*{i>DgLNoT<5ph&|j}{(F2DT23}kjy5LDx z&CnAGOC9o%J7r{ghk@y7|N5ivQ%R}h(tmH(J}&*E@!&meg2U7XaD z477e(1sy=>=6MU=eT9u!C&)8pzL9OU!LSM>cd_c4cSWBnK;uk&oG# z(F~Y8JSYbAI%jBOx`(U4H@_~LQn;avF}MF5mztBb!;@}a5IMWsbW0dJO#%XI0?HH135t&wONCg{bS!MZrahXqw7FqQ$s~pp^1Sfs20D^i+mqIui zpJu;l7QoFkcgN+ky?jxYdtd#uUylc$FNm9yq6~lj%@^?AS3w%KrR1F(^BqC##pw5j zl*dv1LnA0w6VfbE+>$ zZd~O~b7VsGe-k=&Z4zi?g_yD4S8gP?n5Hjim;ggFuj}{J5D0H=qw$FZ1|4HSvgQ+E zU(-b)j8foC=@>c~%)6nnEZ_t-0f!M)uW`sf&A9vfo$i~j7#bqJgysLx1%24AAa&_CVo3K6Fi>x`ykcE>Xa!n<$!}7&h`E((x>FL#6l^_4 z!ky&v>@{OCnv{1*0;NHKvTz&;kdX;nt`k6Ex;J-XGCxT{4ObVZePWZV0XHlw> z2XEML`rATN7OZl1Gdi~Xsn3B%Xvr%(4mp-|t}|(1hEQwpHu>wAQuq+$+w;bNdx3+) zSwrwk-5+BR1?_5b*ey$w7B#DB_4NFw0nB~>c^Kab&k6I(0g>J12k52e~yPTOfZPwl6&Nu z(o>+r#8Vs)WI_Ji*!b-l4wUy|oDnBCW49E2S86LTzhS!jAcgDmta}|hdwcfg^wn>J zcyxNyFWS)qz`*SGWFvh-@bVB&B@tG@Uc7$Y7TCW zzRexT{aFWUPxFf=Kh3E;5(an^5D1Hw=K|Lh*xqk}LfXuEJPnk`9uHK!V2rcQ3<}uy zoHtj?oIZ^*5YmMM-IbC1OX*QnLGDVxr`?rVMXmg6v8>4);y-7CO!Ubc>Tr-9asVn! zS8`~^OFXeD;;La!?@)axpJTGJXawZ?)@fG;KpUBEy2r7qd%l{Vmu%%&x`VxF6jc75 zPZ@#vJAD>U55!K-05bLXggNw99A4is>Ag&y3NKT~!a?9xfM3fgAKmkJ*c@}AJy50L!Pa{8@aXS{Bd1Fr(nY=qFY>suaLs7R zDP`JSRRd-2hhhnrUIrGpkFLP*08-lBIIi(ZB;=e(8b}wI>ssPS;r{EC=CShdumzN; zErAtDGJnNL=CP-SW{MV%cqS#K_0|JyMCH_AG&8g&Dw_aVeDU}8B&kYU&mm%(t_fu` zs~^P`WUQNdzeo@ji!q5y#4X(upakdO+C$O(k}COUri;uI;mJYy0N(_hD`B!J696=QZ38%MTbvE46*GZEdHW>P|P-2RP%nzO5_# z{&loI+=F$4ShIJCH?%*tt&fu6-^#I*`hM{mQ?ny z`PJfh>k41LiRycu0N!`1d;Lag`}@{4{jpQkAGfNjxS7sZ4S;5Sty>T1+wUUD;vTH2 zb6%W7AW`Z5DWf@WkKzBfukcM=;kr&PF^WE{@xs-35!V=m*rqg%ZQ}RtZnc|RvhRT@ zJ=QqF7x9(zQ2%)Ax!9u^Buk}_C;5Da$7Lt%=&=tvk`#9RBeQ`4c!LJ!M8-w)Ici}Q zI~cZ5#!y8_=wetJ|0kCg89Es!>MtlS;fl2^F5nvFJ=xbyOv;svY|~(@fX~s|s+4yO`v=e)X+z2u-HF4(ki&Xf&!1-J1a%C|-NZuA z@S(DYQXENnD!xO;r1^wsVM^r!ILFyQPL8zW&~_B1k?=L*4*{1{)~Wg|XtI0| zWq#$}@~>(=V`AjwuMBO8SfhV@dG_W-aLn?f;4Xd2$te(eWqG*0ktJXOrLG;5j~^3) z6T^yNGZnML+!W`4ya~zdG44^RS~f6zN5oxc;lyni@&UZLdk$Dd zf=HAyf7lyb>M5CRc%6?ungw8c8=2sC_9DMPi|cA}?e697Zpe|#skoxxn$$^R21u4` z@(e>gLH;Tau*AKZ)whmS|bsz5d)c4V?aAuM4|40S|$ z0f^1L^F6?o$N&4{vmS9KmXx_LVwR8xfQo{4r3#Z053Q841%)kYdkS$Sw2}^N;t5xx zg3wV5UjPsGOU%sejV=Ez?QcOg__^Wz@rge2*UaY*;qeMw9 zff;V%FY0GlrK8K2gA(@=ZKW>>yDm>gl2)3@8q>RyocVfZEs2`<&xX3 zsJjrU7`1DNewW*krDq%*W&-s?Wx{qs-|254vQV(4-)A0!NliqO{#kNV(TrV1%F%e; z;Pz@q_C5*G;?YoP5*JW@j3+QqfJMY~MX7Ws0FQO1akK@x%QiQxc}k@3{;OEJdv|yMn&ku;B7uJ6qL7OPB;{RQ zJxzJDKscP&b#HVGN@EVw(dIuDI@`~PYwL@;&gNMhq+*1DnX*0ycw#S2V z00x_9gUbEq=bs0DD{yK3Pbju*sA@Ra%Te%7T45_IbP-JbHrTVyFZu{IXy~5*;UE4# zp%0(aK(w{3zUwZN7WlW^$6r)|f)*_PaL_uR8pQ<_74)!lKIP4Nl+tp7$&#HAM^3KM zCALpm^YPF!Uu@C_6CPGCwn%t1@ClFTPOG4hAdOLgQ{kKax?DzDOq{^z)B~K)okS=$ zdcqYO=);y7DDJr)=#ZidLBL!q`Lu+l7Mz>z_9xU;o7@4RjT ztQS7Gm(}U@TPSj!{`4GQ$TgXyTQU2SVjsVonFQ;6P8l9a2%Cht;uO~iiP856GNr)0 zY#7G4SqCVSiSL`V0Ty98U~PepSn#=1HeJb?%kwQ*K*{yls`2o3rHg4X&s(&G6Dch? zST#ovsE1_FFl)p|gRlh%c^FBPt8%w%a!Lk_<1q8ORbWzZH!F9hzNTO3?1wmlF%rt{ zi^XFh&?Vkwj5$*f^4f#oeNOU`8kbl(MC zemTm{2}{j3d%%>u@T&OJ)z(FiC4cMu7IE}6))UGVU(8Yz@$S|TZ+d#He$(MXR>16K{k!C7R77vXa8{u7&ml(@aZRT(kJ4+~Er$GtK9epV>-LfJ2s$ z0Ft=g%SyJx;K{+`gGYjTf_f!681U0c>Rb1ce9&N^RPW-euiUjNl$Z4Az80Py=~Qg* zsyj6QeU!$%Jf|WkV)msHi63Nd_^3UUkSa|k62Qx`8kxYx>AuZ*sr0Fe^WZ6@x@Ln2 z@RBO?NbTlclm8SLmDeq&xDwrhE+Y?ts7Nmz@{lFGR4pk4c+nse{XZA=^5Xvq-KsDC zpRQMRDl?4CtAAM$lAPVD&z^1T!hIR}`(Gx!{Xtc8N_Cf4)@i(TZ7-tQ5_E0d+N6WF z#;AjvJjQPHopKiLU3jwf)~&Wgrctq5sN&D@#iGI^(K|3>HMtjECP=X>LWns5_8~%u zsS^a53&P@Q<(Iqz4#)OGMXgsC^9Z~~YIT^0SOu{-i~u-1LM1lpk}LROs;1&<0YMN* zaerV2MqDq1A3#cXD>E?KHIy7qPQ<6)qXUd-B;z6evDt}UFK)x7vbeoxt=N^AS|ea< zD`z+KM_VUCgBB&vvPu7Jr7V{a1P8H5){JuWCKj*a*fWp>0vu;rQbitQzt=^{EDV}p zQ3@gFw3cP0NPdIN_a>zgF2hNQ=)&pcs(KGPrCMOE5xCC{kN0Sw{3j?311A4th>MHHUUpvM%0+Wz z%l(7>gsA3Kb*2jS2Hp$ zNX|Ump~$2`k#%-UjWJmQNFz3A#agkVOyp=sm<76kEoqG0V>8R>L?d~eJtU=sFj<~V zI!pN^6{OZyzGqA%g#Wp)vPW8%;v@Yz%^xbFFN>4_yqz($3R=w zQNP<|%`7>cbb{%{=HdTh8_t{e08g8`+v<$dVVa4e*@+KoXpnjhfqc-O1)$K_WASIFJHcRF4sEdJ@;`jU}2x9Y@pNIDV*mK z5w|J$?b+)e!cyP1d?`tdXn#R(Uc5a!c@wqpO+jwq-HUtv`o~wD!o2%f7;p2ddQ~CZ zhn1P3J6wJ@xplhU2+kQ$C&b0Mp|Y?0Yg-mzv7V7D3E~`PYJ~2z1M7xxS#D6!2>93G z!=uORXXJ&<2rsrF9qYxy261)P09YiQhKxakb9^0|(@m#4&O);cFL$Hr)&4}HI;A-@ zuQOIEwG)Pf0R zi)ny@;tsAI2U7r!0}y8~vG@2_{%8Da;|Nef7&6@6VF-@w5FCBdArOB5 zZ!u3alKNwUtAXl3jmTPXf&@(k^A>lTw~QQe;nV1n(LG<7-;9&kdAvkU?1pa5E!Q5d zuF0?y&x12o9^PAI1afx_g0katm+l*%t!9ySW2SBms|F@hr1immG}UvJ)uNw=fqj1U zvM|Z?KJy;}ur{K@F!T!DrdbjXa5XeVyI~R#X&TJ|KD&!mW1XKs%I$R&5MMPUxyhG< z&mwT&4=Lg)qrR|}=%@ETtC5J4%hC@K{hX zW`#Xs=OJSBu7r5(<%5rmi5Hrsa$(4nhIXu(L{!1>k`v9O|Ka{jf}eHDUVBN<6EVmm zzs#>SVcW9EJ86kw;YVI^W~=ep%8VVQY^a!XPF>1LG>^Nqre!NHq3KtXcmt;!8it7J zo`~+G*s?0y5@niZO$MW=5ZB>5Lcrr){!;eWz|nP{ujcL8l&MsD%(oH@5DYZoPc{2q zAt@1G`ZQ!dVG@=?E0HTW$cAr=!WEJ>Xxwh{f@h117Mtf)p?971uFTu5_G1|hP5B8%rCcLO;fGVs-df&G zke2^f3Q}lI$L?yM?=+Fahe#5!-VR_2-x9fTdcJn(iIH-krIKkarf|fy>}!tJgMpp0 z)6LkhqXHxMwDB{rdoA$CZJ2=6;O{o@hg*Mq<jaSp&`oxncjC?qoMY@iMCK*Zo07Zln9O3XS4^z<1&j4I>l37N{n} zI?$}-7K*sOGn@hMktV1CFG>#sR&SIoy_4!Puw4Uqon70Tw`mF4<#8I~lTLrw^~l>a z*1qI52VVlZ(7$s-hyT9QsGthjn+b&!jgRmS_&Rz(a@lgrwQD4~7O9#l`cS>PLAwRzPKLDSyAO1uzos9iCL01Opow zXUN5QK)K`)o$_n(`?oVb2T#^d=5gy%$Zfn$`PUnc`l9=W_1{B=@vkQOXA- zR1}Cp{~WOTW+#Ckt&a$UlqcrpUb0XQ=M>T2y{pg&;p@u8h`t#3haPf6VR6p~Uq0TS zK-R$PdLOPTeu|);5#44a&o7QAVZJ@+-W2T3U}YuC&erwlXkA^MtIz4Hvv+5I`eDn9 zkJ1MM_|68aDJm}O#>t<)a+SRJ?Tdh8#6Pv3S##$Q~~-l2uxJNo~X)KSl4os(Pn>*Hsa9+&#JPo+E|T-MSw2R5CDX#lJ9il( zDlr@)dUnr4#7+MsLquiM5Xn>!b%akj))_PU=uQVv$LPq9?s>>|u{Z8GVr=NWL)Xz$ z74;pT-FN57ul8wr&k?q}cR#Ild?JP8)9M;hx@xv)t-^d%P6@e_dW(^d-MyiY?|FQ* z+-+>C(P1>Lmo;QEr)14o((da)$cKUy!~ASJtBbsyHoKf7y4dHT+xJ!``mDkDPl?RS zl@Elj?Pt~?Lv{&NztvE(XqWHQT5|342Sh*Ndiju-a}pZDR7dOpghmlxG=x&r*7d{0 zY@OO&`QVIx=fR?DhI!jm&T9#e^n+1qKlNtXPSYVJvjcWuUON&y&5NLi?$7&j1FH>n zUhH~LhArd1x@a%OFx~IMJrx&26t}?Hvi^m;^FX6r*_arQ8w9fb(nhuYk^;BET;AtH z(rBGMYV9sgq_ayKw5Obo+c_a2lp~n7ddIVHlP?1bTpu~sQiSQYk zHM@M?*wW1U>;%n(Bwm^Yi*~2afkp0GTpKa-fG<{OzEk!Ehd#lN%F|2XMXF&VIS2-7 z+rcF+Dj@rcLvOlb@|Rvr{xWdvre`HzwKa3XLq6D|MQ)S;E{y{Y#~;XXOo#!ILU_W@ zalN`#p^*))5NwiAig;VU$I_nR+QK^w{R|sH8Uz`_k@};oQUQ8kvk$~XC?bq~UQ;|^ zW|O>&0QEMuu9)TK?a@aQIa>GD59X?obhgZ0ONr^{w|vrfmJjJ0e67OBZ2x(-s@%Ag z=cUlKkjK#g=hBTJ#2Rv??UdX&l?>~}n>TO&^y=*7kM=8l7<`<}XXRe~{>Asv$L>ks z3_Y`m7C4h^N_xXU*9_vIf{ZguVj@SANH;f3kzJZ}kC?|lf=$9+VGqg(a?MKCU0_gZ zm}-olAqh&+CIfpI=~h%9%4J=FEXYvPo5eBNFhFlkzxm_4-@bhP^~uY(#%D&Yx^S1d z;hyYZsdkx4AN|&?ek9gcQ0Q3-tQ3R$?F{b268Wedpsv} zjPP*kfHy5`O}`$nWqQGngQv3wV9O@efN<;Qf=-XY>0y{ROdll1ELia^0&oBHGYSgB^j`ZEW)qLD}}OZ9}|$o>eu)WxSC`!w#rR*$48ga9CH}IgS<7WswihQeTk<__s}31htGMga;LZ{ zrYj-HwSYt@j0ADB;-s8)GFlHAngP5IazR3Z*Dek*d96M~3&j6$ubb$zPVw>Oo74MY zZa@N~t?(pT$5cI)wd6Ngkl>isSb#la4U++ED~q?Yz_pi3r8O4x5(_xRx%t!(i}{KY z&-w2;f9<)A)-V;@h)E8Z9G)?pO|>P$`hZqKyC65rTWV;Ds12GvfML@EFce6QDPw1l zqC$THRnVgOoHD;ehNmFAubhL#MpA^FrI?k2zA78Wr@6g@II5gTO+tNAZN%v5Kq9+N zsG$ioYs@jqWPlX+U z)Y2_N0ISH!JN!>X@~|s!KWr)%WCxOfoCUDwaSy-MGK!b?vUk zD63(4hs4vG+@cJT$Nr81i6-LA5>6Q>;%TK$hVhrTDC@~kdII`GI~x4YFz>1R67Rha z+?NjqL#=NA2(65R2RKc^FNY(;ue@+K?e=`Q_lst*KlnxS@6}$)CI?1nSiVEfrUid< zc8$?a?;nmvo?2S7a5U1)V>bZBLV5!m7nd+{UgOq{IHiHO8xv~8oX;?of57qM38bXV z;w{8OO{ivL>dkrAm8=i#aw6{c`7In;xG^-#kn$xdfiui22sQ-6B9K#f)ZP?KCky#v z@7NM#S42>0w$847OqWlzs9gMhbD2JR|15E&|N(+HL%1Unjg@b+8z(l1PlS zpN!t^1t()-&uyW}vwDTgc@4fe7k)s>7>d9GJcH@m4qo`%m#y)R0d24?G+9L4$Vu z>p?)aC6HnapP@|g#*Ca%b&W>HuclKcsGMr;R)Ea|1Q17Two__#Jvn(ZeSZtBnbjGm z9N>f~#JYgGmTS^@z=o1#y+W+=9D;uJQEJETyQ zJU~Oq%(FRYaj`=dMP}h>E-u&SQydI&TWU%}x&b1&4J433o<^k3Pu98oAxu z>3(}l=l;^QvMf9>=osE(Gzisllk%viJ5lo0XsKD&9Zk-O{5d$5DI+70eu}T zWn!LHHX3r8djx)FIrUg5h?0BJPsJey&CvXSvxKTQGk0d)dfopL8x(ncaIQZWD_$qSHxhI=H z+vL~l_XxWGi@tRKw`F+bqLY4a@iF=Lc0G4LT>?HisQ=HW=G$T?6qsf~p=+N$Pv0Vp zC|~RlPF`)9!($Q0lcyt^!AKRU=V~5`4=-}eloBJ!0XwXOg3WNyvAss2^GzH&zjlzE zevk+uG>`8EOXWw*7n~ZoNir7P-xK6iatD~@ahPZrYUJix-|;DA5?O^=H|+DB*2^{? zJzMztbnoZYy5M+nF>s`yl-JEWZ8xz=WEVKJqHx13@M?q{Bi=uOM+{u&*?Am7K?g*$ zY%;JwUq00D6;Wm_=urdcs@UNl*P@Y`QCYkdI1puR5hm}LX7;hiAUswK0-I1>af$51 zc(-AaOt@2XY7yU&X{!k{@eWDjOne+lKxhqpNBr zxA#TuuILhgA#S5VQ(qP0{=uCE_XeEyT12x9Guj)R!WrN-P_xPLW-f(Wg&lE7Nd3zu z1T2!5r?f)aOV#D^(%xnk&uT$H#Gj8dvQk5<7+j)x%E8drdXSD{xqEWC4<(O0-y}7I zm7;v8?^vH&S8Os(r?#JUeE>U3qs)(0>$}Z67h4c7hByhRN4$kNkYJ<1_SCJWD+F%@ zS%PoF031K6cZB5AvyTVp;Resq5@T;ZE_P z(b%HEH*ic$z#2%|#DpBc<&CYM43cGjY$54p|1Dl=HXdZDi0|Ns`#;5d!{DQXtmgn* zzd+;DtBY0ns0D^AwyJg4ZW`b7u1CW>z6)j{<^QxW@2HA(WP0aUDGKs5jSey{x+^bi zTaMc61-meii>i+W@S%kd9x8y4wAZG*D(AT_{nNLvX|kWk=?xn4<0+;=uqu#O%&EZj z64*PGHE{|P^(_d|aR$DsS#7v?YM&!B%wtJMEm_KakU`EomDoEN0{FAd-y;NKSs3DO z4{ytc@Z!uQ9|37k5VtNs1`<*uTy4y-0X1bei((28-6fr$Ze6$7G%#4VbTk@E<@r1Z z6YX_5YcCtTAiGJPmJMYAKkF@eiuP!CU30>k13-T93ylC75}OYzWNsa~tDT#6c~RaQ zjrH56`)!UQbKiY%pxFHf)2%+Bt6yCe`vBMR(?r36TG)@tep3g*X%-jwFFPFPY?`DQtS-bABgSq}Hy&0#N#UeNmj zy7hRB7_qi_0bwHf?$W`>_k|u!X<}T(I!&xeSW(Gvw}t+iRxvvoCMiiw=07ROIfCcB z2_SCFtp-*vwOp_}!|i;loiNH?>K?z#W*->eBY3g~si+$+Gj z9NJ!#)c7_YH(a8qyl_7?7C4JH|4WIAxN_PfsAtP!)hOx$Lb;H8T;qB;^#JNg65%DP zW*fJIp$w20e5Pf)EqZlT%;543m@IHpB^iE$pgAZBqNX9R1g`U(x{J`sl&K3|E1dY4 zL25M6>@+P_k`$iIDTyxbcxPC@;3AeCesuq*Lx*0c&+uB#)rr2#$=Bt=@lQWNZ<2&K z7KPN)J;D;**Kxn4OuKhkv4yDU6%Xkv&02Bs-%2L@Q+9L!z_6!LCx%U?Jdn|b${t2eM4{2LoZ_ZTuUu@~y@cM`R9c1wXvwn1$ zd9gwN+}g%D9z?Eu<67j43N=EcW9fRp%QN@U!JhnFkzDI$Z<$}?t-`iXp504$uWV~6 zw0FH8n*To9Kz0O%On>_ml6bN6Kw$<2nVIKDo(TeY5uBRdx*>L=9ouGjKdG$(YL(!C z)<OGU}b9=*%ZfNLI`)G^P%*bCBpRwlRTgEAweCHyxeH_*)V$-MH|hXd$Lpb z&?bRQMQ$l)-g+B#ClGC$q!!}=+`~BMDa6~62UKzb%7pkKZ`P{1)b_GFLOZ9T*Tu;jwve)tbph>_M&k;LQW=>V#Ani zjPs8}V5Ap@RJz7Tht1#&Yi&1ZSDk!5XN_M%nC`gs)GuSPYq^V9e8#Pv@}_fCH9H(t zM;<)577Rwke(Z78B#x_Qo8tFdB3ROKa+>r`2XAMVhirPL`12*&oVP8eHPP#Zn)_3b+?yTG5tSw4}69x zwmadhG11zJ3Bp2&yMb`>AbWvSLKu#-)0cy)D1dsUqC;#^x_h;(3+DVQ>53=kFmX)+ zs}aIj$lKq_1=ErhDirm=_7u^M3`>o0!O_8+aT+DS9d{ds3mpzKHuxE$5mrR0IQW4Y zK!0QX#Z4LTQpB@haG@7@Ss~IBmU&LE7u75pq&D5bjwKO{r@f5^Gw?xjRUjyWio}t? z5N)^|quz3Xj#1>Cs<@Cfq7}*6!c8R4c2zMq1}jLxn-a5bK=8dS7&R0l_!tXrpeFDZ zEEvU%_or_?jcJNG^JHBYUkygcGpF|_^*;-&0Qhq zQO0b3bl7tNjO*+LHMd6n5L{B zQMf5|{3Yh`PD1G4Hd!`&x$7C@o1!&o0$f!b`3*-K-sXJLTLAac**6~mwHcCR)cccS zAAZ3rKG~a_1LN~D0g*e#LlV1-#*Yi*2T`yIlRrF)0)=tf8aFSCVrHE|^)mBCNoVBt zHD+KP6~T=*%=jk$mqW#o4whwtjcs0|Xs%fttE*_Y!IQ0*#J_E~BwUdxKQ;daTCSxk zSfk~^OP@)wWOQahR@R37icljtm?Q-O&m!$Ao|w=rry6-J8D9P81V+}#3v|eNrJY#X zZoQMkd#p_QR!ua^tbn+kDV4li*r67=#l(bsbCzsjQiw!J`d`jsg9)LE2*51E)vOxW zYR!Nc%1S0tY&@qRGs%{sdnwQOXEDVCvdYfT(GE7n)FKtw3em6il*3LI&$}It8OD>^ zA;SkYq6Qu5mV43ZsP*i&H>PEaS&+^rB+Q>qU%dRr3K@K0zhwuKA9ZYTGu}~Lb&5$( zn4U_)A7BL!l!oHT%9=#7g&vaRSV}ddp$GD*Y&PD7Yu>uut;cH9n$>}0C-zc zKF}YSQAFj>*USi$ouC)XI_5&9C--70_qti_DVHPFY?e+Z{RY3V3>>QXPKx%rVCiNw zG;z<)#2g~in^>D?fg%lB8&;=;HhTSL{Z=&wVqwF;CrvRvMw@odFMo)!SGXzZ(f$qv zPwKXHXDF9l6&HD;Y&IWFntHx!4HJ3P4ZKbZPlmndirGGs;hC2}dx3`y56OR(YlKrS z(TQ*#SE9FszbP`=6yZ6)FXslY0w3y6H`gp6H%~%% z-Y98t%y6wvC}#H)8p;jhuR%)D@ayyY9(^r%H!5oSqz*V@`vjBW;4}itS1hZ!KjYib z)B^m7jle93gI0JfhX9RmJIHAeND}Q-x5mlUcv~69zc>_C_zi#_*e7*8TpKU6B{X4c zG{q*Nxyx*QdbL4J9y^Ii>oSg!RrKMXiJ(L%Xj}nnMC+vHNIM{MmRrn!eObGS&}u8Y z<5nvs&EJ(+FDFxgJd-JpC2zfCG|@Oysp>a56fGnQlAiHg_c;9Oe(2nx>Ny1S6^5b` z)4JFjCb(u&nUOTyBJkvw0(lyffx=tQ!)q&=P-f|+gvr5H?%U<0Y?lxT$-i&ux^qzX1+;4 zKbm&AnzqKeum2TpHO=2dAFP(FCLlhcA$S5?=_$pbP}+n0OfpW1Eqx>igzL+C&Y7|3 z^8Awdt(UH91xCQbc{#yVj(Y%T@0W$!D9gNRpJqOQny(MWzvM3T0jFp_0gGzRbs~?x zC&{v@v9zB)okN0$g@-~Js?@*xZ9=u;rc(ac{ZDwY1C0VVUC-dS4?^0M$#jE-}olg7EC(}MO=QfWDXxMle zo)?sP6E*c^Ud|~WLg@r7P+E}#J4f)FYLi@s7{u9;fr;qz`8ZpjJSa$_pum0>XRAh# zSj@iahIP3ryi3uu{6JoYV%Ds^4YqZHXI3BHtIXF@w^Z(frTbDzP7`r2mNJ#=$k;;j zkep3&)v) zNQ{qufUmnn;Z_#7Rj+fp6X$sKA&Jf2mVl188E4?3342vGiC*bL+bh^k1+#NfIweXK zvtcnMDG$x#dyCNVK**?uT^HAu%gPers(DD1zRp`_D#v$=nRh*c8(K7s@aQfG)V1(_ zE_YjGT@FdTWtEFVvqpdD2>PmVZ--1QfA@FiRKyr^DP;eAtu zLru*l53*Y&a{M+YlehdezJ!otBfo<%hgY zg(d7TOerHzI5ETE2E5E61E0Ij96Ck9tB}Bhr7Y8WZqz|mAoZ{-m0zP=05eb zZ7d3Ag%fy?5=8bbN7*ZB`mi{-H~^xy$qLTkkqU%x^RE-a30A<~WMg+e%fxLMl)j}n zUdJDyW!)s(f77{mvZb^`3^zx$=shCwpD_FA(CE~5a zhjnE<8bLc31R zyMef?k)yO?rtuN+WLnlkQt6P_5XpD|0b0*)*Kg~t`Rz`Iw{<5AGxFK8@8w9QqHa=c z|D*@IH)Z79zB#i2i{^S;BH--*4ATOHMRTv7jxk8u`o zVHf$~y)0f!U=Wmk7hC1}Bm1JLie)*?c+F}(j7u?W(!9c`I5z+0hMh%Hkei@9S#M*u zlBeuZ{bRW9Z2m^=m=qksIcK1I18?Kx@*2sOK!FX{`K`^J48tPbp73!D%Swau0VDqBn2f}K;cU4PN++<(_=15>-Js0zEWD^r&ba-=!m^+eb)_iikaU(y+82HXJNrxj`Znz zVk^?)18A!Ef5EONCX0Qdo>0E|?o}XWaj|8vv&Sa^33C75ZP=YI5e&Hd`+nVFpsegp zDrWi8f}2f(UO*$0!2Nyp>h-G^vgZZnQ0>zPpp}zHiLLC)_y_e#`r(v;bHg|xjt&0O z_)VVx7iD4&!MDONQJVYHfn;jNSa6yc@$H|zI(=zf`|x*QrA>VC-QHFW;WMIeqop;6r+};k&bwuV20hKEo#)zWVmZSI^H*Uxy8qha0~A z@$HK@-<+JC1mDWTO|AXz&5M(7!sg;{~{z2yHv*XK;K7~<1 z7R#2nL3!PiDiHN#y8rq0m6-A^dlY2)zR8pIOo7<-B14 zu^-_6g~adJvExVgi}eTyTV>vm579qa@71!I;BqAi5*%72ADe~6|FErz(Z+9 zq|DC}qWQ?|E6{@AX8%v0ravsp$hbsL*6(o`Oy1)7_AX3`-rV%rV6pa1b`&*#UHcZ5 z6o)~aMc0LEZ09B-#o6jA06@Us!A|cbQrz$*B;=m02rwCODW-T7skJeWBK$(`e2(RS z*IJ-wrh28q5m_n`g~~rQfAzmf)YY08jg@!R>^MMv^m)Wh1fR!|Kg}4Ms1bq$xj4=| z(uEBS_=0|nVNERrlI=G90IA7rDgtgD^EdYIkDHif?`9{Gy>*OJD#C6$9DBquWgfJ3 zGOqT;4SVfa6BhmuZsLPT?FM828fO1 zNL$C-rBb1Y&U)L&@sOtM+A04tmi@ldh4;bD5G)Tqe1}hoJgv_@@%ro&?}8y_zOm=T z(u_XHDMn(2PoE|<$Z@J~P@uxROtMYVqmN{#Ij-GiwOlMAH+Y<)+~)#h1x;crz-nL4 zRUuhB{p$zs{uaRdO=p)~5#3+m+uuEB*yOam>3KsTyAfH)pO8Z<;C>r&m{^b-zMGz$ zPK!INI(vUgP^bkgT>i93BO$km>tUk7e2L-udz-(Nuz&4Ru<*(Ih1kp#lZ& z)}_q4OCN%%Ae^i+^)bf)N3CG1Zzs%1Mn3_IAWit5Mah%77vZBC14s$4dZv zDokSANemqQR9iGeGONRacHq3>j(xw1NeUIZXAUq7;9<40&74%lA(F zLDFYUX}+mz*1+VpD;LI#Cf~rqE;%MVsy6g!9cup1g8NvL{*S;by}~SRJ^R~ z_uX~(OTX@Z=?VAvxCx!G!4P(j4aw4ByO|B0Dm}?360C=DCs$n)+C~*(gvw-94^*^^ zsKah?W0+RElgdzKqDiet`a}*W-o(@@%_m8Tl4X=kEr~XYy$nJr;W^~T9YsesGawYc z&1+)iF=M)F(d9X(R2EP*%(6NHh4qZMYX{HGT{qTJJly!2q1eKUj%V-lef)F+$mV=` zizhKr$o5x15KuSn6h5YO1=1j9!`3*)gN%a`!3dhg(N}H-itas74FgvwoHyT~qZ|yY z%X8#xMz!LIPiB}_*32fWa^CK{I?%O#fkvo&TF%S1gedD%$|i>i4Qf!lkW}%o<%qrQu&>bA%OEU% z4@6|Dpej+2v6h>!?a*MWv4D4O=6?c@-RU=PPyhFepO1slcmM4!M-UkU1Ju$(*ytR` zgL*&i_v{~j7lgDEhGSvHO35@|LXKFdvb4m&7E#B%#HS`_L#M7W{AESM8j2m=$@5jfbU`${ z=;28a;6lPd_iofnc$DHJ$QMqIx-N1LC27g6SbRQ&P*DCk#6z0cN@_*w+AOH`)Lh;7w1MOdFnt#=xGrc1N1hAZO5 zha4HJIV|IO`PFYGTnGtMK{gB^?iaOodLE=qVRaFyJZ6F2!T|k)^5}-y2xlw9wEvf& zv{B)TA{KRbfZlIl7%+!(WD{D_MGXH$&o%Xw&f>U=-CFj{w+t`j1t>8yl0BGJ089#S zJ(?BGbXiX1W=3O$tpq&K{;WWDiwa^4s|psTNB?B&d&wv~>SwCqWh0k&3bFXj7j8P^ zNyXzYoYb>RpM)>q1V~iUQ>qBqu;6^K=Qd(R9BzU8yj$?t5+0SJ`mz(JNmpx*)b29H z+YcWQM85`4@%7T)(!CiB=e?(<@BqJu+Q4{|uFD7vyX)+f>^W_BPp3U9xfC)TfAi2MpHtQa ze}qC;J~-6`QN~$c?MN_Fp#69MFx_MW!O>MrY=@L|n#9U7(bR+NYv!8v*9D3JXWBKV z>+GZDQ)v%eAx=A}J)0%SvKzMnpqi&yQ(xJ_7+3AhB9L6m-G$4AYgo)Cg(ibJpV;~> z5I9B#UgU{{L&Z{obq^wQL%l4f?;Cf8z3zzRjIW580EnnYR%NRLhawj}XUN>muVBh3 z8#ZO8z)V;I64^I@-5pfiEas2_!kWKKEvEl5b9q=CkE84nCOB3R#*cw(yZe-)i}kUT zK|I;<%dFu0=L(SA(@i-hXl`6lk=c+#*4V!af+dp2kU}**(sX0%8|U~yptrj< zD;La`_3C}D+v5bkhV<9m^N7=b&s^B{4Be6$D-Ybz)GBhd!=LC8#zPiC+Flg5C0g+t zJUKpS!g;rBe{9GcE3}$pPLoqf_GqxZT-EN*hPS0gytSDy?sYVH+U}tWkIw>dF&K_w zyi(`Oru(I&JwR(^$=5hm+~FD}ahWK4(XcpndWYKzVs(xXRUD(u1KRt(oh(6Y9uN<( zRwVqt9{TQCeUp17y>`x0ULwvjWUlpSxmLGE*%ntL(;(%}@_4f>*|;c%B;3EI;a}j5 zsLzIW0m8hFZ{G0e-oS+4fnD1aye*Va^eX&j8!ApNADsk=4&n2AMW5P&@6;>&a*Hlq zt?e~U!%DMnK^#sns>gkE5hH-Wikt)} zw#u)lhvG-}q4R7d`PYl~*xOfzfgdsJy;*1y2c1gwXLPbaj4}}TB}U^+3p5(MM@so> zKrT|e8JbnWT8q?WtSV&mgM%N@Wu1s0z`fbrv3{NB%VYoO!lr`VJKq}}qcs^Og70Jx z&L5CH*?$4u$M<2x-tIZ^l3y*3Vf)Z)Xf`hQeStF#D0sDo! z@lJ8odqN~4NXpq#l0}W#&Cm%spL&h9Y^-g}OcyYIbORhkhR_G$>UqEl3!~;Dz+4xu zRW_NpM1yEUys#WcDiYT<59?yvy)`)t8lq#}=qa(F{Z7RDw;Y5J_SD{&3|Ll^34O(ZacA^J9JNhtIZ>xb#A=lq}pqH z5?w5NDu21vmJs{W^(C-2@*NE1fZ9woZKJnQAnh^;CzCb?>N2-P|25eSMUXG>teY&0 z{5{2rfSH5dQ#=Iv&ZqO$OpG2>5at4A;o#)JDccs<_yMUFD7kBWLGc|}ApaVR2?BI; zd}<@&(F0K|LnmBA>GZ>k9hb<*rb0nD^q8#T2hkm+3nKBPy{)FYN760QccfEQYVj77 z!!}53NFR^{zjPxt$0=D7Y5oSqb(`DqW(}Ox*R6sbrGm8T8mOyDn0Bw$N~J2RAKs(g zHFQxU+dq-$nzVXdwGzLGt;QUiF8g-bh{E)Ln-Y7bHlzrkC@KqUc;PGnBS!`IiS{^a zI&nA%uQ`a9VfZwT%?ZPD44*5CFVvD@g*P&FcQXii=)G3)K&%xBz1(sLkS#q}HyqDq z5qsUG(lMcHN*^@~l0wG=>eh^p;Z5t~k#!bjSZMDIY%(Z8K9rckA{$cb3FThtZnnp99$3ZZ0)MMj%@4Ad@GqvHlJi+CHgPaBXZOm*5dlr8K0m}t<=gOHaOs^L z<`Zh=km-TZ$0$yaX3VmWeT8H>vzGP|`$of5xKw&K(Jn5DnXBe9CX?S*{;P)3Lj`}h zVfl-HE3Af}eoDeL&&Yyjao@4qDEE9qSp&MhZ9+( zC#|%GLm3)x+e>iYB-m}fd;R)%&reT~i0%T6Ulnk%(W~$EjO-f%4(M4SEVCoRW(dP` zGVC>6QAmM;4Q{rjFXR~RLHJ)|nOmRE6m}A&QVWAGHDG{3Av+<@ zrkJznINX#DHTG0D_vop%xiGt4YC1e=u1Ko_S10`!&OuK$%%0;^(;Le177KwrFXAB<0FWGGFzc;F|zub}l&I6lmr)JElO!i$6`~?!r zlCoS}_X5byE(;68*{(gBYm1`rHaBa6#}wryEpmygUDqZQiQBiR6iZoKXWn}pL_<>= zM2bf}XJdZ797vj@Kd-J9d~T|nZsx9NWQu0x7J#>NN_vR41yXWxWnJcrMNy%B(4Xn% zdLP)JQa$$Zv7Ih^tG(?rpX=C)^R{u84PmF6VHq)=M$m5Nhc)_0IuDFJD z!u0J7lTgNen9CrF6g|OipZj8l{Iy4vAyj7?+sRhN2TV3Ge4rQHN#-PLtCj>ScelKSY zj~Ad4WW)p^{$FX;66aJ@318yf-DJy6xMAJ@xh|{3%7@4IdqXq@uU-6yy!sE<5((=6 zf^U!b+oL!Y=zE*{uR847>P7yV#n`(!b?1N$Y0$e#-jq{Jaj8Wjgkf1;m8gn%a}C<_=JO1T%=w|f_MYR`dMUY6 zJI(gRUzQh6#O#xsD=ZxlL>T~j;DmLGux{*=AdNgaz>zmzC1a<)4ApEOihEh)Gqk$S zHC)bp<6c%Cc%)F`fIhbf&r6wQx9VTMi$rVKAXc%uorXprv&jJ6^r|oDsMAdz6H*pB zMslPpqKHMu3@C=!*zbODpC4qeVE*05kTsMp*sDgDZnr`1{sIC!LthQ(Q)SZ@)fDrm z+}10ij`Xe}T3cImbk*=(t3t*YoJc3(mpS__AuDKeAUtbvhSg+w;F@h3l9T7K60r;n zGFO@>I<>re6!=1pG4Wh^wE!NWh6sTq9v!yu5(v>TD2N-ib7yl;7Lid4V%9Ka-tzIK zc)zys(PEm)+g6gU%2$$FbdMI`B%gW9%)f{n+Zz!W+T?KMdYX9Gk~y4)DAe=5HO5%H zI-4brU6Y(78AsxDX^v1a!BOC7zQ$eF8mDOZq)SI%Jvlf`NW+7}y|2Cvwl(Y`aq z;*o-9_cc-`bCxYWF+JZy{GG{?d=BcDLkZ8`E|=JTVRQ@7-3 zayq%E@d#QYT)bJFTr-4vZ<^0;t|$BWldON6&UDR`3K`VAXHRe`L^qG&?7%%8&J>Of z(`JOweURm!Wc!@?rrErdg;V-xz$uBTDL2gubUmIDc(&_&tkw0k)b331&{wIUUnh2a z>elmc*!5y$5}mt^#)R0ez>EuYXKkL`L+-=Hq&o%v@h(y4_bhZ+G5b!{ zx+*Kg*>AD%v;Q-PLwsTO4?oGEdQ+eo)1E=x%93~Q!}UX8^b25@HlV=c4l0>lYD(jS z4A1}we(g~fv3Y`WhN`!_6kL(_!gtNElKNpF0CA4;DCqk730_{H-WN_VKit&{(Z?fg zCYVd!CJzF+s(~f6?^jn^`bWD1aTu?fizxRWajA%{O#Dcdviz6C&>+kyq!y1!bv8u% zjF|xM^DJM^^j?r!U#_|MQ9Rc8aQiK}WhoyuV+>>V1*hyrF#KB#^_ytOoN%v~>}>;% zTDQP?7(;M@4}}smXOh>McTL%jvlS(Q=*$L#aYApmG*&GKq$gq^QW$?4Ufs~3v!tBh zu+bjC185Qj@wq=942JN`R{(Ub968!WXcIb73BEVX{0)T%bS9slf07+5g>RX>Wc|L~ zv~{E1+d}_8&DQlWVw(V^e-ZAo)uF`hF4d=7Z}x4Dq_w26dWf3;P6KI)ia0o_G_#ko zZ2I4XZI|~Xv<8o$RXLw=HhFlvA?D4iA_qbtWHASNM+7IJy$P~I3teD<8u=CjvM4^8 zg00y1%k~tRZJ4)CPVenT?!W*N&JYp-oN@Ua)MwBa(^Z7tst9&U2mO-JGM=v8w`xVB-`P-eJ? zo>^=PW>yw$zc28pi-~ai42)RF2SBKoONno~%5Tc6)fFY#;c}=+PzNWXRz3i+vGM54 zOLQKT|J4=-x^3N^W)5yI1erR~iC6jz`^kE{t&|6OLAc7 z7|*bxQEK&lLp)6AohNj&=8hlx%PTJ_v`L#a;~jT_jr(mqW{8mJ6!g7vR)LL_4Aayx zUH_g9HQqUH+zzroMJt_t5eE#Wx^EgVlq>$28?Jq7G6;BrJXbm2Bv_74@;Oj*0EU)b zwuC027Q3aFcgh-PwspdlK!`7J?I8O;_*Ij%{uVmYo=gUN6?3 z?ocRXvkn?65AVeVtT-EA?)tm6WlG{i+X}MfFg#}5g~#`Pw|-T(yrJMkbPXu|($Pr( zxxo?jc}oX`PYS+axMA`-!wnC28t%dgt&c@u!#@ag@); z)`%)`$b8<;=$<6fo+o(K8k7Pr`vO}X1I?vQu+pRu;LSeYFYvHjuRyfL9n zkmA>`)UnSp8Ku?>lDnZeb!RwuII?J%w%vZ?J}Yr&bnFk?LC&bc*xkj??%5E}rFQMZ zNrV|>fa;_a1Q(%ki+(cShTZFgo`5Lzyx~~JD-aFXmbF6*2l7?X=0TP6aHk#5AX2oV ztg}u@;VJ7>J^6EFor=r|9A5z66GN~vJCICp1r+WQ9l?d%Q<k)m9Hk_k;2M}`4Xa{l{t~>e zhcMo@?oNn*XyZFM*9=t;SHE%A)QCQ!RnjQ_XzC8VyydG--kPBT&h-HZzs>7}Yzf_E zLeKAW$Gsw}MO?)v-fwIy=`IYeJ=}UGp}{LV0Gr2=NYA?CNYC%x#bwIg&cm_6e_^-r ztT^B1H4eIJ+Mj;D=Ut3|*rv#rQ#khte6L$s(UHq#E@%VS2vsWCOvg7s*w+TKFgghC zQvnA(73foo2!Ab_`d5|Hv|^`V8F^n=qIm4dGAjeXlt{8cU;oHT}pB)4>|VC^kBICeBkZf48dr|8MqK>Q-#ZxO5r7Wv4rd&V(@k) zYao0RsV`#R0*g1K#fI~$7HfHgG)5gKaln!a9+kA-+Q5UC)@lA3D$QDr=AWd-{P$Nk z;PTL&KY03y_8Z++del((kM=(14z5b%x1-IdYQx(Ovt={_@1nkIY+g~hXN+KEq`7XU zc5Ag{HOph$hCaU65&tYId@JnDW}w6_dk0eHLDho1u@hp+s#A8Ss<>7QK`>nQ2Wx}k zyysq*klNkdfarJkC-WLujoBfQAUSPo`6%3`@^oucEDk$w*6w8U51(j*Nus_rnJf}> z3QckP!Fx@1j=nzjzx&hwmNUC>#&U{(k#ErDXYvHXXHo?I=2U}XSx#yDtR27^=28xZ zjvnpmVcC!;LyBFOCj)-(?u(aoJ|j82T=9xyYT$BC!QG|L0GYFU&!_Ipr^`A7h>?YN z?uvyHz?H8R5B~ml48cT(Cium54tZ97e0lcf#hLqiWT9cFp2#ue^Mh|*|ITv4y#AdP zb)}f-U|yXz`k6bY5h0=t5T3Wr!$2(|FT9Jf)z2+ zx`h{~wgc!2hcXd2fS=?c<7z3__h=if3}|~2NDu#br{(x)ixbBeoxFCszao~>VDK2c z)i74d=GAj^khz}${IkC-<_LJ|1hFdeRDvRhp~$G41Exok@$gTq=m<07!Ix!y0MYUK zo&3GE)CF%|ytZtlOszdzcXD9aY#Hyx3%=;{JH%@EXg_vvwiS}!~tg8%GseDi!R zQHwCsNe|Y11Z{lk1iac}^g-}Z(M}K6PpP}gg0_Ahu_%T=+|{eQc3N!(ck%50(4QqJ z;fVF_b-kR(t!JYLIJ7Ns5P&t;>YCp<2@x7mz0^3t8R?r6Tf zpW7`?sWqn+%UpdX{zgZH38N>I%Nc8Ky@ys_X4%F_;swHur3g}%i3 z#!?9gK`&2{M5tko#&#o|t`nudQ;7bC?btEYYJmRcfS>K6_QRO{ZQhD5anE(UB$_`N z$^WTB?tk#<0b-ncfM1Cy)`>5^YYA#C_y$qra4^DgME#Xpj4ll|eba1&^-Y z#L9y{hG&YI0_2Dx2OUVhX^(5#-~ad zlc9!Uo}gnpHC)`d*8d?Him)3r|9gE{`LIEf5pC%Hpx(xav zw|429PL2Y8qF)eX6VD|gevtVb4fg?IFWGL&YO!i*S5ihuw5FQYK)K~bRYNEY>G4Rt z-bj#VsNonE*MG(?|Af*n3lfTmhvLPXH{YJV3{oBNqu380*v`lip^@b~Hf0>4+);O< z3DpI398e4{SJg&UTs=9Rt$YVJ)>cZw7LKg+CKPDjKVuuBOQDCYD7<)m^5a)nJHb8j zUt!6(Yx}&M#6}?Z=)T0hhX+u(yxhcR@1ddKyIKc6} zaYoQlQY4oY(YwV=CT)81{8P>88oTFi6D#y27>~bb%PR;_2C!$-0#7Vv535=NfhJ(T z3i<_~o(~SiVFfZ+EW~|vH4<+*3~t42QxhgrEs-4W&p}G@NLQ1Y4hC8t+5@M@`nqw; zjn*#HoR;RnKWSO*WGlWO9nluPqe1;t%qVOC&*yHT&29;k=YDu!+$QYiV+C(LJjhWYFM~wFcqqD!omb`5KkUL}3`hnA4H0cDmY80RZ}bDd1n5S=z>8Ij z7mKci6^09YO^%}Y$`bgCa>hg2ZZg7U%|Zb;vlEe_#FdBlWpDQ9nv}c_#`qeOFu|Fm z<(Rw|g*KmKH)w7!Zh9dY!(P4s&7 zKU>=@sRi6A3YR=T90^$RiEqMi$5}cC_w>9QBSotf)@=|l<%{5XO)b%7i~w9e!>JHo z|M-(d!}uyb!3+m+h#TJR2_oKYB`BR+GTi2$FvCFr;KtzOan_Aa_81Y8XeK)OG;lGd ztcz{~fLK}7PU_%|3{(#4iI<2oEAaTy;Muc*DQ5)vF{EPNPE9$(tWuIo@V{;7l3VhL zIB9+QsiLH{g5F>n^TkKWLw15kyMQalJ5O(5^#5TYn3jQ`UIgwg0k;x>f&BY#E!TP{ zZ5RIh`{Io9g|8>uTI;aemD0&8kM0FgtjPx)B~W(l`SIItU%YvH`oFDP!am;CHM(mf z?|X#Trg4aQxHLy$rD1Z&!XV6~Nsl>0=7fF~aaHPGhzRBHop_2_99^9nM-ecZ!XCrM zL-Wum2X~8@RcyP&8vb0je5JmlYUgyHf*W9a0(}hR$jf=SK=|Rk_>BC`T8dqFvoT5e)^Onvy;f^r|wH|vu?4;y2O1uERwZj>&gsDSSmlq=21NK3dvftxhpfJ z8^$s1V&*g^Vq#9`E5wwHV`Bl6v)3)OXSDtb!XfG$7|=tyZ88P>m(|a4GSIp?dYiMw z^7a0GaeDwxb|DQ0c{;1{QgoG9D);RB#sJqEZf)Q0Xr|XskYp^R9f^&r46!VD6-teR z^c>0V!LlqqV5T}AAMEJT^V9i`hj862MS1;hnP0nGP6>8A$OmBA(ECsqFW;@IxO4a< zz&9)lw0vu8(oBMVlN;%XyA7@NucOABgBlwtMep9c`1aN5OAFJWC&30hTU*4d*X|Qr z0zL>rQk%iWDqp&<3-t>6B*cid0YJ8&Gs`x(Q?J(wi#J7hhjD+$!lFN00=QfMmUW?& z#~GQ-o=d7jTrbDjKlHPntP0>c#Fg$H>@+gsgvaj3lfJE!bPXoa$82(NXxAi5(!%>Q z1E-b~89>2|9@03fb<-e|x>i&(^-2RDQB{x&8nZbPw-kERx?M=OHrMEmZQ*%KfS`Am z5#vJQBzYy<@$DxA%38YO-kT) zo&YaC=lBs|euzWkQI|R9KNH9y9WytYcC+BvVAM6D9H+(zkn&$r zCXF!LB$u-_!|Ap=fBllJR*Us&k6*M>_67{fXLBYlUM=E_r+|s_WIp92$Ru%VTrW{Z zu|m?9^=&vQ=Jhobm$?a(eC$pOF2LD(CVlE8Tc{*RxciF^*;J`2g&eYp6Mczj3%kucMH~{pY8m78-O5V0^)n5hW(4*}Y zD|#PwD}VW=PZa@~m8G|#(WEVw=^N>?eGs^j~Wf0;7MMN{i(adxjFjr0(-xPey z?u^%P^Me728SlrqCR}STwDmByn%%VPZv}8`d4Z&t5+ELr)mpLE7ERk__0y+!@p<*? zTAzhw-<8uZ^!ZZc2&PGkcK0rfh2xBpG~p;Npt4Ngtyy9yv`oLr0kbUymmVTT^M$CHl6aY%&LZv>*v2C;pYp z#n8GqKyLfQ%kZ`3;R+t!%S|*n$$0^ z{e|>YDxo7MkXOQe>a2Bcxa9q4y$6ETe>7*q(pzEzuUS+fqUcmNRp%8O1~g+0tMZ}< z^!5gpIGnrSZwkV$@(Xu|>X{+onBOgYNgXHF7EUyYIlE+X_TD9l7wMoZ zd~*M1Dc#r;t8)Hfo&;UQikhl&GjM;LE6zo-4N86|k%w>@UexsM+_mbLO) z2-}j+ZWrYgeYiHW$7LrXla$Rc1OdhXV_!9Q{Zo8I?Ss&FdT8PfUP8l2Za)-P({fb> z@igOX?%z7>IHatYPk#>Vgh`MqSsrFS(>QW%otHN#@?&m|OqS8%S6_+<@{Y|f_aLY8 z;H?IrNbm_Sp~J7TEMawe8N{h9mh}fWy>ZTthHm*_gtf+`vXVF@ab=ie@Z^V6NIa~< zyRkvJQjhB!tR=9C6w42#$tXT|7v~iwiYN{)4q{qJOO+qfCZ4DmU%)i`VWmsFpvS)+;xclX$RjtevJ^%+HBymfS_4TW1)))atV{o3D(K^ z3ayp`c$WitT3@-w&y-6HuJ-e5@av#Vk~ig4myjW;{nFEbf5{}^$0nP+yGpy+ z1Ui)Dw@3clqt3VN{Y`)Q$bb2$^Ch2WS9w(~R&$zy;Ooc!>&Kn1sjokteY^iFH${tu z+t}gPPyE+UI$x90*k82=OdfpM`Pdz{mjw_%x!qtkYEZy0eF4O5HyFArkGrhb7fjJ> zOGIuOl-3kY8kY4dU)HZWjbSQ0SRA)*wOzTLGcD&%`6!|m{o0rE>rN@eXw~=W;X|`} z9+KdckH2uM4f&{@Gq zY!4B0Z$o|WAUfNWpwDap!*Kq2en;bUiM%Z0LiusB+(_K?m8=piE?a*{mfjJBedTwI z+vaJqWHFeoFLu?Q|0*sNo+XPU*|(v@*a_$#Cd(wbxS>pte{qrUELmb8EH@Nf)^V|A zoh;ONK>Nz7o4BmHNtV?SpuS*MpSy*lxQxrkhsi2Px=OhM=Lpd!v%+0wm!urWb-FJP z?1FDJOzH30ORPC6SVdkxG`lqW(spD z!ga;Hvcv$wl1L548GIy?6?|4s;w<5YHNVx|NAOC;h7fK>7OMV~=d0l>6`mM+c8TQg z*cf0mb9c+~mje20F#It1X)L$PpGUF1Aqx$no|!iD#y4(7WElNmtTd$e4$Fh$U~E~# zi9=igG;-_WkTC(G^SNjOsWFTQa2*ZD05Zd*?3G2Xr>GRLp+lM;NvdQZrUrvl<51$T(KLP2&Psq0LbMJU}>;vxfFDlGcg|OChh#(RS zAD7G(fp_xM9hvT>dU@5DOQqR#Q@5~Z93_M+2w4HuSEK++xiAK*wwtoOpl>ofPX{oI z*$+}RLrl1VGCqijxt-3%bj`CQBn^adJIIWN<|}O4dJ)z3wuJzKeAU({X$O=Vgfo8i zj1OVL`AzG;>LYwuIN~PSa0vV7V*5ARg_pj@PW|G7K_0i2J&!J zIanL#jK7b3GzZxq$QKJhNJfHWZFe>B?r|$Zj)oy=n-~K>;_AP}G^N$PFRWQxnn45S zS1@%jNHjayP$y*MreQ`1VJ5_(zToJ|?7E=?FpJ5(Km&13VPZ4H>&DwHIrL@2mdc)W zln*9#Juh;$aFU-f%+x2H1&;xhm9eZR%K!p4M}75I((CIz8nkH68%8YXrXWA=-`PrGvFT* z4oWMH3_vaE3sdP=-b#{-euVD#E~Hlci7fW}6}E zl9nr8o1$tB?7>h84~8PPof5&Ho6PBOKr&!EM)Pp%Vg;@dl_PACQ-Bxwg(p9PSH;|m zeWR2InDH)MLdblIxv*NY62orc1PHy8762g_ogiuIoC=5jpv26@+Hz-GJn{>dY=Z%T zcc{eXT_tv-&mTJUV}phf85WD)pgerI`~xC)+$_E_b>wZx*f;jMooHwby+ki^MQ;nu zqL`NFV0XKu4C6rA(rpBv+<^;jX!OR>IPnp*M3V((iGlE#!<<*t?7%t$j}-8#WxE#o z{DUFN36x@C0lSMelwq zOZwe!J8Snu%#0uMWl4bpL=Y-n9ifQMAS!}$j?()@^`TtW70zjA!JAV+&H(QP^P6+PBJtPIn|4BKrmX`I15Y`EiJh;L_6=^#ePe{5!%>U6MVsEs^w%cFLuH_2udUJ zX6*=;KtQS{C;H3n&0brARts7gpA$pyaJHN_M~%kDE*FJr<1TtQ3XmuWHv&jK><9}8 z0JWeTe*pPUt#ge7;|-t!CiUzV;Q$cWX%GRZxKoSVn0#Pe_kD587AD4rLunbGhKJ+! zr$dSTbMlBEAGyaz=JCP7fxApD^E7x8MHt*#cbnam@Llj!X{+@?sn z0~BCVwrKeE<_{k>$rmO~kEnzKVpkCh9DgE#G#f_FDZeLZfWVp3c7gXFPM!iJxHPa^ z3fH9`_&0^SCqamrXJ1Wp8qXki;F_4wPU}G!6iUCMMq<{BDzOanQ3qth3S*Yc)fkHt z7m(IA_)OCl5ricURJDgKAYOvE&s|3^$2=Ki!@1=>>J-#V^i42j^DPH;c|rje)m{ii z_+6m|mz!K584?IDTrJ%+OP%nCU;5w&Ng($JW82Om+jdt<;xuoN^E?e~k$5(QT_;D$ zo(J-5l@W$bbCLCkHZB<^+TsTJgA?Rw2{PLY2`%Y z_Viw;P{?c80)5FfMT#>oBE18bhdZ0Xug{DT+YMpo!;rwg$&jbVWQ!hY@2zU zI1c2P$&s7V-H(@`-bq-Jib>F}RRtwqlc-1#*IrFElpl%(v<^VpqS^(*=$cnfIevS( zgh<92+II0%jCWi*l?Y2i?}VGHcB4V0lcGzLXsJqRoTEz7+5r!}#1IQe~x@98;oiyz9IfnhHw`Y z3nGkV4FI?hx?x3ny_^-8&6Geqw9#h>euY!Aa5@iOlx7n1Bt{)~9mV)X&_v**!xzzs ziC^Qz3ru)+;YvFyc{`s|1279AQPJ{a&~3rUGVwUVKY15Bng|*Yn0Rh$$Zd`~Q*ncW zu;qYUjAEoEIa@8o;J~c{J315$r_CjaSP)F*`RxFUK@ABvTRag&^XNVUg(!L#E#KvQ zgLnuo*PHIvdiT;b=VK8GE2icHEJ`&oy?xmn9>xS|W2=LGO~M54@|n=*tAvD7WgQs{ z$1-67cpAaXQj#$VEZblsu=v=mjRo(?Sa5e+0f@w;tpJ5zqOmec;NnPdwrv~@0daXA zYg(V+i}M4NUfJuHAIzaHKa};ubH*vu7395ps4VhM>npjw=mtl6CF>G0^=Gb9xp=hULF9D@)<5wg}{yhj}(GNbVFFpFkq+hN0_4WT*E&MEHI-9TZx5k8yLX1pxn(ejs7 z30g#s*186KIJp2T&Q0)zPab@MR>E(Q?t^GZG(=48tWp)KFDbhXwJNgQ(8KjXKxKV! zy)1o(Ci%MqDePTM%lsOnFO-^%{~ioKIDz=#sJnumgQDfHy^N1LG@~9R>iuw}i$yj& z!jNP+$QfSzMGc;Mz#nvx8=E`iZb7CyU~?U^vx35MJ6-y%T$`4KW&%?a4}SU+U0ymJ zq3~zh3w+UbMBM+ru)wZ6Q6*6>$YBX&5>SUy~w#LGHT?jLDF<@b|)~58&?@?rTge-j${3QQ&h-?N^hTGO!)) z{mY&%AU{tuU?~#=p&k7R?R4a2ZuQ4jc%)_N@_4$1U*_vn*e!&H|?Pjq!sZ^bU7 z{2{Sdx07oFLh{!-ZGDj_oR;MUvcT``M^2|A+GQ7T5Yp76)q*CIB^?5Hc`YG+$$d=r z3tSj0rVk6^2sVdkt)Jhv4zu;h--98V-5|23_X5+g4pk!ZOhAwbCMj6OBgWW*?S*u} z5I9e^3H(5(FR%!4;?i6fxx0eMo{6)Q>Hcp$uTb2aL^7W(+=y12^of*^NDZ6PFwZ$% zd-RlQ;OIM_*E!(N0t7mps5fZR!2&CSsk;(kMMR#DM;>YUNO6|N@qk7e@OnAbXGW}D zGq~=S$eWJIHyX~33AUkwzIjbdsu{|}krZSY2~BmGKdi}og=R>){Xh)|5`pJ$VuaNJKoJENE(t)oM2#R)Wb0kY70{S0X6xAoBRMy8zIG8Ef%th zauyDr2t4S2#N^epY}d+!^ffA}3yQ~7ZiZepf_X!J8XzH@3a?rjT<*x&c)7aDt9{tf z0c~2qCl-jyD6S@y;+sju;y3!}#IP$izFTYj7&!-Da$ zuE9OG%0=gcJ02E+YW8v85bXYRe{V=QIzh=Mm>71-vXsM?qqaF9S&2MM2!A6Bb4nP0 z1a}xeSs1k%(FLSv0uDN{H(z>;-k0iv;wV)o?`B0aU6u=huKSj)jZoIt4v^=#(;|92 z7*6Y6_Y%C&7%~GX!RYV|@|x1CB4mJzlhpV9NwLqI)FMjR$iHe;VdCOZlbZq24JUIy zQ?1m$Bv%A{4`R1h4KaUq17Wfu>*c}Kog)uOgQ4^XVKdx^>_jPvaGrT#fgHqSr{3(A zG1ot`gSXgn(>4#&I*5HAS{DopCRIi@Dka>*Wo8Y1w z6rA}yTm<$2#fc42q&MsZ+k1=7m(49`sn&Xw{Bbb+X03~;)nM1JX$hvyTYkJd=8dP?eumbZeZCSd!mOO zn$&SH^NI{Ex4uDc92!Hcb{oOrG*8e&#HKqBE*Vr#oShpK3e!;wIyel3KFGP%Z?Ib^%_T_Oz{(;A4RG@(R6=R`eX zw7yN(u*FilUgnGLLW8IGsj(dIqOq7L793p~(pU{e90?vewB{s~m69FG@!+LmXxEt( z6eWVCX0h8$*Hj>}qV%HH4~Jltgal2LVy;_qbSh?{OY##~cv*c9$AO?Y-JtQUR{-vt z?h?SqyMTsRp`b0A&?3Z48tGl(d?k0YIc;IaXtw0M?VGFMUiv6?FMYK4)%QfxnqbF@ zi7u5N3%OA;!<~4Jo&@r{FzqW_F)&=CxB;@t2IZlrVl9`&l&E&dsNV_kd76b+_$`tn zzW7iqZ;^I;PyqQ<*>L3~FMBS-5i4Jpjc@JsHQlVikP|De55e^A3>vp+gRw&9w$Z#M zsEDQxjLaKBO3J7w{M16E2=nZUniZtH6cJD<%8_aOkW?7zIVH(`<8BBiB@hrCFbQcX zG5JNRiE%DXBzh(2#w4~VJQ=a zhXbKR!=sJY;Mgww#2leyS)hWNs8gg}c$+0a{SMI1Dv|lV_;Gg40YT*P2d7E0>#&9! zHW>xWT~Uv~z?D}@P7E$S%^E3pS~vUW<;9AOVTd-om$73<5S~WK*8gQy;JOG4TPzEh z?(V`pRqaHPk!+`jZ7_^sV%{|%a2i}h#)Xz{RWN_V1w&tY)K#{~ok~I*kI5Dj!?iFR zm-bmONT)(%g{d1bofer(gGTT*|8DJ=rW!KcrX`tf-JCGvZtw4x)qc&?|1vO%xZpdj z8FfEk8aN$y(6Q=OHS5{`-T}++ll|$s_9}qfK;k^bAY3Xw`*}%O;WQwR7J4WQ_}e6o z2Y&_i-|R{Z(BDJYQ= z$6d~4&zLT21_lVYgH_?A_i0dukNvtu^HWvMLtk+;Arvem77QM-C{y32Qz~qMrymk7 zf}kB}E0a4J)sDBN+udpn-26R#vX^wZ0AQXMRJ5T=8$Qr~cxU7^kD#ENM&;|GL4DD) zd-c>5hAK4iA)mF;a_w8#>Y3A(*n1Y?YD}EsN$ZU&x9&gX^6Wn~mr=KmU{XmBsBWdv z;n})w;u7$?wNYX$9`Q)*2u*z2>!W6`Gx=;L=(GgC5yxBaYuZ$2JFsau2~{w9IUSAaPYbrH~lZk0`4J< zk5IJa){NF2cL$(zKCB9=UsKN(ilwB-!~@rynAeOcj?2R zXvv?qeYu@76Un3i&elypMKKjg{mYD1SCxcqyDHy1>adwq!tWc{7U3P|i4qz|Iz`TIQ8t(cb7GT^$IY#r*1 z7k^lJCKjgr)}2oa$%&T?w7CMelyO{`Ai%6 z$Ev&$b)HppPKM<*#M%6Os!@~zwCwL#SzQ*Ch79(zQ*@VLSwZ}MPHa1%;&7@UTwWHd z34be|pT$gO5`vJxqGdkBSSPdq1;w~MvbqxKrceVi9)f4f^;+)R z$IoCa-1HPg4??@gFx`b+H$QOKRSqI0ckPsU^kG(P5Fw8he@hvvK9n_qAvX~-@1Rls z6IF6=a#aKsyW00xi}9eVoLlWdX)gl0yX|zBy{xA=&-G!KB^&P%V+bfXx zwNUnEJw~2wC8flv8|F|Nc5OkTYE5&YnzgqVS*IeP3hwUQJkym68+!(56<0Ca$LVbA zA?XUmRjM-oOTy{wt-~7!A--Wm0qKX-5fN1=c(tz9!P zqX%?udk0_q+d)$w!@p+p`SBO4X88qVRhobCZ~rfQZvx*`wKa}b#VHPev#1yfNGomW z00mkomQtWv3epx-hMFd68%UFolXPHm9#Byc5m8aEIHMveA|j$9I07o7A|lQRD5xml zfV{odo=;AiQ?K9mfA9VN+$)@Ove%yX+G}1t;J}a{la*L*I?|$9b);OYCdds%Y0x*g z2tcsFa*`q+$n63$dXUnjc45S+e)b5jBQ>^#(m7IycTZY@G8;g|>KRno?29ne8oMKC zRCbAg!!(=%6qOV@#5|?uTR0N@0Eb)2TNopO!2=SovX3!|G%SQ7q_Csfs|7{oBr|M& z$wQOA$JC}NOOh>h0Lcy|!aKJEC0Bb$1iV%6K&qa`tJD*Wm}y0bpBVsx4bnhnIEInG zAwre(U{-3P99ms-s1AZxV{p=FO$}jCsS+av!;NwwK&oQzNI}qm7(;t_%t^~F8uRfz z=E|tfaHlt9X9$CQ-AIxSlHGp#e7UNstK248ouVcZ`zDSZg;TkbQPd+WKg?&7p)Q`> zo$(;yU@)RdOmy2feF{+jL$6sGA^^uOc?x#RTk1$;+Z1rrXZ|8!W0BWESjb8zjJL^5H&1Ufo86(p_4o|t~`!UWMoc0AI$q074#7O zg?Zk=2}ip^NbCSu&x`44r2Q)xFgDBZB<3o z;DUxxl0I;$wi+BG=3=r#fD!bE6qw&_L4c7Tttl|Eq41s%6j+8UF%9NWh^-zjXu^sN zgI~lIqG%~ibeK!@Gae~s;Wi~^QN83SHo|%34(0^QJFxG*01A(3#QPLVHgH#7J}#P* zASR`Y$TTN1ut6w#xE5HbVH%wRwW8j2_cflI@1 zd?Tp+VPY5zKgW=X2na(^begh8()b4uQADI&W3i4LG>%7vrEEjDF~H&A^`}Hecd{m6x%Z;wE#~@dN8e>l+W8_g=q6Q1}N#5}l^6HCO z5$+Q&SHv7cKu1gb6GS6Js2KaGKVA(Xg#LLpfpZ9&&L;33hDuWm{>t- zFPv&HeC5VhN5@>i(+OSV4Zw03k>*%BRBbK;GGL?_X+C}}I+*D!gp&nThl>;GMjjRw z1zT7F)c$zUKPDZ3lr<$cMiBOV%MlcmzM0|xdCRknQDh9*N8K4mr@q9vA z=|RamCPq2NC+$(ir|u#l8clpA3Qv&6p%scqp33tjq3)B`0_@~bhvazWCz#9Y)nH?W zp1lC0UqL+a7Go~Q5oxf=C5Xo~-QGLMgN7khq=`aS z(q>^6Uc z6{%mfcx6)N{J%8EadL(^Q^Xzt!kPRKN*LS0n!;sictoH)>fe$=McitR9;A3v9U2EM zy?S`M1Hve{V1{jH#-a8B(xjJhOAcL*BD1T3A21Dt>1`B=wNjO!rZ^d@1DO+S(bfFx zmO~bq%&6dmT874C#&XEKwTed*NXLQ6f^d(5d=&^Edn;0aAv;FXKVkg#*c5J98Mk|b z;7HVd4f+mxOi_%*m!%2C#Ki&RSGm_~vfN3u2&%|IPiXC^qh>&A%ci7fG+&8&>FEJf zQFR@rg_)g_@P!j~qLZDlK|l*(i1SWHPEKP4Rf^3Z`3NA1nScxB;qM6QHAln)*&(?} z1-XWqj|d$~{zaWgOW7;Aa9mPuNbDhV$T>`?lX&+^Ns|aG6ops$nsILsb9Y0X2vcuB8Zc^&=uA7gr=-S5u?&MQ>Spz`J~X% z1#1MesZsP!>3hr&p6XZ}L}52p=S;?JCOCv-8Agjq%K|}_sPQQh3U&Wfdl|Y0dKffK z^{!f<+Z5S^_p%PtK8MHR8F+!yd@KKc+pFY?IwGd zRtvEx$;E~L@*s|_^>SB26^L9BN>E^$xS1)Stnz2*WS1H_jNWJ>TBn+}EH=Ep8q1Om zj1&4nYP)5k>KMUMQa+rSt(i?c4NQ(vqYrC&Zs@Q@HnT5SIPhH7v^q9Pd_L93aFq3AQc1dS8So*U9Ge_-cI-O}#AIF*U;$%ixh8$VCwF`O|o`RmQq9 z9#LFEV#;ND9UdbXQ#-jZn=-134T5gmUY3_+vq z1g5P3i_@d8q6mvh$e+O&>)PBvowtcxpl)Bi%a3FVPGT5nhA5$K#1v;pV>L)(&)|6^ zXiqQ-r)g3&7y-;eb-(1`xI$hbA2sMANn=yem^WZV*?x6U*%KzB^kc|rls-YZut&hjUL8dge>P-URX>X9x>XC>5K zc783Xli1I7cBfMn_sGh$zHit=|Ll<4BN|QEigNN0Ua+MNQRU z{-Xikq^O|L2{{&s(B2?FfVQM*P9EPG1`i0%NaJ@2-JOah6ks=MhsG$d6mbRNg~act zRBl=!hOZhkOQu3H@DK%pw%jC+bT9#SopL1Fck@G7)uVq=i;8u`u*NJSXuCWdb66ySqk+8c2&6B9) z33F5azlc#{+D}HA30ndcPxynuP@HU&IOJg1!&by{GSeJL(4t`|#PI{`GIBBMm#X3H z?@X@qk|v=(f(v+NmSmY9vk_)d+k&tIle@aQCquGKcJb1rcqxsk^j*)HS;2P_8!ACJ zem_O5Kn7v1OxpX2-sb*Vawe`4aZvU^sBkdD0-k$)L=iHgDbtkEK?VJBa1iXezdp8! zY0d`g;iYtK?4H^m|JH^X88dMlskXs9OsO-~oWIgASRXl2+$niH8(23dBWdYoLg@=X z)to|ckZw=JD;@kM+;yPXbunvCYH~taZop(RAa95;7S|?NXG3EAbg>OV zAaIVXz4Zk{Xo$7)%7G%l0JG#WIc+M#RV^|^R%%1wHfqubCrFt{mZpGak!s5dhu;>;SM}xy3ubK?Sg9DOFh51axcfm90_iR?2dSa64^!U^D1v>J zku8CzR?VMq`L%RjlsZ$5Xk)RLE-2;^yR`trnva2`ov45)5L7Ewg1e%KL}ZoY1lB~b z5!A%yf<+z*HG&ufoj%!xZ|IkF6S+Z^J10dYL6Z693lCkhoL#e$8BLL%eok#9-`Uik z6<6sN3QEh_YlAd_|71G5W|D`j#EsalUQ$tfEM1Lr<(RT9$3!7%Ex;Z_9SK^53GVOg zGIaQ`V#@o#TV;9iNNlDHZ;|kEwcdy~&=5OBT0;-`w?{Zgwp=7AYGUs#_n~L^UeG8r z3ngz|Slb!tsa@e&Dh`cQPD8;T1_62~@=J>H8=hp48hCo+dh0`xW>Ypz5n&nR0!&?>nc*nb*n4IX5e;BwD}%=$OLmRT%*?EI z!{1i*^s+}_VvafUurcr4KOMNLl9mc8z*s7qWmF3f+>E@m0rqDUYOT+&%e|w&;3AbsY0O)LbthoNxF#YlM zq(IbQO_U%C);RuK%G$otG#Kz|3RBh(+8Q@EP?TayCIQwpHBm`CE$F`_I^fs$|I4HW ziT4hecbm2j`V*wo)JF(b#BAmNjk=E+ZCEEQ(^E#sgc0n6$Z+oTM%)<=VT^zR8dfoq z^eNC~FTwvYDMNK7ACs2XM_Sml+3Kdvwv#DVnKpy;&SEyqZSb^}t8eVZ)4{hKpP zNKMli$rr?N0p^Eb-N;(mx9=0!V14-Q$|^i_f5T} z75W6^{$D1>!v7#@kbLF-?;-28YQY0_34iWmx=Qo+O=9{!}in>c!y~bP<;tEs@V`&ie zh>+pnCxd3{poZ$giZeZnM-TET<`XV$+9~EpHK#UoaP_d$Jga0cEUhlXpw zs+(GK=EczD7~wdG%ie*E1}yG9`jHVZXve<(P*e}O-Anp?8T9-`Y-P60AmmX24z zh>f7^jiF8r&JF*8TS7sPWuS&?u(z(ooDN(i&NLbpzDXfo6(fPzd%85lR3-l}~5}p!8esWvqk%jJAK>cMgJ+b)N4L?(!p38_ML1~VF9<-=k zlv~-He8U~A2NsOl%By~CzJMAf+~qX2szv!GtT=S63A>W#1eP3A=7p&~rAc%VNLJ8C zE6Nr$s#Q9OW!YskzDr7K*Nida&h4H)K)J%%@XVpR)uvbqW+fUm^pWBxRuk=~lRDw1 zI+bcs3n6FBs*iBiBdu<(d-y4)`a6oSVy$QI%4FF)|E82Sc%IYBG(D`VoK1T zrWUJGt>0Q&eR)bu=fLW`@^l*3{j_x!GeqcEX79igpi_>NYJm}Fnh*g^kruyoM~aNJ z8h?AFfzFX$x=C0H>eTqIXn>IuK((0M6qI^FL>b0_eHwn}e4%R3;9xQaF0TXsVg-UBW2_9ds^*|_ z+(0uXvOW?^I0Pa7<8!C%BT0t1s)G$Q*a=dZGB}U}>^{lGz|tO=#%V>7nMx_kL`v3^ zg=+BfKoH!(iY-pp#wrnnJVl6X##D7}9A|aMv~Wyi)>auii1SfnGShpDW=xA7bVtM? zRk>P#>FV#AZU+wAW;s&Kgste7dBJ4gIV;Ou$3l>eSHvJNCPjf1s15@Q6=AlH-iV{R zS$LWw#}VQ3ffz@6#-4g38Kx$93?!RXGBt+T>0PNlh1ZW;3S8i%aR~?ms)K09L3Sw0 zt++uN(!4I76q6c=;0d7a0(?_5nnlDXt&pzff=s4Ctl8#rrB4>iCpVWXy=zzg*})^n zFd{Jy4jJDHB!aQ2Q6~Z73qi3~tZnQck#NmPK5lGD5!V zQcRQ)KX6^8%{j>bQ>|>1V>D_lj!+;@Yp4CLV%+;^#3CYbNQlwo;qtpU5 zAvU2QXKgqb4H*tS*0!0s(}iUU+83KcZW-ibx|!RQ z9xh}-G%t1iE>N~a1#(qn>AexknfowmINH*(m{3&TN0BESd6c6YJ|KE|ga3Ri-EEBp zxuE~I4<+3^6vVOr#oDll|FNqcY0XHDI`DM+cZWJ4-m39|;ett5UDWJZ9|INxMRuA- z`B0&KHKOl&mlYyCpjkCi?UMLxHfqeL@p3Q?s5q~Rl0pmCAgj@B9GP|sB$d@(GC`@9 zeXB;&u37J04D*0g4S8s0uVF9q6*LGL>Q*ju!>a4t?vIB0M=>YRpv)ptw33FTto}D=Rw8v*Tq-cFdgVOr;OvkOq>~*E0F3gadHm z3EUXu&@@*D>bAgQfg}2+-`nVWb@2PK4Nr9h=NB zD0?BoJ_3IYMzNHLXPO8r9#o2TnfZ~r5_}MtNtt=!krUYr}ei94tFw#9b%Nve2rRhTKk3nxhCa6_Hm>6b;9tphqcE z;iyG3Y-y9)%onD(Q$s4I*ntrmKM4T zZse#y3oA#T;ovdFHMW+HB#j?i$^g;`?KmziT$MbaqRnJo@SIEy;@PcB15zmUWT#0q z1p_fxL%J*~GWQ`z^(_;7l%{)CZ0y)9NUYBn*`e|;Z0ZEYP2ra5sTOgI8)?|mX3Moo zb-7aHG*dRop_{DM_+2hnNUS5XP3Q59fpp+~%yZ_@!ID{`551H_HVka6LfocLJ!}=K z!ulVokObxyUX}laB8xdd)bk!&I6qMvFM*5$>RHWT{$@Zp3ymBkhXyZrVbQ3BFQFk5 zAgTrRW5yUWPBag2u~5IL(UqnR3I-K7Cf1BhEybYdiI}D>JF_Js9YL2xH|P#%np6Eo z7ZG)wzWREv$LGTAVYGRkCxSJn`${_asF*UFy5tJ)AgSB(nEV6Lm|L?2cU8O5PCu1k z1Tg$Y^#>t*RqO98@|dlC$svz9+LxZ>v8T!Dk$HE~Jp+;cc~8MbOSlQh1I|evel+Mz zuq&uqyO;R%U`T$om|Ic_!Ky_?0zMf{M??{z9H_2g_Pd%P_L;oaqHaXxEJ_iY>Uc0$HQ`WXfMwk*C5FyZ z!dWnT&d^^jNB!zAwK9y=u!J+OX>Z&TCAxy;4jR8GBE@&m|Pkh)4OIYY+mF@ZT#ogehxg{4IuammU zYP%eFmSMHm<276ozu}m*__y1xv79)J{$h9DJeF0^uuFF92*h3cGNhQ}ue>`()W_?n z@ilop=>|GVsK#toQ)W@|WK(q@$4n=;eZ7ySOW|Q&`;|*j#SQt#38sx-o>HT~T!5@mP=SA{baOWHH&CEJ6tsjid^Q-O$ZE=}pKZBgugL zLVd6JDPewlkKS`eXE`~YMH^2+{Zc9iVGvvgmm)GES}aR4lTf-8qfwmiF!xt-`7=@- z#ngHSXe%~3OsT~J<3P?vUu~4ek09&8Z+zBp(?w3W*!#mh-HErH$|A_HIg#o-6uM!K zP#z;G4!32)*9GOFJnCDVYV46&YFY!+@H)kuKwt>CO>6w$d{)1~bh6(|EPi*G4gilQ z5oi|YL>KI5s2CXv$#pWP7GFdtaaa%* zax~*KXKyX6nv@2~qD7YoN>|GR(os_jhFI84q&bvgEJhMsyWJ`zlnMedEDLL#DEN25~%UPEZ0%gjHB5b+`a zBK20Jxj#T!<@MnN0;wDf>vT3H<6-7Ci(M*F0fx|9AH|F&%m;u;ZZHsnFBpbE)Ae`( z(du}dFPS!ok5k0-5R8GyzCu@sxeCykt_50~2BT!Ch&jMO83^9R7QsP1ZG$y6Aads( zKrTgC!ct}V0yyvd)PRtIp(J#`69&2F^~tAZ?;Kvn77d}3GO0d0!!caP6mEfbm190x zeq^CIu??>$pLayy5?)XZQmSnj3<(3{r}q48=gUM*e9FLH-{%*h^Qb#_Ofn_=cos93 z(d#E}HTLl=NJ1$+QYX#t1u)Ipt&qVSOY20SDJ6w|Ga zQMOe>a+A7QW=An;wjs+f4Rnm;NHl_j#%<*$ZScKR89)ytvei&#z^Rrr2PTLSbB28p zF(#3|5^^7!rJOWg5Ai}B6jez~#RQkUG~}c431qJXy~0YlK*GV)?81JHd#c7!;)sih zyFu}kXl5TQrVni?!HPL-JdT7)RrF3GO$g)^%oV#;q9G|Q$ZYC8nEnwu3Cx)(Qe~qh zACIX*H!)8TjZ2r$u9o_cAKX>-#%ZK_bS(EZQTjPf--TK-rUpzGjbm_7k+A$NrO^vJ zfZ%E`m0P00J|QxIhfd9K3>1l_(x@|oQki+0uoseeqfPPCfq&5iFA#DN))iKe&8LOq zSyrYpr8G`(lqT)+qJEM^Y&3i4`(2z-V1bNX4KAM_LnJx;z8Wf)22VI7Nt8qiHW!yl z#c=$f<^}g#r+E(f{3-KHb!l)F)3Fm+Zk%Z8GzBe#|a&rIhlK$h#6+HB5#umi7uF5 zi>XYb7*)7GtN2fef6dT`9bZd2MWoAyK56iUB?}^lC82{QPm&Ro{lXyJAdZIA5vsNY z8O}7P8;-whEX9C`iqz&N=wYTSdc;WUxR-RWx^0=IYbOr@hcChtp9;!RSs^r<5P$-3 zXsY62&8a*#Hjbx&BG&WRAjyHLA(gajRI^s^#q3we*3p&HR@d%QVZ$-YgPJtngek#2nb?>KG|4xTul*P$zoi^b7v4X61>8djYt+H9J7f-4lO~EoH z6yt|2(?7+yY5z~IixSO=zyB9&Ap!4Yspv+@K45SDHK|FDB z4o)iLg@L>g6s<{sg#5I!X{xDhN}L+)Ep?*|)})6U38eFGC{8P#4QF>JkNKnW68wsY zSqTi;5J=UAfJ8A}CmS=`5+QGjjqXv6bjctX8={+1I0B$I1=~%g5eIU|8}P)5a-c7{lW;j$DnP+G2J|np%^R?Aj!;Z_X4*DXZj-=9wnrBG)0b1DJ}IVN%RtLH&9- zPsFSe!y+e)Lq8$Pg$Nam@r}#KAU(*)pl{u?#>I_t=9J}Zrlf2+j#HYJo-z(LmBxIr z1!GB=&d@ta#?)BU*iulIe;S8{E-X1NgzwWAn|`B&lLMVuuAmOdt-ZxOEvaMHrX3`k8Zy_M-^>=OBmdVhXE%Riur+&p_mM>`F@El zo6p?5A$V2H0M!r#nJUAhjti;vG>1S8_?yD)m|TZjcWv0YH0Wxj_?7s1bc;}XP|_JT z2^KenzcpCE2%7JG_#(G0xL?QJx8=bwW8kp3z-)-bDAmcrNPx)C7f8oI^UT4`wAsgq z9O6>uZgo=&$_RR<5=YRS44f~ux?1uhp1apTzXGk-ng|;+7dP@y!Bif>w;fgucH9oe zaz~`Ww~qsWhKG)wFS8mr5aw8f-J>QpPDv6n^$){=n53&dl)|XjG)DWTCY%v~RA+_p znKTFsTrq+Lq2P)MuZSrHjvk6pafRSG)waY8c^`unr5fs~hwwu8BO;LrS6Y3LP|j^*#t|Ml%B8y})K1QdP6Whb)OP&*iCXQaGtF z3Rl=?1R+L6n4DNss0cg@E`Mz>Ozxk0KB)#vKQt(|QpM+j`rWcXYRX~2q=!5-uMdp2 z{ZzgqC3!qN9S=lHdSUA@>xz2yn>^5*S+gSui>3eQIH0Z!lPCf7yeegf4X%U ze)rj-(MRc&Y;Bk#_XCOe0i z+donIgi~~8)>9msbp9;^#NW!cND%s&_R1YJb(4Is*-uy4O?JHD3nfIn8oGHzKgX1e)V|o*TeZ)fiAVhNy%P!HIFKY0} zlwijUK&bYS91giKF-RG|Kzz%`j zq@d?4Ne$Eb1wAaLEv1>ymnIjqo*#Q8aC{tNbE_CY$#{*3G}5Jm)FgFa6Uk$6=p(n) zJ=2M@f1u(YCOr;#EBCa=TdQ@5ytmMyB5qPbFP>TQ%NhKk_v5V01ovP;oSmTmoji`3?V_?ERUqz>)PUYyIx zX158sTWhi1WKi+{Zm-pl>rU?*`9Qjs=4`gpJHn&7fa?x(Wa9BP_zW#0gG3e0rlZP? z#(*rKwLzM1AEhN5U6Aq=@yb8AlLC8@njQeJtXgB+ToUf?PiNs7yHm+vNa?AYK(PlEdYhzRH7Nr2R#!i zdbU(y#vF*)j@UXOgkI4}Fjo_9!G9{3q?ZIU4HPu6Mir&S#&mC)KejmzwpGo;@tOPy zdA|!4s?xHbJdltg8&22@6CG5KWYE7po6MH}e{eP-=a9v0iqH0DQ|;$JnN2JHz$We% zIGe{Pu^_?maIx5waZ3VmCi2H}D_ety9b>$OozaAR+E_xq7LcNlB?C@4C*;c)nPd~S zLauhL8S?($(+iA9z`$FSbgJ5Byri`hl>5k*#S`?SFT&A#}K%K8-Bvta8 z7~ZHSn9eGumkDmbXuyZLt{@Ov*jJ7DcpVz2h?6@eGc7BX&aTrL(=5s@h07BgNGum8 zGAuh{#wsPs);(sGJL2|P=Wemf^)Pixuq-qEPODB4mOp7u%VaIG*Jf#wMP*rO0VxA* zq0vksLuc9HH4O&_I0L|H;M-H^RHRZ+YnvItUa@@{H0pfeV0N$EbI%p)AS8yQ=d4wS zKFhg1)2n?E#r9g}WRPqaGH);}CcNSMjf%Q5GaSQ_+~9>%lqj~i?~GIjR2U6Z`&=N+ zMei$255om|hBW`?qovA6vMiXXjb@$H`;JCBh{^?GRTe8)<8X=WQ5G^5T8ZKHn$ZIP ztQ4 z#5Z-ZYfZH|#tsCX-hhF5w@Ep2l0bdn_mYZnpNbB1YKkoib>ecQpdKSYPIlObT9qKx zF1W}9Q>T9jyy;eS-Ze@DFDk$Ec&nqewKUrYI{~R_j^<#LA0~=h|Bb^;cyzzd?ThHf zXo-%QS)6BIn)g2<12HB^t*Q86w?j0-dN>%gr0rsZnj?M{F*!NF_{@x6ioz6jXcX-q ze9TiLQLaAhw^=@k;z?V>h>^MdOH&&OTG9F9YYV;8va!dC7@2bu1`Vch3WP{ro_SY9 zvIE1pbUrPf`ESCpG>3G_1AMSCzq(dN=wp1bjJ=_agTd)q9FY{BaR$_^K{3O(td=@P zQG9J@s05K~BL&2s0%W0$1hdqCkC3X>1)z85ok9mXa597uu+=vaygq}5D>nTujIIH> z(QuhG<27h|P0;~V@<&kz_OVh2_DL=%31Bh<(zW5y2s{pUxqW_ukG-)vL9er<$M9IS zAPt5rXp%@X$k#E3rZ2|Ixk6YU04ac^Cz=Pi(dWX?1I8NpA}9fz0k}!Xf5J=|Zw@f9 zcZo~ahvUF1FsPh^{}80Zf?ucsE9xepbPx8EQZ1$$!vNO}BD0{l)=3QpkDZIWDh`zn zLfiuCAhhc~is>jU2TLuhP2B)TY`>2w&0}?>z98S8zM!TbRT{JG6eYW)#kYP5`hpqc zr+};*U)4)bvRO*4+%h=eY-uDe2t!RcO^*z4D63F4EToi+j#+FYuD21p4$83F9FpRy zs;YIz5{^|>7`QotP_+*9suIp`^`ur;t(Q9O>oOxU zG>DUrAw|+@9t*T(K{yx+1ybWzQjCBGlc3wLAuB3GLjf9T80hNZ0sMKy@bZ$2SOW&n z{Q+c(a05otM(-z@`SBirc!cX3@vDK>Gu1TO2J9dg>5i+$E8|uowhw#Jzm`h9{lRLo ze~LsFY_8Y|hXX-DcC~Q7kp;$eQx=?_f|N0^gmKxrVhaHV0OTQbiWFXq=Heu!kPwu} zE#tI6(Fv|*($yNW9qN>>YpDkp2*?P`nrWwlh9go^GT~vvUM4hZ7X%D$ zEw-cB!Xe8Y( zqbwR%eMU2AVmWPbh$cYM>->Q+)L^NoLOE~4hjRSU6 zqzQj87-BAxPzSJAG*&&{@jhmgObUrK3E^mnC696i9CX{!oEOyv)ucNURhLSWG?!0> z3|gMTr9fiCr0NEU4i$Of0V24IR+8*b=JhC4Gq6YzCP5N=f$ngw%(gg=B>{T!WSDia zo+4V16~!cG2jXzYKh>}oxiLQ_$p1IaxdlP%OyP$dM450V;~r^Unnn?|i}ju<4gg;9 z($ypRFbtukW?Z%4!$lHKhMt@$%JxXj z*Wx}h*hUjp{1hy>hG8K1)Fv(cl^5O0#fN03$VhyCR)UGT@HwIesVXhLx8*cD= ztoz&g3eh*ix;B@&HZ~ru()c}0b2xFrSokvV*{>> z`niS%J;^ZwDnw}jN|+J2G)$=Q81UmA1__o4^b81O` zX$(%a;OJG%_m4=;kO^~yDCz)#ax2jWSohOVhmtSBNOepw#UnX6f|P?M_gn<@lmeHQ z(|C@mMu&C_-W0PK;E6CnDr7eb2i+KZQBoTYjRvHQa5Iz7BD2A+f84W7r-oY>n{=cI z(VDvVgf)6{SW9{#PzVUGiI2NerG*gSM)1DuqQo@nqCGEDPVIU;Qo5EuJc6a_K4iw>G@sld;I$R6gjM=w;!* zL8j+(QyHME9^)?piG?b5xN70{*HybL`LK>{IhR5sdYNxF%gaW+*-ZW5z|K6)BGpcqZ3&sAfCnYU4FsGZjWR4fK~c}ZC{XS* zluSjM0E0k$zwDwl=N4jC^DTt5!+3UzSRv~l#DecMTM2RAY{V zrEo?g^mNuS4twgbW=|9C8ymm&BuIwgxBrFBiL z6%}_!tEnkRL>z)t8xlr54ldQ`rryO+w>)u}OB1$^nhI8Brv>HB+eX_WC8f0F`b6*s zk+~dNaq;8?Dw)l4zYDjxu%^|PS-o&ydYjOb64m(uk+Hip>LPOqUF7u(H(Nhx7^9Ka zk#k6sA5fhqI!KYpql6xv5N1Uyr-bKLreYtFK#7}5ak`4ejAxW2>q5Q*1z`}ff&MBM z5^X9uC@bwq@n+O!q?r?SiKGLWTs@zh1~bII=4ABr@?6cy$T?7K8VLrm>&}#V>Y`4n z&CbkJHgGC#3sThMGu*DQ$IH`|iHPl%Ru6i{dTW7&g2QRtdc8XK zHPP!;`;;E6NyqOpDqIT9SpexrQ|)$D?+)gxVCibeqv^z|(R^u0WSn{#gauf8z~Pl?HLl6-yh)(Eeg!xB*2Y~Lmix5k`i&1#yQg+7V$hjoM^%8gj_Xiw7o9c}6-EA<&4MFOKI#5N&X&AbQq; zkb`$D)0tv91Zx>9!6tDkG~*ddaI$UUfGZm+-y~eLkS>V$abBJrK|^6QGDy6o2s2<&+6YRjyMoX8~0RJ?k~SbazNFe|yDZHnmH z9&tRRy2nC0>d>c95Iq<=10}@~mXz13=41#IE2=m6i4r@H9+B8w)l}A`BBadJd=ci) zx+$`KY&4~WGo@FbP97PU)5IR8i8NG4YfQ)nzX2`aL1Y7!wTx+S??u5#4Ra_19Hnje zO~;MQs6JBCg-|rkkr(C`{Dcv@N5N5S#d-wdl&Qa+q|h!iPVk2%tXji3m?n}gA? z5TC=4XpkO{H$rKt#2Zc%sL3y_=l(_mnChO*htAUDXaNi?#2d(;h%!6?RBT*P3w^6V z-VsY*fH<-gVJzC$%2>2-a=~zF*hiM6oN6;#Fcwt;$oQy{C&u0ZGwQl zq8>Q;*o5~yiJD3@(b6U>G-k+7OF*sCkB2ALGdRJ|Oad6w!DXz~oXRErpsYMrXck*S zabXOBt`lZ19|H$aXNrEYCsM zO$lj+^Dj8T2&JNmf;jakKdub;AfYiKyDG5JLKcP%wK~kxR>`mAv+j*gQ^5rfzAi=6pV<$+m{Wit6L6>N?vO*wj#kZ(Rx=P9r$?M^cs!?UpR`q zaAqCU_+CX01j)PP49Bx3R&Q!+t6*Ui%qWPk*Y888Hv&;ar^qxxwe=dlB|Ww-hdngS zWP-cMS5srcxBQbcC6Y}pqbxgaSKM*L?M+iIToz3eD`VG&7Mxl6&SM1gC^!7tpc+1A zI@qGJtL0lG745ZfvC^EQeF0Cfk>#32V;O3=sIMZW_IxrklBug8ol2+KRQ0hXp7pqj zIYI}xgY{&SdhDB|#73@e;iTaRr3qWa8FCp?Ez8HrerR#P|dNTvxo>rr`(WgLkScnOuj&=Y$Wka0wA-* zrO9U!0XgFIJHSGQ<~#I@lSv?Xfc_>Q#^#Jfg;tH#6-W9C;(wP}F06K;5fG~E1}uw{ z0=3)|T88PxCA?*iBoAt-!?D~i{Hl!6Gb@Y2v*PgtsufVZHLC#HmvevbUU|ApSg6H>5#czc-@z131BfpDHyx zK8Udx3=>K@$nH>nRi-)w<3QO+Xo96YQm?5NWxzH>z(NP8T8t~)ovM)wCk$?e(*m#B zJfR(VO3?42ULyf-W6N6repTiRjO+PCG5;S{IjvDaBTVi{8<3ZAt0v8k;QU{oHNzXB zM6fb(;+r#t{R^mBZ^fOx>mA}RC0!7!cyhQQ`LaWc6H1Uxa{(R|W$RVEW2+8c3&n`4TzV14qt zz^lnf=?X-yYIQ|dr2<6hBJ*Fw;3CCJr|l*Y^{_LqXx;$h512f)@5c02gLh~O?fFugC#%$aBqGCCd} zWhhM=a4U1^gAAgXXz>Bw{bWrtg$6-Mtzo^dg33fHM7Fxzu*#X4dIOo6PAFn1$v6_% zuWIN7p)RBrf{+JeC&SAl6)@Koa9E;RHhPh^UOd8hOH3T9rjCWwFMPTTAD|elf@>Kd zb|jN75s+kWDCn+BrqUU`6|9nXny0wn(;<`Cv2JLhAu5hhBxcO3PMXTNsM?4#8j+x* zwVO9KRDa9TGz&eLg=;rU(P$;bq8?#X=716KSh8}CS3E&?l&R*J>*7B>k6O_4W{F^> zTo)J6r5y(t2b$gENW@8vdkzy`CiNi`h0ea%PzY+KVTzMJ9TeFN4!#-Ux!5q8o@;A) z2o?z6Ks|2Q$l)p_7116)0J9U{V~o(_`e&(z=seP;g~OD>9jWY63MCnfkVc8ncf|*f}GDAv(FX%_<3nrGqFl!+eHwe?qLaQ** z+>{viFPCr_j9$a|kGxKYj)p988}QAIFDg=JB(B~L&H{6E-H()E~3`!8jW8URuXtwUII9jjM&l9Pc6iX37{hcv(?A2)eX$MUkIyU=cGBp zQEEnq<~;1q5YgnJh|`O8WjHGFJYb*|AuOkMuasz^U8)gwG?ZS&D%{u+pj;w6=nufr zT`x{SnuBgvc~_GAGtKFR2bfnGX;IK+PN19%sSTN8_<{5dwB8sDdxR)9Ab5Zph`d?n zH3eshO?2X=@jHEiD2ujBW%>%eF8%hzj7aIPvQ*MegtDc~SHchBrwlL!fo1X0Oa=1x zqhrMF7zi@a8p8&t-q+_Z0YO1~QwxE{f)n-K#6AM2ihHtEtSUmXxT-?EL+eSSVgN8h z6ai7pkYe^@E3J1K6D5_a{e&bpYO+93!59Pm)}uo+tj5bew#0~yj1@OB(NCC3q@C9~|p@z|xngXjz<-B$i)kS8>& zrG$@_%OvGz772pIr}&Waak?UsAs39A3_){sNFnI~GM=zS?uk5SCKFBIjN~~GmPOX) z;w-)!L|ZA$On}a(U^F9!*I$#Guhx;p>(KL0GA_ib8ggqlxxFk*F_>S{(BIstjbESK z){Y6y+!L7vGQ(3P=9yDjR6Svd!qq{JGP=>k-KANomAa%#7vma!0&r;-%sk z8W2oeW!lHeC!LrSo^`q}g0y0Z5i_%QG4dj2gMAm#1(NGWKWxEVQ zJymnYlL;VdAdis5>Ir%gB3maClU>XelgwHexhw1Mpja^WX244M_QjWYH-R0Tj<;|O zQm1#biq+HTeQnRCB}ORD=Sx$y>I8s;T>~shOLpK+S~1DD&1*1rV7JpBrt%mWmzN$+v8hBHwV0})HW5E!K}^bTTpN14SqwB0g~gwd!=Zi?cMnha3_TEqb18O{QciQ4QAChV<+6g|x`W8ps}mgZ80 zGb_!84;m*`*p(xNT{+C!(_a6gA)JGl?y>LA6moM#L;vQr#cGbducD!NmzBO@TaT{z zV63neKO!kWBY|8@A+#BsA=3YNo7mws-FH%Oprs??gbuqy;3l9EA|QBv!0nH+aCIPD z0CTQr*eg&HbjPHZj`4#MDUVcx0&e%fjUF6mur6peK&yOQ8CK|zY z11P{!QMpHjnZbh=R4aXjmF0rCXu!+@D$#AQ-x!;x+AHGME3M!Ngh2tw%LqjT!5me; zH%SP}s2XWzJ3XdYHF?Ccz0Y~MZp=+pbWP~vouCV7raB@NuA?oj#2&gYJF7O_>S{T1 z!;_Psc7LmD_cB2-wRmC)c~GQp@~0O9eg`AntQJ$G&cM#npb-{*KvIKh`Du47>hj50 zPewdtvB@6hzY+g28m6X3%vp>@hCYZissJ+aD?X`tb(pOY8>r0R6+s?`l&P)tA}11| zbqb3*x0OkqkUGWuLN`c^RUIs*EGvy+l5v`)JsjLJxbWCPLs>9fCK1y@Y!E3F^vPtG zVhVt0L>-NbVjM@aM$KD^tZ+jq^0{m-&q06Z7_lZb%4U*9Nvo!mT1W{k+mmt%R6&c#$pP zRx4NpxL0O|s#fXHtgzE`>;of`T%Leot=VJN*=hE9^j#x9Bhs~zmoOUeO#%yFaC!k- z*f3a5lE%d__iz~8SOOu?qe1z5j2SA z6T|3-)+{1qEw)@n_<<}W**^jDUrjdoH#^>v4s%WPs$!Qc6^Dj2p`kKQ{3hh39YXP; zRF&PTsU3P!eMe|kJTyAL|oG6|rF&%=V+18-In7P3UNKmN02D6sWnW{84n=M!ANbER!b=Q#ogi)`3pTt2wmtT8W+Rm;X`M28T6U-#yN)KKZD#c)HlO9#uctL#*I_LJWK40LR^!yhmI`W zOVe#fz^VX(8PH)eDGHBEz{Ol@NnH%XYV(=k19Ye+Lp&+~;fyTSierdhuOCYhV2e&B zv-H%-S{WKm7s*msAu@9;FadDb)DTZCZrN&s-Vo}`oe;JM?HVM-W(i!Z15=k8OV?n- z5`MG}kI1ai6{h(nM+ui&F80o2JvKp>e3KJqN-O_Pkvdc z-;`?!v$b0Sn*mkUh5M@0d-`Mx8=cnC~Kf^O(fB>3;D+%4`K1L?t3k!U4@WR5KT_a6z*Yvx6TRUpEly z5Z4Hj6lfP|7raWz71+(yKdYNFosjv}Sx$;?GRRNnlnGSk4b#Ca(iF)CWf}rbb{SE* z7&GK&Q$s2j+XI8q0uli~lc?e%!?2F%gC;5l(_4=0G8`#Gy@HJEqS^$)2F7?Q;JQGn zabAo8HSvYJAqe_hC|w7}9#yE)0;#f8E7S>%S%1^`-=cR8nxv6lwA|uSu`(qEHE9kb zVi1Sa!m%M!N@YWtJf)-Nh#);B<3nbpsWzyE3hL2(*OUr0enZE7El?yD@Q5%Hz z0w#N;7)R59V2!Odpx@=JhP8G^vYe4@W!FW7X`_!N5e42}rv|~8slRiIb4+^nIP#E8 z>Pb!`Z&~<8>P}9h1^J&bnfME~81oy2iey0*w7y7ovU8f!rxIPX#%50$VeH*yy{c4G zX?AW^_IIq|X1odXI+Kw&OCiu?2&u{DlS@grWE18|&d^5VVuPUr-~%&s;k(%2Vjq(R z1>%YqUN%i``!Su#U*p8)FNIa5=~vJ+fJ`L0I%2v&P2U)!!%W!B%z8Se^ki48h|Up>Z(8+A=H`@Cx>ho3!H0Lg*`q z?&bB+Kqj~f^Z+q=n=X14^%{D`G`^3Z89=W_!}%h9hq;01HL_If4wOShog;++L)mJG zmSIHcaHSTPAxwY_vMG5$V@Sdkj9`u~ zo=ldz3@GPLT{g0DgFIy-)rOe^bI`A33|}bc8o|)ZwlIeN8kEurN)6CaeFnW~WkmmDh&M!T3x^QM#-==ri3n%1iWM>3 z1YsIvvP`BSV0n8G?>NNerpj#~c5jn(+s5%u^o3L#V{T5uSY<@*%&1ZgAWS>jStW#c z{sF8NTQ|5Cu-@gtnGZ5n1y4SAWCcV<-FBHpNgYA|&hAZudZzYBRHDY(<$;Tl&q9wf zpPpT;bEh6rBisYUt39fHfgU2ZF?mE1FWEdYw zYx)dPj{Y{Huwtmj`B`-tIt!uP^bX@4kLoratey~ue&N-KlFvS|lFvTL1to~%$ndI} zi>G9WM(`ZLqbMh=h(+lRLn^(|i>B@j0hlWjIb30m$f0Ag1L}hf^kU*ER#93{=9MmE zuZ$e#*3I90@?FjK|13N}u->ZG>Sjh)KqIhPFeZnZ34n8Kc#;+N#LVT9Q#+K9a%d#Q zoT&_Iug}|S7Ikq0Hy$Oy$D_VPzycJlt;i0FpissI@e?B8rJ&Y?*AHMh@Wtlhn|SRZ z2g}+bS80$YlE=(UFyTxCNd3j#EUEx=i)YkM1cF`R286M4y%!e)GIYTSG>34^u^v71 zEDP4uz;OrN6ikN~Zb*XE12q4JL3xTs(4^94WI8drzR;xji6)FjCu`|O>@0E?jwpfI zW!~4Wh=Y0S(aXRfBXWDwaZD7E{ z2J?wVS&mPz@nTg74ZkG2Y)rRsZ7>Cr4x-zepx-H#pYMqMCLE+=hw6+sR3%3Tzsspy zh8-%h&3tYj#KTh55`bj5zd3I}t&)YZ=#!CUfeJIStdJpVu9PWJWMB&!Vi$Yq4tm3G zwl{bV4A|;42L@a}WW^(OgsOs25(Eua`yv=|frTB0^DI^hkkkwc!(F}*Ee z!`Ayl!7TXi_PJ;@w3D)p?s-ydBaZm&o;i*hscWBgHrxT`V$D5c8qY{4|af&cc#k>d{`4 z_SoQ2Z(JePc&a|q3P}V?g=$rmUl`}=M8CH_im^{bIbpzM-laSzEXDvzi(w!vLJf(a zujc+4-g+0Pv<+=jpo$xeUV>qoTqqa}IWV|~7&{M%0wLOgA`tm>blEdIOS&f(!_P2t zhFCYXXNBbCReSwRoIpBK8;k_8Co(3Ba6zO|-dzktYEeN1$JGc8J{sr8$pZt?WO$>VU^=1ZJmg~H zF%Iaul7&-K55<{3GPb%53eP7(`J~PTU~!eBbm7Uy6vM22Lb-d?AVo^nT|rd1{Ix;6 z0`Hh^8Z9m+EjJ;y{Yt)ML7L#QBuVV{y$Iys@jq338eFF$57(xnx+)y9xR6BHj?e z_54>yjDe~)0Zc!_GSl;^(7$R*I&{wllF${g*qWSNV5&yeE5gr(De)kag@SP#mCDw~ zjyO(dZRF`jVnKN004KyE6sfoR1h~S20Wafgn9u^*34-M6DZ-*AJeqVd==VC5P>f{a zS(HmHL%FcP(ECir3lb8`r)`v=P- z)gy-v7o$fsL+BU~vgmI0&%&YLS2)%l52)Apxb?!6;ia-D=qkNGa0`(SG|&}uIOBAk2=wUng&p9u z403zI1iOPFpI0=4wzh7R*I<-5sr%(Imt!1>sMbMYm4UG5y~k|#v0IC?c1~$>R6KIz zkfLG31jfJwjf|Zt778Rm`Z5s;GAba$bOA--QRqVKSuBMepE!_R8B$bUTrr}svb-fT|Ke}XbNt4nXfU5J*ZII%pA*Jc=TxWT=%ayCM-784)L$)xk_GZJEzI{M zk~s7e<*Dg20j>^vT@#Ui7oP-24>KY^d+0|x2J((c%T+jXBl^9}ury=~f*LI7g&y$u?KZ z<8H?m$k(v1+Bqf8yeVa-(K?_sfGbU&&SF=<*or z(+J@7C;_l6lb6>*7qlNq1!6^@4lJuoK!&-ZX=-0$nt={++yK>)=eW~Jew#*%D@!mH zBW(Mc^sPN6{;nUVBPT29m@&W((3amk>X>DRj`A%J0MJ0Z^5i#GoQ_Kgbu?AWrAA+Q zrZV!z&^~$6a6Wlg29uGYkC-16kGF=M3^@l=sX-r7I}qi8+&@#X@72BlA!%umD1RiK zmY{s~rkc^W>`F@fRY{HAVxkJ16xk4XlEhiK*j><)d%v9)On4*mV zgJqgWG0n8#ybRVv!)s2VVMo0o`aX@-L_Un;5TH#xPblR{xZFPY){E&mmr783ni$?c8T)c5_eC) zwGoUkP+6+8ouzRwJ0!|FaaYR`&Z5%7^78)4HNhakbIApcQb_+D4MBF6Ji?1co#zvl zCo9L9m6ey1lb4n2tgI+{Y)KQY!@FWDS@W%E}J05=O`s z$Z&;xJ}BW1`h(#-Cz-@%tQBkq$WBI|_WVSxN1FYlW@?~n>XQLBtF*nk>^$c4f$gEA zS)MaF86ZL~59qbhvB5lNrneqp{!h>U|LH&a`Db%xWB~H`*V<_L{P*siLw?KZnbjML z_0H@~&VSEdy>kBV`TyVe)34K@;YAe}k0^Eytr%A798o#2w4}(HoZh3y=$xV+JqA?_ zqCfP^$jow92Yp6(Hbr`n+bG#NbY$`1{^0inms4^p z!DtL11~{y^qL7TKVnllJg_R|v`X{q4rDOJ1XVLJoisG^gRtcPge2lVacq9FNMliik zpI&{_v!J3Lbj*%^1BVZ~82%laMZOlYHtQmhP+pH7jg5`qgOw2s*Y-#*=vOjqh_ifT z5gAFaHkeWCt4VeimXgNEjFDe^6jG~CtGR>rP$)Zsr#j%j(@UERX{9+J*cSQB#@f7TH$id%{u8H+#W-kB$WW-l zn(L6Tf_^>7DAD;^aV2< zgTr1gBrFs`{-Xg8&k*Si*K-|Bi{145+}?oUWiy5gO~26j?$?8Lk8INH0#Z>~;jm({ z^U35DDU(Mw8dw2UmhuJS#hl7Ym6jA(ua-0@Em1ZTov#t`0Xt_W7f9o!ftY8EbP6m- z*ko6hwge6G_-w_Rbrdt=33!|pa< za-oJ?0bj(m(;9e7CxeVhj;BI1!A`hrsHe(NmaLR!=7O^Y0Z}C`i(f-F)R3*5EEdlo z5ghbeS&4GtH)yNhtmkUq2ZEF?akI3;YL|=9_&zZp?XlA5LX0hw_@o0=PYT>qS!rrs zTaMB_2!NHil3uhDd063s7BiO^K9|DF?KYSzri*C&W+P@DTB@!$txiUYD#a*VgU}+^ zWo!53fJzqsk$X6pUhPdsuRxD^JGFe8*euIAE|y92Z0)L^bXWCMc2%Kt3>eOo%n1k8 zlkTye${riYyck+hM-HtcN7*sdb%J7eJfbSO(NbM>UX+;`>Gg9&+KMjqqSf?L7Q7bm zMJwvarFEz%F90?UG=_O%_}&!0w~q6?f!au&=tkmN`p{bBt{Wi?2NDDKrNGj50ueq8 zgp2BJ%md_urT@k`jW(*_yEQAeia~i)jWu*_rrNW-0P&C+ z3(?fhrp=xB$dKXm(vM8EiJUyJ-4$t~6HYDC-zxPTcSwmlL?$QKeB7vOq2dpcut&Mj zqg<6hL$*!ytK|vKg&m%&?r=^SgT%uZiu!Hb7rC(8bCumbjBuO@Y13TT?77NjXPW2O zb`y-hC!GOxvyX5^z)3W559sjKBR-gVyp%JiNl@;L07M4MTNwxmgxK=w$%WICtDK(7 zioxl9oaNCFIK(IF7VHe=*wA~gHS5tEDv+mUmS#EDNInIeUvHpN>_Bqt$LqfSgK zLKY<4&*=EuN9XSoIRUpcXXtsR`lQ+MLTkCgoMg?rqGf*yd#gcqNMCJDU1F* zlPi{RxgryvRTK^^EjEidouf+zRSfN)oRyi`6{KhtBjGO)oDa>BH466(D#@!+PYtO( zhYct$O0EVpjD_?Rd-V+2TpyUGjZ{qUkUzuEh|0FK0=j>D862tmJE?=0eB>gvWd2nq?Mh7Q*W$C#2 zQ(~Baw~4F^{GGTg>$=UJhcJIn0sdp7H1!{4o}-CMhh2@{Nm0lr!k=uxkflNh@~^G( zes2KF`@I2M56vf?&Sb!_jhgQ{q+0eBr z@Jnmz@EPa>Mc3N$b8Bkj-d*M|t*V1Y71b)CpITFkf!v~63H{QVI>5bCtpVO!1CLXv zR)8ODZ7LuWF=2p>OAGS~;NJ`;qg9Z#Jo}sW+6rizX4sTq*fumv@MKQyWE);VRk7b% zQIE_(8}q3ZwTOg1v8jCQ*CD+~W53z0$Iw^RXx*wBrgbq|xh{sqy0q>hiA_Oe{?eK{ z%rk2IgBew_`ItV~twG7`V*1d^8faRPm`}Da3*r2HHqNIn$S)}VWDBOoA2sR_2A^!f zU=V$T!6#cVEDnK;Kwtv~(vc$wJlKOkIRS;iM_W)K(NM^COAv(!LEym_gc0!&z5`+C zqg^OpfCKsL^^KGavRR;ywxA;QA<9(9XM1o+*|7&(5E$SWLGVdA1@VBOGkI)#%jd+6 zVOh4t<+DvVwq@nBO*pzW#G_3p!|R>Mpy1IqRHUIgS|b4Q%_b~c2KlTkL=Tisa1jLy zEt*IM(K{Jq*(7crBi^{G4O$+a?83N%0*E}?g)-m>iATFo5to1>k2ay)UZ0;q!J}O$ zF)aI|@_1_*40*B%<82Bt81iHjrp6xxnTdS13s)cXa4<~8V+*P-3UVOvXcNjGjX4?wGVAXt0gRXu?>k@ z9QkY?F4*Xmi-T{rVfCT5Zloa;O(`#}f&?!}4ccIKZ?YH6yN)*Uv zyKr<)<+EKlPKKy&c43X69HkMoKSsU-)Hhp;*ejVus!h}mlwyclJhlQVL@mG+VD`ms z9YK#5W8(4}_N=KtEy}&$5;yqMPSVB3`^RqGMZpF z`J=8<2&$`fJ23;uswaRp)`Jq|XfRY&Wy55MRUQg9+A3$%B^aY9XYUBwB08jjiyAcE zM(xo+eH=W9%)XKz7>YEgK2QmeA#@AEfEGcHtmFdmn0PRvC`}iwz1oAO>7r$#XuB}7 zL7AD_4y+ua{SoQ|j2WLhN1}pe@a}wgbNszm&8yPpx-zc6sm7F;Pjce!2V2>F(WnkoET=L*X7|b z^f@sMdP!0cd`t{c8312V5a_6HiQz`O!U26c)Gs#RL1V{8N1ts_!%)~&Z7|zq^(}FO zm`RBN!J`d`NXQlNvBSb%5<^jYKK^8{{6q<0W7A_yYmE2Jz{I-^SgM3p@>|-1F#N%Y z0tK%&Ai>Bz%v+-`cAzK|DxdAZgqk@-D1rGDmO`^dMpBqQB!;FUE&i0aJhR#skBK2_ z*``ZGpR#cOkR{YzlU$&^+JeN8_ZanDK+8|IYN(+$hw7UxIGQI|0Mb`mkagmYuw^=^ z6m$opfrti*Uu?tIy9~W$_+Sg#C%_V@B6%q^aa3OHK`C};7MUPy)WD4J)Hhpj3WaX| zVhdiuX8g?-oZhDW_9DTMgbLa?!>XyJ{+<|?i^k-$4H%<381#Ex>~0mWb|Bp~+P$oN zumf!dZVjwYCC9|89Y{X}AL1E7IK1}JPAvhSpThNGMY>9P$ zP%7YUG$dus-)zAt)6d`R!6^$MUTs0Dxrt&v*{OjuMv1+xuoUiK#n!{(W8zvul5Do& zi6x3nR6uOp7$J`KLw0a}C~DMcSXlXB58Caf!4D)j|6&tfN5nya+k;hzB=Kq!GG?xcw33QoM*fizKH$_HD}Qqsy^>_BO>QY+|ZQMAbfYC|#}32L;Bc(ntmu1#xJ zg_dm60d4g)L?e@NNcL(6QXi!KF{&2^Cx@dsrj+`mKaWP5Y=Ao zLrP7I`o%Upbu2Y~NDM8qmntubp;%5$3dLR$Lp4dFqsbo4(JZglW_$N47MrMmsHS1@ zG{4a%G^2Kjplp5_&ndAYxU_0u6q2lCqx>adPfM#tdTSZT$V6^iSgJfij!QiQp)d9n zeWhSIMa|jNHycfolGF-UeX|FrB0}|pJ!opvs=nETGd0?pHsw7oU+qAKYf){;A=#@v zNU6}0uQnl@LSA=-X`8h#HsGtt9)(Q344A*#goLQ03M9O?0#aF8^^?sSI14A2XI zywqcrwni;43Y&-Dy3q@=L3y_e8x@p_`oS)=dLiqdY}CM`peZl5ptR}o*d^#nt5o!5 z7k7a-9q{sgjzi=J8_+N$4O)J%0nN0jl4I9D*{?xzn5C^#(PD9eeoPhcFLvN1DzkYT zOPpyBUxFs5S|w@ZhgLy1#egR!XK86=7uySLrxk57f!b|VI|cHC4d{Tk5h+OJ#Ws|> z6O=FZ;LUqc{ba8Osf{bOuZ}CNg77G$s|JJQueKl~0?5vpg=<5*59J4Y(E42{KiGrT z?m_Wx57ykU?RG<9Z%8|V@Jj z43s?CDv#k9B@lhJ0SWTnXu!=+0e`gzX+FEH5_6VTMZ88tB{jsm9oV3LDC`TWNLd+7 zOMkZmOUNjdW)SZ-VTEL-)V^q@v?>~qi;K@TU>fVZVcrxzE3CFEJ7AImOj1SzsN0tv zfW3#aqjrRAEJwLRmp8!dh|=k1#QpulAvRK?!OnNEt6%?_#FJ;>|v6 z(2$UJ!cOqA%u8GX+m0K+0hGg|yxWJD$6mhLhX!9e39Pv^>YEcYi@SJoJo;#JUxM#M z@yL8m~H zp~Ht?P*hl2N`d)XD`1CLmQ^Ug@M<5rw4|(90>hhq*pbCbyX3__WJO^~sXk`@#a11q zRRb#r4~8J(m(b3uAMEvFSYf#`>-?=1uyWSLt9@uW>-^0=teAE7Vi)qFlCp~8A;lv( zFn_lRUs9&Si+9`bOEU&w)q zFSH9&qBK>~injRW0#CMK#LSo4p7&wH#WIse+fbFI0;ny;ijfzWlnpArh=VJi zY}QgT=%T72rNajnmX@;sdSQV0Y!^=185OPC5vC<+-D;51RfQu;iiQ^RJ6-)^ua1jLic49~ z@loMFsE)k{CbsE;(}CJ)o(QKV7(|m3N2$w*IHMs5<(KEEsEaz!cLkhTInJ!CyqxU3 z>}+RcMG@rA&L-6WqtYooox-^5T!C6|o)gj=LH>);hkvtr_sYcY_3(+k_RZ`{XQD1E%~_XC{>vf%^@KT5 zhutT3*rUK!EkFhh$;}&F=22tWMmD?v1laS7&qk!#?^VC5Q{?y7M0l5=8x+DfnE+(> z3CW*)^|kPGgEx#x_&7LLRUM2(g7vIuc3!oYU{fz0Qy}6EkRBzE6kT~d6zKoowk@@a zZ);2C+O{o8QAuMQGux_ELM0)`R6=r$dyKg%#kOK9BIi`Da?FSr%$0y#_zoM(pM%c6OyHf-QeixNHn|J7jEV0Kpo7ye>k4q+ zUrliqk^Ad&QAvR?MDr6*hsrR`No5<)(kE>6#5w2I zUlyK4Y-&7SGxDag{;5}3VBrX8{HOo@wuyhu&HOKA%+npGPAZ>y%wE$m+B~7K&d~4p zkal4t*D97>TQQKm<9gs{&~2NLz>{xI?7bfR+$8Kw=S|k-_mqX(k#|$ma-3fopYjd< zr^XxkE^~6nyS(@VEg0{yqgQ`AHL+=M=Q}7yb>W%AO~ag*y_>&w-8@kU_A)q~Z~JRD zB>ZhO7e;)Jr$^g4MAQb8EmMB~-WnKAlSrcfm zeNMv}rNm^^oI>o9gHx)1YJ8%mAA)MK)f?3itAKN(FQyEQ#=VR@PsR3K6bY}2AhaT# zLl_(vI%zPCJ9zL=%YRtq_`heu2W`_oN_<~u#v&W;UA=RD&;jf};2Wiwv%9&Zj`;_h zoEhMHIpn@(q2*FpaucLRo;i?L4ql9&d+KiuZy*~Dd4b|w5|#wbD%bgs3d|+pA*?0@ z*T_BI?W27sDh#_tpcCP`AESVHqH5NbvI`LuH*6feYUdS}hjjg$sp*n(`E%Z3Fe&Ob z36M(Tu1sYIqcCkD+=2pLQ}CB}G=JcFjVr;e0Wo>ftsr(FEAwTVvy(4`LgTq*VZIXz3&YO1ONxL1?s;7p>O(O^U)qz>jf{pbQ*`NQ@wgQj=ccbQe z!}+$fzS3$o{8IK|qrCcsB$lzUg`MGT)EuTY2vmWlX44^Q-ns#Y(UB5Dqi;ybTIWV5K8*V2S`tD|K` zNV6K=>>*ha6d2tz1Op+PYagL-RLYVdp27Nz2oGQ2%w}$GuWx+M?pFolW%pr(XJz)E z0vicV9aY*}*P8Az6}k+pHz+V%^L~!6`+P5)Gq}^lh@G>#xQxn{P-P+qC`%GIW(N*~ zFJ-}~WZA!N#;S#07d;Sasb=R?eK$t9?8#)o<|W#L+7@2E4&z?|nkLK_vtW}epoA#} z%pX3nUAB`Hk7s$oy*_+x>Z)T(56U(hwImwj07#ggVB1qgF*OOy8NAP zkbm9c$4{w2&$)6bG`O3y-jlPLRP~`yEk>2C87m#7xq{jyo1p7<#86RshdZbsdhBGo zVI8=SAP7v0!Spt$$(t%*sxp^eQyFfz2Pko=OP}`psCA7GiTr+GJSB!sxqY6OJ!UeW z8+mO`{@xCZB2r;=^HYWJrHp>h_)vHB_1OL{U5)j^WFugY4NApnILs@A`MW40WQ8gS zt*=hHWl(XGNFhz7%R4rg*PFx%t012Z$kU%vF7xP(;g=G7+o56b>G9;pF;oY*yidUZr#3H2-PcIBCPlF zk~nehlU_!!gU2w!T__B4652^VSyDM`i_J1EV~S$_d#gYWVhDx?C1lVUO-?(=p2&p5 z&%0$pQT!hc4CCS152;HFYf9=W+}z%?3>SMhC4cp!<(`NR%w%Qp*$xK2Tp{@Fh!S7M zc!uj~s+t^I(05%pDaxeMyDj0R)9L9#!?kFID}gBHO8ewRP(PwAp8!kYyjk^k?az@y z5m7NXJb$cU-Ff9x1++;+j=ZFf!yHpfR>ue_%3=60TQEjA>U=APXYL8f9EhAt0usPB z=xLElJK@%>U42j7yV}IxPg}qPzYa`=njqJ~+$!(LHoRke99lJE=X(f{-&iHI9k@yw zrJ1aBf40-q&UY>L3PGyIP~=n@32n2?PIfhQvk-7$Gq`La1=F`3lI#x!EH}crjb(rW z>DOnyvI5unzKEX5OVofMejhTqD)}6 zdEqeT8Z44d+-xjE#MHpJSYlzUTrPKufc+JSZJB#v@`pb^Ucf4359dUZ9CNM$1bI`syfJMCKQIeJA559r!;V(2NhQ)H zcH}T?E#Q>#-c@#wRK;1TKcGJYmiaJpwB0}y;e6gfbN}v@VKrMbesY6sOEZc06AJf5 z{~I$yXz|qDaC1J`nu*0@v>?{?Gjs9?EVp{<(+U6?^|i;OtkPQ?xzipT;rpOmJoC z$p%8t^CVMaq1}Rqv@zUn(f_k-^tm&yiUo`u$fi-wgr-L+iSI^H!BEP?phKt~z9I69 zgHZ(Qh5|{8h0T)+IMivTcUxS`h46%!f0!iO!W=;0+@n;Tzk)fd;^jkH1~gzpd}tXg zbO%BD&eM{zrc62PlKZ1X=oUBQ;h{yt(8P6kEho^KGXXvc-UEm{0936M`*G3CxM3H9 z#3o^}{J+l5P<&%)<43c3QH@iU6O426NF!w`ca*n-U(Lsc6Y)Nt@jltR&2Rcj5}0(J zL!PN3!B~-#4^cDf@{)WUXoYLI*O9(k0pd2!C1@5P z=U+J`HPUv&?#L{{EieZP_dQ8Rn7p`oF=cF^Tlj`fB*Z>qKst&5KI!NN|8zz9F}o|vi>x< zurXX!{~DwDWK|Yl!26s_hdd|*#sn!Of(|!bhgCu0+UE2tiP1m4?qos|=SzweIK)z8 ziV0pelSkA!=G73@&Vy{LPMy+T%&}H81pcGAP z);U*Sl}AflTWHok{Bn~4bND=Fy_Cu6Xi4rdT*vL=_0A7fFnpkty0x05!T0@hhq8UI z-?$OG(yEWcsCVA8KF9=nS&5$q<52bC?P&ei*|0+E%-VW<=JA4_lgyd?BaO!$ z98`VgRIfXlVKp6lu2#fV_nAULAU4S2zf-pRN5FfKFpV#u=0?Gwym75?=W9NC6E+p zd8TVXv5s(Ip*2bWUfi4chS|Piv`X$^ucUsdZAZoM?+^fMBx&{8Y`+tMm(c@jNw0*< z7QPM3-}Kxn{Sb_aOL|$;B_*om{)_;$JQ6Vi3>3{nFl$3O`}*3pTTx}ppF|ZR+@&t) z{t@)}r;0+?yf+9bu6>4*6WzyXF2yP!s7!&;_ znNF`TbVv-DT3XRfyHXINW7HE8amWqZcP(OuXvDM#=Ea#`4m) zZ{I$U3w7BEQ(HD`>4ZIakgJ37S0_qP((pq(;Jird`l}@=r6GIB;*=4U{Y7{eItK@JS zv|o$pxPJ1$Y<6Kxvy2C+IktF6L9MP{CX4;yq4C6$N5^4olyo-DfJWh*yxq--z@eG~ z;Zt&%3>%goIr1(AU43UW@Sk9n4ZO8W%GIGlqvY^^wP!`La!gl#%cOecY^(Y zd#045uq#W}I-~ze z4~SNFWl;Ua%~~d8wft=@oeHJbud$orkIzRl%W(cR)30`CQxoSz#|L4^i#O+{b&ULX zU=U~_hmv885_PODv4y>2LH5v17MeOKBZvO}P+IoGbo^q$P)*mH&?!@<|p-AB-xKBx%| zeQTV~q!YO7GIwD?-MtR1^RG9r?5&-XO*$Hn#i`as?mCUjZH4%SlL=~7 zy+s?}B%7VW-2YDR>|Brzny1tOMc+|d><+?v>~Ox9@ddphA%I=~l?SIxZL5>_0Jtnj zR79k(_pjiN?YvA_MP=oDWZP^d9PVTnVfRUed8Pg9(kKnQIu`0#Pm>QF!jh{$wgZGa z)Kvmv2#ag zc2N3WyZX!<@x6=t+#Fu7e0jVjuQ1+d_|9w#U;3ir53|5tnJG|*HZY&B8V;tHabF;P zvMn7^g&bu-@wcvBpC#g?I0)WicQBQ;%?T<2|Hnu)Q7@oHK6hN+Z&F;TeoQV^0r ztv&vJ2q@PYjBzmiO*Y;7S^%+MZzlyRdhtFYoN1ec5`VEB9*SYB#d(E(tpq=zYm>5; z-lnbzra#|jWg8gS^C!`@j;T`ja&_z`rWF6c#oLd^hRlXwLF)C*srp0+HINN}_D~aA zrw{oso_`o?I&8ykNL*Scn!uy0isqBbBJ5QagjZ6`Xgt%3Dw;Aqr#q|wcTkZ-*;4S@ zj}6H9*e{aZd4jooGnR#YmZDsAKJ`Xkj6+>A_e> zEqDKqz8B732ir}hdsrNN!f>v25`#Sm8zSeAb(0vJ*qdr21O0UW6AvbED%~X?_=1~o zw+lRR(BXWJQP3jPHbUy$_OKj$!8jK_7;;Gp)+o(%)ACQE`XGg4cNIp8jj$LcY!cl2lZcdfCn- z+9%r;U|-!h*QK3^R8&G+L?ChMWmlU-blZ@k-alT}O6SB2TtdN!aKv9^X-ew$1L_5? zmO4KZ#{L4sY8%JR=))FG>Xyq(a5#R#OkvT|G1W@Sad#cyLaM9K!%{uZ1N0uw99d4a zuuY5H?JR7J;ZAVTdFTN%6I7$9yo%-`uUlHq4IZ?@8l4R4w!;zLh(-diaSI$(TMHIg z!rm90AI1L|TvA#r|DK$yxjZ|QO_TeFs51Plu$0*O+15PF6@!iD4e16|1>21hEAO$q z;ukLx9X}++#cLcZ=q6`sp|hWe95^qJVGL`#)^1qKl1BM=gu6j4(06~l)Gdx}ns_3Y zM_uxS#3YoBI??8Vt1Ms&=(H#khej@r?lj^m6e-ExCaBCCn2QqfXJ?X&Wur*OvdTL4 zk?g==*O=I|dPr zJ2F$U*sMbbr`WwfZIck9{Pjxc#fhiFFxuk3wlvMze?DI~*e{$?o6OlN+?b`+jz zvuhv z+VXQ8WS}DX$h>?mO1rSLKp|Tb5Le%L{id!WvsBA1y7YaZKTyo~UGEQBadI8*t&}|F z#hc7@#P771uz<~?K{toB*-!g|Z{XrMOC%;P`f^Cfe36#hQC36Llrv&@Mh_|d%&XG- zUMQ3*XMFy_~#~<9GJ#^f$K+e@MMZ#Eje!eQO0u z(Hm-Tp31n{FO;Il&6<$F{%b z^;AkFu3tJ_0i)TL-JZ=&rjXh|Q#?Z%!!Nz-ew7+koz(vS-2=myrnHlla($=h;f`|6uS zv5yH}@ljQnt)+7-fko6b;%Cd;Sk6owGCIMTs~=B8datL7>xqbv8GZp&7S^*gzo8+x zvXuiqEGHy5q|He$%NNCt!wfShQC;`HKG8SC#77h(R>qC6IMk2rqZ{t++XMs+2LZpE zWxoqnuMR^nao=}dp>%F=*z#)K4CUVr#oXkMOo{KHHRnkt^9`}e^%eeBLnUgxCs;y> z{xZY}A6@Io?@#AKf$JS(2ZFH%2?NOqL5Qj0Byj4acDC=C(aPLSNLo{O7r^rm5^fP%bGpWQtC}C9q4g zbD4$6XgQ^w;qMR`8MSf}CgrGRo=3Dp*Og+Z6jTq4Y#W0m9uujRL!SbOF53#DrG0&a z(qm1Pnz*ub+WnF5FOzP@+ud!QK+R@9-8m(tNh)dUtrr&tj_=H~EGXoYLwZ&QF*yzb z0)Y-vzTn~Q@yxzV;6BKj0)bg0WJtqFqOnkeHn*OpnIGja6Zm|s?qE@>vCJw{J_4Aa z*3xriL!v6Nr)Gt@Sd?D)c}|w@pi3&#WZGq+L9({iCBRp{LdX=#-g>4eRXCwSk<~xt zPDkE$99Lgu=y7b6FTN@?`I>PaAD1{)Yo0MCA;k%jCwyx2O?4>YS392XqYz6yglgrR z3|E1wxlHdSRC5Qe$plVl8Sh;mZc48ZF2qfq@A}&An!CF4&?%k7e-S6$xfg^+wrek4 z=&y`um&;AKO>qxpD5>tp5>+ ziWP=mT&viUoa;RzVdq+H8@PO_XFo7#vcmep^ipd~Q>;NWpFEh_GGU>IR{VKttvt85 zQAK3gi#|b2g&>8LVSw#&HmO(R{UMgjcwuo~FG#_EiKU(po_qW;rH33e6ekQzl>MEp zC`~8d6~GAHCaZ%(P8#bekst-x1cwjmrs|?8@*fUKgJ}P{g>o0mE4DDckUucYIz5#Q zpuu<%5o471iSlN!J}bjh)(bBIJM8mSv{GMtJdKOXrb^Uz2#1U?>^xH)u-Lq2WT^y$ zMs+-kb0pR zC9mFhQ4>C4{`zf{mgps>`T8$6Dci)v%g^her8i0~3h7gH6z# zncB5Hw}jbIf+O@ZaI$>ge1POaHuuC#lN*?FPx+a9)T)j8LU!JDeAV;tvBvNv7JsYd zTqceNpJ8Yy)nAJu=R6}2qXmJ8s3 z(Ecn26l`*_e{BoKm=rmcPARjbpuF!Xw#UqNn^B0|dGj_Qo)v$OX@^D&-YC?*4xr2! z&4+{f0HK-764Gy}c@68?#G8q=qns4hykbgd?jFl)`h*}$`ReS3eCmzl+tCYY`+*Cj z>|j^0gresOIwkr9CU?0xA9NCMI_#1yj)y3N+E(Mmzse!~G+ybJIGZNHP3Q99E{~)W*TM!)50BfLDmk_DCjw6(6lZf@=C2ISb zM=1=X2fA&pyw2T~rder+Hi$YMq5H{*t08|Z4`1`qmlk>%)19PLy99W^6$ zXjfIQ)e!gW$t;YStO@KodbG{hubPdJ?F881$qVJLYHBEY=wI>q_55@q8W!vXP7tQ< zPRI5(sM1O4>w-cL2)edjnr2x@J)E+9Lr`wN zRN&bZ-@wO{l68#as>SzRg&fUb`AZnvdVK}EXXoBkwU4Lati$wUH%E+{fK|u$P$`TC zt)%d&)GlH;RjEvQRa-M=nSl9lXPQjRx}9DDl1=}4>XPbb`f;zir7jOA^1bKt>o-WC zmrl3_yOOy#ugteoQRDAYf@otcz^UqkR=Guihe}FxfAe2yB{vf2w#Cj2e5zkXy4MeJ z^y9;dbM&3z5X9UaPgZ1$*-mi$8+*)&eM9eG4}#@#UWS`|c^wSWUi(w2cc)ZcyIha~ zjWRwXZQZ4trlkK{nm#|}^!&(COBiSPolCp1c?1N4fXqbcYk(2Hqm)5OeU25cqmx0WX>8+f-DjE5h^XcY?h11yLV=L7K=4%fh=Mi<}(d&-4L}PBYiOYIA6|?I_iL` z!v@pM+U6_?5As&7#PYgQey_5fEEhS&U$Nj0Ajij&XM$hGfO-7pH8+28mt}4JhMnwR z>v(e7c6uD@p+zjX^^cdp4B#;ldOIt z|Hg@AyPq9(xT;<4Ykr@GP@%_Upjr{t2vTd+k$;51}o=Y z31P7fFlN8LKRf=5^WUqk4%IO&HEc`T%*WA_{DN_3z}GYKN%9~=3MEH3zkunmR+vfj zh$DaLn>8a;n!SL)%j(fVDXeL_!yP|5ZK9n1VD=h==gVPHv`st+BvER{m#S@|M1=*E zM63+eK37iA$W_joWgp99FpN}eu$elB8huEl-V!()VCcCja4>~BJH|CGBu>Ao-8KxC zjO~x!5<5>>T^MB_2BA8zKF^{00=p>LfP~M@Q}sMPvfNm8mlDFt+@ zF=VI%F$lFe;DAzRk>n^%ulac?Wo31;HQ0~%K=G8oJtI2#*r}_cJmQk88#n?zT7QXP zIo2>$=GKK#%$0Y0>i9EG9$e$&@Ze&X3Akq8+4XAeGBlI&!27MR&7AsgK5YifFQdo4F4C8w`9cXT}yTiMu|LHzSHD~)#<+74Ad@F#0mdVBbY|%PF z(PnJ)Oyai-KQ;=ZN5N<+94*CAS)uVLu!J;;s^bMr!AId}ENn8K%8OuDMm3sytczXI-&5x=zFxls zzHBwxwChIZd8E2GCx>(>%VFy`!g3dN?46EE!kVgPIMnwlnrDtmsdqk zu)5n)8OC#gd8fnqEiP2Gq~o1cuZdFN8^B)W7J9`outJzGFmCK~j}(GXJ$ZKAjzNRJ zR`h!QV`^#Ck#e9RAfG2TPSayy9Si{XpYlg!;cRg_3+955_MS0u*e4Z#vEEL|euBPV z8#z%*ab7}&T;+utzmfJ;z7t~VVpud2#jxL`4fjIK|_CLoQH(RO&On&i3FHG2_+b4bz_rBHH z37u>2*}ukrOYN~l5^rDrYKYizpHFT@bS8tjq1T*KmKNXoc-}+XlqlL55y~hL3Bc-W zTOE>_Aa)w4M}J5%g6I|rFj3JGTbwlft#1OwSt)X*t0J%0PDb!_*rXaB*}-|BTg4oW zu&}V;C^}5V`_DW$4IL^E(uJztLsLq11827+;V|}Pm!z!htyh?6$vW1c(148AFnyrN zP#*ahTJ!PbJIRUtZpT#*Iwnm$(`<&``p2-tO~HbxpJAbM!L(yuFNOf6J`Ys2p$m_) z`|d*vwTVB7(r>4)?3H{oA%IRF`Z%G&#_cY{Ch}aWYbBJ|YDwEkBHlTlsG2;) zTqSMo&53U};W@WGr{1pHs>`)gf6pK7$vs3I)z_OFNTihwa_)2xKr83OuTAN+>gvh* zIzN6|Z)Z=qZLq7xQy+XXG%oT6{Wpkw{E|3@HGKlm5U+S+K_T+S4i`9ZY22C|yZGrt zY|iw{TpTUjEv-UA)`yg!_NThm~TUJ`^)0k|oBk{U+QgaWfc%C=~ z8g*}|Z0$>dj7lU-7hyv{XVy&_j<`t=t}Z;}oaL2X2yf4}zb)ITQHR{DZDywtwty4O z&mLJk({f^_tZFAyi(&0YNxWR~{I%j+Q9$q6)FSEW1ZhFa7a3&rD~V`~3K$FMI-En> zW{)2Hp}VecL|K(L2Wakm>P9FEQhs|RxS2jnIzBflp0wu{GhSs$!C5c*WABk%ikyXZ zF|&pGa(nqup;8wutSR=(*!^@nlUUXOn|)2yoXh_DK0d>k!s+|yJ~g9~-?(u)tpGl^ zTIaln3GLczXCo6wdi&2Y;$Q6L08L2I+Z$=b{^u2JO_Ys z$Q@HRZ$?a_cv5@fN(;pqZ4>gw224V(u-p`NKhJC!rYPfm;$h;}>Dd`J4jjZ}>fSmk z^rs1`Zf6hs-Qq@SHak8CfBumD^5x4PAKmX<>IiX0W%Eg+W*t})+ts-Pep5U}oKkRJ zI8jB=d=~YlA)fa>`K!8Au`2M(_?!_Nu$;hD;;#_Ou*%bLCln zGP!baL6t6!U}1u>m6nNCP5y8qy<4l-(B5Wt zv`0B&B-H#6^anEi#1MGk*w?4p*w`G~&xbn@AG)+ROUn2DCT# zv~rX9f9&TO8JA0so5>fNde&~{Gb5KxW(u}?M`(gasou3D7*2LO>9Er&o{Qg8>&YdB zQYBZGZ`P+7W9}|}rXY;m+IB8XL?2&-VEQTqJdVO+J_pqFY(5(etV?7!JEoFQv66(M z7Muhx|CJq}#wn6z!wken?gu-xcL6MPcCMe7XSi?D_H)pewipADfnH3wU8+@Wl+gPi zv>$Z~)6!Q!*p7%6@HYogdCb?{Vd^O?Sd27$ z>ewtEzR8B4vZ-{Rao;E9Fe__nFb{@uv*d4Bf@}*zDN@pwRKKr;=3+b$I~}TL$L)L2 z_dwY0k_?GyNg6+mBnQ)>Bpv+evI096T&H0*I6%u|$KDs!R^fHM08~(zc(^dQzh5bGh!G%%sy_69H3E$ zujB+C(%2%{VnM4|OG^3aR&5!4 z*ae_P1zw*VA(=(-=A>>|1b^VkHLfPH^F(C$mnFWH8jcSg>fhj8kNx~>i))xI2RZQV zao*Tx;EyOkfnvN*=lk(CP!PIjX7DxdpTI^{}T`tCrJ$_#TTgkBT~PNDaM$&#EYO>bN(vU zNwZgcZtR28^A+k8O}eS#{k5Vpyv&pEe88FK6E6bAOtQY{F{yr3B%F_bv~?VCFNi~{ zQf}&Nb%SwaYfFVrL{xwD-J-3ZjI@T7)%Bwzhcb57;xUKgxa##q{~p?Mn&S3Ks%5$~ z%>~&|;bjvQt@roi+8jV7m&|VgxPcMf0Q{7gKkV=s(ag`bSVTtn)6(6E;C08OQLtfw zRMh3Bj;?v&(NnG)kz>0io3e5i?{Tvq_pT1=DUNZnZIV`v)J_z5d>Ltf3!O0qQ+_H` z{17A&4f1?pOMip=>K-yjtyN0~XvccjGN#AN>1Yzh@2Yw@D`Z@_Xub~sn;#fCQ$)Xa z#f&3|6P{UORcr-ll(FBZ_7O&K%*797!hs%f3h4I`>cEG#~aL{6dKhppKdm4%C zAvrilz$lIH^NHz@h7-~uPabm-(HxNzj#GT=zPGZzdI^Va3RwJ@ECr7cJZ9&dt*{05 zcSH-x;Jf=*rzI2S+1yXW4ggHZCPIhaa4$UkZnQr8Z|4$JV2H5Vo3&l3=s~P432}L;m{ww<4JPFH|Y=D6}lT$8i+TP@+>=hSx)QA5os7t_* zo|QftgdKZRGsQ?c`0Lgk4`1?cpU8whKzphVzJr-)JcY&%hgZ4O+cyR=D!yu;Z1y}s zAP~u{+wln&9N|`6_@MZ;^T&NIU})Sb#nOND%-BFp&_8XK zB?X0eAgrN0w5J`4*B;6P5EurplR%Z2qEOcCR)73Nj?0?v!$0yV72~mdW7t@IgXhp` zjYZx2!Hv8RH4%D?L{VILz1rywpVDvF$AK`IqTTxd>UGvgDj?qo-b9s7Khqn}U*cb1 zbHrYVGG8*guT(DmH(G!SKWc97Q}zqQm!hHeUY(iDdPQ`@*{mG;DaOWdh_IWRAO-i{ z1VlvftE_^0Y;T@kM&{|**!4T?36*890gyFj|J(L?5hNK9PuY6< z0@jkCp!|&WWtn)WiBG@;ewpK(HvCd5tUYg{-LE58ecyK6$)svUMJ&ycX_Xb8oCf z*oCS6{Mn>wy_G0Gao#Nvt&}N>wDhCs{%{ym1W&8Q8wNq)NQB5t1>R zunsnW@KM%T2PkfvuY;UOzgfV&Hbeb*UNrYLg9okzfJ=Ya22TcH3;YuAYWQl4(Y=f@ zpV*WH4mfh{O}{o`h?_mZL}CU;a6!K7kxPSBdU!URuK#RJi$Exh50J|gTk+98ot$v; zfGynRrqC%^2W};77kciy+s(1^ekx>b3#L2s zwLfpKezwH9XuA=!DrB8iYo1_><@P%`=F1Ez{>;v$o^*FZ6|8BiK?crXBWjE}+h=U5S+yM!-?eqG;e zEEVcwyc_QKKXvC;ew%9((pohMEB9RaKXwt1Cj_?q5s>Oj)RZ1@G03NQJ@jWcU9H_j zs0SlArox#5Omtmw)}c%qMiV{|fJLcV^2+Q!vstLP7Gk#9Zp3|Fj<~aKAFh|uC{98cMQQ0Ad&9Pl`c2-5I*b#@`?aK>QRis)```b^ z5Ejz@2>&l)O7|lpkTY^x`t+kf0r+lks@NlSk4asaq4Zm2@A+1xwsV&K@^l8=%q#`X zx1DHya|sK~t-Jry+ZOXxuV?BZpJ|ZH%`#Ms;Qi>jV^I(hBTWbo{2~)WTpD-gzj{TU zaXM8-grZtp+%U1Xzvp^3C0UG-fqlNPw{8`!C$VISoNsLfQNQ(=%1z@HB1Kt7G44bo zZf%0j6%F2xRNol4l7l((y&<$?bSAX^_hVl5i~VbSQgfxzy1aVN?J}awOf?bA$pN9{ z4*^c!)&xwcf_~G@8x^}a$RFN$OEHsMu77s*Crtx3!cfnumXXO1y#Pw&KEgalPN9Fg z?senza@8lAG-vpBXol?MBOJA!9qH7B`tjk1L#nt7WAizFaS4~}3v+4LzKvU4pU=|` zqa+5#zd3n$>JqS1%j9=0o`R-1oRey@rJe0?XcMNYfDM<%~;Z!e4oXk#b z4QEy4u(n4yx`DjFxH6Y&=q@3jl!L@%f$Du>xa|j>{~1EivYGo_yfTaUJD3>3woL#e zq+#q&o(gGaqXof;dnjOZPR6U;U)PHwqF0o4%{f@4}Z|q$Fl27@W~WxJ=wmB zLp|P}#Lv<-xaF0gS^7`nN8;4qnQL&M28G~y7V3_~jD9R5lHKK<_#`bZ=9BQTGo<-fomp+R}IZofZm`ph}eQS&E!ePO5qgC@R)GVp$|N4i>>3N-?2 z9W~=0VBpgQ*czTouJCqjwr%H@Y|L^KDg%4x0&!&8-S2t3jol<7bk8j!Xf;-R4H5>w z-@WJpSyyp|#BcG73D8d8$R}V9#qQw$sxA05Q3?)XyJ#INRI|kNm=kYE$rS2Dfe&I1 zVc&ndM<9)%>s#d5l$8Gk?6NoCwf+kWo2~W6--pul0i!8wY;1&5SRbL{I<@5~R5%)E zTW5ycD#v)L(X^2q6VPkqfNHp{C|F%>6lXo!fM}&{2n7p15&ZXye6IVR@d;ew@Gs6~ zHmTMY2RiOty7=jEnHQ<;keB;!zeR%*mDVm#FXNme89)3Fgghuqev>bO>njOlA;sDmmQ4Bg-C-JSK9 zeWLjR&;cOl!Nf5?_ur12E&ue_WOTX87f~?!vTHQe%0{~kic7PyeIS!07Bn8oHoQ=| zd6_kC6MbF3F{syMd;%(>+`sLQKKrujVsP)dW3frGK?Y9H)Ln6ob8erG{jr|3I=b&j zyVUXG%wqog%71(|6+SQ>(m!Y6)f}^WE<(4^Vb^fEcd&N!^kXfZ{~{AMT{`kTwfGHq zJn0VpcNbg#pN?$$;FR9E9q5ohr@f^!!9J?;m3T|+@|N+}vZJcUDX^%L$NEB@7DABU zm9y*moAyU;P3YDCRql8e|9NZQ@pH&7n+%bd*3+w%|RKTa`J?OOd?^i^Nb26P_R#Eml*PUKl*?vw`>?Rw=CG23&meP@U)Os~zC>L8?s}_bCP_k}zWwo& zlWcJFmG+m2e_o7K?lU$0nHB(eU^5o}OQ+6n?{+TSCzgOB4?wRjpL_buBWnLyhc`h# zHEkUu%zk&-wCeMn|9+ZYYNo<(~>+_q%F=mtQ%*ip>1JBg_A*??2bBP3(xCzP$(j{ND0C$>9G1 zRY0o0ci20fxzNTL?jq9-=K*J+w8Xh1y~D|;%(#4s^-Pg~og!Y3?84~+;=)Phv_ep% zfCf~5(ok5JaKv~wP|jsif5Z1exfke+LyWNpK;lutd4UpC)({|s z!YT|#=)?+N702$@0z_~~oK(2Tg>rPX-_cn@Rj|J<7z%hfb`>UYk{Zh3IGu>c{>V(q z_)=9QdI7b-jV7#!K0sEX!;+KN&sLb9*C!{>!S%~1wBg~KMJT3$-8>#&6+({M5um!8 zFAGxUr=$mx_}r3);+VXZnF9+l%EgI(zD#fnWfUBd*v{cR$`fBe2-fH%Q6rW2@}Xb= z6o6bDxmRH?N)d_mOj-ubLKdMMF0nGl&aAuK#Mgi>$Z+JEba9-u>y?~+d-2tq(Ka#Yy@=2iHY*GFZ!NQ9^YqDO|!UR;>N#aJ#2g4Q?da>&12 zz)8-66(W@}Xfdk8oIpg+Pl^~KM4WIS`OvoZ1>J@bNr$&TD5ZDkZYa`Ov|bcJTl#s@;8(<4-hWfe6ho!!jknqf|IJ%sWQ z4{YJ`nRNZlTozB%71;GT`8_UsT$a}VBX;(RwH8}zNz|KjQWZeJP zDe-Ur?|_9+E z@|}Ml9~b41cK)MbUdfZgzW>5DF0=nPIXN-8o+ZiBDJeNAk?#KmDUkg4{QqD4>DD$o zKg%(&Acw=V(z$}-OuH?M)5pcf_fO15|+v&Vqo790Tn+;q9gC$T64qhI~PAtjx@3z1nkL!;j8or-#Z%l}g8Qs^M1w2$g_T zovZ2c$mLwF=%)_LN4N%qCT@7C%LKC2#fKg9X|b|{pu5GBzLPWY$w=wC(KGU4HqBLW4)@ucFs~?D5y^-{}50eDg~Fz7fe-^5%BUdk4K-*9-Pum($Naj z3j*-YGx|_lIge1rd&#YP^r4n=lJX-$QJ)@erIA|Q;-Qm-mR9BVHP*2V{0E7`ZeFv} zo7YH468$$no;U0cc}yJd1~*E;my|O%1E7pK_LMsSEwvV{Xh6I3`}jx22OIQEHSrX@_E4Flm^2fUS<;b$ml?K ztN2n5Pqifg0s08R1wMlu#ZpBQbWUmPF*a1@3E>n5pQr9Y!aA%s%ozt)Mht;_OK+7V zP7}R3!&N6FQ0Nj_G#&{ZM3pOoQQ^7(QBIGCNgW@30+@7F6#{spl_;+Syrz~D2@3;o zDa={xi~`{cR4w!QY41Sp1p`7U@$E@K4TF=+FAkewvRJUu2b>qRO*AdoI=kx*`k|jR z*iTTRA^m~A5a;Dth%F?5g9!dHi#~)zY+DGLb(#2uA)7Jt zguJRinj<0hXb_zum({T&3G8!7+CZp`hEZrdpcKSR6$v<$s{4rH8+-|qzdFt%VCY9e z#-tNNz!d=3E_g%Lq$_>ESI#fu2AFk4Fx3$kl^h_kbt>iM#t}AoFNFf+IiM2xV8r<< zg^`54LGY`8O2Htk#-_W?&DFqQx_n*(qZJB-paA*{8Vi!{mjO4?`azjmq`y!zfMEfX z4v*G%%F8~$<`Gn&WB z;B^6yA)i$GMv#RhGBQ4YoCnn$bS(g~+!v@Zaa7{K+#zd7TsMa!UG`7$w6or*o+xa??M=b|@VCBTd= z4+c~ErHg>ySRBU_%u}KDtM2dwNC?|Fuw$MSVOp&2ke2N zR*oR4NRF~l0OUG~Y%%2b`vPR0D8Q#sG~^qcm|dzztQbB{p_(fdK}>b&%Ap3w=W^Z) z99D+$SeW_b?>KY^NPM=^S>_X~IT-ZvDh_Wjs74zb=7Gp=dn#akt_67$If*~4|JBvi ztoz6uIL7b>zzE^QMusuh(FTSKrFMdW8oJiv@qv*Mmu+ zNFF~2S*<}C!bA$-i;Dz6YZz_53b>stTM#kx|isY*_(<~mc83G|M7lt>p+5}t&1RIX68vt(cL~h9P+kgv+ zA+MJ}MgF3rr9wo@b<*6B)wkR(3m1oF3D9^ruF2GpRfRa-B@oja@q-Q^<+(Da-&rbn z-~$R%rdUuhsE3;dt4%tBl!&?=OA*Dx#0&3|hgU(Dj4`$D$$Aa5f^;#m=mSr4BPBK z(F)oqWn__Co4{4DQsY9bf0Tn-F(CxQF(U=#E^;avLemdHlF9;+jD(CL)x0p5#ZakK z1g0y%z+zy(ks>BmiI_;LH!z`8zrg2F{SqsPn~J|t(uI-PDXA-JIs*l2>%9p&PS{$+ z7z(v^Ri=*12Q?#^mm_yE+wCQe{DQQo+D{&evI^kr$S@kU=i@9!6R)rm{!&ECwU1uq%dtB7U)lKA#Y3GgQrSOS{^!y zbETozlvcC7Ttnh~(hqEfA`JCuL`w1i0Y(;z2yh-{44K@QUG*>zEld5A`RlSua1gs^ zIQRlAC5NO`utYcs5RG@qDw%W#hNjp~hX#!pu0NRvL|ubd5!6n-4wWvaSdmIVM3LMI zlw4X@G0!7v!ZeAmtv0deK|X=j7o*pd*_2i77GJC|(m>fy1tTRyB&DPX2oM~1scE#% z=rXsYJ4K$905}0294MzI>4VL4P2xlqDtf^?!Z#eLioyoFlE>qcTm`NxgH95H29@Pe zidM0N4N+H;Kdqn@^brieV5E%70<*-3!)1D>OHmK`6e}tN(fBekCr0kK%mGwdstHW2 z2GF;pEC7@6icV@Ncq1zvl>nDaRW?}=3UWUN0f^2im1efegd^%29gd(}MoQeks3ghn z^awPm5p8Ph6lvQ;5cLwv5bzUGX?V+sknRx*5K3r68W=cMWm{r~0*|6wH6x_FP8!CF zn2#*dqKQ^vv>-gtqMnzE*^OeHhP-HMBPPdUcmQw#mzrd!d1dce9mxSGn&6R(_wzt> zpUjHHNgQYk-DANrdr(ZCG>x&CAE;!Uq>$8Y(9bKJs^{(vSaQS}XorPX6{_ z1_tM;1QQni@s(mn$&(-9iTLQp#jOB7ku*E{fH}7K#IC%92Ld4Em6{nrevcHOZJneD z;YBH!$LtYisE<9mO4)-Ty{QCU%^rPd^wTGiJwW^H3EQVnp`g2q1jQ>rCn&L0B$t(` zG%7@=vU1WWL@iW?r8Fwnha)Z-UQVg7>=pQ`yo&x*%L!yGjG{6nfxbL5D1jRgB!z@} zn^=(=E;Dm|K!nh1@6b4}0b5s~7A;Zh55v1|o~BBd;KBB^2ei#3&{7{mhs zNCQ?>#wdt*QIVxa*U~h>nYf5<7Wa+VD8P|E^e1si@d~;@lW()_c4ErW5Iy>zqDd>^ zNMuG?9*F3-tPe9p4lP3%M-0c6`tasjNxj#l+tiAZ80erXWjiEX@exg@U0ab?QL~t` z2611;v&G#+?GlS7&Px*YB@HiNkQJj@#7CB{X(w9;u4;i5{U}kpiln}mz6-7yAZ>ws zQZxqZNvk1JTC{==(}#Uj$TC$|%!1P}#j0q4&q)&=XgVQsO1U#o>MZ9;@)FJBqcwuQ zxKcijgbH1%%yIG!^?ES;C9Vy)oIxisZb<-yg!26!x?g}MhKdS0@-h)M0}vOK%H{yf z2V8!@ax4d#DRKIa=pFUSBu7^!B@v<8Zh19Wk88na-js?m5m3+5Y8YXs#;{ls zph5(uHK=3^E|7E)750RvoZ(Kt0hwItC4J3MMNKG+2o%M*Ed7B9p2E`H6y5vec2gNdiGA;P+wBP+qksZW3}Aur~V& zUN{W96v{xy3>ON;pu8UmCNwcRaYNH^4zsAqLI82vSthr%+l4OANz0OwA;SW%_>!p# zT#1FRXe6NQFRf8wh{SXHp@)8uF+rZJsM8oDnCn0Vq627XNV17oq6A0Qn?!BiGGN<- zL?_6yoe7td>RdI~k{-3HwBnj+&(G@Jw>aOC6V57fHWOb7oRTFY+yQY<0U{1qpNJhb zlS!XF0x&aMDv~0_qAo}n!$j~jadZzg{L7PW`9olJixno-tTJK1lMM^;ZQ@}(!PfVH zW$i~>k0qW<*fIadM`O}KMj{fHuBu>r)#RQCqRtIU0-BV=(xQ*FIE-v1@v(hQ(#8|q z97bdhaij|9ni#QXA{mvsVYt4bjI6}N6;A3|vxpT*<{(BE>rwzwz;+}{6LY=Kof!&q^?`(Nl_Tp??UQaF)>gDA-IJ*r55dd}MbJ!pQ zWy>i-V1055vvT2QMyAbfa||@;de|I!2(w3iA(z1wWE47VS;h8@LSXvBg8ZT!Xg(Xj z=GpRk6hbRGxZTGLwq_o@uS7bKqrW z4xomcglJpPD{yXYeN0?-MxTtHIiyxTKq=H=F^V47KQ{+oVS5?yUl#5J!+u~AW+D7E zK{pE>a@GE}q8t;KQD`ediu5SV?_<&-J)uTE0Rr{%awrs}HK!R8D1yI>i*jUuTy_rV zq`aOmK6#q)!@!v$X{csYEnB;Nz92?Cbap3*XqrBiqU!^k)eCGdE|E*z~PJobNe(mv<4Z|RATm~l@oFs{iZpEkGWJZAv zi(wX@Vz}i|Ee&Q5Szpt|#_M$L=qfn_Us5K&z|D|$TPBoX%AC`C{NVlz)#eJlPW8H* z7<7TPSCOuLMHce3?}+CG@6;d>5xwS(v~P#fJP}7OP?7~E{)TduxEX$ zjE&9B*)3e#G|q0q2eukUG9hZ{W@|Zo9iY)2n&(E=?tBQLJme%cG3G81@1F$Fg3hwx z9PUBjQ<>`{R*+bYg{#CIt5P28l1w0snkXF@;S*f+J%tg2u6q$8!o}K2h*th(K^qsW zJ0mv=CvRQ8*CnyPN?4m1EHm&QePY zmEa&z4vF4`o%RT5i%nPvNF)L2thzq^OzSDgc?D05-I&U8@v-P&Dy_jtaNL;7;3r-N zKP(mmj>9jwNP#$535o=B^q8vsV9)a|`~oG@2$39lHaj)f+1R%o#Dt(aU_lrMvHKeaAn*h@-hTKNsw_Oppc(sXkf(Wgb#PA&*$Nt zUWFPmJ*=r$Hr{`V2#Hd&3ggOTFon?|H5z|gYaMWz=f$X0shyN^r8+$4VREQ3$A+j;7QGIRm^g5KkSU zSm?fVK{>I8=H>AsKE_~P42E`;2qy||ak${eRpKC#%XDRisSdgTD~Dr^DuJsS&2lL| z8ZLEld}E=uO47o2kbtDLR>EL8U|nm+aZuBb8s$ z*9f*zkGf*_;HTOQ+-%~kIRmLo`-A9~=A6t8Aj@Tqf;8@c8U#zJnM68MCykTr21Qmu z`HpD%xjo*ZKrlqDKD8l_J_}eE8q1P=$4?CMpoAf48X3|J1R&RuSd)Sm1TwHUV`})S z*H~$SC=rVx0`-WFBiunKL%kiROx5m`vp7!EC2DpkebT4jDe7h97`HiHE<}My8}`K@ zL5pxFBxF?FE)P2buv-jjPS?y7O0aP4O90U-bUzfUsP-om*GVz*2&q+)Uc!tFwQLYX zF~3NIv?-(^NUH#u@~mC8afZLfFl^QM;1CdW7`<4VVMYh_H6-s&;wSCkE6xPWPv$f* z6lHPE=CnMW38IJ&3~X6NAVx;QP-KYkwLEH$Hq$jm`WPtl@Lpz*N0Uf;T3FADNOl1A zR4aUeULIZaYPuFns0SZk18I>B^vR+NuT3Zf=jif{| zT;WA4L!z1VyY_LkOOV2?4oPz9*)gPeC+b?ft(_y5}t=xe~rqEc{F#76ouge(-@Ns0*YXotuie;dQA=GAU0MAe^^7;ZA z?y1e%h#CaDl8GOUqpnOCM6;`}jtj3&oap{Kru|P@HX_i66=Zu}73@>q*T&Vs+P({3FQH3%C^yXH8PeP&OnkTl3Gxy zpxWcRJ&N;4ItHuD(5AK67-84DOCpK^SHjyV(inz+i8_7~Z4*-K9s;5-y&@k7644U_ zEqAmSWuXxVqYbbTGt4t|qM#utGw}GKW36jAQHOw1p4C^zNs5X_55Ct9C}IXBs#!}5 zKS2}y$|7OwstTUQhS_l}VeCa;N~6VBlZ0v9j}$AZXpt=V5grJS9mNv72*hY?2y@yk zKY@YH;>><{q&Li03dDC zm^mbMSawA<*h=c0kOEqUzr$8(kS39wB4ZbgQ6yplJY`teB(hR7P40(+s!9-|CyT4` zQg%7*le|2oi>iDhq+C>thxr6=t?NoS$*r>F4@0|y*J6zPmT2OV@SAqcQ67o5)JiT> zo5>ipKuv`S39^wZty1c*98RKW)i-%t9(MoE7n<4LE97{#oh(*u^ePBv7Rl zND1|-oB?TRM?UcwPZR;KI(*h56nC^RFSSi#L1mJ`sWsyO0ib{t2MyuU2wRNOGe1yI z`=w_w3H-Or7xJQ`t4H^cM5Xm(Br27w;vo^M=q4$(!Kjw;l3k^V<^`Np0E!xyMtN~r zp7BytPn41yv{a68kQ6MtK3mUDa<}eXoQAI%*N0AexEL%NP1qE0I zLm7rgNSV=e`1@oO_0Gz$+iNKwh*rKZ$5BghPqgB8TV9S-o?y$R0~sT+$S=-ws3tvr zPmM}ViByb~<>91MQCpo8L?{>XDioFIWl~dBA*GrDhv`jc7z#@w5_Eu z&?~%bptiC|tnk7fQkcCXZw4nARFo1GQbpKIghgw2)l3ora9kt-k}I+GRYY*)pbMT* z?F*2(#vC6x<^tX)qN5QcTHi+U)3I@ms@_zEr74#5k;J7*XvFO%P{r^tNJL;mWPlX= zCv1&HnembKQO8INo;5&Gsx9Y(x|xa8>Qr@&s290!5>HAKiB4*DxUnsPjZSH(R8Hxs zLm5c+mmIz)XL`}KSXU}1(902UpT7_c7wjGZk8L6Ys2{FZ$-#)gd`Ssz+tX8-Nb~XN z${ziI*>=PAwFcJWELzx_bfq}Szf#`H;EjxcVYym$`NV3ah)!&+@tom&4F=h;WSHw( zOF)qMBpO|ystHP0WJ))Y)sRsiWVhgS#syI{ln4m*x-7mR_#s@)RE=UCMfhEpnfh0; zP>Iv0G~{*gnMm>`aRb%huEI{MD@b{z>?#-5*mbFN(ql>= z%X>%*V>lJY0bU9f$FKUy+8NqD^Bcb0U{WaRV#a?8;Ce{GypoDj}(255nEp zX9grOpaMdLtvd3M7>)O73Uw6DM{^-2HC2+0GGFt7LDuAiAqqvS0z#0d-K0T0Jz1{C zJZ1_#os;AuGMyXcatwupr*@9yeQx#>{2<4>pmaCo1DvJD9NukXrEyzHgr-Jb)=QU)|RLM^Tsg?)Bu$YSGuqy#WaF=cbhL%hFkySTpz}< z(PQD!EDq4la;g#6owIN$vIRniP9m!$eE?M!=a%h`%jCkA5$Q#CQ`R;%^kZGYDkWl% zM<>V;Y87lEAn-w>%T*wtV(k$YI^d+~LcW|MyCl#dCn%26lgR<>EJ=+qCh}UH?o7X` z-zbHMo-nEOt?~)|N%<50P(G2sxcrU$Qa(yK_40S=g;GSeh~zTz8x{WkFzo$m+*N@W zT0-?gTSRba3J5OtS&Sf&7)c^gO(Ic4B2hyJQA-CgqLX4|C&jQ%is7A*xygOMEjf4x`f z?>~S2ACGqbpM1#EU)e_8`~Q-XIwxAf_Wvcp>%aH^{V)Eg_x~v;e32c1Mbd4P_@1w% zM-$1%s9fFNKL+|g+WqGSLo%q{=|^OrsC`FH!ny1oK|JOE&+iayhv${JxdNNqodR2< z7*7e}0M=xp8E>%aYVDMqnB1jn=dOv?#4bslteuh)6T2i@J9kY^uy*N^1ZJ#G8%PaS zlsHSpsHTb>z0z1F>I_C3JCesMn~V`g3|oKYx?yyatR1T=8e>=lJ_%pLTG zd3-96UQKeUrW8GohnPhYN!-veV~k>8DMg?ck*X$~EMoL^r#c#h8h@g_GGEkTsG~io z@h94Ysdkm^L5)Arp7ZJn>ilyQbzVJ5oqvv|&N_&iM^B8Z(F9x7@Kdz~t5tdLN-=AA z{4QE201K-zrpCloN5MIg5pdSl=B$t*Mm(;p93;mYyvg8&>z`RkFIt$QeNmlX_TO%81J3PzU?zcqo$4g^SJ1 z3nr)k8C(X=Egvb*ibeRtTIw)gSh_h~)2BK_p(~;$QEX9?R|zA)M~nqsxhjYf(vTc? z2}ObCfZ$P>6nwb%t|l$Al`Ornbgfg7a)UBpthbl*(W#*2h3JWTe@QP1^egQo7XGjF z(Ov0_n(0wXA2Em%@!A?y*Sn(WdaFv;YqhxxgE=9tTN?Z=MYGv8VDyyA6fVw!DQpRv zoKI~s1xYzcpnJVX@&TU|W{f&rq@bFU%xP)6K0Qb^p}Gs&|7Nq9i^q0ZlS-;+?O>zW zH{6}7@wg(31V*K{;Wo+f$2$K+t89&?n%Dxdm#iCdVryd+i3-|sf>b)*iS~-6*0L& zcI8Z38#HoKdgZ32IVnw3zcUcAuBVVOLCFVplM7nN{yC-2m|Ewww@#g|krV`647n2! zkMF>n**IirqZ%)XcqFBb+0Na=r3TG=3=@~$s8U1lD~N=5Ee1o`s<*64ytyf+Zl_NdFuhALNKqeV1{s<4(8B_Ze33}}Q? zqb^!nTT!dVOjB(^)(S``46pW0lrUI$7d*b&VrmiART?bL1SUfUx^&3tRt~hS)M1#MXOnSZq@0saV!jPC(8!4coX+b1 zQ*uK4gs4%-N${?VoX+Yi@ycub(a+O~JS#{(BB{7fW=^5j%U0HKqX+Z4W1cyAqX*@! zCx)CpieSG&cRZ?d!c5UoX@B|;f+-OBkjocWNDd(9n7-*rPfhnx%|ovDFjV`%fDibr z$(>?j4dhsbKaW5fi7{(si#uQ$pT5gTa_S z8F`M9Y+FyGj;Kcb%%yXklCUM^P&KmQu~QO9&tAujPcfBP@)#>8M@nE5G){~lw9NrD zrWK_DA?Y|7dD)3poB?I*I1&U1SSMQJN=cN0Fo)bR?RoGBg`Fo-P?#s3U5~Q~Pu0My zm@(HJ3{2obBeDD=G(Savc%bro9NSJwMnY(E9VS@h0v?L2nDS(L5a+{*tN(afDo_SV z!jV+~oF>Kg{JfqeeKH1c>FHdeh5l_sS&&FT8$3R5xq)0V84ZX;J&H}EMj>XPaaawS z;61fjG1wXTy@Ukoj+9>Sq|I{_2Rhr?mDZR?MekD%!^(JBv^2QI(EQl}#d$@xo_RUh zwUR+GXRn+ZYLitbbC%3uH~?Y8Nd);Qj!q!WYLAwwOzfhcPDvULG_x}a4HO*3w2~e> z2#mo{rRVd2(;IM7)LlN}vI^vENj^Z%79@Ow<)9Kv`ec>)YCI^P9?3%2m_UZOgPJ>6 zDhLcWxjvXh)({muky;STob1La1qHJtGiXGDc20#M@tK(erXn;5?#fO{U|%+hfxoy8 zTtc-w>`%x@<}yb&$Z~iLK8QU7*>C7I$V10e3#A(t_Hb-WxN6NgiA-$ARCC?B;k(h` z9ZFar+r&VPI6OH`ZOSo7UeY6&q!Q>@{LVHDvsdIz0%%9_Fo-6XslQp|Z7fO^1SyY9n1&<_%VGYJ|$tJEd8j@YHoP?PKCqaUesC>1^UoFyCtMb(< zf3?C_sTm-srL$2fl{iF$2kuHrR$B$cEu&!^DiD;*4uh1V31b4ZklT#|u9^vnoapf} zK^V4AfUpGHzsJ;w9K)ph1gNf}(jIG)iG#cJ1|^tqBNW}~NYl1l${hSy{z>!goA<8?B_+9cG zQF+ETt1?BZwbM>1Wz^0)Rlkr?B~%E5;IP|Fy)T{;+FM)p&VP2AkBMVV&sVb#0jf&B#s`5oxLF8CJ>8wSkq@wN( zp}7~VA>1pqM6aQf1P^s;X=_{sOL?c$r^4xROIg6IfJZvdqe}IC41=XPq1PbQ3D<{= zVppdRq0$xULpF=i9TM=u2BMoaD)N7$9}}%n^&``Zh!nU3F#qVGko25Kufl%pvLn_! zySbR`JYb_HdzV^Whu31;aK1|8X;KZHM&r@`Q@M^$<_gR_SN+DMRgYHglL~ZZOX;sf zA4lS06Dt%|E@)IaPFJ><&x>2j&?Lo3a-wDrDd|W|i~wk9G(ON(Fng%ZhdvRV58we? zQcOZm0R0E9u2qE@8A4k%x&V?LAb{H~;b>(}tR*hJg4Q(?YTyeGd*KQ1y@mUK?EQOx z8b`7?4xfMVtC)~)%pij-7+T63XQyUVbAOq*(*QGN8-u=DhZ&Zhf5r zNw$(b=lQHYyD>AU0q#WmuGGxYWNr%O%FfciZcg*XC7_RfYCmqmSIQ@7!y61 z&_jX%H9=Ltn!*W`maAN#V3TC31ZA}T`%q7q1pk9~4#iMTAZ`jZy88>XEIBwLY zu^^tuf;XJ0J&rY45actPS<7d(7%~e z15zZAYvp4_QaLFZ!RG~J6WN9n(kVfYjuMuDRAa#dMFU=89Lc)qgrH@LdkNpx*Gpxd zXba&eVmQo!MsCl{r7x0eQ5VX8r;&$L{rqFjb1xd!dCo!qUeMUw0^Dx@<%Rr1|0N99 zU%Xf`KfgY4C#b>KHF|o^9_7DaqEX$rfF&_n5TnNQvsNSYeTQMaZS%R$e9blYwq26b zk|K{Hi~ucoSC;oY1g@b&n+!KpXS{3N@k-hqn}>%H-GX}gG3@^l?m-c#pTA;g7fbkr&LdV#Ivdk-qVE1uBtgAZpcc9iV6htMTBC; z9Z5>R+4`4#X7rRH9HfZl+}{(6j*hnG?3XX!@A3(du7k`O@R;+Gb4+hnqf>!r*%fr& zana-i)Aw{{dle5NvIU}|cud>=%d23PO5SGf8z1N-0XlB?7$cl6BREyda++Z3Q9h_q zv~zT!mwN%-D(Spu#1G)pb`Zul(SS^YhRIce8TYE2K^IxVb&_$`L{bT8@Ky(COgs$C zkj(m6%$HiI8yPA4x7 zuEis?^L~>O)tjK|Bp~69NtO&_tDAI*GfbzkGtTRn?l@TAG39Iw)MAZsyTH7#v0Mmf zQ%;6$cgNrIG)b#rxP%TZ)ZB8@J510N?K#33S^Q1m^bP-EcTaNDRY7wq^tR&6ydN15 zdII&Q+W6``iLycqO5IaHIz|Z4Hce{Qo#_s@|8h=ZMsA|%G@^`~0MtK`b;7^2sCSEA zZx_G*viS9%ieERr7R#67dl|WrDX92j+cP&M$*oY`Lp#2)eX))b1neopG!sQ&EAp=5 zuhE*Z$wUKD>@RGjK$!E$x|Wo82SEzAnt+?>Auo|a*Bf%&;}1j-lNMfdc= zbMG)H139P`aHuwSZOU=QURb!3n^#pfJhdaM;Tz?7igpoU!#VcMuPA(mKW-T|+Jnyc z3SGKxnNVcFg$9>8l@J?iD6?J8WwX*~BOrU;U~9+3tjLupGVB3aD4buZY2oXK^LTL` z0|(wBf@xTDn+wM(%{ElCv@b1Zc)(#tYtuBG6m;^LAfWJhYmEHx4;L$zBbFw{%OJr5 zfo@^yo?Mt@dxRE1p+#$yOU(b^?$#Cvca&yoRu#FhA#-I5JxMRqx z(Xy?}H%VHu$_g}gF9neun(9$X*N9u=WR(+dJs^q?+&hx%$n}u5FodFBZ z)md#Qq*CH!ah%J^A?CS2;-|%IDZDYNac=w`w#UsHLts7B(k6L)g0zV@AW|4oH z%b0sofwk@HLIjp;owY^QS+I|?bry}w<#W=ox@S;#87#)4L|M*e82+Lh5ZYFSUYRyl zO%nCgXkkuCKrJ&RG0@GR$AT;7J{KCB##vTVmO3UWRWgY=Eg0X3M8n}6({iCQty979 z5WK$Go@j81Cs8usR|PpO%s9GDIb#qvmi(P`a@AbA9{jw5TJmz8Lk(D~p$?elBnJHt zb!^aFh3#C05YGkuMU~>}3F#tI)fQFbhWH_gGD<4sx_^1WKyY;EFOpdSL4>|*_6$h8 z2s0h-XMD3FQUouZ6A4dhA6!k&I+7DjI5y5yM`JC@fTsHVaTGC)uN6rwuL!3ct4I~A zD#RB|yolwxqkM{UIfBJzbap~J><_XSSu>fnw_#j4oCh)*SCgUxL8F4<)2$h86~!Z& zXCC17_<(MH%yd#rO64__jFZJJ$!XO`G|IFM&hUKI>>eKP_u!b-d)sNhsuucNUq0O7 z`ts8}${*SyR{1m^?}xUCRX(9bI6OX)=n6mW5~Ne2hNaP5W@!GdmVN_z0W9=lnH>K-oq+0@8Ln-qi3If zj}Pj7YBg)X5915-8Xn{|%$Ru%4=VDL@?KRtHNB9JAfJZW*m>I^)ns8u!?gJ$#;)ab+qg^9>2 zZm^GPHH{ni4X^LoRn%l|t9tfi!fxTr+NJ63rPJL@)2~aXW9kENH1i%F)ZEN@stqSo zlQ6VC(1V$s#+Lqo4>(ArFvP?07|s-zDb$&ZFk*>+B*YcSeb)O~;yzz4FJku%dhTdC zwBLgmRq%d=_}HDrQyPVd4)lCg3^FQqcL*|B?JGFqaa(`LMf`<9uc&2T$-O;$)9U}Q z-&qZZkhN;d5T$YZsMmVaI#~_G!tYv8?W4OvnJKBtnN3NeMF|}48UJbQ#{WvQN00t> zSNyN-ZyMV#toUE>z47A9ZyNuO|Mf@w+3~+*^1bL^T{hR8UIeGNa7LVbWCSn*{!#J2 z;`w}=)1{=k8pqR%#pN!)!Z!Ftu#Jc2`9eZQ{PUlW>XVoAD?9C-yzaFR zTis&}On+J}SGtRU{-T^~qJ7$h7QX$K)EdX#)Amm*ph6J_+8iFluP@$Q671=0 zesa3#Ezf@7CjJg>h!s!ypZ_ce<<_9pY~8eeYTdSehR5!(8+YG!+ucd`uzT8FcF(#$ zbg#QVc5llZ`~Et0##n@v9~0Q$ue0KQ{@6YW3J0I-+2@1LZ$2M>{`T|s=YRct^7-NC zr=OpFe*O86pWlA|^P0~1Vi!8rL8AxVA5W{!a`tAqgnI!Z2sd=yeR#j^ zxLRPVeey%-ETh8pesp$-h_=?b-Us?vdr@MaMNzX_Un#6S>ashvMU@M=@{${}a8a#V zmB}57>S8qQQsE&RzbLCfne=r%WO4EC4r(dWwfnkX_l$_DdZ&oem@YXu23QjWRV`@@ z^JKlcRo8ztO4vXqPF(gmZJPK?dyin;Ja+}J{txk(%3?B`Mw80UO8VjgcM%m+6q#cQQB6LeJURQ_BoDe_ zqQ2S0cprk*!s2oYqS=teMQd;A9UdR;AHF(!ecJx-RtYV!b1aaH^je3`T2Nhm zE0v!^FP~#?f1XC%!HM|s*eVy)~7W2XE7TyX7fHyK*Dh$aX~!_MY7UC=ca{-y(uO6`R&(TADNULk^irNXRbZ@z}G*Y82XH0czwr?GDV05;%_N#J{jjPpz1(Xn|txwB(-g+;oi`1YOSz{;U&6wPhz z@d%OR$HL2^crZF6Qf}Gl3`sy|O53Cs7*wd?dn;cdgn5aH?|^Ds){JfH@ZD zc`48~+L9pE3#--V_RD6c+kAK0KW?4$Pg~8EQ6oQcXUD2Nl=}{_pT_ByKnAyQG~fH; z=UOmHr;E$IFDA8M7~SrDF~nS%OZfD*hEcNizBoh+kip&;rz8~y!8H}T#%y!9^z*MZ zU=PD=vG+YNf{)+HtrN%oxpqoX0YhmDchG;zyo#o1Hku9w%eh#)iwzHOD}7jDEl6Y= zbpW-Ap?#c?fwyh&kq~~!oiK=}>GI;zb2A4Ph_pbu*$iW)vIQ-6#jZssC)Yn6yT>6G zxb=vEU@j_h_Z+dzu23zH>(9K0K2qSE=_IY=KE3ZqEbS&D@@~9tpYOlihB@X%Ho6%|0ZPbPm~e}^LGZe}(94Y-GBWK9?Ajul^kZ(Q ze}wjw+SF3pXZ$Fp=nPyose&-~9@AXlsY2tHIS1L#vO5&5eapzcSQvD9sN1l`MXkJ; zRu6{6vbg2woVHJbw~KxZqJMZu4<<=QaZG^A3~@eH)-KZv#_h1cc9htrSkjUWb>?l7 z_7tHTkmdZNkoy_Nub{-?K&h@7E`IpVx6PF;O>G+b7;gRTxSI^sXdkH>2ohu4Rv$1& zEA~0YO?{66D+H}tQDofYFDvIPjDj5BF05N&cn5ZO5cb((4twyZ&v_=`grV|e({Unq zsFP;*imnILa!qFd#)LYR+cMaS)Q!k_jFd#fP}ZcJv{S?XjMHDEw8GH7+f)796)?fG zJ^p4#HP!ut`v0s{jfc=V9v&=ur<%{6aSyK(*jd>dNOh6!^r)tEKLAfau)loP&;i8t zdYi-(OzlaSmZ~+?Dci?p5-kRoR_j;~^-XkCRJE~|q@7P^w{npw;{maevwa#EbTFk_ zcCv7bQV}i?GZk@+rfFCSUPEt~bOFC9`w@x)BIMnuIckoPIRKWE>FS$SSPx&oiYW8g z9E&%6A=;5t{3))Z`4ph~X54Z^GL|IWiGN1tZ3C74e0bz52i_~JYl1)}1yzI7{xu=D zP+j0uEoz)7y-W?+>sWkx)Z$c?OfWkM+)F;fNXEpZ(FJ&jsZXuDW`%O4sY68qE}z$j zz0&qqTe*WW@!5iNGJ72a8P2P>JTps4Hg>dRKR5 za_Slih@Jt3WtzY$zy?94S6(qnhFnZQL_M9xeHv zHItJf#}1mz!2td738e5D&YYmhxY(dV`5YsDUU9v1o+bcDzEzbkD!Zl(!bY_=cIWB2 z%&0iX!X6G?R>RhG@)^NUNq12PP}CLQVG&mPaEK!dpPnP>J$t5o{j8xAmUuD2Ov!TM zKeGp_1p<>f!)L5OP_5-#H5EPj{Gwv_440?1d(*6-ZU|1(@b6$?B?_iJz;IOHmX*Q4 z0mfaX*qqE^WIwU`g)q&;yV%j=U^u$OZ%@pB$0{7Q=vigX)~4%0oobF*^Rz0SlXpnc z`578I9NBmb>jt-BRAd2f&h#8FBy5uSYUu-j?T420x3{=aW>F+_I~96d?tgmwuR1Nu zlPRB)1rwqN86Lg)xSddpVLE=psay3k+mxd*XR6Mfp7GS7&&;a)gv6_hq7!u8${#O< z;e_dz<})akbphi^*)J=H>BhESm}BT)z~l+;@Ug~LOhqW1AnYCBv2kuA0hTpB+9 z!jLZs-La~?(Z$k`eL%trgJ{7H4xMIyA8oDS-)6Uice(t#_wzCTI_w^`diy6ouR0|` zk)yN2)=9fb#gVE0w(B>k4_g^EjW;ynYFLIDhILRLq&U+t{S=dYT+%?&m;jvHE(50H zd4lVP$Vi!t`$E_FUbmpB>+^1Q8#IFEUa79GxJ=S04-uW|>^+EvcjO?U%iPsj;<4n? zOU+}cnbcb2VoGi0Xrd^`ee0)ouYY>hY_?8M;RH{QulL)Xvy+y-o%H}|XCc@B6p&^E zbKGQ|cDJpRd3>|q(S>1vIOvdD6P{E_MwNo|4T@CDDadj#mAGkC7?l<0%4}<0V*Bhi zbKQ67PK-P$0)4fnd})~E)F*sYUu5~>SBsNqXB)bZr>f?DUVls$7EpXN$>`(h6@SzB zjLNry?wIvAe$?OSPSbqDM=yIkezw_w@-9gx_6V&p$fd3tgFF`dUwkU7TIHm%GF7YX zqQMjT(VhqY{`=qX=lOqJO&;6%<3H~3|7d*m%{SkCY59M=K>v@e?SJQg|3m(4{|}se zcK$%qzN=)uz|*rtyLh0x$JNC1^=NiaTC1Er9w*m(l0L*CWWD>xFg{;ic-|kw)O&&c z7v8H2|3!L^;c5Jrvq3tHGw&@&RPf(%f1Q_fZ1dkuycbs!+fl`~+r+E>zb+>;KK@x* zk`lh5nZwL1C`=Y!!cK#W!9Ybuv2u;#Pc&l6iZcnJS>>P44v+ab>R4U&`)`iUn*F|O z6X{eaH6&BO>JnSZNK!}0#NCjiOp$3k8zV&*bvPkirbCoL6O4YKWt(J5`ka^s>iU)( z?*G)=f79u9k4wO@wlo?mV~j940(t}?iOq`e5{T}_qTnLAicQXhL}PXyO)uE;17Tpi z#`9Rk$&80q!VRr5pp>LI@tFI7PF`+&|9sl3duO{kdUaUBv>EwyS2}2GlWr5#xajIn z=UkY;nH|rDDrq)1P*ZuOR4oc5Yn&f3^c*yd!Q-|zgRqB2Fc`Hu0rCqexF~)7ZZ9x( zHYp$ll$DULnU2_q4P(00tY!pN9gx_G)~n)QN@^@~1-TitvGdm{#i@)i^ds~DPtc9V z3!)!NNx?=oNcsptLXqGX(sRDp-mEI(58=DMPE^`ahxFEEdy z{)jrImqD=Qk++@@GAMFq!=q&A&+B&Y^tGQ}MB|;~wmOrJG2;yZn;=|u3tr6z{@%5= zSF0pU&}iN&he2-pfbhlX_8EMnIS;pC#8#QAvhn8&V79p8(Ru^L=q5=Pk8eFc1H1Xg z6F;9wkF%JWNVRMxqwG>B6ArFPSzq*3CA>m(I2rCERVAH^nJhozH?2K^7sNv4VvNqq zfX)!>jG!a&e8A3LrVA7yi+eyOX+-=Q@*EYbSBq^ZR;kuhHjzmRgT2KQ z8Y*)tig&9snxFG|+=m7icpb|Jw%!jMf)IADntotdxsdo!1{G5BRa+lOpYU^4M<3;# z(7~C1SFz3k@w8S|^h z-dv5w3vEeb>j(o0#;dG4HfFWp^>!N|;M%fcvPp5eX5ly;lJgt!PKE%Zst&+uEMVp; z3Z7$ugP@U;p{4k5RSz?Wjtq-YsbM_9=vN-J{0+Z>NLk9oq5vaX;j?w`G(v-fhC979 z9>O=24Z?XmiE*?$ff|@rOdAz*pXo8y7qE_HtC77jTMkgCG>Y0Jyz5N6C zp*^TA6nsencS5yvbrg|-n1E}|QYJ3h-)#-1PX*j9Gb?L$l?sSu6_L<9awaKYex)+? zWiiR% zA|Npma2GYlA&fa!bn-E1qNtf_;Sba6X^n+jiBD}tWW{TDrB>7SnnM-rov6l%vg3whV?RM#^oTI-l`CVDxu?rk}(n71({1o z81HO3xa0xt!ZA!zxk=Cmq1cR9F|Sz^>|t>r*5H)&nj%Idm>g+=Ao-XxO<&4aWFH3lY$Qa=mjn3+7w4Whv^N5;M79Pq8vIO|}P9Zr81B?e);+n?4{~8_E%g zGT~j_V*?=CeJTi8BGGdvaMJ~PP~%`LGslp486_wNj29ug;&I3Rq1>&QEhuhNQ{m^; z>NCA$(;`N7)$D0@h)VMz)$3z*Pc5-aw+|GFO~OwAwZp%^gWpz+ee_6LPQQ1>>SH*j;_1@f zUs(eJ%Q|FTWzaqDzwVwKpR|svn;bFL>{Q5k&|t{yV}?T$JD`+5GipYXN|RFu+pYpm zqD(fZY=@o9<`E45sv$q4V8AfWXcV()k?fg3TpU#j?D$b`+WEeP8H0a0tcdI7KeM)MpD2kJAh)5V8227Pvfpp6;L(O!^kUxjn_ z4bq>ubLyKMYOU`y>(=M(YS9UjS|GIZePJu2Ho@!>hzU+7~M&cfUz0kqo={T+fZsjEHP^0r)daZNnZKERX^Giiw(6$+zS5zs_jkbS&`Sr9T!L1FM!} zJ*lXQ#wd+ij%S{7eVKshcAZWu$n*{3By%oEfvBXenl2e)R%FOMJKH`DsV$}FQQY6c zED8*h=mVXX$2!11v9+u~(m;&v+Al=HwBFDuz-;NpGsg%X?rN!4ofT}07pkBuVXTIW zZKJU_t-jSzxmX$hxf>=g@TWveYhZG*va@m9z(0vy<%J`bIKL09w}LC`=vskx$F9Zw zmWg;M!!p!u3`6zSE3`!70eWycG{p{tN`ay2)>)oT37#{DQP|&Q8+2H>Cj=C>{80Aq z2~dtgq$MFeBA!F*4lOSn)dYfQ_vO^?AKS4P$#fZS@=086x1wk!W!5}_0~%#DMASY~>G6*iGElNN#f_4sUG(hs|Se+XTqA8AD;&My_l!yvdiW zu9-!ypr{yA9OF(ryio)q6$f)lZR^y$dnLsoL1J25vygV|Dr)f!Z}c&4aCuQco>0Is z;4LQ7)g-Fx^PPGzmAVU(J;#CsELSkqDINdV@T{^h-ke{AQR*KW#1}dTD(QD&Zl=f=mx&$5uu2QyR>yuC<4(kqVi>%suP_l{)O$UVL;ECN zL}F-Qd;$solq!dQeP`Jf@T+IfYzIK>mT~Oiy*-a|_b9J!;yy$9p1o|es1O9~OSFu7 z>?V z__mT24uH;86Mu4?(K?bjto>;+HftY#Rdu2fP8yk+h%@$%T_APdA9ecrL6n3vfl8m@ zj4aZMM3wXmzi71-zgbL})p)8S z-~cdbK&(Pt)G$sh>FVAh8S4R!^exZ#j$8mVzMV;w3a+d&QCXP{i~6j(3Wv8CHvDiA z!35D*D=u@YSeIV~B4EEyYofv?N37jSrx&{>l`F3OvU8mvj9F1S5H}nTY2&LfQwDs( zcq+;c;cnKv8Q6+)hc`v0HnhBYpAxR}s$EZ~X@GkF@){Y;^T-R_svu4XAMUx&L+} zJlx`=7`20g4Sm#>V|u8#4_3=`HH)&`UgowQceANDrU5q1S|gWjtit@{uHDD*iwA5# zO)@ZzF$B1_K&yR%qrGd*S^)o>ybL$?$r@U-MQVMRFim&7;}UXtFTiJ;nTj> zBgNWK;!Td>RE!sAaOnPUt1nO!iY0~7&?(4K{93^QUDT;*?&!( zxW{z<%E*jOzS#BVrrzAGH#ha<3&$hb)pC+IN=^T07Xb{Ly|58YArRW!QdiN}&vXiL zPT{ZvbAWvxc z&YnR~fD6vK|43&@TD;0)chAt)hEivY`h=}uN1H_vrzKL>wTz9OsYDHp?{26raP7rm zmO~J#&a$yJ!?EwPgC$7MTG86I7fb1)h8fRUTfLC@NcPP) z8THpx2uT==Z@odh$hKWh=N1a=FUCv`5shwW*Atz$L}PXoBi;~BFctt?l?hJ(Yo z=<5IsvAU2u?F?gA4f*0$?oq|;l2C^>$l9_JI>DwrKVqya8Rk)Rq!3RY2`v7pgDo0w zLZ66pjxnPaX*H4Cbb2@@o<`?}(Xosj87mCOlH0eWQ~Ez+6bs}q(z;*S&MxB#-7j03 zYx|PFX#R^XK}X51Cp0)#d}xD_)U>5#RWxyEvg^Xs1E7|Z-Jr0ynr3W9O5B1cK&VcU z+e*sHwK~F^MG>~S^7l%Zc1!m^x;Fb31sj828HO!cj?0-oR6o99s$Rnwt@D@GYNYj$H2g4 zhA}#al`)i@SNIxJgtfv258r&#@|<37p7TUPoq{rn)b>vDVs6sN+g4Cx zeXMsal#CVA*ggwcHRrj&nzSyt(p+eU#Pet#ufhFToa`2KXsyio&|n*T>K2UX6poXc zxo4d#5+(Eo8vnUe59&&HWZ%-NlNI(vsqk{frpBKkKW@u%VN}#BjRXg(j{*K@;UJk7 zVL&Z+YAZ11p{mvxUx|`(o{)IFb{{b}Dx+l%e9VW*Vmrm<8)!9lU z;FQQ(=^`W-zx=_J_?b(J|NLk0*=kypFiD1F<%JSJH1Nf)U zuGo!Jt9H}*FrKr17u8Lqj_&jvUF0EZEp^5UvlZ=ncy>LL6jnbDp9()~mbAeS^$iW* zEzN_EDB8)4MoqNRj0i<7UYVTucs&y}#vc=L}AMJSp%U-fY_%b?d5BqxW_OZC-?nMimv;=6SnXweHVI!H=1f$mnXi_}<-n zFr=mp0jpDpMf(d!$Ui%L)jIKZD3OOrWvA4V;*iGVLmEB|T^3W!Pw9laTZ?J$wGIMs zS1l^vohnP@iR*v2seIQsh`-MDK{xHuRBNYQk2G>QyS3s$QvV&JFYBa{%vXTPHr?A~ zeKvy$PPX0qGC2;}K9~ziaL}kJ*XXBDO*;yvS7RG%Y_G175Fsbqo>4VmP%K^vFGM1g zi~;2Yn_zf68BEFG(j_~6n~&;Pq>&$v+MONi@%4V^v}M2Oot(k5?Y8UGK09n5_4Ie; z`Hw`nrv*S2$I`3#x??ITu_^wW@i_({mH<@*q|<)$ws&^gIyuspLI3VF=h*PlneaxtRoC?-%O(QU(P+fWeTCmdIhZQb+FFiwEw}%B7nE{ zy+ik!+9Fd7yX2zd(m}`NMsWVoQy&eU&tp%O>%SAe~P4>)aq_xk+eK=>~Z4Fr|N)6|9BT*BU z8OKmyb1m3^2hoBeeZ*4^C5@ii@tAG3QTvxxoNzcBCOXg})uCEbz{IalO12c4(oP#< z2pL?kDM?8j1IDTtq*YGjXQKXyZ4y@!kiOe3M(-EeU``LCfVj6(l2e zQKZ{2jEh|lrgCM?PYpM(g`J!VA#GFmb+N){d*2=H!OOr~`d zH(5TJj#;82ZqMLU7KG@e8l%nYcGVVFKeJblnKtCYu#nU`az5Y}%_={$mz62ja2%z2 zec*;XRy=0;xtpxD=Ry!8JE%ESM;cN$V`OynK2t)2oZ}DGk zyyY9qEQyk#na3L3U?s2 z07ye^3@32uvAxD ziB)r!&St=q?aH`XF!VgU)>dzNALO=QT3muGQkT<3GG^UCL-lzaj~1?p2bidhkDAg72rU#&jLon@hL{w(Vq0`kV>^YiK|dEOVjap|~neASl0ZQE{o zt-6R)<~yMHu>h*Zcy}6Js?CE)eKtooKa6CAm|Noxl0TFFV|8m`Ya1aRnKXQaj zrBzaa42;@x5*ksj zhV(Z&_)%T>UE$1-mA_HW#|o;L<%POw(gCluCaoBf5oVnmLtOd^ba`Ezq>1}Dwe29x zcB;c4OgZQQZg7pIi4loOoG^tJ5Nx)CSyo{zTekQ)y~80MV^4u_gR7Pja>aOxwEg0h zxziNW6xAv9&ZH`44AZ?mWWVfVW72M-B6REKPZ&Oab93|gbLiHpD@Zl`zhP#c0H{Ei zIa^WM6K{%S1*)K`!xfs|L_=-HNTqwwXd! zC{CHvy^ek6p3(p2-!t9%q;ryoyqbD!p3(`~s>oSJiW zy)RQfDw=aCGjX1#xu68ppi)r-ES#VTNrrPf!N^=^uFS_ikDTyaCfs?ucUq$JCEntz z5Z+em+yL1B+x?S16x0#WPcfP}i)C5}gLTEPIs3t1DI_DJ9{o&iC6cHPL5(<}nB?>D zrgmE`nHOVtVKcj1RAS}V5SMjrVQ<`pb88mPEmMjt4bx5MV(S){P@OR1YhUfVL+;$m zmo;p!e(U93v|3PNtAP*O-95p7_Z@-1t@@NE(s)GDINm{G)}rMcL`Iaf1CIY~ltS$8 z!vR|)&^yw@awZo~e&TopA`pFYJ)Wn)3NS3-*$hPEU}Gbm4wf?|PM>4=MC)wn{kicr zNXN58&Cd+PLFkz35DxbYe`64&U}Jg3MeNU5m#hOjP3h>ybRfC2UgMFjBLl!i0*w#~ zp+x;9wMW8yycmo-)~N~40#HPUofurAJpo`?;X*4sjq7T{8c8&5gI3@N9pXiMLNr-~a(qS(w?nPsv@)>|p1BZ1rq?dG>MFIL* zAnjm04MS(jlT@`xIzyOB7%6f(9YAw+do=IAXy9@(C#O#klEv?nus;~ryy`iEmUtYT ziwfK2L45ZIkHaU7)OeADXnyT{G$ zK`X>^Rr_3tZi|X|2q8#21}QQbbTH~3_YV(WwU2h($F}$U&N($1EuGND8%&S)roSH+ z4Q(5h+V#4+A}KzBnC_e%9h$~p9d&!=3C>A7PFZLdPRVD-JKmd4%X!nz)q34-bq-9K z(^lv8Jx55$e#m$_&H#42Z*BXd-%tDN8~IL~-y}s*Ymf<`@hsXOp7zG*tS?5=z0X#`cYQ3jHvwezX{!5W%`MbSx zup|~y{;o`f9!KtZ)`RhvJq<)etuf|Hoka5wuEQSt^c)j*6bcN z_j`tl^H(A`trC6(9{7~(-#38V8)Yi1u0t&Db@|18T9_Cvd?iMfLLp}L;pG@zM9H*zpQ-J1(Ts)H4%NkAma@mHP2IXW z@F)wGuB{cd$qLbnnJUFp31HdwLn}LU((0X^96g{%N@4>v7cx}qt|S_gxQ`QH!fdO9 zl{tz?NN&7Y`YwexC;4{Xois0ETo)hd)N&%HwR ze4)v5>=oL`7di(z4Xq+i3yP$3yTm^WO5C_b{-TOlWyXtyi-ZvzYna&BpxQXc_=;HW>87eSw$r~5KRVYh*jMhrkF5ABp$m~ zPuS{*bk-+wY6Ip0Y;7dc_peW^a7UP7`|9LXnBb1^t2%g2CT35~n$}0pBju`5)gV2q zPJ%4A7*`DiAP88VD7fKBI6*yBtYHVLs>*NtkCO<6y+ZP>E7j7u?Q3GUZo3HbD2<=r zWKz(}eBj3s_j7t)BM{h6>ZUpD?JsYVaT3jM%`wwm+cqgsL>h4=L`KcF+A6&b*#^wx zizFkDJVhr((>&@&%Nyt!;O}bNnQR*~4JX9!blaX-iIh9dLY#wXgUzL^w;;$&w{4u? z15FLCqbBpWJ61+9Iv5xC!~-;YKT_9Uw&{yS=RQsYL*k4k^Fy^^E&48{4lZGGH+0JkCI z^Fm(p7&LG{ihU4&zME+M{vzy;BizE?zWey@K9peZHIi2>C*_7g_6=yIFQf4XBk~mv z=c7lW*{dPaqL+ol$t>5nD_pUILm_+hsTYXXr`)>{awjngMm`E54kh{+aglMy_<7T@ z-m@FWr{krI{$cmPN>E8>(@GExF!MDWZLZV#2aYEs!F0qIhok9`6sCiaVnW+FFwD#j z(W5dVS)qO$yp!V^VLgHWPiwU2S;JK-3RK$c+Aobsk3Tn3$>X;w9=FeQ*~-VR>CIte z2-u40y|VbZDUPNqZ+=Fo^VFIFg;uZMKesF|7;S>HKl;a$Zp}3)`ArQYid{L5Zz&aG%o7PrMN)mbmg;IaP-piT;;}2aaQ`r)OqkQD9QQ6C}Sk?%_7P^6zW_M z0cv@j>{FI&)FD1I8pNtm5)gNG3%qg)F#j&$9G|#f-f`6r#r0_8bpba$z)cO<{qnBq z0(QTi$mg)vI#o9aRSbyu!Dvab1g6LW*sl7NK%p8$gX1&_uuIOu0aSuj4L{{x5|xkm zSoMn|P%O^l^KLP#Ip}oN%;0~0Qu>E)PDD*0>u`bZvi_H*5LSrA!c8I&|K5YsMOVzA zDk>r=D~9QEJ6kZBF34DfqCx|=|54J`Vwwp~&@doHGUqg_Ft7nkPc0NpL zMGul%Qj4oF)Y$;deH45CGtSGiAl~)RuJ$LQZwfSMjR_A3Yi>duqw)dcL=tnx4Cx-cT42&rP?m2s<(n?f4JR$pbt3X= z=Y|cai-l8Z$;QgA6=s(&4KBv%ISjNi8&sTzP!B&FgdHGz|JHgB;2Z5C#$#j>!RvR_ zx6dOK{mH&9WAd^Zp~Jg*N2aR_)F!GBEb2Cc;^fZIdm$ab#>n%*Kyw|%dr&+x;JlYY z-SwKe!oV@$1(=m=koG$6HBuE_mR!JC<`jNCH;#FXi;MCf;%y4@YGe2#nSOCxmudRJ z?V;LMfhLgWcpa_<^r7ah67~gD#)T>yIg!8inYUV9aDo-D$)ld#sNiIEbA@;zRM7p3 zjSos9BsR>P=GJsbCADQc9$4gz5{GwOM&r@F@WObg479pgr-B`$`DlTEo{a|zmiwlO z5EVZr>ls`%^g1Y{mT-Wwpe-7Ce;)F7-LhmqxVR+8JiL2CKQ+ztVzfeurVcA1{|!mi zmorDvd+3DfhRE8~;k9UE;V8$52u-qN?IZJm*X+_=+5Ol$9*&MNwo3`f268#e4uD+I z)bqD4+qzRtf#|ZRqh!{DJV_8`Z*@@h$NiI|_R*Ui%1K<%a}xqTLkE-!L;vlGg_&WJ z%_2lj3PJ`M`oJ&iJ6?i@<7$a6L&rPT7rI<4mFORsA!F>Mwjs|r&$e@7%O_(UHy~#% zo#??ef5IpBcd_>++>+$R180NHNYH%b?6lSY^V#7s-5tW)>0rEs6H)eOCEGq_u1AL!CF!ue%Ln>g ze>tnaq_NRf;B5}Os|oXoI-+4c4Qap`*)2;6dtro>w>r+26X<)@vJj!Ik0B&k{|ffl z`Gw_m&o~e_W~N?pr6){@(ZUb=C$M8;CfQ$in>9sM}USTswp76l$IN9~cIg=QhNs78o9dK;ylpURU z#m?A5?E02mnIz=OSF&K==&Pi(=1e?rB;hS{HxHs(eGC%9IG|8>$Y{v?5$(U@^X0__ zKB0lF#_DX20pG$hmfs1!82&mf*O*IP#6;)#fu|pN)k!=CnyN8HRh4a)WyEADdl{*o z48L1g>N{;3^z^Cv^&S2o7S%_a7n7yh@F?1fad5U&%OUGYCdAPik1?xJG`~QRnW7G8 zKV-cpVV^kGz^))&F}=Vx%u1{r5yJP-POj5AM-s!vc@x5Vs=770_nZ=#& zH6o0ALHDv7Bnut4di%W!M6JH-tPOOcP8!o%6`CMEE zpn6N)Up*A)biU4fps(@FHx(lRbDZrNpIar7<7;(Pwu9Q}IW0&gMExmDC`91_07$j! z6QMKroV(7@prdInP#|000&W-P0}J58r=`<+=(O0^QpNa}TSI3b(@D{%yAEQV3#)+y z!!{RhyzBD?n`6z4f8X1?`qa9eqO+zwWr=c7o+?B+fOZ0Ze#r-UuqIj5?=z>W*^iyj z_M=QD-4%J)8Y@?WM(sd#`Qvfq)RZp565Dm*$t*vm#W$$#-W#)AqX@UZJqXKeOZw=` z<_}<7h=qS8&-x_#K7I6kWPkNOg0uB*&19Y2bGFX^$W6vVxRt?9z%YdQ;3H?y1!nWd zkC?b|>_Wxa66R#i+H zy8h$PhSQyorH*@VVcstFfVEnd;^Hop_HzZD?<0sGtOr|fV4YL2N< z@u@uXf8EMBYWh_;JfeelW{O6V8Eca|01t_zALJ_@H5vQVQ-IgaF*VMLw$n#Hp z$}mvmB%WWy)4^@GU3yncLX`o8SuzT&hi4C5F*Ro_G8 z?f>nf_WpsZiME}N#D%P;W4gf817W`_g8l9hV4t47S_d1w+6-)XdI;>pv(7r$=nQ9I z!_$Lcch})Wg7BDMqldsg?*3Q^d!&FaLx3K%f4B$GVe%lIW_uM>g9eODW#A_d zY~a=YQ4Y_R!+>}zJ_us>v} zxSy0Q$+^elR@(R50hAJ`T2BTaE4;q#{GS@^fGp)dZmhsZi`L5HaM9I}Kb42BhWx1< zbS30Z=AVU}?$fxZHqanfUmdA16z2ePDqx2^M`A8){Ug|{)qFb71xhT$;HR_RV!rm# zjCU=#hqK+a;2zF&*MKttDkJ#8PrPPcA4%G||Q; z8eqT~!Ka<|Qu^U32dE9mZ=R{eHyBDD*W}{|ejzEvJJ=$KTn};k`v6C(42+>f}5MEh%T6f1p*Y$Wz-2letO+ zGM-{4S^-_+`rRnBNK!l1aysG24yzlnK&|8mCNed}&_?V&XoorK_8v4HA1`{Y#P(lm z!T*@pyIa-unEwc*&>$bA)qDU_B+a)(k3&*)$GqCW$Q#WkT35B44bxG;aL9h8!{Gru z2sj5-^L4z_A{}o*ZkbiV%X|%_L=UE5c4*@tV?>UT3LB>5TUhmt^Me<5Y-$hB(gNxP zRg{(2&MU=9r7}nV`4ICm3Qo3S2443mOqQAeH2UtotGP)>?rfmLRV5 z$8~CDsH2ct-M5`ER7}^!`9KFZeIT)6>_4k7mZKH?Z|fnDC>WwcRpbqPzonP=Vl{a_ z^Ip_ecP$^)2duE3C+8|pdJghblo>g)r3=i;7F7Cx=E`nx&0b*m%1OlP-|1M>1LgD#Iezk=Iyb9r&>b*lisZ@Rx7>}pTOQed-I8sd7 znx~Im6TUuPyZx(Gp@xT|;+9Fheg7s}YnzDeCSu)0>p>Q3Ye#WmkKzJG(fEi_yjeSn z3wsn7v2Nl)qrf}Iq9qXI!rQvs{v)Rzn>%fNf}DiQ#`a~k$l0}I&)F%gHEj=ajLSXUJ%3l z)6J#oyIpd7O$x}ni`&p8xiVqjF&!EEKHIHZi38Bz2|ju91zya)%Ki%TyM z$df&5tg^KQ=)-uth|qxIDw$*CqM(AnDnQrh(5aq6cGuGlWx38W9N1G;n;7yzdD2bE zb^!q3kaeeaO#WVH>8x28E?rPyL(UIQDgxzl)0Il(}bJqoP1dAIiqGW7*DVZz4p`A#gY9*q<6|5-8B?oPvvFK=*n%Lsf)Phf8dGP@u3Lzrk)V*%F!kpYG;69CTmj)ovfN7&T`C=S?-IDYO`t$8&1te%MOQM zvy#?wb<2wYWa=mbbpg=&gY}O6mea zEgtEXVd0ms1>A0KZo0FfJ<|(j*5ZqB(nmf~(KsQ}cj;9m+g-Q+Br@SVtL=4H)ChwQ zDu<@e^&GEfS1eY^e|a?_SS2&=26k>p{7&h=sY~^`yKsCrOKy-{E!mKAJl3oVqjEsu zBF1?C*>8O6>?{BOhf_e~kEZ~CW7?2~Oup<(lV#cSqj37O>wMzS3Fi|+v-|{mHG`k}L3}s>< zAu)2qDqkEePF?f*q;>k%?zWw)KBj0-m?hmmO69Phr-}k8hNGCMp-&gd6jOOEr}$P8 zjylBUnp`c;yzZWKy4_=cjpkKt z7~l8}4=ykA!>Y;PjgdWXxBS{)=7DNmrFwwJ8jZp-aHl~5IozugRf6F*y?z+}jU)`? zg#(3inM@b+)MSnGfy_v_al%1RT?%M-uJhaZlv#M8OuAxV9Y|%YS~j*=6a~fs^`MrE zL?4ME7^(C!s7s-=*BmJDfj3~VvM|Js6JNm!^cCo4@6;Os1~5jJx|ni@{LCG)@mwHp zhmY!cub}JZey#9s4G(|QI3C7B=kRy;JsZ)OwI=f;vd$xRI4wHWURBn1s2MVk@J{|Ri6?{EEpw(XSwZq5VCSWD6mGbBd{=_}5)qNRD&?E< zgT7J3GGr%?>aHyV`icVokZ1*=!(%cpxCkE64enC87{Y#(vCx>!qCuROQ}*LIDek9BZa1tHM8Uh$(U)-r&FndWB4#0m|(i+37sJtiPnr{6a&6nSEbF z{_37|;giV{CqvN@fRO4D6vDh1q<{?{!b9%;I^EN=lbjt7=4dt{5of>H3($&PWbgh~ z)@O>dX@^x(Iy!e5e3G*whd5lbew&V#b{_w2naty1(HYXQs)HrQ8otcd(mUo=_w1W5 zU^zQduh01ot+uRK7~HS~{qt{>i^HPo`<=41Q#hH2eA)O0e}D5$<3F|<+xSng_2@k*_*j z+)EDl*z=2ddM)qt@o*D3or()jX;v!0nkvsxwJJgUNqCtkz?5EPjwx4y8JSd59GBFI zL>^Gqh|Gzd44cX@rCVEohDn4tk~iJ?OHZ(V8@Bavma3yaK9H(rT@d>f_|%3t>nf|M!P&1p9F=k&0pY$;GlpMI zk4$T}xuD-CyB7rVM9c__@$yI@rYWZu{}@PIh(Imow^+D$xEfILB$3+EEMBj+;e`}^ zo%_O9cPr++2raa*WiYaw?@zL(3%qviPQ{}Yn3e10^<<|mnu|vwf&??wf;9*yDc*wc zfei474HW~^Vn89JwJ42PzZY=+djUWHeg69+{_OJ~PClRi z&>Ep0><6cVc`~D0l}f$s`+G-qwQ7X7F|s z#FOB4aBQzmHXj1+$eZvxUoG8@O*N>ma-@{Y|Z)#zE9KH3c&o^^UBtzIdt zH>~t$S-c#k^#qvtAf`inSf?H0aQ~;%-T-MpmcM@Uol3VgNv6qUISDAe2^&n1i{FPh zo^iIy(L9zjEU6;!jzQZMM-+?jG9J$;h5HB<8^aj48}w0l;`Q{T^`?E=JNdbNbkO># z_N;1Lj zhjzywRPR-{3+v>l;VIK)jBD8m>^pSx<#fP%r|rdlv6GbUo7$g-Ya z&l7-l4u_f#;<7bPBlO34K3u|1BN?;?m&@q~r+>DxLOOZ^@G!Ug3SCW&v`}zB+sOWo zy~~gEN9;=;05`>8W*SQNclZ3@50v%Ns)*#)(yS|sf+FmMjMtHePiXkyAVVLG8? z|2yfwts1$}ywoQ!0esRt#R#`VV;BY&!9gSOd}{X%$3Ufid2g^lR~sO9vZd<$22F)}cn(QRm@3USP|{jb>&665+g=CUI=Dt z(}&gW4c_LsHL%5+O{|O5f+4dU4M3jGEFK>6jMrZVO%iyENZ8PElJQ=D?^(~)XD;yZ z^#`MM``Eoeh_LYS0G3%iA4ZGlV<8{|zein*KjPnpu8UU#h4mLRpPdK`u-caJUn>_b z|Jb0J_L!hD!MA`3E*}c57%k~}nvUb>K2uwan{>RMyo~TLj;G$>v^Rw2+0iwYy1Oqf zFV=&32&Ll6E(tEwSRO!S=DP!-aKl-RO}#Cu`f``Q27pP|KAA=HB$H&(6fP zxwr?~=T5)Jr)RIcqf7Vr@T}vVS>Rpwz&i$ZkB_@Q zdS}4y@j?3s?*!OA#%QkI>92c?(N?{aAH3|Iz_HJJ_Y=JQ*6;S)PN}h#dwEi7_=7n+ zIxIE((O?v~QsYJ89za+woE*A_^dPnVtK@g1)5~EL&c)mQ9-vkO#o}2-3=REjd&Nda zB(jq4S@rEP2z@!0=&)%ual;ZD082ix1Un-TOcTG;#iF29qj-tE=pIl;lf}o}UE|+X)TaOs(fnd|S6}Yim0)vo zbG5`c5R=zCgzV9Dtt5z$*6m;CtE-Js6}*z&%i*zjRblm&=L&tcTi9y{PvV8EhmO!9 zrC*HG^Mb|h8z^|4(lS13w(cn%sX8OPt6sfv+bw@s0U}vlebu_t)q%fZrmqL|nQMG{ zn=8*ap3Y*$Nq`-`R%3h`&6PREJRbN&s86(t{FYZaD3+>(z%2QQwd#Ne`+l^#JL&mf z`P}GL*K>#+S$l@dA8Im}!1aj+D7|2NP^Zg>lel*}y(f{owLX%}T_7JpboOyKy3X!J z>bW|P(e4Aty@0;5kEJhzyN@8S3TiXuB8xAvEONtd^a(?CA#){*h81*&wO5?<(TBiT zj-W-(+AS0z*s5Al-sVu5i<59W<%7(Uy%Va=2Ecu@^4sxygR7$Qm!d z51@{`upg|-4oJIh`T^9hwD$AFmXZhQJY6mjP0pz+&u7Ul45l(rnDC}k&tYzA?h@+q zGna22p`!w$pmpns)me(V?rfOU494WjYf|jW@=X?P%SlG~DPS@7sY>IK?Tt$YubK=E z@yP`J$m;z1JRV1mJ!_6zC~k!p0Hb2suvGr*^xRZc?h&dvgx_^PAQEIWKaVcr`XC*T z~=b>CVbe=eK`jvmd zi_Nx<{R>`r+v*+fpPjb+8(#W?RZySsjrXa2dUAGjMAyjQdY|63@S55mT>Ge5!qa_$ zh?>{q<2MZXrH&{HRiYGdGPdo@6Kg?H^a5L_(J54NW4Q5^`ssoi zq&O>PE?zStTJG2dP!JqOxgalrtXp791?0 zf=i{9LKdSLYfyT@yA^K#_%ydRlA6&v285x}a?IxbWM}h<{&Efrkg1?MMKZhzJLs6f zm@}Rk@D}}D03YQ1cY3_vY*ni+7)27mTNB>$wIUl{p}Qq>TDOj9VeCpuVeQm%#fx-i zv2?zMLY7_!p6-~i$jOOhQ5;#xJC0$cEsSvHR#BD!B*7>mBRzy#=IkUPX|2ssMfMdR zHGWkk5?PuJ0hsSgl35keYle_?JBw9Y=;7{I$5g%gYNTr`bGBWtrla+^3xZ?)<3qy8 z20UY{0UWhEel^k7+|{%gB;^K9T9-RVPBu5W4yV)j?jCoKayY|^>72(K6gK?bUT%_E z#e^YDs9I*|gV`;3R>rz!EEUZ&+$a>@Tk0GyoAhR*?FbfJ^{}OL# z2%G{KpYDjPys{pN@slQgk(?)#_ux@kzi%kg>>eKP_i&$UAN891r@hkxB2!je+HKI* zpwkRl%7rRYxkpC|05bKYmSnie;1_kJSIx10DzyrXO^`Ndd%qAP7jG-DxS6anN3({n zYmKVEKWc@9P1BAlj6e8QvlUgd;;K0t#r-#@Y}uy_79WjPAB9xaAA&lF&zBbgkkKR1 zsex-&RqKjkPs0H{XTAEi+kJ;2qr5{5zDBdIee8b$V2d2#&^|1TVb9w{Y%2P4KREi zogC2&eLmDKr>~7&A^CPvxWpm4ccOLc5J6mU_{3}$50VjDt6iz=00lO2Z__ldtup=E zh~|#Llzow~+8#%I)qF68w-M7(y7mOa=e|{-au;3z5{(d7X{;SM`NLTbT=ux&kdMt) zt5s3VB)#nYdiFq2MRyv?_P$uzKDx`WORE1Bc8!$) zL}wXc=_XZ)k}3X+j>-iUvvfHh#JVbdS2u0*!8o3}pJ-+|M*{j~^T)CE5#NgFm9L30 zB~}*DxTcOxm$Qt&FRNArc%7}Gs0znJ-_2E;=^!F9ek`429588DEe5G(mr%~#+>wRf z(d;sv!vb1}d-<*anO6f2nF>vhk~!WbQD`q!Zmz=nd4Q$`fXpE5+BOcTs|27A6ZQ*I zc>CbA{ok$kl&MdnmwYyG&xYR7%lzb6~_ z_G;UFf~Ak+ImLv=v^Jb?1a|rh!1W>?*4S$c^C$w6F}DSbOmgnOnyQ~3} zA-eD+=SvKRCzP?N+?s(9R z6r)vVml$0v#mJdiN^Sm?V+%gnpbDcDgYHoH>J-jAB%tlk1Y!`<=sczHk80wl;(r@iGgYN5K|LEu7UHj+&G2Z&=_@s4u z8gx&B_Th1--8!fR?W1Pr?4W)0CU^xkkGj2}(>`qX0Bo;IO$xAf3+lZFAcw7!=398N z|Ek?-_kOMguiL#Ng!&r5?gz*FC%ty_th0XtYvAO#d)k67901^>_R(u}QEMHxj(RX6 zXc^uHtsmeqIDL!90&Gq^Ke3P6r!;um?Hsh=<*OF-4i#+N*wN3p6g&Iv!&-2#f4Kjq zMfJJ>=Y$GM4}W~yqF2!3KKzfAdx#tKZ90KR#7(bz($kfHY@fDj!Tw466cO|Kq>JX7 zfF7vRB`{F)sKsy)>DY6Cp=SpQ;aJX2Tc$q;t$jFZyg9|{_Ech=rpNpvUuizGf1LmK z*!BOv82sV>|LFPO$i;vA>Z^bI|Njwxw*Nm)KKuW_;d@co`RHCWoj-Y4#J7uq?X^!& z4~Y1tZLg_uawg>pnTcwQ!O@6u;(j_v$LT!Vf!!d%{RRFRT*4j{O-cQS%$4io=71@T z&|@5gMckEdo#I|uE>{a++d@Fe0^J=!Vv47OnEL|9c^e?^59ebL{(Yz%>;QoXblSyX zZ}4E^4#vPX1KNmC*ajq10AjQP8Ywt(bsY@U6j767u1*o;7-co~D2EP2+%?sMK}5mc zrWoptqua5|E+G-|yBQp&^BDcdYb2u}wp8T_EE^m=?r;dDOdrv{wH$t0o{j= z#SvfxhRZ+V*(JvGMF)Z`<-R3^U`+P|K(CT4LD7b4!;29H@#0)vDyE)wVL!MXVCe9$ zJBw*RTA*iPDTr?dG5hpW;6BVBvV;m%!fzH+r!yw1X-X4Da?gf|xo6NX^m86l#=|Lv z(Ssvxym_$+BE~iP=FcuMecPt3ggZ__Qa~yu3fCKc!6Gv{u{X`r**u*A3Kp@Yp@Y}) zl!LZUl7Xe9gAej<+kTf_&j9Tg14}>0Z{a6QrDb2huNNtxd-`|F!hqky7Gv2Kz&kv| zz;DZ{0DByPEQns?`X$Inh!sLgcp(=pR=+3=;6=6m@?yYVkx!qx&+uLMz}TDUC~gas z8)>4vg%S!G3*V5$yPC{tCD3x5##vR9^9P`m&EQ};=cJ5=%4!^Z5yyhHXgtgSbczPu zb`9gss)jLe1iD63Z?J;u!jlb2EK;{uWyUe^9g34Mc0(Q~Q(26;*MWy16l5c+Ig;q9 zEm}OA&b2khj?j<+%cZaY)l5YO)%I=rISAi)NO0A+Jo#+-1UFa)~SjSWd7=48IhDt#C zo6X=gDFb*DL})nw!~-+Q!6fXu41A`H05}*XQgnnFZHB-&I~bM|+mLXfSpQsNg*vf6 ze|!rkg{@cZUg-rVw$}S3Q(Q<<2ezC@D^#a}b-r9vr{UCj)!A>p!zy2SRd}ITC11CX zK+OK{)&Z9O+AfW8o6lon3v-o^3aUior)F&-fRGqYG1bsb)xmNYSG4AjiP zst&iKQ6aI?pPpoRQ-7(X2@SYvRiv@`72SFYFLpKDWT_T~!A>aEIAeB-lp_dZw)@!~ z-LaO1ZpywZUZjFS9AK%ii}r+AH7Nx;qegQb(fM&_|5A*UVH^!7VS0@`AcVz_EFitE z`bENv+Eulri`$K1=uO=}t4Ev^L(Nvn9!2n%y`tVsueZ${0XoUQxgX!m!q3dK*9;FS zo;vrIxY^f8G0ZZLou_txI7pEQkr#2{qPEw_oBmPj#}d0EvJDUEC3IR^l%Cx3r)MWW zw13#|lp0A8eKzNHd^7mVpEmu(_TR^7_I?pgC~3mW_i0a!H`>2g4dqZPfB zirb~HS5z!SlLoN=hB-><8=dVC=a5);*k~{x)TPnd?;;LUq|emQ=Tim7*-@!vEka9J zyRf|tdr-pvQE+fajGSc!Bcpb87lM}-W#kqTH$JK@{Iy}~@9nXrmfZ(fX(7D)OSsT+ zix1*agvtGWkQBQzEVySK@lZiP+`i$aeA@shgxfk-7;Pw1dSK^ZsbqFyH~aa zP?I7ugOE$R7~hQ##t|Y6;1geiMQJm;&EQ8m@+Nff%dx?leN@D-LU0@&{;o?$}lQx#-ZcA$Msoj2fP?eIEy*fX4E<&waRdc8aQ<(* z9Aw|=dqJ>#N>-GP7Nquw=w@S8)cjmWb+B`?7Pfj`5EkF5DWU;(r-m+?EUPBjz-a%F zQ9XUCh2)t$iR?6BbFeGSCGfq9&aUD10kBF&G^^IE(!maIjo7bnD<_$`35_15Z(i3B zbe|Fe+|d>2zm28T>PbYDKq01ydQ#Lr(W zEZ^c4&8ulygH-$BYCRYtrH9WCty*=c%LVUux+1CLCX1Dzh_6u8)jUQ3SISB7)2^%j z{rAX!-u>TV@-N8$^wo%L80b0UCM!yFXHAyu~b5_JDx5lBH!Z`{>2@N#%3%Y$1E<384=+Y4Y{E3sqx}FgngG$ z(@;h*h@-mTNJwil*q859v2()vI8=tvZ7a7h8b_23D+)pkkWl6OU~^lmqb7jt9`p4a z-Q~$ODdiN+W@zFwrAdoq;zWZUzJi0wH|k1`8dEa;h_AgXNv5-VRyG|O9mNZ*l9j^$ z3IAtniT2|m5sRdjH-S&#Kwuwj*-&YkA}Mi)D1%q{Djr0X_E^29z6A5=TIegzY7!I~ zJ=xVAGzjZu63olNG#R^{1dL3=#iUwNxpLvRC4^t##6XFQTD+*CVRDEeG~nok9w8t{ z(my+tdx<{PU($$Cf7Doh_gxsXY%9galBN;>0=NK<;B=l_OwcOzm-xLc+e*V@Zn&g6 z@+KTtp(fV0mCq_ZV93rOJsmJG>;Hl}SwQ%E5nT@sTFuajTc9kzom%9K*6rE0C#>{ zAdPw*``FM`rfY@LU$39Q@wL!4I#&|!jq@3I+aqJ$I5AG@;KH-uD7j&~`g^gXoIyEdAEsfcWY8-}#AHj(1^z04`9Rjl#Bq%~xdgi) z1MmNHCtUCRmqx>Ja=tlu)Hc?i|GxV2o3Fq2&wpRP_;>!NKjhCo|EbC6GvL83$R5cc zfLE}HZs{{7vq2NuYDXl}4Own)&uUGge!R8nse@pY!z}Ymp39{R4 z5l_T~GZL|WI35kAwE_rO?Z;#~Os_Nc7{Hr`C4(cA0J@fAkgi#jG~6FJexaTAE9c-k zo5Qyo$sc7Wo5GyLUj8Y>qW2EPIm$`pq@*Hn)|+T~Lv_n;F?pwLgU}=A&EftDWebWp z0TNzWU0`aufc+5YaxPi$J;wPm84tyF5+MN06hzs+amGP8b5nV`ezCy=M7c zsZ_3){lp059uH^U)7G&{W`t67G|;JuB;Y^>CpJDwX3KLS5faU{@nsfA^8wj>;w)k| z879I_)lTR4X$P;VbW1KuLTh*~O5`Pbo*%SN;J0z7_aStOAavG1kPJDfh9`=K*|TEx z!PuIzP?I>9Vd=R08fHq(Ij6bGV%&rAR`kK(y05X5<-Q@v4>4bU@j2X2+e34KwufkC zI~|T0@q}rhRKoMnZVyq8>U-cl`9oY2*5zri7nJ+-t89mZZolfk-fwqGWgL#3=MAGX z&eMxwGN)i4`Y&|y@)Ao!5A0~n33TGWEt9Kg9J9%2g$i#}D_*h~G{6}Q==6>$q?a?y zubin2Cz3S=I)4?jDS=*c5`{dg7UVv`e@0dAo)r(2*jIfRqcvmF3iSD+&Qp1eU`i{irmQO zcGDl|291>Zx5i-|$0XNAG$ezC9$STs653E4ZaD-5+~O7R)WvmffU4G`j}QlB!Z_1N zp-07$!Juben6cZ5B+4mBg3~|fbdOs{RaE}{1K0nf2EO3X7s{4mtuSyN@$EXBgW%pD z(4rXuU*BXXx%UKAry;}KUCDHL1LwKrw0jEwq+^WeUklnN?VoDF>vI= z;Ll*c{ZsJeCY-$99-sXbG#V^WV7~5ifO!k@44{#O3YJtxh`8T>b9C11_s#A~7u+}oyebc! zrg*uSc!(MUQxTayzJ8VW3qG`F&tA|ypXx>Z(ik(WLyMUHw63SaEzN_$OTV& zorC^S_s8I$LC6(?@A)N%vI=(isnc!lcdAv4JAkGpV;n{DAs*j`1eA5dFl^jI$GMPO zu)`zw3K;-%IAoE|AU~OR(MVk=BW3MKb2S8@laT6S`J&N`K5i@{8p+4|t+UY^5}C(& z4?6I_4sqSz9-r;ro9S9dsbEQVTfZl-@;KEsH_Z8adHfuO6{Ir0d7u+0bhX2~ZtJE{ zM(=c5{nwrSH>aMAtzM&3m0Go*6BDzj}U4L#$^b$cjea@Y|EYhx-+N0pAiL_* z#`qk6AN<%oIp8#WusHCabQEH>>T`L((p9S{6nhgd4(XWm8d&cUh&uZrE|MCxS5ry- z=sFZrFyK%&NhFfE9I(iyWW0wajr5B<08ilX$_1T2_(i9Ze>X{ykF zr^QTa*Cvd3{!3%~Pwy4mdyPh{i$ge?L>Dljue&FQ`@Q~Q>-2R0O$*NRN8JYaJ?0DU*cAv0F81vt|=nJa@^gww~Ea6*ZkssgV`Zk&i)wgD-}^ zPRr5{-bWv>2cz&OY$Ocd9(E7TI<4yCZ^!~U;4RtVUHh^%Gd5kug^1uIV5rU|?C6t{ zL)dT!H@5S1%(mq!%nzF94#kRIuSa{|Hq?a{qJR7r?F&$R)&)vFo~MKT;Si6{&TQ}o zt_XQ_=Rh83e7p21#kYefz^ zho^5!<)NeJO~i&GCXPGY4ai0iEptfi3#6T46lszf$`2EGg_LP|Idn`0B#*ev0}**Zfu%Dg8Lm-hl3N@aE&#kXr6VUTf^@gK`$nEY+yt>JS_rri3dxetE z7ugpX3OmvZ!u}7flhd=;uiHOWeL#eUJrr@FLWp1m#i*5+yve{^T*;j)sU4QNkX6`P zDSDZFuLNheLFuK{=5l(UR_WA$gb2I3?!nr23(oC;Z*CXO=Nxf}P72s&DEQ|C3H(n) zF}+yvX32giIHY*Z%9bO%`%-jaV$y0_{|5)p!!esX(V)D$Tiyvc3b^hv6~f3C$a3f? zDq}Xu5xM_k(ejvsNT>gb1ZrNm@(N{awARAjK0TMhdIr7=1SeJLBVVlHrJ}lhlAFcK z?rufnUtmYWp^9_<^qi4VQvidyjT|V6I>20Yq+6=H;ozNn`P&n_sMU~}Y=rAfHjhp9 z;X6j>Gs0Ru*e)1lhWNP&q7mLAt{CLnUKZm*_25~sT@zeey{K!n=SGV3#kQWIOc#E1 zF0>RM%`CQDe^CoGmlNd7K=OpM-!J<8d!QWZip6US7&1Is3_vYDUcg}mmvp5nBHZJ| zagkgFfvoMR@tQ?e%-SC^1Gj+`;B?)xvu9ooNj$&({>8v{L%^A| z3hz*m@hqsgN3x2!bx+O_jNHfb9j3Zn_hiD0!D3P*653{!Q>J%4bVe&S7Vg5wmwQ12 z{;k&)!^JOgG`N%w;1Ld}51EYe`mlC(D;q}xlYg=p#P3h*v~ zML(xk*%mJ`WOJ;1qQLqzn#wp$Kfn)EkymVsiPp&pbkEKR25-<(5p#j5BMXJR7893M zm&{QhCv}Q;A!ZYD^GtpUd^1ma1`ME4lQWC$P_J+ELEac+nimCV7xzi>_gyeF5L@W* zoh;NfD~5#~sqO%2ZB*3tH9LBTaIR4Bb@&~IUL_b^3e1vV)Yq{ZFe|XkAni^ftE2qb zWNc<3MwIAqGUMvjjeD@g91?p}2?(RQnthFK-^J_u_Dl~5FK+b&vo)D|Ghq$t%1e1N z%QducH_t273os)DhKyHQYFqOpOrGAn{fv>SslF2BdF4^0GuuE!%QxJZR=cRiYSb$P z12eAH9%&l2_EC|=-X0XO*ev2EqpHuE_uq5`{m+ z%VGsFgcF3KgKF;BU>!@%A(T2RbfhsPTtFX6h-wU*ur49;YEPvi!e(F`MyctmHARdx z_(E>sBaAFk>`>bFfSiO|BN-BPj-&ZdI1|6}9iy{UUqs^LzSi><+)m|Bp|m{^$(rL* zBX?vaN0Q>g+pGZ=-)<~qR+*s?1YlkD%0(~Nz;F^(cXZ!-qi;CVPuz&tmy0dy6i0A& zedd713d|emn$W&jqBDJjnXaroNauc{JEIk+OFax;Llo{nDR_gOpp0WLOKlm!3uipo zY|ZT|o3@Z0yK^1&$-3^!9L?wEu}LZXsXA_({BZB0r4YJ$oiRI1@#Rjt(}H(EDI>Ch zP+x07d0w`(60n-s{xKO_8i`SkbIHo!vVcjYmmRSk$H>;hHf&-1jodL(s2n;rVJJUZ z7!|y!#8-`7{O>mX_r>n!=4PeFdIJeY%34a|Y?WQQxx@=j(k}3lj)K3(^R&Lez~obk z*d<2CvNMu>6KYq;9+9Ly3?jL?!rBtVE9|bqSs*zL)t)8Fu%UGsy^+N;bNx(}_IUNH z<;d^$0t)465h*FH)w-l0B&?iu)ioQcIu2Y5lJj(80&bCF97#QDxd&c?}yuW5@^0WZlFJ#X&-yV1z3Bj;6Y^Drq{730>I@BZJ z1_5P)Aso*Idb(2l3q==PdV>p_t8WgP%am;tZi*%2gi*2UWIX0rSE|ow56#FmoIz%b zvX9u*om|CJ(ZvQCMu`I9ue^JX=6BI%mcp+k{11MWYkXsuiR3hA+NLPPshF4QY8b4i zWW5#`Ia5}B2MDMm%-!$spVN=6(vB7Ao65RdWv2+43>eLqO%_n8^6T{1#fq9XaQl<5 z{joM-M{K0|x=ZVQZ^gCw%So#rUmb|;6KW6PL=(>nrVjowOb5G2 z+M0v8bx_T!ms8Q!f{i&VmfX0fbqyobpr7#y#gIKNAE6O` zW=ny>y&QuSE{y051S^W4iK)_pqLT5qidHZ9#I0;rL~BaOq5#>kw&Y-lAoGB0ZQ_!-JdK^Ze9kS8%fDWY_r z)b3#>Sd^Xg^O=E(8Vd#))N$JmB#e5f>11@I(fs za0S%g_y&8Av_sLJxwxfwR`wY=flxz~%?cf)5RApC&CZo)Cu6>R*n?|HTWa@1JG;PR)95$$WLwDhmw;BhxEDn5hUvtBw|m|8D@t8bP+ zs_K`#de|Ar*szWap&5ZQe=PCNBfi1nM;%L~z3tq=0v1)lO#ilO&q4`_sQ)o{EN8#^ zq}uj|G9yMd!GLVHYp!%X zW=AqBjCvcl-1!CNz(VdNu-#+5ORbK#8!=38D^t208-zClOzKM6B#l;ZI!J0}ArBsR zQ0l`=`!$561I8hEiQI1SrYIyYH$tZx7F^0_W-4>5jj$$!Bx+V9}L#k?D#8T?4#~bb1<$FdO_-{~0s4p?eHwZQ&sH z7}-bsdQk|&Om5`NYbmzr{Dj!mE}lPeI4rGYPZpbG0PJSSrtV;SyjImkF+9qF`-}?P*^2zpQ>M$fsd6NUIP`A2{pWxbuHr{ z@$@Z|g^(&LHH$T-2BltcQc_@*&-Rr5Sua^L6oW!BZD?4E=8H6lEduhfI->VP+a*QBU;5On|CqFI~igTeHJsvfyEu0e-w9=RplZ^v&XGGXDr0hJWc)B zPLH>xIHHxWSOaG2==>GJW~)@QcznX%y5_Q`O_6(GVQD&AF>QrjAD=Xf)G_Cn!}UVF zHdoG8l_P;$XG(u@x(7vv47PHT6GpQWQC*}Y>)hbVMqYny!OS*GoTiQhq7{qn z))%*V&G3quAaKgqYf}dL3(m#+vZZ`+C!pZ=(la$L?+B=!vVRivk9nk*#nmJsW9~TN z84Ke?YlTF;H_0yKo+cHsr{IXG^cVV2q-Hs*aD0EvoczMMu(upzEZ^4q9O=p$cv-DF z>+ds}H=gJ9M>ngN<^)IDEK33G=Di zvu9N^|G~@6p}<-eWX{rs30M z>=|Vunn>+P-S)ih+^!ZV!U(T-Xsilm(q?&jb?%U)vhL)jxLpyivsNd5L{lFzds1T> zaMDNz@u;ZD>?{BJw$d>sWM}ITLQb)`n>&-wU8b+E;J77gK-+pI)eH*E*juUhn%DSd zF^?2m$ywd9(Vjh76ss_vuAH&o{LM{W`xj2FZ+R)5I!{5!Qeiqin(BV@d88;d<&ykS z_Mt3ZEL^uoFYwVM8g&5RAVEpP*=D$y-j z@cD9uO@{EzyzQFa1!$&?fs?AR%D_@4s-gx_Q9*T?Q|kT8S(wDyQk*Dd@~OaSq3OH& zOSO#9;Lw#uwdtv<#&=U$(7-EzygXww@4Wfy3jty`2e2I3NMVOIzMWumb92`&uOCd9 z8fcpRxp#}lq1ci&`1x|G$|`FvTOeE4yda&_X7*^2UOr=vgHelZV!;bH+yt0F9Dyji zA4TpNK4lrdyI#k6vrxV96iIK}tAsa;yQ1?Ly3=5j_c24GP|#>x8D$P}$~>gATO~JI zuI79VD5%WWx;KWXVf*@M1>xH?g0wGVm6kn;+}6Xo1zBU|klSNK*>LY3h=ZQQ7s2cU zMG47%!I2`n{YP2s*O^H=js1<0fykbaqthp{r5`$t&><}!PC3n+Dl zv|i=k7$MVn&HT=J$A07V{N%UYmBWQT`@@y3hX*7N>tT{y&mxlUAnz>&+n3)D%NkNw z#@-NJ{=+|*)f|ns_0+6+stM_+(i0>iAd4hdvCjg^j9yj`mEa^k9UZnnm)DUCOmDZ| z(;YFKsg)Q$N?01BJ8|f`3Wa3Ea7*gm+uF5;p1fCgc)lF&@p!eck$0%WLj@UvoK3V% zzt^Z`4vGe9%Q+9z>VOg+3OyN;XANy?>$45~ZXblyB{BteqSHSfL2cYS&I>X(JRjn< zATA{!0AeoWQGr=ADVb5mk&Ie8Z4F*oqXnMph2kb2qjW&I5G&jfG%;RH$E+TX7a-_q zT3PLeV$+`IyirJXTZWBFEtAi{_;fhCzhm5s&KbonEI38zB~rG?$KcHK7cnhBG2H`w z@B14^#y{*H^!Jb3D)Ka`^p%iRB*1#uHLhwMOrE3+yM+{^bt&#l+YRU`=qkFvn=j?-bq@IF#2C^wB}Obhuci_1Z`sD8EMH!Nwgu7M%V6b6A=j?#Wd-fZ z7Vz+f^IEpTmescGxP-AwgGZ+y!->g&()R1>P!EvANvR|ov03+|am5O-tWxD#;jPL7 zSu|g;(1g8UA;D@k@t?Ui9!+f67S7|SOV4HHiATm>sH0LSQJSy{|)ql+k+RwTMP<;T|fM56`g6ICfr zxqXg}={QMKa&5ej4ViR&&Y; z3m!WNlRA)Rc3$u2L(`>bK96qMzZrW21d%cS|Md3lh)svU1u^Y8A&gG5-0pBmQ4(j+ zEYg+<{fn1gWL(0|yBdiSZ-wAAC{NlHRa|6(g1^7q4ED!k$uq}|5W$LO+)Tz0!NfPw zU_rn#^dttU9Yb-^u~NEZJg5|xIcy(cn)CgWll`AdU&4e*0I+3r*uR*k*U|DOm#5WX zyPPd`98WU-y)mQ3UM%+0l{Rt=tHL;$B%WF3^<}iM-HL&#s5Na{!O=mvDebI9Fwv?f z_>LooT4w8*C7W++Bq1PdV6@XE3txNBE%_mFRH|*`6NPh|QWp_VNsB0A#bPn`uA|;yGGTMCw@8tnOmBlPFmVv|2bkFx!z!Ew5tTJ* zLrkj}dGtz-2ZRdBR-)p86T*-I+A(~*J9h%KvB&r67E-=*h)P{LOSASTxyQ2?lcT+j zGBW1QPb_(&P*Z!>&;VA2o+?1*s6LWtXp`l5k<7-4E#V-RaZ!%OfN5$}(HP%a9rm+m z6wCU;RMcv7rEtyI_9A5Rs|Fi3Nf*<7(Vqn=4~GWC4M-SV(XY>jbcwDLzLN~aRLZxW zSNqpNm59Id6XdgGkFGxgISD<8@U2$IL#-h z&T*@aH4I8~DbhUkr!|*ltzt?_CK?ZA#;nN=H*(Wkwdw$vd>v^$SI1cu*J=q!vsB`q zWGq!`s(Ge2>4>zxyMl%uGiDMrlR_KZSKwpk$;AqtrpNP`;%u3lzU^pn1Xwm}i44_a z@LVBPO+eHzGP?D2V++09CGRkTp^Ys)j7(CPGD^uB4*na;+$dKGEPjV9PqW1Od-(LG z38%+JP~YP(-kMgqIxMWP2R&I|TH#250}fNp_8^JlIrZ##9CHy7e}gQYD3lqggmdJ? zb~AL))A=pnke6MiOA!3&>==^~2#F$SWk*Law#i=5q41WDm#|GmnaP4nT~Y3ei{Lg^ zW#t44qaUJll%-?@UeumWmsGhJWQ%kbb08SJCIkel#I-b{%b3$~z{wuP@08vHcO5mYVm)h4R(FuxsuS*KKr(9V)`d;8kEpyD*eW^+Ea1=j z=H}+ZPP5EatcdFfm{H;i5xJAK>=@JolxBqN@Tv+=t)f6+>T#}T-o(HdUK!wNjeS^GbxY=&%f1%B3652@Y_(r zwF|mx366N0rK!q$fSSn#c0<8|S$?T7AFC9~d*ReWRIYK48$uED@JvlrU9rd&l8`Mw zSexYiN#p*aUVe?QBqz0R7wy@fIQ`@~?d}Y*W1M@aYz3?LLE5AkUot@MD+*7G=)$Ps z%*+;R*HB=uWOOlV#jT;Ts~1@T4(-*$+8O8ucg~{fHOSM;W#xh?2D@UpXj;jkSy}yA z6f6S2jUk)cpjqC(S_}WL`}6L9MBn|mZLGildGXa(U%v43zkbzt@$dVeKjP26|B=b( z8=yCQzexPyo>xA}h>{R6oc^V`15z*6U*r^Cz%2Z0n!hKhoeT98Wh>YUQAJGJ_={+M z9$mzB5iK!$9Kp?YNcSfXlooCok+mpkUE|z>HoSpNSayNo7 zg|}7ToHu;iqDm1 zI+>)?w=o*TRkR9r3DV}gps2W?Swolt={P}Zxpw#Fho zk4MwLdsWy1msNSnu4Jg1xQU0ko{{nhqwixExt^J$kdr1Y#&mKboMjU-Y9d2tyo8d- zLUX|2{0dJ$>3o<~mG=I%Am{>x*GTe3>0?igWpH-}SVhO7Ol ze{I9Xw|12!8q030x0RY)zoBV6EhWL*dAzueg&m@SiUHx}It4q@_8 z%?mPgG@mDEYKVhE`>)${i9t6FcjXt-1~JEO=U_{9kJJP}Qn)JNePc6tn_kBRTB1tx z-LVRf@90Sh^a`vgwD(r>0@lJVGrCli6qh)$u&9X;q>BioXx(FPWt{ff-wfJxO+e{d zD5BsZnZSe))gWq-WHy8F7`Cb@DqMhIEKrQdb2_PWFh(_D!T{)AALrXFGS04|RXp1yi6KvXIc5DFot_y&-Vtu4y1D0o)VltqFL6b|PM-zRRx?q2LYmb4{YwSyC%OSqtLG~lAEM$GR zfH3TkBYs`ujp!hr@r`kOGaE-_>x^w(SG7=rRVv66FL>{>FkBN2$90q}%st>$k|iJl zZ0g!<<>GBWsz(^=k;>!U8fi@zDQ2&l0dClUCIAeRj}u9Z8NaH-sh=#11?EM%;F#JN zK`d76Y*!UV?0iV3LrM^I9Y-J7dd^%)&(j%nlhb%(%TCS3B??DOP!+5VgOU1#N&-k0 zgP9V9#xYQvh)?nC67|R_;z0j)0bD|->o4h_0N4rIJMSuKVO4`4;#=bO&w(AR?19Zb zt=T3H2uLl{bk3LKxQxqVhwUbM-LvM~*1@(-P!8{%U=(dQ1l%&t2?%kkP}IgE_1@}f z){{({PMK;9%qLfBBsf%geb~HBHZh)TrIU_8lE0Yp-odkO0RN+L}iO6R^2r8suBN6|XG# zvYKy@HOCSDQ591V+XAUFZBo2{n0Cp}46Kv)0$jEzio)@SqZwZVLu`Blag;HQ8=(UW}k3gSPqQo8(puFBNN5CAyX+_oZ4!Mv3ytm z?128dT-d3WN?{29)L+U31W$vln-Tn>Vnd>AP!}lXg26{q+OWXFh#3ZgEe2ZU;k2iN zIiEf5MzYlaFvRKfHV^$7bn>P_9VYMx@kfCl#>L?49{8gi80?v}Xu+G_4w6zRRfB&9 zjjDKa;rx<*8@IT>P9%h_^1Q*b$uQj<1RExY%sy`scsq~b7{{EY&z z4)*V_tn`?#_D|bQ{?bPq8>Mm%w<+QiTHfHds;NPPL0xmWxU81Q{s4s35TEKV4aQ;j zuwKcc*3!ls)?Wopb2Vyp_uZRjzm2&=wlFiJUO2#9E(U(NH?5;mse$F3&GHp*Un z`kZJ|%5(T}I;*O4p|P&?NVN$tk&1{;PZuBB9Jw5zsF z2fL7Y&26Ya^EJF2yAg9gl|OgD?uS!phG|Mn`xuZ!SSlo4bJxq3n{6Y>1RE&q3}*v% zC3cnK7B;qa67-v#=^L{thjE`r(flIgPJT`cl{lpe3_ubN%sf2jyYX8v-d)r6W>Lp+ zw|uAh^#>iK1I~KONM+zrHZ`|=oYs|Ri#h5a*y;;!^i=RZ4Y>)Bkjw{*8v`0&An|Rk zhW%SWaDEGxyWX^rVHz)S6I>-8);$tZ_NItd0_`(EIY`mBc<7Xe)wiOwjz1v99Yo`h zggL4uHdmnv;E;k-U@feGR#w#@b2&x2KtJTmbPi)wFvQ_(G!l&nYqZ#R&2DEEps5Qe zH>Ls@zXdjrkcl7@R{_c1|AM9XX2zV;K8w)zKzLtnk$PPuxo8nBmKkn9YU!HY=T*Xl zuNO5Jwnc(w`?S~Z?!PUCjqkqOs^SKk&XWt&i3+ZuTX@n=uSqft{JO9`W7P&#WeGRK z2pLoMTy8oeaB99jX`OPr+fHTND)I6uyQG`5ANuhP9MKkV3Ma8B2j^|K`>u6BfL^TV z1-VTT<>YGreB9jcbg1^1R9iMTbM*1{xEzEYrX0umUzygg@idCwK4QIA)aReutqynl zYpO`%67^9kS!>KiT>FTseM8kWe#=~~?D&i4I(xFumH$MQD}$uMM`s~i-(1#( zt4Gzpt$G_!wqldrz*O=~iH)s#W1G&rv~v<~MX)EW=4lTzg~Xy?%QZ|TN{ubYFOA*n z4v+VH{SN%ERdwrhTK~nA`JyV}MX+=I{+O<=@CTEUdlGp~d%e{ya&+b+et8}bCWKeSMU+&mSlv#h4{00;$lO}r(j0f2w93)jfCWQF2{?ag{;N?pTi&Z$*e`Dq+b79o71%UY#o!;?m1nYekVyH;2 zMP^*^PzzLO9RyD*tx+P^5_%XL&l!;U%lB-r;N8>Uf5LBq@4mD9T=hZS@9&=h_uT^~ zM<3F{#m>5k9O1~(Vr1|I`&tS=E9x^Z$|~y`e6B~dgSyBN4~G$PmTC?p}x1o07iX>({BM}*IJ#W}ufzoMo323Wbp-KhOw-+c9 z_#XwkinzV1R&843YO2yx-H)nX(G``z5A8B4u)Ho&_lpM`OMT6%R_Y;{faJt*$AV1E z%KQ851}XM-o=A?)2gbWh3{q(qSFVw}nr0B0%bR4JVE#S|2!!{b3a|_D zw~M^2MK1$wTcDlXhH!)t^DqkzzhM|$)09_6(`XhPPcwRV&UV}8W>Nh01z4Od64*85 zyo^jnUMM9tYShGBMIi&0E;1z>5blAjBvR1_thG{sqdi(qTR~UR*ID7mKGef+85Tx%?{xiV_b1#fxeOC?mOa2@_RPA|5h zr7G6A07}C<$7CT)QsMbum`@Sey8V&AJ4m8Od`w~D?`C4DGJx0G*rC^x8Nk>CNs zYeE;ss%uQIqQ16tYv*n=Lwz$@Ets-=^YF56U&nfN#8S)Qe#VyWd~T_Nbc>%!P?d9!CD<6bc48aoPxW!1G7 zl64~`#`KHp9h4Nd^kSVuI!;zw{3KNAE=xAO}}A6NxVBa@Mlauu1QF z9D-=F_yrHDM`wq<{WquYRYxT17%!;vD3dEYzj;g%5W%VFm($)!bHDkv1>G>e58o?Q z-r&*|Zvc51yiB9}$7nv)7{7*xkp!5JMDgvYnUsLq$Io|3sRWIK-Z@gTQA1T`bjyXa zQ!xT|ZW2+dwhe)8xkzcb%p0we+Rf|5rh~*6jzP|vaGFBYc$nRbHR@VH&I_C!*~aOj zK%?%ul8pOruzjO7S1rq3FT5iCrEH}xnz?OrS0-vf7T~zakd#8|+VNS?sOG9_)`&(R zk&>s+W+29LW*Az09?NhRrAo2k-y5JN2Wxn%yI6_gZ_8Zsu~Y5PFUfNqsd>`YoG+;_Q#(t9T42Uz$TXNmtdvP?r(Vk+-O-Qxs@a`bwQ& z&?~ypc9vVnI49kERUOZk(B~K1ffyC|lstu#6&jJdCJJysuLj0Yfi?2L&Sz??M>?7f zDCVTv)v*X71IIv?Eb8LZc~NiygWo4nhJIbU)+O>AGKlEZU&5-Wn&Wr8sKayBJ3(zIMf$DaGpSE z5zib|y2QosJ>Py?3%=g`YIA$@MKIg^itbL!xZ%q!i!$DYbKe!lJQR{Op(IG}KyJXu z;*={g=?de&Ey)t~m(9)1_iVD5@Tr+$i>zUe_PQ}K1=2>3rcv^2M%z)$k-d;8FHi;V z9ONYL_hTl~6*|x|#ECJ{Wse55d>Kb#&aceVWFlw-Grf_%Ll@A#4KTe~#_8j?Z<=TN zZb~x^eemF(UB)Ipw%Su=UtDAsXE~#-$hz=qas=35Fy8gI<4fz!F-EZnW`#UzajAR? z$pXgi19MhjPeT22(Qjzv8=#Q}&`9G;CX#(^c#XCu&Xl632PJjA6{1_9$BnVXj?pWF z{bW$P2{Ow$ieeU>T%l(YQftKM)vE&yGL~V=rWv7&^^F=(yD0G{(O{lZW6}fYqMi|o z(unpZ@gNzYpSn_jXbs#T-Ckq>40WX?qrRP{v@@VVNLsDGTr5naaFAZwM{jDu(=gPX z#3Grk*aNUjf@*1m8IXeW!`W%;`**X|w_fc5|{?&u!{3(bMK^q|b{fO34&?R9fdW`18T@9NCklh*!0o)G-* zz)~YRUQG$dKkVo64%MoL{S%qHRE`Sr)S+`l_sT$1JmW~rT`Ve+C=l1BZ8*oO?FiT| zouO>N?$rsr+lB#!SI%IrcrY(>%R>f(-!BH%{lU_)t|WbMPJ`=S*chEL?vun2Sl@45QY7Sd9|z0?_XM-%GTtPqAV=rBA=o#um%u| zo@+qS{_X&fnAfd7`X4Te=S$_OTVlMaC;A%oU+v<%_RsbIK8!xZc#H73ZQK$6_v>%A z8~@Sxa_gHfw_ben&Gr`ge{X&HZ~yN<;_vf7%{i-GRA5?Q*iSwur|-?p=fiaH90`6B zZ(c4Yd@+Hh_P~WAokMv5n8bS?W$LBv*RoAm3%D~i-|ip1X$8Hvt>CoP>j6(c4PLc6 z-5-NqH#j|O_ky3hXD31H=!f=6_vo;7)LRv35&{04F6S6dZ-K@co7C0g&VKKddN)hO zdz(+pn@{l5UT^`wvnNlQP53z&1odn&+`E`Azy0<}^L1zc&FNlH?`{Y6AMrp`|B>zG z>Iarp#aI0o!T$?Se?H~%Rd_i3S$;q190(99Ax~UHJv_mf`_RgGB84z(0GGgDPoC_b z>;*uN^TG1T$^H?%+`|jBadQ6T*$rOEU0l<>%}tP{cuSPgPTt?& zD*<*f96|I1BUAUg@FJQen`tn{5z@bSjKd!sYdR$t1N`rDGQ)pScY*(2(0|AA4gP}> zrZE)~OFj5&hVU}{IipCb_={sM&<{Mu;V(La(+>i$oT_H7=otebq)12H)8!3xAK##z1t5m7+6j4~u) z>Jig2k`xO{{T}oYSP5lPrk_w7pPKSzzz_UwfFJie9R|&f5NNC|KcH-t%JlZ+%f2eo z(?xn*WZx7)y6i=BOe7$8Cb-3KJ^_g^T8~$p0H}Gg3Sm}wnxs;PcGx}%pl|-MPKm`ypg@` zo*Y&J)-7<66B1FkySSC(P!bzAe)zwLk%N z^$b)h`qu`WprNpFPP$k|u(dB>ioX7`eol6Ki}(VSS>heA=~hNTE#O0Tsx+{$!|VD;HLvg5%g$rfndQL*~{1mkcKy%Ml5BHnh)4Q6rn<6>M0$yer z2{z}izT6zbdgC`ee6tzf#AQ_3Aw!joMobCoX<74Blx$`o{L#Pl)_g$2~Jav;sS9c^;I2HY|A>&X)m`yRq001>ClY4=o#il4+^ z;02%^PBVayp3mBBxrB6Q64_BQ72v@v6LVEq>9{#yxS%1Wzk);8=JDI^(a+V*C;WpW zE~$MWz}+Rl?VKGS0}*zDlx{6>yAE)*^X}z}`q0!ZnIdNPsbKR7OSd~purQlE{5sSd z{(z-m*zvWfdygto6l<~MeUCa+aDXE?fTKmX7aX)YtzHX2kPN>Q(7y;=lFV?xG9r$2 zI>KLA0REv^=NbM|anOE!qQ&=1lEyDt`o3i0{!*O>F6lgQDd&JoItN^8iJsxGP=Be# z`AZV#FP~@u9(&3^*LRl7Kt(O@?-<$tURCj(zz{SmG_I>nB`$ehFD<;_;0)?q^r#ch zrJh?GX9~@XS%kw_^sr}8#|YDhn;mn|dGNUTK)0igc20eMRRBm0^NBiD?WptBL)({g zfq!r8u;k}rQ%@pvIcoTtV;2rU{{}(JTGZ+M9=&OKm{58i1>K!@2ukF3* zVDSKox~-afB8q_>>H6A+^2=hy5-UVh4nI#w8L>kTe`LD__2?f@ae8GjQG+YDt51|ZZAWR= z9*P+)H5sYsf5+y0$KLQnDKvFB*?-C2z<5}(+LWesM}K|TdU5-9pY`G*>xovf?r44M zL+L|w#5-zOf5eJkBa92SA*m=*opF~^M z0#0XSY)#E*;X_>^tW5_y1elU%#;P|GuF7 zzu#>C`~Lrr__O1`GyPNa_g71b1&j9d^EjGh_lp2;LcjwkI{-XCt`Gk%8F`KEbgTQ{ zrLf+pmP#et2LSs+5v)9Sn`lY8ueVE4> zLz9Zs61y-41Pqg^2b!#^?9K#M4IXB$g6Y0sPBMp}VmXh(v6TkqiYDH}D25J(n(*hN zLEzHof;nJJx!t2n5_eilYx+&&%Ui24dH7~#K;*&3-`PCygbl*y^w0fM=&&~v8i_kb zZbG)wQ8aLawl;#l>$E*4e^Yh0#9=Lm9DHml_LeF*X;4>x!SS4ftYSW4^V)pJD%KkQ zhrO0~?K5Z&9=x0y^K;u|Z?;QCa~`_Dpo9jr=a+*tuExI$eZCM&(vN63OvJ~N4D2;T zH91la@8Q^MgF-biaPnm#^Z1-qA+sF9Hq0y<4~p&J@6Z3e{a?u=kJ`ri{r{`R*Nw0I z{r~GPzxwz7|401U`@a@ONd#!Z@8n`BjxE|k5Dfz#C=4)MTOQDFtU#$s0Dfr)PhAY5 z3cgcD>z|$}b5G~EgJtXv^0hlionMB!op8hjJDxqqBOdAtc+8W&xSUhSAms*xmuh4@ zA8%f4*7zR2Qa`9jPS&it6X>|d=;Z^<3!T3)vj5zK*&=_h+n{2{o2`%q!7#IOCn!fN z4hL&>n|!J`r=!*HVIm=va8O0jU7=gRI@vo)1z*~K)rNiZ7Vjd-@90v&%LL4Ax^%n& zD2+=xT3kzvZkYNhJ1{R&glKZRG>!E_O$Uh;Bo4*D*b0_EuqUs&YlWKCF~I>NaFCm* z5v%a#r*SkNa9F4EfBt8gGBqX=6<AjDorJZKu#H#R=OHxs8lm{zG%|~k_&|@!bwjkC_?j3-#!*nOg{Mk{7=VB zMFN>{v@wa-g>Ihh({3HVkK%}Y`=}!a62)nOzJf@G*AZ;6GExp{Y=McO@-=#>X&~gO zHxGUUQb@0}y7uu>-!TrKd?de146G?E&F-@`!LM%BrF)HiU^D>gMTqFH8fP-~&2-2M zF>N(N8A;Xq{*UdW7u%eq)P2|gv1x^YQ}yA~LHEZ~@vbIPzev+zBHs5ZdxPqa9Td)w zH)nx!+d1f<6-UXmkS%93ibn}8z!%#i#~K$2d~>`}0B))}kYs^ic5Oe%$RLt9n^m2AEmyx6ADZ;o%U4FQfvXYdd7{3i@b_hPGxzE&@)kDHA8@pxQ;I07Ve z#13B+BVtoBx5%dI<}YT4;)SzK>)a6N*h||UnX~(QlTHw)!ky#Z<8C~Ux-S?8i1X9? z`M4$I#te``*sIvV%3N?$Re9a%?%!2uG)^PQbwj5V#?y5={}2$F&?Zaif|DELL#@%u zD_F}Tx9Ee>)N&3dw^?S(Xzb#MgDHAujyk2$FkJ$Bs9;p|Sg}huZNJ!dts2W-KkIS*t$i41#kKU9@+lBAx+l#vzwWz^smcP({{igZT zLHF!cr{%TIpRjHD{Njn^i(sQNXTpQf!jUt}EL8|8bR>*~KgxsF>;1D1^v)l4QD>#B z-+h~R_FrtjYWGfMBg%;MX|{`KOy230;&zWAm9`x4us2~in^&!qQxSc|nhzVIRAUqo z3GMu{g+#T9uA*eDg77^N<6uUci!qRF)i!A5fvWT|xxm+7R_vq)lpev#d!Umf3^+T| z^TG{G2@^Rfqi|cd#!A$KIfYjj*mCzy3xl`={)1!TVz<|vE(>p9CZVMQSuf6uVJ=+YBl=@?GtWJF)3`8qD{t7dSK$Da?Elh z<_a+?);^^3+Z>P81GfIkyXAZt8jn@xd$)}4pIzp&vctLwj*y{3jk1%bk$8L@o#oOG zif4Chj|(k`H9rk#(*}vp>?ujXXZT=?aX|-{I859MB03RM6o;u&Pb=JF{mUetqrT%7 z54ZNon8V+o8!rRZ&BANmN>+g7o_Sp02f#Ef?H_=xwYx_!JAdw;1m(?g;Jj@gbx)jq zNDi;whS1hWQY@(eRE%*zCBSNHaCC$l^i8heT~1MjMegIew(1G z`E{U3jV`cM|H|KQ0`%Q-5STZ={z@j8{9YAq<_b4g7v^E;;`Xat`7(@C6{O#$L|MxP zxv@4^57u2+UjK*Vu|Ft8G!S(mnhPtSB_rk{;!oUv^m;M9<*m`|jZXhgy4_x>OpZ+$ zc4Yj#oTnO9E+`WT;GN5JyJyb}sL9lU(G=DA{V3-70|>@1Ti$$brvJJ5{5wp3mI^UC z(@1Zr7g=i0p~xDxsG)c_RJXQT!!Kl)#ke69RdRVQo-$RNM{Cui;m}&YgCZ2nRS>NN ztxm*}u}!HOgRpDVhPY`&%SDQukc0Np7E=DTERl75jPii0Pl{NstFNPiCE`GNsa}13 z?&I-s<+Mi?(+*W`cT6lpdW#^tot&p*E14y#eSRMe4n`ZLTn4mTjVSXp>P6-;1tPT) zk#Pldpf9dtLX3)LGGF(llTcxNVx}< zhZr193DRrp)}ZFg8{*f7PRxp;Q5CH3b_hMtVU?8Bx)4GzsFG2jluB-tV%$?4k-4o2 zLhiJZRBgXPta}k-Ugc`xk=QP4gpz_hD<`dL@XvobFVS;cSFx85&P~6Mp#l+I;Sf!f zktC~nN3l1R^)-`;s;SOQ7Aw=>igzf0Rw}U~bk(7YRt`>sN-Z8ub)IUN4oseGGPF7q z=Zi@~(Isiv{v`COKRJqSwvEV9GI!geK)zm_$0kZQ_Fb=aOn<#xWXUjAUX7c&i38Y2 zh}Wv8CIOmgj$t(zlATG_M0Tx-a7^N&B($eE&1;$tLes9u`S!K4+ZF796;{&SV~Un2 z;fX&KtjeG@9zDMp4Co$O#qkVYY;IGtc%++GEfBCll`oUwFrJp}RQ3}34S`^qK-NKL z=6;q=BI5rmyk-+E0~nR#k&cQWs#IR$IL!+gwU>TfYs-?wp8ex#r8U^Xm`)5j4 zJQ0qFI0?oZlgi0ET`~5JafTOU9EN;UxMc#ztT)A4U3XK=AjXX$QG{-fZvPi+e zeh1Z(S9ySQ~hJS{JplEG?roLj#GK}FZ#c;&FIPwQpL5I0mq+!i>RJcknfB+fb$RV ztu5jUKP@Ub9gYoLx7u?ANl~#YExANq6bXe$#1=Nu3@o+p zj?IP4M(|u;=}^}*Xe=AaRlnl-zr$wN?w{>9`A$qJUpVzEn`%{*bfwZ4Q=<74$5TNF zl-fYd8*s63G+>hV$9;MW;!t=~Re2*bE^1`YpmI|YVGcoKehx07Lb#vb2JF2h25_90 zfzJT1JH6)zuR6~=@E?5(z=P?(J~`~Pj?|c7EnGl7I26DpifzCoUe6Qiv$}Ei>L2PW z1WrS`st!^-4|^MytcvQKDXeg)b#Yr`yx`WE&Ny!fx1cQCB`qeVTt|C{5ut`7&~P>i zIhYs(V+w7GPD34~XST7!wsrrY`E3c*Z1oSM!(_rCoN33Wo~jvCSAo41M}4*}LF+Y6 zVw0jvK$M9&sw19CM}Z7VrBDq&q<2+#>2W86%P^~Df3HnBKKZzx%>ajsQ5d4B34HKo zt0qT1P0!VE%8}*WSz4rO3(rlJph%2yc&neQ^ur>NsrP92OD21m3OWn6aCI{jQ6nN0 z*^uVM5IA~%L|th!2u^*f3NYVHGKE|;vH5UorA#H$8xSopR4ngs7-dK>E;%rxU~!$+ zIno?0*m=zI&4Ng$CPz1@00$mmH?23Y@+|`gvc`)Bemy>B(f~Xxe^R>$MIVvL0F{FdlVU^uPKs&qyRVXE=m78;VM(r+_H zbDqPp-v#x1mBr#4;f#`i3V)^o0HYQ(R4DW*3KN&H)>JslL@BX6;~)tc?-&J<)Q&>O zI2Ky+^+?>`5+l%EV9aW#xW<4l_CNpJb`Wz{Mu`m=ia-nBES1ZJ9}l6I2-11lQJU`otX)^Ru^BpMryRVcD7p!lpzhE6m9R(J@*tDfBWlQ{V zqE-P^^?VPR2M^)EU!E&DCTGm5L9G>ka@DNuKx$2*n`E+_sN72Fs=iyhkg5r+^IkRg zfAXhcRimn$7Kmg3p2Rjar+Zsydqh#lLow2Qxo8T@!*YI|k6Q~PsRJ?)D6IHNrnGZHu9#pHwexhk2Be~d#ObC)ywSO7)w0QSeji>% zrf5!ep{BA_(reD@-~;z#Z6Pd7Q(FepPAm!AiYBjAf{(?ss#%@$*({J!Nqhj@?|K=? z_x4c^fEl`SBe1uCqOp+4vb9~V91VV5JDl;F@n9=!2gC)|k4OW#$B_JC>9L8$WKN+M zbQE}$V}Vd_Sb>CINXig>!0DuHrK+k_wXJ5U1xd06EMhqttw(EcH*VJ=_ipUo3%x#m zR~a1#w)tsd8H3?U){#kVuPL1^v=|3sFufK7?XSOFgMvPMUW)-PuoeORGXk7CW(?n{I?}$ zLypKCb z6wE{Q!@TnBg^DVLA@0=GF#9|1{rWS0t3L6(-9)gyDNq$%#y8P=brD&Pk{3^fh4Bh6 zBDxGV$N$ZstL*;Sv;^1+U6I6yvWnM*3I$zeod8|clLHAL8(8=i-twbvA-yIDiPCsP z&K>X_cy`<4!$hgzgi(YmNv7zl{hS<&C~&hECfj{0qi(eE6;6si){$$C?Lp^wE-y# zziW0u5cx@;muVN)8EIh+-z)(6gT)Oj6iMm}^R^^9cCOYpgP^@2*H<)ZiUQf*k<|jo zUBms91J-OY?~@mnbLU<&w89MAgulp~dHO8b@>TdAcMrqT5g#ENyVP1DG0aNrNk} zCoXiB@1OP#n%W_uZ)sWmPpHdneEaRUTaAtzmIQjop-K!1f)se%J0UTh{pzn`3O|Ih z1KByzd|(EbnYdFJahlt>u)S? z(s(}Ly~|lj42&-JQTdmSM#g(WR|-b+bV9N=_|WCph=P&DktJ&)p*8My~N8d zkdw1-#7eJm)qd657^5r$0iQNTdvQjyg!&PVYjL&2g~HfS{{LFKKU8*GXepv2VG$Qc zzON*tj2#F=-Z8V9{vZ-D1q~tW(lJC*cabL#K*@bz<1d5-n+*Eprs8T^{k_61wNYw0 z?d=0KaTqrC1xBN9ksl?b;ow7|w-ei;M*)gqF*!~W7&Hw4d530%Vy0hhox3Z26tdq5+_tZuwKZ!;0q^sROrO zwUQ|VUluQiX*~gA8z_IRPzkuBL~@-^qMMN8PFA14*fzUp$BH`O-h?Qel}Zf`WtexH zateLLMRIaGh<7LZr^owEH*SkUKb+m8>tGU3&{qruDJvgruW8N5UN}eeHzr==5Kmy?%`%KlEMB zP7*Ve`b|QhII&AKa{Zm+uI2n*Y=CGKg7RzF_&V4KEbMJm&9imXb5TkJwBKpJInuN- zO5*X5nNp3J2X&Bq@Rw5(TR8>^%eXuNaL~V)(q*oi1+gMt;I$b^sCdqvYL$jZ!`y|y z^fQ?5s(bw9u7pa>c5R!YAla2$kw>jW-59|-G2clh4; z65jqh{_7v{XUBgv>24?hY?mK(=&-9~zQD*{;@FHu?v4Vh70zDW=+d3;{z3a;#b2*4?v;M`u+l%>QM~DPWxsQJ$6)OmRQ&W^`}jeP^iIwm z&<0dEYIp8k{!OcQcKpNs>Iz$4h10t#6tvLWe|2{MF>{5^{l^Ry?jRwz@auM~bMTM> zukU|xg*E*zsIa>K1%=o5-yiT%>&J(o^R(5uYl)e{`v-R|U$^jG%hBq_*{k~(K0NC@ zpm6sA-8k<4c>lr&?H}%6xc#8gulA1~(Cb&-lLr+3=^>?0-=5rm#!ugN9z-4wp^k?T z$3tl2A*AsT%6JfAJcuqHLKY9AiigbeLkP$z+gQWx4i8_oj~-UK{h-qC?%V6Lqr>~7 z4l^*{n?FCGESjR;w`{X})ZAYU+Q&w-(_JIV_@#TVnrq8uf7V6+e7IukY~;bV{_EaF zJ1d4(RCL9-3OlfZ5f+wR!P*LY`+%~o`M83Qh9wSOOVKW$b+k%#{s{E>gv&g;T42(Vv1I>>(Y1p zaQ6Cj`==+EK9B4ftW`Z+nN$O^ZPPJ* zfEv&Vp#qZ-(Uo0=ucWjQAl-6E<8(`u#S5OX0I$W+(Mr+_h8tv870;`5UsmNzfSedm zgAcNZ5^P4BS=5*E(0}=5K8?oFMTVIpIUVN(#hHSp!>9ax5@jE%yEGOtufjJJXjpnj zYG2)MNd1J$H9}~0_sMThR1A6j_dFMJ&kWZ3<2UNs=Z;j3&%MZeZ!u6bW-~e0J=M3R z>h>IOn5-q6n}RWw^3qD;(*fPJZbWlNJ{u)RbH>whO81P>{9==lLsqL8YbX7H@m)Ac zDGC*WSW4;{;AdUF(sk;M8>{RmRH_0(w}wXDZx_w1-g z1h2?0OlrYt`%VAgHIOXMNrG`b`05wllP6^~o5dId3_3YUF!G*?dYzwT;VLzzpc?fR zE&X`%?9q`8dw-ds(O76Ro%3kO_OCo*gpSUZL$7?1RaD9+adG~23eB0WVS8lCu^I^GAss;XlE3TRD**y7 zfK&(o-j@kIJHZ!O@QXxSdmsG5wh_TE(6#LSdjN+e_q7SSO7jxU;~n`J1a-1OT0mzx zp1Jn&sNn00DVHd=5|d{L(I?X36~(E9wKBrj420`bZ!8F7EQk>1=$$l=by(TT1YK>& zl!nQK-`F)T_NeYXYF=3Nt~B37>p$h!ZW)A_qAgVvh#w<<#M7$;mNnTu=;)oM_>ZbM z8S|;oj)4uat{cZ?tqgzFESPe^+Hz#)Wu|7BNDG*;*CKMm0gvaDc>!afkj3!?mLt$g zjRN$DQ2|z*M-wtqMd@nmds z6`RW^9P;kztow_Udx;xqy+P;>%&dlrrWBqP z8=IvwtkKXLG{%S1s3Ug&+mk?I2}u|2Svr)GO7J3q08Q_fQx0x@xtxB;JRBJGxOm_Z z-aWpCX8-h^C0eLVLqIP{YZBRCN2c(59ue2&SclL_j1Wj*K?LdRhRS3C&*ETA6VKs* ztbl?FnnEVJa|r&GUwH4dchWw3!~P#cWiS)Nae*21OX` zab&Pm4jnuYCBw!-0Vt~FJ5z%bdT>NYHjH&b`)^8aTfjaMpTkPRj~yZ`Lr5e-41>r7 z8`s5o4DL|niPouI&JY@!kj+P8ZAIRCGn~7MO3lWC*bK!tG)OlXQ}UW}&1lv|HWU&h zpXmac^%w3C4Z_An3wH_|v-|??YUDPxTKMTa%3_(Qi+HiXbytO50xL5PEEC6Jd}Bl{ zoYsN*7&4;Oxrl3G2|Zr5vUL4qO4ikwS{}NftDx5}IXPNM&JjN-WpHJ4V(bV(lJISu z-)JV(A&*Z-TFhiwvZjPuX%@wQe*&Z?b337AL^bx9QHy9*y)SIU5or04QQQi}pClgV z;lpEmsuEco>n+2fT$>l>}DrxVv%CrIZ7BHVr`~}#Lfwm2?hMdlWB+$t}0d97)@$uvJ*uc>r@Un z$drgew`y#(&DrO$vWTkh^{P~vrC5SRPQt@eL4a6Gr4)`??L4evdd?ev@p!PiJ7HlwBrK-A#nhoVpYV}-p7X%P+ z4PZJ7#xu>Y#jhR&BpX(Ka#fVj11#4XK|nDvKRmtmLy zOLO=|z!mg>0&DoQZ^<}Jmj5t7rPEb{PCWh&|!PEz5-h1)E7#zYED)jrs_agxOfz(q8(Sn zM}`b-LEi_L^H5c(1(m&uks?(wB}vLMif?A)WRN%uiOfL-sDj2zh|@aA;fq3ba3l&j z!P0vIK{`TS4OR~;ziw3+kX-?UC=;v8YW>->e4}`8fkMz|A-NA=j7EeP!NXcIg8#DK zWZZSBre)XOoy}5c7-5eDqe^Z%x$VNWrI)(1i1maTJgguUXD42<2<6<2vXLACc@x*p z@3>9iiICVcZ=bX|HgMKHhi8u*5j`Xw6&zX=pH?K5$2Ku2b(&+dNR0+t3CbOjV{XK~ z<0+bAs83Xc^YY{v+H%%2f!k@2#43O(zW{)X6kVC7x7OykP+LUVW!ep5+I#59fh^l* z$QOzs!zdF?F-DfEC$1zV8T3}mPtzO|W1*|BTL3&tIMrNj;=Dl!!Q$|lLJ&& z^c8k&xxQf56fY=Pl~WF(cX-z6owRy-zr1UuP@qm zd4!U8vCzx%ZB39t@+IH#NXnu#i#gLnjA2JaeuQ0%i%wa?LmmJjhHq4wIC_(yk_{84 z4<(B^1~B1ZDykPCSXV~LJX=(BXl8c&fmgWL>rDTq0_p5T)8vV<0mY9*WLpzOksWao zsb5upHyxzoaXeTs2g`|{8`KZ8w5XWemJxIF8HI>#xJYO@Gv;$RaeQz``{Tc+g9SZFte)8YPZ(AR zj1D71VZ^xl6-q4d^7VeF(|dc;J$v)k$Nbg59`jdgF(0oOuZX{EhBg)gJx?iB0Iyqi zG@cp;wtD65sqz0qN#?NKWB#8h>E0Ct4-<)!kr!})m}00S-T=H(rYR-=;{~F{t@fB( zIr`FKEKgHzM-K_}9o{z8gZz5}MC z*?*>ZQK^hstlQxgJB3<@`mSTei3dZXOq0c3mtk@SDesjF%)$Ia5CPo7cwh1KDx|8< ztcx@LtZ&Y!y9MykwoF9074S5NjmDHikW`0;z5G_#o*;xLNSRjXa%xfir;v`;PpM-S z7JAljZ8CHrLswW#R8=->d!$G(C$P@zEnv)bx|$C?iQ1 zccoJKWl%2ou#I2n(<;kEifMd&=7CjjOQo+G+kUJxj!+1P;C_+1qxRCfDWsrB#ZFJmQHZ7Dpa){5m`6k+p}IvHgB?1UEOG3TJ0nGPt%Y-J9#8bWAKaO zf7^+VH~grQ4)g|ZTYS60N)4K&g(TrD4Eww)NieH~q9NTUspuq}&yH<%A_~PnTc|ud zQ;I^1nTN233c8i2oJ~z}aK0~sUd9h)iE7KxDEvwJGQnH0+p>l*n#Y9@@V)8?0Xe^Q z##2mt>gyeJchcHFK-0WJ(o-;=>!uts(Vt}~K8@l$t1@AyYDJEnk9Gh0$OiYwKG}_% zXlmBZImoE09fs%CJ^guBt?Dh`r6-vY0KkYa5TfC*FP#qQn_E-O1U79~!}rj3F@>)g zImXpt7;A^9(-gh7ffXSy7ck*54k+XOoMZWit>F`6iXnGOeC^MszL{CV z6934yXbn0TOxY}9zLElgdzy^NR!irt)VYz_9L3Sl*RaJ8aXgdjBFbndC@w_R0z zI!`W=sY)iN8j<16ScUu>?JblMJn>8rIUWqKD@yFPkdqzjT`d}KbzdLupS%N6 zy)<$P0)>su1QL^y)#vhz14UDrM)fY^KsNax)2iF)BD#@|%4U-{4HTn4-!zbK-E<=R z=$uSLB=J03aTg5MKcHHL9(?`WIypK0`KX71gIPA`ICQ~yl3ncPXu!6T^N8T-*x36K z>0{ZKdkX2+g8sfK|iH%-ANC{1E0< z%b2Xt-cxUBSc-4U@p|!G_huZtuQs=9fsm6XOV0{YaP~!pR`}MLReVA4jvVdSxLC!o zWCx(Ns$inV`u@|}euHz{Fr;ChID2qBUZgsjCymm%l1BR}srVg!eYp#WN~Z#>X5w33 z8rx%mHe_=}R5fZo&h!shm`#?a8ZH)<^ZtH|byE-&tL0CCS zyD&@6qRC&b8k-b>sV!6Fxr(|Z61~cI-o38h86`p8&>EAh2Y6ODSz0qc1uTgqa1)=^`0R zQZ(AVw6hdnO1h@pSU1ma8NH-x-Q87s`*}QzDWoLAzhK9y{64BxrowFFX@0|VXwh1m zwBg0d*c2u0YqFtc6Gb(DcTg3R6zzV7jI^37S=e;&nc3v6TXnoZ_)Kj?WHwfHx6XT0 zgvIn_^2Fc<-P&-?i=8GuEttz-BuYDvgG0N&xm+zlxBX( zRK`4#q^?t;BC8r-)?l?4QtPiNN5G#by7wqjj^QM?@u+Z$&^3j4UX}0K@oqz<1xCLX zHn=^%r3-lWicyTE?772K33i5=0pw7l>2Fg`K3(g1N(%W^xYAVYGdVeCiEPXwW;a=8a}AfWvgv z)}YhvvH*e^uLQ${Y3@3mf6&}c!_iDZTe6UXI8*k=l(Ka^bdA+=pUu*5*ry4{ zR$t6xEy7VOufPqdND2^p8o|H9d-z3m4|f&!uRuys-YaIp5BMm7D*GMToZ{j5mQNoc zF2|}qgv2=Chm=4i02E9yf9 zsgiI>Hd{HDPRldI(Vrpk>r1j$HatObCB+iZx9K060E!Je3oX;O@|J0p1(aSUkmID_Lw;b782_pT^Ae*5$r99yq;h!LO9(;;QRS`kVk2p#`+ z3=us~@m7U$&J5$~rrIL;4&8Pp<-5d;w^gX0I~Y^Q=@m3cegVe1v~LpG>lJTZtYb-e zl+t)?A4cp(w{2v1GB(&XZ6HNhW@sVb(m%C~`wce}4;sCNumui#*rToOKKlZ$PHlp0eJ!4Rz*sz$|X|8K|vxm0li*#1GtWfvZTLxxbfNXjy zwk<`;x(83$9EUevozC;B;x(^ORNc*2ZmFK@>aEK6{yF(PO<|c#?G08%kN`%^7wu@j zgb9(f|MVsriDr&q2+NOR(5ubor1hqK+B^BVeRRV8Pqt#JXA}`Jv4~%kW!kNoz{Nmy^G)+j>&OXE@urE3PTYDqC6{5D zBx1QZwoHJJi!Xx4%K~oPU=@`Guj!oosCmkQO;*#5n~V|C{cD}>}+m~ zV(Tnn*T*?}WJ*ZU%ax>BQXN?4{A@(T-aX1oR>3DWqinbn%cCltD!YCBbBw)JmxE{8 z`N+7U(O( z@`kN$5FHq)325&zZfA;(SkDebuG0F;WC485%6w|3Xx z*V=u_$&Z0FvV~{LWlr)JmkWCnCd`sM?Dll%RVsG1-R7WyhN#F-2Ky{?N@ozIbg^hb zYXDK-BE_Uify71%fpMBCfm10Tr6S!&`10WQjP%p9X0vsA8tiy;@Y}z`5fKF&Pm#pmO27T(LhqivOB0znqY{1#1aO@41{i?WQ|n*D?Q z-hQe4>rLa^UvIvB@$3B8Dg2Hw9FJSBebg&$-F)@+H-B>9ADtbR22r-abj~5r>E>5e zb>?eL$&z^z{WYD}CkaTaB2YV>QGoRh~K<`j(vmv+jfLlC5UVOA}L8Ejnj zin?$Rt1YNqA0`**r^?x~^J7#o149O-q6K0`+r#}ocTcJtjjx{-d}|-Ux2lJT*WHuD zeZU2pj!;N6@$yecqhyfq;Q%{@_@!D#!KJWSC?#WYgviTH%`~GNw1|$5g=F!1#9o z%QM)(x6sdDZr<n2&^w+1IKK=^uRc&+Qd5wSm`W$}a&silfNxU#Cq&DJy%2hE#RZTrm z0xIX}we$4Oefr5QiV2;}8=c?DDTMi(oEJy!j(%48m-LJOAA9fG-L{de3%_6OUx9E| zOj4#~Nlr3zEX!H4EZf?VC2vViGUIr2K_n<4A^{Eo>XMA-x4&Jt?&=0WNscEo`t6UR2#eql2j18kvD`jW%z@z1t3zT8+=mDQ|L)`O|M|aw{{v_% z07U;C<9|N>X6+jt|8o`P|8M@l|NmY7H2-HOpZLG$aRHd}*scd&QaW?_yUT zWcln1PumbFkX@QLu)&0=@t{)iSDsz3>-D%%l`;h*Y7(C(5$JgWn4WkhUPDDtL*T4W zD;GvHu~VlPlXKb*ErHUm7&P3FFzae#l1fGXauS+$^mc1|XZ!Wm;nBTT^wa34?5EjJ zy5|RL?Pw--?RT4dYX{sRd-(>~ia%LK(CreIkh>PeU8uAy@3^tT& znOxnSr&Dy128|uYF)!Tp*-{~}28Q+&0Hi@Bn`!unx#{{A@Be}eRL=U)WQB}!Ih_{q z7!;(PxilQzdX|c=h1)|Nrllu5z!aow4W>0m9abOa{I3=#nVKcu!(p*%hx#p-Io z7~OhC%UPVF`JA3ovvOdx)MDy(I%Y;;kUFb#fFbUh5y?CQ$qHHl(w{PCa#BZw_|7{m zGD9qKvs>t9(O!F7%MPcNuUwc5h_=Ge-hcPz`OcxWh-8S3m^7c$JwJZv5~EWy9#`SCY+k>0}Re2&)UGw?HNDT7B#_hA>K$sN)92N|w} z0^INdS3BP%AZv2DTeJWce#G9PIc^Ml){a=1t`W%uX#=r74a~_nxk$zyf+d*isM*x# zvbTxvFC-2$$GE+)hG))C5o@`GWsL_se1@J0H%d4*Dr`t-9)~vG+UD8!W>^p572z`j zc~&8MafA$K2H^v05TWhKUfH2?f-+}k^RtnEfUBI*{N49fhpc~Bx8{`hq*!aiN0AV0 z>Xz@>#)kL=+Qi;yDs_a#c+o~8^cGfi*Nsha!`MJVYk)qQm3Vf7rxfa%L zG0!-y{!A17fJQZ3>b7V_g0mF|2GQMA6pXvcz`Sd>>>*f9EgbY4)^z<0)U6AutYJme zw5<47w9J3~xTe96b%Tq>28T}HXhc`z^qr4~XgY5>RDJ;qV0lf+s+HqU_<1yflc*!7 zgC-wg$2aII$j*3oe;au1R+NQ$g6kz_WRNC zj?H?sbNqJe-O-MEhR=90=d$k}9lqP&N4lj9+3i~UDEfdLTwA!UZu60yw473QI5A}x zeIYDfp$$3(46SOqLn(x6&PDNrruDg#fIyGoeN#m|x5@M>JGXBwM`I-=TtfT!*gZE~ za!0>7d9=2={#ADY8im&j7*xL#uuc~9r>kDaa1-cm_ppfCUcuf8`=t&@{rRSL^ZIyF z^MMzN->p0K$uMjei2ogQtiD&0y3#dOMJ3G*{j)3E??q*>|HZ>>_LJWLwB9ph>#WLfUjVcg#imH~!Fy+h-fY~Hr*k_EH@3-Ww*m;Pd# zd(x7gE#L38h06Ur>qRwo@p`e+(_+SeE4L)4xyo`gGY ziv1ylOYFDuHq0zyAAdT-=<}@FwH#ZuM_<8duxj;*+(?qGq0ip2%+ zX3nq4#X79`4tl;WcK!t$7m$d!8_Z+nv)&^8is*;I96CsrsjUSLYjSC!;L1MMPi>_F zyN23DG9DrFPc@t)YI)4oJ?Bw+j4pz9_LaBGV}Suc8{@E~kKt7MK`L~dZn)=ar&vWh zgb~BH@%*Y`&aJ96U92ayp8-Q_+IfiAz-!+AS9wy;IfqqGDGx{*ESGPiH6x#_>pn_n zY!_E7%y--NsNLghRuZuRTN&?JI}jqy`-1nWAg@3`I#R`~bnC81)4Ohu+U0CpCVQ>)r1j+5vA52zO}Gf3@_VR^tkxFLz?4uw0yLMdq8>g=U};JXd=3Dy zusMW>sTf>>u6t2Zq2Opbo)>j_DyJ513kgbe6UdjuITFszy9=>^k{N#pMtg8&X zFo7?`8K(IALKVLWdUpjSa(pM$`6wDD`^UK> z;=27D$l#Fm6&!MA#1Xzohn)RH!wE!8JKMAVvI z%gUs_CkRvGz+CCpErpc_Z&>~}<XOc}j_#DRXh7>40w_z0 zQc>f=7XT{f7%(~2BTqrPcp(5ao+EE_vH(~P?x_|Va7ENzF=VNjf>`n#+`}+w2~d9= zQFd1>JnFV*cErNvSr(fC-Q`A*UZl;R^bc2DUZ{WJ=*|HOR@}t$4h9u&j zNtT;y)?(oO5A{PCJ~^V3yLnh{bEJMcfD(ZwsXaij6-|Qoa4itJhwGY94&lCFL6^IQ!$slZdhi)Lk? z5D2&dK4=d4g2>)fdJ48Zdb4eICh~N;lVJEdk>>TET zbqOUPudE`8vf&|WbjU27YsEDOqCuHUCz6X~c1?g$sRp;6nD$c%XmHgQommGhv+P?4 znSB)x$}xqNa7OE9*GvimzeF@u1R|>fS*zyVT0cwi!xTxfl$B3OOGp(k4Zr&rS$3I+*?kYR5^JCYFh-WaS`kH6KPUR3%BRIfGj zv+8LRUgVzfmV*qY$&^60E72B(j>Xd?hf!?ze6bX@>1ROdpBib_Wbff=*aKLK_W(|| zva<5w*@oG>J#x?yIx&S~2KU}N8i9CQ7~Fl(V%+3d=K<%fc}bC(BusJ*uBlxCSGQaO zjYmV3>s_yKy$S%52CrTXd(%2vth23_NwdN7k8DMXZVn)uC&@U!wAtE4$Z#~QysT!m zt>gdhw%XPk*e*Fi?`p~y%7>N_t-bXleikzxCZ}is-G`xIyB(A5S7vfrJ^_f^Ono#@?voiA^~pTBPlflX zu%Czrluz_zKUK%RsE)n3Ku8jKwx3xI)ALugd^WVgeloxL^_4fES8hb%bbvDfl%$EA zB4oL>zx8H^ZM~=vfj?^LwULS%nP-+tY0~v8UkM5-zp>s)5)odp7p=E_j&<5)MXPc|0T` z>Yx>96lzps1#V!gWaZ!O_58=5{EdD8f4Xb^tls}O`Tzg<>pwqUSN{L&;Q#;CH*0_R z|NkC;+W(&?pS=I~=6v&BAQJ9b_l^hvm^bkM-#$3pX#@bEmh3`!6*S2eziDYid>$K? zYZhM{B1ou!@B<;i&o~hQrXN!V46g!rIqbTQ==cz^WE#)P;t2)HHpSsH%GEKI1n7NtP6jQ}Cph#qD zu<>z;As@jdp2izqXL-pXQD7pl80!+>Nmr5;>`7aKNwwWqLVh=ya7w^B1O*#_CWr8x z7)+L&?8oC2RrRV`t}nmL{5ok!lFTgH1k6n?r4+n!8JXDu*lhq^Fuht^UH!5bO_Lcq zj6t4R0;LtvX`Yj}zJi{Z#O0X}Mj>#PH-S+Mlau*rfJHIPgBPcR;Kd}F+y*HVEmJD* z2qnXNNqgUacQMgB^UcG>p&&s~5iLdF_1rfJ{GgDw7H-cZzDg(aNzLY>{kL1%lt#ibDWMSAKI{KuyC>lz zz4B;%Pm&m53@}s!KzSBDD8u$LYSX1$yV5&o=RGs`Z~C|@_B(6y=;>42@m_TNJqAWq zeS3YovBri|TH6j(B{U8-Ccf9P{S628^-Y87h~zEC^mX%?+D4CNkL_z3 z+kLpqvOWAk_PmW?hy5X2qm(vx58nY%IRVG>X?{t%$#vAQ!tGMQ#HT=N*#6RQ7UVXW z);nb{>)yN9InBV{+4OTf$%mZ|U`;@8=xrBnt+{ca=_MULNI3->C8S8?ky48>hbd(~ z&e6olHmw)M1tX7KBl;j}kkATXok?3!X(TiU+vu7I&5OQ-m@uw|MvVB!8nx5QZYYV# zV*YD7srn2-US{3pXT&z>45G3rA@;P+F%65JVn~viOG!d0<WkuDrpU}${eqX`fvsvt-tG}_9knNU^g9oe06vCk0F4pci*a3 zsXfT%DVfrTI(e0Lo_cy@JGCRjlz;`&GA?-mGawH4j011bln|@Tu>lPe`m>Q~5KJ^8 zIFivUxteyeUi1JEdBn;WKuV+=aOs7l+X6!%HV=S8AiPOB0Iqd@QjU`{O{fvOK$Q(Y zy-Xnyk@uP<>;sNX>Ph+0Fi(&f#5*L6;AaRD&A-mT;V7WvJ!}i+-`&Uj8>VZ6SQfO| zDEZi|Mks`~70_YqDPArW6O4sRJo6gNp5asrWUP@v96j2P_q$f}F2%XBppxm#5ZXb> z<(lzY<_39H05lXR-3_eq*Y)paZFDAOKLBo6@tAH&xoSO=(LCaE z@mNY>H@U|w^(%0s0jP>gXSd?Fro1Q7Kj&S!92O8?YadF6^(Z+}co7d~ObK9_SkFft zlBbBTf}A!=m6fq@<#($D6{?U5j=!(cRqy;-GDjDC`?61I2?t>rpLXC&#lQ6X{dZRThqt}N=$A_+} z<0Hn_E8$A0EEZNoe3VJmQ25^dt4}XnSS-`|BkajI&rY$%qNy_o=lrBvlw;qlTc67W zXwQrDtX1;t?Y??_{O)My5TY`;{*gf}xUx=f=$bHz)@8LablWfe`QLtN%_?9C+_wDD zVkg8`+XpCqM@!&?eLA>pvAHUi3_-^IBF!-1X?6R7HDZRq2jM29wAqk07;i>XJ(PZ$ zl#t0hb%5OH+X}w+GbGo1HQee@tLpuY53PMb9a8ox9{K>Vt?lzQGVVZlk&;ZY;e#PY z*z|U`-Uek@iqZ-ug8=U)%PhVW<85X@JeM@Xz39-31QY7{WW$vLlIZUTkqRs&r{Yd;q#6%&jD@vEd8YQl#l`iOm6RWYr z4?t?X!HCCZK5TnT)wVv!a{yYln3hX{CG_xo!ibN>6b$lAdBmcDi`Yrx+!<_uR#Xkf z8Hv%978(p`(N1>gA~_den2BMKivq=ji)4lPmz5t9>M>cM01aQ&%mzAteNRF$?&j_NgTq-4BBD( zHBoVqX_Cx%CF4;~R4y~L`$D7;8#>%=6gzrGUYnQfxLniLODqBN3BX5c7&ZBw&&!qQ z2jVbH_Hl9%XQilxsiT#FaWVm7ia>1p9VXjLxs={&Y z?melT^^4E(weZ|#uFX%?5nhc9IiX|b1va84KQLx~e&OMhzjqvGwq_0|c{0Ne9g{+D z;3oXSr(WBpb>&rxGpvJO$jB>XbVDJ7@}#5Kw{Eq&NB!jQV`0WrhhejqGrve-Is8H_ zr$J5P$C@^M^gNR1XxQrH<``9{)q~sY%$nOOxzn<@b5Xl&!-3&cKECqZT2-SSn}l*S z5#@SUJQN~)hs`KrsJl~k?{(4w+9J;&-lYX{wxFJTM&)$7%CXD|NtI5tv1M)PjE)iI z$#rIiUiWRaA=9M{NvjR^6hoynPz=po5G^cN*{fHDOZJU&WndBpM4oea8B#@<#yNd3 zQXx+Z0&=v15Rd+`8KIIldiKn+=9LfYO&`8$`tX;g4{P6;FQAF&yc4~UdHZ;^8=3#s zXL&4Uc;1kJ63JbNK3*qXA*>*hl%*)b+x7GWylBY34vc)wk4Nj#Q#Zcw);&BGM=dp- z@TOw8?J>gj+XlHyHACe54$4=#EA6?R=msru z{l8&N3qAj$anqG<%Xwyk{>n{COjG7mm0yV)DDT)<}oVtZAwZ40<4x zIK8eGVrGH~P^?%Z3)AXxoUu~$1SZ(Z2dVN5aC~Uh^HjJR(;e}x?JUsRR9PKng3SC> zB|(vF5wU$^L$q~18eJP1WZ-fQt48MkEPYeso9N$0GV(0)oW_!`93qGJH+}n1Tl`7W|;L*AE ze2`m?bM$VTM^EiFHThz-X`#J09I<@(5V~VI-Q~GBfXajiePr^7ZSv6+>%uft2N8#W z3LgnJs}oN^F@Sd8r#amnp<+QB{dfb)#v@?@b*p_$cLFDgA*g5(Pg7uVTu^QUfsaJk z)yAnXWND~o!nvrpeW-V!U5yQY{xmxuaqoR9+V!#|hiuZj`r-rG$vd1Aa?S-d!(X8aD%^J7({AcR-pHq0K%5+XW5VS7 zb}28Pv@qKnHaDnoW$&AbdDWlIGv_WYcwW3SN%|CrJ$PB63aMNGpu*pfO_0fnRGE>n zSL>@?RS0!2&6NF`6o&y9%uBmOQ5S}KYjEj8{}CF_JWGmTG|glHw7mIG>@zBsqpbpW z=>>UIp6_DcYt~lG%xLX-?XN=6t;*_0NU>g2tY6^L>G3j=rD(>{+G1EimJSw-0z&=J zp>fLDH7{XBC)H_U7?)%+Ew4Kd;G~Bn@6!+VN{KF#F+pU8cXq8rbHjA-B6qE&0o`yZ z@{^y}(JmWW`w*S$bv=Q`H^7kN7$?h{(l5Jk(k`=`Y<1yv*^;N)e&V@k*I5dt8n@`I zJK$ATX}!`K@9DYA7LNp<&^HW%PmMs$i^{-`Kns(dL$y8LC+3HHLEcAd@1-OP`deJ?jrtmZuEruHlYyA+88)zMm z(V~l;zEM3!ZiT8{t?W7U@{H60GFFnx!7=1t34h-jCmw%n45ic zS2r_Ye)G#mgfB?~#lwd-|I%i(E-Kd;B?a0_jvsM_JX#kb9W>Pr8{5VxlI?~_&$u^E zof3MV<(FM0w7~SRyD!`(*c#?jWO2BFw%$3_qgBD6iaw=d8)QZi6a@182qLCLuxQQL znd+Zz$|pP;a5T;6#7eB^?-e&kq)@5Af$Ta05$+Kf>l&^F;Hni9E21k*#<_=qXIa)} z@x@LB&Z}w9L4S~#G0RWajTH0<8a~4vA_(Hm*K{<{=g|3PIagf>6N*YW~CsJ^9yGY)X+scwdjuK->4O1@Z$gi>#kP<+DyiGDP2T03OpwHyr6TodPm(fS;&~4R!LfE zUNS)&pVkpAf;e84ph=U7^%>zqu9}B~%egs%BZ34w0a=5#HeZj?MpA`=a zA1Wk^_5ty$H*bT5XFcviZ>5JjQ?t!c&CYOQ`>)UK=6ILCeBbv!v+{F0zA+AI->Lb5R@lNZxbqzLAG`6Zd<)`VAE z??R1qW5CQK`!RvT8Ump|alu&WHXm##(!yjF18Kf&Pom;19a%550uFt-$jDXP>pJW${m#xz=%kya~04$)Yi9yY7bLhIIKnK(30voGkv)PDsapu zp!l}m+NzMTtX2mm2yac9ApS+0DtaSZY_OXd4EDT$qfkv-9n`etzWLa43K7K!s4F8R zuymW{oO%qK#7-(>8o6iIk)>HH#TE@bZ7qGt#>^m9)ZGY%6vf{xxuh9IVIG(3zF@p* zMwm1%=y;{IF1Jz`u%6wGJ*o%{&p;YC_0FdVn)C*fi1Il&1ciN5b84HSluB@t%Y_B0 z&oHqgQ$oz6sLlXmtureM{(a+r`I&4yEN(?|`hBg4aewKhz+fczYnLT1n zDD+_fPLVw{K?5xk1Qv4YY706=@`^9FTQ)(g66-Zg56*iKyh#UWc-`lCP$hkKO|QRw z*|~BkuffcfYYd%Lu2<(Q;e2SD2|4UN*_xZJb#WQN^%&_@TCS;83r*vF;=cMH)Z)dg z{0IrWqTu^_P_&fB-}Gx;?0Qh_x?ikc_c60+P?*{dGtJuI{6 zv2QBj451Nf3h26IJx2y@Y3X@0r67?`Q$FTBk|CWc&Sq(L4#$ZV*=(mEP$C^THdU92 z3Jo4v+7)Mb4}~FYL9)QEaGlz#mAY&i%H8pla>^B26zu2_yy4?U!PFLZ?)(`k*(U|Z zg{!yYO2Zb84g}$H%OgwD-OsMio(*3cX;a0FW_v^eIC_nDiIT+oZtSJa2T*cJI zq68^@FrNVo#HS1#3A_qWl0f{rj+G|f3~3n-Ak7timh~qrD^oqUh@?wB+wh*-cj7@W zYfD}Gx`JJ7ZoBj#ey|HQZV4N~wAw`{w@-F0Tb<81fv(opoJ`Sw$b)UzpEI z(dR4ql=ZV5@wKZ$_#S=R+EJYmV!;qEBF!*W;9NtJV=NY4u#tEl*}+?mu;h=P8(aX?;&cpSuxIQlz#E ztwc1Pw)C-TBErl@#n{QuA%&9?!9b>htol zwrNFGIvD(^6y1u2Yw0TnDkeEjL+bp+&_pYyW6VM=s|7AXSd80-jN9N&L7BE~kWAhS zEQH~qgi|q<=SF?k$T-qxs`&z0W2?{M5$+FkC?teA!uD6k)0Iv zk=+RaW!iPCiet9nOmg9_=awz&_H3bOwdz&x(8{ztYSN?6+U-tMydIYaa_v_}-IJ-3 z{Nnjl4cF|Mk6J^jTBS6bG8Q11w=CR=CHUkyuigKZAO5J`58u1#SE}@R{C(dfcW@CS zQVqUb-%b8*8F{?ufWaCOJ~$!PK>Au!zXxUndXWo7P4GMLRs#2tkVGDFfOlvrT-38yG&XWFU1-H$RS-|6UH11- zRElg>JPJSh#ehPGo&ms*&`9ytakzV#8k+Un$(#i z?A$%7W@ec7KphQQhBLE`E-*;g7>v2ww8z@mComs$>RyzD})6eVQH%WoY0DEM3FiFb{9{HP? z#uAnig5$ScUAQ`dDDuHKy2I7Q5TtB zX|vg&%YZS#4VcYDSH6*T7XKiOzc6&mgNA8l#t*P+B4R-cMNVj-@HJx4+AWd(1 zz(Ix?JPV_SWl=LW)sayH10(a$^}DNw2`3fh_ewR`E47_m(VHqFxgJh$`Pi+*q;ur+ zN`-fGHJLg}iflJupPg_-J}{CtY&CkGsdUaIF_<0keuI2SVdRUYG3pxT$gr$~Ge1_0 z1BFw_ZaAChi6K6QJ*2)Vp*5ti;>OqR=2KrXX#KwLEe!NnV`(%y4U>&{fyRl9$50W- z0W5(^0aAtN6mZvQaSvk(s{z~B=gQjz<;uVjf`0}!56-j_O?6SU=pe`lUHsdo3}&b( zVt5Ec7}3h2)~nL%7a=D3%ojH9G$EtKdIUP_U=jFZ!E1J=abAkrxr&^!?6-P$LL~yCu>j^O*IQa9#PcA;G^-WR4CH@;CEmQC7rI*C2_R2^ zrGv55^V3wt-ZbD*M|r1UcHtN4X7(sm(%Kkd5LkH08c5tj37)7 z$$u?I;6<|(_O}8ke3!#JTNYl!))phFM=Vi&??o+P7nu)E1^gT&*8!@c|yz) z**6jxlaT1^eD2OrH2nh8Y$S?t^lBR&yNH>^`(0%Z28|H8I8ank04wP59duP5o6zv* z=c4fFH7YJNN4KuNkj&|?M2%J>xZhVE8Jhb>Vj|V_FziAtCw}s88SFa_bKQ7VhgDpB z&3X!sST(zP2x%_#n0PI;&O3FDtT^@D*u<%7U%;mMb3e88)VDoUs=sr69#j_ye0S^P z<1N=ny{L9fq719APT)k2XV(?{fxut$B@1LIj-VeNz_CT=z~mA};m>WcEC+qJ*kD=< zw)W4!i9;GxK-1@y=m#UO$D|A47BM&zy1ldM8&Q2L6ryZKrduLHT@t$95Y+uAX$BqQ zLsC3K@m}pRXHO(TT=a(k8-w;t!+d@+M(ktLDYy?DLj|ZL%%m}R91sFEiD5R=B~nT; zk;Y*H@exDsZT)CY!JSt-ha?o2JRDReCIw|5nX!topx2+3sAC${Gu?u!Ch?U>);+eg zx3Yc}!6xN%WoKPmu7Q}jld3+Y7?Uk+;$9eM6mDdetN9NpB z8Y|;myVt6XfYh51kbgJ3|OFRKTf4lB3MlO9OBHqFm9fa?~i;%AmceirvRWVy-b zRGb^!Dz+WLBibxH+Tm~u|1%qE(BSDVTPO*s@u|jo_g6?4oEL?w{u!OFHma;Sm}C3- zG_xa0oq$aJEU~W3_dkEY!LGV^dahG2zZp4$1Un#*{7{{pq_d&NAuFDR$L2DDu)k{g z(n#60qj(}9c%sJrVnK&Q$vRC8J)lkN+KL?&y8y8F`8h&$LkVUPGC%yrq~u(ffvf)6 z$m`%;wl;UyJBx_TM8kvI#Rl$d2#xV`*E#Pln5hZO6wL8N&3!7*>cTW_2EaOjYXI67 z{sG1cG2hPfE~caI&nts>S>wR@V^-%Nc;hfVAT`Pal_+-`q8m>^1tqu@wdIol3ORCQ zRzDejOAs7fOo}q#+4nwuxc0#vV(6c>3VkWx>-R`{!7~72(@+&{O66YY!U>}bAWF%A z4&zE&ur54FfTBY9G{8R@BxsaP;Ok^Ri!meDlo!}gP+KYb1%6*8J`y`C3dq0<*xD_3 zy`mtVo#2bLMR{fwY34wR)%9IXq%vwPYXB8xFyFD~Yh5@&+vR)GKN4sptPM0iH;1Tz zJ*wH|=;JBHRoeoJ!;V}?tvbod=}M20ZA{63DnD#y>A2kuZ~m!2%WG{ub1gSxS_I*c z>5^Y_7V505k_`=9u}T0FI9}EDi7>t=;K%?CE<`U41yDo^h|(jyRmPQ0*N&krFfxgA zl(;JKn6pE>UNf|)VMn_F38Lien?0{uT*w?-n(Hj<_Zm*qO0;zv1BkB$)3M$QBs=re zkkf?=F7o$zTB1AE-{%R0=VB2St9)oDh8KiziEVdd&@eeP&&*?jg^G=0P#4Ne%sJ}U zoo0qSHWX|y`3itnPS=jAt`jGN$U|3$wm~HtneA4X!()F5j4$Ksf_V0fHUlgNtQ_|% zR`Ixt+ZLe)H$$0WA-u(rgM!PSvhc^RBWscG64bUqCOXsCEjWgDF1%1* zBW@M0N#Cy{pScB~DQ?5Gd-KkCZEeLxwr?#aDc235$zbFtdlYzho4*hP3Ah9E$5CU4 z6JWODoag8dRD?75=)T8a2>XzQ#$KWSy-$v<;SGLZsFAACKYivSm(FrShb`0iXz51M zD^sDEV6M}!w@_(~tAW(I{=xSZY}@7pQ@eqyJuQO;|E+)h5nzz=1=JS|Eo#f|>PvGE zEmTstYYV)P^#IA--FR?Y>EGm4F3Ux==+{xXD#w8qZ7^7#dJFaaYL80z;41JrLrJ{p zn8c1VIh5>H-A~3Z!7*cFCoQ<0yw%X#5}#GC;!qZ9mmmig%YHt9#=T*U_(p1*mS{2M>I) zQn3qQ-?xD3!`v&Ks#v3uRbZ{mY_Hu|oy!w|@QGa?5?w9zU~gy*fYoe-X~5{pQv-SN zb^5X<+zLQzWxyVnAZVbvd9m~S-7Ac}2_jsMq7Q^M7L9#jS@jaI)yL_{jJM%^cI1Zs zYjeC?N5^Umv2!jFb}U>c4}A?(x0SE$Vk9KX>@|8{)sOt*w9c zSjB%|gZS@{*Z+wB{=59?`0q6N6#l({`$n_HzzGIiAyJ_*IGbnZgJlA}xf2VPQavSD1t z;t&RQ3RCwGm-E8x;OK>^3QKcgTOl;lnHjO=adMH20c&PjAOO?ZET5mA;fwFl(`5s1 z3xVfjNDI_TSd%moU|^pcF$LlPc0h^0S~AZ^*TOoOhAXo3qIUtIe&NmYaXvW57oDuT z#1287i|+eX@GkZ;?;%R`*d&e$KXcLJj0IS7@o&?-8OGtz&VV*o)Ul%yExi!xNJDx; zo=N=>PUyw*Ga6Jnv^Z!3I_@fWf_X-*T7I_22foS|b(YK%&0!bQ^r92N!7-08o67OP zFX^KfWB|uAhQYk*-n-|G?t`n|T5Zn(FC^$VER|~?Q3T9#NF&i*Co= zR>lyO#W=}20@_AZ0I4wLmost=0b?dfpo_*L90IpLizbr*KiRDsc5@peCf0TG?JO_z zXldj|%nTwFJ2JGx6gm)yEWc9ob%5~EezLl{CD`P`>Xl91w8-bP0hCtL4U-2ViQT3z zp2srAI;EzbZ}=U}oK>X4|H?cl3ZI1q=h6qJv~vgZhhUwEE6J8@xtc4Weo#{>f|#>= zb9#lQ$Y7D$KREJYF_t@o@yNGfZ3HPy`rMEAMZSX4ZIWDVL1I;A%xVWi?z`D$n z>69(y{_Y+~UFr=6Z42H(+_nlZR=9|8mHeg^G`-6Tva7)D1Kc%Jvv_Fx$a1f1?7J!Z zu-&$~J>Aeb=l+Bhuh*?9O-eG2UV-r2@!-5>frkl)S2rg*PdVgj{cOERPUa2txxV*M z6bu0|O@=Ln03NH+6B!eTE1PDcymm|~L{3smf<+}8v3+6THxIZYy{ar2r0GBnWMeA$ zZH=@RjzK=Sh-aU=EZp{n0ivRydh>4NLr1=cJ=?Ty;O9C(|Bd4rsA95WQO?Zg=0%ji6V;BLGONk4-0E6(dT8UKO zV@rH0GXW|hQWVvFHEd;F3bn_xIiRz~3|p#9cIDE5pY`^&>Z}%aVXC)&GH@g{0@8D41lt!_}3)2vj(be-UoC3DPuoCv0V@U9m zVKh8LPe_9L5^MS!7oIK!^(Y{vvy$&!AF>1%vf+l(+K8S~LxgriRwY5R<>v1NH2=lQ z9vH6CPm+ku^Cdk)app;s8!uL9pKdx82fSjLdR0b)R!Zl=3x9YYI6hiPi%nqJ0Zb&@ z+v!E68XVPsw~Fll>c2q$o95&6X>g#X*(Et7(e_H>`lTQj@ zLo?tiY#8l6I*2-OF;!d_Wisi?J;)u^z*u;o2j1I#ehW450K`hr0=rkqY?kHzD?rK{ z2g!TF~4(oINPG4O#xP6Fe8Nh!62EI9KLm84s^O* zYLD`1lC`6g1ng1@Yl9`D4-wwbz{@KzK%XE& zx|tEFCoE~N|K{Mu&d!g=T{koG>R#)lCAUdXi67*a%bvtWng;{z_p{6R!PHUh49;Kb~99zMjXdT3w5e$T~uiUFLkDG&tap$EDUbxhU8G{YKuZg|jD*L(ua z78csIzyvT(Y9as4SwW>ie$%S;TDrn7tiHvwi;Gb6;2cM%%W6P~9y z#LHa+;Ute?sm&6@sjmEn_++%x{RN6m?B2U)#^cvWzU$l9cSk$@w+BbNKXz3bp%#?A zv)3E+CZ>?iXf&P|XB~Fqq>u2atFsKoc>#D_(5>#h4nN})TxuBUx7vaqcK2T#{BVSA z_;^Dj`nRjMA6DG3bEjR{R6nHIFuyE#2NzMx?4u9wPs$J9wt#IUlL(?0O3$y0>6pfK zI+ORSA7DYYXSm+&<7FGy`A=p!n>1_m61Eg>3j5}SbMa$IxhC(|Z3ei(mnHls5UTFo zyQfCY{MtP_h_-2j8F}Apu^!FHH0WL=yK>Nr=*Of-?+sPm>pO6y_LPVhhBTi~;i^6v zwz{0S^Ky4@XQ{ioU{3CFMSD^ayzWKIYhBrv(ivI-)mJyn;`3`!=Jk;Cm)Xp-@paUi zwLng7UEX0vE$z8!V)dMMHMRcuX?wZ0x2H)txZPe>{eeuKk;w)>_=3))AL%sk4(0;W zjntD$Lpfb4@0pfjQ>_as;}x;GpeB{XuKVi3_zdKHR3ypy6CmBA^mIOR5n;d&9uZ7O z;N1S1DKyr4XA14Ort9JnaApNDPIeHn*v_bz_by?!;3?-vovKX6W13I+mHRUVnX>uh z-aXUvet8q^M)Ohm*xx=p-hK17fBe_CJG=WY54uSDAc;-!<_J|1n9n|eA?(^$tE*j~ zrU`lOfEypspBFE_Bct)}(*peXwjVx>j8yYA>~Of-r|Zk6;h@L#o39p)2>rxFwS&?J zoT6{O`b08ZGe0*@PeVgsdES)$=-zdhV}x%=b2R^R+?sSohJzqhl0Pj0_$ z+U_H5pMd7Yy1?E2x9^Vcx#SQ8dO9y#UZR6{$6=~`UQ#k=Pl89+5%N^g9{szaT3_a4 zVz@ecaB6dkXsL_&@CcZL{sqpxHBzp@@%DOa|Ha;pw#`TjJmQ9(DU>tqE6j zV%=x~i&Q^te#|~*MIkTaM#v7Rk;G7maf@;HcN4%4 znBkkjcA8&ElrBTCI8|3{ET(RwE3jU)cTvLtjHVqPF&EwgEC!3{EU?hQj+Ke=;^W2R zFgC4I(Cuv!9_4rfJ!>c~F?#?S-nu-f`+g@-DV2JH--!S%6APhS%e~u== z%8bFNYe^k7GPOYfJhIc+1KQ2DkV$-QME5y*iJi{L`XAk7Ni)E`Rc)}tgPs0ZIUO1+ zX6&ART4Z^a(23BMn>eZ5ItD;Wzd+sPzcs(pUMRcHg z4Iec(d(=N2d=h>8LQyr~0)Y&P9*KyYH(cbrewv|U7)>uBw7_B=Cx%11rg4WUD!kTv zL4ED60pJ%L?^$v>AICGw7%XTrDWgwY(2yHI6E-6%ph9+$7(kt5FbWgZ!3VwImEN>DFqm%1Dzqg1c+~l~XQ;O{}&L)ubIR zWFq!o!I?;DdAZacitIjU7e&8)_f^e}&{%I$qHpWg_-Zeb0=m%?VVauurf8iS_U81{_9jlYT%YRg zm|P_T*Hop#B4)34c})Lf)`!2@7tQsw!y5R7)9uuSQO%r()MFY_k569>fy^|S-j>`| zX$fcUe8MuNuVJHzuLp;#8rD7_gNPi_AmH6}LUZPNxz9*O!l**_<+V?e8sxzLvLO1H z3ggt0>Z6BBqOX@3)LfnRZ!soK#{zkaS{^5#0n$D*I%N9Qyq~O~==KuB*UQ@CizIt` zHLU3XUnt=B#Iq1li`#{Dmef4IhNnmAk?c=ZyBy4Xal;C*#%BoagX1oN;V#G!_|Yxb z(qci|>@ife)a@`qTjZ&Q3Pe{UgsA4kBo6Y{#Stso1MPfmc>oCp)?Pu0&Z!4rVkYy6 ziZ&%oFc} zJsYAEZx{3NIKKo5Tzc{ZKCKbx1uk3yQ-l1lUm$2JEiQ>&j;6MdX}wEc<@I9>1)yly zMK9!hoWuxh0ws+`vPUrKiRIuCXoJuU%~Pjc<|Nx3VY8G1Z`x|jI8DqJbhQK9 zY_TY$y?!V(5G8PEL)t{42(VTa#*N8}*;ZvfHTxe?2!eQKmEJe7See8mqgB#Vzs>rC z1Gvm{vx2j0SESR~gd{{9chu&GBm(EUhi0d@ZYk#F$wIV69tkBRKLQ?_*etBppE6s} zEQcXw2Ia8`$PljreRt0w5&>@|x)V=lDmu8=o&hgzC`_$vQ>+=UtV$q8bu(Klu-}@1 z+vS3+Kn?Yj_{${LXN}w0k{bkX@izf_65>ASkvBC}Q8=>zMx;XElOi$a-%vnjJ3$Eo z`G8unC?+_HkgJC$9_*QRd4h$ue&;dl+@TD$jT;+L$v;AimnTAAr=> zQI6kmReiX#_2ReQLf?PncqX$LPEBu+PM9+Tu0}!&wFpeqwth4+0GL^8BQ<%6Ebsd2 zs=cL0gE-3sk%>4kEQsWEavimStoP}RLhX2sFF1)>BQ+_CSD}?*h{}K`mpNnD7x4gA zU}v1?=TUrSQg>bQEIb`Gv==+Ww&7pa+2cM#H&@+Vj7o|HJzPUd58VdLT(If^opN-z zuYAsjL$7^E|EVentd3eLiUL(kV{p@;!0Pdk@aYT<4QMvJ9z>nP{b&gSFIg3_6aHq| z^0N%?)Ah_*3`(k7P?(C z)FIA+H$JL815`wyAqhN=EYztQouD~uv<2O6+akM9uL>KE5DYVoBxVEx7=LhdUGE0N z4VSFzGTgoZYjV2r=k{WdcNoKe{3G&St$pwSSa23Q98L>|t4?8k2t9@KAHe=75_9J) zx#|wn)3gkAVlXW9!8I4&pNSpPbVHHRw`M%9FgtYxv>$1qUvw#OH@CaX z=aDIng2IZF3U6xqK%4FfK^sN#=#f&Kh1r9EXm__6#scGsRfLi$O}v?)OmA8gA~D zwuB|d8(lVyjt!&2yIa|6L9@tjBnQNsY{lD@@Xdh(qy^G2cs~$hTr}>**AjIWHdN;U ztj^Z*!&cWtn9ehVP&?H}ze>Ei+Oqnf@Y~go@Qp^-No%x_AS%&SETgle!o0}z2p5Bo z9OXS~8)_cAHHtgIQ8-Hba8vC%Y6|Q&p`08*!@*Dm&4wxAyF735zIE*0jkS#6#G|3} z>!G|1X{ajY-QJqMZJ90JN_JXZ2QqdwH6#^qh~wG0ZAJZz*|cuPqDnhg!^BLW>^ROd zSxJLl#Onz!B{QV*aEveGF|G~=&rr~=PxFJ%nU%~x!boD}cs5E9>ANtY0VM&Bkjo2z zvv{fG=MLModI0vn)Fqn9Z6|b zr)S$o$JXF1pIX%Vz5a9JTTU!#wf7t_OR#C74G&Hnt)gps7wQ9ttpK1C0M|t*C3p>_ z^YSbQ^Mll}6SUe8q=dyQb4X3;H0nSt9RDmahmj$&49sF0h@{R!69PREQtpveH^83p zOM#d}XYq83;L{c>6~TMBP$9O_Q;>(v$h>>`5*$4Lwu1(hiaw9XI|C-od>N28N7fdN zIBu7eSh9gyTJtH4i{WbFM8-kMXVN_n7%;Hdwc_Mn-%tTWzE0VMhI;4D4z6!t~}F-@jrmqYw@G-qRcLDyDrp|+oabaZ{=728wbDN$IDFUNE> zx4hOxAg1bFJ?=3G*0_iSFi1=`+o;=RH*PMXLntt3vZ2g`g^LmpfC_(KO&c~9Cdt4f zb_9iYraceWsuz|m*BdpfE}Qww4ock&^SjH^+sthp8H09J6w8*5$pDAL9f+Y+2-(Pu zua%6;qjjh0sf?`~5=XVbL0@_%q>+f=i6b?OCL(iZ1f!f|8EvylsW(a?UY(UYY$w?T zrZLYfJ7KRDg3VQ(q|-j#ZY(%xP$E$m0P*a!sJ#S`1U(3S0M1^>#*dR2>`0jYVPHTi zf#ME_mRf}+M_fp>=?+9x(K*!}qN$*~^iUX&GPj(FN1y_!8(1!k+(LIEd@3PQvY`o- zu|O(`@6fTbU3dc@d0It|rHfsAh;dhT_m7UZw!d3&hoQU3K+cGWVY{_K>yEo6li$Idv4K{{5a|T{>eekbITpruR&Y0)yTgyP#7DbXR+pq>hDWNU$U698OQrNNm##UfhO%px`wfNf>B2Dz zfH||5^U?C%YFoWsZ86uTweRvLhbxbaI}FX*PiIMO9=#Qm>@BZ@)Rjh6psJ`H&U^`@ zU$J#ZrYw6%@Mx({fAkivpnIdq1eGxAhH*oiEM%-bCwIeB(F5Uhigglb2oum(B-T45 z;H`iWkbny=?SZJG+GG%l9H~fy)xbg<1U%LDFa&qix}i&JvU1mW>r(CIQ7>BephvkB!DZ{+ z%3{OADakgp@ZutQ>Da)myv6Mc5m{pM?FmYAa1R30X+>XPgdqBr@IZ8_25A164A7&1 zGMO#lquQ^#n{I&W$HWsuTjEniQ|njJmqn{ru?btw2moDMVAYOSbxxgP3@_2+5)NLp z;~}|6HC!)Jr}jeTkXf*1>#*A0=~iaLC2XCIymoDHy>&MWtSkDhzJMNojUYw~8Ek;s zx{47(NO^ zr&IWAH{1xIk%)beiy+U{dM7jdeH)FYrigOX8Ik1z$0_W;d~|692Wyc`%$Q3d-YuHP9FN_` zHPsrScD%6W5w5;Y5sIf{G&ZwIRDPX5 z2cPaWdne#1sDCw#3cK($a4L-j^TtHOc;8^W-X6lEK-R_%N1!8`YG`UQ^tD#1(S26cm1QC<6eZnw%;A{uburDA2-6hw7%#!lmUh> z1r-GGz+2!aGM~XeMv!RHG+`+Xg9L5KeOZnKGqKI5(ri_BWCa>}`dFFus}22Fq!R1f z&5#2qmCC#B^s(i9w2`3)u_yU9O=VDU&CYM3udfd12;enS^J@mUNyIQwKdrMmw}(3S zKA(Q5GdjL$^YIw|1vdUOtTM>IXpt4aG%m6_?Wglq<8kVYbR96)J*!PAe!0Pm zO`O;~nio3N0hG`JqE}Na!w)skz;3llZvlLIg?3_Us_@;G3bFZYJA5`P%hBq`86RU^sMDRzeWj?UgJ-G4c3437JkV~f=%c- zdwu>eb;+kHJsf{6Ymmz?*}I0`^Miac+!((%zxXAd2lN(y(ra32xF_y^R7U+td6o}p zP_-9&^PoZwHKyF;k#4cHV5A#h2X5qzn+*QQ8+)LJ_!55bJDI(aH+j67I5Gadsl)Ln zbvh0@4&Wq4P7p%Vqf;D=JEOCFY@<6s!qWjZ?{vUz?)P0^)JqYj@Vz`VbVgr6k)#Ao ztlN9ohb*~V=nqeKxRRnWFurF!Y(-Sh%BVOw3@-Te2pi4?ENflKt{}XXJFzW-93oti z2M3iAh53R81eIf}RqeHfcuqmfz);9!h9j}UAHeyuwxmG$W*+^{*85#{3}?_~A<{!Z zB)@8abA-!}a%hMK#_WXO<`A!{t+M>nyfZ_`LN14Tah@bo8cCo{iFUfs>O;lOdKe|- z5=`y#dgj?JtXJ<+8S$bV);YLYNmsK2=L;pSio5h3{I@GO2zr#5B|EpS^Z`d@x%*{N zx!=MS?L1t@cm;Ku7Nvwl{MfL3sc+TXhOd~rWoW8=bMT_S^>#O6IA)mLewr_$8fJ@< zi-`FlmK3m|ZOM@$KRkkN3lp3wSZ|7}fC3KiW}BoqT=vTK4d2kJsY{K!L%X)oyXFjL z3klEFqQ@F|oPRe`?H_;tiodas|BU7}#md=dtz$9%^ZMHQ+BYHo^Ecl-{saH{_xRKJ z&ocQ00KJD#z33z^%t3@me|+Wwcn{$iw=o>bc#QhY6KC6!xSOetD{6>2`?@y9R8@tjT^KbAD;TW@zT&P(PU5n@>J&lr# zKy!04i4_;uGB>>!13Gap0UPcPICOyBQFkSJSD;xkK?P)n1rhstRmOGZq ze0C18$;#*w{Z&j0^X#;Zoafp%%O?;nHy)g&8Wmc>BJTFz?7R_3M*tw6!KJ;LjBmBO z3#naAj)=x&!~cRG=sn>t;@jP$$LqWM#}0DPI?u3zYZ}nhk$Xtl9<_h z#n5H`wW<*hF(oIYbT)7F3@-Y@VquxyGyj3A*&0_*0l0gh7E;y=iX-DZpNT*BI6qyN z-)_`#g54}yGke5WY?tIf-#JECO+zvzBV4@}^T8P}y7m7-Xc_YTf(lO43qbCo;t}%R z^Yw?eKya8&*|qb;aUGYzYe+hPp^C-*#PrXuSN5z2i}7iGNw>f2QOEQE;!JyWQJDD7 z6(CER|3(iY{AU^6Wzj~7mUL)Ahz>L?^N6`S7|MWynFK5~uYOw9t8Z@)%8nxG)Kwi; zr}U2eWdJq~Dnn-lvLMtE!eN;{Arehd)M1(+Ff>#Sh|C)f`!9n)(z)3p6NUto0k=0&j3pkh(5dzuab>OJvg>j| z=fKznj)XHz>s~9wUGCJtR5~6|u8m3>(-umw3$9bvRwU!|gG>Ufk}=Je&vF87JDH!J znn4XtA}V+5=xFEg`2L^fc&_hbux)i%Q=xc(%L;ea2ZOGnBlewxVOFP}%jKLyQEA;z zuBM$q57EE9qI*#XaM{V25y1&%2^3`31%5hKkCDHisoY!RQ+kCxAaoW8X7H9GyjJf$H=cGi;z^S>6XBpmu$0tBW=Gk0( zLl>dDaOd6ryQ7^KuKDy#w2VSPT&af2&coRCh9`)*dO&g>1G8H27beme>QgTUjCpUw zZ8KX?gW2BjOPyMfpbr&y((XM>4G(4wrYeYlO*HjVMN4(*4Ar%%94)9z36w}un%{Lv z<~ofgSapekn^9Hcb8VsM;ZP|R-qt1eQZGt0^-|T34p3RwBci#Sj(9>cT@ubx5l^$^ z;PIU_x3WL_koRc)oyNlES5RT6qqBFZY2KFPy1iP^?X%jN4LZCq2YHTS@B?$E4oX7! zCNZJB%$Es;5)X@bW`qMHs)E0J!9oRO2Dt+K(309%GNzJu>qlX?%q!O|;r_f{aknxf z`-#<-*-JGw0CHy8^$B;s|7!o;cE7Ky#dP=X;o9%_!u z_t4xC6QH5&VKNvO(`4Yvtwa(~8G--+>WDAFDGZ~x{0=zgY{?;iaV_NQiC zIDMag^!t^@atgTAo=i(rjE2N`Z1x7FV&$^ra=ar@LO3lh(i!-IEVHbMHn1FMuh_ur zB9<~VgNbKnN9_E%(O2ww(JdsoIwOO{nhiy{XBrFy*1@?(>X zs8Uhqt+dErA{8@m!-Z^m;{#Hlbas}{O0mM~G4x8&vvyhdBAz9L-9@aDp*F*nsIyIc zqZuERInfV1&YXB@cH^)Bi^VcNEdIGMI^^3ShVZJ#^AfIXC9N-lubohR4k9e__Km!yvZZOb0s zey3*LU7|+CEP!-?ZcXuUNFdaZewhD~82)Zz+E68l=v#7ly!9Nd6r4<{U*B6>|4TS1 z5V9PlA+v1~&xnuN2g7`=MD6{yAiP)s3UWh;kEnB!lptKd-ZE@yI$=bP)|-}OD!7)! z)B>5J&KnTQ)(DL59HG&NDWVKuLu#hpbYpvK`}Iy=O}cw`@7~vstFPbOySMJ~O_MZp zdI;B9<-}7Vg=PfF{KH#o?)AOL>*1Kn&KxFF-k6z@aLt<7CN|b=$m^^GA9V95-{3?t zqi9+fn-naRCo@hwY&@Am#62gQwgo$MdwXkd@2I*z>Ajhk)yn=vHr5fT2+(Ec zCBxo<4>HI+r?YqhJ|nR4O0_Fdfzc*WV{qQ46=W-VFHhbBL3WVXE?_-x2K}57GNrfvUmZ#oh1V3Z?Brc$N3s=3TwC_5KjOy zE*@fvKn_x0pq0ORjo#2*-1rzy2@!Oj7;xLZ1l8nh8Q73?WX|K5n~(19aYS_qZU~uu zKN=>0H$Hp>ra}|*FE%A<>IjsN&{PTy${ z^tH3s+gt12t=!QpX>2Nd`;;Xn3I{#x+p|Z^2c*ShyaIthiqR*Ib zaHyEG`vR>P$Qh_0EKfR(=wbl~Jn2G*Dd?CX;J2uEAhra4>%@;vy6tXNQsU}UlQ-xK zzcrnRdncsjak1IPeJWN`x`du61r3W!*RZDQYikcGH?_yzN1c<3tcF+l`IAU@ItG_7 z+wrB7HYyVBVQWbJyu<;80_Ft;A4v;!0fPvPf&t-coy-A5>QMq>z*EbdA%yb5Tmi>e zX^%|n+AI7oYL1C8v)>Bw6WCnC>t+LKF5Tau?h_-V2#3a?M0`46UY9TW=cej(8^U{- z!6%3ard2cuJR8u%Sj0lH@y(Lc7}p%N@QL?PdE5Mbo?gV`1fd^^S%ZY2pauuN7&uyp zJZc6$D6x_oJSgo&+ew?o7;d7HnSjO^-XX`*=q|7!5gvxIH@=VsG_^GRXM%r;ap(bz z2EN7ZZUa#^i_qk&u1xciRwl9rx7S4@$FN>;eof1po;}Q+=Le!(MP?x1S%)B2#U2`FkF4L3+AQWTo`fE zg@P4aZ+?qj^~&01t@( z1SyO8NhRfSZOX}fTuHf9n{u8_Af=1%xNMSElO=!exYD@5&CS{p$7MC?)B2Q2P0IR0 zPiqQ&R-dw_&}a39rbQNK9o6?QRCmq$9xM&5Uh=tF#!EvOO}s{sYald8ID<6-mtTeR zld?;IT~<{GsB;3_PBozq#;o92bDXa^Mpc{V}?Tpid40s)6h zJ!J5;p17e@+34tZ_Di3U;D%U>-YH6_FpvlWc^hQB0zTIah6W!V=!Vh z+-sTBtu?Su44i&fb1x`e8+-AyXTX)8{A{>WGUAeiKp?jTtR3Vbd*MZ%V)>}Ey-lBc z5`Vyuq=$PpdmxQne#Xq^&!wf&g)3%ggz+ z0Pml|GbutpVfchvmA&O>_y88#dtG(DhA}K`@Ck~2$RQs(Cx#!3wsFGu=5bdPWcEtH zD#*TnW0krqVa$qmZ@=H#ySM)J*J?iJ)3iWE#GFhgAfV|5wDJM{p0CgpdRfLskQ!qS zcV(^%>e2P=QF*=#H?CA@cTu+uk5VLsM36Ls6@{-Ltru!_LA|S%Iyo=$MhN=(X7}jm z-o3R|w(vkb4;sdx`>>5OWruo7`fiC?2|lhmu!Nq~?Y)Deo$rnh-rnnA5cB(}5`6h? ze>-{$&54%GUVGU`D}HzkgO|AEvP)c!Z9Ch(rvZA;^J>;5>{UwGyJHD>Cx@9qOr`{3 zURTRt>}7s8{T^UdF}oR?A!ZMA;}VE)y)@Kpnq8g@J~1;+xQDh z6E-{NcJR2&FB%eq;;UwH^ke~zynNbc1hWeiFh&6A&}YeMXgIYLQ!tFv4Ilve53)`N z7-Q!T#_(VJ7w~`cc$}VmZU*oM{%?Kl@mGrfdkp;FS6_eg2mkkb{AvD=C!fv#=dshZ zjO9}GcHEs~@32VC-^q)51AU1J92I~odBxEUF49?^O(^u3L}UWjbI*$O-4@t=9KCx9 zf!Xa}tKYJpb`SRZZ?^vH;IR63cmLq9>I&8oU$B!HKv63Jz;xZ)2Yb8E_qX2c+-nW; zSw1h#hgM^OHpva89&bIj#p11cbCLM@hT?WzBh$ROs5HN!oP#40yl-RujNw8exkz)vo7(*jTMSSecAsOR$USt%1n!U+ zZsVkGivKvY|M&a_=l?HhzB2gSb=-9RfA#fxc>b?_^N0TDclp!jKTbZK{si=#3^|hg zZM8ab%KrjTBEk81xZ@rA6mx}@I?9C)s64vxRT%{JM%@2e`sE~<1aI)xJa`Aa#9GffV&tX2?H)u+zj#R5@Q=9j3xSI^qhFSvVGMIE6M@l_By|QM_X*^l@_@32pm59s zAY=BT2T+4W3{bg1pH4Z+lOCYg@k)WbZ-BL7i`$)pzd?pyAmq{}rLh4chiO4kI4F=5 z2e2ZzEOItC*}&UhS}!qloDug@2a-H|DDkI7e*7DX>Y?aJV@PfRhuGbSdflU=V+p!V zLkxpxYTo0-|NF^ zLVyQIfLJ{n_M@lqLaRNEl3ziS{sm)aQHgHPzy<&-B*x`LXGe)>c;aDB(tIs1`=HhI z-wB|MVWd*11#XD5=n4L2)R8n>0RxE3BmvZ2&^_Wva^Ysz52n|h6WmtQUNm872~4xR zDHDL}<)M8%fl6uXc2A;*^4jH4NWZK97vmoU=YKv$$?EfJ0B)53ztQ(U=KI=LtB?OU z|9_W1eg50YCm!Gc&GbpszV)q+GQ!~E`e(`#z`pYjedo7t_WQx%i=D&h;4Ql4He%gz zNfvpk_2%IFofaq=TOb?lx}PuI&+pXFA61I2y(7tszmLA#ed|6SAHGv1@9*x>!>gTR zyvd-aBk#$4GqU@;xB6*s$3E@aUoUre_FmW$RGuR*&yme@SDsW&UN+N|z1<@wtKOP@$$yeag5TH%$J^tNf?~gzJ3(o%m0uOv<4ZscO|5x8U{#u>?t04b>z50j# z|9AP*=RZ$Ao&IfnY6k$Ld-M2?ssJqJlav81ZV-w7hO@BFl*fO4yF(Z^#C23bfjn2! zh}OBm(N!V}7Rg*4UU%c3PX^}S3$(l?kX(->n z+kU-uh?pi1qjh0_pisivG%_NIM*QlI|3J%DSHcqha`Qj7gx^&4TBYi{{6iTB^!U{s z{(-93UDbEV%Ku=-wQqWN{s*dlY^(M^-=S)LT>JXA|EzwERe$ArZQtMipHI#RReya$ z)r)%l^>6F-H~+p~|M@rc8do?_k=~vEfvW$)RexFuzp3i~^Y5!V{`XaV@>{F+Y200^ z9{l@yJ^c4oo%{|}H=JCf-*R#(;Yfkl{SN$J!2jbF%IB`*2LAt>ugq^>|Mz&!B>#i| z{~i7`|BsVT+&^M}jR3UWFuHFD-||hI#SDyg2Lo?YsJ8#1#|G`+O&5G(D5R{3-bnZ@ zM3#C14%+C0hH}Qv;UVB*D%aSw5MLtn6cS5naU&)tHeO=5X~zqXL1_ z!H?B6jQhcWUoF)>JEG{#53%2(;T-G6#HlZ1Go}`IN)0yw=2M9gf)n(30$_aUP3NWV#l9#0g5QV)r9cj4yy{R`yoVJ z^vs|9Zm`fP+8{cH^;|tQ^?%Ea%JY--6r!6wQ7B}q%Km*DJ(k&bSl~S5rVSQ9`o+3N zS=h;TFJkmmyN<0FF07d`Mgt|(8!1PYlPs^;;^Epg!5c3n99<75L$EcY&Q<|;jtp(V z@eE^fT229a7+iWaE=QZ4o*^|p*0qsaQZu!%~6thn7rm`f#hMfEXBe)Mo8cc6hxrOfvO5ZU{_g-BFt`YrbYjVag zI$R@kFsiH5HJpp_%gGWrBT7?0;rA`|=>5cviJcknSnO7^UnGMPqdvmIXf8!HWN}Hj zxsxFmNDHlI*Sq!7t8Yq8Psx1>`Wv72WR7$j3sac+7G^y)C#fy_qL(FrRe&w%l|9@R zKx}{pbuPM_Gz5{10c3{wkUHxFB!JzX8juAZQF`}LZ6-rfol9Bx($eUnmyd^;8^@>< zv`sJli=HOMkP#fNZr4Kl=Mw~#z1rI1Y?fx{YFKeRM}=!_&0y+G(rOvZXjJrq3Z2&m zgV^cwplYu9h_D4oqY0Qw0IP$L7UOHS|J2SSOWqiU7C>wq1Ex&YK*o$J_VN}Z+4QFj zva0SZOBJH_JGJV@mO0XNs}?Qlo@}Uv1)+l#ZMK`bg}B!^0OVf;O@N&2xPu$+rZV)c zJn*EAQ=`}KjU8CR9^7tTFu)q1eD$-SA5CqU)UOaVjZ_d2#Qz5_ECc!92o%4&{QuS0 zU#*A!-)mog{fGSjd;EFvKVb6N`zN_VJiRTmwXT1;v(Rr!@*;TPWBo;4t)F+DxvoGg zW~bw18EHm>QGSV%0zi(;(5z^ftV9RoO--f2 zawsL(>?jAAHV_BVMR!GW-7j|!kB<9?J4ZW*-|xJ**U{H<=#pDOKit{>-p4&OFYeuI z!9Oh@EH3(C>u`T}|J4()0=>@X5kYSdBF=1>aD)QDJi@M^Txx{b=+yK&YLNw%G_3`# zhIIA~-WZ}cxj%5xFfp6}jaPuZiK@-x@A_N&FQUz$?>+eN{BURMyB;Naae%LO_KtS! zkKLE_bDxrQQ%(kEnD1 zjsLu&^7rVU{T*)1(QB&h==GtD)AQ|vy#s32&cPACeYtncJ*I!b$A>Z=ADT6Rs$wtr zLUpR_h4Z^NYK2;i0qOFxKaUir{{DRht_vC|j(a9C2WDZw*A!kH9})QHQdw-=|7d8% zWH%e-WWZY_lQ=Wf0_>be`D|i=rCd#f$r~NR9<-s_aYsVoTpAPvB|rto^o<A^*d zA**7D_&{rhxT!3m>7q<%i;Zt7oR9>?#I$CT;0xPYLmJZqcuV6EwZ-bX&5IJ>2F;iam)&*QTs9&)+nF~Vn^lzaTrj0ST?qrxxOLTGkqJiA^-%~HX3yJ@EjQGoM3Yv&62qSOV(|Aah;(qaA|nWeIH(D@gyB^ z0)&E<&`oNgP{p#Ui+nyCB>q^?JG74tQYYC3+pae{uVVB;yS6qw1P2iveys7asFg8( zgwTgHz#(daEZ!wR%4H9R8#wEr(>-RgXGMuhAl(3)6dRExmka^i@$1!cf=OYy?RrQA zDCny6%kUDiMNH{{#bNfwQs)kIA|I? zyO?eqf505M6d+itgtA7nd;*K-f_3dWHkSg4Tb3ksK6->(7j2A%4e8!3Ap7kr-7 zqw>6_v$=9IHyEH-asT8+wKK`$>LAf z*82sWHR|f6NqEJ0r*<_>5Kzd5a_U&x*Ub7h)l9Hp;RYG&cv7;zGPl9J#C}vA>T^7f zX(o8iT|Pf#6T+B49KWtAkVq(&1OVOBydb3Wps<^Exor-g12v7YDzg6-ob~^XzkvT| z{Dsf!0JNC@U;F0kwZ|d<|IMFQ|KR_Bk3Y@-%jA;)aO4GZ0&HuHT4I$fXK^+h+lbe< z6%Rxjpi=&|AR&mO6kI0^^BX}!YOf*ckVK>%?snph4$Z7WB9UYjz=J|8spt2sQdZkL zaP(r!R4pm%pycm>p;lf~ELezo#xnxNGZj7RCx0KCSID6WUluDK?Zm@587Ba%5re2S zhU=9~RJ*?FTx6`Q ztO$xjr-O~ygfgWSXeftTH0ZL#W&>+3l`-l70K{b4A&wMbQd7hOt%rG(Njui zem;Ci04*reN5Bau6lBa|t3WmH(+?KAMwPcpW#y_Y8fI=R#GyvfobNPC3J0tcG-;Meq>3|SQ#Ye2OfWw1O%G^8@SDw3*$-ogb26p5 z>GAmTteVlX?4vEf)gk>l`@o9$GsAD9?RExt0(vkaNePV<&>0vQYAn9^i0kE}C9H=e zj)Z{>SEAif{-%e)9>|tht^-VFvDe1Pt(oDQ4a;DTifJ;#d#?<%>1bG-UAw?G zSSy=TL!4GJ*q)IA7U_OOqBv@hnSzx{%`cgA2B@0{5Rzf}nfZX7w~HKhsiC+6bmcY! z+ZD?0$HHZ4(h4V|9y?5y1gPEBfwF0yc}wZ(247mnl6Pf^<|&G}1w<-p%>3%hR!63^ zeT=xs=gIiGW6NZvmD^vz1Sdn=pN8&VBJF7$g{E=fM&@c9%#@aZ&;%y*hI688XAU0% z1;KS4#NK08jOvBzEyW|SCQPaNQOpMebM^?-S7b-b45^yl$gTi*FDpU!`x!U4rej=A z?ff#)qL7W3s!Mv)kunyrC3(+L$jYd*la&ZSIk2%*F|aKfo+J2_*?SWkQ<36C@r57` z6EkPQ_Cc~tK<=GW!|BCi*+r*{$oHb3>*%tJkV(WD#{(1nOo@KhiQbrJq~JVkFrH~~ z3E`PLr??fd9fmN!|JfYnw5XtCq`1VeT-Y787U8dw*VJv^87?T9%_haE4E}Ts?mMtl zAgC3%jg)6Fz=olAOF~Zthjgu@ff6^&n>%l0S#=a7aJ2lidQY^K0D|XL* zVAg;F)NjMpAQLZHIZO2u9L=5e8sLHmXh2Tn@y_s^~#O;pIlE z;rJQg{T|5ve~&z|4Uw{lFyTnjHi;v7az3dJw++^rFcG$efI{mjy znz3_I23$#@6ytbpXiqjT62MCgg%_{`hwjBEmC5o)gU>Uc0g{q|17anEWrE5a{*?^{wt~DRIH5=yC?Ut&jW@P}1Ky|-#tkmrA zQ?;Yr=E9X**Z>&kOJRJ(ore$CFu&rq^ zgh<6e4R#0nmt0N9=^!mx ziHTB)e-Z;nc=w%8EBfiC4GDkr`rz<*Z)aa*bVr`-ym5;)z3J@9kl`>W@ZW&6R1TCe ztR3sn8ZFC!bG~l(kv9XvDEbb{qURHm6L2Ls^PK2Ta~*6EPwu3Bkt{y_~q15^V$2UrDYrS0*CtkslvrY*FbD(cng`_&Ix zIMkcc{Kt?DoCvM)hb%;N-jRi~WS-+=gM*tyVIva`9BSk-!>3 z0>2xS89`cu6_X30m_y2rl`g!ZP$^Lik z&#R&TA3y^AasU52{OS9Dp8Vzjuqdj&fK&<~$Z&UavWLBcbudh; zXQc6lV6Ncz1MO=l^3!PKDBR1lJ~=YmQ$ zdUm|R_@NlHGCV!EO%KooZE2A53HoWKh-AUH1fkO#yi{KG!2ykZRO)y)v7pQE-U8iW z0?==61tLM*q7}_0Kn&e~MK>104)}e@Gq6U#xe?Q~Pnpi3jP>S*y1!R2SI;|BhJ?W?N) z-#6dAhBD^qbXHK=U^x_$fdcb^lLzI}zqJ^@74~`Gxm>a}_mtnYh+@0RX&CPU0*@11X@N z2m&xWO>kUMNH`q~@U98&-gxK**RrS`kjLxKcaM+Is@9Fd%iX=5{=v(aM?1%T{Om?z zZ|m^Y4u1DWW6h-qGs{?gWjkasjV-9Lbn*woYeO%+3AD}nVR!%WdgIh>A0GFQcDCOg z?)3K$`V5w$n_i!QETlZJR7M%yJvxZCeHe&J4{QhiZ^DGC!GHRlz zJ!^M$1U?H3;i8AK0#L6XI~M?DJbUD74!C}n zi>OEI_IjDSi-Xh}Gcl7}I50f|kC+w!@^ai)s)??p!YY=c^$oem`WqVw@mJ_5LlIL6 zU5OogLL-pO-Upq3`0#^R9w1ipAc(A7i~8d`pg5qRdV5j+YyG0}&A=MS zYoW4mS4NV~wj+JGR#%cXM*kFyA8UX?2wG1AR6H@HDG0F;!+0^8oab9GPKznvg;6oq zLV~XrO=AxF(|K_=601^Lajo{3gLbQD_bOyTvyF(tmzA@8tU$@aJM!jYpZ@gIm&0d% z(ay)HWp9|VJMD^O6kgMq~-)HuSx<}Tf9Vy%d{MvanEIgnAMpGxZe}|L+mS?UMkOGDGZ*#FC-#RbcBs=kRmzQh&b%p6;uHQaYhKzfy+*!3HElj!=@!z;ljcXppTL z`j!-)&oTz!Fmz)+V~!3QxRH~23LDjil7DI_BlhNSlOvxlx12N-o2A|#W>Q=;_?xW6y+ zsbOh6)&W382j@{S1=9!R;V=HrrlVvnfCF|xon^4y$uytEvlLbW?iIbNoEf@;^+A4# z#th5K@n0$LJ!J)M(k}!);;!dNCvjv=pTwpRL+{w2B4w^n#n@0$+y0}C;j3+HsYye# zyzKcia2wD@ga)bVk*z72k$PvukK=tkn;xJ-^E{mbbw&}^45``lfEUmqm^H}zQ`U=q zGOO{Y4E}3I@~7EPSyx%rBQu?nDFB!3LquAJ8holZwICH(s#oM`90L)x*zMUgn8a!b zK4au)XJTE+4%$~Od4I79P3W=|QdcUJN995dw&aHo{nJk*A@H-fUloD|XY=eFO-QVt z2jneS2=XP6JHd%o07GjpDSZ%8B17(s6Q?F5MPMx>4^HD@Gs`E7{%MOKo>CwJ5af2b z0&kHb_^|fDYEVM0(H%wzmzWXl zpYI$}JZu{~&)UzK-+!N{X#RBqYa7Pwk{C=5uMMJA5w(&3Hb=v{*-&lEd(ILxEjB-w zLF!AK2(}U(=JV6D@pVrX*@)NY)*UJ;SW(ZhoCuxaMIN7Z)Iw{9#F-%X>Qm;U+*uGc= z>eOWebA4lsMDLG0oeYI+Ewei314ICb4Ql|~$D#IAY7YB2eVgNJywV~N#BSMtWED=1(yENLSKFc#{DUq z??VEQ4w6QtM#ZIJkxUh%aUPdk!G>Qx@Cc)Exu6Eq-q8DqwzFex+wV7*-V>qtu(|Z1 z-9y9=@hd{Nl9QQXsgn}WXz=)vtPrv?F(j1+s%O2s%0gN5wl~{F^e|fAaBh}8Y6l$$ zFqY(LWT_L^7a19gvZJCbkJimU{LS=qNjq*D2HnW$B)yn9Go9L8S%D=k2aG0J;*VmO zT*Gco>)3NnA{NxELW+uoWT?QM^&YRd==XK>SP^eUwt0e;~*(X2hGtn zl110;{u)Aok_s#g81`n-$CL0e&Q3wzpRovgPBE@Ux1b{N<_gHYs98OlD~`ITKixU_ z+Y?p-D2m1j0-IuR-RH41)6=3xx6I@~JX(-iTUO;-v7RN?zfSE~D;dEBq}?>A9Q(2W z_ct>>NUeF^z8rR2J!G_!a@~1t=#`n=TiP3YH=M4Bo|_1*)TehL!hRa|?T)y=OP2Aqjn#?dfBiusK&0dSzG zwQp%ZM5H>9mbejJ$VS*wI8h*}X+e`}3|JfPkhB+Gb!O4ir_ooiM1rq&9gs?}RF6#j0!`iwXmI;c}=z+%19ug@$+)@mxjg%iLGC&Y5Z3fI&fBS$Wv<5@QI-o zhVg38;Xl8&>1L1w6dLjyPe7BEwaq-Mp^XNz7Ep9+k`@$z;n#M{4y+zcax4ZTTap9e zIt|!BxD-*%VfMv^_pY?B+qA6gJ|ZqAX!Q(01v;x&e||}S^XS<#Gv}u1?~Y$C|Ap^8 z(2@eIQsp!Z*2lsH$xQd6vHIwZ)khwyx}pErRtmJ*C7Ax!C5Uuu!Ky=Q1*N<H0L zf~}u!C>pTpKuE@@lbKJzDp?q)(1-dls<`Wv0Rg6|k%8t@=*(kU(v}fHz3b}I3|5d@ z5zC+^*l6a;E6WKNv5m_JR%lE^O{#cWS-!VkJJ@t?@*UO=GV%5NI}G(O88>Na8mJCp zkeX}&8Vxrbm2<4E)NywHi&^`Qm8(Pg6YBq|Z3P8d zDI#tcn$1IAWkcY>Vr_3jCkxRSm1EI7LakL!#H(=OEV<^#z!xJTT-@Fu4x5&qsePl8 z`oyL_xkc)cO+C6r>ddCjZjpLsQ_pUZy0odwTcp0QsV{Dk`ifI4CW&V2ri^owQPJ}a z7I3n>A$=gjc=IlD5aYU{>c^GazEQa9fLrXa#IIUg!a1Ra7$+~D1ofH5J8kc zD)9wAYRE5kgZ&auRhV5PN};O@id2Q4a}j}F^9eNWr66++*8s{j)08l!P)oyiKr?E& zCN)jNLo2Ti?VimxG z^S}x9HwYW<*eAKFadIY>84_*L!_+$U~#0kuHQa{m+bdsU5)i=m725uDzQ8+3uv zDRMQ8+|Sbeys-6FX;^g;FQ{qR7G!?n)xfg(x5Mhk?&5N5lq04TtBE(iU0T5lMD0Hp zf49;};Vz6l3f)}Jw>}|oN@=i}P|8G25pGhxwIyR4BQOrrSxJ$5H5aa%3e`Q^1RPMG zI)+Mh+$UfN(j%pn+ibc^wTIGz=33BL1e>Y0cqJ^*TN8R+=wC8vgz#6>G(N<>xQzjl z(wlh`?goHtL)k8r?g$XE2A{zr)mx7XR`q+gEu9%CtnMP6Ovl&m2I1BVrg?^I=ht13 zpk7j^mJ2(Q9qP2v_KFu9WUn&Y@A0B55=}*s403l(7VH6Ee38RfkA@}f4Wf)};`i

5Yv{tGPwB!VzXiK5cE9H)JbKjJ zghvfc_~&OB#eEsYe=b;w|7>W$lTT^D6Tbm3o^K!Q9Wd-=`^l5$Ry=8Fg)e{!dw`Ui zZ39ERefU%AqEI<%$yk*tROpxAloiKStbn3>h5rlxfY3%J0}E9aiwAF|9mq(Hse-fE z4)?(^m~c`PS5^X1LXWpeynV30y>;x8d#P*a_80X=N_GZU6knvP(#BQ#80prJ@~WNi zHT!Gb{(5YGeHG}rzP4Y!vA_OofBnV&`aj;X{-ie2Wq8f%0Snp&xh1%|Y_dC|^_33I zQ#wk)0%hhqas?-11!I_N%>#aI!BT`vP$#yVR-qwMXon_$cao8ABOld^M_!%2fadp< zFvDetIuIk1-4{%>&?zhOsDdqV6R5J^I-SyPWvIy zk|p@hmvV`QS2%!v6|m)?I<1=V$Y0$Ab5jRZzD(VO2X^cfO}Bc*5!iDF1~K=YgcI7B zf3ayD7k?G|I`UeIE9U0Ts15Agr5Y)4!{WoBix1rEspN}o+u>$%m=-Yjr-_Gd3^U~F zw3$I9#})p7-doDxZenn#teHFvBcpu%*tdYTG#MReHBpOHNSQ4yQW`q!(A=l ze=qj#f5KmY{{m)UpB(_^2K=wbYwKT!_%Dyw{`?32%kS~0@n2~22>`|h19Rw8=?QqR zC4>eB_$vfI#mH0R6oOpd4kyL|#Xyw-Qq11&a~qLt6kX@@C^1xdi1=fs6!T&hO=r28 zj0xGKvIko}O)~bVGq2+rdTH23_elL>+OXG$l;%Sb7Plf5Vv#ZAAEv+zprvsn$D7O9uK{yi}$WM zW591TYR{6t&(m4bhJ0v)D}AR-nnLzNzT5SXDpr-8!Ap;L%QL1?{Dz)SQ-1k=J{ z?t5FHf2#Gf!0`ib&iM)Y6N*pM;m)gFBX<0CcmKuCkM!#8;m+Q{){Fk}*7Lm`G8M+d z0<0nj;z+`X5YYbqBp)&&tt2&LZurOX5K=9#_o8ZwX+Cu!i5`g(pQ{$<;77NLDLpi6 z@Me%9h`oFgp!US`D}E^p*Nk9+lR;<|FrgGF+ie?ok8UE`F&M9=GYqJWUM{pQmDRKb z-P!9OCZ}95)MK%Ceuc4r1>Bq)Spc5?*prViG-i|eNv84OJU&&ajLaLR8RQT$!R%9) z3MMy9hNJG1>{bg(bNBh+sPZ{4+-I|>D&L7?cWK^i9lx$5n#ARqO9Cb_l_YRc>yo^v z_5{(RCH845Qus|pS!&Q*f~i|F>432@{8x*&b1Q^eZ@c+zlV@yF zvKbBimy*7g? z9h}O)`%wGi@78|-|0g(SpS6y~{NLA)zy9XW75vw){^0+9mp{$_$>b9Ucziug2#+%W zfu&@(X7vQzm9lAYSNkS7h>cW>2eAjq2R9-`aPac+%!lp{DnS4QklL!F0Yh|Pv_UO& zNCZ5=-o5>PYwsSrydMAc?GC|&&Zm?<3e&$mJUBkM*U=dsuCYs-xW`T*>HxJQ%>H6$ z>&16Fe+>#)?<#6KM1%{B5d@7d2sKqgi&>{G;Af|KQKZN?U}YT|8(`b8vi*bo9Sk_0 zT*-T`zgroHgX66|Y|K4s8+8=?mRy{OGCrlTJ&sRLO*_A*Awm;npKAoghH2x8nKWP? z@kg|}{P;-}56U?nTBlJbrmC0daEu`;hNS&!`Rgaqg<*irTYSS`qHms9$89n~hG6S% zs&Un^xvb8PtQ8KEo{~v?o^Yy8*}Lf8>vX_VGwO6Mx@5)NbwmFyV^Ii39(ICTQBW?d z@;N3UzgjfhMEr9VOz9L11{tKwEl=K3bc7;1u{7PVnlH3rfDL8_bw;t8*wned{Zf|P zXv3uokZdXGF1blYDQnBwZITz1O1MueER%+!^P^7okvh0x2gX|sE95Fpim}MBo`!9m zB@E7!~;!)Ra$I2x`~HaCyzn|LtGaXUj~ z$jXk!t0rtjuY@U+?4XG>jqU~su|7&EmD`lMIv6KGvBHXpD%b8~LRkS#1mJqW*zx zO#}r(t$}JeUj7jpRby}HkTMWTiuBf{F|Ly|8zo-0H&?CF`nzi?H8jOJJe_y%wIus}ezQ$6$MquKPd z1}zQPbn9;t8ybm228E-}iA(R0j0kv{=n?|I*4o{ma0;&npWr|1I7YwPt(WF&o6r>y z=X~t0G+)Or;JNjazPZWQgam?TeZDSF8`2e%qDLQqnnCV+QDwSJqV9&iJTQZtK?7## z00QnoDFEp8Q5O0OtBE642PjAZZeC#c1YjeBK|Vtc2j+lqdGMYj0VhqT>FStOdX3tb zNnVuW>&QsIF`(gH_K;Ho1Fe%pDgHQA<7i&aX9>luf_YImSLlwzfLH#=7wfn*&CsuR z@7c)!bTQLA`gh$-H2EY@868;iR5(x%d|5N63kx^lpxfFW^|YW%Q*nbSzada^3rtXWT48n zFli&!<7N?J9I$&Kns6Z9yJmeJvpGb3hsn5%H#b*%f*E9LP2nmWyg1<->1QwFYa+0d z_zI)2v2Pt{d`EB=Q+PLiHbb>i1#LJclvF-Gy900h?oi9nohsrP0j|hZ zKy06B)G)bn%a*Z~k>*L$RHK$K?%4((nAwHd@n(YCE=8O8^Y$@6>E#5g+7QPF!hI>0 z{MS!}q6$E+_S5liz_s#ABl2*>mk^PmWuXlC{r>LWJuP{VthT!cP;8icXEH6Xqhf4U zUWYXKgbCykCfwdJrQ(pnK>kdH-Aau+Z{8mNwV}>6s#BmU;hvSycqx1_t$&DeP8*lD zdnZ1Dg^ux!E46JsKRN~(x4yo0d$RGNhI|}qEUNBGIl^%>H_3|47IO0^v-kfzIcIXT<* zV3?FZgF$_vdr&~wX){TPN(HlmXDG;fo?IUssUY6EQN%DXe)liBt_jbt#q6hN$tZz! zxH-bX1i}ZbLkbbuhEW1bmrmN<3==yYQcqYH)82fLB9lsG+Qn3m(=*(Kp}?Oo3KxO8 zQsF@#@g)we>zrN)R6pV#5oI-uf+5q>JQH>SL{HlSy*hYewh#7?j<@!Y@7=?DfRFyP zNnNvZbbc~pb#2=k9E+~0yk;(XYJW0ai$4B#GDIq)&q^bo=lM8^v*L3SN}p`J+}bY0WfW6 z0xb-achyC?Ov`crzJLg18sYg0y`h>OKw|fK@Qw?$8RrO_(Q5>GBK?CYYvwOY|40Cs}}B96#$4vJ<^ph zhB91*AZJE)IGn{hBB>&(=Uzo44TgVOS?Yenk(LbUOyb6(wrx>U75g971oDS&3Wyc* zk%fxqY3br&>*6bSDbIJ0`@2Wm2YY)v+h}2Oud@aU`)|6M@A4ErU8M|sP%WUVj&V`i z=_Y91li3`gGL+kby0Rp#)fefFAGWL)sZC$W3)*G8nz#tQn|)>W?yZS}oAb1Py4gq) z%*P5TFz-<9C>ojn(0xl+7oT~r8p((hL%U|NFC~JP>XcWZMMv1OB*t|cDQV*>XKBa_h_Y9{W10TuWN4o z?%m|QYqw}d8&~a5Jw4u0JUBbOZSl2urzwV12y6Dw`t)wCPa9hgDt{Kexm*oQIrXpWXB?Xb+?0{}aC zepH{%@?Z7km|x88+gmMmS!T21x@(X^3j+lT1GY;n3l!bj665A;2re{prP`DrQ4 z1<(oY0C>o%ylG_FV05mkjYNmLNpFXZs0FvB=Kp6cGLz4(Q>PSXmg+dks66xIv^=Yp zLpiKs9z1cN%nf`A`hJGQ;HW;}id8K!++&!-@AlFeasLdH0S4lD=>plILTy_5F`7gD z=ozu?Gw#}-YWRjEiV z-1AMQRG>0z>0*|Me5cD_5<4f;xJ*ydaavw8SbG7MRHa<=p`*sozmHxC?diVX+kN%= z_}$UY;ft-~t?Gg3efD)snBC^AX06YKry2BFy3}x+;Z+<60Q2#Nd36Q0A{()i{=bP;?fLr8z_#fFo1@h!U;R1sEx0- z2`d@>piS|K&H|_Vsn~U}@xoGcoD<$pI=WUt5P8jk>2MnxPk5LoxoITaI2InkrhC$J z#M_zA&<&cR0>gzNu4`Lyo-OXOjc;Vvg&$6m;sfP)G|bC{TRfY=oM6~!(@Yzz(YJM7 zL4%{HePY^AJwjublp=J%nv{LP1)_1Cw>3=G*eqyly)&@Jy3TM;=|Z$_6|ep$Eo0_f zebVqT;*r^q6}!s1U_IFRXvF@PXeXm~I2w{_yJ&l+zzax;Sv#haY#xZe0K3WXVDvE` zb*Sc^G{$g)+UCvuJqfb(A}H;lVc*Q)z)Reg5HcL=QQRZ)sYG&vew>VRBQ&LWgKihT z&j(9qI&*Wh+0fxr^JwZ0dTL%SKjS&&`t?xadTksv_=@F0^LyEesjhAyO^405|76DU zt@Xh8m)#qZBS?ii!`H-`iRofe3})$6Oy9wRjCc{;-Zf4mb=w(o3<0ql&sq^Xz*TQU z`>RkaK}3Q^@5KlZ6d=%&siEr&qG^WWIwQEUO9k2VLIgarMw}(5hJ+@wFz@h6;>Lg( z7?2CDzhm>F#dMU zG*&AuwZUtjM3)JA@&gCMr*@IVGaM%=K_(U-DU~l0)0(1h7JfWC)nytf0;vofSYfe3vkK%u#Sub>ue2Ku&pYW`dW_cjQbB|eN_BruKdRI}HB^)3QrwG4&#*tRj(h?7m^JC+-37=H0 z#GQ~!{*21Wq`N{3te~~DvsyEtFWxhVzWw>zF$72Ck~y;I(Dys&{IhzooAR+^#9^ z<-7gua&=vgh{<)RYgMlJCCtQ51oxFPI;yseuNCa5b+Wc| zx6qjGZOh91jY?BoaCfk0lt%I$=3tDMn5yY~jX4+xwjFm&Su3|TeN-aVcY&( z!?t~!VG~z*K~E6S2wpSwqOEE5LI$!tVQC7it2tJ!RkNX!c%5sQ&#qiB8as$nh4Wj= zF;)-g;_}PPT@MELtn5IAC3Mh%43K^lrlr@FrTRP$D zW%qA2w5J~2;au{}?9cE}3a#wVoECB)Wi6n`udQWA@g&-crbq`z=>E#?mqyw+Pp%0u z$9zv`1p>1$Bu5+Qo7`lWeFj7hO{G)R*0Hx3;Q@e??JPZ+10g`9LQ;L3(%S`<0KmcK zv0s*iafT13=607o4`&l{-ZGnLN(chhOO&An*w$xa9+R29k%`*SD-GpR*5B;FhZ?kjzVJf`7m)SA8ixCdI0Jo$GvGdgT@8IR z+o=(0pzm(LyzIKKqW8g z2--2?Vzr+DQ`80s@pv4=`tOw8HbU?ih6xq3nN7>cJZ#xAR*EE0Ft%5s1GosdObg0b zn@E*GyABoAm!y6JIs!Xa_G5V#tJ)!M%rD8z@LZ#jeT%*<1->`E3|g9zE(2HTS<089 ze=2<(py#{Chg$$$gp9E?Idu9>GDe5(-1%o+ z-YoZW>&*Yyl-jCn4V@v2m|!e}w)5K4r_*Qx&X}Nqm>9C34?EMY0H!cw>}yfS(4x%h z-p2XqItJR4iA9RQ3jeD0A8AI9LYI5!SyW38Dq;&4S#6h<>@Ek#41FLd!uY%@!;Bh8JS<-fg zHG)6fHty#A82pw5NJ<-uZh~7Dszo&a`bWzR#;Wn4FGvqdEfUX zL0C=ntt}vWf@ned&Nr^W_*s}d@GfH=Mm#4Kv|q9*_clo{ztDq%Q>Vwwz6L*Xyu>lMR^5o?F|)O3et zwuKoAH2uLE1fq}+Pcjf@OQ2XTui~-qq;IAb?knBA)=jHLCiG?&k(U<&_ywb0(O7)ltOc9uFZ(hDVV-2LxbBP5_Rchm5n1 zRNk&tDZ3cs_x^%l$h&>e07o1&!sdq9KXBPW!8Yxgg0|^KRI1B4NYXJLPaW?FYDhhc zFOB?Ip81f=6j3{$_5wb0dQ-T|Ao+UF{x*lI*8)L(KInhG`m41gZcY@|Ev8sdyP>h` z*?a<#At5sjcj4Nd*N+>7HMSNTB}O-`>sy(NRlVOmTRJeoDyMD)765SX7o++@bmGyZ zyj3L9y1$FKkNTW=b~?SeHMeXGMy;tIl)>3NJ2wx!whbrlXQz9(o{e5O8-P(i>V%SP zn2!E~5V8aO=XjcaX7K0#@5cBa>tBEKSm8gf0{-*b<8S`JfBrrGH2yPAK7l`P&9BmN z3I;3zBt7Wzx8CmF4*c0-Kbw*@@H0K$jPDFV4-$cRj&`%bj6ufQdq#B5r|lle$*`Nr zvk_HUh65QP3#85~sL~WXGX!ng*@IiZU#X0T4>#~5#mRgQJ_e19ZlxrGM$bEU8`W5XAqAQ1RMmZ4Y)%TsIdwR9*jR>=)(#<$O%5o#JoU5#RG z9?fC6qFj-|pu?2lg_dIZ$Mh7ea^YY@mL`yu=2I(hBZMw20j_GAvg7PQ@1)UC} zj;^c{b22SVw>##8juJT?946xq9Q^Z@@e0^_52pjeE2e!sBTQS`a7; z%{*J8_u{B(Sv_iGXkh+a@)wK;jHgI1Q4Q6lMK{=0$VB=|HQ$FLywwakV)tkY$fWv71xJZGA8C6 z`~<*qzbwb|r~XQIDE9(tHXYDj0ls~-{4B5`CkHq~ z70d>E8kz6v+xyiIE0Q~s!VC+)yvCO2;NRjrI!+QZ(fXd6H{pn4>WWSIeHWmXONOSV z5nrgyLD>nlKGNg29C4lCK?iK0%q~|2ZpHEnohMF`VAk2*Ku@~6m3LIc3<3;CK+5oa z&EOe{Cm6C6h71HF(*+Ke#^I>b=wY?KlK}L%<7IU2%KV-XL)WyqJ)B#gV12Xo4Y2XvV%i zL>jD+KhH{n<)+5PB!z)eSk3Zk>N`86q_?$+f##_r;6so1Hy7rz*`~Xp_ z&2HM;-QU^We|cb|YTGtG+>C0niGK&}98Aa+e$>MurMR`@(=0y8X=18pxde6&=CI=* z);-4%@L}&3>5*BaZF6i*+ZLIU{pvtjH3Fw1<>GA@C^%}Juohb&$vKF4qMKPbCpJA~QZ6Q8UdyuwCWS>mONtujotkqOvvLa!^%WDcFaAL$n(5{S8y8}?jwhgwq}G*W*GaMRz6*`)9}NHvP#BqHwnQ6T+2An@WF9xHtK1f4;?s5 zPLXTl(mOX%XAjnPW_c8K%MW4aHwC4aaTr77`v4$~U>z z^t$}a%MJZs$iS=(d+sdH&&}{=Vm7CqJK!vTat(2U!6wjtKqEe2Or2j4KpXVDXg**G zX6m0nhY|7y&)(TdT0&%D%jy(xNjXROkP<_wU=*Lr8E{ZgBlfhrLhYKw#W`*gKw8IT zYsrQ+2IWIvL4MMqU;8}Hp`Zj$ui-rfQU#I-V?n=gQq-Yj zl4yYq5+a`_X8{t*d^E!GE$p#G>7rF4>r@IYW#+l|mY-qUHu2*Iz44Y1EO_{rWGKC6 zI(yv>R|Hq(OrYQeCV&p$0~yToj_aWQl|#h>M%*k$l>tE=n8EqJpIjw_dC3Nc6jv8V z){Y$fIISC9@BH8fZg^!db0FEV^*0s)sTLMPBet*{Z*Ut6V;B4Cz417?NXE2yNDZ?T z&$`xm7f2g<3utmClYn`Fo$X3{R>i}R#GFo+oW^j}bg3RO6N6w`phU;%M6!s45NB|M zlRh(Cvf)~ZT0Y>8_ThU2(Zp=a%YNff_NXgH7CI$ElNGzlsnuttVaB zl-%(wr}HW3?L1Tc<)MG_QJLtg+ zd3Zm+_^`st5E`$-ai`qE*0(Loeex@YtSh>W?FK~#xlsE@AT>J^D}$wJUN~}OJr%%| z++LypGiC-}T(Y~01DU{Ua@4`WNN zx{GvVO#@BOC>E)HKBPsi>%ty5vhFh@G6^`oPsOLyS$lIAXqA2I##dxPyF5D3RMSjo z9}O)mG)~P;Fui;U)C)Te?<%Z%R^`@djIn`Oimd8iWvJT{-lmQ9*hbO-;q5SZSHON} zngr%|e9!j;hYr>TM>)5{K^d26gw4v!fbL{K$E0qv@NoU{nFP!{(q%PF%?kPy0cUz{dtjw~O)4B3{lquDx5O;{TkYyN^5A;B%Ci~XUbo{}+utg*4&1TRxrw|WhrAax?TA9F3%AriE;xj5UaG|>F4a4Y&@I;W9fvR+KyUa=B5QlHY)>|N zVHhZOUY&aGKDQb~EeXSdLZw$H7$oZ>JQzC;z`Ig1AEe#TJHBt&j9Q!Tw?DKTPe#UW zz&P%8=v&u)R0?5ID7!B{1WEAq5(Gn2*LJH$kLJ`XBfVU1FjS!SgitZHeeN+(&P#?(qktz>){1sR25 z))^}LMxb1SZgtDB$v>X;3;+}Gd9rmz4LfJlRU6($4s_>%To}|4%eosA-!*)rehZBB z4)DjhVNJ2~OiA?Ybw5ikp%HYbCYLIXYzaCNKA~ttL`3skQtg3Iaw%YY3o4mh0OB}X z?IEGUmOZ%O0yuyhD0?|z=t-hH;we%rAkw7+*C^y0e36Ba+{tUAhD%7D=xEsjD%fh? zZRzUFW+vMQC4xVtoPV`*+&_4`eehxj7B^T4ykGr*xAX^Z``>RJZXLdQd${w~(jR}? zWGi)?I-EAns?Ct1fK1nP=joJhUp$02zb0R$&)U$`391gnD1G=)IJY|ZH`m`=Hd@p| z$l8>JcfkFpn@`MD9CKr1TM?>@bUwY=-E8+1-k}`n0G$O@{8oQs-XhzMOYgq z9UA}1gyW6#c?LKV!Ky-W+G?0F@Fq&sPy}l$9z@%_N5}o+t=+w@N7+JC3>XcqXX!;& zW1y7+p4@Ue&23ga!@LA_->93+8es?h+%QAU4MLsgb2b$In*9UBq+ z7ndB-gUhru3$BA7-7yZvuTlG`{lvbBER)j##%5%;hTBAVq&B& z8XAew;nu#r>5^uQ%2}Kh;3>9A%~H>5kZV_u&WlRI^%Z#o8+OHhuPmh-GG^6`w;Gwf z_7m@UWJU_6;Vd@79HAMqY6R(`niH?kAq7f)Qc*pN&H!ORp1(bx>LW5xIclYI%`L$v zP~_UX0w>|sT^)!&m#EKbG&oDLn%mFXvY1i-?v^B9J_WiC$KF~yeGgEMt@B&AA5|&Y=fXmPG3B)jB6_9aR@F^k!pLY|qb-v@06L^m-S9II zC1&^O`H3AXyHeb-3*$nQ2?y6;3?#lr{ZY|VE$AW4foosku8 zG;*ysXk{E-;=5Y#x~1$82{<)s4=C=DmO9UyTQ+E9N-Z)g$wQmb19Rq{zb64$ZV+_% zv2zBAH|vz61@RkD1c27!;|+Zfq}|#+%$oZkBir1UkiyaV%Tq?edJnSGP$OX=q-FG9 z9<&|f{ROUY;NBbo8?;$nJT&dZGncw&=ft~%kfFPANaCoy-L?=pVC-=CUBzO}8=?jC z3?0572sBVt@43wwFk}F>h%h*y3g#P} zIQrRencW(rJ(k)sm~Rl%46)5ImK@og`2Enblwi3tx9`A5>N6_~pqZ1qfS`EtG8>z; ziPE&GoJl@RM=82Z$<8vryuC%Emkkl8=JZz7%PkWJ{LR^&SucW6R9cCxGAk}SHI2fy zIM`@AD~{oTYcZS}4b~!IFL2u2jM+6=CPn$?%^LtKs8NtmUp{pCc%nyp*4Mzv8*!I# za40O?_&Q=66K1MW%tR|$(`Z~?R3VadUEi=+y36c){Fh!y(g@w0Xr~al+kpyXFmi^4W9TXTW1iyZVRUjUG21lo_~pUj_ST+lVLTckG8uZd zo)&Nsc#)t!NSkW=ZGd{8QN8Q8trzPI+hRn+=C<&lQG;%7%xxR;UvJ(@ePHyQwPiK9 zIw>9iy*1R?ZnH)6Rs5GXVeoYbs9a!?juz-8it;oTA-%MuRSvlh&|)_j!h{R+jL9`;u?=F94aq{9cQQ)E z)0_lT&-y;qkZehIkIF;k#L6&o8DedW z+WrZ>@K`a`9&bH=_crXy`7PuE`m^l*xnlSI#$S!3)oD)|-_^HeuQIN;Z;K~G+_F8Z zi`uiR+hXN8ak9kvTb1(dK5s1cht2c#^P4eiLa)zDEZTJM%K1ofm{YXtRTq#%WKk z1Dm}S^i(-y9Gy#XDZ*Bm!-`!&TF{`h1drT&*6P_oL|-L%i1|eqIa=iW+PDmmfKy~O zj$99KR~pzP?+ORZh~qTlHiHhSux4xB zYOtm7wDc~nE0_0jPI^bE)$~^csfrkN-&@kvqfQ--l|#=i3uoinEHvtQSJvV}*1ct6 zx0)sD)vvVMAR-mTK-7jF;I}o*anK68@7&rd!nP6ts2MsJ zWVfc0k6u;p_TN0QO*0Q0b?te+e{k$l!BcIry`6oR$~@F2+CJFd-cqH}b8XU{|8~iC z{@Y7J#uo#0^@ml5sdteU;m_}Sj5Tm=Rv0P*K=rU-ZS5UDQNQ(qfd|{ErjD!3JKk#3 znRn_3WbfceL?;TEFUj5ClRdy+0$&H`Kq(mU4B+h;O+Zz z@&O{zt}9ti6a9@(JIv1VOE6M%r_-%Yh2IAw#rfvc-q*iAIQVYoh4UN-^f!APi*_8` z(&}$EG?9c+3|s_7R|fq`xGyYNh@D=^&_A&mY_AO(90LDb$pP{y6@P zZjD!No#7PdboN37n7~aXxaH7g(XH*r-vTl0!3z5d9`<;R+Id^YC(0*@yGydrbm;Fo zWAzDgUaXn3yi@c%LC;()PtXM|vlBb8l9UkyvD_X9FNMV5EgqBqti?G2?IhjABCtjb z05O2jE0)A3$yp4lcntcxdvp+Ocf(r?Kq_aS$2ucB2UzPH>%)YQ&ffP111~8w=6@P7 z&LBQI6+WyD#CL#eeK5lB`qXGGP{dh(L1lvzDCG(}X*7f|!~-NJ2#0OeR2cRhncco+-7{$9A<~TslB|HwiYC`cpPwkI3SE`eFIm1x#S>M7gR|JHV~%wBPl@ zY@JZl=r4(WHlUNd!S)8iRo|VqhbmD=*D?IH*o%3D(b|W3Zb0^`Ql|}pj)CyCqRy8_ z`1!JEca5Ng%~lt)w7{Rw(=i;643CWKG>%$B7hBt1{M*&vW9$b+oN8G$Zu_d;LNrMU zzS_QSx0+7Ug##T>1-*=|ck=yaU&-5g_|V8N_OIkLdS9W#WNx*}#M*eo9VmpS!S)Q( zu}Cy5Wzt9mT4%OzQQca-WY>)mDQofJ*0@S7)I2ihNOhqF;A5*vZMUm+=V~W;n+4Wd zxVm_G9mXlbU189pWH!rZYB`Mi5I3d7kNE9|#o%wle4)^-Q;OelF#GKFaNIXz2~7|i z&s?mYUiD}53>${KDK5c*6VKBxfyw!jLn(b(nB9dw4?TiXyI}-qleNV6wN>L2iGhxR zl}6|d!W+az)tMKtP1`*33``*diEaMW(WC*gxp5?@Uuv53Ze8ax?idEJVnsuYj-Bv? zw1F`bYnXDu@<0GN>S;4y9(CFw3*I(65Tiq4q;}$E5WR$0euSFp;f}JSRvk1f{T74v zyU?S0>wmoyE34b&!pz?;+?ml6e=av_CcFhTw)~as4HcMp+D!6q^M!YeGl3U!4%>2Jq*Uo&3(!p(-*-QkhfhF{mOo~(2p)a6EH1yO3 zifjjdM97JfZ2$uOSdnhJ4!v9x9_2DB60r2K2`%bIH~^+0P`M@~J46^kSB#PS7;OmT z5mV*`AVsk!8a0y5C19^3CLLbs6jfT7-+CAuW*c(t@{JLYf8i6pKpYz?-+ar84wUf# zlF&W!%e{kx!~OMLmOo^$YIgwj>B~YuuH=f!hP%bHq2*Cx)4b43YjNm4FSA zl?X;_5V+$BIskdD_j%MdYZk9&D`+4l*G)2m$=g#9F|)z#1&EYETX}Y%IEbtB9v0c| zi=*AY?R>DqI~&;HbUwTkg+~BmW?*&CUd`~}3_L9?2YWHc7jcS*_Xc8?w!Uql1Peg; zOaZVRtKfsz{#_&@z(Zt3LEtWaza^t4VU0v zRqH+5KvaAR04ckSzv#m?$t7k1E1JW@!*~02b13`sR*`sa&25=Q0k3pSASSijG1;?pETG&{yN#15G<5cH!1h4doR7Mwj;cAIV$U#Mk_&809za#J+{vtF)2 zN=>q1hl3SWWKCSABkwx2N7M-SVwE7dDYNtknu2u3mkFK6e${u;NjkE%(8Z(4C=Fb~ zJqtARVoE0A7>;6?LNqZ!nMU;(Mi8#E*KOzHp~*`qeNjFt5z{(`n2X?<;z|Zh8cIPK z08E2&*>8p65=Nv*#RAQ+mJSvezVrYrlY|3c^1BGUU6LF^9J$CW?GPZqG;fyy5gC6I zKnX`?#l-;Q*<-qbrc{Vb2{wTP@=DjR1)|KojIRY>+qCi&3^A>O5002>{ed=>ZG)S! z6>tz3{{)7x7Fgl#@VBe7X0cF14zQl+sm5)76sTmg z?#XSi)yYtA9&Xx(=t`#u?npCXD-s(-%84fxM{LFyTO3HK?ngp1*ut7?Ths-wGjKiORfMH>5QJG;0csrW{v={=~8)}3RkP+h-UVz;( z-If7a#gajqO)e|kd@Y;vxghGI-t4`o~L9+xPok;4W z#9eXsz=%>pM4>1G@MUjS)Ugysss~n(I#N(f?Q|%ZuAMCw{6I9LFI*lW7ZYNv0La?- zKDeuL#Kec#K6!plmOws~E{8d80l6bTQJP!Q3-y?!7H4Sf#Q4=1Re+<0$%?W1sqDJM zaGs@H*+9qv81+}%KFByO16XABEQ>b1SrUTV#Is0XX2w+Y&`0Y)jl7dwZdVXslz>mg z+YQTm5MfZ>H(N*F0dWb|wia`_TM;d0x-uZ9YC&SKu^>%sT0rLB_0t#Kp-RNNOh;%0T9F~W#DGStxKK3 zb+RJK*kQzBw;sgk##f9T*;#)eZ&wUbyU=n&s0V7(>xC` zR+}iy3X{dKJOd1Yi~yMQ#UflFyEjErLt$`$2b^jMKlu2RnJLg$+TLNmkdmTv&hNxoB>|Yu#&>RqR7|NO$g6hRDX&yusL|q^q51j%+s}|kpnWFQb1MdYd z{FV)`1_3%$!0F$L`a%uE`0dB94-bBLL_ZJz8cFO}!&8Gs0llEDAZ>31R-)&qZDdpC z9;PK^sDcNE?vHF%c5$I#J1ALVC$=9xj93K$$@>sx&MfRleOlm@$#9V*Tmf5XWX}o5 z0OA0-l83XPqrzockk87W41e(j8)9}`hr1B%*c`jRqU|Xpk~IDPU^<=`@PG7k)|vb7 zj&}Nc2m7!7>&@G)%l?S^q58V?NN;Mc)35;pQ!lXugKm)G@UQT_7eiR-d!Tpy)yVoE z4a-#y&N`&!r$Ez#u4c1VyOH+>F)Kbg0yB@(z8RI1`RLv~U@egon@=X!o?r3(KP6)| z2GZ5H2S>X<%20i@oi(HkzmUC1WzISi&>$qEQ94Kyh~lznG$c3m>jbV(ng+&n!1SMM z;q+Y_1txClwfVPieqbMq|#7K><0>GHLsWCa)NI{q=5vSaFLJWlA={vST%Kr zgnnVb&;sm}LQ^N8QgX;2sF#e5^eKzEHsGAYISN}RDciRXsJ*J^Ke-iSvO-&$c^ z3ZDU7-V`D)mEViVjl$$H>G6J*v>HHp%ovERp&>`+{a-|9)M0f2eGVpmXUP7PW@ING45^bP+r# zxarH>yNOnY460prYPnrf1ED)epW%M@mBpgw#*wCCr;qACDiT^F1H-xp2t|(&GU1|w zF*`N8&QL7MTpd67<_%(H^nz6ql!sUQHEU*I_;l{J$*Xp>65qX|!d}giWm*`feY%mJ zYQ?u4k@1ZYP-g?IS!XIv3XjG#&Qcre5+CXixodz2=}$_qs##Rt_~n?z9FuVXXq(L< z!Nro#OBKFD+^w;Z9WPD=>=4%fzv$26%h^1e%DqFlPu`-X$f!r)ZcFna8;)Ug+sEs$ z^RjL7Bt?ZkKWx;WN8_LIAo_X5?h>MT{MKHjZ|V&pCg?Fng1oF->?$>21X4BXAct3E zlhj!nb>W5S2&9ona4NTIht-WEKD_B_L)~r!+;AutKHJ~V;&1hvgcDz)5UChQH=v^Y zMqo<6@JB(+0aRVr#)q?<0())Ivzcmqu3kC8(7u~~4|r?y>4rWB97L;>2JVznk|aGD zAbZ8h`KdVz-pkLYv?%jwLT)}Ah8ns6oA`MSfzMVT1;z;@r6|0-U>sIc3Px<}01i-n zh4rE87RU0m7_fF23mP&)1~1SpDr41z@(QnQ1rArf7DW^xcL zrVvpP0r`D%HpS2z*6iRA&AY%v@E%EsZ?=9Ui?4^#`s%6^@@%2Wpi4h{~Oxbng84GSPYej{&E2G<|5(QSFptR0-x;5%uYfji{Qbh}g&ul(q z%b|$1Xqe2fhTsN?4hx3j6;^MCm=dO?Iaq7LAmF7BL1OH(gJcg8%EbEq-?D5Ul@#;}C#fQtoDu52j|x(fD=NdUVY%7EVjHZ5+0K5ZlZ>y6ZWVP=SIdts}? z1(0P67XNX}%*-pp#~x94G=R2H$IQn|hNqj6zjglc4_lZyaQtm%@07>DxTNRF_`2hI z!bVrZ`FN{#6q_aH-yNy(bDZ0oK3g}dP<_EgJYUWRlWtjL;MB;+0&Hc*9Cw{=oej^J zl0r(BvI^P)RJGHQ8GO1a!vI&3^7e^)>5Vj6P$rYX)QtzSto$pDmXONiqmG&pN9oCd zv~~{3lk`4w$)0>?NB&_1rjG7n8#|VqI{R9E_Oh_SE%Qzt9Dkr3@oW}f`w3+Pyv7Oh zBuhCsXYqF*In_;%t1csdY87D|KQhBCD)q-xZg8p(BmAf!wj z3ZzQ-b;Icydv;|3DHZxc60T1epe@Z*p_v{u5d(h=ys_Cth+J7N63bR-%Lgzt!kA{(Io0y2vNw?BQdSLIPq;KZ8_ro?u!$dr z1-0UzYowRCTKZFN85Ik*ZO9*(MFK8r1XKkcilodRY3+`ygNks4kNfI)s5@su+=9ya z3-fHxTeTq6xxi{NT$6CmG8&6P5pNu@Fz1C2ZJQ}l)<*>lO+xgN9)ikx?HeW zE!}q!9hnGV@=gDEVCd39Zw^T3?+g|#$n4jW#0;5CYqT@y#W z1#$SPB;tbXCAn zLw^A|7@|({_c_Up{yy{U$-30ZBKHwwq;wkXAxUN}4vN>p(ZN$)-DI52((JtEV0R}t z?XXR?-4sKgG4-QFOVPRjxaZRxT)h2b0CJcSQt2OyF%q8R&{lzrYUzAvkatx*251jb zkv@?ZwG~ou>YsN!ApNgBTZFPVogK_#rz6EDh}R9F@+@98W<^pJvY=}in(9FGBAP0D zDx)d_N3kNnAnLJVG@e1R$~3Za$WR4hXqTT;=O9Y55n2jm4eN}C8D3jS4`|&y1T#=6 z_}7o-e_SYoX}en-G}1UVqtvx-#5=qkw|A}Pmpi?^OV@!6-Q(78nhk(~s9Cz?>xSq) z($6*F*2!7!w`n5vpVmsEX$=8#S=575!x0%V&HTr3g>T|>Gj8))qJ4`nIiAkek7;P= z;B(MOwArMP5ZvVn3{=|!CS>T_DXk$=A~+8PuzNodmj(duy3PiMiOdYOG!tP66ft{@ zH{=Eu8&r2;1fA$vznq(-a|~-CVZ2yakVof#{TeD`8*lEO2nqPsENJr@7VRaPTH1@1 zrjb-kCmZ4`C^cd!nhf}(Xj;y|C#FxAZ<}b4t_4RpE7%h$g2j~}JSht0--+;CDGdO^LtBU0n0%PnL zF)qE{j+}3MfHz1b@GbQt1m&qABp!3+aZ#3sax9BB7EYy&+^B~&e45r`*CwM;&>O;e zbcjqOhTnw`5!h@ZEFLPgmvWsY+;(`26bqLh#FFz^+%LTCTHD|?r-G-xhK|^@XS|5% zHK|;Z8qWvm)JF|OL27p(70x^!ww?AuD^{w`Nko*9%{ogm@ZyTvmJo~g5?FPMXT-pV zmQ!=WuBH@id8JBtZvviVkTz%ZzUr>n#lZ`@1l*VJE6!K^(r)cDvxUJd#h>1djk>e7 z2Y_6dG=#bZ7Y4TH7Z~ANYH|7RiF4c7k|=}=y{0NQ^x~1k15PgSZT2`89g#Jn4@}?1 zDS;0=@EI}x)1gkgwUvtDzBs8kFQ$eS$O4wP2GKs(twalQ{YZ3}==3JueVzThWVwo@ z19!;*OOiA$=9nk_2>U+p3S})J-heR?obo zX6+sB9IK_L2c-hsfRHsT%8K#`s*uQ>fW>dbK0>wuhlz2iS8w2%tVRolKM3|+=$yf+ zRSP9|<07?=+AeOn-5Am|SyLJ6ZA_BF(0{%5$i~N=gbvSbQyiIDK%pvn zc2;(bawNa%!eeHW_Kafua23>mOQ_Z_OY84D zw;UPaQ2El8LqP~2IYkBAF$7BJR;lDt1q;+c{Lvth#ZJ4AxEXE4amD}=2pjMac@aOto2Lky{M;uK`KW*y`6YI}-8lmsGW3q850b{M}jvj`%MXhEk* zSx!!_^OK(;Kiu1JXjp)lhEsF;*7VQ1 zUg98Qxr9FJbb!&+NXi%~*KD_CQU-%1!-7r*hFgG$zZ^)JN<&NKm<}$xOJ63<)OspZ z$9{$87$#>T$T6;d!o2a1c)sH!2T`rTqxipWrN2Ufv<hxo#*RRpSO zU&e4iwi%gtLKny;BVK#ICLJ zxdLIT0IF;1H6POHIPr2rXmA4Te*{-M<|~pzFvTrUpI0RCqGW9Eao?oE6A#ZT=!%q9 zyCY^`tRM##{i2R*++v}GrWo%^Tg-ZG4&psnzwQl-w9+9y;I-T86EU%4`$9gttyHBs zU|&hT;YwMfQeb!qS|BV1r9M19QQ(t0d1O4}yzsIWC^#>}c!>8zXl-uNxLj6AWG^b! zO#5ZKU4!H89p)M*DMfEdP$&X%7{`O8eoWk{STiojXuR7yHb;|S*V9yibZNPV%LLzY zs6bjPb+)%&IJ)vOe}oEfyN$BpBUrBa@=3CchNCVJTH()xIa|sclWgNL#mmPU-qsf3 zO_EbF;F(8^k*8$9;k4;d%~9(fy1jQ~Mn~8vdl!tJp@puJi!cH^EhHL1eZ}*#k8QSd zi*W?LJ3e@;!%Nk*#d@oAV{FoZb+m9ww7h%TPo1EG`qYHB*YZfXR#xNyi<8aQL8U^u#Qsd~y#Z;cJnwR@kJh|II!KS{i)SF4Vubk`O8FkPn} ztz)_(Yj@_WEk$`|=_Tqz@X|4)E4*STVHJY{P8WAHD`atM2_lL+05#QTg#RO%%OepX zodH9Up4Z)n3^A^(P^5LXI`I4&n{!5Hz**M>V_rit*)-*Tg;?n^fcG3Cz}bqS)rcEu zFG6)%oT2<^Pkz_{PdJNv_X^(3b6*BHujj@R*gFcA9 zXrjUv;6q4;M=xX!`@5T2t$UuW9jd()s51#!M7n&{ZC9ITfflRI%!pa({862Z44g9HlEu0-wNt{|SKbfc1i4I`4qOoqjhe@k(7 zSl>*q3E27@yf#4onw5%e9GqN+Wy2QSux_V>HJ#TO4@co z3Uq5h#_MZn{w;bPR0W~yJ!NxO2xXCsN8J?;fasSAMcCDaVE1Hkrgmr#%(|D?xQiZU zo@c3P)-Lq_<`Y!y<6G@qSy^j6r%J_DXDXasKT%?E3Fy#eeA;n(n2M+C_uJchBtdQC z0fEtGgmvZF77FCHpkj^9>KJc3UW=+RG*ndcwxYf5mrodn5NO;v zROd3yuFy|OTv63}&S9)D?O4ULa>c7K^stUXj((V5sz{>1f4ZI4q&!f;Oj2sDW$CeA zI#DH+(<=;@{o4GNZcqc!2HuV*zZ7G1Zi>h7bN!gEYuz+idYGgIvOzVSawoS0W&sZt zWmjvy)nDi_8NbzGA~glLdlX63Dk^8_0Ys6-yav`N4d8Z9O5O{)z*8(5ch8ZT_uH~} zkKvrIMQ0n;Z6TggU&}2!R^rvO0X=B?wW{3L-SX;n*0+ju%IU)=KduIhw@zelLzw{6 zqL5)Y%_)5E?AkTO166dktllYBSUoVA?Kwx+?TBs$&C&7F=h=*qHa6$ZFc&;g$i9Le zQ}sGwGM{W?ltTa;g_L$V;)TO3k=Va{jX_92PAqjmtu~S`yq2Sd4LeT+wH358`aJWo zUJt|(!H5c~V_iB9sdVxKqPSHE&+B9^zomBVQe0s?+~xMg4u@ebQhR2)^H5*L+?L<{ z7oC08L&))+3s1Zt3fi3y!9^7}9ep>{dBbTKGV^ynA#cIxR)h(&8fqx;t&h$-AIkMd zY;d&RN%~mrRgQ_@O5fF~2d8sz<}Et%L)=PcnFr{gBn5E zOeZBl`)6k$y$#ask-InEAvsiRp{>kKHU|we&CTp~#XqE5L*<$fd6{#1dAM`*x(108 zZCG0)vzX3Wa)c_|Bx?+FYE%Z$)tD3 z2K=0#AZj~QG=&1dI2&0cW^^bj)qKiV{AO!jvz5jY`p~n6vWn6|*DCj{F9tw{@sfrP{tieL*9u`eN1{cEq$E9}n`yBo8JDH4x51=mAExOog= z3I=&r&hoMKH92A56KJLGOVmL%HQBm^g=6o=0%mV!!U%h4)#)&NK=9%fH=?7WZ(`IV> zT|_89LPJ2!H(?_{TYC)9@0wd_sBI;rvsQdPz|mm$Y&-kzPPN^0PzJ>`&%~*}Ekx2< zqE7N*I!YO*+t~*i)*?Z}6ByRZe0C1N4Cje3%p4I8f{zd;pe0Ob2c>WI$4ODB-arh6 zybIw5@W8NcRdC$~n-Zzs;m-Eau{E17lkXHfq;XOV#CbVEwUT~z!)*aQ}ht4h{^tLVhh0>Eb z7mI-;p4BgzkJTF;YX(7AbIkL&kY&W<4_5N=u+MM#3Xvr3RLC~%j!XCtBb%C0Cc?fE z5wGMO2doDc@PF&#WgE*JaN(ewgi+;#r#8Ne5;hl|i*TOV?-r%y48lQBoOP3jfLc7g zI&2e)lp_RJ)cxhjKv~`Z@Q%8VZNpe_Lz#xcNYFq$@(xJ~p^`9hWH-^0eC1~e9NCiH zUS7CN95a)0c~spy>xlUB#eS(rA{qMQ={GIfV$BR39TFlJjw(7PGSj(vELp>HJzcAu z$y|sxq0H|%u7b`#j;w;5MW7p^W5DaL&%^ZKG4w%TgdQj)fViHEa0fObR>TF1 z1LpuxKU+k#*|?GpadyGdYgB_jO5Zg_@B}>ipc?G$C4247He+5MwMTSs0}n5{$+dm& z>eEu*4$3PnZ+c^_O7_Zayy>-3C9Ai+Ve5t3ct%jxiKYe7)4ayC4DSk<<7D!kDjjhb z&m)Z(0Q61~M8j9-a2_P)bTs0H0^c!bDnbWD9k_nYayf6j0}C)7mkD_pLUA$S!dNR6 znnL15NKSl+$x!q0ZvWlU&WjEMH_}Mfob@s*4Qrp_Yc76hzL0jr|FxWM;@8jEymYtWh=L=$qZELlak z?NekMb8Z7SzzM>re=PU%{v>M(fC`zL?(t#3!Qt3=j?C|w&%7o^K(hNFrs!hl@}8%B z&t%hk{%?#VV;bDQG0-iBYn7V{>$Zt^6r1=?ger*%%)CLcNdx34Vxc@(U|K8R{k|c`5^RN9W%9^z$VL=1#o}OcjeK5vuwlR1CclV6jKOP~K zpvFR_QAu2;+xywyxMoIXRSEervwNO**x5EzWoBhYMn=XxFs@c8bm=OP&GjXIEtmg- z^%AHyV3ncSJKQ#ZJ}&Zpij`jrM+LDH*Ihtdv9>$Jym)^f!*JO&6IltfU+5u}8je1u zxx?uWDaQ$rbAMV}xs*_Zr))k9t_hnbp)GkR5on{7yQqR>0|bBQwZs*_-a(-G~ZiAUKY8<_XnR{A;NI?1NWbd_hKYP?Go zunr{6mN%>VrF!MI)1K-~sAhHGHluk(h`SWVt4L1s{!K}ZK@g*|-FOI`%dydU1iV^J z)h?&g2$;%)AFI{vli7&eXj@?wtvJAw`f8o500GSn>3tvs9KytAz~f9R-C1g{FNPN5 zYw9M6H>egR@a8ZB!6pV-0goQS%v1Y-wRQE)Q0tskbI+fWxVwsrblVa$lJoe;N?vj< zKk0$-Ieew>&1{+GA61>#Y*aB#%Q3vAZiPJ~WrFCn7m`9(ms=?d<+vHf=OAc z*>PGN_JgcAkVK-Pl})lPS7+1lKutnJkS;|P(x>=%!(Fvw#ja}YtMb%{&a#q|62>{G zf+Wqcm?+UkH!YO-%z07LqPbL9ADlZbvt00~Rzn!5RRwI!brOb-1MGC9Y*>-8p0c^q zjw{-RteVx=;jV1G*-gY>^rZTdGJhc{_B_nOUf$$h5V*?N8Y_28=eza}(p*2J;;p)j zEXC%XiKQU*5deJ0X9;B>Hw4Y+xpPb%B`1_X3;|IMFVJB3FpVN}Rb$n(B6~50CS4Y`n>4sJ2cU>|y#!d+qra(w$ zGmyitiC?Xhc&a5G8*NBkP$r>nk=oa82<04r)pBMbxkGrGob#Yj)!U`jk9#^Y$>fm+ zq7q}l<>zvtb5!YO2AidBnP%RA_gY8K?S2+t}uf$&*10 z)<(qgQ4ziPv(`_2@voYqI@oaBon6mYvxE~}8ux~p>?nHU$|8l%4A5cuDXmI=*IQ>b za1q;PFQNHMumNC^O91<$&7zlOst9*_KSwOvfgdPPUfgR51j>hT- zC(h$TvTwP+eE|K2(hVvKUaHi`Ruy1)xz1)_!V5P7fXu`Iep#V;SGa`Gb2uj0#!*8r zVJyIcJ#hE~zr!%bxVL~Gk6A^TbN7=nf&l}^7i#HI++lyidz+x&HY+_P0w4Xg0u2*w z5bu<6AGiKH;bwWq>5^+Pd;YpJC=pyGlAip-Gu(Yi}t&QDGx-W!cEfNDh0M8}Yc0Fd?P6f0PcY`76^%f`BSfviw`T!29HG+!$P~^pBtKH;l7VgHkonwue6(eRcF^@p z-LyW&FpoT_Dwyri+#KlOq`KcF>b*1(E%y+bX$IT zn4_GS+y}Psd^Y+ZUjTNldB1438!&i>NSMW=xQfcrU-pl;ei8QUW3*=7y!rga-nNEu z@x2ux1cx&jcEi1J{00&sM9F`k%PFRa{D&_p+gH~!0B5)7aubtIU+<-(-Byl zvr{?`i>J4UPeZ_h>dud2_89-_jYc=7>Zy^CB>DlT>~g-0SN?$r1N_elP7sAXJh$-Y z1sAr}qdi^$Ag=)CTy`fb-3cc8Wb1wKLIT@XeUGzgMQeCiZaM6pro)QH{M@z&VE>i2 zh-n`&VdEA2qe5vmcIHJvB5d5L%*fs`l)ddfgtfe?KQt_r`ih~{DT8NjPli?}1k>Ce z4r-kexTs%0RfMR%oc>Vv10P)eZspsRZ@(!fy>Et>7c1wrZ9n&C6@LEo?YH>vI{Xj+ zUHksKReBD;u70=n-5=JzUHcyX`0o4fAN^r)HKg_iJ$8P^|LYtrb2mX!5V@&~k(e0gQBQiT4r62_4;~S3j-p{94lP9A% z$CY#BZtngu8(>vR9P8xV?*5S!Y8A~^@33qJL>PF#f=t+`P2;X) zVPl4Z1kXRB-_oFVE=TM8;ap%8or|y~m2;71b#u`Pz+7}%b}qbof5~SQEg{3=oL=r7 z931Yi@8ZpW1FtFf-&Dt+Ccx=-ITab&g3n-F90>S7c#&)L+yw@R7E|OZPy^V_I7&Cn zG<-w$X}EsWunebUC~7+Lg(|^I=jP#MpWeCia(y@bd%VU&)RN-o@uuQ5ue65cr?LQ8 zS~}^Ww+=!GL+cR_Q-B)XsWfPZE?tK7LDho$x(u|2GdwO($I0ML9WB+UaZmqK>oa3CZYH{80(A4MTL z&Gi6u;Ki?Z?@%&i8UoNQd6u-6TJT~MMxAnmcHYL&8_t{d(~0&!p#j>9ObpF}=*zmu zv_?h!#OmgyZDqfM)?_rnqm*eU?X^08@*~Cn#R2QS-^p+RiP8Ur(-SafIKeDf%&&78 zM7IIvJDuRzEV`h@Hbk1!j{Hj t~eNvDKGq{pp%+__xqT&}m1;R){U+x4Rs|8}(g zwsi^L%*Tm&u#RK6`vyNa>0VKRG*ll<*E-Yn_MJQIL#0p2R=}?uof%-z;&ehKs?l!| zQ<9?^bWQ~pG&0?5CPx4KXhiZKtI4K2<=Q3%yl;AE`Kbsp~{atD^va z1Q9vwxI(b)m83avsm=h%6ys=>^H`YguE8<(+6K5nL*Qtqoev$HPiG+5b`P!o zf6o*{mmP1}=WmNd<#!p%7;l70SVbRAA?Wl1(Ycrb9;E%EEx~zR3Ff2dJ#&}}4Z!A1 zu9(?%Mk$4ueW=(mngf2Pki$Sn;ZouAo96VNl12jcKw5Btx3`mAg3zx(fHAjEP62pX zIyn_7_pIjuhHXhVd6(Q{UcTMmRwKTrgVicJSLb1^^kf~R%!=_a%$rIR&K++UKbX{y z#sx0F%5aXMNm^lh0028H>d%`=@s($yZ9iu&2XU3j>c$#% zG%rlFx+l!1*Db9#BMEQX9R|JZ)>7xJpIuh@aB8FL@Xwq1qam7n$zXzmI@X|SFllog z{B_H`it}tR71FWLWIS}?_zlw%5tGs%-4eMug<(`!{hwCme8x|t|Le}KhuP^$@2h@e zuKsTg|MR`k|E;3_?@y1u{kQ(_U-4u0f4cds11x*qu-e7tNk%0hw4ZdbWcGsULFI+` zQzyMZ1+=&OJkSw>KsCs&RRbuGpQMw?C|@~$Y91BSes^+KdX|-&;rgOyC>-N67t%@P z9MSK8hAH$(D?|=BgF!}YJ$ga{Zw|{R84V*VocPmEd&BM|?Q?>k9t8@XrpeVLn@)kK zU}hZn?|3}SdSTGail|TB;t^(z;E8NcSt0s*>z5NO{C(WM`;D)V&1HRX$Iwb}GPPpA z>v5;m;zW!H7CwD&*H)62d+#y|P~=Sa zw8)2e?^Dy2w)%Ksf=1EQbU6nur)U|Vo)UzXvmCBkwAxi9E$R=dvYFvao`Y0jCLbtg zU>8@ZO%UsT|2?_K{=qCVQdakN;6uOa%A?7QoLeDU-m%Kso{vuf2sW{ZL6c*NsHud~ zU=Msn-&l8kCkW8A3y>Xmvx$eOiPyl6sMVE@YRo=9IzHUpf90G|&qnz~0x%eu!0kn~ zlqi-(ltbh|A~3=wyXoK(S*=zIXB+2ZsS$1?a{0KmFe@E-w2?jBc2$*79E0W}FWg4j zN%1Z%Cw^|28qy_b^tHk8N7EcVM!I~$W^(+EfGO#<=yB4b8Wi!uU?+#!6l7w8OJk*> zKJp~pHdmT}#?z}bWsk(^RZgoc;&CP^b)cPkq&53Ap8#qN(79-wiNgu&nxY|?#l;bH z0A10FS;ei;{pfs<=WUwv_?d(2AFD_}m)0-8n#@I%ei;2t*eh-}Op7=m4M2Sc!gqIw z-FQpNoG+L1Ug}P~_Zdec;7im@2GQB1FX23}jX|T6VEttu;t*z2koFGU@F*SbyxN7+ z^q1ZJ7dyZ3qrHQz7dtObj<=rg?KnTO08hDU#abs>_sNSRcL{lE0O*<`RWr&F0Cg6`LSM(b#{AdOUP!M6jS|svc)9 zBOHR!Lr6`4G0qLwBA`dJ9WKnEI^`eJ;;oob5IVfRAzH0~@PXQJ3(%xaK!jz*-h z!$_>P3Rj%c7sAnl98Zj#AsKeZqtg9}Jg`0inX$ZW=@j4qY(SI0#Gr+xbrPPgGqP~k z-S&=OnB+xWRPPtfMyCq(yocAEjrQLO!sB56?0|HIO2K=ZN%Pm$W+^g&$pRX1G2G$V zy!qZQbf$J>|Ch`P6H#eWpKvlX5jZ2w3z-K-rBoaVOW7$ID7nG04_3v9xU_85lemj)N??FtpR#!{LMSb z13_dO5S8nAk~Wj|4K1(NN9!rO*lG5aU`#B3F-&c_o(odAXFwU?`8Vsv1wH!yg?^qs ze&I`A5?EbbEu_!>Xdh+nG6q=wZpaU4XpOHV< zsk{C#eTpZjdnes~Uy%L5DJNIi2wvhs=~eUBQPcV?#$6jMZa6SMZrJ2a;SR3}XZY}; z!!wTyZu!g0!R0y4b07{Nu2NSUh@iPe0$438ga~`0BqKZo`N(|8#${?_3Ba$TU-9Jr zI&ERwF&^go68Tf0?O(x~F8*4nIoseYoke>0y>0Y=LgS zxFnfvMJfz4ZO1)} z92{Zrk-rD@@$5~5eH0pwy{DPL*vreVKpe+z&fxP+OyT8XyBQbHv@*3zYMi+m1=!qA zo-=@zO$4kx&(TUJ6_TeX&mCvez{3Yo>xcgi{u-0Fx2h@(nyT$l39$=IZH zfH$h1lccF(<|^Ta_7Ee{7sg4dG@Zr?X$~4C{Sm=LK3gNOIzAk~Eh+nOHeOP2Y_wHY zQ93vM+TQM~ACBK1?HsSeP08|#wfIt zzX<0SCWUMz$9zTNV8sGMZns3m%hCiz<32EwF*|#CkzK~L(vc;}M?i==rkKUBphVkTMICmZ%ciOKG^wu|Q68Ga_*;7_BL|*SOIDHL zTa!x;E?_Fiff34Gc29;Gr~ISXBKVtBYIv!RI|($_Yh6%SG^b`uF3q0M;Mlb-gQcT> z%l#c{bJrt!p_kU2I|h{u;@4G^y(?O)zh$sNigFFv41Gpol3P%rfgi$rQIf!(Hs0uj znR)3>jl4&zKh5)D+8ueY+@^M8E_cvnGl@HCJk|M!h>7lii7qAuBY>qN)nbL|LL%j7 zMSE?eZoSYd9fgZ{q=!y3M!36DRzaiK zs+*2%Fs!Mn|eXHQ8X%Hf<+cFyBViP2%?$-$2vPL+OH1snCkY3fc|;+ z<<2j=$2%{0JCUB@FMt_8;I#bBxURC$wox|7gR{OFt4$d{D zvTcy}9S40ZFkR-**9{G_(7?N<(ofg;sIU!}C^gu*;{ACtY{?7<0n&7bInw%+hc03xp;e zpVRZ>*ASJzTvmQ7>}seCA=qN*aiY)ix{-V&SCEdj!q4GYPQ6Uvu6a@ed4pX%aD~}$ zYK#_>^bGS@-l(J-Ey3TJwL0g*?A3z%JZF#15`wpA`>CA663ZQFF`ZEcg$l|#>(|bN zhZs9?QUyCo!r6D~k#U@4m+^-pF|^AwOWlOI50-$5psREAx@IALtA&vh5U6xmZyN8K z&f;F|M}am^a_Laxxz>dYJSfI4?z?8GeDz#Sat!t>f7%?L$YOVzOQp;ym+>j3*$JhK zQgV7X7mkPs=hF@6QjaVon0+y}7^LIfjZm27Y!S{WOk9yDZtNHTzd^COrMj9>e*LGY zR_PO**?l4P6!2#YWNxrM`1fHkefPes)>7?WACm_?<0-*xJiVp~(A&rJKkHW$bawVG z%Em)kwX#jPk#IiQ`;8>iV!TEN%kMhkowRAp7lJ3*ZTg(LsaAj{5vFZQpBEW1RRBg zB?gLsCJ#sPM#w*?uS)ZxIBS;l0RFo46{IVL0G>vqdo|pVNq~XbIT~vj1ezlW5p(s3m5VHCX@P`J#qH7QC*4V%*6;{^8faRr zp2cFHS0(ZO!Tyd)`3bLg@@^=OwS6(#|$GHHWURy zj6+!WxC}?Db+_3{ZeIhCky}=9JNd4l;z;+)OIJoKD@Iu8V?r*jyitL%9ooxRv9Az( zp!YCQ_?xN!V@m#LsBE88xH(0UCAfB{A`nLa8U_J0(o;+?52uKz+^6XWcVcBRc(09I(hbbn$U);=j?C#!7J_C41WgQ-EINqzTNEF37>^J# z%%@<4cU!WHaE8&jm=LT3xre!{Sp3+RSr)g{g-}T55#!MRI9vS+845sR@tXRY+84HY zPBcZ~X?_ihKh1!xncQ&VLX&PqGMBx54z0XQ1ATDUg~XoXzW_FB73U3Hg5v{sSHv%Vtm)^M2js3?4I;N7M9Z?dh6_)QbV`61orKiXwkU8^7SS1_R< zG?&3p*nR0qK%H{2sh%qBB6q@0^YPM6TLv)(zEKpsgEK-R#a8_|>%QskX~o)7!bQ{7MaV?kaAf(Son zPt@lfBp7UcLWoLg%5Z(ovBwdb=gUup*0_4IbMxv*W}TWLfV#90mzUblJ6Es*fcF{5Sk~*I24V`7%aEZ(sM_& zi+@Ol%YcRh>ObccoyiiqN3#-hhN?E19KZXfOi5iJW3mi`Cr@yok(>}GeP*KsK{LV# zyMMIjxVY@{Z`{D^tFn{*oL*nMP-Zh+ObTiO`R4W|*>t-3^R z@EgJS*@z1>M&pYn|C*ctu>2gLK3CLLR1HRv>g9Hr&jgfo1GcC)zG+GC4k1p5QEf>t zbsVp4!@68h7?t-JIY_djIpLnel?{DX=BO+=pt*a56=7{Cht{~eXp8DlagS{O|DzOL!NTct6;)I z6NV_e4m*vNi%L6f1p9v9^}kIu>0IJ(S*|f#dJqvvJE}!0+VcSGJ?P^vc^AV95?4iR zmqRx%qlWSa!I9#KggJ6bM-o}EAg+#{G83h=Afz*K1fJYB0UK7Tc)S2m7Q*UycZHNk zL%}lb9o^Jkq>pviE2WIE;lTJ%K3&`tzz53}tM@B%qyW(LIxCQTw3Uw#9vWjoZAOBX z(6=Q0tBm2vLW=rnE*O%s8JZcUu6 zPK+Wrd6;gCj32`xtp}v?(-aFq$eg(xNJG{H0hU06u)ty_8+YA3_*`Wjm1y(I4- zo=GKxg$99;Zcu%rI^S)WePt#$ubQ8*vB;PmvY|$@TgT+e3>T6`Ty9IlW3ubk%l%#P zerdv}O%XX}qwMdPJ1D!h;PqOACyDPT z-Hj3321FJl^#|>NB&?0ppvIGO)p>@3qyX0xoM}$D#2slE(;MbkRLoJqhZC@fv#IWT z-o0BCwdx_LU#%)Y&pT%(>+=xsr&{o?9T;1JxTErX++6B6Ul6c_1h`8$;5`!@jK*s^ z1JdbP1S+$g6SRBS?_~0cPl9kO1n%@54Ew$vfmkF|JFz0f5eGN;7_!QQiauf)9obj{ zjqtcUKU$V2;dJb3FF`C_TYYdldT71yf=!>AFvt4yQw44hw@*N-n&q+2HG#Scohpx& z!exOy4Yw4R{q;PRzxdkQ!vauW&EqUGdEwwM9myWW;qq{4EmL_WSC~ml3+(RgBui4$ zi?Yr!pG=LZ1+gp0OS}V)2-utsr4e6-KA8j_Y5$Dz3^U0E^hM3pV4oE*|C=5$Hle7{VXj@EaF^=*q2|Gw5g+B3A zoC13n)IdK`r+P#PfI~SHtPO)k#(>DdNsQ8+L36-2iwS!FTDP9uY zQJ;-0$P4Toyi5ke?%7JRJ4i-U44LXF=BnDq6!R~e5<8}2lGJuV;h@D7UB)nShPE4d zUs&sSHeJyXj;Y}1wK`Rjc0{7s#*_RM$fnDhLQzL3ARuf8z&}_o*Z}A>4{FAWur+7X z(r4{X!lRh#V+^b~p_cY2*$J@InAl#@+$ z_(Fx_5RHHT9U1}8up|kqXCu@HqJ=$j88;P}FWH$R_Q|td0 ztPYvEW|&0= z0Rmw3+X^kg+xHN&+1`z*U`&5!L8wG|hk1nSi1!a3Fy6ZaK8Z}bgjV#WbktwY2Lz)I zE=63tN(tKd6wrlu)wN3sFQYgqp>0+dGm9DG5Evydnks7eiSAR?H4Ay4hXeIVFI=@& zI7Oyzp^%`Ep2rytJ^SwU3QD>IzXHc>c*$yO(bGYR_g&CsRun*_<{;7 zlLVSz)*2f}Iam=Aydo4B5!q)}8gd~Z7wO8qvf+nT438uykdf3{<*1(Y(~T|+`n$W`Uot-P${iJ%2*+y9hEspqpDZW zL~2GGtPYhOeBQzok>T4sv8Pau4 zyLWCfEBF14(~B8nPL5x+ z-asL9B(KzK54JpHvKrDMsjmvTE zM*ej{;QBqX@k_boHH~4f4dyQS^H)??5$A4iPIVoWSq$P6M9-`4KEui|1+u3u7Pn$t z0Er3Xa*FVkGZ4fyAlOw_Y}DCL6@9q7l|P5K2RAue@NJIoCPb-!UB(LQD;MCLK#Vd0 zC`Zw7?&f7waAd<3u-!9d0ZKq?`ccK{R@UB4^jj6|bpf(&?>tPHhAU7eBVmrj1in0W zZ>&kosH>^Fxtgjt`1`xSVYI0F&)co--TmXT<%NdXaN`6?I%@_U*g+*sXK3Q7Duz7; zZs&vk`LVQQ4wLiY!KEWH_x{3y>44)%7o_RGWg$@2!}Cf^Ai$7e|c^$rb8I5_A6 z2pYAMH~X}^SN>EGt&j~Hb;AI^)&+(!*k!tDG%h}-af;G5xdo;Tj|&9Y1NQ;5Id29x zkCu_B$+!4vBC;$zOu`p#RV4zUN^uNGg!5C@U!43Za7XS=o3|vw(E2N`$pC9w2vy)> zlq;dqXT^smvfivPK~+~QokuofJfpIHSpFy z@jJrK-6ENd*_B|$`b?7o%@ywP-*XOBwT?a-HBrqL4mB7B%MOyAXErw8AYr^Tyn{V; zIhS>!jQJF;zmW_%$GbZG!vj>Is=`Zx*LnW5Ce8=vp=;&h<)`@Ei^ilLr2+%&2{S*v zkp`#+S&?0G0sP?v1FU+*%;c~>&N1NqV0De^-!;w07Qsr?YZ>9U5lyOxa_Nkd&dH(( zm_}-yO#~j(a};6SX9KrekxzXRoE8j{JOrk(qi_!-OS#Pbm*l9}(LI)Pu0VE!qb+|2 zr}OLnITlZ(iPZ&kM+8kx~`wG{~;9zkp3P@A8pMTpqQw#U+(8u zqoj%HD6$FGl-?qByTq2B`O+Rzv4@itHc_E9px~P+=7+;VVp3P8BRQ7Hf_kp%7S!Z4 z$ADItr-FxUdTi`Ss*L8@@RU_maK(3Eql>(DG)hKkN`er%-NUq3y1^8RMsqT5tM!Cd zKu~g_i1Y&s>8Ejo?U#CQ5U}`ozyiaZP7A_PVw@i+csb`m_%817;{71-xj;U-E-J;D*^Hg2&c>^ zrVQ_sSM_t97fx^n_#3$(pT@Bhi*c%f4LKZQQnoT*Wy8MpXl6@0O5uEci@~gg?f4!1 zuT^xCal37jn|WE=#5u6@GWA?W6`Jwl4GJ@9Ki@4VZzVOyIN$q77$0=J=}v*1IYdUy zB7N&2$mFttBcNR~po~O{o8xAHHPJVN36i^ffiA$;Rc^+ygzt8*PTjc3-rc@&7Cp3l zN@Xz^mUAINcV_ZX{7*kx$0BJIX2p+oPmP z^)=5VZ<6QJxpjjB@kMv!lF*6jMDHQ2BbxFv*1R;{Z0+xEKTc+&@g$#8HXtpAFj7Y& zm+2U@F#S53lmB1yGlg7_Dn5CjDJ2b`Ohb0~XQ|HOL=*D6#+ogId@y+Is<%k^3#<@RCi;aP06+88scGn>{&~BO*{ENwmVa_~CRS}LZ*hxqkgveHZX0*^(M)Hx0uZ*JAsk6h>If4Yhu&lwCBDD{*mXEaT z*0ym7*UjOeIp;)xh`razp?piZ^wOlsJ(}noG0KW_4iro6G0p~*Z!hh$=TthKY9sQ+ z!X264FfycMR^;Yr z2p!apSu^v-uOroo@{YK9llsJXD$Sjs!)08Xb73XgW2p3eH2oyX>FCF&VQSlPboHdf zaS()^1XqT5KUXNs11MgBa*!V<3R`<+=}ku?x$SLL9xS^taDQV2Om*;`S@=+L!xZ!< zvqn`YE{YUt))G$4WN2q|m>9$Mf_>0(n9L9FzU$@?Gv{qz5yKY)G9->rPR^6fXpr1uT{)m!O( z?Qg8Y&!4{i7XMv`|KY!D-+#AC&sSF;efQmWkN&XsE&Lxe`|eNBZtc<9qwoHZtbXl@ zRQ=45cqhpphUbI1?LfFXn{?;5`G4?-*}DJO?Nc%-*!<)_NVQ8u=3@7b6!W}=utDb7pnD63b8}>nWc1>Ly zL9;&A?}}QoBp*K<6NE}nQ56_JrJFl?HXHS47i0Ro<*?qs+^4Dlm*9*ylYE*3cOkJe zvmxdyF))97GR9tag1&xN-W(oK74|y_gkFQH&*=3I7Y`hT3uj{2J_m1)-@HA(b4U9o zjg@>hZP>2x_jopSfmA`EX22rYg3Z+pu6093V~144#hKO!2W-72t?}>r)&<#L?CA6) zp^dX8#B4`mPY-Cq@7{0zCd*4cZqzME;ZgD$U6N*-JQ@uk#S0hgk08g_n+jVyM!X-= z|M*C9IV?>t@YP0$G=uK6J8apHsGM^bc&Pzl#{i_?J{+o!RH8!dkxr%K#G<>Hxn$bH zN=hd$w|4j59_}z#VL!)_Q^EJBE>7LY;z+CD(-d>XpzB02UkgrWhEuOyJ=GAB2b-JC zxTZ9vuTFp6Q4x6bg_w zk`HM*_Sxl}ACVJyVC{|N50rGz)Yq^d#fx?e_N0(UDBn*J3dQ)8Ugl=xT`P8mgXP*D1A^*NoXnpYmGx#`9fmV2U8(N4rcQ!^pX!CvzKp0Qs+C z{j#;U{1je3Y-R0sJ6f+WyCAWg!Whwt$x+W;>j3_>wx5Fk9NXvobd`a29_X7R<5#Vr zCk*4xgRIloY&84Y}$%O-m#Q&L9jedG~c34e4$(Fpxol7To1`JPMrBT5z1+>-A5E7 zE@({QVyF%HG}zRWDXWk*Dtl?<(bk|NPoJ)7Go{bG2HM!<#b$VYwyESwAB!YCmLOb_ z4;ojeK7sQKZ7t#m2i!V8FU(#cs$!ZFei>KXVSMep=(sz~^_h)KFV3$);>e4({|a^Y zvyfO!+k#WnhxDKG;UlULiq7E(E%qvQZ3-hvU9c?^(sSQTPce zQR2{w-HvH;dz*p%p`}~2r*IYQ6zNS;08`t?Np+QiD(|%ibSUjxfAkcAd}KkG5m1+^ zgnBHFYwMlW&gz0VOJ|Q03mYP1Z|V)7keBe*>mCB-*4sBfZSCQO(7JBJg*q^F_xk+` zJK{bgSNG|p`t9Qc52qXOr-R)Wtuc;esAU_T_$CzaMNtQEgSKRBrY*=1wJUT-tSOKo zMQ^Z_ObbFTOEij29S@@&l|*Nq(dM)$&>@VUD>w9OqePNMfq;R2225dFK{k-yqKaAc-lQ{<;uRhK%}225Xmih zKU}bH_Ht|QXyuP0N>aTJG-Kmb-N=kA65jIz9~Nv$y|> zp1IyfVQ<|$k&1-+o_ELSkPGz4^?P<7_R7M{jAD0eTDN1{l<;{p{a5Xp#EQ+?H`i1G z)T$dtJ4#V)w{7ZgcklS*Yip~hF1b_42ow#E&DoB6^78d@XE2``w?u|MUN8wBLigkJ*mgW~{8*ncn$07q9RkJlJ_9bIRFMAZQp6>uS-}a1iNfMTr>CN?$M8T?f|9xfMJdwD8{i-bvbUsS0Z#bc)mO0 z^b)|hEKy?ZO+a`2SNO1T4=zU$kK{33hvOdJhvObzh_D2`5zTPG!pQ>ZCOjD9MBqHZ z`cDqtY#+SXfeT)x)9$8%#XLOKhtJK!o<7{R-LE%2Sj_pGFpp7)L^kskg-SYciMNQ_8>hk|7u(?>|-sPk|a%3wHnUI4wC$A5FvSj6cKS4C_c1|m#bUVd_qA1mi{ZK#r*GJr`))(4%rNlB0S!BCu%u z4qQODL$iB3G*6YY0D_9qWw(JI?%UcaR|3B@&{fs_{-=Ey);P8{X{PO920Bb(I%O`*3_3P)m z`=8FedYyT%hBKyttI*!bV{onFUAo{G+|}!thruu#SE+9G<5eWUudM#tN&N9!_?bl} z^mhOCCy2ez_YaOgq4}q^-rFhd_ng+-2m9MwpECUR-oc`h>GAXJ#Tx$S>sWSG{m6f! zcSFT4PV*#g_Hf*LxL!T}&VSXO0Kt+9FqVL_K%aWvwYJaBf7M@Ql_*??uT?|WT}#E> zg@0DBozLm@>a)J}>a)IeymM5E=W{!NnDpsey1lh`3u%vcR21Qxn?_YfA%!Cnp#nAC z{XRYJoRWVFb?lWoq7J5_BdKP3%QdQ*%`xsbdQ z$i?jR`h5)}_0!fNe6<#Y)yLs0op}Cs2{CH1USSlswkq;J!u(c43;HK8pKL9|==r{7 zwf>ln`q_Xj>E7Zo5(gm+o>eQ>(NXKVeW%sBM!&{qjmG0fVcbRdWrqG0*X<6qt*~(Y zz>cD|HZJx3Kr>c8oAlDaXN4b;r^@CtOjSZ|sRvS{Q$WkGA-OZBd_s&tvnD*L&|KvjCaR4ST?oPTF_lpjq z0~SV>U&Y%8|DvhUK4F2I*#-3|+W6J1IJtzsCTGtY4`GrG+{Unx%;TbaO}>KU(A#lS zQ=g(}TFEf)b%!#Oo-kMPrvie#nawhx56q=7qkk~JkEKj?3Bg{VM|c%}Wh3$)f{8gJ z=?61QomPRH+9t#4{V@ixbVe4|wf;p8MZ{LfMn;+vxt$7v{P*|p`*+`ezl!nS->t6wJO2A$@nhq^W%D@# zyh(pGZ7OF#`Mp_p!RYR6Fv8j^Jm|@}4?WfgD#kgND%0$`*+n+&PRuZwD zb>h0YUVPfi20(Z?&?+AwG*)!A$vv4LxnR9L+Bw-i{>z)4Hot6cH8Ew>pT5ITgyt&! z@$H|nR>;=T_UOH{o;ClYrgP$>*&YU^Y)!Pt+nLIlLUTkJIumz zS8G)33jO*pmECZdUrCj*<+Y@>bMV*pT>~G?0W_ZE<5sUT21XhXH9KJhe%I=?AFjPm z9wg*^EgxtOyTkE$x0$psg9812n!@R5)8^q@VB73l$rIB~PIIg^A+T$nH0>;gS;6DN zH}9A!@mdw6#KD2?2h`wjfmA0NjrT{~v|?|2p#jfBMt6 z|K|Vy6+f2$*Ue`EK(fb3?FmZpfO=PMRH)JtYd6C!xM#=scJ$>SFj+Oo4_%G5d+Z+JHGfVD39b`Obl!^~)SB|B zPK$Ji3VwnDrC!dkSTlu=tk{W>x=I2Zhj8Dw^1+};r}>~IAE&_UDc07(!n-YO^e|b2 zyH^XoQ$Suj$k=s+A)uzFQ^CwJKSoUzrZQ|`M)8mK9~Mj z6Jv7@Qmn5$xrCj%$|rrh^sLZVlzRpKv;5T8e3IA~4i1Mm={4|I$y3bh>#Dr`eb$9l zGOtpcW7=!Me`UV9muF)#_GF2YB=@Gg+s! zdSZVtrGhWFo^f@Uqm%P)fuWH$hrG$GKJ0{D3Sd;*8@CQP%wc)cNz!upqbR1+cXO@N zzYpW4-HuN?bsF^244+3QuqTM@73FL&teDfTSM}=+)9$1P3}cG58L+Z~c0a4>feG)U zWbJiRqB;=Kl2$%i9 zstO+F2{h399n*8n@FNwN?rPDL$r)VWRBfY0)Rn3tHMlKD6iUj7UT(AJAEw0&cu>ml zFR)#4MGGkhJ}0jRKG4-o2gYNRkCusnr78~H0!CmR329KMQhQvy0pK#Bk5y&RcB_=j z36|4#=@__xdM6o8$Rt>*n;WI2!9i$%c3dmTR{V6yYBW0;<&fnWYAH~G*s>HuV2*t- z?4E^HoUXNqllwA7Xws~;&NPinQ`_SY4D_UodLOE$$X* z>@nPke>OF2hf>FjrcCp&)u(i;0Y1P-ma8;Y0#ZAbz<4VlZGA)rrUJ^(jOKNN1-F1Z z42vtu=!zauJ>SxxYj(s?3JV9U-}k5l4}9YJ2_`@DEolkh-4vC`E zkW0NyvE*7iSx!t`vETDa@&rVL7~3mKY2vGF1oB5%@?6%t9u(K1+y#I(6%eX`aP+~o z>JP$92@iwM(zCFx&t!&QZZasE^0=4>eE{6mq&xl`DoPoX*sjmjA7z5HF}Lo?-2L$A z<7-$8L6eE_$p+LEm~eTQuB)L7=O2VY`-D%w9b4^(j)I%Is^(KDcur;6_&rysuEJ?d}a)qW{TkR0-bu5-s<~f{p*X6VgpjL6vq-UHUbKL2RX12&Q33tHN3l8?J*h`~JVxOl~+R1{1ok|evDe<=3%92Y_Nh5~Snt4|)g zl#1AF-xTuDBcxnNSdTEk0$05e5kRY<26yLvZ5OK7yoWvE4M zUqexpmd*brT})MVrT1xF-GGfq65YnjnDQE z4qxASbhje)Cel9q9bZt|t@p_$Oz*eGWH!R8C|F3QkE|m6Tg-|v$k8eNF+$tku<>yt zTs1&Pn38$ioUfX*hi4HV2tZ_=8{ti&SuH}!=(!e`5aur&IIZX23`%b{;`RqW+Vbr< zJULDQ^S9xin(D-!kz55n4HbV}OeP1)m`%C1%3y-|IG$PZ6HEm6!WGd13L}8F?VZ=D z!3czrt>jf27g1p&7^3?73<#dUD4S;8At$}_6Zk0qx&rr9I4HkRGL!duv&kgw+bLI0 znJ!Idp&Q86*{4lK|SSZ0NvtR%W-9^AoxdcEe;bn|}(v+4w!cqd5ekrT`>^yJbx zRGfM2|KwxrPG&4J1?` z2$|@jNUiAMcsoCyzgmJqP?F}7cDIY^_+8hAIYkUYK0CqDRgVT3^f1Nmp5R4X;C(^x z`K`g%XQLBdryo0fov`HRUh?1i(%m&7^2=+UlYh&9%S*hA{VV)SUeJ-#H}r?RFsCti zjSr*=r#S7H1HmsaaVS?N1K8lrhsx>K2QR2Fn4BO?(|Y2!rTQT4u~F)jPY8puOcws9 zHE#dAej@$vY&!V!zgqwM{deo%8vXAhwEutq?W2F|fBzLfLH#G)e02a2FDb2Zhw8?+ z$1j)vj4G&XJR6d2{Zp$w@kc&OE6k#CSh&f%o_>CTr%%x+dpFZx-tO;W7QQ>H*K4aU z;b#`UJ$?y-#r5|u`Df<65-F20RR$!G_9=L%FQAoR3>iUujUTNgr?^ToE90g7c6a}n z{N0{DO&+bblc$@>+FcwGy(kQ~ryb@hsTT7UB_(8II zy}imz^Yx#_QqDpnR)o(^@y5g=rs%0SMEZ>8c|?>;^VH9-O5TpVuSNRzSvu;a9T^89LHX8U4&=|M4FKrm z;4uPB$oeY@dZj0nhd*gDvNy3<%|y%ag1m7tyI{O=K9x9v8xSUWHa+jK-!s;@#8$vN zO=$Bc=@_}c(UeYev6Aef*&&-0D7};vB6lpTl^}WekS6zDHO}2W7Z4_lcLPzekzUVHmwTHAF1|i^FqLN&ygtjH;>S5;XhBFB!41LW%>T2mqzzU{;$cOi1;#P!g;I&)Bou9>v!~w77T0g zXy3nVQxF1g(NgkV+l)?!EEtQhf|@=}zC&9S4*OK^0{Q!i;x>b}efM)<00e835l2cG zV-2PX#Gx&7Dp0A1?hc-*n>!%YIDe5&@EFTwz(s~8t07uUQNk)_KtE8qTG%D~Rq~BW zPSUH_FW_v>(ES|WKX|~4N7Q(M_i4Lo;bxvNl{V3fga$BjK;dm54=EZ%FZyspJTWJp zB^|YjXH4pjYO|6A?m$bmIIB zD_27s=C4>SeNA^dUoki@LvI2S&WZ-ndJny-X|0ny!25P1njHcH`uO{v>yThrmMaC3 ztfMlZlhpM8+pYZ{k>$b{%+S#p)M&jGR{72K)*@B>bvWcP6mf$A^n zR>AyF#u9udxi_Tj2zs=!{U(nxH{98#;rGGm*kU3GN@&8<`EI z=|6NDB5aP9tJ3L;^*Za;G$g18Q(sOBeleoN1=;Q;sRQwUkzuRvso=1IkY{ z)5ap_kEUID${$saAc6>dhx!`ff(^?T<*J9Y_IUHc5Yty>aAnckyjH`)`xAs zS7tiuYgIZ9Gz1(6W>cvlER_XPISfRq8i5&Q;K@tl{@X?erT{zNmPH557p|x^f&)5& z6ACmP@E!15p0-z3__uZVE%t+}1cx{HsIA8th#7M{j(LAIcLYbc(`$U>G)NpP4_?5v zLbev@R=~oBsn8uhcV=_EnIsbJGKUI#C(mbt0Uj&!2#bXvzkvN8oC;=eA_`asR&d2# z&}tg$9|uk2;6`l{Rgot3$6OvAYgFMaZCvwj}hK;?|FwfuA00$lF{#|i6<$SAhZ{aL>MKA#J%VGrjqh7RXfjm!sl2!dsLma)MM1qETTDy2=!Tt0<8 zg;|PfQQ1eVGX?)FFIPAfaw4;+`7LBN;;OTvN{7%e1bjqpWZo(%Q>Mo_U!A+Mv1EKC zjivQT=;!jf450BOz0C5NMdiSo!K`0?J}v||(?M>D#2;h*C$zYZ;4|W5LFyHD08>D$ zzX1Y5vL@#uo}L57Qv-~$_+d@M^FTo=pm|_0>o8y_FP-@wvBHkKMPZ}hf^kO%vIaCC zBLpX)z*U+}dD>L@&`;HIQFBEP#a`B4CB-a=arYyHvQCMz8tR4~!001Yb*%@A&@ZQR zjxiWjaRosURH1l!dJF=TH*5q49MN;GvMJCr5z(YEX_LFdBA1|3bbrszc%w&6KrKWo zwI#G8Mpqa}*oTXJl3Fo~+L?n-+96pkE@-NrLo(YE9; zq!`81p5siX4V7v6SUC(zV~dR;1$aw?Q0>e*KCMRBTlcr22o?^jLw7?{T9n3m7EJtc z1dUo3%WCO=)t=o)$`t`Q!VDbbgn7|LH=VAsg|g3+N;;<>ia_?|!}hGd_F%^8Hey)`ui^AYrBm*lW)rsXvAug+|983w;NZYjl)- zmWOZ{`5F9T#y}?$zlHPymp|&WFRaH|5B)PjK=$>qY(@+Xsg`bq*eZ z-$s_#x^2w&+vuZ`{?JLoj0$yez~)@x>~;oV#R@^PG}iD$?smV z3On@6-F+U|L1#NJNG8PrNPZZle&}-Vt-am9?ra|%9pCxRkAW@}Ad+G+Q~+zo*{M1> zFb+7wOabtF<0_wgXe6!63mC?O#?NWMwlY`s0& z*?RGxO|o&$P|cJVDXxf;WE8=CwDBF@D@qL5Ek3Zf25t##GHf>)xJ@@~LvM;ZEqI52 zww~{8ZT~1)<9_~O_ZaiJ9knZle6?LU-dT^H(of5O07lz-rDO460-|(+>a=K*fS98M z)jatKAVg>?nghLIVlDIdLGs^z zez;tqH`^yNOuMaX{*Zc9NY2nf2bg}&?Z$H%;iQ2N`p~vhg2}IAYfQ~ee%H7z|MiXm zzJo~cDH;+T1uj&9hOwgzq|%qDF;<^X7GAsGTv&Q(_bDrhegOrSf&qh{V3Cig2KnV* zw^?N&pzAR+eciU%WIm)f+F(RO&;vWlC>jMCz%!E@1{3~LG&UR^%m<3d!?2=spKL_2 zr$T13-^$yJj^PJ$RMqKhbIfecLfl=0R+A6>`mBS2H|zv4L~Q|lzjcP-1kRNl>N^Bfm7oj3SQ|<}bc3Vud|^2MT`IU2d=giFhW5rgzu{;h=qkq&Sd~U{O{OwdOGlbk zPYVIMe%8zJJ&mUHZ1TaNCK)L)jp=F1-fb;85T|Lc%c)H%Jcq_7^?44IoX9KskH8`B z79>iK$GDrA^c5qAIQow~Op2^eX8~^V{9-&zao0K5`)ra1q|Z-(->!4ojsZZ+v4)g* z`K5d_9iVXs{AvlKC7h$;32+ZdcM2!7S4uo%zmTG>k8k$4nL_rr&CmKF_6@KQ1X-W- z79W1zaGS)~sg@t0%Gt0m6TWgOc*MF1L&A7Je^^pE2V=*T84?qcIQdWup(IfOj-j2}Uz-3geJ` z7*Wn+bc+Vk$+63{@6B;FD!DXq)fo#cUmIsQf2e(hN{9Rn1#L}F=->cHR$cJTIC0ph)^Al4vP<+kXy zPg6c+#AOgrNTtHV!u~Gl4$&|0Am1RPxNsU8fIh-x$3%ex|2Em4Ga(x_+f=nFAvmG2 zfoM_(QFo#Rz64Rn?qilOyxCX|Vb=)sLe5go-Ay6$E6MIae3LOFA2#anT?D+8_gkh5 zq}#{by~tOiq*GYYhD=_ZbPvARArT2P9Twp*;%`HreoXQEl)9sfjOh$ejf%D)exGCb zAUPcQ=ahF^(kM}G^@)j5X3Wk|J5IMT&RijdV+`}NtVh=`b+?98LT5^|247BE`)Jo+8kLYVE2wAd z48BZ^m|6iUI5*aO10v#rm>ChTkr7EZ@MuF5p)lv}(Q=v&hlR=chm!)75TS>e44N$_ zX(ui?xe|c0(4Fk(qvbL-7nHS+LC&9+{y}fRu_MWKd74rXGGJ4adC6ucDe{U@rg^@C zXiJwR&04j^(^B;PNP@*>K3y#U{9!Ffbu3qaC1q-jQ2EWI{lE z7;1Gz*TDAMn;ypsT;YH`WgG@tu62kAW~Q~aBUFaj$r7P4x__U|uto#SqrH+m*L3Hj z4vDpzHe@OuZLw=L`IR#Y(NFW%{r8`HaNx2X3O!wiI z1oWC^1*z+3W)g{j1XWlXO=P)!BJ(C1lwAg)JIF7c;N;qt!IIQIK8LW2rX}0 zK0}7|13D-GUH$RZ_Q~%4c3XlzJjx?t8SiSV3UjoUcqSw;-9ms+jp;!?D5j#P^Qb6# z##E5e(s{#y=v-5-=^U?cyA?1iVtKn~z*((S;yQk59=?AzikETNG%atztDSw$+pCC& zW1KO<g4#~?e-5lFV_5#@C`OigLMfB8>0S*_)o|9yA3Td_oOAvL=!o6x5zY~ z_0H4&nz^B|H8ST!gRJBb^LhIYO93Kt*26teXbJ*qs&Mp-LQqk=Chf#M^*oOD zVTx6R#8i?(-52O6UBU;uX{H9=E9uLRgAyhnq?figw94eZ3Yv-CjWfB7ld zg3fvy!PWzgH06cu=$o?~X`&f8!xh#%xvG*9TO`S|&lJh=xGKu%OuylG`97sjn;Fx| z_IpRW3*V?nKum1Q)aO_J$8FneFhW$`Mn#bQUlfwgy8FU#lg;VXY+NwHk~l&K9ay?1P|94h?Kwid!J-O016i`@ zP-~jY1eFbAPpA2|)q9pWL7t7QK}iYvkJ8#Xs+v_2G)t6<;XxDV0sx#AUo@SH!3w?I zexJltU6a=*(S_ll+ls;4PEai|fkB^Rp{kkgqZCPU07tQ$OufVpyR>ou^x32UxDG|j zLa*g1yg$p+LW?aCH-R&{%9A00a0t@#mfKU6nI|c_$0PVg%&5qFQWTPHP;$)CoZ5_2 zT{rP22sc28nS5P1y&~%kVwK1z+5;9*O>?sU$FT-_{}n#6rZG$#bQwT6oolK#cRsN9bR2a4HXOG z(nAwe0s}ati)Ze!(eyXaiuRxQIC3qV1Rm&Sy*}R-hL}Nn6Fm8m9=_b#+dKZ@@ZjyM zAM{0J4T-EBv1z5o#8I+gI0>wViFB-=r9nh+=Imsh5yCaJ!V19&VGRF&o=d&7({2Gr z+*JUxM;_Z>ln=Ve6^CCiRbZ1RwBr4@uaCE09cek-G7g|=c#07+8}aO@s=2pX6II4o z4Ad_zI~AarsF)kEGc_8F{!uewL!FrQrH($6gf1m#o@JV!rZCt>lB3wd83l6Bg!;H( z=&!E&B~{+tAX_)wGyq7uXt3@p*m)pa;~YCI~>%1^W9x8NZ1?m4`(a22X-R9XJ4QA81s0|x}h zz^F1ej3eld4XH3ni+)bm_51G?>r(TCcBd_=SeQu52B%BwNWy+@9CJsr8jG~z5+oN6 zK=hMXs?tp1>|T08N^OvNnXO=p6-!YgD2Q?hI3Y|47H@=|wupee39cp5*zIJP+}%-y}y{6!IXQzM}Fh*_7Jv%{BD_p7^VYJ zIr)G_qn`UxMaCEFF^<{9o_=**#x~vAYK=C25yd$h`$hN>GHI2nL@C59JORW4?)Im;2RD=%qEzN2G_B#%IC1#icWMz8?F;agnAQg zc$Tw8q4$A}0PawQ9GEaKYC2RKTZXm^PPJ58F*9FRG5`j3B3J1qBATgod_d3A5vfTR zkn}4J2)8KsUB)$|?Ix87ouy|BD%}HZE&(sn=CjR)nGrY@H%4}p&|kAt!an(!W@pW> zGg7b=K!)d7o4+2ZxBHh}j0cw-&7QKl6y<^r7oHO2udrk*^zAiFSHydwD#6PqL5*s}st1~B&9K*eXJUErl z5vKs+#LY4as)j1L$CSr_eUV90<;^L1lTi?ZN;DFCi<~gPMl9@`N$VW1TAHJJ7!tQM z(kY`)C`#@l&26`VvBK_%D2kAaDNa8$^G41{jO~GInBj2LyUF<>(F0;q(7h<&Yb)4N z@^Bhu^d)710>^BtFS_S}z=8X`^>k^g1G<~GSp4iR1dN#ls3hLe0|R84HZVZ2*y`-e z#$1;G5AybrAU4d-4c~TzN2tzuN0}yp7@~dnDWj=z%D&PFG2J3s4jiBEE}s~C)aoe3 zDDk`+!(bkbaP`$DtQ^h;1M63UqL@f4{TWw0Mmp>~^^z7Bdd)7z!z}eV{Wy);8D+T; zh)6_x+E&8ks1h=GmM+n(h%~1Ue z_SPeIMsyp>htX?q;y|Jkv0od!+Zl`FVpwU)ffw zR^GyrMlO89yId(h;PJ4Mv_>O&xH@1LLC34Bd7YSQHW*uQf0v&M>JU9@@K8b8S5kup zPr6jymyD!8oS@}|9>|Rpv>ZuG69XW(mLm%O$}%~;GF}6!Txske;ZYQ1^8oK290XOa zUd(n|;c8P<`59>_PB_R$Kvyd-s10)4gUttq+r90lMGq5f1H(dJYyl!6zshIJ;Z&iS zOX9VTN^2Dk0Ghz3Fl0$DQ-pvgXeLz;^`8_qkpujV`zVe%D$!cU1IayNqvy_DU`L=%@Q!orpUe5T zQJs{kU%XR~G1`R#-WGh+*6Ng5AtEh@d&F+8Es8G06Va0CBa1Pe^v)-(f?-O-b&}?X zX1nbY;)UJB%wN;-(sp#8`Th6Ab@i8k4|m0v&n)uYlb&r2d%$`O0WC_(dI5r);DV!X z_xy+LSS6Q)5(i78`FdNuvS{ph?!>vf$+N#%)WkZ;!^CS5 z9wzGvO)>8UyknGCN(Y{iTSpo1)!id9>VLk|MojO#!${;0;3*q4nOy=|TS0f2>Qg;y z$B;1NR;$wBGMwh<*RYbbekQ}Bd4?FtK`W=Tj6zIUrA!pIP%Ag3>=)xQ-bQfaa3~p- zW5uKx?5Q)zDCh#!b~p&9aw^1%&e>3#2BOW_7OR^?)2rB|H}rgIFn^N<%TJ4ZHtD66 z_YS@VJo#X*9@;{wtX))JI?(GwaN(3kRHJ4*uv*%%`dcu1IA!gQ`;SfMeQF$kV+02V z08en6^NsN>OMo+U34BorGSzzx01&TZ1?6BQ0IY1~F_v*p8R}aQ$|8b$?m@@hmR8qz& z$cxNGUX4}2w{D9L^oVn@0}_+%zzD4e(%nXLH>$!mA)ZOPNkj?NIwl$`N^1^ZqKYCE zr#5CM9JXDLv>)1jHR_oA$N-$X)WirMi>@&pu_LRE=glVCn}iY0AlX7kqCUAyXfz+E zKVokjakz25#;R6Z5p^2c7}aw}g>2(<3?C;e5*w*}WFa~8Tu@dp7gxycMJ}WeKa`Dn zD?Z}UIQJkTv)BXQgSXirLpxN8u@JJ{z5VdBlpY^~u=VB4v)>;=s4C+HKV)d~f!;?63Ik^$Z6 zE%Gp}s>{77oG+dUs>&+)VKCYh7@a9ge?)x8WgYpbx@d~^OSLFlFQZTMFp6koKq5moZtq{{ye8-9j2K>R zpX=F@FeiCLFrl@cP!gGk$<8mwhg&B{$6MP!GN1(VfUzJdGZYjAM&_mr2@EtY9wDEC z24NtC*Vwo)ed7vdqdEfFEZA7~tgG^>b8<)l1nsa3M5CS3U~ju66QSvZ+J@Z$I8!Y-YFilkx=x zY7^GPa{eHZm8&8NqOK%)YS&p+SDSMv=E}4qry(kJ-LB}m9d+$hcMVeu1tOUC99Q*= zau|g-iv!WQ@49%Rpc-^RJw%;{E-SZk=fW;7v>H>u$_03h6<;j+iRYWU+^5w{A12BS z?aYNY=mNrXS_nck()~`gTn}+Mhv^u2?*yw{49R(1>^y~uh*q5m`U*PJ-%8T#XOkvd zhcSSRU9vfF%_OXGL>5P!+=%X_7^mdy9h<205of3I*G*SVr#RhG5}1-zYECGGq@GYG zXqc()2-X0gZSY6?Y9o5!LnYnEHY9p@YBsfQ~*gN-LSi(%Jtd{%`96?u=szee^TUSoCE9*UXd9~z@C?qo;^D1J4ALjYk zkLu{)xnA5eCrNOIG%n0~WojQ#%DWn^AMBLR!NA5SGMSgXPwaVgUZS2yWe^s&hli@# z)2yG0I2%+SGB=9%4o(EC?!iBzrpX4NMJOcXKl*V z^CGr3EoyK2csC4oo43`%*=CXJwHRo|^hVezS<;>@h86%J>E z12eO}S7O$KK-oA1Tv|AQXn&3XpFaXgDvC5#J1nP?r4$p(#n1sBo$AsIIcJBHZ33-p z<)`C#?QJ`O?eYYA3r%4A^Cw_po)e}Py8V%4SOYTNz?4gL&Vt5rU&jn{$C_@{6VvNNjpNp`^If zxNs#S1?9=dRiH-9B=YM><;5pgEV?F5TRQDv^*|Q2T<5 z^iiD_HSJ(b*tkm|B}oKWau!5gm>a2`)G1pgXk4d5$riQbq-V_rl(|%7BrJkioKuu= zbBW*ta!`|Fgu@cCK7dJuzQ7b_vhfo1S%#{k)=T4#6j!F5sjQ^vf3T&S+-*sUuyKy! zCZ#g5nS~tFlDP^8asDB`4uc{HC7avQSY=oWML-K2uOeV%{9181ia{1{QR}^o?=%^b zbtXl;xM<~99cgMkV4B#eNr-5!b&A;K;Y!J^qz55=6lu%XDiL*PBLLuH5z?#dsVTL` z8Iw7nH&2=bt)?H^E-fsO5LSlZQWjVqfktpgpJJ=y1#xa55>J(xu87TWs6uZX=AdtH zT$Hwq)qx(jgvpc|u zg(4$II@a@RUF+&pMdVg`1b0*s??|=!uEMZj9O=){R5O{bV6JAM8Tuy)Oy4Bm>H)Vi zqVyQ2*_k=!LsHbjmi5z9QT4sr#@{0bfyA!8PW+j5cf6>h%c}6ujFc?v_*yTVqCkBL zh8juvRXX)KYS~YWBT`(x6`wGmDQQtOOh-~*Me&zn-zjCcE1e$t+PZ#cQIm*E&7vC8 zK{hEO!eZErX|5kouF{WDlT}dJv2eK+IR!bhophBtk8xtZavnoIwOsY4mHVPMTDs{4 z)|d%WFv9iG80C|T?yzBfyZO=yGo;cUSLQiwP{W3fIXAu)GZ?p3(M<3K+*+f_^L;iI zA5;N8ws(__lVk*G{(__0$IG5_r9~%|-U5DzDSjXL{THoSU!~3$C)jC}-)Kp~Ju))G z5m+yk*QB9dZ6Cj`Dw|l(kAx1s(+hkie_d{b7#33xd|jYbF2B^unGY^INr>&5&31ah z+{`gmV81xMk$W9`9KSw!we6gO?~U^5MQeItnF{p+cGbYVb1l`y?M`RKhRE=AjU$cd zq84e75Hi0y&+`wS!-2PG+a4!keZ=246c6~#?_~2ne)DQu;+h4(QaMdNZ-@8sRt0Vn z*R#PFh3fdBw@*x^LjVZT|FiJ>`|u$MAQ!57pMk98tDyPBUe)~`sHGoUs!N&Hwl}lx zW$^!)(wbn0tKHr`IzEB3X>|CL*~kLjeVO}gGK!9I7@UN|@{an30?)#>>Hu}y-U+!p zkq4W}e}^-n6o50XC~YUx9o>*hzj`NV|HGWkycOQC#QVJIkRfc%o)5-NU`VQ=59#ox zC3C&UneGpMbf`*|euaI}IiH-I^_~TC?#{_ocQW!-fw4uyU40BFt=m1$$At`Q30nDn z+eY#N@JX*sIled>(rna)2ButJMb6dHA|gzsljVr=Ae)=Zc|s#y!rpviQ<4i?+b^J> zS&)a8R)uNoIi9Y1ZOjirGx(o0tXt!4i}RLcSw*-2Gc~FjPL3^2yeUmF8m*clmO3f{ z*blsb@KC}$YnW{unFel^d25-Um-5<6{vB>}wA zoBE{9_G|PBmjyeX*GOwkcn%$!$Pn-Y$4;~&4y(;Rt@}A9AIG6x!cr75Cmb2>6QWNf9x)FGRAZPrtwXg6fsm{~r3WC5GFD|% z2-z8i!;iUIm2|0R$&T+WpwxieLlU!lmsFa&|KTkQkD=Dgcy3-)Sio|DHtyyO= zo3uS!iyv;f7tO%5V7pZ4BUF^IxmFidT)0yZYA}3H+#ual<1FUfd`SYY;>2kd1|1ZW zXuJGl3)IRBf&@$~T{0osBtHY?4Jaw#As5YxFFazj$*FjXp5qp6N z^kv|vv?CP*4CD=T@$foOEuF%c7u5Q3Nr}p?FZ4zC!38n^*`?EY1WdZbVzZhEv(x}j zVeLx}7o+MgH7%S_!Yw?w0Ip``lzG8lj-8T-XCc=@k7uHOX?M~)_hJk{oNhHNgJKhH zVD1Ww-%)u6nzX;n=M^Lo`|icTy==d zi&%~=xN5=!ml~ENopV<~MTw%cZASd6&|f!F zVpNK%3gUMzY??Hrt+Krh!l*$;apO^i1X$0Bb(OEpdIAp_3>O+-6mIm33t zxB3dvJ0227`&wE6`KqASz&Ycnj|%TuMMVMw{c=r$?(hl&o6A)Rc(=+&gbRuo2sy{w z04ASh?fV!}6TDw4$OcmlYq>90lGbw{aTnRu-NAN3Zb$W_L@1I5I+@d<(L0?SOI^;h zln*pl|MTg(qB2NSO|^~5+p%-(4bX9U9yuL(_e}CPva^;HUPYx9+4FHmer*Rn!Ktfq znN1`~`bwMQ7*ie--5*>kP5OdQJn07Ux&oOMkza&K5V}~wDEqN1^wj0pMg0!l&E=%7l&e(J(vp9LD`OZ`bSkv+3U2}JB0GP;ws?{~$0iGl zxyAe!IW{;z zwqD)s<9z>*$_uvo8m0aFD)*=)XlG3iWw-oaa<8hoMp9V!HRY_oFwgvbDh5A5J6Fub z(-C!1Xx!w=W02LhHfQ+-=1x=|lfXV$ad{4*Upfo$cc}cle z;qR4=h+EqMLn#BtF{PI`B&h+C%#me?yOZ>G)u~|#BF3l6UbX0bWyL--iYi82@ULOZ z%eR^;{PL;tS-~wtK`@5bbp$$g4>2U})3Ufn0;m^Qd`w^{Ux+q_%em5vj`OE=1(Ccp z!6jf<5z(_ICRzJN1cz=mGKF8Vkjx?$%qODr1UM&wF1Y;aDUC`vo|i9z(*0i{&MER% zZ---J1n%MS_Y}o2p2+#<(N5CkwMJO?gkC zF!7=GSQv=%lgG@zE%D8&PTCvV0`}`MT?*y*b$6_z_EF`OUfvz1MNjV1i;@zd&P;P# zK^SX1MYP$BJCZ#mEM%-LCGGi!DH@|?WNOADU)g8~Nt3q`7M%HvflPRGWx1N9ZWLqb zN2Zt&qKO=qzY-`knrhOpM-B49d=k8pfv&Ju=5iKh#1*Ly^KCnRQ+ZI6N+`_AgU(Z> z4W?Wr!>W8WCX^7)l>K{}$GbjuoDAYAwik|Onuq+1^?KzKJ+|(EHAUq4o*8>m=1=mt zm#3~7OS3A=RJAn^xI^rCI+aZdtI{4E}Z7HY) zHo)>!YHfB!G+h=hmZhAUP8$YBI6qQ3B&Iz;L=+fP_!VXHFiyHUa@Xbx}a+h4E|-r*}4EWq0&at#X_eCeiGx2njBJ$G9wKolINU^(IKrT32E zIJt&E%y7~-3S+q#^(A@{=X1)Nr-og!m6nY($7(fE86&XQI14X+n;dIO<~}v{YJx_i zaWuT|h7oE=MI>^Ktg`QuY?riix(22(RO7=8-68 zKqilWJ+=A;Bgb`#^dVwpMKE*)IpN=`sKMPi7eQbt3vL4d=atHQ3lWUcs<_SVCokEo zKQec#2KG*$3g{2$rnQ;;_-gy))y}?r5ibv6W+cN=7)C{UlxaTg4pDhmxQNnI)LG*y zF95YM=_g2cFmH)1z2(sD)VV{vMnfW?IR_mYC&#WU96>{B_7Td`$!@{10#$g>p}Kd` zc_Z=4R|KMVQgKbVI6aZZjgXHa^_SRU#|BojZIXM8Xv3mMN&1Xt7r4O^MYDY}AxO{> zK`@?XQ&gC?kby$2W!vRiV$u{>81-5FZX3<9V{Mlxb25zwk=X%KcwQyU^~97^lCL7m z913!?!GK5dgvN^kq7ZN(i18&>n!}dGnN-Mesro}evAtW=PX2QoAyeq~+1Kaswe znz*5ah7j1OAS%22+ciYRT(|6?=L?!pIS0JZ0M+pKX30+!J5Z~txD)QQh-0WU6>oQ* zxE1U5{idUkuGmLPMw}A4G8$Yx>K>T`Z$m{4M?Kx3F;07_VlEg(h#kxT_pO^pMKa+E z!i3!xrAv0|{*1=!HEt^)p-{*z-VM$x`~vW5VrGiTC(v9aS>GsGvHE7qg>p8@f&ar| zYt;E-Hf-K6dzqzEdP`rdE!Dn*4vyFa55+Q70BKRwafh@y!R?lOldP?-wn4ljH1S_= zS7{M0x_=ASCDtO6$js9#^0aQ8Vm52{w85Dbmy(|;?;vM&24?Dle2lR60_)mNGjs@^ z%z9Hw1kY*l@*WXeszq)v;8eo2N>J&r@1cPn zUGHe~FDQC^VEuxQm3Ffdg>8PEF-h3r({u`~QN_W~TdI5pxu69bS!aBUv}jrFaK%P( zgUC+l)c6LzsY<;~mkHqqY-+G*mM^d?=Xz2uzdYw$YAWkEjk7%OH!QSTXtd;1@LD+~ z0d}Y0S{?uAn?GCsF3Aq*YIQ^3_KNya86rKSnm;)rjn<@^vru$p=faVc8=Xj*@5kY=toKGsVEOKm=zrCg_%^@uM2N!dCybnr#%b@G1K=sKr1-W z-4URCm&%{uSdQcKc{ZGs=F)7mctjMsZjvTb?q)lo!w+Zs`i7WH*8E}EUo)WbO|okh zYKR6_&Dc{zg2EwjVRyXPR-0_-y-2$wQxBku9G!NnBGslOSktxgDNJj6#dFY*D4aW@ zmV-=SJC$C+?G`M>4#Vz0(E^+z*svhcwavEosteIw+ts&n&6WIh_-6%FnS&;^BuTZW zdH=?*(06%aA@&gV$N%;8Y4XVVXCXx}z;eqivD`K{L*?Q0LF4X{6*j=79v3z3h~0`p zs}mh)(3Hxr4q*$4VrDfSk)7jiGP{Z zlB*)+3Mfpd$-q>28h@Uazf7~_OfZ%-bl}Y%$&mHZ>SUsp$zE&ZCPdV z98R@n`&?E_Si$a;a^Q6k-z0Ad+)m_>6kSkw=VxbB!-06RE@t?raOm!|cG9FB&DlQW z@0X^cVN+7{JfZ80PX*TSz8(*=9^L2Y1D9(S4G#5fVDg_v@{e?qZ#aXoTSq^yI8i0p z0VYBNE}96beB1I(Q_bunsDYbu)YmNCl3$uC-M2Is6U!$Ajjl?OGmYl#db$KE(m`P@oRlU2&$5DQXI&9oo7Pg+yC z)p()#oyF1;ck7c+B&F^Z~xn5jUW9gP`5nTzKS} z#56s|zreG%;!5?-HNn*y9@!``GQ5^VZ^rD0Ii@x2Uo;n-Dr_cfEp4;m_lFP-8YH=>%H1WE(LM% zOvL{G`4Go#Rk44igzrZ}>>DW6H^^}ocUlFq(ANjQj%@6PaI;F+naj0|2g+UNnWWl8 z&%ELswT*D1T1|Jw1C3!l>NhyZo2|D;J6kXQ6K=`Yiwxa>03%R>^6kB!-NBEKjg$uu z@DAv(pwEuHR5p)a1AjBpIpVe9xb3V-9KC)UtDX<;nPFp*zZd9oF@ZSo16Uz~7o8(GwPSYVgM$^QXH;KhJU!XfjSVUA7D76~mQ*&9azX z^&Zoaxd)*oRwcHMUkAkCgRVpxp2^bu%%t#GbSb(*>oNx%th zz1ii?VTECo08Vr;=VEvbmGfE}$I4}l>&3nMmvyRJ! z(<7G$vp-GSiA_uqe$ZB56fS=5Tx#k_ow+i99&K(L%4IaG&OcBtYvx^=x}jZy@-t9H z`XOv%ua|Nb=D-6*3$`iX$ki;Uuw&d&I?8#I4lB%BD6_Nmbi};Rhs#s1iY5|NU|Q*^ zv@r~FJj0lTYO1>$Q(fb(7NkZFb{&C1dA4X2i=VDLDXSzHpk|cHU1fyokZZHUl_qeG zGY#fze%AiF5e#9i+Se-QzIc0sEySW&vO8`nLEW0L;8t}7wDMT8ZF5FyN|RH z(=NVl9TljkxOF=^3dSi7K02Y+y)NK?%Y_C=-2x3l^+BXTB?Q&z4}oQ_sB{pyp%c+C z7l2qm5XFS}smOz-WU{b}2br0kT*Dmqn~$n-he=dp5X?-^CW0N@1y1?AcD6%K9A&yw- zAf;|_2|HL-EJ-1@VZXNOxGf?lK6zSIiBZhM2KZju&QIWnV(vm_pO4dvka@#u--YBu z!wOg3$b}z!B(72-^3uLeuhB2EbfQnNZVh{!a``9^yP$@Yn#Fw88;Q0tO1MDPRuiow z4TKL|)4!{$?bx3F!)nmA2UPPeNGOJl{f@JA1`{I;veslV_r-1kGoai?n?5F!F4^Do;;ztHkJXC0~-c&xP_NY~I1 z9dIKQP|O+~@f4?i9!eu0B1h@lX24CuDa;iMZ=HyXFNo9W-Zm9!TRoRbhUwP1kg?O< zUbjsET0i#H*YOBQNP-CvFGuB79Vrxz2iYh(>8rO+Li*_}ddym(d{xEe8bYA?l0k5* zDMDhVDKt`OeEuPzjFQHx>RWChr99^?QVG4>-G}=Rtzz^$B}LpmI69tVvhmbeouQO` zRZpPW!FIlrLe&m@tlNpj%50ZG88JsjO(k)StQ{4{LUWtBveuL^oXq#UKFYSwF}_Hv z=plM%G(#Pfap9=)`lS~I_FFJB`#oq*87_U#jsd$w)A}plg^bE_-=q_e%`VukTM)nJ z9a>xrDC?v-@duo8s!s#*0(&!3Jz`CfK~xrxe`7Yv$b*w0+}L34UEuzJHJ-^=Pn8Kg zO(`iM)tUNzRx@CII1KR#hD|sf8{-n&bR?A5IJ38XXew@8q1DpZ?*s;xWuOI0;=zSK zBbz)+ZDWR0+AnEc0bq+8+ebX?#SG=qR%}L*SC}qF6@csl+Bdc%N$#uiS#2Srcn!*-#`#5#DO5+m+AG&XWcpa6g+i(8CNX)?e~gyVMV% zUN1Zvtd`-uCSJ#&r1ocFVACS|UnP8QCzl-0W(m(p8_sB=mwTcr_J6koKU%TfRh z+GKJmp@`5}iVDR9&#anA%Q;I_MUpTqcn4|q6=QJyg7`FX-Mqb}u$!*P^bFIzN|yS7 z`LdcGO<=0&0oA>pkW-x>s4_i_CWsr_{hDwRDJzc%p>%O)R1-DAiG{UZ`?JHpA^$RbXqxo8azYU9-rC%_}NDA zq&v>=k$FPJ_Tp!G^Z@0s=+RmHV3=MC{O1VO$TO0@>W2<&*;0a@VgE>P+pd6vwer9 zD(Jh^Nm#&=Rl(oz9$m)r!2pXK4xm*h8DchgUBnhJc)bZZqO(60dc;p)+WAETh&^TQ zOh-;tkvX@k4ULYZM(})Au#XmZMj1v*++vOTw4mGUk8ok!<2Cg0BFj$5oeV~3TZ~5M zOTt~ve|IsS5isHKWYY`*nQ9?+x;2Nuj}1|>=a0ii6vQ4Mro$V|fVkD~PteQp2+<+g z>)v3NrbC%1r=e-V)W|7z#3g%(8x^w|&4=bM@bC8fr?bJJb=nzsKx+LJ_Ut!OZJa=3 zHOb-M(-sJ9^gcmf(BAl_bqdHi?j#Q|NB~;Erc9C18KcF>J=g%bK$+ax2>q5RQzoVd zH$bbBeSkliBsjTuk5Gc<0eNa|!suYQbDiuA{%YYmTckvFWC`c%2WQridT(ilT@hqt!IRbiqVQo)D-i|J*0UI7$yomAmkR*M6*tre3jsfdRD z8|Tb3{t?;nfv@om+>IzhkRK#=oRtVHG_ZulPg9Cn?J z`mCiOZ?&fH-fUY=&&kXcS^T`_Ch)jDt+G{w@PRh!1?yZ!0Fyv$zn@^wWv5DMTNOa? zMocUyicy%AnLC1An>C$%&c5fN)adH9O`GxzId>$y=*}Y;ju1fAM(+dp6UIDmcp$vT zp;Y}v#FSt8rNIRF(C!J$cYAwlPu=jageVI4&(wU4?uNUgL7ptpcEIHTShBrab=rK> zUKT-IDzdWcqjjdsIC1oAL~-PRb&Pn+>IMj&C;VM}-~z2SxrsiPhA!bHJesWxSK!8T zha1|DdfCH=22$AHl;~8~Nw;7xsAzQ@)G(dixEnCUX&m5o5ZbBx=WeCmeY9d-E*o+t zrtVTUg9^I=gn;h|i%Dt0;&Fh{_&z-F`WRovexRl>Qf%XZmiP#M^Q zH%vO29j9JFK5BXqN8XFAvB7)L8yX^4nAdHm3DM)NZHBPM%B@gus8=a$-He=)K(mMg_&q#TsV zG@LS{Jm}L+;JHIMVFV$tVry${_kkBDKofGJ{v>l89>V`z#SUNj+AWzUz^~+%qOZJs zyT6@y5C8|gT?+s_3OrFJ^ie79co`9F+}r~|JDXsbFah42AgdluW37`^Yzx)EE?uPG zEGe(gk_4`)J8{*h_SVpM8z1_+^pe!k2-D|VN4wi6N5@;+Kb{=z{&ffVGZO3gQ3nO| z-iMzM%lSfu!KSA@$r|m3##eD+?)f8|I^Dp*jItqnB^T?LEkEIhN!E5-jp|=yGWnHT z8rFA@X5#)hp~yw^7DkMxRfZs63_x+%RS}o;07t;^zmpQL5U~@Mbubm?rPBSjzCz|) zCI$=eyhd;3Lo~<;9Vv&?Livv>Xu%K)r>3&~O;pHFZX{rXYVKss0Bnrf_ze$3{Outf zwAZ`)yiwAD;GmpNU{k=vI`b&Wp2NSo`;%W&VIq)UDQMw_G8j#hn^Z2EJ(~7SVwbNx4QMcz9-SYeIWqYUPZGr@JoEuB+ndp0r@4z*S>T-Z zNkK#E4z#fY?ue8x?z3gfcQ$oS`U_cZ@P3TGNuZEAxb7j*gCCf;mJpfgIb+sd939X} zf;a){2$)IW@b8#LAMU;YDQD~GxFcXSAq($ZgV$TT`&`KZ>vruqLxr7!_F8^Q8&cI7 z1g5q3Bx2Wn=+)lA^R2z3_ndh{z~AD3upA75uxPspEb@IBQ$B9M7}!^+R^YfhnYtJ( zRt<@t#ZAHiryTjZELpiwWT)G!D4Xw2;7c@Uga-6>Y1Y5ZrXjN4jPptR%ZD)Cm08TD zmdFP9=gknLDB!;O_i^<1FZOQ}+O_I(^a9&*)^mV&bPZ8Y|1f#&ym?7^@?MON?tRx33L)Ddduj6CXdFgg=7BDnOYDy26?~%8ulm$t?cOu_e zDBn79S*XBF5>GGPMWDpb{7rPriKNr3*_fnRO*l(mmeSHLyhaJB@HVDDt>iy1#^E>4 z^ZY~k2^t%Sq_CV>HF^Q|{)(LwE3_pQzlO`kj2( zADjG!b|bJHc6w6b2DV7P$9sxptUXrax0cxM(!tKCdLv&|)Xqt66|s=c^@XCbHSmrc zt*lq8tv2UAhGxLvLq=+=z87bsE3`B^ZqbT*#8(q^#*=(XrdK@KYaIc$3jx7|ZK%r# zQE2|^bYa%H!FMx9m4+9Hf2_QHaX%#T5OtEl1M-3*##0%P^8H>43HO@My;rRFY%QU0 zFlA58du=q)&ib9eYS1xVeDo6C_7nws3LQTfQG?WT2HQkMTSW~j@i4TdfGnU7@HtbVisUw@HvJBdHAZ&NRS)Qndgti#L__Y`OUv^S>xHm! zz}mvU+_yWnTEA`t^wx&^0LQR)he$snGV&R z)i-5u2-<4)Tf%$7oX<6#^-HE`M5=ghD)!w%&a6PN7TiZ+n6CkgD#qmNh6K6kc@K{nX za7Qm1f-txi`t0mEk=itggzY+6o4zR5k)RaYs!!1Dr~@p!q1!5C$pPcpRojYc@y_~9 zbNAAXV*wmsu$Ph*x^-v2YHHWg&m6%!1;@m`Uke`(Ne z&H7sFqw=}~=D;C}rvthW$ED&)9KyA@GSo{M|5Pr%>KZJ^q^c|5&p+%Q@2o!GJyyQB z{*I0BD&rbfx-7Na0@fJ6>Tu0aEqq(VsXV-d5E_i&t{jbSOs-MiBP+CC>gMBZEkGnGLv@l4mw_V)eot)Lfv~ko#`cjl zx%(3@Z=KCu0a>na0vnx`H5Fbqh|*j-y#;DGQK89VoZimm9A6!_D7@OHG+wHjs|sRq zEnmM4u-=8A$m^ryoj0oOF6y!~>R>zjuebj5;Lr}~)4;khq1Em_wes5kP0{@$(c6Ff z`grTr5i9!X08ig#?=4Xo5S549u6qS{dvIMlO_xL}+H3kZx?@e+%1Ceam}N5&&qHb1 zXarm^>zf0CoW>>qFa5?o+gSXBrxZ<)QN5m%{tBKF4MSA6gj`A}?N#$md= zCE6*|Ec@MlcRbbnoe0qG2%W9f5}1v~=-Wb#v#$#)L^ zy1@Lro2E>d z_AU+rjO#iGU?PvI%~1bv1009@uyzt?;~UoY|nCM!4&y2{UnL(-8*)CX0F zMDZs_dW#8at>ypth+8eu?$Gc1F?zni&dJiaT_VwdCrIpYMsA=f>GupV5X{7_7tACD zDZO!J3P!oi*C|IMZJ6`&TVB>w2kIDi^uxj7@gA1eku)~v=)@Qe=fg4LZtofC1A3Bh zd;(hmC18SLi9ATLMLN;pr=q+(LM0>Kt`tWb4C8di&uj=0IvdE{u6LkAfdI#>9mVpCNR)Xci$;W{qz z*`$Zo_^O37u!`GPpKZ(oL)m||1cPJms4C0#b78(t1{$R8$7)$Qlg$6tN;qd7A@Nwz+-u^4| z+!ElCppty-NQ4bIE481iNsUEseNaMtCc?w z@h~AG-!u`ujG`NY=Q!wSUvp7vQBkXcEzuYfl91Y#?ZqZ{K40>vSC!s@#*-yQE^%F% zg|k$Riu@JaU09e*BhGPAbMn91E_sX+U#(EN9o;&N8I{=PfO{*_(Fgl!(X(i0y3fNt zu`gnQItpRng4)>l)wXgYW-@>oE4Z;1(o69bcemi9+tG|I2IV6N4rs;9Z z{`CT_#IzSRt0opNP|x&*n+NEeX6P4k>*fs$l9BD!naO97^?#xtht^^}@!_+|q zr3BMRy+Twv=Ep$1QAhjCP!cz)d`<&0@xB>%(HW#!Xm{!*XG#M@sxYowOmAs2f?1%I zw;>IPpI)O;_et++&KNl6zdcS8_N@$?vduis1jENKG5 zFW0NvSzC0G6(9=t&Kn@$)7X&~*i8`zo3`%^?B6bJN9T{zcEt|=K!vWVRBos?!kSiV zy0BJvh%DF*Gh!G|CFE9gA{JwCSr398e}{oP4K~h-{lKVX*a;x#zrgbtW%ZZ?i|-4@m*oj~x?s4%NvvfLJ|#EV~U zF(9wSD^aC&<%)DDCl$JpK=>=c1X@n3#)+7JYeytt5F@;|JL3EOqTe>|A{x zb#4ff8b<=>ZyJ07-yE&%sgvB%%3tBvzq%df1J-)Ll)N`IBHLb%mq$L!ink9$)W$p` z!@UYcWzUu1i1d%Wp%YP!L}+3bLUmzp*x@dYiaIgy!I8Y`1pe46Z{w?xmoGNCZ76nl zAMU{NX}+i?iQ!_N4gdaG%eDB zB~6d32g>>#Sp^n4&Cu_(%TdeNvqf3lRJB#GGa(iIC;&w}Hv=O>4E*6!T7 zLsAF3dE1vi-&yCER};y_Yv1nO`Ig@Tr+UWxZ!q%DcUtss@;eXKcHjBNjpz3Y;Df8RZf?aS1Y)N=DY20x@X>;yUT)=^|` zg|~&)(8AsTG}feh1+&Dr%OmG~dc40IMiy^V(rDVjCWr~mB+W=ym=(HZm}iDvJI}Ei zAtn%^jOQ)tlocIL*MjX`fjy2)<_fQWpJfx+TNCe63O7~&R)rG5r1%#s_7eDfoS-@p z*9T4f0s-!OJE|+oC|3=$$TTsZ)LT^2T2Y8i?SOkO!4Dena+l0qzX>39t90Lf@PL(m zGpe3`nHoTtVim1>Eh<>^fRV0^yp~4*a!fn{{-d8>gIMzLAs`D3T+{pK>fXSkEI7bk z^#FjV+Sit;2Yk!NjKSW3>K93gFEKZMzZ}+N%c1-6_Bh|n=kp9HAps7`P$w@al$ zRb-{gM#w_dxihPa!#J0+@Z?a6n=Ab=yj1qw$I@vpi6aP>iO&Br3U%keUSvs1jTnOeEDP#?q>!)^a*B z<#nn{)jWC}?72cA+X%kow@<_*gv`1udmWP?${aO32fAfp1% zO5OpK)AznHeGkT@9{4Q+o%-6eaZ=04+AMhzy@1VFud6hdG~A>xQv#g((;TF$LcNoW zZVz*bCr=rHvgKtZEtHCEHZCOuQ{chYW`Z&qJ97uG3-elIF4+78|4>p6Kj7_EZFJXs z3e3F|pVI0Ii*y$!LI(G;=Nm#y{Cj5>Qz2q7C5<2n8lzeTsoJ>*B z)gQCy7%K+mH- zs5uugBgFEX!YP&rduVr92a712Y!J|%&;sapuTU=!=ORHDK>+&2z(mmod6Q8#G|3Dq z#}V}4kX<`(!Kk%>PXRXCpS9N7yTSWTva+%QW4=q@x7p#QHJ!ej!gKuR;Tkt+uOvU8 zrz5Q4K$%o>E>nvf*7(Mi+UQb}ihRCvp9VlVux~Lh(plMwZltK`0{^Yt<0r<0x>hnCnB)Z5Yr4kSJdh3_n z{o|ciJBNVu1AtN05pGQLoGVaSP7*(_6c*Xe6llYMG--3#&uGr!?55(KXlJzyV?RX5 zeOoy*3-v2Z2-}??ZP9rlD6uY4ifg9f2lyKtDx{=qRD_Pg$8xmFq_Ro49TeC0X6L^w z(>ULhS3!LSlq|3Mmc)-tgZCdJ*0TKF5t3iJyLk?Db${)TTaxFJZcV3-!Vw{>!S;~M zS$U}2?^gj8%Y)W~KyQM`+Uo)%QH6UnE^_;*-<3~xBzflBt!-4nXG(DZ&-;A_X5{8h zG=@J@LjxUnPGj;Vi4?2Y4Au^dIjl%InV~hvrDMZ%3_aX{>1Z@Cg*mh+(aWrwQF-K| z(s)7@O}_2WOAik;vuTpE2dCcj%qI)m28T=0hnsgC;wo%)1^5nT-bvj2KMJx?LP44X zJMi}VJYB&9EGdQMa4@|3it9PCq~m;ftEWH{z@x(KN=w#Kb>IK?d6i(OCQ!Hc;hWiL z4FBMtpEuAZspl--jq4Ibmb~1oU^iF25agO+*J`I&7y>!D++}@}dzS zk;n>nR#uBL7ujf5z;?Dccb`VoXyV6+%8w{Lu}z=fmY9?TuJtmF=DVFtsG78;g`HZg z4YD~;<7>jPJeuhhkem0Y5fiI4@MS|ZLUHt6wz874)a!E-#_OxO-1G`IFMJ(|;+zRr zpn*{>DXwnxRZ35NInnyBSq6a5CzL$9g^7{+m=dhHH9P|`VS0W+g6Qjm7jO5rmLD}c z$zgtqik_pif0kZln9K+|V(pWx$VbaRr^OJp#%urQ|2$f0e<>M6_)r`Jd8Lw9BaoJ? z$LXgu#4@PVu-m^r_SJLVNVK>qH`BDun_(@PadwHBbkB461iHRv6i~~xYqaBBfX zI)beUT-KBl^`SGwS(06xc86G?mt9endQwi)fu=rW*V@+ZfI=Yq`KXEI#7EO_$QnU8 zha0}g4BYhpy-JF49OW#}`#QyTx!lc(Tg@9>3|ka_BW$TGeZ%?%m|8P!qD+ZaYy^#= z10lo;YsDz?K`VuCw8S}uimS@+0R?F5j=U|fvIl&>N!r_H55q2-Sox8?xG2igE`B9> zF8;+=DT9hi9AH*c1TVYx@-Qb;85GBdKRVc@*Bw!MWIT;jJyBvzM>ksgk&~8AvVsca zxzoRrY$Zi^fT;#14;96YkzO|_3m+#vJ2xrIpFu1E(D0L&F`$OuFm4j^yzdxmY|R< zAw=olzj>aalF2a-{}vd{4uwCNVC95?)==nb`aov8nq5*K4l!by*5<1TaVcqOcG`ps zz1PbpeJwDG4*RHyaw(UAzO`db5I!VPywYgK|D1;QvaAqw%zE3oe5x5X4vCBe{VqjS zvz)(otZ{vS5T~V#uVK|DW{ZLNdZl6@E0f*8U)FKwQv2?*vboD^eC97es4Q^txAr|< zRx8EwdR!<0Ww8wi6U+EK-n|bil3W_3-M)0{z8mK6QTg)* zWx(#c*?4)4{>ES5cer9ICoC1SJ<;BN9)6wE{c2+n~2pfR8Ye4nbo6A<9C$%3FtI@138RR@2V%P%vDt7LLO?!l())oJSMF9X#% z<+96c&_jwuo52(Wy3)$l!tVX_w(b1d2^z-1V zgzob4-vo}ZLAXEf7lAJHDna)V>)q<0`!^Uq6S&gv3{?K)Q~3J71e||c1e|{pgk^C4 z%^X(-vvHx|Rmn|(MWtT27tL|8&jg~{# zHXGatO)w80P?utGgO(#tw)`l_W#D(XbH`|jg;-}BA^ePef<8~*S?0N+6qFWIq!+%h zAc9q}&j;MoH#25TqQX(mA^75ShAZ96Pc*TMur-LledO>O#6D|5JMgfn1cY<9K(NzH=2zD=ExAaVea+J_W5jV3{2HG44-p6!cUk1 zc~(AP2v;1+A6#ZtmZj&CFUVG=0_!1RqbQiL9so{GkP`2!wYE=mxL&Sm7gqn#Fb-T? z+OHb%iIY^&q&DID>5`U&%)(xw4!b)t$`JF(G3g5t&jAkKNF6yj)$XjL0)%uEOx6rk z)Tc@XF8yNBk%DelFnyqV^6hW{{<=B!E#40jPOJBQT>aRgNf{m1^lY zm~jDd!mhf)i>-9cnLhRCyEp=m-v@WInRAT5Gnur#ybK1%IBaf`2w&F?zCQXqd@XOE z6Imi8Yq3tNR?u2rvkKTZ7LQ86HHj`+8|=8o=&~C}tqFo}^zI(}Ydh+Xcw`Nmdoy7mPM_R_fWME$XD%K_0V|GcP#UG|;XdOMl zWfkwx7Y{f3w+8!0U{ovr_OU~c*+z_y`8Rn?2D%Pgw&jsn?K)~>mB)Nh;$!|z9_vH% z2*J`|QJ0@^i30pD2q_z!j{5b%3tQCzvt*x0QM($i4orBKvHO=UyX-pfPl^8-hVfq- z9P?GbF+cumeSPiQbrb)!O7UON{NM3k|AHSI|D~JH@n2iB>ui`&1el9uqRKN`l3{Pw zO@XxgHlwNhIC2g5$|(hQt6C}-5QPFLo4w*6{RaEjlcL~i6M#$FS7w?6Zs+juw_mMQCZ}9RGKF?%TNCn#?)b?K;=-#bm3T^ zHH>}5!%cJXwyPX3>t8##EpdvC%1M#H4ri!x5DK0OCWVKNlW$axhB){M!*Pa;Th_^G z9_B0+hh0P+R`cV4blXI{hvwIqh8-VJx>Gj~a~2Fd*mt9D9=D7D3z^?PIDs%Z7%v{s z<^L^tuPr{Qa18G`_cg$4$1krSrbJvVtg_zRKgv0CHs%e5N1z_AClor!jzgt7?u)^3U3`TJI^wDadEM-zE1{z)t z>nK|_RkL3mTueDEsJuyL6^P~eXfg7LWML7Mw|zvEE2i(>*G>d^Bewomqdfc-Ev>vg z1~S)ZlAb$STX;58&wY{tE0>OXWfp4x;Be=qtgN-X-VR>EtNqtezUZI68QbJ3$H7aYsCNxayEN z;b2Qjlo3c_6dHky9{l5mXjgqQy&h{pK=)DRdlvhmlho`dC1YXfd%`12aN4MSr!1M# zFr&64A!~>If$8zRJALgRhP+YlR^Ja1j$uOlGP>h}pg;W^es5*v1@v>d9+Lr(cLY#; zZ_*0}&dFH)GFMq^@cQlE@!`%fYT?TR`vnxy$ibUWA3DkhBT&c3E)0q}qF1{|$A^E} z-G8z33qi3o62}=0Jm@0>3HC{zA?%aK$v_^&gLpOp8WbI107iz@5C+1%QjSBTG|~ws zDg+i69bru<#;z6 z&L-(MF1JiDBg!4xr5px?#XhBhgBDJ0f&u>QfaKJ_*=YGZM?X)hu672Cy+b@7!^}-u! zMGh6hwib_N4me-~FL*YCYv~{0FJA3S|zGzYY6yyp?UAa8b6%m_Z?|H zpTB+i5>=sp-FdIceKINtYrA};ryFcr3vd`)VQAthNEc>{UqbW!V7tN%VO)0_)D=%XWX0qe*CbY%`47Jn3E)|o)$E~)aZoGYx&{e| zKGl+WRZT1^QGOeQSZ7`bCYC;n&X{k0ncjdtHNaUwgHA%wYmM8%{NPPEzmH#z1R6W~ z#hA@G#V*Fcnx1CEYvq3|0w1w}9(AzkaiIj91(4{_*zK(eY8G zK(FBeAhdPccOp5+H}mN%x)pN09R$ToCtrml1!*z5olpYn*JvD|hX}ruP@!r{BJakt zlAa{*`o3Xq4%IhQe;X@V>c{c-Px-p`<kiYl7i2Q4XqdkS+t%0w=vpM^gt_cI!Vle6e$w9KTkj zlgT?CBoWt_XFYy{rr?Ij6Ar(mfA`J0{XRb|W~b6&HgrAtmvMgOJM^Ms-DWj4ByhNFBcQ`CP`-^}^Pgx}M<3N7`)DL7h#uDmS&s&E|#Wozo z_0mg>!-6f?`7a-)l20#M(~Gu=CHE_Eu_8S3^3%bvdsZaBZ&Lapst(y&n>~3#uU%|X z4-;fy&Zhy0xlzUqEl}txscVY53l1l)1J~&dY;(0S*%e)SLWl98o8R{gwj1>`X?<-vXZ=1Kkh>FK+!dW zgM^B$j>$9C1e(~rpuAk-W86U;6id>IKQ2ssY4_oSdM(_t{S|vo(Pz_XRda2hVhX2v@!)~8wI~GEtQe{LB(kb2?RKN^hQmx5~ z1WGNSpEFp>&M(J@TPH`yTiZX1wlW@pBQ?hwSBupNT?L1_4lwI+Wyy!S4v(P2BkAyH z5_jO`!8)b&x42Ra$aB?1NLhSCNs)c#KdFyFsfO6Z+)sTj%&geMpckx?w*0i0`3%P| zTuLVfAcyU_uxr<1l;5Zg-#4tn3(WfTHBh4xI~Wh(6O0z)>7<_x1}83$)Miq2FH@JZ zb0U@E{vSpk!G?#M$)kTM9;_{j2Wt|0h`GKbUyFr5n!`M-3tl-q$2>s1HjOvM>;szC z7n5ogoB*dHxEJSfnvHIwL4a3f6smDlbBI-9K&qKG%hFJYH)dKj92AB%bCxUe8qsny z0k=j|sU2{=JYYe&$>xk`LT!`iOj5Y$1y2;m)}s;ToA!qpzV}r@To2$lA-mgMg{w?g z;o+`ikFe04I-DP~;U*LYbb$9|CKLb~MRau<}J#WU$Nn_}i9@0J8az$dcOIysVQ zpb!~~x4T2>vs`lFtL|h3>_+hzPzu_=+}hha{^9W8?W-R=0}^qzi%rowPmRK&Iwfpl zaWqCad;RmR=*jn7#3|M=8wFRADn|Zckz7?btoUy>g8vPEZsWSWs5C* zkwwcVy0dG!k}~F_AHWk3V_Zp?XsdL6+>Ad`TBjr&qq9c!Z2DBUM#XT-_J|S}=0HvV zKI;xUiLrd`!T)xW4{16sC>3X9ipz)ONI+!=vwZRxw~x~@WLR+kMTcS9?9eTNzhjq@wI*06p)Fhu>L|K!BBqpW3Fh2hNp@LeG>it_`9;#7O~{3BiFE_T z?6jC>(-{(<4s}5fhHNxra)fmdfyPi; zT_GgaKFyLPW94;?P61U!NdQwlEA^bn0GK2j0O}8VO9AxrA5@q#sM4=|2oW!%IW~efNgsv!n zaH7X1@nhB3|G)U_y)7XF?t~qirp^jNv9{5q~k59Hv2q+ zSvn)Gz61AlTv<9D45yZ^lAaM*BXUW$ibHK5P~ppUr`M$WNpzY%?aURDz4W?wjyV#& zdJ`}k5P59_{vUpMKvO1U$tM%h8ee#Yi2FQsdmuN0&-WbA4|}q!ueNUgZ?ggxJ%MSK z#9xXV8f4ewE=EUm=#JP0vXw0LvN=~9!}|?dO90#z^;NpPDO@9oD00bxfQ7~71Wyo( zXKkMVs;cB6OAt6c&P}nYV=kKsmr8I@(`XR<;A~~M!UGW$Hf2<~Q(r{&G{(zMFS^(C zr#ZWcDqXXcrwd!d{^7%pU%$%Cc(P$dm^U34m69X#+>u?jcdDBOMAAaU z7(Z^AfvJ@REmdPnv?*w!ins|19qyWNlZC?o^Le%1_9*PTyKTc9X7Waq2H^{1N)S|m zb!lsmVf5E0#AXvPPNe!$i0>e))*yR;+`@`c__7o(?qVM3s$xNkfn`ima=?Az{#sSo z%M*ubE=M1-3o)K{FT2^$)*<%z_-dOA`cjt;&$k`8t21I0V^K)RMa2>cSJ8bKOoEan zXCrp9q#AR0#mH?k_L~^j6p$6cUQnGl8PSy&2#`&`n;C3dRzND+nQ}8cwji$@GvhvrQ?wMIZ`ggRlb~~r&4cnz@wNBeU+;N24#xDO@=O`Iw z1$ralf04fiSYlpnd{t1o^eE=yIlkEjriVS2!e>i>>z7$R6TTb7oNVM7b+Rb{7n2S( z3J!Cc!$;ZJKyO%Sf+d@2a$(;y5GN|Tj!~WkcwmF75r#AJ6-h?0Jis0v2nWeH1x*{yI$if+<|4_zW}HZJ(ZrLi?%KBbFICl|!WyQGM5 z@_ahioJV>uy%silh^86aD!m?0!Ui3D21wXTmM$q*jWi#gjB+?(tk*cvko&kVC5g#D zVB!$TD*DSwaWk5BuUUmLbU8QR)d2?pi_5~WSbmC*4fl&gM{jg^1R8N2PY!;A$5$nI z)%1vbCoPN>lDQ3JZuBOM)Vn%Y6@!&G&`J&yqDgJsE#lKB zYcaDt^}w|BH3Isxq;Y{K)A>Kvw0m3z;hu4u#9~DBt@{K^nTGtT=3b5RM%Mun0O;D8OLtB%D1gF3QXS2etcmDce}Lg(%HkCQnfd z?J=Q+y@wr|VW3k#PGJa`Dn-SSU`4n^E;GI622+tvQhdn9Nj5E2iHF|Qsp1Uuj0F4UA!l;yj-X(bWQN&0Tz&H`(yO2e(Ows7ZyO zIYg6dK$F>GHkqVCf7;d1J>h{X;L9hKf6Mh3$^%zrHCHqzXweaJT6NN$Fku6lQZND3 zbc$R8VW>B6fgWG@-uRwX;1{1!>fFz1xun|Yibmnu#@o>lQSpiL2G?9PAu+SJ4q1{o zp7efU$Y{Gn0V^&int$cB1+Z=_VJsP}W%rzKFLaXRmgL$P+~BM~*OpV#V)?Uj{NoAc z5#|D!R3?v(c9CA7L2HGZmuQc=@fBr?j1KX*N0^027=x6Ugb%>yB_Bl1&$CM58iY^6 zKj<;Fe{k}jZ(qOJ;1?g@$p`s;wt|y^2U*1pfGjXCF8HE{&0^pB>BpnvL-#!x@sd>9 z6)VIqmf>s|A?IbSGiza4DZ51o$H-Y0lNw`|3@Sko%0_x7gvD)=D!$2@SdtYZ`(vpr zQRAp}0=bQACu=%|SE`s8eqUtPjcp#w%t z8}dHfs6%6oXch8zFh~^>v6uIL>Vk-M^uwW)HE2Y#Bzt&BwI-e4lW1tZv;0)vNyCQ^ z->=BRlTGJiZrX)2wvFYtTiT=QW;*T(9LGHY)Hb>&pLQpcEcJlu=$Q7{g#$i(7+kSj zmc9~=NSBI;bOvZNN}A;4yP}TT=;%hGm|QB@P`SexprmSX_A2TMmW3-?u7D)h5f+}xqQo!*V$&Vs1#_t(>h?X|JT7!yZkH=} z-vS64$hvE~^h=knj*|1&8Xeuhq1=7-WgKEG>LEm;yd19^R1Qye5 zC*$D^1Mt#{dyR&#gdr|BDBFh*mX|@=b7nhFOYodT8$;xT2Jz-RRf+kPn#xm`eShje zC^~%c+MZX$XI zGAnZfaP{EU(OASQ&OcSRZ#*|vi?7|M75D)izm^wAL;-es7gtA4kiLo4N_qZMx@3AT8FT9x%cqOj=&ttiNxB| zjUNHm^4%ezZ{@o84z{=U9NUdl?NZ<&fN;+z{Jd(j=zH$`1bj6L*M*m^Gk*}|f;eU6 zeKRG6Ed~lx3`4byjISxe;TG1vp0SB}Yh^J_{m%jphMi|ti1vydP1M;O02qWF{RdMHJyjGdgXQAKkKH^h@>51iKoPY?M|3$z)EYEyrle1amg* zP8=|T5{?1m?FL(5EpOlaWY_W*HT%38s#d3mNi_b20hV3CYz$iv&b(r3*lO;SB8PTc z5|Z<8aY#BEmU1$QArdZYI699a0QDSqNdsM_#SJwZjqY@sUX0ltzrYMMYxfz&^q6zN5*En|No$>Sq5UT zRk6C9H`2fmWB~1CWPRJk%|XG=%)tA)Xy}pvA2G$uo2#`lhIWN??(jLLgAp05 zLU{t%Y#d=ddVrJVdNzKSy$}3$PmwcUiqd^Qm`DHkvmxH}r??Rj=<8HC1+H zksd)8#(|U|m(!imaS23fR0GZkNQx|N>xb*apRQ69xV6staGi2XTRH8PyTpuoE7EN_ z9@4bd36n}83VQ@ueIfJ;Y{RrOF^1W#RPt&@L~%!ixwRnQ8w9R z2}&L^KWX_$|59`$G3~|Ab$lPsU}F0cf6mCxOI~;+e{(w9UDZNXL2&V;=#9VzLF0H`08cx`sJ56j!dMC_zGI*+cq3H{BV6=F#^mZp84`DS<$2_B@u zQgKLpVrjPczg9(O62xYW4pwPD!^JokD?5@@az)K4MGG?B0pK+eH1u0H!GuU9s1-mkhR8X0 zXV(i86viD4yfi_!1s+?@NTcCkSp9(zrEsS;I;lS$?7pBJ8-e)%mL#QVs}x#zXFDRu zYE(L*GRP3AI$Zzas%LPDkCauZ5|x`vl{_PW!3y_i&5lO6v(<8iWG8E70>oBfJX>q6;pgLqKR*1PYig^piEuh(~Q3aKa5HlMZH+(7Gv3<|TtGq@`mLlIzgO>QJ&Y6i+VRrIMPV189Zu%?A-&;?yYvzKemc4w`L8(p3_Q*zIhXN>c?QGl%5?7ObmR=+ z)`O&-kncGiJ{O_oT{#|5Eo#+#aZh-Ji0HoPb6$y3jOiVN(zd?&-bFDuBl zNV65$ax^%Ka_fZpeDeK9Wj3Kya|Evnauf4yDBe(YYfM;b6ly1;2dq=4bu?mb{7E`+ z?v(a9VvdwT%RGuegaXHe$dZy)){3OaDZt(0O z-Zm?iNjeTH{G?rIs?C!Y{ui16ce_pb2tepFcGMB(-LY0KV${1FLGicQ#kgQrHHa<1 zcn9nr3e=VmsE<62fZcfTh#2f)q=$Gm1evPX^x*Fnu^Gg2DU*dxayIoMZm6IxTQV9? zXleJ0r^es1cBQ;RvRvSBbB!Sh6{XavPFc6n=GozQLVv7z1`l@YB}ZO0eHi6$KD?BZ zPAj2;D(LdiJZmC#7X2c%cMRivEpXBeyUE6fy5q?5n`CI;i4 z-`EktA7E2uDG_?hNJ$dlkS!RMF2A}bq1P|r13^H|F^uA)_pwi-e<2}Q_)pw}54}ej zjW7(FscvaCd`y-;@#V$S3ZGU#F4^Ewl^q4=Ubz>MA*C9|I_JI`rRofJ9r$PwN#{}TQeJfz zG$md1)ILLeW6yvliWI=tq?nRUu}UI@3-9iMfvWk~M51OSb5XuI#HAI*R#dr$3=cvkx=*e`0vD(Cu5^Jhj6FCDzOPBRr8oI2KqNfEy|6G4xi~xxWZRE2+ zH-oyJt>@b$OCG#A+1@)i+UZod{!roR)tb=Ds;Em*-Gl@Z5Ea&|dRF#EXY4MSOLAEe z!Y5YzTSLihymsJE!_?03C#C6y^gCpxLaOMQQ)Qq;O%IZH7Z|Z1l3$Y*)$#PoRw0&w z^vmfWoklI>vvJ1*A7d*#CQn2E<5SDO%b~;ej@~-k5))Ir11X`kMiNpx<*1ExuxW>u z-1p-?ZV@fmD3L#wV#r8@UcfVY}#U-UPI#Bl}!c^n=Vb5PvQ@e$q(y{wcE zwhd_!QM#{7FWzzd*Kmca+fa3TY83~l&mSy6S+W0%i@ zHr<5kZGVo9n9eq@iF!~mPNJ$qF-~*8-$1y_#vfz zk_1$iCsGow%$P=};HXqd_#=%)@S*qf9kRP#zu+>;u=>!c8eO6pLodbU5_>N7b zH<=xIZEhXDI(dF=608)OcD~MYbF9n>4sX0QjiV+dYQ(qvZGH*BWFq_$Nd&>7wWr4} zaKz()VrXxD?`SXl{*$FM5R{N5WC;+F0tpM|p#)qUcLP9^5OoYBP)Nwz!<}Fpit=;9 zo=<|QCz_IB6uCqgX6!mMy39XFw^!R8`IjLDlj#ToVK2{&5_L@_l}3ho%2GHF zEK`?KpU-HH0A@T=omW67`RQ0Ti{Q{C-&5u;djf9P|E7;J}!uCU8OuG{_{hO!$0&$NWIZ;fu70y7BKuYM1|1!SnOIu9AS0KeFUS;}Hv~roR(@`NfGSiK>#*c+s*>N` zfx=X1LjRbJaIB?zp-1utf?S;E+^1letT;CvUSs)7I2gfAfmFa<67omER-au@9p?_A zsOpnr_y;o7uplvU?l1=F-AMLXokA);F`Z=VwAh0`cGdN~?u#GXcRmQsgMT@3``muP zt*ZB|Z25dhxvU~#7Lihx5sn3#JC+IFh(b0@G=~dlXh(F;-w$*Q$$<50n=a;$oVegi zs+9xM0v^9Q+o7TdySH~&$zjj|f4qNzoPVmRUQ5d?Zp(onl?f&uZ-eY~~ z=EIFN_%kS&RaO__@0{DSOgsS*-0S71$#3*m@~*kje4l(|@+K_jJqs)n71n~>Tv6&d znET<*@!P|FZ>Vs(UY~?6^sQ|2AI(Jbw-USJRm6cUqBL50;Z)eOC@a-tCXJ}NGzB2M zYpyht-;?HJfB~kr;_ud9Cy~>kW5>Fq8;n36D?fHO&V|L`$NX;OwFSsb;r>IFJ2Y1m z3uff>r{f1cf$n7tfE!7LaqIHA9jv|iuE}{io9~;>8=`i~*qSeL=t8r+3^~$E(KmPq zxMY0P9KI6h+kX2J66Al#A~PFGHq-4~uF9PG{IBzkP09crC&k5Y!T(Pu`H)i>2&^xS z!yX;B43L)-1}Fe|PsF2T8f2kSS)0s==Nj&h#g4pNCmfz$KIy~u4b!+ThNkm3#WN<| z8{blmDOC5c?>kO&dU8u|)iX!}0yoA-3yqBkHDR`N=3?Zu09@+z9EQ5~fTS%tmA@nU z0o)LW;5=g1xLXdY1ZZ2o4rcc4DF(=Q5^>WVIx|*@xKZ9aCH`UbXRikr{5c8oC%gN{ zAjacnOA?o!M@E(DtB<);vl8Bf-*@LOks}^<2l4m7?P=zMU;ILx-#O>W;>x}sW zs1&X&KR=-195`uU9(TihPYwuvbMNKu&fbfolQ%nuColKj9{pf)uaX}x`EDtGOf@7@ z(4{Mnc{~+0hFHK=y~wEg{nu~zj)B`~Zx~1|F9(@DtG%*Yvk|I;Mz%1JkTp}ICQ`jBJ~;Pj zVP$T^qt8SInMBS0mv++c;$no=cL2)jh^RmC;W?1+YTCdOx3%b3-534mfA=)r5O2NFT;#G=ce}!7`_-4E1gtVa?eF}2y!CvKm8H)7WHGVV zb5|Huk;aay-{I;=J^-LQIa?8Sytgu<+D`EAIsa>^F1J8k;xy3gPCLm@`v?1?+%?x? z+p>BtZfzXUMC(>in)k!Oz4K7Ra=5XgtM+b3dB&G~w%*9!&Hqf^yFekqeM-Dsm(KF{OD=V;J z?{7Qjb@^6gcGk3>6>fp6Rh&7J@OD!@i7<`2OtMKV0OqHl_;ck>{-mod$A5D4m>I}Lq4$Q} z38xysiPqED;A0|$Qi~{1%+zA65NA&F{+x_|TDX+!s(J@ccg(0eoUx?YYPvHAST3#s zJNqx<1BOV+N6Q)M*p-D}tl&wrrglXleI1z3jI+Bl4Kl6f=J3nuuu8GhYMKq=)#;h4 zN%osGFha7S(S2++ZsN11sURt*w+e&S9DWI$bY;=h+B`MYdseKUE{XsKB@QIMZ&?zkR%Wuy3v&V=<=I^3>V2e3c2Kodzr^)89(*{byehWu+Htyc8-3OFb zVZ+T08QK=Iz`6tP>1^6i)-t88Vwl<@c_2k%^+XZfSA_NO%}^0R@U>+r5}gX4QtV-_ zh)5{s@!GaJP^DZRjH0(kiQ{TF>D(K%kM15T_WV`}Oee+Uj^WYq;qLyc zs;}@H`vD)Ik8L`oIu`D0720qzR-n^JQ`!SPy~|~ zQ=#yF$5G}A427?si&Z@?CoNpuLw`9qp=r?JvVEOOPMO~XRN~=UCs{W>H-qdNQJq}| z6z4;|Cx2V!-t~bteoHaZ#8>wniKl8|j%4|#HRE*iQa!v)WSsLlC=2pWu&C_#djg9S zN{08ZGrm|;0`X&#U34cmR1N0V8_+a{1Fj-SOO07dlNY1$N~h;(Aj-r*sd0SUElep1 zr!axUIXWc?TN7TTiBYh|^ez-nT;h{xF6I6U5~111)hsG*E>81dNP0>}=h=WNl`pn^ zw)Ow7y|?dc<46{T_h0){OxR;f0tqARB)i5q560Lb#^3`un{&KgenJ|-1R-fPk`2jv zKl@X!-PJuaLO9+%_uLz0*GMz{T3uaTRb4Nwr;7V#QGufY`NQA)kfsvvDCwS-UpNx~ z5C8SkZ&EY)0T?K9F6s@JIenh+$Vj#7&pN$kHix=Cixw)9+CBv>zH=>FSlB2>aUh(4 zx|ZBb^QY`K$K`eN@G_S5b@{wsXbKa&03J^1(d@Gb7f7h8Kr z_;+=6HTg%$v1NHWC@sPf3%36VcK$*n8U?JqV@sut1??+%<^Ajuj+{FD;LIjHPv?ku zCI1L>uIhzub)#OgvR<;qxzr*r`e6H;f)=1Wed2h6;0r)h1wvTsAz=V zE!2u=z6dF;wgx}d6rEZq=4dRaNvlj2mn2v|vGk<&QWu?$j>4r&^)j8EAuCzS*-CxK zR}<~V4Nx#-Wg*#U5k^6`V07ZgBo;TQQlqtIoO1CN{Dj%!H;hpvm^kyMM)4jV055k2 zb%rC%ButJM@(_u>MF zQGuw1?SuX8tq`O5QCMt$CtUiS@b%7r2CsMi)6U{agi}$|dpi-z*}6}|x-X-;FT=Vo zqhW2KZK_480QgYgAcT&Bw;bD_?S|;i0_mGcHkx3jdcOCh^z+#exNOuIOgdU(hb zeCH4+Cbak0Hj?kPPfhd9e~{5#so^$s#oJJ*O~v(FSbVvLJI@t=1ce?3g-qGM)si}o zyOZamZq~s_OO1uQdH`KLc;Nc_rkQ+$rJ>75`1k8(@-@}LviEDa>2Pal@o$^Sw^&U6 zhD|?t0%e~*b%p=jO#W0h3o49f>zsK!Y$gbS_%GGn+-xRK;D4Ko6#gd^e%eIeJt@52 zOx6iL0G?0Ls5%(rT|%yH_@H`k_qPuJ>*USh?!n>i@qgWEudCX@W8Eyo;>4K5=d)8% zM4<7aXRrT};7O)0@!paS09X1GrR^ZYwHm$QNQ1-c0&Y`Cm5v_{<7lA#22q&9Wfh?->(v_d}`O!*eI{_jAfM(ek1W? z{X*~-C4vPdK~g|XH>@4h9i6t!r4%8zfX32ktipptZ*Q}d_dl#R!)X(d2^Mse7e*l! zjpR)&dpHn#8U)wGr*h^&5t#vJr9fXi*xyr0KV?Bti03hP7YZ8~qUze0wLoE7^{+I- zKT>y%FK>b$+_rOshf<3beg`DjdA!`98;tJHBX7m~>aJM4N{&4OJ@>@XY_do zZNh^TS>hdq`?PgV@y}55M5B93E5b3A5spmHi7ndu{z!u@6RH%RE~`6PiO|QD6@wKi- zN#})#OHSp`A7tIarG3eo49*vI7gs&C28gzv3w*qMfDz4Len8eT^}8oHM1Xa+0B)S> zWK2r!WN?oE$Bxh02T>1XUTunv`k~bH&&cPZVSy&p>VvZ#;Wwp(zQSDEm=hS!KY|w$_;vX-)(4 zpQaRHie>`{IvjnpLr4-gei{DJ@!>|{wHpnu>qZPAvIs?-^yp|hQ5~@UHOVF1kWHrK zDhRpU7v&JrlvlTc664%rF#0k;P|RRAwyH4{@T7odJI@gm1>gjVLOX8C!?8H1DrV2w zJk0#dXx(kFK~-twtRMr>VUZ$nd|gTxk)9@)#&a}5>7tHdI+UQ)XneIsu+_sqAzRW<<7C>%&^U{Y3`b3?aEE1KQX&R8i>v$C!(*Zr!e@h z2KzS@p5l=(ALkOoFHxSRPEs>UO#liea#ANcVqrP6J6-vw7!Z3oJiLhuF*hGD<|)7B zr0M!gE#}M1;^pUNO$~mESuWcMIo}Y;FVsojhaxJ5P#7$GjNvZT?be75;a_!;m>J7Q{xZB^|Yb3&=(1o0M;P*SQHhE3rwG5K<@5ok? z3d&FFY?Spe(5;`;2P+AGSnU_hIVlJk#ug}<-)CB91hH|Gviw6n>@3EGc6oK;Anh*X zJR_|pXdo8hw2=2KjLFU+OI`fy4d=+?ateTmBr=`GzjY?)PKn_|dAlJ5v30R&7gyKp zc*!9qP5U98cDfhy#^e`NV0>B{vyh`r2Qdq&qe7~+V!#|!GM!5PK^vAe$Rpunw8rUQ zD&p#%#z6(GtvJPAB@4Q2c!5DcByB|ioG6!qMEmg&=1EH~1$%Gtj6!L;s1vKnQF_@K zQdp9~HSQBM01(M$iGuQRfW?BK$dMZ>w!&P5uTrydluw#q0hMly{upB!Z@w@LY8cYp zxl${~)0r38yIfG7q+`~L-JIm%HoMhl;(($OKGsX0GF&n1cPLkqBF2O;jcO&7ChPO! zm`V&&L@=Xdyj9}+&}kb(Q5F!XGHAGW`K8$*i||;jvFKZggCJUAJlj6lJJ`1f*Bi}H z-ZP;}L<1e0wQtnWW3L!JLE99*%|>!D+G9>25XK45%_tR#3?dk11*$Y0n%S_Oae!1y zZ3{te)*6lCVMenpgM0zhz9fMAFW>L(?eJ0l{Gi%_r|b}ywr?A3$3*&3X6TX^JZu3SXP>1h+$Ml*Z-L=zX~2CS3pr(_LTXxW;l+XtcH{=bwka zvJ2{HJ-GxnnF^3Q2(cog59mvgT@_i6Y81t#p7O+~p)iR_&{8>z6vdog*9-_@1_A@z zlIbwMC7nKM4sir!X=F=hV`gGu(j8r<6xG=CouBTO@?tu$rbYTd611Cj?i$-2&1}pe zVosRx64^x!@=mswILh&CO8MJ0Q)V`#OF+KALErp*Fq*Pb=Rtgt*DmAg0#%9^)=VC_ zGXFXM-lZd3EqL_Uw6Irn=Gm~hu!>%TH||n;IKoX#;)#Z)oMWZ_1F_D%9)cz11RE1L zAt`|u%zkgyX{;tSlqzbR;^Z>z3?(}XKBYzroF3pl42b$Gb7DvTdi;yy(45n_c@bhJ zx@EHb^CjNH-WLN-T%~v8?t7(|vx z=OHeXbtjiATmoUKi#ut{+@3GwB6Y7rrm2L)!Hj*@n|Z_VTaZIq5WET;giQdTC_?=Z zX@s@x8{3<*!v|N;I?S!v+065nBMl}kU&Zne)|4$zG&635XNcQh`O>Pc3+~3F2?*Mi zl9bC$UEunpqI#W?*0c%#e~16PcYACB9$#HE!?<*n-tu(>8p%bCrN+ObBrE+*2Ger= zF&=`RTf_4^b2m(7A!wRq)yP1}Gib#-0#+mkbw*=6E;>kwQ`M4sRhg=3>E&k9j%<>q z#cacEi@jC1O65EKVWjhqcO@eQ6=j@eYTYgm#Dd$PBoKf@PP(V?3KK?34G2J3`D+vZ zd`for-Ic(Ch#9ah?lgfSUu)v@VUsbYsk3du0Z6=y-u$JfdA)g ziuon|M5+jMVT1X_+_-yl@P&mV(C}4~i@Q)bD0lanTvq8GiP$?DXWI@QjUb<7#JjBd-kM!H_B+F*gRo{2qvc;=S9}=B$T+W@)B~vo1+h_YFJ%* zR&CH(^~nz$omuJPAg~%N)4R(GFo@W+3`Unt;v}JE>fpkSKcG2f^g%1JlB~8KP<-`( zsyjj0ac43uED@`c-2i^>7c^;iOUyIQX21h5xvHa!X@_yD5%8j=x9jFs)9cbb;bwL#%wxr%Mfvz8;)=$>H-?+Xwqc$DT22 z5m3YBmlLX_WfZR}TRuLZ`zB3A(K=0AB9E0ductw5=^)ROO6!RwjnD3v2aPh8n)JX2 z6qSMf`25x3&dZJ9w6)_Y#J)y2i?X8hib4#Se%0fS?4G{bOj>R0k3hFtopLbv6re=` z*B)@8I`!Fhbd$#eF?V<+<{*?Dy~3{O0q6Na{AH_lQVR)EbGS(R1WqbrK6+yeU(OYx zS?gMD6#|e-jrtY%figg6crDD&kDZBl!YJV*$-n5i@_~%TFQ9ST3-WjP47;nSsER8W zPS{z(20AVm7x)9)MWV?@)Ia~7}~yIgtX*L;!Bs0Zbc;}ZiXaCxo(dKHo@TvgMY)Y z-Bu%2t>;osGkmkD8sIsm%Ern#je}-twKXLmeE3!_km@?8rO1UA(TrT1((?WLYAwpg zD_JfXfJ14s=9`XIYsIh^pfN<}V&1fr?H(ivWR5{h|VAe~^pcf><1ax5g)tP4OPzFBA!?Ccf`TTo0r_&Lv zB|yseqJ1_pHKfW~AfK2PbsBgL^M<5VtnS`>;-oQ>6(`HW_f^=~t=4!el*ExMi!}SV z=CZc=KE*ewqzQAnYWeb5y^Co=wIHfOH4>PEmA{X$APE#rO=hL5v?8ueZpBYf`*7N# zn344%xV;5ZiR+5VZ&ozzN3;IZ;;o~;7Zs*lM$yF>aJx(Ao$)vw=1VRyBI!;^u~fpc zpvr53L!JbZe-wNYs*muZ^9(8V3Vt%`<5GrNn`PFXl(yklJ2o>YPm0t*M>EqF9b!J% zOE;rd38pN~1?D5Dj5K_8?8W4=T<`^Ui4Rjk`b;!IffK-}Hks^tuOG4W*sfETUW}qE z2WP>`xvb%6Q1hY+^WI5XVs=4Us6|2umVA~dj zJWfsCs)`8N-p>f@rUs+%NavB@r8E5aicU^z^apjH`@o# zcj`s-qgywW7`Arzus1i1z;5g%Bj#3l10>@WSJ5@4&ZPp+LZoK_A;&SWU^MF0Uk!8| zG?X<3p%nR3KJ${IPq)D|8^6>+UN#x0Zg-ylgn6zNLoj5Jq$xZbsh0?b5kXl6{Zq)u zFXoO5VX4z{VC(e4DAY8E2&5+DozFc@1)BtHDqc{h2k}+Z;z5<_Wk-gmJhyTNsn9g_WrJ6_vjXFKR<{YE;61VJ?GB>Un z>t#YgKGKTo_#5I=N8-1tT0?nWwbFLsgEVz+WVS>#LbAh7VS3iJu6k-ke<3QZ{!8U* zmBn!eIiMoWOcw*YFi-}urVB%bZi?fcy?#{9J-zH)(J_nJ)-W<(#u&e-s>|8p%b~*){^PME)C^U`k|d(<3%*XaC38 zb{u;s-c~h3SwW)xg=Qdcv3W^b#eo&Vj8HZiRG5X!86w!(u>J2f^T=j;<%S{U+w?*eb|OEYtU}m?Ig>+>s~Xs z$@1pVG%tK8{CwrPJYtIPLY)473>1wS9jBDM& z9BNB-O%+G$0c%Z+i6nBm)E;jq7`2$i!0Rc3v_r-(+EY6@zdvqvUN}kR8VcT9nC6ha2JP9)h9C zRpO>vPxH}i(oMOkBc533NXyfs95p;fXNCBnyff2$v#hTWrigl&BnSQk&jH!cpXZu% zfAFXEl-0wlLw?+PdN%dniI1S4Yi|4HDCmx7QykNMZMT{HQaY%nL1An`X=L5hyzlD8 zPFY|17D%`R36h{JReS!@uoszh0x~@cH)P!}cHAkJ{hD z_piVG7M`~su7CUWACk2%JdV=O46P!P8S8(fFEURqv00n=VHl=`^;se@bnvaYp*+5Z5mHJ1bPxKwVXa}iAa?GZf zY^OnviaK+#R7>iucEgSJ4860KTrBk^lya{}Gf8BIlgM!zv&%e5>RPOU&0?lf1TenT z2*sib?@WLPzD$wD4T5hcni!#}IS`tf?x3le4Vs$7peezJRQsi_E>F6)4{cJ#e;b@ctAG{y!lQD|hJMnFoTQ~>kJN5isScmA^}sR88gj&``e z)0Dvf@^?oX9E{E|R81*_bP9gl8bA8(CxJD`ePzpJSTk-#%}z&y9$R#Xg>4gA8ALj> zFcXC$aaxKbSe0U0V|t4_bxLyaWK$uAc;hxwWF|9ecABTnZsU%9abeyx*RXnkHXO11 zSD)yk>2i8BH8+R?bYGuPT=L`-R~9g!AwZoB(9jxf)Cla|VFyb58@Xkv*%=o#@F`9l z7y|FyTu&Ps+wgq>2I0*^Dgc0|d{VP_8ZazIP2Y%`@DVtsQhjbfq$$*g)^lr1?(;&ImvaUmg>mvzn^*eyN0x^_1WmD}n7N%UH+y5nTUoVXHYlyq zpNuZW-Mpfv@t`cvX z&o)Kh=hc>bs?V#8iOfD{x`(fB-yiY~b84CIoWZYrr728jbu&}jOhqH=b#ePCI2WJK zn7x>gRM&);3qet-|6EwgML$^`RJX)|IB$&sC1E})2|@YJl$%dAN2sXnj;adErA&|V2-2f_^sUk<@i&9!^8RIKa_4RTXY0QPi;G{`VqMqJL4wkY^EtO=Ol5P~5a`{{W z8@7tkP{xeKnrP2ICw;;78wU;uN!kdyC#Z-bv%sNDl)u9@I@lI}J;$%rJy)Wc53@2v zF-V@`EemYu$^)0e63toq!O3uhnXh{ayd_@Az2#k1jrIfR09&sgHRh7gafX67J19375_n zR0*lb#kEel?g@%!+Xsg`fmVpAJu7zH<0o`WpRS%iHP0?P)AR62KJCG2S9q3<3XcZa zY5WY;5%|mw1}Cu;Jn5n&9qFRT<0^hOiXL31my2k-&CukF$0cs5P* zq?=}g`e1anUdM=C0Dn1j4^Hq6zQAl^Mxc~L4RSZiRMq7c9G#u4zgz$M8=wD=A7%K! zca@QeyE9T+Yqp!~@ZUrE?@{#M*Ejq}jeOJmZU0dt-!^~Se_yVVKQ({bfB$zif+i7a zay!rqtE*PanD<|yX#=1h8ifv$mCfW&8wosnN?(jMKD-m8ym}v4dtuq- zIb{$0AYcYRo?MQ4cvo0eKFC{36|!FTVP1`AHkm4q=l-11CbKFR{>PlcKNU*AWhq3F0c3 zv%$P75o%MF8<6|W!Cwkh#-oq7*+Eq2rcGo~OY6*rmt1ABUEMFVzc^Mo9%9n@I2W0i zeNdI_xLtU%UW#G*dXnY~AP`fOm}tawp>+F4+q-;M{wkgk9Ew!T@^Okt+w;Ke&>t}E zjqvxn^@Es>r1mhcBT(*V?FJep1kcy;`MPniAj6rAO}+p!O?QgnN+Pr~RI{vm2L*Q~ zx)fVMRy4P+Z0v_l7J-98ycJ?RFNaHiFzQSrs3_?Xpyt|{8IqPumF$# zU}_+u#7!YGY;&D21d+%Vlmqd*JHOAF^c1rx(UQZgdB*n9?UtY4K|B6CG_dI8|930` z6Cl+d9h`i5@^du3*rhCCKEAEgs(LM;U$P3huUmrD*5Q2#1&d&z$yvMKcN?$`i z1XTJwz3Q-aL!AQbo4^fO-pkIiX}t@BSCb}axwcj#t535Y^}%$6QHdr{7E55xyOpH9 zR`3SS@*&=^Sbf~GfhGJP=d~8OKi1(DIyXCv@Lr6z@Cp=`qMp;2uD@J%UTkJ>)~V$Q zWvfOj4!+Dslb0Hz7)ah%>%19iUnpO%n#m+zNhXzg)KP=3)-O9(+2!ogxFMp9qqn+zWegd!!>V;J%na3 zEEi%@FYRU+!5&6J`XDjfpd^Vrx~4?1g2$wb`17BWd3WYN2<2&tIe>fWAt(Sw?z1~g&vE55jKG8z zRM+V=43L%O6kfDWm1kHRH!+Z!Tmu@AUxvm)rot}%D?*ECN&UV{6-Wted~QRc&2^y> zYc)Kp>dW<&N0~Dy+(t5dC;rZ0CxxVlV4}tohzbur{gxl1@gAz~M?!pDA}Rkd+nbx~+-f=p1kc7+9lGM;j0J z;gOr%&v!Lb*D}XQ4btHma6)7ktR$J^F$lYp_AF0BJd)wklKS2W5UstP{r$JE8~zH* zKfJTPwx;8Dw=&E~3CmQ=Yup9ip(&$7Np^-wjrovTV>LNs;9vw0zz1xHgrX5;98}9> z_0h-vu<5_TaR}@|KI_7fny)7H+U2O1*5p)dU@MfXri`iU3~Xu@%XtluDO>LWXI0?H z3}>~>V`n)GyXBLGi!#pOqDwKP-&jb8mV6g;e|3r~Agms9EY}pWT)-Ke2l3~zwpP;E zhG3)O@n(`cF^B@L1bhxq@DZGNzqq(!^Vl5e0X8Im3#iL<0t<*uT8>BMtYtqMTt$S3 zJb7#eb?^#Cj@+Yf3_H#>(81>;98jQPZy-5IiT$6!;f1m!-?`$WV~jNEJQjgfPRGEr zlI=XD_YP_#BR$GGY>z+b^s+0$z|Q1iHQ8m%<<+F@Q;6SeEsb#&5Kncq=VW`2ZNcG; zO-L6ygnWboH4YvRRcL$2;f=dwn8MxkC{H{bNC*#XgFqr~fA!O}+rfAl2&*jj@gW;c zvBu{)^hTOTwFn}fAkB^)1_1h;=gUb_XPs;)kThXDWskCDC;QEz+ywg)*S6CoH{4A9 zi*QLFV;exdhc(&GwQShuNbSQ8Jgl>;taqWBq(8G`pH#f6&7%WSXcYsp<7qUWW|y!5 z7zBCRnLyipAw=ELrUP-(X1IEacHm6YFY+;DZ$j*+Y8-X?uyB}ZI$xS!$ z$>hh^MkArVyj+8(N26;c`TIGF0%?kQcHI*6QkyDUFCIz7lF^R045PH5$#|7T({@o} z)iNy_xpNl3FiGez2y{kc_FwI_J9kKph*N(nb|2ytvGvpL{_)Ps zox|h-Foz9Wac}GB_&HUilt5AOdsMu7dy~m|$p+WUkzj}0fdRgnxTG8dN5ooHdHid% z4YH^5cWdvxZb6m^p0?i`?SlLHQ_aPf1XAi`6x9oa>Hv93nuCp`QYKerg7l5>=pgU@ z&3y4zAhi}ooCvZ$F;W+XvB)S$(+15i=T>lFkaf^ZLr{(MF&$1CNWTGEJ^o1uh0#wz z4v=tHW#WB-HuOfMROjQKJl8w9Ud5T9NDfXYCpu4sV@2=vrHr0(%PaP>l`hYBU27vo2JdB7AiqEC&eAy!IVhbIL!eE9`^F3;O zSZtgMYY(j1HqE;mD(GMsbYKCurj$S6MAge&8T1s754!x26=fOAU1G@bLzdaXjk~Lu z*|h&BH1V!80Qtyp_IGsLU3qo(kf>dxFh)zfJQ1$lajl*1#mCO1m-~PXdWC<5`n9#I zZ(s0d=BOLIfaiY_jZr7>X4!YaQTg`x#h;$NeevSxztNuWy_NIpS0uzurkXfiz3 zkB$%TJbF}+@!blr9kE>q*KRho!mg3Y)J+3RQ}mI#I~7iU*6TLnLVa|^R3iWYS3s!0 zDWyTv1yQm#P}Eqvm|{t#HrPjrb!#n~`9v zxPhQnJ|0TNrPf+|{o$jpzxno0e_m?5_nMerodB69m>5}(vhO0w17liQnI~VA7Dh%& zwLT(lpqob1?x`K8g*KbUf&EMa3hUa-h65C{OpX-n>F_BDSzF z*kP1=G@$_OE*mwklSQ#QVHQg^cj=JMd415l0$*wH9kh4HhrBq@P($K6ec`MB+CZ~y ze2{b-U-XWjE)9O+a7c1&bMnPmE~%c1{o9*)pzlAvIJ!e>Wo%5^xS_T>`b!+^XHem4pL3Nd|dfF>oZ8HjtvlRJVO_yNf+<5KDDdHq=6L(tRl?_Q;+zu)mY34PJwkZZ7>FBWb&m&>R z!vPzW8%`CibMbgDq#sA%L5-v?Ko;&U;I=V^jPm4-!ZJwAr`FTGU`Iq@vZ8H4Z4MeH zevyhRsPv)GzkofG?bF5n<$id*`EHgBLnWh_>^3bRJOjZ;VWUyH6&%H8SycDriRB{? zcR_z@z=1agYIl%!CVV1Uurllf;zG8$Z)#M3AU0|UIYbTV7`Z9TJYmOt$`ndO03I50 zbii8hzyrnl%M{5hmm=ejUr=NGOHEOQJ0jh-^og2l6kVAQ!Zu{2+09;+Psfdd?Q`vS?0J z)7@^MuQUe<$>fZZWOarGBqVN(FvP3Yfl-rSV-`OPyB>!La%tHzRPFqHpi!R*yy1GN zf@Xw~&v+n=4NjfuA^QDdtLgsPydeT-@L}RR<(QgYIj-n{{a(>QbctgQQl-J3z*85n)X5YUAgGE z_mRln5FoH{LBH7#Ohy`fx;p##v#P&Dn=3H!s$AWGVj&y)%-cI z>W(h@BkK2grKm7!lHiNkg*EtD6RQa~Fz^4c zTu;f8&F3+4GPo>*-)9<8K6er2(K@RITk8@8PBd?@+eB(uiiNpQ;bfSc)o}?_2sCEg zM7{it6INIPEFKIROTJLa+&QW>-wB!KOpIi263%nzx;X$jsloEqSk33IMT1G;IJ>F? zVMT5*5vXtbEg9kcE)(lfpA>Zqj5mY{Ro>8FkBlBGW|6Sh3agy>YF8>mduEo9q`eR65d@$MKHl$96}% zlL;X$BWINgH3?)t+BkUj+_#6%0?>IIEa?a(RocyOk6*O@1Pk}~Svu^dg=wBzJ?Hz1 zK|2*YjW}Fs=;?-i4}e@r0%a;Re2bag!Wl?5j zb#=99pmLeh{j_Cdw(e8imm{bR< zj|c=7Hcgg*;FQcwnXlR)o8p~qEs@v8x`R7Mu}=DAVL89VxYkV7jn-J;K{JxJU{5w> z3Nd`d7T1ehQ=ki7M9s|DLJG_aZ7K{}h72Jr6IODUSPaAv`2QRP`p5%QR)GJhsT0o( zcv(wMQ#c<}M^o&mLSP^+HV(OYAUs|7@tB z2gjgpsU_}d>AjPiZIXe3vA+_uul;qXNwE5uzJYJ|D7`twvkcM-haiEyOb~&;4I_+5 zpfz*R=m7*p36i+o?OixpuX}cdTUg<2i7RB3T!JaCX-o+>h)viSaYn)!uZ-g%5G}|9;2r8Zb>|;aoJo5CiGsHGH03?j*vm!(CwTR87>QkqZtDV+QG>0RD%g{hk z^^qwiRksmYetfmNfBe{-hR}^yA$@2jDMfIHpYDhYgF#3uFZN1Warzu>XIR~i6QPUI zYy1tKm@&~Rh#3SecE>;Ui)VnWFr-qYaiL?l7w+N^a-0hn^V?fF?mi~ZLiDt$Y&w(4 zyVM20U%j{i#l9?R{l+-!x5G0B`5O@J#n#@@j^YR)$7x@1V=iJHAHEGLO&6)Ozq@DZ z470%^m0lekA9@9jw{FqZ#pp|d#z51n5!uAzVO$9sh2tb@(cvT~JZQ{qHr^$Ua@13w z=-y+Rcp{RC#3cQYjb?eA;=#Iq(ZMS2U6Yg@zQhfMqGEF>YIrdHh;avORoklQn&^sF zdj)YovDD^pvDJJK3^KIF>f*n|(Rvz|YzB$ZwU?l^l0<-k!$Xkafrn%3Zzlh&n<5S8 zH-xJVO`>e91aCYRj9a7$#Q7ogKc44f+`L!*n z&M=ww-oe&$*bBBFc9IvLBy|saj1#j+f(_ZhQHsNSWZNWK#O`&SNy>R%rWsjdc6#W1 zhHX#*vM4H>GJZ$LXLz3ie>g=cxApdp0B&H{2(OQ=j1W23q^IQMO`%#nJPV0tsp(Q z%!YMd(=nF}8yUdn9W-cx$C3^Xzh8E)>I1wdH|38CU~F>d8)1QGwgBoNf4#T2O`Y=0DUexg2-jyN#hmH#G}a z!y5$nd|hZBi%D6~NI+7D(Lf{5O>RMe78i>tZ++ZdX*X7Q0OA#h&t*h(r=j`AU_5zN z1pABZssLD2MY+O*w+>#sfQb zIGhZl0yOUmtKE4lwlV+IOqS5lXfhgztt_TAal)CTJ{#s>SWT?-GM1#@lqFmLMt&I|nrf*Y_)v5x3F?!T#Ca&r?3vP26YnOYBJJVBNWWalFSfnmGL8miyi=grA-AE5&i%zdpLs{ zSFG7tggCfpwi+6SYIf-UQ)N2;TI8Fx$50}njl|jKK`=D;<5Z>{muUxOoIn#6GG$6n zMYOAyf#az73aS(^NF;ih7{ejhmzs%7@7GDDbp135^AuuF6t;z;;<33tBZ&*{LJO#9 z5ub$EWhp6kU=5SGMXA+P^$?~5q*_n|N<+yDtATJR#Z0A#fvN>mN~048ar=^TZDv!p z1t)TsibB`d_H~+?}HPsKF(UeWQSTDe6~@-`iwIR)i;!a z)pCwb`stG+-to@SF&v)(`zTtjP}nn!&yd2VWVxu2qzR`WSWD_l6jElXK}{J&7fcsO z-I=Rg1G0Fy^Rm_?K`e72Ya#-zV-A#NlC0H^QrrhInrKqPVbuV-lTmNhO=*#bBR_po z4>h8#&k4Dp^RldU99puMx&(eD3!VAXQjml;|B#|nl*o%2ouoiG1&C#eI?RVXlCen; zA$QJK74)h+Z6vWpO#EDM2g^@yC>vDdr36|Q_Y7;qtJzp&R!we0 z91XKcsl+JGSMEycu|R|&fOTb-POkaDWE}Pqo;`>M)H=2zMLC|;Sq;f7;U_ogB_nB} z=)QHndb^+Vpy} zkN}y+dOmTRKcSm=qA(g*3IMALeYB0C1$U|jvX;RstW|rXytn&$Z+Cy^`R_CwykW083VF~ZRTX&}5qePsSbK~$*_eqs zBz2XlXWW1`FrIoGUrwWn@zGSgqW>_(`ZWp;&>2XU`YWV=Lv|=6 z#~s%r7DoFpoNgoHU?{aB^C(q72s(WC5`B8%<7-R>V%RU0|PxF-(2|BdfB;k95HZi< zpMuEa8=DXU!uLYu>LFWxxUH=qp^b!_E5=rpNs2W_LQvuhFM&8q7BvBIjVTNEjq>4T z=L(NBXrs$}8i`%qg==WUj4K8UE~iaR)Lj;~I&+OUmx>L~TSqs&?Arcs+Q;#VeHGxS z-qaM2i0>>u2CLfIjL{&B*jKXB5ngMU?%A+6vX_b7iBT0srn*HKNBhPc{Wol3y1b=L zkGo!pL{vz}C`L)%fHmBop6q!mT*e>bApPmd!HwN43ffEA0%gdabV;+>Yr4z>=;0fI zf$*>k1u)Xg;Cc@3-E^;B#8SQ8WZc8NfPUONmsvR2T2^av3{`TTMy6ph>0FZyEQuS4 z7IZm0VD&4-k&R~KG;`2esF-saC*mLD^D;04sNPNFsXUE&89b<|RUWXiVRPtfm&AVt zi=(gn(2V4E^wn4yaAcZ{w6=yzAZD=7{SHL6Cb_C3g_v{`RZG=&q&+AX&g|4$o$ha=@=>M2xiwoBS#cY(P+fn;s>jU0{#uwh>|1w zl>c;N-KuVU;GPf0q%RxMoe+*azB}re8>%hTikzAU&wQXsRauy~+Z0mqBDtUZlhawO z74)_^A6g%)ynso-1Yq!8RP_e3dj-U=YSC#|09jE!E- zmY)q!ez*xH`42Hfeh#mGZ@pFW9}plv7q-ZbKw*i4=zxqoLoQ({G&d6$9>5@quU`NU zRff8yf_ta1H-hC|U^TB$L%H+Q@!=NKfMqS40-Bn4dd|c$m;mh7oZ_Z)?va`pio7BY z6`hBiVJ1`Z+C|NUYHX{SIG(jbU-ze4Z23jEJuw_(WO5TM5@pr3Sv*1}^CHB3tF*Qx z%bLKvYH~{#v96goUDceFRs2b6u4$%Cv$|C9B8W7)8kadONMohhNR&i zP`q?wDluq_;R>U#PVfgEMF#Vz*v2dXnk6XiTb|= z57(oZMpY$B+bT@XEu=>2Ge})aYtAXNY@SfGFwNMZfWl6zC&B)~{^8Ev!FHoCJm)#k zs6@5AWQaM8u`MBe(se&tze>bv<3bgrJ()pqrTi4y_Q$%XMiVq2s;BM3yf70=Tc?sd zPFgM!{A8V~td~|DMu&gG9q(xkDiMOZq}MePyNNVulu?>G!DfFnO<6^Tw?aztaqu0{WRs}}0gWuAQq(wR zoCyLNoJw9v2vL#c7X?P(z z9dYe**FWy+iK3&w+)hqAlS!6N#2|qemm@<`HeiqQ*)*z*=E>};fdgbh!Y)!iLKFN^ z=96%&pABJopa2CC36Kr;eebH7+*ik=Sk1)hB|x_er&hYqt^DeRp zkZ2b;^F%!LvRw4o)Ig^@1sdZB+G=tPnxcvZ=RWsg?nuts$lyOu z=7+hfYLIWRrth9)IjS>BV<4%%Twwk4tk+9vTt!r?8E~w zyQx%;m-I`P7&NSU<{jbueU?>l?}~ogi-$h#N?4N-P5Wdfk{)FWQ>zoABFxs!9l9Jf z{bD|{ex|2(k-TGo)_&&5J9-fFeET;}_(eS7{=zdB{)BJDBSdoPSd6lk)Jg2_Ikeh9 zRD(@23FXO}{2&biMRg#Rpi@s2)q(0+WhCjq!3v`;{kZ@3wTaQf+Cz@pvf-n%;H`fg z)($-9@7S|d)+wd`3P)r^aLT!|`7lifD=IG(vYBsKi*1~7=$L`~LXdQSox60A? zhZNVtJlflTiH~9kz_Se--UFk(=W{^dJl6~pvsTn9qv>;iICNyVupBnT6X)ls4dojf zSEJUM*-X@OT*8a2g&uFF#kx_e4Jgm}ht34pEOxl^I~k58bqK3g@;XmI8bg^U655pA zKTEAukc2MLz3yY>Y+-aha<~oy-k_Hq93a8K9d9naCEN97w2{%FI40L7lPZbN^W)Yb z)Rq;yp{c;ZzuPQaek6qpB${dQ^1zc0LL@eG|M6A9a(6meFN#KsL>+pixd`0V00)#r zEr-7{Fo9_tUT-Xjjp)R}@KICAaLw3NYcT|5&kn*tO3tQEK8k+6FVdZ@iuRS!qP9iQE6R2+br+UW4bmm+C7q+|vb-Bs(nQ58 zFQtvRAl2NiaG_7idkd}$16T;<5ZZDychJqkh|O@3|D2?FvpZ!oVewb9c`hvV*g;=1 zxnhYf9NorqIp^y`@~U`39L7_@tQ}vA^*g9PLStig6G2fbk1?i~vyYZ#{ea#&+LZotp1>;q=)<+4UnSx$K6HY|}RlboXC0$RG;b zZy)B1-JQMX|DvJpJTHtikA_;^)dGmHxAWx(&NTM1k`6e1{2an_%k+x~0Npr97Yudp`1`|yw=chUx_qu)G9aU8u+}^Chk=rK*c547qNakVsZ~v(iXd!? z^djMy7HEhzv2W=%q91-jd5YvH@g}e~rLY6gn?f%T#QFQiqgM}dKRgq(z(ZZ$m1E26 zgCBR|b()JYh1@P>;+e*g!cRrCrrv0Ebv4clYzZ-p$qH_cYgw2|c_!)KPoX-)>-j_~ zl0Ci(jJ|%=coEFqJ92xS`Y2UZlDLa%SmY4{0?LRQ$oQ?cOG2ojDfk32$3tWkeu4(s zc#l!45#2H&ehe`#dUH?DM|l)EM{azLTek$}D4Iq47)V==-gzYH2KsQiMM1#{4RN_~ z7A;Axkf;?tXa$-F`ll2b6%ZZPBo1o9X2@ypgyHsuBU;F23!Jks*jPzqlqkr8iH%YS zjS_^^H4#5dJYzB|3a_Mi)8!IT-0VFeU-ggYSr^S0D3ZHZ0kCxy8#wq))F@>sN>nbm zW)y*;>FkL(fD0^Zo=R{AF)!wO9+WhBkltXCtW3y@U@1hmI{UpM8d9tc&OTYh3^vAS z6zoMYwDhgmlG4qninc%w|3O2-S%riIT*@V8S4b8l3o>1zK{M0f40b!5tQ#cMTT+|W zO!&t*+O_d4Ac$%rN&zc}A^3Pc3Mgq1Nc9A*3WJ!F)`}FBaG0YL?NyL}kt^q*f$6Op zpetWvz~}d-iUd=G{xEtiwvL3H&l}_CP}m!US4uBvqH5I zZhS1c$Z)UC2$zAufrrZaZ1l)sS_(PBaX$&(tsgf-`c$(JaXE%mqQY zJ3vt#YlCEYHs?FL-@gjTm#|axz{F6NnK|s)i0pXgYTRV7f_GJ(Ceq^Bs^4qoq6&E&;4JT$} z0ze5B;2ki#h1Uym{iNW;lcC{k@Rq!?^JF_$br6sXEf;0~@WCr~HY9fn7ZHJ2gRI|A@>#bF$A4O|e{rL~`Es&I zYdovucVnbx^15 zqs~Oes8C94k}}8Ew5BFTkyBck6jC=`>z3AZ)eKb+$`v!~RAz5cGKz~#t+IU+X`2sU z=|a-Aq^l@Fx@v&b+qLh4yAHX4miT2C0a@-OwO6$g<~ihTJVuq}LlM6a++oeYHU|bc ztkKXw#!NdLjRo+UsD3Y?n`^gc9Y|OPssY=LHzH|JOx)NiIwV9D(LUJ7;vpRGW!=bp z$9L$iS#c|eceSsI?8)I`TiNe?y&t_B!`j$8M>wNnrfhOF^2c;~YuL7!gQzBwb~z%= zi;@?RxFuML@z|YBmyz41?E# zQ%Q7+C^QPzu9jYjb(y>0t--fiY`KFi!1L-Qg_m}Lufj`Pcw5l->s70OD&WS=-Hzqe zt}sFO#9p;FG?3Hf7-JOq>4;M>#=%Ns)~)(Z)kvYKT@{Njer#px-6MB{n!3T>sN$`- zE>)y6ZOiqjYnU#@%rElMGDBSOI<%yx-7nNjaMMxJk6ciGk-qGOWI6EgO7Zi%sxY~e z3kD|2xJxcDm4MrLj^Qq#coc5qXlL(5a8ZF43}n_78)YDd*V4xq>2*DA){1s^gZ^B- znEQ@Sq>c`yBFN8SCCNv>D831mWt$@$;75>oXzR&YR}{7FA!~$bF_8!?q)<^f8uP5! z0jAWhg5F1RS0`5J`#`0!n6LR8oVgKsv16k()kTuGdoYqBlI^_+?sZa*7=pgK5g7QH z$AJCxjA^#SaA$Xa4^ojFG)q8HAv&Z6eEpkF-{Q?$iE=xS((oc0;G^QgLNgFTx>MzaDM)EgI?KC&`o5mFOYPuSNux9zGzC0r~DJOBJ$%iZ5 zBu4e|^=hLkPs1{B44m`~w~Mo}ssU$HBb^Z4*EQwd!}-GNs(KX>NHhADD#s!fc08h# z05_`0u~3O=o+^WiHz6q_OVurGd<~LnwwwKfW3TEh4e#e~s3eM^i?ztr3tAXWb)h>j z3b~%8F68=GG|e()O<5kS_-1jg-f+%XD6N17X|@->%|yl%A*V8JW>6t+H5sQy8qqf* z{%51CPXhOi+&9JN6qQ$31MN}Uo=V={jN^ybZ`3%=VXcwMA}ST=oTzWw6)eI8cM=H) z6OGQE+}#kz7MazS3XcPU*^1p(7A~{?pb-RDBAvm<&NZ*ghTL4yeS7sF3fKA6sNb!s zm0T+TB?3p(vPn}D+(q@96fsndAds7I>zrw${vxXMLV_-D3l|`jSO_c~pQ24?a*tQsW)7Y!f zZ#p0S!duWPM#l#mdIo(KCvs^-Fs85zZaavj&aXu0 zrYU7pMD*XVH@F*0kFmgp*q`{MF!5%SC>ZE1G6RVR9qH*9;stX`%whvk+QPsZsOVkL z;TRY&jVYyzXXSIm%x3v3cz)y7Q(sx{wS>Zmy)D4sevvDq=wghd{CvV=scYJ+3zJb@ z#EM1dsI$|U7lFDIW=Gz+H%|w)a6F@10y`QA{H53m`45rH*ru<5IC4fTpUc{>)WiymAQ2j^4*k+JeAB$7Gl6JBW;zSA^*uNNeaw_)2` z3UGg#O(&hnb(jOo1$T@XZ5=`-0iIf=qKUE_xQ`N0y|Md6tW)yqI4uTrt53Bpx;VfK z{Ap~t54qY>E64UZlZvK=KJR+xtNNVY99g(9x9q}stp+!a0c9>9#%^H{6}^@r(nTXu ztC#n&^V|wwaTZeH4Povg&ah8tC(FsInxZKa^>~&|QLyH~B$7fEt$ig>3Ei`kCQ<^D zYH%}}GoWjAI zXIuNv9|sQ(4#VF+9UMN6YaM;R_c;6=RRUh$D6%jk1X6o~Tpk#3h6krPI5_5rJO74x z9p{EeA9nF#@8IBYe|@(kc4e{NdP%)NmuW`+eD}v-CcE*2*9QPEGNh0tL^8KlP_5R7 z5`AKwl`xw_8VULexx72Zf_X&&OOj zG7}AYK8*Q(XCEV%Cu^%~CQ&p{WS~x$k{Y@NFB|5h*62V(8&t-1=d4gNG?&WqVP{w$ zvY|SMtPA(V+D0@fj9X(SCBbWkI+L=Lu3qlA07)9VWz)H#o?x^en}xD zm?SwjO>XCWk$dA(kEAu&W?p-)sXC>@@c!6b9-{_=ol(qD)*-7I@3ZE0l>O`q=PUj{ z!?fZW2iNyB`}_qSjLs-FFpmk(of_=t+Jo9?!co@!eXu`;q1bQ3iFOewI4&?ur2;Ri zVzl2tK%;c@NNUIdWRQ(LQZ3fThJVSlD+>Pl>_7@d@Qui4u_ z(RSfi6U3dHxGq_NC>e?M;LXX_^XI6?0!|i0O8EB) z-E;#t$=DKZ9D_8BUW8W+cJ>Z_{cLx?Y`!R;)B(Ml$OL1gKk6A{6&}B)Z;iqQhb)#S z9vtQP@-ppZOcHsTRm+ln#)`~ejRiM$*)Co$(cnm;29(uQSc@lDSTUdSfs|T{t`Uzs zT&7*wX%6zr*>Xm{82+p{mk8ZSPFEf#9wf(aMi$m@(q^*m%dm0@v;9y5qe*r~q}+Q) z1OX-eoQ89~gnkRbW_ZNQB_Wc%wzP^?Y#H}Oqxm7YLyQ`l(~i15{GD>aZ4Tky~7>S}{BfQK89 zbn@i99@&;#>}ZlR6d6jBtjH`ZQPo%TsVR-BunC`K!-Fx}Hcq|>Jr$8tccY*o9~#hy zKPsF`G>|p--(n;-R@?_B`RmTD&dt(${wc=$q&XW>G*DPN!l9$$2Rbl5&0Y!qeJ(+M zW%o!VM-sZ&gjhp!Sa3wMSK**9w+(tz<8>WiOb-I3ajC z1;DudP`>N|)TE>gz}-6GAQ01#eLN(t5(7N*r6e7pffZkl{`tFHIU%d zpCwO|tp+i+_;}Mi-^3R;PG-GwGVWBN34BN46_0n5#~f#Iw}e+hr}{x>BG)U7Z*ktu z+d+5Ekd0&1e4ScgU5~iNnAB9vagjPy>-IyH$uaIFN(YxsukCgMrf72$xuSn=idvnd z4cZi9y+J2ao*cfyE3=x|M)b3*ay@$b_j#wz7uqaNo*j~FJsHF{Nqu~gj;A!){2F$L zOHEgCB1I9=ob0WN6Mt;s?MQTrg->4W9n0z$&M&7nv^?&Y$TVMt6cmA_6cSmlG$AfG1@PQ3v?i6dIF(pt9t>z+&B&ii|ueT~G%()n_g|CE{{6Jy@bM>uFbwMLwESRRY*8HC-p;;er?9tyMahB&0GJ59 zH>i7eMG^Jxnx<)sCB3^4ymeBGHkhlz?G*yi3G{3UvCOpNHKGcclGp?MJv=zH5enHK$OcCxYZ_@K%Lw`t4h z^oK^gi|HOf8lkiifMgQE6G;T{0i>5KB_`Ei-T6;5?ERh38MT~^w;FMo=(5OgopTFQ zt!NQm+P5!v!tf5g+2!SRlmD!5*jXB80(109LH@h`CD-Yev%Y~e2Ik3*&8-3Bm8`Df zVP12WO#b1j{)N{rj%e-*)PoX@T2s=HbR@Gl=9d^UnT1*$hQ%m(;7ovdpQU`O%JiXJ zKhA9}eoGad=z%MHM%M=FHyryG-z~T&V+D0k<}n(@A8A@T;amgd_s}Q&c*adJf%_u` zS{bBx8Izm(YGkqQB2Ps;w(wdj>{I1(iBQw3AGcO9D)=4Ql1;<5xezIQS;VSL85u}C zAmKRi^2ko433FRx@k~^`%64jwW)|z4YlqXx5r?NwWW^StaushB$~;(H|jwL zLctho)>8qPYCDQBPu39R!C%bQi8+a;L|qjoVh#r}9_4dch*E{)qPSkgfv!8;M*0tf zCu_k8-RP8XjuXc^!cpoNetS==_I|L=AnU5tBthCUHIo~;8jIUgL}_8C8*0`K*w`J6 zayGWNB6SocHE=9lC&y-Nv+qc*zdF1vPh`i~|B_>z@))O|Ge*Zx@nIr#IO;IwuTp>C z?CENtr>tVp=Q3EtPW>7*?5=ARp>Ev;a%};F5g9E6!V|LL1(4j#ZO9 zy!9k2B@5P*#z?zBi!t->TCBXbC*4#_Ra30GfG?I{(gjC!OSQmQDn$+Cf$E*)X>tk- z_LI%0@ar^rl5`q1SRs0|8NS-YcYXyHnalo8aV}MR^!9UHOe3?+H{6H}6f<*j$xNO~ z11gVpXTXJ`#jQkZY2tyZ!Hn4NRpR{+7fiS9y&fCQC7rWQCLw5%1;oxG&P&+5ifj-= z=h3T?hwvG8q@n?alQGXE&UbL(9b`NtbKM--#(I7MLA8Cjvvs_4LZ;9dp<(AQ66Oz~J~@T|ch%K&xlVO(bf)4JR@?dM_;3pb-{iiE zm#`faj`ntsj&1ZXz9YhDbtL7uiwUxcM#(>C*U1ekH$+J(r;>kUJMZyemTL}-k;xc7 z9DU>}(-A#k8Omkq6@T4&V46(Bz`50$XyZm1V0%5u%)#B&L8?KXAGo>W!<}O-G8=QO zLbgpBmt^fF2Dl8vPw9q`Q?cOW_`8g{kW5yd6Xv2=qQ8OY?NJ!Wqmwr~hbJ%g-X48# zjMTUgaOGy~d@j0o{?3@k5oDFG6f;;Ab*)Rj_9E?U|clBkvBsUKtso8smXQT@9;RP}2NbyAU7E)L@S#kQA{0FML zQpoI+SwixBL;)!&K@MyQa*`19onFeYRdXnfO2ih&V<07%>xG?sD14xLj?e-5^DLi| zqN#8kBIg|KTn}vWSA8=X!P+g4H4di(e#U^$0O)Kk4BrXn1-MFHwy~U73S6`EGxDXw zTjDG~IIb_(+4z`K?`HY#F^7)SJ7d-^6aq^+mXSHF6QBcc5BJv|M-SSM4f`*~;V=O_ zN=S&uVZd0k{6tbjdnVh-kz(`2`~Bl+a$%Wb)$Pt~ubg6ymb1LpQ81mRujzQNN^vxv zvY+ws*6v=I#8O0QJ7GJ&FkGe{(|LAAyPQH^PJJG1hL@QHwjIE(*tFz2hf;82jiJVl0xVT^zZ{Gq$P&YDuuyf5uJO7!V? zW8{DT@c;4$HhAmn)kmw39^{kmgMrxWt)73$KGxv#&7(*7cOCwRf7{=Fy++U1)*h~} z!MpaO_P6lk>u_w7ee@DIt_mmEaZ2gokS(8(VL=l!|mrfK(V(wSf8f8mEuwg1@d zfpF*+Klu+1a?AFcc#`bRI?0D@LaD+oJKb}TrLf2m@FUx!@iku??T>(CAoCu;s?~Em z$L{_y>knb`xyDb<@BR^fqkv}~K{3vJmn;nia5Taxc)mnu?&g>Kz;^#jiqb4dAVR!s zGCK;AHbmM6-221z)+t4R;Yb;nm}iUJhD-$tk3kU+=xkGx_;0=Bzjn!gYsLRuJNWj`$)8|6-y~lrkEqpKJiD6#hwD#= z?fRb@^yMG?`vL2!ko8Kr=#8f-Z|O6bLUUtlV`;zS9k8zxis)d{D_#Pu-I0i;+Crj_$xKH zqFVV6rDeiG2XF4&`PM&sb8tkD*1|_HfI7d@h7R5|f)W=}Vyk2{`23l?zX+#?kGAF2 zGY5i3*gHar>PCZ-$6MiJoVGlc1>{pf@(2``Z8`bKth|zeqz0tB##yk2*?2ZU!RZo2 za$k)MA=rcEnr)aQK3}G&fbPIy5Wwm6IF+U;HNg}!13}H&X^jy-9R zcK46J-#U7>dwf(sZ2+w5Z{f+w>#d(qxnGB8B1%2oM99*y8P*aU@KD#FmsikO`^gi1 z-@=6<5w}y3lwZ}Y|E8?`n2t-7OKGEHR-Tq|I_9wALdqZm|J$3 zTXTlFRWi)dPVyfLodDKACwLd7B?zkJ9YNun;PHb42T*ueCtjIoymnqZtqAUReaZ@K zn*!TG0UgKo9j}CvVQ3NY`^_5ANJdu(TE{n&Z?AK#L@v{^WeCT+WN?IDBbS~0g4Ig3 zVGS4n!s(7z^(VD)%_8>et)o}%`mj01w*QI$Gwe=dt?}eZeb{K=pD{@2^ZHs_sIN8Y z>z}^khEj--r2-~(GJ+_v@cvSm= zJ%eD(=V+MGnlv_-7MYrGF`RbH6qNzt0{{VQ+&6tw3wG|#%nBCI&4&+}X7O-!g_|E5cihmE4}}_W`_Hg_ zf-@R!)D6UuOWAHTld$t=O+64BaZ@?9CEL?9Ul``IiedV;3&Y&LdkE-Ge2rHg2B zHMi5NB3@kS;$4+2_*K=4n_5NGpF4))5Vo|jt&$;ZRSm(`DhwefI3!5Us>YGu01R_L zS$^lpbkGDI%0mh|Y!Z&l2uV&GE2e(Q5P!H~gupk%UC2(HouFXT{%R*c_24* zQMmK3ctE|nO~H!%d>uupUV1t^J41d6Jw_TKyQSstC@1R}W#PCqU0!%+j&XZXjQSIC zbXKJ16iRorJuloHzPox4+sdX|e#MWRD;-{xhas>VRP$B+iZ7u036g!}0*73gu6MBI zyG9T2a*~ddrGvxgJBP`^n*T3ub`AJ3@jFdJyKmztV1g8thv zMX8lF;IclA7tO1wLSI%ZHW zF)L|#$!)ucFEy)ZdD-Gf?%L$4u96OZ3#&YHRj8d;_3eg%RmmjYVPCeeDIU#2p;{xXI7`?X#*1tKDTGc2ZN;EBwkLpTOP}^-A0Fi8}s1dxeA?(5P zRo0IqDGJj-wDG1E@@Ka0D@#^ytc#>t2aXQ<(Yf1-*dB}t5SRI9RHmc|`qr6Ug8aeG zeq88}1kd^)9iC}`+v#Xx&JA(7D==nT?^jomr-1*%57=eTC~Bmyw|Af{5E~02OlF$K z=BeWqcx1=Vwz(`a#y;izRn$F|=hdbjgn%m*sj(fTDpSl_schD}W zPNUvr+-W5L+(e;VnHLouo;;V`=zM9wD&VPC&jq2sk=FF_T z)|2u|Ze|s==JxfnqOYfO`+8Z?*VF30?rKh7s>hWW;~5^M{b=Id0Q9;~;#w-~8M*@$ zBT@X`+KUJovDiry8K&*ly4xmo!+`VKXRY>oYRA~=S^6O+qH`)c2(Z~-MdhH@I?%g3 zWie98p4drZb*Xp9Y$Gw6WnnbCMKODt z4RPxWd|R8(t~LY+(8`;`9pB0mQk}U(gLuOZA~xF6Xv0r83OauMK#!Dga+FMFL${jH z+e&-G5BxaplkbpRRwYzqFkO52enT2?SOj(bnlX#~$U^(!%64)2@$dTk#)fGm03D2* ziy*pVW=|UWuhhsUzrledtxYJMd@|w*S%^n${k!dzOveD90)&d9il&kpL>~%NgH5OOgN*e0`{#tbv95|Lr*dZP07>D z_on_A*xl6~mbdEzG|!wgygdu9mU9r|t9)$WlekH37!~OL+t+ewb%Ym5!)e31c{JDx z;a^}SwvXx?GR8t8!g`=2&;#H-_zYc%DN;BkS7P6IPJl{Y8OiBrG)Ox`Xom2#$@#>n zvGngVjD4MwqXm;Sie&tqglc(A>Vn29j9_;P4M=EyjpRa1%|$lmP@3pF9N52bY04~5 zdF;cPMqq|AP~FD`#U?1+EQKC)A$lmjblO9k+^HKI#p=Dn z3240o%>v!z*J8_oTv#q<^w!$Qvt_Hr<&YD?tp$KLKOaq|t!_5y&N3U!OHv%5O*Bph zLs^Kk1Hr(g*68SB!GzAq-xPgCPBHpzx8Vk{J52OkA#>_yoM(pVz%z_^O#uhD2vGHH ze%qwi&_ZpB@r=-vBBk|5FSZlT=CRVIsH(K2BTOJ`*R`&FLK}|gFI(r62E`?za8%ew zG+rSGG~#VLVhZ=$CF4%(p@dsK7X;v;j$uP*7i8-wV`06hv=;RzCteXkaze4wQrSpZ zg-2@>_=ACig*NEp5~yh|V-zE<4|DyQmoeQR9pm>ME3+ z&N9rAr9zjDGDNBTtZ20g2>3KvV{nM6r)$VLV@Pyna?!|>8WyOzP+by824i7RR5j=9 z1Vnd(Z!uhIHXs#fMTIS6OP)aVGt92(Spf?b8MCe~K>O%wm;K=d(`-1#|xlBR}CN@coPTw&mTTJuS9uM_n0Ct zAq>}A>yObN{1Q$wd6+zW9JGS;*4?XZX`x4teJT>dM%r2R0;Vc-7+o7${p+v~Ap3wB zd#$H*9$}BC*VcL4oID@pV54km(%LtL5u4Wflq@A07B{mUHuLS{!X_IguV051Nlnu+ z%St|qclX|I?Vdb;zO&7N6_dg24 z8C{m5b~Mag9Oj)nbp!dzAwF|M^f<+Et6yF=N7H6DZBCn=<|WOWZQI~YgMpd+1AdOC z4PFiUmGQ5y`4|6q#6LO>#wPr6*$}%;Pm0M2IGdu&GKwDE?(C9{9VKXHsporOp&a{e z-}xHN$N9ehf7(as_s_rX6Z!uko3Psb!hOv5|65;M|N2|w|JVM*TKnO{_M_kZ|Nb2x z>;K1#&(42av#V^7VemXSPGtyjT1h!&qmP$ntJ%?EPimAUPezwr#}Pl89l_n z2`LZu?)ElAC0T}ny*L@BAGZZgY~&&i{d*FBgV=v@?ti&`K&>ask|uQ`tZM`04ek3z&;GOSXuaDV)JOELi;mrT!6T{8ka2P?Z20g8T@HV+SD4D) zmz&C-PGzrjDtm>g4D3`e?g56fU3g|7Twy2`dDLn(up0k(ClBA7HbX%0j_GH_kSYjV zKqCn;s6()^9A2DYYzuBahMAe+APVjf2Xg2R%oKxo4mZP@?STl=qkf%?V>Ds|{YaK) z9|XeCgFrY*W*=Hl@%erHGFzpt+4=4gqn&3ivZ4e40KRaT4LD0P)z#1^0|({|0X+NQ zqD*X`z&KAklS!6NaJbz;6J8f%RI%#6L$KBh02Zf{v+M&%7lZUe3U!er4YJ_{4sOaJ z9f(N+>5#MR4*d-$Fi^F?EC`#s#%&jOQ>DXrA)5GlTOxAHhTxO43$pBp}y2 z!)IJTL|kJ@<={rv!M$I2~4N(a6QMjQw*Uvy$ph6 zhl#fFwwTr_s)jd^)ViyS-i&!V;8Y+8#kO%du4)5AeNQHuLJjDEEL?uJip^k<>aYo( zzg#n|BoC!#uV)sx}a!|;+X_f;IQwO{-`Sbkn zg8=eb@5&|&=4rQZnYvl)DXxhuuCta3607oXF&KEV`~eO4dAu))ZevDyS|w_&iG4La zMdiUtC84y5wz2fxlH;#lo=j##0x`C=gL87YjN)8#zas z+U$ePw-EG6+gU&uw}%4>+FaHo2hq8Njm$nYWpqtk2TST+OJo#pbks`+(++XYHQQqKA@Bn|B-MKPc|GQ!e|@g7DrYEpsJjD{ZtCzn-XqHZv}Nc5XCX0KGQvDDbl?Nl z_-Q@g**o46-TM01-^>Q6E3Vf?fB?EdyM>r}9ONnugJUBk%gLV_5+*?>x;xC-p2bir zD?q`LwocQQV4W5U;}(*F0Qy^u>omL^uijHS;&`}@Bo9uqoO2%e%}|okMRflbO=0z|NM*_?Qkohd z$2}5lH6jnKnw3hpooHD#jw<3e4XOB^Zn|6?A2ONIUDJx;ZpJI@a~MJS#mQ`lQjn~( zlTZumIvZy>a>{jh$ANsyWx*2Rj`;ZSal@%4%)=X+)29LZQZ#pFqZBVuu|VwQDnD~V zid%_QES~aPkW7R=Q3uQrj7J#-a>5K1j@+r#MCX8&tpfQ8MID^52s{X8D@YN*^l-=r zqiLx+2W1o&e*;MzZ-t`BWx7e82tVqB;|5rPWmJm7nBCrP6Yu0|ZZ@?*er7J2=sFCx znTQ&Rl}^|Sw}H9Jr8%0E)OLywc&33sKbERJh`cH*$9e;R_cUby3gajF=II3`nn!Wd z2#dpy>!$-)ML*R@4Tx+B%7j3L&Rkw&r};8!FFb#6(2X!erE`>J2==pyPya(;q=QB_ zD%k^}nSrMx#f(kk(OAm|$QuY-r2O$DAQJoGX-r&v^zSf5k)J+~iRO>Zw@A4ZHDgo- zScVP*-X$1ty4WkRAXnC4)t{FZ!4@i!IP^^=gPN3gOPFPn1R2zL9 zG7LI0I+u^C9F;gi;lO?30U<~0)ArE3qA1r z;XR1F9-G%>H(MwnPqmO{PAC>MZ?tgdG_NinzSJt_ZYC;k-e_STeAqv8VT;W(V3BCe z$Y{~bWz@yoS|w9)FYL4>Qi6Rd=_QJ9^3iP4wa^p|UO#4!Fl2iPk~G~aJ5K2}l_l#- z#F4(nJ~r#5JG)qP?8=R+3thNE7uAJy&6@GLS64AB-7H!CIeqauG^2H?uHfw>Bcutd zQ0YK;+Z&B8*i5N~G4oNU;;BG~6N`W-3;)(o+Hq<$wwqk#vlmx5XNF5WS4hW8^xf)k zXyJjjQ8%QE5%V-%b4g}`uTR*BN0W`ryZd_*VJ{qp9)|C-_p4~hFdcW%aU_cLP9eX$ z7zIA40D>xYshJWzM7o$2%y2k%tgV)M^pI3$-k6iv=+FTY`E*hbyN16`v!r~Et3jJ8 zRHRF8ga2uBiT~?9k^N6+oPBZgpZWGb?X_Qa{(odm(epp%yRYONH-8A5k?=er8?t)#rOQitURT zEl2DIkh8a4ze5J}A3N7UaOW(i(bL^v<4)ZS4DYYYMkFS;Q=R`91gqZ23oX87e#2(O zXd(QBlO7%JyxcuHKKw5Vs?`V^Qx!(gjyyCCmA0b-t9l_0#lyzPROF4ws-+43K-~ad zey4QGvpR%eyFVJX+_GlqZ)lPTkpl~Qh-CxOpwyy8vq}b4HPHyxxqOMmOxC+%9tCf; zcTrSW?q)10b~9D};q@A77KE8$i4uhhyXA$7{qcr!XtUxiz||;!~L#L&nKhV z83wL92MMV0ok!Eiq5uL$Fo()NcW8%P6hjoVkeyTHaD)AdO<0#mCzv3H$+OWk+ z_Z<@ zsq`8Q+7Z**u(sr`4po7Cf*KvU<$~cq#WDCh7$PP~I>a60Xv2gwQj&o08ZB-);stOf z2d@gZ;lt5}yK+36j6Pa>N|Eb_=xuGRMckU{ATh9kv8VF1jjKLQ$m?qV3elcz7~FBu`e#QK1#oG&-&0LOYpdra*H zNOZ`TO52%^EGvV*2#+^$6_$9xbk(^5tR}^wP?o0>PmFpEoYwd;xRwqNLBMpsYMac2nZWkgQGf>gvS zR?VBypjSdy;Hk6jrMmdg{6rIFYI0)^GE&p=;5mpXef_{fSlL~{+x@pkJI}-B=!#(H z@M!m7|78E|>kWHka>g5mw{ytBD6hshxmzj^*t=%H_z}H6%}0aTRE`>KBPQceLXP7( zN2%qAo@$;*%k6sJ=R2(Be?Bg!g^mr;Q>N^ML5n_$N>Ko+I&Bo1uA8>$bZk@*k-Vhs zIsAja+Q*hL@9Re~QuX(C_=k53eoH6mu$zka?8lJaRUUiFpUMmZZe`Q6D`niYk%260 zpnVtkX&fUZZ*ZkWW^gAcmm`X@!Ns2mv$Hec=Mfm(qIzz z2GeQbY**SOTAOwC3u>4bnOrm_1c=M3OXg}z`RsH$0p@c_Sx>a=Vg-b-6b(PJU^wQM z)bM?d>W$fI5smhTa&wIH84s`-EA%@Gh3?>0+Bp`E$Vc5p}bT@E|^L z$gyQ|6<_?_FrDAjRMQ%0`t#gb8Vfdi+xae=_hH;{G0;;p&d%`KYBUNYvvjl3aL9yX z-hMOJMyMkI1`@7#Uz^vs)*)bQV$MCPfH&40%^gW^+c zcrwBTsx??^G!^CFM;=?fI~rd%7&WjH725NxXL@CKg1?}t9*LL4vVl-X#z!Cl_R;KI z3?p&k+ zvIRNubq!k}XWM>d*n)Rz_AgBo46FCjX@Z)Pt!J8^Z;Jzcu-=?}{W<<8$T#H7F{C_Z zydF?>h^YE(Yc+WW0>HB^{8iuj+a!Spf15P^Hd(a?yxVTWgPnAU zz5%`-mc_bb`rGn0$vgvD1aa9Rq{Dsz8kf#U#qTXC%~{&rq7`aivT|!$(n3D#SM*m_ z8i0~b(hxoikzUxXWlN6;?3RBzazt2FyZuQM#i$Y_=ug~AGHH_SppRD_m(MtGzi5sgwabmw$qI2skCp+y}?DZ8J;{`fE%aJx*FVI|3spJapFak61| zass9F*e#Ars2NHgd2S*I)R_jfo+jHIz^A~_Q-;NPV-J0MN)SoW$O$C&t_Sxxc7ZoN zk7?-D`~5^$;$=1Z|qvp#CXVv`?^#F77^gTc%r~Hl5{^z*U_?ORJ|565DI#oY3Iw2q(2)Bv~?K|Aq-wg znCBHEn{+;=f1j0m(NpJb^L@Q^nC+5rQq4xmx~^9gUauq-Z4v?Oll2CY4;b%{ZuofY zjN0@L$jMp-QKo3BWiwR?E~3YD?Kno|J~nmm=I#D#9E*K~apoJLWGq@pXnI{;NkOh1 zv16vjX~nEXW0KuIjx@MlUeIFGo%9g-eP6N3{-qf20Uc5`FkgH#;YZOfV~X{7@hqab ziipk?@ud!eH0j&s|M8l`47lG91rx!5Sy+&eZk z2f%`W5IJ0|=1x?T`mL_oOZy!_xX0m+uug zjpbM*>WO|yPjK2Z@5*1f?qlF&64e?1_Zy%RdeeAtCYq3WqC}8b@516 zbY1vJqGquz@`jJjW-)x_zGz<3F}8<)&Af)iY3&Ll!}AjM}4F&NfS%j~=vu4b$6`1SMU@o`RR7_q5Av%;m%Vf`a@I(`wfQz#B z(O(&M%H8Hp^&%xZ9awu2vV2a5>VVgv!RZ34N;cTw=JH&92GpX1cIR{?qar!QDQdTw zs=VBG%~Va0M(niC9Kix;JO;2v8||r8_&G&(JP*bqp38?E{??uOekr}mc?@M2cW>3h zRQNq?^oyXF9vdVY!Rckz(NXdrkG?+yf&8&!+ucB0PxJE$jAbLLu($uRs={n_Fgz=% z0utZh^R448S83+!loY2>->xh`;(NTl8rILXmflh5nIa|Eyppi`VstwC!cw3bQ?Uf- zOyBx`!HvyWEF0c6*zU9_2$sI9R%+^RO^n3iKUVfGPe)#;iDn}QpT&$7M%e6>9^nl02FTZj}_PdEFgqHG}K?_VOL`DRNur}V-Dkg!-^R74~?%MH^K ze8+w>kAVn13KkzzWl43H4bU5XF6MUm4rq|&u#Mb`NF5r>V!gVOG zg~Wx|Yj~`0`l672ig;u%Tf-$Zc2T6qCuk5J@iIp!tv#9+a!TEE^w;$m_YB5Q>`S+38z3mqc)9I=m zhco7|2ndd8-4Tq!elqmaG#Ko$@Z5}WI@oP0Kd}5Ex>LNKbL7Z0bk+^`tciP6c}xdJ zi>PL`YRzp_X|nNFsMZV=vuHV8VyRHn#+F={-$wgd-g&9qV0rJV(eww?!f33W(`OE- zLQQCy=E@;uzi~hk#R!80dJ^J&UCr4)hej!%58C`@h<@nb4AcJQwCM=x{Lcpfd&c4M0?igT1j8!9O?ay6 z3_BvaV7$c8nAp}WXHGrcH1`Fkj%n2@=VB*ZGPe(?ALXGpL9)}xV9Il3Gp_(dSObDtwhgRiDGkfP^Xpn zbn2+{X^}&5#MzZ8V%u+JVS>x9c1HBU!3tm>^S9fNCu}QX zhFW=l)i#5gcm2RBlc=45XMUMVxaq;@w1byNCO)A008T>=5mrKVHIV#Q`^}?C5DJ7grs)jisBhOq7_fUo6{hF%E}YZ_d6e zL310;_;a_*=WLY{=#n*S=P!09OE45b zFGNiv!YQKxh&Y)_)B^Y6ndi+)*Pe@%c5#cNZypYW2O9T3>3qbKaPFD*p`!^vNRyRb zj;Ggke8|R&9S(;LA|M`S^wuZ-iY|C=7F;WVjvd~T510oG4GO?P*A^l+4*#mLs^G!Q zG;oS$qTB%+yQICqq)v!=l|5bgB86k)d6aC851lf{gi7m}DHCs@-F{{tIwElp(W@7U z6_qNrN4ZF^gPZ~u^RNqE+3Jbkjz}0llu(1RsZ|V1=ZdacNEqfAjzOs^udHUE6dxA{ zDeH7`ivfFH{r*MMD!FAJ-7q1X&Hal?Co^VdD!0Rs*bDhSNxKVyow_F8Rwr;?rfjO( z;3TSZ7GQDY!=A|(UJ2^=n65heB~>ymqofforh2G2qA)&02f{)p8i~NmB^R6B4J-5^!0uVii1?7^HKTTSPzxlN7{B~ zi?*Y8Ahxo|WYc$k?C%Rz)c^o$I6DS+4ws?K=j0IfWT#c4*(#LH#G!U=uf zbT<3&j=WXgug*T0CgT&i@mV~MmHzTjj(67lAkecM&&8(iE-<|pFJwjX21*7DQXl5V zCJ!f8YZj8n0Hc=wyHx>|=k@352n+{`^>Sa2s+1k=@!^h6q#wLTMRyHLJfEtG!-qF0IO z6_{3PrtL7T6wg?vk9cM_&>|Y%{5MMN3n5Q{C<_Vnc6|S0iGHr!@*73{-+(KhuK>s+ z1wb__dFS^E5?q2o(XoZHN?s{R`c!8?{zA5MQ`Xp8z;Q&(l66>D`EtG_p6@XjDktRT5ko z_4JmfRkb25$|5M>G%758*9N0bPwWU$TB=!*eKH%Ow4P8p3BG#Qdrw*-iGKrQ9d??- zNhA3yqh}OoW75zVv9I6m9Utx-lZ$u|XIEn^ZgTM!Dix9R{q^phCFzADu=wbu61mPL zYLbW{unU(OrOH#7U3qB9&g3k2T2tz)+A0mJzuF$bd3y!i{8Y~0SI)5M!bU#Pm|Iob zf|LkqJ%~X0D$4=h44MWHVoA~=k+}}^n+<2;oGUSMFji|E0MKxJIJuQ}v0n}#DTyA* zpYc`Gb=Dh^=uGCW7-4jX2IvDxe$9PF2%u1OF_Ey0gdg)!x9n(er(W2kWG;7beb0nD z=J1$f$suYXV6$!`Ce2p6tC->DLSn#RHa=Uvq&O@fhDV!TMOAQdZT3h_ek;M++#JQk z$|ore6)qAtGZ+NMZyWi!7P>JhbW3}qn3shvITof}4!aH|td(s4ovXAvn~K-Kl;|k6 zD$%(ov+k7Q)*Z=u5XHr~PW=<67Swx)?RFzUXB&~Q!!^qdpk_Vs%CS8!cO?R9J$wu# zxu?@Bz^=>DSLlm@1x>wR4RtHhK)=$-gqr`YbRw9MgC1{8{N(S924{mkhXWEdiDWKBUN&)XYZ*z9Va-Q%@2*zU z!Z6N|q#s4aWzVPL4p+96QqHF{j#zeA6|5MjPq(QOvJP+o=vg%6xN5bCEI3mES#92W zV@Doo7ove`GXw-rzriFeQqQO>YJt9E!c@*GuW@4iU@+$;j{P#NIem0hd~S{*yy)q0 zi=#mwI|nVvgUKi}Nh#yRb1Fa4^5A9m@`r%+WU+{U^o+zKxa!=oO6KnQYJfs)8jbY2@EHh&*GvG_jUl-;h=Or@~ zkC(#5KlIWCl?QBG?Gch(t(Y;Nk1{6=)+B+H6XPWf67$45{5g5Oc z4C5?WUC~g%el{(+BvOJCx7f*(Hq=$81l+#;T2hzjp9ry?{U1#x2QQ*(ioE>Y+WXd1 zkWA0Ks$vjDx3gtU!J8tK%tLxiQdEZYf0<;Ig@^tGNH2&w$;LhmyT{vkaUSL>A|muq zv;+3Zu>s?j$wbo>YnKpE(2OiP)deLS6<30?p|9PLw%&MwVhnN1=fV|2!A*xuwN2 zC`v6OSdvW_+tx=r$8WaY9_`!?Nx4V#LFrOrWhU4>RxOj4y)}&A0wcrS^ZM=Hmlzu& z*5zzaIXZcNi}CFq9lqV)-`#&1Q;xGP?4KdJ)}AfY(950uaE6x|Dne$1d9$Q)ou6+k z$3x2UUfO-RjlA<&Iz%G&o$p)%*usqVw}b019mZEdHeLi*Iy7U{uR&cMT39!NIy58Y znr<>7p9zA=@GQk~;~Den<@N~-c(LW#-wvTl_;(XX1q~J{CP~8o6_Dql&IO%rr*O}) zOvF=|U)|w*yfL&1nqG0`yJqV8^@bIL$yKkI33G(tQXVdhdgul065sUsS6Ra0US@eW z9Sl0d6p66A$10B<&FYB~9$MuHEWnln5eLaH$_0l?K?6xU^~h0(P}e}2NCAi-2=c2- zV2Xf4|IVxZDE{2}M4b4!V~UZP{+%D!HT0OgYwFc;dI?W1^RtFC!+*_FcE)CtPKIeH z!XdZ|O|A8kYe7qeiXg_$2AzqmN%=l{!1oRT1prCV2Axx;h-n+K=cq=Tj0VEhfB-&7 zQ3FN*xd7Hb9RyA(!n%%2Wp1@g5ad zYA;hFTVhF@e5cCmSJWKTFb*OePF-?DZ#mU2_vxwHHay)@TO-MGG8cN`^^ViEmjJLt z|E{1iI_M~wO4;Rt&zLi6CQBS=hb=WvQ)FmS=Sl&h0h>D$%p^7%rY5Bd=A$|7k^)22 z@{Fpa_mQkWty2(xr|_R9*Fzzyb@pqNkSo=;>7u8)g{zSR*iF$WKhvw3;0070BWEt+Yc*%6_-YG7 zcdBy?#qsQy-?F-ER$r@MGICs9ED6P(lhBM(;`QC{zC;Y2cTD%IO_Iw;X@(VF3`axM zL7@j!&p*&n;cZ9-;Or>yKq(!>U*LrgS+n3+PO!OXK-|Luqmi?1o<9N{#hPUW57N@H zkeDlNA!<<_DPJ*!l4z5#>(t6>_8}gUMvR6(LOZMz(_0eYmS^*hRZ=LSOO(_^zDB=3 zN!}iPe|U_EOHFueddGBqW_)od8fRU`)N}(OtsbCYdFYbaoLzQ{2xC4HsKQZf9qf{! z$*&$Nb(aw*6S#TfZuAJgIUv@{?E~f^mzPH$hv}pwkSRuB>}Mq*7`L}k&<-Y*QeGu2kz|Pit?+3Na{>}IMCgxGA{oam9z`)=@<&2med-a|4 zy|h#+NdCCz!9we#mJDE=n;2eT>BBd8E08Rsz6eG?z6po{6vwTnh|Zq_$f#-& zmi{&eA=!HRVIg4pN*u66E6HWx*sTvYyJ{h!;eWWS`j38>EY*R%rHjQSkdq}^h4?>} z%8#XSfP?i4W9P=<*>KD1PAs12bUBZQb-)hA-e4Q%$Y+510hLNA1sW(IGjyRIXTZ{t zG|1roK2ipTnq$12U)ubr4D*<(GwJOZzyZgGZh}c#V0$?Jh%@(Y z8q&8s?yJ$7IpL&D{xL*b?XhupFobg>SdJ3NS6YDYX%Ic2x4;b`g?18GX#HJAok`aQ zBZuKD2ZoQ@#CZ_Uf!~lmM-=z2Azb%k>gR0;FeRJr292p4s!^2q5vZ1z8}}JZC2TS6 zE@><)^(E|Anc~j{>0-=*IRyu0r=ZNkqL21MsPD*A@qqmjd`EG`hT&S3trv0&ykJrU z6>%t%O6Q;G$&0PMz2ol>58l4~-dP+4VXH$3c(Ox5{Y)JCob5s2P;*8j(q6&GqmTrq z0;l7C9ehiI#2fVa8Bnnbfh1qhu)S#XRape7E-8kFl4{HBaWZL8Dl;3mSy2`v3v>@% z!x}Ly_2t*g%R_&|b%S03?!YjKti zC4n88@oL$eYNoECTm!cE(n05%{Zq)W0vp1+tjp{dHml!AwuVU!YGQ9SG4@AF$-SSZ zoWo*@=GJ%-(vlXjA?^Kv?|3!YMSDZ6q{El&6v%@tVNlg2vEm&MW>5^Uq$aQ#=}KzgAB-(dy}=Y1+?~yy<={mKNtamQQBWF zxRDH5h5}foldOvw(Xot;LGa_N-F>OA*%W;BEUvCaf(DL`51V4V)m|T_swdxDPD&K?@EjON%TdMeyiOu>i0XwM06VFya*N zLzoiZZHx(?ZAog%Q7S%cAM76;D@I+8vq9Pd+LIB|ixgvSrB-xT&AMc$gG`SbxNB+c^C zFl<*)YusfjHi4RBJa=Hr&>#rtyu#2xOCN z?d_FM#Q3WW1{-r5`El!T>+mJD0&CHkoSDYv)cl0S@BrE{j?*75Fu&=fe$lv7X99%6 zEc`^_1^>V=hX#$Hn&1Ohm5n*K@?Cexil3pJsC3-Q*f?m(Y>31DRW(j7pa`A|8~9KX z{n8;~e0f|xATH-h!BM59Yyh>W6b#b&TF}nwkNj)mKC&)3D>}C`nuX6h9Pg0a>lBDt z!K>B{PeqdYA=(N6=QuoDN?sWoSGA>`iZ+oWj5x}VDUQb-oJ9e#q{i{{H02zLAGS~lH7ZVuKnKHRzzFd;@TfsL!+2Hz&Pm3TafF_XZ_(t` zv_RIVeze%9jJ9_Ti$tylB3J^lL(`KOd@b&}c;pQ^h$k%dk^onq>!sjO>_R50L#*oJCcYBdg2bUe4{*cJteQahVl z$&|C)MK;N&w9%q7h+gSxDnYZC5;dfCnl+P-D^Fi-;|a`*M(0)sC7C! z!^3UvMEcNzo`JU@;ic5XRh^9sorZTwTCzV$;T$;=j+y3%k0K?9md-u`Zk*-{7ALE~ zO!9n&oF%2Wcu2te|M%V#MfX3b%^#1ya3AyUf8fct-~OS!*8XPwQTyS;Z`Sbs z=i&O-zu*7-J3bE{B(mst;Va(x$T{85kd7fEu)VT^@18t?BQZsbyX~c?PsvOxpN+?Z z3{!EU(M5!aJUK=-z}D{imVk3GH$6C#rSQQZJB^-oW>@m?)BnBu z^56A|_CK5<2;1%#?PKo#Z-4#G!-vKDU-B>C>iJXih;GTkM|#y9JVTBxstV&j51-`I9*n8*3@@akM?{jsX9y~MR-|y{K}ajL|upL`|qWu2mcZvC{q_2&5P;m%PbSVr^W&Yg$r%1@CDdfDkt zMkGgZ4>i<|K^MSNrvaroTE>B{aE4Fo-Nv1IJs3*^o;4hZjz*U$iRT=W;xxr+^E6q; zi^VlYd8Z_5({$HNh~nxYq{h}A`j46Ir+}FnmkTiv%CA`U_nrE zHlh+^r|9z}wx5z6UM!~e*br;r(@djb*T8vApo5lNm{BZP1C++V+N!o~s2V`9VU9WP z$;;GTs%B^h-T@ozqJFbMijAP##3`a8qKmI1=xEV>Xunxxx)2OsAYbhG^=dPn{_<^&Q`U^BRTV_L$ zJkL-|s*PYREI6aP{#pwP)K*Q(8(9l@OhDQVz>ANamkvzO=Lv)t-e*s3Qw1mBopajL zvOe0PU#qCdlcW_cE%qla-h~N=0e!@Im6izBrtNKKwFF|~iX9>R3ee?cN_t-LBL@@_ zJz9h*j1is5*$gH4qz2z=w1{-AD)yP8d9K0F8ZF!Y9Mmde)>;#X`@XnHXXz9w;NVMa zGGQcP9DnG2j({33YP9O?8MSwU;P6|I`ha%5O*ElFVcG23!0*CRKaH_r9_p0gg{|x3 zcHX?!5q-*Mr#I0jE3!MNRMRW>gV}RU^<%Fb{I<EqGA7GNz;Ap^6Nk9>3oMCMa-RWqQ4DfElbSu7U z3{48^h2(zIk$YebsBg!hlII2n^isH&VBbOrrJadG#mDmu%{zvz7EIAa^kfzKu+_$l z$#^GO?~l-|m+umD3{Z^ruEuKQGQI4Muj`mS4{#${R;HW8jmAbYPF6OPAY_t&bxr$Z zgVY)~M7a%7Okm60^RyGhPBXowW5&fom##2(?ZBoUIsETU<92sSm^vEZ1Vfq+imE*q z!2Q!r+mG%RzU-MEutr%qXSA+PeV(7rg7bfzMMwR3L_wzFv)-2z-?_~2S{W=m)@wvz zZ6qri%0s@Zy+bo$;CPFwU;SESS5-$nr5_%W$)$#RKL&; zMnfrfc*K2*!ld?1oi~_0v!b92^)j5_pr!6ZL)}ZHMy2rB<4V?QzYlUL4@+^0Fr);R zXk{1=PAKT(*u^z6_jDp7n5*83qwi+YGqkg9<7_u&y2jk@ty5GWnC+8B=~K z>%5`5WDgiL@OJzAtwRo^0Qk8iVS;C5Krq2DUg~BB=PEH*7`sArD7tN{_V=(-gcm50 zEe=L6LRnbkBs3ZmeHTX1t&v-U2A~uvA37kfgHC@+x)O;7j_RL*#15_@c>zY6?*E8l zVlj6YnNh+4cti??IG-##7`UdeG>6<@P3pB^Eo;doDkVubhS6s7DZE&1nEV)sZW6Ru zF$^n;B_VnTWc_|3myc+}ewtGJA~#XzBJPmuS(rD2BJXk!rGY`%cl0z0%2Aq9!why= zLQp34l6MUbUqYb@s9ftQj@UVz`$rndI0^Rv;lC7n79vuo*HdEcN`RbWNqa*kWASUP zbfXu;NLS4_=i6ot?l;L~-=0iIr=!sT#Cy+%`CUf|xcE$=L}PgGe7t+G?~a#Ts0f`R zVw6HSSwzJm9*O}93~W_kxwcUx_ll?3iN=>^$Z3RW4&pbDLz@lB0&j}SUVvC=uCr9e zIm_a#J}cSevde$n{HzaFeZ6zM1^@s4;Q0~${Je%X)tM}@`sMwD?H`Yi*7qBCU@?AG zOHN9Vkxsf!6T~P;_6kh;iQI?rTL>hFsj{`0Mh^aeKI-M~kWM0^{kn8=!d|89qWX!= z&BudIH$|IEHN^OpJyNL%?e0G!Q+x-<_~}>MGspHpuc&fWk=NuA@(O;^i%m@p{`U2= zokL|ZH5znB=J}mr+i1O=!#FmwQBd_oxjJZDAO%Iur?XV`u0vrYF0ZT-ZoSCB!3H$U z8!4*pduH9KnXH#DZ9J+%kUHgKF((MH4yi3PC(gAxom^iQVxI-^m8L#gL%6@!Wq*?n zaLP$4Mw9Felm8WXhT;y^m0I`fbaZ^UyZ;houA;K{yw13TJX zj<+|!P~zzB;i}Z`%M)h}nhPd;NBg+Jj1!?Tv0R-`58`U#L{o-gxwJ@%G*v z{Ds%OkvJZ>5_k8z9Y7Z(^wU^zh!Ch@Jo73cMc)56sZ}(qQgHTD@`>f*)F|O%R z_ES@yBjz+c>bd8L0ZorW{`tta1K-_qT#=?T;Lv~m%jK95h4>c5d^db4$WymPppyxuzA{vHmF-^w_-tK{viHz#lRU+nJh9(}*_ z{7xOnd+_ef!O<=81gv5LW`&D>n@^ zqxRReT4RBllv z7SV_Wh6liqd{BF2PGwMHmr>`O^BB5z0@d}GS|wWtB0FCKElck%Q=qU~pS1CJk!i(y zAOvQ~#8tr0(OS}%1T!Q+C3Umr%a?h0?nXbyjSaQoV7nCQ3%X!nV^{5UB?o_=!Y*4kzxFW;_uyDW}$=U#->#7kP>*J$b~V zr-0XXviP!U!u}#yy104n-j<2lFFoiaCE5T(DI;B&hrQ!4pyu+}>*_ct6yldjI}oX6 zaZ)%$B1I-@W62CII|IxdnEE;3WpB<5d+px6TB8sGYP=%K787Bs_O2EVXPE|3`x}rx z7`(R78>xfSXmlZ7JGJ*Ud&RKmTo#?pWtNk34s>ItB7>|GU{Mr8fFeVVH&DJi(;Lo$ z15aFJW9P+IPgl=Y0Z#90=1%65-tGVpKw!k4=Yy~im`jWKLZ9MoL$vCI(22C-NtY=^ zci=aSq(pb2*W~IJiUinH>(mlWjF9D>!T7v`idUONfy;Gmxh@<|gYt4cTdoJv>9oAu znJsrV>5R|I%MENfnL}B*u`M^oGo-v+Zp-CkV8Y7F&1^Zo>MbqzF@ztAbfx94Y`LpB zfceE2tV^z0EhVmUV>rMlW1!7kQ4CWGYmL>t8eN||I1bP@54(DtdB@Icp)^-Z58V5cYudMTEY`>f9wqxn3J_ZJs!X$LD zCS8~KK`c53SA&-~DsEQ#D|!@bt$`vA($8R{s!hUz)gOC>N3Lv$aMTsXSF(nPSnl#? zITyO=&p{7e-YBazhw5!jT>wQXVAi#a=7FstC#UA2D8&U@U4N794>()P?g*?48z3FG z+OC${iEhh9OIAVK3w-WrXV5{nxEt1~a$zdg$ShHC+&(qOE$1qYm3#{vwqDJK*Jbza zo$A?3o0Qb3IDjaoWP}K(7#UHHK>UsOM7%cs8Hz~$_Qz3%TuyPtxsWv>d(zZDd?4g{vLoPVtw$glQ*I#xSfSX~C|5~DC8;Fa)N0xJ_OvnvY$mB^i=o5? z4wVurkyv{1bTjrbX_OIGv{JdG^Gj4SOgl>iSh=vxD_*m08;)8F=m6>OisQ*}l{dq6 zYczb2e0Q!U{SNHDp1ZwsP3qQ}4MD`yRaiC|v|OUJlC=Y(_yt$4?2yBy!LZJessScj zuy~Z!EK`jDL2Jb?yke1+7s1>WwDA^O9Jqxcgu05~0CZt}76ZH0J%zWa1XioJqB)A? z8;!U)4Tp7VWND7-77*sAe1UrZzN|Ld3SN%uC6H(9L3BbWc!=aH)^%VZs{9#R#WEfW z$LUqMtrm~1l8sX433olZs0=hXG*0j_t#7U&S!%>kNr2ZhnF7KXO{T*+QagAph8lWu zURUYQp;eq!(2Uri`5$iWPLZSQr0cbY-#=1cKqR(RBp}oP|0* z@GK!8@Eq|<@`pk#_4ba`e9Jl;kg6aUzyt284;7@2ECB5Fuu7aj3J{rkR;IJ7{#e~%PZft-UriiNGg!B%)5g1)UBLw);$?( z1R$Qam8}BgGi#{J<2j(9Tl|ob^P>%hx<3r8q-a}z)Yymz^U3p^cmT+HaBor30MHiL z9teF0g#HBNlFXRexPk$TxWV5vqE9$^n%#O4AcoqBj`LkD(9PnfOk`AL?7N!SRf2HX zuNh=sioj3)2dXqDNUBW)CAuJb_>nS|=NtnmnygER9V0rM5`LH9^&BAkay@tHF~hlj zRTTGGlGmmi!sW83fIGF^r>g#PShEbbfYOW?!Yy>dC?Hk==lzbh4990+*&1LOe`~vM z>+ajb+T%ivNAB&{?%Ox++qWe({^Z{N+2OR3W6fe&zqi)9_vc3S29K$<)9^4A`Ha23 zzVKdOFYMn>i^JKek32cQTP#;fd0kbkrI2$sRHVVB*zC?%HAj2dD?8YbMBKas=QM@d z>XFcT#<~tNk9dxafb@PBa}!@x3z5Ns5a*HdEz@!hFFf_vcfl`I(25OWw+jpzdpi^` zhW8rz5-hgg__z<7u?y&u=hjwgc%eQVl>i4n;l`vRz?AS!8uLfiarOv+5nrX}B+33% z_`Eahp+|T1648p&PW#U7G*>(-S1K&oPr1y){8*}occf4Vfl<<^(F`uQXqM|=VCCY~ z!%ty<#zh!rD*!X>v5l)7sWS3nFHQy0*6kpsu{~6U6pBA6%?uQdU|B}6w%`b8X;iZq z?y(r~B{1MVTXXxYU&2aU&MpfSPoco=d^(PU6h$-CehOHQcYLC4 z3%x|RvpOypL4IKAo4?0y};LqEEzWW|SQI@VXvk$>IlI`AWFfrVP` zw!+%VV+{Q6lote5&IHk-@|r&|-PR^Imbd-Z%i9S*Eh2u&We0m}B3MN&?wztIUEPqS zJ<5o4ink#s0cI^salq`_YO>o8qnfBHltcW$B(lxTwOZ59zO2cQ=c7T&`@D(k**(YV zB2ts%8QKD@uGZ3;_UO%+5Sw{dXfIS57#@k$LXo6qoPAGnjZnCrWoUxi6UT&MB7Soe zD5m3dBgp=vKNlJ#4vj|+HZ1e9dXSR1D*(+CI5y^*jAggfp$5EPSQlsJ2}%|inAvN1 zBOYefEvQr`oNGUp8LbNTuF7tQbm#|~>y@{mH2y9NY7HVaWaiY6uGQ$ZNA+kv+**Z^ zT~w~acjmv1p}MwMpkB?A`iw3lu@>;zia(MGf*-yjOc8!$jfi+E&m zisSj>c((vH7VlnQ1UMgKdCE@FW^{DIXUzLGllzFm?p6kovk3G!Ac}w-YN}>i8BC|; z#CXR_%CTx%<}^ZJ^X9g&XiUds2;e~;R@=o zCqR!}^X$?tlHN6^^CT9VnUue-$+4;|3N`a&GY&7}SY*?E?$71eD{Tx6JiFr-Ff(v- zs@ld8`YMDA7DVoi93_N=0QNn-cJmxGJavZF`c|o%z4jEvHQmr*+z@>}mZu2V!FZ!E z@7YQPoPtz-@5LKrhA1%yCuu zbu2%&0VM>cQOKzqiY#8hMI=kx2$< z6ewhX)L0lHZ-5N5h$}L?N(gZB6xJ#fLuFSPjtCvWhTZcKraw1^-hM{>HnhNmL8H{UXahdGqQ76gBizB}dMDQeBcJSmqo5u<$>O=h@UjzK zKD)#XA3SO>A)UdAh=~dimIISN9!0tO!$vWz7{CY~on68anyD7q32NsF?wryyo$!MfVk!7 zpT|9SJTv+t_%{j&sTP!a_;dwyIBib@U~#I02GGzuz1~TQ@M=Q`VHlv_F8Y_qzft68 zhw`Go*^BWO*0(gi$3q_pGN8tHoz@rq&XRhl;>FgQY|?^yfC8rw2NuHMR8$4;_wkzs zxeDA{(C;ZRF0vpo#;2;c%4r)cgPgI$S=|nKd*u5?px4@1@SAPon%#AMzCTSEk z)VkBnq~Hoa76cw^jJvYkJv^gOWiMj!z;Sy#uG#6& zK)W@*nU6gIghz5R{!55Yr1z!}NE07}r;OG($4V#bu+^Il(&bH8FnHW~8fA$iME4o{ zN&+JJfHtD1EjEB=wjqO|m)*K0pl_#mM4eO^21onVP&mUV6i#M#jJf{&6ixYf>)GCp z&X?8r6s9K3BU`2_Tnk3aQBciA3~8r*W@sHQ22aGc1xi%|^xn19x`|GOXlR2Vxz_2B zqmiA4aP0NMO{Dp}v|^}y%SRZ>gcuUuFILF?BuvFu1zkj|?I^9?D`Cv6Fy7lFy&O?y zPM62~22$_2DYw0+#(XYjL1hBD_j4(W;!9J>a(~d`Oy)&|Q*v1(QuR)9FK;Z(*}Rnj zp^S2)`hf5O^WE_&RLm^t*5Y!!>Vym)2lH_9yl9>Q4kIfb&TfWoY-rLEvIKm zRGsK8acpH-eYd#s?$g~;#T|;cjQC!7(eT%(Q9^83 zRFc0`(gmDh1D~ULfLGZ7BV_TkDC|3#yG+Qp0=`$H7*oNa_ayfyIxzcZ&G|1eH-)hBfJUwnB^FD6ITL_#tJ&rNKU{ZEwjSJu=pmNfLiuj z+7hCIJ5=4NC9`To2SjyXM}JfiagDi3V=6TN>@37@Re*a?wcxJ}PizB<>LJjD8DVxG zZ)<_bV+Zr;ZmFtvScugOaLcFJbY|@ByxRTKZ;sjZ1)_Edp?Ps|_Lv5`oP zLXcPo*j)wjPO+o!)2mJ|?Piy-(v;~8z}q6jVR8AGqFIc|u78~Qm@DyOjy}yL%>TThv8}qkYNY%AVo_;8ErM{yeW6(MJRdF zL#jDI9sM~lu`qBTF!d|hRcs$-21s#oaft4;?r9wO9??|n_}vg=1=f2&FxzX%cTi*n zRUpaZgkl)1;m=OZuz!BOcDr6d;a)EwQ^7J76|k_}i1(yDkKvI2QU(YVjry2%txsm* zwf)Y1t*P!$8RpQwNR!&VGo3Kd+ABPquJG``!n42b8*P05_T|pWk6U~0WvlFM$bz5b zV<2+Vew~Mk!?Zi>^>H()Q-0&OTiX)F_bN=>aV3_dD%sK=YOSrVt}2oC1a@g{3Fo=g zg1UjmsL?^(RGU3pn_UcyX zD|TaIl3|HX&h}5-5B|i2;-Qb!JovP~@%N|7uC;_Geg&HEZqxuh>g72-M z`J>f4#29EyQIL(!e+fEte>S5&O9wt zyms$ir}hB;-Kw#RD>`+f+?n=*)M%VGL_@rqAg^**zm^y%$n3a?E4kyFdK#p!Uy~H6 zR1p4-CnF43LYmmqYpGDL-COTNpL1J>uKllI!l&QEU)Pq;N02moM~SL6YP5L3l7 zZf|D1C{+}vUtLWoRVK+=*alBUTS48v&H%;9kxTt?tywyerU4{5Wi8aBJe@$q0axI( z6hfJAP$W8BSnk{TU?8~vUZY*lOWw=Sgnw`?e5KbsZjfqM873W}$q*Y1h37^2CP%Dd z&Dp@7CYV3wIiSrUfd#4+2i+v+K}tNkc7-^ih?3OOm7m~KYdU;cMSioeqU&p`Wh;6I zUa$!U>jY8xl5@&a*;izng@aM;cbL`}nS&R5TQ84ZGz!g-V@WgFBC&i2_^oF0qM4lW zP+uY)!+eA)zj+4RHF;;LwerWcWT~{}5l}L2>ZhBV`U#r)<63z`J>HKuH?oW4sT$7g z=K62%AVXGKn`4>bIP#m@*@kwO?%FKL1;PcCBJHqmPjM0J`3zm)@?_~=Ywgc}1_A{n z@-eotE4g-S_mDlN(bZ>^pY>}XTOYF?20_Ne06^rkQLl-br*1}ZFz_)pA$}T4qm%ld z8cj1L9SWv0p_o>rjzGL+94D;Bb_j6`ILpE`=7=s_kpF!)Lh@Xne=k**L^ZhFtu588 zvJA?#T0yi!a%hKATK+?eZU@g9G`k}du9ujC9uLZ9zgdkF7vZ)|Dp;heS<4F1Z5 zYR#QbkVZF|+?uBbiq7r{$PjKP0rv@VDliQ6FYXbL zR_VZCr{bRG;REi8ZjbBu-n-VpDT!WDDe={kpQSUPBlBa*X@rtmeeJjJP5IK5)GM(H=g9WX&dPJU2WN#DKF+4S~ zw0>1>G_+=fM2>Jmd+G)$5q%>0O)MtLEt|Fy*#_}|=p_xwQa`TKFqL88!97#P7m);m zK!8_4;ndi@FM!4sx)isnuxR;GGl_!z>ggpJTjTu}A7()+D7A#J7lQb*Xcxh%XdeJ6 zPR{fh>6sFL=E^0veK*HofpPY6cz_W}(c4M9V#42)Zt&ED&@V93>C@n_<4f=?$a^mN zFo}=_u_tIBdLrkyAkW$-mZC=Nk>~6zsGq>kKfVFwwxSVvWAQ+WX9BV*G>pO(?(XmI zAMd=xY+m9}JVZrTCy%3g6+YjgVo3;uwBabk)e^Nfyrx(NJXxB}xB95Q=`Ma=d7w5pg3j!|EC zD!3^y@cFdi@8rUW3d}`q2abZB5-wi^jx1+^XEpf?=HKLuntk_ls z6&M}Qq7{5|$^1jM!JHIxSR#6YgIL&7m;6~BpIBtMVAinjuorLpOc&NQHD{$F?EILI zhjsiZf?mTEXUWeoXWZ~tV&E!zTagBZ?_{fNR*iYvR~e8;U+U2I#En=}T&_dMHKm3K zr>m`cn}D19@G@$dA(-Y~&>ex5<>2VS%HrfWk{=>Z!Jn>ZRaLbK9%~*xT%JG}d6`b< zZ5~8^%E!$N3vZ9WY!tCtLLrR$94sN&EEZiOvT`%d0;cpQm($x>lY4Y`_iy>Q1Dq1$ zJ1;v6H%5bin3JLQsXLhURDQu4nhnWuEs4iq8J<-efq1a~@X^=beEX+AuP$j&R3&nF zo|ubePf_am`DivkX9l*2RT3hdlj{M-JwYv9o=^e{_EyrhHXTw5z$!Ax??Zos#JOn8j`6Q9{X3~iwtd)?p@HuPl-8Om zPA3W*oD)7L&}daDzJg6lDr{^hdiCA`s?3M3WGDH{7|a?OCm)wrz#wQaeKlC@7gOHL zf>f9rGII{~icVi#Q9ZT!*GfqbavW9}*_BwWsgI%z?MY(#3N>a@;w$yBDAVMyy_AeE zu$iJZR#qGcZqo|w+k5xi^(eFOUS{{<^c~rv1@~L@y$_e<5}NB;*Y2&ZuG%C-oVw+T zTHSOEud}Hn{j6*ql_+E9h#SNqoS^j3a3jNjIB`2HBl*j6e}!~I#!iJfk7zKIL z-Tm^XR2~s9YIRah`rQ?alD4@hMB1llv^^I@GYdj&GF!E2Zxn2+5-@FwRX3t0XE!wT zcF~4LZfsZX+fO$%{*!53nhlquMD#6(;>JyDDEvVf64o6ca<~-*+uJX8x#YRP;&vR^ zw!-+S^HK7}B9jX3?TT}%(j119TYyvZ3sj-&C;@~Eb!>_hY26Fa5#a4jz$Eo+p|)W$ z3TG-js0_-;BTL=F?6_}d?%T^+5oJ|*9bjw-kQ)*93$O5kSSz+yw?f=;Ohf7LCk{>h z7*2rdlg8?E=3gMX927rN6SFHWY5*uCHP2R4m5YNE8;D1`sWGYFhqJ+;v82X=c@$Y4 zKXiOs#!(r%T3*{of}@`WjACf@Fy!bW3p2jWLi{~i2(rY%QLnT0%U{)v)Y-WdG=AlF zF-~MbW0=3YaElVkNZMK|;3#XOn6WFa`VEuGqsdrrVOO%u3%*RbTtFWM%ccbj@Eg^T z2{m`l@SL2k0JXA7TDssRv2K;yA+)C$3pfnHEQ}(~+>f+|`KUS>NVvbGlTjWARKI!a zlm$UYspWhk)T4%s=B9U^pu{%qwY5exYz2{*tI4W>M~QBIB1n=ouClVzVnFiG24x(u zw|G%z9AQarl&h)202bMKc?7q4j(S2c*tj`F!b0z#DyTu_c8DAv$r@;i*0{7$av*iX zy}^0Z&wK|xqY^^hk<M|J$>&YiU@ zldRgvfzH5?49l`%XL21~ETXXHn&1XS>HToSc&ahfYoP{bxzLmN$Z4x9`;17J2^}dpdCN9x*uT1ag3>cl6&dSg48u zmT00(NiiEtdb7*R>tr^R00QWfFyyGl2s^a4$Zf1aK2*54YFVfWrwW3DZ8}KxikV#N z`!L<^IgSav3+TPH&JlaKLwT~9{M!Ds;gHluyG5D1)4g~w8{!`zW01( zfI`fS3aRI_T!whpX%5Jz1@p9XRo^>@hR+2nUDvkL6mTGUb-<}W}p;Br!qxJX~Rot6(k|hS~()>!j(d=}PQYHSnXm7aK zRE;j@TcTf4yG|}6F@ z-q2D8@5mk!pI$nP@>j#rm{w>wYK_KpyVuXoW)s=}6BeO(8-CKo^;mHTSYko+u7a`oW9_D`OlT|APd(P-mQmRIlK;msg{<_G*Ya45|Fqdxa&%j)N3d1C& zQ$)z%!jkRPso}oAyZnmpB#zaIryG}x+`l>* z+2jlpVgwK{9Lbu@l-arMyfX~)bb1?g*|)3F^6?t5MRZ-L(eil|U%I#^%Pd<8T_MX z9*i`>48v{<((M%Cgi~DyIn-2L3>5=AC(1;o743c3hGGOBha0BCvl}bSq8jJL8u|HX zGOh08`0dB zPwbj~cV$4)_7fF0%$EGgwBmR+TOfe~M&##*PvBul`k|LXsi%cfYbB*N3#H1Akz&2C zjNXk&yOkiInNh!=!$HumJJQ@tW)7_3p;U%1`g#G|x3a@MuwKxGz1Ky>1yb&fyMb95 zvcd7e*mS3&dWsAN>>UO@V-nWfBptEmCYyBKe0Da0UW}$Anx$xC$plP-q41`iH&xs0D}(N= zyO9m{lTc2zZsV4L9dBblI#=RySj<9?LyHzp+;S_T;*%AtT+2@_A!&%y0Su^HhM!LJ zsqLD&8?IqB2I_&XwXun3mYy+Qqv%7ZnfLqb;AQiC%u$pKL_+AtzW$K;hjPIMUv_Ut2+ zOID>E(=nw(BT29{Nus1u60g5QWsQubsVS@w)5-LaZ**Z+E%=%abD?EoP0|Nk>cW^% zi&;Otc04;dw|-Q^I=UQb6jR%D$Wox_yNAr%TUAaCD~OC$rHKc5uWD;NjD z@DK}4;`O!;KeqMf)hLM^=p)D&Lv%Ec4fYJ*@#K>(-wI^xSD4d=z7T>u9C5J@Bd{xMu0KyXk20PU=c^(0rEU`xKl9IEZn0h5w-lV5*C1#n*En3fkZGu;acxtOD{DX zdvIHeHM)_kOVkuIbqS+_NXP24 zN>eu%3eHhUYh!n_S+XkWES8WJ(+AS#A?0I6m5FEdaa{xrL1Ux~YTJcTy zq5TRo_R(G_;g%g+Lt=RM0;A@V!(}dCv&j1JupIYd?G(g3A&7JMuU{z^Bqi`?c!5w6 zKU*3~`8<`fw>e1zqe_`|4+9r+mO_fIRlf4o$15~balp#bf*@e+KW@e(S190zgH@Qb z&Ujy;t6Xkj@^4&XwP!_1k^r@!S?faJDQpZ9RQyK7Rui!ZjnePMkkxD~H$qpgc^)q; zZIpTy__jz6d91v^XzcwT08$#DeKzc&%T1TB3hX?hYm-F{E6W6Fwv;Fe(_d6}{#OXY z|5MUx0o$=P7=Tb(6rS`6nS3Sf3d*#k7d|cTy$68P{SXVp>X=7BqT_-rN>8t&JA=ab zJk+0%OO4nT@$4!GC#&dmWFyw{E|tmbDyUb)Sq}tLSFr>=S@HIk?H`Rv({0t)yL}fx zGrz>R5EF0aRH~TfV14{uB3v?=Z*s^8*oUE7GpUa!qjBe~<5b!7o;~`ph4btTuiMaW z7GrPu0U2HS97Q<|V#=L!>TE1K8)9B^0RicJQXf+Sb>f_x&$#-B=heWVvj|SeAj4} zxlW6<;!ioQtdFyYJw18iwc_~uADhvsUU$Masghydb9K&EPhO_Rf#nj47T}?Qzt1p8 z3Rnjxr-8_;6zUNm$>choj%SjV_n!qCAci}o&Q1PCl~F@Pf5kqkfbvnG3!mPirDluSHif zN<$)!680zVXqn7XAX7#8LE~AM9@b(O{-us;e<}}paYam{S;YWS5~7~1KORwLyG8PZ z_I$eWFzUMZG~fd#H=1gDmSJD8hX*}sb19S1qAp3GSbIulKDl}OH!u${fZMVSD#%0% zZ=N22iJDw5C%a3uLc(z1*-Z9-dNw1F3XB71`-#=xBodOhf%B>*-`f?o1_%=#Cjl;X zcp88YOE>}wwl0gO0~s!;S}#-dmg;kvYPll|`zJ`OFtiHd*bQfv`#6gYwucM)F6Q^X zoenitnp%M?P}^9Ajh)p3${W5FatbSJpV(h)v`!ycs($=8jCsLvI;CDgiT8gdTtz)r zXw*>Dcucp{>y*g!iC2UzzE^^~fhzr)QYI%q;P#(OjBcE?(7jm77b1ol3Qxa^ij12z zBIWQA6@?$hyvg$@SpkJdPX$$`&(ds&_p151*Spw+0>9K2223?XqCjlY4F!twp|2N& zQb8NxR2?PCiQ%nP6K>cy$cPMLRUwodJ{mxkRW@J1OEhr#qa{B~&j>HF(|2f1f|&E` z60&$pq|!RUub-Oq6t}fJ#joL`I zb0j|U7{8jQq-kviYA9`MXln5feuG}>98>etUGkv}tYj!j(IxO?oTavePkx};jM~g@eQ1QGB^9>RN5)Y% zE$x!-wbnJ=9oi+COuSeU2H<8B6owa47W3iEop9{m4nJ=-F1#C46?=9%L7P20zJ8Vt zdRze}esV%tfOY`0f#uf0I2}eqLFLEZ+pX6J&ri1A>}mp?5fnU; zf>riJj0LLI&RDA&A)5qV3zS)Z`292g1JG@Kz4~bN(SyUCt>>?I{uOO-cL#LYB<*Q$)O~>JsmpZre0n)p{e9p5 z{`vj$`{(!1@1Ng4zkh!J{Qmj<^ZV!b&+nh#Kfix||NQ>>{qy_h_s{R2-#@?U^Zx@E KHCy=r$P@s2eLye(